{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021743714,0.0002541874,0.99726087,0.000695928,0.000423364,0.0005565164,0.00003080911,0.00013544687,0.0006211394],"genre_scores_gemma":[0.04256566,0.000103535735,0.9553143,0.0009205419,0.00044357605,0.00007788157,0.000105181665,0.00003454299,0.00043479353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757093,0.000025339536,0.0004594381,0.0010690136,0.0004468478,0.00042845221],"domain_scores_gemma":[0.9975931,0.0005369808,0.000325515,0.0010515298,0.00032697213,0.00016591272],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065595837,0.000335377,0.00041742835,0.001181485,0.00033731366,0.00043813416,0.0012651816,0.00016820051,0.000022559569],"category_scores_gemma":[0.000073288276,0.00032283406,0.00014136666,0.0012033001,0.00044165176,0.0008494022,0.0007473709,0.00031752107,0.000015302601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049436685,0.000085551335,0.000065731736,0.000056184057,0.00014348007,0.0000027799529,0.0011803354,0.012208646,0.00026481788,0.18394376,0.000042402826,0.80200136],"study_design_scores_gemma":[0.00013137764,0.000044751672,0.00013668649,0.000048664086,0.000121976176,0.000014655035,1.9811317e-7,0.9360004,0.00055045227,0.058534972,0.004072602,0.00034325366],"about_ca_topic_score_codex":0.000020649602,"about_ca_topic_score_gemma":0.0001785369,"teacher_disagreement_score":0.92379177,"about_ca_system_score_codex":0.00021476194,"about_ca_system_score_gemma":0.00015442217,"threshold_uncertainty_score":0.9999224},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019154322,0.00068901194,0.9883183,0.0012617771,0.0013307396,0.00023985951,0.0000050340973,0.00021633114,0.007937028],"genre_scores_gemma":[0.021857567,0.000123265,0.9747274,0.0011525345,0.0009054587,0.000012520024,0.00006475935,0.00003082222,0.0011256802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705696,0.00004690209,0.00042114104,0.0011205504,0.0008149396,0.0005394864],"domain_scores_gemma":[0.99762964,0.00025733325,0.00031399212,0.0014441316,0.000174322,0.00018057616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094579504,0.0003898332,0.00033795717,0.0005364028,0.00024644283,0.00053419056,0.0023707638,0.00028428723,0.00005604619],"category_scores_gemma":[0.00007613689,0.00035532838,0.00008082227,0.00036298617,0.00033429806,0.00093987986,0.0005971223,0.00077921996,0.00030290568],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010667892,0.000014232603,0.00002325868,0.0000095489795,0.0000036098916,0.000007809319,0.0002325829,0.0023916312,0.000043133485,0.05037479,0.000031877895,0.94686645],"study_design_scores_gemma":[0.00023317036,0.00009214827,0.00070626003,0.0001248362,0.000008039309,0.000062143605,8.7414634e-8,0.89579475,0.0002763651,0.072112344,0.029921027,0.00066885445],"about_ca_topic_score_codex":0.000026852838,"about_ca_topic_score_gemma":0.000016261938,"teacher_disagreement_score":0.9461976,"about_ca_system_score_codex":0.0001822672,"about_ca_system_score_gemma":0.00030833308,"threshold_uncertainty_score":0.99988985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011513503,0.0013441212,0.9832659,0.0021718396,0.0012546534,0.0077673136,0.000017750155,0.00021222552,0.0028148948],"genre_scores_gemma":[0.6919381,0.0015637033,0.2879473,0.012593612,0.0010323547,0.0028549812,0.000047986312,0.00014096039,0.0018810027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940274,0.00015481672,0.002004203,0.0011435736,0.0007667171,0.0019033225],"domain_scores_gemma":[0.99544007,0.0005887708,0.0018896745,0.0011074484,0.00027055634,0.00070346624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028357515,0.00041725664,0.0008909628,0.0005605029,0.00081931613,0.000023776667,0.00088573946,0.00036248352,0.00027878312],"category_scores_gemma":[0.00005611295,0.00038436727,0.00010101204,0.0005785376,0.00024820957,0.00014096296,0.0007164429,0.0014018652,0.00024006414],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013195012,0.00014499667,0.0012678724,0.007194656,0.00002294664,0.000013317129,0.0026069714,0.00062538526,0.000010860307,0.014547308,0.00022111175,0.9733314],"study_design_scores_gemma":[0.0063020242,0.0019448804,0.024723662,0.018399041,0.00036074125,0.00006585453,0.000051721803,0.570672,0.00017400779,0.24283896,0.13065168,0.0038154302],"about_ca_topic_score_codex":0.0005728366,"about_ca_topic_score_gemma":0.00020287752,"teacher_disagreement_score":0.9695159,"about_ca_system_score_codex":0.0008617355,"about_ca_system_score_gemma":0.002656318,"threshold_uncertainty_score":0.9998608},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014509869,0.00022027887,0.99601895,0.00013635769,0.00022538134,0.0007062028,0.0000054815505,0.0007983154,0.0018744994],"genre_scores_gemma":[0.11841293,0.000010931955,0.8808629,0.0002670046,0.00017606803,0.000024074789,0.000048237805,0.000038676673,0.0001591653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689364,0.000050780327,0.0005542909,0.0012501193,0.0006117579,0.0006394202],"domain_scores_gemma":[0.9980899,0.00013053649,0.000340519,0.00073800446,0.0004947752,0.00020623335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017951209,0.00048924907,0.00048080567,0.0007604445,0.00046214997,0.00064970396,0.0023750716,0.00034022055,0.0000010592904],"category_scores_gemma":[0.00008264145,0.0004681673,0.00012388421,0.00048768023,0.00017598765,0.0011202322,0.00030517703,0.0008248343,0.0000012490613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008595684,0.000022170769,0.0000029214157,0.00002760339,0.000004311422,6.0671056e-7,0.0012201796,0.82996583,0.00015590136,0.0049059517,0.000003906277,0.16368203],"study_design_scores_gemma":[0.00032627123,0.0003431702,6.3272523e-7,0.00005698323,0.000006613564,0.000026619475,2.2760649e-7,0.9540406,0.00063150586,0.04392788,0.00010817881,0.00053132954],"about_ca_topic_score_codex":0.00002299823,"about_ca_topic_score_gemma":0.00001213369,"teacher_disagreement_score":0.1631507,"about_ca_system_score_codex":0.00029447098,"about_ca_system_score_gemma":0.0006120407,"threshold_uncertainty_score":0.999777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033220393,0.0014208142,0.9963315,0.00005997733,0.0013930032,0.00023702331,0.0000019852914,0.00028374005,0.00023870506],"genre_scores_gemma":[0.006317945,0.00006607393,0.9931247,0.000086898115,0.00024360526,0.0000034195236,0.0000017706317,0.00004295369,0.00011261658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960839,0.000050003055,0.0005350051,0.0015362093,0.001053003,0.00074183696],"domain_scores_gemma":[0.99735427,0.00048454522,0.00029109724,0.0015421507,0.00013122661,0.00019668498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017881889,0.0005562733,0.00057125295,0.000787393,0.0001879827,0.00026578768,0.0028530317,0.00026564213,0.000006150784],"category_scores_gemma":[0.00015691272,0.00055276917,0.00010595136,0.00039325265,0.00039720244,0.00086471345,0.0019828838,0.0007252697,0.000018883135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013820066,0.0000056810118,0.0000067889655,0.000013028599,0.0000074398095,0.000040223767,0.00018090694,0.86452997,0.000119950055,0.0022500055,0.000001017459,0.1328436],"study_design_scores_gemma":[0.00010154468,0.000045088458,0.0000014097238,0.00018146155,0.000006560784,0.000023249224,6.465149e-8,0.7593097,0.00040678558,0.23915787,0.00030039833,0.00046586493],"about_ca_topic_score_codex":0.000009978648,"about_ca_topic_score_gemma":0.0000013687339,"teacher_disagreement_score":0.23690787,"about_ca_system_score_codex":0.0010787644,"about_ca_system_score_gemma":0.0003325088,"threshold_uncertainty_score":0.9996924},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007353155,0.0015378551,0.9939016,0.0004004119,0.0015119544,0.00115126,0.00010042409,0.00018259407,0.00047857],"genre_scores_gemma":[0.7120033,0.00037378658,0.2812623,0.002730321,0.001422465,0.00013108827,0.00009312466,0.00021533707,0.001768314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99425393,0.00016932013,0.00071966666,0.0024460095,0.001170601,0.0012404529],"domain_scores_gemma":[0.9940295,0.0031529714,0.0004903292,0.0015508673,0.00037454293,0.0004017518],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025608758,0.000802847,0.001035121,0.00097377226,0.0006517826,0.0013778219,0.0026622238,0.000448728,0.0000040570167],"category_scores_gemma":[0.00030093302,0.0007307397,0.00013471444,0.0005918934,0.001474825,0.00077601994,0.0021737183,0.0009628611,0.000010932295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009339531,0.000019129477,0.00096168387,0.0011653077,0.00010006675,0.00016638343,0.0067659505,0.014955145,0.0005618332,0.096302405,0.0005788593,0.8783298],"study_design_scores_gemma":[0.0010370861,0.00051361864,0.000077281875,0.0008902252,0.000019713138,0.000331977,0.0000055853725,0.8684908,0.0003551292,0.11725849,0.009889319,0.0011307849],"about_ca_topic_score_codex":0.000024514451,"about_ca_topic_score_gemma":0.000066293025,"teacher_disagreement_score":0.87719905,"about_ca_system_score_codex":0.00020730642,"about_ca_system_score_gemma":0.00031267662,"threshold_uncertainty_score":0.9996588},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003358784,0.0012741375,0.9930879,0.00022133865,0.00058268773,0.00092613447,0.000032277945,0.00001651776,0.0005002241],"genre_scores_gemma":[0.7502201,0.00074039557,0.23755692,0.0009928037,0.0061318083,0.0002044352,0.00034109768,0.00019409298,0.0036183363],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99863833,0.000013368552,0.00022092134,0.0006156586,0.00019509853,0.00031664144],"domain_scores_gemma":[0.9993088,0.000055214903,0.00012557908,0.00037968735,0.00006993035,0.000060785864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003646941,0.00024741708,0.00019670025,0.000097423814,0.00017940499,0.00009861961,0.00047167664,0.00021399166,0.000015211062],"category_scores_gemma":[0.000012844203,0.0001956981,0.00007491976,0.000047568374,0.00039684534,0.00000842569,0.00039334284,0.00016689814,0.0000055594633],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095056275,0.000040691113,0.00007412856,0.00006629042,0.0000847924,0.0000064179617,0.00037499273,0.0013139265,0.0612809,0.00016302838,0.00025927505,0.9362405],"study_design_scores_gemma":[0.008221543,0.0071405345,0.0018288967,0.0011339093,0.00059775723,0.00038995006,0.0000049714654,0.32431564,0.4050059,0.087538406,0.15761822,0.0062042684],"about_ca_topic_score_codex":0.000013688212,"about_ca_topic_score_gemma":0.000030363273,"teacher_disagreement_score":0.93003625,"about_ca_system_score_codex":0.000029126713,"about_ca_system_score_gemma":0.00008774471,"threshold_uncertainty_score":0.79803365},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023504176,0.00017647877,0.9913718,0.0011163577,0.0018880871,0.00026866986,0.0000046885434,0.0001495414,0.004789298],"genre_scores_gemma":[0.19533557,0.00012612982,0.7599291,0.043228485,0.0008877519,0.000016717731,0.000010667902,0.0000973484,0.0003682215],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959926,0.00006031188,0.00045857244,0.0016809615,0.0010580816,0.00074949744],"domain_scores_gemma":[0.9967523,0.00090551213,0.00024268393,0.001708314,0.0001627297,0.00022844535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000987338,0.0005517858,0.0004516716,0.0009222773,0.000411142,0.0007967502,0.0027995375,0.00042496138,0.000053974254],"category_scores_gemma":[0.0001420697,0.00048451874,0.00018760847,0.00090729684,0.00041816384,0.0006345598,0.0005806829,0.0011198664,0.0000390527],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020881995,0.00019028505,0.0004508077,0.00007928587,0.00004052433,0.0003537076,0.001855437,0.02008317,0.00010760843,0.16414586,0.00024642498,0.81242603],"study_design_scores_gemma":[0.0007702882,0.001287544,0.00083284016,0.00095793523,0.000021942638,0.00010703764,3.7687994e-7,0.461815,0.0021765134,0.516834,0.013302295,0.0018942162],"about_ca_topic_score_codex":0.000040136983,"about_ca_topic_score_gemma":0.00008347735,"teacher_disagreement_score":0.8105318,"about_ca_system_score_codex":0.000108940716,"about_ca_system_score_gemma":0.00026448938,"threshold_uncertainty_score":0.9997606},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010745313,0.000021813668,0.9851165,0.0004999182,0.0019613493,0.00050971785,0.00019782313,0.00011483019,0.0008327243],"genre_scores_gemma":[0.95425355,0.0000122756,0.043818463,0.0011559242,0.00035486187,0.000013415007,0.000025363768,0.00003231458,0.00033382012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675095,0.00007012692,0.00051373907,0.0012697651,0.00089407124,0.00050135347],"domain_scores_gemma":[0.99614114,0.0027168635,0.0003941178,0.00043571633,0.00016657011,0.00014561937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037817215,0.00036775012,0.00036809364,0.00027862965,0.0004103399,0.00044741613,0.0008261876,0.00021421748,0.00013463639],"category_scores_gemma":[0.001756406,0.00031599015,0.00008722275,0.00034815999,0.0005407693,0.00030132013,0.00031543546,0.0007374667,0.00010904548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021017519,0.000093058894,0.0017613036,0.00003297152,0.000016902948,0.00020432525,0.00056402513,0.050625045,0.20961545,0.008098383,0.00006293478,0.72890455],"study_design_scores_gemma":[0.0002180863,0.00019397715,0.0014225624,0.0001591612,0.000012762451,0.000010350058,4.1891857e-7,0.7954069,0.016029403,0.18560687,0.00030579357,0.00063371926],"about_ca_topic_score_codex":0.00048488958,"about_ca_topic_score_gemma":0.000418002,"teacher_disagreement_score":0.94350827,"about_ca_system_score_codex":0.00034856357,"about_ca_system_score_gemma":0.0003100862,"threshold_uncertainty_score":0.9999292},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.0353397e-7,0.51532644,0.4830827,0.00016963338,0.00019157906,0.00081510446,0.0000046827417,0.00036137606,0.000048243106],"genre_scores_gemma":[0.000004291593,0.6952966,0.30114427,0.0032248127,0.00013513712,0.0001605266,0.00001043885,0.000023173667,7.3474126e-7],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956658,0.00034219274,0.000793078,0.001842445,0.0006808601,0.0006756563],"domain_scores_gemma":[0.99737746,0.0004876604,0.00041159656,0.0012766983,0.00022857201,0.00021798948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010606186,0.0007018084,0.001519173,0.001430697,0.00029761184,0.00041231333,0.0025485926,0.0003487119,0.000008307125],"category_scores_gemma":[0.00034544626,0.0005675929,0.000285156,0.00353558,0.0005857927,0.0008035184,0.0009026537,0.0010083966,0.00006458552],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.9106388e-7,0.000037932685,3.0930067e-7,0.0040024924,0.000005006874,0.000046442427,0.00007269984,1.4171627e-7,9.571414e-7,0.000022366663,0.00016567396,0.9956456],"study_design_scores_gemma":[0.00017823206,0.0008195569,0.0000025022055,0.30167285,0.000080243706,0.0037464504,1.8498807e-7,0.0020242725,0.0011118382,0.011124056,0.6770689,0.0021709441],"about_ca_topic_score_codex":0.000019299412,"about_ca_topic_score_gemma":0.0000059772337,"teacher_disagreement_score":0.99347466,"about_ca_system_score_codex":0.00032155067,"about_ca_system_score_gemma":0.00056835293,"threshold_uncertainty_score":0.99967754},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016275715,0.00019662172,0.9956252,0.0006087392,0.0008700836,0.0011174906,0.000005430561,0.0001124934,0.0013011845],"genre_scores_gemma":[0.5679835,0.000026849093,0.43034142,0.0007764139,0.00075888657,0.000051953033,0.000005454618,0.000032136497,0.000023350585],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99624056,0.00009393091,0.00091246003,0.0013173448,0.0007183815,0.0007173455],"domain_scores_gemma":[0.99722904,0.0006545454,0.00036106867,0.0014130421,0.00025989045,0.0000824377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020240485,0.0005070578,0.00045547335,0.00081201707,0.0003020171,0.00082656473,0.0046220655,0.00038312204,0.00001520126],"category_scores_gemma":[0.00013969993,0.00040870122,0.00014949888,0.00074694696,0.0009689184,0.00075019134,0.0006132429,0.0008168202,0.000016095197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004329009,0.00003579087,0.000007658957,0.000010016411,0.0000028169627,0.00001881539,0.0014913642,0.026291527,0.00030808715,0.34952292,0.000005226052,0.62230146],"study_design_scores_gemma":[0.000008073641,0.00013589459,0.0000038028932,0.00007857642,0.0000040287587,0.0000244946,9.677743e-7,0.485771,0.01932132,0.49417233,0.0001866241,0.00029285846],"about_ca_topic_score_codex":0.00017114004,"about_ca_topic_score_gemma":0.0014514019,"teacher_disagreement_score":0.62200856,"about_ca_system_score_codex":0.00028398627,"about_ca_system_score_gemma":0.00053268095,"threshold_uncertainty_score":0.9998365},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002154565,0.00023742381,0.99094415,0.0003008621,0.0019171773,0.00042566116,0.00000128158,0.00033044405,0.0036884116],"genre_scores_gemma":[0.5860662,0.000020408675,0.40968138,0.0027804987,0.0006742447,0.000017171053,0.0000043115583,0.00007325688,0.00068255235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941926,0.00008102529,0.00089774205,0.002468369,0.0012003118,0.0011599369],"domain_scores_gemma":[0.99638873,0.00040591,0.00042684498,0.0022655828,0.0001865422,0.0003264123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00197232,0.0007600332,0.0007611553,0.001458545,0.0002936846,0.00050716114,0.0051007885,0.00051562674,0.00005806679],"category_scores_gemma":[0.00011245419,0.0007149828,0.00015955797,0.0010932079,0.00055506977,0.00024074754,0.0023880359,0.0015813361,0.00008067181],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014604662,0.00017365783,0.00012730918,0.00012252551,0.000015755477,0.00070587645,0.005909367,0.04286058,0.000070836184,0.018422946,0.000011244976,0.9315653],"study_design_scores_gemma":[0.00041008292,0.00059205556,0.0005630047,0.0014238979,0.00001479969,0.00013239852,0.0000016967605,0.5333086,0.0019097438,0.45892537,0.0010511341,0.0016671927],"about_ca_topic_score_codex":0.00014265742,"about_ca_topic_score_gemma":0.0003469311,"teacher_disagreement_score":0.9298981,"about_ca_system_score_codex":0.0003767975,"about_ca_system_score_gemma":0.0005084767,"threshold_uncertainty_score":0.99953014},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042688224,0.00012224299,0.99668115,0.00038776913,0.0006858507,0.00029873248,0.0000016248231,0.00012368495,0.0012720725],"genre_scores_gemma":[0.618721,0.000008409432,0.38072005,0.00023287474,0.00017267172,0.000006146965,0.000007460312,0.000016028873,0.00011532621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966383,0.00005542632,0.00067435723,0.0013029247,0.0008547993,0.0004741787],"domain_scores_gemma":[0.99787796,0.0007392774,0.0002749274,0.0008019741,0.00019435555,0.00011150068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001192117,0.000388994,0.00040845858,0.00061903324,0.0001663965,0.0003144387,0.0012948097,0.000366288,0.000012257189],"category_scores_gemma":[0.00016057238,0.00039065452,0.00007975582,0.00053557183,0.00019665925,0.0005715206,0.00032958374,0.0007868966,0.00002328692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025126974,0.000008678472,0.00013395216,0.000016817392,0.0000012592733,0.000004646048,0.00017941589,0.72291803,0.000010491194,0.16253115,8.79783e-7,0.11419219],"study_design_scores_gemma":[0.00009353255,0.000031308726,0.0004192112,0.00023327998,0.000001957813,0.000008980565,1.5665451e-8,0.5993538,0.000008525164,0.39956284,0.000027203589,0.0002593299],"about_ca_topic_score_codex":0.000083500956,"about_ca_topic_score_gemma":0.000109153974,"teacher_disagreement_score":0.6182941,"about_ca_system_score_codex":0.0003852242,"about_ca_system_score_gemma":0.00031623105,"threshold_uncertainty_score":0.99985456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057358426,0.00037729953,0.9899711,0.00034934914,0.0047185994,0.0006712137,0.000010225658,0.00032196348,0.0035228638],"genre_scores_gemma":[0.095544666,0.000022969036,0.90088946,0.00046026072,0.0015123575,0.00006971801,0.00001135836,0.000081349586,0.0014078871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936103,0.00006966361,0.0010415694,0.0029939807,0.001122556,0.0011618837],"domain_scores_gemma":[0.994812,0.00082995975,0.00056583947,0.0028427783,0.0006219432,0.00032743905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019464229,0.0008194181,0.00093291164,0.0008806332,0.0004224324,0.00076809834,0.004508735,0.0006031219,0.000020722835],"category_scores_gemma":[0.00020270908,0.00076374586,0.00034347663,0.00063759525,0.0006221289,0.0011978529,0.0017519742,0.00073569233,0.00003188291],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011439363,0.00004495438,0.000017688957,0.0001388017,0.000023124832,0.00006187217,0.0012842322,0.039517887,0.000175755,0.031126365,0.000052560776,0.9275453],"study_design_scores_gemma":[0.00035618135,0.0003440356,0.000035064866,0.00076666864,0.0000138695,0.00019316305,3.9309666e-7,0.8296997,0.003280618,0.1619806,0.002162845,0.0011668423],"about_ca_topic_score_codex":0.00035079807,"about_ca_topic_score_gemma":0.000042478852,"teacher_disagreement_score":0.9263785,"about_ca_system_score_codex":0.00054811506,"about_ca_system_score_gemma":0.0009949323,"threshold_uncertainty_score":0.9994814},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029492198,0.000118600765,0.99180436,0.0005710441,0.0015906922,0.00029377217,0.000008151104,0.000060497714,0.005257972],"genre_scores_gemma":[0.8607835,0.0000029693404,0.13866884,0.00022155857,0.0001532568,0.000001480848,0.000005161132,0.000009666002,0.00015357639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963849,0.00016157971,0.0002899429,0.0009205947,0.001992419,0.00025057286],"domain_scores_gemma":[0.9967742,0.000525131,0.00024288318,0.0011099745,0.0012353724,0.00011246331],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029745651,0.00027360913,0.00031529967,0.0005381137,0.00017497367,0.00012686479,0.0019109407,0.00020768982,0.000015108155],"category_scores_gemma":[0.00050246686,0.000268619,0.00008280403,0.0004905458,0.0008026549,0.0004116136,0.00039894957,0.0004074796,0.000017002685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052216987,0.00007991242,0.0000780392,0.00004102435,0.000009523298,0.0000351926,0.0004569128,0.8593153,0.00005123028,0.054701596,0.00007928861,0.0850998],"study_design_scores_gemma":[0.00034859538,0.000255316,0.00017832637,0.00028725067,0.000018255796,0.000010321395,1.8740228e-7,0.9208848,0.0011278085,0.075310394,0.0012967731,0.00028199237],"about_ca_topic_score_codex":0.000031186497,"about_ca_topic_score_gemma":0.000044338034,"teacher_disagreement_score":0.8604886,"about_ca_system_score_codex":0.00090676855,"about_ca_system_score_gemma":0.002606795,"threshold_uncertainty_score":0.9999766},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048216153,0.00011883178,0.99469066,0.00006373908,0.0025351117,0.00033133305,0.000011579899,0.00015265378,0.0016139185],"genre_scores_gemma":[0.104952715,0.000016304579,0.89451164,0.00019178694,0.00018482741,0.000005604853,0.000020794043,0.000019902758,0.00009641048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702543,0.00003328601,0.000684891,0.0009529379,0.00091070344,0.00039277298],"domain_scores_gemma":[0.99708015,0.00033636714,0.00064570026,0.0013782727,0.00045357912,0.00010591148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011015385,0.00033693822,0.0003550423,0.0009463028,0.00020854233,0.00015786436,0.0020413916,0.0003524063,0.000031667525],"category_scores_gemma":[0.00018555715,0.00033894295,0.00010837665,0.00063956087,0.0007391176,0.0010112572,0.00033952424,0.0006304127,0.00002868574],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009428635,0.000020365247,0.00008764757,0.00007468073,0.000011404706,0.000011028993,0.00054731185,0.02662464,0.0011489938,0.114564285,0.000011014296,0.8568892],"study_design_scores_gemma":[0.0004126859,0.00031300954,0.012534112,0.00048596898,0.000024034844,0.00017958756,6.7354904e-7,0.6239231,0.025682552,0.33398587,0.0012647599,0.0011936501],"about_ca_topic_score_codex":0.00002169166,"about_ca_topic_score_gemma":0.000020906247,"teacher_disagreement_score":0.85569555,"about_ca_system_score_codex":0.00033648082,"about_ca_system_score_gemma":0.00034522763,"threshold_uncertainty_score":0.99990624},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031884693,0.0002860595,0.97698796,0.002281395,0.00067876326,0.0005738217,0.00008857489,0.0000769664,0.018707605],"genre_scores_gemma":[0.9856196,0.000015916796,0.012215662,0.0012127676,0.00061963376,0.000014677129,0.000009123771,0.000025390753,0.00026722552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578655,0.000078888435,0.0005650038,0.0007974441,0.0018897527,0.0008823379],"domain_scores_gemma":[0.99752676,0.00046755857,0.00037259067,0.0005481418,0.00072855473,0.00035638202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021833803,0.0003897776,0.00077128643,0.0005364016,0.00042021985,0.00035985865,0.0029162671,0.00049205596,0.00007368421],"category_scores_gemma":[0.00039797716,0.0003403974,0.0002125471,0.00043098387,0.0025504383,0.00089987967,0.00052330486,0.0007837557,0.000008724566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017388933,0.00009623184,0.00074950623,0.00006605078,0.000037195623,0.000037465965,0.0018590222,0.2978804,0.000027991671,0.06913316,0.00007922237,0.62985986],"study_design_scores_gemma":[0.0015612382,0.00015949261,0.00022123242,0.00019517638,0.000041501127,0.0000020515674,9.246178e-7,0.7966889,0.00010579969,0.19886883,0.0015495066,0.0006053301],"about_ca_topic_score_codex":0.00053502363,"about_ca_topic_score_gemma":0.0011067804,"teacher_disagreement_score":0.9853008,"about_ca_system_score_codex":0.0003597153,"about_ca_system_score_gemma":0.0043024947,"threshold_uncertainty_score":0.9999048},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018271906,0.00046483986,0.99127644,0.00029381725,0.0041503645,0.0004020757,0.000010044177,0.0002399882,0.0029796858],"genre_scores_gemma":[0.9863865,0.000007767243,0.010098435,0.00075216964,0.0014225714,0.000007775134,0.000013398013,0.000046376877,0.0012650228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942305,0.00007842306,0.00082024885,0.00196272,0.001966731,0.0009413892],"domain_scores_gemma":[0.99678034,0.0007779302,0.00047572292,0.0011367154,0.0004866372,0.0003426823],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017683945,0.0007635474,0.0010577533,0.0010254016,0.00025240405,0.0008215775,0.004390712,0.00049724436,0.000015632011],"category_scores_gemma":[0.0001668648,0.0006484712,0.0002433977,0.0006708474,0.00040390366,0.00045108135,0.0011453981,0.0011654004,0.00023622642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004253938,0.000021487102,0.000006100682,0.00003757481,0.00004027964,0.00009973707,0.0005995855,0.8490097,0.00000490057,0.110285275,0.0003620063,0.039529085],"study_design_scores_gemma":[0.0002451137,0.00031473234,0.0000065546283,0.0006872749,0.000027616867,0.00003525176,3.8673542e-7,0.9895857,0.000035085806,0.0066653863,0.0016495687,0.0007473219],"about_ca_topic_score_codex":0.000027216076,"about_ca_topic_score_gemma":0.00003305821,"teacher_disagreement_score":0.9862038,"about_ca_system_score_codex":0.00058094325,"about_ca_system_score_gemma":0.0005713453,"threshold_uncertainty_score":0.99959666},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002728576,0.00035020075,0.994836,0.00006963845,0.00031206742,0.00082852563,0.0000031938316,0.00073213724,0.00013967253],"genre_scores_gemma":[0.44311556,0.000004466693,0.55654955,0.00013177808,0.000105761625,0.000034781668,3.5990817e-7,0.000030558178,0.000027151684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674225,0.000025510633,0.00043139546,0.001440005,0.00070068985,0.00066014106],"domain_scores_gemma":[0.99768406,0.00024904165,0.00019214327,0.0013295931,0.00029528278,0.00024986244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009514057,0.0005907769,0.0005150725,0.0008407003,0.00018727918,0.00039390248,0.002127057,0.0002459798,0.0000018724551],"category_scores_gemma":[0.00004093991,0.0005488125,0.000051688585,0.0005413538,0.0003402421,0.0008059815,0.002128371,0.00086266827,0.000003907129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001991609,0.000085958425,0.00032729513,0.000085164815,0.000010694768,0.0013388569,0.0091008665,0.030928766,0.000021101107,0.0051637557,0.0000028979186,0.95293266],"study_design_scores_gemma":[0.0001472838,0.00026441267,0.000016912172,0.000272438,0.000011643793,0.0027100649,4.0654518e-7,0.96947527,0.000078651516,0.026343392,0.00007085422,0.00060869585],"about_ca_topic_score_codex":0.00005593452,"about_ca_topic_score_gemma":0.00007673835,"teacher_disagreement_score":0.952324,"about_ca_system_score_codex":0.00020374898,"about_ca_system_score_gemma":0.00027039403,"threshold_uncertainty_score":0.9996963},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035036653,0.00010314158,0.96181446,0.00003568178,0.000961602,0.00041826259,0.0000011439109,0.00007590652,0.0015531225],"genre_scores_gemma":[0.91314924,0.00000840651,0.0860313,0.00008073534,0.00015709443,0.0000050917233,0.000001279968,0.000023360726,0.00054349564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966842,0.00011938827,0.0005895003,0.0013143691,0.0008683954,0.00042415014],"domain_scores_gemma":[0.99808514,0.00021361248,0.0004239555,0.00091765285,0.00021692416,0.00014270385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014631259,0.0003956755,0.00055837334,0.0006088498,0.0002350974,0.0002881064,0.0014499906,0.00019087644,0.000011944219],"category_scores_gemma":[0.00003643578,0.0003528123,0.00009269128,0.0002946009,0.00030639008,0.00070434506,0.0009335338,0.00072455534,0.0000045145744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018210301,0.0007657897,0.20298287,0.00025620978,0.00012929196,0.00027635455,0.03562907,0.032375075,0.0014088283,0.1426893,0.000006610431,0.5834624],"study_design_scores_gemma":[0.0012870418,0.0054226383,0.24075177,0.0024373925,0.00007462988,0.00015075304,0.000086814165,0.70704824,0.0005343969,0.03706501,0.0024400027,0.0027013088],"about_ca_topic_score_codex":0.00013093988,"about_ca_topic_score_gemma":0.00006722994,"teacher_disagreement_score":0.87811255,"about_ca_system_score_codex":0.00019243294,"about_ca_system_score_gemma":0.00025917738,"threshold_uncertainty_score":0.9998924},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052764285,0.00047432823,0.986649,0.00048724102,0.0042198813,0.0012008538,0.0000022019733,0.0005558607,0.0011342432],"genre_scores_gemma":[0.7883979,0.0000036754382,0.20755081,0.0007787891,0.0013405185,0.000009203927,0.000001418401,0.000082242586,0.0018354346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930245,0.00014035126,0.0009812571,0.002804001,0.001842032,0.0012078386],"domain_scores_gemma":[0.99520177,0.00044296993,0.0005223021,0.0028571072,0.0004969994,0.0004788741],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031363196,0.00095746986,0.00096731953,0.001208132,0.0006371747,0.0009985273,0.0050900383,0.00031202557,0.000007118516],"category_scores_gemma":[0.00011676663,0.0007128422,0.00022292463,0.0010722623,0.00060310814,0.000101687656,0.0065640807,0.0013364879,0.00009409415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000089818695,0.0004059647,0.00013160847,0.000042949836,0.000054162923,0.01903965,0.0074182805,0.24273862,0.0000025410525,0.0019241555,0.00013663521,0.7280964],"study_design_scores_gemma":[0.001121346,0.0009804041,0.000030071795,0.00029162515,0.000028407669,0.0034017959,0.000012123658,0.9829351,0.000015751819,0.0068127755,0.0032503176,0.0011203279],"about_ca_topic_score_codex":0.0002560642,"about_ca_topic_score_gemma":0.00038406329,"teacher_disagreement_score":0.78312147,"about_ca_system_score_codex":0.0006130967,"about_ca_system_score_gemma":0.00060555065,"threshold_uncertainty_score":0.9995323},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009534703,0.0059000845,0.94974816,0.00035443975,0.042312104,0.00041227075,0.000004064359,0.00054194866,0.0006315973],"genre_scores_gemma":[0.53469455,0.0012043158,0.45540136,0.0005670358,0.0070879557,0.00025726497,0.00008225056,0.00042624705,0.0002790416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971282,0.000027762928,0.00056321855,0.00088782003,0.0005638474,0.0008291683],"domain_scores_gemma":[0.9985032,0.0002246733,0.000060224585,0.00097305945,0.00008695668,0.00015190199],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008461622,0.00047172606,0.00049400766,0.0015933008,0.000047271435,0.00012062913,0.0013070275,0.00055494776,0.000004889931],"category_scores_gemma":[0.00023549054,0.00051158434,0.000059282287,0.002114922,0.00009538654,0.00021387017,0.00018982856,0.0013349543,0.000054652082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013383063,0.000012385921,0.00003696037,0.0003250413,0.000004118348,0.00003197975,0.0011106078,0.73705524,0.00014728855,0.000007878417,0.0044768164,0.2567903],"study_design_scores_gemma":[0.00021426067,0.000067333465,0.00849639,0.0023348194,0.000005689229,0.00006262738,0.0000025598192,0.90253043,0.0018038728,0.0007066098,0.08239242,0.001383006],"about_ca_topic_score_codex":0.000027093569,"about_ca_topic_score_gemma":0.00043430133,"teacher_disagreement_score":0.5345992,"about_ca_system_score_codex":0.0010680549,"about_ca_system_score_gemma":0.00017235271,"threshold_uncertainty_score":0.99973357},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12425829,0.0049717287,0.86600244,0.0009308076,0.0013538237,0.00091374654,0.00014116625,0.00005174766,0.0013762703],"genre_scores_gemma":[0.9491093,0.00030507095,0.04950321,0.00062684366,0.00020886482,0.0000050364515,0.000029711688,0.000016268963,0.00019567988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746835,0.000021748767,0.00038902857,0.0014044518,0.00034947868,0.00036692416],"domain_scores_gemma":[0.9977256,0.00008401122,0.0002238183,0.0015421254,0.00024205782,0.0001823798],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008304181,0.00028087056,0.0003662339,0.00015706795,0.00011572759,0.00010301053,0.0019406256,0.00031601757,0.000013358805],"category_scores_gemma":[0.0013965281,0.0002167443,0.000039344093,0.00019251659,0.0050415522,0.000023274053,0.00251608,0.00035545896,0.0000030381857],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046558805,0.000044110366,0.0003267079,0.0001160168,0.000014353957,0.0000032387525,0.00009775067,0.00006710765,0.080209576,0.000121251236,0.0000729405,0.9188804],"study_design_scores_gemma":[0.0069765444,0.010190889,0.01857493,0.0042586527,0.00016652863,0.0002571884,0.000011703828,0.52212876,0.28775078,0.06337289,0.079140715,0.007170423],"about_ca_topic_score_codex":0.00005094126,"about_ca_topic_score_gemma":0.000035644873,"teacher_disagreement_score":0.91170996,"about_ca_system_score_codex":0.000034121585,"about_ca_system_score_gemma":0.0008832956,"threshold_uncertainty_score":0.9976662},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046029435,0.00006179714,0.9916688,0.0015909455,0.001125774,0.0006514032,0.00005896554,0.00013591292,0.000103425504],"genre_scores_gemma":[0.38381717,0.000004116623,0.6063803,0.009045207,0.00047809313,0.000031007014,0.000116716845,0.000051595995,0.000075780255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944551,0.00026911392,0.0010751892,0.0013091426,0.0022314396,0.000660004],"domain_scores_gemma":[0.99458474,0.002078022,0.0009262768,0.0017891346,0.0004375838,0.00018423288],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019251776,0.00064420345,0.0006827106,0.00065544934,0.00068407995,0.0012019649,0.0030859164,0.00029980743,0.000027400083],"category_scores_gemma":[0.0003325491,0.0004901258,0.00025566405,0.0007246267,0.0013886932,0.0010091034,0.0015140948,0.0011377975,0.000010018979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020788482,0.00011860375,0.0012931254,0.00046163358,0.00011226033,0.000032418815,0.0036456713,0.5017468,0.0006746754,0.118573055,0.00045793224,0.37286305],"study_design_scores_gemma":[0.00039983672,0.00016246078,0.002517356,0.00047042925,0.00003951723,0.000025020094,0.0000010384634,0.96955717,0.00072566036,0.024114624,0.0013763645,0.00061050704],"about_ca_topic_score_codex":0.00008063547,"about_ca_topic_score_gemma":0.00010583555,"teacher_disagreement_score":0.46781042,"about_ca_system_score_codex":0.0002310184,"about_ca_system_score_gemma":0.0009492683,"threshold_uncertainty_score":0.9998349},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012434243,0.0012529203,0.9965236,0.000120304474,0.0014469441,0.00029728713,0.0000114732875,0.00011633671,0.00010678188],"genre_scores_gemma":[0.21759439,0.000031529533,0.78194696,0.000175633,0.00016335568,0.0000022673753,0.0000047201065,0.0000160688,0.00006510651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715275,0.00008186473,0.0004585211,0.0010551662,0.00076526986,0.00048640597],"domain_scores_gemma":[0.99797696,0.00034287933,0.00030283755,0.0008787748,0.00027747743,0.00022105704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019483754,0.00032058044,0.00036494285,0.001956395,0.0002905502,0.0006593274,0.001305588,0.00026910414,0.000006443748],"category_scores_gemma":[0.00012196027,0.00030282376,0.000067558365,0.0031448903,0.00022649774,0.0006022688,0.00090185367,0.0003219367,0.000014022425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033337285,0.00004002773,0.00015367632,0.00013211452,0.000018082972,0.000013659087,0.0011353914,0.15360963,0.00032632786,0.0182444,0.000007073887,0.8263163],"study_design_scores_gemma":[0.00017930113,0.00002683861,0.00016616672,0.00008621732,0.000012919165,0.00007873898,4.4549148e-7,0.99590033,0.001783412,0.0010891256,0.00032101787,0.0003554851],"about_ca_topic_score_codex":0.00005383223,"about_ca_topic_score_gemma":0.0000067945452,"teacher_disagreement_score":0.8422907,"about_ca_system_score_codex":0.0003445288,"about_ca_system_score_gemma":0.00020254176,"threshold_uncertainty_score":0.99994236},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067391206,0.00033873922,0.9884226,0.00047175342,0.004063511,0.0004691839,0.0000055128885,0.00030550733,0.0052492833],"genre_scores_gemma":[0.8871357,0.00019458529,0.10752194,0.0026895301,0.0012323688,0.000022320462,0.000013523515,0.00012463081,0.0010654406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926632,0.00016571459,0.0011537947,0.0029427984,0.0014124744,0.0016620184],"domain_scores_gemma":[0.993587,0.0012701614,0.00054997695,0.0039088405,0.00030087898,0.00038315155],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001486639,0.0011171532,0.0012212291,0.0015440146,0.00026563962,0.0009144723,0.008685779,0.0009334348,0.00003653734],"category_scores_gemma":[0.00016539998,0.0010791224,0.00025123244,0.0013403039,0.0010836695,0.000509327,0.003838792,0.0023796647,0.00004954161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011612567,0.000027828966,0.00015502065,0.00002220357,0.000009062197,0.00020644027,0.0002458101,0.7168073,0.000036665697,0.024904756,0.000042909393,0.2575304],"study_design_scores_gemma":[0.0006454487,0.00017749076,0.00013739736,0.0009642214,0.0000068029894,0.0000803687,1.4237864e-7,0.97374934,0.0002825569,0.02186119,0.0008923328,0.0012027242],"about_ca_topic_score_codex":0.00006358963,"about_ca_topic_score_gemma":0.0005999624,"teacher_disagreement_score":0.88646173,"about_ca_system_score_codex":0.0006630575,"about_ca_system_score_gemma":0.000438945,"threshold_uncertainty_score":0.99992186},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025198492,0.00030445555,0.9941186,0.002443212,0.00062368327,0.0006925441,0.0000029408884,0.00082798867,0.0007345936],"genre_scores_gemma":[0.16422379,0.000025094223,0.83415693,0.0009805586,0.000103829385,0.000060713846,0.000010765248,0.00003869068,0.0003996399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561423,0.000037202517,0.0005928924,0.0019199547,0.0010867264,0.0007490213],"domain_scores_gemma":[0.9964557,0.00030848687,0.000553778,0.0020981207,0.00042949483,0.00015436845],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006586224,0.0006343089,0.0005182157,0.0011610577,0.0004372124,0.0010489929,0.0038077051,0.0004800614,0.000019812698],"category_scores_gemma":[0.000101643855,0.00053569797,0.00006969118,0.0009849083,0.0008846429,0.0012791103,0.00078729924,0.0009864664,0.00011452021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004624595,0.00010074528,0.0001412026,0.00005752506,0.000012210033,0.00001941032,0.00026473548,0.0025133132,0.002262351,0.08017732,0.00002272678,0.9144238],"study_design_scores_gemma":[0.0007017969,0.00018608055,0.00033892915,0.0003759676,0.000008430133,0.000014301344,7.600787e-7,0.9580389,0.0034102143,0.03572877,0.00046887065,0.0007269608],"about_ca_topic_score_codex":0.000037628368,"about_ca_topic_score_gemma":0.00006925513,"teacher_disagreement_score":0.9555256,"about_ca_system_score_codex":0.00048039245,"about_ca_system_score_gemma":0.0005798036,"threshold_uncertainty_score":0.999988},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086284295,0.00015116452,0.9914878,0.0005775539,0.0002843318,0.0006645633,0.000015512353,0.00020303144,0.0057531926],"genre_scores_gemma":[0.8486093,0.000011573775,0.14910248,0.0005978771,0.0003024976,0.000026130467,0.000019246438,0.000048096514,0.0012827726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99389404,0.00004796949,0.0010668043,0.0016878066,0.0027066234,0.0005967521],"domain_scores_gemma":[0.99569327,0.0007004756,0.00055718835,0.0022628452,0.0005518435,0.00023439426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024949806,0.0005494194,0.0006452209,0.00090438547,0.00045820622,0.0007932832,0.003116762,0.00034139035,0.00012259542],"category_scores_gemma":[0.00011974301,0.000385884,0.00019933208,0.0008007173,0.0005245557,0.0003730503,0.00081559253,0.00065088447,0.00013117753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012006363,0.000027708238,0.000023333318,0.000019049601,0.0000057263214,0.000019920863,0.00049757375,0.82942593,0.00049418997,0.019032106,0.00007945733,0.15036298],"study_design_scores_gemma":[0.0002075845,0.000106556436,0.0000025355575,0.0001358507,0.00001188823,0.000008449051,0.0000010121089,0.8335333,0.003842973,0.15555638,0.006122444,0.0004710307],"about_ca_topic_score_codex":0.000033904667,"about_ca_topic_score_gemma":0.000027639344,"teacher_disagreement_score":0.8477465,"about_ca_system_score_codex":0.000164581,"about_ca_system_score_gemma":0.00031723143,"threshold_uncertainty_score":0.99985933},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015304275,0.0014439477,0.9871332,0.0008508269,0.0017723357,0.00037989253,0.000004073861,0.00021660083,0.008046097],"genre_scores_gemma":[0.56063545,0.0006387019,0.42748618,0.004503347,0.0011380689,0.00006205706,0.000010107289,0.0001585576,0.0053675156],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963389,0.00009891458,0.0006692924,0.0011493971,0.0010326592,0.00071080634],"domain_scores_gemma":[0.9941715,0.0022424494,0.00048046466,0.002745748,0.00021894649,0.00014086721],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023463327,0.0004981294,0.0005267359,0.00040309379,0.00039273864,0.000637698,0.007260191,0.0002765344,0.000057386555],"category_scores_gemma":[0.000175233,0.00032819243,0.00018364229,0.00050822383,0.0017456118,0.00059924036,0.0023406097,0.0006733409,0.0001410159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021796059,0.000011076461,0.000004195874,0.000013863423,0.000010220287,0.000009433859,0.0002499099,0.0004156707,0.000059313756,0.43669376,0.00007312652,0.56245726],"study_design_scores_gemma":[0.00014555141,0.00009752146,0.0001444627,0.0002204877,0.0000064806927,0.00004182411,3.4985786e-7,0.18028061,0.0010149627,0.8149242,0.0027365459,0.00038699],"about_ca_topic_score_codex":0.000014931176,"about_ca_topic_score_gemma":0.000013117146,"teacher_disagreement_score":0.56207025,"about_ca_system_score_codex":0.00011673491,"about_ca_system_score_gemma":0.00044800236,"threshold_uncertainty_score":0.99991703},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007886278,0.0011915484,0.98872864,0.0008098435,0.00093206647,0.00019888658,0.0000013997859,0.000076278564,0.0072726933],"genre_scores_gemma":[0.46179348,0.00016483219,0.53606224,0.0011362901,0.00018495394,0.0000050225963,8.0174857e-7,0.0000211639,0.00063117116],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778086,0.00001556893,0.00035213566,0.0008972598,0.0005762725,0.00037787794],"domain_scores_gemma":[0.9981858,0.00037603272,0.00020026634,0.0009793529,0.00016221582,0.00009630394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003592209,0.0003172302,0.000496997,0.0004333023,0.0000837405,0.00022819352,0.0020418242,0.00022674273,0.000024586636],"category_scores_gemma":[0.00008048796,0.0002556459,0.00007065901,0.00024336479,0.0009064672,0.0004335452,0.0012504619,0.00032923967,0.000023177661],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016151653,0.00001244545,0.00011678063,0.000045986697,0.000008528765,0.00002444131,0.00042178584,0.00044720015,0.00023265483,0.07902006,0.000051374198,0.9196171],"study_design_scores_gemma":[0.0005232998,0.00045910114,0.0033684506,0.000558706,0.000017427212,0.00021004012,6.0842683e-7,0.395271,0.0053681815,0.58946264,0.003614079,0.0011464325],"about_ca_topic_score_codex":0.00005055233,"about_ca_topic_score_gemma":0.000027460428,"teacher_disagreement_score":0.9184707,"about_ca_system_score_codex":0.000053609798,"about_ca_system_score_gemma":0.00023327375,"threshold_uncertainty_score":0.99998957},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016698013,0.0005439293,0.99793947,0.000042437325,0.0003821324,0.00066417886,0.000019273071,0.000038171438,0.00020344564],"genre_scores_gemma":[0.4170647,0.000035910238,0.58217466,0.00015711496,0.00041935814,0.00005472523,0.00001591612,0.000039121558,0.000038474976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985316,0.0000080432055,0.00035354885,0.000401913,0.00041295387,0.000291959],"domain_scores_gemma":[0.99894243,0.00010750526,0.00008213795,0.00047640322,0.00031616454,0.000075338365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057596265,0.00023807373,0.00032300016,0.0002753699,0.00009559187,0.000049487193,0.00067562924,0.0001593126,0.000011449131],"category_scores_gemma":[0.00005519072,0.00017697639,0.00010075688,0.00027121077,0.00013439407,0.00017550137,0.00013085855,0.00026244164,0.0000019370766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043356813,0.0000034429916,0.0000021856615,0.0000503931,0.000013112644,2.674423e-7,0.00029090798,0.92378145,0.00010735324,0.000097395496,0.000008457183,0.07564069],"study_design_scores_gemma":[0.00009919405,0.000092460985,6.87018e-7,0.00007327872,0.000018244638,7.13142e-7,7.184804e-7,0.9859651,0.0015882156,0.0116813425,0.00029759534,0.00018249893],"about_ca_topic_score_codex":0.000008371393,"about_ca_topic_score_gemma":0.000017015222,"teacher_disagreement_score":0.4168977,"about_ca_system_score_codex":0.00015226375,"about_ca_system_score_gemma":0.0001359274,"threshold_uncertainty_score":0.72168875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003494873,0.00006496083,0.99484676,0.0008760801,0.0010087019,0.00087519607,0.000009385379,0.000070772476,0.0018986476],"genre_scores_gemma":[0.9631126,0.000009089676,0.03399954,0.00089961285,0.0017338885,0.000013839049,0.0000059577037,0.000031877415,0.00019359028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710816,0.000105845975,0.00042146747,0.0008567274,0.00069916237,0.00080865546],"domain_scores_gemma":[0.9974252,0.001784785,0.00026776464,0.00024262012,0.00017029143,0.00010932286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002179851,0.00032586706,0.0005035492,0.0004469444,0.00088570354,0.0003636188,0.0012832193,0.00037341658,0.000024985158],"category_scores_gemma":[0.0002890194,0.00032076833,0.0001229004,0.00026283215,0.0008190481,0.00019586716,0.00021844885,0.00050062686,0.0000075676303],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026069667,0.000021655118,0.0017655804,0.00004026602,0.0000095655405,0.000014649596,0.008240722,0.02020908,0.000012201917,0.010993679,0.00003479658,0.95863175],"study_design_scores_gemma":[0.0036383448,0.00030838585,0.0037101784,0.00087717385,0.000043096974,0.000004179161,0.00003622677,0.7696393,0.0001639702,0.20519711,0.014040863,0.0023411403],"about_ca_topic_score_codex":0.0006153715,"about_ca_topic_score_gemma":0.004815122,"teacher_disagreement_score":0.96276313,"about_ca_system_score_codex":0.00034934483,"about_ca_system_score_gemma":0.0004935818,"threshold_uncertainty_score":0.9999244},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052363266,0.00019134596,0.99772435,0.00021580243,0.000702432,0.0003228325,0.0000030466108,0.00021540743,0.0005724321],"genre_scores_gemma":[0.018210348,0.000019755154,0.979988,0.00028408327,0.00062596163,0.000012307953,0.000006923724,0.00007850554,0.00077414664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980783,0.000004346323,0.00035064464,0.00065171433,0.00043806076,0.00047696705],"domain_scores_gemma":[0.99887234,0.0002562647,0.00007067491,0.00045528292,0.00014635864,0.00019909986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029428708,0.00041422402,0.0004380453,0.0003001654,0.00012179756,0.00026726996,0.0006752296,0.00029130932,0.000013336192],"category_scores_gemma":[0.00005911605,0.00036268396,0.00009326876,0.00019160438,0.00018255196,0.000121476354,0.000097850476,0.00048494007,0.000015796748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008919812,0.0000024292747,0.000008084809,0.00005170364,0.0000133828635,0.0000033048227,0.0002289618,0.9627926,0.000011971666,0.00062861294,0.000020325466,0.0362297],"study_design_scores_gemma":[0.00048652705,0.00005400764,0.000004027431,0.00033833884,0.000021081843,0.000013566325,1.626055e-7,0.9841087,0.00012259667,0.014318335,0.000060693183,0.00047196695],"about_ca_topic_score_codex":0.0000047728013,"about_ca_topic_score_gemma":0.000035585625,"teacher_disagreement_score":0.035757735,"about_ca_system_score_codex":0.00010914894,"about_ca_system_score_gemma":0.00025688641,"threshold_uncertainty_score":0.9998825},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013313989,0.000015433909,0.9855129,0.0002277597,0.00032669143,0.00026130758,4.2085347e-7,0.00023277878,0.00010868872],"genre_scores_gemma":[0.46020532,0.0000018962965,0.538729,0.0010222901,0.000021889618,0.000014591445,5.129274e-7,0.0000038320345,6.4750344e-7],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980854,0.0000738466,0.00022984316,0.0006604941,0.00058138394,0.00036905147],"domain_scores_gemma":[0.9989104,0.0001654498,0.000092838825,0.0005365082,0.00016588665,0.00012886393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005052438,0.00016534339,0.00014697533,0.00035280213,0.00011815915,0.00021432624,0.0014471627,0.00004295259,0.00004178042],"category_scores_gemma":[0.00007823219,0.00012613427,0.000021910128,0.0016099793,0.00040744361,0.0019191125,0.00037159093,0.00022788504,0.000020671516],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010663926,0.000108428925,0.002297237,0.0000074477493,0.0000047386457,0.000049998693,0.008725988,0.00024235353,0.010913542,0.00026009587,0.000010172162,0.9773693],"study_design_scores_gemma":[0.0003785558,0.00042084962,0.004316232,0.00007345561,0.0000024431104,0.0000587795,0.0000052829746,0.118487604,0.86842126,0.007572984,0.0000033230765,0.00025922287],"about_ca_topic_score_codex":0.00008117316,"about_ca_topic_score_gemma":0.000030982166,"teacher_disagreement_score":0.9771101,"about_ca_system_score_codex":0.00013470887,"about_ca_system_score_gemma":0.00016405362,"threshold_uncertainty_score":0.5143606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005614629,0.00028880755,0.9944495,0.00046462048,0.0023081347,0.000423216,0.000036717847,0.00026611536,0.0017572567],"genre_scores_gemma":[0.022459446,0.000012655622,0.972953,0.0022282456,0.0005150779,0.000013892227,0.00003328718,0.000050198974,0.0017341962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953067,0.00006211267,0.0006185277,0.0019137012,0.0012761705,0.0008228466],"domain_scores_gemma":[0.99671185,0.00032043082,0.00038457732,0.001932429,0.0003616933,0.00028904583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011267331,0.0006586768,0.0007110771,0.00066772226,0.00031756662,0.00068516616,0.0040051434,0.0004449733,0.000035282643],"category_scores_gemma":[0.00006252393,0.00059647183,0.00021008949,0.0006615343,0.0005003142,0.00042969926,0.00092994276,0.00079591107,0.00027911202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032171295,0.000042429176,0.000017732242,0.00004770071,0.000008218187,0.00010964146,0.00014858691,0.02168701,0.000051214312,0.0036810492,0.00026126843,0.9739419],"study_design_scores_gemma":[0.0005855095,0.00014066414,0.000057811187,0.0005292524,0.000005506228,0.00003632315,6.268151e-8,0.963365,0.0003240439,0.0040739556,0.030177101,0.00070475205],"about_ca_topic_score_codex":0.00004115254,"about_ca_topic_score_gemma":0.000026148758,"teacher_disagreement_score":0.97323716,"about_ca_system_score_codex":0.00033956833,"about_ca_system_score_gemma":0.0006433701,"threshold_uncertainty_score":0.9996487},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039791598,0.0007516601,0.9961598,0.00019279029,0.0006692032,0.0014258628,0.000015908749,0.000032328175,0.0003545418],"genre_scores_gemma":[0.17272048,0.00004179478,0.8263663,0.00033826046,0.0003248663,0.00011237631,0.000021390088,0.000030318222,0.000044236836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984231,0.000026977772,0.00029579172,0.0006635593,0.00030424527,0.00028632555],"domain_scores_gemma":[0.9990969,0.00012108989,0.00014890802,0.00034367284,0.000192884,0.00009657711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064466306,0.0002596951,0.00041933043,0.00032621433,0.00006729875,0.000051517058,0.00016574576,0.0001549382,0.0000070247634],"category_scores_gemma":[0.00009623676,0.0002209181,0.00007741546,0.00034622374,0.00013237537,0.00009860379,0.00010116313,0.00019900093,5.63231e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017259407,0.00012932072,0.004053199,0.00040658537,0.00006337554,0.00013374098,0.00028003048,0.04822566,0.0012990102,0.00034067233,0.00004803166,0.94484776],"study_design_scores_gemma":[0.0027432058,0.00080814573,0.0008220067,0.0029902144,0.00025404934,0.00045584727,4.902364e-7,0.9093954,0.05167362,0.028095484,0.002041916,0.0007196372],"about_ca_topic_score_codex":0.00029862646,"about_ca_topic_score_gemma":0.00065498677,"teacher_disagreement_score":0.94412816,"about_ca_system_score_codex":0.0030461398,"about_ca_system_score_gemma":0.00061767193,"threshold_uncertainty_score":0.90087783},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001637173,0.0009587889,0.99536633,0.000015841404,0.00044550758,0.00022476615,0.000005068695,0.00020643638,0.0026135647],"genre_scores_gemma":[0.9823453,0.00008465219,0.017262325,0.00008957633,0.00008122096,0.000013365964,0.000014641438,0.00004310461,0.000065824766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987016,0.000006158419,0.00035945783,0.00032740599,0.0003606329,0.00024474302],"domain_scores_gemma":[0.9993193,0.000059299393,0.00007020598,0.0003811991,0.0001325616,0.000037427697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002424332,0.00022939556,0.0003320479,0.0007213749,0.000022976647,0.000032419262,0.0005447596,0.00032058862,0.000021956976],"category_scores_gemma":[0.00006201028,0.00021979964,0.000037046335,0.00048390508,0.00031478764,0.0001139583,0.00014432467,0.00031222336,0.000008596348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001871618,0.0000045491224,0.0001522,0.00006774102,0.0000023956652,0.000007772004,0.00031203066,0.92034906,0.00003771823,0.00092114357,0.000026428968,0.078117065],"study_design_scores_gemma":[0.00021395204,0.000048420556,0.000022716064,0.000405976,0.0000039045003,0.0000065297845,9.734194e-7,0.9447791,0.0072753965,0.0456917,0.0012518436,0.0002994878],"about_ca_topic_score_codex":0.000015811642,"about_ca_topic_score_gemma":0.0000881859,"teacher_disagreement_score":0.98218155,"about_ca_system_score_codex":0.00024215017,"about_ca_system_score_gemma":0.00010561871,"threshold_uncertainty_score":0.8963169},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007817325,0.0002154988,0.97301924,0.0010585119,0.0006860818,0.0005268691,0.0000047552367,0.0002197289,0.024191113],"genre_scores_gemma":[0.024883628,0.000023239902,0.97323495,0.0012306495,0.00023990702,0.0000252703,0.000007936978,0.00003268814,0.00032171945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962269,0.000025206997,0.0004255123,0.001558803,0.001014347,0.0007492113],"domain_scores_gemma":[0.9973949,0.000228411,0.0002648385,0.0016512561,0.00025135986,0.00020922834],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00040675473,0.00057105854,0.00050056673,0.00053679495,0.0003364601,0.0010464396,0.003497729,0.00028638975,0.00006321846],"category_scores_gemma":[0.000022780545,0.00041998838,0.00009960576,0.0006489693,0.00070822495,0.0010567608,0.0011177118,0.00076131,0.0002286616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039090705,0.00004329799,0.000018815823,0.00003097502,0.000016686918,0.000104291,0.00083821703,0.13517337,0.0000057841617,0.04116652,0.00015636985,0.82244176],"study_design_scores_gemma":[0.0002521877,0.00027960012,0.000097489596,0.00019816661,0.000007697436,0.00016621313,1.6084338e-7,0.9224855,0.00006239772,0.073435456,0.0022810556,0.0007340867],"about_ca_topic_score_codex":0.000028288194,"about_ca_topic_score_gemma":0.000022635984,"teacher_disagreement_score":0.82170767,"about_ca_system_score_codex":0.00018849612,"about_ca_system_score_gemma":0.00047576465,"threshold_uncertainty_score":0.9999906},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001244677,0.00014384642,0.9934672,0.0007046571,0.00081192027,0.00029760363,0.0000031693185,0.00009564256,0.00435148],"genre_scores_gemma":[0.6494193,0.00004029473,0.3479101,0.0012442187,0.0004374993,0.000014189977,0.000004041194,0.000030777166,0.0008995417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726915,0.000021907283,0.00047610875,0.0011128568,0.00063855294,0.00048141513],"domain_scores_gemma":[0.99728656,0.00057778764,0.00033698618,0.0014627137,0.00018322271,0.00015273184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004362784,0.0003543128,0.00045908333,0.00035588717,0.00016813286,0.00018476656,0.0030148057,0.00023359149,0.000010381616],"category_scores_gemma":[0.000045781486,0.00031444343,0.00014040394,0.0004955795,0.0006051219,0.00020600067,0.00092574646,0.0005234428,0.00003504309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027832136,0.000021777227,0.00008089995,0.00002963156,0.0000071243117,0.000009689156,0.00016284124,0.0331212,0.00095634034,0.088445105,0.00018617902,0.87697643],"study_design_scores_gemma":[0.0002000168,0.00010280504,0.0001367839,0.00018343724,0.0000053700664,0.000021570715,4.8836235e-8,0.8698311,0.002896852,0.11887137,0.007315577,0.00043508605],"about_ca_topic_score_codex":0.000022071501,"about_ca_topic_score_gemma":0.000060771916,"teacher_disagreement_score":0.8765413,"about_ca_system_score_codex":0.0000896546,"about_ca_system_score_gemma":0.00021714414,"threshold_uncertainty_score":0.99993074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000409688,0.00085759995,0.9670489,0.00034069706,0.001051992,0.00023089493,0.0000038993903,0.00013130473,0.030293772],"genre_scores_gemma":[0.9076552,0.00012845144,0.08923704,0.0017510022,0.0006926836,0.000010781678,0.000028593799,0.000098497105,0.00039776074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998689,0.00001351492,0.00024109268,0.00032528964,0.00043223123,0.00029884867],"domain_scores_gemma":[0.9992653,0.00017923367,0.000047745954,0.0003909521,0.00006601267,0.000050768787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075157266,0.00023893092,0.00021255949,0.00034263442,0.000052034946,0.00021110846,0.00072769634,0.00016584324,0.000054160882],"category_scores_gemma":[0.000048867943,0.00018143511,0.000033465345,0.00027692446,0.00015025289,0.0001518707,0.00010188714,0.0006099611,0.000030500885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.4731047e-7,0.0000036216327,0.000054752734,0.0000306653,0.0000026483208,0.000025106387,0.0021398633,0.956387,0.000011829911,0.0010204259,0.00030557523,0.04001759],"study_design_scores_gemma":[0.00020304669,0.00004311267,0.000096097276,0.00046891312,0.0000042482766,0.00005497351,7.785566e-7,0.95425785,0.00006318191,0.036912117,0.007460796,0.00043486472],"about_ca_topic_score_codex":0.000013442855,"about_ca_topic_score_gemma":0.00010420568,"teacher_disagreement_score":0.90761423,"about_ca_system_score_codex":0.00016089367,"about_ca_system_score_gemma":0.000075672535,"threshold_uncertainty_score":0.7398709},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012608933,0.005052381,0.9877046,0.0013163518,0.0013161874,0.00046331648,0.000003641345,0.00044904268,0.0024336143],"genre_scores_gemma":[0.261811,0.00028813962,0.73651135,0.0005185176,0.00047577682,0.000016661292,0.0000072247667,0.000039135986,0.00033220366],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940427,0.00009496888,0.0007595819,0.0017400956,0.002254871,0.0011077588],"domain_scores_gemma":[0.996743,0.001098236,0.0002430511,0.0012607232,0.00043193536,0.00022303288],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0029800604,0.00051662204,0.00059882685,0.0032468825,0.00033866672,0.0006675418,0.0051802043,0.0005944629,0.000017683742],"category_scores_gemma":[0.0009156433,0.00043298502,0.00010398032,0.0020886683,0.0018355605,0.001000311,0.002442174,0.00286725,0.00004563047],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010820372,0.000083416344,0.00013335409,0.00012313975,0.0000074774844,0.0017048431,0.0042630117,0.000353121,0.00064607325,0.0029072424,0.00019829904,0.9895692],"study_design_scores_gemma":[0.00062676513,0.00039277066,0.0006088224,0.0032795253,0.0000035970031,0.00072637235,0.0000011740149,0.097809315,0.005234493,0.88588446,0.0036869356,0.0017457381],"about_ca_topic_score_codex":0.00016200209,"about_ca_topic_score_gemma":0.00019605724,"teacher_disagreement_score":0.9878235,"about_ca_system_score_codex":0.00060856744,"about_ca_system_score_gemma":0.0010660511,"threshold_uncertainty_score":0.9998122},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005576221,0.00038606502,0.9735466,0.0005070965,0.0016779504,0.00181697,0.0000012455608,0.0005227471,0.021535734],"genre_scores_gemma":[0.20259322,0.00003607245,0.7950308,0.00086689123,0.00042661466,0.00024758076,0.0000068078293,0.00006848781,0.00072355184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99476856,0.00021542898,0.00093056343,0.0021282348,0.0011263244,0.0008309026],"domain_scores_gemma":[0.99745506,0.00031620954,0.0004367917,0.001450516,0.00017343403,0.0001679806],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021922702,0.0006724625,0.000881722,0.0011906237,0.0002703406,0.0011323952,0.003010007,0.0004827486,0.000002470706],"category_scores_gemma":[0.00004934055,0.00061721064,0.0001304942,0.0011441169,0.00011534713,0.000499228,0.0014732459,0.0010840629,0.000027535834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008423931,0.000047359008,0.00021851549,0.0015986431,0.000035557976,0.000087983586,0.0061871377,0.076823786,0.000005848034,0.7023553,0.00020327093,0.21242817],"study_design_scores_gemma":[0.00028529015,0.00025602724,0.00002954752,0.0062936787,0.000011449912,0.00015304444,0.000017185812,0.9376074,0.00004170462,0.026488442,0.027656104,0.001160128],"about_ca_topic_score_codex":0.00015205416,"about_ca_topic_score_gemma":0.00002371472,"teacher_disagreement_score":0.86078364,"about_ca_system_score_codex":0.0011097972,"about_ca_system_score_gemma":0.00014338527,"threshold_uncertainty_score":0.9999045},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33653238,0.016002469,0.58364606,0.011842954,0.0038546799,0.013092008,0.0008097007,0.0001551024,0.034064654],"genre_scores_gemma":[0.9965567,0.000488809,0.0019405476,0.0002577575,0.000101528,0.000054494678,0.000020297879,0.000036717123,0.0005431447],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965982,0.00029405314,0.00081873365,0.00066491595,0.0010430303,0.00058111013],"domain_scores_gemma":[0.99388266,0.003792985,0.00037175982,0.0017563753,0.00013917102,0.000057035377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007960127,0.0003840563,0.000589198,0.0003851273,0.0001443994,0.00011774055,0.0018542696,0.0002364394,0.000062562845],"category_scores_gemma":[0.00014381291,0.00021491462,0.00015694991,0.00046943736,0.0018127745,0.00010047834,0.00012782746,0.0004583298,0.000008231233],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007752277,0.0007071164,0.0010049467,0.00003388172,0.000043753036,0.000027883172,0.014028151,0.0065742075,0.0000055003393,0.010842155,0.000023030423,0.9666318],"study_design_scores_gemma":[0.013745521,0.03241285,0.37689304,0.007144528,0.0004127828,0.00030529112,0.00058827526,0.13737912,0.0017576824,0.3922863,0.03213289,0.0049416926],"about_ca_topic_score_codex":0.0020642641,"about_ca_topic_score_gemma":0.0054733814,"teacher_disagreement_score":0.9616902,"about_ca_system_score_codex":0.00014757026,"about_ca_system_score_gemma":0.00018504338,"threshold_uncertainty_score":0.8763964},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033552232,0.00026233602,0.99339217,0.000089737434,0.001017798,0.00023634208,0.000005280418,0.00006626893,0.0015748296],"genre_scores_gemma":[0.2149324,0.000016402026,0.78439724,0.0001409318,0.00028579254,0.0000018529646,0.0000032842077,0.000024320929,0.00019775967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668777,0.0003319442,0.00059629575,0.0011499864,0.00074048387,0.00049353647],"domain_scores_gemma":[0.9973672,0.00067627715,0.0004353687,0.0010721221,0.00028632907,0.0001626847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031432554,0.00043655897,0.0007068693,0.0010057602,0.00018668792,0.00031455254,0.0015285317,0.0002649753,0.000015809766],"category_scores_gemma":[0.0001288556,0.00040801297,0.00014283655,0.00057345675,0.001041785,0.00082146656,0.00043976813,0.0005271706,0.0000015017613],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029496789,0.0000923634,0.000027650356,0.00012710434,0.000035222252,0.000039161187,0.0034339072,0.010930271,0.073101744,0.043615557,0.0000098885175,0.86855763],"study_design_scores_gemma":[0.001006052,0.0011849396,0.0036437532,0.00035387612,0.000055450546,0.00019899098,0.0000022198778,0.8012801,0.063242406,0.12792814,0.00014774766,0.000956377],"about_ca_topic_score_codex":0.00004119866,"about_ca_topic_score_gemma":0.000013381616,"teacher_disagreement_score":0.8676013,"about_ca_system_score_codex":0.00014175044,"about_ca_system_score_gemma":0.00025364902,"threshold_uncertainty_score":0.99983716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001179287,0.0005564529,0.99015087,0.001185807,0.0008759672,0.00023898241,0.000010054117,0.00022694288,0.005575616],"genre_scores_gemma":[0.6215955,0.00038378095,0.37482998,0.002427153,0.00028282058,0.00002173956,0.0000059100553,0.000023321105,0.00042979314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785656,0.000021227303,0.0003253319,0.0010172562,0.0004030531,0.00037655313],"domain_scores_gemma":[0.99846053,0.00037300153,0.0001507681,0.0007425998,0.00017966023,0.000093414375],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00019549226,0.00035327682,0.0004082079,0.0006525,0.0008799227,0.00018338542,0.0012894655,0.00030949106,0.0000055953356],"category_scores_gemma":[0.000050859646,0.00033233533,0.00006463857,0.0003996232,0.0032158073,0.00041364055,0.0012444529,0.0007399935,0.000017414037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033610283,0.000034879,0.00013705363,0.000010105017,0.00003702041,0.00012707472,0.004679535,0.0023179632,0.000046229397,0.59102756,0.00012233522,0.40145692],"study_design_scores_gemma":[0.0011398632,0.0009912329,0.0018354657,0.00050905294,0.000037803304,0.001866567,0.0000037327554,0.17090373,0.0010165861,0.8040072,0.015461581,0.0022272042],"about_ca_topic_score_codex":0.000012392068,"about_ca_topic_score_gemma":0.00008383607,"teacher_disagreement_score":0.6204162,"about_ca_system_score_codex":0.00011938082,"about_ca_system_score_gemma":0.00031224138,"threshold_uncertainty_score":0.99991286},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029657726,0.0010022355,0.9951623,0.00067851774,0.0017784626,0.0004752771,0.000012438979,0.0005380972,0.000056078115],"genre_scores_gemma":[0.12955648,0.00004359686,0.8696067,0.00042107893,0.00027119578,0.000026722193,0.000005657536,0.000027280112,0.000041298845],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958108,0.00018795977,0.00068758026,0.0017802767,0.00063396455,0.00089942483],"domain_scores_gemma":[0.99258983,0.0052222484,0.00023365552,0.0015814336,0.0002083842,0.00016443606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023979037,0.0006024796,0.00072818424,0.00048793596,0.00019323459,0.00029480853,0.0019211794,0.00036168174,0.000026460695],"category_scores_gemma":[0.005385678,0.0005472859,0.00009859867,0.000441162,0.000550971,0.0009188,0.0014413692,0.0012275134,0.00000982343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004353591,0.00011375764,0.008043503,0.0001384411,0.000014271281,0.00011129766,0.0012665052,0.2591309,0.00044333044,0.008988703,0.00003653031,0.7217084],"study_design_scores_gemma":[0.00047962068,0.00019965334,0.008569144,0.00079132547,0.000016363032,0.0003049284,4.3596552e-7,0.06695282,0.004818338,0.91451955,0.0008702358,0.002477596],"about_ca_topic_score_codex":0.000022236594,"about_ca_topic_score_gemma":0.00011271308,"teacher_disagreement_score":0.9055308,"about_ca_system_score_codex":0.00042836292,"about_ca_system_score_gemma":0.0003446776,"threshold_uncertainty_score":0.99969786},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044083477,0.00012001871,0.9947421,0.0004110049,0.0012118636,0.0006743862,0.000008835052,0.00024212555,0.002545564],"genre_scores_gemma":[0.030214334,0.000035726658,0.96750337,0.0015708739,0.0004694737,0.000042464824,0.00003445959,0.000028524853,0.00010076325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969164,0.00003570936,0.00051855284,0.0010132098,0.00086735614,0.0006487562],"domain_scores_gemma":[0.99781966,0.00039040006,0.000431917,0.0008358931,0.0003790032,0.000143137],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000829699,0.00051702425,0.00050084194,0.00052929425,0.00044617878,0.0009388402,0.0017406449,0.0003269229,0.000007813377],"category_scores_gemma":[0.0000471587,0.0004198237,0.00011655382,0.00048835785,0.00026283693,0.0018031244,0.00036714325,0.00077617145,0.000034495246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008243921,0.000008646468,0.000011979224,0.000037897014,0.0000062915624,0.0000074418144,0.00047673393,0.06870843,0.000011102674,0.001201114,0.000033421555,0.9294887],"study_design_scores_gemma":[0.00056954403,0.0004436408,0.000056792287,0.0002703859,0.000008026975,0.00009269253,3.390827e-7,0.9699926,0.0000800167,0.008862384,0.019050049,0.000573552],"about_ca_topic_score_codex":0.000014607505,"about_ca_topic_score_gemma":0.000019680061,"teacher_disagreement_score":0.92891514,"about_ca_system_score_codex":0.00021766682,"about_ca_system_score_gemma":0.00040640816,"threshold_uncertainty_score":0.99982536},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001000195,0.00041042635,0.9956531,0.00041241522,0.0011809132,0.0004022489,0.0000039425936,0.00016241055,0.0017645193],"genre_scores_gemma":[0.0051424066,0.000011535289,0.992684,0.0014223292,0.00042672892,0.000009208743,0.0000066448256,0.000042214455,0.00025492042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952761,0.00048272283,0.0008866415,0.0015171412,0.0011824364,0.00065493514],"domain_scores_gemma":[0.9945631,0.0023149217,0.00068379455,0.0017875537,0.00047300072,0.00017761279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0060050823,0.0006148532,0.0009695109,0.0012890712,0.00019788685,0.00045297947,0.0035812296,0.00040337257,0.000028913868],"category_scores_gemma":[0.00036739785,0.0005570518,0.00028459146,0.00077508995,0.0009846351,0.0007490519,0.0008232519,0.00078988425,0.000025872096],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016301594,0.00003127773,0.0000018492238,0.00014542941,0.000011364282,0.000030215882,0.00025187572,0.010555028,0.021203097,0.035558667,0.000018319426,0.9321766],"study_design_scores_gemma":[0.0004447631,0.00017810712,0.000009524121,0.00031246868,0.000013559391,0.000016965725,3.9691606e-8,0.66192776,0.10850285,0.22757295,0.0005291543,0.00049186306],"about_ca_topic_score_codex":0.000015607944,"about_ca_topic_score_gemma":0.000002587082,"teacher_disagreement_score":0.93168473,"about_ca_system_score_codex":0.00018573261,"about_ca_system_score_gemma":0.0006784892,"threshold_uncertainty_score":0.9996881},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000089778514,0.0012597621,0.99562806,0.0003924093,0.00075694587,0.0006522727,0.000013138597,0.00043424452,0.00077340106],"genre_scores_gemma":[0.12869471,0.000012649868,0.870366,0.00062057783,0.0001505017,0.00001651987,0.0000058900987,0.00002945064,0.000103692786],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970363,0.000031486765,0.00055195217,0.0011117349,0.0007452196,0.00052331435],"domain_scores_gemma":[0.9973986,0.00024818152,0.0005485197,0.0011670316,0.00051502284,0.00012262067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008811395,0.00046156553,0.00059871614,0.00086615985,0.0001637925,0.00024294964,0.0025166834,0.00038073777,0.000017994846],"category_scores_gemma":[0.00013736206,0.00040556936,0.00019397118,0.00048620044,0.00058780756,0.0005673884,0.0008654815,0.00046785426,0.000005626063],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013175658,0.00003080852,0.00000373498,0.00025385505,0.000013880159,0.000059215676,0.00189401,0.00009964637,0.0014005357,0.05922868,0.000028230954,0.9369742],"study_design_scores_gemma":[0.00029015908,0.0004861029,0.000023194616,0.0009840066,0.000021312484,0.00018154451,2.2926145e-7,0.22175477,0.03132542,0.744113,0.00016866394,0.00065153616],"about_ca_topic_score_codex":0.000040655304,"about_ca_topic_score_gemma":0.000020773643,"teacher_disagreement_score":0.9363227,"about_ca_system_score_codex":0.00024602126,"about_ca_system_score_gemma":0.00061947946,"threshold_uncertainty_score":0.9998396},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006566442,0.00012350743,0.9962682,0.00030644683,0.0014115836,0.001046218,0.000006250059,0.00022869367,0.00054340466],"genre_scores_gemma":[0.11643428,0.000023409388,0.881786,0.0007146954,0.00035940754,0.000041889987,0.000011830737,0.000040008945,0.0005884975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960532,0.000039508144,0.0006372252,0.0018619758,0.00072153466,0.0006865242],"domain_scores_gemma":[0.99709547,0.0002250491,0.00030491134,0.0018351106,0.00032296128,0.00021649133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007684963,0.000536609,0.00057514413,0.00057676964,0.0002904586,0.00052574795,0.0036229058,0.00035726817,0.000013661977],"category_scores_gemma":[0.00006753858,0.00049892237,0.00017169568,0.0002373277,0.00023182546,0.0010285866,0.0007398242,0.00046597768,0.000011102728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001794822,0.000043469994,0.0000309508,0.000033931377,0.00001198358,0.000011028304,0.0021185596,0.46951616,0.00016810099,0.059818815,0.000005332312,0.46822372],"study_design_scores_gemma":[0.0009950992,0.00011653973,0.000012851545,0.000105583764,0.000010144098,0.0000059827335,7.0773126e-8,0.8197069,0.00062461884,0.1777917,0.00015052914,0.0004799826],"about_ca_topic_score_codex":0.000042589447,"about_ca_topic_score_gemma":0.00020435368,"teacher_disagreement_score":0.46774372,"about_ca_system_score_codex":0.0003194727,"about_ca_system_score_gemma":0.0005069275,"threshold_uncertainty_score":0.99974626},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012807142,0.0011034627,0.9946525,0.00017776448,0.0022343395,0.0006856403,0.00000148037,0.00011634998,0.0009004094],"genre_scores_gemma":[0.82768065,0.00005459188,0.17072113,0.00023967435,0.00096207473,0.00005535022,0.000017761668,0.000026897449,0.00024190292],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973768,0.00003082721,0.0004693071,0.0010147884,0.0005060859,0.0006022022],"domain_scores_gemma":[0.9983606,0.00026776557,0.00028442784,0.0008212801,0.00016182574,0.000104140534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013606721,0.00033907688,0.00038622375,0.0006155222,0.00018322449,0.0004220581,0.0016545749,0.00032743794,0.000006006569],"category_scores_gemma":[0.00007217119,0.000303633,0.00010512587,0.00031085865,0.00023743659,0.0006460329,0.00034442934,0.00036790653,0.00005272921],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044319063,0.000027618722,0.00019986034,0.00006579506,0.0000038012395,0.000004076496,0.0010729085,0.0013882396,0.00022501656,0.1260368,0.0000070818546,0.8709644],"study_design_scores_gemma":[0.00061589363,0.00021881396,0.0010854088,0.00017903287,0.000010590052,0.000039463765,5.321704e-7,0.27025485,0.001506512,0.7128408,0.012300415,0.00094769034],"about_ca_topic_score_codex":0.000038859114,"about_ca_topic_score_gemma":0.000087424196,"teacher_disagreement_score":0.8700167,"about_ca_system_score_codex":0.00027429874,"about_ca_system_score_gemma":0.00020065095,"threshold_uncertainty_score":0.9999416},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037425468,0.00015175545,0.97710025,0.000031958913,0.0008950721,0.00010387826,0.0000029432101,0.0002694225,0.021070492],"genre_scores_gemma":[0.9456806,0.00004542553,0.05234553,0.0003031292,0.0012641338,0.0000051061224,0.000008878565,0.000075144824,0.0002720179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874866,0.0000057366287,0.00026236396,0.00036911143,0.00030012886,0.00031397922],"domain_scores_gemma":[0.9996123,0.00004634855,0.00005747072,0.0001888324,0.000053521144,0.000041529805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017354291,0.00027138944,0.0002472809,0.00021626409,0.00016946456,0.00013099969,0.0004208916,0.0001944472,0.00022048966],"category_scores_gemma":[0.000011446108,0.0002794969,0.00007561779,0.000118533906,0.00019147892,0.00025313976,0.00010590701,0.00044458988,0.00008036568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008781548,0.000030862513,0.000034541492,0.0005686946,0.0000748393,0.00008767523,0.023328185,0.2997372,0.011901966,0.05583167,0.0002127086,0.6081829],"study_design_scores_gemma":[0.00058521435,0.00016244948,0.0003130372,0.001426239,0.00003964695,0.00004331941,0.0000022627275,0.5990506,0.02175734,0.35527554,0.018918302,0.0024260553],"about_ca_topic_score_codex":0.000004317824,"about_ca_topic_score_gemma":0.000009795452,"teacher_disagreement_score":0.94530636,"about_ca_system_score_codex":0.00015324324,"about_ca_system_score_gemma":0.000037501286,"threshold_uncertainty_score":0.9999657},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8419327,0.0000118059925,0.15737142,0.00012548766,0.00008314505,0.0004586123,0.000004784535,0.000008932424,0.0000031208751],"genre_scores_gemma":[0.99043745,0.000023172754,0.009109777,0.00027834345,0.0000829795,0.0000522348,0.000010020044,0.000005091389,9.507959e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985025,0.00010533737,0.00031069756,0.00052248995,0.00029424456,0.0002647253],"domain_scores_gemma":[0.9992583,0.00006600853,0.00006239376,0.00038780866,0.0001293782,0.000096116746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079010846,0.0000961759,0.00015214708,0.00007840388,0.000029174435,0.00003414426,0.0005092194,0.000100441786,0.00003554572],"category_scores_gemma":[0.00031316734,0.0000762202,0.000028180068,0.00054635113,0.00056262437,0.000013455549,0.00014207615,0.0001767005,5.057269e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023831119,0.0003660778,0.3831344,0.0000060827956,9.0242014e-7,5.2708e-7,0.00003229329,0.000044648667,0.60374403,3.248194e-7,0.0000021172218,0.012644757],"study_design_scores_gemma":[0.0003136977,0.0007612268,0.21036161,0.000017851457,8.1213085e-7,6.9349034e-7,7.5832895e-7,0.008041568,0.7800942,0.00031172246,0.000010972853,0.00008488535],"about_ca_topic_score_codex":0.00020661003,"about_ca_topic_score_gemma":0.00012377037,"teacher_disagreement_score":0.17635015,"about_ca_system_score_codex":0.00004385523,"about_ca_system_score_gemma":0.00020484008,"threshold_uncertainty_score":0.31081697},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78349936,0.004660035,0.20390648,0.0044415453,0.00029074622,0.0026300843,0.0001646593,0.00004000903,0.00036706412],"genre_scores_gemma":[0.98887116,0.0009966453,0.00966073,0.00013146728,0.00020955481,0.000029045743,0.000003468312,0.000033289263,0.00006464324],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99706393,0.000037715858,0.0006031714,0.0007257581,0.0010810873,0.0004883572],"domain_scores_gemma":[0.9972219,0.0010160569,0.00030762804,0.00060057454,0.00062823296,0.00022562301],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080933404,0.0004055419,0.0007144185,0.0008088018,0.00017617688,0.00006155747,0.00055037846,0.00016935356,0.000041707095],"category_scores_gemma":[0.0010451641,0.00026067684,0.00020710775,0.00060963345,0.0006266235,0.00013002736,0.0009178713,0.00047247965,0.0000047163926],"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.000336116,0.00022991638,0.6886175,0.0006809591,0.00020206011,0.0000044747057,0.008942253,0.021111947,0.0006474098,0.000018511004,0.0003118271,0.278897],"study_design_scores_gemma":[0.001562699,0.00089160725,0.81755996,0.0011016134,0.00010687129,0.0000035893524,0.0000041867693,0.17468715,0.00082661933,0.00281638,0.000026906351,0.0004124274],"about_ca_topic_score_codex":0.00046545608,"about_ca_topic_score_gemma":0.0006981393,"teacher_disagreement_score":0.27848458,"about_ca_system_score_codex":0.00023774846,"about_ca_system_score_gemma":0.0002505744,"threshold_uncertainty_score":0.99998456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034362536,0.00034663614,0.9916338,0.00059248507,0.001831802,0.0002560494,0.000008607195,0.00023321764,0.0050630625],"genre_scores_gemma":[0.28691337,0.00016134878,0.7089894,0.0024545747,0.00065242214,0.000008179689,0.000018349276,0.000053154985,0.00074920146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972378,0.000026545327,0.0004181868,0.0009952972,0.0007385648,0.00058360945],"domain_scores_gemma":[0.9981877,0.00020647571,0.00024073543,0.001012241,0.00013469481,0.00021812023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006004159,0.0004334791,0.0003723402,0.0006893706,0.00023637946,0.0004650206,0.0016654946,0.00024187553,0.00015872395],"category_scores_gemma":[0.00004932761,0.00041874812,0.00011221901,0.00045111886,0.0003667269,0.0008749545,0.0009172528,0.0006664711,0.00011566512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026030523,0.000010969449,0.0002477377,0.000019147092,0.0000080089385,0.000024792684,0.00060035277,0.035361443,0.000069299815,0.020404454,0.000017887232,0.9432333],"study_design_scores_gemma":[0.0003112802,0.000073549105,0.00055352866,0.00021219332,0.0000097747925,0.00021519045,1.3726157e-7,0.9648989,0.00048623653,0.027809648,0.0046233875,0.0008061711],"about_ca_topic_score_codex":0.000022943492,"about_ca_topic_score_gemma":0.00008791122,"teacher_disagreement_score":0.94242716,"about_ca_system_score_codex":0.00028456966,"about_ca_system_score_gemma":0.0003152444,"threshold_uncertainty_score":0.99982643},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007969417,0.0017371629,0.9742409,0.006793121,0.0035726456,0.0008946762,0.000016616992,0.000615325,0.0041601113],"genre_scores_gemma":[0.6910681,0.00014877648,0.30537048,0.001634772,0.0014910743,0.000018796703,0.000008410642,0.00006884594,0.00019074023],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99603575,0.000053593605,0.00047294886,0.0012579752,0.0010738998,0.0011058437],"domain_scores_gemma":[0.9978908,0.0005373223,0.0002006977,0.00080747704,0.00024189882,0.0003218631],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077271584,0.0004899981,0.0006063127,0.00067629904,0.000567572,0.00034339615,0.0023084127,0.000669133,0.00019166106],"category_scores_gemma":[0.0003033972,0.00049869885,0.000098717726,0.0007798165,0.0009360498,0.00036622214,0.0009504873,0.0008397035,0.000245375],"study_design_candidate":"design_other","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.000013524864,0.00002038634,0.00108608,0.000008317665,0.000045840385,0.000043845223,0.01961228,0.00061457494,0.00022130417,0.023104051,0.00006482036,0.95516497],"study_design_scores_gemma":[0.0016002164,0.00044339424,0.05178884,0.0038296436,0.00028060787,0.000069953094,0.00010854119,0.005035981,0.010543479,0.37648863,0.5410718,0.008738917],"about_ca_topic_score_codex":0.0013195458,"about_ca_topic_score_gemma":0.020061558,"teacher_disagreement_score":0.94642603,"about_ca_system_score_codex":0.00056126487,"about_ca_system_score_gemma":0.0008454114,"threshold_uncertainty_score":0.99974644},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000707777,0.0018757293,0.9896945,0.00029657278,0.0044982173,0.0007746734,0.0000042327715,0.0004620414,0.0016862922],"genre_scores_gemma":[0.1705754,0.000037833182,0.8273263,0.0004453395,0.0011494174,0.000013926752,0.0000048386505,0.00006636371,0.00038061308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931302,0.00007885405,0.001068382,0.0024857554,0.0016972848,0.0015395245],"domain_scores_gemma":[0.99472225,0.00061739545,0.0006832507,0.0030086546,0.00045365476,0.0005147908],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00267455,0.0009756993,0.0010308031,0.001069933,0.00049074786,0.0010799133,0.005538015,0.000740578,0.000033113727],"category_scores_gemma":[0.0002849169,0.0009132486,0.00029441243,0.00094045413,0.0007106054,0.0018745118,0.0028166068,0.001745828,0.0003498295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010953677,0.00014891097,0.0017547478,0.00028870872,0.00005801035,0.00024090253,0.0035162922,0.05831704,0.0047799246,0.02346115,0.000013204829,0.90741014],"study_design_scores_gemma":[0.00062663393,0.00011333619,0.0010892901,0.001062776,0.000020155332,0.00020374822,5.934627e-7,0.9740937,0.0023768065,0.017408475,0.0013393746,0.0016651438],"about_ca_topic_score_codex":0.00008309219,"about_ca_topic_score_gemma":0.00007483305,"teacher_disagreement_score":0.9157766,"about_ca_system_score_codex":0.000643508,"about_ca_system_score_gemma":0.0009721324,"threshold_uncertainty_score":0.9999571},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012084852,0.0023165338,0.9911316,0.0012264029,0.0018671341,0.00039441444,0.000002203861,0.00017650709,0.001676743],"genre_scores_gemma":[0.1885047,0.000052849005,0.8094447,0.0013867975,0.00029476336,0.0000072874495,9.1699127e-7,0.000025938929,0.00028200928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962204,0.00004897333,0.00044554134,0.0015436426,0.0010415454,0.0006998581],"domain_scores_gemma":[0.9976229,0.00035000517,0.00019427013,0.0012565533,0.0003226753,0.00025356162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014288906,0.00050181476,0.00061598467,0.0007025958,0.00020791701,0.00054987316,0.002621515,0.0002594528,0.0000080072705],"category_scores_gemma":[0.00031407044,0.00041361293,0.00007725896,0.00040990094,0.0006135474,0.00049402524,0.0026097728,0.00043597646,0.000027671646],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010091835,0.000019257273,0.0001382578,0.000034859462,0.000014975729,0.00016770496,0.0014541394,0.04064079,0.00017016659,0.018964792,0.000082524435,0.93830246],"study_design_scores_gemma":[0.0003295758,0.00036268213,0.00075419777,0.00046564624,0.000020048104,0.00031353888,0.0000013862345,0.6048693,0.0006021268,0.3893539,0.001967577,0.00096002105],"about_ca_topic_score_codex":0.000081521735,"about_ca_topic_score_gemma":0.00016554394,"teacher_disagreement_score":0.9373424,"about_ca_system_score_codex":0.00031823237,"about_ca_system_score_gemma":0.00064684486,"threshold_uncertainty_score":0.99983156},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005328301,0.0003517749,0.9978326,0.000084245185,0.0006588779,0.0006566851,0.000010573755,0.00005875624,0.00029319618],"genre_scores_gemma":[0.0027247793,0.000036109886,0.99649817,0.0005130302,0.00013894928,0.000011288797,0.000008110941,0.000018127692,0.00005142063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693114,0.00008901036,0.0006065155,0.0011289789,0.00078450167,0.00045983845],"domain_scores_gemma":[0.9962464,0.0011699218,0.0004848117,0.0015997869,0.0003709425,0.00012814638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0048129517,0.00036156437,0.0005823124,0.0013703104,0.0002443241,0.00027268435,0.002761588,0.00026673762,0.00000706478],"category_scores_gemma":[0.00015684578,0.0002673914,0.000161433,0.001462062,0.0009102796,0.0005309247,0.00053764763,0.00035241086,0.0000020027414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007070229,0.000012900616,0.000013154337,0.000012003617,0.000054310043,0.000004641297,0.0004921872,0.023323491,0.0000435738,0.019547313,0.0000028337422,0.9564865],"study_design_scores_gemma":[0.00011482105,0.00023152727,0.0006317621,0.000036881444,0.00009742341,0.000022455313,2.938281e-7,0.9380919,0.001773199,0.058269124,0.00043162925,0.00029901674],"about_ca_topic_score_codex":0.000017496051,"about_ca_topic_score_gemma":0.00001767722,"teacher_disagreement_score":0.9561875,"about_ca_system_score_codex":0.00012391353,"about_ca_system_score_gemma":0.00024924419,"threshold_uncertainty_score":0.9999778},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035042049,0.00036527976,0.9889436,0.00059116585,0.0011240701,0.0006988199,0.0000041318676,0.0003042966,0.007965151],"genre_scores_gemma":[0.01328728,0.00011148005,0.9829533,0.0011570489,0.00020275272,0.000018512936,0.0000071669638,0.00005099806,0.0022114527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531627,0.00008222724,0.0005954021,0.0017817001,0.0012018232,0.001022562],"domain_scores_gemma":[0.99718183,0.00025873756,0.00026230348,0.0015659829,0.00037446097,0.0003566669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017176288,0.0005618843,0.00051815744,0.0011346737,0.00039929542,0.0008146253,0.004726614,0.00032854982,0.00012086646],"category_scores_gemma":[0.00011036081,0.00049954484,0.00014915853,0.0007217818,0.0007241214,0.0010214978,0.0021583233,0.0013142119,0.00019945671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053117974,0.000119178476,0.00010873566,0.00012496318,0.000024893345,0.000113634465,0.005210282,0.3999535,0.00029346495,0.025311753,0.00005612538,0.56867814],"study_design_scores_gemma":[0.0003393541,0.00014062694,0.00005487033,0.00031626876,0.0000025573918,0.000028513241,8.534372e-8,0.899881,0.00038817085,0.09442073,0.0037791396,0.00064868014],"about_ca_topic_score_codex":0.000042005933,"about_ca_topic_score_gemma":0.000046237466,"teacher_disagreement_score":0.56802946,"about_ca_system_score_codex":0.00022946428,"about_ca_system_score_gemma":0.0007667077,"threshold_uncertainty_score":0.9997456},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000567677,0.00008632527,0.9897285,0.0009659319,0.0017871648,0.0004318928,0.000013422546,0.00017133307,0.0062477416],"genre_scores_gemma":[0.67486393,0.00005424151,0.31953365,0.0039382786,0.0010117752,0.000024582721,0.000030050829,0.000060066723,0.000483445],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99582136,0.000050768926,0.00056502013,0.0016726668,0.0011581524,0.000732015],"domain_scores_gemma":[0.9969048,0.000515987,0.00029627536,0.001859814,0.00021952682,0.00020357674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009687616,0.00054443657,0.0004839135,0.0010296828,0.00041193157,0.0009029251,0.00327086,0.0002609445,0.000064640946],"category_scores_gemma":[0.00006680758,0.0005011465,0.00018171432,0.0007240746,0.00059735443,0.00040468996,0.0010009742,0.0008879508,0.00007719732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006237027,0.000047349073,0.00003705408,0.000030947296,0.000015645679,0.000048191443,0.0008260195,0.0026417125,0.00011504328,0.33101645,0.0002927933,0.66492254],"study_design_scores_gemma":[0.0010941582,0.0012281359,0.0007623925,0.00067132973,0.000025549312,0.00012631057,6.25454e-7,0.30896705,0.0024927387,0.6368322,0.04558233,0.0022171948],"about_ca_topic_score_codex":0.000033427303,"about_ca_topic_score_gemma":0.00010281787,"teacher_disagreement_score":0.67429626,"about_ca_system_score_codex":0.00022938348,"about_ca_system_score_gemma":0.00037683905,"threshold_uncertainty_score":0.999744},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043996592,0.000289916,0.9881691,0.00020709484,0.0032900048,0.0002567602,0.0000071289637,0.00028043776,0.007059596],"genre_scores_gemma":[0.79427946,0.00011591008,0.20077178,0.00241365,0.0015124454,0.000022725058,0.000019862548,0.000051445382,0.00081274024],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967112,0.000043785276,0.00046821337,0.0015165872,0.0007521043,0.0005081],"domain_scores_gemma":[0.9980602,0.0002516528,0.0003233724,0.000980482,0.00021409812,0.00017014539],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042695945,0.0004667558,0.0003928722,0.0007343544,0.00031709473,0.000586011,0.0022243217,0.00036713097,0.00009833963],"category_scores_gemma":[0.000034366883,0.000433229,0.00014542603,0.00033659663,0.00043782222,0.0011311264,0.00061148277,0.00075454306,0.00050507364],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047753183,0.000018902962,0.000033090833,0.000013748096,0.000013029061,0.00005823902,0.0005867495,0.00060294784,0.0004433755,0.0023559546,0.00002032653,0.99584883],"study_design_scores_gemma":[0.0003238283,0.00027909112,0.00046384605,0.0004938323,0.000021311329,0.000068035006,3.323866e-7,0.09812658,0.023587856,0.86850595,0.0069873487,0.0011419591],"about_ca_topic_score_codex":0.00042954652,"about_ca_topic_score_gemma":0.0021379034,"teacher_disagreement_score":0.9947069,"about_ca_system_score_codex":0.00023821744,"about_ca_system_score_gemma":0.00027355124,"threshold_uncertainty_score":0.99981195},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009803077,0.00016114436,0.99321073,0.0036178138,0.0003061093,0.00081282866,0.00017491638,0.00003867662,0.0015797757],"genre_scores_gemma":[0.13664694,0.000015341971,0.8564056,0.0045876913,0.0004325083,0.00005879065,0.00044470193,0.000029758616,0.0013786277],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.995108,0.00010905841,0.0006682864,0.001876829,0.0019755028,0.0002623035],"domain_scores_gemma":[0.9943712,0.0016609615,0.00042516357,0.0027174999,0.00060666696,0.00021851936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067875492,0.0002628618,0.00039889346,0.00060706376,0.00022094477,0.00036230893,0.0021074505,0.00014594274,0.000053332966],"category_scores_gemma":[0.0007423807,0.00019658823,0.000024913486,0.00048212826,0.0007267475,0.0005826572,0.0010719931,0.00031752524,0.00013826984],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007344937,0.00006261807,0.00013109444,0.000013215953,0.000007592824,0.000006840663,0.00017792278,0.0075468617,0.00007849381,0.04395644,0.0010111949,0.9469343],"study_design_scores_gemma":[0.001024644,0.00032542914,0.008052986,0.00020850233,0.000035349996,0.000032124062,0.000008790725,0.08317952,0.00017398925,0.24319193,0.6627165,0.0010502201],"about_ca_topic_score_codex":0.000083270876,"about_ca_topic_score_gemma":0.0019754642,"teacher_disagreement_score":0.94588405,"about_ca_system_score_codex":0.00014956146,"about_ca_system_score_gemma":0.00040021504,"threshold_uncertainty_score":0.8016635},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016811833,0.0002482995,0.9947897,0.00064303743,0.0018337277,0.001241062,0.000024438965,0.00019631242,0.0008552582],"genre_scores_gemma":[0.24116829,0.00005055179,0.74978375,0.0049780416,0.0006868757,0.00016262793,0.000059073955,0.00011084068,0.0029999495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956708,0.000045962573,0.0006074159,0.0021068403,0.00070042926,0.0008685701],"domain_scores_gemma":[0.99695915,0.0006759209,0.00035508114,0.0014268953,0.0003350261,0.00024792724],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006513125,0.0007868301,0.0007173831,0.0006026777,0.00017434411,0.0016629027,0.003313402,0.0005461426,0.000056431025],"category_scores_gemma":[0.00007542215,0.00066248805,0.00015456181,0.00042097812,0.00060834945,0.0011165239,0.0012732265,0.00091645814,0.000030310182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028450751,0.00005401819,0.000023177847,0.00016972356,0.000040646424,0.00008859517,0.0006062964,0.013509648,0.00025154022,0.5095144,0.0007970391,0.4749165],"study_design_scores_gemma":[0.0003902045,0.00028818627,0.000012223911,0.00042608238,0.000011171472,0.000041376126,1.9043574e-7,0.7975513,0.0016600688,0.19687293,0.0021021457,0.00064411614],"about_ca_topic_score_codex":0.000064228865,"about_ca_topic_score_gemma":0.00014236779,"teacher_disagreement_score":0.78404164,"about_ca_system_score_codex":0.0002703417,"about_ca_system_score_gemma":0.0004503704,"threshold_uncertainty_score":0.99958265},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003765242,0.00008210416,0.9970399,0.00013500312,0.0012679587,0.00097003835,0.000010444646,0.00042949975,0.000027393655],"genre_scores_gemma":[0.3141362,0.0000104780775,0.6853046,0.0002872754,0.00014844586,0.000056480752,0.0000057207367,0.000031864212,0.000018916515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966235,0.000055885503,0.0006918921,0.0015096988,0.00067193026,0.00044706243],"domain_scores_gemma":[0.99610347,0.00062361336,0.0006701459,0.0018202037,0.00062263425,0.00015996609],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009374087,0.00046404675,0.0005027454,0.0010107742,0.00021872431,0.00019999334,0.0023284697,0.0005032087,0.0000071749355],"category_scores_gemma":[0.0002804951,0.00046150325,0.0001757381,0.0005382826,0.00042086706,0.00042765966,0.00028456107,0.0006013488,0.0000056829917],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001784792,0.000047348774,0.000012987728,0.00008410166,0.0000048970164,0.000002141964,0.00014965894,0.02306174,0.004110361,0.0156555,0.0000012439272,0.9568522],"study_design_scores_gemma":[0.00015156786,0.0006127495,0.00010271283,0.00027421725,0.000006998009,0.0000090701005,2.2727686e-7,0.75078475,0.136238,0.110484235,0.000918156,0.00041730097],"about_ca_topic_score_codex":0.000008270739,"about_ca_topic_score_gemma":0.00006233537,"teacher_disagreement_score":0.95643485,"about_ca_system_score_codex":0.0004160638,"about_ca_system_score_gemma":0.00023790699,"threshold_uncertainty_score":0.9997837},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006786307,0.0001355485,0.97996825,0.0007232707,0.002223254,0.00054005487,0.000011329402,0.00024178,0.016088668],"genre_scores_gemma":[0.09539064,0.000022041713,0.90032136,0.0034167483,0.0004454569,0.00002273262,0.00000772545,0.00005099801,0.00032229544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99490994,0.000036335972,0.0006133786,0.0020948157,0.0014040216,0.00094148336],"domain_scores_gemma":[0.99533486,0.0012183364,0.00029585607,0.0026396802,0.0001978277,0.0003134365],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00072042993,0.0007420991,0.0006441585,0.00093423686,0.00045421324,0.0011747213,0.0048648184,0.0003970223,0.0001663327],"category_scores_gemma":[0.00015947883,0.0005942188,0.00022387339,0.00061417464,0.0005525481,0.00056667294,0.0015550721,0.0010197136,0.00047583532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005108214,0.0000464563,0.00003598499,0.000015425825,0.0000055758965,0.00015723107,0.0001351791,0.088779986,0.00004331711,0.009726069,0.000127212,0.9009225],"study_design_scores_gemma":[0.00029234483,0.00026294714,0.00040309035,0.0004893019,0.000004068891,0.000019161558,5.277215e-8,0.93298405,0.00015404586,0.061956782,0.002722734,0.00071140827],"about_ca_topic_score_codex":0.000064425214,"about_ca_topic_score_gemma":0.00013286345,"teacher_disagreement_score":0.90021104,"about_ca_system_score_codex":0.00028506332,"about_ca_system_score_gemma":0.00032707592,"threshold_uncertainty_score":0.99986213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03140782,0.00035121464,0.96654266,0.00004565487,0.00007691218,0.00015703971,0.0000199745,0.000007416356,0.0013912945],"genre_scores_gemma":[0.9063326,0.000089227884,0.092677146,0.00046206653,0.00017779319,0.0000071634277,0.000088267196,0.00002509389,0.0001406187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99824005,0.00002135772,0.0002963878,0.00072907156,0.0004234288,0.00028972438],"domain_scores_gemma":[0.9990815,0.000028280838,0.00020669926,0.0003490879,0.000251637,0.00008281899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020503809,0.000293913,0.00030742033,0.00021634214,0.00006789573,0.000046762387,0.00042959218,0.00028075345,0.000052530668],"category_scores_gemma":[0.000017826238,0.0002388369,0.0001124863,0.0001731534,0.0005269762,0.000021603293,0.00012098992,0.00025844647,0.000003916103],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002920344,0.00014080298,0.00016559739,0.00010332831,0.00017463458,0.000109254084,0.00021321049,0.39811212,0.27954388,0.0003218749,0.000033101307,0.32079017],"study_design_scores_gemma":[0.0009848473,0.0027410234,0.00004666525,0.00064647326,0.0001719275,0.00027947113,0.0000022564082,0.102481484,0.82984495,0.060851768,0.00032406286,0.0016250552],"about_ca_topic_score_codex":0.000028309443,"about_ca_topic_score_gemma":0.00009711965,"teacher_disagreement_score":0.8749248,"about_ca_system_score_codex":0.000044303775,"about_ca_system_score_gemma":0.00029250412,"threshold_uncertainty_score":0.9739486},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042560645,0.00092075474,0.9894452,0.0029760543,0.0007578336,0.00063829747,0.000023572658,0.0001320518,0.00085017504],"genre_scores_gemma":[0.4687562,0.000039322986,0.52791154,0.0025033501,0.00040248438,0.000042263044,0.000149842,0.00003051742,0.00016443829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971017,0.000054805263,0.0004922307,0.00123878,0.00071626395,0.00039618034],"domain_scores_gemma":[0.9986297,0.00027009763,0.00018717679,0.0005370654,0.00022924812,0.0001467048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070175953,0.0003729408,0.00036712622,0.00043299937,0.0001955415,0.00043401442,0.0010103412,0.00027676576,0.000031477],"category_scores_gemma":[0.00005382022,0.00033410583,0.00004834007,0.00027140946,0.00021713642,0.0008264157,0.00044548896,0.0003713985,0.000036055666],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027430153,0.000020590312,0.00042631826,0.000011116032,0.000017298791,0.000008537526,0.0033158713,0.0040436564,0.0011624045,0.006689829,0.00036806555,0.9839089],"study_design_scores_gemma":[0.0015850948,0.0010370326,0.004428299,0.00022134444,0.00003859861,0.00004468754,0.0000052537935,0.6774688,0.004740378,0.29909444,0.009922935,0.0014131337],"about_ca_topic_score_codex":0.00015640912,"about_ca_topic_score_gemma":0.00054503215,"teacher_disagreement_score":0.9824957,"about_ca_system_score_codex":0.00018781684,"about_ca_system_score_gemma":0.00031654735,"threshold_uncertainty_score":0.99991107},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023829297,0.0008380503,0.9946591,0.0001675533,0.0006976795,0.00026443193,0.0000021475428,0.00009474391,0.0008933638],"genre_scores_gemma":[0.76675886,0.000018072229,0.2326969,0.00020844697,0.00015907624,0.0000038058656,0.0000024013177,0.000023357385,0.00012906107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577576,0.00008059992,0.0010163047,0.0013001768,0.0009204473,0.00090668723],"domain_scores_gemma":[0.99774504,0.00044817227,0.0006786064,0.00075299427,0.00023307532,0.00014208516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00247592,0.00052988454,0.00082276674,0.0011277071,0.00013262992,0.00028221347,0.0029433542,0.00033529176,0.000031523068],"category_scores_gemma":[0.0001837575,0.00047486363,0.00022837537,0.00077209546,0.00041483165,0.00061237154,0.0016498825,0.0010687049,0.000020227739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005864407,0.00014270302,0.0021575196,0.00020037172,0.00005115801,0.00013384417,0.011045392,0.1619585,0.0003079661,0.07354267,0.0000127313315,0.7504413],"study_design_scores_gemma":[0.0002455142,0.00004884908,0.00057404867,0.0008122396,0.000011999251,0.000034769095,0.0000013129011,0.9958917,0.00074763835,0.00092083943,0.0001790945,0.0005320089],"about_ca_topic_score_codex":0.00003872323,"about_ca_topic_score_gemma":0.00035839996,"teacher_disagreement_score":0.8339332,"about_ca_system_score_codex":0.00021129171,"about_ca_system_score_gemma":0.00028615788,"threshold_uncertainty_score":0.9997703},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022908445,0.00014365543,0.9724972,0.0004044122,0.00057503325,0.0016675146,0.000013050214,0.0001705428,0.0016201509],"genre_scores_gemma":[0.9559076,0.000007960958,0.040968068,0.0020276485,0.0003968445,0.000006106465,0.00003289426,0.00006455773,0.0005883507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977942,0.000008168429,0.00035109773,0.000828127,0.00056262664,0.0004557657],"domain_scores_gemma":[0.99735713,0.0014217446,0.00016760861,0.0004980028,0.00033560343,0.00021993676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036938096,0.0003907165,0.0005410712,0.00032165734,0.00018130016,0.00012623034,0.0002484954,0.00033769757,0.00014308993],"category_scores_gemma":[0.0001671071,0.00027965446,0.00011651408,0.00025196146,0.0006300181,0.00011031172,0.00004129354,0.0007806509,0.00001246079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011918196,0.000120394005,0.001675519,0.00017171087,0.00011649616,0.00019641365,0.0012435452,0.3847408,0.00261219,0.001252463,0.00000168747,0.60667694],"study_design_scores_gemma":[0.009522278,0.0018627017,0.0012225249,0.0009789399,0.00010227091,0.00019175466,4.9709104e-7,0.9321171,0.0020269703,0.027496511,0.023435606,0.0010428661],"about_ca_topic_score_codex":0.0000053843582,"about_ca_topic_score_gemma":0.000030932348,"teacher_disagreement_score":0.93299913,"about_ca_system_score_codex":0.00009329333,"about_ca_system_score_gemma":0.0003487382,"threshold_uncertainty_score":0.99996555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006656204,0.0008687632,0.99595344,0.000227526,0.0013621978,0.0002556399,0.0000140008815,0.00010018515,0.0011516633],"genre_scores_gemma":[0.3635633,0.000034390312,0.6353432,0.0005270344,0.00037099473,0.0000059331323,0.000014898348,0.00002706398,0.00011320752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962488,0.000033522756,0.00057640165,0.0010877668,0.0014946122,0.00055890763],"domain_scores_gemma":[0.996673,0.0005745671,0.00048116644,0.0017119686,0.00037535667,0.00018393421],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008282967,0.0004325263,0.00050615007,0.00071812567,0.00018324927,0.00025455075,0.0035454454,0.0003712127,0.0000592782],"category_scores_gemma":[0.00008241145,0.00037679795,0.00011577207,0.0005520873,0.0005896264,0.0010334112,0.0013813572,0.0006746504,0.000033316694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063804905,0.000066830406,0.0005850584,0.00006892641,0.000008073302,0.000023577359,0.00024351485,0.040376224,0.00039576474,0.024031142,0.000037349768,0.93415713],"study_design_scores_gemma":[0.00032033146,0.00014034318,0.0012402566,0.00064695167,0.000010080065,0.000023361525,8.0953555e-8,0.91965276,0.005525989,0.06957184,0.0021743178,0.00069371786],"about_ca_topic_score_codex":0.00004316928,"about_ca_topic_score_gemma":0.000028917902,"teacher_disagreement_score":0.93346345,"about_ca_system_score_codex":0.00014848524,"about_ca_system_score_gemma":0.00082435657,"threshold_uncertainty_score":0.9998684},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000047626336,0.00034298064,0.9952664,0.00032547952,0.00034115708,0.0014507131,0.0000106120315,0.0002994073,0.0019585064],"genre_scores_gemma":[0.031418115,0.000017230863,0.96718085,0.00041620032,0.000128939,0.000087932785,0.000011194761,0.000035611665,0.00070395286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970335,0.00004932603,0.00075350597,0.0010769214,0.00069301913,0.0003937546],"domain_scores_gemma":[0.997119,0.00033097877,0.0008412294,0.0010296339,0.0005868743,0.00009227553],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001409776,0.00038972666,0.0006229806,0.0005220039,0.00024853827,0.0011720344,0.004233617,0.00019091384,0.000008947475],"category_scores_gemma":[0.00008929954,0.0003389342,0.000120658384,0.00043195236,0.00048117558,0.0013308187,0.0010846128,0.00025238746,0.0000091329575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006811182,0.000024184712,0.00000234647,0.0010376389,0.000008903839,0.000006292463,0.00051274756,0.00006741591,0.02147577,0.01083459,0.00009162236,0.96593165],"study_design_scores_gemma":[0.00037535484,0.00021240335,0.000017063103,0.0015165933,0.000018927323,0.000030179603,0.0000012733271,0.60000116,0.3740127,0.022837289,0.0004529267,0.0005240999],"about_ca_topic_score_codex":0.0000077270215,"about_ca_topic_score_gemma":0.000001806566,"teacher_disagreement_score":0.96540755,"about_ca_system_score_codex":0.00028927875,"about_ca_system_score_gemma":0.00053839595,"threshold_uncertainty_score":0.99990624},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021539852,0.00037438556,0.9932083,0.0015817115,0.00093064486,0.00070461864,0.000015072291,0.00054402853,0.0026391114],"genre_scores_gemma":[0.015203368,0.0000863996,0.9819584,0.0015116535,0.0006047662,0.000060986218,0.000012655988,0.00004321572,0.00051854487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638975,0.000019467323,0.0005396931,0.0015650303,0.00084452116,0.0006415582],"domain_scores_gemma":[0.9968392,0.00042493406,0.00030364105,0.0019206017,0.00038253833,0.0001290357],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00107844,0.00047299758,0.00047159547,0.0007887623,0.0002608373,0.0005492827,0.004597425,0.00031330285,0.000011748081],"category_scores_gemma":[0.00019813035,0.0004542821,0.00013241073,0.0004467046,0.0004509575,0.0008541067,0.0009259521,0.0005240895,0.000030778127],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037546067,0.000012881159,0.0000058707114,0.000023386428,0.0000056082504,0.0000050263798,0.00014504613,0.0022571431,0.00048078145,0.057762645,0.00013566678,0.9391622],"study_design_scores_gemma":[0.0005119159,0.00019684753,0.00007182831,0.00044243963,0.000011003302,0.00006213591,8.3734356e-8,0.5302159,0.021047322,0.33215696,0.113943934,0.0013396036],"about_ca_topic_score_codex":0.000006701635,"about_ca_topic_score_gemma":0.00003904326,"teacher_disagreement_score":0.9378226,"about_ca_system_score_codex":0.0003515526,"about_ca_system_score_gemma":0.0004810423,"threshold_uncertainty_score":0.9997909},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021474976,0.00013869026,0.84345263,0.00029815637,0.00046100141,0.00021497405,0.000008217233,0.00006720619,0.15514436],"genre_scores_gemma":[0.8472331,0.000021310814,0.119035386,0.0014795318,0.0008839304,0.00002849605,0.0000051557563,0.00006892151,0.031244148],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996236,0.000087138804,0.0005418631,0.0013669981,0.0013886379,0.00037930836],"domain_scores_gemma":[0.9953474,0.0023773785,0.00043061448,0.0012810217,0.00041882682,0.0001448045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004239,0.00033995532,0.00042229384,0.0006052484,0.0004195285,0.00042045908,0.002049763,0.00018335083,0.00089038746],"category_scores_gemma":[0.0007051006,0.00022667338,0.0001020769,0.0007332474,0.0013687456,0.00029537405,0.00023921253,0.0004579412,0.00030101184],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000662741,0.000027118418,0.00025826143,0.0000074777718,0.000010729169,0.000025568152,0.0008128177,0.0038381252,0.000070171496,0.016538683,0.00021821454,0.9781266],"study_design_scores_gemma":[0.00032997405,0.00018552691,0.0016215821,0.00044616606,0.000026590515,0.00013778759,0.0000044782246,0.006963449,0.0029832958,0.87192845,0.1141362,0.0012365015],"about_ca_topic_score_codex":0.000007866732,"about_ca_topic_score_gemma":0.00006205379,"teacher_disagreement_score":0.97689,"about_ca_system_score_codex":0.000079760015,"about_ca_system_score_gemma":0.00024911982,"threshold_uncertainty_score":0.9749118},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017308612,0.00014918631,0.9950849,0.00067437266,0.0010981958,0.0002519675,0.0000063806197,0.000117039475,0.0026006573],"genre_scores_gemma":[0.084577434,0.00021938814,0.9118786,0.002189218,0.0005593479,0.00000688917,0.000017321014,0.000025541858,0.0005262479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977741,0.000026600737,0.00036963305,0.001023945,0.00050323975,0.0003024458],"domain_scores_gemma":[0.9984436,0.00036030606,0.00020991592,0.000647628,0.00020102227,0.00013750528],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003814963,0.0003259613,0.0003169052,0.00046738633,0.00028134117,0.00059686636,0.0007003058,0.00021978446,0.000030991578],"category_scores_gemma":[0.00010638112,0.00031863095,0.000056062698,0.0002542621,0.0004977982,0.0003994097,0.00043510372,0.00037049796,0.000022975399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.035125e-7,0.000006200709,0.00009866768,0.000007815064,0.000003258435,0.000013446028,0.0001390974,0.011776087,0.00009792526,0.010323699,0.000024765986,0.9775087],"study_design_scores_gemma":[0.00021648896,0.00009628372,0.00030858506,0.00007867449,0.0000053794492,0.00010249811,4.0746983e-8,0.9828655,0.00019150811,0.014386955,0.0013690161,0.00037906467],"about_ca_topic_score_codex":0.000009772502,"about_ca_topic_score_gemma":0.00007652012,"teacher_disagreement_score":0.9771297,"about_ca_system_score_codex":0.0001380551,"about_ca_system_score_gemma":0.0003081689,"threshold_uncertainty_score":0.99992657},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022761131,0.0010904606,0.99506,0.00000654493,0.0026264156,0.00028506725,0.0000044554736,0.00026626358,0.00043316124],"genre_scores_gemma":[0.051239148,0.000045720117,0.94657093,0.00009461483,0.0018992965,0.000004417548,0.000011861377,0.0001077386,0.00002624981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978468,0.000011750303,0.00042072445,0.0006717261,0.0004488033,0.0006002124],"domain_scores_gemma":[0.998835,0.0003069067,0.00015038902,0.0005009253,0.00009640114,0.00011032516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001813214,0.0004718846,0.00041660864,0.00024143688,0.00023506989,0.00012900797,0.0005521211,0.00042634484,0.000028778846],"category_scores_gemma":[0.000022949718,0.00051728665,0.00006507211,0.0004051088,0.00024370737,0.00025766582,0.00018696902,0.0010042087,0.000006056247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014192163,0.0000014465891,0.00007911473,0.000009201558,0.000006157335,0.000018368908,0.000056989953,0.76551896,0.000035708275,0.00005402851,0.0000018251086,0.2342168],"study_design_scores_gemma":[0.000109896326,0.00002171916,0.00040036652,0.0003979589,0.00001176256,0.0000339359,5.3677866e-8,0.97948956,0.00007184181,0.018750696,0.00018181874,0.0005303816],"about_ca_topic_score_codex":0.000009210907,"about_ca_topic_score_gemma":0.000020161673,"teacher_disagreement_score":0.23368642,"about_ca_system_score_codex":0.00029298206,"about_ca_system_score_gemma":0.00007138222,"threshold_uncertainty_score":0.99972785},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026645116,0.001180917,0.99452215,0.0004375145,0.00013754275,0.0002523543,0.0000011694128,0.0000842476,0.00071959617],"genre_scores_gemma":[0.95329,0.00005312885,0.042563383,0.003314301,0.0006841931,0.000009775027,0.000024762941,0.000036860067,0.000023581872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818695,0.000003797437,0.00028916256,0.0009031284,0.0002894821,0.0003274681],"domain_scores_gemma":[0.99914795,0.00001831021,0.00014563574,0.0003679142,0.00027143813,0.0000487377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038233123,0.00029123432,0.00038811847,0.00061650365,0.0003932697,0.00050616486,0.00039858872,0.00012342437,0.000006583667],"category_scores_gemma":[0.000016388789,0.00027549427,0.000028630458,0.00037631934,0.00012238839,0.00065245,0.00041020586,0.00025705327,0.00001116749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008911674,0.000007838764,0.00012389733,0.00024248159,0.000004715241,0.0000015301297,0.0005651547,0.25143635,0.000014325611,0.001407922,0.0000020013717,0.7461849],"study_design_scores_gemma":[0.00010514476,0.000012412895,0.0000228449,0.0003237156,0.000019001767,0.0000017339576,0.0000027638566,0.9804604,0.000003851334,0.018276034,0.0004511246,0.00032094767],"about_ca_topic_score_codex":0.00093762355,"about_ca_topic_score_gemma":0.00065129553,"teacher_disagreement_score":0.9519588,"about_ca_system_score_codex":0.000058890317,"about_ca_system_score_gemma":0.00007913481,"threshold_uncertainty_score":0.9999697},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020694807,0.008040704,0.9373398,0.030612323,0.015303286,0.0038475606,0.00001717162,0.00024889573,0.002520814],"genre_scores_gemma":[0.81862676,0.0055299005,0.057700925,0.043526866,0.051748935,0.00097428245,0.00009270396,0.000903902,0.020895712],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9929327,0.00034955016,0.0015322223,0.001483134,0.0007100302,0.002992381],"domain_scores_gemma":[0.99123865,0.005480083,0.0012962588,0.0013839856,0.0003010393,0.00029996876],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0136827985,0.00059648603,0.0008588394,0.00039818257,0.007393612,0.00019375261,0.0020951082,0.0006002172,0.00002262322],"category_scores_gemma":[0.00043505634,0.0003754449,0.00015004385,0.00049811526,0.000716659,0.00013989379,0.0010869296,0.0059343306,0.0000120789755],"study_design_candidate":"design_other","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.000033930857,0.000009049772,0.0007145174,0.0004113422,0.000023723669,0.0000013144028,0.0044995705,0.00026466497,0.000017074459,0.020558804,0.00032574055,0.97314024],"study_design_scores_gemma":[0.001525023,0.0011707853,0.0011460562,0.003496766,0.000039304858,0.00008508629,0.000035897032,0.27465233,0.00004056141,0.1653883,0.5510205,0.0013993424],"about_ca_topic_score_codex":0.00079524145,"about_ca_topic_score_gemma":0.023459379,"teacher_disagreement_score":0.9717409,"about_ca_system_score_codex":0.0016784216,"about_ca_system_score_gemma":0.0043172417,"threshold_uncertainty_score":0.99986976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022420687,0.00018228227,0.99487317,0.0006412541,0.0007698236,0.00044740987,0.000004216424,0.0003655839,0.002492028],"genre_scores_gemma":[0.24243003,0.00003224161,0.75487036,0.0018587615,0.0005969168,0.000016207663,0.000013202995,0.00006227069,0.000119986595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656045,0.000038099042,0.0005289931,0.0015732879,0.00067511277,0.000624063],"domain_scores_gemma":[0.9972818,0.00025461052,0.00033821192,0.0016705885,0.00025479926,0.00020000084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048087866,0.00050668593,0.0004157936,0.0005534397,0.00043321942,0.0005030576,0.0031654218,0.00032033148,0.000022306565],"category_scores_gemma":[0.000018047584,0.000478346,0.00013209069,0.0009758234,0.0003253548,0.00053685124,0.0006694962,0.0006810314,0.00005049895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058552164,0.00011690697,0.0002011358,0.00006548529,0.000018862493,0.00004605631,0.000722411,0.027409542,0.0056039463,0.061901417,0.000070286354,0.9038381],"study_design_scores_gemma":[0.00019478313,0.000055771823,0.00013607703,0.00019675556,0.000013912799,0.000022372567,8.318446e-8,0.94149774,0.0022769398,0.05371,0.0013214077,0.0005741711],"about_ca_topic_score_codex":0.000023730108,"about_ca_topic_score_gemma":0.000032629843,"teacher_disagreement_score":0.9140882,"about_ca_system_score_codex":0.0003301358,"about_ca_system_score_gemma":0.00057744316,"threshold_uncertainty_score":0.9997668},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03432848,0.0005429798,0.9619529,0.00011591349,0.0012955875,0.00036256493,0.0000026493262,0.00015593128,0.0012429527],"genre_scores_gemma":[0.9609588,0.000025596182,0.0364723,0.00016712246,0.00077531685,0.00001734439,0.0000025068061,0.000047237143,0.0015337939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958486,0.00015936981,0.00061671936,0.0013595292,0.0011432583,0.0008725295],"domain_scores_gemma":[0.99796987,0.0005329085,0.00038674378,0.0007371559,0.00018054429,0.00019277562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016094997,0.0005968707,0.0005953737,0.0012498229,0.00035020072,0.0005801393,0.0015157659,0.00022997316,0.00003156365],"category_scores_gemma":[0.00012194189,0.00047218645,0.00015116487,0.00044486954,0.0002551795,0.0011018112,0.00064617785,0.0015323403,0.000049889597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032855562,0.00026854244,0.015115676,0.00041354093,0.00015548646,0.0010060355,0.033629447,0.40674445,0.0051361695,0.066982016,0.000003232125,0.47021684],"study_design_scores_gemma":[0.0062887827,0.0031577516,0.08725772,0.037908178,0.00013273713,0.0067578605,0.0002142037,0.6562818,0.072454676,0.020241093,0.094690874,0.014614304],"about_ca_topic_score_codex":0.000047391903,"about_ca_topic_score_gemma":0.000056597437,"teacher_disagreement_score":0.9266303,"about_ca_system_score_codex":0.00086752186,"about_ca_system_score_gemma":0.0003598938,"threshold_uncertainty_score":0.99977297},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004604224,0.00022237466,0.9965518,0.00064466975,0.0004974926,0.0006285848,0.000012188809,0.00040026964,0.0009965894],"genre_scores_gemma":[0.034236543,0.000058547666,0.9637801,0.0012482628,0.00040326,0.000015802538,0.000049817576,0.000041835934,0.00016581052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575657,0.00005752659,0.00055225525,0.0017380881,0.0012787608,0.000616789],"domain_scores_gemma":[0.99752074,0.00053065165,0.0002864375,0.0008696768,0.0005026204,0.00028986917],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016332249,0.00055853755,0.0005947616,0.00043400007,0.0004320667,0.0010501154,0.0029120988,0.0008791367,0.00001679875],"category_scores_gemma":[0.00041818173,0.00045467092,0.000115179275,0.00057953043,0.0018882023,0.0010864444,0.00078265654,0.001745275,0.0000031119832],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007600682,0.00020277804,0.00001295093,0.00011969366,0.00002274818,0.000048457772,0.0013062055,0.000017644657,0.01565699,0.067847334,0.00004011879,0.91464907],"study_design_scores_gemma":[0.0009731672,0.001326505,0.00010550456,0.00034821217,0.00002409149,0.00043013968,0.0000040775267,0.73387116,0.1438824,0.11415948,0.0032919117,0.0015833337],"about_ca_topic_score_codex":0.000019337196,"about_ca_topic_score_gemma":0.000011957259,"teacher_disagreement_score":0.91306573,"about_ca_system_score_codex":0.000114413706,"about_ca_system_score_gemma":0.00080049364,"threshold_uncertainty_score":0.9999869},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014041414,0.0015556621,0.9915898,0.00016225249,0.0032975366,0.00040470832,0.0000025788463,0.0004548432,0.0011284641],"genre_scores_gemma":[0.5987299,0.00023676189,0.3990025,0.0006691184,0.0010120475,0.000018458524,0.000004980299,0.000052043,0.00027418713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953782,0.00002778088,0.000716135,0.0015407591,0.0012610538,0.0010760734],"domain_scores_gemma":[0.99667597,0.0002439147,0.00025946868,0.0022068254,0.00034307048,0.00027073026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015351468,0.00064857205,0.000647946,0.0007028661,0.00042367273,0.0003689843,0.0038359254,0.0004933173,0.0000297688],"category_scores_gemma":[0.00008502404,0.0005458769,0.0001811333,0.00060006866,0.00044875886,0.0016660586,0.0016143061,0.0010396068,0.00026152085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037803534,0.000022133732,0.0010733056,0.00014314624,0.000007854761,0.000010386005,0.000589887,0.12664223,0.0000079432675,0.0010225177,0.000007307028,0.8704695],"study_design_scores_gemma":[0.00019615382,0.00010742389,0.00019498245,0.0005865038,0.000008363425,0.00009808433,8.735735e-8,0.9787293,0.00027657015,0.018016353,0.0009455022,0.00084066537],"about_ca_topic_score_codex":0.000018832046,"about_ca_topic_score_gemma":0.000011667675,"teacher_disagreement_score":0.86962885,"about_ca_system_score_codex":0.0004557384,"about_ca_system_score_gemma":0.0006456024,"threshold_uncertainty_score":0.9996993},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010692211,0.0002626605,0.9939886,0.0006812169,0.0018021106,0.00031177228,0.0000057218303,0.0002511641,0.0016275374],"genre_scores_gemma":[0.54367757,0.00001834397,0.45375663,0.0017419005,0.0003450845,0.00001218483,0.0000042568245,0.00005107132,0.00039297878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616295,0.00007625465,0.0005457933,0.001590356,0.00077801227,0.00084666203],"domain_scores_gemma":[0.9976127,0.0003395976,0.00021101444,0.0013933806,0.00018702939,0.00025626615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015307742,0.00050956657,0.0005319775,0.00040739088,0.00024805736,0.00053792074,0.0025124035,0.00025006066,0.000043897595],"category_scores_gemma":[0.00011107037,0.0004885661,0.0001289162,0.00061143306,0.00026723742,0.000784313,0.00094137696,0.00066656206,0.000119438235],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000080638665,0.000029870353,0.00028386485,0.000023627488,0.000007929795,0.000063411215,0.000756695,0.00660895,0.0013046195,0.002021878,0.00004899121,0.98884207],"study_design_scores_gemma":[0.0013072995,0.0010045551,0.004588659,0.0016364068,0.000030892406,0.0003272196,3.9753215e-7,0.49858484,0.2270151,0.24989055,0.011813558,0.0038005349],"about_ca_topic_score_codex":0.00005252267,"about_ca_topic_score_gemma":0.00019613837,"teacher_disagreement_score":0.98504156,"about_ca_system_score_codex":0.00019961945,"about_ca_system_score_gemma":0.00012624184,"threshold_uncertainty_score":0.9997566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048529432,0.002434208,0.995007,0.00059244095,0.00042601387,0.00030186956,0.0000035771584,0.00006375532,0.0006858721],"genre_scores_gemma":[0.5291963,0.00019589398,0.4698162,0.00027951945,0.00034636277,0.000022019402,0.000006660488,0.000017507105,0.00011948274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980073,0.000021003232,0.00033986982,0.00085136126,0.0003670873,0.00041339168],"domain_scores_gemma":[0.9988671,0.00017461294,0.00015382313,0.0006053769,0.000084394764,0.00011470505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005422321,0.00026341455,0.00023815947,0.00061698566,0.00017904668,0.00015855406,0.0010002,0.00019115902,0.000008207783],"category_scores_gemma":[0.000017483717,0.00026743353,0.000040573374,0.00042688864,0.00030362676,0.00072053925,0.0005974537,0.00041826777,0.000035710324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018806679,0.000038306112,0.00036799497,0.0000171852,0.0000033196122,0.0000070526407,0.000747313,0.03704809,0.00019881474,0.17232287,0.000006579908,0.7892406],"study_design_scores_gemma":[0.00015362998,0.000039545972,0.011353917,0.000081309285,0.0000029594808,0.000039668033,2.418394e-7,0.76354945,0.00003094577,0.2236366,0.0007955682,0.00031620104],"about_ca_topic_score_codex":0.00005932042,"about_ca_topic_score_gemma":0.00016642484,"teacher_disagreement_score":0.7889244,"about_ca_system_score_codex":0.00045373102,"about_ca_system_score_gemma":0.00029377552,"threshold_uncertainty_score":0.99997777},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000838754,0.00013030952,0.99090934,0.0014085702,0.0007104697,0.0006616303,0.000007504882,0.000074380856,0.005259017],"genre_scores_gemma":[0.6827587,0.000034358094,0.30949786,0.0063065845,0.00013040865,0.000044389435,9.839664e-7,0.000077951794,0.0011487595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555445,0.00008669129,0.00051615096,0.0014649461,0.0015735422,0.00080421695],"domain_scores_gemma":[0.9940338,0.0024046036,0.00023232508,0.0028051245,0.0002972346,0.00022687243],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001221346,0.0005202387,0.0005395846,0.0014895552,0.00021270601,0.00024863932,0.006196407,0.00020011129,0.0001222267],"category_scores_gemma":[0.00041937988,0.00035538088,0.0002218467,0.0014891374,0.0011663277,0.0003202505,0.0018900735,0.00092850317,0.00011270617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027078759,0.00007697844,0.000029543779,0.000026456111,0.000023318546,0.00011916559,0.0017483713,0.009972264,0.00059331936,0.509626,0.00013362041,0.47762394],"study_design_scores_gemma":[0.0001993572,0.00085898506,0.0000864677,0.0004282787,0.00000405832,0.000039488787,1.8255521e-7,0.048545986,0.0049667885,0.94331425,0.000940351,0.0006157869],"about_ca_topic_score_codex":0.0000045024412,"about_ca_topic_score_gemma":0.000012795613,"teacher_disagreement_score":0.68191993,"about_ca_system_score_codex":0.00013526564,"about_ca_system_score_gemma":0.00013884957,"threshold_uncertainty_score":0.9998898},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022799252,0.00021173464,0.995638,0.0005108398,0.0021188015,0.0009850466,0.000007656715,0.000094654155,0.00020523492],"genre_scores_gemma":[0.23877698,0.000019163122,0.76043063,0.00027469703,0.00037366658,0.00006574367,0.0000037975544,0.000020505311,0.00003480469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716514,0.0000489631,0.0005980297,0.0010033475,0.00076576264,0.0004187335],"domain_scores_gemma":[0.9963619,0.0011515014,0.00047637487,0.0015121158,0.00039969466,0.00009839662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002068183,0.00033813107,0.00037591686,0.0005033085,0.00033992526,0.00027407112,0.003175123,0.00024131197,0.0000017833536],"category_scores_gemma":[0.0004053865,0.00026277706,0.00014083185,0.0005131443,0.00039938837,0.0004045334,0.00047155743,0.0003316921,0.000008740793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014657123,0.000009100514,0.000021654369,0.000047981808,0.000008761433,4.5989606e-7,0.001302,0.047177162,0.0058493256,0.12307504,0.000032255957,0.8224616],"study_design_scores_gemma":[0.00017377861,0.00018546572,0.0006126846,0.0001619424,0.0000116776,0.000006906046,8.970045e-7,0.95492375,0.016015809,0.024138372,0.003457165,0.00031152714],"about_ca_topic_score_codex":0.000029149754,"about_ca_topic_score_gemma":0.00003263198,"teacher_disagreement_score":0.9077466,"about_ca_system_score_codex":0.00024207293,"about_ca_system_score_gemma":0.00017026246,"threshold_uncertainty_score":0.9999824},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021112134,0.00086015975,0.9970052,0.000017185,0.00016082976,0.0012921011,0.000019465013,0.00020506763,0.00022887265],"genre_scores_gemma":[0.74135673,0.000035460027,0.25824207,0.00005213197,0.00019768112,0.00005647092,0.0000050698613,0.00004869669,0.000005692165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983317,0.00001675293,0.00046953818,0.0004888878,0.00033440418,0.00035870587],"domain_scores_gemma":[0.99889404,0.00012645492,0.00023350569,0.00045270784,0.0001978092,0.000095496485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035069598,0.00036392972,0.0005158885,0.0003760738,0.00006685821,0.00004183122,0.00032783544,0.0003069826,0.0000017241487],"category_scores_gemma":[0.000026019887,0.00035483157,0.00005415837,0.00014768673,0.00026809168,0.0003491108,0.00009314523,0.00031344508,0.0000012761626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015899475,0.0000061993924,0.000044202265,0.000083981344,0.00001628258,5.3786493e-7,0.00023682162,0.9227365,0.019176714,0.00039259502,1.7343989e-7,0.05729004],"study_design_scores_gemma":[0.0003123993,0.000048437087,0.000013507261,0.00024623747,0.000027596978,0.00000834122,2.017361e-7,0.9844044,0.008927675,0.0056886887,0.0000148168765,0.00030768398],"about_ca_topic_score_codex":0.000010916727,"about_ca_topic_score_gemma":0.000009001527,"teacher_disagreement_score":0.7411456,"about_ca_system_score_codex":0.0002937392,"about_ca_system_score_gemma":0.000060319384,"threshold_uncertainty_score":0.9998904},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0314675,0.00020386477,0.9669074,0.00033226164,0.0007248172,0.00020349605,0.000002304088,0.00013232935,0.000026029016],"genre_scores_gemma":[0.5220114,0.0000038159865,0.47731608,0.0006050099,0.00005568391,0.0000031545603,9.4676506e-7,0.0000037524178,1.6565082e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722165,0.00006407329,0.00036357463,0.0009716143,0.0005020299,0.000877034],"domain_scores_gemma":[0.9982475,0.000559577,0.00008817939,0.00086016057,0.000080923746,0.00016365017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002659318,0.00022063772,0.0002088249,0.0008260604,0.00018390412,0.0003381147,0.0022919998,0.00010919316,0.0000062762647],"category_scores_gemma":[0.0002514161,0.00020549363,0.00005610784,0.004121172,0.00030248714,0.0009973407,0.001020173,0.0004607559,0.000011192691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013089028,0.00030907866,0.031462394,0.000052715804,0.000003408791,0.00034498924,0.008538375,0.022423668,0.0013365012,0.00665233,0.00001801519,0.9288454],"study_design_scores_gemma":[0.0007956627,0.00011967482,0.067350775,0.00012494529,0.0000015749026,0.00006008724,0.0000042382253,0.91544527,0.005132502,0.010126143,0.0003228727,0.0005162682],"about_ca_topic_score_codex":0.00012874068,"about_ca_topic_score_gemma":0.0009801076,"teacher_disagreement_score":0.92832917,"about_ca_system_score_codex":0.000115217495,"about_ca_system_score_gemma":0.000118399075,"threshold_uncertainty_score":0.8379787},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028163972,0.00020873496,0.993013,0.0005783177,0.0011094536,0.0014964449,0.0000028687439,0.00013626355,0.0031732656],"genre_scores_gemma":[0.107848614,0.000053424123,0.88831013,0.0013896081,0.000613388,0.00011491935,0.00011657699,0.000049160008,0.001504187],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981244,0.000032366617,0.00034679478,0.00075757946,0.000349474,0.00038935305],"domain_scores_gemma":[0.99861556,0.0002536802,0.00022758511,0.0005571704,0.00022423688,0.00012177937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052812905,0.00029416764,0.00035409612,0.0006570631,0.00020438197,0.0001974115,0.00051793084,0.00023711534,0.00019927173],"category_scores_gemma":[0.00007367535,0.00027512267,0.00017534806,0.0002186059,0.00022981834,0.00027016783,0.00014629081,0.00031940587,0.000044301225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041931493,0.0003419899,0.0011227446,0.0017054246,0.00025853261,0.000012297349,0.003935501,0.006733544,0.000055823562,0.43809894,0.000298175,0.5473951],"study_design_scores_gemma":[0.0008793668,0.0011158863,0.0019463543,0.0054039797,0.0005990372,0.0000089531995,0.000015677782,0.30048442,0.0001199403,0.6859226,0.0027573954,0.0007463437],"about_ca_topic_score_codex":0.0000025733277,"about_ca_topic_score_gemma":0.00001015905,"teacher_disagreement_score":0.54664874,"about_ca_system_score_codex":0.00029250968,"about_ca_system_score_gemma":0.00010155547,"threshold_uncertainty_score":0.9999701},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030537817,0.00016832219,0.9915906,0.00012432311,0.0012698736,0.00033882612,0.0000022497725,0.00023900664,0.00596142],"genre_scores_gemma":[0.7505197,0.000020797876,0.24764782,0.0010549539,0.00022603098,0.0000032715716,0.000007955206,0.000038175305,0.00048131385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964743,0.00011629204,0.00055029715,0.0014141784,0.0007917113,0.00065318466],"domain_scores_gemma":[0.997384,0.0007255693,0.0005230818,0.0007422085,0.00042351833,0.00020163301],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000995052,0.000506183,0.0005144748,0.0008445657,0.00051887677,0.00055707124,0.0014903188,0.0003147879,0.000036831752],"category_scores_gemma":[0.00035473003,0.00051538326,0.00013495554,0.00050834456,0.0007043549,0.000871302,0.00084402657,0.0011856247,0.000115881536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016129903,0.000026004487,0.0002053245,0.000022789864,0.000022845343,0.00013815408,0.005973326,0.0897695,0.0013922569,0.03256311,0.000006191289,0.86986434],"study_design_scores_gemma":[0.000433334,0.00012744965,0.00016764607,0.0003269747,0.000010374117,0.00011127126,0.0000028002414,0.97227716,0.0017919053,0.020257529,0.0037667006,0.0007268703],"about_ca_topic_score_codex":0.00008253041,"about_ca_topic_score_gemma":0.00006758167,"teacher_disagreement_score":0.8825076,"about_ca_system_score_codex":0.00031473814,"about_ca_system_score_gemma":0.0005237329,"threshold_uncertainty_score":0.99972975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000066094035,0.002304808,0.9907641,0.0011740929,0.0039753634,0.00083250337,0.0000071708673,0.00013744512,0.000738431],"genre_scores_gemma":[0.25102586,0.0003700173,0.74439645,0.00034306778,0.0014452277,0.00006025357,0.00003497351,0.00005296416,0.0022711914],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99505204,0.000081709215,0.0005573254,0.001597432,0.0017477889,0.0009636823],"domain_scores_gemma":[0.99609685,0.0007525078,0.00025927328,0.0016079036,0.0010167729,0.00026668172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004622217,0.00036372844,0.00040524147,0.007924832,0.0006648869,0.0007206626,0.0030841655,0.0004693527,0.000025669533],"category_scores_gemma":[0.00035323756,0.00033717154,0.00015400724,0.0065634483,0.0008132832,0.0008238756,0.0011796093,0.0008550368,0.00014650311],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009111381,0.00008074984,0.000010585487,0.00005536435,0.000009053421,0.00000423977,0.0005497753,0.00041249773,0.0009237928,0.06734315,0.00045864627,0.93014306],"study_design_scores_gemma":[0.0010571483,0.0006353213,0.00068161526,0.00035244922,0.000022011674,0.0002016115,0.0000011484075,0.42550367,0.009070297,0.44893706,0.111696556,0.0018411083],"about_ca_topic_score_codex":0.000034190296,"about_ca_topic_score_gemma":0.0000070553656,"teacher_disagreement_score":0.92830193,"about_ca_system_score_codex":0.0005830305,"about_ca_system_score_gemma":0.00041297515,"threshold_uncertainty_score":0.99990803},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000075563275,0.00023258915,0.9506551,0.00043912322,0.0011392658,0.00036535852,0.0000020506586,0.00031150467,0.04684742],"genre_scores_gemma":[0.02798958,0.000053725864,0.9683372,0.0019550961,0.00036030667,0.000011488322,0.0000036346917,0.00004866652,0.0012403331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959433,0.000045705798,0.0005644673,0.0016072978,0.0010203589,0.0008188599],"domain_scores_gemma":[0.9968856,0.00048361754,0.0002920878,0.0015724268,0.00048432278,0.00028192895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011099133,0.0005132744,0.00046855203,0.00090550166,0.0003312368,0.00064587436,0.004039736,0.00032032648,0.00009112689],"category_scores_gemma":[0.0002598106,0.00046732952,0.00010524675,0.0010045563,0.00067152106,0.0008572231,0.0019720893,0.00091572787,0.00016161015],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021552814,0.000031128504,0.00009239942,0.000032055425,0.00000679649,0.00008831912,0.0008616605,0.0313262,0.000055646717,0.049977783,0.00003936475,0.9174865],"study_design_scores_gemma":[0.00023006678,0.00019093964,0.000099144374,0.0003818467,0.000003750716,0.00008307408,5.5998434e-8,0.7593708,0.00040966985,0.2357968,0.00271348,0.00072036166],"about_ca_topic_score_codex":0.000034642966,"about_ca_topic_score_gemma":0.000038713737,"teacher_disagreement_score":0.9167661,"about_ca_system_score_codex":0.0001796717,"about_ca_system_score_gemma":0.0007679389,"threshold_uncertainty_score":0.99977785},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000060616494,0.00063001004,0.99617976,0.00069263694,0.0007958008,0.0005164134,0.000009859936,0.0004927253,0.00067671505],"genre_scores_gemma":[0.02545797,0.00006179463,0.97240615,0.001425394,0.00033492962,0.000026520864,0.000013098035,0.00003317387,0.00024099322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637944,0.000041355837,0.0006146019,0.001364545,0.0007753506,0.0008246912],"domain_scores_gemma":[0.9961562,0.0011793625,0.0004446387,0.0016555683,0.0003448789,0.00021933552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012092034,0.0005282796,0.00075903494,0.0016646328,0.00030729917,0.0006238544,0.0033323446,0.000411579,0.000024689461],"category_scores_gemma":[0.00018741748,0.00049272616,0.00032415014,0.0016536678,0.00034145114,0.00047679848,0.000937291,0.0006259348,0.00002483613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006685357,0.000049387156,0.0000851271,0.00006483016,0.00012680919,0.000011644988,0.0009861153,0.23936617,0.0000067373903,0.24568108,0.000095742835,0.51351964],"study_design_scores_gemma":[0.000082244966,0.00007425459,0.00003729906,0.00012742673,0.000057045254,0.000007184409,5.4185943e-8,0.6383872,0.00021027676,0.35940814,0.0011533147,0.00045551866],"about_ca_topic_score_codex":0.000011372609,"about_ca_topic_score_gemma":0.000011395212,"teacher_disagreement_score":0.51306415,"about_ca_system_score_codex":0.00024422607,"about_ca_system_score_gemma":0.00031656554,"threshold_uncertainty_score":0.99975246},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013413631,0.00025380583,0.9979294,0.0004082743,0.00055226474,0.0002671213,0.00015237708,0.000058660975,0.00024396506],"genre_scores_gemma":[0.11024703,0.000016967684,0.8890275,0.00016993616,0.00035676832,0.000001947224,0.00011523615,0.00002557315,0.000039059876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958925,0.00014850509,0.00087316247,0.0014708362,0.0010943385,0.00052062044],"domain_scores_gemma":[0.9960004,0.0008346697,0.00075186766,0.0017730872,0.00048069924,0.00015924026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016868653,0.0004545043,0.00082883495,0.00060015847,0.00022042713,0.00014761058,0.004597502,0.00036840115,0.000009546019],"category_scores_gemma":[0.0004872914,0.00041376555,0.00012313268,0.0008649776,0.00069704436,0.000465965,0.002899345,0.0011802904,8.233435e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024314837,0.00020831333,0.00018658693,0.0005148875,0.000069250054,0.000031433712,0.0012728974,0.18603204,0.0014431999,0.13190785,0.000015554097,0.67829365],"study_design_scores_gemma":[0.00020132336,0.00009471874,0.00012275041,0.0005491875,0.00002385222,0.000054992714,1.0630707e-7,0.8824409,0.00029727517,0.11560312,0.0002486885,0.0003630438],"about_ca_topic_score_codex":0.000021660004,"about_ca_topic_score_gemma":0.00002498744,"teacher_disagreement_score":0.69640887,"about_ca_system_score_codex":0.0001126742,"about_ca_system_score_gemma":0.00081536657,"threshold_uncertainty_score":0.99983144},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005663759,0.00003609388,0.9909775,0.0006043535,0.0012508684,0.0005820679,0.0000559871,0.000042507887,0.0007868294],"genre_scores_gemma":[0.8570103,0.000007460759,0.14054051,0.0012326441,0.0003722068,0.00004485681,0.00008488809,0.000029916988,0.0006771817],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956904,0.00002992724,0.0012548293,0.000982483,0.0014692448,0.00057312986],"domain_scores_gemma":[0.997441,0.0007486942,0.0007287131,0.0006099645,0.00035003593,0.000121616984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037795035,0.00036089122,0.0005284359,0.0014243183,0.00018374388,0.0006285922,0.001643835,0.0002970401,0.0003352195],"category_scores_gemma":[0.0010205121,0.00029527457,0.0002572059,0.0006962514,0.0003805735,0.00084287266,0.00062689977,0.00062171294,0.000103113736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073172436,0.00007112299,0.00471189,0.000048040893,0.000013054081,0.000043573804,0.003580189,0.0016073316,0.00005194189,0.074464895,0.0002903682,0.9150444],"study_design_scores_gemma":[0.00040017732,0.00016322533,0.012192271,0.0005644501,0.000015771077,0.000012240417,0.000012485039,0.123779036,0.00007986033,0.8601191,0.002056198,0.00060515356],"about_ca_topic_score_codex":0.00001575461,"about_ca_topic_score_gemma":0.00010821355,"teacher_disagreement_score":0.91443926,"about_ca_system_score_codex":0.00025831818,"about_ca_system_score_gemma":0.00015538569,"threshold_uncertainty_score":0.99994993},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023121327,0.00050021015,0.9965992,0.0006075052,0.00079351605,0.00035322882,0.000045412155,0.00017339872,0.0006963319],"genre_scores_gemma":[0.37195593,0.000045861838,0.6271897,0.00035692798,0.00029851173,0.0000032075075,0.00005924834,0.00002891049,0.00006168365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964565,0.000090627655,0.00054276205,0.0013506705,0.0010213038,0.00053810625],"domain_scores_gemma":[0.99431735,0.00066905137,0.00071713736,0.003927879,0.00027282606,0.00009577163],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010801163,0.0004210261,0.00045621445,0.0004982699,0.00027664684,0.00029565036,0.010398291,0.00032307848,0.000023115004],"category_scores_gemma":[0.00029582458,0.00031050795,0.000055139855,0.0006639596,0.001004966,0.0014648115,0.0053436775,0.0012418735,0.000009016763],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022958677,0.000010184462,0.00020719768,0.000023735409,0.000014236922,0.0000048789625,0.0016073969,0.00044900298,0.0013147274,0.012461767,0.00008155927,0.983823],"study_design_scores_gemma":[0.0005507007,0.00038364972,0.0035819488,0.0013714322,0.00007384687,0.0002991593,0.0000076049128,0.650172,0.04598125,0.270817,0.024132667,0.0026287474],"about_ca_topic_score_codex":0.000022663075,"about_ca_topic_score_gemma":0.00003126063,"teacher_disagreement_score":0.98119426,"about_ca_system_score_codex":0.00016176875,"about_ca_system_score_gemma":0.00044854157,"threshold_uncertainty_score":0.9999347},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010862023,0.00019809708,0.9878263,0.00079953735,0.0008025364,0.00017352395,0.000002631922,0.000329242,0.00975952],"genre_scores_gemma":[0.456019,0.000008760302,0.53928244,0.0019398363,0.0012316487,0.00000784596,0.000011191115,0.000068589696,0.0014306752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963041,0.000064990716,0.00035895416,0.0015377363,0.0010317869,0.0007024414],"domain_scores_gemma":[0.9972284,0.00074161036,0.00031762169,0.0013617768,0.00015862624,0.00019200568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010635655,0.0005575164,0.00052887056,0.00048821946,0.00030804056,0.0009781416,0.0032264823,0.00020409172,0.00004271857],"category_scores_gemma":[0.00018484997,0.00042988884,0.000090548165,0.00037799246,0.00045790593,0.0002698,0.0009768881,0.0011035965,0.000048359572],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001882072,0.0000092061355,0.00060466485,0.00005471116,0.000010259814,0.00016199898,0.0009977272,0.01504529,0.000008705959,0.009007272,0.000017342745,0.9740809],"study_design_scores_gemma":[0.0004744507,0.00041362795,0.00075555645,0.001426976,0.00001787477,0.00028210264,8.19632e-7,0.957947,0.00029850093,0.028857984,0.007940765,0.001584347],"about_ca_topic_score_codex":0.00020584886,"about_ca_topic_score_gemma":0.00026873147,"teacher_disagreement_score":0.97249657,"about_ca_system_score_codex":0.00011956222,"about_ca_system_score_gemma":0.0002139625,"threshold_uncertainty_score":0.9998153},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003654689,0.00047633526,0.9959666,0.0003698984,0.0012283466,0.00059285195,0.00000233692,0.00019371742,0.0011333802],"genre_scores_gemma":[0.5987742,0.00015298578,0.39741507,0.001993503,0.00065657496,0.000048456983,0.000050118906,0.00007758371,0.0008315272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958089,0.00006228661,0.0006083825,0.0013567713,0.001271291,0.00089235994],"domain_scores_gemma":[0.99761015,0.00019362595,0.00041051343,0.0012033713,0.00024465832,0.00033768412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091712933,0.0005033101,0.00044655162,0.00034062445,0.0003328396,0.00061705726,0.0014250416,0.00026294772,0.000050189123],"category_scores_gemma":[0.000029387598,0.00042254775,0.00007517821,0.0006162981,0.00061876327,0.0010790679,0.00058697455,0.00060555496,0.000035939174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004619184,0.000034987283,0.0000144502255,0.000018481984,0.000006680855,0.0001520365,0.0004848863,0.5950593,0.0000045100833,0.0005718517,0.00030697728,0.40334123],"study_design_scores_gemma":[0.00020774125,0.0003422548,0.000016766611,0.00026356304,0.000009903136,0.00024585423,2.5554792e-7,0.98658466,0.000079391655,0.0071329167,0.004488068,0.0006286129],"about_ca_topic_score_codex":0.0000059341455,"about_ca_topic_score_gemma":0.00004142934,"teacher_disagreement_score":0.59873766,"about_ca_system_score_codex":0.00027677306,"about_ca_system_score_gemma":0.000506538,"threshold_uncertainty_score":0.9998226},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032220615,0.00021323794,0.98680586,0.0009783338,0.0004802971,0.0003524379,0.0000030927804,0.0000548191,0.010789743],"genre_scores_gemma":[0.9300731,0.000016136391,0.066764414,0.0027474235,0.00017607208,0.00002232202,8.943193e-7,0.000024334779,0.00017530884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977888,0.000030027277,0.0003337046,0.00087290566,0.0005930934,0.0003814548],"domain_scores_gemma":[0.99691784,0.00092378334,0.00029696274,0.0016450325,0.00012952175,0.00008687466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003115527,0.00033605576,0.00030638286,0.00027675767,0.00020222987,0.00013573407,0.0039431513,0.00014747864,0.000070639755],"category_scores_gemma":[0.00004708471,0.00020974514,0.00012875858,0.00036919303,0.0007872193,0.00008944457,0.00094372866,0.00066320086,0.00002581268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005782447,0.000033150143,0.000004831199,0.000008006831,0.000009961058,0.00001565179,0.0012825518,0.027448067,0.0001851377,0.50371337,0.00008963341,0.4672039],"study_design_scores_gemma":[0.00008203861,0.00017921484,0.00009697444,0.00018952812,0.0000041387434,0.000021071775,9.372048e-8,0.08461404,0.0041242703,0.9096501,0.00069487526,0.00034365276],"about_ca_topic_score_codex":0.000008566211,"about_ca_topic_score_gemma":0.000018190283,"teacher_disagreement_score":0.92975086,"about_ca_system_score_codex":0.000039464503,"about_ca_system_score_gemma":0.00010533702,"threshold_uncertainty_score":0.85531586},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005444266,0.00015784004,0.9818359,0.00036090674,0.0009586832,0.00030554878,0.000016114847,0.0001060343,0.016204532],"genre_scores_gemma":[0.17408866,0.00002164819,0.8249301,0.0006688482,0.00021863912,0.0000068367244,0.000018242878,0.00001881006,0.000028261727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969903,0.000041097177,0.0005800212,0.0010774647,0.0008522168,0.00045887867],"domain_scores_gemma":[0.997496,0.0003153603,0.00043870448,0.0013980962,0.0002387049,0.00011312849],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059846963,0.0004114095,0.0005449539,0.0006262565,0.00018456615,0.00027616843,0.0026188055,0.00031380393,0.000020543921],"category_scores_gemma":[0.00007316501,0.00035112852,0.00014552182,0.000578892,0.0005737606,0.00034761542,0.00080425467,0.00051488495,0.000023967543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003796853,0.000017002636,0.000020387777,0.00006994693,0.0000109656785,0.000014246751,0.00082499225,0.010273808,0.000055674675,0.5077279,0.000039374525,0.4809419],"study_design_scores_gemma":[0.00018343097,0.00013238603,0.0001029323,0.0001552626,0.000007107969,0.000042326992,9.0810104e-8,0.28954908,0.0001935306,0.70877355,0.00049963454,0.00036067914],"about_ca_topic_score_codex":0.000017929386,"about_ca_topic_score_gemma":0.000033244836,"teacher_disagreement_score":0.4805812,"about_ca_system_score_codex":0.00012104276,"about_ca_system_score_gemma":0.00030304363,"threshold_uncertainty_score":0.9998941},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004801108,0.0009123396,0.9883538,0.00021431217,0.002693829,0.00047843743,0.0000045002243,0.00018788711,0.0023538242],"genre_scores_gemma":[0.6479794,0.00006686657,0.34814584,0.0006804383,0.00079618307,0.000024736968,0.0000058476953,0.000079191115,0.0022215392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99479866,0.000076389435,0.00090882817,0.0020401247,0.0011795387,0.0009964423],"domain_scores_gemma":[0.99711984,0.00070364645,0.00046819734,0.001290067,0.00021345522,0.00020478929],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010290167,0.0007231202,0.00081707735,0.0010642871,0.00028776051,0.00093322975,0.003102841,0.00043230166,0.00003016635],"category_scores_gemma":[0.00013636227,0.0006797672,0.00017576771,0.00056512805,0.00029468228,0.0012415464,0.0012454633,0.0015458408,0.0001298213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023336358,0.000025980233,0.00050141267,0.000028920998,0.000010314036,0.00013584865,0.0034349416,0.6776481,0.00019602141,0.030138219,0.000013778734,0.2878641],"study_design_scores_gemma":[0.00016583786,0.00007032318,0.00031095947,0.0020071878,0.000004744189,0.0000145953245,0.0000014870988,0.95845455,0.0006786475,0.036148533,0.0013283828,0.00081472896],"about_ca_topic_score_codex":0.0006743799,"about_ca_topic_score_gemma":0.00018714968,"teacher_disagreement_score":0.6431782,"about_ca_system_score_codex":0.00068585493,"about_ca_system_score_gemma":0.00047876345,"threshold_uncertainty_score":0.99956536},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009961117,0.0006686167,0.9944127,0.00012528984,0.001754756,0.00085357466,0.000019504834,0.0002149904,0.0019405936],"genre_scores_gemma":[0.01873233,0.0000066868433,0.97966886,0.0003842056,0.0008424505,0.000046179845,0.000034081073,0.00004066277,0.00024453207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960562,0.000036522604,0.0004761414,0.0015837406,0.0009442189,0.0009031612],"domain_scores_gemma":[0.9972975,0.00049622636,0.00035697833,0.0012961518,0.00031771036,0.00023543273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001209422,0.0005611829,0.0005648429,0.0005592478,0.00029330238,0.0003486631,0.0030627132,0.00027199322,0.0000034818981],"category_scores_gemma":[0.00007301776,0.00052815955,0.00016467912,0.0003423828,0.00048027272,0.0007815553,0.00081819476,0.00070764037,0.000025708943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008041178,0.000044445027,0.000014675475,0.000064634034,0.000021511432,0.000037942267,0.0011226833,0.1621519,0.000054679633,0.021602456,0.000045398792,0.8148316],"study_design_scores_gemma":[0.0002410047,0.00017085188,0.000028317569,0.00021362185,0.000013144371,0.00016385892,1.4673253e-7,0.9432014,0.0005216623,0.054332107,0.00049803726,0.000615819],"about_ca_topic_score_codex":0.00001497743,"about_ca_topic_score_gemma":6.0359235e-7,"teacher_disagreement_score":0.81421584,"about_ca_system_score_codex":0.0004017707,"about_ca_system_score_gemma":0.0004703181,"threshold_uncertainty_score":0.999717},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000141808,0.000047950107,0.98730534,0.000119887416,0.0002202633,0.0003101954,0.000007353389,0.00004290809,0.011804298],"genre_scores_gemma":[0.98998433,0.0000029854064,0.008399147,0.00010091226,0.0011704863,0.000020537893,0.00017707834,0.000016720383,0.00012779268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840254,0.000019581601,0.00043727938,0.00036557252,0.00044558404,0.000329457],"domain_scores_gemma":[0.9990515,0.00013076392,0.0002726716,0.00028927147,0.00019679927,0.000058956368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057955825,0.00027276936,0.00034361365,0.00057822274,0.000120599936,0.00021301683,0.00058945874,0.00015251106,0.00007697739],"category_scores_gemma":[0.000010206505,0.00027241587,0.00009099431,0.00048155698,0.00020072376,0.00047568616,0.0002895697,0.0005286652,0.000012903032],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005205681,0.000015109772,0.00054328924,0.0000048665593,0.000006962484,0.0000013348301,0.00051756366,0.037995536,0.0000029285668,0.011328003,0.0006665598,0.9489126],"study_design_scores_gemma":[0.0001926292,0.000033730605,0.00056696555,0.00021084359,0.000014810329,9.831771e-7,0.0000010988113,0.78116244,0.00004087756,0.21116439,0.006122788,0.00048845744],"about_ca_topic_score_codex":0.00004247631,"about_ca_topic_score_gemma":0.000059031485,"teacher_disagreement_score":0.98984253,"about_ca_system_score_codex":0.0002507843,"about_ca_system_score_gemma":0.0001400284,"threshold_uncertainty_score":0.9999728},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008010339,0.00022090065,0.99014497,0.0004737887,0.0014958691,0.0004401231,0.0000012899741,0.000058858812,0.006363158],"genre_scores_gemma":[0.17270322,0.000025511463,0.8263095,0.0006835904,0.00010212053,0.000015111361,7.907879e-7,0.000021555965,0.00013861884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682873,0.000083217965,0.0006680695,0.0009671096,0.0009080599,0.0005448365],"domain_scores_gemma":[0.99695426,0.00062402437,0.0004507588,0.0016829801,0.0002105996,0.000077375626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020095145,0.0003619892,0.00041761273,0.00067094766,0.00013401003,0.00025363723,0.004426727,0.00024517742,0.000038667768],"category_scores_gemma":[0.0002571088,0.00027225824,0.00010897009,0.0007612065,0.00088039733,0.00084858434,0.0012318433,0.0007965079,0.000046120833],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058579394,0.000034371933,0.00017387018,0.000057499223,0.000009378719,0.000021677033,0.00638097,0.018297851,0.00069625175,0.17077054,0.000037141966,0.8035146],"study_design_scores_gemma":[0.00035243522,0.00022717472,0.0015165566,0.00081719185,0.0000062334852,0.000059814683,0.0000046249033,0.7493103,0.009798853,0.23551561,0.0015131655,0.00087804114],"about_ca_topic_score_codex":0.000058244743,"about_ca_topic_score_gemma":0.000025314666,"teacher_disagreement_score":0.80263656,"about_ca_system_score_codex":0.00023728501,"about_ca_system_score_gemma":0.0002814939,"threshold_uncertainty_score":0.99997294},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001456926,0.00013444696,0.9957624,0.0002221996,0.0018872704,0.00035081012,0.000016572336,0.00022502008,0.0012555771],"genre_scores_gemma":[0.05308165,0.00007627399,0.94332737,0.002941345,0.00040766216,0.0000056091285,0.000064108666,0.00002761945,0.000068340305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966211,0.00003490364,0.0006011681,0.0010101661,0.0010777209,0.0006549843],"domain_scores_gemma":[0.9969548,0.00021960527,0.00036021887,0.0020078828,0.00025364987,0.00020383466],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012228428,0.00048413832,0.00045354263,0.0008991043,0.00030212448,0.0010399797,0.0039030975,0.00038288007,0.000030285815],"category_scores_gemma":[0.00015099558,0.00045158798,0.00015861039,0.00088869705,0.00051743723,0.002398946,0.0017547385,0.0008313581,0.00017413346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002971356,0.000049844093,0.00016764629,0.00015746725,0.000021975506,0.000031648193,0.0012642392,0.010093551,0.000099445846,0.5187298,0.0001576914,0.469197],"study_design_scores_gemma":[0.0008737429,0.0002573435,0.0006472916,0.00039143162,0.000011591669,0.000052478797,1.2359031e-7,0.71798754,0.0019445478,0.21041462,0.06611581,0.0013034766],"about_ca_topic_score_codex":0.00002460692,"about_ca_topic_score_gemma":0.000030147217,"teacher_disagreement_score":0.70789397,"about_ca_system_score_codex":0.0001597669,"about_ca_system_score_gemma":0.00029790698,"threshold_uncertainty_score":0.999997},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000131844645,0.000858473,0.97045904,0.0023034094,0.0016325797,0.00039709604,0.00000223526,0.00019740086,0.024136582],"genre_scores_gemma":[0.04201157,0.00002528532,0.9484899,0.0053240876,0.0014918509,0.000015915251,0.0000030369338,0.000042235,0.002596134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604654,0.000049752958,0.00039091203,0.0015665465,0.0012611108,0.00068516086],"domain_scores_gemma":[0.99701613,0.0003683971,0.00017738598,0.001931883,0.00015630727,0.00034990752],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020602592,0.00048179663,0.00043315112,0.00046192989,0.00032979145,0.0010221882,0.0073244777,0.00021165168,0.000026140628],"category_scores_gemma":[0.00011893232,0.0003200878,0.00011132095,0.00090160046,0.00034523042,0.00056098343,0.002244037,0.00067085784,0.00020619157],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002330693,0.000009839525,0.0000043306704,0.000010479293,0.0000077090235,0.00001951448,0.0018708349,0.039552234,0.00005330675,0.13396138,0.0010797157,0.82342833],"study_design_scores_gemma":[0.00018221134,0.00012124934,0.000023310879,0.00027929214,0.000009304187,0.00018456976,0.0000011098747,0.48460838,0.00031469055,0.47675598,0.036682542,0.00083737844],"about_ca_topic_score_codex":0.000064674045,"about_ca_topic_score_gemma":0.00003109449,"teacher_disagreement_score":0.82259095,"about_ca_system_score_codex":0.0002686585,"about_ca_system_score_gemma":0.0010297673,"threshold_uncertainty_score":0.99992514},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38578823,0.000021448815,0.6137813,0.000044292534,0.00030646738,0.000022416534,0.0000023114037,0.00002405945,0.000009482491],"genre_scores_gemma":[0.7216913,0.0000033750255,0.27813715,0.00011969938,0.000041024887,7.365136e-7,0.000002710098,0.0000036292242,3.6599437e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925524,0.000022591556,0.00017142012,0.00020984953,0.00018957374,0.00015131127],"domain_scores_gemma":[0.9996108,0.00007434336,0.000029244948,0.00016428309,0.00007090569,0.000050445433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014812009,0.000091004404,0.00015101384,0.00012862925,0.00003978726,0.000029083254,0.0001983623,0.00003553524,0.00001264505],"category_scores_gemma":[0.0001386228,0.00007480948,0.000024438534,0.00038446285,0.000112854126,0.00011645377,0.00004210305,0.00011577043,0.000004186047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.497424e-7,0.000018471766,0.014957704,0.000007301198,0.000005738199,5.395241e-7,0.00034747997,0.08391672,0.008807454,0.000005099191,0.0000033342972,0.8919297],"study_design_scores_gemma":[0.000212866,0.000018019202,0.027976954,0.00006959677,0.0000037910413,0.0000010165664,5.2272395e-7,0.94079137,0.030606907,0.00022231354,0.000010264951,0.00008635741],"about_ca_topic_score_codex":0.00007867323,"about_ca_topic_score_gemma":0.00003898785,"teacher_disagreement_score":0.8918434,"about_ca_system_score_codex":0.000030343092,"about_ca_system_score_gemma":0.000012364521,"threshold_uncertainty_score":0.30506423},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052777276,0.00009390701,0.9937341,0.00042117905,0.0006019763,0.00087225763,0.0000036096817,0.00013735391,0.0036078035],"genre_scores_gemma":[0.10053175,0.00006983623,0.89802617,0.0008183744,0.00036547985,0.000030239828,0.000004248421,0.000035946505,0.000117929165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955545,0.00012591647,0.0007144262,0.000821729,0.0020277612,0.00075568794],"domain_scores_gemma":[0.99675447,0.00076210557,0.00045044764,0.0012267389,0.0006512755,0.00015494564],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021717406,0.00045346457,0.00035687955,0.00071977713,0.00071342615,0.0015859343,0.0030968792,0.00021681249,0.000069583475],"category_scores_gemma":[0.00032784004,0.00031912272,0.0000807382,0.0008568664,0.0005157107,0.0011829176,0.0011349746,0.0010370145,0.00012922255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015976248,0.000008270064,0.000092517526,0.000027178057,0.000007968622,0.000004115311,0.0006402986,0.3369411,0.000008652683,0.0044955616,0.0000069347716,0.6577658],"study_design_scores_gemma":[0.00016424569,0.00012032309,0.00019152985,0.00034443615,0.00000644024,0.00004150854,7.9603984e-7,0.98798305,0.00031498913,0.010382719,0.00010060395,0.0003493493],"about_ca_topic_score_codex":0.000024035728,"about_ca_topic_score_gemma":0.0000014337426,"teacher_disagreement_score":0.65741646,"about_ca_system_score_codex":0.0002486841,"about_ca_system_score_gemma":0.0005665134,"threshold_uncertainty_score":0.9999261},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008624849,0.00016014851,0.9618887,0.00018142333,0.00082387356,0.00052832643,0.000003973207,0.00032177527,0.03600556],"genre_scores_gemma":[0.23192257,0.000010562766,0.7656527,0.001513578,0.0002502302,0.000025380468,0.0000074615373,0.000033122065,0.0005843953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956879,0.00003766893,0.000493037,0.0022003883,0.0008028775,0.00077812816],"domain_scores_gemma":[0.996581,0.00018839704,0.0002187585,0.002356866,0.00022988392,0.00042508286],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005516761,0.00058099563,0.00049113086,0.00091125834,0.00035060255,0.00040684972,0.005467387,0.00034506962,0.00003811949],"category_scores_gemma":[0.0000706519,0.0005169899,0.00010365382,0.0009287383,0.00046534368,0.0012669727,0.0012084944,0.0008700781,0.00023387298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038038588,0.000075674776,0.000029284507,0.000012751799,0.0000058414107,0.000017213528,0.0017725549,0.031031273,0.000083108665,0.54172,0.000019079647,0.42522943],"study_design_scores_gemma":[0.00014601872,0.00034298695,0.0005745345,0.00012321783,0.000006981885,0.00005737653,2.0076429e-7,0.13757195,0.00041144365,0.85855323,0.0012938763,0.00091821107],"about_ca_topic_score_codex":0.0000140926095,"about_ca_topic_score_gemma":0.000028917988,"teacher_disagreement_score":0.42431122,"about_ca_system_score_codex":0.00021243248,"about_ca_system_score_gemma":0.00045222862,"threshold_uncertainty_score":0.9999135},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012925186,0.00037952187,0.95913345,0.00002850383,0.00036436995,0.00016001034,0.000013118841,0.000076376615,0.026919484],"genre_scores_gemma":[0.9537898,0.000028438752,0.046011046,0.00007011415,0.000052640004,0.0000031283419,0.000005326666,0.000015744774,0.000023774423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984011,0.0000053376534,0.00037107352,0.00039721766,0.0004548993,0.00037036795],"domain_scores_gemma":[0.9989441,0.00030465005,0.00004916081,0.00049174705,0.00009391395,0.00011641863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003428423,0.00023547705,0.0005127146,0.0004623124,0.00003612262,0.000051531126,0.00060654245,0.00022121286,0.00026442594],"category_scores_gemma":[0.00004212585,0.00019747119,0.0001573489,0.0005400218,0.00052941125,0.00020710212,0.00021480909,0.0004177964,0.000016707016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011314765,0.000038385853,0.0004236346,0.00029129843,0.00042364484,0.000020354279,0.00067049137,0.5107511,0.00039546535,0.07156787,0.000009331582,0.41539705],"study_design_scores_gemma":[0.000057420355,0.000035964906,0.0012948961,0.0000536109,0.00009416728,0.000001250171,1.4955684e-7,0.98432696,0.0024482808,0.011160303,0.00028217823,0.00024484564],"about_ca_topic_score_codex":0.00001287131,"about_ca_topic_score_gemma":0.00007092314,"teacher_disagreement_score":0.9408646,"about_ca_system_score_codex":0.0001334536,"about_ca_system_score_gemma":0.00006688398,"threshold_uncertainty_score":0.8052641},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054175205,0.00030171685,0.9920061,0.0018086563,0.00037860117,0.0003201643,0.000018241675,0.00017446962,0.004937829],"genre_scores_gemma":[0.15830278,0.00004013257,0.8380771,0.0010881912,0.00062362885,0.00005425356,0.000039761908,0.00004976943,0.0017243286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716353,0.000017043169,0.00031206166,0.0011637015,0.00090117834,0.0004425088],"domain_scores_gemma":[0.99780273,0.00017810547,0.000174729,0.0012320824,0.00039766697,0.000214709],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036427594,0.0003686656,0.00029624003,0.00048244165,0.00030470314,0.0002944892,0.002317348,0.00016472548,0.00002607803],"category_scores_gemma":[0.00001624963,0.00030754454,0.000062806175,0.00058935,0.0004766397,0.0006183034,0.0007165,0.00053997344,0.000075550204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005436006,0.00012183256,0.0003606403,0.000037662212,0.00002676846,0.00020337396,0.0013906439,0.14058045,0.000028855606,0.30920553,0.00026646635,0.54777235],"study_design_scores_gemma":[0.00034018068,0.0002784208,0.00089348614,0.00027302682,0.000012062755,0.0003132841,5.7016365e-7,0.6263909,0.000061814164,0.3643709,0.006237107,0.0008282544],"about_ca_topic_score_codex":0.000026492184,"about_ca_topic_score_gemma":0.00007306487,"teacher_disagreement_score":0.5469441,"about_ca_system_score_codex":0.00028018563,"about_ca_system_score_gemma":0.00093343435,"threshold_uncertainty_score":0.99993765},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029995738,0.00017369041,0.9776218,0.00037775046,0.00041933372,0.00038047277,7.3659226e-7,0.00014623246,0.020580059],"genre_scores_gemma":[0.68522125,0.000015605783,0.3072856,0.0040537077,0.0022610738,0.000043367494,0.000034764253,0.00009075508,0.0009938615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968594,0.0000034399416,0.00051830814,0.001048683,0.00079113134,0.00077907654],"domain_scores_gemma":[0.99848056,0.00007058451,0.000280808,0.0006473791,0.00047215167,0.000048507507],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006368606,0.000527062,0.000645035,0.0012294037,0.00039511416,0.0014648725,0.0013218448,0.00022565386,0.000066951914],"category_scores_gemma":[0.00004323709,0.00045127966,0.00015155536,0.0010602141,0.00020767827,0.0015729977,0.00080213085,0.0005226457,0.000443376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036335973,0.000023700588,0.000016621776,0.00019703877,0.000009651651,0.0000029839705,0.000058930873,0.7939161,0.0000027574254,0.007372762,0.000028823808,0.19836701],"study_design_scores_gemma":[0.000118296404,0.000005033327,0.0000039361635,0.00033485275,0.000039076614,0.000002718387,4.2939288e-7,0.88377166,0.000004710861,0.113973424,0.0012299163,0.0005159645],"about_ca_topic_score_codex":0.00029984437,"about_ca_topic_score_gemma":0.000031922213,"teacher_disagreement_score":0.68492126,"about_ca_system_score_codex":0.0000904531,"about_ca_system_score_gemma":0.0000908163,"threshold_uncertainty_score":0.9997939},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041127508,0.00035078698,0.9928803,0.00082553976,0.00062324497,0.00067022676,0.000020945587,0.000021778807,0.0004944367],"genre_scores_gemma":[0.96583205,0.000013334422,0.032061987,0.0017791886,0.00018970997,0.000036459496,0.00001400507,0.000017662727,0.000055625093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976406,0.00004391409,0.000364083,0.00076021266,0.0007884299,0.00040274338],"domain_scores_gemma":[0.9976516,0.0011594637,0.00016063287,0.0009240601,0.00003420707,0.00007008633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021642118,0.0002939424,0.00035454042,0.00024338845,0.0002649974,0.00027896164,0.0022177226,0.00017128931,0.0002058189],"category_scores_gemma":[0.00005591582,0.00014385705,0.00016473279,0.0007993426,0.00019248489,0.00018302246,0.0003682772,0.00027345232,0.00006885519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042721713,0.00006250864,0.007537353,0.00002558969,0.00003387143,0.000021299791,0.0014155977,0.8631033,0.000031285163,0.00006371461,0.00016831003,0.12749445],"study_design_scores_gemma":[0.00038830063,0.000072623145,0.007280829,0.00008517424,0.00006941324,0.0000036551503,0.0000011804801,0.97696435,0.000053642416,0.006288193,0.0085115805,0.0002810254],"about_ca_topic_score_codex":0.0004047405,"about_ca_topic_score_gemma":0.017345073,"teacher_disagreement_score":0.9617193,"about_ca_system_score_codex":0.0002080687,"about_ca_system_score_gemma":0.000059591646,"threshold_uncertainty_score":0.96789575},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011569576,0.000097726595,0.9956494,0.00032443544,0.0009086211,0.00030211452,0.0000027017932,0.00013017212,0.0014278587],"genre_scores_gemma":[0.3166022,0.0000036580693,0.6816056,0.001012203,0.0005787239,0.000003901917,0.000018907282,0.000024167972,0.00015068817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968103,0.00004437115,0.0004229364,0.0012573068,0.0009618756,0.00050317217],"domain_scores_gemma":[0.9981403,0.00028202773,0.00028722812,0.0007643363,0.00036418572,0.00016195285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059302006,0.00046118864,0.0004116229,0.00089996186,0.000324884,0.00060145365,0.0015458753,0.00020840505,0.000020106241],"category_scores_gemma":[0.000029669118,0.00039626617,0.000093833994,0.00070003874,0.00035191586,0.00059358723,0.0005895759,0.0005323024,0.000022324833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012650204,0.000018797426,0.000025284411,0.000022631573,0.000010887904,0.00003455939,0.00020512629,0.44671246,0.00034934815,0.04314779,0.000013635634,0.5094468],"study_design_scores_gemma":[0.00026470725,0.0002623505,0.0001062414,0.00024056707,0.000010277802,0.00022236515,5.973323e-8,0.9356039,0.0017017593,0.05946254,0.0015867368,0.000538474],"about_ca_topic_score_codex":0.000017612449,"about_ca_topic_score_gemma":0.00005293472,"teacher_disagreement_score":0.50890833,"about_ca_system_score_codex":0.00035111382,"about_ca_system_score_gemma":0.0006714185,"threshold_uncertainty_score":0.9998489},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000062335734,0.00023865273,0.98475164,0.0008526953,0.00041963442,0.00029505393,4.5730766e-7,0.00017187707,0.013207627],"genre_scores_gemma":[0.09808491,0.00023552265,0.89509726,0.0015295724,0.0003132124,0.000016624203,0.000003336463,0.000047114107,0.0046724584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732375,0.00003501597,0.0003218419,0.001111783,0.0006591509,0.0005484318],"domain_scores_gemma":[0.998589,0.00023600622,0.00015279242,0.00060778216,0.00019979315,0.0002146283],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006505792,0.0003372356,0.00032909485,0.0006033567,0.00031252403,0.0010640969,0.0015672744,0.00019846771,0.000056159926],"category_scores_gemma":[0.00008312414,0.0003065114,0.00005210131,0.0003911823,0.00046686237,0.0007700495,0.0014882021,0.0009184318,0.00009047578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.832667e-7,0.0000081834305,0.00005565354,0.000031008887,0.000004994181,0.00001982413,0.0013034166,0.07120517,0.000073691976,0.022707641,0.000011882867,0.9045777],"study_design_scores_gemma":[0.00017622806,0.00012936456,0.00009008749,0.00020910508,0.0000017534202,0.000043967535,2.450718e-7,0.9650005,0.00012293998,0.03167504,0.0021610295,0.0003897485],"about_ca_topic_score_codex":0.00002036333,"about_ca_topic_score_gemma":0.000012721048,"teacher_disagreement_score":0.9041879,"about_ca_system_score_codex":0.00010927359,"about_ca_system_score_gemma":0.00023234717,"threshold_uncertainty_score":0.9999729},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015026348,0.0009297303,0.99362886,0.0004783108,0.00070928474,0.00024593095,8.847433e-7,0.00011251006,0.0037442013],"genre_scores_gemma":[0.34031904,0.00008188353,0.6504791,0.0041883495,0.00089409197,0.0000363105,0.000039184844,0.00008041367,0.0038816482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966556,0.000036454414,0.0004196938,0.001307988,0.0011387658,0.0004415177],"domain_scores_gemma":[0.9981685,0.00016617074,0.00031443255,0.0008397688,0.0003624456,0.00014867407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006178527,0.0004187234,0.00045531694,0.0006499834,0.00020036174,0.0004318419,0.0016756861,0.00021644919,0.000104358514],"category_scores_gemma":[0.00003245984,0.00033953818,0.00012422154,0.00047462416,0.00041881108,0.0011620824,0.00045785704,0.00055957196,0.00009215824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057641582,0.000032246473,0.00025237928,0.000067791996,0.000036135138,0.00008945615,0.004411817,0.016784055,0.00022916394,0.020160992,0.00025429012,0.95767593],"study_design_scores_gemma":[0.00021308869,0.00014631147,0.00018174086,0.00058691617,0.000019619049,0.000058633304,2.3624544e-7,0.9702889,0.00009951577,0.018292952,0.009467144,0.00064498663],"about_ca_topic_score_codex":0.0000617261,"about_ca_topic_score_gemma":0.000041340238,"teacher_disagreement_score":0.9570309,"about_ca_system_score_codex":0.0008719303,"about_ca_system_score_gemma":0.00069178623,"threshold_uncertainty_score":0.99990565},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21534154,0.0039203167,0.7766256,0.000008493028,0.0028458463,0.00064951915,0.000014711842,0.00019566575,0.00039833286],"genre_scores_gemma":[0.9963922,0.000096688265,0.0029447707,0.000020180234,0.00046821646,0.000008673899,0.000009792662,0.00004981256,0.000009645304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975523,0.00001952928,0.0006546102,0.00068795745,0.00048387278,0.00060173875],"domain_scores_gemma":[0.9987164,0.0001357026,0.00015780338,0.0007760908,0.00013582969,0.00007815584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057878136,0.00046045292,0.00067048566,0.0011885511,0.000047193666,0.000103501494,0.00078581396,0.00074985664,0.000009633497],"category_scores_gemma":[0.000024926514,0.00044906227,0.00013235405,0.0006582498,0.0004142103,0.00019524366,0.00021580327,0.0008367679,0.0000051607403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076096835,0.000020064324,0.0010327843,0.00009936172,0.000017718394,0.000048565154,0.00014941064,0.90358037,0.0019730262,0.0003550392,0.0000028321083,0.09271321],"study_design_scores_gemma":[0.0002481313,0.00015406894,0.00023552161,0.00033796456,0.000008031755,0.000080628495,1.9094777e-7,0.99393976,0.00235595,0.0021578264,0.000048725196,0.00043321488],"about_ca_topic_score_codex":0.00010682568,"about_ca_topic_score_gemma":0.00068531826,"teacher_disagreement_score":0.7810507,"about_ca_system_score_codex":0.0009570334,"about_ca_system_score_gemma":0.00014150447,"threshold_uncertainty_score":0.9997961},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064979773,0.00021523563,0.97945136,0.0021511393,0.0010430355,0.00047561564,0.0000027519425,0.00011528801,0.015895754],"genre_scores_gemma":[0.77120364,0.00016861375,0.2259109,0.001390011,0.00037427584,0.00001961178,0.0000070826354,0.00003673831,0.00088915206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673593,0.000057603775,0.0005360923,0.0012860992,0.0007545462,0.0006297234],"domain_scores_gemma":[0.9974396,0.00059347536,0.00018244276,0.0014790668,0.0001337244,0.00017169755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050423853,0.0004244087,0.0004968866,0.0013053033,0.00018443145,0.00060035096,0.002513677,0.00032822063,0.00008776683],"category_scores_gemma":[0.00004543131,0.00036885147,0.00016438644,0.0009715043,0.00058562844,0.0006914367,0.000569669,0.0009164529,0.000075734155],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009040899,0.0001607794,0.0030595616,0.00009637729,0.0000408623,0.00046018048,0.004904102,0.06273317,0.00015906735,0.09943995,0.0006320026,0.8283049],"study_design_scores_gemma":[0.00043943245,0.00021751574,0.015185632,0.00050185184,0.000011799181,0.00009243405,0.0000010484649,0.61109895,0.00038216493,0.37059,0.0004858699,0.000993297],"about_ca_topic_score_codex":0.00040126088,"about_ca_topic_score_gemma":0.00094247644,"teacher_disagreement_score":0.8273116,"about_ca_system_score_codex":0.0001336625,"about_ca_system_score_gemma":0.00031152504,"threshold_uncertainty_score":0.9998763},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008994073,0.00024316623,0.98248523,0.000580708,0.002743158,0.00025924007,0.000005927295,0.00024235793,0.013350282],"genre_scores_gemma":[0.2953308,0.00008764894,0.69733953,0.0039650793,0.0012284128,0.00001140501,0.000014333436,0.00008325798,0.0019395347],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99575526,0.000072929644,0.00045788364,0.0017959658,0.001071527,0.00084641454],"domain_scores_gemma":[0.99707556,0.00035291808,0.00027252446,0.0017814947,0.00022942261,0.00028805924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012642411,0.000651509,0.00061323517,0.0012966533,0.00036724273,0.0005497445,0.005344713,0.0003811438,0.000049632894],"category_scores_gemma":[0.000059566122,0.0005938884,0.00027178842,0.0010065313,0.0011712201,0.000556666,0.0016222742,0.0009689104,0.0000738248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043325645,0.000024226223,0.000009867433,0.000020653368,0.0000133240665,0.00010786395,0.00047509657,0.0038301267,0.000035277182,0.31910935,0.000033826796,0.67633605],"study_design_scores_gemma":[0.00042769453,0.0003690346,0.00008481291,0.00028910843,0.000011988692,0.000103240556,2.0409071e-7,0.17772949,0.0006177095,0.8141798,0.0052219806,0.0009649469],"about_ca_topic_score_codex":0.000021141592,"about_ca_topic_score_gemma":0.000025453366,"teacher_disagreement_score":0.6753711,"about_ca_system_score_codex":0.00017231693,"about_ca_system_score_gemma":0.0004978191,"threshold_uncertainty_score":0.99965125},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003135895,0.00025225626,0.99605495,0.00094923656,0.00092797395,0.0006251126,0.0003075123,0.0005242075,0.000045182183],"genre_scores_gemma":[0.06147401,0.000024071858,0.9373577,0.0006535676,0.00026639376,0.000013660294,0.00015805765,0.000047663114,0.0000048636844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952313,0.000054778593,0.00062660716,0.0022368804,0.00092943164,0.00092102925],"domain_scores_gemma":[0.99053466,0.0009818547,0.00033979685,0.0076328977,0.00032622175,0.00018455078],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0007859949,0.00061938027,0.0005484393,0.0009323465,0.00049570674,0.00066671363,0.02186003,0.00035864525,0.000010942525],"category_scores_gemma":[0.0026346513,0.00062616245,0.000081686914,0.0005468469,0.0011803401,0.0016893517,0.016120585,0.000897604,0.000006623139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045031094,0.00016409122,0.00025902473,0.0003042391,0.000033255066,0.0004818015,0.00019456471,0.21193318,0.0028751479,0.01623254,0.0019836833,0.76549345],"study_design_scores_gemma":[0.00028208495,0.0002081427,0.000031926524,0.00031288646,0.00000854886,0.00008767553,1.17894835e-7,0.84890366,0.010705484,0.13847496,0.00036469504,0.00061984244],"about_ca_topic_score_codex":0.00008511489,"about_ca_topic_score_gemma":0.00010507528,"teacher_disagreement_score":0.7648736,"about_ca_system_score_codex":0.0004975469,"about_ca_system_score_gemma":0.0013780011,"threshold_uncertainty_score":0.99961895},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040665127,0.0001742892,0.9873089,0.0013534019,0.0012321168,0.00020764148,0.0000025700751,0.00021266889,0.009467757],"genre_scores_gemma":[0.68457544,0.000035126053,0.30295604,0.01056274,0.0008648267,0.0000044221388,0.000014758531,0.000022502576,0.0009641417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620116,0.000026490405,0.00079358503,0.0009965848,0.0013064484,0.00067576277],"domain_scores_gemma":[0.997942,0.00021105679,0.00041549955,0.0008994758,0.00035499744,0.00017697706],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00089741667,0.0005326793,0.00058396097,0.00097118854,0.00031756095,0.0016242379,0.0040806676,0.00034610828,0.000052918436],"category_scores_gemma":[0.00007449301,0.00047136276,0.00024279254,0.0006217783,0.0004133009,0.0016588375,0.0009093931,0.0009046953,0.00028765333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020991924,0.00000830566,0.0000018092873,0.000010463703,0.000009887563,0.000033298213,0.0010457006,0.02198963,0.0000022572206,0.18730396,0.00006937558,0.7895232],"study_design_scores_gemma":[0.00017542667,0.00012516949,0.000040821746,0.00023726057,0.000010700873,0.0000694449,2.1577966e-7,0.9722378,0.00013052247,0.0073918374,0.018939577,0.0006412102],"about_ca_topic_score_codex":0.000010450289,"about_ca_topic_score_gemma":0.00005284474,"teacher_disagreement_score":0.9502482,"about_ca_system_score_codex":0.0002665201,"about_ca_system_score_gemma":0.00051170343,"threshold_uncertainty_score":0.9997738},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10354763,0.000022541479,0.8955161,0.00021937594,0.00019777888,0.0004247525,9.0036605e-7,0.000064398184,0.000006500453],"genre_scores_gemma":[0.5091296,0.000002706451,0.49064106,0.00019616204,0.000020589072,0.000005486042,0.0000020180216,0.0000022873758,1.1470334e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998346,0.00009487823,0.00033810697,0.00044866142,0.0005455706,0.00022680944],"domain_scores_gemma":[0.99904794,0.00019251839,0.00019907254,0.00020675198,0.00025845206,0.00009529948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039420062,0.00013143674,0.00015300122,0.00024066636,0.00014436195,0.00017648838,0.0003186956,0.0000498984,0.000017120317],"category_scores_gemma":[0.000038594615,0.0001091876,0.00001556846,0.00077326375,0.00063636183,0.0012614093,0.00017764646,0.00011227991,0.0000026536013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008192586,0.00007532715,0.0015498995,0.000035402474,0.0000046573346,0.000008001043,0.0014268875,0.062994294,0.30316243,0.00024158493,0.00001388408,0.63047945],"study_design_scores_gemma":[0.000215275,0.00015199592,0.0013393002,0.000060922615,0.000002033855,0.000026562626,0.0000037845539,0.67868596,0.3177431,0.0016748789,5.421571e-7,0.00009563764],"about_ca_topic_score_codex":0.000108337474,"about_ca_topic_score_gemma":0.0000043659725,"teacher_disagreement_score":0.6303838,"about_ca_system_score_codex":0.000092721224,"about_ca_system_score_gemma":0.00019071517,"threshold_uncertainty_score":0.4452541},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007952081,0.000024269935,0.9974281,0.00035860264,0.00050719164,0.00046585,7.7990614e-7,0.00023833399,0.0001816339],"genre_scores_gemma":[0.2544903,0.000003566405,0.74438053,0.0010205584,0.0000559598,0.000041234252,0.0000012125865,0.000004505832,0.00000216031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822485,0.000043333912,0.00031861613,0.000566334,0.00042548528,0.00042136933],"domain_scores_gemma":[0.99875706,0.0002161786,0.00012220994,0.00059939804,0.00018875403,0.00011639687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013299529,0.00014197417,0.00016242583,0.0002489577,0.00017881884,0.00026930883,0.0015683306,0.00005979738,0.00001443994],"category_scores_gemma":[0.00031827475,0.00011871636,0.000051192706,0.0009493372,0.0003409342,0.0016344233,0.000257306,0.0001449407,0.000009808031],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022365113,0.00007544745,0.00012641297,0.000025795818,0.0000027596752,0.000012657415,0.0024733746,0.00035247338,0.015239423,0.0011216259,0.00012103059,0.9804266],"study_design_scores_gemma":[0.00060579705,0.00014792876,0.000349376,0.00002674701,0.0000016148322,0.000018958257,6.131232e-7,0.54278255,0.41919017,0.03669217,0.000024478888,0.00015963665],"about_ca_topic_score_codex":0.000052970907,"about_ca_topic_score_gemma":0.000020464708,"teacher_disagreement_score":0.980267,"about_ca_system_score_codex":0.00008524891,"about_ca_system_score_gemma":0.00018098029,"threshold_uncertainty_score":0.48411128},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036641298,0.00059553125,0.99151385,0.00064202497,0.001111972,0.00041744407,0.000004801592,0.0003872383,0.0049607535],"genre_scores_gemma":[0.697387,0.00004234806,0.30022523,0.00076203997,0.00070116523,0.000009299191,0.000016396256,0.00007067154,0.0007858796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99478763,0.00012404654,0.0006331516,0.0017392877,0.0015039999,0.0012119075],"domain_scores_gemma":[0.9968222,0.0010647518,0.0002646732,0.0011933129,0.00021936091,0.00043569945],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001695059,0.0007673871,0.0007578988,0.0009833046,0.00060316606,0.0010551973,0.0032289473,0.00047428077,0.00007416664],"category_scores_gemma":[0.00017968586,0.0007368166,0.00026097463,0.0004491515,0.0005848971,0.0015502563,0.0009875334,0.0021866376,0.00021587219],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083104405,0.000034064124,0.004619219,0.000058680747,0.000034678753,0.00009907453,0.006684495,0.02317275,0.0008318926,0.006195734,0.000016153188,0.9582449],"study_design_scores_gemma":[0.0016524285,0.00035289422,0.0062482893,0.00078212714,0.00005859368,0.00013030512,0.0000061327332,0.91312927,0.0049948525,0.023581842,0.04594483,0.0031184207],"about_ca_topic_score_codex":0.000034758545,"about_ca_topic_score_gemma":0.000030912997,"teacher_disagreement_score":0.9551265,"about_ca_system_score_codex":0.0002841002,"about_ca_system_score_gemma":0.00029994984,"threshold_uncertainty_score":0.9999818},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009879282,0.00003589973,0.98620915,0.0024180568,0.0005552945,0.0005814853,5.752095e-7,0.00027775072,0.000042497963],"genre_scores_gemma":[0.4230388,0.0000025342288,0.5740452,0.0027854,0.000060904964,0.000052797433,0.0000013581315,0.000007373965,0.000005612436],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971544,0.000091707225,0.00036215948,0.0008639879,0.000957462,0.00057026464],"domain_scores_gemma":[0.9984881,0.00016460041,0.00016003111,0.000720298,0.00027394274,0.00019301762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039543898,0.00024271094,0.00022061674,0.00034074986,0.00020319558,0.0008176315,0.0016882082,0.0000475855,0.00012019939],"category_scores_gemma":[0.000064932276,0.00017364959,0.000032393647,0.00185418,0.00035784443,0.0020817085,0.00039064995,0.00022159242,0.000070471084],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004617721,0.00015320165,0.0012951917,0.000034996236,0.0000073023575,0.000083806044,0.0013090757,0.0022583923,0.06434618,0.0009778027,0.00016927224,0.92936015],"study_design_scores_gemma":[0.0007873488,0.0005175573,0.02386635,0.00017941449,0.000008818872,0.00012031136,0.000007648071,0.34249339,0.6133807,0.017915469,0.0000234606,0.0006995656],"about_ca_topic_score_codex":0.00029881092,"about_ca_topic_score_gemma":0.000029181787,"teacher_disagreement_score":0.9286606,"about_ca_system_score_codex":0.00013323915,"about_ca_system_score_gemma":0.00017630168,"threshold_uncertainty_score":0.7884439},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028893603,0.0014464861,0.9940074,0.00074466044,0.0013536346,0.0008178157,0.000015551494,0.00012524628,0.0014602944],"genre_scores_gemma":[0.0010904461,0.00017504851,0.9959552,0.0017067885,0.0003202671,0.000033833647,0.00000479666,0.000029251787,0.0006843483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667597,0.00006648775,0.00044522388,0.0017177906,0.00044048775,0.0006540458],"domain_scores_gemma":[0.9967494,0.0015653919,0.00022182775,0.0010600917,0.00022230955,0.00018098803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013840201,0.0005493104,0.00063484826,0.0007362376,0.0003798276,0.00091875286,0.0020336774,0.0003218626,0.000025601848],"category_scores_gemma":[0.00015140233,0.00048336538,0.00012906722,0.00045423553,0.0011127059,0.00068631925,0.0019747547,0.00061259407,0.000018736137],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036415588,0.000009604723,0.000007790383,0.00006587386,0.000015235879,0.0000061117416,0.00065579725,0.00024935335,0.00004559114,0.05286014,0.00015277867,0.9459281],"study_design_scores_gemma":[0.00027064176,0.00020470952,0.000040249117,0.00015154557,0.000009961257,0.000082105886,2.0409124e-7,0.5683868,0.000296417,0.40237224,0.027637076,0.00054804346],"about_ca_topic_score_codex":0.000041530053,"about_ca_topic_score_gemma":0.000010943375,"teacher_disagreement_score":0.94538003,"about_ca_system_score_codex":0.00008250391,"about_ca_system_score_gemma":0.00030693333,"threshold_uncertainty_score":0.9997618},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009799559,0.00039254772,0.99711466,0.00045023952,0.0004016883,0.00060833927,0.00002963976,0.000049099766,0.0009439647],"genre_scores_gemma":[0.022943042,0.00017876456,0.97537637,0.000738767,0.000069437134,0.00001962019,0.000017332392,0.000025282412,0.000631365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976437,0.000039472703,0.00042522614,0.00094414124,0.00053618307,0.00041128855],"domain_scores_gemma":[0.99767554,0.00052046496,0.00022277316,0.000744625,0.0006833095,0.00015327251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012755372,0.0002883334,0.00042858647,0.00047632938,0.00013179486,0.00040718445,0.0017523699,0.00018960853,0.000015265206],"category_scores_gemma":[0.00008952425,0.00025311921,0.00005682931,0.00036397332,0.0005555897,0.00070281664,0.00090687926,0.00028112848,0.000005485631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004831768,0.000026184945,0.00002797139,0.000080516,0.00001257453,0.0000033600556,0.00047960813,0.13643561,0.000021939342,0.05893915,0.0000979415,0.8038703],"study_design_scores_gemma":[0.00019914369,0.000103060665,0.000054390573,0.00008642136,0.0000017953407,0.0000055513756,2.6927044e-8,0.8648535,0.00011320457,0.13409287,0.0002488973,0.00024111987],"about_ca_topic_score_codex":0.00014246038,"about_ca_topic_score_gemma":0.00011369838,"teacher_disagreement_score":0.80362916,"about_ca_system_score_codex":0.000054415465,"about_ca_system_score_gemma":0.00034782663,"threshold_uncertainty_score":0.99999213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016754406,0.00030623339,0.9966614,0.0008382577,0.00070798135,0.00029830725,0.000011439719,0.00015687321,0.00085194595],"genre_scores_gemma":[0.2038844,0.000092806426,0.792847,0.001398206,0.00033540305,0.000020129903,0.000009960921,0.000036542588,0.0013755546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692744,0.000015867177,0.00043296916,0.0012139998,0.0008076069,0.0006021075],"domain_scores_gemma":[0.997983,0.00022194163,0.00023732895,0.00089815643,0.0004608387,0.00019876935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007025145,0.00043098652,0.0005330662,0.0007323921,0.00027499208,0.00048881717,0.0021861135,0.00024052673,0.000010098954],"category_scores_gemma":[0.000068163754,0.00038431032,0.00016556068,0.00046636193,0.00037151593,0.0007050648,0.00055788126,0.00040522136,0.000041570962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004751061,0.000015976351,0.0000053571935,0.00003504659,0.000010479231,0.0000044402027,0.00035753273,0.3700842,0.000037475704,0.007829637,0.00006277504,0.62155235],"study_design_scores_gemma":[0.00022653455,0.0000833764,0.0000032705,0.00021789297,0.000012566908,0.000013943039,9.337971e-8,0.85844624,0.000540827,0.13948303,0.0005489356,0.0004232894],"about_ca_topic_score_codex":0.000008960674,"about_ca_topic_score_gemma":0.000027991311,"teacher_disagreement_score":0.62112904,"about_ca_system_score_codex":0.00026518566,"about_ca_system_score_gemma":0.00065138406,"threshold_uncertainty_score":0.9998609},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013190923,0.00025094787,0.9920561,0.00034251795,0.0016006907,0.00042498324,0.000005631361,0.00013567907,0.0038644068],"genre_scores_gemma":[0.7722166,0.000008041522,0.22662361,0.00048592273,0.00035124432,0.000007900565,0.0000026518283,0.00005805984,0.00024598197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945467,0.00004643255,0.00076818885,0.0016166334,0.00236083,0.0006612137],"domain_scores_gemma":[0.9961547,0.0004460239,0.0006359727,0.001771062,0.0007555762,0.00023666724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012643395,0.00064599287,0.00085034355,0.0010762076,0.00011369273,0.00030251936,0.004274701,0.00032857838,0.000008785252],"category_scores_gemma":[0.00017984041,0.00051622884,0.000105506246,0.0011541368,0.000703531,0.00056366273,0.0013797764,0.0009157915,0.00003055951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090386595,0.00015066465,0.00015741927,0.00039656562,0.000046063564,0.00035767848,0.0037851657,0.67928565,0.00012899445,0.030405976,0.00026904946,0.2849264],"study_design_scores_gemma":[0.00069913385,0.0012729875,0.0000124614735,0.0034569793,0.00001498388,0.00024623208,6.18552e-7,0.87418985,0.0029613792,0.115479805,0.0006423976,0.00102315],"about_ca_topic_score_codex":0.0000113656115,"about_ca_topic_score_gemma":0.00003869756,"teacher_disagreement_score":0.7708975,"about_ca_system_score_codex":0.00038859612,"about_ca_system_score_gemma":0.0009981899,"threshold_uncertainty_score":0.9997289},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004927131,0.0003425871,0.99124056,0.00032720523,0.0018580521,0.0006154305,0.000018099267,0.00045334798,0.004652024],"genre_scores_gemma":[0.44362393,0.00008630442,0.5484851,0.0019474516,0.0029032717,0.00009645132,0.00007120547,0.00012628538,0.0026599835],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969288,0.00003832267,0.0004530063,0.0011824188,0.0006144273,0.0007830053],"domain_scores_gemma":[0.99782073,0.00053609605,0.00036723595,0.00083163,0.00025664034,0.00018765978],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000722045,0.00051441527,0.0005298508,0.0008798426,0.0006978714,0.0006985511,0.0015591867,0.00031676076,0.000048724323],"category_scores_gemma":[0.0000499882,0.00051075104,0.00019213752,0.0003518132,0.0004157994,0.0011554218,0.00053760834,0.0006143091,0.000046434532],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088772795,0.00006707059,0.00003203672,0.00009613026,0.000033812597,0.000019890342,0.0014739602,0.0003999403,0.0021901848,0.014102203,0.00015290263,0.981423],"study_design_scores_gemma":[0.0020234943,0.00091122376,0.0004616259,0.002213714,0.000114966955,0.0003613253,0.000003418738,0.23566826,0.040591665,0.6628236,0.05021268,0.004614031],"about_ca_topic_score_codex":0.000014409136,"about_ca_topic_score_gemma":0.00015318855,"teacher_disagreement_score":0.97680897,"about_ca_system_score_codex":0.00030125494,"about_ca_system_score_gemma":0.00023456482,"threshold_uncertainty_score":0.9997344},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021200452,0.0000858315,0.9916602,0.00097429287,0.0008387094,0.0007844177,0.000008266194,0.00014149165,0.0033867648],"genre_scores_gemma":[0.66419756,0.00002143,0.334373,0.0010320348,0.00013714436,0.00001760509,0.0000028640422,0.00004060793,0.00017772742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99562,0.0001736953,0.00066275924,0.0013795524,0.001370329,0.00079366035],"domain_scores_gemma":[0.9936031,0.0030009921,0.0003942564,0.0023975135,0.0004338083,0.00017034897],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015608398,0.0005325076,0.0006504902,0.0011817235,0.0005721167,0.0003843001,0.0054576183,0.00022258225,0.00008451597],"category_scores_gemma":[0.0003400679,0.00037845067,0.00025999037,0.0014791138,0.0041127536,0.00039472352,0.0018995609,0.0013704574,0.00007525511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010557821,0.00004876114,0.000010257336,0.000028245784,0.00002308427,0.000013445117,0.00048580216,0.029120944,0.00055432005,0.8509095,0.00002528449,0.118769854],"study_design_scores_gemma":[0.00016138863,0.00020416731,0.00011886471,0.00022173004,0.0000032398386,0.000021336198,2.6870612e-7,0.2618321,0.0017616879,0.73530227,0.00005624066,0.0003167348],"about_ca_topic_score_codex":0.000040863084,"about_ca_topic_score_gemma":0.000030961928,"teacher_disagreement_score":0.66207755,"about_ca_system_score_codex":0.00016254967,"about_ca_system_score_gemma":0.00028586647,"threshold_uncertainty_score":0.99992335},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015882363,0.0009195271,0.9925204,0.00031638428,0.0009675754,0.00042124648,0.000017589258,0.00025627622,0.00442218],"genre_scores_gemma":[0.27298275,0.000037087473,0.7251889,0.001104673,0.0005315618,0.000012951649,0.000021576747,0.000055904486,0.00006457521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99524856,0.00003292035,0.0004605636,0.0019096618,0.001530938,0.0008173503],"domain_scores_gemma":[0.9966437,0.00032544328,0.00027470302,0.0020282883,0.00037197053,0.00035588635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001069147,0.0006268267,0.0005652862,0.000959743,0.0002769651,0.00068987114,0.0037994008,0.00028605867,0.0000196253],"category_scores_gemma":[0.000060249473,0.0005074628,0.00013340282,0.0010534312,0.00096139417,0.000541793,0.0014646822,0.0009501014,0.000047120535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032795542,0.00014932035,0.000120195225,0.0000993798,0.00004366586,0.00048564613,0.0024280113,0.18664774,0.00008865943,0.21940032,0.00015481688,0.59034944],"study_design_scores_gemma":[0.0009194565,0.0005009214,0.00017461779,0.0009057793,0.000022416501,0.00026621934,6.642278e-7,0.8378066,0.00050823187,0.14354692,0.013650723,0.0016974878],"about_ca_topic_score_codex":0.00004069369,"about_ca_topic_score_gemma":0.00012370046,"teacher_disagreement_score":0.6511588,"about_ca_system_score_codex":0.00022266185,"about_ca_system_score_gemma":0.00077918684,"threshold_uncertainty_score":0.9997377},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022600399,0.00017552872,0.9908399,0.001150428,0.0028078477,0.0003219936,0.000005027552,0.0003209495,0.004152295],"genre_scores_gemma":[0.27721307,0.000051751573,0.7177824,0.0031010588,0.0003768901,0.000020021636,0.000004464478,0.00003121117,0.0014191918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99422204,0.000044242915,0.0005128433,0.0020274157,0.0022006517,0.000992828],"domain_scores_gemma":[0.9969788,0.0007281637,0.00022760381,0.001422129,0.00040656357,0.00023674245],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.00090547773,0.0005313387,0.0005278982,0.0017803923,0.0016390944,0.0005558167,0.0060165147,0.0002554503,0.0000127054345],"category_scores_gemma":[0.00011424236,0.00047351953,0.0001551961,0.0027977235,0.00343811,0.0010545421,0.0005316149,0.00095159985,0.000078649595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005915367,0.00013703633,0.00001746396,0.000020048506,0.000008541376,0.00013463384,0.0017533988,0.42726478,0.000044455926,0.010053788,0.00020840073,0.56035155],"study_design_scores_gemma":[0.00037497224,0.00046146277,0.0006092905,0.00026320372,0.0000060054217,0.00032946086,3.6055627e-7,0.8754799,0.001707551,0.11845699,0.0014895735,0.0008212265],"about_ca_topic_score_codex":0.0000191326,"about_ca_topic_score_gemma":0.000028508317,"teacher_disagreement_score":0.5595303,"about_ca_system_score_codex":0.0008114781,"about_ca_system_score_gemma":0.0050923727,"threshold_uncertainty_score":0.99977165},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008917837,0.0008760776,0.9927938,0.000058156747,0.0026087943,0.0009324501,0.00001485994,0.00012982794,0.0025771365],"genre_scores_gemma":[0.029944735,0.000020949014,0.96925604,0.000067337474,0.00025469452,0.00004467641,0.00000801348,0.00002923299,0.00037429566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675834,0.0000615607,0.0007011352,0.0010468386,0.00093671295,0.00049540616],"domain_scores_gemma":[0.99657553,0.00036287733,0.0005380374,0.0014913691,0.0008880333,0.00014415864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032991804,0.00038755947,0.00062608323,0.0007778417,0.00010939466,0.00021605028,0.0027134058,0.0003514958,0.0000019539755],"category_scores_gemma":[0.00024219058,0.00036238274,0.00011945883,0.00054652785,0.0003695396,0.0010289118,0.00057212735,0.00035811303,0.0000066766424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011468396,0.000016666354,4.8897573e-7,0.00011089529,0.000007006191,0.0000020335303,0.00047861302,0.64354753,0.000114772985,0.22915961,0.00005095365,0.12649998],"study_design_scores_gemma":[0.00024844092,0.00015062759,6.11883e-7,0.00025480648,0.000007673364,0.000022175063,2.5303797e-7,0.80942917,0.0015933005,0.18721436,0.0007792385,0.00029936142],"about_ca_topic_score_codex":0.000021587135,"about_ca_topic_score_gemma":0.0000034173927,"teacher_disagreement_score":0.16588165,"about_ca_system_score_codex":0.0004101887,"about_ca_system_score_gemma":0.00066205795,"threshold_uncertainty_score":0.9998828},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035698377,0.0013524331,0.98238236,0.00054843974,0.0014550642,0.00034924393,0.000014746713,0.00023784387,0.010090054],"genre_scores_gemma":[0.5064749,0.000050373856,0.489906,0.002685487,0.000651245,0.000006798829,0.000025894169,0.000060120045,0.00013913473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995337,0.000042346746,0.0008560597,0.0016581613,0.0013300258,0.0007764101],"domain_scores_gemma":[0.9965636,0.00039891805,0.00062102644,0.0018313231,0.0004038374,0.00018131066],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00059524266,0.00070564734,0.00081708684,0.0013019036,0.0002487249,0.00040301256,0.0056655277,0.00038384768,0.000015018626],"category_scores_gemma":[0.0000043659766,0.00063713745,0.00021928082,0.0011210358,0.00046387332,0.0006725103,0.0020880688,0.00083453924,0.00003626975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003899896,0.00021669634,0.0014162452,0.0014375298,0.00010268775,0.00025012848,0.004281799,0.4553301,0.013819459,0.049221557,0.000016436232,0.47386837],"study_design_scores_gemma":[0.0005967068,0.00022277569,0.00039051974,0.001795036,0.00003106804,0.00008963651,7.635857e-7,0.88295156,0.012276494,0.0975196,0.0029238202,0.0012020202],"about_ca_topic_score_codex":0.0002567514,"about_ca_topic_score_gemma":0.00061641727,"teacher_disagreement_score":0.5029051,"about_ca_system_score_codex":0.00011963591,"about_ca_system_score_gemma":0.00044606,"threshold_uncertainty_score":0.9997143},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035163906,0.0012602413,0.9819996,0.0034502747,0.00404575,0.00071175565,0.000006506651,0.0007687512,0.007405514],"genre_scores_gemma":[0.01664098,0.00007628127,0.9245542,0.053547475,0.00431704,0.000016950722,0.000098563134,0.00014007736,0.00060842687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99116373,0.00017659189,0.0011743585,0.0032529996,0.0022002088,0.0020321314],"domain_scores_gemma":[0.9927264,0.0009760252,0.00071132596,0.00423918,0.00079939375,0.0005477163],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0014917109,0.001274757,0.001168691,0.0017539879,0.0007230691,0.0011735908,0.012245381,0.0007899943,0.000031707274],"category_scores_gemma":[0.0000742955,0.0011933414,0.00028477548,0.005613391,0.0003996981,0.0011060209,0.0048209857,0.0023313533,0.00019289555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018990568,0.00016998986,0.00010724305,0.00020264847,0.000041448544,0.00028185276,0.0056569763,0.09050176,0.0000707249,0.0054937056,0.0012065351,0.8962481],"study_design_scores_gemma":[0.0010421977,0.00036785513,0.0007465727,0.0020594134,0.00003880741,0.0002586904,0.000003895283,0.8493401,0.0008612905,0.11055814,0.032298673,0.002424397],"about_ca_topic_score_codex":0.00014207464,"about_ca_topic_score_gemma":0.00072922953,"teacher_disagreement_score":0.89382374,"about_ca_system_score_codex":0.00069135637,"about_ca_system_score_gemma":0.0019789722,"threshold_uncertainty_score":0.9999703},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007887066,0.00012610764,0.97844315,0.000039752074,0.003545289,0.00022519621,0.000018915127,0.00020642299,0.017316313],"genre_scores_gemma":[0.9424741,0.000030849067,0.05600806,0.00038447886,0.0007539926,0.0000057620477,0.000060636023,0.00006483967,0.00021723426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846554,0.00001549291,0.00030982995,0.0006133761,0.00036367198,0.00023210802],"domain_scores_gemma":[0.9985289,0.00013456991,0.00006894353,0.0011299823,0.000055158365,0.00008246184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032327283,0.00028206932,0.00027854685,0.00038985195,0.00009127101,0.000127988,0.00090464763,0.00021590687,0.00017009658],"category_scores_gemma":[0.000022535856,0.0002500189,0.000034982593,0.00010614862,0.00019504646,0.00020441279,0.00014390558,0.00043321916,0.000097498225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061468845,0.000009871608,0.000044442728,0.00006538503,0.000007890154,0.000013460914,0.00014954775,0.1974384,0.00030608007,0.0007614758,0.00011809336,0.8010792],"study_design_scores_gemma":[0.00015577063,0.00004418795,0.000059389196,0.00062801526,0.0000052928967,0.000026193056,8.099014e-8,0.9943443,0.00030165695,0.0017745072,0.002369736,0.0002908734],"about_ca_topic_score_codex":0.000014654684,"about_ca_topic_score_gemma":0.000058238114,"teacher_disagreement_score":0.94239527,"about_ca_system_score_codex":0.00012121084,"about_ca_system_score_gemma":0.00008820022,"threshold_uncertainty_score":0.99999523},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6761674,0.00042065722,0.31410792,0.0010794537,0.004769903,0.00088469393,0.000002323091,0.00006417648,0.0025034426],"genre_scores_gemma":[0.99632937,0.00003288003,0.0019233119,0.00022094829,0.0005151282,0.000101262776,0.0000034957202,0.000026016685,0.00084756885],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99838024,0.00004431144,0.00028757149,0.0005710807,0.00042105114,0.00029571573],"domain_scores_gemma":[0.99765724,0.001195475,0.0002868069,0.0006680357,0.00013107309,0.00006137543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022230756,0.000244964,0.00021565266,0.0003425829,0.0001548497,0.00005394963,0.00050960964,0.000072470524,0.000057037705],"category_scores_gemma":[0.00014241326,0.00016963798,0.000055037464,0.00027855116,0.00044598817,0.0003218511,0.000087800574,0.0005321778,0.000029152052],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015238243,0.0003206687,0.0035795595,0.00020509557,0.000066597546,0.000010101346,0.09338033,0.010124284,0.004556708,0.027326984,0.000011243046,0.86026603],"study_design_scores_gemma":[0.0012891679,0.0012888553,0.9324466,0.004932327,0.000087105014,0.00018473291,0.00012267558,0.0017684745,0.04325951,0.0070192046,0.0060639437,0.0015374294],"about_ca_topic_score_codex":0.000037585003,"about_ca_topic_score_gemma":0.000019868776,"teacher_disagreement_score":0.92886704,"about_ca_system_score_codex":0.00017561021,"about_ca_system_score_gemma":0.0000742124,"threshold_uncertainty_score":0.6917636},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000073513775,0.0008344925,0.99177027,0.0008040794,0.00091238855,0.0008086547,0.000039596962,0.00087686937,0.003946325],"genre_scores_gemma":[0.0019651519,0.00015529696,0.98943,0.0042909454,0.00055694056,0.000016400523,0.00003960422,0.000058454087,0.0034872035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993942,0.000064660904,0.0008183252,0.0025615247,0.0013770831,0.0012363665],"domain_scores_gemma":[0.9958029,0.00027083675,0.00038560096,0.0026040717,0.00037339077,0.00056320877],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012016376,0.0008946216,0.00085992645,0.0014814014,0.00037860166,0.001018735,0.0046457546,0.00056587585,0.00011530291],"category_scores_gemma":[0.000109343106,0.00086152105,0.00026655477,0.0010025968,0.00039604,0.0014749889,0.0022090545,0.00140395,0.00021333904],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005773443,0.00008078458,0.00001303074,0.000025394276,0.000008695976,0.00025393508,0.0005137734,0.00016202933,0.0003880388,0.003238598,0.0003974063,0.99491256],"study_design_scores_gemma":[0.0032748,0.0010899189,0.00026570354,0.003144917,0.00006572947,0.0009917694,9.346562e-7,0.5279676,0.040226027,0.31655252,0.101506285,0.0049138167],"about_ca_topic_score_codex":0.00005202234,"about_ca_topic_score_gemma":0.00032009507,"teacher_disagreement_score":0.9899987,"about_ca_system_score_codex":0.00035161135,"about_ca_system_score_gemma":0.001004843,"threshold_uncertainty_score":0.99938357},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003930116,0.00005023228,0.985731,0.001611508,0.00088556996,0.00075868366,0.00001626008,0.00035485075,0.010552602],"genre_scores_gemma":[0.103290245,0.000054523327,0.8844448,0.01083954,0.00060635584,0.000073425195,0.00009105966,0.00006923996,0.00053082546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565333,0.0000720199,0.00054491387,0.0017777205,0.0012468981,0.00070513645],"domain_scores_gemma":[0.9973164,0.00047687712,0.00034470492,0.0013647322,0.00028226257,0.00021499077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094094017,0.00065261713,0.0005102965,0.0012318986,0.00030078087,0.0005239365,0.0023982627,0.00059809507,0.000069138754],"category_scores_gemma":[0.00013870372,0.0005957272,0.00018994829,0.0006548808,0.0003126816,0.00072567776,0.00042000704,0.0012521778,0.000290233],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013025615,0.000060849212,0.0000014722762,0.000020652471,0.000002652296,0.00008449432,0.00008324399,0.0052178837,0.0006994162,0.00034511837,0.0001239812,0.9933472],"study_design_scores_gemma":[0.0006073499,0.0009516249,0.000073179865,0.002239135,0.000010099754,0.00009397789,1.910961e-7,0.75666815,0.0520982,0.18087469,0.004796587,0.0015868128],"about_ca_topic_score_codex":0.000010494184,"about_ca_topic_score_gemma":0.000012054596,"teacher_disagreement_score":0.9917604,"about_ca_system_score_codex":0.0003051066,"about_ca_system_score_gemma":0.00044833196,"threshold_uncertainty_score":0.9996494},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013520386,0.00007404962,0.9933249,0.0043460806,0.00013880523,0.00065616274,0.000058422673,0.00013430459,0.001253779],"genre_scores_gemma":[0.043332543,0.000047786172,0.9478457,0.007859999,0.000099871504,0.000017882117,0.00019406028,0.000039822145,0.0005623193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977633,0.000011370022,0.00027972483,0.0011035801,0.0005222159,0.00031985083],"domain_scores_gemma":[0.99747264,0.00012391874,0.000113443704,0.0020721469,0.00010403374,0.00011384161],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003704859,0.00029503286,0.00036265035,0.0003472774,0.00016290651,0.000039411843,0.00065022963,0.00023501557,0.000020362877],"category_scores_gemma":[0.000054756878,0.00026162952,0.000058332393,0.00024089338,0.00032726512,0.000103874234,0.00023726052,0.0007356934,0.000013518721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033853456,0.000066789515,0.0000032165274,0.000029112147,0.0000023233981,0.000017747212,0.000017886297,0.94276375,0.0004689041,0.0040271715,0.0005423996,0.05202686],"study_design_scores_gemma":[0.00027487645,0.00014494883,0.00001448344,0.00036936777,0.000015339621,0.000024176235,2.0681853e-8,0.9450614,0.0003611512,0.04949816,0.004003711,0.00023240357],"about_ca_topic_score_codex":0.000007923686,"about_ca_topic_score_gemma":0.000018790788,"teacher_disagreement_score":0.051794454,"about_ca_system_score_codex":0.00033364884,"about_ca_system_score_gemma":0.00033100825,"threshold_uncertainty_score":0.9999836},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013682312,0.00054627,0.99554324,0.00048949453,0.00022056203,0.00089460745,0.000008127947,0.00024562268,0.0019152736],"genre_scores_gemma":[0.18459314,0.000060683957,0.8137126,0.0005697233,0.0005698533,0.00015793143,0.00001091547,0.000044829914,0.00028031113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968203,0.000055234468,0.00031463875,0.0012909556,0.0008047579,0.0007141351],"domain_scores_gemma":[0.99777794,0.00026070006,0.00021376644,0.0012808454,0.00018985035,0.0002768946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052052457,0.0005226291,0.0003963221,0.0005819351,0.00050329417,0.00046314753,0.0024637326,0.00017556196,0.000014695903],"category_scores_gemma":[0.000019967269,0.00042799668,0.000090311616,0.00078216783,0.000717843,0.0012332358,0.0005589903,0.0006652387,0.00007636425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025213261,0.00023943046,0.0004968741,0.00003574061,0.00009413651,0.00006816514,0.008122866,0.031097114,0.0010667037,0.24501385,0.00013474512,0.71360517],"study_design_scores_gemma":[0.0018612484,0.0017865282,0.008857568,0.0024377122,0.00019426216,0.0012114003,0.0000029260057,0.736323,0.01951387,0.21952558,0.0024519244,0.0058339797],"about_ca_topic_score_codex":0.00003139499,"about_ca_topic_score_gemma":0.000009089605,"teacher_disagreement_score":0.7077712,"about_ca_system_score_codex":0.00029853667,"about_ca_system_score_gemma":0.00053768826,"threshold_uncertainty_score":0.9998172},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002965658,0.0033618417,0.98958856,0.0010633834,0.0025181647,0.0009475443,0.00011205289,0.00020424821,0.0019076111],"genre_scores_gemma":[0.13164493,0.00018658832,0.8653008,0.0014943194,0.00079062884,0.000047872105,0.0000709185,0.000054130098,0.00040980068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956911,0.00007809484,0.00075598987,0.001807393,0.0009158669,0.000751546],"domain_scores_gemma":[0.9951031,0.0013530839,0.00043640166,0.0024722442,0.00037726582,0.00025786928],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001093348,0.00069112744,0.0008375793,0.00057359884,0.00079347246,0.001437675,0.004026067,0.00043207474,0.000022122967],"category_scores_gemma":[0.00008525138,0.0006696984,0.00022348331,0.0004302266,0.0018330814,0.0010155088,0.0021009916,0.00086247915,0.000018781871],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046500914,0.00017100654,0.00013758251,0.00011038752,0.00007421354,0.000029955152,0.001977833,0.009208247,0.000080975056,0.286441,0.00039717986,0.7013251],"study_design_scores_gemma":[0.0006771682,0.00014816737,0.00020061118,0.00028946184,0.000017711178,0.000026562006,6.0899276e-7,0.6897103,0.00007657796,0.28918654,0.018946903,0.00071937934],"about_ca_topic_score_codex":0.00021789884,"about_ca_topic_score_gemma":0.000631957,"teacher_disagreement_score":0.70060575,"about_ca_system_score_codex":0.000264268,"about_ca_system_score_gemma":0.00030667856,"threshold_uncertainty_score":0.9995989},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057690637,0.0006212854,0.99196774,0.00027143088,0.0006235861,0.000259232,0.000010983092,0.00007355086,0.00040310068],"genre_scores_gemma":[0.11168752,0.000055381945,0.88789785,0.00013450734,0.0001431383,0.0000016928246,0.0000051861703,0.000014080351,0.00006065964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704146,0.000036367757,0.00043171772,0.0011666407,0.0008840285,0.00043978138],"domain_scores_gemma":[0.99820924,0.00025589185,0.00020923717,0.0009645766,0.00020538371,0.00015565882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005785127,0.00036351176,0.0004519365,0.00052919996,0.00027408262,0.00032798643,0.0015565241,0.00023419832,0.000009895155],"category_scores_gemma":[0.000029002516,0.00030734626,0.000077214114,0.00042202917,0.0013313732,0.00027879456,0.0014478848,0.00054021896,0.00000628802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008325417,0.000030223002,0.00003175468,0.000019674068,0.0000040688114,0.000031923228,0.0004161492,0.15668549,0.00034209597,0.0038085803,0.000004841778,0.8386169],"study_design_scores_gemma":[0.00027083862,0.00030375918,0.0009152961,0.00031988745,0.0000046606838,0.00010108691,3.507639e-7,0.99178135,0.0011107291,0.0045809075,0.00027871534,0.0003324032],"about_ca_topic_score_codex":0.00003474125,"about_ca_topic_score_gemma":0.0000064410733,"teacher_disagreement_score":0.8382845,"about_ca_system_score_codex":0.00009178768,"about_ca_system_score_gemma":0.00034764607,"threshold_uncertainty_score":0.9999379},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023261786,0.0004221281,0.9950923,0.0005417738,0.0006864605,0.00044391432,0.0000027171186,0.000113113296,0.00037145655],"genre_scores_gemma":[0.11489202,0.000024068213,0.8837834,0.0006298397,0.00034836287,0.0000110290985,0.0000024566655,0.00004746905,0.00026138013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673283,0.00007929812,0.0004124119,0.0014740444,0.0006116035,0.0006898343],"domain_scores_gemma":[0.99761045,0.0010714824,0.00029896683,0.0007406708,0.00015685789,0.00012154413],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018283399,0.00055038393,0.00060507155,0.0007985273,0.00038583003,0.0013050016,0.0012666087,0.0002955283,0.0000015145998],"category_scores_gemma":[0.000066114655,0.0004756474,0.000075768236,0.00037669064,0.0002578708,0.000918565,0.0006004828,0.0009970432,0.00000200728],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004559421,0.000022149054,0.0000554073,0.00022787496,0.000012362208,0.00017691129,0.0022164688,0.04431625,0.010195374,0.0018597203,0.000010077846,0.9408618],"study_design_scores_gemma":[0.002972373,0.0009399386,0.00085290044,0.0062721884,0.000052366267,0.0018650257,0.000003840607,0.59319407,0.02281662,0.36647788,0.001610168,0.0029426205],"about_ca_topic_score_codex":0.00009592988,"about_ca_topic_score_gemma":0.00013457572,"teacher_disagreement_score":0.9379192,"about_ca_system_score_codex":0.00019552723,"about_ca_system_score_gemma":0.00018198951,"threshold_uncertainty_score":0.9997695},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22729091,0.00076148583,0.76286894,0.002645422,0.0027625726,0.0010611147,0.000020640819,0.00038651147,0.0022024012],"genre_scores_gemma":[0.8998547,0.000045100172,0.0989773,0.00013138633,0.00080755836,0.000015558455,0.0000012777058,0.000026120793,0.00014095876],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99676466,0.00007373024,0.00045467928,0.001088121,0.00078667206,0.0008321359],"domain_scores_gemma":[0.99790156,0.0006576693,0.00025017234,0.0008059038,0.00020097129,0.0001837018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009340951,0.00034079366,0.0004808675,0.00048514147,0.00046144298,0.00023062332,0.0020901933,0.000548587,0.000054491913],"category_scores_gemma":[0.00028314022,0.00037180685,0.000121932455,0.00078660087,0.001161132,0.00074744044,0.0006287166,0.00086224935,0.000028829423],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069208254,0.0001418471,0.045038078,0.000054198743,0.00003544293,0.000048988906,0.35063446,0.009851509,0.004176632,0.0043659387,0.00037499063,0.585271],"study_design_scores_gemma":[0.0023318208,0.0016781347,0.4972428,0.028097855,0.00016722774,0.000016346477,0.0029725346,0.14038588,0.009861064,0.29283276,0.0140789645,0.010334587],"about_ca_topic_score_codex":0.005196132,"about_ca_topic_score_gemma":0.0138382865,"teacher_disagreement_score":0.67256385,"about_ca_system_score_codex":0.0005951351,"about_ca_system_score_gemma":0.00042438117,"threshold_uncertainty_score":0.9998734},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022870104,0.00019996069,0.9917486,0.00035254753,0.0013447634,0.00053293834,0.00008754501,0.00011366071,0.0033329788],"genre_scores_gemma":[0.77884895,0.00003114472,0.2197945,0.0008597207,0.00033503943,0.000016911114,0.00005360425,0.000035902358,0.000024225159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956152,0.00007188486,0.0006554347,0.0016647832,0.0013442443,0.00064848945],"domain_scores_gemma":[0.996292,0.0008103932,0.0005471961,0.0013907553,0.00073748484,0.00022218018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055290724,0.0006154942,0.0007725176,0.0010184182,0.00027568536,0.00037187888,0.0034057735,0.00042900705,0.000089370165],"category_scores_gemma":[0.000055532986,0.0005839249,0.00023980127,0.0010140477,0.0018056576,0.0013841459,0.0017474318,0.0010616924,0.000053983422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019074485,0.00018276143,0.000090736175,0.00009657415,0.00008102031,0.000031263793,0.0048284074,0.038858708,0.00005423988,0.82166433,0.000099337616,0.13399357],"study_design_scores_gemma":[0.0003128778,0.00013452218,0.0009438411,0.00020449015,0.000012264891,0.00005697466,0.0000016388974,0.12650846,0.0005982326,0.8703923,0.00022432057,0.00061008445],"about_ca_topic_score_codex":0.00012029262,"about_ca_topic_score_gemma":0.000089125126,"teacher_disagreement_score":0.7765619,"about_ca_system_score_codex":0.0002441614,"about_ca_system_score_gemma":0.0007850579,"threshold_uncertainty_score":0.9996612},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018194758,0.000698048,0.9940354,0.000068334855,0.0009979627,0.00017661172,0.0000023356024,0.00010109324,0.0021006896],"genre_scores_gemma":[0.9552299,0.000026945823,0.043424617,0.00032499793,0.00080583233,0.0000022640418,0.0000065814484,0.00006869822,0.00011018435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793655,0.00002255035,0.00052772136,0.0004625884,0.0005642279,0.0004863886],"domain_scores_gemma":[0.9988963,0.00026890365,0.0002099642,0.00042875626,0.0001263019,0.00006978371],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005867164,0.00037115294,0.00065424724,0.0001974651,0.000045912544,0.000048699098,0.0009966153,0.00040644777,0.00002674673],"category_scores_gemma":[0.000020494343,0.0003636433,0.00015752533,0.0002699186,0.00062454515,0.000109212415,0.00034953837,0.00071924593,0.000008032865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004664404,0.0000039498577,0.000020559499,0.000099605044,0.000028077293,0.0000048622833,0.00043889528,0.87832296,0.0001501056,0.0050597386,0.00016185659,0.11570475],"study_design_scores_gemma":[0.00016248136,0.000060022765,0.00012077119,0.0005824232,0.000020146861,0.000011628968,1.2199759e-7,0.949,0.00096190604,0.047714148,0.0010104547,0.00035586665],"about_ca_topic_score_codex":0.000020721507,"about_ca_topic_score_gemma":0.000041069994,"teacher_disagreement_score":0.9534104,"about_ca_system_score_codex":0.000158455,"about_ca_system_score_gemma":0.000093004644,"threshold_uncertainty_score":0.99988157},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042480024,0.00027430517,0.99385905,0.000049394384,0.0005861747,0.00080061087,0.000031430343,0.00038958233,0.003966977],"genre_scores_gemma":[0.38913134,0.000014796811,0.6103027,0.00014324454,0.00020577101,0.00009673053,0.000018158344,0.000053236818,0.000034013803],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816364,0.0000058431774,0.00036656205,0.0006674289,0.00033198865,0.00046456011],"domain_scores_gemma":[0.9985602,0.0005266505,0.00008277101,0.0005066008,0.00017194122,0.0001518714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022719036,0.00037261946,0.00034946264,0.00040568382,0.00012596027,0.00012242275,0.000777338,0.00037074994,0.00006414272],"category_scores_gemma":[0.00003779976,0.0003833507,0.00010994875,0.00045702,0.00075055764,0.00016291338,0.00010589478,0.00063914206,0.00005118591],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008891577,0.000030972446,0.0000045195543,0.00007636364,0.000012729024,0.0000029388732,0.00019071448,0.21028574,0.000047224625,0.04895495,0.000025123836,0.74035984],"study_design_scores_gemma":[0.0001819196,0.00013449973,0.0000126429595,0.00020455373,0.0000126692,0.000003581415,1.2779142e-7,0.44483265,0.0011056166,0.5526962,0.00047221113,0.0003433048],"about_ca_topic_score_codex":0.0000055405912,"about_ca_topic_score_gemma":0.000014463207,"teacher_disagreement_score":0.7400165,"about_ca_system_score_codex":0.00014719265,"about_ca_system_score_gemma":0.00011862893,"threshold_uncertainty_score":0.99986184},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2697282,0.00069381593,0.7281081,0.0001854255,0.00072692515,0.00012294842,4.0202428e-7,0.0004267151,0.0000074669947],"genre_scores_gemma":[0.49523798,0.0000057794377,0.50422984,0.00037715246,0.00013916813,0.0000013626066,4.0312693e-7,0.0000070190636,0.0000013165749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725896,0.00007366645,0.00032082023,0.00097035983,0.0007045432,0.00067163515],"domain_scores_gemma":[0.9985804,0.00018290464,0.0001409214,0.00077587046,0.00018527181,0.00013462098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087226636,0.00025529315,0.00023364283,0.00054128026,0.00058910355,0.00023787266,0.0020359468,0.00012908342,0.000005281175],"category_scores_gemma":[0.00025692073,0.00022725959,0.000053915814,0.002269039,0.00046527764,0.001217503,0.0012132007,0.00038795263,0.000010171959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023351986,0.0001658885,0.026541535,0.00007348781,0.000008709288,0.0009438977,0.008390698,0.0823213,0.14184393,0.001901036,0.000035115452,0.73775107],"study_design_scores_gemma":[0.00016278827,0.000078290985,0.0014056605,0.00012619898,0.0000017535098,0.0007800213,3.7725113e-7,0.78135103,0.20575206,0.009934658,0.000030186071,0.00037697665],"about_ca_topic_score_codex":0.00014057024,"about_ca_topic_score_gemma":0.00004034783,"teacher_disagreement_score":0.73737407,"about_ca_system_score_codex":0.00046702067,"about_ca_system_score_gemma":0.00041262584,"threshold_uncertainty_score":0.9267377},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002977411,0.00009961881,0.99522674,0.0013057619,0.00056802994,0.0005348942,0.000078050565,0.00041408069,0.0014750874],"genre_scores_gemma":[0.5773229,0.000023334693,0.4192625,0.0025706661,0.0006129759,0.000014249846,0.00008183545,0.000049629965,0.000061898885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99482596,0.000116229945,0.0005291459,0.0022174902,0.0012796288,0.0010315507],"domain_scores_gemma":[0.9957085,0.00047836537,0.00038769946,0.0026685079,0.00040319999,0.000353726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015182992,0.00074115733,0.0006947822,0.0012420632,0.00047706283,0.00060191896,0.0037450353,0.00046485872,0.00006689177],"category_scores_gemma":[0.00010890559,0.000640587,0.00022852342,0.0017726474,0.0010916963,0.0008739311,0.0011978159,0.0010637356,0.000045137407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111898466,0.00038237512,0.0022403845,0.00025490424,0.00004525203,0.00020286159,0.0024914471,0.030191308,0.000068373876,0.54681367,0.00022379143,0.41697374],"study_design_scores_gemma":[0.0026594535,0.0012823871,0.0031819849,0.00081091915,0.00004723738,0.000090740796,0.0000018975784,0.7102957,0.00067044055,0.25749606,0.02079103,0.0026721384],"about_ca_topic_score_codex":0.00005655243,"about_ca_topic_score_gemma":0.0006041192,"teacher_disagreement_score":0.6801044,"about_ca_system_score_codex":0.00043498905,"about_ca_system_score_gemma":0.0012866734,"threshold_uncertainty_score":0.9996045},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000086089014,0.0008718021,0.99049044,0.00041712882,0.0005471855,0.00021905832,0.0000024551252,0.00039887498,0.0069669574],"genre_scores_gemma":[0.3121804,0.00008234187,0.6863593,0.00035187637,0.00028609784,0.000010085651,0.000008574475,0.0000369936,0.0006843066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961579,0.000058733527,0.0004144171,0.0013243399,0.0012711358,0.0007735019],"domain_scores_gemma":[0.9976278,0.00046206973,0.0003146324,0.000855081,0.00049820915,0.00024218431],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007760503,0.0005388571,0.00046217281,0.00060475984,0.0004017131,0.00039967799,0.001989843,0.00036533183,0.000023333327],"category_scores_gemma":[0.000069304355,0.0004537574,0.00008830392,0.0005853007,0.0005645208,0.0014222478,0.0007410263,0.0014778029,0.000050999486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010429371,0.000022230035,0.00008706208,0.000017395227,0.000017691023,0.00004094388,0.0017924132,0.431864,0.000027327314,0.26124874,0.00001007756,0.30486166],"study_design_scores_gemma":[0.00013806642,0.00015973652,0.000065877306,0.00033992837,0.00000993862,0.000102720354,2.800736e-7,0.6655767,0.00016307415,0.33265448,0.0002263456,0.0005628509],"about_ca_topic_score_codex":0.000028340235,"about_ca_topic_score_gemma":0.00005000181,"teacher_disagreement_score":0.31209433,"about_ca_system_score_codex":0.00027121467,"about_ca_system_score_gemma":0.0007503018,"threshold_uncertainty_score":0.99979144},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054685054,0.000265664,0.992562,0.00004154672,0.00013296604,0.0002462375,0.0000012349464,0.00006540099,0.0012164565],"genre_scores_gemma":[0.9867685,0.000058953898,0.013076373,0.000032177777,0.000035953024,0.000006585783,0.000002013739,0.000014516162,0.0000049527716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989169,0.000036950165,0.00035769583,0.0002018782,0.00035786,0.00012866908],"domain_scores_gemma":[0.99859816,0.00040802878,0.00013335886,0.0007741785,0.00007293726,0.000013364128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006615858,0.00014872412,0.00022532065,0.00041996443,0.000026004813,0.000023224335,0.0010916064,0.00015888903,0.0000037891136],"category_scores_gemma":[0.000056363366,0.00012830405,0.00004141497,0.0002879566,0.00027958053,0.000101968806,0.00014449487,0.00041489932,0.0000012547558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055590335,0.000019262696,0.00016927665,0.00032253,0.0000075028934,0.0000022951824,0.0034168016,0.29217958,0.019054338,0.017087603,0.0000058426376,0.6677294],"study_design_scores_gemma":[0.00009933043,0.00007448383,0.0019686215,0.00057365984,0.000005246032,0.000009227997,6.089095e-7,0.85602415,0.07809907,0.06256475,0.00033015685,0.00025072158],"about_ca_topic_score_codex":0.000033622917,"about_ca_topic_score_gemma":0.0002739,"teacher_disagreement_score":0.9813,"about_ca_system_score_codex":0.00006739976,"about_ca_system_score_gemma":0.00002210153,"threshold_uncertainty_score":0.52320874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030266943,0.00079367845,0.98586774,0.00019324364,0.0066806176,0.0007334104,0.000004962346,0.00011078099,0.0025888707],"genre_scores_gemma":[0.9625882,0.00006717163,0.03628451,0.00019301937,0.00078144175,0.000015991875,0.0000057982706,0.000024143917,0.000039755985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951594,0.00013179828,0.00074906956,0.0012061431,0.00230534,0.00044827323],"domain_scores_gemma":[0.9964965,0.00027710112,0.0005847974,0.0014670794,0.0010353609,0.00013914065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037230744,0.00041470744,0.00057069794,0.0007994363,0.00026538596,0.00033983157,0.0022498746,0.00060168805,0.00005961415],"category_scores_gemma":[0.00014729776,0.0003784033,0.00013478157,0.0006701009,0.00048537357,0.00064303115,0.0010338671,0.0012010969,0.000023533488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016581223,0.00006332692,0.000013358935,0.00009545904,0.000014723784,0.000013551171,0.0014617431,0.11636391,0.0024523337,0.027562745,0.000019528627,0.85192275],"study_design_scores_gemma":[0.00029969538,0.00015110112,0.000029629999,0.00039827562,0.000013939698,0.000051801286,1.6820529e-7,0.85834825,0.005456995,0.1333034,0.0015812845,0.00036543678],"about_ca_topic_score_codex":0.00009645067,"about_ca_topic_score_gemma":0.00021652965,"teacher_disagreement_score":0.95956147,"about_ca_system_score_codex":0.00027883684,"about_ca_system_score_gemma":0.0006466562,"threshold_uncertainty_score":0.9998668},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008948517,0.00011417689,0.989007,0.0002663937,0.00075116614,0.00031190854,0.000026974365,0.00007339717,0.0005004512],"genre_scores_gemma":[0.79730237,0.000034881934,0.20229855,0.00021774092,0.000040090024,0.0000021734234,0.000006560795,0.000016977636,0.000080636215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761856,0.00008852808,0.00067731756,0.0008016679,0.0004987467,0.00031517862],"domain_scores_gemma":[0.9978959,0.00024408779,0.00034436758,0.0009748083,0.0004250421,0.000115806986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009629487,0.00034649318,0.00060714234,0.0006094196,0.00015407937,0.00010889646,0.0017273007,0.00014287003,0.00002520107],"category_scores_gemma":[0.000047846053,0.0003179274,0.00008994218,0.00041570148,0.0019126396,0.0004955745,0.0010879318,0.00038899985,0.000003035317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109446766,0.00033726747,0.0005223446,0.0004571001,0.00015389171,0.00007258696,0.013826979,0.015662882,0.010037866,0.6729698,0.00008611682,0.28576368],"study_design_scores_gemma":[0.00074224506,0.00071460515,0.0021070384,0.0006169807,0.000016312826,0.000059307404,0.0000015271278,0.3995672,0.010458016,0.58502305,0.00011395424,0.00057979807],"about_ca_topic_score_codex":0.00026687692,"about_ca_topic_score_gemma":0.0002890695,"teacher_disagreement_score":0.78835386,"about_ca_system_score_codex":0.00008996899,"about_ca_system_score_gemma":0.00028726485,"threshold_uncertainty_score":0.9999273},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009956261,0.00014219154,0.99244153,0.0008286821,0.0020154847,0.0006075391,0.000012324555,0.00065106875,0.0032911906],"genre_scores_gemma":[0.0130686145,0.000060209488,0.98475194,0.0012712202,0.00023785584,0.00002580848,0.000017420054,0.00003541326,0.00053154706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709755,0.00003484328,0.00052061176,0.0012466721,0.0005763237,0.00052401365],"domain_scores_gemma":[0.9977389,0.00028929653,0.00034788845,0.0010667624,0.0003996089,0.00015752221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006999701,0.00041993163,0.0004327598,0.00088446384,0.00044055842,0.00030663883,0.0020247216,0.00034837052,0.000008804345],"category_scores_gemma":[0.00011222557,0.0004172861,0.00013895748,0.00063727563,0.000434293,0.00047277755,0.0003684907,0.00055259635,0.000010218058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013926345,0.00008551433,0.000059203434,0.00009403062,0.000035174035,0.000013517045,0.00045784772,0.45200467,0.00010521058,0.102922395,0.0015840075,0.4426245],"study_design_scores_gemma":[0.00027424295,0.00014967924,0.000026311518,0.00015679002,0.000008105311,0.00006820746,5.2625836e-8,0.8360079,0.0013436006,0.15059938,0.01088967,0.00047607665],"about_ca_topic_score_codex":0.000007917953,"about_ca_topic_score_gemma":0.000017350281,"teacher_disagreement_score":0.44214845,"about_ca_system_score_codex":0.0003187147,"about_ca_system_score_gemma":0.00039697386,"threshold_uncertainty_score":0.9998279},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001780843,0.00015309529,0.99173164,0.00036692838,0.0015521894,0.00037748928,0.0000026821222,0.00021581487,0.0054220483],"genre_scores_gemma":[0.22146314,0.000020313879,0.7766553,0.0013489159,0.0003602643,0.000008766533,0.0000036823772,0.00004475224,0.000094836985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99501467,0.00003068394,0.00055082,0.0020518312,0.0014574449,0.0008945717],"domain_scores_gemma":[0.99607617,0.00078760093,0.0003708446,0.002236084,0.00025257323,0.00027675807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008791452,0.00066950853,0.00066482567,0.0008314839,0.00050778285,0.00085546146,0.004553976,0.00034574763,0.000012968525],"category_scores_gemma":[0.00007812882,0.0004900406,0.00013532868,0.0008028108,0.00086003577,0.00039970563,0.0015710345,0.00082110835,0.00008758844],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071873646,0.000019550193,0.0001234827,0.0000125412225,0.000006572931,0.00013426291,0.00024724426,0.0302417,0.000005434454,0.014134284,0.00003317843,0.95503455],"study_design_scores_gemma":[0.00051222905,0.0005145769,0.00043054117,0.00089629163,0.0000117833015,0.00025103224,1.1489345e-7,0.8811495,0.0000631815,0.11093525,0.0042759157,0.00095960393],"about_ca_topic_score_codex":0.000012852285,"about_ca_topic_score_gemma":0.00018104019,"teacher_disagreement_score":0.954075,"about_ca_system_score_codex":0.00019795929,"about_ca_system_score_gemma":0.00037782942,"threshold_uncertainty_score":0.99975514},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007746082,0.0005133144,0.8180234,0.008699655,0.004060226,0.000827893,0.0000027015544,0.00028752277,0.16681069],"genre_scores_gemma":[0.94647825,0.00003626035,0.03882778,0.0107252775,0.0030487657,0.000046300745,0.000024495246,0.00005540773,0.0007574412],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997519,0.000008327875,0.00041653865,0.0007343621,0.0006680196,0.0006537509],"domain_scores_gemma":[0.99816847,0.00013998855,0.00041966932,0.00055534724,0.00070019497,0.000016358312],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008900923,0.0004299295,0.00032757202,0.00036298498,0.0013942594,0.0011420755,0.002187138,0.0005087108,0.00013475731],"category_scores_gemma":[0.00044853878,0.00030802394,0.00007623813,0.0010579425,0.0018493388,0.00087254884,0.0031824345,0.000976777,0.00016222456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020114442,0.0000054242037,0.00082850456,0.00002141328,0.000017961773,0.00000900398,0.00007586068,0.00011676261,0.0000024693088,0.4646354,0.00075862947,0.53352654],"study_design_scores_gemma":[0.00012891249,0.000008152324,0.0030644687,0.000091199414,0.000007954658,0.000006353374,0.000003024605,0.016077332,0.000012143023,0.934282,0.04586789,0.00045057567],"about_ca_topic_score_codex":0.00003583214,"about_ca_topic_score_gemma":0.00009887371,"teacher_disagreement_score":0.9457037,"about_ca_system_score_codex":0.0005847399,"about_ca_system_score_gemma":0.00034428254,"threshold_uncertainty_score":0.9999372},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044536043,0.0004871863,0.98592204,0.00069942116,0.0017830711,0.0004391753,0.0000100076195,0.00043347402,0.0097802635],"genre_scores_gemma":[0.6081273,0.0002921391,0.3841426,0.0051168203,0.000602651,0.000038190887,0.000017683078,0.00016589693,0.0014967255],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99500644,0.00007723574,0.00081357406,0.0020324166,0.0010039309,0.0010663859],"domain_scores_gemma":[0.9966142,0.00047545403,0.0003389345,0.0022716166,0.00006526562,0.00023451177],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014312703,0.0007451363,0.00079331227,0.0013558614,0.00016727249,0.00049024855,0.0060034157,0.00036549426,0.000044131953],"category_scores_gemma":[0.00005559476,0.0006730809,0.00017576544,0.0009429938,0.00079999573,0.000991155,0.0016323046,0.0010606609,0.000098237026],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009339492,0.000061039485,0.000057667967,0.000034918914,0.000009367396,0.00033058634,0.0019420763,0.0016580553,0.0001254988,0.03839444,0.00003782984,0.95733917],"study_design_scores_gemma":[0.00070032704,0.00022200517,0.0018449231,0.00059467,0.0000066985685,0.00012053059,2.2197031e-7,0.37332198,0.0013814842,0.6183559,0.002318061,0.0011332482],"about_ca_topic_score_codex":0.00008653794,"about_ca_topic_score_gemma":0.0003490256,"teacher_disagreement_score":0.9562059,"about_ca_system_score_codex":0.00031508756,"about_ca_system_score_gemma":0.0005377933,"threshold_uncertainty_score":0.99957204},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034172346,0.0010811534,0.9892892,0.00047434593,0.0016611737,0.0009360738,0.000026814247,0.00034355265,0.0027704488],"genre_scores_gemma":[0.87807983,0.00008642537,0.11931205,0.0017498159,0.00058121764,0.000032408912,0.000057880647,0.00006947637,0.000030902203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99382055,0.000085055995,0.0008509349,0.0026422746,0.0015003061,0.0011008538],"domain_scores_gemma":[0.9963748,0.0005889395,0.0005496007,0.0015849407,0.00047450676,0.00042721062],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011688218,0.00091678806,0.0008853381,0.0012118835,0.0006111476,0.0015257123,0.002829384,0.00046555293,0.00004108698],"category_scores_gemma":[0.000098124845,0.00086632353,0.00020747467,0.0012549363,0.001067703,0.0009563412,0.0017816065,0.0012835307,0.00004911906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070213223,0.00015187003,0.00021013075,0.000257585,0.00005878416,0.00016877922,0.0060366658,0.065519884,0.0008250661,0.10964126,0.00013352408,0.8169894],"study_design_scores_gemma":[0.0010049817,0.0001561452,0.0009442429,0.00069760106,0.000029022225,0.00018544482,0.0000017609203,0.8792142,0.00060607796,0.114985764,0.0008526273,0.0013221052],"about_ca_topic_score_codex":0.000056938356,"about_ca_topic_score_gemma":0.000052707106,"teacher_disagreement_score":0.8746626,"about_ca_system_score_codex":0.000241891,"about_ca_system_score_gemma":0.00044715824,"threshold_uncertainty_score":0.9995108},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041179042,0.00031252802,0.9972125,0.00010471237,0.0005038709,0.00038425054,0.000015187909,0.00006662002,0.0009885312],"genre_scores_gemma":[0.8950756,0.000015671802,0.104475014,0.00020325597,0.00009447841,0.00001277412,0.000006146555,0.000018003626,0.00009905027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768233,0.000033269098,0.00042495114,0.00093950075,0.0005818946,0.00033806934],"domain_scores_gemma":[0.99832743,0.00011416949,0.00033756846,0.00076066144,0.00034621876,0.00011396633],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004196913,0.00032966942,0.00042504063,0.00037686274,0.00018836596,0.00019452075,0.00096669164,0.00022260167,0.0000073859255],"category_scores_gemma":[0.000024793686,0.00027229523,0.0000439537,0.00042210435,0.0005098135,0.00047283096,0.00021379042,0.0003182237,0.0000046145974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013216583,0.000152723,0.0005761653,0.00043315988,0.00006630606,0.00010922642,0.0027826966,0.2769918,0.007222883,0.046417497,0.000024234421,0.6650911],"study_design_scores_gemma":[0.0005366311,0.00046151283,0.00049229024,0.0005791435,0.000010837247,0.0000415812,1.6803749e-7,0.9855364,0.0074263583,0.0024776445,0.001972597,0.00046480983],"about_ca_topic_score_codex":0.00016800685,"about_ca_topic_score_gemma":0.0004194147,"teacher_disagreement_score":0.8946638,"about_ca_system_score_codex":0.00008262262,"about_ca_system_score_gemma":0.00032667024,"threshold_uncertainty_score":0.99997294},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008498526,0.00027224247,0.99132323,0.000993809,0.0039856923,0.0009967084,0.00001585126,0.00027890876,0.0020485776],"genre_scores_gemma":[0.07075767,0.000014396715,0.92278814,0.0041306713,0.0013599161,0.000111424255,0.000009834099,0.00008045769,0.0007474988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994983,0.00003538377,0.0007826132,0.0020573996,0.0010623332,0.0010792463],"domain_scores_gemma":[0.9954385,0.0015992337,0.0004694824,0.0017560031,0.00048867153,0.00024810128],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009830135,0.0007105991,0.0006698562,0.00094227196,0.00041334858,0.0011896801,0.005038713,0.0003599161,0.00008044876],"category_scores_gemma":[0.00034340844,0.0006448582,0.00027706468,0.0005906193,0.0009459818,0.0009026571,0.0010208633,0.0007192016,0.00023418898],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064392557,0.000032738953,0.000050174156,0.00006545341,0.000010663606,0.000035715802,0.00067024614,0.06974386,0.00024190336,0.038201932,0.00045055352,0.89049035],"study_design_scores_gemma":[0.00011381811,0.00023208548,0.000022124768,0.000462158,0.000007567216,0.000016989074,4.0930743e-7,0.81262743,0.009853743,0.16726811,0.008611002,0.0007845406],"about_ca_topic_score_codex":0.000048975333,"about_ca_topic_score_gemma":0.00006114847,"teacher_disagreement_score":0.8897058,"about_ca_system_score_codex":0.00038271482,"about_ca_system_score_gemma":0.00082894036,"threshold_uncertainty_score":0.9998472},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25860775,0.000026643294,0.74077505,0.00025441297,0.000083826744,0.00016173287,4.9496805e-7,0.00007589989,0.00001415773],"genre_scores_gemma":[0.5648142,0.0000045896372,0.4348037,0.00032469153,0.000043380816,0.0000024028175,0.000001755407,0.000005020074,2.6934904e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904937,0.000010384991,0.00015419185,0.0003685181,0.00020115903,0.00021639609],"domain_scores_gemma":[0.999472,0.000028833087,0.000050375478,0.0003215524,0.000047500205,0.00007974575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100763,0.00010051133,0.00012417509,0.00008223214,0.00011244082,0.000021562879,0.00018903612,0.000038613674,0.000012757351],"category_scores_gemma":[0.00003849564,0.000083721,0.000029973184,0.0006517592,0.00015604179,0.00012990502,0.00013151861,0.00018577649,0.0000019175434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004891539,0.0002399594,0.100526996,0.00003607429,0.00000330864,0.000036739664,0.0010642157,0.00980685,0.049798246,0.00039595284,0.000015925052,0.8380268],"study_design_scores_gemma":[0.00024447808,0.00015618835,0.09416543,0.00012411334,0.000011936517,0.00012039935,0.0000014022257,0.8454543,0.047758248,0.011704282,0.0000720515,0.00018718957],"about_ca_topic_score_codex":0.000067163,"about_ca_topic_score_gemma":0.0000032862479,"teacher_disagreement_score":0.8378396,"about_ca_system_score_codex":0.00011112136,"about_ca_system_score_gemma":0.000045477856,"threshold_uncertainty_score":0.34140435},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021571863,0.00023786747,0.9831285,0.00078782934,0.0037047,0.00035023567,0.000001842625,0.00025048302,0.011517002],"genre_scores_gemma":[0.12921767,0.0000778243,0.8403505,0.007970769,0.003445852,0.00002159594,0.00001088996,0.00017860577,0.01872626],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99459726,0.000067336005,0.00046401628,0.0021247542,0.0017643033,0.0009823495],"domain_scores_gemma":[0.99591994,0.000725219,0.0002407372,0.0024614753,0.00025715528,0.0003954948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011927038,0.0006397054,0.00053343945,0.0013835657,0.00037118964,0.0008082846,0.0044648824,0.00039284208,0.00009961411],"category_scores_gemma":[0.00014119728,0.0005772422,0.00019181616,0.0009774433,0.0007129375,0.0005954835,0.001388768,0.00165672,0.00046149682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029256245,0.00001365507,0.000007814325,0.0000112009,0.0000073233864,0.000038451773,0.00009402356,0.00976221,0.0000786947,0.21027182,0.00015630922,0.7795293],"study_design_scores_gemma":[0.00043447796,0.0011501563,0.00007519205,0.00034789924,0.000006065972,0.0000545989,4.6612595e-8,0.10175273,0.000621638,0.85434556,0.040339705,0.00087192684],"about_ca_topic_score_codex":0.000013738629,"about_ca_topic_score_gemma":0.000026232537,"teacher_disagreement_score":0.7786573,"about_ca_system_score_codex":0.00037781816,"about_ca_system_score_gemma":0.00073984585,"threshold_uncertainty_score":0.9996679},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018764958,0.0004970133,0.99639034,0.00022895794,0.0011818076,0.000334147,0.000011388296,0.00020306928,0.0009656299],"genre_scores_gemma":[0.07267574,0.000093372364,0.92570096,0.0010480111,0.0004025303,0.0000039945717,0.0000127882595,0.00004022641,0.000022374694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956723,0.00006106955,0.0005876568,0.0018201398,0.0011058507,0.0007530148],"domain_scores_gemma":[0.9970605,0.00028454664,0.00029670316,0.0019405237,0.0001271468,0.00029061822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011241435,0.0006136968,0.00060818903,0.000820967,0.0003929565,0.0006628506,0.0038400951,0.00037319548,0.00003251504],"category_scores_gemma":[0.00003487173,0.0005305591,0.00024493443,0.000732805,0.0006694683,0.0006890731,0.00140383,0.0009062147,0.00001943839],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006281703,0.000030779418,0.000028299846,0.00007021721,0.000008937772,0.00006945028,0.000754166,0.005195646,0.00072539144,0.12596712,0.0000128366655,0.8671309],"study_design_scores_gemma":[0.00028098296,0.00012881328,0.000080128026,0.0006834032,0.000012464152,0.0000728773,7.01731e-8,0.6936186,0.0016938342,0.29103222,0.011533957,0.00086262583],"about_ca_topic_score_codex":0.000025405861,"about_ca_topic_score_gemma":0.000017582403,"teacher_disagreement_score":0.8662683,"about_ca_system_score_codex":0.00015096542,"about_ca_system_score_gemma":0.00028040257,"threshold_uncertainty_score":0.9997146},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9238892,0.00016072494,0.07449803,0.000009916484,0.00036025618,0.00018517641,0.000004463585,0.000077560464,0.0008146496],"genre_scores_gemma":[0.9983417,0.00005079014,0.0014012909,0.0000345888,0.00013007304,0.0000021258202,0.0000016481237,0.000020915533,0.00001687519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987785,0.0000044304115,0.0003599562,0.00024237638,0.00034352782,0.00027117805],"domain_scores_gemma":[0.99929786,0.00008512392,0.00013835865,0.00036552412,0.00006664271,0.000046493504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024775806,0.00021739179,0.00033347486,0.00025847863,0.000046949506,0.000022625554,0.0004782715,0.00009694509,0.0000072248777],"category_scores_gemma":[0.00001354846,0.00020702758,0.000048687525,0.00010893651,0.00018035414,0.00014692593,0.0001222365,0.00030256357,0.0000036717463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002458571,0.000013084862,0.00085926574,0.00022152324,0.0000091453,0.0000026542255,0.00035236165,0.53931844,0.00577837,0.0006242771,7.0391684e-7,0.4528177],"study_design_scores_gemma":[0.0005387844,0.0005426986,0.3137856,0.0040245876,0.00005184112,0.000005803238,3.8279612e-7,0.66468596,0.013800722,0.0010063538,0.00055486,0.0010023956],"about_ca_topic_score_codex":0.0000030037393,"about_ca_topic_score_gemma":0.0000071823615,"teacher_disagreement_score":0.45181534,"about_ca_system_score_codex":0.00007345262,"about_ca_system_score_gemma":0.000022125334,"threshold_uncertainty_score":0.84423393},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000075927994,0.000039515984,0.9980216,0.00022762462,0.00024587172,0.00038668583,0.00022278368,0.000084241234,0.0006957647],"genre_scores_gemma":[0.19843136,0.000016411033,0.8004877,0.00036622473,0.00020889062,0.000034240198,0.00037993063,0.000030300354,0.000044928624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965871,0.00003542735,0.00047543226,0.0015344319,0.00082798564,0.0005396307],"domain_scores_gemma":[0.9974599,0.00049351866,0.00025363057,0.0015165746,0.000119147706,0.00015723398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006693725,0.00041727812,0.00042116753,0.0004949906,0.0001856784,0.0006994248,0.0025058533,0.0001401416,0.000008826127],"category_scores_gemma":[0.00009819024,0.00035249666,0.000029150477,0.00045396294,0.0005681164,0.0005022951,0.0006692382,0.0005321561,0.00004282763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007604244,0.000043860276,0.0000400958,0.000043167805,0.0000061438213,0.00006945605,0.0003971124,0.013245743,0.000068116504,0.03691236,0.000034409364,0.9491319],"study_design_scores_gemma":[0.0003731947,0.00025406366,0.0018867828,0.00057759346,0.000008088925,0.000033103708,4.7391484e-7,0.9660043,0.0004169453,0.028544042,0.0011929037,0.0007084838],"about_ca_topic_score_codex":0.0002772147,"about_ca_topic_score_gemma":0.000674578,"teacher_disagreement_score":0.95275855,"about_ca_system_score_codex":0.00019855652,"about_ca_system_score_gemma":0.00062179525,"threshold_uncertainty_score":0.9998927},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001574692,0.00049638085,0.9785187,0.015387346,0.0027568305,0.0012361497,0.00013178732,0.00099312,0.00046392562],"genre_scores_gemma":[0.0065461826,0.00007274649,0.99104846,0.001419397,0.0005690225,0.00005316458,0.00007091985,0.000079395824,0.00014069917],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927907,0.000035926332,0.00079450494,0.0038127357,0.0012362794,0.0013298827],"domain_scores_gemma":[0.96425116,0.0022424993,0.0005023005,0.03250577,0.0002806329,0.00021762012],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015032929,0.00085165125,0.0008383223,0.0010088023,0.00043131202,0.0015628063,0.14538775,0.0009719706,0.00006174464],"category_scores_gemma":[0.014428905,0.00079063105,0.00014673216,0.0009273767,0.0010101416,0.002711106,0.20564657,0.0017875219,0.00008981285],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066174885,0.000047425805,0.000043252945,0.00015260128,0.000042783206,0.00005865763,0.00022505393,0.00031494375,0.000044792654,0.07657052,0.025418043,0.8970753],"study_design_scores_gemma":[0.00011815265,0.000066744666,0.000010737817,0.0004472806,0.0000071241866,0.000027563801,1.03498834e-7,0.4645977,0.00027646887,0.52670336,0.0072257207,0.00051904237],"about_ca_topic_score_codex":0.000021842206,"about_ca_topic_score_gemma":0.000017804086,"teacher_disagreement_score":0.89655626,"about_ca_system_score_codex":0.00041369357,"about_ca_system_score_gemma":0.0006696718,"threshold_uncertainty_score":0.9994737},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030096204,0.00043604028,0.9953339,0.00038133826,0.0019569586,0.001661773,0.0000067527117,0.0001302226,0.00006293131],"genre_scores_gemma":[0.010375822,0.0000092017945,0.986512,0.0006913351,0.0008221042,0.00013231121,0.000004857586,0.00004174176,0.0014105936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688697,0.00003832034,0.00057352067,0.0013831664,0.00049705873,0.00062093965],"domain_scores_gemma":[0.9965258,0.0019193881,0.00036589717,0.00055123767,0.00046868608,0.00016894334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001286331,0.00045494526,0.0005453571,0.0009073624,0.00038867348,0.00094290625,0.0012155059,0.0002490538,0.000004544998],"category_scores_gemma":[0.00030913562,0.00040798046,0.00013432908,0.0003827909,0.00006403581,0.00048865285,0.00035527634,0.00026136046,0.000009511725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083019195,0.000033153894,0.000039288298,0.000424281,0.00002781258,0.000004752618,0.0053204997,0.11726752,0.010211031,0.08070789,0.00006193502,0.78589356],"study_design_scores_gemma":[0.00030631069,0.0003410117,0.000021041118,0.0014028727,0.000006782026,0.000010673652,0.00000197782,0.9204898,0.012978691,0.015721697,0.047886223,0.00083294266],"about_ca_topic_score_codex":0.00005875297,"about_ca_topic_score_gemma":0.000024096069,"teacher_disagreement_score":0.80322224,"about_ca_system_score_codex":0.0002553093,"about_ca_system_score_gemma":0.0002415729,"threshold_uncertainty_score":0.9998372},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010217085,0.0013244388,0.9852774,0.00019712327,0.0019917546,0.00048197067,0.0000072446446,0.00014513965,0.00035781073],"genre_scores_gemma":[0.39900124,0.000080307225,0.5984567,0.001173962,0.0008973565,0.000014873535,0.000004625818,0.00006301866,0.00030789906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956521,0.000051681825,0.00066721527,0.0015950223,0.001027109,0.0010068925],"domain_scores_gemma":[0.9975381,0.00031009258,0.00038149557,0.0012105952,0.00024961677,0.00031011092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009431743,0.0006720647,0.00059708685,0.0006529114,0.0004944045,0.0009300191,0.0024299696,0.00048107663,0.00002267492],"category_scores_gemma":[0.000054674052,0.00064290245,0.00011462526,0.00040053454,0.00086252927,0.002040859,0.0019514901,0.0009856714,0.000021320757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036043493,0.000028900173,0.000117328236,0.000017882552,0.000009948222,0.00006888584,0.0032572406,0.039133057,0.002668854,0.010131326,0.000004904108,0.9445581],"study_design_scores_gemma":[0.00006615182,0.00007280002,0.000039188788,0.00023671007,0.000023660627,0.000172294,0.0000017866337,0.97576445,0.0026745892,0.020050416,0.00007964135,0.00081832893],"about_ca_topic_score_codex":0.00013118343,"about_ca_topic_score_gemma":0.000058127884,"teacher_disagreement_score":0.9437397,"about_ca_system_score_codex":0.00035399318,"about_ca_system_score_gemma":0.00041747277,"threshold_uncertainty_score":0.9996022},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001070464,0.0001275603,0.99437577,0.0008428544,0.00043768203,0.0002541619,0.0000015707479,0.0023444598,0.0015089181],"genre_scores_gemma":[0.3537478,0.000010866064,0.64435726,0.0014907243,0.00018992626,0.000009398167,0.0000019666672,0.00003245071,0.00015959814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996891,0.00003039172,0.00032871924,0.0013995218,0.0008253901,0.0005249765],"domain_scores_gemma":[0.9965913,0.0014716283,0.00024647886,0.0013614037,0.00016762147,0.00016155008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008436264,0.00048803914,0.0004431921,0.00085662777,0.00036128794,0.0006140318,0.0017955365,0.0002226239,0.0000054028787],"category_scores_gemma":[0.000276175,0.00039571302,0.00005450317,0.00048447365,0.00072296476,0.00027779586,0.0007580722,0.0006812671,0.000017094786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005121344,0.000018466126,0.00020102046,0.000025674637,0.000008152026,0.00006802678,0.00055792526,0.007990064,0.000026337937,0.053458985,0.00010288324,0.9375373],"study_design_scores_gemma":[0.00021802261,0.0005883812,0.00025572028,0.0012346748,0.000009450947,0.00012793644,2.90283e-8,0.5729464,0.00034886235,0.42314625,0.0003521364,0.00077213784],"about_ca_topic_score_codex":0.00003776545,"about_ca_topic_score_gemma":0.000022227896,"teacher_disagreement_score":0.9367652,"about_ca_system_score_codex":0.00013132366,"about_ca_system_score_gemma":0.00025364186,"threshold_uncertainty_score":0.9998495},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003011631,0.0001835979,0.9949832,0.0002232842,0.0007775964,0.00015349523,0.0000011483913,0.00011214327,0.0032643897],"genre_scores_gemma":[0.59316856,0.000022275479,0.40600556,0.0003966748,0.00029649082,0.0000010524304,0.0000053862673,0.000016999027,0.000086996384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760336,0.00003289084,0.0005060514,0.00080890494,0.0006783031,0.0003704719],"domain_scores_gemma":[0.9981286,0.00022429765,0.0004877407,0.0008254071,0.000255114,0.000078864316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084797124,0.00030048293,0.0003841324,0.00055612833,0.00020150021,0.00027249873,0.0018966047,0.00018741774,0.0000047671124],"category_scores_gemma":[0.00005382867,0.0002907398,0.0000717089,0.0005570406,0.00050340354,0.00029103417,0.0006615146,0.00033677198,0.000010248924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026866148,0.000015694846,0.00009641194,0.00006146432,0.000006332405,0.0000025382226,0.0011008646,0.17457098,0.00026134515,0.034296177,0.000020448615,0.7895651],"study_design_scores_gemma":[0.00016217057,0.00010102258,0.00019969157,0.00044756735,0.0000056158096,0.000016628497,1.8472653e-7,0.9696446,0.0033051108,0.025499143,0.00026496238,0.00035330086],"about_ca_topic_score_codex":0.000019831037,"about_ca_topic_score_gemma":0.000012114019,"teacher_disagreement_score":0.7950736,"about_ca_system_score_codex":0.00015057415,"about_ca_system_score_gemma":0.00026423333,"threshold_uncertainty_score":0.99995446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012134769,0.0004714465,0.9954095,0.00058561563,0.00056156126,0.0011600478,0.00003166491,0.00008343798,0.00048324655],"genre_scores_gemma":[0.57950246,0.00013051854,0.41776565,0.001751086,0.00044591058,0.00018961942,0.000019197127,0.00005808883,0.00013747432],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967139,0.000028879098,0.0005055776,0.0013773513,0.0006479494,0.00072634756],"domain_scores_gemma":[0.99735457,0.00063926145,0.0002622521,0.0011822747,0.00024067321,0.00032099124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009918857,0.00046214074,0.0005575695,0.0007292912,0.00020325228,0.0004729834,0.0020253814,0.0004271484,0.0000034956174],"category_scores_gemma":[0.00022841088,0.0004395834,0.00008697247,0.0005151689,0.00054118724,0.0005264855,0.0008365234,0.0006964087,0.000013466969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001960923,0.00007951389,0.000024091076,0.000020946889,0.000006998926,0.000062596126,0.0025584612,0.0012595438,0.00033949976,0.19526632,0.0000067638102,0.8003557],"study_design_scores_gemma":[0.0009761131,0.00216582,0.0007594545,0.00056439167,0.00003080087,0.00041902738,0.0000029590472,0.0817568,0.0010013477,0.9074468,0.0032617638,0.0016147079],"about_ca_topic_score_codex":0.000055761087,"about_ca_topic_score_gemma":0.000097176184,"teacher_disagreement_score":0.7987409,"about_ca_system_score_codex":0.00045670717,"about_ca_system_score_gemma":0.0007402386,"threshold_uncertainty_score":0.99980557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012146742,0.0003296354,0.95761305,0.0011949325,0.004042255,0.000491452,0.000009327679,0.00029513135,0.03590272],"genre_scores_gemma":[0.23991975,0.0000766351,0.752298,0.0067874948,0.0006639161,0.000016155778,0.000007132343,0.00006797519,0.00016295216],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99282575,0.00009130952,0.0010286524,0.002888659,0.00192115,0.0012444531],"domain_scores_gemma":[0.9894542,0.00593165,0.00050178164,0.0034498235,0.00032180196,0.00034072457],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016433323,0.0009840692,0.0009834251,0.0009252119,0.0008330562,0.0012859447,0.0076364186,0.0005002912,0.00007945367],"category_scores_gemma":[0.0009567689,0.00076605467,0.0003804077,0.00090014597,0.0009179388,0.0006426782,0.003566896,0.0017054777,0.0005481776],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000095273945,0.000033908094,0.000016069504,0.0000044442304,0.000011063005,0.000090830756,0.0005073261,0.031201331,0.000013750193,0.16306974,0.00022939322,0.8048126],"study_design_scores_gemma":[0.00030249302,0.0003317895,0.00005910246,0.0009508596,0.000007912355,0.00007337038,1.6808069e-7,0.41997275,0.00008123857,0.5735492,0.003937173,0.00073392066],"about_ca_topic_score_codex":0.00004904943,"about_ca_topic_score_gemma":0.0002741682,"teacher_disagreement_score":0.8040787,"about_ca_system_score_codex":0.0003697599,"about_ca_system_score_gemma":0.00036372227,"threshold_uncertainty_score":0.9997508},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021012614,0.000055601937,0.99661034,0.00005869857,0.00033468014,0.0002906242,0.0000020378573,0.000081169324,0.0004655953],"genre_scores_gemma":[0.9046555,0.000009366483,0.09448734,0.00012871438,0.00054808176,0.0000084001385,0.000013820898,0.000032701842,0.00011605483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984146,0.000012779972,0.00038080078,0.00043913806,0.00038142552,0.00037126135],"domain_scores_gemma":[0.99919474,0.00016309785,0.00011429332,0.0003372806,0.00012003756,0.00007053894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003778043,0.0003033111,0.00033338388,0.00057752564,0.00021023845,0.00016687361,0.00033269732,0.00020802753,0.000012678087],"category_scores_gemma":[0.00012494418,0.00028945893,0.00012250736,0.00025135936,0.00021823065,0.00022428275,0.00007673042,0.00038275772,0.000004156624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021308065,6.7063195e-7,0.000016514734,0.000078227495,0.000008982049,4.1116158e-7,0.00032130186,0.8265708,0.00019034675,0.0005048313,0.0000014923164,0.17230427],"study_design_scores_gemma":[0.00011662486,0.00004553054,0.00001930732,0.00019469115,0.000023724167,0.0000045954484,4.246906e-7,0.9883386,0.001052617,0.009669284,0.00024227786,0.00029230435],"about_ca_topic_score_codex":0.0000379293,"about_ca_topic_score_gemma":0.00003328873,"teacher_disagreement_score":0.9025543,"about_ca_system_score_codex":0.0005106799,"about_ca_system_score_gemma":0.000114986186,"threshold_uncertainty_score":0.9999558},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044866707,0.00053675106,0.99319255,0.00069831853,0.00027975498,0.00035206287,0.000003420466,0.000044896155,0.0004055967],"genre_scores_gemma":[0.9918208,0.000022316179,0.0069088745,0.00038919487,0.0007220326,0.000019071767,0.000018397146,0.000018390461,0.00008092072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841744,0.000003756721,0.0004613501,0.00042528016,0.0004893276,0.00020282072],"domain_scores_gemma":[0.9981928,0.00012537994,0.00062812836,0.00037631317,0.00066898845,0.000008414698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004953003,0.00023748683,0.00039647517,0.00054210477,0.00023938733,0.00013937814,0.00070886296,0.00013804337,0.000017389499],"category_scores_gemma":[0.00014215022,0.00016028559,0.00012213175,0.00050304824,0.00026662747,0.00046514755,0.000116841125,0.00015830678,0.000001265237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067785227,0.00005012197,0.000041363975,0.00074965874,0.000022921602,6.5958625e-7,0.00023220229,0.34178093,0.0013261897,0.0029696783,0.000025124322,0.65279436],"study_design_scores_gemma":[0.00013062591,0.0000104531,0.0000936274,0.0006645387,0.00011054452,7.531597e-7,0.0000015248634,0.9582154,0.00114821,0.03932938,0.00011409257,0.00018082313],"about_ca_topic_score_codex":0.000036922003,"about_ca_topic_score_gemma":0.000031836084,"teacher_disagreement_score":0.98733413,"about_ca_system_score_codex":0.000021659898,"about_ca_system_score_gemma":0.000111611225,"threshold_uncertainty_score":0.65362567},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15417802,0.0097617395,0.68869275,0.0055013844,0.014991942,0.0049484223,0.00011727662,0.0015932542,0.12021523],"genre_scores_gemma":[0.97944677,0.00008699999,0.013599129,0.0045663416,0.0004767452,0.00009012347,0.000020157639,0.000103624414,0.0016101304],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99719036,0.00008525657,0.00047772384,0.0012128252,0.00041877865,0.0006150534],"domain_scores_gemma":[0.99808747,0.00035476245,0.00019518039,0.0011814233,0.00009142835,0.000089718524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006959288,0.0004500896,0.0004480105,0.00052291213,0.00018415744,0.00015085595,0.0013554908,0.00065559376,0.00018570416],"category_scores_gemma":[0.00002426686,0.00033648516,0.000047843303,0.000370043,0.0005635141,0.000115229705,0.000757541,0.0012678358,0.00004430565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056950375,0.00022305555,0.0045325407,0.00008465838,0.000102112244,0.0003354376,0.030157695,0.0005694089,0.0004650258,0.21238759,0.00014864883,0.75093687],"study_design_scores_gemma":[0.0073116994,0.0020216592,0.22640008,0.0008547081,0.0003738678,0.0029691248,0.0002318429,0.10516574,0.00071337784,0.56489956,0.081281975,0.007776367],"about_ca_topic_score_codex":0.0008060535,"about_ca_topic_score_gemma":0.0012751955,"teacher_disagreement_score":0.82526875,"about_ca_system_score_codex":0.0001641983,"about_ca_system_score_gemma":0.00012155501,"threshold_uncertainty_score":0.99990875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075825036,0.00006522607,0.93074507,0.006285262,0.0051469486,0.00048747935,0.0000124502685,0.00008648829,0.056412835],"genre_scores_gemma":[0.72152394,0.000027581405,0.08808357,0.025025455,0.0028353466,0.00011108854,0.000012429186,0.00013302699,0.16224757],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970558,0.00006641401,0.0002588672,0.0014931973,0.0005654692,0.00056021597],"domain_scores_gemma":[0.9975954,0.0007487944,0.0001895964,0.0010073968,0.00019589873,0.00026291242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006323776,0.0003954862,0.00042449177,0.00075497775,0.00019900015,0.0003730455,0.0012834565,0.0002413156,0.0005074624],"category_scores_gemma":[0.0004995867,0.00036064326,0.00009218211,0.0005763845,0.0008727225,0.000118811135,0.0003183771,0.000606849,0.00040419775],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024089873,0.00006228443,0.00015243125,0.0000122331685,0.000008092297,0.00003191877,0.005253312,0.00027450424,0.0003613828,0.012294017,0.0013195081,0.98020625],"study_design_scores_gemma":[0.002154753,0.003987933,0.014336529,0.0018898539,0.00010338255,0.00073667784,0.000032677683,0.011483168,0.0087030865,0.18598883,0.7644471,0.0061359885],"about_ca_topic_score_codex":0.00003511984,"about_ca_topic_score_gemma":0.00009233643,"teacher_disagreement_score":0.97407025,"about_ca_system_score_codex":0.00017795418,"about_ca_system_score_gemma":0.00023802502,"threshold_uncertainty_score":0.99988455},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007431678,0.00020822964,0.98382,0.0005412031,0.0006259106,0.00042988485,0.000001380024,0.0076621054,0.0066369437],"genre_scores_gemma":[0.07599147,0.000010173309,0.9224016,0.0009828134,0.00021656354,0.000024803274,0.0000019424897,0.00004283936,0.00032777028],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958289,0.000034209872,0.00055808254,0.0016649734,0.0011364052,0.000777406],"domain_scores_gemma":[0.9960108,0.0010225978,0.0003339275,0.00200396,0.00039215796,0.00023658852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083473546,0.00061427586,0.0005969872,0.0007116552,0.00025548832,0.00080380077,0.0035707194,0.00028500793,0.00003330498],"category_scores_gemma":[0.00032832738,0.00048604998,0.00010467273,0.0006088689,0.0008653656,0.00064656447,0.0013307672,0.0009212359,0.000110682406],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023196808,0.000028564606,0.00029947737,0.00007336926,0.00001252217,0.00014441645,0.0005087227,0.0014448605,0.000018659308,0.022350594,0.00049973704,0.97461677],"study_design_scores_gemma":[0.00016881071,0.00034834567,0.0002514095,0.0014101648,0.0000082964725,0.00026492373,2.1376591e-8,0.4732177,0.00029601256,0.5226706,0.0005459193,0.00081773836],"about_ca_topic_score_codex":0.00004877361,"about_ca_topic_score_gemma":0.000010591622,"teacher_disagreement_score":0.973799,"about_ca_system_score_codex":0.00023743097,"about_ca_system_score_gemma":0.0006759082,"threshold_uncertainty_score":0.99975914},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081243034,0.0004255325,0.9896116,0.0006780188,0.00055787456,0.00036923526,0.000005309932,0.00030689742,0.007233051],"genre_scores_gemma":[0.4014657,0.000055937926,0.59613055,0.0017710198,0.00034521506,0.000027714359,0.000003425852,0.000045196986,0.00015521006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99556583,0.00007891103,0.0004418193,0.0016778581,0.0010485328,0.0011870627],"domain_scores_gemma":[0.9971714,0.00040319073,0.00027457316,0.0015500387,0.00027245068,0.00032833367],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012579055,0.0006659266,0.00056261057,0.0010730459,0.00051716017,0.0012291608,0.0044812444,0.0003617676,0.00013568166],"category_scores_gemma":[0.000039904742,0.00053105486,0.00021119184,0.0011807024,0.0014198016,0.00089730864,0.0010569951,0.0011254158,0.00004568936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015315618,0.000058358994,0.0007518458,0.00004529816,0.00003844254,0.00015225062,0.0012089105,0.0031558364,0.00015723302,0.65346456,0.000027671118,0.3409243],"study_design_scores_gemma":[0.00058534875,0.0009820232,0.0009378151,0.0008152482,0.000026384752,0.00028831247,0.0000014927101,0.15045731,0.00052762084,0.8385507,0.005169363,0.0016584056],"about_ca_topic_score_codex":0.000030355917,"about_ca_topic_score_gemma":0.00013589703,"teacher_disagreement_score":0.40065327,"about_ca_system_score_codex":0.0001484253,"about_ca_system_score_gemma":0.0007400876,"threshold_uncertainty_score":0.99980766},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004676252,0.0011823964,0.9323644,0.0005199108,0.0023827564,0.00029192152,0.000022811415,0.000053405496,0.062714785],"genre_scores_gemma":[0.9432296,0.00019799142,0.047563773,0.0051439027,0.000689766,0.000014789059,0.000012143661,0.00008163583,0.0030663959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778396,0.000007366072,0.0005661173,0.0010447219,0.00012759103,0.0004702321],"domain_scores_gemma":[0.99875337,0.00017671044,0.00035089994,0.0005863636,0.000034928307,0.00009775164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006279665,0.00038352594,0.00055970484,0.00064265076,0.00021561168,0.0002757288,0.0007742949,0.0002586532,0.00023206354],"category_scores_gemma":[0.00014672843,0.00039262447,0.00014420852,0.00016979252,0.00046182022,0.00017734517,0.00014959893,0.0004906092,0.0003001989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007435529,0.000039502025,0.00034198372,0.00005471111,0.000013788163,0.000016346707,0.00041668236,0.009365421,0.000005629827,0.93643445,0.000277543,0.053026512],"study_design_scores_gemma":[0.0004935712,0.0003435027,0.0033816039,0.00036639126,0.000004484274,0.000005471121,3.1050362e-7,0.18243948,0.000053776585,0.79320025,0.018760907,0.0009502631],"about_ca_topic_score_codex":0.00005344703,"about_ca_topic_score_gemma":0.000046077927,"teacher_disagreement_score":0.94276196,"about_ca_system_score_codex":0.000279869,"about_ca_system_score_gemma":0.00008213011,"threshold_uncertainty_score":0.99985254},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013513541,0.0005728496,0.9905576,0.00045718675,0.0012112742,0.000451966,0.000009324669,0.00064003875,0.0059646172],"genre_scores_gemma":[0.17993577,0.00043526597,0.8158115,0.0027859597,0.00040171525,0.000012563662,0.000016916887,0.00007321406,0.00052710815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950053,0.000098831886,0.0010611456,0.0018766888,0.001104621,0.0008534168],"domain_scores_gemma":[0.9970493,0.0006613906,0.0004463495,0.001440543,0.00022762318,0.00017480343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012018209,0.0007301641,0.00092612643,0.0015992048,0.00042205068,0.0003800737,0.0043524695,0.00045056475,0.000017094217],"category_scores_gemma":[0.00013089945,0.00070260075,0.00017943619,0.0011428406,0.0007567441,0.00057404564,0.0016625855,0.0013256364,0.000039534265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024147406,0.000066770015,0.00032962853,0.000026501166,0.000010958663,0.00024966864,0.0016512515,0.5160513,0.000036815323,0.011266793,0.00015313906,0.470133],"study_design_scores_gemma":[0.00047975485,0.00018022899,0.00029819508,0.0005484548,0.0000029647372,0.00016327281,1.3183103e-7,0.9799552,0.00029565912,0.014913055,0.002323155,0.0008399535],"about_ca_topic_score_codex":0.000074650634,"about_ca_topic_score_gemma":0.00012831496,"teacher_disagreement_score":0.46929306,"about_ca_system_score_codex":0.00041016508,"about_ca_system_score_gemma":0.00062925735,"threshold_uncertainty_score":0.99954253},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035569104,0.0002807846,0.9847314,0.0018685592,0.005573477,0.00048521082,0.0000011652465,0.00053351943,0.0061702244],"genre_scores_gemma":[0.42598268,0.000014020693,0.55351627,0.0066547133,0.009595462,0.000018159608,0.000009805075,0.00014411581,0.004064777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99406636,0.00012916212,0.0007512803,0.002481029,0.0012905471,0.0012816057],"domain_scores_gemma":[0.9958264,0.0003273187,0.0004396499,0.0028351336,0.00019952221,0.00037192504],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020287114,0.0008222158,0.0007648956,0.00071376003,0.00053137215,0.0011097394,0.006806402,0.00039171273,0.00002588504],"category_scores_gemma":[0.000052269377,0.0007157853,0.00022016246,0.0008048833,0.0008019718,0.000116545285,0.0039859004,0.0012200492,0.00012923522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058889877,0.00003793595,0.000056383342,0.000039498736,0.000018886969,0.000112726404,0.00051479763,0.18069431,0.000009090628,0.0711993,0.00023080558,0.7470804],"study_design_scores_gemma":[0.00026557012,0.0004782138,0.0000765597,0.00055893377,0.000012982111,0.000106485546,1.7634427e-7,0.86001873,0.000055047978,0.12635468,0.011108033,0.0009646048],"about_ca_topic_score_codex":0.000045593093,"about_ca_topic_score_gemma":0.00010040049,"teacher_disagreement_score":0.7461158,"about_ca_system_score_codex":0.0002938732,"about_ca_system_score_gemma":0.0004468872,"threshold_uncertainty_score":0.9999272},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021477681,0.0002601848,0.991582,0.00058066985,0.00089655904,0.00035110305,0.0000025282513,0.00013911365,0.00616639],"genre_scores_gemma":[0.24144754,0.00011058608,0.7561806,0.0011452471,0.00027640708,0.000009402884,0.0000049468968,0.00004189094,0.00078337814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965634,0.000054175103,0.0005961274,0.0011267717,0.0010512904,0.0006082312],"domain_scores_gemma":[0.9971739,0.0004710505,0.0003667929,0.0014182667,0.00038428995,0.00018566998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012041724,0.00038882555,0.00060802593,0.000935401,0.00017670395,0.00029071036,0.0031753047,0.00025105706,0.000040483486],"category_scores_gemma":[0.00015308546,0.0003563156,0.00013191038,0.00069632713,0.0006734808,0.00033943926,0.0012352337,0.0006207191,0.00003433125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003869992,0.000028706902,0.000035247704,0.00010368364,0.000013936554,0.000027185017,0.0010908257,0.14292656,0.0002990625,0.09647718,0.000036407357,0.7589573],"study_design_scores_gemma":[0.0003542537,0.0001940161,0.000028742617,0.00045749827,0.000004364325,0.000031447187,8.515741e-8,0.94421124,0.001025605,0.051946335,0.0012874953,0.00045893335],"about_ca_topic_score_codex":0.000021852647,"about_ca_topic_score_gemma":0.00005192633,"teacher_disagreement_score":0.8012847,"about_ca_system_score_codex":0.0001925795,"about_ca_system_score_gemma":0.00067913265,"threshold_uncertainty_score":0.9998889},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016285747,0.00010581978,0.993372,0.00020215102,0.0003162185,0.0004732051,0.0000053237095,0.00004504816,0.0038516177],"genre_scores_gemma":[0.9690047,0.000015387286,0.029915666,0.0007480803,0.00018920323,0.000012408699,0.0000017941026,0.000031716056,0.00008103167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964144,0.00008949515,0.000555962,0.00127195,0.00092120597,0.0007469671],"domain_scores_gemma":[0.99635935,0.0012210571,0.00036664758,0.0018040455,0.00012754998,0.00012135564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011112811,0.00054368353,0.0006726307,0.0004192856,0.00013907046,0.00024630784,0.0033795037,0.00023998479,0.0000059388262],"category_scores_gemma":[0.00012373095,0.0003644602,0.00022925863,0.00075598276,0.0006000392,0.00028576743,0.00084310374,0.0011729252,0.000009126808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006477661,0.000044017972,0.000025462115,0.000009995999,0.000008446257,0.000034435914,0.0008303373,0.89248943,0.000027262582,0.07079957,0.000050593975,0.035673987],"study_design_scores_gemma":[0.00016971993,0.00015462177,0.000089503796,0.00027686008,0.000003937005,0.000022281965,6.4587304e-8,0.7387649,0.00006103537,0.26017827,0.0000044111775,0.00027439636],"about_ca_topic_score_codex":0.00008730434,"about_ca_topic_score_gemma":0.00006156229,"teacher_disagreement_score":0.9673761,"about_ca_system_score_codex":0.00041276668,"about_ca_system_score_gemma":0.0004715446,"threshold_uncertainty_score":0.99988073},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031191015,0.0003941156,0.9951375,0.00012685177,0.002611828,0.001150648,0.000015394835,0.00026728777,0.0002651961],"genre_scores_gemma":[0.009015994,0.000014381668,0.98964375,0.0002917611,0.0006504745,0.00002255725,0.000014631945,0.00005225964,0.00029419732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941644,0.00008550591,0.0008513133,0.0017795855,0.0019766726,0.0011425326],"domain_scores_gemma":[0.9964167,0.0002812234,0.00037838303,0.0015542825,0.000761947,0.0006074931],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015680189,0.0006724665,0.0007232863,0.0018187815,0.0004496652,0.0010237162,0.003120528,0.00035928548,0.00003495155],"category_scores_gemma":[0.00021590342,0.0005978914,0.00017153486,0.0012388291,0.00026897073,0.0010285589,0.0021987418,0.00076925446,0.00015797133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003232807,0.00004532117,0.00003313223,0.00007007461,0.00001815979,0.00006648402,0.0011131532,0.20614497,0.00008560678,0.0030468102,0.0000065426143,0.7893665],"study_design_scores_gemma":[0.0003436573,0.00006108809,0.00014473619,0.0003873328,0.000013004014,0.00012997315,7.9934085e-7,0.99723756,0.00022974392,0.0003946255,0.00037673878,0.0006807235],"about_ca_topic_score_codex":0.00017954728,"about_ca_topic_score_gemma":0.000027302702,"teacher_disagreement_score":0.79109263,"about_ca_system_score_codex":0.0013956575,"about_ca_system_score_gemma":0.0003974414,"threshold_uncertainty_score":0.99964726},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014810162,0.0012115085,0.9907939,0.000119070435,0.0062528565,0.00083644997,0.0000064658193,0.00023933138,0.0003923561],"genre_scores_gemma":[0.3541705,0.00028676115,0.6405757,0.0012585073,0.0031702137,0.0001491893,0.000014502457,0.000080398524,0.00029424735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996428,0.00003653243,0.00053507404,0.0013040665,0.00088864245,0.0008076477],"domain_scores_gemma":[0.9975571,0.00048977643,0.0003510273,0.0011074672,0.00027071833,0.00022388874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001302195,0.0004938291,0.0004596482,0.0012579266,0.0004868733,0.0005199576,0.002117301,0.00054597453,0.000026946707],"category_scores_gemma":[0.00009834184,0.00047931913,0.00021744243,0.0011006899,0.00032505018,0.0010800546,0.0008674958,0.0008171346,0.000039904233],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007900591,0.000039055132,0.000012416321,0.000024082115,0.00000538554,0.000006275899,0.00015410004,0.00053135236,0.00040348637,0.0084267575,0.0000181257,0.99037105],"study_design_scores_gemma":[0.0008932112,0.0013870748,0.00031124603,0.00029914983,0.00008144362,0.00026926547,2.2104724e-7,0.7375458,0.015894309,0.17422357,0.06704614,0.0020485467],"about_ca_topic_score_codex":0.000024963807,"about_ca_topic_score_gemma":0.0001635882,"teacher_disagreement_score":0.9883225,"about_ca_system_score_codex":0.00041060688,"about_ca_system_score_gemma":0.00013614961,"threshold_uncertainty_score":0.9997659},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042372465,0.00028827315,0.99609417,0.00078038004,0.00028282142,0.000523202,0.000017393155,0.00023265507,0.0013573677],"genre_scores_gemma":[0.13843815,0.00020539381,0.8595048,0.0004197124,0.00030775426,0.000025290341,0.00004228947,0.00003567623,0.0010208935],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9964806,0.000052395575,0.00073945563,0.0011430938,0.0010976382,0.00048683563],"domain_scores_gemma":[0.9965123,0.00018144898,0.00048163315,0.0012519353,0.0014258599,0.0001468555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007533789,0.0004386107,0.00051756745,0.0005842378,0.00018226702,0.0010031218,0.0028363136,0.0002445294,0.000057384095],"category_scores_gemma":[0.0001417191,0.00035961095,0.00016962385,0.00070715667,0.001424984,0.003313063,0.0010025213,0.00069378497,0.00004962157],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011711496,0.00018603532,0.00012416493,0.00018234394,0.000017661501,0.00004187927,0.0015974622,0.00030940777,0.037721388,0.06298597,0.000060892675,0.89676106],"study_design_scores_gemma":[0.001117905,0.00093520863,0.0019682606,0.0020034236,0.00004407328,0.00012696127,0.000003775557,0.2702349,0.3813626,0.33651534,0.0029712354,0.0027163224],"about_ca_topic_score_codex":0.0000588918,"about_ca_topic_score_gemma":0.00001391108,"teacher_disagreement_score":0.89404476,"about_ca_system_score_codex":0.00024413799,"about_ca_system_score_gemma":0.0003979731,"threshold_uncertainty_score":0.99988556},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053843285,0.0011535847,0.98959446,0.005637535,0.0010897672,0.0016799672,0.00006729514,0.000106182204,0.0001327511],"genre_scores_gemma":[0.1264091,0.00028179298,0.8680603,0.0040658177,0.00075560616,0.00014505308,0.00013541723,0.00011466149,0.000032259813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950153,0.000046481095,0.0007307354,0.0022136788,0.00088225974,0.0011115306],"domain_scores_gemma":[0.99275476,0.003996968,0.00038261944,0.0023065738,0.0002723988,0.0002867038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001499445,0.0006485328,0.001061611,0.0019510953,0.00026760923,0.00028792818,0.0016516222,0.00026408007,0.000016922191],"category_scores_gemma":[0.00048122002,0.0005721021,0.00013178478,0.0010794868,0.0010305102,0.0003237389,0.0010243348,0.00090214744,0.000009558949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062728686,0.00010782203,0.009393248,0.00029497556,0.000042769814,0.00012587028,0.00023512088,0.07443916,0.000012363471,0.00013153553,0.0007095745,0.9144448],"study_design_scores_gemma":[0.002077203,0.0004376649,0.0016655037,0.004313516,0.0001526549,0.00016688685,4.6218952e-7,0.9819464,0.00032476272,0.0036389022,0.0044551473,0.0008209154],"about_ca_topic_score_codex":0.00027263112,"about_ca_topic_score_gemma":0.00045394246,"teacher_disagreement_score":0.9136239,"about_ca_system_score_codex":0.0008072765,"about_ca_system_score_gemma":0.00072722783,"threshold_uncertainty_score":0.99967307},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006607052,0.0003118771,0.13312161,0.0015452262,0.0015707655,0.0007080674,0.0000013943892,0.00008172366,0.8560523],"genre_scores_gemma":[0.93944216,0.000044889388,0.03724425,0.0037495336,0.0011610249,0.000027592921,0.0000054569637,0.00004854926,0.018276565],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99697894,0.000035521134,0.00041890258,0.0007595918,0.0010391999,0.00076785946],"domain_scores_gemma":[0.99880785,0.00043995,0.00012762606,0.00036393962,0.00008620339,0.00017442924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013119065,0.00030843314,0.0003189136,0.00040720523,0.00031348044,0.0005334152,0.0014326563,0.00020387539,0.00004056423],"category_scores_gemma":[0.00011265121,0.00023936995,0.00007174409,0.00054927875,0.0006799967,0.00025255795,0.0004756892,0.00048810185,0.000116808405],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047466465,0.00002070799,0.00061640807,0.00001100308,0.0000039158144,0.000029079938,0.026096834,0.01870012,0.000017207849,0.005401963,0.00005894472,0.94903904],"study_design_scores_gemma":[0.00027544828,0.00006816715,0.0024884357,0.0010078781,0.000008423916,0.000006182144,0.00005577318,0.00559135,0.0004879224,0.048496224,0.94041884,0.0010953636],"about_ca_topic_score_codex":0.00051024935,"about_ca_topic_score_gemma":0.012570781,"teacher_disagreement_score":0.9479437,"about_ca_system_score_codex":0.00046455927,"about_ca_system_score_gemma":0.00070255296,"threshold_uncertainty_score":0.9761223},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20717852,0.0000040827767,0.79230016,0.000069967886,0.00009411525,0.00022512066,0.000005734399,0.000025409772,0.00009688864],"genre_scores_gemma":[0.59539133,2.8065315e-7,0.40440324,0.0001481501,0.00004224712,0.000007439499,7.8759416e-7,0.000004230756,0.000002297511],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99912035,0.000014255715,0.00017286187,0.0003010085,0.0001606289,0.00023086651],"domain_scores_gemma":[0.9994581,0.0000463355,0.0000694621,0.00028949283,0.00006683962,0.00006981173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021311904,0.00009821396,0.00011989259,0.0001347167,0.00005052554,0.000029743895,0.00036473596,0.000017213319,0.00003288792],"category_scores_gemma":[0.000016623662,0.00008728726,0.000020991698,0.0005905118,0.00010399782,0.00020122553,0.000054191016,0.0000796082,0.0000030967192],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053519347,0.00014618233,0.18388487,0.0000120736495,0.000009763346,0.0000037276452,0.010226414,0.0114597,0.15100978,0.0015036705,0.0000943717,0.6415959],"study_design_scores_gemma":[0.00021660735,0.0005217203,0.036837604,0.00008779703,0.0000025595111,0.000010085537,0.0000037485343,0.0072541973,0.9166788,0.037796088,0.00024356473,0.00034726958],"about_ca_topic_score_codex":0.00020213999,"about_ca_topic_score_gemma":0.000016467284,"teacher_disagreement_score":0.765669,"about_ca_system_score_codex":0.000032186526,"about_ca_system_score_gemma":0.000055297693,"threshold_uncertainty_score":0.35594714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014455921,0.00007438807,0.99666995,0.00025498267,0.0015130378,0.00090176804,0.000035026864,0.0001937535,0.00034261425],"genre_scores_gemma":[0.05642306,0.000005715434,0.9423057,0.0002820291,0.0006526429,0.000029820538,0.00006863422,0.00006910368,0.00016329094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949025,0.000039929473,0.0005341734,0.0023222244,0.0012606061,0.0009405772],"domain_scores_gemma":[0.9953642,0.0007982156,0.00039662875,0.0028384353,0.00038447868,0.00021803888],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009571521,0.00058414676,0.0005385902,0.00077109225,0.0003767873,0.00053320423,0.0058411197,0.00028504507,0.000017702243],"category_scores_gemma":[0.00018792851,0.0005243631,0.00007370915,0.00039557938,0.00061380817,0.0009863043,0.0031429909,0.0006999583,0.000014024739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000651276,0.000021224807,0.00004705937,0.000063771266,0.000011685264,0.000055972498,0.00032112034,0.19256912,0.00004072905,0.00042774173,0.000005124939,0.80637133],"study_design_scores_gemma":[0.0007822499,0.0005384857,0.00007147305,0.0004788101,0.000011269582,0.000044626828,1.3904625e-7,0.9897507,0.00048086158,0.0063927136,0.0008163249,0.00063234894],"about_ca_topic_score_codex":0.00017022435,"about_ca_topic_score_gemma":0.0008332422,"teacher_disagreement_score":0.805739,"about_ca_system_score_codex":0.0003636481,"about_ca_system_score_gemma":0.0010041095,"threshold_uncertainty_score":0.9997208},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017978256,0.00026038126,0.97720397,0.000602344,0.00078027544,0.00062662293,0.0000040089976,0.00081148476,0.01969291],"genre_scores_gemma":[0.039645433,0.000060026618,0.9544599,0.0009910415,0.00034278884,0.000052964228,0.000019830388,0.00004694071,0.0043810746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634707,0.00005005287,0.00059206167,0.0015997351,0.00075397856,0.0006570877],"domain_scores_gemma":[0.99669415,0.00036812475,0.00036506262,0.001913378,0.0004645775,0.00019468537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007149192,0.0004963373,0.00046131673,0.0008596164,0.0004268008,0.0008915283,0.0037577024,0.00033855168,0.00011340264],"category_scores_gemma":[0.00012522144,0.00046370318,0.00013123242,0.0008589694,0.00045904168,0.0006913745,0.0012621838,0.00076367497,0.00037631654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018619305,0.00005029634,0.00006479463,0.000036373014,0.00001330567,0.000027979886,0.00053442735,0.0564099,0.00007436256,0.03453318,0.0017695088,0.906484],"study_design_scores_gemma":[0.000117744305,0.000101972684,0.0002217583,0.0001860363,0.0000050228055,0.000045788936,5.9414877e-8,0.87077534,0.0019064497,0.121409245,0.0045412094,0.00068935053],"about_ca_topic_score_codex":0.00003701949,"about_ca_topic_score_gemma":0.000029728906,"teacher_disagreement_score":0.9057947,"about_ca_system_score_codex":0.00028104798,"about_ca_system_score_gemma":0.00044820443,"threshold_uncertainty_score":0.9997815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047829785,0.0019379059,0.9944523,0.00008340598,0.000649061,0.0016993015,0.000098531986,0.000098040495,0.0005031633],"genre_scores_gemma":[0.9793651,0.0000071723484,0.019673904,0.00009787072,0.0006860985,0.000051289415,0.0000065869817,0.00007790117,0.000034084915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722224,0.00003067219,0.0008691693,0.0005687657,0.00081823394,0.00049092533],"domain_scores_gemma":[0.99761283,0.00041278143,0.00040423317,0.00083746936,0.00054280885,0.00018985833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006310289,0.00050889235,0.0012437378,0.00052646385,0.000039327155,0.00004215733,0.0008441987,0.0003145381,0.000003855308],"category_scores_gemma":[0.000035542827,0.00041058447,0.0001141389,0.0003127152,0.0002848658,0.0001494439,0.00006764857,0.00042655756,0.000019438048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101122925,0.000030027155,0.00016428098,0.0003100705,0.000114064846,0.000007390711,0.00032314577,0.9538553,0.01237292,0.00070261664,0.0000036104425,0.03201546],"study_design_scores_gemma":[0.0013562918,0.00023339185,0.00011446903,0.0007339339,0.00006185274,0.000024627541,7.640431e-7,0.9927983,0.0014242326,0.00006942327,0.0027367754,0.00044589973],"about_ca_topic_score_codex":0.000045725727,"about_ca_topic_score_gemma":0.00006730003,"teacher_disagreement_score":0.9788868,"about_ca_system_score_codex":0.00022918421,"about_ca_system_score_gemma":0.00015825061,"threshold_uncertainty_score":0.9998346},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028836061,0.0026371572,0.9760527,0.013803896,0.0009586639,0.0023197602,0.000007011137,0.00017762493,0.0011595795],"genre_scores_gemma":[0.88087225,0.0001803398,0.11464119,0.0025917147,0.001320348,0.00010200975,0.000026570746,0.000052237647,0.00021333277],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975729,0.000009777284,0.00044487376,0.00076695177,0.0006059159,0.00059956283],"domain_scores_gemma":[0.99858624,0.00008261081,0.0001572102,0.00067628775,0.00014197658,0.0003556846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004543556,0.00029946954,0.00035787257,0.00140546,0.00011844293,0.00002404781,0.0003138282,0.00015345133,0.00010634957],"category_scores_gemma":[0.00008142187,0.00026885237,0.000055893277,0.00043348962,0.00025107127,0.00012257577,0.00030873087,0.0004286322,0.00006551827],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026936628,0.00003382171,0.0004569167,0.00055765663,0.000009866425,0.00003531123,0.0002321082,0.00018269576,0.000073085845,0.0034483606,0.000021031414,0.9949222],"study_design_scores_gemma":[0.021017184,0.025905773,0.20260774,0.018788401,0.0019194758,0.00048124598,0.000048835907,0.06309193,0.0038083275,0.34210747,0.31228867,0.007934951],"about_ca_topic_score_codex":0.000012278195,"about_ca_topic_score_gemma":0.00005647863,"teacher_disagreement_score":0.98698723,"about_ca_system_score_codex":0.0008577556,"about_ca_system_score_gemma":0.0003688143,"threshold_uncertainty_score":0.9999764},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01725946,0.00049272546,0.9750752,0.0008795013,0.0035864627,0.00035371384,0.00002353697,0.00011679945,0.0022126362],"genre_scores_gemma":[0.77076244,0.000019547657,0.22216804,0.0019093205,0.0011128498,0.000005460562,0.000011188336,0.00009000569,0.0039211214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9916853,0.00013758075,0.0013735042,0.0023926678,0.0031863076,0.0012246697],"domain_scores_gemma":[0.9938343,0.0022854859,0.0008272791,0.0019641344,0.0005865093,0.0005022828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0049010287,0.00073382014,0.0010378925,0.0016736436,0.0010211833,0.0009098904,0.0035248655,0.0005043264,0.00022420038],"category_scores_gemma":[0.0025511717,0.00060385675,0.0004461705,0.00092086714,0.001362955,0.0003343532,0.0016291598,0.0010159943,0.0005296284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026780193,0.000035707657,0.0023563185,0.000019138375,0.000041728883,0.00006889031,0.00078475784,0.8708227,0.00054809055,0.0006150006,0.00024938313,0.12443147],"study_design_scores_gemma":[0.00038925535,0.00006727486,0.00020023758,0.00046107997,0.000042353364,0.000114941635,5.759868e-7,0.966269,0.0005557084,0.021922532,0.009181884,0.00079511735],"about_ca_topic_score_codex":0.0009327439,"about_ca_topic_score_gemma":0.0026700792,"teacher_disagreement_score":0.753503,"about_ca_system_score_codex":0.0010549127,"about_ca_system_score_gemma":0.0010347714,"threshold_uncertainty_score":0.9996413},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012838111,0.00027374396,0.98887086,0.00013531321,0.0015243231,0.00062672334,0.000020234578,0.00026566384,0.008270323],"genre_scores_gemma":[0.018761743,0.000022544758,0.9787966,0.00041632392,0.0008124002,0.000009883528,0.00006892429,0.00009274346,0.0010188548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785703,0.0000060769917,0.0005003475,0.00071077084,0.0004496182,0.00047614225],"domain_scores_gemma":[0.9987152,0.00038313307,0.00010271108,0.0004928241,0.00015748349,0.000148648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009074321,0.000360426,0.00033073666,0.00038757277,0.00011542087,0.00013390247,0.0004878213,0.00032149127,0.000022354614],"category_scores_gemma":[0.000087226865,0.00034420693,0.00009614081,0.0002671332,0.00017843227,0.00014583071,0.00011978435,0.00048509118,0.000011712332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009365594,0.000004549213,0.000005707104,0.00008250506,0.000005972916,0.0000017556694,0.00022028277,0.80655664,0.00003536206,0.0005871156,0.00012692103,0.19236383],"study_design_scores_gemma":[0.00062582875,0.000079412275,0.000019769857,0.00047666632,0.000008200876,0.0000137459,4.9249785e-8,0.92269546,0.0008186977,0.06201823,0.012674454,0.0005694939],"about_ca_topic_score_codex":0.000009103145,"about_ca_topic_score_gemma":0.000077639685,"teacher_disagreement_score":0.19179434,"about_ca_system_score_codex":0.00021640913,"about_ca_system_score_gemma":0.00019512005,"threshold_uncertainty_score":0.999901},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026020487,0.000058802514,0.99540603,0.00029724007,0.00047502897,0.00033042717,0.0000017402726,0.00017541787,0.00065327616],"genre_scores_gemma":[0.6213084,0.0000023948608,0.37762675,0.0006755998,0.00029114474,0.0000028417523,0.000008956012,0.000022303087,0.00006161963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602604,0.00005894237,0.0005897441,0.0016022222,0.0011067191,0.00061636005],"domain_scores_gemma":[0.99797297,0.00013775895,0.00053953985,0.00083031785,0.00034453446,0.00017490957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010096594,0.0005581528,0.0007094055,0.0012656902,0.0004436806,0.0009672834,0.001448662,0.00026870958,0.00002106874],"category_scores_gemma":[0.000035083944,0.00046488643,0.00015910142,0.0015288633,0.0007098,0.0007305578,0.0006801893,0.00058738736,0.0000072882103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000910439,0.000020616268,0.0005097925,0.000104686354,0.000086392916,0.00005846777,0.0010967762,0.41376135,0.0006059183,0.0010128936,0.0000022621077,0.5827317],"study_design_scores_gemma":[0.00026391094,0.00013438438,0.00015635758,0.0005167429,0.000083495346,0.00008762442,6.215866e-7,0.9946797,0.0007772527,0.0026380515,0.00004571768,0.0006161727],"about_ca_topic_score_codex":0.00003568449,"about_ca_topic_score_gemma":0.00009570066,"teacher_disagreement_score":0.61870635,"about_ca_system_score_codex":0.000356662,"about_ca_system_score_gemma":0.0006836172,"threshold_uncertainty_score":0.9997803},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004446964,0.0015900951,0.9918196,0.0003216452,0.00070404535,0.00039758426,0.000002799898,0.00008634599,0.0006309289],"genre_scores_gemma":[0.93583846,0.00064323476,0.06261108,0.000611875,0.00017530446,0.000020654752,0.000007229432,0.00001812721,0.000074008465],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973995,0.00008063237,0.00050258514,0.0011564287,0.00038935908,0.00047151462],"domain_scores_gemma":[0.99792796,0.0007345853,0.0002926032,0.0007013979,0.00024114818,0.00010229086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012846689,0.00039979393,0.00045779545,0.0006780904,0.00017831875,0.00038259398,0.0009358023,0.00016937948,0.000008418461],"category_scores_gemma":[0.00013673671,0.00033523678,0.000049494007,0.00042644338,0.0008019177,0.000370857,0.00076839986,0.0004034411,0.000014351944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006784168,0.000018556806,0.0005977491,0.00016631294,0.00001652125,0.000480212,0.01374618,0.0036158187,0.00004294984,0.22206153,0.000020508363,0.75922686],"study_design_scores_gemma":[0.00066571595,0.00040775817,0.00059460686,0.00035326267,0.000016301412,0.0007922219,0.000013503177,0.26722038,0.00045094168,0.7275726,0.0010769083,0.0008358145],"about_ca_topic_score_codex":0.000035276033,"about_ca_topic_score_gemma":0.00048928556,"teacher_disagreement_score":0.93139154,"about_ca_system_score_codex":0.00023266155,"about_ca_system_score_gemma":0.00016577211,"threshold_uncertainty_score":0.99990994},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006064182,0.00025834082,0.993331,0.0023413799,0.0010330651,0.0011606696,0.000011948697,0.00021956388,0.0010376268],"genre_scores_gemma":[0.654352,0.000036116697,0.3394358,0.0053592725,0.0002513004,0.000044702938,0.0000041411395,0.00006651399,0.00045012712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950807,0.00009670534,0.0006154314,0.0023081552,0.0010678327,0.0008311725],"domain_scores_gemma":[0.9967668,0.00067187136,0.00022987812,0.0018691289,0.00019803233,0.0002642961],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010161031,0.0007704918,0.0006658086,0.00093366357,0.0003296624,0.0010061053,0.0033663488,0.0004495848,0.000098545264],"category_scores_gemma":[0.00011498481,0.0006959327,0.00012506095,0.0005868828,0.00078731595,0.0007155417,0.00086049235,0.0013178191,0.00010643648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007064866,0.00009263383,0.00007406345,0.00007959483,0.0000133486,0.00006787355,0.0006505389,0.16918054,0.0000707588,0.0046885875,0.000059128834,0.8249523],"study_design_scores_gemma":[0.0005252211,0.000617509,0.00030283837,0.0010098793,0.000008379751,0.000040321116,1.0554987e-7,0.9552915,0.0028507556,0.03428581,0.004149216,0.0009184406],"about_ca_topic_score_codex":0.000055545468,"about_ca_topic_score_gemma":0.00008208448,"teacher_disagreement_score":0.82403386,"about_ca_system_score_codex":0.00033421945,"about_ca_system_score_gemma":0.0004905067,"threshold_uncertainty_score":0.9995492},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003336296,0.00073760044,0.997619,0.00033669817,0.00036639578,0.0002837787,0.0000015131186,0.00021010544,0.000111286536],"genre_scores_gemma":[0.5672033,0.00008266473,0.43108344,0.0008744123,0.00051554834,0.000008949116,0.000017636134,0.000036603313,0.00017749661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754876,0.000056339242,0.0003247835,0.00088702916,0.0007637069,0.00041939312],"domain_scores_gemma":[0.99871427,0.0003042479,0.00030780598,0.00033985512,0.00020404425,0.00012975391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060134346,0.00037675732,0.0003121325,0.0005940162,0.00035908556,0.0004936039,0.00077613635,0.00027025313,0.0000125382585],"category_scores_gemma":[0.000051283307,0.0003366546,0.000076975615,0.00035021632,0.00056186656,0.0005932752,0.00038654928,0.0006310318,0.00000663265],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013707941,0.000032203694,0.0003878222,0.0000490197,0.000008998373,0.000014296584,0.0004434822,0.0019403071,0.0062268763,0.0013613997,0.000005882016,0.989516],"study_design_scores_gemma":[0.00035750633,0.00040641453,0.0017430856,0.00038126338,0.000020501124,0.00015082805,6.8645943e-7,0.9017756,0.07865701,0.014854494,0.0007201836,0.0009324114],"about_ca_topic_score_codex":0.0000627617,"about_ca_topic_score_gemma":0.000017446424,"teacher_disagreement_score":0.98858356,"about_ca_system_score_codex":0.00022128219,"about_ca_system_score_gemma":0.00037221098,"threshold_uncertainty_score":0.99990857},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009947761,0.0006064195,0.99375975,0.0004610279,0.0022404955,0.0003400761,0.000008877332,0.0001107994,0.0014777713],"genre_scores_gemma":[0.10856062,0.00011743769,0.8880528,0.00083306374,0.0011424234,0.000011330084,0.000026757814,0.000039107155,0.0012164279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963738,0.000047110054,0.0006098991,0.0014965234,0.00092489074,0.0005478127],"domain_scores_gemma":[0.99808675,0.00037863574,0.00033007606,0.0006542331,0.00036739965,0.00018290522],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009499509,0.00048631427,0.00047041764,0.00091500476,0.0005111043,0.0011192323,0.0011491332,0.00023273539,0.000018691788],"category_scores_gemma":[0.00013040965,0.00047415466,0.0000921041,0.000638117,0.00033822158,0.0012289799,0.0010693142,0.00054070255,0.000036554287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010946225,0.00001843542,0.000025923964,0.000049598082,0.000025269517,0.00006929609,0.00095570646,0.14106356,0.0009499525,0.02220759,0.0001407082,0.834483],"study_design_scores_gemma":[0.00031610136,0.00008313024,0.00014408307,0.00034417218,0.000008919819,0.00022083653,4.745155e-7,0.95814985,0.0007694908,0.03515107,0.004179157,0.00063269614],"about_ca_topic_score_codex":0.000015230263,"about_ca_topic_score_gemma":0.000014261629,"teacher_disagreement_score":0.8338503,"about_ca_system_score_codex":0.00022100894,"about_ca_system_score_gemma":0.00053656433,"threshold_uncertainty_score":0.9999177},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3266326,0.000042055126,0.67294604,0.00013184598,0.00016578412,0.000062837986,6.496129e-7,0.000016693055,0.0000015061187],"genre_scores_gemma":[0.8282297,0.000012578859,0.17164622,0.000051346746,0.000048763894,0.0000055970418,0.000003166491,0.0000024111482,1.6593901e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995307,0.00000659264,0.00011771515,0.00012005468,0.000115340416,0.00010965129],"domain_scores_gemma":[0.9997912,0.000040129788,0.000023099974,0.00006298318,0.00004499676,0.000037564856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110645946,0.00005234044,0.00007833125,0.00010254801,0.000033543176,0.00003528788,0.000063894266,0.000015917753,0.000007688815],"category_scores_gemma":[0.000018837294,0.000045414505,0.000015549247,0.00021895449,0.00008924033,0.00015066798,0.000012372179,0.000049533213,8.478912e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026194068,0.000028676353,0.0036299296,0.00008748334,0.0000051983425,5.5022963e-7,0.00022171375,0.08489684,0.11275894,0.000074226264,0.000010451182,0.7982834],"study_design_scores_gemma":[0.00015448547,0.000056784666,0.006837217,0.000043950025,0.0000038662106,0.000003852511,0.000001713413,0.9637221,0.027752008,0.0013676875,0.00000906169,0.00004725344],"about_ca_topic_score_codex":0.000032189473,"about_ca_topic_score_gemma":0.0000060284297,"teacher_disagreement_score":0.8788253,"about_ca_system_score_codex":0.000029791803,"about_ca_system_score_gemma":0.0000063680486,"threshold_uncertainty_score":0.18519498},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020529602,0.00068503123,0.956971,0.0010826366,0.005649189,0.00089539343,0.0000032135672,0.00018501426,0.03247557],"genre_scores_gemma":[0.96274424,0.000023231276,0.028567681,0.00084713765,0.0063228565,0.000011151877,0.000051327497,0.000067349996,0.0013650027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789566,0.000007838314,0.00030972462,0.00066002173,0.00067020097,0.00045653447],"domain_scores_gemma":[0.9990715,0.00003964515,0.0003169587,0.00041522787,0.00012834847,0.000028353634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052058155,0.00035275446,0.00025630623,0.0011002508,0.00037015005,0.00047614198,0.0004273163,0.00023792227,0.00012653468],"category_scores_gemma":[0.00001850814,0.00033836658,0.000098723365,0.0006149137,0.00024285802,0.0013449413,0.00035157253,0.0005062344,0.0002848554],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004808754,0.00007255917,0.0021684049,0.00028523145,0.000042160602,0.000043075048,0.00036634176,0.025184402,0.00038299733,0.052854396,0.0005377985,0.9180145],"study_design_scores_gemma":[0.0037755782,0.00007918268,0.015705433,0.0030083277,0.0012882465,0.00026843356,0.00002185764,0.42915112,0.0016948414,0.347337,0.19118169,0.0064882655],"about_ca_topic_score_codex":0.000055820863,"about_ca_topic_score_gemma":0.000028243261,"teacher_disagreement_score":0.9606913,"about_ca_system_score_codex":0.0002949599,"about_ca_system_score_gemma":0.000040926247,"threshold_uncertainty_score":0.99990684},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025300633,0.00004510989,0.9941994,0.002004568,0.0011645348,0.00046685492,0.000014667862,0.00029790774,0.0017816796],"genre_scores_gemma":[0.12861583,0.000017381397,0.8674688,0.0024577524,0.0005052108,0.000040596766,0.00015748468,0.00006143552,0.0006755192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953778,0.00007122497,0.000607664,0.0021413087,0.0012198786,0.0005821399],"domain_scores_gemma":[0.99589103,0.00034153266,0.00047317529,0.0028312926,0.00022398021,0.00023895832],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011443238,0.00055480836,0.00043055063,0.0010228731,0.000365141,0.0013162531,0.0036351632,0.00034816194,0.00006431312],"category_scores_gemma":[0.00010181685,0.0005103011,0.00009603176,0.0006877392,0.00038637914,0.0011193008,0.0003695456,0.00090658484,0.00023090499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019792847,0.00009077233,0.000028412447,0.000019085242,0.0000038728167,0.0000065338504,0.000116561714,0.047672406,0.000244175,0.014074122,0.000025282457,0.9377168],"study_design_scores_gemma":[0.0002537471,0.00019123226,0.0022844917,0.00016219956,0.000006565843,0.000021591724,5.9232278e-8,0.98113066,0.00035563856,0.012185269,0.0028256588,0.00058288453],"about_ca_topic_score_codex":0.0000715507,"about_ca_topic_score_gemma":0.000017207107,"teacher_disagreement_score":0.9371339,"about_ca_system_score_codex":0.00022317487,"about_ca_system_score_gemma":0.000489414,"threshold_uncertainty_score":0.9997349},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009843569,0.00034597574,0.987517,0.00057622755,0.00084613287,0.00022337756,0.0000012519721,0.0002984301,0.01009318],"genre_scores_gemma":[0.35143283,0.00005701074,0.64273775,0.0011543253,0.0015375039,0.000015037481,0.000010535605,0.00009244082,0.0029625474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963511,0.000067432,0.00031265983,0.0013584448,0.0010316377,0.00087868475],"domain_scores_gemma":[0.9977588,0.00045575562,0.0003161264,0.0010120841,0.000202185,0.0002550505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079228514,0.0005710108,0.0005108838,0.00063718844,0.00041227465,0.00045767069,0.0025109174,0.00025745438,0.00006797024],"category_scores_gemma":[0.000082394996,0.00044455176,0.00010227864,0.00056878896,0.00054683094,0.0006961042,0.0010552118,0.0020380998,0.00008491072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006919458,0.000017643399,0.00014463217,0.000015731877,0.000012764933,0.000053826283,0.0010221383,0.051211935,0.000017197199,0.007721059,0.0000040336063,0.9397721],"study_design_scores_gemma":[0.0006293107,0.00066078064,0.00071819016,0.0005880306,0.000020649477,0.00032233307,6.9089583e-7,0.94341785,0.0007832125,0.033511396,0.017736148,0.0016113832],"about_ca_topic_score_codex":0.00006091527,"about_ca_topic_score_gemma":0.00004008501,"teacher_disagreement_score":0.9381607,"about_ca_system_score_codex":0.00024383776,"about_ca_system_score_gemma":0.00039558907,"threshold_uncertainty_score":0.9998006},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002934885,0.00082652544,0.96730995,0.00028394855,0.0012598885,0.0003177663,0.000009152606,0.00023730654,0.029461974],"genre_scores_gemma":[0.4570172,0.00012662173,0.5406415,0.00045599826,0.00038956298,0.0000066939037,0.000008631011,0.00006470806,0.0012891178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540925,0.00012888115,0.0009586881,0.0016373016,0.0010431827,0.00082268973],"domain_scores_gemma":[0.9962893,0.0008175256,0.0008346699,0.0014532651,0.00036086503,0.00024438798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015024517,0.0006995015,0.0010404522,0.0010488206,0.0003449076,0.00032017968,0.0036391593,0.00036786444,0.000087245025],"category_scores_gemma":[0.0001976354,0.00061997026,0.000233011,0.0006069605,0.0014421906,0.00043212943,0.0016409896,0.0015572573,0.000043575055],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015885396,0.00005184024,0.0005077555,0.00007256658,0.000035920442,0.00013354326,0.0016326936,0.019468768,0.0011259742,0.054487407,0.000014469171,0.92245317],"study_design_scores_gemma":[0.0008982445,0.0012789079,0.0003939264,0.0018346098,0.000042116524,0.00038031646,0.0000013888991,0.8154383,0.008593015,0.16648813,0.002639892,0.0020111846],"about_ca_topic_score_codex":0.00018008648,"about_ca_topic_score_gemma":0.00003825689,"teacher_disagreement_score":0.920442,"about_ca_system_score_codex":0.00016369569,"about_ca_system_score_gemma":0.00064821803,"threshold_uncertainty_score":0.99962515},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025541402,0.0011507828,0.9920049,0.00044550662,0.0028362582,0.0003586589,0.0000034713187,0.00022487226,0.0027201844],"genre_scores_gemma":[0.19126683,0.000035118115,0.8056622,0.0015534129,0.0011650783,0.000004215409,0.0000026337511,0.000046243083,0.0002642289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952985,0.0000484951,0.0006359269,0.0017256016,0.0012052429,0.0010862063],"domain_scores_gemma":[0.9966301,0.00033349788,0.00033136143,0.00218886,0.00021108342,0.00030513544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012826578,0.0006215673,0.0006361182,0.00068796205,0.00035468492,0.0006391721,0.004218102,0.00048710484,0.000042142463],"category_scores_gemma":[0.00009020306,0.00058799936,0.00018856178,0.00060681504,0.0005199625,0.0010755161,0.0022606608,0.0011459698,0.00006597276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002479947,0.00003371794,0.00011858075,0.000035081226,0.000009878052,0.000045363086,0.0006571984,0.045442227,0.0002413942,0.02214083,0.000009215502,0.93126404],"study_design_scores_gemma":[0.00020061387,0.000049465136,0.00004758022,0.00022806799,0.000011521,0.00009870289,1.008408e-7,0.9005431,0.00086831494,0.09468456,0.0025297753,0.000738204],"about_ca_topic_score_codex":0.000074947435,"about_ca_topic_score_gemma":0.00004831786,"teacher_disagreement_score":0.93052584,"about_ca_system_score_codex":0.00051447615,"about_ca_system_score_gemma":0.0006103607,"threshold_uncertainty_score":0.99965715},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035504682,0.002425439,0.9847165,0.00015887586,0.001301255,0.0003657181,0.000012658539,0.0007334306,0.009931104],"genre_scores_gemma":[0.8642474,0.00080869393,0.13299821,0.00069835765,0.00085509336,0.000036285357,0.000033158776,0.00013378613,0.00018901039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980177,0.000016332766,0.00037209672,0.0004696973,0.0005983035,0.0005258704],"domain_scores_gemma":[0.9981269,0.00019012854,0.00009526157,0.0013394152,0.00010067091,0.00014761322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005021917,0.00042898417,0.00039196594,0.0005631329,0.00009510216,0.00023580807,0.001673493,0.0003640816,0.00014214056],"category_scores_gemma":[0.00002354754,0.0004400803,0.00008412277,0.0002655925,0.00033443293,0.0004331247,0.0006773009,0.0009154404,0.000047700614],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005882256,0.000053971282,0.00013782285,0.00026192676,0.000047559108,0.000026888725,0.0046940898,0.10889188,0.0013256186,0.022798488,0.00082510454,0.86093074],"study_design_scores_gemma":[0.00043682702,0.00012884945,0.00029309973,0.0015346579,0.000033549608,0.000067168796,5.026876e-7,0.6895444,0.02845406,0.10019284,0.1765957,0.0027183783],"about_ca_topic_score_codex":0.00001814564,"about_ca_topic_score_gemma":0.000036985304,"teacher_disagreement_score":0.8638924,"about_ca_system_score_codex":0.00039959454,"about_ca_system_score_gemma":0.00007200356,"threshold_uncertainty_score":0.9998051},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11871069,0.0000094920015,0.8807323,0.00011814015,0.0001867335,0.0001028329,3.8750474e-7,0.00009029533,0.000049138896],"genre_scores_gemma":[0.85876316,0.0000014886989,0.1409136,0.00024724047,0.000050036946,0.000015354013,0.0000024013943,0.0000062395843,4.452668e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991844,0.000015493093,0.00014065245,0.0002630241,0.00020732278,0.00018904956],"domain_scores_gemma":[0.999634,0.00002707171,0.000024570265,0.00019412496,0.000033237888,0.00008696303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017554112,0.00009963558,0.00009866395,0.00024819304,0.00004948045,0.00006789066,0.00023632482,0.000023023407,0.000016866303],"category_scores_gemma":[0.000019416068,0.00007598085,0.000021554397,0.0009885104,0.000067834095,0.00028844492,0.000042434538,0.00013003386,0.000016861084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065004956,0.000045793946,0.007265614,0.000027666165,0.00001475511,0.0000067599262,0.0061632837,0.22283657,0.012438038,0.000023280669,0.000019837891,0.7511519],"study_design_scores_gemma":[0.00011818263,0.000051548614,0.0056950664,0.00007973589,0.000007706871,0.000009884175,0.000007773078,0.94690734,0.046508648,0.00047167073,0.0000074371724,0.0001350119],"about_ca_topic_score_codex":0.00013787851,"about_ca_topic_score_gemma":0.00013151363,"teacher_disagreement_score":0.7510169,"about_ca_system_score_codex":0.00007161092,"about_ca_system_score_gemma":0.00001710703,"threshold_uncertainty_score":0.30984092},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018215798,0.0009380267,0.9799815,0.0001635911,0.00015940312,0.00034831293,0.00006570297,0.000010718482,0.000116952484],"genre_scores_gemma":[0.98673606,0.00021846769,0.011412493,0.00013876794,0.00015887932,0.000017787943,0.001100913,0.000009273199,0.00020738432],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985049,0.000021071015,0.00021489481,0.0009072843,0.00019285263,0.00015904031],"domain_scores_gemma":[0.9990308,0.000039777413,0.00012158679,0.0006593777,0.000083734245,0.00006467493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017306792,0.00017517044,0.00019150744,0.00029141916,0.00006765199,0.000052687832,0.0005404499,0.00025439484,0.00005394555],"category_scores_gemma":[0.000043165954,0.00014478028,0.000029703411,0.00030468346,0.00014301116,0.000013130641,0.00052225526,0.00014634787,0.000007783499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009836427,0.00027379006,0.015562339,0.00010057941,0.0002894929,0.00000941729,0.00033033654,0.128539,0.48264596,0.010498929,0.00066275883,0.36098903],"study_design_scores_gemma":[0.002116203,0.0006246097,0.07619769,0.00026628733,0.00032106452,0.000021634769,0.0000044816607,0.76153713,0.07362427,0.03373331,0.048453186,0.003100127],"about_ca_topic_score_codex":0.000016051796,"about_ca_topic_score_gemma":0.000050633094,"teacher_disagreement_score":0.968569,"about_ca_system_score_codex":0.000033806642,"about_ca_system_score_gemma":0.000112698064,"threshold_uncertainty_score":0.5903969},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000039194383,0.001233657,0.9899263,0.0012307271,0.003562279,0.00045495704,0.000016507445,0.00020261017,0.0033690773],"genre_scores_gemma":[0.00162339,0.00034329298,0.99243176,0.0015270712,0.0011472566,0.00003054643,0.000013875433,0.00005562025,0.0028271892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533784,0.00004892023,0.0005876523,0.0016692363,0.0014289563,0.000927415],"domain_scores_gemma":[0.99555933,0.00076053373,0.0003480459,0.0027387317,0.0003363519,0.000256994],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010204508,0.0006180476,0.00047448726,0.00038688502,0.0010552757,0.0017807191,0.007591217,0.00032275167,0.000040460407],"category_scores_gemma":[0.000066784414,0.00039765515,0.00015239684,0.0005275745,0.0011363468,0.0010400201,0.0036337948,0.001072981,0.00033795668],"study_design_candidate":"design_other","study_design_consensus":null,"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.933921e-7,0.000011701399,0.000003469521,0.0000056579156,0.000006950424,0.000037594717,0.00011969941,0.00094135967,0.000018952298,0.015490065,0.00044713687,0.9829164],"study_design_scores_gemma":[0.00016305414,0.00010189165,0.000061972976,0.00017070178,0.0000043987498,0.00007671955,1.0964412e-7,0.74690133,0.00025255748,0.19956064,0.052163735,0.0005428887],"about_ca_topic_score_codex":0.00007542991,"about_ca_topic_score_gemma":0.00006711125,"teacher_disagreement_score":0.98237354,"about_ca_system_score_codex":0.00020979074,"about_ca_system_score_gemma":0.00045303194,"threshold_uncertainty_score":0.99984753},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033597182,0.0016482751,0.9623209,0.00004629163,0.00065510336,0.0007960587,0.000038182647,0.00006999674,0.00082797406],"genre_scores_gemma":[0.9706491,0.0012281353,0.027301125,0.00034231436,0.00018042998,0.000036929883,0.00001688431,0.000084663436,0.00016042295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846935,0.000012767557,0.00044070507,0.0005158151,0.0002802944,0.00028105566],"domain_scores_gemma":[0.9991918,0.00022609544,0.00010027987,0.0002724384,0.00013778609,0.000071559916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031869928,0.00035866874,0.0004641414,0.0002829775,0.000103662554,0.00010396346,0.00027313601,0.00017294005,0.000037095604],"category_scores_gemma":[0.00002414027,0.00030744987,0.0000597629,0.00018657926,0.0006349547,0.00025642713,0.000055999066,0.00038145075,0.0000016514344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048514528,0.000041385454,0.000028109836,0.0002599348,0.00009510647,0.000027834554,0.0012801731,0.2162476,0.21360445,0.0019487325,0.000117481446,0.565864],"study_design_scores_gemma":[0.0011176588,0.0006363169,0.000070441165,0.00041755172,0.000019170355,0.000074434894,7.0062174e-7,0.81906027,0.15860207,0.016558453,0.0028659014,0.00057705346],"about_ca_topic_score_codex":0.000040528168,"about_ca_topic_score_gemma":0.0002871694,"teacher_disagreement_score":0.9370519,"about_ca_system_score_codex":0.0001628668,"about_ca_system_score_gemma":0.00011287161,"threshold_uncertainty_score":0.9999378},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029167116,0.0003246991,0.9951596,0.0005434122,0.0002836406,0.00051986653,0.0000011514504,0.000040060513,0.00021080839],"genre_scores_gemma":[0.13922629,0.000039598835,0.86050576,0.000043249078,0.0000649805,0.000029344177,0.0000024083772,0.000009693789,0.00007867267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979673,0.000025773466,0.00044874084,0.0008758806,0.0003974692,0.00028486215],"domain_scores_gemma":[0.9985741,0.00019942639,0.00020542578,0.00068778964,0.00025772201,0.00007553316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051305187,0.00022480472,0.000294755,0.00043081597,0.0000961811,0.0001121481,0.0010956448,0.00017421978,0.000009965806],"category_scores_gemma":[0.000042132895,0.00021549537,0.0000422967,0.00055604224,0.0004988768,0.00041807574,0.00059740635,0.000346863,0.0000032853077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.852456e-7,0.000058735957,0.0003284545,0.000048300477,0.0000021314406,0.000003416952,0.00024596814,0.07446441,0.000035000907,0.010516202,0.0000023181274,0.9142943],"study_design_scores_gemma":[0.00013237719,0.000070912305,0.0042485977,0.00013782835,0.0000019739841,0.000015293266,1.6271895e-7,0.9061731,0.00008046228,0.088839464,0.00009041426,0.00020941772],"about_ca_topic_score_codex":0.000056191795,"about_ca_topic_score_gemma":0.000055178487,"teacher_disagreement_score":0.91408485,"about_ca_system_score_codex":0.00014096806,"about_ca_system_score_gemma":0.00021670246,"threshold_uncertainty_score":0.8787646},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008801028,0.0021568849,0.9820972,0.001584959,0.00080260506,0.00050145335,0.0000032342343,0.00017202506,0.012672858],"genre_scores_gemma":[0.6580184,0.0010598849,0.33796155,0.0018229688,0.0003336306,0.000036644647,0.00001282642,0.000038549773,0.0007155551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755424,0.000069079484,0.00041285699,0.0009255456,0.0005106403,0.0005276374],"domain_scores_gemma":[0.99585974,0.0006903819,0.00023571689,0.0028711688,0.00017238918,0.00017061736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000990618,0.00038624072,0.00042137317,0.00021351755,0.0005046187,0.0005958005,0.004921642,0.00022832323,0.000010382266],"category_scores_gemma":[0.000013388408,0.0002740736,0.00007635209,0.0003936522,0.001868855,0.00028416805,0.002511702,0.00086118735,0.000020546619],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018712204,0.000024828285,0.0001657612,0.00001070253,0.000008779037,0.000023181712,0.00038685594,0.00030317128,8.4244135e-7,0.03618997,0.000040467898,0.9628436],"study_design_scores_gemma":[0.0001346064,0.00016189562,0.00026001866,0.00011794704,0.000006771642,0.00014049331,1.4043677e-7,0.88053274,0.0000023731038,0.112162925,0.0060778353,0.00040227227],"about_ca_topic_score_codex":0.00003712127,"about_ca_topic_score_gemma":0.00017285146,"teacher_disagreement_score":0.9624413,"about_ca_system_score_codex":0.00006341195,"about_ca_system_score_gemma":0.000347264,"threshold_uncertainty_score":0.99997115},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030322935,0.0002283526,0.98927385,0.0002449407,0.0014679348,0.00060909457,0.0000045452007,0.0003091384,0.007859126],"genre_scores_gemma":[0.0046478645,0.000006458213,0.9920589,0.0026898,0.0003367393,0.000011870379,0.000008858194,0.000045079734,0.00019447131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945074,0.00004161943,0.000611417,0.0021491207,0.0017026502,0.0009878146],"domain_scores_gemma":[0.99670243,0.0004779704,0.0003022684,0.0017935351,0.00035646043,0.00036730783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018233247,0.0006140079,0.00060220616,0.0031455455,0.00026057486,0.0006007338,0.0042794375,0.00040736326,0.000007163673],"category_scores_gemma":[0.00025853742,0.0005974027,0.00012520765,0.0037084636,0.0003136162,0.00048412918,0.00091718696,0.0008753503,0.00007238889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040595073,0.00003218782,0.000013254712,0.000020689935,0.0000032072394,0.000045566543,0.00016194372,0.7792092,0.0000028682032,0.00094410114,0.000019668725,0.21954326],"study_design_scores_gemma":[0.00024183915,0.00016919692,0.00017139598,0.00027695677,0.0000050042636,0.000048337224,6.558753e-8,0.99612796,0.000114784656,0.0018240274,0.00033231554,0.0006881028],"about_ca_topic_score_codex":0.000016575586,"about_ca_topic_score_gemma":0.0000013417456,"teacher_disagreement_score":0.21885517,"about_ca_system_score_codex":0.00047291513,"about_ca_system_score_gemma":0.0005894957,"threshold_uncertainty_score":0.99964774},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011823001,0.0005186897,0.9860924,0.000018684163,0.00094178395,0.00025428028,0.0000038402263,0.00005540214,0.0002919345],"genre_scores_gemma":[0.50966096,0.00010338388,0.49007925,0.000065186556,0.00006051601,0.000002659663,0.0000013653171,0.000014401358,0.0000122512665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978005,0.00007245183,0.0004115681,0.0009600303,0.00042915897,0.00032627585],"domain_scores_gemma":[0.9986109,0.00019198065,0.00033490686,0.0005265763,0.00022510393,0.000110548055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010516844,0.0003059542,0.0004043662,0.0006406562,0.0001550457,0.00010668261,0.00054175104,0.00020930624,0.000002417615],"category_scores_gemma":[0.000052656378,0.00029254964,0.00006253437,0.00035801023,0.00047039436,0.00058758946,0.0005286354,0.00033849257,7.76468e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009717434,0.000015443105,0.00013815412,0.00004545732,0.000008840506,0.000009312488,0.0007232917,0.00038955323,0.00024179915,0.0004608008,1.6345535e-7,0.99795747],"study_design_scores_gemma":[0.0003095073,0.00024377844,0.00092791475,0.00047880205,0.000018016533,0.00011525249,2.624379e-7,0.6303776,0.0021298577,0.36490738,0.000037486152,0.00045411664],"about_ca_topic_score_codex":0.00017211189,"about_ca_topic_score_gemma":0.000092932,"teacher_disagreement_score":0.99750334,"about_ca_system_score_codex":0.00012822825,"about_ca_system_score_gemma":0.00010969397,"threshold_uncertainty_score":0.9999527},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017353539,0.00079253747,0.98497635,0.00074651645,0.0024383971,0.00035707973,0.000008723241,0.00023567455,0.010427346],"genre_scores_gemma":[0.010046979,0.00012720985,0.9847518,0.001952232,0.0009524112,0.000022129503,0.000012470897,0.000048127866,0.0020866466],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610835,0.000029911014,0.00047719822,0.0016164349,0.0010665555,0.0007015577],"domain_scores_gemma":[0.9969098,0.00029685948,0.0002629193,0.0020608292,0.00024112649,0.00022846862],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051561504,0.00056711584,0.0005432768,0.0005892623,0.00032049583,0.00097322435,0.0044836914,0.00032914517,0.00015606731],"category_scores_gemma":[0.00005546055,0.00046172726,0.00012801244,0.00042831732,0.0006896952,0.0015007159,0.0018260418,0.000777848,0.0003900403],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028000286,0.000022788292,0.00002669828,0.00002941485,0.000007888472,0.000061640065,0.00048990705,0.0014509016,0.00022497977,0.034078483,0.000422073,0.96318245],"study_design_scores_gemma":[0.00061353255,0.00034211238,0.0003957868,0.0010090214,0.000012570261,0.00018446732,2.8624302e-7,0.4179733,0.0032655161,0.49599805,0.078016564,0.0021887855],"about_ca_topic_score_codex":0.00006684425,"about_ca_topic_score_gemma":0.000030079862,"teacher_disagreement_score":0.96099365,"about_ca_system_score_codex":0.00017647608,"about_ca_system_score_gemma":0.00039046365,"threshold_uncertainty_score":0.99978346},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073991823,0.00020177546,0.99001056,0.0004320612,0.00095170963,0.000559537,0.0000051072193,0.0004201679,0.000019927966],"genre_scores_gemma":[0.48084533,0.0000033338047,0.5181256,0.00095015694,0.00004855037,0.000013022211,0.0000074591458,0.0000061401743,4.091988e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653554,0.00017596874,0.0004583205,0.00078383763,0.0012610127,0.00078529655],"domain_scores_gemma":[0.9980686,0.00053026446,0.00021768153,0.0006062269,0.00027929948,0.0002979648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013612523,0.00028683667,0.00024200967,0.00021832658,0.00029727665,0.0005343021,0.0014291949,0.00010744429,0.000043505865],"category_scores_gemma":[0.00037934506,0.00026435102,0.000048309656,0.0024145711,0.00035075907,0.00095613353,0.00037209492,0.00021165337,0.000014268002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027896967,0.00012650507,0.0029721307,0.000014090631,0.0000025503314,0.0000036913154,0.00050082325,0.9584964,0.0057924706,0.000009520189,0.000052337757,0.032026708],"study_design_scores_gemma":[0.00035738212,0.00008268527,0.0004422424,0.000048685524,0.0000041147177,0.000013251737,0.0000018880505,0.953161,0.04556286,0.000045455454,0.0000028370525,0.00027757828],"about_ca_topic_score_codex":0.00011473065,"about_ca_topic_score_gemma":0.000008924583,"teacher_disagreement_score":0.47344616,"about_ca_system_score_codex":0.0005831063,"about_ca_system_score_gemma":0.00024344002,"threshold_uncertainty_score":0.99998087},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030007117,0.00025532153,0.9982947,0.00007684723,0.0005510297,0.00028627986,0.000058114554,0.000030785097,0.000146868],"genre_scores_gemma":[0.20378894,0.000043710737,0.79437137,0.0009050847,0.00035062447,0.000011830183,0.0003882025,0.000038337515,0.00010191453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966741,0.000035842175,0.000628768,0.0015287459,0.000579326,0.00055317325],"domain_scores_gemma":[0.9979082,0.00021653408,0.00036735015,0.0012664148,0.00012925413,0.00011226094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000951416,0.00040252937,0.00066429074,0.0025897936,0.00017581353,0.00042005884,0.0021985644,0.00021981822,0.000050507744],"category_scores_gemma":[0.000036697977,0.00038241353,0.0002857213,0.0016328319,0.00020466092,0.0005027515,0.0007911707,0.0002922586,0.000012990349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017451592,0.000104787556,0.00090797176,0.000045951263,0.00034982414,0.00010011603,0.0015107834,0.5278345,0.00020546287,0.0061353566,0.000047740148,0.4627401],"study_design_scores_gemma":[0.00020264846,0.000067147455,0.00011205638,0.000095970776,0.00010038785,0.000013657594,1.4202718e-7,0.9796585,0.00046001765,0.018226376,0.00061435654,0.00044875132],"about_ca_topic_score_codex":0.0000952077,"about_ca_topic_score_gemma":0.00029017884,"teacher_disagreement_score":0.46229136,"about_ca_system_score_codex":0.00022557189,"about_ca_system_score_gemma":0.00018784293,"threshold_uncertainty_score":0.9998628},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4461074,0.00003169805,0.55299175,0.00034484643,0.00037859348,0.000089637986,3.0172882e-7,0.000044447064,0.000011381115],"genre_scores_gemma":[0.73199326,0.000001772075,0.26770616,0.00024748113,0.000043775242,0.0000033253168,1.3773119e-7,0.0000036137737,5.0125755e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806464,0.0000979767,0.00029878152,0.00055635086,0.00047240147,0.0005098806],"domain_scores_gemma":[0.9986332,0.0004620442,0.00008902319,0.0005939882,0.00009737396,0.00012438555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068180705,0.00016664845,0.00023488444,0.0002554106,0.00016349634,0.00027097293,0.0019208943,0.000054190863,0.000023982506],"category_scores_gemma":[0.00007241254,0.00013275597,0.00006072725,0.0015530849,0.0005894588,0.00086820277,0.00050151284,0.00029922227,0.00002760984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011193295,0.00040956592,0.019629013,0.00006588752,0.000018577732,0.00007057465,0.007856832,0.1523804,0.11609113,0.064956464,0.000008988801,0.63850135],"study_design_scores_gemma":[0.00015027774,0.00012519075,0.037537143,0.000037005495,0.0000011782477,0.00003201019,0.0000012599644,0.6626872,0.037887584,0.26136634,9.639342e-7,0.00017384908],"about_ca_topic_score_codex":0.000072365576,"about_ca_topic_score_gemma":0.000011199145,"teacher_disagreement_score":0.63832754,"about_ca_system_score_codex":0.000029897301,"about_ca_system_score_gemma":0.000084495376,"threshold_uncertainty_score":0.5413632},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005155811,0.00024696442,0.98889524,0.0057773283,0.0023016322,0.00087742653,0.0000058912906,0.00019242891,0.0016515108],"genre_scores_gemma":[0.048726205,0.000025824585,0.94595623,0.0027529923,0.000524352,0.0000414688,0.000010919912,0.000036841833,0.0019251416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646646,0.00001982525,0.0003526791,0.0016487074,0.00085933006,0.0006530259],"domain_scores_gemma":[0.9971388,0.0004193147,0.00027400837,0.001491228,0.0005163072,0.00016032052],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007559934,0.00047392683,0.00046027024,0.000510775,0.00029110454,0.0006749394,0.0033821706,0.00043538032,0.0000130253975],"category_scores_gemma":[0.00015241514,0.00044223285,0.00015023146,0.00034394948,0.00033183795,0.00087587914,0.001050261,0.0007675416,0.000036444148],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034884804,0.000034573473,0.000047980677,0.00008988624,0.000010505824,0.000014160176,0.0004333978,0.01693307,0.00017488729,0.13832533,0.00040157523,0.84353113],"study_design_scores_gemma":[0.00022747529,0.00008315284,0.00005354434,0.00016448856,0.0000044287467,0.000021686315,7.252755e-8,0.7138977,0.000493884,0.28159577,0.0030521867,0.00040557553],"about_ca_topic_score_codex":0.000017130846,"about_ca_topic_score_gemma":0.000031851818,"teacher_disagreement_score":0.8431256,"about_ca_system_score_codex":0.00030807348,"about_ca_system_score_gemma":0.000388948,"threshold_uncertainty_score":0.99980295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010140494,0.00017695989,0.9929288,0.00015699078,0.0036610533,0.0011208369,0.000016406408,0.00019348068,0.0007314184],"genre_scores_gemma":[0.10959661,0.000016743912,0.88954586,0.00017206781,0.0005053684,0.000064880536,0.000029324514,0.000033042314,0.000036109468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961462,0.00008779414,0.0006747828,0.0015151793,0.0008834104,0.00069261395],"domain_scores_gemma":[0.9965821,0.00045039048,0.0005597267,0.0017941111,0.0003699622,0.00024374666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017982064,0.00048318066,0.00047237167,0.0008907237,0.00036348077,0.0004911877,0.002211155,0.00034050734,0.0000060048046],"category_scores_gemma":[0.00024466822,0.0004511355,0.00018168414,0.0006395966,0.00087816187,0.0012111187,0.00053593284,0.0004550929,0.000014143038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021895863,0.000039801565,0.0001577343,0.000043203898,0.000007887309,0.0000022730123,0.0010149734,0.026979363,0.00024089168,0.17857882,0.0000083911855,0.79290473],"study_design_scores_gemma":[0.00039239816,0.00029552478,0.0010801646,0.00013323901,0.000018360295,0.00008203325,0.0000012505045,0.8549647,0.00496617,0.13682626,0.0006311835,0.00060873985],"about_ca_topic_score_codex":0.000020578394,"about_ca_topic_score_gemma":0.00006536188,"teacher_disagreement_score":0.8279853,"about_ca_system_score_codex":0.0003515579,"about_ca_system_score_gemma":0.00024717173,"threshold_uncertainty_score":0.99979407},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010784343,0.0010217292,0.9842016,0.0010154955,0.0014598783,0.0009752038,0.0000648295,0.00027548315,0.00020143922],"genre_scores_gemma":[0.63221425,0.00006069878,0.365529,0.001228233,0.00054137775,0.000046374265,0.000025962094,0.000057251094,0.00029687607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952429,0.000074040116,0.00069677754,0.0022036629,0.0011349274,0.0006477186],"domain_scores_gemma":[0.99417317,0.0010257158,0.00028657052,0.0039765406,0.00027987236,0.00025811256],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016301863,0.0005585029,0.00060657784,0.00032783888,0.00044784788,0.0009887607,0.0060222787,0.00030253836,0.000007419804],"category_scores_gemma":[0.00010467353,0.00035767115,0.00006779571,0.0004872644,0.00053833233,0.00051192276,0.00374125,0.00067538465,0.000094608935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013733346,0.000054498905,0.00010275252,0.00020097649,0.00003202173,0.0000317118,0.0054944763,0.6072431,0.00016974974,0.0040523177,0.00032128204,0.38228333],"study_design_scores_gemma":[0.00014435643,0.00005564299,0.00031758417,0.0005527116,0.000011106814,0.000031152405,0.0000021458557,0.99301744,0.00008261467,0.004691043,0.0006234185,0.00047076942],"about_ca_topic_score_codex":0.00044684,"about_ca_topic_score_gemma":0.000095598814,"teacher_disagreement_score":0.62142986,"about_ca_system_score_codex":0.00026459098,"about_ca_system_score_gemma":0.00046677387,"threshold_uncertainty_score":0.9998875},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036878284,0.00038353566,0.994591,0.0005153107,0.00077763887,0.00032661867,0.0000015108413,0.00013226853,0.0029033255],"genre_scores_gemma":[0.56081295,0.00014704774,0.43626937,0.001856208,0.00045099593,0.000030920295,0.0000038590083,0.00004420601,0.00038446957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970017,0.000015894097,0.00045127928,0.0012857006,0.00048479196,0.0007606531],"domain_scores_gemma":[0.99826765,0.0001576277,0.0001234008,0.0011907336,0.00011237594,0.0001482167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005379752,0.00038943155,0.00037971954,0.0010130858,0.00027129034,0.00020805903,0.002318483,0.00021525632,0.000012885287],"category_scores_gemma":[0.000017996863,0.00035533254,0.00009849081,0.0010486066,0.00020847855,0.00047582714,0.0015250371,0.00077166717,0.00004442209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018017474,0.000029623994,0.000018903087,0.000011536636,0.0000035918158,0.000059873393,0.0009524131,0.33798134,0.0000955139,0.16878197,0.000008111912,0.49205533],"study_design_scores_gemma":[0.0000864058,0.000029544435,0.000009189186,0.00024242858,0.0000022895983,0.000022701432,6.959543e-8,0.8319205,0.000104346225,0.16692096,0.00031314054,0.00034839872],"about_ca_topic_score_codex":0.000054267122,"about_ca_topic_score_gemma":0.00017079704,"teacher_disagreement_score":0.5604441,"about_ca_system_score_codex":0.00015724872,"about_ca_system_score_gemma":0.00020877698,"threshold_uncertainty_score":0.99988985},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014284082,0.00002853008,0.9834678,0.0005242366,0.00059399876,0.0008179791,4.002259e-7,0.0002796295,0.0000032988726],"genre_scores_gemma":[0.27736455,0.0000037499838,0.7216769,0.0008667752,0.000047577534,0.000029956787,0.0000020078564,0.000007630561,8.7606554e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974646,0.00011971842,0.00039899038,0.0007923862,0.0007325345,0.00049178785],"domain_scores_gemma":[0.9987142,0.00013346388,0.00018300026,0.0005199621,0.00029010553,0.00015923889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056081975,0.00020849307,0.00016863026,0.00046378627,0.0002506427,0.000649455,0.0008582577,0.00007227008,0.000018621526],"category_scores_gemma":[0.00012595158,0.00018377339,0.00003405855,0.0019162053,0.00033977535,0.0010688277,0.00047241765,0.0002010084,0.000018983648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.988491e-7,0.000058967053,0.00027832726,0.000007987379,0.0000012360467,0.000008467468,0.0010372984,0.77196795,0.008234228,0.000008435262,0.0000055511578,0.21839069],"study_design_scores_gemma":[0.00033047132,0.00006437828,0.0006220899,0.000053622764,0.0000018274972,0.000037670667,0.000001954472,0.94750464,0.050930455,0.00024821973,4.9752555e-7,0.00020417242],"about_ca_topic_score_codex":0.00012061869,"about_ca_topic_score_gemma":0.0000043391433,"teacher_disagreement_score":0.26308048,"about_ca_system_score_codex":0.00027534424,"about_ca_system_score_gemma":0.00018230958,"threshold_uncertainty_score":0.74940616},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045743036,0.0023122479,0.9943465,0.00087826565,0.000570249,0.0005884606,0.0000026652697,0.00017380032,0.0010820958],"genre_scores_gemma":[0.05614071,0.0011367222,0.94192815,0.00015585037,0.00017443094,0.00006220539,0.0000037684688,0.000051703213,0.00034643334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964182,0.00006655078,0.00061348506,0.0010441983,0.0011807439,0.0006768642],"domain_scores_gemma":[0.99677384,0.0011292404,0.00022138248,0.0014566106,0.00029571363,0.00012320677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003150043,0.0003627031,0.00055355293,0.0014264121,0.000068950525,0.00027709213,0.0035408572,0.00027656247,0.000029552706],"category_scores_gemma":[0.0005355153,0.00033835933,0.000091201044,0.0011562385,0.00026551654,0.00076554314,0.0016676749,0.0013608615,0.00003615542],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003979903,0.00006986684,0.00009117135,0.00054539205,0.00001594965,0.00009091455,0.0007466473,0.032591164,0.0002817827,0.08222326,0.00021230312,0.88312757],"study_design_scores_gemma":[0.00050521083,0.000815428,0.0006887194,0.008713349,0.000013467931,0.000107670196,3.141267e-7,0.6571381,0.0043758894,0.24216042,0.08372119,0.0017602358],"about_ca_topic_score_codex":0.000092489754,"about_ca_topic_score_gemma":0.000017653181,"teacher_disagreement_score":0.8813673,"about_ca_system_score_codex":0.00028645646,"about_ca_system_score_gemma":0.00035451623,"threshold_uncertainty_score":0.99990684},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020619252,0.0022605706,0.99440545,0.001115747,0.0010285155,0.0005170639,0.0000040128107,0.00007912986,0.0003833017],"genre_scores_gemma":[0.07344715,0.000127676,0.92414546,0.0015324166,0.00045771012,0.000016249012,0.000003048218,0.000034153854,0.00023616439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970727,0.000025434985,0.00048824187,0.0012190568,0.0004659331,0.0007286189],"domain_scores_gemma":[0.99825764,0.00037490766,0.00031381994,0.00079444936,0.000099077086,0.00016009713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007443047,0.000464044,0.00054457685,0.00067513477,0.00025428718,0.0003142352,0.0015199777,0.00024584355,0.0000073563365],"category_scores_gemma":[0.00010227541,0.00039526282,0.000077693185,0.00041444608,0.00045093935,0.0010892547,0.0011390534,0.00064162485,0.0000074524105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058808355,0.000017443848,0.0001803641,0.00009247823,0.0000024496017,0.000016224038,0.0008206362,0.001640769,0.0005681798,0.001214462,0.0000636658,0.9953774],"study_design_scores_gemma":[0.0005701401,0.000068616435,0.0018925432,0.0023163506,0.0000043786695,0.000089260546,5.99704e-7,0.9667637,0.0008548673,0.022706343,0.0040045343,0.0007286825],"about_ca_topic_score_codex":0.000009049445,"about_ca_topic_score_gemma":0.000023042883,"teacher_disagreement_score":0.99464875,"about_ca_system_score_codex":0.00022455744,"about_ca_system_score_gemma":0.00017276345,"threshold_uncertainty_score":0.9998499},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003666239,0.00038448113,0.9924676,0.0017212873,0.0030188197,0.0014214794,0.000004669532,0.00065237645,0.0002926313],"genre_scores_gemma":[0.009786543,0.000031202628,0.98560715,0.0029056354,0.0011433917,0.00025317672,0.000004896443,0.000050480172,0.00021749936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961079,0.000058070258,0.00043360557,0.0016689248,0.0008909735,0.00084052247],"domain_scores_gemma":[0.99678427,0.0007979522,0.00022015233,0.0016176143,0.00033035703,0.00024964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010145485,0.0006164028,0.0006214732,0.0010064675,0.00017938118,0.00037486342,0.0033849166,0.0003359025,0.000019242816],"category_scores_gemma":[0.0005158942,0.0005559347,0.0000982188,0.0008793891,0.0003037817,0.0013138902,0.0018562406,0.0007247412,0.0002011698],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021233247,0.000008368549,0.0000040022014,0.00004096865,0.0000041695776,0.000058139,0.0014846049,0.06088511,0.00007102735,0.008605151,0.000015224401,0.9288211],"study_design_scores_gemma":[0.00037175356,0.0006717154,0.0009778402,0.0012933462,0.000011828772,0.00019611136,4.6082832e-7,0.5269777,0.0023606406,0.45815992,0.006436698,0.0025419483],"about_ca_topic_score_codex":0.000064780776,"about_ca_topic_score_gemma":0.000043158605,"teacher_disagreement_score":0.9262792,"about_ca_system_score_codex":0.0005065146,"about_ca_system_score_gemma":0.00016593636,"threshold_uncertainty_score":0.9996892},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035894584,0.00021947794,0.9969552,0.001077714,0.0006822594,0.00034088685,0.0000033691408,0.00008151749,0.0006036887],"genre_scores_gemma":[0.15776208,0.000051031988,0.83579785,0.002928258,0.00046019343,0.000031991858,0.000032848326,0.000030160065,0.0029055877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965431,0.000026857926,0.00070545415,0.0014629076,0.0007562639,0.00050543476],"domain_scores_gemma":[0.9976389,0.00021172989,0.0004454864,0.0012327906,0.00033284255,0.00013824312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012817798,0.00041195258,0.00084314233,0.0015663911,0.00023972928,0.00055096287,0.0017716878,0.00021500456,0.000019862895],"category_scores_gemma":[0.00006521331,0.00036271344,0.0006748627,0.0008449305,0.00020083442,0.00028469154,0.00062725594,0.0003044675,0.000017375052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040716013,0.00002377193,0.000058210157,0.000041926167,0.00020930567,0.0000049861064,0.00056045875,0.42151096,0.00014082507,0.1131299,0.00004921983,0.46426636],"study_design_scores_gemma":[0.00021639433,0.00006665982,0.000057074387,0.000102811384,0.00012501961,0.000002533244,9.16816e-8,0.9236094,0.00025338356,0.07471162,0.00046849667,0.00038656092],"about_ca_topic_score_codex":0.000010143592,"about_ca_topic_score_gemma":0.000097701944,"teacher_disagreement_score":0.5020984,"about_ca_system_score_codex":0.00018393136,"about_ca_system_score_gemma":0.00017926363,"threshold_uncertainty_score":0.99988246},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016574452,0.00068730465,0.9916102,0.0033571308,0.0013992892,0.00086066587,0.000015544216,0.000043541706,0.0018605258],"genre_scores_gemma":[0.57835853,0.000013308987,0.4163493,0.0028738119,0.0005102272,0.00007161403,0.0000018486196,0.000037164664,0.0017842376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99520004,0.00004912268,0.0006739361,0.0013705068,0.0021063704,0.00060002157],"domain_scores_gemma":[0.99334216,0.004356149,0.00032354286,0.0011602148,0.0006034514,0.00021450735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048092585,0.00035860587,0.0004781196,0.0004909821,0.00069886394,0.00085161603,0.001745941,0.00018655545,0.000018673605],"category_scores_gemma":[0.0011916521,0.00021851764,0.00013915096,0.0004950613,0.0005234469,0.00016309237,0.00044003673,0.00041899615,0.000041572737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009158526,0.000009040705,0.000020567548,0.0000050589165,0.000008161191,0.0000012493911,0.0015038344,0.53157,0.000022250868,0.007241002,0.00017752564,0.4594321],"study_design_scores_gemma":[0.00014670115,0.00014972039,0.000029026629,0.00016496854,0.000016319666,0.000012441074,0.0000020825028,0.677664,0.00010167561,0.31233916,0.0091191735,0.0002547539],"about_ca_topic_score_codex":0.000034330988,"about_ca_topic_score_gemma":0.000110072826,"teacher_disagreement_score":0.5781928,"about_ca_system_score_codex":0.00032232143,"about_ca_system_score_gemma":0.00064783916,"threshold_uncertainty_score":0.8910891},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024630885,0.0038926348,0.9926162,0.0002653291,0.0016732729,0.00083690917,0.000003333082,0.0002950618,0.00039262333],"genre_scores_gemma":[0.18457323,0.00015429094,0.812402,0.0014494755,0.0010618034,0.000099089026,0.0000404514,0.000060967748,0.00015865703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706,0.000076243305,0.0005087788,0.0010692026,0.00053984753,0.00074592186],"domain_scores_gemma":[0.9968506,0.0007836648,0.00031336088,0.0015234528,0.00033226816,0.00019666372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012965599,0.00049283856,0.00047464058,0.0005359209,0.0005423188,0.00048556394,0.0025684703,0.0003340755,0.000025128826],"category_scores_gemma":[0.00004590631,0.00047587827,0.0001669907,0.0005274086,0.0003045644,0.0005269868,0.00088257674,0.0006991864,0.000016669732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002861055,0.00002230758,0.000023453782,0.000017031503,0.000005898132,0.0000060753987,0.00027822214,0.36462426,0.000113048285,0.0034928354,0.000026258549,0.6313877],"study_design_scores_gemma":[0.0002854914,0.00010781434,0.00003672444,0.000302169,0.000008577447,0.000009614569,1.5532449e-7,0.98850423,0.0011020508,0.0028780552,0.0062281075,0.00053702213],"about_ca_topic_score_codex":0.0000017081678,"about_ca_topic_score_gemma":0.000004491327,"teacher_disagreement_score":0.63085073,"about_ca_system_score_codex":0.0002866699,"about_ca_system_score_gemma":0.00023421306,"threshold_uncertainty_score":0.9997693},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014330565,0.0005033415,0.9902458,0.00037895498,0.0033339118,0.00036260928,0.000081715196,0.00036531905,0.004585027],"genre_scores_gemma":[0.83830124,0.0004907553,0.14163873,0.013022045,0.0019543811,0.00006597892,0.00019220145,0.00017358393,0.004161104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947581,0.00006161859,0.0006641813,0.0022516341,0.001244681,0.0010197714],"domain_scores_gemma":[0.9962276,0.0004762677,0.0003954507,0.002292824,0.00026626256,0.000341573],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008011015,0.0008148107,0.00072161405,0.0009826135,0.00039887198,0.00078164885,0.00603195,0.00039791467,0.00010391234],"category_scores_gemma":[0.00007277308,0.0007668129,0.00029113292,0.00048842345,0.00095468224,0.0009437244,0.0015736659,0.0013036565,0.00024485585],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028803785,0.00011379817,0.00025179246,0.00013278887,0.00005903209,0.0006520466,0.0025017858,0.005327009,0.00022435076,0.010962227,0.0021777442,0.9775686],"study_design_scores_gemma":[0.0019579832,0.0016487708,0.00033249197,0.0037715274,0.00009324516,0.00086432626,0.000002329874,0.79171497,0.004166937,0.15659603,0.032374702,0.00647672],"about_ca_topic_score_codex":0.00008947119,"about_ca_topic_score_gemma":0.00005657493,"teacher_disagreement_score":0.9710919,"about_ca_system_score_codex":0.00027052185,"about_ca_system_score_gemma":0.0006515127,"threshold_uncertainty_score":0.9994783},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011440941,0.0005571654,0.99611515,0.00023027555,0.00059942063,0.00027488507,0.000011971533,0.000069242975,0.0020274662],"genre_scores_gemma":[0.11851215,0.000478601,0.8783033,0.0011617622,0.00028704866,0.0000056016447,0.000027518785,0.000037627622,0.0011863722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964503,0.000021199057,0.0004898728,0.0013377708,0.0010359549,0.0006649188],"domain_scores_gemma":[0.9978167,0.00008768803,0.00030756192,0.0016276367,0.000043656957,0.000116789844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084248564,0.00042016938,0.00047020908,0.0009475478,0.00016579879,0.00026156264,0.004068093,0.00019714152,0.0000138473915],"category_scores_gemma":[0.000007268048,0.00040141793,0.00015371157,0.00052499684,0.00041139114,0.0008606985,0.0016818695,0.0005025432,0.00003494792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034164568,0.00010910523,0.00008301154,0.000037167374,0.000019113433,0.00006148501,0.00036445478,0.15224709,0.000054016436,0.0141423745,0.000016238828,0.83286256],"study_design_scores_gemma":[0.0002572253,0.0001360598,0.00012703994,0.00021110098,0.000011038651,0.000007786154,9.0057696e-8,0.89764386,0.00044614027,0.09730688,0.0033885909,0.0004641706],"about_ca_topic_score_codex":0.000008789661,"about_ca_topic_score_gemma":0.000011389588,"teacher_disagreement_score":0.83239836,"about_ca_system_score_codex":0.00008280773,"about_ca_system_score_gemma":0.00008788206,"threshold_uncertainty_score":0.9998438},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019492117,0.0013888587,0.9932719,0.000020299123,0.0019128297,0.0002852653,0.0000029527334,0.0001380147,0.0010306551],"genre_scores_gemma":[0.81199014,0.00041735603,0.1860298,0.00027405488,0.0009056381,0.000007977581,0.000014264014,0.00013887932,0.00022185878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764687,0.000012679246,0.00046408316,0.0006269765,0.00047775268,0.00077165815],"domain_scores_gemma":[0.9989224,0.00009131377,0.00008259907,0.0007219255,0.000052451127,0.00012930953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053112925,0.00045041778,0.0004499145,0.00040390727,0.00009263441,0.0001366855,0.00075034436,0.000347585,0.00007632961],"category_scores_gemma":[0.000008199342,0.00044176047,0.00006588124,0.0002865673,0.00019187872,0.00018811425,0.00029296285,0.0008038822,0.000025167701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002357117,0.000009725118,0.00008234366,0.000056003995,0.000006104766,0.00004636285,0.00015574605,0.9535111,0.00062647904,0.00019650851,0.000009578543,0.045297656],"study_design_scores_gemma":[0.00009990513,0.000016707232,0.000016764565,0.0005138109,0.000007874862,0.000019217145,2.0651852e-7,0.9939459,0.0037737368,0.00050724245,0.00059634703,0.0005022623],"about_ca_topic_score_codex":0.000056647354,"about_ca_topic_score_gemma":0.00004386125,"teacher_disagreement_score":0.81004095,"about_ca_system_score_codex":0.00044700282,"about_ca_system_score_gemma":0.00007357674,"threshold_uncertainty_score":0.9998034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011800407,0.00044966978,0.9918857,0.00025258985,0.0011453814,0.00027421874,0.000015582464,0.000139372,0.005719459],"genre_scores_gemma":[0.52751863,0.00023185498,0.47078452,0.00095234596,0.0001339679,0.0000067128844,0.000012647386,0.00003623388,0.0003230766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967443,0.000035032233,0.0006584238,0.0011999297,0.00081552897,0.0005468223],"domain_scores_gemma":[0.9977391,0.0003166416,0.00052456517,0.00097052293,0.00030011646,0.00014910415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061014143,0.0004530859,0.00050925923,0.00064686185,0.00022480285,0.00029242036,0.0021286663,0.00027451108,0.000118065866],"category_scores_gemma":[0.00009632752,0.00043525963,0.00012436367,0.000572926,0.0008800391,0.0010739677,0.0007936121,0.00055003865,0.000020563404],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005401781,0.0000209079,0.00041035502,0.000059768445,0.000014887474,0.000025859272,0.0018131103,0.008946307,0.0017606821,0.019362824,0.00006629613,0.9675136],"study_design_scores_gemma":[0.0006686467,0.0003229054,0.00048199162,0.0014621858,0.000025339337,0.00018098956,0.000002018674,0.8016391,0.009155203,0.18037543,0.0036945697,0.0019916608],"about_ca_topic_score_codex":0.00005989789,"about_ca_topic_score_gemma":0.00016890818,"teacher_disagreement_score":0.96552193,"about_ca_system_score_codex":0.00023662951,"about_ca_system_score_gemma":0.0005606828,"threshold_uncertainty_score":0.9998099},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024940195,0.0006315139,0.99229306,0.00037845637,0.0021088342,0.00026372168,0.0000044412664,0.00017301361,0.001652959],"genre_scores_gemma":[0.7434288,0.00015650684,0.24939173,0.0031684204,0.0032562434,0.000019541927,0.000080072394,0.00008708443,0.00041159912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950322,0.0002457522,0.00086179207,0.0014179118,0.0012353057,0.0012070654],"domain_scores_gemma":[0.9963752,0.0009541063,0.00072391966,0.0015057984,0.00023220188,0.00020879679],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023752935,0.0007294951,0.0008760582,0.0003406247,0.0015852428,0.0012701829,0.005058184,0.0004084129,0.000016903985],"category_scores_gemma":[0.00009252104,0.0007135417,0.00022851916,0.0010421432,0.00063667813,0.0008352557,0.0032177684,0.001512677,0.000028408365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016949685,0.000045980545,0.0025055883,0.000084535626,0.00007575013,0.0000114934555,0.0035685382,0.52618206,0.000105755666,0.022423947,0.0018283388,0.44315106],"study_design_scores_gemma":[0.00067023054,0.00041569263,0.0036486874,0.0024742465,0.000037819078,0.00003197954,0.000002466031,0.9165703,0.00020217578,0.061574783,0.011885545,0.0024860925],"about_ca_topic_score_codex":0.00008705944,"about_ca_topic_score_gemma":0.000101742,"teacher_disagreement_score":0.7429013,"about_ca_system_score_codex":0.00026406074,"about_ca_system_score_gemma":0.00027643482,"threshold_uncertainty_score":0.9997666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021681131,0.0001336356,0.99033624,0.001518214,0.0028724733,0.0008279654,0.0000036600763,0.00012241784,0.0039685983],"genre_scores_gemma":[0.56755006,0.00012820879,0.3439152,0.05622554,0.025806269,0.00008412876,0.0003244203,0.0003139712,0.005652192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737144,0.000007897273,0.00048307754,0.0011123561,0.00043649107,0.0005887328],"domain_scores_gemma":[0.99876696,0.00014649935,0.00022959638,0.0005837865,0.00023878578,0.000034351422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012323351,0.000463689,0.00044670564,0.00042535595,0.0004418765,0.00053761684,0.0006958538,0.0001980287,0.000033163138],"category_scores_gemma":[0.00011798939,0.00042302808,0.00010590154,0.00031549856,0.0003129868,0.0002582471,0.0005963207,0.00034025192,0.000034364944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025604446,0.000019451894,0.00007395807,0.0003525054,0.000017599294,0.000003520113,0.00007475687,0.0529674,0.000007533469,0.028501792,0.0010813951,0.91687447],"study_design_scores_gemma":[0.00036097295,0.000063468615,0.00020709974,0.0003549205,0.00002443148,0.0000011620572,4.342116e-7,0.9145038,0.0000061085843,0.02581587,0.058159936,0.00050176284],"about_ca_topic_score_codex":0.00011290457,"about_ca_topic_score_gemma":0.00016161373,"teacher_disagreement_score":0.9163727,"about_ca_system_score_codex":0.000088112676,"about_ca_system_score_gemma":0.000045662615,"threshold_uncertainty_score":0.99982214},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004428181,0.00015228384,0.9854384,0.0013924374,0.00085220154,0.0005904846,0.00000208079,0.000092014474,0.011037266],"genre_scores_gemma":[0.7558518,0.000002686387,0.24250616,0.0011627899,0.00030372856,0.000032644948,0.000010324818,0.000026581423,0.00010329365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946686,0.000116264135,0.0005977105,0.001416549,0.0027753508,0.0004255227],"domain_scores_gemma":[0.996661,0.00039302022,0.00071730977,0.0013368145,0.00076128804,0.00013057138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026963395,0.00044016098,0.00048207416,0.00075008,0.00018646583,0.00037959192,0.002143654,0.00034964227,0.00005947615],"category_scores_gemma":[0.0001891715,0.00037628028,0.00012878531,0.00064591254,0.0008412155,0.0004900482,0.00033157424,0.0006256249,0.00005750461],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030454494,0.000058132253,0.000009871333,0.000039589264,0.000006231468,0.000002108679,0.00019385887,0.0356669,0.0002026355,0.027526092,0.0000676902,0.93622386],"study_design_scores_gemma":[0.00029924331,0.00014065581,0.0003293736,0.00037727063,0.000022690541,0.0000044142944,1.5728544e-7,0.8839848,0.0019310785,0.1123271,0.00023119699,0.00035199773],"about_ca_topic_score_codex":0.000006243141,"about_ca_topic_score_gemma":0.000011613824,"teacher_disagreement_score":0.93587184,"about_ca_system_score_codex":0.00040736745,"about_ca_system_score_gemma":0.0015824075,"threshold_uncertainty_score":0.9998689},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041598352,0.0047505503,0.9906996,0.0005070011,0.0020347862,0.0011794048,0.000082003935,0.00011376491,0.00021692259],"genre_scores_gemma":[0.35856226,0.00006556844,0.6352232,0.0034102898,0.0022997533,0.00007299731,0.00008545768,0.00011293846,0.00016754311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640995,0.00007397528,0.00053562963,0.001471195,0.00074615725,0.0007631048],"domain_scores_gemma":[0.996986,0.00093871023,0.00041016005,0.0007825391,0.0005892174,0.00029341716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010849596,0.00064365263,0.00069612794,0.00084455847,0.00047018027,0.0008455407,0.0010565419,0.0006654237,0.00001699044],"category_scores_gemma":[0.00016718183,0.0005735075,0.00016186257,0.00048523152,0.0006104162,0.00062848895,0.00035282192,0.00078753533,0.000019661458],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031454416,0.000044224664,0.000072985735,0.00033646973,0.000025814054,0.000043746546,0.0008622924,0.0015272301,0.0011347847,0.00033564115,0.000044345812,0.99554104],"study_design_scores_gemma":[0.0040140855,0.0009055468,0.00038217442,0.005173716,0.00021419588,0.00092964264,0.0000015590178,0.8559612,0.007383827,0.10906306,0.011970644,0.0040003597],"about_ca_topic_score_codex":0.000020388332,"about_ca_topic_score_gemma":0.00006958242,"teacher_disagreement_score":0.9915407,"about_ca_system_score_codex":0.00022454157,"about_ca_system_score_gemma":0.0005152303,"threshold_uncertainty_score":0.99967164},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017303197,0.0025699886,0.9791568,0.00012229486,0.00024868042,0.00019903669,0.000036183133,0.000037740265,0.00032609887],"genre_scores_gemma":[0.8017877,0.000089117995,0.1979596,0.000065432534,0.000047464226,8.089926e-7,0.000004042204,0.000013312318,0.00003254635],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795574,0.00006221054,0.00051290024,0.00054480555,0.000616921,0.00030741806],"domain_scores_gemma":[0.9978699,0.00030617695,0.00054501876,0.0009821582,0.00021111997,0.000085609274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010898174,0.000270357,0.0005930581,0.00045370773,0.000048849946,0.00003643546,0.0014775674,0.00013388116,0.0000130105145],"category_scores_gemma":[0.000036433798,0.00023213746,0.00008148806,0.00032089726,0.0017239887,0.00033798494,0.0010106468,0.0002395877,9.3858927e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001245257,0.00007185826,0.0003992456,0.0005543495,0.000026089836,0.000013282863,0.0036075297,0.0015360418,0.0058388677,0.15119973,0.000006985501,0.8367336],"study_design_scores_gemma":[0.00066883536,0.0006602541,0.008246767,0.0020370972,0.000029171739,0.000061802,0.0000050606664,0.14876893,0.11160707,0.7266642,0.00034680028,0.0009040184],"about_ca_topic_score_codex":0.00008603225,"about_ca_topic_score_gemma":0.00003084263,"teacher_disagreement_score":0.83582956,"about_ca_system_score_codex":0.00003923326,"about_ca_system_score_gemma":0.00011933151,"threshold_uncertainty_score":0.9466291},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29642725,0.000009239165,0.69720054,0.0056662564,0.00009754925,0.0005304455,0.0000022394013,0.00006151016,0.00000493703],"genre_scores_gemma":[0.5303937,0.0000027249393,0.4690811,0.00043940192,0.0000357306,0.000038559225,0.0000048984066,0.00000345584,3.8280444e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915296,0.000008517394,0.00018882801,0.0002357347,0.00018635504,0.0002275815],"domain_scores_gemma":[0.99941,0.00010657975,0.00004116572,0.00022300005,0.000120661614,0.00009858962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016306527,0.00008727152,0.00013343216,0.00015456534,0.00019836093,0.00008070646,0.00015958637,0.000033418477,0.000029191147],"category_scores_gemma":[0.000067706475,0.00006974295,0.000039750157,0.0005333041,0.0005100511,0.00017450833,0.000028746023,0.00015170737,0.000004340573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013695918,0.00022499112,0.003584689,0.00020791363,0.000012959649,0.0000063881175,0.000752202,0.0064317696,0.21538253,0.001975543,0.00014721556,0.7712601],"study_design_scores_gemma":[0.0002715025,0.000051914845,0.0011790622,0.000079296005,0.000009963542,0.00022347871,0.0000011144975,0.97774416,0.0066712513,0.013618982,0.00007005086,0.00007922543],"about_ca_topic_score_codex":0.000053289383,"about_ca_topic_score_gemma":0.000006674294,"teacher_disagreement_score":0.9713124,"about_ca_system_score_codex":0.00008555991,"about_ca_system_score_gemma":0.00013620769,"threshold_uncertainty_score":0.28440347},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000079195735,0.0004924003,0.98976606,0.0005122919,0.00086463575,0.0007815641,0.000016223452,0.00012011387,0.0073674936],"genre_scores_gemma":[0.14123125,0.00002048219,0.85660934,0.0014516255,0.0003026654,0.0000328576,0.000010398839,0.0000340648,0.00030731366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941862,0.00018627993,0.0010936835,0.0018181463,0.001721825,0.0009938518],"domain_scores_gemma":[0.9957492,0.0004058975,0.000558175,0.0023907723,0.0004975912,0.0003983931],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002556602,0.0007255277,0.0010133254,0.00074636936,0.00020349004,0.0005355966,0.0041227555,0.00039801237,0.000022589014],"category_scores_gemma":[0.00008328439,0.0006375987,0.00025847382,0.00071296596,0.0005823577,0.0011133258,0.0020790787,0.00081150513,0.000022228473],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016308755,0.0009341249,0.00016146002,0.0004610999,0.000062813575,0.000052324685,0.007861539,0.008557803,0.007392271,0.10171155,0.00018019501,0.8726085],"study_design_scores_gemma":[0.0034606736,0.0016581008,0.009549499,0.0020410595,0.000103212755,0.00029889902,0.000031230098,0.8196016,0.039758287,0.108024664,0.0074656745,0.008007114],"about_ca_topic_score_codex":0.00011003961,"about_ca_topic_score_gemma":0.000036396672,"teacher_disagreement_score":0.8646014,"about_ca_system_score_codex":0.00044142312,"about_ca_system_score_gemma":0.00093685655,"threshold_uncertainty_score":0.9996075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002983126,0.0002747607,0.9929395,0.00009067852,0.0022165761,0.00042310308,0.000006937459,0.0002462419,0.0037992392],"genre_scores_gemma":[0.0013610412,0.000009079535,0.99771327,0.0002029648,0.00050597615,0.000030974013,0.0000046272457,0.00007394338,0.00009809789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979765,0.0000319564,0.0004734186,0.00061381585,0.00052909576,0.00037522797],"domain_scores_gemma":[0.99622315,0.0029053816,0.00013388468,0.00041724925,0.00020588595,0.00011445924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014544249,0.00038951417,0.00046898331,0.00036325183,0.000094861534,0.000060511396,0.0004617229,0.00021204854,0.000008252673],"category_scores_gemma":[0.00061558286,0.00036576568,0.00009659066,0.00026217225,0.00024093779,0.000089937355,0.0001519457,0.0005403458,0.000010843983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051749216,0.000004774677,7.5091734e-8,0.000056313016,0.0000042568895,0.0000014739172,0.00006226751,0.47710463,0.000054781667,0.003180188,0.000008306179,0.5195178],"study_design_scores_gemma":[0.00010488201,0.0001249659,0.0000010774258,0.0002247861,0.0000071861573,0.000006288026,1.10290514e-7,0.61323255,0.0009747219,0.37983656,0.005241125,0.00024571843],"about_ca_topic_score_codex":9.442076e-7,"about_ca_topic_score_gemma":0.0000026939426,"teacher_disagreement_score":0.519272,"about_ca_system_score_codex":0.0009022935,"about_ca_system_score_gemma":0.00009021064,"threshold_uncertainty_score":0.9998794},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017065239,0.0000677637,0.99486756,0.0012922011,0.00039159082,0.0012863972,0.000009697243,0.00005914814,0.00031911623],"genre_scores_gemma":[0.5414754,0.000003749499,0.45691657,0.0010863044,0.00032519066,0.00012279132,0.000015279165,0.00002544042,0.000029281295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703276,0.000031076514,0.00042364871,0.0010835672,0.00088574504,0.00054322823],"domain_scores_gemma":[0.9980548,0.00036757707,0.00019448111,0.001026262,0.00023289304,0.00012398222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087258336,0.00035661046,0.00034507,0.00061577023,0.00029180248,0.00061590155,0.0025760047,0.000120786826,0.000004848863],"category_scores_gemma":[0.000023543193,0.0002656244,0.00008181296,0.000776304,0.00016875901,0.0003402711,0.00053689914,0.0003276971,0.000005635234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004404936,0.0001383586,0.00021125034,0.00014546026,0.000025666073,0.000026820393,0.015857896,0.05949501,0.00020593836,0.24060935,0.00027738875,0.68296283],"study_design_scores_gemma":[0.0012443743,0.0007372872,0.00036101314,0.0005238953,0.000028249484,0.00008221966,0.000013051663,0.7516693,0.0001980063,0.23002808,0.013803242,0.0013113042],"about_ca_topic_score_codex":0.000063611966,"about_ca_topic_score_gemma":0.0015736707,"teacher_disagreement_score":0.69217426,"about_ca_system_score_codex":0.00017067262,"about_ca_system_score_gemma":0.00023713817,"threshold_uncertainty_score":0.9999796},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08216071,0.00067376025,0.9103028,0.00033979487,0.00052058976,0.0021905426,0.000004869302,0.000072108945,0.0037347865],"genre_scores_gemma":[0.96774375,0.000003424807,0.031167688,0.0008258827,0.0001453362,0.00001986385,0.000022905368,0.00002053431,0.000050609044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769646,0.00004736565,0.00034984676,0.0007067702,0.0009573042,0.00024225963],"domain_scores_gemma":[0.998633,0.00032262088,0.0002388832,0.00034518747,0.00037573845,0.000084536325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040869758,0.00028626993,0.00046688117,0.00036941282,0.00007836488,0.00003656648,0.00018934526,0.00021674008,0.00011028952],"category_scores_gemma":[0.00010869101,0.0002235061,0.00009986903,0.00021838515,0.00030947741,0.000103397,0.000100512756,0.000353742,0.000011700717],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088548266,0.00023588003,0.0069245724,0.00007696189,0.000062974315,0.000050134564,0.00082056253,0.10354067,0.00039383012,0.00020629051,0.000020704389,0.88757885],"study_design_scores_gemma":[0.0021354333,0.0014318441,0.1807349,0.000534188,0.00011547833,0.00002301958,3.4320482e-7,0.7719145,0.00024375418,0.04260562,0.000011178843,0.00024975074],"about_ca_topic_score_codex":0.000013429268,"about_ca_topic_score_gemma":0.000013757369,"teacher_disagreement_score":0.8873291,"about_ca_system_score_codex":0.00023908925,"about_ca_system_score_gemma":0.00022995145,"threshold_uncertainty_score":0.91143143},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011730643,0.00020976801,0.9934199,0.0003149661,0.0013338387,0.00080338045,0.0000036011652,0.000523587,0.0032736382],"genre_scores_gemma":[0.02137597,0.000036120902,0.97588134,0.0018096665,0.00024291518,0.000027432927,0.0000080418795,0.000048195376,0.0005703462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948687,0.00011634906,0.00076183927,0.0022598917,0.0011121883,0.0008810105],"domain_scores_gemma":[0.9967436,0.00033650757,0.00034815894,0.0020052525,0.00028755414,0.0002789072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014079186,0.0007154512,0.00067835103,0.0016001048,0.0002836826,0.0008076512,0.005120604,0.00044173517,0.000028008251],"category_scores_gemma":[0.000080227335,0.0006564951,0.00012484699,0.00089501933,0.0004897495,0.0005399948,0.0015851205,0.0011787218,0.00014423845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018972421,0.000101029684,0.0000029490006,0.000008880039,0.0000026350197,0.00005067816,0.0005242554,0.45011094,0.000010795139,0.0016352143,0.00002679066,0.5475239],"study_design_scores_gemma":[0.00039460394,0.000285134,0.00011041155,0.00037642138,0.000002386362,0.000031762476,2.6343383e-7,0.9853173,0.001965224,0.010468064,0.00027454997,0.00077389344],"about_ca_topic_score_codex":0.000119199714,"about_ca_topic_score_gemma":0.000040303916,"teacher_disagreement_score":0.54675,"about_ca_system_score_codex":0.00045646797,"about_ca_system_score_gemma":0.00045357886,"threshold_uncertainty_score":0.9995886},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019155973,0.00016080255,0.9959846,0.00028123916,0.0011090684,0.0006714075,0.000016965801,0.000552476,0.0012215191],"genre_scores_gemma":[0.01281925,0.000021607239,0.9850433,0.0008805863,0.0005223316,0.000019088548,0.000022684482,0.000043586984,0.0006275633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966286,0.000033019223,0.00057259353,0.0014337724,0.0007291744,0.00060288113],"domain_scores_gemma":[0.9965194,0.0008933105,0.0004487276,0.0012213388,0.0007714425,0.00014579126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008972127,0.000530782,0.00054978475,0.0006595401,0.00036467373,0.00044978314,0.0026168649,0.0003852348,0.000005044975],"category_scores_gemma":[0.00034395553,0.00051340286,0.0001589581,0.00048118256,0.00037158612,0.00029102433,0.0008408981,0.00048675106,0.000017112156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009672088,0.00001778777,0.000025173093,0.00003866559,0.000011863002,0.000008062139,0.0002444496,0.25383455,0.0000044618864,0.14792787,0.00030923888,0.5975682],"study_design_scores_gemma":[0.00017582501,0.00019067933,0.00003766872,0.00020807025,0.000006812971,0.000013946183,3.005606e-8,0.6607464,0.00026525065,0.3363604,0.0015363478,0.0004585829],"about_ca_topic_score_codex":0.000008087316,"about_ca_topic_score_gemma":0.000018770937,"teacher_disagreement_score":0.5971096,"about_ca_system_score_codex":0.00026939757,"about_ca_system_score_gemma":0.00043768765,"threshold_uncertainty_score":0.9997318},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030615833,0.00036843,0.989152,0.0040577515,0.0011593067,0.0003647354,0.0000032286794,0.00019151338,0.0046724263],"genre_scores_gemma":[0.03835134,0.0001355993,0.95334345,0.0058348826,0.0010059148,0.000019290392,0.000012945892,0.000050133633,0.0012464534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661565,0.000017745875,0.00030174077,0.0015379916,0.0009524174,0.0005744269],"domain_scores_gemma":[0.99714077,0.00053457695,0.00020855405,0.0017232499,0.00019003238,0.00020284702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042551287,0.00046080985,0.00038152476,0.00054459926,0.00037057785,0.0005434477,0.0034754514,0.00036131046,0.000039536502],"category_scores_gemma":[0.00003188559,0.00038523477,0.00014774491,0.0009843028,0.00031635808,0.00037767843,0.0010525846,0.00086272677,0.00007877476],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003695785,0.000017977036,0.000015003791,0.000006022259,0.0000015716299,0.00005709659,0.000025232895,0.04080773,0.00009147668,0.013657257,0.0006027186,0.9447142],"study_design_scores_gemma":[0.00020718251,0.00008240611,0.00007741723,0.00031932085,0.0000040175123,0.000050089366,1.04736255e-8,0.7922117,0.0003057401,0.15521733,0.05103966,0.00048509598],"about_ca_topic_score_codex":0.000006335689,"about_ca_topic_score_gemma":0.00005014751,"teacher_disagreement_score":0.9442291,"about_ca_system_score_codex":0.00017607739,"about_ca_system_score_gemma":0.00030228193,"threshold_uncertainty_score":0.9998599},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037896074,0.00043662862,0.99347717,0.0004414616,0.0009530945,0.00022148436,0.0000010024042,0.0001306922,0.0039595054],"genre_scores_gemma":[0.35970742,0.00030919517,0.6327862,0.0032821032,0.0010052164,0.000036264457,0.00007524058,0.00010128738,0.0026970776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972804,0.000057798905,0.0003932357,0.0010257695,0.0007991868,0.00044357384],"domain_scores_gemma":[0.9987483,0.00012705276,0.00015723365,0.00059324095,0.00023871253,0.000135444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000835701,0.00032253866,0.00033447304,0.00092102156,0.0001244605,0.00034171407,0.0015336962,0.000288532,0.000033883494],"category_scores_gemma":[0.000102364516,0.00030113358,0.000058317844,0.00066559884,0.00017282076,0.0007227995,0.00071043195,0.00067709887,0.00009263875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051916795,0.000024225837,0.0002457597,0.000025123541,0.0000028692223,0.00007188665,0.0011683005,0.2741239,0.00048415718,0.0049798233,0.00010945864,0.7187593],"study_design_scores_gemma":[0.0003847347,0.000101962825,0.00010139257,0.00044596972,0.0000022930105,0.000020383026,2.89166e-7,0.89267373,0.0009596321,0.100980215,0.003831499,0.00049789285],"about_ca_topic_score_codex":0.000038346225,"about_ca_topic_score_gemma":0.000085912594,"teacher_disagreement_score":0.71826136,"about_ca_system_score_codex":0.00025339043,"about_ca_system_score_gemma":0.0003937311,"threshold_uncertainty_score":0.9999441},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010780469,0.0004944634,0.99242574,0.00021330683,0.0036862388,0.0018147674,0.000010174883,0.001242081,0.00010244002],"genre_scores_gemma":[0.0006848689,0.000033365606,0.9970973,0.0005448614,0.0005270068,0.00017061587,0.0000068207955,0.00008833218,0.00084682467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99464136,0.000087641136,0.00075430394,0.0022986114,0.0009500567,0.001268016],"domain_scores_gemma":[0.99066144,0.0059488504,0.00038318915,0.0021651697,0.00062959903,0.00021177359],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014917804,0.0009192117,0.0009563298,0.00092103553,0.00035251552,0.00056847185,0.004167197,0.0005523293,0.000027321059],"category_scores_gemma":[0.0032104822,0.00084831705,0.00024603776,0.00075603614,0.00057005964,0.0011727609,0.0014876231,0.00094897,0.00007422276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015105362,0.0000236569,0.0000067661954,0.00008749397,0.000022494009,0.000045541892,0.00036968692,0.5010284,0.00024104585,0.010516684,0.000144957,0.48749813],"study_design_scores_gemma":[0.0007975521,0.00050025794,0.000046638943,0.00051659823,0.000018577557,0.00007341743,2.465528e-7,0.50784624,0.0057326057,0.479421,0.0033600836,0.0016867982],"about_ca_topic_score_codex":0.000011097363,"about_ca_topic_score_gemma":0.000005772349,"teacher_disagreement_score":0.48581132,"about_ca_system_score_codex":0.0006019284,"about_ca_system_score_gemma":0.00069681817,"threshold_uncertainty_score":0.99939674},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004541195,0.00071705127,0.9934432,0.00007120254,0.0026383416,0.00026914314,0.000005468924,0.00073468575,0.0020754945],"genre_scores_gemma":[0.7658254,0.000077053824,0.23119989,0.00025652416,0.0016708818,0.000039292365,0.000032568023,0.00023785341,0.00066055596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981479,0.000008717652,0.00043673586,0.00060154125,0.00040868716,0.00039639394],"domain_scores_gemma":[0.9986421,0.00022749546,0.000079010126,0.00086526823,0.00008518572,0.00010093109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034597673,0.00040886187,0.00038221935,0.0005195916,0.00006320636,0.0001196022,0.00089476025,0.00032841897,0.000028117029],"category_scores_gemma":[0.00007386157,0.00042877346,0.0000754608,0.00023915624,0.0001751964,0.00012361397,0.00013292048,0.0005801221,0.00018963843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.697074e-7,0.000001658186,0.0000087378485,0.00011527108,0.0000061594706,0.0000061482015,0.00012582,0.69451994,0.00021894755,0.00051446515,0.000024234641,0.304458],"study_design_scores_gemma":[0.00014330201,0.000028515926,0.00019309984,0.0005673967,0.00000843657,0.00004578173,4.1948763e-8,0.95617443,0.0028988337,0.0055697425,0.033633452,0.00073695875],"about_ca_topic_score_codex":0.0000050366793,"about_ca_topic_score_gemma":0.00001202633,"teacher_disagreement_score":0.76578,"about_ca_system_score_codex":0.00048593347,"about_ca_system_score_gemma":0.000074332296,"threshold_uncertainty_score":0.9998164},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086667115,0.00020996497,0.99451566,0.00022795502,0.00043154802,0.001001131,0.000006107893,0.002476234,0.00026473548],"genre_scores_gemma":[0.13754578,0.0000084782105,0.8617323,0.00033634796,0.00017774683,0.00008277342,0.000016138998,0.000035186073,0.00006524518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684584,0.000037772086,0.0005830578,0.0011577982,0.0007368852,0.00063866837],"domain_scores_gemma":[0.9976326,0.0006233955,0.00035075482,0.0010600417,0.00021955543,0.00011360919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016498271,0.00043819452,0.00044253445,0.00088113244,0.00023306943,0.00054676016,0.0021623767,0.00034929797,0.000007982338],"category_scores_gemma":[0.00021424484,0.0004351472,0.00010765844,0.00064708287,0.00039873275,0.00033472673,0.0006114168,0.00046040726,0.000031543277],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013021984,0.000072667164,0.0002456886,0.00003965424,0.000004368068,0.0000051398024,0.000639425,0.0073614414,0.00030440453,0.0017886208,0.00007812593,0.9894474],"study_design_scores_gemma":[0.00027478015,0.0002327618,0.00049646694,0.0005323841,0.000008797121,0.000033018077,4.05893e-8,0.9249299,0.006398867,0.06561404,0.00078892766,0.00068998383],"about_ca_topic_score_codex":0.000034240453,"about_ca_topic_score_gemma":0.0000036032363,"teacher_disagreement_score":0.98875743,"about_ca_system_score_codex":0.00048914616,"about_ca_system_score_gemma":0.00037089663,"threshold_uncertainty_score":0.99981004},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008599861,0.00048065657,0.9793477,0.00037884453,0.00036420426,0.00045542218,0.00000823162,0.000046548645,0.010318516],"genre_scores_gemma":[0.96546364,0.00015650949,0.033795964,0.00013569782,0.00017302044,0.000010827629,0.000017373613,0.0000122697265,0.00023467884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823064,0.00013822263,0.0003874154,0.00051481085,0.00046941152,0.0002594922],"domain_scores_gemma":[0.9991265,0.0002514016,0.00018921585,0.00013174681,0.00021387929,0.00008725175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010140383,0.00019157118,0.0002487072,0.00060558063,0.00035953653,0.000048542228,0.00028218393,0.00027060483,0.000025598503],"category_scores_gemma":[0.00007970918,0.00020881473,0.000039559523,0.000491218,0.0015725547,0.0007885067,0.00008255299,0.00035349317,0.0000028389509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002997738,0.00007504299,0.0012369712,0.00003969726,0.00000816833,0.0000037519865,0.014809817,0.19274224,0.00017353155,0.6818319,0.000016898519,0.10903202],"study_design_scores_gemma":[0.00014547464,0.00008919967,0.0018147487,0.00020253613,0.000007569718,0.0000061769133,0.0000070159435,0.20688282,0.000031448893,0.79049885,0.000102817336,0.00021134544],"about_ca_topic_score_codex":0.000960537,"about_ca_topic_score_gemma":0.0064567123,"teacher_disagreement_score":0.9568638,"about_ca_system_score_codex":0.00036915156,"about_ca_system_score_gemma":0.0005759008,"threshold_uncertainty_score":0.8515218},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024448385,0.0002567694,0.945255,0.00010257876,0.00034861342,0.00022935685,0.0000083046325,0.00003814243,0.029312873],"genre_scores_gemma":[0.98904145,0.000049866852,0.010533971,0.0002620411,0.0000436053,0.0000039635597,0.0000023167715,0.000012386717,0.000050428862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998734,0.000005941592,0.00028481294,0.0002631384,0.00040807136,0.00030404018],"domain_scores_gemma":[0.9986424,0.0008281714,0.000047302576,0.00038571013,0.00004499159,0.000051453448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031432978,0.0001896471,0.0003705648,0.0011445341,0.000028764429,0.000056700253,0.00070279493,0.00016378023,0.00008433172],"category_scores_gemma":[0.00008000228,0.00012471591,0.0001025597,0.0013900133,0.00025337038,0.000103294835,0.00015830246,0.00051550206,0.00001897704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017778601,0.000010073722,0.00004119193,0.000021426526,0.00005490218,0.0000070972974,0.0001188539,0.9073766,0.00002189613,0.039308935,0.0000041409985,0.053033136],"study_design_scores_gemma":[0.000041905576,0.000038821614,0.0010633932,0.00006470064,0.000032687152,8.5388257e-7,9.99079e-8,0.98616046,0.0003094904,0.012074425,0.00006545641,0.00014771605],"about_ca_topic_score_codex":0.000014961157,"about_ca_topic_score_gemma":0.000042357296,"teacher_disagreement_score":0.96459305,"about_ca_system_score_codex":0.0000943691,"about_ca_system_score_gemma":0.000032528485,"threshold_uncertainty_score":0.50857675},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006784201,0.0033008864,0.98951846,0.00024781178,0.00084261084,0.0004606226,0.0000021619567,0.00017841186,0.0047706272],"genre_scores_gemma":[0.9628634,0.000039575498,0.035768706,0.00030952296,0.00039633544,0.000009238561,0.0000046474033,0.000023044879,0.00058553787],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717337,0.000027732542,0.00043319803,0.0012269733,0.0005881418,0.0005505684],"domain_scores_gemma":[0.9985532,0.00024724388,0.00023717627,0.0006911517,0.00017464462,0.00009658567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044729467,0.00044386985,0.00049681414,0.0005885673,0.00013466628,0.0005984762,0.0016540617,0.00028879906,0.0000036026347],"category_scores_gemma":[0.0000936289,0.0003579582,0.000046502668,0.00062838587,0.000473433,0.0003614737,0.0007231062,0.00045776163,0.0000072643397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011696811,0.00007808072,0.0073371255,0.0007313931,0.000021628013,0.00068383204,0.0043140515,0.010306146,0.00018427245,0.09191741,0.00011527383,0.8842991],"study_design_scores_gemma":[0.0020783574,0.0007845984,0.0093274675,0.00079209555,0.000032835396,0.0011792176,0.000004573875,0.13878556,0.0037660862,0.82102966,0.01820621,0.0040133502],"about_ca_topic_score_codex":0.00021505999,"about_ca_topic_score_gemma":0.0013671609,"teacher_disagreement_score":0.96218497,"about_ca_system_score_codex":0.00009959763,"about_ca_system_score_gemma":0.00034572996,"threshold_uncertainty_score":0.9998872},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003190177,0.004011016,0.9892633,0.0006695049,0.0012685048,0.0005281362,0.000032844353,0.00027680577,0.0036308588],"genre_scores_gemma":[0.3192072,0.00064874557,0.6772496,0.0016229729,0.0010602976,0.000016845985,0.00006006688,0.00007141977,0.000062862106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99420035,0.00007649165,0.0006826187,0.0021436885,0.0016584803,0.0012383849],"domain_scores_gemma":[0.9964404,0.00040335424,0.0002067518,0.0022028845,0.00021397976,0.00053264294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013722389,0.00087242766,0.0007996399,0.000814367,0.00057603826,0.0008905203,0.0047098924,0.0006729486,0.00019308929],"category_scores_gemma":[0.0000314961,0.0008026195,0.000333139,0.0009839984,0.0008705192,0.002379395,0.0015101817,0.0016518706,0.000044724737],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023769904,0.00019332852,0.00010303883,0.00011410274,0.000037937327,0.00012220145,0.0025387427,0.0028735322,0.0010940868,0.054408386,0.00008397032,0.9384069],"study_design_scores_gemma":[0.0022462131,0.0020250462,0.002615226,0.0036811682,0.00025904144,0.0010778845,0.000003206455,0.40465924,0.012761761,0.32544407,0.2361129,0.009114241],"about_ca_topic_score_codex":0.000032604486,"about_ca_topic_score_gemma":0.000054345248,"teacher_disagreement_score":0.9292927,"about_ca_system_score_codex":0.00020725303,"about_ca_system_score_gemma":0.00044466363,"threshold_uncertainty_score":0.99944246},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002450057,0.000101646,0.99124706,0.0003735215,0.00014005124,0.0006102688,0.00004031558,0.000033409724,0.0072086956],"genre_scores_gemma":[0.09178298,0.00001726761,0.9058432,0.00037084447,0.000410441,0.00002944619,0.000009361784,0.00005099959,0.0014854451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983311,0.0000067636724,0.0004786442,0.00047431473,0.00042659248,0.00028256016],"domain_scores_gemma":[0.9979385,0.0007412823,0.00035024981,0.00070322055,0.00019871647,0.00006804169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000549656,0.00026734197,0.0004512971,0.00023934484,0.000101640995,0.000050212228,0.0007837526,0.00018505668,0.00004315974],"category_scores_gemma":[0.000145983,0.00022153092,0.00015123266,0.00014389234,0.00035544852,0.000045367324,0.00014213129,0.00023159599,0.000004943534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004597747,0.000053449363,0.0000015673603,0.00015992243,0.000011045193,0.0000022055574,0.0003693746,0.00026944783,0.00017175829,0.7125888,0.00015281094,0.28621507],"study_design_scores_gemma":[0.00012879187,0.0000750386,0.0000051776547,0.0002326437,0.000021387741,0.000015051349,1.5042403e-7,0.026544333,0.0010826353,0.96893466,0.0027273227,0.00023280113],"about_ca_topic_score_codex":0.0000020786877,"about_ca_topic_score_gemma":0.000020925785,"teacher_disagreement_score":0.28598225,"about_ca_system_score_codex":0.000057714267,"about_ca_system_score_gemma":0.00021725205,"threshold_uncertainty_score":0.9033769},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036057466,0.00035979573,0.99598193,0.0002567169,0.001138746,0.0005554106,0.0000028660495,0.00023357154,0.0011103797],"genre_scores_gemma":[0.24799243,0.000008719084,0.7503822,0.0011163626,0.0003581922,0.000007119231,0.0000025649956,0.000043979388,0.000088435896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946167,0.00024363569,0.00064963213,0.002421948,0.0011833184,0.0008847817],"domain_scores_gemma":[0.9964257,0.0006056952,0.00038032373,0.0019279739,0.00037499814,0.00028529816],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0025336882,0.00077158643,0.00076596,0.0008526222,0.00052640715,0.0011854813,0.005915382,0.00047238107,0.000024234321],"category_scores_gemma":[0.00013286647,0.00071709865,0.00014991153,0.00057119696,0.0010237085,0.0012350769,0.0022374298,0.0010957216,0.00003955981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027468708,0.00013574168,0.0000246587,0.00012728745,0.000037911817,0.000052879364,0.009614278,0.57467496,0.0014787008,0.02548365,0.00002249689,0.38831994],"study_design_scores_gemma":[0.00017535822,0.0003038599,0.000005079099,0.00028506975,0.000012791974,0.00011784967,0.0000012760677,0.90832627,0.0045833434,0.08505394,0.00033608856,0.00079908787],"about_ca_topic_score_codex":0.000054298038,"about_ca_topic_score_gemma":0.000024892728,"teacher_disagreement_score":0.38752085,"about_ca_system_score_codex":0.000646661,"about_ca_system_score_gemma":0.0007356044,"threshold_uncertainty_score":0.9998514},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001674424,0.000085573716,0.99705005,0.0000900377,0.0004059746,0.0003667583,0.000007161087,0.00008091927,0.0002391013],"genre_scores_gemma":[0.36651883,0.000010369813,0.6332375,0.0000887579,0.000053930467,0.0000047528215,7.479709e-7,0.000021287005,0.00006384673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971838,0.000013114979,0.0007630368,0.00097400637,0.0006217333,0.0004443321],"domain_scores_gemma":[0.9975486,0.000366297,0.00029823638,0.0013466155,0.00027926397,0.00016098008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003162384,0.00044018595,0.0008639092,0.0005474141,0.000063214655,0.0001005287,0.0018085754,0.00022824702,0.0000037317177],"category_scores_gemma":[0.000121770565,0.00036892417,0.00016543962,0.0003855243,0.00033331028,0.00018878061,0.0005864144,0.00018958263,0.0000073352203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049218033,0.000048026828,0.000007590705,0.00007545789,0.0000054172415,0.0000032127914,0.00043290702,0.89341223,0.010660906,0.015837917,6.5103393e-7,0.07951076],"study_design_scores_gemma":[0.00020729449,0.00047386694,0.0000061052756,0.0003882771,0.0000052191426,0.000010247617,2.2416838e-8,0.91742814,0.028553406,0.052588254,0.000023952793,0.00031519728],"about_ca_topic_score_codex":0.0000062401195,"about_ca_topic_score_gemma":0.0000012302224,"teacher_disagreement_score":0.36484438,"about_ca_system_score_codex":0.00019993434,"about_ca_system_score_gemma":0.00018731393,"threshold_uncertainty_score":0.99987626},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094571884,0.0006957253,0.98596555,0.0077630803,0.0014560185,0.0006418764,0.000011355226,0.00057164335,0.0019490556],"genre_scores_gemma":[0.27748242,0.00008763954,0.71997267,0.0020112146,0.00030524525,0.000011061519,0.0000066576376,0.00007574158,0.000047356025],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949019,0.00007690731,0.0008660435,0.0019230775,0.001253505,0.000978544],"domain_scores_gemma":[0.98742,0.0010374034,0.00084321754,0.0101281805,0.0004451746,0.0001259812],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0018686483,0.0007111237,0.00070846017,0.0005824057,0.000420171,0.0004805081,0.07016983,0.00045746638,0.000014061501],"category_scores_gemma":[0.004259056,0.00055678916,0.00014270861,0.0014225455,0.0010732228,0.0008995276,0.120700285,0.0015203969,0.000037119506],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025607269,0.00012898959,0.0004212587,0.0005399758,0.00011142218,0.00011659813,0.0062765433,0.0011655069,0.0030020059,0.0542325,0.00275289,0.93122673],"study_design_scores_gemma":[0.00021389477,0.00014958717,0.000038182276,0.000841856,0.000012659106,0.00010043593,8.246103e-7,0.32999787,0.013839049,0.6533328,0.0007686942,0.00070408883],"about_ca_topic_score_codex":0.00029302703,"about_ca_topic_score_gemma":0.000033551976,"teacher_disagreement_score":0.9305226,"about_ca_system_score_codex":0.0002777457,"about_ca_system_score_gemma":0.00053417287,"threshold_uncertainty_score":0.9996884},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003500619,0.00017990179,0.99151206,0.00022241726,0.0013407957,0.000348703,0.0000020295029,0.00005480379,0.0059892163],"genre_scores_gemma":[0.71362096,0.00002320349,0.28493246,0.0004371983,0.00021498333,0.000014476642,0.0000015714916,0.000021362872,0.0007337646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666184,0.00004623109,0.0006930766,0.0010967272,0.0010021462,0.00049995614],"domain_scores_gemma":[0.9981208,0.0002691677,0.00028763423,0.00105298,0.00016530327,0.00010414796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009415756,0.00033404765,0.00049231737,0.0010542227,0.00014302522,0.00019016674,0.0023107007,0.00018131996,0.000030420855],"category_scores_gemma":[0.000073922805,0.00033529237,0.00009373651,0.0007226902,0.00043108928,0.00028514856,0.0011009563,0.0005056619,0.00000960517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000903965,0.00007866706,0.0006433231,0.000085650405,0.000027136683,0.000058401783,0.0050841076,0.256894,0.000493535,0.15910462,0.00004304728,0.57747847],"study_design_scores_gemma":[0.0010394702,0.00027157817,0.00016370128,0.0011063521,0.000010124187,0.000038588216,0.0000015718244,0.8666326,0.005192889,0.1220144,0.0026243634,0.0009043852],"about_ca_topic_score_codex":0.000091368835,"about_ca_topic_score_gemma":0.00037692394,"teacher_disagreement_score":0.7132709,"about_ca_system_score_codex":0.00049402745,"about_ca_system_score_gemma":0.00041209502,"threshold_uncertainty_score":0.99990994},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001058248,0.0012117656,0.9960242,0.000104569204,0.001038051,0.0004507317,0.000025210786,0.0000144258465,0.0010252445],"genre_scores_gemma":[0.3440084,0.00029351524,0.644586,0.0025961946,0.005763319,0.00009612363,0.00015865546,0.00014083537,0.0023569406],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99830943,0.000014338319,0.00022606856,0.00072108186,0.00026754287,0.00046152793],"domain_scores_gemma":[0.9989488,0.00007187991,0.00011415634,0.0005762761,0.00016771039,0.000121175544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005372222,0.00031197976,0.00026246553,0.00010196026,0.00013059865,0.000059759783,0.0006855486,0.00048763014,0.000026304335],"category_scores_gemma":[0.00008591979,0.00027975778,0.00013993825,0.00004805114,0.00039765186,0.000007648481,0.0003187181,0.00019121049,0.000021257638],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043452303,0.00002566188,0.000035000015,0.000054250326,0.00001953704,0.000004336286,0.000029431823,0.0020850564,0.025923565,0.0013840566,0.00008557944,0.9703101],"study_design_scores_gemma":[0.0010202748,0.0016903195,0.00011919325,0.0003875951,0.000066206616,0.00009277272,3.346463e-7,0.04702206,0.5202328,0.17197283,0.2551367,0.0022589331],"about_ca_topic_score_codex":0.0000063597654,"about_ca_topic_score_gemma":0.00004615742,"teacher_disagreement_score":0.96805114,"about_ca_system_score_codex":0.000044075856,"about_ca_system_score_gemma":0.0001840345,"threshold_uncertainty_score":0.9999654},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010142311,0.0013775426,0.9933778,0.00035993475,0.0009105217,0.0002352209,9.95429e-7,0.0002876592,0.0033489198],"genre_scores_gemma":[0.57101876,0.00014244858,0.42737812,0.0007174604,0.00044647016,0.0000031280924,0.000004410358,0.000039112674,0.0002500922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957024,0.00006696456,0.0005128212,0.0015312207,0.0011208144,0.0010658078],"domain_scores_gemma":[0.9969573,0.00080016046,0.00034556573,0.0012866125,0.00026246163,0.00034790882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011805769,0.0007053811,0.0006753235,0.00062066066,0.0004219155,0.0008129859,0.0032210853,0.00042742508,0.000037853395],"category_scores_gemma":[0.00006144674,0.0005361073,0.0001289865,0.0006919029,0.00064341613,0.0007851342,0.0008507154,0.0017256507,0.000055526827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011648538,0.000017575154,0.00022137305,0.000006817244,0.000007389856,0.000039847066,0.00018957048,0.37656033,0.000009580204,0.0080463365,0.000013762842,0.6148758],"study_design_scores_gemma":[0.00023899678,0.00041612302,0.00050824945,0.00066420494,0.000012352724,0.00015061568,1.8119928e-7,0.93602127,0.00005774483,0.06062784,0.00050112704,0.0008012755],"about_ca_topic_score_codex":0.000026108208,"about_ca_topic_score_gemma":0.00008578021,"teacher_disagreement_score":0.61407447,"about_ca_system_score_codex":0.00023548439,"about_ca_system_score_gemma":0.0004365805,"threshold_uncertainty_score":0.99970907},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008101528,0.000348231,0.9976275,0.00019994823,0.00034039727,0.00030061172,0.000013134275,0.000036909514,0.00032311294],"genre_scores_gemma":[0.24088861,0.00009475524,0.7580156,0.0008736314,0.00003699229,0.000007100379,0.000013296281,0.000017972521,0.000052067273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733025,0.0000625382,0.000512424,0.0009958217,0.00071608427,0.00038290175],"domain_scores_gemma":[0.9980606,0.00037424217,0.00028859894,0.00092274573,0.0002283407,0.00012550462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080681505,0.0003356602,0.0006059222,0.0017295635,0.00018499016,0.00024111493,0.001329308,0.0001565301,0.000031132695],"category_scores_gemma":[0.0000264158,0.00031302386,0.00016684689,0.0017784559,0.0005284153,0.0002679286,0.000550119,0.00030385668,0.0000017525089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027097198,0.00028766427,0.005496444,0.00016694261,0.0013017323,0.00014755505,0.0075455294,0.19452658,0.0010365602,0.1426634,0.00019205874,0.6466084],"study_design_scores_gemma":[0.00041179784,0.00018021952,0.0032819596,0.000119852775,0.00021533789,0.00002655637,4.6939388e-7,0.9290272,0.0006547821,0.064035706,0.0013569132,0.0006892102],"about_ca_topic_score_codex":0.00003370791,"about_ca_topic_score_gemma":0.000054768763,"teacher_disagreement_score":0.73450065,"about_ca_system_score_codex":0.000068261215,"about_ca_system_score_gemma":0.00012920584,"threshold_uncertainty_score":0.99993217},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042538963,0.00019864297,0.98917234,0.0030350648,0.00094876357,0.0004531645,0.0000018080133,0.0005780847,0.0055695903],"genre_scores_gemma":[0.5316405,0.00012648889,0.46379724,0.0013267938,0.0003308123,0.0000334855,0.000017379789,0.000046595702,0.002680672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964583,0.000029224124,0.00046176685,0.0014230822,0.0010207848,0.0006068524],"domain_scores_gemma":[0.997292,0.00024761676,0.00022031736,0.0017624092,0.00034777666,0.00012987244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058267807,0.00043029926,0.00037395378,0.000964564,0.0002974456,0.000905687,0.004214925,0.00045253447,0.00011646562],"category_scores_gemma":[0.000074995776,0.00038535832,0.00008996726,0.00084644335,0.0007790233,0.0011361979,0.001661406,0.00085057406,0.00043439123],"study_design_candidate":"design_other","study_design_consensus":null,"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.734097e-7,0.000020376914,0.00005445812,0.000017885312,0.000004758585,0.000009738154,0.00022579357,0.0026774788,0.00033078776,0.12924643,0.00009233466,0.867319],"study_design_scores_gemma":[0.00015984883,0.00011100998,0.00035361477,0.000071749404,0.0000038846797,0.00002078606,2.4488017e-7,0.5153852,0.0065769083,0.4734844,0.0032191963,0.0006131771],"about_ca_topic_score_codex":0.000044747987,"about_ca_topic_score_gemma":0.00002325588,"teacher_disagreement_score":0.86670583,"about_ca_system_score_codex":0.00033643123,"about_ca_system_score_gemma":0.00038615867,"threshold_uncertainty_score":0.9998598},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014911682,0.00006792745,0.99018085,0.00060779206,0.0039125895,0.00039347648,0.0000054914776,0.00035891915,0.004323865],"genre_scores_gemma":[0.05245996,0.000027947925,0.9464677,0.000532789,0.00035254328,0.000007981204,0.000004631579,0.000027736362,0.000118716496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965239,0.000071356764,0.00063484977,0.001435009,0.00076533464,0.00056953484],"domain_scores_gemma":[0.9973663,0.0006237323,0.00041306217,0.001072107,0.000299378,0.00022539559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001465791,0.00050303683,0.0004637616,0.00089996285,0.0004116838,0.0006872119,0.0013389405,0.0005455532,0.00017671364],"category_scores_gemma":[0.00023070072,0.000500958,0.00014636002,0.00050132384,0.00097514986,0.0008582708,0.00070168753,0.001601937,0.000033484142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022725712,0.0000065455847,0.0004111181,0.000011810258,0.000008927515,0.000018666049,0.0003694581,0.03193009,0.0011436803,0.013731866,0.0000017556403,0.9523638],"study_design_scores_gemma":[0.00031532472,0.00010734357,0.0016025152,0.00018025565,0.000013263135,0.000336219,5.0367044e-7,0.9527532,0.0041377866,0.038926,0.0008710213,0.0007566057],"about_ca_topic_score_codex":0.000040330928,"about_ca_topic_score_gemma":0.00022572836,"teacher_disagreement_score":0.9516072,"about_ca_system_score_codex":0.00028477795,"about_ca_system_score_gemma":0.0007514028,"threshold_uncertainty_score":0.9997442},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043063934,0.00043235664,0.99257255,0.0003406204,0.001824015,0.00027206322,0.000019949226,0.00021987225,0.004275521],"genre_scores_gemma":[0.015690995,0.0007140784,0.97965664,0.0019082304,0.0013183077,0.000020899004,0.00011046388,0.000051927953,0.0005284869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964913,0.00003256046,0.00046644596,0.0014630817,0.0009841849,0.00056241936],"domain_scores_gemma":[0.9978065,0.00019648629,0.00027319606,0.0012919655,0.00024508793,0.00018675854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041336103,0.00044789954,0.00040103766,0.0006063923,0.00038514377,0.000421806,0.0022766474,0.0003083346,0.00005262032],"category_scores_gemma":[0.00004581428,0.0004059548,0.00011734591,0.00046875718,0.00046041462,0.0012074856,0.0012752175,0.0006823376,0.000281432],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029978473,0.000025013784,0.0000057411526,0.000014237878,0.000003845069,0.00010143014,0.00026569655,0.0016592304,0.000049894054,0.0012307493,0.00030965,0.9963315],"study_design_scores_gemma":[0.00052982534,0.0003439158,0.00024474968,0.0010893703,0.000011560568,0.00046539123,1.1616685e-7,0.7140833,0.0024942574,0.25868696,0.020577243,0.0014732889],"about_ca_topic_score_codex":0.00002424181,"about_ca_topic_score_gemma":0.000016589323,"teacher_disagreement_score":0.9948582,"about_ca_system_score_codex":0.00020869086,"about_ca_system_score_gemma":0.00035562436,"threshold_uncertainty_score":0.99983925},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036101937,0.001322847,0.99218285,0.00050162355,0.0017758089,0.0002490856,0.000008040558,0.00012236166,0.0002272171],"genre_scores_gemma":[0.7867949,0.0005697864,0.2084294,0.0024873067,0.001570343,0.00000824486,0.000041563344,0.000034262917,0.00006421112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756414,0.000043654298,0.0005146868,0.0005780395,0.0005892447,0.0007102542],"domain_scores_gemma":[0.9988784,0.00021961208,0.00022901518,0.00044815833,0.000098235614,0.00012653648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007423858,0.0003590176,0.0004244902,0.00049014913,0.00023898466,0.00044095318,0.0011043511,0.0002576183,0.000005202672],"category_scores_gemma":[0.000043751712,0.00034225636,0.000078064244,0.0003742417,0.0002102569,0.0011964445,0.00089303876,0.00075788883,0.000011651205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011076048,0.00001710982,0.0002917496,0.000028732893,0.000006642923,0.000021869277,0.0015576945,0.026433272,0.000015735955,0.0035190878,0.00002221033,0.9680748],"study_design_scores_gemma":[0.00066697487,0.0000628315,0.0033531396,0.00043894135,0.000010141038,0.000079800026,5.883396e-7,0.9645416,0.000021598102,0.027165823,0.0029719584,0.0006866131],"about_ca_topic_score_codex":0.000065090055,"about_ca_topic_score_gemma":0.00034021895,"teacher_disagreement_score":0.9673882,"about_ca_system_score_codex":0.00022822029,"about_ca_system_score_gemma":0.00018169435,"threshold_uncertainty_score":0.99990296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000272798,0.0007512076,0.9893477,0.0006228167,0.0018181407,0.00055400433,0.00003430363,0.00017063905,0.006428413],"genre_scores_gemma":[0.3320442,0.00042036248,0.66375077,0.0026932207,0.0007546423,0.00009668055,0.00015437062,0.000042918597,0.00004279036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970305,0.00007818202,0.0004137028,0.001304661,0.00075367803,0.0004192871],"domain_scores_gemma":[0.99744344,0.000456431,0.00022178888,0.001141865,0.00054624944,0.00019021623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092953345,0.00040495957,0.00033623909,0.00091039983,0.0005656876,0.0008365658,0.0010778434,0.0003164698,0.00019409912],"category_scores_gemma":[0.00010803434,0.00038774157,0.00009845176,0.00088529056,0.0010176179,0.0012123045,0.00070568745,0.0007081505,0.00006662865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034253198,0.000022721675,0.000046413676,0.000020287469,0.000017765742,0.000006811566,0.00032246576,0.0012412777,0.000050187326,0.65265197,0.00015879885,0.3454579],"study_design_scores_gemma":[0.00032083344,0.00011347373,0.0006702782,0.00013328306,0.000033771525,0.000113799455,6.2357515e-7,0.21393907,0.000058625927,0.7808688,0.0032832688,0.0004641412],"about_ca_topic_score_codex":0.000025420908,"about_ca_topic_score_gemma":0.00010998778,"teacher_disagreement_score":0.34499377,"about_ca_system_score_codex":0.000113750335,"about_ca_system_score_gemma":0.0004488033,"threshold_uncertainty_score":0.9998574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025624895,0.00014677884,0.99620515,0.00007869527,0.002184525,0.0006461242,0.0000035350179,0.0001369382,0.00034202018],"genre_scores_gemma":[0.1991293,0.000012280062,0.8005054,0.00007299622,0.00019492109,0.0000043387704,0.00000625824,0.000023888815,0.000050604976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970983,0.000032752905,0.00076127023,0.0007076273,0.00091522175,0.00048478696],"domain_scores_gemma":[0.99674636,0.0007749382,0.00090637954,0.0009502696,0.0005085315,0.00011349703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095855567,0.00036492266,0.00048774082,0.0016006192,0.0002653188,0.0002482792,0.0014001572,0.00030144714,0.000015510037],"category_scores_gemma":[0.00028504466,0.0003607639,0.00015468962,0.0010436921,0.000472019,0.0009926512,0.0004778915,0.00040693756,0.0000051929565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019525341,0.000011274057,0.00010271487,0.00007563243,0.00001339243,9.839949e-7,0.0001978824,0.6930733,0.00018438837,0.017280305,0.0000014820941,0.28905672],"study_design_scores_gemma":[0.00022503441,0.00012278526,0.0001350535,0.00022321822,0.000028151326,0.000032648695,2.9220743e-7,0.97301364,0.0009607902,0.024677917,0.00023803591,0.00034243675],"about_ca_topic_score_codex":0.000010403278,"about_ca_topic_score_gemma":0.0000032077292,"teacher_disagreement_score":0.2887143,"about_ca_system_score_codex":0.00041060394,"about_ca_system_score_gemma":0.0005397045,"threshold_uncertainty_score":0.9998844},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026872332,0.003752662,0.9915498,0.00030697492,0.0002959437,0.00029422165,0.000002968821,0.00013019133,0.0033985197],"genre_scores_gemma":[0.5549764,0.000035199304,0.4445367,0.00023192757,0.000082481536,0.0000044245726,0.0000020418502,0.000013729137,0.00011709649],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801016,0.000035970734,0.00034643785,0.0006463498,0.00057097856,0.00039012634],"domain_scores_gemma":[0.99828357,0.0004026527,0.0002628816,0.0008196058,0.0001717102,0.000059580387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006273566,0.00026426752,0.0002830672,0.0004865982,0.00011689751,0.00027238068,0.0029816232,0.00022291146,0.000020528789],"category_scores_gemma":[0.00006602152,0.0001945256,0.000062820145,0.00045692755,0.0010992781,0.00050868036,0.000893385,0.0005985175,0.000012515996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002506347,0.00000859254,0.000022284108,0.0000118623975,0.000002800333,0.000035224435,0.0009681026,0.00014315972,0.0021063562,0.09989805,0.000004865781,0.89679617],"study_design_scores_gemma":[0.000215052,0.000114871524,0.00007366253,0.00064931175,0.0000039854003,0.00006044418,0.000003888047,0.11605193,0.041640386,0.8403977,0.000292499,0.0004962632],"about_ca_topic_score_codex":0.000081421,"about_ca_topic_score_gemma":0.00007440079,"teacher_disagreement_score":0.89629996,"about_ca_system_score_codex":0.00021195013,"about_ca_system_score_gemma":0.00031346807,"threshold_uncertainty_score":0.79325235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068720925,0.000751944,0.9952167,0.00020638767,0.0008517758,0.00023575031,0.000004882822,0.0004861709,0.0021776636],"genre_scores_gemma":[0.04003767,0.00003599927,0.9588976,0.00015038438,0.0001226999,0.000009002364,0.0000025212648,0.00003583376,0.00070830324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968831,0.00003874209,0.00036382396,0.0011835428,0.00097582984,0.0005549417],"domain_scores_gemma":[0.9973271,0.00053465605,0.00022746056,0.0013513749,0.00043430162,0.00012510219],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012070421,0.00049739477,0.0005568255,0.0006057419,0.00013432663,0.00035836577,0.0026288966,0.00023313418,0.0000023428981],"category_scores_gemma":[0.00032165536,0.00041202185,0.00005543841,0.00047934387,0.0005548398,0.0011997671,0.0011543105,0.00067490875,0.000010602774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063646303,0.000004218559,0.0000069829844,0.00002668208,0.000008385101,0.000022957673,0.00069539045,0.8978227,0.000037666603,0.014482569,0.000016833243,0.08686929],"study_design_scores_gemma":[0.00015372988,0.00016725787,0.000004944246,0.0002952416,0.000006188434,0.00004696547,5.136848e-7,0.5873668,0.0014622498,0.40962875,0.00033118526,0.0005361443],"about_ca_topic_score_codex":0.000010603433,"about_ca_topic_score_gemma":0.000026039963,"teacher_disagreement_score":0.3951462,"about_ca_system_score_codex":0.0004967507,"about_ca_system_score_gemma":0.00070703455,"threshold_uncertainty_score":0.99983317},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012927546,0.001255068,0.98245186,0.00039400527,0.003318636,0.0010297097,0.0000010526319,0.00040500483,0.011131724],"genre_scores_gemma":[0.43618777,0.00002103161,0.5577899,0.0006492651,0.0022492958,0.000095452124,0.000011690573,0.00010211785,0.0028934777],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99462146,0.000064362786,0.0006391287,0.0020469045,0.0015782657,0.0010499094],"domain_scores_gemma":[0.996656,0.00019031689,0.00047048408,0.0016727517,0.0006595818,0.00035083923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017986465,0.0006993109,0.00073245406,0.0007871696,0.00030972183,0.0010115048,0.0041179364,0.0005150351,0.000009607836],"category_scores_gemma":[0.00014667556,0.0005814286,0.00016519541,0.00091440347,0.0008703781,0.000910794,0.0018904675,0.0011079541,0.00013779866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029663618,0.00003627663,0.00007011387,0.000038299215,0.000015552321,0.00011650597,0.001324503,0.0005077681,0.0000108552285,0.14429732,0.000050450388,0.8535294],"study_design_scores_gemma":[0.0005824055,0.0007869371,0.000051763232,0.00016962022,0.00002024808,0.0002814606,0.0000013398216,0.04659248,0.00041679788,0.8518047,0.09762182,0.0016704486],"about_ca_topic_score_codex":0.00008040319,"about_ca_topic_score_gemma":0.0001253946,"teacher_disagreement_score":0.851859,"about_ca_system_score_codex":0.00056375057,"about_ca_system_score_gemma":0.0011599454,"threshold_uncertainty_score":0.9996637},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006108938,0.00051977666,0.9834189,0.00012880187,0.000983987,0.00032000965,0.00002383687,0.000028644297,0.008467137],"genre_scores_gemma":[0.9315602,0.000023709186,0.06682638,0.00015399973,0.00021928386,0.000011415511,0.000010930891,0.0000239189,0.0011701363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983185,0.000013849789,0.0007442292,0.00058595784,0.00008979234,0.00024767863],"domain_scores_gemma":[0.9984863,0.00021743344,0.00066267856,0.0004909497,0.00008495162,0.000057702116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008445219,0.00022151925,0.0005346799,0.00048399207,0.00009062561,0.00012989916,0.00055471313,0.00021589582,0.0002635008],"category_scores_gemma":[0.0001465729,0.0002360693,0.000108071596,0.00018512766,0.00038328566,0.00021986316,0.00012488956,0.00027897485,0.0002706987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018952867,0.000060996263,0.0005611018,0.0001475958,0.000051165436,0.00000715476,0.0017559408,0.07715616,0.0003847323,0.7963574,0.000030772902,0.12346806],"study_design_scores_gemma":[0.0005065238,0.00026083237,0.00034877547,0.00052098936,0.00000847089,0.000020715417,4.8969065e-7,0.3439459,0.0016844322,0.64923376,0.0027420078,0.0007271269],"about_ca_topic_score_codex":0.0000537215,"about_ca_topic_score_gemma":0.0000089344085,"teacher_disagreement_score":0.9254513,"about_ca_system_score_codex":0.0000906174,"about_ca_system_score_gemma":0.00006298019,"threshold_uncertainty_score":0.96266264},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053173286,0.00086823385,0.9952216,0.00020560768,0.0015539081,0.00059260253,0.000071213384,0.00017332668,0.0007817488],"genre_scores_gemma":[0.09935334,0.00035631025,0.89864844,0.00069695694,0.00047887495,0.00004644112,0.0001609445,0.000039829993,0.00021887144],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99642175,0.00010868779,0.00072529446,0.0010371435,0.0013061981,0.00040089272],"domain_scores_gemma":[0.99713844,0.0006540604,0.00049013284,0.0012219138,0.00033031078,0.0001651377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008180184,0.00042724647,0.00061683153,0.000434914,0.0001728352,0.00063492486,0.0018827296,0.00018784808,0.000087702196],"category_scores_gemma":[0.00018818342,0.00038475054,0.00017415365,0.00034691027,0.0008126799,0.0013110613,0.00047705136,0.0004658327,0.000051640498],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011838378,0.000025941405,0.000056071203,0.000039270977,0.00003026041,0.000005271557,0.00060051575,0.0007702216,0.059971355,0.0013201728,0.0018471339,0.9353326],"study_design_scores_gemma":[0.00016368022,0.00013964775,0.00011567415,0.00033737853,0.000032520427,0.00001059498,7.4486036e-7,0.109025456,0.8534547,0.0353195,0.00058990536,0.00081018003],"about_ca_topic_score_codex":0.00022825293,"about_ca_topic_score_gemma":0.00000466114,"teacher_disagreement_score":0.93452245,"about_ca_system_score_codex":0.00027146513,"about_ca_system_score_gemma":0.00029953592,"threshold_uncertainty_score":0.99986047},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010435767,0.00026128694,0.99546194,0.0006385173,0.0010547582,0.00084845047,0.00000791515,0.00014201185,0.0014807837],"genre_scores_gemma":[0.8965745,0.000008132467,0.10228602,0.00054427993,0.00043352167,0.00006636482,0.0000083252635,0.000030468482,0.000048382168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971475,0.000113030306,0.0006482398,0.0008964495,0.0006943888,0.00050041586],"domain_scores_gemma":[0.9974931,0.00056227343,0.0005891772,0.0008943272,0.00036358341,0.00009755885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010719391,0.00041662797,0.00055966806,0.0005208915,0.0004323965,0.00027253153,0.0019077971,0.00021297148,0.0000085841275],"category_scores_gemma":[0.000030653508,0.0003958263,0.00006788714,0.0010927367,0.00019426226,0.00037501607,0.0004897593,0.0004939089,0.0000058624005],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020166724,0.00076673523,0.00066077756,0.00013616733,0.00008888469,0.000016682281,0.011511231,0.06457107,0.00012709385,0.035144873,0.0028610886,0.88409525],"study_design_scores_gemma":[0.005178388,0.00951753,0.0019762479,0.007253,0.00016664778,0.00006020465,0.000065354034,0.77049583,0.020443939,0.14097303,0.035658628,0.008211206],"about_ca_topic_score_codex":0.000051989697,"about_ca_topic_score_gemma":0.000099690595,"teacher_disagreement_score":0.8964701,"about_ca_system_score_codex":0.00034903796,"about_ca_system_score_gemma":0.0003607789,"threshold_uncertainty_score":0.9998494},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067483523,0.00018295164,0.99493307,0.000108840446,0.002919569,0.00022538012,0.000011836756,0.000072483796,0.0008710469],"genre_scores_gemma":[0.2424284,0.000037527498,0.7570483,0.00014559618,0.00026964195,0.0000017935824,0.000013238319,0.000018780684,0.000036730526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973645,0.000032211883,0.00054114003,0.00081438076,0.0009435045,0.00030422973],"domain_scores_gemma":[0.9981379,0.0003518592,0.00038530584,0.00068739994,0.00033794082,0.00009962836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004720083,0.0002993802,0.00036445385,0.0007081333,0.00030158172,0.000119290096,0.0008674938,0.00019556895,0.000029313784],"category_scores_gemma":[0.00012919081,0.00030212698,0.000095344134,0.0005121643,0.000789048,0.0003223261,0.00059780036,0.0004367941,0.0000057305106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007384355,0.000024754163,0.00012840469,0.000021644051,0.0000075925786,0.000023827897,0.00058647664,0.88908327,0.00022062116,0.061413616,0.0000050182207,0.048477396],"study_design_scores_gemma":[0.00032684513,0.000045126977,0.0001262037,0.00026702852,0.0000058754895,0.00008871447,1.5545332e-7,0.9915922,0.00073881715,0.0062758853,0.00021378644,0.00031932243],"about_ca_topic_score_codex":0.000025559259,"about_ca_topic_score_gemma":0.000014042674,"teacher_disagreement_score":0.24175358,"about_ca_system_score_codex":0.00023299959,"about_ca_system_score_gemma":0.00092628173,"threshold_uncertainty_score":0.9999431},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010232912,0.00038301878,0.99452966,0.00037214937,0.00088659796,0.0005130193,0.0000019732956,0.0005691326,0.002642113],"genre_scores_gemma":[0.76647794,0.000055560395,0.23166394,0.0006347423,0.0005897257,0.00004770214,0.000002862572,0.00003978965,0.0004877434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673486,0.000024106988,0.00053100876,0.0013167511,0.00070228364,0.0006909656],"domain_scores_gemma":[0.997457,0.00015017523,0.00036602776,0.0015782495,0.000198361,0.00025015592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006572545,0.00050347915,0.00042775949,0.00077910296,0.00042857416,0.00040196686,0.0024131176,0.00042627534,0.0000596828],"category_scores_gemma":[0.000019745527,0.00048149054,0.00017059463,0.0008017607,0.00046170023,0.00076266145,0.00084472273,0.0007731472,0.0001652207],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002688194,0.000029963803,0.000035453944,0.000014693594,0.000007736494,0.000009772796,0.00014325631,0.0006943777,0.002470275,0.012513097,0.0000045998495,0.98407406],"study_design_scores_gemma":[0.00026240564,0.00029283177,0.00092102744,0.00015002298,0.000021385682,0.0002933115,1.278584e-7,0.7573982,0.032443937,0.19774646,0.009137644,0.0013326424],"about_ca_topic_score_codex":0.00007161551,"about_ca_topic_score_gemma":0.000094290255,"teacher_disagreement_score":0.9827414,"about_ca_system_score_codex":0.0003837402,"about_ca_system_score_gemma":0.00020427967,"threshold_uncertainty_score":0.99976367},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051384035,0.000051861258,0.99577963,0.00030004163,0.00070084265,0.0016015905,0.000008169837,0.0006821708,0.00082428526],"genre_scores_gemma":[0.47857603,0.000005419532,0.5197259,0.0005247049,0.0005253238,0.00005845974,0.000029588864,0.000051965693,0.0005025587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963945,0.00007374964,0.000590999,0.0016144365,0.00079930836,0.00052701554],"domain_scores_gemma":[0.9969148,0.00026429197,0.0006403358,0.0012607584,0.0007841162,0.00013569355],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013204393,0.00049647805,0.00053033547,0.0007409293,0.00035489377,0.0011261316,0.0027388684,0.00027723922,0.0000030229849],"category_scores_gemma":[0.000102468264,0.00044107842,0.0001318122,0.0006358263,0.00020232906,0.0015334117,0.00036679357,0.0005180801,0.000008830603],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022110024,0.00017242228,0.000021563277,0.00008663869,0.000013659354,0.00005034397,0.00205904,0.0001070985,0.0031035817,0.014459101,0.000025152249,0.97987926],"study_design_scores_gemma":[0.00070263626,0.00253117,0.00037090285,0.0007493005,0.000038367907,0.000107299136,0.000015151014,0.872435,0.08200751,0.038549975,0.0010656453,0.0014270406],"about_ca_topic_score_codex":0.0000076197957,"about_ca_topic_score_gemma":0.000015885467,"teacher_disagreement_score":0.97845227,"about_ca_system_score_codex":0.0005133268,"about_ca_system_score_gemma":0.00035631296,"threshold_uncertainty_score":0.9999108},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004743294,0.001185463,0.99178183,0.00020591303,0.001022478,0.00025649287,0.0000073075416,0.00005388763,0.0007433209],"genre_scores_gemma":[0.82516295,0.000019284289,0.17390634,0.0005974953,0.00017714206,0.000005036105,0.00001516005,0.000017484554,0.00009912373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701655,0.000040555966,0.00061942445,0.000877262,0.000838001,0.0006082107],"domain_scores_gemma":[0.99823546,0.0004052936,0.00033038945,0.0007006751,0.00019916885,0.00012899395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011604351,0.00036551896,0.0004777298,0.0014230551,0.00024236621,0.00040889884,0.0015015282,0.00023152861,0.000019604937],"category_scores_gemma":[0.00007291856,0.00035687065,0.00011509129,0.0012175024,0.00041296094,0.000862407,0.0004549338,0.0004810732,0.000011790044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024259309,0.00031745213,0.0033116282,0.0002419599,0.00002983467,0.00013684004,0.011258358,0.104847714,0.0024691368,0.24737953,0.00006916914,0.6299141],"study_design_scores_gemma":[0.00066917425,0.00019191395,0.0033228144,0.00072508,0.000011383122,0.00008083071,8.82008e-7,0.5318652,0.0039246827,0.4568021,0.0014901719,0.0009157865],"about_ca_topic_score_codex":0.000022133903,"about_ca_topic_score_gemma":0.0001602079,"teacher_disagreement_score":0.82041967,"about_ca_system_score_codex":0.00016699528,"about_ca_system_score_gemma":0.00054595654,"threshold_uncertainty_score":0.9998883},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017741461,0.000987989,0.9918095,0.00031064393,0.0011675094,0.00027160242,0.00003058183,0.00016694366,0.0050778426],"genre_scores_gemma":[0.44499946,0.000056741406,0.55285597,0.0007301107,0.00029046237,0.000007743254,0.000011378318,0.000054682747,0.0009934334],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625826,0.00004595216,0.00062375295,0.0012670252,0.0012126022,0.00059240015],"domain_scores_gemma":[0.9968098,0.00028779102,0.0004701218,0.0018523419,0.00037404345,0.00020594464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012749077,0.0004748247,0.00068196625,0.00047232967,0.00011896738,0.00023857091,0.0043684873,0.00017856715,0.000022653032],"category_scores_gemma":[0.00007515504,0.00041714197,0.00012647873,0.0005518316,0.0019384836,0.0006011689,0.0017263094,0.0005545168,0.00003226692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013872598,0.00005651883,0.00004991454,0.00009624305,0.000016400625,0.000070385875,0.0012394708,0.012450254,0.0001821332,0.35492048,0.000117990574,0.6307863],"study_design_scores_gemma":[0.00020347293,0.00012456033,0.00010238176,0.00029800832,0.0000037397988,0.000027343942,1.12676176e-7,0.23212406,0.0011793266,0.7634898,0.0020031142,0.00044409797],"about_ca_topic_score_codex":0.00003283313,"about_ca_topic_score_gemma":0.0000715792,"teacher_disagreement_score":0.63034225,"about_ca_system_score_codex":0.00024931866,"about_ca_system_score_gemma":0.00059247727,"threshold_uncertainty_score":0.99982804},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012651077,0.0006257849,0.99535674,0.00066941883,0.00016959239,0.00040997256,7.902531e-7,0.00011504607,0.0013875295],"genre_scores_gemma":[0.9763404,0.00004213156,0.01976353,0.0024036944,0.0011712088,0.000054482203,0.000009723839,0.00004848514,0.00016635914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770385,0.0000035277073,0.00032604882,0.00091365486,0.00059121166,0.00046168262],"domain_scores_gemma":[0.9990286,0.00003438478,0.00022974581,0.00036156728,0.00030487703,0.000040781444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001027174,0.00039109474,0.0003474896,0.0010120053,0.0002748685,0.00046681895,0.0007121637,0.00016235988,0.0000066196367],"category_scores_gemma":[0.000039566727,0.00036217924,0.000056567595,0.0008469502,0.00008773717,0.0007892419,0.00052639097,0.0002799256,0.00003526729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045610236,0.000013919435,0.00013493621,0.0003485889,0.000009025071,0.0000020056395,0.000084584244,0.35442182,0.000021688375,0.0017419939,0.0000029701869,0.6432139],"study_design_scores_gemma":[0.00008601423,0.0000029969715,0.00003760673,0.0004946994,0.000055669134,8.05536e-7,7.413476e-7,0.94550854,0.000029846502,0.05293626,0.00041916675,0.0004276486],"about_ca_topic_score_codex":0.000018894207,"about_ca_topic_score_gemma":0.000022934451,"teacher_disagreement_score":0.9755932,"about_ca_system_score_codex":0.000072021096,"about_ca_system_score_gemma":0.00003449229,"threshold_uncertainty_score":0.999883},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002073294,0.00042504762,0.97862875,0.0012245289,0.0023570587,0.0004010393,0.000006183099,0.00007217944,0.016677901],"genre_scores_gemma":[0.39603174,0.00020065064,0.5760153,0.014777073,0.00057846855,0.000048860104,0.00002138856,0.00015406824,0.012172496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962006,0.00003498886,0.00047921835,0.0016528076,0.00078842486,0.0008439664],"domain_scores_gemma":[0.99723834,0.0003940488,0.00029214186,0.0014977342,0.00040525242,0.00017249463],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035644506,0.00064361375,0.0005412253,0.00095311244,0.0002223551,0.000767075,0.0041396404,0.00030410534,0.00020425205],"category_scores_gemma":[0.00006275545,0.0005677305,0.00020231408,0.00052365253,0.0005640474,0.0014822842,0.0017486921,0.0009986506,0.0011460749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003794685,0.0002450842,0.00017409597,0.00022294871,0.00020762133,0.00064494595,0.0042828256,0.030553881,0.047811475,0.10804151,0.00432611,0.80345154],"study_design_scores_gemma":[0.00067125587,0.0006472771,0.0007721316,0.0014377874,0.000028872393,0.00019258056,0.0000017228365,0.81627995,0.036562394,0.111982755,0.028596945,0.0028263174],"about_ca_topic_score_codex":0.000035018653,"about_ca_topic_score_gemma":0.000038262257,"teacher_disagreement_score":0.80062526,"about_ca_system_score_codex":0.00040124933,"about_ca_system_score_gemma":0.0002748006,"threshold_uncertainty_score":0.9996774},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007233206,0.001006272,0.99171674,0.00027851536,0.0037887252,0.0007881203,0.000006972277,0.00036898185,0.0013223494],"genre_scores_gemma":[0.20336685,0.000060065075,0.79404235,0.000996814,0.00096980453,0.00006792311,0.000007052545,0.00004742184,0.00044172598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99541616,0.00001940636,0.0006767147,0.0019097442,0.0008763364,0.0011016307],"domain_scores_gemma":[0.99483776,0.0023022015,0.000398111,0.0019144459,0.00035340514,0.00019408547],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001334379,0.00072141975,0.0008677113,0.00072375324,0.00047738387,0.001254552,0.004460519,0.0006617419,0.00002972619],"category_scores_gemma":[0.0006414063,0.0006231846,0.00028053494,0.00054603996,0.000803237,0.00059352344,0.0012839198,0.0008530808,0.00003893256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015009898,0.000028860712,0.00050209154,0.00022881188,0.00003084702,0.00005583399,0.00091057224,0.027220385,0.00006768758,0.31128374,0.000063495674,0.6595927],"study_design_scores_gemma":[0.00028900758,0.00030345895,0.00022025882,0.00089195586,0.000013976386,0.00008400748,3.5299237e-7,0.6297771,0.0006452526,0.36161953,0.005322518,0.00083263556],"about_ca_topic_score_codex":0.00001650202,"about_ca_topic_score_gemma":0.000054387107,"teacher_disagreement_score":0.65876,"about_ca_system_score_codex":0.00019339996,"about_ca_system_score_gemma":0.0005250827,"threshold_uncertainty_score":0.99978226},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15239447,0.00065622147,0.84350455,0.00096958235,0.0019460687,0.00044883596,0.0000033123142,0.000064528,0.000012436202],"genre_scores_gemma":[0.87376106,0.0000059307276,0.12587522,0.00023011836,0.000100994584,0.000016156726,3.716578e-7,0.000008956853,0.0000011980023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668825,0.00021152885,0.000629011,0.0009404239,0.0010978137,0.00043299232],"domain_scores_gemma":[0.99667215,0.0001829656,0.00048318444,0.0021704119,0.00040199474,0.000089313864],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002197734,0.00030251924,0.00055437547,0.0002833494,0.00008339542,0.00017230705,0.007532804,0.00021776113,0.0000019471972],"category_scores_gemma":[0.0004324429,0.00018326174,0.00016631428,0.0016288873,0.00077192445,0.00027875302,0.008463095,0.0006899673,0.0000015220123],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033882672,0.00035833556,0.000592682,0.00047879157,0.00002952924,0.000009594865,0.0060804244,0.1238919,0.02811618,0.0089348825,0.000040924144,0.8314329],"study_design_scores_gemma":[0.00018633601,0.00006276565,0.00047438635,0.0006965286,0.0000053931994,0.000013987218,9.960445e-7,0.6013821,0.25145495,0.1454806,0.000013808774,0.00022814893],"about_ca_topic_score_codex":0.00007375212,"about_ca_topic_score_gemma":0.000025605617,"teacher_disagreement_score":0.8312047,"about_ca_system_score_codex":0.00012569461,"about_ca_system_score_gemma":0.0013066514,"threshold_uncertainty_score":0.99955624},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002406249,0.0012827053,0.99236935,0.0008019222,0.0015047787,0.00040871336,0.0000031216869,0.00020214035,0.0010210397],"genre_scores_gemma":[0.65494776,0.00004931483,0.34348744,0.0005421952,0.000470143,0.000009902329,0.0000019429,0.00005492541,0.0004363627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960858,0.000038546117,0.00073050364,0.001397185,0.0010274549,0.000720488],"domain_scores_gemma":[0.99724114,0.00025860092,0.00044547045,0.0015360219,0.00034980252,0.00016896795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006387548,0.0006075708,0.0007557605,0.00086698576,0.00021938123,0.00040377417,0.004011636,0.00030579793,0.00002323309],"category_scores_gemma":[0.00008281361,0.0004657187,0.00018663362,0.00057508925,0.0009998708,0.0004420835,0.0017869354,0.00086824445,0.00007023532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053484528,0.000056657434,0.000028012166,0.00019762204,0.000028282893,0.00005089947,0.0019049502,0.08758849,0.002177613,0.044877354,0.000049055758,0.86303574],"study_design_scores_gemma":[0.0001483096,0.00019072529,0.00004795817,0.00088455586,0.000004963926,0.00007669877,1.5362097e-7,0.8803893,0.007472109,0.109665744,0.00056393037,0.0005555869],"about_ca_topic_score_codex":0.000072384406,"about_ca_topic_score_gemma":0.000009001886,"teacher_disagreement_score":0.8624801,"about_ca_system_score_codex":0.000101523736,"about_ca_system_score_gemma":0.00049990235,"threshold_uncertainty_score":0.99977946},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036669523,0.00016078098,0.9954184,0.00020724282,0.00072427985,0.00023971125,0.0000035535977,0.00012063963,0.0027586613],"genre_scores_gemma":[0.6074709,0.000019414481,0.38882557,0.0008949405,0.00087995187,0.00001639062,0.000077543045,0.00004713963,0.0017681126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746656,0.00003328495,0.0002792258,0.000892623,0.0009772063,0.00035111696],"domain_scores_gemma":[0.99866927,0.00011959373,0.0002520371,0.00038942345,0.00042590112,0.00014375566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041052033,0.00032473195,0.00027292522,0.0005432276,0.00036718496,0.000622386,0.0008512163,0.00017871028,0.00007141077],"category_scores_gemma":[0.000029151242,0.0002748347,0.00004899924,0.00032332324,0.0005062666,0.00077506,0.0002762115,0.00064558245,0.00006121484],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021811293,0.000023010505,0.00011761604,0.000031540803,0.000026421329,0.000079205965,0.001275239,0.09379173,0.00077305344,0.013926924,0.00007982688,0.8898536],"study_design_scores_gemma":[0.0017320507,0.0009359624,0.00052582216,0.00056387717,0.00003110743,0.00045742004,0.0000016970444,0.6553658,0.0075821006,0.32368243,0.0075428532,0.0015789005],"about_ca_topic_score_codex":0.000009859821,"about_ca_topic_score_gemma":0.0000685989,"teacher_disagreement_score":0.8882747,"about_ca_system_score_codex":0.00030763226,"about_ca_system_score_gemma":0.0005388393,"threshold_uncertainty_score":0.9999704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017159893,0.0004998921,0.9890095,0.0006896509,0.0011059603,0.0009838874,0.000017111164,0.0008562577,0.0068205674],"genre_scores_gemma":[0.01669448,0.000086044136,0.9798646,0.001306989,0.0005477588,0.0001381205,0.00003175126,0.000056786244,0.0012734463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587256,0.00003986823,0.0007052315,0.0017480911,0.00078861916,0.0008456364],"domain_scores_gemma":[0.99699306,0.0003748027,0.00042933715,0.0014294368,0.00054651266,0.0002268493],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00059464056,0.00068562716,0.00064865965,0.0009496954,0.00045675944,0.0017000153,0.0034084443,0.00041154315,0.000067474335],"category_scores_gemma":[0.000065390435,0.0006329314,0.00025138655,0.0005921722,0.00063412916,0.001378756,0.00088476954,0.0006172072,0.00007224567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015464968,0.000097729426,0.00001707993,0.00014113863,0.000042600237,0.000038385708,0.0014049235,0.5308472,0.00010258023,0.19475986,0.0034043565,0.26912865],"study_design_scores_gemma":[0.00035122366,0.00023985573,0.00005684119,0.0003121451,0.000008567037,0.000029543178,5.921302e-7,0.64156723,0.0003893456,0.35393724,0.0022265776,0.0008808417],"about_ca_topic_score_codex":0.00003244907,"about_ca_topic_score_gemma":0.00003383757,"teacher_disagreement_score":0.2682478,"about_ca_system_score_codex":0.0002146705,"about_ca_system_score_gemma":0.0006867975,"threshold_uncertainty_score":0.9996122},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007958322,0.0031316932,0.9844202,0.00021564058,0.00210535,0.00041861925,0.000021442516,0.00013981145,0.009467677],"genre_scores_gemma":[0.33293125,0.000057292727,0.6659016,0.0001782035,0.0007207449,0.000014523776,0.000020237612,0.00005238771,0.00012377842],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957859,0.00005299318,0.00067890115,0.0015975783,0.0011540141,0.0007306369],"domain_scores_gemma":[0.9955578,0.0005646952,0.00043266857,0.002680294,0.0004897524,0.00027481097],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001633333,0.0005478568,0.00068553654,0.0009962249,0.00025304206,0.00048849196,0.0076485723,0.0003056333,0.000020805097],"category_scores_gemma":[0.00034994903,0.0005050107,0.00018845338,0.0012691508,0.00095358136,0.0012497739,0.0051396466,0.000845295,0.000013827445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001385355,0.00010872374,0.00020449338,0.00025901955,0.000022394459,0.000060219543,0.0045266384,0.002427115,0.00008914332,0.35661355,0.00031036482,0.6353645],"study_design_scores_gemma":[0.00031748577,0.00017442924,0.00005661668,0.0009396178,0.000010961806,0.00003500925,3.4658623e-7,0.18229789,0.0017856521,0.78932285,0.024265507,0.00079362636],"about_ca_topic_score_codex":0.00002066308,"about_ca_topic_score_gemma":0.00014275292,"teacher_disagreement_score":0.63457084,"about_ca_system_score_codex":0.00026280186,"about_ca_system_score_gemma":0.00091262127,"threshold_uncertainty_score":0.9997401},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013663968,0.005243752,0.9828214,0.00013862488,0.003929013,0.00041343312,5.898194e-7,0.0001760286,0.0072634704],"genre_scores_gemma":[0.5250955,0.00011933151,0.44054508,0.0017319861,0.0041684904,0.00009548297,0.000022840451,0.00011489053,0.028106365],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692965,0.00003164617,0.0005073889,0.0010487604,0.0009510753,0.0005314597],"domain_scores_gemma":[0.9979254,0.00021206976,0.00042043306,0.001029623,0.00027518868,0.00013728417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065592746,0.00039419162,0.00050030823,0.00059706846,0.00008547343,0.00019114104,0.0020253446,0.00028752812,0.000057944977],"category_scores_gemma":[0.000055711953,0.00033164397,0.00016014618,0.00024024521,0.0007389603,0.00065957103,0.0007518225,0.00049731927,0.00010563577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018649608,0.0000330756,0.00004171569,0.00008516136,0.000014660437,0.000033422308,0.0007779219,0.00083767355,0.00013037355,0.32550624,0.00026403484,0.6722739],"study_design_scores_gemma":[0.0008658368,0.0008541842,0.00041968052,0.0003172075,0.00003414447,0.0002652946,0.000002120373,0.123758934,0.001021671,0.65077823,0.21943907,0.0022436134],"about_ca_topic_score_codex":0.000105171144,"about_ca_topic_score_gemma":0.000028291786,"teacher_disagreement_score":0.67003024,"about_ca_system_score_codex":0.0005690434,"about_ca_system_score_gemma":0.000786513,"threshold_uncertainty_score":0.9999136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007131547,0.000074460244,0.9836662,0.0005829108,0.0009186085,0.0005978013,0.000002105362,0.00021763949,0.013227164],"genre_scores_gemma":[0.4896194,0.0000049678742,0.50752753,0.0012308996,0.00048287373,0.000121705714,0.000017506254,0.00004423694,0.0009508658],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757177,0.000032891538,0.00058286014,0.0010230591,0.000317837,0.0004715945],"domain_scores_gemma":[0.99782187,0.0010377937,0.00038534828,0.00047367928,0.0002312744,0.00005002235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077245646,0.00035113687,0.00047758388,0.0012997355,0.00014374226,0.000069216025,0.0007397695,0.0008646825,0.00031607357],"category_scores_gemma":[0.0007724371,0.0003344248,0.00008162893,0.0005490621,0.00055483676,0.000074323216,0.00016553565,0.0015375925,0.000016665059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000123470545,0.000018229764,0.0017980599,0.000016152775,0.0000060206225,0.000006021908,0.001658606,0.0006720683,0.0000898364,0.2669205,0.000014378548,0.7287878],"study_design_scores_gemma":[0.00035617757,0.00038775976,0.0005374506,0.0013162001,0.0000058069427,0.000023229644,0.000012412811,0.0034620008,0.0024106514,0.98024213,0.010539954,0.0007062391],"about_ca_topic_score_codex":0.000009008759,"about_ca_topic_score_gemma":0.000032040807,"teacher_disagreement_score":0.7280815,"about_ca_system_score_codex":0.00019716911,"about_ca_system_score_gemma":0.00014048629,"threshold_uncertainty_score":0.9999108},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008742286,0.0032793921,0.9950093,0.00026461837,0.00020758393,0.00041903986,0.000038671667,0.000047797734,0.00064616377],"genre_scores_gemma":[0.23414218,0.00016592524,0.7651794,0.00012206645,0.00022466276,0.00003309594,0.00002176329,0.000017938788,0.000092980066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975213,0.00007518112,0.00056558894,0.00079471996,0.0006551523,0.0003880838],"domain_scores_gemma":[0.997734,0.00050047075,0.0005460306,0.00057220994,0.00049895194,0.00014831443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009213437,0.00033780726,0.0005441274,0.00043367283,0.00020495823,0.00008952649,0.0013658648,0.0002586326,0.000013161852],"category_scores_gemma":[0.00013765582,0.0002992139,0.00009693925,0.000645072,0.00040969794,0.00039344022,0.0005812824,0.00050657225,0.0000018467878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047097883,0.00005796268,0.00010847914,0.00015529685,0.000023263088,0.0000017055171,0.00069309457,0.0036627897,0.0015256921,0.7167741,0.000005683302,0.2769872],"study_design_scores_gemma":[0.0003689621,0.00010649388,0.0004733945,0.0002538842,0.000045335877,0.000046341993,1.5244723e-7,0.37741593,0.010207958,0.6091498,0.0013120015,0.00061973446],"about_ca_topic_score_codex":0.00000673558,"about_ca_topic_score_gemma":0.000002750161,"teacher_disagreement_score":0.37375313,"about_ca_system_score_codex":0.00005904373,"about_ca_system_score_gemma":0.0003409995,"threshold_uncertainty_score":0.999946},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001539662,0.00008724555,0.9948789,0.00006685593,0.0011719064,0.00015844115,0.0000069271823,0.0000944824,0.0019955635],"genre_scores_gemma":[0.90236163,0.000028290804,0.09693086,0.00016684158,0.00035495393,0.0000067676315,0.000039521456,0.000043831817,0.00006731656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987193,0.000013577726,0.00038283347,0.0003470764,0.00034036988,0.00019687627],"domain_scores_gemma":[0.9992146,0.000083650135,0.00007876405,0.00038206883,0.0001633245,0.00007758884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030362964,0.00022399596,0.00026524972,0.0006282419,0.000029800241,0.000085411935,0.00045593551,0.0001513252,0.000047686473],"category_scores_gemma":[0.000013694203,0.00023251581,0.00004024495,0.00027157317,0.00015009206,0.00088738883,0.00008125276,0.0004269894,0.000017088449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024992694,0.000013864218,0.000032522286,0.000021870774,0.0000031392553,0.000004749095,0.0007886079,0.81452656,0.00017322211,0.0017005518,0.000017184107,0.18271522],"study_design_scores_gemma":[0.00013650936,0.000059667815,0.00011325353,0.00016354551,0.000003096861,0.000005380032,6.7133317e-7,0.9792399,0.00017616055,0.019437559,0.00044156832,0.00022270666],"about_ca_topic_score_codex":0.000008476449,"about_ca_topic_score_gemma":0.00044916235,"teacher_disagreement_score":0.9008219,"about_ca_system_score_codex":0.00024165238,"about_ca_system_score_gemma":0.000107201726,"threshold_uncertainty_score":0.9481719},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003931101,0.0001176589,0.9924688,0.003926067,0.0006892606,0.0013838697,0.00009062352,0.00011300185,0.0008176077],"genre_scores_gemma":[0.7691179,0.000009567629,0.22910483,0.00069103274,0.00030898317,0.0001453682,0.000016115375,0.000044376335,0.0005618545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959739,0.00013656802,0.0010879858,0.0012870884,0.001043533,0.00047096662],"domain_scores_gemma":[0.99335194,0.0023715727,0.0008644727,0.0026619942,0.0005906603,0.00015937109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018179319,0.0003842996,0.0005450487,0.00063552166,0.0002821081,0.00025600917,0.0037490076,0.00025157537,0.0000016358501],"category_scores_gemma":[0.00054204196,0.00029101557,0.00014159533,0.0010751372,0.0007299594,0.0005023269,0.0021048996,0.00064384064,0.000014695181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012393431,0.00013947491,0.00002073281,0.00047540318,0.000073122595,0.00002738165,0.0050514913,0.56065667,0.00389495,0.1104586,0.0026092061,0.31646904],"study_design_scores_gemma":[0.0003722615,0.0009845434,0.0014442152,0.0023543793,0.000027903934,0.00010329184,0.0000057548955,0.9615765,0.012463103,0.017367212,0.002611313,0.0006894837],"about_ca_topic_score_codex":0.0006290603,"about_ca_topic_score_gemma":0.00007527093,"teacher_disagreement_score":0.76872474,"about_ca_system_score_codex":0.00030640978,"about_ca_system_score_gemma":0.00046795807,"threshold_uncertainty_score":0.9999542},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000092291,0.00087531446,0.98894656,0.0013984042,0.0028252797,0.0005387944,0.000004643772,0.00025134222,0.005150424],"genre_scores_gemma":[0.02403839,0.000101082835,0.9715639,0.002059368,0.0006044263,0.000050590057,0.0000038743115,0.000045460078,0.0015329232],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663776,0.000014506906,0.00045856868,0.0014961777,0.00059644855,0.000796509],"domain_scores_gemma":[0.99711686,0.00067580177,0.00022839155,0.0014550122,0.0003825118,0.0001414058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005993242,0.00053243403,0.0005910044,0.0005288507,0.00035147302,0.00041469984,0.0039543044,0.0003742583,0.000028108432],"category_scores_gemma":[0.00023415656,0.000446709,0.00017388693,0.0004010065,0.0008360461,0.00052065734,0.0012945434,0.00042505586,0.000044097615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017985949,0.000047905163,0.00006391502,0.00012396653,0.00003423205,0.00010099712,0.0028868427,0.0038767608,0.000014980976,0.42621744,0.00030409664,0.5663109],"study_design_scores_gemma":[0.00041728487,0.0003425478,0.0001415118,0.00025664092,0.00001564259,0.00008040833,3.7035412e-7,0.3204769,0.00058003055,0.65120673,0.025538446,0.00094349496],"about_ca_topic_score_codex":0.00007040173,"about_ca_topic_score_gemma":0.0005065067,"teacher_disagreement_score":0.5653674,"about_ca_system_score_codex":0.0001325657,"about_ca_system_score_gemma":0.0005257348,"threshold_uncertainty_score":0.9997985},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015675692,0.000074983334,0.99060214,0.0020904748,0.0004907096,0.00049151835,0.000013098488,0.0002634952,0.0059578856],"genre_scores_gemma":[0.05745155,0.000016755212,0.9377017,0.002583826,0.00094791135,0.000057031804,0.00002260756,0.000056829766,0.001161811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967892,0.000051021754,0.00035430022,0.0013098785,0.00086799863,0.0006276077],"domain_scores_gemma":[0.99753094,0.00035830535,0.0002477048,0.0014987119,0.00013525737,0.00022907695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059716403,0.00050402,0.00042780678,0.00044573913,0.000364685,0.000395752,0.001966896,0.00025203775,0.000032833683],"category_scores_gemma":[0.000012606677,0.00038464612,0.000092939226,0.0006710778,0.00048032354,0.0006695813,0.00038628947,0.0007034257,0.0000646805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022480677,0.00005420538,0.000015292639,0.000019718102,0.000009444534,0.00001953469,0.00017810285,0.45884302,0.00013525973,0.03337957,0.00009345626,0.5072299],"study_design_scores_gemma":[0.00020563847,0.0003027336,0.00013007189,0.00022389536,0.000011631497,0.00004860796,4.029348e-8,0.9769663,0.0007987376,0.017827122,0.0030271306,0.00045809342],"about_ca_topic_score_codex":0.000007667496,"about_ca_topic_score_gemma":0.000013656749,"teacher_disagreement_score":0.51812327,"about_ca_system_score_codex":0.00016077017,"about_ca_system_score_gemma":0.00026525595,"threshold_uncertainty_score":0.9998605},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000064698004,0.0008685334,0.98996335,0.00008879129,0.00363301,0.00011636557,0.0000024765,0.00012369141,0.005139095],"genre_scores_gemma":[0.9456285,0.0033476658,0.039142,0.001177496,0.0036633443,0.000020373454,0.000029499119,0.00026026796,0.0067308126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893445,0.0000018699296,0.00018021297,0.0003016642,0.00031031715,0.00027150326],"domain_scores_gemma":[0.99940544,0.00006934437,0.000038844923,0.0003979798,0.000043653752,0.00004473548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019902397,0.00020957008,0.00013763217,0.00016608674,0.0001528271,0.00016135546,0.0004824735,0.00017045824,0.000043312815],"category_scores_gemma":[0.000004700139,0.00014165496,0.00005294991,0.00016747549,0.00014872749,0.00006289651,0.00009246472,0.00037384353,0.00003575343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019295621,0.0000027853018,0.0000038456687,0.000012210219,0.000008970069,0.000015518439,0.000042303833,0.06348073,0.00008251696,0.009822626,0.000070754446,0.9264558],"study_design_scores_gemma":[0.000041306135,0.000024284816,0.000026479389,0.0000510862,0.0000051218694,0.000012819286,2.3577696e-8,0.9113148,0.0000813953,0.05645457,0.031773012,0.0002151338],"about_ca_topic_score_codex":0.0000015825564,"about_ca_topic_score_gemma":0.000040441704,"teacher_disagreement_score":0.95082134,"about_ca_system_score_codex":0.00013544445,"about_ca_system_score_gemma":0.000023048098,"threshold_uncertainty_score":0.57765216},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013071099,0.00030833692,0.99564606,0.0004923572,0.00044464177,0.0004986662,0.0000041272733,0.00019434407,0.0022807515],"genre_scores_gemma":[0.033154737,0.00024872398,0.9650743,0.0009666598,0.00026215773,0.000013836773,0.0000064250817,0.000033270797,0.00023986059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973994,0.000030509766,0.00042847916,0.001077055,0.0006324838,0.00043209846],"domain_scores_gemma":[0.99851567,0.00017021045,0.00021600744,0.00070957013,0.00024484942,0.00014368673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069133687,0.00038846038,0.00037172504,0.0005965887,0.00023778208,0.0006978426,0.0011966455,0.00031091768,0.000039566217],"category_scores_gemma":[0.000049357805,0.0003222521,0.00008375218,0.00044956536,0.0005242224,0.0011191951,0.00037868784,0.00055339903,0.000032491353],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026732373,0.00001136641,0.0000035460184,0.0000319154,0.0000051896814,0.000016277249,0.00028628923,0.000027979695,0.0014052535,0.0055951527,0.0000041774483,0.99261016],"study_design_scores_gemma":[0.00024067165,0.000175148,0.000056960744,0.00046483206,0.000013308175,0.000202478,2.8273584e-7,0.5402998,0.03126569,0.42574534,0.00077455264,0.0007609218],"about_ca_topic_score_codex":0.000047141046,"about_ca_topic_score_gemma":0.000011709538,"teacher_disagreement_score":0.99184924,"about_ca_system_score_codex":0.00019133785,"about_ca_system_score_gemma":0.00033026736,"threshold_uncertainty_score":0.99992293},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005510576,0.00011276719,0.9904778,0.0011491622,0.006312659,0.0009520239,0.000095781965,0.000045402052,0.0003033426],"genre_scores_gemma":[0.9824027,0.0000014520102,0.011681145,0.00027109112,0.0021406768,0.0018839046,0.00038556106,0.000079067075,0.0011544003],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646354,0.00033614563,0.0006453047,0.0011260044,0.00094585115,0.00048314195],"domain_scores_gemma":[0.9966752,0.0014496729,0.0005942246,0.00075736275,0.0003763331,0.00014720236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002136148,0.00044677482,0.00037038728,0.00030908242,0.00067383377,0.0001618703,0.00086763344,0.00038991513,0.00047302502],"category_scores_gemma":[0.00015040414,0.00034758265,0.00018310745,0.00018863549,0.0008000315,0.00036009323,0.00012369065,0.0005162402,0.000038004062],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019672881,0.00022361566,0.0000031143097,0.000015285428,0.000073295836,0.0000070388382,0.006074226,0.054422658,0.00001723154,0.10549686,0.00143953,0.8320304],"study_design_scores_gemma":[0.0027001332,0.00580139,0.00018231945,0.0006379472,0.00015490863,0.00002490559,0.00067549426,0.34119338,0.005796904,0.6176346,0.023680806,0.0015172312],"about_ca_topic_score_codex":0.00004248019,"about_ca_topic_score_gemma":0.00009223053,"teacher_disagreement_score":0.98185164,"about_ca_system_score_codex":0.00050167186,"about_ca_system_score_gemma":0.00028340635,"threshold_uncertainty_score":0.9998976},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08058238,0.00026534204,0.9112366,0.000027151673,0.0020688034,0.0004571565,0.000017351149,0.000024186473,0.0053210184],"genre_scores_gemma":[0.99324936,0.0000013409453,0.0059383526,0.00012031589,0.0004172417,0.0000015905399,6.429577e-7,0.000020792924,0.00025034798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99377847,0.00016376597,0.0011216057,0.001137598,0.0033399882,0.0004586018],"domain_scores_gemma":[0.989233,0.00786473,0.0009196121,0.0014718102,0.0004214947,0.000089353045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052229753,0.0004232867,0.00073873805,0.00090721936,0.0005269438,0.00037487078,0.0027487853,0.00019593762,0.00017650753],"category_scores_gemma":[0.001219347,0.00023124949,0.00023754746,0.00074635755,0.0007521857,0.0002636383,0.001049645,0.000617725,0.000054849334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039492308,0.000008397998,0.0047338908,0.000023776136,0.0000072447447,0.000010485315,0.00045059595,0.5806964,0.000075853895,0.0016487623,0.000013720201,0.41229138],"study_design_scores_gemma":[0.0002846352,0.00053839106,0.002975854,0.0014730784,0.000008843411,0.00004023495,7.323608e-7,0.93817115,0.00086706784,0.05486058,0.000397923,0.00038150288],"about_ca_topic_score_codex":0.000026418335,"about_ca_topic_score_gemma":0.000027745553,"teacher_disagreement_score":0.912667,"about_ca_system_score_codex":0.00011841729,"about_ca_system_score_gemma":0.00018329473,"threshold_uncertainty_score":0.94300807},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044295983,0.00016455246,0.9960443,0.00027134622,0.0017083485,0.00093005114,0.000007453939,0.00024676815,0.00018421708],"genre_scores_gemma":[0.19547485,0.000016399103,0.801589,0.0019497391,0.0006056289,0.00008513,0.000012655175,0.00005848406,0.00020811621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961571,0.000022982867,0.0007756216,0.0016064041,0.000615169,0.0008226869],"domain_scores_gemma":[0.99695057,0.000986607,0.0003543514,0.0012392577,0.00032304463,0.0001461459],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012717465,0.00052461086,0.00058004184,0.0008271349,0.00020147044,0.0006438428,0.0028541062,0.00039633267,0.00003497697],"category_scores_gemma":[0.0005328066,0.0005608788,0.00016880836,0.0005493749,0.00021790087,0.00095888285,0.0010495713,0.00089634035,0.000044562083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008918846,0.000049207287,0.00015415522,0.0003325116,0.000012391953,0.000050759252,0.003108795,0.02192526,0.0000958816,0.053495266,0.00016540445,0.9206014],"study_design_scores_gemma":[0.0005539457,0.00014715009,0.00008580687,0.00041876175,0.000004749348,0.00004638113,5.6973715e-7,0.9549156,0.00052285235,0.03816094,0.004369649,0.0007735978],"about_ca_topic_score_codex":0.000083036546,"about_ca_topic_score_gemma":0.000059574973,"teacher_disagreement_score":0.9329903,"about_ca_system_score_codex":0.0004652553,"about_ca_system_score_gemma":0.0006263281,"threshold_uncertainty_score":0.9996843},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003870047,0.0013237114,0.98838526,0.0006935304,0.001903848,0.0009814403,0.000009765861,0.00065780035,0.005657668],"genre_scores_gemma":[0.2104225,0.000034429067,0.7872946,0.000632137,0.00043283706,0.00010224179,0.0000047237395,0.000050992076,0.0010255313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951511,0.000042169824,0.00058577076,0.001966351,0.00094822067,0.0013063753],"domain_scores_gemma":[0.9961198,0.00096938707,0.00044691772,0.0017723308,0.0005114331,0.00018013641],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001055287,0.00074242626,0.0009823889,0.00060270977,0.0005380162,0.0012018966,0.0041658483,0.00044074949,0.000012462004],"category_scores_gemma":[0.00019788498,0.0005337786,0.0001704485,0.0004951193,0.00068874675,0.0009347337,0.0013021516,0.0005873246,0.00006206539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006365661,0.000111234986,0.0009832407,0.00092737365,0.00012560282,0.00035618787,0.0034917623,0.010864826,0.00014071689,0.45896795,0.0006250919,0.5233424],"study_design_scores_gemma":[0.0016667178,0.0012500497,0.0010563673,0.0042774198,0.00006339419,0.0006148867,0.000016673504,0.9017701,0.0029408794,0.07305131,0.010799441,0.0024927414],"about_ca_topic_score_codex":0.00013370982,"about_ca_topic_score_gemma":0.00043738188,"teacher_disagreement_score":0.89090526,"about_ca_system_score_codex":0.0003871217,"about_ca_system_score_gemma":0.00061123853,"threshold_uncertainty_score":0.99983495},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053227076,0.0016802234,0.9864865,0.000061542945,0.0041471636,0.00057587394,0.0000046708024,0.00018127091,0.006330479],"genre_scores_gemma":[0.5820809,0.00005145701,0.41457692,0.000054507967,0.0020166948,0.000012036782,0.0000031348345,0.00008025167,0.0011241237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951531,0.00009100115,0.000944047,0.0013851451,0.001524889,0.0009018119],"domain_scores_gemma":[0.99580777,0.0007236266,0.0007762921,0.0018975621,0.0005383435,0.00025643437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019185209,0.00063637417,0.0010198117,0.0009950453,0.00018211093,0.0005006407,0.0031791455,0.0004380398,0.000008638647],"category_scores_gemma":[0.00009501509,0.00059261895,0.00019209736,0.00068844756,0.00052422285,0.0011731443,0.0014742482,0.00073698815,0.00027051498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002331382,0.00014805878,0.002214746,0.00081851176,0.00021049677,0.0003642372,0.0072673066,0.26132342,0.021808313,0.038206227,0.00004001059,0.66757536],"study_design_scores_gemma":[0.0005785552,0.00033238032,0.0010444564,0.005450898,0.000051188563,0.00045642036,0.0000023944542,0.9473701,0.032668542,0.009016339,0.000711556,0.0023171846],"about_ca_topic_score_codex":0.00010173677,"about_ca_topic_score_gemma":0.0000020561329,"teacher_disagreement_score":0.68604666,"about_ca_system_score_codex":0.00039519064,"about_ca_system_score_gemma":0.00045667583,"threshold_uncertainty_score":0.9996525},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002594768,0.002484455,0.9937398,0.00025272428,0.0012858238,0.0016331034,0.00007718151,0.00018629797,0.00031469195],"genre_scores_gemma":[0.83461404,0.000022812614,0.16358171,0.00052639586,0.0010301461,0.000046292564,0.0000050562253,0.0000952518,0.00007828025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750316,0.000051973977,0.00048746367,0.0007240415,0.00046054262,0.0007728153],"domain_scores_gemma":[0.9971271,0.001758248,0.00017052793,0.00045554547,0.00023271858,0.00025584325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011882022,0.0006235133,0.0009019004,0.00032933682,0.00015515927,0.00018620111,0.00055831554,0.0004683002,0.00002911744],"category_scores_gemma":[0.00012537648,0.0005810291,0.0001262434,0.00010244493,0.0009785849,0.0002541214,0.00007778085,0.0005460888,0.000016964581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067963105,0.000020708527,0.00010531732,0.00013996492,0.00020198271,0.000021655473,0.00016809652,0.86499256,0.001889524,0.0017439924,0.000058538397,0.13058968],"study_design_scores_gemma":[0.0026795587,0.00014673917,0.0004098741,0.00027547596,0.00008384928,0.000049870403,4.3556523e-7,0.99105906,0.00019492673,0.0036259168,0.0007199847,0.0007543086],"about_ca_topic_score_codex":0.000004663355,"about_ca_topic_score_gemma":0.000037330326,"teacher_disagreement_score":0.8345881,"about_ca_system_score_codex":0.00034962044,"about_ca_system_score_gemma":0.00021057358,"threshold_uncertainty_score":0.9996641},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000072071845,0.0006062373,0.99542034,0.00037842666,0.0017354931,0.00057454704,0.0000019075203,0.00023624765,0.0009747178],"genre_scores_gemma":[0.14280678,0.00005282003,0.8540042,0.0019313176,0.00057357934,0.000025470068,0.000007453095,0.00005682882,0.0005415415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955527,0.00006442395,0.0006468705,0.0019235169,0.0006788955,0.0011335481],"domain_scores_gemma":[0.99682033,0.0010007706,0.00040536403,0.0011150143,0.00040449956,0.0002540355],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009277963,0.0007144587,0.00069930055,0.0005578576,0.00049468415,0.0013133336,0.0030771454,0.00056888774,0.00003746632],"category_scores_gemma":[0.00015800906,0.0006399736,0.00022417968,0.00046086346,0.00054322014,0.0007536898,0.0011918374,0.0012780369,0.000032229127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034444124,0.000010174194,0.000018832598,0.00002037025,0.000009043425,0.000011856477,0.00013773753,0.48745012,0.000041205854,0.007907501,0.000026807726,0.5043629],"study_design_scores_gemma":[0.00015643713,0.00018200141,0.000016157028,0.0003403814,0.0000103104385,0.00005038996,1.4834828e-7,0.8623847,0.000081632286,0.13571236,0.00038731063,0.0006781814],"about_ca_topic_score_codex":0.000035140434,"about_ca_topic_score_gemma":0.000015010214,"teacher_disagreement_score":0.5036847,"about_ca_system_score_codex":0.0002312518,"about_ca_system_score_gemma":0.00038044757,"threshold_uncertainty_score":0.9997234},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046265012,0.00019129665,0.99388635,0.00022175674,0.0020358155,0.0005430286,0.000001166897,0.0001646242,0.0024933268],"genre_scores_gemma":[0.8438928,0.000008340608,0.15332964,0.000369678,0.00073421944,0.000010727016,0.0000013469322,0.000048222988,0.0016049945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957581,0.000052342868,0.0004663445,0.0013939021,0.0014470111,0.000882274],"domain_scores_gemma":[0.9980238,0.00022175841,0.00034027034,0.0008687939,0.00028353528,0.00026185586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011688194,0.0005540114,0.0005043866,0.00086039025,0.00044180037,0.0007986204,0.00204525,0.0002023326,0.000012908651],"category_scores_gemma":[0.000030101033,0.0004617351,0.00010812877,0.00055581285,0.00020900504,0.00089886144,0.0010265576,0.0008291805,0.000108301596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026183918,0.00007428378,0.0040406347,0.00006267361,0.000085601816,0.00020402546,0.010165282,0.15406223,0.00058075483,0.5869449,0.000012366559,0.24374107],"study_design_scores_gemma":[0.0039675143,0.009134393,0.052573983,0.040736645,0.0002983259,0.0010563683,0.00016115296,0.61664236,0.008622858,0.2048341,0.043151677,0.018820647],"about_ca_topic_score_codex":0.000030672607,"about_ca_topic_score_gemma":0.000057335164,"teacher_disagreement_score":0.84343016,"about_ca_system_score_codex":0.0014438542,"about_ca_system_score_gemma":0.00021478644,"threshold_uncertainty_score":0.99978346},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019059668,0.0005136618,0.9974788,0.00021487838,0.00042400087,0.00051881804,0.0000022210745,0.0002674751,0.00038957116],"genre_scores_gemma":[0.15425666,0.00008283046,0.84429073,0.00029013449,0.00022353521,0.000016261012,0.000019774747,0.00005862165,0.00076147745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963462,0.00009152969,0.00044174428,0.0015099591,0.0009508486,0.0006597434],"domain_scores_gemma":[0.9976014,0.0003349687,0.00049116655,0.0008353918,0.00048776582,0.0002492943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050031097,0.000621426,0.00056856143,0.00071419514,0.00045701046,0.00060596113,0.0013538393,0.00027257903,0.000016475007],"category_scores_gemma":[0.00013568104,0.000523166,0.000055921642,0.0007919132,0.00089624326,0.0011902081,0.0009144356,0.0008218595,0.000010076044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003655717,0.00005804892,0.0033636983,0.00007093439,0.000023173689,0.000069515576,0.0020821893,0.2196853,0.00039609513,0.012285302,0.0000014373594,0.7619277],"study_design_scores_gemma":[0.0007643224,0.00025918675,0.0026637998,0.0004287779,0.00001457355,0.0001969676,0.0000010656463,0.9848639,0.0004757241,0.00915842,0.00028938134,0.0008838756],"about_ca_topic_score_codex":0.000024909277,"about_ca_topic_score_gemma":0.000051189658,"teacher_disagreement_score":0.7651786,"about_ca_system_score_codex":0.00023484572,"about_ca_system_score_gemma":0.0003438608,"threshold_uncertainty_score":0.999722},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044118275,0.00034085798,0.98185664,0.0004916009,0.0027652432,0.00022683562,0.0000010286532,0.00034359007,0.01353304],"genre_scores_gemma":[0.6553971,0.00027334277,0.3375961,0.0014966276,0.0023937281,0.000015045257,0.000011081802,0.00008855399,0.002728442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960865,0.00005226652,0.00051769736,0.0017158259,0.0009784878,0.00064926833],"domain_scores_gemma":[0.9974541,0.0006820702,0.0002857178,0.0011812571,0.00023507174,0.00016176807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006587709,0.00049022306,0.00044689418,0.0007017702,0.00037947096,0.0007485052,0.0030797855,0.0003774269,0.00013856056],"category_scores_gemma":[0.00019765455,0.000478902,0.00014374538,0.00064019545,0.0006308832,0.000800058,0.0011974131,0.001332884,0.00039963188],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002890041,0.000013368609,0.00022585448,0.0000043314544,0.0000064479273,0.0000787001,0.0010698707,0.08268507,0.00020525718,0.0067786966,0.000013199418,0.9089163],"study_design_scores_gemma":[0.000053740067,0.00018362845,0.000098964454,0.00022846255,0.00000593774,0.00004083651,4.988133e-7,0.70206815,0.003770443,0.28593972,0.006993704,0.0006159235],"about_ca_topic_score_codex":0.00022954108,"about_ca_topic_score_gemma":0.00020504135,"teacher_disagreement_score":0.9083004,"about_ca_system_score_codex":0.00039185467,"about_ca_system_score_gemma":0.00032561272,"threshold_uncertainty_score":0.9997663},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000097301316,0.00070338644,0.99175334,0.0006405074,0.0015695452,0.0037711156,0.000010051141,0.00043960905,0.0010151571],"genre_scores_gemma":[0.7488707,0.000032315034,0.248326,0.0012195072,0.00054362096,0.00050209416,0.000011613426,0.00010128568,0.00039290238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941389,0.00008490119,0.00083493855,0.0020356313,0.0015873892,0.0013182433],"domain_scores_gemma":[0.996077,0.0003967303,0.00027147832,0.0024350516,0.00038244558,0.00043731526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012125378,0.00082167255,0.0007022533,0.0009954214,0.0003608259,0.00043576132,0.0045017605,0.0004633871,0.00015356865],"category_scores_gemma":[0.00006861259,0.00076751603,0.00022583336,0.0010754862,0.0009734445,0.00050469814,0.001389521,0.0011022248,0.00034373996],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009779147,0.00019875437,0.000023813329,0.00011092247,0.00001889607,0.000044979108,0.004672228,0.00788291,0.00044656347,0.088661365,0.000004483606,0.8979253],"study_design_scores_gemma":[0.0005338875,0.0001575088,0.00015647808,0.0003556319,0.000024397204,0.000090102236,1.5090158e-7,0.68125296,0.0030309872,0.31027886,0.0028793751,0.0012396453],"about_ca_topic_score_codex":0.000010696615,"about_ca_topic_score_gemma":0.000026113461,"teacher_disagreement_score":0.89668566,"about_ca_system_score_codex":0.0004950856,"about_ca_system_score_gemma":0.00034007203,"threshold_uncertainty_score":0.99947757},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026044133,0.0001332866,0.9821917,0.0021729136,0.0014811511,0.0018784442,0.000112120724,0.00016590183,0.009260114],"genre_scores_gemma":[0.7493806,0.0000252254,0.21271583,0.0037812314,0.0015388145,0.00033514365,0.00012399748,0.0001757405,0.031923436],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993415,0.00007123026,0.0013336556,0.0023629502,0.0018316706,0.0009854755],"domain_scores_gemma":[0.99318814,0.0022633143,0.0010678094,0.002369026,0.0007699869,0.00034174995],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0036962023,0.0006626353,0.0009621832,0.0010533549,0.0005061921,0.0009937354,0.004024469,0.0005171381,0.001358289],"category_scores_gemma":[0.0008242351,0.0005285979,0.00032269853,0.0009080544,0.0015821061,0.0006693698,0.0010324902,0.00060018327,0.0008804423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009703548,0.00017408651,0.0003307057,0.00009659135,0.000056698325,0.0000856965,0.0011697978,0.0051602544,0.0054563857,0.08514551,0.007360015,0.89486724],"study_design_scores_gemma":[0.0003847292,0.00011397937,0.0002069874,0.0001612477,0.000022265118,0.000069914,0.00000243627,0.09490998,0.0020847933,0.88094646,0.02036192,0.000735295],"about_ca_topic_score_codex":0.000011806294,"about_ca_topic_score_gemma":0.00004475628,"teacher_disagreement_score":0.8941319,"about_ca_system_score_codex":0.00015501602,"about_ca_system_score_gemma":0.0005160696,"threshold_uncertainty_score":0.9998975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014881797,0.00020848855,0.97293305,0.0053942595,0.0007398062,0.00040280083,0.000027080905,0.000018663573,0.020127028],"genre_scores_gemma":[0.9664494,0.000042801843,0.028505819,0.0036967883,0.0006912946,0.000022760685,0.000060256116,0.00001752954,0.00051338377],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953842,0.000194631,0.0007050096,0.00092743174,0.002399404,0.00038932],"domain_scores_gemma":[0.9956037,0.0029003702,0.00031920004,0.0010149581,0.00009479129,0.00006701089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010178292,0.00024263172,0.0003116698,0.0007514699,0.00023166716,0.0004324826,0.0024556778,0.00017542785,0.00016321513],"category_scores_gemma":[0.0005118093,0.00016098295,0.00008757902,0.00069915364,0.0008927087,0.0008005446,0.00017358392,0.00066077505,0.00019270772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073813007,0.000024742287,0.000122053374,0.0000040300743,0.00000403528,0.000008647075,0.009909997,0.0039834976,0.000007880768,0.35221398,0.00014872674,0.633565],"study_design_scores_gemma":[0.00018714149,0.0000448946,0.012860625,0.00008176928,0.000008723852,0.000022845776,0.00002925773,0.021866884,0.000013590742,0.88762844,0.07692584,0.00033001578],"about_ca_topic_score_codex":0.000013491701,"about_ca_topic_score_gemma":0.00015831648,"teacher_disagreement_score":0.96630055,"about_ca_system_score_codex":0.00015059755,"about_ca_system_score_gemma":0.00022611876,"threshold_uncertainty_score":0.65646946},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001628111,0.00007577657,0.9895585,0.00018122203,0.0033672072,0.000667472,0.000022804514,0.00011618136,0.0058480045],"genre_scores_gemma":[0.52368426,0.000013503674,0.44733092,0.000983596,0.0026618543,0.000109408335,0.00011520984,0.00011151932,0.024989713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950197,0.000028995077,0.00077596895,0.0021473418,0.0015420697,0.00048593403],"domain_scores_gemma":[0.99578136,0.0009402009,0.00056928716,0.0020731112,0.0005063131,0.00012971942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0055444795,0.0003261451,0.00038035223,0.0012620265,0.0005249045,0.0009322299,0.0026185855,0.00019147675,0.00008793005],"category_scores_gemma":[0.0010378924,0.00027300566,0.0001510122,0.00073116604,0.00037804045,0.0005854103,0.0010367489,0.000328462,0.00032680942],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009021299,0.000014094808,0.000016330197,0.000010739776,0.0000033900155,0.0000013213864,0.00019776484,0.00290572,0.00082195806,0.002924802,0.00028369858,0.99281114],"study_design_scores_gemma":[0.0002069117,0.00010785982,0.00018994925,0.000095323594,0.000020083273,0.000009346477,9.877319e-7,0.5024216,0.0012417427,0.43120897,0.063955404,0.000541836],"about_ca_topic_score_codex":0.000049415474,"about_ca_topic_score_gemma":0.00004063068,"teacher_disagreement_score":0.99226934,"about_ca_system_score_codex":0.00031300195,"about_ca_system_score_gemma":0.00020932003,"threshold_uncertainty_score":0.9999722},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00099601,0.0005034206,0.97283053,0.00048278784,0.0011397989,0.0005625219,0.0000027109834,0.0001886152,0.023293627],"genre_scores_gemma":[0.628393,0.000057808655,0.37019515,0.0009761883,0.00023343126,0.000016702894,0.0000043038294,0.000036507932,0.000086921995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952354,0.000057148518,0.00079152896,0.0017839021,0.0010116865,0.0011203365],"domain_scores_gemma":[0.99720603,0.00051520526,0.00036201326,0.0015592594,0.00017117639,0.00018631185],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00086179713,0.0007140515,0.00072650955,0.0008599378,0.00015093271,0.0015889868,0.0039075776,0.00044568724,0.0000664115],"category_scores_gemma":[0.00006835521,0.00059847184,0.00015176686,0.0008020512,0.0007511534,0.0016754298,0.0015480294,0.0011406427,0.00013907383],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036530184,0.000030604406,0.000071357055,0.00006267123,0.0000064595833,0.00015917415,0.0022877231,0.08825696,0.000019608478,0.17797159,0.000014677436,0.7311155],"study_design_scores_gemma":[0.00018687127,0.00011124819,0.00024745736,0.00027005494,0.000002367357,0.000044897155,5.770944e-7,0.5355938,0.000032391505,0.4628008,0.00022932078,0.00048022045],"about_ca_topic_score_codex":0.000095567295,"about_ca_topic_score_gemma":0.000096522555,"teacher_disagreement_score":0.7306353,"about_ca_system_score_codex":0.00032132945,"about_ca_system_score_gemma":0.0005625988,"threshold_uncertainty_score":0.99964666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009509018,0.0030152104,0.99139553,0.00094981014,0.00051139673,0.0005728802,0.000036073467,0.00022235117,0.0032872579],"genre_scores_gemma":[0.050719876,0.00078896707,0.94520795,0.0014592119,0.0013158132,0.000117998636,0.00015529321,0.00006259788,0.00017230249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611884,0.00003548556,0.000442787,0.0021216872,0.0008319909,0.000449217],"domain_scores_gemma":[0.9961603,0.0001690041,0.00023351461,0.002689605,0.00046112662,0.00028639613],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011909654,0.00039970584,0.0003774105,0.0008488272,0.000411788,0.0006966307,0.0022655523,0.00031773635,0.000015184797],"category_scores_gemma":[0.00009822269,0.0003944902,0.00008714281,0.0013471665,0.000778757,0.000952111,0.0013344839,0.00062523497,0.000028770755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002095641,0.000041764266,0.00011578631,0.000051188046,0.000011623271,0.000021477363,0.0008446988,0.0016671928,0.000080788304,0.7786463,0.0002252006,0.21829191],"study_design_scores_gemma":[0.00019871435,0.000084465224,0.00010670781,0.00014201521,0.000014264605,0.00013306784,3.940391e-7,0.04851482,0.00008733501,0.8901867,0.059908863,0.00062264624],"about_ca_topic_score_codex":0.000034736917,"about_ca_topic_score_gemma":0.000092053415,"teacher_disagreement_score":0.21766926,"about_ca_system_score_codex":0.00013001048,"about_ca_system_score_gemma":0.00052967394,"threshold_uncertainty_score":0.9998507},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014702677,0.0010734166,0.98320735,0.00018629068,0.00016984568,0.00030547677,0.0000038370235,0.0000091304155,0.0003420038],"genre_scores_gemma":[0.92308724,0.00019145083,0.07459292,0.0008568166,0.00048504298,0.000020290103,0.000043393295,0.00004115649,0.0006816826],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988869,0.000014660747,0.000115787225,0.0006541883,0.00015032415,0.00017818096],"domain_scores_gemma":[0.9994367,0.000017834005,0.000073829986,0.00026232508,0.00010320334,0.000106103165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039010466,0.00019602958,0.00014567857,0.00010218934,0.00008957083,0.00009743204,0.00024865367,0.00023451055,0.0000020146053],"category_scores_gemma":[0.000030493165,0.00018660637,0.00002191833,0.00007804705,0.00022697501,0.000005316583,0.00030261558,0.00016845793,0.000001960665],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007810003,0.00001770156,0.00019418144,0.00009657279,0.00004172582,0.000004618577,0.0007865687,0.019993125,0.18331432,0.0027274298,0.0001280166,0.7926176],"study_design_scores_gemma":[0.002166388,0.003104177,0.0046549677,0.0006521898,0.00016809384,0.0009463949,0.0000127661015,0.39385664,0.10355889,0.4421928,0.044023544,0.0046631494],"about_ca_topic_score_codex":0.000003191776,"about_ca_topic_score_gemma":0.00009718251,"teacher_disagreement_score":0.9086144,"about_ca_system_score_codex":0.00005699014,"about_ca_system_score_gemma":0.000107074215,"threshold_uncertainty_score":0.7609587},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012125748,0.0005983947,0.987487,0.00026614685,0.003025378,0.0002538565,9.832257e-7,0.000251464,0.0069042007],"genre_scores_gemma":[0.56808954,0.000038274116,0.430587,0.00038198297,0.0007754496,0.0000066964453,0.0000033573656,0.00004045845,0.00007726673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952375,0.00007162792,0.00079479377,0.0016242858,0.0010456807,0.0012260878],"domain_scores_gemma":[0.9972337,0.0006433332,0.00046643993,0.0012938228,0.00015926527,0.00020345766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013115905,0.00060931937,0.00061493117,0.0012138915,0.00025933946,0.0004770423,0.0027393487,0.00046350685,0.000014737425],"category_scores_gemma":[0.000107657805,0.0006193438,0.00013082573,0.0010885185,0.00068279967,0.00097241276,0.0014095607,0.0013036382,0.00003619328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021830124,0.000018764986,0.0005380854,0.000014298854,0.0000032662372,0.00005329207,0.00063983887,0.24583945,0.00010574151,0.043382134,0.0000015404944,0.7094014],"study_design_scores_gemma":[0.00034546308,0.00005906713,0.00034991978,0.0007354932,0.000006013597,0.00017503754,9.902942e-7,0.97556645,0.0014197613,0.02014884,0.0002801222,0.0009128608],"about_ca_topic_score_codex":0.000043024826,"about_ca_topic_score_gemma":0.00021074177,"teacher_disagreement_score":0.72972697,"about_ca_system_score_codex":0.00058628176,"about_ca_system_score_gemma":0.00028126565,"threshold_uncertainty_score":0.9996258},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017730244,0.00034993098,0.99119645,0.0004178283,0.0019164063,0.0003605796,0.0000043002065,0.00014811262,0.0038333766],"genre_scores_gemma":[0.86229295,0.000051285715,0.13464761,0.0022093726,0.000542889,0.0000118398675,0.0000047962735,0.00004372796,0.00019555775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965007,0.000033796085,0.0005921031,0.0013188302,0.0009640461,0.00059057376],"domain_scores_gemma":[0.99720204,0.00028502796,0.0004360711,0.0015908421,0.00032885582,0.00015714714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041141518,0.0005050942,0.0005527471,0.0010294587,0.00016275808,0.00028353583,0.003678071,0.00031739072,0.000047108217],"category_scores_gemma":[0.000012045866,0.00043851443,0.00016167073,0.0007472054,0.00035851047,0.00065852166,0.0013253604,0.0006769375,0.00009749939],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052167716,0.000033850392,0.000094366624,0.0001289223,0.00002003523,0.000025074372,0.00153763,0.0054793856,0.0050171763,0.0070264903,0.0000042935762,0.98062754],"study_design_scores_gemma":[0.000821535,0.0008158927,0.0018370235,0.0014081326,0.00003694884,0.00020025138,0.0000012679108,0.54676425,0.13963789,0.30058494,0.005856299,0.0020356],"about_ca_topic_score_codex":0.00022317095,"about_ca_topic_score_gemma":0.00040168338,"teacher_disagreement_score":0.978592,"about_ca_system_score_codex":0.00009957815,"about_ca_system_score_gemma":0.00022971079,"threshold_uncertainty_score":0.99980664},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031836863,0.0003910005,0.9951861,0.00040020933,0.0013921906,0.0011021163,0.000003798263,0.00010172234,0.0011045284],"genre_scores_gemma":[0.036010083,0.00002457554,0.9629376,0.0001587284,0.00018349964,0.00006977912,0.000003639391,0.000025648998,0.00058647216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970793,0.00004928157,0.0006531638,0.0010515215,0.0007219386,0.0004447671],"domain_scores_gemma":[0.9972777,0.00026985465,0.0005236853,0.0013054619,0.00053206057,0.00009125154],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012051229,0.00037556989,0.00046085552,0.00051809615,0.00015110223,0.00028961894,0.0029444362,0.0002844462,0.000013111236],"category_scores_gemma":[0.000253959,0.00032362185,0.00012919189,0.00035973726,0.00058857247,0.0010954804,0.0005065125,0.00034646218,0.000025633846],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016436137,0.000044632154,0.0000082052065,0.00023376009,0.000013419704,0.0000014460318,0.0015143151,0.042414043,0.004524298,0.10950739,0.000051193387,0.8416709],"study_design_scores_gemma":[0.00024228088,0.00026461922,0.000060070288,0.00035957296,0.000009573624,0.000018609273,2.9354956e-7,0.741998,0.10868876,0.1465869,0.0012628912,0.00050842774],"about_ca_topic_score_codex":0.000015602873,"about_ca_topic_score_gemma":0.0000023885639,"teacher_disagreement_score":0.84116244,"about_ca_system_score_codex":0.00017218091,"about_ca_system_score_gemma":0.00037845818,"threshold_uncertainty_score":0.99992156},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028688065,0.00048740383,0.9916133,0.0030520933,0.0017632243,0.00038414868,0.000018843255,0.00012471265,0.0022693523],"genre_scores_gemma":[0.77478194,0.00007502493,0.21460359,0.0089026075,0.0014536339,0.000025251502,0.0000849952,0.000029356932,0.00004359376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708843,0.00005053759,0.0006799156,0.00069593225,0.0011288093,0.0003563815],"domain_scores_gemma":[0.99603206,0.0011711641,0.00069776346,0.0014440673,0.0005603676,0.00009459009],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005619315,0.00039625503,0.0003339863,0.00054699194,0.00027974483,0.00041752987,0.0029557347,0.00028280832,0.000056141682],"category_scores_gemma":[0.000034785837,0.0003008637,0.00011395819,0.000907574,0.00030219267,0.0017235111,0.00038482551,0.0007433352,0.000056762787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026590362,0.000040312323,0.0000952292,0.000057053876,0.000018283921,0.000005110069,0.002003573,0.20315538,0.00034239228,0.0058458387,0.000038884114,0.7883713],"study_design_scores_gemma":[0.0005017376,0.000120012824,0.0017779412,0.0006872727,0.000027028189,0.000028015616,0.00000279915,0.9377647,0.006104076,0.022096027,0.030275555,0.0006148372],"about_ca_topic_score_codex":0.0002494145,"about_ca_topic_score_gemma":0.0009861116,"teacher_disagreement_score":0.7877565,"about_ca_system_score_codex":0.00016431202,"about_ca_system_score_gemma":0.00080822763,"threshold_uncertainty_score":0.9999443},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009514417,0.0011557061,0.99572074,0.000025225714,0.0003315188,0.0016489081,0.00019938486,0.00026200662,0.0005613894],"genre_scores_gemma":[0.90805787,0.000032868025,0.09087155,0.00013281815,0.0005848692,0.00011985384,0.000025084157,0.00010823779,0.00006683268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979364,0.000029948365,0.00042552227,0.00074317615,0.00034503106,0.00051992305],"domain_scores_gemma":[0.99790984,0.0010494657,0.00017144585,0.00049890875,0.00020296179,0.00016734698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081010646,0.0004862055,0.00051519123,0.00033492447,0.00015510556,0.00013268956,0.000413065,0.0002866938,0.000001119952],"category_scores_gemma":[0.00012380896,0.00041307832,0.000050956656,0.000111310655,0.00029789424,0.00072224473,0.00003914874,0.0003869244,0.0000010729221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002244514,0.00001200454,0.00001679191,0.000067475325,0.000022499902,0.0000021172955,0.00088113337,0.9386027,0.00065297494,0.00070102577,0.0000013857483,0.058815435],"study_design_scores_gemma":[0.0016350418,0.00042179722,0.00004845813,0.000369777,0.00004039478,0.00001779362,8.881541e-7,0.9898053,0.0005305561,0.006569834,0.00007013694,0.0004900259],"about_ca_topic_score_codex":0.0000022844986,"about_ca_topic_score_gemma":0.000056893656,"teacher_disagreement_score":0.90796274,"about_ca_system_score_codex":0.00024158054,"about_ca_system_score_gemma":0.00009382411,"threshold_uncertainty_score":0.9998321},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001642443,0.00026701202,0.99637353,0.00054814946,0.00036525173,0.0010353143,0.000010983232,0.0009066128,0.00032890655],"genre_scores_gemma":[0.44114286,0.000010916349,0.5583045,0.00016260734,0.00014467227,0.00014235482,0.000009471445,0.00002087259,0.000061780156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979661,0.000016912005,0.00047204128,0.00074716395,0.00050190574,0.0002958666],"domain_scores_gemma":[0.99577343,0.0020545803,0.000512463,0.0011589812,0.00044643052,0.000054123164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009774624,0.0002657444,0.0002504886,0.00029975816,0.0003317064,0.00028438418,0.0019409755,0.00012465823,0.000002935704],"category_scores_gemma":[0.00016361021,0.00019935032,0.00009398202,0.00031265966,0.00036365868,0.00019472695,0.0003475877,0.0003412816,0.000010698494],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001921226,0.0000204916,0.0000426501,0.000058415888,0.0000059511713,5.4528385e-7,0.0003212452,0.05333833,0.00071443006,0.008193643,0.000050340168,0.93725204],"study_design_scores_gemma":[0.00007271642,0.00004674539,0.0001404906,0.0002005571,0.00000695547,0.000012569314,5.7520182e-8,0.8320396,0.0021454652,0.16453734,0.00058864127,0.00020884548],"about_ca_topic_score_codex":0.000046100555,"about_ca_topic_score_gemma":0.000004261627,"teacher_disagreement_score":0.9370432,"about_ca_system_score_codex":0.0001123934,"about_ca_system_score_gemma":0.00024504145,"threshold_uncertainty_score":0.812927},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079708616,0.000055595407,0.9084824,0.00052645965,0.0005978751,0.00057621556,0.00004413785,0.000043357457,0.088876925],"genre_scores_gemma":[0.92641264,0.0000094200705,0.055764873,0.0024339494,0.0021037941,0.00006218901,0.00009852795,0.000036497797,0.013078119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876416,0.0000073864885,0.0002623932,0.00048607087,0.00027537276,0.00020461409],"domain_scores_gemma":[0.9992285,0.00028399148,0.00013461364,0.00018636572,0.00011421812,0.000052308147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031907894,0.00018501165,0.00021329969,0.00014044472,0.0002594309,0.00050326454,0.00029795,0.000024338296,0.0000091993425],"category_scores_gemma":[0.000031569816,0.00014879064,0.000059679423,0.000015322843,0.0006542602,0.00029422465,0.00022619875,0.00013260996,0.0000032138946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007814971,0.000007886614,0.00003067358,0.00015036801,0.0000061695905,5.45583e-7,0.00060743414,0.00017802735,0.0000053991107,0.67580557,0.0000049798696,0.32319513],"study_design_scores_gemma":[0.00039175077,0.00028333065,0.0015271984,0.000345159,0.000019005793,0.0000023392663,0.0000028724705,0.04152207,0.00014457425,0.9299765,0.025253436,0.0005317152],"about_ca_topic_score_codex":0.00003741141,"about_ca_topic_score_gemma":0.00047530016,"teacher_disagreement_score":0.92561555,"about_ca_system_score_codex":0.000031623214,"about_ca_system_score_gemma":0.00004077348,"threshold_uncertainty_score":0.60675067},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049304403,0.00011125993,0.99461687,0.00020299797,0.0011453291,0.00032718043,0.0000072257503,0.00006943265,0.0030266622],"genre_scores_gemma":[0.7060642,0.00001462682,0.29296583,0.00063503854,0.0002447035,0.000005292156,0.000007057589,0.00001535989,0.000047859954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967644,0.000042296277,0.0005609088,0.000926702,0.0012625512,0.00044312273],"domain_scores_gemma":[0.9975432,0.00066070777,0.0005219461,0.0009192195,0.00023944187,0.00011545868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071148016,0.0003649817,0.0004459947,0.00066008145,0.00021086735,0.00016159365,0.0015707972,0.00033552272,0.00003600064],"category_scores_gemma":[0.0000855613,0.00033010397,0.0001417048,0.0004256318,0.0003191858,0.00049525,0.00026957318,0.00055352895,0.000025231764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004237535,0.00013837752,0.0008191397,0.00019683209,0.000031392614,0.00012054986,0.0025515705,0.54752827,0.0002074368,0.327786,0.000057149395,0.1205209],"study_design_scores_gemma":[0.00029220793,0.00021133355,0.0006797097,0.0008905886,0.000003575534,0.000020498148,1.8338594e-7,0.974016,0.00074657326,0.022665434,0.00011237626,0.00036151332],"about_ca_topic_score_codex":0.000031525942,"about_ca_topic_score_gemma":0.0000103545535,"teacher_disagreement_score":0.7055712,"about_ca_system_score_codex":0.00019470011,"about_ca_system_score_gemma":0.0006832101,"threshold_uncertainty_score":0.9999151},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003361073,0.0001663107,0.98703843,0.00051974086,0.0009919694,0.00032369257,0.0000033164004,0.0055867783,0.005336144],"genre_scores_gemma":[0.16840015,0.000018420233,0.83027583,0.00060295797,0.0003692765,0.0000149300695,0.000016376382,0.000035305442,0.00026674665],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664986,0.000039363975,0.0005750665,0.0012912238,0.00094274303,0.0005017548],"domain_scores_gemma":[0.9973152,0.00037269667,0.0003396864,0.0016308716,0.00023756435,0.000103968225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010722703,0.00045220222,0.00042085373,0.00076990423,0.00027055875,0.00049847306,0.002581795,0.0003310961,0.000015357287],"category_scores_gemma":[0.00019897726,0.0004300604,0.00011447781,0.0006226987,0.00042320433,0.00051036547,0.00070077693,0.0005601384,0.000057519635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014781516,0.000017204802,0.000045739165,0.000029685949,0.0000026187681,0.000016306261,0.0001588613,0.003787794,0.000021866455,0.004961849,0.00039598605,0.9905606],"study_design_scores_gemma":[0.00009934671,0.00008818233,0.0011736117,0.0003814511,0.000005251238,0.000053632004,6.4651253e-9,0.48420325,0.00039428877,0.5121938,0.00093364774,0.00047355445],"about_ca_topic_score_codex":0.00009000627,"about_ca_topic_score_gemma":0.000012741049,"teacher_disagreement_score":0.99008703,"about_ca_system_score_codex":0.0005134656,"about_ca_system_score_gemma":0.0004863425,"threshold_uncertainty_score":0.9998151},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24270795,0.001048709,0.74604595,0.0025894155,0.0028381515,0.0019025967,0.0000036415902,0.00044409127,0.0024194673],"genre_scores_gemma":[0.93269694,0.000022630573,0.06555652,0.0012204236,0.00040438413,0.0000068365644,0.0000067594847,0.000032042095,0.000053449352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747086,0.000043056585,0.00062090164,0.00094883994,0.0005674379,0.0003488873],"domain_scores_gemma":[0.99854016,0.0001737868,0.00020291521,0.0007355457,0.00020593395,0.00014168228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006531117,0.00031166224,0.0005874596,0.0008715538,0.00012387132,0.000106411404,0.0004077537,0.00052835775,0.000046897807],"category_scores_gemma":[0.00030315996,0.00027255356,0.00007857351,0.00043363235,0.0005060195,0.00018854032,0.00014658248,0.0011369055,0.0000044791386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029862675,0.00032970958,0.0054732226,0.00001862361,0.000015792812,0.0015225154,0.00063441385,0.00038595742,0.0011507052,0.00013219712,0.000012183596,0.99002606],"study_design_scores_gemma":[0.031098971,0.07311053,0.09433021,0.0060260007,0.00107336,0.021205267,0.0003125441,0.58563447,0.03917734,0.11543948,0.020877503,0.011714319],"about_ca_topic_score_codex":0.000051339077,"about_ca_topic_score_gemma":0.00010638452,"teacher_disagreement_score":0.9783117,"about_ca_system_score_codex":0.00038541298,"about_ca_system_score_gemma":0.00037557076,"threshold_uncertainty_score":0.99997264},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008164695,0.00049732026,0.98983467,0.003426194,0.0039370763,0.00070433057,0.0000030331375,0.00023615758,0.0012795829],"genre_scores_gemma":[0.3265456,0.0001474999,0.66524374,0.0053758,0.0014351964,0.00009170517,0.0000036887327,0.00007558628,0.0010811687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966347,0.000014501539,0.0004752828,0.0013275297,0.0005842415,0.0009637292],"domain_scores_gemma":[0.9965936,0.0015055708,0.00016027213,0.0014256025,0.00016247568,0.00015250847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010205292,0.00049591716,0.00056453806,0.0007098715,0.00030948565,0.00047987245,0.004410204,0.00026295226,0.000018844212],"category_scores_gemma":[0.00030061882,0.0003659213,0.00017223181,0.0005367529,0.00028846733,0.00030888416,0.001248435,0.00050323014,0.00004477386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007687934,0.00001596972,0.00009420714,0.000056462875,0.000026977033,0.00015706361,0.0007071395,0.051729433,0.00024305402,0.061121617,0.00021275907,0.8856276],"study_design_scores_gemma":[0.00026944093,0.00035507965,0.0003145186,0.00023306951,0.000021320831,0.00036136626,4.776622e-7,0.94144726,0.0004951957,0.029320607,0.026463648,0.00071801717],"about_ca_topic_score_codex":0.00002395024,"about_ca_topic_score_gemma":0.0002554623,"teacher_disagreement_score":0.8897178,"about_ca_system_score_codex":0.0001972371,"about_ca_system_score_gemma":0.00039715137,"threshold_uncertainty_score":0.9998793},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028537235,0.000443933,0.9866517,0.0006591889,0.006928133,0.000667704,0.000022249147,0.00031926227,0.0042792615],"genre_scores_gemma":[0.2585492,0.000015339581,0.73562366,0.0031290676,0.0024304749,0.000029676048,0.000028975674,0.00006970407,0.00012387635],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946892,0.00007525303,0.0008749071,0.0020670837,0.0015070346,0.0007865082],"domain_scores_gemma":[0.99548393,0.00090194907,0.00061628065,0.0016065347,0.0010566264,0.00033470042],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011457463,0.0008001771,0.00078412413,0.0011529115,0.00046414603,0.0013933999,0.0026811524,0.0009953863,0.00005026826],"category_scores_gemma":[0.0011846942,0.00073264743,0.00021703394,0.0009850813,0.00086168735,0.00027009167,0.00053459464,0.0018662028,0.00028033459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003863804,0.0001874707,0.00008274302,0.00045137564,0.000062982035,0.00088157353,0.0038153103,0.081000425,0.0001704999,0.066202514,0.00007564447,0.8470308],"study_design_scores_gemma":[0.0007966492,0.00039186183,0.00004853744,0.0051445784,0.000030724594,0.00011766736,3.4666658e-7,0.098088786,0.005582639,0.8841951,0.003970008,0.0016330825],"about_ca_topic_score_codex":0.000030034676,"about_ca_topic_score_gemma":0.00009830393,"teacher_disagreement_score":0.8453978,"about_ca_system_score_codex":0.0005508175,"about_ca_system_score_gemma":0.00133181,"threshold_uncertainty_score":0.99964327},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020671772,0.00030722667,0.9953062,0.00047315258,0.0008295789,0.00075083965,0.000036118963,0.0008115157,0.0014647152],"genre_scores_gemma":[0.043404814,0.000094222385,0.9550307,0.00074616534,0.00034905557,0.000028661972,0.00009102474,0.000043026535,0.0002123529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962903,0.00003588126,0.00068252697,0.0016032861,0.00065259694,0.0007353916],"domain_scores_gemma":[0.99741304,0.000496989,0.00034268666,0.0012413289,0.00033614924,0.00016981436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007715873,0.0005701176,0.0005993736,0.0007226352,0.00045689038,0.00056549226,0.0029505375,0.00040764824,0.00001414007],"category_scores_gemma":[0.00009340311,0.0005648153,0.00019575197,0.0005612045,0.00043083343,0.0004757276,0.0006079957,0.00058539683,0.000022605613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001750022,0.000047840644,0.000013997615,0.000038627823,0.000013770525,0.000017821238,0.0002928238,0.4827703,0.00007462958,0.017411634,0.00018167295,0.49911937],"study_design_scores_gemma":[0.0003534279,0.00013079248,0.000021753063,0.00028783723,0.0000071238824,0.000026799727,5.512685e-8,0.8539368,0.002249313,0.13914493,0.0032523014,0.0005888661],"about_ca_topic_score_codex":0.000018432822,"about_ca_topic_score_gemma":0.000018467967,"teacher_disagreement_score":0.4985305,"about_ca_system_score_codex":0.0003357693,"about_ca_system_score_gemma":0.00037748634,"threshold_uncertainty_score":0.99968034},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000048393,0.0000987238,0.98137486,0.0056583015,0.0021648987,0.0011741264,0.000013446736,0.00029259603,0.0092182215],"genre_scores_gemma":[0.021309238,0.00015552963,0.97028387,0.007029289,0.00038599354,0.00014588877,0.000011963106,0.000059713555,0.00061851105],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965139,0.000043563992,0.0006221393,0.0016457535,0.0005220144,0.0006525978],"domain_scores_gemma":[0.99742883,0.00046494434,0.00029492207,0.0012464874,0.0003656037,0.00019920494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012170839,0.0005348303,0.00057833554,0.0009596392,0.0002723294,0.0010221306,0.0030065642,0.00032066397,0.000018416227],"category_scores_gemma":[0.000069091366,0.00048134217,0.00015112148,0.00055452384,0.000116310526,0.001283943,0.0009064723,0.00038644185,0.000013309127],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045866295,0.000029721283,0.0000113346905,0.000070829854,0.000014373823,0.000006639307,0.0003280319,0.006516305,0.00008607876,0.06194394,0.003433105,0.927555],"study_design_scores_gemma":[0.00029197417,0.00033389172,0.0000074250456,0.00036645113,0.000008488305,0.000039810733,2.3584106e-7,0.36887524,0.004195813,0.43899962,0.1858256,0.0010554701],"about_ca_topic_score_codex":0.000015340569,"about_ca_topic_score_gemma":0.00011287482,"teacher_disagreement_score":0.9264996,"about_ca_system_score_codex":0.00028634167,"about_ca_system_score_gemma":0.00031335658,"threshold_uncertainty_score":0.99976385},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012613418,0.00017456092,0.98287016,0.00026821898,0.00014830755,0.00035624916,0.000011723932,0.00005096575,0.003506366],"genre_scores_gemma":[0.8386043,0.000017240498,0.16075218,0.00011689558,0.00015496626,0.000011674922,0.0000067924084,0.000025852441,0.00031011616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986822,0.00001718864,0.00035253572,0.00045723913,0.00030704,0.00018382334],"domain_scores_gemma":[0.9986057,0.0005599994,0.00021200976,0.0004669577,0.00011273421,0.0000425533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039782978,0.0002254377,0.00031023077,0.00031352305,0.00012879031,0.0000710015,0.00037977012,0.00016739365,0.000019581665],"category_scores_gemma":[0.00005353353,0.00019782156,0.00005962966,0.00018227733,0.00063563767,0.00011408533,0.00013115612,0.00024001117,0.0000030771707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008491041,0.000047239137,0.00006947011,0.00013380365,0.000011059815,0.000003854678,0.00063238875,0.0013971344,0.0014795747,0.9022562,0.00011468546,0.09384613],"study_design_scores_gemma":[0.00015498852,0.000050142706,0.00007220846,0.00016983939,0.000016961458,0.0000109338,1.429817e-7,0.006558689,0.005572068,0.9869436,0.00024515257,0.00020527859],"about_ca_topic_score_codex":0.000017323107,"about_ca_topic_score_gemma":0.000048008962,"teacher_disagreement_score":0.82599086,"about_ca_system_score_codex":0.00002814804,"about_ca_system_score_gemma":0.00006965002,"threshold_uncertainty_score":0.8066929},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014620624,0.0009095149,0.98258007,0.00004738268,0.0003060225,0.0009256765,0.0000014794417,0.000031880514,0.0005773453],"genre_scores_gemma":[0.9127792,0.000059075537,0.08496934,0.00031899274,0.0009914644,0.00008596218,0.00007272057,0.00006608209,0.0006571503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971899,0.000048389942,0.00047051586,0.0012598912,0.00045463903,0.0005766638],"domain_scores_gemma":[0.99864584,0.000011809333,0.0001701395,0.0008744187,0.00015012916,0.00014768571],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007378005,0.0004114829,0.00040839438,0.00036882292,0.000120482946,0.000061054896,0.00064714556,0.0005164075,0.0000101338],"category_scores_gemma":[0.000007580288,0.00042947926,0.00016957156,0.00046618702,0.00024817468,0.000020386284,0.00026361132,0.00034014328,0.000008458007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000296323,0.000017255992,0.00015681527,0.000015464373,0.000015101242,0.000003350885,0.00016138586,0.75355226,0.004265026,0.0003074083,0.000012425209,0.24146388],"study_design_scores_gemma":[0.0005662589,0.0005223584,0.00094437355,0.00066867034,0.000063075255,0.000027379494,9.2556405e-7,0.89162976,0.0074313544,0.089110725,0.0075713675,0.0014637521],"about_ca_topic_score_codex":0.000029658158,"about_ca_topic_score_gemma":0.00056242425,"teacher_disagreement_score":0.8981586,"about_ca_system_score_codex":0.0001332385,"about_ca_system_score_gemma":0.00018245225,"threshold_uncertainty_score":0.9998157},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010069273,0.0003644808,0.9873656,0.00030722813,0.00059301726,0.0005918735,0.0000010017502,0.00010836289,0.000599146],"genre_scores_gemma":[0.22878155,0.000033420296,0.770323,0.0005467731,0.00024778073,0.000012881998,0.000002240608,0.000011641084,0.000040709096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975299,0.00003326804,0.00062510156,0.0007680829,0.0005221887,0.0005214509],"domain_scores_gemma":[0.99857986,0.00019693247,0.0002965083,0.0007156817,0.00013606717,0.00007492417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084019563,0.00032773404,0.00037279123,0.000979356,0.00028147345,0.000983726,0.0011704647,0.00021128019,0.0000028679196],"category_scores_gemma":[0.00020968598,0.0003079989,0.00005343526,0.0004839834,0.0003133674,0.0022596624,0.001104161,0.0005175721,0.000006349496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024144974,0.000014297644,0.0019684113,0.000075301476,0.000006103452,0.000053167336,0.0025322502,0.15109943,0.00052684866,0.0072062165,0.0000024646647,0.8365131],"study_design_scores_gemma":[0.00018384875,0.000027394393,0.00088746403,0.00044239376,0.000004310106,0.00013785537,0.0000011290882,0.9859273,0.00035203033,0.011529399,0.00015614822,0.00035075904],"about_ca_topic_score_codex":0.00015586869,"about_ca_topic_score_gemma":0.00027320327,"teacher_disagreement_score":0.8361623,"about_ca_system_score_codex":0.00022341925,"about_ca_system_score_gemma":0.00030525893,"threshold_uncertainty_score":0.99993724},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025031166,0.00007472148,0.99625224,0.00024727665,0.0013578966,0.0012063477,0.0000063084703,0.00047286015,0.00035734402],"genre_scores_gemma":[0.025705082,0.000015901245,0.97069687,0.0029030323,0.00040596983,0.00009305273,0.00007263712,0.00005387009,0.000053573218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995628,0.0000799953,0.00085705804,0.001528209,0.0013101127,0.0005966211],"domain_scores_gemma":[0.99660414,0.0011698423,0.000574172,0.0010880767,0.00036999193,0.00019378772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013489282,0.00051787065,0.0006152677,0.0008108502,0.0002855925,0.0007345782,0.0018820238,0.0003993415,0.00003345347],"category_scores_gemma":[0.00045725613,0.0004985503,0.00017178139,0.00071972015,0.0005639508,0.00090096245,0.00051586627,0.0006121137,0.000011597693],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006324959,0.000057327226,0.00003425014,0.00038436736,0.000012516691,0.000030070045,0.0005076428,0.012694485,0.000073366355,0.003286603,0.00008657829,0.9828265],"study_design_scores_gemma":[0.00023514417,0.00009691082,0.000056155244,0.0006122665,0.000015246552,0.00004707475,1.8536063e-7,0.93675387,0.0022736744,0.05928277,0.00007513383,0.0005515975],"about_ca_topic_score_codex":0.000014525465,"about_ca_topic_score_gemma":0.00000262628,"teacher_disagreement_score":0.9822749,"about_ca_system_score_codex":0.00051869726,"about_ca_system_score_gemma":0.00088628294,"threshold_uncertainty_score":0.9997466},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002082864,0.00021167968,0.9939164,0.00026859934,0.00075390615,0.00023191677,0.000020529806,0.00020276019,0.0023113748],"genre_scores_gemma":[0.6365872,0.00009454496,0.36064512,0.000627062,0.00044590462,0.000009185205,0.00011474601,0.00011264437,0.0013635805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769914,0.000006005272,0.0004150919,0.0007288519,0.0005528109,0.00059812324],"domain_scores_gemma":[0.99914414,0.000072351904,0.00004184778,0.0004950309,0.00012962529,0.00011703383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020114785,0.00051762257,0.00045164002,0.00039569096,0.00010622485,0.00023430449,0.0008185763,0.00026269894,0.000023482387],"category_scores_gemma":[0.0000083156065,0.00042824095,0.00011252571,0.00015933563,0.00019267469,0.00018209514,0.00024083641,0.0006338149,0.00003661541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023594937,0.000009716703,0.000003791213,0.00001786985,0.000010269536,0.0000302203,0.00010638119,0.9059577,0.00027850253,0.0056346375,0.000005797696,0.08794275],"study_design_scores_gemma":[0.00016694542,0.000027634138,0.000091395035,0.000106608306,0.000008042082,0.0000148828085,2.7095162e-8,0.84352607,0.000018809375,0.15543668,0.00010719526,0.0004957474],"about_ca_topic_score_codex":0.000009535633,"about_ca_topic_score_gemma":0.00014903689,"teacher_disagreement_score":0.6345043,"about_ca_system_score_codex":0.00025102452,"about_ca_system_score_gemma":0.00010138729,"threshold_uncertainty_score":0.99981695},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030135718,0.00028306857,0.9921281,0.00042779147,0.0015947905,0.0012904189,0.000029023515,0.00048262172,0.0037340512],"genre_scores_gemma":[0.04554637,0.000007741862,0.95062906,0.0025616258,0.00046428203,0.00007783008,0.000003435652,0.0000730287,0.0006366235],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99480814,0.000073739895,0.0007869587,0.0021590954,0.0011467972,0.0010252907],"domain_scores_gemma":[0.9957924,0.0014867157,0.00044797838,0.001635451,0.000390668,0.00024680787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012937054,0.0008126012,0.000849876,0.001184434,0.00033209778,0.0005721826,0.0048465747,0.0005629818,0.000009613608],"category_scores_gemma":[0.00036888281,0.0007367475,0.0002614255,0.00054593803,0.00072836585,0.00022293617,0.0008957147,0.0009223408,0.000021171463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028183109,0.000092223076,0.000050578827,0.00036632855,0.00005889158,0.00013846424,0.0015283487,0.030683054,0.0014618986,0.17999887,0.0012940728,0.7842991],"study_design_scores_gemma":[0.0004082072,0.00048022933,0.000045757923,0.0006515922,0.000014260655,0.00021408159,8.159443e-8,0.22779113,0.019279761,0.74455637,0.005171415,0.0013870946],"about_ca_topic_score_codex":0.000017365577,"about_ca_topic_score_gemma":0.000067756584,"teacher_disagreement_score":0.78291196,"about_ca_system_score_codex":0.00042097588,"about_ca_system_score_gemma":0.0006135241,"threshold_uncertainty_score":0.9995084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022767968,0.0014506006,0.97380537,0.00052816543,0.00053899747,0.00030294302,0.0000022227882,0.000040801144,0.00056290627],"genre_scores_gemma":[0.7707539,0.00005515086,0.22676978,0.0020519393,0.00025669436,0.0000048530037,9.54456e-7,0.000021486372,0.00008519402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964665,0.0001038402,0.00060892286,0.00095913315,0.0012895965,0.00057201466],"domain_scores_gemma":[0.99719656,0.0010612964,0.0003987557,0.0010966306,0.00017087712,0.000075911084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014571839,0.00040936345,0.0004877084,0.00079072843,0.00028386983,0.00040484132,0.0034091435,0.00022293253,0.000008001531],"category_scores_gemma":[0.0002170072,0.0003029442,0.000120217606,0.00075157854,0.00041856078,0.00047714726,0.0007680307,0.0006705522,0.0000034871318],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014558248,0.00015999451,0.0027996702,0.00018605833,0.000037477108,0.0005240164,0.023293536,0.07807645,0.0033936228,0.0005295835,0.00007660951,0.8907774],"study_design_scores_gemma":[0.003432672,0.0025159735,0.0029906533,0.006107524,0.000076163386,0.00221898,0.00003294591,0.4638233,0.33565748,0.17549886,0.0029538088,0.004691644],"about_ca_topic_score_codex":0.00004617906,"about_ca_topic_score_gemma":0.00013159605,"teacher_disagreement_score":0.88608575,"about_ca_system_score_codex":0.00016487842,"about_ca_system_score_gemma":0.0006760503,"threshold_uncertainty_score":0.99994224},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052052657,0.00008961228,0.9447322,0.0003551712,0.005891072,0.00060906017,0.000004265231,0.00036332823,0.042750023],"genre_scores_gemma":[0.7105169,0.000037433707,0.2731983,0.007064722,0.0051316936,0.000023346003,0.00027356157,0.00012997852,0.0036240413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969832,0.00013264961,0.0006054955,0.0012051061,0.0006017768,0.0004718034],"domain_scores_gemma":[0.99841094,0.00017783236,0.00042963057,0.00057344476,0.00032121886,0.00008690804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007658196,0.00044951262,0.00040942125,0.000560325,0.00032934573,0.00021299713,0.00050514285,0.00049984694,0.000698301],"category_scores_gemma":[0.000021094642,0.00043785604,0.00013955319,0.00029178758,0.0002243512,0.00036976105,0.00014607375,0.0010061531,0.00037611916],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015906018,0.00012977075,0.000015711475,0.000024140238,0.000032859407,0.00003249831,0.003040401,0.004636288,0.00041285774,0.003225759,0.00016893077,0.98826486],"study_design_scores_gemma":[0.005998695,0.00709345,0.0071430774,0.004747733,0.00033676976,0.0012476434,0.000012868454,0.4921428,0.003237329,0.45636642,0.016955085,0.0047181426],"about_ca_topic_score_codex":0.000036918602,"about_ca_topic_score_gemma":0.00004772296,"teacher_disagreement_score":0.98354673,"about_ca_system_score_codex":0.00035397997,"about_ca_system_score_gemma":0.00009946222,"threshold_uncertainty_score":0.9998073},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041230015,0.0002610521,0.95757145,0.000033035587,0.00030037382,0.0003046233,0.0000060729135,0.000085364736,0.00020801048],"genre_scores_gemma":[0.69157934,0.000009564834,0.30822614,0.00004072458,0.000036294645,0.000011525755,0.000007698519,0.000012003111,0.000076689525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99663335,0.00003056238,0.0005977575,0.0011793411,0.0010415288,0.0005174847],"domain_scores_gemma":[0.9973912,0.0012483535,0.00020961027,0.0007944768,0.00023923178,0.00011712331],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077413744,0.00040198994,0.0008318127,0.002846677,0.00011524003,0.00020811259,0.0012893958,0.00022566276,0.000011366176],"category_scores_gemma":[0.00012735596,0.00039271225,0.00008892076,0.0022356028,0.00041252482,0.00039855012,0.00092146336,0.0006395309,0.0000068601444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006908122,0.000035523943,0.1537884,0.000098505014,0.00013575824,0.000056355508,0.0034208668,0.5369707,0.0002593884,0.00032180196,0.00004132378,0.30486447],"study_design_scores_gemma":[0.00028099382,0.00009238601,0.5905771,0.0003175463,0.000029833593,0.0000100081625,5.171321e-7,0.4034602,0.0023612007,0.0021021196,0.00014025248,0.00062780647],"about_ca_topic_score_codex":0.0003474035,"about_ca_topic_score_gemma":0.001329466,"teacher_disagreement_score":0.6503493,"about_ca_system_score_codex":0.00053398864,"about_ca_system_score_gemma":0.0005242702,"threshold_uncertainty_score":0.9998525},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010864488,0.0004430503,0.99439913,0.000042067106,0.0011451769,0.00015251174,0.000040254316,0.000023047747,0.0026682937],"genre_scores_gemma":[0.9152291,0.00011699718,0.07725825,0.0012800108,0.002934594,0.000008599325,0.00054023205,0.00007663632,0.0025555817],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982833,0.000029287663,0.00026609344,0.00082406454,0.0003267687,0.00027047846],"domain_scores_gemma":[0.9990314,0.000023010856,0.00017239184,0.00052534556,0.00018029251,0.00006753717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001480641,0.00031701647,0.00022935888,0.00016390515,0.00014347844,0.00007302918,0.0004457149,0.00056853355,0.000062423656],"category_scores_gemma":[0.00003055609,0.00030064376,0.00008159293,0.000083882434,0.00021777693,0.000010965334,0.00022588107,0.00021335905,0.0000047541057],"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.000038536913,0.000014208527,0.000042076997,0.00003173972,0.000020433528,0.000014488058,0.000021417985,0.009295982,0.5130496,0.00035338386,0.00040050916,0.47671765],"study_design_scores_gemma":[0.00027545952,0.00033746334,0.00015384983,0.00011313286,0.000020787356,0.00007059747,4.661535e-8,0.015272716,0.9192207,0.047488395,0.016431592,0.0006152819],"about_ca_topic_score_codex":0.000026878102,"about_ca_topic_score_gemma":0.00010531387,"teacher_disagreement_score":0.9171409,"about_ca_system_score_codex":0.000055635042,"about_ca_system_score_gemma":0.00020664402,"threshold_uncertainty_score":0.99994457},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010559606,0.00022862919,0.9925194,0.00213916,0.0023117836,0.0003679698,0.000029522016,0.00020721422,0.0020907396],"genre_scores_gemma":[0.029190633,0.000086027525,0.9643143,0.003926743,0.0011021022,0.000013435306,0.00003228285,0.00006479109,0.0012696745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99473417,0.000043812808,0.0005329592,0.0019353542,0.0018251287,0.0009285572],"domain_scores_gemma":[0.99616736,0.0005741168,0.00021223063,0.0024406628,0.00029362642,0.0003120065],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009647622,0.0006287451,0.0006057112,0.00076223456,0.00041287762,0.0008806678,0.005548148,0.00049191347,0.00010412891],"category_scores_gemma":[0.00007492631,0.00051543565,0.0001363416,0.00062441325,0.0009161532,0.0011065853,0.003097526,0.0019054149,0.0000785455],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009099897,0.00006312812,0.000066944674,0.00004935598,0.000015197809,0.00021445466,0.0010254198,0.011708117,0.0012875242,0.015787309,0.0002977373,0.9694757],"study_design_scores_gemma":[0.0004621357,0.00025288123,0.00041597543,0.00044073878,0.000009831146,0.00010632285,2.7942934e-7,0.8502619,0.0041779308,0.11897135,0.023706479,0.0011941387],"about_ca_topic_score_codex":0.00007399783,"about_ca_topic_score_gemma":0.00012772164,"teacher_disagreement_score":0.96828157,"about_ca_system_score_codex":0.00018705975,"about_ca_system_score_gemma":0.0007388163,"threshold_uncertainty_score":0.99983233},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010242595,0.00016763483,0.9932912,0.00061388116,0.0011657621,0.00023464137,0.0000016777898,0.00010345272,0.0043193186],"genre_scores_gemma":[0.13834478,0.000046246212,0.8595064,0.0014640419,0.00035476114,0.0000025525285,0.0000032538085,0.00002362809,0.0002543339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974229,0.00002632317,0.00044862682,0.0010371567,0.00060780684,0.00045724105],"domain_scores_gemma":[0.998674,0.00016837275,0.00018641385,0.00074942637,0.00011143714,0.000110346315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050138147,0.0003408903,0.00033632808,0.0011090266,0.00013059929,0.00037273532,0.0013830952,0.0002518432,0.00007252188],"category_scores_gemma":[0.00004480518,0.00034579472,0.00007670118,0.0006607273,0.00034296635,0.0007279078,0.0005772775,0.0005938763,0.000040726543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012874291,0.000009005719,0.00024309767,0.000006585104,0.0000018594884,0.000032213808,0.00028264523,0.3356053,0.000050303563,0.0077439956,0.0000028006516,0.65602094],"study_design_scores_gemma":[0.00021677231,0.000026662003,0.00051640486,0.00020175612,0.0000024136489,0.00007891637,9.237204e-8,0.9739743,0.00016032867,0.023542184,0.0008545294,0.0004256747],"about_ca_topic_score_codex":0.000028772965,"about_ca_topic_score_gemma":0.00039032643,"teacher_disagreement_score":0.65559524,"about_ca_system_score_codex":0.00050942367,"about_ca_system_score_gemma":0.00053138484,"threshold_uncertainty_score":0.9998994},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030832607,0.0009224248,0.9948042,0.00038440718,0.0010869774,0.0003849684,0.000022643704,0.00015313811,0.0019328839],"genre_scores_gemma":[0.11706864,0.00010877985,0.8821376,0.00022096331,0.000089161396,0.000011540604,0.0000130137505,0.000027250691,0.000323044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966732,0.00012854702,0.00056177104,0.0013025292,0.0008398585,0.0004940431],"domain_scores_gemma":[0.99750876,0.00050962594,0.00038259805,0.0012055325,0.00020609368,0.00018740448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015519296,0.00045284885,0.00045147992,0.0003946637,0.00039837707,0.0004704265,0.0018159248,0.00032474846,0.000016059159],"category_scores_gemma":[0.000085682965,0.0004551885,0.00007318006,0.00041807338,0.0010152989,0.0009748263,0.0009180162,0.0010721964,0.000018707093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026223568,0.00007293854,0.00034248378,0.000037901984,0.000011139983,0.000012076351,0.0014469334,0.13346574,0.000036123514,0.14320761,0.00011446309,0.72125],"study_design_scores_gemma":[0.00014705445,0.00007945215,0.00010080312,0.0001422111,0.000009849815,0.0000341066,1.3176437e-7,0.9446638,0.0003133769,0.05313411,0.00090313324,0.00047193177],"about_ca_topic_score_codex":0.00007697092,"about_ca_topic_score_gemma":0.0000137178595,"teacher_disagreement_score":0.8111981,"about_ca_system_score_codex":0.00034568232,"about_ca_system_score_gemma":0.00015053707,"threshold_uncertainty_score":0.99979},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053111973,0.00012807499,0.9927671,0.0015382118,0.00027001268,0.00041472964,0.0000032912078,0.00020638145,0.0046190857],"genre_scores_gemma":[0.037854023,0.00003835112,0.96024525,0.0010505973,0.00018118357,0.000005404764,0.000016961023,0.000028941779,0.0005792961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959282,0.00005488809,0.0008422231,0.0012425118,0.0012324404,0.0006997248],"domain_scores_gemma":[0.9971974,0.00038855072,0.00054831133,0.0013200411,0.00035159575,0.0001940851],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018546121,0.00039473115,0.0004981966,0.0010372554,0.0002304356,0.00043415147,0.0031713378,0.00025711826,0.000021181992],"category_scores_gemma":[0.0001915067,0.0003858174,0.00012694405,0.00083623565,0.00044829628,0.00067182875,0.0010932086,0.00068759156,0.000012771667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004124961,0.00002759459,0.000008688246,0.00003623459,0.000005802929,0.0000135729715,0.00086942484,0.36511412,0.00020261099,0.020935575,0.000017692846,0.61276454],"study_design_scores_gemma":[0.00025386296,0.00021932933,0.000046408266,0.00040005645,0.0000045912334,0.00003570267,3.0653868e-7,0.965414,0.0010058827,0.029677114,0.002525838,0.0004169442],"about_ca_topic_score_codex":0.000012144182,"about_ca_topic_score_gemma":0.000008869993,"teacher_disagreement_score":0.6123476,"about_ca_system_score_codex":0.0001924749,"about_ca_system_score_gemma":0.00067559414,"threshold_uncertainty_score":0.9998594},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031338533,0.000077367054,0.9408266,0.0022066433,0.0016728212,0.0003048711,0.0000016614899,0.00016544198,0.054431234],"genre_scores_gemma":[0.95879865,0.000044752218,0.027974978,0.011832083,0.00071368297,0.000017465942,0.0000028006323,0.000051615403,0.00056395883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699587,0.00007452193,0.00033848794,0.0012072141,0.0008733081,0.000510629],"domain_scores_gemma":[0.99645466,0.001435109,0.00021909713,0.0016752903,0.00010591296,0.00010992905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001027641,0.0004694143,0.00030219855,0.0007003229,0.00041144225,0.00055347796,0.0036267606,0.00022909931,0.00007443178],"category_scores_gemma":[0.00008816171,0.0003303618,0.00019406503,0.00078572007,0.0006020964,0.00024879756,0.00066619436,0.0010124267,0.00012733047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016685863,0.000028146644,0.00001605451,0.000005014441,0.000010469014,0.000030078092,0.00045661902,0.00947544,0.000028366385,0.6194253,0.0001436751,0.3703642],"study_design_scores_gemma":[0.00016601646,0.00053640356,0.000048812497,0.0005200188,0.0000062188506,0.000035064913,3.4099867e-7,0.1806551,0.00035458396,0.8112426,0.005876631,0.00055822474],"about_ca_topic_score_codex":0.000004184422,"about_ca_topic_score_gemma":0.000018578048,"teacher_disagreement_score":0.9584853,"about_ca_system_score_codex":0.00014539574,"about_ca_system_score_gemma":0.00013619798,"threshold_uncertainty_score":0.9999148},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005205774,0.00005820386,0.9785826,0.00008521632,0.0003095013,0.00021760397,0.0000039623687,0.00005550091,0.020166803],"genre_scores_gemma":[0.9784728,0.000004048174,0.018984899,0.00016018859,0.0019459856,0.000013746075,0.000022380684,0.00003009808,0.00036580063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997901,0.000024003744,0.00037747927,0.00077218545,0.00037701306,0.0005482796],"domain_scores_gemma":[0.9990666,0.00016397036,0.00021731123,0.0004019879,0.00007970059,0.00007043593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034558072,0.0003706276,0.0004884401,0.0005609052,0.0002449354,0.00022450443,0.0009431861,0.00017499845,0.00060160644],"category_scores_gemma":[0.0000030073527,0.00036438328,0.00017089728,0.00049983605,0.00036963058,0.00019354271,0.00073934323,0.0008579611,0.000029708883],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032541118,0.000028387401,0.004013032,0.0000055580567,0.000028418366,0.000012955171,0.00043579386,0.044604197,0.000008031607,0.03662571,0.0003589629,0.9138757],"study_design_scores_gemma":[0.0002553874,0.00004420873,0.001237068,0.00024527023,0.0000311412,0.00000140223,0.0000011162747,0.6122793,0.00006105378,0.38264215,0.002356767,0.0008451817],"about_ca_topic_score_codex":0.00016246621,"about_ca_topic_score_gemma":0.000081152895,"teacher_disagreement_score":0.9779523,"about_ca_system_score_codex":0.00017966573,"about_ca_system_score_gemma":0.0000994829,"threshold_uncertainty_score":0.9998808},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055775716,0.00015827012,0.98975986,0.000027546563,0.0018129341,0.00050908996,0.0000118352655,0.00008491809,0.0070777885],"genre_scores_gemma":[0.15287922,0.000027853388,0.8458788,0.0001305898,0.0005066886,0.000016837177,0.0000054721527,0.00012299132,0.00043155532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972161,0.000024915069,0.0007725256,0.00067904673,0.000868165,0.00043921932],"domain_scores_gemma":[0.99711823,0.0007530808,0.0006832395,0.0010652044,0.0002892486,0.00009099522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006145276,0.00046921294,0.00074230146,0.00038100203,0.00012695417,0.000061034007,0.0012339284,0.00025894292,0.000076616045],"category_scores_gemma":[0.00046586036,0.0004271943,0.00012657864,0.00024881164,0.00048033198,0.00021582218,0.00062557915,0.0005527977,0.000022943372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024530678,0.00021126248,0.000069607864,0.0017665093,0.00009315191,0.000076919154,0.0064365477,0.0012811035,0.0007300799,0.7443146,0.00008129899,0.24491438],"study_design_scores_gemma":[0.00025364288,0.00013498173,0.000003774317,0.0011951547,0.000027634751,0.000013631288,6.6694906e-7,0.0033780152,0.0050689694,0.9893384,0.00018208954,0.00040301823],"about_ca_topic_score_codex":0.000005876541,"about_ca_topic_score_gemma":0.000013981858,"teacher_disagreement_score":0.24502382,"about_ca_system_score_codex":0.0001759891,"about_ca_system_score_gemma":0.00015880424,"threshold_uncertainty_score":0.99981797},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004860118,0.00028817938,0.994946,0.00075290044,0.0006485301,0.0004860863,0.000009586163,0.0003459321,0.002036768],"genre_scores_gemma":[0.3511681,0.00002065098,0.64652574,0.0009651888,0.00042341498,0.000035040946,0.00009784858,0.000058758225,0.00070526236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676704,0.000035715137,0.00044749,0.0012797313,0.0008315367,0.0006384711],"domain_scores_gemma":[0.9967553,0.00026174483,0.00035897206,0.0022374578,0.00020385152,0.00018267325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084429455,0.00050398015,0.00043449982,0.00031504594,0.00055041973,0.0006781471,0.0038170982,0.00038291462,0.000028180326],"category_scores_gemma":[0.000019992445,0.00044225075,0.000082228384,0.00067766145,0.00067825586,0.0006512534,0.0010589205,0.0011754654,0.000060769442],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013808963,0.0002311569,0.0003275395,0.00008406497,0.000042260523,0.00015607089,0.00093165267,0.009033169,0.0110537615,0.06627144,0.0006040002,0.91125107],"study_design_scores_gemma":[0.00079324166,0.00037866316,0.00043186024,0.000381889,0.000030558316,0.00013378143,2.3836088e-7,0.7936242,0.01732901,0.1500669,0.03496689,0.0018627287],"about_ca_topic_score_codex":0.00006561776,"about_ca_topic_score_gemma":0.00018810775,"teacher_disagreement_score":0.90938836,"about_ca_system_score_codex":0.0001632676,"about_ca_system_score_gemma":0.0004657235,"threshold_uncertainty_score":0.99980295},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081603095,0.00018678539,0.996607,0.000061829945,0.00077091897,0.00028423293,0.000021352076,0.00011600457,0.0011358376],"genre_scores_gemma":[0.10327338,0.0000145069125,0.89556795,0.00031450155,0.00052311795,0.000025912861,0.000034796944,0.000058028534,0.00018782492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989914,0.0000048526767,0.00021388599,0.00032799397,0.00019865157,0.00026324048],"domain_scores_gemma":[0.9995005,0.00015246935,0.000034828205,0.0002232926,0.000042998327,0.00004591899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022777556,0.00019723558,0.00019521214,0.00013082122,0.000072674804,0.000088627654,0.00021162206,0.00012811669,0.0000072264943],"category_scores_gemma":[0.000005892799,0.00019885744,0.00006222088,0.00012447113,0.00008035537,0.000091287875,0.000042355387,0.00016547802,0.0000057443963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035558692,0.000006607511,0.000018547647,0.00003534756,0.0000072957255,0.0000065417726,0.00021730202,0.91263604,0.0017330988,0.0037025502,0.0002137291,0.08141937],"study_design_scores_gemma":[0.00018829205,0.000042423657,0.000027817217,0.000036968464,0.0000073264086,0.000007770675,8.938857e-8,0.9573346,0.0016758828,0.038553484,0.0018985143,0.0002268449],"about_ca_topic_score_codex":0.000013902281,"about_ca_topic_score_gemma":0.000091615526,"teacher_disagreement_score":0.102457345,"about_ca_system_score_codex":0.00018184326,"about_ca_system_score_gemma":0.000038559632,"threshold_uncertainty_score":0.8109171},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.169556,0.000112491274,0.82851267,0.00059641217,0.0006904088,0.00021354112,0.0000012059796,0.0001921356,0.00012511542],"genre_scores_gemma":[0.7017283,8.474612e-7,0.2977209,0.00031993087,0.00020575951,0.000009406535,0.0000047644567,0.0000066180855,0.0000034574682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972521,0.00007190727,0.00031731822,0.00096235797,0.00082550064,0.0005708087],"domain_scores_gemma":[0.9985233,0.000339009,0.00010682888,0.00062653865,0.00029440122,0.00010990957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061051664,0.0002496327,0.00020811272,0.0005614932,0.00037959547,0.0005753224,0.0011983471,0.00006769935,0.000005937887],"category_scores_gemma":[0.00006377244,0.00020558778,0.000044776312,0.0046243533,0.00029422832,0.0003567978,0.000317982,0.00022335132,0.000019280991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047036833,0.00012711133,0.0010018558,0.0000040212326,0.0000022543286,0.000027078857,0.00018965286,0.85298544,0.0016053386,0.004238501,0.000011851977,0.1398022],"study_design_scores_gemma":[0.00034282703,0.0001412156,0.018794043,0.000032196316,0.0000026586108,0.000072448885,3.45067e-7,0.9622335,0.009784772,0.008157645,0.00013501162,0.00030337143],"about_ca_topic_score_codex":0.00008754876,"about_ca_topic_score_gemma":0.00019063949,"teacher_disagreement_score":0.5321723,"about_ca_system_score_codex":0.00018885922,"about_ca_system_score_gemma":0.0004784047,"threshold_uncertainty_score":0.8383627},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009384423,0.00048059723,0.9913078,0.00074468623,0.0014973512,0.0002284432,0.000015288266,0.0000754272,0.0055565382],"genre_scores_gemma":[0.08111144,0.00043983408,0.9120103,0.0022722494,0.0020142498,0.000021398377,0.000019710631,0.000068576745,0.0020422447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973661,0.00003393587,0.00044467562,0.0009937438,0.00077391136,0.00038764995],"domain_scores_gemma":[0.99699926,0.00066582503,0.0003313449,0.0016705394,0.00024676337,0.00008627665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076501723,0.00032048556,0.00034307913,0.00034776618,0.0003092541,0.0002543447,0.002914525,0.0001754177,0.000026947439],"category_scores_gemma":[0.000095338495,0.00022727852,0.00011810677,0.0004928907,0.0005678431,0.0007105769,0.0018284027,0.00067265524,0.000036642603],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045210436,0.000022816032,0.000014731647,0.000016715721,0.000010961516,0.00001898131,0.0004318829,0.01856098,0.00021618133,0.019491233,0.000075317825,0.9611357],"study_design_scores_gemma":[0.00034649431,0.00027990603,0.0005620636,0.0010722727,0.000025966661,0.00016051346,7.790082e-7,0.8714132,0.0062568416,0.09225309,0.026698252,0.0009306324],"about_ca_topic_score_codex":0.000034801713,"about_ca_topic_score_gemma":0.00006610439,"teacher_disagreement_score":0.960205,"about_ca_system_score_codex":0.0001497467,"about_ca_system_score_gemma":0.0003331959,"threshold_uncertainty_score":0.9268149},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027836064,0.0003657452,0.99404997,0.00035975577,0.0017903061,0.0005167703,0.000053051077,0.00028833022,0.002548231],"genre_scores_gemma":[0.0120677445,0.00011375006,0.9858871,0.00069579826,0.00028668763,0.00002102745,0.0000800316,0.00005292762,0.00079493935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561894,0.000052514813,0.0007648778,0.0018635553,0.0009260595,0.000774068],"domain_scores_gemma":[0.997055,0.0004545254,0.00035105814,0.0016983874,0.00022841094,0.00021262378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059155404,0.000658415,0.0006546923,0.00069864234,0.00038249744,0.00043411882,0.002070261,0.00035430805,0.00006040201],"category_scores_gemma":[0.0000901248,0.00061042816,0.00014917566,0.00051647594,0.00051941606,0.0015658543,0.0007076132,0.0008735841,0.00011420116],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005011732,0.000015505675,0.000006103612,0.000021950185,0.00000940415,0.00008882741,0.00028247604,0.0155733,0.00028229953,0.012139168,0.000007692441,0.9715683],"study_design_scores_gemma":[0.0002561951,0.00011131485,0.00006577595,0.00048110876,0.0000051803236,0.00012863724,2.5374888e-7,0.9447607,0.00020201155,0.0460551,0.00718102,0.0007527413],"about_ca_topic_score_codex":0.00006412605,"about_ca_topic_score_gemma":0.00029563153,"teacher_disagreement_score":0.97081554,"about_ca_system_score_codex":0.0004322271,"about_ca_system_score_gemma":0.00045785867,"threshold_uncertainty_score":0.9996347},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020043312,0.0018841248,0.9924786,0.00096629176,0.0017251377,0.00068053894,0.00007226518,0.00009495307,0.00009372547],"genre_scores_gemma":[0.8821803,0.00017079509,0.11690669,0.00019063267,0.00039572833,0.000036120553,0.000006263557,0.000032209,0.00008128008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968986,0.000027931763,0.00057762454,0.0012877063,0.00076136534,0.00044680142],"domain_scores_gemma":[0.99760866,0.0003603053,0.0006419115,0.00087255053,0.00040138507,0.00011516167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029307493,0.0004416753,0.00064991286,0.0005634491,0.00029977484,0.00018449966,0.0015540593,0.00034708867,0.000009210188],"category_scores_gemma":[0.000026967735,0.00040702,0.000107980835,0.0004422325,0.00087167515,0.0005225936,0.0004279456,0.00050038676,0.0000011042509],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003312215,0.000018515813,0.0024603775,0.00017789469,0.000026810443,0.0000052867695,0.002118577,0.0125497,0.0020806307,0.005655124,0.00011678543,0.9747572],"study_design_scores_gemma":[0.000820389,0.0003801389,0.04658899,0.00079592515,0.000032534652,0.0003286602,0.0000010524947,0.90433586,0.011344759,0.033818725,0.0005169572,0.0010360274],"about_ca_topic_score_codex":0.00006917841,"about_ca_topic_score_gemma":0.00026325043,"teacher_disagreement_score":0.97372115,"about_ca_system_score_codex":0.00034357284,"about_ca_system_score_gemma":0.00050818647,"threshold_uncertainty_score":0.9998382},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003453424,0.0008223627,0.9928073,0.0008953439,0.002046688,0.00080418313,0.0000061489823,0.00033548495,0.0022478993],"genre_scores_gemma":[0.09462536,0.000046950427,0.90105957,0.003157792,0.00096492795,0.000011671102,0.0000067646447,0.0000429088,0.000084032734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945039,0.00015199573,0.0009335674,0.0022264365,0.001267907,0.00091616256],"domain_scores_gemma":[0.9954794,0.0010854506,0.0006863931,0.0018393624,0.0006537506,0.00025564872],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001709732,0.0007011355,0.0007459314,0.0013145023,0.00080253155,0.0018984242,0.005690964,0.00044301164,0.00002430285],"category_scores_gemma":[0.00009316983,0.0007117421,0.0002137082,0.0015541607,0.0004954147,0.0015715177,0.0009785906,0.0011726823,0.000036215166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006750474,0.000051106985,0.00003395457,0.00002662288,0.00001614006,0.00005584874,0.0012482303,0.15876216,0.00045057747,0.025517037,0.000024431654,0.81380713],"study_design_scores_gemma":[0.00036022,0.00008680152,0.00014785802,0.0002647059,0.000009370613,0.00014201191,2.5793892e-7,0.85744965,0.0011578088,0.13663496,0.003012581,0.0007337557],"about_ca_topic_score_codex":0.000033364857,"about_ca_topic_score_gemma":0.00001771847,"teacher_disagreement_score":0.8130734,"about_ca_system_score_codex":0.0005037365,"about_ca_system_score_gemma":0.0008286894,"threshold_uncertainty_score":0.99968874},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019876599,0.00031183954,0.9925509,0.00043534252,0.0017601694,0.00038861838,0.0000039364777,0.00023220679,0.004118187],"genre_scores_gemma":[0.16439605,0.00008160302,0.83468807,0.0004298048,0.00018338163,0.000016541659,0.000011180472,0.000025616002,0.00016777286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967036,0.000054975546,0.0005285099,0.0014156622,0.00081991445,0.00047731661],"domain_scores_gemma":[0.99760556,0.0002479499,0.00036351275,0.0013637219,0.00026688326,0.00015237738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013270901,0.00040766504,0.00038142884,0.00061028585,0.0007604157,0.0009664571,0.0018121437,0.00027960644,0.000013688024],"category_scores_gemma":[0.00016414342,0.00042261527,0.00006740826,0.0006248414,0.0009169339,0.0010763115,0.0008009828,0.00070633425,0.00005510582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005928512,0.000027690254,0.00005047861,0.00006116035,0.0000066900216,0.000009801355,0.0006466402,0.015387876,0.00089972606,0.4132496,0.000005948663,0.56964844],"study_design_scores_gemma":[0.00042988377,0.0003041335,0.0018133813,0.0006672796,0.00001454036,0.0001321754,5.7540103e-7,0.6137981,0.0019941719,0.37882963,0.0011479064,0.0008682465],"about_ca_topic_score_codex":0.000031845648,"about_ca_topic_score_gemma":0.000014638858,"teacher_disagreement_score":0.5984102,"about_ca_system_score_codex":0.00048914616,"about_ca_system_score_gemma":0.000408123,"threshold_uncertainty_score":0.99982256},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017668845,0.00029940714,0.9966407,0.00007044501,0.00088633184,0.00070635136,0.0000030367619,0.0002546399,0.0009624394],"genre_scores_gemma":[0.6819892,0.000014398726,0.31669873,0.00030519147,0.00050900434,0.00015148552,0.00002200255,0.00006741795,0.00024257801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984103,0.000004294338,0.00040651296,0.00050423335,0.000357703,0.0003169915],"domain_scores_gemma":[0.9992331,0.00014832761,0.00006582943,0.00037827608,0.0001032731,0.000071194016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002764371,0.0002990016,0.00029232295,0.00033560817,0.00017810072,0.00012092313,0.0004009481,0.00020190823,0.000008079584],"category_scores_gemma":[0.000020560923,0.0002975451,0.00006210627,0.00013638764,0.00010692447,0.00009458959,0.000045040422,0.00022596035,0.000037445283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035362941,0.000007898345,0.000039001145,0.00015043923,0.000012152919,0.0000051917114,0.00083435635,0.3192807,0.0007962668,0.0006809807,0.00004183869,0.6781476],"study_design_scores_gemma":[0.00022312735,0.000023736662,0.00009425899,0.00020655137,0.0000042456127,0.000014315125,1.1016805e-7,0.9608396,0.0018086083,0.00032220627,0.036057837,0.0004053731],"about_ca_topic_score_codex":0.000002104259,"about_ca_topic_score_gemma":0.000036614252,"teacher_disagreement_score":0.6818125,"about_ca_system_score_codex":0.00032974101,"about_ca_system_score_gemma":0.00025115482,"threshold_uncertainty_score":0.99994767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044869664,0.0014843344,0.99043536,0.00018936665,0.0022372038,0.00041107697,0.000001105201,0.00013160205,0.00062296813],"genre_scores_gemma":[0.9605896,0.00037176078,0.036188193,0.00066539587,0.002029779,0.000025470787,0.0000055486507,0.00003759054,0.00008668832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695224,0.000051311374,0.00048573082,0.0013255981,0.0005963608,0.0005887443],"domain_scores_gemma":[0.9985968,0.00028240355,0.00026279964,0.00062309933,0.00012986927,0.000105012994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087452715,0.00043262556,0.00042154393,0.00078692473,0.0003130514,0.000517406,0.0011703145,0.0005371607,0.000008341973],"category_scores_gemma":[0.000015289166,0.0004258822,0.00007664368,0.0008668648,0.00030796544,0.0007434266,0.0007669834,0.0012397148,0.0000043214613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046936616,0.000012122042,0.000076068936,0.00001808583,0.0000023295142,0.000032277912,0.00047764377,0.12404482,0.000040132327,0.0015237583,0.000015854446,0.87375224],"study_design_scores_gemma":[0.00024996322,0.00015209206,0.00029310613,0.0002688598,0.0000031811317,0.00007849432,5.418243e-7,0.9829421,0.00023221278,0.013210753,0.0020698197,0.0004988524],"about_ca_topic_score_codex":0.000076989345,"about_ca_topic_score_gemma":0.0006295956,"teacher_disagreement_score":0.9561026,"about_ca_system_score_codex":0.00029803044,"about_ca_system_score_gemma":0.00013065727,"threshold_uncertainty_score":0.9998193},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010102348,0.00018351134,0.99879634,0.00004817756,0.00036210674,0.0002922226,0.000013874615,0.00018375162,0.000019010286],"genre_scores_gemma":[0.065911785,0.00001989803,0.9338693,0.000042428,0.000100976526,0.000004072636,0.000018152576,0.000023180113,0.00001022493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984567,0.00000636652,0.00041103712,0.0004497757,0.0004734959,0.0002025973],"domain_scores_gemma":[0.99738187,0.001113971,0.00035203813,0.00042742278,0.000682733,0.000041973213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006865579,0.00021416204,0.00027862133,0.00072066317,0.000046289137,0.000059684786,0.0010340677,0.00019927368,0.0000051893494],"category_scores_gemma":[0.0010990989,0.0002188723,0.00005748695,0.00064283033,0.000093608964,0.00039881587,0.00029918225,0.00018159613,4.814289e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008657923,0.000031293483,0.0005733261,0.00042443967,0.000021675518,0.000004690824,0.0010569086,0.29243848,0.0005043966,0.062265806,0.000010743305,0.6426596],"study_design_scores_gemma":[0.00021919711,0.00017163758,0.0005459423,0.0005482047,0.000011643306,0.000020985108,1.3167424e-7,0.9459757,0.033996478,0.0170616,0.0010614947,0.00038694954],"about_ca_topic_score_codex":0.0000053684807,"about_ca_topic_score_gemma":0.0000051322227,"teacher_disagreement_score":0.6535373,"about_ca_system_score_codex":0.00008433242,"about_ca_system_score_gemma":0.0001951246,"threshold_uncertainty_score":0.8925353},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040742085,0.00033060164,0.9939911,0.0026958755,0.00061538105,0.0012119506,0.0000035721425,0.0001574952,0.00095328985],"genre_scores_gemma":[0.12623242,0.000024785097,0.87126184,0.002295214,0.00008633212,0.000038234848,0.000009185404,0.000023642111,0.000028365559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649054,0.00005417385,0.0006933993,0.001441514,0.00067344395,0.0006469217],"domain_scores_gemma":[0.99823076,0.00012850725,0.0003034706,0.0008429416,0.00023818576,0.00025612494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081515725,0.00039978666,0.0004364033,0.001137783,0.00021981439,0.00045342563,0.0011122336,0.0002117812,0.000010733984],"category_scores_gemma":[0.000081796876,0.00041176935,0.00007650259,0.0010563246,0.00028261746,0.00037161272,0.00036353635,0.0006236052,0.000020524722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015307807,0.0000130043,0.000047944213,0.00004019006,0.0000018770498,0.000007501388,0.0019045626,0.18879688,0.000012324766,0.012698954,0.000001984795,0.79647326],"study_design_scores_gemma":[0.0008527308,0.0004926049,0.00024412363,0.0015219036,0.000005324762,0.00012629331,0.0000231137,0.9656593,0.00035964162,0.01634512,0.0127589945,0.0016108059],"about_ca_topic_score_codex":0.00005553895,"about_ca_topic_score_gemma":0.0007467643,"teacher_disagreement_score":0.79486245,"about_ca_system_score_codex":0.0010180617,"about_ca_system_score_gemma":0.0010843611,"threshold_uncertainty_score":0.9998334},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046489044,0.0004597958,0.9947029,0.001050447,0.00039370867,0.0003834779,8.436328e-7,0.0017898583,0.0011725023],"genre_scores_gemma":[0.23735473,0.00016971615,0.7595558,0.002266287,0.00031438394,0.00005442111,0.0000065648633,0.00003577467,0.00024234528],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782044,0.000035798508,0.00031083348,0.0009179911,0.0006119358,0.00030299957],"domain_scores_gemma":[0.99770314,0.0008584008,0.00024412604,0.0009193732,0.00020805934,0.00006690724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010315673,0.00029260814,0.00027315307,0.00033120037,0.00031802157,0.0007019701,0.0017504914,0.00015758046,0.000005149062],"category_scores_gemma":[0.00035622614,0.00020947968,0.000047929338,0.0004433659,0.00086890446,0.0005562834,0.0004573178,0.00042633776,0.000009191413],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007730972,0.000007741412,0.00022966364,0.000027871072,0.0000039861193,0.000010966286,0.0010497484,0.0013074138,0.000002613082,0.016215118,0.00005562256,0.98108155],"study_design_scores_gemma":[0.00027590105,0.000049166007,0.0001897469,0.00022501206,0.000006234484,0.00009532448,5.365757e-8,0.113221146,0.00014378717,0.88525337,0.00026141314,0.00027883484],"about_ca_topic_score_codex":0.000035732617,"about_ca_topic_score_gemma":0.000008349959,"teacher_disagreement_score":0.9808027,"about_ca_system_score_codex":0.000107596425,"about_ca_system_score_gemma":0.0002061256,"threshold_uncertainty_score":0.8542334},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4740789,0.00007994238,0.52555746,0.00013060098,0.000047091486,0.00009357224,5.0786144e-7,0.00000832124,0.0000036245178],"genre_scores_gemma":[0.78211457,0.00001912255,0.21760835,0.00021337513,0.000038831506,0.0000012456082,0.000002775552,0.0000015875645,1.5693269e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939257,0.000014900369,0.00021238085,0.000102332524,0.0001754446,0.00010236424],"domain_scores_gemma":[0.9995202,0.00014432742,0.00007690582,0.00012509886,0.00009795152,0.000035508187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018962794,0.0000618258,0.00010739674,0.00017894148,0.000048043807,0.000042841628,0.000057932055,0.000027295298,0.0000118125545],"category_scores_gemma":[0.00020484076,0.000053061987,0.000023055953,0.00027747673,0.00015311116,0.00047100044,0.000031914595,0.000060997023,0.000001116969],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007794069,0.00005925499,0.017234396,0.000097936776,0.000006303063,0.000003923383,0.0012497636,0.015694577,0.010440347,0.000019760499,0.0000063535304,0.9551796],"study_design_scores_gemma":[0.0007998422,0.00022561078,0.08790007,0.0003715458,0.00002952249,0.00033060927,0.000010567,0.86827374,0.041595846,0.0003543256,0.000015878786,0.00009242213],"about_ca_topic_score_codex":0.00004786268,"about_ca_topic_score_gemma":0.000014380427,"teacher_disagreement_score":0.9550872,"about_ca_system_score_codex":0.00007062673,"about_ca_system_score_gemma":0.000055400942,"threshold_uncertainty_score":0.2163805},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006245256,0.00003973188,0.9820762,0.00035657414,0.0005177009,0.00017416882,0.000019145207,0.000020377449,0.016733592],"genre_scores_gemma":[0.6647199,0.000016803151,0.32868132,0.0014536347,0.0029641124,0.000009121227,0.000087425164,0.00005640512,0.0020113187],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847573,0.0000084483345,0.00025130756,0.00058262225,0.0003545917,0.00032731597],"domain_scores_gemma":[0.9991093,0.00011692679,0.00014547634,0.00038132546,0.00015305237,0.000093901486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011138305,0.00025723307,0.00026997438,0.00013264331,0.00010529249,0.00018732995,0.00037400477,0.00008082614,0.0002912877],"category_scores_gemma":[0.000018952582,0.0002322456,0.00007467741,0.00009994259,0.00019051082,0.00010518002,0.000096844284,0.000377991,0.00006797298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034456964,0.000013649483,0.000011033819,0.00000439401,0.0000055525184,0.000018052098,0.000041726624,0.0006577901,0.0002105137,0.43204102,0.00006891047,0.5669239],"study_design_scores_gemma":[0.00019223931,0.00011924649,0.00008139604,0.00011003084,0.0000134172915,0.000003476076,2.1332085e-7,0.15541394,0.0007163641,0.841716,0.0013177278,0.00031595182],"about_ca_topic_score_codex":0.000028247925,"about_ca_topic_score_gemma":0.0000024847716,"teacher_disagreement_score":0.6646574,"about_ca_system_score_codex":0.000070646194,"about_ca_system_score_gemma":0.00013272835,"threshold_uncertainty_score":0.94707006},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027059282,0.00004974148,0.99300903,0.000022396294,0.001155723,0.0003658543,0.000011672304,0.00016621176,0.0025134496],"genre_scores_gemma":[0.9449331,0.00004692257,0.053036217,0.00017089857,0.0009679582,0.00011450615,0.000056381352,0.000095585085,0.00057841116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872315,0.0000022033373,0.0002647137,0.00040047045,0.00028221268,0.00032726765],"domain_scores_gemma":[0.9995194,0.000046538484,0.000052595733,0.00025431497,0.00006636126,0.000060789695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016456428,0.00026237027,0.00023470854,0.0003357221,0.00011201187,0.00014365351,0.0003445012,0.00012510104,0.0000130393555],"category_scores_gemma":[0.000004020859,0.00027653287,0.00008179718,0.000097616896,0.00008637041,0.00055343256,0.000058859823,0.0002714277,0.000018371718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017385086,0.000009441595,0.000004569764,0.00007212768,0.0000036675708,0.0000059565987,0.00031884943,0.86436224,0.00072175765,0.00089313125,0.000049224418,0.1335573],"study_design_scores_gemma":[0.00018344935,0.000038792332,0.00018854723,0.00021565177,0.000010591511,0.0000051580655,1.179412e-7,0.99036956,0.0015509506,0.006216929,0.00084087724,0.00037939879],"about_ca_topic_score_codex":0.000006350792,"about_ca_topic_score_gemma":0.0000146006205,"teacher_disagreement_score":0.9422272,"about_ca_system_score_codex":0.00021325653,"about_ca_system_score_gemma":0.00004104876,"threshold_uncertainty_score":0.9999687},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001625004,0.00024718526,0.9965182,0.000479646,0.0014604687,0.00068350753,7.5773744e-7,0.0003409613,0.00010680021],"genre_scores_gemma":[0.023566836,0.000007201336,0.9752562,0.0004191391,0.00037203034,0.00006255788,0.000009482145,0.000055871536,0.0002507011],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954087,0.000042069696,0.00061706547,0.0018280847,0.0010729253,0.0010311166],"domain_scores_gemma":[0.9973783,0.0006561464,0.00042356428,0.00119636,0.00011450669,0.00023113],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024457227,0.000626038,0.0005060049,0.000795341,0.00096007035,0.0020771832,0.0028964651,0.00048684046,0.0000088491515],"category_scores_gemma":[0.00013776208,0.0005874507,0.00018203985,0.00031254717,0.00060573337,0.0007651356,0.0011522635,0.0019027798,0.000017509448],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017301915,0.00003603952,0.00004721926,0.00004474192,0.000012099629,0.000018866862,0.001521851,0.0018484766,0.00008432168,0.0072198967,0.0000014441924,0.98916334],"study_design_scores_gemma":[0.0004989846,0.00023567858,0.00025092275,0.0006645847,0.00002045724,0.000091216505,9.898806e-7,0.04566358,0.0018368426,0.012387572,0.9367444,0.0016047746],"about_ca_topic_score_codex":0.000013574683,"about_ca_topic_score_gemma":0.000032825203,"teacher_disagreement_score":0.98755854,"about_ca_system_score_codex":0.00029628043,"about_ca_system_score_gemma":0.00072749687,"threshold_uncertainty_score":0.9996577},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033033412,0.0003375195,0.9589732,0.0013582502,0.0008516045,0.0006044683,0.000002412285,0.0001480356,0.0046910453],"genre_scores_gemma":[0.98718405,0.00004369595,0.009716241,0.0015113148,0.0012002067,0.000024679613,0.000016355216,0.000072351104,0.00023108826],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968982,0.0000044409803,0.00042609105,0.00129342,0.00081770093,0.0005601774],"domain_scores_gemma":[0.9986454,0.000053718995,0.0003310306,0.00054261135,0.0003964292,0.000030761497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005213404,0.0005863616,0.0005738645,0.0017824539,0.0002542999,0.0004968661,0.0010014446,0.00025513006,0.000024675113],"category_scores_gemma":[0.000041691816,0.0004577508,0.000052247346,0.0015114191,0.0004941118,0.00047942693,0.0005746796,0.0008261883,0.000015392734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011557704,0.00012531271,0.0075863814,0.0026015101,0.00006195452,0.00024419234,0.0003615271,0.26352948,0.000030233552,0.0024231721,0.0000047092144,0.72291595],"study_design_scores_gemma":[0.0022975586,0.000036826696,0.008586773,0.0062750545,0.00029405396,0.00006719305,0.0000055416554,0.4679888,0.00008577975,0.5081959,0.0032595887,0.0029069644],"about_ca_topic_score_codex":0.00016439283,"about_ca_topic_score_gemma":0.0009783728,"teacher_disagreement_score":0.9541507,"about_ca_system_score_codex":0.000050493614,"about_ca_system_score_gemma":0.00010560726,"threshold_uncertainty_score":0.99978745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000090691756,0.00094366126,0.99206203,0.0012806148,0.0015544661,0.0006661189,0.000011619906,0.000364217,0.0030265637],"genre_scores_gemma":[0.07672162,0.000079563004,0.91303486,0.0070462646,0.0011153857,0.000041850402,0.000019659172,0.000081007835,0.0018598057],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99571526,0.000028710738,0.0005981724,0.0019062283,0.00081290875,0.0009387072],"domain_scores_gemma":[0.99686396,0.00055277057,0.0003026829,0.0018294958,0.00023190012,0.00021916737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000950102,0.0006820656,0.00070248154,0.00075542444,0.0003816498,0.0009181941,0.00475889,0.0004262322,0.00002498352],"category_scores_gemma":[0.000099815756,0.0006172558,0.00025423118,0.000556333,0.000596777,0.0006906325,0.0009015507,0.0006292232,0.000052618092],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069372986,0.000027734439,0.0000053003982,0.00002967498,0.000008723814,0.00003531393,0.00040142238,0.0031179024,0.00021011593,0.04947706,0.00008652892,0.9465933],"study_design_scores_gemma":[0.00044786744,0.0003528807,0.00006607028,0.0002647998,0.000009913055,0.00007086492,2.0591845e-7,0.47374696,0.0011974764,0.51233315,0.010634573,0.0008752642],"about_ca_topic_score_codex":0.000010809983,"about_ca_topic_score_gemma":0.000020673731,"teacher_disagreement_score":0.94571805,"about_ca_system_score_codex":0.00023680864,"about_ca_system_score_gemma":0.0005471398,"threshold_uncertainty_score":0.9996279},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084686757,0.001110271,0.97887886,0.004795555,0.0024479432,0.0026137359,0.0000052167034,0.00020258014,0.0090989685],"genre_scores_gemma":[0.4690968,0.00008163672,0.48434666,0.033662576,0.008250134,0.00055243756,0.00002025008,0.00027732557,0.003712153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943304,0.00016255166,0.00081998727,0.002052802,0.0013993793,0.0012348916],"domain_scores_gemma":[0.99440116,0.001979096,0.0004983835,0.0026697076,0.00032114403,0.00013051523],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.004656008,0.00076480734,0.0006205373,0.0005594757,0.00097083463,0.00082801335,0.009789739,0.0003704616,0.0000068750005],"category_scores_gemma":[0.00017604794,0.0004698702,0.00025802563,0.0014201741,0.0007054649,0.00010318267,0.0029710238,0.0016083721,0.000049926603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007983284,0.00015699488,0.00008482219,0.00019853626,0.00006877769,0.00011193836,0.011150295,0.2355932,0.000025871688,0.3282902,0.00029065658,0.42394888],"study_design_scores_gemma":[0.00052287185,0.00038693222,0.000057474084,0.000564473,0.000031316096,0.00006843081,0.00001990457,0.84529877,0.0004950141,0.1369483,0.014816203,0.00079028157],"about_ca_topic_score_codex":0.00016149139,"about_ca_topic_score_gemma":0.00014744504,"teacher_disagreement_score":0.60970557,"about_ca_system_score_codex":0.0002824308,"about_ca_system_score_gemma":0.0004945497,"threshold_uncertainty_score":0.9997753},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00293216,0.0017235652,0.981359,0.0025019145,0.0027084835,0.0002873868,0.000053025844,0.00009150842,0.008342922],"genre_scores_gemma":[0.37490642,0.0010672531,0.5978833,0.0056048194,0.006809326,0.000022575734,0.0005700151,0.00014335978,0.01299295],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977351,0.000020718733,0.00036381034,0.0010911622,0.00040190623,0.00038733418],"domain_scores_gemma":[0.9984482,0.00011829169,0.00016624207,0.0009976563,0.00013967244,0.00012992714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006093677,0.0003049509,0.00030153358,0.00018182174,0.000109062865,0.000060856182,0.0009532917,0.00081723946,0.000016395557],"category_scores_gemma":[0.0007431618,0.00024839584,0.00010259624,0.0001246354,0.0013882838,0.0000033525052,0.0006628713,0.0007203906,0.000013347947],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121376885,0.000037133934,0.00005959397,0.000026732916,0.000028961327,0.00008527279,0.00012822835,0.00030038413,0.065686725,0.00015553563,0.00075118354,0.93261886],"study_design_scores_gemma":[0.002268016,0.0014325983,0.00042573005,0.00065610034,0.000044507342,0.0003370791,0.0000010754255,0.011858707,0.3497566,0.033770543,0.59729856,0.002150483],"about_ca_topic_score_codex":0.000021180138,"about_ca_topic_score_gemma":0.00015265055,"teacher_disagreement_score":0.9304684,"about_ca_system_score_codex":0.000023879973,"about_ca_system_score_gemma":0.00028015336,"threshold_uncertainty_score":0.99999684},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026914236,0.0003760549,0.993221,0.0002680802,0.0015799555,0.0008713415,0.0000024220649,0.0004384141,0.0029735868],"genre_scores_gemma":[0.7874114,0.000018058203,0.21101789,0.0008305496,0.0004901485,0.000013421155,0.000004440778,0.000027447031,0.000186642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944639,0.00012832556,0.00089188013,0.0023628678,0.0011889896,0.000963996],"domain_scores_gemma":[0.9965671,0.00050458714,0.00042070344,0.0017374761,0.00045118996,0.00031896727],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012165112,0.0008712429,0.0010241541,0.0009190137,0.0006272583,0.0010570735,0.0037835632,0.00037804924,0.000013713538],"category_scores_gemma":[0.000040776882,0.0008256029,0.00018376122,0.0010581601,0.00050315296,0.0007631611,0.0009665889,0.001642445,0.00003915671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015871767,0.000199629,0.00014579853,0.000010451661,0.000030426163,0.0001241169,0.0027301335,0.56532294,0.00002184221,0.0051861457,0.000017003686,0.42619565],"study_design_scores_gemma":[0.000475719,0.0006360445,0.0003157433,0.00029307976,0.000014812523,0.000054887798,0.0000016825586,0.9397054,0.00007711274,0.05748199,0.000084283165,0.0008592569],"about_ca_topic_score_codex":0.000048754646,"about_ca_topic_score_gemma":0.00022063621,"teacher_disagreement_score":0.7871423,"about_ca_system_score_codex":0.00037279562,"about_ca_system_score_gemma":0.00050963095,"threshold_uncertainty_score":0.9999799},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021106444,0.00019965119,0.97603416,0.0001572334,0.00029901837,0.00048366783,0.000010763078,0.00010269711,0.001606377],"genre_scores_gemma":[0.9356072,0.00002099473,0.0637908,0.00037471668,0.00014254823,0.000016347914,0.0000061271207,0.000027708575,0.0000135738655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657935,0.000024418414,0.00043233682,0.001592063,0.00084302714,0.00052880886],"domain_scores_gemma":[0.99726313,0.00052814715,0.00036321252,0.0015154863,0.00020028577,0.00012975659],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097023253,0.00046944403,0.0004181549,0.0005716706,0.00048464653,0.0007627291,0.0029834388,0.00021472997,0.000041569274],"category_scores_gemma":[0.00010663776,0.00032083367,0.00008583325,0.00084028457,0.0006556335,0.0007211024,0.0018602675,0.00093584147,0.0000059114823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059275757,0.00012481505,0.0023311647,0.0005453607,0.000077413824,0.00007287945,0.008452821,0.08353139,0.001367183,0.4786199,0.000019055791,0.42479876],"study_design_scores_gemma":[0.0002208409,0.00037259376,0.00051614176,0.0011053227,0.000010303051,0.00006309925,0.0000019245024,0.89135325,0.0022325907,0.10356487,0.00003610571,0.0005229432],"about_ca_topic_score_codex":0.000109147186,"about_ca_topic_score_gemma":0.00018686148,"teacher_disagreement_score":0.9145007,"about_ca_system_score_codex":0.00008876375,"about_ca_system_score_gemma":0.00010704675,"threshold_uncertainty_score":0.99992436},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.891439e-7,0.0003172658,0.99440426,0.0010230644,0.0020365436,0.00078915624,0.00013948855,0.0002487718,0.0010409785],"genre_scores_gemma":[0.00027034112,0.000040644234,0.9949694,0.0020879616,0.0008892194,0.000046905672,0.00011130167,0.00004594757,0.0015382444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572873,0.000021786407,0.0005355953,0.0019208208,0.0009289919,0.0008640903],"domain_scores_gemma":[0.99678403,0.00044217127,0.00028139786,0.002088175,0.00018321873,0.00022102786],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00083530927,0.0006069973,0.00050930475,0.0008051607,0.0004224417,0.0010537042,0.004675632,0.00019261087,0.00002842309],"category_scores_gemma":[0.000044472992,0.00055227516,0.00017507841,0.0005784413,0.0004052942,0.001570154,0.0022706368,0.00052961824,0.000035105957],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030282756,0.000034626515,0.000002810924,0.00004255417,0.000008616057,0.000043310218,0.000054346558,0.0068816138,0.000012810812,0.0059678103,0.00021384268,0.9867346],"study_design_scores_gemma":[0.00051327934,0.000083762265,0.0000067841534,0.00046344774,0.000012848003,0.000008212218,1.0367303e-7,0.92084235,0.00023138059,0.007793997,0.06937793,0.00066592346],"about_ca_topic_score_codex":0.000012050893,"about_ca_topic_score_gemma":0.000121614146,"teacher_disagreement_score":0.9860687,"about_ca_system_score_codex":0.00027754874,"about_ca_system_score_gemma":0.00040934968,"threshold_uncertainty_score":0.9999833},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015175699,0.000041051324,0.98294824,0.00067770615,0.0004793769,0.00028745053,0.0000032310224,0.0003823327,0.0000048907386],"genre_scores_gemma":[0.3788784,0.0000014780608,0.61825943,0.002672871,0.000170371,0.000006471105,0.000002525448,0.00000771302,7.4136534e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588287,0.00029436784,0.00064533757,0.0012118045,0.0012487208,0.0007169009],"domain_scores_gemma":[0.9978154,0.0004877618,0.00022439717,0.0010211052,0.00017644823,0.00027490192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020113676,0.00032777805,0.00048112823,0.001311711,0.00024051797,0.0007221388,0.0028799952,0.00011621133,0.000045514553],"category_scores_gemma":[0.0001446064,0.00029332415,0.00017375141,0.0058337734,0.00036497923,0.0012743975,0.0012052853,0.00035438905,0.000023060249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011781002,0.00006165098,0.0008650221,0.000012757633,0.00003501562,0.000025645277,0.0019611425,0.21646239,0.0035466333,0.000048363556,0.000022503848,0.7769577],"study_design_scores_gemma":[0.00026454538,0.00006776666,0.0033691425,0.000040425934,0.000030205172,0.000058885926,0.000001542761,0.9501197,0.04492529,0.00078430347,0.000008245859,0.00032998182],"about_ca_topic_score_codex":0.00009026754,"about_ca_topic_score_gemma":0.000050793235,"teacher_disagreement_score":0.7766277,"about_ca_system_score_codex":0.00037986247,"about_ca_system_score_gemma":0.00028033566,"threshold_uncertainty_score":0.9999519},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002139358,0.0007412716,0.98814815,0.0012177271,0.0042729424,0.00032615077,0.0000058767505,0.00023332563,0.0050524045],"genre_scores_gemma":[0.0007079459,0.000069778005,0.99369,0.0035116025,0.0006259992,0.0000060880984,0.0000043117934,0.00004442711,0.0013398628],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99520594,0.000061660845,0.00056218274,0.0019607823,0.0012190132,0.0009903953],"domain_scores_gemma":[0.9967954,0.00035889682,0.000270741,0.0018670093,0.00018127105,0.00052669324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010776448,0.00073148205,0.00064330385,0.0013965466,0.00032821545,0.0006547943,0.0047913752,0.00043261115,0.000078928955],"category_scores_gemma":[0.000058081172,0.00066991,0.0002672187,0.0013447593,0.0007065758,0.0007614724,0.0009121226,0.0011053924,0.00011100613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011171267,0.0000141226865,0.000003932916,0.000008516953,0.000011672132,0.00015490594,0.0004210198,0.0010485626,0.000015269294,0.06500584,0.00012064535,0.9331944],"study_design_scores_gemma":[0.00031073214,0.00015025133,0.000013080876,0.00018836092,0.000008504978,0.00018310966,1.2128993e-7,0.091550484,0.00076063,0.9004456,0.005556386,0.0008327823],"about_ca_topic_score_codex":0.00002204973,"about_ca_topic_score_gemma":0.00002963849,"teacher_disagreement_score":0.9323616,"about_ca_system_score_codex":0.0001534781,"about_ca_system_score_gemma":0.0007132425,"threshold_uncertainty_score":0.9995752},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1638961,0.0008038317,0.8199349,0.0023146423,0.0012886114,0.0032010376,0.00011515964,0.0004430406,0.00800267],"genre_scores_gemma":[0.9807005,0.00005049603,0.017652405,0.0006635282,0.00043432007,0.00003270987,0.000012034701,0.0000027015426,0.00045131278],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99812335,0.000016686357,0.00043234398,0.0005022481,0.0005854544,0.0003398916],"domain_scores_gemma":[0.99926746,0.00009954977,0.00019697868,0.0001624662,0.00017699893,0.0000965696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004198467,0.00026766135,0.0003316246,0.00009913201,0.00019345059,0.00008811551,0.0008397581,0.00019964462,0.00021573863],"category_scores_gemma":[0.00002477964,0.00011743805,0.000121426005,0.0002831768,0.00012952628,0.00019338887,0.0004215195,0.0002687469,0.0000141961],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006785083,0.000024661904,0.0001917933,0.000012008214,0.000001909768,0.0000019375705,0.00014849199,0.0019229819,0.04442375,0.0014913894,0.000009789398,0.9517645],"study_design_scores_gemma":[0.0011419109,0.004881436,0.16452985,0.004217944,0.00010440384,0.00010748125,0.000012843635,0.055507254,0.3092121,0.07562827,0.3784993,0.00615721],"about_ca_topic_score_codex":0.00007265224,"about_ca_topic_score_gemma":0.0005107551,"teacher_disagreement_score":0.9456073,"about_ca_system_score_codex":0.000111941124,"about_ca_system_score_gemma":0.000028000955,"threshold_uncertainty_score":0.47889847},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004508601,0.00022215997,0.99306655,0.0018959662,0.00076293305,0.0016427278,0.000017945436,0.000089765366,0.0018511061],"genre_scores_gemma":[0.4823204,0.00007155546,0.5008057,0.005725434,0.0037144336,0.0003135769,0.00049069704,0.00018663977,0.0063716136],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979264,0.000020354626,0.00046023363,0.0007372774,0.0005057778,0.00034995028],"domain_scores_gemma":[0.996703,0.0022911262,0.00017541804,0.0004919795,0.00014791141,0.00019054813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000775253,0.0003192231,0.00055074017,0.00073502003,0.00012540918,0.00005607708,0.00018808199,0.0003321885,0.00017335115],"category_scores_gemma":[0.00036311502,0.00026545467,0.00028215421,0.00032733873,0.00045947367,0.00010771492,0.000033223354,0.00036971623,0.000010198474],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018102337,0.000054273452,0.0008022251,0.00021362386,0.000013251719,0.000046717025,0.00016949036,0.0016588736,0.0007246101,0.00026072472,0.00020003672,0.99567515],"study_design_scores_gemma":[0.00699956,0.0045694946,0.0061201644,0.017164163,0.0005388244,0.0008188411,0.0000016518953,0.18575804,0.058162853,0.26826635,0.4460065,0.0055935383],"about_ca_topic_score_codex":0.000024320649,"about_ca_topic_score_gemma":0.000019749343,"teacher_disagreement_score":0.9900816,"about_ca_system_score_codex":0.00020095649,"about_ca_system_score_gemma":0.0019351589,"threshold_uncertainty_score":0.9999798},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019012693,0.00086400536,0.9954491,0.00080034183,0.00022087432,0.00026754543,9.827617e-7,0.00012372759,0.0020832412],"genre_scores_gemma":[0.379733,0.0000845458,0.6192691,0.0007668264,0.00006851593,0.0000022278748,0.0000013461099,0.0000109295515,0.00006353281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978844,0.000074839074,0.00045374595,0.00069768657,0.0005687947,0.00032054432],"domain_scores_gemma":[0.99830306,0.00043217413,0.0003507866,0.00067661726,0.00016664744,0.000070708404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011283064,0.000281669,0.00032613723,0.00039668972,0.0002057122,0.00032312845,0.0015373122,0.00012939751,0.0000020811674],"category_scores_gemma":[0.00013709908,0.00021038779,0.00005312672,0.00035640938,0.0005768027,0.00031428057,0.00079263694,0.00037176264,0.0000014514831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112428925,0.00003386073,0.000023078073,0.000037021215,0.0000073302526,0.000008944863,0.0008801747,0.064272605,0.00040180844,0.008389217,0.000037790887,0.92589694],"study_design_scores_gemma":[0.00014474177,0.00037779554,0.00016224402,0.00093113625,0.0000072504317,0.00009931758,2.6212427e-7,0.9041946,0.0032942186,0.09021428,0.00023326115,0.0003408781],"about_ca_topic_score_codex":0.000031106563,"about_ca_topic_score_gemma":0.000012933753,"teacher_disagreement_score":0.92555606,"about_ca_system_score_codex":0.00018201007,"about_ca_system_score_gemma":0.0002283016,"threshold_uncertainty_score":0.8579365},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002211133,0.0004083125,0.9951372,0.00080877496,0.0019308634,0.0006645876,0.000022575428,0.00014664569,0.0008788111],"genre_scores_gemma":[0.0005931628,0.00004153615,0.9959029,0.00080230384,0.0014209411,0.000010908483,0.000012942619,0.00003029198,0.0011849914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660313,0.00001153746,0.00041646502,0.0015824843,0.00070843793,0.0006779604],"domain_scores_gemma":[0.9982614,0.00022728092,0.00019922921,0.0009815919,0.00009719721,0.00023332413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006386556,0.00048593726,0.00043856047,0.00066342077,0.0002466392,0.0009927596,0.0025427758,0.00017984076,0.000015658146],"category_scores_gemma":[0.000028452556,0.00045504776,0.000099900986,0.00029578796,0.000260932,0.0005189678,0.0025174327,0.00036540304,0.000014364694],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019492313,0.000010220515,0.0000010369002,0.000019552766,0.0000075515213,0.000017385662,0.00018109879,0.009804449,0.000007813091,0.002515119,0.00006211079,0.9873717],"study_design_scores_gemma":[0.00048351922,0.00014358773,0.000020585967,0.00016604796,0.000010068832,0.000029300674,8.951086e-8,0.97229165,0.00013993615,0.012824171,0.013358522,0.0005325092],"about_ca_topic_score_codex":0.000050941533,"about_ca_topic_score_gemma":0.000109887005,"teacher_disagreement_score":0.9868392,"about_ca_system_score_codex":0.000155158,"about_ca_system_score_gemma":0.00025945398,"threshold_uncertainty_score":0.99979013},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012791757,0.00008562011,0.9855649,0.00017737102,0.00041417172,0.00047375768,0.0000019585764,0.0000676323,0.0004228258],"genre_scores_gemma":[0.63973993,0.000007737823,0.35931724,0.00078973186,0.000092802664,0.000002418504,0.0000016669395,0.000026957136,0.000021504464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696535,0.00009889472,0.00067733583,0.0009937901,0.0006423245,0.00062232587],"domain_scores_gemma":[0.99768776,0.00029668535,0.00034486922,0.0011896576,0.00033622017,0.00014478342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018951364,0.00033899542,0.00036237595,0.00092106906,0.0002619222,0.00032401225,0.0021096203,0.0001854261,0.000013065804],"category_scores_gemma":[0.000086646156,0.00027766044,0.00007132891,0.0013026003,0.000771922,0.0006832033,0.0011411553,0.00069465657,0.000005866523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004132346,0.000044643337,0.00020232242,0.00004439286,0.000005361469,0.00052065076,0.0047384896,0.7863626,0.00016550587,0.0040117493,8.6017315e-7,0.20389928],"study_design_scores_gemma":[0.00029181983,0.000079566904,0.000079077356,0.00034079436,0.000003602914,0.00015184481,0.0000036673148,0.99408346,0.0007193075,0.0039344085,0.000020527053,0.0002919391],"about_ca_topic_score_codex":0.00023636452,"about_ca_topic_score_gemma":0.0006350713,"teacher_disagreement_score":0.6269482,"about_ca_system_score_codex":0.0002312203,"about_ca_system_score_gemma":0.00031585674,"threshold_uncertainty_score":0.9999676},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009303943,0.0019551455,0.97940165,0.00011104042,0.00045598947,0.00028258888,0.0000019394186,0.0004268362,0.01727179],"genre_scores_gemma":[0.06607465,0.00011974305,0.9316604,0.00027530518,0.00061573874,0.000015587893,0.000009475626,0.00012462489,0.0011044324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980055,0.0000066657285,0.00033010877,0.00062834943,0.0005234558,0.00050593034],"domain_scores_gemma":[0.99910945,0.000095501215,0.000092939874,0.00036619956,0.0002145393,0.00012139384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003101257,0.0004288938,0.00042393562,0.00044157775,0.0001778061,0.00040867942,0.0005517961,0.00024681963,0.000063283165],"category_scores_gemma":[0.000026564025,0.0003615148,0.00004671907,0.00048755406,0.00028188672,0.00027950516,0.00007985678,0.0006352809,0.000025192805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003400669,0.0000040252767,0.000038456245,0.000060810435,0.00000994199,0.000017524704,0.00017593314,0.8740523,0.000022663551,0.00010310451,0.0000022987454,0.12550956],"study_design_scores_gemma":[0.0003643753,0.000051163144,0.000004175684,0.00084329146,0.000014200418,0.00005180733,4.7664568e-7,0.9949994,0.00024899753,0.0025504243,0.00038268184,0.00048897945],"about_ca_topic_score_codex":0.0000042011598,"about_ca_topic_score_gemma":0.00002397465,"teacher_disagreement_score":0.12502058,"about_ca_system_score_codex":0.0001672161,"about_ca_system_score_gemma":0.00022716052,"threshold_uncertainty_score":0.9998837},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014999008,0.0003426807,0.9946324,0.00038645416,0.0012938948,0.00031149384,0.000045048757,0.000065198954,0.0014228994],"genre_scores_gemma":[0.4068386,0.00042525015,0.58896613,0.002824884,0.00068524503,0.000005060558,0.000039140465,0.00005094219,0.00016474795],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721885,0.000044531833,0.00043415645,0.0010368582,0.0008893974,0.00037621576],"domain_scores_gemma":[0.99714535,0.00071765285,0.00039055082,0.0014256543,0.00023705454,0.00008370559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030837388,0.0004009941,0.00039414,0.00042256934,0.0002979118,0.00019136877,0.0033644321,0.00024614154,0.000037542424],"category_scores_gemma":[0.000101451216,0.00025796087,0.00010379196,0.00047739287,0.00068853726,0.00038160992,0.00097072765,0.00076410436,0.000016837046],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009151186,0.000026604755,0.0000074757213,0.000024939127,0.000009429227,0.000036410696,0.00066808995,0.008225445,0.00028867982,0.011166054,0.00015057246,0.97938716],"study_design_scores_gemma":[0.00036128733,0.00045718532,0.00021016758,0.0013539959,0.000009358717,0.00012275315,4.1271323e-7,0.39520407,0.013979089,0.5855259,0.0018931873,0.000882646],"about_ca_topic_score_codex":0.000021895012,"about_ca_topic_score_gemma":0.000049804497,"teacher_disagreement_score":0.9785045,"about_ca_system_score_codex":0.000097297925,"about_ca_system_score_gemma":0.00029581427,"threshold_uncertainty_score":0.99998724},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012928442,0.00017320414,0.99540204,0.0006863258,0.0007921195,0.00036164356,0.00016225968,0.00011263054,0.001016928],"genre_scores_gemma":[0.10683301,0.00003199269,0.8908738,0.0013311623,0.0005470431,0.000025191755,0.00017597913,0.00003765056,0.00014419816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966164,0.000027382215,0.00030149697,0.0018507874,0.00079858163,0.00040529968],"domain_scores_gemma":[0.99615216,0.0014092176,0.00029361845,0.0019162454,0.00010385303,0.00012491073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008684541,0.00034726597,0.0003500909,0.0003254493,0.00029542096,0.00068398734,0.0025798618,0.00022489496,0.00000802452],"category_scores_gemma":[0.00023919932,0.00032260953,0.00003706006,0.00036031235,0.00021006397,0.000370353,0.0023732032,0.0005143393,0.00004392296],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023330706,0.000042481963,0.000036697467,0.0000087945855,0.000017385093,0.000022402794,0.0006958613,0.01500159,0.00003711724,0.015843667,0.000060241833,0.96823144],"study_design_scores_gemma":[0.00035633112,0.000114557886,0.0009535332,0.00046034082,0.000014762329,0.000008528497,2.627266e-7,0.8899711,0.00028636103,0.10672563,0.0006201094,0.0004884824],"about_ca_topic_score_codex":0.00008276342,"about_ca_topic_score_gemma":0.00002785358,"teacher_disagreement_score":0.9677429,"about_ca_system_score_codex":0.000509574,"about_ca_system_score_gemma":0.00027176985,"threshold_uncertainty_score":0.9999226},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024916136,0.00040355063,0.9849518,0.00041552354,0.0005068222,0.00023708654,0.0000049354026,0.00025821902,0.012972892],"genre_scores_gemma":[0.3180933,0.00005346619,0.67996556,0.0011896644,0.00013115382,0.000009042996,0.000002391202,0.00003757798,0.00051785173],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644625,0.000015892527,0.00058337476,0.0012886266,0.0011467872,0.0005190826],"domain_scores_gemma":[0.9975294,0.00030539787,0.00038278487,0.0013929735,0.00025705958,0.0001323813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003642324,0.00049737265,0.0005542466,0.0010682232,0.000111484485,0.0003320296,0.0038531164,0.00022826601,0.0000072861726],"category_scores_gemma":[0.00009538273,0.00043566505,0.00013488083,0.00053431845,0.0010919166,0.0007704649,0.0015191427,0.00050156255,0.000022220667],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012759194,0.00010230831,0.000020496356,0.00005905623,0.000010549572,0.00013637343,0.0006278052,0.0013101253,0.0006520725,0.024125276,0.00030661633,0.9726366],"study_design_scores_gemma":[0.00069673173,0.0022287872,0.0003484804,0.0028302271,0.000015804852,0.00035721928,1.39381e-7,0.24430773,0.15847665,0.58388245,0.0044225124,0.002433286],"about_ca_topic_score_codex":0.00001085206,"about_ca_topic_score_gemma":0.0000047118556,"teacher_disagreement_score":0.9702033,"about_ca_system_score_codex":0.00020898762,"about_ca_system_score_gemma":0.00050995627,"threshold_uncertainty_score":0.9998095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088763935,0.00038066533,0.99229956,0.00061488914,0.0013224258,0.00035453093,0.000007615828,0.00029827037,0.0038344252],"genre_scores_gemma":[0.8404549,0.0001641843,0.15410155,0.004877849,0.00021692281,0.00002180352,0.000015072879,0.000060445767,0.00008729608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605525,0.00007063777,0.0007953608,0.0012442111,0.00094936043,0.0008851692],"domain_scores_gemma":[0.99650127,0.0010545175,0.0005158516,0.0013704256,0.00024453606,0.00031342893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014905598,0.00070417946,0.00058093335,0.0014978008,0.0005079912,0.000832612,0.002542723,0.00040392007,0.000048935286],"category_scores_gemma":[0.00027246907,0.00062261376,0.0001716981,0.0007925719,0.0009848288,0.0010625718,0.00073746266,0.0010269814,0.000106286294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012726481,0.000025717138,0.000031627624,0.00004169206,0.000010909425,0.000026395855,0.0019094981,0.014803235,0.000016236509,0.8714665,0.000073492934,0.11158194],"study_design_scores_gemma":[0.00017394537,0.00021139653,0.00013585173,0.0002620486,0.0000051523357,0.00004426659,3.7643576e-7,0.5222664,0.00016279482,0.47586423,0.0004606922,0.00041289875],"about_ca_topic_score_codex":0.000038675706,"about_ca_topic_score_gemma":0.000015182803,"teacher_disagreement_score":0.83956724,"about_ca_system_score_codex":0.00013857917,"about_ca_system_score_gemma":0.0004438053,"threshold_uncertainty_score":0.9996225},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000028296852,0.00013232157,0.9964961,0.00056287,0.00032023442,0.0016474308,0.0000066695065,0.00019159714,0.000639943],"genre_scores_gemma":[0.0016575145,0.000034542867,0.99542797,0.0022844658,0.0002997984,0.00013722376,0.000057934376,0.000016520888,0.00008400822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978125,0.000018119355,0.00053537596,0.0007258022,0.00053102704,0.00037718067],"domain_scores_gemma":[0.99841243,0.0003624953,0.0003831018,0.0004591243,0.00025722015,0.00012562405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085859466,0.0003057197,0.00029614367,0.00063342275,0.0003257205,0.0007849486,0.00094200025,0.00022149147,0.0000024510339],"category_scores_gemma":[0.00012931046,0.00028857082,0.00007608081,0.00022507743,0.000362017,0.0021798015,0.00031634152,0.00025869245,0.0000011771822],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006907915,0.000009194378,0.0000046307077,0.00012552031,0.000004452684,8.217161e-7,0.0008156522,0.0005815874,0.00007102795,0.0036408019,0.00009899809,0.9946404],"study_design_scores_gemma":[0.00050711184,0.00020901063,0.000009136776,0.00016277729,0.000009514784,0.000041806834,9.0598144e-7,0.9364775,0.0044208555,0.056274503,0.001494166,0.00039273346],"about_ca_topic_score_codex":0.0000040890773,"about_ca_topic_score_gemma":0.000003869479,"teacher_disagreement_score":0.9942477,"about_ca_system_score_codex":0.00025083649,"about_ca_system_score_gemma":0.00027300225,"threshold_uncertainty_score":0.99995667},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011901101,0.000010626612,0.9863821,0.0002270585,0.0011852435,0.000172039,0.0000014661608,0.000114200426,0.000006115109],"genre_scores_gemma":[0.51234424,1.7022778e-7,0.48733145,0.0002233897,0.000087513115,0.0000036489196,0.0000013688208,0.000008150078,8.356223e-8],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992184,0.000009632358,0.00014241095,0.0002422035,0.00011835116,0.0002690126],"domain_scores_gemma":[0.99933124,0.00029128898,0.000019733861,0.00022757462,0.00007629259,0.000053857977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004295102,0.00010606391,0.00010803597,0.00015414284,0.00007975413,0.00012148729,0.00025881143,0.00007043098,0.000004434497],"category_scores_gemma":[0.00014033132,0.00009703104,0.000034989098,0.00047083685,0.00006237471,0.00011681508,0.00001731307,0.00018431387,8.951293e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013895499,0.0000053704493,0.000057568555,0.000012557957,6.987774e-7,4.868406e-7,0.000060184986,0.69274956,0.11931844,0.00005935699,0.0000018347695,0.18773253],"study_design_scores_gemma":[0.00017724403,0.000025194653,0.00014524667,0.00000896522,0.00000161821,0.0000018697432,1.17531584e-7,0.7925555,0.20574667,0.0011945723,0.00003986638,0.00010312088],"about_ca_topic_score_codex":0.00001063155,"about_ca_topic_score_gemma":0.00008718597,"teacher_disagreement_score":0.5004431,"about_ca_system_score_codex":0.00003116961,"about_ca_system_score_gemma":0.00004582917,"threshold_uncertainty_score":0.3956811},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028464818,0.00028314744,0.99527854,0.00078018947,0.0014371516,0.00083732826,0.000009869494,0.00021749914,0.0011278243],"genre_scores_gemma":[0.019205958,0.00007347891,0.97678155,0.0011880259,0.0012489645,0.000040432024,0.000012722326,0.000035496676,0.0014133448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965466,0.000028635819,0.0005583116,0.0014729459,0.0007513132,0.00064216857],"domain_scores_gemma":[0.99794567,0.00020629512,0.0003237671,0.0010833545,0.00028654828,0.00015436183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009116896,0.00046496934,0.00048036018,0.0005923652,0.00042959946,0.0004397519,0.0023595493,0.0003931345,0.000024933805],"category_scores_gemma":[0.000039155784,0.00046397446,0.00023985495,0.0004017416,0.00049428816,0.0008548868,0.0008790538,0.0006912155,0.000030059233],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008881819,0.00003219816,7.228287e-7,0.000025059993,0.000006825286,0.0000032257112,0.00032313456,0.1349133,0.000027909338,0.03651822,0.000076923236,0.8280636],"study_design_scores_gemma":[0.00021665137,0.00013721208,0.0000036653018,0.00013467683,0.000005306021,0.000022687302,2.206675e-8,0.6451241,0.00019374378,0.35110056,0.0027286534,0.00033274456],"about_ca_topic_score_codex":0.00000814238,"about_ca_topic_score_gemma":0.00022240554,"teacher_disagreement_score":0.82773083,"about_ca_system_score_codex":0.0003796773,"about_ca_system_score_gemma":0.00044425114,"threshold_uncertainty_score":0.9997812},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023401019,0.000028464125,0.98588586,0.0010276994,0.0037197398,0.00055110425,0.000013497101,0.00021655804,0.006216971],"genre_scores_gemma":[0.94885635,0.000018746896,0.013301566,0.034780018,0.0011646453,0.000033603625,0.000019999457,0.00014980695,0.0016752814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966001,0.000052422052,0.00042062777,0.0015747353,0.0007683795,0.00058376323],"domain_scores_gemma":[0.99812275,0.0005747113,0.0003323854,0.0007346793,0.000083887826,0.00015159282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004994686,0.0004975768,0.00040139287,0.00067705003,0.000325621,0.00027761888,0.0009150817,0.00029575004,0.00009308531],"category_scores_gemma":[0.00030821367,0.0004428373,0.0001566984,0.00042335657,0.0006337677,0.0003360299,0.00028705533,0.0007903933,0.00009671218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001620063,0.00011651857,0.000053634627,0.00015935265,0.000007706656,0.0001574805,0.0003540915,0.006666191,0.2901425,0.053208124,0.00004077725,0.6489316],"study_design_scores_gemma":[0.0007501376,0.00086306105,0.00037823684,0.0006819792,0.000029518502,0.00011862434,1.1939294e-7,0.6737378,0.09280414,0.21905059,0.009975561,0.0016101836],"about_ca_topic_score_codex":0.000011610517,"about_ca_topic_score_gemma":0.00000805267,"teacher_disagreement_score":0.9725843,"about_ca_system_score_codex":0.00020761872,"about_ca_system_score_gemma":0.00027639337,"threshold_uncertainty_score":0.99980235},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009420421,0.00030484257,0.9912259,0.0013247438,0.00096700067,0.0004577203,0.000097161115,0.00024057798,0.0052878335],"genre_scores_gemma":[0.8442071,0.00008312063,0.14973274,0.0023367137,0.0012213087,0.000024726787,0.00018077496,0.000068089445,0.002145394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556935,0.000038582828,0.00049587304,0.0017808812,0.0013257316,0.0007895738],"domain_scores_gemma":[0.9972453,0.00025346392,0.0003562849,0.0014174638,0.00047210202,0.00025535683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049816084,0.0006586812,0.0006600494,0.0003241401,0.0003782647,0.0006026366,0.0019415477,0.00033611545,0.0000074058776],"category_scores_gemma":[0.00003876689,0.0005492106,0.00014078985,0.0008957923,0.0006707749,0.0008004411,0.00047897117,0.00084543333,0.00005957796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051171035,0.00015003367,0.00009182472,0.00007592518,0.000049199993,0.0011459057,0.00089922285,0.058229674,0.00008245957,0.14165686,0.00051393226,0.7970538],"study_design_scores_gemma":[0.0018386578,0.0015515884,0.0050779395,0.00482755,0.00003924785,0.0016911282,0.0000015390424,0.8538388,0.0019351961,0.092383176,0.03313229,0.0036828653],"about_ca_topic_score_codex":0.000039255403,"about_ca_topic_score_gemma":0.0000642544,"teacher_disagreement_score":0.84411293,"about_ca_system_score_codex":0.0005355499,"about_ca_system_score_gemma":0.00070808374,"threshold_uncertainty_score":0.99969596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006578987,0.000049134625,0.9911553,0.0003204231,0.00084117905,0.00016748591,0.000016654869,0.00011596557,0.0007548148],"genre_scores_gemma":[0.65926033,0.00002381039,0.3395616,0.0005716162,0.000430387,0.0000030932702,0.00006726047,0.000018591472,0.00006329048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657744,0.000029702785,0.0007561664,0.0009502133,0.0010673397,0.00061911857],"domain_scores_gemma":[0.9977062,0.0003043048,0.00027375598,0.001331858,0.00022826737,0.00015563091],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017772738,0.00046479687,0.0006083796,0.0016844237,0.00022920019,0.0009825994,0.0035077117,0.00045918947,0.000012306177],"category_scores_gemma":[0.000315085,0.0004096635,0.000105328996,0.0013621561,0.00022704642,0.003244823,0.0013180992,0.0015056184,0.000050793282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022509093,0.000049991697,0.0043454776,0.0001506198,0.000057756937,0.00008076928,0.0056825397,0.44957373,0.0012804234,0.0101540685,0.000005256741,0.5285969],"study_design_scores_gemma":[0.00020489107,0.000041031566,0.0004417006,0.00021797027,0.000009410844,0.000016265822,3.1429786e-7,0.95955026,0.00024375603,0.03859763,0.00015038221,0.000526389],"about_ca_topic_score_codex":0.00016496456,"about_ca_topic_score_gemma":0.000121127196,"teacher_disagreement_score":0.65268135,"about_ca_system_score_codex":0.00020538889,"about_ca_system_score_gemma":0.00060394517,"threshold_uncertainty_score":0.99983555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002752784,0.00048349102,0.99504954,0.0004269408,0.0017437967,0.00034118266,0.000053727297,0.00029924556,0.0015745461],"genre_scores_gemma":[0.025612202,0.000100291254,0.9683928,0.0031737725,0.0021279145,0.000014102309,0.000058067708,0.00007846984,0.00044242048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946157,0.000040786505,0.0006940704,0.0021857242,0.0014635288,0.001000198],"domain_scores_gemma":[0.99652064,0.00034868706,0.00037637094,0.0022355963,0.00020499928,0.00031371345],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00073837227,0.0007610255,0.000687272,0.0007743763,0.00046056727,0.0011038021,0.005326581,0.00025575014,0.000083602834],"category_scores_gemma":[0.000028361663,0.0006764947,0.00018933999,0.000418621,0.00041092455,0.0014541697,0.003918968,0.0011655678,0.00016354634],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010171924,0.000025981592,0.0000070182878,0.000013883253,0.0000071908785,0.00017831154,0.00026711897,0.009278382,0.000026824804,0.0008803792,0.00009660517,0.9892173],"study_design_scores_gemma":[0.00027383817,0.00010585866,0.000059497015,0.0003425518,0.000006456429,0.00020089891,1.576385e-7,0.89101744,0.000532412,0.093895786,0.012684578,0.0008805107],"about_ca_topic_score_codex":0.00010773598,"about_ca_topic_score_gemma":0.000053326774,"teacher_disagreement_score":0.9883368,"about_ca_system_score_codex":0.0003622345,"about_ca_system_score_gemma":0.00043687812,"threshold_uncertainty_score":0.9999331},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003451917,0.00021908773,0.99234307,0.0006998253,0.0002584203,0.0017455468,0.00001042911,0.0001561689,0.0045639775],"genre_scores_gemma":[0.06481024,0.000030668176,0.9308301,0.0017717797,0.00043787007,0.00015832814,0.00005281662,0.00004909202,0.0018591152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973248,0.000027806316,0.0005242185,0.0010780327,0.00058297295,0.00046215698],"domain_scores_gemma":[0.9972813,0.0010756677,0.00039850728,0.0007980605,0.00028808645,0.00015839314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005571145,0.00039495924,0.0004679421,0.00046753295,0.0004049234,0.0006247872,0.001530989,0.00027042668,0.000014483281],"category_scores_gemma":[0.0000692686,0.00035870916,0.00008213679,0.00023784577,0.0007460544,0.00041496343,0.0007037907,0.00046548116,0.00002633592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073143997,0.000010956799,0.00002543834,0.000056892903,0.000013015431,0.0000020030031,0.00024077232,0.5014769,0.00022233104,0.08522074,0.00010950652,0.41261417],"study_design_scores_gemma":[0.0006056667,0.00011941987,0.000069492686,0.00017690833,0.000008981684,0.000020398746,1.8788755e-7,0.93981844,0.00010328695,0.041411478,0.017284436,0.00038130648],"about_ca_topic_score_codex":0.0000030236781,"about_ca_topic_score_gemma":0.000001834242,"teacher_disagreement_score":0.43834156,"about_ca_system_score_codex":0.0001276257,"about_ca_system_score_gemma":0.0001699543,"threshold_uncertainty_score":0.9998865},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061108705,0.23564366,0.6576134,0.020520806,0.0041315067,0.0015469415,0.00004616474,0.00013387545,0.019254971],"genre_scores_gemma":[0.7860075,0.075181745,0.13295549,0.0028971909,0.0017267498,0.000022741628,0.000027620783,0.00007836939,0.0011025822],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986554,0.000019594796,0.00029916037,0.00047181043,0.00018184127,0.00037223325],"domain_scores_gemma":[0.9992011,0.0001555449,0.000087644956,0.0004490975,0.000041036077,0.00006552783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005749641,0.00024318107,0.00024827447,0.000137875,0.00012637896,0.00006757943,0.0006115949,0.00044240477,0.0000021610967],"category_scores_gemma":[0.00012114816,0.00017052474,0.000042967018,0.00006057859,0.001251756,0.000004575178,0.0004726137,0.00038024876,0.0000056911636],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011453168,0.000007804044,0.00009074237,0.000028943994,0.000009824254,0.000008185842,0.00025816585,0.00024105281,0.00050357,0.00044689697,0.000021569324,0.9983718],"study_design_scores_gemma":[0.0024707064,0.0020582878,0.0037346429,0.0010564585,0.00006178472,0.00080589374,0.000039617036,0.25340277,0.0060331663,0.038311582,0.6891525,0.0028726046],"about_ca_topic_score_codex":0.0000032209657,"about_ca_topic_score_gemma":0.0012806924,"teacher_disagreement_score":0.9954992,"about_ca_system_score_codex":0.00004589803,"about_ca_system_score_gemma":0.00023746213,"threshold_uncertainty_score":0.69537973},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007705521,0.00015210334,0.99170095,0.00024640502,0.0017265987,0.0009886269,0.000012552198,0.00047598832,0.004689065],"genre_scores_gemma":[0.003751022,0.00003868828,0.99230856,0.0026129913,0.0006741241,0.000036172438,0.0000147535375,0.00005355079,0.00051016704],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9951896,0.00003515971,0.000835063,0.0017074702,0.0012303671,0.0010023256],"domain_scores_gemma":[0.99630123,0.0013948103,0.00042135446,0.0012652256,0.00034636603,0.00027103862],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021312449,0.0006072334,0.000578253,0.0010296978,0.0003631152,0.00090450107,0.0031247954,0.0003322508,0.000021884178],"category_scores_gemma":[0.00030326826,0.00059286144,0.00020346299,0.00049685535,0.0007477846,0.0009834191,0.0010538483,0.00076217495,0.000021896565],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070613655,0.00004181032,0.000070704795,0.00019955987,0.000027481927,0.00008663679,0.001124747,0.0032723846,0.011084692,0.0019294751,0.00024090789,0.9819145],"study_design_scores_gemma":[0.0023512677,0.0012054618,0.00037965714,0.0037628715,0.00008765363,0.0010586772,0.000005055341,0.29484305,0.39208522,0.2970867,0.0018236784,0.005310738],"about_ca_topic_score_codex":0.00001584514,"about_ca_topic_score_gemma":0.00005385043,"teacher_disagreement_score":0.9766038,"about_ca_system_score_codex":0.00041207875,"about_ca_system_score_gemma":0.00033121876,"threshold_uncertainty_score":0.99965227},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004545014,0.00025964205,0.990668,0.0006243143,0.0015252011,0.00028502767,0.000011370844,0.000065792075,0.006106173],"genre_scores_gemma":[0.72657895,0.00038023113,0.25117448,0.01999592,0.0012409519,0.000026370559,0.000021389855,0.00012834126,0.00045333867],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680126,0.00013874681,0.00049831136,0.0010654905,0.000971318,0.00052488944],"domain_scores_gemma":[0.9954189,0.0019039732,0.00030370645,0.0018606771,0.00039657782,0.00011617851],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037944505,0.00041956874,0.00041888948,0.0006850187,0.00022863504,0.00024758483,0.004000735,0.00023628923,0.000108603286],"category_scores_gemma":[0.00021057205,0.00028756398,0.00014629212,0.0011802007,0.0008299809,0.00016792593,0.0009400668,0.0007507011,0.000030359564],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024271876,0.000048755115,0.00017559188,0.000014226234,0.000020097617,0.00002727387,0.0004477728,0.0021199116,0.000092517024,0.12436813,0.0001443167,0.8725171],"study_design_scores_gemma":[0.00094954635,0.0019782567,0.009106725,0.0013767839,0.000032160064,0.0000835122,4.803638e-7,0.2416602,0.025784526,0.68590635,0.02999099,0.003130476],"about_ca_topic_score_codex":0.000022973833,"about_ca_topic_score_gemma":0.00015684155,"teacher_disagreement_score":0.8693867,"about_ca_system_score_codex":0.00009519174,"about_ca_system_score_gemma":0.0003044444,"threshold_uncertainty_score":0.9999577},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008513881,0.00075879204,0.9692183,0.009935927,0.0041586626,0.00067610666,0.000015208339,0.0018808611,0.013270979],"genre_scores_gemma":[0.055420555,0.000061578205,0.9400986,0.0006697856,0.00054927234,0.000033113436,0.00001318272,0.00009747649,0.0030564622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9916398,0.000031198186,0.00089544675,0.0035472775,0.0024247281,0.0014615367],"domain_scores_gemma":[0.98089206,0.0004826284,0.00035707653,0.016955368,0.0009853243,0.0003275278],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0022296999,0.00091243006,0.0009594199,0.0019578857,0.00059481134,0.0010425951,0.076432936,0.0007201375,0.000012306662],"category_scores_gemma":[0.0062438953,0.0008784485,0.00018265957,0.0019054794,0.0007643965,0.0010977336,0.15721276,0.0017375653,0.00064101274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024160872,0.00020275918,0.0005572447,0.0011118288,0.00011782863,0.0022971602,0.0033340817,0.027682843,0.00038130456,0.051774137,0.15292475,0.75959194],"study_design_scores_gemma":[0.0002507774,0.00015703971,0.000061882296,0.001846445,0.000011129266,0.0004658241,5.237246e-7,0.8480207,0.0016005344,0.121001035,0.025306346,0.001277777],"about_ca_topic_score_codex":0.00006949545,"about_ca_topic_score_gemma":0.000061536906,"teacher_disagreement_score":0.82033783,"about_ca_system_score_codex":0.0012648909,"about_ca_system_score_gemma":0.0007075649,"threshold_uncertainty_score":0.9999944},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038224374,0.00014294824,0.99240905,0.0019190968,0.0010851818,0.0003908481,0.000045580302,0.00017091955,0.0037981526],"genre_scores_gemma":[0.0037741775,0.000043281525,0.99164057,0.0012583686,0.0007530901,0.000056405384,0.000029386794,0.0000315725,0.0024131308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685913,0.000014796922,0.00044103587,0.0013261668,0.0007355821,0.0006232938],"domain_scores_gemma":[0.9973328,0.00078850525,0.00038262096,0.0010102302,0.00035120113,0.00013462277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076673157,0.000366164,0.00039133578,0.00045620426,0.00037149916,0.0007809184,0.0022925434,0.00029946264,0.000020030793],"category_scores_gemma":[0.0002271915,0.00035813608,0.00012527622,0.000525913,0.00015259124,0.00060003175,0.00073653075,0.00039231693,0.00005687326],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011551186,0.000034434117,0.00010632147,0.000027469421,0.000015205547,0.000009161165,0.000622351,0.00095005,0.000042997584,0.02843718,0.0011272314,0.96862644],"study_design_scores_gemma":[0.00033880898,0.00013250708,0.00012421266,0.0002083406,0.000015661408,0.000024535448,3.080924e-7,0.8761788,0.00078356045,0.101744995,0.019713588,0.00073469215],"about_ca_topic_score_codex":0.000018036813,"about_ca_topic_score_gemma":0.000014186846,"teacher_disagreement_score":0.96789175,"about_ca_system_score_codex":0.00044497388,"about_ca_system_score_gemma":0.00022409674,"threshold_uncertainty_score":0.99988705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35878694,0.0000059437484,0.6407979,0.00014936813,0.000060899947,0.00012729892,0.0000016152349,0.00003746867,0.00003257168],"genre_scores_gemma":[0.56478393,9.0541835e-7,0.4350256,0.00013031963,0.000049052112,0.000003405571,4.7554892e-7,0.000004927893,0.0000013869497],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902666,0.000008176694,0.00018710061,0.00034437442,0.00020277839,0.0002309087],"domain_scores_gemma":[0.999189,0.00011532336,0.000073453375,0.00043762423,0.00011485569,0.000069696005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001676329,0.000106881285,0.00016847518,0.00014586153,0.000078728975,0.00003486827,0.00027850998,0.00003871558,0.000016165694],"category_scores_gemma":[0.00010059725,0.000092125614,0.0000316471,0.0006859441,0.00034838056,0.00013693946,0.00020514723,0.00033671028,0.0000023161135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012923948,0.00010606396,0.007138744,0.000041929274,0.0000027043784,0.000010314533,0.0002351968,0.07852054,0.6507849,0.0002572012,0.0000018548761,0.26288763],"study_design_scores_gemma":[0.00031063598,0.000118541866,0.0066828253,0.00011850971,0.0000070159604,0.0001379915,4.360725e-7,0.83312297,0.15322798,0.006064898,0.000072120136,0.0001361052],"about_ca_topic_score_codex":0.00009957936,"about_ca_topic_score_gemma":0.00005676138,"teacher_disagreement_score":0.75460243,"about_ca_system_score_codex":0.000028540971,"about_ca_system_score_gemma":0.00016667813,"threshold_uncertainty_score":0.37567735},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004508317,0.0015496289,0.98933977,0.000247522,0.0060461843,0.0017585433,0.000015240725,0.00022777826,0.0007702232],"genre_scores_gemma":[0.19705828,0.00024003863,0.79427093,0.00055234,0.0034049193,0.00016582278,0.000043888118,0.000106495005,0.0041572764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99528,0.000054623135,0.00095150084,0.0019109192,0.0010396605,0.0007632933],"domain_scores_gemma":[0.996866,0.0003346084,0.0007089728,0.0015289147,0.0003491964,0.0002123145],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014609997,0.00060634676,0.00062490045,0.0009572708,0.0004325919,0.0009341094,0.0025779246,0.0003762143,0.0000149573825],"category_scores_gemma":[0.00008468307,0.00056766905,0.0002211964,0.00043554165,0.00019082143,0.0008092981,0.0005157321,0.00043231426,0.00010828951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012079817,0.00013701798,0.000092151386,0.00032190286,0.00004402496,0.00003630936,0.0021484643,0.10462775,0.0017515209,0.08085802,0.00025039547,0.80972034],"study_design_scores_gemma":[0.0005271004,0.000094463525,0.0003214273,0.00049011305,0.000011685471,0.000042829313,5.602646e-7,0.9773505,0.0008775901,0.0016959981,0.017880008,0.0007077361],"about_ca_topic_score_codex":0.00003730163,"about_ca_topic_score_gemma":0.000059590257,"teacher_disagreement_score":0.87272274,"about_ca_system_score_codex":0.00083773816,"about_ca_system_score_gemma":0.00030034082,"threshold_uncertainty_score":0.9996775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009825558,0.0004029661,0.9850672,0.000036118487,0.001938954,0.00057948456,0.000016212236,0.0014335484,0.0006999534],"genre_scores_gemma":[0.8497319,0.000023462726,0.14931002,0.0003357464,0.0004114176,0.0000035379544,0.000025866939,0.000119077435,0.000038972823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744636,0.0000108712675,0.00055746007,0.00065393967,0.00052248494,0.0008088599],"domain_scores_gemma":[0.99879724,0.00016581897,0.00012790786,0.00055414625,0.00021653797,0.00013835591],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048034606,0.0005656744,0.0005420375,0.00070112385,0.00024876496,0.00031253393,0.0007051531,0.00042905565,0.00003099153],"category_scores_gemma":[0.000050305403,0.0005722502,0.00012710359,0.0004942384,0.00021828736,0.0004643313,0.00010510184,0.0005376259,0.000017618626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060284597,0.000006085703,0.000009401012,0.00006805369,0.000016027643,0.000018751913,0.000317081,0.9596936,0.0014548724,0.00007177958,0.000016315938,0.038321976],"study_design_scores_gemma":[0.00032818667,0.0000963391,0.000040853836,0.0009029809,0.000017961918,0.000022152208,1.9615176e-7,0.9849151,0.0096369805,0.0029457607,0.00042142166,0.00067206926],"about_ca_topic_score_codex":0.000007249546,"about_ca_topic_score_gemma":0.0000053251792,"teacher_disagreement_score":0.83990633,"about_ca_system_score_codex":0.0005327494,"about_ca_system_score_gemma":0.00021751646,"threshold_uncertainty_score":0.9996729},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010682663,0.000115484945,0.96219677,0.00021341554,0.0007661197,0.000554162,0.0000026153766,0.008670566,0.027470177],"genre_scores_gemma":[0.13642325,6.379529e-7,0.8615652,0.0014821361,0.00034203785,0.000033387427,0.000002374253,0.00004727607,0.000103710256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951694,0.00004645368,0.00058863603,0.0021081283,0.0011884295,0.0008989609],"domain_scores_gemma":[0.9956309,0.0011514646,0.00029250793,0.0021746394,0.00043091,0.0003195431],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001443631,0.0006620615,0.0006460708,0.0013735265,0.0003553962,0.00079882616,0.0046271486,0.00033788726,0.0000015921746],"category_scores_gemma":[0.0006367979,0.00061459787,0.00012379167,0.001790195,0.00031998364,0.00028494172,0.0013331614,0.00078673323,0.000049216924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003848422,0.00004988409,0.00030904447,0.0001552794,0.0000060848492,0.00015194537,0.0002983454,0.088567875,0.00002392487,0.011330688,0.00024572047,0.89885736],"study_design_scores_gemma":[0.0001376434,0.00019826401,0.00006119987,0.0014397716,0.000006545478,0.0002639338,3.8056143e-8,0.942509,0.00020195713,0.0538101,0.0005683819,0.0008031727],"about_ca_topic_score_codex":0.00008936403,"about_ca_topic_score_gemma":0.000004844915,"teacher_disagreement_score":0.8980542,"about_ca_system_score_codex":0.0006179955,"about_ca_system_score_gemma":0.00073160365,"threshold_uncertainty_score":0.9996305},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055649503,0.00019659036,0.9924107,0.0004199524,0.0020004436,0.0004157334,0.000010134824,0.0003654084,0.0041253977],"genre_scores_gemma":[0.041345257,0.00008673121,0.954732,0.0023302457,0.00078977784,0.000016961498,0.000030403597,0.00005256511,0.000616045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953864,0.00003913978,0.00057557825,0.0018596823,0.0013244754,0.00081471563],"domain_scores_gemma":[0.9973255,0.0003009383,0.00033073893,0.0016877991,0.00016970882,0.00018535256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077016314,0.00061681576,0.0005228947,0.00091933005,0.00046438,0.0009309021,0.005320964,0.00027419016,0.000025377596],"category_scores_gemma":[0.000057859783,0.000570631,0.00013796659,0.00066396553,0.00058763387,0.0014586141,0.002811022,0.00086837914,0.000047220758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061181877,0.000049436072,0.0006106952,0.00010203732,0.000022889775,0.0002467476,0.00047943217,0.07827443,0.000026946342,0.0012874458,0.00012912546,0.9187647],"study_design_scores_gemma":[0.0002710506,0.00013522066,0.00022892663,0.0003529596,0.000008857335,0.000028781455,8.641102e-8,0.98365265,0.00035758544,0.009436063,0.0048371586,0.000690685],"about_ca_topic_score_codex":0.000045011147,"about_ca_topic_score_gemma":0.00016156485,"teacher_disagreement_score":0.918074,"about_ca_system_score_codex":0.00018842169,"about_ca_system_score_gemma":0.00035884633,"threshold_uncertainty_score":0.9996745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13028973,0.00018552359,0.8674137,0.00006478534,0.0008421888,0.00033991341,0.000023863673,0.000032421558,0.00080786255],"genre_scores_gemma":[0.5270359,0.0000047328203,0.47224405,0.00017199817,0.00035953053,0.0000017701286,0.0000027245078,0.00001976001,0.00015951671],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99242175,0.00022306957,0.0019217018,0.0022417295,0.0025841517,0.00060760905],"domain_scores_gemma":[0.9903537,0.004806113,0.0018526315,0.0016586318,0.00116576,0.00016317226],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.013832121,0.00052812253,0.0014637358,0.0027850177,0.00029046668,0.00035574174,0.0012496507,0.00041508357,0.00005182253],"category_scores_gemma":[0.016794221,0.00042047445,0.000368858,0.002896549,0.0015454222,0.00050126604,0.00095231016,0.000699919,8.882479e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028334929,0.000017732851,0.02327163,0.000013953655,0.000020914369,0.00010442762,0.0004691985,0.008493234,0.00008958049,0.00005970228,0.0000034461673,0.96742785],"study_design_scores_gemma":[0.00014468672,0.000310112,0.107054494,0.00056022423,0.0002404024,0.00046641138,0.0000010423992,0.40332603,0.0012682707,0.48544616,0.00025759178,0.0009245762],"about_ca_topic_score_codex":0.000118823555,"about_ca_topic_score_gemma":0.00030258924,"teacher_disagreement_score":0.96650326,"about_ca_system_score_codex":0.00018844203,"about_ca_system_score_gemma":0.00063036504,"threshold_uncertainty_score":0.9998247},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026437223,0.0065651815,0.9870204,0.0023370644,0.0011570182,0.00083926733,0.000005927985,0.00022589436,0.0018228438],"genre_scores_gemma":[0.07068046,0.005068291,0.91205525,0.008681605,0.0014394847,0.00013503498,0.000033654807,0.00010609128,0.0018001423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961615,0.000072164796,0.0006653646,0.0016367403,0.00062107365,0.000843132],"domain_scores_gemma":[0.9957771,0.0008994249,0.00032879444,0.0020269242,0.00073959725,0.00022819881],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010154884,0.00067388284,0.0006989318,0.00052376394,0.00070557016,0.0008147748,0.004875431,0.00037720363,0.000039281957],"category_scores_gemma":[0.000090425594,0.0006315442,0.00019506163,0.00081381446,0.0006903621,0.0007124972,0.0020459176,0.0011061408,0.000038107057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012969744,0.00003481599,0.000005167842,0.000013628292,0.000019012221,0.00000894352,0.0006338796,0.05657935,0.00010348119,0.04298098,0.00019178244,0.89941597],"study_design_scores_gemma":[0.00047671684,0.00015742688,0.00001753443,0.00041319444,0.0000064738706,0.000021409804,2.0540196e-7,0.954271,0.00024130411,0.0058294837,0.03780467,0.000760575],"about_ca_topic_score_codex":9.609042e-7,"about_ca_topic_score_gemma":0.00017398478,"teacher_disagreement_score":0.8986554,"about_ca_system_score_codex":0.0004252964,"about_ca_system_score_gemma":0.0006238372,"threshold_uncertainty_score":0.9996136},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030285102,0.0005188432,0.9940764,0.00019397779,0.0032946367,0.00084474956,0.000035922367,0.0005646817,0.00044052748],"genre_scores_gemma":[0.019588957,0.00005116077,0.9779074,0.000945932,0.0012413367,0.000030844825,0.000015009153,0.00006129709,0.00015802319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565905,0.000043257383,0.00076777424,0.0019004986,0.0007343487,0.00089508307],"domain_scores_gemma":[0.9966288,0.00060175726,0.00054327305,0.0017493947,0.0002897686,0.00018696612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073492085,0.00062090694,0.0006215533,0.0006337738,0.00055032107,0.000640999,0.0034596508,0.00030666418,0.000017292494],"category_scores_gemma":[0.00013940429,0.00059527514,0.00017723229,0.00060378603,0.00049591175,0.0015925489,0.001946665,0.00083517504,0.0000051896313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019906138,0.00003149788,0.00008182777,0.00009036411,0.000015946383,0.000055413202,0.000274278,0.19221115,0.0005245198,0.014908987,0.00081674726,0.7909694],"study_design_scores_gemma":[0.00021156827,0.0001748844,0.00001247412,0.0009279194,0.000009327447,0.000103866514,4.438552e-8,0.8569026,0.0013048522,0.13473447,0.005118322,0.00049966364],"about_ca_topic_score_codex":0.000008497594,"about_ca_topic_score_gemma":0.000009432677,"teacher_disagreement_score":0.7904697,"about_ca_system_score_codex":0.00044247712,"about_ca_system_score_gemma":0.00017279068,"threshold_uncertainty_score":0.9996499},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048907026,0.0003705656,0.9897483,0.00006123041,0.00303404,0.0010642972,0.000056965167,0.00034471776,0.005270989],"genre_scores_gemma":[0.9173986,0.000010652121,0.08107557,0.00036186658,0.00031759037,0.000078610225,0.000046183693,0.00012314368,0.0005878213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977982,0.000029168576,0.0006194009,0.0007267896,0.00040895518,0.00041746456],"domain_scores_gemma":[0.9985928,0.00036581678,0.0001370528,0.000544636,0.00026836904,0.00009130851],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005038464,0.00041144935,0.0005752768,0.00029447878,0.000119068995,0.0001915711,0.0005217984,0.00028702707,0.000022508444],"category_scores_gemma":[0.000077998964,0.00039113784,0.00012963531,0.0002327602,0.00015821448,0.00016666565,0.00006854448,0.00022092646,0.000008140574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014520674,0.000008594275,0.000018697387,0.0002066564,0.000010358185,0.000003948247,0.00011394865,0.99169856,0.0001424383,0.0045387675,0.00023095892,0.003012539],"study_design_scores_gemma":[0.0006760245,0.000043344717,0.000032773238,0.00015238159,0.0000110170395,0.000008887804,1.6331224e-7,0.99156284,0.00014505014,0.0013934753,0.005577095,0.00039691583],"about_ca_topic_score_codex":0.0000058651667,"about_ca_topic_score_gemma":0.000029659659,"teacher_disagreement_score":0.91734964,"about_ca_system_score_codex":0.00040241185,"about_ca_system_score_gemma":0.000111217734,"threshold_uncertainty_score":0.999854},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003563357,0.0016736226,0.99702543,0.000013840785,0.00027409656,0.00009960963,0.0000013184663,0.000040041934,0.0005157291],"genre_scores_gemma":[0.24712557,0.00139909,0.75127214,0.00006828629,0.00006300987,0.0000029854903,0.000011812676,0.000043019285,0.000014091108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892205,0.000005578713,0.0003596288,0.00031820106,0.00019053063,0.00020398175],"domain_scores_gemma":[0.9994239,0.00023102827,0.00011313549,0.00013889543,0.000058976722,0.000034050507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003185118,0.00019288248,0.00030270874,0.00051228737,0.000044427554,0.000040002826,0.00010272596,0.00013530756,0.000005038722],"category_scores_gemma":[0.00004835356,0.0001992069,0.000033896442,0.00026582042,0.00011372857,0.00023890361,0.000047023754,0.00024583135,1.1320923e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015479237,0.000001752769,0.00010617918,0.00014265468,0.000001574319,0.000003443194,0.00016234351,0.96114427,0.0000026440555,0.00012745545,3.8305112e-7,0.038305726],"study_design_scores_gemma":[0.00006762138,0.000009378519,0.0000021816384,0.00052924757,0.0000035023438,0.000007915274,2.2560654e-7,0.9942253,0.000118142474,0.0048262,0.00002454462,0.0001856879],"about_ca_topic_score_codex":0.0000048609018,"about_ca_topic_score_gemma":0.000008181099,"teacher_disagreement_score":0.24676923,"about_ca_system_score_codex":0.000051598778,"about_ca_system_score_gemma":0.000043858694,"threshold_uncertainty_score":0.81234217},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1181061,0.0003831028,0.8730942,0.00020930331,0.0021465672,0.0010251479,0.000037394886,0.000055714227,0.00494249],"genre_scores_gemma":[0.87044626,0.000023205757,0.12753609,0.000820831,0.0005702712,0.000015679634,0.000023832292,0.00006697156,0.00049683615],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973386,0.000035918947,0.00052374374,0.0013788095,0.00020112604,0.00052179856],"domain_scores_gemma":[0.9983412,0.00041542758,0.00030898512,0.0007195235,0.00008359454,0.00013129377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008547551,0.00043628566,0.00056658953,0.0003620458,0.00019677132,0.00015088334,0.0006257011,0.00041888375,0.0000230007],"category_scores_gemma":[0.000041929878,0.00042202373,0.00014820104,0.00013420166,0.0006536772,0.00015282366,0.0002171456,0.00056300627,0.0000087946],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008374918,0.000063576015,0.0038989477,0.000104405684,0.00006481041,0.000006676992,0.0006042565,0.008951844,0.00011927804,0.009452497,0.00002795086,0.976622],"study_design_scores_gemma":[0.0034147718,0.002226585,0.116182595,0.0008381789,0.0002327236,0.00004070301,0.0000044710114,0.14439191,0.00018445618,0.7236761,0.005697473,0.0031100437],"about_ca_topic_score_codex":0.00007561615,"about_ca_topic_score_gemma":0.0001255259,"teacher_disagreement_score":0.973512,"about_ca_system_score_codex":0.00030271002,"about_ca_system_score_gemma":0.00030079315,"threshold_uncertainty_score":0.99982315},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07130011,0.00004138321,0.927565,0.0005441933,0.000110502995,0.0002024028,5.0151624e-7,0.00015821474,0.00007771894],"genre_scores_gemma":[0.55492735,0.0000066377497,0.44398415,0.0010355475,0.00003303268,0.00000564281,4.973436e-7,0.0000056448284,0.000001497053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999032,0.0000087555445,0.00013379219,0.000412156,0.00016099236,0.00025229968],"domain_scores_gemma":[0.9993435,0.00003833532,0.000039615916,0.00043617986,0.0000578514,0.00008450965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013658797,0.00010320742,0.000114472336,0.00016133835,0.0001006478,0.000019720344,0.0002649886,0.000021305588,0.0000145456825],"category_scores_gemma":[0.00005280209,0.00008423792,0.00002845648,0.00060669094,0.00028490555,0.0001204832,0.00018905399,0.00019354663,0.000011147262],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019706864,0.00032013268,0.14658341,0.000020294146,0.0000013652746,0.00010386805,0.0014157682,0.00043346192,0.09403757,0.00025551734,0.000019923078,0.75678897],"study_design_scores_gemma":[0.00063739106,0.00009588164,0.12901469,0.00013820032,0.0000089802,0.00022477451,0.0000013515224,0.7083982,0.1494862,0.011354139,0.0003907977,0.0002493907],"about_ca_topic_score_codex":0.00003325515,"about_ca_topic_score_gemma":0.0000045867423,"teacher_disagreement_score":0.7565396,"about_ca_system_score_codex":0.000044385586,"about_ca_system_score_gemma":0.000044816396,"threshold_uncertainty_score":0.3435123},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032338794,0.00011270369,0.99485165,0.00050063175,0.0011792872,0.00027772455,0.000006716363,0.00011791821,0.002921049],"genre_scores_gemma":[0.019548498,0.00009304568,0.97884005,0.0008351466,0.00023452862,0.0000073829137,0.00006914042,0.000013529779,0.00035866105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789715,0.00004885494,0.0004290326,0.00059642474,0.0007028392,0.00032569925],"domain_scores_gemma":[0.99868786,0.0002484319,0.0004136593,0.0003931474,0.00019275758,0.000064128304],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015103478,0.00028165913,0.00025377263,0.0006980245,0.00022562016,0.001197285,0.0005852192,0.00017944703,0.000013274208],"category_scores_gemma":[0.00009531184,0.00028228163,0.000050756815,0.0003529286,0.00014669637,0.0024921948,0.00059358595,0.0003515041,0.000017948423],"study_design_candidate":"design_other","study_design_consensus":null,"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.092659e-7,0.0000039741176,0.00029945237,0.000030622523,0.000008495189,0.0000023876748,0.00046226406,0.005875516,0.000020021154,0.011296537,0.000070322094,0.9819296],"study_design_scores_gemma":[0.00018774235,0.000040033206,0.002025692,0.00014544767,0.000013101389,0.00001396278,0.0000010010806,0.93464446,0.00036492574,0.057067208,0.005062389,0.00043406026],"about_ca_topic_score_codex":0.00008245186,"about_ca_topic_score_gemma":0.000023673656,"teacher_disagreement_score":0.98149556,"about_ca_system_score_codex":0.0005860415,"about_ca_system_score_gemma":0.00012887396,"threshold_uncertainty_score":0.9999629},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001163359,0.0004393656,0.99566567,0.0018730214,0.00076251634,0.0005460611,0.00030740615,0.00009056752,0.0001990767],"genre_scores_gemma":[0.047057383,0.00005940974,0.95043105,0.001312087,0.0008457701,0.000026137059,0.00019489219,0.000025393729,0.00004789617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628794,0.0000464538,0.00066906516,0.0020068102,0.0004322779,0.0005574739],"domain_scores_gemma":[0.99534297,0.0009772247,0.00036825024,0.0026040415,0.00041081998,0.00029668276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022225063,0.00038356654,0.00050259166,0.00029581113,0.0003664305,0.00054602645,0.004469513,0.00028208556,0.0000030697838],"category_scores_gemma":[0.00018088537,0.0003467622,0.000036894235,0.0005268788,0.0010086055,0.0014439542,0.0020112086,0.0005811483,0.000005075925],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003555216,0.000035659752,0.00017558668,0.000020606538,0.000008575815,0.0000040265,0.00079588644,0.000016254937,0.000005345497,0.035302237,0.00005545062,0.9635768],"study_design_scores_gemma":[0.0005337446,0.0009848628,0.0016675254,0.00036888247,0.000017691198,0.00007612265,0.0000037754337,0.9237269,0.0001271535,0.05114169,0.020293418,0.0010582465],"about_ca_topic_score_codex":0.000017065004,"about_ca_topic_score_gemma":0.00008896027,"teacher_disagreement_score":0.9625186,"about_ca_system_score_codex":0.000055374836,"about_ca_system_score_gemma":0.00074603077,"threshold_uncertainty_score":0.99989843},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002108095,0.0021031583,0.9926351,0.0015986533,0.0017285504,0.00031914996,6.5301333e-7,0.00010324493,0.0013007128],"genre_scores_gemma":[0.20483968,0.0015275115,0.7680533,0.0037210507,0.0021558332,0.00002866224,0.000005138712,0.00015535379,0.019513454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963029,0.000058435828,0.00041390912,0.001624557,0.00083820947,0.0007620033],"domain_scores_gemma":[0.99815845,0.0003444582,0.00025932852,0.0008948677,0.00018584145,0.00015703448],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011674486,0.00053651107,0.0005739185,0.00096667395,0.00021387296,0.0023328322,0.001963512,0.00032862907,0.000009779001],"category_scores_gemma":[0.000040458253,0.0004988695,0.00009104349,0.00040291055,0.00029306422,0.0020363785,0.0010421658,0.0010738459,0.00001584341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050114695,0.000020894728,0.0004195893,0.000066656,0.000011923651,0.0003156651,0.0033370622,0.37261125,0.00004899714,0.14200066,0.000030541418,0.48113173],"study_design_scores_gemma":[0.00020073072,0.00010804526,0.000037916754,0.0019078584,0.0000037896716,0.00011073812,0.0000024810035,0.87911355,0.0001724391,0.06412324,0.05345032,0.0007688656],"about_ca_topic_score_codex":0.000115744464,"about_ca_topic_score_gemma":0.00011863801,"teacher_disagreement_score":0.50650233,"about_ca_system_score_codex":0.0002754252,"about_ca_system_score_gemma":0.00019805682,"threshold_uncertainty_score":0.9997463},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045444146,0.00008882844,0.9441476,0.00014699674,0.004231892,0.00052925857,0.00003114865,0.0000981159,0.0052820095],"genre_scores_gemma":[0.6172484,0.0000024680287,0.38193822,0.00021951686,0.0003401598,0.0000024314693,0.0000065678437,0.000025119276,0.00021707601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.980422,0.000043505213,0.0020245616,0.004876699,0.011191377,0.0014418504],"domain_scores_gemma":[0.9898111,0.0016153111,0.0012559177,0.0032314903,0.0034814277,0.0006047529],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.03366944,0.00069273857,0.0010055715,0.009679288,0.0024731667,0.0052936473,0.011628081,0.00016055848,0.00005136229],"category_scores_gemma":[0.0022494437,0.00056421536,0.00013937305,0.008730885,0.050998565,0.0032941953,0.0078412555,0.00066900527,0.000042414616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010269911,0.00018744406,0.0005480501,0.00005556612,0.00000640275,0.000034641318,0.0026333139,0.24668702,0.0010653378,0.034760337,0.00013406317,0.71387756],"study_design_scores_gemma":[0.00025923114,0.00019618146,0.0015433921,0.00036089704,0.000011845562,0.00006591174,0.000010464666,0.8320504,0.0010195526,0.16359262,0.0003227502,0.0005667814],"about_ca_topic_score_codex":0.00006468753,"about_ca_topic_score_gemma":0.000044504985,"teacher_disagreement_score":0.7133108,"about_ca_system_score_codex":0.0005910696,"about_ca_system_score_gemma":0.0037797105,"threshold_uncertainty_score":0.99968094},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055804085,0.00051938475,0.9953295,0.00016671697,0.0020327638,0.00072104466,0.000012564085,0.0005651341,0.00059710327],"genre_scores_gemma":[0.017284539,0.00058731163,0.9806765,0.00057084556,0.00047227042,0.000025093383,0.00001681485,0.00005503852,0.00031163057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964989,0.00003152942,0.00070123916,0.0014250581,0.00071116735,0.0006321305],"domain_scores_gemma":[0.99713457,0.0005554545,0.00043704605,0.001093244,0.0006337823,0.0001459306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007965097,0.0005383376,0.0005570802,0.0008295058,0.00048512034,0.000735614,0.0021745989,0.0003525021,0.000003174106],"category_scores_gemma":[0.00008510611,0.0005514025,0.00020783978,0.0006991488,0.0007680476,0.00054729305,0.0008390731,0.00051834155,0.0000045668107],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003940679,0.000025168178,0.000054691598,0.00008001713,0.000013086072,0.000019999954,0.00063124637,0.0024620227,0.000016783188,0.14024371,0.00011179291,0.85633755],"study_design_scores_gemma":[0.00025682503,0.00034366464,0.000022102698,0.0005359807,0.00000948438,0.00024679877,2.0579584e-7,0.7873372,0.0016273127,0.18981917,0.01888875,0.00091254286],"about_ca_topic_score_codex":0.000014733657,"about_ca_topic_score_gemma":0.000020042335,"teacher_disagreement_score":0.855425,"about_ca_system_score_codex":0.00019595434,"about_ca_system_score_gemma":0.00047587272,"threshold_uncertainty_score":0.99969375},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012848635,0.00043851158,0.9874644,0.00096926885,0.002035595,0.00046081064,0.000009616108,0.00031004573,0.0070268717],"genre_scores_gemma":[0.33712012,0.00008965659,0.65293086,0.005213919,0.0031742086,0.00003198307,0.0000804112,0.00015710658,0.0012017739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946759,0.00012188417,0.0008953013,0.002081344,0.0011522329,0.0010733759],"domain_scores_gemma":[0.99630314,0.0011029608,0.0005197749,0.0017233118,0.0001688398,0.00018197366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018012603,0.0006959669,0.00071185495,0.0012005143,0.0002621494,0.0009771233,0.0038949456,0.00044835653,0.000020368303],"category_scores_gemma":[0.00022423801,0.0006874314,0.00017835376,0.0008727616,0.00059490686,0.0016674448,0.0018828271,0.0011339157,0.00013373795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035969457,0.0001737644,0.000023188431,0.000043686105,0.00002445049,0.0009641418,0.0010867784,0.097395435,0.0038864757,0.010144909,0.0014052489,0.88481593],"study_design_scores_gemma":[0.00088018144,0.00020215499,0.00007972398,0.00059766864,0.000018694082,0.00017609386,6.1511616e-7,0.92047125,0.00342298,0.056960262,0.015626756,0.0015636262],"about_ca_topic_score_codex":0.00026839878,"about_ca_topic_score_gemma":0.00006344815,"teacher_disagreement_score":0.8832523,"about_ca_system_score_codex":0.0005588475,"about_ca_system_score_gemma":0.0006258256,"threshold_uncertainty_score":0.9995577},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049398273,0.00070604496,0.97552687,0.0003784613,0.0012322686,0.00047832527,9.160325e-7,0.00029327348,0.021334413],"genre_scores_gemma":[0.5939764,0.000016556309,0.40153632,0.0011292187,0.00097212783,0.000024730003,0.000009198701,0.00007014112,0.0022653549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566144,0.000042174677,0.0004981079,0.0017197714,0.0011837214,0.0008947762],"domain_scores_gemma":[0.9974192,0.0002183029,0.0003448428,0.0016297178,0.00020258305,0.00018539117],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008429186,0.0006187831,0.00059860974,0.00061265944,0.00030332064,0.00083571346,0.0035605042,0.00035540003,0.000013086756],"category_scores_gemma":[0.000016479959,0.00046210588,0.00013124436,0.0007103217,0.0007923346,0.00051742623,0.0008845991,0.0007250372,0.000107114975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074289146,0.000051139432,0.0003286214,0.000066615066,0.000025038598,0.0004917814,0.0006086249,0.0070581697,0.00003647473,0.53266585,0.00017218952,0.45848808],"study_design_scores_gemma":[0.00060127437,0.0005772242,0.00023927409,0.00014450768,0.0000136518165,0.00044884777,2.4753746e-7,0.05116078,0.0004313569,0.91802084,0.02696929,0.0013927128],"about_ca_topic_score_codex":0.000095394884,"about_ca_topic_score_gemma":0.00027203377,"teacher_disagreement_score":0.59392697,"about_ca_system_score_codex":0.00028647482,"about_ca_system_score_gemma":0.00060868775,"threshold_uncertainty_score":0.99978304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004120333,0.00042552513,0.8985524,0.0008554308,0.0034643663,0.0021834474,0.000016417933,0.00008874119,0.09437247],"genre_scores_gemma":[0.63180286,0.00030825808,0.34328872,0.0020433066,0.014085376,0.000645756,0.000054780125,0.00019207184,0.007578865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960103,0.00012179966,0.0005364595,0.0012488595,0.0009902378,0.0010923275],"domain_scores_gemma":[0.99526775,0.0026035416,0.0006370607,0.00045923903,0.00089946855,0.0001329439],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034473462,0.0004244603,0.0005281432,0.000611312,0.0010006084,0.00047295174,0.001175412,0.00051498716,0.00003416331],"category_scores_gemma":[0.0012629735,0.0004357085,0.00022667955,0.0004320837,0.0009904279,0.0011292532,0.0001408306,0.0006189586,0.000010117315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012164386,0.000067347995,0.000007004682,0.000033554803,0.000046295332,0.0000033086503,0.008863267,0.08367846,0.00010115943,0.68310034,0.0003254384,0.2236522],"study_design_scores_gemma":[0.00028510523,0.00032072546,0.000001880949,0.00012470825,0.000050544095,0.0000042954325,0.000010429736,0.038398936,0.00035524563,0.8723321,0.087612964,0.0005030449],"about_ca_topic_score_codex":0.0010311636,"about_ca_topic_score_gemma":0.0021175565,"teacher_disagreement_score":0.63176167,"about_ca_system_score_codex":0.0017726416,"about_ca_system_score_gemma":0.004492779,"threshold_uncertainty_score":0.99980944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000070488684,0.000067533525,0.9914369,0.00084087544,0.0003348348,0.004788059,0.000006644741,0.00028563954,0.0021690452],"genre_scores_gemma":[0.30248237,0.0000017058524,0.6944515,0.001177889,0.00028942368,0.0010037882,0.000008998938,0.00006529765,0.0005190298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954516,0.0000282157,0.0005154515,0.0020022013,0.001296032,0.00070649554],"domain_scores_gemma":[0.99666196,0.00019226076,0.0003505842,0.0021899028,0.00033745516,0.0002678579],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006144637,0.00054881786,0.0004373984,0.00089999667,0.00026207563,0.00037142044,0.0033292633,0.00021005946,0.000013639544],"category_scores_gemma":[0.000038299902,0.000477494,0.000079553916,0.0011588727,0.0005094707,0.00022595994,0.0011989718,0.0005105129,0.00018352868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013861493,0.00013753586,0.000060015256,0.000093227995,0.000009420809,0.00003152486,0.0021079364,0.29987243,0.00020462167,0.22069359,0.000023583061,0.47675225],"study_design_scores_gemma":[0.00033189077,0.000230188,0.00025024245,0.00031698414,0.000009574968,0.00003475521,1.420648e-7,0.78631157,0.0019456004,0.2046763,0.004954149,0.00093861856],"about_ca_topic_score_codex":0.000017499255,"about_ca_topic_score_gemma":0.000051850388,"teacher_disagreement_score":0.4864391,"about_ca_system_score_codex":0.00047322764,"about_ca_system_score_gemma":0.0003361242,"threshold_uncertainty_score":0.99976766},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028387628,0.00030038456,0.96926534,0.0000640944,0.00049264316,0.0012723868,0.00001266131,0.00008370428,0.00012114782],"genre_scores_gemma":[0.27222887,0.00006694861,0.72702104,0.0003111306,0.00010952763,0.000048567486,0.0000061839155,0.000032809745,0.00017489622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996307,0.00008187702,0.0007896998,0.0013371325,0.0008387186,0.0006455594],"domain_scores_gemma":[0.9958706,0.0011847953,0.0005149617,0.0017248441,0.0005885187,0.000116303934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031545863,0.0005174223,0.00093386066,0.0009760128,0.00052344316,0.00023280823,0.002133839,0.0003328854,0.000010300163],"category_scores_gemma":[0.00023954971,0.00035674294,0.00024355734,0.0018706995,0.0011739812,0.0007093238,0.00072309555,0.0004493801,0.0000045506167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003568813,0.00008462842,0.01987396,0.0009685008,0.00033557453,0.0000030221,0.0018436604,0.4879472,0.00019710803,0.0004894207,0.00003409635,0.48818713],"study_design_scores_gemma":[0.0002092,0.00028684837,0.0017867122,0.00026669618,0.00015752773,0.000023896762,2.796373e-7,0.99366623,0.0012661953,0.0018817902,0.000114192626,0.0003404035],"about_ca_topic_score_codex":0.000008844252,"about_ca_topic_score_gemma":0.000003475239,"teacher_disagreement_score":0.50571907,"about_ca_system_score_codex":0.00022729217,"about_ca_system_score_gemma":0.0006366765,"threshold_uncertainty_score":0.9998885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066138303,0.001396535,0.9961718,0.000034873403,0.00062528776,0.00033328024,0.000002843022,0.00026994228,0.00050408574],"genre_scores_gemma":[0.047455244,0.00009339112,0.95223165,0.000101824255,0.000058654005,0.0000044196026,0.0000068959957,0.00002204553,0.000025891024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963144,0.00006820044,0.0006209308,0.0014743194,0.0009384248,0.0005837089],"domain_scores_gemma":[0.9962245,0.0016533335,0.00044329828,0.0011711242,0.00039210008,0.00011560754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011487562,0.00051572523,0.0009772547,0.0013456525,0.00016379567,0.0001352127,0.0015304111,0.00032923743,0.000003689259],"category_scores_gemma":[0.00042675188,0.00046829286,0.00017193911,0.0024538052,0.0008672998,0.0006553905,0.0013223938,0.00074814114,0.0000014396758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012751916,0.00003299883,0.0005447829,0.000049169677,0.0001817468,0.00009822089,0.0027463404,0.2622979,0.00019414959,0.058316633,5.277242e-7,0.6755248],"study_design_scores_gemma":[0.00045260572,0.00058130646,0.002754467,0.00087350665,0.0002354915,0.00008785355,0.0000028104753,0.70530283,0.0043278616,0.2837094,0.0002972163,0.0013746134],"about_ca_topic_score_codex":0.000031872263,"about_ca_topic_score_gemma":0.000094722236,"teacher_disagreement_score":0.67415017,"about_ca_system_score_codex":0.00019573743,"about_ca_system_score_gemma":0.00016938876,"threshold_uncertainty_score":0.9997769},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000111813475,0.0005349207,0.9714443,0.00020537226,0.002231654,0.0004427442,0.0000134722795,0.00021726644,0.024798457],"genre_scores_gemma":[0.72294545,0.00043828698,0.2687811,0.0026944305,0.0019444439,0.000053768043,0.00026331333,0.0000949813,0.0027842447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601334,0.000030889136,0.0006646342,0.001241256,0.0013305271,0.0007193792],"domain_scores_gemma":[0.9963156,0.00016961597,0.00035210076,0.0026865944,0.000309025,0.00016704248],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015246754,0.00048553917,0.0005232159,0.0011645871,0.00024545615,0.00075648073,0.008117633,0.00034202938,0.000013105522],"category_scores_gemma":[0.00017894049,0.00043701907,0.00007431434,0.00080117123,0.00027136347,0.0030201823,0.005889491,0.00074238627,0.00020002271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010525604,0.000060121878,0.0011201671,0.0004958566,0.000021301355,0.00042028836,0.01763557,0.008741543,0.0000044794133,0.028213976,0.0014415772,0.94183457],"study_design_scores_gemma":[0.0004149818,0.00006579366,0.00088214735,0.0007848043,0.000004884359,0.00022098956,0.0000010686433,0.9736035,0.00003227542,0.0036553768,0.019659718,0.0006745003],"about_ca_topic_score_codex":0.00009926208,"about_ca_topic_score_gemma":0.00019224269,"teacher_disagreement_score":0.9648619,"about_ca_system_score_codex":0.00059995626,"about_ca_system_score_gemma":0.0004267546,"threshold_uncertainty_score":0.99980813},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85890585,0.00044309345,0.13701251,0.00079613394,0.00052836526,0.0004367771,0.0000071114664,0.000043250213,0.0018269371],"genre_scores_gemma":[0.98846126,0.0001225311,0.010870785,0.0002598184,0.0001684499,0.000005253379,0.000007918375,0.00003649391,0.0000674776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742514,0.00006200516,0.00051436335,0.0010069411,0.000436002,0.0005555352],"domain_scores_gemma":[0.99865705,0.00054011174,0.00019531144,0.0004095861,0.000023333676,0.00017461208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007355179,0.00047585223,0.000437168,0.00028705763,0.00058401824,0.0004743637,0.0005770409,0.00031017026,0.000090274676],"category_scores_gemma":[0.00007711909,0.00032586386,0.00005235406,0.00032727205,0.00106824,0.00059296115,0.0010410154,0.0018781779,0.000007899317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052153875,0.00011117728,0.15232226,0.00017867397,0.00010330082,0.00012231323,0.03655625,0.42096904,0.0563047,0.0007354992,0.000006308191,0.3325383],"study_design_scores_gemma":[0.00031376095,0.000065510336,0.0023347037,0.0003837254,0.000030396921,0.000017946422,0.000010408465,0.92808163,0.004926876,0.06308013,0.0000655455,0.00068937405],"about_ca_topic_score_codex":0.0007318778,"about_ca_topic_score_gemma":0.0013174649,"teacher_disagreement_score":0.50711256,"about_ca_system_score_codex":0.000151624,"about_ca_system_score_gemma":0.00005107105,"threshold_uncertainty_score":0.99991935},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31899434,0.000026277186,0.6806102,0.000052368956,0.0002044795,0.000052417457,4.327817e-7,0.00003752373,0.000022012686],"genre_scores_gemma":[0.89759046,0.0000022944291,0.10233521,0.000028897382,0.00003307152,0.0000011776903,0.0000027052852,0.0000061175574,7.2280926e-8],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918467,0.000016413513,0.00021415408,0.00016432181,0.0002512576,0.00016919336],"domain_scores_gemma":[0.9996117,0.00009216437,0.000029867635,0.0001785345,0.000041832853,0.000045909735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009305561,0.000095618685,0.00015435489,0.00010863481,0.000059064037,0.0000203309,0.0001805759,0.00004764434,0.000010350889],"category_scores_gemma":[0.00005746189,0.00007936046,0.00002301074,0.0003940558,0.00039320232,0.00006482677,0.000023584713,0.00010814792,0.0000012761031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022063318,0.000029319974,0.009600708,0.000014378955,0.0000012750496,0.0000024942924,0.0005051798,0.98092085,0.0018087514,0.0030707407,0.0000058317305,0.0040382384],"study_design_scores_gemma":[0.00008713252,0.00004801123,0.004833748,0.000022147462,0.000001326812,0.00000566868,4.620512e-7,0.9419059,0.048017457,0.0049939626,0.000001447756,0.0000827348],"about_ca_topic_score_codex":0.0000035765322,"about_ca_topic_score_gemma":0.0000055424944,"teacher_disagreement_score":0.5785961,"about_ca_system_score_codex":0.0000433157,"about_ca_system_score_gemma":0.000025975774,"threshold_uncertainty_score":0.32362255},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022241846,0.0012663316,0.99377733,0.00026054363,0.0016401592,0.00031642788,0.0000149581865,0.0003160203,0.002185785],"genre_scores_gemma":[0.10182179,0.00025754847,0.8965805,0.0010016125,0.00018925323,0.000011011376,0.000016602964,0.000043392356,0.00007827484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956174,0.000021126309,0.00054584706,0.001993533,0.00095153396,0.00087058224],"domain_scores_gemma":[0.99692494,0.00021989307,0.0002490999,0.0022001213,0.00016319093,0.00024276305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007181351,0.0006550235,0.00057922694,0.0011909938,0.00033125016,0.00081940123,0.004929831,0.0003707387,0.000033016964],"category_scores_gemma":[0.00005242023,0.00062464894,0.00023581981,0.0010057616,0.0007571019,0.0011246352,0.002547516,0.0010466464,0.000051451738],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083727255,0.0001010574,0.00020710209,0.0000768503,0.000033115866,0.00039737383,0.00068277883,0.005512332,0.0005107694,0.10301225,0.000021214288,0.8894368],"study_design_scores_gemma":[0.0004137661,0.00012863925,0.00018740557,0.0003845918,0.000011081657,0.00015907713,1.542966e-7,0.8443297,0.00062620227,0.14266782,0.009984451,0.0011071042],"about_ca_topic_score_codex":0.000021463791,"about_ca_topic_score_gemma":0.00018843806,"teacher_disagreement_score":0.8883297,"about_ca_system_score_codex":0.00020466335,"about_ca_system_score_gemma":0.00026804436,"threshold_uncertainty_score":0.9996205},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010521266,0.00031326714,0.9891156,0.00025589368,0.0010504449,0.00020655135,0.0000011273056,0.00019483657,0.007810146],"genre_scores_gemma":[0.22786844,0.00007130153,0.7703118,0.0006529043,0.0004949307,0.0000034389718,0.000003335326,0.000038345577,0.00055556686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996309,0.00005473297,0.00042418463,0.0016589833,0.00095037307,0.00060277025],"domain_scores_gemma":[0.997214,0.0012491909,0.00024387194,0.00089109794,0.00018263176,0.00021918424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016456255,0.00046778753,0.0004792243,0.0007958919,0.000404659,0.00047010073,0.0017827853,0.0003164934,0.000017553646],"category_scores_gemma":[0.0003738414,0.00040914584,0.000094618386,0.0005567138,0.0006489796,0.0005358562,0.001627779,0.0017753532,0.000022338563],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007910422,0.000012639994,0.00021436418,0.000012326198,0.0000039943625,0.000045932815,0.000644216,0.0093427515,0.000015238609,0.0033984613,0.0000015763643,0.9863006],"study_design_scores_gemma":[0.00040313177,0.00032737863,0.0032521575,0.00033430933,0.0000060130305,0.00010866566,4.2464288e-7,0.87507737,0.0003168366,0.11525391,0.004174947,0.0007448735],"about_ca_topic_score_codex":0.00004301511,"about_ca_topic_score_gemma":0.00012165313,"teacher_disagreement_score":0.9855557,"about_ca_system_score_codex":0.00021731356,"about_ca_system_score_gemma":0.0002605,"threshold_uncertainty_score":0.999836},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023045392,0.0003616999,0.98706037,0.001756174,0.000595881,0.00044390632,0.000007692763,0.00009331888,0.009450478],"genre_scores_gemma":[0.6815487,0.00018351768,0.312814,0.003273932,0.0006491901,0.000027871796,0.000003276456,0.000088329834,0.0014111549],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956295,0.00009649835,0.0005057793,0.0013467254,0.0016685394,0.0007529426],"domain_scores_gemma":[0.99459314,0.0022109495,0.00031043869,0.002488049,0.0002535159,0.00014390516],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016061375,0.00050147146,0.0005069836,0.00084182544,0.00027850165,0.00023883714,0.006635599,0.0002274683,0.00006403888],"category_scores_gemma":[0.00025116524,0.00033842074,0.00019124389,0.00086748385,0.0016809142,0.00042866138,0.0016327724,0.0012021357,0.00006790504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010642236,0.000032002783,0.000008526126,0.000010879459,0.00000945707,0.000028616136,0.00038225634,0.016024385,0.00012177442,0.4558156,0.000026504089,0.52752936],"study_design_scores_gemma":[0.00017909678,0.00031953974,0.00005890631,0.00028444888,0.000003339486,0.000025237476,2.5576563e-7,0.108689114,0.0024899482,0.88598996,0.001548658,0.00041147164],"about_ca_topic_score_codex":0.000006828326,"about_ca_topic_score_gemma":0.000046860478,"teacher_disagreement_score":0.6813183,"about_ca_system_score_codex":0.00019265385,"about_ca_system_score_gemma":0.0003859538,"threshold_uncertainty_score":0.9999068},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005144249,0.0011692833,0.99433625,0.00080692215,0.0005131333,0.0003731972,0.0000056363497,0.00034571104,0.0023984476],"genre_scores_gemma":[0.12666816,0.0000109488365,0.872233,0.0006187879,0.00034323853,0.000007613385,0.0000032968092,0.000017137278,0.00009785503],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756634,0.0000188803,0.00044997482,0.00091456,0.0007192898,0.00033093742],"domain_scores_gemma":[0.9980398,0.0002296729,0.00020989396,0.0009893153,0.00041507726,0.000116230796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045045558,0.0003350299,0.00036981888,0.0008824676,0.00011072112,0.00023232782,0.0025235,0.00023352166,0.000010734803],"category_scores_gemma":[0.00010118734,0.00029009648,0.00010062543,0.0008439288,0.00022763202,0.00070003467,0.00055095385,0.00048287207,0.0000061214682],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042619627,0.000024010025,0.00002114098,0.00004347879,0.0000047468748,0.000010730447,0.0027679827,0.0053764465,0.0013133135,0.010579301,0.000016333066,0.97983825],"study_design_scores_gemma":[0.00037134366,0.0004539141,0.00013482907,0.0016160714,0.000017063743,0.000089132845,1.7997736e-7,0.29605377,0.03976727,0.65738875,0.0026047272,0.001502985],"about_ca_topic_score_codex":0.000013168698,"about_ca_topic_score_gemma":0.00005175138,"teacher_disagreement_score":0.97833526,"about_ca_system_score_codex":0.00015344669,"about_ca_system_score_gemma":0.00025438238,"threshold_uncertainty_score":0.9999551},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022700704,0.00062282,0.971381,0.00010776184,0.001202862,0.00021877052,0.000017894032,0.00028704136,0.023891777],"genre_scores_gemma":[0.87156373,0.00047017154,0.12438035,0.00096373615,0.0011057633,0.00002047908,0.000028191898,0.00017088953,0.0012966928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977128,0.0000063762272,0.00042008515,0.0006554804,0.00053473434,0.0006705223],"domain_scores_gemma":[0.99895847,0.000058887093,0.00007740056,0.00064458745,0.000082294275,0.000178372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002492415,0.00046556586,0.0004477884,0.00030042496,0.00011040232,0.00023705236,0.0009238945,0.0003060651,0.00007578717],"category_scores_gemma":[0.000017374818,0.00043641025,0.0000979023,0.00038390842,0.00028175348,0.00026788807,0.00023455771,0.0006525271,0.000049982515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028224306,0.000012159198,0.00018478314,0.00003055532,0.0000132166115,0.00012434699,0.00012221577,0.7629236,0.000102499616,0.0013582009,0.000058525027,0.2350671],"study_design_scores_gemma":[0.00020447606,0.000052441297,0.0003202451,0.00014789132,0.000012264723,0.000068955094,1.4635306e-7,0.9746101,0.00027184119,0.014062536,0.009622853,0.0006262306],"about_ca_topic_score_codex":0.00002938687,"about_ca_topic_score_gemma":0.00022427176,"teacher_disagreement_score":0.86929363,"about_ca_system_score_codex":0.00024222028,"about_ca_system_score_gemma":0.0001488623,"threshold_uncertainty_score":0.9998088},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026912787,0.0005804797,0.99249315,0.0003228431,0.00031602854,0.0001770685,0.0000033381448,0.000036429865,0.0033793533],"genre_scores_gemma":[0.64694506,0.00011773951,0.34415597,0.0017252606,0.0016382908,0.000024419487,0.00011799881,0.00005399669,0.0052212537],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821216,0.000020855376,0.00024685677,0.00087548845,0.0003161771,0.00032847733],"domain_scores_gemma":[0.9992217,0.00003083149,0.00008367715,0.00046533524,0.000088180925,0.000110297406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045255898,0.00023531985,0.0002114727,0.00018618735,0.00012468983,0.000100432335,0.00075324054,0.00037477948,0.000009469071],"category_scores_gemma":[0.00017827141,0.00021125031,0.00006968353,0.00014394066,0.0003963857,0.000004124705,0.0004085779,0.00035626418,0.000028862862],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012698872,0.000022824044,0.00004243696,0.000018839166,0.0000092133605,0.000002408874,0.00026930595,0.013031618,0.023323935,0.00010624516,0.00009454097,0.9630659],"study_design_scores_gemma":[0.0020896941,0.0024599708,0.0026295278,0.00083146396,0.00008618,0.0002812558,0.000011897508,0.21226126,0.15560862,0.010534738,0.60843426,0.0047710952],"about_ca_topic_score_codex":0.0000048823586,"about_ca_topic_score_gemma":0.00001552079,"teacher_disagreement_score":0.95829487,"about_ca_system_score_codex":0.000049131315,"about_ca_system_score_gemma":0.00014333405,"threshold_uncertainty_score":0.8614538},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065325835,0.001005591,0.99452144,0.00040031463,0.0016095574,0.00035854796,0.000015884629,0.00023915463,0.001196236],"genre_scores_gemma":[0.5456834,0.00009679683,0.45285943,0.0004388006,0.0008275246,0.000010351196,0.000027639273,0.000034863107,0.000021221937],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960915,0.00004068768,0.0003735272,0.0015525592,0.0010803414,0.0008614243],"domain_scores_gemma":[0.99753535,0.0001419868,0.00024770992,0.0015933242,0.00020455854,0.00027704344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000770358,0.0005976616,0.0004657047,0.00083108555,0.00033485994,0.0005912388,0.0029039448,0.00040246372,0.00002726187],"category_scores_gemma":[0.000017675344,0.00047235837,0.00013876539,0.00074387994,0.0010536833,0.0016307657,0.0010977038,0.0012317661,0.000026815735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008905791,0.00020634441,0.00015423012,0.00014643997,0.0000742294,0.00019402444,0.008194928,0.02972629,0.00052843115,0.26307693,0.00024071289,0.6973684],"study_design_scores_gemma":[0.0018429684,0.0016848663,0.0007572335,0.0015192068,0.00011636188,0.0014458229,0.0000035156613,0.21628983,0.01803859,0.72586983,0.026576899,0.0058548786],"about_ca_topic_score_codex":0.000029834768,"about_ca_topic_score_gemma":0.00002587673,"teacher_disagreement_score":0.6915135,"about_ca_system_score_codex":0.0001635958,"about_ca_system_score_gemma":0.00028922452,"threshold_uncertainty_score":0.9997728},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005531108,0.002100717,0.9819141,0.000041385334,0.00047641795,0.00032761449,0.000016086024,0.00030064164,0.009291956],"genre_scores_gemma":[0.96497864,0.0004983575,0.03426908,0.00007663636,0.000085800086,0.000011571317,0.0000062822014,0.000041022584,0.000032607786],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875164,0.000025167416,0.000371316,0.00031693815,0.00029138624,0.0002435613],"domain_scores_gemma":[0.9986176,0.00028787216,0.00011633544,0.0008036987,0.000109539,0.00006493569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043727396,0.0003083148,0.0005346569,0.00045313814,0.000068430534,0.0000644857,0.0009851736,0.00021752305,0.000022993247],"category_scores_gemma":[0.000017127944,0.00030309934,0.000055227585,0.00014052876,0.0011758899,0.00018755105,0.0003777373,0.00055100967,0.000002261665],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006148081,0.000057666002,0.0002753243,0.0013614265,0.00012164092,0.000040326697,0.04312379,0.062532715,0.0036502923,0.14147682,0.00010319844,0.7471953],"study_design_scores_gemma":[0.0012984864,0.00017897834,0.00008248603,0.002356046,0.00003469106,0.00009301858,0.0000026192045,0.29913887,0.10638772,0.5865327,0.0023563716,0.0015380051],"about_ca_topic_score_codex":0.0000700822,"about_ca_topic_score_gemma":0.00012297896,"teacher_disagreement_score":0.95944756,"about_ca_system_score_codex":0.00006634347,"about_ca_system_score_gemma":0.00003462599,"threshold_uncertainty_score":0.9999421},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007348911,0.00010471546,0.9901527,0.00015162639,0.0008032212,0.0010609033,0.000012663668,0.00012936474,0.00023586792],"genre_scores_gemma":[0.79031795,0.00000885878,0.20869747,0.000712282,0.00012866821,0.000053943797,0.000026400876,0.000025156327,0.000029279665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661005,0.00017475695,0.0006455911,0.0012118916,0.0008872097,0.00047050128],"domain_scores_gemma":[0.99766004,0.00030991787,0.00036260253,0.0011683231,0.00031477367,0.00018433694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013917795,0.00042038749,0.00040298284,0.0009239232,0.00029119087,0.0005127716,0.0024691771,0.0002521354,0.000034312754],"category_scores_gemma":[0.000071516064,0.00042363303,0.00006833207,0.0006751199,0.00027368817,0.0020040378,0.0006963819,0.00048706922,0.000048230333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029990391,0.00047551974,0.0015209186,0.000072924806,0.000017952327,0.0001431453,0.015527154,0.27196592,0.0016685392,0.08956485,0.0000035416617,0.61900955],"study_design_scores_gemma":[0.0007434759,0.00026674097,0.011177187,0.001736088,0.000016863542,0.000039651837,0.000004650295,0.8940789,0.0016660467,0.08921302,0.000041447416,0.0010158991],"about_ca_topic_score_codex":0.00017002053,"about_ca_topic_score_gemma":0.0003268887,"teacher_disagreement_score":0.78296906,"about_ca_system_score_codex":0.00067699444,"about_ca_system_score_gemma":0.00064016227,"threshold_uncertainty_score":0.99982154},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001572882,0.00034541672,0.99495,0.00049679796,0.0020908162,0.00036237467,0.0000060833563,0.00014103139,0.0014501669],"genre_scores_gemma":[0.23844904,0.00008646379,0.75971454,0.00085837994,0.00040981642,0.000009814237,0.0000225349,0.00003174147,0.00041768208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969205,0.000051950286,0.00044258477,0.0013510546,0.00081896957,0.0004149068],"domain_scores_gemma":[0.99747515,0.00016583003,0.00042661588,0.0013908428,0.00039993707,0.000141653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010762204,0.0003730302,0.00035451644,0.0014725835,0.00030763316,0.000695789,0.002475226,0.00040110553,0.00003230827],"category_scores_gemma":[0.00013319032,0.00036102388,0.000103136386,0.0013754264,0.000402505,0.00070452027,0.0006526154,0.0006786928,0.000060393395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008238671,0.00007098484,0.000068686684,0.00006403081,0.000018448736,0.000026532949,0.002583841,0.0035492443,0.0019214791,0.18178894,0.000068523244,0.8098311],"study_design_scores_gemma":[0.00024443012,0.000077087905,0.0014975362,0.00027247047,0.000016263713,0.00008318518,3.0760094e-7,0.81299394,0.0049712136,0.17371367,0.0052438113,0.0008860525],"about_ca_topic_score_codex":0.00008566443,"about_ca_topic_score_gemma":0.000049393144,"teacher_disagreement_score":0.8094447,"about_ca_system_score_codex":0.00039343003,"about_ca_system_score_gemma":0.0005562031,"threshold_uncertainty_score":0.9998842},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006069707,0.00022732251,0.9951408,0.00042474843,0.002025382,0.00046437318,0.0000041366725,0.00017797128,0.0009282872],"genre_scores_gemma":[0.38557962,0.00013035593,0.6113376,0.0016500353,0.0010168595,0.000011200406,0.0000054453612,0.00007229385,0.00019659652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950699,0.000077719626,0.00091383164,0.0020271947,0.0008816422,0.0010296672],"domain_scores_gemma":[0.99668086,0.00038807327,0.0003465897,0.0020814375,0.00023766924,0.00026535004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008669614,0.00061158906,0.00063480745,0.0009839566,0.00040405337,0.00045767872,0.0043946,0.00047303247,0.000023883265],"category_scores_gemma":[0.00011681838,0.0005997656,0.00015865338,0.00093713583,0.0013535357,0.0014123087,0.0011479629,0.0011152184,0.000048311304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029034956,0.00012810044,0.00026090597,0.000019684712,0.00001159817,0.00042957216,0.005376973,0.34099647,0.0015623535,0.014541867,0.000032267937,0.63661116],"study_design_scores_gemma":[0.00010320244,0.00014915837,0.00006973227,0.00020714714,0.0000041271333,0.00010959318,5.130137e-7,0.9544208,0.003141063,0.039724752,0.001368568,0.0007013513],"about_ca_topic_score_codex":0.00024861988,"about_ca_topic_score_gemma":0.000772708,"teacher_disagreement_score":0.63590986,"about_ca_system_score_codex":0.0006260583,"about_ca_system_score_gemma":0.0010765637,"threshold_uncertainty_score":0.99964535},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006063149,0.0003180069,0.99504906,0.00035956755,0.00058375264,0.0007120251,0.000016155813,0.0025237799,0.00037702173],"genre_scores_gemma":[0.083291724,0.00007084852,0.91437215,0.00137917,0.00047722395,0.000051373372,0.000011146738,0.000057479723,0.00028891422],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694365,0.000014190615,0.00048162744,0.0014357386,0.0005477852,0.00057698536],"domain_scores_gemma":[0.9936702,0.0043618535,0.00031778755,0.0011703358,0.0003514621,0.00012831006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010713049,0.00048920274,0.00046774014,0.00059582945,0.00043608464,0.00091334083,0.0017777687,0.0004074633,0.0000044168264],"category_scores_gemma":[0.0035655978,0.00045712516,0.000088531706,0.00045331178,0.00054718327,0.0005112156,0.0009659305,0.000600579,0.0000060743],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033567178,0.0000619325,0.0019553395,0.0001479502,0.0000049427654,0.000025325195,0.0004110049,0.00009793723,0.0006693531,0.013599058,0.00020624747,0.98281753],"study_design_scores_gemma":[0.00035143644,0.00062942004,0.0005404177,0.0010719845,0.000014696152,0.0001991978,1.8099465e-8,0.22795404,0.0027237239,0.75901085,0.006482665,0.001021539],"about_ca_topic_score_codex":0.000012397338,"about_ca_topic_score_gemma":0.000013391089,"teacher_disagreement_score":0.981796,"about_ca_system_score_codex":0.00011638217,"about_ca_system_score_gemma":0.00039505027,"threshold_uncertainty_score":0.99978805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010020341,0.001017046,0.98693186,0.00001776549,0.00048550422,0.00032107226,0.0000023745915,0.00014099121,0.0010630573],"genre_scores_gemma":[0.9773604,0.0003096135,0.021645477,0.00008419064,0.00047657586,0.000017715916,0.000012268972,0.00008480438,0.000008903414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765164,0.000031840424,0.00062767824,0.00077166985,0.00029369525,0.0006234572],"domain_scores_gemma":[0.99873346,0.0003298724,0.00019407395,0.00058261637,0.000053621505,0.00010637536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007092062,0.0004687183,0.00062961935,0.0003805214,0.00010524735,0.0001129349,0.00074650213,0.00041902962,0.0000126467385],"category_scores_gemma":[0.0000059186086,0.00050078664,0.000054566066,0.00030982247,0.0003835228,0.00036016703,0.00018913334,0.00078714517,9.756072e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006230993,0.000006241849,0.0033451216,0.000090520894,0.0000091386255,0.0000067341184,0.0008112911,0.7933918,0.00017712232,0.0007351132,0.000007105456,0.20141354],"study_design_scores_gemma":[0.00014904523,0.000032918193,0.0029969409,0.0012751521,0.000012114757,0.000014914018,5.885332e-7,0.9840171,0.00022478633,0.010759137,0.00003190035,0.00048542433],"about_ca_topic_score_codex":0.00008067664,"about_ca_topic_score_gemma":0.00045815352,"teacher_disagreement_score":0.9673401,"about_ca_system_score_codex":0.00013828486,"about_ca_system_score_gemma":0.000039436436,"threshold_uncertainty_score":0.99974436},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024850018,0.00034137047,0.9898158,0.00082750677,0.00078895356,0.00039965464,0.000024614868,0.00013284442,0.007644435],"genre_scores_gemma":[0.108374804,0.00002402376,0.88990444,0.0010876134,0.0003649228,0.000014293508,0.000026824875,0.000027117692,0.00017596927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996821,0.00004590085,0.0006907887,0.0010719515,0.00089387974,0.00047649824],"domain_scores_gemma":[0.99730664,0.00026582004,0.00041733374,0.0015673111,0.00031288134,0.00012999136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006120906,0.00041372428,0.0005235727,0.00077203877,0.00023267584,0.00030469018,0.0029068468,0.00027465037,0.00003164325],"category_scores_gemma":[0.000042346554,0.00036322465,0.00015869798,0.00091303524,0.0004475082,0.0004977989,0.00056819007,0.00037495553,0.000026579834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002272059,0.000058123864,0.00006949546,0.000091693684,0.0000131714805,0.000021238873,0.0007204206,0.60035163,0.000041637377,0.13276741,0.00010515208,0.26575777],"study_design_scores_gemma":[0.00019754114,0.00007499335,0.00005523097,0.0002029958,0.000008174724,0.000020881722,1.0401326e-7,0.9642089,0.00032382688,0.03237295,0.002131248,0.0004031264],"about_ca_topic_score_codex":0.00002211507,"about_ca_topic_score_gemma":0.00006391775,"teacher_disagreement_score":0.36385733,"about_ca_system_score_codex":0.0001954291,"about_ca_system_score_gemma":0.0006105801,"threshold_uncertainty_score":0.999882},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003552952,0.0008436763,0.98968226,0.0007163856,0.0029149961,0.00071765215,0.000029008024,0.00055204576,0.0041886605],"genre_scores_gemma":[0.18838517,0.000103577564,0.80957836,0.0008121024,0.00075361214,0.0000079647,0.000024045848,0.00008434323,0.0002507865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920601,0.00015106102,0.0015288332,0.0028788617,0.002009482,0.0013716542],"domain_scores_gemma":[0.9926235,0.002362532,0.0009580824,0.0030123326,0.00070400815,0.00033955567],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018591508,0.0010987864,0.0014636234,0.0017123693,0.00037919125,0.0006092625,0.007337404,0.0005478313,0.000059506143],"category_scores_gemma":[0.00032792034,0.0010489891,0.0004235526,0.0018169073,0.0017778606,0.00083393865,0.005290434,0.0013971196,0.00006818818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017031363,0.00026103915,0.00063775014,0.00023706669,0.000048415717,0.00073873566,0.0012151981,0.21767047,0.00073189096,0.02316319,0.00016274553,0.75511646],"study_design_scores_gemma":[0.0004805208,0.00038910215,0.00029316763,0.0005237316,0.000015108259,0.00018985651,6.0816797e-7,0.8372979,0.002666212,0.1562287,0.0008758118,0.0010392534],"about_ca_topic_score_codex":0.00006659625,"about_ca_topic_score_gemma":0.000021304684,"teacher_disagreement_score":0.7540772,"about_ca_system_score_codex":0.0005236736,"about_ca_system_score_gemma":0.0009542171,"threshold_uncertainty_score":0.99919605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.5700207e-7,0.00029022514,0.92479205,0.00039929492,0.0012214558,0.071531795,0.0000059338345,0.0002892858,0.0014693794],"genre_scores_gemma":[0.00022731474,0.000109829445,0.9460994,0.0023698919,0.0022080014,0.047826312,0.000022241777,0.00011243353,0.0010245461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99452287,0.00005552598,0.0008028201,0.0024101676,0.0010479703,0.001160652],"domain_scores_gemma":[0.99584144,0.00087783847,0.0005934333,0.0018158458,0.0004782995,0.0003931657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007584806,0.00084556016,0.0007855118,0.0005792192,0.00045257626,0.0006501507,0.004163871,0.00069924456,0.000062699255],"category_scores_gemma":[0.000094783245,0.00079774705,0.00031664368,0.0007829519,0.00047949833,0.00094612344,0.0013227228,0.0011769921,0.00004834421],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034829536,0.000025041098,0.0000024979008,0.00004719626,0.000013798675,0.00007854588,0.00040927852,0.034929823,0.0000049895025,0.0008457787,0.0020463895,0.96156186],"study_design_scores_gemma":[0.0015161549,0.00075417385,0.000023268807,0.0011677204,0.000013249735,0.00023297046,1.02114356e-7,0.8420259,0.00020805483,0.09262269,0.06013257,0.0013031501],"about_ca_topic_score_codex":0.000009954127,"about_ca_topic_score_gemma":0.00010223211,"teacher_disagreement_score":0.96025866,"about_ca_system_score_codex":0.00042954355,"about_ca_system_score_gemma":0.0013146605,"threshold_uncertainty_score":0.99944735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025756146,0.0006389852,0.99487424,0.00008387058,0.0029301255,0.00079251773,0.0000033244905,0.0005281219,0.00012307505],"genre_scores_gemma":[0.021874854,0.00002799667,0.9772901,0.00013775838,0.0005547349,0.000021122945,8.291252e-7,0.000056927613,0.000035706176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643475,0.00009415317,0.0005287897,0.001384855,0.0007046063,0.00085283077],"domain_scores_gemma":[0.992243,0.005441186,0.00033262343,0.0016285657,0.00023749204,0.00011715444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020480214,0.00062373304,0.00061311986,0.00047539664,0.00048942165,0.00061217305,0.0041635525,0.00047246617,0.0000016150242],"category_scores_gemma":[0.00021775688,0.0004681598,0.00017252624,0.0006954483,0.00046128995,0.00048882887,0.0006698512,0.0010452087,0.0000030540427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004620064,0.000003576124,7.698077e-7,0.000049498987,0.000009125537,0.000020299338,0.0002901275,0.90450805,0.000020672895,0.07115268,5.6545576e-7,0.023940016],"study_design_scores_gemma":[0.000057772715,0.000056217625,1.7965193e-7,0.00039390157,0.000008263867,0.000053966378,0.000001147931,0.65256786,0.00023142294,0.34623158,0.000047448375,0.0003502414],"about_ca_topic_score_codex":0.000009240518,"about_ca_topic_score_gemma":0.0000011134811,"teacher_disagreement_score":0.2750789,"about_ca_system_score_codex":0.00059718895,"about_ca_system_score_gemma":0.00047118982,"threshold_uncertainty_score":0.999777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007998628,0.0033400268,0.99458796,0.00011106366,0.0011805117,0.0005052571,0.0000061559977,0.0001515806,0.000037437454],"genre_scores_gemma":[0.01707629,0.000027116523,0.9825778,0.000103388076,0.0000848798,0.000025178302,0.0000023121825,0.000024551766,0.00007846117],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766374,0.000026175756,0.000476587,0.00084743346,0.0004817648,0.000504296],"domain_scores_gemma":[0.9940726,0.0043787896,0.00029133938,0.0008770282,0.0002785678,0.00010166522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011216622,0.0003759864,0.0004782581,0.0002162643,0.00041181545,0.00018749948,0.0023038117,0.00023560757,0.0000013176568],"category_scores_gemma":[0.0006650532,0.00028284566,0.000071304516,0.00015608694,0.0010361071,0.00024902317,0.0011766903,0.00058376463,0.000001115151],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058439978,0.0000063241073,0.000016363118,0.00002430277,0.000010466603,0.0000034687564,0.0007015056,0.016163506,0.0005275672,0.013667209,0.000001496774,0.96887195],"study_design_scores_gemma":[0.000536678,0.0002381797,0.000121291596,0.00037829828,0.000010730385,0.00007858026,0.000002027463,0.05951169,0.1455242,0.7534912,0.039119937,0.0009871532],"about_ca_topic_score_codex":0.0000068517647,"about_ca_topic_score_gemma":0.000052385185,"teacher_disagreement_score":0.9678848,"about_ca_system_score_codex":0.00011352234,"about_ca_system_score_gemma":0.00041027993,"threshold_uncertainty_score":0.9999624},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010629241,0.00044905193,0.9937502,0.00066044176,0.0006148453,0.00043925038,0.00005173132,0.00018620622,0.0038376572],"genre_scores_gemma":[0.0035307675,0.00013785221,0.9921149,0.00081431883,0.0007836075,0.000014433831,0.00012451188,0.000072180046,0.002407427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559927,0.000023103155,0.00071069686,0.002116408,0.000744861,0.00080567494],"domain_scores_gemma":[0.9961157,0.00032911592,0.0003473265,0.002878705,0.00016330612,0.00016584528],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012313175,0.0005844397,0.00071741216,0.0005573326,0.00046842566,0.0011845605,0.0069974004,0.00023892928,0.000118870186],"category_scores_gemma":[0.000056339333,0.0005165212,0.00017582114,0.0005249179,0.00047044366,0.0015641159,0.0032409488,0.0005136026,0.00008937036],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013119956,0.00001908469,0.00000195105,0.00005069692,0.000030521285,0.000025835277,0.0006548351,0.042090125,0.00004867618,0.017847849,0.00007528972,0.939142],"study_design_scores_gemma":[0.00009158861,0.00011043378,0.0000018780177,0.00023900023,0.000018077808,0.000062104955,2.8264998e-7,0.7869815,0.0003020072,0.19884083,0.012792285,0.0005600203],"about_ca_topic_score_codex":0.000025416794,"about_ca_topic_score_gemma":0.000051818664,"teacher_disagreement_score":0.938582,"about_ca_system_score_codex":0.00014342228,"about_ca_system_score_gemma":0.00031893293,"threshold_uncertainty_score":0.9998523},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002707499,0.00035444158,0.99788785,0.00013259871,0.00028114518,0.0008803486,0.000036838093,0.00003683467,0.00011920997],"genre_scores_gemma":[0.7411987,0.000057474746,0.25670472,0.0010555289,0.00048527215,0.000027368513,0.000058605907,0.00006483569,0.0003475055],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99746495,0.000049357124,0.00037866354,0.0011988198,0.00035599436,0.0005522293],"domain_scores_gemma":[0.9985681,0.00015621538,0.0001685806,0.00068689795,0.000288066,0.0001321185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000846891,0.00044793246,0.00048066227,0.00023588532,0.00018332036,0.00009547115,0.00060943747,0.0003417837,0.0000020202406],"category_scores_gemma":[0.00013250206,0.00038069475,0.00023720472,0.0001079407,0.0008591443,0.000007156042,0.00021020585,0.00033110724,0.0000015616399],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014749069,0.000082949016,0.00000300604,0.00008411538,0.00013983157,0.000032412936,0.000052457588,0.08266869,0.31787288,0.00028437938,0.0001494752,0.5971549],"study_design_scores_gemma":[0.002279811,0.0007975929,9.741274e-7,0.00013558331,0.00005581654,0.00005472049,2.5168652e-7,0.109073915,0.8739767,0.012117807,0.00079368125,0.0007131153],"about_ca_topic_score_codex":0.0000026407397,"about_ca_topic_score_gemma":0.000009728893,"teacher_disagreement_score":0.7411831,"about_ca_system_score_codex":0.000105124906,"about_ca_system_score_gemma":0.0003586858,"threshold_uncertainty_score":0.9998645},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007622217,0.00015518208,0.98738873,0.00026814974,0.0018107377,0.00047449287,0.0000017285886,0.00030503742,0.009519719],"genre_scores_gemma":[0.055496275,0.000110909925,0.9407348,0.00062677584,0.0005192076,0.000021655052,0.000033586137,0.000046720237,0.002410073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955871,0.000078472214,0.0007791297,0.0015329183,0.001299663,0.0007227092],"domain_scores_gemma":[0.9973385,0.00020979407,0.0006605192,0.0014027278,0.00028817542,0.00010029033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013225428,0.00055133173,0.00046813153,0.0005267128,0.00039128566,0.00060985785,0.0031778465,0.00035821617,0.00002767876],"category_scores_gemma":[0.0001524158,0.0005509667,0.00012009486,0.0007679564,0.0005386839,0.0020167383,0.0010391045,0.001022891,0.000077089666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006906886,0.000023481487,0.00003864363,0.000076185905,0.000007085504,0.00002796322,0.0010327807,0.30433562,0.0027494913,0.097552024,0.000011453163,0.5941384],"study_design_scores_gemma":[0.00019284373,0.00021524259,0.0003230903,0.00038630486,0.0000076251786,0.00004500751,1.2452541e-7,0.94829255,0.007811198,0.03331724,0.0086400015,0.00076879753],"about_ca_topic_score_codex":0.000023010753,"about_ca_topic_score_gemma":0.0000043200207,"teacher_disagreement_score":0.6439569,"about_ca_system_score_codex":0.0004989593,"about_ca_system_score_gemma":0.00034674484,"threshold_uncertainty_score":0.99969417},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008115143,0.00041525226,0.9964872,0.00034067588,0.0009470336,0.0005922422,0.00000559515,0.00014920301,0.0002512705],"genre_scores_gemma":[0.40476617,0.00006597479,0.5939252,0.0007373712,0.000266691,0.00003380456,0.000017962315,0.000056806104,0.00013003092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531984,0.000091461516,0.00072789396,0.0017156533,0.0013170101,0.00082814484],"domain_scores_gemma":[0.9972772,0.0007313355,0.00027526222,0.0010507094,0.00053147384,0.0001339977],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016303312,0.0005162947,0.00044928168,0.0019410242,0.00014697066,0.001106166,0.0023155161,0.00041189734,0.00000594986],"category_scores_gemma":[0.0010290004,0.0005434611,0.00006535338,0.0018174356,0.00028311298,0.0031804398,0.0011153726,0.0010356387,0.000010365125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005648815,0.000030228139,0.00038568018,0.00003864667,0.000003449587,0.00012100865,0.0018934028,0.88681996,0.00015681746,0.024658151,0.0000012645762,0.08588577],"study_design_scores_gemma":[0.00049971655,0.00007204578,0.0007997192,0.00038734006,0.0000021043484,0.000037438927,1.666417e-7,0.9525408,0.0009929563,0.044100825,0.0000252185,0.0005416619],"about_ca_topic_score_codex":0.0005506181,"about_ca_topic_score_gemma":0.0004141306,"teacher_disagreement_score":0.40395465,"about_ca_system_score_codex":0.0017898798,"about_ca_system_score_gemma":0.0012130972,"threshold_uncertainty_score":0.9999308},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004010414,0.00005397228,0.9896665,0.0026641267,0.00092377845,0.0019341403,0.00018277043,0.00015565858,0.0004086225],"genre_scores_gemma":[0.92817897,0.000006978122,0.06858604,0.0020290054,0.0005483537,0.00017183619,0.000023422333,0.000052462354,0.00040295377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960242,0.00008170248,0.0005203417,0.0018384256,0.0007719614,0.0007634004],"domain_scores_gemma":[0.9965363,0.0014812276,0.0004012865,0.0005150053,0.00077567814,0.00029048606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060149,0.0006611137,0.0008240804,0.0010567573,0.0005869554,0.0006335036,0.0012095409,0.00021900648,0.000017404629],"category_scores_gemma":[0.00012601061,0.0006219688,0.00016017884,0.000728578,0.0002604271,0.0012427161,0.00071700144,0.00075827906,0.000028191296],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014611422,0.00010104253,0.00013644242,0.00005124988,0.00006338453,0.000034442422,0.010543179,0.0001366016,0.000057315094,0.0005557124,0.000110284316,0.9880642],"study_design_scores_gemma":[0.023573147,0.03595993,0.04671833,0.021480897,0.0007937121,0.006983766,0.00061924255,0.49484414,0.010571605,0.3039751,0.034259398,0.020220732],"about_ca_topic_score_codex":0.00015310294,"about_ca_topic_score_gemma":0.0053629708,"teacher_disagreement_score":0.9678435,"about_ca_system_score_codex":0.0005692198,"about_ca_system_score_gemma":0.00053974736,"threshold_uncertainty_score":0.9996232},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044947243,0.00043786282,0.9938605,0.00010196815,0.00066899,0.00019007761,0.000004035965,0.00003080784,0.00021103167],"genre_scores_gemma":[0.83480275,0.00013814624,0.16490081,0.000058490285,0.000057946552,0.0000023235034,0.00000795489,0.00000796064,0.000023653294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981131,0.000026491956,0.0004537939,0.0006231862,0.00058327493,0.00020014112],"domain_scores_gemma":[0.99840033,0.00026113642,0.0003595097,0.00039971032,0.0005029124,0.00007641274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032661593,0.00022868536,0.00033371578,0.0008504937,0.00013049944,0.000051092695,0.0006266614,0.00015711611,0.000002900633],"category_scores_gemma":[0.00004168808,0.00022942714,0.00005533577,0.0009263026,0.0011056147,0.0004023752,0.00033361083,0.00023885108,0.0000011112361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000107058095,0.000017726996,0.00025712908,0.00008430289,0.000011300066,0.0000061490723,0.0005150618,0.3296116,0.00021582805,0.035879828,0.000004256282,0.63338614],"study_design_scores_gemma":[0.0004021693,0.00032523292,0.002358642,0.0004831907,0.000014601555,0.00017934346,0.0000019830804,0.9140727,0.013024293,0.06838328,0.00029348742,0.00046110322],"about_ca_topic_score_codex":0.000024428964,"about_ca_topic_score_gemma":0.000029007835,"teacher_disagreement_score":0.830308,"about_ca_system_score_codex":0.00006809112,"about_ca_system_score_gemma":0.00043383936,"threshold_uncertainty_score":0.93557674},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060297723,0.00016171095,0.9926509,0.00016029277,0.0012012769,0.00055289234,0.000009551156,0.00023238201,0.004427991],"genre_scores_gemma":[0.49092537,0.000027351298,0.50335586,0.002764393,0.0012803266,0.000029574468,0.000061532315,0.00007304365,0.001482578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970182,0.000016333608,0.0005368853,0.0010974573,0.0006130346,0.00071805395],"domain_scores_gemma":[0.99801964,0.00048146665,0.00029947047,0.0007436604,0.00029936948,0.00015641502],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075022434,0.0004303708,0.0004173234,0.0009971743,0.000685607,0.0006199667,0.0015784116,0.00029418746,0.00002254868],"category_scores_gemma":[0.000062980296,0.0004047346,0.00017715785,0.00036234,0.0003382474,0.0009569918,0.0004186335,0.00046699296,0.00003621008],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012148158,0.000050001898,0.000053653344,0.000055097633,0.000015968957,0.000032582197,0.0005748519,0.005239707,0.0010994558,0.008930271,0.00006981918,0.98386645],"study_design_scores_gemma":[0.0013471917,0.0006405883,0.00037645307,0.00094503653,0.000027067565,0.0001354802,8.575153e-7,0.71515155,0.026991496,0.23814252,0.014677413,0.0015643591],"about_ca_topic_score_codex":0.000027798284,"about_ca_topic_score_gemma":0.00043635405,"teacher_disagreement_score":0.98230207,"about_ca_system_score_codex":0.00025575142,"about_ca_system_score_gemma":0.00021140615,"threshold_uncertainty_score":0.99984044},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030371314,0.0008993218,0.9384378,0.0026501257,0.0019964764,0.00091952056,0.000022667957,0.00014108888,0.054629255],"genre_scores_gemma":[0.5090234,0.00034151605,0.46923316,0.005520191,0.008725328,0.000109693094,0.000020546713,0.00015423163,0.0068718856],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683183,0.000041438274,0.00043907223,0.0009515667,0.0008728065,0.00086326565],"domain_scores_gemma":[0.9976193,0.00095409405,0.00031230983,0.0004361504,0.00047813205,0.00020001765],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014307388,0.00039143296,0.00052637607,0.00041695888,0.0013551291,0.0007050359,0.0015929943,0.00044423333,0.00008513791],"category_scores_gemma":[0.00052789395,0.00037136447,0.000109409564,0.000726846,0.0011458689,0.00042966055,0.00027610082,0.00054083316,0.000013014112],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016210677,0.000021609148,0.0003335458,0.000023443683,0.00001543624,0.000022908045,0.0013952458,0.0015731031,0.000052115658,0.15764195,0.00006751248,0.8388369],"study_design_scores_gemma":[0.0019661966,0.00029431187,0.00024645307,0.000782691,0.00009064864,0.000012726252,0.000014187912,0.07658894,0.00020536323,0.61476374,0.3031128,0.0019219741],"about_ca_topic_score_codex":0.00060664717,"about_ca_topic_score_gemma":0.0028713448,"teacher_disagreement_score":0.83691496,"about_ca_system_score_codex":0.00041014855,"about_ca_system_score_gemma":0.0008654558,"threshold_uncertainty_score":0.999945},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038666287,0.00029129614,0.9947329,0.0007478542,0.0016695388,0.0007412821,0.000115077615,0.0003235833,0.0009917676],"genre_scores_gemma":[0.17561653,0.0002132126,0.8172348,0.003137274,0.0018453981,0.00006194992,0.00020884725,0.0001442463,0.0015377074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99354976,0.00006705967,0.0007406089,0.002757892,0.0018186423,0.0010660064],"domain_scores_gemma":[0.99579823,0.00036110805,0.0003191714,0.002950668,0.00025639767,0.0003144082],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005357135,0.0009485727,0.00079196016,0.0007957261,0.0005481897,0.0011577422,0.0058487663,0.00047246768,0.000017708448],"category_scores_gemma":[0.00008312627,0.0007877207,0.00022961071,0.00078292855,0.000963878,0.0023001155,0.0030883003,0.0014140842,0.00012863128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028860284,0.00020121761,0.00006096451,0.00009138199,0.00003380847,0.0016415378,0.0006303893,0.0524003,0.0010084858,0.040212687,0.0006806651,0.9030097],"study_design_scores_gemma":[0.00079457747,0.000807087,0.0004768389,0.0021790667,0.000010118567,0.00043726966,1.3427687e-7,0.90644705,0.005224669,0.0677632,0.013457537,0.0024024344],"about_ca_topic_score_codex":0.000048090496,"about_ca_topic_score_gemma":0.000015294854,"teacher_disagreement_score":0.9006073,"about_ca_system_score_codex":0.0005412683,"about_ca_system_score_gemma":0.0007612012,"threshold_uncertainty_score":0.9998792},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18875448,0.00009288178,0.8030025,0.0077801235,0.000049609956,0.00013167085,3.948782e-7,0.00008676876,0.000101585814],"genre_scores_gemma":[0.6831611,0.000027014457,0.31397346,0.002756086,0.000062084204,0.000007713293,8.4329406e-7,0.0000033477693,0.000008387837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991287,0.0000058108335,0.00011562389,0.00030000389,0.00023039083,0.00021948539],"domain_scores_gemma":[0.99950546,0.00004272829,0.000022315153,0.00024613857,0.000045674315,0.00013768667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019553976,0.00007462349,0.00013001455,0.00011164439,0.000107948385,0.000021682557,0.00014730702,0.000019771855,0.000021115617],"category_scores_gemma":[0.00005964003,0.000056202232,0.000017353075,0.00062822946,0.0005105682,0.000077248085,0.000104315564,0.00016151222,0.000004505593],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024382227,0.00039152458,0.10935018,0.00013671546,0.000011110338,0.0006700349,0.0017258204,0.0008564652,0.02741475,0.0012787646,0.004920054,0.8532202],"study_design_scores_gemma":[0.0015063942,0.00046935657,0.06732369,0.00045768745,0.000025157115,0.0067268093,0.0000018623864,0.69677305,0.19156818,0.016301647,0.018250933,0.0005951967],"about_ca_topic_score_codex":0.00008973146,"about_ca_topic_score_gemma":0.0000021442768,"teacher_disagreement_score":0.852625,"about_ca_system_score_codex":0.000029015277,"about_ca_system_score_gemma":0.00014550472,"threshold_uncertainty_score":0.22918606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011202694,0.0004984436,0.9953401,0.0009308332,0.0013088905,0.00045102992,0.000003321501,0.0002735143,0.0011826284],"genre_scores_gemma":[0.050077546,0.00003028704,0.94570345,0.001400448,0.001545222,0.000017072769,0.000011396155,0.000043956185,0.0011706023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658865,0.000022941651,0.0005514372,0.0014647775,0.00063703145,0.00073519343],"domain_scores_gemma":[0.9976366,0.0005127782,0.00036856273,0.0009444692,0.0003852453,0.00015235055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001096106,0.00048173819,0.0004715835,0.00049875845,0.00041337073,0.00071225746,0.0023429294,0.00033722195,0.000005514681],"category_scores_gemma":[0.0001660069,0.00044908756,0.00013575109,0.0005618339,0.00030534732,0.0006347546,0.0006378602,0.0005480545,0.000017723867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052441596,0.000016167065,0.000008311001,0.000024130548,0.000004855447,0.000006414445,0.00045557084,0.22909844,0.000018053117,0.0055899853,0.00002470208,0.76474816],"study_design_scores_gemma":[0.00038113943,0.00008716561,0.000007977068,0.00034981445,0.000008840302,0.00002354035,1.0228131e-7,0.95702446,0.00042696125,0.039538663,0.0016332789,0.0005180845],"about_ca_topic_score_codex":0.000005984211,"about_ca_topic_score_gemma":0.00004623766,"teacher_disagreement_score":0.7642301,"about_ca_system_score_codex":0.00026686527,"about_ca_system_score_gemma":0.00053461705,"threshold_uncertainty_score":0.9997961},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009021677,0.00012559863,0.98888755,0.0011530177,0.00014705773,0.00025811815,0.000003016057,0.000046148405,0.009289252],"genre_scores_gemma":[0.5946256,0.00009879145,0.4039456,0.0010414369,0.000060391474,0.0000034302348,0.000007305149,0.000015506981,0.0002019414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651605,0.00008308344,0.00056928705,0.0010745476,0.0011973733,0.00055966416],"domain_scores_gemma":[0.99785024,0.00047730358,0.00013050115,0.0011161393,0.00027180702,0.00015400036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016339703,0.0002923262,0.0006557349,0.0032425218,0.00007116425,0.00024448877,0.0028171774,0.00024161799,0.00013191169],"category_scores_gemma":[0.0000906043,0.00025615157,0.0001780528,0.0033912186,0.0010414114,0.00031055402,0.00082576164,0.00070210843,0.000010809458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000355062,0.000033345757,0.000102047685,0.000010049194,0.000020376716,0.000029264427,0.0006812743,0.3151607,0.000022381775,0.39787385,0.0000013852316,0.28606176],"study_design_scores_gemma":[0.00014088525,0.000110664645,0.00042899008,0.000098107565,0.000013123075,0.0000039788442,1.0083441e-7,0.84029007,0.00018932286,0.15845692,0.000042668726,0.00022516148],"about_ca_topic_score_codex":0.000019961157,"about_ca_topic_score_gemma":0.000080046004,"teacher_disagreement_score":0.5945354,"about_ca_system_score_codex":0.00017765751,"about_ca_system_score_gemma":0.0004651198,"threshold_uncertainty_score":0.9999891},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027726335,0.00028048878,0.9917417,0.0009878313,0.0007726934,0.00029133586,0.0000035344135,0.000477853,0.005416831],"genre_scores_gemma":[0.34536535,0.00009027513,0.6517436,0.0016880304,0.00035215326,0.00001052296,0.0000045616816,0.000036096444,0.0007094342],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967712,0.000024881341,0.00046143963,0.0012965084,0.0009211457,0.00052481954],"domain_scores_gemma":[0.99780595,0.00022473742,0.00028002646,0.0013123555,0.00022574798,0.0001511536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007144448,0.00044805554,0.00044181847,0.00056982465,0.00026430635,0.0006444909,0.0034013898,0.00030655594,0.000028874634],"category_scores_gemma":[0.000039165712,0.0003980957,0.00014372333,0.00054170145,0.0006868157,0.000741161,0.0010263483,0.0007795167,0.00007442334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000251412,0.000026737956,0.000010947445,0.000027933189,0.000006022728,0.00006877926,0.0005878647,0.0008126255,0.0013002295,0.27460745,0.000004965336,0.7225439],"study_design_scores_gemma":[0.00018663643,0.000115121366,0.00014120227,0.0003612815,0.0000052069345,0.00005695837,1.306924e-7,0.017630802,0.02856278,0.9510604,0.0012184987,0.00066096557],"about_ca_topic_score_codex":0.000049517053,"about_ca_topic_score_gemma":0.000036713758,"teacher_disagreement_score":0.72188294,"about_ca_system_score_codex":0.0004981146,"about_ca_system_score_gemma":0.00075643475,"threshold_uncertainty_score":0.9998471},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005546341,0.00002560867,0.99274224,0.0000590493,0.0008351195,0.0005142379,0.000017353666,0.00007595305,0.00018407256],"genre_scores_gemma":[0.7923482,6.69761e-7,0.20743714,0.000061139806,0.00008298084,0.000006158635,0.000014792594,0.000011724999,0.00003717447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953766,0.00012985813,0.0005308644,0.0014056271,0.002132444,0.00042462337],"domain_scores_gemma":[0.99684155,0.00036009582,0.00032438818,0.0017349711,0.0004853643,0.00025361974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084603275,0.00037923938,0.000673645,0.0027415983,0.00081599003,0.00028380874,0.003942667,0.00023273533,0.00024720744],"category_scores_gemma":[0.000071949704,0.00036376825,0.00021039718,0.0017915356,0.0007817123,0.0004696823,0.0036821608,0.000685321,0.0000065937033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007665809,0.0050565363,0.008887694,0.00005745023,0.000824751,0.0002369275,0.009327479,0.89848846,0.004939873,0.032594904,0.0000050277795,0.039504267],"study_design_scores_gemma":[0.0004002989,0.000503977,0.002086414,0.000019549052,0.00010719044,0.0000019479303,9.694223e-7,0.9908052,0.0021262406,0.0035917803,0.0000024195688,0.0003539882],"about_ca_topic_score_codex":0.0001512327,"about_ca_topic_score_gemma":0.00019239236,"teacher_disagreement_score":0.7868019,"about_ca_system_score_codex":0.00042379153,"about_ca_system_score_gemma":0.00053323444,"threshold_uncertainty_score":0.99988145},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003386744,0.0003068013,0.99545234,0.00013537079,0.00094953144,0.00020542704,0.0000031636753,0.00009817413,0.002510529],"genre_scores_gemma":[0.4777214,0.00025007103,0.51943195,0.000436786,0.0005764255,0.000007007884,0.00001583533,0.00006665762,0.0014939043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964415,0.00006863378,0.00047861307,0.0013336667,0.0011219449,0.00055562914],"domain_scores_gemma":[0.99800456,0.0003205155,0.00049775094,0.00096808263,0.000060127655,0.0001489923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040440715,0.0005015496,0.0005957571,0.00066260475,0.00028546638,0.000116698255,0.0026537569,0.0002979554,0.000029672055],"category_scores_gemma":[0.00009285746,0.00045832226,0.00016149001,0.0004130946,0.0007848819,0.00040007077,0.0012366641,0.0014703103,0.000026138083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006139504,0.00002269879,0.00012549748,0.000018937186,0.000016861375,0.000072728864,0.0013728939,0.06363487,0.00044362398,0.0021545072,0.000006999677,0.93212426],"study_design_scores_gemma":[0.00076539745,0.0006609135,0.0025536781,0.00041853357,0.000014705706,0.00025977136,4.5946643e-7,0.9456471,0.0054387357,0.029975364,0.012964376,0.0013009476],"about_ca_topic_score_codex":0.000032174386,"about_ca_topic_score_gemma":0.0000070752785,"teacher_disagreement_score":0.93082327,"about_ca_system_score_codex":0.00018513971,"about_ca_system_score_gemma":0.00018408392,"threshold_uncertainty_score":0.99978685},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000738119,0.00019882743,0.9902581,0.0017307696,0.0035452985,0.0011676623,0.000015306998,0.00040320086,0.0026734853],"genre_scores_gemma":[0.16806276,0.000030012769,0.82713705,0.0015798581,0.0014160809,0.00017470904,0.000010643717,0.000098834396,0.0014900555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598134,0.000034080655,0.00075369515,0.0016459844,0.0007548576,0.00083005865],"domain_scores_gemma":[0.99732816,0.00036146934,0.00046380676,0.0013313207,0.00035546374,0.00015978121],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001513238,0.0006309571,0.00082414073,0.0007714135,0.0005430781,0.001041471,0.003692946,0.0006172664,0.000004165599],"category_scores_gemma":[0.00003804168,0.0005683894,0.00026244464,0.00030971845,0.00033022749,0.0005818216,0.0010633975,0.0010486372,0.000011255413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012130731,0.00009571414,0.00001600377,0.00050209276,0.0000627245,0.000038496117,0.003193101,0.010519169,0.0005386878,0.343545,0.0015914533,0.6398854],"study_design_scores_gemma":[0.00019325352,0.00007449955,0.000002451337,0.00018748747,0.0000074722557,0.000051341973,1.4007288e-7,0.7945696,0.0003214854,0.19861135,0.0054072603,0.00057365804],"about_ca_topic_score_codex":0.000041281823,"about_ca_topic_score_gemma":0.00010325193,"teacher_disagreement_score":0.7840504,"about_ca_system_score_codex":0.00026903534,"about_ca_system_score_gemma":0.0005254931,"threshold_uncertainty_score":0.9999955},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05868025,0.0049107727,0.92089796,0.0070688226,0.0021408473,0.0021231603,0.000031802625,0.00003857791,0.0041077766],"genre_scores_gemma":[0.97457534,0.00010190786,0.024082892,0.000722531,0.00020290744,0.000017217399,0.0000143757925,0.000013298015,0.0002695399],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988977,0.000033444954,0.00023947391,0.0004314021,0.0002168043,0.00018122404],"domain_scores_gemma":[0.9992169,0.00024543525,0.00010405422,0.00035092578,0.000054922257,0.000027729464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045345374,0.0001550697,0.00015336966,0.00021215275,0.000049521193,0.000060846254,0.00040182253,0.00011700241,0.000018298308],"category_scores_gemma":[0.000011648553,0.00010253326,0.000034262237,0.00014315917,0.00033790237,0.00012608373,0.00007768425,0.00026945298,0.0000023344815],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013547105,0.00009166902,0.00028488992,0.000011072206,0.0000050832505,0.000001003117,0.021828571,0.0014770804,0.000039804534,0.014956494,0.000024128578,0.96126664],"study_design_scores_gemma":[0.0032277547,0.0020039757,0.06886065,0.0043986537,0.00008085932,0.0004690434,0.00047689694,0.3354049,0.0012690657,0.4083319,0.1723114,0.0031649098],"about_ca_topic_score_codex":0.000059912483,"about_ca_topic_score_gemma":0.00012438714,"teacher_disagreement_score":0.95810175,"about_ca_system_score_codex":0.0000672529,"about_ca_system_score_gemma":0.00005643339,"threshold_uncertainty_score":0.4181185},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013653353,0.0005204177,0.9909504,0.00063942774,0.0014019138,0.00037761327,0.000010170215,0.00027702074,0.0056864917],"genre_scores_gemma":[0.20202124,0.00006721109,0.79460263,0.0021707688,0.0010194847,0.000004233418,0.00003310696,0.00003543918,0.000045897563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955378,0.00003460028,0.0006339572,0.0016874709,0.0013305101,0.00077561615],"domain_scores_gemma":[0.99708146,0.00038461518,0.00036172476,0.0017171707,0.00025050377,0.00020453069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015021813,0.00055367,0.0005015491,0.0010636938,0.00042724088,0.0008000867,0.0038554408,0.00035186525,0.000030677744],"category_scores_gemma":[0.00007606965,0.0005069907,0.00020374537,0.00090681174,0.0005417196,0.0013379109,0.001826495,0.0009180612,0.00008139092],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024871224,0.000025230964,0.000045344692,0.000017592367,0.000006887782,0.000019644747,0.00058987906,0.008220252,0.000024788023,0.23336406,0.000023254966,0.75766057],"study_design_scores_gemma":[0.00025203783,0.00010681823,0.00027895314,0.0002136439,0.000007370028,0.000060020735,1.3671307e-7,0.5055139,0.00033543856,0.48867205,0.003921551,0.0006380899],"about_ca_topic_score_codex":0.000020234354,"about_ca_topic_score_gemma":0.00011833941,"teacher_disagreement_score":0.7570225,"about_ca_system_score_codex":0.00026113697,"about_ca_system_score_gemma":0.00043541784,"threshold_uncertainty_score":0.99973816},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031606108,0.00052351266,0.9864176,0.00052732346,0.00062079536,0.0007766471,0.000017172473,0.0003349461,0.01046594],"genre_scores_gemma":[0.56116027,0.000009412158,0.4331582,0.0035543926,0.0009990945,0.00002100777,0.000044207653,0.00011721205,0.0009362127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993503,0.00012766157,0.0010568767,0.0022671442,0.0015689565,0.0014763937],"domain_scores_gemma":[0.9961437,0.0009814461,0.0005599471,0.0017000808,0.00028931868,0.0003254926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028533596,0.0009143021,0.0011495883,0.0014509418,0.00033625853,0.0009118953,0.0043995976,0.0005453602,0.00002270089],"category_scores_gemma":[0.00011424766,0.0008005996,0.00017641626,0.0014169648,0.0005584555,0.00050873583,0.0008640858,0.0016154943,0.00012584883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068936315,0.000059581504,0.00088103826,0.00011070877,0.00004303138,0.0010653797,0.0017126907,0.8251196,0.000079649304,0.010655225,0.000105889165,0.16009825],"study_design_scores_gemma":[0.0012766497,0.000270919,0.00023758698,0.0021780215,0.000009964269,0.00021659253,9.561562e-7,0.98427796,0.00001568137,0.006985587,0.0034497061,0.0010803697],"about_ca_topic_score_codex":0.00008742288,"about_ca_topic_score_gemma":0.00021809741,"teacher_disagreement_score":0.5608442,"about_ca_system_score_codex":0.00049148,"about_ca_system_score_gemma":0.0006561841,"threshold_uncertainty_score":0.9994445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046220262,0.00056302064,0.9797551,0.000816072,0.00068770646,0.0005678908,0.000011501147,0.000073871895,0.017478595],"genre_scores_gemma":[0.34145695,0.00022721244,0.57557297,0.042520005,0.0020216075,0.00006526237,0.000047438378,0.0002431584,0.03784543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955518,0.00003775386,0.00043667585,0.0018177775,0.0013383119,0.00081765716],"domain_scores_gemma":[0.9970478,0.0001875616,0.0003543728,0.0017095407,0.0005002761,0.00020044412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041394203,0.00071133673,0.0005910438,0.00066557777,0.00025196368,0.0005996186,0.0036606153,0.00028749247,0.000045207613],"category_scores_gemma":[0.000036584133,0.000571854,0.00014087517,0.0004332816,0.00045234154,0.001147018,0.0009463592,0.0009999196,0.000057826237],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015006245,0.00036733467,0.00017755807,0.00018948158,0.0002907952,0.00069779507,0.0037030508,0.12588966,0.011704389,0.09535903,0.0010074658,0.76046336],"study_design_scores_gemma":[0.0027798475,0.0039051732,0.002522402,0.002646739,0.0001805152,0.0002989475,0.0000016171218,0.5406658,0.19110355,0.18093015,0.069129385,0.005835872],"about_ca_topic_score_codex":0.000031564843,"about_ca_topic_score_gemma":0.000041303694,"teacher_disagreement_score":0.7546275,"about_ca_system_score_codex":0.000199847,"about_ca_system_score_gemma":0.00047941302,"threshold_uncertainty_score":0.9996733},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020237146,0.00021068117,0.99022293,0.00055388064,0.00035014757,0.00044212383,0.000007759598,0.00018612093,0.007824006],"genre_scores_gemma":[0.44015357,0.000044291926,0.5585133,0.0009007868,0.00010779332,0.00003070199,0.000016490778,0.000030188354,0.00020290872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968528,0.000014324423,0.00052314356,0.0014272144,0.00058532646,0.00059714995],"domain_scores_gemma":[0.9979699,0.000146547,0.00022153322,0.0014030755,0.00011866061,0.0001402796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004452596,0.00043958134,0.00038694995,0.0007541896,0.00018174098,0.00040977396,0.0027590627,0.00031900252,0.0000122233605],"category_scores_gemma":[0.000020578553,0.00044009087,0.000116482035,0.0006987456,0.00033155273,0.0005514739,0.0009388422,0.0007362481,0.000063502055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049189625,0.00016193325,0.000016691316,0.000091489084,0.0000051858474,0.00008077603,0.0015575874,0.38857442,0.0061300653,0.31905434,0.000017332095,0.28430527],"study_design_scores_gemma":[0.0002382861,0.000033546115,0.000025222327,0.00010501893,0.0000026670664,0.000013543966,6.3317465e-8,0.65496397,0.0020866562,0.34210634,0.00007172812,0.0003529477],"about_ca_topic_score_codex":0.00005525178,"about_ca_topic_score_gemma":0.00015332665,"teacher_disagreement_score":0.4399512,"about_ca_system_score_codex":0.00046828194,"about_ca_system_score_gemma":0.0009260213,"threshold_uncertainty_score":0.9998051},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005258712,0.00039409907,0.9943713,0.00026065743,0.001624551,0.00036780385,0.000010902148,0.00023505889,0.0027303859],"genre_scores_gemma":[0.028581494,0.000050672494,0.9676393,0.0013455964,0.00063610065,0.000014208579,0.000016273056,0.000052167627,0.0016641715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954824,0.00003304119,0.00059502316,0.0018070758,0.00095521664,0.0011272705],"domain_scores_gemma":[0.997397,0.0007722087,0.00027711713,0.0010172866,0.00030798765,0.00022839435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017699857,0.0006131141,0.00058959547,0.00074254867,0.00040666078,0.0009558748,0.0030639754,0.00047713204,0.000009463396],"category_scores_gemma":[0.00007597011,0.00056989817,0.00021218392,0.00048797342,0.00076035067,0.00087659206,0.0011788353,0.0012078023,0.000029281662],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048213014,0.000015987129,0.0000050786693,0.000023586352,0.000008936102,0.000046355617,0.00017119756,0.01726046,0.000016967748,0.01642382,0.00002458964,0.9659982],"study_design_scores_gemma":[0.00023007412,0.00023948954,0.000011387886,0.00028360842,0.000008027957,0.00006201907,2.5839537e-7,0.884509,0.0004973676,0.11159406,0.0018991156,0.0006655757],"about_ca_topic_score_codex":0.000025848178,"about_ca_topic_score_gemma":0.000036146746,"teacher_disagreement_score":0.9653326,"about_ca_system_score_codex":0.00031901037,"about_ca_system_score_gemma":0.0006557485,"threshold_uncertainty_score":0.9996753},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000061863116,0.0008996718,0.9699261,0.0007879912,0.0012500595,0.0014384167,0.000034343822,0.00088268076,0.024774551],"genre_scores_gemma":[0.0201051,0.00023489886,0.973844,0.0016002584,0.0009746108,0.00006127998,0.000036532576,0.00012917636,0.0030141596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924801,0.00015440768,0.0010135422,0.0035009119,0.0016531744,0.0011978647],"domain_scores_gemma":[0.99162996,0.00074015086,0.00064800214,0.0063998685,0.00033708307,0.00024494293],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019639793,0.0009815221,0.0010841967,0.0017814309,0.0003624228,0.0011692196,0.014361302,0.00076376885,0.000051396884],"category_scores_gemma":[0.00021822324,0.0008745014,0.00017628576,0.001241333,0.0008001803,0.001216615,0.003031649,0.0018078015,0.00011707446],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012006439,0.000095227464,0.00003689982,0.00028310865,0.00006479873,0.0006424854,0.00288268,0.009387109,0.0006017687,0.023716236,0.0037051605,0.9585725],"study_design_scores_gemma":[0.00046828817,0.0004462252,0.000011195782,0.0019063014,0.000025898882,0.0009321777,2.5890657e-7,0.77540404,0.0030166253,0.18652137,0.029211933,0.00205567],"about_ca_topic_score_codex":0.000077409,"about_ca_topic_score_gemma":0.00012784373,"teacher_disagreement_score":0.95651686,"about_ca_system_score_codex":0.00043869807,"about_ca_system_score_gemma":0.0008864885,"threshold_uncertainty_score":0.9998677},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010150349,0.0002215932,0.9934439,0.0005529032,0.0023934306,0.00036615916,0.00001758138,0.00012249658,0.0018668857],"genre_scores_gemma":[0.75611556,0.000013862697,0.24210444,0.0003982623,0.0004955176,0.000004215956,0.000022859282,0.000030897394,0.00081438594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962239,0.00005865481,0.0007350139,0.0012032388,0.0011935208,0.0005856483],"domain_scores_gemma":[0.9969022,0.0005769991,0.00042354438,0.0015709964,0.00041096873,0.00011525293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013932259,0.00044517347,0.0006305,0.0006335044,0.00019747086,0.0005843716,0.0036949357,0.0004277551,0.000008137219],"category_scores_gemma":[0.000060962506,0.0004054175,0.00016765494,0.00069443893,0.00076305936,0.00073928584,0.0012619162,0.0010248228,0.00003803889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048349495,0.00025535774,0.0017315164,0.00081808894,0.000101086895,0.00028225855,0.0035244043,0.11931755,0.021810437,0.30970412,0.00018622603,0.5422206],"study_design_scores_gemma":[0.000473662,0.00028332826,0.000523971,0.00080753054,0.0000120757295,0.00016811892,2.1177159e-7,0.8534525,0.009985017,0.13029698,0.0029766357,0.0010199428],"about_ca_topic_score_codex":0.00015665028,"about_ca_topic_score_gemma":0.00009026412,"teacher_disagreement_score":0.75510055,"about_ca_system_score_codex":0.00012761286,"about_ca_system_score_gemma":0.00072063546,"threshold_uncertainty_score":0.9998398},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005487013,0.00028270882,0.99568737,0.0006262598,0.0013577169,0.0007888379,0.000003892553,0.0004869548,0.00021755905],"genre_scores_gemma":[0.053243022,0.000031050346,0.9446732,0.0011479643,0.0003929503,0.000035930425,0.0000015444876,0.000064106986,0.00041025618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994089,0.000056957346,0.0005687874,0.0020095215,0.0020859335,0.0011897875],"domain_scores_gemma":[0.99189514,0.004985441,0.0001109754,0.0022366347,0.000326979,0.00044481733],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011416856,0.00065436616,0.00060320215,0.0020018092,0.00033475467,0.00059967523,0.0061547393,0.00029782573,0.000024000343],"category_scores_gemma":[0.0023522496,0.00059485884,0.00017186433,0.001586066,0.00046123134,0.000290726,0.0028374293,0.0011564585,0.0002952228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000891261,0.00001739897,0.000022006509,0.000008334084,0.000008847174,0.00031338396,0.00094421644,0.24039945,0.00011776282,0.0009912966,0.0002442399,0.75692415],"study_design_scores_gemma":[0.00068301725,0.001024511,0.0021054267,0.0011676768,0.000008552158,0.0015010994,9.2372105e-8,0.9232443,0.0037907052,0.054285042,0.009473371,0.0027162195],"about_ca_topic_score_codex":0.000019053417,"about_ca_topic_score_gemma":0.000013390956,"teacher_disagreement_score":0.7542079,"about_ca_system_score_codex":0.0005144637,"about_ca_system_score_gemma":0.0010321237,"threshold_uncertainty_score":0.9996503},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028855156,0.00091935694,0.99339825,0.00002461809,0.00055757427,0.00040120631,0.00001300468,0.00065075135,0.0011496961],"genre_scores_gemma":[0.28350538,0.00017851098,0.7154334,0.00018640072,0.00044510487,0.00003170536,0.000053283253,0.00007252323,0.00009368056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975951,0.000005216339,0.0004026322,0.00079747225,0.0003591432,0.00084049074],"domain_scores_gemma":[0.9985639,0.00027451533,0.000087915796,0.0008863991,0.00009795005,0.00008936332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030165398,0.00046783252,0.00057880004,0.00050091406,0.00014184852,0.000111685644,0.0011586531,0.0004086547,0.000013080682],"category_scores_gemma":[0.000018797,0.0004464819,0.00015592219,0.00083023636,0.0004586278,0.00028222083,0.00022488601,0.00065964565,0.000006983251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038010926,0.000004494099,0.00007494452,0.000026192005,0.000053292304,0.0000054358843,0.00001633239,0.913764,0.000021530854,0.0004445852,0.00005016793,0.08553522],"study_design_scores_gemma":[0.00009564269,0.00014416837,0.0001107793,0.00007317569,0.000080174745,0.000004541068,5.0729614e-8,0.97166926,0.0001984928,0.023088468,0.004011862,0.0005233992],"about_ca_topic_score_codex":0.000004193989,"about_ca_topic_score_gemma":0.00020174334,"teacher_disagreement_score":0.2806199,"about_ca_system_score_codex":0.00030101926,"about_ca_system_score_gemma":0.000046812766,"threshold_uncertainty_score":0.9997987},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031629093,0.0004336779,0.9619441,0.00027869755,0.00363461,0.00080448366,0.0000029793825,0.00011513975,0.0011571966],"genre_scores_gemma":[0.9932668,0.00004729857,0.0033973434,0.00044755827,0.0026760108,0.000020596455,0.000012237839,0.000054556378,0.00007756399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965097,0.000008839601,0.00070026837,0.0012600108,0.0007892892,0.0007319289],"domain_scores_gemma":[0.99805737,0.000108426975,0.0003175535,0.00091136346,0.00056925946,0.000036006877],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095996656,0.00061914773,0.0005507909,0.0015072961,0.00028160904,0.0008244915,0.0014195482,0.00028593774,0.00018507976],"category_scores_gemma":[0.00015346495,0.0005665273,0.00007515936,0.0017463231,0.00037023914,0.0028519784,0.0013663876,0.0008709568,0.00018467901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018220602,0.0003195962,0.0023396646,0.00019972817,0.000011067373,0.0018948731,0.00052962115,0.09761106,0.0000060830425,0.0015091618,0.000007856075,0.89555305],"study_design_scores_gemma":[0.000237383,0.00004341281,0.0002978169,0.0007746314,0.000055576667,0.0005013112,0.000036562207,0.9720488,0.000026284217,0.023124296,0.0014331613,0.0014207637],"about_ca_topic_score_codex":0.0026926354,"about_ca_topic_score_gemma":0.0034751652,"teacher_disagreement_score":0.96163774,"about_ca_system_score_codex":0.00020587373,"about_ca_system_score_gemma":0.00015880799,"threshold_uncertainty_score":0.9996786},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010759928,0.0009319796,0.9917671,0.0006379568,0.00053776044,0.0054410202,0.00000788337,0.00025328316,0.00031543404],"genre_scores_gemma":[0.108027734,0.00006896245,0.88618726,0.0032256036,0.00092267996,0.001385635,0.000010010469,0.00008403306,0.000088062225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996264,0.00005404686,0.00053116155,0.0017535117,0.0005733946,0.00082390715],"domain_scores_gemma":[0.9971717,0.00076899154,0.00033660454,0.0012559668,0.00022967636,0.00023708589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001400959,0.00060713984,0.00060528493,0.0006607949,0.00049955293,0.00084658054,0.0026657102,0.00044544353,0.000006937006],"category_scores_gemma":[0.000046694662,0.000581519,0.00020468472,0.0005788771,0.0008735367,0.00049531576,0.0007040326,0.0007861026,0.0000031843394],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004633648,0.00003076292,0.000032531436,0.00007377129,0.000010000722,0.000019993111,0.00020861768,0.038355995,0.000060139497,0.024865938,0.0000059630825,0.93628997],"study_design_scores_gemma":[0.0006954223,0.0004952073,0.000029171706,0.0010908894,0.000010649338,0.000031088577,1.8150331e-7,0.8858449,0.00047435623,0.10610076,0.004453369,0.0007740169],"about_ca_topic_score_codex":0.0000013682031,"about_ca_topic_score_gemma":0.00008124189,"teacher_disagreement_score":0.93551594,"about_ca_system_score_codex":0.00012571982,"about_ca_system_score_gemma":0.0003567745,"threshold_uncertainty_score":0.99966365},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034546483,0.000052480435,0.9625703,0.0006398242,0.00055582164,0.00046941134,0.0000059643758,0.000013835921,0.0011458618],"genre_scores_gemma":[0.9555725,0.0000106282005,0.04247544,0.0011637413,0.000072555355,0.00002186595,0.0000016907061,0.000013964214,0.0006676076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680793,0.00009084474,0.00077472976,0.00086931785,0.0011819637,0.00027521738],"domain_scores_gemma":[0.9969537,0.001382216,0.000457312,0.0008768215,0.0002602186,0.000069704634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045543388,0.00022185863,0.00030272672,0.0007370034,0.0002562174,0.00018986136,0.0014480744,0.00012749682,0.00006645533],"category_scores_gemma":[0.00033258335,0.00015414093,0.000081853075,0.0010163729,0.00041416383,0.00025538058,0.00018553989,0.00036580302,0.000036439305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015378084,0.000010027295,0.00009209565,0.0000064657943,0.0000012962671,9.3811684e-7,0.0003621854,0.87467766,0.00008622261,0.0009171293,0.00001184412,0.123818755],"study_design_scores_gemma":[0.000110209825,0.00005487934,0.000079704914,0.00012255684,0.000003500467,0.000002676797,0.000002998099,0.9391219,0.0026501052,0.056487646,0.0011895898,0.00017420945],"about_ca_topic_score_codex":0.000011999277,"about_ca_topic_score_gemma":0.000016717038,"teacher_disagreement_score":0.92102605,"about_ca_system_score_codex":0.00012366581,"about_ca_system_score_gemma":0.0001858068,"threshold_uncertainty_score":0.6285685},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.929795e-7,0.00015591267,0.99340177,0.00012870494,0.0006400722,0.00085638394,0.000010349197,0.0041276193,0.000678512],"genre_scores_gemma":[0.04642642,0.000004884729,0.95031446,0.0025142843,0.00054504833,0.000041763346,0.00003337224,0.000059404356,0.00006037663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996094,0.000025925525,0.0005130261,0.0017316901,0.00084706716,0.000788328],"domain_scores_gemma":[0.99233407,0.0052652936,0.0003160311,0.0015035771,0.00039177184,0.00018925656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013692118,0.00060592993,0.00050631206,0.0010734359,0.00041090397,0.00057713455,0.002394394,0.00049416284,0.0000026690122],"category_scores_gemma":[0.001675657,0.0005724541,0.00016395439,0.0008112366,0.0004063555,0.0002784038,0.00042124704,0.00068927027,0.0000022985769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001131629,0.00008563103,0.0004985673,0.00007714674,0.0000036975225,0.00006928019,0.000073947514,0.21145083,0.0000012996275,0.0018394456,0.00028275754,0.7856061],"study_design_scores_gemma":[0.00021215594,0.00051425357,0.00007015211,0.00051684206,0.0000076013343,0.00007129617,1.4323551e-8,0.9248163,0.00007931064,0.072877735,0.00022294353,0.0006113723],"about_ca_topic_score_codex":0.000016828719,"about_ca_topic_score_gemma":0.000010236978,"teacher_disagreement_score":0.7849947,"about_ca_system_score_codex":0.00033939618,"about_ca_system_score_gemma":0.000487035,"threshold_uncertainty_score":0.9996727},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048600632,0.0008776093,0.98754036,0.0007966123,0.002308595,0.002027139,0.0000066536268,0.0007162874,0.0052407067],"genre_scores_gemma":[0.55684596,0.000019860849,0.4359749,0.0036230513,0.0019646622,0.0002062107,0.000043900425,0.000090737194,0.0012307336],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934412,0.00011319492,0.0008191456,0.002881389,0.0012993584,0.0014457068],"domain_scores_gemma":[0.9964959,0.00033457184,0.0003932392,0.0021276756,0.0002345569,0.00041402745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010912935,0.0008964803,0.00094582874,0.000918181,0.0003628668,0.0009515173,0.004412638,0.0006612488,0.00006030135],"category_scores_gemma":[0.00014541588,0.0007325663,0.00023093601,0.0012340584,0.0006017235,0.00050731975,0.0015700466,0.0011203641,0.0003645531],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029294553,0.00009794382,0.00013573274,0.00004363711,0.000033762906,0.0004989199,0.008154168,0.0016761818,0.00013603044,0.032466378,0.00004578821,0.95668215],"study_design_scores_gemma":[0.0021675434,0.0042382353,0.00041896637,0.0006059772,0.000091435824,0.00055579917,0.000014825098,0.12644692,0.0029781645,0.7046368,0.15239246,0.0054528695],"about_ca_topic_score_codex":0.00040562332,"about_ca_topic_score_gemma":0.00037908315,"teacher_disagreement_score":0.9512293,"about_ca_system_score_codex":0.00032486097,"about_ca_system_score_gemma":0.00055479247,"threshold_uncertainty_score":0.99951255},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005887324,0.00084880984,0.9904428,0.00013961506,0.001974598,0.00032810372,0.000001633694,0.0002576057,0.0059479554],"genre_scores_gemma":[0.9488958,0.000052149597,0.049146723,0.00030049987,0.00060304115,0.000016823577,0.0000072086923,0.000052007497,0.00092576543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99512935,0.00010211012,0.0008833641,0.001900055,0.00091186364,0.0010732558],"domain_scores_gemma":[0.997473,0.0005465252,0.00037339143,0.001218629,0.00017990716,0.00020855786],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012521535,0.0006914209,0.00077879825,0.0010086481,0.0002634827,0.0011099171,0.0032522478,0.0005856295,0.0000060503817],"category_scores_gemma":[0.00007449752,0.0006804831,0.00012484034,0.0008446362,0.0004705708,0.00048994255,0.0009682619,0.0019779594,0.00002816438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022525355,0.00001565697,0.00018039007,0.000034280005,0.0000032007406,0.00021400565,0.00015014976,0.8575204,0.000009326167,0.0062887706,0.00001734738,0.13556421],"study_design_scores_gemma":[0.00017763085,0.00015476899,0.00011388186,0.0009364353,0.000005139806,0.00010080369,1.797049e-7,0.97345346,0.000014011924,0.02401236,0.0002959478,0.00073539646],"about_ca_topic_score_codex":0.00014448876,"about_ca_topic_score_gemma":0.00010962228,"teacher_disagreement_score":0.9488369,"about_ca_system_score_codex":0.0004036871,"about_ca_system_score_gemma":0.0005229006,"threshold_uncertainty_score":0.99992704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007929186,0.0021076559,0.99467707,0.00010406632,0.00085700845,0.0005697075,0.00008589672,0.000007853978,0.00079782004],"genre_scores_gemma":[0.45361245,0.0005177149,0.5390263,0.0008041878,0.0036082119,0.000057487505,0.00039684313,0.00009126791,0.0018855417],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984226,0.000011435407,0.0003047758,0.0006415224,0.00033983763,0.00027983132],"domain_scores_gemma":[0.9986614,0.0002604361,0.00023651932,0.00054606755,0.0002463913,0.000049187554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044670518,0.0002657937,0.0002832476,0.00014280854,0.00010940722,0.000042451484,0.0006892378,0.00026450094,0.000018260242],"category_scores_gemma":[0.000034957844,0.00020202606,0.00013000147,0.000098024095,0.00051453017,0.000005768325,0.0002233501,0.00024221285,0.0000032695161],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016691853,0.00010144898,0.00012057909,0.000055805893,0.0003016983,0.000012091938,0.0008412543,0.022104908,0.13622107,0.00030376852,0.00035802514,0.83941245],"study_design_scores_gemma":[0.002393641,0.0019709382,0.0012949286,0.00056892,0.00027514203,0.00008086111,0.000015570708,0.19704786,0.63859653,0.04084923,0.11473981,0.0021665774],"about_ca_topic_score_codex":0.00003999847,"about_ca_topic_score_gemma":0.0001193122,"teacher_disagreement_score":0.8372459,"about_ca_system_score_codex":0.00004736462,"about_ca_system_score_gemma":0.00012613775,"threshold_uncertainty_score":0.82383835},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006538072,0.0010015419,0.48599884,0.00072195486,0.0017392825,0.0004231332,0.0000191271,0.00012963483,0.5093127],"genre_scores_gemma":[0.98163915,0.0000087179715,0.010541135,0.00062689395,0.0013049738,0.000014924032,0.000008201201,0.000029280383,0.0058267186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985463,0.0000106774005,0.00024184989,0.00057149766,0.00029591224,0.0003337413],"domain_scores_gemma":[0.9992482,0.00010466471,0.000099533165,0.0004023909,0.000061335646,0.000083856714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021609465,0.00029174346,0.00032045905,0.000506165,0.00054690725,0.00026621824,0.00058368937,0.00007734311,0.00038963885],"category_scores_gemma":[0.00001942926,0.00023023412,0.00010967162,0.000083105944,0.001339872,0.00020996285,0.00035803852,0.0004067669,0.00009125027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008224846,0.000037665228,0.00027429996,0.000030785355,0.00004249498,0.00001963643,0.16037342,0.0022423714,9.846096e-7,0.7299669,0.00017608228,0.10682717],"study_design_scores_gemma":[0.00069035956,0.0006078973,0.0014425219,0.0021172462,0.00018777138,0.000027085125,0.00018971125,0.01286507,0.0001527875,0.79874533,0.17948364,0.0034905763],"about_ca_topic_score_codex":0.00012425387,"about_ca_topic_score_gemma":0.0029606728,"teacher_disagreement_score":0.98098534,"about_ca_system_score_codex":0.00005170081,"about_ca_system_score_gemma":0.00006042266,"threshold_uncertainty_score":0.93886745},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006597831,0.00015974995,0.98818594,0.00034045358,0.0035797302,0.00058680563,0.0000024196104,0.00024196987,0.00030510942],"genre_scores_gemma":[0.49865854,0.000006771261,0.49975744,0.000653506,0.0008065097,0.00001873682,0.0000011990078,0.000042015028,0.00005529026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99309385,0.000053069267,0.00061624113,0.0026482572,0.002209365,0.0013792438],"domain_scores_gemma":[0.9966487,0.00043383375,0.0003660541,0.0017670448,0.00039047262,0.00039383795],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00265369,0.00068328076,0.00063636637,0.0014758359,0.00079220836,0.0016890097,0.00746437,0.0002927634,0.000003957397],"category_scores_gemma":[0.00041779722,0.0006560466,0.000120114375,0.0032341594,0.0016449809,0.0013946205,0.0020796645,0.0025422487,0.000017441242],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044102244,0.00012916965,0.0022337204,0.000044198085,0.0000046679174,0.00012449802,0.011143813,0.11683972,0.00033498232,0.0077925264,0.0000014608778,0.86134684],"study_design_scores_gemma":[0.002079174,0.0012366186,0.009839107,0.007682351,0.000050119677,0.00030414373,0.000017532642,0.6899211,0.008168777,0.2541655,0.018261326,0.008274286],"about_ca_topic_score_codex":0.00011081559,"about_ca_topic_score_gemma":0.0003657862,"teacher_disagreement_score":0.8530725,"about_ca_system_score_codex":0.0005099636,"about_ca_system_score_gemma":0.0011482157,"threshold_uncertainty_score":0.9997589},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013655899,0.0006655156,0.99603224,0.00030915966,0.00091784203,0.001545882,0.000023515093,0.000095204785,0.00027410986],"genre_scores_gemma":[0.6797,0.00006027649,0.3196632,0.00012016384,0.0002365231,0.000096507094,0.0000096374115,0.000037928367,0.00007576509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619395,0.00007625634,0.0007719217,0.0011257575,0.001166555,0.00066556636],"domain_scores_gemma":[0.9954504,0.0010428315,0.0005531911,0.0019544074,0.0008479482,0.00015121863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012113991,0.00041739354,0.00056858116,0.0008576555,0.0002441953,0.0003558146,0.0048145163,0.0002767352,0.000014210587],"category_scores_gemma":[0.00006237581,0.00039406354,0.00015659613,0.00066743896,0.000582143,0.0006007264,0.0015296078,0.0005808892,0.00001066717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017604358,0.00003531292,0.000033632816,0.00012255253,0.00003268349,0.000007578982,0.0011504252,0.21089329,0.00031731874,0.05299466,0.000022980585,0.73437196],"study_design_scores_gemma":[0.0010754709,0.0005342942,0.00027204573,0.0007291582,0.000010638334,0.000016931564,0.0000025481202,0.94485277,0.00941442,0.041737925,0.00067186623,0.0006819168],"about_ca_topic_score_codex":0.00022836354,"about_ca_topic_score_gemma":0.00033469257,"teacher_disagreement_score":0.7339595,"about_ca_system_score_codex":0.00066195725,"about_ca_system_score_gemma":0.0011781473,"threshold_uncertainty_score":0.9998511},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036782563,0.0005672152,0.98979384,0.0001369397,0.0013142031,0.00029201424,0.000033043736,0.0001339632,0.0076920236],"genre_scores_gemma":[0.8169516,0.00012964492,0.18044585,0.00056611793,0.00074511475,0.000004511617,0.00022649222,0.000056943503,0.00087377476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960239,0.00005432255,0.0007687983,0.0015469956,0.0010975363,0.00050848315],"domain_scores_gemma":[0.99596035,0.00026511864,0.00043391687,0.0029971546,0.0002146742,0.00012875913],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012396516,0.0004043078,0.00057585805,0.00056342187,0.00014943142,0.0003385402,0.0070384042,0.00025617998,0.00003893503],"category_scores_gemma":[0.000058259135,0.00037953994,0.00008672729,0.00079753384,0.00035776262,0.0006303539,0.002117648,0.00034391935,0.000056924557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007995001,0.000086332446,0.000121407786,0.00013015578,0.000026003232,0.00004564033,0.0005168459,0.24930276,0.00005653877,0.054050267,0.0003213378,0.69533473],"study_design_scores_gemma":[0.00020216609,0.000110425004,0.00006712013,0.0006948039,0.00000773176,0.000044305896,4.569392e-8,0.9325076,0.00022734952,0.055135287,0.010545708,0.00045749743],"about_ca_topic_score_codex":0.00005570238,"about_ca_topic_score_gemma":0.000026100055,"teacher_disagreement_score":0.8169148,"about_ca_system_score_codex":0.00012507536,"about_ca_system_score_gemma":0.00060932996,"threshold_uncertainty_score":0.99986565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026329522,0.000044124517,0.98362553,0.0004790593,0.00063989224,0.014009725,0.0000046393848,0.00016091912,0.0007728183],"genre_scores_gemma":[0.36560568,0.000039434923,0.61997604,0.0064998823,0.0013435577,0.004715968,0.00000663889,0.00014571245,0.0016670942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965744,0.000047331727,0.00044952313,0.0014103084,0.0010097211,0.0005087345],"domain_scores_gemma":[0.9978437,0.00014439956,0.00021915208,0.0012265221,0.00024432482,0.00032188915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000461257,0.00045415084,0.00045552859,0.0008743476,0.0003316752,0.00077885384,0.0029275033,0.0003079085,0.0000216792],"category_scores_gemma":[0.00007707555,0.00042184137,0.00008850876,0.000743223,0.00049025984,0.0009878781,0.0017005905,0.0006352556,0.000054632288],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036978625,0.000049541035,0.0005419249,0.0003136171,0.000044413995,0.000382133,0.05362338,0.0020251188,0.00043899895,0.023439601,0.0007751621,0.9183291],"study_design_scores_gemma":[0.0020781662,0.0009461122,0.008416522,0.0013171268,0.0000222221,0.0010636292,0.0000018268224,0.55842704,0.0018062682,0.2885782,0.13409999,0.0032428713],"about_ca_topic_score_codex":0.000034880242,"about_ca_topic_score_gemma":0.00017806335,"teacher_disagreement_score":0.91508627,"about_ca_system_score_codex":0.00025328321,"about_ca_system_score_gemma":0.00049095583,"threshold_uncertainty_score":0.99982333},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014222405,0.00032491417,0.9915724,0.0012601892,0.0016507875,0.00033129996,0.000010278001,0.00031404992,0.004393894],"genre_scores_gemma":[0.10176817,0.00014072447,0.8933242,0.0033792765,0.00055267866,0.0000069465227,0.000022188326,0.000036110756,0.00076968526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955648,0.000047885576,0.0005961149,0.0017879654,0.0013707698,0.00063243526],"domain_scores_gemma":[0.99744433,0.00030702306,0.00032456144,0.0013916696,0.00027624506,0.00025619796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005805214,0.000590026,0.000514205,0.0006975905,0.00027794437,0.0008674689,0.0027832205,0.0004971815,0.00022103247],"category_scores_gemma":[0.000073062576,0.0005800187,0.00015619393,0.0005965362,0.0005141145,0.0011115915,0.000737506,0.0010824463,0.000103547696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051360907,0.000018692552,0.000083174884,0.0000051697666,0.000008320234,0.00009313778,0.00043786925,0.13125151,0.00006889603,0.0052103987,0.000035267418,0.8627824],"study_design_scores_gemma":[0.00050261634,0.0001954406,0.0014755357,0.00038284762,0.000012808901,0.000090136826,3.1072716e-7,0.90723324,0.0009202861,0.08525107,0.0027540522,0.0011816764],"about_ca_topic_score_codex":0.00008500373,"about_ca_topic_score_gemma":0.00018519996,"teacher_disagreement_score":0.86160076,"about_ca_system_score_codex":0.00036611827,"about_ca_system_score_gemma":0.0007365664,"threshold_uncertainty_score":0.99966514},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020861268,0.00009455189,0.9710583,0.0012143354,0.0050924253,0.0010014615,0.000117370866,0.000046080793,0.00051419885],"genre_scores_gemma":[0.9587203,0.0000013138626,0.03842394,0.00014723362,0.0017897569,0.00003580021,0.00040266084,0.000039800747,0.00043913885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979418,0.000015460048,0.00031108546,0.0008531416,0.0004726766,0.00040581875],"domain_scores_gemma":[0.99865985,0.00045355718,0.00022851568,0.00038156714,0.00019277705,0.00008375968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032628348,0.00036178238,0.00038231618,0.00041023208,0.00023883088,0.00013021118,0.00041728833,0.00028791133,0.000094903065],"category_scores_gemma":[0.00003023047,0.00032488993,0.00012299347,0.0002300372,0.00023739439,0.00018814021,0.00015901454,0.00075719133,0.000018757779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004540992,0.00023380376,0.0014816552,0.00008954508,0.00008649325,0.000015797668,0.0005845685,0.09429793,0.027580775,0.09049385,0.00013691088,0.7845446],"study_design_scores_gemma":[0.0053140977,0.00030889607,0.0025848544,0.00071492954,0.000049694216,0.000005713336,0.0000010386786,0.8815316,0.006139873,0.100145556,0.0017611572,0.0014425669],"about_ca_topic_score_codex":0.000034799417,"about_ca_topic_score_gemma":0.000111267495,"teacher_disagreement_score":0.93785906,"about_ca_system_score_codex":0.00018619066,"about_ca_system_score_gemma":0.00040357021,"threshold_uncertainty_score":0.9999203},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012505662,0.000055488672,0.9944522,0.0018936753,0.00083990744,0.0007797489,0.000038779148,0.00012999019,0.0017977224],"genre_scores_gemma":[0.0026328603,0.000002043349,0.9932517,0.00096370175,0.000499357,0.000056282803,0.000015070171,0.000024511004,0.0025544846],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716645,0.000007413617,0.00039857955,0.0013403498,0.0005413533,0.0005458358],"domain_scores_gemma":[0.9981358,0.00040830602,0.00012933413,0.00074068666,0.00023103009,0.00035483725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040555713,0.00037712848,0.0003163034,0.00056011666,0.000468316,0.0007837852,0.0026911455,0.0002529416,0.000022504702],"category_scores_gemma":[0.00007540009,0.00037381888,0.00012512079,0.0006248717,0.00016297272,0.0007163327,0.0009485727,0.0005158115,0.00009483121],"study_design_candidate":"design_other","study_design_consensus":null,"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.585209e-7,0.000020710946,0.0000060145385,0.0000064379315,0.000006492056,0.000003645026,0.00041886052,0.00318295,0.0011152264,0.03358719,0.00017397584,0.9614775],"study_design_scores_gemma":[0.00041684872,0.00019881617,0.00042827553,0.00018700905,0.00001050041,0.00025473334,4.3248832e-7,0.26245373,0.0025137379,0.639603,0.09273873,0.0011941948],"about_ca_topic_score_codex":0.000013531267,"about_ca_topic_score_gemma":0.00003923499,"teacher_disagreement_score":0.96028334,"about_ca_system_score_codex":0.0002663061,"about_ca_system_score_gemma":0.0013789919,"threshold_uncertainty_score":0.9998714},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33632076,0.000008017723,0.6632976,0.00018974964,0.00003800359,0.000057217952,9.971046e-7,0.000033187487,0.00005445354],"genre_scores_gemma":[0.54751986,9.745951e-7,0.45209765,0.00033636077,0.000038549733,0.000001960288,6.2159495e-7,0.0000029481575,0.0000010655217],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861264,0.00003922197,0.0001966481,0.00043290146,0.0004092668,0.0003093006],"domain_scores_gemma":[0.9989058,0.00050493865,0.000069263064,0.00036892263,0.000070471855,0.00008061238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027600708,0.0001299735,0.00026878796,0.00018774979,0.00019657731,0.000050356557,0.00040865407,0.000050636307,0.00016983638],"category_scores_gemma":[0.00017509848,0.00008456385,0.00006381349,0.0035387897,0.00031787276,0.00011395127,0.00013813598,0.00018075158,0.00000918673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010319408,0.0018170356,0.5039269,0.00007280629,0.00042566768,0.0015277275,0.0033453258,0.14772782,0.005098391,0.016735643,0.00042770032,0.31879184],"study_design_scores_gemma":[0.00029336388,0.00015738896,0.15421364,0.000014327162,0.00003998795,0.000102893595,5.2442124e-7,0.8271252,0.0009502975,0.016774904,0.000055000583,0.0002724993],"about_ca_topic_score_codex":0.000031617536,"about_ca_topic_score_gemma":0.000032369935,"teacher_disagreement_score":0.67939734,"about_ca_system_score_codex":0.000050963135,"about_ca_system_score_gemma":0.00005930084,"threshold_uncertainty_score":0.34484136},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013894031,0.00038828063,0.99368083,0.00041210678,0.001233919,0.0015193276,0.00001530393,0.0001696306,0.0011911716],"genre_scores_gemma":[0.7940238,0.000114781054,0.20472467,0.0004374551,0.0003219377,0.00023771128,0.000020566442,0.000029994135,0.000089068766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598825,0.00005726459,0.0008603847,0.0012896782,0.0012761361,0.0005282792],"domain_scores_gemma":[0.9958528,0.0005434265,0.0006103973,0.002433352,0.00045705552,0.00010291831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009768022,0.00048863434,0.0005278535,0.00055709283,0.00050812634,0.0002845952,0.0036180248,0.00032018803,0.00003302676],"category_scores_gemma":[0.00005524078,0.00035025956,0.00018603176,0.001141955,0.000915074,0.0008865694,0.0005159453,0.0007277795,0.000032630545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007488321,0.000055923203,0.0009332611,0.0001210194,0.000015507003,0.0000030947983,0.000814444,0.20859233,0.000111449284,0.004631148,0.00003214342,0.7846822],"study_design_scores_gemma":[0.00020915407,0.000083318344,0.0010993532,0.00042801074,0.000011032529,0.0000066760585,3.50694e-7,0.9578112,0.0023244729,0.037208747,0.00039771647,0.00042001135],"about_ca_topic_score_codex":0.00006867158,"about_ca_topic_score_gemma":0.00001921731,"teacher_disagreement_score":0.7926344,"about_ca_system_score_codex":0.00021507048,"about_ca_system_score_gemma":0.00040500812,"threshold_uncertainty_score":0.9998949},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003120998,0.00027414932,0.99335444,0.0005015823,0.00059127307,0.00043957285,0.0000076648,0.00045854598,0.004060668],"genre_scores_gemma":[0.4597368,0.00003552642,0.5391948,0.0005484833,0.00028297392,0.00000483982,0.000011219202,0.000029506149,0.00015587604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960879,0.00007516831,0.0009563564,0.0013245357,0.00096746755,0.00058857823],"domain_scores_gemma":[0.9968698,0.00046850086,0.0007017971,0.0013500827,0.0004597127,0.00015011383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007293671,0.0005979198,0.00073363836,0.0011994933,0.00022378252,0.00030478465,0.0030384713,0.0003523887,0.000025486475],"category_scores_gemma":[0.00010834229,0.000555931,0.00018054467,0.00078936684,0.0005971148,0.0003219033,0.0006951854,0.0007570892,0.000015256185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007833872,0.000029087472,0.000040676892,0.00002483258,0.000008345215,0.0000066475923,0.00055320567,0.700707,0.000178371,0.0032040721,0.000015952459,0.29522398],"study_design_scores_gemma":[0.0003177475,0.00013931487,0.00026815635,0.00032228453,0.0000073972624,0.000032669548,1.09003444e-7,0.9510195,0.0038907388,0.042980436,0.00042149378,0.000600139],"about_ca_topic_score_codex":0.000026887106,"about_ca_topic_score_gemma":0.000041466046,"teacher_disagreement_score":0.45942467,"about_ca_system_score_codex":0.00018546436,"about_ca_system_score_gemma":0.00043850607,"threshold_uncertainty_score":0.9996892},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082422295,0.00017851377,0.98655874,0.00020896106,0.0019379959,0.0005538618,0.0000043473556,0.00033704535,0.010138141],"genre_scores_gemma":[0.116347075,0.000019420137,0.8818876,0.001245677,0.0003127205,0.000019151006,0.0000033472022,0.00003963,0.0001253768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562174,0.000091126036,0.0006441389,0.0016692909,0.0012567088,0.0007170171],"domain_scores_gemma":[0.9967503,0.0005017619,0.00043600742,0.0018855359,0.00021706741,0.0002093447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017685272,0.00061254174,0.00057446293,0.0010440507,0.00039884675,0.0008128187,0.0030055074,0.0004600582,0.0000075022895],"category_scores_gemma":[0.00012360756,0.00056632,0.000118419375,0.0006410715,0.00052686105,0.00079249975,0.00080181257,0.0010002134,0.00004786874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001999389,0.000035127647,0.00003670318,0.0003000305,0.000009863497,0.000103308696,0.00080437865,0.040186927,0.00012749895,0.14276218,0.000010781028,0.8156032],"study_design_scores_gemma":[0.00033187278,0.00031719953,0.00014344853,0.0011783796,0.0000079833135,0.00008071348,2.0293047e-7,0.9885694,0.0011423228,0.006664136,0.00094286626,0.0006215006],"about_ca_topic_score_codex":0.000007828168,"about_ca_topic_score_gemma":0.0000046250525,"teacher_disagreement_score":0.94838244,"about_ca_system_score_codex":0.00047138816,"about_ca_system_score_gemma":0.00026304455,"threshold_uncertainty_score":0.99967885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008182695,0.00084666844,0.99259293,0.00036942062,0.002110176,0.00039657592,0.000020458207,0.000105438136,0.0034765003],"genre_scores_gemma":[0.03412892,0.00018315493,0.96115786,0.00259791,0.00044900278,0.000035256933,0.000035421966,0.00007076127,0.001341694],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957681,0.000051601975,0.000699256,0.001668889,0.0009214032,0.000890802],"domain_scores_gemma":[0.9975515,0.00036461977,0.00032277495,0.0014699538,0.00012300312,0.0001681695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010120231,0.00057735114,0.0006556668,0.0009556579,0.00023450979,0.00032953965,0.0020901212,0.00026852495,0.000023917964],"category_scores_gemma":[0.00012927323,0.00053137256,0.00009476318,0.0008417718,0.00043013942,0.0014639398,0.0013106689,0.00078641344,0.00007937656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011882491,0.0000863867,0.0011783609,0.00019242373,0.000026148879,0.00086722994,0.0013455818,0.039159384,0.0004710477,0.40647483,0.00026658628,0.54992014],"study_design_scores_gemma":[0.0025117858,0.00065002806,0.00085211755,0.005249451,0.000020549744,0.0006492812,0.0000021757112,0.186674,0.008668036,0.4852941,0.3037896,0.0056388765],"about_ca_topic_score_codex":0.00005314713,"about_ca_topic_score_gemma":0.00019259467,"teacher_disagreement_score":0.54428124,"about_ca_system_score_codex":0.0004687033,"about_ca_system_score_gemma":0.0003281255,"threshold_uncertainty_score":0.9997138},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012050169,0.00018974766,0.9964501,0.00034356982,0.0010553027,0.0013563443,0.000028145208,0.00013813541,0.0003181256],"genre_scores_gemma":[0.13141522,0.0000028079287,0.86732775,0.0006611893,0.00033067976,0.00009829275,0.0000185801,0.000041338302,0.00010412778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99612564,0.00004734179,0.00071622204,0.0014944228,0.0009865619,0.00062979903],"domain_scores_gemma":[0.9960167,0.0014751137,0.0006890028,0.0011091563,0.00055092515,0.00015914507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009159614,0.00053442694,0.0007781363,0.0007241452,0.00017553887,0.0002118228,0.0024837614,0.0003525025,0.0000036342426],"category_scores_gemma":[0.00015625508,0.00050860003,0.00023785145,0.0004923419,0.00053060317,0.00045328017,0.00038452444,0.00063759997,0.00000914515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026737724,0.00008246507,0.00005557574,0.000041549352,0.000013916625,0.00003667366,0.0005371472,0.65214163,0.0011743504,0.0017726322,0.000018415574,0.3440989],"study_design_scores_gemma":[0.0009653383,0.00062091975,0.00014789533,0.00049341295,0.000024294457,0.000039851653,1.7653355e-7,0.97426015,0.0047860397,0.017970957,0.00016328231,0.0005276984],"about_ca_topic_score_codex":0.000030834082,"about_ca_topic_score_gemma":0.0000048689403,"teacher_disagreement_score":0.34357122,"about_ca_system_score_codex":0.00030002126,"about_ca_system_score_gemma":0.00068100245,"threshold_uncertainty_score":0.99973655},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028194833,0.00031737966,0.9852309,0.0006846969,0.0028604767,0.00030667498,0.0000038129504,0.0001570186,0.010157078],"genre_scores_gemma":[0.10203841,0.000068530826,0.88490796,0.008312255,0.0016226547,0.000012418425,0.00003616027,0.000060277907,0.0029413127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960474,0.000032413987,0.0005033641,0.001488665,0.001305591,0.0006225766],"domain_scores_gemma":[0.9976042,0.0006176222,0.00024147726,0.0010599882,0.00025723258,0.00021951165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010393278,0.00050299877,0.0004197111,0.0015548985,0.00027053378,0.0004627631,0.0021304921,0.00030256185,0.000044205917],"category_scores_gemma":[0.000107748456,0.00047196398,0.00015114693,0.00094111054,0.00033148556,0.00044115342,0.0006215995,0.00065324985,0.00013412765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009127608,0.00002619367,0.0000042150386,0.0000101063315,0.000008301446,0.00007802507,0.00017290129,0.22929761,0.00009385435,0.20648593,0.00011519766,0.56369853],"study_design_scores_gemma":[0.00042859098,0.000261494,0.00009335301,0.00016194445,0.0000062294703,0.000050404575,4.3371877e-8,0.56239367,0.0024304977,0.42725113,0.0061448757,0.00077778776],"about_ca_topic_score_codex":0.000010843336,"about_ca_topic_score_gemma":0.00004341746,"teacher_disagreement_score":0.56292075,"about_ca_system_score_codex":0.00032354175,"about_ca_system_score_gemma":0.0004676745,"threshold_uncertainty_score":0.9997732},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000091628855,0.0006445661,0.99472016,0.0004726733,0.001152649,0.00028164816,0.000012746363,0.00025356613,0.0023703359],"genre_scores_gemma":[0.34677264,0.000062804706,0.6488906,0.0033272398,0.00072062906,0.00001637917,0.00007646738,0.00002998101,0.00010324892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636304,0.000035728688,0.0007935935,0.0008301812,0.0011831376,0.00079433265],"domain_scores_gemma":[0.9970522,0.00036304744,0.000555129,0.0014848796,0.0003240435,0.00022072291],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013331884,0.00050148414,0.0005878556,0.0017827848,0.00048630076,0.0011577051,0.003252361,0.00035320027,0.000042942167],"category_scores_gemma":[0.00010412548,0.0004890222,0.00025164025,0.0020884324,0.00040540463,0.0024441541,0.0011457368,0.00071904954,0.000096727876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032187195,0.000020596828,0.00023472853,0.000038016497,0.000084569234,0.0000022778088,0.004188963,0.08799261,0.000022640112,0.050456617,0.00009236389,0.8568634],"study_design_scores_gemma":[0.00014134523,0.000037602505,0.00023400325,0.00008525783,0.00005008294,0.000013639975,4.3930234e-7,0.97099715,0.00041346776,0.021724798,0.0057232925,0.00057890464],"about_ca_topic_score_codex":0.00013778979,"about_ca_topic_score_gemma":0.000071768714,"teacher_disagreement_score":0.88300455,"about_ca_system_score_codex":0.00037389982,"about_ca_system_score_gemma":0.00032357126,"threshold_uncertainty_score":0.9998792},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024459821,0.0003769281,0.9945108,0.00047627097,0.003227892,0.0007777718,0.000012399726,0.00026987077,0.0003235488],"genre_scores_gemma":[0.032278854,0.0000073584847,0.9663901,0.00063185056,0.00042612423,0.000028058745,0.0000140302645,0.000042835003,0.00018079969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576503,0.000026070404,0.0006132138,0.0017918905,0.0009763929,0.00082741596],"domain_scores_gemma":[0.99756485,0.00039501343,0.0003975424,0.0012034139,0.00027320074,0.00016594774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096404,0.0005888035,0.0005409388,0.0006527476,0.0003669501,0.00054142455,0.0032261352,0.00036505322,0.0000076245215],"category_scores_gemma":[0.00010973062,0.00057156704,0.00018336422,0.00052131247,0.00043808424,0.000558363,0.000659968,0.0006871821,0.000037289672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003801484,0.000037048423,0.000016350608,0.0000906637,0.000013831068,0.00012828545,0.0013429694,0.56494665,0.00016793657,0.011273856,0.00000817696,0.42197043],"study_design_scores_gemma":[0.00056438986,0.00016009151,0.00012305056,0.0011780277,0.000010820415,0.00008909338,1.7483276e-7,0.91567326,0.0004751332,0.080733724,0.00031071532,0.00068149995],"about_ca_topic_score_codex":0.000012845391,"about_ca_topic_score_gemma":0.0000068619784,"teacher_disagreement_score":0.42128894,"about_ca_system_score_codex":0.00069691153,"about_ca_system_score_gemma":0.00084050023,"threshold_uncertainty_score":0.9996736},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003312545,0.00039156165,0.9943195,0.00014819945,0.0017379224,0.0003190163,0.0000014669099,0.00017575092,0.0028734535],"genre_scores_gemma":[0.19510898,0.000008489926,0.803039,0.0012940547,0.00039627808,0.0000028068066,0.0000045854526,0.000044694454,0.00010107211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956211,0.0000895188,0.0006042935,0.0017301679,0.0011809408,0.000773999],"domain_scores_gemma":[0.9976228,0.00031562374,0.00034545438,0.0013019909,0.0002443746,0.00016973913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015004241,0.0006006336,0.00056954764,0.00089057436,0.00040349655,0.000801602,0.002642668,0.00036907068,0.000017015811],"category_scores_gemma":[0.000058727877,0.0005655205,0.00017821019,0.0007540899,0.0006018038,0.0010202235,0.0011350383,0.0010848754,0.000031861655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020946227,0.000015121264,0.000024321234,0.000027744723,0.000005910016,0.00008621147,0.00043356323,0.36524177,0.00012946092,0.0034444695,0.0000015592655,0.63058776],"study_design_scores_gemma":[0.00033796887,0.00005444005,0.00004120406,0.00042014412,0.000012053335,0.00021072423,1.4627517e-7,0.86994225,0.0014092093,0.12685665,0.00009853557,0.0006166521],"about_ca_topic_score_codex":0.00009379797,"about_ca_topic_score_gemma":0.0000098042265,"teacher_disagreement_score":0.62997115,"about_ca_system_score_codex":0.00075907586,"about_ca_system_score_gemma":0.0007675082,"threshold_uncertainty_score":0.9996796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013721655,0.0002987408,0.9940196,0.00081714615,0.0026630654,0.00073113997,0.00008099743,0.00024609393,0.0011418149],"genre_scores_gemma":[0.0015341231,0.000046658777,0.99472165,0.0017990593,0.0007860182,0.000013999131,0.00015592958,0.00004802242,0.0008945505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994705,0.00002156534,0.0005628167,0.0026528507,0.0011491153,0.00090862956],"domain_scores_gemma":[0.99437493,0.0006389309,0.00031896782,0.0042553493,0.00022029033,0.00019154017],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014972844,0.0006077329,0.0005921655,0.002052295,0.0003634933,0.0014079572,0.011269297,0.0002464237,0.000023514503],"category_scores_gemma":[0.00016463464,0.0005858039,0.00012804136,0.0014242046,0.00037512757,0.0016195752,0.006237873,0.0005458797,0.00006667342],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026210391,0.000032139185,0.000009412006,0.00007510651,0.000014700427,0.00007003385,0.00003623556,0.011215801,0.0000048777338,0.0018601905,0.0003927071,0.98628616],"study_design_scores_gemma":[0.00043573166,0.0001323775,0.000023411807,0.00017583542,0.000017257604,0.00001649632,3.917477e-8,0.96797293,0.00015613098,0.012257977,0.01811391,0.0006979054],"about_ca_topic_score_codex":0.0000174041,"about_ca_topic_score_gemma":0.000037155893,"teacher_disagreement_score":0.98558825,"about_ca_system_score_codex":0.00021386343,"about_ca_system_score_gemma":0.00022095264,"threshold_uncertainty_score":0.99965936},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007586276,0.0013129548,0.99351597,0.00031650055,0.002314514,0.00045237623,0.000054370197,0.00011010338,0.0018473384],"genre_scores_gemma":[0.013407686,0.00004121154,0.9848133,0.0011888697,0.0002755516,0.000017500595,0.00003470939,0.000040176088,0.00018101497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995349,0.00013149309,0.0012155897,0.0015553087,0.001194536,0.00055405893],"domain_scores_gemma":[0.9950025,0.0006746003,0.0008900034,0.0025890835,0.0006637117,0.00018011885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002200538,0.0005776567,0.00094590377,0.0005786208,0.0002379729,0.00020859925,0.0025258614,0.00024234988,0.000008007397],"category_scores_gemma":[0.00029601654,0.00049575296,0.0001138013,0.00091983523,0.0005069698,0.0013006655,0.001570948,0.000718134,0.000018516403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009190732,0.00004051428,0.000057452628,0.0010217405,0.00002275905,0.000050766615,0.0017327245,0.016808573,0.0028166627,0.87238044,0.000039662184,0.10501953],"study_design_scores_gemma":[0.0014268934,0.00051917514,0.000076977434,0.009895644,0.000034205266,0.00033855668,0.00001816067,0.7816426,0.013423701,0.14482895,0.0433547,0.004440396],"about_ca_topic_score_codex":0.0010390824,"about_ca_topic_score_gemma":0.0008906761,"teacher_disagreement_score":0.76483405,"about_ca_system_score_codex":0.00025355842,"about_ca_system_score_gemma":0.00055078074,"threshold_uncertainty_score":0.9997494},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003822628,0.0006003869,0.985891,0.0009892331,0.0012437595,0.0018739165,0.000020672278,0.00011017177,0.009232625],"genre_scores_gemma":[0.34733605,0.000034775483,0.6437044,0.0019159126,0.004542705,0.00038574374,0.000090476875,0.000044303655,0.0019456188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728566,0.000038186714,0.00046988582,0.000645781,0.0010096156,0.00055089116],"domain_scores_gemma":[0.9982833,0.00022444714,0.00040191622,0.00035965937,0.00062463013,0.0001059908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014674806,0.00031126244,0.00035442147,0.00062586763,0.0010514789,0.0003610332,0.0007595812,0.0003213803,0.00002924543],"category_scores_gemma":[0.00013466453,0.00028254965,0.00015140812,0.00032984457,0.0011989743,0.0003371601,0.00012709391,0.00026789287,0.000018248687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033954817,0.00013696215,0.0004657209,0.00040370348,0.00008765934,0.000011214246,0.03821839,0.20215264,0.00007984806,0.05543149,0.0011055632,0.7018728],"study_design_scores_gemma":[0.0008166411,0.00012707448,0.000026675747,0.00024943615,0.000027890193,0.0000033403633,0.000024473818,0.906076,0.00017031211,0.0037615874,0.08785054,0.00086603005],"about_ca_topic_score_codex":0.000056157973,"about_ca_topic_score_gemma":0.0006831538,"teacher_disagreement_score":0.70392334,"about_ca_system_score_codex":0.00032049412,"about_ca_system_score_gemma":0.00074719166,"threshold_uncertainty_score":0.9999627},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026504777,0.0001690508,0.9923649,0.0026904265,0.002126331,0.00078120636,0.00010656902,0.0002571238,0.0012393326],"genre_scores_gemma":[0.412662,0.00006330771,0.5828631,0.0036685746,0.0004198977,0.000012033289,0.00008444001,0.00005061769,0.00017605672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958782,0.000048295955,0.00064390746,0.0022501631,0.0005808449,0.0005985701],"domain_scores_gemma":[0.9965442,0.00026245363,0.0003706896,0.002364615,0.00019709613,0.00026094785],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010846597,0.0005731731,0.00062615756,0.00076807337,0.00028929295,0.0011439589,0.0038306443,0.00033399707,0.000022029331],"category_scores_gemma":[0.000086357126,0.000512848,0.000054572796,0.00045869392,0.00023601226,0.0013119077,0.0047576344,0.0008000646,0.000011451487],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053607705,0.000018252811,0.00015741585,0.00006734429,0.00001895387,0.000032591233,0.0007899074,0.0002888543,0.0025628498,0.016704397,0.00017322389,0.9791809],"study_design_scores_gemma":[0.0021774913,0.0014573351,0.0008915063,0.0027953193,0.00004581135,0.00047732503,0.0000019215054,0.6144471,0.0081540365,0.32238072,0.043282762,0.0038886943],"about_ca_topic_score_codex":0.00015432198,"about_ca_topic_score_gemma":0.00042660636,"teacher_disagreement_score":0.97529215,"about_ca_system_score_codex":0.0002934798,"about_ca_system_score_gemma":0.00041275972,"threshold_uncertainty_score":0.99989295},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008027192,0.00031444506,0.99490064,0.00034715273,0.00072560436,0.00029025768,0.0000064319397,0.00020324966,0.0024095192],"genre_scores_gemma":[0.75702214,0.000028801183,0.24192831,0.00072436273,0.00008467985,0.000017271912,0.0000103684,0.000031394266,0.00015269629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99524397,0.000059280224,0.00080412644,0.0017668549,0.0012083604,0.0009174024],"domain_scores_gemma":[0.99769974,0.0004849886,0.0003645488,0.0010651024,0.00023146743,0.00015414036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011687367,0.00058013713,0.0005836189,0.0014939756,0.00025495604,0.0007510845,0.0029356235,0.00038212308,0.000013915697],"category_scores_gemma":[0.00008820019,0.00060021546,0.00011189878,0.001031507,0.00057189283,0.0010139232,0.00085990515,0.001522249,0.00003638967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052028554,0.0000642442,0.0002688385,0.000102829305,0.000010143539,0.0005464862,0.0013739406,0.48152676,0.0003087292,0.050662663,0.000022820908,0.46510735],"study_design_scores_gemma":[0.00018222991,0.00006300708,0.00018725828,0.00077263376,0.000003069371,0.00005694197,3.9569417e-7,0.6422104,0.00015565885,0.35583413,0.000016507129,0.0005177363],"about_ca_topic_score_codex":0.00015954803,"about_ca_topic_score_gemma":0.00042139468,"teacher_disagreement_score":0.7562194,"about_ca_system_score_codex":0.00043446195,"about_ca_system_score_gemma":0.00072948606,"threshold_uncertainty_score":0.99964494},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034693003,0.0007446818,0.9862571,0.0006631712,0.0005807191,0.00030829333,0.000022063721,0.00003584689,0.011041223],"genre_scores_gemma":[0.51572055,0.0006968817,0.45597363,0.0032231978,0.0013450664,0.00004971281,0.0000075111357,0.00017152213,0.02281193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978271,0.000023392517,0.0005451998,0.00049258984,0.00070483,0.0004068716],"domain_scores_gemma":[0.996094,0.002202822,0.0004245232,0.0008175194,0.00039599897,0.000065149026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009121157,0.00031133776,0.00043969858,0.0003018385,0.00018128562,0.00016506606,0.0012887745,0.0001493999,0.00015734076],"category_scores_gemma":[0.0005063756,0.00020052995,0.000108812594,0.00044530144,0.00077425066,0.00016048404,0.00037552722,0.0004399983,0.000022663418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094524885,0.000026527241,0.000035542726,0.00038389888,0.000026740287,0.000007878717,0.0016519608,0.00011921174,0.00002048104,0.8175681,0.00050148106,0.17964873],"study_design_scores_gemma":[0.00012607462,0.00006394604,0.0000083528585,0.00037809924,0.00000820349,0.0000075871385,7.121227e-7,0.005283974,0.001721454,0.98713046,0.0050143604,0.0002567478],"about_ca_topic_score_codex":0.00004905982,"about_ca_topic_score_gemma":0.00011029264,"teacher_disagreement_score":0.53028345,"about_ca_system_score_codex":0.000107371474,"about_ca_system_score_gemma":0.00025015435,"threshold_uncertainty_score":0.8177374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002776536,0.0003663697,0.9956886,0.0011794246,0.0011505482,0.0005447587,0.00000760922,0.00016958469,0.00086532685],"genre_scores_gemma":[0.48841506,0.00005939868,0.5095379,0.0014672872,0.00039530825,0.000029770736,0.000012242681,0.000031003463,0.00005203404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954976,0.00005821509,0.00080401724,0.0018435038,0.00076405867,0.0010326002],"domain_scores_gemma":[0.9961964,0.0017372486,0.00036755318,0.0011359392,0.00031229833,0.00025058447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010604961,0.000654574,0.0006805881,0.0010062921,0.0003021902,0.0009018097,0.0024525078,0.00061352865,0.000026319896],"category_scores_gemma":[0.00037126496,0.00063262956,0.00016288471,0.0007198606,0.0006703162,0.0010542715,0.0007042044,0.0015082835,0.000007916346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009561544,0.000024751742,0.0000600647,0.000024482786,0.000008222714,0.000043701533,0.000279288,0.31071067,0.000014175983,0.37904647,0.000023897934,0.30975473],"study_design_scores_gemma":[0.00020650163,0.000098801705,0.00007104083,0.00024382723,0.0000050606727,0.00003071752,1.5269276e-7,0.5773935,0.000061923405,0.42126927,0.00017411202,0.0004451041],"about_ca_topic_score_codex":0.000026774986,"about_ca_topic_score_gemma":0.00026376962,"teacher_disagreement_score":0.4883873,"about_ca_system_score_codex":0.00028846564,"about_ca_system_score_gemma":0.00091280957,"threshold_uncertainty_score":0.9996125},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011428673,0.00009881823,0.98641306,0.00049633643,0.0005957507,0.00030997637,0.000021182457,0.000070643466,0.0005655291],"genre_scores_gemma":[0.9191133,0.00010126013,0.08038405,0.0003024537,0.00003956276,0.000005640842,0.000009375806,0.000013602115,0.000030741394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979675,0.00008170401,0.0005376213,0.0006408583,0.0005025236,0.00026983902],"domain_scores_gemma":[0.99753773,0.0009979213,0.00029436263,0.000935623,0.00016954244,0.000064817374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007864482,0.00028157697,0.00039904594,0.0003682824,0.00028557464,0.0002501361,0.0013654004,0.000113397255,0.0000048597394],"category_scores_gemma":[0.00006550331,0.00020920727,0.0000835013,0.0003415822,0.001542432,0.00031454687,0.00062899996,0.00034280584,0.0000031282143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006669812,0.00010396037,0.0000162536,0.00007203008,0.00003551537,0.000028332484,0.0017377603,0.07096822,0.003654609,0.13998345,0.0000111065965,0.7833221],"study_design_scores_gemma":[0.00027204448,0.0003194656,0.00021093739,0.00035065203,0.00000574877,0.000047372803,4.6303023e-7,0.8260351,0.0055466616,0.166937,0.00006658585,0.00020799003],"about_ca_topic_score_codex":0.000049072238,"about_ca_topic_score_gemma":0.00006303623,"teacher_disagreement_score":0.9076846,"about_ca_system_score_codex":0.000084669206,"about_ca_system_score_gemma":0.00011801615,"threshold_uncertainty_score":0.8531225},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013226262,0.00041269488,0.9958497,0.00024241932,0.00077839766,0.000858046,0.000011601101,0.0006149997,0.0010998645],"genre_scores_gemma":[0.04936776,0.00012509151,0.9490961,0.00056768756,0.00041382192,0.000075750424,0.000014234699,0.00005521536,0.00028438022],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588925,0.000017713463,0.00056619087,0.0019716148,0.00069632824,0.0008589344],"domain_scores_gemma":[0.99742424,0.0004873186,0.00029860515,0.0013091076,0.0003081193,0.00017262423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055011484,0.0006273159,0.000595168,0.0008482801,0.0004991069,0.00045138254,0.0037748949,0.00033848482,0.000003880191],"category_scores_gemma":[0.00012328601,0.0005771735,0.0002577564,0.0005579071,0.00095974177,0.0008827022,0.0015885425,0.00067209767,0.000005774753],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064174164,0.00018746515,0.00046280978,0.00065191585,0.000061004255,0.0003285128,0.0022421565,0.010813019,0.0013214749,0.066082455,0.0005170305,0.917268],"study_design_scores_gemma":[0.0003683075,0.00045319274,0.000078485726,0.0007802171,0.000009723498,0.0001677136,8.848293e-8,0.3611046,0.008831931,0.62168133,0.0052748406,0.0012495933],"about_ca_topic_score_codex":0.000006130485,"about_ca_topic_score_gemma":0.0000145845515,"teacher_disagreement_score":0.91601837,"about_ca_system_score_codex":0.00022921857,"about_ca_system_score_gemma":0.0003416446,"threshold_uncertainty_score":0.99966794},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020549895,0.00005732409,0.99035364,0.0012135722,0.00093794015,0.0004178411,0.000013939628,0.00025385257,0.0067313244],"genre_scores_gemma":[0.006945108,0.000022572736,0.98563343,0.006896241,0.0002218712,0.0000149399075,0.000080376805,0.000016082677,0.00016938451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694806,0.00006350929,0.0005668729,0.00089166616,0.0010129109,0.0005169811],"domain_scores_gemma":[0.99788153,0.00038565125,0.0003631476,0.00085055357,0.0003504075,0.00016867976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009919765,0.0004487544,0.00039284912,0.0011503258,0.00023708901,0.0007117896,0.0017050153,0.0004112856,0.000058660957],"category_scores_gemma":[0.00012896147,0.00041502138,0.00013855779,0.0006059714,0.00016777402,0.0023593444,0.00037439083,0.00071316294,0.00044968692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007758077,0.000015485064,0.0000010757478,0.00001997624,0.0000026878345,0.00001129548,0.00036346537,0.011033974,0.000097044525,0.0004930841,0.0001025275,0.9878516],"study_design_scores_gemma":[0.0004431541,0.00023653601,0.000032139764,0.0005686372,0.000008614419,0.000040801904,3.4194085e-7,0.86031306,0.0070704985,0.12369679,0.0069041355,0.00068529573],"about_ca_topic_score_codex":0.000012421633,"about_ca_topic_score_gemma":0.000012113764,"teacher_disagreement_score":0.98716635,"about_ca_system_score_codex":0.00021500647,"about_ca_system_score_gemma":0.00046217474,"threshold_uncertainty_score":0.9998302},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008671303,0.00069064565,0.9952679,0.00011465201,0.0015234125,0.0008374991,0.000004004309,0.00006968104,0.00062505034],"genre_scores_gemma":[0.9612084,0.00027965498,0.037043925,0.0008898928,0.00044740379,0.000017503835,0.000011721252,0.000046876936,0.00005461497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579746,0.00006157909,0.00092534797,0.0015596069,0.000836072,0.0008199314],"domain_scores_gemma":[0.9971663,0.0006037179,0.0005647047,0.0012045413,0.00024948939,0.00021125477],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010636556,0.00062145875,0.0008088769,0.00087676785,0.00012894806,0.00026525516,0.0021635164,0.00076995784,0.00001230303],"category_scores_gemma":[0.00003976746,0.00060252886,0.00009772008,0.00084631826,0.0011005256,0.00046752155,0.0010284996,0.001203747,0.0000026903508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018693307,0.000018852508,0.00009783836,0.000041907402,0.000010928806,0.00014826334,0.0006819014,0.44310883,0.00006265835,0.011101123,0.00001640607,0.5446926],"study_design_scores_gemma":[0.00042631605,0.00018181879,0.00034063464,0.00052471005,0.000006765117,0.00015727202,2.8521987e-7,0.979942,0.0008265715,0.016870908,0.0001503962,0.00057228084],"about_ca_topic_score_codex":0.00002438384,"about_ca_topic_score_gemma":0.0002847083,"teacher_disagreement_score":0.9603413,"about_ca_system_score_codex":0.0002649492,"about_ca_system_score_gemma":0.00029265776,"threshold_uncertainty_score":0.9996426},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040608044,0.00018550587,0.9936024,0.00022460902,0.0012484669,0.00031540875,0.00008651035,0.00016483697,0.00011144778],"genre_scores_gemma":[0.075486526,0.00012144116,0.923456,0.00043010394,0.0003652475,0.0000066432003,0.00010561541,0.000016970154,0.000011455469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628353,0.00004907202,0.00086124404,0.0017362981,0.0007945304,0.0002753133],"domain_scores_gemma":[0.9943322,0.00092101167,0.00059708377,0.0038563984,0.00020175887,0.000091571936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011132916,0.00032403207,0.00054512394,0.00035753733,0.00015290438,0.00035440017,0.005307278,0.00037761143,0.000012631987],"category_scores_gemma":[0.00040034673,0.0002936024,0.000053233234,0.00026091587,0.0012196169,0.0011987798,0.0028564588,0.0006414617,0.000010503837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015204267,0.00002559747,0.000046718214,0.000006854323,0.000004236156,0.0000055902024,0.00030348258,0.000033649576,0.005000302,0.003506187,0.000041204767,0.9910247],"study_design_scores_gemma":[0.00017383098,0.00008809537,0.00090952014,0.00029174986,0.0000076240826,0.000009409545,2.2251585e-7,0.89236987,0.014159936,0.09082032,0.0007987795,0.00037066962],"about_ca_topic_score_codex":0.000025370076,"about_ca_topic_score_gemma":0.00007975558,"teacher_disagreement_score":0.990654,"about_ca_system_score_codex":0.000051017785,"about_ca_system_score_gemma":0.00031052102,"threshold_uncertainty_score":0.9999516},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023441106,0.00069120666,0.96588117,0.0001538267,0.0023720928,0.00039685142,0.0000040378013,0.00009806444,0.006961618],"genre_scores_gemma":[0.86449975,0.000015344413,0.1250969,0.00053495844,0.0014908641,0.000021176991,0.000016504466,0.00010496706,0.008219522],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99719083,0.00019664323,0.0004311286,0.0011503744,0.00033791966,0.00069310865],"domain_scores_gemma":[0.99744785,0.0015573634,0.00039491509,0.00033656464,0.0001687833,0.000094496456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003144869,0.00043163696,0.0004769684,0.0008345282,0.0005471612,0.00010413866,0.0004875223,0.00034387145,0.000073802104],"category_scores_gemma":[0.00059818465,0.00041163497,0.00014361384,0.0002289959,0.00043151874,0.00012779603,0.00032661756,0.0021085371,0.000017227003],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001218662,0.000029893954,0.0026099943,0.00010446888,0.00007242359,0.000041203548,0.014402324,0.0052467473,0.00076419994,0.0012395161,0.0000049798127,0.97536236],"study_design_scores_gemma":[0.016227711,0.008154532,0.47825113,0.02179854,0.00059390516,0.0038534391,0.00032904706,0.32231513,0.0042083072,0.05766973,0.07259032,0.014008209],"about_ca_topic_score_codex":0.000033992063,"about_ca_topic_score_gemma":0.000010070751,"teacher_disagreement_score":0.9613542,"about_ca_system_score_codex":0.0002603316,"about_ca_system_score_gemma":0.00006474725,"threshold_uncertainty_score":0.9998335},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014949883,0.00029143426,0.99774104,0.0005243275,0.00055702333,0.0005991174,0.000056952533,0.000110395704,0.000104728875],"genre_scores_gemma":[0.000559867,0.000008372399,0.99821484,0.000339301,0.00028139137,0.00002534762,0.00007318036,0.0000249368,0.0004727702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752665,0.000021990249,0.0003785087,0.0012688888,0.0004328059,0.00037118714],"domain_scores_gemma":[0.9979363,0.00052770786,0.0003295906,0.00070200197,0.00037573965,0.00012864471],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094131584,0.0003308109,0.00027659335,0.0006523399,0.00053748226,0.00041607127,0.0008269886,0.00034041464,0.0000027089934],"category_scores_gemma":[0.00010476879,0.0003256455,0.00007963891,0.0005454778,0.00030482124,0.0006690772,0.00036283716,0.00043943292,0.0000057763586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002544841,0.000050995124,0.00002055395,0.00001772718,0.000009238877,0.0000016018089,0.00026316303,0.006056442,0.0010182186,0.01806238,0.000018545554,0.9744786],"study_design_scores_gemma":[0.0003502843,0.00005655247,0.00033495048,0.00014333779,0.000017023913,0.000049261318,5.9897366e-7,0.9888592,0.0003138955,0.006411904,0.0031108917,0.00035214442],"about_ca_topic_score_codex":0.000020186599,"about_ca_topic_score_gemma":0.00008705131,"teacher_disagreement_score":0.9828027,"about_ca_system_score_codex":0.00027803078,"about_ca_system_score_gemma":0.00027702926,"threshold_uncertainty_score":0.99991953},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055853714,0.00014432569,0.9796935,0.0005525384,0.0016814441,0.00030454362,0.0000047282037,0.0002693676,0.016791021],"genre_scores_gemma":[0.8121705,0.00016304314,0.1813632,0.0052429433,0.00076114305,0.000023286379,0.000013281093,0.00006480828,0.00019777424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965455,0.000053451324,0.0004826224,0.0012967968,0.0009728541,0.0006487712],"domain_scores_gemma":[0.99779695,0.00036036278,0.00020740405,0.0013004562,0.00014850653,0.00018630097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009606705,0.0005423159,0.00040537634,0.0011778952,0.00039657333,0.0005824354,0.003104356,0.00030585343,0.000048370664],"category_scores_gemma":[0.00003775859,0.0004968864,0.00019674332,0.0010499433,0.00056557887,0.00087038527,0.00034155458,0.0008220784,0.000085840096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008331341,0.000016585285,0.000005416111,0.000013795793,0.0000058082837,0.000050414514,0.0006338767,0.01266714,0.00010586991,0.4205492,0.000011477029,0.5659321],"study_design_scores_gemma":[0.0002444161,0.00031486654,0.00002507445,0.00037372485,0.000007312242,0.000092235234,1.5928481e-7,0.17705305,0.0026558365,0.8151922,0.0032575754,0.0007835495],"about_ca_topic_score_codex":0.000007750593,"about_ca_topic_score_gemma":0.000027932378,"teacher_disagreement_score":0.811612,"about_ca_system_score_codex":0.00023879782,"about_ca_system_score_gemma":0.00028230328,"threshold_uncertainty_score":0.9997483},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006161202,0.000281318,0.9873977,0.00056745537,0.0022900132,0.00033867438,0.000004685581,0.0002594599,0.008799119],"genre_scores_gemma":[0.023171306,0.00009940142,0.9665416,0.009452325,0.00021353866,0.000014695055,0.0000070651577,0.000038825357,0.0004612514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962223,0.000037582482,0.00067896344,0.0012204984,0.0010676921,0.00077295536],"domain_scores_gemma":[0.9972932,0.00017452045,0.0003466934,0.0016402222,0.0002754191,0.00026995904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086638855,0.00058747083,0.00050419976,0.0012253647,0.0003251061,0.0007373188,0.0034582608,0.00036441252,0.00006490714],"category_scores_gemma":[0.00006104495,0.0005267706,0.00023836622,0.0010008189,0.00066070474,0.0011310162,0.0007435196,0.0008491029,0.00025401104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067504125,0.0001154487,0.00016447213,0.00008386484,0.000029211145,0.00013033883,0.0023907148,0.00927245,0.0002031893,0.20589142,0.0006113296,0.7811008],"study_design_scores_gemma":[0.0006654391,0.00018993506,0.00019332454,0.0002282311,0.00000854548,0.00016973368,3.7168826e-7,0.8463707,0.0014171461,0.121032074,0.028389107,0.001335419],"about_ca_topic_score_codex":0.000007037239,"about_ca_topic_score_gemma":0.000025398,"teacher_disagreement_score":0.83709824,"about_ca_system_score_codex":0.00016154726,"about_ca_system_score_gemma":0.00036820787,"threshold_uncertainty_score":0.99971837},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019918145,0.0010888744,0.9919148,0.00039839695,0.00424491,0.0005274539,0.00002828056,0.00022751228,0.0013705579],"genre_scores_gemma":[0.17955363,0.000035015266,0.8102471,0.0018124814,0.0035608287,0.000015594756,0.00003803765,0.0000972341,0.0046400637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945813,0.000078169614,0.00069426955,0.0024142712,0.001201829,0.0010301579],"domain_scores_gemma":[0.9944338,0.0013309561,0.00041776206,0.0031503104,0.00030003398,0.00036712064],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015016294,0.0006828981,0.00075152714,0.00086260564,0.0003605917,0.0009345926,0.007229906,0.00032679256,0.00004662564],"category_scores_gemma":[0.00042524424,0.00063101813,0.00011731897,0.0006427916,0.0002251198,0.0012888454,0.005996886,0.0010393632,0.00041493188],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066860434,0.00006854978,0.0010468627,0.0000577224,0.00008362901,0.00014041568,0.009104463,0.017952073,0.0011015162,0.058494534,0.00013315932,0.9118104],"study_design_scores_gemma":[0.00064465415,0.0003937833,0.0032209393,0.006130515,0.000050225706,0.00016594208,0.000007394511,0.54085475,0.0032822292,0.047771875,0.39297837,0.0044992836],"about_ca_topic_score_codex":0.00020226878,"about_ca_topic_score_gemma":0.00006105152,"teacher_disagreement_score":0.9073111,"about_ca_system_score_codex":0.00045150862,"about_ca_system_score_gemma":0.00042662612,"threshold_uncertainty_score":0.9996141},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008912259,0.0026071812,0.98773724,0.0005266582,0.0023457776,0.00031540677,0.00003113178,0.00028325603,0.006064228],"genre_scores_gemma":[0.2615388,0.0017984468,0.71700203,0.010194493,0.0010688559,0.000042639498,0.00007848737,0.00019235957,0.008083862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940928,0.00008958554,0.0007879846,0.002076295,0.0019052377,0.0010480991],"domain_scores_gemma":[0.9960446,0.0010620302,0.00032023643,0.001942302,0.0003194801,0.00031134588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008018626,0.0008111512,0.0008923812,0.0016445649,0.0005820926,0.00057675573,0.0051487302,0.00048739125,0.00009019287],"category_scores_gemma":[0.00013887204,0.0007609435,0.0002720979,0.0018153269,0.0022700299,0.00085147074,0.0020212184,0.0011355531,0.00017005482],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014220577,0.00009077819,0.000028549615,0.000059546626,0.00003418729,0.00028306444,0.0007952911,0.004290314,0.00006783774,0.028265161,0.0032699986,0.96280104],"study_design_scores_gemma":[0.0010436922,0.0005702547,0.00028868782,0.0005888293,0.000021414782,0.00045277114,5.0077534e-7,0.63377017,0.002676859,0.27861127,0.07939429,0.0025812818],"about_ca_topic_score_codex":0.00008202167,"about_ca_topic_score_gemma":0.00003614309,"teacher_disagreement_score":0.96021974,"about_ca_system_score_codex":0.00043712254,"about_ca_system_score_gemma":0.00068685465,"threshold_uncertainty_score":0.9994842},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019936451,0.00015373374,0.98461103,0.0007346499,0.004800555,0.00033794204,0.0000024104506,0.00020583457,0.008954472],"genre_scores_gemma":[0.06355159,0.00005381344,0.9332601,0.001955993,0.0005447671,0.000011099875,0.0000021869305,0.00003899642,0.000581468],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962291,0.000043959386,0.0004792357,0.0016531311,0.0009923292,0.0006022452],"domain_scores_gemma":[0.99698704,0.00038783558,0.00031724456,0.0019233443,0.00018733322,0.00019718081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015652205,0.0005282874,0.0004680601,0.0007507626,0.00030642463,0.00057102065,0.0032939496,0.0005505402,0.00001912247],"category_scores_gemma":[0.00028622305,0.00048079927,0.0001009782,0.00047087125,0.0009898307,0.0006340425,0.0011417995,0.0016364371,0.000089975925],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055683413,0.000013444866,0.000014579428,0.00002632392,0.0000043467785,0.000011414244,0.0005894689,0.00066856644,0.00084779446,0.16144471,0.0000051697107,0.8363686],"study_design_scores_gemma":[0.0005754517,0.00051083515,0.000955079,0.0006495688,0.00001339592,0.00021497063,1.4899877e-7,0.3965845,0.045021374,0.5367257,0.017030243,0.0017187094],"about_ca_topic_score_codex":0.000010674574,"about_ca_topic_score_gemma":0.000019215864,"teacher_disagreement_score":0.8346499,"about_ca_system_score_codex":0.00017005131,"about_ca_system_score_gemma":0.0003022019,"threshold_uncertainty_score":0.9997644},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000066672495,0.00085117837,0.98444843,0.0013475713,0.002245442,0.0008686667,0.000036182602,0.0003020033,0.009833863],"genre_scores_gemma":[0.044984475,0.000040662173,0.9391612,0.010186218,0.0023915572,0.00009059393,0.000074522184,0.00013814347,0.0029326295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529797,0.000026804315,0.00062066654,0.0020377885,0.0010027565,0.0010140117],"domain_scores_gemma":[0.99659485,0.0006515165,0.000360959,0.0018149454,0.0003790296,0.00019873094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006436318,0.00072137645,0.0006376489,0.0008252471,0.0003866334,0.0006677522,0.005116207,0.00040963595,0.00001236066],"category_scores_gemma":[0.000017662109,0.00064139196,0.0002303239,0.00072819926,0.00038350926,0.00058746006,0.001345136,0.00067369937,0.00004566955],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028272141,0.00010284945,0.000100061785,0.00030813186,0.00003939055,0.000079598234,0.0014904083,0.12911724,0.00033469262,0.06511518,0.00078085606,0.8025033],"study_design_scores_gemma":[0.0009421361,0.000460895,0.00019090371,0.0006446241,0.000030239567,0.000094631745,3.210631e-7,0.5001345,0.0050652553,0.38549384,0.1051368,0.0018058114],"about_ca_topic_score_codex":0.00013118717,"about_ca_topic_score_gemma":0.00063848717,"teacher_disagreement_score":0.8006975,"about_ca_system_score_codex":0.00020066276,"about_ca_system_score_gemma":0.0005060031,"threshold_uncertainty_score":0.99960375},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000130418,0.0016179599,0.9937222,0.0011757779,0.0019920697,0.0011843159,0.000017330138,0.00008506806,0.00007487013],"genre_scores_gemma":[0.83304757,0.00016117825,0.1651499,0.00094878074,0.00034398455,0.0000967013,0.000004366296,0.00006791435,0.00017960081],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637014,0.00014138449,0.0006684909,0.001324406,0.0008491385,0.00064644375],"domain_scores_gemma":[0.9905345,0.00677287,0.00060712645,0.0012776601,0.0006369275,0.00017090418],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002237509,0.0005283214,0.0007918055,0.0004673895,0.00048396268,0.00058424537,0.0025235203,0.0002947787,0.0000027890173],"category_scores_gemma":[0.0005345917,0.00040932768,0.0001399818,0.00046849772,0.0008686558,0.0006006678,0.00083117763,0.00046701208,0.0000040181576],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002835966,0.000026654718,0.00025626537,0.00014880188,0.000041309315,0.000021724145,0.0026565383,0.0019001948,0.0002082253,0.009316153,0.00010299501,0.9852928],"study_design_scores_gemma":[0.0019407838,0.0005628383,0.00045899127,0.002216398,0.000046379366,0.0003825388,0.0000087300305,0.79073274,0.0053253006,0.18702698,0.009391271,0.001907033],"about_ca_topic_score_codex":0.000032314823,"about_ca_topic_score_gemma":0.00011712852,"teacher_disagreement_score":0.98338574,"about_ca_system_score_codex":0.00020069416,"about_ca_system_score_gemma":0.0008089225,"threshold_uncertainty_score":0.99983585},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005773307,0.0030202458,0.9878523,0.0012420374,0.0020285458,0.00050247385,0.000010792089,0.00034544524,0.0044208686],"genre_scores_gemma":[0.5966853,0.0009700718,0.40029013,0.0012200299,0.00042624286,0.00001122689,0.000010622811,0.000040012354,0.0003463738],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99386024,0.000040923238,0.0005815734,0.0030167545,0.0014555572,0.0010449423],"domain_scores_gemma":[0.9939264,0.0010047413,0.00029567393,0.0042336355,0.00032640374,0.00021315282],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0019523947,0.00063462224,0.0007474888,0.00096274633,0.000809395,0.0010978389,0.011374628,0.000294815,0.000007202341],"category_scores_gemma":[0.0011979416,0.0005039169,0.000057675337,0.00100812,0.008959908,0.0017078108,0.008928216,0.0007477674,0.000022229631],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000971843,0.000049308474,0.0005173094,0.00012615825,0.000018277618,0.00043051143,0.002394896,0.0016087646,0.00008058064,0.1648335,0.00012207053,0.8298089],"study_design_scores_gemma":[0.00032035194,0.00025068238,0.0017050896,0.000416064,0.00001986302,0.0009252929,0.0000017835507,0.47329745,0.00030398072,0.5193876,0.0022315106,0.0011403488],"about_ca_topic_score_codex":0.00006400862,"about_ca_topic_score_gemma":0.00023667871,"teacher_disagreement_score":0.82866853,"about_ca_system_score_codex":0.00022840657,"about_ca_system_score_gemma":0.0019856095,"threshold_uncertainty_score":0.99993914},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001208522,0.00009198595,0.98971486,0.0020157308,0.0031843204,0.0009660963,0.00003017702,0.0002189793,0.0037766697],"genre_scores_gemma":[0.024538694,0.00002387163,0.9709274,0.0024221155,0.0009811836,0.000111695525,0.000052594252,0.000053763935,0.0008886732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735755,0.000029414388,0.00042322816,0.0012152131,0.0004459307,0.0005286933],"domain_scores_gemma":[0.99720377,0.0007226641,0.00032632984,0.001471632,0.00018685199,0.00008873883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013580684,0.00040940562,0.0003454786,0.00051458104,0.00041350536,0.00081088574,0.0038875777,0.00015759323,0.000019620973],"category_scores_gemma":[0.000041120562,0.00029815137,0.00015503206,0.0003898412,0.00028294997,0.00064805994,0.00093879533,0.0003502949,0.000054275275],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065162244,0.000014571205,0.0000056901863,0.000075402655,0.000017164097,0.00000934737,0.000111925925,0.0019232415,0.0000098989885,0.037173282,0.00020836288,0.96044457],"study_design_scores_gemma":[0.0003601462,0.00011748214,0.0000108718295,0.00020156844,0.000020876309,0.000009370889,3.323971e-7,0.9324253,0.00033999348,0.012046044,0.054037943,0.00043006882],"about_ca_topic_score_codex":0.000016919706,"about_ca_topic_score_gemma":0.00003302272,"teacher_disagreement_score":0.9600145,"about_ca_system_score_codex":0.0002328554,"about_ca_system_score_gemma":0.0003321854,"threshold_uncertainty_score":0.9999471},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031255855,0.00040110297,0.99603164,0.000061242674,0.00067780213,0.0019451176,0.000026356429,0.0000781097,0.00046609613],"genre_scores_gemma":[0.3025918,0.00003224518,0.6965936,0.00009503989,0.00023425154,0.00026512242,0.000029527557,0.000031528783,0.00012687455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971068,0.000032684973,0.0006734597,0.0010620249,0.0006726021,0.00045246052],"domain_scores_gemma":[0.99796194,0.000099071585,0.00044285445,0.001158561,0.00024788055,0.00008967933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009045784,0.00036128084,0.00050402945,0.0009837224,0.00011788148,0.00010781464,0.0010843648,0.00016925037,7.218777e-7],"category_scores_gemma":[0.000028023755,0.00033246944,0.000068716356,0.0005550285,0.00022596779,0.0015519608,0.0004511797,0.00019830374,0.000002532005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013970941,0.000059125836,0.00003715104,0.0008999624,0.0000069546477,0.000028432041,0.0008374486,0.24829274,0.00030380124,0.66291744,0.000002010279,0.086600944],"study_design_scores_gemma":[0.00030375613,0.00015387936,0.000033828,0.0013035166,0.000005754831,0.000018941137,0.00000173356,0.96402454,0.00029575767,0.0334333,0.000076794764,0.00034822494],"about_ca_topic_score_codex":0.00005557487,"about_ca_topic_score_gemma":0.00021849625,"teacher_disagreement_score":0.71573174,"about_ca_system_score_codex":0.0004282085,"about_ca_system_score_gemma":0.00018351345,"threshold_uncertainty_score":0.99991274},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002700242,0.0019412125,0.9873751,0.00041144862,0.00116478,0.00036526614,0.000077049735,0.00029408612,0.008344084],"genre_scores_gemma":[0.104229696,0.00030355575,0.8878582,0.0059050294,0.0012203472,0.000019306,0.00021215678,0.000076150325,0.00017553981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99550045,0.000042100546,0.0005502868,0.0020017487,0.0011856401,0.00071976654],"domain_scores_gemma":[0.9965829,0.00032239247,0.00035029143,0.0020708302,0.000409449,0.00026409441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007453153,0.00068423786,0.00059554615,0.0011173674,0.00033438555,0.0005755486,0.0051241373,0.00063334825,0.00021713911],"category_scores_gemma":[0.000087921595,0.0006232602,0.00022121298,0.0011284066,0.00083670265,0.001220025,0.0018364214,0.0015551809,0.000093045026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009212855,0.000054458807,0.00006661365,0.00006882728,0.000028165057,0.00017199246,0.0006127603,0.00024738596,0.00011405573,0.8430332,0.00050930283,0.15508406],"study_design_scores_gemma":[0.0002719505,0.00018429081,0.0002474924,0.00053358974,0.000014556792,0.00009437174,6.865794e-8,0.0118236765,0.0007059472,0.95727164,0.027857706,0.0009947347],"about_ca_topic_score_codex":0.000011077162,"about_ca_topic_score_gemma":0.000044460765,"teacher_disagreement_score":0.15408933,"about_ca_system_score_codex":0.00013406338,"about_ca_system_score_gemma":0.00055701967,"threshold_uncertainty_score":0.99962187},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004872175,0.0006668445,0.99276525,0.0004487069,0.0025466038,0.0011179076,0.000016388372,0.000048215134,0.0023413538],"genre_scores_gemma":[0.1839708,0.00009844581,0.812357,0.00192152,0.0009625254,0.000031604643,0.0000071097993,0.00007334974,0.000577655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626124,0.00004131089,0.00096824695,0.0011820067,0.00094630173,0.000600866],"domain_scores_gemma":[0.99447817,0.0020046448,0.0006213551,0.0022640876,0.0005027616,0.00012898962],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0025982035,0.00042144948,0.0006387407,0.0005019581,0.00028578122,0.00048313368,0.011777864,0.0003032788,0.000031714208],"category_scores_gemma":[0.00013706589,0.00032052278,0.00017345796,0.00043121382,0.0023493317,0.0010060163,0.0022600002,0.0005398488,0.000009680274],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046156096,0.00005731878,0.000046532317,0.00004329593,0.000020838763,0.000009891201,0.001936039,0.017838772,0.0004699562,0.054394282,0.000054479784,0.92508245],"study_design_scores_gemma":[0.00019372196,0.00084150565,0.00017948938,0.00050275744,0.000021875607,0.000026911468,0.00000200459,0.5814568,0.02363969,0.36773816,0.024708943,0.00068815873],"about_ca_topic_score_codex":0.000127037,"about_ca_topic_score_gemma":0.00042811377,"teacher_disagreement_score":0.92439425,"about_ca_system_score_codex":0.00017851076,"about_ca_system_score_gemma":0.00097000855,"threshold_uncertainty_score":0.99992466},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025469936,0.0010558736,0.9427393,0.012520481,0.0025585322,0.0014567713,0.000023339308,0.00041828598,0.013757453],"genre_scores_gemma":[0.8374325,0.000039956965,0.13721132,0.024656113,0.0005389204,0.000024965415,0.000013363575,0.000047778776,0.00003506242],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99505913,0.00010800957,0.0006866985,0.0018700956,0.0013476413,0.00092841004],"domain_scores_gemma":[0.9957588,0.00077905034,0.00030274846,0.0027600857,0.00023690316,0.0001624367],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014132912,0.0007078226,0.00062513386,0.0007690816,0.00026893243,0.0006388177,0.00813319,0.0003786179,0.000035439305],"category_scores_gemma":[0.000045354223,0.00052104203,0.00013922778,0.0019752115,0.00055970217,0.00062095013,0.0019706315,0.0015174054,0.0000597499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050258117,0.00025500436,0.0010316008,0.0008834733,0.000048105627,0.0011497943,0.07995042,0.05011767,0.0018657665,0.15107366,0.000017925058,0.71355635],"study_design_scores_gemma":[0.0027846098,0.00061631406,0.0039918236,0.003174974,0.000049603135,0.0010243076,0.000045983885,0.21537624,0.0048775226,0.75694567,0.007398794,0.0037141817],"about_ca_topic_score_codex":0.00067252334,"about_ca_topic_score_gemma":0.0060418234,"teacher_disagreement_score":0.8119626,"about_ca_system_score_codex":0.0003183498,"about_ca_system_score_gemma":0.0010060086,"threshold_uncertainty_score":0.9997241},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061309468,0.00021549633,0.9356505,0.0024386954,0.00022592598,0.00006878059,0.0000060310895,0.000056333196,0.000028763428],"genre_scores_gemma":[0.68208927,0.0000129009695,0.31726077,0.00060080085,0.00003089734,2.0814396e-7,0.0000033915906,0.0000010986146,6.5062267e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741805,0.000074347,0.00033369113,0.0010023175,0.0006926915,0.0004789132],"domain_scores_gemma":[0.9970709,0.0005331218,0.000102100035,0.0020301016,0.00011651361,0.00014724107],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001135335,0.00015305018,0.00029190525,0.00026961247,0.00013596208,0.00019907569,0.006386864,0.00006342216,0.000011106876],"category_scores_gemma":[0.0007198932,0.000113439324,0.00005545723,0.0060286154,0.00051304663,0.0009518618,0.0015345244,0.0002452813,0.000012220508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004373875,0.00023444752,0.006555487,0.0000050064405,0.0000059812864,0.00003691245,0.0002832506,0.0306825,0.0023035053,0.003246002,0.000020114714,0.9566224],"study_design_scores_gemma":[0.00013927215,0.00023410955,0.053446896,0.000016647591,0.0000057433217,0.000019163073,7.8295784e-7,0.930821,0.0029101048,0.012156871,0.000055443023,0.00019396364],"about_ca_topic_score_codex":0.00004254044,"about_ca_topic_score_gemma":0.000021061962,"teacher_disagreement_score":0.95642847,"about_ca_system_score_codex":0.000035897112,"about_ca_system_score_gemma":0.0001147912,"threshold_uncertainty_score":0.99898905},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005626113,0.0002680193,0.973466,0.000271974,0.0011093554,0.0006246683,0.0000141170085,0.000108016015,0.018511737],"genre_scores_gemma":[0.9965885,0.00009412815,0.0016848205,0.00021573904,0.0012461783,0.00001697331,0.00008701446,0.000021734524,0.0000449046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981405,0.000003952288,0.00050059584,0.00062506914,0.00050013355,0.00022971639],"domain_scores_gemma":[0.9989122,0.000040735693,0.00042521395,0.00040082587,0.00021106515,0.0000099205745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031847914,0.00023223509,0.0002791223,0.0009023914,0.000107549626,0.00008053908,0.00045402427,0.0002494411,0.000011294816],"category_scores_gemma":[0.00005335647,0.00023124088,0.00006653669,0.0006175091,0.0003185954,0.0006737038,0.00015554181,0.0003183348,0.000028529945],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030901076,0.00006361745,0.015154498,0.0002062289,0.000004106563,0.0000066642524,0.000108747,0.018279327,0.0005173639,0.026625302,0.000082143924,0.9389211],"study_design_scores_gemma":[0.00047936622,0.000039499566,0.21382648,0.0005349694,0.000021187447,0.0000056624394,6.6947695e-7,0.7133489,0.00012550894,0.06136001,0.0098124165,0.00044530403],"about_ca_topic_score_codex":0.00026761487,"about_ca_topic_score_gemma":0.0002575797,"teacher_disagreement_score":0.9909624,"about_ca_system_score_codex":0.00015317393,"about_ca_system_score_gemma":0.00008242604,"threshold_uncertainty_score":0.9429729},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019267492,0.0002152302,0.9960372,0.0006121316,0.0011666034,0.0007882222,0.000017960652,0.00014917321,0.00082084053],"genre_scores_gemma":[0.061547905,0.00001726022,0.93570155,0.002161354,0.00031434276,0.000045396966,0.000026561725,0.000033421293,0.00015223144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99526834,0.00007948176,0.00084229105,0.0019549278,0.0009979112,0.0008570579],"domain_scores_gemma":[0.9962326,0.0008252151,0.00046305486,0.0019528192,0.00032752843,0.00019874812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022349586,0.00061247766,0.0008549228,0.0026590652,0.00022151702,0.0004779306,0.004214172,0.00047360762,0.00003524843],"category_scores_gemma":[0.00023237866,0.0005987665,0.00035454007,0.002279482,0.0005469929,0.00094489043,0.0006037033,0.0007186453,0.000031241223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037274254,0.00007943947,0.0005420741,0.000080812664,0.00007800834,0.000027294582,0.0011282684,0.33138067,0.00032494203,0.02166606,0.0000332316,0.6446219],"study_design_scores_gemma":[0.00048186778,0.00013548748,0.0008311417,0.00011340522,0.000045966797,0.0000049498717,1.8584512e-7,0.9806693,0.0037795857,0.008944911,0.004284115,0.0007090591],"about_ca_topic_score_codex":0.000027425549,"about_ca_topic_score_gemma":0.0002507826,"teacher_disagreement_score":0.64928865,"about_ca_system_score_codex":0.00074545,"about_ca_system_score_gemma":0.00070203707,"threshold_uncertainty_score":0.99964637},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053677656,0.0012606289,0.9954502,0.00011013628,0.0009963688,0.0003923824,0.0000094185125,0.00039425012,0.00084984594],"genre_scores_gemma":[0.7131812,0.00045899503,0.2850705,0.00035047563,0.00056168356,0.00003769179,0.00003206781,0.00010905538,0.00019832529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984041,0.0000049229866,0.0003327363,0.0004741953,0.00027919732,0.0005048881],"domain_scores_gemma":[0.9993104,0.00015773615,0.000062883235,0.00033931172,0.00008886753,0.00004083013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025228973,0.00031366604,0.00033947497,0.00041787425,0.00012451016,0.00012300126,0.0005656048,0.00038217497,0.000014705721],"category_scores_gemma":[0.00003065386,0.00031978305,0.00007366102,0.00037542102,0.00022912383,0.0001322124,0.00012498963,0.00047751312,0.000010251591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048149336,0.0000031703278,0.00002754191,0.00008689698,0.000004479999,0.00002167313,0.00017369215,0.91041553,0.000100576086,0.0076877913,0.000017074342,0.08145676],"study_design_scores_gemma":[0.00057296985,0.00011173346,0.00006500411,0.0013850468,0.000011302333,0.000033163506,0.0000011062572,0.8346102,0.0044319616,0.15695408,0.00098367,0.0008397414],"about_ca_topic_score_codex":0.000004882387,"about_ca_topic_score_gemma":0.000092932554,"teacher_disagreement_score":0.7126444,"about_ca_system_score_codex":0.00050283514,"about_ca_system_score_gemma":0.00012773207,"threshold_uncertainty_score":0.99992543},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011022516,0.00005534833,0.986707,0.000585238,0.00208214,0.00042843726,0.000009914497,0.000057344543,0.008972333],"genre_scores_gemma":[0.63188136,0.000022527362,0.35397884,0.012823209,0.0006994393,0.000024594972,0.000030978015,0.000050268038,0.00048879086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653476,0.000027129294,0.00059989694,0.00096695905,0.0010266954,0.00084457913],"domain_scores_gemma":[0.9975609,0.0003887283,0.0003492177,0.00084377266,0.0006106352,0.0002467375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005906787,0.00054519315,0.00044622732,0.0010272923,0.00036393252,0.0008619657,0.0025561915,0.0002502584,0.000038316444],"category_scores_gemma":[0.00016216388,0.0005000095,0.0001481626,0.0006596443,0.00027461257,0.0031378502,0.0012334272,0.0007434918,0.0002507584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046515535,0.000040832027,0.00018496496,0.00006805613,0.000039211016,0.00015270663,0.012626807,0.053652756,0.0025218562,0.049471457,0.00022811958,0.8809667],"study_design_scores_gemma":[0.0013038357,0.0015043241,0.0046544396,0.0024988838,0.000036267946,0.00033295003,0.00002987499,0.8468246,0.057524055,0.049212694,0.031305335,0.0047727544],"about_ca_topic_score_codex":0.000050241004,"about_ca_topic_score_gemma":0.00007510247,"teacher_disagreement_score":0.87619394,"about_ca_system_score_codex":0.00057927694,"about_ca_system_score_gemma":0.0003556298,"threshold_uncertainty_score":0.99974513},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015830963,0.00037777206,0.99358386,0.00009446179,0.001683523,0.0004729505,0.0000031823465,0.0001432373,0.003482725],"genre_scores_gemma":[0.79118943,0.00002076108,0.20821176,0.00023253231,0.0001831595,0.00000703072,0.000011998512,0.000028691049,0.000114655864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968282,0.000054176435,0.000799915,0.0011207588,0.00068980706,0.0005071721],"domain_scores_gemma":[0.9972222,0.00015646119,0.00067516137,0.0013795379,0.00042126156,0.00014540527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006398077,0.00046103334,0.00063650537,0.0007892174,0.00023844423,0.00033479018,0.0029672396,0.00032311666,0.000029822968],"category_scores_gemma":[0.000041926512,0.00041399282,0.00015519766,0.00073787034,0.0007273325,0.0006875133,0.0009394904,0.000485868,0.00002534074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001696834,0.00020824486,0.0007124898,0.00021877112,0.000060580933,0.000038157414,0.0041719414,0.04218781,0.0007984059,0.5611079,0.00003462839,0.39044416],"study_design_scores_gemma":[0.000334845,0.00031064317,0.00028802396,0.0002431606,0.000027122367,0.00012692089,7.743186e-7,0.75968623,0.003677475,0.23366366,0.0007860549,0.0008550841],"about_ca_topic_score_codex":0.00015459997,"about_ca_topic_score_gemma":0.00006882013,"teacher_disagreement_score":0.7910311,"about_ca_system_score_codex":0.0002062596,"about_ca_system_score_gemma":0.0004439415,"threshold_uncertainty_score":0.9998312},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048567847,0.0006693578,0.9943234,0.0003384124,0.00046097295,0.00033401267,0.0000054908287,0.00008013293,0.0033025856],"genre_scores_gemma":[0.2990098,0.00008669944,0.700123,0.00057114684,0.00015560164,0.0000038622943,0.000010267713,0.00001685809,0.000022733733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734175,0.000025460826,0.00054605503,0.00103191,0.0006565926,0.0003982076],"domain_scores_gemma":[0.9981592,0.00038517572,0.00039386746,0.00071176153,0.00022485811,0.00012511974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075832166,0.00034356135,0.00043528544,0.00063937064,0.00015123568,0.0002155882,0.0012399871,0.00024543266,0.0000039172423],"category_scores_gemma":[0.000038854065,0.0003043666,0.000075273514,0.000441403,0.0005427874,0.00040285126,0.00061958854,0.00033904173,0.000008495321],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067242718,0.000027452776,0.00011281764,0.00005051363,0.0000064834526,0.000017216193,0.00033237258,0.009806392,0.00013970427,0.018592685,0.0000148230465,0.9708928],"study_design_scores_gemma":[0.00046368942,0.00027655705,0.004069954,0.00030028177,0.000009983583,0.00007998951,2.566844e-7,0.70272875,0.0007404066,0.2901432,0.0005701969,0.0006167536],"about_ca_topic_score_codex":0.000037471447,"about_ca_topic_score_gemma":0.000021526352,"teacher_disagreement_score":0.97027606,"about_ca_system_score_codex":0.00009415799,"about_ca_system_score_gemma":0.00019253748,"threshold_uncertainty_score":0.9999409},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040797924,0.00013573993,0.992868,0.00074146123,0.0019229226,0.0013091376,0.0000045241977,0.00079635775,0.0021810264],"genre_scores_gemma":[0.031137533,0.0000054369266,0.967372,0.0007110387,0.0004218668,0.000066151115,0.00001071576,0.00004939569,0.00022589044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995817,0.000108197935,0.0007548525,0.001987302,0.0006120068,0.00072064635],"domain_scores_gemma":[0.99587107,0.0012481011,0.00054716313,0.0017766639,0.00044012596,0.00011687544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035989082,0.00058520195,0.00063604984,0.0007927315,0.00033673493,0.0005981284,0.0030657619,0.0003942693,0.000004690648],"category_scores_gemma":[0.0004412086,0.0005678645,0.00020382548,0.00054168014,0.00046762923,0.0008177549,0.0010819737,0.00076714973,0.00000684018],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003972562,0.00001876962,0.00004757858,0.00007175199,0.000004247954,0.000004674881,0.00031091322,0.0010057876,0.0024071336,0.0103856865,0.000028616694,0.98571086],"study_design_scores_gemma":[0.00014680377,0.00022576017,0.00023499959,0.00031079378,0.000009628162,0.000035047357,5.997374e-8,0.63064706,0.031976223,0.33273908,0.002902617,0.0007719168],"about_ca_topic_score_codex":0.00004627224,"about_ca_topic_score_gemma":0.000049813076,"teacher_disagreement_score":0.984939,"about_ca_system_score_codex":0.00061021413,"about_ca_system_score_gemma":0.00050046004,"threshold_uncertainty_score":0.9996773},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000093309354,0.0012546083,0.9962269,0.000010817876,0.0014614763,0.00044433435,0.0000067298283,0.000106223844,0.00039560883],"genre_scores_gemma":[0.4122376,0.00024087695,0.58386606,0.00042279743,0.0025979413,0.000056195317,0.00019087912,0.00015532646,0.00023229122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879545,0.0000032641726,0.00027771198,0.00031913578,0.00024853635,0.00035588627],"domain_scores_gemma":[0.99938333,0.00012991272,0.000066378074,0.00027192873,0.00007115269,0.00007728237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022837604,0.00025011747,0.00024058603,0.00027244946,0.0001162075,0.000128267,0.00025473596,0.00021532307,0.00001119186],"category_scores_gemma":[0.000022598964,0.00024700176,0.00006263418,0.00012835857,0.00007503348,0.00018001828,0.00004362732,0.00022252144,0.000010389933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.6942547e-7,0.0000025279135,0.0000053262543,0.000044421617,0.0000038524245,8.212335e-7,0.00016089962,0.73500913,0.00024187873,0.00093734526,0.000017830747,0.2635752],"study_design_scores_gemma":[0.0001318918,0.00005669743,0.000004297552,0.00008499014,0.00001042673,0.0000057049333,9.906262e-8,0.99047995,0.0014670498,0.005955658,0.001515715,0.0002875106],"about_ca_topic_score_codex":0.0000025442364,"about_ca_topic_score_gemma":0.000012247066,"teacher_disagreement_score":0.41236082,"about_ca_system_score_codex":0.00023516607,"about_ca_system_score_gemma":0.000055895245,"threshold_uncertainty_score":0.9999982},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000043270225,0.00029362194,0.99280417,0.0021092847,0.00093941414,0.0034052194,0.00005432023,0.00017038059,0.00021927731],"genre_scores_gemma":[0.00020615404,0.00019951115,0.997603,0.0003411488,0.0006430206,0.00017766796,0.000031609434,0.00008499665,0.0007129132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9916563,0.0003081082,0.0008436082,0.002493386,0.0031451113,0.001553494],"domain_scores_gemma":[0.9900433,0.0034529832,0.0003829951,0.0032561682,0.0024015605,0.00046299075],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["sts"],"category_scores_codex":[0.0082814675,0.0007614828,0.00063607265,0.0005295425,0.002280093,0.003075215,0.0074833306,0.00047257828,0.000051545205],"category_scores_gemma":[0.00031943375,0.00043383604,0.00016302726,0.0013899883,0.0029638456,0.0009963241,0.0020054951,0.002365087,0.000013043069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016510097,0.00006102714,0.000003274432,0.00001785751,0.000024613457,0.000022362445,0.00041647724,0.34896562,0.000009759538,0.001302617,0.0000108974245,0.649149],"study_design_scores_gemma":[0.0005856905,0.000840485,0.00002576289,0.00008759455,0.000017486305,0.00009071449,0.000002316896,0.99045885,0.00037051397,0.005372281,0.0015561215,0.00059216353],"about_ca_topic_score_codex":0.00008374401,"about_ca_topic_score_gemma":0.00008887864,"teacher_disagreement_score":0.6485568,"about_ca_system_score_codex":0.000474107,"about_ca_system_score_gemma":0.0029342922,"threshold_uncertainty_score":0.9999365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55538845,0.00017229318,0.3958736,0.00027852034,0.004453389,0.0008412525,0.000015035922,0.00023094993,0.04274649],"genre_scores_gemma":[0.9905758,0.000053238102,0.0067811585,0.0007397911,0.00035210536,0.0000075719104,0.0000068455183,0.00003803357,0.0014454378],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9980648,0.000043372027,0.00024106482,0.00085993996,0.00034928485,0.00044153928],"domain_scores_gemma":[0.99880975,0.00032300976,0.00018490333,0.0003985694,0.00014373405,0.00014001732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062019133,0.0003768151,0.00032538173,0.00059144007,0.00019127116,0.0001399438,0.00032081114,0.00033880325,0.0002148676],"category_scores_gemma":[0.000029549466,0.0002968507,0.00007700997,0.00016831678,0.00038203815,0.00018358049,0.00012845847,0.0012796372,0.0001615323],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009871309,0.00010817093,0.00047815032,0.0000611088,0.000045101817,0.00005732561,0.0055023897,0.0008837469,0.0010951795,0.00046582104,0.000022314118,0.99118197],"study_design_scores_gemma":[0.0140608065,0.04216714,0.5270671,0.010099637,0.0005899958,0.005278144,0.000027949149,0.119977966,0.08146162,0.16726398,0.016916063,0.015089567],"about_ca_topic_score_codex":0.0000241861,"about_ca_topic_score_gemma":0.00018306258,"teacher_disagreement_score":0.9760924,"about_ca_system_score_codex":0.00013418833,"about_ca_system_score_gemma":0.00015457321,"threshold_uncertainty_score":0.9999484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.953292e-7,0.000036276928,0.9047395,0.0002204902,0.00026260118,0.09300484,0.0000046259165,0.00015833312,0.0015727506],"genre_scores_gemma":[0.0026137682,0.0000022855413,0.930477,0.0003937401,0.00023848019,0.06549406,0.000009697153,0.000041015035,0.0007299298],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956476,0.00006732371,0.0007833107,0.0021069208,0.00074799743,0.0006468348],"domain_scores_gemma":[0.99613947,0.00046865866,0.00058942614,0.0019796907,0.000559748,0.00026302296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080898654,0.0005467565,0.0006598669,0.0018536736,0.00028603393,0.0006626731,0.002886247,0.0003103374,0.000046192516],"category_scores_gemma":[0.00013601457,0.00052745856,0.000383333,0.0031615896,0.00035720275,0.0008818528,0.0005249864,0.00050917454,0.000019789395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017875805,0.00008199304,0.00008470483,0.00010595789,0.00009187644,0.000007495046,0.0007239104,0.037851587,0.0000834962,0.34933943,0.0000428601,0.6115688],"study_design_scores_gemma":[0.0005372014,0.00016690422,0.00008469486,0.00008741713,0.00004119736,0.0000068584845,1.1361148e-7,0.2767859,0.001263422,0.7173116,0.0032162638,0.00049841823],"about_ca_topic_score_codex":0.000012079499,"about_ca_topic_score_gemma":0.00012246503,"teacher_disagreement_score":0.6110704,"about_ca_system_score_codex":0.0002341015,"about_ca_system_score_gemma":0.000882139,"threshold_uncertainty_score":0.9997177},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007998143,0.00032150393,0.99355537,0.00027732138,0.0007044697,0.00030414958,0.000023917366,0.00012889362,0.004676406],"genre_scores_gemma":[0.35677814,0.0020053976,0.6359215,0.0026714262,0.00088554685,0.00003261485,0.00014139176,0.0001540004,0.0014099779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963496,0.00003605165,0.0007361324,0.0012522861,0.001220805,0.00040513184],"domain_scores_gemma":[0.99683446,0.00024762552,0.00058209157,0.001541323,0.0006404377,0.00015406134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006024559,0.00040395962,0.00051243516,0.0017108533,0.00014508258,0.0002915997,0.0032982975,0.00025217945,0.000035874906],"category_scores_gemma":[0.00007813012,0.00033614988,0.00014544796,0.0020517842,0.0005860473,0.0006727159,0.0009401977,0.00021772861,0.00006697835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016953173,0.000032437943,0.000074251264,0.000029876737,0.000009697549,0.0000042012543,0.00014759612,0.0031395247,0.0001528825,0.58085185,0.00010777043,0.4154482],"study_design_scores_gemma":[0.00054217316,0.00019653875,0.00022042177,0.0005056604,0.000016455064,0.00002042637,2.156705e-7,0.72206163,0.004298147,0.23550591,0.035590895,0.0010415372],"about_ca_topic_score_codex":0.000004786656,"about_ca_topic_score_gemma":0.00001106188,"teacher_disagreement_score":0.7189221,"about_ca_system_score_codex":0.00017946972,"about_ca_system_score_gemma":0.00036902883,"threshold_uncertainty_score":0.99990904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006480627,0.00085189746,0.9953386,0.0010978043,0.0010913836,0.0006499029,0.000026207714,0.00015931566,0.00077838416],"genre_scores_gemma":[0.06976005,0.00025709375,0.9238747,0.0021990729,0.003182993,0.00006882204,0.0002451736,0.00007975788,0.00033235727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962648,0.000017756403,0.00048869994,0.00199915,0.00054241176,0.000687151],"domain_scores_gemma":[0.9971218,0.0002691524,0.00022560019,0.00208282,0.00013070204,0.00016992583],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005243083,0.000423656,0.000396617,0.00024099063,0.00040301977,0.0008190629,0.0061580185,0.00026611512,0.00001402753],"category_scores_gemma":[0.000017648108,0.0003812767,0.000095201656,0.00048164456,0.00044783935,0.0006816569,0.0018637613,0.0007026635,0.000010312122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050209137,0.000018735689,0.0000011924592,0.000014167108,0.0000034580933,0.00000697504,0.000028739989,0.06510636,0.000006059881,0.009396352,0.00012512779,0.9252878],"study_design_scores_gemma":[0.00013556944,0.000066775654,0.0000062153326,0.0002190324,0.000009019562,0.000031481763,1.1056582e-8,0.9014174,0.000012305567,0.08722606,0.010474222,0.0004019557],"about_ca_topic_score_codex":0.0000056552412,"about_ca_topic_score_gemma":0.000057981833,"teacher_disagreement_score":0.92488587,"about_ca_system_score_codex":0.00013902238,"about_ca_system_score_gemma":0.00039491098,"threshold_uncertainty_score":0.9998639},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003770004,0.00005229912,0.99505985,0.000620388,0.001046705,0.0006985845,0.000014122129,0.00024124325,0.0018898394],"genre_scores_gemma":[0.33442622,0.00009480407,0.6560827,0.0046071867,0.002248063,0.00012184558,0.00027622958,0.00009426904,0.0020487055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965958,0.000026217447,0.00061355234,0.0013777484,0.0007984699,0.0005882051],"domain_scores_gemma":[0.998019,0.00028095406,0.00032132235,0.00071128673,0.00047785943,0.00018960626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009512904,0.00044503473,0.00038099245,0.0010743536,0.0005381837,0.000469797,0.0011956869,0.00043413872,0.000029939501],"category_scores_gemma":[0.00004845842,0.00044704208,0.00018996972,0.000400521,0.00030793526,0.0008537457,0.0003232703,0.00075598556,0.00006089752],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014925591,0.00006563819,0.000003446179,0.000060045822,0.000014056253,0.000012182608,0.00046080255,0.014072401,0.0006728435,0.011525797,0.00007353171,0.9730243],"study_design_scores_gemma":[0.00027490448,0.00013066671,0.00001961307,0.00018707094,0.000011411625,0.00003375486,9.082232e-8,0.63897586,0.0018859316,0.35754636,0.00052291754,0.00041141204],"about_ca_topic_score_codex":0.000009059365,"about_ca_topic_score_gemma":0.00013481524,"teacher_disagreement_score":0.9726129,"about_ca_system_score_codex":0.00041126105,"about_ca_system_score_gemma":0.00030643365,"threshold_uncertainty_score":0.9997981},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016933969,0.0012187714,0.96438146,0.00015484571,0.003224505,0.00044721464,0.000007942211,0.00012622999,0.030269688],"genre_scores_gemma":[0.8463077,0.00017828851,0.14734398,0.0004380128,0.0010957044,0.000031622247,0.000017681888,0.000057009514,0.0045300364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966679,0.00006584358,0.0006555585,0.00123795,0.0007624817,0.0006102548],"domain_scores_gemma":[0.9969595,0.00040137774,0.0005348572,0.001388255,0.0005653441,0.00015067107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011927629,0.00043659247,0.0006814352,0.0004950536,0.00017309922,0.0004351802,0.0027417114,0.0003583347,0.00004783695],"category_scores_gemma":[0.00009905507,0.00036913485,0.00013471607,0.00049667654,0.0003851812,0.00059883716,0.0006587881,0.00048635335,0.00014772809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012285874,0.00016859554,0.0010661794,0.00048642926,0.000050407674,0.000060958606,0.005314797,0.026859757,0.0009738287,0.32295328,0.00080280774,0.64125067],"study_design_scores_gemma":[0.0003969982,0.00025726436,0.00083841453,0.0005400525,0.000005787294,0.0000771717,7.534447e-7,0.9400718,0.0014544504,0.04834933,0.0071091657,0.0008987826],"about_ca_topic_score_codex":0.000053751228,"about_ca_topic_score_gemma":0.00014582965,"teacher_disagreement_score":0.91321206,"about_ca_system_score_codex":0.00017881871,"about_ca_system_score_gemma":0.00040614966,"threshold_uncertainty_score":0.9998761},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016197385,0.00019042307,0.99314094,0.0009345346,0.0004597885,0.00039363842,0.000005444598,0.00052170665,0.0041915644],"genre_scores_gemma":[0.6171244,0.00018816526,0.3691531,0.0116034215,0.00087832613,0.000023801134,0.000026183543,0.00009505866,0.0009075217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962804,0.000039835017,0.0004976648,0.0016867614,0.0009046156,0.00059076474],"domain_scores_gemma":[0.9978734,0.00026582004,0.0003094348,0.0011159142,0.00022471821,0.00021070852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058167626,0.0006006703,0.00054755463,0.00079460803,0.00029019156,0.00070753705,0.0026638478,0.00035094997,0.000011586573],"category_scores_gemma":[0.000060654245,0.000551425,0.00008859677,0.00040411102,0.00037172236,0.00048374012,0.00070091063,0.00082193234,0.000013727814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070039887,0.000031857522,0.00004679301,0.00004371893,0.000007470436,0.00007767225,0.000773819,0.06781996,0.000007777127,0.0008160033,0.000080593905,0.9302873],"study_design_scores_gemma":[0.00044799957,0.00064810953,0.00039442774,0.001027714,0.000007650723,0.000099048084,2.0501179e-7,0.92205405,0.0011279953,0.072468705,0.00061125576,0.0011128654],"about_ca_topic_score_codex":0.00001050176,"about_ca_topic_score_gemma":0.000018878889,"teacher_disagreement_score":0.9291745,"about_ca_system_score_codex":0.00013297376,"about_ca_system_score_gemma":0.00033025534,"threshold_uncertainty_score":0.99969375},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038435355,0.00055709935,0.9967839,0.00012434326,0.00095660676,0.0006892388,0.00001324905,0.00022172366,0.00061541394],"genre_scores_gemma":[0.0059518707,0.000034449535,0.9930877,0.0004092579,0.00026687936,0.000028035913,0.00000400632,0.00008747976,0.00013030795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811804,0.000030089106,0.00040270836,0.0005601828,0.00035972413,0.00052928197],"domain_scores_gemma":[0.99838823,0.0007507167,0.000105498766,0.0005125693,0.00016792526,0.00007508843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092482276,0.00035643767,0.00030386032,0.00021844372,0.0002570154,0.00021184796,0.0007277642,0.0001518173,0.000012247306],"category_scores_gemma":[0.000092471375,0.0002951481,0.00009029913,0.0002677919,0.00027415148,0.00009388556,0.000102454214,0.0005333789,0.000006303431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.617697e-7,0.000001651663,0.0000028778995,0.00001598889,0.000008532817,0.0000032481016,0.00012817208,0.5796538,0.000045131976,0.00006957375,0.000014173556,0.4200565],"study_design_scores_gemma":[0.00019006526,0.000032864056,0.00001328393,0.00012760443,0.000017149314,0.00003810426,1.8482356e-7,0.9873408,0.0014621335,0.009488253,0.0009400947,0.0003494456],"about_ca_topic_score_codex":0.0000057008897,"about_ca_topic_score_gemma":0.0000037909156,"teacher_disagreement_score":0.41970706,"about_ca_system_score_codex":0.00021607398,"about_ca_system_score_gemma":0.00009467599,"threshold_uncertainty_score":0.99995005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067752687,0.00047242435,0.9957068,0.00020982834,0.00037094112,0.00016253265,0.0000047707636,0.000134012,0.002261194],"genre_scores_gemma":[0.8929893,0.0001336002,0.10633572,0.00017974249,0.0001055063,0.000005249183,0.000013091225,0.000023749662,0.00021408687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956818,0.000083257735,0.00074209773,0.0016210468,0.001209235,0.0006625363],"domain_scores_gemma":[0.9974827,0.00046619264,0.00042415518,0.0012516825,0.00016574783,0.0002095259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061001466,0.0006057329,0.0011130904,0.0017518776,0.00022373647,0.00021718128,0.0031098884,0.0003975585,0.000019990573],"category_scores_gemma":[0.000046380843,0.0005190063,0.00039007593,0.0015247989,0.0011302764,0.00030177477,0.000921585,0.0011458541,0.00000774615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059747886,0.00005989019,0.00019659032,0.000030374453,0.00013481699,0.00003864267,0.0011337306,0.30098906,0.000023697155,0.0056482814,0.000007937748,0.691731],"study_design_scores_gemma":[0.00015703274,0.00013833841,0.0007344645,0.00015021044,0.000096903925,0.000029677482,4.2683234e-7,0.9869954,0.0004250936,0.010631649,0.000085849475,0.0005549812],"about_ca_topic_score_codex":0.00003131494,"about_ca_topic_score_gemma":0.000057830934,"teacher_disagreement_score":0.89231175,"about_ca_system_score_codex":0.00019758506,"about_ca_system_score_gemma":0.00034811688,"threshold_uncertainty_score":0.9997262},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006128901,0.0007893209,0.99501586,0.0007097973,0.001803085,0.00118491,0.000012524824,0.00032435593,0.000098847704],"genre_scores_gemma":[0.0121515235,0.000054763845,0.98608464,0.00040852142,0.0005686021,0.00007778868,0.000009285454,0.00005365244,0.00059122726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99398327,0.00008504208,0.00081053056,0.0022494493,0.0016741483,0.0011975822],"domain_scores_gemma":[0.98878473,0.0072867866,0.00031128532,0.002508646,0.00073814555,0.00037040943],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0033643052,0.00064464804,0.0008803011,0.0013578171,0.00086786225,0.0015751082,0.006011626,0.00061308045,0.000013951179],"category_scores_gemma":[0.0025890938,0.00053820247,0.0003741461,0.0010223354,0.00085892563,0.00058622693,0.0017760433,0.0018200693,0.000047494825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016956981,0.000037335725,0.00005655036,0.000086691245,0.000027496908,0.00003546459,0.0003273666,0.25085735,0.0002946323,0.0039771027,0.000045821624,0.74423724],"study_design_scores_gemma":[0.0003297709,0.0002985767,0.000048841455,0.00077089,0.000020050564,0.00012352904,1.6381979e-7,0.8190363,0.0008764659,0.17261256,0.004994324,0.0008885312],"about_ca_topic_score_codex":0.00007342652,"about_ca_topic_score_gemma":0.000060702365,"teacher_disagreement_score":0.7433487,"about_ca_system_score_codex":0.0003298608,"about_ca_system_score_gemma":0.0012140477,"threshold_uncertainty_score":0.9997069},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014518561,0.0003409832,0.9953491,0.00014750934,0.0021058603,0.0012607201,0.000018929943,0.00014750924,0.00048418864],"genre_scores_gemma":[0.6071341,0.000026947799,0.3895678,0.00034432832,0.00133031,0.00009672484,0.00003373935,0.000082573315,0.0013835229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628544,0.00002909565,0.000604976,0.001473132,0.0009735899,0.0006337498],"domain_scores_gemma":[0.9977513,0.00024810553,0.0004514381,0.0011207568,0.00029476598,0.00013363808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006282033,0.0005206532,0.00055641786,0.0005655706,0.00028081742,0.0007525945,0.001850135,0.00025465435,0.000002862138],"category_scores_gemma":[0.000007676593,0.00041321703,0.00012977842,0.0002530603,0.00011615492,0.00049857475,0.00030017257,0.0003379357,0.000012675265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005787091,0.000022362183,0.00009117845,0.00015930823,0.000012802854,0.000027115293,0.0002779772,0.9642312,0.000025315116,0.008887865,0.000046006913,0.026213067],"study_design_scores_gemma":[0.00037775462,0.00018616903,0.000034201963,0.0006947496,0.000010511155,0.000040158215,1.6867374e-7,0.99319,0.0001879279,0.003117787,0.00161721,0.0005433914],"about_ca_topic_score_codex":0.00024394525,"about_ca_topic_score_gemma":0.00009860845,"teacher_disagreement_score":0.6069889,"about_ca_system_score_codex":0.00035839796,"about_ca_system_score_gemma":0.0002693227,"threshold_uncertainty_score":0.999832},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007598605,0.001386369,0.99002606,0.00008153049,0.007055454,0.00084635895,0.000014203325,0.00052629615,0.000056130735],"genre_scores_gemma":[0.0014857207,0.00003609478,0.9974166,0.0002935002,0.00024178666,0.00006530679,0.0000044863805,0.00006552389,0.0003909359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960565,0.000035944704,0.00060036953,0.0015724748,0.00071009796,0.0010245886],"domain_scores_gemma":[0.9968202,0.0010414047,0.0002477596,0.0014638617,0.0002464403,0.00018031051],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017551995,0.00063327845,0.0006770584,0.0006757845,0.00019506617,0.00035516135,0.0026787682,0.00034038784,0.0000019587856],"category_scores_gemma":[0.00061239226,0.00062302535,0.00016125338,0.00042804095,0.00012538255,0.00056175597,0.0008508398,0.0005799301,0.000011261196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020275843,0.000021347465,0.000011373003,0.00014752561,0.000015067536,0.000023837392,0.0003402214,0.9632999,0.00023107963,0.007144779,0.00002212784,0.028740713],"study_design_scores_gemma":[0.0004957594,0.00012283739,0.00002199186,0.00046455246,0.000009116471,0.000039962102,2.8447548e-7,0.976966,0.0010823128,0.011494858,0.008424756,0.00087756355],"about_ca_topic_score_codex":0.00000239016,"about_ca_topic_score_gemma":0.0000043218633,"teacher_disagreement_score":0.02786315,"about_ca_system_score_codex":0.00054470706,"about_ca_system_score_gemma":0.00017065059,"threshold_uncertainty_score":0.9996221},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026628035,0.000092880655,0.9892133,0.00033973574,0.0014341959,0.00064047426,0.0000024414946,0.00059061905,0.007659746],"genre_scores_gemma":[0.019032668,0.00007205443,0.9780561,0.00035833914,0.00021224182,0.000024388237,0.000003979946,0.000049947746,0.002190292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958598,0.000071903014,0.00057818467,0.0017488316,0.00091243495,0.0008288207],"domain_scores_gemma":[0.99653596,0.0012953336,0.00015704216,0.0015694356,0.00019514626,0.00024708756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014475218,0.000617078,0.0005241112,0.0011706692,0.0002908853,0.0004415195,0.0035230243,0.00029667476,0.000027723454],"category_scores_gemma":[0.00029055032,0.0004894745,0.00010930184,0.0010662134,0.0003417331,0.00061129074,0.0017038857,0.0012381066,0.00013676156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004483797,0.000010200595,0.000001954268,0.000026985615,0.000008894404,0.000096299205,0.0007328911,0.8180416,0.000008502346,0.017353935,0.00001624513,0.163698],"study_design_scores_gemma":[0.00011903405,0.00022416865,0.0000033067065,0.000253542,0.000007698602,0.000065687294,9.66282e-7,0.66121304,0.00016377785,0.3339597,0.0032384715,0.0007506218],"about_ca_topic_score_codex":0.0000067650512,"about_ca_topic_score_gemma":0.000011160229,"teacher_disagreement_score":0.31660575,"about_ca_system_score_codex":0.0005188747,"about_ca_system_score_gemma":0.00028833383,"threshold_uncertainty_score":0.9997557},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013562512,0.00012252528,0.9868825,0.0033345295,0.00018911457,0.004887021,0.000016706092,0.000028662924,0.003182661],"genre_scores_gemma":[0.85511994,0.000056050005,0.13583387,0.0069255014,0.0004273442,0.0015262647,0.000042462998,0.00003622278,0.000032320953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968237,0.00012708397,0.00054671615,0.00095095555,0.0011354036,0.00041611274],"domain_scores_gemma":[0.9968514,0.0008997995,0.00039663358,0.0016543912,0.00014237594,0.00005541008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002804329,0.0003387402,0.00031259915,0.00046902624,0.00021788637,0.0006434584,0.0034356774,0.0001571129,0.000012614406],"category_scores_gemma":[0.00013238622,0.00020256608,0.00008516746,0.0008877746,0.0007285137,0.00053532585,0.0007663562,0.0006274566,0.0000034247246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007472343,0.00011774653,0.0020672362,0.000058520247,0.000007044399,0.000021787198,0.0016744242,0.0013110463,0.000030875213,0.92304194,0.00034077698,0.07132114],"study_design_scores_gemma":[0.00044708097,0.00039915158,0.005624457,0.00057321094,0.0000058143924,0.00002635645,0.0000014315114,0.042719018,0.0008210904,0.9439051,0.004917335,0.00055993634],"about_ca_topic_score_codex":0.00004633267,"about_ca_topic_score_gemma":0.00035412202,"teacher_disagreement_score":0.8537637,"about_ca_system_score_codex":0.00007197098,"about_ca_system_score_gemma":0.00020133556,"threshold_uncertainty_score":0.8260405},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013979496,0.00069198606,0.9931392,0.0012470094,0.0019574645,0.0011015666,0.000014519381,0.00052057375,0.0013137183],"genre_scores_gemma":[0.10809586,0.000017276803,0.88879925,0.0015140686,0.0006480152,0.00007222865,0.0000116263745,0.000055230594,0.00078642264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957088,0.000029185276,0.00065793615,0.0017773665,0.00079135544,0.0010353347],"domain_scores_gemma":[0.9968034,0.0009199184,0.00033472912,0.001289394,0.0004406194,0.00021192909],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009472757,0.00065232045,0.0007351909,0.0005591832,0.0004342456,0.0006628013,0.002838933,0.0004166587,0.000008859669],"category_scores_gemma":[0.00007134354,0.0006231175,0.00024665444,0.0004570636,0.00035392883,0.000523512,0.0004475573,0.00074792805,0.00003718336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000185807,0.0000514959,0.000015005603,0.000058286925,0.00003260551,0.000047062877,0.00013175982,0.31377408,0.000047498877,0.014634657,0.00021176576,0.6709772],"study_design_scores_gemma":[0.0013547527,0.00017106389,0.000011863157,0.00024862294,0.0000230026,0.000037394282,6.35879e-8,0.9698816,0.000017554412,0.017025659,0.010556651,0.0006717826],"about_ca_topic_score_codex":0.000009700518,"about_ca_topic_score_gemma":0.000056765246,"teacher_disagreement_score":0.67030543,"about_ca_system_score_codex":0.00038194045,"about_ca_system_score_gemma":0.0006457614,"threshold_uncertainty_score":0.999622},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016622985,0.00042709772,0.97854024,0.0005622712,0.00023709443,0.002133724,0.00007547915,0.000037225815,0.0013638777],"genre_scores_gemma":[0.9225451,0.000034606615,0.07276054,0.004008708,0.00035771943,0.00005165694,0.00002050618,0.000070749695,0.00015042118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975401,0.000022498745,0.0004435827,0.00053953385,0.0011370911,0.00031719074],"domain_scores_gemma":[0.9974419,0.00015296163,0.00024901726,0.0012113696,0.0008225563,0.00012219489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068427506,0.00025147945,0.0004898476,0.0004310293,0.000120697616,0.0000205129,0.0009373815,0.0002249722,0.000013492759],"category_scores_gemma":[0.0002954375,0.00017092748,0.00009709912,0.00051851285,0.0009984963,0.00007207617,0.00064380164,0.00072101195,0.00000464031],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029711926,0.00019743624,0.012585497,0.00068120105,0.00013269094,0.000008484502,0.0045564068,0.01968811,0.10361147,0.004228327,0.000012930816,0.85400033],"study_design_scores_gemma":[0.0056611793,0.005072617,0.06592552,0.0049025984,0.0004361859,0.00012106435,0.000022029146,0.5747955,0.21606283,0.099125035,0.025004905,0.002870559],"about_ca_topic_score_codex":0.00009048943,"about_ca_topic_score_gemma":0.0008148638,"teacher_disagreement_score":0.9059221,"about_ca_system_score_codex":0.00026891992,"about_ca_system_score_gemma":0.0005389947,"threshold_uncertainty_score":0.697022},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028653856,0.00025033858,0.9964301,0.00011249983,0.0007459184,0.0006224897,0.000012774968,0.00001568977,0.001523635],"genre_scores_gemma":[0.037079666,0.00004423076,0.9592938,0.0014354126,0.0012548881,0.000019167901,0.000046029218,0.00006006892,0.0007667557],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99769664,0.000031148193,0.00029452858,0.0010176837,0.00044164193,0.00051834906],"domain_scores_gemma":[0.9986384,0.00019957704,0.000126333,0.0006416758,0.00027223214,0.000121772326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018174163,0.00034987237,0.00031601836,0.00029417285,0.0002268668,0.00008694849,0.0008333295,0.0005174394,0.000020480426],"category_scores_gemma":[0.00011260129,0.0003187779,0.00017157925,0.000115642164,0.00018285334,0.0000055748674,0.00038383773,0.00025254601,0.000011958988],"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.000060332408,0.000010400787,0.0000029015807,0.000048344053,0.00000871919,0.000008358556,0.000028181033,0.004114329,0.73691785,0.00009949516,0.000009666102,0.25869143],"study_design_scores_gemma":[0.0002827006,0.00036375388,0.0000066196217,0.00015376066,0.000009220907,0.0000112267535,9.150167e-8,0.06828125,0.9240271,0.0031882839,0.0032878127,0.0003881998],"about_ca_topic_score_codex":0.000010713995,"about_ca_topic_score_gemma":0.000013686795,"teacher_disagreement_score":0.25830323,"about_ca_system_score_codex":0.00007103071,"about_ca_system_score_gemma":0.00035238639,"threshold_uncertainty_score":0.99992645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003190557,0.00023406756,0.9972576,0.00017557485,0.00068712584,0.0007063217,0.000044092336,0.0003313006,0.00053204043],"genre_scores_gemma":[0.041481994,0.00006428599,0.95776165,0.00028358263,0.00019135355,0.000062256106,0.00001974934,0.000039738872,0.000095373456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964007,0.0000116827905,0.0006412628,0.0011265938,0.0011164336,0.00070331566],"domain_scores_gemma":[0.99748874,0.00021754164,0.00032589526,0.0012444011,0.0005976566,0.00012577292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074636884,0.0005027887,0.0006299004,0.00082199706,0.00018711222,0.00019928765,0.0032728175,0.0003372896,0.000006723327],"category_scores_gemma":[0.000023837183,0.0004921338,0.00021066456,0.00043732722,0.00043690004,0.0016239189,0.0011894514,0.0004437111,0.000003058302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001112658,0.000031076455,0.0000066420876,0.00009048685,0.000015594793,0.000013377412,0.000858725,0.32034948,0.000038211303,0.19655968,0.00012638798,0.48189917],"study_design_scores_gemma":[0.00020348493,0.00016366022,0.000012596786,0.00021545425,0.0000052664627,0.000054613047,2.2939759e-8,0.8466834,0.0012836666,0.14590602,0.0050281635,0.00044364744],"about_ca_topic_score_codex":0.000037029033,"about_ca_topic_score_gemma":0.000016687089,"teacher_disagreement_score":0.5263339,"about_ca_system_score_codex":0.000361028,"about_ca_system_score_gemma":0.0010591653,"threshold_uncertainty_score":0.99975306},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046354556,0.00017635645,0.99598277,0.0011178046,0.0006897998,0.00037098353,0.000010149294,0.00016032363,0.0010282882],"genre_scores_gemma":[0.66268414,0.00009751327,0.336402,0.0004478754,0.00016159442,0.000009209654,0.00003011203,0.000026125854,0.00014144581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968174,0.00005068568,0.00050641864,0.00119353,0.0008115775,0.0006203753],"domain_scores_gemma":[0.99857503,0.00020127781,0.00014617693,0.00072858366,0.00019279425,0.00015613149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047564646,0.00038870072,0.00039539443,0.0009552788,0.00017208756,0.0005063077,0.0014283567,0.0003234909,0.00007724908],"category_scores_gemma":[0.00003726585,0.00040697595,0.00009179725,0.0016112891,0.00038050202,0.00074988295,0.00029972143,0.00093252526,0.000043036856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004696603,0.000022370898,0.0009989578,0.000016363043,0.0000041865824,0.000053291325,0.00053300033,0.6891862,0.000046396253,0.0035982504,0.0000029957575,0.3055333],"study_design_scores_gemma":[0.00038168253,0.000057965735,0.003974921,0.00060612307,0.0000044766734,0.00002881006,2.771642e-7,0.9870034,0.0002652032,0.0070607136,0.00013765045,0.0004788154],"about_ca_topic_score_codex":0.000022766271,"about_ca_topic_score_gemma":0.00014151253,"teacher_disagreement_score":0.6622206,"about_ca_system_score_codex":0.00047993177,"about_ca_system_score_gemma":0.00029156313,"threshold_uncertainty_score":0.99983823},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050515024,0.00016350138,0.9886376,0.0016389071,0.0021804718,0.00034930793,0.0000028794875,0.00019109072,0.0063310554],"genre_scores_gemma":[0.85816526,0.00005896157,0.12758811,0.0029045346,0.0012108892,0.00003228483,0.000029010696,0.000084597836,0.009926363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631125,0.000059467606,0.00040258965,0.0014523494,0.0010995778,0.00067479664],"domain_scores_gemma":[0.9985524,0.00017528964,0.00014055493,0.00076774147,0.00022615466,0.00013789437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008300449,0.00043672646,0.00041848677,0.0016641499,0.00026924265,0.0005430482,0.0017157886,0.0004171055,0.00002652954],"category_scores_gemma":[0.000036874542,0.00041386602,0.00014326672,0.0013815984,0.00046069865,0.0006416138,0.00072272186,0.0012784222,0.00010889397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016262144,0.00020466422,0.0007421077,0.000070609945,0.000013240058,0.00027664282,0.0006292925,0.08224201,0.0008735637,0.03156859,0.0005599602,0.882803],"study_design_scores_gemma":[0.00065730506,0.00042579757,0.0035472547,0.00037032616,0.000006353469,0.00014790421,5.0668734e-7,0.9463569,0.001472812,0.039445497,0.006535879,0.0010334974],"about_ca_topic_score_codex":0.00008437419,"about_ca_topic_score_gemma":0.00042440972,"teacher_disagreement_score":0.88176954,"about_ca_system_score_codex":0.00044593756,"about_ca_system_score_gemma":0.00042649498,"threshold_uncertainty_score":0.9998313},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013262655,0.00032299143,0.98642343,0.00016812618,0.0019249455,0.0002628246,0.0000027679653,0.00043427295,0.009134377],"genre_scores_gemma":[0.76371944,0.000029160721,0.23557347,0.00034277412,0.0001814346,0.000005069971,6.7395587e-7,0.000022770415,0.0001252226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996795,0.000038179016,0.0005871972,0.0012866725,0.00068107503,0.000611853],"domain_scores_gemma":[0.99754024,0.00025839516,0.00038334145,0.0015097894,0.00020588806,0.00010232815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078844326,0.00046175806,0.0007157453,0.0007103924,0.00030956627,0.00012008892,0.0035620441,0.00048833794,0.00002106379],"category_scores_gemma":[0.000058226382,0.000406968,0.00015522979,0.00053851167,0.0008485361,0.0002937041,0.002217782,0.0007475125,0.000046847166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008020097,0.00011599878,0.000240282,0.00026720096,0.000111336296,0.00029512434,0.012673769,0.00046795068,0.00009361183,0.60077727,0.00008545685,0.38486397],"study_design_scores_gemma":[0.001386534,0.0010811795,0.0025041052,0.0025084396,0.000113857,0.0007533924,0.0000053561153,0.3032932,0.004173789,0.6724884,0.008657957,0.0030337903],"about_ca_topic_score_codex":0.000023005929,"about_ca_topic_score_gemma":0.000048358797,"teacher_disagreement_score":0.7623932,"about_ca_system_score_codex":0.00027808498,"about_ca_system_score_gemma":0.00040827345,"threshold_uncertainty_score":0.99983823},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009925248,0.0007471481,0.8404763,0.00034528048,0.00037435803,0.00011824584,0.000036226495,0.00002363043,0.15777956],"genre_scores_gemma":[0.87185055,0.00013683694,0.12488977,0.0014817705,0.0002502141,0.0000031932348,0.000039707833,0.000029890381,0.0013180801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806523,0.000008269308,0.0007312409,0.0007471664,0.00018033656,0.00026776775],"domain_scores_gemma":[0.99867654,0.00017231463,0.0005066398,0.00043809303,0.000119431425,0.00008698342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005868039,0.00024981523,0.0006163624,0.0009865614,0.000082518505,0.000072915616,0.00066482055,0.00015145444,0.0008150559],"category_scores_gemma":[0.00006765212,0.00028179176,0.00019006686,0.00043159298,0.0002867398,0.000136079,0.00012710759,0.00029968433,0.00013333024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010565985,0.00008544257,0.0005497864,0.00004964594,0.000050770046,0.000019186946,0.00030373424,0.21457754,0.000005896228,0.6564934,0.00006099793,0.12779301],"study_design_scores_gemma":[0.00018834192,0.0000547175,0.0015104618,0.000077796256,0.0000049912023,0.0000062371223,9.1098045e-8,0.2815236,0.000036862744,0.71329767,0.0029959304,0.00030329704],"about_ca_topic_score_codex":0.000025348878,"about_ca_topic_score_gemma":0.000017609418,"teacher_disagreement_score":0.8717513,"about_ca_system_score_codex":0.00014761118,"about_ca_system_score_gemma":0.00011230126,"threshold_uncertainty_score":0.9999634},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000421766,0.00028143247,0.9694626,0.0013118846,0.0011443177,0.00037406478,0.0000064575274,0.00084989646,0.026527207],"genre_scores_gemma":[0.5026529,0.000043194024,0.4925703,0.0012232865,0.00051624567,0.0000313978,0.000015420062,0.00005695195,0.0028903338],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954786,0.000037787708,0.0005936783,0.0020356493,0.0010885664,0.00076575414],"domain_scores_gemma":[0.9963507,0.0002684005,0.00039532714,0.002551679,0.00026845446,0.00016541906],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00056959316,0.00063172646,0.00052511,0.0012058673,0.00033657093,0.0009380479,0.005745717,0.000577151,0.000031602405],"category_scores_gemma":[0.000044373894,0.0005654111,0.00014100461,0.00085012,0.0012471572,0.00141952,0.0011240406,0.0009634643,0.00016801969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049649743,0.000047968566,0.00004471526,0.000008078979,0.000006588897,0.000039357008,0.00014778001,0.0035563393,0.00021033955,0.26889744,0.0003796597,0.72665673],"study_design_scores_gemma":[0.00032712365,0.0005323384,0.0006482145,0.00016848264,0.000009801549,0.00004037297,7.996302e-7,0.3007243,0.0027240878,0.6832099,0.010389821,0.0012247985],"about_ca_topic_score_codex":0.000033133318,"about_ca_topic_score_gemma":0.000075230724,"teacher_disagreement_score":0.725432,"about_ca_system_score_codex":0.00039601422,"about_ca_system_score_gemma":0.0004980288,"threshold_uncertainty_score":0.99967974},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007216675,0.00045607006,0.99549836,0.00008108847,0.0009993766,0.00046811413,0.000009252203,0.0003129229,0.0021026202],"genre_scores_gemma":[0.12395885,0.0001301102,0.87459606,0.00089519436,0.00026279112,0.00000888427,0.00002996473,0.000045573113,0.00007256598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580085,0.000045477253,0.0009374543,0.0013582682,0.0012437197,0.00061424734],"domain_scores_gemma":[0.9965698,0.00043073532,0.000603926,0.001562041,0.0006586828,0.00017478861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016387887,0.0005356971,0.0006746939,0.0018816494,0.00021178141,0.00039245535,0.003237169,0.00040034048,0.000017252474],"category_scores_gemma":[0.000036764242,0.0005329182,0.00020876217,0.0021771349,0.00064999785,0.0006020755,0.001196669,0.00060115784,0.0000056875615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004385668,0.00005442154,0.0003776521,0.00006917721,0.000019343212,0.000021116908,0.00034788973,0.0038942674,0.00008018823,0.7685467,0.000042326184,0.22654255],"study_design_scores_gemma":[0.00024186666,0.00024944425,0.0002991339,0.00044734127,0.000009906222,0.00003335432,9.8024145e-8,0.5519058,0.0029919862,0.44091246,0.0022732592,0.0006353583],"about_ca_topic_score_codex":0.00008688617,"about_ca_topic_score_gemma":0.000062032406,"teacher_disagreement_score":0.54801154,"about_ca_system_score_codex":0.00013390879,"about_ca_system_score_gemma":0.00043540655,"threshold_uncertainty_score":0.9997122},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055761775,0.00011300612,0.989358,0.0018131707,0.0014303852,0.0010139844,0.000045631088,0.00018553203,0.005482681],"genre_scores_gemma":[0.95267385,0.000005735876,0.036877517,0.009488459,0.0008506342,0.000022117534,0.00001625874,0.000050744755,0.000014705401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99488103,0.000100398225,0.00061254465,0.0012592048,0.002088976,0.001057851],"domain_scores_gemma":[0.9972313,0.0006695983,0.0003947573,0.0006520004,0.00053913315,0.0005131783],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016240521,0.0005529189,0.0007224028,0.001645673,0.0009436477,0.0014591772,0.0033393446,0.000504649,0.00044213017],"category_scores_gemma":[0.00032953508,0.00053415215,0.00029368483,0.00158448,0.0016293876,0.001111344,0.0002867466,0.00068844814,0.0000569037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023627761,0.00023944982,0.010943099,0.00013079886,0.0000999308,0.00041873154,0.0024039727,0.6759341,0.00040527777,0.09677277,0.000026370883,0.21238926],"study_design_scores_gemma":[0.010662747,0.0010311076,0.005797894,0.0023959775,0.00040560524,0.000008947954,0.000007802605,0.23078386,0.0014529901,0.72268313,0.018784389,0.0059855594],"about_ca_topic_score_codex":0.0020123005,"about_ca_topic_score_gemma":0.0060948464,"teacher_disagreement_score":0.9524805,"about_ca_system_score_codex":0.00064095296,"about_ca_system_score_gemma":0.0039616614,"threshold_uncertainty_score":0.999711},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008509952,0.0015589208,0.9766941,0.0005259784,0.003904389,0.00048718965,0.000005408553,0.00026523488,0.01655027],"genre_scores_gemma":[0.90118796,0.000066740635,0.0877908,0.0015084115,0.0039741173,0.000043992197,0.00003529076,0.00006484686,0.005327816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99530745,0.000059774386,0.00071957154,0.0016660528,0.001415289,0.0008318839],"domain_scores_gemma":[0.9972262,0.00037802983,0.0003698263,0.0014223479,0.0003222646,0.00028136646],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011209325,0.000557983,0.0006568743,0.0006118007,0.00030895678,0.0010399699,0.003440958,0.00048361623,0.00003500998],"category_scores_gemma":[0.00006142614,0.00048235856,0.00017834334,0.00045692557,0.0007521436,0.0006037184,0.0009837183,0.0008803338,0.0002716033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028428317,0.000032092055,0.0000555896,0.00005315942,0.000017971688,0.00017644372,0.00025561854,0.010713438,0.000018731333,0.8234208,0.00018275197,0.16507055],"study_design_scores_gemma":[0.0006210501,0.00034758577,0.0001688765,0.00020342773,0.000016987386,0.00088734226,3.28386e-7,0.41238675,0.00013521187,0.41861945,0.16503562,0.0015773647],"about_ca_topic_score_codex":0.000093164104,"about_ca_topic_score_gemma":0.00012812729,"teacher_disagreement_score":0.9011795,"about_ca_system_score_codex":0.00049525156,"about_ca_system_score_gemma":0.0009701016,"threshold_uncertainty_score":0.999997},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000447012,0.00021984518,0.98718745,0.00014491021,0.0017166813,0.00050849735,0.0000064272076,0.00017817655,0.009993322],"genre_scores_gemma":[0.005106737,0.000046033827,0.9935625,0.00031796336,0.0005060507,0.0000067056276,0.00000470849,0.000041246025,0.00040801833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958649,0.000102207356,0.0007838098,0.0015504909,0.0009627668,0.0007357827],"domain_scores_gemma":[0.9941357,0.0032131616,0.0006481021,0.0013695788,0.00048887066,0.00014462422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005964385,0.0004987533,0.0008053684,0.0011117221,0.0002129384,0.0002411754,0.0022995805,0.00044869728,0.0000123402415],"category_scores_gemma":[0.00040577917,0.00047779057,0.00027042214,0.00075751846,0.00031395056,0.0006341851,0.0005701547,0.00058877503,0.000014314613],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021056105,0.000025182342,0.000020620499,0.000092592025,0.000017597973,0.00007171928,0.00045506225,0.011221672,0.0071780817,0.0112062525,0.000010741925,0.9696794],"study_design_scores_gemma":[0.00044921742,0.00033145092,0.0003285275,0.0005749646,0.000018957608,0.00033900584,2.7452793e-7,0.7558013,0.022216465,0.21799874,0.0010939371,0.0008471479],"about_ca_topic_score_codex":0.00009191843,"about_ca_topic_score_gemma":0.00009582352,"teacher_disagreement_score":0.96883225,"about_ca_system_score_codex":0.0002445019,"about_ca_system_score_gemma":0.00054955255,"threshold_uncertainty_score":0.99976736},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020949552,0.00029964148,0.9648706,0.0019036024,0.0035919792,0.002326055,0.000029667477,0.0013527393,0.0046761883],"genre_scores_gemma":[0.9587881,0.0000129160335,0.038594782,0.00046095066,0.00070675416,0.00003344529,0.000011461551,0.000056316418,0.001335255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952293,0.000087749875,0.00068346644,0.0016066445,0.0011354336,0.0012574011],"domain_scores_gemma":[0.9970778,0.0008025619,0.00055622234,0.0009185332,0.00036964053,0.00027522698],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0024061904,0.0005049851,0.0007125232,0.00074908586,0.0014637881,0.00038528745,0.0020981515,0.00081703876,0.000041287687],"category_scores_gemma":[0.00039794503,0.0005056872,0.00019413185,0.000591104,0.0010011189,0.00046772006,0.0005295463,0.00060074445,0.000024427489],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020541444,0.0001211935,0.002430067,0.00025604756,0.000030211979,0.00008707154,0.03650336,0.0016210136,0.00043137936,0.012319014,0.00008792975,0.9460922],"study_design_scores_gemma":[0.010475782,0.007439703,0.16029738,0.04064405,0.0010576881,0.001681408,0.0012271611,0.4155425,0.013890208,0.24980539,0.07053945,0.02739926],"about_ca_topic_score_codex":0.00029629463,"about_ca_topic_score_gemma":0.013955544,"teacher_disagreement_score":0.93783855,"about_ca_system_score_codex":0.0016024249,"about_ca_system_score_gemma":0.00072153076,"threshold_uncertainty_score":0.99983615},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006262096,0.0010140294,0.9921645,0.0004874096,0.00020458519,0.0003416598,0.000003478054,0.00014145726,0.0050166496],"genre_scores_gemma":[0.8347348,0.0011808005,0.16302285,0.0005176554,0.00030196353,0.000020759724,0.000036904927,0.000058750495,0.00012549317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872494,0.000031018146,0.00036181655,0.00028791695,0.00034681393,0.0002474733],"domain_scores_gemma":[0.9989272,0.00024081365,0.00010183324,0.00062062393,0.000048144895,0.00006143659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005913775,0.000251133,0.00023358177,0.00041735705,0.0001161555,0.0002293073,0.0006647186,0.00023514789,0.0000197129],"category_scores_gemma":[0.000024141276,0.00022343862,0.000033291406,0.0002729956,0.0001624987,0.0004959956,0.00017424824,0.0007794636,0.000005544091],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022058848,0.000005207536,0.00016271914,0.00008475596,0.000010011644,0.0000035103812,0.0030455708,0.011768348,0.00035173658,0.0072720493,0.00015425992,0.97713965],"study_design_scores_gemma":[0.00058509025,0.00012774854,0.001701494,0.0013248861,0.000029963727,0.00008376551,0.0000035711166,0.492074,0.012584914,0.43951696,0.050573997,0.0013936177],"about_ca_topic_score_codex":0.000045936747,"about_ca_topic_score_gemma":0.00033720274,"teacher_disagreement_score":0.97574604,"about_ca_system_score_codex":0.00029543025,"about_ca_system_score_gemma":0.000057263383,"threshold_uncertainty_score":0.91115624},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004865021,0.00020045697,0.99372727,0.0011700632,0.0011613208,0.000695531,0.0000019283707,0.0000693831,0.002925393],"genre_scores_gemma":[0.92442876,0.0000073727374,0.07389252,0.00088315335,0.00042424322,0.000029920095,0.000004275016,0.000020887885,0.00030885314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997654,0.00003654149,0.00045893187,0.0008231493,0.00064474455,0.0003826299],"domain_scores_gemma":[0.99706477,0.0010205181,0.00037920888,0.0012014556,0.00027412685,0.00005989198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013251312,0.00029717668,0.000376833,0.00032271593,0.0002679701,0.00025184758,0.0029255715,0.00017666261,0.0000073488636],"category_scores_gemma":[0.00011635203,0.00020074697,0.00014418257,0.00033026293,0.00044957423,0.00021745505,0.00034446333,0.0003059141,0.000015635866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033049248,0.000015695437,0.000005664003,0.00002998328,0.0000060337084,0.0000017345365,0.00046450403,0.005136493,0.00012391323,0.7323733,0.000020502355,0.2618189],"study_design_scores_gemma":[0.00025758563,0.00030437988,0.000060557046,0.0001222913,0.000007946284,0.000019410545,5.549626e-7,0.3307983,0.0023680853,0.65519476,0.010411224,0.00045490058],"about_ca_topic_score_codex":0.000014225505,"about_ca_topic_score_gemma":0.000027199912,"teacher_disagreement_score":0.9243801,"about_ca_system_score_codex":0.00012389124,"about_ca_system_score_gemma":0.00021906091,"threshold_uncertainty_score":0.8186224},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037342045,0.000018572007,0.9531485,0.008336747,0.00038713525,0.0006054887,0.0000040839864,0.00014690436,0.000010539526],"genre_scores_gemma":[0.5095579,3.7896712e-7,0.4888889,0.0012927131,0.00021022056,0.000040314095,0.0000025972422,0.0000058904366,0.0000010644932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971928,0.00015010097,0.00048813887,0.0009830376,0.0005721809,0.00061371294],"domain_scores_gemma":[0.9974405,0.0010601404,0.00016321205,0.00074978656,0.0003578703,0.00022846779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00282739,0.00024181658,0.00033790423,0.00066147756,0.00040120748,0.0007107036,0.0016948594,0.000081808306,0.000004955641],"category_scores_gemma":[0.00019081686,0.0002196878,0.0000894523,0.0021292812,0.00012841754,0.0008410454,0.00060586905,0.00016377249,0.00002068475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054718535,0.00009237721,0.000095500756,0.000008973285,0.0000039509423,7.338394e-7,0.0007622541,0.0698798,0.0070394883,0.0007211375,0.00011831033,0.921272],"study_design_scores_gemma":[0.00027352496,0.00025253478,0.007349085,0.000056458917,0.0000037223595,0.000018071938,4.8535367e-7,0.94871694,0.038044117,0.0041158726,0.0008844741,0.0002847266],"about_ca_topic_score_codex":0.00019370808,"about_ca_topic_score_gemma":0.00034969478,"teacher_disagreement_score":0.92098725,"about_ca_system_score_codex":0.0002889433,"about_ca_system_score_gemma":0.00026671478,"threshold_uncertainty_score":0.8958609},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20588809,0.0002091608,0.79254764,0.0009413595,0.000092824834,0.00022767551,0.0000011247287,0.000085278676,0.0000068494164],"genre_scores_gemma":[0.64510894,0.0000047880035,0.35402545,0.0006776322,0.00016577364,0.000005904548,0.0000016037136,0.000008878696,0.0000010015315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990386,0.0000104829505,0.000121683304,0.00032537902,0.0001399832,0.0003639053],"domain_scores_gemma":[0.99943537,0.00013990734,0.00005101347,0.00021072333,0.000057835197,0.000105144216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019263555,0.00011473371,0.00014231695,0.00013550208,0.00022309732,0.000058895417,0.00013256024,0.000027510394,0.000002462929],"category_scores_gemma":[0.00012887381,0.00009785662,0.000021525966,0.000400102,0.00022563484,0.00023685076,0.00012807094,0.00024972096,5.087365e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013824854,0.000028306778,0.14321479,0.00004288954,0.0000020258663,0.0000040106297,0.0010196185,0.0046093226,0.087911725,0.00020133906,0.000013441697,0.7629387],"study_design_scores_gemma":[0.001177437,0.00017087109,0.06802886,0.00030603967,0.00003875438,0.00084851193,0.0000115271005,0.67955106,0.22534807,0.020656234,0.0033140196,0.0005485976],"about_ca_topic_score_codex":0.000004921712,"about_ca_topic_score_gemma":0.0000017038992,"teacher_disagreement_score":0.7623901,"about_ca_system_score_codex":0.00004735289,"about_ca_system_score_gemma":0.000033699587,"threshold_uncertainty_score":0.3990477},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012224203,0.0002789484,0.99554586,0.000007211372,0.000085134634,0.00020160941,0.0000026590303,0.00007725289,0.0025789218],"genre_scores_gemma":[0.80057,0.00005221773,0.19927189,0.00002706821,0.000044215452,0.000003788458,0.0000026272073,0.000018720813,0.000009479145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989343,0.000006687942,0.00032879726,0.000253619,0.00023099664,0.00024557332],"domain_scores_gemma":[0.99945664,0.00016617708,0.00006360179,0.00023015482,0.0000408084,0.000042602678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058963796,0.00019013617,0.00027149744,0.0005852088,0.000025746169,0.000031416123,0.00030069816,0.00020476914,0.000011544953],"category_scores_gemma":[0.000013992144,0.0001812821,0.00003031687,0.00019891642,0.00022630191,0.00015555722,0.00006407791,0.00028251123,0.0000017337305],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007787168,0.000017345486,0.00010499313,0.00029243276,0.000008988619,0.00002391443,0.00082877674,0.017005894,0.009996118,0.0069298465,0.000010418621,0.9647735],"study_design_scores_gemma":[0.00024399308,0.00021010637,0.0009353254,0.00086084346,0.000013222334,0.000045876677,6.11351e-7,0.7298267,0.1269465,0.14018025,0.00011698098,0.0006196016],"about_ca_topic_score_codex":0.0000041139742,"about_ca_topic_score_gemma":0.000019369772,"teacher_disagreement_score":0.9641539,"about_ca_system_score_codex":0.000078130346,"about_ca_system_score_gemma":0.000035526627,"threshold_uncertainty_score":0.7392469},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048014927,0.0017052969,0.99032485,0.0015422796,0.0008241737,0.00027152107,0.0000016091091,0.00006749392,0.00046129688],"genre_scores_gemma":[0.26079112,0.00044198055,0.7366769,0.0017364748,0.00016063116,0.0000059380895,7.453817e-7,0.000021262733,0.00016494926],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731123,0.000038038957,0.00056472135,0.00089250697,0.0006097431,0.00058377616],"domain_scores_gemma":[0.9960582,0.0026231445,0.00023159472,0.0008735295,0.00012396098,0.00008955139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012381513,0.00032369015,0.00045623237,0.00071395974,0.00019030123,0.00038954164,0.002521363,0.0003150393,7.7672206e-7],"category_scores_gemma":[0.00064936036,0.00022385613,0.000057151585,0.00045327723,0.001138035,0.00047230624,0.0016572253,0.0007387717,0.000003941771],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008909405,0.0000059097006,0.0017915177,0.000018255014,0.0000042577644,0.000040172938,0.00076121814,0.0032086773,0.000057542355,0.028867811,0.000013199382,0.96522254],"study_design_scores_gemma":[0.00077364116,0.0006498859,0.13232937,0.003245778,0.000022709675,0.00028337273,0.000007560678,0.32913032,0.0042052274,0.5126952,0.014459726,0.002197179],"about_ca_topic_score_codex":0.000119494776,"about_ca_topic_score_gemma":0.0010587146,"teacher_disagreement_score":0.96302533,"about_ca_system_score_codex":0.00012822862,"about_ca_system_score_gemma":0.0002235208,"threshold_uncertainty_score":0.9128588},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010517415,0.00013328884,0.9882919,0.002063827,0.0011935321,0.00036899385,0.000002912862,0.000062606894,0.007872397],"genre_scores_gemma":[0.09667568,0.0000780151,0.8931324,0.0021721383,0.0004928249,0.000014341093,0.0000049580417,0.00003860455,0.0073910244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974908,0.000040966406,0.00045958036,0.00075976865,0.0008750297,0.0003738103],"domain_scores_gemma":[0.99787205,0.00022319178,0.0002745943,0.0012417458,0.00029871552,0.00008967758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059493503,0.00027393093,0.0002835642,0.0004508121,0.0001692544,0.00038191714,0.0041377987,0.00017051071,0.00007485588],"category_scores_gemma":[0.00007083033,0.00020254683,0.00013422192,0.0006681726,0.00075502903,0.00054268807,0.0015627597,0.0005948917,0.00003861085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012802311,0.000034821613,0.00004412321,0.00002017619,0.000011889829,0.000004125491,0.0010710517,0.10395308,0.00004757451,0.12435331,0.00006831216,0.7703903],"study_design_scores_gemma":[0.00016713997,0.00006115574,0.00010095887,0.00021663368,0.0000037145155,0.000023999652,8.8100855e-8,0.926793,0.0005242486,0.064650476,0.007182809,0.00027582314],"about_ca_topic_score_codex":0.00002728036,"about_ca_topic_score_gemma":0.00011070228,"teacher_disagreement_score":0.82283986,"about_ca_system_score_codex":0.00023080918,"about_ca_system_score_gemma":0.0006202065,"threshold_uncertainty_score":0.82596195},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000103789025,0.00054784544,0.9514596,0.00029346356,0.001445441,0.00031611818,0.0000017419311,0.00029910618,0.045626335],"genre_scores_gemma":[0.075124845,0.00008140388,0.9222163,0.0015048726,0.0006216024,0.0000064757105,0.0000044069793,0.00004519246,0.00039487824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954183,0.000038881022,0.0005387338,0.0018166922,0.0011855328,0.0010018286],"domain_scores_gemma":[0.99770176,0.00039431808,0.0003298792,0.0011164922,0.00022228734,0.0002352384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013788306,0.00062105455,0.00059995905,0.0008982489,0.00033555916,0.00062049803,0.0037106578,0.00042267927,0.000026229243],"category_scores_gemma":[0.000063045234,0.0005337706,0.00017342046,0.00073515764,0.0006978665,0.00058945967,0.0018436535,0.0015189268,0.00011111481],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006901342,0.000018344283,0.000019346484,0.000020992267,0.000009369938,0.00026078956,0.00094875845,0.023836855,0.000009446344,0.049831737,0.000012377668,0.9250251],"study_design_scores_gemma":[0.00022172496,0.00033598498,0.000051015737,0.0002217455,0.000006238447,0.00012264593,4.2994694e-7,0.81848514,0.00018547013,0.17625731,0.0032943545,0.0008179606],"about_ca_topic_score_codex":0.000023433257,"about_ca_topic_score_gemma":0.000019896572,"teacher_disagreement_score":0.92420715,"about_ca_system_score_codex":0.00030904028,"about_ca_system_score_gemma":0.000373052,"threshold_uncertainty_score":0.9997114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002201886,0.00013757955,0.99388206,0.0003635462,0.0009100101,0.00049695815,0.0000020628831,0.000113185044,0.001892698],"genre_scores_gemma":[0.6576664,0.000017092723,0.3412706,0.00033384972,0.0002946498,0.000021604956,0.0000027761039,0.000026411373,0.00036663408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746203,0.000011326977,0.00038396532,0.00110216,0.0005408445,0.0004996489],"domain_scores_gemma":[0.9979843,0.0006665577,0.00029225732,0.0006318911,0.00033826946,0.00008674913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055718643,0.0003766961,0.0003258912,0.00041254892,0.00032933796,0.0006603507,0.0012570261,0.00016904825,0.000002076166],"category_scores_gemma":[0.00008061543,0.00031692427,0.000045601326,0.00024430777,0.0005838855,0.0016916286,0.0005041784,0.0004048988,0.0000051923985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020587699,0.000010187265,0.000070394526,0.000052424235,0.0000055873,0.0000070748597,0.0018445041,0.16563684,0.00006521486,0.022182778,0.000012248013,0.81009215],"study_design_scores_gemma":[0.00006617482,0.00041562712,0.000020240066,0.0003063431,0.000005202468,0.000043433338,8.8287834e-7,0.8783304,0.0043504783,0.11572665,0.00035507575,0.00037946104],"about_ca_topic_score_codex":0.00009119996,"about_ca_topic_score_gemma":0.00015299593,"teacher_disagreement_score":0.8097127,"about_ca_system_score_codex":0.00022471104,"about_ca_system_score_gemma":0.00038819812,"threshold_uncertainty_score":0.9999283},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023529217,0.0006944892,0.99797237,0.000027406555,0.00051827234,0.00016147316,0.00000758443,0.000051151746,0.00033196196],"genre_scores_gemma":[0.019855915,0.000014554445,0.97943443,0.00005684064,0.00047627807,5.89078e-7,0.000020238933,0.000044116543,0.00009703242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998631,0.0000058674063,0.00035147349,0.0003534375,0.00044537266,0.00021287207],"domain_scores_gemma":[0.9993688,0.00006621283,0.00010587173,0.0002939097,0.00011066816,0.000054538366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012137471,0.00023923098,0.00025610824,0.00028861428,0.00005407782,0.00006702946,0.00023962141,0.0001800147,0.000012884896],"category_scores_gemma":[0.000010639687,0.0002396648,0.00005829646,0.00019167222,0.00018351772,0.000088443616,0.000047799407,0.00020801785,0.0000019614424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.722751e-7,0.0000036584256,0.000017874556,0.00002682681,0.000003931772,0.00001247588,0.000013391688,0.9154103,0.00038917302,0.000060286675,0.00005313891,0.084008016],"study_design_scores_gemma":[0.00013781941,0.000028555294,0.00018902544,0.00021205819,0.000012866389,0.000020111014,1.2200299e-8,0.99129933,0.0011942611,0.0066321082,0.000040527517,0.00023331604],"about_ca_topic_score_codex":0.00017234932,"about_ca_topic_score_gemma":0.00010501315,"teacher_disagreement_score":0.0837747,"about_ca_system_score_codex":0.0001238301,"about_ca_system_score_gemma":0.00015630723,"threshold_uncertainty_score":0.97732466},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021536094,0.00027762476,0.99369586,0.0020511928,0.0009999095,0.0013553819,0.000010235755,0.00007755785,0.0013168757],"genre_scores_gemma":[0.9619808,0.00007059664,0.026858376,0.0046091694,0.0026577748,0.00042960877,0.0004137091,0.00007535977,0.002904574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758005,0.0000070224683,0.00054935366,0.000863748,0.0005648291,0.00043500646],"domain_scores_gemma":[0.9988216,0.000118807584,0.00015739434,0.00058270496,0.00030602937,0.000013460737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011878386,0.00036050513,0.00029411455,0.0005112395,0.00025999622,0.00039247115,0.00097354007,0.00015056241,0.000056250683],"category_scores_gemma":[0.00010251047,0.00027914642,0.00010119346,0.0006266738,0.00033860153,0.00056213303,0.00037505364,0.00029745628,0.00006563662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008027122,0.000044828656,0.00027095,0.0002011879,0.0000067834103,0.0000013994305,0.00009390744,0.6912643,0.000008393009,0.0013878738,0.00022272652,0.30648968],"study_design_scores_gemma":[0.0002903759,0.000017099206,0.0030774623,0.00012060888,0.000017265214,3.806879e-7,0.0000016524485,0.96270853,0.0000047670997,0.009721954,0.023694267,0.00034561794],"about_ca_topic_score_codex":0.0016375715,"about_ca_topic_score_gemma":0.009303655,"teacher_disagreement_score":0.96683747,"about_ca_system_score_codex":0.00016496769,"about_ca_system_score_gemma":0.000085516804,"threshold_uncertainty_score":0.9999661},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19140282,0.00015643197,0.80636466,0.0001156151,0.0010745198,0.00013852198,0.000036100995,0.000005666151,0.0007056467],"genre_scores_gemma":[0.9900056,0.0000716862,0.008832384,0.00027580874,0.0005009012,0.0000049834366,0.000056260476,0.00001536782,0.00023701711],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986484,0.000010165128,0.00023065986,0.00066212495,0.00028040356,0.00016824409],"domain_scores_gemma":[0.99899185,0.000025011854,0.000200301,0.00064928574,0.00008859328,0.000044974215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012894423,0.0002010252,0.00019845634,0.00012370288,0.00005007099,0.00005883605,0.00068046415,0.00033634377,0.00001784606],"category_scores_gemma":[0.0000243262,0.0001699726,0.00007559263,0.00005791753,0.00025576903,0.000010016105,0.00025337472,0.00027340036,0.0000029027776],"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.000008384522,0.00000870563,0.00032682891,0.000009191088,0.000005813867,0.0000015935451,0.000057980607,0.00013425526,0.9397046,0.00003280706,0.0000063523903,0.059703484],"study_design_scores_gemma":[0.00013915003,0.00011154771,0.0017821253,0.00014864076,0.000006217692,0.0000025733696,3.8305504e-7,0.00071033655,0.9913946,0.004681166,0.00077964476,0.00024363011],"about_ca_topic_score_codex":0.00006431276,"about_ca_topic_score_gemma":0.00015867733,"teacher_disagreement_score":0.79860276,"about_ca_system_score_codex":0.000020522722,"about_ca_system_score_gemma":0.00029227507,"threshold_uncertainty_score":0.69312817},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042559922,0.001434037,0.9947152,0.0003931755,0.0016013526,0.00042936872,0.000025284466,0.00012273628,0.00085321575],"genre_scores_gemma":[0.13203141,0.000038933977,0.866029,0.00078260794,0.0006123081,0.000016173197,0.000014433458,0.00004878849,0.00042634705],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969216,0.000030200346,0.00053920987,0.0011356649,0.0008451786,0.00052812573],"domain_scores_gemma":[0.9970668,0.0005718661,0.00039496552,0.0012029436,0.00061559334,0.00014781166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009062905,0.0004647415,0.0006414138,0.00059502455,0.00012901623,0.0002914027,0.0034416444,0.0002963333,0.000020296264],"category_scores_gemma":[0.00015767239,0.00038100427,0.00014610545,0.00048922666,0.0006682469,0.0005129766,0.00068537437,0.00031984187,0.0000039042275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000221649,0.0000389455,0.000025207895,0.000145499,0.000032343367,0.0000234101,0.0010585944,0.03882655,0.0018134896,0.35813227,0.00041304194,0.59946847],"study_design_scores_gemma":[0.00040996235,0.00021897057,0.000042081996,0.00014091974,0.000011407997,0.000029146231,3.2411788e-7,0.2726344,0.0072595757,0.7152041,0.0035209893,0.00052811153],"about_ca_topic_score_codex":0.000020030246,"about_ca_topic_score_gemma":0.0000384371,"teacher_disagreement_score":0.5989404,"about_ca_system_score_codex":0.000119810844,"about_ca_system_score_gemma":0.0007526013,"threshold_uncertainty_score":0.99986416},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034667528,0.00008564012,0.9890519,0.0011430322,0.0014636719,0.00085392565,0.000016200771,0.00043641342,0.006602573],"genre_scores_gemma":[0.7877748,0.000026470478,0.20356698,0.0063540903,0.0009992042,0.00016017898,0.00007922857,0.00007391644,0.0009651594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994211,0.000183442,0.00078636967,0.0021574055,0.0017548981,0.00090686826],"domain_scores_gemma":[0.9971575,0.00063356775,0.00039414188,0.0013825746,0.00024647923,0.00018574916],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011832551,0.00076902757,0.00073677464,0.0018820247,0.00025710624,0.0012458179,0.0031877025,0.0005106888,0.000028472106],"category_scores_gemma":[0.00018374708,0.0007137634,0.00016943621,0.0016056848,0.0005492956,0.001060605,0.0004116614,0.0013518217,0.000060846003],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008005159,0.00034667665,0.00015282257,0.000107937856,0.000008066454,0.00033156713,0.0007127423,0.051747553,0.00014118513,0.0037553606,0.00029002142,0.942326],"study_design_scores_gemma":[0.001790877,0.0017612675,0.0017571801,0.005497152,0.000011916325,0.00003148405,3.647922e-7,0.7716376,0.032703273,0.17750135,0.0050500105,0.0022574768],"about_ca_topic_score_codex":0.00017168968,"about_ca_topic_score_gemma":0.0015149206,"teacher_disagreement_score":0.94006854,"about_ca_system_score_codex":0.0026546288,"about_ca_system_score_gemma":0.0030627241,"threshold_uncertainty_score":0.99979097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011630958,0.00060338085,0.9904204,0.0015456848,0.0015757072,0.000513245,0.0000028795735,0.000081867394,0.004093746],"genre_scores_gemma":[0.82533026,0.00022922424,0.16488025,0.007911041,0.00067239,0.000040936484,0.00004131411,0.00004515309,0.0008494636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594575,0.00013413391,0.0005757758,0.0013883975,0.0013492916,0.0006066401],"domain_scores_gemma":[0.99696386,0.0012799812,0.00024889625,0.0012481752,0.00015279223,0.00010629902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017063923,0.00049680984,0.00043561592,0.0019056476,0.0002668278,0.0006664384,0.0034974408,0.00023797121,0.000026170801],"category_scores_gemma":[0.00018214856,0.0003756311,0.00015342068,0.002677597,0.00025850517,0.00042696536,0.00052467856,0.00082926865,0.00006970265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005628888,0.000051738378,0.000020027212,0.000008271472,0.0000053896897,0.000092225106,0.00038409946,0.3018296,0.000017407197,0.08966944,0.000042845142,0.6078733],"study_design_scores_gemma":[0.00035371442,0.00019561329,0.0006304042,0.000097747026,0.000005219119,0.000067089,1.5719519e-7,0.70967793,0.000059894228,0.28621283,0.0022416664,0.0004577164],"about_ca_topic_score_codex":0.000035174176,"about_ca_topic_score_gemma":0.00031744028,"teacher_disagreement_score":0.8255401,"about_ca_system_score_codex":0.0003961576,"about_ca_system_score_gemma":0.00033901946,"threshold_uncertainty_score":0.9998696},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061280254,0.000011256995,0.93151456,0.00079888693,0.0017944755,0.0007470655,0.00004149197,0.00011238871,0.0036996007],"genre_scores_gemma":[0.98951036,0.000036643873,0.0066171936,0.00074101053,0.00021853833,0.000010125712,0.000003923574,0.000037491387,0.002824698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700135,0.00003546062,0.00049726095,0.0011284883,0.0009011109,0.00043634124],"domain_scores_gemma":[0.99823076,0.00038891265,0.00033501995,0.00076501915,0.00016389562,0.00011640857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000078449644,0.00042356213,0.00047257365,0.00041334447,0.00027976895,0.00013125082,0.000895139,0.00022132673,0.00007722793],"category_scores_gemma":[0.00007239039,0.00026432783,0.000121201905,0.0003189457,0.001015849,0.00048815538,0.00025834006,0.0006886843,0.000021210193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033648932,0.00033254907,0.00091708626,0.000099858036,0.00004081283,0.00035611694,0.005207054,0.72247607,0.08304305,0.003406244,0.00006256097,0.18372211],"study_design_scores_gemma":[0.0014266361,0.0016350627,0.0036914777,0.0011670858,0.0000642756,0.00055385794,0.0000026124637,0.75229925,0.21779943,0.01559541,0.0037939434,0.001970979],"about_ca_topic_score_codex":0.000027993954,"about_ca_topic_score_gemma":0.00014266555,"teacher_disagreement_score":0.9282301,"about_ca_system_score_codex":0.00016328438,"about_ca_system_score_gemma":0.00023697942,"threshold_uncertainty_score":0.99998087},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008411469,0.00010844201,0.9900084,0.000024658742,0.0010350537,0.00022418442,0.0000063294,0.000086554246,0.0000948781],"genre_scores_gemma":[0.19426978,0.000021813641,0.80544937,0.000016262278,0.00017442432,6.946696e-8,0.000019263309,0.000039017395,0.000010035268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831736,0.00002472562,0.0005306799,0.0004144885,0.0004641558,0.00024860658],"domain_scores_gemma":[0.9986748,0.00014862212,0.00030434175,0.000503067,0.00031641385,0.000052737974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004017866,0.00024851455,0.0003231466,0.00039315227,0.00007631577,0.00006444128,0.00020238564,0.00024602262,0.000003824685],"category_scores_gemma":[0.00008615714,0.00027621636,0.00006126807,0.0003504866,0.00042978767,0.00030391334,0.000077159246,0.00037253444,0.0000014841144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032373534,0.0000032151556,0.0000029820455,0.000042110827,0.0000054228867,0.0000036286704,0.00015725083,0.6574254,0.11219058,0.000007148859,9.163929e-7,0.23015809],"study_design_scores_gemma":[0.000111041896,0.000018692472,0.000051418046,0.00030362414,0.000018678184,0.00001794338,3.5665698e-7,0.7575859,0.24065226,0.0010640186,0.0000040591585,0.00017203235],"about_ca_topic_score_codex":0.00006117322,"about_ca_topic_score_gemma":0.000010451341,"teacher_disagreement_score":0.22998606,"about_ca_system_score_codex":0.00029753716,"about_ca_system_score_gemma":0.00011241019,"threshold_uncertainty_score":0.999969},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53179723,0.00055787474,0.46262497,0.0019494717,0.00020521088,0.0005291734,0.0000085786205,0.000014074735,0.0023134071],"genre_scores_gemma":[0.9922187,0.000027440985,0.005709611,0.0018506276,0.00008235627,8.727982e-7,0.0000076962815,0.0000038067114,0.000098905955],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990694,0.000032325912,0.0001801483,0.00043521042,0.00014881288,0.00013411402],"domain_scores_gemma":[0.9993647,0.0001264681,0.00009118836,0.0002802654,0.000097411095,0.00004000842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004601436,0.00014049733,0.00014878166,0.00005279225,0.00009433604,0.00002186828,0.00033202968,0.0001721982,0.0000037641578],"category_scores_gemma":[0.00023137085,0.00008941552,0.00003846649,0.00007753225,0.00017514837,0.0000027762478,0.00023249732,0.00017125491,0.0000018562046],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044861314,0.00015164736,0.0019447175,0.000095693445,0.00004645023,0.000012905102,0.0004923071,0.06136674,0.17907138,0.03389947,0.0003098093,0.7221603],"study_design_scores_gemma":[0.0015748955,0.010758368,0.0959165,0.0019532559,0.000061068495,0.00007879565,0.0000022268175,0.082792915,0.19275342,0.5992537,0.012092392,0.0027624278],"about_ca_topic_score_codex":0.000002557046,"about_ca_topic_score_gemma":0.000013625326,"teacher_disagreement_score":0.71939784,"about_ca_system_score_codex":0.000017668148,"about_ca_system_score_gemma":0.000040041577,"threshold_uncertainty_score":0.36462587},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003567755,0.0001767119,0.9955435,0.00020848856,0.0013609275,0.0012572376,0.000012869634,0.00013180019,0.0012728209],"genre_scores_gemma":[0.035933074,0.000065536464,0.9632144,0.00008194071,0.0002835093,0.000027128954,0.000019744892,0.000037666687,0.0003369858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956207,0.000125253,0.0006855766,0.0015022133,0.0014486208,0.00061759277],"domain_scores_gemma":[0.9956118,0.001296783,0.00055986294,0.0008118539,0.0015649748,0.00015476387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010523936,0.00049199595,0.0005091546,0.0014549937,0.0006222194,0.0006716966,0.0017152345,0.00032519022,0.000014868504],"category_scores_gemma":[0.00043991703,0.00047835294,0.00013319284,0.0009860296,0.00063269446,0.002044593,0.00048053608,0.0005855573,0.000013515883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014561531,0.00003830636,0.0000030528581,0.000037785605,0.000020731173,0.000013163774,0.0019335513,0.63964283,0.000018377943,0.083794236,0.00001769971,0.27446568],"study_design_scores_gemma":[0.0004168997,0.00018481698,0.000041818945,0.00014874889,0.00000753422,0.000022686936,0.0000019648212,0.8013845,0.00020358637,0.19704008,0.00014789254,0.00039948116],"about_ca_topic_score_codex":0.00008057506,"about_ca_topic_score_gemma":0.00005782959,"teacher_disagreement_score":0.2740662,"about_ca_system_score_codex":0.00113326,"about_ca_system_score_gemma":0.0020213916,"threshold_uncertainty_score":0.9997668},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000026465113,0.0010670101,0.99666107,0.00026347008,0.0007095517,0.00058008946,0.00004971578,0.00008186444,0.0005845933],"genre_scores_gemma":[0.008874512,0.000079519465,0.9877363,0.0001489929,0.00070158567,0.000013864255,0.000043372405,0.00004469385,0.002357172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643826,0.00003801738,0.00075120584,0.0015005992,0.0007103973,0.00056149234],"domain_scores_gemma":[0.99559116,0.0008598863,0.0005709782,0.0025126364,0.0003514346,0.000113871974],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001502308,0.00043876687,0.00076995144,0.00049976836,0.00022723511,0.00048076984,0.005417211,0.00026015332,0.00001738455],"category_scores_gemma":[0.00017602467,0.00037889837,0.000118969634,0.00045390357,0.000524413,0.001229541,0.002054132,0.0003123052,0.00002009746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027737311,0.000034247947,0.000014794743,0.00011805383,0.000061803024,0.000014162881,0.0003896569,0.52284545,0.0004992833,0.009071126,0.0002865268,0.46663713],"study_design_scores_gemma":[0.00018343085,0.0001715921,0.0000047885974,0.00025731037,0.000020210937,0.000031461426,2.3982977e-7,0.9867716,0.000334488,0.004507204,0.0073059695,0.00041172045],"about_ca_topic_score_codex":0.000020335636,"about_ca_topic_score_gemma":0.000023022247,"teacher_disagreement_score":0.46622542,"about_ca_system_score_codex":0.000116358795,"about_ca_system_score_gemma":0.00041827883,"threshold_uncertainty_score":0.99996394},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12580512,0.002235637,0.87111354,0.00007090899,0.00015773844,0.00026404165,0.000004057064,0.000011697995,0.00033725493],"genre_scores_gemma":[0.9918435,0.00034807884,0.00727617,0.00015081049,0.00020256119,0.000020208672,0.00003560856,0.000014411652,0.000108606066],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983201,0.000021714646,0.0002584865,0.0009109493,0.00027696486,0.00021177567],"domain_scores_gemma":[0.99922067,0.000022467118,0.00015861107,0.0004378635,0.00008751391,0.00007286473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024777412,0.00020710517,0.00021387498,0.0005396795,0.00010818399,0.000031611482,0.00031941518,0.0002532693,0.000003938909],"category_scores_gemma":[0.00003370894,0.0001906528,0.00006239897,0.00042799,0.00013468463,0.0000035398648,0.00025117732,0.00019687299,0.0000020004836],"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.000020177842,0.000026924596,0.0010599991,0.000017478382,0.000013759931,0.0000038695816,0.00022718591,0.18809366,0.7268942,0.00002261565,0.000011108,0.08360901],"study_design_scores_gemma":[0.00042560633,0.000099769146,0.0036664829,0.00012574713,0.00003175502,0.000017409522,9.389894e-7,0.36541668,0.62789243,0.00030460145,0.0014442845,0.000574328],"about_ca_topic_score_codex":0.000006880138,"about_ca_topic_score_gemma":0.000034214016,"teacher_disagreement_score":0.86603844,"about_ca_system_score_codex":0.000060333125,"about_ca_system_score_gemma":0.00011392645,"threshold_uncertainty_score":0.7774596},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073782745,0.0005146524,0.99498326,0.00036641405,0.0014008448,0.00044106104,0.000010562393,0.00025542674,0.001289983],"genre_scores_gemma":[0.6633042,0.00016780035,0.33533448,0.0008495168,0.0002014905,0.000006072372,0.0000070892825,0.000048033828,0.00008133411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995953,0.00006720602,0.0008753073,0.0015252248,0.0010190785,0.0005601579],"domain_scores_gemma":[0.995817,0.00083043816,0.0006356981,0.0018156202,0.00070208503,0.00019914872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010407557,0.0005943781,0.00088776764,0.00095645763,0.0002018455,0.00046850854,0.005097473,0.0004892589,0.000038538765],"category_scores_gemma":[0.00013511705,0.00055728445,0.00025666563,0.0008612999,0.0009401892,0.00084609125,0.0032917785,0.0013431761,0.000008488019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001867061,0.00014853802,0.00043905198,0.00015379499,0.000060731603,0.00007337818,0.0029733882,0.001458126,0.0026526907,0.55529284,0.00011878875,0.43661],"study_design_scores_gemma":[0.00024303232,0.0002178581,0.000114986375,0.00067600363,0.00001035729,0.00004495109,4.0950442e-7,0.6654377,0.040412553,0.2884846,0.0036135288,0.0007440021],"about_ca_topic_score_codex":0.000086304106,"about_ca_topic_score_gemma":0.0001733475,"teacher_disagreement_score":0.6639796,"about_ca_system_score_codex":0.0001407423,"about_ca_system_score_gemma":0.00047285666,"threshold_uncertainty_score":0.99968785},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048754625,0.0000938703,0.99305373,0.00062469183,0.00021523453,0.00035943,0.000026859985,0.000029726092,0.0007210128],"genre_scores_gemma":[0.9928678,0.000016092858,0.0064554242,0.00020713758,0.00015030609,0.000007387632,0.000037408274,0.000011919393,0.00024651995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662626,0.00008679922,0.0009789424,0.00077756465,0.0012905512,0.000239913],"domain_scores_gemma":[0.9956149,0.0023842992,0.0006820559,0.0008166497,0.00043262495,0.000069491995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016091835,0.00022937407,0.00036589956,0.0010658291,0.00019062012,0.000099650584,0.0010355907,0.00022908286,0.00005485643],"category_scores_gemma":[0.0014233439,0.0001997307,0.0000922292,0.0012843624,0.0007051606,0.00031253512,0.00023306835,0.00032555798,0.00003904938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009715117,0.000024876203,0.00024616547,0.0000030821745,0.0000016189684,0.0000011396702,0.001027167,0.8832558,0.00009182814,0.002492096,0.000019899438,0.112826616],"study_design_scores_gemma":[0.00021912801,0.000042933432,0.005892739,0.00009258677,0.000004494768,0.0000053515764,0.000004413892,0.8747884,0.0012680638,0.112109214,0.0053149383,0.000257724],"about_ca_topic_score_codex":0.000032953678,"about_ca_topic_score_gemma":0.00007630839,"teacher_disagreement_score":0.98799235,"about_ca_system_score_codex":0.00021900951,"about_ca_system_score_gemma":0.00019118625,"threshold_uncertainty_score":0.81447816},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056883287,0.0009564112,0.9824894,0.000575305,0.002720186,0.0003875604,0.0000035313133,0.00022241661,0.012588326],"genre_scores_gemma":[0.02713676,0.00005788749,0.968605,0.002503206,0.0006676753,0.0000054431457,0.000003442579,0.00005165334,0.0009689284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99468464,0.00007654345,0.00066655426,0.00208589,0.0014938394,0.0009925594],"domain_scores_gemma":[0.9961458,0.0007739024,0.0003672665,0.0020162244,0.00041228344,0.0002845615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015847125,0.0007190168,0.00076498656,0.0020208585,0.0003387333,0.0009747543,0.004939539,0.00045734496,0.000041900945],"category_scores_gemma":[0.00032665677,0.0006590825,0.00026726656,0.0019245738,0.0008033703,0.00087577756,0.0017149484,0.0012751297,0.00018343316],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010894512,0.000032966884,0.0000057119637,0.000033647615,0.0000124522285,0.001279917,0.00047593884,0.024407554,0.00052186695,0.030535253,0.000019611169,0.9426642],"study_design_scores_gemma":[0.0010451067,0.00037403754,0.00011206584,0.00061210274,0.000020814121,0.00091891986,9.5679674e-8,0.18092063,0.007243096,0.80517703,0.0021033597,0.0014727542],"about_ca_topic_score_codex":0.00005449546,"about_ca_topic_score_gemma":0.0000106667085,"teacher_disagreement_score":0.94119143,"about_ca_system_score_codex":0.00069686613,"about_ca_system_score_gemma":0.0013438587,"threshold_uncertainty_score":0.99958605},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011862858,0.0006404215,0.9858858,0.00001016851,0.00041829076,0.00022221923,0.000006674084,0.0001205476,0.0008330266],"genre_scores_gemma":[0.96072847,0.0000034191778,0.039054435,0.000009143076,0.0001438008,0.000005809716,0.000020920565,0.00002732289,0.000006700986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885863,0.000004757496,0.00034397806,0.00031061668,0.00032735246,0.00015463516],"domain_scores_gemma":[0.9995946,0.00007429053,0.00006826373,0.00015618009,0.00007373219,0.000032890686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016753523,0.00021966828,0.00023357854,0.0003230707,0.000038522427,0.000048809092,0.00018466181,0.00014078975,0.0000040256523],"category_scores_gemma":[0.000011990956,0.00024337746,0.00003190748,0.000106709274,0.00009839364,0.00016399706,0.00006569373,0.00018897813,0.0000014360093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.96233e-7,0.0000042595157,0.00002690136,0.00012910967,0.0000051344064,9.396329e-7,0.000364567,0.9973369,0.00028773077,0.0005307725,0.0000036299734,0.0013090081],"study_design_scores_gemma":[0.00011638407,0.000017143031,0.000033345164,0.00024929194,0.0000036384897,0.0000130355875,2.1809073e-7,0.98090744,0.0062373206,0.012197981,0.000012037534,0.0002121634],"about_ca_topic_score_codex":0.0000117020045,"about_ca_topic_score_gemma":0.000003074309,"teacher_disagreement_score":0.9488656,"about_ca_system_score_codex":0.00019691873,"about_ca_system_score_gemma":0.00007251433,"threshold_uncertainty_score":0.9924645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014208205,0.0002684367,0.9923357,0.0010114814,0.0026491245,0.00035946158,0.000020129404,0.00017872706,0.0030349041],"genre_scores_gemma":[0.054180555,0.00018772969,0.9412814,0.0022891127,0.00024622728,0.000018512339,0.000058641206,0.000055807992,0.0016820657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960495,0.00002453704,0.0005343646,0.0016543097,0.00087277085,0.00086449017],"domain_scores_gemma":[0.99753,0.00018618278,0.00022396598,0.0018172576,0.000108605054,0.0001339865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011268966,0.0005384788,0.0005193007,0.0015447163,0.00020752382,0.00076634076,0.005042604,0.00032254535,0.000041432046],"category_scores_gemma":[0.00006340121,0.00049690425,0.00011651277,0.0010072383,0.0005999933,0.0013326067,0.0028994598,0.0013062181,0.00006976349],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005317044,0.0000960144,0.00024894823,0.000063796906,0.0000128689535,0.0003952371,0.00064638467,0.0013390861,0.0002196993,0.17075206,0.000031322954,0.8261893],"study_design_scores_gemma":[0.0005156895,0.00011881064,0.0009909372,0.00028480522,0.0000062239897,0.000029910534,2.5816902e-7,0.5702197,0.00028148713,0.41291034,0.013651281,0.0009905483],"about_ca_topic_score_codex":0.000030690993,"about_ca_topic_score_gemma":0.0015853968,"teacher_disagreement_score":0.8251987,"about_ca_system_score_codex":0.0001337569,"about_ca_system_score_gemma":0.00023231217,"threshold_uncertainty_score":0.99974823},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019201445,0.00079214486,0.991793,0.0014809027,0.0029096683,0.0008259175,0.0000133967005,0.00012762053,0.00013721306],"genre_scores_gemma":[0.6780988,0.00041717722,0.3164722,0.0026200819,0.0021296188,0.00005778092,0.000019102865,0.000055099426,0.00013012801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970197,0.00002950417,0.00043693263,0.0012999519,0.000679885,0.00053398847],"domain_scores_gemma":[0.9967227,0.0012200049,0.00025273397,0.0014942975,0.00019469453,0.00011558152],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032715322,0.00045148729,0.0003720987,0.0005489938,0.0007209265,0.00044908674,0.0027354497,0.00042147547,0.000012256767],"category_scores_gemma":[0.00010993232,0.00031189603,0.00027773756,0.0005323311,0.00077655417,0.0004286373,0.00085041765,0.0005815723,0.0000044571825],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007482582,0.00004169007,0.00007211947,0.00003229689,0.000033917833,0.000031748787,0.0010827002,0.024405567,0.0005109951,0.0050599896,0.0007603461,0.9678938],"study_design_scores_gemma":[0.0015028048,0.00058604236,0.014835399,0.0002579938,0.000047248694,0.00015984617,5.23555e-7,0.8653375,0.005807882,0.0984847,0.011558439,0.001421638],"about_ca_topic_score_codex":0.00006315476,"about_ca_topic_score_gemma":0.000080747835,"teacher_disagreement_score":0.96647215,"about_ca_system_score_codex":0.00009005006,"about_ca_system_score_gemma":0.00030661057,"threshold_uncertainty_score":0.9999333},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029464172,0.00035687804,0.9897594,0.00015839245,0.005437133,0.000824597,0.00005529326,0.00016464372,0.003214194],"genre_scores_gemma":[0.33854154,0.00017104397,0.6490919,0.0029634316,0.00466996,0.00016200477,0.00012233973,0.00020664686,0.004071147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962167,0.00003612368,0.0004979215,0.0016951705,0.0009204347,0.0006336463],"domain_scores_gemma":[0.9972226,0.0005200917,0.0003072755,0.0014720281,0.00028065837,0.00019733461],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005464162,0.00053683924,0.0005089051,0.0007432731,0.00043814527,0.0006176191,0.0028322525,0.00032069936,0.000014527107],"category_scores_gemma":[0.00006315808,0.00046005772,0.00015410753,0.00048256756,0.00033078543,0.00066012476,0.0011707289,0.0006196735,0.000050722487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027722708,0.00025798674,0.00001635813,0.00010433846,0.0001018381,0.00029729953,0.0035674411,0.11567701,0.0004721709,0.15363553,0.0024374172,0.7231554],"study_design_scores_gemma":[0.00050253904,0.00095014286,0.000012823935,0.0008321904,0.0000081148055,0.00010482757,0.0000015705541,0.9518719,0.0008979249,0.02893019,0.015162079,0.0007257024],"about_ca_topic_score_codex":0.000045247078,"about_ca_topic_score_gemma":0.000011750777,"teacher_disagreement_score":0.8361949,"about_ca_system_score_codex":0.0004779216,"about_ca_system_score_gemma":0.00029372593,"threshold_uncertainty_score":0.9997851},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036367113,0.00011928179,0.99799204,0.00032110146,0.00039137545,0.00056419015,0.000013418928,0.00037519363,0.00018703254],"genre_scores_gemma":[0.002700515,0.000019078874,0.99578476,0.0012823455,0.000094740026,0.0000034717289,0.000038321457,0.000022459066,0.00005431715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594796,0.00007859162,0.0009265416,0.0013934743,0.0011512373,0.00050222734],"domain_scores_gemma":[0.99715173,0.00036834393,0.00053145207,0.0016637342,0.00015517318,0.00012956004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016264381,0.0003995074,0.00054517895,0.0012036313,0.00010151915,0.00026376054,0.0041908533,0.00022195412,0.000012704177],"category_scores_gemma":[0.00014800433,0.0004035658,0.0000535293,0.0009376637,0.00048466877,0.0014652247,0.0020686851,0.00053029385,0.000003274412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021116264,0.000024944764,0.000010769238,0.000045758108,0.0000042608203,0.000078184836,0.00052946067,0.020543672,0.002971464,0.00009728599,0.000029690229,0.9756624],"study_design_scores_gemma":[0.00027736212,0.00010423885,0.00006135364,0.00081763027,0.000004112115,0.000056380883,5.4397265e-7,0.974689,0.014831219,0.008783326,0.000012746737,0.00036209985],"about_ca_topic_score_codex":0.00009314397,"about_ca_topic_score_gemma":0.00006594251,"teacher_disagreement_score":0.9753003,"about_ca_system_score_codex":0.000398571,"about_ca_system_score_gemma":0.0005020222,"threshold_uncertainty_score":0.99984163},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052511492,0.0006340109,0.9967049,0.00034499064,0.00094830664,0.00013713939,0.000012888672,0.00021745743,0.0009477992],"genre_scores_gemma":[0.009473538,0.000054417575,0.987799,0.0012751095,0.00094253843,8.94128e-7,0.000015238578,0.000028889643,0.00041037227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555457,0.000032731336,0.0005938722,0.0018507639,0.0011156518,0.0008524109],"domain_scores_gemma":[0.9972341,0.0002607246,0.00034582193,0.0016827576,0.00015706953,0.00031952767],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008022524,0.0006188839,0.0006991513,0.0011632062,0.00037431036,0.0012665604,0.003955423,0.00031260203,0.00002207537],"category_scores_gemma":[0.0000836669,0.0006040987,0.00021687814,0.0011216805,0.0002700625,0.0009981724,0.0014521291,0.0008519428,0.000038604376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.458119e-7,0.000008301317,0.000010283171,0.00000873242,0.0000150712785,0.00012733866,0.0003340686,0.07332548,0.00023295995,0.0006161262,0.000014808493,0.9253059],"study_design_scores_gemma":[0.00019829099,0.00007201544,0.000010231358,0.00041584103,0.000023539675,0.00012832979,2.2578911e-7,0.9761145,0.0005532565,0.018979019,0.0028079743,0.0006967591],"about_ca_topic_score_codex":0.00013744451,"about_ca_topic_score_gemma":0.0001026259,"teacher_disagreement_score":0.9246091,"about_ca_system_score_codex":0.00035855794,"about_ca_system_score_gemma":0.0011065345,"threshold_uncertainty_score":0.9997702},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28621948,0.00030588062,0.69593185,0.0012292058,0.0005419153,0.0021725546,0.000032310058,0.00009777681,0.013469061],"genre_scores_gemma":[0.99915123,0.000032062675,0.00035509426,0.00002652303,0.00024871685,0.000010886937,0.0000075017247,0.000005993693,0.00016198993],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997705,0.00021947641,0.00041322075,0.00065188867,0.0007364656,0.00027393753],"domain_scores_gemma":[0.9974627,0.0011347749,0.00027070075,0.0006891243,0.00034409369,0.00009864025],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0025834856,0.00017933402,0.0002658546,0.00017929418,0.0010583518,0.0001856517,0.00055126706,0.00019848927,0.00013600776],"category_scores_gemma":[0.00068380416,0.0001267867,0.0001418435,0.0002452195,0.0035936078,0.00016673951,0.00011990959,0.00035444356,0.0000050299814],"study_design_candidate":"design_other","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.00005892311,0.00017742977,0.01948976,0.00004574477,0.000049870792,0.0000013049744,0.010919432,0.06784912,0.00016752123,0.013763806,0.00004132222,0.88743573],"study_design_scores_gemma":[0.00040885166,0.00084291416,0.25150794,0.0002756506,0.000052807525,8.617122e-7,0.000021794856,0.24901572,0.0003372441,0.49669138,0.00024907902,0.00059575384],"about_ca_topic_score_codex":0.03947764,"about_ca_topic_score_gemma":0.0300405,"teacher_disagreement_score":0.88684,"about_ca_system_score_codex":0.0004903975,"about_ca_system_score_gemma":0.00049113436,"threshold_uncertainty_score":0.99911803},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010360174,0.00008852903,0.9951826,0.0017871434,0.0011975754,0.00089353276,0.000017636392,0.000108420725,0.000620984],"genre_scores_gemma":[0.2366237,0.000017553333,0.7510663,0.0060274447,0.00045431915,0.000046268484,0.000018979961,0.000116587194,0.005628788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503964,0.00010660071,0.0005561129,0.0017754327,0.0017977718,0.00072445587],"domain_scores_gemma":[0.9959541,0.0011924908,0.00037751914,0.0015299883,0.00056514423,0.0003807316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008883646,0.0006003862,0.0007785286,0.0011236331,0.00022896384,0.0007013651,0.0036500779,0.00034167184,0.000118146716],"category_scores_gemma":[0.00082829606,0.0005043586,0.00015232016,0.00116666,0.00057177845,0.0006877992,0.0012941853,0.0011053776,0.000088660156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003594737,0.00010655933,0.0000023011858,0.00003192316,0.000027491054,0.000041016763,0.0016227168,0.9013742,0.000062731015,0.03736456,0.00016248677,0.059168052],"study_design_scores_gemma":[0.0005965421,0.0007976687,0.000026571932,0.0009020719,0.00001376622,0.000018243749,8.6174896e-7,0.84309876,0.000105050785,0.15340772,0.00027613962,0.00075657794],"about_ca_topic_score_codex":0.000056610315,"about_ca_topic_score_gemma":0.00028441456,"teacher_disagreement_score":0.24411622,"about_ca_system_score_codex":0.0003317325,"about_ca_system_score_gemma":0.0006962775,"threshold_uncertainty_score":0.9997408},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014838176,0.00012671096,0.9959676,0.00096774264,0.0006749631,0.0013627153,0.00005729643,0.00021667748,0.00047786743],"genre_scores_gemma":[0.004254123,0.000018667348,0.993344,0.001360897,0.00054689636,0.000041568983,0.00007840343,0.000046299923,0.0003091053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963896,0.000030017854,0.0004566002,0.0016589212,0.0007452161,0.000719591],"domain_scores_gemma":[0.9976856,0.00024902888,0.00041585148,0.0009870784,0.00048515797,0.0001772782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008408201,0.00062375836,0.00056473707,0.00088855054,0.00054918096,0.0005409101,0.0020012024,0.0007061816,0.00000794642],"category_scores_gemma":[0.000088536086,0.00059286784,0.00021616006,0.00060475356,0.00027863542,0.00082889444,0.0005190306,0.0009491962,0.000015592534],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002173392,0.000132331,0.0000051018433,0.00012853635,0.000016078566,0.0000361628,0.00059146265,0.006302276,0.098429054,0.0009281537,0.00014768564,0.89326143],"study_design_scores_gemma":[0.0012895615,0.0007860055,0.000032435357,0.0033615169,0.000040883846,0.00040342362,0.0000010655898,0.66278994,0.14524075,0.17889644,0.004749096,0.0024088619],"about_ca_topic_score_codex":0.000038795697,"about_ca_topic_score_gemma":0.00009585053,"teacher_disagreement_score":0.8908526,"about_ca_system_score_codex":0.00032558164,"about_ca_system_score_gemma":0.00042203642,"threshold_uncertainty_score":0.99965227},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01177741,0.000091823145,0.981421,0.0029502264,0.0006396947,0.0025584726,0.00015584705,0.00031026726,0.000095235526],"genre_scores_gemma":[0.43946722,8.570607e-7,0.5560197,0.0031535428,0.0010801496,0.00008145078,0.00011894813,0.00004409015,0.000034034554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99483794,0.0001215999,0.00096130255,0.0023036012,0.0008664814,0.00090906356],"domain_scores_gemma":[0.99593514,0.00083125586,0.00059998845,0.0013668488,0.0010230086,0.00024376389],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0033643192,0.00068741804,0.00091367797,0.0003879146,0.00044279994,0.0010382463,0.0027124337,0.00051087554,5.451039e-7],"category_scores_gemma":[0.00023978052,0.00065048964,0.00016857784,0.0006712969,0.00020279124,0.0010923023,0.00064026174,0.00048914115,0.000001057111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014680845,0.000102341124,0.00032853996,0.001960006,0.000020705258,0.0000033585645,0.003902545,0.6497755,0.0002474617,0.012835598,0.000024403784,0.33065274],"study_design_scores_gemma":[0.0006837057,0.00040813282,0.0013621232,0.00042777066,0.000020830652,0.0000048406564,6.1121244e-7,0.8952664,0.00020265438,0.10019813,0.0006928176,0.0007319979],"about_ca_topic_score_codex":0.00017169828,"about_ca_topic_score_gemma":0.00021875164,"teacher_disagreement_score":0.42768982,"about_ca_system_score_codex":0.00028498008,"about_ca_system_score_gemma":0.0012805909,"threshold_uncertainty_score":0.99999875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010417073,0.0018130015,0.99379677,0.00027136222,0.00051348784,0.00045037485,0.000013332446,0.0015261297,0.00057386054],"genre_scores_gemma":[0.104822546,0.0000041628878,0.8934963,0.00081168464,0.0006468112,0.000008558103,0.000056722412,0.00007061894,0.00008264009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99472076,0.00009693064,0.00061205315,0.0023249295,0.0014147537,0.00083055324],"domain_scores_gemma":[0.99641603,0.00035817927,0.0005323883,0.0021596283,0.00030492144,0.0002288348],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00052233756,0.0008531423,0.0008197693,0.0008269457,0.00037279702,0.0014332387,0.0041176453,0.0005268239,0.000015201721],"category_scores_gemma":[0.000023832195,0.000679005,0.000115920986,0.0006235803,0.00072985,0.0015369719,0.0014293421,0.0010443334,0.000011055064],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047317495,0.0002172133,0.0001222101,0.00009737522,0.00002363131,0.0010926285,0.0014554869,0.010441014,0.012988675,0.004330235,0.00025570663,0.9689285],"study_design_scores_gemma":[0.0007098888,0.0009077856,0.000112331145,0.0037364338,0.000026622294,0.0002330235,6.4811036e-7,0.7272249,0.10278858,0.16164131,0.00064500846,0.0019734928],"about_ca_topic_score_codex":0.0001716111,"about_ca_topic_score_gemma":0.00013587836,"teacher_disagreement_score":0.966955,"about_ca_system_score_codex":0.00040156246,"about_ca_system_score_gemma":0.00032566543,"threshold_uncertainty_score":0.9996034},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3512611,0.000012526105,0.647706,0.00020908234,0.00001799128,0.0006902388,9.438601e-7,0.00007286714,0.000029284569],"genre_scores_gemma":[0.59205085,0.000004074345,0.40780386,0.000087461594,0.000022940554,0.000026184904,0.000001557218,0.0000026385048,4.162361e-7],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988449,0.000024138339,0.00027551004,0.00037916133,0.00031207336,0.00016418852],"domain_scores_gemma":[0.99901134,0.00013561526,0.000106262196,0.00046740347,0.00022455787,0.00005482111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029352028,0.00011268581,0.00028857775,0.00017478567,0.00012021486,0.000007505109,0.00022457355,0.00003765732,0.0000058902315],"category_scores_gemma":[0.000044350418,0.00009075348,0.000033863627,0.0010424319,0.0005140196,0.00012414843,0.00010372029,0.00017384818,0.0000013091601],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002213009,0.006210366,0.25966635,0.00007393707,0.000019422727,0.00004506121,0.025307171,0.07809634,0.13668174,0.00032012592,0.00006820806,0.49328998],"study_design_scores_gemma":[0.00065334665,0.0016170635,0.2300532,0.000104984814,0.000014755498,0.00007767661,0.000019435176,0.1555426,0.6059507,0.005682797,0.000049488768,0.00023394344],"about_ca_topic_score_codex":0.0000501203,"about_ca_topic_score_gemma":0.000039701063,"teacher_disagreement_score":0.49305603,"about_ca_system_score_codex":0.000093449955,"about_ca_system_score_gemma":0.00012945523,"threshold_uncertainty_score":0.37008193},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06209857,0.0001045274,0.9325883,0.00075004884,0.0002273369,0.00026640296,0.000030004376,0.00009273441,0.0038421245],"genre_scores_gemma":[0.9408863,0.000015435133,0.05824392,0.00016690757,0.00041720783,0.0000070237506,0.0000733302,0.000031837404,0.00015803282],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997614,0.000018230312,0.00037735808,0.0009426442,0.00067506614,0.0003726552],"domain_scores_gemma":[0.9982855,0.0004396651,0.00042887984,0.0005600426,0.00017930094,0.00010664567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034880496,0.00043169298,0.00059349096,0.0007081997,0.00022570392,0.0001115505,0.0005116151,0.00067971204,0.00019532331],"category_scores_gemma":[0.000119480086,0.00038681977,0.00011934692,0.0005791099,0.00046881018,0.00010234859,0.00008366201,0.0011663032,0.0000040001596],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005473525,0.00021672585,0.0013513672,0.0003610609,0.000087107015,0.00001750473,0.0002444829,0.011360071,0.9461817,0.007279391,0.00007037868,0.032282826],"study_design_scores_gemma":[0.0033448315,0.00041036983,0.009873938,0.00040539665,0.00018067232,0.000055989258,0.0000019993156,0.54008406,0.39676875,0.04722807,0.00052081817,0.0011250876],"about_ca_topic_score_codex":0.000072350515,"about_ca_topic_score_gemma":0.00035058951,"teacher_disagreement_score":0.87878776,"about_ca_system_score_codex":0.00029529855,"about_ca_system_score_gemma":0.00020531255,"threshold_uncertainty_score":0.9998584},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044511847,0.001881126,0.9282662,0.00011670255,0.009187884,0.0007223223,0.000018273011,0.0005863085,0.0147093395],"genre_scores_gemma":[0.99206305,0.000057164692,0.007250035,0.00017341392,0.00028013973,0.000012612408,0.000004802253,0.0000558884,0.0001029068],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981142,0.000021390702,0.00042236914,0.00059096346,0.00032478498,0.0005262424],"domain_scores_gemma":[0.9989903,0.0002112542,0.000078067664,0.0005663129,0.00004690971,0.000107184525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069717737,0.00040509924,0.0004563326,0.0010914975,0.00009339886,0.0001730411,0.00084000506,0.00045523827,0.000051088507],"category_scores_gemma":[0.000027088243,0.00038669357,0.00010490878,0.00046107362,0.00047468927,0.0002300105,0.00014696483,0.0011693977,0.000045698504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045289333,0.00008556326,0.00658393,0.0012569086,0.00010693577,0.0007614048,0.009319437,0.15798737,0.042586785,0.1294507,0.00011489385,0.6517008],"study_design_scores_gemma":[0.0004591332,0.000112766684,0.0007383023,0.001627562,0.000013646155,0.000093002,9.226674e-7,0.096110255,0.026710419,0.8637545,0.008823401,0.0015560986],"about_ca_topic_score_codex":0.000015026002,"about_ca_topic_score_gemma":0.0002629175,"teacher_disagreement_score":0.9475512,"about_ca_system_score_codex":0.00008741493,"about_ca_system_score_gemma":0.000058110105,"threshold_uncertainty_score":0.9998585},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003197316,0.000065726024,0.9920288,0.0023855723,0.0011817265,0.00037874444,0.00010852701,0.00022329485,0.0033079316],"genre_scores_gemma":[0.020975748,0.00002723976,0.97438794,0.0021597217,0.0007507783,0.000055772423,0.000034071254,0.000041248008,0.0015674498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645555,0.000015394417,0.00042498726,0.0017731665,0.0007545164,0.0005763709],"domain_scores_gemma":[0.9969962,0.0003297641,0.00018179607,0.0020355955,0.00015290183,0.00030372993],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002782667,0.00043748165,0.00038323738,0.0006141259,0.00031284342,0.0007518431,0.0040323474,0.00022985964,0.00009503354],"category_scores_gemma":[0.00005457692,0.00042348134,0.00009326135,0.00066641136,0.00019454944,0.0005255638,0.0016101449,0.0005560248,0.00031836078],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.5547107e-7,0.0000204268,0.00013480628,0.000005902439,0.0000072617413,0.000021047324,0.0008924932,0.0023047437,0.0000393708,0.0056071877,0.00030313258,0.990663],"study_design_scores_gemma":[0.00034699956,0.0002704616,0.0030813771,0.0008171018,0.0000235243,0.000065864195,0.0000011393416,0.9020487,0.0013695871,0.041919865,0.04819908,0.0018562932],"about_ca_topic_score_codex":0.000101621816,"about_ca_topic_score_gemma":0.000092547125,"teacher_disagreement_score":0.98880666,"about_ca_system_score_codex":0.00021155021,"about_ca_system_score_gemma":0.00018930806,"threshold_uncertainty_score":0.9998217},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017674759,0.00042925295,0.97678566,0.00007100286,0.0007543736,0.0005558591,0.000028581579,0.000030715342,0.0036697984],"genre_scores_gemma":[0.975212,0.000031968113,0.022857452,0.00026891462,0.0014278765,0.000008528919,0.00007416229,0.000019068792,0.000100023],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976341,0.00019812264,0.0005214434,0.00041427996,0.00065908104,0.0005729472],"domain_scores_gemma":[0.9980999,0.0009115312,0.0003520534,0.0002000339,0.0003637808,0.00007269392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027930439,0.0002830644,0.00068131794,0.0006812658,0.00082489155,0.00019581252,0.00082936115,0.00052700547,0.00002910513],"category_scores_gemma":[0.00007462318,0.00027433317,0.00024261084,0.0018025419,0.0022432606,0.00030064685,0.00021508904,0.00050572294,3.1272606e-7],"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.00011588255,0.000067157285,0.00046725367,0.00002639365,0.00019212626,0.0000033887018,0.39682302,0.3238999,0.000009147538,0.18090568,0.000014198682,0.09747585],"study_design_scores_gemma":[0.0006976954,0.00035030485,0.0007041888,0.00031774223,0.00053100893,0.0000016349014,0.008650482,0.7447585,0.000027014383,0.24229,0.00027246945,0.0013989698],"about_ca_topic_score_codex":0.0008873454,"about_ca_topic_score_gemma":0.023838736,"teacher_disagreement_score":0.95753723,"about_ca_system_score_codex":0.00054263015,"about_ca_system_score_gemma":0.0004308186,"threshold_uncertainty_score":0.9999709},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000084630825,0.000037906946,0.9933434,0.00042737904,0.0017312762,0.0006162493,4.201741e-7,0.00012281707,0.0036359183],"genre_scores_gemma":[0.11268286,0.00007686661,0.8799276,0.0038851737,0.0004381693,0.000021217864,0.000016822898,0.00009219153,0.0028591005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951622,0.00007544892,0.0011111149,0.0014087692,0.0013345536,0.0009079277],"domain_scores_gemma":[0.9974659,0.00025050732,0.0005278275,0.0012329347,0.00030253734,0.0002202706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015099754,0.00060718064,0.0006157045,0.0015498498,0.00028234575,0.0007852214,0.0023434677,0.00030767094,0.000023503873],"category_scores_gemma":[0.00043391547,0.00064557453,0.000081869024,0.0010561664,0.00020682707,0.0011074143,0.0013006495,0.0011634761,0.00007718629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032776954,0.0000055461933,0.000108923145,0.00002409247,0.0000045566176,0.00005322036,0.0012835365,0.9507159,0.0002061319,0.004758101,0.000011343033,0.042825375],"study_design_scores_gemma":[0.0002142651,0.0002476955,0.000044502784,0.00057669426,0.0000055290084,0.000024160454,7.4332013e-7,0.98910385,0.0005019771,0.0027477143,0.0058150683,0.0007177697],"about_ca_topic_score_codex":0.000033795608,"about_ca_topic_score_gemma":0.000020694008,"teacher_disagreement_score":0.1134158,"about_ca_system_score_codex":0.0012687228,"about_ca_system_score_gemma":0.00055589544,"threshold_uncertainty_score":0.9995996},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0131236585,0.00034298174,0.9432873,0.007082848,0.00085905497,0.0007105335,0.000010849472,0.00036357524,0.034219205],"genre_scores_gemma":[0.9914197,0.00009686305,0.0074289395,0.00045285668,0.00027718215,0.000009861711,0.00006388661,0.000015462034,0.00023527452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835277,0.00014567439,0.0003745823,0.00026904108,0.0005003287,0.00035759728],"domain_scores_gemma":[0.9988046,0.0004264324,0.00021045632,0.00035746853,0.00016207382,0.00003892285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009210616,0.00017593947,0.0002534505,0.0007379526,0.00056508824,0.00012327114,0.0010562012,0.00034857215,0.00005948584],"category_scores_gemma":[0.00012142164,0.00019355564,0.00004120427,0.00049180695,0.0015686554,0.00020661352,0.00028916853,0.00057750737,0.000008126707],"study_design_candidate":"design_other","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.0000071230484,0.0001922521,0.005131119,0.000024810099,0.000006015678,0.000008741047,0.05129811,0.008331707,0.000031245334,0.16095309,0.000077118726,0.77393866],"study_design_scores_gemma":[0.0010696637,0.00010891886,0.011105007,0.00072490633,0.00002535101,0.000003323493,0.00018899256,0.58264613,0.00020448164,0.36002064,0.042397853,0.001504704],"about_ca_topic_score_codex":0.0027990574,"about_ca_topic_score_gemma":0.06494964,"teacher_disagreement_score":0.97829604,"about_ca_system_score_codex":0.00039838188,"about_ca_system_score_gemma":0.00034385698,"threshold_uncertainty_score":0.9521126},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0092033055,0.00087246316,0.97394323,0.0005131021,0.0011153892,0.00022525156,0.000019991612,0.000251221,0.013856054],"genre_scores_gemma":[0.7704314,0.00026987703,0.223108,0.002983711,0.0014890563,0.000012445193,0.0002762395,0.00006836538,0.0013609004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841475,0.000023064988,0.00021753502,0.00073252176,0.0003146927,0.00029742377],"domain_scores_gemma":[0.9992395,0.000025565721,0.00008043554,0.00047109247,0.00007889329,0.0001045009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026983468,0.00024326865,0.00020775477,0.00018210919,0.00009085784,0.00008072747,0.0005909718,0.000533546,0.000045534427],"category_scores_gemma":[0.00007060286,0.00020695363,0.00005997858,0.00012297007,0.00072463776,0.0000058616242,0.00015003444,0.00025834318,0.000016714896],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017421346,0.000016564034,0.00001852283,0.000009057916,0.000008552569,0.000014294723,0.00010189089,0.0011939862,0.003984733,0.00015179868,0.00012807293,0.9943551],"study_design_scores_gemma":[0.0023487075,0.0055375025,0.0062755723,0.0009395388,0.000086972796,0.00035738858,0.0000035237608,0.4698887,0.067584224,0.1721092,0.27052462,0.004344059],"about_ca_topic_score_codex":0.000012003146,"about_ca_topic_score_gemma":0.00005380359,"teacher_disagreement_score":0.99001104,"about_ca_system_score_codex":0.00003763784,"about_ca_system_score_gemma":0.0002964291,"threshold_uncertainty_score":0.8439324},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007334094,0.000722948,0.98146296,0.0002828199,0.006280179,0.0010439791,0.0000114473805,0.00020840348,0.009913948],"genre_scores_gemma":[0.12807985,0.00003854719,0.8660487,0.00050694385,0.0030237439,0.000083771396,0.00001446618,0.00007944862,0.002124564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99525476,0.000059527127,0.00058476976,0.0021783304,0.0009383452,0.0009842863],"domain_scores_gemma":[0.9962449,0.0009790615,0.00042526878,0.0014665577,0.00055650406,0.00032772042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012877084,0.0007013039,0.0008027076,0.0006782226,0.00055863906,0.0008859439,0.0035590574,0.00059334206,0.0000126706545],"category_scores_gemma":[0.00038005825,0.00058959716,0.00027481487,0.00047951724,0.0010734454,0.0005398036,0.0013636999,0.0014884821,0.00005066459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001771179,0.000055073502,0.000041490668,0.00008055259,0.00003923308,0.00009611763,0.003117139,0.0062318225,0.00034103176,0.83096737,0.00004187505,0.1589706],"study_design_scores_gemma":[0.00052178313,0.00039970456,0.00012253315,0.0005789421,0.000021127424,0.00018905399,7.5797374e-7,0.5657761,0.0012317544,0.41836223,0.011624152,0.0011718322],"about_ca_topic_score_codex":0.000028307471,"about_ca_topic_score_gemma":0.00006365234,"teacher_disagreement_score":0.5595443,"about_ca_system_score_codex":0.00042987755,"about_ca_system_score_gemma":0.0007613927,"threshold_uncertainty_score":0.99965554},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005450252,0.00010039431,0.9968373,0.00022288044,0.00051209977,0.00040251578,0.0000011386632,0.00019877037,0.0011798627],"genre_scores_gemma":[0.8251587,0.000021716263,0.17404325,0.00054461684,0.000098363074,0.000010201704,0.000004283602,0.000026253261,0.00009258633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971807,0.000058971207,0.0006222993,0.0009183638,0.00086723914,0.00035242594],"domain_scores_gemma":[0.9983741,0.00018637882,0.0004029618,0.00077026535,0.00019791965,0.00006834882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001244191,0.00032669623,0.00041794288,0.0016334942,0.000087137014,0.0002308229,0.0018883116,0.00034573348,0.000012080646],"category_scores_gemma":[0.00008874899,0.00033782568,0.00008408975,0.001062861,0.00027892526,0.0007764198,0.00062885776,0.0005219589,0.00001617854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013259246,0.000086115506,0.00004416341,0.000096293734,0.000009076578,0.00003452269,0.005832274,0.5170961,0.011656717,0.0529669,0.0000022291763,0.41216233],"study_design_scores_gemma":[0.0003022634,0.00020999786,0.00005618913,0.0007112551,0.0000032256112,0.000020092039,1.2151476e-7,0.54935926,0.11600161,0.33275014,0.00008190071,0.0005039119],"about_ca_topic_score_codex":0.000054183794,"about_ca_topic_score_gemma":0.00005090702,"teacher_disagreement_score":0.8246137,"about_ca_system_score_codex":0.0003860495,"about_ca_system_score_gemma":0.00040288485,"threshold_uncertainty_score":0.9999074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009413707,0.00016479136,0.9535081,0.0048856786,0.0020921077,0.00034705218,0.00013358642,0.00018066505,0.03867864],"genre_scores_gemma":[0.014896797,0.00004548533,0.95579475,0.015884029,0.0026152963,0.00001736303,0.0006882575,0.00008806165,0.009969978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995443,0.00005487808,0.0005017537,0.0021519214,0.0012304134,0.0006180455],"domain_scores_gemma":[0.9927328,0.0018302263,0.00030754006,0.0049522948,0.000086550244,0.00009053847],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001306782,0.00056047685,0.00040892774,0.0006811865,0.0003843112,0.0019985766,0.015286662,0.00013162078,0.00006469747],"category_scores_gemma":[0.00016824197,0.00037969812,0.0000842093,0.00085615396,0.0005347498,0.0012133357,0.0074221333,0.0010846098,0.00023990785],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004252111,0.0000494402,0.00008015874,0.00001459439,0.000030467994,0.0001802964,0.00013870496,0.003988324,0.000030559022,0.12135595,0.0365231,0.83760417],"study_design_scores_gemma":[0.00014690861,0.000046632886,0.00006744798,0.00044406916,0.000010094826,0.000003045693,1.8711378e-7,0.7562989,0.0001570529,0.15143141,0.090823606,0.0005706244],"about_ca_topic_score_codex":0.00011895826,"about_ca_topic_score_gemma":0.0012019486,"teacher_disagreement_score":0.8370335,"about_ca_system_score_codex":0.00015085666,"about_ca_system_score_gemma":0.00023988224,"threshold_uncertainty_score":0.9998655},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014922353,0.0005624333,0.99480605,0.0006518779,0.0011876643,0.0002968397,0.00003470335,0.000052745185,0.0022584691],"genre_scores_gemma":[0.18279448,0.00009002981,0.8157424,0.00042111817,0.00040404417,0.0000069288762,0.000025678355,0.00004230298,0.0004730487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963293,0.000054990433,0.0008297932,0.0009898624,0.0012847934,0.00051127444],"domain_scores_gemma":[0.9959704,0.00069208717,0.0007257478,0.002130375,0.00038108623,0.0001002612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010544737,0.00041541125,0.0006200276,0.00037768923,0.00031051834,0.00019923659,0.0051844963,0.00021960706,0.000013832639],"category_scores_gemma":[0.00007327929,0.00028846835,0.00017452521,0.0005226496,0.0024665373,0.00042541188,0.002539575,0.0005463803,0.000009242956],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025871184,0.000125542,0.00015433905,0.000112400405,0.00003079873,0.00004737402,0.0004847379,0.016919957,0.001153278,0.19837856,0.0009508527,0.7816163],"study_design_scores_gemma":[0.0003914397,0.00022961159,0.0012114303,0.00053526054,0.000010012531,0.000036278958,1.8653283e-7,0.5481162,0.008420788,0.43674,0.0037539979,0.0005547888],"about_ca_topic_score_codex":0.00016440924,"about_ca_topic_score_gemma":0.00008210532,"teacher_disagreement_score":0.78106153,"about_ca_system_score_codex":0.00009941784,"about_ca_system_score_gemma":0.00038094743,"threshold_uncertainty_score":0.9999567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051405985,0.00087866146,0.99424016,0.00026370792,0.0010307692,0.00036516553,0.000010333905,0.00018219586,0.0025149283],"genre_scores_gemma":[0.45996538,0.000060819733,0.53897643,0.00071180396,0.00020995957,0.0000073643264,0.000009382369,0.00002763651,0.000031260723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99493665,0.00006101718,0.00060781586,0.001948851,0.001408996,0.001036665],"domain_scores_gemma":[0.99574596,0.00087085203,0.00035991997,0.0024159413,0.00027324056,0.0003341135],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010546453,0.00074272475,0.00091377494,0.0013951589,0.00027674346,0.00093927846,0.003985938,0.0003793628,0.000099207224],"category_scores_gemma":[0.00008014754,0.0005384587,0.00026908264,0.001971078,0.000877931,0.0009178627,0.0014899849,0.00072837033,0.00008782558],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026380661,0.000058192716,0.0007618809,0.000024217607,0.00008284995,0.00013612406,0.0010593641,0.03884444,0.000011084958,0.0076177167,0.000021741724,0.951356],"study_design_scores_gemma":[0.000404755,0.00025726797,0.0016321184,0.00021460863,0.00011583172,0.00009464335,1.7326748e-7,0.88700014,0.00009884345,0.10799009,0.0012351404,0.00095639494],"about_ca_topic_score_codex":0.000035324887,"about_ca_topic_score_gemma":0.00013499116,"teacher_disagreement_score":0.95039964,"about_ca_system_score_codex":0.00024713713,"about_ca_system_score_gemma":0.00025963498,"threshold_uncertainty_score":0.9997067},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008030058,0.0012682155,0.9939884,0.000040968338,0.00027809385,0.00035228327,0.0000014131465,0.0005289684,0.0034613865],"genre_scores_gemma":[0.17048118,0.0001018653,0.8291031,0.00009731949,0.00013148869,0.000012148724,0.0000012937279,0.000048344613,0.000023225044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981177,0.00000858882,0.00028289825,0.000687129,0.00035386503,0.00054984045],"domain_scores_gemma":[0.99884695,0.0005202678,0.000038695518,0.00045613348,0.000041099007,0.00009685586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041610227,0.0004244727,0.00044316438,0.00033369425,0.00010117925,0.00012995719,0.0006741047,0.0004573154,0.0000034939592],"category_scores_gemma":[0.00010197822,0.00036619784,0.000054985238,0.00024155798,0.0010573647,0.00018222537,0.0003845162,0.0010172486,0.000011389128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041951803,0.000003658923,0.0000014464431,0.000036222078,0.00000794234,0.000021068603,0.00008008734,0.7004475,0.000039994487,0.041427616,0.0000010346162,0.25792927],"study_design_scores_gemma":[0.00013367628,0.00005256314,0.0000060068783,0.00023820598,0.000008276147,0.00003533586,4.3365912e-7,0.55166006,0.00036559932,0.44710508,0.000034840723,0.0003598934],"about_ca_topic_score_codex":6.020261e-7,"about_ca_topic_score_gemma":8.641433e-7,"teacher_disagreement_score":0.40567747,"about_ca_system_score_codex":0.0002657967,"about_ca_system_score_gemma":0.000062040075,"threshold_uncertainty_score":0.999879},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000051039924,0.0013865164,0.9928044,0.0014171597,0.0023008322,0.00089766306,0.000034618904,0.00024667944,0.000906995],"genre_scores_gemma":[0.024559218,0.00013659106,0.9723022,0.0011779029,0.0011068891,0.00007482373,0.000052433064,0.00006478979,0.00052516186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553037,0.0000471503,0.0006949727,0.0017624628,0.0010392859,0.0009257585],"domain_scores_gemma":[0.9971097,0.00052695884,0.00038914185,0.0012432204,0.00045089386,0.0002800471],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008103309,0.00065334956,0.00062871195,0.0011284074,0.00040823693,0.0012053056,0.0034226452,0.00051673315,0.000019098334],"category_scores_gemma":[0.00007810328,0.0005685919,0.0002828742,0.0009280734,0.0005221345,0.0010154286,0.0007034608,0.0006713371,0.000026007301],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002524607,0.000053700016,0.000021839778,0.000038086717,0.000025993715,0.000009252905,0.0004918191,0.0020683596,0.00008058747,0.03999585,0.00026269836,0.9569493],"study_design_scores_gemma":[0.00062747777,0.00027434417,0.000023986631,0.00027004955,0.000013744054,0.00005437455,4.2341162e-7,0.83191156,0.00046141588,0.10532038,0.059991032,0.0010512283],"about_ca_topic_score_codex":0.0000223323,"about_ca_topic_score_gemma":0.000054537028,"teacher_disagreement_score":0.95589805,"about_ca_system_score_codex":0.00027323345,"about_ca_system_score_gemma":0.00047087835,"threshold_uncertainty_score":0.99983156},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018678521,0.00006277092,0.99690664,0.00022946164,0.0013306403,0.00026775786,0.000010309356,0.00017727561,0.000828348],"genre_scores_gemma":[0.18796988,0.000014281415,0.8096615,0.0011686927,0.0008625846,0.000015574755,0.000012711586,0.000051774954,0.00024297129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968035,0.00002609433,0.0004371884,0.0014594921,0.0007318445,0.00054185896],"domain_scores_gemma":[0.99761564,0.00016413035,0.0003085763,0.0015810513,0.00016176446,0.00016881627],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005977993,0.00042354918,0.00036991012,0.0004809663,0.00034616725,0.0006482832,0.0027502228,0.00023839588,0.000012822842],"category_scores_gemma":[0.000029889163,0.00040898402,0.0001032116,0.0004764207,0.00038956053,0.0004349923,0.001070783,0.00060122926,0.00008050953],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.9951675e-7,0.00001007046,0.000019991146,0.000010241412,0.000005313433,0.000009478734,0.0001911346,0.0056097237,0.00038481617,0.00129013,0.0000039076513,0.9924648],"study_design_scores_gemma":[0.00012729087,0.00006843661,0.000083401654,0.0002024362,0.000008164196,0.0000927869,1.0648434e-7,0.9800646,0.0026744874,0.014257378,0.0018952707,0.00052569795],"about_ca_topic_score_codex":0.00021435246,"about_ca_topic_score_gemma":0.0001368312,"teacher_disagreement_score":0.99193907,"about_ca_system_score_codex":0.0003569123,"about_ca_system_score_gemma":0.00026141744,"threshold_uncertainty_score":0.9998362},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012960516,0.0015101831,0.9946804,0.00081686466,0.00072762894,0.00079965993,0.000049199,0.0001294894,0.0011569696],"genre_scores_gemma":[0.031238493,0.0011790654,0.96226406,0.0023180405,0.00043462866,0.00003256275,0.000024553474,0.000121386576,0.0023872366],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956509,0.000043453907,0.00042304216,0.0020250485,0.0009599702,0.00089757255],"domain_scores_gemma":[0.9965802,0.0015039996,0.00020171487,0.0011459981,0.00011981341,0.0004482834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006662608,0.0006593589,0.00064630626,0.0009428668,0.0003849442,0.00057950156,0.002072979,0.00032323756,0.000014969119],"category_scores_gemma":[0.000106140746,0.00059003086,0.00010585141,0.00047645334,0.0009429579,0.00057378825,0.00083827536,0.0008002855,0.000024274837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005715947,0.000025364807,0.000040293446,0.00008480083,0.000028932229,0.00010216488,0.00085440645,0.0042603067,0.00009926355,0.11876665,0.0003640182,0.8753166],"study_design_scores_gemma":[0.0009965223,0.00085423875,0.0001837294,0.00043230437,0.000010059014,0.00023893733,6.3162804e-7,0.26913968,0.0007812492,0.7235685,0.0029129074,0.0008812134],"about_ca_topic_score_codex":0.000019752451,"about_ca_topic_score_gemma":0.000018927649,"teacher_disagreement_score":0.8744354,"about_ca_system_score_codex":0.00012821365,"about_ca_system_score_gemma":0.00019377105,"threshold_uncertainty_score":0.9996551},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021838132,0.0014739332,0.975848,0.000024481793,0.00040769216,0.00016479297,0.0000041721814,0.000015567923,0.00022323449],"genre_scores_gemma":[0.8397572,0.000020089554,0.15820137,0.00066191575,0.00088408747,0.000003933871,0.000091721726,0.000051604406,0.0003280535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977409,0.000031203253,0.00032032718,0.0009385989,0.00043762417,0.0005313316],"domain_scores_gemma":[0.9987611,0.000014085279,0.00015843728,0.0008050867,0.00014351045,0.00011777296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036577502,0.00036341898,0.00030885814,0.00029476362,0.00016710567,0.00010387585,0.0008544175,0.00039219618,0.000006298989],"category_scores_gemma":[0.000015496154,0.00035961668,0.00020404256,0.00037921243,0.00026474262,0.0000073341466,0.00036459023,0.000271393,0.0000033823203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005320988,0.00001574958,0.000027881806,0.000031557483,0.000009341295,0.000008976298,0.000031513493,0.98587906,0.009525522,0.0000021370415,0.000015369664,0.0044475812],"study_design_scores_gemma":[0.00025629668,0.0000705717,0.0000024558924,0.00010515772,0.00003258575,0.000009952944,1.16614494e-7,0.9555295,0.04194862,0.0011569725,0.00047710357,0.00041066043],"about_ca_topic_score_codex":0.000017201839,"about_ca_topic_score_gemma":0.00004206684,"teacher_disagreement_score":0.8179191,"about_ca_system_score_codex":0.00043005586,"about_ca_system_score_gemma":0.0029363264,"threshold_uncertainty_score":0.99988556},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034958746,0.0043777386,0.9801647,0.00006675951,0.00047362602,0.0005065313,0.000025925974,0.0000165699,0.010872256],"genre_scores_gemma":[0.76524454,0.0013601562,0.22351193,0.0009791068,0.00204115,0.000028817765,0.00041586527,0.00020248268,0.0062159714],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981253,0.000015972639,0.0003520056,0.0007370019,0.00042273878,0.00034695907],"domain_scores_gemma":[0.9989007,0.000016364722,0.0002023232,0.00067297096,0.00014804797,0.000059573413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037021737,0.0003000397,0.00031888465,0.00026972863,0.000061324776,0.00003990441,0.0007674781,0.00023398857,0.00003026161],"category_scores_gemma":[0.000017903249,0.0002921013,0.000107252825,0.00016120687,0.00037378678,0.000005426084,0.000497707,0.00019509307,0.00001127331],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040513478,0.00012406931,0.00068074284,0.00051049836,0.00015106157,0.00006546071,0.0003061162,0.045707706,0.32439077,0.00031764063,0.00011901512,0.6275864],"study_design_scores_gemma":[0.008014134,0.0057700593,0.0105835,0.0043570846,0.0004657147,0.00035294742,0.0000039187353,0.038174745,0.2621462,0.061681233,0.5977661,0.010684385],"about_ca_topic_score_codex":0.000018897987,"about_ca_topic_score_gemma":0.000033585475,"teacher_disagreement_score":0.7617487,"about_ca_system_score_codex":0.00006076464,"about_ca_system_score_gemma":0.00016082762,"threshold_uncertainty_score":0.9999531},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005070136,0.000039761602,0.9933189,0.00068389514,0.0010341295,0.0006416468,0.000007085217,0.00013037071,0.0041391244],"genre_scores_gemma":[0.0029308163,0.000006305027,0.99354875,0.0030806246,0.00022029685,0.000004120543,0.000008581402,0.000024073674,0.00017640773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942904,0.00006473928,0.00084239925,0.0010659074,0.0027719333,0.00096462114],"domain_scores_gemma":[0.9961019,0.0005848827,0.00018853317,0.0015305354,0.0011243621,0.0004697424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033636116,0.00044303449,0.00044724642,0.002978141,0.00030095785,0.0010310115,0.0037129815,0.00029628442,0.000075019234],"category_scores_gemma":[0.00031654438,0.00042214312,0.000096258635,0.0019038058,0.0005603797,0.0011387945,0.0017612781,0.0008529372,0.00021285505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035958556,0.000007983916,0.0000048812562,0.00001910833,0.0000024630738,0.000032446296,0.00016927025,0.51062715,0.000012229192,0.0026853476,0.000019327266,0.48641616],"study_design_scores_gemma":[0.00022049111,0.00011457081,0.000026310046,0.00018149502,0.0000027872914,0.000036647143,2.3397482e-7,0.99105906,0.0014165266,0.0028586425,0.0036289042,0.00045431816],"about_ca_topic_score_codex":0.00008762775,"about_ca_topic_score_gemma":0.000023201568,"teacher_disagreement_score":0.48596185,"about_ca_system_score_codex":0.0010675478,"about_ca_system_score_gemma":0.002243726,"threshold_uncertainty_score":0.99982303},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013228864,0.0011942224,0.9719631,0.0003241326,0.00077303627,0.0003046535,0.0000039746797,0.0004111277,0.025012527],"genre_scores_gemma":[0.059356585,0.00006749952,0.9376112,0.00094981847,0.00039956736,0.000018233759,0.000008383389,0.000052660707,0.0015360593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529296,0.000043877164,0.000588804,0.0019886603,0.0011033068,0.0009823986],"domain_scores_gemma":[0.99717075,0.00035769213,0.00040867086,0.0016161791,0.00020856167,0.00023813888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001170867,0.0006799462,0.00061156775,0.0009299111,0.0007072352,0.0010271881,0.0035118929,0.0004802299,0.000015788477],"category_scores_gemma":[0.00011155594,0.00066068803,0.00018545467,0.0007831108,0.00039945953,0.0009457737,0.0011010569,0.0016344447,0.00004258761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021114706,0.000021962094,0.000029692637,0.00004346094,0.00001085063,0.000031626343,0.0012945737,0.76874965,0.000029767889,0.01885602,0.000049505354,0.21088077],"study_design_scores_gemma":[0.00016379346,0.00005402798,0.000017008382,0.00081023463,0.000010002122,0.000115673225,1.8317813e-7,0.95629627,0.00012955934,0.041150786,0.00053020567,0.00072228425],"about_ca_topic_score_codex":0.000027351,"about_ca_topic_score_gemma":0.000007401121,"teacher_disagreement_score":0.2101585,"about_ca_system_score_codex":0.00038857892,"about_ca_system_score_gemma":0.00050235284,"threshold_uncertainty_score":0.99958444},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012712565,0.0015455922,0.98038685,0.000021613705,0.0014070263,0.000620661,0.000013245676,0.0017738773,0.0015185889],"genre_scores_gemma":[0.47366574,0.000043216958,0.52559716,0.00006925457,0.00036611783,0.000025310457,0.000017021466,0.00019685621,0.000019340345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977794,0.000004316177,0.00052501925,0.00056831166,0.0005395137,0.0005833845],"domain_scores_gemma":[0.9989469,0.000290848,0.000092886345,0.0004924119,0.00005223345,0.00012472272],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022153721,0.0005366668,0.00050303433,0.0006849909,0.000054819502,0.000098105644,0.0007355401,0.00032051376,0.000035089615],"category_scores_gemma":[0.000106658874,0.0005943528,0.00011647593,0.00041467743,0.00019826928,0.00021126377,0.00018204832,0.0010377617,0.000009295555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016680963,0.000011461301,0.000027511236,0.00017829167,0.000016333935,0.000033929962,0.0002193637,0.8440996,0.0032522443,0.000045282555,0.0000030999201,0.15211126],"study_design_scores_gemma":[0.00018479628,0.000110724504,0.00025252326,0.001699694,0.00001126639,0.000055081593,2.1212063e-7,0.97766054,0.016255792,0.00041481436,0.002601144,0.0007534368],"about_ca_topic_score_codex":0.000010906501,"about_ca_topic_score_gemma":0.0000036816898,"teacher_disagreement_score":0.46095318,"about_ca_system_score_codex":0.00029381592,"about_ca_system_score_gemma":0.000037255417,"threshold_uncertainty_score":0.9996508},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015850232,0.00024403475,0.9900646,0.0003104835,0.002189706,0.0005734449,0.0000054799107,0.00019573905,0.0064006615],"genre_scores_gemma":[0.012254354,0.00006390072,0.9862687,0.00064218766,0.00039804998,0.000028672117,0.0000065045856,0.000032264332,0.00030538882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691206,0.00005637028,0.000542134,0.0012835119,0.0007001813,0.0005057571],"domain_scores_gemma":[0.99712247,0.0007534555,0.00035598897,0.0013554518,0.00029256768,0.00012008688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013753372,0.00041975433,0.00040926112,0.0007814358,0.00027348005,0.00036512874,0.003036172,0.00038520803,0.000008303948],"category_scores_gemma":[0.00030878556,0.0004053532,0.00015826285,0.0004632004,0.0006518997,0.00091313187,0.00073277665,0.00056611915,0.000031973414],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009579374,0.000020195543,0.00001559804,0.00004015558,0.000007770276,0.000011075672,0.0011667663,0.0039112717,0.00018161768,0.09531643,0.00010561811,0.8992139],"study_design_scores_gemma":[0.00022941155,0.00016914848,0.00012735659,0.00020397779,0.0000054560905,0.000108616056,9.454464e-8,0.87295616,0.0019485716,0.10773594,0.015977766,0.0005374832],"about_ca_topic_score_codex":0.000007173167,"about_ca_topic_score_gemma":0.000009929507,"teacher_disagreement_score":0.89867646,"about_ca_system_score_codex":0.00026953133,"about_ca_system_score_gemma":0.00043064932,"threshold_uncertainty_score":0.99983984},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009962551,0.00019014617,0.97521484,0.00002684699,0.00038219892,0.00018918322,0.0000054541424,0.00025825476,0.023633456],"genre_scores_gemma":[0.82117265,0.00017689652,0.17738895,0.0002395962,0.0002569523,0.0000042805505,0.0000036254796,0.000087231485,0.00066980434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986524,0.000006806038,0.000245969,0.00040917605,0.00038206278,0.0003036158],"domain_scores_gemma":[0.9991193,0.00019467236,0.00006247441,0.00048847334,0.00006491914,0.00007020417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017686514,0.0003143721,0.0003397235,0.0005612786,0.000044712364,0.000039695715,0.00073070585,0.0002925991,0.00010535446],"category_scores_gemma":[0.0000143879515,0.00030144362,0.000079726306,0.00021393785,0.0002587881,0.00008796546,0.00009963185,0.00052200997,0.000014149634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008345464,0.000030166282,0.000009938464,0.000096077165,0.000028882592,0.00011676656,0.00052812335,0.5849656,0.0034303924,0.00797725,0.00052070036,0.40228778],"study_design_scores_gemma":[0.00026491118,0.00050677557,0.000011431297,0.0008501547,0.000020634378,0.000032376483,1.3900507e-7,0.85474306,0.05162975,0.08994472,0.001111084,0.00088497606],"about_ca_topic_score_codex":0.0000046957666,"about_ca_topic_score_gemma":0.000003271673,"teacher_disagreement_score":0.82107306,"about_ca_system_score_codex":0.00017724685,"about_ca_system_score_gemma":0.000045281056,"threshold_uncertainty_score":0.9999438},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036359567,0.00046847714,0.9956412,0.00015688718,0.0013092611,0.0004929582,0.0000011726055,0.0005307024,0.0010357575],"genre_scores_gemma":[0.49344566,0.0002180835,0.50561285,0.00010625821,0.00048135748,0.000037591275,0.000003200635,0.00007687641,0.000018133538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980286,0.0000054062693,0.0003611077,0.0006443187,0.00034246276,0.0006181019],"domain_scores_gemma":[0.9991643,0.00014476386,0.00003944429,0.0005280299,0.000041612348,0.00008188843],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00025152272,0.00039291405,0.00038152377,0.00037553563,0.000061572166,0.00007784318,0.00071736245,0.00080263155,0.0000133330095],"category_scores_gemma":[0.000051629973,0.0003679983,0.000063748186,0.0003966268,0.0006422378,0.0001542783,0.00016984282,0.0027058658,0.000010212941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000309597,0.0000054525685,0.000004419526,0.000019838906,0.0000018256004,0.000028057002,0.000023428534,0.57818186,0.00023939811,0.0013641906,5.03214e-7,0.42012793],"study_design_scores_gemma":[0.00014614733,0.00007058443,0.000075176686,0.00031840266,0.0000035897901,0.000021784415,7.823994e-8,0.9261742,0.0008888941,0.07129099,0.0005700849,0.00044004899],"about_ca_topic_score_codex":0.0000024251835,"about_ca_topic_score_gemma":0.0001319487,"teacher_disagreement_score":0.49308205,"about_ca_system_score_codex":0.00025777222,"about_ca_system_score_gemma":0.00003955079,"threshold_uncertainty_score":0.9998772},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004656535,0.00046705495,0.9918373,0.00011253057,0.0042961263,0.0011547491,0.000003661839,0.00077642925,0.00088647386],"genre_scores_gemma":[0.7829075,0.000047232053,0.21525563,0.0005697237,0.00093958527,0.00011647691,0.000009556248,0.00006171171,0.0000926161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951102,0.00006966797,0.0007162569,0.0019234873,0.0013158343,0.00086451165],"domain_scores_gemma":[0.99722475,0.00017537839,0.00046506274,0.0015542597,0.0003272797,0.00025327987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010515542,0.0006604114,0.0005894981,0.0012061758,0.000669264,0.0009045062,0.0024215505,0.00041049736,0.000029444684],"category_scores_gemma":[0.000035902805,0.0006280193,0.00024133165,0.0011233548,0.00049303693,0.0008021394,0.00094711257,0.0011097172,0.00011466189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018319473,0.000045673078,0.000002240115,0.0001383678,0.000007887892,0.000121198646,0.00015453338,0.11688291,0.00033507196,0.0046153595,0.0000054238344,0.87767303],"study_design_scores_gemma":[0.0006188797,0.00090856175,0.0000059774143,0.0013472625,0.000016041296,0.00023051072,3.5569002e-7,0.9220621,0.02776123,0.039835267,0.0062815202,0.00093227526],"about_ca_topic_score_codex":0.00010541088,"about_ca_topic_score_gemma":0.00013026707,"teacher_disagreement_score":0.87674075,"about_ca_system_score_codex":0.0014449309,"about_ca_system_score_gemma":0.0006637937,"threshold_uncertainty_score":0.9996171},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018806581,0.00011436386,0.9912645,0.00029003393,0.0036211824,0.00029698724,0.0000027140866,0.00026068938,0.002268836],"genre_scores_gemma":[0.5910766,0.000018374034,0.39644918,0.0005839136,0.0019031481,0.000010663734,0.0000037656798,0.0000638752,0.009890444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605054,0.00005038117,0.00058257533,0.0015471183,0.0010230596,0.0007463272],"domain_scores_gemma":[0.99705154,0.00073961186,0.00038476035,0.0012556582,0.00037330415,0.00019512932],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008072964,0.0005789569,0.00049783,0.0006865196,0.00057482166,0.001651237,0.0021711788,0.0004911107,0.000039678896],"category_scores_gemma":[0.0004909091,0.0005217732,0.00017501303,0.00043900605,0.00039858127,0.0011486936,0.0008997667,0.001945671,0.00007939795],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047959143,0.000022713772,0.00026382325,0.000040041177,0.000017386117,0.0005862691,0.0011162625,0.010033765,0.001364516,0.07602639,0.000006295791,0.91051775],"study_design_scores_gemma":[0.0014043796,0.0023047319,0.0028863328,0.005599999,0.00007995827,0.00566554,0.00000837728,0.43249714,0.09510999,0.118088886,0.32740366,0.008950988],"about_ca_topic_score_codex":0.00026733297,"about_ca_topic_score_gemma":0.0003039921,"teacher_disagreement_score":0.90156674,"about_ca_system_score_codex":0.00026394895,"about_ca_system_score_gemma":0.0006206241,"threshold_uncertainty_score":0.9997234},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012427091,0.00012674129,0.9962113,0.0014689703,0.00029253738,0.00031638108,0.0000036827203,0.00003820431,0.0014179177],"genre_scores_gemma":[0.6924952,0.00053658476,0.30630502,0.00041448264,0.00011995234,0.000011135943,0.000012498742,0.000014507128,0.00009058831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998419,0.000016562683,0.0003878528,0.00050397,0.0004078445,0.00026476276],"domain_scores_gemma":[0.99887395,0.0001899773,0.0002505469,0.0004684836,0.00016308254,0.0000539463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045126316,0.00019560783,0.00017195797,0.00025615658,0.00035668374,0.0002878968,0.0006880665,0.00010023497,0.00003590487],"category_scores_gemma":[0.000014593948,0.0001501592,0.00003716899,0.0003313904,0.00045063737,0.0005869777,0.00023328749,0.0002041068,0.0000046827126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039319148,0.000004992411,0.00031042637,0.000010212172,0.0000035976448,0.000001637662,0.00044970235,0.015595738,0.000009806995,0.06766925,0.000005149447,0.9159356],"study_design_scores_gemma":[0.00037486712,0.00014172148,0.0043854215,0.000088326444,0.000006741912,0.000050578437,0.0000020368557,0.8742951,0.00022620347,0.11813105,0.0019419371,0.0003560106],"about_ca_topic_score_codex":0.00005119695,"about_ca_topic_score_gemma":0.00091539114,"teacher_disagreement_score":0.91557956,"about_ca_system_score_codex":0.00008547995,"about_ca_system_score_gemma":0.00023541991,"threshold_uncertainty_score":0.6123315},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002267774,0.0007936184,0.9953503,0.00075595244,0.0011615079,0.0007522483,0.00001078662,0.00013347027,0.000815345],"genre_scores_gemma":[0.008196041,0.00014814956,0.9898888,0.0007406141,0.00046414477,0.00003477266,0.000021790169,0.000027882583,0.00047783463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666595,0.00002282906,0.00045655217,0.0015934629,0.0006894324,0.00057176757],"domain_scores_gemma":[0.99797815,0.00046638725,0.00023626933,0.0007111531,0.00040984477,0.00019819323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008830064,0.00047684566,0.0004438103,0.00089041376,0.0004171738,0.0006943009,0.0014466816,0.00027385962,0.000010323121],"category_scores_gemma":[0.000082124825,0.00046018188,0.00012811537,0.0007161767,0.00046151885,0.00091301603,0.00070861366,0.00042582283,0.0000064248225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008472478,0.000032121272,0.000016226226,0.000039088398,0.000012075362,0.000022113232,0.00018752932,0.41767937,0.00004156322,0.041430492,0.000065554814,0.5404654],"study_design_scores_gemma":[0.00033412746,0.00025403037,0.00007045958,0.0000958056,0.00000962469,0.00012062914,1.0487944e-7,0.86323476,0.00037689964,0.13202503,0.0029587594,0.0005197699],"about_ca_topic_score_codex":0.0000083723435,"about_ca_topic_score_gemma":0.000020987021,"teacher_disagreement_score":0.53994566,"about_ca_system_score_codex":0.00013490104,"about_ca_system_score_gemma":0.00041199007,"threshold_uncertainty_score":0.999785},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020972695,0.0018736246,0.99083614,0.0001713757,0.0038415077,0.00054869155,0.00001141221,0.00018546489,0.00043449205],"genre_scores_gemma":[0.9305059,0.00007540512,0.0681136,0.0001912275,0.00046657718,0.000008837396,0.000010241127,0.00004051161,0.0005877537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99547446,0.00006809399,0.0007325832,0.0015107741,0.0015747207,0.0006393695],"domain_scores_gemma":[0.99722356,0.00033054818,0.0005067133,0.0012399286,0.00045899136,0.000240267],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000792953,0.0005250531,0.0005600297,0.0022712217,0.0004289767,0.0008126927,0.00279938,0.00038956216,0.000010796465],"category_scores_gemma":[0.00006482596,0.0005044227,0.00017057583,0.0016565202,0.00055028,0.0006564754,0.00071291043,0.00055086496,0.00012039641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005036618,0.0016085334,0.0016820652,0.002434375,0.000252374,0.00089154346,0.41648814,0.061776336,0.014721236,0.027297368,0.00085311,0.47194454],"study_design_scores_gemma":[0.00025031558,0.000053506014,0.00008364524,0.00020291594,0.000009819597,0.00016581804,0.0000011262991,0.99543834,0.00048398165,0.0015575631,0.0011767346,0.0005762146],"about_ca_topic_score_codex":0.00010798246,"about_ca_topic_score_gemma":0.00000852089,"teacher_disagreement_score":0.933662,"about_ca_system_score_codex":0.0004890737,"about_ca_system_score_gemma":0.0006546863,"threshold_uncertainty_score":0.9997407},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6392081,0.00042308134,0.35929477,0.0007164736,0.00015242258,0.0001492927,0.0000039260376,0.00002722064,0.000024741894],"genre_scores_gemma":[0.9185586,0.000018583214,0.08083389,0.00043980285,0.00013613998,0.0000024350422,0.0000061698397,0.0000042357087,1.4415774e-7],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99866134,0.000023070565,0.0002183687,0.0003716745,0.00040399213,0.00032155018],"domain_scores_gemma":[0.99916637,0.00022091866,0.00009162036,0.00029944783,0.00010207417,0.000119573066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016056614,0.00012503473,0.00022645254,0.0002342373,0.00006204909,0.0000327713,0.00013489048,0.00006593662,0.000013262515],"category_scores_gemma":[0.0001600857,0.00009387989,0.00004879141,0.0009149806,0.00010973468,0.00012718879,0.0000455701,0.00014406806,0.0000029889754],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042405572,0.00027638758,0.30624273,0.000009015879,0.000013514293,0.0000496667,0.0013155289,0.021526847,0.044170033,0.00003437127,0.000008554633,0.62631094],"study_design_scores_gemma":[0.0009550363,0.00061435637,0.5803782,0.0001780873,0.000026043803,0.000013684456,0.0000016651713,0.1917307,0.22293216,0.003033116,0.000039142986,0.00009783779],"about_ca_topic_score_codex":0.00023888255,"about_ca_topic_score_gemma":0.00009977522,"teacher_disagreement_score":0.6262131,"about_ca_system_score_codex":0.000115460636,"about_ca_system_score_gemma":0.000116312585,"threshold_uncertainty_score":0.3828311},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045936247,0.000106117885,0.99337286,0.00010843713,0.0004480249,0.00027639035,0.000016902786,0.00014212882,0.0009355089],"genre_scores_gemma":[0.52323157,0.000010128584,0.47652707,0.000050741244,0.000090130976,0.0000010352919,0.000043212473,0.00002934794,0.000016764165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815017,0.000018855924,0.00038146402,0.00044915997,0.000734733,0.00026564658],"domain_scores_gemma":[0.9985854,0.0004895161,0.00020425279,0.0004577969,0.00020298995,0.000060042803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044106803,0.00029044464,0.00030678904,0.0005623818,0.00006559172,0.00015526386,0.00045370878,0.00019856343,0.00000920722],"category_scores_gemma":[0.00015027181,0.00026682104,0.000037746464,0.00034261626,0.0004262571,0.00016099658,0.000051812647,0.00034512772,0.000008293947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008088413,0.000005683676,0.000022100667,0.000032530366,0.0000072528674,0.000005981092,0.00027559843,0.38685733,0.00073010096,0.00007784749,0.000009526761,0.6119679],"study_design_scores_gemma":[0.00022725046,0.00018857663,0.0008158056,0.00057451264,0.000031843818,0.000057024517,5.9267325e-7,0.90842175,0.023094751,0.066073604,0.00008899321,0.0004252636],"about_ca_topic_score_codex":0.000009625353,"about_ca_topic_score_gemma":0.000022172248,"teacher_disagreement_score":0.6115427,"about_ca_system_score_codex":0.00015511837,"about_ca_system_score_gemma":0.00020167159,"threshold_uncertainty_score":0.9999784},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053611707,0.00090283214,0.9392349,0.00014310703,0.0002652036,0.0003014995,0.000029941339,0.000015059443,0.0054957327],"genre_scores_gemma":[0.9499982,0.000026331885,0.049167573,0.00018965437,0.0002389969,0.0000050836734,0.00008050845,0.000021784832,0.0002718946],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986532,0.000014805842,0.0002483777,0.00051892066,0.00033226368,0.00023243076],"domain_scores_gemma":[0.99925774,0.000029089775,0.00017235221,0.0003669896,0.00013350182,0.000040297928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021780995,0.00023399848,0.0002556561,0.00019642158,0.000053863783,0.000039088813,0.00055672636,0.00017928948,0.000013620711],"category_scores_gemma":[0.000008580858,0.0001962758,0.00006399826,0.0000961749,0.0006907448,0.000007036513,0.0003061094,0.00018772068,0.0000024746214],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002003301,0.00029369575,0.021651462,0.00052773335,0.00036029407,0.00028785315,0.00060376636,0.28797778,0.30314746,0.0026480039,0.00023276694,0.38206887],"study_design_scores_gemma":[0.0040161777,0.010422826,0.028525095,0.004549537,0.00024287404,0.0014122564,0.0000029825424,0.03458249,0.787341,0.113360934,0.009747389,0.005796468],"about_ca_topic_score_codex":0.00004496575,"about_ca_topic_score_gemma":0.00013572346,"teacher_disagreement_score":0.89638644,"about_ca_system_score_codex":0.00004545809,"about_ca_system_score_gemma":0.00017266686,"threshold_uncertainty_score":0.80038947},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021675033,0.00051179726,0.9967568,0.00015041021,0.00072402036,0.0003691578,0.00002949066,0.000018194056,0.0012233922],"genre_scores_gemma":[0.035586946,0.00020888483,0.9586436,0.0034460619,0.00109737,0.00003634401,0.00019525796,0.00007676217,0.00070873403],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973563,0.00001985095,0.00030503303,0.0015451837,0.00041122027,0.00036241734],"domain_scores_gemma":[0.9976579,0.00001508001,0.0001337851,0.0019379498,0.00008375277,0.00017151666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027156417,0.0003339484,0.00023699291,0.00023381725,0.00013260315,0.00010599581,0.0015424069,0.00030043576,0.000022942591],"category_scores_gemma":[0.000029809387,0.00031333018,0.00004430759,0.0001671156,0.00015817356,0.000007221248,0.0013304962,0.000229543,0.000017343753],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001365406,0.000014210538,0.000008232321,0.000013290186,0.0000057037955,0.000004930454,0.000058552414,0.01848679,0.41571796,0.000007607739,0.0005619396,0.5651071],"study_design_scores_gemma":[0.001074571,0.0003983375,0.00030718138,0.00048038882,0.00003487015,0.00010949458,0.0000017415947,0.11059304,0.67930514,0.004645941,0.20092699,0.002122307],"about_ca_topic_score_codex":0.0000029365906,"about_ca_topic_score_gemma":0.00002242776,"teacher_disagreement_score":0.5629848,"about_ca_system_score_codex":0.000062392304,"about_ca_system_score_gemma":0.00021200745,"threshold_uncertainty_score":0.9999319},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016057471,0.00033428086,0.99706805,0.0002486095,0.0009936688,0.00058633013,0.0000043608666,0.00023517232,0.00036898188],"genre_scores_gemma":[0.045232423,0.000011522526,0.9541576,0.00031163922,0.00020352728,0.00003339583,0.000014311431,0.000021454329,0.000014131373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953828,0.00016799668,0.0005166399,0.0012109393,0.0023789462,0.0003427183],"domain_scores_gemma":[0.99531096,0.00149949,0.0004889078,0.0015220395,0.0010476327,0.0001309875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006681326,0.00037988712,0.00039246902,0.00079337077,0.00014425063,0.0002447117,0.002493351,0.00038229272,0.00004086004],"category_scores_gemma":[0.00092123024,0.00035283406,0.00010415902,0.0006692358,0.00027378407,0.0016134166,0.00045842378,0.0008593755,0.000003974718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010810345,0.000089963425,0.00008929271,0.00005628934,0.000013708352,0.00000393624,0.0004216359,0.28046787,0.0011789375,0.01436932,0.000004172112,0.70329404],"study_design_scores_gemma":[0.00019450576,0.0001852677,0.0002324185,0.00029745232,0.000027247757,0.000020026799,8.53151e-8,0.9365241,0.0058559347,0.055994008,0.00031116308,0.00035777883],"about_ca_topic_score_codex":0.000034667242,"about_ca_topic_score_gemma":0.00001063971,"teacher_disagreement_score":0.7029363,"about_ca_system_score_codex":0.0002343564,"about_ca_system_score_gemma":0.0011185668,"threshold_uncertainty_score":0.99989235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006018251,0.00041294526,0.99357563,0.0004066223,0.0027077573,0.0009403447,0.0000018343943,0.00035440677,0.000998633],"genre_scores_gemma":[0.049703665,0.00013900062,0.9442382,0.0008942763,0.0045608897,0.000035326106,0.0000034016934,0.00007311155,0.00035215865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950441,0.0000780835,0.0008987107,0.0019975817,0.0007921772,0.0011893385],"domain_scores_gemma":[0.9964408,0.0013114123,0.0004483406,0.0013261249,0.00020447077,0.00026883555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001527386,0.00068664254,0.0007513278,0.0009770982,0.000507484,0.0006763586,0.0024310662,0.00091605785,0.00006049696],"category_scores_gemma":[0.00018854483,0.0007208675,0.00025073797,0.0016576279,0.0002060128,0.00093474734,0.00085822237,0.0014622334,0.000052604504],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038805498,0.000015286756,0.00002339962,0.00002363197,0.000008633291,0.000015645157,0.0004900716,0.09469235,0.00022152864,0.0044890195,0.000025556308,0.89995605],"study_design_scores_gemma":[0.0004481029,0.00040355988,0.00013490506,0.0007481519,0.000009961198,0.00005344178,1.5518357e-7,0.7414279,0.0015804296,0.25113034,0.0032780063,0.00078506],"about_ca_topic_score_codex":0.00013380652,"about_ca_topic_score_gemma":0.0019925984,"teacher_disagreement_score":0.899171,"about_ca_system_score_codex":0.00065611233,"about_ca_system_score_gemma":0.00050736434,"threshold_uncertainty_score":0.99952424},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10301396,0.000042208456,0.8953576,0.0011433912,0.00006229634,0.00030755906,0.0000032537273,0.00006412942,0.000005596578],"genre_scores_gemma":[0.53405285,0.0000034901798,0.4655664,0.00036187583,0.000006188264,0.000002959151,0.0000029608082,0.000002694576,6.2072354e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809694,0.000080614125,0.00034416173,0.0005479939,0.000684061,0.000246226],"domain_scores_gemma":[0.99853104,0.000120426594,0.00019471066,0.0010592921,0.000048321755,0.00004618231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008161318,0.00012086496,0.00013849536,0.00020639854,0.000073559226,0.00013806204,0.0024173749,0.000032704585,0.0000054072007],"category_scores_gemma":[0.000098562174,0.000086151646,0.000014522214,0.0014125799,0.00029104744,0.0013442874,0.00048391562,0.00017816029,0.0000014613823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030517197,0.00011198104,0.0014536848,0.000021016187,0.0000022650077,0.0000037921477,0.001325693,0.11196408,0.0209254,0.000041084575,0.000050314815,0.86409765],"study_design_scores_gemma":[0.00025020874,0.00003940808,0.0014970831,0.00006709803,0.0000017603405,0.00001619577,0.0000010976323,0.9125298,0.08449883,0.001005932,8.231777e-7,0.000091718284],"about_ca_topic_score_codex":0.000051168823,"about_ca_topic_score_gemma":0.0003459804,"teacher_disagreement_score":0.8640059,"about_ca_system_score_codex":0.00024516214,"about_ca_system_score_gemma":0.00029431834,"threshold_uncertainty_score":0.44921243},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026727014,0.00092605164,0.94754153,0.044707086,0.004792862,0.00055376405,0.000024285493,0.00012532104,0.0010617998],"genre_scores_gemma":[0.3512111,0.00012492161,0.53737724,0.08388746,0.02512841,0.0001069058,0.000037189522,0.00015759183,0.0019691817],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960745,0.0000928223,0.0004598607,0.0015303456,0.0011756993,0.0006667962],"domain_scores_gemma":[0.9953003,0.0012985885,0.00016986048,0.0028678614,0.00021571087,0.00014769332],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010440509,0.0005323203,0.00039761566,0.00018946627,0.00051508617,0.0010875317,0.009281164,0.0002948285,0.000036239337],"category_scores_gemma":[0.00006906488,0.00029633247,0.00016719732,0.0006915034,0.0007009249,0.00035679675,0.0019501247,0.0011781204,0.0003277258],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012781703,0.00004715267,0.0003995897,0.00001231718,0.000023676372,0.000056307486,0.0036306856,0.043360423,0.000072268806,0.012980812,0.015994113,0.9234099],"study_design_scores_gemma":[0.00038150046,0.00031573907,0.0061606704,0.0004131193,0.000034396864,0.00007303019,0.000002164171,0.18750244,0.00089928857,0.28184792,0.5206662,0.0017035493],"about_ca_topic_score_codex":0.00012884878,"about_ca_topic_score_gemma":0.0010990617,"teacher_disagreement_score":0.9217063,"about_ca_system_score_codex":0.00020315283,"about_ca_system_score_gemma":0.00033272157,"threshold_uncertainty_score":0.99994946},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025342321,0.00047734397,0.97036284,0.000046922472,0.00063182594,0.00041241638,0.0000045434595,0.00028199976,0.0024397643],"genre_scores_gemma":[0.9599008,0.000013531573,0.0395275,0.00021214595,0.00015767003,0.0000073396213,0.00000334936,0.000043600347,0.0001340817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765015,0.000017619974,0.00038994057,0.0006612257,0.0008307781,0.00045028108],"domain_scores_gemma":[0.99882007,0.00023545005,0.00014012642,0.00052533054,0.00015857926,0.00012045693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003323318,0.00047613593,0.00044638998,0.0003203075,0.00016727613,0.00031229228,0.00060223846,0.00020778658,0.000022202461],"category_scores_gemma":[0.000053191434,0.000379029,0.000058781603,0.00022831565,0.00022207412,0.00034956646,0.000058338675,0.0005545753,0.00001711486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023958453,0.0000039484885,0.0003849716,0.00006008911,0.000011616454,0.000031584572,0.001644413,0.7448014,0.00078615546,0.0002403001,0.000002420258,0.2520307],"study_design_scores_gemma":[0.00027761035,0.00022646594,0.002882538,0.001941977,0.000017985816,0.00006545867,0.000002651543,0.9899577,0.0019283313,0.0016688971,0.00019426648,0.0008361524],"about_ca_topic_score_codex":0.000021358248,"about_ca_topic_score_gemma":0.000105151674,"teacher_disagreement_score":0.93455845,"about_ca_system_score_codex":0.0002969824,"about_ca_system_score_gemma":0.00017078417,"threshold_uncertainty_score":0.9998662},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008520283,0.0009882393,0.99404734,0.0002663476,0.0029110333,0.00068162964,0.00019717032,0.00017320126,0.0006498605],"genre_scores_gemma":[0.04753038,0.00005267368,0.950701,0.00063471135,0.0006255361,0.000013861658,0.00016522498,0.00006290095,0.00021372865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994856,0.000028684826,0.00056871853,0.002564885,0.0011222984,0.0008593921],"domain_scores_gemma":[0.99486077,0.0005382336,0.0004503677,0.003646919,0.00030677408,0.00019695265],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012564525,0.0006411058,0.0006011797,0.0005973104,0.0004916425,0.0006798833,0.008785454,0.00033828645,0.000029548502],"category_scores_gemma":[0.00013526845,0.00053823786,0.00012178771,0.00039333405,0.00056236365,0.00079568574,0.0059770634,0.00070543104,0.000019836998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002499885,0.00004852106,0.00004610615,0.00011478656,0.000024441297,0.00006569579,0.0005346251,0.020586029,0.00009077287,0.071146,0.0001713098,0.9071467],"study_design_scores_gemma":[0.00033958425,0.00009266866,0.00024191894,0.00027179375,0.000013721858,0.00005895527,1.2176055e-7,0.89016926,0.000100611855,0.10277415,0.005280824,0.00065641257],"about_ca_topic_score_codex":0.000035547906,"about_ca_topic_score_gemma":0.00008149117,"teacher_disagreement_score":0.9064903,"about_ca_system_score_codex":0.00018322867,"about_ca_system_score_gemma":0.00062523683,"threshold_uncertainty_score":0.9997069},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037760334,0.00009525842,0.9952705,0.000086744476,0.0020450712,0.0010248161,0.0000062309205,0.000128293,0.00096551585],"genre_scores_gemma":[0.068477064,0.00001457673,0.9307645,0.0003998304,0.00017691254,0.000039931994,0.00001522991,0.000025984207,0.00008594679],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99523103,0.00020599877,0.00078392675,0.0010310418,0.0023897532,0.0003582322],"domain_scores_gemma":[0.99556327,0.00074375764,0.0008034444,0.00082285755,0.0019302884,0.00013637064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022860235,0.00038955463,0.0004546583,0.0011368714,0.00015000302,0.00033404172,0.0014763162,0.00017046169,0.00032758765],"category_scores_gemma":[0.00049014477,0.00037404682,0.00011911158,0.0006009306,0.0004808111,0.00166186,0.00061311485,0.0006118676,0.000032762637],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002918811,0.00003714458,0.000009466941,0.000016571503,0.000025877147,0.000004378983,0.0011994948,0.006894736,0.009310305,0.00024018735,0.000030911542,0.982228],"study_design_scores_gemma":[0.00030174607,0.00011621616,0.000052607495,0.0004408907,0.000051170984,0.00005033729,0.0000019738416,0.88947636,0.06450217,0.044656757,0.000013694912,0.0003360654],"about_ca_topic_score_codex":0.00014272124,"about_ca_topic_score_gemma":0.000046619647,"teacher_disagreement_score":0.98189193,"about_ca_system_score_codex":0.0011943008,"about_ca_system_score_gemma":0.0008436023,"threshold_uncertainty_score":0.99987113},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023959326,0.0052438215,0.9888623,0.00011916627,0.001316871,0.00085988035,0.0000012783617,0.00008979644,0.0011109598],"genre_scores_gemma":[0.7716352,0.0008129536,0.22635464,0.00076337,0.00028070106,0.000028640176,0.000009192966,0.00003554751,0.00007980275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947588,0.00010732005,0.00089197705,0.0015906243,0.0018674621,0.000783859],"domain_scores_gemma":[0.9966471,0.00029882803,0.00058806885,0.0017757143,0.000554348,0.00013591506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003232173,0.0005707649,0.0006946735,0.0008804867,0.00012853032,0.00023772795,0.004210384,0.0004889799,0.000019271658],"category_scores_gemma":[0.000034051955,0.0005491893,0.00011998306,0.0011714259,0.0004008835,0.00095380784,0.0010127163,0.0010027918,0.000013773912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039600222,0.000024493826,0.00014435957,0.00001931999,0.0000028299073,0.000006415003,0.00028956364,0.44015208,0.000008414371,0.00021968993,0.0000013752319,0.5591275],"study_design_scores_gemma":[0.0005973527,0.000205716,0.004723722,0.0010139581,0.000012296364,0.00001674066,1.5371127e-7,0.9857796,0.0000999384,0.006788448,0.00024831246,0.00051376515],"about_ca_topic_score_codex":0.000013875201,"about_ca_topic_score_gemma":0.0005204046,"teacher_disagreement_score":0.76923925,"about_ca_system_score_codex":0.00046930226,"about_ca_system_score_gemma":0.0005578314,"threshold_uncertainty_score":0.99969596},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009557751,0.00040036708,0.9960095,0.00082687865,0.00055764423,0.00037308142,0.000055894394,0.00005746558,0.000763362],"genre_scores_gemma":[0.75287163,0.000076190896,0.2462902,0.00026911552,0.00022339301,0.000007896693,0.000041757878,0.000024023419,0.00019578736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953845,0.00014066717,0.0009563551,0.001746853,0.0010410042,0.0007306268],"domain_scores_gemma":[0.99622935,0.0011979404,0.00045989148,0.0017801007,0.00012743246,0.00020531278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018514855,0.0004938163,0.0008178487,0.0005870648,0.000228162,0.0007528653,0.0031251253,0.00040537078,0.000007361175],"category_scores_gemma":[0.00032356998,0.00047177312,0.00005721603,0.0009888764,0.000290905,0.0018456345,0.002140877,0.0012599824,0.000010580724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032012096,0.000101878584,0.04330557,0.00006928197,0.000033537115,0.00003202228,0.0029965,0.4935072,0.000040125913,0.040609606,0.00010349674,0.41916877],"study_design_scores_gemma":[0.0001910404,0.000119342294,0.006339483,0.00075160596,0.0000129082155,0.000005591597,7.0270266e-7,0.8478808,0.000046996072,0.14396907,0.00013387209,0.0005486008],"about_ca_topic_score_codex":0.00022513776,"about_ca_topic_score_gemma":0.0011508808,"teacher_disagreement_score":0.7519159,"about_ca_system_score_codex":0.0003264609,"about_ca_system_score_gemma":0.0006293589,"threshold_uncertainty_score":0.9997734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000290462,0.0018058685,0.9937869,0.00045911042,0.0012861491,0.0005793336,0.000009018637,0.00014298166,0.001640193],"genre_scores_gemma":[0.76510763,0.0003828077,0.23232564,0.00059230113,0.0005821431,0.000030474577,0.0000048954853,0.00009757176,0.0008765246],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99469334,0.00015066293,0.0007793044,0.0013463697,0.0016387171,0.0013915786],"domain_scores_gemma":[0.9925537,0.00405246,0.00060354505,0.0022090531,0.00035932634,0.00022190464],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0025504304,0.0005978987,0.00067705393,0.0015058159,0.00059414835,0.00046527106,0.00689692,0.00031777186,0.000030446976],"category_scores_gemma":[0.0005263593,0.00040265647,0.0002094431,0.0022076077,0.0018274493,0.00075134804,0.0015660563,0.0012870702,0.000021493179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007842974,0.00003211438,0.00017660773,0.000058465816,0.000035541994,0.00009040796,0.0012690835,0.0030853464,0.0004952398,0.2303097,0.000019260351,0.7643498],"study_design_scores_gemma":[0.00080226327,0.0006078801,0.0006924074,0.0010835452,0.000024397053,0.00030605707,0.0000024567294,0.12755285,0.004654925,0.85593504,0.0068314294,0.0015067726],"about_ca_topic_score_codex":0.000009841397,"about_ca_topic_score_gemma":0.00012969498,"teacher_disagreement_score":0.7648172,"about_ca_system_score_codex":0.00025238626,"about_ca_system_score_gemma":0.00062085997,"threshold_uncertainty_score":0.9998425},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02499486,0.00041993376,0.97114956,0.0012731802,0.00084228645,0.000768101,0.000014243366,0.00007346478,0.00046436006],"genre_scores_gemma":[0.95656294,0.000021693828,0.04238561,0.0006832216,0.00027050526,0.000017567176,0.000017397375,0.00001950524,0.000021551878],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979392,0.00001941208,0.00036336615,0.0008298749,0.0005749995,0.00027311716],"domain_scores_gemma":[0.9980806,0.0001597134,0.00041619784,0.0008449059,0.00044526183,0.000053334865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037061254,0.00029400812,0.0002771528,0.00035486426,0.0002542439,0.00028873773,0.0020398044,0.00017593651,0.000002989807],"category_scores_gemma":[0.000012145373,0.0002138168,0.00006197803,0.00079629,0.000292629,0.0004979385,0.0004750325,0.00022364926,0.0000015412526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007455947,0.00017339404,0.0008933413,0.0045174086,0.000056194145,0.00001046546,0.050682977,0.124642015,0.02815008,0.12231048,0.0000033408055,0.66848576],"study_design_scores_gemma":[0.0014237744,0.00023714128,0.005925533,0.0034730036,0.000067963716,0.00007690313,0.00001798317,0.26967946,0.1463742,0.570636,0.00081450667,0.001273605],"about_ca_topic_score_codex":0.000061684164,"about_ca_topic_score_gemma":0.00020048149,"teacher_disagreement_score":0.9315681,"about_ca_system_score_codex":0.00008023628,"about_ca_system_score_gemma":0.00042598668,"threshold_uncertainty_score":0.87191963},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003439249,0.0011308681,0.9755438,0.000549654,0.0025714007,0.0011949441,0.0000049367504,0.00039432815,0.01857565],"genre_scores_gemma":[0.057857517,0.00016080288,0.93284976,0.003233646,0.0019377324,0.00015447152,0.000042473494,0.000103554805,0.003660065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495715,0.00004159512,0.0006359251,0.0022477144,0.0008573491,0.001260289],"domain_scores_gemma":[0.99669963,0.00043386887,0.00039730422,0.0016503193,0.00052352983,0.00029535338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008453818,0.00080264534,0.0008382146,0.0006607979,0.0004528667,0.0009048986,0.004802541,0.0005118144,0.0000354942],"category_scores_gemma":[0.00011302495,0.0006622045,0.00030999086,0.0009829015,0.00083574426,0.00047327921,0.0014379912,0.0006910333,0.00009262622],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011252236,0.000107111715,0.00009510015,0.00006549371,0.000021197367,0.00008746744,0.00056099583,0.003214079,0.000039481765,0.100300826,0.00019575395,0.8953012],"study_design_scores_gemma":[0.0008219556,0.0007900911,0.000088668785,0.0003063186,0.00002054677,0.00022197423,2.9026697e-7,0.5098639,0.0002030373,0.42744753,0.058863137,0.0013725616],"about_ca_topic_score_codex":0.000018729044,"about_ca_topic_score_gemma":0.0001429604,"teacher_disagreement_score":0.8939287,"about_ca_system_score_codex":0.00033086285,"about_ca_system_score_gemma":0.00067284424,"threshold_uncertainty_score":0.99958295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015003952,0.001667764,0.99476594,0.00022011166,0.0003513258,0.00027561115,0.000013252043,0.000011303399,0.0011942727],"genre_scores_gemma":[0.9453931,0.0002793949,0.050226737,0.0014543802,0.00081042986,0.00003132817,0.00019990136,0.00003919578,0.0015655315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784184,0.000043124262,0.00032085777,0.0010875072,0.00039874396,0.0003079099],"domain_scores_gemma":[0.9990451,0.000040252486,0.0001596745,0.0004939464,0.00019096445,0.00007009311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029392366,0.00027558152,0.00024070317,0.00037496566,0.00007569687,0.00013137088,0.00071494485,0.00027838934,0.000007805551],"category_scores_gemma":[0.00009677098,0.0002638647,0.000081306534,0.00052346865,0.0004186294,0.000019118464,0.00031694936,0.00038098812,0.000006406815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048609054,0.000052018968,0.0001851961,0.000041010164,0.000011099436,0.000020660496,0.0006197796,0.935902,0.011349902,0.0010945117,0.00017744944,0.05049774],"study_design_scores_gemma":[0.002252873,0.0012008101,0.0072651845,0.0030389917,0.00004146571,0.00024970953,0.000027740281,0.15099812,0.28549916,0.53504544,0.0106950775,0.0036854423],"about_ca_topic_score_codex":0.000029221783,"about_ca_topic_score_gemma":0.000068006375,"teacher_disagreement_score":0.94453925,"about_ca_system_score_codex":0.0017528165,"about_ca_system_score_gemma":0.0047194506,"threshold_uncertainty_score":0.99998134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40559748,0.00005735449,0.59375596,0.000060546263,0.00023052262,0.00019527561,0.000013670577,0.00006209497,0.000027118556],"genre_scores_gemma":[0.90162253,0.0000060781317,0.09794317,0.00003077356,0.0003083455,0.0000317021,0.00004555468,0.000011280926,5.4899965e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888223,0.000009877313,0.0002348735,0.00039789412,0.00014750971,0.0003275922],"domain_scores_gemma":[0.99920756,0.00027241916,0.000029911653,0.00042168002,0.000033735425,0.000034699362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002885863,0.00012369522,0.00013688563,0.00013729204,0.00010833922,0.00009895325,0.0005502192,0.000049908605,0.000003272005],"category_scores_gemma":[0.000039570434,0.00011933733,0.000017970213,0.0005549405,0.00012194547,0.00025296825,0.000053756234,0.00014432405,0.000003196844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003152341,0.00004334227,0.00050068094,0.00001530822,0.0000017471739,4.8319885e-7,0.00022825309,0.41061044,0.5595393,0.000119557066,0.000008254458,0.02892947],"study_design_scores_gemma":[0.00045885387,0.000017149467,0.010821291,0.00004864088,0.0000040518903,0.000022068027,0.000002313602,0.85528153,0.12965138,0.0030175,0.00043402112,0.00024122527],"about_ca_topic_score_codex":0.00006875417,"about_ca_topic_score_gemma":0.00042454546,"teacher_disagreement_score":0.49602506,"about_ca_system_score_codex":0.000109513,"about_ca_system_score_gemma":0.000037629736,"threshold_uncertainty_score":0.48664352},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5016997,0.00019851852,0.496817,0.0006624968,0.00021252471,0.00033009454,0.0000060904695,0.00003604634,0.000037562244],"genre_scores_gemma":[0.96254224,0.00002867421,0.033772927,0.0034924068,0.00011688908,0.000014495631,0.000015813623,0.000014565301,0.0000019649553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975795,0.0000485678,0.0003596585,0.00073135033,0.00063233456,0.00064856344],"domain_scores_gemma":[0.99883634,0.0002627151,0.00006360726,0.0004721803,0.000094725976,0.00027040797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055398466,0.00025332614,0.00050529133,0.0004474213,0.000097045566,0.00008523207,0.00021664094,0.00007537041,0.0000049564815],"category_scores_gemma":[0.00028724014,0.0002197017,0.00037586293,0.0012524514,0.000071072034,0.00022528495,0.00011944644,0.00017870747,0.0000108222375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043977496,0.00016105232,0.058600735,0.000010849252,0.00002106991,0.000027173433,0.00034091744,0.8827768,0.0017788752,0.000011689421,0.000096133015,0.05613076],"study_design_scores_gemma":[0.00047207504,0.00006135813,0.09516356,0.00012635496,0.00003852233,0.000005246212,0.0000018621955,0.8979333,0.0025122385,0.0034315346,0.0000022525012,0.0002516702],"about_ca_topic_score_codex":0.000063025545,"about_ca_topic_score_gemma":0.0000023017055,"teacher_disagreement_score":0.46304405,"about_ca_system_score_codex":0.00038145858,"about_ca_system_score_gemma":0.00046067793,"threshold_uncertainty_score":0.89591753},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027006597,0.0010218949,0.9931166,0.00012920666,0.001384315,0.00034683556,0.00002020848,0.000071822076,0.0036390184],"genre_scores_gemma":[0.09347024,0.00026827105,0.9046338,0.00045588677,0.0007345062,0.000020538631,0.000036916994,0.00003929569,0.00034050006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949599,0.000090284644,0.0005286032,0.0011766624,0.0028277866,0.00041678647],"domain_scores_gemma":[0.9967347,0.00021587643,0.00037223872,0.0017281183,0.0008062443,0.00014284639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017197139,0.0003747753,0.00044078857,0.00063856377,0.00024121595,0.00013804255,0.0029812395,0.0002616035,0.000048907463],"category_scores_gemma":[0.00012863465,0.00031360413,0.00011620955,0.00043799853,0.0004896324,0.00071085873,0.001826031,0.00048158437,0.000019268533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023091957,0.00003073294,0.000010059731,0.000012245467,0.000009482285,0.000022268609,0.0006792716,0.06340106,0.00067873707,0.0023892194,0.0003798235,0.9323848],"study_design_scores_gemma":[0.00031106902,0.00008565214,0.00016322896,0.00032834234,0.000015252584,0.000057461384,6.822678e-8,0.9461281,0.003208793,0.047371134,0.0019453428,0.00038557025],"about_ca_topic_score_codex":0.000037166046,"about_ca_topic_score_gemma":0.000013432058,"teacher_disagreement_score":0.9319992,"about_ca_system_score_codex":0.00022298981,"about_ca_system_score_gemma":0.0011450088,"threshold_uncertainty_score":0.99993163},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017159001,0.000084002226,0.9963186,0.000080310245,0.0002748004,0.00056065765,0.0000034144653,0.00012081716,0.00084150484],"genre_scores_gemma":[0.2251543,0.000037051417,0.7744118,0.00031976157,0.000048031274,0.0000034858833,0.000007084694,0.000008937513,0.000009574419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973549,0.00003107795,0.0008321604,0.00057308935,0.0008205762,0.00038814396],"domain_scores_gemma":[0.998173,0.00015672685,0.000678418,0.00065043673,0.000272272,0.00006914238],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071521767,0.00036239164,0.00047954693,0.0013333973,0.000095079784,0.00030295004,0.0014235355,0.00020723134,0.000006814948],"category_scores_gemma":[0.000095995536,0.0003428304,0.00008032973,0.0009789879,0.00036886818,0.0043580844,0.00036708583,0.00042641364,0.000006296546],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034882273,0.000016118067,0.000073087795,0.000092361355,0.000002645065,0.00002388896,0.001235006,0.006065234,0.0027095408,0.0005136668,0.0000020250184,0.98926294],"study_design_scores_gemma":[0.00024712732,0.00025510264,0.00055784086,0.0009283836,0.000004778997,0.000031266878,9.588049e-7,0.821437,0.086759105,0.08930927,0.00002358403,0.000445573],"about_ca_topic_score_codex":0.0000815266,"about_ca_topic_score_gemma":0.000030593477,"teacher_disagreement_score":0.9888174,"about_ca_system_score_codex":0.000420108,"about_ca_system_score_gemma":0.0005790983,"threshold_uncertainty_score":0.99990237},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037655187,0.00074234424,0.9868192,0.00029878615,0.00065780454,0.00024087481,0.000008204048,0.0001294913,0.011065633],"genre_scores_gemma":[0.08695605,0.0004519597,0.9098538,0.0012119311,0.00054134475,0.000015969115,0.00001515396,0.00004004933,0.0009137412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997474,0.000019942529,0.0003458188,0.0012451346,0.0005245391,0.00039054328],"domain_scores_gemma":[0.99826574,0.00019023183,0.00017258538,0.00114822,0.00009059795,0.00013264568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003690962,0.00034569195,0.00034494826,0.00043724148,0.00021567462,0.00023753557,0.0009870665,0.0001827205,0.000015690897],"category_scores_gemma":[0.000033070246,0.00030703846,0.000046066492,0.00031044328,0.0005595748,0.0008628697,0.0005814069,0.0004040377,0.00005122702],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024573958,0.000006661567,0.000015046256,0.00002305654,0.0000030594902,0.00003257204,0.00041109094,0.0009275611,0.00012952412,0.19006802,0.00001242957,0.8083685],"study_design_scores_gemma":[0.00052106567,0.00028922607,0.000897465,0.0010602013,0.0000111607915,0.00039765268,6.6035676e-7,0.47166917,0.0011425468,0.43679476,0.08543333,0.0017827619],"about_ca_topic_score_codex":0.000014321149,"about_ca_topic_score_gemma":0.00006497513,"teacher_disagreement_score":0.8065858,"about_ca_system_score_codex":0.000111061825,"about_ca_system_score_gemma":0.0002557942,"threshold_uncertainty_score":0.9999382},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2707178,0.0014603438,0.72623235,0.00023297372,0.00024606808,0.00052247505,0.00023976037,0.0000687087,0.00027950146],"genre_scores_gemma":[0.9829724,0.00003202279,0.015978476,0.000627702,0.00033462545,0.0000028071327,0.000011257386,0.000030068692,0.000010668997],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99757016,0.000044045562,0.00043094318,0.0010257172,0.00045000637,0.00047912367],"domain_scores_gemma":[0.99800414,0.00084724557,0.0002575636,0.0004443113,0.00014221003,0.00030450273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041442915,0.0004426398,0.0007669747,0.00028435397,0.00026957772,0.00027675056,0.00022023534,0.00016069683,0.0000124764865],"category_scores_gemma":[0.00028309438,0.00037314728,0.000051123214,0.00018164914,0.0008797475,0.00024345436,0.0002051214,0.00051267137,8.532396e-7],"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.00002795303,0.000023640336,0.75801027,0.0005108589,0.00006864656,0.0039554555,0.00033533538,0.00040826085,0.00030368924,0.00010672818,0.0000021545977,0.23624703],"study_design_scores_gemma":[0.0049729203,0.0010564572,0.6676929,0.01138389,0.0006023324,0.012223092,0.000013389909,0.28144297,0.00024465902,0.016913833,0.00038171638,0.003071843],"about_ca_topic_score_codex":0.00015418752,"about_ca_topic_score_gemma":0.00015494403,"teacher_disagreement_score":0.7122546,"about_ca_system_score_codex":0.00010853021,"about_ca_system_score_gemma":0.00019607705,"threshold_uncertainty_score":0.999872},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013563558,0.0005285541,0.99696493,0.00013089005,0.0006361845,0.00035513277,0.0000016094165,0.00046006462,0.00078701274],"genre_scores_gemma":[0.023111533,0.000037183156,0.97626144,0.00023941768,0.00008325251,0.000007759327,0.0000021418036,0.000028042235,0.000229247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965534,0.000021283664,0.00074047904,0.0012087658,0.0009462381,0.00052979443],"domain_scores_gemma":[0.9977039,0.00014182732,0.00032170222,0.0014418763,0.00026089975,0.00012978805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081150525,0.00053655275,0.00062486256,0.00096691947,0.00010921251,0.00020447349,0.0041913507,0.00029927437,0.00001720288],"category_scores_gemma":[0.000017163336,0.00050059624,0.00009602052,0.0004924775,0.00034824468,0.0005044437,0.0014178287,0.00060831424,0.000017163578],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023440243,0.000019575518,0.000006767358,0.000036759084,0.000008799013,0.000015021524,0.0008025267,0.006746624,0.00031999685,0.013819407,0.000017916853,0.97820425],"study_design_scores_gemma":[0.0007293956,0.00086803455,0.00048459266,0.0051964433,0.000021727976,0.00011773151,1.1331795e-7,0.48442343,0.2781624,0.09121954,0.1352851,0.003491519],"about_ca_topic_score_codex":0.000004433341,"about_ca_topic_score_gemma":0.000013893497,"teacher_disagreement_score":0.9747127,"about_ca_system_score_codex":0.00028971033,"about_ca_system_score_gemma":0.0006441511,"threshold_uncertainty_score":0.9997446},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015796488,0.0004727642,0.9941391,0.00009693557,0.0007935197,0.0002490379,0.000016376556,0.0000686838,0.0025839522],"genre_scores_gemma":[0.43012252,0.00011076335,0.56867236,0.0004097844,0.00018883587,0.000008868448,0.000005490921,0.000040673363,0.00044067847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719995,0.00002520371,0.0004857658,0.0010769594,0.00079048355,0.000421659],"domain_scores_gemma":[0.99801785,0.00042086173,0.00034396152,0.000999609,0.00010557844,0.000112129404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041733793,0.00041314078,0.000507271,0.00052583753,0.00021325922,0.000159934,0.0009371846,0.00013667767,0.000010420558],"category_scores_gemma":[0.000056382803,0.00035035628,0.00006530587,0.00027523955,0.0005940231,0.00045429304,0.0010794955,0.00039564265,0.000010807101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008330569,0.00004257561,0.0000328764,0.00016796708,0.000015192048,0.00008364744,0.0023707272,0.07624183,0.0003195105,0.5371643,0.000008612779,0.38354445],"study_design_scores_gemma":[0.0013601589,0.0012312379,0.00044938308,0.007995504,0.000027646933,0.00030835142,0.000005168989,0.6298918,0.008289869,0.3401971,0.007269865,0.0029739165],"about_ca_topic_score_codex":0.000046719848,"about_ca_topic_score_gemma":0.00002480582,"teacher_disagreement_score":0.55365,"about_ca_system_score_codex":0.00011862455,"about_ca_system_score_gemma":0.00009444307,"threshold_uncertainty_score":0.99989486},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006122766,0.0018151175,0.99492776,0.0009768807,0.0005766442,0.0006586914,0.000003047277,0.00009876415,0.00033082024],"genre_scores_gemma":[0.17821717,0.00022866664,0.8164368,0.0046533444,0.00021281271,0.00006483488,0.000003936683,0.00004747655,0.00013492296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965862,0.00004245533,0.00044412,0.0016550613,0.00065729616,0.00061485876],"domain_scores_gemma":[0.9982058,0.00027784007,0.00014755067,0.0009855402,0.00014616747,0.00023711755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006411831,0.00045223665,0.00045144375,0.0015089624,0.00019082264,0.00032707368,0.0018962856,0.00028721945,0.000004906184],"category_scores_gemma":[0.00008548823,0.0004243695,0.00008061717,0.0016680235,0.00026784086,0.00032855655,0.00087160093,0.00058297504,0.00002829808],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003692875,0.000044855304,0.0003791106,0.00007065364,0.0000072192893,0.000068700276,0.0006660073,0.0282893,0.00024200324,0.015720071,0.00001579514,0.95449257],"study_design_scores_gemma":[0.0009003416,0.0005144479,0.006687648,0.00081805344,0.000024035045,0.00033736666,5.7623504e-7,0.58265334,0.0037445407,0.39343864,0.00838553,0.0024954507],"about_ca_topic_score_codex":0.000022841245,"about_ca_topic_score_gemma":0.00013744479,"teacher_disagreement_score":0.95199716,"about_ca_system_score_codex":0.00014763334,"about_ca_system_score_gemma":0.00019472525,"threshold_uncertainty_score":0.9998208},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000064356727,0.00009872233,0.9902397,0.0013623952,0.00079403823,0.0005205446,0.0000026083396,0.0005361216,0.0064394637],"genre_scores_gemma":[0.027964668,0.000012244025,0.963536,0.007935995,0.00032053093,0.000023781085,0.0000246213,0.000034528563,0.00014760923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536586,0.00008995622,0.0006413895,0.001961262,0.0013241831,0.0006173247],"domain_scores_gemma":[0.99680287,0.0002452095,0.00037058783,0.0019801552,0.0002694708,0.00033171222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009912248,0.00052655325,0.0004904674,0.00087608595,0.00023850526,0.0005892867,0.0042718807,0.000411209,0.0000877991],"category_scores_gemma":[0.00013441285,0.00049782934,0.0001121657,0.0006784652,0.001477117,0.0010777406,0.00060914806,0.00096510316,0.000023741915],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006531955,0.00014160616,0.0000162163,0.00007884138,0.000008459021,0.00028434006,0.00048645746,0.012634685,0.0002845664,0.18770567,0.00009643112,0.7982562],"study_design_scores_gemma":[0.00059984403,0.0005594382,0.000055700606,0.0001932509,0.000010526314,0.00017419853,2.5706635e-7,0.5582787,0.011034205,0.4275638,0.00051541807,0.0010146645],"about_ca_topic_score_codex":0.000039234536,"about_ca_topic_score_gemma":0.00002407961,"teacher_disagreement_score":0.7972415,"about_ca_system_score_codex":0.00035307018,"about_ca_system_score_gemma":0.0014391068,"threshold_uncertainty_score":0.99974734},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053282715,0.0005687972,0.94408137,0.00013239306,0.0004620356,0.0008406029,0.00015210084,0.000002449602,0.00047752305],"genre_scores_gemma":[0.8539661,0.000029440265,0.14545067,0.00021853569,0.00014587387,0.000028012766,0.00006341219,0.00002105614,0.00007686216],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99853235,0.000022522618,0.0002780237,0.0005273202,0.000408101,0.00023168644],"domain_scores_gemma":[0.9988911,0.000096425596,0.00020698569,0.00037971078,0.00038817673,0.000037566333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076353754,0.00023292925,0.00026486255,0.00015431839,0.00006049003,0.000024675532,0.00034029622,0.00019829084,0.00001028012],"category_scores_gemma":[0.000095700714,0.0001978046,0.000040055587,0.00006708913,0.00037262388,0.000001494244,0.00014268416,0.00014509034,3.4889095e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054334186,0.0002830761,0.009609384,0.0004751053,0.00019680677,0.00001137389,0.0012772096,0.29988208,0.32977787,0.0016229061,0.00019186006,0.356129],"study_design_scores_gemma":[0.0073520737,0.004825055,0.011364049,0.0008573437,0.00027247405,0.000017550448,0.0000069321572,0.23607956,0.58340985,0.1457457,0.007673127,0.0023962709],"about_ca_topic_score_codex":0.000016904401,"about_ca_topic_score_gemma":0.00078964414,"teacher_disagreement_score":0.80068344,"about_ca_system_score_codex":0.00004205106,"about_ca_system_score_gemma":0.0004517673,"threshold_uncertainty_score":0.8066238},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005451468,0.00032817485,0.9964947,0.00022220875,0.001795529,0.00064540934,0.000012661269,0.00035202777,0.000094793366],"genre_scores_gemma":[0.0390442,0.0000064422247,0.96002096,0.0003963126,0.00023369984,0.000048207246,0.0000110568235,0.00004993004,0.00018920763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965105,0.000032697695,0.000580145,0.0013350016,0.0009406538,0.00060102],"domain_scores_gemma":[0.99561256,0.0023827723,0.00033288833,0.0012564724,0.00032437005,0.00009095436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079354487,0.00058556674,0.00070054247,0.00083289616,0.0001848266,0.00014556634,0.002284615,0.00033490433,0.0000015745989],"category_scores_gemma":[0.00044996274,0.00051033584,0.00021913226,0.00041166425,0.00065251446,0.00046175823,0.000531968,0.00058923534,0.0000034942145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026464459,0.0000304729,0.0000025834818,0.00009479076,0.000007723563,0.0000054279167,0.00007207645,0.88954735,0.00031728993,0.002568429,0.000033938195,0.10729347],"study_design_scores_gemma":[0.00038036323,0.00017127187,0.000025554486,0.0010079715,0.0000070155397,0.000006287659,8.795746e-8,0.84734124,0.01129175,0.13906565,0.00013429506,0.00056850637],"about_ca_topic_score_codex":0.0000065724107,"about_ca_topic_score_gemma":0.000006729544,"teacher_disagreement_score":0.13649723,"about_ca_system_score_codex":0.0002908889,"about_ca_system_score_gemma":0.00048726122,"threshold_uncertainty_score":0.9997348},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011364051,0.00039669787,0.99090946,0.004982494,0.0010125812,0.0008809799,0.000006745343,0.00042949576,0.0013803878],"genre_scores_gemma":[0.001648923,0.00007583668,0.9943288,0.0010221722,0.0014694749,0.00006747741,0.0000066929347,0.000028679127,0.0013519566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967792,0.00004407419,0.0004152925,0.0014893058,0.0007582843,0.00051386445],"domain_scores_gemma":[0.9979419,0.0005061643,0.0003011757,0.00072167633,0.00039189754,0.00013718133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010881348,0.00045187376,0.00043929377,0.0009232137,0.00034762901,0.0006129936,0.001903161,0.0005767052,0.00001838413],"category_scores_gemma":[0.00010650113,0.00039708722,0.0002633032,0.0008320894,0.0003518936,0.00079258566,0.00033136134,0.0008857533,0.000009543023],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014551311,0.000029499972,0.0000025090992,0.00002734666,0.000008412798,0.000007354957,0.0001395025,0.00012878,0.0011233815,0.03409193,0.00009464204,0.9643321],"study_design_scores_gemma":[0.00040742103,0.0004490237,0.00011856986,0.0002229754,0.000023727087,0.000290849,2.2064944e-7,0.68099517,0.02461299,0.18507284,0.106822714,0.0009835175],"about_ca_topic_score_codex":0.000008228177,"about_ca_topic_score_gemma":0.00003234915,"teacher_disagreement_score":0.96334857,"about_ca_system_score_codex":0.0002884832,"about_ca_system_score_gemma":0.00046587715,"threshold_uncertainty_score":0.9998481},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037393656,0.003758604,0.994016,0.00013786631,0.000993935,0.00061543146,0.000002395878,0.00031535362,0.0001230291],"genre_scores_gemma":[0.14905109,0.0017960707,0.8484161,0.00016839597,0.0003977859,0.000057391942,0.000007375217,0.00007764084,0.000028177798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839735,0.0000066867833,0.00035761044,0.0004971716,0.00023317988,0.00050798507],"domain_scores_gemma":[0.9980021,0.0013847509,0.000069863156,0.0004490936,0.00005577539,0.000038402013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002622665,0.00033351473,0.00037540495,0.00029190493,0.000145908,0.000070794005,0.00084603403,0.00032527084,0.0000043205314],"category_scores_gemma":[0.00016044307,0.00026247796,0.00006865677,0.0004373879,0.00055458926,0.00012482212,0.00017194793,0.0007510077,0.0000012491797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035197381,0.0000028583613,0.0000014767026,0.000012744214,0.0000044818817,0.000012535396,0.00004372352,0.7752516,0.0000015088485,0.00021149477,0.000020277412,0.22443374],"study_design_scores_gemma":[0.00014316833,0.000045881585,0.000011613909,0.00015070834,0.000010556177,0.000017953891,2.1516703e-7,0.9954055,0.000012567654,0.0031077212,0.00080084574,0.0002932794],"about_ca_topic_score_codex":0.0000014108077,"about_ca_topic_score_gemma":0.000064402164,"teacher_disagreement_score":0.22414045,"about_ca_system_score_codex":0.00025664602,"about_ca_system_score_gemma":0.000041663152,"threshold_uncertainty_score":0.9999827},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08722935,0.000015612355,0.9108491,0.00020005685,0.00094934733,0.00046361174,4.913706e-7,0.00028812382,0.0000042844645],"genre_scores_gemma":[0.4564702,9.808955e-7,0.54293257,0.0004906119,0.000088449306,0.0000104079445,0.0000011978838,0.000005247552,3.138943e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997167,0.00012598211,0.00043568332,0.0010251391,0.00076602824,0.00048017118],"domain_scores_gemma":[0.9979611,0.00038532476,0.00017771205,0.0009945066,0.00027113777,0.00021019498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013320143,0.00019430013,0.00020660408,0.0010159819,0.00027514706,0.00071981875,0.0019890333,0.00010447329,0.000026110993],"category_scores_gemma":[0.0013378252,0.00017916012,0.000038807317,0.0051702564,0.00048171362,0.002236585,0.0005429503,0.00046447874,0.0000092950695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011731647,0.00017070312,0.0023252668,0.0000245262,0.0000016902733,0.000020439442,0.0015588063,0.013683505,0.16559114,0.00016801864,0.0000016657334,0.8164531],"study_design_scores_gemma":[0.0001891855,0.00005975594,0.004170049,0.00004957352,0.000001358582,0.00003825752,0.0000012080413,0.9060115,0.08584989,0.0034291956,8.102466e-7,0.00019918742],"about_ca_topic_score_codex":0.00008550189,"about_ca_topic_score_gemma":0.000076275566,"teacher_disagreement_score":0.892328,"about_ca_system_score_codex":0.000112413996,"about_ca_system_score_gemma":0.00032626188,"threshold_uncertainty_score":0.7305938},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002433732,0.00072556746,0.9651059,0.018390803,0.0020002788,0.00045146846,0.000008941946,0.0013018008,0.0119909225],"genre_scores_gemma":[0.012020245,0.00015268939,0.98453486,0.0023197732,0.00039401712,0.000008991949,0.000010019996,0.00004676751,0.00051266066],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99354196,0.00003953187,0.00073836616,0.0028299491,0.0016181576,0.0012320199],"domain_scores_gemma":[0.9796717,0.0004852645,0.00042140682,0.018961364,0.00024562582,0.00021463905],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011634055,0.0008415729,0.0007607411,0.0014630916,0.0003175994,0.0009808674,0.09269692,0.0007227315,0.000029339983],"category_scores_gemma":[0.005926729,0.00079240056,0.00018279468,0.0012253337,0.0011572072,0.0014489295,0.12353215,0.00179661,0.00018494409],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026249577,0.000028289463,0.000025519203,0.0000190431,0.000008857597,0.00018665801,0.000085116,0.00036905982,0.000085685024,0.010385777,0.0033398848,0.9854635],"study_design_scores_gemma":[0.00018625689,0.00015538924,0.00014007124,0.00030839973,0.000005368157,0.000095961565,3.2111366e-8,0.2199938,0.0014990584,0.76636094,0.010493648,0.00076107314],"about_ca_topic_score_codex":0.00001623944,"about_ca_topic_score_gemma":0.000038010712,"teacher_disagreement_score":0.9847024,"about_ca_system_score_codex":0.00058407837,"about_ca_system_score_gemma":0.0006915712,"threshold_uncertainty_score":0.9994527},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007752796,0.00045110588,0.99098134,0.00038570722,0.000779784,0.0008768023,0.000017208087,0.00024279252,0.005490001],"genre_scores_gemma":[0.048371725,0.000050084527,0.94479835,0.0020847693,0.0001904023,0.00006574945,0.000008488289,0.00011845833,0.0043119662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992184,0.000118735574,0.00075502385,0.0028627317,0.0021117271,0.001967811],"domain_scores_gemma":[0.9938618,0.0015766382,0.00056254276,0.002956231,0.00057311717,0.0004696487],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012924727,0.0010588476,0.0011112592,0.0012141094,0.0006748687,0.0014581375,0.005281017,0.0005483547,0.00009553285],"category_scores_gemma":[0.00028214246,0.00087652233,0.00015977291,0.0018156371,0.0016337541,0.0016450919,0.0012892338,0.0019256748,0.000059306105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033920762,0.00052279583,0.0023768218,0.0005535218,0.00022107818,0.001213497,0.0017172904,0.08034001,0.002288758,0.5567125,0.00035238577,0.3533621],"study_design_scores_gemma":[0.0011116178,0.00091013755,0.00027498291,0.0009797692,0.000024160503,0.00034937877,9.586668e-7,0.18441153,0.004753999,0.80022115,0.005044615,0.001917735],"about_ca_topic_score_codex":0.000033356217,"about_ca_topic_score_gemma":0.00016094596,"teacher_disagreement_score":0.35144436,"about_ca_system_score_codex":0.00056516065,"about_ca_system_score_gemma":0.0010925491,"threshold_uncertainty_score":0.9995784},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000064533466,0.002030969,0.9921197,0.0008973775,0.000385045,0.00037920888,0.0000011084654,0.0001370985,0.0039849286],"genre_scores_gemma":[0.5847639,0.0005348427,0.4129192,0.0010215774,0.00035152212,0.00002091805,0.000006838675,0.0000509165,0.00033031928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619746,0.00012151251,0.0005637784,0.0013242409,0.0009186648,0.0008743536],"domain_scores_gemma":[0.99587077,0.0010564127,0.00024505352,0.0024946225,0.0001812252,0.00015188944],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018560129,0.00045201875,0.00048693744,0.0013757792,0.0002587995,0.000481484,0.006169976,0.00033055723,0.00002000853],"category_scores_gemma":[0.000112685455,0.00044140354,0.000106099564,0.0012646917,0.0009886033,0.0010525731,0.002500079,0.001661389,0.000027645605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048164784,0.000018087043,0.000119298566,0.0000048373654,0.0000029918315,0.000030528776,0.0003759217,0.29427326,0.000021181912,0.06821102,0.0000045214024,0.6369335],"study_design_scores_gemma":[0.00020659615,0.000053776377,0.00034679347,0.0003632608,0.0000013427587,0.000024185434,1.7777913e-7,0.66007423,0.000106051055,0.33761513,0.00079752627,0.0004108939],"about_ca_topic_score_codex":0.000020191465,"about_ca_topic_score_gemma":0.0008388483,"teacher_disagreement_score":0.63652265,"about_ca_system_score_codex":0.00048551202,"about_ca_system_score_gemma":0.00028018668,"threshold_uncertainty_score":0.9998038},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015627191,0.00078492967,0.99202573,0.0006939045,0.0017474525,0.0015015742,0.000016662167,0.00020649111,0.0030216756],"genre_scores_gemma":[0.00069265044,0.00015995643,0.9936289,0.0005943713,0.0006026316,0.000078107965,0.0000062642957,0.00006411023,0.004173004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944125,0.00005014514,0.0007886336,0.0020908357,0.0015846591,0.0010732537],"domain_scores_gemma":[0.99589384,0.0008106294,0.0003491314,0.0018080944,0.0008185666,0.00031974027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011416496,0.00060845027,0.00073085004,0.001148969,0.00032199244,0.0010080735,0.0046964977,0.0003702292,0.00010731202],"category_scores_gemma":[0.00032209224,0.0005693126,0.0001872108,0.0008179936,0.00070758344,0.0004145597,0.0012691874,0.000723429,0.00011169937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002050481,0.000042133488,0.000009515695,0.000063944775,0.000018785686,0.000059479415,0.0002791464,0.08451658,0.000014507739,0.0066730124,0.00014732097,0.9081735],"study_design_scores_gemma":[0.00042657118,0.00024884418,0.00002332347,0.00013526097,0.000008384576,0.000080150654,3.8008054e-8,0.92497313,0.00012097639,0.065407194,0.007972351,0.0006037865],"about_ca_topic_score_codex":0.00001171529,"about_ca_topic_score_gemma":0.000008357678,"teacher_disagreement_score":0.90756977,"about_ca_system_score_codex":0.00029208403,"about_ca_system_score_gemma":0.0005015137,"threshold_uncertainty_score":0.9996758},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003517802,0.0003035242,0.9923064,0.00026888732,0.0010201389,0.00029630782,0.000006746691,0.00013228855,0.0021478967],"genre_scores_gemma":[0.18880644,0.00004694626,0.80927986,0.0009549028,0.00042641693,0.000008227123,0.000011612561,0.000047110003,0.00041849798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962955,0.000039542698,0.0005884256,0.0014539405,0.00088451,0.000738078],"domain_scores_gemma":[0.9984175,0.000266597,0.000287037,0.0007270656,0.00017623299,0.00012556846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073140487,0.00050782494,0.0005206214,0.0012278452,0.00026097044,0.00058650534,0.0021291852,0.0003716393,0.00002316487],"category_scores_gemma":[0.00004808466,0.0004635636,0.00012136909,0.0007849241,0.0004640288,0.0010734691,0.0010600128,0.0008255988,0.00004730491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001581384,0.00009238549,0.0009222001,0.00012674493,0.00000907499,0.0003073551,0.0013312681,0.3888821,0.007372666,0.00051867194,0.00025225763,0.6001695],"study_design_scores_gemma":[0.0003437962,0.000082516985,0.00021202993,0.0016320446,0.000005906067,0.000061480685,5.2981176e-7,0.940458,0.022132473,0.033651978,0.00057951256,0.00083975523],"about_ca_topic_score_codex":0.00012477869,"about_ca_topic_score_gemma":0.00011503332,"teacher_disagreement_score":0.5993297,"about_ca_system_score_codex":0.00027264096,"about_ca_system_score_gemma":0.00031821645,"threshold_uncertainty_score":0.9997816},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031645832,0.00017012992,0.99417835,0.0017900115,0.0005671201,0.0005264367,0.000005036896,0.00010869812,0.0023377724],"genre_scores_gemma":[0.9294625,0.000022571669,0.06898564,0.0012996903,0.00015355098,0.000012095546,0.000003441004,0.000023406035,0.000037101046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586284,0.00013292296,0.00087254983,0.0014341576,0.0009321245,0.0007654155],"domain_scores_gemma":[0.9948131,0.0025011187,0.0004443771,0.0017582668,0.0003335296,0.00014960127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013775617,0.00059864164,0.00071967236,0.0006159475,0.00020447792,0.00035069388,0.00425215,0.0003785822,0.00003932204],"category_scores_gemma":[0.00059348077,0.0004525021,0.00012546351,0.0010517096,0.0023573795,0.00031207423,0.00092671707,0.0015239461,0.000013681847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008896757,0.000053082123,0.000024021314,0.00001994109,0.00000485463,0.000016647697,0.00035188827,0.39407045,0.00001574894,0.48667157,0.000005561099,0.11875732],"study_design_scores_gemma":[0.00011821768,0.00013499876,0.00012584124,0.000543332,0.0000029004027,0.0000069068797,1.0544452e-7,0.59413505,0.00006431505,0.40455198,0.000015380487,0.00030097875],"about_ca_topic_score_codex":0.0000712568,"about_ca_topic_score_gemma":0.0005345093,"teacher_disagreement_score":0.92914605,"about_ca_system_score_codex":0.00029996212,"about_ca_system_score_gemma":0.0006843028,"threshold_uncertainty_score":0.9997927},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007929656,0.0002085649,0.99545896,0.00079637754,0.001657116,0.0008634132,0.00006411332,0.00025281325,0.00069070666],"genre_scores_gemma":[0.4445526,0.000034124463,0.55295557,0.00081950566,0.00029592274,0.000097349286,0.00001812975,0.000058490055,0.0011683097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964626,0.000014757062,0.00061507797,0.0014900807,0.00073516375,0.000682317],"domain_scores_gemma":[0.9979881,0.00016978597,0.00024153081,0.0010850646,0.00032150542,0.00019398998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052552525,0.0005332921,0.0005746599,0.0005394548,0.00038628213,0.0004892418,0.0021023916,0.00042626268,0.000011572769],"category_scores_gemma":[0.000014464007,0.0005157954,0.00028321886,0.0005509693,0.00031297037,0.0008597703,0.00005752512,0.0006007819,0.000014653177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007660592,0.000032760912,3.4746213e-7,0.000059951013,0.0000098896535,0.000009928378,0.0006590638,0.67126435,0.00009136848,0.018517548,0.0000059536756,0.3093412],"study_design_scores_gemma":[0.0005055998,0.00010101231,0.0000042799425,0.0003266759,0.000012171067,0.0000454294,1.2700306e-7,0.8760307,0.00035243464,0.12141483,0.0006962502,0.0005104845],"about_ca_topic_score_codex":0.00002995539,"about_ca_topic_score_gemma":0.00014182787,"teacher_disagreement_score":0.44454467,"about_ca_system_score_codex":0.0004965728,"about_ca_system_score_gemma":0.0010025961,"threshold_uncertainty_score":0.99972934},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026480792,0.00017946436,0.9932141,0.0009261692,0.0018047234,0.0004888502,0.0000075109397,0.00016675651,0.0029476522],"genre_scores_gemma":[0.041287158,0.0000746267,0.9562188,0.0015922287,0.00032977067,0.000016339287,0.000017590612,0.000046119225,0.00041737437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99522024,0.000060967475,0.00071819563,0.0017398301,0.0013150135,0.0009457296],"domain_scores_gemma":[0.99718684,0.00052164134,0.0002572014,0.0013967578,0.0003374371,0.00030010525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012597749,0.0005853934,0.0005695695,0.0014116233,0.00028204182,0.00048358543,0.0029617292,0.0005729771,0.0001061571],"category_scores_gemma":[0.0001631953,0.00055190234,0.00012331625,0.00091243687,0.00088128925,0.0007837472,0.0019574566,0.0021136052,0.0001187267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015914611,0.00013084101,0.00019848878,0.000040620704,0.000012441568,0.00044545557,0.0016021405,0.49166903,0.00070694124,0.035542965,0.00002491674,0.46961024],"study_design_scores_gemma":[0.0006463666,0.00022995731,0.00025149947,0.00027454266,0.000002862052,0.00014980813,1.5111637e-7,0.97301626,0.0009941882,0.018301845,0.0053027207,0.00082980294],"about_ca_topic_score_codex":0.000044900222,"about_ca_topic_score_gemma":0.00021791348,"teacher_disagreement_score":0.4813472,"about_ca_system_score_codex":0.0003041387,"about_ca_system_score_gemma":0.0011765953,"threshold_uncertainty_score":0.9996933},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010451863,0.00042373993,0.9971122,0.00027082278,0.0008340418,0.0005839193,0.000010574328,0.0004907707,0.00016942523],"genre_scores_gemma":[0.10818236,0.00003072577,0.8911508,0.0001774539,0.00012976545,0.000025505193,0.000002941319,0.000066732326,0.00023376722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955052,0.000030665746,0.0009059595,0.0014175825,0.0012341639,0.0009064028],"domain_scores_gemma":[0.9966161,0.0003784342,0.000367124,0.0023130893,0.00020198862,0.00012323167],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009736618,0.00070783886,0.0007936825,0.0010867048,0.00009945505,0.00022516087,0.0054389555,0.0005254193,0.0000029755997],"category_scores_gemma":[0.00005648896,0.00061039755,0.00024266356,0.0009151057,0.0003696731,0.000747093,0.0022773733,0.001215493,0.000002135695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013234237,0.000021179581,0.000021775486,0.000058575526,0.000005417418,0.000015686679,0.00026117224,0.91015846,0.00010334172,0.033880077,0.000046848672,0.05542617],"study_design_scores_gemma":[0.00013191806,0.000017239028,0.00003354217,0.0010235361,0.000006158274,0.000018854715,1.70064e-8,0.9187204,0.0016686058,0.07753686,0.00028038374,0.00056243234],"about_ca_topic_score_codex":0.00004964993,"about_ca_topic_score_gemma":0.00009154534,"teacher_disagreement_score":0.10807784,"about_ca_system_score_codex":0.00046746398,"about_ca_system_score_gemma":0.0005700375,"threshold_uncertainty_score":0.9999421},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013284144,0.00020077973,0.99152845,0.0006818693,0.0026495047,0.0006122259,0.000023978568,0.000084710606,0.0028900597],"genre_scores_gemma":[0.58902645,0.000044218705,0.39147967,0.014838282,0.0014614054,0.000030303729,0.00002232458,0.00019988323,0.002897465],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951218,0.000080324266,0.0006524135,0.001958341,0.0010932866,0.0010938596],"domain_scores_gemma":[0.99620557,0.0005910223,0.00046728016,0.0018062362,0.0006560519,0.0002738537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008767229,0.00082960067,0.0007893669,0.0010665094,0.00044757655,0.0007497023,0.003845144,0.0005753689,0.00013794098],"category_scores_gemma":[0.00016043616,0.0007656615,0.0002992707,0.0005485806,0.00090560655,0.0012497413,0.0010113424,0.0019355989,0.00012861562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057614467,0.0006020072,0.0010986795,0.00031476148,0.00046379885,0.0017291732,0.004091304,0.024201913,0.6446052,0.053383764,0.0004977546,0.26843548],"study_design_scores_gemma":[0.0013358849,0.0002710522,0.00061481236,0.0005312918,0.00004034399,0.00035922736,5.450179e-7,0.94760495,0.024139363,0.017639158,0.0057341065,0.0017292844],"about_ca_topic_score_codex":0.00008287662,"about_ca_topic_score_gemma":0.00010995448,"teacher_disagreement_score":0.923403,"about_ca_system_score_codex":0.000460158,"about_ca_system_score_gemma":0.00075763016,"threshold_uncertainty_score":0.9994794},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002872883,0.0012502742,0.9819941,0.000048072143,0.0018713638,0.00020801714,0.0000020538005,0.00039705803,0.014200365],"genre_scores_gemma":[0.859581,0.00046297803,0.13653947,0.000603478,0.001884447,0.000011143984,0.000018823497,0.00015601492,0.00074263656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980663,0.000007904702,0.0003418214,0.00063052465,0.0004320693,0.0005213775],"domain_scores_gemma":[0.9990895,0.000103911276,0.00005608849,0.0005942145,0.00006302833,0.000093285475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002755982,0.0004173982,0.00036633178,0.00033248574,0.00009164559,0.00020854897,0.0009634681,0.00028829946,0.000051697614],"category_scores_gemma":[0.000008846636,0.00039301664,0.000094954245,0.00024746876,0.0001963021,0.00014356947,0.00020418395,0.000724535,0.0000496654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.572849e-7,0.000004008224,0.000007768255,0.00003412445,0.000008070014,0.000054344444,0.00008391874,0.8411158,0.000006800299,0.0008631362,0.00015085451,0.15767068],"study_design_scores_gemma":[0.000054178166,0.0000269021,0.000041224783,0.00015725801,0.000009169573,0.000022106296,3.459168e-8,0.97979945,0.00026508386,0.013538604,0.0055874065,0.000498606],"about_ca_topic_score_codex":0.0000162296,"about_ca_topic_score_gemma":0.000041117964,"teacher_disagreement_score":0.85955226,"about_ca_system_score_codex":0.00020784514,"about_ca_system_score_gemma":0.00004788267,"threshold_uncertainty_score":0.9998522},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49741954,0.0000021328228,0.50191236,0.00007963836,0.00047876794,0.00008470061,0.0000010829606,0.000016947437,0.000004839364],"genre_scores_gemma":[0.9891323,0.0000019311624,0.010449789,0.0003248755,0.00007698642,0.000008108518,3.7339544e-7,0.000005298682,3.4553543e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987056,0.000078504636,0.00026979318,0.00041903064,0.00030448713,0.00022255916],"domain_scores_gemma":[0.99876803,0.0007864151,0.000110351146,0.00022967847,0.000055776043,0.00004975185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050585275,0.00009507889,0.00012773405,0.00037920085,0.00022228264,0.00005989786,0.00028753356,0.000083117586,0.000015907895],"category_scores_gemma":[0.0013940174,0.00009062177,0.000037929207,0.0013928808,0.0003956107,0.00028684753,0.00006973494,0.00038624505,0.000003175172],"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.000015308975,0.000035590707,0.0008010071,0.0000044832173,1.8918557e-7,0.0000011655651,0.00021490049,0.020636115,0.92640805,0.000032601827,1.4529678e-7,0.051850427],"study_design_scores_gemma":[0.00036819463,0.000018180523,0.01408756,0.000020555486,6.495567e-7,0.0000148266245,0.0000011968493,0.3944206,0.5899036,0.0011035857,0.0000020907803,0.000058990474],"about_ca_topic_score_codex":0.00009540165,"about_ca_topic_score_gemma":0.001346767,"teacher_disagreement_score":0.49171275,"about_ca_system_score_codex":0.000058173646,"about_ca_system_score_gemma":0.00009809346,"threshold_uncertainty_score":0.36954483},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003791294,0.000039679006,0.98780143,0.00047327284,0.00071446644,0.0011786255,0.00007054663,0.00017675248,0.009166094],"genre_scores_gemma":[0.8395353,0.0000067626133,0.14831807,0.0007305364,0.0017119487,0.0000864487,0.00010618073,0.00006551039,0.009439253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533397,0.000014733268,0.0012334745,0.0013099775,0.0016816007,0.00042623145],"domain_scores_gemma":[0.9929936,0.004212228,0.00074213557,0.0011166094,0.00081270636,0.0001227561],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020031983,0.00039261385,0.00049694587,0.0011947713,0.00044090228,0.00068419194,0.0014388307,0.0005571882,0.00019067452],"category_scores_gemma":[0.00092838507,0.00033187604,0.00022042161,0.00092208857,0.0003517727,0.00058150827,0.000232734,0.0005151517,0.00007588468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010156427,0.000021168487,0.000085488165,0.0000032087378,0.0000032547737,0.000001026073,0.000042630272,0.5612677,0.000025899983,0.0044081216,0.0012348541,0.43289655],"study_design_scores_gemma":[0.00029787206,0.00006254617,0.00012916212,0.000062416184,0.000008774178,0.000004332116,2.6695093e-7,0.5236011,0.0011265464,0.39688352,0.07749919,0.0003242395],"about_ca_topic_score_codex":0.000049518603,"about_ca_topic_score_gemma":0.00004651574,"teacher_disagreement_score":0.8394834,"about_ca_system_score_codex":0.00032556098,"about_ca_system_score_gemma":0.00045161086,"threshold_uncertainty_score":0.99991333},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001191844,0.0045729876,0.98834807,0.00017723131,0.001834207,0.0010712891,0.000006444058,0.00030721247,0.0035633482],"genre_scores_gemma":[0.37399212,0.0009014036,0.6210131,0.0021095749,0.0006998405,0.00013786748,0.000025033334,0.00015766677,0.0009633967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933504,0.000052893993,0.0010938675,0.0026510379,0.001138168,0.0017136605],"domain_scores_gemma":[0.9961112,0.00049590104,0.00054225436,0.0022949146,0.00026772654,0.0002879821],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015596587,0.0009288826,0.0010509187,0.00084087934,0.00028561056,0.0009099517,0.005516,0.0007572987,0.0000197693],"category_scores_gemma":[0.000060949442,0.00095052685,0.00019177698,0.0015843911,0.00066915975,0.0010892274,0.0028501062,0.0021370654,0.000024538582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004787234,0.00002873353,0.00003561361,0.00001493162,0.000004923591,0.00009740669,0.0003202109,0.6824482,0.000003384067,0.017843442,0.000011697032,0.29918665],"study_design_scores_gemma":[0.00047363556,0.00014463668,0.000012199357,0.00082679075,0.0000060892703,0.000044114116,4.812099e-7,0.88011616,0.000025241696,0.11717612,0.00031640803,0.00085810164],"about_ca_topic_score_codex":0.000029123094,"about_ca_topic_score_gemma":0.0023879034,"teacher_disagreement_score":0.37387294,"about_ca_system_score_codex":0.0025458648,"about_ca_system_score_gemma":0.0013269975,"threshold_uncertainty_score":0.99986464},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055853133,0.0013795354,0.9920447,0.00017723515,0.00020229336,0.00017936452,0.00003981322,0.000018641353,0.0003731341],"genre_scores_gemma":[0.39416564,0.00049207115,0.6032855,0.0006428926,0.0009637032,0.000027450747,0.0002564774,0.000037319605,0.00012899726],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987265,0.000009937061,0.00017980108,0.00066383474,0.00015449392,0.00026546486],"domain_scores_gemma":[0.9994567,0.0001539772,0.000063111416,0.00019423367,0.000049157996,0.00008279023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018451264,0.00020416909,0.00022878668,0.00008407073,0.000088578396,0.000039950733,0.00023910475,0.0003804446,0.0000037587179],"category_scores_gemma":[0.00024851345,0.00017661403,0.000044927052,0.000040104744,0.0011611689,0.0000030796705,0.00019745498,0.00020164756,0.0000014813664],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021911324,0.000011505399,0.000020128746,0.000041635063,0.000010423639,0.0000054193983,0.00009385596,0.000024634848,0.002277348,0.00008720306,0.00012593922,0.99728],"study_design_scores_gemma":[0.007069795,0.0065915463,0.0018206215,0.0027066078,0.0003007178,0.0027990947,0.000015144945,0.21538284,0.33346245,0.30043864,0.12088798,0.008524548],"about_ca_topic_score_codex":0.000002504045,"about_ca_topic_score_gemma":0.0000043987748,"teacher_disagreement_score":0.98875546,"about_ca_system_score_codex":0.000019775054,"about_ca_system_score_gemma":0.00011395883,"threshold_uncertainty_score":0.72021115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004352483,0.0005395058,0.9532164,0.0014393935,0.0022508313,0.0008048492,0.000014723743,0.0002871241,0.041403685],"genre_scores_gemma":[0.8315847,0.0001635578,0.16415983,0.0005678641,0.0014531851,0.00012158674,0.000027824875,0.000059727627,0.001861754],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977739,0.00006600125,0.00042443973,0.0006606201,0.00054983975,0.00052518945],"domain_scores_gemma":[0.9973438,0.0012325754,0.00028333138,0.0006860862,0.000350979,0.00010326715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011905401,0.00027411454,0.0003890536,0.0005633992,0.0006150694,0.00017386058,0.0018442568,0.0004515606,0.000019105753],"category_scores_gemma":[0.00032709463,0.0002696997,0.00012161616,0.00034861916,0.0014352109,0.00014406645,0.0003891428,0.0005109372,0.000029606133],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009457298,0.00003797457,0.00010138185,0.000087971115,0.000021043075,0.000013309675,0.0060268845,0.0016596324,0.00002969513,0.26347312,0.0002121038,0.7283274],"study_design_scores_gemma":[0.0010868174,0.00035475224,0.00015442718,0.0026556363,0.00007706721,0.00002480047,0.00010978149,0.1274026,0.006011922,0.19600016,0.6636992,0.0024228222],"about_ca_topic_score_codex":0.0003585634,"about_ca_topic_score_gemma":0.002627286,"teacher_disagreement_score":0.8315411,"about_ca_system_score_codex":0.0008191226,"about_ca_system_score_gemma":0.00062727305,"threshold_uncertainty_score":0.9999755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048554628,0.00023177404,0.9967625,0.0010508248,0.00042833044,0.0003086324,0.000013036221,0.00009173399,0.0006275886],"genre_scores_gemma":[0.5923686,0.00009087237,0.40697175,0.00031610072,0.0001130828,0.000003665265,0.00000848288,0.000020539439,0.00010689222],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99658936,0.000050090664,0.0007519151,0.0009026459,0.0014064483,0.00029952909],"domain_scores_gemma":[0.9965125,0.0009067581,0.0006527676,0.0010883495,0.0006681419,0.00017153504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001539621,0.00031968992,0.0005353264,0.0006033578,0.00010263268,0.00013914813,0.0021517633,0.00053183245,0.000028749497],"category_scores_gemma":[0.0007511683,0.00027430194,0.00010569645,0.0005389812,0.0022209012,0.00033633824,0.00037142154,0.0007639557,0.0000030299548],"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.00006139751,0.00012546094,0.00039974842,0.00024238077,0.000019595205,0.000025254876,0.0003018935,0.000010447241,0.5112444,0.055571575,0.000008460339,0.4319894],"study_design_scores_gemma":[0.0005392685,0.00032075608,0.005869731,0.0006155434,0.000016521239,0.000085698295,4.672161e-7,0.040551618,0.9106785,0.04045327,0.00034233712,0.00052626774],"about_ca_topic_score_codex":0.000018157283,"about_ca_topic_score_gemma":0.000010250744,"teacher_disagreement_score":0.59188306,"about_ca_system_score_codex":0.00007082215,"about_ca_system_score_gemma":0.0008572468,"threshold_uncertainty_score":0.9999709},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017523722,0.0014223697,0.9954895,0.0007588296,0.0005628097,0.0002400734,0.000012793495,0.00052626664,0.00081216055],"genre_scores_gemma":[0.13582891,0.000027554712,0.8615602,0.002134385,0.00018344034,0.000008927937,0.000026708827,0.000023311552,0.00020653389],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955851,0.00004077816,0.0005714008,0.0018471213,0.0010299972,0.0009256253],"domain_scores_gemma":[0.99709487,0.00032867328,0.00031133826,0.0017430979,0.00029161063,0.00023043556],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010332357,0.0006079353,0.0008119004,0.00158065,0.00031809087,0.000663086,0.0059910105,0.00085140904,0.00009138808],"category_scores_gemma":[0.000122474,0.0004922952,0.0002873176,0.0019003112,0.000990482,0.00094437064,0.002196601,0.0019544514,0.000024076602],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012394265,0.00007620292,0.00021966307,0.000037692484,0.000111457084,0.0006050661,0.0004959153,0.0011400653,0.009797351,0.03449816,0.00009757798,0.95290846],"study_design_scores_gemma":[0.0003843953,0.00037338995,0.000112156624,0.00012125964,0.00013210795,0.00030684445,1.06940995e-7,0.38471282,0.028680168,0.5809084,0.0024056942,0.0018626449],"about_ca_topic_score_codex":0.000046178164,"about_ca_topic_score_gemma":0.0001072258,"teacher_disagreement_score":0.9510458,"about_ca_system_score_codex":0.0001816573,"about_ca_system_score_gemma":0.00029320386,"threshold_uncertainty_score":0.9997529},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000083536885,0.000105966996,0.9957057,0.00027345028,0.0009334214,0.00080876105,5.3071244e-7,0.00014975235,0.0019388407],"genre_scores_gemma":[0.44508797,0.00015937282,0.5451761,0.00195685,0.00031458284,0.000075013326,0.00004659927,0.00010010473,0.007083444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940186,0.00011739561,0.0009882762,0.0016914484,0.0019269016,0.0012573415],"domain_scores_gemma":[0.99714684,0.0005690863,0.00052855007,0.0014632276,0.000069760536,0.00022253986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012954219,0.00068450003,0.0006494261,0.0012717211,0.000256938,0.0005830552,0.0038224186,0.00031336193,0.00004180464],"category_scores_gemma":[0.00028468558,0.0006907678,0.00012979818,0.0010286177,0.0005113702,0.00074343145,0.0023430323,0.0017392283,0.0001526346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039159995,0.000029854604,0.00046701194,0.00006773468,0.0000085417905,0.00013353681,0.0022307783,0.9593435,0.000014624668,0.00044909824,0.000016549284,0.037234876],"study_design_scores_gemma":[0.00085414,0.00032062343,0.00034487352,0.0006638143,0.0000054461357,0.000017809209,5.0294375e-7,0.98728347,0.0002051467,0.0065088123,0.0030923847,0.00070296024],"about_ca_topic_score_codex":0.00006280355,"about_ca_topic_score_gemma":0.000024440924,"teacher_disagreement_score":0.45052966,"about_ca_system_score_codex":0.0049196766,"about_ca_system_score_gemma":0.002332008,"threshold_uncertainty_score":0.99955434},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074262774,0.00032715395,0.9960356,0.0004013309,0.0013069798,0.00078323606,0.000007414514,0.0004144183,0.00064961385],"genre_scores_gemma":[0.017669069,0.0000241828,0.98035896,0.0010498194,0.00047016898,0.00007289616,0.000006919362,0.00004867018,0.0002993079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600655,0.0000167005,0.0006974796,0.0015490106,0.0007902164,0.0009400676],"domain_scores_gemma":[0.9949791,0.0030292724,0.00034166808,0.0012550891,0.00021891978,0.00017596882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015516906,0.000600945,0.0005741727,0.0011017012,0.0002137538,0.000515567,0.0034894417,0.0004187963,0.00002042961],"category_scores_gemma":[0.00048747173,0.00059628615,0.00012316147,0.00083526096,0.00021936487,0.0007452567,0.00071647385,0.0008088118,0.00001820591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002209616,0.00011914446,0.00079775165,0.00018443396,0.000011683398,0.00017361963,0.0005698822,0.12897089,0.000048023827,0.004341854,0.00020676089,0.86455387],"study_design_scores_gemma":[0.0006586821,0.00031955872,0.00059683865,0.0011359842,0.00000850346,0.000043429773,1.4140674e-7,0.8899925,0.00460376,0.023093104,0.07810535,0.0014421678],"about_ca_topic_score_codex":0.000017130356,"about_ca_topic_score_gemma":0.00016743265,"teacher_disagreement_score":0.8631117,"about_ca_system_score_codex":0.0005678408,"about_ca_system_score_gemma":0.00095779385,"threshold_uncertainty_score":0.99964887},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033396853,0.00089841674,0.9919209,0.0009493895,0.0015067848,0.00031320835,0.000010832842,0.00028110077,0.004085976],"genre_scores_gemma":[0.04504078,0.00019480928,0.9503138,0.0021758212,0.0004019127,0.0000069446805,0.000033279506,0.000051479376,0.0017811671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955353,0.00003333587,0.000552987,0.0019304327,0.0011594496,0.00078848074],"domain_scores_gemma":[0.99673676,0.0002754876,0.00029466607,0.0022615364,0.00020137872,0.0002301744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000579741,0.0006518419,0.00062294945,0.0008509996,0.00034550633,0.000760221,0.005164682,0.00036822248,0.00004101386],"category_scores_gemma":[0.000053361764,0.0005510968,0.00015422501,0.00064966164,0.00041134245,0.0009826274,0.0018737493,0.0008555817,0.000091121125],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003776607,0.00002745629,0.000007515434,0.000009273903,0.0000051319103,0.00012004904,0.0001366647,0.007445282,0.00007839647,0.0054381406,0.00005652691,0.9866718],"study_design_scores_gemma":[0.00030516533,0.00022119562,0.0004890535,0.0003467924,0.000006210246,0.00009928109,5.3424014e-8,0.8204366,0.00017501094,0.16970783,0.0074484334,0.00076434703],"about_ca_topic_score_codex":0.000033735887,"about_ca_topic_score_gemma":0.00017684285,"teacher_disagreement_score":0.98590744,"about_ca_system_score_codex":0.0002920341,"about_ca_system_score_gemma":0.00051955204,"threshold_uncertainty_score":0.99969405},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016378326,0.0008694476,0.98812103,0.00043952063,0.0007880339,0.00020153081,0.000007008452,0.000094019866,0.0078415945],"genre_scores_gemma":[0.61547744,0.00023660033,0.3823765,0.00075433357,0.00012433984,0.000010497514,0.0000037962202,0.000020329162,0.0009961713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692076,0.000023179244,0.00054962345,0.0012318975,0.00076302927,0.0005115047],"domain_scores_gemma":[0.9973107,0.0005657822,0.000384019,0.0013659976,0.00029914713,0.00007432636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000562568,0.00045503612,0.0009863968,0.0023233963,0.0002813814,0.00011913113,0.0028760417,0.00040465736,0.000042367585],"category_scores_gemma":[0.00010449126,0.00038009995,0.00029180307,0.001981565,0.0015346667,0.000293474,0.0011239436,0.00074103626,0.000022846278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002184363,0.00017796019,0.0023551176,0.00011213602,0.0016453593,0.00020769035,0.022311129,0.060479168,0.00021132693,0.20305051,0.00040221246,0.70902556],"study_design_scores_gemma":[0.00023956031,0.00048354638,0.004256708,0.00017770182,0.00024563295,0.000018186844,0.0000015462055,0.91149724,0.00031389427,0.08084978,0.0011099816,0.0008062315],"about_ca_topic_score_codex":0.000036261517,"about_ca_topic_score_gemma":0.00015752157,"teacher_disagreement_score":0.8510181,"about_ca_system_score_codex":0.00011586725,"about_ca_system_score_gemma":0.00014127973,"threshold_uncertainty_score":0.9998651},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004454875,0.000014797276,0.98382074,0.00020626803,0.00086375483,0.012488448,0.00009844753,0.00020060694,0.0023024809],"genre_scores_gemma":[0.035549298,0.0000055260593,0.9562012,0.0039748824,0.0012151028,0.0024481446,0.0005182988,0.0000700889,0.00001747987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950286,0.00008100213,0.0005013447,0.0024547225,0.0013125476,0.0006217512],"domain_scores_gemma":[0.9939295,0.00047478132,0.00039640858,0.004768062,0.00019245879,0.00023878728],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017259408,0.00055513484,0.00039910327,0.0013707156,0.00028612275,0.0008897512,0.0073311706,0.0003006617,0.0000586316],"category_scores_gemma":[0.00008242672,0.00049476704,0.00009837155,0.00078487536,0.00045674498,0.0026986005,0.0019502642,0.00094636803,0.000029350125],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001143198,0.00022484403,0.000069927766,0.00010031375,0.000012105073,0.0001263662,0.00091673114,0.0051637967,0.00007382543,0.020265754,0.00009208752,0.97283995],"study_design_scores_gemma":[0.00051164546,0.0005476034,0.00025551967,0.00042498406,0.000006392433,0.0000113626265,2.245503e-7,0.95112485,0.00069234584,0.03795918,0.007771584,0.00069432956],"about_ca_topic_score_codex":0.000039763654,"about_ca_topic_score_gemma":0.00024329625,"teacher_disagreement_score":0.9721456,"about_ca_system_score_codex":0.00018810145,"about_ca_system_score_gemma":0.00033379812,"threshold_uncertainty_score":0.9997504},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013685525,0.00027096644,0.992348,0.0004996231,0.0015138907,0.00059676124,0.000009186331,0.00041470744,0.00420998],"genre_scores_gemma":[0.8601292,0.000078933794,0.13913547,0.0003307769,0.00016473266,0.000024505864,0.000007859511,0.000042406587,0.00008616499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99556977,0.00007698267,0.00077908573,0.0015707167,0.0010921884,0.0009112834],"domain_scores_gemma":[0.9962825,0.00051698624,0.0006181887,0.002106226,0.00026316696,0.00021291271],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009976588,0.00065278733,0.00074866775,0.0019256271,0.0004032639,0.00093292515,0.0059757493,0.0004006126,0.000004278696],"category_scores_gemma":[0.0000926961,0.00054925977,0.0002266904,0.0009877026,0.000908144,0.0014431161,0.0017200968,0.0009121285,0.0000051816687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002204822,0.0001327602,0.00046088945,0.00031716382,0.000043249936,0.00021549252,0.00077978487,0.08520781,0.00035584788,0.73330104,0.00002380037,0.17914012],"study_design_scores_gemma":[0.00056342076,0.00046437426,0.0001879076,0.0036019355,0.000012064249,0.000115626404,2.5989036e-7,0.1399794,0.0071087456,0.84519863,0.0014848263,0.0012828066],"about_ca_topic_score_codex":0.00006614009,"about_ca_topic_score_gemma":0.000033612156,"teacher_disagreement_score":0.8599923,"about_ca_system_score_codex":0.00034698512,"about_ca_system_score_gemma":0.00042404482,"threshold_uncertainty_score":0.9996959},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017624457,0.00008231148,0.9940176,0.00019079783,0.0014745006,0.0010536301,0.0000031963386,0.000371155,0.0010443492],"genre_scores_gemma":[0.17599653,0.000003683422,0.82255936,0.0010173556,0.00031652485,0.00001352602,0.0000022144648,0.000029705641,0.000061122555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99516773,0.000081913524,0.00071607786,0.0017668598,0.0015679983,0.0006994353],"domain_scores_gemma":[0.99691874,0.0004657086,0.00042515012,0.0015699771,0.00034875819,0.00027164974],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012249246,0.00062480726,0.0007243577,0.00096417964,0.000416276,0.0010824748,0.0040972177,0.00027769132,0.00006779938],"category_scores_gemma":[0.00010647874,0.00056122005,0.00012687514,0.00072603615,0.0012578096,0.0013735094,0.0021802217,0.0018061382,0.000028071003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002465702,0.00057632173,0.00039591122,0.000100235295,0.00007634186,0.0014163284,0.021669727,0.0071249236,0.06272199,0.0042203506,0.00007034171,0.90160286],"study_design_scores_gemma":[0.00058312353,0.0005083859,0.00015993473,0.00028204182,0.000022723993,0.00014448797,0.0000034980776,0.9031676,0.050710585,0.043179072,0.000069962516,0.0011685482],"about_ca_topic_score_codex":0.00005206454,"about_ca_topic_score_gemma":0.00007777804,"teacher_disagreement_score":0.9004343,"about_ca_system_score_codex":0.00026920214,"about_ca_system_score_gemma":0.00042292243,"threshold_uncertainty_score":0.9999545},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009353047,0.00026382544,0.98305416,0.00058681204,0.0006000465,0.005415075,0.0000021723088,0.000053062628,0.00067181897],"genre_scores_gemma":[0.9720332,0.000046995847,0.024859656,0.0019503203,0.00052659214,0.0004184791,0.0000013825695,0.000044857523,0.00011851108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964169,0.00009643989,0.00047907614,0.0014388782,0.00094324304,0.00062543876],"domain_scores_gemma":[0.99770236,0.0006306454,0.00018618356,0.0013268706,0.00002722078,0.00012670968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014767421,0.00049006345,0.00042148374,0.0004993753,0.00024304957,0.00042674848,0.0023206023,0.00021942801,0.000021019021],"category_scores_gemma":[0.000013938197,0.0003507121,0.0000760477,0.00032143248,0.0004839275,0.000196249,0.0017169191,0.0008674418,0.000030277199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000624197,0.00041081518,0.00071838987,0.000025640864,0.00002677001,0.0017026216,0.003907254,0.14557655,0.000108251406,0.006273891,0.00002568842,0.8411617],"study_design_scores_gemma":[0.0025419672,0.0057102228,0.007834466,0.0014650353,0.000022635611,0.00036449885,0.000004370869,0.9039285,0.0015616955,0.068090476,0.0055227675,0.0029533561],"about_ca_topic_score_codex":0.000019890731,"about_ca_topic_score_gemma":0.00006072449,"teacher_disagreement_score":0.96268016,"about_ca_system_score_codex":0.00018618947,"about_ca_system_score_gemma":0.00010652412,"threshold_uncertainty_score":0.9998945},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020293768,0.00012100055,0.9973555,0.0002689094,0.00037180624,0.00013236729,0.000015874499,0.000077450386,0.0014541324],"genre_scores_gemma":[0.59843415,0.000048278864,0.40063357,0.00036668323,0.00013042167,0.0000048887923,0.000018074255,0.000021909877,0.00034204547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790025,0.000023029868,0.00039101637,0.000893255,0.0004977742,0.0002947011],"domain_scores_gemma":[0.9984469,0.00022516333,0.0002502747,0.00083576166,0.00014530678,0.00009661455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043657538,0.0002820082,0.00038466242,0.0011408566,0.00027536633,0.00040281648,0.0012424882,0.00017311472,0.000012612118],"category_scores_gemma":[0.000064632215,0.00026932312,0.000080574355,0.0010774452,0.0004591113,0.0003648365,0.0006730312,0.00030724626,0.000002657253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013415762,0.000114840695,0.0010410824,0.000335728,0.00006477642,0.00010149292,0.0013382323,0.36912975,0.0054940972,0.014581779,0.000050576786,0.6077342],"study_design_scores_gemma":[0.0003110649,0.00011206513,0.00012708115,0.0005194627,0.000018098412,0.000015295162,1.3726326e-7,0.9848818,0.0012808496,0.012249589,0.00014092702,0.00034363838],"about_ca_topic_score_codex":0.00004512096,"about_ca_topic_score_gemma":0.00019244169,"teacher_disagreement_score":0.61575204,"about_ca_system_score_codex":0.00014943288,"about_ca_system_score_gemma":0.0006865841,"threshold_uncertainty_score":0.9999759},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005693258,0.00051540026,0.9908825,0.000041447234,0.0017528126,0.0030346974,0.000013075218,0.00020767712,0.0034954683],"genre_scores_gemma":[0.9073743,0.00046093468,0.08237036,0.0010019131,0.005574088,0.0022345355,0.00021616688,0.00045769423,0.00031000195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725443,0.00002206223,0.0005682191,0.00084565155,0.00042277828,0.0008868371],"domain_scores_gemma":[0.998681,0.00025108605,0.00011361037,0.00071742904,0.00009439361,0.00014249369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000553988,0.00057444256,0.0006205644,0.00030199875,0.0001041025,0.0003117224,0.0016525651,0.00054608023,0.00014226827],"category_scores_gemma":[0.000034739798,0.0005315175,0.00009078027,0.0005824291,0.00046680385,0.00038988705,0.0005355072,0.0012701744,0.000018209008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010599122,0.000012553214,0.00008771285,0.00009788776,0.000008417691,0.000053681742,0.00013839299,0.9478251,0.0000030769368,0.00069446146,0.00013082597,0.050937317],"study_design_scores_gemma":[0.00027364216,0.00008255717,0.00030257707,0.00080227765,0.000009177329,0.00001803025,5.3149783e-8,0.9494341,0.00008587266,0.04524048,0.0030610862,0.000690146],"about_ca_topic_score_codex":0.000045057786,"about_ca_topic_score_gemma":0.00026766097,"teacher_disagreement_score":0.9085121,"about_ca_system_score_codex":0.00035270324,"about_ca_system_score_gemma":0.00016843548,"threshold_uncertainty_score":0.99971366},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015726635,0.00080310233,0.9889063,0.004749698,0.0024840233,0.0013556395,0.000017337845,0.00038125526,0.0011453631],"genre_scores_gemma":[0.021350158,0.000029070385,0.9495538,0.027886568,0.00084563025,0.000109686654,0.00003249896,0.00009827749,0.00009433799],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941767,0.00007486989,0.0008235264,0.0026070573,0.0011782867,0.0011395905],"domain_scores_gemma":[0.9946322,0.0012631234,0.00065602205,0.0023411356,0.00081360195,0.0002939077],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010604904,0.00092450704,0.0007469613,0.0010229317,0.0006095347,0.0011455206,0.0054214606,0.0007060428,0.000019156605],"category_scores_gemma":[0.00004077663,0.0008526064,0.00021562893,0.001590141,0.0002131875,0.0010422348,0.0009788066,0.0010313476,0.000068048066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008417989,0.00020455643,0.00017438114,0.0027586897,0.0001421112,0.00010399689,0.016846852,0.050971795,0.004801773,0.25213555,0.000060635793,0.6717155],"study_design_scores_gemma":[0.0005372484,0.00023229598,0.000061310915,0.0017290661,0.000046234913,0.000066670866,0.0000039042543,0.4211003,0.00506404,0.5554536,0.014238306,0.0014670679],"about_ca_topic_score_codex":0.00006526741,"about_ca_topic_score_gemma":0.00059408316,"teacher_disagreement_score":0.6702484,"about_ca_system_score_codex":0.00024389582,"about_ca_system_score_gemma":0.0006815784,"threshold_uncertainty_score":0.9999597},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000066749395,0.00033735178,0.9970891,0.000413292,0.0010331655,0.00037768486,0.0000046802693,0.000092888135,0.00058510527],"genre_scores_gemma":[0.31500208,0.0000147173705,0.6831428,0.001525695,0.00021005202,0.0000017429578,0.0000021533626,0.000022323527,0.000078448364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996562,0.0000454759,0.00065924163,0.0011886156,0.0010441763,0.00050045684],"domain_scores_gemma":[0.99755365,0.0002994057,0.0005403039,0.0011206897,0.00033045385,0.00015550389],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006320862,0.0004558014,0.000576127,0.00088577514,0.00018755879,0.00026050096,0.0016425317,0.00019781596,0.000014282715],"category_scores_gemma":[0.000054177493,0.0004115879,0.00016591013,0.0004914123,0.0003363891,0.00085770583,0.00027730825,0.0005998253,0.000007793027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011173219,0.000036376117,0.000011987393,0.000020749316,0.000003551099,0.000030140027,0.000109513894,0.17268442,0.0068932716,0.0005154811,0.0000017851968,0.8196815],"study_design_scores_gemma":[0.000593555,0.00028086075,0.0000611192,0.00073706143,0.000009374494,0.000034181656,1.7718159e-7,0.97985274,0.008389881,0.009098542,0.0005358738,0.00040661715],"about_ca_topic_score_codex":0.000011976467,"about_ca_topic_score_gemma":0.0000072265193,"teacher_disagreement_score":0.81927496,"about_ca_system_score_codex":0.00033012903,"about_ca_system_score_gemma":0.00043047543,"threshold_uncertainty_score":0.9998336},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039457617,0.00025516804,0.98946196,0.0015380519,0.00078419456,0.00061153085,0.000004206549,0.0004561078,0.0064941933],"genre_scores_gemma":[0.72263926,0.000040404753,0.27534252,0.0014755578,0.00019060477,0.000011962759,0.000004977251,0.000042123607,0.0002526199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536216,0.000042445572,0.00060079125,0.0017892404,0.0013119688,0.00089339475],"domain_scores_gemma":[0.9973386,0.00014649695,0.0003072742,0.0016574151,0.0003242031,0.00022602378],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000533951,0.00079460925,0.0007391783,0.0008848528,0.00021865332,0.0010526456,0.003963622,0.00024787855,0.00004220094],"category_scores_gemma":[0.00003590841,0.0006006472,0.00013405453,0.00045423704,0.00040482983,0.0009946268,0.00071919017,0.0010424949,0.000020613748],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029266621,0.00003911473,0.0005255701,0.0000549675,0.000019800618,0.00016877093,0.00044158782,0.00033911684,0.001774013,0.0064915065,0.000014877951,0.9901014],"study_design_scores_gemma":[0.002843525,0.0026125768,0.0034553972,0.0067525525,0.00008317819,0.00046748898,0.0000010531854,0.5521385,0.029022725,0.39684,0.0013371671,0.0044458127],"about_ca_topic_score_codex":0.000014219213,"about_ca_topic_score_gemma":0.00016082144,"teacher_disagreement_score":0.9856556,"about_ca_system_score_codex":0.00038283697,"about_ca_system_score_gemma":0.00034160717,"threshold_uncertainty_score":0.9999844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000112794674,0.00038974316,0.99694914,0.00016690047,0.0009915815,0.00062993437,0.0004996864,0.00005114993,0.00020906728],"genre_scores_gemma":[0.06369534,0.000063422645,0.93571484,0.00012096613,0.000216865,0.000009920185,0.0001165614,0.00002078035,0.0000413175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657595,0.00003670665,0.0009614521,0.0012849033,0.0007717348,0.00036922292],"domain_scores_gemma":[0.9956848,0.0005384762,0.0007977774,0.0023832414,0.00050415896,0.00009151689],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001449747,0.00036142033,0.00069199956,0.0004657691,0.00010279523,0.00005977153,0.0030650175,0.00020341,0.00001585059],"category_scores_gemma":[0.00021872575,0.0003089836,0.00010694063,0.0002995266,0.001060293,0.0008387903,0.0018128296,0.0004296754,0.000004626898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021029118,0.00006257802,0.000005343003,0.0002521954,0.000017039509,0.0000043570985,0.00071391725,0.016756698,0.00042105236,0.18515629,0.000044788416,0.79654473],"study_design_scores_gemma":[0.0013039275,0.00048018195,0.00004750389,0.002689832,0.00004327558,0.000052951942,0.0000040370273,0.90326446,0.016879184,0.04720454,0.026754692,0.001275432],"about_ca_topic_score_codex":0.000021155516,"about_ca_topic_score_gemma":0.0002028836,"teacher_disagreement_score":0.88650775,"about_ca_system_score_codex":0.000097993696,"about_ca_system_score_gemma":0.0005616166,"threshold_uncertainty_score":0.9999362},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013761617,0.00056104554,0.9929051,0.0002554866,0.0014691475,0.00074545125,0.000014974792,0.00029227213,0.0023803834],"genre_scores_gemma":[0.46281645,0.000098402714,0.53618413,0.0004909526,0.00020145373,0.000010635893,0.000014142134,0.000059014805,0.00012480638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929191,0.00009804337,0.0010920768,0.002556926,0.0021927983,0.0011410902],"domain_scores_gemma":[0.99409497,0.001274097,0.0007792678,0.002693364,0.00081503426,0.00034326254],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009451743,0.0010112914,0.0014338514,0.0014844941,0.0003859687,0.00030532115,0.005922148,0.00042651032,0.000020632227],"category_scores_gemma":[0.00007872263,0.0008627653,0.0002717403,0.001912773,0.0022894535,0.0007574571,0.0028127327,0.0012475107,0.000032072603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004843031,0.00045422424,0.0017356832,0.00023030546,0.00009141168,0.00066099054,0.001848106,0.6045936,0.00015012332,0.01599885,0.00007583249,0.37411243],"study_design_scores_gemma":[0.0007799851,0.00074272323,0.0017202542,0.0003753371,0.000018133615,0.0003358641,1.8420823e-7,0.88260317,0.0011380771,0.11018106,0.0008295391,0.0012756535],"about_ca_topic_score_codex":0.00023989042,"about_ca_topic_score_gemma":0.00009476119,"teacher_disagreement_score":0.46144027,"about_ca_system_score_codex":0.0004041494,"about_ca_system_score_gemma":0.0009148669,"threshold_uncertainty_score":0.9994563},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000061536586,0.0006107354,0.99329984,0.00023200343,0.000862281,0.0003623327,0.0000025463219,0.00068664673,0.0038820982],"genre_scores_gemma":[0.076562665,0.00010058159,0.9220421,0.0005415932,0.0002817678,0.000014593003,0.000002007572,0.00004059954,0.0004141206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963074,0.000015553525,0.0004342948,0.0015535752,0.000981411,0.000707815],"domain_scores_gemma":[0.9959306,0.0020910304,0.00026464436,0.0013122781,0.00023145991,0.00016995725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008594794,0.0005574618,0.00042733562,0.00086930627,0.0002758603,0.0005115054,0.0032451502,0.00031108034,0.00002755132],"category_scores_gemma":[0.0005018669,0.00052056444,0.00009395284,0.0006204993,0.00027871708,0.00073917443,0.0009871208,0.0009962469,0.000065276516],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011404648,0.000105929044,0.0003799781,0.00003971246,0.000018377339,0.00018528452,0.0037892335,0.033915337,0.00010603855,0.01181664,0.0000748776,0.9495572],"study_design_scores_gemma":[0.0008105631,0.0010929623,0.0021101024,0.0019730788,0.000017662798,0.00022829353,0.0000036681374,0.8229774,0.019852718,0.03763283,0.109417826,0.0038828673],"about_ca_topic_score_codex":0.000011868225,"about_ca_topic_score_gemma":0.000026956204,"teacher_disagreement_score":0.9456743,"about_ca_system_score_codex":0.0006965445,"about_ca_system_score_gemma":0.0005059965,"threshold_uncertainty_score":0.99972457},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020810715,0.00016808991,0.9905194,0.0007275123,0.0020605426,0.0008440258,0.000010257325,0.0003050705,0.0032840201],"genre_scores_gemma":[0.41183296,0.000055261447,0.5849587,0.002256574,0.00069395,0.000045506207,0.000013488494,0.000059529168,0.00008405829],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995206,0.00006717116,0.0007671942,0.0018123348,0.0011744638,0.00097282144],"domain_scores_gemma":[0.99662703,0.0004901773,0.00045632428,0.0016914337,0.00049182615,0.00024323369],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018282512,0.0006584597,0.00059333345,0.001729159,0.00092249864,0.0010921401,0.0035752924,0.00047714944,0.00005096937],"category_scores_gemma":[0.00019131225,0.0006282359,0.0002753381,0.0013645112,0.0010745758,0.0007631557,0.0014363704,0.002540665,0.000029004572],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055271303,0.00006530831,0.00023579516,0.0000562203,0.000026771262,0.00012730125,0.002652272,0.0007023954,0.0029795957,0.06991198,0.000016064843,0.92322075],"study_design_scores_gemma":[0.0019918517,0.0007258979,0.0013379547,0.00094077206,0.000038806054,0.0002553025,0.0000054809934,0.21168086,0.010295268,0.74515986,0.023494406,0.0040735127],"about_ca_topic_score_codex":0.000055419005,"about_ca_topic_score_gemma":0.0006928481,"teacher_disagreement_score":0.91914725,"about_ca_system_score_codex":0.00010684899,"about_ca_system_score_gemma":0.00047859937,"threshold_uncertainty_score":0.9999448},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016539929,0.0018252955,0.99213386,0.0003541961,0.0018705234,0.00057041855,0.000001216954,0.00034409578,0.002883876],"genre_scores_gemma":[0.76686275,0.000048156617,0.23093762,0.0005031874,0.0010148538,0.000032002787,0.000014225866,0.000042917658,0.00054426194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949185,0.00006646234,0.00070331583,0.001784205,0.0012710312,0.0012564632],"domain_scores_gemma":[0.9966451,0.00028604423,0.00048007042,0.002024473,0.0001841604,0.00038014617],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012868613,0.00067562546,0.0009476846,0.0014882426,0.00036526582,0.0010747989,0.003955623,0.0004444404,0.000030844698],"category_scores_gemma":[0.000044100467,0.000572113,0.00043099985,0.002011494,0.0006429316,0.0007961803,0.0012837679,0.0007937578,0.00014686596],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019549427,0.000046729867,0.0011511047,0.000038736573,0.0001255544,0.00006691157,0.0011605059,0.0054891855,0.000009282341,0.19332542,0.000009797025,0.7985748],"study_design_scores_gemma":[0.00065008557,0.0006369419,0.0010802527,0.00013870913,0.0004136662,0.00023883632,8.922193e-7,0.5036589,0.00037420265,0.3982022,0.091329955,0.0032753197],"about_ca_topic_score_codex":0.00010276065,"about_ca_topic_score_gemma":0.00024886927,"teacher_disagreement_score":0.79529953,"about_ca_system_score_codex":0.00032696046,"about_ca_system_score_gemma":0.00036159955,"threshold_uncertainty_score":0.9999622},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018626283,0.0008208803,0.9939051,0.00263574,0.0015418679,0.0007237189,0.000006882605,0.000027069249,0.00015246042],"genre_scores_gemma":[0.8706442,0.00006961553,0.12494093,0.0028703087,0.0011042438,0.000049192375,0.000005740969,0.000032696767,0.0002830338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980546,0.000024080948,0.00043526862,0.0006138337,0.0005210758,0.0003510994],"domain_scores_gemma":[0.9975837,0.00043604212,0.00043488128,0.0012830294,0.00021620451,0.00004615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033699107,0.00027199293,0.00030365528,0.00008665505,0.00038301703,0.0001406514,0.0032195838,0.00016125911,0.000005833559],"category_scores_gemma":[0.000024239485,0.00015706659,0.00019887241,0.00063301297,0.00063072913,0.00017694784,0.0007120731,0.00027166813,3.9276583e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027019164,0.0000109877055,0.000022241955,0.000018007437,0.0000064660694,6.4079796e-7,0.00029412878,0.84660006,0.00017026385,0.07506652,0.00016607839,0.07764192],"study_design_scores_gemma":[0.00014855554,0.000060694427,0.0001501671,0.00016883422,0.000009951494,0.000011093616,8.089862e-8,0.84380996,0.0011091811,0.15236284,0.0019730057,0.0001956312],"about_ca_topic_score_codex":0.00001978573,"about_ca_topic_score_gemma":0.000070761234,"teacher_disagreement_score":0.87045795,"about_ca_system_score_codex":0.00006884641,"about_ca_system_score_gemma":0.00025029728,"threshold_uncertainty_score":0.640499},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013651539,0.00023486762,0.9977666,0.00023386153,0.0005800303,0.0004682936,0.00003741842,0.00021657224,0.00032583455],"genre_scores_gemma":[0.11831624,0.000021872826,0.8804228,0.0007207937,0.0003878629,0.0000025569852,0.00008905631,0.00002556554,0.000013282093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575526,0.000041080755,0.0005810535,0.0020480196,0.0011158698,0.00045874168],"domain_scores_gemma":[0.9939028,0.00016832347,0.00038640172,0.0050115553,0.00027112197,0.0002598175],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006803445,0.00045346894,0.0005264081,0.0006626025,0.0002418397,0.000378796,0.00996596,0.0002709259,0.0000074406553],"category_scores_gemma":[0.00003934158,0.00038946504,0.000044613465,0.0006627862,0.00017188373,0.0013751681,0.003886203,0.0005104269,0.000013273173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046125147,0.000045007433,0.00002961973,0.000022967723,0.0000044986978,0.000009229819,0.00040889953,0.014596045,0.0027536794,0.007858632,0.00004565145,0.97422117],"study_design_scores_gemma":[0.00017741453,0.0002522462,0.00082198303,0.00026261117,0.000009295775,0.000030181567,1.9881035e-7,0.91926676,0.0047511565,0.06974635,0.0041046436,0.00057718204],"about_ca_topic_score_codex":0.00005489753,"about_ca_topic_score_gemma":0.000029953395,"teacher_disagreement_score":0.97364396,"about_ca_system_score_codex":0.00012431425,"about_ca_system_score_gemma":0.00031399698,"threshold_uncertainty_score":0.9998557},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018696527,0.0011422988,0.9918144,0.0029505522,0.00082450255,0.00040837037,0.0000053233002,0.00010684408,0.000878093],"genre_scores_gemma":[0.9520412,0.000041491192,0.045321297,0.0018611137,0.00032352874,0.000012445044,0.000012196834,0.000025174246,0.00036154108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730384,0.00004971747,0.0003942121,0.0010191503,0.0008504785,0.00038257084],"domain_scores_gemma":[0.9983785,0.00025713578,0.00020331387,0.0009408327,0.00013364296,0.00008653621],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006179091,0.0003541839,0.0003554612,0.00053361285,0.00031139443,0.0005366493,0.0019429895,0.00017903573,0.000007021475],"category_scores_gemma":[0.000026758618,0.00025588644,0.000046440116,0.00047376807,0.0008331567,0.0005057704,0.0003827214,0.0006621198,0.0000054720167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044016655,0.0005496954,0.0038886976,0.00059611,0.000057706562,0.0013090328,0.25814825,0.0114558255,0.00012625316,0.31104362,0.00013264536,0.41264814],"study_design_scores_gemma":[0.0027016394,0.001226452,0.011781657,0.004978486,0.00005528544,0.0015995889,0.000025091305,0.52416116,0.00019420258,0.43192282,0.017959379,0.0033942193],"about_ca_topic_score_codex":0.000048407524,"about_ca_topic_score_gemma":0.0006001574,"teacher_disagreement_score":0.9501716,"about_ca_system_score_codex":0.00029553205,"about_ca_system_score_gemma":0.0004177244,"threshold_uncertainty_score":0.99998933},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017782436,0.00022469187,0.9977524,0.00035320577,0.00011662737,0.00071965385,0.0000049755618,0.000059723647,0.00059085246],"genre_scores_gemma":[0.48612908,0.0000045508755,0.513393,0.0003770807,0.00006017012,0.000014223203,0.000002858551,0.0000138607675,0.0000051910674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978812,0.000019377745,0.000352603,0.0007494012,0.0007325483,0.00026487754],"domain_scores_gemma":[0.99809283,0.00024386814,0.00037875245,0.00072062213,0.00047987822,0.000084034305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006585072,0.00026299214,0.0003477447,0.00038945282,0.00012782772,0.00009301538,0.0015775494,0.00014373535,7.8656836e-7],"category_scores_gemma":[0.00002604443,0.00016836615,0.000036173657,0.0007887792,0.00028714456,0.00019945769,0.00027673607,0.00021070754,0.0000012786571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014031493,0.000013139681,0.00004167266,0.00021290555,0.0000040693612,0.000003562158,0.00044710815,0.8542413,0.000016413345,0.005858708,0.0000012502516,0.1391458],"study_design_scores_gemma":[0.00019019531,0.00029759726,0.00005590539,0.00048477357,0.000008432699,0.00002009522,9.005059e-7,0.99566567,0.001186655,0.0018153652,0.000034983077,0.00023940034],"about_ca_topic_score_codex":0.000012573474,"about_ca_topic_score_gemma":0.000026650676,"teacher_disagreement_score":0.48595124,"about_ca_system_score_codex":0.000073032934,"about_ca_system_score_gemma":0.00026448333,"threshold_uncertainty_score":0.68657726},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015514153,0.000020850344,0.96855026,0.00009671532,0.0008793197,0.0005502627,0.000006414722,0.00018901237,0.028155763],"genre_scores_gemma":[0.14500535,0.00000162607,0.8521428,0.001044847,0.0009600538,0.000014679632,0.0000064999167,0.00006463163,0.0007595226],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975767,0.000019490277,0.0005087107,0.0007663897,0.0006996687,0.000429019],"domain_scores_gemma":[0.9965242,0.0020186703,0.00028785397,0.00076074956,0.00031321213,0.00009528467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011785227,0.00035355118,0.00036114262,0.00033205794,0.00027917066,0.00014487914,0.0005888192,0.0002499865,0.000019413115],"category_scores_gemma":[0.0012717725,0.00031348158,0.00008301755,0.0004527166,0.00044354048,0.00014788006,0.0002116486,0.00080150977,0.00001986988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018645542,0.000100202546,0.00023170405,0.00021709468,0.000013152923,0.00003600964,0.0003138673,0.013886403,0.0001762775,0.4747012,0.000017164162,0.5102883],"study_design_scores_gemma":[0.00019177062,0.00019063144,0.0004673864,0.00048571613,0.000019670822,0.000028977542,9.9488176e-8,0.06340879,0.00044297086,0.93385816,0.00048556508,0.0004202782],"about_ca_topic_score_codex":0.000037610924,"about_ca_topic_score_gemma":0.00031772617,"teacher_disagreement_score":0.509868,"about_ca_system_score_codex":0.0003999026,"about_ca_system_score_gemma":0.00026375544,"threshold_uncertainty_score":0.99993175},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049887253,0.00023227397,0.99363136,0.00009311456,0.000060409733,0.0007128338,0.000024195277,0.000016396629,0.00024071326],"genre_scores_gemma":[0.65832824,0.000042373158,0.3413736,0.00009093616,0.0000777384,0.000024360617,0.000025318097,0.000013290536,0.000024176552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821836,0.00003553899,0.000239264,0.0005834697,0.0006701839,0.00025320787],"domain_scores_gemma":[0.99859285,0.0005776737,0.00011577718,0.0005334222,0.00012714417,0.000053103886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010285007,0.00017204853,0.00028049675,0.0004567638,0.00014622614,0.00017846133,0.00085007487,0.000045223755,0.0000014646981],"category_scores_gemma":[0.00007305476,0.000117515694,0.000027723305,0.00025942735,0.0011490395,0.00040680153,0.00072257844,0.00022698665,2.6496323e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003026481,0.00043565294,0.000072339215,0.0012403163,0.00013407425,0.000024254008,0.03272087,0.107091896,0.00033704052,0.4129591,0.000025397805,0.4446564],"study_design_scores_gemma":[0.0012039341,0.00054527586,0.0000475909,0.00062224234,0.000012015564,0.000007735366,0.000039951432,0.9862729,0.00035974773,0.010687579,0.000009326864,0.00019173071],"about_ca_topic_score_codex":0.00024166498,"about_ca_topic_score_gemma":0.000065489825,"teacher_disagreement_score":0.87918097,"about_ca_system_score_codex":0.00006264895,"about_ca_system_score_gemma":0.00019978489,"threshold_uncertainty_score":0.4792151},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014592083,0.00045080553,0.9960978,0.00007630813,0.00037866028,0.00046357143,0.000035087254,0.0001405358,0.0022113128],"genre_scores_gemma":[0.5236353,0.000012529558,0.47472757,0.00014536588,0.0003513937,0.000025042624,0.000057167737,0.00007209144,0.00097354443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982007,0.0000044687413,0.00026749805,0.00052725535,0.00052302564,0.000477023],"domain_scores_gemma":[0.99907386,0.0003278412,0.00003572187,0.000275027,0.00019429468,0.000093262555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023285481,0.00030588344,0.00029012497,0.00044370594,0.00010583111,0.00013757027,0.00062751,0.00021014806,0.000014247064],"category_scores_gemma":[0.00002979669,0.00030391247,0.00007646511,0.00015176783,0.00024744106,0.000114209986,0.00013774936,0.0003889408,0.000020760152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026572377,0.0000066526304,0.000011623755,0.000092064096,0.0000072606126,0.000012089064,0.000092835406,0.95927167,0.00030413092,0.0012126241,0.00016605346,0.03882032],"study_design_scores_gemma":[0.00023126506,0.00003327969,0.000016556583,0.00008762447,0.000006038638,0.000007524932,2.078767e-8,0.93375033,0.0012540184,0.06367576,0.00062456937,0.00031302532],"about_ca_topic_score_codex":0.0000103439625,"about_ca_topic_score_gemma":0.000015193718,"teacher_disagreement_score":0.52348936,"about_ca_system_score_codex":0.00019548515,"about_ca_system_score_gemma":0.00014137238,"threshold_uncertainty_score":0.9999413},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026459538,0.0014595554,0.9943553,0.00060399674,0.0011230062,0.00031833918,0.0000020948094,0.00019964107,0.0016734205],"genre_scores_gemma":[0.9188027,0.000019410638,0.07736795,0.0013482337,0.0007292494,0.000012352388,0.000004296701,0.000045147262,0.0016706607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552387,0.000069476955,0.0006606354,0.0015020027,0.0012736261,0.000970385],"domain_scores_gemma":[0.9975478,0.00055838673,0.0005052286,0.00083333295,0.00037292478,0.0001823261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001253735,0.0006697096,0.0006071059,0.0005892113,0.00044690433,0.0009709717,0.0036339327,0.00028889152,0.000069264745],"category_scores_gemma":[0.00006715441,0.0004620304,0.00020392574,0.00097076764,0.0007392963,0.00079205993,0.0009397463,0.0013933893,0.000043877055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001902125,0.0000781958,0.000288572,0.00006799356,0.00013153542,0.0000869649,0.004255614,0.08445318,0.000017361146,0.689575,0.0004791201,0.22054742],"study_design_scores_gemma":[0.00021968581,0.00010309081,0.00016716658,0.0006603652,0.000042259915,0.00010532159,8.6444265e-7,0.98855567,0.0001604093,0.0015474794,0.007629401,0.0008082917],"about_ca_topic_score_codex":0.00002922141,"about_ca_topic_score_gemma":0.0014356733,"teacher_disagreement_score":0.9185381,"about_ca_system_score_codex":0.0003711313,"about_ca_system_score_gemma":0.00033258164,"threshold_uncertainty_score":0.99978316},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000331054,0.00021541455,0.99762076,0.00046848843,0.00026353518,0.0006859422,0.00003390544,0.000111500914,0.000567322],"genre_scores_gemma":[0.097603016,0.00002573906,0.90112996,0.0003764662,0.0001427932,0.000052921034,0.000010848784,0.000023435796,0.00063482794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742085,0.000024229306,0.00057088013,0.0009811021,0.0006303787,0.00037258345],"domain_scores_gemma":[0.99775386,0.00028846465,0.0003879975,0.000569593,0.00091672176,0.00008338782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004945518,0.00036769445,0.00051874935,0.0005502362,0.0001600762,0.00021020023,0.0014853452,0.00024710098,0.0000021260023],"category_scores_gemma":[0.000059024198,0.0003189311,0.00015536114,0.00058158406,0.000726138,0.0003817116,0.00047819078,0.0003166579,0.0000012139592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084818166,0.00028940616,0.000027928412,0.00023373551,0.00006408814,0.000030075083,0.002320083,0.038153052,0.07439959,0.3972809,0.00021714227,0.48689917],"study_design_scores_gemma":[0.00018024667,0.0002442487,0.000012026973,0.00012660676,0.0000054050092,0.0000048281613,1.71495e-7,0.7980278,0.1119857,0.088976786,0.0001357658,0.0003003824],"about_ca_topic_score_codex":0.000006802812,"about_ca_topic_score_gemma":0.000018215756,"teacher_disagreement_score":0.75987476,"about_ca_system_score_codex":0.00015894993,"about_ca_system_score_gemma":0.00057422306,"threshold_uncertainty_score":0.99992627},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004014803,0.0008401644,0.99573326,0.00090473075,0.00037333602,0.0006589224,0.0000042568486,0.00019408455,0.0012510846],"genre_scores_gemma":[0.17293209,0.0000614729,0.82396686,0.002010152,0.0004984445,0.000041331987,0.000007552465,0.00006339017,0.00041871844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968848,0.000024106675,0.00037139308,0.0010304403,0.00078210153,0.00090712216],"domain_scores_gemma":[0.99807125,0.00024518787,0.0002541466,0.00079717516,0.00039646827,0.00023577195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006465351,0.0004497317,0.00041236635,0.0006190844,0.00042352662,0.000911171,0.002038587,0.00021431896,0.000012204899],"category_scores_gemma":[0.000043526674,0.00035883958,0.000087128916,0.00047625508,0.00050938845,0.0008882061,0.00064450846,0.00042131796,0.000012313092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000929445,0.000029411241,0.000053304888,0.00012660892,0.000010889361,0.000017196473,0.0020468738,0.123133816,0.00005989607,0.012795562,0.0000137212755,0.86170346],"study_design_scores_gemma":[0.00040923184,0.00034393233,0.000027159485,0.00063136965,0.000009577416,0.00015496071,2.966392e-7,0.9521788,0.001606507,0.040080506,0.0037093912,0.00084829004],"about_ca_topic_score_codex":0.000010996053,"about_ca_topic_score_gemma":0.00006397467,"teacher_disagreement_score":0.86085516,"about_ca_system_score_codex":0.0001935005,"about_ca_system_score_gemma":0.00060866505,"threshold_uncertainty_score":0.99988633},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017630278,0.0004995681,0.99513197,0.00019209221,0.0020133427,0.00035729868,0.000012607377,0.0000906175,0.0015261784],"genre_scores_gemma":[0.09433044,0.000052841075,0.90451854,0.00073982036,0.00025264,0.000011654445,0.000031812753,0.000025784604,0.000036457066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963323,0.00009282709,0.0007709495,0.0013194511,0.0010360802,0.00044838767],"domain_scores_gemma":[0.99669677,0.00045041717,0.00063461676,0.0016930442,0.00039548014,0.00012969167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010268878,0.0004315368,0.00052440405,0.0005843608,0.00017879327,0.00021744148,0.0029161016,0.00038528373,0.000026611426],"category_scores_gemma":[0.000086991626,0.00043799594,0.00013541256,0.00080658734,0.00062442024,0.00063590216,0.0004989714,0.0007020676,0.000021504837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019161245,0.00009834329,0.00015824215,0.000035441866,0.000031679414,0.000018194392,0.00059002737,0.16877066,0.0018463802,0.20441599,0.000048455513,0.62396747],"study_design_scores_gemma":[0.00021417113,0.00010878022,0.0010604223,0.00024162004,0.000011843454,0.000027615743,1.07876005e-7,0.8620374,0.0037707435,0.13151632,0.000509631,0.0005013223],"about_ca_topic_score_codex":0.00004078404,"about_ca_topic_score_gemma":0.000013023609,"teacher_disagreement_score":0.69326675,"about_ca_system_score_codex":0.0003046733,"about_ca_system_score_gemma":0.00031624845,"threshold_uncertainty_score":0.9998072},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016196811,0.0005464666,0.95258033,0.0010982122,0.0017633351,0.0005542343,0.0000020279317,0.0004946294,0.04294456],"genre_scores_gemma":[0.016489072,0.00020807968,0.97620577,0.0026319174,0.0007897727,0.0000211266,0.000006590989,0.000053542848,0.0035941552],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950765,0.000032091193,0.0006597211,0.0019091351,0.0013795707,0.0009429771],"domain_scores_gemma":[0.99668133,0.00018218928,0.00033884094,0.0022049497,0.00041449952,0.00017819375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096249033,0.00069699826,0.0005725961,0.00091777806,0.0002322962,0.00072814384,0.0049022078,0.00030741937,0.000156787],"category_scores_gemma":[0.00007337088,0.0006686884,0.00013597927,0.0007332004,0.0007075765,0.001245531,0.0022575639,0.0008935475,0.00047201748],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051349125,0.00005368491,0.0000038509206,0.000031261676,0.000011621541,0.00010190739,0.00033418185,0.00036232232,0.0048678922,0.024645833,0.00045748727,0.9691248],"study_design_scores_gemma":[0.0008105349,0.0012051504,0.000056796365,0.0013816427,0.000031220363,0.00016838658,1.9389937e-7,0.19474043,0.30483425,0.42261773,0.070373125,0.0037805564],"about_ca_topic_score_codex":0.000010649841,"about_ca_topic_score_gemma":0.000025169255,"teacher_disagreement_score":0.96534425,"about_ca_system_score_codex":0.00066268456,"about_ca_system_score_gemma":0.00058168295,"threshold_uncertainty_score":0.99957645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004308474,0.0034421098,0.9894617,0.00019493121,0.00039566768,0.00029121406,0.000016762957,0.000018200855,0.0018709231],"genre_scores_gemma":[0.86504287,0.00089893467,0.13135569,0.00051572896,0.00075786945,0.0000092634355,0.000049425336,0.00005852769,0.0013117238],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984738,0.000007017994,0.00017494983,0.0007824512,0.00026871642,0.00029301728],"domain_scores_gemma":[0.99929076,0.000016446324,0.00009771233,0.0004445058,0.00007127808,0.000079265286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015934467,0.00027675612,0.00022001307,0.000116298754,0.00009221324,0.00008636541,0.00042515516,0.00020221573,0.00001228133],"category_scores_gemma":[0.000029673754,0.00025387248,0.00004828545,0.00006904302,0.000603789,0.000007546402,0.00037460632,0.00018766384,0.000004124522],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012819962,0.00011040846,0.0081772655,0.0005591525,0.0001692162,0.00017738865,0.0008826066,0.019479884,0.07051472,0.005610181,0.00015491407,0.89403605],"study_design_scores_gemma":[0.009193013,0.005244101,0.011554912,0.005571961,0.00035532875,0.0008620215,0.000006862424,0.017778264,0.23202541,0.44557202,0.2599252,0.011910943],"about_ca_topic_score_codex":0.000010388974,"about_ca_topic_score_gemma":0.00010098691,"teacher_disagreement_score":0.88212514,"about_ca_system_score_codex":0.00005362247,"about_ca_system_score_gemma":0.00018610846,"threshold_uncertainty_score":0.99999136},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015373074,0.00084973406,0.9833903,0.0006339655,0.0025302276,0.00030606796,0.000008904915,0.00025534604,0.01187174],"genre_scores_gemma":[0.19434294,0.00010978256,0.79725176,0.0017707815,0.0020999347,0.000038812712,0.00008987968,0.000077053686,0.0042190845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654573,0.000040525825,0.00050632353,0.0013833502,0.0009690321,0.00055503007],"domain_scores_gemma":[0.99785405,0.0004567687,0.00025275024,0.0009988104,0.0002897809,0.00014782285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068160956,0.00044628052,0.00037844238,0.0014024195,0.0005722267,0.0007367817,0.0022482965,0.00024318087,0.000025630452],"category_scores_gemma":[0.00006232364,0.00045161298,0.0001506965,0.001223239,0.000250404,0.0009526119,0.00073940953,0.0006415602,0.000038479364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043286955,0.00006602462,0.00017188003,0.000051013292,0.000022492368,0.0000850061,0.00042266372,0.537379,0.000541317,0.07476276,0.001439283,0.3850542],"study_design_scores_gemma":[0.00021055127,0.0000957242,0.0008532604,0.0002558395,0.0000108802005,0.000097872595,8.681776e-8,0.68888783,0.0011031398,0.29285976,0.014863443,0.0007615901],"about_ca_topic_score_codex":0.000082760096,"about_ca_topic_score_gemma":0.00017166878,"teacher_disagreement_score":0.3842926,"about_ca_system_score_codex":0.000230395,"about_ca_system_score_gemma":0.00041716537,"threshold_uncertainty_score":0.9997936},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011655455,0.00028729753,0.99540305,0.00025646164,0.0013745502,0.00036812178,0.00001140008,0.00022573624,0.0019568412],"genre_scores_gemma":[0.029709155,0.000009445416,0.9687628,0.0005019385,0.00017636533,0.00000707818,0.000009550683,0.000027069334,0.00079660764],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9957393,0.000033569206,0.00077006436,0.0014309607,0.0014873297,0.00053877186],"domain_scores_gemma":[0.9970363,0.00038161717,0.00047378254,0.0015078125,0.00045124805,0.00014925592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001297311,0.0004065956,0.0005217447,0.0012896616,0.00021483576,0.00078291853,0.0036289785,0.00022446633,0.00004273707],"category_scores_gemma":[0.00013915767,0.00037637822,0.00013740273,0.00080602313,0.0019872217,0.0007819565,0.0014918208,0.000526473,0.000023718663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021300618,0.000031866417,0.000033177766,0.000074830015,0.0000051150378,0.000037154477,0.00021482936,0.0012460414,0.013439443,0.0011678014,0.00018629628,0.98356134],"study_design_scores_gemma":[0.000701109,0.0005058407,0.0006700844,0.0022777908,0.000027857752,0.00019392573,3.4467124e-7,0.12902817,0.6509866,0.21205282,0.0015234998,0.00203192],"about_ca_topic_score_codex":0.000031400574,"about_ca_topic_score_gemma":0.000013447528,"teacher_disagreement_score":0.9815294,"about_ca_system_score_codex":0.00019355651,"about_ca_system_score_gemma":0.0005641623,"threshold_uncertainty_score":0.9998688},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011657689,0.00013273822,0.9948227,0.00092941924,0.00040796594,0.00084135035,0.000027339058,0.0001630284,0.0025588796],"genre_scores_gemma":[0.06420257,0.000024361056,0.9285941,0.004888379,0.0017834251,0.000051039577,0.00003482415,0.00005693491,0.00036433025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953167,0.000036185862,0.00039190636,0.0019213249,0.0015966379,0.00073725806],"domain_scores_gemma":[0.9970405,0.00032498897,0.0001622633,0.0018661215,0.00026506567,0.00034105804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052831165,0.00057747547,0.00048377202,0.001022004,0.00049629726,0.0007268831,0.0038170982,0.00024053501,0.000026130685],"category_scores_gemma":[0.000019992242,0.00043220518,0.00008433374,0.000982668,0.00030376666,0.0005026939,0.0013009433,0.0010306841,0.00006210973],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021568016,0.000028049742,0.000046646834,0.000014665559,0.000006714933,0.000048525046,0.00026816264,0.043967597,0.000032776243,0.034359984,0.000058353373,0.9211469],"study_design_scores_gemma":[0.0023242275,0.004063416,0.013232766,0.0029209957,0.00004110256,0.0005368864,0.0000013925297,0.57847303,0.0033389605,0.31372327,0.07596878,0.005375151],"about_ca_topic_score_codex":0.000028189563,"about_ca_topic_score_gemma":0.00007372905,"teacher_disagreement_score":0.9157718,"about_ca_system_score_codex":0.00023944098,"about_ca_system_score_gemma":0.0005617886,"threshold_uncertainty_score":0.99981296},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4581829,0.00008060449,0.54072696,0.0006285652,0.00006366551,0.00029113112,3.5910583e-7,0.000023497216,0.000002297104],"genre_scores_gemma":[0.9130521,0.0000015332142,0.08520006,0.0016881936,0.000039916566,0.0000091998245,0.000004135424,0.000004229344,6.433073e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991851,0.000010122975,0.00015184785,0.00030065706,0.0001617999,0.00019049681],"domain_scores_gemma":[0.99944663,0.0003099065,0.00004334244,0.00011362005,0.000028800318,0.000057695917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034472757,0.000080204634,0.0001068904,0.00012943034,0.00009365137,0.000034926026,0.00005875143,0.00004227096,0.00000441686],"category_scores_gemma":[0.00035896286,0.000059862203,0.000020486703,0.00032712764,0.00012226558,0.00009095595,0.000021024609,0.00005933001,8.959047e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099590834,0.0003344341,0.07562102,0.00018580178,0.000009848024,0.000026406682,0.001190684,0.0133217955,0.01646303,0.00007570109,0.000017995053,0.8926537],"study_design_scores_gemma":[0.00062110956,0.00026829672,0.45878053,0.000020604999,0.0000067324,0.0000105339295,7.629544e-7,0.5261428,0.0038919793,0.010194773,0.0000042325446,0.000057651476],"about_ca_topic_score_codex":0.0000030570739,"about_ca_topic_score_gemma":0.000028081062,"teacher_disagreement_score":0.89259607,"about_ca_system_score_codex":0.000030254922,"about_ca_system_score_gemma":0.000040394356,"threshold_uncertainty_score":0.24411097},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025664377,0.0025329357,0.8817613,0.008220749,0.002256472,0.0020414756,0.000008864105,0.0008957102,0.099716075],"genre_scores_gemma":[0.810642,0.00021089065,0.18126985,0.0057086074,0.0006937581,0.000031615316,0.000004892182,0.00003487151,0.0014034798],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976835,0.000056006895,0.0003417575,0.0007257334,0.00063924614,0.0005537307],"domain_scores_gemma":[0.9980818,0.0005129883,0.00016727814,0.00084661617,0.00018950061,0.00020181733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008487304,0.00026261946,0.00033154362,0.0006088386,0.0005722078,0.0002183372,0.0024024842,0.00037974832,0.00015516479],"category_scores_gemma":[0.00029717185,0.00026415786,0.000076814445,0.00049274415,0.00092738314,0.00013325557,0.00055742264,0.00056181283,0.00013691848],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020510283,0.000012599072,0.000050685034,0.000004075725,0.0000029119183,0.000012729445,0.0027738032,0.004365271,0.000040812254,0.0024448337,0.000013345415,0.9902769],"study_design_scores_gemma":[0.0003956248,0.0005182991,0.00018604983,0.0008105274,0.00002331282,0.000049555994,0.000011654198,0.03160121,0.0015021684,0.10698474,0.85612684,0.0017899963],"about_ca_topic_score_codex":0.00026499137,"about_ca_topic_score_gemma":0.004649473,"teacher_disagreement_score":0.9884869,"about_ca_system_score_codex":0.00029667414,"about_ca_system_score_gemma":0.00039862274,"threshold_uncertainty_score":0.99998105},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024890702,0.000035275494,0.9896952,0.0007231914,0.00026230447,0.00058553496,0.0000035975643,0.00037693567,0.008293103],"genre_scores_gemma":[0.10705567,0.000018364415,0.89168376,0.0008490069,0.00014084417,0.000010097776,0.0000054830575,0.000022169366,0.00021457755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965805,0.000029643506,0.00047548176,0.0013762062,0.0009849496,0.00055325945],"domain_scores_gemma":[0.9976323,0.00042291766,0.00023635576,0.0010249062,0.0005212463,0.00016227509],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007246164,0.00050326355,0.00042881095,0.00084929884,0.00026593904,0.0007875478,0.0019346619,0.00026910746,0.000027137321],"category_scores_gemma":[0.00014809726,0.00040936383,0.00007005448,0.000847154,0.0007147633,0.00076397357,0.00053322274,0.0010381336,0.000012579089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039696756,0.00002368395,0.000054496213,0.000021035095,0.0000044296003,0.000021183847,0.00046361142,0.032284614,0.00014459228,0.04747338,0.0000018261792,0.91950315],"study_design_scores_gemma":[0.00026768367,0.0005236288,0.0003995722,0.001124131,0.00000941808,0.00019161777,4.844527e-7,0.942137,0.0017237267,0.052172337,0.0005025173,0.0009478915],"about_ca_topic_score_codex":0.000034743374,"about_ca_topic_score_gemma":0.0002261029,"teacher_disagreement_score":0.9185553,"about_ca_system_score_codex":0.00037242743,"about_ca_system_score_gemma":0.0010952844,"threshold_uncertainty_score":0.99983585},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011331246,0.0012071197,0.9957228,0.00017664759,0.0011413256,0.00019110244,0.000009864238,0.0001374855,0.00028056052],"genre_scores_gemma":[0.55236286,0.000074627525,0.44664145,0.0006624479,0.00018503479,6.0856684e-7,0.0000036518038,0.00003069856,0.000038616807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965775,0.000027375221,0.00039726985,0.0016312754,0.0008310376,0.00053552055],"domain_scores_gemma":[0.99819756,0.00035690278,0.0002804201,0.00091918494,0.00009549887,0.00015043838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022130083,0.00052196166,0.00044898124,0.0015373717,0.0003625019,0.0007464752,0.0014229012,0.00025150448,0.00002946409],"category_scores_gemma":[0.0000958532,0.00047538552,0.000076889315,0.00075433473,0.00030716253,0.0009166952,0.00080121186,0.0009697963,0.0000066471903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017987699,0.0000075263724,0.00003074026,0.000011934714,0.0000049368173,0.000040686475,0.00026354974,0.051708624,0.0009974615,0.0006051195,0.0000012533785,0.9463264],"study_design_scores_gemma":[0.00019982058,0.000056060962,0.00064589485,0.00041548783,0.0000062308886,0.00006371674,2.2136997e-7,0.92874867,0.0012543541,0.06796303,0.00013764072,0.00050886394],"about_ca_topic_score_codex":0.000018459159,"about_ca_topic_score_gemma":0.000015147224,"teacher_disagreement_score":0.94581753,"about_ca_system_score_codex":0.0003462114,"about_ca_system_score_gemma":0.00006609186,"threshold_uncertainty_score":0.9997698},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027903627,0.0007048233,0.9933591,0.00041828342,0.000901708,0.00055609015,0.000008614582,0.00014879389,0.0038746926],"genre_scores_gemma":[0.5838787,0.000103411694,0.41239524,0.0013063673,0.00034057398,0.000051693718,0.00001619732,0.0000374216,0.0018703906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686897,0.000032909415,0.0006032462,0.0012245844,0.0006535126,0.00061678415],"domain_scores_gemma":[0.9968559,0.0005474394,0.00032622222,0.0018019791,0.00032830946,0.00014016395],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007209842,0.00043956173,0.00052993884,0.000603035,0.0004075366,0.0005668883,0.0065972637,0.0002693325,0.000051125313],"category_scores_gemma":[0.000057331086,0.00040843783,0.00028360635,0.00044333047,0.0005354434,0.00037038402,0.0016509504,0.00060824497,0.00007149947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023217885,0.00008710048,0.000008375283,0.000036446963,0.000041970954,0.00002311676,0.0018820432,0.09001256,0.00000970277,0.23540193,0.00037293782,0.6721215],"study_design_scores_gemma":[0.00016874718,0.00013685766,0.000004615142,0.00014880871,0.000015008054,0.000023203967,2.1502646e-7,0.977464,0.00004447157,0.004436263,0.017116543,0.00044127024],"about_ca_topic_score_codex":0.000006717561,"about_ca_topic_score_gemma":0.00007937303,"teacher_disagreement_score":0.88745147,"about_ca_system_score_codex":0.00023403969,"about_ca_system_score_gemma":0.0001708051,"threshold_uncertainty_score":0.99983674},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023955629,0.00042812745,0.995873,0.000037360383,0.00037796353,0.00024870125,0.0000037684101,0.00019934835,0.0025921843],"genre_scores_gemma":[0.98780787,0.0002366122,0.011645728,0.00011249893,0.000083250205,0.000003896111,0.000019921012,0.00003317212,0.00005704171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985102,0.00001676607,0.00044507478,0.0004246868,0.00029875772,0.00030450983],"domain_scores_gemma":[0.9992247,0.00014226353,0.00010382711,0.0003299264,0.00016595972,0.000033311022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020295406,0.00032390538,0.00043459708,0.0006957493,0.000059597838,0.000046238023,0.00049577345,0.00046316642,0.0000141929295],"category_scores_gemma":[0.000034933862,0.00029967618,0.000047448673,0.0007955302,0.00046882834,0.00022349939,0.00009977719,0.0005875862,0.0000031279008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034609475,0.000006165626,0.00014743471,0.00001993604,0.0000055496903,0.000009632012,0.00035620027,0.8239857,0.000021321905,0.006849323,0.0000044528074,0.16859081],"study_design_scores_gemma":[0.00017911717,0.00005540455,0.00009831933,0.00049450656,0.0000050969466,0.0000030740955,6.848174e-7,0.9601745,0.005140073,0.033456746,0.00008712542,0.00030534746],"about_ca_topic_score_codex":0.000012830754,"about_ca_topic_score_gemma":0.00016572757,"teacher_disagreement_score":0.9875683,"about_ca_system_score_codex":0.0002669379,"about_ca_system_score_gemma":0.00007696368,"threshold_uncertainty_score":0.9999455},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005409926,0.0003849304,0.99451506,0.00014965667,0.001560734,0.00044835036,0.0000035398334,0.00059047714,0.0018062515],"genre_scores_gemma":[0.11419021,0.00003993721,0.88401717,0.001188935,0.00045534872,0.000004103463,0.000008116951,0.000055876928,0.000040273793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950247,0.00006290184,0.000806722,0.0018720643,0.0011367844,0.0010968301],"domain_scores_gemma":[0.9970982,0.00034030786,0.00045460538,0.001601806,0.0002909664,0.00021408293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014756941,0.00076489156,0.00068389083,0.0019021326,0.00063335744,0.0007257511,0.0032341368,0.0005181756,0.000005989594],"category_scores_gemma":[0.00003641583,0.00071256584,0.0002715932,0.0008557165,0.00077364955,0.0012199611,0.0014567856,0.0010171646,0.0000090868525],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032832046,0.000059450784,0.00019233947,0.00009474541,0.00003439545,0.0007552163,0.00095682015,0.039276436,0.005852269,0.031041566,0.0000074872078,0.9216964],"study_design_scores_gemma":[0.00029066022,0.00021593517,0.00009577268,0.001475895,0.000023107414,0.0004375849,1.0761402e-7,0.56798977,0.03451752,0.3916882,0.0018759945,0.0013894188],"about_ca_topic_score_codex":0.000031890853,"about_ca_topic_score_gemma":0.000011184707,"teacher_disagreement_score":0.92030704,"about_ca_system_score_codex":0.0004926019,"about_ca_system_score_gemma":0.00023216828,"threshold_uncertainty_score":0.9995325},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47358412,0.0000018330859,0.5254782,0.00065121276,0.000088903966,0.00013497671,4.2408567e-7,0.00005256729,0.000007779341],"genre_scores_gemma":[0.7001778,3.8390365e-7,0.29916963,0.0005644112,0.00007880197,0.0000045426677,7.065911e-7,0.0000035867745,1.2921859e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992085,0.000009416462,0.00010905942,0.00033913658,0.00015271064,0.0001811609],"domain_scores_gemma":[0.99935055,0.00014249199,0.000032231485,0.0003373205,0.000073529634,0.00006389063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018634804,0.000076808006,0.00012030385,0.00009903667,0.00010682713,0.000029369168,0.00016195701,0.00004813439,0.000009583705],"category_scores_gemma":[0.00022557216,0.00006598467,0.00002280269,0.0005201133,0.00035697743,0.0000783573,0.00009418721,0.00038792694,0.0000012040202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004376922,0.00039522364,0.07461263,0.00006251633,0.000003796805,0.000046571415,0.0003874724,0.030505212,0.56123406,0.006337742,0.000016002676,0.326355],"study_design_scores_gemma":[0.00016807781,0.000055836274,0.022041144,0.000025564352,0.0000041137528,0.00016496496,1.0534116e-7,0.9144866,0.0267849,0.036104627,0.00007223005,0.000091834605],"about_ca_topic_score_codex":0.000021318137,"about_ca_topic_score_gemma":0.000022430111,"teacher_disagreement_score":0.8839814,"about_ca_system_score_codex":0.00004558697,"about_ca_system_score_gemma":0.00008567157,"threshold_uncertainty_score":0.2690777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051807572,0.000043176,0.99531966,0.00010908948,0.00177579,0.00044593232,0.000025489693,0.0002880524,0.0019409885],"genre_scores_gemma":[0.46518505,0.00010416612,0.52643603,0.0032343357,0.0028576574,0.00006999433,0.00065741385,0.00018526451,0.0012700892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708724,0.000046124398,0.0005160035,0.0012956905,0.0006496419,0.00040527302],"domain_scores_gemma":[0.9979923,0.00016605969,0.0003337239,0.000973129,0.0003775925,0.00015719059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005996281,0.00039040504,0.0003933995,0.0009033407,0.00029306693,0.00088897074,0.0019515032,0.00026903604,0.000021419859],"category_scores_gemma":[0.000052970907,0.0003777251,0.00009602601,0.00061784923,0.00021981612,0.0017648259,0.00034908153,0.00029476197,0.000039410428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021743788,0.000073603704,0.000010211147,0.00009783008,0.000018278577,0.000013863588,0.0012612523,0.023802705,0.00012580871,0.22592585,0.000048329446,0.74860054],"study_design_scores_gemma":[0.000270299,0.00025886498,0.000016380207,0.00036205575,0.000012473889,0.00003995916,0.0000012477378,0.9482714,0.0014314762,0.04486998,0.0039710575,0.0004947913],"about_ca_topic_score_codex":0.000015852565,"about_ca_topic_score_gemma":0.000028438111,"teacher_disagreement_score":0.9244687,"about_ca_system_score_codex":0.00040998077,"about_ca_system_score_gemma":0.00035323558,"threshold_uncertainty_score":0.99986744},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016237167,0.00021124238,0.9934954,0.0002872965,0.0026034606,0.00045969046,0.0000021006745,0.00033488323,0.00244353],"genre_scores_gemma":[0.42297214,0.000107261585,0.56569564,0.0050801015,0.0011232843,0.00002796455,0.00003092514,0.00012572095,0.0048369477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953141,0.00007509137,0.0007392411,0.0016784628,0.0014178007,0.0007752531],"domain_scores_gemma":[0.99795395,0.00023400018,0.00036602587,0.0008866923,0.0003246199,0.00023469293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018641861,0.00055412337,0.00045691026,0.0011045219,0.00027798707,0.00063462503,0.002197262,0.00044445525,0.00003870279],"category_scores_gemma":[0.00006397991,0.0005311605,0.0001915174,0.00091073173,0.00047045303,0.00082275405,0.000675297,0.0007349667,0.00021352977],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013040314,0.000101923935,0.000043277007,0.0000373381,0.0000171627,0.00007959376,0.0002749876,0.006717523,0.004219719,0.01030698,0.00034432998,0.9778441],"study_design_scores_gemma":[0.0005931655,0.00066666194,0.000220029,0.00035264823,0.000014190673,0.00018375432,2.2144398e-7,0.9028077,0.008023192,0.082661614,0.0032477821,0.0012290076],"about_ca_topic_score_codex":0.0000196004,"about_ca_topic_score_gemma":0.000016314836,"teacher_disagreement_score":0.97661513,"about_ca_system_score_codex":0.00042388684,"about_ca_system_score_gemma":0.00026657103,"threshold_uncertainty_score":0.999714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012351987,0.00018988196,0.9970056,0.0005825503,0.00026805737,0.0013939717,0.000024154508,0.00022967544,0.00018260117],"genre_scores_gemma":[0.3089498,0.000018175191,0.68978065,0.0008663158,0.00013490398,0.00010581395,0.000043714666,0.00004459802,0.000056015142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643993,0.00007468325,0.0005111357,0.0016458757,0.00082800764,0.00050034706],"domain_scores_gemma":[0.99587035,0.001837554,0.00036039445,0.0012763712,0.00040751178,0.0002478161],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009476901,0.0004897653,0.0005424591,0.001583209,0.00048850843,0.0004307784,0.0015991998,0.00028095796,0.0000019638253],"category_scores_gemma":[0.0007391008,0.00042253584,0.00006782796,0.001325774,0.00042900007,0.00042089337,0.0004561196,0.00052710134,0.0000068096947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004545639,0.0005381315,0.026613655,0.0005201751,0.00007440159,0.00012311275,0.0069760303,0.30677497,0.004778489,0.027123095,0.0015081703,0.6245152],"study_design_scores_gemma":[0.0007373798,0.00060486374,0.0006467382,0.00026434293,0.000009222294,0.000021571623,8.6804516e-7,0.9768037,0.003966965,0.0013193313,0.014947134,0.0006778603],"about_ca_topic_score_codex":0.000025414423,"about_ca_topic_score_gemma":0.00024626,"teacher_disagreement_score":0.67002875,"about_ca_system_score_codex":0.00026890016,"about_ca_system_score_gemma":0.00058921135,"threshold_uncertainty_score":0.9998226},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032390782,0.0001138457,0.98436254,0.0021984463,0.0017575831,0.00041520243,0.00009033239,0.00009177745,0.010646333],"genre_scores_gemma":[0.88002527,0.0000048116444,0.11839316,0.0012714005,0.00018839806,0.000008498414,0.000008301077,0.000015646043,0.00008450257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99669975,0.000055410906,0.00060648605,0.0010295048,0.0011283967,0.00048047784],"domain_scores_gemma":[0.9966527,0.0006714963,0.0004557586,0.0017433111,0.00034854905,0.00012818782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009012823,0.00043381337,0.00055257673,0.00015990243,0.00036336322,0.00035962168,0.0043591694,0.000287108,0.000029955754],"category_scores_gemma":[0.000111554655,0.00030846434,0.0001735407,0.00075621594,0.0019997128,0.00024821746,0.0008632818,0.00092382095,0.000045424553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003352039,0.00004187455,0.00002995365,0.0000228811,0.000011126842,0.000019736492,0.00017942332,0.009911756,0.000056787296,0.9303245,0.000062754676,0.059335846],"study_design_scores_gemma":[0.0002080959,0.0001231707,0.0007231022,0.00036313632,0.0000056136078,0.00004255818,1.8098673e-7,0.25331086,0.00038889455,0.7431931,0.001225112,0.00041618384],"about_ca_topic_score_codex":0.00005396632,"about_ca_topic_score_gemma":0.00020850878,"teacher_disagreement_score":0.8797014,"about_ca_system_score_codex":0.00017854966,"about_ca_system_score_gemma":0.00046453587,"threshold_uncertainty_score":0.99993676},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026490336,0.0001786545,0.9971979,0.00047150947,0.0002267604,0.0013523306,0.000008213382,0.00006812104,0.00023157756],"genre_scores_gemma":[0.6357809,0.000059857743,0.36366087,0.0002759249,0.000059492777,0.00009246779,0.0000036394883,0.0000148103645,0.000052073443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668413,0.000026269432,0.00065722497,0.0013196799,0.00090700894,0.0004056911],"domain_scores_gemma":[0.99706084,0.0004953482,0.00036621676,0.0014218951,0.00049071206,0.00016497776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004953337,0.00035083227,0.00055197097,0.0010661477,0.00018875962,0.00017906747,0.0017468695,0.00019355274,0.000015155515],"category_scores_gemma":[0.00023001991,0.000336322,0.00014214241,0.0010929767,0.0014244794,0.0005980313,0.0011388683,0.00039681979,0.000007816742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012337743,0.00021855802,0.0005909049,0.00021146842,0.00013722375,0.00004024301,0.0052241366,0.0022835075,0.0047991876,0.33404747,0.0000037635482,0.6524312],"study_design_scores_gemma":[0.00031512033,0.00030742536,0.0024743758,0.00021033417,0.000100543766,0.00002884013,3.431898e-7,0.5634023,0.014850615,0.41739342,0.0002391625,0.00067754637],"about_ca_topic_score_codex":0.0000124431,"about_ca_topic_score_gemma":0.000024308474,"teacher_disagreement_score":0.65175366,"about_ca_system_score_codex":0.0001550296,"about_ca_system_score_gemma":0.000269654,"threshold_uncertainty_score":0.99990886},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019040814,0.00018592709,0.98892784,0.004608754,0.0011388854,0.00039169626,0.000051397645,0.00011334825,0.0045802556],"genre_scores_gemma":[0.0007142113,0.000058170564,0.99316317,0.0043511116,0.00041502295,0.00005857058,0.000021895898,0.000031648764,0.00118622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964867,0.000024845049,0.00043125547,0.0013754052,0.0010825469,0.000599246],"domain_scores_gemma":[0.9972254,0.0009657307,0.00026593808,0.0010295438,0.00026853892,0.00024484211],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013458644,0.00037260173,0.00042995258,0.00036383327,0.00033046515,0.000493393,0.003470652,0.00037076854,0.000023340986],"category_scores_gemma":[0.0004376381,0.00033747716,0.00013396176,0.00044592176,0.00064847147,0.00043385313,0.00072234194,0.0006389798,0.000028628583],"study_design_candidate":"design_other","study_design_consensus":null,"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.824411e-7,0.000025949836,0.000008677997,0.000013380797,0.000013738972,0.000015476988,0.00023333765,0.00018273087,0.000011747305,0.059147213,0.0016759636,0.9386708],"study_design_scores_gemma":[0.00046796555,0.00017337852,0.000058177204,0.00027541473,0.000013398851,0.00004509824,4.0850378e-7,0.6411299,0.00069560634,0.30930725,0.04698234,0.00085104717],"about_ca_topic_score_codex":0.0000083253435,"about_ca_topic_score_gemma":0.000019555178,"teacher_disagreement_score":0.9378198,"about_ca_system_score_codex":0.00028112208,"about_ca_system_score_gemma":0.0007870099,"threshold_uncertainty_score":0.99990773},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046139583,0.0007705932,0.99329364,0.001080669,0.0018757218,0.00050025823,0.0000030166862,0.00022606703,0.0022039006],"genre_scores_gemma":[0.7185978,0.0007194348,0.20972034,0.025321737,0.023052717,0.00044345777,0.00052373664,0.00043033095,0.021190412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968939,0.00006609297,0.00048010334,0.0012021163,0.00073540566,0.0006223941],"domain_scores_gemma":[0.9979153,0.00046159665,0.00034249068,0.0010027613,0.00016170899,0.00011610792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071755546,0.00045782977,0.0003475914,0.00023540518,0.000871598,0.0007423427,0.0019680832,0.0003087825,0.000025265568],"category_scores_gemma":[0.000016600514,0.00034574515,0.00016589505,0.0008456998,0.00043623452,0.0004877435,0.0006512375,0.0013266237,0.000034038756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000115737,0.000018214238,0.00002424564,0.0000047035037,0.000008639234,0.0000036290812,0.000029148467,0.40693608,0.00007455149,0.003520188,0.0015321659,0.58783686],"study_design_scores_gemma":[0.00022147155,0.00016470822,0.000059303507,0.000059142632,0.000018550169,0.00002177837,5.8384998e-8,0.94241244,0.000106024185,0.009513045,0.047025405,0.0003980953],"about_ca_topic_score_codex":0.000059497488,"about_ca_topic_score_gemma":0.00006176803,"teacher_disagreement_score":0.78357327,"about_ca_system_score_codex":0.00014408772,"about_ca_system_score_gemma":0.00014446373,"threshold_uncertainty_score":0.99989945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001741453,0.000684251,0.98663586,0.0000766718,0.0065930146,0.0053135795,0.0000051669176,0.00023170457,0.0004423465],"genre_scores_gemma":[0.0048870486,0.000005927953,0.99393356,0.00024008837,0.00028107385,0.0004950996,0.000006921493,0.000046677353,0.000103613624],"study_design_codex":"systematic_review","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993286,0.00059081346,0.0018060252,0.0020526843,0.0012492897,0.0010151867],"domain_scores_gemma":[0.9894066,0.0055742,0.0012102441,0.0031057354,0.00048654937,0.000216684],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.013786517,0.0007702424,0.0017119865,0.000915199,0.00047669,0.0009548182,0.0059629316,0.00047075425,0.000003508737],"category_scores_gemma":[0.0044126105,0.00067505194,0.00034340416,0.0014966402,0.00064988685,0.0012333685,0.0015060934,0.00074890093,0.000019546613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009790737,0.0003220122,0.00001815134,0.7056432,0.00031935817,0.00003256004,0.014793965,0.07102211,0.0018851297,0.05346028,0.00004119343,0.15236418],"study_design_scores_gemma":[0.00076777965,0.00037689914,0.00001720565,0.03339946,0.00007552916,0.000039827377,0.0000014903808,0.8972959,0.004733522,0.06249325,0.000008098675,0.0007910682],"about_ca_topic_score_codex":0.000024098095,"about_ca_topic_score_gemma":0.000028141858,"teacher_disagreement_score":0.82627374,"about_ca_system_score_codex":0.004933062,"about_ca_system_score_gemma":0.0032726277,"threshold_uncertainty_score":0.9995701},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18903655,0.000119376244,0.809831,0.00007089024,0.00019829907,0.00070624636,0.0000054539214,0.000020029407,0.000012149824],"genre_scores_gemma":[0.72547436,3.304369e-7,0.2742553,0.00016774265,0.000078186495,0.000010311374,0.000005508391,0.0000074021523,8.5307096e-7],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99864316,0.000012367476,0.0004061537,0.00032307973,0.00028523128,0.00032999687],"domain_scores_gemma":[0.9986302,0.00054609653,0.00021882582,0.00029327266,0.00024102816,0.00007056198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058806885,0.00014418569,0.00040136208,0.00025558178,0.000071938026,0.000012306568,0.00016546555,0.0000889783,0.0000035498601],"category_scores_gemma":[0.00016337069,0.00010879808,0.000089537476,0.0006633749,0.00038195992,0.00008564856,0.000093164424,0.00013828049,8.737962e-8],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014183448,0.0002978004,0.010829171,0.00015774551,0.000022143924,0.00002359426,0.0013547549,0.0044703013,0.010475815,0.000025536643,0.000007877088,0.9721934],"study_design_scores_gemma":[0.0011514674,0.0011800015,0.01083178,0.00031152047,0.000022135699,0.00018338549,0.0000063435996,0.03670394,0.9482389,0.0012305521,0.0000230956,0.000116876414],"about_ca_topic_score_codex":0.00011819746,"about_ca_topic_score_gemma":0.00007577281,"teacher_disagreement_score":0.97207654,"about_ca_system_score_codex":0.00009107989,"about_ca_system_score_gemma":0.00015739322,"threshold_uncertainty_score":0.44366568},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008693979,0.00051232957,0.98751974,0.00009574571,0.0016968369,0.00041416852,0.0000024582307,0.000085262625,0.0009794893],"genre_scores_gemma":[0.7933751,0.000009046829,0.20554174,0.00063234323,0.00034947047,0.0000027139322,0.0000036690712,0.000022325234,0.000063623454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962001,0.000056996596,0.0007671861,0.0013917678,0.00089896977,0.0006849751],"domain_scores_gemma":[0.99837196,0.00017007987,0.0003246565,0.0008493182,0.00013168399,0.00015228552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007223371,0.000500062,0.0005790876,0.00087017927,0.00019411117,0.00044933095,0.0016886735,0.0003169556,0.0000106078505],"category_scores_gemma":[0.000043282635,0.00047562717,0.000100922516,0.0004548921,0.00033069353,0.0008022351,0.00060526363,0.00065797026,0.000014118206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040423743,0.000016616654,0.00019792044,0.00001863015,0.0000052681244,0.00012841781,0.004321448,0.8130932,0.0002952223,0.008398284,0.0000021016037,0.17351887],"study_design_scores_gemma":[0.00035438387,0.000053500324,0.00006008931,0.00093180285,0.0000039372503,0.000068446505,0.0000018779288,0.9859964,0.00016293685,0.011731523,0.00010903162,0.0005260499],"about_ca_topic_score_codex":0.00006705418,"about_ca_topic_score_gemma":0.00004723256,"teacher_disagreement_score":0.7846811,"about_ca_system_score_codex":0.0004783649,"about_ca_system_score_gemma":0.00039073607,"threshold_uncertainty_score":0.99976957},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007677455,0.000105107305,0.9948871,0.00052080647,0.0008823039,0.00034587967,0.000009189895,0.00024133585,0.0022405034],"genre_scores_gemma":[0.66084003,0.000023262472,0.33796442,0.00040583158,0.00043276808,0.00002620212,0.00001033005,0.000032281157,0.00026484206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632955,0.000011105805,0.00048143367,0.0017142018,0.0007593614,0.0007043453],"domain_scores_gemma":[0.99779606,0.0002432904,0.00024851708,0.0013466411,0.00013743117,0.00022803366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004862781,0.0004556396,0.00039102268,0.0005793318,0.00046237666,0.0004979413,0.0035985452,0.0002832739,0.000028165656],"category_scores_gemma":[0.00004218326,0.00045232783,0.00014805449,0.00051815953,0.00058478944,0.0007892289,0.0013011595,0.0008645375,0.00003328155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020250582,0.0000575206,0.0032976891,0.000046529563,0.000021696604,0.000120328266,0.0031338343,0.16293505,0.00009309367,0.1546291,0.000008281902,0.6756548],"study_design_scores_gemma":[0.0002799397,0.000055211618,0.005032868,0.00042763745,0.00000515903,0.000039533476,8.076858e-7,0.7535671,0.00014402605,0.23951477,0.00030853727,0.0006244263],"about_ca_topic_score_codex":0.00008325218,"about_ca_topic_score_gemma":0.00015223083,"teacher_disagreement_score":0.6750304,"about_ca_system_score_codex":0.0004906585,"about_ca_system_score_gemma":0.00053804734,"threshold_uncertainty_score":0.9997929},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013329956,0.00037236643,0.9909019,0.00072639005,0.0031920418,0.0008555891,0.00005462054,0.0006771138,0.0018869732],"genre_scores_gemma":[0.08742216,0.00007254256,0.9090088,0.0023335542,0.0005530838,0.000052467538,0.00002390119,0.00011389459,0.000419592],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99199516,0.00011900962,0.0007447738,0.0033748995,0.0022352387,0.0015309493],"domain_scores_gemma":[0.99327016,0.0012719397,0.00031980974,0.0037936482,0.000588828,0.00075564394],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001339468,0.0009787544,0.00091855135,0.002315605,0.0005494179,0.0008909411,0.008910813,0.0006536427,0.00008114106],"category_scores_gemma":[0.0003497502,0.00088988576,0.0003134904,0.0026559234,0.0014147378,0.0008796075,0.0035327822,0.0026006687,0.00018938637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004547512,0.00011214211,0.00022663389,0.00003458889,0.00004660429,0.00052858616,0.0026935402,0.0026446262,0.00894153,0.15723674,0.00010360203,0.8273859],"study_design_scores_gemma":[0.0003099284,0.00026832247,0.00038270035,0.00033992424,0.000007850098,0.0000326766,2.8705483e-7,0.031707697,0.0044157426,0.95829284,0.003098728,0.0011432825],"about_ca_topic_score_codex":0.00011710581,"about_ca_topic_score_gemma":0.00022279874,"teacher_disagreement_score":0.8262426,"about_ca_system_score_codex":0.00021487976,"about_ca_system_score_gemma":0.0006005503,"threshold_uncertainty_score":0.99970037},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042857882,0.0003665802,0.9863685,0.00037791362,0.0045842165,0.00035127602,0.0000042342176,0.00013031681,0.0073883934],"genre_scores_gemma":[0.95515597,0.000026263595,0.043419186,0.0007151502,0.0003884104,0.000006873354,0.0000019211916,0.000029237784,0.00025699564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964,0.000056524106,0.00069560326,0.0013675436,0.0008906932,0.0005896261],"domain_scores_gemma":[0.99707735,0.00047647356,0.00045636142,0.0014476212,0.00038939415,0.0001528222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010996973,0.00049748435,0.00073469494,0.0008865756,0.00020788284,0.00028327288,0.0026540456,0.00040646584,0.000039171642],"category_scores_gemma":[0.000050292347,0.00044501774,0.00026019925,0.00076152786,0.00072392815,0.000533382,0.0008486234,0.00075315085,0.000028024611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006654376,0.00004909598,0.00006063463,0.000068691326,0.000027386484,0.000038108446,0.0006727172,0.116324015,0.0001659143,0.76661056,0.000034392226,0.115941815],"study_design_scores_gemma":[0.00042895295,0.00029729816,0.00023560894,0.00082589505,0.000008768571,0.00012329519,4.1814374e-7,0.17456485,0.0018478791,0.82034487,0.0005914832,0.0007306595],"about_ca_topic_score_codex":0.00010279456,"about_ca_topic_score_gemma":0.0002104488,"teacher_disagreement_score":0.9547274,"about_ca_system_score_codex":0.00036473607,"about_ca_system_score_gemma":0.00064901484,"threshold_uncertainty_score":0.99980015},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009041962,0.00016469046,0.98750556,0.00020612747,0.0016135494,0.0011565774,0.000002089176,0.00013626793,0.00017317088],"genre_scores_gemma":[0.6414114,0.000010544239,0.35792944,0.0003488828,0.00012953837,0.000092274444,0.000002102363,0.000023631439,0.000052164887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961986,0.000075914744,0.0008760883,0.0015651338,0.00052366866,0.0007606113],"domain_scores_gemma":[0.99768275,0.00053826603,0.00046339768,0.00075090653,0.0004972767,0.0000673746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011430808,0.0005171031,0.00059662043,0.00174868,0.00030653147,0.00041596525,0.0023062401,0.00045430503,0.000017045897],"category_scores_gemma":[0.00022372924,0.00048685732,0.00013098333,0.00052507286,0.00034480105,0.0011754344,0.00075121893,0.0009801587,0.000024280904],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007153628,0.00010181109,0.00052639644,0.00020097251,0.00002503588,0.00004428032,0.004045195,0.054017868,0.00032214104,0.02566342,0.000008639628,0.9149727],"study_design_scores_gemma":[0.00036411823,0.0005001534,0.00012536654,0.00064160564,0.000003565369,0.000033988726,0.0000029521302,0.8581472,0.0005397973,0.13922353,0.0000053805593,0.00041235916],"about_ca_topic_score_codex":0.00006795765,"about_ca_topic_score_gemma":0.0001477917,"teacher_disagreement_score":0.9145603,"about_ca_system_score_codex":0.00068489433,"about_ca_system_score_gemma":0.00030480852,"threshold_uncertainty_score":0.9997583},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010799352,0.00021501354,0.9916809,0.00014062073,0.0015168603,0.00060314883,0.0000059654844,0.00258586,0.003143588],"genre_scores_gemma":[0.33109772,0.000005422217,0.6664483,0.0012683955,0.00059349404,0.00007441271,0.000009749469,0.000050678595,0.0004518438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628526,0.000015971915,0.00061239314,0.0014583594,0.0008027533,0.0008252882],"domain_scores_gemma":[0.9968824,0.00093609083,0.0003986817,0.0013610783,0.00026885784,0.0001529004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006959859,0.0005841251,0.00054499897,0.00057858875,0.0003669008,0.00068150955,0.0029538104,0.0003207424,0.000005257337],"category_scores_gemma":[0.00034947635,0.0005632904,0.00015022473,0.00034431994,0.000539998,0.00048090657,0.0009486865,0.00046472315,0.000028643937],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001815967,0.00008363936,0.0003552818,0.00013759547,0.000016273525,0.00016352395,0.0008515357,0.0054083723,0.0002923557,0.01326277,0.0012785189,0.97813195],"study_design_scores_gemma":[0.00043845247,0.0005281597,0.0001246238,0.0009149047,0.000011576181,0.00016046893,3.296451e-8,0.5644479,0.00941971,0.4188872,0.003930136,0.0011368347],"about_ca_topic_score_codex":0.00004731013,"about_ca_topic_score_gemma":0.000006537755,"teacher_disagreement_score":0.9769951,"about_ca_system_score_codex":0.00025443558,"about_ca_system_score_gemma":0.00058127125,"threshold_uncertainty_score":0.99968183},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54953897,0.000113777074,0.4140259,0.0024770417,0.0082564475,0.0025696913,0.00042969603,0.0006197881,0.021968683],"genre_scores_gemma":[0.97777706,0.000055931563,0.017846087,0.0027682139,0.0006080876,0.000007752005,0.000014730741,0.00005827513,0.0008638765],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973001,0.000047860118,0.00026586038,0.0014053308,0.0005610019,0.00041983373],"domain_scores_gemma":[0.99814993,0.00058775995,0.00024780986,0.00062207825,0.00019127561,0.00020113953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010265811,0.00044707858,0.00035459938,0.00056991464,0.00023063653,0.0005126785,0.0005824973,0.0003119823,0.000150535],"category_scores_gemma":[0.00018969913,0.0003591174,0.000051152056,0.00026520222,0.0009535105,0.00080192974,0.00019574299,0.0019777224,0.000044789354],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025124574,0.00016611435,0.00013109334,0.00004588102,0.000016199514,0.0009349573,0.0058791544,0.0007118178,0.18090889,0.00033708513,0.000018733757,0.81059885],"study_design_scores_gemma":[0.0016038525,0.0027064034,0.0015228553,0.0017916,0.00011649007,0.010073461,0.000017918595,0.019316116,0.8394209,0.10819969,0.011807491,0.0034232128],"about_ca_topic_score_codex":0.0000727673,"about_ca_topic_score_gemma":0.0011902208,"teacher_disagreement_score":0.80717564,"about_ca_system_score_codex":0.00013194079,"about_ca_system_score_gemma":0.00018401303,"threshold_uncertainty_score":0.9998861},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018513089,0.0002636348,0.99416596,0.00022404577,0.0009175971,0.00037716326,0.000013374616,0.00016836294,0.0036847398],"genre_scores_gemma":[0.06827985,0.00006832011,0.9296165,0.0005694056,0.00040777065,0.000023137425,0.000013513832,0.000040452884,0.0009810495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963546,0.000023518314,0.0006267127,0.0014729379,0.00081949594,0.00070275],"domain_scores_gemma":[0.9979792,0.00009775735,0.0002634332,0.0013713257,0.00014976566,0.00013851412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067052676,0.0005142202,0.00053413486,0.001108896,0.00019679534,0.00020989441,0.0016066564,0.00030624215,0.000009223706],"category_scores_gemma":[0.000026785809,0.00047908787,0.00010653046,0.00075145194,0.00037590705,0.0016290222,0.0010243119,0.00088171137,0.000028270086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009565305,0.000050948136,0.000037996942,0.000029302833,0.0000030761603,0.00010168538,0.0011520577,0.32859975,0.00021376784,0.08658768,0.00001249987,0.58320165],"study_design_scores_gemma":[0.00028816986,0.00015323571,0.0000318866,0.00040307248,0.0000037351303,0.00009877499,3.5733117e-7,0.94784015,0.0006437969,0.046226542,0.003610394,0.0006998729],"about_ca_topic_score_codex":0.00011643201,"about_ca_topic_score_gemma":0.0021893084,"teacher_disagreement_score":0.6192404,"about_ca_system_score_codex":0.00072862214,"about_ca_system_score_gemma":0.00066680193,"threshold_uncertainty_score":0.99976605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048271916,0.000019296898,0.9943092,0.0011155776,0.000732392,0.0020721185,0.000033243647,0.00009025958,0.0011452002],"genre_scores_gemma":[0.19876641,0.0000050111953,0.79695636,0.0005668923,0.0007719696,0.00029785416,0.00011547399,0.00007067745,0.0024493565],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995643,0.00003547628,0.00080951594,0.0015623992,0.0015072053,0.0004423613],"domain_scores_gemma":[0.99545944,0.0011871402,0.00080516294,0.0011824197,0.0012171535,0.00014868741],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002326462,0.00042826313,0.0004856001,0.0009668698,0.0005889091,0.00075817236,0.0016544692,0.00044657293,0.00008236601],"category_scores_gemma":[0.0004980176,0.0003103052,0.00011364862,0.0011571662,0.0010383198,0.0006459224,0.0002201343,0.00063639,0.000056329092],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006672462,0.00008712064,0.0001260485,0.000038171343,0.000014551744,0.00000252461,0.0014479308,0.051214907,0.0035078835,0.017808383,0.0000451802,0.9256406],"study_design_scores_gemma":[0.00056537706,0.00034312968,0.00014694847,0.00018454675,0.000021009639,0.000043706834,0.000002104551,0.43447012,0.015357005,0.54427624,0.004005071,0.0005847409],"about_ca_topic_score_codex":0.000003405941,"about_ca_topic_score_gemma":0.00006968194,"teacher_disagreement_score":0.92505586,"about_ca_system_score_codex":0.00012582961,"about_ca_system_score_gemma":0.00034977027,"threshold_uncertainty_score":0.9999349},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009081078,0.0010149818,0.994642,0.0004899756,0.0029894162,0.00058952806,0.000005600386,0.00014235183,0.00011704081],"genre_scores_gemma":[0.0039538234,0.00006920322,0.9949185,0.00048548856,0.00025083811,0.000013081239,0.000001319593,0.000028101162,0.00027964535],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720824,0.000041208274,0.0004942442,0.00089386763,0.0008586719,0.0005037619],"domain_scores_gemma":[0.99695677,0.001328713,0.0003111247,0.001006279,0.00030067845,0.00009646315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016701294,0.0003926656,0.000498041,0.0003794833,0.0001647455,0.00020518825,0.002475157,0.00020756434,0.0000046708933],"category_scores_gemma":[0.0009593793,0.00029540213,0.00014958714,0.00045239797,0.00044496424,0.0005300991,0.00063857785,0.00041201524,0.0000016416592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015285439,0.0000072906278,0.0000060555276,0.000041911004,0.00001636388,0.0000043372206,0.00038270734,0.1646917,0.00025969272,0.009147846,0.00006969004,0.82535714],"study_design_scores_gemma":[0.0006251812,0.0007493465,0.00006680816,0.00043208798,0.000025034307,0.000028555578,5.399122e-7,0.1626504,0.01036963,0.8190563,0.005279735,0.0007164156],"about_ca_topic_score_codex":0.000010490806,"about_ca_topic_score_gemma":0.000011684784,"teacher_disagreement_score":0.8246407,"about_ca_system_score_codex":0.00032477293,"about_ca_system_score_gemma":0.0006138412,"threshold_uncertainty_score":0.9999498},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010507137,0.00061541976,0.9921127,0.0015365608,0.0016236744,0.00036503258,0.00000870087,0.00022040158,0.0034124441],"genre_scores_gemma":[0.08585408,0.00019461029,0.91109765,0.0015807098,0.00077076885,0.000016754766,0.000012156215,0.00003698921,0.00043625795],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99626344,0.000045298402,0.00056623854,0.0016343446,0.0008987848,0.00059189723],"domain_scores_gemma":[0.99776727,0.00022708904,0.00027733907,0.0013418078,0.00018383232,0.00020265454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010110398,0.0005504988,0.0005552126,0.0006924575,0.00035512212,0.000857208,0.0024699974,0.0002835124,0.000024509762],"category_scores_gemma":[0.00008096645,0.0004949107,0.00014059294,0.00053958537,0.001259003,0.0009888147,0.0017781658,0.000906379,0.000024970865],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025693125,0.000029183768,0.000047743615,0.000044121465,0.0000071789696,0.000017841852,0.00065618765,0.0008485009,0.000017216056,0.1461802,0.00002323104,0.85212606],"study_design_scores_gemma":[0.00018241681,0.000072956755,0.000469587,0.0003162438,0.0000061277574,0.00007760049,3.1356407e-7,0.47939768,0.00023830116,0.5162538,0.0024133567,0.00057158805],"about_ca_topic_score_codex":0.000037988488,"about_ca_topic_score_gemma":0.00011247031,"teacher_disagreement_score":0.85155445,"about_ca_system_score_codex":0.0002308858,"about_ca_system_score_gemma":0.0002642374,"threshold_uncertainty_score":0.99975026},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014490178,0.000748932,0.9896624,0.0012036694,0.003132754,0.00066542317,0.000006824586,0.00028814134,0.004277366],"genre_scores_gemma":[0.015399184,0.000038802948,0.9810588,0.0018874893,0.0013595826,0.000028038658,0.000007728063,0.000034766384,0.00018565338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580246,0.000071415336,0.00074555154,0.0017494161,0.0006477092,0.000983431],"domain_scores_gemma":[0.99582636,0.0014652432,0.00041094288,0.0016560279,0.00042257595,0.00021885232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003165153,0.000562843,0.0006223643,0.00072931696,0.00056176964,0.00071472,0.0043189097,0.0004526727,0.000021978356],"category_scores_gemma":[0.00022493015,0.00056472514,0.00028666764,0.00056179636,0.0005019623,0.0011145276,0.0015586356,0.00086779095,0.000029704712],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004977261,0.000020059335,0.0000050303834,0.000040463237,0.000009778041,0.0000035711146,0.0009593831,0.0045623276,0.000037663023,0.1296011,0.000039620114,0.864716],"study_design_scores_gemma":[0.00024822602,0.000103433646,0.000015094014,0.000118693584,0.0000074609206,0.000044883425,1.4915122e-7,0.6741783,0.0017838293,0.27909866,0.043833863,0.0005673981],"about_ca_topic_score_codex":0.000007811744,"about_ca_topic_score_gemma":0.000020886066,"teacher_disagreement_score":0.8641486,"about_ca_system_score_codex":0.0003663543,"about_ca_system_score_gemma":0.00060634874,"threshold_uncertainty_score":0.9996804},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006100826,0.001263618,0.99307674,0.0005111689,0.0006198045,0.0006123444,0.0000079589645,0.0001763524,0.0036710098],"genre_scores_gemma":[0.025342198,0.000054348762,0.9705239,0.00034927865,0.00061627134,0.000017988463,0.0000027563224,0.000049305057,0.003043972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603057,0.0000460014,0.00060514896,0.0013919453,0.0012268166,0.0006995237],"domain_scores_gemma":[0.99735606,0.00017057307,0.00042595618,0.0015112959,0.00036143846,0.0001746896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090654,0.0006108857,0.00071625697,0.00079509174,0.00021142885,0.00035592206,0.0036143258,0.0002700425,0.000040970448],"category_scores_gemma":[0.00003086047,0.0004440091,0.00013365346,0.00075045775,0.0010908727,0.00084776006,0.0010616268,0.0007063187,0.000036029556],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015726328,0.000060384664,0.000012542718,0.00010827295,0.000020490863,0.000069131485,0.0006294579,0.013943713,0.00013569965,0.02975912,0.000010420722,0.95523506],"study_design_scores_gemma":[0.0009045639,0.0010112596,0.000036772115,0.001721541,0.00003103324,0.00045075413,7.0584247e-7,0.8355009,0.02372158,0.1299005,0.0050691436,0.0016512427],"about_ca_topic_score_codex":0.00001511792,"about_ca_topic_score_gemma":0.000021762437,"teacher_disagreement_score":0.9535838,"about_ca_system_score_codex":0.00017257617,"about_ca_system_score_gemma":0.0008266157,"threshold_uncertainty_score":0.99980116},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012015627,0.00021038637,0.98601794,0.00005278901,0.00065562065,0.00031682677,0.0000056516974,0.00008165186,0.012539002],"genre_scores_gemma":[0.10902301,0.000033961824,0.8903324,0.00014326288,0.00011112267,0.000011037779,0.0000072974212,0.000025205003,0.0003126801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663085,0.0000651374,0.0005431895,0.0012083795,0.0011330324,0.00041941347],"domain_scores_gemma":[0.99662894,0.0003676562,0.0006693392,0.0017809782,0.00043898434,0.00011407826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012314222,0.0003854344,0.0007707517,0.0021416666,0.000106144784,0.00021372302,0.002734714,0.00023843278,0.000010062085],"category_scores_gemma":[0.00006992274,0.00031504437,0.00014184449,0.0030568417,0.0007455069,0.0006392017,0.0004568272,0.00048718305,0.000011146886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027332717,0.000049214395,0.0003980326,0.000061256964,0.0004196439,0.00006553486,0.001467061,0.5650033,0.00016778165,0.09534926,0.000005479247,0.33698615],"study_design_scores_gemma":[0.00011903397,0.00021347975,0.0005528803,0.00021880872,0.0001420075,0.00003815849,4.4947132e-7,0.9925888,0.0007746849,0.0044330917,0.0004819739,0.00043661485],"about_ca_topic_score_codex":0.000093385075,"about_ca_topic_score_gemma":0.000034561803,"teacher_disagreement_score":0.42758557,"about_ca_system_score_codex":0.0003157552,"about_ca_system_score_gemma":0.0003584027,"threshold_uncertainty_score":0.99993014},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045756693,0.0016903341,0.99263483,0.00004907878,0.0017718006,0.0032932116,0.00017849819,0.0002632599,0.00007321525],"genre_scores_gemma":[0.43789408,0.000013099515,0.5605697,0.000050220086,0.0008580946,0.000279592,0.00016577722,0.000104303115,0.00006513079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733984,0.000021301024,0.0007471787,0.0009111292,0.00044422573,0.00053633587],"domain_scores_gemma":[0.9979933,0.00064852304,0.0002830361,0.00034823152,0.0006193595,0.00010758134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073875155,0.00052209373,0.0007021814,0.00042178712,0.00021566276,0.00027723543,0.00033571976,0.00024820375,6.381749e-7],"category_scores_gemma":[0.00006254657,0.000544306,0.00009339885,0.00018762179,0.00024066934,0.00022877118,0.00005662772,0.0002472564,0.0000016078417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019243891,0.000011012698,0.0000013141263,0.00033026852,0.000022164011,0.0000023755106,0.00004844742,0.9231308,0.00008048863,0.00027368218,0.000019028339,0.07606116],"study_design_scores_gemma":[0.0015839627,0.00015071958,0.000012866017,0.00034206564,0.000044793098,0.000034225206,4.6784845e-7,0.99597406,0.00020171181,0.00088114303,0.00023489272,0.0005390665],"about_ca_topic_score_codex":0.000024004828,"about_ca_topic_score_gemma":0.0000064508695,"teacher_disagreement_score":0.43784833,"about_ca_system_score_codex":0.0005477954,"about_ca_system_score_gemma":0.0001070605,"threshold_uncertainty_score":0.99970084},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000096573815,0.00020526281,0.99637425,0.0010827277,0.0009045256,0.00069975905,0.000006164684,0.00012589907,0.00050481944],"genre_scores_gemma":[0.20959108,0.00005426803,0.78842926,0.0014999945,0.00009555673,0.000017971275,0.000015349708,0.00004149624,0.00025505424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997152,0.000038490845,0.0004155737,0.0012989468,0.0005748299,0.00052021426],"domain_scores_gemma":[0.99813944,0.00062842976,0.00014294172,0.0006325163,0.00028238786,0.00017429964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080011255,0.00038069225,0.00036991798,0.0006145372,0.00030315068,0.0005622515,0.000920422,0.00027849132,0.00001469007],"category_scores_gemma":[0.00009670304,0.0003611452,0.00008099976,0.00042804473,0.00088693463,0.0004112063,0.00039677363,0.00051091565,0.0000067020696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005327064,0.000011870686,0.000029070066,0.00007390352,0.000007136211,0.000011990713,0.0004208123,0.15846053,0.000032351272,0.030279351,0.000004424761,0.8106632],"study_design_scores_gemma":[0.00029014287,0.00008216994,0.0000811032,0.00018279855,0.000007351916,0.00007787815,3.7897465e-7,0.92967904,0.00012253936,0.068652615,0.00042597658,0.00039801406],"about_ca_topic_score_codex":0.0000075949715,"about_ca_topic_score_gemma":0.00005548103,"teacher_disagreement_score":0.81026524,"about_ca_system_score_codex":0.0003529091,"about_ca_system_score_gemma":0.00042607656,"threshold_uncertainty_score":0.99988407},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005762875,0.0007153831,0.9948652,0.00014780228,0.0015846927,0.0010913351,0.000014153547,0.00060841214,0.00039673204],"genre_scores_gemma":[0.13462645,0.00019894293,0.8623857,0.0012582497,0.0008095941,0.00009055689,0.000044599754,0.00012198606,0.00046396162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947159,0.0000638955,0.0007201006,0.002484122,0.00079890783,0.0012170374],"domain_scores_gemma":[0.9964621,0.0006428758,0.00041837586,0.0017263902,0.00044739526,0.0003028669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090392854,0.0008631406,0.0007783894,0.00057617255,0.00039872958,0.000918281,0.002649813,0.0005684528,0.000004502369],"category_scores_gemma":[0.000029208459,0.0007804148,0.00015429735,0.0006534732,0.00061561126,0.00060047227,0.00077531394,0.00092933065,0.000004675652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012461943,0.00008832952,0.000042297008,0.00002685852,0.000014223797,0.000056024975,0.00012664925,0.85947436,0.000058186182,0.005065144,0.000120031444,0.13491541],"study_design_scores_gemma":[0.00064933783,0.00044203014,0.000031413805,0.00032563126,0.000011646747,0.00006957437,2.5773124e-7,0.98571825,0.0002443674,0.0036649958,0.007946173,0.00089630875],"about_ca_topic_score_codex":0.000036671318,"about_ca_topic_score_gemma":0.000082181155,"teacher_disagreement_score":0.13405016,"about_ca_system_score_codex":0.00047269167,"about_ca_system_score_gemma":0.0003086044,"threshold_uncertainty_score":0.9994647},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015329429,0.00008831557,0.99497694,0.00028503034,0.0018868297,0.0003208019,0.0000074246577,0.000077209246,0.00082448975],"genre_scores_gemma":[0.8134788,0.00010107213,0.1822838,0.0029604456,0.0008041805,0.000012096002,0.000029445902,0.00004090809,0.00028924982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987926,0.000029849192,0.000266632,0.00031591277,0.00039212685,0.0002028952],"domain_scores_gemma":[0.9989149,0.00022725096,0.000106981286,0.00045328803,0.00022587895,0.00007168678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049283536,0.00018463106,0.00019125699,0.00025681863,0.000110182744,0.00028130287,0.00044692808,0.0001380106,0.00004144077],"category_scores_gemma":[0.00026186064,0.00016000005,0.000036880923,0.00029438644,0.000163885,0.00088289095,0.000053467375,0.00036653527,0.000033855555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014400416,0.000016419226,0.000037892296,0.000017201433,0.000011892192,0.000004151399,0.0005237815,0.3244279,0.00055187236,0.013481213,0.00014361319,0.6607697],"study_design_scores_gemma":[0.00042308273,0.00041379518,0.0027375529,0.00054193055,0.000080384474,0.00027160486,0.0000018934422,0.7398951,0.0050691664,0.0501815,0.19922668,0.0011573307],"about_ca_topic_score_codex":0.000036735277,"about_ca_topic_score_gemma":0.000042266383,"teacher_disagreement_score":0.8126932,"about_ca_system_score_codex":0.00016286787,"about_ca_system_score_gemma":0.00015039214,"threshold_uncertainty_score":0.6524613},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007450499,0.00012527066,0.99138486,0.0008275845,0.0007086677,0.0003989422,0.000007321544,0.000053096785,0.005749188],"genre_scores_gemma":[0.39463937,0.00029386216,0.59356636,0.009828403,0.00043025328,0.000092287904,0.000022999375,0.000112797854,0.001013681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969751,0.00012420272,0.00039091095,0.00095465616,0.0010615643,0.00049352075],"domain_scores_gemma":[0.99707514,0.0009687838,0.00025630495,0.0013058471,0.00029936238,0.00009456604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014110123,0.00032437232,0.00031072547,0.0007531429,0.00023237252,0.00016345273,0.002283031,0.00017972587,0.000047990026],"category_scores_gemma":[0.0002076078,0.00023527989,0.00014087757,0.00088320003,0.0010667645,0.00035851198,0.00041823508,0.0007400933,0.000040889532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010654312,0.000030468578,0.000006458968,0.000016205619,0.000008550289,0.000017586335,0.00017187714,0.0074695623,0.00043352784,0.67509747,0.00006067933,0.316677],"study_design_scores_gemma":[0.00011947466,0.00021724936,0.00001893431,0.00018634554,0.000002796771,0.00001845644,7.251791e-8,0.036660414,0.010542407,0.95176,0.00021534903,0.00025852074],"about_ca_topic_score_codex":0.000004655193,"about_ca_topic_score_gemma":0.000011816063,"teacher_disagreement_score":0.39781854,"about_ca_system_score_codex":0.00011669149,"about_ca_system_score_gemma":0.0001699153,"threshold_uncertainty_score":0.95944357},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025947366,0.0006392257,0.99263316,0.0010360709,0.0013667395,0.00026771563,0.0000024615542,0.00010842401,0.0036867398],"genre_scores_gemma":[0.35651177,0.00012249406,0.63894576,0.0019433148,0.0014792929,0.000016258822,0.0000267964,0.000040472387,0.0009138594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619424,0.000037102247,0.0004903772,0.0014866963,0.0012363849,0.0005552018],"domain_scores_gemma":[0.99817944,0.00031340998,0.00024311383,0.0009581359,0.00010371148,0.00020221533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068807014,0.0004791277,0.00037722944,0.00083635113,0.00036380283,0.00052818836,0.0020501786,0.00018427566,0.00007810026],"category_scores_gemma":[0.000037984588,0.00046450816,0.00013787203,0.00055560254,0.00038392624,0.0006193344,0.0012736827,0.0005930606,0.00012304858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003257706,0.000026389438,0.000034264343,0.00000951408,0.00000845226,0.00006537078,0.00039012657,0.19880593,0.00027606555,0.035479695,0.000014347777,0.76488656],"study_design_scores_gemma":[0.00032436813,0.00013453355,0.00014911137,0.00014494223,0.000007604621,0.00012660364,1.0442214e-7,0.6250594,0.0014434012,0.3616229,0.010301784,0.0006852148],"about_ca_topic_score_codex":0.000030348478,"about_ca_topic_score_gemma":0.000038925722,"teacher_disagreement_score":0.76420134,"about_ca_system_score_codex":0.00045067776,"about_ca_system_score_gemma":0.00040749798,"threshold_uncertainty_score":0.99978065},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45250347,0.00006765906,0.5462504,8.4712747e-7,0.000559502,0.00014260021,0.000008416626,0.00003916425,0.00042791775],"genre_scores_gemma":[0.9963073,0.00003576806,0.003512973,0.0000051808406,0.00011247639,0.00000184465,0.000004616839,0.000017430279,0.0000023709094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989611,0.000014172284,0.00033705684,0.0002796323,0.0002301017,0.00017795562],"domain_scores_gemma":[0.9995223,0.00009481928,0.00007307612,0.00022845807,0.000045981855,0.00003533866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028304904,0.00021466304,0.00039719342,0.00021439402,0.00007889834,0.000025871517,0.00020096997,0.00016630137,0.0000056314593],"category_scores_gemma":[0.000012386404,0.00018825354,0.000039023296,0.00005517001,0.00016750813,0.000119452554,0.00011447487,0.000206539,4.0961328e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002688744,0.0000039480055,0.000010386804,0.00049111,0.0000054421234,0.0000014133996,0.00016186331,0.97558683,0.017827747,0.00007968426,4.898315e-7,0.005804171],"study_design_scores_gemma":[0.0001524625,0.00022292118,0.000007682864,0.0005396748,0.000010004539,0.000004905272,2.7786578e-8,0.8895528,0.10818368,0.0011913313,0.0000011264538,0.00013339949],"about_ca_topic_score_codex":0.00003960572,"about_ca_topic_score_gemma":0.0000082489205,"teacher_disagreement_score":0.5438039,"about_ca_system_score_codex":0.00006921396,"about_ca_system_score_gemma":0.000017041295,"threshold_uncertainty_score":0.7676757},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020562099,0.00022114009,0.99533427,0.00047440096,0.0023746917,0.00056379224,0.000007160509,0.00012580564,0.0006931236],"genre_scores_gemma":[0.08936971,0.00007339222,0.9084319,0.0006329311,0.0007535144,0.00003472184,0.000009599419,0.000032791162,0.0006614588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704266,0.000028086182,0.00058509083,0.0012860256,0.00065126334,0.00040688025],"domain_scores_gemma":[0.9977293,0.0004020594,0.0004365362,0.0010162125,0.00030677443,0.000109124056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016682042,0.00035935285,0.00031699205,0.0006845711,0.00025834926,0.00064814935,0.0015550064,0.00033815406,0.000008854775],"category_scores_gemma":[0.00017931324,0.00035953717,0.00008100502,0.00030400607,0.00045346573,0.001370002,0.00039267953,0.00047376697,0.000040616374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001288202,0.000018447294,0.0000057408074,0.000036892485,0.000006753629,0.0000020414361,0.00025950655,0.0048072413,0.0014345647,0.09796856,0.000027477383,0.8954199],"study_design_scores_gemma":[0.00026992842,0.0002400564,0.00034979786,0.00014935569,0.000012497093,0.00008572182,3.2578635e-7,0.90204525,0.005624434,0.0855026,0.0051562637,0.00056374574],"about_ca_topic_score_codex":0.0000041762232,"about_ca_topic_score_gemma":0.000018686078,"teacher_disagreement_score":0.897238,"about_ca_system_score_codex":0.00033046288,"about_ca_system_score_gemma":0.00018942085,"threshold_uncertainty_score":0.9998857},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20599245,0.0018232886,0.108779654,0.007895036,0.002357724,0.0013727719,0.000023708903,0.000060839277,0.6716945],"genre_scores_gemma":[0.99711674,0.00071216177,0.0016715671,0.00010349693,0.00012036323,0.0000014734621,0.000002576648,0.000004314432,0.00026731944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998814,0.000021569978,0.00016711172,0.00022196979,0.0006434456,0.00013189862],"domain_scores_gemma":[0.9993829,0.00025448724,0.00014670557,0.000105862055,0.00009219597,0.000017825641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049267506,0.00010462852,0.0001331518,0.00011002564,0.00015551495,0.000043492888,0.0004257804,0.00007795293,0.00002228456],"category_scores_gemma":[0.000018786559,0.00007061828,0.00004664856,0.0000926129,0.00086321356,0.000064163556,0.0001256205,0.00013172156,0.0000025555723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010315559,0.00001708956,0.00003801911,0.000033076954,0.000016195383,0.0000042012307,0.012882697,0.0011378855,0.000008231746,0.96001446,0.00004062736,0.025797218],"study_design_scores_gemma":[0.00041016407,0.00024555792,0.0011186888,0.0012198729,0.000033931767,0.0000017260712,0.00051003054,0.0011888689,0.0003608648,0.99280775,0.0016720315,0.00043054495],"about_ca_topic_score_codex":0.00028841748,"about_ca_topic_score_gemma":0.00039720658,"teacher_disagreement_score":0.7911243,"about_ca_system_score_codex":0.00007245995,"about_ca_system_score_gemma":0.000025543513,"threshold_uncertainty_score":0.31805462},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10863214,0.001976818,0.8885288,0.000026079839,0.00037038638,0.00031563107,0.0000074319996,0.000010019333,0.00013268368],"genre_scores_gemma":[0.9799279,0.00024066278,0.019392163,0.00013995785,0.00016478915,0.0000062968475,0.0000117046175,0.000018886782,0.0000976159],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882793,0.000024562327,0.00023610644,0.00045449918,0.00023537004,0.0002215258],"domain_scores_gemma":[0.99905646,0.00005202355,0.00021714836,0.00049328787,0.00013464433,0.000046465793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061859976,0.00020296228,0.00018678552,0.00006717482,0.000115885676,0.000035312012,0.00041112045,0.00021584718,0.000012539691],"category_scores_gemma":[0.00012942083,0.00014741001,0.000050064402,0.00006320677,0.00039021447,0.000012163169,0.0003138866,0.0001367207,0.0000017311125],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027259668,0.000011334665,0.00045178158,0.00012701676,0.000008721169,5.61111e-7,0.00009098496,0.00026462515,0.22651167,0.00011025628,0.0000010761988,0.7723947],"study_design_scores_gemma":[0.0003484943,0.001094726,0.0023554626,0.00046939406,0.000052883013,0.00004837209,8.017241e-7,0.060326625,0.9275126,0.005888754,0.000938529,0.00096337724],"about_ca_topic_score_codex":0.00000989229,"about_ca_topic_score_gemma":0.000016496464,"teacher_disagreement_score":0.8712958,"about_ca_system_score_codex":0.000023669743,"about_ca_system_score_gemma":0.00012632363,"threshold_uncertainty_score":0.6011206},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016209851,0.0003291705,0.9943068,0.0012114062,0.0021235885,0.0010385636,0.00010546768,0.0003031987,0.0005655647],"genre_scores_gemma":[0.005307243,0.000046204193,0.9915936,0.0018734157,0.00033615806,0.000052237487,0.000103944156,0.000111640096,0.000575561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928697,0.000057752473,0.0008047213,0.0033485682,0.0014535727,0.0014657238],"domain_scores_gemma":[0.9923727,0.0016137831,0.0004050275,0.0047538523,0.00048377604,0.0003708849],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001637542,0.0008019752,0.00082199695,0.0011040783,0.00061871874,0.0012459914,0.011155986,0.0004192751,0.000013829709],"category_scores_gemma":[0.00086285966,0.00079923426,0.00015620152,0.001029411,0.00082027726,0.0017481605,0.007256021,0.0011775346,0.000023708486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053079577,0.000079560166,0.000049225397,0.00025069472,0.000048188205,0.0001799741,0.0006981762,0.14094618,0.00035658767,0.0043939343,0.0004178172,0.8525266],"study_design_scores_gemma":[0.0009093086,0.0002645837,0.00003410552,0.00041406674,0.0000073221822,0.000078327415,3.0188065e-7,0.9444521,0.0002900115,0.04112396,0.011541851,0.00088407064],"about_ca_topic_score_codex":0.000037116155,"about_ca_topic_score_gemma":0.00012647519,"teacher_disagreement_score":0.8516425,"about_ca_system_score_codex":0.00041429084,"about_ca_system_score_gemma":0.00059306785,"threshold_uncertainty_score":0.9997908},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016619913,0.00035051347,0.99696666,0.0009423717,0.00008592373,0.00032873766,0.000006110519,0.00018728185,0.0009662096],"genre_scores_gemma":[0.23338436,0.00017143552,0.765725,0.00036012565,0.00013081865,0.000004909919,0.0000058896853,0.000031218955,0.00018624976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636626,0.00010339974,0.00043405703,0.0013497894,0.0011498305,0.00059668155],"domain_scores_gemma":[0.9981286,0.00063338864,0.00015857561,0.0006596414,0.00024341221,0.0001763672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014934071,0.0004142707,0.00046798596,0.0005371496,0.00026075848,0.0007573278,0.0014371937,0.000208671,0.000011869915],"category_scores_gemma":[0.00028447833,0.00034768507,0.00004072388,0.00063547405,0.0011214899,0.00079218915,0.00065511925,0.0015416443,0.0000053786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007975339,0.000056066678,0.00085921516,0.00010671978,0.0000092304335,0.0002622372,0.00131356,0.00075864955,0.0020034958,0.0363318,0.0000035010023,0.9582158],"study_design_scores_gemma":[0.00092069776,0.00061107177,0.004408528,0.0010432337,0.000013274408,0.00015990778,0.0000017527174,0.8781688,0.016636988,0.094080605,0.0023703962,0.0015847039],"about_ca_topic_score_codex":0.0000235839,"about_ca_topic_score_gemma":0.000096580115,"teacher_disagreement_score":0.95663106,"about_ca_system_score_codex":0.00029506162,"about_ca_system_score_gemma":0.00044066823,"threshold_uncertainty_score":0.99989754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007893343,0.00048183283,0.988925,0.003227116,0.00096381834,0.00058703386,0.000009317119,0.00033320521,0.005464829],"genre_scores_gemma":[0.1540824,0.00007398734,0.84209585,0.002943191,0.0003043184,0.000014063523,0.000005873926,0.000040552855,0.00043977168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955067,0.000074423624,0.0008444409,0.0017816413,0.0010063383,0.00078647526],"domain_scores_gemma":[0.9970165,0.00025521673,0.00035309236,0.0018727963,0.00022154678,0.00028083293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011350053,0.000640393,0.0007692272,0.001059286,0.00042688675,0.00090002373,0.0035711192,0.000439319,0.000017671839],"category_scores_gemma":[0.00004076345,0.00059681735,0.00025434664,0.00047114264,0.00031458423,0.00090820796,0.0012235248,0.0012794728,0.000012128814],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022748152,0.00003745834,0.0000059291724,0.000015653963,0.0000143523375,0.000042619264,0.00043082196,0.022838408,0.000045934896,0.05048751,0.000072785646,0.92600626],"study_design_scores_gemma":[0.00013997589,0.000088819375,0.0000025879042,0.00032131097,0.0000070380484,0.000106274645,1.3654255e-7,0.70734775,0.00032378567,0.2892909,0.0018817367,0.0004896941],"about_ca_topic_score_codex":0.00008967733,"about_ca_topic_score_gemma":0.00017397136,"teacher_disagreement_score":0.92551655,"about_ca_system_score_codex":0.0005801399,"about_ca_system_score_gemma":0.00084632874,"threshold_uncertainty_score":0.99964833},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013359127,0.00015603253,0.99838614,0.000059949456,0.0003445206,0.00015454553,0.0000052540768,0.000297695,0.00046226967],"genre_scores_gemma":[0.38645044,0.000013153808,0.613204,0.00015554047,0.000095986004,0.000004679951,0.000005422984,0.000043506912,0.000027276386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838823,0.000007643863,0.00034636338,0.0005150134,0.00043073136,0.00031203942],"domain_scores_gemma":[0.9988739,0.00022161314,0.0001185445,0.0006197427,0.00008843931,0.00007779583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019605478,0.00034641605,0.00042466738,0.00058426306,0.000060651102,0.000032021948,0.00061351346,0.0003340077,0.000026386073],"category_scores_gemma":[0.000090193505,0.0003145313,0.00012833386,0.00029923065,0.00038681953,0.000107481945,0.0001050509,0.0010048291,0.000007448851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051186275,0.000015335641,0.0000056054523,0.00006238329,0.000009224655,0.000010690772,0.000047930873,0.9033286,0.014177359,0.0005960094,0.000003612791,0.08173814],"study_design_scores_gemma":[0.000117057214,0.00007807021,0.000024133407,0.00032836525,0.000011261356,0.0000033454196,3.6764682e-8,0.93770075,0.040480908,0.020705976,0.00021063947,0.00033945942],"about_ca_topic_score_codex":0.000008333042,"about_ca_topic_score_gemma":0.000067662244,"teacher_disagreement_score":0.38631684,"about_ca_system_score_codex":0.00019459648,"about_ca_system_score_gemma":0.000044983542,"threshold_uncertainty_score":0.9999307},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038001745,0.00012099369,0.9916869,0.0008915088,0.0016126675,0.00052653585,0.000003554693,0.00017010403,0.004607752],"genre_scores_gemma":[0.09974505,0.000098128025,0.89835775,0.00127899,0.00033251126,0.000028631624,0.000018814577,0.000032996348,0.00010711292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958567,0.00012973436,0.0007065826,0.0015401387,0.0011242549,0.00064261357],"domain_scores_gemma":[0.99796927,0.00029047744,0.00026865708,0.0011648989,0.00014945486,0.00015726271],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017679342,0.00043192197,0.00042861272,0.0012965505,0.00016088807,0.0003247863,0.0023683333,0.00040450838,0.000020999114],"category_scores_gemma":[0.00013381953,0.0004307458,0.00009867056,0.0012627443,0.00060116313,0.0011372674,0.00039174437,0.0010850849,0.00003770536],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019497737,0.000049101807,0.000055602177,0.000034341516,0.000004379751,0.0000879242,0.0027979827,0.041321374,0.00016287278,0.046047796,0.00000942499,0.9094097],"study_design_scores_gemma":[0.00037240025,0.00020687853,0.0010325718,0.00031722584,0.0000047186936,0.00010350524,2.5814566e-7,0.78811336,0.0013497511,0.20689787,0.0010825245,0.000518938],"about_ca_topic_score_codex":0.000033773205,"about_ca_topic_score_gemma":0.000066331806,"teacher_disagreement_score":0.9088908,"about_ca_system_score_codex":0.0005038097,"about_ca_system_score_gemma":0.00044896323,"threshold_uncertainty_score":0.99981445},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018162755,0.0039360696,0.9894193,0.0023981242,0.0020939666,0.00045236087,0.000022934983,0.00039901253,0.0012600933],"genre_scores_gemma":[0.02017623,0.00009464063,0.97348964,0.0029817992,0.0024287975,0.000051916748,0.00003699436,0.000059503545,0.0006804796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544585,0.000053126794,0.0006045996,0.0016885616,0.0013931292,0.000814749],"domain_scores_gemma":[0.9966776,0.0009862895,0.0002496,0.0015549102,0.00019101589,0.000340625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018568253,0.0005653913,0.0006104308,0.00058099104,0.0003865494,0.00048014947,0.004350649,0.0004491481,0.000031814525],"category_scores_gemma":[0.00016804374,0.0005053153,0.0001548176,0.0003174883,0.0004054119,0.00062063447,0.0014577506,0.0007518182,0.0000481293],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024162708,0.00003534807,0.00001036695,0.00030026652,0.000021350264,0.0005358051,0.0014537822,0.0056121824,0.000120631295,0.02846183,0.0011009616,0.9623233],"study_design_scores_gemma":[0.00039818478,0.0003925427,0.000003122581,0.002837179,0.000006522268,0.00044344596,4.6179744e-7,0.9222188,0.00040600754,0.004592829,0.067894764,0.0008061153],"about_ca_topic_score_codex":0.000047594312,"about_ca_topic_score_gemma":0.00002127137,"teacher_disagreement_score":0.9615172,"about_ca_system_score_codex":0.00030646092,"about_ca_system_score_gemma":0.00083327905,"threshold_uncertainty_score":0.9997398},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016175298,0.00030906644,0.9926923,0.00029356492,0.0025229515,0.00032024446,0.000008643842,0.00009424197,0.003597242],"genre_scores_gemma":[0.10251212,0.000017917979,0.8947014,0.0016514447,0.00021944384,0.0000080499185,0.000022091264,0.00003993652,0.00082758314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598116,0.000035080462,0.0006225941,0.0013406486,0.001408018,0.000612523],"domain_scores_gemma":[0.9975589,0.00020838929,0.00041576332,0.0014623383,0.0002136162,0.00014101408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009789636,0.0004734673,0.000588363,0.0009358306,0.00018746582,0.0002723105,0.003227532,0.00019644988,0.000030793766],"category_scores_gemma":[0.000049185932,0.00042704746,0.00014706489,0.00077092845,0.00066921726,0.0003166759,0.0019300901,0.0005096498,0.000026489124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007987295,0.000101370686,0.000024482986,0.000067030276,0.000026951288,0.00011104461,0.00026360407,0.15546712,0.00012807387,0.1547682,0.000098790464,0.68893534],"study_design_scores_gemma":[0.0007250735,0.00019639984,0.00007958168,0.00044041572,0.000018762094,0.00004030989,1.1443353e-7,0.926024,0.0013470508,0.06560641,0.00459443,0.0009274479],"about_ca_topic_score_codex":0.000040815397,"about_ca_topic_score_gemma":0.000013250416,"teacher_disagreement_score":0.77055687,"about_ca_system_score_codex":0.00020343429,"about_ca_system_score_gemma":0.00022238825,"threshold_uncertainty_score":0.99981815},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086867955,0.00028503814,0.9869064,0.0020132198,0.003974684,0.00070607354,0.000061048915,0.000393986,0.0047908546],"genre_scores_gemma":[0.2794839,0.000032941716,0.7147017,0.0033487277,0.0014172433,0.000043196782,0.000033380606,0.0000733915,0.0008654531],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99492705,0.00009078581,0.00064240996,0.0021796066,0.0012086467,0.0009515152],"domain_scores_gemma":[0.9947552,0.002041092,0.00030929607,0.001994571,0.00042368725,0.00047613127],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012010691,0.00077625486,0.00080993946,0.0019065447,0.0008097497,0.0017101613,0.0036916533,0.00041564976,0.00008739058],"category_scores_gemma":[0.00026075894,0.00072960276,0.0004055421,0.0017246412,0.0011151313,0.00087354466,0.0011321979,0.0010712954,0.00012003677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011049896,0.00006349758,0.00012558483,0.000021497508,0.00008114832,0.00015613869,0.0020075636,0.008791103,0.0008094089,0.11780809,0.0001951893,0.86983025],"study_design_scores_gemma":[0.0029676675,0.0005919246,0.00032099185,0.00066792284,0.00009276097,0.00025717862,0.0000054338234,0.13129087,0.001413691,0.84754425,0.012558578,0.0022887066],"about_ca_topic_score_codex":0.000046893754,"about_ca_topic_score_gemma":0.0002438742,"teacher_disagreement_score":0.86754155,"about_ca_system_score_codex":0.00021172233,"about_ca_system_score_gemma":0.00048669984,"threshold_uncertainty_score":0.99951553},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037227165,0.000041450938,0.95948344,0.00024019628,0.00018423583,0.00033700632,0.000011017535,0.000027686396,0.0024478235],"genre_scores_gemma":[0.9313587,0.0000066812568,0.067880556,0.00021953309,0.0003827877,0.0000031898146,0.00001825258,0.000018980892,0.00011132411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853027,0.000009129266,0.00025542476,0.000642682,0.00025572034,0.00030679733],"domain_scores_gemma":[0.9992487,0.00014367512,0.00016586241,0.00025693994,0.00009456321,0.00009028598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024336536,0.00022706547,0.00021956098,0.00024830565,0.00037761766,0.00033207439,0.0003572739,0.000073113166,0.00008527542],"category_scores_gemma":[0.000005278119,0.00021313896,0.000041338815,0.00035629194,0.00033474274,0.0003328253,0.00023404311,0.00024070684,0.00000855132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000152283355,0.00006606386,0.0027977964,0.000036538862,0.000037651378,0.00003496037,0.0020448808,0.54926676,0.046414066,0.040891588,0.00001636046,0.35837808],"study_design_scores_gemma":[0.0002090452,0.00003259956,0.00008711387,0.00013471623,0.000018252773,0.0000066846974,0.0000019525514,0.95306414,0.0040313383,0.041698415,0.0003795553,0.00033617188],"about_ca_topic_score_codex":0.000115278315,"about_ca_topic_score_gemma":0.000012473652,"teacher_disagreement_score":0.89413154,"about_ca_system_score_codex":0.00009984661,"about_ca_system_score_gemma":0.00015615289,"threshold_uncertainty_score":0.86915547},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030952314,0.002373239,0.99313927,0.0015505226,0.0006257719,0.0010403423,0.00023424735,0.00028303303,0.00044404253],"genre_scores_gemma":[0.2802506,0.00030051547,0.71606696,0.0020421355,0.0008180702,0.000119544275,0.0002669715,0.000088058725,0.000047143207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955446,0.000016602547,0.00055405044,0.002233535,0.0007177807,0.0009334131],"domain_scores_gemma":[0.99700147,0.0004565302,0.00029873196,0.0016449192,0.00032794153,0.00027039598],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006753583,0.0007130967,0.0006474246,0.00075022347,0.00050561345,0.0011183467,0.0032966372,0.0005829471,0.000010943952],"category_scores_gemma":[0.00010981842,0.0006285494,0.0002002816,0.0009782261,0.00091723324,0.0009045979,0.0015160226,0.0010081542,0.0000052189453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007306454,0.00015284159,0.00040318866,0.00032275653,0.00007250156,0.00011410096,0.00090075034,0.0020236436,0.0019162602,0.6660663,0.0009862158,0.3269684],"study_design_scores_gemma":[0.0005909367,0.00031571873,0.00021074254,0.00035987567,0.0000206699,0.000098279896,5.4678986e-7,0.28731823,0.0017680819,0.6888916,0.019259263,0.0011660341],"about_ca_topic_score_codex":0.000020258849,"about_ca_topic_score_gemma":0.00010038603,"teacher_disagreement_score":0.32580236,"about_ca_system_score_codex":0.00010963859,"about_ca_system_score_gemma":0.00028853683,"threshold_uncertainty_score":0.9999186},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015582365,0.00022739862,0.9926741,0.00061128114,0.0014503454,0.0008176054,0.000007772967,0.00019445202,0.0040154518],"genre_scores_gemma":[0.07980346,0.00013239947,0.91334236,0.0028282695,0.0005173116,0.00008386483,0.000032589585,0.00007778703,0.0031819402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669355,0.000027160588,0.00048209567,0.0013950499,0.00072581845,0.0006763228],"domain_scores_gemma":[0.9972739,0.00027027406,0.00025733578,0.0013277227,0.0006507476,0.00022001866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007059639,0.00042251858,0.00039496174,0.0006864439,0.00032971022,0.00046649246,0.0033188807,0.00029094427,0.000065839224],"category_scores_gemma":[0.00009746456,0.0003990483,0.00011530498,0.00055246934,0.0004269918,0.0005885083,0.00086863973,0.00044340568,0.0000824888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007034951,0.000057684214,0.000018255156,0.00011447358,0.000018491879,0.00002817166,0.0013834044,0.09769165,0.0000074132618,0.05975582,0.00031177694,0.84060585],"study_design_scores_gemma":[0.00032283572,0.00024329117,0.000032709253,0.00025221263,0.0000059364,0.000029458988,1.0227862e-7,0.8377963,0.00019424067,0.15546593,0.0050901645,0.0005668439],"about_ca_topic_score_codex":0.00002139779,"about_ca_topic_score_gemma":0.00004786827,"teacher_disagreement_score":0.84003896,"about_ca_system_score_codex":0.0002957687,"about_ca_system_score_gemma":0.0009222638,"threshold_uncertainty_score":0.99984616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017492122,0.0015370733,0.9897613,0.00023285467,0.001019404,0.0002224735,0.00005119924,0.00002514508,0.0054013235],"genre_scores_gemma":[0.8837995,0.000054535143,0.111839764,0.00035514127,0.0016004667,0.000010802228,0.000028091988,0.00007010609,0.0022415968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724895,0.000012630878,0.0010979616,0.0010704938,0.0001697966,0.000400182],"domain_scores_gemma":[0.9983746,0.000072614195,0.0007976919,0.0005676651,0.000116348085,0.000071081966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008640496,0.00036625116,0.0009998531,0.000992441,0.00023140272,0.000115871706,0.00079111074,0.0002809322,0.00012029705],"category_scores_gemma":[0.00007612379,0.00041097132,0.0002938077,0.0004545543,0.00048763317,0.00023587845,0.00043984508,0.00037801106,0.000029962299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046447425,0.00022258321,0.0025750506,0.0005253136,0.00014324639,0.00004312287,0.0052196328,0.40069982,0.00009310934,0.35159174,0.0018334405,0.2370065],"study_design_scores_gemma":[0.00036854658,0.00006440822,0.0023549737,0.0001372807,0.000014774748,0.0000042691718,4.4835357e-7,0.7013122,0.00004626753,0.2857737,0.009191769,0.0007314132],"about_ca_topic_score_codex":0.0014223461,"about_ca_topic_score_gemma":0.0006660845,"teacher_disagreement_score":0.8820503,"about_ca_system_score_codex":0.0003766158,"about_ca_system_score_gemma":0.00014593995,"threshold_uncertainty_score":0.99983424},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006415807,0.0005599582,0.949021,0.000043760076,0.00021105849,0.00013121594,0.000006130291,0.000058946713,0.043552116],"genre_scores_gemma":[0.9542811,0.000058796883,0.045432117,0.000119758006,0.00005414702,0.0000013588093,0.0000045281704,0.000012103406,0.000036077312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985488,0.000004118648,0.0003870076,0.0003391865,0.0003568518,0.00036401502],"domain_scores_gemma":[0.9993247,0.00019071742,0.00004186895,0.00032429685,0.000045552362,0.000072888804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029887902,0.00022494144,0.0005116538,0.00091056904,0.000024849163,0.00004069985,0.00054827146,0.00022299128,0.000038177346],"category_scores_gemma":[0.000030357387,0.0001977202,0.00012486737,0.0006862953,0.00027922206,0.00015212473,0.00011834788,0.00043254954,0.000004273757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029413716,0.000009326966,0.000073057745,0.00003303897,0.000042088763,0.000026448559,0.00013435954,0.59599954,0.00014328184,0.005791726,7.544161e-7,0.39774343],"study_design_scores_gemma":[0.000073328774,0.000043792024,0.0025635245,0.00013088567,0.000058278547,0.0000030992837,1.0075269e-7,0.98829365,0.0014875291,0.006957361,0.00015499185,0.00023345408],"about_ca_topic_score_codex":0.000012540047,"about_ca_topic_score_gemma":0.00019588134,"teacher_disagreement_score":0.9478653,"about_ca_system_score_codex":0.0001159346,"about_ca_system_score_gemma":0.000048556918,"threshold_uncertainty_score":0.8062796},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013983644,0.0011952294,0.99240667,0.00055353076,0.00071693637,0.00023923715,0.00000383621,0.0013937465,0.0033509962],"genre_scores_gemma":[0.54762524,0.000035985882,0.45112482,0.0006478385,0.00030311994,0.000008896505,0.0000034793964,0.00003318119,0.0002174443],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670106,0.000044118246,0.0006018167,0.0011278922,0.00097729,0.00054783537],"domain_scores_gemma":[0.9964486,0.0013699929,0.0005340126,0.0013657097,0.0002164769,0.00006523049],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015049962,0.00042780416,0.00047666198,0.00044518206,0.00033546498,0.00040197922,0.003954565,0.00023614398,0.0000036315018],"category_scores_gemma":[0.0003090819,0.0003214318,0.00012932104,0.0006782037,0.0009676286,0.00040609261,0.0010965379,0.0007473652,0.0000033880315],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022480344,0.00002853512,0.00029226494,0.00008425071,0.000014649935,0.000032676006,0.0011247777,0.02184346,0.0012234281,0.010227751,0.0023126267,0.9628133],"study_design_scores_gemma":[0.00014157305,0.00016924861,0.00014766154,0.0021134496,0.000013292513,0.00012407315,1.4654931e-7,0.4550385,0.010322001,0.5294409,0.0015923217,0.0008968396],"about_ca_topic_score_codex":0.00037932655,"about_ca_topic_score_gemma":0.000011029348,"teacher_disagreement_score":0.9619165,"about_ca_system_score_codex":0.00019884002,"about_ca_system_score_gemma":0.00041148093,"threshold_uncertainty_score":0.99992377},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025653388,0.0006676735,0.9872263,0.0006395844,0.00087010424,0.0002050025,0.0000038878293,0.000050224542,0.010080687],"genre_scores_gemma":[0.4687471,0.0000837468,0.52003545,0.0018185803,0.0009546019,0.000013876612,0.000024023253,0.000077062265,0.008245575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965514,0.000045392622,0.00060377753,0.0011137844,0.0011988564,0.00048677518],"domain_scores_gemma":[0.99756265,0.00047226448,0.000540406,0.0011684154,0.0001883763,0.000067884284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010371426,0.0003990765,0.0004968874,0.00062618626,0.00039672636,0.00030130628,0.0024639836,0.00013790559,0.000049716225],"category_scores_gemma":[0.000031693824,0.0002906021,0.00024271403,0.00063149363,0.0005884199,0.0003305662,0.001973392,0.00039140007,0.000024245948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010141532,0.000080051344,0.00091220514,0.00006530857,0.00014467906,0.000058938283,0.0043133083,0.29896837,0.0028569696,0.057882812,0.0007114155,0.6339958],"study_design_scores_gemma":[0.00040009018,0.000121476274,0.00075179426,0.0006923211,0.000045010318,0.000041612708,0.0000016591002,0.933074,0.025909763,0.03434065,0.003721192,0.00090044213],"about_ca_topic_score_codex":0.00005478205,"about_ca_topic_score_gemma":0.00008226134,"teacher_disagreement_score":0.6341056,"about_ca_system_score_codex":0.0002690216,"about_ca_system_score_gemma":0.00019140683,"threshold_uncertainty_score":0.99995464},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095545634,0.000029063738,0.99396694,0.00012980815,0.00076595845,0.0002836629,0.000007379624,0.000019595647,0.0038421096],"genre_scores_gemma":[0.9904441,0.0000016695913,0.00870284,0.00012825135,0.00057297916,0.0000062356853,0.000037266764,0.000022429507,0.00008419008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853015,0.000007162077,0.0002745634,0.0005838493,0.00030537316,0.00029889107],"domain_scores_gemma":[0.9992922,0.0000956209,0.0001399436,0.00033575945,0.00008119666,0.00005529958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017145887,0.00025241668,0.00023846573,0.00035977366,0.000081832266,0.00011237221,0.0004182992,0.000059503378,0.00006928752],"category_scores_gemma":[0.000010485008,0.00024334223,0.000051736108,0.00030272885,0.00019233645,0.00011038165,0.00015144852,0.00036766625,0.000021250733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002681397,0.00003448411,0.0006970644,0.000011766641,0.000004725815,0.0000052649643,0.0001773142,0.6383697,0.00003217938,0.1193474,7.847609e-7,0.24131663],"study_design_scores_gemma":[0.00033637916,0.000035812554,0.00041044859,0.00021494419,0.000006385575,0.0000017154945,1.6270461e-7,0.6328227,0.00002973316,0.3658873,0.00001787813,0.00023650702],"about_ca_topic_score_codex":0.000181741,"about_ca_topic_score_gemma":0.00012953862,"teacher_disagreement_score":0.98948866,"about_ca_system_score_codex":0.00025207593,"about_ca_system_score_gemma":0.0004428322,"threshold_uncertainty_score":0.99232084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007484152,0.0006180484,0.9904588,0.0005736499,0.0023680942,0.00032839781,0.000041073523,0.00025438014,0.004609143],"genre_scores_gemma":[0.109568134,0.00080229266,0.8817239,0.005091656,0.0015301314,0.00003465943,0.00020184036,0.00008565031,0.0009617599],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961626,0.000040851286,0.000500217,0.0016989631,0.0010232885,0.00057408796],"domain_scores_gemma":[0.9978184,0.00039003225,0.00028034643,0.0010988732,0.00020535695,0.00020699747],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029298142,0.00052302965,0.0004859496,0.0006009003,0.0003182255,0.00040683942,0.0022972168,0.0004533705,0.00013301142],"category_scores_gemma":[0.00007109769,0.000489836,0.00016379297,0.00035901702,0.0004322317,0.0011068766,0.0009740154,0.0008373686,0.00080356194],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008340723,0.000028635912,0.000014855158,0.000008706887,0.000009367541,0.00012763738,0.0009595292,0.0013341502,0.000475752,0.00008328994,0.0006459185,0.9963038],"study_design_scores_gemma":[0.001621867,0.0004992773,0.0005243508,0.0024997592,0.000032319593,0.00032078195,0.0000015520812,0.53285533,0.03342749,0.40122026,0.023644952,0.0033520472],"about_ca_topic_score_codex":0.00011242108,"about_ca_topic_score_gemma":0.00008507419,"teacher_disagreement_score":0.99295175,"about_ca_system_score_codex":0.00023555799,"about_ca_system_score_gemma":0.00034603308,"threshold_uncertainty_score":0.9999744},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009427103,0.00044798342,0.99529123,0.0009126629,0.00040223385,0.00017759294,0.0000035189023,0.00019186683,0.0024786661],"genre_scores_gemma":[0.12267982,0.00014146192,0.8717134,0.0041190274,0.000634644,0.0000055919477,0.0000038583653,0.000042886688,0.0006593312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974012,0.000027446402,0.00035699367,0.0011231283,0.0006635552,0.0004277103],"domain_scores_gemma":[0.99800956,0.000586886,0.00025693505,0.0008752466,0.0001492409,0.00012211489],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005766664,0.00037659856,0.00031000192,0.0005468449,0.00028622168,0.000562756,0.00157268,0.00029586477,0.000017353368],"category_scores_gemma":[0.00015774826,0.00033933957,0.0000791343,0.00046477295,0.0004428222,0.0004545054,0.0007741931,0.0007007462,0.000016491631],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004485881,0.000019749179,0.000013148317,0.000032002874,0.0000061783367,0.000041935367,0.00035746928,0.0021258765,0.00068323355,0.049317103,0.000020326113,0.9473785],"study_design_scores_gemma":[0.00016237605,0.00016523959,0.00005500025,0.00058364915,0.000008227945,0.000078830475,1.17832386e-7,0.85457313,0.015820842,0.124358475,0.003500701,0.00069342746],"about_ca_topic_score_codex":0.0000061582077,"about_ca_topic_score_gemma":0.0000049955124,"teacher_disagreement_score":0.9466851,"about_ca_system_score_codex":0.00015128519,"about_ca_system_score_gemma":0.0002193334,"threshold_uncertainty_score":0.9999059},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011155755,0.00004766018,0.99740237,0.0004123784,0.00018752096,0.00030735615,0.000015783144,0.000075694996,0.00043568062],"genre_scores_gemma":[0.7291875,0.0000035725232,0.2705278,0.000057319183,0.00009696972,0.0000141838245,0.000023834751,0.000017988757,0.00007086952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979656,0.000023245777,0.00033455945,0.0008559284,0.0004752642,0.00034541552],"domain_scores_gemma":[0.99805224,0.00096920005,0.0003356797,0.00038394635,0.00015984557,0.00009908938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049062655,0.00030515486,0.00034165973,0.000446159,0.00033718388,0.0001731873,0.00067073543,0.00012356708,0.00000337692],"category_scores_gemma":[0.00013933443,0.0002648505,0.0000540238,0.0002590173,0.0003153414,0.00026146762,0.0001740678,0.0005949794,0.0000017364725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007366616,0.000019127792,0.00013410722,0.000045092635,0.0000090080375,0.0000029247967,0.0009816671,0.313873,0.000036174803,0.041224256,0.0000015007621,0.6436658],"study_design_scores_gemma":[0.00028556446,0.00041909932,0.0016843504,0.0006494444,0.000009931437,0.00002941401,0.0000024017531,0.98516876,0.000036667596,0.011317537,0.000100433455,0.00029641666],"about_ca_topic_score_codex":0.000006935759,"about_ca_topic_score_gemma":0.000013691825,"teacher_disagreement_score":0.72807187,"about_ca_system_score_codex":0.00009997532,"about_ca_system_score_gemma":0.00026529038,"threshold_uncertainty_score":0.9999804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010100727,0.00075833977,0.9943595,0.00049351034,0.0020513905,0.0008547851,0.0000057605507,0.000107490276,0.001359127],"genre_scores_gemma":[0.0011948382,0.00011778474,0.9956252,0.0014493507,0.00076998543,0.00004903397,0.00004634138,0.000037687885,0.0007097981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958872,0.000035328547,0.0008697983,0.001863874,0.00063423614,0.0007095699],"domain_scores_gemma":[0.9971448,0.0003692855,0.00058661227,0.0014644947,0.00025054094,0.00018424078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023569027,0.00059984677,0.0009278867,0.0009354873,0.00046321965,0.0008802599,0.003426671,0.000401759,0.00003124269],"category_scores_gemma":[0.00013660065,0.0005115702,0.00036548774,0.00084632955,0.0002754509,0.0005430981,0.0008795427,0.0008376716,0.000018516634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014401693,0.00013723744,0.0000443717,0.00014552582,0.00009203546,0.000007689428,0.0010392325,0.011478355,0.01365346,0.027676985,0.00040058338,0.9453101],"study_design_scores_gemma":[0.0006103221,0.00009489481,0.000008455146,0.0002767749,0.0000306295,0.000028483017,1.7604837e-7,0.94631416,0.0038748526,0.0056226947,0.042275906,0.0008626843],"about_ca_topic_score_codex":0.000010132477,"about_ca_topic_score_gemma":0.000022738866,"teacher_disagreement_score":0.94444746,"about_ca_system_score_codex":0.00015092308,"about_ca_system_score_gemma":0.00023763157,"threshold_uncertainty_score":0.99973357},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020319253,0.00007050069,0.9772218,0.00004057863,0.00095386297,0.00020699852,0.0000023967834,0.00018710349,0.0009974915],"genre_scores_gemma":[0.6721319,0.000009589758,0.32745948,0.00010442466,0.00026902588,0.0000014587845,0.000006178317,0.000011548871,0.0000063746575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975155,0.00003848073,0.0005242554,0.0007963451,0.0006874028,0.000438021],"domain_scores_gemma":[0.9983158,0.00025992957,0.00043696453,0.0006880463,0.00016953405,0.00012972306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016243581,0.0003406637,0.00040994788,0.0014798436,0.00028905412,0.00037407735,0.0015637607,0.00035218347,0.0000020881726],"category_scores_gemma":[0.000082007704,0.000319889,0.000049932067,0.0004647787,0.00058383483,0.0022846833,0.0007766425,0.00074106356,0.00000340306],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006801625,0.000019438865,0.00009685309,0.000039453967,0.000004270287,0.000016750935,0.0010406693,0.006170043,0.00044637916,0.012184747,8.110482e-7,0.9799738],"study_design_scores_gemma":[0.00033522525,0.00069862424,0.0038746134,0.0003950747,0.000007970469,0.00013048566,0.000004179895,0.9639192,0.004601341,0.025078788,0.00032678607,0.0006276653],"about_ca_topic_score_codex":0.000027793378,"about_ca_topic_score_gemma":0.000039773462,"teacher_disagreement_score":0.9793461,"about_ca_system_score_codex":0.00018095516,"about_ca_system_score_gemma":0.0002036207,"threshold_uncertainty_score":0.9999253},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009917246,0.0005096651,0.98814654,0.00010383272,0.00050500064,0.0006625979,0.000016101332,0.000055260665,0.000083748964],"genre_scores_gemma":[0.3378931,0.000025023368,0.66180104,0.00007701939,0.00016919525,0.000005278128,0.00001234996,0.000013708881,0.0000033011015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997205,0.00005060795,0.0005232217,0.0010622346,0.00081847433,0.000340416],"domain_scores_gemma":[0.9978004,0.00025694908,0.0004408074,0.001057758,0.00033279532,0.00011125172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012131413,0.0003261202,0.00037708046,0.00071871554,0.00017925061,0.0002981651,0.0013181621,0.00024162722,0.000011097169],"category_scores_gemma":[0.00011317331,0.00031064593,0.00008482812,0.000429198,0.00049690343,0.0008139616,0.0010378899,0.00038188067,0.000006278934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001396367,0.000051579747,0.0005819346,0.00012384611,0.0000191281,0.000004440773,0.0025613524,0.04128929,0.0064139175,0.014457376,0.0000106092175,0.93447256],"study_design_scores_gemma":[0.00034728824,0.00005053157,0.00055775,0.00019701273,0.000014817571,0.000018641531,3.2174117e-7,0.96361727,0.0025851245,0.032142073,0.00015553208,0.00031363746],"about_ca_topic_score_codex":0.00010013539,"about_ca_topic_score_gemma":0.00002250802,"teacher_disagreement_score":0.9341589,"about_ca_system_score_codex":0.00012460505,"about_ca_system_score_gemma":0.00022350594,"threshold_uncertainty_score":0.99993455},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004889112,0.0008853164,0.9887501,0.00037736387,0.00083021045,0.001505669,0.0000017190587,0.00031023254,0.0068504484],"genre_scores_gemma":[0.4925335,0.000033082062,0.50601435,0.0001695501,0.00037646617,0.000106020714,0.000035838508,0.00005033998,0.00068083976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950605,0.00008854642,0.0008469547,0.0020500536,0.0011654139,0.000788509],"domain_scores_gemma":[0.99647456,0.00033415447,0.0008279945,0.0015853184,0.00052253547,0.00025543958],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068678573,0.0007595734,0.0008494196,0.0006325056,0.00033585352,0.00037064953,0.0025522124,0.00051232916,0.000014307949],"category_scores_gemma":[0.0000916072,0.00053777755,0.00023122723,0.0011184139,0.0015503797,0.00076731294,0.00075256627,0.00082426856,0.000011996889],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090453286,0.0004565668,0.0007392266,0.00014247645,0.000041090658,0.00074045465,0.0062498944,0.0028035739,0.00016703241,0.0043552946,0.000024175357,0.98418975],"study_design_scores_gemma":[0.0041831397,0.018736761,0.003137596,0.00785832,0.00028839917,0.004613758,0.000015497853,0.75477684,0.0030660864,0.19085756,0.006526659,0.0059393924],"about_ca_topic_score_codex":0.00005493652,"about_ca_topic_score_gemma":0.000104050276,"teacher_disagreement_score":0.9782504,"about_ca_system_score_codex":0.0002323354,"about_ca_system_score_gemma":0.00058113673,"threshold_uncertainty_score":0.9997074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007750966,0.00061665813,0.9934725,0.00012459281,0.0024112663,0.00030730315,0.000002741177,0.000065595836,0.002224255],"genre_scores_gemma":[0.108897775,0.000029769195,0.8898595,0.00067018863,0.00031324735,0.0000032649702,0.0000030898836,0.000039731498,0.00018342934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956455,0.00010825628,0.00088319974,0.0013667298,0.0012119452,0.000784341],"domain_scores_gemma":[0.9972175,0.00067850057,0.00039191943,0.0012490841,0.00025708784,0.00020591295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020596094,0.0005194761,0.00079329644,0.0025715844,0.00012931562,0.00018633004,0.0027300816,0.00048462945,0.000017222083],"category_scores_gemma":[0.00015091294,0.00046652192,0.00021695574,0.001501089,0.00051750446,0.0005547614,0.00093441113,0.0010291348,0.0000057983016],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008173593,0.00014983905,0.0004345098,0.000143169,0.000014399919,0.0008560836,0.0034132374,0.01321721,0.029390339,0.0013595759,0.000054713633,0.9508852],"study_design_scores_gemma":[0.0018416968,0.0004888985,0.0006479536,0.0024561589,0.000029068613,0.0002802905,5.945556e-7,0.76578975,0.05383691,0.17115664,0.001587349,0.0018846965],"about_ca_topic_score_codex":0.000306931,"about_ca_topic_score_gemma":0.00009336158,"teacher_disagreement_score":0.9490005,"about_ca_system_score_codex":0.0007524777,"about_ca_system_score_gemma":0.0005174054,"threshold_uncertainty_score":0.9997786},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022572344,0.00046419507,0.97437364,0.00043500983,0.00077555235,0.0002982238,0.000003891609,0.000077481534,0.0009996898],"genre_scores_gemma":[0.96902585,0.0001080428,0.029654974,0.0009119677,0.00024557472,0.000005304021,0.000004448585,0.000021118516,0.000022748918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971064,0.000048074875,0.00056628906,0.0012249772,0.0006400956,0.0004141998],"domain_scores_gemma":[0.99802303,0.00027039926,0.00039413714,0.001048045,0.00016206654,0.00010233195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006391599,0.00039729022,0.00048272926,0.0012132123,0.00010494235,0.00022227658,0.0020299326,0.00026217598,0.000005555018],"category_scores_gemma":[0.000006076504,0.00036515074,0.000065574524,0.00071020715,0.00025152866,0.00040883792,0.0008167396,0.0005058534,0.000009989603],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017467113,0.000038148322,0.0019674988,0.0004502904,0.000011954282,0.000019654384,0.004207554,0.005010747,0.01294018,0.008285876,4.9556957e-7,0.96705014],"study_design_scores_gemma":[0.0008175881,0.00037853673,0.009815283,0.0015891222,0.000016485563,0.000088446235,0.000003108966,0.87837815,0.028184978,0.077385694,0.0022779251,0.001064692],"about_ca_topic_score_codex":0.00016189835,"about_ca_topic_score_gemma":0.0038627773,"teacher_disagreement_score":0.9659854,"about_ca_system_score_codex":0.00007663325,"about_ca_system_score_gemma":0.00011611258,"threshold_uncertainty_score":0.99988},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005461706,0.00018817256,0.99668497,0.0003361772,0.0005671143,0.00075057556,0.000007243295,0.0001438146,0.00077577354],"genre_scores_gemma":[0.6163189,0.000046796376,0.3815663,0.0013652919,0.00036170613,0.000036677906,0.000016849057,0.000039492705,0.00024800457],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740714,0.00004683896,0.00033166396,0.0009279129,0.0007758419,0.0005106284],"domain_scores_gemma":[0.99812746,0.0002885431,0.00014882167,0.0007969892,0.00043887438,0.00019929309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012766063,0.00038272893,0.0004237149,0.00053876836,0.0003687619,0.0007297957,0.0015010093,0.0002262605,0.0000037675607],"category_scores_gemma":[0.0000699957,0.0003318909,0.00008624626,0.00033164778,0.000538291,0.0011641372,0.000280287,0.0004326359,0.000005895626],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028767477,0.000021738995,0.000018292274,0.00004900671,0.000004315248,0.000013954826,0.0006533549,0.0011453197,0.00027192308,0.06544508,0.0000024542098,0.9323458],"study_design_scores_gemma":[0.0021528618,0.0029985753,0.0095042605,0.0009369137,0.000032218795,0.00021737213,0.0000023299463,0.4105766,0.013293665,0.5542266,0.0035483586,0.0025102186],"about_ca_topic_score_codex":0.00002249802,"about_ca_topic_score_gemma":0.00004663318,"teacher_disagreement_score":0.92983556,"about_ca_system_score_codex":0.00020974994,"about_ca_system_score_gemma":0.0004127871,"threshold_uncertainty_score":0.99991333},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011883531,0.0005666585,0.98412275,0.00101077,0.0009431856,0.00043239247,0.0000039951797,0.000316354,0.012485057],"genre_scores_gemma":[0.1408334,0.00003685799,0.8554677,0.0028877135,0.0006029913,0.0000037829368,0.0000073014457,0.00004919683,0.00011106451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99492395,0.00003809164,0.00057418516,0.0020804857,0.0013538948,0.0010293813],"domain_scores_gemma":[0.9970242,0.00030852624,0.0003530442,0.0018188213,0.00023012195,0.00026533013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083139975,0.00075893255,0.0007213768,0.000748547,0.00042645997,0.0008736988,0.0043628006,0.00035198292,0.000026770824],"category_scores_gemma":[0.00002476117,0.00058790407,0.00014618099,0.0007926066,0.00077994587,0.00065458874,0.0014868438,0.0010657877,0.000089317444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064577976,0.000030586372,0.00010496117,0.000024244633,0.000008730197,0.0002667227,0.0005699311,0.04350106,0.0000073138362,0.009356326,0.000030668976,0.946093],"study_design_scores_gemma":[0.0005324846,0.00035689436,0.00043363508,0.00049082673,0.000012465783,0.00032104016,1.6166899e-7,0.94177353,0.00009762351,0.05088539,0.003923651,0.0011722917],"about_ca_topic_score_codex":0.00002393792,"about_ca_topic_score_gemma":0.000084875566,"teacher_disagreement_score":0.9449207,"about_ca_system_score_codex":0.00027883143,"about_ca_system_score_gemma":0.0004933116,"threshold_uncertainty_score":0.9996572},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091102004,0.001228602,0.9017193,0.000041295632,0.000897553,0.0005300964,0.000007919496,0.000023336814,0.004449928],"genre_scores_gemma":[0.9193118,0.00006913395,0.07867336,0.00084789615,0.0005916363,0.000013817687,0.0000384597,0.00005634043,0.0003975416],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99752986,0.00005979942,0.00034906503,0.0011476049,0.0004717568,0.0004419388],"domain_scores_gemma":[0.9988133,0.000024354747,0.00016648902,0.00069840025,0.00015685243,0.000140645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020729625,0.0005027418,0.00041736994,0.00017962603,0.00021597251,0.00019644531,0.0007825724,0.0004350002,0.000055915047],"category_scores_gemma":[0.00006828475,0.00042990857,0.00011646387,0.000106733416,0.00027979282,0.000009267884,0.00029276934,0.0003706468,0.0000111572745],"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.000054433058,0.00003982514,0.00040695322,0.00020447971,0.0000959365,0.00006765559,0.000633415,0.086651385,0.8152745,0.0015332655,0.000045266897,0.094992906],"study_design_scores_gemma":[0.00081374863,0.00078643323,0.00018131251,0.0005000666,0.00006655545,0.0005251756,0.0000031587829,0.056069493,0.9014479,0.0348995,0.002426175,0.0022804649],"about_ca_topic_score_codex":0.000009450276,"about_ca_topic_score_gemma":0.000016744552,"teacher_disagreement_score":0.8282098,"about_ca_system_score_codex":0.0001383077,"about_ca_system_score_gemma":0.0002861071,"threshold_uncertainty_score":0.9998153},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032276541,0.00007766949,0.9673391,0.00027726838,0.0007735967,0.00019648855,0.00004129363,0.0000811773,0.02798577],"genre_scores_gemma":[0.1692327,0.000021989697,0.8287326,0.00041967497,0.0008321377,8.8972814e-7,0.00010534575,0.000040612395,0.0006140513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974335,0.000016136639,0.000316387,0.0013628996,0.0005434915,0.0003275771],"domain_scores_gemma":[0.9979165,0.00017547612,0.00018170361,0.0016245592,0.000016240088,0.00008548544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035094988,0.000280852,0.00024589023,0.00014077939,0.00025891804,0.00018910141,0.0014930775,0.00021736274,0.0002611685],"category_scores_gemma":[0.000034016157,0.00026899952,0.000041205858,0.0002637557,0.0009476711,0.00030763843,0.0011304723,0.00048713855,0.00022300519],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000152155,0.000007971219,0.00032401123,0.0000020103216,0.0000030268025,0.000007127571,0.00005561529,0.0192445,0.0014669447,0.000045960165,0.00020823508,0.9786331],"study_design_scores_gemma":[0.00027106624,0.000050780065,0.004473916,0.0003828071,0.0000418935,0.00013761745,3.1922346e-7,0.7854937,0.0024870369,0.14704609,0.05842319,0.0011916051],"about_ca_topic_score_codex":0.0012417844,"about_ca_topic_score_gemma":0.000554183,"teacher_disagreement_score":0.9774415,"about_ca_system_score_codex":0.0003051132,"about_ca_system_score_gemma":0.00006161313,"threshold_uncertainty_score":0.9999762},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005186094,0.00046728336,0.9934459,0.0005543211,0.0011811235,0.0005461739,0.000009497601,0.00027223368,0.0034716073],"genre_scores_gemma":[0.24837404,0.000053108408,0.74798316,0.0007814597,0.00037721603,0.000033610067,0.000008633761,0.000040589093,0.0023481662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628794,0.000032396045,0.00055638084,0.0016064164,0.0007625416,0.0007543289],"domain_scores_gemma":[0.997138,0.0010100601,0.0003268565,0.00089978334,0.00051126257,0.00011399648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008122448,0.0005563159,0.0006076677,0.00066879566,0.00039320395,0.0006175395,0.0033050047,0.00036693795,0.0000046253363],"category_scores_gemma":[0.00024960752,0.00050164247,0.00014767656,0.0006406272,0.0008017003,0.0005978246,0.0010468247,0.00071563886,0.00002290774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006682224,0.000014995934,0.000017011558,0.000016568169,0.000006841712,0.000018184564,0.00068148825,0.6337222,0.000081491395,0.06431094,0.0000907223,0.3010329],"study_design_scores_gemma":[0.00012414198,0.00021300817,0.000011051278,0.00013579443,0.000006198678,0.000013073604,7.3813374e-7,0.83574045,0.00081004325,0.16145977,0.0009819351,0.0005038229],"about_ca_topic_score_codex":0.0000120597015,"about_ca_topic_score_gemma":0.00013103151,"teacher_disagreement_score":0.3005291,"about_ca_system_score_codex":0.00024254773,"about_ca_system_score_gemma":0.0012140186,"threshold_uncertainty_score":0.9997435},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009362161,0.00054894545,0.99538803,0.00037919098,0.0002146914,0.00019170309,0.0000012833349,0.00012219431,0.002217762],"genre_scores_gemma":[0.7442404,0.000058049995,0.25478697,0.000505591,0.00013534413,0.0000050553676,0.0000025128752,0.000023488445,0.00024260668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696034,0.000016767668,0.00041401127,0.0013461589,0.0007014948,0.00056120456],"domain_scores_gemma":[0.9986715,0.00015102224,0.00013934658,0.00070836715,0.00015110183,0.0001786844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047706105,0.00050126226,0.00044723286,0.00047020474,0.00030054932,0.00073795696,0.0010050199,0.00022302559,0.0000022175498],"category_scores_gemma":[0.000015200802,0.00041292582,0.00003644602,0.00025204194,0.0005400895,0.0005352606,0.00084407674,0.0005876188,0.0000027691092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057558,0.0000075208536,0.000048020134,0.00003080553,0.000009354121,0.00006048693,0.0005149801,0.7656506,0.000038460963,0.026605194,0.000004302235,0.20702456],"study_design_scores_gemma":[0.0002348004,0.00020856332,0.000026109488,0.0004443155,0.000010615586,0.00012534735,3.2584867e-7,0.94917935,0.00008137867,0.04913135,0.000035840065,0.00052201014],"about_ca_topic_score_codex":0.00013954852,"about_ca_topic_score_gemma":0.00025976825,"teacher_disagreement_score":0.7433042,"about_ca_system_score_codex":0.00011414205,"about_ca_system_score_gemma":0.0003590058,"threshold_uncertainty_score":0.9998323},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013979612,0.00016525648,0.9867955,0.00036732157,0.0033443014,0.00071809714,0.0000022085605,0.00024268366,0.008224876],"genre_scores_gemma":[0.18543163,0.00004000226,0.81112707,0.00082650146,0.001342451,0.000033536762,0.000008776874,0.000048055306,0.0011419643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968188,0.000024712273,0.00050632196,0.0014053136,0.0005579963,0.00068686256],"domain_scores_gemma":[0.9977465,0.0005837744,0.0002918024,0.0009943044,0.00025702763,0.00012654687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014062912,0.00046278638,0.0005067465,0.0010611914,0.00026349863,0.0006621044,0.002948757,0.0005347278,0.000010127661],"category_scores_gemma":[0.00024062865,0.00041739037,0.00013977554,0.00059163815,0.00045443195,0.00080560497,0.0008410732,0.00095783634,0.000019063089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006450698,0.000026784788,0.00012453964,0.00005412483,0.0000039113775,0.000022561473,0.0012912324,0.00022300545,0.0011955668,0.13515206,0.000023565663,0.8618762],"study_design_scores_gemma":[0.00042785774,0.00028191914,0.000276584,0.0005499194,0.000007228359,0.000075132884,3.229577e-7,0.21760583,0.018143963,0.75155735,0.010054198,0.0010196866],"about_ca_topic_score_codex":0.000033982513,"about_ca_topic_score_gemma":0.00037031065,"teacher_disagreement_score":0.86085653,"about_ca_system_score_codex":0.00034354313,"about_ca_system_score_gemma":0.0004168807,"threshold_uncertainty_score":0.9998278},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025077166,0.000106031046,0.99667835,0.00055401487,0.0005628273,0.00078855467,0.00006879794,0.00020446889,0.0010118558],"genre_scores_gemma":[0.0025969208,0.0000036926356,0.9944499,0.0006999195,0.00044376252,0.0001624014,0.00029377508,0.000033851848,0.0013157747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620503,0.0000504429,0.00045106537,0.001683642,0.0008684675,0.0007413298],"domain_scores_gemma":[0.9969475,0.0011013164,0.0005017796,0.000823388,0.00047742476,0.00014859007],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001529452,0.00046700283,0.00049573166,0.00049545756,0.000691801,0.0010516979,0.0026217191,0.00033745507,0.0000015558719],"category_scores_gemma":[0.000502063,0.0004491562,0.00013573932,0.0009411015,0.00022472253,0.0006004449,0.00064737006,0.00072693283,0.000008636388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003308911,0.00015884494,0.000042272706,0.000068042275,0.000021396781,0.0000030485937,0.001800192,0.71749306,0.00015177055,0.0023751615,0.0002562753,0.27762663],"study_design_scores_gemma":[0.00066910643,0.00014357119,0.000067040746,0.00020813479,0.000012918542,0.000005809671,0.0000011542354,0.99167114,0.00054378825,0.0020188915,0.0041228053,0.0005356481],"about_ca_topic_score_codex":0.000019421399,"about_ca_topic_score_gemma":0.000013238078,"teacher_disagreement_score":0.27709097,"about_ca_system_score_codex":0.0020740733,"about_ca_system_score_gemma":0.0032259938,"threshold_uncertainty_score":0.9999853},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013995236,0.00025552095,0.9877297,0.00048743273,0.0016002632,0.0019484006,0.000004450764,0.00028298993,0.0075512314],"genre_scores_gemma":[0.23778392,0.000012725996,0.7597016,0.0017795112,0.0004376505,0.00009094769,0.000013540981,0.000033502372,0.00014661952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99438035,0.00009406971,0.0011737533,0.0018016357,0.001509683,0.001040481],"domain_scores_gemma":[0.9963732,0.00045379126,0.00035509077,0.0021114575,0.00039661364,0.00030989118],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020721182,0.00072471803,0.0008663381,0.0019794297,0.00017354892,0.0013140253,0.005042154,0.00043775587,0.0000025431214],"category_scores_gemma":[0.0003063578,0.0006751496,0.00013391809,0.0019044142,0.0003467639,0.0015273801,0.0018311949,0.0010524754,0.00009080662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038150115,0.00005821285,0.00002219135,0.00008612523,0.0000029073642,0.000017113096,0.00095345837,0.5216653,0.0000028442414,0.020706685,0.000010851416,0.45647055],"study_design_scores_gemma":[0.0002456799,0.00023694057,0.0005370201,0.00030755778,0.0000038111466,0.000106073625,3.904278e-7,0.90166074,0.0000120870845,0.09512052,0.001050298,0.0007188672],"about_ca_topic_score_codex":0.00009527922,"about_ca_topic_score_gemma":0.000059367936,"teacher_disagreement_score":0.4557517,"about_ca_system_score_codex":0.0013809676,"about_ca_system_score_gemma":0.00089236937,"threshold_uncertainty_score":0.9997227},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24538426,0.009697526,0.71020126,0.0005680402,0.0014373038,0.001335499,0.0002380344,0.00005697202,0.0310811],"genre_scores_gemma":[0.9698938,0.0010839051,0.026426017,0.0010496306,0.0006674959,0.000014848866,0.00012753514,0.00006818143,0.00066856353],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979728,0.000013244645,0.000276108,0.00097003364,0.00033129516,0.00043652923],"domain_scores_gemma":[0.99889135,0.000027098238,0.00009678701,0.0006807711,0.00020166508,0.00010232207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016895302,0.00041859533,0.00035542256,0.00016966781,0.00019177541,0.00007396548,0.0006795425,0.000297297,0.0000068817985],"category_scores_gemma":[0.000014590872,0.0003550316,0.000080000296,0.0001324692,0.0006471262,0.0000023706687,0.0004559719,0.0002703295,0.000011621373],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019441433,0.00013700285,0.0021723346,0.000110255845,0.0003670728,0.00041541923,0.0009603248,0.0454708,0.8139474,0.0002379392,0.0004906748,0.13549638],"study_design_scores_gemma":[0.0040414897,0.010023446,0.042460877,0.0012391167,0.00035925407,0.0034138171,0.0000074411205,0.013063687,0.3268148,0.011074854,0.57581455,0.011686686],"about_ca_topic_score_codex":0.000010432507,"about_ca_topic_score_gemma":0.00008522279,"teacher_disagreement_score":0.72450954,"about_ca_system_score_codex":0.000052428804,"about_ca_system_score_gemma":0.000305886,"threshold_uncertainty_score":0.99989015},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005639151,0.00035789088,0.9969267,0.00021604191,0.00073088886,0.0005498309,0.000016590213,0.00015124818,0.00048688924],"genre_scores_gemma":[0.41642502,0.000034507135,0.58290845,0.00018865851,0.00015562987,0.000026481674,0.0000041919025,0.00004279668,0.00021428907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666244,0.000018889783,0.00050572003,0.0011085361,0.0010313953,0.00067303923],"domain_scores_gemma":[0.9948292,0.0032046817,0.00017121762,0.0013136286,0.00033110564,0.0001501876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008167844,0.00038935535,0.0005097882,0.00092317705,0.000105695166,0.00020214824,0.0033377926,0.00021157502,0.000032497086],"category_scores_gemma":[0.00066318555,0.00036085476,0.00012059098,0.00063478196,0.0005116387,0.00013748254,0.0007103272,0.0005000351,0.000031656484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074353893,0.000029608265,0.000040337298,0.00011773781,0.000011081449,0.000013581638,0.0004705249,0.60000557,0.00008408091,0.010896888,0.000014595102,0.38830858],"study_design_scores_gemma":[0.000239612,0.00025523116,0.00022244784,0.00041922455,0.0000056143977,0.000012234779,4.7841283e-8,0.9375663,0.0017616019,0.05843569,0.00064437545,0.00043765892],"about_ca_topic_score_codex":0.000018086736,"about_ca_topic_score_gemma":0.000012028044,"teacher_disagreement_score":0.4158611,"about_ca_system_score_codex":0.00020930004,"about_ca_system_score_gemma":0.0007478462,"threshold_uncertainty_score":0.99988437},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026510006,0.00050684426,0.9920004,0.0010267746,0.001000068,0.00032027139,0.000037841444,0.00023884272,0.004842424],"genre_scores_gemma":[0.0075077526,0.00030274116,0.98678195,0.0030860153,0.00075596565,0.00004200735,0.00004755237,0.000055427277,0.0014205986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960545,0.000021640637,0.00053182396,0.0017342566,0.000995735,0.0006620717],"domain_scores_gemma":[0.9969459,0.0002943334,0.00026229853,0.0020683173,0.0001992949,0.00022983665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004883879,0.00050840474,0.00047578017,0.000638643,0.00037782383,0.0005489742,0.004336214,0.00027281436,0.00003412976],"category_scores_gemma":[0.000053987722,0.0004676162,0.00013431264,0.0007064834,0.0006850904,0.0006244933,0.0015710061,0.0006904516,0.0002202353],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012187814,0.00004804408,0.000014984792,0.000016646802,0.000011516107,0.00012673449,0.0007864888,0.0017056605,0.00006075758,0.021529093,0.001482227,0.97421664],"study_design_scores_gemma":[0.00037217658,0.00020587673,0.00016114881,0.00039569344,0.000010212572,0.0004050063,1.512267e-7,0.7792737,0.0008158314,0.06706072,0.14994071,0.0013588007],"about_ca_topic_score_codex":0.00005213058,"about_ca_topic_score_gemma":0.00003117881,"teacher_disagreement_score":0.97285783,"about_ca_system_score_codex":0.00024353534,"about_ca_system_score_gemma":0.0005570653,"threshold_uncertainty_score":0.99977756},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05568383,0.000111204856,0.9428816,0.00073706784,0.00016961344,0.00031716263,0.0000016602046,0.0000916838,0.000006217134],"genre_scores_gemma":[0.52265084,0.0000025867023,0.47696257,0.0002887034,0.000067092136,0.000021319436,0.000002677291,0.0000033162003,8.748189e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823946,0.000019393647,0.00026384005,0.00073477445,0.0003037355,0.00043881292],"domain_scores_gemma":[0.9991059,0.000112599235,0.00012285598,0.00045953426,0.00012221989,0.000076905504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030875346,0.00016402322,0.000187867,0.00038604927,0.00037013862,0.0003441515,0.00085508724,0.00004336177,0.0000014937449],"category_scores_gemma":[0.000021098784,0.000149622,0.00005074286,0.0038278564,0.00022925455,0.0008902025,0.0002901048,0.000111571244,0.0000029944374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034874654,0.000051381812,0.0040436164,0.000013838975,0.000010879343,0.0000037917027,0.00008735836,0.2784929,0.008347905,0.004789511,0.000008952867,0.704115],"study_design_scores_gemma":[0.00024605004,0.00036211533,0.019053724,0.000011771048,0.000017116481,0.000019864323,4.7903507e-7,0.9140079,0.019122515,0.04691327,0.00004545059,0.00019976521],"about_ca_topic_score_codex":0.000036401227,"about_ca_topic_score_gemma":0.000088309724,"teacher_disagreement_score":0.70391524,"about_ca_system_score_codex":0.00011078113,"about_ca_system_score_gemma":0.00007246758,"threshold_uncertainty_score":0.61014086},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001990981,0.0001388199,0.9965155,0.0003937552,0.00024666954,0.00033534598,0.0000039233573,0.000065544904,0.00030947334],"genre_scores_gemma":[0.78639257,0.000039506063,0.21175191,0.0014245914,0.00020456553,0.0000041308867,0.00001807474,0.00002964305,0.00013501372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882454,0.000009625107,0.00029794205,0.0004250264,0.00026625642,0.00017659103],"domain_scores_gemma":[0.9991194,0.000067702924,0.00018233065,0.0003782881,0.00019847997,0.00005379973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012402669,0.00018651277,0.00028958608,0.00028093564,0.00006237354,0.00001720888,0.00018909691,0.00015082798,0.000015643061],"category_scores_gemma":[0.00006944404,0.00016721665,0.00006524184,0.00026448755,0.00035851396,0.00007797505,0.000087882734,0.00035184328,8.4370527e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021294536,0.0004103058,0.0033487312,0.00091820676,0.000057969373,0.00014506918,0.0012389836,0.17687885,0.074537896,0.11963679,0.00022587321,0.62238836],"study_design_scores_gemma":[0.00035402857,0.00040065084,0.00020333716,0.0007010678,0.000046388916,0.00016748166,1.6932341e-7,0.92542124,0.026822817,0.04456662,0.0009902617,0.000325966],"about_ca_topic_score_codex":0.000013519862,"about_ca_topic_score_gemma":0.000004924403,"teacher_disagreement_score":0.7847636,"about_ca_system_score_codex":0.000120230965,"about_ca_system_score_gemma":0.000115112016,"threshold_uncertainty_score":0.6818897},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011152386,0.0005381278,0.9934732,0.00096969417,0.0014784394,0.0004202462,0.000009478448,0.00029182452,0.001703806],"genre_scores_gemma":[0.5465286,0.00006850931,0.45168006,0.0013141908,0.00020571498,0.000010324909,0.000015274201,0.000041114134,0.00013624261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594474,0.00006047891,0.0009325195,0.0011154971,0.00090869947,0.0010380668],"domain_scores_gemma":[0.99487907,0.0011855894,0.0003746366,0.0029516476,0.00044991547,0.00015912991],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002874439,0.0006289204,0.0008241294,0.0026897658,0.000155144,0.00034263646,0.00848417,0.00051214814,0.000010409482],"category_scores_gemma":[0.0002429466,0.00061858055,0.00011614278,0.0017618166,0.0012426255,0.0007085785,0.0067151813,0.002050286,0.000014272683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016488792,0.000058999653,0.00078026036,0.00006368514,0.000015077616,0.00024073744,0.0018427104,0.16944471,0.00006630412,0.05873506,0.00016071952,0.76857525],"study_design_scores_gemma":[0.00043263132,0.00032168874,0.00060982275,0.0031054895,0.000008813286,0.00010641247,0.000006027289,0.89527935,0.0012788892,0.09470067,0.0027534137,0.0013967964],"about_ca_topic_score_codex":0.0003462911,"about_ca_topic_score_gemma":0.008188999,"teacher_disagreement_score":0.7671785,"about_ca_system_score_codex":0.00040139866,"about_ca_system_score_gemma":0.00028690428,"threshold_uncertainty_score":0.9996266},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020664718,0.008250908,0.9869489,0.000049964736,0.0020847558,0.0018564265,0.0000033687143,0.000121736346,0.000477261],"genre_scores_gemma":[0.2001086,0.0032579007,0.78957534,0.0042632343,0.0010057201,0.00076427375,0.0000166858,0.00019457596,0.0008136362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952218,0.000057890196,0.00077911915,0.002141198,0.00060143566,0.0011985825],"domain_scores_gemma":[0.9972699,0.0006708163,0.00036007975,0.0013268492,0.00014206939,0.0002302565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014641938,0.0006816317,0.0007597602,0.0005854799,0.0002866972,0.000674023,0.0024348106,0.0005111885,0.000009812342],"category_scores_gemma":[0.000051849926,0.0006928079,0.00013469823,0.0006812352,0.00042572766,0.0006292081,0.0017851127,0.0009834615,0.0000045950555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005682428,0.000016947475,0.000051671715,0.000032844167,0.000005539462,0.000035583023,0.0005654061,0.359598,0.000006157965,0.0009044335,0.000028712402,0.638749],"study_design_scores_gemma":[0.0005405461,0.00037902308,0.000043532495,0.0005588134,0.0000064626,0.00006371462,5.657088e-7,0.97381425,0.000035174493,0.012778587,0.01105392,0.0007254387],"about_ca_topic_score_codex":0.0000045011507,"about_ca_topic_score_gemma":0.0001732236,"teacher_disagreement_score":0.63802356,"about_ca_system_score_codex":0.00039932347,"about_ca_system_score_gemma":0.00019489184,"threshold_uncertainty_score":0.9995523},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014959605,0.00011264774,0.99514896,0.00017254965,0.00019933347,0.00056036393,5.6133007e-7,0.00007251639,0.0022371286],"genre_scores_gemma":[0.8122632,0.000012648447,0.18686949,0.00074533036,0.000058879865,0.000013609582,5.1530117e-7,0.0000116215015,0.000024715388],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722284,0.00009152185,0.00057129207,0.00093989394,0.0008299495,0.00034447535],"domain_scores_gemma":[0.9972179,0.00063971354,0.00040516185,0.0015326346,0.00017524096,0.000029338447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011655699,0.00032395657,0.00044245532,0.0010404801,0.000103103,0.000152408,0.0028224117,0.00016233888,0.0000068267004],"category_scores_gemma":[0.00011493988,0.0002445968,0.000087270644,0.0010411886,0.00021080433,0.00049962965,0.00081228645,0.0006485172,0.0000038264093],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014975674,0.0002681185,0.000846205,0.00003710798,0.000019849025,0.00033648516,0.026570408,0.007964753,0.00011069002,0.029700378,0.000015790767,0.93411523],"study_design_scores_gemma":[0.0006086143,0.0016822029,0.0035256438,0.00082373264,0.000035591987,0.00010517587,0.000015459418,0.23048835,0.0021218238,0.759128,0.00034122984,0.0011241944],"about_ca_topic_score_codex":0.0000911161,"about_ca_topic_score_gemma":0.00057392515,"teacher_disagreement_score":0.932991,"about_ca_system_score_codex":0.00010415806,"about_ca_system_score_gemma":0.00010531076,"threshold_uncertainty_score":0.99743676},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4495134,0.000018910354,0.55015534,0.00016029426,0.00006369542,0.000043807464,1.7021691e-7,0.000041879415,0.000002477895],"genre_scores_gemma":[0.8210231,0.0000016087886,0.1787606,0.00015059454,0.000056701923,4.540092e-7,9.109992e-7,0.0000058419964,1.7884196e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936193,0.000017045399,0.00012841994,0.00018046658,0.0001346095,0.0001775539],"domain_scores_gemma":[0.9997476,0.000045863006,0.000019103092,0.00010418733,0.00004124912,0.000042043688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019061808,0.000079886246,0.00006788896,0.00006233619,0.000079814636,0.000113652,0.00006571972,0.00003907497,0.000004080386],"category_scores_gemma":[0.000022021997,0.0000777326,0.000010333603,0.0005122645,0.000055753753,0.00019727691,0.000011224542,0.000077919,0.0000012463411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022408926,0.000007409294,0.0011427748,0.0000071726904,7.016404e-7,6.7769423e-7,0.00011448774,0.93830454,0.04503014,0.000033473683,0.0000014301585,0.015354944],"study_design_scores_gemma":[0.00014050356,0.00002197569,0.00081693544,0.000016643779,0.000001708252,0.000004712369,2.5653227e-7,0.8688131,0.1299006,0.00019193924,0.000007996327,0.000083602376],"about_ca_topic_score_codex":0.000024569905,"about_ca_topic_score_gemma":0.00012293049,"teacher_disagreement_score":0.3715097,"about_ca_system_score_codex":0.00009947544,"about_ca_system_score_gemma":0.000033960227,"threshold_uncertainty_score":0.31698433},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001810783,0.000336638,0.9808649,0.0007447131,0.0021152778,0.0003508301,0.0000058510495,0.00026632485,0.015134386],"genre_scores_gemma":[0.15847805,0.000032247142,0.82684404,0.011131635,0.001466397,0.000017648741,0.000004095226,0.00008638238,0.0019395174],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956564,0.000036998295,0.0004916352,0.0018058035,0.0010973744,0.00091182004],"domain_scores_gemma":[0.99670523,0.0005815271,0.00025569138,0.0018621705,0.0002304966,0.00036488308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014617805,0.000603027,0.000546438,0.0016836002,0.0003488734,0.00065871986,0.0049198787,0.0003499187,0.00004553552],"category_scores_gemma":[0.00010108969,0.00056576426,0.0002230016,0.0014497942,0.00051817636,0.00045670063,0.0018705914,0.00085017877,0.00017231221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011623287,0.00003425237,0.00015562124,0.000025318834,0.000012650316,0.00014995027,0.00067314814,0.0037098175,0.00011414646,0.18842728,0.000047060912,0.80663913],"study_design_scores_gemma":[0.00043281837,0.0006316023,0.0021580937,0.001218134,0.00001754886,0.00016313829,5.894901e-7,0.032237194,0.0027090134,0.9233316,0.034936476,0.0021637871],"about_ca_topic_score_codex":0.000010305448,"about_ca_topic_score_gemma":0.000096523225,"teacher_disagreement_score":0.8044753,"about_ca_system_score_codex":0.00016883505,"about_ca_system_score_gemma":0.00025214715,"threshold_uncertainty_score":0.9996794},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8213472,0.022888906,0.1510581,0.00031965514,0.0008271949,0.0004847891,0.00007031976,0.00006615607,0.0029377304],"genre_scores_gemma":[0.98198116,0.0009258422,0.015391391,0.00023738285,0.00033702134,0.0000028340435,0.00003077078,0.000028301416,0.0010652753],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99857295,0.000017721692,0.00028111442,0.0006738401,0.000169915,0.00028445048],"domain_scores_gemma":[0.9991689,0.00005099445,0.00013706472,0.00044283085,0.00011100868,0.00008925386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019127391,0.00026752826,0.00033689605,0.00021609991,0.0001177908,0.000028743727,0.0005504195,0.0004084273,0.0000072954917],"category_scores_gemma":[0.0000666617,0.00022651441,0.00007896374,0.000083609855,0.0018389325,0.0000028350373,0.0005634255,0.00025030161,0.0000054828893],"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.000032464246,0.000076587115,0.00065377384,0.00019573735,0.00005499005,0.000039127914,0.00076293765,0.00013546151,0.6816138,0.00019401667,0.00030763345,0.3159335],"study_design_scores_gemma":[0.006864458,0.0113194985,0.016582685,0.0036827668,0.00025070153,0.0018426791,0.00001075775,0.025473222,0.6799445,0.012929854,0.23360145,0.007497422],"about_ca_topic_score_codex":0.000018692444,"about_ca_topic_score_gemma":0.0001675075,"teacher_disagreement_score":0.30843607,"about_ca_system_score_codex":0.000024355406,"about_ca_system_score_gemma":0.00026764133,"threshold_uncertainty_score":0.923699},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003372626,0.00012071865,0.9951732,0.00048470098,0.0016106744,0.0007268766,0.000029925728,0.00010248853,0.0014141242],"genre_scores_gemma":[0.16027519,0.000027039694,0.8377772,0.0007705227,0.00050734676,0.000020465615,0.000025705553,0.0000478847,0.0005486505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962742,0.000020990961,0.00048700388,0.0014330628,0.0011071037,0.0006776949],"domain_scores_gemma":[0.9971387,0.0006069079,0.0002577625,0.0015985547,0.00026384185,0.00013424248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011303957,0.00045241843,0.0005199641,0.0014030082,0.0002418162,0.00040274262,0.004066019,0.00022713358,0.00001057936],"category_scores_gemma":[0.00011181222,0.0003890661,0.00017985787,0.0007768821,0.00059189246,0.0002901872,0.0015543369,0.00065441907,0.000010570595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023176377,0.00012913614,0.000011994119,0.00011507134,0.00002466076,0.000031511197,0.0007245193,0.04851789,0.001687751,0.04449783,0.00002060324,0.9042159],"study_design_scores_gemma":[0.00068273616,0.0006221917,0.00010479261,0.00045768643,0.000012967288,0.000009325771,5.120003e-7,0.9364077,0.01499968,0.0451823,0.0008369524,0.00068315095],"about_ca_topic_score_codex":0.000028938299,"about_ca_topic_score_gemma":0.00010656874,"teacher_disagreement_score":0.9035327,"about_ca_system_score_codex":0.0000749377,"about_ca_system_score_gemma":0.00029102893,"threshold_uncertainty_score":0.9998561},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018903962,0.000152487,0.9875614,0.00003094617,0.0010956321,0.00023295873,0.0000016198519,0.00021374223,0.008820831],"genre_scores_gemma":[0.989965,0.000017291557,0.009020074,0.0001801146,0.0004983949,0.0000031440704,0.0000032419246,0.000043422875,0.00026931567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986773,0.0000053292697,0.00022709068,0.00040237702,0.00044021962,0.0002476554],"domain_scores_gemma":[0.9992724,0.00018991709,0.000044551423,0.00035876417,0.00006415156,0.00007018698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010206436,0.00028308187,0.0002521684,0.00033273344,0.00010235626,0.00011935,0.00028590133,0.00015328042,0.000036298174],"category_scores_gemma":[0.000012048301,0.00023455931,0.00003659366,0.00013904418,0.00014908555,0.00012509742,0.000034815264,0.0003474899,0.000082979575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032997318,0.0000027717917,0.000010495921,0.000022294606,0.000005715696,0.000021546972,0.0003469402,0.9571774,0.000031523843,0.00031446543,0.000011985805,0.042051584],"study_design_scores_gemma":[0.00018619007,0.00008242922,0.000107535605,0.00037141613,0.0000035194237,0.000036718906,1.05070264e-7,0.9970446,0.0002207632,0.00046867647,0.0011473801,0.00033066573],"about_ca_topic_score_codex":0.0000035663543,"about_ca_topic_score_gemma":0.00004277796,"teacher_disagreement_score":0.9880746,"about_ca_system_score_codex":0.00019537799,"about_ca_system_score_gemma":0.00006173223,"threshold_uncertainty_score":0.95650506},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010856779,0.0007766609,0.9926998,0.0010139244,0.00014941469,0.00027822985,0.0000010083616,0.00013705765,0.00483531],"genre_scores_gemma":[0.08264146,0.000608731,0.91368425,0.0017091156,0.00022484765,0.000008437732,0.0000037778238,0.000041985346,0.0010773869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971049,0.00003713448,0.00025872287,0.0011211835,0.0009261069,0.0005519867],"domain_scores_gemma":[0.9985054,0.00029083842,0.00012873867,0.0006845366,0.00016892614,0.00022152581],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004937172,0.00035379932,0.00034215098,0.00068659196,0.00042012447,0.0006291568,0.0016534555,0.00014347135,0.000012028822],"category_scores_gemma":[0.00003728,0.0002724297,0.000042604483,0.00042178974,0.0010103368,0.0006486419,0.0009696409,0.00065035536,0.000012058102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008589382,0.000027377364,0.0002569903,0.000040501156,0.000016346929,0.0002091871,0.004978021,0.19082247,0.000037577563,0.014710901,0.00005261741,0.7888394],"study_design_scores_gemma":[0.00039604853,0.000355559,0.00027310784,0.00033531283,0.0000032212902,0.00020653149,3.4342793e-7,0.96114314,0.00033008313,0.031774625,0.004499269,0.0006827471],"about_ca_topic_score_codex":0.000026137102,"about_ca_topic_score_gemma":0.000097837576,"teacher_disagreement_score":0.7881567,"about_ca_system_score_codex":0.000076800796,"about_ca_system_score_gemma":0.00040736224,"threshold_uncertainty_score":0.99997276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014362407,0.00012585273,0.9918036,0.00030310018,0.00019976862,0.0006681052,0.000057041158,0.00010218365,0.006596724],"genre_scores_gemma":[0.70495,0.00000709409,0.28973216,0.00045909907,0.00025917563,0.000043236207,0.00002922541,0.000025906502,0.004494093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960962,0.000016663063,0.0008708815,0.0014692656,0.0011408658,0.00040611502],"domain_scores_gemma":[0.9954341,0.0019565015,0.000499155,0.001348599,0.0006508004,0.000110813024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015991688,0.0003443569,0.00060216757,0.0012768538,0.000355977,0.00065246597,0.002077849,0.00030075532,0.00006418046],"category_scores_gemma":[0.00015988108,0.00027703465,0.00040568647,0.0017413079,0.00033231123,0.00035032214,0.00036321173,0.0002950125,0.0000137725565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037280952,0.000015327556,0.000038421786,0.0000046671025,0.000010774849,9.435143e-7,0.00009294439,0.7274376,0.00012005522,0.0033660159,0.00029175504,0.26861775],"study_design_scores_gemma":[0.000078338795,0.000026776015,0.000019467176,0.000014081066,0.000035240395,7.0722695e-7,1.6553012e-7,0.6769717,0.0010920329,0.31965435,0.0018816276,0.00022551035],"about_ca_topic_score_codex":0.00007203172,"about_ca_topic_score_gemma":0.00009164437,"teacher_disagreement_score":0.7048064,"about_ca_system_score_codex":0.00016064703,"about_ca_system_score_gemma":0.0001946395,"threshold_uncertainty_score":0.9999682},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003979423,0.00009827218,0.9959763,0.000085492014,0.0018195397,0.00050923316,0.0000017936296,0.0006741569,0.00043726215],"genre_scores_gemma":[0.041933686,0.000013782266,0.95609385,0.0011408352,0.0006236295,0.0000074729696,0.0000028899783,0.00003666183,0.00014719294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604815,0.000054347238,0.00072707806,0.0012659562,0.0012880679,0.0006164135],"domain_scores_gemma":[0.99781656,0.00037102203,0.00043189104,0.0007789431,0.00040079132,0.00020078346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014396264,0.00048441594,0.0004481008,0.0015381706,0.00032323066,0.0004962416,0.0018213851,0.0004342934,0.000047719626],"category_scores_gemma":[0.00021525176,0.00046659308,0.000120224206,0.0011508832,0.0005191759,0.0009341503,0.00061829196,0.00086412334,0.000030942454],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001869004,0.000018728153,0.0000094968555,0.000041565287,0.000006465344,0.000024414245,0.00023448006,0.0012181284,0.0060051247,0.00033719125,0.0000054822317,0.9920971],"study_design_scores_gemma":[0.00017444445,0.00013173526,0.00011107933,0.00031465045,0.00000977767,0.00013147006,1.268209e-7,0.8594838,0.11809223,0.020986639,0.000086537635,0.000477513],"about_ca_topic_score_codex":0.000056827583,"about_ca_topic_score_gemma":0.00015404313,"teacher_disagreement_score":0.9916195,"about_ca_system_score_codex":0.0007403545,"about_ca_system_score_gemma":0.0005117287,"threshold_uncertainty_score":0.99977857},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007985822,0.00045691826,0.985146,0.0012197932,0.0033246665,0.0005921038,0.000009091218,0.0002863903,0.008885172],"genre_scores_gemma":[0.019910662,0.00002321558,0.97454447,0.004359375,0.0003974585,0.000024947383,0.000008272337,0.00006738011,0.0006642281],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99458396,0.000070132446,0.0006763638,0.0022293804,0.001394173,0.0010459805],"domain_scores_gemma":[0.99625874,0.0005029383,0.00031756004,0.0022979642,0.00032284812,0.00029992516],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010756231,0.0007542292,0.0007062625,0.0009175037,0.0005400835,0.0012547888,0.0049172817,0.00040286637,0.000051961757],"category_scores_gemma":[0.00017382026,0.0007180669,0.00024350201,0.0011077758,0.0015620542,0.00076604565,0.0014583321,0.001240669,0.00009579588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006661065,0.00009874604,0.000029578132,0.000095849464,0.000026091557,0.00026780253,0.0009701812,0.0072634043,0.00002303032,0.27051955,0.0001724023,0.7205267],"study_design_scores_gemma":[0.00022323648,0.00016991151,0.000066727276,0.00021981604,0.000007652019,0.00014708369,7.8854626e-8,0.29143256,0.00010435261,0.702068,0.004822032,0.00073860754],"about_ca_topic_score_codex":0.000020433623,"about_ca_topic_score_gemma":0.000087882116,"teacher_disagreement_score":0.7197881,"about_ca_system_score_codex":0.0003870045,"about_ca_system_score_gemma":0.00078432064,"threshold_uncertainty_score":0.999782},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034326307,0.0023629256,0.90743166,0.0010201387,0.0059625013,0.0011597908,0.000016913378,0.00018813011,0.04753162],"genre_scores_gemma":[0.9184207,0.00058111886,0.05169683,0.023887327,0.0011285992,0.00003565953,0.0000018408348,0.00013145103,0.0041165114],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957916,0.00005813842,0.0006049686,0.0017140656,0.001087543,0.00074366166],"domain_scores_gemma":[0.99822384,0.00048548827,0.00029309862,0.0007551629,0.00008052782,0.00016190871],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007152143,0.0005197919,0.00051806174,0.00085659034,0.00021346498,0.0003510138,0.0019428164,0.00032262306,0.00031481805],"category_scores_gemma":[0.00043471577,0.00044533072,0.00009750971,0.00067433517,0.0012643082,0.00057026505,0.00043083762,0.0010777409,0.00010595243],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011459357,0.00015244486,0.00054797746,0.00030700638,0.00000495489,0.0011447829,0.00188615,0.08374831,0.05923016,0.016561566,0.000079884565,0.8362222],"study_design_scores_gemma":[0.0015930171,0.0010930949,0.00055426627,0.0030937225,0.000020174835,0.0011286172,0.0000020631996,0.059701886,0.29566395,0.62404835,0.00958941,0.0035114519],"about_ca_topic_score_codex":0.000020668971,"about_ca_topic_score_gemma":0.00010178093,"teacher_disagreement_score":0.88409436,"about_ca_system_score_codex":0.00017381922,"about_ca_system_score_gemma":0.0004058131,"threshold_uncertainty_score":0.99979985},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011285841,0.00082651566,0.9886834,0.00036835027,0.00086000125,0.00032534322,0.000007439263,0.00060590624,0.0082102055],"genre_scores_gemma":[0.100125,0.00021903036,0.89649224,0.001150722,0.00063682534,0.000014397319,0.000010694332,0.00006038804,0.0012906803],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944054,0.000045129116,0.000791119,0.0023901684,0.0015007694,0.0008674287],"domain_scores_gemma":[0.9956086,0.00087288686,0.00064233906,0.0024111518,0.00023340655,0.00023161678],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005904764,0.0007741007,0.0008245967,0.0011040453,0.00034090414,0.0008677696,0.005330717,0.00039608293,0.00017085423],"category_scores_gemma":[0.00017747252,0.0007420782,0.00025492575,0.0008440294,0.00055320846,0.0018149707,0.0021584842,0.0011422883,0.0001744206],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030455599,0.000044829983,0.0001983128,0.000012281839,0.000034590008,0.00028137528,0.00045039822,0.0054936456,0.00042075233,0.0059149098,0.000093050694,0.9870528],"study_design_scores_gemma":[0.00037984212,0.00016900824,0.00024030107,0.0008949844,0.000044995995,0.0000690742,2.5273573e-7,0.3592879,0.011071108,0.6151019,0.010773501,0.001967168],"about_ca_topic_score_codex":0.00010703768,"about_ca_topic_score_gemma":0.00007952111,"teacher_disagreement_score":0.98508567,"about_ca_system_score_codex":0.0005621972,"about_ca_system_score_gemma":0.00019750948,"threshold_uncertainty_score":0.999503},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09910225,0.0023399226,0.89412,0.00036716685,0.0010052245,0.0004443998,0.0000059560125,0.000018469651,0.0025965995],"genre_scores_gemma":[0.99065286,0.00009584854,0.008404782,0.000663036,0.000085943,0.000004568998,0.0000037115256,0.000015293686,0.00007392821],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985228,0.00012626288,0.0002687493,0.00062361214,0.00024963985,0.0002089377],"domain_scores_gemma":[0.9992956,0.00017505056,0.00015165017,0.0002547618,0.00006827891,0.000054688742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046257654,0.0002225762,0.000335586,0.00047543246,0.00008824693,0.000046239493,0.00025061148,0.00021429949,0.000013418505],"category_scores_gemma":[0.000013322837,0.00021527526,0.000034285804,0.00014544713,0.00084430876,0.00019737647,0.000078506426,0.0006430707,0.000001237052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028646179,0.00036535144,0.001517895,0.00017056803,0.000058808528,0.00008645034,0.19757685,0.008625393,0.0009861522,0.058743082,0.000029344423,0.7315537],"study_design_scores_gemma":[0.0036263932,0.0012216326,0.04824092,0.003396344,0.000045092034,0.00035073835,0.00006430078,0.11602571,0.0013146475,0.8240147,0.000092493625,0.0016069895],"about_ca_topic_score_codex":0.00002162468,"about_ca_topic_score_gemma":0.00010697699,"teacher_disagreement_score":0.89155066,"about_ca_system_score_codex":0.00006671108,"about_ca_system_score_gemma":0.00006302742,"threshold_uncertainty_score":0.877867},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090021867,0.0004659244,0.9846892,0.00014768595,0.004013488,0.0004536519,0.0000024857645,0.00018558251,0.009141768],"genre_scores_gemma":[0.9172957,0.00018136876,0.07947992,0.001352436,0.00068112736,0.00003692073,0.000005325387,0.000066900866,0.0009003084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604625,0.00007791517,0.0007838988,0.0015780978,0.00075557886,0.0007582865],"domain_scores_gemma":[0.99756455,0.00031242595,0.00033669182,0.0013991613,0.00021505532,0.00017213008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007734988,0.0005347751,0.0006199698,0.001647294,0.00018170702,0.00044447853,0.0032204583,0.0004509426,0.000026935299],"category_scores_gemma":[0.000049386064,0.00048091388,0.00016460307,0.0011569372,0.00040400273,0.0006213492,0.00065717037,0.00097359973,0.000059927053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029929413,0.00011154306,0.00086307526,0.00008453854,0.000030713036,0.0005993863,0.0053307326,0.028408578,0.00019178735,0.2854313,0.0002467396,0.6786717],"study_design_scores_gemma":[0.00064671773,0.00038051678,0.00205243,0.0013870285,0.0000070127767,0.00020036372,5.366383e-7,0.528683,0.0006597259,0.45921588,0.0052897353,0.0014770678],"about_ca_topic_score_codex":0.00023763147,"about_ca_topic_score_gemma":0.0006742394,"teacher_disagreement_score":0.9163955,"about_ca_system_score_codex":0.00028988684,"about_ca_system_score_gemma":0.0003053405,"threshold_uncertainty_score":0.99976426},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060764232,0.00024662653,0.99736655,0.0001993228,0.0007108225,0.0007072233,0.000011405685,0.00019244132,0.00050487515],"genre_scores_gemma":[0.005285141,0.000022711554,0.9935928,0.0004224882,0.00018314918,0.000053462292,0.000024021692,0.00003208222,0.0003841444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970725,0.00002918926,0.00050651736,0.0013645395,0.0005992412,0.00042797276],"domain_scores_gemma":[0.99790853,0.00017642621,0.0003645483,0.001100709,0.00035406553,0.00009569578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011683399,0.0003838617,0.00034412259,0.0005744522,0.00027365726,0.0004187959,0.0014024599,0.00035080168,0.0000014883597],"category_scores_gemma":[0.000216842,0.00038113934,0.000079039186,0.00035411524,0.00043031978,0.00091554737,0.0003860369,0.00037603918,0.0000070038855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011989078,0.00001981868,0.000015717182,0.00009435578,0.0000055470136,0.0000027170065,0.0005042741,0.14336646,0.00019306976,0.20486577,0.00007076549,0.6508495],"study_design_scores_gemma":[0.00016526804,0.000075316224,0.00009764512,0.00009109218,0.000006895331,0.00001529017,5.0773792e-8,0.78231806,0.0011757361,0.21505594,0.000661525,0.00033715848],"about_ca_topic_score_codex":0.000009396135,"about_ca_topic_score_gemma":0.000011723379,"teacher_disagreement_score":0.65051234,"about_ca_system_score_codex":0.00028454888,"about_ca_system_score_gemma":0.0003197679,"threshold_uncertainty_score":0.99986404},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011444549,0.00016354618,0.9740881,0.0034035402,0.0064721038,0.0004975537,0.00001498372,0.000062479914,0.003853165],"genre_scores_gemma":[0.68523943,0.00008137176,0.3084784,0.0025477803,0.001134253,0.000010198095,0.000012735732,0.0000478167,0.0024480324],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941341,0.00008708981,0.00092854036,0.0020425948,0.002234274,0.0005733648],"domain_scores_gemma":[0.99490315,0.0022041514,0.0003744892,0.0021033501,0.00025909542,0.00015577688],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007557826,0.00038442083,0.00048955716,0.0012320861,0.0004765868,0.0017522447,0.0031398819,0.0002715479,0.00011963231],"category_scores_gemma":[0.0016709106,0.0002453513,0.000097419776,0.0014087673,0.0028269505,0.0003427812,0.002236443,0.0009689828,0.00010626946],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007634502,0.000020133522,0.0023642692,0.000007829088,0.0000064524634,0.000055025463,0.00048256875,0.0033242386,0.00012723605,0.009069076,0.00030230507,0.98423326],"study_design_scores_gemma":[0.0005411091,0.000081257196,0.00881823,0.00037841764,0.000018517761,0.00021808923,0.000005172628,0.294326,0.00036232258,0.661531,0.032942805,0.00077707716],"about_ca_topic_score_codex":0.0001062806,"about_ca_topic_score_gemma":0.0009930083,"teacher_disagreement_score":0.98345613,"about_ca_system_score_codex":0.00011376745,"about_ca_system_score_gemma":0.00023849207,"threshold_uncertainty_score":0.9999999},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023032012,0.000072836316,0.9733924,0.0015639863,0.0015987941,0.0010946485,0.0000047709614,0.00016631678,0.01980303],"genre_scores_gemma":[0.9499336,0.0000055505425,0.03649664,0.012106308,0.0008564015,0.000046057958,0.00009605624,0.00009038422,0.0003689967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969169,0.000010824045,0.00045902078,0.0011898048,0.0007701751,0.00065328815],"domain_scores_gemma":[0.9984257,0.00029942155,0.00027881557,0.0008584175,0.000105100335,0.00003253877],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010379577,0.0005412156,0.00047720282,0.0019418136,0.00022914054,0.00051801,0.0013381937,0.0002825235,0.00009650334],"category_scores_gemma":[0.00021020297,0.0004970639,0.0001265037,0.0007144509,0.0003929803,0.00050030655,0.00070598634,0.0011044573,0.0000802037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001423613,0.0007440496,0.013511447,0.00115612,0.000028564462,0.00024101771,0.00040162884,0.5242733,0.00050783076,0.0128230965,0.00018754881,0.44598308],"study_design_scores_gemma":[0.00071181013,0.000029622652,0.0015430062,0.00037615505,0.000011495025,0.0000011914393,0.0000010278727,0.97976047,0.000035059467,0.0071793115,0.009772283,0.0005785864],"about_ca_topic_score_codex":0.00017795217,"about_ca_topic_score_gemma":0.0004103718,"teacher_disagreement_score":0.9476304,"about_ca_system_score_codex":0.00027245632,"about_ca_system_score_gemma":0.00007702478,"threshold_uncertainty_score":0.9997481},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016950851,0.000020190439,0.97963583,0.007830408,0.0006099223,0.00052721216,0.0000262966,0.00013059992,0.011202555],"genre_scores_gemma":[0.008163584,0.000020813317,0.9802631,0.008210736,0.000515904,0.000077752426,0.00002102692,0.00004022786,0.0026868144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963032,0.00007985211,0.00041188073,0.0013511836,0.001231317,0.00062258623],"domain_scores_gemma":[0.99674255,0.00088822196,0.00039203407,0.0016260374,0.0002323895,0.00011877414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002339544,0.0004149243,0.00034865123,0.0003253211,0.00050177914,0.0007635095,0.0037209566,0.00020679679,0.000036082347],"category_scores_gemma":[0.00021623967,0.00024951066,0.00011574637,0.00078537833,0.00023978736,0.00035462694,0.0008223462,0.00081721623,0.00008283252],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039702877,0.00007040827,0.00003933971,0.000011229771,0.00001076972,0.000018163797,0.0002248719,0.008901211,0.00013714458,0.016217902,0.00080693245,0.97355807],"study_design_scores_gemma":[0.00019777846,0.0001032753,0.00010698831,0.0002852483,0.0000067639244,0.00001299818,2.768528e-7,0.9621443,0.0010849898,0.019923156,0.015726414,0.0004077849],"about_ca_topic_score_codex":0.00009047031,"about_ca_topic_score_gemma":0.00005496634,"teacher_disagreement_score":0.97315025,"about_ca_system_score_codex":0.0009357178,"about_ca_system_score_gemma":0.00055510196,"threshold_uncertainty_score":0.9999957},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007732499,0.00060373754,0.9580986,0.0265331,0.004426401,0.00078710105,0.0000109101375,0.00018274262,0.008584153],"genre_scores_gemma":[0.91664314,0.00051381206,0.0776801,0.002807622,0.0009888663,0.00005918643,0.000013419255,0.000031589647,0.0012622719],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987082,0.000030324474,0.00022814267,0.00043683924,0.00029382677,0.00030269037],"domain_scores_gemma":[0.99663955,0.0023732595,0.00016439609,0.00057915587,0.00016242312,0.00008118685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009610231,0.0001793821,0.00020551626,0.00029047107,0.0006744274,0.00027385625,0.001686228,0.00024049735,0.000076967335],"category_scores_gemma":[0.0002724225,0.00013874813,0.00005694758,0.00016508672,0.0021448757,0.00018386709,0.0005861304,0.0008983772,0.000012727725],"study_design_candidate":"design_other","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.000005389915,0.000012345213,0.0002861028,0.000017259526,0.0000139888625,0.0000015987307,0.01182285,0.000019867575,0.000075524375,0.03569225,0.00003604467,0.9520168],"study_design_scores_gemma":[0.00037314423,0.000046813562,0.00079663424,0.00037834593,0.0000432767,0.000025786208,0.000035820998,0.12005011,0.000653912,0.1316187,0.74535596,0.00062150904],"about_ca_topic_score_codex":0.0011653148,"about_ca_topic_score_gemma":0.07534821,"teacher_disagreement_score":0.9513953,"about_ca_system_score_codex":0.00007811822,"about_ca_system_score_gemma":0.00018836609,"threshold_uncertainty_score":0.94152427},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041359253,0.00007022853,0.9937653,0.0002979912,0.0012175159,0.0012104795,0.0000022627235,0.00042298165,0.0025996703],"genre_scores_gemma":[0.6701976,0.00008596321,0.32665637,0.001775502,0.00039413906,0.00008349856,0.000012571866,0.000052631236,0.0007417312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963303,0.000097900775,0.00054921955,0.0016454717,0.00086046883,0.0005166233],"domain_scores_gemma":[0.9980708,0.00056657114,0.00030024233,0.0007235507,0.00022054369,0.00011833732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009910703,0.0005324498,0.00045327976,0.0018376233,0.00021705253,0.0005294326,0.0008148161,0.00043353,0.0000121947705],"category_scores_gemma":[0.0002006095,0.0005066375,0.00008386141,0.0008302132,0.00028894408,0.00054934894,0.00024073673,0.00097332144,0.00001646363],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030494719,0.000043151904,0.0000109346065,0.000026124098,0.000002081723,0.00013895612,0.00013239859,0.0058232215,0.0003365678,0.00035177937,0.000008434636,0.9930959],"study_design_scores_gemma":[0.00039508185,0.00095935137,0.000156006,0.0008210555,0.000006009576,0.00028074303,2.1561178e-7,0.9240807,0.023643827,0.048189674,0.0008361405,0.0006311862],"about_ca_topic_score_codex":0.00006714009,"about_ca_topic_score_gemma":0.00024403002,"teacher_disagreement_score":0.99246466,"about_ca_system_score_codex":0.00080713496,"about_ca_system_score_gemma":0.0002964282,"threshold_uncertainty_score":0.9997385},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021072027,0.0011636129,0.9780626,0.00008652164,0.0006809245,0.00023005254,0.000026041906,0.0007855368,0.018753935],"genre_scores_gemma":[0.83303726,0.00067485415,0.16490504,0.0005616425,0.00048101268,0.000024314175,0.00004793431,0.00012858113,0.00013934879],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998392,0.000014586566,0.00033639706,0.0005353046,0.00037801266,0.0003436994],"domain_scores_gemma":[0.9980869,0.00018822074,0.00008355014,0.0014387863,0.000096628246,0.00010588035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023909072,0.00039120237,0.00038183152,0.0004384555,0.00008054855,0.00011177548,0.0020101874,0.00038345842,0.00012431038],"category_scores_gemma":[0.000021889291,0.00040829033,0.000080138416,0.0001854723,0.0003867437,0.00021208037,0.0005919553,0.00089411903,0.0000810335],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000116016,0.000049817772,0.00006751218,0.00014870957,0.00007149954,0.00008005996,0.008193057,0.05571534,0.0019531755,0.012310233,0.0005227118,0.92087626],"study_design_scores_gemma":[0.00019589899,0.000064602675,0.00018868616,0.00082501944,0.000016326556,0.000014313956,2.2555567e-7,0.46377152,0.02142261,0.5013146,0.010882069,0.0013041331],"about_ca_topic_score_codex":0.000096765165,"about_ca_topic_score_gemma":0.00014286797,"teacher_disagreement_score":0.9195722,"about_ca_system_score_codex":0.0001984416,"about_ca_system_score_gemma":0.00006908479,"threshold_uncertainty_score":0.9998369},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003337751,0.00039187138,0.996789,0.00045510594,0.00072454417,0.00065359846,0.0000034680736,0.00027229625,0.0006767567],"genre_scores_gemma":[0.3149752,0.000060599756,0.68122315,0.0033365556,0.00020499913,0.000015398267,0.0000043034083,0.000036045458,0.00014374488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958285,0.00007814498,0.00060395437,0.0017572735,0.001059111,0.0006730004],"domain_scores_gemma":[0.9974524,0.00055381923,0.0003100776,0.0012837755,0.00024153986,0.00015840655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082609063,0.0006320003,0.00064855465,0.0012805923,0.00021249814,0.00027267096,0.0017076116,0.0003684805,0.000011470573],"category_scores_gemma":[0.00027507416,0.0005755488,0.00017745858,0.0009338123,0.00045381513,0.0005595538,0.00045763422,0.0011481906,0.000027967706],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022371565,0.000085235384,0.000016527389,0.000032063952,0.0000021910248,0.00019895934,0.00006886804,0.022501923,0.00059852604,0.00043591595,0.0000023683986,0.97603506],"study_design_scores_gemma":[0.0006031062,0.0007723894,0.00060023257,0.001629071,0.0000049974747,0.00004741178,4.535367e-8,0.9395247,0.026765326,0.028738331,0.00050630915,0.00080805976],"about_ca_topic_score_codex":0.000065715176,"about_ca_topic_score_gemma":0.00033241618,"teacher_disagreement_score":0.975227,"about_ca_system_score_codex":0.00054025906,"about_ca_system_score_gemma":0.00062109565,"threshold_uncertainty_score":0.9996696},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006289705,0.00013916587,0.99426395,0.0010067497,0.0008177153,0.00069407985,0.00007603674,0.0001435896,0.0022297706],"genre_scores_gemma":[0.54052985,0.00004514287,0.453188,0.005006876,0.0005665161,0.00007971708,0.00003225418,0.000067722896,0.00048389097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963112,0.000036806014,0.00047206995,0.0016574642,0.0006774576,0.0008450034],"domain_scores_gemma":[0.997504,0.00026740364,0.00021966331,0.001402508,0.00029459377,0.00031185104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006720942,0.0005279253,0.00045358506,0.0010641097,0.0005940625,0.00067379297,0.0016075613,0.00016305529,0.00007052975],"category_scores_gemma":[0.00003212086,0.00046056733,0.00012161004,0.0013382409,0.00031959754,0.0006424395,0.0008174919,0.00060530606,0.000051504216],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067703026,0.00028594685,0.0006377433,0.000053018917,0.00012613452,0.005050927,0.010721199,0.029662304,0.00004434593,0.19227013,0.00079389906,0.7602866],"study_design_scores_gemma":[0.0030489215,0.0028044223,0.0008306351,0.00086277863,0.00012699768,0.009219155,0.00003545958,0.43686143,0.00035062828,0.1898808,0.35083425,0.0051445165],"about_ca_topic_score_codex":0.00018378606,"about_ca_topic_score_gemma":0.007145372,"teacher_disagreement_score":0.75514215,"about_ca_system_score_codex":0.00034438065,"about_ca_system_score_gemma":0.0003684154,"threshold_uncertainty_score":0.9997846},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008088204,0.00044274097,0.989215,0.0000543719,0.0004116452,0.00023786927,0.00000470103,0.000015742331,0.0015296827],"genre_scores_gemma":[0.9723693,0.00004835552,0.024668355,0.0002674359,0.0012787298,0.000007500938,0.0000862604,0.00006008473,0.0012139418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977811,0.000034049364,0.00040687466,0.00096189964,0.00036151177,0.000454583],"domain_scores_gemma":[0.9986709,0.00016089309,0.00024782043,0.00063112547,0.00020166424,0.000087603126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045136677,0.00036477932,0.00042686865,0.00014367014,0.00011996801,0.000050097526,0.0005775734,0.00050342915,0.000015139712],"category_scores_gemma":[0.000088705354,0.0003443601,0.00026426621,0.0001445877,0.0005152355,0.000004885196,0.00021952114,0.00031452428,0.0000038879984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006965078,0.00003670067,0.00072741136,0.000025807407,0.000056642548,0.000005672153,0.000013429146,0.9327858,0.0029939609,0.0005818367,0.00023257217,0.0624705],"study_design_scores_gemma":[0.0017697657,0.0027925253,0.0021561487,0.001100677,0.00030061798,0.00007731135,5.9579696e-7,0.8885342,0.03967415,0.021858638,0.038864236,0.002871128],"about_ca_topic_score_codex":0.0000047365984,"about_ca_topic_score_gemma":0.00003761927,"teacher_disagreement_score":0.9645467,"about_ca_system_score_codex":0.000051016694,"about_ca_system_score_gemma":0.00013881507,"threshold_uncertainty_score":0.9999008},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017317785,0.00032810433,0.99610907,0.0001427498,0.0016264892,0.0004951113,0.00001875467,0.00041931676,0.00068725256],"genre_scores_gemma":[0.028420176,0.0000062580602,0.9695369,0.0007264038,0.001063918,0.000023642868,0.000012651521,0.000055061464,0.00015499954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586046,0.000036635825,0.0005538393,0.0018780907,0.0007669796,0.0009039936],"domain_scores_gemma":[0.9969961,0.00068127346,0.00031496704,0.0015840366,0.00023763407,0.0001859684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012216045,0.00060510816,0.00055197807,0.00072647416,0.0004650645,0.0010150844,0.004198308,0.00036162764,0.0000119998895],"category_scores_gemma":[0.000047437232,0.000562577,0.00019644557,0.00043247864,0.00048081006,0.0009974935,0.00076582417,0.0005830559,0.00001431114],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002828248,0.000025462083,0.000002977293,0.000018093862,0.0000056848107,0.000036381094,0.0002224394,0.031496875,0.00021209943,0.0045721573,0.000026256379,0.9633787],"study_design_scores_gemma":[0.00024894223,0.00032244294,0.000021125607,0.00016107086,0.00000712213,0.00008209688,2.774594e-7,0.90641993,0.0039002954,0.08738737,0.000779118,0.00067022967],"about_ca_topic_score_codex":0.00003171467,"about_ca_topic_score_gemma":0.000022452932,"teacher_disagreement_score":0.96270853,"about_ca_system_score_codex":0.00021737439,"about_ca_system_score_gemma":0.00033509516,"threshold_uncertainty_score":0.99968255},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021386892,0.00038453419,0.99460816,0.0002292767,0.0004656788,0.00036314936,0.0000056129447,0.00010401309,0.001700866],"genre_scores_gemma":[0.63476676,0.00006320635,0.36476588,0.00021469429,0.00008148852,0.0000063717553,0.0000013806123,0.000026248683,0.00007398993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633795,0.00007880528,0.00050328014,0.0013857249,0.001039925,0.00065430027],"domain_scores_gemma":[0.99705845,0.00070507533,0.00032724912,0.0014071707,0.00028749785,0.00021455863],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014163253,0.0004491106,0.00070470513,0.0010224055,0.0002523405,0.00022582586,0.003027539,0.00021512009,0.0000071653],"category_scores_gemma":[0.00013598852,0.00040814865,0.00010924885,0.0006260164,0.003972793,0.00040155085,0.002185204,0.0007501186,0.000006556627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012879339,0.00001561569,0.0008696947,0.000087798304,0.0000114124905,0.000020709776,0.0004330286,0.002393807,0.0005104698,0.62441045,0.0000016814779,0.37123242],"study_design_scores_gemma":[0.00025494085,0.00021971026,0.0008625105,0.00031789608,0.0000043387267,0.000045411954,1.8579225e-7,0.1321373,0.0023700676,0.86317134,0.00018583129,0.00043044265],"about_ca_topic_score_codex":0.000017522416,"about_ca_topic_score_gemma":0.000067181194,"teacher_disagreement_score":0.632628,"about_ca_system_score_codex":0.000090180445,"about_ca_system_score_gemma":0.00021300698,"threshold_uncertainty_score":0.99983704},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001612485,0.001917174,0.99132204,0.0012979305,0.0019875215,0.0005203422,0.000005217542,0.00019301962,0.0011442899],"genre_scores_gemma":[0.5069422,0.00080157747,0.48422843,0.0033245354,0.0034023721,0.000039214996,0.000012625452,0.000053785214,0.0011952505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969339,0.000028080063,0.0005118771,0.001279784,0.00074456923,0.0005018049],"domain_scores_gemma":[0.9982799,0.00018742695,0.00023422523,0.0009605074,0.00020670131,0.00013122472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007318981,0.00040618272,0.0004490124,0.0003320063,0.00024985857,0.00042040035,0.001494798,0.00023517835,0.000034462155],"category_scores_gemma":[0.000025156396,0.00034709123,0.000072252944,0.00031319459,0.0005709613,0.0009390837,0.00070687314,0.00042188147,0.00004174408],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024581948,0.0000093898,0.00063198275,0.000054700886,0.0000052626974,0.00001160505,0.0015497096,0.004333619,0.000032832762,0.0035432214,0.00009194677,0.9897333],"study_design_scores_gemma":[0.0025687204,0.0010322252,0.009076758,0.0018679171,0.000035210323,0.00044097428,0.00000512108,0.71451974,0.008024314,0.11445096,0.14394574,0.0040322957],"about_ca_topic_score_codex":0.000055709937,"about_ca_topic_score_gemma":0.00013339544,"teacher_disagreement_score":0.98570096,"about_ca_system_score_codex":0.00020247011,"about_ca_system_score_gemma":0.00027843512,"threshold_uncertainty_score":0.99989814},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028393595,0.00027640996,0.99346006,0.0004372655,0.0009718805,0.00029192076,0.000009904995,0.00014137667,0.004127269],"genre_scores_gemma":[0.1483169,0.000100640755,0.8446559,0.006360494,0.00037632915,0.00000835526,0.0000071601658,0.000031816573,0.0001424031],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630755,0.000019415389,0.0005273886,0.0013324881,0.0010451797,0.00076795457],"domain_scores_gemma":[0.9978043,0.0003247707,0.00020545255,0.0012420489,0.00022799819,0.00019545159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011413776,0.00044279915,0.00038021203,0.0012570181,0.00044193238,0.0006258008,0.0027758298,0.00024033182,0.00010139132],"category_scores_gemma":[0.000031068077,0.0004156738,0.00017720902,0.0010469732,0.001013099,0.0006257828,0.0011290156,0.0006279716,0.000041865107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035495505,0.000027506672,0.00010995126,0.000023603274,0.000009406299,0.00006238241,0.0019542773,0.00014281935,0.00006061261,0.12907036,0.000039243052,0.8684963],"study_design_scores_gemma":[0.0006370798,0.00040056885,0.001552903,0.00034439715,0.000015858206,0.00017333738,9.0571734e-7,0.14658608,0.001810825,0.8279456,0.019095067,0.0014373657],"about_ca_topic_score_codex":0.00008175309,"about_ca_topic_score_gemma":0.00054637174,"teacher_disagreement_score":0.86705893,"about_ca_system_score_codex":0.00021020649,"about_ca_system_score_gemma":0.00023448112,"threshold_uncertainty_score":0.99982953},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43201932,0.0000084637995,0.5674877,0.00005789362,0.00022366783,0.00017231317,5.092208e-7,0.000026663256,0.0000034442328],"genre_scores_gemma":[0.6254958,0.000001104025,0.37434122,0.00003833062,0.00011247118,0.0000051608386,0.0000010250702,0.0000048328297,6.146224e-8],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991438,0.0000276322,0.00014848508,0.00029928196,0.00021931363,0.00016152597],"domain_scores_gemma":[0.99955064,0.000024844663,0.000103504215,0.00014815688,0.0001388965,0.000033955454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004198598,0.000103866405,0.0000941658,0.00013491706,0.00016654277,0.00010445722,0.00009419945,0.000029205155,0.000010671194],"category_scores_gemma":[0.0000090671965,0.000097110285,0.000015441048,0.00033589947,0.0001781778,0.0004619943,0.000020618925,0.00018435379,2.0754271e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004692931,0.000017925222,0.056067184,0.0000022750712,0.0000019965744,8.7777345e-8,0.000333209,0.009887224,0.26857772,0.00016656597,4.2688228e-8,0.6649411],"study_design_scores_gemma":[0.0003308566,0.000059233556,0.02534891,0.0000326278,0.0000024075962,0.000012052319,0.0000017292996,0.75869167,0.1877985,0.027553514,0.000009270816,0.0001591999],"about_ca_topic_score_codex":0.0000770377,"about_ca_topic_score_gemma":0.000023462595,"teacher_disagreement_score":0.74880445,"about_ca_system_score_codex":0.00007206481,"about_ca_system_score_gemma":0.00005235208,"threshold_uncertainty_score":0.39600426},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028890558,0.0015100013,0.9928524,0.00083855604,0.00091947446,0.0004827668,0.0000054714315,0.00018641625,0.00291603],"genre_scores_gemma":[0.25685385,0.00032297228,0.7363779,0.004952108,0.0009764458,0.000026379246,0.000026406899,0.000083308914,0.00038063416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963186,0.00003426338,0.00047319615,0.0015651587,0.0010251175,0.0005837111],"domain_scores_gemma":[0.9974027,0.0003905796,0.00027428172,0.0015760356,0.00021860571,0.00013776604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006305216,0.0004907715,0.00043039434,0.0011271308,0.0003651202,0.00044221373,0.0024665992,0.00026242,0.00001129415],"category_scores_gemma":[0.00003301335,0.00042973054,0.00019185827,0.0010253772,0.00063798646,0.0005235577,0.00066998956,0.0006167878,0.000027888189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029759289,0.00028301362,0.0004936849,0.0003696296,0.00003411042,0.00015862017,0.00033651208,0.27362007,0.0010654145,0.06598781,0.00043437025,0.657187],"study_design_scores_gemma":[0.0008045524,0.00026792506,0.0011061742,0.00313529,0.000027703201,0.00010264535,9.051784e-8,0.89115745,0.00838672,0.0902541,0.0033605562,0.0013967992],"about_ca_topic_score_codex":0.00012996806,"about_ca_topic_score_gemma":0.000054284632,"teacher_disagreement_score":0.6557902,"about_ca_system_score_codex":0.00017837255,"about_ca_system_score_gemma":0.00029556497,"threshold_uncertainty_score":0.99981546},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025977899,0.0035598294,0.9872625,0.00022560963,0.0006964871,0.00032317353,0.000002060139,0.0004717363,0.007432645],"genre_scores_gemma":[0.38706148,0.000016334896,0.6125953,0.00010789433,0.00012320181,0.0000032560174,0.0000011415568,0.000022065064,0.000069312584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730515,0.000031888365,0.0005369375,0.0010363287,0.00067114533,0.00041855336],"domain_scores_gemma":[0.9979687,0.00024351958,0.00039835053,0.001030531,0.00027471397,0.00008419099],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006639428,0.00039730032,0.0005021195,0.0008393386,0.000109164146,0.0002747037,0.0029437102,0.0003198049,0.0000071601253],"category_scores_gemma":[0.000046053854,0.00035456728,0.00010893234,0.00074030046,0.0003313801,0.0006939089,0.0006049025,0.0006580601,0.000009801551],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076231927,0.00001554591,0.000010598011,0.00025353587,0.000010886536,0.00006683846,0.000922264,0.0027886715,0.0015844733,0.15827739,0.000006095035,0.83605605],"study_design_scores_gemma":[0.00036992933,0.0002809481,0.000014380784,0.0055721193,0.000021935753,0.0003766371,6.9809835e-7,0.5427233,0.06931907,0.3788195,0.0013149476,0.0011865234],"about_ca_topic_score_codex":0.00002899304,"about_ca_topic_score_gemma":0.00004037334,"teacher_disagreement_score":0.83486956,"about_ca_system_score_codex":0.00033143154,"about_ca_system_score_gemma":0.00032891255,"threshold_uncertainty_score":0.9998906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002605032,0.0033497775,0.9920917,0.0010983101,0.00038992264,0.00018886421,0.000004596539,0.00007692006,0.00019483911],"genre_scores_gemma":[0.8188566,0.00023384903,0.18026175,0.00042877023,0.00015408121,0.0000021102935,0.000001788606,0.00001791878,0.000043137363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983046,0.000042102227,0.00022451421,0.0008087228,0.00038302867,0.00023703625],"domain_scores_gemma":[0.99762815,0.0013107511,0.00017153191,0.00046586525,0.00036623207,0.000057451874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000339047,0.0002494742,0.0003238685,0.00017502205,0.00033752655,0.00025391704,0.0012514258,0.00015905996,0.0000062909994],"category_scores_gemma":[0.0007061036,0.0001789149,0.000031161246,0.00041363193,0.0006060169,0.00029397107,0.0011635954,0.00049316045,0.0000021906121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008332183,0.000033996796,0.0027229916,0.00006318608,0.00005931716,0.000055753964,0.029204125,0.053041965,0.00045858833,0.5933943,0.000004803596,0.32095262],"study_design_scores_gemma":[0.0003274914,0.00014175719,0.0073129744,0.00048045337,0.000024535713,0.000056939243,0.00001337244,0.112558566,0.0018848791,0.87667495,0.000056286102,0.00046781948],"about_ca_topic_score_codex":0.00023917686,"about_ca_topic_score_gemma":0.00008806803,"teacher_disagreement_score":0.8162516,"about_ca_system_score_codex":0.000095909425,"about_ca_system_score_gemma":0.00039912312,"threshold_uncertainty_score":0.72959375},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020318426,0.000104935134,0.99616086,0.0016745443,0.0006307822,0.0012682081,0.000053631476,0.00003466196,0.00005205085],"genre_scores_gemma":[0.033821948,0.000032421267,0.9645278,0.0012908718,0.00012460456,0.00012264388,0.00003934597,0.000016410515,0.000023978018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771386,0.000029182567,0.000471106,0.0007967799,0.0006670167,0.00032203225],"domain_scores_gemma":[0.9970658,0.0010288444,0.0003755967,0.0012306644,0.00024228291,0.00005680685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095919386,0.000258526,0.00024335216,0.00026288725,0.00026535094,0.00022108371,0.0021583482,0.00010689267,0.000025550675],"category_scores_gemma":[0.000030381087,0.00020129884,0.00009172418,0.00039594067,0.0002502851,0.0002934476,0.00056500954,0.00025237782,0.0000051390375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033575732,0.000025135701,0.00007054373,0.00003130605,0.000021561304,0.0000013607315,0.000317254,0.01061323,0.000027830381,0.66377145,0.000091571885,0.3250254],"study_design_scores_gemma":[0.0004844567,0.00020802087,0.0010586225,0.00025681528,0.000032267046,0.000011272798,0.0000028932536,0.3679249,0.002279995,0.6177145,0.0095068505,0.00051936496],"about_ca_topic_score_codex":0.000031514912,"about_ca_topic_score_gemma":0.000019120185,"teacher_disagreement_score":0.35731167,"about_ca_system_score_codex":0.00013000634,"about_ca_system_score_gemma":0.00020192636,"threshold_uncertainty_score":0.82087284},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031095385,0.0006410979,0.9893056,0.0008666017,0.0034748043,0.0005510841,0.000004468082,0.0003043784,0.0017423916],"genre_scores_gemma":[0.7043566,0.000026814467,0.29419136,0.0005886953,0.00055461173,0.000024925246,0.000004296205,0.000044225548,0.00020846103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99282503,0.00016192251,0.0011873901,0.002699063,0.0017338534,0.0013927376],"domain_scores_gemma":[0.99608827,0.000976607,0.0005587263,0.0017997405,0.00021923368,0.00035740243],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013747202,0.00095187925,0.0010933613,0.0012404406,0.00029416604,0.0016941269,0.004177369,0.000601585,0.00004804972],"category_scores_gemma":[0.0001455524,0.0008976194,0.00027263726,0.001193208,0.00064964406,0.0012354652,0.0017431796,0.001519766,0.00013063257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002537339,0.0002831932,0.00036236487,0.00013108959,0.00008079239,0.002900755,0.01853841,0.81737334,0.0000464434,0.0214883,0.00016794442,0.13860199],"study_design_scores_gemma":[0.0005332891,0.00029659685,0.000099771874,0.00080381037,0.0000096122085,0.00055367715,0.0000021636413,0.9847818,0.00023602208,0.009890539,0.001550247,0.0012424506],"about_ca_topic_score_codex":0.000059160386,"about_ca_topic_score_gemma":0.000029533105,"teacher_disagreement_score":0.7012471,"about_ca_system_score_codex":0.00044522245,"about_ca_system_score_gemma":0.0005075165,"threshold_uncertainty_score":0.99934745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004747161,0.0014575341,0.9949104,0.00094484503,0.00025146897,0.00020363338,0.000012701638,0.00008784327,0.0020840869],"genre_scores_gemma":[0.02419083,0.00019141463,0.9730683,0.0016546841,0.00029060335,0.000010724616,0.00000889526,0.000017539915,0.00056701514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978718,0.00002636583,0.0002669482,0.0011524794,0.00034796196,0.00033445354],"domain_scores_gemma":[0.9985916,0.0003472752,0.00012444203,0.0007146066,0.00009588911,0.00012618251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004840876,0.00031749357,0.00028260765,0.0003185609,0.0003428837,0.0005876844,0.0011099733,0.0001479067,0.000004454927],"category_scores_gemma":[0.000037097816,0.00028759253,0.000032288022,0.00025273548,0.00058463385,0.00073283486,0.001257149,0.0004192627,0.000006268767],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016280368,0.000008743613,0.000007987543,0.000009797412,0.000003996412,0.00001636654,0.00076734775,0.00078438746,0.000017239876,0.050059043,0.000024036257,0.9482994],"study_design_scores_gemma":[0.0001336116,0.000109397806,0.0005649727,0.00021565979,0.0000055123505,0.00016309826,3.5130648e-7,0.6655185,0.000044730456,0.3303015,0.002560403,0.0003822342],"about_ca_topic_score_codex":0.000008300389,"about_ca_topic_score_gemma":0.00001025795,"teacher_disagreement_score":0.94791716,"about_ca_system_score_codex":0.00008213897,"about_ca_system_score_gemma":0.00013651619,"threshold_uncertainty_score":0.9999576},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05212377,0.0000049885707,0.94537896,0.00063243235,0.00088885415,0.0007819118,0.0000012564052,0.00018126662,0.0000065449312],"genre_scores_gemma":[0.33083615,9.322443e-7,0.66827506,0.0007308961,0.000111081245,0.00003361953,0.0000032895862,0.0000085549,4.2564463e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735814,0.0000866487,0.00037384377,0.00078005565,0.000980572,0.00042072704],"domain_scores_gemma":[0.9980365,0.00080096116,0.00019933694,0.00041140645,0.0003461896,0.0002056288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001329545,0.00020966459,0.00022547452,0.00038805912,0.00021524861,0.0004852036,0.0012416807,0.00010224916,0.000028204402],"category_scores_gemma":[0.00053059845,0.00016395215,0.000046962832,0.0011332672,0.00052301044,0.0018618028,0.0003001929,0.00044136113,0.000004008243],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037760896,0.00008212625,0.00028383918,0.000020729622,0.0000063293187,0.000014049557,0.0023143548,0.0042492053,0.060917187,0.000060500486,0.0000071524787,0.9320068],"study_design_scores_gemma":[0.0010176284,0.00012840363,0.00028260838,0.00006192166,0.0000034285633,0.00006177961,0.0000027237943,0.74750257,0.2489193,0.0018495116,0.0000026904074,0.00016743843],"about_ca_topic_score_codex":0.00003362686,"about_ca_topic_score_gemma":0.000067996196,"teacher_disagreement_score":0.93183935,"about_ca_system_score_codex":0.00012562265,"about_ca_system_score_gemma":0.00047610575,"threshold_uncertainty_score":0.6685775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013079109,0.00024773442,0.99337703,0.0017670378,0.0022391502,0.00013935198,0.000015646821,0.00004944987,0.00085670897],"genre_scores_gemma":[0.8411657,0.00008626786,0.15695018,0.0008097581,0.00043025025,0.000006152026,0.000006606181,0.000024790706,0.0005202983],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976073,0.000059029677,0.00046966647,0.0008575706,0.00067985477,0.00032660752],"domain_scores_gemma":[0.9967055,0.00056062953,0.00042161136,0.0020700118,0.00017325704,0.00006902734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059729407,0.00028550532,0.00033107493,0.0002214616,0.00047743515,0.0003939017,0.0048015444,0.00018281853,0.000019481848],"category_scores_gemma":[0.00013639267,0.00015858572,0.00020645354,0.00064371707,0.0010597485,0.00036750632,0.0017774001,0.0006634954,0.000014095929],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035410662,0.000015785767,0.00028055356,0.000009306669,0.000038419632,0.000007898614,0.0008712226,0.009355357,0.00024245495,0.016856857,0.000028370872,0.9722902],"study_design_scores_gemma":[0.00042998654,0.00010565281,0.0018254031,0.0022834619,0.00005813211,0.00007494147,0.0000030527897,0.29902261,0.005649858,0.68834597,0.0014577381,0.0007431972],"about_ca_topic_score_codex":0.00019845074,"about_ca_topic_score_gemma":0.00045986587,"teacher_disagreement_score":0.971547,"about_ca_system_score_codex":0.00017378987,"about_ca_system_score_gemma":0.0006085121,"threshold_uncertainty_score":0.8922544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032555177,0.00070681825,0.98770624,0.0008754377,0.0031199262,0.00040486507,0.000005486344,0.00028156434,0.0068671117],"genre_scores_gemma":[0.015387858,0.00008905867,0.98015094,0.0016373862,0.0010863213,0.000017092834,0.0000043773152,0.000042979886,0.0015839889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952218,0.00006453575,0.0006803529,0.0018960494,0.0012489574,0.00088833884],"domain_scores_gemma":[0.9961217,0.00027756137,0.00057512027,0.0024267258,0.0003491765,0.00024971392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001667206,0.00062967127,0.00065172365,0.0011769087,0.000321386,0.0007735126,0.0052886275,0.00044629374,0.00006209697],"category_scores_gemma":[0.00020726328,0.0006014593,0.00017562193,0.0010891501,0.00064708845,0.0013524271,0.0014946774,0.0009951968,0.00021362578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006074768,0.00003836935,0.000032484302,0.000042344138,0.000012479028,0.000053988486,0.0004938351,0.072501145,0.000074153686,0.05174486,0.000089804285,0.8749105],"study_design_scores_gemma":[0.00021252845,0.000149186,0.00014714699,0.00038975602,0.00000997876,0.00008072178,1.6141134e-7,0.8801417,0.002685278,0.10009286,0.015181577,0.0009091381],"about_ca_topic_score_codex":0.000015081578,"about_ca_topic_score_gemma":0.000031898457,"teacher_disagreement_score":0.8740013,"about_ca_system_score_codex":0.0004989719,"about_ca_system_score_gemma":0.0004181102,"threshold_uncertainty_score":0.9996437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008568888,0.00017177791,0.99374133,0.0005307707,0.0019930645,0.0005550561,0.000011766542,0.00012965096,0.0028580057],"genre_scores_gemma":[0.0036321597,0.000016674903,0.9937296,0.0016746314,0.000488049,0.000028519275,0.000027330725,0.000026175196,0.0003768723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691397,0.000027943786,0.0005222395,0.0013709385,0.00059880974,0.0005661106],"domain_scores_gemma":[0.9977285,0.00048551444,0.00032528845,0.0010775243,0.00026102262,0.00012212174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090987753,0.00041064856,0.0004499594,0.0003569818,0.00037421397,0.00031617627,0.0013119383,0.00021709825,0.000018943945],"category_scores_gemma":[0.00022165145,0.00035521237,0.000116334355,0.00033356893,0.00039568584,0.0009635578,0.00060827006,0.000389432,0.00003057209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030534954,0.000010367449,0.000007976259,0.000041064417,0.000004523206,0.000013652775,0.00013517411,0.0050326665,0.00008881094,0.56981623,0.00004221129,0.42480424],"study_design_scores_gemma":[0.00055440364,0.0003505305,0.00002443622,0.00054524146,0.000009707065,0.00013906475,5.4624e-7,0.36547026,0.0015438572,0.43468997,0.1953665,0.0013054807],"about_ca_topic_score_codex":0.000006604551,"about_ca_topic_score_gemma":0.000033338154,"teacher_disagreement_score":0.42349878,"about_ca_system_score_codex":0.000218686,"about_ca_system_score_gemma":0.0002710207,"threshold_uncertainty_score":0.99988997},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006232034,0.0013434336,0.9860396,0.0012956879,0.0010018697,0.00055181637,0.000009041468,0.00033370257,0.00319281],"genre_scores_gemma":[0.6485433,0.00013660769,0.33993316,0.010078031,0.001007245,0.000034888148,0.000044351214,0.00007882267,0.00014360006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557596,0.00005787393,0.00060559675,0.0019453708,0.0010290284,0.0007861631],"domain_scores_gemma":[0.9976388,0.0002778837,0.0003960919,0.0011014378,0.00036757873,0.00021821138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043150978,0.0007664812,0.00062857266,0.00097019575,0.0004658324,0.0008684416,0.0030087905,0.00038682378,0.000011057165],"category_scores_gemma":[0.000006345649,0.0006636569,0.00009477793,0.0011016417,0.00033912674,0.0009235012,0.0016690296,0.0007721568,0.00002978982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007232202,0.00023475212,0.0014628136,0.0016820333,0.00011552875,0.00023891384,0.0068333587,0.15361145,0.011499948,0.022919528,0.00018193397,0.8011474],"study_design_scores_gemma":[0.00088929106,0.00028433293,0.0015650296,0.0014441018,0.000054389504,0.00039266646,0.000001328193,0.8801177,0.0049394174,0.10461402,0.003690406,0.002007326],"about_ca_topic_score_codex":0.00025424725,"about_ca_topic_score_gemma":0.0020928648,"teacher_disagreement_score":0.7991401,"about_ca_system_score_codex":0.00013789526,"about_ca_system_score_gemma":0.0005321432,"threshold_uncertainty_score":0.99958146},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011781066,0.00038195154,0.9918914,0.00036976524,0.0016209339,0.0009722089,0.000012192001,0.0002451426,0.004494635],"genre_scores_gemma":[0.08064268,0.00008459675,0.91486174,0.001175962,0.0009987426,0.00008714072,0.000014443666,0.000043264037,0.0020914264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963315,0.000050713883,0.00048815663,0.0015836845,0.00073462416,0.00081129896],"domain_scores_gemma":[0.9969954,0.0008747588,0.00033403767,0.0011947504,0.00040510675,0.00019592751],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011379978,0.0005392385,0.0004789656,0.0005982942,0.00048366646,0.0006283129,0.0029240677,0.0004125985,0.0000451843],"category_scores_gemma":[0.00018482447,0.0004859288,0.00017613091,0.00042998145,0.00036186454,0.0008233349,0.0007927741,0.00050061475,0.00006184244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006709399,0.000038774742,0.0000041280355,0.000030645242,0.000010969023,0.000009731543,0.00071478554,0.008629948,0.00011769719,0.6169048,0.000115019735,0.3734168],"study_design_scores_gemma":[0.00027980097,0.00019057936,0.000023092249,0.0002076683,0.000010181381,0.000025977055,7.559062e-8,0.43432292,0.002383452,0.559726,0.0023423461,0.0004878839],"about_ca_topic_score_codex":0.000009807087,"about_ca_topic_score_gemma":0.00007057813,"teacher_disagreement_score":0.42569298,"about_ca_system_score_codex":0.00038552715,"about_ca_system_score_gemma":0.0007672294,"threshold_uncertainty_score":0.99975926},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032588152,0.00013882935,0.99578446,0.00025415796,0.0020617258,0.0008275426,0.000033705113,0.00023903136,0.0006279745],"genre_scores_gemma":[0.0038971512,0.000013504859,0.99381316,0.0008193942,0.00051754713,0.000027618682,0.00006914292,0.00004630029,0.0007961901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955731,0.000034536544,0.0006104681,0.0019769818,0.0009291324,0.00087575795],"domain_scores_gemma":[0.99693894,0.00057620055,0.0003598579,0.0016649336,0.00025748493,0.00020258775],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008537775,0.00058030366,0.00053204875,0.00084021053,0.0006439285,0.00351431,0.003471176,0.00027670426,0.000032571417],"category_scores_gemma":[0.00010205079,0.0005478672,0.00015708727,0.00063265953,0.0005445959,0.0014800618,0.00071217306,0.00041388703,0.000027533437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022127167,0.00007163276,0.0000023973832,0.000020155698,0.000009114492,0.000024084919,0.00038275897,0.05947757,0.000028842976,0.001995004,0.000069751186,0.93791646],"study_design_scores_gemma":[0.0004488956,0.00021046471,0.000023293778,0.00017992638,0.000015055584,0.00001524222,2.0491116e-7,0.9791775,0.00075579126,0.015333166,0.0031619493,0.0006785271],"about_ca_topic_score_codex":0.0000127087915,"about_ca_topic_score_gemma":0.000008101059,"teacher_disagreement_score":0.9372379,"about_ca_system_score_codex":0.00021847566,"about_ca_system_score_gemma":0.00020448423,"threshold_uncertainty_score":0.99969727},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004553014,0.0009572499,0.9828461,0.0002851861,0.0027609228,0.00034241748,0.000020192538,0.00027615466,0.012466255],"genre_scores_gemma":[0.059639085,0.00016882132,0.93518746,0.0034055274,0.0012966923,0.0000078086205,0.000027567516,0.000056824298,0.00021023105],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949626,0.000033050113,0.0006382707,0.0019650704,0.0014344896,0.00096654205],"domain_scores_gemma":[0.99637556,0.0004544671,0.00030769277,0.0023067594,0.00025617096,0.00029934695],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015902577,0.0006231943,0.0006035611,0.001536295,0.00034824788,0.0009871668,0.005394429,0.00048190998,0.000091126996],"category_scores_gemma":[0.00008251807,0.00059069693,0.00024873967,0.0011185423,0.0009614276,0.0010007895,0.002175306,0.0009896569,0.00010670776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008043752,0.000054745648,0.000053449916,0.000038233233,0.000016247357,0.00033524222,0.0005491603,0.0011001587,0.00013505014,0.20627932,0.00015515638,0.7912752],"study_design_scores_gemma":[0.00061776454,0.00036944626,0.00036147557,0.0005031951,0.000024272562,0.00035078044,2.6417015e-7,0.09380897,0.004005126,0.86398685,0.0338296,0.0021422305],"about_ca_topic_score_codex":0.000043485656,"about_ca_topic_score_gemma":0.0002551109,"teacher_disagreement_score":0.78913295,"about_ca_system_score_codex":0.00017012647,"about_ca_system_score_gemma":0.00044590485,"threshold_uncertainty_score":0.9999869},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003417349,0.0004984626,0.99487126,0.00069788186,0.00093665766,0.0006669083,0.00016541591,0.00022772526,0.0019015303],"genre_scores_gemma":[0.0037758672,0.00007757278,0.9937743,0.0010849648,0.00059227436,0.00008374182,0.000109458444,0.00005092135,0.00045091473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957771,0.000015445497,0.0006056854,0.0020030283,0.0008034526,0.00079533184],"domain_scores_gemma":[0.9966231,0.00079395896,0.00029028536,0.0017829806,0.00027220984,0.0002374917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065916125,0.00054904073,0.0005422843,0.0010680928,0.00044063845,0.0009911016,0.004494594,0.00031614522,0.00004435672],"category_scores_gemma":[0.0001279286,0.00052505394,0.00015646948,0.0013544793,0.00036349733,0.0006426918,0.0008291065,0.00049950206,0.00007042751],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010262971,0.000026224969,0.000008124835,0.000018839679,0.000009131501,0.000018249015,0.00022349933,0.004908505,0.0000061403816,0.006644955,0.00019341012,0.9879419],"study_design_scores_gemma":[0.0003042905,0.000176265,0.0000742362,0.00034166643,0.000012826445,0.00007764261,1.8848495e-7,0.9037161,0.0002540932,0.06593687,0.028272653,0.00083320134],"about_ca_topic_score_codex":0.00002851885,"about_ca_topic_score_gemma":0.000013343354,"teacher_disagreement_score":0.9871087,"about_ca_system_score_codex":0.0002543298,"about_ca_system_score_gemma":0.00048496737,"threshold_uncertainty_score":0.9997201},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006724467,0.0008686184,0.9933595,0.00031339366,0.003746453,0.0008512055,0.0000049044,0.00030841833,0.0004802397],"genre_scores_gemma":[0.028877942,0.00014404244,0.9681163,0.0006900196,0.0017021017,0.00003872422,0.000012592286,0.000088344954,0.00032992443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935442,0.00007966078,0.0010044082,0.0025515575,0.0011542742,0.0016658766],"domain_scores_gemma":[0.99617434,0.0010353873,0.00045244125,0.001702431,0.00033960142,0.00029579515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012940589,0.0009528167,0.0011266234,0.001251589,0.00030069923,0.0006672024,0.0040207594,0.0008139238,0.0000044245185],"category_scores_gemma":[0.0000536224,0.0009565591,0.00027191482,0.0013331453,0.00052475295,0.0005263151,0.0009136445,0.0014163017,0.000007713934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005587802,0.000029020703,0.000024621395,0.000009487656,0.0000053931685,0.00009303801,0.0000978303,0.51096296,0.000014587225,0.0015287425,0.0000051803436,0.48722354],"study_design_scores_gemma":[0.00075973186,0.0001864228,0.000044548764,0.0007985598,0.000006842085,0.00004726157,2.1540644e-7,0.98215604,0.000722309,0.013314015,0.00096181734,0.0010022463],"about_ca_topic_score_codex":0.000029313644,"about_ca_topic_score_gemma":0.000036992464,"teacher_disagreement_score":0.48622128,"about_ca_system_score_codex":0.000685425,"about_ca_system_score_gemma":0.00038360912,"threshold_uncertainty_score":0.9992885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012952025,0.00014682612,0.9833366,0.0009364209,0.0011060738,0.007230907,0.000027179367,0.00029351027,0.00679296],"genre_scores_gemma":[0.03202858,0.00000995189,0.9405822,0.019279832,0.0029862109,0.003200865,0.00008947413,0.00020433024,0.0016185667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99436545,0.0000433424,0.0007882042,0.0023942885,0.0011749946,0.0012337329],"domain_scores_gemma":[0.99579144,0.0009279743,0.0005077527,0.0021590097,0.00042020282,0.00019361838],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010513915,0.0008581264,0.00077498256,0.00093266566,0.00049091614,0.0015335383,0.00595395,0.0004258563,0.000006855586],"category_scores_gemma":[0.000024156128,0.0007566728,0.00018347178,0.001119095,0.00026737628,0.0015520114,0.0022029502,0.0007788188,0.000028426453],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007612272,0.00019980894,0.00032912096,0.0013654557,0.00006872756,0.00017729966,0.003845589,0.12121745,0.0019960846,0.06613126,0.0001773263,0.80441576],"study_design_scores_gemma":[0.0020573086,0.0011102657,0.00076207344,0.003583841,0.000048643775,0.00016308502,0.0000017773046,0.51025635,0.008440519,0.422911,0.04716864,0.0034964946],"about_ca_topic_score_codex":0.00013893683,"about_ca_topic_score_gemma":0.0007226868,"teacher_disagreement_score":0.80091923,"about_ca_system_score_codex":0.00022060085,"about_ca_system_score_gemma":0.00068310887,"threshold_uncertainty_score":0.99950296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016673986,0.0040906626,0.9907557,0.00012295299,0.0006855594,0.00037751827,0.00011453717,0.000007781582,0.0021779283],"genre_scores_gemma":[0.24997811,0.001548567,0.74184614,0.0019358032,0.0029366428,0.000027760327,0.0004848212,0.00013258777,0.0011095585],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979693,0.000008900716,0.0002726722,0.0011462418,0.00021110129,0.00039173083],"domain_scores_gemma":[0.99847895,0.000056425288,0.00014033366,0.0011102348,0.00014747147,0.00006658753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027460468,0.00030601962,0.00027941068,0.00012918208,0.00020311889,0.00006014143,0.0011807394,0.00022586616,0.0000025789204],"category_scores_gemma":[0.00009019725,0.00029986422,0.00007537812,0.00008047803,0.000389451,0.0000025788904,0.0011945943,0.0001557226,0.0000022389138],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002220616,0.000031929227,0.000051869283,0.00008187362,0.00010133143,0.00004351198,0.0004963481,0.010383959,0.5715259,0.000084545674,0.00046738447,0.41670915],"study_design_scores_gemma":[0.0023672115,0.0024099934,0.00021131098,0.00092730793,0.00012213964,0.00092911033,0.000006816545,0.20173658,0.38033727,0.020937346,0.38504517,0.0049697305],"about_ca_topic_score_codex":0.000013827668,"about_ca_topic_score_gemma":0.000039897765,"teacher_disagreement_score":0.4117394,"about_ca_system_score_codex":0.00007344512,"about_ca_system_score_gemma":0.00032162855,"threshold_uncertainty_score":0.99994534},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017114406,0.0002581001,0.9778986,0.00011627813,0.00025541597,0.00016977973,0.0000019094052,0.000032663673,0.0041528367],"genre_scores_gemma":[0.95989025,0.000022020125,0.03938896,0.00014306293,0.00016178284,0.000001773065,0.000003393768,0.00001847837,0.00037029563],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880695,0.000017652634,0.00023222042,0.00040768558,0.00035665403,0.00017882926],"domain_scores_gemma":[0.998956,0.00038288467,0.00019200226,0.00033043302,0.00008937711,0.000049263137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028883165,0.00021467221,0.00029285022,0.0003126009,0.00010416177,0.000025333475,0.00021600709,0.00018039525,0.000033487344],"category_scores_gemma":[0.000039989474,0.00017057062,0.00003408081,0.00020354305,0.00066245574,0.00016998063,0.00012395081,0.0003436245,0.0000023143045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036064905,0.00022145956,0.003801615,0.0011053273,0.00014128693,0.00022725317,0.00750794,0.007214674,0.00026351382,0.13676041,0.00025117255,0.84214467],"study_design_scores_gemma":[0.00034012005,0.00045656043,0.0016389914,0.0004886338,0.000036756657,0.00023571825,6.856426e-7,0.0092537,0.00090546167,0.9861082,0.00016487083,0.00037029118],"about_ca_topic_score_codex":0.00000782046,"about_ca_topic_score_gemma":0.000015033025,"teacher_disagreement_score":0.94277585,"about_ca_system_score_codex":0.000035658504,"about_ca_system_score_gemma":0.00010337061,"threshold_uncertainty_score":0.6955668},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020687001,0.0007450969,0.9952147,0.0020558755,0.0005653576,0.00054672634,0.000004049835,0.00018116127,0.00048019012],"genre_scores_gemma":[0.12078488,0.000030442294,0.8774875,0.0009863192,0.00035670734,0.00004628784,0.000008229985,0.000022419825,0.0002772643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657625,0.000034451863,0.00060693297,0.0014545851,0.00071375095,0.0006140561],"domain_scores_gemma":[0.99804497,0.00023943816,0.0002479415,0.0010973407,0.00022235955,0.00014794554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048417816,0.00041330286,0.00039249245,0.0007211018,0.00022310771,0.00029665016,0.0025614465,0.0002609976,0.000018964147],"category_scores_gemma":[0.000039460392,0.0003922771,0.000102462895,0.0009983481,0.0006557196,0.0003945817,0.00047961753,0.00067620573,0.00004129456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001906196,0.00005022804,0.00015993584,0.000014545873,0.0000032856074,0.00007045011,0.00020938757,0.11403428,0.000048980568,0.007289357,0.000007877106,0.87810975],"study_design_scores_gemma":[0.0002633516,0.00010865636,0.00033328537,0.00028659686,0.0000035465753,0.000045513654,3.174525e-7,0.96520466,0.0002914861,0.027939651,0.005015588,0.0005073396],"about_ca_topic_score_codex":0.00009291685,"about_ca_topic_score_gemma":0.0005054132,"teacher_disagreement_score":0.8776024,"about_ca_system_score_codex":0.00035811547,"about_ca_system_score_gemma":0.00082262256,"threshold_uncertainty_score":0.9998529},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025658399,0.000049978178,0.9469637,0.0038070276,0.007997713,0.0024822913,0.00017016847,0.00030010316,0.0125706205],"genre_scores_gemma":[0.97734296,0.00010675689,0.018013138,0.0029054903,0.0005464036,0.000067174704,0.00001570327,0.000053803007,0.00094858324],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972632,0.000022939823,0.0004763279,0.0012160825,0.0005450108,0.00047644833],"domain_scores_gemma":[0.9961781,0.0025738524,0.0003544912,0.0006148237,0.00015610973,0.0001226047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014743593,0.00036969045,0.0003816846,0.00072321546,0.0003069099,0.0002728883,0.00068152323,0.0002213878,0.000115414645],"category_scores_gemma":[0.00092448766,0.00035728316,0.00020158084,0.00027463678,0.00047041674,0.00045906712,0.00014856605,0.00048019885,0.00008834969],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026838036,0.0003901877,0.00013226463,0.00046142886,0.000027178437,0.00028947956,0.002675957,0.023927443,0.27432135,0.027105788,0.0004989067,0.66990167],"study_design_scores_gemma":[0.00047955068,0.00035254032,0.00015390781,0.00077348447,0.000032059,0.00021003993,0.0000015393018,0.008766525,0.85787165,0.11958002,0.010664697,0.0011139931],"about_ca_topic_score_codex":0.000022878807,"about_ca_topic_score_gemma":0.00009511215,"teacher_disagreement_score":0.95168453,"about_ca_system_score_codex":0.0005020517,"about_ca_system_score_gemma":0.0010308089,"threshold_uncertainty_score":0.99988794},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.179341e-8,0.00008177361,0.93603253,0.0019145985,0.0004180887,0.05853892,0.000010791385,0.00015988135,0.0028433322],"genre_scores_gemma":[0.00009473202,0.000004599768,0.9850426,0.0017510209,0.00082179636,0.012079076,0.0000043948553,0.000024884572,0.0001769082],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963519,0.000022318782,0.00049116596,0.0015150933,0.00087833096,0.0007411775],"domain_scores_gemma":[0.9966677,0.0006698337,0.00029247126,0.0019619653,0.00019589534,0.00021215739],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009432608,0.0005255236,0.00040826382,0.00043361523,0.0005226971,0.0011643061,0.005563546,0.0002788986,0.000026931797],"category_scores_gemma":[0.0000557976,0.00036106832,0.0002366654,0.00079120125,0.00046470595,0.0007249402,0.0010561679,0.00075488066,0.000016235357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001439086,0.000020770087,0.0000030803635,0.000031745047,0.000006979556,0.000008831956,0.00048319463,0.00122074,0.000008635279,0.18929541,0.0007538571,0.8081524],"study_design_scores_gemma":[0.0005407251,0.0003274142,0.000030937546,0.00023538893,0.0000069912303,0.00003562648,8.4560384e-8,0.08761281,0.00023789557,0.6808641,0.2296151,0.00049293163],"about_ca_topic_score_codex":0.00003831948,"about_ca_topic_score_gemma":0.0001286799,"teacher_disagreement_score":0.80765945,"about_ca_system_score_codex":0.00009734103,"about_ca_system_score_gemma":0.00093264336,"threshold_uncertainty_score":0.9998841},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027596461,0.0004703207,0.9880939,0.0026726488,0.003122523,0.00049158174,0.0000071245854,0.00033719235,0.0047771265],"genre_scores_gemma":[0.023212602,0.00006937249,0.9721937,0.0028397115,0.0005371621,0.000014272706,0.0000035631845,0.000051534964,0.0010780811],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947734,0.000051705374,0.00054897915,0.0021656842,0.0015350664,0.0009251551],"domain_scores_gemma":[0.99590635,0.00022320221,0.0004692518,0.0027874848,0.00036408764,0.00024959672],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012078267,0.0007299869,0.00064172305,0.0010165183,0.0003389791,0.0014736754,0.0061236843,0.00055016193,0.00003415115],"category_scores_gemma":[0.00017893121,0.00068227714,0.00020828561,0.000966028,0.0008118451,0.0015132502,0.0016810454,0.0011674823,0.000119930744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004086778,0.00003003802,0.000012545608,0.000054885215,0.000012317586,0.00008149921,0.0011464009,0.004299084,0.00018224998,0.20040376,0.000044779255,0.79372835],"study_design_scores_gemma":[0.0004066879,0.00032197984,0.00013369208,0.00044565625,0.000013952675,0.00020094632,2.4326832e-7,0.25183004,0.011075247,0.7267624,0.0074616442,0.0013475085],"about_ca_topic_score_codex":0.000021026122,"about_ca_topic_score_gemma":0.000011603584,"teacher_disagreement_score":0.7923808,"about_ca_system_score_codex":0.000785465,"about_ca_system_score_gemma":0.0008951951,"threshold_uncertainty_score":0.9995629},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012056532,0.00006508866,0.9859087,0.00092168583,0.00034335817,0.0003501661,0.0000018487309,0.00022769463,0.012169408],"genre_scores_gemma":[0.023990896,0.000022822042,0.9733865,0.000962457,0.0002936962,0.000014700659,0.000023975217,0.000038719307,0.0012662315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969465,0.000039780236,0.0003336099,0.0012001636,0.0009975391,0.00048237614],"domain_scores_gemma":[0.99807006,0.00010998243,0.00018305414,0.0011407292,0.00032492084,0.00017122824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005539524,0.00035824638,0.0002997325,0.0006519383,0.00024808568,0.0008941619,0.0021141078,0.00018418531,0.000023579785],"category_scores_gemma":[0.000017692579,0.00029259117,0.000045333712,0.0006707532,0.00042147192,0.0021970936,0.00042815047,0.00046913495,0.0000395615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073029823,0.00004637443,0.000022897917,0.000013977303,0.000003784004,0.00005280319,0.00052144,0.32067072,0.000026900028,0.023813697,0.00006313537,0.65475696],"study_design_scores_gemma":[0.00026416645,0.0004582383,0.00003920779,0.00011230305,0.0000026341324,0.000024628376,1.6488163e-7,0.92406666,0.00034124733,0.07283961,0.0013988087,0.00045235065],"about_ca_topic_score_codex":0.000030212948,"about_ca_topic_score_gemma":0.00035966924,"teacher_disagreement_score":0.6543046,"about_ca_system_score_codex":0.00012952054,"about_ca_system_score_gemma":0.00048555763,"threshold_uncertainty_score":0.9999526},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.9465616e-8,0.48341113,0.51398194,0.00023293842,0.0006580141,0.0015974094,0.000019046884,0.00009340134,0.000006005775],"genre_scores_gemma":[0.000019989837,0.5352169,0.46327797,0.0005042423,0.0002648604,0.0006853531,0.000009486661,0.000019744608,0.0000014332568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956284,0.00014998473,0.00090943003,0.0018289983,0.0006887433,0.00079441676],"domain_scores_gemma":[0.9959523,0.0010477788,0.0005799739,0.0016987354,0.00049694744,0.0002242285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013828644,0.0006178555,0.0015683107,0.00056862977,0.0005721807,0.00045893778,0.004909445,0.00031028676,0.0000037117381],"category_scores_gemma":[0.00023283238,0.0005072892,0.00043445674,0.0036097,0.00028200302,0.00047265305,0.0010880879,0.0005954033,0.000037392165],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.8549425e-7,0.00003953492,6.228496e-8,0.0037865567,0.000011434755,0.000005453754,0.000022911296,0.00014677683,0.000008982881,0.08384181,0.000029501247,0.9121067],"study_design_scores_gemma":[0.00017337048,0.00020128097,8.6709457e-7,0.034159042,0.00014448256,0.0006544776,2.455508e-7,0.564541,0.000027594011,0.044686757,0.35427475,0.0011361481],"about_ca_topic_score_codex":0.000053813324,"about_ca_topic_score_gemma":0.000008181866,"teacher_disagreement_score":0.91097057,"about_ca_system_score_codex":0.00030417572,"about_ca_system_score_gemma":0.0012639079,"threshold_uncertainty_score":0.99973786},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013236885,0.00033075034,0.9968603,0.000091381735,0.00089744927,0.0010066687,0.000034238536,0.00006248396,0.00058432634],"genre_scores_gemma":[0.061582517,0.00010092856,0.937852,0.00018854236,0.00011390338,0.0000356756,0.000012015134,0.000022349168,0.000092048744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973851,0.00008301392,0.00047946724,0.001032401,0.00065504655,0.0003650085],"domain_scores_gemma":[0.99795955,0.00018086482,0.0003586137,0.0013101449,0.00011819188,0.00007264192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065913727,0.00034185988,0.0003648631,0.00034560388,0.0002649017,0.000077059085,0.0011732812,0.000087318534,0.000007353342],"category_scores_gemma":[0.00000842874,0.0002486471,0.000055798933,0.0004750511,0.0005666718,0.00061739,0.0013150411,0.00026487472,0.000004069959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016493665,0.000017981609,0.000040951814,0.00028191743,0.000039810096,0.000059039226,0.0017504349,0.012120119,0.0002347505,0.4261858,0.000021582591,0.5592311],"study_design_scores_gemma":[0.0057277936,0.0017448034,0.0032000358,0.013183932,0.0003281512,0.0017321304,0.00017530672,0.72139347,0.081928164,0.1332624,0.031172818,0.006151012],"about_ca_topic_score_codex":0.0000726331,"about_ca_topic_score_gemma":0.0000501796,"teacher_disagreement_score":0.70927334,"about_ca_system_score_codex":0.00019560634,"about_ca_system_score_gemma":0.00020983092,"threshold_uncertainty_score":0.9999966},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058656733,0.0013284973,0.98960567,0.00025097266,0.0010141816,0.0003377242,0.0000012176695,0.000113074886,0.0072900266],"genre_scores_gemma":[0.9049134,0.0000776077,0.09312753,0.0007746264,0.00033931682,0.000011745069,0.0000028532188,0.000023865952,0.000729024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967356,0.000040328887,0.0004975029,0.0014729976,0.0005524561,0.00070116785],"domain_scores_gemma":[0.99824595,0.00029896235,0.0002049949,0.0009706504,0.00011087698,0.00016857348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087832444,0.0004964354,0.0005731754,0.0006636645,0.00013019475,0.0006008467,0.002347406,0.0003586976,0.000016521088],"category_scores_gemma":[0.00003662478,0.00042013085,0.00007013074,0.00045884406,0.00070768053,0.0005237816,0.0012995206,0.000705677,0.00004179123],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047204467,0.00003408369,0.0003395897,0.000065589404,0.000008964018,0.00021061208,0.001642533,0.0032007329,0.000049417456,0.06336287,0.00002583346,0.93105507],"study_design_scores_gemma":[0.000995456,0.0005615511,0.0009846218,0.00055384263,0.000014856178,0.00042934096,0.0000046722653,0.7587363,0.0009459915,0.22567873,0.009140411,0.001954231],"about_ca_topic_score_codex":0.0002540423,"about_ca_topic_score_gemma":0.00082378497,"teacher_disagreement_score":0.9291008,"about_ca_system_score_codex":0.00021160099,"about_ca_system_score_gemma":0.0003165327,"threshold_uncertainty_score":0.99982506},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1257264,0.026208809,0.78375554,0.0179354,0.004188447,0.007250298,0.000046695695,0.00023321448,0.03465518],"genre_scores_gemma":[0.9974387,0.00024480154,0.0017780227,0.00012998833,0.0003355633,0.000019356828,0.0000024592998,0.000010365515,0.000040737257],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99812895,0.000071549715,0.0004167924,0.00046698388,0.00051628007,0.00039941893],"domain_scores_gemma":[0.99887073,0.0003278269,0.00030578615,0.00029203304,0.00012485754,0.00007873799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011612606,0.00019201264,0.0003666962,0.00062772445,0.00012418236,0.00022198287,0.0009115756,0.00024728524,0.000021566884],"category_scores_gemma":[0.000109277564,0.00017868941,0.000033724373,0.0006553128,0.001520987,0.0006304849,0.00013966222,0.000332155,0.0000028315962],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046691814,0.000050993545,0.12927246,0.000031155283,0.000004271366,0.0000032541159,0.007892498,0.0006560949,0.000020816724,0.02863404,0.0000023220337,0.8333854],"study_design_scores_gemma":[0.001266097,0.00006365967,0.93067986,0.0007942095,0.000019332296,0.0000020429075,0.000017068429,0.0037638268,0.00018488099,0.05938564,0.0031011207,0.00072226336],"about_ca_topic_score_codex":0.0007922547,"about_ca_topic_score_gemma":0.0029041145,"teacher_disagreement_score":0.8717123,"about_ca_system_score_codex":0.00019257564,"about_ca_system_score_gemma":0.00022952925,"threshold_uncertainty_score":0.7286743},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013036586,0.0006427214,0.98693144,0.0006385263,0.0009509866,0.00093748706,0.00004926768,0.00019660087,0.009522616],"genre_scores_gemma":[0.41202456,0.00009001733,0.57866174,0.0031826424,0.0013598856,0.00012728255,0.000071621245,0.00013162842,0.0043505966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955284,0.00002123689,0.000630996,0.001882061,0.0010963498,0.0008409785],"domain_scores_gemma":[0.99731344,0.0003074471,0.000356831,0.0013407416,0.00046335056,0.00021819156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006168752,0.0006428575,0.0007231434,0.00046899496,0.00053897814,0.0008595161,0.0030563439,0.00035385595,0.000019248166],"category_scores_gemma":[0.000042238422,0.0005084307,0.00014740443,0.00065178366,0.0007828569,0.00072373165,0.0004800125,0.0005383414,0.00003852116],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005946104,0.00007405332,0.000040737174,0.0001700186,0.000022536547,0.000116217365,0.0008982625,0.0066386526,0.00004085732,0.053475507,0.00016703084,0.9382967],"study_design_scores_gemma":[0.0024808918,0.0020606567,0.00019438892,0.0032872492,0.000042192634,0.0010267257,9.550793e-7,0.64855886,0.00061048364,0.21250238,0.1262455,0.0029897213],"about_ca_topic_score_codex":0.000021207617,"about_ca_topic_score_gemma":0.00017127823,"teacher_disagreement_score":0.93530697,"about_ca_system_score_codex":0.00024406049,"about_ca_system_score_gemma":0.0017330943,"threshold_uncertainty_score":0.9997367},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015764878,0.00043463675,0.9960492,0.0000815147,0.00042128062,0.00046820953,0.0000041769426,0.00028710582,0.0006773342],"genre_scores_gemma":[0.06321759,0.00019905058,0.9355745,0.000317401,0.0005209864,0.0000062567224,0.000017088378,0.000082016064,0.0000651133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835324,0.00000760045,0.00034693215,0.0005180741,0.00031161233,0.00046254165],"domain_scores_gemma":[0.9994038,0.00007358474,0.00006639901,0.00029870524,0.00006503696,0.00009247705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019772808,0.00040136054,0.00034175257,0.00025244863,0.00012231461,0.00021582945,0.0003495366,0.00018269863,0.00008343074],"category_scores_gemma":[0.000006792927,0.00038303237,0.00005343428,0.00019160006,0.00034303975,0.0006831999,0.00011557146,0.0004773595,0.0000069387193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000757231,0.0000035636608,0.000008437085,0.00006843015,0.00000621205,0.000020505136,0.0002557615,0.48205888,0.02172375,0.000014480914,0.000012186883,0.49582022],"study_design_scores_gemma":[0.00020279374,0.00004183734,0.000022795475,0.00017420267,0.000010742009,0.000050050436,2.2143246e-7,0.98304796,0.01071862,0.0051530446,0.00015226164,0.00042547905],"about_ca_topic_score_codex":0.00000832919,"about_ca_topic_score_gemma":0.00003188232,"teacher_disagreement_score":0.5009891,"about_ca_system_score_codex":0.00025856466,"about_ca_system_score_gemma":0.00003077646,"threshold_uncertainty_score":0.99986213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067760254,0.0001611065,0.99599075,0.00030810255,0.00074111583,0.00043346183,0.000012778279,0.0006968706,0.0009782338],"genre_scores_gemma":[0.882252,0.0000049199116,0.11349115,0.0011717306,0.00255895,0.000032324482,0.00010835358,0.000116592266,0.0002640058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972579,0.0000035130581,0.0005323136,0.001088438,0.000559446,0.0005583922],"domain_scores_gemma":[0.9982575,0.000085203275,0.000380775,0.00059804117,0.00063879153,0.000039691076],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00083507074,0.000522054,0.000672301,0.000935646,0.0004182664,0.0013021105,0.0011453744,0.00048142587,0.00002318804],"category_scores_gemma":[0.00005456324,0.00046892898,0.00016999592,0.0005264684,0.00042269717,0.0010392922,0.00011440965,0.0005251293,0.000028682904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015241752,0.000029268333,0.000015176421,0.00032222376,0.00002188615,0.000006664007,0.00006508692,0.8914856,0.0016722796,0.0022942177,0.00000899037,0.10406337],"study_design_scores_gemma":[0.0002994106,0.00000877953,0.0000019945549,0.0004781902,0.00008482443,0.000003988943,2.2380435e-7,0.96918714,0.000052415893,0.028935123,0.00037178883,0.00057612767],"about_ca_topic_score_codex":0.000053858337,"about_ca_topic_score_gemma":0.000037890546,"teacher_disagreement_score":0.8824996,"about_ca_system_score_codex":0.000050495066,"about_ca_system_score_gemma":0.00024700304,"threshold_uncertainty_score":0.99977624},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047271408,0.00083762547,0.9953022,0.000031464486,0.0021567545,0.00023167198,0.00001362438,0.0002984522,0.00065546605],"genre_scores_gemma":[0.89561343,0.000119722805,0.10370814,0.000087685105,0.0002977558,0.000013292955,0.00003625021,0.00007305661,0.00005065532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846226,0.0000065017416,0.000401291,0.00044136608,0.00038885072,0.0002997475],"domain_scores_gemma":[0.9990977,0.00017257925,0.000105040854,0.0004289271,0.00013903054,0.000056693738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017096479,0.00031286015,0.00042813638,0.00044426657,0.00010873521,0.000077660465,0.00043695245,0.00051362865,0.000026331942],"category_scores_gemma":[0.000049120594,0.0003025611,0.000046784084,0.00024012646,0.00078288704,0.00013509783,0.00022271644,0.0006073613,0.000008215806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010632505,0.000017386456,0.00024572102,0.0001798627,0.000018632456,0.0000057662387,0.000877152,0.71040875,0.0007877146,0.0016972665,0.000049012797,0.28570214],"study_design_scores_gemma":[0.0003809439,0.00013728604,0.000016518065,0.0001537459,0.000016044676,0.000005985995,0.00000252276,0.9275597,0.06220624,0.004135356,0.004976637,0.00040903923],"about_ca_topic_score_codex":0.000012654565,"about_ca_topic_score_gemma":0.00006586816,"teacher_disagreement_score":0.8951407,"about_ca_system_score_codex":0.000088128305,"about_ca_system_score_gemma":0.000058442612,"threshold_uncertainty_score":0.99994266},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006751911,0.00044018007,0.9970077,0.0007586534,0.0003041231,0.00022092117,0.000011547859,0.000067159854,0.000514509],"genre_scores_gemma":[0.062327117,0.00002334791,0.93342525,0.0037344694,0.00019807722,0.0000034680675,0.000005602458,0.0000238624,0.00025880412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611074,0.000041303385,0.00069279206,0.0014841893,0.0011780652,0.000492939],"domain_scores_gemma":[0.99735844,0.00023900701,0.00038480468,0.0013392936,0.00047361452,0.0002048596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006347784,0.0004652629,0.0014402503,0.0020338634,0.0003027667,0.00021547245,0.0021115197,0.000259135,0.000086848326],"category_scores_gemma":[0.000054899996,0.0003814416,0.0008416586,0.0024070605,0.00049306994,0.00044166992,0.0011498072,0.0004908755,0.000019084586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007123485,0.00007137585,0.0000177042,0.000041883275,0.00441444,0.00009850174,0.0038989773,0.76795685,0.0018755408,0.00058876246,0.00007423749,0.22095463],"study_design_scores_gemma":[0.00006777927,0.00006891589,0.00012249395,0.00005757458,0.0055080415,0.00005306205,2.565905e-7,0.99135727,0.0002873664,0.0015343473,0.00047826688,0.00046461186],"about_ca_topic_score_codex":0.000044506396,"about_ca_topic_score_gemma":0.000049081562,"teacher_disagreement_score":0.22340046,"about_ca_system_score_codex":0.00016987421,"about_ca_system_score_gemma":0.00052506186,"threshold_uncertainty_score":0.99986374},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044523197,0.000033890457,0.9924969,0.000109359025,0.00087517063,0.00017434408,0.00002626031,0.000059471124,0.00577934],"genre_scores_gemma":[0.8821353,0.000090435555,0.11281024,0.003317858,0.00028715172,0.0000033372812,0.0000030064111,0.000033447992,0.0013192329],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977661,0.000038644484,0.0003968772,0.0007915154,0.00065485504,0.00035204063],"domain_scores_gemma":[0.99867654,0.00054052385,0.0002578096,0.00032231922,0.000102365615,0.000100423305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003454493,0.0002721468,0.00037971314,0.0003139558,0.00016495187,0.0001225307,0.00081096956,0.00024298136,0.000646809],"category_scores_gemma":[0.0004127354,0.00023424193,0.000058428235,0.0002274773,0.0008386292,0.0001293283,0.0002671612,0.0005181576,0.00007364298],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021725446,0.00015836551,0.000024019233,0.00017750583,0.0000035211488,0.00018785105,0.0011831988,0.0066880295,0.05498827,0.09011249,0.000096177166,0.84635884],"study_design_scores_gemma":[0.00063124864,0.0010663292,0.0002090985,0.00064224045,0.000018539888,0.00014375686,5.1960933e-7,0.41123152,0.052235916,0.5308454,0.0018654306,0.001109983],"about_ca_topic_score_codex":0.0000029365692,"about_ca_topic_score_gemma":0.000008968407,"teacher_disagreement_score":0.8816901,"about_ca_system_score_codex":0.00009833969,"about_ca_system_score_gemma":0.00011364354,"threshold_uncertainty_score":0.95521086},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003317609,0.00058759743,0.99270505,0.00057129207,0.0016396539,0.00056582614,0.000025946503,0.00008872193,0.003782734],"genre_scores_gemma":[0.07617472,0.000053163498,0.92101276,0.0015958938,0.00046440598,0.000013591415,0.000069142785,0.000028855578,0.0005874492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635744,0.000048795715,0.00065261865,0.001726586,0.0006637435,0.00055079686],"domain_scores_gemma":[0.99575,0.00071460946,0.0004344439,0.0024778529,0.00046564845,0.00015743413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013470799,0.0004458662,0.0006279229,0.00039009642,0.00024725118,0.00025005123,0.0044782134,0.00039113846,0.000020346859],"category_scores_gemma":[0.00053265947,0.00034995395,0.0001448565,0.00042030454,0.0006533027,0.0005950101,0.0019942995,0.00046654648,0.000012929482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002455057,0.00026178485,0.0002383534,0.00016494344,0.000032628974,0.000091798654,0.00093513174,0.0088621965,0.000542069,0.42286167,0.0016270047,0.5643579],"study_design_scores_gemma":[0.00047064573,0.0005780679,0.00011404181,0.00025513984,0.000018746021,0.00008260607,3.6592687e-7,0.58283305,0.0014210582,0.39795873,0.015510157,0.00075740094],"about_ca_topic_score_codex":0.000007991782,"about_ca_topic_score_gemma":0.000080746744,"teacher_disagreement_score":0.57397085,"about_ca_system_score_codex":0.00012084937,"about_ca_system_score_gemma":0.00050762075,"threshold_uncertainty_score":0.9998953},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005625619,0.00004251989,0.9559476,0.00042603846,0.00022664868,0.00021384175,0.0000022618422,0.0000764899,0.042502057],"genre_scores_gemma":[0.76811236,0.000024183179,0.2259393,0.0012021569,0.0004611037,0.0000030235276,0.0000038992202,0.00004350762,0.0042104484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803406,0.000008722903,0.00024241749,0.0008433418,0.0005257905,0.0003456738],"domain_scores_gemma":[0.9990416,0.00006008384,0.00011364839,0.0006549108,0.000019064631,0.000110658715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002747886,0.00026647394,0.00020232359,0.00016265578,0.00023132781,0.00009927074,0.00061391096,0.0002142124,0.000114113944],"category_scores_gemma":[0.000017512786,0.00024931238,0.0000746834,0.00025453867,0.00066715176,0.00015894318,0.00035998004,0.00047292493,0.00040310054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014145061,0.000007771829,0.0000055219352,0.0000016521532,0.0000010326772,0.0000016984798,0.00015211343,0.34090942,0.001137095,0.00009169696,0.000027565784,0.65766305],"study_design_scores_gemma":[0.000076533644,0.000029168692,0.000099954246,0.000038310543,0.0000066106622,0.000028905111,5.679853e-8,0.94967455,0.0026292843,0.038912293,0.008187976,0.00031633614],"about_ca_topic_score_codex":0.00006703047,"about_ca_topic_score_gemma":0.00051477266,"teacher_disagreement_score":0.7675498,"about_ca_system_score_codex":0.00048897415,"about_ca_system_score_gemma":0.00005943034,"threshold_uncertainty_score":0.9999959},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012467437,0.00094474154,0.9857932,0.0006726152,0.0010549665,0.00032566075,0.0000016470834,0.00008288665,0.009877541],"genre_scores_gemma":[0.2018134,0.00020735644,0.7964703,0.0010531193,0.00030230422,0.0000047715653,0.000004385924,0.000025032183,0.00011932593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700147,0.000015849564,0.00043944252,0.0012625677,0.00072387955,0.00055678684],"domain_scores_gemma":[0.99853015,0.00027088073,0.00021753828,0.0007558781,0.00009951987,0.00012603053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011421378,0.00040466894,0.00039000003,0.00092523225,0.00014446104,0.00058034674,0.0013816442,0.000366017,0.000017621256],"category_scores_gemma":[0.000053110627,0.00033756363,0.00006593534,0.000514596,0.00045546505,0.0007825237,0.0009648672,0.000708913,0.00002217175],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007498432,0.000031653006,0.0001648832,0.000037067817,0.000002633365,0.000080969075,0.0004739974,0.001597721,0.000037494625,0.013986493,0.000011818818,0.9835678],"study_design_scores_gemma":[0.0006547818,0.00036161047,0.0037451722,0.0011135438,0.00000596887,0.00012045854,9.548464e-7,0.62229675,0.0007337153,0.3620964,0.0074642254,0.0014064022],"about_ca_topic_score_codex":0.000026594425,"about_ca_topic_score_gemma":0.000063283056,"teacher_disagreement_score":0.98216134,"about_ca_system_score_codex":0.00016909343,"about_ca_system_score_gemma":0.00015762275,"threshold_uncertainty_score":0.9999076},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042728996,0.00016656677,0.9910071,0.0003587847,0.0016809426,0.00032185967,0.0000034198724,0.00011943545,0.0062991856],"genre_scores_gemma":[0.088773325,0.000045825975,0.9097872,0.000753421,0.0003692728,0.0000041288695,0.0000028080647,0.00003623301,0.00022780243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959182,0.00003129166,0.00082562503,0.0012786884,0.0013023553,0.0006438194],"domain_scores_gemma":[0.99669254,0.0009410426,0.0004166328,0.001320641,0.00044804558,0.00018109835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011712121,0.00045049275,0.0005483167,0.0010905865,0.00014152125,0.00026075362,0.0031174156,0.00045455058,0.00007911081],"category_scores_gemma":[0.00029063772,0.00040428757,0.0001485991,0.0008454028,0.0011207402,0.0006682245,0.0010559623,0.00073413894,0.000055625056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009383173,0.00003562501,0.000049100625,0.000019241714,0.000009516276,0.000060195205,0.0007204546,0.59498316,0.0000949384,0.04142934,0.00001549128,0.36257356],"study_design_scores_gemma":[0.00006926102,0.00017914495,0.000023224276,0.00024856973,0.0000073882256,0.000046230023,2.4604037e-7,0.9198649,0.012855403,0.065429226,0.00078095857,0.00049546064],"about_ca_topic_score_codex":0.00002927464,"about_ca_topic_score_gemma":0.000050923667,"teacher_disagreement_score":0.3620781,"about_ca_system_score_codex":0.00024656893,"about_ca_system_score_gemma":0.0005134016,"threshold_uncertainty_score":0.9998409},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056290597,0.000119542485,0.94178313,0.00040146714,0.0010135064,0.00013284088,8.446233e-7,0.000057804125,0.00020026477],"genre_scores_gemma":[0.9500418,0.0001830102,0.049027134,0.0002315488,0.00028131166,0.0000044228786,0.0000038084013,0.000029716835,0.00019726662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747545,0.000046934874,0.00039309997,0.0011033375,0.0005626483,0.00041855325],"domain_scores_gemma":[0.9988702,0.00024450652,0.00024396782,0.000506748,0.000025135125,0.00010943651],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007075461,0.00035020197,0.0003453741,0.0006695878,0.00017994423,0.0005331151,0.001055317,0.00021156175,0.000006609759],"category_scores_gemma":[0.00006672181,0.00034357337,0.00005386478,0.0002061188,0.0001946445,0.0007968196,0.0013390981,0.002046365,0.000015079201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041479934,0.00006002478,0.017479656,0.000047473506,0.000012902064,0.00016110249,0.0055219354,0.0888968,0.0013791627,0.0005884452,3.461302e-7,0.885848],"study_design_scores_gemma":[0.000672726,0.00034411115,0.0119364625,0.0020229244,0.000015762656,0.000087671266,0.000016266618,0.9626388,0.0015271723,0.016840447,0.0024623913,0.0014352908],"about_ca_topic_score_codex":0.00002304098,"about_ca_topic_score_gemma":0.00017741787,"teacher_disagreement_score":0.8937512,"about_ca_system_score_codex":0.00020558189,"about_ca_system_score_gemma":0.00009011764,"threshold_uncertainty_score":0.99990165},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026711237,0.0015442651,0.9919876,0.0015344204,0.0011496223,0.00031427402,0.000012608682,0.00017108578,0.0030190526],"genre_scores_gemma":[0.10090845,0.002873154,0.8896582,0.0036990906,0.001372297,0.000035912297,0.00007854431,0.000073220115,0.0013011338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711365,0.000033020086,0.0004015614,0.0012697789,0.0006139645,0.0005680071],"domain_scores_gemma":[0.9984571,0.00020751264,0.00019863651,0.00076755625,0.0001825507,0.00018664163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047776595,0.0004078592,0.00036019835,0.00067407865,0.0003854159,0.0004917861,0.0011737616,0.00028814393,0.00006553578],"category_scores_gemma":[0.000027095017,0.00038628507,0.000081724625,0.00044432504,0.00048391774,0.0007948395,0.00093717186,0.0005892347,0.0002168465],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028964012,0.000025957233,0.000003748542,0.000013422442,0.0000041894996,0.000019506633,0.00024850728,0.002482381,0.00053301814,0.0016878993,0.00023271024,0.9947458],"study_design_scores_gemma":[0.0010541136,0.00038184793,0.00033643137,0.001105059,0.000020733418,0.00037434837,0.0000010310256,0.64691085,0.005100478,0.30925804,0.033493847,0.0019632375],"about_ca_topic_score_codex":0.000007815472,"about_ca_topic_score_gemma":0.00002683506,"teacher_disagreement_score":0.99278253,"about_ca_system_score_codex":0.00015543998,"about_ca_system_score_gemma":0.0001598728,"threshold_uncertainty_score":0.9998589},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034291125,0.0016061623,0.9817714,0.011197132,0.0009949286,0.00033890372,0.000008228201,0.00003676725,0.00061737525],"genre_scores_gemma":[0.025389306,0.000996716,0.9333162,0.038201127,0.0019569877,0.000005588292,0.000021149917,0.000024319323,0.000088652516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99512374,0.00016760443,0.0021492785,0.001425432,0.0007128524,0.00042107017],"domain_scores_gemma":[0.99475235,0.000823749,0.0005824018,0.0010009179,0.0025776708,0.00026293387],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0067062895,0.0004264572,0.00075740623,0.00011951731,0.00017743716,0.00011300067,0.0011009148,0.0009939197,0.0000021246249],"category_scores_gemma":[0.018791283,0.00028279197,0.00020186757,0.00015271141,0.00094469707,0.000041713465,0.0008154185,0.00084808207,0.000002429724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031537982,0.00008916493,0.000011279148,0.000010227267,0.000034411954,0.0000110789815,0.00006491059,0.07273722,0.00013705587,0.000314118,0.00047923456,0.9257959],"study_design_scores_gemma":[0.00047138837,0.0025583247,0.00006859674,0.0001617199,0.00008600669,0.00012691224,0.000007893791,0.92776334,0.000044711574,0.008080317,0.060216628,0.00041416584],"about_ca_topic_score_codex":0.00003092153,"about_ca_topic_score_gemma":0.00007103364,"teacher_disagreement_score":0.9253818,"about_ca_system_score_codex":0.000023325252,"about_ca_system_score_gemma":0.0006162641,"threshold_uncertainty_score":0.99996245},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.1055833e-7,0.0007826837,0.9916129,0.00037466353,0.00264695,0.0007491169,0.0000055406,0.0004153799,0.0034119699],"genre_scores_gemma":[0.0072442372,0.000029028202,0.9907006,0.0008571723,0.00067366916,0.000032405547,0.0000035799553,0.000022137929,0.00043718552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971741,0.0000641411,0.00054803607,0.0012413854,0.00048291494,0.0004894142],"domain_scores_gemma":[0.9977775,0.00039915048,0.0003155598,0.001034883,0.00036173788,0.00011114717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001577832,0.00041892775,0.0004561444,0.00057158933,0.0002386828,0.0008682655,0.002159949,0.0003677189,0.000005822123],"category_scores_gemma":[0.00010771629,0.0003818052,0.00017263857,0.000505063,0.00025137202,0.00091737567,0.0007278763,0.0003910369,0.000014098789],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004936141,0.000009890356,0.0000012238013,0.000027747916,0.000004828856,0.000003642167,0.00008472635,0.0013916524,0.00019054234,0.014855498,0.000061742736,0.98336357],"study_design_scores_gemma":[0.00015961533,0.00031443758,0.000011805316,0.00028790103,0.000006929874,0.00007863306,7.750402e-8,0.8290511,0.0070565995,0.14354177,0.019025903,0.000465258],"about_ca_topic_score_codex":0.00003275021,"about_ca_topic_score_gemma":0.000029469578,"teacher_disagreement_score":0.9828983,"about_ca_system_score_codex":0.00062018645,"about_ca_system_score_gemma":0.00028347626,"threshold_uncertainty_score":0.9998634},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022104771,0.0007094218,0.9941859,0.00028552997,0.0014671664,0.00031377477,0.000013620758,0.00016309149,0.0026404273],"genre_scores_gemma":[0.42898542,0.000111562025,0.56944704,0.00088851835,0.00032865768,0.000005837297,0.000010174021,0.00004577039,0.00017702207],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99578977,0.000072905714,0.00079392485,0.0014052271,0.0012081303,0.00073006755],"domain_scores_gemma":[0.99668145,0.00072524225,0.0005452627,0.0015319004,0.00031738804,0.00019874261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016137534,0.0006049874,0.0007990714,0.0026675763,0.0002224489,0.00030326477,0.004501231,0.00035447063,0.00002672209],"category_scores_gemma":[0.000108876404,0.00055015116,0.00027596825,0.0023593246,0.00069725316,0.00076707476,0.0013378101,0.00094253675,0.000028234148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052692103,0.000052747266,0.000041305153,0.000037059268,0.000022895865,0.00005383774,0.00039402838,0.040710296,0.000162516,0.12494832,0.0000060065263,0.8335657],"study_design_scores_gemma":[0.0004180893,0.0002488998,0.0002687844,0.00040498213,0.000016094178,0.000078983576,1.0223323e-7,0.20524837,0.003997357,0.7877284,0.00074773,0.00084219],"about_ca_topic_score_codex":0.000035784407,"about_ca_topic_score_gemma":0.00003908176,"teacher_disagreement_score":0.8327235,"about_ca_system_score_codex":0.000140725,"about_ca_system_score_gemma":0.0003812559,"threshold_uncertainty_score":0.999695},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000097190794,0.00048801562,0.9926924,0.000084404994,0.003594418,0.00023872175,0.000012582576,0.00019292918,0.0025993148],"genre_scores_gemma":[0.10711824,0.00014690276,0.8882083,0.0016616985,0.001837698,0.000029365552,0.000011699352,0.00020225656,0.0007837815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836326,0.000005576018,0.00026968907,0.0005186431,0.0004126513,0.00043017548],"domain_scores_gemma":[0.99910426,0.00008829409,0.0000458041,0.00047215162,0.00010879745,0.00018066271],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003465459,0.0003440884,0.00038432478,0.00025204636,0.00005798189,0.00012078933,0.0006302449,0.00023585284,0.000050985243],"category_scores_gemma":[0.000060506623,0.0003189152,0.00004604481,0.00017493703,0.00006583191,0.00018454816,0.00029662557,0.00032124747,0.000045223736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009130293,0.00000532485,5.2217763e-7,0.00008394578,0.0000086305245,0.000045479996,0.000437885,0.66396147,0.01304644,0.004243348,0.0001289035,0.3180289],"study_design_scores_gemma":[0.0010014694,0.00025864516,0.000012881749,0.0019614596,0.000043652308,0.00013484218,0.000001555846,0.37221804,0.026378348,0.46540973,0.12962203,0.0029573645],"about_ca_topic_score_codex":0.0000031792808,"about_ca_topic_score_gemma":0.00001945099,"teacher_disagreement_score":0.46116638,"about_ca_system_score_codex":0.00023814924,"about_ca_system_score_gemma":0.00011063107,"threshold_uncertainty_score":0.99992627},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002050755,0.00027578443,0.97658753,0.00009703561,0.0020955263,0.0003289497,0.000001772465,0.0000708286,0.020337483],"genre_scores_gemma":[0.95857537,0.000009429489,0.03735551,0.0004545946,0.0019477513,0.000010733489,0.0000011402637,0.000041602405,0.0016038436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973269,0.00007416649,0.0005746915,0.00092897995,0.00051920995,0.0005760324],"domain_scores_gemma":[0.9976087,0.0004946758,0.00038964688,0.0012293359,0.00018316045,0.00009444675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007140959,0.00039440158,0.00051540957,0.00015373313,0.00032690424,0.00027905265,0.0027521157,0.0002114713,0.000047953326],"category_scores_gemma":[0.000028039498,0.00025597523,0.00014372256,0.00066968333,0.0006464362,0.00021955853,0.00072157866,0.0005763998,0.000038533366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019001136,0.000030349715,0.0001068762,0.00004095937,0.000024622024,0.000033936987,0.0012496515,0.39927393,0.000027898175,0.012844095,0.00010182647,0.58624685],"study_design_scores_gemma":[0.00018320173,0.00022579181,0.000052871783,0.0013476105,0.000011484917,0.00020748825,7.666308e-8,0.974153,0.00014786853,0.018134106,0.0051275254,0.00040899386],"about_ca_topic_score_codex":0.000014185938,"about_ca_topic_score_gemma":0.000070077476,"teacher_disagreement_score":0.9583703,"about_ca_system_score_codex":0.00011583231,"about_ca_system_score_gemma":0.00047449642,"threshold_uncertainty_score":0.9999893},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004224105,0.00014835103,0.99609005,0.00021861865,0.0008810899,0.00048387202,0.000066037144,0.00023957768,0.001830147],"genre_scores_gemma":[0.03466648,0.000090625515,0.96251404,0.00055946974,0.000989214,0.00013526563,0.00015539853,0.00006822202,0.00082125806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973171,0.000018128614,0.0004389882,0.0011101507,0.00065365375,0.00046202578],"domain_scores_gemma":[0.99816173,0.00036862024,0.00037187064,0.0008354481,0.00017050555,0.000091843845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006568819,0.0003265661,0.0003608663,0.00040049973,0.00035258217,0.000876501,0.00184436,0.0002146882,0.0000056303556],"category_scores_gemma":[0.000055807828,0.00031854544,0.00010237026,0.0004623137,0.00009505778,0.0007296334,0.00039256155,0.00023503305,0.000050128652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022476058,0.000021525948,0.000020951855,0.000063322725,0.000012850597,0.000004034465,0.00045984634,0.008898785,0.00005002783,0.08472805,0.000048702543,0.90568966],"study_design_scores_gemma":[0.00019097679,0.00006864984,0.00005890746,0.00044026258,0.000012766765,0.000015518308,3.3009616e-7,0.962137,0.00037181034,0.029183866,0.007064973,0.00045494759],"about_ca_topic_score_codex":0.000032813514,"about_ca_topic_score_gemma":0.000017134558,"teacher_disagreement_score":0.9532382,"about_ca_system_score_codex":0.0007205187,"about_ca_system_score_gemma":0.0002738156,"threshold_uncertainty_score":0.9999267},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019726781,0.0005001973,0.9934411,0.00021882057,0.0029709577,0.0016948641,0.000001595997,0.0002907468,0.0006844371],"genre_scores_gemma":[0.01825536,0.000018337158,0.9777451,0.002437182,0.00052690867,0.00018069756,0.000052545976,0.000047771646,0.00073606236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924543,0.00019903634,0.00084167987,0.0026234132,0.0028063315,0.0010752279],"domain_scores_gemma":[0.99615026,0.00017811694,0.00042148758,0.002477281,0.00045056333,0.0003223111],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0036721202,0.0007182807,0.00052487425,0.0010629562,0.0004144974,0.0010032533,0.005688081,0.0002920931,0.00004124966],"category_scores_gemma":[0.0000903737,0.0006935044,0.00010918787,0.0015634138,0.00034901698,0.0011383594,0.0022111519,0.00069063227,0.00011827266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.0000016630105,0.00008431961,0.000010869879,0.00003096121,0.000009925682,0.000042249063,0.000995954,0.42651612,0.000014781787,0.0003051648,0.00006258017,0.5719254],"study_design_scores_gemma":[0.00077151466,0.00017656338,0.000503798,0.000442267,0.000016973454,0.000016736301,2.7095447e-7,0.9764827,0.00086965354,0.008772462,0.011031039,0.0009160107],"about_ca_topic_score_codex":0.00002240448,"about_ca_topic_score_gemma":0.00030922776,"teacher_disagreement_score":0.5710094,"about_ca_system_score_codex":0.008273754,"about_ca_system_score_gemma":0.0111949155,"threshold_uncertainty_score":0.9996916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010824423,0.00016166567,0.9941863,0.0011147575,0.00084414764,0.0025313662,0.000050925875,0.00025932144,0.0008407389],"genre_scores_gemma":[0.01976529,0.0000039204615,0.9782354,0.0012320308,0.0003173886,0.00032053626,0.000046020894,0.000037567963,0.00004180934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648625,0.000033177046,0.0005865822,0.0016066595,0.00078359403,0.0005037301],"domain_scores_gemma":[0.99703246,0.00050461234,0.0002934627,0.0016107367,0.00035877145,0.00019997831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082345173,0.00044399445,0.00042881927,0.0007553646,0.00027619067,0.00035556772,0.002946868,0.00034117585,0.00001565916],"category_scores_gemma":[0.00009486535,0.00045069715,0.00013707762,0.0008707984,0.00027960475,0.00048859866,0.00022682307,0.00042563942,0.000048832007],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000142639465,0.00003070948,0.0000033656645,0.00003123989,0.0000058224023,0.0000017395004,0.00039168214,0.07734298,0.000542779,0.06488167,0.0000046626387,0.8567491],"study_design_scores_gemma":[0.00042576704,0.00022187304,0.00008249912,0.00024784074,0.000012449665,0.000003015439,8.2753104e-8,0.7287193,0.0074065374,0.25646415,0.0058402442,0.00057625887],"about_ca_topic_score_codex":0.00002896289,"about_ca_topic_score_gemma":0.000050722334,"teacher_disagreement_score":0.85617286,"about_ca_system_score_codex":0.0004893048,"about_ca_system_score_gemma":0.00084558345,"threshold_uncertainty_score":0.9997945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013185419,0.0021874828,0.99204236,0.0019335784,0.0018395964,0.0010486066,0.00005632401,0.00017767597,0.0007011611],"genre_scores_gemma":[0.04290446,0.00020315903,0.9528228,0.0023153992,0.0009862098,0.000056118104,0.000024198798,0.00007118829,0.00061645673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99567753,0.000038590653,0.0006120271,0.0017768353,0.0010744728,0.0008205136],"domain_scores_gemma":[0.9953924,0.0014650831,0.00040943333,0.002237993,0.00032124354,0.00017387565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006151849,0.0006491417,0.0005540132,0.0003467271,0.00096930604,0.0006974758,0.00488997,0.00029952094,0.000012016311],"category_scores_gemma":[0.0000776369,0.00043205748,0.00021833293,0.0004749879,0.0010917593,0.0003784965,0.0015999293,0.0007667393,0.000011704217],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025818263,0.000027190656,0.000009578207,0.00005544372,0.000033021897,0.00006855787,0.0008529748,0.09105266,0.000042055923,0.09250747,0.0016118672,0.8137134],"study_design_scores_gemma":[0.00044678067,0.00015071583,0.00015272376,0.00024532297,0.000014082648,0.0001802441,4.46058e-7,0.6277445,0.000226443,0.33644968,0.03366059,0.00072843215],"about_ca_topic_score_codex":0.00004678161,"about_ca_topic_score_gemma":0.00009589711,"teacher_disagreement_score":0.81298494,"about_ca_system_score_codex":0.0002203648,"about_ca_system_score_gemma":0.00062558375,"threshold_uncertainty_score":0.99981314},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012502965,0.00008524695,0.9950347,0.00031631082,0.001068107,0.00080764276,0.000049080314,0.000061034985,0.0024528434],"genre_scores_gemma":[0.7718412,0.000009724937,0.22303163,0.0011116172,0.000364868,0.0000730236,0.000009512709,0.000038042297,0.0035203665],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99632114,0.000041328974,0.0007813581,0.0013805568,0.0010435234,0.00043207718],"domain_scores_gemma":[0.9959979,0.0014200768,0.0004664543,0.0011283596,0.0008029564,0.00018425801],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002232294,0.00036508805,0.00048376276,0.00055770244,0.00040744472,0.00032903688,0.002167517,0.0002877936,0.00038910782],"category_scores_gemma":[0.00033151338,0.00027864,0.00021284577,0.00037538714,0.00080136745,0.0003272624,0.0003922352,0.0003785034,0.00025229048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042791733,0.000045212346,0.0000041214735,0.0000068590034,0.000011367893,0.000006085147,0.00033801523,0.004558901,0.0020064334,0.24782017,0.000039346138,0.7451207],"study_design_scores_gemma":[0.00023426283,0.00014994819,0.000028857135,0.00004473121,0.00001037969,0.000021754133,0.0000019218835,0.051787302,0.0066190483,0.93879974,0.0019674283,0.00033464475],"about_ca_topic_score_codex":0.000013721634,"about_ca_topic_score_gemma":0.00006682793,"teacher_disagreement_score":0.77200305,"about_ca_system_score_codex":0.00010079101,"about_ca_system_score_gemma":0.00024645875,"threshold_uncertainty_score":0.99996656},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039528846,0.00012796074,0.9890944,0.0008595446,0.0019143914,0.00037121755,0.00000961519,0.00013804388,0.007089575],"genre_scores_gemma":[0.5495109,0.000032779946,0.4461305,0.0035365971,0.0004740877,0.000009413491,0.000011133047,0.000058241727,0.00023637498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957076,0.0000851124,0.0006671577,0.0013805835,0.0014115182,0.0007480735],"domain_scores_gemma":[0.9955183,0.0013927594,0.00041420606,0.0022167729,0.00027865122,0.00017930202],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017535142,0.00059103186,0.00063340634,0.0008946226,0.00060576666,0.00038235792,0.005668248,0.000287276,0.000058821603],"category_scores_gemma":[0.00012998717,0.0004456641,0.00021374896,0.0009972133,0.0043466114,0.0005679777,0.0015011539,0.0011695365,0.000023005621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008273497,0.000047655205,0.000010192292,0.000019899975,0.000010500189,0.00002674452,0.0007048659,0.002191008,0.00004092065,0.70674074,0.0000140750635,0.29018512],"study_design_scores_gemma":[0.00012157517,0.00030941798,0.0001540668,0.00027468777,0.0000048898273,0.000037859194,3.5165706e-7,0.29724053,0.0019488821,0.6988497,0.0006237652,0.00043429443],"about_ca_topic_score_codex":0.00007968437,"about_ca_topic_score_gemma":0.00048693197,"teacher_disagreement_score":0.5491156,"about_ca_system_score_codex":0.00018844068,"about_ca_system_score_gemma":0.00032287798,"threshold_uncertainty_score":0.9997995},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064811916,0.0015298222,0.98859006,0.00012307664,0.0013014573,0.0006886577,0.00003824396,0.000021064254,0.0012264354],"genre_scores_gemma":[0.43039683,0.0005060232,0.5622807,0.0008844512,0.003955147,0.000075130396,0.0002737108,0.00014190887,0.0014860771],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979988,0.000012320437,0.0002851263,0.00095286604,0.0003179211,0.00043299762],"domain_scores_gemma":[0.99900156,0.000032169257,0.00015998469,0.00053887226,0.00017169333,0.00009570403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002482073,0.00035158204,0.00026274627,0.00030377758,0.00012612724,0.00008554242,0.00063306,0.0003382325,0.000019801453],"category_scores_gemma":[0.00003310749,0.0003472528,0.00014348282,0.00014669444,0.0004859049,0.00000585977,0.00023921243,0.00021074015,0.000007029463],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033318007,0.00003437579,0.00045071123,0.000049313185,0.00005519207,0.0000048514157,0.000056367353,0.012042479,0.03846559,0.0007902339,0.00007073203,0.94794685],"study_design_scores_gemma":[0.007732497,0.0066713253,0.0052471627,0.00066816126,0.00036838985,0.0006603297,0.0000025454387,0.06764212,0.3686423,0.20115554,0.3336332,0.0075764055],"about_ca_topic_score_codex":0.0000036514152,"about_ca_topic_score_gemma":0.0000727917,"teacher_disagreement_score":0.94037044,"about_ca_system_score_codex":0.000069804686,"about_ca_system_score_gemma":0.00022489895,"threshold_uncertainty_score":0.99989796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040541711,0.00094815023,0.99228156,0.00002029962,0.00056522375,0.00016439712,0.0000029342477,0.0002032781,0.0054087383],"genre_scores_gemma":[0.81896013,0.00003231921,0.180084,0.00014944686,0.00045857803,0.000005222114,0.000009847551,0.00008668882,0.00021375829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980576,0.00000481077,0.0003060465,0.00063704036,0.0005103812,0.00048409592],"domain_scores_gemma":[0.9992351,0.00005538578,0.000042734297,0.00050261186,0.00007813511,0.000086058404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002017593,0.00042075483,0.00035388666,0.0003297995,0.00011451952,0.0001779981,0.00067924586,0.00020785406,0.000017351545],"category_scores_gemma":[0.0000064379847,0.00034992737,0.000053836684,0.00018356653,0.00017085421,0.00015723241,0.00012247615,0.00067220576,0.000014760552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018832951,0.000002935875,0.000019736422,0.00003222066,0.0000060073344,0.00007735493,0.00014958915,0.9382797,0.000061048246,0.00024201446,0.000011706249,0.06111584],"study_design_scores_gemma":[0.00006085412,0.000046117897,0.000011238014,0.00056709215,0.000006659932,0.000039357572,1.1585308e-7,0.99298733,0.00043894656,0.005161243,0.00020497479,0.00047605208],"about_ca_topic_score_codex":0.000035908044,"about_ca_topic_score_gemma":0.000041626605,"teacher_disagreement_score":0.8185547,"about_ca_system_score_codex":0.00015221204,"about_ca_system_score_gemma":0.000080073056,"threshold_uncertainty_score":0.9998953},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004885605,0.0000622828,0.9910991,0.00012438829,0.00021433167,0.00055635395,0.000017891949,0.000054774762,0.0073823244],"genre_scores_gemma":[0.9420043,0.0000042085017,0.055968888,0.00032312403,0.0014946866,0.00005161789,0.000034838726,0.000040232047,0.00007808892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766403,0.00001427701,0.0004616897,0.00092251244,0.00035761882,0.000579887],"domain_scores_gemma":[0.9986364,0.0003142839,0.00025355705,0.00047726,0.00024604812,0.00007243615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004940854,0.00042816176,0.00061074627,0.0004364064,0.00026519905,0.0002110664,0.0011317012,0.00026367966,0.00004714433],"category_scores_gemma":[0.000005596863,0.0004278721,0.00021361357,0.00035802423,0.0006700816,0.00026648236,0.00048791795,0.0012015114,0.000002465876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014966889,0.00004084781,0.0007766795,0.000011203991,0.000023835159,0.000004315611,0.00033515177,0.4907555,0.0000614468,0.37441102,0.000023527451,0.13354151],"study_design_scores_gemma":[0.00013334496,0.00002444437,0.00009134825,0.000105113795,0.000010055129,4.7255574e-7,1.8573367e-7,0.47524527,0.00010042265,0.5235688,0.0004162231,0.0003043168],"about_ca_topic_score_codex":0.00006524856,"about_ca_topic_score_gemma":0.0003284543,"teacher_disagreement_score":0.94151574,"about_ca_system_score_codex":0.00011714615,"about_ca_system_score_gemma":0.00019219155,"threshold_uncertainty_score":0.9998173},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048221528,0.0017891829,0.9955391,0.0003902951,0.0008319897,0.0002879759,0.0000109917755,0.000075952164,0.00059228076],"genre_scores_gemma":[0.35544544,0.000050993927,0.64271086,0.0007819742,0.00035622274,0.000009022182,0.000009666138,0.000023359082,0.0006124395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977507,0.000016538721,0.0003913628,0.0010586454,0.00038683644,0.00039594428],"domain_scores_gemma":[0.9988019,0.00015587866,0.00014961213,0.0007383181,0.00007166452,0.00008262328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040963077,0.0003589328,0.00037628078,0.00049594085,0.000109445595,0.00025431174,0.0008986085,0.00014928344,0.0000058699443],"category_scores_gemma":[0.00006176589,0.00030521274,0.000036127396,0.00032724987,0.0003616678,0.0011555059,0.0009888458,0.0006006653,0.000010536923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008062742,0.000025239182,0.00003787604,0.000049247465,0.000005088104,0.000078696925,0.0033703842,0.013183796,0.004794875,0.044497397,0.000008315434,0.933941],"study_design_scores_gemma":[0.0008111518,0.00015583659,0.00033437458,0.0012123525,0.000003934573,0.00041768758,0.0000018647016,0.980984,0.004297729,0.0031782442,0.0074588503,0.001144007],"about_ca_topic_score_codex":0.00006597398,"about_ca_topic_score_gemma":0.0011744358,"teacher_disagreement_score":0.9678002,"about_ca_system_score_codex":0.00018556579,"about_ca_system_score_gemma":0.00014407365,"threshold_uncertainty_score":0.99994},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063614876,0.00024523822,0.9958249,0.0012243151,0.00078717957,0.0007590913,0.000017872026,0.00028611155,0.00079172116],"genre_scores_gemma":[0.013096677,0.000045182824,0.9833207,0.0022008778,0.00031347317,0.00001919735,0.000008603141,0.000044920387,0.0009503278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967749,0.000020943648,0.0004728693,0.0014742734,0.00067270297,0.000584306],"domain_scores_gemma":[0.9974156,0.00051444094,0.00030772685,0.0011864129,0.00037895076,0.00019688589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095867814,0.0004753634,0.00045234538,0.0005534798,0.00043534156,0.00066353404,0.0020852918,0.00044230308,0.000030942883],"category_scores_gemma":[0.00016663907,0.00043180597,0.00013674892,0.0004061101,0.0009447999,0.00060526934,0.0010884044,0.00069187256,0.000017902155],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101271806,0.0000546539,0.000022972537,0.00024419228,0.000012807864,0.00006153767,0.00036148212,0.0001448961,0.11932871,0.0044074007,0.00008215049,0.8751779],"study_design_scores_gemma":[0.00057038,0.00031640657,0.00015448025,0.0002850403,0.000012356345,0.00008035229,9.3606694e-8,0.5979748,0.3482623,0.040647138,0.010755707,0.00094094465],"about_ca_topic_score_codex":0.0000066327025,"about_ca_topic_score_gemma":0.000025437646,"teacher_disagreement_score":0.874237,"about_ca_system_score_codex":0.00024314456,"about_ca_system_score_gemma":0.0003761349,"threshold_uncertainty_score":0.9998134},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000070012256,0.00017684112,0.9946241,0.00049814966,0.0032086556,0.00077034684,0.000012936544,0.00038344163,0.0003185409],"genre_scores_gemma":[0.0033193922,0.000020038864,0.99446005,0.00074620836,0.00031956087,0.000056467325,0.000016648897,0.000040586092,0.0010210542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682593,0.000036294845,0.00054357125,0.001166035,0.000797546,0.000630637],"domain_scores_gemma":[0.9958748,0.0020748377,0.00027193443,0.0013234738,0.0003969659,0.0000579683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016298834,0.00049936137,0.00043114912,0.00043049714,0.00026851273,0.00043073588,0.0033756436,0.00026028662,0.0000083702935],"category_scores_gemma":[0.0008202878,0.0003622868,0.00014766683,0.00053315586,0.00045118856,0.000710196,0.0007959677,0.00057380786,0.000012032183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055577343,0.000008113142,0.00000758328,0.000020196321,0.000010617831,0.000011088564,0.00016266598,0.34636378,0.000096106174,0.008026981,0.00015346511,0.64513385],"study_design_scores_gemma":[0.00059111643,0.00037952443,0.0004407599,0.00028480295,0.000028414854,0.00004491308,3.2950783e-7,0.6191715,0.0062414533,0.34792075,0.023644727,0.0012517044],"about_ca_topic_score_codex":0.000020016463,"about_ca_topic_score_gemma":0.000020605925,"teacher_disagreement_score":0.64388216,"about_ca_system_score_codex":0.00040764478,"about_ca_system_score_gemma":0.0005279576,"threshold_uncertainty_score":0.99988294},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002399594,0.0005382778,0.99298835,0.00036737602,0.0015897678,0.0004215993,0.000025152907,0.00024077082,0.0014291218],"genre_scores_gemma":[0.96767974,0.000029378889,0.030009044,0.0012198769,0.0003866806,0.0000095628775,0.000037102553,0.00003970714,0.00058893225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99547136,0.000038230162,0.000534627,0.0016348716,0.0014641689,0.00085676485],"domain_scores_gemma":[0.9972161,0.00039940802,0.00033180264,0.0013340896,0.0004744948,0.00024410067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011816063,0.0006232699,0.0006180962,0.0005034644,0.00035670484,0.00068641064,0.0024534033,0.0002855728,0.000008594894],"category_scores_gemma":[0.000052855958,0.0004902175,0.00016101057,0.00058712234,0.00077466643,0.00031989565,0.000813163,0.00090151845,0.00003914928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010264224,0.00017183913,0.00032179835,0.00007317079,0.000060490183,0.0008258964,0.0008683461,0.17567046,0.00060166797,0.07979728,0.00007732279,0.7414291],"study_design_scores_gemma":[0.0010686879,0.0006216878,0.0008224414,0.001231127,0.000032275755,0.00034481837,0.0000013937223,0.9833715,0.0028914972,0.0060294485,0.0019482805,0.0016368283],"about_ca_topic_score_codex":0.00010019358,"about_ca_topic_score_gemma":0.00017585541,"teacher_disagreement_score":0.9652801,"about_ca_system_score_codex":0.0005965061,"about_ca_system_score_gemma":0.00044606073,"threshold_uncertainty_score":0.99975497},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011010432,0.00009557165,0.99620986,0.001443501,0.0009560755,0.000629027,0.00001740279,0.00012434208,0.00041409905],"genre_scores_gemma":[0.009044167,0.00007225978,0.9885891,0.0011795615,0.0003558724,0.00003176177,0.00003462571,0.000026294807,0.00066636904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769646,0.000011313523,0.0003583984,0.0012209532,0.00032259818,0.00039029607],"domain_scores_gemma":[0.998356,0.00025077618,0.00024981174,0.0006745545,0.0002729737,0.00019587872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004628881,0.00034068973,0.00030280853,0.00046686255,0.00025024117,0.00050540693,0.0010301126,0.00045143004,0.000010803645],"category_scores_gemma":[0.00008819982,0.00031327354,0.00008354538,0.00019743023,0.00021336683,0.0007590968,0.00038794012,0.00058034307,0.000018490837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009785355,0.000010553179,0.0000012851456,0.00002559545,0.000003116576,9.3173276e-7,0.00030739798,0.00041932386,0.009967745,0.0011790306,0.000056755933,0.98801845],"study_design_scores_gemma":[0.00025388482,0.00007005372,0.00001047051,0.00013980448,0.000005866517,0.000011919474,7.7517946e-8,0.66569275,0.0030581118,0.33001593,0.0004579385,0.00028320018],"about_ca_topic_score_codex":0.000015517531,"about_ca_topic_score_gemma":0.00007914317,"teacher_disagreement_score":0.9877353,"about_ca_system_score_codex":0.00007628719,"about_ca_system_score_gemma":0.00048695193,"threshold_uncertainty_score":0.99993193},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055768155,0.00017515218,0.86686516,0.00007893359,0.00031015548,0.00013955354,0.000004269882,0.000058406564,0.12679155],"genre_scores_gemma":[0.8803448,0.0000029452538,0.11537158,0.00009301854,0.0005538665,0.0000037718053,0.000017707482,0.000050376435,0.0035619396],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99779874,0.00029717648,0.00040181255,0.00073526864,0.00040643173,0.00036059157],"domain_scores_gemma":[0.99808717,0.0011966816,0.00013118892,0.00037941828,0.00014999098,0.00005557145],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001995087,0.00031668125,0.00048180632,0.00068020483,0.00020459348,0.000026286492,0.00050124846,0.0003354224,0.00070064113],"category_scores_gemma":[0.000052285173,0.00026092533,0.00007736534,0.00045238284,0.00096605497,0.00007064082,0.000053933432,0.0020564296,0.00005471465],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059811584,0.000036421192,0.007416993,0.000025537513,0.00006578324,0.00002057446,0.011900383,0.017284995,0.000054770044,0.039406925,0.0000078908215,0.92371994],"study_design_scores_gemma":[0.008210888,0.0081638405,0.42797938,0.006846926,0.0004455476,0.0004590369,0.000012631828,0.017331023,0.0016390976,0.26745117,0.25460735,0.0068531083],"about_ca_topic_score_codex":0.00001958045,"about_ca_topic_score_gemma":0.000008709363,"teacher_disagreement_score":0.9168668,"about_ca_system_score_codex":0.00009289273,"about_ca_system_score_gemma":0.00022634298,"threshold_uncertainty_score":0.9999843},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22902818,0.00002481065,0.7678178,0.00012810204,0.000074490985,0.0028764794,0.000015227476,0.00001545069,0.000019488501],"genre_scores_gemma":[0.9927962,0.0000011014223,0.00644609,0.00017142392,0.00026084235,0.0001637273,0.00007403365,0.00003180826,0.00005476473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983962,0.00007633233,0.00030595338,0.0005653993,0.00037371396,0.0002823635],"domain_scores_gemma":[0.99839014,0.00010075534,0.00054315984,0.00066861184,0.00025807347,0.000039238825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005194837,0.00028109594,0.00022432646,0.00007336601,0.00042875906,0.00009579274,0.0007055937,0.00015562322,8.4543336e-7],"category_scores_gemma":[0.00016552453,0.00016159897,0.00004173584,0.0002858007,0.00018269698,0.000023551207,0.0003784394,0.0004335386,2.3600685e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012276003,0.000028328403,0.02127751,0.000045357276,0.000054712804,0.0000037545087,0.00043852138,0.95293313,0.0029297762,0.00000637601,0.0000064493097,0.022153337],"study_design_scores_gemma":[0.00065945054,0.002049007,0.010228732,0.000186208,0.00008902395,0.00015507557,0.000004925183,0.98051673,0.005253926,0.00017097025,0.00021216327,0.00047376723],"about_ca_topic_score_codex":0.00058690936,"about_ca_topic_score_gemma":0.007796594,"teacher_disagreement_score":0.763768,"about_ca_system_score_codex":0.00008485839,"about_ca_system_score_gemma":0.00020950468,"threshold_uncertainty_score":0.6589815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048089118,0.001182379,0.9965491,0.00024189144,0.00042788012,0.000499243,7.8690414e-7,0.0000984886,0.00051931414],"genre_scores_gemma":[0.857248,0.000024909637,0.14250879,0.000057889978,0.00007647845,0.000031810952,5.09494e-7,0.000025704521,0.000025907828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553925,0.000017830153,0.0005523951,0.00091922126,0.0023017982,0.00066951464],"domain_scores_gemma":[0.99709564,0.0010866553,0.00017035169,0.0010356023,0.0004989083,0.00011284985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015663803,0.0003471219,0.00034511051,0.00065583485,0.0001796327,0.0002390852,0.0044139093,0.0001655225,0.0000033746437],"category_scores_gemma":[0.00088345114,0.00026644682,0.000055443074,0.00084536587,0.00045199887,0.00024208793,0.0010291234,0.00072758197,0.000013083087],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003991341,0.00006207774,0.0028267459,0.000086798536,0.000011443321,0.00003743343,0.0024191893,0.15896575,0.00026229117,0.006190802,0.0000015996104,0.8291319],"study_design_scores_gemma":[0.0012460969,0.0005533428,0.0191304,0.0048505208,0.000008023236,0.00007491469,0.0000023360078,0.45375228,0.07591882,0.438454,0.0038241583,0.0021850835],"about_ca_topic_score_codex":0.000020017447,"about_ca_topic_score_gemma":0.0001465535,"teacher_disagreement_score":0.8567671,"about_ca_system_score_codex":0.0010233592,"about_ca_system_score_gemma":0.0028217968,"threshold_uncertainty_score":0.9999788},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007514054,0.0007520218,0.88369226,0.00027926263,0.0042345175,0.0003811162,0.00007516386,0.00022736423,0.10284422],"genre_scores_gemma":[0.9638268,0.000017131171,0.02531604,0.0006528566,0.004442143,0.000004621091,0.000039460432,0.000081107355,0.0056198877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985281,0.000010849385,0.00027780337,0.0004889556,0.00035193903,0.000342345],"domain_scores_gemma":[0.9992281,0.00011863089,0.00014004645,0.0003068271,0.00014240057,0.00006395348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013667709,0.00026732514,0.00026333288,0.0004083601,0.0005833384,0.00053726544,0.00037612187,0.000112684866,0.0007920282],"category_scores_gemma":[0.000020586898,0.00023446677,0.00008770378,0.000072342475,0.0009453479,0.00023103568,0.00016375609,0.00035131644,0.0000650368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017072494,0.00028163067,0.000102387654,0.00027693517,0.00008076008,0.00028147493,0.038084775,0.21008511,0.0058193854,0.22511217,0.002586064,0.51727223],"study_design_scores_gemma":[0.0007779846,0.00026254365,0.00024879837,0.0038231348,0.00013975787,0.00011900839,0.000024978035,0.66485137,0.0011099658,0.16550915,0.16034001,0.002793284],"about_ca_topic_score_codex":0.00022209377,"about_ca_topic_score_gemma":0.00067093805,"teacher_disagreement_score":0.9563127,"about_ca_system_score_codex":0.00014283138,"about_ca_system_score_gemma":0.0001517475,"threshold_uncertainty_score":0.95612776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008343577,0.00018144945,0.9888165,0.00022144492,0.0014289638,0.00057804433,0.00008670525,0.0002456481,0.007606893],"genre_scores_gemma":[0.37729266,0.000051629933,0.6193177,0.0014310976,0.0015602229,0.000034813766,0.000195798,0.00008172406,0.00003431863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99506503,0.000030075129,0.00045050326,0.00220707,0.0014991229,0.000748203],"domain_scores_gemma":[0.9972915,0.00024224959,0.00029097847,0.0016385232,0.0002824508,0.00025430767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044226993,0.0007228815,0.0005845653,0.0008236659,0.00044891314,0.00096673815,0.0041677016,0.00042513837,0.00013061418],"category_scores_gemma":[0.00002691773,0.0006106954,0.00015116899,0.00090437976,0.0009925326,0.0013855686,0.0011899327,0.001423617,0.000018292109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053832107,0.000047918384,0.00012842452,0.00003634118,0.00005573576,0.00015967534,0.0010052681,0.0028334383,0.000024756,0.94790995,0.00003336509,0.047711276],"study_design_scores_gemma":[0.00065141,0.00035943306,0.00030859857,0.0002460646,0.0000134852635,0.00013760632,2.7684646e-7,0.030219272,0.00043985754,0.96522707,0.0015258379,0.00087109394],"about_ca_topic_score_codex":0.0000339191,"about_ca_topic_score_gemma":0.00011220984,"teacher_disagreement_score":0.37645832,"about_ca_system_score_codex":0.00021836824,"about_ca_system_score_gemma":0.00078472745,"threshold_uncertainty_score":0.99963444},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010310152,0.0011419758,0.98752296,0.00057827553,0.0017893028,0.0003139622,0.0000062644717,0.00029907355,0.008337864],"genre_scores_gemma":[0.010072123,0.00013669116,0.9864645,0.0018711716,0.0006943219,0.000004891596,0.000017329197,0.00003762876,0.0007013665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995298,0.00003828472,0.00059653603,0.0019412487,0.0013184531,0.00080747844],"domain_scores_gemma":[0.9966585,0.0002938009,0.00034959507,0.0022086396,0.00021244731,0.00027699463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006720892,0.00065328483,0.0006390232,0.0008209649,0.00044832387,0.00086646463,0.005142064,0.00040219308,0.000034780263],"category_scores_gemma":[0.000042387546,0.0005532021,0.00015567444,0.00053225114,0.00041127307,0.0012358662,0.0027790586,0.0010740602,0.000077960845],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004038604,0.000027691394,0.0000031897678,0.000013336032,0.000003908305,0.00011471763,0.00026263893,0.025724402,0.00019969403,0.0085913865,0.000101893595,0.9649531],"study_design_scores_gemma":[0.00032668805,0.00018986045,0.00006317698,0.0009251575,0.0000061873648,0.00008829078,7.3732686e-8,0.8633338,0.001344491,0.11929137,0.0135665685,0.00086432515],"about_ca_topic_score_codex":0.000017405486,"about_ca_topic_score_gemma":0.000010114604,"teacher_disagreement_score":0.9640888,"about_ca_system_score_codex":0.00024742546,"about_ca_system_score_gemma":0.00038506553,"threshold_uncertainty_score":0.99969196},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051377937,0.00012626107,0.99270177,0.00067125796,0.00057566754,0.00021497879,0.0000038462867,0.000264654,0.00030376203],"genre_scores_gemma":[0.6590485,0.000007115143,0.339757,0.0010634664,0.00009077794,0.000014440211,0.0000011935263,0.000008121874,0.000009392271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983031,0.000021175525,0.0001864775,0.000625247,0.00038962945,0.00047434616],"domain_scores_gemma":[0.9985533,0.00037909002,0.00008372702,0.00079317135,0.00010545989,0.000085293075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031845007,0.00018325704,0.00017442109,0.00020865162,0.00019669737,0.000339618,0.0018659846,0.000058771646,0.000038914943],"category_scores_gemma":[0.00008387786,0.00014147254,0.000033735596,0.0015989756,0.00024304893,0.0007167568,0.0002899623,0.00014386715,0.000053129297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007977563,0.000097746735,0.0004715401,0.00002114681,0.000006633692,0.000030692256,0.0015009469,0.01275933,0.00029119186,0.0047344347,0.00034567894,0.9797327],"study_design_scores_gemma":[0.00037797893,0.00012674648,0.0006383374,0.000053019372,0.0000015364666,0.00003484273,6.528731e-7,0.98944765,0.002160652,0.00589476,0.0010282794,0.00023556336],"about_ca_topic_score_codex":0.0000050011427,"about_ca_topic_score_gemma":0.00001023178,"teacher_disagreement_score":0.97949713,"about_ca_system_score_codex":0.0000750068,"about_ca_system_score_gemma":0.00007268855,"threshold_uncertainty_score":0.5769083},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020983224,0.00072747294,0.97060025,0.000054668366,0.0004928456,0.00016852426,0.0000024437772,0.00026377154,0.025591701],"genre_scores_gemma":[0.60980403,0.00026195467,0.38972962,0.000038913215,0.00011625545,0.0000027321578,0.0000012325486,0.000028004655,0.000017255945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984019,0.0000027275469,0.00041148136,0.0004133587,0.00032957198,0.00044095409],"domain_scores_gemma":[0.9991952,0.00027294722,0.00004933128,0.0004061043,0.000032765172,0.000043652275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001807326,0.00027952698,0.0004113698,0.0003776924,0.000029199613,0.00003160159,0.00077994505,0.00031885292,0.0000145625845],"category_scores_gemma":[0.000060756473,0.00026121148,0.000044878372,0.0004367659,0.0006588188,0.00017704723,0.00020044723,0.0007835287,0.000005793046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023232633,0.0000033375543,0.00003340127,0.000019372983,0.000002023493,0.00001809222,0.00005359215,0.5571767,0.000033312714,0.015740806,5.2844155e-7,0.4269165],"study_design_scores_gemma":[0.00018466104,0.00008975881,0.0001185418,0.00093485124,0.000004191741,0.000012436598,6.358195e-7,0.7076955,0.001910128,0.2878913,0.0006193184,0.0005386865],"about_ca_topic_score_codex":0.0000029427786,"about_ca_topic_score_gemma":0.00008828742,"teacher_disagreement_score":0.6077057,"about_ca_system_score_codex":0.00024859342,"about_ca_system_score_gemma":0.000049922815,"threshold_uncertainty_score":0.999984},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011071341,0.0012409083,0.98635757,0.00047822887,0.00037578505,0.00025029268,0.00004185293,0.000008175949,0.00017583561],"genre_scores_gemma":[0.90593386,0.00025786448,0.091131836,0.0014836533,0.0005776312,0.0000068551394,0.00020153321,0.00003754745,0.00036919833],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804246,0.000021662516,0.00031281245,0.0010059782,0.00028235913,0.00033473317],"domain_scores_gemma":[0.9985405,0.000020803469,0.0001578151,0.0011599618,0.00006646293,0.00005443463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048364376,0.00026346688,0.0001875809,0.00020944656,0.00016301015,0.00009966677,0.0014574272,0.00027709128,0.0000060329617],"category_scores_gemma":[0.000029291641,0.00021312096,0.00004782585,0.00016832865,0.00027965163,0.000020341293,0.00043653246,0.00033893032,0.0000017749272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000137742945,0.0000135865275,0.00003211393,0.00000812476,0.0000048518023,9.806838e-7,0.00012136023,0.4264007,0.56052923,0.00006557031,0.000021037666,0.01278869],"study_design_scores_gemma":[0.00047450824,0.00004011058,0.00041058805,0.00014628706,0.000016066615,0.000015699736,0.0000010842806,0.95398206,0.03594565,0.0011774964,0.0072979033,0.0004925257],"about_ca_topic_score_codex":0.0000217172,"about_ca_topic_score_gemma":0.00023271311,"teacher_disagreement_score":0.89522576,"about_ca_system_score_codex":0.00013171622,"about_ca_system_score_gemma":0.00041105621,"threshold_uncertainty_score":0.86908203},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012437972,0.00042126465,0.9940536,0.00016355835,0.003291371,0.00081295095,0.00002283297,0.0010701696,0.000039883536],"genre_scores_gemma":[0.0022464602,0.00005216948,0.99573517,0.0008453873,0.0007971702,0.00009215183,0.000033342847,0.00009082156,0.000107345986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99390364,0.00010853925,0.00078088074,0.0031092977,0.0010357372,0.0010619133],"domain_scores_gemma":[0.99183154,0.0032736885,0.0005234018,0.0035238117,0.00048309547,0.00036446744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010964476,0.0009386711,0.00093290646,0.0008539206,0.0005360514,0.00058460765,0.005201614,0.00071085605,0.0000064492788],"category_scores_gemma":[0.0028386936,0.0008798049,0.00021749032,0.00071219896,0.0010087095,0.0019250609,0.0008675786,0.0014492525,0.0000056816325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016769816,0.000027221327,0.000011658358,0.000027525677,0.000009077218,0.0003834147,0.0047280923,0.57332975,0.00007790656,0.0029952654,0.0000063972184,0.4183869],"study_design_scores_gemma":[0.00020213357,0.001020984,0.000065516695,0.00046653184,0.000007347593,0.0011600103,0.0000011714443,0.04254166,0.0023233062,0.94933176,0.0013491305,0.0015304405],"about_ca_topic_score_codex":0.000006504897,"about_ca_topic_score_gemma":0.000016894617,"teacher_disagreement_score":0.9463365,"about_ca_system_score_codex":0.00038886565,"about_ca_system_score_gemma":0.00065669446,"threshold_uncertainty_score":0.99936527},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007561037,0.0009243769,0.993982,0.0017667694,0.0001752256,0.0029271403,0.0000054566995,0.00004589832,0.00009750058],"genre_scores_gemma":[0.08073403,0.00012558988,0.9182775,0.000275364,0.00014734863,0.0003719791,0.0000011593132,0.000014362872,0.000052688996],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984022,0.00002929532,0.00033994537,0.000502355,0.00041759096,0.00030861213],"domain_scores_gemma":[0.99022216,0.008739161,0.00024946034,0.00043339527,0.00030613496,0.000049663446],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0024554639,0.000171037,0.00021761419,0.0001830438,0.0016596706,0.00007457653,0.0013474795,0.00022386052,0.0000013291259],"category_scores_gemma":[0.0012047677,0.00010902497,0.000048565755,0.00046318266,0.0038788852,0.00008234882,0.00020922296,0.00026890085,4.5295113e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016654811,0.0000072975995,0.000092676724,0.000023408196,0.000011174649,5.816602e-8,0.0072248224,0.0010938141,0.000013441306,0.0064403233,0.000023843419,0.9850675],"study_design_scores_gemma":[0.0011266917,0.0005447426,0.0016975874,0.000398789,0.00013446168,0.0000149261095,0.00012924142,0.14606255,0.0064715142,0.53743225,0.30455306,0.0014341894],"about_ca_topic_score_codex":0.00003922832,"about_ca_topic_score_gemma":0.00042749298,"teacher_disagreement_score":0.9836333,"about_ca_system_score_codex":0.00014221056,"about_ca_system_score_gemma":0.0010444063,"threshold_uncertainty_score":0.99964005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014609206,0.00017574689,0.9967482,0.0001771692,0.0009965242,0.0006606542,0.0000037449522,0.00041738222,0.00067450065],"genre_scores_gemma":[0.1359307,0.0000033315039,0.863272,0.00024768568,0.00037207353,0.000010164922,0.0000051049046,0.000050451654,0.0001084819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99386764,0.000106784835,0.00072593644,0.0021092577,0.0019517695,0.0012386387],"domain_scores_gemma":[0.9967433,0.00037162626,0.0003691446,0.0019355782,0.00028284235,0.0002975003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010505826,0.0007570047,0.0007573532,0.0018385355,0.00045345945,0.00088278635,0.003999978,0.00040861694,0.000012172476],"category_scores_gemma":[0.00013481015,0.00073059544,0.00021120762,0.001172006,0.0006081747,0.0008431994,0.0020420866,0.0012847098,0.000017877557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046276677,0.00005019593,0.000003998392,0.000111671856,0.000008785159,0.000060944094,0.00014743791,0.36243185,0.00047936596,0.0015693774,9.296746e-7,0.6351308],"study_design_scores_gemma":[0.00041634584,0.00016676163,0.00006450988,0.00058250857,0.000009217368,0.00014192457,1.7764332e-7,0.96631175,0.0004563673,0.03110557,0.00001791899,0.0007269481],"about_ca_topic_score_codex":0.000036655554,"about_ca_topic_score_gemma":0.000014325565,"teacher_disagreement_score":0.6344039,"about_ca_system_score_codex":0.0018987531,"about_ca_system_score_gemma":0.0009012739,"threshold_uncertainty_score":0.9995145},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50442415,0.000020029333,0.49485594,0.00014986495,0.00026726443,0.00016386162,0.00000493883,0.00011094895,0.0000029953485],"genre_scores_gemma":[0.95088524,0.0000039417173,0.0451733,0.0037636168,0.00014930684,0.000007983481,0.0000031306647,0.000013035402,4.6418123e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976572,0.00018025974,0.00031530703,0.00065136986,0.0006615957,0.00053429103],"domain_scores_gemma":[0.99910724,0.0002465064,0.00014389341,0.00030274777,0.00008828756,0.000111342524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003610198,0.00020329408,0.00015874652,0.0007133151,0.0003713153,0.00024861135,0.0004952813,0.000047642276,0.000021054495],"category_scores_gemma":[0.00053481595,0.00018662443,0.000042191412,0.003381798,0.00018441597,0.00070687034,0.00021450214,0.00015722736,0.000029190358],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030701815,0.000058416164,0.0028960945,0.000009352899,6.158095e-7,0.000005754253,0.0004915202,0.38763836,0.597442,0.000009047072,0.0000055757623,0.011440215],"study_design_scores_gemma":[0.00019690635,0.000018526589,0.0050576697,0.000014734584,0.0000021162923,0.0000066396196,0.0000011293592,0.5247242,0.46964052,0.00022609804,0.0000019744032,0.00010949072],"about_ca_topic_score_codex":0.000008142289,"about_ca_topic_score_gemma":0.0000115849525,"teacher_disagreement_score":0.44968262,"about_ca_system_score_codex":0.00023556,"about_ca_system_score_gemma":0.00012933592,"threshold_uncertainty_score":0.7610323},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033454728,0.00008199573,0.9918225,0.00056644855,0.0014778449,0.005157889,0.000053065258,0.0002174054,0.00028830502],"genre_scores_gemma":[0.016875947,0.000008787803,0.9809749,0.0009113203,0.0006819211,0.00044722576,0.000049872935,0.00003786469,0.000012150093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952849,0.000044456534,0.00067246205,0.0018173119,0.001433857,0.00074697984],"domain_scores_gemma":[0.99656194,0.00031888852,0.00048642277,0.0019657619,0.00038294093,0.00028402195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000903026,0.0006785303,0.00056222844,0.0009243557,0.0006455337,0.0008249454,0.0034924163,0.0005371382,0.00007443622],"category_scores_gemma":[0.000066484594,0.0006435225,0.00023390769,0.00074386,0.00084719405,0.0011271988,0.0018292844,0.0016471732,0.000035458943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015780878,0.0017706207,0.0011735255,0.0011331951,0.00025639182,0.00061340816,0.008372486,0.096902266,0.012149473,0.65036213,0.00020770688,0.22690096],"study_design_scores_gemma":[0.0009105627,0.00030219494,0.0004596001,0.001010835,0.000015980762,0.00024172539,3.1240165e-7,0.6842503,0.0026152977,0.27976373,0.029044345,0.0013851325],"about_ca_topic_score_codex":0.00006261855,"about_ca_topic_score_gemma":0.0002862599,"teacher_disagreement_score":0.58734804,"about_ca_system_score_codex":0.00040610094,"about_ca_system_score_gemma":0.0006086844,"threshold_uncertainty_score":0.9996016},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014771352,0.0009414441,0.9959471,0.0006748032,0.00040338052,0.00063913927,0.00004187228,0.0001486213,0.0010559235],"genre_scores_gemma":[0.70451087,0.000027508902,0.29495564,0.00012824705,0.00015595731,0.00002048009,0.000018939361,0.000018639408,0.00016369736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969765,0.000045242406,0.0006446299,0.0013123595,0.00047875085,0.0005425364],"domain_scores_gemma":[0.9968871,0.00080150133,0.00054057443,0.0013169964,0.00030004192,0.00015382645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012863933,0.00045519718,0.00091961096,0.0012717128,0.00028767553,0.0003501154,0.0024740642,0.00028295664,9.677142e-7],"category_scores_gemma":[0.000031361622,0.00041330408,0.0002150576,0.001511129,0.00034163994,0.00033725522,0.00041967854,0.0003369005,0.0000016962912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001409244,0.00003819361,0.0007279522,0.00034930624,0.00032561665,0.000004094114,0.0008049169,0.60337836,0.00012574905,0.08524616,0.000108782784,0.30887678],"study_design_scores_gemma":[0.00022666683,0.00012888158,0.0021092168,0.00038677678,0.000158372,0.000041399897,2.6215707e-7,0.9925834,0.00019801568,0.0023213162,0.0013820544,0.00046364468],"about_ca_topic_score_codex":0.000008411595,"about_ca_topic_score_gemma":0.000011088318,"teacher_disagreement_score":0.70436317,"about_ca_system_score_codex":0.00021156746,"about_ca_system_score_gemma":0.00035438308,"threshold_uncertainty_score":0.99983186},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004384997,0.00014455557,0.99149704,0.003450919,0.0022687088,0.0008626941,0.00002858648,0.00011319914,0.0016299319],"genre_scores_gemma":[0.09850971,0.00006455194,0.8940112,0.006556174,0.00038571373,0.00009280684,0.000026581294,0.000046864014,0.00030639386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733806,0.00003674992,0.00042307356,0.0010696301,0.0006202183,0.00051225047],"domain_scores_gemma":[0.99697167,0.0014766657,0.00028740297,0.000885166,0.000254948,0.00012414745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065678824,0.0004206907,0.00034796252,0.0003955731,0.00055385585,0.00068809686,0.0014657169,0.00019416866,0.00008594118],"category_scores_gemma":[0.0001668198,0.00031086148,0.00018947771,0.0003190922,0.0009765932,0.00027965198,0.00024116093,0.00048199072,0.00000870534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061662163,0.000017449378,0.00002193317,0.000018022216,0.000019136363,0.000009666216,0.0003151328,0.03968293,0.00001970096,0.15006153,0.00007750299,0.80975085],"study_design_scores_gemma":[0.00044681772,0.00011205752,0.0001292841,0.00022116702,0.000017375445,0.000035069825,7.6941393e-7,0.9193394,0.0005288372,0.071797885,0.006844139,0.0005271912],"about_ca_topic_score_codex":0.0000060628527,"about_ca_topic_score_gemma":0.00009071214,"teacher_disagreement_score":0.8796565,"about_ca_system_score_codex":0.0003327727,"about_ca_system_score_gemma":0.0007105067,"threshold_uncertainty_score":0.9999344},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021095793,0.0016266742,0.9896257,0.0008541882,0.0020695354,0.000608993,0.000008194575,0.0003864775,0.0047991513],"genre_scores_gemma":[0.0713666,0.000072567236,0.91851074,0.0018157886,0.0018645363,0.000031602023,0.000022029799,0.0001200715,0.0061960593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947088,0.000061478415,0.0008782159,0.0021173144,0.0012006453,0.0010335788],"domain_scores_gemma":[0.99638885,0.0010255158,0.00050121546,0.0014868587,0.0003602707,0.00023728525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019300575,0.0007388076,0.00086266635,0.0013204201,0.0003981515,0.0008211088,0.0052526114,0.00042727694,0.000042822565],"category_scores_gemma":[0.00028101707,0.0007048668,0.0002876729,0.00069668505,0.00036818534,0.00081391307,0.0020860136,0.001219671,0.00017446224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009678286,0.000019683477,0.000019080348,0.00004398709,0.00001634515,0.00003672124,0.00048217774,0.24298392,0.00012087485,0.004414403,0.000058267968,0.7517949],"study_design_scores_gemma":[0.0003799011,0.00023303085,0.000005335095,0.00048595972,0.000008343799,0.00013757082,5.0194416e-8,0.9535952,0.00028378016,0.01847762,0.025659379,0.00073378347],"about_ca_topic_score_codex":0.000014222413,"about_ca_topic_score_gemma":0.000030297206,"teacher_disagreement_score":0.7510611,"about_ca_system_score_codex":0.0006062423,"about_ca_system_score_gemma":0.0004843007,"threshold_uncertainty_score":0.99954027},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050053117,0.00054863864,0.9739966,0.0017564308,0.0037956187,0.0007784477,0.000051049756,0.00055854896,0.018464644],"genre_scores_gemma":[0.07006395,0.00006567637,0.91967547,0.0030513834,0.0032220625,0.00001593098,0.00011544952,0.00012403239,0.0036660645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99236745,0.000049466737,0.00090551097,0.00376223,0.0017188395,0.001196535],"domain_scores_gemma":[0.99169385,0.001088931,0.00043512453,0.006065665,0.00038755048,0.000328893],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018317098,0.00091564975,0.00087058,0.0010460286,0.00053432945,0.0012764969,0.010447732,0.00046705516,0.00016472703],"category_scores_gemma":[0.0001980302,0.0008378815,0.00016462425,0.0010649147,0.00080896565,0.0015320844,0.0059796805,0.0016451299,0.0006799629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072235857,0.00015750852,0.000026235542,0.00003707119,0.000021721202,0.00007735815,0.00012426804,0.20775726,0.000018099265,0.006347867,0.00041885822,0.7850065],"study_design_scores_gemma":[0.00031966827,0.00032165583,0.00030096158,0.0002655723,0.000015776259,0.000102974074,1.6133703e-7,0.9078076,0.00014539297,0.059516918,0.030162059,0.0010412452],"about_ca_topic_score_codex":0.000092031194,"about_ca_topic_score_gemma":0.0002477742,"teacher_disagreement_score":0.7839653,"about_ca_system_score_codex":0.0006492065,"about_ca_system_score_gemma":0.0012413962,"threshold_uncertainty_score":0.99976027},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014391526,0.00027871208,0.99252695,0.00021131725,0.0022532048,0.00027513757,0.0000058849614,0.0001650834,0.0028445486],"genre_scores_gemma":[0.5053083,0.000014859887,0.49385014,0.00039119393,0.0003659201,0.000001564892,0.0000017796153,0.000024267101,0.00004197902],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965629,0.000049982045,0.0006990932,0.0013019961,0.00076741324,0.00061860407],"domain_scores_gemma":[0.99637395,0.0009996501,0.0005310967,0.0016924437,0.00023313497,0.00016974515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015380991,0.0005081729,0.00069698476,0.0011299684,0.00027181776,0.00029076854,0.004308979,0.0004028034,0.000027763588],"category_scores_gemma":[0.00014101031,0.00047502015,0.0002627997,0.0006838102,0.0013620927,0.00037967006,0.0017786411,0.0010434743,0.000020463496],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011556753,0.00005032339,0.000190551,0.000055722492,0.000019378978,0.000040364423,0.0012688906,0.0042994767,0.006931606,0.12511778,0.0000058438427,0.8620085],"study_design_scores_gemma":[0.0006733619,0.0003677569,0.00050059205,0.0009966618,0.000023177718,0.000120334655,4.738478e-7,0.22882804,0.053464282,0.71073467,0.00276675,0.0015238868],"about_ca_topic_score_codex":0.00002128023,"about_ca_topic_score_gemma":0.00005431178,"teacher_disagreement_score":0.8604846,"about_ca_system_score_codex":0.000059202874,"about_ca_system_score_gemma":0.00036218253,"threshold_uncertainty_score":0.99977016},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022895598,0.00015013768,0.9919831,0.0027857837,0.00097436295,0.00022548673,0.0000034894288,0.00026828455,0.003380385],"genre_scores_gemma":[0.45214978,0.00041906012,0.5354582,0.009760205,0.0014766768,0.000023629145,0.000078553,0.00006654896,0.0005673375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970755,0.000055013235,0.00052965526,0.00079028297,0.000998697,0.00055083],"domain_scores_gemma":[0.997373,0.00041103005,0.00051035476,0.0013281187,0.0002593973,0.00011813123],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001129749,0.00042247743,0.00036997063,0.0009215841,0.00057427346,0.0017162057,0.0030378723,0.00021736335,0.000021697033],"category_scores_gemma":[0.000134807,0.00032512646,0.00013438692,0.001602179,0.00024724458,0.0023529434,0.00091970264,0.00072680105,0.00019741812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042835936,0.000029734712,0.00008811089,0.00005471668,0.00007149688,0.000040349674,0.013507037,0.021942949,0.0001858569,0.032174293,0.00022933642,0.93167186],"study_design_scores_gemma":[0.00020663635,0.00010277887,0.00022370348,0.00037308916,0.000035139547,0.000088141795,0.0000021633482,0.9574192,0.00039289315,0.029111663,0.011330621,0.0007139696],"about_ca_topic_score_codex":0.000035143912,"about_ca_topic_score_gemma":0.0000131836305,"teacher_disagreement_score":0.93547624,"about_ca_system_score_codex":0.00017824773,"about_ca_system_score_gemma":0.00021552255,"threshold_uncertainty_score":0.99992007},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029670622,0.0010393887,0.9729764,0.0061940057,0.0008555546,0.0018817981,0.000052160696,0.00009460769,0.013939062],"genre_scores_gemma":[0.9111071,0.00067552045,0.08135797,0.004746122,0.0007602691,0.000030605475,0.000041895786,0.000041348852,0.0012391611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977812,0.000070947266,0.00043759742,0.0004673968,0.00053440715,0.00070843304],"domain_scores_gemma":[0.9984853,0.00056004355,0.00016214998,0.00044983008,0.00022558837,0.000117046926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011559838,0.0003059685,0.00055865524,0.00047131264,0.0006698193,0.00090089743,0.003590239,0.0002882408,0.000041161533],"category_scores_gemma":[0.00013735972,0.00028094745,0.00009665382,0.00031828886,0.00080269255,0.0006689343,0.0006916362,0.0005094169,0.0000028818988],"study_design_candidate":"design_other","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.00006422889,0.00008924114,0.0005137978,0.000022056873,0.000012805781,0.000010288749,0.01610854,0.09456459,0.0000042196866,0.07948525,0.000017872499,0.8091071],"study_design_scores_gemma":[0.0014557379,0.000118304015,0.00026218576,0.0007124699,0.000020049396,0.000002529881,0.00006921583,0.49219784,0.000013202215,0.48403588,0.020271022,0.00084156956],"about_ca_topic_score_codex":0.011799549,"about_ca_topic_score_gemma":0.10550169,"teacher_disagreement_score":0.90814006,"about_ca_system_score_codex":0.0003106027,"about_ca_system_score_gemma":0.00075174356,"threshold_uncertainty_score":0.9999643},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021582952,0.00037717063,0.9961744,0.0003993969,0.0004087329,0.00024583482,0.0000039165097,0.0001367339,0.0020379964],"genre_scores_gemma":[0.032732926,0.00005291292,0.9654682,0.00042605112,0.0005395747,0.0000061156516,0.000004859879,0.00004138751,0.00072796096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966192,0.000010593498,0.00035361137,0.0011947827,0.0010487284,0.00077307585],"domain_scores_gemma":[0.9984876,0.00015813246,0.00009476778,0.0009795876,0.00004711831,0.00023280423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043484016,0.0004261944,0.00037200304,0.00039530822,0.00016649463,0.00033772082,0.0026690196,0.00024497503,0.000067774],"category_scores_gemma":[0.000020801004,0.00038919284,0.000120154014,0.00038416777,0.00046840616,0.00046263167,0.0019074141,0.00085269264,0.00007866568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002756044,0.000029075785,0.00001586111,0.00004468491,0.000007544175,0.000051940668,0.00018122503,0.43412602,0.0036519556,0.0011464519,0.000017378792,0.5607251],"study_design_scores_gemma":[0.00018016061,0.000053347638,0.000023300727,0.0002221327,0.0000030992474,0.00005931377,3.005922e-8,0.9732659,0.0041659772,0.018814676,0.0027178281,0.0004942312],"about_ca_topic_score_codex":0.000020062686,"about_ca_topic_score_gemma":0.000011812243,"teacher_disagreement_score":0.5602309,"about_ca_system_score_codex":0.00060662173,"about_ca_system_score_gemma":0.00020229301,"threshold_uncertainty_score":0.999856},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007763522,0.00045536665,0.9847619,0.00061514776,0.001647477,0.0003083773,0.000005968148,0.00045533574,0.011672825],"genre_scores_gemma":[0.37267327,0.000046295907,0.6241648,0.0013588627,0.00049319555,0.000012132016,0.000007130909,0.000059805156,0.0011844783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99412245,0.00005224802,0.0007723072,0.0023281798,0.0016810978,0.0010436998],"domain_scores_gemma":[0.9965223,0.00041118052,0.00036930304,0.0020522112,0.00034945435,0.000295567],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010188733,0.00079019344,0.0007365803,0.0009116805,0.0004102774,0.0010476409,0.0053672898,0.0005461817,0.000036756224],"category_scores_gemma":[0.000079148354,0.0007701378,0.00018956391,0.0007408664,0.0007710079,0.0009404115,0.0014732667,0.0015142496,0.00022044186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008164859,0.00009745424,0.0001039866,0.00007728442,0.000022318969,0.00035188522,0.00045069927,0.1237753,0.0003161356,0.11748312,0.00023690367,0.75707674],"study_design_scores_gemma":[0.00019402453,0.000114637776,0.00010396085,0.00047455553,0.000009625695,0.000079090845,3.0652515e-8,0.6702002,0.001308229,0.3261158,0.00049804174,0.0009018069],"about_ca_topic_score_codex":0.000096131385,"about_ca_topic_score_gemma":0.000072280425,"teacher_disagreement_score":0.7561749,"about_ca_system_score_codex":0.00036337797,"about_ca_system_score_gemma":0.0009899843,"threshold_uncertainty_score":0.9999894},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010523072,0.015013016,0.98134464,0.00010221579,0.00075546553,0.00069730513,0.0000021372744,0.000105389176,0.0009275347],"genre_scores_gemma":[0.78436327,0.003069273,0.21146086,0.00054868107,0.0003934621,0.000037809896,0.000003448995,0.00005125047,0.000071952985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536353,0.00006235728,0.00090869504,0.0018357874,0.0008696406,0.0009600153],"domain_scores_gemma":[0.9970309,0.0005758935,0.00047789497,0.0015371141,0.00017824315,0.00019996923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014030862,0.000625183,0.00087458605,0.0010418268,0.00014900936,0.00032044746,0.0030409868,0.0005509302,0.0000093885965],"category_scores_gemma":[0.000025094325,0.00061386067,0.00014514837,0.0010396418,0.0008807061,0.0009150258,0.0021383623,0.001331427,0.0000028070688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033310132,0.000016668564,0.00014736595,0.000014195942,0.0000048815346,0.000020084326,0.00031705064,0.47607186,0.000006065161,0.005546596,0.0000018319352,0.51785004],"study_design_scores_gemma":[0.0003210918,0.00016527854,0.00024010187,0.0006483483,0.0000062567433,0.000045346802,2.1404449e-7,0.9400392,0.00003324422,0.05755449,0.00039399954,0.0005524006],"about_ca_topic_score_codex":0.000019489325,"about_ca_topic_score_gemma":0.0003108087,"teacher_disagreement_score":0.78331095,"about_ca_system_score_codex":0.00017628902,"about_ca_system_score_gemma":0.0002556268,"threshold_uncertainty_score":0.9996313},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010981368,0.00080013584,0.9954755,0.00017693196,0.0003054371,0.00023444572,0.00003794759,0.000030763167,0.0018407346],"genre_scores_gemma":[0.26787812,0.0018777122,0.6985573,0.0026954203,0.0039936616,0.00005380906,0.002584528,0.00030836056,0.022051077],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978966,0.00002725612,0.0002649272,0.0011516234,0.0003813246,0.00027826143],"domain_scores_gemma":[0.9980876,0.00002000575,0.00018911355,0.001502521,0.00010694506,0.000093804236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002234023,0.00031558974,0.0002562194,0.00015621612,0.00014048968,0.000084766914,0.0013415819,0.00025775292,0.000056879442],"category_scores_gemma":[0.000032319764,0.00025142627,0.00004192106,0.00010441262,0.00041624205,0.000026703818,0.0013345473,0.00022455696,0.000036453486],"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.00015307734,0.000026920196,0.000026908812,0.00002936703,0.000018629771,0.000025481782,0.00015529871,0.012012532,0.8741997,0.00000428878,0.0019366355,0.111411184],"study_design_scores_gemma":[0.0007271306,0.0007945025,0.000092097645,0.00085954834,0.000021613583,0.00021727003,6.8084563e-7,0.05421012,0.8717813,0.00028259945,0.06978771,0.0012254546],"about_ca_topic_score_codex":0.0000025756547,"about_ca_topic_score_gemma":0.0000122275715,"teacher_disagreement_score":0.29691815,"about_ca_system_score_codex":0.000042258507,"about_ca_system_score_gemma":0.0002834589,"threshold_uncertainty_score":0.9999938},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013030091,0.00036671254,0.991647,0.00065842894,0.00072910823,0.0003092011,0.000034927856,0.00017154515,0.004780078],"genre_scores_gemma":[0.28348354,0.00006351069,0.7113037,0.0036021406,0.00048427176,0.00000772666,0.000023215836,0.000066688575,0.00096519146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661016,0.000050792536,0.00057204557,0.0011554407,0.0010490279,0.0005625022],"domain_scores_gemma":[0.9964454,0.00046600957,0.00021741445,0.0024937792,0.0002313172,0.00014608995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012973493,0.00045192652,0.0005465496,0.00084372616,0.00021570337,0.00027708133,0.0044483794,0.00019916399,0.00003997441],"category_scores_gemma":[0.00012641557,0.00039553674,0.00014139964,0.00058381073,0.0013711966,0.00039733746,0.0014232541,0.00061001955,0.0000313607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012039809,0.00008915106,0.000019485524,0.000056335084,0.000019855928,0.00013860576,0.0012425819,0.033597693,0.0006981783,0.51601005,0.00007669743,0.44803932],"study_design_scores_gemma":[0.00055392884,0.00045896665,0.00054370257,0.0006820446,0.000010127093,0.00006567129,9.961686e-7,0.3515376,0.020215787,0.6242055,0.0008077943,0.0009178631],"about_ca_topic_score_codex":0.00007798634,"about_ca_topic_score_gemma":0.00024283625,"teacher_disagreement_score":0.44712144,"about_ca_system_score_codex":0.00016866147,"about_ca_system_score_gemma":0.0003097199,"threshold_uncertainty_score":0.9998497},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021535637,0.0001377624,0.9555933,0.0018041446,0.00048291168,0.00081522117,0.000055065142,0.000045630935,0.019530313],"genre_scores_gemma":[0.98908126,0.0000027263886,0.009177984,0.0003811147,0.00023220136,0.000031549556,0.00003728411,0.000018270935,0.0010376133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812263,0.000010808734,0.00029053004,0.00075732905,0.00043833067,0.00038037484],"domain_scores_gemma":[0.99911296,0.00020848495,0.0001447533,0.00037493007,0.0000657769,0.000093078546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002701988,0.00026439683,0.0002690168,0.00025851466,0.00019277737,0.00012462697,0.00062589714,0.00012988453,0.00043535625],"category_scores_gemma":[0.000004970802,0.00025401328,0.00006824949,0.0004677047,0.00038860014,0.00018407102,0.00017594322,0.0005220227,0.00012054282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003067574,0.00022929435,0.010264005,0.000008809198,0.000014729498,0.000014725918,0.00050367514,0.32927334,0.000701187,0.06761326,0.00088201097,0.5904643],"study_design_scores_gemma":[0.0005203683,0.00012907185,0.002298822,0.00021656558,0.0000119428305,0.0000058997166,6.0649376e-7,0.5526981,0.00046548762,0.43287665,0.010050564,0.0007259236],"about_ca_topic_score_codex":0.00023972326,"about_ca_topic_score_gemma":0.00034799034,"teacher_disagreement_score":0.9675456,"about_ca_system_score_codex":0.00013228142,"about_ca_system_score_gemma":0.00039562007,"threshold_uncertainty_score":0.99999124},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031704254,0.00035790057,0.997023,0.00017973634,0.00080385286,0.00069503114,0.000026327858,0.00026262386,0.0006198317],"genre_scores_gemma":[0.063108966,0.000023162016,0.93586665,0.00013376056,0.0006889876,0.000023701945,0.00001463405,0.00008139243,0.00005875842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811757,0.000014550794,0.00044323673,0.0005330744,0.00042384412,0.00046775152],"domain_scores_gemma":[0.9981773,0.001009225,0.000121204925,0.00050780404,0.00010696871,0.000077501354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093727454,0.0003677181,0.00045020442,0.00023789525,0.00022188181,0.00023793105,0.0009987969,0.00025633996,0.000010644532],"category_scores_gemma":[0.00006290367,0.00030210786,0.00009756332,0.00029067593,0.00025311238,0.00013466319,0.00022611152,0.0006641922,0.0000068246327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.986336e-7,0.0000016302334,0.00008794546,0.000055340384,0.000014422631,0.0000010395972,0.00039053516,0.76559013,0.000014889024,0.00026641667,0.000009261292,0.2335675],"study_design_scores_gemma":[0.00022768645,0.000048294467,0.00011152732,0.0002824908,0.000024341864,0.000005254345,2.679785e-7,0.9812844,0.00087954244,0.015211033,0.0015502869,0.0003748741],"about_ca_topic_score_codex":0.000008605766,"about_ca_topic_score_gemma":0.000007788197,"teacher_disagreement_score":0.23319264,"about_ca_system_score_codex":0.00037076147,"about_ca_system_score_gemma":0.00014811418,"threshold_uncertainty_score":0.9999431},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031482094,0.0008646542,0.9954064,0.00023467139,0.0007759277,0.00038050747,0.000009331059,0.0003065723,0.0017071175],"genre_scores_gemma":[0.38855463,0.0002525655,0.6100654,0.0006113487,0.00035659713,0.000007334318,0.000009598711,0.000040695788,0.00010178534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960928,0.00005253945,0.00086299924,0.0014029399,0.0010108968,0.00057780545],"domain_scores_gemma":[0.9972511,0.00032367217,0.00055000983,0.0014135736,0.000313148,0.00014850173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010687439,0.0005275984,0.0006571332,0.0012888927,0.00022567353,0.00037897268,0.0030332885,0.00034529206,0.000013618538],"category_scores_gemma":[0.00003448288,0.00049738406,0.00020206619,0.0009634002,0.00057291857,0.000852222,0.0012537478,0.0006539103,0.000005161228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012011433,0.000076291384,0.00015659933,0.00014660323,0.000032167838,0.00003560062,0.0019127909,0.055077594,0.0007773225,0.34867635,0.00005456329,0.5930421],"study_design_scores_gemma":[0.00016538874,0.00020328243,0.00033840764,0.00057529536,0.00000839998,0.000026631118,1.19754e-7,0.9053901,0.0036574246,0.08808896,0.0009439355,0.0006020643],"about_ca_topic_score_codex":0.00004162075,"about_ca_topic_score_gemma":0.000050232044,"teacher_disagreement_score":0.8503125,"about_ca_system_score_codex":0.00015921389,"about_ca_system_score_gemma":0.0003774588,"threshold_uncertainty_score":0.99974775},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002328395,0.00029062276,0.9908384,0.00041451686,0.00037990813,0.00032413166,0.000006756857,0.00013840145,0.0073743975],"genre_scores_gemma":[0.21372563,0.00007164896,0.7834462,0.0012825594,0.00024807642,0.00002521811,0.000028888779,0.000048194248,0.0011236089],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771833,0.000030263012,0.00041629013,0.0009314644,0.00061190425,0.00029172172],"domain_scores_gemma":[0.9978211,0.0002914519,0.00031712206,0.0012710453,0.00021660878,0.00008265109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034145315,0.00027663657,0.00038909834,0.00046476812,0.00012955988,0.000116031326,0.0015868279,0.00018189421,0.00002269099],"category_scores_gemma":[0.00006608806,0.00025980975,0.000111569956,0.0006658826,0.0004426653,0.00032799173,0.00047670488,0.00032296515,0.000034000943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005293739,0.0001060042,0.00015865664,0.0000934759,0.00003773735,0.00007689958,0.002325383,0.01885628,0.0047694,0.23193906,0.00017015693,0.74146163],"study_design_scores_gemma":[0.00044869128,0.00016289648,0.00040218432,0.00030630213,0.000021723463,0.00009944905,0.000001299713,0.7736583,0.07868432,0.14190869,0.0034914033,0.0008147882],"about_ca_topic_score_codex":0.000029587047,"about_ca_topic_score_gemma":0.000016461927,"teacher_disagreement_score":0.754802,"about_ca_system_score_codex":0.000100177735,"about_ca_system_score_gemma":0.0002358627,"threshold_uncertainty_score":0.9999854},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021759872,0.00052060676,0.98272413,0.0005881402,0.0033617986,0.0004621158,0.0000032390726,0.000257396,0.0120607875],"genre_scores_gemma":[0.0050175106,0.000047121408,0.989687,0.004099805,0.00030797438,0.000015716165,0.000004847574,0.000039777082,0.00078023877],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99513537,0.00010447073,0.000728931,0.0019391654,0.0012313325,0.0008607398],"domain_scores_gemma":[0.99644274,0.00020989736,0.00046280396,0.0023629288,0.0002958957,0.00022572625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002153133,0.0006671693,0.0006253303,0.00089606125,0.00028253926,0.0005828478,0.00435538,0.00053958787,0.000046390986],"category_scores_gemma":[0.0002426708,0.00061027356,0.00019246087,0.0009245564,0.00092847855,0.0010636204,0.0011330553,0.0011434223,0.00014837492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009108877,0.00006569499,0.00014710144,0.00007335678,0.000017598946,0.00013696478,0.0006872838,0.0065075615,0.00017124842,0.4599443,0.00021351781,0.53202623],"study_design_scores_gemma":[0.00037071662,0.00030003328,0.00019344094,0.0003448815,0.000012139303,0.00025993618,2.071846e-7,0.46255574,0.0033637786,0.5099224,0.021169731,0.001506999],"about_ca_topic_score_codex":0.000021045465,"about_ca_topic_score_gemma":0.000022541746,"teacher_disagreement_score":0.53051925,"about_ca_system_score_codex":0.0005031488,"about_ca_system_score_gemma":0.0005838764,"threshold_uncertainty_score":0.99963486},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023600012,0.0015769931,0.97146225,0.0016175819,0.00036338883,0.0005044228,5.079134e-7,0.00007134828,0.0008034932],"genre_scores_gemma":[0.9321444,0.00006224876,0.066901825,0.000474139,0.00017738757,0.000010004134,8.1503384e-7,0.000018128589,0.00021106153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717325,0.00004505109,0.00053401105,0.0010073181,0.00071093143,0.0005294506],"domain_scores_gemma":[0.9985114,0.00025897613,0.00025414716,0.00086448935,0.000030482855,0.00008052828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011545502,0.00037657612,0.00044705122,0.00038996577,0.00016681489,0.00017307686,0.0020163367,0.00016795767,0.0000051340016],"category_scores_gemma":[0.000020813346,0.00027648726,0.00008149305,0.0002835091,0.0009095352,0.000050354487,0.0022461251,0.0006959976,0.0000045054153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029361893,0.000026089196,0.00011480842,0.000011158328,0.00000587221,0.000019374913,0.0015314352,0.42697504,0.0000039430297,0.0036536467,6.338449e-7,0.567655],"study_design_scores_gemma":[0.0003797626,0.0002707159,0.00050254556,0.00027095652,0.000006497414,0.000048707072,0.0000015927114,0.99239445,0.000016563987,0.004038952,0.0017356549,0.00033360583],"about_ca_topic_score_codex":0.000059900227,"about_ca_topic_score_gemma":0.00015640407,"teacher_disagreement_score":0.90854436,"about_ca_system_score_codex":0.00023253822,"about_ca_system_score_gemma":0.00012726847,"threshold_uncertainty_score":0.9999687},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38668287,0.0010026718,0.61199605,0.000032309654,0.000054705266,0.000107920256,0.000019858184,0.000008191089,0.000095412164],"genre_scores_gemma":[0.99209595,0.00039069494,0.0070631574,0.000107993474,0.000110712055,0.0000017391736,0.000076105636,0.000019047136,0.0001346213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822766,0.000023401723,0.00031667284,0.00085566,0.0002984974,0.00027810314],"domain_scores_gemma":[0.9990367,0.000020807569,0.00016992628,0.0005947129,0.000111158064,0.000066688495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028805502,0.0002754766,0.0004095856,0.0006788125,0.00007142898,0.000026543343,0.00032123903,0.0003030285,0.000008387735],"category_scores_gemma":[0.000016265385,0.00026585543,0.00019899815,0.0003822391,0.0002897518,0.0000042066,0.00017422668,0.00022635056,8.556537e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015525527,0.000013053838,0.00022158523,0.000007625129,0.00025247084,0.0000010827965,0.000032921995,0.9570365,0.02561514,0.000025092082,0.0000014998813,0.016777506],"study_design_scores_gemma":[0.000102433274,0.00019216533,0.00032992513,0.000033672357,0.00029614862,0.0000057679667,1.1929063e-7,0.9870342,0.011255078,0.00048324023,0.000052556657,0.00021469234],"about_ca_topic_score_codex":0.000008189763,"about_ca_topic_score_gemma":0.0002639566,"teacher_disagreement_score":0.6054131,"about_ca_system_score_codex":0.000106174615,"about_ca_system_score_gemma":0.00012865299,"threshold_uncertainty_score":0.9999794},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001008873,0.00053665164,0.96432954,0.000013793366,0.0006052741,0.00012361194,0.000002473845,0.0002322633,0.033147495],"genre_scores_gemma":[0.8926509,0.000052395546,0.10593388,0.00015779004,0.0008817696,0.0000043059545,0.000017851045,0.00008831423,0.00021275798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989577,0.000006080177,0.0002579488,0.00031338938,0.00021207695,0.00025281525],"domain_scores_gemma":[0.99951357,0.000059172995,0.000052218653,0.00023868504,0.00006854483,0.00006781168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000163498,0.00023909795,0.00021359176,0.0008247103,0.00014876446,0.00014253029,0.00030551993,0.00014659353,0.00009594155],"category_scores_gemma":[0.000010480083,0.0002476676,0.00006576385,0.00036174717,0.00014013803,0.00019044445,0.00006576992,0.00035102596,0.00003927711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.678322e-7,0.000009712405,0.00009006533,0.0001010895,0.000010364265,0.000017548571,0.0012490923,0.91757274,0.0007214893,0.003968609,0.000056254175,0.07620226],"study_design_scores_gemma":[0.00009231444,0.000016539389,0.0001631366,0.0005721842,0.0000071568065,0.000032209202,3.510029e-7,0.985155,0.00016009258,0.011141436,0.0023472868,0.00031229184],"about_ca_topic_score_codex":0.0000015037728,"about_ca_topic_score_gemma":0.000013123066,"teacher_disagreement_score":0.89164203,"about_ca_system_score_codex":0.0001178014,"about_ca_system_score_gemma":0.0000472115,"threshold_uncertainty_score":0.99999756},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001936749,0.002189432,0.9905494,0.005086866,0.00076745474,0.000793608,0.0000041390317,0.00018073102,0.00040900006],"genre_scores_gemma":[0.4531019,0.00007149103,0.544771,0.0016453102,0.0002478777,0.000027082622,0.000002749594,0.000023993043,0.00010856468],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972809,0.00004444236,0.0004223813,0.00079396606,0.0009539778,0.0005043355],"domain_scores_gemma":[0.9974873,0.00052205735,0.00025725106,0.0012826667,0.0003865366,0.00006419326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014380536,0.0003345384,0.000316106,0.00034509585,0.0004163994,0.00043394617,0.00526089,0.00020304088,0.0000029266653],"category_scores_gemma":[0.00021783076,0.00018404557,0.00011716997,0.00087864156,0.0007394992,0.00030505168,0.0007458571,0.00072099245,0.0000069413813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012353651,0.000011467129,0.0000054147285,0.000017836519,0.000009930086,0.000017498542,0.0013623394,0.0020346716,0.00041495354,0.28508565,0.000044777593,0.7109831],"study_design_scores_gemma":[0.0003418462,0.00047146354,0.000038403945,0.0009982641,0.000018737475,0.0000881692,6.386928e-7,0.0313084,0.051268432,0.9043682,0.010305573,0.0007918443],"about_ca_topic_score_codex":0.0000816364,"about_ca_topic_score_gemma":0.00030212564,"teacher_disagreement_score":0.71019125,"about_ca_system_score_codex":0.0003039362,"about_ca_system_score_gemma":0.0009816517,"threshold_uncertainty_score":0.977613},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000046237483,0.0011552342,0.9948885,0.0009883568,0.0014613762,0.0006212663,0.0000150496435,0.00019634028,0.0006692537],"genre_scores_gemma":[0.00073403574,0.000029673072,0.99556303,0.0011853651,0.0015377587,0.000009102019,0.000045047007,0.000030310262,0.00086567906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964975,0.0000130387325,0.0004632198,0.0015503771,0.0008693945,0.00060648407],"domain_scores_gemma":[0.997406,0.00024890088,0.00026737942,0.0016691342,0.00018418272,0.00022439114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060793274,0.0004941251,0.00047605275,0.0005056977,0.00030439737,0.00072507485,0.0030800954,0.0003340047,0.00001559588],"category_scores_gemma":[0.00006783994,0.00043543146,0.00015216849,0.0003720483,0.00018270724,0.00093262905,0.00081944064,0.00047803155,0.000026441845],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004170068,0.000013522967,0.0000011836155,0.000010897944,0.0000047235417,0.00003226802,0.0002975079,0.0029471137,0.00016688049,0.012419412,0.00031057926,0.98379177],"study_design_scores_gemma":[0.00036247837,0.00022582362,0.000030873514,0.00022312567,0.000007306054,0.000051305004,8.279003e-8,0.68040603,0.0014794258,0.3080358,0.008648378,0.00052936963],"about_ca_topic_score_codex":0.000060722363,"about_ca_topic_score_gemma":0.00008230853,"teacher_disagreement_score":0.98326236,"about_ca_system_score_codex":0.00018835287,"about_ca_system_score_gemma":0.000584448,"threshold_uncertainty_score":0.99980974},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023904755,0.00095414906,0.97541016,0.00062113465,0.0018346972,0.00026757718,0.0000016056111,0.00008722064,0.020799562],"genre_scores_gemma":[0.08692986,0.0001690499,0.90980756,0.002048471,0.0006585866,0.0000021363865,0.0000036718304,0.000041063613,0.00033963277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633145,0.00003329286,0.00069059094,0.0010354414,0.0011736336,0.00073561515],"domain_scores_gemma":[0.9965586,0.0010107766,0.00042701425,0.0016201697,0.00025557214,0.00012786151],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022242344,0.00041622864,0.00048143053,0.0004544334,0.00046099618,0.00041443622,0.004654299,0.00025297736,0.000005551141],"category_scores_gemma":[0.00007332849,0.0002834014,0.0001775872,0.0006700011,0.0012198469,0.00024314488,0.0015315057,0.00075821194,0.000041433894],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003447624,0.0000139066005,0.00004095446,0.000016939546,0.00000670608,0.00005078577,0.00028191012,0.0068222308,0.000016510116,0.056217246,0.00006835295,0.93646103],"study_design_scores_gemma":[0.0002574737,0.00023005287,0.00028533055,0.00029157638,0.00000813617,0.00009336654,2.4369317e-7,0.72566587,0.0005622113,0.25231975,0.01962932,0.0006566622],"about_ca_topic_score_codex":0.000012305314,"about_ca_topic_score_gemma":0.000049439437,"teacher_disagreement_score":0.93580437,"about_ca_system_score_codex":0.000121785546,"about_ca_system_score_gemma":0.00029309036,"threshold_uncertainty_score":0.9999618},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023635414,0.00018713027,0.99342394,0.00052999856,0.0008290925,0.00046318877,0.0000024210772,0.00007230466,0.0042555677],"genre_scores_gemma":[0.028186953,0.000099093006,0.9686414,0.0024271123,0.00030469726,0.000026312775,0.000006622306,0.00002204209,0.0002857739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965091,0.00010972323,0.00056360295,0.0011875667,0.001063841,0.0005661689],"domain_scores_gemma":[0.9976841,0.00012970601,0.0002653,0.0016861439,0.00016123673,0.00007348751],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027437205,0.00039823868,0.0003196606,0.00060675107,0.00020351833,0.00058767176,0.0039878734,0.00022835196,0.000006734384],"category_scores_gemma":[0.00010479747,0.0003037478,0.00008041915,0.00083838654,0.00041312934,0.000911232,0.0005804412,0.00086777395,0.000032380518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026759826,0.000023405895,0.000016145023,0.000010012234,0.0000022979466,0.000027259803,0.0021693523,0.5126447,0.00011465489,0.09739583,0.000038467013,0.3875552],"study_design_scores_gemma":[0.000107805405,0.000045720648,0.00006519592,0.0000451715,0.000002075852,0.000037198897,1.2052179e-7,0.85212,0.00070077216,0.14579885,0.0007689371,0.00030816378],"about_ca_topic_score_codex":0.00002237083,"about_ca_topic_score_gemma":0.000116605624,"teacher_disagreement_score":0.38724703,"about_ca_system_score_codex":0.00030539167,"about_ca_system_score_gemma":0.00038232238,"threshold_uncertainty_score":0.99994147},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003735739,0.000073783835,0.99589926,0.000091830516,0.001174192,0.0016352825,0.000009887486,0.00037464913,0.0007037367],"genre_scores_gemma":[0.022484284,0.0000050022486,0.97599155,0.0010799675,0.00026888854,0.00009505303,0.000013588304,0.000042307038,0.000019347555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957583,0.00004077896,0.00067860464,0.0016690673,0.0011727227,0.0006805492],"domain_scores_gemma":[0.99647164,0.0006284422,0.00039115074,0.0019249871,0.00038372132,0.00020003221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035206734,0.00052213814,0.00043515887,0.001323295,0.00033661362,0.00050137745,0.004610998,0.0004861847,0.0000080268555],"category_scores_gemma":[0.0003723118,0.00048458943,0.00013085146,0.0006645927,0.00054165977,0.001024939,0.00053634285,0.0005523971,0.000011328228],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047176436,0.00008111229,0.00001708359,0.0001022002,0.0000044342023,0.00001555013,0.00016792887,0.01246605,0.0038348134,0.042278185,0.00001997658,0.9409655],"study_design_scores_gemma":[0.00036020338,0.00060207536,0.00008575191,0.00043671584,0.000005813487,0.00004699736,9.135884e-8,0.7824644,0.08774081,0.12682201,0.000806172,0.00062897784],"about_ca_topic_score_codex":0.00000961913,"about_ca_topic_score_gemma":0.00004935508,"teacher_disagreement_score":0.9403365,"about_ca_system_score_codex":0.000523015,"about_ca_system_score_gemma":0.00093995954,"threshold_uncertainty_score":0.99976057},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044511573,0.00029379086,0.9936461,0.0006505168,0.0019572938,0.000288406,0.000008172675,0.000094433635,0.0026161945],"genre_scores_gemma":[0.4208225,0.00007761105,0.576925,0.0005628953,0.0005434767,0.0000027873473,0.0000079914635,0.000039032013,0.0010187048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574196,0.000028344692,0.00068922894,0.0015471367,0.0014325735,0.00056077115],"domain_scores_gemma":[0.997351,0.00022531304,0.00025031055,0.0018571209,0.00015497422,0.00016130906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000529434,0.00044631402,0.000577632,0.0005278951,0.00013876059,0.00025624118,0.0037668953,0.00033263877,0.00005968905],"category_scores_gemma":[0.00006649769,0.0003205868,0.00015806948,0.00042535554,0.00037269847,0.0006771899,0.0019660508,0.0006431691,0.000025342253],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008805007,0.00003866036,0.00031779654,0.00002815171,0.000017978191,0.000060570495,0.0009886326,0.011803283,0.00059839623,0.008926379,0.000031932694,0.9771794],"study_design_scores_gemma":[0.00024355229,0.00013129429,0.00017245127,0.0006285429,0.00001086464,0.000014997209,1.4748086e-7,0.7534475,0.004177508,0.23944983,0.0011169282,0.0006064198],"about_ca_topic_score_codex":0.000038072223,"about_ca_topic_score_gemma":0.000018017527,"teacher_disagreement_score":0.976573,"about_ca_system_score_codex":0.00023022066,"about_ca_system_score_gemma":0.00018858211,"threshold_uncertainty_score":0.9999246},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068586454,0.00064518425,0.9961842,0.0009380107,0.0003925692,0.0004329377,0.000010058852,0.00019474713,0.00051648304],"genre_scores_gemma":[0.39574328,0.00003613068,0.60228115,0.0012973628,0.00028336258,0.000016920098,0.000009718103,0.000028016158,0.00030406678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996599,0.000028362967,0.00052354246,0.0015559336,0.00060642447,0.0006867091],"domain_scores_gemma":[0.99799824,0.00034818752,0.00032427732,0.00081355515,0.00032019365,0.00019555552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008123705,0.0005443843,0.00056164665,0.00048041748,0.00041270582,0.0007854938,0.0015341497,0.00036994796,0.0000030654248],"category_scores_gemma":[0.00008082429,0.00051559176,0.00009665814,0.00030469484,0.0003062904,0.00065039005,0.00048292222,0.0005563584,0.00000487458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011207869,0.000026153582,0.000013091501,0.000034287896,0.000010224679,0.0000144847045,0.00057152036,0.12124243,0.0016421118,0.06998004,0.000020088723,0.80643433],"study_design_scores_gemma":[0.00027884604,0.00019820455,0.000022396163,0.00021347676,0.000009123791,0.000023988574,5.675017e-8,0.70962656,0.0010320797,0.28813583,0.000031383748,0.00042807017],"about_ca_topic_score_codex":0.0000101490305,"about_ca_topic_score_gemma":0.00009435695,"teacher_disagreement_score":0.8060063,"about_ca_system_score_codex":0.00015725325,"about_ca_system_score_gemma":0.00047528782,"threshold_uncertainty_score":0.9997296},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071317423,0.0020714207,0.9919339,0.00013274817,0.00046663414,0.0003076024,0.004032392,0.000008497058,0.00033367355],"genre_scores_gemma":[0.9289538,0.0014547503,0.06836144,0.00012784747,0.00012699876,0.000005265727,0.00087529095,0.00001909694,0.00007547096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659324,0.000022384414,0.0014900987,0.0013600625,0.00023692875,0.00029729554],"domain_scores_gemma":[0.9948816,0.0006450375,0.0022497205,0.0019103638,0.00024106914,0.00007224354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017861367,0.00028076975,0.0016735403,0.0018201808,0.0001138385,0.00002929878,0.0018646054,0.00016405858,0.00005324901],"category_scores_gemma":[0.00073553744,0.00026182018,0.00028316272,0.001615123,0.0005368692,0.00024496656,0.00055502274,0.0002309897,0.0000025879851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017388427,0.00033352897,0.021662457,0.0005887567,0.0011181771,0.000005307218,0.0024142636,0.20844051,0.000038177648,0.011579538,0.00011828985,0.7535271],"study_design_scores_gemma":[0.0003299041,0.0002226456,0.0034705112,0.00018765125,0.00012046648,4.885934e-7,3.8327124e-7,0.94993037,0.00070111017,0.0427923,0.0018206222,0.00042355756],"about_ca_topic_score_codex":0.0032832338,"about_ca_topic_score_gemma":0.0012486565,"teacher_disagreement_score":0.92824066,"about_ca_system_score_codex":0.00020479901,"about_ca_system_score_gemma":0.000174965,"threshold_uncertainty_score":0.99998343},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07583703,0.0027551234,0.9105128,0.0014790841,0.0019774402,0.0025024381,0.00039519946,0.0016786504,0.0028622202],"genre_scores_gemma":[0.99311626,0.000061296116,0.0057997326,0.00039907228,0.0004760625,0.00003670705,0.000027757322,0.000004767265,0.000078335084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997842,0.00001208826,0.00034841633,0.00090429414,0.00032569366,0.00056748197],"domain_scores_gemma":[0.99914783,0.00036402288,0.00012483446,0.00019013214,0.00009098628,0.00008220755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034384875,0.00036309054,0.0004825444,0.000082645085,0.00042179733,0.000103291764,0.0011015175,0.00051571854,0.000045025714],"category_scores_gemma":[0.00003283008,0.00015747886,0.00014884157,0.00015513861,0.0002470414,0.00010160411,0.00020127757,0.00040928868,0.00003760114],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050671308,0.000021368254,0.00008796952,0.0000410802,0.000017489565,0.000033968576,0.000072041585,0.009912626,0.0009191356,0.0015418046,0.000011811344,0.98729],"study_design_scores_gemma":[0.0013416838,0.0014137644,0.00035248647,0.0026114066,0.00010310976,0.00030489516,0.000008275534,0.7591122,0.0020047345,0.22446848,0.005528759,0.0027502298],"about_ca_topic_score_codex":0.00003141149,"about_ca_topic_score_gemma":0.00048072336,"teacher_disagreement_score":0.9845398,"about_ca_system_score_codex":0.00011798212,"about_ca_system_score_gemma":0.000040017592,"threshold_uncertainty_score":0.64218014},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27480626,0.00076682965,0.67561126,0.0017747149,0.0027115778,0.0008257746,0.00012345833,0.000065341046,0.04331477],"genre_scores_gemma":[0.9861512,0.00008303331,0.009658887,0.0029168397,0.00037333253,0.0000025678255,0.000006477356,0.000027214313,0.0007804391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812734,0.0000033056979,0.0006663138,0.00069139217,0.00014364344,0.00036801054],"domain_scores_gemma":[0.9985576,0.00009008102,0.0004184028,0.00077231874,0.00008703332,0.000074545205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070412434,0.00028705734,0.0005575149,0.00041551143,0.00013275279,0.00017275795,0.0011320416,0.0001630955,0.00018380227],"category_scores_gemma":[0.000041671417,0.00024064681,0.00011476359,0.00030251587,0.00026933057,0.00020901227,0.0001735459,0.0003448297,0.00008229792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003811601,0.00010773185,0.025160583,0.00005428548,0.000040263174,0.000031901767,0.004168475,0.1487694,0.000014336949,0.09790876,0.00018191467,0.7235242],"study_design_scores_gemma":[0.00071131915,0.0005442869,0.033775195,0.00051660417,0.000021354139,0.000048803493,0.000003234797,0.6408326,0.00046275073,0.27645922,0.04491735,0.0017072596],"about_ca_topic_score_codex":0.000109148736,"about_ca_topic_score_gemma":0.00008572635,"teacher_disagreement_score":0.72181696,"about_ca_system_score_codex":0.00008125067,"about_ca_system_score_gemma":0.000069009504,"threshold_uncertainty_score":0.98132926},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00581958,0.00023467792,0.9664622,0.00074008905,0.00073008466,0.00038307547,0.000007960155,0.00014685505,0.025475498],"genre_scores_gemma":[0.91661197,0.000012204995,0.079670526,0.0015377766,0.00042223337,0.000009910281,0.000006182015,0.00007070679,0.0016584648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724495,0.000032983455,0.00039486546,0.0009038691,0.00072251086,0.00070081005],"domain_scores_gemma":[0.99776185,0.0007718759,0.00022803884,0.00096578716,0.00011175043,0.00016069092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006915788,0.000503257,0.0005431701,0.0003828448,0.00021270734,0.00012469407,0.0009831084,0.000358165,0.00029863778],"category_scores_gemma":[0.00011649949,0.00040744338,0.0001225622,0.00040398265,0.00079294725,0.00023175917,0.0003244839,0.0009975161,0.00008848935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023219138,0.0005484477,0.0007182616,0.001203069,0.00020622968,0.002409401,0.009344742,0.006297191,0.000079665864,0.869986,0.0005484892,0.108426325],"study_design_scores_gemma":[0.00053264876,0.0002335961,0.000035702786,0.00067608804,0.000038561564,0.00024148621,0.0000016775175,0.0017066161,0.00045473414,0.9950413,0.00044548154,0.00059210043],"about_ca_topic_score_codex":0.00001667896,"about_ca_topic_score_gemma":0.000116812575,"teacher_disagreement_score":0.9107924,"about_ca_system_score_codex":0.00024086749,"about_ca_system_score_gemma":0.00036566774,"threshold_uncertainty_score":0.99983776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005119313,0.00045999355,0.9950271,0.0005571044,0.0012273765,0.0011885129,0.000017153365,0.00056155294,0.00044922158],"genre_scores_gemma":[0.16163051,0.000023661387,0.83562076,0.0019181259,0.0005321096,0.00003775679,0.00007346676,0.00006717711,0.00009642463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99429375,0.00006900115,0.0011347807,0.0022472197,0.0011285109,0.001126736],"domain_scores_gemma":[0.9965135,0.0010711978,0.00052497,0.00096300716,0.00070631405,0.00022102904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022665043,0.0008321239,0.0008223755,0.001980192,0.0005726211,0.0010306444,0.0029102494,0.00076642877,0.0000029245093],"category_scores_gemma":[0.00023688159,0.0008369383,0.00022639541,0.0012954624,0.00039746222,0.0008507534,0.0010028541,0.001661426,0.0000065726135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016712325,0.00003492752,0.00006390104,0.00010530476,0.000011412887,0.000055051172,0.0005965875,0.9527977,0.0003500348,0.0073372857,0.000026059277,0.038605027],"study_design_scores_gemma":[0.0006168018,0.00013916138,0.00002764544,0.001159542,0.00000620313,0.00006458673,0.0000017579595,0.956351,0.0020658001,0.038465388,0.00014866762,0.0009534544],"about_ca_topic_score_codex":0.000011720789,"about_ca_topic_score_gemma":0.000033540466,"teacher_disagreement_score":0.16111858,"about_ca_system_score_codex":0.000585337,"about_ca_system_score_gemma":0.0009202388,"threshold_uncertainty_score":0.9994081},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007936224,0.0011556754,0.9920362,0.000067285066,0.0010398546,0.00035301253,0.0000053521885,0.0010543002,0.0034946708],"genre_scores_gemma":[0.2242777,0.00013642864,0.7747836,0.0001966729,0.00046727224,0.000016583721,0.0000047671797,0.00006141437,0.000055566503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796975,0.000003048553,0.00035360624,0.00064533285,0.00030807004,0.0007201917],"domain_scores_gemma":[0.9985556,0.0008071648,0.00005659574,0.0004590843,0.00006012368,0.0000614505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002610538,0.00044157478,0.00044997552,0.00038753587,0.00010968904,0.00015855586,0.00092657545,0.00059063674,0.000021394068],"category_scores_gemma":[0.00008478018,0.000382229,0.000107433436,0.0002342845,0.0011195461,0.0002518632,0.00025659535,0.00078252814,0.000005617604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004442793,0.0000030993979,0.0000018905755,0.000035545385,0.000005421359,0.000019342999,0.000038479597,0.61460155,0.000041500247,0.025696293,0.000015249954,0.35953718],"study_design_scores_gemma":[0.00016423411,0.00014319549,0.000021479951,0.00016639195,0.000008210908,0.000016732047,0.0000026350058,0.62165785,0.00025772557,0.37423894,0.0027261232,0.000596478],"about_ca_topic_score_codex":7.2472005e-7,"about_ca_topic_score_gemma":0.000052562038,"teacher_disagreement_score":0.35894072,"about_ca_system_score_codex":0.0002395142,"about_ca_system_score_gemma":0.00006004155,"threshold_uncertainty_score":0.99986297},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003477586,0.00024664917,0.9862501,0.00027372054,0.0023993782,0.0007951831,0.000040810457,0.00026630334,0.009693057],"genre_scores_gemma":[0.02756742,0.000040288185,0.969255,0.0022864,0.00051284896,0.00006998524,0.000060827628,0.000051093346,0.00015617324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955019,0.000016752503,0.00050932664,0.0022552363,0.00079566386,0.0009211348],"domain_scores_gemma":[0.99648446,0.0002261139,0.00027100177,0.0025506264,0.00022405169,0.0002437646],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012700655,0.000567993,0.0004902673,0.0010851787,0.0003867863,0.0010744431,0.0062348316,0.00029740998,0.000052619063],"category_scores_gemma":[0.000035276626,0.00055251975,0.00024778701,0.0008005814,0.00046052752,0.0009627889,0.002159154,0.00054986996,0.000027968072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022093536,0.00006270075,0.000099360375,0.00018914984,0.000027910266,0.0000505756,0.0003783034,0.0028046842,0.000010933508,0.7867125,0.00025004233,0.2093917],"study_design_scores_gemma":[0.0005547028,0.00020786317,0.00007767652,0.00032315496,0.000017100827,0.000011912226,1.5564804e-7,0.27911127,0.0006355753,0.6820097,0.036208857,0.0008420225],"about_ca_topic_score_codex":0.000053693067,"about_ca_topic_score_gemma":0.00009455784,"teacher_disagreement_score":0.27630657,"about_ca_system_score_codex":0.00016608839,"about_ca_system_score_gemma":0.0002499937,"threshold_uncertainty_score":0.9999625},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016194908,0.0025195053,0.9894247,0.0013464671,0.0007848534,0.00031467408,0.0000027857805,0.000989119,0.004601723],"genre_scores_gemma":[0.012383766,0.000026622029,0.9833452,0.0035561419,0.00018982185,0.00000768887,0.0000034883553,0.000042022744,0.00044523083],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995748,0.00004600367,0.0005883092,0.0016318075,0.0011727319,0.00081316294],"domain_scores_gemma":[0.9970656,0.0004989838,0.00031289493,0.0016224436,0.00030226857,0.00019783109],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010976667,0.00062680815,0.00059304875,0.0009901706,0.00027184334,0.0011042246,0.004708071,0.00046991438,0.00003085893],"category_scores_gemma":[0.0003166739,0.0005481044,0.00014387592,0.00083638576,0.0006606624,0.0008996228,0.0016160712,0.0012009542,0.000051273964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002923749,0.000036749898,0.00005369782,0.00012907437,0.000015090503,0.00032732624,0.0005049488,0.0004622104,0.0031257567,0.26931864,0.00027663907,0.7257469],"study_design_scores_gemma":[0.0001236273,0.000094116025,0.0000047557032,0.00052435475,0.000007115592,0.00012778447,4.010069e-8,0.29279426,0.0053933165,0.69856626,0.0015933455,0.00077104487],"about_ca_topic_score_codex":0.0000059041,"about_ca_topic_score_gemma":0.000031092517,"teacher_disagreement_score":0.7249759,"about_ca_system_score_codex":0.00036351557,"about_ca_system_score_gemma":0.0006438335,"threshold_uncertainty_score":0.9999327},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033135566,0.00015981485,0.98747396,0.001853716,0.003599313,0.00091919483,0.000023430242,0.000065502885,0.0058719306],"genre_scores_gemma":[0.08943477,0.000013354823,0.89460367,0.014018996,0.00067589467,0.00008385087,0.0000146264265,0.00005437438,0.0011004786],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961142,0.000031594842,0.0005456034,0.001772282,0.0006896488,0.0008467058],"domain_scores_gemma":[0.9962465,0.0011800888,0.00036649467,0.0012643136,0.0006951965,0.0002473716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037940303,0.0006224525,0.00056916405,0.0011242378,0.00037851435,0.00063148845,0.0030758926,0.0002707115,0.000061645966],"category_scores_gemma":[0.0005247209,0.00059166196,0.00026897388,0.0005595118,0.00019447507,0.001084464,0.0010065588,0.00090152875,0.000116310584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017519675,0.00021077279,0.000014139807,0.000059686525,0.0001240731,0.00018797338,0.008831377,0.012175193,0.012997746,0.25682896,0.0027942525,0.7056006],"study_design_scores_gemma":[0.001133676,0.0029475826,0.0003832406,0.0077002784,0.00005479574,0.0002101277,0.000009400249,0.13333644,0.054191332,0.71424913,0.082157664,0.0036263366],"about_ca_topic_score_codex":0.000007086442,"about_ca_topic_score_gemma":0.000012845121,"teacher_disagreement_score":0.7019743,"about_ca_system_score_codex":0.00053679565,"about_ca_system_score_gemma":0.00029720512,"threshold_uncertainty_score":0.99965346},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000087505745,0.00019094329,0.98876494,0.0029701411,0.0005937722,0.00015719347,0.0000015467721,0.00019291238,0.007041044],"genre_scores_gemma":[0.5784396,0.000081374616,0.41786394,0.001896854,0.0006990275,0.0000041982194,0.000015947959,0.000041513435,0.0009575363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997346,0.000051854982,0.00024677697,0.0012790511,0.00068536267,0.00039097067],"domain_scores_gemma":[0.9983019,0.0005768786,0.00025734442,0.000667292,0.00007591669,0.00012063088],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008704478,0.0003675552,0.0002906097,0.0008132001,0.00045358005,0.0013646939,0.001020384,0.00029614122,0.000009319571],"category_scores_gemma":[0.00016077209,0.00032787607,0.00004973708,0.0005024001,0.00026976693,0.0008326453,0.00040646113,0.0011114725,0.000016931692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035638716,0.000014644982,0.00015989455,0.000023132543,0.000005641352,0.000011349813,0.000265537,0.013242257,0.00009408049,0.22709219,0.00007431979,0.7590134],"study_design_scores_gemma":[0.00019978397,0.00014203276,0.000807894,0.00041498776,0.0000067670735,0.000093097486,3.5033548e-7,0.8492833,0.00014005313,0.14537251,0.0030263993,0.00051283016],"about_ca_topic_score_codex":0.00000939994,"about_ca_topic_score_gemma":0.000053945016,"teacher_disagreement_score":0.83604103,"about_ca_system_score_codex":0.00054229994,"about_ca_system_score_gemma":0.0002474305,"threshold_uncertainty_score":0.9999173},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054367055,0.00090306386,0.9958985,0.00042713623,0.0010705814,0.00028943634,0.000007718748,0.00045331565,0.0004065726],"genre_scores_gemma":[0.21193095,0.00010476775,0.7864584,0.0009931595,0.00017226503,0.0000015010376,0.000006973613,0.000024597912,0.00030742298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965302,0.000036418038,0.00048049982,0.0014217817,0.0009921497,0.0005389702],"domain_scores_gemma":[0.9979159,0.00027339635,0.00028213987,0.0010356111,0.0002709042,0.0002220103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009129298,0.00041675323,0.00043525628,0.00408577,0.00030393552,0.001012995,0.0021895962,0.0003996232,0.000007623758],"category_scores_gemma":[0.0001662556,0.00039973733,0.00008169568,0.0042402395,0.00057876133,0.00060222513,0.0009163509,0.0005498644,0.000025066785],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017781695,0.000037505153,0.000046008852,0.000025938947,0.000007718973,0.00004376416,0.0004899511,0.0030732942,0.00041990442,0.004365803,0.000023046507,0.9914653],"study_design_scores_gemma":[0.00020502205,0.00006521787,0.00081755844,0.00008087549,0.0000059130143,0.00007612467,1.1830422e-7,0.9849724,0.00060717773,0.011107713,0.0015817912,0.00048005502],"about_ca_topic_score_codex":0.000051492956,"about_ca_topic_score_gemma":0.000009092725,"teacher_disagreement_score":0.9909852,"about_ca_system_score_codex":0.00028291944,"about_ca_system_score_gemma":0.0003486547,"threshold_uncertainty_score":0.99984545},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050205074,0.00010450258,0.99226177,0.0015588853,0.0022331323,0.0015942347,0.0000943503,0.00015572993,0.0014953587],"genre_scores_gemma":[0.02290161,0.00000537104,0.97361016,0.002097376,0.0008591746,0.00003212519,0.000009895305,0.000051385214,0.00043288778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945547,0.000035182027,0.0010086156,0.0019610052,0.0013211394,0.0011193487],"domain_scores_gemma":[0.9951747,0.0010003785,0.00051845226,0.002079736,0.00075003895,0.00047668425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012995728,0.0007028995,0.0010125343,0.0016575201,0.00018501077,0.000908784,0.004018817,0.00041052498,0.000017071314],"category_scores_gemma":[0.0004977297,0.0006530896,0.00031528177,0.0011548261,0.000684058,0.0010347952,0.0014458906,0.0004980549,0.00004387757],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005048734,0.0001170768,0.00009766228,0.00012350423,0.000046068246,0.000061651255,0.00089886104,0.0032351676,0.0055824216,0.08863808,0.00044968684,0.9006993],"study_design_scores_gemma":[0.0067040245,0.0032337816,0.0007099898,0.0035976232,0.00007634171,0.0030678825,0.0000032491887,0.35646215,0.04585429,0.33555523,0.23728693,0.0074485396],"about_ca_topic_score_codex":0.00009583407,"about_ca_topic_score_gemma":0.0005518357,"teacher_disagreement_score":0.8932508,"about_ca_system_score_codex":0.00036665623,"about_ca_system_score_gemma":0.0013404124,"threshold_uncertainty_score":0.999592},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017510375,0.0006530204,0.9954497,0.00032073652,0.0008164475,0.00016628749,0.0000032550206,0.00014846248,0.0022669632],"genre_scores_gemma":[0.14825416,0.00024498499,0.850362,0.00059551554,0.00023729737,0.0000024580186,0.000009156732,0.000031447587,0.00026299278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970132,0.000038857983,0.00050195464,0.0011692562,0.00084062445,0.00043609395],"domain_scores_gemma":[0.9979087,0.00040698223,0.0003117559,0.0010081853,0.00023093521,0.00013343961],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002924612,0.0003772715,0.00049134885,0.000662585,0.00023695284,0.00013538421,0.0022476283,0.00018555409,0.000033846834],"category_scores_gemma":[0.00012349796,0.00035845672,0.00013934408,0.00054826913,0.0005566734,0.00070454803,0.0009994506,0.0008446795,0.000035346337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002056997,0.000016410711,0.00007913722,0.000009238178,0.000004893875,0.000032547036,0.0006709115,0.030126924,0.00079809804,0.0017459578,0.000010544737,0.96650326],"study_design_scores_gemma":[0.0003066256,0.00010242371,0.00042962746,0.0003849385,0.00000438866,0.000028406785,2.351946e-7,0.9526128,0.0041734963,0.038026854,0.0034427752,0.00048738482],"about_ca_topic_score_codex":0.000042459542,"about_ca_topic_score_gemma":0.000008711468,"teacher_disagreement_score":0.9660159,"about_ca_system_score_codex":0.00014183906,"about_ca_system_score_gemma":0.00026577903,"threshold_uncertainty_score":0.99988675},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005175714,0.0003649956,0.9928257,0.00019682148,0.0008180335,0.00051614124,0.000004765344,0.00006763241,0.00003018768],"genre_scores_gemma":[0.7006167,0.00006757004,0.2986676,0.00023800063,0.00008858606,0.000026945183,0.0000012371723,0.000051724855,0.00024160002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672484,0.00005840251,0.0005995107,0.00071653805,0.0013678474,0.0005328524],"domain_scores_gemma":[0.9949243,0.0022575916,0.00022153479,0.00222043,0.00026650325,0.00010964931],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0008964742,0.0003545626,0.00048363776,0.00043274756,0.00005488108,0.00015122622,0.006199479,0.0001649934,0.000014521178],"category_scores_gemma":[0.0020199134,0.00022485414,0.0001333559,0.001221029,0.00062712136,0.00040408637,0.002434817,0.0010154587,0.000011080418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002704564,0.000078730154,0.005500289,0.000546403,0.000016536509,0.0000138748,0.001625516,0.6813212,0.0003169811,0.019599799,0.00001731621,0.29096067],"study_design_scores_gemma":[0.00023139313,0.00014630075,0.051620018,0.0022004833,0.0000052894916,0.00001970579,9.816272e-8,0.8726163,0.003846089,0.06846074,0.0003023956,0.00055118155],"about_ca_topic_score_codex":0.000046172918,"about_ca_topic_score_gemma":0.00006280739,"teacher_disagreement_score":0.695441,"about_ca_system_score_codex":0.00017255872,"about_ca_system_score_gemma":0.000593746,"threshold_uncertainty_score":0.99917746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000065563065,0.00032469243,0.9946365,0.00012338857,0.0022539033,0.00035090986,0.000006329231,0.0021125826,0.00012615733],"genre_scores_gemma":[0.0026200828,0.000009660208,0.9959609,0.00035625882,0.0005769069,0.000028966317,0.000008638202,0.00006651055,0.00037207786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961431,0.000020716017,0.00044760967,0.0015277793,0.0009800303,0.0008807534],"domain_scores_gemma":[0.99676335,0.00034353344,0.00016731714,0.002328446,0.00017044468,0.0002268936],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007660671,0.00063718576,0.00055928685,0.0011187787,0.000120468016,0.00052189396,0.005484197,0.0006058574,0.000010965772],"category_scores_gemma":[0.00009776935,0.0006375936,0.00014627843,0.0010836222,0.00024815128,0.00066424435,0.0019464551,0.0020267523,0.000036498208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.206199e-7,0.000022721668,0.000029162695,0.0000963121,0.000008209922,0.00019896912,0.0009484451,0.07214526,0.00069654064,0.007398088,0.00018884866,0.91826653],"study_design_scores_gemma":[0.00018283322,0.000105118845,0.000104067316,0.0006027785,0.0000069755274,0.00016205334,1.8064515e-8,0.9513413,0.0071957796,0.011692579,0.027281884,0.0013246583],"about_ca_topic_score_codex":0.000017236844,"about_ca_topic_score_gemma":0.000023051089,"teacher_disagreement_score":0.9169419,"about_ca_system_score_codex":0.00047601954,"about_ca_system_score_gemma":0.0008427438,"threshold_uncertainty_score":0.9998966},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009211749,0.0007887184,0.994993,0.00053109636,0.0015510984,0.00040272495,0.000025987063,0.0001402634,0.001475034],"genre_scores_gemma":[0.11051861,0.00019793946,0.8862134,0.0019270111,0.000925474,0.000032257667,0.000026339949,0.000054331143,0.000104631035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99674106,0.000024168181,0.00043005304,0.0016014377,0.0005386078,0.0006646688],"domain_scores_gemma":[0.9976544,0.00055359595,0.00020606042,0.001187295,0.00016468803,0.0002339556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080650795,0.000468299,0.0005055304,0.0006604563,0.00039995107,0.0006815077,0.0024069876,0.00035260044,0.000012699344],"category_scores_gemma":[0.000062745945,0.00042049328,0.00015440046,0.0004099506,0.0011465581,0.00075352256,0.0013479585,0.0006272995,0.000009630919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010172197,0.000025942596,0.000028801609,0.000052399868,0.000009908964,0.000022067474,0.00069448765,0.00003454925,0.000043361208,0.6826011,0.00011632247,0.31636092],"study_design_scores_gemma":[0.00031577182,0.00025047516,0.0001247478,0.0002293992,0.000010525691,0.00008930485,1.1537309e-7,0.18313934,0.00028942607,0.7925609,0.02236327,0.00062673626],"about_ca_topic_score_codex":0.000017803723,"about_ca_topic_score_gemma":0.000094898016,"teacher_disagreement_score":0.31573418,"about_ca_system_score_codex":0.000077957455,"about_ca_system_score_gemma":0.00031663818,"threshold_uncertainty_score":0.9998247},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002622415,0.0001554801,0.9942024,0.0002435293,0.0009130832,0.0004066285,0.00000613438,0.00031442376,0.003496131],"genre_scores_gemma":[0.07261387,0.00000583419,0.9238655,0.0011328412,0.00084357866,0.000032396718,0.00021315743,0.0000498,0.001243015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956386,0.00005842989,0.00066480966,0.0012235238,0.0016600358,0.00075460295],"domain_scores_gemma":[0.9976413,0.00035354015,0.00042038778,0.0010916995,0.0002873568,0.00020566492],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015765403,0.00051995355,0.0004250694,0.00050491636,0.00044509943,0.0011457105,0.0029529028,0.00024877986,0.000022500659],"category_scores_gemma":[0.000110017936,0.00046609418,0.00009773161,0.0005473084,0.00041529213,0.0011791855,0.0007937391,0.00096530345,0.000040330022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001786326,0.000032491545,0.000046903733,0.000028231681,0.000004155375,0.00001028563,0.00038673097,0.04871714,0.000019720359,0.004766813,0.00008608929,0.94589967],"study_design_scores_gemma":[0.0002641291,0.00040066545,0.00010124574,0.0001605838,0.000004937718,0.00006208799,9.706204e-8,0.93805563,0.000047012494,0.05693068,0.0034129643,0.0005599344],"about_ca_topic_score_codex":0.00018589699,"about_ca_topic_score_gemma":0.000044037504,"teacher_disagreement_score":0.94533974,"about_ca_system_score_codex":0.00021932738,"about_ca_system_score_gemma":0.0005602388,"threshold_uncertainty_score":0.9998912},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008240416,0.005849079,0.9904322,0.0007180401,0.0010389544,0.0006705203,0.0000065587965,0.0005177281,0.0007586608],"genre_scores_gemma":[0.013639689,0.000023470919,0.9825551,0.002069999,0.000653115,0.000039025203,0.0000062442446,0.000043284228,0.00097006274],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996465,0.00001488394,0.0004792053,0.0015569554,0.000780864,0.00070306245],"domain_scores_gemma":[0.99763995,0.00029126953,0.000289713,0.0013162759,0.00030900238,0.00015377038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005721094,0.0005515046,0.00048016995,0.000774705,0.00023713987,0.000603076,0.004358585,0.00039361254,0.000020409534],"category_scores_gemma":[0.00012783078,0.00049065147,0.00014810711,0.00041680966,0.00041837269,0.00087588053,0.0012572441,0.0006267731,0.00002886136],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006062802,0.000028798104,0.0000033730807,0.00003891861,0.0000070179917,0.000025240315,0.00072971673,0.0010726424,0.0011807864,0.018117495,0.00016285159,0.9786271],"study_design_scores_gemma":[0.00066725275,0.00030407283,0.0000056960716,0.00083793316,0.000010408663,0.000085869106,1.2543195e-7,0.4257791,0.079683945,0.46986622,0.021206291,0.0015530909],"about_ca_topic_score_codex":0.00001528469,"about_ca_topic_score_gemma":0.000026112346,"teacher_disagreement_score":0.977074,"about_ca_system_score_codex":0.0005223623,"about_ca_system_score_gemma":0.0004632205,"threshold_uncertainty_score":0.9997545},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012633435,0.00025911073,0.99574095,0.00034708093,0.0007862937,0.0004885012,0.000012069231,0.00022376697,0.0008788964],"genre_scores_gemma":[0.19572042,0.000057125326,0.8028347,0.00048760496,0.00051481894,0.000012509036,0.000015020713,0.000038649672,0.00031917854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928208,0.0001582366,0.0010733935,0.0025318316,0.0021074829,0.001308267],"domain_scores_gemma":[0.9928131,0.0022081449,0.0004487512,0.0032456515,0.00088533823,0.00039902993],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0055103726,0.00070223917,0.0015369299,0.002256484,0.00068782165,0.0012240345,0.005264641,0.00077206607,0.00014414165],"category_scores_gemma":[0.0010470703,0.00060550886,0.0007717761,0.003399443,0.0016035367,0.0012733905,0.0026769973,0.0020780417,0.00003986871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007276921,0.0002289969,0.0029574954,0.00014367848,0.00050885166,0.00017036489,0.0010773167,0.50279504,0.0008771657,0.007081044,0.0000075155804,0.48407978],"study_design_scores_gemma":[0.00048820375,0.000088453686,0.00020712799,0.000096013915,0.00017738507,0.000028837834,1.6372759e-7,0.922132,0.0009353956,0.074408524,0.0007205317,0.00071737665],"about_ca_topic_score_codex":0.00025226758,"about_ca_topic_score_gemma":0.00013509628,"teacher_disagreement_score":0.48336238,"about_ca_system_score_codex":0.0003990552,"about_ca_system_score_gemma":0.0011952822,"threshold_uncertainty_score":0.9998128},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023789522,0.0012051985,0.99368405,0.0010716411,0.00023423851,0.0011763002,0.000004135463,0.000015874417,0.00022959328],"genre_scores_gemma":[0.4258941,0.00048821635,0.56941146,0.0026214924,0.0012583844,0.00012873176,0.000016550734,0.000033792825,0.00014727372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821496,0.000040384217,0.0005730488,0.0006498891,0.00026239303,0.00025934377],"domain_scores_gemma":[0.99889416,0.00011764676,0.00020032057,0.00049983413,0.00022091645,0.000067150155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089882815,0.00023377694,0.00038471096,0.00008363893,0.00009845397,0.00003113573,0.00073085737,0.00046790577,0.0000019703834],"category_scores_gemma":[0.00064412045,0.00015297584,0.000104426486,0.000068456095,0.0011909333,0.0000035764058,0.00045992382,0.00036959635,5.50977e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025276506,0.00001360184,0.0003092201,0.000017747694,0.0000144268015,0.000004007969,0.000059234142,0.007624449,0.0014960801,0.000045855395,0.000023573502,0.9903665],"study_design_scores_gemma":[0.0006831062,0.0009815095,0.00034489398,0.000616066,0.000024783973,0.00006706682,0.0000012310353,0.9648023,0.0037157417,0.017742196,0.010525845,0.00049524807],"about_ca_topic_score_codex":0.000023110573,"about_ca_topic_score_gemma":0.00011180215,"teacher_disagreement_score":0.98987126,"about_ca_system_score_codex":0.000012683987,"about_ca_system_score_gemma":0.00022871763,"threshold_uncertainty_score":0.6238174},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047765734,0.0011082257,0.9959984,0.00080322527,0.0010565557,0.00038967837,0.0000035668684,0.00014324678,0.00044934888],"genre_scores_gemma":[0.039962105,0.00019886572,0.9582039,0.0013088892,0.00012923035,0.000011105359,0.0000046356763,0.000021041209,0.00016024311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746346,0.00001731038,0.0004048447,0.0011312637,0.0005458485,0.00043724963],"domain_scores_gemma":[0.9980239,0.0007298652,0.0002554755,0.00064004323,0.00020901524,0.00014164756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005313999,0.0003682463,0.0003992383,0.0009034316,0.0004091489,0.00039421816,0.0013259697,0.00014008967,0.00000327837],"category_scores_gemma":[0.00015390723,0.00033249718,0.00009709732,0.00047796604,0.00070130866,0.0009583107,0.00065762416,0.00040585504,0.0000058546957],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007083729,0.000011408584,0.000017532684,0.000021126858,0.0000034940258,0.000018223356,0.0006514654,0.012333381,0.00004928049,0.0042633913,0.00003440183,0.9825892],"study_design_scores_gemma":[0.0002942527,0.00022257931,0.000058669524,0.00032707053,0.0000035094524,0.000110991365,2.1996506e-7,0.8826279,0.00057309907,0.11395279,0.0014545256,0.0003743771],"about_ca_topic_score_codex":0.0000035672372,"about_ca_topic_score_gemma":0.0000063567677,"teacher_disagreement_score":0.9822148,"about_ca_system_score_codex":0.00006632595,"about_ca_system_score_gemma":0.00020528243,"threshold_uncertainty_score":0.9999127},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008418612,0.00005096776,0.9790617,0.00040095948,0.0006847521,0.0005677809,7.437452e-7,0.000121933605,0.019026924],"genre_scores_gemma":[0.107110575,0.0000033179936,0.8892352,0.0008891053,0.00029659297,0.00004011156,0.0000065480276,0.000021431664,0.0023971067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719757,0.00011964937,0.00034555487,0.001309375,0.00050038914,0.00052744744],"domain_scores_gemma":[0.9981384,0.00093930255,0.00016813455,0.00037611809,0.00019051769,0.00018751962],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018675769,0.00035045613,0.000375518,0.00055932667,0.0005852793,0.00074378314,0.0013399426,0.00023219874,0.000017720602],"category_scores_gemma":[0.00034012992,0.00031298058,0.00007483329,0.00042795017,0.00034796091,0.0003927128,0.0005687927,0.000883696,0.000017567385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003192447,0.00006446322,0.00011962767,0.00004059302,0.000013221267,0.0000076037086,0.0019489796,0.23585905,0.000054308017,0.22244596,0.00015016328,0.5392641],"study_design_scores_gemma":[0.00053303636,0.0009699979,0.0012678406,0.00012004777,0.000016351074,0.0004377003,0.0000068536574,0.72611266,0.00015941693,0.25976956,0.009520561,0.001085971],"about_ca_topic_score_codex":0.000011024025,"about_ca_topic_score_gemma":0.0000042571887,"teacher_disagreement_score":0.53817815,"about_ca_system_score_codex":0.00018550531,"about_ca_system_score_gemma":0.0005185778,"threshold_uncertainty_score":0.9999322},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009670814,0.00046618006,0.9256787,0.00063320785,0.0022236009,0.00043362688,0.0000054391758,0.00056203763,0.06990052],"genre_scores_gemma":[0.6700326,0.000038564143,0.32137948,0.0021211733,0.003151532,0.0000060882753,0.000026502055,0.00012848513,0.0031155609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940514,0.00011973603,0.0010908572,0.00224473,0.0013954984,0.0010977526],"domain_scores_gemma":[0.9963223,0.00026392625,0.00075958355,0.0020345866,0.00033112016,0.00028853913],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0026001388,0.000766756,0.00070643815,0.00080830377,0.00038897994,0.0011247649,0.005502046,0.00023924129,0.00002076133],"category_scores_gemma":[0.00014218228,0.0007221226,0.0002181022,0.0008600444,0.0004398487,0.00060819957,0.002289956,0.0011368279,0.00034004464],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035045707,0.00005074597,0.00020147001,0.00007319904,0.000020766724,0.0008681362,0.0011330267,0.05112244,0.000070084985,0.017319892,0.0002581879,0.92887855],"study_design_scores_gemma":[0.0008194312,0.0004458992,0.0009568708,0.0020987769,0.000025180349,0.0011495255,5.3961975e-7,0.83465075,0.00039833345,0.021224486,0.13509738,0.0031328553],"about_ca_topic_score_codex":0.000018209887,"about_ca_topic_score_gemma":0.000018910036,"teacher_disagreement_score":0.92574567,"about_ca_system_score_codex":0.0002871664,"about_ca_system_score_gemma":0.00070884917,"threshold_uncertainty_score":0.99991214},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087824505,0.00080535363,0.9927703,0.0006898606,0.0014799831,0.00028552092,0.0000066734865,0.00011024264,0.0029738352],"genre_scores_gemma":[0.5481708,0.00025507974,0.44781044,0.0021170655,0.0009082014,0.00001836102,0.000031220832,0.00003698886,0.0006518636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632066,0.0000403335,0.00057911745,0.0013744683,0.0010936263,0.00059177907],"domain_scores_gemma":[0.99821246,0.0004159362,0.00019670039,0.0008211724,0.00019518095,0.00015857568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059698755,0.00046863235,0.00045508973,0.0012759244,0.00026203683,0.00033097796,0.0019476587,0.0002651903,0.00002210779],"category_scores_gemma":[0.000081099424,0.00046144394,0.00011588987,0.0010985644,0.00053071283,0.0007535574,0.00082297536,0.00068492675,0.00003984106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011856419,0.00009328465,0.00045287228,0.000020362631,0.000011264679,0.0005147295,0.0017057305,0.27449438,0.00020741587,0.05855781,0.00015854178,0.66377175],"study_design_scores_gemma":[0.0006029832,0.00031419686,0.0047001825,0.00039177103,0.00000555303,0.00051389664,3.0570342e-7,0.83491445,0.0010026778,0.14644778,0.009741732,0.0013644577],"about_ca_topic_score_codex":0.00003168303,"about_ca_topic_score_gemma":0.00022269652,"teacher_disagreement_score":0.6624073,"about_ca_system_score_codex":0.00033622765,"about_ca_system_score_gemma":0.0010243899,"threshold_uncertainty_score":0.99978375},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054213262,0.0002497222,0.99264324,0.0027483178,0.0023663389,0.0012696545,0.0000185312,0.00014789974,0.00050208735],"genre_scores_gemma":[0.28003886,0.00004213215,0.7172246,0.0010337638,0.00042923828,0.000086836684,0.00003713823,0.00003576259,0.0010716692],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967778,0.00003014201,0.00034195516,0.0015265443,0.0008390665,0.0004845458],"domain_scores_gemma":[0.99727094,0.0004789353,0.00031420012,0.0012875146,0.0004930785,0.00015535661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011377641,0.00040071868,0.00038424123,0.0013862053,0.00033922616,0.0005875653,0.0025308211,0.00040742455,0.000012339327],"category_scores_gemma":[0.00022279941,0.00036443537,0.00018135789,0.001129717,0.00040176456,0.0004005859,0.00076600333,0.00053831295,0.000051577776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006301753,0.00004595425,0.000009529865,0.000064795546,0.0000095526375,0.0000056589947,0.0007451171,0.0007736464,0.0005005508,0.15828268,0.00004519269,0.83951104],"study_design_scores_gemma":[0.0009101691,0.0002744728,0.003197181,0.0004245686,0.000021398524,0.00003783611,2.2847263e-7,0.28357655,0.0092647355,0.6898729,0.011374278,0.0010456964],"about_ca_topic_score_codex":0.000016873577,"about_ca_topic_score_gemma":0.000030803796,"teacher_disagreement_score":0.83846533,"about_ca_system_score_codex":0.00064914563,"about_ca_system_score_gemma":0.00050834124,"threshold_uncertainty_score":0.99988073},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006759633,0.000053313044,0.9800156,0.00015988597,0.0004565783,0.014027589,0.0000024248302,0.00059194484,0.004625072],"genre_scores_gemma":[0.16512202,0.00003180867,0.81142455,0.0010949639,0.0008254065,0.018089913,0.000023793615,0.00024450012,0.0031430516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983198,0.0000047630756,0.0003104529,0.0005733459,0.00038057848,0.00041106233],"domain_scores_gemma":[0.99901974,0.00004513198,0.00007880262,0.00072590774,0.00007207317,0.00005834473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019107822,0.0003220877,0.00026640398,0.00052756374,0.00008164431,0.00007796035,0.00089494046,0.0003207626,0.000032595817],"category_scores_gemma":[0.000026068685,0.00031959004,0.000041275773,0.00031007727,0.00031234603,0.00021608388,0.00014874846,0.00057510793,0.00009749306],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041451235,0.000017642922,0.000039427072,0.00007592833,0.000009500243,0.000020717118,0.00006902951,0.09354172,0.0014933106,0.0046882615,0.00003844845,0.9000019],"study_design_scores_gemma":[0.00067114655,0.00021402125,0.0003467288,0.00076119805,0.00001420814,0.000039479604,4.3698318e-8,0.54949725,0.026485741,0.37500724,0.045913655,0.0010492742],"about_ca_topic_score_codex":0.000001854394,"about_ca_topic_score_gemma":0.000009764379,"teacher_disagreement_score":0.8989526,"about_ca_system_score_codex":0.00042098295,"about_ca_system_score_gemma":0.000066446846,"threshold_uncertainty_score":0.9999256},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001600108,0.00013801051,0.9956094,0.000408375,0.001146984,0.00060373533,0.0000026414214,0.00040173985,0.0015290867],"genre_scores_gemma":[0.012686129,0.00006847473,0.98313797,0.003121853,0.0007301471,0.000012778276,0.00001215501,0.000045903224,0.00018456498],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99549466,0.00007874982,0.0007508084,0.0015783539,0.0014066674,0.0006907471],"domain_scores_gemma":[0.99733937,0.00046995177,0.00045143254,0.0012250803,0.00027240388,0.00024176612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008936559,0.0005715595,0.00049482525,0.0010092751,0.00031940461,0.0008937475,0.0023750525,0.00030969293,0.00003443333],"category_scores_gemma":[0.00013573903,0.0005686531,0.00015219956,0.00063897733,0.0007933081,0.0029790855,0.0007139922,0.00081644615,0.00003742061],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050608514,0.00005249666,0.00009402543,0.00008569083,0.000022953,0.00025650224,0.0016096953,0.005210753,0.060867015,0.0027482368,0.00013302368,0.92891455],"study_design_scores_gemma":[0.0015484809,0.00056180806,0.00029766664,0.0028347105,0.00008463612,0.002673317,0.0000048587035,0.3831615,0.42066237,0.18365441,0.00043852802,0.0040777246],"about_ca_topic_score_codex":0.00002898274,"about_ca_topic_score_gemma":0.000015468308,"teacher_disagreement_score":0.9248368,"about_ca_system_score_codex":0.00082716136,"about_ca_system_score_gemma":0.00044803388,"threshold_uncertainty_score":0.99967647},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019837018,0.001064019,0.9846299,0.00060251006,0.0008739573,0.00021143713,0.0000025995414,0.00020168192,0.01221551],"genre_scores_gemma":[0.38304424,0.00042102227,0.61062807,0.004348914,0.00084572687,0.000015755677,0.0000041430526,0.00006440091,0.00062771165],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970422,0.000034270408,0.00033322137,0.0014204672,0.0006167928,0.0005530646],"domain_scores_gemma":[0.9978301,0.00047042468,0.00016398692,0.0012308666,0.00012227299,0.00018237611],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008573289,0.00044532766,0.00043696718,0.0007851604,0.00029405972,0.00064323394,0.0024737387,0.00028781893,0.000031949203],"category_scores_gemma":[0.00005436387,0.00040462875,0.00011060974,0.00064572383,0.0010378932,0.00048710848,0.001347575,0.000720945,0.000022397067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004028928,0.000013670658,0.00010239656,0.00001709192,0.0000074899062,0.00006573281,0.00037557867,0.000566744,0.00003911553,0.23056497,0.000013442182,0.7682297],"study_design_scores_gemma":[0.00016700767,0.00018323901,0.00013596447,0.00026220974,0.000006941495,0.00014060228,1.1203593e-7,0.0610416,0.0003196691,0.9297911,0.007372858,0.0005787135],"about_ca_topic_score_codex":0.000008992869,"about_ca_topic_score_gemma":0.000031002608,"teacher_disagreement_score":0.767651,"about_ca_system_score_codex":0.00006855573,"about_ca_system_score_gemma":0.00017126268,"threshold_uncertainty_score":0.99984056},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002532398,0.0011013122,0.9892553,0.0006674407,0.00078101305,0.00017858967,0.0000014259336,0.00010596319,0.0076557333],"genre_scores_gemma":[0.29130256,0.00020963192,0.7032583,0.0034941477,0.0009840409,0.000007575233,0.000008243689,0.00003360983,0.00070191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748915,0.000021923803,0.00035034868,0.0011232343,0.0006182495,0.00039709013],"domain_scores_gemma":[0.99872905,0.00034850286,0.00013330212,0.0005508962,0.00010825457,0.00012998725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057592336,0.00032737886,0.00028942613,0.000649659,0.00030534153,0.0005827448,0.0010625226,0.00017624834,0.000044409706],"category_scores_gemma":[0.000043994685,0.0003176282,0.00006292678,0.00047578834,0.00023258262,0.00081385457,0.00061398017,0.00041522254,0.000027730375],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015551074,0.0000064270675,0.000014496341,0.000010833612,0.000004215155,0.000024212386,0.0002648928,0.036261924,0.00013511699,0.037188277,0.000010013662,0.926078],"study_design_scores_gemma":[0.0001992648,0.00008873476,0.00021457067,0.00022246868,0.000005830748,0.00013535086,6.839305e-8,0.6036602,0.0006705739,0.38597265,0.008283947,0.0005463026],"about_ca_topic_score_codex":0.0000079079,"about_ca_topic_score_gemma":0.0000129303835,"teacher_disagreement_score":0.92553174,"about_ca_system_score_codex":0.00010482183,"about_ca_system_score_gemma":0.00025243039,"threshold_uncertainty_score":0.9999276},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17082202,0.000013880612,0.8286574,0.00010489988,0.00024248795,0.000088061555,0.0000011689159,0.0000144278865,0.00005567667],"genre_scores_gemma":[0.96336454,0.0000013694951,0.036412567,0.00014545699,0.00006845064,0.0000010975981,0.0000026815787,0.0000035858536,2.3163575e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924296,0.000019603303,0.00016310955,0.00014954792,0.00025312926,0.00017163438],"domain_scores_gemma":[0.9994603,0.00026844288,0.000026028414,0.00019774071,0.000029847752,0.000017656173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039936745,0.00006814838,0.00007031472,0.0001311838,0.00003598548,0.00003177296,0.00027514674,0.000038713042,0.000006262346],"category_scores_gemma":[0.00014172799,0.000051687053,0.000013449782,0.0007346182,0.0000950175,0.00008059215,0.000013882973,0.00011705578,0.0000012345569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003862375,0.000016384172,0.00053806294,0.000008670285,3.3376247e-7,0.000005003171,0.0006234945,0.98687285,0.0021866194,0.00045720133,0.000020270332,0.009267221],"study_design_scores_gemma":[0.00009140979,0.000056891393,0.012109349,0.000031390104,4.985022e-7,0.000001826455,0.0000014635416,0.9711282,0.013751773,0.0027453597,0.000021302416,0.00006049408],"about_ca_topic_score_codex":0.000022807671,"about_ca_topic_score_gemma":0.00015801145,"teacher_disagreement_score":0.7925425,"about_ca_system_score_codex":0.00004146895,"about_ca_system_score_gemma":0.00002596043,"threshold_uncertainty_score":0.21077368},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50445706,0.0006028046,0.49355298,0.0002964231,0.0008608763,0.00009866762,0.0000016668853,0.00005146154,0.00007804283],"genre_scores_gemma":[0.93721384,0.0001898576,0.062005796,0.00031041497,0.0002542379,0.000006103198,0.0000033461954,0.000011296218,0.0000051349853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980907,0.000040956988,0.00020993921,0.0005726355,0.0006891668,0.00039660023],"domain_scores_gemma":[0.9990465,0.00013589095,0.000049673436,0.0005353827,0.00010334346,0.00012920992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027626666,0.00016873775,0.00034925799,0.00040126112,0.00023666573,0.000046657613,0.00025938576,0.00006706621,0.0000027025503],"category_scores_gemma":[0.000037117472,0.00013969089,0.00015310806,0.0013597506,0.00024829627,0.00012512044,0.00011005852,0.0003051157,0.000019491328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019136589,0.000103783896,0.02459708,0.000019749326,0.00003308519,0.00014192291,0.0034274487,0.20724389,0.0063360375,0.000017062863,0.00005082504,0.75800997],"study_design_scores_gemma":[0.00033526277,0.0002876078,0.021941502,0.00027438885,0.000018150993,0.000034913275,0.0000096769745,0.96608984,0.009294663,0.000795912,0.0005681828,0.00034991177],"about_ca_topic_score_codex":0.000034523844,"about_ca_topic_score_gemma":7.2661265e-7,"teacher_disagreement_score":0.7588459,"about_ca_system_score_codex":0.0002137503,"about_ca_system_score_gemma":0.00010289079,"threshold_uncertainty_score":0.56964296},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51571536,0.0000026938585,0.48154366,0.001693263,0.0008476002,0.00014702656,2.5287633e-7,0.000037370428,0.0000127549265],"genre_scores_gemma":[0.96364,4.833832e-7,0.031617478,0.004468913,0.00025129903,0.000009402812,1.5202403e-7,0.000011697734,5.906684e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99775726,0.00013723223,0.00024061908,0.0008876699,0.0004960401,0.00048116746],"domain_scores_gemma":[0.9898083,0.009662281,0.00009567836,0.0003285511,0.000051110765,0.00005406255],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0013393301,0.00018372694,0.00020001977,0.0004979237,0.00039645456,0.00017171944,0.00048618027,0.00008428118,0.000009892252],"category_scores_gemma":[0.01774841,0.00016797609,0.000041388583,0.0022819804,0.000463122,0.0007150028,0.000321438,0.0006657657,0.000005839866],"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.000030138484,0.000038904065,0.0037446634,0.0000059904683,5.9943557e-7,0.000006975521,0.0005438654,0.029349294,0.8945272,0.00009944935,0.0000020024388,0.071650945],"study_design_scores_gemma":[0.0007414086,0.000047678073,0.007894626,0.00003898062,8.7367766e-7,0.000030682888,0.0000014500159,0.46722043,0.5176288,0.006145448,0.000045502813,0.00020414659],"about_ca_topic_score_codex":0.00012728955,"about_ca_topic_score_gemma":0.00063773623,"teacher_disagreement_score":0.4499262,"about_ca_system_score_codex":0.00015159979,"about_ca_system_score_gemma":0.00009867223,"threshold_uncertainty_score":0.9905255},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000954196,0.00029176398,0.9930393,0.00070843037,0.0023574173,0.0005108692,0.0000020539555,0.00011802087,0.0020179497],"genre_scores_gemma":[0.2349733,0.000011973254,0.75750905,0.001512758,0.0027458586,0.000018176652,0.000010956007,0.000058785696,0.003159154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99457014,0.00015555474,0.00085062307,0.0021114806,0.0014128458,0.0008993498],"domain_scores_gemma":[0.997091,0.0006030531,0.00046389768,0.0012064883,0.00041277838,0.00022281407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018592534,0.00066915824,0.0006824683,0.0012005701,0.00024265354,0.0008144735,0.0031398511,0.0003429731,0.00003800797],"category_scores_gemma":[0.00007249151,0.0006531048,0.0001468314,0.0006947898,0.00030270347,0.0011765463,0.00075717666,0.0013505422,0.00011071029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007268386,0.000056180947,0.000147923,0.00001581436,0.0000062493486,0.000042358315,0.0017060756,0.25389767,0.00006682946,0.119471736,0.000004739391,0.62457716],"study_design_scores_gemma":[0.00028983006,0.00075813266,0.0027287833,0.0011413321,0.0000045178294,0.00006837741,6.012652e-7,0.89299655,0.0001377173,0.10004099,0.00095989864,0.0008732837],"about_ca_topic_score_codex":0.00006808026,"about_ca_topic_score_gemma":0.000109000575,"teacher_disagreement_score":0.6390989,"about_ca_system_score_codex":0.00079340185,"about_ca_system_score_gemma":0.0010453794,"threshold_uncertainty_score":0.999592},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039741765,0.00019901602,0.98890984,0.00040138833,0.0017084783,0.00027922523,0.000003515336,0.00012655971,0.004397821],"genre_scores_gemma":[0.9564586,0.000051080253,0.04183312,0.0007898924,0.00021017814,0.000004148261,0.0000054594984,0.000023499635,0.00062401354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659115,0.000037135243,0.00068898586,0.0010833316,0.0011230098,0.00047637365],"domain_scores_gemma":[0.99759966,0.00040126865,0.0004681756,0.0011726841,0.00023814068,0.000120089964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005391762,0.00044157676,0.0006006285,0.00087980943,0.00021458088,0.00024681052,0.0022563646,0.00024857678,0.00001687771],"category_scores_gemma":[0.000055440705,0.00040954835,0.00015210593,0.00051656994,0.00040020258,0.00046352562,0.0005491721,0.0008161379,0.000052995787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017700471,0.00006923911,0.00029217906,0.00004741219,0.000009786281,0.000011802517,0.0010752152,0.19805065,0.00011470718,0.0021484257,0.000119246644,0.7980436],"study_design_scores_gemma":[0.000322529,0.00038908052,0.00019745393,0.0007529982,0.000008025852,0.000011269518,3.478513e-7,0.994861,0.0007450023,0.0020437855,0.00024135617,0.00042712063],"about_ca_topic_score_codex":0.000017982115,"about_ca_topic_score_gemma":0.000029746665,"teacher_disagreement_score":0.9524844,"about_ca_system_score_codex":0.00023267078,"about_ca_system_score_gemma":0.00016961468,"threshold_uncertainty_score":0.9998356},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019282515,0.00053716387,0.993655,0.0003667562,0.002455353,0.00024055554,0.000007859339,0.0003979257,0.0023200614],"genre_scores_gemma":[0.008055383,0.00014966275,0.99090457,0.00028257194,0.00036819966,0.0000048101706,0.000012008333,0.00003345801,0.00018932001],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613863,0.000041732765,0.000514812,0.0019083641,0.00073986436,0.000656587],"domain_scores_gemma":[0.9950257,0.0014567988,0.00021956404,0.0031004495,0.000094932606,0.00010257846],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016581642,0.00046356051,0.0004984815,0.0010276049,0.00009624394,0.0002844321,0.006360304,0.00032342604,0.000013322192],"category_scores_gemma":[0.0007273058,0.00046103593,0.00005193027,0.0008217269,0.00035046312,0.0014686519,0.0027697033,0.0012348773,0.000040734092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022259387,0.000012306191,0.000029326733,0.00001550627,0.0000031371362,0.00020321184,0.00010890186,0.4141452,0.00004794124,0.0043403204,0.000012148619,0.5810798],"study_design_scores_gemma":[0.00026885324,0.00009385309,0.00088175404,0.00039749092,0.00000441712,0.00021065342,1.7388322e-7,0.44240388,0.0004110716,0.5486528,0.0057108784,0.000964139],"about_ca_topic_score_codex":0.000026163701,"about_ca_topic_score_gemma":0.00018140838,"teacher_disagreement_score":0.5801156,"about_ca_system_score_codex":0.00044555264,"about_ca_system_score_gemma":0.00033214205,"threshold_uncertainty_score":0.9997841},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004334067,0.0001359517,0.98750687,0.0016202624,0.0011360098,0.00097498356,0.0000038470007,0.0069062603,0.0017115081],"genre_scores_gemma":[0.008719376,0.000022105722,0.9877673,0.0014407854,0.0012266419,0.00024159045,0.000009561729,0.00004172216,0.0005309373],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959794,0.000026092759,0.0005885568,0.0017026124,0.0011230981,0.00058021845],"domain_scores_gemma":[0.9970426,0.00032195193,0.00026945537,0.0017350477,0.00042255386,0.00020840776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010002883,0.0004948754,0.0003842698,0.0013515716,0.00044937048,0.00053284795,0.0023072038,0.00027758974,0.000033107102],"category_scores_gemma":[0.00026374465,0.00049973733,0.000118339376,0.0008834894,0.0003168478,0.0005847148,0.001105548,0.0006639016,0.00007965891],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027871479,0.000025585032,0.00002523654,0.00001210677,0.0000044491326,0.00000775603,0.00017021666,0.0031118793,0.00019169158,0.0059259892,0.0014621418,0.98906016],"study_design_scores_gemma":[0.0001835792,0.00042536206,0.0003022381,0.0015505372,0.000019204253,0.00043545023,1.7348523e-7,0.035399016,0.01630607,0.87699664,0.06636123,0.0020204906],"about_ca_topic_score_codex":0.000019230853,"about_ca_topic_score_gemma":0.000008772701,"teacher_disagreement_score":0.9870397,"about_ca_system_score_codex":0.00081574067,"about_ca_system_score_gemma":0.0004563295,"threshold_uncertainty_score":0.9997454},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012911442,0.0005180903,0.98857164,0.0035958956,0.003266417,0.0008314836,0.000030933417,0.00030351488,0.001590892],"genre_scores_gemma":[0.16749777,0.000027277896,0.7988196,0.0324153,0.00097256526,0.000020699723,0.000039693557,0.00012223363,0.00008484351],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941671,0.00007674176,0.0007910234,0.0024767527,0.0012543668,0.001234002],"domain_scores_gemma":[0.995566,0.0009058174,0.0005435928,0.002101997,0.00058841734,0.00029413973],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009331291,0.0009947424,0.0009094156,0.0010076063,0.0007658254,0.0017056059,0.0052032284,0.0006304554,0.000027219136],"category_scores_gemma":[0.00003647278,0.00089847285,0.00023992102,0.0012766771,0.00024658605,0.0013120713,0.0014679475,0.0013877192,0.000014164674],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042024,0.0001682592,0.00029915548,0.002331282,0.00017082696,0.00026340343,0.010341344,0.18784368,0.0067283935,0.0983032,0.000118079704,0.69339037],"study_design_scores_gemma":[0.00070044893,0.00011406179,0.0001157623,0.0009706294,0.000046703415,0.00017906199,0.0000021638843,0.42607945,0.0026240863,0.55986625,0.0077683446,0.001533074],"about_ca_topic_score_codex":0.00008043461,"about_ca_topic_score_gemma":0.001509441,"teacher_disagreement_score":0.6918573,"about_ca_system_score_codex":0.00025929866,"about_ca_system_score_gemma":0.00082460226,"threshold_uncertainty_score":0.9993466},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013984478,0.00035455835,0.995968,0.00067689235,0.0006140916,0.00047231867,0.000021312258,0.000013967451,0.00048042077],"genre_scores_gemma":[0.63314176,0.00016035633,0.35830638,0.0017409287,0.0032410065,0.00014728014,0.0005618808,0.000090491456,0.0026099328],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985105,0.0000168266,0.0002590241,0.000724623,0.00025348284,0.00023553426],"domain_scores_gemma":[0.99912184,0.000037738308,0.00019723122,0.00037857177,0.0001891688,0.00007543428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027178694,0.00023049784,0.00016230455,0.00020451155,0.00010949993,0.00009545999,0.0004127385,0.0002567803,0.000032394393],"category_scores_gemma":[0.000053420168,0.00022046173,0.0000850897,0.00008181744,0.00019176754,0.000014490107,0.00009147452,0.00012486154,0.0000073464903],"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.0000139458325,0.000008760036,0.000010277433,0.000015366546,0.0000032289022,5.1895677e-7,0.00006283362,0.00044345186,0.65734553,0.00002230697,0.00013098962,0.34194282],"study_design_scores_gemma":[0.00042512137,0.00020852868,0.00017153597,0.0000928512,0.000012716702,0.000008103065,5.784342e-7,0.010993939,0.97187096,0.0023592443,0.013471553,0.00038485957],"about_ca_topic_score_codex":0.0000018179923,"about_ca_topic_score_gemma":0.000082654704,"teacher_disagreement_score":0.63766164,"about_ca_system_score_codex":0.000101303965,"about_ca_system_score_gemma":0.00022424695,"threshold_uncertainty_score":0.89901686},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013438794,0.00043617986,0.99424636,0.00066569645,0.00089588744,0.0009695809,0.0000072278244,0.00041940255,0.0023462318],"genre_scores_gemma":[0.07320923,0.00008409411,0.9245772,0.00090421294,0.00045016353,0.00007934875,0.000008285491,0.00004150284,0.0006459559],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613416,0.00003098235,0.00054592296,0.0016326666,0.000819835,0.0008364562],"domain_scores_gemma":[0.99743015,0.00041858508,0.000301909,0.001413455,0.00024885673,0.00018704413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008545579,0.0005843649,0.00053595053,0.0009412827,0.00043735196,0.00036385917,0.0037358825,0.00040352475,0.000004146772],"category_scores_gemma":[0.000067629866,0.0005145255,0.0002485337,0.00050641136,0.00077739,0.0007409703,0.0010344341,0.0007110475,0.0000063251728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015204827,0.000028947821,0.000017325236,0.000057490648,0.00001306908,0.00006955444,0.0009785112,0.0024998747,0.00004784387,0.06481756,0.00020992113,0.9312447],"study_design_scores_gemma":[0.00033800973,0.00055222673,0.000023862658,0.000477597,0.000008474978,0.00014968442,7.1958794e-8,0.054505255,0.0116766235,0.8955882,0.035588793,0.0010912089],"about_ca_topic_score_codex":0.0000048978186,"about_ca_topic_score_gemma":0.0000139348995,"teacher_disagreement_score":0.9301535,"about_ca_system_score_codex":0.00022560754,"about_ca_system_score_gemma":0.00035917282,"threshold_uncertainty_score":0.99973065},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011141305,0.00008676986,0.99345255,0.0010616038,0.0006337278,0.0012572288,0.000012077679,0.0007239033,0.0026606994],"genre_scores_gemma":[0.0721704,0.000054142914,0.92364943,0.003625053,0.00012917405,0.000042739826,0.00001045667,0.000055997378,0.00026262915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99467325,0.00011018553,0.0010700751,0.0019127907,0.001157272,0.0010764017],"domain_scores_gemma":[0.9967223,0.0003701474,0.00043542258,0.0018103197,0.00038146935,0.00028033045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019110774,0.0007576544,0.00085574714,0.002084885,0.00025066908,0.00060950354,0.004255559,0.00031562464,0.000037792757],"category_scores_gemma":[0.0000892609,0.0007269293,0.00013059693,0.0013163006,0.00031714686,0.00037119177,0.0016723897,0.0009456577,0.000053972486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007038082,0.00055043015,0.00066102546,0.0003624801,0.00005699772,0.00043787603,0.013682878,0.1927472,0.0012148629,0.08329651,0.0023988078,0.7045206],"study_design_scores_gemma":[0.0013021048,0.002193946,0.00040042266,0.004054604,0.00003249728,0.00013820789,0.0000024830392,0.6646876,0.0713282,0.23019218,0.020821674,0.004846085],"about_ca_topic_score_codex":0.000088471286,"about_ca_topic_score_gemma":0.000101993544,"teacher_disagreement_score":0.6996745,"about_ca_system_score_codex":0.00055471243,"about_ca_system_score_gemma":0.00053950935,"threshold_uncertainty_score":0.99951816},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015026123,0.0000114412,0.9907169,0.002558149,0.003559339,0.00091442256,0.000039800707,0.000033117736,0.0020165988],"genre_scores_gemma":[0.79359627,0.0000148790205,0.20238467,0.0009877867,0.0009955264,0.00018386017,0.00000730397,0.000043318312,0.0017864249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970376,0.00008873114,0.0006529003,0.00081183494,0.0011492888,0.00025965227],"domain_scores_gemma":[0.9789934,0.018457366,0.0005318771,0.0012101415,0.0007222552,0.00008497035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038510258,0.00025726864,0.00034760046,0.0006016524,0.000835688,0.000225581,0.002151451,0.00028585715,0.00012504065],"category_scores_gemma":[0.0039098733,0.00016795669,0.0001948339,0.00069151545,0.0012881224,0.00016893902,0.0001960383,0.0006298873,0.00007602379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016674934,0.00003110966,2.511326e-7,0.0000010808451,0.0000054311395,2.9294446e-7,0.00029840673,0.008827477,0.00050712354,0.9351108,0.00008576287,0.05511557],"study_design_scores_gemma":[0.00016536121,0.00019065558,0.0000051267534,0.000025708126,0.000012726333,0.0000065050467,0.0000024151884,0.020799667,0.0077900956,0.966324,0.00450491,0.00017286988],"about_ca_topic_score_codex":0.0000027318329,"about_ca_topic_score_gemma":0.000019908815,"teacher_disagreement_score":0.793446,"about_ca_system_score_codex":0.00005708827,"about_ca_system_score_gemma":0.00035574217,"threshold_uncertainty_score":0.6849075},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032308055,0.0002283293,0.99484366,0.0009091452,0.0010610782,0.00074873545,0.000011190538,0.00031082952,0.0015639608],"genre_scores_gemma":[0.025030501,0.000041564992,0.9710492,0.0028468608,0.0007400196,0.000025656891,0.000011242425,0.000055644272,0.0001993432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99568725,0.000032835953,0.00060707505,0.001958854,0.00089240604,0.0008215893],"domain_scores_gemma":[0.9970241,0.00040988385,0.00031715046,0.0016491269,0.00030461414,0.00029511738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045202894,0.00060214207,0.0005167208,0.001097323,0.00040214293,0.00037546846,0.0030786635,0.00027685505,0.000035826502],"category_scores_gemma":[0.000063555904,0.0006079234,0.00014933747,0.0016641107,0.00040964698,0.0007769701,0.0013438874,0.0008285865,0.00016058459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038972807,0.000019108214,0.0000055677897,0.000008105421,0.0000048862157,0.00002194704,0.0001429975,0.14047837,0.00048677696,0.0040845405,0.000020548727,0.8547233],"study_design_scores_gemma":[0.00021301788,0.00013697441,0.000028100081,0.00034763038,0.000012307908,0.00015563778,6.782805e-8,0.7369381,0.0021898937,0.25597653,0.0030533818,0.00094833213],"about_ca_topic_score_codex":0.0000114226195,"about_ca_topic_score_gemma":0.00013814893,"teacher_disagreement_score":0.8537749,"about_ca_system_score_codex":0.00044153177,"about_ca_system_score_gemma":0.0003255531,"threshold_uncertainty_score":0.9996372},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010550696,0.0019686592,0.9955422,0.0001135101,0.00075867085,0.00057424774,0.000057347013,0.00005002691,0.000829787],"genre_scores_gemma":[0.82465094,0.000063991676,0.17487046,0.00010030655,0.00016633893,0.0000061129867,0.000075814336,0.000021191268,0.000044824454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996404,0.00007493284,0.0010511905,0.0011551041,0.001003365,0.00031139088],"domain_scores_gemma":[0.9963531,0.00036541262,0.00096272206,0.001836765,0.00039111992,0.00009089374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015262929,0.00031614405,0.00057567365,0.00060312205,0.000105729516,0.0002251705,0.002574391,0.00028101864,8.756241e-7],"category_scores_gemma":[0.00006928106,0.0002932536,0.00005100275,0.0005311354,0.00046400377,0.0005801854,0.0005171165,0.00021639446,0.0000016161213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012661199,0.000030180527,0.0001747664,0.00027518673,0.000016400329,0.000006706053,0.00023606376,0.85930943,0.0014827223,0.009652143,0.000026092937,0.12877764],"study_design_scores_gemma":[0.00034375343,0.000092673494,0.00017351794,0.00026770428,0.000018559513,0.000015071591,3.9591464e-7,0.98921037,0.0003726228,0.009188301,0.000046362245,0.0002706957],"about_ca_topic_score_codex":0.00009809186,"about_ca_topic_score_gemma":0.000025781463,"teacher_disagreement_score":0.82454544,"about_ca_system_score_codex":0.00009305957,"about_ca_system_score_gemma":0.00024113481,"threshold_uncertainty_score":0.99995196},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001262892,0.00031799238,0.9955284,0.000673168,0.0007453296,0.00044052428,0.000014087734,0.00011016378,0.0009074273],"genre_scores_gemma":[0.16907853,0.00020248606,0.8271168,0.003223534,0.0002536812,0.000025513242,0.000037925776,0.000039751652,0.000021800128],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996692,0.00005701088,0.0005189108,0.0013911992,0.00074634206,0.0005945391],"domain_scores_gemma":[0.9981982,0.00012916392,0.00024497983,0.0010023284,0.0002034442,0.0002218783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082858943,0.00045420747,0.00036638384,0.0013428378,0.00044650177,0.0009227064,0.0013851525,0.00017784006,0.00008046657],"category_scores_gemma":[0.00001107366,0.0004412418,0.000104257,0.000899492,0.0005601377,0.0011044244,0.0005039055,0.00042732348,0.0000040501263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032375456,0.00004430327,0.0033915415,0.000029842004,0.000017746917,0.000025159157,0.003211246,0.0003786029,0.000068190384,0.24931571,0.00008053538,0.7434339],"study_design_scores_gemma":[0.0011304596,0.00081019255,0.0048634745,0.00013291673,0.000031413758,0.00013086635,0.000010658985,0.04178037,0.0008043358,0.9408982,0.0077107023,0.0016964524],"about_ca_topic_score_codex":0.000050209343,"about_ca_topic_score_gemma":0.00065279123,"teacher_disagreement_score":0.7417374,"about_ca_system_score_codex":0.000081610124,"about_ca_system_score_gemma":0.00019676953,"threshold_uncertainty_score":0.99980396},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035123728,0.00054414995,0.99310607,0.00072394084,0.0026892645,0.0011980368,0.00001559354,0.0004576345,0.00091407466],"genre_scores_gemma":[0.09715607,0.000046921683,0.90121555,0.0007861299,0.0006400695,0.000037535545,0.000007775753,0.0000561412,0.000053788597],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951945,0.000034562323,0.0006724452,0.0020410588,0.0010565105,0.0010009309],"domain_scores_gemma":[0.9961051,0.000829021,0.00037626264,0.001971464,0.00045919113,0.00025895686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012164558,0.0007492652,0.00071528973,0.0021727993,0.0005371975,0.0007056806,0.00428911,0.0006842269,0.000017328552],"category_scores_gemma":[0.00008765931,0.00064555666,0.00042679146,0.001302444,0.0015156075,0.0002164753,0.0010274403,0.0012933115,0.000019417672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020463649,0.00016393271,0.000058040925,0.00014411447,0.000045495006,0.00006447111,0.0006784984,0.008913463,0.004007761,0.3519542,0.00003099784,0.6339186],"study_design_scores_gemma":[0.00055206346,0.00062200666,0.00023404218,0.0005395666,0.000038046073,0.0000808934,1.8951512e-7,0.21782413,0.034457367,0.7395291,0.0044748504,0.0016477696],"about_ca_topic_score_codex":0.00002736635,"about_ca_topic_score_gemma":0.000049625727,"teacher_disagreement_score":0.6322708,"about_ca_system_score_codex":0.00010127214,"about_ca_system_score_gemma":0.0003717601,"threshold_uncertainty_score":0.9995996},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014791306,0.0010528648,0.9702287,0.0009814946,0.0027352998,0.0008176436,0.000006709115,0.00031843953,0.023844112],"genre_scores_gemma":[0.045874827,0.000069436384,0.94584674,0.0029944074,0.0010628778,0.00006191053,0.000009242987,0.000082857354,0.0039976966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541706,0.000053853248,0.00052009965,0.0020606986,0.00087238336,0.0010759236],"domain_scores_gemma":[0.9960611,0.0010754401,0.0003346893,0.0017216762,0.00055027497,0.0002568296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016613298,0.0007438642,0.0007388607,0.00074898463,0.0005229228,0.0009886207,0.0044340044,0.000514188,0.000028566174],"category_scores_gemma":[0.00041593675,0.00062606693,0.00027840983,0.00078112696,0.0010924753,0.0005556465,0.0013048763,0.0008482477,0.000088704444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000110318615,0.000057840734,0.000010944712,0.00006276747,0.000019006344,0.000040666862,0.001361291,0.003035689,0.00002216421,0.80242044,0.00004723151,0.19291095],"study_design_scores_gemma":[0.0007044875,0.00028703912,0.000028313485,0.00032184419,0.000014682123,0.00009666738,2.8902423e-7,0.07911827,0.00041116113,0.9126944,0.0055150627,0.000807791],"about_ca_topic_score_codex":0.000017355922,"about_ca_topic_score_gemma":0.000112160546,"teacher_disagreement_score":0.19210316,"about_ca_system_score_codex":0.00052429794,"about_ca_system_score_gemma":0.0017327899,"threshold_uncertainty_score":0.99961907},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040509546,0.0008081694,0.9966928,0.00024433012,0.00076139125,0.0004621732,0.0000022221445,0.0004031723,0.00022067076],"genre_scores_gemma":[0.04750684,0.000024311414,0.9514325,0.0007501,0.00021282911,0.000010815145,0.0000056677522,0.000038820417,0.000018104396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964252,0.000100490906,0.0005028548,0.001444879,0.0007958271,0.000730711],"domain_scores_gemma":[0.99774295,0.00043016314,0.000338107,0.001241455,0.00011587524,0.00013143387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015377464,0.0005232043,0.00049403135,0.0014265132,0.00019037948,0.0006502014,0.0022049623,0.000372012,0.0000072446405],"category_scores_gemma":[0.00021967577,0.00051277276,0.000103635386,0.0011461555,0.00023997563,0.00083765446,0.00044442143,0.0010319044,0.0000030951899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005486645,0.00007781408,0.00007625883,0.000056516194,0.000003903606,0.00005353596,0.000408914,0.8009543,0.00011948191,0.002220816,0.0000053282265,0.19601767],"study_design_scores_gemma":[0.00018969487,0.0001085841,0.000051336236,0.0002942286,0.0000063452326,0.000073613905,1.001139e-7,0.97089374,0.0008271943,0.0253147,0.0016015056,0.0006389318],"about_ca_topic_score_codex":0.00011164416,"about_ca_topic_score_gemma":0.000021404729,"teacher_disagreement_score":0.19537874,"about_ca_system_score_codex":0.00041739046,"about_ca_system_score_gemma":0.00038044926,"threshold_uncertainty_score":0.9997324},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022101842,0.00005836197,0.9864353,0.0008734979,0.0012422274,0.0006432373,0.000002835804,0.0004646751,0.010257764],"genre_scores_gemma":[0.006901784,0.000006430092,0.9862889,0.00607654,0.0004006628,0.000027384678,0.0000040477,0.000035776473,0.00025848675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955476,0.000030173007,0.00053085963,0.0017783287,0.001385129,0.00072791777],"domain_scores_gemma":[0.99717337,0.0002538836,0.00020699002,0.001703477,0.0002472112,0.00041504932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010713926,0.00051289675,0.00048221598,0.0010273666,0.00024163187,0.000985816,0.00511038,0.00034199256,0.0000378409],"category_scores_gemma":[0.00020656617,0.00045953784,0.00012166323,0.00074776984,0.0007813062,0.0009150058,0.0023022187,0.0015031598,0.00007005022],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031174666,0.00004550864,0.0000075125677,0.000040326948,0.000005421069,0.00007815589,0.0010235577,0.00087604544,0.011685352,0.007888348,0.00013934438,0.9782073],"study_design_scores_gemma":[0.0004570313,0.0003434212,0.000089494635,0.0004054406,0.000012736468,0.00029170708,4.0047402e-7,0.71752334,0.12201933,0.15519272,0.001708324,0.0019560507],"about_ca_topic_score_codex":0.000016927654,"about_ca_topic_score_gemma":0.000009863265,"teacher_disagreement_score":0.97625124,"about_ca_system_score_codex":0.00019000014,"about_ca_system_score_gemma":0.0003046275,"threshold_uncertainty_score":0.99978566},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012995787,0.00025624997,0.9625593,0.00031110938,0.0017942198,0.00020925772,0.00000983376,0.00016534174,0.03339515],"genre_scores_gemma":[0.9434332,0.000013277755,0.053790018,0.0014245217,0.00026931165,0.0000078140665,0.000011111189,0.000043776705,0.0010069585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99685794,0.00006827009,0.0005255216,0.0011132061,0.00087458955,0.000560491],"domain_scores_gemma":[0.996781,0.0005586924,0.0003030661,0.0020164077,0.00021844418,0.00012241921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009570991,0.0005005891,0.0004952239,0.001349569,0.00039935522,0.0003166561,0.0031702744,0.0002910408,0.00007687898],"category_scores_gemma":[0.000052360156,0.00045805343,0.0003253271,0.00097049103,0.0011218206,0.00040689143,0.00094639696,0.0009534459,0.00005213858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003716699,0.00023956348,0.00022186847,0.000051919953,0.000047210793,0.000045439454,0.0008974269,0.011949426,0.00048492092,0.57713866,0.00052010163,0.40836632],"study_design_scores_gemma":[0.00047766315,0.0011604271,0.0018892669,0.00073642615,0.000022975924,0.00006034375,6.184987e-7,0.021773865,0.002594141,0.96057135,0.009467256,0.0012456451],"about_ca_topic_score_codex":0.000028999932,"about_ca_topic_score_gemma":0.000029862562,"teacher_disagreement_score":0.9421336,"about_ca_system_score_codex":0.00013463655,"about_ca_system_score_gemma":0.00030360615,"threshold_uncertainty_score":0.9997871},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029944093,0.0007694262,0.9880859,0.00021271603,0.0011672082,0.0004076487,0.0000036020394,0.00022941908,0.008824599],"genre_scores_gemma":[0.13006137,0.000039836003,0.8674003,0.0020092877,0.00040080672,0.0000026480648,0.0000080319305,0.000039356248,0.0000383464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951271,0.000049081624,0.0006967379,0.0021311447,0.0009942353,0.0010017405],"domain_scores_gemma":[0.99734986,0.0005318909,0.00035655004,0.0012619974,0.00025035883,0.00024935981],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00173239,0.0007107199,0.00073229196,0.00090182014,0.00043906015,0.001011288,0.003028787,0.00044429852,0.0000072434495],"category_scores_gemma":[0.000091583715,0.0006105888,0.00011524032,0.0007475309,0.0009678755,0.0005002495,0.0025822956,0.0011877109,0.000021475114],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004737595,0.00003693624,0.00007207644,0.000105556675,0.000011446013,0.00012582229,0.001519915,0.011643197,0.00001303038,0.02839151,0.000007823531,0.95806795],"study_design_scores_gemma":[0.00028948332,0.0001303598,0.00014695145,0.0006103791,0.000007700423,0.00017946749,6.437674e-7,0.92649436,0.000060597104,0.07092434,0.00036503005,0.0007907161],"about_ca_topic_score_codex":0.000055797325,"about_ca_topic_score_gemma":0.000014765026,"teacher_disagreement_score":0.95727724,"about_ca_system_score_codex":0.00019076696,"about_ca_system_score_gemma":0.00024934404,"threshold_uncertainty_score":0.99963456},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013386532,0.003718182,0.99182653,0.0010910849,0.00025143073,0.0025202895,7.5787005e-7,0.00010593128,0.00035195093],"genre_scores_gemma":[0.5508606,0.002030709,0.44538715,0.00089812843,0.00056173716,0.00015247347,0.0000024469139,0.000055882385,0.000050877195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970364,0.000042565112,0.00038671246,0.0014235248,0.0003726856,0.0007381439],"domain_scores_gemma":[0.9983107,0.00071618933,0.00013985542,0.0005898433,0.00010317158,0.00014026687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015235564,0.00040683517,0.000496769,0.0004434899,0.00024219975,0.0005778263,0.0012304103,0.00034758914,7.194135e-7],"category_scores_gemma":[0.000027566926,0.00038387362,0.00004424912,0.0003391116,0.00022692497,0.0004141119,0.00094682496,0.00073357666,6.415993e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039634074,0.000013837068,0.0000610146,0.000057746856,0.0000040812365,0.000022052456,0.00096236204,0.025249226,0.0000061309293,0.010212117,8.378316e-7,0.9634066],"study_design_scores_gemma":[0.00033075854,0.00021514094,0.0011533292,0.00066835235,0.000002950867,0.00005301708,3.9121642e-7,0.94739354,0.00001820471,0.049487453,0.00025364078,0.00042324825],"about_ca_topic_score_codex":0.000008739616,"about_ca_topic_score_gemma":0.00017901415,"teacher_disagreement_score":0.96298337,"about_ca_system_score_codex":0.00015244939,"about_ca_system_score_gemma":0.00016966525,"threshold_uncertainty_score":0.9998613},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013788001,0.00044487076,0.8908809,0.0021928833,0.0011551961,0.00043145235,0.000004102789,0.00008978955,0.10466291],"genre_scores_gemma":[0.9801425,0.0001667916,0.015227553,0.0007353363,0.00094530755,0.000010654147,0.0000062274326,0.000023494464,0.0027421436],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997778,0.000054065025,0.0003393881,0.00062258105,0.0007389287,0.00046705228],"domain_scores_gemma":[0.99884295,0.0004122572,0.00017066576,0.00028139877,0.00017983242,0.0001128694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000861919,0.00020998552,0.00027028352,0.000618034,0.0005221117,0.00035964054,0.0008568579,0.0003163612,0.00020529384],"category_scores_gemma":[0.00038251176,0.00021137476,0.000052547475,0.0006343185,0.00078321,0.00048170937,0.0001604499,0.0005142396,0.000037174363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004727286,0.000028947192,0.001436031,0.000014841574,0.000005798786,0.0000555145,0.011897697,0.013263141,0.000016449503,0.3257634,0.000030334115,0.6474831],"study_design_scores_gemma":[0.001142744,0.00013986895,0.0054806494,0.0012159374,0.00003348527,0.000009896775,0.000008867337,0.39445204,0.00010377598,0.48282832,0.11272216,0.0018622398],"about_ca_topic_score_codex":0.0006842037,"about_ca_topic_score_gemma":0.005357285,"teacher_disagreement_score":0.9800046,"about_ca_system_score_codex":0.00034205525,"about_ca_system_score_gemma":0.00033429117,"threshold_uncertainty_score":0.86196125},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008688838,0.000097213226,0.99599946,0.0003702621,0.00041319386,0.0007242538,0.00005406594,0.000098158096,0.0021565324],"genre_scores_gemma":[0.4156988,0.000012765698,0.58346385,0.00025225588,0.0002991894,0.00006172515,0.00003537807,0.000019907868,0.0001561089],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774504,0.000010030515,0.00047129922,0.0009356779,0.00052936136,0.00030860037],"domain_scores_gemma":[0.99779165,0.00017396432,0.00033266935,0.0014266522,0.00020457199,0.00007050623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006408876,0.00025706808,0.00032274242,0.00045523656,0.00011576356,0.00022388097,0.0025448338,0.00013224641,0.000004062002],"category_scores_gemma":[0.000011192846,0.00023861657,0.0000954481,0.0003101518,0.0001559303,0.000412487,0.0008393282,0.00017317696,0.000014461467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022271772,0.00002210638,0.000026534331,0.0002487557,0.000008751411,0.0000040643863,0.00011394835,0.006681029,0.0001266025,0.3679344,0.000032680007,0.6247989],"study_design_scores_gemma":[0.00032832383,0.00012520248,0.00014911388,0.00079695054,0.000013847962,0.000020129515,3.3886337e-7,0.96023923,0.0010332358,0.021914512,0.014940136,0.00043898314],"about_ca_topic_score_codex":0.000015589063,"about_ca_topic_score_gemma":0.00002640333,"teacher_disagreement_score":0.9535582,"about_ca_system_score_codex":0.00022817461,"about_ca_system_score_gemma":0.00021697975,"threshold_uncertainty_score":0.9730502},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002743295,0.00014642523,0.9933451,0.0024550962,0.0009807661,0.00030132392,0.000006342013,0.000059020047,0.0026784989],"genre_scores_gemma":[0.22770971,0.00001071727,0.75925136,0.011691116,0.000973409,0.000021211403,0.000009430609,0.00003885837,0.00029419106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699306,0.00008217031,0.0004737721,0.0010267686,0.0008632204,0.0005609795],"domain_scores_gemma":[0.99823123,0.00024231324,0.00023392512,0.00093807775,0.00021755004,0.00013688367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010121601,0.0003642239,0.00046424696,0.0005223084,0.00030467732,0.0004428019,0.0024385578,0.00014105126,0.000014925029],"category_scores_gemma":[0.000074612835,0.00026919783,0.00022545327,0.0012965745,0.00042012372,0.0002194993,0.0005151566,0.00052050373,0.000020519821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002503839,0.000023707977,0.000016096723,0.000014280442,0.000008843304,0.000006531998,0.00022473895,0.570027,0.0000583062,0.0028364365,0.0001381391,0.42664343],"study_design_scores_gemma":[0.00009772506,0.000051558152,0.000028906303,0.000104008155,0.000015056299,0.000012233952,3.5480699e-7,0.98000234,0.0012261202,0.01643147,0.0016393572,0.00039084203],"about_ca_topic_score_codex":0.000014481143,"about_ca_topic_score_gemma":0.000033079283,"teacher_disagreement_score":0.42625257,"about_ca_system_score_codex":0.00007625143,"about_ca_system_score_gemma":0.0002349081,"threshold_uncertainty_score":0.99997604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029000998,0.0022012165,0.991086,0.00008034143,0.003742131,0.00091545645,0.000051476967,0.00021835513,0.0014149882],"genre_scores_gemma":[0.9849681,0.00013515024,0.013485663,0.00020304619,0.0004989865,0.00011610645,0.000026125344,0.000046435933,0.0005203802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99501616,0.00007297156,0.000969925,0.0018449902,0.0011648999,0.00093106634],"domain_scores_gemma":[0.9972555,0.00022515864,0.0004262756,0.0016076639,0.00025681005,0.000228586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008803569,0.00065499207,0.00080829527,0.00081679795,0.00022256357,0.00086331076,0.002909429,0.0005026626,0.000011347677],"category_scores_gemma":[0.00005045546,0.00062156323,0.00015782271,0.0012903725,0.00031049937,0.0006442427,0.0007495661,0.00094572006,0.00010002982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006640619,0.00009465659,0.00010094129,0.00013522452,0.000015573734,0.00037295878,0.00046951202,0.2660851,0.000121810284,0.006344494,0.000072439594,0.7261807],"study_design_scores_gemma":[0.00047314077,0.00021617213,0.000238486,0.00085766404,0.0000058667515,0.00018056203,7.0831805e-7,0.97387195,0.00035998938,0.0056732376,0.017196123,0.0009261048],"about_ca_topic_score_codex":0.00012947473,"about_ca_topic_score_gemma":0.00016867409,"teacher_disagreement_score":0.9846781,"about_ca_system_score_codex":0.000978166,"about_ca_system_score_gemma":0.00020411825,"threshold_uncertainty_score":0.9996236},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034451624,0.0026888063,0.98948187,0.0009753085,0.005015531,0.000746757,0.0000051597913,0.00032510006,0.00041697992],"genre_scores_gemma":[0.06624943,0.004926159,0.9166135,0.010882601,0.0007341948,0.000025797246,0.00001358958,0.00010357419,0.00045114494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99356854,0.00010618262,0.0010292028,0.0021166333,0.002028492,0.0011509421],"domain_scores_gemma":[0.99439555,0.0008855723,0.00074608036,0.0030479156,0.0006611109,0.00026379144],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0017261982,0.0008789601,0.00082958216,0.0012211015,0.0006309214,0.0033245392,0.0050634183,0.0007278999,0.000051412422],"category_scores_gemma":[0.00012581877,0.00085192546,0.00027663054,0.0012384116,0.0008773951,0.015543577,0.0017063288,0.0011730093,0.00018775479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016275335,0.000029666619,0.000026961594,0.000056389406,0.000015207804,0.000028228515,0.0074536363,0.09506485,0.000027431017,0.0021850856,0.000053226162,0.895043],"study_design_scores_gemma":[0.00030973917,0.00023098488,0.00016296052,0.0009702019,0.000012145779,0.000086408385,0.0000024566177,0.9602606,0.005930507,0.019595372,0.011369321,0.0010692956],"about_ca_topic_score_codex":0.000022359794,"about_ca_topic_score_gemma":0.000011081878,"teacher_disagreement_score":0.89397377,"about_ca_system_score_codex":0.000596693,"about_ca_system_score_gemma":0.0005509835,"threshold_uncertainty_score":0.99939317},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010447977,0.00012105297,0.9897762,0.00041360356,0.00028914478,0.0003404337,0.0000044483218,0.00030857374,0.007701725],"genre_scores_gemma":[0.55018973,0.00020221369,0.44883797,0.0004791354,0.00009175924,0.000011205223,0.0000043655955,0.00002071666,0.0001628982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997326,0.000025861224,0.00053294253,0.0010516124,0.0006442552,0.00041933393],"domain_scores_gemma":[0.99732757,0.00033926967,0.000434773,0.001362559,0.00042185557,0.000113976814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044086794,0.0003944201,0.00044624007,0.00075078616,0.0002986434,0.00010074483,0.0030558466,0.00025626205,0.0000049547534],"category_scores_gemma":[0.00010730843,0.00035897162,0.00010232773,0.00072367326,0.0006034567,0.00031582578,0.00068672496,0.0006097899,0.000015373507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008165608,0.000107981294,0.00057156914,0.00008161348,0.000010227988,0.000009311194,0.0012174512,0.463116,0.00005850541,0.0054171006,0.00013714128,0.5292649],"study_design_scores_gemma":[0.00021562296,0.0003426367,0.0021723572,0.0004728591,0.000005107537,0.00005337863,6.402647e-8,0.98000205,0.0061910744,0.00940142,0.00053392106,0.00060949894],"about_ca_topic_score_codex":0.00000869154,"about_ca_topic_score_gemma":0.00000668215,"teacher_disagreement_score":0.5491449,"about_ca_system_score_codex":0.00016814859,"about_ca_system_score_gemma":0.00053947966,"threshold_uncertainty_score":0.9998862},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001014644,0.00042243197,0.9465161,0.000594977,0.00071461877,0.00041256603,0.000028694241,0.000032126,0.051177043],"genre_scores_gemma":[0.8879719,0.000185724,0.10926666,0.00030015295,0.0010736993,0.00003373143,0.000029046529,0.000036880327,0.0011021971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977643,0.00008188547,0.0003776343,0.00041610678,0.0010278275,0.00033226016],"domain_scores_gemma":[0.9977721,0.0011972272,0.00031731185,0.00028056538,0.00035883562,0.00007394531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021674696,0.00020414301,0.0003010326,0.00013009094,0.0005055738,0.00011622407,0.0016155691,0.00028444963,0.00015879059],"category_scores_gemma":[0.00023859183,0.00020294057,0.00012615856,0.00018505556,0.0011258002,0.0003137361,0.00037183045,0.00025877054,0.0000064324013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007428479,0.00009754004,0.00006397873,0.00008744446,0.000045419583,7.0783216e-7,0.071433246,0.0023770838,0.000044339256,0.67841625,0.00017710753,0.2471826],"study_design_scores_gemma":[0.0005294495,0.000085716005,0.000055622182,0.00038809958,0.00004683928,7.406683e-7,0.00010727439,0.19705564,0.00021041727,0.79466224,0.006272686,0.00058529986],"about_ca_topic_score_codex":0.0001291092,"about_ca_topic_score_gemma":0.0020690034,"teacher_disagreement_score":0.88787043,"about_ca_system_score_codex":0.0004183271,"about_ca_system_score_gemma":0.00051182514,"threshold_uncertainty_score":0.82756764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004530317,0.00041129164,0.9971739,0.00026291423,0.00050615374,0.0006399085,0.0000025597496,0.00037440218,0.00017582024],"genre_scores_gemma":[0.18824191,0.000074424264,0.8108493,0.00037604335,0.00013834097,0.000017699607,0.0000043998134,0.00004080488,0.0002570836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996327,0.000021169013,0.000559453,0.0017195375,0.00069982273,0.00067303487],"domain_scores_gemma":[0.99730575,0.0006564818,0.00043317894,0.0011476331,0.00028095773,0.00017598197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010022622,0.00057161314,0.0006261806,0.0011710124,0.00035100715,0.00041213483,0.0015321911,0.00039382256,0.0000016977783],"category_scores_gemma":[0.000114051174,0.0005516978,0.00015677094,0.00048062083,0.0004677286,0.0011085859,0.00085512473,0.0007144255,0.0000033761514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001593497,0.00005057953,0.00005783765,0.00008241246,0.000015771702,0.00004033813,0.0007829811,0.04079197,0.005948209,0.015178107,0.00000911232,0.93702674],"study_design_scores_gemma":[0.00027144016,0.00010057373,0.00011155269,0.00041550354,0.000017107208,0.000041592823,2.751278e-7,0.9174881,0.0049888305,0.075883575,0.000092559276,0.00058891607],"about_ca_topic_score_codex":0.000014850021,"about_ca_topic_score_gemma":0.00015557132,"teacher_disagreement_score":0.93643785,"about_ca_system_score_codex":0.00031903898,"about_ca_system_score_gemma":0.00023406114,"threshold_uncertainty_score":0.99969345},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014647461,0.00032459982,0.97134227,0.0003708954,0.0011092963,0.00019225811,0.000007659075,0.000044797318,0.025143476],"genre_scores_gemma":[0.19723372,0.00009293009,0.7922617,0.0023158162,0.0014701342,0.000009251953,0.000005123457,0.00005998468,0.006551307],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940622,0.0001373492,0.00084181037,0.0019699757,0.0024193292,0.000569335],"domain_scores_gemma":[0.99204046,0.005472578,0.00045594684,0.0013758705,0.00043775863,0.00021736136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007823077,0.0004455229,0.000941083,0.0031985098,0.0003021411,0.0007102116,0.0022257958,0.0003538485,0.00039093956],"category_scores_gemma":[0.0071097664,0.00034576422,0.00026319124,0.0035291214,0.0012466104,0.00025576734,0.0011488857,0.0006869665,0.000042785257],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011032473,0.0000061025144,0.002144077,0.0000026000378,0.000013993881,0.000058549074,0.000249837,0.007416007,0.000007096926,0.0010731183,0.00006003779,0.9889575],"study_design_scores_gemma":[0.00019124355,0.00012233926,0.008165832,0.00008718013,0.000102285594,0.00009264963,2.510186e-7,0.20507695,0.00006888582,0.7703459,0.015093616,0.0006528311],"about_ca_topic_score_codex":0.000034617373,"about_ca_topic_score_gemma":0.0003757989,"teacher_disagreement_score":0.98830473,"about_ca_system_score_codex":0.00014833327,"about_ca_system_score_gemma":0.00036952784,"threshold_uncertainty_score":0.99989945},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032465345,0.0006744174,0.99544495,0.0001033052,0.00095616886,0.0006105635,0.000026845684,0.000069225316,0.0020820415],"genre_scores_gemma":[0.54932684,0.000022255113,0.45028692,0.00013691832,0.00010480782,0.00002281886,0.000041898904,0.00001312785,0.000044396573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636644,0.00017873998,0.001430781,0.0006305267,0.001082802,0.00031069032],"domain_scores_gemma":[0.99646544,0.0005884619,0.001384532,0.000934484,0.0005581216,0.000068972404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001636966,0.00033128483,0.00068560644,0.0006619421,0.00009192779,0.00022821549,0.0019472617,0.0003502525,0.0000016595279],"category_scores_gemma":[0.00015285792,0.00028179926,0.0001401045,0.0005845632,0.00043691456,0.00056497194,0.0002097246,0.0002472964,0.0000046465984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067028705,0.000020500618,0.000046303037,0.00013328585,0.000006356214,0.0000014743259,0.00006956548,0.9453701,0.0003757846,0.012535553,0.000032981447,0.041401427],"study_design_scores_gemma":[0.00030921455,0.00015089613,0.000147621,0.00019210803,0.000013188861,0.000008981118,3.331393e-7,0.9759694,0.0009600529,0.021893794,0.00007772664,0.00027672015],"about_ca_topic_score_codex":0.00012902361,"about_ca_topic_score_gemma":0.0000064626242,"teacher_disagreement_score":0.54929435,"about_ca_system_score_codex":0.00015031191,"about_ca_system_score_gemma":0.00026986498,"threshold_uncertainty_score":0.9999634},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004894373,0.00004730978,0.9936881,0.0007679398,0.00010884612,0.0003790239,0.0000041270805,0.000013780971,0.00009651179],"genre_scores_gemma":[0.9213433,0.000001355028,0.078375176,0.0001829123,0.000064314605,0.000001928924,6.362828e-7,0.000009491556,0.000020887917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900395,0.000010894544,0.00022602732,0.00026605558,0.00036598733,0.00012710903],"domain_scores_gemma":[0.99902487,0.0001289688,0.00022860727,0.0004567056,0.00013884966,0.00002198474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018453063,0.000118656455,0.00020762491,0.00008802679,0.00008575017,0.000008100717,0.00031639228,0.00007434591,0.0000128488355],"category_scores_gemma":[0.00006272917,0.00007345892,0.00017068925,0.00023304827,0.00042072753,0.000055365264,0.00026381845,0.00037240415,1.9096535e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023236464,0.00011956787,0.0003345406,0.0000839958,0.000007403693,9.3697645e-7,0.00007442081,0.79451215,0.109698355,0.015096604,0.0000013610239,0.080047406],"study_design_scores_gemma":[0.0001899898,0.00007634748,0.001167447,0.0013009675,0.000029114583,0.000030519423,7.7966305e-8,0.66752553,0.12004412,0.20943677,0.00008511874,0.0001139706],"about_ca_topic_score_codex":0.000014536742,"about_ca_topic_score_gemma":0.0000064310384,"teacher_disagreement_score":0.91644895,"about_ca_system_score_codex":0.00020600285,"about_ca_system_score_gemma":0.00027526758,"threshold_uncertainty_score":0.29955676},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034323128,0.00074826635,0.9916585,0.0005509494,0.0027349037,0.00026587787,0.0000050863746,0.00027284253,0.0034203152],"genre_scores_gemma":[0.6546491,0.00018242118,0.33127704,0.011611879,0.001086117,0.000020899599,0.000011128332,0.000135011,0.001026436],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99557304,0.00008215039,0.0005361929,0.001835216,0.001081255,0.0008921141],"domain_scores_gemma":[0.9968752,0.00048569264,0.00027637673,0.0020117222,0.00012873222,0.0002222247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016148324,0.0006311178,0.0005805242,0.00082101516,0.0003903885,0.00081761746,0.0042326185,0.00035650338,0.00006517923],"category_scores_gemma":[0.00009853064,0.0005894345,0.00020162211,0.0006050076,0.00041011232,0.00070378283,0.0012614956,0.0011641006,0.00008614302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025174027,0.00004794999,0.00024498824,0.000103067665,0.000028277374,0.0004910179,0.0019102623,0.008287163,0.00044286615,0.115199916,0.00007285869,0.8731691],"study_design_scores_gemma":[0.00043282608,0.0001588367,0.00016315751,0.0010456577,0.00001614235,0.00037296407,8.192234e-7,0.34841335,0.0035978484,0.6368421,0.0071052387,0.0018511146],"about_ca_topic_score_codex":0.000015298749,"about_ca_topic_score_gemma":0.000012850953,"teacher_disagreement_score":0.871318,"about_ca_system_score_codex":0.0003259716,"about_ca_system_score_gemma":0.00029342918,"threshold_uncertainty_score":0.9996557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001270311,0.00009051419,0.99662554,0.00016709138,0.00012494178,0.000558619,0.000015469359,0.00007376067,0.0022170385],"genre_scores_gemma":[0.009170524,0.00005369684,0.99021965,0.0001821233,0.00017264878,0.000004993248,0.000063320105,0.00002585022,0.000107206346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847275,0.0000070200153,0.00031018347,0.0007539272,0.00028452437,0.00017160056],"domain_scores_gemma":[0.99819493,0.000046819547,0.0002444085,0.0012852385,0.00016942479,0.000059198494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018620481,0.00018951406,0.0003181316,0.000305886,0.00007642578,0.000037921956,0.00054668455,0.00012942396,0.000026675503],"category_scores_gemma":[0.000039859322,0.00017296968,0.00003959214,0.00023894299,0.0005066934,0.00024082113,0.00042309688,0.0003432936,0.0000014772658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010692261,0.000039875347,0.00011879855,0.00016465547,0.000012524625,0.0000047388166,0.00007129274,0.26553652,0.0013130432,0.0026513957,0.000030830695,0.7300456],"study_design_scores_gemma":[0.00012065066,0.00003749526,0.00002645786,0.00036422626,0.00002924574,0.00029159253,1.3179273e-7,0.99001217,0.0006229698,0.008065169,0.00027659358,0.00015329302],"about_ca_topic_score_codex":0.000019624145,"about_ca_topic_score_gemma":7.3393755e-7,"teacher_disagreement_score":0.7298923,"about_ca_system_score_codex":0.000095312455,"about_ca_system_score_gemma":0.00016666483,"threshold_uncertainty_score":0.7053499},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041061976,0.0002724157,0.9922244,0.0008083725,0.002516492,0.00065667275,0.000011492728,0.0027813718,0.00068772334],"genre_scores_gemma":[0.002586531,0.000031042084,0.9936074,0.0027700914,0.00040485937,0.000037885733,0.0000136178905,0.00008758051,0.00046096178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99539876,0.000087595254,0.000608974,0.0020064353,0.00082939153,0.0010688402],"domain_scores_gemma":[0.9940841,0.0025464995,0.000299809,0.00226664,0.00053573784,0.0002671923],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015953775,0.000789409,0.0007796308,0.00108886,0.0003122105,0.00045528763,0.005441976,0.0005302481,0.000013181336],"category_scores_gemma":[0.00051931175,0.00076231227,0.0001477791,0.0012297888,0.000372894,0.0012859446,0.0012875246,0.0008466908,0.00006116833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016775202,0.000029081795,0.0000055933697,0.000070098606,0.0000135512,0.00005333989,0.0006590969,0.5868757,0.0003112364,0.009671551,0.00007025216,0.40222374],"study_design_scores_gemma":[0.000424963,0.00020350686,0.000077120276,0.00022781403,0.000011666268,0.00012663034,3.5577278e-7,0.8394939,0.00085921603,0.14627449,0.01117068,0.0011297099],"about_ca_topic_score_codex":0.000020182744,"about_ca_topic_score_gemma":0.00005401326,"teacher_disagreement_score":0.40109402,"about_ca_system_score_codex":0.00039858694,"about_ca_system_score_gemma":0.0004604485,"threshold_uncertainty_score":0.9999391},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049297643,0.0004866765,0.98022366,0.0006151419,0.010308302,0.0007676233,0.000043721375,0.001092703,0.006412899],"genre_scores_gemma":[0.6594548,0.000021477124,0.3339396,0.001551256,0.0044938233,0.000026625776,0.000066907734,0.00012508787,0.00032039537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99205834,0.00010230776,0.0012620224,0.0030058338,0.002078801,0.0014927145],"domain_scores_gemma":[0.995152,0.00033270352,0.0006855987,0.0027893002,0.00054657634,0.00049382757],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014629844,0.0012310623,0.0013550253,0.0011530296,0.00053880794,0.0017079443,0.0075116907,0.00073386694,0.000023346147],"category_scores_gemma":[0.00003157124,0.0011291654,0.00042440812,0.001222121,0.0006746346,0.00073684467,0.0028900092,0.0013952852,0.00032442153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011534611,0.00008566236,0.00004587549,0.0006090889,0.00007844135,0.0011241363,0.0014669743,0.3078214,0.000013640927,0.253743,0.00039291286,0.43460736],"study_design_scores_gemma":[0.0009628164,0.00045075777,0.00016427352,0.0039474904,0.000025848994,0.0008730288,5.995379e-7,0.9284201,0.00017489804,0.057029236,0.00583885,0.0021121025],"about_ca_topic_score_codex":0.00014524705,"about_ca_topic_score_gemma":0.000032506374,"teacher_disagreement_score":0.6594055,"about_ca_system_score_codex":0.0014744705,"about_ca_system_score_gemma":0.0020071939,"threshold_uncertainty_score":0.9993284},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043027503,0.00038284197,0.9959092,0.00026262988,0.0010919167,0.00089573965,0.000015239772,0.00005166152,0.0013477248],"genre_scores_gemma":[0.006079982,0.000008587375,0.99330884,0.0001194373,0.00030024964,0.000010499087,0.00000553027,0.00002133704,0.00014550875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787027,0.000077384444,0.0007542988,0.0005872129,0.00034990333,0.00036092897],"domain_scores_gemma":[0.984859,0.013769774,0.0005144447,0.00045558086,0.00031306566,0.00008815472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029814276,0.00032770666,0.0006931125,0.00029079523,0.00014825111,0.000056439363,0.000890626,0.00036989962,0.00004285977],"category_scores_gemma":[0.0010876778,0.00019966865,0.00016226473,0.00023178753,0.0015457914,0.00004799183,0.00026925604,0.00045524497,0.000004032526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020518966,0.0000135672035,0.000018614086,0.00016103443,0.00003330581,0.000002325661,0.000116898766,0.0018016851,0.0000546839,0.78325534,0.000039609273,0.21448243],"study_design_scores_gemma":[0.00020426155,0.00013772471,0.00001576971,0.00020032412,0.000027430775,0.000107546024,7.434866e-7,0.13166715,0.00040805084,0.8664588,0.00057204074,0.0002001896],"about_ca_topic_score_codex":0.000008719013,"about_ca_topic_score_gemma":0.000003629501,"teacher_disagreement_score":0.21428224,"about_ca_system_score_codex":0.00010801396,"about_ca_system_score_gemma":0.00025761485,"threshold_uncertainty_score":0.81422514},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041092044,0.0010237802,0.9832111,0.00048660644,0.0016588315,0.00072850415,0.0000019321033,0.00022763942,0.012620507],"genre_scores_gemma":[0.875008,0.000036577403,0.11612029,0.001995967,0.0012182097,0.000075255775,0.000009214476,0.00005986214,0.005476647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959722,0.00006068412,0.0005023163,0.0015638544,0.001097605,0.0008032978],"domain_scores_gemma":[0.9977984,0.00021906053,0.00029715346,0.0012125408,0.0002265258,0.00024632335],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000727764,0.0005913604,0.0005881318,0.00045888737,0.00026592248,0.0010677204,0.0030848521,0.0003844198,0.00010007944],"category_scores_gemma":[0.000059425063,0.00045398204,0.00016497963,0.00043684515,0.0004984645,0.00061253,0.0012815762,0.0007623898,0.0004289126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002037178,0.000042983567,0.00001819636,0.00004768195,0.000027518347,0.00030047336,0.005046837,0.0016095588,0.00039064296,0.26554754,0.0001828446,0.7267837],"study_design_scores_gemma":[0.0011295594,0.0011527905,0.0001277194,0.00031806526,0.00003316315,0.000517675,0.00000835516,0.50107425,0.0059171813,0.4598667,0.026584327,0.0032701974],"about_ca_topic_score_codex":0.00011173065,"about_ca_topic_score_gemma":0.000093383875,"teacher_disagreement_score":0.87496686,"about_ca_system_score_codex":0.00039593782,"about_ca_system_score_gemma":0.000447555,"threshold_uncertainty_score":0.99996924},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023087981,0.00024424613,0.9893734,0.0019039945,0.0011471125,0.00025682384,0.0000025888644,0.000097506934,0.006951231],"genre_scores_gemma":[0.6983818,0.000027918977,0.29811648,0.0029798527,0.00040940955,0.0000049749497,0.0000031030866,0.000028957253,0.00004750298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625635,0.00007770041,0.0006593628,0.0012100791,0.0010772628,0.0007192572],"domain_scores_gemma":[0.995968,0.0017202508,0.00025034673,0.0015018926,0.0003749667,0.00018458054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018411455,0.00048181682,0.0004857741,0.00050851906,0.0002916226,0.00038858812,0.00320473,0.00044970526,0.000030212026],"category_scores_gemma":[0.00017100193,0.00036099815,0.00016807903,0.00054604944,0.0011460382,0.00033198617,0.0007574534,0.0013438249,0.000017201573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021036916,0.000055062344,0.0000114541035,0.000022248434,0.00001023308,0.00006428718,0.00021613401,0.036059693,0.00009988839,0.4285296,0.000032908272,0.5348775],"study_design_scores_gemma":[0.000080490376,0.00025172514,0.000067518864,0.0005056244,0.000007152393,0.000052972195,8.9563954e-8,0.784612,0.0011157623,0.21288434,0.000063668784,0.00035867098],"about_ca_topic_score_codex":0.000014550144,"about_ca_topic_score_gemma":0.000019282852,"teacher_disagreement_score":0.7485523,"about_ca_system_score_codex":0.00017461456,"about_ca_system_score_gemma":0.00033469094,"threshold_uncertainty_score":0.9998842},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005114957,0.00053298956,0.9889031,0.00074679026,0.0035125117,0.0004971298,0.0000037053364,0.00018510685,0.005107172],"genre_scores_gemma":[0.61007,0.00005285448,0.38243258,0.001116698,0.0016921565,0.00003616126,0.000008597825,0.000092814385,0.004498173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99523765,0.00006303924,0.0007350498,0.0019298353,0.0010927733,0.00094167306],"domain_scores_gemma":[0.99742717,0.0005268938,0.0003667514,0.0012426891,0.0002544991,0.00018201474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015308484,0.00066974945,0.00072597346,0.001118606,0.00025217648,0.0006866223,0.0037315644,0.0003931137,0.000017594022],"category_scores_gemma":[0.00031458674,0.00060180406,0.00017637516,0.00055480463,0.00038259948,0.00067779055,0.0013592306,0.0020646625,0.000115723145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009278768,0.00007868884,0.00028376782,0.00016384163,0.00002362447,0.0004921195,0.00397017,0.044322018,0.0012512064,0.44903848,0.000008665187,0.50035816],"study_design_scores_gemma":[0.0010720664,0.00052672264,0.00086808525,0.0023580936,0.000015461937,0.00053981465,0.000002821604,0.7387816,0.023123097,0.16530854,0.06373371,0.0036700442],"about_ca_topic_score_codex":0.00005122004,"about_ca_topic_score_gemma":0.000055228702,"teacher_disagreement_score":0.6944595,"about_ca_system_score_codex":0.00034731094,"about_ca_system_score_gemma":0.00046967674,"threshold_uncertainty_score":0.9996433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007172815,0.00017146405,0.9966494,0.0007257905,0.0012430805,0.0005790697,0.000020500358,0.00008767553,0.00045133306],"genre_scores_gemma":[0.4777231,0.0000226983,0.52037996,0.0011455212,0.0004435429,0.00002837144,0.000015523843,0.00003174427,0.00020953515],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977396,0.000017078599,0.0003452215,0.00092772004,0.00056597614,0.0004044049],"domain_scores_gemma":[0.99833447,0.00029857198,0.00031525327,0.00053685164,0.00042265002,0.00009219445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045101877,0.00033233644,0.00047133255,0.0005512219,0.0001609353,0.0001653768,0.0013380448,0.0003676188,0.0000112869975],"category_scores_gemma":[0.000062998166,0.00029273916,0.00015491911,0.00038439553,0.00025929467,0.0004375203,0.00021423606,0.0003963642,0.000009219725],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005147272,0.00007549993,0.00006152097,0.00020305403,0.00002955764,0.000015501755,0.00041969106,0.12417322,0.0065820795,0.058051407,0.00012045763,0.81021655],"study_design_scores_gemma":[0.0015859284,0.0005100122,0.0001407535,0.0011043694,0.000024325747,0.000049883718,1.209781e-7,0.4586335,0.05634563,0.47898576,0.0018302512,0.0007894675],"about_ca_topic_score_codex":0.00001698093,"about_ca_topic_score_gemma":0.000028256707,"teacher_disagreement_score":0.8094271,"about_ca_system_score_codex":0.00017306443,"about_ca_system_score_gemma":0.0005457466,"threshold_uncertainty_score":0.9999525},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036818066,0.0010043938,0.99329484,0.00066688855,0.003095037,0.001188715,0.0000041539497,0.0001834937,0.0001942932],"genre_scores_gemma":[0.95343876,0.00012768236,0.04357236,0.00134093,0.0012543269,0.00009620868,0.0000075798075,0.000041619587,0.00012054502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961566,0.000052971536,0.00077862875,0.0013621504,0.0004626337,0.0011870306],"domain_scores_gemma":[0.9970485,0.0010435063,0.00041520328,0.00095712475,0.00030621415,0.00022943612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017610419,0.0006119981,0.0007807619,0.00058041787,0.0002596772,0.00036469474,0.0021430287,0.0005140831,0.00000914522],"category_scores_gemma":[0.000057139638,0.00058844924,0.00015334712,0.0004891221,0.00037667376,0.0008705284,0.00034454864,0.0009619968,0.0000128961965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032869484,0.000023837947,0.00013467814,0.000029977815,0.00001009284,0.000005005433,0.000098470366,0.10793946,0.00009382137,0.012186856,0.000003905214,0.879441],"study_design_scores_gemma":[0.0013050515,0.00019345985,0.00040052258,0.0004510635,0.000015116205,0.00002378297,8.6649294e-8,0.99223024,0.00012734057,0.0038309908,0.00075807393,0.00066424895],"about_ca_topic_score_codex":0.000009545012,"about_ca_topic_score_gemma":0.0001926678,"teacher_disagreement_score":0.9530706,"about_ca_system_score_codex":0.0003650275,"about_ca_system_score_gemma":0.00044433252,"threshold_uncertainty_score":0.9996567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007556839,0.0009527877,0.99535257,0.00002656229,0.00060313515,0.00048785194,0.000007675129,0.0006094192,0.0018844182],"genre_scores_gemma":[0.12754808,0.00008939132,0.8717299,0.00022129675,0.00027852933,0.00000718867,0.000004521746,0.00008383393,0.0000372154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709034,0.000014399928,0.00047586253,0.00080037984,0.0010652166,0.0005538127],"domain_scores_gemma":[0.9986243,0.000067301546,0.0001203899,0.0007337648,0.00030497005,0.00014922046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004823947,0.00055777177,0.00046939103,0.00053043675,0.0001472611,0.00013976022,0.00087570964,0.0002723554,0.000067959576],"category_scores_gemma":[0.000060825594,0.00054383354,0.00009301093,0.00029950717,0.00055364484,0.00036215744,0.00028581775,0.0008184047,0.000021613492],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054482252,0.000019224322,3.997526e-7,0.000031999443,0.0000031010509,0.00007272241,0.00006803627,0.06601031,0.066782,0.000021428072,0.000021766964,0.86696357],"study_design_scores_gemma":[0.00040320348,0.00014303376,0.0000038694425,0.00087494863,0.000011401228,0.000046712437,1.5218333e-7,0.7856148,0.19247702,0.01857981,0.0011330412,0.0007120249],"about_ca_topic_score_codex":0.000012622661,"about_ca_topic_score_gemma":0.000027681346,"teacher_disagreement_score":0.8662515,"about_ca_system_score_codex":0.00096378813,"about_ca_system_score_gemma":0.00015609384,"threshold_uncertainty_score":0.9997013},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005880407,0.00014574351,0.99452597,0.0012951457,0.00037197725,0.00034294624,0.000036730442,0.00010303143,0.0031196354],"genre_scores_gemma":[0.0060377247,0.000034523386,0.99148554,0.0013470832,0.00036855953,0.00003201737,0.00001762934,0.000026311878,0.00065062585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976395,0.000013979389,0.00028939766,0.0011614818,0.0004463708,0.00044931413],"domain_scores_gemma":[0.99777937,0.0010483605,0.00024695238,0.0006669227,0.00013418251,0.00012423044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066462194,0.00032749132,0.00033081343,0.00041111305,0.00042809997,0.0005858276,0.0015539816,0.00019614637,0.0000032321307],"category_scores_gemma":[0.0001452274,0.000305165,0.00006393881,0.00023101324,0.0003735388,0.0004374538,0.0006324289,0.0004756119,0.000011215835],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014004657,0.000010391124,0.0000053266913,0.000008097552,0.000007558962,0.0000028194008,0.0005566582,0.0011567948,0.000022166634,0.13864456,0.00007484921,0.85950935],"study_design_scores_gemma":[0.00020866127,0.0001420213,0.00008891519,0.00027205894,0.0000065369095,0.000009034426,5.01195e-7,0.8263487,0.00011436758,0.16632967,0.0060767713,0.00040276654],"about_ca_topic_score_codex":0.000006049033,"about_ca_topic_score_gemma":0.000015673699,"teacher_disagreement_score":0.8591066,"about_ca_system_score_codex":0.00022882834,"about_ca_system_score_gemma":0.00023568788,"threshold_uncertainty_score":0.99994004},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042257042,0.000084695304,0.997449,0.00018794292,0.0003582125,0.00030812618,0.00002528483,0.00011120264,0.0010529916],"genre_scores_gemma":[0.25977805,0.000009189063,0.73965406,0.0002899782,0.00018545274,0.0000042620095,0.000031997275,0.0000365176,0.000010450049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985787,0.0000026965931,0.00027981726,0.00057637476,0.00030131984,0.00026104797],"domain_scores_gemma":[0.9987793,0.00004860171,0.000049307077,0.000972095,0.000063322615,0.00008738103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015316867,0.00021965131,0.00019051267,0.00025763083,0.00011713128,0.00019167329,0.00068843045,0.00010858524,0.000006378353],"category_scores_gemma":[0.00001033157,0.00023297446,0.000026994456,0.00024705418,0.00009445292,0.00027072406,0.000343645,0.00026870827,0.000014086885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.1385494e-7,0.0000031588727,9.086407e-7,0.000017804596,0.0000027172855,0.0000037065931,0.00023734654,0.97999007,0.0015640819,0.00092668604,0.000027400214,0.017225781],"study_design_scores_gemma":[0.000041295287,0.000012763283,0.0000072960256,0.0002594278,0.0000032752375,0.000015212093,2.2037808e-7,0.95329726,0.0006153862,0.04485362,0.0006318369,0.00026238433],"about_ca_topic_score_codex":0.00004043935,"about_ca_topic_score_gemma":0.0000309927,"teacher_disagreement_score":0.2593555,"about_ca_system_score_codex":0.00023856956,"about_ca_system_score_gemma":0.00012142742,"threshold_uncertainty_score":0.9500423},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003809522,0.00046023424,0.99505204,0.00047709138,0.0016266351,0.0011165983,0.0000057699103,0.00020775785,0.0006729244],"genre_scores_gemma":[0.4901258,0.000048074755,0.5081137,0.00079267257,0.00070138107,0.00006259445,0.000011444173,0.00006865919,0.00007568006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99427146,0.00004769222,0.0008749649,0.002563555,0.00095699134,0.0012853688],"domain_scores_gemma":[0.9960237,0.0011124142,0.00051847874,0.0017549398,0.0003530334,0.00023741332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010270096,0.00081379747,0.0008582478,0.0010208092,0.00031964897,0.00046789038,0.0036698543,0.000718579,0.000004347302],"category_scores_gemma":[0.0000556623,0.00082752766,0.00021882945,0.0012389324,0.0006588859,0.00037578182,0.0009663408,0.0012876721,0.000013480159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012646354,0.000036379402,0.00004005876,0.000019443354,0.000008278513,0.00003232119,0.00022770007,0.8066962,0.00007269293,0.08077283,0.0000014792456,0.11207997],"study_design_scores_gemma":[0.0006016943,0.0001338072,0.00006479647,0.0006427668,0.000007143944,0.000026127816,3.8893458e-7,0.96475124,0.0002653441,0.0324548,0.00018159214,0.000870309],"about_ca_topic_score_codex":0.00007467496,"about_ca_topic_score_gemma":0.0003225194,"teacher_disagreement_score":0.48974487,"about_ca_system_score_codex":0.0009815486,"about_ca_system_score_gemma":0.0006452652,"threshold_uncertainty_score":0.99941754},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053270312,0.00058194523,0.986947,0.0017041436,0.0006945436,0.00034019616,0.000001388348,0.00021198862,0.009465506],"genre_scores_gemma":[0.14960217,0.00011802428,0.84473157,0.002975321,0.0008148752,0.000016978433,0.0000043385107,0.000063095555,0.0016736187],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99525887,0.00008888631,0.000754316,0.0017068149,0.0013181976,0.00087289495],"domain_scores_gemma":[0.99730474,0.00072641205,0.00027689335,0.0012804293,0.00019599132,0.00021556528],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021113518,0.00059954607,0.0007928959,0.001042349,0.00021183338,0.00081658305,0.003590108,0.0003685091,0.000032587646],"category_scores_gemma":[0.00040306788,0.0005350339,0.00014384012,0.0007501507,0.00046096143,0.0005570595,0.00080694474,0.0016473351,0.00011534245],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031031557,0.000032192216,0.00004216799,0.000034417026,0.000004994942,0.00021286799,0.0007974509,0.0074250787,0.00005967467,0.03559839,0.000011556141,0.9557781],"study_design_scores_gemma":[0.00026207615,0.00014002864,0.00016839686,0.0012942235,0.0000049278947,0.00015759193,2.6164423e-7,0.4693621,0.00035442194,0.5269434,0.0006534113,0.00065917155],"about_ca_topic_score_codex":0.000036838737,"about_ca_topic_score_gemma":0.000058207555,"teacher_disagreement_score":0.95511895,"about_ca_system_score_codex":0.00023433333,"about_ca_system_score_gemma":0.0004364846,"threshold_uncertainty_score":0.99971014},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004434262,0.00040916234,0.99615884,0.0011843469,0.00020308727,0.00077422283,0.00016272992,0.000050767474,0.001012526],"genre_scores_gemma":[0.24217197,0.00076782156,0.7469364,0.0023645204,0.0054495153,0.0008007852,0.00026679435,0.00014259531,0.0010996173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825615,0.000001048836,0.00046682757,0.00081925234,0.00006181732,0.00039488415],"domain_scores_gemma":[0.9987732,0.00014626414,0.0004495037,0.00037937018,0.00016311159,0.00008855059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024192334,0.000246809,0.00045355983,0.0010815316,0.00049241656,0.0001767188,0.00055449444,0.00014211307,0.000003304155],"category_scores_gemma":[0.00029235455,0.00029219268,0.00012426784,0.0005654084,0.00039668116,0.00026122562,0.00009307403,0.00021866776,0.00002088086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009409396,0.000022923929,0.000017110058,0.000024444187,0.0000031145196,2.5216838e-7,0.00039500077,0.011303903,0.0000048788866,0.73590684,0.000008110515,0.252304],"study_design_scores_gemma":[0.00020951375,0.00022448681,0.00017267549,0.00004934476,0.000003946337,0.0000058044893,3.6038637e-7,0.15524383,0.00001773424,0.83036274,0.013347192,0.0003623733],"about_ca_topic_score_codex":0.00026364386,"about_ca_topic_score_gemma":0.00006657237,"teacher_disagreement_score":0.25194162,"about_ca_system_score_codex":0.00024837794,"about_ca_system_score_gemma":0.00035880497,"threshold_uncertainty_score":0.99995303},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001632991,0.0024336483,0.9946492,0.0002960274,0.0015170553,0.00030028928,0.0000027605413,0.00046750077,0.00017025929],"genre_scores_gemma":[0.0062421067,0.000096120275,0.99264055,0.0005924032,0.0002751629,0.00000639944,9.927925e-7,0.000029650186,0.00011659852],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695176,0.00002823232,0.0003539809,0.0014915727,0.0005820871,0.00059234723],"domain_scores_gemma":[0.99737823,0.0011870593,0.00012920784,0.0008569777,0.00020797449,0.00024056796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011188439,0.0004627198,0.0004360311,0.0009868427,0.00027050875,0.00031251306,0.0011243372,0.0003354207,0.000002080016],"category_scores_gemma":[0.0006982968,0.00045704775,0.000044024287,0.0006873686,0.00044114847,0.0005816439,0.0015114062,0.00064402755,0.0000078958765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004953194,0.000004030246,0.00008901271,0.000028920416,0.0000042966262,0.000022395328,0.0003864376,0.11369296,0.00005325594,0.011214673,0.000004676694,0.8744944],"study_design_scores_gemma":[0.0007008477,0.0011005535,0.0057404423,0.0017336379,0.00002474784,0.00094995415,9.639127e-7,0.07918624,0.0025864777,0.90090764,0.0040079947,0.0030605302],"about_ca_topic_score_codex":0.000011141948,"about_ca_topic_score_gemma":0.00005570698,"teacher_disagreement_score":0.88969296,"about_ca_system_score_codex":0.00034811386,"about_ca_system_score_gemma":0.00015567247,"threshold_uncertainty_score":0.9997881},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021055945,0.00038896172,0.99405324,0.00029080384,0.00076085876,0.00063055335,0.000030093259,0.00037555417,0.003448851],"genre_scores_gemma":[0.0017249779,0.00012432919,0.9943871,0.0023821336,0.00043134633,0.000030011668,0.00003996177,0.00008544026,0.0007947316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99439895,0.00012859334,0.00060460385,0.002181676,0.0015208008,0.0011653954],"domain_scores_gemma":[0.99616385,0.0007711936,0.00029968412,0.0018569186,0.00056667795,0.00034170636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016302635,0.00068786537,0.0006542537,0.0017612093,0.00045911252,0.00046629898,0.0036950193,0.00043159391,0.00010281923],"category_scores_gemma":[0.00018809349,0.000668362,0.0002448039,0.0017996524,0.001307671,0.0009816716,0.0012610921,0.001380094,0.0004742861],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006704635,0.000037864564,0.000005351858,0.000018734201,0.000016474158,0.000114606984,0.0002041162,0.003070214,0.00015130738,0.0029536872,0.00009668587,0.9933243],"study_design_scores_gemma":[0.00029520737,0.00024332474,0.0000058563323,0.00015455513,0.000006311939,0.00010856146,1.1506181e-7,0.41262722,0.0018056426,0.57914114,0.0048366087,0.00077546766],"about_ca_topic_score_codex":0.000009591406,"about_ca_topic_score_gemma":0.000011939979,"teacher_disagreement_score":0.99254876,"about_ca_system_score_codex":0.0002688962,"about_ca_system_score_gemma":0.0004264485,"threshold_uncertainty_score":0.99957675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000034707555,0.00036144082,0.99507886,0.00031444442,0.00089579204,0.0006959246,0.000020718262,0.00064130157,0.0019880189],"genre_scores_gemma":[0.019621657,0.000037725425,0.97860193,0.0010806028,0.0002712863,0.00001928049,0.000012747276,0.000031982287,0.0003227886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962148,0.00004604451,0.00051818613,0.0016662398,0.00069043296,0.000864298],"domain_scores_gemma":[0.99719346,0.0006561379,0.0003481331,0.0012329356,0.0003890224,0.00018029433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012605388,0.00056509627,0.0006348636,0.00088971097,0.0004486607,0.00055910577,0.0028588732,0.00034303538,0.0000057184234],"category_scores_gemma":[0.0001283718,0.00055485213,0.00022276078,0.00058602274,0.00024391002,0.00044465557,0.0007413676,0.0006416909,0.000008239911],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025168392,0.000046412893,0.0000062923505,0.000016182763,0.000008553511,0.00002164293,0.00013122977,0.01450172,0.0000041962685,0.0757331,0.00008485407,0.9094433],"study_design_scores_gemma":[0.0002707263,0.00023078657,0.000024280327,0.00014638896,0.0000059379313,0.00002551875,3.6591242e-8,0.72005236,0.00021777391,0.2770939,0.0014580906,0.00047425093],"about_ca_topic_score_codex":0.000008149666,"about_ca_topic_score_gemma":0.000017512702,"teacher_disagreement_score":0.90896904,"about_ca_system_score_codex":0.0002270194,"about_ca_system_score_gemma":0.00042551366,"threshold_uncertainty_score":0.9996903},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023549981,0.00074823224,0.9923072,0.00041976225,0.0012140145,0.00023143247,0.000003822492,0.00008308606,0.0047569848],"genre_scores_gemma":[0.30666506,0.00006702952,0.69083935,0.0006181576,0.00074195553,0.000004681346,0.000011340292,0.000025358477,0.0010270259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675286,0.00002528453,0.0005818839,0.0010642073,0.001122685,0.00045306585],"domain_scores_gemma":[0.9978331,0.00041762236,0.0003907026,0.0008404732,0.0003811035,0.0001370195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000812159,0.00037397476,0.0004488932,0.0025515265,0.00015911777,0.00023131506,0.0021900672,0.00021693046,0.000031487558],"category_scores_gemma":[0.00011816263,0.0003676822,0.00013220862,0.0021392726,0.00034243034,0.0006357281,0.0008517696,0.00048210597,0.000031841235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017448646,0.000016733835,0.000017310345,0.000016982813,0.0000063579723,0.000009174545,0.00018459943,0.33692217,0.0001240828,0.013956576,0.000014984283,0.6487293],"study_design_scores_gemma":[0.0003513992,0.00024452296,0.0004586512,0.00030024917,0.000011349899,0.00007524932,2.099866e-7,0.94026333,0.0056854105,0.047644086,0.0042119487,0.0007535886],"about_ca_topic_score_codex":0.00000947348,"about_ca_topic_score_gemma":0.000019892148,"teacher_disagreement_score":0.6479757,"about_ca_system_score_codex":0.00022111463,"about_ca_system_score_gemma":0.00059098535,"threshold_uncertainty_score":0.9998775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020634222,0.00035442706,0.9957484,0.0002260361,0.00043421355,0.0006106763,0.00002004306,0.0002447597,0.0002980123],"genre_scores_gemma":[0.37862793,0.000031150117,0.61997294,0.0008821121,0.00025609275,0.00004285303,0.0000067157944,0.00003313966,0.00014707196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966913,0.000043464377,0.00047732444,0.001613169,0.00054713315,0.00062761724],"domain_scores_gemma":[0.99808437,0.00051093707,0.00024423312,0.00087263144,0.00012737277,0.0001604548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010636656,0.0004501287,0.00042711853,0.00097645784,0.00039636952,0.0002512625,0.0012714707,0.00020841298,0.000009338881],"category_scores_gemma":[0.000102252765,0.00042999152,0.0000860339,0.0007210755,0.00041166972,0.0005026597,0.0014712123,0.0008540085,0.000018600453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010756107,0.00016015973,0.00074835826,0.000050500523,0.000011431349,0.000065870336,0.00062372076,0.020774705,0.00083073194,0.012693203,0.000016966946,0.9640136],"study_design_scores_gemma":[0.0006392384,0.00015520479,0.0026817187,0.00039437733,0.0000075530015,0.00011931429,5.658466e-7,0.9836573,0.004893082,0.004039329,0.0026020173,0.0008103247],"about_ca_topic_score_codex":0.000056423192,"about_ca_topic_score_gemma":0.0003040672,"teacher_disagreement_score":0.96320325,"about_ca_system_score_codex":0.00028790862,"about_ca_system_score_gemma":0.00020174682,"threshold_uncertainty_score":0.99981517},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000029067871,0.0014249026,0.9774876,0.001464438,0.0026767678,0.0008892158,0.00003828854,0.00023582907,0.015780035],"genre_scores_gemma":[0.08018515,0.000024721008,0.9086278,0.006751846,0.0035240205,0.000024332698,0.000111150825,0.000054900895,0.0006960706],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994663,0.00005281923,0.000696754,0.0024376188,0.0010617294,0.0010880636],"domain_scores_gemma":[0.9941005,0.00087769475,0.00043337778,0.0040936065,0.0002578459,0.0002369447],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014421204,0.00071327743,0.0008516193,0.00044624892,0.00041692605,0.0008240724,0.010588039,0.00047047308,0.0000048632446],"category_scores_gemma":[0.00012063127,0.0005927782,0.00018121205,0.0005853987,0.00045394216,0.0006770124,0.0014687116,0.00064987334,0.0000134882575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001602894,0.000013938958,0.000022685404,0.00003181433,0.000013757937,0.000036604644,0.000055894383,0.064099886,0.000012211488,0.12069216,0.0007360743,0.81426895],"study_design_scores_gemma":[0.0004917481,0.00023967998,0.0001717911,0.0001725168,0.0000134414395,0.000024149816,4.764631e-8,0.44370818,0.000022252421,0.5440809,0.010483656,0.00059159775],"about_ca_topic_score_codex":0.000030810395,"about_ca_topic_score_gemma":0.00025384338,"teacher_disagreement_score":0.8136774,"about_ca_system_score_codex":0.000215389,"about_ca_system_score_gemma":0.0009413916,"threshold_uncertainty_score":0.9996524},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002781855,0.0007010772,0.9950496,0.000054999546,0.00073956634,0.00035793273,0.0000035660457,0.000057932557,0.00025348557],"genre_scores_gemma":[0.70419914,0.000022725268,0.29555953,0.000086984466,0.00009217404,0.000004855999,0.0000013251735,0.000012984039,0.000020330235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793303,0.000044365635,0.0003730118,0.0009599718,0.00035899854,0.0003306509],"domain_scores_gemma":[0.9978596,0.0011518273,0.00029087285,0.00041337495,0.00021913399,0.000065194865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011377637,0.00030551746,0.00044357206,0.00047541433,0.00022800149,0.00037178022,0.00055034005,0.00020264833,4.1985143e-7],"category_scores_gemma":[0.0001515693,0.00027425977,0.000067401634,0.00029520813,0.0004175291,0.0005071227,0.00042090312,0.00031182708,2.9522045e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050843573,0.000008758407,0.00046167456,0.00007264235,0.000005229053,0.000006184634,0.0006687967,0.003909202,0.0012870155,0.0009872566,6.41087e-7,0.9925875],"study_design_scores_gemma":[0.00053048844,0.00054920284,0.008007855,0.00080221065,0.000011593013,0.00006643952,5.40628e-7,0.8358179,0.015648333,0.13780418,0.00013959,0.0006216988],"about_ca_topic_score_codex":0.00003230005,"about_ca_topic_score_gemma":0.00012188571,"teacher_disagreement_score":0.99196583,"about_ca_system_score_codex":0.00005624348,"about_ca_system_score_gemma":0.0000860042,"threshold_uncertainty_score":0.999971},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016099194,0.0007262448,0.99005604,0.00023906052,0.004946872,0.0015960842,0.0001337744,0.0002344016,0.00045758343],"genre_scores_gemma":[0.5812342,0.0000036682563,0.41610685,0.000895059,0.0012984668,0.000013273401,0.000046977686,0.000054683747,0.00034678506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99506396,0.000057667025,0.0009559154,0.0018387102,0.0011012083,0.0009825662],"domain_scores_gemma":[0.9970735,0.0002688256,0.00052063115,0.0014426641,0.0004149742,0.00027940448],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008645206,0.0007270561,0.0009084156,0.0007611079,0.00035518536,0.0011456645,0.003818438,0.00034152245,0.0000017019437],"category_scores_gemma":[0.000020162126,0.00068089727,0.00019044547,0.0005673557,0.00015579708,0.0003707514,0.0009085966,0.00038271732,0.000017321145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019906578,0.000065653185,0.00003657186,0.00026472073,0.000039789436,0.000035376474,0.00036922778,0.89879125,0.0009866449,0.004079841,0.00008996108,0.09522107],"study_design_scores_gemma":[0.0007562515,0.00021922194,0.000014126379,0.0013727,0.000012809743,0.00006186737,4.1153865e-7,0.9843322,0.00014383296,0.0032761625,0.009082007,0.000728423],"about_ca_topic_score_codex":0.0003290218,"about_ca_topic_score_gemma":0.00006931098,"teacher_disagreement_score":0.5796243,"about_ca_system_score_codex":0.00058515434,"about_ca_system_score_gemma":0.0005364804,"threshold_uncertainty_score":0.9998912},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000230999,0.00085725234,0.9931389,0.0010293813,0.0016362814,0.0011777512,0.000006194378,0.00034329316,0.001579909],"genre_scores_gemma":[0.6168596,0.000106787134,0.38173616,0.0002489346,0.00020867724,0.00010687532,0.000011954424,0.000036771267,0.00068423967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99388915,0.0001382852,0.00095205434,0.0016408975,0.002866146,0.0005134528],"domain_scores_gemma":[0.9952969,0.00033086378,0.0009371681,0.0022116636,0.0011135845,0.000109845074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034578533,0.0005449155,0.00055090437,0.0013426576,0.00020381996,0.0004811847,0.0033939786,0.00038960838,0.000016482965],"category_scores_gemma":[0.00026576046,0.00048754094,0.00010949959,0.00070525554,0.0006469667,0.0007795533,0.00067725225,0.00063818274,0.00010301708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031725895,0.00013465964,0.000021159509,0.000023164395,0.000016907034,0.0000020190425,0.0002239848,0.04238051,0.00079641416,0.10742627,0.000017779803,0.84895396],"study_design_scores_gemma":[0.0013217322,0.00016148234,0.00021189613,0.00032784944,0.000030223278,0.000007399385,0.0000010833583,0.9738369,0.0029646417,0.020092726,0.0005623599,0.0004816847],"about_ca_topic_score_codex":0.000025891926,"about_ca_topic_score_gemma":0.000059965303,"teacher_disagreement_score":0.9314564,"about_ca_system_score_codex":0.001262763,"about_ca_system_score_gemma":0.00073909975,"threshold_uncertainty_score":0.99975765},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012521466,0.00013854245,0.99025476,0.0009000122,0.0024525656,0.0005956345,0.000004110355,0.00018110764,0.005348037],"genre_scores_gemma":[0.58305,0.000034590277,0.40900454,0.0031023722,0.00075991213,0.000032386142,0.0000060206216,0.000051594798,0.003958588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652874,0.000030364692,0.0005178852,0.0013734769,0.0009735408,0.0005760102],"domain_scores_gemma":[0.99780136,0.00023971447,0.00025803992,0.0012317771,0.00021259094,0.00025653947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005925337,0.00041219714,0.000398616,0.00083557813,0.00028746403,0.0005455064,0.0023705945,0.00019525495,0.00010219856],"category_scores_gemma":[0.0000751408,0.0004064089,0.00010733372,0.00063655974,0.00016256508,0.0005298182,0.0008878112,0.00041721616,0.0004311273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033378021,0.000065299646,0.00042202324,0.00010194032,0.000028755408,0.00014824799,0.0067906952,0.10234255,0.00082056207,0.039464112,0.0006085361,0.84920394],"study_design_scores_gemma":[0.00028003182,0.00012881462,0.0009649546,0.00066953764,0.000008034589,0.00005193186,2.4215709e-7,0.97747016,0.0013207524,0.00931361,0.008886288,0.00090566004],"about_ca_topic_score_codex":0.00006824491,"about_ca_topic_score_gemma":0.00006217344,"teacher_disagreement_score":0.8751276,"about_ca_system_score_codex":0.00042255933,"about_ca_system_score_gemma":0.00018936643,"threshold_uncertainty_score":0.99983877},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005031715,0.00064503256,0.9887847,0.00046209784,0.0025101893,0.00068481505,0.000056306024,0.00031528942,0.0064912965],"genre_scores_gemma":[0.16694929,0.00012806835,0.8243341,0.0024138708,0.003825902,0.000074029536,0.00014111602,0.000119793505,0.002013867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955178,0.00001573357,0.00062684424,0.001871031,0.00080338324,0.001165238],"domain_scores_gemma":[0.9965987,0.0008509089,0.00036161314,0.0014326609,0.00047357328,0.00028253268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096261647,0.000728506,0.0007211506,0.0006098357,0.0005093834,0.0008417437,0.0041202013,0.0005369434,0.000035373385],"category_scores_gemma":[0.000268478,0.0006297782,0.0002515312,0.0006840052,0.0005503773,0.00099926,0.0013809201,0.00079612824,0.00007132758],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022772416,0.000060534596,0.000074808064,0.00009190821,0.00003681352,0.00007459594,0.002178985,0.011204128,0.0000639265,0.099189796,0.00081344735,0.88618827],"study_design_scores_gemma":[0.00083414844,0.0003390566,0.0001045583,0.00043502657,0.000020641968,0.00013891982,5.036726e-7,0.7656655,0.0008577877,0.16987546,0.060366035,0.0013623803],"about_ca_topic_score_codex":0.0000110436695,"about_ca_topic_score_gemma":0.00016382833,"teacher_disagreement_score":0.8848259,"about_ca_system_score_codex":0.00051205547,"about_ca_system_score_gemma":0.0008098159,"threshold_uncertainty_score":0.9996154},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000941481,0.0010402828,0.9938109,0.00009443898,0.0008503369,0.00053514773,0.000030424224,0.000016633016,0.002680362],"genre_scores_gemma":[0.5644391,0.0012272818,0.41900855,0.0078480365,0.0028641396,0.00005877207,0.00013598395,0.00022829244,0.004189816],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984272,0.00003999774,0.00019531898,0.0008202162,0.0002599129,0.00025736945],"domain_scores_gemma":[0.99925405,0.00003986291,0.00010979603,0.00043643205,0.000078858146,0.00008100158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003176121,0.00030513908,0.00020595228,0.00013638994,0.00012508375,0.00008535566,0.0003219031,0.00043240734,0.000043270913],"category_scores_gemma":[0.000053294458,0.0002616035,0.00004418415,0.000054583023,0.00024003944,0.0000073042297,0.00012316562,0.00030760956,0.000005296793],"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.000063469095,0.000015482065,0.000013397076,0.00007447502,0.000028492228,0.000012413059,0.0000793205,0.010235814,0.5032086,0.00053809973,0.00019935607,0.48553112],"study_design_scores_gemma":[0.00052292395,0.0019966213,0.00005050055,0.0004373397,0.00002095614,0.00012113395,1.4768999e-7,0.004154619,0.8712441,0.097900115,0.022691067,0.00086049055],"about_ca_topic_score_codex":0.0000016376849,"about_ca_topic_score_gemma":0.00000549695,"teacher_disagreement_score":0.57480234,"about_ca_system_score_codex":0.00003124812,"about_ca_system_score_gemma":0.0001557415,"threshold_uncertainty_score":0.9999836},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046677017,0.00008713475,0.9897487,0.0007087399,0.0006548096,0.0005092055,0.0000045456113,0.00029343148,0.003325691],"genre_scores_gemma":[0.7730001,0.0000021773903,0.22595678,0.00048722068,0.00026803615,0.000035851812,0.000012770802,0.000035861533,0.00020117567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995945,0.00008741338,0.00064146775,0.0019369789,0.00069877,0.00069041346],"domain_scores_gemma":[0.9972053,0.0006579116,0.00030640312,0.0014579763,0.00021192884,0.00016043546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071196334,0.0005648549,0.0005527443,0.0012297902,0.00020727831,0.00064927415,0.0033817075,0.0003065452,0.000022694801],"category_scores_gemma":[0.0000954246,0.0005651048,0.000103831604,0.00065610296,0.0006793162,0.0010396505,0.0011553717,0.0014274103,0.000061185725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062006443,0.00013485634,0.0015115214,0.000024036539,0.0000048987777,0.000049352784,0.0020953405,0.5029235,0.00021529626,0.0133248875,0.000005869331,0.47970423],"study_design_scores_gemma":[0.00021511833,0.00019834857,0.01006773,0.00014310036,0.0000030525694,0.000030640535,4.168335e-7,0.9266145,0.00030598466,0.06155525,0.00024396915,0.0006218484],"about_ca_topic_score_codex":0.0013655142,"about_ca_topic_score_gemma":0.0011123555,"teacher_disagreement_score":0.7683324,"about_ca_system_score_codex":0.0007955766,"about_ca_system_score_gemma":0.0005837839,"threshold_uncertainty_score":0.99968004},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006548056,0.000054648866,0.9942824,0.0003412174,0.0012714943,0.00014055967,0.000013625266,0.000158008,0.0036725658],"genre_scores_gemma":[0.3527626,0.000015036325,0.6449364,0.001082128,0.00035984514,0.000004746533,0.000037753984,0.000036369674,0.0007651327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963957,0.00008750049,0.0004321735,0.0014214165,0.0011091754,0.00055403536],"domain_scores_gemma":[0.9966994,0.0017312363,0.0001952891,0.00087207864,0.00028795068,0.00021407519],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016202219,0.00042448912,0.00039170665,0.00051222346,0.0003430326,0.0004666082,0.0019948073,0.00044593733,0.000057576497],"category_scores_gemma":[0.00050086173,0.0003904354,0.00006646059,0.0003633999,0.00061224937,0.0002827854,0.00065958704,0.0026383933,0.0001980359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001052607,0.0000350994,0.00033799122,0.000010982049,0.000007979445,0.00007400133,0.0002730105,0.061353024,0.00007897636,0.29792935,0.000031363994,0.6398577],"study_design_scores_gemma":[0.00014106165,0.00022857967,0.003527403,0.00016537527,0.0000028452598,0.000022504282,1.5559657e-8,0.75600195,0.0001369084,0.23848273,0.0007409132,0.0005497102],"about_ca_topic_score_codex":0.000050976778,"about_ca_topic_score_gemma":0.00014273312,"teacher_disagreement_score":0.6946489,"about_ca_system_score_codex":0.00013856475,"about_ca_system_score_gemma":0.000711944,"threshold_uncertainty_score":0.99985474},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008251798,0.00017535337,0.9894373,0.0017651208,0.0005822507,0.0011264216,0.0005535517,0.0002148183,0.0060627116],"genre_scores_gemma":[0.6425376,0.00015953019,0.34548527,0.0070733572,0.0010946841,0.00029563348,0.0020658397,0.0001849794,0.0011031034],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99353766,0.000073202486,0.0015019039,0.0022258407,0.0017498182,0.0009115578],"domain_scores_gemma":[0.9946443,0.00029690203,0.00076183525,0.0032322756,0.00067785307,0.00038682247],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015990175,0.00070610695,0.0010265423,0.00059881277,0.0002525721,0.00039651874,0.0056625227,0.00034914148,0.00002638365],"category_scores_gemma":[0.00003237674,0.00069720286,0.00019864136,0.002730845,0.00032817925,0.0003804225,0.0019627616,0.00057151425,0.00012461942],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055767454,0.000220222,0.00021113017,0.00041666356,0.000066120316,0.00013583188,0.00071716803,0.082134105,0.00026390658,0.19244966,0.0017319017,0.7215975],"study_design_scores_gemma":[0.0019389482,0.00053100643,0.0057361145,0.0015866933,0.000037356218,0.0001306313,0.0000067997366,0.12370499,0.0011841028,0.06890283,0.7927246,0.003515885],"about_ca_topic_score_codex":0.000089117326,"about_ca_topic_score_gemma":0.00013595297,"teacher_disagreement_score":0.79099274,"about_ca_system_score_codex":0.0005054216,"about_ca_system_score_gemma":0.00021826812,"threshold_uncertainty_score":0.9997173},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000062226536,0.00049092417,0.9753638,0.00071792374,0.0011597872,0.00028742984,0.000007937191,0.000788571,0.021121427],"genre_scores_gemma":[0.13350907,0.00006810893,0.86351424,0.002040772,0.00033378936,0.000013226422,0.00000786877,0.00005272384,0.00046021756],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954056,0.000027489268,0.0005425955,0.0017918883,0.0014549237,0.0007774947],"domain_scores_gemma":[0.99733067,0.00036744832,0.0002665088,0.0015541457,0.00025727027,0.00022398013],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00067319954,0.00063485204,0.00054453994,0.00090947835,0.00024549817,0.001486251,0.006193891,0.00034270596,0.000077680255],"category_scores_gemma":[0.000099445526,0.00058439013,0.0001514766,0.0008003716,0.0012917254,0.00149631,0.0013118667,0.0007228599,0.00012558505],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006289976,0.00003760839,0.000050905026,0.00003132036,0.0000048485263,0.00014758024,0.00019125384,0.0089776255,0.00010817302,0.0052507296,0.00008848328,0.98510516],"study_design_scores_gemma":[0.00021226992,0.00021316242,0.000054891054,0.0006156561,0.0000073789924,0.000036229925,2.3150562e-8,0.4076877,0.011786391,0.573913,0.0043641706,0.0011091931],"about_ca_topic_score_codex":0.00002102198,"about_ca_topic_score_gemma":0.000033351324,"teacher_disagreement_score":0.983996,"about_ca_system_score_codex":0.00024594765,"about_ca_system_score_gemma":0.0010693118,"threshold_uncertainty_score":0.99966073},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026998844,0.00007060665,0.98045623,0.00052982,0.0013077485,0.0005864453,0.000007885905,0.00026285206,0.016508428],"genre_scores_gemma":[0.12807506,0.0000068214617,0.86841965,0.0028640348,0.0004215745,0.000021664035,0.00003921312,0.00003734064,0.00011465364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564815,0.00005993636,0.00047990016,0.0019080999,0.0011224992,0.00078142376],"domain_scores_gemma":[0.99791455,0.00024543656,0.00025765464,0.0011166562,0.0001879364,0.0002777824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010891022,0.0005874776,0.0004950822,0.0007649867,0.0004695514,0.0008579764,0.0032297818,0.00046107,0.00002318592],"category_scores_gemma":[0.00009301965,0.0005316324,0.00014182259,0.00074886065,0.00038274398,0.0005405743,0.001273057,0.0017378649,0.00017509401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001009605,0.00006018979,0.000030896834,0.000036443944,0.000007956428,0.000035083878,0.0010944341,0.09560813,0.00040390997,0.0014265135,0.00002630297,0.90126],"study_design_scores_gemma":[0.00042541174,0.00041732469,0.000074078554,0.0002269159,0.000009617928,0.00006487953,6.5518014e-7,0.9583626,0.0026036256,0.031980395,0.0046509327,0.0011835961],"about_ca_topic_score_codex":0.000045660097,"about_ca_topic_score_gemma":0.00003010852,"teacher_disagreement_score":0.90007645,"about_ca_system_score_codex":0.00025828253,"about_ca_system_score_gemma":0.0003796143,"threshold_uncertainty_score":0.99971354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073197955,0.00004009739,0.9960859,0.0000346605,0.000082436694,0.00046032664,0.00006710253,0.000022345672,0.0024751907],"genre_scores_gemma":[0.7957277,0.0000015360675,0.2033438,0.00007829262,0.00047125234,0.000051599083,0.000048845843,0.000024102901,0.00025286665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982382,0.000011807522,0.0003887678,0.00063669344,0.00043312373,0.00029139468],"domain_scores_gemma":[0.9986454,0.00013482384,0.00038496227,0.0006042867,0.00019581808,0.000034711862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022530602,0.00028982823,0.0006560576,0.00030671316,0.0002712433,0.000052717685,0.0012255525,0.00012355788,0.000052523643],"category_scores_gemma":[0.0000042775478,0.00021916298,0.0007538922,0.0010066711,0.00065647427,0.00005031026,0.000409403,0.00033863308,2.8636092e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017113922,0.00046934522,0.01058971,0.000035666482,0.001366877,0.0000012752546,0.0014795347,0.12792495,0.00064622407,0.022795413,0.00034047654,0.8343334],"study_design_scores_gemma":[0.00047945464,0.00010472408,0.0067485175,0.00007842078,0.0029975404,0.0000032197327,0.0000014147005,0.96563935,0.0014789215,0.020006524,0.0014125269,0.0010493686],"about_ca_topic_score_codex":0.000087183704,"about_ca_topic_score_gemma":0.00004923232,"teacher_disagreement_score":0.83771443,"about_ca_system_score_codex":0.0000716487,"about_ca_system_score_gemma":0.00017226924,"threshold_uncertainty_score":0.8937207},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035911397,0.0006364995,0.99402887,0.0002417491,0.0022455198,0.00044495217,0.00004763338,0.00015886922,0.0018367808],"genre_scores_gemma":[0.045667615,0.00007539844,0.95228523,0.0010917811,0.00060166087,0.000022881812,0.00003777559,0.00004803405,0.00016963808],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99557114,0.00004517696,0.00081522187,0.0018526112,0.00091274345,0.0008031086],"domain_scores_gemma":[0.99643964,0.00060803286,0.0004193022,0.0021433572,0.00018957324,0.00020009853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008806702,0.0006453221,0.00073837664,0.0010195305,0.00028376907,0.00029003597,0.0022549434,0.0002627243,0.000029691551],"category_scores_gemma":[0.00025060822,0.00057217025,0.00011206956,0.0005409791,0.00091718626,0.0013963622,0.0023704101,0.0014617435,0.000022452721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010089895,0.00003185114,0.00030925058,0.00013740812,0.000012575078,0.00053607795,0.001382884,0.0072912453,0.0019748153,0.49224287,0.000013272351,0.49605766],"study_design_scores_gemma":[0.0029114143,0.0005805282,0.00202523,0.0065080267,0.000036675003,0.0017361583,0.000010842025,0.30627313,0.046470333,0.3410687,0.2844998,0.0078791175],"about_ca_topic_score_codex":0.00022120451,"about_ca_topic_score_gemma":0.0013075789,"teacher_disagreement_score":0.48817852,"about_ca_system_score_codex":0.00019866053,"about_ca_system_score_gemma":0.000553246,"threshold_uncertainty_score":0.99967295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001520025,0.00039919151,0.9975936,0.000023362869,0.00020889482,0.00013645187,0.0000035484427,0.00020626305,0.0012767136],"genre_scores_gemma":[0.5768371,0.000090392976,0.42291325,0.000025919426,0.0000715232,7.4778717e-7,0.000006117614,0.000030043155,0.000024874533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983605,0.000004523038,0.00039666664,0.00045957824,0.0005209971,0.0002577492],"domain_scores_gemma":[0.99910074,0.00012534866,0.00010537417,0.0004828647,0.00011927582,0.000066406414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026244752,0.00026559795,0.00037207516,0.00033376258,0.000034256645,0.000024141775,0.0005831791,0.00020753178,0.000027831158],"category_scores_gemma":[0.000015294358,0.00024810928,0.00008451474,0.00044109058,0.00051070517,0.00013405172,0.00013102306,0.0004286857,0.000012264504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013929372,0.000006256472,0.0000052554988,0.000024976245,0.000004336703,0.00000727783,0.000045471206,0.615503,0.00105888,0.0014061215,0.000001734455,0.38193527],"study_design_scores_gemma":[0.000088903296,0.000074270785,0.00008249823,0.00030858716,0.0000100826055,0.0000075202606,1.3094105e-7,0.75867516,0.10979487,0.1301231,0.00041375204,0.0004211571],"about_ca_topic_score_codex":0.000012499606,"about_ca_topic_score_gemma":0.00000910295,"teacher_disagreement_score":0.57668513,"about_ca_system_score_codex":0.00039589932,"about_ca_system_score_gemma":0.00004651056,"threshold_uncertainty_score":0.99999714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015845316,0.00014715087,0.9908996,0.0015425014,0.00095181266,0.0012015115,0.000012551456,0.00008583714,0.005000582],"genre_scores_gemma":[0.31826776,0.00014270688,0.64064544,0.019514797,0.010204767,0.0006228079,0.00097009103,0.0003228435,0.009308762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768054,0.000007606321,0.00049625203,0.0008425682,0.00048261054,0.0004903957],"domain_scores_gemma":[0.9989882,0.00006983104,0.00014503313,0.00057656795,0.00020323112,0.00001711358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008016321,0.00037700767,0.00032669018,0.0005928502,0.00024491397,0.00055922195,0.0011815175,0.00013805825,0.000108564906],"category_scores_gemma":[0.000015163783,0.0002786142,0.000110644665,0.00040060416,0.00032266855,0.00072496,0.00033075517,0.00029537186,0.00003681448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001974073,0.000085021835,0.00026412238,0.00008952755,0.000014658234,0.000007934301,0.000097087854,0.11184696,0.000005707931,0.004054675,0.00070981943,0.88280475],"study_design_scores_gemma":[0.00047478496,0.000029503553,0.0005248858,0.00012046946,0.000017920587,8.260978e-7,0.0000014080979,0.93103033,0.000010843333,0.008160865,0.059255898,0.00037224762],"about_ca_topic_score_codex":0.0005779669,"about_ca_topic_score_gemma":0.0025117449,"teacher_disagreement_score":0.8824325,"about_ca_system_score_codex":0.000095406234,"about_ca_system_score_gemma":0.00004929824,"threshold_uncertainty_score":0.9999666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034340523,0.00018786758,0.9959584,0.0014898764,0.00071566436,0.000916597,0.00012105557,0.00015365669,0.00042255572],"genre_scores_gemma":[0.033235595,0.000010938321,0.9651578,0.0009052617,0.00044617977,0.00009513536,0.000070749615,0.000028854214,0.00004947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655086,0.000012401927,0.0004134761,0.0015036968,0.00074686506,0.00077272166],"domain_scores_gemma":[0.99808013,0.00019910146,0.00019821103,0.001197167,0.00014958819,0.00017578319],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006149756,0.00041324025,0.0003530574,0.00044950328,0.00051556947,0.00039474026,0.0025185656,0.0002652579,0.000009743839],"category_scores_gemma":[0.000045434437,0.0003834282,0.00013294433,0.0004766406,0.00030479167,0.00017672259,0.00067551696,0.0005731179,0.000022973496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021112542,0.00007411382,7.59426e-7,0.000022895836,0.0000057417565,0.000017299646,0.00059133366,0.119513966,0.000013872548,0.1798567,0.000019841973,0.6998814],"study_design_scores_gemma":[0.0004573411,0.0002498179,0.00011592563,0.00031730699,0.000008326517,0.00004437094,4.115514e-7,0.8331727,0.00014806916,0.14880905,0.016097164,0.00057956495],"about_ca_topic_score_codex":0.0000074249015,"about_ca_topic_score_gemma":0.000015188954,"teacher_disagreement_score":0.7136587,"about_ca_system_score_codex":0.00034974204,"about_ca_system_score_gemma":0.00085159723,"threshold_uncertainty_score":0.9998618},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014731375,0.0000868721,0.99676853,0.0004307145,0.0002651298,0.00076698407,0.000012582242,0.00008580287,0.0014360574],"genre_scores_gemma":[0.15945019,0.00004202561,0.8393123,0.00082930404,0.000106686224,0.000022159047,0.000012932516,0.000037728234,0.00018667604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996042,0.000062517116,0.0006405876,0.0014824462,0.0011179511,0.0006544848],"domain_scores_gemma":[0.9972505,0.000754402,0.00041692346,0.001264885,0.00016343762,0.00014987186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009097324,0.000480969,0.0005777103,0.00065718446,0.00015257577,0.00029235106,0.002434863,0.00040094648,0.000010569769],"category_scores_gemma":[0.0001300649,0.00041598122,0.000071010974,0.00076421245,0.000510636,0.0004092073,0.0006634431,0.0008992325,0.0000098314085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010982436,0.0007150302,0.0013904818,0.0005177439,0.000042800486,0.00012271265,0.0037415188,0.5121147,0.00016895267,0.28823107,0.000078789446,0.19276635],"study_design_scores_gemma":[0.0012032305,0.0012450102,0.0015555107,0.0027197516,0.000012017372,0.000024044804,6.1240394e-7,0.73697525,0.0022642296,0.2496866,0.0029675246,0.0013462495],"about_ca_topic_score_codex":0.000059034366,"about_ca_topic_score_gemma":0.00012517594,"teacher_disagreement_score":0.22486052,"about_ca_system_score_codex":0.00051754905,"about_ca_system_score_gemma":0.0004624003,"threshold_uncertainty_score":0.9998292},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003972353,0.0007829957,0.99430376,0.00033314835,0.0023981945,0.0012537374,0.000012872415,0.00023004075,0.0006455305],"genre_scores_gemma":[0.1248594,0.000014167964,0.87260306,0.00065608486,0.00062499,0.000048036753,0.000017825405,0.00005775608,0.0011186666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495363,0.0001340016,0.000969537,0.00229364,0.000896183,0.00075298443],"domain_scores_gemma":[0.9955628,0.0008171364,0.0005392146,0.002289855,0.0005113627,0.0002796402],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0037280675,0.000600966,0.00091764145,0.0010314153,0.00048102337,0.0028112351,0.0070622917,0.0004135592,0.0000068074137],"category_scores_gemma":[0.00007018369,0.0005518358,0.00016660537,0.00061635155,0.0001636725,0.0013924873,0.0010245759,0.00053390476,0.00002300726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037739278,0.0000166079,0.000007209441,0.00003678659,0.000011586963,0.0000062283834,0.00037219474,0.6236958,0.00008914621,0.020663435,0.000007866392,0.35508937],"study_design_scores_gemma":[0.0003755658,0.0001516122,0.0000060528205,0.0003557489,0.000011171588,0.00005030718,3.1308e-7,0.9699712,0.00005290362,0.026501212,0.0018664494,0.0006574881],"about_ca_topic_score_codex":0.00009585486,"about_ca_topic_score_gemma":0.00011385513,"teacher_disagreement_score":0.35443187,"about_ca_system_score_codex":0.0004539402,"about_ca_system_score_gemma":0.0006244755,"threshold_uncertainty_score":0.99969333},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006533936,0.000118242206,0.9969512,0.0008234901,0.00039972615,0.0007000857,0.000025078993,0.000023006138,0.0003057752],"genre_scores_gemma":[0.87295246,0.000021720785,0.12607022,0.00067510596,0.000118360746,0.000018099108,0.000013723051,0.000017548173,0.00011277633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732584,0.000065612854,0.00049185887,0.000911822,0.00081531185,0.00038955206],"domain_scores_gemma":[0.9941122,0.004558867,0.00016119037,0.0009865875,0.00012230576,0.000058872534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028656316,0.00026803833,0.00043529697,0.0005411746,0.00017230243,0.00028819992,0.0023033367,0.00011694274,0.000003025604],"category_scores_gemma":[0.0002501533,0.00018561076,0.00008409675,0.00045490172,0.0008603271,0.0003078271,0.0012262866,0.0004082228,0.000004444308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045700526,0.00005991238,0.000057917907,0.000031182783,0.000008318569,0.000009770202,0.00021280609,0.14335078,0.000016564905,0.28551686,0.000076247205,0.5706139],"study_design_scores_gemma":[0.0007443613,0.00014421328,0.00089825055,0.00027165774,0.0000042585175,0.0000025687139,3.7204094e-7,0.78536135,0.00011235174,0.2121305,0.000078969075,0.00025115165],"about_ca_topic_score_codex":0.00012390286,"about_ca_topic_score_gemma":0.00029990383,"teacher_disagreement_score":0.8722991,"about_ca_system_score_codex":0.000083633895,"about_ca_system_score_gemma":0.0001538767,"threshold_uncertainty_score":0.7568987},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0839461,0.0003035404,0.90272444,0.00007834226,0.006198755,0.0041699586,0.00004257714,0.00007951556,0.0024567742],"genre_scores_gemma":[0.9963473,0.000010571379,0.0032767644,0.000016758699,0.0002494044,0.00003283129,0.000003731507,0.000013520195,0.00004913497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949759,0.0002303949,0.0012757145,0.00052412465,0.002586869,0.00040696494],"domain_scores_gemma":[0.99539036,0.0010786034,0.0010313172,0.0006813496,0.0017411556,0.000077246754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005717256,0.00030442447,0.0005925012,0.000674401,0.0012612414,0.0001537704,0.0008170681,0.00022516058,0.000014481929],"category_scores_gemma":[0.00030903495,0.00020441908,0.00013231301,0.0005448448,0.001241011,0.0002286251,0.00044891387,0.00026962376,0.000005549472],"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.000098569886,0.00041923867,0.0071298503,0.00025030438,0.00015546785,0.00035353703,0.15892069,0.03883118,0.000041642255,0.002030871,0.00013938948,0.79162925],"study_design_scores_gemma":[0.009116658,0.0035507253,0.015200864,0.0037544954,0.0007039904,0.00089222426,0.008215752,0.9405061,0.00019422828,0.010697731,0.0041480446,0.003019201],"about_ca_topic_score_codex":0.031033063,"about_ca_topic_score_gemma":0.104356386,"teacher_disagreement_score":0.9124012,"about_ca_system_score_codex":0.00031505452,"about_ca_system_score_gemma":0.0006570711,"threshold_uncertainty_score":0.97541934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040390703,0.00014161125,0.9948718,0.00008377912,0.0013362559,0.0008306862,0.000016488331,0.00021574879,0.002099717],"genre_scores_gemma":[0.110556595,0.000011220272,0.8878261,0.0006227999,0.00062348857,0.000040383533,0.000010049299,0.000107007174,0.00020234541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978132,0.000013506529,0.00047815466,0.0007039898,0.00053939933,0.0004517056],"domain_scores_gemma":[0.99621105,0.0028050004,0.00017290965,0.0005029382,0.00019134817,0.000116761665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034617496,0.0004897742,0.0004757409,0.0003553696,0.00012917476,0.0001074644,0.00072416983,0.00026862195,0.000012979033],"category_scores_gemma":[0.00021203028,0.0004584018,0.000116506395,0.00015774331,0.00022132146,0.00015702957,0.00013946384,0.0008601696,0.000034111054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011217917,0.000022455779,3.4259764e-7,0.00025374067,0.0000031360246,0.0000031942225,0.00012885538,0.8904552,0.0003684857,0.0003133912,0.0000058305786,0.10843418],"study_design_scores_gemma":[0.0002528851,0.00009971632,0.0000014253579,0.00012227682,0.000008639764,0.000004821783,5.4239223e-8,0.70612335,0.0060427026,0.28512165,0.001848416,0.00037407296],"about_ca_topic_score_codex":3.112532e-7,"about_ca_topic_score_gemma":0.0000012101704,"teacher_disagreement_score":0.28480828,"about_ca_system_score_codex":0.00016782833,"about_ca_system_score_gemma":0.00008376413,"threshold_uncertainty_score":0.9997868},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013631734,0.000512152,0.9896633,0.0006575107,0.0023466286,0.0005481225,0.000004494504,0.00020677477,0.006047402],"genre_scores_gemma":[0.268764,0.000040286304,0.72890735,0.0015488621,0.00047559632,0.000033189885,0.000023920156,0.000018592926,0.00018825803],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800694,0.000012411365,0.00043827423,0.0006653022,0.00044637575,0.00043070636],"domain_scores_gemma":[0.9981051,0.00043553088,0.00023892724,0.0007513801,0.00039150254,0.00007757401],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057619816,0.0003677388,0.00035267384,0.0008282594,0.00021521901,0.0006495988,0.0022440995,0.00036236062,0.0000057748402],"category_scores_gemma":[0.00021700181,0.0003040627,0.00012546302,0.00037101953,0.00033575433,0.0015318643,0.0005056826,0.00044627866,0.000041071737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039355396,0.000010060482,0.0000021795038,0.000037296475,0.000004021057,0.0000026381904,0.0011411497,0.008390233,0.000037770977,0.2811421,0.00004481239,0.7091838],"study_design_scores_gemma":[0.00040274506,0.00024184588,0.000113430724,0.00042564762,0.000007705663,0.000016106262,5.1884894e-7,0.32520372,0.0033126788,0.6649699,0.00475035,0.0005553422],"about_ca_topic_score_codex":0.000015442221,"about_ca_topic_score_gemma":0.00009892929,"teacher_disagreement_score":0.7086285,"about_ca_system_score_codex":0.0003264003,"about_ca_system_score_gemma":0.0007365016,"threshold_uncertainty_score":0.9999412},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037604193,0.00093563506,0.9877694,0.000566212,0.0012549384,0.00035065794,0.000005296909,0.00012013006,0.008960116],"genre_scores_gemma":[0.6976178,0.0002177413,0.29699352,0.0028615415,0.0010331674,0.000028161676,0.000042367577,0.000044962908,0.0011607038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713445,0.000033887703,0.00040790864,0.0012594855,0.0007037868,0.00046045906],"domain_scores_gemma":[0.9985193,0.00024024639,0.00024291173,0.00062040443,0.00018752585,0.00018963276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006677,0.00042090972,0.0004245399,0.0004345099,0.0003021842,0.00047928936,0.0013234902,0.00027764813,0.000041169696],"category_scores_gemma":[0.00007105164,0.00036702052,0.00008518586,0.00029609908,0.00063778315,0.0005315042,0.00081270456,0.00047877722,0.000045858626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024928277,0.00002563018,0.00008159336,0.000030775984,0.000007930728,0.000053528933,0.0007990628,0.0030781785,0.000057566544,0.82741135,0.000026835887,0.16842504],"study_design_scores_gemma":[0.000467815,0.00023235926,0.0007521285,0.00032187387,0.000009482319,0.00011902997,2.0938158e-7,0.09806412,0.0005205846,0.8944888,0.004348542,0.00067507714],"about_ca_topic_score_codex":0.000013126846,"about_ca_topic_score_gemma":0.00005045822,"teacher_disagreement_score":0.6975802,"about_ca_system_score_codex":0.00043611915,"about_ca_system_score_gemma":0.0006647389,"threshold_uncertainty_score":0.99987817},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047517824,0.00085067103,0.9951533,0.00012497521,0.0009951604,0.00039376324,0.0000017649593,0.000794773,0.0016380436],"genre_scores_gemma":[0.02015891,0.00014137161,0.9791223,0.00023733686,0.00019226577,0.00001841779,0.0000019648464,0.000058463396,0.00006900609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995751,0.000030196134,0.0006669539,0.0018191999,0.00084566243,0.0008869733],"domain_scores_gemma":[0.9973822,0.00019271075,0.00021248417,0.0018927134,0.00014961838,0.000170225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010486105,0.000649568,0.00062302186,0.0016611071,0.00013316446,0.00033611973,0.004352,0.0004206421,0.000014847187],"category_scores_gemma":[0.0000028370173,0.0006640985,0.00013397391,0.0007371937,0.00036704846,0.0007364588,0.0015273627,0.001241305,0.000032758675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023090324,0.000015605148,0.000022022263,0.000020273415,0.0000035434437,0.0001378971,0.0010701764,0.2553649,0.000031421045,0.34561947,0.000008592365,0.3977038],"study_design_scores_gemma":[0.00012684683,0.00005363625,0.000017200324,0.000584281,0.0000016141728,0.0000478218,1.7418385e-8,0.5941641,0.00047598584,0.38029525,0.023540584,0.0006926518],"about_ca_topic_score_codex":0.00003823932,"about_ca_topic_score_gemma":0.000029504585,"teacher_disagreement_score":0.39701113,"about_ca_system_score_codex":0.0005455482,"about_ca_system_score_gemma":0.0002895548,"threshold_uncertainty_score":0.99958104},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077466277,0.000060900733,0.99331284,0.00038298834,0.003926369,0.00042524113,0.0000026217103,0.00026814625,0.0008462621],"genre_scores_gemma":[0.76278454,0.000013003352,0.2361478,0.00050402293,0.00043935145,0.000022355598,0.000005847344,0.000022040165,0.00006104677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965467,0.000027722841,0.000609497,0.0012746266,0.0010633027,0.0004781408],"domain_scores_gemma":[0.99499696,0.0023414486,0.0002702616,0.0017647336,0.00045884354,0.00016774873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010364563,0.00041608108,0.0004182103,0.00075831957,0.00044100932,0.00048714172,0.0022463314,0.00034394968,0.000030915216],"category_scores_gemma":[0.0004995164,0.00035264072,0.00014240576,0.00058422954,0.00044945374,0.001223611,0.00040575213,0.00091806997,0.00011892347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032796308,0.000015199291,0.000096277894,0.000017308503,0.0000027608667,0.000011736665,0.00030299844,0.49756557,0.00012369001,0.0017091798,9.298317e-7,0.50015104],"study_design_scores_gemma":[0.00021985838,0.000084041356,0.0004280471,0.00035807898,0.000004294304,0.00000579832,7.911346e-8,0.967153,0.0031082917,0.02617016,0.001979809,0.0004885226],"about_ca_topic_score_codex":0.000017745246,"about_ca_topic_score_gemma":0.00004997749,"teacher_disagreement_score":0.76200986,"about_ca_system_score_codex":0.00021910985,"about_ca_system_score_gemma":0.0007977322,"threshold_uncertainty_score":0.99989253},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007895581,0.00014389314,0.97871137,0.00014466516,0.0009092724,0.015436166,0.000025542677,0.00036390615,0.0041862573],"genre_scores_gemma":[0.043109003,0.000057684578,0.946672,0.0020505816,0.0013414951,0.0065301815,0.00004238845,0.00010797179,0.00008868931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99421334,0.000044692595,0.00068433845,0.0023982734,0.0016021355,0.0010571916],"domain_scores_gemma":[0.99566793,0.0002373234,0.00039444547,0.0029526511,0.00031708248,0.00043056018],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010134416,0.0007547574,0.0006230531,0.0011545314,0.0005717574,0.00084165146,0.005692757,0.00046135494,0.00009537481],"category_scores_gemma":[0.000046719386,0.0006874181,0.00021177578,0.001011463,0.0009898881,0.0010540566,0.0014003735,0.0011149616,0.000087546716],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057355217,0.00069111644,0.00005548822,0.0002872458,0.00002693725,0.00082876446,0.004909005,0.037691835,0.0002906567,0.045699157,0.00053985824,0.90892255],"study_design_scores_gemma":[0.0017796345,0.0011878079,0.0015505936,0.00085004856,0.000016817121,0.0005714563,5.282289e-7,0.7860016,0.0035608753,0.12069534,0.080545835,0.003239452],"about_ca_topic_score_codex":0.00005901775,"about_ca_topic_score_gemma":0.00011991073,"teacher_disagreement_score":0.9056831,"about_ca_system_score_codex":0.00022777078,"about_ca_system_score_gemma":0.00069898064,"threshold_uncertainty_score":0.9996869},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025153868,0.0002032441,0.9877351,0.0005125411,0.0070450497,0.00053369557,0.000012574694,0.0005274167,0.0009149784],"genre_scores_gemma":[0.402707,0.000061711355,0.5901483,0.0020866017,0.004531846,0.000021905265,0.000055379955,0.00010086311,0.0002863559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947851,0.00009353934,0.0008134889,0.0020744966,0.0014336,0.00079978566],"domain_scores_gemma":[0.99601376,0.0002846198,0.00050132413,0.0023805466,0.00043102453,0.00038871172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011545735,0.0007309211,0.0007187698,0.0013675822,0.00056280446,0.0007783577,0.004168465,0.0008333953,0.000032613447],"category_scores_gemma":[0.000041080704,0.00066185585,0.00018477793,0.0010628537,0.00066399673,0.0010045088,0.0011520387,0.0019495123,0.000046425055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015152399,0.00007761829,0.000010654777,0.000105863226,0.0000065937284,0.00011263122,0.00027345214,0.013040688,0.0058385814,0.026142113,0.000010085984,0.95436656],"study_design_scores_gemma":[0.00037077526,0.0005071193,0.000041573225,0.0007983469,0.0000111501695,0.000125768,2.1584528e-7,0.97098625,0.008782568,0.010344572,0.007174969,0.000856685],"about_ca_topic_score_codex":0.000076772856,"about_ca_topic_score_gemma":0.00072110415,"teacher_disagreement_score":0.9579456,"about_ca_system_score_codex":0.00065823784,"about_ca_system_score_gemma":0.0007923549,"threshold_uncertainty_score":0.99958324},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004531187,0.0005095652,0.9945333,0.001284273,0.0018058373,0.00077837973,0.000014725097,0.0001974114,0.0008719723],"genre_scores_gemma":[0.0042743874,0.00006015679,0.9911222,0.0024936364,0.0012009676,0.000052425115,0.000014301652,0.00004643335,0.0007354998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633133,0.000035903344,0.0005660848,0.0015326345,0.00081217935,0.00072184816],"domain_scores_gemma":[0.99766296,0.00053930155,0.00036740926,0.00085371063,0.00037329385,0.00020333412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010119292,0.0005038136,0.00057853403,0.0005555291,0.00028927234,0.00048016894,0.0024628122,0.0002656546,0.000011923181],"category_scores_gemma":[0.00018942794,0.00044002372,0.00015505255,0.0007011586,0.00034469485,0.0005855301,0.0007008222,0.00041036052,0.000017393808],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075414905,0.00003500583,0.000002238573,0.00005564497,0.000008427052,0.000008854259,0.00022471203,0.006826845,0.00009528784,0.015829125,0.00003499374,0.9768713],"study_design_scores_gemma":[0.0004131506,0.00027950984,0.00001666272,0.00026848074,0.000008824631,0.000022671531,9.65936e-8,0.8344172,0.0020882536,0.15399745,0.007877509,0.0006101585],"about_ca_topic_score_codex":0.000008221167,"about_ca_topic_score_gemma":0.000008155216,"teacher_disagreement_score":0.97626114,"about_ca_system_score_codex":0.00021492699,"about_ca_system_score_gemma":0.0003492627,"threshold_uncertainty_score":0.99980515},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8092625,0.0024623722,0.1796427,0.000018414781,0.0033676326,0.0013827018,0.00001766851,0.00026407605,0.0035819134],"genre_scores_gemma":[0.9968785,0.00019242005,0.0024238664,0.00006169798,0.00031911067,0.0000062684935,0.0000024871838,0.00004333196,0.00007232907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772805,0.00002251184,0.00044504929,0.00071590126,0.0006646581,0.00042380526],"domain_scores_gemma":[0.9987841,0.0001926068,0.00012316211,0.0007015555,0.000097493845,0.000101038786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041705766,0.00045087858,0.0005561893,0.00030716267,0.00011248588,0.00008440685,0.00062160235,0.0003207893,0.000066842214],"category_scores_gemma":[0.00001679778,0.0004123399,0.00005264545,0.00029368376,0.00035382647,0.00027903513,0.00042487308,0.0008597297,0.0000049873406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004256115,0.00025227264,0.012721666,0.0010111394,0.000070715454,0.000069049755,0.010938225,0.6014977,0.00022343907,0.00018691724,0.00013251962,0.3728538],"study_design_scores_gemma":[0.00077624596,0.0004116063,0.0065084333,0.0006397179,0.00003075649,0.000026343787,0.0000013764662,0.9884421,0.00040533024,0.0016478652,0.0004668777,0.0006433453],"about_ca_topic_score_codex":0.0000148588315,"about_ca_topic_score_gemma":0.000107137734,"teacher_disagreement_score":0.3869444,"about_ca_system_score_codex":0.00016919621,"about_ca_system_score_gemma":0.000038513164,"threshold_uncertainty_score":0.99983287},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063747647,0.00044660424,0.9710118,0.0080590565,0.00068385433,0.0015344431,0.000023381204,0.00011552064,0.0117505565],"genre_scores_gemma":[0.9217054,0.00007900543,0.07128077,0.0051747602,0.0002755147,0.000009595384,0.00016583849,0.00003802672,0.0012710564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980503,0.000028685483,0.00023202934,0.00073180185,0.0006468359,0.00031035574],"domain_scores_gemma":[0.9988473,0.00011843269,0.00011505928,0.00048920943,0.0002475921,0.00018238385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037641588,0.00030127604,0.00036775315,0.00040050028,0.00013379415,0.00014781528,0.00014424752,0.00021330695,0.000034454664],"category_scores_gemma":[0.00014142091,0.0002312156,0.00006530967,0.00017407007,0.0005230051,0.000113284856,0.00006141129,0.0005083831,0.000009893153],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041327276,0.0016035684,0.2174318,0.0019779273,0.0002958672,0.007939033,0.0019712886,0.012103588,0.005506486,0.013040613,0.007456389,0.72654074],"study_design_scores_gemma":[0.015080571,0.018113477,0.22601366,0.0109218,0.000402598,0.001939234,0.0000027319138,0.49987167,0.049470108,0.16442762,0.009569216,0.0041873013],"about_ca_topic_score_codex":0.000049333496,"about_ca_topic_score_gemma":0.0000945242,"teacher_disagreement_score":0.91533065,"about_ca_system_score_codex":0.00023479061,"about_ca_system_score_gemma":0.0002555992,"threshold_uncertainty_score":0.94286984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016480358,0.000029945024,0.9723442,0.00019706383,0.0004910138,0.00025425295,0.000018243722,0.000034153207,0.010150745],"genre_scores_gemma":[0.89691484,0.000008562519,0.10029266,0.0012082881,0.00013386937,0.000003626219,0.0000049893597,0.000011952501,0.0014212184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953624,0.00002633875,0.0010494024,0.000854708,0.0023350138,0.00037212958],"domain_scores_gemma":[0.9974831,0.00040554858,0.00046332832,0.0009701125,0.0005612775,0.00011663681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037046724,0.00031665628,0.00057631766,0.0009807391,0.00009555001,0.00021767344,0.0025905743,0.00025854263,0.0003252492],"category_scores_gemma":[0.00048919686,0.00021701548,0.00023823237,0.0005706017,0.0010876685,0.00057306315,0.0011743471,0.00048970507,0.00007479616],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004347296,0.000064449036,0.00043211985,0.000021185282,0.0000077427085,0.0000079748625,0.0012013187,0.085438214,0.0003099918,0.014230434,0.00018012541,0.89806294],"study_design_scores_gemma":[0.0002137635,0.00014084509,0.004636748,0.000090815454,0.000011104804,0.0000031027403,0.0000021375447,0.71840006,0.0004979338,0.27430457,0.0012685277,0.00043038608],"about_ca_topic_score_codex":0.000011619061,"about_ca_topic_score_gemma":0.00004553813,"teacher_disagreement_score":0.8976326,"about_ca_system_score_codex":0.00014041008,"about_ca_system_score_gemma":0.00023559328,"threshold_uncertainty_score":0.88496345},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034077544,0.0010298502,0.99726474,0.0004916155,0.00034791138,0.00023092514,0.0000030544143,0.00018758724,0.0004102134],"genre_scores_gemma":[0.124864444,0.000057263467,0.8745968,0.0002864256,0.00007224829,0.0000020936377,0.0000050072254,0.000010177338,0.000105548104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815965,0.000019965417,0.0003396953,0.0007326511,0.00051221636,0.00023585052],"domain_scores_gemma":[0.99867433,0.00012906437,0.00030291968,0.00053693075,0.00028697288,0.00006980262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043339515,0.0002591293,0.00029037357,0.0006516373,0.00011993897,0.00022638564,0.0010895729,0.00026279455,0.0000044036015],"category_scores_gemma":[0.00011133116,0.00024065548,0.00004810661,0.00039933584,0.0003913356,0.00079507194,0.00040745415,0.00043765106,0.0000015172129],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024197593,0.000017603721,0.000026900463,0.000030891813,0.0000031835173,0.000011149511,0.00045567463,0.0005175995,0.0015259642,0.028417794,0.0000031342395,0.9689877],"study_design_scores_gemma":[0.00027158513,0.00017907064,0.00042023388,0.00043314457,0.000011901873,0.00007107738,1.9081214e-7,0.56403977,0.029126137,0.40470704,0.00021702012,0.0005228386],"about_ca_topic_score_codex":0.000041068815,"about_ca_topic_score_gemma":0.00003598046,"teacher_disagreement_score":0.96846485,"about_ca_system_score_codex":0.00014526844,"about_ca_system_score_gemma":0.0003097159,"threshold_uncertainty_score":0.98136455},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010391468,0.0010242331,0.99389297,0.0012250504,0.0015679806,0.0008524699,0.0000048159854,0.00022151774,0.00017183764],"genre_scores_gemma":[0.46468928,0.000084991,0.53238004,0.0010567397,0.0004635377,0.000094372,0.000013567756,0.000042515738,0.0011749315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968812,0.000044135508,0.0005404518,0.0013642826,0.0005066148,0.0006633405],"domain_scores_gemma":[0.99806017,0.00029826566,0.00050267414,0.00066018477,0.00035894613,0.00011976207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009633779,0.00043345592,0.00052798685,0.00062073214,0.00038674823,0.0005233074,0.0018713255,0.00035347082,0.0000017388056],"category_scores_gemma":[0.000112725604,0.00036308196,0.00008800091,0.00069209177,0.0003777857,0.00047630587,0.000799609,0.0006720687,0.0000056175713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015444984,0.000119441895,0.0024234038,0.0010207269,0.00005332231,0.00008998224,0.006024194,0.044273548,0.0031360283,0.035267808,0.000082445215,0.90749365],"study_design_scores_gemma":[0.00075686484,0.0002898074,0.0002366859,0.0020688735,0.000011479862,0.000090201494,0.000006336176,0.9699252,0.00087521505,0.0213339,0.003845682,0.00055970275],"about_ca_topic_score_codex":0.000042252566,"about_ca_topic_score_gemma":0.00027011317,"teacher_disagreement_score":0.9256517,"about_ca_system_score_codex":0.0006967749,"about_ca_system_score_gemma":0.0012946172,"threshold_uncertainty_score":0.9998821},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021146417,0.00024305098,0.9974691,0.0003828455,0.00052336825,0.00028880863,0.0001621987,0.00018962403,0.0005294919],"genre_scores_gemma":[0.02192662,0.00006557462,0.9746729,0.0008883587,0.0009829422,0.0000068760637,0.00024574346,0.00003177247,0.0011792231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967625,0.000027371638,0.00046583958,0.0015459401,0.00065392046,0.0005444301],"domain_scores_gemma":[0.9977565,0.00038787,0.00027713206,0.001173294,0.00026409535,0.00014112497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007168734,0.00043735982,0.0005091603,0.0007273241,0.00024203477,0.00038026145,0.002045563,0.00025100258,0.000005132585],"category_scores_gemma":[0.000080141246,0.00040694213,0.0001756292,0.0005117538,0.00031964472,0.0006150685,0.0004789481,0.0005411868,0.000024859792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005207536,0.000030615243,0.0000021522117,0.000016268645,0.000013021537,0.000030080862,0.00079603057,0.13091154,0.00016336853,0.00067638216,0.000036298527,0.86731905],"study_design_scores_gemma":[0.00017108327,0.00017868263,0.0000139162985,0.0004621957,0.000022185715,0.00002813316,3.4215032e-7,0.98748195,0.000578936,0.010142179,0.000508647,0.00041172173],"about_ca_topic_score_codex":0.000012601211,"about_ca_topic_score_gemma":0.000018398721,"teacher_disagreement_score":0.8669073,"about_ca_system_score_codex":0.00018319533,"about_ca_system_score_gemma":0.00029983412,"threshold_uncertainty_score":0.99983823},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007481501,0.000306294,0.9956129,0.00006995906,0.002221333,0.00026060914,0.0000028441768,0.00020502294,0.0005728822],"genre_scores_gemma":[0.3759617,0.000107366526,0.62202823,0.00018823748,0.001498073,0.0000069839857,0.000007685566,0.00010809985,0.00009363131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986907,0.00000619667,0.00019364643,0.000526864,0.00030871682,0.00027387412],"domain_scores_gemma":[0.9992637,0.00008832147,0.00005827107,0.00042548822,0.00008453102,0.00007971414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025301098,0.00026928837,0.00020574768,0.00042080515,0.00010963045,0.00016473912,0.00025189115,0.00030282457,0.0000052014793],"category_scores_gemma":[0.000029480261,0.00026688157,0.000033085234,0.000201057,0.00036805903,0.0001084682,0.00010606563,0.00071144017,0.000017031109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.139681e-7,0.000002426405,0.0000013222851,0.000022075134,0.000002173281,0.0000080008895,0.0001835249,0.040058482,0.006161902,0.00001186423,5.112948e-7,0.9535472],"study_design_scores_gemma":[0.00007323259,0.000022639222,0.00030533056,0.0001119859,0.000006007532,0.00006243305,6.407345e-8,0.9853805,0.012064675,0.0009822544,0.0007120046,0.00027887747],"about_ca_topic_score_codex":0.0000093866265,"about_ca_topic_score_gemma":0.00005704913,"teacher_disagreement_score":0.95326835,"about_ca_system_score_codex":0.0001682476,"about_ca_system_score_gemma":0.000026177655,"threshold_uncertainty_score":0.99997836},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015155166,0.00014414306,0.9939991,0.00036700044,0.0032282926,0.00082408875,0.00003335845,0.0001174424,0.0011350141],"genre_scores_gemma":[0.009914829,0.00003257177,0.98890597,0.00021813247,0.00025881667,0.00004039295,0.000019695899,0.000034255532,0.000575361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654996,0.000040317802,0.000756491,0.0012514973,0.00077925366,0.0006224512],"domain_scores_gemma":[0.99606043,0.00047918755,0.00060412503,0.0020625559,0.00063170365,0.00016197714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016628967,0.00043241243,0.0005797139,0.0007946661,0.00029712566,0.0002426013,0.004110395,0.0004521914,0.0000133817575],"category_scores_gemma":[0.0002690687,0.00042675872,0.00019285611,0.0007461116,0.0009940091,0.0006403022,0.00075327285,0.0007647826,0.000013521135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007230705,0.00005944773,0.000060406535,0.00006858388,0.000012691746,0.000003680739,0.000330037,0.0045806165,0.0041849,0.7855581,0.00003961955,0.20509467],"study_design_scores_gemma":[0.00043354018,0.00027050672,0.00028907688,0.00015413517,0.000016965674,0.000035920475,2.054583e-7,0.33436203,0.06998967,0.58131135,0.012365034,0.0007715785],"about_ca_topic_score_codex":0.000023841867,"about_ca_topic_score_gemma":0.000021573442,"teacher_disagreement_score":0.3297814,"about_ca_system_score_codex":0.00021041668,"about_ca_system_score_gemma":0.0005691323,"threshold_uncertainty_score":0.99981844},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011387924,0.00072000164,0.9248701,0.0015337067,0.00078919553,0.00027650874,0.000012015445,0.000084232,0.071600385],"genre_scores_gemma":[0.975593,0.00020427005,0.016241914,0.0007791422,0.0019551828,0.000008680622,0.000019425062,0.000027396074,0.005171029],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982028,0.00003588102,0.00023129268,0.0005804469,0.000571793,0.00037776286],"domain_scores_gemma":[0.99909556,0.00025665035,0.00013576268,0.00024278829,0.00015751745,0.00011172456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062510394,0.00019559167,0.00023409099,0.0003126007,0.00081193313,0.00035903,0.00052906724,0.00017907083,0.00004430598],"category_scores_gemma":[0.0001250066,0.00018658597,0.000044838216,0.0001939075,0.001576969,0.00029178328,0.00018007372,0.00033248123,0.0000130725175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007675061,0.000022108667,0.00052373816,0.000018072471,0.000010258891,0.00004754881,0.0018215663,0.00783579,0.000020613777,0.31646582,0.00034889736,0.6728779],"study_design_scores_gemma":[0.00071133167,0.00014026504,0.0032663865,0.0003907209,0.000057026522,0.000024488016,0.0000020766477,0.12655161,0.00009916642,0.5566081,0.3107773,0.0013715057],"about_ca_topic_score_codex":0.00084711856,"about_ca_topic_score_gemma":0.0011663776,"teacher_disagreement_score":0.97547907,"about_ca_system_score_codex":0.00015518896,"about_ca_system_score_gemma":0.0003939093,"threshold_uncertainty_score":0.7608755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013167863,0.0005084872,0.9958549,0.0012120517,0.0014980137,0.0006785834,0.000006491044,0.000037597572,0.00019066564],"genre_scores_gemma":[0.006210668,0.000054980814,0.99282485,0.00057208014,0.00024000058,0.000039325365,0.0000016927229,0.000017640907,0.000038775186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718285,0.00009322783,0.0006197711,0.0009830409,0.00053007435,0.00059106026],"domain_scores_gemma":[0.99559855,0.0026976417,0.0003652236,0.001057951,0.00020277283,0.00007785875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031751094,0.00033202232,0.00057351566,0.0004986042,0.000153974,0.00012403575,0.0030165666,0.00025895517,0.000005574741],"category_scores_gemma":[0.00032975955,0.00023515195,0.00016357085,0.0007124004,0.00070128817,0.00040954343,0.0006839633,0.0005605681,0.0000029215412],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007252801,0.000021019578,0.0000057718203,0.000027408056,0.000006319072,0.000005601102,0.00050256064,0.009796079,0.00026842472,0.0729924,0.0000010419733,0.9163661],"study_design_scores_gemma":[0.00030827822,0.00024437456,0.00020792316,0.00012743541,0.0000069084385,0.000020591218,4.0856756e-7,0.539142,0.002479405,0.45661265,0.0005770412,0.0002729692],"about_ca_topic_score_codex":0.00008274985,"about_ca_topic_score_gemma":0.000026779488,"teacher_disagreement_score":0.9160932,"about_ca_system_score_codex":0.00018302078,"about_ca_system_score_gemma":0.00046261796,"threshold_uncertainty_score":0.9589218},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15284213,0.003746353,0.8129226,0.001427135,0.0020135206,0.0022381416,0.00006346089,0.0002686306,0.02447805],"genre_scores_gemma":[0.98526907,0.00017969379,0.013174647,0.00029936034,0.000265839,0.0000030179408,0.000020583358,0.000019291994,0.0007684995],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998544,0.000031485823,0.00028020318,0.00055186875,0.00034433647,0.00024811985],"domain_scores_gemma":[0.9988158,0.00015920772,0.00024182165,0.00064641336,0.00009567097,0.000041089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056292873,0.00029586646,0.00030427158,0.00015105873,0.00015292162,0.000058355297,0.00059796864,0.0002678044,5.540321e-7],"category_scores_gemma":[0.00014176367,0.00017376598,0.00013807202,0.00012919688,0.0006729004,0.0000042191286,0.00017367807,0.00026509076,0.0000014730983],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012205051,0.000015058772,0.000060538066,0.000024489722,0.00003481587,0.000008247246,0.000027052902,0.0019965316,0.111180626,0.00029055835,0.00008501093,0.886155],"study_design_scores_gemma":[0.00012294513,0.001690559,0.000049145096,0.00019193649,0.000018050963,0.000013665476,1.2216044e-7,0.0016798327,0.9886686,0.0036689846,0.0036553696,0.00024073981],"about_ca_topic_score_codex":0.0000028384886,"about_ca_topic_score_gemma":0.0000637555,"teacher_disagreement_score":0.88591427,"about_ca_system_score_codex":0.00003672761,"about_ca_system_score_gemma":0.000085409185,"threshold_uncertainty_score":0.70859706},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012679923,0.0007644032,0.994266,0.0014647346,0.000480125,0.0004400701,0.000008387777,0.00019343261,0.0022560866],"genre_scores_gemma":[0.110775575,0.00015105755,0.8836445,0.0041863048,0.00016569826,0.000038007714,0.0000041555177,0.000055115946,0.0009795931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952369,0.000043251057,0.00055548444,0.002064714,0.0013624972,0.0007371591],"domain_scores_gemma":[0.9967235,0.00020924017,0.00021727213,0.0022579727,0.00035786827,0.00023418512],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074309,0.0007328571,0.00082290394,0.00058259163,0.00033406177,0.0004947765,0.0044032712,0.0002832396,0.000036143785],"category_scores_gemma":[0.00003639519,0.0005349684,0.00020239908,0.0005842828,0.0008930149,0.0007900997,0.0012476762,0.00088471273,0.000066429886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024816984,0.0001185757,0.000021210297,0.000053293046,0.00022586831,0.00022921624,0.0025435642,0.8545764,0.00014307069,0.016917085,0.00044687977,0.12470003],"study_design_scores_gemma":[0.0002978005,0.0003903849,0.000008530528,0.00014665526,0.00007076118,0.0001308052,9.59883e-8,0.96427757,0.0023711466,0.027094692,0.004251596,0.0009599892],"about_ca_topic_score_codex":0.00003116122,"about_ca_topic_score_gemma":0.00012783107,"teacher_disagreement_score":0.12374005,"about_ca_system_score_codex":0.00032046365,"about_ca_system_score_gemma":0.0010055706,"threshold_uncertainty_score":0.9997102},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000686715,0.0017749215,0.99200094,0.00045767927,0.0013695667,0.0002879931,0.0000052061,0.00014741316,0.0038875865],"genre_scores_gemma":[0.5551041,0.00012065479,0.44349658,0.00051748386,0.0005639012,0.00001534205,0.0000038131052,0.000044616943,0.00013353986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997274,0.000023763054,0.0004888091,0.00082927174,0.0008584669,0.0005256832],"domain_scores_gemma":[0.9979056,0.00043415168,0.00021282374,0.001254533,0.0000933039,0.000099564764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066122424,0.00038679922,0.00042565665,0.00034933243,0.00025809236,0.0004740196,0.0033396818,0.00017857135,0.000008679797],"category_scores_gemma":[0.000020476089,0.00026638267,0.00014404669,0.00042407843,0.00047721266,0.00021976944,0.0005081484,0.00043474944,0.000023280667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010484592,0.000026269881,0.000024703275,0.00013747884,0.000018635166,0.000086274835,0.0004496656,0.20958179,0.000063770036,0.051469155,0.000032223048,0.7380995],"study_design_scores_gemma":[0.0001654672,0.00015934034,0.000046365396,0.0005144095,0.0000055006744,0.000034899655,2.4931404e-7,0.9848539,0.00048250912,0.008380857,0.0049937624,0.00036272864],"about_ca_topic_score_codex":0.000037001868,"about_ca_topic_score_gemma":0.000017733299,"teacher_disagreement_score":0.77527213,"about_ca_system_score_codex":0.00020695459,"about_ca_system_score_gemma":0.00027789318,"threshold_uncertainty_score":0.99997884},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032102776,0.00011872301,0.98528904,0.001481796,0.0010570658,0.00044877702,0.000005801238,0.000083300074,0.011483393],"genre_scores_gemma":[0.20442949,0.00007146203,0.7844059,0.009579434,0.00022720937,0.000035367266,0.000020160009,0.000071777984,0.001159211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965839,0.00003717764,0.0006092575,0.0012206343,0.0008327619,0.00071627204],"domain_scores_gemma":[0.9984215,0.0002550106,0.00015609383,0.0008718868,0.00011020069,0.00018531966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060126424,0.00045128854,0.00043788375,0.0008364562,0.00013156196,0.00059031474,0.001817674,0.00019822153,0.00003795582],"category_scores_gemma":[0.00004446138,0.00041515284,0.000117220305,0.00087052607,0.00025030147,0.0013686115,0.00035313363,0.000580842,0.00006340114],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006360532,0.00005232622,0.000028982544,0.000017527182,0.000007143831,0.00014209952,0.00078321586,0.0068168067,0.00007933972,0.039004356,0.000146632,0.9529152],"study_design_scores_gemma":[0.0007513077,0.00034425504,0.00013373628,0.0002905982,0.0000071919444,0.00012166632,3.5050633e-7,0.54868007,0.001738689,0.43165988,0.015174396,0.0010978453],"about_ca_topic_score_codex":0.000016845364,"about_ca_topic_score_gemma":0.000048614776,"teacher_disagreement_score":0.95181733,"about_ca_system_score_codex":0.00029682068,"about_ca_system_score_gemma":0.00037963103,"threshold_uncertainty_score":0.99983},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006557813,0.00031408292,0.9944222,0.000158412,0.00055395544,0.0003525394,0.0000013072328,0.00005952683,0.0034822049],"genre_scores_gemma":[0.83176285,0.000020653371,0.16790025,0.00006964609,0.00010200068,0.000011291234,0.0000074542795,0.000011035406,0.00011482855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976002,0.000036551934,0.00049850985,0.00077642006,0.0007396707,0.00034863147],"domain_scores_gemma":[0.9984703,0.00023071095,0.00033136786,0.00067264703,0.00022518083,0.000069766764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047834823,0.0002921232,0.0003875319,0.0006821748,0.00017840303,0.0001113403,0.0011125241,0.00022188961,0.000005556938],"category_scores_gemma":[0.00004087261,0.0002369914,0.00005892161,0.0007010052,0.00096023007,0.0004927218,0.00025690568,0.0003722719,0.000009906145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001644026,0.0000693595,0.003575384,0.00006318808,0.000014942919,0.00018754747,0.0061415248,0.029560195,0.000042038617,0.86681306,0.000013166355,0.09350315],"study_design_scores_gemma":[0.0015379747,0.0007910283,0.008411916,0.0002992062,0.000013724397,0.00074822933,0.0000029500854,0.12950177,0.0008300683,0.84974974,0.006614088,0.0014993257],"about_ca_topic_score_codex":0.0001037214,"about_ca_topic_score_gemma":0.0005754657,"teacher_disagreement_score":0.8311071,"about_ca_system_score_codex":0.0001966984,"about_ca_system_score_gemma":0.0009036941,"threshold_uncertainty_score":0.9664229},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023449995,0.00021580697,0.99547327,0.000102004415,0.0007088603,0.0005857848,0.00004219614,0.00006292181,0.00046415103],"genre_scores_gemma":[0.5514771,0.000014410491,0.4477177,0.00057301123,0.000105782725,0.000008794851,0.000053711505,0.000030738353,0.000018781511],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99424446,0.00014147689,0.0010433899,0.0024328877,0.0014781243,0.0006596452],"domain_scores_gemma":[0.9940935,0.00050341507,0.0005959969,0.004464688,0.00020502498,0.00013741147],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002070272,0.0005604692,0.00076134206,0.0009529817,0.00021640904,0.00033610887,0.0074348566,0.00027276407,0.00002057853],"category_scores_gemma":[0.00022323235,0.0004861896,0.000048423375,0.0009823954,0.00033412728,0.0008222444,0.0042984798,0.0010483844,0.0000033266315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031291005,0.00053655053,0.004580168,0.0001967263,0.00002360179,0.00032229134,0.0015224552,0.07508388,0.00019049695,0.0057222825,0.000053856467,0.9117364],"study_design_scores_gemma":[0.0014035827,0.0005610164,0.0023775175,0.0010669216,0.000014724862,0.00001761139,0.000003759888,0.9648833,0.0004289343,0.02742047,0.00083564187,0.0009864934],"about_ca_topic_score_codex":0.0003241116,"about_ca_topic_score_gemma":0.0005540374,"teacher_disagreement_score":0.9107499,"about_ca_system_score_codex":0.00024210992,"about_ca_system_score_gemma":0.00060247997,"threshold_uncertainty_score":0.99975896},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2567166,0.0001563104,0.7410186,0.0011569577,0.00014171234,0.0007522099,0.00000659717,0.000012294837,0.000038729133],"genre_scores_gemma":[0.9306912,0.0000020335447,0.068947054,0.00014929792,0.00011228058,0.00008075432,0.000008027512,0.0000079234,0.0000014438104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985259,0.000035535068,0.00021323854,0.00044790166,0.0004462473,0.0003311371],"domain_scores_gemma":[0.9984028,0.0007152185,0.000066631444,0.0005609922,0.00017750649,0.00007689639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008077542,0.0001131867,0.00017700976,0.0002760329,0.00008811858,0.00003868565,0.00050391554,0.000040057388,0.000014410355],"category_scores_gemma":[0.00047538965,0.00007579136,0.00005785314,0.0011233644,0.00086620357,0.000098786375,0.00008998173,0.00037424508,7.235901e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012170977,0.000431018,0.26483646,0.0004247284,0.000008564259,0.00001263312,0.00033991,0.020937221,0.07226759,0.00018589327,0.000026201971,0.6404081],"study_design_scores_gemma":[0.00045176034,0.00002825158,0.38884792,0.000027513093,0.000004999895,0.00000765205,0.0000022908837,0.60093254,0.009329937,0.00030340633,0.000013637085,0.000050115228],"about_ca_topic_score_codex":0.000082338054,"about_ca_topic_score_gemma":0.000050754752,"teacher_disagreement_score":0.6739746,"about_ca_system_score_codex":0.00013710305,"about_ca_system_score_gemma":0.00067098276,"threshold_uncertainty_score":0.31915632},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005935728,0.00044871413,0.98621947,0.00050995324,0.0018117228,0.00022186195,0.00003172535,0.00031648687,0.010380711],"genre_scores_gemma":[0.2958256,0.00006484542,0.6727073,0.0075647617,0.0042689727,0.00004112795,0.00012181526,0.00018076894,0.019224813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961547,0.000026552387,0.00049336447,0.0015914303,0.0009961897,0.0007377484],"domain_scores_gemma":[0.99744016,0.0005029239,0.00024700174,0.0014390509,0.00020546158,0.00016542486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056176406,0.0005359178,0.0005130749,0.0007922011,0.00032728285,0.00065811916,0.0034280962,0.00031060324,0.00012107454],"category_scores_gemma":[0.000079480444,0.00050792244,0.0002125506,0.0005289278,0.0006066914,0.00054331415,0.0014083829,0.00096353143,0.0001927058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010241159,0.000088506735,0.000062396655,0.000075972755,0.000030715233,0.00068037026,0.00059193344,0.12826216,0.000596609,0.019778011,0.0070435107,0.8427796],"study_design_scores_gemma":[0.00024959128,0.00013145395,0.000036779886,0.0005909635,0.00000824257,0.00012422704,8.161917e-8,0.95746017,0.0004858889,0.030133095,0.009916036,0.0008634653],"about_ca_topic_score_codex":0.00021940754,"about_ca_topic_score_gemma":0.00012772954,"teacher_disagreement_score":0.8419161,"about_ca_system_score_codex":0.00027750366,"about_ca_system_score_gemma":0.00042660005,"threshold_uncertainty_score":0.99973726},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032360497,0.00052299036,0.983257,0.0012278934,0.0011111305,0.00033015895,0.000008387921,0.00013197683,0.013086889],"genre_scores_gemma":[0.507146,0.0001424764,0.4872046,0.0042295004,0.0010502685,0.000011793001,0.000024600098,0.00005584453,0.00013490586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676365,0.000025562598,0.0006498157,0.0009773069,0.0010578231,0.0005258197],"domain_scores_gemma":[0.9979783,0.00020460924,0.0003287285,0.0011225711,0.00022240507,0.00014337883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050013926,0.00046687495,0.00051970116,0.0009198974,0.00014740294,0.00019284058,0.003381976,0.00029054936,0.000027967591],"category_scores_gemma":[0.000006430988,0.00040722836,0.000171135,0.0007003829,0.00029106642,0.0008898201,0.00056574604,0.0006084633,0.000033328983],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008463499,0.000031723983,0.000013135204,0.000082582876,0.000012559133,0.000013374722,0.003909195,0.010912113,0.00048694992,0.051417653,0.0000043078367,0.933108],"study_design_scores_gemma":[0.0013659645,0.0011295719,0.00032389397,0.001675473,0.00004576537,0.00025958123,0.0000025640745,0.6509267,0.045857754,0.2707865,0.025403516,0.0022226789],"about_ca_topic_score_codex":0.00005238154,"about_ca_topic_score_gemma":0.00041799727,"teacher_disagreement_score":0.93088526,"about_ca_system_score_codex":0.00013183785,"about_ca_system_score_gemma":0.00034048912,"threshold_uncertainty_score":0.99983793},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003456658,0.00093141035,0.9800957,0.00850869,0.001854252,0.001169721,0.000008351354,0.00026809872,0.007129242],"genre_scores_gemma":[0.013384461,0.00027519886,0.95445544,0.026320817,0.002130943,0.00010188547,0.00002574497,0.00011819654,0.0031873407],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99508065,0.00005193392,0.00070570724,0.0018632241,0.0011528176,0.0011456535],"domain_scores_gemma":[0.99542934,0.0011222248,0.00044225453,0.0023380576,0.0004330902,0.00023503538],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013764722,0.0007281401,0.00056532037,0.0005045215,0.0009684399,0.0010808655,0.0070185824,0.00036061465,0.000005473882],"category_scores_gemma":[0.000035591973,0.0005156657,0.00028041968,0.00082174706,0.00043382033,0.0006424383,0.0013851373,0.00089594716,0.000041607327],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002020398,0.000025430638,0.0000095512505,0.00008471573,0.000021279748,0.000036062866,0.0011755216,0.010064133,0.000070973794,0.08333823,0.00012660083,0.9050273],"study_design_scores_gemma":[0.0005279528,0.00042786443,0.00007532434,0.0005733494,0.000022966993,0.0000917711,9.551266e-7,0.10983208,0.0012529346,0.73091215,0.15528192,0.0010007677],"about_ca_topic_score_codex":0.00005837308,"about_ca_topic_score_gemma":0.0010454014,"teacher_disagreement_score":0.9040265,"about_ca_system_score_codex":0.00021229385,"about_ca_system_score_gemma":0.00061233743,"threshold_uncertainty_score":0.99995613},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37547764,0.000052397296,0.62400717,0.00021682886,0.000051187588,0.00012647465,2.815603e-7,0.000054992208,0.000013027615],"genre_scores_gemma":[0.5980567,0.000009394393,0.40143478,0.00041950907,0.000072615825,0.0000013145396,3.7093005e-7,0.0000045695115,7.698303e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990798,0.000006142621,0.0001371348,0.00029917352,0.0002296248,0.00024807788],"domain_scores_gemma":[0.9994929,0.000055200762,0.00004283377,0.00027334187,0.000064371874,0.00007138766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011806097,0.0000842795,0.00012528092,0.00013772232,0.00019422779,0.00001721003,0.0001698542,0.000039247698,0.000008779732],"category_scores_gemma":[0.000053285574,0.00007334607,0.00003291261,0.00074339734,0.0002445308,0.00014710976,0.00007781279,0.00016561488,0.0000029569821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022806134,0.00027845515,0.10216676,0.000027175118,0.0000030798656,0.00020831516,0.0021562274,0.18154667,0.14934915,0.0002401304,0.000014539136,0.5639867],"study_design_scores_gemma":[0.0004928399,0.00014482795,0.04882912,0.0001431957,0.000008375073,0.0012781379,0.0000018342307,0.7119421,0.23271662,0.0037464828,0.00044833688,0.00024813396],"about_ca_topic_score_codex":0.000014906604,"about_ca_topic_score_gemma":0.0000026901655,"teacher_disagreement_score":0.5637386,"about_ca_system_score_codex":0.000121146855,"about_ca_system_score_gemma":0.00013046624,"threshold_uncertainty_score":0.2990966},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007822944,0.0005470629,0.9897763,0.00053895504,0.0007793686,0.0005996966,0.000023701326,0.00021633727,0.0074403565],"genre_scores_gemma":[0.16555715,0.00011290152,0.8320665,0.0012648731,0.0003917732,0.0000424722,0.000013748929,0.00007022261,0.00048037845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99509853,0.00007353816,0.0004681618,0.0015903588,0.0015984823,0.0011709266],"domain_scores_gemma":[0.9950069,0.0008498187,0.00028521783,0.0029150634,0.00050370244,0.00043929482],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011868671,0.0005983156,0.0005476181,0.001149517,0.0004642574,0.00048114534,0.005857232,0.00028417323,0.00008543699],"category_scores_gemma":[0.00016304902,0.0005039519,0.00012464053,0.0012899745,0.004511765,0.0012048462,0.0020190224,0.0012935951,0.00006868331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017510325,0.000057902682,0.00045856962,0.000033563014,0.00002965348,0.000114493436,0.0011232392,0.0036884476,0.000082058854,0.5731988,0.000028940987,0.42116684],"study_design_scores_gemma":[0.0009794858,0.00037546078,0.00054924696,0.00034474034,0.000018852883,0.00033635396,9.3304806e-7,0.016686855,0.0015041479,0.97448575,0.0034288503,0.0012893304],"about_ca_topic_score_codex":0.000013519805,"about_ca_topic_score_gemma":0.00009033129,"teacher_disagreement_score":0.4198775,"about_ca_system_score_codex":0.00022075795,"about_ca_system_score_gemma":0.00071649987,"threshold_uncertainty_score":0.9997412},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031021127,0.0005322296,0.9959031,0.00013950083,0.0009792459,0.00087297196,0.000017157858,0.00052157685,0.0010311694],"genre_scores_gemma":[0.004809193,0.00005207445,0.99270797,0.0015520221,0.00060147047,0.000019227055,0.000013378547,0.00005636973,0.00018830394],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954565,0.000019482255,0.00068017776,0.0018237752,0.000999396,0.0010206524],"domain_scores_gemma":[0.99669784,0.0008245409,0.00037048405,0.0013907513,0.0004979682,0.00021839193],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013349616,0.00063164573,0.0006429401,0.0010128999,0.00035870087,0.00047183345,0.0030264216,0.0003995862,0.0000107041515],"category_scores_gemma":[0.0001635638,0.00058982475,0.00024063735,0.000914771,0.0005398843,0.0011587589,0.0010173717,0.0007987908,0.000012917368],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004852781,0.000019845225,0.0000048508323,0.000020990074,0.0000070638534,0.000060297283,0.0003028888,0.00025080782,0.00005342199,0.012779573,0.000018625353,0.9864768],"study_design_scores_gemma":[0.0004880679,0.00051448535,0.000034019467,0.00035165562,0.00001344001,0.00006142174,2.4738688e-7,0.39012548,0.03106044,0.54373777,0.03245413,0.0011588436],"about_ca_topic_score_codex":0.000013677761,"about_ca_topic_score_gemma":0.000043089032,"teacher_disagreement_score":0.98531795,"about_ca_system_score_codex":0.0003601709,"about_ca_system_score_gemma":0.0003780607,"threshold_uncertainty_score":0.9996553},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48987857,0.0001022199,0.50905126,0.00075734104,0.000090106885,0.00008247747,2.8607704e-7,0.000029410621,0.00000830715],"genre_scores_gemma":[0.8864179,0.000085023836,0.11310805,0.00033197415,0.000041781648,0.000010340522,6.2537254e-7,0.0000024624494,0.0000018263217],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99852854,0.00005939929,0.00021716084,0.0005959092,0.00026974635,0.0003292489],"domain_scores_gemma":[0.99920756,0.00022563411,0.000074835596,0.00042100073,0.000025153897,0.00004584666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004404194,0.00013878384,0.00018629833,0.0003699835,0.0004255312,0.000051999028,0.00079191854,0.00008787061,0.0000013376025],"category_scores_gemma":[0.000040809475,0.00013026866,0.000016276865,0.0009460311,0.00081601384,0.00049453665,0.00053283316,0.00027282644,0.000012816043],"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.000012131333,0.000093206916,0.6162496,0.000019883762,0.000010260693,0.000082711085,0.03167321,0.005023686,0.0020467541,0.00078081986,0.000017151135,0.34399056],"study_design_scores_gemma":[0.00027844476,0.00010052796,0.90099597,0.000047922586,9.787977e-7,0.00006444911,0.0000030291312,0.09185183,0.003081555,0.0032784631,0.00010698584,0.00018982743],"about_ca_topic_score_codex":0.000014776715,"about_ca_topic_score_gemma":0.000010481005,"teacher_disagreement_score":0.39653933,"about_ca_system_score_codex":0.000107555396,"about_ca_system_score_gemma":0.000065279666,"threshold_uncertainty_score":0.5312202},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064230675,0.00054176664,0.9951055,0.00036085202,0.0011306002,0.00051088835,0.000016492617,0.0008809389,0.0008106431],"genre_scores_gemma":[0.2310545,0.00024831746,0.76728547,0.00037804828,0.00038985783,0.000030864347,0.000016889764,0.00009885884,0.00049719017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519336,0.000042793657,0.00072004175,0.0013371548,0.001883651,0.00082298106],"domain_scores_gemma":[0.9941614,0.0019864733,0.00030315667,0.0029552341,0.00034552076,0.00024816854],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007475547,0.00057662494,0.0007102024,0.0013494506,0.00015688119,0.00021726836,0.0064771953,0.00036135962,0.000022926408],"category_scores_gemma":[0.0006707862,0.0005094186,0.00014766344,0.0009614207,0.0006138463,0.00047915074,0.0023924867,0.00084729487,0.00006503823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004888786,0.0006750252,0.00224016,0.0013617807,0.00036396593,0.0032991706,0.019995302,0.53728414,0.00403143,0.024719963,0.0062036146,0.39977658],"study_design_scores_gemma":[0.0005374851,0.00039480708,0.0009830957,0.001092462,0.000010594928,0.0003257633,1.13313625e-7,0.96725017,0.012518602,0.011019885,0.0048153647,0.0010516804],"about_ca_topic_score_codex":0.000024469942,"about_ca_topic_score_gemma":0.000013888581,"teacher_disagreement_score":0.429966,"about_ca_system_score_codex":0.0004304609,"about_ca_system_score_gemma":0.0008665217,"threshold_uncertainty_score":0.9997357},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014664645,0.00011569566,0.9863638,0.0021415988,0.00028370591,0.00048466137,0.000010931264,0.00009759081,0.010487325],"genre_scores_gemma":[0.052224834,0.000024473828,0.9433382,0.0037545026,0.00017239875,0.000078877696,0.00005104624,0.000023250142,0.00033237526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708915,0.000030503596,0.00038594598,0.0011724222,0.000893239,0.00042872966],"domain_scores_gemma":[0.9976776,0.00015665147,0.00021519385,0.0017059242,0.00014658939,0.000097992226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007407334,0.00032663613,0.0002523462,0.00026993107,0.00054295803,0.0007707194,0.0033990499,0.00012232365,0.000009820915],"category_scores_gemma":[0.000016746859,0.00025028005,0.00009049934,0.00049051404,0.0005483799,0.0005433121,0.0012885585,0.00052248675,0.000041037525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.601605e-7,0.000024220422,0.000006540083,0.00000799918,0.0000066645025,0.0000030100473,0.00016086176,0.5086101,0.000010289024,0.4424778,0.00019439665,0.04849751],"study_design_scores_gemma":[0.00009208591,0.00001483859,0.000030514515,0.000048753118,0.00000537252,0.000018296285,1.3363754e-7,0.83363485,0.00002892021,0.16153656,0.0043334803,0.00025616598],"about_ca_topic_score_codex":0.0000097666725,"about_ca_topic_score_gemma":0.000008703545,"teacher_disagreement_score":0.32502472,"about_ca_system_score_codex":0.00018839577,"about_ca_system_score_gemma":0.00022656594,"threshold_uncertainty_score":0.99999493},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037968965,0.00011225745,0.99403214,0.0017486487,0.0014475349,0.001143723,0.00006792304,0.00025446166,0.0008135918],"genre_scores_gemma":[0.18594895,0.000025932168,0.80895716,0.0035668402,0.00073326455,0.00008553884,0.000026428945,0.000095031624,0.00056086667],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947772,0.000073876465,0.0006015364,0.0022768097,0.0012219037,0.0010486512],"domain_scores_gemma":[0.9928815,0.0036391434,0.00043653633,0.0018972469,0.0008712501,0.0002743341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019324678,0.00065856316,0.0007279547,0.0010681492,0.00069292885,0.0006841018,0.004331603,0.00057853706,0.000041000385],"category_scores_gemma":[0.00102307,0.00063788006,0.00021136152,0.00096574286,0.0011643674,0.00088018156,0.001170421,0.0014654315,0.00003261302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011926622,0.00007572606,0.00010881881,0.00020548984,0.000054356427,0.00012101895,0.003422248,0.005544444,0.0072634327,0.34647748,0.00007918637,0.63652855],"study_design_scores_gemma":[0.00075256004,0.00030054236,0.0000573573,0.0002452583,0.000008997094,0.00008378276,4.2642952e-7,0.40710476,0.026865715,0.56086165,0.0028539144,0.00086505857],"about_ca_topic_score_codex":0.000011839451,"about_ca_topic_score_gemma":0.00012441656,"teacher_disagreement_score":0.63566345,"about_ca_system_score_codex":0.0002531137,"about_ca_system_score_gemma":0.00067062426,"threshold_uncertainty_score":0.99960726},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011255059,0.000018322136,0.98326117,0.00008663996,0.0004647413,0.00030616528,0.000016217897,0.000057377565,0.00453433],"genre_scores_gemma":[0.24662268,0.000007772156,0.74982697,0.00030831582,0.0005289054,0.000011225435,0.00001657088,0.00009277756,0.0025847992],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972665,0.000033880224,0.0009860409,0.00058149535,0.0007671599,0.00036494815],"domain_scores_gemma":[0.9956439,0.0024862776,0.0006289557,0.000894971,0.0002265002,0.00011936846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006260354,0.00039736083,0.00077422924,0.0004636185,0.00009073074,0.00013070146,0.0007054096,0.0003552819,0.00027197506],"category_scores_gemma":[0.00083109655,0.00033303158,0.00013510737,0.00015138852,0.0005131484,0.00014189124,0.0003335517,0.0005024354,0.00002433215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013196674,0.0031303135,0.008010073,0.015407406,0.00012320926,0.00046343452,0.046529032,0.0015891258,0.005138804,0.3736413,0.006183411,0.53965193],"study_design_scores_gemma":[0.0002955214,0.000104161416,0.00030837595,0.0024470985,0.00004284468,0.00007955014,9.512316e-7,0.03409909,0.0032339834,0.9579993,0.000717871,0.0006712409],"about_ca_topic_score_codex":0.0000016485303,"about_ca_topic_score_gemma":0.0000053433373,"teacher_disagreement_score":0.584358,"about_ca_system_score_codex":0.00010220567,"about_ca_system_score_gemma":0.00032659844,"threshold_uncertainty_score":0.99991214},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000046353975,0.00039960438,0.9883062,0.00060253864,0.0006370548,0.00083785923,0.000014588949,0.000085654414,0.009111828],"genre_scores_gemma":[0.0046536564,0.000115933726,0.9923281,0.00036881198,0.00041423776,0.000027883947,0.000006665468,0.000035822803,0.0020488966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99462867,0.00010534069,0.0008034533,0.0016248035,0.002049104,0.00078860234],"domain_scores_gemma":[0.9957311,0.0007648059,0.00028392868,0.0017180515,0.0012144924,0.00028761802],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001773269,0.00051255315,0.00075684686,0.0015386214,0.0002033784,0.0004501314,0.004663221,0.00030043448,0.00022253621],"category_scores_gemma":[0.00023204264,0.0004674606,0.00013833141,0.0013473453,0.0013437272,0.00066178164,0.0021638644,0.0010783848,0.00010430711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041946714,0.000047005506,0.00000971157,0.00003118558,0.000018328918,0.000050811188,0.0003771743,0.16416882,0.000036388054,0.017425233,0.00003214497,0.817799],"study_design_scores_gemma":[0.00033001718,0.00020257013,0.000019654872,0.00017082415,0.0000046408804,0.000043524316,2.1418224e-7,0.9879169,0.0024837335,0.004774885,0.0035782517,0.00047477233],"about_ca_topic_score_codex":0.000028359198,"about_ca_topic_score_gemma":0.000019222012,"teacher_disagreement_score":0.8237481,"about_ca_system_score_codex":0.0003589355,"about_ca_system_score_gemma":0.0018336877,"threshold_uncertainty_score":0.99977773},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006576006,0.0006047592,0.9912684,0.0008403927,0.0039744223,0.0017563192,0.00005973962,0.0004995077,0.00093071046],"genre_scores_gemma":[0.7872277,0.000010537453,0.20759468,0.0020257514,0.0020029887,0.00019407143,0.00007508644,0.00013958573,0.0007296102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940948,0.00011214515,0.0009854285,0.0025398321,0.0012129353,0.001054856],"domain_scores_gemma":[0.99504775,0.0012409139,0.0006595474,0.001968905,0.0008369377,0.0002459481],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013695603,0.00090990536,0.0010980027,0.0013195619,0.00050649274,0.0016681259,0.0043660104,0.0006217941,0.000004580375],"category_scores_gemma":[0.00008799609,0.00086913945,0.0002567948,0.00065276783,0.0005059588,0.001149701,0.00071726163,0.0008737947,0.000035530553],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013829068,0.00004275566,0.000047749912,0.00024146789,0.000032689266,0.00007164858,0.00066048396,0.025529549,0.00017716545,0.0182587,0.00022807076,0.9546959],"study_design_scores_gemma":[0.001257408,0.00058827177,0.000116541065,0.0025597846,0.000029612167,0.0006093093,0.0000022882143,0.860085,0.0018372333,0.088785514,0.041171357,0.0029576703],"about_ca_topic_score_codex":0.00020297615,"about_ca_topic_score_gemma":0.0007346777,"teacher_disagreement_score":0.95173824,"about_ca_system_score_codex":0.00070697814,"about_ca_system_score_gemma":0.0012577779,"threshold_uncertainty_score":0.99937594},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079880323,0.000090016074,0.9954337,0.00005318052,0.0013019625,0.0004946856,0.00002166543,0.00078469136,0.0010213266],"genre_scores_gemma":[0.8512054,0.000049362334,0.14613435,0.0009553198,0.0008319971,0.00008159851,0.0004308197,0.00014262965,0.00016850996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987157,0.00001001795,0.00029931637,0.00041629886,0.00027786326,0.00028079085],"domain_scores_gemma":[0.99934906,0.00012235281,0.00008328001,0.00017433953,0.00020581903,0.00006513801],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002636354,0.00026842972,0.0002204517,0.0003168681,0.00013033829,0.00012367054,0.0001981159,0.00026913633,0.000020217516],"category_scores_gemma":[0.000039573853,0.00028507988,0.00006717614,0.0003127083,0.00008911073,0.00020381578,0.00002306102,0.00030055994,0.000017703938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010720019,0.000013075057,0.00006465748,0.0001799345,0.000020016174,0.000004600475,0.0003020179,0.41735944,0.0025324859,0.0014265797,0.0002779595,0.5778085],"study_design_scores_gemma":[0.00024800072,0.00007302312,0.00005726402,0.0002512853,0.000012655774,0.000020268735,8.731015e-8,0.96667266,0.008153471,0.02187782,0.0022847855,0.00034867667],"about_ca_topic_score_codex":0.000009244261,"about_ca_topic_score_gemma":0.000052545776,"teacher_disagreement_score":0.85040665,"about_ca_system_score_codex":0.00033485476,"about_ca_system_score_gemma":0.000078842175,"threshold_uncertainty_score":0.9999601},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034160696,0.00009736268,0.9932448,0.000563328,0.00060159154,0.001604978,0.000014576637,0.00021964246,0.00023764391],"genre_scores_gemma":[0.5756474,0.0000038033122,0.4235957,0.0004327551,0.00014473005,0.000057762998,0.000012921277,0.000036039466,0.00006888544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960071,0.0001562398,0.0007971836,0.0016737055,0.0006526712,0.0007131358],"domain_scores_gemma":[0.9941395,0.0036726792,0.00041947144,0.0011318948,0.00045190923,0.00018456098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013493462,0.00059491076,0.0006737405,0.0011220922,0.000857215,0.0005998161,0.0008631255,0.00032725773,0.000016124386],"category_scores_gemma":[0.00036414544,0.0006009314,0.00013957679,0.0006057469,0.0003182904,0.00052990904,0.00030811163,0.0007031772,0.000013142288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014455804,0.00013626262,0.00060819136,0.00005774203,0.000019669249,0.039185263,0.007961875,0.9096319,0.00001856677,0.000596001,0.00012594854,0.04164409],"study_design_scores_gemma":[0.0009272814,0.00054999633,0.000071077004,0.00040122453,0.000022535058,0.008720763,0.0000034885156,0.98229337,0.00006351124,0.0062256632,0.000022028886,0.0006990676],"about_ca_topic_score_codex":0.0011010733,"about_ca_topic_score_gemma":0.003784539,"teacher_disagreement_score":0.57223135,"about_ca_system_score_codex":0.00042012575,"about_ca_system_score_gemma":0.001812317,"threshold_uncertainty_score":0.9996442},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02851068,0.00003603856,0.97056186,0.00035784813,0.00016498475,0.00020124468,0.0000018490751,0.00014447693,0.000021033462],"genre_scores_gemma":[0.48227438,0.0000037373638,0.51727843,0.00042041938,0.000014150571,0.0000033118286,9.609154e-7,0.0000037890084,8.00467e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742657,0.00008093176,0.00047129724,0.00069077726,0.0009542625,0.0003761762],"domain_scores_gemma":[0.99846464,0.00018852588,0.00024673034,0.0007548273,0.00023114329,0.00011411734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081383163,0.0001798899,0.00022154802,0.00044840638,0.00019040669,0.000109460234,0.0015609483,0.00007300788,0.0000049685987],"category_scores_gemma":[0.00023392604,0.00016376832,0.000057490968,0.0017524061,0.0008177773,0.0010592239,0.0002769568,0.00021475027,0.0000016157996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009399028,0.00019023594,0.00038665358,0.00004100651,0.0000032950616,0.000071277274,0.0013478971,0.32687905,0.4249331,0.00021855814,0.00003601942,0.24588352],"study_design_scores_gemma":[0.00015649512,0.00006823785,0.00031225683,0.00005356901,0.0000013321294,0.000036770125,1.625837e-7,0.7289967,0.26678494,0.0034625304,3.874094e-7,0.00012664884],"about_ca_topic_score_codex":0.00007011767,"about_ca_topic_score_gemma":0.000014356303,"teacher_disagreement_score":0.4537637,"about_ca_system_score_codex":0.00016351018,"about_ca_system_score_gemma":0.00077201356,"threshold_uncertainty_score":0.66782784},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001134949,0.0010093194,0.99081326,0.0012693409,0.0011537548,0.0005696019,0.000008012582,0.00019513957,0.0038466423],"genre_scores_gemma":[0.21838756,0.00019764468,0.7732464,0.0062276213,0.0015934089,0.000038408885,0.000032538497,0.000072339586,0.00020407396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663675,0.00002518506,0.0005162021,0.0015640805,0.00062662177,0.00063113583],"domain_scores_gemma":[0.9977977,0.00057477714,0.00033152185,0.0008562919,0.00027199404,0.00016766277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006173531,0.0005644278,0.0004904192,0.00080683467,0.0004277855,0.00093359,0.0023105221,0.00028722017,0.000008044989],"category_scores_gemma":[0.000014039497,0.00048599023,0.00011234574,0.0006022541,0.0002160415,0.0008370914,0.00096442644,0.0005477604,0.000008606354],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001122366,0.000017400733,0.00011320354,0.00021077588,0.00001429977,0.000024801302,0.003845064,0.002629935,0.0014285824,0.02833147,0.0000053920885,0.9633679],"study_design_scores_gemma":[0.00047566908,0.0002483799,0.00014542688,0.0011952174,0.000018579827,0.00011689528,0.0000047304584,0.81213313,0.0029002316,0.17145891,0.010429111,0.00087371515],"about_ca_topic_score_codex":0.00008347695,"about_ca_topic_score_gemma":0.0021440682,"teacher_disagreement_score":0.96249413,"about_ca_system_score_codex":0.00010868062,"about_ca_system_score_gemma":0.0002127202,"threshold_uncertainty_score":0.9997592},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031337418,0.0002554943,0.99232394,0.00076306483,0.004351079,0.0003071109,0.000010858065,0.00024925338,0.001425848],"genre_scores_gemma":[0.3193152,0.000008067193,0.6786703,0.0009834442,0.0006201871,0.0000029971748,0.0000077701325,0.00004050713,0.00035152189],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960823,0.000029367404,0.0005810078,0.0015698754,0.0010142652,0.0007231603],"domain_scores_gemma":[0.997457,0.00024576182,0.0004520421,0.0013820083,0.0002822128,0.00018095625],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005286746,0.0006058234,0.0005318699,0.00078657817,0.0009329427,0.0023804945,0.0026582947,0.00037973648,0.00005365473],"category_scores_gemma":[0.00019939817,0.0005442212,0.00013244443,0.00047474972,0.0015452484,0.001786391,0.0013956339,0.0018139447,0.000016533459],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027993603,0.0000067696956,0.000053907766,0.000023040264,0.0000045009974,0.000030397718,0.0014340801,0.0012284847,0.001530114,0.0102438945,0.000004187286,0.9854378],"study_design_scores_gemma":[0.00032438862,0.00011293836,0.00016626655,0.00033730015,0.000007510473,0.00012690474,0.0000011507458,0.3582297,0.01747147,0.61555004,0.00662659,0.0010457111],"about_ca_topic_score_codex":0.00003346999,"about_ca_topic_score_gemma":0.0004077427,"teacher_disagreement_score":0.9843921,"about_ca_system_score_codex":0.00022859036,"about_ca_system_score_gemma":0.0005758648,"threshold_uncertainty_score":0.9997009},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000062787826,0.00042608322,0.99367553,0.0003985703,0.0015880847,0.0005225405,0.000003974221,0.0005457377,0.0028331957],"genre_scores_gemma":[0.014107807,0.000030214855,0.9839936,0.0008689124,0.00046380644,0.00001742812,0.0000045995816,0.00004452885,0.0004691351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687916,0.000008629407,0.0004606727,0.0011847629,0.0007383275,0.00072843995],"domain_scores_gemma":[0.9971156,0.0010007807,0.00027114814,0.0012220824,0.00024432066,0.00014605108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017635137,0.00043970763,0.00040854205,0.0007480459,0.00022381793,0.000526946,0.002847336,0.00030775505,0.000010409863],"category_scores_gemma":[0.0002444527,0.00042134174,0.0001234837,0.0004577069,0.00019000041,0.00081901095,0.0008916524,0.0005820896,0.0000116107585],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009446197,0.000027354345,0.00012093084,0.00010948225,0.000017260278,0.000061303836,0.00044507664,0.024962658,0.00008788588,0.027424464,0.00018294003,0.9465512],"study_design_scores_gemma":[0.00031787748,0.00039704173,0.000064994005,0.0007186017,0.000017178674,0.00007683876,1.2316389e-7,0.7389923,0.0035887575,0.19517066,0.059508998,0.0011466426],"about_ca_topic_score_codex":0.000013308675,"about_ca_topic_score_gemma":0.00001661888,"teacher_disagreement_score":0.9454045,"about_ca_system_score_codex":0.0002857461,"about_ca_system_score_gemma":0.00026236207,"threshold_uncertainty_score":0.99982387},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018402735,0.0004497813,0.99436224,0.0005891454,0.0017133262,0.0007666415,0.000010688131,0.0002917038,0.0016324437],"genre_scores_gemma":[0.32111967,0.00009351998,0.676095,0.0005453525,0.00080736727,0.000033492488,0.000016963026,0.00008241445,0.0012061892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558204,0.000119732285,0.0007830236,0.0017589504,0.0010508375,0.0007054284],"domain_scores_gemma":[0.99636024,0.0005833472,0.00053724856,0.0019080526,0.0004248339,0.00018627533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018793559,0.0006051432,0.000625431,0.0011882025,0.00029426522,0.0007880681,0.003161075,0.0009091473,0.00001343159],"category_scores_gemma":[0.00019820414,0.0005387192,0.00014503987,0.0011070705,0.0009597794,0.00085186545,0.0007620609,0.0018970508,0.000039201124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004271813,0.00024646954,0.0008919812,0.00022262518,0.000019770134,0.00010630992,0.0015553692,0.0024583675,0.07554764,0.09652712,0.0000143202615,0.8223673],"study_design_scores_gemma":[0.00024847878,0.00006350766,0.000298851,0.0004555047,0.0000076858205,0.00007141826,0.0000015515335,0.9447622,0.0146216145,0.03576168,0.0029935176,0.0007140291],"about_ca_topic_score_codex":0.000049817358,"about_ca_topic_score_gemma":0.00010479584,"teacher_disagreement_score":0.9423038,"about_ca_system_score_codex":0.0005273536,"about_ca_system_score_gemma":0.00073407975,"threshold_uncertainty_score":0.99970645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006642996,0.001317945,0.9956706,0.0003734477,0.0009536422,0.00036370588,0.00011541642,0.00091712933,0.00022169591],"genre_scores_gemma":[0.019038517,0.00019607048,0.97938836,0.00022370592,0.0008980244,0.000016753787,0.000083634455,0.000081476224,0.000073478186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979243,0.000002780915,0.00037852672,0.00068161293,0.0003320698,0.00068066304],"domain_scores_gemma":[0.99875134,0.0004040624,0.000070204645,0.0005869169,0.00009986519,0.00008759256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015175516,0.0004563491,0.0004581737,0.00031457903,0.00011153344,0.00008297207,0.0010073654,0.00038424873,0.000010422082],"category_scores_gemma":[0.00010716605,0.00043408744,0.00010319479,0.00032943007,0.0005008373,0.00018077991,0.00032601433,0.0007752478,0.000008634369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013947224,0.0000041951876,0.0000015220096,0.000019252124,0.000006472613,0.0000072054936,0.0000131288825,0.4745206,0.000027513051,0.0013460511,0.000018586972,0.5240341],"study_design_scores_gemma":[0.00016916692,0.000054089764,0.000011560412,0.00022647639,0.0000103701095,0.000012980336,2.1987928e-7,0.9288193,0.00050656544,0.053979967,0.015704911,0.00050441554],"about_ca_topic_score_codex":0.000001094787,"about_ca_topic_score_gemma":0.00004699549,"teacher_disagreement_score":0.52352965,"about_ca_system_score_codex":0.00036140348,"about_ca_system_score_gemma":0.0000465541,"threshold_uncertainty_score":0.9998111},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008803773,0.0043846164,0.9941895,0.00050324964,0.00018278495,0.00035922677,8.1993323e-7,0.000128233,0.00016351088],"genre_scores_gemma":[0.12712881,0.00018255836,0.8722052,0.0002789694,0.00012812373,0.000010362991,0.0000018772406,0.000018532897,0.000045582532],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978266,0.000074833115,0.00034329004,0.0007826856,0.0004405459,0.00053205114],"domain_scores_gemma":[0.99821395,0.0005280183,0.00021750953,0.0007549101,0.00019082642,0.00009481394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015668379,0.00027928775,0.00025180838,0.00031590636,0.00027204625,0.0003656561,0.0021969683,0.00015868522,0.0000047909043],"category_scores_gemma":[0.000046006593,0.00019675004,0.000043399665,0.000404413,0.0005684988,0.0005389545,0.00068452803,0.00053278543,0.0000015798811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044072553,0.00000972382,0.00000439277,0.000012609183,0.000003472233,0.0000102461,0.00042921875,0.00010560496,0.00032622737,0.11475758,0.000006414507,0.8843301],"study_design_scores_gemma":[0.00015536559,0.00041931833,0.000019022233,0.000104368795,0.000006469328,0.0000902486,4.7123666e-7,0.17269073,0.018571172,0.807177,0.0004551356,0.0003107152],"about_ca_topic_score_codex":0.00002729607,"about_ca_topic_score_gemma":0.00019945593,"teacher_disagreement_score":0.8840194,"about_ca_system_score_codex":0.0001902146,"about_ca_system_score_gemma":0.000708129,"threshold_uncertainty_score":0.8023234},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06638144,0.00007150399,0.9315093,0.0013090641,0.0004683514,0.000106708416,9.478409e-7,0.00007052252,0.000082166],"genre_scores_gemma":[0.637487,0.0000068571508,0.36190835,0.0005112631,0.00008062539,0.0000016473568,3.1325408e-7,0.0000026362097,0.0000013090378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852496,0.000037757753,0.00030626426,0.0004489415,0.000375297,0.00030674814],"domain_scores_gemma":[0.99904513,0.000208991,0.00012269504,0.00045546063,0.00009025055,0.00007745815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005202105,0.00012694046,0.00017780342,0.0003367723,0.00010195908,0.00015694866,0.0008519349,0.000060693696,0.000050004455],"category_scores_gemma":[0.00008022653,0.00011597396,0.00004571376,0.0013912192,0.00021557786,0.0011067889,0.00021684679,0.0001355765,0.00000936218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002554607,0.00004181477,0.0049370327,0.0000049290993,0.0000018416503,0.0000017532814,0.0007036021,0.21511224,0.0061963242,0.00096131064,0.00001565555,0.77202094],"study_design_scores_gemma":[0.00026860903,0.000040630868,0.025317835,0.000024956526,0.000001350493,0.000023701958,4.1748964e-7,0.9236329,0.049002506,0.0013454884,0.00017988204,0.00016171699],"about_ca_topic_score_codex":0.000048764137,"about_ca_topic_score_gemma":0.00011245395,"teacher_disagreement_score":0.7718592,"about_ca_system_score_codex":0.00008567603,"about_ca_system_score_gemma":0.00018117896,"threshold_uncertainty_score":0.4729281},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021128378,0.00008118042,0.99535596,0.0003227189,0.003031579,0.00073248846,0.000038675855,0.00017277943,0.000053343727],"genre_scores_gemma":[0.13788074,0.000005059596,0.8608605,0.00071065756,0.0004272573,0.00005055978,0.000029890103,0.00002506247,0.000010247141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690837,0.00002714757,0.00046557092,0.0013718485,0.00064670143,0.0005803421],"domain_scores_gemma":[0.99768907,0.00030654803,0.00026355888,0.0011404604,0.00039999167,0.00020037303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008964282,0.00042903237,0.00036402015,0.00083951355,0.00052724953,0.000649591,0.0021207703,0.00030832147,0.00002835795],"category_scores_gemma":[0.000040688752,0.0004090103,0.000176612,0.0005119152,0.0005223333,0.0006306168,0.00028713676,0.0007027266,0.000005620498],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002522985,0.00004637506,0.000011563903,0.00002081684,0.0000052157125,0.0000048735005,0.00025627037,0.00067291904,0.0012860973,0.010203759,0.0000033901017,0.9874862],"study_design_scores_gemma":[0.00045496595,0.00037527157,0.000058388465,0.000055056837,0.0000074978448,0.000014720633,2.7082498e-7,0.9219834,0.007855274,0.064200565,0.0044923592,0.00050218974],"about_ca_topic_score_codex":0.00003221434,"about_ca_topic_score_gemma":0.00055411796,"teacher_disagreement_score":0.986984,"about_ca_system_score_codex":0.00012376696,"about_ca_system_score_gemma":0.00045294975,"threshold_uncertainty_score":0.99983615},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008163748,0.0012814525,0.98854977,0.0014462085,0.0022715395,0.00040634573,0.0000032394676,0.00025199456,0.005707804],"genre_scores_gemma":[0.106291056,0.000046174402,0.8911157,0.0010679174,0.0010524268,0.000013073112,0.000002863636,0.000051705145,0.00035907357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941299,0.00008184305,0.0010643518,0.0021711506,0.001410355,0.0011423876],"domain_scores_gemma":[0.99612176,0.0014929634,0.00025648274,0.0016406978,0.00023430369,0.00025378985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016962971,0.0006848083,0.00088439556,0.0011965305,0.00027202017,0.0008944903,0.004408757,0.00047720262,0.000040961153],"category_scores_gemma":[0.0004365176,0.00066042534,0.00016699698,0.0009033407,0.00073311746,0.0015802118,0.0014615149,0.0013109914,0.00014511777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070776127,0.000031907228,0.0002643829,0.000094207346,0.000006345158,0.0002899028,0.0010955356,0.11147433,0.00005915632,0.020510608,0.00000923655,0.8661573],"study_design_scores_gemma":[0.0005611919,0.00017270732,0.00065489503,0.003219557,0.000008569302,0.00030534354,7.6990403e-7,0.90830463,0.0005975418,0.08069646,0.0037219885,0.0017563198],"about_ca_topic_score_codex":0.000057614918,"about_ca_topic_score_gemma":0.00021322464,"teacher_disagreement_score":0.864401,"about_ca_system_score_codex":0.0006285797,"about_ca_system_score_gemma":0.0007320678,"threshold_uncertainty_score":0.9995847},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000059199883,0.00014533626,0.9964647,0.00040078157,0.00080304395,0.0006608094,0.000042425225,0.00019891457,0.0012780508],"genre_scores_gemma":[0.0013477575,0.000029133478,0.9965899,0.0007517941,0.00039511287,0.00003351147,0.00021562737,0.000036391,0.00060076383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681884,0.00001626958,0.0003699407,0.0014688688,0.00076227856,0.0005637818],"domain_scores_gemma":[0.9980957,0.0002220018,0.0002575433,0.0011092152,0.00021760445,0.00009796537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005543476,0.00047692462,0.00038804565,0.00086089206,0.00029047858,0.0009950403,0.0023825776,0.00013861168,0.000009755523],"category_scores_gemma":[0.000029019358,0.0003982075,0.000083704996,0.0006594398,0.00054491404,0.0018467639,0.001064336,0.0002962316,0.000006114387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026480995,0.00008128516,0.000033525277,0.00014558538,0.000028893952,0.00010401534,0.00014882711,0.4856169,0.000019071149,0.050439984,0.00069040665,0.46266505],"study_design_scores_gemma":[0.00039466287,0.00028364483,0.0000126299,0.00027003424,0.000015515208,0.000017363693,1.3973062e-7,0.9764341,0.0002569356,0.018059567,0.003610864,0.0006445027],"about_ca_topic_score_codex":0.000039844086,"about_ca_topic_score_gemma":0.00010414552,"teacher_disagreement_score":0.49081725,"about_ca_system_score_codex":0.00010312779,"about_ca_system_score_gemma":0.00027781448,"threshold_uncertainty_score":0.999847},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012375568,0.000026393158,0.9953578,0.0007618981,0.0008700992,0.00053744804,0.000013031245,0.000045552657,0.0011501869],"genre_scores_gemma":[0.511498,0.000032956308,0.4750424,0.009224135,0.0010545709,0.00008716281,0.000063973544,0.00006597394,0.00293085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981762,0.000026158139,0.00035549016,0.00065288425,0.0005322684,0.00025699002],"domain_scores_gemma":[0.9979012,0.0009231812,0.0002500925,0.0006419755,0.0002419947,0.00004156894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037224469,0.0002707762,0.0002466498,0.00041861215,0.00022803032,0.0004905296,0.0010744035,0.00012513463,0.000039710147],"category_scores_gemma":[0.00008075799,0.00017750238,0.00010346994,0.0002994161,0.0002669248,0.00075286365,0.00021380618,0.00026840126,0.000019530597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002072533,0.000080663434,0.000030144374,0.000051664018,0.000020225822,0.000009042636,0.00057712436,0.16443294,0.0004173654,0.05885478,0.0014694774,0.7740359],"study_design_scores_gemma":[0.00044910246,0.00035104112,0.00026452047,0.00038826218,0.000011981248,0.000016078602,9.224088e-8,0.728067,0.0029544279,0.2622062,0.0047531035,0.00053822156],"about_ca_topic_score_codex":0.00003456024,"about_ca_topic_score_gemma":0.000047642112,"teacher_disagreement_score":0.77349764,"about_ca_system_score_codex":0.0000989225,"about_ca_system_score_gemma":0.00013376308,"threshold_uncertainty_score":0.72383374},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012142495,0.0025311972,0.98644525,0.0006586848,0.0006110807,0.0012063602,0.0000021130818,0.00024015977,0.008183731],"genre_scores_gemma":[0.5565453,0.00095258944,0.43698984,0.0018143281,0.0009150927,0.0002552664,0.00004058838,0.00014935232,0.0023375922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99388444,0.00020928399,0.0009402924,0.0020132265,0.0016443486,0.0013084031],"domain_scores_gemma":[0.9946464,0.0007809247,0.00031615782,0.003754638,0.00022401275,0.00027791513],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0023773196,0.0006929431,0.0007038382,0.0019258261,0.00029655677,0.00077019696,0.00938532,0.00046065243,0.00004243708],"category_scores_gemma":[0.000035197838,0.0006515123,0.00015556077,0.0024321591,0.00085076544,0.00024167701,0.0047852453,0.0023244338,0.0000732551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006542212,0.00004506926,0.000013242107,0.000011307738,0.000008260477,0.00007527362,0.00022181889,0.5764309,0.0000022907748,0.006039232,0.00004787476,0.4170982],"study_design_scores_gemma":[0.00042370838,0.00009113139,0.00014240382,0.0005834307,0.000004029605,0.000035926758,8.3692277e-7,0.98005044,0.000017476359,0.002740076,0.015278824,0.0006316869],"about_ca_topic_score_codex":0.000037425147,"about_ca_topic_score_gemma":0.00018501925,"teacher_disagreement_score":0.5564239,"about_ca_system_score_codex":0.0013191627,"about_ca_system_score_gemma":0.00034934538,"threshold_uncertainty_score":0.99997723},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007850975,0.00070782815,0.9951969,0.00024448446,0.0014253417,0.00048727024,0.000023978264,0.00019749705,0.001638221],"genre_scores_gemma":[0.009301753,0.0002735133,0.9877124,0.0013836905,0.0006152137,0.00002406186,0.000043096592,0.000042649317,0.00060362864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961327,0.00006579657,0.00072734687,0.0016428633,0.0007370711,0.00069423264],"domain_scores_gemma":[0.9981101,0.00018810567,0.00032162285,0.0011031714,0.000143293,0.00013370096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008727102,0.00056219834,0.0007288895,0.0009048205,0.00018948382,0.00028501975,0.0015763104,0.00018579785,0.000036069956],"category_scores_gemma":[0.000085427506,0.00050919945,0.000085468106,0.0008556142,0.00031911628,0.0015709732,0.0009101859,0.000552353,0.000049618713],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013915903,0.00003537714,0.000033363325,0.00009131881,0.000005157315,0.00014160226,0.000214978,0.0055907005,0.00091914035,0.15501647,0.000027774484,0.83791023],"study_design_scores_gemma":[0.0023689913,0.00081461517,0.0010341754,0.0073868223,0.000026511818,0.00095128675,7.674406e-7,0.37823525,0.015382362,0.2160507,0.37293002,0.004818523],"about_ca_topic_score_codex":0.00015684673,"about_ca_topic_score_gemma":0.00056147354,"teacher_disagreement_score":0.8330917,"about_ca_system_score_codex":0.00033384393,"about_ca_system_score_gemma":0.00042750777,"threshold_uncertainty_score":0.99973595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000091629474,0.000092391136,0.99493283,0.0004313725,0.0023761918,0.00045712758,0.000008022054,0.0002468715,0.0013635622],"genre_scores_gemma":[0.081103355,0.000013602921,0.91597784,0.0012040691,0.0012532505,0.000015645264,0.000009147552,0.00005400369,0.00036907653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970821,0.000014315889,0.0003665059,0.0013730314,0.00056803145,0.0005959901],"domain_scores_gemma":[0.9979696,0.00055261276,0.00022005409,0.00089258427,0.00023276346,0.00013237858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070790114,0.00043411244,0.00042200313,0.00060633314,0.00034973831,0.0005902698,0.0017224819,0.0002927794,0.000011625448],"category_scores_gemma":[0.0001206603,0.00043232224,0.00016444748,0.0003749769,0.0003469857,0.0005708535,0.00069130963,0.0005307315,0.000060523686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018906452,0.00002395666,0.0000037787252,0.000080946105,0.000022672346,0.000042741252,0.0016966416,0.2085263,0.0026766902,0.021924,0.000021377658,0.764962],"study_design_scores_gemma":[0.00039869203,0.0003155369,0.000035939196,0.0007471782,0.000011444047,0.000080906786,1.2895045e-7,0.6764109,0.012785228,0.30653015,0.0018073911,0.0008764849],"about_ca_topic_score_codex":0.00002225167,"about_ca_topic_score_gemma":0.000020454161,"teacher_disagreement_score":0.76408553,"about_ca_system_score_codex":0.0004578343,"about_ca_system_score_gemma":0.00040828603,"threshold_uncertainty_score":0.99981284},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044748476,0.0013690691,0.10851712,0.00082743587,0.006665517,0.000719075,0.00006240962,0.00019412475,0.8771704],"genre_scores_gemma":[0.9668091,0.00002214215,0.0016104666,0.00082141405,0.0022104778,0.0000049278065,0.000010025031,0.000038691833,0.028472744],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986012,0.00000426228,0.00024319964,0.00048847456,0.0003443607,0.00031851014],"domain_scores_gemma":[0.9993625,0.00019553467,0.00009482223,0.00021631755,0.00007250228,0.000058317084],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012192274,0.00023944434,0.00026949093,0.0006235561,0.00013014808,0.0005627999,0.00038551184,0.0000671021,0.0011622539],"category_scores_gemma":[0.000040102426,0.00020590004,0.000067430854,0.00009465421,0.00069091836,0.00031052832,0.00017002835,0.00045300464,0.0001933223],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008180384,0.00005868606,0.0003401329,0.00004500097,0.000014669567,0.00020469353,0.035442095,0.0030243017,0.0000040219415,0.12714167,0.00024694396,0.83346957],"study_design_scores_gemma":[0.0013981563,0.0005609576,0.0007049321,0.0052125147,0.000032783268,0.000058116893,0.000034453755,0.07998694,0.00013927686,0.57574743,0.3328937,0.0032307778],"about_ca_topic_score_codex":0.000044408258,"about_ca_topic_score_gemma":0.0019475165,"teacher_disagreement_score":0.9623343,"about_ca_system_score_codex":0.0001455056,"about_ca_system_score_gemma":0.00005918305,"threshold_uncertainty_score":0.9997508},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009094908,0.0005254011,0.95130855,0.0045818156,0.0075251507,0.0012994646,0.000011954941,0.00032552305,0.025327226],"genre_scores_gemma":[0.97312033,0.000045143388,0.002618618,0.021775091,0.0016553031,0.00003732109,0.0000044560816,0.000081108796,0.0006626559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954144,0.00015619345,0.00041977694,0.002054181,0.0012317008,0.0007238013],"domain_scores_gemma":[0.9744246,0.024585953,0.0001921428,0.0006205496,0.000074706724,0.00010205546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010768779,0.0005822316,0.0005405843,0.0009669759,0.0004979065,0.00012246457,0.0007420947,0.00031485024,0.000035220073],"category_scores_gemma":[0.007823832,0.00052739744,0.00013760565,0.0007791996,0.0010738262,0.00023472613,0.0005832563,0.001588442,0.0000640757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014788844,0.00005556874,0.0010196924,0.000039420804,0.000008401627,0.0005259242,0.00034868886,0.85502714,0.0012219254,0.0026411167,0.0012775239,0.13768671],"study_design_scores_gemma":[0.0032101076,0.0030005323,0.023749815,0.0020034604,0.000023501894,0.0011707207,6.0289176e-7,0.88709074,0.010924895,0.053426184,0.011630298,0.0037691405],"about_ca_topic_score_codex":0.000014579081,"about_ca_topic_score_gemma":0.00008131842,"teacher_disagreement_score":0.9640254,"about_ca_system_score_codex":0.0005584864,"about_ca_system_score_gemma":0.0002784657,"threshold_uncertainty_score":0.9997178},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045493387,0.00029697744,0.99541384,0.00033040618,0.0026317048,0.00032159337,0.000011056252,0.0007010896,0.00024781696],"genre_scores_gemma":[0.020284273,0.000032651347,0.97831035,0.00070811174,0.00025784032,0.000007437598,0.0000021511307,0.00005204498,0.0003451409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959392,0.00004641106,0.0005303382,0.0018003518,0.000815283,0.0008684127],"domain_scores_gemma":[0.99519575,0.0019941996,0.00024144954,0.002101248,0.00024774903,0.00021961004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095202995,0.00069625943,0.0006304733,0.00095073396,0.00024639233,0.0006021513,0.0030714925,0.00040527765,0.000011963041],"category_scores_gemma":[0.00095509726,0.00066173414,0.0001557775,0.0006745466,0.0006948842,0.0014200781,0.001929071,0.001168875,0.000043636388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022929037,0.000011724377,0.0000055142896,0.000028258955,0.000008657016,0.0047600404,0.0004404751,0.6000048,0.0000572588,0.03831425,0.000005760078,0.356361],"study_design_scores_gemma":[0.00034793475,0.00019827839,0.00006584507,0.0005151664,0.0000101744245,0.0060540643,1.3784481e-7,0.07994538,0.0023978022,0.90841746,0.0005998263,0.0014479501],"about_ca_topic_score_codex":0.0000561268,"about_ca_topic_score_gemma":0.000060882852,"teacher_disagreement_score":0.8701032,"about_ca_system_score_codex":0.0007016602,"about_ca_system_score_gemma":0.00065842393,"threshold_uncertainty_score":0.99958336},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025070207,0.00035110206,0.95645994,0.0006982023,0.0019339945,0.0018210253,0.00007404259,0.00019033559,0.013401128],"genre_scores_gemma":[0.9365761,0.000135336,0.05899284,0.001686256,0.0012372636,0.000111268135,0.000008362938,0.00015322473,0.0010993318],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99574697,0.00003173919,0.0004251581,0.0020065575,0.0009272899,0.00086226227],"domain_scores_gemma":[0.99660474,0.0020108367,0.0001706764,0.0007426578,0.00024101387,0.00023009282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009423527,0.0005249949,0.00055999705,0.0006088309,0.0011172936,0.0008927125,0.0014661786,0.00040781702,0.00004683634],"category_scores_gemma":[0.0011711466,0.0004718778,0.00009525464,0.00051231397,0.0016552701,0.00053888233,0.0010607281,0.0012956975,0.00000811939],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013247701,0.00013348245,0.001403219,0.00032106903,0.000035933055,0.00020542719,0.0122582875,0.0040129544,0.1571113,0.048743263,0.000027952645,0.7756146],"study_design_scores_gemma":[0.0013555388,0.0005917687,0.00014785776,0.0010989247,0.000038040806,0.00015619711,0.000008370984,0.08916649,0.6920778,0.20949802,0.0040930393,0.0017679052],"about_ca_topic_score_codex":0.00005031509,"about_ca_topic_score_gemma":0.00023010423,"teacher_disagreement_score":0.91150594,"about_ca_system_score_codex":0.00016554332,"about_ca_system_score_gemma":0.00043628976,"threshold_uncertainty_score":0.99977326},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000062711415,0.0005420124,0.976207,0.005146295,0.0014551069,0.0004030251,8.2431376e-7,0.0002175513,0.016021878],"genre_scores_gemma":[0.08426432,0.0016309603,0.89692366,0.013399002,0.002352709,0.000014508736,0.000009033072,0.00005481814,0.0013509627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962682,0.00014344453,0.00058183615,0.0013338819,0.0009235491,0.0007490979],"domain_scores_gemma":[0.9955035,0.0016936612,0.00030769172,0.0019889483,0.00028606193,0.00022015665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016612437,0.00053956883,0.00061714236,0.0004483658,0.00060513045,0.0006080764,0.0031540536,0.00029954858,0.000038217968],"category_scores_gemma":[0.00028549234,0.0004828643,0.00015971035,0.00081039977,0.00042410355,0.00051029166,0.001355914,0.0015966365,0.000114882874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023294886,0.000036152003,0.00000608965,0.0000059260487,0.000009874222,0.00007890355,0.00022072768,0.0581076,0.000021288379,0.1455213,0.00042294688,0.7955459],"study_design_scores_gemma":[0.0007202387,0.00031189076,0.000044335444,0.00070644723,0.000008491887,0.000079016034,5.6904476e-8,0.9187395,0.0002721368,0.052179243,0.026194394,0.00074426323],"about_ca_topic_score_codex":0.0000013966799,"about_ca_topic_score_gemma":0.000029416102,"teacher_disagreement_score":0.8606319,"about_ca_system_score_codex":0.000293451,"about_ca_system_score_gemma":0.0005138793,"threshold_uncertainty_score":0.9997623},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010250237,0.00067346904,0.9854917,0.00060970476,0.001193565,0.00057954586,0.0000016535548,0.00030287265,0.011045013],"genre_scores_gemma":[0.31132168,0.000040239393,0.68644464,0.0014924927,0.00046233126,0.00003055233,0.0000041074795,0.00004015543,0.00016379938],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99492437,0.00009040259,0.0005938386,0.0022372415,0.0009894649,0.0011647153],"domain_scores_gemma":[0.99647295,0.0010439768,0.00031183715,0.0017719866,0.0001582425,0.00024101179],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001273951,0.0007354322,0.0007953835,0.00104926,0.00026104422,0.00077655545,0.003990813,0.0007272455,0.000045044573],"category_scores_gemma":[0.00027192163,0.00064736116,0.000213103,0.0013362537,0.00075503957,0.00061645574,0.00087712373,0.0018790464,0.00009218929],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011994959,0.00012166999,0.000280319,0.000033076725,0.000004924338,0.00027853725,0.00070838426,0.022526896,0.000026004473,0.042511877,0.000005450233,0.9334909],"study_design_scores_gemma":[0.00048316582,0.00038131827,0.00082516274,0.0012663127,0.000008906512,0.00007232103,1.901877e-7,0.37662494,0.0006615016,0.61207515,0.0062065707,0.0013944393],"about_ca_topic_score_codex":0.00007571588,"about_ca_topic_score_gemma":0.00030937427,"teacher_disagreement_score":0.9320964,"about_ca_system_score_codex":0.0005226209,"about_ca_system_score_gemma":0.00092590007,"threshold_uncertainty_score":0.9995978},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029503955,0.0005736965,0.96179056,0.00026847507,0.004157628,0.00071457785,0.000021035705,0.000033854343,0.0029362352],"genre_scores_gemma":[0.9453624,0.000035494933,0.04941556,0.000547744,0.0025053956,0.000017038401,0.000020538258,0.00004364934,0.0020521875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990468,0.000004500465,0.00021255379,0.00036988658,0.00018378992,0.00018244331],"domain_scores_gemma":[0.9995183,0.00011876467,0.000107112544,0.00015141348,0.000071681534,0.000032734875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032559416,0.0001423301,0.00016054661,0.00024310888,0.00018008653,0.0003110026,0.0001635881,0.000081867656,0.00013472284],"category_scores_gemma":[0.000032854416,0.00012723522,0.000028278011,0.00002184941,0.00041183166,0.00013647157,0.00008112316,0.00023278577,0.000006608375],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047796893,0.00008369409,0.0003234529,0.00036656944,0.000030154219,0.000028060835,0.08439063,0.014745441,0.007309293,0.18663305,0.00003818687,0.70600367],"study_design_scores_gemma":[0.0019322467,0.00039767093,0.00065432634,0.002655008,0.00008260342,0.000048568334,0.00007624044,0.5268339,0.005031919,0.3550314,0.10489257,0.002363561],"about_ca_topic_score_codex":0.000045285593,"about_ca_topic_score_gemma":0.0013081396,"teacher_disagreement_score":0.91585845,"about_ca_system_score_codex":0.00007273697,"about_ca_system_score_gemma":0.00006325971,"threshold_uncertainty_score":0.5188502},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023884767,0.00033109312,0.9932552,0.00074763544,0.0016774227,0.0011126221,0.0000028163818,0.00019630934,0.0024380346],"genre_scores_gemma":[0.081791535,0.000023062179,0.913017,0.0039606523,0.0009914489,0.0000691244,0.000006291091,0.000039266717,0.00010163496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955842,0.000107015956,0.00058913085,0.0016251458,0.001260632,0.00083389465],"domain_scores_gemma":[0.9960986,0.0001532527,0.0002630073,0.0027940643,0.0002272058,0.00046390004],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0028357098,0.0005552584,0.00045926287,0.0008127156,0.00047680314,0.00077222567,0.0066797826,0.00030110552,0.0000113073265],"category_scores_gemma":[0.00016140922,0.00042182262,0.00008234743,0.0014191428,0.00025570692,0.00081097265,0.0022098764,0.00071652094,0.00019133397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066830926,0.000042792366,0.0000052713654,0.0000165376,0.0000036691654,0.0000013191442,0.004300372,0.16571856,0.0011497062,0.029086038,0.000024971265,0.79964405],"study_design_scores_gemma":[0.00014889226,0.00027153932,0.0006082409,0.00013372759,0.000011277151,0.000042634158,0.0000017720604,0.95379645,0.00890845,0.0139361145,0.021046516,0.0010944135],"about_ca_topic_score_codex":0.00002641015,"about_ca_topic_score_gemma":0.000013258762,"teacher_disagreement_score":0.79854965,"about_ca_system_score_codex":0.0003183477,"about_ca_system_score_gemma":0.00026589466,"threshold_uncertainty_score":0.99982333},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028306677,0.0031461783,0.9926253,0.0003352183,0.002733968,0.00050633255,0.0000062372583,0.0004597854,0.00015867171],"genre_scores_gemma":[0.014430695,0.0000380664,0.9842935,0.00028083168,0.0006709447,0.000015497259,0.0000015885959,0.000051559997,0.00021728154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597687,0.00009250128,0.0007072662,0.001366078,0.0010997163,0.00075758755],"domain_scores_gemma":[0.9933849,0.003241299,0.00054947525,0.0024260497,0.00028050182,0.00011778486],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001653148,0.00064170203,0.00075060915,0.0006916785,0.00023589205,0.00046624275,0.0059261117,0.00035773191,0.0000036628862],"category_scores_gemma":[0.0011764587,0.00046047676,0.00018714507,0.0006910385,0.0009491169,0.00070937397,0.0020862818,0.00143509,0.000007636387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018600938,0.0000047865374,0.0000049064874,0.00006061928,0.00000701039,0.000013822252,0.00029296815,0.5487407,0.00013256333,0.0050906218,0.0000032222622,0.44564697],"study_design_scores_gemma":[0.0007766268,0.00059130584,0.00018537702,0.0023436905,0.000052915282,0.00073535886,0.0000021879769,0.66797847,0.007924612,0.30856407,0.0077415346,0.003103821],"about_ca_topic_score_codex":0.000036635814,"about_ca_topic_score_gemma":0.000017847491,"teacher_disagreement_score":0.44254315,"about_ca_system_score_codex":0.0002749497,"about_ca_system_score_gemma":0.00047495865,"threshold_uncertainty_score":0.9997847},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011245805,0.0002377043,0.9927083,0.0004463278,0.0027663046,0.00067415636,0.000004161096,0.00017937763,0.0028712004],"genre_scores_gemma":[0.07667403,0.000052395597,0.91902876,0.00316998,0.00045792607,0.0000807351,0.000010173187,0.00006794498,0.00045804886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99615866,0.00007460611,0.00056205684,0.0015897086,0.0009980213,0.00061695755],"domain_scores_gemma":[0.99776274,0.00055508316,0.00032786053,0.0010381959,0.00021141458,0.00010472112],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009355891,0.0005050776,0.00040576997,0.0014636142,0.00023052939,0.0005789252,0.0016315194,0.00031999458,0.000032639426],"category_scores_gemma":[0.00010770275,0.0005157428,0.00009715797,0.0013794457,0.00046100272,0.0009337144,0.00022841475,0.0008409628,0.000032183438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018165229,0.000089721245,0.0010686052,0.000111664034,0.000012952573,0.00007369948,0.0011747541,0.20345835,0.0034223425,0.0012650864,0.00013326704,0.7891714],"study_design_scores_gemma":[0.0015619487,0.0007160963,0.0013235972,0.0009245639,0.000019955563,0.00022423669,0.0000017415019,0.8246763,0.080001876,0.08635543,0.0019246594,0.0022696133],"about_ca_topic_score_codex":0.00012046608,"about_ca_topic_score_gemma":0.0002678721,"teacher_disagreement_score":0.7869018,"about_ca_system_score_codex":0.0013620942,"about_ca_system_score_gemma":0.00077836256,"threshold_uncertainty_score":0.9997294},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007592755,0.00006689905,0.9958832,0.000098689154,0.00059274526,0.0005155262,0.000007727034,0.00014102238,0.002618254],"genre_scores_gemma":[0.3308287,0.0000030781503,0.66695774,0.0012299026,0.00059748045,0.000023282351,0.00005666445,0.00011096846,0.00019215101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847054,0.0000059724166,0.0002819379,0.0005410455,0.00034140583,0.00035912238],"domain_scores_gemma":[0.9991937,0.0001608605,0.000050272865,0.00041879696,0.000089537156,0.00008680802],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019078326,0.0003084349,0.00029132073,0.0004568606,0.00015184254,0.00015777738,0.00051039,0.00019774422,0.0000014641819],"category_scores_gemma":[0.000015212419,0.00030092866,0.00008088884,0.00022153623,0.00008840097,0.00006773801,0.00010294191,0.00023673524,0.000004089801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030640479,0.000007362521,0.000003982883,0.00009614811,0.0000030980673,0.0000038045202,0.00011709719,0.9701785,0.00007126504,0.001300582,0.00010714258,0.028107978],"study_design_scores_gemma":[0.00015569819,0.00004195635,0.0000061415644,0.00018476897,0.000006653892,0.000004890175,7.624686e-8,0.9859242,0.0005280665,0.011529853,0.0012549469,0.00036275527],"about_ca_topic_score_codex":0.000013932547,"about_ca_topic_score_gemma":0.000016966962,"teacher_disagreement_score":0.3307528,"about_ca_system_score_codex":0.00020302743,"about_ca_system_score_gemma":0.000078856014,"threshold_uncertainty_score":0.99994427},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051279357,0.0038543458,0.98825324,0.00046626249,0.0010318905,0.0008700025,0.00002277269,0.000020287705,0.00035323857],"genre_scores_gemma":[0.23774132,0.004461941,0.7440207,0.005663329,0.0048028994,0.00016840172,0.00036175837,0.00023053736,0.0025491088],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980571,0.000023089604,0.00029972437,0.0008446597,0.0003392529,0.0004361624],"domain_scores_gemma":[0.9988332,0.00006145236,0.00015955002,0.0007154859,0.00015770584,0.00007262302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034731845,0.00034573776,0.00025349343,0.00015374746,0.00027459493,0.000074366304,0.0008632381,0.0002538375,0.00000894384],"category_scores_gemma":[0.00006422713,0.00026787174,0.00014524323,0.00010806346,0.0004379571,0.000007442303,0.00043002804,0.00020363108,0.0000053796393],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009105198,0.00004760215,0.00030674902,0.00013154696,0.00013011628,0.00003855899,0.0010743617,0.03162557,0.21982825,0.00010695246,0.001205317,0.74541396],"study_design_scores_gemma":[0.009097875,0.0044364175,0.003418942,0.0012116153,0.0003493152,0.0013783647,0.0000038539406,0.2803301,0.31287012,0.027136903,0.35171035,0.008056142],"about_ca_topic_score_codex":0.0000109172315,"about_ca_topic_score_gemma":0.000051632756,"teacher_disagreement_score":0.7373578,"about_ca_system_score_codex":0.000075368116,"about_ca_system_score_gemma":0.00020860934,"threshold_uncertainty_score":0.99997735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10285881,0.000030598538,0.892899,0.0035437413,0.000040915096,0.00054720347,0.0000010590976,0.00007274937,0.000005942555],"genre_scores_gemma":[0.5221637,0.0000014624035,0.47667432,0.0010734223,0.000028739314,0.00005037847,0.000003921799,0.0000037754025,2.7330802e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911994,0.000009177226,0.00014709156,0.00030197555,0.0002328381,0.00018896007],"domain_scores_gemma":[0.9994488,0.00009404205,0.000026085581,0.00023779285,0.00011669972,0.0000765893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020094826,0.00007839826,0.00010976557,0.00011032638,0.00009507705,0.000018840532,0.0001510461,0.000028573118,0.0000045517477],"category_scores_gemma":[0.00021335747,0.00006441722,0.00003203909,0.0004329755,0.00022565348,0.00004590468,0.000032310687,0.00009777881,0.0000011310121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026410136,0.00025636147,0.0011350082,0.00016847832,0.0000037931882,0.00003644784,0.0002692739,0.572708,0.30124584,0.0002976195,0.00008521023,0.12376752],"study_design_scores_gemma":[0.00029769982,0.0000821215,0.000136421,0.000058944894,0.000006452912,0.00002741559,1.2755764e-7,0.91612023,0.07913913,0.0040540537,0.000013026524,0.00006437997],"about_ca_topic_score_codex":0.000014321165,"about_ca_topic_score_gemma":6.3467525e-7,"teacher_disagreement_score":0.41930488,"about_ca_system_score_codex":0.00005802585,"about_ca_system_score_gemma":0.0001526293,"threshold_uncertainty_score":0.2626858},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017657665,0.00032010544,0.99519205,0.00026328978,0.00229437,0.0007715545,0.000016963417,0.0007977098,0.0003262793],"genre_scores_gemma":[0.007315983,0.00003479955,0.99110043,0.00032484956,0.00077921414,0.000039971066,0.0000067604797,0.00006564266,0.00033233463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965835,0.000014891466,0.00046174348,0.0014920712,0.0007386053,0.00070917053],"domain_scores_gemma":[0.99718237,0.00036414657,0.00022680235,0.0016894983,0.00037579946,0.00016139814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007115094,0.00059257454,0.0005580631,0.0007750019,0.00020903665,0.00045985094,0.0036160545,0.00055401714,0.0000026700511],"category_scores_gemma":[0.000029492445,0.0005697786,0.00017792522,0.00031971978,0.00039345806,0.0004367787,0.0011563173,0.0011117208,0.000007892075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049362357,0.000024280533,0.0000070958704,0.00011159931,0.000017342907,0.000044010954,0.00091662916,0.2306394,0.0005314459,0.14619102,0.00003685423,0.6214754],"study_design_scores_gemma":[0.0001323861,0.000113898255,0.000002200769,0.0003117328,0.000009186566,0.000029057559,4.015201e-8,0.8981208,0.005251601,0.07796882,0.017439982,0.0006202539],"about_ca_topic_score_codex":0.00002494166,"about_ca_topic_score_gemma":0.000041188236,"teacher_disagreement_score":0.6674814,"about_ca_system_score_codex":0.00018099883,"about_ca_system_score_gemma":0.00031721767,"threshold_uncertainty_score":0.9996754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016490893,0.00035276604,0.9934842,0.00004264892,0.0003331241,0.00011782846,0.000004359081,0.000054035372,0.0039619515],"genre_scores_gemma":[0.8689489,0.000047945316,0.13057998,0.00018586143,0.00011176084,0.0000026251146,0.0000089796,0.000029832016,0.00008411995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880314,0.000004823531,0.0003348805,0.00029646777,0.0003232742,0.00023740283],"domain_scores_gemma":[0.9994451,0.00010831591,0.000059842918,0.00029102372,0.0000516409,0.000044092692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023367626,0.000213291,0.00025375467,0.0005172705,0.0000258281,0.000043708802,0.0004448082,0.00017996485,0.000039616738],"category_scores_gemma":[0.000008667729,0.00021808951,0.000058321813,0.00021328391,0.00015450067,0.000105901876,0.000051586612,0.00033589714,0.0000052809887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014949482,0.0000043443965,0.000028482777,0.000043234133,0.0000019950412,0.0000036813444,0.0001545366,0.94093055,0.000062458035,0.00084627885,0.000001634922,0.057921287],"study_design_scores_gemma":[0.00013823342,0.000016421247,0.000018219365,0.00022822448,0.0000027995368,0.0000012896684,9.540669e-8,0.99199194,0.00093748496,0.0062611536,0.00019579472,0.00020834665],"about_ca_topic_score_codex":0.000008437513,"about_ca_topic_score_gemma":0.00016965249,"teacher_disagreement_score":0.8672998,"about_ca_system_score_codex":0.00016591427,"about_ca_system_score_gemma":0.000091982554,"threshold_uncertainty_score":0.8893432},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000083304556,0.00093452464,0.9651791,0.00041874516,0.0015082152,0.0003395488,0.00001584628,0.00011637385,0.03140433],"genre_scores_gemma":[0.7380373,0.00020530884,0.260459,0.00057516474,0.00054841384,0.000009586192,0.000013529428,0.00003399374,0.000117735064],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698013,0.00005618274,0.0005843899,0.0010237411,0.00089994626,0.00045562186],"domain_scores_gemma":[0.99790424,0.0005208601,0.0003051368,0.00096574443,0.00017665733,0.00012737497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063066854,0.00039567525,0.0005510721,0.0007977663,0.000111347304,0.00018902666,0.0021376894,0.00030050002,0.00003056256],"category_scores_gemma":[0.000037119808,0.00035856396,0.00015848913,0.00058668817,0.00051117333,0.0005509098,0.00022974309,0.00041750039,0.00005524065],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000096979,0.000023091878,0.000026722504,0.00003969926,0.000011875396,0.00003921905,0.00095483055,0.00469611,0.0003255069,0.011075388,0.000042827167,0.982755],"study_design_scores_gemma":[0.001194774,0.000714309,0.0006176095,0.0013376374,0.000025296715,0.0001246171,6.5723503e-7,0.45939553,0.017728722,0.5101661,0.0070478753,0.0016468897],"about_ca_topic_score_codex":0.000016769947,"about_ca_topic_score_gemma":0.00012256144,"teacher_disagreement_score":0.9811081,"about_ca_system_score_codex":0.000102748054,"about_ca_system_score_gemma":0.0006331217,"threshold_uncertainty_score":0.99988663},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020502289,0.000043890595,0.9903548,0.00011047022,0.00060242706,0.00068547047,0.000003036015,0.00014528743,0.0060044136],"genre_scores_gemma":[0.7604747,0.000011100851,0.23892882,0.00037582478,0.000092980095,0.000012029177,0.0000035539708,0.000022574659,0.0000784339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966937,0.00007925021,0.0006781336,0.0013074529,0.00083596277,0.0004055228],"domain_scores_gemma":[0.99758625,0.00039469905,0.0002694785,0.0012765708,0.00029474567,0.00017825948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055837043,0.00039229498,0.0005294849,0.0006705915,0.00022356973,0.00031584164,0.0016230702,0.00019272485,0.00017332172],"category_scores_gemma":[0.00015524618,0.0003759489,0.00006151905,0.0007787294,0.00056326995,0.00046407527,0.00035866824,0.00051435595,0.000018538503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018358369,0.00039701036,0.0008447225,0.000057435354,0.000020782643,0.00009078377,0.0029613057,0.52132297,0.000052564843,0.016013838,0.000004000527,0.45821625],"study_design_scores_gemma":[0.00050314,0.0010504681,0.0009485657,0.00021647823,0.000021260888,0.00013472201,0.0000017213277,0.856645,0.000033608554,0.13972273,0.00016027654,0.000562047],"about_ca_topic_score_codex":0.00008669556,"about_ca_topic_score_gemma":0.00016279017,"teacher_disagreement_score":0.75842446,"about_ca_system_score_codex":0.00016640207,"about_ca_system_score_gemma":0.0010019583,"threshold_uncertainty_score":0.9998692},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008008186,0.003402239,0.9933801,0.00010270759,0.001157009,0.00019971184,0.0000049280075,0.00007005639,0.0008824214],"genre_scores_gemma":[0.93702704,0.0007782114,0.060318384,0.0005832116,0.0004153515,0.000011185188,0.0000042012084,0.00007373123,0.00078868424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876106,0.000006898415,0.00031584097,0.00035464996,0.0003065877,0.000254946],"domain_scores_gemma":[0.99936056,0.000021865122,0.000031480653,0.0004365633,0.00009578292,0.00005372963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017968545,0.00024829584,0.00028132318,0.00030056518,0.00006895556,0.00007109387,0.00049810926,0.00014967144,0.000031677802],"category_scores_gemma":[0.000022740442,0.0002046178,0.000058579597,0.00015008092,0.000347552,0.00016251106,0.00008093681,0.00030876818,0.000021416394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.4909207e-7,0.0000058742908,0.000005504132,0.00007635275,0.000008603887,0.000005152156,0.00027982786,0.9293176,0.0037999954,0.0036425123,0.000011693669,0.06284616],"study_design_scores_gemma":[0.000082860475,0.00007123699,0.000015142156,0.0006057128,0.000011373814,0.000019678264,2.0128519e-7,0.81626093,0.16120389,0.019597707,0.0015061662,0.00062511774],"about_ca_topic_score_codex":0.000012559664,"about_ca_topic_score_gemma":0.000043352687,"teacher_disagreement_score":0.93622625,"about_ca_system_score_codex":0.00008040462,"about_ca_system_score_gemma":0.00007853756,"threshold_uncertainty_score":0.83440715},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002514841,0.00009171665,0.9951765,0.0001803705,0.002530636,0.0007014298,0.000013760045,0.00032431993,0.0007297824],"genre_scores_gemma":[0.69627625,0.00003262444,0.3012696,0.00086955767,0.0010182831,0.000040184346,0.00003069295,0.00005179242,0.00041101166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961342,0.00003448356,0.00061100937,0.00173458,0.0008036255,0.000682097],"domain_scores_gemma":[0.99765676,0.00018877859,0.00035317373,0.001286884,0.00032855384,0.00018586051],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008621544,0.00054910214,0.00049313373,0.00079419906,0.00053221325,0.0005124873,0.0021711742,0.0005023099,0.000022294907],"category_scores_gemma":[0.00004077177,0.0005299568,0.0001776179,0.0005231124,0.00029504337,0.0011441396,0.00054383586,0.0007332993,0.000018691399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027188446,0.000040114912,7.304403e-7,0.000026011265,0.0000038833496,0.0000053079134,0.00028944414,0.25010118,0.0051831184,0.0029117062,0.000028130102,0.7413832],"study_design_scores_gemma":[0.0002930859,0.0005705573,0.000009206642,0.000077977515,0.0000076754195,0.000024880703,3.0306897e-8,0.8751977,0.024866214,0.09748639,0.00092777685,0.00053851586],"about_ca_topic_score_codex":0.00004263976,"about_ca_topic_score_gemma":0.0006769364,"teacher_disagreement_score":0.74084467,"about_ca_system_score_codex":0.0003812009,"about_ca_system_score_gemma":0.00033115465,"threshold_uncertainty_score":0.9997152},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035630885,0.002638228,0.99516714,0.00006145013,0.00066336227,0.00046853605,0.0000053804624,0.0003934681,0.00056678103],"genre_scores_gemma":[0.01181571,0.00006168858,0.9875635,0.000052575506,0.00039643137,0.00004449445,0.0000023789926,0.000028823622,0.00003441383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966503,0.000032126307,0.0006637894,0.0012169891,0.00093429757,0.0005025454],"domain_scores_gemma":[0.99449825,0.0030147734,0.0005315347,0.001144049,0.0007126056,0.00009878637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013465136,0.00043123122,0.00051025394,0.0006241239,0.00015847405,0.00013439504,0.0028611708,0.00016099135,0.0000046185173],"category_scores_gemma":[0.002248791,0.00041308295,0.00007130353,0.0012159559,0.000498006,0.0005323841,0.0011411366,0.0007082775,0.000008286698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.155168e-7,0.000011049109,0.000021498938,0.00012289757,0.0000025372628,0.000002639792,0.0001124119,0.35600963,0.00018796048,0.0019009954,7.4998417e-7,0.64162713],"study_design_scores_gemma":[0.00028746572,0.00025434408,0.00010702147,0.0015187791,0.000020299753,0.000098067045,2.4407012e-7,0.6962433,0.0043486864,0.29455948,0.0014076948,0.0011546287],"about_ca_topic_score_codex":0.0000016673498,"about_ca_topic_score_gemma":0.000008440071,"teacher_disagreement_score":0.6404725,"about_ca_system_score_codex":0.00015924373,"about_ca_system_score_gemma":0.0012850759,"threshold_uncertainty_score":0.9998321},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000061556384,0.0003280081,0.98764426,0.0002035269,0.0010724555,0.00046649764,0.0000011053995,0.00011021813,0.010112376],"genre_scores_gemma":[0.73567563,0.00002704601,0.26344234,0.00009773381,0.00019388869,0.000010553439,0.0000033383017,0.000024248784,0.00052520883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968709,0.000071818125,0.00051818875,0.0012392964,0.0008915567,0.00040824807],"domain_scores_gemma":[0.99747443,0.00035223793,0.0005408851,0.0012001216,0.00032617222,0.000106173175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000983713,0.00040742918,0.00050597877,0.0005180801,0.000116571,0.00024490996,0.0020144335,0.00024308889,0.000017096894],"category_scores_gemma":[0.000051965326,0.00031368967,0.00009177271,0.0006183605,0.00032840745,0.00042001272,0.00026076363,0.0005357534,0.000031872893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001427544,0.00006102972,0.000037964586,0.00004414399,0.000011522997,0.00001678459,0.00067965506,0.018460285,0.0002641776,0.3125171,0.000013468753,0.6678796],"study_design_scores_gemma":[0.00075726304,0.0019360771,0.0002993764,0.00042443507,0.000022747521,0.00022129725,0.0000012383349,0.48995572,0.019445788,0.4794853,0.006273982,0.0011767779],"about_ca_topic_score_codex":0.000037539252,"about_ca_topic_score_gemma":0.000048175363,"teacher_disagreement_score":0.7356141,"about_ca_system_score_codex":0.00020236378,"about_ca_system_score_gemma":0.00024283126,"threshold_uncertainty_score":0.9999315},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000949043,0.0005960326,0.99255514,0.00060066435,0.00320162,0.00094801036,0.0000532014,0.00025302888,0.0016974198],"genre_scores_gemma":[0.7989338,0.00003581163,0.1959603,0.001289868,0.002278383,0.00010847251,0.00002587734,0.000078402845,0.0012890999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956312,0.000027719656,0.00069952133,0.0018104648,0.0010172892,0.000813806],"domain_scores_gemma":[0.9972937,0.00027745473,0.00042772037,0.0013655846,0.0004108141,0.00022468771],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010403156,0.0005691068,0.0006325813,0.00052565517,0.00036877423,0.00059639383,0.0028986263,0.00045012328,0.000009840945],"category_scores_gemma":[0.00006963682,0.0005185823,0.00023080742,0.0005444914,0.00047296463,0.0003459804,0.0006003,0.00063435314,0.000053408436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011934487,0.00004190516,0.000011968103,0.000078709636,0.000015667218,0.000018098503,0.0003750594,0.11907967,0.00022575262,0.009580278,0.00006036581,0.87050056],"study_design_scores_gemma":[0.00054331945,0.0002232046,0.00008311628,0.00036214225,0.000010537768,0.00007318532,1.6445506e-7,0.96259314,0.0019796216,0.009427231,0.024026891,0.00067747425],"about_ca_topic_score_codex":0.000011400871,"about_ca_topic_score_gemma":0.000058763406,"teacher_disagreement_score":0.8698231,"about_ca_system_score_codex":0.00037211488,"about_ca_system_score_gemma":0.00040071947,"threshold_uncertainty_score":0.9997266},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19719358,0.0037408015,0.687382,0.0019553879,0.0563839,0.0020362942,0.000038437815,0.00026117763,0.05100842],"genre_scores_gemma":[0.9882669,0.00020316867,0.004827522,0.000042329873,0.0049096886,0.000003820271,0.000007175118,0.000013826702,0.001725575],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971769,0.00005823357,0.00046341697,0.00049816136,0.001517347,0.00028595552],"domain_scores_gemma":[0.99847937,0.00035625874,0.00037156086,0.00019433023,0.00050512137,0.00009336007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001311779,0.00022548866,0.00032822014,0.00025853748,0.000347804,0.00025430945,0.0010528314,0.0004030085,0.000053036732],"category_scores_gemma":[0.00024641224,0.00018020863,0.000107216954,0.00014710713,0.0011777403,0.0001994632,0.00019974045,0.0005903994,0.000017173827],"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.00008533572,0.00006690981,0.00013836696,0.000058454076,0.000040166913,0.000026569605,0.73022693,0.034156423,0.0003123032,0.17066881,0.000013465803,0.064206265],"study_design_scores_gemma":[0.0031330767,0.0025139516,0.0004075522,0.0049540587,0.00023971751,0.00006489909,0.016964383,0.13214926,0.006476999,0.3892111,0.437593,0.0062919874],"about_ca_topic_score_codex":0.0023721503,"about_ca_topic_score_gemma":0.004617471,"teacher_disagreement_score":0.7910733,"about_ca_system_score_codex":0.0002282004,"about_ca_system_score_gemma":0.00028051191,"threshold_uncertainty_score":0.7348695},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004498298,0.000014684478,0.99284256,0.001015272,0.00046657963,0.00064939674,2.4676885e-7,0.00037504797,0.00013793929],"genre_scores_gemma":[0.66361135,3.5000073e-7,0.33591855,0.00026426013,0.00013193027,0.00005136871,0.0000034309871,0.000008566793,0.000010199625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969391,0.0000932474,0.00043928061,0.0009930088,0.00085893465,0.0006764194],"domain_scores_gemma":[0.99859035,0.0001989745,0.00017081432,0.00068173377,0.00021358524,0.00014454372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000941892,0.00023941441,0.00020156118,0.00041903937,0.00036795036,0.0004914094,0.0016809596,0.00009624056,0.000004753355],"category_scores_gemma":[0.000107914275,0.00022914598,0.0000489477,0.0024574364,0.00023951937,0.0006643368,0.0007200404,0.00037691492,0.000100824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023617695,0.000041479678,0.0017171053,0.000006474717,0.0000010938104,0.0000026409282,0.0004929047,0.80816656,0.001766702,0.0014556941,0.00003259225,0.18631437],"study_design_scores_gemma":[0.0002640618,0.00021667435,0.0024689746,0.000025315725,0.0000019001313,0.000010513566,0.0000010932779,0.97785515,0.0154152885,0.0014144434,0.0020500503,0.00027656436],"about_ca_topic_score_codex":0.0001820573,"about_ca_topic_score_gemma":0.000035281882,"teacher_disagreement_score":0.65911305,"about_ca_system_score_codex":0.00036403607,"about_ca_system_score_gemma":0.00019056875,"threshold_uncertainty_score":0.9344302},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027426468,0.0004542181,0.994036,0.0003956445,0.0028148445,0.00047024907,0.000016858443,0.00019000634,0.0015947069],"genre_scores_gemma":[0.006593918,0.00001845659,0.991513,0.0005122177,0.00093810813,0.000016606768,0.000015240139,0.000038162765,0.00035426053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962044,0.000012990179,0.0004742346,0.0017280127,0.0008360765,0.0007443144],"domain_scores_gemma":[0.9966457,0.00065399107,0.00030337213,0.0018421314,0.0003467055,0.00020810924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008098668,0.0005251173,0.0004992606,0.00061321,0.0005154365,0.0006289229,0.003426416,0.0004534679,0.000026807746],"category_scores_gemma":[0.00018498444,0.0004605598,0.00015818262,0.00034486028,0.0004417885,0.0011084338,0.0022448217,0.0010207966,0.000024725556],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034130555,0.00002408648,0.000016011463,0.00004808137,0.00000764214,0.000030270974,0.0002691952,0.0012700836,0.0017499091,0.038474612,0.00005062193,0.9580561],"study_design_scores_gemma":[0.0003323273,0.00014363619,0.000054512624,0.0005231238,0.000008021807,0.000053250835,1.0879172e-7,0.84686613,0.006032786,0.1253137,0.0198764,0.0007960151],"about_ca_topic_score_codex":0.000019803718,"about_ca_topic_score_gemma":0.000044874665,"teacher_disagreement_score":0.9572601,"about_ca_system_score_codex":0.00015854386,"about_ca_system_score_gemma":0.00052199455,"threshold_uncertainty_score":0.9997846},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002629782,0.0008431246,0.8831334,0.0005354973,0.0005885574,0.11424067,0.00008764565,0.00027401085,0.00027080797],"genre_scores_gemma":[0.008523185,0.00014947756,0.7967384,0.0016485984,0.0017201853,0.1902274,0.00009497827,0.0002078209,0.0006899337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925093,0.00009342572,0.0013237963,0.0027805099,0.0017039756,0.0015890102],"domain_scores_gemma":[0.9925699,0.0016886609,0.0010564917,0.003376161,0.0008359495,0.00047281545],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017971594,0.0012564556,0.0019275456,0.0006550434,0.00076360075,0.0018494893,0.0074916068,0.0008232976,0.00002710187],"category_scores_gemma":[0.00014371207,0.00093358126,0.0004437678,0.0012784246,0.00083246897,0.0008841241,0.0019785943,0.0011679035,0.000011886145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007033849,0.00013483559,0.000020422309,0.00014315573,0.000051708044,0.00018140077,0.0002105088,0.5738685,0.000008689538,0.0049840347,0.0003236988,0.41936967],"study_design_scores_gemma":[0.012043493,0.0038286222,0.000050007806,0.005094716,0.000047938953,0.00013237984,4.6559663e-7,0.8334419,0.00048438474,0.118889466,0.023886655,0.00209993],"about_ca_topic_score_codex":0.0000070680794,"about_ca_topic_score_gemma":0.000078775694,"teacher_disagreement_score":0.41726974,"about_ca_system_score_codex":0.00066307886,"about_ca_system_score_gemma":0.0018124747,"threshold_uncertainty_score":0.99931145},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000048486786,0.00082231103,0.99299246,0.0008106244,0.0023324592,0.00076841895,0.0013752987,0.000312861,0.00058074144],"genre_scores_gemma":[0.006624971,0.00006820481,0.9911295,0.0006465417,0.0007303162,0.000029645882,0.0003780273,0.00006287943,0.0003299016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99507016,0.000018822178,0.00070800603,0.0024846615,0.00084830826,0.0008700295],"domain_scores_gemma":[0.9943895,0.00050248945,0.00040495995,0.0041288096,0.00035833058,0.00021596502],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009173278,0.00068278855,0.0007547371,0.00045097692,0.00034031735,0.00045397843,0.0065398673,0.00028136355,0.000012540205],"category_scores_gemma":[0.00034947196,0.0005941519,0.000121028665,0.0005958712,0.000642645,0.0018374273,0.005464616,0.00058344414,0.000020059835],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029557354,0.00008662488,0.000015114856,0.00018693059,0.00004301062,0.00007413238,0.0005291228,0.022404173,0.00027673194,0.12539415,0.0004969845,0.85046345],"study_design_scores_gemma":[0.0006946225,0.00025702146,0.000021450418,0.0008891277,0.000017294391,0.00021841093,7.055969e-7,0.56468475,0.0011146631,0.026741156,0.40410385,0.001256984],"about_ca_topic_score_codex":0.00007528224,"about_ca_topic_score_gemma":0.000263584,"teacher_disagreement_score":0.8492065,"about_ca_system_score_codex":0.00030536664,"about_ca_system_score_gemma":0.00081529684,"threshold_uncertainty_score":0.999651},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014743349,0.0013846144,0.9907111,0.00103819,0.0034870782,0.0004097126,0.0000102834165,0.00016007882,0.002651532],"genre_scores_gemma":[0.7429928,0.00028724916,0.25264382,0.0021819253,0.001048927,0.000017390461,0.000054633485,0.000046288114,0.00072693074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958801,0.00006652894,0.0007096591,0.0018255294,0.0009144815,0.0006036674],"domain_scores_gemma":[0.99616784,0.0006232007,0.00028073447,0.0026643765,0.0001507376,0.00011311309],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001386572,0.00047912315,0.00061626115,0.0009394967,0.00012658433,0.0007552208,0.005816764,0.00035486658,0.0000065779527],"category_scores_gemma":[0.00021314486,0.00040930617,0.00006933572,0.00051741843,0.00065833994,0.0012014067,0.0021796154,0.0007682882,0.00004089557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074430354,0.000041493346,0.00015742709,0.000030233206,0.000011788822,0.0001905619,0.00085349794,0.04864992,0.0000654253,0.07054024,0.0001355663,0.8793164],"study_design_scores_gemma":[0.00027340697,0.00013090302,0.0002766942,0.00068561913,0.0000068285285,0.000116324365,0.0000029341772,0.9862115,0.00013481887,0.008920178,0.0026417354,0.00059905415],"about_ca_topic_score_codex":0.0002106832,"about_ca_topic_score_gemma":0.0014420208,"teacher_disagreement_score":0.9375616,"about_ca_system_score_codex":0.0003925793,"about_ca_system_score_gemma":0.0006931144,"threshold_uncertainty_score":0.9998359},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00559609,0.000038299437,0.98961407,0.0000705045,0.0004914176,0.0010289017,0.00007092376,0.00005819751,0.0030316245],"genre_scores_gemma":[0.947529,0.0000067647015,0.05189899,0.0002617339,0.000094598414,0.00010364086,0.000002711848,0.000019169694,0.000083375664],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971387,0.00006287774,0.00082817517,0.0008995007,0.00076475594,0.00030603516],"domain_scores_gemma":[0.995327,0.0025588365,0.0008247768,0.0008290829,0.00038720746,0.00007308125],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030826754,0.00027129785,0.00053049816,0.00041523526,0.00025850846,0.000037949492,0.00094926567,0.0001641193,0.0000097626735],"category_scores_gemma":[0.0007063957,0.00024794135,0.00019405648,0.00037125166,0.0010606552,0.00015655652,0.0001234023,0.00029646486,0.000005784671],"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.00013839781,0.00021140653,0.00007983888,0.0009028435,0.000010464219,0.000010738498,0.0033403242,0.10214254,0.7646201,0.036929335,0.000007073718,0.091606885],"study_design_scores_gemma":[0.00063234346,0.0005161463,0.00006255527,0.00074302434,0.000024893163,0.0000701652,0.000010215016,0.23550938,0.74891645,0.012396679,0.0004736618,0.0006444691],"about_ca_topic_score_codex":0.000033538796,"about_ca_topic_score_gemma":0.00001747297,"teacher_disagreement_score":0.9419329,"about_ca_system_score_codex":0.0001737292,"about_ca_system_score_gemma":0.0004027233,"threshold_uncertainty_score":0.99999726},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022812239,0.0017831841,0.9887618,0.001187393,0.0011771357,0.00025859693,0.0000056417707,0.00037626125,0.0062219063],"genre_scores_gemma":[0.16014989,0.0006964416,0.82847863,0.0059667733,0.0014512413,0.000013376107,0.000010544431,0.000099950004,0.003133165],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646056,0.00006318111,0.0004427653,0.001614324,0.0007828366,0.00063633797],"domain_scores_gemma":[0.99711096,0.00068141846,0.00023868876,0.0016588176,0.00010296555,0.00020715919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001727423,0.0005328729,0.00049447746,0.0006865438,0.00027980842,0.00058405707,0.0030779173,0.0003379365,0.000047869937],"category_scores_gemma":[0.00007539662,0.00045860434,0.00009576613,0.000391454,0.0008404925,0.00081570196,0.002126875,0.0006781301,0.00006546127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004250961,0.000015291025,0.00000652791,0.00001806767,0.000005356896,0.00004264706,0.0003686819,0.0005399729,0.000072643285,0.18089314,0.000027261303,0.81800616],"study_design_scores_gemma":[0.00029402197,0.00014389302,0.00016019939,0.00043751937,0.00000769479,0.00019789118,1.9124171e-7,0.29240158,0.0008894552,0.69837475,0.006392697,0.00070013147],"about_ca_topic_score_codex":0.000005788131,"about_ca_topic_score_gemma":0.0000109633,"teacher_disagreement_score":0.81730604,"about_ca_system_score_codex":0.00017652003,"about_ca_system_score_gemma":0.0002529964,"threshold_uncertainty_score":0.99978656},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025728357,0.00022303696,0.99507225,0.00022329469,0.00079250144,0.0003224245,0.000010551624,0.0001118546,0.00067124626],"genre_scores_gemma":[0.8947165,0.000022788441,0.10330336,0.0015858881,0.00030882616,0.0000050542385,0.000008261586,0.000031086805,0.000018237257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965912,0.000060877082,0.0005491651,0.0014614977,0.00083540677,0.00050182926],"domain_scores_gemma":[0.99733937,0.00045707158,0.00042600013,0.0013852196,0.00022804155,0.00016428217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000615554,0.0005116101,0.00059082505,0.0009435259,0.00017629925,0.00027843614,0.0022620286,0.00029199108,0.0000036059712],"category_scores_gemma":[0.000023530603,0.00045171363,0.00010678219,0.00048847427,0.00039887318,0.00020967098,0.0008957006,0.00062509876,0.000004499138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032888882,0.000091326954,0.0016577748,0.0010833996,0.0000326653,0.0000468914,0.0019168655,0.04259239,0.001701501,0.008150906,0.0000018707267,0.9426915],"study_design_scores_gemma":[0.00057610474,0.00045643287,0.0021755386,0.00083386997,0.000024367022,0.00007501359,5.999615e-7,0.96342164,0.010709492,0.020195108,0.0007114509,0.00082037685],"about_ca_topic_score_codex":0.00019066944,"about_ca_topic_score_gemma":0.00033803633,"teacher_disagreement_score":0.94187117,"about_ca_system_score_codex":0.00006852805,"about_ca_system_score_gemma":0.00017417896,"threshold_uncertainty_score":0.99979347},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035781704,0.0006306635,0.9914475,0.00065550656,0.002706119,0.0006010567,0.000010553707,0.00039310867,0.003519722],"genre_scores_gemma":[0.0151080005,0.000038335995,0.97994506,0.002513099,0.0012191476,0.000012353649,0.000008613786,0.00006772677,0.0010876834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956498,0.000030852178,0.000644654,0.0019535196,0.0007137454,0.0010074053],"domain_scores_gemma":[0.9964664,0.0010991428,0.0003687313,0.0016000537,0.0002508346,0.000214868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012415217,0.00066283584,0.00068408716,0.00074235274,0.00041511987,0.00079086376,0.004707746,0.0003800701,0.000025107058],"category_scores_gemma":[0.00009822828,0.000615553,0.00025689893,0.00051569764,0.00055071135,0.0004214599,0.0016052991,0.00068975205,0.00006075401],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020972652,0.000026438243,0.000006878424,0.000045370332,0.0000118961125,0.000047994796,0.00050824246,0.007422816,0.000044796423,0.070192255,0.000058314123,0.9216329],"study_design_scores_gemma":[0.00029545676,0.00014885452,0.00001998535,0.00030224174,0.000007243196,0.000081044986,1.12850636e-7,0.78938496,0.00059212896,0.2045833,0.003922466,0.0006622225],"about_ca_topic_score_codex":0.000011670946,"about_ca_topic_score_gemma":0.00001075857,"teacher_disagreement_score":0.9209707,"about_ca_system_score_codex":0.00024612507,"about_ca_system_score_gemma":0.00022745585,"threshold_uncertainty_score":0.99962956},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016075863,0.0002652588,0.99849945,0.00020957922,0.00020252955,0.00046607762,0.000008218711,0.00007504284,0.00011305754],"genre_scores_gemma":[0.09956406,0.00004060379,0.8997322,0.00044368277,0.00013518467,0.000005698485,0.000018419027,0.00001581507,0.00004438709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812776,0.000018617302,0.00041898497,0.00073851953,0.0004937729,0.0002023616],"domain_scores_gemma":[0.9987265,0.00027632705,0.00034732025,0.0003514426,0.00023090401,0.00006751808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044733752,0.00022884036,0.00028327017,0.00037789228,0.00013224373,0.00036523913,0.0005725637,0.00020368787,0.000004972015],"category_scores_gemma":[0.00010013129,0.00021260917,0.00003127277,0.00021251726,0.0006404895,0.00056126283,0.00023254624,0.00017598369,9.042211e-8],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040437426,0.000010003345,0.00007359713,0.00017214811,0.000004515678,0.000004226583,0.00043836684,0.00085189193,0.0042120153,0.027614536,0.0000565419,0.9665581],"study_design_scores_gemma":[0.0002902929,0.00022567256,0.00032778786,0.00036135266,0.000010377288,0.00003421083,2.066355e-7,0.77042943,0.050110996,0.17774351,0.00012136925,0.00034481267],"about_ca_topic_score_codex":0.000012791522,"about_ca_topic_score_gemma":0.000025537884,"teacher_disagreement_score":0.9662133,"about_ca_system_score_codex":0.00005524415,"about_ca_system_score_gemma":0.00015321882,"threshold_uncertainty_score":0.86699504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009749269,0.006903201,0.9577877,0.00022383475,0.002462754,0.0011894554,0.000005274288,0.000080521146,0.030372318],"genre_scores_gemma":[0.44616225,0.00082786207,0.5397661,0.0010402516,0.0019036726,0.00016422597,0.00018542414,0.00011069109,0.009839584],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758583,0.000030241477,0.00037015713,0.000859294,0.00079358404,0.00036089637],"domain_scores_gemma":[0.9985679,0.00007757648,0.00023065046,0.0007940737,0.00022613151,0.00010368673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044583343,0.0003429262,0.0004494612,0.00082537037,0.00018458908,0.00013633304,0.00032520245,0.00017871661,0.00007485962],"category_scores_gemma":[0.00005458603,0.00032667894,0.0004937242,0.00041344517,0.00028189764,0.0001424037,0.00027396853,0.000605863,0.00004483488],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001650299,0.0001586155,0.0003901414,0.0003540389,0.0002560428,0.000016215396,0.00045238656,0.0071199667,4.3976527e-7,0.0032907487,0.0004323302,0.9875126],"study_design_scores_gemma":[0.0039316816,0.0032820518,0.05533559,0.07876041,0.009329128,0.00011598316,0.00010608791,0.06050603,0.0005760437,0.5723638,0.2095571,0.0061360872],"about_ca_topic_score_codex":0.000044847056,"about_ca_topic_score_gemma":0.000008717553,"teacher_disagreement_score":0.98137647,"about_ca_system_score_codex":0.0005969257,"about_ca_system_score_gemma":0.00020225058,"threshold_uncertainty_score":0.9999185},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001793462,0.00022663487,0.9835783,0.00051768596,0.0003726131,0.00034522888,0.000006123954,0.000036790385,0.013123147],"genre_scores_gemma":[0.9550552,0.000023183904,0.04294423,0.00070685626,0.00049836485,0.000006781216,0.000013759083,0.000019851284,0.000731823],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659234,0.00006740161,0.0008552943,0.00091161137,0.0011929215,0.00038041777],"domain_scores_gemma":[0.9972283,0.0013711568,0.00038320624,0.00064505293,0.0002677341,0.00010453813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00391707,0.00025936746,0.00033287168,0.0012220778,0.00018247055,0.00044419212,0.0010303934,0.00025663784,0.00011395473],"category_scores_gemma":[0.000834701,0.00022516586,0.00005766825,0.0011091625,0.0006351796,0.00094462844,0.00046978402,0.0004440415,0.000049804217],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020545212,0.000027525977,0.0014277807,0.0000149375055,0.0000022949919,0.000014883824,0.002074076,0.02779033,0.00028211635,0.08151964,0.00004923982,0.8867766],"study_design_scores_gemma":[0.00015378404,0.000035739427,0.0028088859,0.00015815809,0.0000033934102,0.00003835356,0.000004274298,0.33014622,0.00026685718,0.6642673,0.0018460032,0.00027101775],"about_ca_topic_score_codex":0.00000956184,"about_ca_topic_score_gemma":0.00016958699,"teacher_disagreement_score":0.9532617,"about_ca_system_score_codex":0.00022581039,"about_ca_system_score_gemma":0.00018275001,"threshold_uncertainty_score":0.9181997},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096520735,0.00031641225,0.99590105,0.00023156258,0.0009587329,0.0005602941,0.000019837757,0.00014755914,0.00089932786],"genre_scores_gemma":[0.36575648,0.00011443449,0.6331206,0.00044481343,0.00033261298,0.000023728197,0.000022852626,0.000051950894,0.00013254641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968801,0.000026764847,0.0006075463,0.0012038891,0.0007398839,0.00054181356],"domain_scores_gemma":[0.99760854,0.00056434475,0.00039901212,0.0010906009,0.0002282485,0.00010923926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008111552,0.0004404868,0.000570004,0.000748645,0.00021215362,0.0002074294,0.002584882,0.00025831352,0.0000090323265],"category_scores_gemma":[0.0000581991,0.00040454787,0.0002129978,0.000484834,0.00055728276,0.0006678505,0.00037580813,0.00032509994,0.000004816032],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013579522,0.000048389295,0.000014717465,0.00016793591,0.00002213938,0.000020675674,0.0023100208,0.023393089,0.0025070603,0.026018227,0.000033067965,0.9454511],"study_design_scores_gemma":[0.0006210865,0.0003466342,0.00005918914,0.0006074372,0.000018497822,0.00008615694,6.3855913e-7,0.77837497,0.06186604,0.15622924,0.00092835276,0.00086173543],"about_ca_topic_score_codex":0.000012582916,"about_ca_topic_score_gemma":0.000005162818,"teacher_disagreement_score":0.9445894,"about_ca_system_score_codex":0.00014605992,"about_ca_system_score_gemma":0.00037641142,"threshold_uncertainty_score":0.9998406},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036266545,0.0066034254,0.98994863,0.00053890765,0.0004437133,0.00043213068,0.0000014527659,0.00016293954,0.0015061166],"genre_scores_gemma":[0.16134275,0.00021850156,0.83681816,0.0010852563,0.00035236977,0.000018651976,0.000014230896,0.000023375263,0.00012671787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719644,0.000055330867,0.0003640893,0.0011525475,0.0008773859,0.00035421064],"domain_scores_gemma":[0.9987931,0.00013651868,0.00014256722,0.0006942482,0.00016244675,0.00007107655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013944407,0.0003197739,0.0002922858,0.0009171791,0.000120343524,0.0005018577,0.0013706059,0.00029036458,0.000015933363],"category_scores_gemma":[0.000068661924,0.0002960988,0.000035668287,0.00049198326,0.0002762129,0.00087470684,0.0005336166,0.00059608277,0.00000568082],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019333384,0.000008084756,0.00002921842,0.000012583101,0.0000013009546,0.000026287296,0.00031347404,0.001886418,0.00039931736,0.0064867297,0.000018969522,0.9908157],"study_design_scores_gemma":[0.00013844964,0.000050228235,0.000053785472,0.00025612998,0.0000034027241,0.00003329219,2.634797e-8,0.64334357,0.0023152067,0.35327953,0.00020342092,0.0003229625],"about_ca_topic_score_codex":0.00004396183,"about_ca_topic_score_gemma":0.00025925844,"teacher_disagreement_score":0.9904927,"about_ca_system_score_codex":0.00032637327,"about_ca_system_score_gemma":0.0004130218,"threshold_uncertainty_score":0.9999491},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01825787,0.000116891686,0.9778834,0.001698086,0.00009925794,0.0013021217,0.00015259444,0.000025720758,0.00046405292],"genre_scores_gemma":[0.9005486,0.00040981025,0.096454464,0.0018480133,0.00014576562,0.000047305668,0.00049074093,0.000032251945,0.000023060775],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99622625,0.00011933165,0.00059455476,0.0012690478,0.001128059,0.0006627674],"domain_scores_gemma":[0.9964926,0.0013557444,0.00017526212,0.0013940315,0.00027019926,0.0003121179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041205073,0.00034313527,0.00081045483,0.0011466373,0.00022550124,0.0005583961,0.0007078278,0.00016920338,0.000041768733],"category_scores_gemma":[0.00027702592,0.00024419857,0.000049285467,0.0009865677,0.0006911408,0.0003393451,0.0004497311,0.00081295986,0.0000035007772],"study_design_candidate":"design_other","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.000103882405,0.00015712161,0.11116853,0.00038415528,0.00023712883,0.00017801521,0.0014450494,0.0046806415,0.000011578253,0.009590094,0.00024449447,0.8717993],"study_design_scores_gemma":[0.00082089845,0.00082356296,0.58034223,0.00034995767,0.000078944264,0.000025762625,0.0000012631589,0.40343553,0.0000050683952,0.011350904,0.0023437224,0.0004221466],"about_ca_topic_score_codex":0.0028872155,"about_ca_topic_score_gemma":0.032087833,"teacher_disagreement_score":0.8822907,"about_ca_system_score_codex":0.00033474856,"about_ca_system_score_gemma":0.0006914819,"threshold_uncertainty_score":0.9958129},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022882049,0.00034934998,0.99752235,0.00007523755,0.0005756886,0.0003569286,0.000008978386,0.0003715485,0.0005111179],"genre_scores_gemma":[0.0069808625,0.000022194527,0.9923237,0.0001098701,0.00034867873,0.00001826656,0.0000034757297,0.000058079797,0.00013487341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841994,0.0000012073596,0.0002503122,0.0006145831,0.00022584533,0.00048808355],"domain_scores_gemma":[0.9987982,0.0005679377,0.000055233508,0.00043399236,0.00007383643,0.000070792266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017789182,0.0003569958,0.0003350007,0.00025297553,0.00012896984,0.00007659815,0.0005069722,0.00039236867,0.000005840217],"category_scores_gemma":[0.00011619234,0.00033001843,0.000041070907,0.00014340416,0.0005937567,0.00013185374,0.000287783,0.000853828,0.000006461179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010519365,0.000003026352,2.3272577e-7,0.00003053796,0.000003650267,0.000004006979,0.00003249165,0.4332914,0.00036879303,0.0004631155,8.1906524e-7,0.56580085],"study_design_scores_gemma":[0.00019549685,0.00010992504,0.0000025385384,0.00039297293,0.00000605014,0.000024873043,1.4808974e-7,0.97474456,0.0026844572,0.020795157,0.00067253155,0.0003712703],"about_ca_topic_score_codex":0.000001909578,"about_ca_topic_score_gemma":0.000009511499,"teacher_disagreement_score":0.56542957,"about_ca_system_score_codex":0.000114159164,"about_ca_system_score_gemma":0.000029078494,"threshold_uncertainty_score":0.9999152},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005592167,0.0020361675,0.9945647,0.00067605445,0.00027442284,0.00041797082,0.0000032749938,0.0003018575,0.0016696438],"genre_scores_gemma":[0.17196774,0.000020464578,0.8257892,0.0019927602,0.000054931992,0.00001037436,0.0000051345105,0.000020867476,0.00013848151],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660265,0.000050060888,0.0004400519,0.001793289,0.0005642313,0.0005497307],"domain_scores_gemma":[0.99734795,0.00029141264,0.00029005873,0.0016584048,0.00023908482,0.00017310758],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009513953,0.0005097817,0.0008221836,0.0016276081,0.00024269489,0.001066384,0.0069646337,0.000387817,0.000043307104],"category_scores_gemma":[0.00008184577,0.0004320325,0.00013322255,0.001365686,0.00075210276,0.0007933404,0.0032085371,0.0007143181,0.00000949375],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014818714,0.00004716009,0.00063411234,0.00009071782,0.00010320235,0.00026618352,0.00094821135,0.0007665831,0.00020120636,0.058289196,0.000017393375,0.9386212],"study_design_scores_gemma":[0.0003175874,0.00019473203,0.0003229617,0.0003410319,0.00012067852,0.000046802594,7.140116e-8,0.38769206,0.0028299203,0.60696757,0.00022213823,0.00094444456],"about_ca_topic_score_codex":0.00021298329,"about_ca_topic_score_gemma":0.0004264854,"teacher_disagreement_score":0.9376768,"about_ca_system_score_codex":0.00014424954,"about_ca_system_score_gemma":0.0005020897,"threshold_uncertainty_score":0.9999706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022585882,0.00015283228,0.9891284,0.0003911097,0.0003885239,0.00022227346,0.000003425177,0.0005351867,0.009155626],"genre_scores_gemma":[0.042219706,0.0000478775,0.9560548,0.0005093382,0.00030012897,0.000008769797,0.000013509595,0.000022708271,0.00082318374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690896,0.000029241657,0.00046710984,0.0013277355,0.0007807262,0.00048622896],"domain_scores_gemma":[0.99761796,0.00019906212,0.0003704739,0.0012887594,0.0003786964,0.00014502837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006464451,0.00042781548,0.00048742237,0.0018452763,0.00034110234,0.0005076998,0.0019215329,0.00030930716,0.00005005815],"category_scores_gemma":[0.00002430478,0.0003761831,0.00012248995,0.0020963775,0.00031374494,0.0007717577,0.00043963813,0.0007776488,0.000027997507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037857706,0.00002430291,0.000020040963,0.0000041308344,0.00007168576,0.000011460767,0.00011860799,0.82797885,0.000014160642,0.010085267,0.000024823888,0.16164285],"study_design_scores_gemma":[0.00014112174,0.00015072635,0.00019384129,0.00007764342,0.00008252555,0.00006531505,7.955753e-8,0.9718671,0.00033896527,0.024792245,0.0017052328,0.0005851931],"about_ca_topic_score_codex":0.00006952896,"about_ca_topic_score_gemma":0.00012224472,"teacher_disagreement_score":0.16105767,"about_ca_system_score_codex":0.00032150748,"about_ca_system_score_gemma":0.0005038067,"threshold_uncertainty_score":0.999869},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009791746,0.0010610797,0.9706432,0.00316781,0.0021678847,0.0005069356,0.000013670893,0.00059033424,0.020869859],"genre_scores_gemma":[0.37740114,0.00028995407,0.55273616,0.063012354,0.00338607,0.000057015004,0.000046626734,0.00029308276,0.002777609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946881,0.000043113174,0.00063422613,0.0021467863,0.0014042375,0.0010835384],"domain_scores_gemma":[0.99616045,0.0003890368,0.00034834907,0.0024553442,0.00031615506,0.00033068485],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005204301,0.0008652914,0.00071775296,0.0011397488,0.00032316486,0.0007256301,0.00669385,0.0004491883,0.00013963778],"category_scores_gemma":[0.000016874592,0.000778286,0.00018690189,0.0015068897,0.00027433975,0.0007823687,0.0026635202,0.0012296574,0.0003894097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001638943,0.00011764643,0.00009427184,0.00043420185,0.00006365001,0.00070902536,0.017365195,0.018936811,0.002260687,0.025035769,0.00009221405,0.9348741],"study_design_scores_gemma":[0.00089350593,0.00030977072,0.00016762655,0.0011845023,0.00003413728,0.0003671567,0.0000024976894,0.9195691,0.0044062026,0.045310866,0.025408113,0.0023465399],"about_ca_topic_score_codex":0.00016258235,"about_ca_topic_score_gemma":0.0008642459,"teacher_disagreement_score":0.9325276,"about_ca_system_score_codex":0.00020824134,"about_ca_system_score_gemma":0.00035060744,"threshold_uncertainty_score":0.99946684},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004427794,0.00010715156,0.99523294,0.00012541715,0.0018260025,0.0003485289,0.0000023658363,0.00029385972,0.0016209424],"genre_scores_gemma":[0.5016539,0.000012607964,0.49771512,0.00025460322,0.00027045546,0.00000795349,0.0000018302443,0.000026552672,0.000056973484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648356,0.00005990635,0.00037558773,0.001550274,0.0009343019,0.00059635256],"domain_scores_gemma":[0.9972537,0.0005250231,0.00027748558,0.0014881627,0.00031083293,0.00014476378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013683814,0.00049792393,0.00046416905,0.00073542085,0.00033742315,0.00053521164,0.0020266748,0.00042549238,0.000005500184],"category_scores_gemma":[0.00009397719,0.0004093651,0.00010951083,0.0006386533,0.00048454266,0.0010809385,0.0005118257,0.0012974889,0.000020760677],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010035918,0.000018344192,0.0001338581,0.000020040068,0.000008397803,0.000043381016,0.00039423018,0.07581707,0.0014929911,0.0015293846,3.7199536e-7,0.92053187],"study_design_scores_gemma":[0.0003425413,0.0002108373,0.0005878175,0.00016401759,0.000006242941,0.00014918532,7.814907e-8,0.79367816,0.01916764,0.18482138,0.00023112497,0.00064094143],"about_ca_topic_score_codex":0.00006182656,"about_ca_topic_score_gemma":0.0009263409,"teacher_disagreement_score":0.91989094,"about_ca_system_score_codex":0.00017213607,"about_ca_system_score_gemma":0.00031001816,"threshold_uncertainty_score":0.99983585},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00585892,0.00013860666,0.98892415,0.00027453149,0.0030605788,0.00044413918,0.0000024973199,0.00019808058,0.0010985186],"genre_scores_gemma":[0.56751835,0.000006431078,0.43053246,0.00035436556,0.00079784606,0.00001655965,0.0000042899137,0.000048335616,0.0007213657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99478245,0.000102153535,0.00085439,0.0020292762,0.0012997045,0.000932028],"domain_scores_gemma":[0.9971128,0.0005290323,0.00040048044,0.0013166645,0.00035707327,0.00028396482],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00161721,0.00067568704,0.0006937617,0.0009942957,0.00036598876,0.0008866861,0.0038889544,0.0008729595,0.000055766403],"category_scores_gemma":[0.00026566922,0.00059382466,0.00014324502,0.000607232,0.00037967923,0.00067584676,0.0011081725,0.0040876046,0.000077895165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008470382,0.00009640419,0.0006893674,0.00003397648,0.00000634324,0.00062640035,0.0059348396,0.008117871,0.0033816204,0.86047924,4.581949e-7,0.12062498],"study_design_scores_gemma":[0.0007062253,0.0013528101,0.002073318,0.0048179366,0.000024020932,0.0004508543,0.000015113035,0.3484551,0.0070463447,0.6218478,0.009027783,0.004182675],"about_ca_topic_score_codex":0.000049797683,"about_ca_topic_score_gemma":0.00030394434,"teacher_disagreement_score":0.56165946,"about_ca_system_score_codex":0.00042778664,"about_ca_system_score_gemma":0.00046817574,"threshold_uncertainty_score":0.9996513},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020410027,0.00022765789,0.9931099,0.00048375592,0.0004545984,0.00032619634,0.0000015154087,0.000112772104,0.003242593],"genre_scores_gemma":[0.9424581,0.00006680917,0.0566804,0.000042685122,0.00019589251,0.000003286459,0.000009493576,0.000016239943,0.0005270796],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988075,0.000011563696,0.00018321816,0.0003790807,0.0004025026,0.00021615266],"domain_scores_gemma":[0.9992056,0.00027443352,0.00015484571,0.00011915985,0.00022224616,0.000023739854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008700219,0.00013112638,0.00017976444,0.00045843498,0.00051578763,0.0002103343,0.0005649801,0.00020736881,0.000017171618],"category_scores_gemma":[0.000585412,0.00013264839,0.000024148514,0.00030919546,0.0008357933,0.00015628336,0.00042367383,0.0003291781,0.0000013567612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004913158,0.000018605228,0.012363291,0.00018057287,0.00002702527,0.0000036008137,0.023829017,0.0024302304,0.0006572586,0.12525296,0.0000072167823,0.8352253],"study_design_scores_gemma":[0.0006429849,0.00015339264,0.0014790447,0.00081926695,0.000084705556,0.0000042092743,0.000118412856,0.077142194,0.006273876,0.9031886,0.0090197,0.001073609],"about_ca_topic_score_codex":0.000011067837,"about_ca_topic_score_gemma":0.00013567507,"teacher_disagreement_score":0.9404171,"about_ca_system_score_codex":0.000044561424,"about_ca_system_score_gemma":0.00016211001,"threshold_uncertainty_score":0.54092443},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005082428,0.0038760814,0.98356676,0.0029368652,0.002286135,0.002413055,0.000041781936,0.000105162675,0.0042659068],"genre_scores_gemma":[0.9274841,0.0036560341,0.054239906,0.0053390246,0.0059547266,0.00021808661,0.00002920625,0.00011307107,0.002965866],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99736357,0.000046703357,0.0003018477,0.00085372064,0.0007768759,0.0006573011],"domain_scores_gemma":[0.99727255,0.0013450523,0.00019786804,0.000773662,0.0002468936,0.00016395967],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002845252,0.00030847374,0.0003290509,0.00027201444,0.0013648765,0.00060733844,0.0018522071,0.00040177343,0.00006454985],"category_scores_gemma":[0.00064999284,0.00024045467,0.000093983836,0.0003182011,0.002229323,0.00049402175,0.0011682068,0.0006323285,0.000014537015],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054783082,0.000051475814,0.00024358147,0.00009925721,0.000027847407,0.0000128635265,0.020835306,0.00041006188,0.000025176054,0.09944549,0.0011565384,0.8776376],"study_design_scores_gemma":[0.00038719358,0.00018127784,0.000065258304,0.00015868447,0.00002521848,0.000011859787,0.000026394957,0.009508999,0.00028472408,0.36799726,0.6208373,0.0005158721],"about_ca_topic_score_codex":0.0013897928,"about_ca_topic_score_gemma":0.007903902,"teacher_disagreement_score":0.92932683,"about_ca_system_score_codex":0.00025447577,"about_ca_system_score_gemma":0.00047915487,"threshold_uncertainty_score":0.9999352},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002383012,0.0003896144,0.9953752,0.00023200782,0.00091305544,0.0002843278,0.000010509079,0.00027420284,0.002282758],"genre_scores_gemma":[0.19549023,0.00041109108,0.80291545,0.00034322575,0.0002214258,0.000013700148,0.000006450806,0.00003920744,0.0005592471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970884,0.00007547565,0.0004973197,0.0009931251,0.0009482991,0.0003973825],"domain_scores_gemma":[0.995304,0.0019419226,0.0008092301,0.0014959548,0.00033214153,0.00011677307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017238416,0.00037210694,0.00045542448,0.0006464733,0.00012679599,0.000357895,0.0033703272,0.0002531151,0.00008434686],"category_scores_gemma":[0.00058716995,0.00034736702,0.00010864151,0.00064661045,0.00031838607,0.000873291,0.0011401202,0.0007709212,0.000033935336],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013988101,0.00040613505,0.007126393,0.00021696965,0.00009286662,0.00018748599,0.0048685186,0.049399216,0.00028906827,0.020451447,0.00041721476,0.91653067],"study_design_scores_gemma":[0.0008615664,0.0019462003,0.046752196,0.002045105,0.00008886785,0.0004831753,0.0000014303695,0.83268666,0.0017062968,0.081008546,0.028504677,0.0039152484],"about_ca_topic_score_codex":0.00013801252,"about_ca_topic_score_gemma":0.00008502523,"teacher_disagreement_score":0.9126154,"about_ca_system_score_codex":0.0001600229,"about_ca_system_score_gemma":0.00021256527,"threshold_uncertainty_score":0.99989784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052601367,0.00026915586,0.989469,0.00044499568,0.0069916104,0.0012255709,0.000013840981,0.0004397698,0.00062006974],"genre_scores_gemma":[0.17437445,0.000030292365,0.82072395,0.0020840627,0.002128228,0.000059195463,0.00004602897,0.00013895336,0.00041486748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927328,0.0000727039,0.00095288805,0.0031220454,0.0014357601,0.0016837841],"domain_scores_gemma":[0.9941251,0.0010255448,0.00055657333,0.0032542387,0.0005196912,0.000518838],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001700932,0.0010420927,0.00090147235,0.0009558998,0.0006827435,0.0010563951,0.0055342284,0.0006778671,0.000019311796],"category_scores_gemma":[0.000072132156,0.0009860075,0.00029371795,0.0005681998,0.0009622618,0.00037427124,0.0013409505,0.0017241825,0.000022705593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001971624,0.00008530533,0.0000049389355,0.000021745544,0.0000110790725,0.00005271539,0.00020697036,0.8788273,0.00018002714,0.006174339,0.000018180799,0.11439772],"study_design_scores_gemma":[0.0005976419,0.00043392697,0.000010656195,0.000261828,0.000015782765,0.00010597848,2.2411288e-7,0.98993707,0.0019153518,0.0035756708,0.0020225623,0.0011232896],"about_ca_topic_score_codex":0.000015788788,"about_ca_topic_score_gemma":0.000109429864,"teacher_disagreement_score":0.17384844,"about_ca_system_score_codex":0.00043266566,"about_ca_system_score_gemma":0.000461251,"threshold_uncertainty_score":0.9999806},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013646045,0.000040058763,0.9965771,0.0002661189,0.00061131234,0.0005879201,0.0000029048917,0.00016730082,0.00038271284],"genre_scores_gemma":[0.40955168,0.000014065948,0.59012336,0.00017560156,0.000102810656,0.000009038398,0.0000054353277,0.000011798449,0.000006194585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997385,0.00002449857,0.000542505,0.0010512767,0.0006555813,0.00034110455],"domain_scores_gemma":[0.99817586,0.000091054026,0.00026701984,0.0008957506,0.00037964474,0.0001906794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004034863,0.00030935675,0.00034372407,0.0008846586,0.00020472349,0.00019204992,0.0011941644,0.00022619634,0.000008715243],"category_scores_gemma":[0.000050300314,0.00032437785,0.000075886615,0.0007418701,0.00052445155,0.00062287424,0.00026377031,0.00038141804,0.000010682135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026302303,0.00001544853,0.00015882002,0.000012865927,0.0000032399728,0.0000037321843,0.00061881624,0.1786065,0.00048431673,0.006610901,4.6469174e-7,0.8134823],"study_design_scores_gemma":[0.0002708174,0.00021978623,0.0004824302,0.00016858736,0.0000053619688,0.00018176263,0.0000012061652,0.9898078,0.0028959047,0.0047878874,0.00067910564,0.00049934065],"about_ca_topic_score_codex":0.000032103937,"about_ca_topic_score_gemma":0.000079412515,"teacher_disagreement_score":0.8129829,"about_ca_system_score_codex":0.00021027491,"about_ca_system_score_gemma":0.00046159365,"threshold_uncertainty_score":0.99992085},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006435049,0.00043455145,0.9912115,0.00060966326,0.0010141658,0.00053797395,0.00028811986,0.00008409402,0.0057556354],"genre_scores_gemma":[0.022678081,0.00007092687,0.9683414,0.0035153402,0.0008489066,0.0000066819607,0.00056121114,0.00006191249,0.0039155087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913861,0.00020312963,0.0011137951,0.0031088758,0.0034549346,0.00073313416],"domain_scores_gemma":[0.993105,0.0012405083,0.00051492266,0.004552375,0.00025643138,0.00033078945],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.010424136,0.00051499996,0.0007136028,0.0018092161,0.0007474361,0.0018909348,0.009543776,0.00018582522,0.00019311834],"category_scores_gemma":[0.0028082223,0.00041360757,0.000091202724,0.0016319042,0.00048040727,0.0018417782,0.014524094,0.001129119,0.00024649725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014841134,0.00008252753,0.00006264113,0.000039264964,0.000019457362,0.000046416702,0.00074841717,0.21848345,0.00018175211,0.005923103,0.0004967313,0.7739014],"study_design_scores_gemma":[0.00022199204,0.00003193005,0.000022504011,0.00035574014,0.00002836923,0.000031227457,0.000004254966,0.8939723,0.000042856118,0.016952284,0.08774236,0.0005942215],"about_ca_topic_score_codex":0.00016632096,"about_ca_topic_score_gemma":0.00036634255,"teacher_disagreement_score":0.7733072,"about_ca_system_score_codex":0.00023173135,"about_ca_system_score_gemma":0.0003869041,"threshold_uncertainty_score":0.99983156},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004644455,0.000517957,0.9821901,0.0052999295,0.0019362981,0.000811846,0.000041688454,0.000029100007,0.0045286277],"genre_scores_gemma":[0.9916497,0.00007130681,0.0064646318,0.0010710149,0.00043415348,0.000023498953,0.00004818425,0.000024403773,0.00021314496],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984576,0.000040482195,0.00020990858,0.0007576262,0.0002932142,0.0002411292],"domain_scores_gemma":[0.9991002,0.00003204173,0.0001328406,0.00058478187,0.00009297798,0.000057147896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023683354,0.00024928094,0.00015557685,0.00023140357,0.00009317172,0.00005496025,0.0005393416,0.00023675029,0.00003298127],"category_scores_gemma":[0.00003409195,0.00018206285,0.00007164677,0.00018043842,0.0003889514,0.0000060097004,0.00009181906,0.00033645565,0.00000765361],"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.00022430361,0.00016380509,0.000097136864,0.000028204095,0.000014957685,0.000016006197,0.00041916088,0.029441476,0.8430747,0.00071633747,0.00057136983,0.12523258],"study_design_scores_gemma":[0.0012268802,0.0006250744,0.0011084311,0.0008360808,0.000011173625,0.000019893381,0.000003754617,0.014831633,0.9664763,0.007899846,0.0061624898,0.0007984132],"about_ca_topic_score_codex":0.000013260589,"about_ca_topic_score_gemma":0.00003898937,"teacher_disagreement_score":0.98700523,"about_ca_system_score_codex":0.00016766305,"about_ca_system_score_gemma":0.00039309415,"threshold_uncertainty_score":0.7424308},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021731865,0.0013784216,0.9952095,0.0006121355,0.0006903231,0.0006039047,0.000011030086,0.0005519229,0.00092100963],"genre_scores_gemma":[0.031971235,0.000016121694,0.9656967,0.00169518,0.00044897507,0.000016417853,0.000012490812,0.000021430922,0.000121460005],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681646,0.00001847571,0.00045712493,0.0013401053,0.00076577434,0.0006020749],"domain_scores_gemma":[0.99823767,0.00022316206,0.00029851325,0.0008256078,0.00028395664,0.00013111104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068737456,0.000515794,0.00047831208,0.0004107152,0.00023906409,0.0005175263,0.0029710932,0.00033053962,0.0000026293285],"category_scores_gemma":[0.00009927134,0.00043845922,0.00014711649,0.0006824419,0.00024577184,0.0011891383,0.0005450046,0.0004973194,0.0000034683742],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064861165,0.000010379521,0.000002686865,0.000024508274,0.000004219133,0.000018153838,0.00064057414,0.015593652,0.00008671468,0.021141713,0.000006987627,0.9624639],"study_design_scores_gemma":[0.00011910843,0.00008049699,0.0000030913066,0.00016246029,0.0000033265273,0.000030117668,7.542481e-8,0.47444758,0.00036562423,0.52443355,0.000058792015,0.0002957641],"about_ca_topic_score_codex":0.000009462591,"about_ca_topic_score_gemma":0.00003508289,"teacher_disagreement_score":0.96216816,"about_ca_system_score_codex":0.00042346065,"about_ca_system_score_gemma":0.00048041673,"threshold_uncertainty_score":0.9998067},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023145867,0.00047921014,0.99117446,0.00097283314,0.00065289903,0.00046548454,0.000010122931,0.00015969892,0.0058538322],"genre_scores_gemma":[0.018123087,0.000065399516,0.9799063,0.00080931623,0.0005112895,0.000016987093,0.000008683598,0.000030188345,0.0005287502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678826,0.000021255339,0.0005200925,0.0014292862,0.0006266103,0.0006144739],"domain_scores_gemma":[0.99787074,0.00037835835,0.00029668218,0.0009322178,0.00028944915,0.00023254075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065204466,0.00043520477,0.0003481912,0.00077810546,0.00092703104,0.00046289366,0.0014596131,0.00032868038,0.00004561379],"category_scores_gemma":[0.000016226144,0.00043850506,0.00009284864,0.00089808676,0.000620681,0.00092663843,0.00096242706,0.0007386722,0.000027105334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014184146,0.0002985008,0.00028743435,0.0002647946,0.0000754433,0.00013375771,0.0024428586,0.14694998,0.0015358365,0.33660755,0.0003085485,0.5110811],"study_design_scores_gemma":[0.00021635462,0.0000845463,0.00073680596,0.00023769194,0.000010268889,0.00042810012,4.56621e-7,0.8440224,0.00024082762,0.14275415,0.010609304,0.0006591249],"about_ca_topic_score_codex":0.000031795633,"about_ca_topic_score_gemma":0.000117408315,"teacher_disagreement_score":0.6970724,"about_ca_system_score_codex":0.00045106548,"about_ca_system_score_gemma":0.00037322674,"threshold_uncertainty_score":0.9998067},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000070766746,0.0002770667,0.99280816,0.001269462,0.00056355994,0.00068092893,0.000006967537,0.000760064,0.0036266902],"genre_scores_gemma":[0.030807113,0.000042296113,0.96476716,0.002692977,0.0004799744,0.00003403348,0.000016602444,0.000048774837,0.0011110787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962441,0.000030823445,0.0006856028,0.0015963252,0.0007505392,0.0006926405],"domain_scores_gemma":[0.99709904,0.00059546944,0.00047900464,0.0011030716,0.0005647297,0.00015866588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012474877,0.00057440094,0.00057564233,0.0007601871,0.00033673004,0.0006353254,0.0031769278,0.00032871665,0.000011329782],"category_scores_gemma":[0.00021059174,0.00053838687,0.00016957115,0.00052036863,0.00028913916,0.00061968836,0.00093087973,0.0006347013,0.000010755532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005987484,0.00003315923,0.000008617177,0.00006553481,0.0000070700257,0.000010974199,0.0008042017,0.4138755,0.000023874201,0.011726892,0.00028048852,0.5731577],"study_design_scores_gemma":[0.0002463145,0.00011135732,0.0000037151067,0.00043702012,0.0000056387553,0.000029848969,1.5014783e-7,0.93064076,0.0014102813,0.06416623,0.0023428788,0.0006058185],"about_ca_topic_score_codex":0.000004471319,"about_ca_topic_score_gemma":0.000024901747,"teacher_disagreement_score":0.5725519,"about_ca_system_score_codex":0.00022374396,"about_ca_system_score_gemma":0.00065443903,"threshold_uncertainty_score":0.99970675},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043090723,0.00003743133,0.9525956,0.0037639411,0.00022696023,0.00010928222,0.0000012470234,0.00007693524,0.000097909804],"genre_scores_gemma":[0.54808056,3.6059123e-7,0.4499209,0.0019229664,0.00006994816,0.0000011233094,5.504156e-7,0.0000022978452,0.0000012603449],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987935,0.000033540746,0.00013492405,0.0003789509,0.00033694034,0.00032215484],"domain_scores_gemma":[0.9989185,0.00049254287,0.000059428654,0.00039384156,0.000060305134,0.000075397744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005370863,0.00012812534,0.00016822599,0.00028357684,0.00012563333,0.0001087877,0.0005019246,0.000084900734,0.00003488096],"category_scores_gemma":[0.0005249854,0.00009435239,0.000047946694,0.0019406488,0.00012200537,0.0001062959,0.000056874884,0.00024390387,0.000010817747],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002287487,0.00079849653,0.007088762,0.000032401465,0.000006085603,0.000127388,0.00020383517,0.026591886,0.012854916,0.030378077,0.0015930703,0.9203022],"study_design_scores_gemma":[0.0007596196,0.0003806786,0.03855396,0.00008662586,0.000008310635,0.000034052715,4.4181124e-7,0.45099276,0.03542212,0.47288847,0.00037931153,0.00049362984],"about_ca_topic_score_codex":0.0000030439312,"about_ca_topic_score_gemma":0.0000026045461,"teacher_disagreement_score":0.91980857,"about_ca_system_score_codex":0.00006208612,"about_ca_system_score_gemma":0.00006935613,"threshold_uncertainty_score":0.3847579},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45174485,0.0000036503548,0.5455924,0.0021171067,0.0003541238,0.00013626591,0.000009750128,0.00002644101,0.00001536043],"genre_scores_gemma":[0.9955902,0.000001568177,0.0036195586,0.00069791183,0.00006899701,0.0000050376207,0.000008643817,0.000007403339,6.915598e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99797714,0.00008132124,0.00040636904,0.0006191789,0.00049108354,0.00042491333],"domain_scores_gemma":[0.9958742,0.0035454598,0.00018978433,0.00024834668,0.00009016024,0.000052040585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001099128,0.00016004717,0.00021964495,0.00046576426,0.00020082245,0.00005452566,0.00040054676,0.00008279825,0.0000075354533],"category_scores_gemma":[0.004417611,0.00015457494,0.000043805783,0.0023303425,0.0005304963,0.00046944752,0.00023849346,0.00032807395,0.0000031146374],"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.00005742625,0.00023811184,0.045055684,0.000018976756,0.0000030917706,0.000022424303,0.0009017203,0.020509979,0.8402834,0.0008935511,0.0000034926684,0.09201215],"study_design_scores_gemma":[0.00032480594,0.00012483659,0.13066538,0.00008851484,0.0000017211414,0.000012194302,0.0000030298713,0.26174256,0.6012871,0.0055379327,0.000015945248,0.00019595688],"about_ca_topic_score_codex":0.0002908223,"about_ca_topic_score_gemma":0.0008470507,"teacher_disagreement_score":0.5438453,"about_ca_system_score_codex":0.00037069063,"about_ca_system_score_gemma":0.00012668,"threshold_uncertainty_score":0.6303383},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016691176,0.0009835134,0.98529536,0.00007470924,0.00075174536,0.00076932757,0.000010838826,0.00015204953,0.011795578],"genre_scores_gemma":[0.43184987,0.000030138139,0.5662483,0.000566205,0.0006362289,0.000022464441,0.000040861836,0.000045905937,0.00056002906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977856,0.000019497249,0.0006603181,0.0006984246,0.00039480958,0.0004413389],"domain_scores_gemma":[0.99651825,0.0019856652,0.0004137368,0.00045085978,0.0005199078,0.00011157449],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008267677,0.00045238237,0.0004988698,0.00057135697,0.000287491,0.00049238495,0.0009228393,0.00028075132,0.0000014547571],"category_scores_gemma":[0.00011013799,0.00042976657,0.000100498786,0.00032799467,0.0004543097,0.00045937626,0.00089814013,0.0004471888,0.0000109689645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008492891,0.00005737283,0.000056579014,0.0002605834,0.00002027785,0.000012237742,0.002560774,0.004854856,0.00000486181,0.016439969,0.00023460783,0.9754894],"study_design_scores_gemma":[0.0004764778,0.00015465124,0.00008921717,0.0010353652,0.000012378165,0.00003756241,9.61391e-7,0.9027502,0.00010814034,0.09418116,0.0006626979,0.0004912205],"about_ca_topic_score_codex":0.0000045824613,"about_ca_topic_score_gemma":0.000018161294,"teacher_disagreement_score":0.9749982,"about_ca_system_score_codex":0.00010753935,"about_ca_system_score_gemma":0.00034786918,"threshold_uncertainty_score":0.9998154},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025683758,0.0004435226,0.991934,0.00044131916,0.0018190996,0.00048713214,0.0000012552488,0.00018152813,0.0044352813],"genre_scores_gemma":[0.4272636,0.00026022806,0.55388355,0.0010781311,0.001477267,0.00004572299,0.000029934266,0.00011994681,0.015841644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544525,0.00014200699,0.0007549011,0.0013282074,0.001474453,0.00085519074],"domain_scores_gemma":[0.9969879,0.0010842014,0.00071303424,0.00073870143,0.00034362578,0.00013255185],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020041952,0.0005445249,0.00064197404,0.0010619472,0.00029783297,0.0010999481,0.0022530556,0.0004499822,0.000014543305],"category_scores_gemma":[0.00057180616,0.0005416687,0.00009651367,0.0006137992,0.00019129233,0.0008459566,0.0010616899,0.0014947031,0.000111959154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018130494,0.00000974845,0.00090129225,0.000021689717,0.000011300184,0.000040116003,0.0016040875,0.9387239,0.000024585865,0.0027328352,0.000016852213,0.055911765],"study_design_scores_gemma":[0.00032313666,0.00013234738,0.00030550768,0.00064351026,0.00000544413,0.00001441284,0.0000014470338,0.99397355,0.00008803369,0.00027294183,0.0036667488,0.0005729069],"about_ca_topic_score_codex":0.000039226295,"about_ca_topic_score_gemma":0.00006016554,"teacher_disagreement_score":0.43805048,"about_ca_system_score_codex":0.001997255,"about_ca_system_score_gemma":0.00048593467,"threshold_uncertainty_score":0.999937},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043980684,0.00039637185,0.98868716,0.00021788433,0.0020573963,0.0009947582,0.000021332586,0.0003930063,0.0028340055],"genre_scores_gemma":[0.94987106,0.00000645602,0.04756102,0.0013790989,0.00086477277,0.000008512189,0.0000081768385,0.000068048605,0.00023285676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941473,0.00012343108,0.0010365174,0.0021951867,0.0013180022,0.0011795479],"domain_scores_gemma":[0.99535847,0.0013120527,0.00079133525,0.0015927164,0.00071370206,0.00023170056],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00111918,0.0009132449,0.0012030747,0.0014662802,0.0005903773,0.0011992817,0.0026512446,0.00046130895,0.000009962034],"category_scores_gemma":[0.00007947258,0.00092694775,0.00030889994,0.0010114523,0.00091144786,0.0009906545,0.002112521,0.0010440039,0.00008350242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007897946,0.000077788165,0.00023536677,0.000111576825,0.000055792112,0.0003011965,0.002618011,0.059447125,0.0023654671,0.0047083804,0.00008150628,0.9299899],"study_design_scores_gemma":[0.00053144974,0.00021116245,0.00032273578,0.0014222501,0.000027711732,0.00094783877,0.0000036602476,0.9733972,0.004977671,0.0152536845,0.0012839594,0.0016206852],"about_ca_topic_score_codex":0.001143469,"about_ca_topic_score_gemma":0.0004897741,"teacher_disagreement_score":0.945473,"about_ca_system_score_codex":0.0008259201,"about_ca_system_score_gemma":0.00074915553,"threshold_uncertainty_score":0.9998376},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087279145,0.00017754383,0.99463034,0.00016238049,0.002086273,0.0006580043,0.000001966929,0.00054795225,0.0008627507],"genre_scores_gemma":[0.14596006,0.000015495922,0.85349005,0.0002801619,0.0001802897,0.000012255614,0.000003841251,0.00003210307,0.000025758232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592406,0.00008065916,0.00077935745,0.0016050187,0.0009326046,0.0006783119],"domain_scores_gemma":[0.9973481,0.00017561267,0.0004851081,0.0015698002,0.00029936054,0.000121990066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018821743,0.0004867499,0.0004685231,0.0014421159,0.0002221314,0.00053485966,0.0031242557,0.0004214627,0.000007350939],"category_scores_gemma":[0.00033921222,0.0005018854,0.0000850575,0.0014087302,0.00048427525,0.0014319165,0.00077189144,0.0008327821,0.000030280673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010386228,0.00006370273,0.00011215963,0.00012886176,0.000007649323,0.0000731507,0.0021435907,0.39002126,0.0050069443,0.120966345,0.0000033812341,0.48146254],"study_design_scores_gemma":[0.00020442625,0.00006733676,0.00035793294,0.00059375854,0.000003881416,0.000041460902,1.8181713e-7,0.9221352,0.008000014,0.06797308,0.000099858225,0.0005229153],"about_ca_topic_score_codex":0.00008430456,"about_ca_topic_score_gemma":0.000025255196,"teacher_disagreement_score":0.5321139,"about_ca_system_score_codex":0.0015975651,"about_ca_system_score_gemma":0.0011024568,"threshold_uncertainty_score":0.9997433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002082353,0.00007159612,0.9961709,0.000521927,0.00015417492,0.0014892488,0.00017426931,0.00005440889,0.0013426706],"genre_scores_gemma":[0.006275825,0.000014132691,0.9924393,0.00037577713,0.0003646715,0.00016608517,0.000067805275,0.000039474173,0.00025689302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845374,0.00001700032,0.00033902004,0.000567578,0.0003497013,0.00027295295],"domain_scores_gemma":[0.9956833,0.003303762,0.00022069798,0.0006349624,0.00011687897,0.00004039541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000583376,0.00026758187,0.0002843372,0.0001789321,0.0003026604,0.00014708065,0.00063021196,0.00013042898,0.0000150150645],"category_scores_gemma":[0.00019666021,0.00018195734,0.00007742999,0.00015754334,0.00032348323,0.00007497029,0.00014849257,0.00038810284,0.0000056802864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043431748,0.00007784394,0.0000038350604,0.00028918902,0.000016453247,0.000008963151,0.00020625314,0.017680537,0.00057546986,0.904827,0.005290844,0.07098016],"study_design_scores_gemma":[0.00031331662,0.00007472433,0.0000025911916,0.00040274108,0.0000333849,0.0000220616,2.520179e-7,0.046223138,0.004603129,0.9430854,0.0049193054,0.0003199798],"about_ca_topic_score_codex":0.000014866004,"about_ca_topic_score_gemma":0.000027197242,"teacher_disagreement_score":0.07066018,"about_ca_system_score_codex":0.00010065328,"about_ca_system_score_gemma":0.00011606523,"threshold_uncertainty_score":0.74200046},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08957832,0.00006591494,0.90794325,0.000045891644,0.00024294881,0.00035944866,0.0000043100104,0.000039360384,0.0017205422],"genre_scores_gemma":[0.9458687,0.0000066998487,0.053783063,0.0001755389,0.00011662506,0.0000058858705,0.0000030547246,0.000015006493,0.000025480986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886614,0.000016715367,0.00027851455,0.0003577451,0.00029445437,0.00018642188],"domain_scores_gemma":[0.9995964,0.000027971484,0.000056267774,0.00021271528,0.00004681765,0.000059806807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000211058,0.00020530185,0.0002052102,0.00034931157,0.000059151294,0.00008652115,0.0002813035,0.00011907408,0.000009969835],"category_scores_gemma":[0.0000065440577,0.00017133623,0.00004277877,0.00018004524,0.00018376524,0.00014655342,0.000117295756,0.00032975062,0.0000032973967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000362666,0.000035880494,0.00075382786,0.00005848624,0.0000043216114,0.0000019074037,0.007742729,0.6561111,0.0051108007,0.0012519667,0.000011576843,0.32891378],"study_design_scores_gemma":[0.00017069794,0.000046361376,0.019994777,0.0003809803,0.000007797393,0.000013831416,0.0000037265684,0.97757787,0.00076228083,0.0007111505,0.00006116813,0.0002693859],"about_ca_topic_score_codex":0.000012778961,"about_ca_topic_score_gemma":0.00008422792,"teacher_disagreement_score":0.85629034,"about_ca_system_score_codex":0.00015774375,"about_ca_system_score_gemma":0.000035041798,"threshold_uncertainty_score":0.69868886},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006887628,0.0003952072,0.9871832,0.0036637823,0.0017120113,0.00047905507,0.000007460589,0.00014117292,0.0057293307],"genre_scores_gemma":[0.88239676,0.00011538374,0.11093023,0.0058981525,0.00033243073,0.000026825186,0.00001471058,0.000048918042,0.00023658031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966752,0.00006420651,0.0004935859,0.001019364,0.001027599,0.00072005833],"domain_scores_gemma":[0.9967991,0.0009509108,0.0002668756,0.0016837764,0.00014621625,0.00015313897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014021316,0.0004479711,0.00033489225,0.00065742555,0.00056709524,0.0005272032,0.0032060207,0.00023902406,0.00018686944],"category_scores_gemma":[0.00007088037,0.00031405018,0.0001699501,0.0008286744,0.0006554359,0.00044236198,0.0010224935,0.0009828976,0.00014221537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021487142,0.00003303033,0.000033508983,0.0000086894315,0.000014103404,0.000020155401,0.0020114046,0.00089413935,0.000018066046,0.6409502,0.00018962016,0.35582492],"study_design_scores_gemma":[0.00025958833,0.00016296239,0.00037264216,0.00017926555,0.000011592707,0.000066271714,5.646704e-7,0.109887406,0.0002290539,0.88248605,0.005692061,0.00065256393],"about_ca_topic_score_codex":0.000021801214,"about_ca_topic_score_gemma":0.000071899194,"teacher_disagreement_score":0.881708,"about_ca_system_score_codex":0.00014927181,"about_ca_system_score_gemma":0.00022926998,"threshold_uncertainty_score":0.99993116},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027198065,0.00020455796,0.9879411,0.00030866681,0.0037576791,0.00079094135,0.00002630677,0.00012187177,0.0065769157],"genre_scores_gemma":[0.5076926,0.000029690154,0.49016637,0.00061292807,0.00110078,0.0000295311,0.000016064538,0.00004743178,0.00030462528],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954767,0.000029130306,0.0009538918,0.0012371765,0.001430636,0.0008724399],"domain_scores_gemma":[0.9962227,0.0010832776,0.00038224345,0.0013059303,0.0008396068,0.00016624908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009789984,0.00052063895,0.0007086178,0.0005100763,0.00018763337,0.00040890847,0.0046612974,0.00044465673,0.000010163443],"category_scores_gemma":[0.00020720174,0.00048840564,0.00024432724,0.0007726073,0.0016301826,0.00062846346,0.0013637595,0.0004841682,0.000023160504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032619966,0.000048537768,0.00028448645,0.000111832065,0.000016614094,0.000020262773,0.00045227446,0.04638849,0.0000865276,0.36195526,0.00022038406,0.59038275],"study_design_scores_gemma":[0.00034159547,0.00061696797,0.00011203867,0.00042901706,0.000010837864,0.000025012292,5.4424225e-7,0.41413456,0.02327868,0.5568805,0.0033926363,0.0007776242],"about_ca_topic_score_codex":0.00018383442,"about_ca_topic_score_gemma":0.00017291415,"teacher_disagreement_score":0.5896051,"about_ca_system_score_codex":0.0005380834,"about_ca_system_score_gemma":0.0019495119,"threshold_uncertainty_score":0.99975675},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037197658,0.00018623461,0.9936897,0.00043222657,0.002248038,0.00028342468,0.000014522017,0.00027407196,0.0024997615],"genre_scores_gemma":[0.40894753,0.000014293786,0.58940214,0.0004733934,0.00060236093,0.000005852623,0.0000064483784,0.000031680152,0.00051634724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648774,0.00006189293,0.0006213803,0.0014065941,0.00086089113,0.0005615131],"domain_scores_gemma":[0.9972596,0.00028125546,0.0003963469,0.001613162,0.0002418343,0.00020781103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001084598,0.0004998263,0.00058139913,0.0006933719,0.0003465501,0.00027225565,0.0019968562,0.00027770962,0.000045745997],"category_scores_gemma":[0.000070496724,0.00046304814,0.00019456964,0.0006537039,0.00046916047,0.00042088315,0.0010943301,0.0011310972,0.000042144315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048493685,0.00013077953,0.00005036082,0.00011719246,0.00003651512,0.0018544176,0.0023060048,0.49593377,0.000043280925,0.027192334,0.000021786003,0.4723087],"study_design_scores_gemma":[0.00041867848,0.00027783195,0.00006619534,0.00027709542,0.0000151114,0.0015325809,2.7127598e-7,0.89238364,0.000501368,0.10278325,0.0010445534,0.00069944066],"about_ca_topic_score_codex":0.0002312394,"about_ca_topic_score_gemma":0.000050414947,"teacher_disagreement_score":0.47160926,"about_ca_system_score_codex":0.00028784026,"about_ca_system_score_gemma":0.00068243267,"threshold_uncertainty_score":0.99978215},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017117705,0.00016203214,0.9744762,0.0007852589,0.0019204655,0.00027243755,0.000005484066,0.0002270578,0.022133911],"genre_scores_gemma":[0.2937025,0.00004619334,0.7015097,0.0019903588,0.0007813765,0.000007968049,0.000023584082,0.000053766646,0.0018845279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997057,0.000024449215,0.0004565996,0.0011850632,0.00079548877,0.00048136915],"domain_scores_gemma":[0.99820155,0.00022430021,0.0002629775,0.0009824985,0.00019679409,0.00013189347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032718357,0.00044620637,0.00039637001,0.00077440246,0.0002337354,0.000633481,0.0017794095,0.0002985729,0.00010369953],"category_scores_gemma":[0.0000407311,0.00041505683,0.00012180977,0.0004341321,0.00037478167,0.00058969576,0.00054209784,0.00061445317,0.000041944255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027264152,0.000009806589,0.00013599315,0.000015003657,0.000007803726,0.000039539973,0.00012580297,0.09925091,0.0000867566,0.13401158,0.00020655496,0.7661075],"study_design_scores_gemma":[0.00048079633,0.00013834564,0.0027467178,0.00019559718,0.000010405729,0.00016664028,1.1872734e-7,0.7107823,0.0008033745,0.27422935,0.009348644,0.0010977414],"about_ca_topic_score_codex":0.000051405812,"about_ca_topic_score_gemma":0.00015898337,"teacher_disagreement_score":0.76500976,"about_ca_system_score_codex":0.00026730952,"about_ca_system_score_gemma":0.0004632393,"threshold_uncertainty_score":0.9998301},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59490234,0.0003192551,0.40410197,0.00045152387,0.000036168265,0.00015744132,0.0000011532123,0.0000103598495,0.000019788611],"genre_scores_gemma":[0.92384493,0.00002963169,0.07596418,0.000047552487,0.000092367016,0.00000961219,0.0000068492795,0.0000041867797,6.717618e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99841666,0.000034924386,0.00034939524,0.0004039247,0.0005330519,0.00026202024],"domain_scores_gemma":[0.99924535,0.00028408357,0.000103299324,0.00017915672,0.00014422176,0.00004387234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065321865,0.00011662365,0.0002917689,0.0009807212,0.000083317726,0.00004083376,0.00013300129,0.00006378636,0.000006426305],"category_scores_gemma":[0.00035189383,0.00010030265,0.000044583772,0.0026974098,0.00035280708,0.00020700508,0.00015759598,0.00017927583,3.118795e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030002268,0.00011120659,0.16706462,0.00003786648,0.000033028173,0.0000063800844,0.0034590801,0.11818022,0.5578269,0.000044146287,0.000001714922,0.15320487],"study_design_scores_gemma":[0.0004763785,0.000044381122,0.4969983,0.00010942092,0.000011627317,0.000003758494,0.000009017353,0.4753773,0.026846504,0.000064357904,0.0000023819277,0.000056595927],"about_ca_topic_score_codex":0.0005353167,"about_ca_topic_score_gemma":0.00069488003,"teacher_disagreement_score":0.53098035,"about_ca_system_score_codex":0.0001762739,"about_ca_system_score_gemma":0.000067800385,"threshold_uncertainty_score":0.40902233},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013972521,0.00043440348,0.99526435,0.00011958013,0.0008728754,0.00017294583,0.000072134884,0.000038935308,0.0016275002],"genre_scores_gemma":[0.99488986,0.000017116381,0.002570296,0.0010637217,0.0008118686,0.0000027353071,0.00004077881,0.000041969666,0.000561681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789226,0.0000025958611,0.00059881824,0.00093478523,0.00014796185,0.00042357607],"domain_scores_gemma":[0.99849486,0.000056658606,0.00042528394,0.0008385795,0.00007417735,0.000110451554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047282997,0.00034657636,0.0005260356,0.00041406738,0.00015278319,0.0002459673,0.0007876865,0.00022505468,0.00019254525],"category_scores_gemma":[0.000011861336,0.00037196584,0.00014729406,0.0002655191,0.00028508995,0.00026240025,0.000087085326,0.00040124325,0.00013509019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027109495,0.000033737968,0.002018314,0.000016320342,0.0000047108597,0.000010306375,0.000031657106,0.9707424,0.0000025260351,0.0141067235,0.00003236575,0.012998236],"study_design_scores_gemma":[0.00018717762,0.00008882626,0.000934917,0.000058590194,0.000003704595,0.00000132791,2.4312289e-8,0.9356854,0.00009326912,0.055350572,0.0071417117,0.0004544789],"about_ca_topic_score_codex":0.000120930745,"about_ca_topic_score_gemma":0.000057951594,"teacher_disagreement_score":0.9934926,"about_ca_system_score_codex":0.0001994941,"about_ca_system_score_gemma":0.000149108,"threshold_uncertainty_score":0.9998732},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016028763,0.000044065804,0.99475133,0.0015544305,0.001182852,0.0006549079,0.0000042367715,0.00043540378,0.001212505],"genre_scores_gemma":[0.11283775,0.0000040315012,0.8837252,0.002809397,0.0003212957,0.00002467051,0.000007883185,0.00007255353,0.00019719794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931122,0.00008708959,0.00061629416,0.002569691,0.002237341,0.0013773903],"domain_scores_gemma":[0.9941137,0.0020078185,0.0002604406,0.00265572,0.0004708926,0.0004914713],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010528447,0.0008777426,0.0008121474,0.0014711373,0.0005455339,0.0010570722,0.0047060815,0.00047100527,0.000045780034],"category_scores_gemma":[0.00039453577,0.00081441656,0.00020832744,0.0008059339,0.0012134674,0.00057003414,0.0024492554,0.0020543102,0.0002466564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019602348,0.000047472655,0.0000446695,0.00007673001,0.000006522412,0.0003030121,0.00007823299,0.61248523,0.00021084378,0.0012984546,0.000011976224,0.38541728],"study_design_scores_gemma":[0.00043308066,0.00034260546,0.0002479205,0.0005968327,0.0000047158424,0.00004912816,3.8674717e-8,0.9581263,0.0037444544,0.035481606,0.00017384492,0.0007994969],"about_ca_topic_score_codex":0.00004348464,"about_ca_topic_score_gemma":0.00008872511,"teacher_disagreement_score":0.38461778,"about_ca_system_score_codex":0.0008054438,"about_ca_system_score_gemma":0.0009778027,"threshold_uncertainty_score":0.9999799},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055157918,0.00018064064,0.99496883,0.001238337,0.0013042253,0.00035639008,0.000013785529,0.00018849512,0.0016941149],"genre_scores_gemma":[0.045141496,0.000014239131,0.95125836,0.002886624,0.00055328244,0.000008698745,0.00001559344,0.000026464146,0.00009524981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621636,0.00003451048,0.0005532851,0.0014217125,0.0010243622,0.00074975274],"domain_scores_gemma":[0.99779713,0.0002785552,0.00025567293,0.0012780413,0.0001843043,0.00020630482],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008362077,0.0005069108,0.0004603742,0.0012359514,0.0004307479,0.0010023774,0.0029592745,0.0002577173,0.000049478764],"category_scores_gemma":[0.00003387845,0.0004976733,0.0001962513,0.00088633277,0.00045171502,0.0006357062,0.0006544052,0.00079436676,0.00001842493],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001993165,0.00002766478,0.000021001802,0.000008025622,0.0000050798285,0.00006809205,0.00031919355,0.0021864555,0.000029768353,0.0048126113,0.000052947573,0.99246716],"study_design_scores_gemma":[0.0006939987,0.00030912555,0.00039887952,0.00021383063,0.000010637447,0.000070787006,2.020576e-7,0.9071699,0.00056396995,0.07510694,0.014461904,0.0009998254],"about_ca_topic_score_codex":0.00004564953,"about_ca_topic_score_gemma":0.00021029147,"teacher_disagreement_score":0.99146736,"about_ca_system_score_codex":0.00024293743,"about_ca_system_score_gemma":0.0007860937,"threshold_uncertainty_score":0.9997475},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005851623,0.000090801695,0.98983544,0.0009946726,0.0006715334,0.0002376044,0.0000018985216,0.00029790736,0.0072849845],"genre_scores_gemma":[0.2555539,0.0000227741,0.7418968,0.00069477403,0.0005059781,0.000011500918,0.000036325007,0.00005214538,0.0012258084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639714,0.000033713397,0.00038138518,0.0015984477,0.0009944594,0.00059485337],"domain_scores_gemma":[0.9975,0.00030910072,0.00027780814,0.0015092664,0.00020940433,0.00019443064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009207889,0.00048780697,0.00042535618,0.00065729214,0.00041357675,0.0007204031,0.003088766,0.0003543851,0.000042830867],"category_scores_gemma":[0.00010791409,0.0003932196,0.0000789639,0.00051252707,0.00062379224,0.0006308921,0.0008570589,0.0022298137,0.00009278903],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016789973,0.000031840107,0.0018891218,0.000045155342,0.000011869206,0.00009419725,0.00080753566,0.010585335,0.000939273,0.019058885,0.000008628867,0.96651137],"study_design_scores_gemma":[0.00067888305,0.0007275611,0.0037615886,0.0004086414,0.000017629365,0.00026396278,3.508573e-7,0.9437873,0.0017373948,0.017829515,0.029371614,0.0014155923],"about_ca_topic_score_codex":0.000032112428,"about_ca_topic_score_gemma":0.000109618864,"teacher_disagreement_score":0.96509576,"about_ca_system_score_codex":0.00010445714,"about_ca_system_score_gemma":0.00053352653,"threshold_uncertainty_score":0.99985194},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25315168,0.0000075048206,0.7464783,0.00017109176,0.00012277362,0.00003122876,0.0000033669883,0.000012102032,0.00002191893],"genre_scores_gemma":[0.7260588,0.000001068719,0.27382755,0.000080375175,0.000028144626,7.918382e-7,3.8684328e-7,0.0000023876835,5.410166e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992974,0.000008362236,0.00016073226,0.00013716082,0.00027073256,0.00012566076],"domain_scores_gemma":[0.9995572,0.00008371456,0.00002395092,0.00023633988,0.00005008673,0.00004872834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027736367,0.000058935464,0.000105838495,0.000064949054,0.000026164382,0.000022630013,0.00032616916,0.000024879017,0.000010874672],"category_scores_gemma":[0.00046740114,0.000040765884,0.000020261796,0.0005062651,0.00028353996,0.000053712745,0.000040293176,0.00016704005,6.6573926e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.9925179e-7,0.000008119058,0.0005179801,0.00001607186,0.0000015252245,2.8338576e-7,0.00012897396,0.5608661,0.39072445,0.000068413676,0.000012451311,0.047655456],"study_design_scores_gemma":[0.000034140143,0.000008390472,0.0057059005,0.0000222962,0.0000037082893,0.0000019653735,1.8167157e-7,0.9271351,0.06578869,0.0012548312,0.0000016113065,0.000043170035],"about_ca_topic_score_codex":0.000024870818,"about_ca_topic_score_gemma":0.000036567268,"teacher_disagreement_score":0.47290707,"about_ca_system_score_codex":0.000009264838,"about_ca_system_score_gemma":0.00003976215,"threshold_uncertainty_score":0.16623844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046306666,0.00011193474,0.9522517,0.000039206523,0.00033774832,0.00070387765,0.00007798107,0.000024198858,0.0001467418],"genre_scores_gemma":[0.830918,0.0000153698,0.16876833,0.00007390664,0.00012912447,0.000020546038,0.00000359075,0.000028144854,0.00004294785],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99805105,0.000017112,0.0006705724,0.000574809,0.00035866545,0.0003278081],"domain_scores_gemma":[0.99869215,0.0001906114,0.00042205857,0.0004005182,0.00024994815,0.000044695138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077064504,0.00028233443,0.0005220397,0.0003553103,0.00005749483,0.000071953444,0.00067301124,0.00026827634,0.00009398832],"category_scores_gemma":[0.00010975913,0.00023983471,0.000085903244,0.00017785786,0.0005418475,0.00015161779,0.0002729898,0.00017176372,0.0000013660909],"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.00008613085,0.000027374877,0.0000074884583,0.00019639428,0.0000022016357,0.0000017110183,0.00020116766,0.010929578,0.95824283,0.0009996529,5.854908e-7,0.029304856],"study_design_scores_gemma":[0.00031506253,0.0003283894,0.00003553083,0.0006214486,0.000008765302,0.000019515113,6.091204e-7,0.059656903,0.9053838,0.032853313,0.0004392302,0.00033740856],"about_ca_topic_score_codex":0.0003239864,"about_ca_topic_score_gemma":0.0018729615,"teacher_disagreement_score":0.78461134,"about_ca_system_score_codex":0.00012148523,"about_ca_system_score_gemma":0.00016915055,"threshold_uncertainty_score":0.97801757},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079814845,0.0012156001,0.9923495,0.0003489752,0.0011065116,0.00066350994,0.000011077296,0.00011018404,0.0033964666],"genre_scores_gemma":[0.9216465,0.000022092854,0.07406998,0.0005602581,0.0017165841,0.00015342538,0.0000070208757,0.00013286839,0.0016912735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982767,0.000008216554,0.00024629175,0.00050975813,0.00044449698,0.00051455223],"domain_scores_gemma":[0.9988157,0.00030607224,0.000070835325,0.00062153745,0.000110887304,0.00007493895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050820375,0.00033340434,0.00033080403,0.00016783897,0.00026847006,0.00033322896,0.0009351882,0.0002292042,0.000013398751],"category_scores_gemma":[0.00002700008,0.00021800333,0.00008181522,0.00018869039,0.00050796405,0.0001503455,0.000084778796,0.00077558006,0.000018708202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019913971,0.000055461638,0.00050504087,0.0014181075,0.000317707,0.00018004458,0.0077971374,0.2633348,0.024905363,0.017843593,0.0005996708,0.6828439],"study_design_scores_gemma":[0.0010023984,0.00023734171,0.00010962512,0.0013006331,0.00003450276,0.000090024725,0.0000016778229,0.83863324,0.0047490792,0.02314895,0.12955141,0.0011411341],"about_ca_topic_score_codex":0.0000042626825,"about_ca_topic_score_gemma":0.00039204085,"teacher_disagreement_score":0.92084837,"about_ca_system_score_codex":0.00013506139,"about_ca_system_score_gemma":0.00023070448,"threshold_uncertainty_score":0.8889918},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012708685,0.00017130487,0.98537374,0.0000942514,0.0006266465,0.00070961984,0.000016918548,0.0002648667,0.000033996057],"genre_scores_gemma":[0.08775624,0.00004351361,0.9111548,0.000798649,0.00012108042,0.000016491014,0.0000520811,0.0000256132,0.000031539097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584913,0.00009877446,0.00076041283,0.0015132949,0.0013114095,0.000466973],"domain_scores_gemma":[0.99757814,0.00041616271,0.0005649729,0.00095601,0.0002154813,0.0002692229],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007969741,0.0005258929,0.00061776926,0.0013413501,0.00032290586,0.00075208326,0.0014350798,0.00021480405,0.00014632096],"category_scores_gemma":[0.00006637911,0.00049906824,0.00013108029,0.00091624545,0.0007195718,0.0010501771,0.00094367843,0.0007439726,0.000013880855],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034581542,0.0000847526,0.00095882674,0.000053696123,0.0001549108,0.00013342453,0.002362181,0.005374897,0.04439284,0.00019011971,0.0000026366308,0.9462883],"study_design_scores_gemma":[0.00037817718,0.000051637646,0.0021157581,0.00014972428,0.00014722602,0.000028469743,0.0000010596935,0.9404683,0.053823914,0.0023167683,0.000008521614,0.00051041483],"about_ca_topic_score_codex":0.0004744539,"about_ca_topic_score_gemma":0.0004475383,"teacher_disagreement_score":0.94577783,"about_ca_system_score_codex":0.0004350515,"about_ca_system_score_gemma":0.0002956957,"threshold_uncertainty_score":0.9997461},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000816759,0.0012630718,0.9832058,0.0035994733,0.0015812368,0.00023405076,0.0000021808996,0.00020536936,0.009092034],"genre_scores_gemma":[0.97529984,0.00013382843,0.005249306,0.0114177,0.0050177346,0.000013335005,0.000047924877,0.00012136916,0.0026989365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683905,0.000002276154,0.00046817778,0.001201393,0.00094463024,0.0005444547],"domain_scores_gemma":[0.99822474,0.000050492203,0.0004213464,0.0006056222,0.0006770899,0.00002073348],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004397257,0.0005307667,0.0005566077,0.0011605677,0.00031120938,0.0024262033,0.001229269,0.0002861495,0.00008406344],"category_scores_gemma":[0.000030555384,0.00046733112,0.00016111245,0.001027077,0.00036830048,0.0025010945,0.00045540294,0.00051175273,0.00014346879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014718743,0.000117175055,0.0011675151,0.0015426343,0.00005372677,0.00010943048,0.00030277437,0.26684844,0.00003115218,0.0048319483,0.0003491872,0.72463125],"study_design_scores_gemma":[0.0002254868,0.0000076889755,0.000044032746,0.0014593651,0.00010185421,0.000007035771,0.0000011540905,0.7942409,0.00009926264,0.19696353,0.005990582,0.000859099],"about_ca_topic_score_codex":0.00014803991,"about_ca_topic_score_gemma":0.00011857218,"teacher_disagreement_score":0.97795653,"about_ca_system_score_codex":0.0000643443,"about_ca_system_score_gemma":0.0001501528,"threshold_uncertainty_score":0.99977785},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55459434,0.000035991456,0.4447127,0.0004095777,0.00007430276,0.00013507692,0.0000011122808,0.0000025386869,0.00003434036],"genre_scores_gemma":[0.98157495,0.00000810815,0.018216414,0.00017905058,0.000017357142,0.0000011536714,0.000001453949,0.0000013979487,8.847007e-8],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989241,0.000076576456,0.0002419544,0.0001308681,0.00053505634,0.000091453025],"domain_scores_gemma":[0.99921596,0.00017958689,0.00017978015,0.00014570529,0.0002539848,0.000024997013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010845432,0.000059019323,0.00015358935,0.00014473454,0.000038591974,0.000005635374,0.00010390508,0.000050828527,0.0000022206173],"category_scores_gemma":[0.00051632075,0.0000359146,0.00003412952,0.0009354761,0.00040246235,0.0001765019,0.00007643298,0.0000999691,7.645367e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007914501,0.000097267344,0.097097754,0.00022207835,0.0000063249104,1.1121422e-7,0.00082940835,0.44280037,0.0020169055,0.0005413042,0.000003864336,0.45630547],"study_design_scores_gemma":[0.00047711303,0.00022165815,0.048238914,0.000017750968,0.000019429572,0.0000089153145,0.0000014921932,0.9164464,0.009431961,0.025103413,0.0000014355159,0.000031526833],"about_ca_topic_score_codex":0.00007069003,"about_ca_topic_score_gemma":0.000016954815,"teacher_disagreement_score":0.47364601,"about_ca_system_score_codex":0.000018677687,"about_ca_system_score_gemma":0.00010071963,"threshold_uncertainty_score":0.14828892},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009998789,0.0008328586,0.9942888,0.00018672094,0.00083635066,0.0004301898,0.000015675163,0.00016556091,0.0022439845],"genre_scores_gemma":[0.6103906,0.00017008539,0.38849914,0.00059130834,0.00019352954,0.000003937973,0.000013482721,0.000049694332,0.000088212844],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99499106,0.000090680005,0.00075904845,0.0015994977,0.001539887,0.0010197966],"domain_scores_gemma":[0.9963577,0.0008776648,0.00046315798,0.0016601292,0.00041983355,0.0002215419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012466275,0.0005577502,0.0007561347,0.0017819782,0.0004446057,0.00016099558,0.0042806896,0.00032744507,0.000013851286],"category_scores_gemma":[0.00007632064,0.0005486065,0.00023818488,0.0013355954,0.0011868653,0.000683107,0.0013221746,0.001090068,0.000027799573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043513846,0.00017304214,0.00048054405,0.00017787487,0.00005160042,0.0003439048,0.0026432252,0.031810936,0.0022567145,0.28394434,0.00008614431,0.6779882],"study_design_scores_gemma":[0.000833044,0.00043173842,0.00065021403,0.000843657,0.000008242468,0.00037926523,2.8349035e-7,0.29333085,0.00840438,0.6930112,0.0009984801,0.0011086331],"about_ca_topic_score_codex":0.000010903751,"about_ca_topic_score_gemma":0.00003060412,"teacher_disagreement_score":0.6768795,"about_ca_system_score_codex":0.00019853759,"about_ca_system_score_gemma":0.00043876786,"threshold_uncertainty_score":0.99969655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013985372,0.00068207696,0.99170876,0.00056814647,0.00063348294,0.00037631614,0.0000032191408,0.0000138527785,0.0046156193],"genre_scores_gemma":[0.9240686,0.000034269593,0.0732246,0.0023763624,0.00014314786,0.0000069108023,4.856117e-7,0.000016349539,0.00012927652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969631,0.00024756131,0.00058361393,0.0006999457,0.001082204,0.00042356877],"domain_scores_gemma":[0.9959436,0.0015921457,0.0003795911,0.0018565115,0.00019022943,0.000037924092],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.002276095,0.00032692414,0.00046512618,0.0002777002,0.0002541159,0.00014332871,0.0064468323,0.00017826151,0.0000054316974],"category_scores_gemma":[0.00010814051,0.00016415311,0.0001669424,0.0008467562,0.0020176147,0.0002581022,0.0011786923,0.0008634988,0.000004041995],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008717321,0.000034575158,0.00040137442,0.000021113026,0.000008282449,0.000018745694,0.01851658,0.010393339,0.0014204277,0.0016928042,0.000050411985,0.96743363],"study_design_scores_gemma":[0.0009742895,0.00046762166,0.009846483,0.0016198034,0.000029583613,0.00035087232,0.00004186902,0.827037,0.078938484,0.07555033,0.0041821366,0.00096157345],"about_ca_topic_score_codex":0.0001272846,"about_ca_topic_score_gemma":0.00012597261,"teacher_disagreement_score":0.966472,"about_ca_system_score_codex":0.00006876133,"about_ca_system_score_gemma":0.00035855058,"threshold_uncertainty_score":0.9989288},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005490446,0.0011480603,0.9963757,0.000044427004,0.0003787421,0.00006426234,0.0000051638463,0.00020276931,0.0012318448],"genre_scores_gemma":[0.49517936,0.00009323636,0.5038203,0.00030832287,0.00046358764,6.997518e-7,0.0000075295366,0.000038678343,0.000088328954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784416,0.000009544939,0.00039000786,0.00071912655,0.00056525273,0.00047188642],"domain_scores_gemma":[0.99883425,0.00012886911,0.00008023957,0.00073676556,0.00010055038,0.00011932703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031578942,0.0004209538,0.00065551605,0.0016206434,0.00013948986,0.00022372931,0.00074589613,0.000373605,0.0000654165],"category_scores_gemma":[0.000032531585,0.00040534153,0.00028728624,0.0015196035,0.00017691965,0.00011762705,0.000115294744,0.0007787899,0.000019250674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.101661e-7,0.0000031861655,0.000030997002,0.0000097803595,0.00008016026,0.000015665608,0.00008901403,0.7403124,0.000034247307,0.00003894826,0.0000010619887,0.25938404],"study_design_scores_gemma":[0.000036761416,0.000013663013,0.000024768004,0.00022838349,0.00026034802,0.0000047686326,5.861565e-8,0.9815429,0.00014785673,0.01722629,0.000072833536,0.00044139792],"about_ca_topic_score_codex":0.000016693633,"about_ca_topic_score_gemma":0.000033981018,"teacher_disagreement_score":0.4946303,"about_ca_system_score_codex":0.00024380429,"about_ca_system_score_gemma":0.00007386303,"threshold_uncertainty_score":0.99983984},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025441227,0.00019514802,0.9607616,0.00034157836,0.0004543731,0.00060192926,0.0000013174985,0.00016881098,0.012034013],"genre_scores_gemma":[0.9903035,0.0000079192705,0.0074437144,0.0010353475,0.0010443819,0.000007501159,0.000010072552,0.000029466744,0.00011806056],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982284,0.0000092734535,0.00028727425,0.0007930352,0.00042826307,0.0002537915],"domain_scores_gemma":[0.99911666,0.000114187584,0.00022276088,0.00040547052,0.0001249904,0.000015956666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004941482,0.0003053163,0.00033056285,0.00072723307,0.00029477902,0.00049961807,0.0004952344,0.00010441977,0.00013565412],"category_scores_gemma":[0.000035069468,0.000286926,0.00005483636,0.00043877464,0.00033997532,0.0009611517,0.00036900057,0.00030295824,0.000049734463],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051692667,0.00008093637,0.0009253255,0.00006228301,0.000028110106,0.00009906686,0.00027184136,0.06602659,0.000028595061,0.025042366,0.0000039370398,0.90737927],"study_design_scores_gemma":[0.0005611233,0.00006746317,0.0008908482,0.00039825932,0.000121035744,0.000020885436,0.000001838929,0.20580867,0.000055830533,0.7892735,0.0019919262,0.00080859725],"about_ca_topic_score_codex":0.00003261889,"about_ca_topic_score_gemma":0.00013242495,"teacher_disagreement_score":0.9648623,"about_ca_system_score_codex":0.00008244723,"about_ca_system_score_gemma":0.00003502932,"threshold_uncertainty_score":0.9999583},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001786872,0.00018750057,0.994605,0.00032043137,0.0012764378,0.00087285653,0.000027516275,0.00045440558,0.0020771718],"genre_scores_gemma":[0.30063233,0.0000036673907,0.69831586,0.00039756444,0.00042708876,0.00005161264,0.00006385384,0.000048449354,0.00005955266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623036,0.00006344689,0.00067486125,0.0017029512,0.00052463653,0.00080375635],"domain_scores_gemma":[0.9972161,0.0010217844,0.00030204834,0.00103516,0.00023662206,0.00018828709],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017112033,0.0005812781,0.00056175055,0.0007936418,0.00070516585,0.0008141233,0.0017025308,0.00038730045,0.000010580546],"category_scores_gemma":[0.00006311638,0.0005679909,0.00017699471,0.000464225,0.00018974941,0.00053218455,0.00029201043,0.0007272824,0.000013718541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020684414,0.000016794671,0.00018894015,0.00026425833,0.000014202511,0.0005229327,0.00041986766,0.10556324,0.00003121206,0.008561164,0.000021182614,0.8843755],"study_design_scores_gemma":[0.00028228926,0.00018821414,0.000008417601,0.0016987796,0.000017159127,0.0008164759,4.2261433e-7,0.9897977,0.00096168224,0.0048764264,0.00065981,0.0006926281],"about_ca_topic_score_codex":0.000023184768,"about_ca_topic_score_gemma":0.00002570719,"teacher_disagreement_score":0.8842344,"about_ca_system_score_codex":0.00052482315,"about_ca_system_score_gemma":0.0006445131,"threshold_uncertainty_score":0.9996772},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009887365,0.00034249714,0.99519145,0.0014691598,0.00054951286,0.00037899739,0.00012789256,0.0001099283,0.00084183074],"genre_scores_gemma":[0.48041946,0.00021229548,0.5129967,0.0046882015,0.0012066808,0.000017113152,0.000117164884,0.00007961813,0.00026279147],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959425,0.00006751229,0.00054283487,0.0019373496,0.00090876,0.0006010783],"domain_scores_gemma":[0.99435294,0.0017833951,0.00032292434,0.0033106992,0.000078349934,0.0001517024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008887953,0.00056773855,0.0005510364,0.00019283891,0.0006383323,0.000524072,0.00439613,0.00021518952,0.000016720725],"category_scores_gemma":[0.00020151399,0.00038437976,0.00005005446,0.00039622336,0.0008717125,0.0007520216,0.003316993,0.0013270795,0.000014449021],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003282868,0.0000043595783,0.00013861882,0.00003414587,0.0000123236,0.000039288512,0.0008594478,0.0011792242,0.00008752127,0.05840478,0.000024594856,0.9392124],"study_design_scores_gemma":[0.00044677846,0.00025659922,0.0009809914,0.0053307223,0.000027658767,0.0002200272,0.0000025345757,0.38913125,0.0017387053,0.58755356,0.012189238,0.002121915],"about_ca_topic_score_codex":0.00007375452,"about_ca_topic_score_gemma":0.00013423455,"teacher_disagreement_score":0.9370905,"about_ca_system_score_codex":0.00009704675,"about_ca_system_score_gemma":0.00023949596,"threshold_uncertainty_score":0.9998608},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00457445,0.000060735732,0.9938212,0.00011753606,0.00024134648,0.0005774112,0.0000066895586,0.000029779394,0.0005708339],"genre_scores_gemma":[0.62797564,0.000012660922,0.37165284,0.00028037705,0.000048629598,0.000005090913,0.0000031385707,0.000010026522,0.000011624328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761635,0.00004967569,0.0005611826,0.0005748062,0.00091460795,0.0002834002],"domain_scores_gemma":[0.9982873,0.00017207272,0.00045241354,0.00083760143,0.00017138303,0.0000792322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006634036,0.000318223,0.00034750113,0.00045618828,0.00024458597,0.0003231075,0.001273451,0.00015971568,0.0000041185544],"category_scores_gemma":[0.000024746374,0.00020256157,0.00006646635,0.00044049742,0.00041865843,0.0009972047,0.0005173273,0.00028385373,0.0000017809664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013654642,0.000012125903,0.00008358884,0.00006278825,0.0000056795016,0.0000011562101,0.0024204685,0.870208,0.00006220723,0.016682222,0.0000010833063,0.110447004],"study_design_scores_gemma":[0.00028248492,0.00004755432,0.00015730814,0.00040201063,0.000008310366,0.00006154428,4.126662e-7,0.9510222,0.00010594204,0.04765092,0.00002066189,0.00024065675],"about_ca_topic_score_codex":0.00006750195,"about_ca_topic_score_gemma":0.000018394436,"teacher_disagreement_score":0.62340117,"about_ca_system_score_codex":0.0001708286,"about_ca_system_score_gemma":0.0003770974,"threshold_uncertainty_score":0.8260221},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061564393,0.0018432724,0.75618523,0.021112278,0.002752893,0.0039054363,0.000051918756,0.00020863395,0.15237592],"genre_scores_gemma":[0.9976995,0.00003609585,0.00076091767,0.000988833,0.00018629745,0.00000429722,0.0000013795417,0.000009494831,0.0003132134],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786407,0.000080943464,0.0002902297,0.00044722302,0.00092001224,0.00039752325],"domain_scores_gemma":[0.9982552,0.00093829393,0.00023489785,0.0003632229,0.00013985789,0.00006856323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012627419,0.00024779318,0.00035769746,0.0003050564,0.00038020656,0.0001423353,0.0011992074,0.0002378098,0.00013170509],"category_scores_gemma":[0.0001983232,0.00015414128,0.0001850478,0.00048015433,0.0017160544,0.0001258306,0.00012333016,0.00047087183,0.000006760395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010372687,0.00016477487,0.0012009954,0.000024721843,0.000019964666,0.000045591496,0.008327414,0.2034223,0.00008428923,0.083771326,0.00019611065,0.7026388],"study_design_scores_gemma":[0.0007863236,0.0006522338,0.01091279,0.00097138545,0.000014494596,0.0000011667969,0.0000075621538,0.06739316,0.000266187,0.91773504,0.00056990306,0.00068975776],"about_ca_topic_score_codex":0.0008427168,"about_ca_topic_score_gemma":0.0011357227,"teacher_disagreement_score":0.93613505,"about_ca_system_score_codex":0.00047256926,"about_ca_system_score_gemma":0.0011149425,"threshold_uncertainty_score":0.6322874},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001179167,0.0003162209,0.9956196,0.00011410123,0.0003928811,0.00030822447,0.0000065414442,0.000030195235,0.0020331019],"genre_scores_gemma":[0.75448734,0.00026647036,0.24477464,0.0003751242,0.000035220364,0.000008126543,0.000003068872,0.000013188299,0.000036836544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783665,0.000020645533,0.000718012,0.00055000326,0.00054955715,0.00032512675],"domain_scores_gemma":[0.998552,0.00012191261,0.00044393874,0.0006887296,0.000106757696,0.00008665246],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043616624,0.00029877687,0.0004609082,0.001149798,0.000046603884,0.00008403055,0.0015369949,0.00015477938,0.000023384382],"category_scores_gemma":[0.000022034736,0.0002604944,0.00009779431,0.0004512109,0.00067372184,0.0005349309,0.0007679442,0.00028356133,0.0000038494836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017432543,0.00013244072,0.006150006,0.00022837665,0.000025897547,0.000020021813,0.010107236,0.0016412144,0.00042109852,0.31316528,0.000011525069,0.6680795],"study_design_scores_gemma":[0.0026900116,0.0010084227,0.01779806,0.0016115041,0.000024196905,0.000055082604,0.0000050427543,0.4938557,0.027079554,0.45179057,0.0024766596,0.0016051701],"about_ca_topic_score_codex":0.00005375391,"about_ca_topic_score_gemma":0.00009458247,"teacher_disagreement_score":0.7533082,"about_ca_system_score_codex":0.000052217212,"about_ca_system_score_gemma":0.000090891466,"threshold_uncertainty_score":0.99998474},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055115036,0.00036618373,0.9976038,0.00018411719,0.00072324014,0.00028541026,0.000048894923,0.000027252938,0.00020998002],"genre_scores_gemma":[0.03411909,0.0003775882,0.9624912,0.0016197319,0.00053458713,0.000014360199,0.0005107094,0.000033754135,0.00029897373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872464,0.000010634439,0.00027879406,0.00044004447,0.00026277234,0.0002831037],"domain_scores_gemma":[0.99918175,0.00008633887,0.00018410548,0.0003424528,0.00013719642,0.00006817388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030246907,0.00023329112,0.00020740344,0.00019777441,0.00014279873,0.000063640095,0.00039789104,0.0005285153,0.0000038696935],"category_scores_gemma":[0.00013541937,0.00021516436,0.00010307447,0.00009034234,0.00046391384,0.000012875132,0.00011621678,0.00026432553,0.000004796284],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028384473,0.000009781937,0.000004218857,0.00001886708,0.000008184568,0.00000403365,0.00004943885,0.0018563761,0.002963625,0.0000044227613,0.00007084394,0.9949818],"study_design_scores_gemma":[0.001194966,0.00093631685,0.00022344735,0.00014422755,0.000023153932,0.000115563824,8.458731e-7,0.7971282,0.02774755,0.0018866981,0.16978845,0.0008105672],"about_ca_topic_score_codex":0.0000031091054,"about_ca_topic_score_gemma":0.000010312681,"teacher_disagreement_score":0.99417126,"about_ca_system_score_codex":0.00011725567,"about_ca_system_score_gemma":0.00042472067,"threshold_uncertainty_score":0.8774148},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002285044,0.000584203,0.9955971,0.00051326625,0.0005612774,0.0018972001,0.000012656451,0.00028810423,0.0005438891],"genre_scores_gemma":[0.002981492,0.0000932652,0.99262977,0.0027080933,0.00072074385,0.00023429563,0.0000072107164,0.0000432068,0.00058194285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646246,0.000029883207,0.0005416507,0.0014611332,0.00076288806,0.00074197346],"domain_scores_gemma":[0.9958724,0.0011098356,0.0004147203,0.001998884,0.0004811194,0.00012307479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001697898,0.00049886975,0.0004404901,0.00023200024,0.0009048409,0.00057465216,0.0041771433,0.00034013417,0.0000037220893],"category_scores_gemma":[0.00018504658,0.00037681096,0.00017949824,0.0005621053,0.00068124215,0.00063631835,0.0013436802,0.0012458785,0.000012130895],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045963898,0.000015481328,0.0000021704996,0.000016602715,0.000005255097,0.0000017145846,0.00017899,0.15786761,0.00035012604,0.016627355,0.00001233402,0.8249178],"study_design_scores_gemma":[0.00013621557,0.00009343869,0.0000028577094,0.00006911084,0.000007605071,0.000010727216,2.2320641e-8,0.65023196,0.000633708,0.34584454,0.0026607236,0.0003090987],"about_ca_topic_score_codex":0.000004463788,"about_ca_topic_score_gemma":0.000029730874,"teacher_disagreement_score":0.8246087,"about_ca_system_score_codex":0.00015456168,"about_ca_system_score_gemma":0.0005710869,"threshold_uncertainty_score":0.9998684},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058831905,0.00023292635,0.98774177,0.00037800643,0.0027700933,0.000252821,0.0000031971852,0.00032513577,0.008237234],"genre_scores_gemma":[0.02339561,0.00001739681,0.97469544,0.0009996662,0.0004594766,0.000006787907,0.000005103628,0.00003707494,0.00038345665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99480796,0.00006607265,0.0008224377,0.0018574358,0.0015319999,0.0009140831],"domain_scores_gemma":[0.99633676,0.00036580535,0.0005345657,0.002197948,0.0003249172,0.00024001657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036523242,0.0006140123,0.00058139727,0.0011884139,0.00034704842,0.00062613137,0.004965726,0.0005162034,0.000024734492],"category_scores_gemma":[0.00025729966,0.0005814588,0.00016156244,0.00103261,0.0007521412,0.0010526619,0.0018265329,0.001353607,0.000098262804],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064520927,0.000023904831,0.00016379898,0.00003528537,0.000007900048,0.000089129346,0.0005016374,0.0025623606,0.00017950125,0.10149857,0.00002631478,0.89490515],"study_design_scores_gemma":[0.0006607979,0.00050433486,0.0011287683,0.0010525119,0.000019379924,0.00047736967,6.667613e-7,0.7374093,0.009817364,0.21555312,0.030747326,0.0026290596],"about_ca_topic_score_codex":0.000037369147,"about_ca_topic_score_gemma":0.00013855149,"teacher_disagreement_score":0.8922761,"about_ca_system_score_codex":0.0006080968,"about_ca_system_score_gemma":0.00052116846,"threshold_uncertainty_score":0.9996637},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015095787,0.00042919078,0.9920435,0.00025301095,0.0013236183,0.0006257635,0.0000062211934,0.0038690353,0.0014345981],"genre_scores_gemma":[0.032712996,0.000016810403,0.9651265,0.0012600641,0.00042382575,0.000046720616,0.0000057834905,0.00005373035,0.00035352592],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99631286,0.000025823798,0.00052489765,0.0016982983,0.00070136786,0.00073677534],"domain_scores_gemma":[0.99616534,0.0010332556,0.00033233923,0.0019359462,0.0003487346,0.00018439785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010206586,0.0005763952,0.0005589116,0.00072476285,0.00031453298,0.0004720266,0.004057873,0.00044399875,0.000013318927],"category_scores_gemma":[0.0004091849,0.0005073948,0.00018163263,0.0003838467,0.00042919817,0.0005155275,0.0011651311,0.0006122916,0.000027953025],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012837471,0.00004374572,0.00007188852,0.00009337509,0.000008163684,0.000062604675,0.00077202043,0.0013795799,0.0002217682,0.014771811,0.0011419707,0.9814202],"study_design_scores_gemma":[0.0002179802,0.00027020037,0.000022142178,0.0008616108,0.000007605082,0.000041006686,1.7123522e-8,0.14196663,0.006610407,0.84428877,0.004972643,0.0007409828],"about_ca_topic_score_codex":0.000022941502,"about_ca_topic_score_gemma":0.0000061858573,"teacher_disagreement_score":0.9806793,"about_ca_system_score_codex":0.00017315289,"about_ca_system_score_gemma":0.0004261639,"threshold_uncertainty_score":0.99973774},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012207552,0.00019350814,0.9847213,0.013582326,0.00018958109,0.00031583584,0.0000041699027,0.00012524566,0.0007459645],"genre_scores_gemma":[0.24897605,0.00007509514,0.7413127,0.0068356288,0.00054988737,0.000024382489,0.000015334228,0.000036416244,0.002174513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973422,0.0000297538,0.0002625191,0.001403035,0.0004966494,0.00046583134],"domain_scores_gemma":[0.9983135,0.00024528103,0.00016685415,0.0008776307,0.0001618627,0.00023490039],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036311513,0.000384443,0.0004631946,0.0009223425,0.00031306272,0.0010236332,0.0013818454,0.00014813297,0.000017088983],"category_scores_gemma":[0.00003299233,0.00033660125,0.0001331282,0.0014409223,0.00023533496,0.00041859143,0.0008474817,0.00063576247,0.000015634503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036440572,0.000019733674,0.00018162702,0.000007492219,0.000041033585,0.000027630736,0.0002635337,0.020975592,0.0003761182,0.003883529,0.00011125933,0.9741088],"study_design_scores_gemma":[0.00016569068,0.00025212954,0.0008145656,0.000056969682,0.00005963274,0.000038903156,1.3506266e-7,0.96413404,0.00037654059,0.02213479,0.011334577,0.00063205895],"about_ca_topic_score_codex":0.000015905895,"about_ca_topic_score_gemma":0.00018505857,"teacher_disagreement_score":0.97347677,"about_ca_system_score_codex":0.0000866222,"about_ca_system_score_gemma":0.00007063672,"threshold_uncertainty_score":0.9999086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013486333,0.00021099094,0.9967629,0.0006107431,0.0002877808,0.00067277154,0.000015100925,0.00040168912,0.0010245432],"genre_scores_gemma":[0.031514283,0.000030621224,0.967309,0.00086155755,0.00008602815,0.00004069056,0.000015718353,0.000022002041,0.0001200799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736804,0.000029971125,0.0005294921,0.001119869,0.00046384087,0.0004887806],"domain_scores_gemma":[0.9977238,0.0005005342,0.0002955378,0.0010152017,0.00031008705,0.00015481615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000719211,0.00043081376,0.0005704854,0.0016227826,0.00035529156,0.00050147745,0.0018340894,0.00038158396,0.000015868325],"category_scores_gemma":[0.00007794676,0.0003989059,0.00021751974,0.0012870729,0.00039649228,0.0004107002,0.0002946348,0.00048753616,0.0000062281474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018762115,0.0000657364,0.00014859508,0.00015091649,0.00012508726,0.000011692059,0.0017694166,0.11474043,0.000012502717,0.23332387,0.000036524463,0.64959645],"study_design_scores_gemma":[0.00013741132,0.00011275758,0.0000639289,0.00016384864,0.000052575746,0.000004261688,5.100177e-8,0.7511235,0.000879422,0.24684404,0.00022119388,0.00039704313],"about_ca_topic_score_codex":0.000016546055,"about_ca_topic_score_gemma":0.000025026276,"teacher_disagreement_score":0.6491994,"about_ca_system_score_codex":0.000103694394,"about_ca_system_score_gemma":0.0003522802,"threshold_uncertainty_score":0.9998463},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016902004,0.0010739785,0.9971263,0.000044748394,0.0008019315,0.00030961973,0.0000074539976,0.00034380605,0.00012316486],"genre_scores_gemma":[0.04279195,0.000011156989,0.95692915,0.000073772135,0.00008750244,0.000008788685,0.000007260637,0.00003399139,0.000056431043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958012,0.00013362811,0.0008050284,0.0015890761,0.0010025281,0.0006685225],"domain_scores_gemma":[0.9942028,0.0032564637,0.00042662397,0.0016302592,0.00034466997,0.00013921941],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035891966,0.0005814342,0.0008214868,0.00065789407,0.00017124882,0.00017182034,0.0036470357,0.0003573646,0.000007183784],"category_scores_gemma":[0.0022390382,0.0005420333,0.00009801218,0.0006859646,0.0007592883,0.0005890092,0.002063167,0.00082219107,0.000007420303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033110148,0.000017375096,0.00034577685,0.000066025576,0.000008239536,0.000008132964,0.00047031234,0.2652762,0.000010773419,0.00032367636,8.6384296e-7,0.7334693],"study_design_scores_gemma":[0.0014400257,0.0005185531,0.087917,0.0037785345,0.000034999743,0.000202408,9.284774e-7,0.60855895,0.03589631,0.25348246,0.0014945806,0.0066752415],"about_ca_topic_score_codex":0.00002103355,"about_ca_topic_score_gemma":0.000188076,"teacher_disagreement_score":0.72679406,"about_ca_system_score_codex":0.0004667375,"about_ca_system_score_gemma":0.001120933,"threshold_uncertainty_score":0.9997031},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1684129,0.0041473727,0.8243128,0.0003284144,0.00086039025,0.00057425577,0.000020847443,0.000008063325,0.0013349366],"genre_scores_gemma":[0.9979371,0.0002881984,0.00082839973,0.00010806311,0.0003019791,0.000020313897,0.000032617016,0.000013615333,0.0004697085],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984158,0.00005684193,0.0004590964,0.00060269394,0.0002673502,0.00019818863],"domain_scores_gemma":[0.99903977,0.000038800274,0.00022323462,0.0006079654,0.00006611574,0.000024093699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043573405,0.00019874841,0.00019373938,0.0002868008,0.000039450657,0.00007840389,0.0008713878,0.00018763973,0.0000064130586],"category_scores_gemma":[0.00003566105,0.00015238351,0.00006375315,0.00021654497,0.00023821733,0.000014497005,0.00020348748,0.00021612685,0.0000022888762],"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.000027494627,0.00007819547,0.00032304184,0.000033938726,0.0000029446699,0.0000031990785,0.00041550244,0.004703046,0.86027616,0.00028939213,0.000019739087,0.13382734],"study_design_scores_gemma":[0.00077155203,0.0001474562,0.0195026,0.00030449784,0.000011246974,0.000010170675,0.0000052716414,0.010862444,0.9590602,0.0048075165,0.0039660605,0.00055101427],"about_ca_topic_score_codex":0.000009509767,"about_ca_topic_score_gemma":0.00024820556,"teacher_disagreement_score":0.8295242,"about_ca_system_score_codex":0.00005406648,"about_ca_system_score_gemma":0.00019470156,"threshold_uncertainty_score":0.6214019},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007286129,0.0010628514,0.98853236,0.00048206944,0.00093782117,0.000573681,0.0000050301155,0.00038280297,0.0072947755],"genre_scores_gemma":[0.3118845,0.00017125618,0.68513864,0.0019694446,0.00049264875,0.000023692435,0.000011418796,0.00005079603,0.0002575948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953814,0.00008775353,0.00044621318,0.0021074237,0.0010097543,0.0009674538],"domain_scores_gemma":[0.99764836,0.00042037538,0.0003403891,0.0011759342,0.00013535403,0.0002796101],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006614949,0.0007577592,0.00071309233,0.00053895894,0.00051950343,0.001763695,0.0028903456,0.0002933152,0.000019314384],"category_scores_gemma":[0.000043780765,0.00060866395,0.0001358521,0.00040947844,0.00061201287,0.0012113211,0.0023444132,0.0013814545,0.000042642634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012609825,0.000091761394,0.0008433907,0.00022462952,0.00006531409,0.0003537572,0.005085546,0.085956335,0.000016570015,0.012311516,0.0004908221,0.89454776],"study_design_scores_gemma":[0.00027265024,0.00021804917,0.00025070962,0.00010144166,0.00001210731,0.00050008675,6.109909e-7,0.97279125,0.000045887722,0.020542892,0.004469543,0.0007947823],"about_ca_topic_score_codex":0.000049984723,"about_ca_topic_score_gemma":0.000007933306,"teacher_disagreement_score":0.893753,"about_ca_system_score_codex":0.00014762377,"about_ca_system_score_gemma":0.00023159363,"threshold_uncertainty_score":0.9996365},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004764813,0.00055014715,0.997272,0.0001255691,0.00071318395,0.0004937623,0.00003080368,0.0002037627,0.00013426578],"genre_scores_gemma":[0.47032335,0.0001432104,0.5281567,0.00057391677,0.00046170448,0.00008104966,0.00002958676,0.0000753137,0.00015514132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961782,0.00002444785,0.0005324239,0.00135117,0.0012204002,0.00069335906],"domain_scores_gemma":[0.9956307,0.001815502,0.00025700004,0.0016880758,0.00041983163,0.00018890883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012557503,0.00043750496,0.0008105091,0.0035419783,0.00013303396,0.00022083762,0.0034577805,0.0002809577,0.000007146016],"category_scores_gemma":[0.00033943332,0.00042879436,0.000331524,0.0022989966,0.00035888184,0.0005967818,0.0005419747,0.0005433183,0.000004424523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000145362965,0.00005594116,0.0017705868,0.00015025953,0.00026363408,0.00005458208,0.0026534568,0.057096153,0.00046287084,0.015982434,0.000032334407,0.9214632],"study_design_scores_gemma":[0.0006830646,0.00081340986,0.009090726,0.0007590649,0.0002047847,0.000013641657,4.963826e-7,0.8868624,0.009300566,0.08658596,0.0038085624,0.0018773378],"about_ca_topic_score_codex":0.000013392849,"about_ca_topic_score_gemma":0.00004617076,"teacher_disagreement_score":0.9195859,"about_ca_system_score_codex":0.00029249542,"about_ca_system_score_gemma":0.0002895839,"threshold_uncertainty_score":0.99981636},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001424965,0.00025140235,0.99615383,0.00039903037,0.002147915,0.0003059938,0.000029402108,0.00020394429,0.0003659923],"genre_scores_gemma":[0.14157455,0.00003767419,0.85566294,0.0018296506,0.0007437986,0.000010343276,0.00006017518,0.00005176042,0.000029134613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964433,0.000037169015,0.00049037527,0.0014491245,0.0010346726,0.0005453864],"domain_scores_gemma":[0.9977345,0.000326965,0.00034126473,0.0011885753,0.0002411506,0.00016754234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047418108,0.00050208054,0.00042923167,0.00081816316,0.00044476698,0.0006390407,0.0020031307,0.00030819472,0.000065652646],"category_scores_gemma":[0.00004260402,0.0004590816,0.00013262,0.00051185046,0.00042894774,0.001199866,0.0008813843,0.0007152634,0.000057113295],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005651841,0.000038589293,0.00003134094,0.000040430972,0.0000066783314,0.00011602018,0.00012861415,0.042802494,0.000065113185,0.00048761387,0.000006149509,0.9562713],"study_design_scores_gemma":[0.00039852466,0.00015005995,0.00009128223,0.0011106444,0.000013203196,0.000092598944,1.0031805e-7,0.8866921,0.00109648,0.10933543,0.00037012823,0.000649429],"about_ca_topic_score_codex":0.000113753755,"about_ca_topic_score_gemma":0.000023777635,"teacher_disagreement_score":0.9556219,"about_ca_system_score_codex":0.0005785117,"about_ca_system_score_gemma":0.0010380972,"threshold_uncertainty_score":0.9997861},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012393348,0.00058930775,0.9929892,0.00088985206,0.001517155,0.0008406376,0.000059773167,0.00032103178,0.002669104],"genre_scores_gemma":[0.6310774,0.00012330517,0.3643072,0.0021911259,0.0014587741,0.000024450686,0.0001482789,0.00009561001,0.00057384605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951118,0.00005441388,0.00078318367,0.0021728275,0.0008300382,0.0010477118],"domain_scores_gemma":[0.9961478,0.0015871424,0.0003857995,0.001381446,0.00020413182,0.00029364973],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010532687,0.00079073425,0.00086244964,0.00058099814,0.00054695964,0.0010744141,0.0029667616,0.00046025906,0.000009037625],"category_scores_gemma":[0.00011271032,0.00073501363,0.00019929084,0.0005735681,0.00051989564,0.00030487604,0.00085558597,0.000816928,0.00003442275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025300451,0.000038766262,0.000021280068,0.000060989492,0.000022339736,0.000046075304,0.00041844806,0.3245483,0.000004157457,0.034448545,0.00022325745,0.6401425],"study_design_scores_gemma":[0.00069556246,0.00025565972,0.00014160415,0.0011259223,0.000011144417,0.00008889702,2.9014515e-7,0.8788444,0.000017887227,0.10276571,0.015101415,0.0009515213],"about_ca_topic_score_codex":0.00001174394,"about_ca_topic_score_gemma":0.000014191173,"teacher_disagreement_score":0.63919103,"about_ca_system_score_codex":0.00022794542,"about_ca_system_score_gemma":0.00031848587,"threshold_uncertainty_score":0.99996257},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010634308,0.00036124967,0.9948836,0.0007466284,0.0009436637,0.0003094604,0.000009611676,0.0006731012,0.0020620755],"genre_scores_gemma":[0.18312488,0.00030633187,0.811999,0.0029266821,0.0011421856,0.000022017415,0.000040536346,0.000089491194,0.0003488189],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606746,0.000028872975,0.0006585056,0.0016134428,0.00096258445,0.0006691582],"domain_scores_gemma":[0.9972686,0.00021182004,0.00032052808,0.0016902715,0.00029752625,0.00021121583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008041253,0.0005715564,0.00052438746,0.0011718229,0.00026811482,0.00085429347,0.0037660121,0.00032598188,0.00002664144],"category_scores_gemma":[0.000046133577,0.0005599086,0.00018288818,0.0009592187,0.00040143583,0.00074841763,0.0022299234,0.00073555287,0.000023159233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018373296,0.00003181292,0.000026729493,0.000023652394,0.00001048466,0.000055126882,0.0003368753,0.003843918,0.000031216056,0.41420957,0.00010685123,0.5813219],"study_design_scores_gemma":[0.0001638765,0.00012217894,0.00007467712,0.00030260553,0.000004662607,0.00006691008,4.5508546e-8,0.7191038,0.0016039591,0.26763356,0.010187033,0.0007366779],"about_ca_topic_score_codex":0.000012862948,"about_ca_topic_score_gemma":0.00003970987,"teacher_disagreement_score":0.7152599,"about_ca_system_score_codex":0.00033086215,"about_ca_system_score_gemma":0.00035532596,"threshold_uncertainty_score":0.9996852},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017060485,0.00015994675,0.9884405,0.0010396348,0.0011112826,0.0006693145,0.000027934773,0.00055055926,0.0079837525],"genre_scores_gemma":[0.049616892,0.00012813024,0.9463703,0.0026879543,0.0005514525,0.000023808481,0.00002638,0.000046825124,0.000548274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950554,0.000040024865,0.00068648346,0.0021192636,0.0013584534,0.0007404094],"domain_scores_gemma":[0.99539447,0.0007909778,0.00041450927,0.002735733,0.0004440642,0.00022022244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009959636,0.00062000524,0.00058875664,0.0011651885,0.00025960663,0.00066479575,0.0048588486,0.00029801458,0.000024850378],"category_scores_gemma":[0.00021160595,0.00058444316,0.00014565037,0.0005380995,0.000774265,0.0011964283,0.0019105693,0.0009477524,0.00023289247],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005260043,0.00001984848,0.000004485404,0.00000538245,0.0000041560534,0.00007798311,0.00011442279,0.0013230533,0.00019321154,0.023414657,0.00027738465,0.97456014],"study_design_scores_gemma":[0.00046514452,0.00021779892,0.00036985954,0.0006698765,0.000010669794,0.0003531674,1.135491e-7,0.6281945,0.03691353,0.29516473,0.036129188,0.0015113855],"about_ca_topic_score_codex":0.0000096736385,"about_ca_topic_score_gemma":0.000053785134,"teacher_disagreement_score":0.97304875,"about_ca_system_score_codex":0.0006945168,"about_ca_system_score_gemma":0.0005730438,"threshold_uncertainty_score":0.9996607},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001919394,0.00065131387,0.9892708,0.00044802108,0.00046577555,0.00043569604,0.000026176755,0.00009574239,0.008587296],"genre_scores_gemma":[0.015583843,0.00016966158,0.9799994,0.00040096615,0.0005609145,0.000073268864,0.00001944496,0.000023536497,0.003168922],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784476,0.000007503062,0.00028738755,0.001149301,0.00028953308,0.00042151735],"domain_scores_gemma":[0.99860746,0.00021658733,0.00012197925,0.00087625236,0.00008858454,0.00008914683],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00040191566,0.0003102724,0.00026225887,0.00037056874,0.0003010033,0.001352897,0.0017047571,0.00012009404,0.0000036884906],"category_scores_gemma":[0.000007745072,0.0002832886,0.00006186405,0.00025050927,0.00039569076,0.0012381279,0.0012283751,0.00022197735,0.000018771056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.6103396e-7,0.000016962556,0.0000015355598,0.000031871765,0.0000055983837,0.0000024012038,0.00026459363,0.000706421,0.000008476332,0.27854154,0.00007459881,0.72034526],"study_design_scores_gemma":[0.0003467977,0.000114672686,0.0001733334,0.00030163093,0.000016544387,0.000029295163,0.000002031107,0.4091111,0.00008980128,0.5465711,0.04254723,0.0006964998],"about_ca_topic_score_codex":0.0000038982457,"about_ca_topic_score_gemma":0.00003177786,"teacher_disagreement_score":0.7196488,"about_ca_system_score_codex":0.00010618386,"about_ca_system_score_gemma":0.00019620272,"threshold_uncertainty_score":0.9999619},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027549908,0.00077622884,0.970603,0.000038542865,0.0003138506,0.0005682418,0.00008457758,0.000006221373,0.00005942076],"genre_scores_gemma":[0.72572106,0.000025805954,0.27382073,0.00008945473,0.00017421896,0.000015951042,0.00011422799,0.000018314753,0.000020262065],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872684,0.000022034337,0.00031882085,0.0005734333,0.0001995209,0.00015932946],"domain_scores_gemma":[0.99932015,0.00006271412,0.00018784091,0.0002608535,0.00012977202,0.000038694438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001510743,0.0001907925,0.00024964122,0.00022011963,0.000058420777,0.000029433626,0.00020676448,0.00028732323,0.000013035693],"category_scores_gemma":[0.000048345613,0.00018819298,0.000050600087,0.00008231571,0.0002058188,0.000008092852,0.00006807884,0.00014526308,2.686582e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005097238,0.000024558896,0.0004617871,0.00011372686,0.00001090803,0.0000033226704,0.0001754558,0.07144173,0.25080723,0.000045707737,0.0000038363096,0.67686075],"study_design_scores_gemma":[0.001061337,0.0011579172,0.0025837305,0.00035738564,0.0000210363,0.000011002145,0.0000014104747,0.3199351,0.64639693,0.027991295,0.00010731877,0.000375494],"about_ca_topic_score_codex":0.000014498957,"about_ca_topic_score_gemma":0.000025814361,"teacher_disagreement_score":0.69817114,"about_ca_system_score_codex":0.000043265092,"about_ca_system_score_gemma":0.00030880678,"threshold_uncertainty_score":0.7674287},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047116895,0.00028934304,0.9930618,0.0008122442,0.0016450731,0.00045820716,0.0000016778998,0.00036376267,0.0028967503],"genre_scores_gemma":[0.57976335,0.00007402676,0.41330415,0.0017536418,0.00067238015,0.000014157494,0.0000023858356,0.00006620644,0.004349682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99469215,0.000094753785,0.00062889926,0.002198553,0.0013081838,0.00107748],"domain_scores_gemma":[0.9967982,0.00051073,0.00045262225,0.0016674872,0.00028796954,0.00028296042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001075793,0.0007581238,0.00069904624,0.00090201886,0.0003542439,0.0009634754,0.0042391405,0.00045848422,0.00005905786],"category_scores_gemma":[0.0002358491,0.0007168041,0.00024229955,0.0006936697,0.0008521054,0.0010964258,0.0017540294,0.0017795563,0.00034912323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006263292,0.000056949495,0.000051273822,0.0000137376555,0.000008097924,0.000111387024,0.0016987734,0.05274341,0.0005014386,0.0020646735,0.000009377315,0.9427346],"study_design_scores_gemma":[0.00014402694,0.000341541,0.00025488815,0.0003528353,0.00000896777,0.000064271815,5.589754e-7,0.95357925,0.008435053,0.028191619,0.0075759212,0.001051092],"about_ca_topic_score_codex":0.00005429111,"about_ca_topic_score_gemma":0.00014824203,"teacher_disagreement_score":0.94168353,"about_ca_system_score_codex":0.00051032874,"about_ca_system_score_gemma":0.00048440654,"threshold_uncertainty_score":0.9995283},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062334176,0.000024406057,0.9339931,0.00025643889,0.0014388504,0.0010043605,0.0000342506,0.000053255022,0.000861179],"genre_scores_gemma":[0.9928424,0.000032213222,0.005803676,0.0006209324,0.00013748783,0.0000144144715,0.000006097853,0.000023410897,0.000519378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981263,0.000019779844,0.0002955143,0.00089153665,0.00034760128,0.00031924478],"domain_scores_gemma":[0.9990209,0.00049163285,0.0001324291,0.00027574666,0.000014109617,0.00006517883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008665946,0.00026957103,0.00024031111,0.00048287073,0.00016943012,0.00012073266,0.00031751647,0.0001671069,0.000027560878],"category_scores_gemma":[0.0001497338,0.00026138406,0.000054688648,0.00012206677,0.00035452287,0.0003474678,0.00014632623,0.0003816612,0.000014203049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020988831,0.00025949065,0.0007176747,0.000067786445,0.000011985487,0.00016157623,0.0034506517,0.3033362,0.2680454,0.015470159,0.000008067611,0.40826115],"study_design_scores_gemma":[0.0033300456,0.0012077736,0.0058014165,0.0009779247,0.00003265583,0.0001956364,0.0000040926275,0.5457747,0.3433489,0.0940837,0.0034589283,0.001784221],"about_ca_topic_score_codex":0.000036905483,"about_ca_topic_score_gemma":0.00015688599,"teacher_disagreement_score":0.9305082,"about_ca_system_score_codex":0.00032212862,"about_ca_system_score_gemma":0.00007938852,"threshold_uncertainty_score":0.99998385},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043195992,0.00044810056,0.9967913,0.0004558778,0.000543842,0.000349667,0.000025033554,0.00026104363,0.0006931474],"genre_scores_gemma":[0.18458241,0.000058638067,0.8133839,0.00073095725,0.00062408583,0.000027549615,0.000022291679,0.000054189382,0.00051600055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580115,0.000025721154,0.00047748158,0.0019017631,0.00096955313,0.0008243455],"domain_scores_gemma":[0.9964927,0.0011032285,0.00036974705,0.0015237022,0.00031665244,0.00019401016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006566354,0.0006060173,0.0006909722,0.000911454,0.00063192146,0.0007174746,0.0034130828,0.0002671527,0.000004364235],"category_scores_gemma":[0.00021719941,0.00048815733,0.00020694241,0.0006934465,0.0005388251,0.00078304025,0.00084879476,0.00067389087,0.000011263877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003101449,0.000052646155,0.000255212,0.00009152678,0.000085763575,0.00023956147,0.0019634697,0.041508935,0.0010890813,0.0016467073,0.0002579701,0.9527781],"study_design_scores_gemma":[0.0010494733,0.00036361368,0.00006600288,0.00086527044,0.000037631336,0.00020566153,0.000001210217,0.97955287,0.0068234196,0.0048270044,0.0048755393,0.0013322898],"about_ca_topic_score_codex":0.000041705236,"about_ca_topic_score_gemma":0.00022361985,"teacher_disagreement_score":0.9514458,"about_ca_system_score_codex":0.00014317902,"about_ca_system_score_gemma":0.0006496131,"threshold_uncertainty_score":0.999757},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060988206,0.00026427858,0.9923948,0.00021390484,0.0028291682,0.00022175343,0.0000018421608,0.00018794532,0.0032763926],"genre_scores_gemma":[0.6058117,0.0000056869253,0.39229396,0.0009265608,0.00066354143,0.0000020554535,0.0000018075393,0.000036931026,0.0002577489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514794,0.00003672873,0.0007242827,0.0018884895,0.0012357488,0.0009667897],"domain_scores_gemma":[0.9976426,0.000280911,0.0004487006,0.0011375839,0.00032127148,0.000168937],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010597331,0.0006675014,0.0007299594,0.0010176003,0.0004441722,0.0011075902,0.004274666,0.00055601186,0.00009615168],"category_scores_gemma":[0.00008219115,0.00060834497,0.00030238443,0.00071253115,0.0005705565,0.0007021815,0.001789491,0.0017771522,0.00007886148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008839683,0.00006518703,0.00005246448,0.000075953,0.00007193588,0.00043067161,0.0028943229,0.27743414,0.0011084926,0.28369305,0.000028612094,0.43413633],"study_design_scores_gemma":[0.00014930482,0.00005705914,0.000010216692,0.00045232463,0.00001959577,0.00013236255,2.1662565e-7,0.98803353,0.0005915962,0.007515829,0.0023171676,0.0007207921],"about_ca_topic_score_codex":0.000020241509,"about_ca_topic_score_gemma":0.00022499527,"teacher_disagreement_score":0.7105994,"about_ca_system_score_codex":0.00031225485,"about_ca_system_score_gemma":0.0005759118,"threshold_uncertainty_score":0.99992937},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037219245,0.00007860524,0.9612908,0.0005698557,0.00040746955,0.0002996309,0.0000021889668,0.00012478221,0.00000746179],"genre_scores_gemma":[0.7383929,0.0000017186766,0.2612147,0.00010876258,0.00026141634,0.0000038475437,0.000009399975,0.0000068027534,4.288268e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991641,0.000006008015,0.00017010712,0.00026276798,0.00015448738,0.00024250985],"domain_scores_gemma":[0.99956864,0.00008034263,0.000022834369,0.00020554771,0.00007391296,0.00004871907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015319196,0.00012718409,0.000112130096,0.00011744218,0.00011254967,0.000110006426,0.0002509035,0.00007949474,0.0000035762573],"category_scores_gemma":[0.000026527872,0.0001138055,0.00006519548,0.00051169924,0.000053844182,0.0001609849,0.000009888991,0.00011677055,0.0000028643872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025843167,0.000012782836,0.000043819855,0.00000543649,0.0000019782256,1.9957656e-7,0.0002845799,0.8474137,0.005425894,0.000052141695,0.000006571241,0.1467503],"study_design_scores_gemma":[0.00026029913,0.00006749345,0.012858755,0.0000141316905,0.0000071793197,0.000006531436,2.9720476e-7,0.97788715,0.0072078374,0.0014805868,0.000064702406,0.00014500333],"about_ca_topic_score_codex":0.0000026858663,"about_ca_topic_score_gemma":0.000015959042,"teacher_disagreement_score":0.70117366,"about_ca_system_score_codex":0.00007954647,"about_ca_system_score_gemma":0.00004027728,"threshold_uncertainty_score":0.46408537},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002846159,0.000090026835,0.9942371,0.0020422405,0.000766398,0.0002726482,0.0000059209337,0.000050613973,0.0022504088],"genre_scores_gemma":[0.15236332,0.000024322742,0.84070915,0.005091024,0.001104653,0.00003144842,0.000019192934,0.000053075528,0.0006038394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977164,0.0000443629,0.000379047,0.0008213316,0.0006734453,0.0003654048],"domain_scores_gemma":[0.9974132,0.0004718773,0.0002478437,0.0016247863,0.00015560605,0.000086693915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086521945,0.00026904762,0.00025816038,0.00019068414,0.00035931356,0.00014074534,0.002510359,0.00018109461,0.000016495642],"category_scores_gemma":[0.00003168421,0.00020333134,0.00008764539,0.00056660944,0.0007434285,0.00022578398,0.00037282947,0.0005111654,0.00001281557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011119238,0.00002487305,0.0000020572213,0.000002719679,0.0000028604506,0.0000031390666,0.00005869592,0.10779331,0.000008753225,0.7805993,0.000053677326,0.11144953],"study_design_scores_gemma":[0.000022406812,0.00006742535,0.000046558405,0.00004544757,0.0000018349007,0.000009299545,7.4216565e-8,0.5017374,0.00008937717,0.49762782,0.00021453366,0.0001378238],"about_ca_topic_score_codex":0.0000062660483,"about_ca_topic_score_gemma":0.00005896629,"teacher_disagreement_score":0.39394408,"about_ca_system_score_codex":0.00017193981,"about_ca_system_score_gemma":0.00028074716,"threshold_uncertainty_score":0.8291611},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005088204,0.00048868207,0.9938641,0.00024703902,0.0004594511,0.00022700489,0.000001007993,0.0004445686,0.0037593134],"genre_scores_gemma":[0.3419439,0.00011227579,0.6576077,0.00011939611,0.00014252473,0.000009267313,0.0000032384328,0.000038426995,0.000023320257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982741,0.0000027863584,0.00031585596,0.00056820264,0.00034961506,0.00048942934],"domain_scores_gemma":[0.99918216,0.00017289793,0.000033660202,0.0005009246,0.000045291592,0.00006506414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017603375,0.00032789411,0.00032886726,0.0004481363,0.000037567566,0.00006688866,0.00073958037,0.00041616344,0.000016474456],"category_scores_gemma":[0.00009858863,0.00031975887,0.00004392382,0.0004174017,0.0005753474,0.000183283,0.00025824655,0.0009888406,0.00003093447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018314893,0.00000598479,0.000018026985,0.000026216538,0.0000025796119,0.000034314067,0.00004021125,0.7623936,0.00014257191,0.026660481,0.0000016377749,0.21067253],"study_design_scores_gemma":[0.00022132172,0.000055479024,0.00012705961,0.00052606873,0.0000029128266,0.000014842473,1.296183e-7,0.652254,0.0011211524,0.34491733,0.0002811315,0.00047858246],"about_ca_topic_score_codex":0.0000021197382,"about_ca_topic_score_gemma":0.000040220908,"teacher_disagreement_score":0.34143507,"about_ca_system_score_codex":0.00058223936,"about_ca_system_score_gemma":0.00009068431,"threshold_uncertainty_score":0.99992543},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0152469305,0.0009895342,0.9793731,0.0005993603,0.0012672192,0.00021235754,0.000004368605,0.00018296784,0.0021241668],"genre_scores_gemma":[0.89494044,0.0001384188,0.095937744,0.002760703,0.0057357512,0.00000864321,0.00005842631,0.000120063116,0.00029982394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968909,0.000008047959,0.00045829223,0.0012280757,0.0008566408,0.00055803335],"domain_scores_gemma":[0.9983662,0.00011599801,0.00048801774,0.0005392266,0.00046480395,0.000025770112],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046115016,0.000537999,0.00055009,0.0017742398,0.00071028614,0.00054442155,0.0009015291,0.00029426298,0.000025684618],"category_scores_gemma":[0.00011831121,0.0004904127,0.0001608239,0.0009993794,0.0005637347,0.0011203582,0.00038322277,0.00055195903,0.000062424886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043701642,0.000049601185,0.00028359465,0.0001391938,0.000027829348,0.000104974744,0.00017082023,0.8072561,0.00015824956,0.0009397163,0.00006181866,0.19076441],"study_design_scores_gemma":[0.00021346941,0.000017604098,0.000109705186,0.0014181655,0.000057893893,0.000012796664,9.878647e-7,0.96918184,0.0000344039,0.027093055,0.0011487248,0.00071137917],"about_ca_topic_score_codex":0.00019759183,"about_ca_topic_score_gemma":0.00005509897,"teacher_disagreement_score":0.88343537,"about_ca_system_score_codex":0.00020315855,"about_ca_system_score_gemma":0.00017256476,"threshold_uncertainty_score":0.9997547},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020160631,0.00019398105,0.99574083,0.0002232836,0.00139676,0.001469377,0.000010259034,0.00018789207,0.0005759874],"genre_scores_gemma":[0.08832205,0.000029219778,0.9077063,0.0019350883,0.0013853812,0.00008873981,0.00009460546,0.000043616994,0.0003949928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569964,0.000052575884,0.00073067524,0.001675058,0.0008822817,0.0009597912],"domain_scores_gemma":[0.9977363,0.00029806272,0.0002689597,0.0011326738,0.00022987141,0.00033412804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014958665,0.00054859894,0.00071436696,0.0011603964,0.00027872584,0.00048847526,0.0029246605,0.00031666923,0.0000037735736],"category_scores_gemma":[0.00014022169,0.00052895147,0.00013381267,0.0007036895,0.0001645774,0.00064136484,0.0006345853,0.00066344073,0.000020830468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008964738,0.000037739803,0.00004151171,0.00001782466,0.0000036290844,0.00003285638,0.000952892,0.12651064,0.00012284603,0.0005625853,0.00001003479,0.8716985],"study_design_scores_gemma":[0.00062389846,0.0010642571,0.0003378287,0.00046448523,0.0000049019523,0.000023150686,0.0000012303068,0.96572,0.0009953453,0.02566901,0.004269005,0.0008268827],"about_ca_topic_score_codex":0.00022474484,"about_ca_topic_score_gemma":0.0007648304,"teacher_disagreement_score":0.8708716,"about_ca_system_score_codex":0.00045853978,"about_ca_system_score_gemma":0.0004520632,"threshold_uncertainty_score":0.9997162},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008818854,0.00014008864,0.99719685,0.0006348676,0.00084986974,0.00055476616,0.00003251163,0.00018968574,0.0003925559],"genre_scores_gemma":[0.008062063,0.000035950867,0.98755825,0.003257213,0.00042784555,0.00001136108,0.00014424027,0.000046612724,0.0004564545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963625,0.000027978956,0.00069291453,0.001498113,0.0008286646,0.0005898179],"domain_scores_gemma":[0.9970821,0.0006036121,0.0004255801,0.0012285516,0.00048689113,0.00017327834],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006497361,0.00047011083,0.000555449,0.00079302,0.0004727423,0.0022886673,0.0023286694,0.00031972927,0.000028804941],"category_scores_gemma":[0.00050259987,0.00046254028,0.00016642951,0.0008418828,0.00057841785,0.0008968658,0.0006912206,0.00035553283,0.00002236961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012117617,0.00009937707,0.00002749718,0.00018349968,0.00003826263,0.000034041044,0.0011812502,0.06916407,0.00015206469,0.1259371,0.00016115444,0.80300957],"study_design_scores_gemma":[0.00049385265,0.00011208832,0.000026083633,0.0007416822,0.000016872329,0.000012196198,9.969127e-8,0.84011215,0.0011873578,0.15450405,0.002217809,0.00057573715],"about_ca_topic_score_codex":0.000008837408,"about_ca_topic_score_gemma":0.000011453755,"teacher_disagreement_score":0.80243385,"about_ca_system_score_codex":0.00032769734,"about_ca_system_score_gemma":0.00081988564,"threshold_uncertainty_score":0.9997826},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002902448,0.00013212973,0.99658257,0.0010980556,0.00036612118,0.0004591643,0.000006342844,0.00014887318,0.0009165288],"genre_scores_gemma":[0.100033574,0.00009188986,0.8991232,0.00024255,0.00019899326,0.000013286739,0.000010950142,0.000029992505,0.00025555879],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968744,0.00006371809,0.0005413806,0.0010341658,0.0011009187,0.00038543792],"domain_scores_gemma":[0.99748063,0.0003455476,0.0002967838,0.00090634974,0.00084396,0.0001267231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014260749,0.00034404846,0.00038181862,0.00080270605,0.0002906761,0.0006479621,0.0014537836,0.00029914296,0.000025270821],"category_scores_gemma":[0.00016888921,0.00031810458,0.00008512738,0.00063794886,0.0013365854,0.0017799756,0.0008900767,0.0008199802,0.00001779208],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066138186,0.000051766834,0.000019413286,0.00007455173,0.000008054318,0.00001240952,0.0011975456,0.00005858848,0.23034848,0.012376491,0.000009214117,0.75583684],"study_design_scores_gemma":[0.00026283492,0.00024764438,0.0003133593,0.00029188226,0.0000150863825,0.000042053252,0.0000011051719,0.28669202,0.6069315,0.10412409,0.00047847794,0.00059994747],"about_ca_topic_score_codex":0.000022613192,"about_ca_topic_score_gemma":0.000020423991,"teacher_disagreement_score":0.7552369,"about_ca_system_score_codex":0.00011124833,"about_ca_system_score_gemma":0.00053156,"threshold_uncertainty_score":0.9999271},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019621626,0.00020557168,0.99447966,0.00038749867,0.003104365,0.0003636207,0.0000026753762,0.00019862074,0.0010617878],"genre_scores_gemma":[0.04745134,0.000023858607,0.9503501,0.0012014372,0.00077983964,0.000003886526,0.000005937757,0.0000430899,0.00014051405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598956,0.000039044542,0.0005706653,0.0016765039,0.0010188675,0.00070535013],"domain_scores_gemma":[0.99749964,0.00044251612,0.00040165914,0.0011847883,0.0002683219,0.00020307822],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006565768,0.0004948272,0.000526308,0.0009896843,0.0006055734,0.0010442864,0.0023774896,0.00024666777,0.000030942127],"category_scores_gemma":[0.00015418605,0.00048009903,0.0001386011,0.0006685259,0.00078687345,0.0013923685,0.0016601251,0.0011508017,0.000041068484],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062430017,0.000024710553,0.00008412694,0.000039834376,0.0000068240165,0.00009161443,0.0007462581,0.009566812,0.02365252,0.0058820257,0.0000036198296,0.95989543],"study_design_scores_gemma":[0.00023816015,0.00007905163,0.000049248694,0.0007870896,0.000005928783,0.00014890065,3.1634994e-7,0.90790206,0.006236528,0.082939275,0.0009824183,0.0006310455],"about_ca_topic_score_codex":0.000021550493,"about_ca_topic_score_gemma":0.000036784433,"teacher_disagreement_score":0.95926434,"about_ca_system_score_codex":0.00024345433,"about_ca_system_score_gemma":0.0004511108,"threshold_uncertainty_score":0.9999927},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028275837,0.00031656222,0.99388236,0.00046322437,0.0010598002,0.00034164308,0.000031697786,0.0002581009,0.0036183612],"genre_scores_gemma":[0.12828219,0.00010012937,0.8704468,0.00047554434,0.00033759957,0.000008801089,0.00014763822,0.00003217415,0.00016910593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609643,0.000041235257,0.0007427422,0.0015233035,0.0010317854,0.00056452345],"domain_scores_gemma":[0.9935108,0.00047161788,0.0007456632,0.0048307804,0.00031403813,0.00012708914],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015411075,0.00041527516,0.00053433474,0.00077495707,0.00013916477,0.0002893063,0.008414654,0.00030012906,0.00003006548],"category_scores_gemma":[0.00024019157,0.00040569258,0.00006129062,0.0006511619,0.00070863566,0.0021694629,0.00357589,0.0005083051,0.00004447047],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034478855,0.000029642004,0.00014107964,0.000046623012,0.000008934023,0.0000048448715,0.00032772534,0.00030257634,0.0012155697,0.043443818,0.00013484531,0.9543409],"study_design_scores_gemma":[0.0004971052,0.00021901545,0.001270183,0.00096147595,0.000028436707,0.00008078309,5.467727e-7,0.85192454,0.01969038,0.09605468,0.02772472,0.0015481212],"about_ca_topic_score_codex":0.000011530906,"about_ca_topic_score_gemma":0.000026943388,"teacher_disagreement_score":0.95279276,"about_ca_system_score_codex":0.0002664575,"about_ca_system_score_gemma":0.000622479,"threshold_uncertainty_score":0.9998395},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014579496,0.000098048986,0.9952267,0.00039576,0.0013906625,0.0010747397,0.00002012221,0.00011901688,0.00021702489],"genre_scores_gemma":[0.11043352,0.00003375955,0.8857859,0.0019590266,0.001107634,0.000044698045,0.000053006403,0.00004803384,0.00053444586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695724,0.000026776397,0.00058135524,0.0015347669,0.00037900085,0.0005208486],"domain_scores_gemma":[0.9982303,0.00016520829,0.00024441723,0.00089174806,0.0001728818,0.00029546453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006749494,0.00043011154,0.00044458586,0.0006684386,0.00025669587,0.00060670107,0.0013175311,0.00022661703,0.00001717186],"category_scores_gemma":[0.00003412289,0.00042137766,0.00008593127,0.00022934562,0.00009850113,0.0010061422,0.00039822797,0.0002516052,0.00002350299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009804144,0.00007499281,0.00016955125,0.00007339803,0.000011779565,0.000012484863,0.0018153398,0.030434651,0.0003895037,0.0038484533,0.000025444757,0.9631346],"study_design_scores_gemma":[0.00064193894,0.0005188378,0.0013143275,0.00020858401,0.000010284827,0.00003500659,4.7614256e-7,0.9732343,0.0006887777,0.0068578506,0.015755786,0.00073382794],"about_ca_topic_score_codex":0.000048849062,"about_ca_topic_score_gemma":0.00027243048,"teacher_disagreement_score":0.9624008,"about_ca_system_score_codex":0.0002723658,"about_ca_system_score_gemma":0.00026070216,"threshold_uncertainty_score":0.9998238},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000075068725,0.002969725,0.9927075,0.002069061,0.00042180004,0.00056570285,0.000003288728,0.00035264215,0.000835213],"genre_scores_gemma":[0.09437999,0.000055763925,0.90174264,0.0027558864,0.00038410674,0.000013270362,0.0000020670223,0.000036613896,0.0006296733],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541825,0.00005291521,0.000509253,0.0015593146,0.0016283817,0.00083188945],"domain_scores_gemma":[0.99714726,0.000551158,0.00026502795,0.0015696381,0.00032256494,0.00014434411],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001447633,0.0005960417,0.0005029414,0.00050382846,0.0004127308,0.00081516284,0.0050955485,0.00025896518,0.000014041682],"category_scores_gemma":[0.0000646632,0.00036515147,0.00010650164,0.0008449607,0.0009433017,0.0005454958,0.00069859944,0.0013945701,0.000010887938],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000117788295,0.000017771223,0.000004716243,0.000028922752,0.000009788577,0.0001395761,0.001457341,0.0010490062,0.0010568631,0.014095419,0.000008728479,0.9821201],"study_design_scores_gemma":[0.00083249976,0.0011690863,0.000082422164,0.0034496232,0.000038603503,0.0006265365,0.000002179674,0.06724438,0.22229321,0.69815147,0.0035753674,0.00253463],"about_ca_topic_score_codex":0.000042403273,"about_ca_topic_score_gemma":0.000406694,"teacher_disagreement_score":0.97958547,"about_ca_system_score_codex":0.00040703107,"about_ca_system_score_gemma":0.0014293811,"threshold_uncertainty_score":0.99988},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027639332,0.00014459924,0.99564075,0.00030018136,0.0008974869,0.0014558992,0.00010571037,0.00061797124,0.0005610019],"genre_scores_gemma":[0.20878473,0.00003472341,0.78964,0.00058205525,0.0004152734,0.000070932125,0.00022693304,0.00005900059,0.00018635728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99459267,0.0000756158,0.00070648297,0.0030518493,0.0008786819,0.0006946958],"domain_scores_gemma":[0.9928198,0.0010668831,0.0005162214,0.00510736,0.000321121,0.0001686072],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014640773,0.00059717934,0.00066035334,0.00065288343,0.00045847252,0.00088410656,0.008369105,0.00030147523,0.00001542154],"category_scores_gemma":[0.00033720565,0.0005785472,0.00007939698,0.00062818587,0.00036640442,0.0013466481,0.0041665933,0.0009725435,0.000023877434],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010142081,0.00011463123,0.00034143665,0.000019269577,0.000028698907,0.0020378316,0.001218469,0.0022633786,0.00009610532,0.0013899959,0.00018780612,0.9922922],"study_design_scores_gemma":[0.00065187353,0.00041223352,0.000084133666,0.00017519311,0.000023262068,0.00094758027,0.0000031412933,0.9391872,0.00029397928,0.0509522,0.006326633,0.00094254577],"about_ca_topic_score_codex":0.00020352768,"about_ca_topic_score_gemma":0.00032221977,"teacher_disagreement_score":0.9913497,"about_ca_system_score_codex":0.0002844726,"about_ca_system_score_gemma":0.0004889936,"threshold_uncertainty_score":0.9996666},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07122118,0.0031714758,0.8932112,0.0007903215,0.0073794634,0.0010835637,0.00003827872,0.00006852143,0.02303598],"genre_scores_gemma":[0.9723782,0.00007596323,0.02596893,0.00024334154,0.0001266368,0.000010256896,0.0000021365795,0.000021469532,0.0011730732],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855715,0.000022557604,0.00027625926,0.0005744029,0.00033224,0.00023739871],"domain_scores_gemma":[0.99774754,0.0011473703,0.00016238258,0.00080062746,0.00008564741,0.00005643479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040923562,0.00022022684,0.0003126653,0.00021493649,0.00014120176,0.000042683223,0.0006414476,0.0002544319,0.000132912],"category_scores_gemma":[0.00011320078,0.00013612272,0.000075593816,0.00013736582,0.0015316285,0.000045579993,0.00022638155,0.00061663124,0.000031084805],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069271555,0.000063498504,0.0014017016,0.0000058346686,0.000026150374,0.00007432976,0.0033714678,0.00009815318,0.00024448108,0.019050814,0.000013385446,0.97558093],"study_design_scores_gemma":[0.0061481837,0.00058592,0.06877977,0.0008273645,0.00024723,0.00045839697,0.0000013239589,0.0016017895,0.0022262407,0.91151214,0.0063949306,0.0012166915],"about_ca_topic_score_codex":0.00005221606,"about_ca_topic_score_gemma":0.00008352243,"teacher_disagreement_score":0.9743642,"about_ca_system_score_codex":0.00002104075,"about_ca_system_score_gemma":0.00006814949,"threshold_uncertainty_score":0.5643349},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031602092,0.00024662426,0.9909965,0.000057077246,0.0019667072,0.0002937465,0.0000035219325,0.00021030109,0.005909544],"genre_scores_gemma":[0.80909586,0.00005040781,0.18944664,0.00014533325,0.00083832856,0.000013129335,0.00003257361,0.00006809098,0.00030961813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985367,0.000019839908,0.00027817927,0.0004505943,0.00046425406,0.00025042958],"domain_scores_gemma":[0.9992757,0.000078997546,0.000073650146,0.00035116952,0.00014297961,0.00007752668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061994785,0.0002746141,0.00018987458,0.0004945716,0.00013058858,0.00015983911,0.00025653548,0.00024349986,0.00020744337],"category_scores_gemma":[0.00002483554,0.00026935313,0.000053487805,0.00021923945,0.00012210353,0.0002664277,0.00009208419,0.0004521216,0.000031939708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013639816,0.0000034049278,0.0000022462962,0.000014151625,0.0000026004516,0.000024368357,0.00034855824,0.7644801,0.00010856585,0.000078253586,0.000022790839,0.23491356],"study_design_scores_gemma":[0.00018310902,0.000030923726,0.0000041721046,0.00033113884,0.000009545901,0.00030419635,3.534238e-7,0.99481493,0.0013784125,0.0014485966,0.0011920183,0.00030262378],"about_ca_topic_score_codex":0.0000066365733,"about_ca_topic_score_gemma":0.00008070159,"teacher_disagreement_score":0.80877984,"about_ca_system_score_codex":0.0004136865,"about_ca_system_score_gemma":0.00007937128,"threshold_uncertainty_score":0.99997586},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012517975,0.00037820218,0.9708107,0.000487004,0.0018144975,0.0003821243,0.0000021599774,0.00016743367,0.024706064],"genre_scores_gemma":[0.7540376,0.000092530296,0.2426852,0.00096810027,0.0005997014,0.000017996823,0.000004633351,0.000056018478,0.0015382327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518895,0.000034388693,0.0008688211,0.001801054,0.001126962,0.0009797945],"domain_scores_gemma":[0.99732316,0.00043099327,0.00030143277,0.0016118672,0.00019424563,0.0001382852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010107262,0.00061128166,0.00060221547,0.0013185771,0.00017743873,0.00051457493,0.0046766987,0.00040738127,0.000039792587],"category_scores_gemma":[0.000071541064,0.0005919712,0.00012202344,0.0010392993,0.00093235483,0.001043314,0.0014186823,0.0010957043,0.0002555046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005787462,0.000040850642,0.0011836545,0.000034883204,0.0000029950013,0.00013820684,0.00055653515,0.10236573,0.00006207395,0.01371141,0.000052885644,0.881845],"study_design_scores_gemma":[0.00011984868,0.00020485732,0.001432307,0.000590006,0.0000033954268,0.000054141907,2.1033065e-7,0.85897315,0.00635271,0.127223,0.0040381695,0.0010082272],"about_ca_topic_score_codex":0.00010532506,"about_ca_topic_score_gemma":0.0004882049,"teacher_disagreement_score":0.8808368,"about_ca_system_score_codex":0.00052868674,"about_ca_system_score_gemma":0.0005491427,"threshold_uncertainty_score":0.99965316},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010617251,0.00069590507,0.9535645,0.0032120051,0.002624349,0.0012207654,0.000012541619,0.00017064926,0.027882012],"genre_scores_gemma":[0.9808368,0.00003438603,0.007524212,0.009024471,0.0008923598,0.000009410132,0.0000056305444,0.000061119026,0.001611614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979656,0.000010535097,0.00042078068,0.00063906924,0.0005657944,0.00039825597],"domain_scores_gemma":[0.99819064,0.00049098145,0.00026342378,0.00075210066,0.00027910687,0.000023724206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006613824,0.00036560968,0.00042172312,0.00071223325,0.0002424955,0.00063851953,0.0012780163,0.00013702756,0.00018916688],"category_scores_gemma":[0.00011784198,0.00027310656,0.00012951024,0.0005465523,0.00029137926,0.0010432043,0.001010404,0.00048228184,0.0001128691],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000352241,0.000037672526,0.006621507,0.00012015044,0.00002197548,0.000024243247,0.0009942896,0.02001895,0.00012405445,0.010328255,0.00097020325,0.9607035],"study_design_scores_gemma":[0.0008613689,0.00004608035,0.005908049,0.0020573183,0.00024068732,0.00002190083,0.0000070672995,0.6905045,0.00021685522,0.02019246,0.27794304,0.002000712],"about_ca_topic_score_codex":0.0005574942,"about_ca_topic_score_gemma":0.0006031823,"teacher_disagreement_score":0.97021955,"about_ca_system_score_codex":0.000057806323,"about_ca_system_score_gemma":0.000042075513,"threshold_uncertainty_score":0.9999721},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016463314,0.00017291914,0.9938387,0.00074047624,0.0034895402,0.0007765289,0.000013339492,0.00024350245,0.00056034565],"genre_scores_gemma":[0.08842174,0.000008119106,0.9055854,0.0047496646,0.00030251272,0.000016408469,0.000015107623,0.00013701683,0.0007639947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99252003,0.00013675429,0.00077035814,0.0027409177,0.0021991928,0.0016327132],"domain_scores_gemma":[0.9955398,0.00088777737,0.00035513667,0.0023976811,0.00041236993,0.00040722804],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010404885,0.0010435502,0.00083953934,0.0018941588,0.0006725676,0.0013023468,0.0048901415,0.00048804493,0.00003492588],"category_scores_gemma":[0.00031261737,0.000977465,0.00025522072,0.0013474099,0.0008974215,0.0010757671,0.0021194182,0.002274675,0.000053714382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023547755,0.00007221013,0.000052813637,0.000072998424,0.000015354215,0.00033205227,0.00033415793,0.87624556,0.00020262212,0.00047324528,0.00001718995,0.12215823],"study_design_scores_gemma":[0.001128615,0.00020428782,0.00009149145,0.00081984705,0.000007111475,0.0000796301,3.3267276e-7,0.9936935,0.00055485894,0.0019558957,0.00039038222,0.001074076],"about_ca_topic_score_codex":0.000041876287,"about_ca_topic_score_gemma":0.000057444275,"teacher_disagreement_score":0.12108415,"about_ca_system_score_codex":0.0015112064,"about_ca_system_score_gemma":0.00076132413,"threshold_uncertainty_score":0.9997344},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006753792,0.0005104449,0.9905525,0.000039255767,0.001013856,0.0007047322,0.000019695031,0.00012349602,0.00028227002],"genre_scores_gemma":[0.18391018,0.00016446559,0.81539774,0.0000919195,0.0002498915,0.00003769275,0.000023420951,0.00007613476,0.00004853752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860924,0.000004219448,0.00030343444,0.0005664984,0.00020049831,0.0003160769],"domain_scores_gemma":[0.99951905,0.00005502352,0.000030858668,0.00025296968,0.0000766331,0.000065464774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021357919,0.0003136579,0.0002907292,0.00045402083,0.00016370008,0.00011897882,0.00017570214,0.0002325023,0.0000133180865],"category_scores_gemma":[0.000009339172,0.00031177636,0.000058091722,0.000099322475,0.0000949726,0.0001669666,0.000056543486,0.0003331321,0.0000015329801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016172946,0.000014559718,0.0000106834905,0.00026118188,0.000016272013,0.0000042192482,0.00021075108,0.86397827,0.007728287,0.000357213,0.000001448272,0.12740092],"study_design_scores_gemma":[0.00058818475,0.00010466019,0.000022968077,0.000530609,0.000014768862,0.000018554545,1.7905928e-7,0.9921883,0.0004244327,0.005534098,0.00022770364,0.0003455846],"about_ca_topic_score_codex":0.00008357784,"about_ca_topic_score_gemma":0.0008416589,"teacher_disagreement_score":0.17715639,"about_ca_system_score_codex":0.0006471351,"about_ca_system_score_gemma":0.0001176241,"threshold_uncertainty_score":0.9999334},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055509247,0.00014725522,0.9961138,0.0005414575,0.0008934041,0.00056199945,0.0000013273296,0.000058119014,0.0011275938],"genre_scores_gemma":[0.8751297,0.00004673449,0.12280285,0.0010239516,0.000470142,0.000019304636,0.0000035140977,0.00002778184,0.00047600592],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784327,0.00006906028,0.00036207668,0.0008158239,0.00056924665,0.00034053207],"domain_scores_gemma":[0.9980468,0.00041142074,0.00023837795,0.0010006899,0.0001962998,0.000106424115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021733425,0.00025677338,0.0003150507,0.00029836633,0.0002054376,0.00025405572,0.0015384414,0.00016790246,0.00001792646],"category_scores_gemma":[0.000060283815,0.00016631269,0.000063890526,0.00031555415,0.0003975066,0.0002018495,0.0009987387,0.00032888472,0.000028803426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047970557,0.0000076107012,0.00002485443,0.000018381448,0.000005890308,0.000009976845,0.0022045088,0.00013679016,0.0027400726,0.28316787,0.000012873255,0.71166635],"study_design_scores_gemma":[0.0005423131,0.0008595235,0.001821462,0.00012529294,0.000029630339,0.00021273218,0.0000048964175,0.039197356,0.013447884,0.9331789,0.009586762,0.0009932475],"about_ca_topic_score_codex":0.00012523333,"about_ca_topic_score_gemma":0.00021154578,"teacher_disagreement_score":0.8745746,"about_ca_system_score_codex":0.000048153313,"about_ca_system_score_gemma":0.00019473342,"threshold_uncertainty_score":0.67820346},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012463747,0.00019513139,0.99571466,0.0009917092,0.0003088711,0.0010362199,0.0000072802136,0.0001281474,0.0016055072],"genre_scores_gemma":[0.011971787,0.00005191248,0.98350316,0.0019900436,0.000135705,0.000028774612,0.000010147373,0.000030377209,0.002278064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653804,0.000033245484,0.00059030496,0.0013506856,0.00071360567,0.0007741352],"domain_scores_gemma":[0.9981218,0.00036067376,0.00020872662,0.00086697453,0.00026770137,0.00017411886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012430201,0.0004265612,0.0005564381,0.0009051024,0.00016514603,0.000494252,0.002382235,0.00028148582,0.000014750915],"category_scores_gemma":[0.00010201666,0.000403898,0.00014626673,0.00041526766,0.0002128945,0.00047810533,0.0005603106,0.00056385394,0.00002418255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006652062,0.000025577681,0.0000046591244,0.000013298042,0.0000025237619,0.000015749038,0.00045742682,0.55780977,0.00004059427,0.0017212126,0.000019068446,0.43988347],"study_design_scores_gemma":[0.0005838983,0.00013339748,0.00000770509,0.00021433124,0.0000025205466,0.000008848671,4.89494e-8,0.9419571,0.00007193031,0.056223053,0.00037203322,0.00042512166],"about_ca_topic_score_codex":0.00000824734,"about_ca_topic_score_gemma":0.00004484425,"teacher_disagreement_score":0.43945834,"about_ca_system_score_codex":0.0002746109,"about_ca_system_score_gemma":0.000515069,"threshold_uncertainty_score":0.9998413},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023222917,0.00046078893,0.9917626,0.002134086,0.0022166432,0.00065994676,0.00021618813,0.00080573844,0.0017416823],"genre_scores_gemma":[0.0012786346,0.00006695286,0.9974516,0.00056089676,0.00036961594,0.000021014912,0.00009301787,0.00006315428,0.000095111616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935042,0.000034742145,0.000658951,0.0035406544,0.0010367889,0.0012246659],"domain_scores_gemma":[0.97703665,0.0010708218,0.00045368078,0.021001395,0.0002464251,0.00019105196],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016720523,0.0007768274,0.0007584721,0.00093751313,0.000412666,0.00076947286,0.09989779,0.00060148817,0.000018664277],"category_scores_gemma":[0.0044517363,0.00073960953,0.00013119906,0.0007677225,0.0009799193,0.0020163662,0.17894816,0.0012168739,0.00003679336],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019761671,0.000031704607,0.000011776667,0.000028022947,0.000017223132,0.000056104895,0.00007137417,0.00012348028,0.000019885096,0.0025263547,0.0012357346,0.9958764],"study_design_scores_gemma":[0.00018192895,0.00009717457,0.000015680596,0.00027223557,0.000009493361,0.00006109703,1.6667306e-7,0.6946777,0.000514236,0.2997865,0.0037626773,0.00062110584],"about_ca_topic_score_codex":0.00005154262,"about_ca_topic_score_gemma":0.000022259992,"teacher_disagreement_score":0.99525523,"about_ca_system_score_codex":0.000327505,"about_ca_system_score_gemma":0.000625239,"threshold_uncertainty_score":0.9995055},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028579794,0.00007266906,0.9932037,0.00041440647,0.0012008073,0.00042170173,0.0000028414588,0.0001017193,0.0017241848],"genre_scores_gemma":[0.8236618,0.000020645419,0.17539592,0.00068584515,0.00016110158,0.000008492774,0.0000011266658,0.000020752808,0.000044291006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997075,0.00011365967,0.000487367,0.0009949576,0.0009325573,0.00039641676],"domain_scores_gemma":[0.9970672,0.00034964818,0.000316679,0.0018617205,0.00025993027,0.00014483143],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007986103,0.0003510823,0.00038811378,0.00060324837,0.00033270093,0.00018906483,0.004317756,0.0001824449,0.000005771866],"category_scores_gemma":[0.0000464224,0.00026846907,0.00015836876,0.0012444824,0.00050998904,0.0004568929,0.0006364304,0.00040629177,0.000010583149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026297335,0.00007562255,0.00021499023,0.0000853466,0.000021592425,0.00002618777,0.014801549,0.20424739,0.00075675035,0.21946052,0.000042172942,0.5602416],"study_design_scores_gemma":[0.00040497177,0.00096957805,0.00092017476,0.0010710451,0.000021724265,0.000113618364,0.00000570561,0.7776653,0.0020872352,0.21391214,0.0016664981,0.0011620182],"about_ca_topic_score_codex":0.00013648947,"about_ca_topic_score_gemma":0.00044393446,"teacher_disagreement_score":0.8208038,"about_ca_system_score_codex":0.00011157769,"about_ca_system_score_gemma":0.00048549834,"threshold_uncertainty_score":0.99997675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001040663,0.00035693098,0.9967932,0.00042442864,0.00038508518,0.0010513475,0.0000054526186,0.00034816816,0.00053130597],"genre_scores_gemma":[0.022755,0.00006128382,0.97523785,0.0008915497,0.00074350403,0.00005232,0.000020257707,0.000046676992,0.00019158529],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966415,0.000025111767,0.0006030966,0.0014317789,0.0005801127,0.0007184021],"domain_scores_gemma":[0.9981819,0.00032619573,0.0003055535,0.00082542514,0.0002488718,0.00011208879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009797859,0.00049334386,0.0005084131,0.00090743124,0.00027016175,0.0004108964,0.0020612318,0.00038146824,0.000005620021],"category_scores_gemma":[0.00010696123,0.0004752734,0.00014446297,0.0005802458,0.0002750913,0.0011687118,0.0006982988,0.000985422,0.000008480952],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054463235,0.000031514235,0.00001116953,0.00004997785,0.0000032335624,0.00003622365,0.0003559133,0.0011183049,0.0005670209,0.0031723073,0.0000062801478,0.9946426],"study_design_scores_gemma":[0.0007133317,0.0006896172,0.00008047881,0.0018801974,0.000012915003,0.00009117495,5.151448e-7,0.098992966,0.027598832,0.8548649,0.013520744,0.0015543175],"about_ca_topic_score_codex":0.000017004948,"about_ca_topic_score_gemma":0.00008103671,"teacher_disagreement_score":0.9930883,"about_ca_system_score_codex":0.00034648261,"about_ca_system_score_gemma":0.00019795362,"threshold_uncertainty_score":0.99976987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001200908,0.0004561446,0.9941858,0.00023622398,0.0005311327,0.00073085487,0.000010325573,0.00022007707,0.0036174117],"genre_scores_gemma":[0.04417531,0.00024909675,0.9516403,0.0006995398,0.0015076185,0.00009715959,0.00008773236,0.00018670791,0.0013565301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987015,0.0000064868364,0.00027920227,0.00038846987,0.00030224855,0.00032205024],"domain_scores_gemma":[0.9991432,0.00025633868,0.0000864638,0.00035587043,0.00010958057,0.000048592006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029671163,0.0002821973,0.0002310697,0.0002324033,0.00023113505,0.00018226643,0.0005144439,0.00020582901,0.000033138647],"category_scores_gemma":[0.000027992515,0.00022269224,0.00008519211,0.0002045483,0.00020154208,0.00015545814,0.000087691966,0.00035592986,0.000026007006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032861765,0.0000037228212,0.0000057347347,0.000080389626,0.000011114011,0.0000013300044,0.00071540615,0.86501527,0.00009777507,0.00011804745,0.0007481732,0.13319977],"study_design_scores_gemma":[0.00018388967,0.000027850812,0.0000060660705,0.00019383251,0.0000064196242,0.000017669532,8.5144755e-8,0.9830505,0.00035823975,0.00087215274,0.014994669,0.0002886147],"about_ca_topic_score_codex":0.0000025727954,"about_ca_topic_score_gemma":0.000008160205,"teacher_disagreement_score":0.13291115,"about_ca_system_score_codex":0.00013840351,"about_ca_system_score_gemma":0.00009273361,"threshold_uncertainty_score":0.9081126},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000178018,0.000092012815,0.9965959,0.0008700702,0.00060219096,0.00035697882,0.000009471612,0.00005326103,0.001402286],"genre_scores_gemma":[0.5541358,0.000039220966,0.4348547,0.009246251,0.0010140135,0.000046778383,0.00015895166,0.000045206103,0.00045907215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780864,0.0000130774115,0.00047108592,0.0005644118,0.0007554816,0.00038732943],"domain_scores_gemma":[0.9988577,0.00009762841,0.00035622666,0.00050014217,0.00011048219,0.000077829434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047692543,0.00032915044,0.00034977696,0.0005620628,0.00037616782,0.0006331723,0.0016889503,0.0003097502,0.0000135773125],"category_scores_gemma":[0.00003701598,0.0003002083,0.0001595019,0.00033572968,0.00021445408,0.0016102425,0.0004478352,0.00029788655,0.000032429194],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048748366,0.000023011225,0.00006384689,0.00006103534,0.000026725262,0.000004322483,0.0030228314,0.06718644,0.000052678755,0.117746584,0.00005136921,0.81175625],"study_design_scores_gemma":[0.00093309156,0.00017962804,0.0010362405,0.00024880387,0.000048393696,0.000010256331,0.0000013432237,0.5252039,0.00064435764,0.43928358,0.031114599,0.0012958598],"about_ca_topic_score_codex":0.000016874665,"about_ca_topic_score_gemma":0.000065293585,"teacher_disagreement_score":0.81046045,"about_ca_system_score_codex":0.0003678802,"about_ca_system_score_gemma":0.00032702173,"threshold_uncertainty_score":0.999945},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010233814,0.00018478831,0.9697894,0.00020561565,0.0032725644,0.00052262057,0.000037824346,0.000068502886,0.015684875],"genre_scores_gemma":[0.94895524,0.0000061352653,0.049419403,0.0004189852,0.00041511323,0.0000034763548,0.0000012721654,0.000046707064,0.0007336782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975833,0.000042802356,0.0005417602,0.0006417745,0.0007639805,0.00042633212],"domain_scores_gemma":[0.9973876,0.00074880343,0.0004737848,0.0011587604,0.00017025486,0.000060795348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007871137,0.00041349427,0.0005451088,0.0003114646,0.0003830211,0.00006603678,0.0017754586,0.00034611777,0.00003076031],"category_scores_gemma":[0.00027494453,0.0002681594,0.00025919636,0.00028354628,0.0015524414,0.00010097122,0.0009045107,0.00078956346,0.0000012438885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024601193,0.00008143012,0.00029227434,0.0005915398,0.000067893874,0.000026295356,0.005014258,0.013668598,0.00059611537,0.92577213,0.00083667773,0.053028204],"study_design_scores_gemma":[0.00012677428,0.000035063185,0.00009856382,0.00040490404,0.00002266509,0.000028162094,2.0275853e-7,0.01071553,0.0027198042,0.9852528,0.000281257,0.00031427585],"about_ca_topic_score_codex":0.000035520356,"about_ca_topic_score_gemma":0.000093623734,"teacher_disagreement_score":0.9387214,"about_ca_system_score_codex":0.00012752274,"about_ca_system_score_gemma":0.00011890782,"threshold_uncertainty_score":0.99997705},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068517233,0.00016104302,0.9892253,0.0004499768,0.0018929185,0.0005849985,0.000006975177,0.000185061,0.006808534],"genre_scores_gemma":[0.04210016,0.00018619071,0.94612664,0.005917654,0.00083595153,0.000020675958,0.000017403321,0.00005910016,0.0047362177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953175,0.000026581676,0.0006641051,0.0012363609,0.001891442,0.0008639883],"domain_scores_gemma":[0.99716705,0.00040923344,0.00021191387,0.00137299,0.00041807976,0.00042075542],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008913069,0.00048563172,0.0004584435,0.0011193012,0.0005770335,0.000509772,0.003605853,0.00032001245,0.00009616898],"category_scores_gemma":[0.00013152508,0.00042295657,0.0001531986,0.00086255535,0.00034321772,0.0008721234,0.0027392916,0.00072205573,0.0008416109],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016641623,0.00001962281,0.00008515231,0.000015986532,0.00000370642,0.00006665876,0.0015616812,0.020134248,0.000116408846,0.0013634631,0.00043239986,0.976184],"study_design_scores_gemma":[0.0014247564,0.0015939673,0.0074960836,0.0015627005,0.000020639456,0.0011132616,6.873607e-7,0.65864414,0.013985931,0.023775565,0.28594396,0.004438306],"about_ca_topic_score_codex":0.000019538038,"about_ca_topic_score_gemma":0.00004798497,"teacher_disagreement_score":0.9717457,"about_ca_system_score_codex":0.00069746084,"about_ca_system_score_gemma":0.00054507377,"threshold_uncertainty_score":0.99993634},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059605064,0.0027345042,0.9267784,0.0023299602,0.00051435886,0.00034114983,0.000005134947,0.00016800621,0.066532485],"genre_scores_gemma":[0.9801453,0.0002688298,0.010603657,0.0015583435,0.00044327698,0.000010273959,0.000012497036,0.00004566775,0.0069121835],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964156,0.000072868745,0.0004100349,0.0013023571,0.000934498,0.0008645973],"domain_scores_gemma":[0.9973359,0.00056279416,0.00010067147,0.00096242287,0.00076693884,0.00027128067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010576984,0.00044927953,0.000528329,0.0009295053,0.00026573866,0.00025175663,0.0010057671,0.00050665915,0.000057253605],"category_scores_gemma":[0.00076030777,0.00040434042,0.000112672795,0.0009139549,0.0014308052,0.00021975768,0.00074755866,0.0007162425,0.000004049932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017128892,0.000023092327,0.000058038644,0.000042882108,0.000005752776,0.0000880604,0.00008122284,0.02865362,0.0000020456137,0.19869104,0.000005153501,0.77233195],"study_design_scores_gemma":[0.00018973244,0.00020252068,0.00014208195,0.000039448812,0.000007144743,0.00002922842,8.0377237e-7,0.047419276,0.00013418357,0.90969354,0.04171367,0.00042835032],"about_ca_topic_score_codex":0.001266529,"about_ca_topic_score_gemma":0.0011034585,"teacher_disagreement_score":0.9795492,"about_ca_system_score_codex":0.0010797452,"about_ca_system_score_gemma":0.00096563617,"threshold_uncertainty_score":0.99984086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008455006,0.00070045516,0.99570125,0.00020042932,0.0008546669,0.0002631136,0.000028672777,0.00009492877,0.0013109922],"genre_scores_gemma":[0.06377203,0.00002729733,0.9355007,0.00031595098,0.00026544233,0.000007093086,0.000014419664,0.000033129054,0.00006395834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967175,0.000023292905,0.00061674754,0.0011523226,0.0008501493,0.00064000353],"domain_scores_gemma":[0.9969814,0.00031298219,0.0004921058,0.0017585754,0.00025955105,0.0001954306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073528115,0.0004355335,0.000520008,0.00062093395,0.00021757587,0.00028742696,0.003351198,0.00024972693,0.000015703099],"category_scores_gemma":[0.00006754598,0.00041024224,0.00010619003,0.0007149594,0.0005276582,0.00074108643,0.001689999,0.00044108136,0.000020270738],"study_design_candidate":"design_other","study_design_consensus":null,"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.934852e-7,0.00004894739,0.00022861926,0.000046285273,0.000014599077,0.000014032146,0.0009555106,0.004819452,0.00079276983,0.007269497,0.000028995759,0.9857803],"study_design_scores_gemma":[0.00027049126,0.000093104296,0.00052670256,0.0009217883,0.000027851167,0.00014587908,5.280535e-7,0.97402173,0.0040711844,0.016739942,0.0022634617,0.0009173446],"about_ca_topic_score_codex":0.000059113096,"about_ca_topic_score_gemma":0.00002098092,"teacher_disagreement_score":0.984863,"about_ca_system_score_codex":0.00020424805,"about_ca_system_score_gemma":0.00045340374,"threshold_uncertainty_score":0.99983495},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004150968,0.000052223673,0.992293,0.003139631,0.0026749223,0.0003736117,0.0000099866365,0.00006063701,0.0009808682],"genre_scores_gemma":[0.8440522,0.000007749325,0.15327749,0.0019431666,0.0005225706,0.000007112535,0.000004220163,0.000023766916,0.0001617494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749374,0.000056834873,0.0004144337,0.00074037065,0.00095456844,0.00034003763],"domain_scores_gemma":[0.9973578,0.00076785486,0.00039259446,0.0012163304,0.00019633234,0.0000690966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005821219,0.00033765385,0.00031064943,0.00022872059,0.00040229908,0.00025722405,0.0037415328,0.00019920924,0.000017321721],"category_scores_gemma":[0.00014310842,0.000191988,0.00015072679,0.00052411185,0.0016667439,0.0002386897,0.0011458028,0.0009164209,0.0000120379955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025961451,0.000027167589,0.000017485427,0.000010675207,0.000008140017,0.0000029287112,0.00066435203,0.005359988,0.0006091116,0.3903509,0.000021804424,0.6029248],"study_design_scores_gemma":[0.00008419024,0.00006334115,0.0007375658,0.000115270035,0.000003124119,0.000008194211,7.840647e-8,0.34181523,0.0061322055,0.6506014,0.00024393042,0.00019548915],"about_ca_topic_score_codex":0.000070185655,"about_ca_topic_score_gemma":0.00011613224,"teacher_disagreement_score":0.84363705,"about_ca_system_score_codex":0.00010911189,"about_ca_system_score_gemma":0.0003451312,"threshold_uncertainty_score":0.7829043},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004725171,0.00032335139,0.9920867,0.00080865243,0.0010837317,0.00021044647,0.000013398731,0.0002448368,0.0051816497],"genre_scores_gemma":[0.6264299,0.000046778416,0.37076795,0.0019458857,0.0004240342,0.000010555152,0.000014857457,0.00003182724,0.00032822407],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995437,0.00002531226,0.0005324778,0.0017267984,0.0015588778,0.0007195134],"domain_scores_gemma":[0.9976049,0.00025531804,0.00025338566,0.001287013,0.00034750023,0.00025190512],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007112303,0.00056863466,0.00049018965,0.0007356336,0.0002816286,0.00066199386,0.0040748757,0.00048534304,0.000091073096],"category_scores_gemma":[0.000066851346,0.00053981977,0.00014389957,0.00051412743,0.00088768837,0.0008448041,0.0010872483,0.0012663477,0.0002366644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040781,0.000041231586,0.000027559978,0.000024988838,0.000012337015,0.00020724896,0.0004479604,0.10366368,0.00012616535,0.37124252,0.00002113409,0.5241811],"study_design_scores_gemma":[0.00021083283,0.00011742111,0.0001170637,0.00033705324,0.000004593061,0.00011063704,5.4440285e-8,0.18477707,0.00076160295,0.81275505,0.0001825235,0.00062611565],"about_ca_topic_score_codex":0.000046768113,"about_ca_topic_score_gemma":0.00008182103,"teacher_disagreement_score":0.62638265,"about_ca_system_score_codex":0.00042743038,"about_ca_system_score_gemma":0.0017986347,"threshold_uncertainty_score":0.9997053},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003220832,0.0034001332,0.990248,0.0008550079,0.0036292234,0.00080790214,0.000026303569,0.00031019797,0.00040114808],"genre_scores_gemma":[0.34848553,0.00002770855,0.649458,0.0012009619,0.0004621157,0.000015186919,0.000016883787,0.000033705055,0.00029993462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638563,0.000022363936,0.00047801837,0.0016647384,0.0006658971,0.0007833531],"domain_scores_gemma":[0.9970949,0.0006696571,0.00026925452,0.0016525061,0.00018797112,0.0001256556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045808792,0.0006072811,0.0006306496,0.0006167843,0.00023204267,0.0005036633,0.0038926655,0.00023104652,0.000015144818],"category_scores_gemma":[0.00025314974,0.00050215714,0.00018790447,0.00035493006,0.000650698,0.000729829,0.0015493397,0.000702522,0.000014021635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002501531,0.000030151103,0.000031826417,0.00017040661,0.00003426795,0.00016682786,0.00214082,0.010704429,0.0010829018,0.082176745,0.00010174647,0.90333486],"study_design_scores_gemma":[0.0022175033,0.00061887066,0.00040779982,0.0023172505,0.000057771398,0.0005472769,0.0000061301166,0.49095222,0.05271432,0.4397637,0.0070916926,0.003305467],"about_ca_topic_score_codex":0.00010420152,"about_ca_topic_score_gemma":0.0004454301,"teacher_disagreement_score":0.9000294,"about_ca_system_score_codex":0.00030245993,"about_ca_system_score_gemma":0.0006708976,"threshold_uncertainty_score":0.999743},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006909529,0.0005574288,0.9907284,0.00040434912,0.0016785648,0.0005402161,0.0000017774158,0.0003319862,0.005066355],"genre_scores_gemma":[0.5040829,0.00014351224,0.49177828,0.0022731556,0.0009074943,0.000017635559,0.0000079237625,0.000094684634,0.0006944179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99207306,0.00013500017,0.001310314,0.0030342243,0.0016605619,0.0017868115],"domain_scores_gemma":[0.9952782,0.00097491854,0.0006277079,0.0024952511,0.00027035328,0.0003535833],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019155263,0.0010158382,0.0010915942,0.0014915778,0.00037102387,0.0008268749,0.0056243013,0.0008105237,0.000013055039],"category_scores_gemma":[0.00015019569,0.00100244,0.00020578914,0.002005881,0.00096924714,0.00081382174,0.0016061033,0.0022804153,0.000024358587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046892796,0.000025472256,0.00007212124,0.000012992324,0.0000029873058,0.00020742047,0.00024789653,0.6247356,0.000062828374,0.0073919855,0.000005306634,0.3672307],"study_design_scores_gemma":[0.000323703,0.00011889149,0.00016782888,0.0009796654,0.0000046990485,0.00009740581,4.306207e-7,0.9852507,0.00042320133,0.011354647,0.00020341444,0.0010754259],"about_ca_topic_score_codex":0.000036110083,"about_ca_topic_score_gemma":0.00019736246,"teacher_disagreement_score":0.5033919,"about_ca_system_score_codex":0.00065337156,"about_ca_system_score_gemma":0.0004901914,"threshold_uncertainty_score":0.99975574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004591252,0.0013650507,0.9928329,0.0020293088,0.0015864393,0.0016043126,0.000023944762,0.00042716545,0.00008498849],"genre_scores_gemma":[0.006159761,0.00007384248,0.9912939,0.0016291075,0.00047532388,0.00012605975,0.000014624934,0.000043277123,0.00018412151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958093,0.000045770408,0.0005382456,0.0016245315,0.000876023,0.0011061394],"domain_scores_gemma":[0.99749446,0.000495356,0.00029924366,0.0010525855,0.00039689775,0.00026144503],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015181301,0.0006035902,0.0005686728,0.0010743436,0.00031600863,0.0011197984,0.00326321,0.0003751953,0.000012567706],"category_scores_gemma":[0.00009322213,0.00056878023,0.00010131433,0.00078023534,0.00025494126,0.0015078686,0.0020379417,0.00046866506,0.000015178891],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036509837,0.00001157378,0.000006697912,0.00001405241,0.00001379808,0.000008420639,0.00042990904,0.002952336,0.00022937567,0.016426725,0.0004698892,0.9794336],"study_design_scores_gemma":[0.00071629544,0.00036956187,0.00008494573,0.00012550842,0.000020494954,0.00008042037,6.167328e-7,0.8951901,0.007932234,0.08400059,0.01044714,0.0010320751],"about_ca_topic_score_codex":0.000014744641,"about_ca_topic_score_gemma":0.000039525912,"teacher_disagreement_score":0.9784015,"about_ca_system_score_codex":0.00026455856,"about_ca_system_score_gemma":0.0003382889,"threshold_uncertainty_score":0.99991715},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018005648,0.00051773986,0.9929353,0.0005930322,0.0015635139,0.00036834134,0.0000030382578,0.000049329465,0.0021691674],"genre_scores_gemma":[0.79416114,0.000050297254,0.20434242,0.00092736,0.00043770653,0.0000054802613,0.0000011404424,0.000025980231,0.00004845322],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99609977,0.00008092051,0.0008600925,0.0010542161,0.0012734832,0.00063152314],"domain_scores_gemma":[0.9971324,0.0007282852,0.00039597647,0.0014403923,0.00023603824,0.00006688793],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011980123,0.0004232718,0.0005420248,0.00081218017,0.00031658323,0.0006918692,0.0047454634,0.00027579285,0.00001122012],"category_scores_gemma":[0.00021671214,0.0003304802,0.00014561535,0.0010434747,0.003704753,0.00059967913,0.00092080265,0.0008474374,0.000027503174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014821737,0.000095098265,0.00019933537,0.00003918439,0.000010739524,0.00029139858,0.019184887,0.10755168,0.0005798013,0.22793026,0.000036243528,0.6440666],"study_design_scores_gemma":[0.00004823656,0.0001376875,0.000105246414,0.00029882984,0.0000055083187,0.00015491479,0.0000022020415,0.45297474,0.0074599497,0.53598976,0.0023057605,0.00051716925],"about_ca_topic_score_codex":0.00017302638,"about_ca_topic_score_gemma":0.0005109853,"teacher_disagreement_score":0.7923606,"about_ca_system_score_codex":0.00022437828,"about_ca_system_score_gemma":0.0011922272,"threshold_uncertainty_score":0.9999147},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019253237,0.0013657522,0.98372626,0.00063526887,0.0014245812,0.00031977764,0.000009794365,0.00027523123,0.01205082],"genre_scores_gemma":[0.11664133,0.00016186018,0.8804746,0.0017727136,0.00059409946,0.0000059066483,0.0000062904974,0.00004877756,0.00029442608],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961629,0.000060056096,0.0005863575,0.0017174468,0.000623579,0.0008496687],"domain_scores_gemma":[0.9962174,0.0016034569,0.00030487846,0.0014105273,0.00023391104,0.00022981873],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016538132,0.0007162196,0.0007024314,0.0009970975,0.00065247866,0.00084759895,0.0030440276,0.00036540037,0.000017013444],"category_scores_gemma":[0.000117856456,0.00059755845,0.00016155685,0.0007722669,0.0031904909,0.0006468967,0.002624706,0.0013044555,0.000012726518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038012809,0.000015556032,0.000069466485,0.000026955686,0.000011231386,0.000035553454,0.0010518173,0.00029166823,0.000019416988,0.499044,0.0000027887547,0.49942777],"study_design_scores_gemma":[0.0001723829,0.00012339109,0.00036851986,0.00030667937,0.0000044569,0.00012756066,9.399557e-7,0.14570868,0.000511379,0.84983355,0.0021913617,0.0006510812],"about_ca_topic_score_codex":0.00003904308,"about_ca_topic_score_gemma":0.0004112359,"teacher_disagreement_score":0.49877667,"about_ca_system_score_codex":0.00016651597,"about_ca_system_score_gemma":0.00030743357,"threshold_uncertainty_score":0.99964756},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014995082,0.000068523266,0.9922692,0.0008858118,0.0029913126,0.0006074387,0.00005260232,0.0002922982,0.0013332729],"genre_scores_gemma":[0.24191613,0.000008784371,0.7541258,0.002672233,0.0010721112,0.0000075641733,0.000033567587,0.000045924156,0.000117907126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99306136,0.00019584797,0.0012262891,0.0023082052,0.0021365786,0.0010717419],"domain_scores_gemma":[0.9953478,0.0006159231,0.00070082,0.0024474936,0.0005704912,0.0003174451],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0023063486,0.0008599794,0.00095064123,0.00081415556,0.000793031,0.0012781277,0.0031568478,0.00075185887,0.000109513814],"category_scores_gemma":[0.00020142333,0.000812518,0.00025179336,0.00072033604,0.001256283,0.0016170455,0.0025441642,0.0023408262,0.000017770953],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048500424,0.00013821722,0.0014808652,0.0003144735,0.0000919971,0.00030266447,0.003514853,0.015284785,0.00965228,0.029062865,0.00004983594,0.94005865],"study_design_scores_gemma":[0.0005439319,0.00014292526,0.008930835,0.00020818812,0.00001918252,0.00018159043,6.2653896e-7,0.8712091,0.0012233441,0.115199514,0.001307688,0.0010330641],"about_ca_topic_score_codex":0.00038216382,"about_ca_topic_score_gemma":0.00072596746,"teacher_disagreement_score":0.9390256,"about_ca_system_score_codex":0.0006258212,"about_ca_system_score_gemma":0.0011142355,"threshold_uncertainty_score":0.99996084},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027196169,0.0000630297,0.99572575,0.0015183726,0.0005333893,0.0011111762,0.000025905949,0.0003280068,0.0006671987],"genre_scores_gemma":[0.10395457,0.000017641327,0.89295393,0.0015469306,0.00026373498,0.0001263132,0.00010417827,0.000050134753,0.0009825906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966754,0.000042113905,0.0006760992,0.001374487,0.0006743312,0.00055758253],"domain_scores_gemma":[0.9975961,0.000404935,0.00049474655,0.0005792911,0.00080232514,0.00012261391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083359913,0.00051904237,0.00049956626,0.0007156742,0.0003367185,0.00078932074,0.0014638038,0.00028164042,0.000013342073],"category_scores_gemma":[0.00008144082,0.00048903265,0.00014706646,0.000666431,0.00035672486,0.0007358393,0.00043820555,0.0004061647,0.000008285991],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009093957,0.00018695345,0.000008656974,0.00012847666,0.000028657843,0.000017324037,0.00054698857,0.02281507,0.0128942495,0.038472738,0.00016655326,0.9246434],"study_design_scores_gemma":[0.00044012093,0.00033292538,0.000008862133,0.00015907991,0.000008377447,0.0000038044716,3.9446698e-7,0.87799466,0.08875051,0.031052137,0.0007297552,0.00051934586],"about_ca_topic_score_codex":0.000016974505,"about_ca_topic_score_gemma":0.000031013322,"teacher_disagreement_score":0.92412406,"about_ca_system_score_codex":0.0006464969,"about_ca_system_score_gemma":0.00091502484,"threshold_uncertainty_score":0.99975616},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007784276,0.00094612804,0.9706453,0.0000728395,0.009042106,0.0003069101,0.0000066140697,0.000042577078,0.011153214],"genre_scores_gemma":[0.9629395,0.00008942243,0.03269086,0.00040411518,0.0026979283,0.000013973756,0.000015370053,0.000059169084,0.0010896893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748576,0.000028948716,0.0005799311,0.00082842435,0.0005473107,0.0005296442],"domain_scores_gemma":[0.998778,0.0002784661,0.00020959773,0.0004892452,0.00016251537,0.00008221602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072775956,0.0003572424,0.00037671512,0.0007718351,0.00016092118,0.00027126627,0.00081061467,0.00045117844,0.0003166732],"category_scores_gemma":[0.000022487799,0.00034497306,0.0000766496,0.00030484892,0.00055477064,0.00033943585,0.00019429169,0.0013537955,0.00012757885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026566973,0.000077137076,0.0023554477,0.00019497881,0.000031163432,0.0001969067,0.005044197,0.7019893,0.00093417394,0.20374167,0.000008077013,0.08540041],"study_design_scores_gemma":[0.0006529319,0.00049819035,0.005006695,0.009134028,0.0000355882,0.0012000301,0.000048857008,0.6974894,0.0033702059,0.267492,0.0116201695,0.0034519334],"about_ca_topic_score_codex":0.00030853724,"about_ca_topic_score_gemma":0.00025789667,"teacher_disagreement_score":0.9551552,"about_ca_system_score_codex":0.00029701905,"about_ca_system_score_gemma":0.0004216778,"threshold_uncertainty_score":0.9999002},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010124242,0.00040336465,0.9789583,0.009613346,0.0016124331,0.0010643956,0.00000412745,0.00064966764,0.0075931395],"genre_scores_gemma":[0.09350463,0.000008379206,0.8959467,0.006951123,0.001051516,0.00004804266,0.000008922697,0.00007969995,0.0024009896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99129623,0.000065798034,0.00094850035,0.0028465868,0.0030063812,0.0018364895],"domain_scores_gemma":[0.9945388,0.0008615815,0.0003314562,0.002776538,0.0010983429,0.00039328865],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0041853627,0.000890936,0.0008666382,0.00274606,0.00027614826,0.0006417461,0.007829761,0.0007933205,0.000008504446],"category_scores_gemma":[0.00074559654,0.0009004058,0.00012683748,0.0054626036,0.00061998126,0.0005669462,0.004363779,0.0018812957,0.00021929103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018848204,0.000021268592,0.00007083878,0.000009239779,0.000006910267,0.00014503293,0.0008336215,0.42252907,0.0000076276765,0.01627514,0.0016183777,0.558464],"study_design_scores_gemma":[0.0006097928,0.0011837543,0.0016789534,0.0020696719,0.00001398977,0.00014274249,0.0000029658277,0.6404054,0.00054962304,0.24162167,0.108959354,0.0027620585],"about_ca_topic_score_codex":0.000086094195,"about_ca_topic_score_gemma":0.0012083357,"teacher_disagreement_score":0.555702,"about_ca_system_score_codex":0.0012122408,"about_ca_system_score_gemma":0.00062987435,"threshold_uncertainty_score":0.99934465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004915143,0.000630819,0.99603385,0.0001274672,0.00093431823,0.00058917614,0.000016552824,0.00007624797,0.0011000435],"genre_scores_gemma":[0.985116,0.000026700522,0.014367387,0.00014363517,0.00022050388,0.000008646095,0.000034667286,0.000013879444,0.0000685553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979497,0.00007806972,0.0005433124,0.000522578,0.00065935537,0.00024696832],"domain_scores_gemma":[0.99746084,0.0001808024,0.0005626892,0.0006661476,0.0010616306,0.00006788174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065705145,0.0002546164,0.0002870025,0.0004980641,0.0003438583,0.0003582562,0.0008690084,0.00017196621,0.0000024734356],"category_scores_gemma":[0.00011298274,0.00019770552,0.00003321975,0.0008158777,0.00044398961,0.0020475849,0.0002564711,0.00024571124,0.000009068966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037882785,0.00003174396,0.00055954576,0.00008615129,0.00001859422,0.0000030302394,0.012318709,0.119575456,0.00027467578,0.85557306,0.00007420267,0.011481067],"study_design_scores_gemma":[0.00032886595,0.00013518482,0.0018481148,0.00028712617,0.0000137081415,0.00003977149,0.000036720285,0.9896434,0.00028596405,0.0050847987,0.0019244065,0.00037193057],"about_ca_topic_score_codex":0.00046486477,"about_ca_topic_score_gemma":0.000066268345,"teacher_disagreement_score":0.9846245,"about_ca_system_score_codex":0.00048651517,"about_ca_system_score_gemma":0.0003705772,"threshold_uncertainty_score":0.8062197},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004638397,0.00011669677,0.9705666,0.00029873432,0.00082348904,0.00030376477,0.0000050222716,0.00008918692,0.027750133],"genre_scores_gemma":[0.08705309,0.00008558829,0.9115975,0.0010191337,0.00015679582,0.000007520392,0.000024437633,0.000014373229,0.000041580784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763775,0.000018978522,0.00057518267,0.0005466633,0.00084943493,0.00037202123],"domain_scores_gemma":[0.99815226,0.00013782812,0.00043297818,0.0009516863,0.0002382034,0.000087041924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064316386,0.00030783916,0.00037447718,0.00076891895,0.00012537374,0.0002996405,0.002099129,0.00024219451,0.000015544652],"category_scores_gemma":[0.00004390546,0.0002644393,0.00009659021,0.00062449655,0.00033646863,0.0015092295,0.0006242004,0.00037005145,0.000045640387],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026673315,0.0000134286765,0.000021248426,0.000041796593,0.000003454542,0.0000068476866,0.00063511037,0.011784503,0.00000780176,0.027480809,0.000026026615,0.9599763],"study_design_scores_gemma":[0.00021058762,0.00013185848,0.00015338193,0.00016129465,0.000004016931,0.000043556698,1.5007119e-7,0.72859323,0.0002643014,0.26755393,0.0025304253,0.00035327257],"about_ca_topic_score_codex":0.000022343787,"about_ca_topic_score_gemma":0.000012254879,"teacher_disagreement_score":0.95962304,"about_ca_system_score_codex":0.0001301743,"about_ca_system_score_gemma":0.0002464381,"threshold_uncertainty_score":0.9999808},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007912255,0.0010275047,0.987482,0.00058806926,0.0020716556,0.0008579127,0.0000061500277,0.00001596728,0.000038449074],"genre_scores_gemma":[0.9392223,0.000030553914,0.059473835,0.00082052377,0.0002515382,0.000053729673,0.00001005869,0.000009354883,0.00012811023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971437,0.00013009047,0.0007089079,0.0006314689,0.0010399825,0.00034589242],"domain_scores_gemma":[0.9962706,0.0018530982,0.00068747473,0.0006959786,0.00044542106,0.000047444566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046003885,0.00023820452,0.00048004545,0.0010168575,0.0002501243,0.00013323441,0.0016625158,0.0002108054,0.0000031731695],"category_scores_gemma":[0.00035302958,0.00016328608,0.00014471968,0.0009591112,0.0001909144,0.0003747617,0.00049020106,0.00050686346,0.0000013456938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016182768,0.00066510856,0.020053823,0.0008948554,0.000567189,0.00011543163,0.17066428,0.028490182,0.00019158876,0.046957668,0.00012202179,0.7312617],"study_design_scores_gemma":[0.0010513857,0.0003211446,0.028603982,0.002413944,0.0007688752,0.00041292713,0.00016595997,0.9026601,0.000738754,0.059787184,0.0013924398,0.00168336],"about_ca_topic_score_codex":0.00005902333,"about_ca_topic_score_gemma":0.00054082763,"teacher_disagreement_score":0.93131006,"about_ca_system_score_codex":0.00017025476,"about_ca_system_score_gemma":0.00053887634,"threshold_uncertainty_score":0.6658613},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038065582,0.00017243742,0.9817801,0.0003302345,0.0019765298,0.0004542619,0.000007098622,0.00009843358,0.011374364],"genre_scores_gemma":[0.87168044,0.000028692908,0.113329366,0.0014383814,0.0006262633,0.000025719137,0.000012265611,0.000042371707,0.012816507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956527,0.000047306945,0.0010442936,0.00094637484,0.0018701785,0.00043919304],"domain_scores_gemma":[0.9978248,0.00048514208,0.0005253141,0.00076317025,0.0002903221,0.00011124774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002906511,0.0003581884,0.00047730404,0.002181874,0.000172553,0.0010024413,0.0018383387,0.00023104058,0.00016492198],"category_scores_gemma":[0.00028999572,0.00028968946,0.0001353152,0.0008313985,0.00023989686,0.001503462,0.00057918177,0.0006870848,0.0005062893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026114185,0.0000362286,0.0032073816,0.000029485547,0.0000061510395,0.000075515134,0.002423191,0.06518163,0.000025072297,0.00964629,0.0001722412,0.9191707],"study_design_scores_gemma":[0.00072778726,0.00006573879,0.011275096,0.0015238969,0.000013884455,0.00005390248,0.000025887433,0.9397026,0.00010400549,0.0020315214,0.043660745,0.0008149889],"about_ca_topic_score_codex":0.000047120113,"about_ca_topic_score_gemma":0.00067631685,"teacher_disagreement_score":0.9183557,"about_ca_system_score_codex":0.00063844403,"about_ca_system_score_gemma":0.00015623416,"threshold_uncertainty_score":0.99995553},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047355,0.0002608295,0.99148285,0.0002587629,0.002261642,0.00036547656,0.000003977366,0.00010157263,0.0005293667],"genre_scores_gemma":[0.4870765,0.000046285557,0.51220965,0.00018092977,0.0004062071,0.0000051258726,0.0000027838907,0.00003283386,0.00003969141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960461,0.00004951651,0.00077576947,0.0013320021,0.0011062473,0.0006903532],"domain_scores_gemma":[0.9976672,0.00028620794,0.0004703302,0.001246321,0.00016774559,0.00016218059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072607887,0.00047527492,0.0005846945,0.0014203562,0.00012027598,0.00022380607,0.0024487718,0.0004046926,0.00003580883],"category_scores_gemma":[0.000052292886,0.00045919462,0.00011209755,0.0010701254,0.0004663355,0.00091138005,0.0011796246,0.0008603421,0.000008531116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001039014,0.000024831263,0.00020579001,0.000050075345,0.0000054881657,0.00005250117,0.0006511657,0.059004735,0.0039054381,0.00046263973,0.0000031324885,0.9356238],"study_design_scores_gemma":[0.00034513918,0.00014446682,0.00029901028,0.0012866692,0.0000059797026,0.000063362335,3.4368216e-7,0.93108267,0.03823976,0.027321102,0.0006220862,0.0005894108],"about_ca_topic_score_codex":0.00011887874,"about_ca_topic_score_gemma":0.0003111711,"teacher_disagreement_score":0.9350344,"about_ca_system_score_codex":0.0007164397,"about_ca_system_score_gemma":0.0004988168,"threshold_uncertainty_score":0.99978596},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012489854,0.0012386974,0.99185944,0.0007986037,0.0014198871,0.00038357094,0.000007839606,0.00030147276,0.0027415352],"genre_scores_gemma":[0.43016678,0.00012474624,0.56664884,0.002233114,0.00051645143,0.000005906327,0.000014674352,0.0000668731,0.00022259733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99547905,0.0000776504,0.000707227,0.0017534161,0.0010616313,0.0009210487],"domain_scores_gemma":[0.995837,0.00083365664,0.00040332926,0.0023371882,0.00028099972,0.00030786943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001845009,0.0006958763,0.0006913882,0.00086597557,0.00076634984,0.000925281,0.0038146963,0.0004173332,0.000015755131],"category_scores_gemma":[0.00009565834,0.0006412822,0.00015079965,0.00065469876,0.0021702566,0.00047507786,0.0026874477,0.00160132,0.000026548687],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000870262,0.00006771631,0.00009452407,0.000054328422,0.000015399179,0.00009989205,0.0014540461,0.0093146255,0.000053590775,0.141179,0.000028531116,0.84762967],"study_design_scores_gemma":[0.000262721,0.00014242704,0.0006288126,0.00030824283,0.0000059762606,0.00014373938,1.814364e-7,0.7022837,0.000075339674,0.29292366,0.002602061,0.0006231709],"about_ca_topic_score_codex":0.00008523378,"about_ca_topic_score_gemma":0.000171006,"teacher_disagreement_score":0.8470065,"about_ca_system_score_codex":0.0002279295,"about_ca_system_score_gemma":0.00033996996,"threshold_uncertainty_score":0.99960387},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000102244274,0.005611321,0.99122375,0.00015584019,0.0013662409,0.0006288149,0.0000020305129,0.0008177804,0.0000919789],"genre_scores_gemma":[0.40800792,0.00010501934,0.5906995,0.00014725188,0.00075263705,0.00008139548,0.000001274416,0.0001091976,0.00009578918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939472,0.000021503922,0.00048700473,0.0019607188,0.0026848724,0.0008986698],"domain_scores_gemma":[0.99667203,0.0007236928,0.00014543548,0.0014922884,0.00066730496,0.0002992192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015974345,0.00063710794,0.0005955836,0.0018084655,0.00018377256,0.00072411634,0.0029420247,0.00022734681,0.0000051110123],"category_scores_gemma":[0.0019365208,0.0005963961,0.000083365136,0.0014222014,0.00022460679,0.00060166273,0.0011632174,0.0009172101,0.000020966632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006038628,0.000065171385,0.00083228474,0.0017962384,0.0000752107,0.0004803706,0.0029560945,0.10208156,0.00019316323,0.0036163598,0.00007227466,0.88782525],"study_design_scores_gemma":[0.00041326752,0.00021421636,0.0005408014,0.0027019707,0.000011040345,0.00043127083,4.2158075e-7,0.9884081,0.0031501523,0.001176224,0.0013883475,0.0015641978],"about_ca_topic_score_codex":0.000012827113,"about_ca_topic_score_gemma":0.0000027656752,"teacher_disagreement_score":0.88632655,"about_ca_system_score_codex":0.0010107411,"about_ca_system_score_gemma":0.00037066799,"threshold_uncertainty_score":0.99964875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003156861,0.0016284693,0.9906341,0.0046538836,0.0006446166,0.0009849833,0.00006569866,0.00013446934,0.0012506496],"genre_scores_gemma":[0.0010749866,0.00013815575,0.995365,0.0018166952,0.00070158177,0.00012416717,0.000014256892,0.00003388716,0.000731256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967429,0.000017307822,0.000512927,0.0014868365,0.0006002842,0.0006397573],"domain_scores_gemma":[0.9967808,0.00103925,0.000258604,0.0015351372,0.00023114528,0.00015502928],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009314031,0.0004687174,0.000436128,0.00029790375,0.0007412715,0.0010605804,0.0030608468,0.00021572357,0.000009409382],"category_scores_gemma":[0.000035040677,0.00034856456,0.0001262945,0.0004047306,0.0011127606,0.0005168633,0.0009068348,0.0005512204,0.000027716771],"study_design_candidate":"design_other","study_design_consensus":null,"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.3589583e-7,0.000018663004,0.0000015661369,0.000015908263,0.000012314579,0.0000035815335,0.00034796097,0.0003417091,0.000011083825,0.027697066,0.00010662271,0.9714427],"study_design_scores_gemma":[0.00028531722,0.00014129984,0.000030079167,0.0001532984,0.000019348425,0.0001162874,4.520915e-7,0.73884255,0.00007968323,0.21818206,0.041674193,0.0004754195],"about_ca_topic_score_codex":0.000045797045,"about_ca_topic_score_gemma":0.000114700466,"teacher_disagreement_score":0.9709673,"about_ca_system_score_codex":0.0001208409,"about_ca_system_score_gemma":0.00049570925,"threshold_uncertainty_score":0.9999764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020884295,0.000089832705,0.99269146,0.0011463948,0.002244776,0.00031269673,0.00002418139,0.0002525969,0.0030292384],"genre_scores_gemma":[0.38015538,0.000023873048,0.6180179,0.00061758613,0.00062682456,0.000015262849,0.0001351143,0.000038067916,0.00036997482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965051,0.000054231466,0.00057259353,0.0015461766,0.00077838294,0.000543526],"domain_scores_gemma":[0.99748427,0.00027219034,0.00030968254,0.0016124469,0.00016977383,0.0001516268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008413621,0.00043929718,0.0004090863,0.001176276,0.00035035392,0.0005760556,0.0024279903,0.0004451593,0.000059287577],"category_scores_gemma":[0.00013611553,0.00042098717,0.000087138724,0.0007736565,0.0005290717,0.000758113,0.00081849913,0.0019346357,0.00004736987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013910016,0.000057718575,0.0016699344,0.00005362577,0.000012083878,0.00006606994,0.0014054425,0.12815548,0.0031088802,0.026019212,0.000047200974,0.83939046],"study_design_scores_gemma":[0.00041017297,0.000109377914,0.009398947,0.0001821514,0.0000072022394,0.000104977895,3.3457724e-7,0.9343295,0.00027609858,0.0453418,0.009253235,0.000586183],"about_ca_topic_score_codex":0.00006255614,"about_ca_topic_score_gemma":0.00054795574,"teacher_disagreement_score":0.83880424,"about_ca_system_score_codex":0.000262603,"about_ca_system_score_gemma":0.00036757218,"threshold_uncertainty_score":0.99982417},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000096068434,0.00014442722,0.98983806,0.003670267,0.0006271768,0.00031269662,0.0000033432752,0.00014060759,0.005167356],"genre_scores_gemma":[0.18182476,0.00021272042,0.8019831,0.0082100835,0.0012320968,0.000011648985,0.000023434539,0.000057175806,0.006444992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965797,0.000021150518,0.00031523587,0.001240625,0.0011956779,0.0006475957],"domain_scores_gemma":[0.9972686,0.0001851797,0.00024962323,0.0020365373,0.00015444441,0.00010560092],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008431006,0.00049973506,0.00039073292,0.0004796701,0.00038488818,0.0010737114,0.006055273,0.00014077517,0.0000134806005],"category_scores_gemma":[0.00001394646,0.0003074085,0.00006905739,0.0009169355,0.00067937083,0.0010524754,0.0013704875,0.0007831727,0.000062003055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033273193,0.000015270009,0.000018691248,0.000014123466,0.000014066404,0.00005465225,0.00014877894,0.033246305,0.0000035108699,0.0195597,0.00014766214,0.9467739],"study_design_scores_gemma":[0.00036987214,0.00050016894,0.0008003455,0.00029107212,0.000032100706,0.000057557565,2.4758543e-7,0.9472056,0.00039045356,0.032898065,0.016489787,0.0009647242],"about_ca_topic_score_codex":0.000011164994,"about_ca_topic_score_gemma":0.000035578945,"teacher_disagreement_score":0.9458092,"about_ca_system_score_codex":0.00014321246,"about_ca_system_score_gemma":0.00023698402,"threshold_uncertainty_score":0.9999633},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014543897,0.00085088366,0.99547076,0.00020578258,0.00089575036,0.0015219152,0.000008308946,0.000083957355,0.0008172018],"genre_scores_gemma":[0.73798144,0.00006416759,0.2606236,0.0004687915,0.00047352744,0.00015442693,0.000022238211,0.000061753744,0.00015007438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99501324,0.00006991972,0.00096979487,0.0017745871,0.0010787171,0.0010937331],"domain_scores_gemma":[0.9957541,0.0015218866,0.0005356602,0.0018076005,0.0002478662,0.00013288553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017986665,0.00071408576,0.0008854653,0.00052557717,0.0002578436,0.0003341542,0.005048739,0.0005586359,0.0000047957665],"category_scores_gemma":[0.000018709443,0.00054627104,0.00025727495,0.0010081939,0.0013959801,0.00035645152,0.0014211524,0.0011791214,0.000001458522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025201192,0.000059183618,0.000050538092,0.00004333546,0.000014898058,0.000015650803,0.00023334795,0.7835629,0.000008217777,0.008579963,0.00007327254,0.20733348],"study_design_scores_gemma":[0.00060700194,0.00017181684,0.0000886699,0.00039763062,0.000016730319,0.000030203973,0.0000010882936,0.9957239,0.0001606301,0.0020064355,0.00021285901,0.0005830031],"about_ca_topic_score_codex":0.00011179163,"about_ca_topic_score_gemma":0.0002496757,"teacher_disagreement_score":0.737836,"about_ca_system_score_codex":0.0004010631,"about_ca_system_score_gemma":0.00041695285,"threshold_uncertainty_score":0.9996989},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024265074,0.0010016537,0.9889001,0.001327327,0.0022991595,0.00060721854,0.00009679716,0.00013986243,0.0032013396],"genre_scores_gemma":[0.33953112,0.00009527201,0.652708,0.0034258158,0.0025179968,0.0000055747287,0.0012257994,0.000088378794,0.00040206162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970884,0.000022094582,0.00055953604,0.0011346443,0.0008592644,0.00033609412],"domain_scores_gemma":[0.99679,0.0008338296,0.00021870174,0.0017830825,0.0001912039,0.00018318012],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062386825,0.00037462803,0.00063936727,0.0006648823,0.00012209655,0.00009070837,0.00081225135,0.00033380894,0.00015253795],"category_scores_gemma":[0.00020346403,0.00030518053,0.00013095282,0.0004918916,0.0009654746,0.0001941989,0.00057298766,0.00070958125,0.000033440472],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067905465,0.0002461068,0.003657146,0.00044173893,0.000115230236,0.00039305296,0.0009177907,0.0095865065,0.0003892578,0.0015533228,0.00016025954,0.9824717],"study_design_scores_gemma":[0.0054688007,0.0020530222,0.032979496,0.020863093,0.0008006749,0.00042390893,0.0000037848783,0.47594148,0.002362227,0.43095434,0.024213517,0.003935657],"about_ca_topic_score_codex":0.000059899867,"about_ca_topic_score_gemma":0.00003934483,"teacher_disagreement_score":0.978536,"about_ca_system_score_codex":0.00011861285,"about_ca_system_score_gemma":0.00062269194,"threshold_uncertainty_score":0.99994004},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002137791,0.00034231727,0.9952426,0.0004255868,0.0007314926,0.0003437885,0.000013450374,0.00009311851,0.0006698348],"genre_scores_gemma":[0.3406621,0.00017148205,0.65593326,0.0014458613,0.0011532869,0.000022612787,0.000040005365,0.00007766431,0.0004937438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958651,0.00004477478,0.0007058828,0.0016287579,0.00092366984,0.00083183585],"domain_scores_gemma":[0.9979546,0.00031986507,0.00023861857,0.0012605177,0.00007454548,0.00015186465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010326897,0.00050116546,0.0005656043,0.0017017566,0.00011749917,0.00056178437,0.0034849015,0.00031877137,0.000056912995],"category_scores_gemma":[0.000055856766,0.00046957986,0.000087163935,0.00081828673,0.00016812314,0.001147611,0.0022412539,0.0011597445,0.00007054406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056146378,0.00006856434,0.0015985376,0.000034413813,0.000003942163,0.000441515,0.0008363714,0.063084655,0.00015593434,0.003998667,0.000016170568,0.9297556],"study_design_scores_gemma":[0.00048452933,0.00007906391,0.0019237507,0.0013068636,0.0000017740022,0.000042626816,1.7077383e-7,0.97897774,0.0004366724,0.015060151,0.0010097986,0.00067687687],"about_ca_topic_score_codex":0.00017874564,"about_ca_topic_score_gemma":0.00044772425,"teacher_disagreement_score":0.92907876,"about_ca_system_score_codex":0.00061701814,"about_ca_system_score_gemma":0.00037094994,"threshold_uncertainty_score":0.9997756},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001507608,0.0016599451,0.8465057,0.0011380945,0.0022538211,0.00030185241,0.00007017022,0.00007853873,0.14648429],"genre_scores_gemma":[0.9077715,0.0006199782,0.073271036,0.0055272714,0.0019118041,0.000017049142,0.00002774333,0.00013530371,0.0107183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973252,0.000005288057,0.00072984525,0.0013233328,0.00008884343,0.0005274813],"domain_scores_gemma":[0.9982676,0.00022041262,0.0004199453,0.0009101384,0.00004202429,0.00013990201],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006150984,0.00044076252,0.00072280964,0.0007560148,0.00017049148,0.0002272063,0.0011233616,0.0003442925,0.00074392394],"category_scores_gemma":[0.0000466316,0.00047204897,0.00018373757,0.00015107826,0.00048765427,0.0002482598,0.000312514,0.0005800405,0.00089000555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009072235,0.00002209307,0.000042484393,0.000012544812,0.000014658765,0.000008339214,0.00034273582,0.0097856615,0.0000018666481,0.8921299,0.00007207747,0.09755859],"study_design_scores_gemma":[0.00026465862,0.00011982521,0.00004619997,0.0000951873,0.0000027225758,0.000006719359,1.184127e-7,0.06580897,0.000079327256,0.8808978,0.052127566,0.0005508693],"about_ca_topic_score_codex":0.00006376115,"about_ca_topic_score_gemma":0.00011165617,"teacher_disagreement_score":0.9062639,"about_ca_system_score_codex":0.00050164806,"about_ca_system_score_gemma":0.00010627759,"threshold_uncertainty_score":0.99988794},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000539489,0.00041474725,0.9945178,0.0006465267,0.0020512904,0.0012377443,0.0000029941893,0.000121575154,0.0004678505],"genre_scores_gemma":[0.03816442,0.000047442158,0.96047455,0.0007414693,0.0003915124,0.000032823104,0.0000013755202,0.000040933483,0.000105454084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553776,0.00018396735,0.0008631128,0.0014150817,0.0011566409,0.00084341096],"domain_scores_gemma":[0.9969766,0.00034492786,0.00040556092,0.0018072767,0.0003051114,0.000160481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002833541,0.0005209413,0.0005169027,0.0008188274,0.00031249985,0.00083278026,0.0036527263,0.0002502596,0.000004089872],"category_scores_gemma":[0.00014497101,0.0004047373,0.00007160346,0.0013444368,0.00038695775,0.0008525591,0.0014832693,0.0009111688,0.000049230202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005059423,0.000024749663,0.000026989146,0.00005988522,0.0000041144003,0.000020675616,0.0024550804,0.7860008,0.00034381697,0.012657025,0.000004074368,0.19839773],"study_design_scores_gemma":[0.00013670209,0.00011130538,0.00004194594,0.0007992864,0.000005012581,0.00006652527,7.349398e-7,0.980942,0.0017611638,0.014348993,0.001261449,0.00052486995],"about_ca_topic_score_codex":0.000106553685,"about_ca_topic_score_gemma":0.00009643481,"teacher_disagreement_score":0.19787285,"about_ca_system_score_codex":0.00076548336,"about_ca_system_score_gemma":0.00058901205,"threshold_uncertainty_score":0.99984044},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024571808,0.000550935,0.9947765,0.00014361161,0.0019838985,0.0005212618,0.0000063118055,0.0003166289,0.0014551478],"genre_scores_gemma":[0.22897199,0.00005816298,0.7688221,0.001025105,0.0008115877,0.000010678844,0.000014473137,0.000075196396,0.00021073356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99538004,0.000039285947,0.0006921635,0.0018729102,0.00065771537,0.0013578918],"domain_scores_gemma":[0.997048,0.0009649657,0.0003581192,0.0010507967,0.00034446677,0.00023363561],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016326004,0.0007079924,0.000681367,0.00072925846,0.0005177094,0.0012803773,0.0019995521,0.00059061404,0.000004176178],"category_scores_gemma":[0.000053507567,0.00066086993,0.00014002461,0.00070144597,0.0004927428,0.0006253833,0.0014066548,0.0010417701,0.000002921786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010824074,0.000016505677,0.000028224198,0.00003089514,0.000009943726,0.0000388883,0.00061949034,0.7843141,0.000035768353,0.018789664,0.0000067127985,0.19609897],"study_design_scores_gemma":[0.0003817248,0.000125118,0.000029189667,0.0005555618,0.00000918195,0.00007652677,0.0000035746025,0.9908381,0.00009883238,0.00631965,0.00084856123,0.0007139978],"about_ca_topic_score_codex":0.000023722894,"about_ca_topic_score_gemma":0.0006659558,"teacher_disagreement_score":0.22872627,"about_ca_system_score_codex":0.0002544589,"about_ca_system_score_gemma":0.00029834866,"threshold_uncertainty_score":0.9997564},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006189694,0.00054743263,0.9943597,0.00035193382,0.0019119629,0.0008389662,0.00038243417,0.00020462785,0.0013968073],"genre_scores_gemma":[0.007763284,0.000033781733,0.990394,0.0007639227,0.00051807106,0.00004509301,0.00015531338,0.000045367004,0.00028116323],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99567026,0.000023489798,0.0006211821,0.0019179219,0.00094676175,0.0008203716],"domain_scores_gemma":[0.9965102,0.0005488795,0.00036000428,0.0021411688,0.0002324243,0.00020733404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077878416,0.0006434495,0.00066866964,0.0005948495,0.00041064157,0.00031646166,0.002966205,0.00028061747,0.000016352144],"category_scores_gemma":[0.00021821438,0.0005586528,0.00016984387,0.000387839,0.0006865879,0.0014194581,0.0016036177,0.00051485986,0.0000356389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014580511,0.00003439683,0.0000097088,0.0001354307,0.000018075485,0.00011344128,0.00054445694,0.014586537,0.00032027852,0.4629582,0.00010824619,0.52115667],"study_design_scores_gemma":[0.0018538533,0.00056766777,0.00007894957,0.0016805636,0.000026557778,0.00024024933,0.0000013070859,0.2907291,0.007662792,0.63670105,0.057977494,0.0024803951],"about_ca_topic_score_codex":0.00007656525,"about_ca_topic_score_gemma":0.00048701113,"teacher_disagreement_score":0.5186763,"about_ca_system_score_codex":0.00031758682,"about_ca_system_score_gemma":0.00087360945,"threshold_uncertainty_score":0.9996865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001693241,0.007885086,0.9853141,0.0011471376,0.0023992884,0.00051475706,0.000003772012,0.00017480613,0.0023917542],"genre_scores_gemma":[0.6180037,0.0026137405,0.37670422,0.0006611294,0.0012515786,0.000049424063,0.000008242239,0.00012605409,0.00058190495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99419194,0.00008310121,0.00084088894,0.0023026094,0.0014191788,0.0011623022],"domain_scores_gemma":[0.9969168,0.0006213165,0.0002218335,0.0017573705,0.00028925648,0.00019346527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014328144,0.00067603734,0.0006642929,0.0016048503,0.00013801902,0.00049598725,0.005005775,0.00039590042,0.00002337033],"category_scores_gemma":[0.000103510145,0.0006402163,0.00015606763,0.00076549884,0.00095349544,0.0007276201,0.0019725726,0.0016440492,0.00022953747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030817969,0.000087899796,0.0001669654,0.00004333395,0.0000032161258,0.0001147668,0.0014737742,0.07236776,0.000042534524,0.015287263,0.000017674836,0.91039175],"study_design_scores_gemma":[0.00017579607,0.00013383963,0.0008656293,0.00081121875,0.0000035042688,0.000042112068,7.399001e-7,0.90019965,0.0027119233,0.08842378,0.005587554,0.0010442466],"about_ca_topic_score_codex":0.00012264689,"about_ca_topic_score_gemma":0.0010969024,"teacher_disagreement_score":0.9093475,"about_ca_system_score_codex":0.0005507619,"about_ca_system_score_gemma":0.0006136683,"threshold_uncertainty_score":0.99960494},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005798237,0.00030394775,0.99690235,0.0012605672,0.00035872552,0.0008462054,0.000018898249,0.00007184212,0.00017950196],"genre_scores_gemma":[0.20210458,0.00026791455,0.79490215,0.0016251935,0.0003788884,0.00035483306,0.0000627053,0.00007215467,0.00023156483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966778,0.00003426469,0.00066897564,0.0013645476,0.0005852762,0.000669128],"domain_scores_gemma":[0.99674594,0.001542742,0.0002928601,0.0011451099,0.000058035494,0.00021528729],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014258069,0.00041900866,0.0004535659,0.000513579,0.00023186998,0.0002090001,0.0014094727,0.00023389942,0.0000041734297],"category_scores_gemma":[0.0001594342,0.00041193984,0.000053547672,0.00026834346,0.0005385908,0.00030228592,0.001158007,0.00042890746,0.000014140735],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004105268,0.000114632094,0.00034732575,0.000083968385,0.0000062996064,0.000013478246,0.0006412239,0.006792655,0.000069691305,0.013439141,0.000040502713,0.97844696],"study_design_scores_gemma":[0.0019814104,0.00041978684,0.053088572,0.0012447835,0.00005002372,0.0002842586,0.000001339906,0.5537148,0.0033208656,0.23071763,0.1508376,0.0043388987],"about_ca_topic_score_codex":0.00003916661,"about_ca_topic_score_gemma":0.00017629575,"teacher_disagreement_score":0.9741081,"about_ca_system_score_codex":0.00048115128,"about_ca_system_score_gemma":0.00039801322,"threshold_uncertainty_score":0.9998332},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001314604,0.00030336087,0.99412924,0.00067437487,0.00316523,0.000340777,0.0000011101652,0.00066920486,0.0005852503],"genre_scores_gemma":[0.045939904,0.000037782484,0.9518492,0.0016749225,0.00035704763,0.000018537805,0.0000031392867,0.000049308954,0.00007011935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960885,0.000050798262,0.00051131204,0.0017416083,0.0009395242,0.00066823454],"domain_scores_gemma":[0.9969116,0.0008331941,0.00024243513,0.0016382124,0.00021172261,0.00016282253],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085689634,0.00067334814,0.0005551315,0.0008991991,0.00022099631,0.00036371904,0.003448716,0.00034932035,0.000021647058],"category_scores_gemma":[0.00026997426,0.00063953834,0.00012050192,0.0006307717,0.0003058655,0.00070516404,0.0017186789,0.0009921138,0.000104147686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048752504,0.000014221321,0.0000010103191,0.000032349893,0.0000053910308,0.000038529666,0.0023770882,0.6661378,0.0006751585,0.010893643,0.00000284786,0.3198171],"study_design_scores_gemma":[0.0004647822,0.0005287617,0.000040481656,0.0017917651,0.000005902175,0.00006748787,0.000001715319,0.2764679,0.019217163,0.6991446,0.00076459424,0.0015048241],"about_ca_topic_score_codex":0.000026989823,"about_ca_topic_score_gemma":0.000021152211,"teacher_disagreement_score":0.68825096,"about_ca_system_score_codex":0.0013880846,"about_ca_system_score_gemma":0.00032577728,"threshold_uncertainty_score":0.9996056},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74514544,0.0020463204,0.100431114,0.00884006,0.027639003,0.006340787,0.001194948,0.0011092146,0.107253134],"genre_scores_gemma":[0.99538016,0.000074062555,0.00078843633,0.00042851875,0.0027784738,0.000010251534,0.000044518016,0.00003284045,0.0004627501],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9962145,0.00017617321,0.00054805673,0.0009672455,0.001386324,0.0007076648],"domain_scores_gemma":[0.9887991,0.009760125,0.0004527471,0.0004751064,0.0002648153,0.0002481201],"candidate_categories":["metaresearch","metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0047948,0.0004118761,0.0005270643,0.00040749638,0.0010808259,0.0006959523,0.0011759883,0.00039993634,0.000016372042],"category_scores_gemma":[0.0098311575,0.00033574595,0.000051014413,0.0004142794,0.003380864,0.00026046572,0.0003768198,0.0012406191,0.000024857167],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021589616,0.00002787715,0.1483582,0.000056234763,0.000022209506,0.000023607583,0.026553212,0.000004941648,6.532574e-7,0.009857871,0.000033209864,0.8150404],"study_design_scores_gemma":[0.0001965705,0.000108526394,0.9584459,0.00110354,0.000056953675,0.0000035909218,0.000033237626,0.00008052438,0.000009609042,0.03557922,0.0035635906,0.0008187101],"about_ca_topic_score_codex":0.00007105862,"about_ca_topic_score_gemma":0.00020695789,"teacher_disagreement_score":0.8142217,"about_ca_system_score_codex":0.00017884196,"about_ca_system_score_gemma":0.0005409888,"threshold_uncertainty_score":0.99990946},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006834212,0.001205567,0.9651045,0.0007635007,0.000781425,0.00030251336,0.0000060318084,0.0005583628,0.030594664],"genre_scores_gemma":[0.12695901,0.0005059916,0.8695622,0.0022640524,0.0003738124,0.0000069041216,0.0000027591116,0.000036808487,0.0002884516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627054,0.00003631436,0.00061110937,0.0016253645,0.00067289063,0.00078379444],"domain_scores_gemma":[0.9978757,0.00052611186,0.00023704008,0.0011221273,0.00011775501,0.00012129311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068808004,0.00060586166,0.0006477992,0.0005320944,0.0003553741,0.000954207,0.0020468717,0.00038317093,0.000039296057],"category_scores_gemma":[0.000076502445,0.00054828945,0.00010956112,0.00039513546,0.0013372309,0.0009853744,0.0014061326,0.0007340206,0.000022856582],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041055996,0.00001100196,0.00011026283,0.000047320384,0.000012391034,0.00024349762,0.0017730368,0.0005032398,0.0024890583,0.009325018,0.00006534899,0.9854157],"study_design_scores_gemma":[0.00093727716,0.00051363936,0.0002506964,0.0041100867,0.00004376042,0.0020904485,0.0000039760926,0.5798383,0.023494234,0.30721307,0.07802371,0.0034807976],"about_ca_topic_score_codex":0.00004375088,"about_ca_topic_score_gemma":0.0000878465,"teacher_disagreement_score":0.9819349,"about_ca_system_score_codex":0.00013853985,"about_ca_system_score_gemma":0.0005070385,"threshold_uncertainty_score":0.99969685},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049090104,0.00017966772,0.9957329,0.000105848536,0.00029565455,0.00029073656,0.000003512638,0.0003057457,0.0030368422],"genre_scores_gemma":[0.2796804,0.00009546415,0.7175058,0.0019375447,0.00032306483,0.00004337465,0.000043399697,0.00013738868,0.00023357265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810827,0.000020977834,0.00029370384,0.00068517803,0.00059392396,0.00029795142],"domain_scores_gemma":[0.9988301,0.00022930063,0.00011161744,0.00064105703,0.00010706528,0.00008088459],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021218459,0.0003343619,0.00034453243,0.0005193538,0.0000739479,0.00007141647,0.00045352345,0.00019403573,0.000041386465],"category_scores_gemma":[0.000104303756,0.00029985222,0.00010312023,0.00048812467,0.00025535363,0.00016721412,0.00007424281,0.0005450278,0.000020889429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000632622,0.00001547746,0.00004831431,0.000028617706,0.0000067854894,0.00007748134,0.000043598953,0.7009691,0.00015112317,0.00033162412,0.00012903016,0.29819253],"study_design_scores_gemma":[0.00012029951,0.00011852918,0.000033445725,0.00044548753,0.000011935934,0.0000066150246,5.750237e-8,0.95060986,0.012547389,0.034192905,0.0014543983,0.00045906915],"about_ca_topic_score_codex":0.0000030251033,"about_ca_topic_score_gemma":0.0000034182403,"teacher_disagreement_score":0.29773346,"about_ca_system_score_codex":0.00029904032,"about_ca_system_score_gemma":0.00003388971,"threshold_uncertainty_score":0.99994534},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059003414,0.0003365611,0.9936793,0.0004267369,0.0019901379,0.0004549534,0.000026881513,0.00015121134,0.002875254],"genre_scores_gemma":[0.069916494,0.00007044549,0.9252137,0.0030083673,0.0009048206,0.000020278136,0.000043114047,0.000069708636,0.0007530586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99475944,0.00005733023,0.00065608183,0.002030447,0.001607149,0.00088954216],"domain_scores_gemma":[0.9965328,0.00044745032,0.00034660017,0.002202462,0.00014388301,0.00032682208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008838728,0.0006758035,0.0006539494,0.00058494176,0.00036510982,0.0006153317,0.0042892923,0.00028270012,0.000033893797],"category_scores_gemma":[0.000055885717,0.00059533387,0.00014908904,0.00044821974,0.0004239681,0.00082069536,0.00255117,0.0006713977,0.00011552843],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003382379,0.0000566289,0.0007675457,0.00002598668,0.00002928886,0.00012961947,0.0003448705,0.008262157,0.00015797939,0.00954565,0.0003537047,0.9803232],"study_design_scores_gemma":[0.0021858905,0.0004755518,0.00067476794,0.0011049758,0.00003902373,0.000112482645,2.99385e-7,0.5643203,0.009740054,0.34767875,0.07068756,0.0029803175],"about_ca_topic_score_codex":0.000045307406,"about_ca_topic_score_gemma":0.00001724539,"teacher_disagreement_score":0.97734284,"about_ca_system_score_codex":0.00042481857,"about_ca_system_score_gemma":0.00027989055,"threshold_uncertainty_score":0.9996498},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029102093,0.0009768422,0.9906263,0.0016535204,0.001852696,0.00046352422,0.000007884893,0.00051869755,0.0036095371],"genre_scores_gemma":[0.23411477,0.00021622915,0.757444,0.0039654975,0.0023679982,0.000015325379,0.000015256755,0.00016280574,0.0016981135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99366134,0.000098772834,0.00085669395,0.0027405932,0.0014830634,0.0011595578],"domain_scores_gemma":[0.9953753,0.0006684487,0.0004382662,0.002833486,0.00034299275,0.000341525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014007757,0.00088405644,0.0009274097,0.0010282223,0.0005059083,0.00086576364,0.0053092926,0.0004775022,0.00008303921],"category_scores_gemma":[0.00022839972,0.00078039814,0.00031688882,0.001169993,0.00092220627,0.0004750052,0.002382221,0.001972154,0.00017326663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040725417,0.000057126927,0.00006543584,0.00008407659,0.000015895217,0.00021585746,0.00067206804,0.042359546,0.000039654362,0.030089004,0.000104747065,0.92629254],"study_design_scores_gemma":[0.00020514532,0.00019341876,0.00022110408,0.0004274054,0.0000067715782,0.00014146455,4.9192327e-8,0.82532114,0.00012213939,0.16719167,0.0053615114,0.0008081996],"about_ca_topic_score_codex":0.000019414863,"about_ca_topic_score_gemma":0.0000071844634,"teacher_disagreement_score":0.9254843,"about_ca_system_score_codex":0.00034529518,"about_ca_system_score_gemma":0.0003611165,"threshold_uncertainty_score":0.9994647},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029444785,0.0008960001,0.99169546,0.0008093654,0.0012145182,0.00047139166,0.000005198059,0.00025024416,0.0043633822],"genre_scores_gemma":[0.24529421,0.000456651,0.7446695,0.0036985266,0.002203475,0.000049094913,0.000016405267,0.00014708018,0.0034650469],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99463516,0.00007061971,0.0005553301,0.0019577376,0.0017808632,0.0010002932],"domain_scores_gemma":[0.9964374,0.00075893983,0.00030116606,0.0019524976,0.0002909147,0.00025913518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001221425,0.0006205659,0.0005501081,0.0020873176,0.00036805554,0.0006861985,0.0050691315,0.0003788681,0.00006960019],"category_scores_gemma":[0.00013113415,0.00057911157,0.0002065981,0.0011335422,0.0012565511,0.0022501359,0.0018541166,0.0011838401,0.00012935472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008398217,0.00003351427,0.000033076416,0.000022681907,0.000010748012,0.000074838536,0.00024059627,0.010572488,0.00031498692,0.4197222,0.000036865018,0.5689296],"study_design_scores_gemma":[0.0003516309,0.00016443193,0.0003180803,0.00019233584,0.000004967811,0.000050766503,8.8100926e-8,0.12279938,0.0016574705,0.86939234,0.0043471144,0.00072140543],"about_ca_topic_score_codex":0.0000069954963,"about_ca_topic_score_gemma":0.000057502686,"teacher_disagreement_score":0.56820816,"about_ca_system_score_codex":0.00050561083,"about_ca_system_score_gemma":0.0005242676,"threshold_uncertainty_score":0.99966604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002138387,0.0009025492,0.9848548,0.00014463908,0.011248829,0.0016160214,0.000017684768,0.0006520577,0.00054203556],"genre_scores_gemma":[0.07433936,0.000009564058,0.9172657,0.0003319861,0.0035430794,0.000120625686,0.000011472003,0.00015015891,0.0042280243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99351746,0.00010858503,0.0011255054,0.0025415807,0.0013870472,0.001319825],"domain_scores_gemma":[0.99562347,0.0008716059,0.0007490521,0.0018655078,0.0005628834,0.0003274627],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015394181,0.0010502989,0.0011644965,0.0012812791,0.00067812594,0.0014832328,0.003903394,0.0005349815,0.000004209],"category_scores_gemma":[0.00006649163,0.0009531883,0.000422659,0.0005332429,0.00029335378,0.00036967715,0.0008388557,0.0011857152,0.000070712194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062794543,0.000041063322,0.000030102343,0.0006841331,0.000034621797,0.0001361311,0.0006381163,0.84195954,0.000115233954,0.05349764,0.000023500923,0.10283364],"study_design_scores_gemma":[0.00051604275,0.0003185947,0.000018311974,0.0032705916,0.00001578852,0.00012041141,6.899531e-7,0.95940787,0.0003380236,0.00032402543,0.034636687,0.001032939],"about_ca_topic_score_codex":0.00007041978,"about_ca_topic_score_gemma":0.000012864206,"teacher_disagreement_score":0.11744836,"about_ca_system_score_codex":0.0012471953,"about_ca_system_score_gemma":0.00039904416,"threshold_uncertainty_score":0.9995533},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017279675,0.0009140226,0.99156517,0.0014521009,0.0024543065,0.00034814986,0.00000931988,0.0001840457,0.0013448907],"genre_scores_gemma":[0.19047175,0.0001376594,0.8049456,0.0010162112,0.0009293973,0.000017557752,0.000040971223,0.000034968725,0.0024059196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603206,0.000055749555,0.000462587,0.0015537678,0.0013554525,0.0005404134],"domain_scores_gemma":[0.99753994,0.00037576954,0.00026154108,0.0012005657,0.00041127673,0.00021091364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006240597,0.00046144985,0.00042080318,0.0005800561,0.00077100436,0.0005820181,0.0020957417,0.00027229585,0.00004569203],"category_scores_gemma":[0.00009740669,0.00045045395,0.00017812778,0.0007649628,0.0008361388,0.0010396542,0.0012922012,0.00067860604,0.00007202039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007816015,0.00006261084,0.00005840147,0.000019714551,0.000022087359,0.000076817625,0.00076619163,0.68426764,0.00007113864,0.008893069,0.000909084,0.30484542],"study_design_scores_gemma":[0.0002166401,0.00013294746,0.0007069746,0.00011776563,0.000008429606,0.00030577925,1.2711887e-7,0.9502774,0.0010530925,0.031501193,0.015036939,0.00064272416],"about_ca_topic_score_codex":0.00003220798,"about_ca_topic_score_gemma":0.000024495028,"teacher_disagreement_score":0.3042027,"about_ca_system_score_codex":0.00025730723,"about_ca_system_score_gemma":0.0010878866,"threshold_uncertainty_score":0.9997947},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017156343,0.00019744027,0.9967602,0.0007583945,0.00080195884,0.0006787426,0.000005671594,0.00013076175,0.00049525814],"genre_scores_gemma":[0.57408726,0.00003302987,0.42505202,0.00049937615,0.0001005624,0.000013198743,0.000006570482,0.000028852439,0.00017912073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972336,0.000025318357,0.00038675693,0.0012404297,0.00061838335,0.00049551],"domain_scores_gemma":[0.99822056,0.00065798085,0.00012905187,0.00059878617,0.00023054321,0.00016307515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007016279,0.00034497923,0.00033205366,0.0005917397,0.00029345043,0.00053573755,0.00092292606,0.00022575844,0.000017107877],"category_scores_gemma":[0.00008732358,0.00032645094,0.0000810378,0.00035387866,0.00085943093,0.00021774127,0.00053900585,0.00046398843,0.000011011017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020392652,0.0000088420065,0.000008519038,0.000038784758,0.0000026973128,0.000005600685,0.00038701156,0.4685925,0.0000104154005,0.010039081,0.000001165245,0.52090335],"study_design_scores_gemma":[0.00025023308,0.000080268714,0.00009835191,0.00020835806,0.000006073767,0.000060869104,3.261596e-7,0.9835444,0.000056559835,0.015182859,0.00015416478,0.00035752414],"about_ca_topic_score_codex":0.000006740942,"about_ca_topic_score_gemma":0.00002624178,"teacher_disagreement_score":0.5739157,"about_ca_system_score_codex":0.0003611712,"about_ca_system_score_gemma":0.0002568035,"threshold_uncertainty_score":0.99991876},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016711214,0.00071612664,0.9951665,0.00012325331,0.001460371,0.0010992403,0.00005508753,0.00064548943,0.0007172188],"genre_scores_gemma":[0.036263492,0.00006516025,0.96158034,0.0005064866,0.00088617275,0.00026406843,0.00006949148,0.00006593732,0.00029885152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951299,0.00006163751,0.000714482,0.002303979,0.0010837417,0.0007062554],"domain_scores_gemma":[0.9953341,0.0004813747,0.00051358336,0.002911053,0.0005180837,0.00024180593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000729917,0.000596449,0.00059823156,0.00087140594,0.00033912982,0.0008962621,0.0046828245,0.00035779126,0.000011016292],"category_scores_gemma":[0.00006122281,0.0005490821,0.0001445049,0.000542341,0.00045071027,0.0013890028,0.0012122707,0.0004856137,0.000010489159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009652234,0.000071446695,0.0000016452369,0.000040866336,0.0000061206206,0.000023950348,0.00031661786,0.3751878,0.002210289,0.057924252,0.0001977035,0.5640096],"study_design_scores_gemma":[0.00021130075,0.0002692706,0.0000029278754,0.00027352394,0.000005920071,0.000048319387,4.1035773e-7,0.9293816,0.011346874,0.045533795,0.012294128,0.000631901],"about_ca_topic_score_codex":0.000027326963,"about_ca_topic_score_gemma":0.00001746011,"teacher_disagreement_score":0.56337774,"about_ca_system_score_codex":0.0003899955,"about_ca_system_score_gemma":0.0003221932,"threshold_uncertainty_score":0.9996961},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020929002,0.0023431294,0.9833624,0.00028646915,0.00093321817,0.0003940013,0.000018400899,0.00002435051,0.010545168],"genre_scores_gemma":[0.79745275,0.0034416553,0.18844631,0.0019955274,0.004533745,0.00006656499,0.00037612332,0.00015100803,0.0035362835],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983086,0.000007791981,0.00019516473,0.00086523115,0.0003381463,0.00028505168],"domain_scores_gemma":[0.99897915,0.000025012043,0.00013984142,0.00068892376,0.00009624033,0.00007085859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021313128,0.0002728114,0.00018569076,0.00015872497,0.00011453542,0.00007328201,0.0007489163,0.00025792676,0.000025795702],"category_scores_gemma":[0.000029676741,0.0002443678,0.00006599075,0.00009320144,0.00044189824,0.000007887155,0.00021495912,0.0003233718,0.000033006978],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002669056,0.000036795973,0.00008264679,0.00004332112,0.000013922768,0.000008684005,0.00008519169,0.005135009,0.18419556,0.0007935967,0.00000593925,0.80957264],"study_design_scores_gemma":[0.00098783,0.0017519778,0.0017567038,0.00031057856,0.00003715751,0.00005485814,6.371037e-7,0.0040093814,0.20516783,0.09240792,0.6909055,0.002609628],"about_ca_topic_score_codex":0.0000016783227,"about_ca_topic_score_gemma":0.00006641534,"teacher_disagreement_score":0.806963,"about_ca_system_score_codex":0.00004559318,"about_ca_system_score_gemma":0.00010689472,"threshold_uncertainty_score":0.996503},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009261517,0.00023341362,0.9899282,0.0004304487,0.00074292964,0.0009411378,0.000028265466,0.00014841073,0.0074546197],"genre_scores_gemma":[0.42061868,0.0006347097,0.5725683,0.002081134,0.0003636427,0.00015983313,0.0013528367,0.000067755536,0.0021531212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971169,0.000043362903,0.0006534825,0.000918538,0.0006679937,0.0005996827],"domain_scores_gemma":[0.9979909,0.0003585776,0.0003557273,0.0009272652,0.00026062812,0.000106921434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008977597,0.0004299446,0.0004428619,0.00080270896,0.00028993023,0.0004316288,0.0018560356,0.0003013886,0.000009657477],"category_scores_gemma":[0.00011449187,0.0004082576,0.00011109112,0.00066887826,0.00028900435,0.00088828406,0.00071638206,0.0004179743,0.000055617846],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004297622,0.00005956228,0.0001720933,0.00020126077,0.000014573975,0.000041962376,0.0018915812,0.035283186,0.000025719131,0.028180223,0.00061975763,0.9334671],"study_design_scores_gemma":[0.0010594731,0.00015220458,0.003809463,0.0004050662,0.000005131972,0.00006415378,5.890365e-7,0.8734603,0.00006377588,0.031391453,0.08869346,0.00089494797],"about_ca_topic_score_codex":0.000018699198,"about_ca_topic_score_gemma":0.00036517112,"teacher_disagreement_score":0.9325721,"about_ca_system_score_codex":0.00055177865,"about_ca_system_score_gemma":0.00019877122,"threshold_uncertainty_score":0.9998369},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002275302,0.004518686,0.9899725,0.002031826,0.0009683346,0.000877932,0.000011166963,0.0007176579,0.0008996462],"genre_scores_gemma":[0.0026194546,0.000045597393,0.99318516,0.0027474577,0.0008023977,0.00004986878,0.0000060035004,0.000052810145,0.000491232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950109,0.00005682912,0.0006725253,0.002154493,0.0011311321,0.0009741252],"domain_scores_gemma":[0.99611205,0.0009582233,0.00044391083,0.0018127427,0.00045534523,0.0002177159],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020806093,0.00069521315,0.00070218975,0.00071764685,0.000429818,0.0010527952,0.0054048877,0.0004961998,0.0000170612],"category_scores_gemma":[0.00034747794,0.0006162753,0.00023185594,0.0006282793,0.00039416083,0.0008653097,0.0021479921,0.0010779195,0.000013601223],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088838615,0.000024285611,0.000007394277,0.00007371428,0.000009854022,0.000042481544,0.0004120879,0.0015631705,0.00037557216,0.044048097,0.00016179348,0.95327264],"study_design_scores_gemma":[0.0002777784,0.000227428,0.000012687985,0.0006102545,0.000014634156,0.00008329563,8.782737e-8,0.55621237,0.010521367,0.42086354,0.010263778,0.00091278914],"about_ca_topic_score_codex":0.000051701572,"about_ca_topic_score_gemma":0.000096361146,"teacher_disagreement_score":0.95235986,"about_ca_system_score_codex":0.00068253203,"about_ca_system_score_gemma":0.0006828807,"threshold_uncertainty_score":0.9999842},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004992663,0.0004143413,0.9896368,0.005186647,0.0014558323,0.001157255,0.000010146907,0.00013983437,0.0019941647],"genre_scores_gemma":[0.00907398,0.000042892545,0.9828745,0.0058577624,0.0010959781,0.00010238925,0.000011276959,0.000037967406,0.0009032214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967317,0.000026828991,0.00050328946,0.0012437261,0.0008840444,0.00061043294],"domain_scores_gemma":[0.99685746,0.0011250521,0.0002733263,0.0013881264,0.00026218212,0.00009382511],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001000996,0.00046661453,0.0003928866,0.0004334112,0.00059292564,0.0009209684,0.0037415568,0.00023830691,0.0000344756],"category_scores_gemma":[0.000058938287,0.00034399907,0.00021327862,0.0005095604,0.00067417324,0.00078667724,0.0009303074,0.0006462434,0.000049035072],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047068947,0.000022086142,0.000003852768,0.000030981148,0.000015366075,0.0000039289926,0.0005508894,0.020102132,0.00002802292,0.11256496,0.00025038453,0.8664227],"study_design_scores_gemma":[0.00022251201,0.00007996363,0.00002620957,0.00010884051,0.000008824654,0.000022946528,6.845559e-8,0.6735702,0.0002746866,0.30793074,0.017414061,0.0003409768],"about_ca_topic_score_codex":0.000008582902,"about_ca_topic_score_gemma":0.000039866944,"teacher_disagreement_score":0.8660817,"about_ca_system_score_codex":0.00020556281,"about_ca_system_score_gemma":0.00035911094,"threshold_uncertainty_score":0.9999012},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024345767,0.00091407803,0.99626225,0.00005787526,0.0016489538,0.00020389276,0.000004819818,0.00014763663,0.0005170139],"genre_scores_gemma":[0.0444719,0.0000074259333,0.9550344,0.00019720334,0.00022289473,0.0000018602342,0.0000076203128,0.000029979414,0.000026754076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566466,0.00018460196,0.0008325048,0.0013954878,0.001114748,0.0008080146],"domain_scores_gemma":[0.99610776,0.00097322924,0.0008249311,0.001642665,0.00023802221,0.00021340992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036968507,0.00055652065,0.0010836764,0.0033918023,0.00025653452,0.00026359156,0.0028764307,0.00039397276,0.0000073329575],"category_scores_gemma":[0.00020251241,0.0005397569,0.00030549546,0.002398315,0.00044841584,0.000948293,0.001202925,0.0009183715,0.0000036573117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013916778,0.000012185468,0.00062529446,0.000018773108,0.00010021881,0.000019539313,0.0019291021,0.641885,0.0005041696,0.0010426289,5.388026e-7,0.35386115],"study_design_scores_gemma":[0.0000949865,0.000043597003,0.0011801054,0.00037241387,0.00020570804,0.000036955276,5.084997e-7,0.99038213,0.0009955355,0.006125362,0.000043720123,0.0005189442],"about_ca_topic_score_codex":0.00009062282,"about_ca_topic_score_gemma":0.0000040372274,"teacher_disagreement_score":0.3533422,"about_ca_system_score_codex":0.0004772454,"about_ca_system_score_gemma":0.00028434343,"threshold_uncertainty_score":0.9997054},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075929624,0.00043201525,0.9954996,0.0009068632,0.0009838602,0.0007425583,0.000026927319,0.00008386206,0.0005649991],"genre_scores_gemma":[0.16015394,0.000047224814,0.8371925,0.0015667103,0.0003551492,0.000054036307,0.00009592886,0.000024874484,0.0005096477],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735546,0.000030099221,0.00043363773,0.0012216126,0.0005718476,0.00038733374],"domain_scores_gemma":[0.9977184,0.0009508672,0.00019579854,0.00062837405,0.00035158466,0.00015496225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066596305,0.0003532724,0.00033628734,0.0006359352,0.0002574875,0.000424557,0.000997461,0.00018306736,0.000033061384],"category_scores_gemma":[0.00011600731,0.00033057088,0.00007912278,0.00038319314,0.00040452628,0.00063523033,0.00047458857,0.00028946868,0.000019155204],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011630152,0.000032587744,0.00004832486,0.00010737677,0.0000143112065,0.000009845067,0.00062301743,0.049121127,0.0001802172,0.1386705,0.00029021804,0.81089085],"study_design_scores_gemma":[0.00022190965,0.00018292057,0.00056422624,0.000058009682,0.0000049659297,0.00004106378,1.281837e-7,0.46004757,0.000234036,0.5368236,0.0015006105,0.00032099313],"about_ca_topic_score_codex":0.0000141867395,"about_ca_topic_score_gemma":0.000023619987,"teacher_disagreement_score":0.8105698,"about_ca_system_score_codex":0.000100070676,"about_ca_system_score_gemma":0.00030346386,"threshold_uncertainty_score":0.99991465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016515633,0.0004014556,0.9963391,0.00043246776,0.0008839746,0.0008526297,0.000012556443,0.00048016055,0.0005811377],"genre_scores_gemma":[0.0021568073,0.00014673069,0.99461544,0.0024278169,0.00030615,0.00006751599,0.000015480979,0.000036621448,0.0002274132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996292,0.000034563855,0.00066564087,0.0014059125,0.00091015664,0.00069175893],"domain_scores_gemma":[0.9972086,0.0007196767,0.00036509312,0.0009828716,0.00048225006,0.0002415189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084863976,0.0004619195,0.0005312534,0.0007746241,0.0004140893,0.0005262327,0.002270298,0.00025336872,0.000023583456],"category_scores_gemma":[0.00038289666,0.00044679004,0.0001837718,0.00047603872,0.0009682419,0.00088525505,0.00063744234,0.00059823506,0.00002312918],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000872688,0.000059995098,0.000012904312,0.00006798313,0.000015539068,0.00019555523,0.0010542131,0.0016313965,0.002955066,0.0019519107,0.00063819275,0.9914085],"study_design_scores_gemma":[0.0018177254,0.00064801786,0.000014214072,0.0013253557,0.000026766944,0.0003003797,6.826024e-7,0.73626506,0.12956505,0.124605894,0.0035869435,0.0018439265],"about_ca_topic_score_codex":0.000019218602,"about_ca_topic_score_gemma":0.000021590193,"teacher_disagreement_score":0.9895646,"about_ca_system_score_codex":0.00018643298,"about_ca_system_score_gemma":0.0003848347,"threshold_uncertainty_score":0.99979836},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018195563,0.00050314976,0.9920377,0.000033808745,0.0017429341,0.00088501605,0.0000052506475,0.00017171803,0.004438454],"genre_scores_gemma":[0.18727551,0.0001298616,0.80825394,0.002622151,0.0008605304,0.00005243294,0.000016622931,0.00009111051,0.0006978144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949986,0.00009171051,0.0008002043,0.0017959465,0.0014713276,0.00084221107],"domain_scores_gemma":[0.995741,0.0004514213,0.0005029935,0.0028138426,0.00023625181,0.0002545039],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002843723,0.00058920984,0.0006290453,0.0012616037,0.00016518033,0.00026565534,0.005921317,0.0002950753,0.00010212313],"category_scores_gemma":[0.000025080215,0.00055741396,0.00017403117,0.0008769527,0.00078755553,0.0006167934,0.0016101897,0.000643539,0.00005088191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006224316,0.000056511162,0.000016915763,0.000038039834,0.000015979831,0.000119467004,0.0003881258,0.10064666,0.000040510276,0.02951316,0.000028583674,0.86912984],"study_design_scores_gemma":[0.00041519906,0.0007329935,0.0001559987,0.00038913824,0.000021177817,0.000030228688,5.9586046e-7,0.83434725,0.0021072004,0.15552881,0.005315292,0.0009561426],"about_ca_topic_score_codex":0.000018559325,"about_ca_topic_score_gemma":0.000029501558,"teacher_disagreement_score":0.86817366,"about_ca_system_score_codex":0.00041583608,"about_ca_system_score_gemma":0.00039583506,"threshold_uncertainty_score":0.99968773},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009021621,0.00041687238,0.9880838,0.0005113309,0.0006590905,0.0003488131,0.000020172976,0.00006048245,0.008997296],"genre_scores_gemma":[0.90347064,0.000043927408,0.095902964,0.00042752945,0.000094111354,0.0000015280871,0.0000035904316,0.00002318406,0.000032543106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999075,0.000027269025,0.00023650035,0.00020978627,0.0002721079,0.00017931274],"domain_scores_gemma":[0.99848884,0.0005427837,0.000105768755,0.0006926634,0.000108177504,0.000061774284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001883167,0.00019554318,0.00020689309,0.0003910933,0.00013123256,0.00008398302,0.0009032689,0.00011172465,0.000113722235],"category_scores_gemma":[0.000067267036,0.0001521796,0.000039093764,0.0005066275,0.00022745493,0.00014482232,0.00012162288,0.00052092684,0.000007582666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052508926,0.000020557904,0.000055743716,0.00011169208,0.000050860475,0.0000034449954,0.011148235,0.9211725,0.0055052205,0.015878225,0.00021030061,0.045837957],"study_design_scores_gemma":[0.0002481505,0.00011544815,0.00085274974,0.0010300934,0.00007597402,0.000155019,0.000011604777,0.92199796,0.006714511,0.048869103,0.018894402,0.0010349681],"about_ca_topic_score_codex":0.000010482051,"about_ca_topic_score_gemma":0.000055624965,"teacher_disagreement_score":0.90256846,"about_ca_system_score_codex":0.000061745515,"about_ca_system_score_gemma":0.000066509114,"threshold_uncertainty_score":0.62057036},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052255593,0.0005087866,0.9901675,0.00016424381,0.0033480802,0.00034504072,0.0000680052,0.00021676249,0.0051293327],"genre_scores_gemma":[0.64194685,0.00022497938,0.35063222,0.0038908531,0.0026011884,0.000028669803,0.0003732682,0.0001035724,0.00019839044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959957,0.000031579282,0.00049150747,0.0015298764,0.0012485321,0.0007027951],"domain_scores_gemma":[0.9969713,0.0005689279,0.0002538561,0.0017808008,0.00020574448,0.00021934969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012713713,0.0004925263,0.00043834109,0.0007303281,0.00029774656,0.0007688274,0.0031979885,0.00039291795,0.000010947519],"category_scores_gemma":[0.00008775543,0.00044328367,0.00015237043,0.0008708426,0.00055682106,0.00057108805,0.00090805424,0.000924586,0.000088507964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000756668,0.000033462336,0.000013610771,0.000028583561,0.0000062425156,0.00008935714,0.0001608273,0.005578273,0.000007765055,0.81971514,0.0001355693,0.17422362],"study_design_scores_gemma":[0.00042120228,0.00047748743,0.00023629448,0.0008606384,0.000010845358,0.00013144777,1.6593665e-7,0.36693072,0.0004026583,0.6029498,0.026253788,0.0013249435],"about_ca_topic_score_codex":0.0000402885,"about_ca_topic_score_gemma":0.000046484904,"teacher_disagreement_score":0.64189464,"about_ca_system_score_codex":0.00029999774,"about_ca_system_score_gemma":0.00024457087,"threshold_uncertainty_score":0.9998019},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021968945,0.00027346183,0.9899546,0.0015474038,0.000667181,0.00064296136,0.00006627142,0.00040087823,0.0064252974],"genre_scores_gemma":[0.044835463,0.00005005103,0.9531062,0.0007101952,0.00028751203,0.000043888293,0.00028403217,0.000046040037,0.0006366135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99411565,0.00007921199,0.0009879121,0.0027737615,0.0012934422,0.00075004745],"domain_scores_gemma":[0.9921114,0.0006030814,0.0005519406,0.0063340333,0.00028349302,0.000116068404],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023552545,0.00053915026,0.0005632251,0.001301996,0.00022162922,0.00064997416,0.011176203,0.00036552592,0.000016072852],"category_scores_gemma":[0.00037220665,0.0005453579,0.00006304822,0.0012735759,0.00064946397,0.0014864189,0.0033209764,0.001030739,0.000060847473],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042362917,0.000088686196,0.00024097704,0.000046387686,0.0000067600836,0.000045107936,0.00020059443,0.013121937,0.0021679096,0.039931513,0.00082867726,0.94331723],"study_design_scores_gemma":[0.00026397165,0.000060781957,0.00139664,0.0003527728,0.0000050202,0.00002493938,9.859999e-8,0.896128,0.00118863,0.09670936,0.0032060528,0.0006637413],"about_ca_topic_score_codex":0.000069564936,"about_ca_topic_score_gemma":0.00023145115,"teacher_disagreement_score":0.9426535,"about_ca_system_score_codex":0.0006046802,"about_ca_system_score_gemma":0.001027331,"threshold_uncertainty_score":0.9996998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016345724,0.0002875131,0.9941265,0.00083213876,0.0024391066,0.0003867931,0.000032473396,0.00030894045,0.0014230809],"genre_scores_gemma":[0.22208975,0.000036082107,0.7739437,0.0029669001,0.000810737,0.000016259983,0.0000649493,0.00004516712,0.000026412827],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955986,0.000025435069,0.0005140413,0.0018643317,0.001214293,0.00078328385],"domain_scores_gemma":[0.9963298,0.00039986058,0.00028907333,0.0024434135,0.00027472677,0.0002631183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011060792,0.0006060458,0.00051714526,0.001103757,0.000402919,0.0008386754,0.0046541886,0.00064350857,0.00006728172],"category_scores_gemma":[0.000068272886,0.000565796,0.00024268593,0.00093278295,0.0010041272,0.000894539,0.0012097813,0.0017463225,0.000083407394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024977353,0.0001850527,0.00054070697,0.00011678456,0.000023795048,0.0002703188,0.0005796808,0.010410912,0.0033163878,0.46766067,0.00012995563,0.5167408],"study_design_scores_gemma":[0.0006108099,0.00029073333,0.00044746953,0.000328081,0.00001493784,0.00005084027,6.327869e-8,0.30685064,0.010034088,0.6693547,0.010606593,0.0014110872],"about_ca_topic_score_codex":0.000020577167,"about_ca_topic_score_gemma":0.00017779936,"teacher_disagreement_score":0.5153297,"about_ca_system_score_codex":0.00014518706,"about_ca_system_score_gemma":0.00066497567,"threshold_uncertainty_score":0.9996793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010385401,0.00060706906,0.98662066,0.0008168239,0.0005206781,0.00048636773,0.000010230356,0.00010444231,0.00044833863],"genre_scores_gemma":[0.96492356,0.00015507064,0.03448057,0.00020903464,0.000085385844,0.000025634385,0.0000021885517,0.000019930938,0.00009862801],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752104,0.000028908817,0.00049041345,0.0009117472,0.0004992976,0.0005485846],"domain_scores_gemma":[0.99727803,0.0003988692,0.00033261065,0.0017100339,0.00020267462,0.00007778816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007561923,0.00037758824,0.00042606637,0.00043772729,0.00035247632,0.00018079249,0.0045892787,0.0005969899,0.000010623682],"category_scores_gemma":[0.000052468302,0.0002663954,0.00022176035,0.0005998578,0.0018251195,0.00014667057,0.0013541202,0.0013336594,0.000008743822],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014875848,0.0001602324,0.0018770939,0.00004465931,0.000068584515,0.000082186896,0.0031010413,0.027746161,0.00047945188,0.04620143,0.000097328506,0.920127],"study_design_scores_gemma":[0.00023853025,0.00020449738,0.0012985339,0.000108037806,0.000004389445,0.00007533792,5.108907e-7,0.45044667,0.0036211961,0.54302347,0.0005108735,0.00046796617],"about_ca_topic_score_codex":0.00007485959,"about_ca_topic_score_gemma":0.00017868984,"teacher_disagreement_score":0.95453817,"about_ca_system_score_codex":0.00021982814,"about_ca_system_score_gemma":0.00047411764,"threshold_uncertainty_score":0.99997884},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010208403,0.00051401724,0.99720293,0.00022620871,0.00067898835,0.00031170057,9.852292e-7,0.000530804,0.0004322782],"genre_scores_gemma":[0.05199725,0.00015256485,0.9457865,0.0013609041,0.0006370094,0.0000028433926,0.000003974355,0.00003284284,0.000026149799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703133,0.00004484238,0.00049735286,0.00127359,0.0006111765,0.000541719],"domain_scores_gemma":[0.99837863,0.00015343052,0.00028826567,0.0008568073,0.00016908496,0.00015375689],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00064390694,0.0004612638,0.00042120152,0.00066517084,0.00036616533,0.0012988293,0.0015284278,0.0002541855,0.0000029341556],"category_scores_gemma":[0.000016041102,0.00046112607,0.00009002378,0.00076184655,0.000258126,0.0011045942,0.0012230687,0.00051556085,7.612069e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003788544,0.00003449607,0.000111664456,0.00007605109,0.000015435699,0.00008785828,0.0008199396,0.027765967,0.00014840435,0.24180327,0.000035898207,0.72909725],"study_design_scores_gemma":[0.00009146254,0.00010373883,0.00005552966,0.00016734135,0.0000056625727,0.000073423296,2.9831334e-8,0.82877165,0.00030887013,0.16961361,0.0003927086,0.00041598178],"about_ca_topic_score_codex":0.00000929236,"about_ca_topic_score_gemma":0.000012953821,"teacher_disagreement_score":0.80100566,"about_ca_system_score_codex":0.00012555756,"about_ca_system_score_gemma":0.00019837695,"threshold_uncertainty_score":0.99978405},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012405594,0.00030854202,0.99453205,0.00032997385,0.0012816212,0.000290658,0.0000027488056,0.00013348123,0.0018803531],"genre_scores_gemma":[0.49233145,0.000019335295,0.50632954,0.00023801484,0.0006433808,0.000006206549,0.0000052319356,0.000028380822,0.00039848033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967595,0.00003535265,0.0006722542,0.00097354024,0.0010866394,0.00047271175],"domain_scores_gemma":[0.9977451,0.00037835387,0.00024126115,0.0011794822,0.0003717443,0.00008406838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081539055,0.00035687682,0.00043892418,0.00086790405,0.00013429757,0.0002905904,0.00272076,0.00024213636,0.000035520425],"category_scores_gemma":[0.00008414612,0.00032946217,0.00011248613,0.0006224189,0.0007150637,0.00051018933,0.0007735438,0.00043883323,0.00004822209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.8007026e-7,0.000021989403,0.00003422221,0.000038807375,0.000004982124,0.00002088722,0.00052785,0.19250785,0.0015473345,0.020278139,0.00006103459,0.78495634],"study_design_scores_gemma":[0.000031225143,0.000082592815,0.000040974308,0.00015854849,0.0000034246918,0.000016150854,8.157935e-8,0.91017544,0.04637677,0.042656794,0.00015852909,0.00029946837],"about_ca_topic_score_codex":0.00008075232,"about_ca_topic_score_gemma":0.00008929804,"teacher_disagreement_score":0.7846569,"about_ca_system_score_codex":0.00018540824,"about_ca_system_score_gemma":0.00047999283,"threshold_uncertainty_score":0.9999157},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003372596,0.0024267316,0.9757538,0.015415254,0.001003252,0.00046253917,0.0000025286222,0.00011622787,0.0047859526],"genre_scores_gemma":[0.31158563,0.0016402722,0.66559774,0.016888447,0.00179671,0.000045602927,0.0000032169667,0.000088194196,0.002354211],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99674857,0.00008704857,0.00045103606,0.0014029287,0.0007609853,0.0005494508],"domain_scores_gemma":[0.99688673,0.0008991485,0.00019627108,0.0017103472,0.00016310334,0.00014442774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00179811,0.000471541,0.00052292034,0.00032012953,0.00031570665,0.0006074817,0.0035769495,0.00028598472,0.000039479262],"category_scores_gemma":[0.00012969038,0.00032531208,0.00013227173,0.00030039722,0.0019301253,0.000655434,0.0016468881,0.0009596928,0.00009253401],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026135729,0.000034575085,0.00000865756,0.000038520404,0.000019923355,0.0000421886,0.0031278136,0.0065977424,0.000010089342,0.20821516,0.00014774725,0.7817314],"study_design_scores_gemma":[0.0010459145,0.00020158113,0.000044535907,0.0003494998,0.000020352405,0.0001367014,5.053104e-7,0.43518984,0.00026597024,0.53407323,0.027807944,0.0008639242],"about_ca_topic_score_codex":0.000028257,"about_ca_topic_score_gemma":0.00014261292,"teacher_disagreement_score":0.7808675,"about_ca_system_score_codex":0.000167588,"about_ca_system_score_gemma":0.00024883077,"threshold_uncertainty_score":0.9999199},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034676306,0.0001769749,0.9908352,0.00010970843,0.0017635426,0.00078402256,0.000025526435,0.000487799,0.002349621],"genre_scores_gemma":[0.34870043,0.000013071624,0.6498404,0.00011599466,0.00074039504,0.000013607604,0.00006486504,0.00011237889,0.0003988298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99177015,0.00010896389,0.0014859942,0.0028773278,0.0022381824,0.0015193983],"domain_scores_gemma":[0.99544823,0.0001804884,0.00075646106,0.0026933742,0.00057257805,0.00034886517],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016501987,0.0010786008,0.0011417937,0.0011642792,0.0005712566,0.001484376,0.004828251,0.0006459923,0.000022940352],"category_scores_gemma":[0.000053967382,0.0010814829,0.00030811338,0.0011089806,0.00051065895,0.0018709768,0.0022459554,0.0009850145,0.00008642827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009906146,0.000102244856,0.000075962605,0.00006414129,0.00002363956,0.00035358634,0.00032123778,0.92813134,0.007116985,0.0022205133,0.000026997972,0.061553452],"study_design_scores_gemma":[0.0003673493,0.00012471044,0.00003251717,0.0007941672,0.000028062566,0.0001225118,2.3536381e-7,0.97912467,0.00088878203,0.017386332,0.0000369005,0.0010937671],"about_ca_topic_score_codex":0.00070351164,"about_ca_topic_score_gemma":0.000048677768,"teacher_disagreement_score":0.34523278,"about_ca_system_score_codex":0.0013802098,"about_ca_system_score_gemma":0.0009841858,"threshold_uncertainty_score":0.9995522},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006005658,0.00027956397,0.99537295,0.00032308447,0.00069345685,0.00025932092,0.0000036264978,0.0019405658,0.0010673582],"genre_scores_gemma":[0.26204646,0.000017086912,0.73712486,0.0004345821,0.00022842179,0.0000056514054,0.0000021883561,0.000025241001,0.00011552492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967358,0.00003202818,0.00062251627,0.0011433747,0.0009177837,0.00054850173],"domain_scores_gemma":[0.9969822,0.0007216079,0.00041952284,0.0014568435,0.00029242062,0.00012738195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009134579,0.0004291924,0.00053403556,0.00071347,0.0001453604,0.00013961115,0.0032830695,0.0002737321,0.000012002556],"category_scores_gemma":[0.0003968615,0.00040519758,0.0001343459,0.0005178434,0.00040617326,0.000384959,0.0012959449,0.00054192333,0.000016075051],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000396855,0.00003649992,0.00057111564,0.00003536764,0.000008648972,0.000025031755,0.00043104542,0.019739904,0.00008725816,0.004014863,0.000058631318,0.9749877],"study_design_scores_gemma":[0.00025866544,0.0001817795,0.0004265613,0.0009595285,0.000006439352,0.00005690614,1.5861504e-8,0.5273583,0.0027373857,0.46648738,0.0008675175,0.0006595244],"about_ca_topic_score_codex":0.000043825312,"about_ca_topic_score_gemma":0.00004106996,"teacher_disagreement_score":0.97432816,"about_ca_system_score_codex":0.0001670744,"about_ca_system_score_gemma":0.00049102877,"threshold_uncertainty_score":0.99983996},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011535515,0.000031234646,0.9838617,0.0010170005,0.00036423147,0.00042016633,0.000018532946,0.00003011696,0.0027215302],"genre_scores_gemma":[0.9624203,0.0000014259145,0.03574533,0.00090761355,0.0007871974,0.000008733817,0.000022410837,0.000012757912,0.0000942732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841946,0.00000874101,0.00026078057,0.0006042726,0.00033235337,0.00037439284],"domain_scores_gemma":[0.9991686,0.000107521824,0.00011328624,0.0003952135,0.00008225851,0.00013312264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016989173,0.00025459155,0.0002469569,0.00019677382,0.0002728215,0.00026047087,0.00071893237,0.00009560035,0.00008255812],"category_scores_gemma":[0.000002802274,0.00023954929,0.000083322964,0.00044612042,0.00017486753,0.0002764977,0.000118809476,0.00035888018,0.000019160492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028974102,0.000010662464,0.000044868873,8.5170154e-7,0.000002468843,8.488594e-7,0.00039796164,0.5570951,0.00020828973,0.004578281,0.0000091323545,0.43764862],"study_design_scores_gemma":[0.000101026235,0.000052263007,0.00017536574,0.000060310187,0.000010737777,0.0000010860476,0.0000010374087,0.9600677,0.0003933624,0.037183717,0.0016586496,0.00029473688],"about_ca_topic_score_codex":0.00015775223,"about_ca_topic_score_gemma":0.000059885373,"teacher_disagreement_score":0.95088476,"about_ca_system_score_codex":0.00009964352,"about_ca_system_score_gemma":0.00013969014,"threshold_uncertainty_score":0.97685367},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029663273,0.00021272911,0.9162301,0.00038052083,0.001398089,0.00044295736,0.0000031795275,0.00025709803,0.081045665],"genre_scores_gemma":[0.036998708,0.00002278659,0.9566443,0.0043316977,0.00088435784,0.000011289809,0.000012048555,0.000051660536,0.0010431426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99457186,0.000046445355,0.0005940835,0.0022680128,0.0013516633,0.00116793],"domain_scores_gemma":[0.99722016,0.00033686263,0.00024185576,0.0016277158,0.00020612267,0.00036726604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015122975,0.000700446,0.0006519737,0.0010754806,0.00038650536,0.00090476737,0.0046590017,0.0004500012,0.000023785471],"category_scores_gemma":[0.000086739805,0.00060123747,0.00018020388,0.001095778,0.00040098105,0.0005678301,0.0024109075,0.0014719222,0.00022085138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007616022,0.000042147454,0.00007912829,0.00003596127,0.000011967268,0.00012156187,0.0020253211,0.16662805,0.00001423416,0.017760132,0.00020301627,0.8130709],"study_design_scores_gemma":[0.00028780592,0.00038734043,0.00015983255,0.00023999761,0.000008464922,0.00018412284,6.2392894e-7,0.9133042,0.0001657091,0.049294148,0.0345716,0.0013961369],"about_ca_topic_score_codex":0.000027275692,"about_ca_topic_score_gemma":0.00001537901,"teacher_disagreement_score":0.8116747,"about_ca_system_score_codex":0.0002926123,"about_ca_system_score_gemma":0.00028999487,"threshold_uncertainty_score":0.9996439},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014568305,0.00022454867,0.9944622,0.00007362431,0.0018954817,0.00024088645,0.000003757118,0.00006687731,0.0015757788],"genre_scores_gemma":[0.34756514,0.000018567769,0.6514991,0.00038612587,0.00016192057,0.0000046586756,0.000009728396,0.000040000272,0.00031476814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959719,0.000041403488,0.0007438348,0.001421171,0.0011506045,0.00067104946],"domain_scores_gemma":[0.9972449,0.00046944164,0.00042954873,0.0015449143,0.00012595832,0.00018522443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016362648,0.00051823276,0.00060212694,0.0006439505,0.00021893476,0.00024056491,0.004074059,0.0003599268,0.000033801487],"category_scores_gemma":[0.00009690128,0.0004750098,0.00008659423,0.00046318167,0.0005662402,0.00033685451,0.0024639398,0.0008794508,0.000053424395],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046077316,0.000059472437,0.0018329199,0.000034417175,0.000022150638,0.00004128186,0.0012268886,0.005797384,0.00088555383,0.001809557,0.00000733882,0.98827845],"study_design_scores_gemma":[0.0016720056,0.00057017646,0.15517192,0.001815345,0.000027936358,0.00017020568,3.4299146e-7,0.68935513,0.0707897,0.05074834,0.024927877,0.0047510276],"about_ca_topic_score_codex":0.00010246595,"about_ca_topic_score_gemma":0.0003053572,"teacher_disagreement_score":0.9835274,"about_ca_system_score_codex":0.00018727459,"about_ca_system_score_gemma":0.00065784296,"threshold_uncertainty_score":0.99977016},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003521795,0.00063391996,0.996023,0.00015194992,0.0010582608,0.0008776425,0.0000011527446,0.0007818042,0.0004370645],"genre_scores_gemma":[0.012455647,0.000013198546,0.9868498,0.00025666342,0.00024567355,0.000047142275,0.0000013733053,0.000054485354,0.00007601179],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99593264,0.000052744577,0.0004327285,0.0018038579,0.00086976576,0.00090825383],"domain_scores_gemma":[0.99631506,0.0015551207,0.0003151394,0.0014192362,0.00023949485,0.00015594593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013810465,0.00069722516,0.0007033478,0.00064152543,0.00029673593,0.0005787354,0.0028973655,0.0002865508,0.0000033075935],"category_scores_gemma":[0.00046773462,0.0005612464,0.00011723815,0.00083631824,0.0008911167,0.00081532454,0.0012263479,0.001179183,0.000017217044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003451873,0.000007817816,0.000014518866,0.00004825703,0.000007935431,0.000112284026,0.0005750638,0.36963522,0.00003596382,0.0067179375,3.011365e-7,0.62284124],"study_design_scores_gemma":[0.0013419008,0.0015917792,0.00043294727,0.0036706415,0.000032085194,0.00060848065,6.68535e-7,0.07970338,0.009849061,0.89625967,0.0030410315,0.0034683447],"about_ca_topic_score_codex":0.000009939698,"about_ca_topic_score_gemma":0.00002339344,"teacher_disagreement_score":0.88954175,"about_ca_system_score_codex":0.00068525714,"about_ca_system_score_gemma":0.0005009166,"threshold_uncertainty_score":0.9996839},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019917616,0.00009014908,0.9959405,0.000022730075,0.00045530358,0.00031374785,0.000004971022,0.00012109983,0.0010597144],"genre_scores_gemma":[0.8213848,0.000009182115,0.17801483,0.00026575866,0.00022030089,0.000013179372,0.000012133688,0.00004389053,0.000035939247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854827,0.0000056405083,0.00026185045,0.00048391786,0.00033752178,0.00036280943],"domain_scores_gemma":[0.9995692,0.00004845613,0.000051430714,0.00020364021,0.000060996026,0.00006627519],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021090107,0.000275387,0.0002569421,0.0014732776,0.000058811063,0.0001202918,0.00030681372,0.00022003578,0.000023251388],"category_scores_gemma":[0.00001043532,0.00029032046,0.00003578,0.0007527493,0.000040188374,0.0002592419,0.00006495645,0.00033862513,0.000004799502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015988753,0.000004932594,0.0000716384,0.000057291756,0.000001002044,0.0000054595644,0.0000882969,0.92818296,0.000011629361,0.00002389539,0.0000037977613,0.071547516],"study_design_scores_gemma":[0.000102194674,0.00003441892,0.00017311717,0.00015435321,0.00000393015,0.0000044124627,1.9445496e-8,0.99462163,0.0018658941,0.0026317337,0.00009028614,0.00031797748],"about_ca_topic_score_codex":0.00020796557,"about_ca_topic_score_gemma":0.00019994738,"teacher_disagreement_score":0.81939304,"about_ca_system_score_codex":0.0004174683,"about_ca_system_score_gemma":0.000086723885,"threshold_uncertainty_score":0.9999549},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049267735,0.0013221526,0.9791549,0.00059089053,0.0030915479,0.00039329357,0.000004584451,0.00035736256,0.015036027],"genre_scores_gemma":[0.66102856,0.000071212155,0.33149654,0.0031693117,0.0021996698,0.000011843137,0.00002813623,0.00006821363,0.0019265276],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504006,0.00005234643,0.0006957791,0.0020592627,0.0012640174,0.0008885588],"domain_scores_gemma":[0.9966824,0.00040531895,0.00049080007,0.0018853325,0.00026123002,0.00027494258],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007965328,0.00069594855,0.00076241005,0.0006130629,0.00036549664,0.0016764068,0.0052394746,0.0004961912,0.00003148629],"category_scores_gemma":[0.00008619711,0.0005934137,0.00019134938,0.0006311844,0.00059514056,0.00087502744,0.0012654212,0.000890286,0.0001389777],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036372649,0.000028568116,0.00011180855,0.00001626146,0.000011963916,0.0001790979,0.00060605566,0.0012121743,0.00007972892,0.04438994,0.00007287303,0.9532879],"study_design_scores_gemma":[0.0004787711,0.00024635912,0.00054542604,0.00022362055,0.00001906082,0.0001206671,3.0674815e-7,0.19994919,0.0010878197,0.77087635,0.02512461,0.0013278162],"about_ca_topic_score_codex":0.00018763497,"about_ca_topic_score_gemma":0.00020737913,"teacher_disagreement_score":0.9519601,"about_ca_system_score_codex":0.00029880094,"about_ca_system_score_gemma":0.00055861956,"threshold_uncertainty_score":0.99965173},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025042347,0.0004760619,0.99613464,0.0006975381,0.0009009319,0.00075833075,0.000014485801,0.00040146074,0.00036615162],"genre_scores_gemma":[0.31445786,0.00011494668,0.6840863,0.0006115709,0.0002498031,0.00003769882,0.000085432854,0.000029941444,0.0003264346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586064,0.000034867735,0.00075897784,0.0017370068,0.0009494122,0.000659105],"domain_scores_gemma":[0.99692845,0.00034531576,0.00066695904,0.0015234709,0.00044500385,0.00009079496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006054264,0.0005563241,0.00069481705,0.001440697,0.00047175464,0.000818237,0.0031645284,0.0003891087,0.000032822234],"category_scores_gemma":[0.00010199514,0.000538685,0.00023057089,0.0024104444,0.0005994625,0.0015815601,0.0008494482,0.0004571301,0.000023531897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014379411,0.00008063058,0.00054549135,0.00005341673,0.00012397111,0.000007814587,0.00074010063,0.10687221,0.0005435824,0.12111185,0.000063028485,0.7698435],"study_design_scores_gemma":[0.00038974785,0.00009590799,0.0003086821,0.00011382643,0.0001098885,0.0000084803805,5.577513e-7,0.85566235,0.0016465446,0.13738708,0.0035413862,0.00073553674],"about_ca_topic_score_codex":0.000030345413,"about_ca_topic_score_gemma":0.000057366484,"teacher_disagreement_score":0.769108,"about_ca_system_score_codex":0.00060664356,"about_ca_system_score_gemma":0.00037640065,"threshold_uncertainty_score":0.99970645},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000646158,0.00021468417,0.99272645,0.00018529996,0.0005604085,0.00049748167,0.0000065175036,0.004264896,0.00089808286],"genre_scores_gemma":[0.39452922,0.0000015710938,0.60502255,0.00020985381,0.00015691566,0.000019229972,0.0000063276857,0.00003020161,0.000024137898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529207,0.00007194253,0.00086092844,0.0019621225,0.0008687918,0.00094417227],"domain_scores_gemma":[0.9947601,0.002683399,0.0004186906,0.0016627271,0.00034513444,0.00012996858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024080793,0.0006114773,0.00063330086,0.00079177914,0.00027063,0.0005988322,0.0032512734,0.00039034232,0.0000021302953],"category_scores_gemma":[0.0020339065,0.000595326,0.00010533691,0.0017568544,0.00050774607,0.0005405069,0.0016571538,0.0012940409,0.000007998749],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018992403,0.00006266527,0.026931027,0.0001248854,0.0000035840792,0.000115608935,0.00028329412,0.12744078,0.00009280704,0.00054913544,0.000060357434,0.84433395],"study_design_scores_gemma":[0.00013845795,0.00010875706,0.0053444584,0.000983365,0.0000028119932,0.00006202351,1.6903645e-8,0.5436146,0.00029041758,0.44875747,0.000089413676,0.0006082005],"about_ca_topic_score_codex":0.0005943726,"about_ca_topic_score_gemma":0.00024400634,"teacher_disagreement_score":0.84372574,"about_ca_system_score_codex":0.0006981522,"about_ca_system_score_gemma":0.00053541653,"threshold_uncertainty_score":0.9996498},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008861864,0.00017186358,0.9977075,0.00014055218,0.0006690587,0.00050589896,0.00001157649,0.00022469704,0.00048026195],"genre_scores_gemma":[0.33515733,0.000017054288,0.6646153,0.000040308023,0.00009656921,0.000026265045,0.0000060921334,0.0000211271,0.000019994315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971697,0.000016295371,0.0005262437,0.0006261745,0.0012688658,0.00039272953],"domain_scores_gemma":[0.99716985,0.0006601521,0.00027851772,0.0008735013,0.0009418832,0.00007608961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012204624,0.0002357861,0.00033618935,0.000910651,0.00009212905,0.00007346547,0.0013694824,0.00016884622,0.0000150772985],"category_scores_gemma":[0.0004796937,0.00023296627,0.000117046045,0.00058926805,0.00025996225,0.00040770162,0.00033135273,0.00025627724,0.0000085138345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053286603,0.00027143504,0.000276395,0.00081596366,0.00009354559,0.000008891181,0.0011729704,0.06530197,0.004256081,0.18962535,0.00026599396,0.7378581],"study_design_scores_gemma":[0.00048931106,0.0005293591,0.0026782386,0.000587396,0.000014430858,0.000016302662,1.0239616e-7,0.9154038,0.006151876,0.07344185,0.0003078037,0.00037954422],"about_ca_topic_score_codex":0.000005678048,"about_ca_topic_score_gemma":0.000005710102,"teacher_disagreement_score":0.8501018,"about_ca_system_score_codex":0.0002806365,"about_ca_system_score_gemma":0.0002739456,"threshold_uncertainty_score":0.95000887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054662954,0.001088671,0.99308705,0.0015249844,0.000878163,0.00039474308,0.0000024221674,0.0003189618,0.0021583857],"genre_scores_gemma":[0.099524975,0.000023008144,0.89614266,0.003893133,0.00022520268,0.00000547573,0.0000012042848,0.00003332988,0.00015100853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961859,0.00009936921,0.0006786444,0.0011695266,0.0012768402,0.00058969116],"domain_scores_gemma":[0.9970009,0.0005676735,0.00067491306,0.0013016261,0.00034035416,0.00011457976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013240152,0.00051920605,0.000551822,0.00056212005,0.000404302,0.00047048874,0.003446428,0.00042169885,0.0000189028],"category_scores_gemma":[0.000429734,0.00037815757,0.00016831065,0.00079722056,0.0014522164,0.00062671915,0.0011230024,0.0011242839,0.000010010282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009395488,0.000028088818,0.000022349095,0.000095148745,0.000024443038,0.00009348414,0.0019196508,0.0043363627,0.0029022386,0.3355751,0.000013269538,0.6549805],"study_design_scores_gemma":[0.0001499275,0.0001566507,0.000007487721,0.00095351686,0.000017039863,0.0010585644,0.0000017104824,0.5313347,0.044865556,0.42036787,0.0004535686,0.0006334177],"about_ca_topic_score_codex":0.000111966,"about_ca_topic_score_gemma":0.000023395763,"teacher_disagreement_score":0.65434706,"about_ca_system_score_codex":0.00030884624,"about_ca_system_score_gemma":0.00080609013,"threshold_uncertainty_score":0.999867},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000652891,0.0004899693,0.99493325,0.00032884473,0.0014985471,0.0012723462,0.000012459834,0.00017940732,0.0012198879],"genre_scores_gemma":[0.13774088,0.00003297581,0.85974026,0.0011768659,0.0006344838,0.00007481555,0.000025415917,0.000045633904,0.0005286773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573785,0.000048371832,0.0006228626,0.0018254009,0.0010981115,0.00066737516],"domain_scores_gemma":[0.99703854,0.00058037863,0.00045127558,0.0014185165,0.00033002172,0.00018128188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010117164,0.0005447775,0.0005972963,0.0007156058,0.00047610584,0.0004020346,0.0028267703,0.00040397904,0.0000041678254],"category_scores_gemma":[0.00011287135,0.0004871797,0.00022124594,0.00056755147,0.00035038448,0.00051784335,0.00041780603,0.00048498102,0.000019656874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047485442,0.00020908001,0.00016883983,0.0004643259,0.000024633246,0.0000617074,0.0019717976,0.63405544,0.0005738696,0.017058127,0.00083356054,0.34453115],"study_design_scores_gemma":[0.0005694362,0.00017080632,0.00009920599,0.0002772938,0.0000049907076,0.000030415244,8.040467e-8,0.9882292,0.0018512708,0.0036913266,0.00447755,0.0005984256],"about_ca_topic_score_codex":0.00002297794,"about_ca_topic_score_gemma":0.000020233194,"teacher_disagreement_score":0.35417375,"about_ca_system_score_codex":0.00036071977,"about_ca_system_score_gemma":0.0006722831,"threshold_uncertainty_score":0.999758},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40450755,0.00005926386,0.5916036,0.000059286096,0.0014663807,0.00069897436,0.000024173978,0.000043017673,0.0015377571],"genre_scores_gemma":[0.97653776,0.000025500542,0.022272047,0.000054407137,0.00013671326,0.0000140793,0.00015410566,0.000020225778,0.00078516075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981305,0.00006830954,0.00056656415,0.00064586283,0.00035746724,0.00023127183],"domain_scores_gemma":[0.99898434,0.00008029895,0.00031889684,0.00032864633,0.00023445151,0.000053387816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032544677,0.00026391537,0.00036960669,0.0006791444,0.000051000814,0.000027017937,0.00018976534,0.00039657592,0.00038694355],"category_scores_gemma":[0.00003389341,0.00023534402,0.000066044304,0.00033130072,0.000630286,0.00015662354,0.000051244155,0.00040669617,0.000016521957],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007028445,0.00019278609,0.00573251,0.000059644717,0.000010719558,0.000005450612,0.0045447634,0.006427614,0.03222055,0.00032829816,0.00007627257,0.9503311],"study_design_scores_gemma":[0.0022387088,0.0008913429,0.23752025,0.00091606454,0.00004206676,0.00005163366,0.00006737367,0.75303835,0.0028146538,0.0008977008,0.0006464812,0.0008754004],"about_ca_topic_score_codex":0.0004943334,"about_ca_topic_score_gemma":0.0006364495,"teacher_disagreement_score":0.9494557,"about_ca_system_score_codex":0.00012331663,"about_ca_system_score_gemma":0.000051706636,"threshold_uncertainty_score":0.9597051},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034455664,0.00038396078,0.99256533,0.00019400068,0.00067884853,0.00043268903,0.000004180498,0.00014919067,0.0021462522],"genre_scores_gemma":[0.8140866,0.0000054939055,0.18541726,0.00015514228,0.00014235503,0.0000113461965,0.0000047786,0.00001910019,0.00015792553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711066,0.000050546965,0.0005218379,0.0010067226,0.0009032232,0.00040702213],"domain_scores_gemma":[0.9981188,0.00020575737,0.00046293327,0.0008456759,0.00029485926,0.00007197901],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007776361,0.00041761558,0.00041089556,0.0008875468,0.0002870973,0.0003092994,0.0017393988,0.00020385548,0.000006661182],"category_scores_gemma":[0.000027020675,0.00032299542,0.00011219948,0.0008685423,0.0012802407,0.00095659896,0.00045556427,0.0005213475,0.000008275464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007033538,0.000071918344,0.0012516752,0.0001250562,0.000026720898,0.00005835336,0.0017249243,0.51898915,0.0031705105,0.15138556,0.000017070075,0.3231087],"study_design_scores_gemma":[0.000542863,0.0006715793,0.0020787371,0.0016814399,0.000022257333,0.00009472073,4.803419e-7,0.7219947,0.005201009,0.26663703,0.00016947938,0.0009056953],"about_ca_topic_score_codex":0.00009262292,"about_ca_topic_score_gemma":0.00008019878,"teacher_disagreement_score":0.81064105,"about_ca_system_score_codex":0.000121563455,"about_ca_system_score_gemma":0.00053541793,"threshold_uncertainty_score":0.9999222},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002960486,0.0006177492,0.99508893,0.00070046453,0.00044644374,0.0002179818,0.0000020267876,0.000037747403,0.0025926079],"genre_scores_gemma":[0.09775017,0.00006241296,0.9012313,0.00070424646,0.00016085741,0.000004551332,0.0000024766161,0.000010017955,0.00007394952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694866,0.00011215685,0.0006380923,0.0008935058,0.0010262865,0.00038127092],"domain_scores_gemma":[0.9971024,0.00054531737,0.00038497327,0.0017695616,0.00015465432,0.000043120563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029950489,0.00029479375,0.0005483171,0.0020147236,0.00010192572,0.000268805,0.0046055615,0.0002096512,0.000012703178],"category_scores_gemma":[0.00016960358,0.00022173696,0.00016525455,0.0029933217,0.0005531174,0.00055914995,0.0005768781,0.0006111499,0.0000074280465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025234258,0.000028615568,0.00020555087,0.000014823856,0.000030729934,0.00001180401,0.0037999111,0.1121374,0.00006826761,0.07649485,0.000004327183,0.8072012],"study_design_scores_gemma":[0.000078559126,0.000055550245,0.003926525,0.00012331488,0.000046010537,0.000010560463,6.4088727e-7,0.9441536,0.0009809237,0.04924674,0.0010624194,0.0003151356],"about_ca_topic_score_codex":0.00007027825,"about_ca_topic_score_gemma":0.00018851548,"teacher_disagreement_score":0.8320162,"about_ca_system_score_codex":0.0001747968,"about_ca_system_score_gemma":0.00017354508,"threshold_uncertainty_score":0.90421706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036330577,0.0002754663,0.9961947,0.0010180024,0.0014839349,0.00061351515,0.000005582054,0.00010949512,0.00026297296],"genre_scores_gemma":[0.006524868,0.00008049334,0.9909511,0.0012352255,0.0010457883,0.000045061646,0.000010856814,0.000022981634,0.000083618695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975867,0.00003087883,0.0004134456,0.00110867,0.00050307147,0.0003572043],"domain_scores_gemma":[0.99810284,0.0003706885,0.00027281494,0.0009107246,0.00025064085,0.00009229747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011505131,0.00031914274,0.0002930713,0.00043666566,0.00026149463,0.0006320858,0.0011963707,0.0003235444,0.0000061405135],"category_scores_gemma":[0.0002574862,0.00031351586,0.000055819484,0.00026986873,0.00030024708,0.0014589056,0.00037632597,0.00038128436,0.000009430338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029300684,0.0000072136245,0.0000023804525,0.00001716449,0.0000026700645,9.1774825e-7,0.0005935005,0.0051801633,0.00017680982,0.3869823,0.0000139861195,0.60701996],"study_design_scores_gemma":[0.00009280692,0.00010469325,0.000015131346,0.0000901571,0.0000035076287,0.0000121844805,9.0888484e-8,0.6540137,0.0014941198,0.34133974,0.0025773556,0.0002565478],"about_ca_topic_score_codex":0.000004551025,"about_ca_topic_score_gemma":0.000030277311,"teacher_disagreement_score":0.6488335,"about_ca_system_score_codex":0.00022742507,"about_ca_system_score_gemma":0.00020364842,"threshold_uncertainty_score":0.9999317},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009233485,0.00006820464,0.98196536,0.008648765,0.0020636031,0.002288489,0.000012669275,0.00007191465,0.004788676],"genre_scores_gemma":[0.15694907,0.0010072167,0.56188196,0.186885,0.051248457,0.0028338314,0.0011776062,0.00077167165,0.03724518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979621,0.0000041775656,0.00041112822,0.0007009766,0.00044438086,0.00047721015],"domain_scores_gemma":[0.99847704,0.0003819933,0.00015661688,0.00062195543,0.0003468684,0.000015514666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016292386,0.00034692494,0.00023187247,0.00032971182,0.00052635814,0.00040581834,0.0012647304,0.00013055511,0.00007111618],"category_scores_gemma":[0.000084106374,0.0001987597,0.00016643223,0.0002982549,0.0003123584,0.00018205766,0.00036377192,0.00029585775,0.000046124187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010248925,0.000119280536,0.000031133783,0.00034635782,0.00006342382,0.0000024563471,0.00021512034,0.16548778,0.0000080384325,0.11125763,0.0015967065,0.7207696],"study_design_scores_gemma":[0.00032824083,0.000052542047,0.000046920555,0.00011750223,0.000026314698,3.8968054e-7,9.83708e-7,0.7868388,0.000020129577,0.013975838,0.1983317,0.00026063493],"about_ca_topic_score_codex":0.00014747752,"about_ca_topic_score_gemma":0.00085195503,"teacher_disagreement_score":0.72050893,"about_ca_system_score_codex":0.000082156585,"about_ca_system_score_gemma":0.000045096796,"threshold_uncertainty_score":0.81051856},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007802434,0.00031302328,0.9797266,0.0009929494,0.001092267,0.00028784855,0.00001685018,0.00015896531,0.017403683],"genre_scores_gemma":[0.010662218,0.000041456875,0.98509747,0.0013177688,0.0004286413,0.000014027043,0.000013144958,0.00006312154,0.0023621698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996469,0.000017119499,0.000526599,0.0013831989,0.000917604,0.0006864457],"domain_scores_gemma":[0.9974853,0.00026952475,0.0002337092,0.0016971693,0.000112435104,0.0002018942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047465044,0.0005261688,0.00055124314,0.0004809086,0.00023393308,0.0006310749,0.0018434252,0.00017111163,0.00002641759],"category_scores_gemma":[0.000088561625,0.0004403774,0.00013088406,0.00039117245,0.0008373457,0.0017622483,0.0012658925,0.00057373947,0.00013992738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015973422,0.000021600197,0.000008508478,0.000059158632,0.000008047778,0.00018811555,0.00032536252,0.00355195,0.000011904118,0.53443,0.000042170406,0.46135154],"study_design_scores_gemma":[0.00023057734,0.00010319519,0.0000050390063,0.0008623506,0.00000710745,0.00036343656,9.017402e-7,0.15777819,0.00028646045,0.8161045,0.023186786,0.0010714723],"about_ca_topic_score_codex":0.000002437823,"about_ca_topic_score_gemma":0.000006840055,"teacher_disagreement_score":0.4602801,"about_ca_system_score_codex":0.00018248502,"about_ca_system_score_gemma":0.00021558999,"threshold_uncertainty_score":0.9998048},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022727675,0.00025645664,0.9922525,0.00087433704,0.0032963776,0.00047615412,0.000122054815,0.00025947197,0.0022353365],"genre_scores_gemma":[0.8470765,0.0002017999,0.14316562,0.006542532,0.0019443694,0.00004945301,0.00017150988,0.00012876227,0.0007194969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99483234,0.000032344382,0.0007580625,0.0021549545,0.0012628239,0.0009594868],"domain_scores_gemma":[0.9963678,0.00017028475,0.0004784613,0.002433287,0.0002542842,0.00029589157],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00077075104,0.0007194725,0.00072837144,0.00069210504,0.00031602193,0.0020729643,0.0074601225,0.00033353316,0.000052357293],"category_scores_gemma":[0.00004938858,0.0006697392,0.00016799594,0.00066624355,0.00034550863,0.0024709457,0.0030082285,0.0009899165,0.000095344345],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014699217,0.00015072276,0.000949481,0.000490977,0.000049562103,0.0014476234,0.001327185,0.016376078,0.0009872054,0.12850131,0.00010807345,0.8495971],"study_design_scores_gemma":[0.0047725495,0.0008959399,0.009204465,0.022257702,0.000082551276,0.0013306807,0.0000013562909,0.6146082,0.01786267,0.24161685,0.07563532,0.011731706],"about_ca_topic_score_codex":0.00014375137,"about_ca_topic_score_gemma":0.00012211643,"teacher_disagreement_score":0.84908694,"about_ca_system_score_codex":0.00048765147,"about_ca_system_score_gemma":0.0007986909,"threshold_uncertainty_score":0.9995754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006174581,0.0001284849,0.99703586,0.00039617092,0.00045116383,0.00063612335,0.000007530103,0.00007660475,0.0012063266],"genre_scores_gemma":[0.40317467,0.000050489332,0.5963071,0.0002557129,0.00015462135,0.000010219835,0.0000116843385,0.000009578356,0.00002594763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787813,0.000024882136,0.00041331007,0.0007385263,0.0005696312,0.00037550085],"domain_scores_gemma":[0.9979846,0.00044967854,0.0003380842,0.00077515154,0.0003627946,0.000089700756],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006375256,0.00027237882,0.00029450312,0.00033075205,0.00076749857,0.00037289178,0.0013846051,0.00020863001,0.0000103998145],"category_scores_gemma":[0.00006554836,0.00018778192,0.00008428586,0.00035782176,0.0044951346,0.00076035457,0.0001983998,0.000381694,7.5447036e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040438477,0.00005103111,0.00022154112,0.000029137904,0.000018524464,0.000006819526,0.0023564321,0.075148866,0.000056042925,0.28649506,0.000021191152,0.6355549],"study_design_scores_gemma":[0.000530945,0.00043637643,0.0019018354,0.00009390119,0.000015516876,0.0002763132,0.000008131174,0.98340636,0.00044458243,0.011535619,0.0008705105,0.00047990782],"about_ca_topic_score_codex":0.000017675113,"about_ca_topic_score_gemma":0.00010790779,"teacher_disagreement_score":0.9082575,"about_ca_system_score_codex":0.00011542515,"about_ca_system_score_gemma":0.00074523775,"threshold_uncertainty_score":0.99821407},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058731243,0.000070827366,0.9291498,0.00015150016,0.00008677457,0.00023560482,0.00001660658,0.000042523057,0.011515112],"genre_scores_gemma":[0.8489951,0.000011714077,0.15056776,0.00012145576,0.00011285248,6.815746e-7,0.000034968045,0.000029170316,0.00012633925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998067,0.000011069621,0.00035333945,0.00075861753,0.00052907324,0.00028085642],"domain_scores_gemma":[0.9987809,0.0002106081,0.0002834928,0.0005957702,0.00004807872,0.000081143524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017091041,0.00025920328,0.0002535606,0.00019713181,0.00017520231,0.00019356493,0.00045679917,0.00013348187,0.00007852346],"category_scores_gemma":[0.000036011512,0.00023269859,0.000055749548,0.0004624353,0.0009967509,0.00035031617,0.00019917375,0.00025862767,0.000037510148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000108748845,0.0000572563,0.0018841681,0.000006633536,0.000011641019,0.000013500667,0.0010116884,0.04949844,0.07275465,0.00014564175,0.0000074869304,0.874598],"study_design_scores_gemma":[0.00040597527,0.00021040629,0.009656599,0.0006885212,0.000073491334,0.00012822142,0.000006149659,0.9098839,0.01170376,0.060866896,0.0050017284,0.0013743055],"about_ca_topic_score_codex":0.0001669997,"about_ca_topic_score_gemma":0.00011483106,"teacher_disagreement_score":0.8732237,"about_ca_system_score_codex":0.00033382967,"about_ca_system_score_gemma":0.00006486979,"threshold_uncertainty_score":0.94891727},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010401253,0.0002905823,0.9639698,0.025420424,0.0024010194,0.0015241959,0.000038612703,0.00093556265,0.005315752],"genre_scores_gemma":[0.014921662,0.000016804373,0.94360024,0.010318604,0.0012071837,0.0001303902,0.000021341313,0.00012292406,0.029660832],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99117625,0.000037325783,0.00088922004,0.003378122,0.0025456124,0.0019734835],"domain_scores_gemma":[0.99331445,0.0012670924,0.00034291547,0.0036797493,0.00093868887,0.00045707912],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018908699,0.0010865012,0.0010644707,0.0029062098,0.0006336121,0.0014082389,0.011236773,0.0005505921,0.000005855663],"category_scores_gemma":[0.0009435498,0.0010271781,0.00033291936,0.0025272162,0.00085136254,0.0007972609,0.0061813695,0.001325498,0.00012496849],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003564607,0.00005464265,0.00005570417,0.000047223737,0.00003244317,0.0002043188,0.0012597111,0.078605555,0.00010341319,0.02695417,0.026790392,0.86585677],"study_design_scores_gemma":[0.0005582408,0.00073748233,0.00021506219,0.00075834815,0.000020210387,0.00019155118,6.852647e-7,0.102119416,0.003384045,0.08465325,0.8048522,0.0025095171],"about_ca_topic_score_codex":0.0000348382,"about_ca_topic_score_gemma":0.000568794,"teacher_disagreement_score":0.8633473,"about_ca_system_score_codex":0.00073617575,"about_ca_system_score_gemma":0.0007108115,"threshold_uncertainty_score":0.9996284},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005620101,0.001142823,0.9658798,0.0043400647,0.022874666,0.00073499756,0.0000018866407,0.00018752813,0.004782019],"genre_scores_gemma":[0.06732795,0.00013102229,0.89397067,0.017473016,0.015837736,0.00011617041,0.00007496096,0.00022229078,0.0048462003],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957846,0.000029040184,0.00068368926,0.0015345754,0.0008229262,0.0011451944],"domain_scores_gemma":[0.9963831,0.00062328903,0.0004593789,0.0018738282,0.00040419828,0.0002562074],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015030616,0.000570777,0.00055368966,0.00044246236,0.0011075025,0.0012078893,0.005760977,0.00034534658,0.0000016416952],"category_scores_gemma":[0.00012167353,0.00040615673,0.0002351359,0.00041770822,0.0007297374,0.00038040205,0.0021673148,0.0012960512,0.000053431235],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011512035,0.000011308479,0.000011534173,0.000076818265,0.000014700769,0.000016799766,0.004990299,0.0000925316,0.000019693261,0.014057111,0.0004709532,0.98022676],"study_design_scores_gemma":[0.0008829203,0.0011462261,0.00009670203,0.0010950795,0.000018260125,0.00037026097,0.0000035926769,0.17553021,0.0037543126,0.15141547,0.66357505,0.002111942],"about_ca_topic_score_codex":0.0003143592,"about_ca_topic_score_gemma":0.0010285588,"teacher_disagreement_score":0.9781148,"about_ca_system_score_codex":0.0008799503,"about_ca_system_score_gemma":0.0015789246,"threshold_uncertainty_score":0.999839},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022010035,0.00091259123,0.9867365,0.0004127944,0.001034458,0.00023011382,0.0000010296143,0.0001466902,0.008324824],"genre_scores_gemma":[0.7206416,0.00012680373,0.27689585,0.0010570408,0.00028859224,0.0000056394983,0.0000029106966,0.00003409129,0.00094746763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680865,0.00003548403,0.000596917,0.0011645112,0.000726973,0.0006674817],"domain_scores_gemma":[0.9981871,0.0004881264,0.00031324133,0.0007499,0.00018867673,0.0000729596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011356081,0.00044074672,0.00067193236,0.0013729574,0.00020062886,0.000102680206,0.0024408197,0.0006167541,0.00001650394],"category_scores_gemma":[0.00016365346,0.00040200143,0.000104113555,0.0009854904,0.0011498142,0.0002948138,0.001623623,0.0016368097,0.000019514093],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016737687,0.000068620466,0.002438916,0.00007423806,0.000023272783,0.00023965276,0.0042645754,0.007955535,0.00023116388,0.049901508,0.000020413718,0.93476534],"study_design_scores_gemma":[0.00251746,0.0022647239,0.018485745,0.0031024627,0.000037400987,0.00038846786,0.000010430719,0.54698616,0.004253064,0.39636454,0.02153302,0.0040565203],"about_ca_topic_score_codex":0.000031737072,"about_ca_topic_score_gemma":0.00026533584,"teacher_disagreement_score":0.9307088,"about_ca_system_score_codex":0.000179925,"about_ca_system_score_gemma":0.00027788352,"threshold_uncertainty_score":0.9998432},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008929172,0.0014130187,0.98436975,0.00032449627,0.0025126515,0.0004484568,0.0000039082106,0.00026922615,0.010569207],"genre_scores_gemma":[0.18169077,0.00015529411,0.8139795,0.002010132,0.0013249918,0.000015686126,0.0000064270444,0.000092466325,0.00072472036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994872,0.000045745324,0.0007181685,0.0018794504,0.0014329504,0.0010517089],"domain_scores_gemma":[0.9965433,0.00059188483,0.0003349861,0.0019326821,0.00028864396,0.0003085024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014059505,0.00068517396,0.00066898664,0.0018890912,0.000352975,0.00072536856,0.004411341,0.00048544933,0.000028237946],"category_scores_gemma":[0.000053002732,0.0005966079,0.0002932484,0.0014525867,0.0009137656,0.0005441223,0.0013408068,0.0011244926,0.00015680805],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007221076,0.00005479311,0.00015848757,0.00011475883,0.000029483683,0.00045213755,0.0010428432,0.00947016,0.00010293907,0.15054098,0.000025433295,0.8380008],"study_design_scores_gemma":[0.0010183078,0.00068456365,0.0009418506,0.0022220572,0.00004387834,0.0008175452,0.0000010694357,0.5412822,0.0030978357,0.43614882,0.010546429,0.0031954446],"about_ca_topic_score_codex":0.00002710037,"about_ca_topic_score_gemma":0.00011761218,"teacher_disagreement_score":0.8348053,"about_ca_system_score_codex":0.00023881726,"about_ca_system_score_gemma":0.00046070592,"threshold_uncertainty_score":0.9996485},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008312514,0.00012587095,0.98980886,0.00054277235,0.0013402218,0.0005682583,0.000004772911,0.0006611425,0.006864985],"genre_scores_gemma":[0.0531346,0.000015602733,0.94499964,0.0011122557,0.00043317658,0.00002812267,0.0000050150925,0.000047394355,0.00022418362],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953525,0.000022697453,0.00051753054,0.0023092667,0.00088356883,0.00091442064],"domain_scores_gemma":[0.9967865,0.00021473668,0.00023671851,0.0023526414,0.00012473862,0.00028469152],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010433508,0.00068861723,0.000592193,0.0014087897,0.0004280871,0.0008409355,0.0062605385,0.0005164346,0.000010866955],"category_scores_gemma":[0.000057657802,0.00062502094,0.00018253934,0.0009357511,0.00057675404,0.0008268439,0.0033264828,0.0016037707,0.000023126257],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012667809,0.00004142358,0.00020589562,0.00007891339,0.000019359428,0.00015348983,0.0020117539,0.038622536,0.00064939907,0.069783,0.000014021797,0.8884075],"study_design_scores_gemma":[0.00021729965,0.00032540073,0.00014328441,0.0007797441,0.000012429108,0.00017374854,1.830814e-7,0.3226925,0.017053597,0.64985925,0.0068150545,0.0019274604],"about_ca_topic_score_codex":0.000015242962,"about_ca_topic_score_gemma":0.00009097347,"teacher_disagreement_score":0.8864801,"about_ca_system_score_codex":0.0001594907,"about_ca_system_score_gemma":0.0002184429,"threshold_uncertainty_score":0.99962014},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006553963,0.0008840416,0.99661785,0.00024880513,0.00080274773,0.00037324702,0.000006655757,0.00087366847,0.00012741429],"genre_scores_gemma":[0.007545852,0.00014402412,0.99002975,0.0016880168,0.00013106091,0.000014530472,0.000024859502,0.000060554015,0.00036135028],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969848,0.000057858775,0.0005177614,0.0012013373,0.0006499012,0.00058835483],"domain_scores_gemma":[0.99707836,0.0014127819,0.00029760797,0.00070534117,0.00029631497,0.00020958691],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069503376,0.0005407452,0.00049087504,0.0005299581,0.00059958565,0.00057003147,0.0016571215,0.00025922514,0.00013026223],"category_scores_gemma":[0.00068333076,0.0004975817,0.000045214023,0.0006918258,0.00043304698,0.0008163652,0.0009277535,0.000948522,0.000015080268],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009278651,0.000041564825,0.0018462249,0.00014946934,0.000059408387,0.00021315187,0.0036858846,0.011169417,0.000024454264,0.005429284,0.00032564433,0.9770462],"study_design_scores_gemma":[0.0023943188,0.0015364453,0.0020134272,0.0028476669,0.00010862994,0.0015112018,0.0000063028656,0.11696037,0.0037843192,0.09595009,0.76638347,0.006503753],"about_ca_topic_score_codex":0.000014131847,"about_ca_topic_score_gemma":0.00003740273,"teacher_disagreement_score":0.9705425,"about_ca_system_score_codex":0.0002657795,"about_ca_system_score_gemma":0.00068429817,"threshold_uncertainty_score":0.9997476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005638326,0.009409685,0.9842217,0.00018608848,0.0024592704,0.001043458,0.0000028308307,0.00030203554,0.0018111056],"genre_scores_gemma":[0.794242,0.00087263895,0.2010003,0.0016992973,0.0013720611,0.00013513996,0.000023430961,0.00014932531,0.0005057909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935346,0.00008544809,0.0011151163,0.002625645,0.0010748135,0.0015643468],"domain_scores_gemma":[0.99659055,0.0006530509,0.0003965616,0.0019586335,0.00015818185,0.00024303654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014757302,0.0008954091,0.00094106403,0.0009653408,0.00025280518,0.0006921139,0.004692014,0.00069576374,0.000022775239],"category_scores_gemma":[0.000023076385,0.00088784285,0.00025245897,0.0015456734,0.0006590874,0.00068542856,0.001054027,0.0019868196,0.000027971399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000308915,0.00002805099,0.000009145483,0.000009467798,0.0000028603406,0.00011932855,0.00030422624,0.5311646,0.0000036735198,0.00069400645,0.000040670886,0.46762088],"study_design_scores_gemma":[0.00045058524,0.0002336298,0.00015276599,0.0006095025,0.0000069090784,0.00007035819,2.1438154e-7,0.98559713,0.000026405365,0.005936008,0.0059714844,0.00094498147],"about_ca_topic_score_codex":0.000012572937,"about_ca_topic_score_gemma":0.00072817033,"teacher_disagreement_score":0.79367816,"about_ca_system_score_codex":0.00069696014,"about_ca_system_score_gemma":0.00049026014,"threshold_uncertainty_score":0.9993572},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010008373,0.00026363242,0.9821266,0.0015143235,0.0025058938,0.0010897802,0.000008516724,0.00054672844,0.010943691],"genre_scores_gemma":[0.07373775,0.000021711663,0.9210906,0.0038223823,0.0010288004,0.000020574491,0.000005500066,0.00005397384,0.00021871256],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99123424,0.00014747898,0.0011019808,0.0039161,0.0021352074,0.0014650006],"domain_scores_gemma":[0.9940409,0.001666606,0.0002846504,0.0031396167,0.0002675907,0.0006006037],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0025928465,0.0010594637,0.001103272,0.0014290476,0.0005650437,0.0012710545,0.008745113,0.0006614129,0.00012974978],"category_scores_gemma":[0.00046166516,0.00089788885,0.00031254842,0.0008559715,0.00085810106,0.0007595517,0.004976068,0.0021864374,0.00063052855],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016581907,0.00008497119,0.00004454843,0.000014015941,0.000006977091,0.00022110513,0.00061510137,0.0467899,0.000025199859,0.016330186,0.00004966733,0.93580174],"study_design_scores_gemma":[0.0003019542,0.00064958597,0.00065657037,0.00037042043,0.000008007441,0.00025329491,1.479099e-7,0.3886933,0.00009928552,0.5992733,0.008518121,0.0011759843],"about_ca_topic_score_codex":0.000045180044,"about_ca_topic_score_gemma":0.000079653124,"teacher_disagreement_score":0.93462574,"about_ca_system_score_codex":0.0007277585,"about_ca_system_score_gemma":0.0005913389,"threshold_uncertainty_score":0.9997657},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043849686,0.0028652826,0.9857026,0.00035037758,0.0017169621,0.00059055875,0.0000013985895,0.00027717368,0.00845181],"genre_scores_gemma":[0.68568,0.00055500166,0.30838606,0.0014731239,0.0011529422,0.000033597917,0.0000067864007,0.000096181044,0.0026163475],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956397,0.00004740427,0.00066673633,0.0018796441,0.0008971689,0.000869394],"domain_scores_gemma":[0.99760306,0.00031704697,0.00034932667,0.0012718445,0.00019088219,0.0002678558],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010667876,0.0006356661,0.0006813221,0.0006732107,0.0003600513,0.0010766824,0.002768197,0.00041572523,0.000026185136],"category_scores_gemma":[0.00005014368,0.00054760143,0.00013034401,0.0005064241,0.0006668959,0.00062281574,0.0011221401,0.00081018545,0.00007728981],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016831963,0.000039887098,0.00020306009,0.00012887378,0.000018380872,0.000101655285,0.0013769073,0.0023665891,0.000050513696,0.11516007,0.000054197462,0.8804982],"study_design_scores_gemma":[0.0006235209,0.00045945978,0.00017755931,0.00026724272,0.000018607743,0.00048238417,4.0870464e-7,0.46320012,0.00034422855,0.4860244,0.046747547,0.0016545295],"about_ca_topic_score_codex":0.000048703932,"about_ca_topic_score_gemma":0.000111749156,"teacher_disagreement_score":0.87884367,"about_ca_system_score_codex":0.00016929067,"about_ca_system_score_gemma":0.00021008568,"threshold_uncertainty_score":0.9999603},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001742312,0.000046786667,0.99269164,0.0039249337,0.00059160416,0.00077636744,0.000038609334,0.00018473738,0.0015710801],"genre_scores_gemma":[0.241818,0.000009841933,0.7476072,0.00955047,0.00047280078,0.00012733332,0.00004361175,0.00005076982,0.00031997182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996351,0.000041377374,0.000471337,0.0016932944,0.0008086954,0.00063428405],"domain_scores_gemma":[0.9974228,0.0005697293,0.00019019206,0.0012278163,0.00029277473,0.00029665694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000321191,0.0005314675,0.000401163,0.00080770487,0.00039172257,0.00054474035,0.0027707692,0.00019707897,0.00014713702],"category_scores_gemma":[0.000041297582,0.00049004075,0.00016925964,0.0008097756,0.0003816807,0.0003461686,0.00033848776,0.0006248724,0.0002777787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005690602,0.00007508558,0.000007675493,0.000010123781,0.0000045360066,0.000027517688,0.00028318758,0.2604867,0.00009332804,0.0017583576,0.00005308888,0.7371947],"study_design_scores_gemma":[0.00034697232,0.00013998174,0.00017118182,0.0003303527,0.0000095175365,0.0000080644095,1.1634118e-7,0.9629491,0.001057482,0.032899924,0.0014216217,0.00066570804],"about_ca_topic_score_codex":0.00006655929,"about_ca_topic_score_gemma":0.00026391275,"teacher_disagreement_score":0.736529,"about_ca_system_score_codex":0.00029666774,"about_ca_system_score_gemma":0.0005205975,"threshold_uncertainty_score":0.99975514},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018848237,0.0002686013,0.97418284,0.00006568199,0.0009331023,0.00048659596,0.00002877934,0.00093121536,0.004254951],"genre_scores_gemma":[0.438582,0.000046257283,0.56103534,0.00006468266,0.00017672998,0.000030037992,0.000024025763,0.000033673896,0.000007230227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984128,0.0000073070237,0.00031764232,0.0006370936,0.0003277691,0.00029739417],"domain_scores_gemma":[0.99900407,0.00026034346,0.00006560309,0.0004324912,0.000092506474,0.00014499862],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014814695,0.0003176275,0.00026976783,0.00045172102,0.00011976893,0.00020863561,0.00038830334,0.00038848695,0.00007954865],"category_scores_gemma":[0.000019832667,0.0003233044,0.000051629195,0.00040816242,0.0009817709,0.00024278354,0.00010078681,0.00080354273,0.000020330088],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041426815,0.000012901828,0.000618941,0.00003308047,0.00002717087,0.000007067526,0.00019082558,0.012283614,0.023835743,0.0011160499,0.000004858178,0.9618656],"study_design_scores_gemma":[0.0003229364,0.00009476396,0.0042293295,0.0003445077,0.00005082267,0.000057501416,6.630538e-7,0.88933396,0.018912219,0.08552938,0.00017075111,0.0009531681],"about_ca_topic_score_codex":0.000016845974,"about_ca_topic_score_gemma":0.0001228287,"teacher_disagreement_score":0.96091247,"about_ca_system_score_codex":0.00006583138,"about_ca_system_score_gemma":0.000051841835,"threshold_uncertainty_score":0.9999219},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013870518,0.00012835386,0.97442037,0.0063648745,0.0016587282,0.0019082224,0.000002999415,0.000031694875,0.0016142476],"genre_scores_gemma":[0.9954891,0.0000022258257,0.0014274797,0.002123669,0.00076748704,0.0000066639154,0.0000035531382,0.000022589558,0.00015723774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812496,0.000030520558,0.00034289414,0.0005000626,0.00074071804,0.00026087475],"domain_scores_gemma":[0.997244,0.0013074277,0.00032469374,0.0008022473,0.00031344217,0.000008203033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018351419,0.00023752246,0.0002779355,0.00047062835,0.0009483175,0.0005739074,0.0016377025,0.00005759642,0.0000535713],"category_scores_gemma":[0.00032115125,0.000116159186,0.00014894431,0.0019536738,0.0004376093,0.00024370279,0.0007115649,0.00032533216,0.000003943545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006221261,0.000283361,0.012258666,0.00024331622,0.0008585999,0.00011660788,0.0035780442,0.59874916,0.000023683264,0.07702385,0.0006869272,0.3061156],"study_design_scores_gemma":[0.0014213277,0.00009013476,0.01804498,0.00023688038,0.0022538474,0.000040445248,0.00064084696,0.83094585,0.000016744361,0.12979354,0.015487643,0.0010277708],"about_ca_topic_score_codex":0.00040803946,"about_ca_topic_score_gemma":0.0024025824,"teacher_disagreement_score":0.9816186,"about_ca_system_score_codex":0.000047568745,"about_ca_system_score_gemma":0.0000431208,"threshold_uncertainty_score":0.72937876},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004319868,0.0026487522,0.9877959,0.00044193576,0.0025187947,0.001310689,4.074431e-7,0.00023905943,0.004612469],"genre_scores_gemma":[0.7567527,0.00021170902,0.23209651,0.0012362225,0.0009514816,0.00045785547,0.000003966182,0.00006879995,0.008220734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632174,0.0001256574,0.0005366362,0.0013736665,0.0010031598,0.00063916494],"domain_scores_gemma":[0.9978222,0.00069532415,0.00030200227,0.00090331037,0.0001626642,0.00011447377],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016430576,0.00048415677,0.0005501018,0.0006169569,0.00093677285,0.0017056663,0.0021008092,0.00015729229,0.0000010232543],"category_scores_gemma":[0.00012693349,0.00033769524,0.00010262455,0.0005636002,0.00038732824,0.00028557642,0.002089871,0.0009332223,0.000012637185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009013265,0.000015719565,0.00077214773,0.00015443048,0.00007203564,0.00033360717,0.0022366908,0.31691796,0.00016620962,0.028180797,0.00008235558,0.65105903],"study_design_scores_gemma":[0.00073090574,0.00084610446,0.0041818433,0.00229942,0.0001386203,0.0006530884,0.00008443421,0.86143076,0.0012916583,0.012912914,0.11288051,0.002549748],"about_ca_topic_score_codex":0.00025770752,"about_ca_topic_score_gemma":0.000048182366,"teacher_disagreement_score":0.7563207,"about_ca_system_score_codex":0.00020954577,"about_ca_system_score_gemma":0.000084924206,"threshold_uncertainty_score":0.9999075},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024225656,0.00031064116,0.9847955,0.0053786696,0.001943373,0.0016790521,0.0000065151066,0.00008410562,0.0055598887],"genre_scores_gemma":[0.7114656,0.0003853419,0.21293704,0.052089833,0.012195543,0.0009525669,0.00027515745,0.00035518096,0.009343763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975918,0.000005128107,0.00048904226,0.00081702013,0.0005767057,0.00052033475],"domain_scores_gemma":[0.9989977,0.00009544546,0.00013475816,0.00055366335,0.000200406,0.00001802873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091411354,0.00036417416,0.0002855981,0.000864844,0.0002512896,0.0003334236,0.0010489896,0.0001291144,0.00015498787],"category_scores_gemma":[0.000034786546,0.00026340506,0.00013391435,0.0006439991,0.0002913708,0.00020551484,0.00046283327,0.00034123266,0.000098501456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022316324,0.00011636971,0.00012934732,0.00019657312,0.000018796998,0.000005941083,0.00021196048,0.39379153,0.000004074291,0.01565261,0.00035711518,0.58949333],"study_design_scores_gemma":[0.0004848676,0.0000128976835,0.00029010282,0.00016620575,0.000017037455,0.0000010325018,8.8928505e-7,0.8953879,0.0000053769268,0.014929822,0.08835071,0.00035316602],"about_ca_topic_score_codex":0.0003029354,"about_ca_topic_score_gemma":0.0017284433,"teacher_disagreement_score":0.77185845,"about_ca_system_score_codex":0.00015655326,"about_ca_system_score_gemma":0.00006134971,"threshold_uncertainty_score":0.9999818},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7244659,0.0022546,0.26970565,0.0005860715,0.0003768874,0.00035344865,0.0000072680473,0.00003481117,0.0022153612],"genre_scores_gemma":[0.9800107,0.00009323193,0.01863163,0.0009627466,0.00020621867,0.0000033957601,0.00002302397,0.000031388478,0.00003766138],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980975,0.000008587504,0.0002682443,0.00095631724,0.00027059982,0.00039874297],"domain_scores_gemma":[0.9992566,0.000019633311,0.00009311939,0.00046996545,0.0000478965,0.00011275339],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018995954,0.00034532193,0.0002902788,0.000119259064,0.000047192098,0.000067404195,0.00057583314,0.00047044634,0.000009131019],"category_scores_gemma":[0.00006684693,0.00033165794,0.00006609605,0.00009981532,0.0003738521,0.000006467373,0.00057586643,0.00045134858,0.0000030265603],"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.000017003424,0.000021671256,0.00007134649,0.00004131543,0.000007455168,0.00011273855,0.000045127257,0.00042467384,0.97305864,0.00037857867,0.0000035203757,0.025817951],"study_design_scores_gemma":[0.00059547357,0.000073254494,0.000024387808,0.0002547183,0.00000815769,0.00008748176,2.3045273e-7,0.0012068682,0.97338814,0.02367804,0.00019274854,0.0004905313],"about_ca_topic_score_codex":0.000007464043,"about_ca_topic_score_gemma":0.000010530274,"teacher_disagreement_score":0.25554478,"about_ca_system_score_codex":0.00009168868,"about_ca_system_score_gemma":0.00020202689,"threshold_uncertainty_score":0.9999136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049679866,0.0002804614,0.99206334,0.0009162718,0.0006427616,0.0009582023,0.0000013067712,0.00021562185,0.0044252127],"genre_scores_gemma":[0.70310843,0.00019126368,0.287748,0.0068951827,0.0008657636,0.000036389098,0.000019463063,0.0001004341,0.001035074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99442077,0.00010078744,0.000660319,0.0022521734,0.0012668491,0.0012990923],"domain_scores_gemma":[0.99671584,0.00041817987,0.00023376483,0.0021719395,0.00020957345,0.00025070625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012821665,0.0007316734,0.00069512567,0.0013998483,0.00015145178,0.00074408343,0.0047494457,0.00032078594,0.000036549976],"category_scores_gemma":[0.00002402348,0.0006410999,0.00011300336,0.001792202,0.0007567222,0.0006256274,0.0018632481,0.0015176355,0.000056722554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011308763,0.000027851664,0.000046343885,0.000014839829,0.000007951307,0.0003496554,0.00030907264,0.61121714,0.000003571513,0.0043524858,0.000051937077,0.38360786],"study_design_scores_gemma":[0.00054092874,0.00048820412,0.00039823336,0.0007813176,0.0000072017447,0.000019745245,3.916983e-7,0.98664397,0.00010172206,0.008799468,0.0014377994,0.00078104483],"about_ca_topic_score_codex":0.000056767334,"about_ca_topic_score_gemma":0.00070596894,"teacher_disagreement_score":0.70431536,"about_ca_system_score_codex":0.0008189058,"about_ca_system_score_gemma":0.0004607443,"threshold_uncertainty_score":0.99960405},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053202606,0.00020817602,0.9844945,0.0009979472,0.0037498428,0.00038922235,0.000015182781,0.00028059704,0.009811305],"genre_scores_gemma":[0.017954271,0.00013537543,0.967643,0.0050397697,0.0020225253,0.000025362968,0.00003684649,0.000089160596,0.0070536854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604714,0.000021820466,0.0004365418,0.0016402573,0.0011058289,0.0007484116],"domain_scores_gemma":[0.9971051,0.00021912243,0.0002512606,0.0021060044,0.00013843809,0.00018003122],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008008342,0.00058400235,0.0005142477,0.000876837,0.00031696065,0.0011538273,0.00529122,0.0003384392,0.00010801456],"category_scores_gemma":[0.00006113977,0.0005199981,0.00014534198,0.00063101243,0.00086484756,0.0014359977,0.0028896395,0.0010458904,0.00012261304],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005275078,0.00003882242,0.00009249368,0.000044883254,0.000019994317,0.00025054027,0.0006118124,0.00033981708,0.00024281321,0.22368824,0.00012653272,0.77453876],"study_design_scores_gemma":[0.0012998995,0.00036716755,0.0009752729,0.00056576444,0.0000340933,0.00009451523,3.5069925e-7,0.46896818,0.0025187926,0.3996887,0.12250714,0.002980145],"about_ca_topic_score_codex":0.000036357713,"about_ca_topic_score_gemma":0.00026223803,"teacher_disagreement_score":0.77155864,"about_ca_system_score_codex":0.00013946828,"about_ca_system_score_gemma":0.00025180896,"threshold_uncertainty_score":0.99988306},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040013307,0.00008989232,0.9980063,0.00025697018,0.00034366944,0.00057519454,0.000008650352,0.00011601821,0.00056331634],"genre_scores_gemma":[0.044584446,0.000026171809,0.95357186,0.0015850697,0.00008003974,0.000035794048,0.000045211367,0.0000123576765,0.00005905819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975121,0.000027601829,0.000630962,0.0006858341,0.0008440678,0.00029943444],"domain_scores_gemma":[0.99802643,0.00032487462,0.00048368308,0.0007340022,0.0003458213,0.00008520191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008452744,0.0002582375,0.00046363164,0.0016139665,0.0001036529,0.00016042717,0.0013755664,0.0002172714,0.000032128708],"category_scores_gemma":[0.0000921086,0.00024043328,0.00017548367,0.0013020599,0.00029991765,0.0005623056,0.00018262184,0.00023815501,0.0000032622165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006502179,0.000022007252,0.000062092375,0.00006590125,0.00003964364,0.0000029616565,0.0003345159,0.06176788,0.00023366706,0.0009011561,0.000012748085,0.9365509],"study_design_scores_gemma":[0.00026240156,0.00015964133,0.00008454789,0.0001733972,0.000071674185,0.0000019321828,1.7925522e-7,0.96826816,0.019487344,0.01117987,0.00005352918,0.00025735653],"about_ca_topic_score_codex":0.000019462814,"about_ca_topic_score_gemma":0.00004578244,"teacher_disagreement_score":0.93629354,"about_ca_system_score_codex":0.0001985288,"about_ca_system_score_gemma":0.0002652593,"threshold_uncertainty_score":0.98045844},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016805768,0.00017253916,0.9934807,0.000102468126,0.0011568278,0.00025463555,0.000009774375,0.000042975473,0.0030995444],"genre_scores_gemma":[0.54697067,0.000025044435,0.4525676,0.00017073625,0.00012412762,0.0000024166434,0.000009712146,0.0000148775935,0.00011478535],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971914,0.000031712836,0.00070358464,0.00090414495,0.0008205279,0.0003486075],"domain_scores_gemma":[0.99767697,0.0003280155,0.00059180736,0.0008405456,0.0004581843,0.000104480074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088916696,0.00034313614,0.00057916297,0.0012563138,0.0001457047,0.00007760162,0.001999767,0.00021249233,0.000025610634],"category_scores_gemma":[0.00007703664,0.00033505092,0.00016990668,0.0010072177,0.00089282275,0.00041381386,0.0005153535,0.00041570206,0.000008223002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035041056,0.00014362436,0.00034919987,0.00028021177,0.0000570974,0.000037113146,0.0034477022,0.036471754,0.005501368,0.35723382,0.000060298597,0.5963828],"study_design_scores_gemma":[0.00031057323,0.00036413458,0.001209642,0.0004743593,0.000014254457,0.000044072796,2.2444569e-7,0.24202226,0.042381596,0.7123719,0.00027616607,0.00053083576],"about_ca_topic_score_codex":0.00006692281,"about_ca_topic_score_gemma":0.000040810934,"teacher_disagreement_score":0.59585196,"about_ca_system_score_codex":0.00007900434,"about_ca_system_score_gemma":0.00044821447,"threshold_uncertainty_score":0.9999102},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000180402,0.00025712053,0.9983898,0.00006770704,0.00020994153,0.00060013076,0.000004438115,0.00014248717,0.00014802121],"genre_scores_gemma":[0.57825434,0.000046840032,0.42163438,0.000015297695,0.0000131715815,0.000014669532,0.000007176296,0.000009215748,0.0000049382847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978983,0.000021753916,0.0007004002,0.0005832369,0.0005781407,0.00021819447],"domain_scores_gemma":[0.9983282,0.000080944024,0.00038265734,0.00096899533,0.00019953137,0.000039678696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000685336,0.00024451065,0.00040835576,0.0011879783,0.000026624448,0.000046043257,0.0015974386,0.00023981162,3.603974e-7],"category_scores_gemma":[0.0000063429447,0.00025286694,0.000069050875,0.00073348946,0.00017699452,0.00044841255,0.00009872166,0.00030278802,0.0000011264273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021646906,0.000018780045,0.000014475344,0.00011042858,0.0000019992112,9.3484675e-7,0.0005104704,0.16692682,0.0012921307,0.10522812,3.1750517e-7,0.7258934],"study_design_scores_gemma":[0.000101289,0.00009139062,0.00052877027,0.0004313826,0.0000028572513,0.000007795832,4.6690708e-8,0.95752233,0.002809639,0.038103096,0.00018445117,0.000216979],"about_ca_topic_score_codex":0.000048772177,"about_ca_topic_score_gemma":0.00001680363,"teacher_disagreement_score":0.7905955,"about_ca_system_score_codex":0.00022265875,"about_ca_system_score_gemma":0.00013072572,"threshold_uncertainty_score":0.9999924},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081391155,0.00014304847,0.98401326,0.009189279,0.0016699958,0.0003726524,0.0000027247302,0.00006344792,0.0037316522],"genre_scores_gemma":[0.9563432,0.000014866919,0.03887897,0.0036022034,0.00049088686,0.0000073970155,0.0000016493555,0.000023188866,0.00063767924],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751705,0.000060479,0.0004462188,0.0007300274,0.000906343,0.0003398632],"domain_scores_gemma":[0.997706,0.00072776125,0.00037339682,0.00097591284,0.0001593603,0.00005757332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005906608,0.00034016915,0.00030794844,0.00026027852,0.00032674178,0.00024363094,0.0030940368,0.00014383493,0.000011751961],"category_scores_gemma":[0.0001037749,0.000195492,0.00015566612,0.0005754286,0.00078715006,0.00036111256,0.001036126,0.00055736315,0.000024744648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005992836,0.000022295011,0.000008655942,0.000014312686,0.000008607079,0.0000033235867,0.00073395466,0.12253978,0.0000830577,0.2873206,0.000097466305,0.58916193],"study_design_scores_gemma":[0.00015290569,0.0001413235,0.00048578408,0.00040085992,0.00000609604,0.000035340574,1.6960354e-7,0.41201198,0.0027596734,0.5826055,0.0010671671,0.00033320003],"about_ca_topic_score_codex":0.00001735906,"about_ca_topic_score_gemma":0.00007187443,"teacher_disagreement_score":0.9555293,"about_ca_system_score_codex":0.00016737785,"about_ca_system_score_gemma":0.0003818941,"threshold_uncertainty_score":0.7971932},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041518707,0.00006796031,0.9963711,0.000078298646,0.0022465328,0.0005719057,0.00003984137,0.000044880635,0.00016429905],"genre_scores_gemma":[0.111740224,0.000009119245,0.8877457,0.00017227503,0.00018996058,0.000011821329,0.0000024730086,0.000025515215,0.0001029459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712294,0.00013928008,0.00051384553,0.0011071706,0.0005764441,0.0005403115],"domain_scores_gemma":[0.9972165,0.0012314466,0.00037878193,0.00074928056,0.0003351118,0.00008888589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017068197,0.0004123117,0.0006120338,0.0007215127,0.00014553178,0.000246123,0.0013427909,0.00030665338,0.000004450693],"category_scores_gemma":[0.00042601474,0.00039789418,0.00011285037,0.00045833673,0.00041495936,0.0005734337,0.00039219155,0.0005614143,0.000002551642],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008734249,0.0000637956,0.000013004379,0.000094390394,0.000009979857,0.000035599598,0.00047842602,0.021969862,0.09178978,0.0016896244,0.00000632297,0.8837619],"study_design_scores_gemma":[0.0012218032,0.00031410737,0.0004049849,0.00017861654,0.000009629903,0.000019813686,8.0236006e-8,0.6600842,0.24547653,0.091631755,0.00014511513,0.00051334745],"about_ca_topic_score_codex":0.00018676736,"about_ca_topic_score_gemma":0.00013455917,"teacher_disagreement_score":0.8832485,"about_ca_system_score_codex":0.00023472798,"about_ca_system_score_gemma":0.00033629718,"threshold_uncertainty_score":0.9998473},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005207989,0.00023716033,0.9946622,0.00031821325,0.0009758328,0.0009434462,0.000009731021,0.00036742404,0.0024807656],"genre_scores_gemma":[0.02164626,0.000118094504,0.9757761,0.0015110263,0.000489414,0.0000503814,0.000014747024,0.000043358967,0.00035063928],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968003,0.000021767039,0.00050489156,0.0013872577,0.0006399413,0.0006458272],"domain_scores_gemma":[0.99745864,0.00064333767,0.00030626415,0.0009254705,0.00051995687,0.0001463393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006673548,0.00047967787,0.00049119425,0.00062673906,0.0002586519,0.00054132,0.0022119253,0.00032647335,0.00003087909],"category_scores_gemma":[0.00019359877,0.00044256574,0.00016643174,0.00041326918,0.00053553423,0.0012199103,0.0007767347,0.0005759115,0.00007511475],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005294146,0.000010391275,0.0000012221669,0.00003671615,0.000004573858,0.00001493256,0.000106321706,0.00057125883,0.0002459443,0.0055037155,0.00005267553,0.99344695],"study_design_scores_gemma":[0.0002728698,0.000467393,0.000009730544,0.0005632475,0.000008719862,0.000049987295,1.0393077e-7,0.30610457,0.04566758,0.6421932,0.003876888,0.000785691],"about_ca_topic_score_codex":0.000019399806,"about_ca_topic_score_gemma":0.000023579749,"teacher_disagreement_score":0.99266124,"about_ca_system_score_codex":0.0003188675,"about_ca_system_score_gemma":0.0003896902,"threshold_uncertainty_score":0.9998026},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008839254,0.00061864656,0.9882647,0.0007035766,0.0017599248,0.0006534986,0.0000010655116,0.0001643887,0.0077458145],"genre_scores_gemma":[0.8970956,0.000011713428,0.10090214,0.00063730613,0.0005188781,0.00002159908,0.000012566244,0.000034058707,0.0007660956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958099,0.000047640486,0.00070542813,0.0015742686,0.0011712214,0.00069153414],"domain_scores_gemma":[0.9979448,0.00028935165,0.00031808467,0.0010971696,0.00019550575,0.00015510345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010441227,0.0004935606,0.00050494756,0.00091227656,0.00023635621,0.00046424955,0.0023204978,0.00045109502,0.00003953333],"category_scores_gemma":[0.000101959384,0.00044321254,0.00013718073,0.0009173306,0.0005036132,0.000696818,0.0007539725,0.0008380167,0.00013996576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029268801,0.000044099186,0.00079759344,0.000044539356,0.000007985846,0.00009896673,0.0011759072,0.04658187,0.000020404079,0.8015519,0.00001059007,0.14966325],"study_design_scores_gemma":[0.00044550025,0.000115418086,0.0015218514,0.00013149763,0.000003817014,0.00006350068,1.452468e-7,0.1352271,0.00012113313,0.85973424,0.0020197032,0.0006160801],"about_ca_topic_score_codex":0.000091436516,"about_ca_topic_score_gemma":0.0002273337,"teacher_disagreement_score":0.8970072,"about_ca_system_score_codex":0.00066191587,"about_ca_system_score_gemma":0.0010304919,"threshold_uncertainty_score":0.999802},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014397805,0.0007456286,0.9969677,0.000031892036,0.0012431338,0.0004600956,0.000012045575,0.000113249735,0.00028229918],"genre_scores_gemma":[0.6211045,0.000035727197,0.37757492,0.00005927017,0.00053215795,0.00003807538,0.000030392732,0.000051705887,0.0005732663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895346,0.000003103317,0.0002625565,0.00031574207,0.00022109131,0.0002440167],"domain_scores_gemma":[0.99940854,0.000062683124,0.00007382592,0.00031395513,0.00008573541,0.00005524125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028386494,0.00020586253,0.00021113038,0.00024775858,0.00009014876,0.00012432372,0.00029107064,0.00017037652,0.0000052544683],"category_scores_gemma":[0.000025227328,0.00019502259,0.00006184625,0.00007130316,0.0000639115,0.00024936206,0.00005767378,0.00016214195,0.000017813913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.964082e-7,0.000003278824,0.0000025721486,0.00005000259,0.0000023232753,1.3270704e-7,0.00018719214,0.56697273,0.0019549753,0.0005185817,0.000010466755,0.43029675],"study_design_scores_gemma":[0.00015713047,0.000009559011,0.00008496884,0.00014049577,0.0000074802992,0.0000023456757,6.0465446e-8,0.9935587,0.00058824837,0.00489599,0.00034413792,0.00021089596],"about_ca_topic_score_codex":0.0000071606237,"about_ca_topic_score_gemma":0.00005391982,"teacher_disagreement_score":0.6209605,"about_ca_system_score_codex":0.00015722177,"about_ca_system_score_gemma":0.00003668993,"threshold_uncertainty_score":0.795279},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051447363,0.00017546616,0.99177694,0.0003039734,0.00050170696,0.0005667759,0.0000120971745,0.00008963617,0.0014286437],"genre_scores_gemma":[0.06910294,0.000008876739,0.9291503,0.0004486185,0.0003225831,0.000009579161,0.0000014196123,0.00004307691,0.0009126191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99397326,0.00008783892,0.0008172036,0.0020413287,0.00229939,0.00078100985],"domain_scores_gemma":[0.99614644,0.0015561264,0.00052824867,0.0010390703,0.0004587032,0.00027141112],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021174538,0.0006626723,0.0008509437,0.0011077918,0.0003693903,0.0010715043,0.0019080683,0.00033240704,0.000059797247],"category_scores_gemma":[0.0017586988,0.00046690283,0.00012685853,0.00080342166,0.0009546043,0.00037043367,0.00070667686,0.00081029226,0.000008103974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035613888,0.000011824496,0.00028702006,0.000010478263,0.0000037742773,0.00009320898,0.0008484639,0.056638945,0.000066412395,0.00014410229,0.000010495541,0.94184965],"study_design_scores_gemma":[0.0003146527,0.0005154039,0.002341557,0.00025056276,0.000017700448,0.00034373484,2.729344e-7,0.91057587,0.00010203259,0.08427026,0.0005223545,0.00074559794],"about_ca_topic_score_codex":0.000010534807,"about_ca_topic_score_gemma":0.00013039594,"teacher_disagreement_score":0.94110405,"about_ca_system_score_codex":0.00015501052,"about_ca_system_score_gemma":0.0008960735,"threshold_uncertainty_score":0.9999655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001954195,0.00024681576,0.9914022,0.0006767192,0.00073853903,0.00023424078,0.000010018649,0.00027164383,0.0064178314],"genre_scores_gemma":[0.0053275833,0.000046573285,0.9912097,0.00078741385,0.0006049279,0.000008806065,0.000010677227,0.000028889795,0.001975463],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970856,0.0000150359765,0.00038762335,0.001401725,0.000535713,0.0005743119],"domain_scores_gemma":[0.99748856,0.00036390332,0.00023492324,0.0015275456,0.00016977872,0.00021528105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065266126,0.0004162646,0.00047027157,0.0009935087,0.00032168048,0.00041169196,0.0040905206,0.00025393922,0.00004178263],"category_scores_gemma":[0.000094954165,0.00037564596,0.00021273633,0.0005833657,0.00025888975,0.000643248,0.0013442452,0.00044581882,0.000043307024],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000216746,0.000008197456,0.000007685713,0.00001220867,0.000013409589,0.000012423135,0.00037131738,0.0002758453,0.000078754005,0.021083778,0.000555895,0.97757834],"study_design_scores_gemma":[0.00046972497,0.0005304773,0.000034146917,0.0012331146,0.00009114866,0.000075862816,5.555692e-7,0.31465384,0.013610734,0.51747257,0.14968795,0.0021398605],"about_ca_topic_score_codex":0.00009334525,"about_ca_topic_score_gemma":0.00005061769,"teacher_disagreement_score":0.9754385,"about_ca_system_score_codex":0.00014196105,"about_ca_system_score_gemma":0.00062935124,"threshold_uncertainty_score":0.9998695},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016086015,0.0058088573,0.9772846,0.0019068869,0.0043866644,0.0015467928,0.0000074138434,0.00086274266,0.006587401],"genre_scores_gemma":[0.29343727,0.00023482816,0.7012896,0.0016004415,0.0025473165,0.000041804306,0.000008129565,0.00016972744,0.0006708998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9870286,0.00018333456,0.0022133936,0.004841929,0.0030648094,0.002667938],"domain_scores_gemma":[0.9918569,0.0010311755,0.0013510482,0.004442456,0.0007037903,0.0006146856],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0029585294,0.0019062198,0.0019266261,0.0015947017,0.001019918,0.0027536831,0.009856697,0.0012096431,0.00007013939],"category_scores_gemma":[0.00033528102,0.0018847313,0.00066662,0.0019574957,0.0011578082,0.0037004715,0.0037967984,0.0035313088,0.0007226314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002038976,0.00010800237,0.00013353796,0.00024710072,0.000119657634,0.0004239419,0.0024900506,0.71892655,0.0028332316,0.017722424,0.000022460974,0.25695264],"study_design_scores_gemma":[0.0012872926,0.00027325103,0.00009063214,0.0030277553,0.000056170084,0.00065682497,0.0000025676839,0.93865615,0.010399803,0.038843207,0.0038585109,0.002847856],"about_ca_topic_score_codex":0.0001147061,"about_ca_topic_score_gemma":0.00009556158,"teacher_disagreement_score":0.29182866,"about_ca_system_score_codex":0.0014610727,"about_ca_system_score_gemma":0.0024365769,"threshold_uncertainty_score":0.9993682},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000053482613,0.0006386396,0.9941624,0.00065762096,0.00061749713,0.0003539988,0.000030146823,0.0003159361,0.0032184257],"genre_scores_gemma":[0.011842925,0.00019017662,0.9832343,0.001768677,0.00029138496,0.000012938836,0.000015307316,0.000036270158,0.0026080534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963328,0.000029771665,0.0005744242,0.0013117845,0.0011402172,0.0006109883],"domain_scores_gemma":[0.99736756,0.0005711163,0.0003728559,0.0011509273,0.00035531216,0.000182224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073850685,0.00046751573,0.00046230364,0.000971846,0.00024064169,0.00070512685,0.0033378315,0.00035666357,0.000042341846],"category_scores_gemma":[0.0001703616,0.00043649183,0.000083196464,0.001213194,0.0006387643,0.0005905543,0.0008939147,0.0008300868,0.00009768073],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024339556,0.00003162925,0.000011680748,0.00001907751,0.0000056379076,0.000023174916,0.00010973562,0.00024117941,0.00045488658,0.039789114,0.0003235103,0.95898795],"study_design_scores_gemma":[0.00036240823,0.00038892825,0.00008505305,0.00027804272,0.000014876704,0.000082511324,1.2559698e-7,0.71408576,0.03838321,0.19106343,0.053696156,0.0015594998],"about_ca_topic_score_codex":0.000011780138,"about_ca_topic_score_gemma":0.000008953743,"teacher_disagreement_score":0.95742846,"about_ca_system_score_codex":0.00048039187,"about_ca_system_score_gemma":0.00053193624,"threshold_uncertainty_score":0.99980867},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005142449,0.00034655439,0.9928955,0.00029434453,0.00018715327,0.0004930967,0.000008665421,0.00014412095,0.005116311],"genre_scores_gemma":[0.356645,0.0008672572,0.6416568,0.0002917228,0.00013565559,0.000055951918,0.000019633751,0.000031575026,0.00029637458],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964723,0.000054823784,0.00076772476,0.0013661084,0.0008051842,0.00053384603],"domain_scores_gemma":[0.99769473,0.00031692136,0.0002983458,0.0014065433,0.00015189344,0.00013157357],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043251234,0.00050063134,0.00091809034,0.0026236766,0.0000699193,0.00028564068,0.0019999458,0.00025578795,0.00012575871],"category_scores_gemma":[0.00001951842,0.000433852,0.00033258912,0.0019144015,0.0005267325,0.0005213321,0.00036625325,0.00028621708,0.00003390435],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049142936,0.00009910152,0.00019842012,0.000012246679,0.000048402144,0.00012540055,0.0006299096,0.0016783846,0.00008675593,0.0026318314,0.0000020424372,0.9944826],"study_design_scores_gemma":[0.0012930337,0.0018074078,0.001834205,0.00056827214,0.00019469562,0.00007697117,4.0948674e-7,0.24623407,0.050612587,0.6934118,0.0020298965,0.0019366257],"about_ca_topic_score_codex":0.00019517273,"about_ca_topic_score_gemma":0.00043298388,"teacher_disagreement_score":0.99254596,"about_ca_system_score_codex":0.0005721185,"about_ca_system_score_gemma":0.00028435345,"threshold_uncertainty_score":0.99981135},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003312094,0.00027816344,0.99409854,0.0011841367,0.0020223907,0.00048055706,0.00000355503,0.00015527262,0.0017442761],"genre_scores_gemma":[0.001856237,0.000029726047,0.9940937,0.001944601,0.0006203547,0.000011502569,0.0000036085034,0.000021313712,0.0014189435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680007,0.0000636241,0.0005106113,0.0014114557,0.00057072507,0.0006434942],"domain_scores_gemma":[0.9978161,0.00054915156,0.00020918695,0.0010211588,0.0002318468,0.00017258285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010650107,0.00043944467,0.0005317544,0.0005915909,0.000317073,0.00053580623,0.0023798558,0.00047372843,0.000010958037],"category_scores_gemma":[0.0001240284,0.00040179328,0.00022241914,0.00033114944,0.00047955493,0.00055278005,0.00045485017,0.0008514015,0.000016274054],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001551927,0.00001967199,0.0000060602906,0.00001729351,0.0000052154196,0.000024777062,0.00029683384,0.0020773332,0.00015305344,0.0042738887,0.000029737923,0.9930806],"study_design_scores_gemma":[0.000661098,0.00025612707,0.00007453114,0.00020307791,0.0000082420365,0.00014553482,7.011419e-8,0.6556964,0.0011426548,0.34006533,0.0012280777,0.0005188579],"about_ca_topic_score_codex":0.000010455572,"about_ca_topic_score_gemma":0.000039402417,"teacher_disagreement_score":0.99256176,"about_ca_system_score_codex":0.00015842833,"about_ca_system_score_gemma":0.00037275057,"threshold_uncertainty_score":0.9998434},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065595536,0.0002759187,0.9887635,0.00056260877,0.0012698125,0.00091118086,0.00002166412,0.00016566594,0.0014700913],"genre_scores_gemma":[0.9561402,0.000018842587,0.042903047,0.0005919311,0.00022101673,0.000035497535,0.000014585991,0.00003349055,0.000041350133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99485475,0.00011926507,0.00073341443,0.0024966071,0.0010286021,0.0007673724],"domain_scores_gemma":[0.9963496,0.0007977228,0.00034856025,0.0020118454,0.00022920025,0.0002631099],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001996575,0.00066535093,0.0008763051,0.0010580558,0.0002015537,0.00085371383,0.0033121882,0.00061994826,0.000014923592],"category_scores_gemma":[0.00018662035,0.00063391693,0.00012788421,0.0006465692,0.0009391801,0.0011204869,0.00331034,0.0019458646,0.000030350022],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060411926,0.00013410585,0.007285066,0.00021964232,0.0000130225,0.00011272612,0.0040996787,0.000098471646,0.00014236876,0.0005542696,0.000006323631,0.9873283],"study_design_scores_gemma":[0.0027227188,0.00054327154,0.020541975,0.0018065326,0.00003069924,0.0023043915,0.0000040894006,0.6003568,0.0028655562,0.35905895,0.0050397688,0.0047252234],"about_ca_topic_score_codex":0.00047477384,"about_ca_topic_score_gemma":0.0032734785,"teacher_disagreement_score":0.9826031,"about_ca_system_score_codex":0.00030382196,"about_ca_system_score_gemma":0.000575832,"threshold_uncertainty_score":0.9996112},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004864273,0.00009510161,0.99375343,0.00019170073,0.00028939312,0.00055557233,0.00001891352,0.00004711465,0.00018447374],"genre_scores_gemma":[0.80843866,0.00007022912,0.19095863,0.0003430562,0.00006352414,0.000005230829,0.00005417853,0.000014835341,0.00005165104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818623,0.000037593898,0.00045915053,0.0006110629,0.0004979979,0.00020795927],"domain_scores_gemma":[0.99845845,0.00010435802,0.00034423333,0.00041013554,0.0005537354,0.00012907706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006705231,0.00022372308,0.00026011,0.0007313335,0.00018107757,0.00025651665,0.00044583165,0.00016434255,0.000007650225],"category_scores_gemma":[0.000058272657,0.00021805581,0.00001604957,0.00072854466,0.00015498209,0.0011818485,0.00021142139,0.00013027439,0.0000053264466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001639565,0.00007704365,0.00080015,0.00023357371,0.000018190907,0.000015208809,0.01758455,0.027547037,0.0049182763,0.040541932,0.00004445358,0.9082032],"study_design_scores_gemma":[0.00033546294,0.00045148862,0.0035496168,0.000352238,0.000011186359,0.000040606745,0.0000059199774,0.9800332,0.0051433104,0.009369623,0.00029198575,0.00041536833],"about_ca_topic_score_codex":0.000020930818,"about_ca_topic_score_gemma":0.0003589642,"teacher_disagreement_score":0.95248616,"about_ca_system_score_codex":0.00014599603,"about_ca_system_score_gemma":0.00017868899,"threshold_uncertainty_score":0.8892058},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002073252,0.00022816831,0.98363733,0.00026955252,0.00037114095,0.0003042487,6.402768e-7,0.00017544266,0.012940214],"genre_scores_gemma":[0.9420471,0.000009567983,0.052982323,0.002806623,0.0017868958,0.000009278912,0.00002695628,0.00008749477,0.0002437538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969179,0.000015915699,0.0005318149,0.0013217911,0.0005538898,0.0006586697],"domain_scores_gemma":[0.9981761,0.0003035704,0.00044812422,0.0008535264,0.00019985774,0.000018806548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011250643,0.0005320224,0.00062149327,0.0010676057,0.00024395685,0.00049558154,0.000994279,0.00025371258,0.000036798992],"category_scores_gemma":[0.00010959707,0.00046021174,0.0001089346,0.0014206622,0.00064834167,0.0012226896,0.0006522429,0.0009149362,0.00001827893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031811618,0.000019802716,0.0013135499,0.000050484214,0.000008657445,0.00008716423,0.00002947246,0.92222095,0.000006546683,0.0073175463,0.000006909038,0.06890712],"study_design_scores_gemma":[0.00027784842,0.000014670085,0.00041356322,0.0007109282,0.000032710053,0.000005493097,4.5191345e-7,0.85644513,0.000018302984,0.14037034,0.0010970442,0.00061348325],"about_ca_topic_score_codex":0.00040552166,"about_ca_topic_score_gemma":0.0021161898,"teacher_disagreement_score":0.93997383,"about_ca_system_score_codex":0.00029899497,"about_ca_system_score_gemma":0.0000749081,"threshold_uncertainty_score":0.99978495},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011567171,0.000022530285,0.98765653,0.000060534865,0.0006423443,0.0002939821,0.000035736866,0.00001148518,0.010120134],"genre_scores_gemma":[0.34130815,0.0000835963,0.65782017,0.0002980389,0.00012356418,0.000006051814,0.00018509424,0.000014435211,0.00016092068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982845,0.000007573244,0.00038256598,0.00046463063,0.0006343502,0.00022637587],"domain_scores_gemma":[0.99895614,0.0001001551,0.00022125801,0.0006575112,0.000017865921,0.00004704779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056983676,0.00018066324,0.00018938111,0.00016426736,0.000061438084,0.000071202194,0.0012199836,0.00014771995,0.00010505583],"category_scores_gemma":[0.000042646687,0.00015083906,0.000019247162,0.00021597919,0.00029357805,0.00042898,0.0019701833,0.0003145939,0.000032672844],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004136821,0.000009958785,0.000501496,0.000027656735,0.000002302036,0.000009786801,0.000341815,0.010474005,0.00013065185,0.0001554254,0.00003261446,0.98831016],"study_design_scores_gemma":[0.0011932905,0.0002367323,0.10488476,0.0021233682,0.00004325582,0.000037783484,0.0000060195616,0.79285425,0.0017691016,0.050685987,0.044646274,0.0015192061],"about_ca_topic_score_codex":0.00043670845,"about_ca_topic_score_gemma":0.0018896003,"teacher_disagreement_score":0.98679096,"about_ca_system_score_codex":0.00010371465,"about_ca_system_score_gemma":0.0000236742,"threshold_uncertainty_score":0.61510384},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021372782,0.0011622813,0.9911989,0.0010720328,0.0003857662,0.0010230626,0.0000028146335,0.00021937786,0.0027984793],"genre_scores_gemma":[0.8525154,0.00078038,0.143226,0.0011021681,0.00076253753,0.00013078241,0.00003558561,0.0001135361,0.0013336274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993825,0.00022338261,0.0008335356,0.002116251,0.0017404801,0.0012613243],"domain_scores_gemma":[0.9939718,0.0011123227,0.0004534467,0.0036763449,0.00046953288,0.00031653163],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0022010854,0.0007230644,0.0007272114,0.0012505573,0.0004195731,0.0012217495,0.007816945,0.00061354984,0.0000400306],"category_scores_gemma":[0.000052677286,0.000662935,0.000117453295,0.0020968707,0.001597423,0.00123506,0.0022511918,0.0024036132,0.00004049014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025651263,0.000039182498,0.00045346306,0.000013034114,0.0000084523535,0.00004592814,0.00049997197,0.61660576,0.000013626357,0.0021869482,0.000035882436,0.38007212],"study_design_scores_gemma":[0.00066640234,0.00021290703,0.0010158828,0.0006261173,0.000004138476,0.00006655742,7.952167e-7,0.9880384,0.0001944471,0.0013680863,0.0069946293,0.00081164116],"about_ca_topic_score_codex":0.000071859686,"about_ca_topic_score_gemma":0.000747279,"teacher_disagreement_score":0.8503781,"about_ca_system_score_codex":0.0011254194,"about_ca_system_score_gemma":0.00082901726,"threshold_uncertainty_score":0.9998979},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001516323,0.00017801876,0.99440354,0.0010291984,0.0005664606,0.00039170994,0.0000066282155,0.00013259075,0.0031402325],"genre_scores_gemma":[0.4007366,0.00012044125,0.5935165,0.00472375,0.00033212453,0.000027690836,0.000013124314,0.00005250669,0.00047723667],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965953,0.000020222697,0.00049610675,0.0013522768,0.00085801294,0.000678068],"domain_scores_gemma":[0.997682,0.00021789389,0.00019647914,0.001554336,0.0001284245,0.0002208723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006160927,0.00042370675,0.00042671186,0.00088980485,0.00015841336,0.00048138376,0.0035005226,0.0003039884,0.000033626966],"category_scores_gemma":[0.00014203096,0.00040216924,0.00008251411,0.00094722456,0.0004189845,0.0006609126,0.0011840265,0.00073008897,0.00012504485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022999204,0.000056601966,0.00008787065,0.000029591682,0.0000044981757,0.00008403381,0.0007071797,0.043799285,0.000027407688,0.07582325,0.000032596927,0.87934536],"study_design_scores_gemma":[0.00054724555,0.00023635254,0.0028982738,0.00075877225,0.000004493655,0.00005918314,1.2848618e-7,0.10605793,0.00048022662,0.8840377,0.0039380025,0.0009816999],"about_ca_topic_score_codex":0.00012083471,"about_ca_topic_score_gemma":0.00019437155,"teacher_disagreement_score":0.87836367,"about_ca_system_score_codex":0.00072398887,"about_ca_system_score_gemma":0.0009688231,"threshold_uncertainty_score":0.999843},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009724913,0.0020216312,0.985316,0.00009867216,0.00077341637,0.00043596956,0.00009280458,0.0000144183905,0.0015221697],"genre_scores_gemma":[0.95005345,0.00031075618,0.04787832,0.0002846727,0.0007654189,0.0000026056666,0.00002452459,0.000024718214,0.0006555351],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987917,0.000013211199,0.00021461541,0.0005358226,0.00026573043,0.0001789278],"domain_scores_gemma":[0.9993141,0.00004262938,0.0001304312,0.00036229411,0.00009305796,0.000057466954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015271055,0.00021322105,0.000199216,0.00009247555,0.00005286678,0.000027467677,0.00029670083,0.00030453625,0.000029722918],"category_scores_gemma":[0.0000618851,0.00018618202,0.00004297672,0.000036166253,0.00025907776,0.0000041332,0.0002023921,0.00012694497,0.0000017425385],"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.000025938123,0.000008871143,0.000020416956,0.00003474272,0.000016500815,0.0000065547206,0.0000590816,0.008355675,0.5401545,0.00023130783,0.000010277596,0.45107615],"study_design_scores_gemma":[0.0002922764,0.00074728153,0.000032920892,0.000228959,0.000021286181,0.000076012344,1.8801515e-7,0.012083922,0.95322037,0.014164312,0.018734122,0.00039837183],"about_ca_topic_score_codex":0.000003290292,"about_ca_topic_score_gemma":0.000013572476,"teacher_disagreement_score":0.94032854,"about_ca_system_score_codex":0.000025758138,"about_ca_system_score_gemma":0.00008495361,"threshold_uncertainty_score":0.7592282},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017172075,0.0006661965,0.9971007,0.0002123639,0.0006268287,0.00047171957,0.00005060625,0.0000148029,0.00083959167],"genre_scores_gemma":[0.004178487,0.000048100315,0.989482,0.0004868985,0.0012857511,0.000029597199,0.0006005913,0.00003801933,0.0038505758],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99795526,0.000018240687,0.00026571148,0.001194845,0.00029475483,0.00027121385],"domain_scores_gemma":[0.99833906,0.000030349333,0.00017538392,0.0012908675,0.00007338519,0.00009094659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037688526,0.0002532423,0.00019872971,0.00012807551,0.000105995634,0.00008385201,0.0011342488,0.00026070175,0.000018679859],"category_scores_gemma":[0.00003093154,0.00022366924,0.000058385296,0.000069889655,0.00007082712,0.000009935555,0.0009715631,0.00012924368,0.0000026655841],"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.000030948828,0.000010768991,0.0000056523063,0.000027589393,0.0000057768657,0.0000011462284,0.000024207358,0.00966195,0.6189713,0.000025153033,0.006889883,0.36434564],"study_design_scores_gemma":[0.00047531148,0.00014954543,0.000019045045,0.00018525167,0.000013394916,0.000013169223,2.0952976e-7,0.09129636,0.77864295,0.0025964293,0.12617029,0.00043805418],"about_ca_topic_score_codex":0.000014315015,"about_ca_topic_score_gemma":0.00003253107,"teacher_disagreement_score":0.3639076,"about_ca_system_score_codex":0.000056338686,"about_ca_system_score_gemma":0.00036108986,"threshold_uncertainty_score":0.9120967},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034979868,0.00020124555,0.9836108,0.0075249895,0.002289417,0.00087164406,0.000018647379,0.0007265714,0.0012586713],"genre_scores_gemma":[0.11547013,0.000014368541,0.87410754,0.009966266,0.00019894267,0.00004157471,0.00001868912,0.00006985682,0.00011261512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937646,0.000037730344,0.00085557543,0.0025199363,0.0014486739,0.001373507],"domain_scores_gemma":[0.99556917,0.00054745766,0.00040814833,0.0027281311,0.00049511006,0.00025199956],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010357966,0.00093258737,0.0008055582,0.0020319484,0.00029346783,0.00091949356,0.0097649535,0.0008446264,0.000039225582],"category_scores_gemma":[0.00023056744,0.0009145593,0.00008983754,0.003054412,0.00031098915,0.0008029028,0.006669666,0.0025639764,0.00009947439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000222289,0.000048256014,0.0003348907,0.00018590952,0.000023291732,0.00029220968,0.0039951685,0.36537963,0.0038790067,0.0040553054,0.000072308336,0.6217118],"study_design_scores_gemma":[0.0005324447,0.00016864696,0.004142229,0.0011883649,0.000008990891,0.000126068,0.0000012863253,0.8737382,0.0014527588,0.11455764,0.002448335,0.0016349823],"about_ca_topic_score_codex":0.00021906702,"about_ca_topic_score_gemma":0.009592963,"teacher_disagreement_score":0.6200768,"about_ca_system_score_codex":0.0007004861,"about_ca_system_score_gemma":0.0006810246,"threshold_uncertainty_score":0.99973714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010695037,0.00030077418,0.9905195,0.0016022486,0.0043414338,0.0009094885,0.00006553309,0.00023332331,0.0009581934],"genre_scores_gemma":[0.01553995,0.000016915204,0.9772611,0.004506596,0.002401613,0.000054184176,0.000049472317,0.000050767456,0.0001194025],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99545604,0.00003847085,0.000629677,0.0021294106,0.000870462,0.0008759536],"domain_scores_gemma":[0.9970319,0.00053430663,0.0003027769,0.0016633909,0.00020976223,0.00025786375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005383888,0.00065539253,0.00071888475,0.0007798072,0.00035819018,0.00093852286,0.003481504,0.00042162716,0.0000152893],"category_scores_gemma":[0.00009422802,0.00058912346,0.00023584861,0.00050014455,0.0003152132,0.00046646176,0.0011191568,0.0006938983,0.000078439414],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034959703,0.000059293416,0.0000150011465,0.000042032156,0.000026041387,0.000056719808,0.0012353354,0.07100767,0.000088489316,0.03217888,0.0010606761,0.8941949],"study_design_scores_gemma":[0.0003091269,0.00020368976,0.00007290629,0.00029086947,0.000014540649,0.000023019793,2.0031763e-7,0.28741133,0.00039042797,0.7061862,0.0043486813,0.0007490274],"about_ca_topic_score_codex":0.00023099768,"about_ca_topic_score_gemma":0.000031714044,"teacher_disagreement_score":0.89344585,"about_ca_system_score_codex":0.00036822062,"about_ca_system_score_gemma":0.00032969125,"threshold_uncertainty_score":0.999656},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020013656,0.00019298264,0.9937898,0.0005342375,0.0017822774,0.00048346634,0.000028049333,0.00027067855,0.0027183788],"genre_scores_gemma":[0.009295162,0.00003610111,0.988339,0.0005541957,0.00035493687,0.000014446358,0.00001330225,0.000030501385,0.001362333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654084,0.0000565094,0.000572801,0.001448787,0.0007144315,0.0006666342],"domain_scores_gemma":[0.9968775,0.00055107515,0.00036574758,0.0016498866,0.00032158263,0.00023421228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001375936,0.00050954777,0.00061882765,0.00049644837,0.0003983585,0.0007081883,0.002933555,0.0005215633,0.00005110064],"category_scores_gemma":[0.00048079868,0.00042915778,0.00009735891,0.00048026984,0.0014519637,0.00072106253,0.0013899021,0.0012433955,0.00011691337],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012828693,0.0000484861,0.000034885834,0.000025104613,0.000011430107,0.0000770937,0.00039479625,0.00016874514,0.0017866052,0.084453896,0.000024707644,0.9129614],"study_design_scores_gemma":[0.0010683367,0.00088600925,0.000960967,0.00062744285,0.000041207408,0.0011245243,3.076669e-7,0.67059296,0.017147342,0.2726406,0.032470908,0.0024393925],"about_ca_topic_score_codex":0.00001937675,"about_ca_topic_score_gemma":0.00003405791,"teacher_disagreement_score":0.91052204,"about_ca_system_score_codex":0.00016718554,"about_ca_system_score_gemma":0.00043549004,"threshold_uncertainty_score":0.999816},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014344894,0.000050895138,0.98988867,0.00077643816,0.001925093,0.00027424778,0.000005052299,0.00025031655,0.0066858176],"genre_scores_gemma":[0.053623643,0.0000061152728,0.94386286,0.0018550833,0.00029500693,0.0000051737793,0.000002308737,0.000020524873,0.00032929718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678427,0.000022059026,0.00046173608,0.0015116379,0.0007599127,0.0004603804],"domain_scores_gemma":[0.9972428,0.00045461807,0.00027750895,0.0014899902,0.00036082967,0.00017422983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007093454,0.00039411784,0.00034713428,0.00050787686,0.00031670256,0.00063697854,0.0020149369,0.00036578084,0.00014500463],"category_scores_gemma":[0.00026660613,0.00037492454,0.000096812975,0.0005361648,0.000657662,0.0007040088,0.00089110225,0.0010605954,0.00006339092],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013745988,0.000012275548,0.0005653384,0.000016766146,0.000003470393,0.00001862544,0.0004623326,0.004156575,0.0014480401,0.0030947854,0.0000137190755,0.9902067],"study_design_scores_gemma":[0.0002946483,0.0000915799,0.0040937164,0.00030376296,0.0000072440375,0.00011148375,1.0855583e-7,0.8139471,0.007219539,0.17082283,0.0021486927,0.0009593053],"about_ca_topic_score_codex":0.000019125966,"about_ca_topic_score_gemma":0.000048341113,"teacher_disagreement_score":0.9892474,"about_ca_system_score_codex":0.00015758429,"about_ca_system_score_gemma":0.0005986243,"threshold_uncertainty_score":0.99987024},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010552296,0.00034881226,0.98572,0.0011141453,0.0009690809,0.00035510538,0.000015832064,0.00006318149,0.010358649],"genre_scores_gemma":[0.34247762,0.000035373774,0.65320325,0.0038547695,0.00018122146,0.0000069868324,0.0000024957328,0.00003115198,0.00020714894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970467,0.00011354281,0.00048839016,0.0009608815,0.0009338445,0.0004566234],"domain_scores_gemma":[0.9938893,0.004275396,0.00034455876,0.0009581988,0.00043054638,0.00010205172],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012774327,0.00042964495,0.00053346634,0.0007226516,0.00039461307,0.00028122085,0.002123086,0.00015805551,0.00002827111],"category_scores_gemma":[0.0010710097,0.00031554655,0.00008582859,0.0015008688,0.0035904055,0.00025860663,0.0010571774,0.00079928193,0.000006887629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006393453,0.000035364574,0.00006309505,0.000039589362,0.00001718115,0.000015371023,0.00072351616,0.0020615943,0.00004679606,0.8485178,0.000039838542,0.1484335],"study_design_scores_gemma":[0.00014586076,0.00033380432,0.00033727434,0.0002640167,0.000005364334,0.0000435306,7.592301e-7,0.123893976,0.00068141083,0.8738162,0.00012850254,0.0003493165],"about_ca_topic_score_codex":0.000057443303,"about_ca_topic_score_gemma":0.000032779844,"teacher_disagreement_score":0.3414224,"about_ca_system_score_codex":0.00009024714,"about_ca_system_score_gemma":0.00026880362,"threshold_uncertainty_score":0.99992967},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037785987,0.00063041266,0.99508727,0.0006688693,0.0024236378,0.0005916253,0.00001925354,0.00042948537,0.00011166175],"genre_scores_gemma":[0.047969814,0.000048297283,0.94981855,0.0007640291,0.0007616514,0.000024557172,0.000015458718,0.000058587077,0.0005390765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963318,0.00001567072,0.00059530797,0.0015058683,0.00066024956,0.0008911058],"domain_scores_gemma":[0.9976441,0.00073294993,0.00024944686,0.0009525227,0.00022311448,0.00019786855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005661349,0.0006014027,0.00061229424,0.0005916353,0.00023980837,0.0004621412,0.0026156974,0.00033542715,0.000011947832],"category_scores_gemma":[0.00006267632,0.0005917411,0.00022186952,0.0004896249,0.00020299532,0.00040062526,0.00044749802,0.0007566628,0.000019209525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.270063e-7,0.000017360082,3.3854934e-7,0.000010590284,0.0000093960725,0.000020026624,0.00008725381,0.2807938,0.000005976319,0.003147217,0.000008109071,0.7158991],"study_design_scores_gemma":[0.0004364035,0.00013324326,0.000007504065,0.0003046279,0.000012875774,0.000060970244,6.707642e-8,0.99357975,0.000011525796,0.0025136704,0.002305234,0.0006341555],"about_ca_topic_score_codex":0.0000020508073,"about_ca_topic_score_gemma":0.000018254996,"teacher_disagreement_score":0.715265,"about_ca_system_score_codex":0.0003050937,"about_ca_system_score_gemma":0.00023314678,"threshold_uncertainty_score":0.9996534},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000086439846,0.0007304583,0.9894286,0.00085331255,0.0024623026,0.00027875454,0.000013367125,0.00023745112,0.0059093405],"genre_scores_gemma":[0.046950586,0.000050265975,0.94700223,0.0026510363,0.0020092272,0.000009659136,0.000025645644,0.000056157925,0.001245212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948928,0.000037905746,0.0006260604,0.0020348253,0.0015365073,0.0008718975],"domain_scores_gemma":[0.99697983,0.00055275805,0.00031185834,0.0016256821,0.00022890189,0.0003009474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076422596,0.00065384427,0.0005852708,0.00079595,0.00047855437,0.00067459507,0.0039870376,0.00030296063,0.000102646096],"category_scores_gemma":[0.000061014918,0.00056705443,0.0001751643,0.00054345326,0.0005840834,0.0012613082,0.0034090797,0.0010174274,0.00018034336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005142413,0.000042812026,0.000025837906,0.000018715464,0.000009063797,0.00014800223,0.00024871618,0.0637484,0.00037633136,0.016096473,0.00029583508,0.91898465],"study_design_scores_gemma":[0.00046391756,0.00012113888,0.00006833301,0.0005820341,0.000007802832,0.00019890662,6.553585e-8,0.9037113,0.0015615099,0.08112878,0.011181149,0.00097501575],"about_ca_topic_score_codex":0.000037825008,"about_ca_topic_score_gemma":0.000078019315,"teacher_disagreement_score":0.91800964,"about_ca_system_score_codex":0.0003676482,"about_ca_system_score_gemma":0.0007544028,"threshold_uncertainty_score":0.9996781},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024926512,0.00005638225,0.97303134,0.0001269732,0.00051715336,0.00060613867,0.0000057316943,0.00015180028,0.0005779876],"genre_scores_gemma":[0.8856582,0.000004902445,0.114121094,0.00006004306,0.00010672687,0.0000028516156,0.0000011982114,0.000025269565,0.000019718947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680996,0.00010495563,0.00063373434,0.00097212364,0.0010671549,0.00041205762],"domain_scores_gemma":[0.9962155,0.00059215457,0.00063634646,0.0022708403,0.00018270807,0.0001024241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009448778,0.00044412693,0.00054343254,0.000476524,0.00018343642,0.00014999573,0.0039604236,0.00021243704,0.0000073113783],"category_scores_gemma":[0.00015785152,0.00026739473,0.00020214703,0.00066791044,0.00034019706,0.00042408778,0.0009961583,0.0006780769,0.0000016022143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028200388,0.0009001578,0.0047613964,0.000054522407,0.00006125832,0.000049044236,0.0027375997,0.57292455,0.00039656757,0.00040333846,0.00011246851,0.4175709],"study_design_scores_gemma":[0.0007365563,0.008649961,0.040617436,0.0015261542,0.000053897635,0.00007130188,0.0000013381019,0.91211927,0.0027868405,0.03211273,0.00012119465,0.001203329],"about_ca_topic_score_codex":0.000570784,"about_ca_topic_score_gemma":0.000054151842,"teacher_disagreement_score":0.86073166,"about_ca_system_score_codex":0.00033576842,"about_ca_system_score_gemma":0.00037542635,"threshold_uncertainty_score":0.9999778},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003303189,0.0002756844,0.9867071,0.00035425386,0.00058874337,0.00024135088,0.0000011292846,0.0002582402,0.011243173],"genre_scores_gemma":[0.7411157,0.00018781773,0.2560344,0.00066702085,0.00037177507,0.000020109952,0.000020083404,0.000055737008,0.0015273639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965343,0.00009618239,0.0005216365,0.0015800094,0.0006808391,0.0005870717],"domain_scores_gemma":[0.99838096,0.00025193655,0.00030275545,0.00078324426,0.00015735086,0.00012376766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001188033,0.00043441547,0.0004177812,0.0011222943,0.0002424303,0.00036962135,0.0023903616,0.00033471858,0.000038686685],"category_scores_gemma":[0.00019599784,0.0004303424,0.00007425261,0.0010677265,0.00026917201,0.0008826692,0.00068490766,0.0017338546,0.00008822178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008702386,0.00003298296,0.0029775451,0.00003701338,0.0000043294167,0.00002878723,0.0013946146,0.032838494,0.00034153534,0.028488588,0.000009350184,0.93383807],"study_design_scores_gemma":[0.0003295971,0.00017610147,0.004667238,0.00040667146,0.0000038736457,0.000046982936,2.5834066e-7,0.93656915,0.00039914,0.050758492,0.005940908,0.00070160977],"about_ca_topic_score_codex":0.00012375675,"about_ca_topic_score_gemma":0.00035755668,"teacher_disagreement_score":0.93313646,"about_ca_system_score_codex":0.00035613845,"about_ca_system_score_gemma":0.0004243737,"threshold_uncertainty_score":0.9998148},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002820572,0.00046483843,0.9949414,0.0007259948,0.0014318035,0.0007188192,0.0000033095978,0.000963503,0.00046824935],"genre_scores_gemma":[0.07535625,0.00010472186,0.92190605,0.0019393024,0.0004254601,0.000014476542,0.000005809692,0.00008518968,0.00016270825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943511,0.00012477589,0.00046980008,0.0023579726,0.0011143237,0.0015820384],"domain_scores_gemma":[0.9946056,0.0016609657,0.00028145473,0.0027677694,0.00030030604,0.0003839309],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012042858,0.0008530845,0.0008173321,0.0016240644,0.00043086743,0.0010812896,0.009328209,0.0005355397,0.000023571638],"category_scores_gemma":[0.00046100476,0.00084348454,0.00013772876,0.0019377469,0.00049340626,0.001928138,0.0026653435,0.0019113248,0.000028596165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010842261,0.000058908023,0.00023259407,0.000040139217,0.000019740766,0.00022264771,0.0007737805,0.4934019,0.00018903287,0.061494783,0.000025905088,0.4435297],"study_design_scores_gemma":[0.00033544187,0.00088327256,0.0012009518,0.0007867959,0.000020563795,0.00017851866,7.775585e-7,0.08236459,0.0023501434,0.90687364,0.0028955645,0.002109725],"about_ca_topic_score_codex":0.000026846747,"about_ca_topic_score_gemma":0.000050865703,"teacher_disagreement_score":0.8453789,"about_ca_system_score_codex":0.0008888101,"about_ca_system_score_gemma":0.0005296049,"threshold_uncertainty_score":0.99995565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084576046,0.0005624378,0.99259186,0.00011705907,0.004282,0.000790014,0.0000029325386,0.00019696524,0.00061098783],"genre_scores_gemma":[0.67289,0.00006590699,0.3179741,0.00018430932,0.0019002453,0.000080002654,0.000012160466,0.00013328504,0.0067599714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995114,0.00006659683,0.0009772311,0.0017648404,0.0010387804,0.0010385254],"domain_scores_gemma":[0.99768335,0.0006099542,0.00049574865,0.0006762032,0.00036548794,0.00016924803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022113423,0.00062679674,0.0007194148,0.0013630183,0.0003879228,0.0009825915,0.0020479597,0.00030549464,0.000006686432],"category_scores_gemma":[0.00020689292,0.0006252266,0.00018296957,0.0005516277,0.00020059597,0.0007123208,0.0008373084,0.0015786076,0.000028604249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005041034,0.000015418695,0.00014172698,0.00010434429,0.000010526266,0.00005852585,0.0017499354,0.8078993,0.00008532547,0.09169839,7.008412e-7,0.09823077],"study_design_scores_gemma":[0.00045586206,0.00040664707,0.00019410334,0.0052552195,0.000005833444,0.000096516225,0.00000396553,0.9609537,0.0013055902,0.023120267,0.007002541,0.0011997353],"about_ca_topic_score_codex":0.00019291787,"about_ca_topic_score_gemma":0.00002930593,"teacher_disagreement_score":0.67461777,"about_ca_system_score_codex":0.0016064221,"about_ca_system_score_gemma":0.0009527142,"threshold_uncertainty_score":0.9996199},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013290768,0.00013368251,0.9943546,0.0004905268,0.00048359393,0.00062090275,0.00010750407,0.00016908266,0.0023110292],"genre_scores_gemma":[0.66214126,0.00002520923,0.33618113,0.000916275,0.0004235519,0.00001485496,0.00003755196,0.000056548233,0.00020359344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619687,0.000051975712,0.0009443755,0.0012649718,0.00071708416,0.0008246998],"domain_scores_gemma":[0.9973425,0.00058529834,0.000433952,0.0012856056,0.00013848205,0.00021414923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017144503,0.0004884063,0.0006969269,0.0005181939,0.0006152641,0.00023481018,0.0014976441,0.00032070032,0.000015010801],"category_scores_gemma":[0.00041184033,0.0004965182,0.000082586645,0.0006098999,0.00031245104,0.00056569866,0.0011669034,0.0017469903,0.000018208386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001977177,0.000045522313,0.00009745816,0.00017623302,0.000010188484,0.000011734573,0.0011372973,0.42125866,0.00005116822,0.07031562,0.000021534044,0.50685483],"study_design_scores_gemma":[0.00028548334,0.00015369088,0.00007767014,0.00086243515,0.000005284524,0.00003191998,0.0000010761842,0.780783,0.0001336476,0.21241958,0.0046492354,0.0005969687],"about_ca_topic_score_codex":0.000391315,"about_ca_topic_score_gemma":0.010666028,"teacher_disagreement_score":0.6608122,"about_ca_system_score_codex":0.00085363915,"about_ca_system_score_gemma":0.00039903427,"threshold_uncertainty_score":0.99974865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04383188,0.0008471237,0.95251137,0.000121265155,0.0016022165,0.00018114998,0.000004048385,0.00010058572,0.0008003547],"genre_scores_gemma":[0.98127955,0.00004164485,0.01812108,0.00021549486,0.00021593516,3.7521943e-7,0.0000010090718,0.00003179469,0.00009310405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838334,0.000023721066,0.00030168935,0.0003539883,0.0006621912,0.0002750966],"domain_scores_gemma":[0.99913526,0.00016819243,0.00010234752,0.0004629094,0.000057361813,0.00007393477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022280573,0.00027015648,0.0003497098,0.00023992424,0.00011483671,0.000046579815,0.00059000845,0.00019538711,0.000044802],"category_scores_gemma":[0.00005829483,0.00019386636,0.00014516064,0.0004911538,0.00042728696,0.00007084296,0.00009960937,0.0007430495,0.000011944198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.902202e-7,0.000007928129,0.00004591924,0.000102014215,0.00002493255,0.0000064883784,0.00017723875,0.920686,0.0028654735,0.000013391943,0.000017564944,0.07605225],"study_design_scores_gemma":[0.00008370587,0.000016645019,0.00021148437,0.0008800252,0.000024760904,0.0000313441,7.523579e-8,0.99251574,0.0052415826,0.00068300887,0.00011121583,0.00020038312],"about_ca_topic_score_codex":0.000019810323,"about_ca_topic_score_gemma":0.000015035135,"teacher_disagreement_score":0.93744767,"about_ca_system_score_codex":0.00017850994,"about_ca_system_score_gemma":0.000114259055,"threshold_uncertainty_score":0.79056406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007012176,0.0006512289,0.99669415,0.0005698126,0.00020323359,0.00048310938,4.3750478e-7,0.00008782372,0.0012401049],"genre_scores_gemma":[0.38305312,0.00025804815,0.6154043,0.0010030109,0.000120092125,0.000014115599,0.0000018383381,0.000031469568,0.0001139758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968429,0.00017751021,0.00042128545,0.0012010117,0.0006792104,0.0006780762],"domain_scores_gemma":[0.9956154,0.0023400353,0.00018941116,0.001605898,0.00011449704,0.00013473748],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002490738,0.00038377134,0.00038318674,0.00095945783,0.000272006,0.00041683274,0.0032894826,0.00026676143,0.000006328152],"category_scores_gemma":[0.00016275364,0.0003670947,0.00004894951,0.00076367176,0.0007909252,0.0006208472,0.0016801562,0.0014328569,0.000011403341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008032763,0.000012156532,0.000019103867,0.0000039702886,0.00000185897,0.000017761582,0.0002878671,0.38353205,0.000009103909,0.14166482,0.0000024678673,0.4744408],"study_design_scores_gemma":[0.00017223583,0.000090064124,0.00007482111,0.00030399646,8.8634744e-7,0.000017740509,8.5741554e-8,0.67467445,0.000074861964,0.32427192,0.000057433397,0.00026147414],"about_ca_topic_score_codex":0.000008718467,"about_ca_topic_score_gemma":0.00005558953,"teacher_disagreement_score":0.47417933,"about_ca_system_score_codex":0.00031523756,"about_ca_system_score_gemma":0.00018218804,"threshold_uncertainty_score":0.9998781},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011405554,0.00019151403,0.99385405,0.00022367323,0.0030484973,0.00086708704,0.000003522875,0.00045661652,0.00021447756],"genre_scores_gemma":[0.13426372,0.00001762127,0.8638325,0.0010118126,0.00051415246,0.000017527991,8.283998e-7,0.000082746694,0.00025911687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941564,0.00005273284,0.0004707263,0.0021837081,0.0018169436,0.00131947],"domain_scores_gemma":[0.99450123,0.002243027,0.00011836132,0.0020332392,0.00040630053,0.0006978577],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011378049,0.0006941379,0.0006389832,0.0020641696,0.0003310311,0.0006451927,0.0050548064,0.00032515463,0.000013223933],"category_scores_gemma":[0.0013756304,0.00069591217,0.00012884529,0.0020125383,0.00024716876,0.00049680093,0.0026084548,0.0010368301,0.00020762405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013726623,0.000023264634,0.00027959238,0.000037930666,0.000012058941,0.00048415377,0.0020382688,0.7442055,0.001740422,0.00035696852,0.00028189388,0.25052628],"study_design_scores_gemma":[0.00081412523,0.0023434318,0.0037465414,0.0032582958,0.000022306875,0.0013975537,3.5855606e-7,0.90456724,0.053943276,0.0077402038,0.016483208,0.005683451],"about_ca_topic_score_codex":0.000064426284,"about_ca_topic_score_gemma":0.000021043012,"teacher_disagreement_score":0.24484281,"about_ca_system_score_codex":0.0011920474,"about_ca_system_score_gemma":0.0010858871,"threshold_uncertainty_score":0.9995492},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005655733,0.00044687034,0.99184465,0.0006617402,0.00086373586,0.00027307446,0.000016477848,0.00012857896,0.005708314],"genre_scores_gemma":[0.5623217,0.0001460599,0.43348658,0.0023429543,0.000980474,0.000023403669,0.00006382766,0.000037177164,0.00059777836],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966984,0.00003565508,0.00043450308,0.0013911139,0.0007553879,0.0006849879],"domain_scores_gemma":[0.99831486,0.00030365284,0.00020536604,0.000888675,0.00015613051,0.0001312884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044323,0.00047564734,0.0005251804,0.00060377934,0.00018355815,0.0002926764,0.0021763705,0.00027653394,0.000021195174],"category_scores_gemma":[0.00008562365,0.000433856,0.00012059774,0.00070945936,0.0005478686,0.00085071736,0.00067798264,0.0008587404,0.000033643046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063614343,0.000024911124,0.000042048574,0.000009518752,0.000004171633,0.00025697018,0.00038285693,0.014618162,0.000020643298,0.12217499,0.000027330483,0.86243206],"study_design_scores_gemma":[0.00030210995,0.00027163827,0.001715014,0.00029466566,0.0000042768324,0.000085348875,3.2089406e-7,0.07259732,0.00034535484,0.9196105,0.0040203575,0.00075308076],"about_ca_topic_score_codex":0.000010704017,"about_ca_topic_score_gemma":0.00008976911,"teacher_disagreement_score":0.86167896,"about_ca_system_score_codex":0.0004408657,"about_ca_system_score_gemma":0.0003540723,"threshold_uncertainty_score":0.99981135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001526311,0.0001078605,0.9929502,0.0008615874,0.0015842367,0.0014558884,0.000059562444,0.000053255146,0.0027747988],"genre_scores_gemma":[0.19313772,0.00002262648,0.80416703,0.0006677918,0.00050539227,0.00014872961,0.000012597707,0.00005317809,0.0012849234],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949583,0.000066671215,0.0011185564,0.0019248466,0.0013086123,0.00062304316],"domain_scores_gemma":[0.99125063,0.0061272914,0.0005176122,0.0014243036,0.00047319767,0.00020698234],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0050057527,0.00043269212,0.0006557507,0.0015667313,0.00091764366,0.0012838977,0.004596163,0.00033011602,0.00042501194],"category_scores_gemma":[0.0022953902,0.0003675378,0.00019969117,0.0017591225,0.0013348248,0.00075011107,0.0013618323,0.000679592,0.00017465312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019102206,0.00008428071,0.000024678531,0.000004070482,0.0000044143953,0.0000057174034,0.00051322056,0.056497764,0.000023459625,0.09444046,0.000028312303,0.8483545],"study_design_scores_gemma":[0.0005457661,0.00009289712,0.00006317221,0.00022579444,0.000006153627,0.00004349637,0.000004514801,0.17555085,0.00027831484,0.8179814,0.0048420494,0.000365555],"about_ca_topic_score_codex":0.000061071885,"about_ca_topic_score_gemma":0.0002478777,"teacher_disagreement_score":0.84798896,"about_ca_system_score_codex":0.0005940334,"about_ca_system_score_gemma":0.0007421809,"threshold_uncertainty_score":0.99987763},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016662157,0.00027085163,0.9912243,0.00014163784,0.002448834,0.00046126675,0.000007098017,0.00012876374,0.003651051],"genre_scores_gemma":[0.5714406,0.00004063609,0.42655268,0.0010023362,0.00064227555,0.000008269997,0.000015048707,0.00003261965,0.00026555627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557865,0.000060072583,0.00086139864,0.0014276528,0.0014488257,0.0006234054],"domain_scores_gemma":[0.99713516,0.00021632032,0.00057303376,0.00143892,0.00041284665,0.00022373376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001673002,0.00048041763,0.00068209984,0.0008025399,0.00015910063,0.0002187188,0.0028367157,0.00046751363,0.00004585188],"category_scores_gemma":[0.00009612918,0.00039441738,0.00016422695,0.0005830513,0.00045047814,0.00073488726,0.00081446185,0.0005214814,0.000028415485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018821505,0.00015903336,0.0005366928,0.00009130621,0.000022948381,0.00013107038,0.0019525246,0.0077355667,0.0008786481,0.09588862,0.000025539337,0.89255923],"study_design_scores_gemma":[0.0012128922,0.0012266386,0.010626112,0.0009838606,0.00002870574,0.00016783028,0.0000014484898,0.9095813,0.008817835,0.05688874,0.0084681325,0.0019965],"about_ca_topic_score_codex":0.0001497192,"about_ca_topic_score_gemma":0.00022789878,"teacher_disagreement_score":0.90184575,"about_ca_system_score_codex":0.0003061949,"about_ca_system_score_gemma":0.0003852657,"threshold_uncertainty_score":0.99985075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005675006,0.00020210448,0.98965484,0.001868116,0.0037473398,0.000552227,0.000019668953,0.00039077122,0.0035081955],"genre_scores_gemma":[0.26794216,0.000022485126,0.72112894,0.006975167,0.0031189288,0.00002300615,0.00006279356,0.00010420132,0.0006223003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942026,0.000092321716,0.0009200628,0.0022492576,0.0015579874,0.0009777723],"domain_scores_gemma":[0.99629927,0.0012703337,0.000503832,0.0012091784,0.00036677354,0.00035062843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008660239,0.00092069333,0.000789363,0.0015911344,0.00041562374,0.0008845611,0.0029775,0.0004441324,0.00004399336],"category_scores_gemma":[0.00016286156,0.0008763193,0.00024552536,0.0010202137,0.00063657237,0.00069134857,0.0008782159,0.001214029,0.0002698866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012458453,0.0000619506,0.0000045388174,0.000024355513,0.000007881644,0.00006310191,0.00020664741,0.22453311,0.000016077569,0.0012461679,0.00018160616,0.7736421],"study_design_scores_gemma":[0.0006760986,0.00039969734,0.000116471485,0.00045206427,0.000012340112,0.000047057296,1.0594259e-7,0.9687042,0.00036957537,0.02539713,0.0028833745,0.0009418754],"about_ca_topic_score_codex":0.000047370377,"about_ca_topic_score_gemma":0.000059839862,"teacher_disagreement_score":0.77270025,"about_ca_system_score_codex":0.00083079666,"about_ca_system_score_gemma":0.0014057462,"threshold_uncertainty_score":0.9993687},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012562862,0.00049943005,0.99700564,0.0007906776,0.0005049862,0.00041338714,0.00003572071,0.000070956776,0.00066665467],"genre_scores_gemma":[0.27988678,0.000053372787,0.7184694,0.000179878,0.0006741482,0.000022490502,0.000061468025,0.00004973485,0.00060274533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973745,0.000017531343,0.0005392706,0.0010950532,0.000629342,0.00034433333],"domain_scores_gemma":[0.9959243,0.00039221635,0.0004992355,0.0028288742,0.00029813685,0.000057225727],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0012223715,0.00029485853,0.0004513113,0.00027415564,0.00031633908,0.00035343872,0.0057311747,0.00015579083,0.0000075875296],"category_scores_gemma":[0.00008758754,0.0002059754,0.00012529844,0.0004852103,0.00055646355,0.0007352621,0.0016243521,0.00024828527,0.00001037395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013864579,0.000020675081,0.0000079645815,0.00022116669,0.000068372676,0.000008888886,0.00059538067,0.16080844,0.0012853119,0.22736037,0.000022425902,0.60958713],"study_design_scores_gemma":[0.00011338256,0.000086803644,0.000055160774,0.00032394635,0.000029196892,0.00002577866,7.0460857e-7,0.9747078,0.00047521765,0.022903873,0.0010418295,0.00023632152],"about_ca_topic_score_codex":0.000030887266,"about_ca_topic_score_gemma":0.000035974554,"teacher_disagreement_score":0.81389934,"about_ca_system_score_codex":0.00017220603,"about_ca_system_score_gemma":0.00042548135,"threshold_uncertainty_score":0.9996483},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008801766,0.002733908,0.9486685,0.008878675,0.0068421033,0.0010063929,0.00016298147,0.00025359544,0.022652084],"genre_scores_gemma":[0.9478256,0.00009784974,0.04578211,0.0008929301,0.0042749294,0.0000065584018,0.000026457305,0.000042490243,0.0010510831],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709594,0.00003628802,0.0006957135,0.00081960176,0.00097110844,0.000381328],"domain_scores_gemma":[0.9972689,0.0010169392,0.00056960236,0.00068727334,0.00037399546,0.00008329571],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006710771,0.00041225224,0.00054564286,0.00043070028,0.00025158454,0.00036465554,0.0011872834,0.000132993,0.00032547713],"category_scores_gemma":[0.00048149753,0.0003665459,0.00012131023,0.000059946007,0.0013487011,0.00021452675,0.00030954418,0.00038916664,0.000026951026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054399487,0.0001572351,0.0009409457,0.00024105074,0.00013768383,0.000073096475,0.12366499,0.0118093835,0.00022188044,0.2855746,0.000047920163,0.5770768],"study_design_scores_gemma":[0.00030981086,0.00033447443,0.0005130407,0.0032953895,0.00008503956,0.0000037178306,0.000021194672,0.0290687,0.0016388773,0.9627991,0.0012386729,0.00069203274],"about_ca_topic_score_codex":0.0021809735,"about_ca_topic_score_gemma":0.0025291697,"teacher_disagreement_score":0.93902385,"about_ca_system_score_codex":0.00015875296,"about_ca_system_score_gemma":0.0002549085,"threshold_uncertainty_score":0.99987864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070529524,0.0016497915,0.9910989,0.0018822937,0.001437409,0.0005903537,0.000011538179,0.000101134705,0.0025233289],"genre_scores_gemma":[0.20574188,0.00006893671,0.77838844,0.0135889985,0.00196185,0.000013860702,0.000005498543,0.000044276258,0.00018627968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676615,0.0000384859,0.0004453058,0.0014329334,0.00065584586,0.0006612833],"domain_scores_gemma":[0.9968743,0.0015868439,0.00028610913,0.0009591205,0.00015279213,0.00014084246],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008203425,0.0005074044,0.00046671252,0.00026917836,0.00061456434,0.0009313003,0.0026611907,0.00024745596,0.0000048092634],"category_scores_gemma":[0.000063471656,0.00034105632,0.00012064767,0.00027490483,0.00085830415,0.0003189014,0.000974493,0.0005651312,0.00001138122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007672081,0.000018230072,0.000007754183,0.000016860378,0.000011841355,0.000014534535,0.0009526977,0.018811913,0.00003075286,0.06638957,0.00019761373,0.91354054],"study_design_scores_gemma":[0.00042237865,0.00042912495,0.00016610106,0.00017368924,0.000011783656,0.000035954912,6.8300204e-7,0.93443894,0.0001579627,0.054538686,0.009018377,0.0006063164],"about_ca_topic_score_codex":0.000010517997,"about_ca_topic_score_gemma":0.000024321416,"teacher_disagreement_score":0.915627,"about_ca_system_score_codex":0.00010763677,"about_ca_system_score_gemma":0.00024252445,"threshold_uncertainty_score":0.99990416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012565868,0.001308278,0.99622244,0.000502046,0.00003801461,0.00067914266,0.000043263055,0.000058746224,0.0010223951],"genre_scores_gemma":[0.069072224,0.000035822417,0.9297343,0.0003670314,0.00015120649,0.000052222545,0.00007171404,0.000029189438,0.00048632317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983797,0.0000044003896,0.00043900014,0.0005700572,0.00033854248,0.00026826805],"domain_scores_gemma":[0.9987431,0.00023327219,0.00014751649,0.00058970606,0.00022301823,0.00006337507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026311402,0.00021251522,0.0005487892,0.0006593829,0.00009210627,0.00002276438,0.00027682263,0.00011693499,0.00003122437],"category_scores_gemma":[0.00006265481,0.00018863456,0.0001990623,0.00057777856,0.0005230491,0.000057162284,0.000099824814,0.00021788858,0.0000014700344],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050311985,0.00020508427,0.000097966105,0.00013266178,0.000015300091,0.000014337604,0.00012823773,0.018350333,0.0024855186,0.02184336,0.00011961423,0.9565573],"study_design_scores_gemma":[0.00048687006,0.00019061733,0.00015499762,0.00039154582,0.00033642587,0.000018952895,1.6016077e-7,0.90714025,0.001579896,0.08474541,0.0047391686,0.00021571736],"about_ca_topic_score_codex":0.000009171814,"about_ca_topic_score_gemma":0.000009608819,"teacher_disagreement_score":0.95634156,"about_ca_system_score_codex":0.00013338335,"about_ca_system_score_gemma":0.000112364316,"threshold_uncertainty_score":0.7692294},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005966831,0.00003309332,0.9960283,0.0017101151,0.00033357673,0.0007443681,0.000017401226,0.00015181107,0.0009216717],"genre_scores_gemma":[0.042535994,0.000039722683,0.9565268,0.00059946836,0.00009489256,0.000019635463,0.000015951216,0.000033682412,0.00013384745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558866,0.00008554126,0.000502316,0.0013417688,0.0018015745,0.0006801161],"domain_scores_gemma":[0.99745816,0.00042083376,0.00013784732,0.0011170187,0.0005302606,0.0003358994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017267527,0.0004510254,0.00042901578,0.00084241555,0.00041052364,0.0008671596,0.001636355,0.00027000677,0.000020474963],"category_scores_gemma":[0.00016111415,0.00042823155,0.000078178025,0.00060313113,0.0006223087,0.0007483672,0.00044818246,0.0011981234,0.00001437272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007502899,0.00003262043,5.296522e-7,0.00002078082,0.0000029024022,0.000012926336,0.00031003295,0.7570735,0.000022749962,0.0038447038,0.0000010701634,0.23867066],"study_design_scores_gemma":[0.00055333547,0.0001492963,0.00000460977,0.00008850603,0.0000056493436,0.000019358082,1.0591235e-7,0.982623,0.004477621,0.011636533,0.00001744179,0.00042457733],"about_ca_topic_score_codex":0.000020662199,"about_ca_topic_score_gemma":0.0000075213406,"teacher_disagreement_score":0.2382461,"about_ca_system_score_codex":0.00022783184,"about_ca_system_score_gemma":0.0008676388,"threshold_uncertainty_score":0.99981695},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018022675,0.00017606281,0.98283315,0.0008860593,0.0020590443,0.0005009765,0.0000038004048,0.00023538881,0.013125272],"genre_scores_gemma":[0.28395587,0.000054474298,0.70762426,0.004834809,0.00088845234,0.000039464772,0.000006457856,0.00013265628,0.002463524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944375,0.000043450487,0.00050302903,0.0021261533,0.0018345467,0.001055305],"domain_scores_gemma":[0.99489534,0.0012013335,0.00023329072,0.003086365,0.00026387494,0.00031979833],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013645448,0.00066274166,0.00058227824,0.001457701,0.000434276,0.0006785767,0.0068450156,0.0004932585,0.00007769833],"category_scores_gemma":[0.00024264607,0.00057369855,0.00017888461,0.00092271226,0.001596857,0.00069647917,0.0018906471,0.0028002935,0.00031196835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000133892,0.000043839522,0.00001324023,0.000027028333,0.000008633827,0.00019670893,0.00034584416,0.011188211,0.00092842494,0.69202304,0.000016595644,0.29519507],"study_design_scores_gemma":[0.00020439737,0.00028128034,0.000020499792,0.00021553854,0.000002536296,0.00005318339,4.184533e-8,0.10842776,0.004171114,0.88514185,0.00087739935,0.00060441485],"about_ca_topic_score_codex":0.000004682601,"about_ca_topic_score_gemma":0.00007059891,"teacher_disagreement_score":0.29459065,"about_ca_system_score_codex":0.00023537068,"about_ca_system_score_gemma":0.000580004,"threshold_uncertainty_score":0.99967146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013793296,0.000116030686,0.98377633,0.00018148904,0.0010403283,0.00033342093,0.0000041952358,0.00015670461,0.0005982019],"genre_scores_gemma":[0.85542,0.000010114226,0.14382078,0.00042074494,0.00014031687,0.0000037774055,0.0000023014488,0.000029172146,0.00015281473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99632496,0.000044148615,0.0006953577,0.0013545061,0.0010087348,0.00057228754],"domain_scores_gemma":[0.997511,0.00040055602,0.00040086615,0.0011227096,0.0004158152,0.00014903188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000751122,0.00053927273,0.00063009,0.00085739826,0.00018546701,0.00031296254,0.0028724754,0.00040420398,0.00006738112],"category_scores_gemma":[0.00012866592,0.00047013996,0.0001899811,0.0008301577,0.000573996,0.0009766591,0.00081021455,0.0008192768,0.00003764069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041952477,0.00032627262,0.009485754,0.0007702221,0.00013510344,0.000069982794,0.014767378,0.5322725,0.010164955,0.17468725,0.000066548186,0.2572121],"study_design_scores_gemma":[0.00085754704,0.0011955017,0.0055884467,0.002474256,0.000046228724,0.00006821845,0.0000016893465,0.21318744,0.18875794,0.5836455,0.0016079111,0.0025692866],"about_ca_topic_score_codex":0.000087947614,"about_ca_topic_score_gemma":0.00014652185,"teacher_disagreement_score":0.8416267,"about_ca_system_score_codex":0.0006217957,"about_ca_system_score_gemma":0.0008664882,"threshold_uncertainty_score":0.99977505},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0687799,0.00023636023,0.92154574,0.0028105231,0.0011045587,0.0030474789,0.000086542146,0.000040430336,0.002348467],"genre_scores_gemma":[0.9130249,0.00007745897,0.07158992,0.009379378,0.0031854224,0.000118117576,0.00036250497,0.00011326105,0.0021490632],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99764496,0.00003300272,0.0003586002,0.001089422,0.00038968818,0.00048430383],"domain_scores_gemma":[0.9984663,0.00012794981,0.00022319132,0.0009417918,0.00016059123,0.00008013857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075806316,0.00044940657,0.00036120962,0.00015619175,0.00021892019,0.00016791365,0.0009883831,0.0002792001,0.000023462511],"category_scores_gemma":[0.00005307097,0.00031518957,0.00019584983,0.000093484574,0.0002941637,0.0000112065045,0.00022209472,0.00036931725,0.00001149877],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019188756,0.00019529474,0.00029488016,0.00012853973,0.000113291775,0.000011081923,0.0007199646,0.0077855177,0.20677842,0.0013475575,0.0004101141,0.78202343],"study_design_scores_gemma":[0.0075262613,0.008041008,0.029517531,0.002447254,0.00024509843,0.000096397496,0.000001979662,0.24599263,0.3597427,0.21622434,0.121942155,0.008222638],"about_ca_topic_score_codex":0.0000047874328,"about_ca_topic_score_gemma":0.00004946745,"teacher_disagreement_score":0.8499558,"about_ca_system_score_codex":0.000075664204,"about_ca_system_score_gemma":0.0001425015,"threshold_uncertainty_score":0.99993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013578249,0.0008497741,0.9935851,0.00011724647,0.0013340765,0.0006531458,0.000038002116,0.00035202276,0.0017127695],"genre_scores_gemma":[0.8646905,0.000009578214,0.13465416,0.00022619213,0.00028292503,0.000014347525,0.0000356249,0.00004481293,0.000041851967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99305314,0.00005555041,0.001243315,0.003301761,0.0012938766,0.0010523706],"domain_scores_gemma":[0.9951978,0.00015259717,0.0005849974,0.0034951256,0.0003163316,0.00025316555],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023712455,0.0007033395,0.0008613694,0.0010768746,0.00045364854,0.0011481763,0.007356286,0.00045295953,0.000004648985],"category_scores_gemma":[0.000042993855,0.0007107263,0.000089722824,0.0014313791,0.00042007523,0.0028263994,0.0007614817,0.0010786719,0.000010230104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007870442,0.0001557907,0.0010840798,0.0018871544,0.00001578055,0.0011758857,0.0018778157,0.12181492,0.000982111,0.0107851,0.0000025532995,0.8601401],"study_design_scores_gemma":[0.0007060332,0.00006561825,0.00069742056,0.004486379,0.0000070568635,0.0001117784,0.0000031978714,0.99115217,0.0005069653,0.0011959167,0.00021869226,0.00084880047],"about_ca_topic_score_codex":0.000072554314,"about_ca_topic_score_gemma":0.0012031243,"teacher_disagreement_score":0.8693372,"about_ca_system_score_codex":0.0010191889,"about_ca_system_score_gemma":0.00081707817,"threshold_uncertainty_score":0.9998887},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02243973,0.00003634535,0.9665815,0.00025899019,0.0026512481,0.0004483369,0.000010019934,0.0001475158,0.0074262936],"genre_scores_gemma":[0.95246345,0.000028213688,0.04205052,0.004377089,0.000503955,0.000003906797,0.0000098136925,0.000052005144,0.0005110733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676174,0.00003143786,0.00044712785,0.0013145922,0.00088376633,0.0005613477],"domain_scores_gemma":[0.9988641,0.00040399452,0.0002407844,0.00031998142,0.000073896685,0.00009721397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041506568,0.00041837466,0.0003149367,0.00038047947,0.0004079225,0.00025277594,0.0007328863,0.00024971337,0.000047861355],"category_scores_gemma":[0.00016004119,0.00038484158,0.00010620899,0.00042516485,0.0006419104,0.0005112751,0.00044039308,0.00061512046,0.000043357224],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051429673,0.00003852231,0.00013733789,0.00004447759,0.00000477165,0.00017600576,0.00039054616,0.027140409,0.14590798,0.011561316,0.000021944728,0.81452525],"study_design_scores_gemma":[0.00046432856,0.00022079442,0.0009712513,0.00026889087,0.00001170025,0.0005223755,2.3530903e-7,0.73333305,0.1987375,0.061707348,0.0025630654,0.0011994706],"about_ca_topic_score_codex":0.000012619776,"about_ca_topic_score_gemma":0.00009152253,"teacher_disagreement_score":0.93002367,"about_ca_system_score_codex":0.0004190456,"about_ca_system_score_gemma":0.00014250363,"threshold_uncertainty_score":0.99986035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034087923,0.00016309894,0.9898856,0.0003424909,0.00045451307,0.00030375467,0.000024557152,0.00005206233,0.008433025],"genre_scores_gemma":[0.5971101,0.000073280535,0.39764115,0.0020225237,0.000567555,0.0000144480155,0.00006040787,0.00006448577,0.002446079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981142,0.000035677618,0.00039845917,0.00064133207,0.00034414645,0.00046614063],"domain_scores_gemma":[0.9983642,0.00083113124,0.00017684815,0.00048873585,0.00007757217,0.00006150926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005414081,0.00033569342,0.0004897952,0.0003009938,0.0001345072,0.000036006317,0.0007533966,0.00024833123,0.00009295409],"category_scores_gemma":[0.0002122414,0.00030271025,0.00006367007,0.00017728654,0.0009360096,0.00013784438,0.00030275865,0.00071236864,0.00001673929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031813343,0.00006258307,0.00013714166,0.000032696636,0.000012668845,0.00016861562,0.001371764,0.001231304,0.0000125850665,0.75517607,0.000043624594,0.24171913],"study_design_scores_gemma":[0.0002588659,0.000090008114,0.000172576,0.00018120845,0.000005857369,0.000017253202,9.1363785e-7,0.0014207193,0.0001538694,0.9960092,0.0013846481,0.00030493087],"about_ca_topic_score_codex":0.0000040990535,"about_ca_topic_score_gemma":0.00022634352,"teacher_disagreement_score":0.5967692,"about_ca_system_score_codex":0.00022789142,"about_ca_system_score_gemma":0.00013310972,"threshold_uncertainty_score":0.9999425},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071146264,0.0006147363,0.9958977,0.0009151752,0.00019943799,0.00030122208,0.00003891893,0.00003868003,0.0012826553],"genre_scores_gemma":[0.79882896,0.00023030532,0.20000218,0.0007606152,0.00007607182,0.0000057966536,0.000004686677,0.000014630766,0.00007678612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981396,0.00005215019,0.00056124415,0.00046688307,0.00051054027,0.00026956561],"domain_scores_gemma":[0.99767774,0.0009538322,0.00034273427,0.00082625315,0.00013828497,0.000061134895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011305806,0.0002557467,0.00048974366,0.00034459267,0.0001308858,0.00011298125,0.0018899103,0.00009358465,0.000010527073],"category_scores_gemma":[0.000041128045,0.00017508127,0.00010678171,0.00034584914,0.002335619,0.00040884488,0.00052358804,0.00034135964,0.0000026648154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025287662,0.000027036189,0.000016372807,0.00010378352,0.000022820306,0.0000044428966,0.009517547,0.033329424,0.0000800316,0.28208765,0.000009398281,0.6747762],"study_design_scores_gemma":[0.00040377592,0.000052576277,0.0001024394,0.00014711589,0.0000061400865,0.000016101163,4.2919916e-7,0.5956718,0.0008281733,0.40239584,0.00021373674,0.00016191715],"about_ca_topic_score_codex":0.00003612854,"about_ca_topic_score_gemma":0.000057408168,"teacher_disagreement_score":0.79811746,"about_ca_system_score_codex":0.000034561985,"about_ca_system_score_gemma":0.00017480463,"threshold_uncertainty_score":0.8605686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011452,0.0009460877,0.99656063,0.0004955564,0.0009254967,0.00041778386,0.000017820685,0.00012437705,0.0003977012],"genre_scores_gemma":[0.008927915,0.00012553204,0.98874843,0.0013927324,0.00066092535,0.000010124459,0.000014730811,0.000017272876,0.00010235966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966585,0.000020682372,0.0004622153,0.0016517995,0.0005590417,0.0006477645],"domain_scores_gemma":[0.9979464,0.0006822135,0.00025739524,0.00076063245,0.00019888725,0.00015450684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009561522,0.0004694373,0.000511181,0.00039488284,0.00042396982,0.00087978377,0.002121012,0.00033527863,0.0000055158403],"category_scores_gemma":[0.00008974319,0.00036080062,0.00009216241,0.00025494304,0.0005456748,0.00075372274,0.0012386485,0.0004905203,0.0000053489302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032793782,0.000009543554,0.000029019347,0.00001627688,0.0000039189335,0.000014782208,0.00015372623,0.001380454,0.00012299698,0.008219964,0.000006837003,0.9900392],"study_design_scores_gemma":[0.0002717412,0.0003194242,0.00021468446,0.00042154858,0.0000054096845,0.000098492346,2.7772805e-7,0.7180254,0.0003171391,0.27258736,0.0070644096,0.0006741485],"about_ca_topic_score_codex":0.000015065958,"about_ca_topic_score_gemma":0.000009542588,"teacher_disagreement_score":0.98936504,"about_ca_system_score_codex":0.00010150143,"about_ca_system_score_gemma":0.00020588632,"threshold_uncertainty_score":0.99988437},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014736804,0.00064034364,0.9941324,0.00007349066,0.0008334107,0.00025778383,0.0000032662688,0.000230433,0.0023552144],"genre_scores_gemma":[0.7325102,0.000008050834,0.2668848,0.00006427515,0.00019870698,0.0000060364982,0.0000017245684,0.00003121738,0.0002949732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955968,0.000017676071,0.0004702197,0.001440622,0.0017447949,0.00072984764],"domain_scores_gemma":[0.996851,0.0010000501,0.00020615061,0.0013566478,0.00036072248,0.00022538213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016093538,0.00037876042,0.0004741175,0.0017022522,0.00023398582,0.0004606392,0.0034141617,0.00018223163,0.0000017799088],"category_scores_gemma":[0.00032334667,0.00035740185,0.000060165607,0.0012980832,0.0018447711,0.0006373714,0.001882067,0.00065683026,0.00001493056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016527712,0.00006295773,0.0030213387,0.001374177,0.000023950926,0.00085858244,0.0014360126,0.49943483,0.0029945194,0.07706388,0.00024702432,0.41346622],"study_design_scores_gemma":[0.00030893745,0.0002188834,0.0024903205,0.0028569393,0.000006384973,0.00029826144,3.0437127e-7,0.97813123,0.0067761075,0.0076235076,0.0004896641,0.0007994503],"about_ca_topic_score_codex":0.00002322863,"about_ca_topic_score_gemma":0.0000024000124,"teacher_disagreement_score":0.73103654,"about_ca_system_score_codex":0.0003971473,"about_ca_system_score_gemma":0.00087404205,"threshold_uncertainty_score":0.9998878},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027232463,0.009003889,0.98844486,0.00059001095,0.00020563435,0.00038933783,0.000003392237,0.00012240189,0.0012132508],"genre_scores_gemma":[0.35191625,0.000066264365,0.647535,0.00038726348,0.00005544629,0.0000033112842,0.000011565052,0.0000061833903,0.000018680043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799085,0.000026217089,0.00042407765,0.0004320977,0.0009270547,0.00019970495],"domain_scores_gemma":[0.99871546,0.000108015236,0.00032704728,0.00039322636,0.00040531767,0.000050909042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011227719,0.0002352177,0.00025498596,0.00073115225,0.00008501314,0.00028618067,0.0009958701,0.00019840719,0.000004874327],"category_scores_gemma":[0.00009140315,0.00020889656,0.00004062457,0.00037524058,0.00012796109,0.002486559,0.0002025544,0.00037016708,0.0000021097621],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030064355,0.000004200221,0.0000017462967,0.00003298702,0.0000016173186,0.0000016190495,0.00034795262,0.0010940873,0.00017729435,0.0189504,0.0000011744232,0.9793839],"study_design_scores_gemma":[0.00015713493,0.00010425636,0.000024226418,0.00021724262,0.0000071888603,0.000028983248,2.78231e-8,0.8181972,0.0049656704,0.17579935,0.00028910776,0.00020960037],"about_ca_topic_score_codex":0.000014844107,"about_ca_topic_score_gemma":0.000017467175,"teacher_disagreement_score":0.9791743,"about_ca_system_score_codex":0.00011418524,"about_ca_system_score_gemma":0.00029873755,"threshold_uncertainty_score":0.85185546},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007929677,0.0015565706,0.9709538,0.018461155,0.002651424,0.0008019338,0.000011181693,0.00012941688,0.0046415376],"genre_scores_gemma":[0.9609434,0.00024367885,0.018275717,0.018146936,0.0012331075,0.00003956162,0.0000019842007,0.00006251078,0.0010530807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645555,0.00018599113,0.00045046955,0.0011430604,0.0010434457,0.0007214815],"domain_scores_gemma":[0.9916117,0.005737517,0.0002846596,0.0021418864,0.000103155624,0.00012103629],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0032465023,0.0005337107,0.00040643566,0.00024488816,0.0014763735,0.001772202,0.0063697854,0.00020578351,0.000015303569],"category_scores_gemma":[0.00026699502,0.00023444358,0.00015981158,0.0004634384,0.0039691622,0.00030239724,0.0021161092,0.0012193603,0.000033075365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042576266,0.000008525007,0.0000041213098,0.0000044309577,0.000013056123,0.00002516616,0.0012783869,0.0018535738,0.000018779709,0.5162943,0.00012531312,0.48033178],"study_design_scores_gemma":[0.00094308046,0.00019365313,0.00038025482,0.00033898262,0.000011979148,0.00015017587,0.0000017326068,0.17937706,0.0006533563,0.80918837,0.008162831,0.000598533],"about_ca_topic_score_codex":0.00006594751,"about_ca_topic_score_gemma":0.000115538445,"teacher_disagreement_score":0.9601505,"about_ca_system_score_codex":0.0001852832,"about_ca_system_score_gemma":0.0005769799,"threshold_uncertainty_score":0.9998236},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080424355,0.00015395082,0.99727446,0.0005500657,0.0004749348,0.00034737375,0.0000071648633,0.000033541834,0.00035424915],"genre_scores_gemma":[0.7452869,0.000024719873,0.25387698,0.0006689601,0.000093032344,0.0000060626558,0.0000047297417,0.0000113833285,0.000027267311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975582,0.00004285893,0.0003664794,0.0008846313,0.0007778645,0.00037001102],"domain_scores_gemma":[0.9982586,0.00046245407,0.00016768488,0.0009880053,0.00006863625,0.00005465766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009542444,0.0002958668,0.00031921882,0.0005435915,0.00011383667,0.0003675651,0.002913541,0.00010868086,0.0000036981223],"category_scores_gemma":[0.0000780126,0.00022572873,0.000054215136,0.00043872636,0.0007030446,0.00053604506,0.0013016919,0.00039692016,0.0000030143667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008574305,0.000038958296,0.0006944924,0.00017280034,0.0000075001494,0.00016821951,0.0021990084,0.0659223,0.000067452725,0.020262135,0.000006378822,0.9104522],"study_design_scores_gemma":[0.00050597073,0.00019116496,0.0029574526,0.00066379306,0.000007197134,0.000014780276,0.0000014683982,0.8959505,0.0007429755,0.09813949,0.0003073877,0.0005178074],"about_ca_topic_score_codex":0.00023193276,"about_ca_topic_score_gemma":0.0005637307,"teacher_disagreement_score":0.9099344,"about_ca_system_score_codex":0.00008219246,"about_ca_system_score_gemma":0.0002007102,"threshold_uncertainty_score":0.92049503},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000113639864,0.0007523276,0.99119383,0.0010765254,0.002707934,0.00034543633,0.0000014392883,0.00017851204,0.0036303448],"genre_scores_gemma":[0.04004419,0.00021790626,0.95746535,0.0014740642,0.00051274674,0.000007694219,0.0000012811934,0.00003342739,0.00024332605],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698883,0.000032019623,0.00037132588,0.0015690408,0.00057867524,0.00046010717],"domain_scores_gemma":[0.9981536,0.00023578058,0.0002663791,0.00084940554,0.0003423502,0.00015248728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006054802,0.00042438004,0.00041055607,0.0010775155,0.00037928324,0.00053426344,0.0010654461,0.00023835225,0.000019966512],"category_scores_gemma":[0.000104569306,0.0003841667,0.00007892561,0.00073236687,0.00088444346,0.0012686398,0.0007586576,0.0012750138,0.000020910678],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002648965,0.0000142709905,0.000032489235,0.00001384809,0.0000050608924,0.0000091960865,0.00030668447,0.00040654832,0.0004923048,0.045939032,0.0000011165426,0.9527768],"study_design_scores_gemma":[0.00042654207,0.0001930973,0.00021052669,0.00046781878,0.000008983365,0.00078445766,0.0000036292174,0.3256353,0.0020245768,0.66859895,0.00086320733,0.0007828586],"about_ca_topic_score_codex":0.00004798291,"about_ca_topic_score_gemma":0.00008142698,"teacher_disagreement_score":0.95199394,"about_ca_system_score_codex":0.0003417455,"about_ca_system_score_gemma":0.00034405498,"threshold_uncertainty_score":0.999861},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013180287,0.00006126484,0.99525535,0.0010165235,0.0005331772,0.0009945788,0.000002278807,0.00035688028,0.0004619096],"genre_scores_gemma":[0.8961018,0.000012601439,0.10275536,0.0004921725,0.00019277007,0.000033325014,0.000013350207,0.000023710723,0.00037496278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705553,0.000039921953,0.00043481844,0.0013487454,0.00074294675,0.00037806603],"domain_scores_gemma":[0.9977625,0.00023069845,0.0003989752,0.0011665126,0.00035866597,0.000082621016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048474054,0.00040249206,0.00043852234,0.0010825439,0.00024959922,0.00031511046,0.0023751108,0.0004179574,0.0000042930956],"category_scores_gemma":[0.0000724123,0.00034927597,0.00008134804,0.0008728459,0.0002250867,0.00059970695,0.00020407063,0.000542177,0.0000057830334],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023853341,0.00040784373,0.00046884405,0.000022848935,0.000009852979,0.0000031416732,0.0013826607,0.011438462,0.00043571196,0.035273124,0.00013919086,0.95039445],"study_design_scores_gemma":[0.0012596746,0.009320344,0.0055192243,0.00015352093,0.00003248804,0.00002182687,0.0000066403213,0.495672,0.011030472,0.4731877,0.0025588043,0.001237296],"about_ca_topic_score_codex":0.000013663968,"about_ca_topic_score_gemma":0.00008386292,"teacher_disagreement_score":0.9491572,"about_ca_system_score_codex":0.00025535034,"about_ca_system_score_gemma":0.000315178,"threshold_uncertainty_score":0.99989593},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04375069,0.000047752386,0.95511794,0.0003523956,0.0003104079,0.00030157814,0.0000011820309,0.00010717413,0.000010888774],"genre_scores_gemma":[0.7514928,0.0000035924393,0.24809057,0.00016363847,0.00021472156,0.000024117655,0.0000023754344,0.0000075383336,6.6133305e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994435,0.000003344837,0.0001242891,0.00017213245,0.000087535635,0.00016920103],"domain_scores_gemma":[0.9995819,0.00017895573,0.000019607138,0.00014605107,0.000044018187,0.000029518309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010691743,0.00007664749,0.000064628206,0.000101367455,0.000075590964,0.00008639169,0.00013960018,0.000029883195,0.0000045096162],"category_scores_gemma":[0.000019970199,0.00007390715,0.00001451081,0.00039527068,0.000035289642,0.00022433055,0.000015949212,0.00007867812,0.0000074915133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014409475,0.0000055477863,0.000045648823,0.0000032031312,6.2236256e-7,4.7731987e-8,0.00026311315,0.58621895,0.00226403,0.000014379849,0.0000025790498,0.41118044],"study_design_scores_gemma":[0.00019273304,0.000024503695,0.00045520716,0.000010549622,0.0000010468877,0.0000016091276,2.8880362e-7,0.98149204,0.0148870805,0.0010117167,0.0018354784,0.00008771755],"about_ca_topic_score_codex":0.0000037168627,"about_ca_topic_score_gemma":0.00002083469,"teacher_disagreement_score":0.7077421,"about_ca_system_score_codex":0.000075438205,"about_ca_system_score_gemma":0.000012931974,"threshold_uncertainty_score":0.3013846},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007495594,0.00023359999,0.9789017,0.00020024547,0.00058909965,0.00020280169,0.000005189614,0.00004826584,0.01906955],"genre_scores_gemma":[0.11297894,0.0000928985,0.8842746,0.00040649745,0.0003603707,0.0000042054803,0.000010118332,0.00005632784,0.0018160134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987077,0.00002263496,0.00029529532,0.00041411858,0.0003239305,0.00023630561],"domain_scores_gemma":[0.9981275,0.0006921229,0.00025927668,0.00074224686,0.00013784635,0.000041009218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047593025,0.00022563188,0.0003682382,0.0002861122,0.000076871926,0.000019851572,0.0007848949,0.0002739765,0.00008951052],"category_scores_gemma":[0.00043394126,0.00019424275,0.00005525536,0.00018628247,0.0008193455,0.0001211328,0.0002994303,0.00037796397,0.00001179621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041067015,0.000052093088,0.000048033562,0.00020214354,0.000022838592,0.000041440933,0.0013653147,0.0048942035,0.0001225077,0.76221275,0.00010492948,0.23089267],"study_design_scores_gemma":[0.00014222479,0.000076231154,0.0000065000136,0.00018152347,0.000010806904,0.00003159204,4.2307022e-7,0.009498067,0.0007569974,0.9886555,0.00045142748,0.0001887055],"about_ca_topic_score_codex":0.0000023512978,"about_ca_topic_score_gemma":0.000028226275,"teacher_disagreement_score":0.23070396,"about_ca_system_score_codex":0.00006448566,"about_ca_system_score_gemma":0.00011012631,"threshold_uncertainty_score":0.79209894},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007894642,0.00008784243,0.9917358,0.0009460603,0.00033245923,0.0003787056,0.0000024064773,0.00038693976,0.0061218645],"genre_scores_gemma":[0.008486177,0.000022501952,0.9867368,0.0043070214,0.0002166339,0.0000063635866,0.0000044584554,0.00002098865,0.00019910572],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610394,0.0000343231,0.000474022,0.001406096,0.0013628047,0.00061882474],"domain_scores_gemma":[0.99771297,0.00045437049,0.00022447744,0.0011101994,0.00020348681,0.00029450408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000763967,0.00045446958,0.00046408898,0.0007009412,0.00018363456,0.00053115183,0.0028942872,0.00025790994,0.00006738331],"category_scores_gemma":[0.00010547157,0.00036688722,0.00007640833,0.0005027635,0.0020120116,0.0005391704,0.00061391946,0.0010981862,0.000029994302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003090079,0.000016994387,0.000007693727,0.000011580919,0.0000046418736,0.00012551577,0.00020006327,0.00055537024,0.00015974026,0.009923233,0.000013593602,0.9889785],"study_design_scores_gemma":[0.0012830783,0.001645874,0.00039044456,0.0026716965,0.000025841146,0.0010454775,3.8015398e-7,0.18312152,0.0239919,0.7810162,0.002007242,0.0028003913],"about_ca_topic_score_codex":0.0000045236816,"about_ca_topic_score_gemma":0.000010332429,"teacher_disagreement_score":0.9861781,"about_ca_system_score_codex":0.00022355875,"about_ca_system_score_gemma":0.0007058642,"threshold_uncertainty_score":0.9998783},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057874695,0.001556163,0.9949114,0.0002982204,0.0013817615,0.0005493079,0.0000040600426,0.0010806356,0.00016059304],"genre_scores_gemma":[0.13472983,0.00033523218,0.8637995,0.00015853252,0.0005488576,0.00022131047,0.0000072935936,0.000111460795,0.000087991844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982294,0.0000043759883,0.00031125726,0.0006656626,0.00022815604,0.0005611744],"domain_scores_gemma":[0.9989565,0.00025870613,0.00006189209,0.00060105784,0.000057085657,0.00006477597],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034289676,0.00042865006,0.00040014987,0.0013398248,0.000094609975,0.000093649505,0.0010360534,0.0004688385,0.000020256904],"category_scores_gemma":[0.00006074707,0.00044230837,0.0000671188,0.00026775815,0.00020436088,0.00020169583,0.00022080024,0.00049441156,0.000009579487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013476147,0.0000092562605,0.0000011551325,0.000039953182,0.000020428832,0.0000063664625,0.0000679978,0.34651917,0.0009846954,0.0057074507,0.000037695307,0.6466045],"study_design_scores_gemma":[0.00021767883,0.00010549156,0.0000024096475,0.00039982662,0.000026080066,0.000019329947,5.7784104e-7,0.90635794,0.017460946,0.011360759,0.06319078,0.000858173],"about_ca_topic_score_codex":9.815604e-7,"about_ca_topic_score_gemma":0.000013527677,"teacher_disagreement_score":0.6457463,"about_ca_system_score_codex":0.00031943395,"about_ca_system_score_gemma":0.000052095475,"threshold_uncertainty_score":0.9998029},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028354374,0.0004873092,0.98332965,0.0001378901,0.00033821617,0.0005507049,0.000016529524,0.00007394272,0.012230316],"genre_scores_gemma":[0.06647974,0.00007838587,0.928364,0.0006743356,0.00039423586,0.000022444114,0.0000074821546,0.00010646678,0.0038729254],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976092,0.0000489735,0.0003624387,0.00086964155,0.00056498573,0.0005447657],"domain_scores_gemma":[0.99781513,0.0010450553,0.00024926753,0.0006008718,0.00016499416,0.0001246864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012392693,0.0004750876,0.00068348943,0.0004379114,0.00022179938,0.00016920513,0.00052891363,0.00026716088,0.0000090115345],"category_scores_gemma":[0.0001287036,0.00035441146,0.00009893419,0.00021676521,0.00054005545,0.00011570435,0.00038719227,0.0006069283,1.2772688e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052571105,0.00021902405,0.0014798576,0.0012712872,0.00018087478,0.0012367768,0.004276379,0.0024365638,0.00016911185,0.14856535,0.0011497914,0.8384893],"study_design_scores_gemma":[0.005665973,0.00067252415,0.0002033541,0.0019552144,0.00014197487,0.0003571421,0.0000027730287,0.03897524,0.0007802734,0.94115776,0.0081865,0.0019012875],"about_ca_topic_score_codex":0.000030063851,"about_ca_topic_score_gemma":0.0008808434,"teacher_disagreement_score":0.83658797,"about_ca_system_score_codex":0.00008883317,"about_ca_system_score_gemma":0.00014574855,"threshold_uncertainty_score":0.9998908},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004469048,0.00026248832,0.98927903,0.001623273,0.0018422266,0.00046016555,0.0000053067506,0.00015256478,0.0019058819],"genre_scores_gemma":[0.75260067,0.000025121848,0.23975876,0.0066658156,0.00044073662,0.000005779051,0.0000023771834,0.00003843253,0.00046230794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995931,0.0000821216,0.0006072701,0.0015592552,0.0012132725,0.0006070514],"domain_scores_gemma":[0.99562246,0.00022328932,0.00031806648,0.0033615641,0.00026236862,0.00021225066],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013287996,0.00048670243,0.00054102205,0.0006121702,0.00030462528,0.00042027442,0.0062025595,0.00027616473,0.000020388175],"category_scores_gemma":[0.00012654955,0.00033295003,0.00017441812,0.0010951733,0.0005826521,0.0005835766,0.001442717,0.0006430899,0.000029850611],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013443351,0.000051060466,0.000024836283,0.000015181702,0.000005005273,0.00003210309,0.001366634,0.015161158,0.0055332445,0.0181754,0.00008360403,0.95953834],"study_design_scores_gemma":[0.00064743817,0.0010559519,0.004732996,0.0023790395,0.000023715997,0.00021788648,0.0000014358557,0.6554525,0.028263988,0.30042434,0.0049499795,0.0018507178],"about_ca_topic_score_codex":0.000024716754,"about_ca_topic_score_gemma":0.00003554704,"teacher_disagreement_score":0.9576876,"about_ca_system_score_codex":0.0001558472,"about_ca_system_score_gemma":0.00041806462,"threshold_uncertainty_score":0.99991226},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010433369,0.00029641605,0.9354141,0.0015880662,0.0016209617,0.00031181038,0.000014355764,0.00021372028,0.06043625],"genre_scores_gemma":[0.58236825,0.00013689566,0.3996834,0.015333614,0.0013739277,0.000025367268,0.00003970099,0.000064961154,0.0009739287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651873,0.000052344727,0.0004648333,0.00150386,0.00085911236,0.00060110586],"domain_scores_gemma":[0.99769235,0.00053237524,0.00015585758,0.0011555675,0.00023529356,0.00022857737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004466047,0.00054055394,0.00047675046,0.0006793962,0.00061636826,0.00092834287,0.0019416249,0.00029429496,0.0003416882],"category_scores_gemma":[0.00005327529,0.00047328603,0.00014876576,0.0003873464,0.00071425777,0.0005235366,0.0005781886,0.0008124019,0.00062565383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061512133,0.000074469615,0.000019738038,0.000009466146,0.000016300693,0.00019951358,0.00050122186,0.026793713,0.000056325658,0.8458655,0.00037238724,0.12608522],"study_design_scores_gemma":[0.00047927533,0.000323598,0.00015346157,0.00033499114,0.000010813188,0.00028452394,7.669004e-8,0.18741085,0.0016970373,0.7978724,0.0103190215,0.0011139512],"about_ca_topic_score_codex":0.000008532907,"about_ca_topic_score_gemma":0.00004732885,"teacher_disagreement_score":0.5822639,"about_ca_system_score_codex":0.0002617252,"about_ca_system_score_gemma":0.0008005994,"threshold_uncertainty_score":0.9997719},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001183991,0.00027284477,0.9737394,0.001008953,0.0013627487,0.00039926352,0.000010408651,0.00034016214,0.022854393],"genre_scores_gemma":[0.042613838,0.0004450032,0.9471424,0.005124959,0.0016915746,0.00003840201,0.000071086135,0.00010113009,0.0027716127],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580586,0.000036957095,0.00057968433,0.001719601,0.0010407222,0.0008171492],"domain_scores_gemma":[0.9974844,0.00017609553,0.00023976274,0.0018065696,0.00009397894,0.00019923081],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009224649,0.00056562125,0.000520748,0.0007988951,0.0003345073,0.0011723542,0.004567389,0.00020772377,0.00015105198],"category_scores_gemma":[0.000030132629,0.0005276969,0.00015164577,0.0006003911,0.00044698513,0.0014847256,0.0016947765,0.00066817104,0.0003684477],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039541214,0.000025484891,0.000008231385,0.000013396644,0.000011666755,0.00022166075,0.00025657326,0.009062783,0.000013449951,0.049026966,0.00014883144,0.941207],"study_design_scores_gemma":[0.00063377596,0.00045890833,0.00010531527,0.0006435752,0.000022502956,0.0000872137,3.2026864e-7,0.4232968,0.00041406622,0.4863457,0.08623087,0.0017609338],"about_ca_topic_score_codex":0.00001918974,"about_ca_topic_score_gemma":0.00008530233,"teacher_disagreement_score":0.9394461,"about_ca_system_score_codex":0.00022681431,"about_ca_system_score_gemma":0.00026589874,"threshold_uncertainty_score":0.9998645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000033486806,0.00007105659,0.9932247,0.0020111157,0.0030703524,0.00063911226,0.0000060971815,0.00023536806,0.0007388501],"genre_scores_gemma":[0.0041289167,0.000007394815,0.98681957,0.008326472,0.0004955875,0.000019545389,0.000006766771,0.00005010425,0.00014565804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954057,0.00007041423,0.0005405123,0.002163905,0.0010082105,0.00081129785],"domain_scores_gemma":[0.9920197,0.0049846093,0.00029051045,0.002043368,0.0003943116,0.00026750469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021980102,0.0006400349,0.00064831635,0.0008396476,0.00046313714,0.0005493486,0.0031303633,0.0003918963,0.000033895773],"category_scores_gemma":[0.0013038837,0.00052184955,0.00022508962,0.0004347315,0.000536633,0.0006535711,0.0009794406,0.0014180042,0.000033772154],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002995092,0.000032148477,3.719686e-7,0.000019563831,0.0000030002839,0.000029711178,0.00009717327,0.06927017,0.0010040356,0.042062085,0.000009631347,0.8874422],"study_design_scores_gemma":[0.0004033066,0.00020624108,0.000008670969,0.00031841968,0.0000064837823,0.000025992143,5.747945e-8,0.7316012,0.0075087976,0.25661758,0.0028236054,0.00047963497],"about_ca_topic_score_codex":0.0000022521856,"about_ca_topic_score_gemma":0.0000035946746,"teacher_disagreement_score":0.88696253,"about_ca_system_score_codex":0.00017036688,"about_ca_system_score_gemma":0.0005033463,"threshold_uncertainty_score":0.9997233},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02211358,0.00070765347,0.9752646,0.00027537887,0.00073971704,0.000390345,0.0000025724005,0.00012958993,0.00037653375],"genre_scores_gemma":[0.7061418,0.000054931108,0.29251367,0.0006214331,0.000597759,0.0000035106768,0.0000024123374,0.000024142375,0.00004030611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970201,0.00003839819,0.00047588657,0.0013393593,0.0005945282,0.0005317227],"domain_scores_gemma":[0.9980986,0.00040478967,0.00025935975,0.00096564216,0.000092477574,0.00017913105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051546894,0.0004988131,0.00048665007,0.0009948425,0.0003846088,0.0006113213,0.0013697121,0.0002818411,0.000006311392],"category_scores_gemma":[0.000070358175,0.00043162293,0.00013818564,0.0006702046,0.0005407545,0.0006615753,0.00067793037,0.00056097895,0.0000031309348],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020207604,0.000050865303,0.0010340831,0.00005466508,0.000015643165,0.00009288901,0.00079743733,0.018654432,0.0023507462,0.0028489486,0.0000053248373,0.9740748],"study_design_scores_gemma":[0.000752723,0.0001578096,0.012040903,0.00035996776,0.000018305462,0.00023051586,1.7799861e-7,0.9462305,0.0007687565,0.0383001,0.00023922054,0.00090105704],"about_ca_topic_score_codex":0.000061839775,"about_ca_topic_score_gemma":0.0000839549,"teacher_disagreement_score":0.9731737,"about_ca_system_score_codex":0.00016367274,"about_ca_system_score_gemma":0.00028705708,"threshold_uncertainty_score":0.99981356},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026920885,0.00018348535,0.9695954,0.000054270116,0.0024928572,0.0003886474,0.00003688409,0.00022191017,0.00010567427],"genre_scores_gemma":[0.8688059,0.0000046594005,0.13026945,0.000064216234,0.00075749756,0.00001252781,0.00004262953,0.000025368725,0.00001777906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642485,0.00011246298,0.0008227656,0.0013863968,0.0007959183,0.00045761658],"domain_scores_gemma":[0.9963199,0.00042500396,0.00063630275,0.002051333,0.00040702868,0.0001604165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015246866,0.00044899728,0.00084335863,0.0017111234,0.00043077627,0.00054325245,0.0027176077,0.00044587828,0.000009840092],"category_scores_gemma":[0.00006825923,0.00044531072,0.00033264805,0.0014330081,0.00031326592,0.0011799628,0.0003859607,0.00055693876,0.0000057082066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052700496,0.00007498456,0.000023154513,0.000034558343,0.00012683573,0.0000066951457,0.001445856,0.1162919,0.010545288,0.0032474177,2.3281942e-7,0.86815035],"study_design_scores_gemma":[0.00016639361,0.00041616225,0.0008246635,0.00011345652,0.00018070081,0.000009321216,0.000001941524,0.92268515,0.06297622,0.012101435,0.00006853105,0.00045601366],"about_ca_topic_score_codex":0.0014251494,"about_ca_topic_score_gemma":0.004519023,"teacher_disagreement_score":0.8676944,"about_ca_system_score_codex":0.00044607502,"about_ca_system_score_gemma":0.00022066609,"threshold_uncertainty_score":0.99979985},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022342392,0.00033899196,0.9980139,0.000011058775,0.00059628725,0.00034008478,0.00001756772,0.00015436922,0.0005053742],"genre_scores_gemma":[0.46254098,0.000010237775,0.53713536,0.000014921462,0.0002307462,0.000005666184,0.0000086589025,0.000035187808,0.000018206907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877447,0.000004158978,0.00032665767,0.00036292063,0.00027134054,0.00026044986],"domain_scores_gemma":[0.9992228,0.0003166911,0.00011753098,0.0002342818,0.000060907027,0.00004778339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021581436,0.00026219635,0.00030672204,0.00029986506,0.00010358472,0.00016099488,0.0003013013,0.00020016418,0.0000055232554],"category_scores_gemma":[0.000049632603,0.00024319245,0.000060156264,0.00015072625,0.00009062747,0.00017376812,0.00006651444,0.00025885933,8.173987e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005178088,0.000002448451,0.0000045009565,0.0002864269,0.000009956553,0.0000017205241,0.00022027288,0.963633,0.000013159271,0.006689155,0.0000011707792,0.029133026],"study_design_scores_gemma":[0.000112370595,0.000049023583,7.351941e-7,0.0007633328,0.000009525999,0.000007110397,6.732901e-7,0.98428655,0.0020731725,0.012420405,0.000034904315,0.00024221024],"about_ca_topic_score_codex":0.000001248441,"about_ca_topic_score_gemma":0.0000039006027,"teacher_disagreement_score":0.46251866,"about_ca_system_score_codex":0.0003894566,"about_ca_system_score_gemma":0.000067138346,"threshold_uncertainty_score":0.99171007},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020632427,0.0037060706,0.9690355,0.00016018844,0.0011447121,0.0002448451,0.000027420967,0.000029831599,0.02358818],"genre_scores_gemma":[0.9292107,0.0006407995,0.06584636,0.0010276433,0.00055730465,0.0000058256996,0.0000054713655,0.00005875352,0.002647145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972292,0.000006533688,0.0009664852,0.0010598022,0.00013614692,0.0006017913],"domain_scores_gemma":[0.99851394,0.00017183031,0.00044775172,0.0006889735,0.000059067705,0.00011844456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020425403,0.00039241553,0.0007735269,0.0014927668,0.00007061747,0.00022124521,0.00090907066,0.00036131017,0.0003439907],"category_scores_gemma":[0.000052011295,0.0004092386,0.00015032968,0.00051590125,0.0003520494,0.0002603007,0.00021273308,0.0007563886,0.0000767111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000130323615,0.000044387933,0.0071456935,0.000037571688,0.000020121437,0.000093992785,0.0005564322,0.47466502,0.000004806602,0.047683675,0.00002109179,0.46971416],"study_design_scores_gemma":[0.00030065345,0.0001232233,0.0108052045,0.00015169372,0.000004295579,0.000014679026,5.1558504e-7,0.856716,0.00005929264,0.11517178,0.015920293,0.0007323924],"about_ca_topic_score_codex":0.00041945704,"about_ca_topic_score_gemma":0.0012229868,"teacher_disagreement_score":0.92714745,"about_ca_system_score_codex":0.00029309327,"about_ca_system_score_gemma":0.000118234384,"threshold_uncertainty_score":0.99983597},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017302968,0.0054216892,0.981953,0.0009036566,0.0009850413,0.0002500412,0.000002026295,0.0003624047,0.009949067],"genre_scores_gemma":[0.8682282,0.001779773,0.12867042,0.0007554795,0.00032077183,0.00002450488,0.000008445093,0.00003474269,0.00017766394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966281,0.00003471852,0.0005556187,0.001267709,0.0007575708,0.0007562521],"domain_scores_gemma":[0.9974845,0.0004757649,0.0003202262,0.0015065315,0.00013000536,0.000082943225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005997435,0.0004921469,0.0005436912,0.001073739,0.00023789937,0.00042838132,0.0053622765,0.00041046538,0.0000056329127],"category_scores_gemma":[0.000030239755,0.00046662395,0.000108481676,0.001040783,0.00091576384,0.00096334674,0.0018906432,0.0012140227,0.000013208392],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024186947,0.000021360882,0.00043272134,0.000019371473,0.0000016771088,0.000040682567,0.00018194116,0.015232643,0.000013876155,0.016772348,0.000025250169,0.9672557],"study_design_scores_gemma":[0.00026504192,0.00007546808,0.0002383549,0.00074858405,0.0000024057042,0.000035865265,4.4956505e-7,0.83627874,0.0003967071,0.15342876,0.0077577387,0.00077186397],"about_ca_topic_score_codex":0.000035749563,"about_ca_topic_score_gemma":0.00044945205,"teacher_disagreement_score":0.96648383,"about_ca_system_score_codex":0.00030882985,"about_ca_system_score_gemma":0.00034173185,"threshold_uncertainty_score":0.99977857},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050673814,0.00050328823,0.9827522,0.00026894463,0.0027998395,0.0011450051,0.000028127051,0.0003287108,0.011667158],"genre_scores_gemma":[0.7934844,0.0000057436164,0.2023658,0.001989027,0.0016079755,0.000031628817,0.000061999504,0.00008925828,0.0003641921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924368,0.00021459318,0.0013119075,0.0029748532,0.0016039376,0.0014578754],"domain_scores_gemma":[0.99548566,0.0011768347,0.00045358003,0.0023732504,0.00014076383,0.00036987965],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020670197,0.0009765633,0.0012696981,0.0018070278,0.00030227055,0.0024394807,0.0059689847,0.0004947168,0.000002307597],"category_scores_gemma":[0.00011071681,0.00092625694,0.00024180276,0.0019554906,0.0003850115,0.00058247236,0.0012950555,0.0013069231,0.000063769985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014852491,0.00008997482,0.00009182639,0.000110216955,0.000009530087,0.00010425742,0.0006962011,0.93460166,0.000007093188,0.0061868345,0.00014456756,0.057942968],"study_design_scores_gemma":[0.00048727475,0.00020374867,0.00012272588,0.0019085872,0.0000061233122,0.00011036655,6.636571e-7,0.9823169,0.000028889583,0.0033866141,0.010280327,0.0011477536],"about_ca_topic_score_codex":0.00020948861,"about_ca_topic_score_gemma":0.000027077498,"teacher_disagreement_score":0.79297763,"about_ca_system_score_codex":0.00071858166,"about_ca_system_score_gemma":0.00073769235,"threshold_uncertainty_score":0.9994092},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019955987,0.0012295501,0.99267405,0.00012567142,0.00007141588,0.00041472132,0.00006409867,0.000121166086,0.0033037462],"genre_scores_gemma":[0.8723639,0.00053464255,0.12687872,0.00004950185,0.000030787807,0.00003080235,0.000020081043,0.000025583562,0.000065956054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909425,0.000013753917,0.00027532486,0.0002606703,0.00018641069,0.00016959204],"domain_scores_gemma":[0.9990616,0.00034367887,0.000072324015,0.00036857103,0.000092661736,0.00006117856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002838796,0.00019504927,0.00028417935,0.00023345658,0.000092084876,0.00009054165,0.000352964,0.00016570314,0.000021177475],"category_scores_gemma":[0.000014822555,0.00019140479,0.000032070915,0.000061214,0.0007795142,0.00022533367,0.000119894175,0.00026843202,2.8671735e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011179971,0.000042283922,0.000066069544,0.0021941764,0.000058405352,0.0000014897382,0.011454406,0.014043643,0.010071157,0.30456364,0.0003562571,0.6571373],"study_design_scores_gemma":[0.00057498243,0.00019598387,0.00033801806,0.0019688138,0.000039079892,0.000016783455,0.000011445172,0.5888145,0.034097612,0.36036697,0.012596317,0.0009794703],"about_ca_topic_score_codex":0.000025439658,"about_ca_topic_score_gemma":0.000028967099,"teacher_disagreement_score":0.8703683,"about_ca_system_score_codex":0.000051279534,"about_ca_system_score_gemma":0.000031951073,"threshold_uncertainty_score":0.7805261},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009618523,0.00022213953,0.9926618,0.003229161,0.0005109177,0.00049306237,0.000004351512,0.00037420823,0.0015425055],"genre_scores_gemma":[0.65890855,0.000082267616,0.3381351,0.0009865506,0.00015893433,0.000050020368,0.0000042361876,0.000027613676,0.0016467561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971776,0.00001271203,0.00037478583,0.0013293833,0.0006413484,0.00046416948],"domain_scores_gemma":[0.99811536,0.00015272833,0.00024404697,0.0011654786,0.00018354747,0.00013885803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027867188,0.0004030032,0.0003527395,0.0007908057,0.00021436498,0.0009153111,0.0019972464,0.0002166293,0.000010357781],"category_scores_gemma":[0.000059319507,0.00033094926,0.00004392147,0.00044221166,0.0006513168,0.0007698623,0.00096813944,0.00040980702,0.000034874],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066741873,0.000014511452,0.0001090537,0.000019972358,0.000007935797,0.0000072728117,0.00046676488,0.00031214382,0.0020334679,0.03507657,0.000018560031,0.96192706],"study_design_scores_gemma":[0.0029696496,0.0029897792,0.011859076,0.002722674,0.000063567706,0.0002637852,0.00002636486,0.64075977,0.059422817,0.21458702,0.05841686,0.005918653],"about_ca_topic_score_codex":0.0000163431,"about_ca_topic_score_gemma":0.000078938625,"teacher_disagreement_score":0.95600843,"about_ca_system_score_codex":0.00022000552,"about_ca_system_score_gemma":0.00013057193,"threshold_uncertainty_score":0.9999142},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085635326,0.00017997649,0.9964688,0.00032880882,0.0012152292,0.00060109835,0.00001253174,0.00006445439,0.00027278406],"genre_scores_gemma":[0.1964335,0.0000069548246,0.8021956,0.00043329922,0.0006074497,0.000014036956,0.000041655836,0.00001892572,0.00024859543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972474,0.000029053155,0.00063749735,0.0010088475,0.0006737947,0.00040343578],"domain_scores_gemma":[0.99811256,0.00044330247,0.00047614268,0.00052680593,0.00035125265,0.00008994629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000943445,0.00036472612,0.00043305606,0.0010893857,0.00019395593,0.00026688297,0.0012028621,0.00020851681,0.000007589324],"category_scores_gemma":[0.00012894352,0.00035885305,0.00016362444,0.00060595263,0.0001500325,0.00056789233,0.00040745368,0.00030771975,0.000004711279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001285754,0.00002559413,0.000004071533,0.00006079023,0.00001336737,0.0000041207313,0.0012974305,0.052933436,0.0021992496,0.0025299273,0.00000845132,0.9409107],"study_design_scores_gemma":[0.00038440406,0.00045546985,0.000024363038,0.00032689073,0.00001022033,0.000030669315,6.531511e-7,0.9324526,0.018060822,0.04768486,0.00020841695,0.00036063904],"about_ca_topic_score_codex":0.0000055740466,"about_ca_topic_score_gemma":0.0000076134297,"teacher_disagreement_score":0.9405501,"about_ca_system_score_codex":0.00021180099,"about_ca_system_score_gemma":0.00029448318,"threshold_uncertainty_score":0.99988633},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000067582245,0.000022366838,0.98882693,0.00052318705,0.0009842955,0.00033711322,0.000023057677,0.0005276272,0.008687824],"genre_scores_gemma":[0.08094595,0.000007614002,0.9176137,0.0006097962,0.0002867455,0.000014432863,0.000018720903,0.000040728723,0.00046231961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962304,0.00002195508,0.0005329665,0.0015923921,0.0009195401,0.00070272177],"domain_scores_gemma":[0.9963104,0.0004905542,0.00051407795,0.0021171342,0.00036871133,0.00019913219],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078694907,0.00052899454,0.00048417534,0.0010281977,0.00029051758,0.00072705565,0.0040223543,0.00027474738,0.000030988504],"category_scores_gemma":[0.00016247963,0.00044790376,0.00009242837,0.00067865127,0.00094471115,0.0011635356,0.0018677545,0.0017776144,0.000026141128],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024167488,0.000111052206,0.0012100606,0.000055884662,0.00007749726,0.00053387,0.0020951792,0.0040383474,0.0006873118,0.023796888,0.00027316244,0.96709657],"study_design_scores_gemma":[0.00038248656,0.001083753,0.0004993632,0.0013047919,0.00005866993,0.00082637277,8.027865e-7,0.7709648,0.0153546175,0.19189674,0.015763791,0.0018638108],"about_ca_topic_score_codex":0.000035970184,"about_ca_topic_score_gemma":0.0003820744,"teacher_disagreement_score":0.9652328,"about_ca_system_score_codex":0.00025386663,"about_ca_system_score_gemma":0.00071807415,"threshold_uncertainty_score":0.9997973},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028548453,0.001055117,0.9892978,0.0006997286,0.0004178418,0.0006821895,0.00004183244,0.00016745011,0.00760948],"genre_scores_gemma":[0.03646357,0.00013133009,0.9603846,0.002561718,0.0002857682,0.000015868143,0.000029486795,0.00003489282,0.000092729715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503046,0.00003168152,0.0007957772,0.0021940568,0.0012718929,0.0006761089],"domain_scores_gemma":[0.99608874,0.00041896536,0.00032912445,0.0027441056,0.0002183706,0.00020066558],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00079652946,0.00055563485,0.0006980338,0.0008293259,0.000286961,0.0002339099,0.008428573,0.00024225558,0.000024414692],"category_scores_gemma":[0.000055650686,0.0005287238,0.00007779855,0.001030958,0.0011143906,0.0003760117,0.003341873,0.0006492776,0.000023396407],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109731645,0.000034754346,0.000019391584,0.000035719248,0.0000052845135,0.00005710892,0.00076221,0.036944088,0.00038512636,0.024470571,0.00078385207,0.9364909],"study_design_scores_gemma":[0.00029118685,0.0015166358,0.0005123106,0.0009028868,0.000012096665,0.00013939329,7.0184245e-7,0.6456319,0.00822894,0.3274516,0.013338884,0.0019734693],"about_ca_topic_score_codex":0.00010758457,"about_ca_topic_score_gemma":0.00012426866,"teacher_disagreement_score":0.93451744,"about_ca_system_score_codex":0.00035460715,"about_ca_system_score_gemma":0.00087901443,"threshold_uncertainty_score":0.99971646},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038675576,0.016473727,0.9408751,0.0008542688,0.0012667084,0.0012669277,0.000038873135,0.00007123398,0.0004775577],"genre_scores_gemma":[0.81918246,0.0008217622,0.17530245,0.0023060744,0.0014895912,0.000059506623,0.00008995317,0.000087438086,0.0006607905],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980467,0.000009782171,0.00039505033,0.00074436166,0.0004438593,0.00036023746],"domain_scores_gemma":[0.99743825,0.0015841721,0.00013906753,0.00037335916,0.00034292188,0.00012220377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044774407,0.00034150426,0.00054359087,0.0003024093,0.00022804305,0.00006666311,0.00020799966,0.00014024791,0.000047088244],"category_scores_gemma":[0.0004410231,0.0002880171,0.00015089528,0.0001384267,0.00075087295,0.0001058416,0.00024719775,0.00036304718,0.0000040894697],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015581318,0.00019443479,0.00464307,0.00052997173,0.00031943535,0.00059571187,0.0005623718,0.0061101113,0.00081647024,0.0032054805,0.00021598223,0.9826512],"study_design_scores_gemma":[0.013684588,0.008145205,0.025394998,0.021538464,0.0015996693,0.013193871,0.000017311888,0.37154686,0.0025425435,0.52736723,0.011286401,0.0036828434],"about_ca_topic_score_codex":0.000022920009,"about_ca_topic_score_gemma":0.0002028179,"teacher_disagreement_score":0.9789683,"about_ca_system_score_codex":0.00016013761,"about_ca_system_score_gemma":0.00020687391,"threshold_uncertainty_score":0.9999572},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022096995,0.0001635367,0.9764756,0.000088723405,0.00015962221,0.00034641553,0.0004704962,0.000104576924,0.00009405912],"genre_scores_gemma":[0.9278454,0.000019227113,0.0717674,0.00009915983,0.000026466269,0.0000018547305,0.0002144419,0.0000195233,0.000006538024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859166,0.000020799474,0.0002641427,0.00042626803,0.000324272,0.0003728266],"domain_scores_gemma":[0.9988784,0.00014901033,0.00009417697,0.00064636196,0.00013262442,0.00009939492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022967011,0.00031918415,0.00032439598,0.0003499747,0.00010846995,0.00010035547,0.00066107075,0.0001601097,0.000016426164],"category_scores_gemma":[0.00005127946,0.00030669538,0.00004857107,0.00043731267,0.00019671787,0.00024548633,0.0001460505,0.0005380757,0.0000052329433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052081225,0.000075850265,0.0034129457,0.000030856725,0.000024461771,0.000101664045,0.00032341224,0.9782895,0.00031312875,0.00009081554,0.00003104808,0.017254269],"study_design_scores_gemma":[0.0009824524,0.000046544093,0.007873743,0.00025583687,0.000011845897,0.000009394931,4.9179596e-7,0.98915875,0.00014899635,0.00057807076,0.00054730085,0.0003865843],"about_ca_topic_score_codex":0.000050921597,"about_ca_topic_score_gemma":0.00021749793,"teacher_disagreement_score":0.90574837,"about_ca_system_score_codex":0.00052570365,"about_ca_system_score_gemma":0.000111750975,"threshold_uncertainty_score":0.9999385},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008559066,0.00012586894,0.98095834,0.00024610583,0.0021386289,0.00021390182,0.0000057181874,0.00038032542,0.015922565],"genre_scores_gemma":[0.050591003,0.00034272735,0.9387615,0.004374378,0.001141421,0.0000074150835,0.000050710274,0.00010650987,0.004624344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683166,0.000026127873,0.0005255413,0.0012739453,0.0008388046,0.0005038987],"domain_scores_gemma":[0.99761444,0.00015685661,0.00035348843,0.0013779874,0.0002995471,0.00019766281],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061761803,0.00044635657,0.0004149831,0.00073542877,0.00021970888,0.0006351328,0.0030886414,0.00031020757,0.00011331476],"category_scores_gemma":[0.000069422014,0.00041859754,0.00011011481,0.000526928,0.00028198797,0.00093523634,0.0009931923,0.00058181613,0.00046738517],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011070401,0.00025994683,0.00009086129,0.00021092403,0.00007559016,0.00024059856,0.005665291,0.0022778306,0.00026316333,0.2961553,0.00042088452,0.69432855],"study_design_scores_gemma":[0.0007804768,0.00026660948,0.0001420962,0.0005450985,0.000045128276,0.00015229791,4.2739683e-7,0.64248645,0.004760559,0.29580614,0.05307681,0.001937882],"about_ca_topic_score_codex":0.000011485998,"about_ca_topic_score_gemma":0.000049719634,"teacher_disagreement_score":0.6923907,"about_ca_system_score_codex":0.00022796863,"about_ca_system_score_gemma":0.0004971773,"threshold_uncertainty_score":0.9998266},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029754787,0.0015138234,0.9899416,0.0005502606,0.0016269898,0.0003746687,0.000029372495,0.00017540231,0.005758159],"genre_scores_gemma":[0.006507011,0.00009120799,0.9872979,0.0042838356,0.000408702,0.000019281135,0.0000203307,0.000049463706,0.0013222762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961732,0.000055849814,0.0005198098,0.001647514,0.0008808487,0.00072277326],"domain_scores_gemma":[0.99715877,0.00024126765,0.00032341524,0.001864861,0.00020852227,0.00020314222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069402886,0.00059858203,0.0006136809,0.0005664044,0.0002886636,0.00030072237,0.0020472528,0.00025387964,0.000040103823],"category_scores_gemma":[0.000097821656,0.00051435473,0.00012936452,0.0006084885,0.0006488743,0.0011259859,0.0011378432,0.00074627326,0.00014247514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007393968,0.00003377887,0.000018628163,0.00006609752,0.000025117437,0.0005942353,0.0027387717,0.0061066845,0.00035015223,0.4981116,0.00027520946,0.4916723],"study_design_scores_gemma":[0.0015539388,0.0006437551,0.00007492665,0.002086914,0.000034866727,0.0010339239,0.0000055260953,0.21177186,0.017795585,0.32037807,0.43946522,0.0051553855],"about_ca_topic_score_codex":0.000025375428,"about_ca_topic_score_gemma":0.0001535133,"teacher_disagreement_score":0.48651692,"about_ca_system_score_codex":0.0002523228,"about_ca_system_score_gemma":0.00042299615,"threshold_uncertainty_score":0.9997308},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071532227,0.00016437988,0.98080456,0.0011394417,0.0009922669,0.0002846771,0.000008570675,0.00017705106,0.015713736],"genre_scores_gemma":[0.68165946,0.00006187763,0.30461147,0.011602172,0.000570244,0.000021798734,0.0000074154086,0.00009293963,0.0013726191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699455,0.000073600735,0.0005076042,0.001066434,0.00078576175,0.00057206705],"domain_scores_gemma":[0.99562925,0.0016920308,0.00042528895,0.0020260387,0.00013791324,0.00008945705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014603224,0.00047032392,0.00046958672,0.00030983632,0.0002661638,0.00049588847,0.004206223,0.00024261656,0.0000959415],"category_scores_gemma":[0.00027064906,0.00032285557,0.00016394432,0.00055100577,0.00071496767,0.00036875755,0.0011181046,0.00072473154,0.000047066645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007645115,0.00006446877,0.00006704919,0.00006135587,0.000030232351,0.000058849786,0.0015212558,0.0032585692,0.0007279895,0.24124224,0.00014970978,0.7528106],"study_design_scores_gemma":[0.0004231217,0.00020384848,0.00016147766,0.0008000839,0.000014527432,0.00010731245,0.0000024256706,0.7453526,0.008365187,0.24104437,0.0025097548,0.0010152324],"about_ca_topic_score_codex":0.00002078993,"about_ca_topic_score_gemma":0.000009705282,"teacher_disagreement_score":0.7517954,"about_ca_system_score_codex":0.0001169895,"about_ca_system_score_gemma":0.00023353739,"threshold_uncertainty_score":0.99992234},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011955014,0.000057351153,0.9935342,0.00023763046,0.0016739218,0.0008196763,0.000011624063,0.00036508427,0.002105019],"genre_scores_gemma":[0.44031218,0.000072794755,0.5566771,0.0022065202,0.00031481078,0.00002251648,0.000037331756,0.000039119685,0.0003176414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942285,0.00006529117,0.0010330909,0.00088547566,0.002964853,0.0008228187],"domain_scores_gemma":[0.9963586,0.0005269067,0.0006334374,0.0014831469,0.0007637957,0.00023411632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019287968,0.0005981227,0.0005238635,0.0014043557,0.00071067276,0.00064362184,0.00290999,0.0003858741,0.000010134951],"category_scores_gemma":[0.0003329406,0.0005274386,0.00016176219,0.0011434495,0.00046248527,0.0027929014,0.0005875527,0.0012615763,0.00031138503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056371555,0.0000401987,0.000056594377,0.0002638165,0.0000052028468,0.00003893813,0.0012327402,0.3537008,0.00006120084,0.0021085541,0.000025183217,0.6424104],"study_design_scores_gemma":[0.00071407424,0.00053187483,0.00042855096,0.0008154935,0.0000049636537,0.000071952476,3.6844105e-7,0.9935001,0.0021638654,0.00009936953,0.0010650379,0.0006043527],"about_ca_topic_score_codex":0.00000794614,"about_ca_topic_score_gemma":0.0000021014691,"teacher_disagreement_score":0.64180607,"about_ca_system_score_codex":0.001027831,"about_ca_system_score_gemma":0.0012187401,"threshold_uncertainty_score":0.9997177},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4625056,0.000007296053,0.5360705,0.0007920236,0.00034791807,0.0002264009,0.0000018540168,0.00004390367,0.000004468122],"genre_scores_gemma":[0.96610004,0.0000037510085,0.029550062,0.004160385,0.00015828526,0.000006445968,7.800589e-7,0.000013751637,0.000006523976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960997,0.0003401202,0.0002772705,0.0014361771,0.0010497026,0.0007970256],"domain_scores_gemma":[0.9984373,0.00054781034,0.00006646534,0.0005094416,0.000096986376,0.00034199902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064921984,0.00024441152,0.00032205245,0.0011088199,0.0006117165,0.00020477097,0.001183439,0.00008084279,0.000040499475],"category_scores_gemma":[0.0005121618,0.00022297728,0.00008952167,0.010390419,0.0010542654,0.00040636474,0.00033364375,0.00040403142,0.00004685181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003562644,0.00007423131,0.005167626,0.0000043334744,0.000001628984,0.00003351213,0.00046764166,0.5549731,0.43582088,0.0000056137333,0.000007970068,0.0034078134],"study_design_scores_gemma":[0.00020248492,0.00014376848,0.0026602028,0.0000073204037,0.000009807181,0.000037050704,7.488134e-7,0.7106561,0.28607523,0.000032916792,0.000011490652,0.00016289813],"about_ca_topic_score_codex":0.0001431378,"about_ca_topic_score_gemma":0.00003464614,"teacher_disagreement_score":0.50652045,"about_ca_system_score_codex":0.00018200457,"about_ca_system_score_gemma":0.0006305195,"threshold_uncertainty_score":0.90927494},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11109138,0.0039838115,0.8622942,0.005006817,0.0031596906,0.0030656445,0.000027850518,0.000090913876,0.0112797],"genre_scores_gemma":[0.96475816,0.00088149565,0.027335994,0.004414591,0.0012746656,0.00001938828,0.00006482011,0.00011129654,0.0011395823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975712,0.00006116918,0.00037863615,0.0010228091,0.00045512812,0.0005110663],"domain_scores_gemma":[0.99820244,0.000104786384,0.00017447468,0.0013455183,0.00009831364,0.000074478994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008750668,0.00039695366,0.00029705928,0.0002846792,0.000181694,0.00008877276,0.0014925578,0.0002458507,0.000015947096],"category_scores_gemma":[0.00013156494,0.00030373677,0.000129455,0.00020864204,0.00048777094,0.000005487253,0.0010311687,0.00054736616,0.000030965697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017086757,0.00023920003,0.0005012972,0.00011268843,0.00014099416,0.00044206277,0.00320576,0.37491903,0.03590695,0.0005210801,0.0018510467,0.58198905],"study_design_scores_gemma":[0.015084623,0.0098285675,0.026853234,0.0073300116,0.00022264522,0.0011382841,0.000016194184,0.50878346,0.11529995,0.07799886,0.22384705,0.013597098],"about_ca_topic_score_codex":0.000032095915,"about_ca_topic_score_gemma":0.00014379168,"teacher_disagreement_score":0.8536668,"about_ca_system_score_codex":0.00015182827,"about_ca_system_score_gemma":0.000209197,"threshold_uncertainty_score":0.99994147},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007845472,0.00177963,0.9860826,0.00029553453,0.0027715047,0.0006202804,0.0000018463601,0.00008256186,0.0005205714],"genre_scores_gemma":[0.8874748,0.000059570055,0.11173537,0.0003585575,0.00030703563,0.00001233583,0.0000022584672,0.000029127446,0.000020951238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99523205,0.0005661171,0.00075027964,0.0012204895,0.0014855518,0.0007454934],"domain_scores_gemma":[0.9914007,0.0060534584,0.00061570667,0.0015928112,0.00023868943,0.00009859728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0067394446,0.00052030315,0.0007662309,0.0008103099,0.00023508833,0.00023591488,0.0028052635,0.0002931523,0.000006358264],"category_scores_gemma":[0.0010413367,0.00037424295,0.00017046275,0.0009960094,0.00043243638,0.0005350923,0.00075985986,0.0011207415,0.000010577858],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013666915,0.000046811132,0.003073344,0.00012196387,0.000008118555,0.0000149316365,0.00067609886,0.032911196,0.0015947485,0.0021526625,0.0000017988366,0.9593847],"study_design_scores_gemma":[0.0016584502,0.0013150068,0.10179183,0.0044575892,0.000019407431,0.00003442439,7.309207e-7,0.7508947,0.04385807,0.09423008,0.00017110423,0.0015686051],"about_ca_topic_score_codex":0.000043740994,"about_ca_topic_score_gemma":0.00013490401,"teacher_disagreement_score":0.95781606,"about_ca_system_score_codex":0.0002643944,"about_ca_system_score_gemma":0.00019671023,"threshold_uncertainty_score":0.99987096},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00130236,0.00009563215,0.93786347,0.0006607909,0.00079985656,0.00026456965,0.000013333732,0.00006616743,0.05893382],"genre_scores_gemma":[0.95398986,0.0000050878402,0.04344515,0.00065396115,0.00045527128,0.0000035794849,0.000009987566,0.00003748823,0.0013996303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974854,0.000050295832,0.0006355845,0.0007344125,0.0007194777,0.00037481435],"domain_scores_gemma":[0.99630857,0.0022328775,0.00036037597,0.0009090823,0.000111138914,0.00007798064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082632684,0.0003784161,0.00058206415,0.0004206943,0.00009740809,0.00004748522,0.0008984261,0.00033917552,0.000052795775],"category_scores_gemma":[0.00036485653,0.00031920822,0.00014552557,0.00033135383,0.00067059114,0.000106096115,0.00023202466,0.0008197607,0.00003012723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006676761,0.0008813349,0.0001227761,0.001192662,0.00011372223,0.00066905696,0.003216373,0.037195653,0.00014414765,0.6224403,0.005951052,0.32740527],"study_design_scores_gemma":[0.00025489982,0.0003565827,0.000042892243,0.00048939965,0.000016552132,0.00003953874,2.674735e-7,0.012999386,0.0013240527,0.9838166,0.00029209422,0.00036770478],"about_ca_topic_score_codex":0.000015792912,"about_ca_topic_score_gemma":0.000008243285,"teacher_disagreement_score":0.9526875,"about_ca_system_score_codex":0.0001055539,"about_ca_system_score_gemma":0.00013785259,"threshold_uncertainty_score":0.999926},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001107235,0.00074068963,0.99050415,0.002372575,0.0016425488,0.00043919217,0.000010652154,0.00071338075,0.0024695515],"genre_scores_gemma":[0.1923362,0.00006638484,0.80060613,0.0045114933,0.0013940466,0.000012436892,0.00001004802,0.00008874675,0.00097449473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532187,0.000064131,0.0006686892,0.0014115189,0.0013655191,0.0011682468],"domain_scores_gemma":[0.9952096,0.0006833456,0.00032233325,0.0034120495,0.00019013762,0.00018254887],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010278709,0.0007891818,0.00078494137,0.001698369,0.0005416374,0.0015412217,0.009357521,0.00046788604,0.000008685167],"category_scores_gemma":[0.000090391666,0.0007520169,0.00017269042,0.0012344304,0.0013093414,0.0013386331,0.006935626,0.001537545,0.00005498912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008108294,0.000040987296,0.00012759602,0.000049241826,0.000025870288,0.00016388984,0.0019359599,0.37159464,0.00014767879,0.020480609,0.0003410014,0.6050844],"study_design_scores_gemma":[0.0002905747,0.00026292555,0.00014856106,0.001647424,0.000022188258,0.00035771725,0.0000032807327,0.8863145,0.0014342183,0.082079984,0.02549931,0.0019393361],"about_ca_topic_score_codex":0.00011555198,"about_ca_topic_score_gemma":0.00045479392,"teacher_disagreement_score":0.60314506,"about_ca_system_score_codex":0.0006576945,"about_ca_system_score_gemma":0.00046205867,"threshold_uncertainty_score":0.99949527},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000079616235,0.0006928588,0.9490427,0.0005705581,0.0012301579,0.0004554739,0.0000039321462,0.00036080446,0.04756394],"genre_scores_gemma":[0.029729396,0.00028657148,0.96441454,0.002772431,0.001002343,0.000025298827,0.000054656044,0.00007630879,0.0016384731],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944421,0.0000988164,0.00065068837,0.0023663384,0.0013304044,0.0011116735],"domain_scores_gemma":[0.99711233,0.00025196763,0.00029998066,0.0018297962,0.00021675206,0.00028918573],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010391542,0.0008049821,0.0008412548,0.0007855296,0.0004575207,0.0010519805,0.005061068,0.0005276974,0.00007709144],"category_scores_gemma":[0.00006555379,0.0006816484,0.00025884318,0.00106745,0.00063617923,0.0006813941,0.0018679395,0.0014314991,0.00015915785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013643647,0.00007552462,0.0001219141,0.0000534523,0.000027193813,0.00029236905,0.001830624,0.17334507,0.000034686374,0.038969133,0.00024595883,0.78499043],"study_design_scores_gemma":[0.0005151787,0.00020409963,0.000032060612,0.00009379588,0.000009249225,0.00020432398,2.5250137e-7,0.89602214,0.000046147252,0.0807153,0.021251086,0.00090635894],"about_ca_topic_score_codex":0.000056822246,"about_ca_topic_score_gemma":0.00001628329,"teacher_disagreement_score":0.7840841,"about_ca_system_score_codex":0.00027850913,"about_ca_system_score_gemma":0.00047520243,"threshold_uncertainty_score":0.99998504},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018984196,0.00013669518,0.9828446,0.0001762932,0.00077202736,0.00022105759,0.000002156147,0.0004887568,0.015339413],"genre_scores_gemma":[0.059122574,0.000038654725,0.93898445,0.00094738405,0.0002602865,0.0000034095779,0.000017449815,0.000023469684,0.0006023087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620277,0.00003482011,0.00059376773,0.0015022545,0.0010761245,0.00059023785],"domain_scores_gemma":[0.9975198,0.00032902168,0.00036320704,0.0012732925,0.00033891216,0.00017576017],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012222258,0.00045447046,0.0005460727,0.0027716476,0.00025025677,0.0005110172,0.0026596198,0.00033823148,0.000029654931],"category_scores_gemma":[0.00005982019,0.00044468231,0.00024300066,0.0025544434,0.00039549393,0.0004979389,0.0007224542,0.00059145765,0.000032467684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005452009,0.000027909324,0.00019109967,0.000011482025,0.00006618046,0.00006838547,0.00063451653,0.22946759,0.000017085174,0.031173352,0.000043962034,0.738293],"study_design_scores_gemma":[0.00015554547,0.00010265634,0.0003177793,0.00006391369,0.000046148987,0.00001557519,1.0789675e-7,0.95751643,0.00085478026,0.03974312,0.0006290344,0.00055493414],"about_ca_topic_score_codex":0.000033759006,"about_ca_topic_score_gemma":0.00012189973,"teacher_disagreement_score":0.7377381,"about_ca_system_score_codex":0.0002643814,"about_ca_system_score_gemma":0.00032147596,"threshold_uncertainty_score":0.9998005},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017500537,0.0016203212,0.9936812,0.0001535466,0.0015673498,0.00033318257,0.0000015189421,0.00018908526,0.0007037296],"genre_scores_gemma":[0.6691035,0.00011889777,0.32527807,0.001603682,0.0014665354,0.000009196453,0.0000040018517,0.000063769214,0.0023523734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966987,0.00005714007,0.00038246938,0.0015402121,0.0007359823,0.0005855239],"domain_scores_gemma":[0.99803215,0.00061378756,0.00015810716,0.00089206145,0.00014035514,0.00016354644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005884161,0.0005392453,0.0005825848,0.0005118856,0.000285106,0.00078696694,0.00157786,0.00029018693,0.0000041031685],"category_scores_gemma":[0.00008962913,0.00047545467,0.00010539372,0.00024186967,0.0001736333,0.00057164923,0.0007734316,0.00081670337,0.000030201385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049884466,0.000018018092,0.0001383259,0.00006469411,0.00002571684,0.00024502046,0.0012948797,0.23311073,0.00055696437,0.06696067,0.0000060551765,0.69757396],"study_design_scores_gemma":[0.0001949353,0.00021049856,0.00016721759,0.0015807863,0.000011806266,0.000037286154,1.7793492e-7,0.9362333,0.001631219,0.05698328,0.0021844478,0.0007650497],"about_ca_topic_score_codex":0.00018901381,"about_ca_topic_score_gemma":0.00006118207,"teacher_disagreement_score":0.70312256,"about_ca_system_score_codex":0.00018610281,"about_ca_system_score_gemma":0.00017707376,"threshold_uncertainty_score":0.9997697},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000096727825,0.00055208575,0.99344206,0.00007478852,0.001158589,0.00046062664,0.000003594377,0.000071735005,0.0041397936],"genre_scores_gemma":[0.61929584,0.000011644304,0.37947398,0.00059955905,0.00019589966,0.000010100106,0.0000025009133,0.00005569151,0.00035475954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671894,0.000089448564,0.00059239985,0.0012425912,0.000759729,0.0005968977],"domain_scores_gemma":[0.99788237,0.00047656457,0.00020290472,0.00082236173,0.00043553396,0.00018028199],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008770414,0.00049173064,0.00060845126,0.0009984004,0.0002328657,0.000206493,0.001856642,0.00028356092,0.000023197106],"category_scores_gemma":[0.000112602705,0.00048109112,0.00016966905,0.0010612556,0.0006721042,0.00047952033,0.0003277669,0.0008184651,0.000022965898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019564055,0.00011972737,0.000019301346,0.0001335044,0.00004661356,0.000039185292,0.008240653,0.65871024,0.007384913,0.044754,0.000014078327,0.28051823],"study_design_scores_gemma":[0.0005211797,0.0002146261,0.00005617801,0.0005728976,0.000020288473,0.000089049965,7.823687e-7,0.9555806,0.0028085464,0.038647894,0.00067824265,0.000809728],"about_ca_topic_score_codex":0.0000117576,"about_ca_topic_score_gemma":0.000020798761,"teacher_disagreement_score":0.6191991,"about_ca_system_score_codex":0.00031198,"about_ca_system_score_gemma":0.00083191274,"threshold_uncertainty_score":0.9997641},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008011695,0.001681517,0.99263066,0.0018541313,0.0007045277,0.00056514645,0.000016869892,0.00008599421,0.0016600123],"genre_scores_gemma":[0.9657566,0.00004761869,0.028695712,0.0051613445,0.00022993282,0.00000973471,0.0000050732983,0.000026879232,0.00006711968],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950065,0.000383629,0.001009395,0.0014810528,0.0012856597,0.00083377917],"domain_scores_gemma":[0.9953742,0.0017880499,0.0006301216,0.0018107453,0.00029461953,0.00010226555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0051881117,0.0006172915,0.001060956,0.0006265913,0.00025494586,0.0004817448,0.0051472876,0.0003443028,0.000008061508],"category_scores_gemma":[0.00021861836,0.00048060386,0.00022018669,0.0009287906,0.00080501894,0.00054099655,0.00030039987,0.0012240371,0.0000071301192],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011682246,0.00006807432,0.0013941788,0.00003543859,0.000014986195,0.00009026576,0.0018088088,0.0032711648,0.00069379277,0.007881318,0.0001084512,0.9846218],"study_design_scores_gemma":[0.009756405,0.003289545,0.06932067,0.0040589413,0.00006141515,0.00064004655,0.000014278492,0.34748486,0.011810965,0.52134824,0.024647193,0.007567472],"about_ca_topic_score_codex":0.00018363968,"about_ca_topic_score_gemma":0.0006839142,"teacher_disagreement_score":0.97705436,"about_ca_system_score_codex":0.00017398795,"about_ca_system_score_gemma":0.0002988161,"threshold_uncertainty_score":0.99976456},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8162558,0.0006633893,0.17977981,0.00048193196,0.00046598032,0.001169621,0.000022331933,0.00008202163,0.0010790963],"genre_scores_gemma":[0.95772785,0.00005414757,0.04171711,0.00025272826,0.00010862605,0.0000030335548,0.000019923837,0.000022709939,0.00009389363],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99759626,0.000033941567,0.00067575864,0.00090693776,0.0004774624,0.00030964884],"domain_scores_gemma":[0.99835193,0.0005982595,0.00027932407,0.000555575,0.00009678514,0.0001181343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005309005,0.000312315,0.0006695329,0.00047632543,0.000088600376,0.00007961231,0.00010462348,0.00018240692,0.000025880245],"category_scores_gemma":[0.0003358461,0.000287853,0.000053103737,0.00027289972,0.0006794373,0.0002959133,0.0003904069,0.00044522883,0.0000018028652],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010734934,0.000084065854,0.08988754,0.00027869764,0.00001552948,0.0000892954,0.0009800497,0.0016934299,0.00017943866,0.00007484644,0.0000021536598,0.9066076],"study_design_scores_gemma":[0.006070915,0.0019361041,0.7606526,0.0053199357,0.00008457944,0.001752816,0.0000038720004,0.21388462,0.0013054486,0.007432869,0.0003835981,0.0011726172],"about_ca_topic_score_codex":0.00005428027,"about_ca_topic_score_gemma":0.000055639604,"teacher_disagreement_score":0.90543497,"about_ca_system_score_codex":0.00014215091,"about_ca_system_score_gemma":0.00016677902,"threshold_uncertainty_score":0.9999574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055430294,0.00047810728,0.9928907,0.00021564381,0.00048608083,0.00019985654,0.000007465361,0.000014115725,0.00016495746],"genre_scores_gemma":[0.9755733,0.00013298764,0.021923533,0.0008668019,0.0009520104,0.000006173445,0.000032456202,0.000020393187,0.0004923271],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985883,0.000020059615,0.0002225843,0.0007289056,0.00022754,0.00021257548],"domain_scores_gemma":[0.9993094,0.000039823604,0.00014105905,0.0003537733,0.00008521586,0.00007073127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022328063,0.00022896532,0.00017343118,0.0001382821,0.00012710244,0.000099523655,0.00025898428,0.0002621453,0.0000054580505],"category_scores_gemma":[0.00006541366,0.00020175494,0.000054381846,0.000092387556,0.0001894647,0.000013301658,0.00023323724,0.0002526731,0.0000018877387],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040141094,0.00002004162,0.0001262797,0.000025992951,0.00000716488,0.0000014257358,0.000041351665,0.0042411564,0.17687011,0.000033449003,0.000013696888,0.8185792],"study_design_scores_gemma":[0.0014020975,0.0013849927,0.0026872498,0.0005132701,0.000048049737,0.00009030022,0.0000010131405,0.27480868,0.665353,0.021217428,0.030839644,0.0016542847],"about_ca_topic_score_codex":0.000018307162,"about_ca_topic_score_gemma":0.00015382313,"teacher_disagreement_score":0.97096723,"about_ca_system_score_codex":0.00005096864,"about_ca_system_score_gemma":0.00008879789,"threshold_uncertainty_score":0.82273275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081167644,0.001036883,0.99521583,0.0004384652,0.00093505747,0.0002607208,0.0000043408986,0.00010448069,0.0011925676],"genre_scores_gemma":[0.1822037,0.00021401921,0.81543833,0.0011099342,0.0006549838,0.000008565249,0.000007879692,0.000042506006,0.00032010916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966707,0.000028338301,0.0004992281,0.0014984875,0.00068942143,0.0006137751],"domain_scores_gemma":[0.9981245,0.00037655866,0.0002431361,0.0010020535,0.00008057732,0.00017318326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070329773,0.0004398464,0.00044818275,0.00071578985,0.000200104,0.00047492085,0.0020651112,0.0002601121,0.000013200544],"category_scores_gemma":[0.00007936202,0.00039320963,0.000054849726,0.0004081187,0.00036175988,0.0009273399,0.002177445,0.0007761986,0.000019683117],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028659158,0.000018118422,0.00025421145,0.000019265352,0.000002564041,0.00009441511,0.00057199376,0.011371857,0.00007616454,0.0034893479,0.000016246695,0.98408294],"study_design_scores_gemma":[0.0003718826,0.00007896559,0.0013676607,0.0005690714,0.0000029404719,0.00008023817,1.6662875e-7,0.9715463,0.00036026732,0.022165567,0.0028088873,0.00064804987],"about_ca_topic_score_codex":0.00005928036,"about_ca_topic_score_gemma":0.00018850261,"teacher_disagreement_score":0.9834349,"about_ca_system_score_codex":0.00020156626,"about_ca_system_score_gemma":0.0002501402,"threshold_uncertainty_score":0.999852},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004691335,0.0005527925,0.9927317,0.0008627181,0.0008734385,0.00028970672,0.0000014410541,0.00024262206,0.0039764293],"genre_scores_gemma":[0.1430684,0.00023251293,0.8518764,0.0012588835,0.0010302112,0.000022135619,0.000008278728,0.000069777794,0.0024334323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955652,0.000071067516,0.00058537367,0.0017829238,0.0011436767,0.0008517799],"domain_scores_gemma":[0.9972443,0.001092363,0.0003327482,0.0008822086,0.00027043637,0.00017792088],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011635444,0.0005660891,0.00059874076,0.00090791093,0.00030634573,0.0006652409,0.0031523015,0.000332385,0.00004716178],"category_scores_gemma":[0.00060708506,0.00051432656,0.00009648552,0.0012224584,0.00029910292,0.0009858296,0.0013690748,0.0018890991,0.00006840955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009928291,0.00002517902,0.0003148177,0.000029136834,0.000003402778,0.00007616907,0.000620189,0.21552418,0.000013317496,0.0006004876,0.0000072583944,0.78277594],"study_design_scores_gemma":[0.00046857487,0.00024439205,0.0012292608,0.0010579743,0.0000048858965,0.00005993928,4.0956908e-7,0.9502536,0.00052946334,0.034590032,0.010703893,0.0008575473],"about_ca_topic_score_codex":0.00006381712,"about_ca_topic_score_gemma":0.0006511511,"teacher_disagreement_score":0.7819184,"about_ca_system_score_codex":0.00032898245,"about_ca_system_score_gemma":0.0011100739,"threshold_uncertainty_score":0.9997308},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024040378,0.00006124884,0.9962963,0.0001054141,0.0013610173,0.0014247978,0.00025164298,0.00009887764,0.00016033652],"genre_scores_gemma":[0.2408349,0.000004276885,0.7573255,0.00070309255,0.0007298251,0.000037690785,0.00025276354,0.000034506003,0.000077444456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583924,0.000053710643,0.0006795532,0.0016737428,0.001058961,0.00069478864],"domain_scores_gemma":[0.9969256,0.00047087346,0.00046505584,0.0017760403,0.00022921122,0.00013320011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011770221,0.0005708083,0.0008592554,0.00087856565,0.00028951417,0.00048329664,0.0039612064,0.00012447845,0.000010204588],"category_scores_gemma":[0.000030827916,0.00054334954,0.00012811559,0.00048338962,0.00029069776,0.00091473677,0.0026477291,0.0004371356,0.000012648699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078748315,0.0011638221,0.00021368757,0.00019579062,0.00014265068,0.00019216188,0.0030464537,0.15147842,0.00009024078,0.004169512,0.00024886715,0.83897966],"study_design_scores_gemma":[0.0020365927,0.00067040155,0.00013035243,0.00018323277,0.000032125732,0.000005997358,0.0000014338353,0.9910352,0.0007418885,0.003194692,0.0013705472,0.0005974854],"about_ca_topic_score_codex":0.00012374028,"about_ca_topic_score_gemma":0.001970424,"teacher_disagreement_score":0.8395568,"about_ca_system_score_codex":0.00016454654,"about_ca_system_score_gemma":0.00026847082,"threshold_uncertainty_score":0.9997018},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001474241,0.00054236606,0.9907654,0.0016247325,0.0012773968,0.00040627597,0.000010500121,0.0001565833,0.0050693233],"genre_scores_gemma":[0.0118108755,0.00005885785,0.97847116,0.0070504406,0.00083531335,0.000013621672,0.00003598368,0.000047623314,0.0016761092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996104,0.00008727345,0.000370893,0.0016685821,0.0010827564,0.00068651984],"domain_scores_gemma":[0.99725664,0.00066214043,0.00024682638,0.0014519466,0.00013367149,0.00024877692],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005519437,0.0005608827,0.00047198744,0.00028028843,0.00034630447,0.0007318213,0.0030747135,0.00043289145,0.000090006986],"category_scores_gemma":[0.00008385863,0.000391773,0.00015807513,0.000537017,0.00034565615,0.0005865353,0.0008055196,0.0010368022,0.0001656875],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002879953,0.00012729062,0.00007974787,0.000027085227,0.000043354292,0.0001092833,0.00254387,0.025139308,0.0012470981,0.0016423475,0.0074506304,0.9615612],"study_design_scores_gemma":[0.0010334825,0.00033175744,0.000103230006,0.00080626504,0.000043605054,0.0002428756,0.0000024729445,0.8787565,0.010597209,0.05160725,0.054732934,0.0017423908],"about_ca_topic_score_codex":0.000078211444,"about_ca_topic_score_gemma":0.000032827364,"teacher_disagreement_score":0.9598188,"about_ca_system_score_codex":0.000159793,"about_ca_system_score_gemma":0.00052848837,"threshold_uncertainty_score":0.99985343},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000108455766,0.0009921747,0.98714894,0.0026681335,0.0008918884,0.0009704256,0.0000016492718,0.00018131126,0.007037026],"genre_scores_gemma":[0.29975373,0.00045129398,0.69114906,0.0068449546,0.00051674,0.00012649182,0.000018878607,0.000068425164,0.0010704632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574006,0.000112222326,0.0007918216,0.0016687361,0.0008783849,0.0008087586],"domain_scores_gemma":[0.99584657,0.0003540267,0.0003817075,0.0031257558,0.00014256971,0.00014938715],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016900279,0.00056222157,0.0005276328,0.0012105586,0.00016681016,0.0005220276,0.0065873587,0.000263639,0.000057407724],"category_scores_gemma":[0.000046455367,0.00054944976,0.00012607494,0.00082981976,0.0005817675,0.0007137503,0.004005931,0.0011002355,0.00013856844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057337993,0.000056062574,0.000113389506,0.000027985037,0.000008231938,0.000075077274,0.00049357256,0.08517154,0.000011995777,0.015850574,0.00017512795,0.89801073],"study_design_scores_gemma":[0.00048745965,0.00019036728,0.00034705736,0.0006543554,0.000008259156,0.000028318409,2.3475255e-7,0.9072079,0.00023144534,0.064723544,0.025286248,0.0008347901],"about_ca_topic_score_codex":0.000050934752,"about_ca_topic_score_gemma":0.00067673915,"teacher_disagreement_score":0.8971759,"about_ca_system_score_codex":0.0011276243,"about_ca_system_score_gemma":0.00035476356,"threshold_uncertainty_score":0.9996957},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017740439,0.0059328135,0.98660654,0.00031279572,0.0013877187,0.0005149192,0.000005242741,0.00011260785,0.0033533107],"genre_scores_gemma":[0.7185941,0.0014492705,0.27649957,0.0014897257,0.0005552268,0.000026197988,0.0000030741455,0.000049739006,0.0013331316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698615,0.000039709783,0.00051962945,0.0013630057,0.0005200023,0.00057148986],"domain_scores_gemma":[0.9973542,0.0005430107,0.0003501838,0.0011071395,0.0004828636,0.00016262001],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007884774,0.00047924955,0.00068965845,0.00055469974,0.00031153357,0.00017537794,0.001430304,0.00024698398,0.0000075409635],"category_scores_gemma":[0.00023025036,0.00037303162,0.00009871872,0.0004673868,0.0012853337,0.0004078007,0.0022278156,0.0005072334,0.000007758391],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009720989,0.00010061997,0.00046698577,0.00017261894,0.00007790947,0.0034945412,0.0036309103,0.0008095117,0.00028973012,0.07308741,0.00011611947,0.9177439],"study_design_scores_gemma":[0.0018720676,0.0023631926,0.0005698666,0.0015801062,0.00012869366,0.013801072,0.000008612386,0.26872,0.0033625376,0.6957745,0.008951434,0.002867905],"about_ca_topic_score_codex":0.00004138576,"about_ca_topic_score_gemma":0.0002011051,"teacher_disagreement_score":0.91487604,"about_ca_system_score_codex":0.00012452906,"about_ca_system_score_gemma":0.0003053607,"threshold_uncertainty_score":0.99987215},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002004617,0.00013818055,0.9950186,0.00012594272,0.00009405335,0.0034013034,0.000009839485,0.0003748873,0.0008171526],"genre_scores_gemma":[0.0977095,0.000021373622,0.90167737,0.000085685344,0.000033355976,0.00039953573,0.000023553885,0.00002665623,0.000022988599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742615,0.000026268714,0.00071878155,0.0006093254,0.00079997134,0.00041947345],"domain_scores_gemma":[0.9978321,0.000085832406,0.0002914245,0.0014473004,0.00027567646,0.0000676685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008751461,0.00037194983,0.00041993332,0.0006709366,0.00014416246,0.00018283463,0.0031607612,0.0002959855,0.0000020105135],"category_scores_gemma":[0.0000056251715,0.0003704241,0.000119449775,0.0004333805,0.00025515005,0.001415344,0.00052857376,0.0005794061,0.0000018436446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000297306,0.000023584184,0.000004412508,0.00007314093,0.000004073676,0.0000011672097,0.0004387903,0.62969184,0.00018075506,0.06296249,0.0000323378,0.30658442],"study_design_scores_gemma":[0.00014590716,0.00009089877,0.0000028187283,0.0005441046,0.0000030772283,0.000009520527,1.7912388e-8,0.9228942,0.0036458052,0.07112412,0.0012013912,0.00033817993],"about_ca_topic_score_codex":0.000050200142,"about_ca_topic_score_gemma":0.000012039721,"teacher_disagreement_score":0.30624622,"about_ca_system_score_codex":0.00019552391,"about_ca_system_score_gemma":0.00017248584,"threshold_uncertainty_score":0.9998748},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017193557,0.0012022842,0.99432176,0.00075695873,0.00049202866,0.00027774822,0.000013300992,0.00022757571,0.0009890121],"genre_scores_gemma":[0.26423803,0.000074474134,0.7320576,0.0031677154,0.0002605608,0.000012481566,0.000017260074,0.000030541833,0.00014133999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753547,0.00004570364,0.00035605757,0.0010932462,0.0005527474,0.00041676563],"domain_scores_gemma":[0.99827886,0.00033541524,0.00009419299,0.001032043,0.00010105959,0.00015841759],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004688995,0.00038249747,0.00036909597,0.0005670075,0.00041858663,0.0005005922,0.0016748041,0.0002010304,0.00002143867],"category_scores_gemma":[0.00003299716,0.000352849,0.00009022747,0.00033747556,0.00068601844,0.0004777832,0.00060533336,0.00047723326,0.000021627897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010640288,0.00016985302,0.00015469815,0.0001144685,0.00003131642,0.00061090285,0.0051410566,0.093584664,0.0029728313,0.058707893,0.00016540202,0.8383363],"study_design_scores_gemma":[0.0004968248,0.00018791288,0.0007201323,0.00035508713,0.000011463999,0.00032685781,3.9792815e-7,0.97393036,0.0045596394,0.017661486,0.0007828032,0.0009670393],"about_ca_topic_score_codex":0.000037793372,"about_ca_topic_score_gemma":0.00009528889,"teacher_disagreement_score":0.8803457,"about_ca_system_score_codex":0.00014925409,"about_ca_system_score_gemma":0.0004956576,"threshold_uncertainty_score":0.99989235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027197919,0.00017962807,0.9730283,0.00080293755,0.0008938734,0.00060860795,0.0000017136326,0.00008850532,0.024369247],"genre_scores_gemma":[0.43078923,0.00011320506,0.5566094,0.008459804,0.0010045841,0.00007048342,0.000014840575,0.000086640975,0.0028518192],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957712,0.000025005253,0.0005256027,0.0018905164,0.0009754108,0.00081225333],"domain_scores_gemma":[0.9974562,0.0001836976,0.00032504875,0.0015391149,0.00032240414,0.00017351694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007547459,0.00059676456,0.00056631124,0.0010218957,0.00028465572,0.0007650999,0.0044384436,0.00031831695,0.0000494219],"category_scores_gemma":[0.000059935723,0.00057545956,0.00020539941,0.000540255,0.00031309124,0.0011035581,0.0016999416,0.0010704721,0.000084824525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030659397,0.00013964086,0.000060576676,0.000080374215,0.00006164263,0.0003895167,0.00196335,0.0041500344,0.025010861,0.19240293,0.00008362485,0.7756268],"study_design_scores_gemma":[0.0006062462,0.0008028857,0.0005368429,0.0022934135,0.000025230876,0.00024674647,4.228197e-7,0.065331586,0.15593751,0.76723653,0.0048988294,0.0020837628],"about_ca_topic_score_codex":0.000022201926,"about_ca_topic_score_gemma":0.000018882401,"teacher_disagreement_score":0.77354306,"about_ca_system_score_codex":0.0005892214,"about_ca_system_score_gemma":0.00034441,"threshold_uncertainty_score":0.9996697},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015687562,0.00018962842,0.9951089,0.000241503,0.0009775354,0.00026566567,0.000019266869,0.00013184885,0.0014968801],"genre_scores_gemma":[0.89692396,0.00010691852,0.102128044,0.0003895304,0.00018150736,0.000005585865,0.000017429884,0.000025428748,0.00022159667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963222,0.000037282018,0.00070361176,0.0013208194,0.0010553263,0.00056076056],"domain_scores_gemma":[0.99754,0.00012622336,0.0004719497,0.0013124844,0.00038636333,0.00016300721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042169125,0.0005117802,0.0006002813,0.0007129146,0.00016751587,0.00030930075,0.0031130086,0.00037638983,0.000044614535],"category_scores_gemma":[0.000029573584,0.0004769856,0.00013301957,0.000555751,0.0004732232,0.0010986994,0.0008406853,0.0007202584,0.000025528572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075575986,0.000036396395,0.00004689068,0.000113829585,0.000020136673,0.00006677352,0.0017228615,0.10682498,0.0038385033,0.12375227,0.0000038052933,0.763566],"study_design_scores_gemma":[0.000120855824,0.00009006985,0.000047750756,0.0002545253,0.000005941056,0.00005030591,3.4482714e-8,0.7572877,0.0010256036,0.24071151,0.000011409083,0.00039432457],"about_ca_topic_score_codex":0.00001874509,"about_ca_topic_score_gemma":0.000008694078,"teacher_disagreement_score":0.8953552,"about_ca_system_score_codex":0.00013763651,"about_ca_system_score_gemma":0.00035902782,"threshold_uncertainty_score":0.9997682},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082215935,0.00064254116,0.9152925,0.0054430347,0.0008270054,0.00047256256,0.0000024509234,0.00038558964,0.076852076],"genre_scores_gemma":[0.33093163,0.0007767494,0.6576183,0.0012846336,0.0015065768,0.000025037516,0.000029209179,0.000063651445,0.007764198],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974802,0.00010944568,0.00034753734,0.00069134036,0.0008071255,0.00056432287],"domain_scores_gemma":[0.9979178,0.0008040246,0.00025101658,0.0006496889,0.00021348271,0.00016404534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011503181,0.00028683696,0.00032885303,0.0007490441,0.0007109966,0.00017150276,0.0017019116,0.0005951496,0.00045710764],"category_scores_gemma":[0.0006863407,0.0002869893,0.00008538774,0.00046587217,0.002063615,0.00019204062,0.00039950627,0.0015495465,0.00016439831],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034515492,0.000013688677,0.000048584512,0.00000493086,0.0000043310265,0.0000045271518,0.0072360164,0.021009866,0.000027450586,0.008127919,0.000012437528,0.9635068],"study_design_scores_gemma":[0.00051828113,0.00010405794,0.000111193905,0.00033536335,0.000018129256,0.000011336252,0.000020342803,0.44359806,0.00022227148,0.09361722,0.46049407,0.00094965124],"about_ca_topic_score_codex":0.00036236175,"about_ca_topic_score_gemma":0.005684095,"teacher_disagreement_score":0.96255714,"about_ca_system_score_codex":0.00036713824,"about_ca_system_score_gemma":0.00068102835,"threshold_uncertainty_score":0.9999582},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036695874,0.00018461404,0.9964047,0.00039110627,0.0010861695,0.00069054426,0.000006002405,0.000058421505,0.001141753],"genre_scores_gemma":[0.05678611,0.000030176187,0.94062066,0.0019130509,0.00017879556,0.000019013913,0.000020136345,0.000032167813,0.00039991146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690926,0.00002485407,0.00052558683,0.0012745598,0.00068468816,0.0005810624],"domain_scores_gemma":[0.99853504,0.00035137747,0.00025535814,0.00067232054,0.000063245425,0.00012268964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009520282,0.00040562204,0.00035897948,0.00087668607,0.00015167205,0.00022997567,0.0013503844,0.00023184462,0.000014024987],"category_scores_gemma":[0.000066137014,0.0003957377,0.00009419111,0.00040916048,0.00034778967,0.0008586549,0.0004286136,0.000504579,0.000012163653],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000967255,0.000022611255,0.00014196998,0.0000219402,0.0000027560716,0.000027822103,0.00044728714,0.014432248,0.0005044596,0.0028082132,0.000006519585,0.9815745],"study_design_scores_gemma":[0.0011152057,0.000066452456,0.00063074264,0.00045250685,0.000005773242,0.000043273227,0.0000017813637,0.89326423,0.0024746004,0.09940222,0.0017674769,0.00077572017],"about_ca_topic_score_codex":0.000009881698,"about_ca_topic_score_gemma":0.00006265604,"teacher_disagreement_score":0.9807988,"about_ca_system_score_codex":0.00053422136,"about_ca_system_score_gemma":0.00015129431,"threshold_uncertainty_score":0.99984944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008582881,0.00060968066,0.99067956,0.00083049765,0.000817934,0.0002205187,0.000024285222,0.00025229063,0.006479394],"genre_scores_gemma":[0.1370938,0.00016625224,0.8504716,0.002173615,0.0021475782,0.0000058821265,0.00030981313,0.00015967705,0.007471789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99466604,0.00003766652,0.0007893446,0.0024490962,0.0010969078,0.00096092955],"domain_scores_gemma":[0.99525994,0.00047100108,0.0005295302,0.003314409,0.00019019835,0.00023491844],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011060874,0.00069007504,0.00076164375,0.0008523394,0.0004952378,0.0010687803,0.007312672,0.00040015928,0.00020480076],"category_scores_gemma":[0.00009470613,0.0006275199,0.00016252429,0.0010630911,0.00053897896,0.0015936226,0.0051332875,0.0010557896,0.00028205142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002896898,0.000021984359,0.0000212175,0.000011792945,0.000039738392,0.00006400962,0.00026048045,0.10078857,0.00006231959,0.0043364866,0.00011958499,0.8942709],"study_design_scores_gemma":[0.00018402461,0.000072091716,0.00002772995,0.00042396729,0.000028972165,0.00009154871,3.2647634e-7,0.9813437,0.0001236281,0.014004791,0.00297029,0.0007289376],"about_ca_topic_score_codex":0.000047731748,"about_ca_topic_score_gemma":0.000097370714,"teacher_disagreement_score":0.893542,"about_ca_system_score_codex":0.00036091867,"about_ca_system_score_gemma":0.0004898413,"threshold_uncertainty_score":0.99996823},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017309605,0.00037851982,0.99446326,0.00025531568,0.002110573,0.0011047331,0.000023527531,0.00012487477,0.001366104],"genre_scores_gemma":[0.064723514,0.0000318898,0.93434924,0.00029133196,0.0002823752,0.00005734883,0.000009981253,0.000035296005,0.00021899963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995971,0.00007043902,0.0010362242,0.0013226216,0.0010344776,0.00056523585],"domain_scores_gemma":[0.9957557,0.0007378,0.00085208693,0.001790925,0.0007234411,0.0001400544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022632945,0.00044468773,0.00060686376,0.000943384,0.00016619169,0.0003087383,0.0032059245,0.00031770932,0.0000035617247],"category_scores_gemma":[0.0003520625,0.00041951006,0.00016143463,0.00075869943,0.00060528057,0.00038284183,0.0005402089,0.00046398735,0.000019198447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017858478,0.00004768204,0.000010369365,0.00014198555,0.000010124603,0.0000024522349,0.00077349704,0.47365564,0.00051921094,0.09845073,0.000013586852,0.42635685],"study_design_scores_gemma":[0.00025681686,0.00023420856,0.00009766679,0.00029295092,0.000008382479,0.000016911938,1.8826907e-7,0.9764835,0.0028856108,0.013246891,0.006038455,0.00043839967],"about_ca_topic_score_codex":0.0000123366335,"about_ca_topic_score_gemma":0.000007774302,"teacher_disagreement_score":0.5028279,"about_ca_system_score_codex":0.00042968598,"about_ca_system_score_gemma":0.00061519555,"threshold_uncertainty_score":0.99982566},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025489422,0.00060210493,0.9900592,0.0006053211,0.0047820723,0.0014112497,0.00036481602,0.0004996024,0.0016501427],"genre_scores_gemma":[0.65324056,0.000012152873,0.33805218,0.0021005974,0.0037815957,0.00017475615,0.0007508254,0.00019038667,0.0016969236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940929,0.000044627523,0.001076434,0.0022783934,0.0012488365,0.0012588552],"domain_scores_gemma":[0.99525887,0.0009196997,0.0006843758,0.0019914713,0.00088843115,0.00025717606],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013753334,0.0009147794,0.0010559664,0.00069697824,0.00047075094,0.0016264068,0.0053131385,0.0005779557,0.0000028152483],"category_scores_gemma":[0.00009612618,0.00085837254,0.0002785199,0.0012512836,0.0002749221,0.0005104866,0.0011930921,0.00071487366,0.000047357214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013235257,0.00008753956,0.000021742893,0.0003869609,0.000042542546,0.000048653477,0.00025585847,0.940576,0.00021786615,0.027525935,0.0010944372,0.029729182],"study_design_scores_gemma":[0.00073624885,0.00016725686,0.00006300271,0.0008723929,0.00001880889,0.00020895428,2.1159548e-7,0.9658657,0.00009612893,0.010580722,0.020331787,0.0010587907],"about_ca_topic_score_codex":0.00035922075,"about_ca_topic_score_gemma":0.00011681549,"teacher_disagreement_score":0.6532151,"about_ca_system_score_codex":0.000545568,"about_ca_system_score_gemma":0.0009505485,"threshold_uncertainty_score":0.99941},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000268289,0.0003722215,0.9954156,0.0005765656,0.0010384776,0.00042303436,0.0000013819332,0.0005415968,0.0013628025],"genre_scores_gemma":[0.37978405,0.00020031424,0.61621755,0.0027634187,0.00062759704,0.000014487283,0.00002829007,0.00005789868,0.00030637864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654776,0.00007631721,0.0005384371,0.0016528799,0.0006386099,0.000545971],"domain_scores_gemma":[0.99781483,0.00039388452,0.00037007718,0.00092684256,0.00030058387,0.00019379226],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000729538,0.0006070313,0.000540823,0.0008282141,0.00043819603,0.0013754086,0.001619023,0.000354168,0.000007488181],"category_scores_gemma":[0.000049534978,0.00054388103,0.0000783057,0.0006270298,0.0005629458,0.0012447885,0.0010181289,0.0007520491,0.000005098932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010973361,0.000015328596,0.000043455457,0.0000101282085,0.000013186979,0.00003670115,0.00031112615,0.74334633,0.000023799304,0.002379978,0.00009126652,0.25371772],"study_design_scores_gemma":[0.00033808348,0.00036376988,0.000052994405,0.0004008111,0.000010053209,0.00017644948,4.473841e-7,0.99369454,0.00022580948,0.0038438851,0.00023669272,0.00065648864],"about_ca_topic_score_codex":0.000036067922,"about_ca_topic_score_gemma":0.000113298614,"teacher_disagreement_score":0.37951577,"about_ca_system_score_codex":0.00025799236,"about_ca_system_score_gemma":0.000219267,"threshold_uncertainty_score":0.99970126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003320927,0.00037129235,0.9973442,0.00048062182,0.00021615779,0.000492857,0.000006863446,0.00015565964,0.00089912175],"genre_scores_gemma":[0.20597957,0.000016279986,0.7894067,0.004164383,0.00018574145,0.000023988092,0.0000040328364,0.000034128687,0.00018519006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968929,0.000033886266,0.0003346338,0.0014204348,0.0007116988,0.00060639234],"domain_scores_gemma":[0.99742496,0.00096000684,0.00021299814,0.0009961474,0.00018382314,0.00022204919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086062367,0.0004852553,0.00041598696,0.0005952335,0.00033611958,0.00062482414,0.0018732017,0.00024308449,0.000018304694],"category_scores_gemma":[0.000026909423,0.0003964235,0.00005427852,0.0005365667,0.00069971744,0.00039866456,0.00037348177,0.000542995,0.00001963757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012560211,0.000035474226,0.00017137568,0.000033482534,0.000015110681,0.000102957194,0.00044666952,0.007313285,0.00026966655,0.0222705,0.000056984634,0.96927196],"study_design_scores_gemma":[0.0008497799,0.0003780175,0.00028658114,0.00084050844,0.000022810362,0.00014626274,5.723203e-7,0.9670289,0.0032031476,0.018848704,0.0071107657,0.0012839237],"about_ca_topic_score_codex":0.00004414103,"about_ca_topic_score_gemma":0.00009130546,"teacher_disagreement_score":0.967988,"about_ca_system_score_codex":0.00016169001,"about_ca_system_score_gemma":0.00051580166,"threshold_uncertainty_score":0.9998488},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024654513,0.00022394411,0.9928822,0.002034407,0.0005555572,0.0004081753,0.000007341925,0.0002785072,0.003363316],"genre_scores_gemma":[0.1531088,0.00002763971,0.8454037,0.0005859346,0.0005126751,0.00001152686,0.0000051053853,0.00005131527,0.0002933067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540913,0.00006224023,0.0005683567,0.0014010072,0.0018013286,0.00075794914],"domain_scores_gemma":[0.9961443,0.0017560319,0.00022064506,0.0013582852,0.0002966969,0.00022404252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013718999,0.0004961576,0.00057358586,0.001122039,0.0001502254,0.00030988318,0.002593622,0.00036515575,0.0000344486],"category_scores_gemma":[0.0010435258,0.00047384313,0.00016587363,0.0008386266,0.0006359733,0.0004810962,0.00089575007,0.0016332519,0.00003223109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000180138,0.000049102975,0.000010845436,0.00016290628,0.00002376193,0.0003192486,0.0019749221,0.12873964,0.0003602783,0.018259106,0.000018667144,0.8500635],"study_design_scores_gemma":[0.0008783797,0.00072878983,0.00048518067,0.0017077973,0.000030287863,0.0010726379,7.860436e-7,0.81642914,0.008505804,0.16325642,0.0052208854,0.0016839061],"about_ca_topic_score_codex":0.00003402039,"about_ca_topic_score_gemma":0.000034163884,"teacher_disagreement_score":0.8483796,"about_ca_system_score_codex":0.000331671,"about_ca_system_score_gemma":0.0008780517,"threshold_uncertainty_score":0.9997713},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034104852,0.0015854149,0.99361634,0.00026346243,0.0020373352,0.0007148695,0.000012528195,0.0013477013,0.000081307626],"genre_scores_gemma":[0.04166533,0.0001361981,0.9568968,0.0008529871,0.00031594903,0.000019639434,0.000006525874,0.00009145795,0.000015121498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928265,0.00010027725,0.0011205078,0.0027069182,0.0019369954,0.0013087571],"domain_scores_gemma":[0.9905084,0.006296579,0.0006129797,0.0021288684,0.00026143066,0.0001917574],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012657335,0.0011359036,0.0012087731,0.0010538219,0.0007128859,0.0005145813,0.0059667397,0.0006358515,0.000010176097],"category_scores_gemma":[0.0022112252,0.0010136202,0.00028151128,0.0014704629,0.0008525643,0.0011593915,0.002269527,0.0019458309,0.000019970288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061675073,0.000016717766,0.000024742534,0.000039417955,0.0000069943912,0.00013941972,0.001447419,0.4821317,0.000043521526,0.00018710601,0.000012312127,0.5159445],"study_design_scores_gemma":[0.0009803779,0.00029350413,0.0019815941,0.0039800797,0.000016591885,0.0013042778,9.848475e-7,0.772808,0.00093231484,0.21397983,0.0014305492,0.002291885],"about_ca_topic_score_codex":0.0000024074782,"about_ca_topic_score_gemma":0.00002060121,"teacher_disagreement_score":0.5136526,"about_ca_system_score_codex":0.00055762485,"about_ca_system_score_gemma":0.0006241801,"threshold_uncertainty_score":0.99941146},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017260637,0.001503443,0.978281,0.00042255686,0.0015912558,0.0004995794,0.0000069001194,0.00018093933,0.00025367888],"genre_scores_gemma":[0.15295047,0.00009536375,0.84447914,0.0018137109,0.00057867053,0.0000070171454,0.0000034380869,0.000034020344,0.00003814589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965166,0.00003252603,0.00047406298,0.0016056047,0.00058057654,0.0007906234],"domain_scores_gemma":[0.99761105,0.0007776812,0.00032472753,0.0009249236,0.00020083657,0.00016080793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004977469,0.00055988214,0.0006317826,0.00059600663,0.0005933111,0.00062202645,0.0022673223,0.00070099917,0.0000030444542],"category_scores_gemma":[0.00010267642,0.00048732985,0.00013762391,0.00035251648,0.00054811285,0.0004102336,0.0013423461,0.0010349929,0.0000023258442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022561393,0.00003297561,0.00051619555,0.00025224936,0.000038553986,0.00013284714,0.0046249395,0.061289057,0.0006510971,0.0060220417,0.000014682492,0.9264028],"study_design_scores_gemma":[0.00037708197,0.00014641945,0.00012775733,0.0005631955,0.000014076463,0.00042503348,0.000001092099,0.9278696,0.00053988816,0.06782133,0.0014501312,0.0006643616],"about_ca_topic_score_codex":0.000049167793,"about_ca_topic_score_gemma":0.00017416035,"teacher_disagreement_score":0.92573845,"about_ca_system_score_codex":0.00012326169,"about_ca_system_score_gemma":0.00030933274,"threshold_uncertainty_score":0.9997578},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019026603,0.0000840935,0.98512423,0.00021501446,0.00067201536,0.0003600544,0.000004316132,0.000253259,0.013096738],"genre_scores_gemma":[0.700293,0.000015613801,0.29648712,0.0012556764,0.0008202403,0.000027269472,0.000015542786,0.000057365934,0.0010281678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967066,0.00003593808,0.0003945297,0.0014274496,0.0008649883,0.0005704858],"domain_scores_gemma":[0.9983445,0.00021262995,0.00032305543,0.00066473085,0.00032707612,0.0001280218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029391935,0.0005137963,0.00042741126,0.0008528894,0.00032401824,0.0006254248,0.0013605431,0.00028675818,0.000028349716],"category_scores_gemma":[0.0000115785615,0.00043772632,0.00010326103,0.00069285237,0.0003900068,0.0009734072,0.00030836696,0.0007815587,0.00008660663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022439424,0.00009246604,0.000104742736,0.000028650007,0.00003210291,0.00016112307,0.0004109708,0.037243705,0.00009350564,0.028248152,0.00013429843,0.9334279],"study_design_scores_gemma":[0.00084743294,0.0013047367,0.00058005826,0.00076548796,0.000035831177,0.0005170359,4.7134634e-7,0.7080867,0.005296704,0.27922946,0.0015893785,0.0017466669],"about_ca_topic_score_codex":0.00003449765,"about_ca_topic_score_gemma":0.00018131896,"teacher_disagreement_score":0.93168116,"about_ca_system_score_codex":0.00030817298,"about_ca_system_score_gemma":0.00042877605,"threshold_uncertainty_score":0.9998075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010425433,0.0009234168,0.9948355,0.00023498485,0.0011665992,0.000251892,0.0000030502983,0.00022569399,0.0022546276],"genre_scores_gemma":[0.024241587,0.0000073340198,0.9736492,0.0017075205,0.00014856989,0.000007009417,0.0000023533923,0.00004344966,0.00019294395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963339,0.00003417696,0.00044399625,0.0015660492,0.0008597519,0.000762154],"domain_scores_gemma":[0.99788046,0.00041316773,0.00022065335,0.0011240983,0.000115197276,0.00024643427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008308982,0.00058024074,0.0005482941,0.00089283125,0.0002801711,0.00051584287,0.0020161222,0.00032987937,0.0000025023348],"category_scores_gemma":[0.00007263495,0.000577098,0.00008483723,0.000432995,0.0004996154,0.00048052918,0.0005446424,0.0009083429,0.000008023004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016138403,0.000010110415,0.000051441264,0.00003476806,0.0000051975603,0.000116205,0.0006095825,0.91356426,0.00008277672,0.0012545827,0.000014565088,0.084254906],"study_design_scores_gemma":[0.00025906521,0.00009564391,0.000073764655,0.00056032516,0.0000061011756,0.00007609064,1.579506e-7,0.9834433,0.0003348383,0.014383624,0.00013550416,0.00063158374],"about_ca_topic_score_codex":0.0000064534065,"about_ca_topic_score_gemma":0.0000016376331,"teacher_disagreement_score":0.08362332,"about_ca_system_score_codex":0.00024411391,"about_ca_system_score_gemma":0.0005347769,"threshold_uncertainty_score":0.99966806},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000104321916,0.00034111826,0.9856749,0.00043409006,0.002066642,0.0008286671,0.000040049912,0.00024334944,0.010266841],"genre_scores_gemma":[0.091672,0.000037997754,0.9046962,0.0014135273,0.001121148,0.00004004734,0.000013809428,0.000076456854,0.0009287903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99413466,0.0000515422,0.0006681957,0.0027154393,0.0011459297,0.001284199],"domain_scores_gemma":[0.99629694,0.0008933864,0.00050229416,0.0012333161,0.0006947459,0.00037934037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011142436,0.00087885524,0.0009398698,0.00085234665,0.00059182366,0.0008655427,0.0031358646,0.00053730817,0.000048280694],"category_scores_gemma":[0.00058961916,0.0007990982,0.00024666364,0.00074234215,0.00085166685,0.0006770717,0.0014998777,0.0011585321,0.00007572062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033318913,0.00006853007,0.0001167439,0.00008158203,0.000051393585,0.00016160002,0.0033475836,0.006942942,0.000063693944,0.8085432,0.00013864673,0.18045075],"study_design_scores_gemma":[0.0008295597,0.0004800885,0.00013398753,0.000926905,0.000025607056,0.0001544982,9.983908e-7,0.43965986,0.002597287,0.551843,0.0022645365,0.0010836655],"about_ca_topic_score_codex":0.000171241,"about_ca_topic_score_gemma":0.000164441,"teacher_disagreement_score":0.43271694,"about_ca_system_score_codex":0.0008929724,"about_ca_system_score_gemma":0.0018286124,"threshold_uncertainty_score":0.999446},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003418574,0.0133061325,0.9816955,0.00003341395,0.0036047918,0.0003937084,0.000016100492,0.0002724652,0.00033606373],"genre_scores_gemma":[0.11425764,0.00053543714,0.88377225,0.00014535594,0.0009519015,0.000035673304,0.00004440994,0.00009207633,0.00016527591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790365,0.00005609672,0.0005101385,0.0006876525,0.00041456992,0.00042788067],"domain_scores_gemma":[0.9987705,0.0003595241,0.0001229527,0.00044074887,0.00013489393,0.00017140417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006969166,0.00043187648,0.0005804313,0.00039115583,0.00013044017,0.00028929653,0.0004629597,0.00037489418,0.000015036254],"category_scores_gemma":[0.00011891682,0.00041273335,0.00005359454,0.00021047199,0.0002283495,0.00013729709,0.0001748066,0.0004988248,0.000026203685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023840053,0.00000520587,0.0000066692883,0.00008473652,0.000023485418,0.00001758035,0.00032273732,0.9719368,0.00009384752,0.00046510407,0.0000022814352,0.027039167],"study_design_scores_gemma":[0.00026270992,0.00003282519,0.00000579146,0.0004876501,0.000015015186,0.000083227555,0.0000031942932,0.9972776,0.00056838815,0.00019935836,0.0006439733,0.00042025145],"about_ca_topic_score_codex":0.000027432754,"about_ca_topic_score_gemma":0.0000030223239,"teacher_disagreement_score":0.113915786,"about_ca_system_score_codex":0.0002824005,"about_ca_system_score_gemma":0.000077302844,"threshold_uncertainty_score":0.99983245},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016470327,0.0012639298,0.99349785,0.00013426079,0.0020329824,0.00024833548,5.6936e-7,0.00020082283,0.0009742327],"genre_scores_gemma":[0.23358499,0.0001490504,0.76210076,0.0017157231,0.002250941,0.0000031089637,0.0000010189269,0.00004357831,0.00015085694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677277,0.000047089063,0.0004959195,0.0013275637,0.00060254923,0.00075411395],"domain_scores_gemma":[0.9983452,0.00025695874,0.00030893087,0.00080490106,0.00012513775,0.000158882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094102713,0.00048362688,0.00048142124,0.0005208362,0.0007140176,0.0009968657,0.0013960819,0.00034872934,0.0000085193715],"category_scores_gemma":[0.00004081846,0.00048067118,0.00009249214,0.00065377384,0.00031741743,0.0008419293,0.0015317453,0.00088261167,0.0000058240025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046365485,0.0000047416434,0.000019768026,0.000018819734,0.000004722812,0.000036707992,0.0004987423,0.13721615,0.0000693313,0.001239537,0.0000033650474,0.8608835],"study_design_scores_gemma":[0.00013491344,0.00016216285,0.00007745918,0.0005479795,0.0000072209327,0.00026915435,2.5074104e-7,0.9237021,0.0003303429,0.07306205,0.0011612935,0.0005450609],"about_ca_topic_score_codex":0.000019608635,"about_ca_topic_score_gemma":0.00045622373,"teacher_disagreement_score":0.8603384,"about_ca_system_score_codex":0.0002143146,"about_ca_system_score_gemma":0.00015520163,"threshold_uncertainty_score":0.9997645},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01242379,0.0021668756,0.90436643,0.00078023615,0.0029925704,0.0005331646,0.000007974311,0.00016624651,0.07656268],"genre_scores_gemma":[0.9858441,0.00016236556,0.003807833,0.0044032633,0.0016832083,0.000008227906,0.0000032640394,0.0000399429,0.0040478474],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982316,0.0000032716346,0.00022867275,0.0007788061,0.00042306172,0.0003345812],"domain_scores_gemma":[0.99905455,0.000087617474,0.00028199414,0.00046487508,0.00009344526,0.00001749809],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025668816,0.00031410804,0.00026965127,0.00025061562,0.00019843325,0.00035906545,0.00069327746,0.00014961275,0.00024175744],"category_scores_gemma":[0.000036149195,0.0002683726,0.000046438345,0.00026471366,0.00053763157,0.000846426,0.0005405038,0.0003392353,0.00010698093],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006458676,0.00009686182,0.010872886,0.0005092952,0.000008285811,0.00048446978,0.0011510216,0.004515845,0.00040522544,0.075230554,0.0023513378,0.90430963],"study_design_scores_gemma":[0.0014181985,0.000091813105,0.01784316,0.0022267639,0.000051886218,0.000051504332,0.000001988457,0.104767114,0.0011126169,0.5938925,0.27553686,0.003005578],"about_ca_topic_score_codex":0.00002593849,"about_ca_topic_score_gemma":0.000010626607,"teacher_disagreement_score":0.97342026,"about_ca_system_score_codex":0.000036561218,"about_ca_system_score_gemma":0.000034183817,"threshold_uncertainty_score":0.9999769},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027830895,0.018832998,0.9488929,0.00061158295,0.0006274762,0.0015418828,0.00011899267,0.000047770158,0.0014955149],"genre_scores_gemma":[0.88987774,0.00009772245,0.109282434,0.00037794607,0.0002233708,0.0000137916,0.000026032467,0.000023424276,0.00007753724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858993,0.000008416179,0.0003562406,0.0005397949,0.00027128618,0.00023434097],"domain_scores_gemma":[0.99900025,0.00019505866,0.00013087752,0.00030497293,0.00026790003,0.000100946076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023546921,0.00022483864,0.0005425873,0.00026525982,0.0000917969,0.000046098976,0.00011876971,0.00006859831,0.000002713923],"category_scores_gemma":[0.00013953904,0.0002076675,0.0007724434,0.00009026956,0.00018860592,0.00008818063,0.0001266557,0.00014434398,6.577148e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018296449,0.00018882412,0.04229816,0.0019819064,0.00050652673,0.000043950935,0.00088255457,0.027457599,0.0022558875,0.001084758,0.00004577548,0.9230711],"study_design_scores_gemma":[0.0061741257,0.0026630596,0.059854604,0.04164939,0.0033356934,0.00015404567,0.000014014254,0.7884199,0.0041159745,0.09104966,0.0003532165,0.002216284],"about_ca_topic_score_codex":0.000020619984,"about_ca_topic_score_gemma":0.0000051064635,"teacher_disagreement_score":0.9208548,"about_ca_system_score_codex":0.000105534644,"about_ca_system_score_gemma":0.00023631245,"threshold_uncertainty_score":0.8468435},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003995008,0.0014876656,0.99013954,0.0007940105,0.000910915,0.0006501454,0.000015744708,0.00038470275,0.0052177454],"genre_scores_gemma":[0.5429763,0.0004911191,0.45024702,0.0026806777,0.00062635675,0.000040277806,0.000018937,0.00015900619,0.0027602895],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943678,0.000106090796,0.00062061934,0.0024045082,0.0013452747,0.0011557158],"domain_scores_gemma":[0.995258,0.0014675704,0.000311286,0.0020135797,0.00051650056,0.00043306238],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009851923,0.0007678641,0.00080389524,0.00148245,0.0004840588,0.00085180014,0.0041005276,0.0004483589,0.00012539247],"category_scores_gemma":[0.0003665082,0.0007265493,0.00012926283,0.0014090581,0.0025524322,0.0008821285,0.002288049,0.0014523126,0.0000845875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022832253,0.00006916266,0.00008458587,0.00007647723,0.000035149398,0.0006649992,0.0007826813,0.002584991,0.00069693895,0.43689147,0.00006589394,0.5580248],"study_design_scores_gemma":[0.0007493191,0.00039880033,0.00017662457,0.00037733617,0.000010486349,0.0004031383,2.2733565e-7,0.3220294,0.0018338651,0.6704558,0.0023586338,0.0012063638],"about_ca_topic_score_codex":0.000017005766,"about_ca_topic_score_gemma":0.000046522844,"teacher_disagreement_score":0.5568185,"about_ca_system_score_codex":0.00025775234,"about_ca_system_score_gemma":0.00030390342,"threshold_uncertainty_score":0.9995186},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09647675,0.0001044101,0.9019952,0.000106256004,0.00031498645,0.0008901836,0.0000035640542,0.000029336406,0.000079314814],"genre_scores_gemma":[0.93268037,0.0000022733395,0.067058735,0.00016099404,0.000058860973,0.00001753797,6.540035e-7,0.000015661912,0.000004920274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961268,0.000062220075,0.00059420365,0.0010925605,0.0016442045,0.0004800659],"domain_scores_gemma":[0.9967465,0.00026573625,0.00048640283,0.001521932,0.0008582125,0.00012121599],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016007025,0.00042928744,0.0005859289,0.0012451366,0.00057013,0.0005858021,0.0019616983,0.00010120911,0.000025599418],"category_scores_gemma":[0.000025168996,0.0002807801,0.00016035106,0.00209578,0.0004352716,0.00046799573,0.0007895673,0.00045911432,0.0000016568662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028629715,0.0008417565,0.0014332708,0.00009039989,0.0019840144,0.0027406977,0.10708387,0.75399965,0.00034602016,0.0063405265,0.00002604518,0.12508512],"study_design_scores_gemma":[0.000626514,0.00068299245,0.00021813065,0.00011879627,0.00032521432,0.0006366225,0.0001593806,0.99187964,0.00015746357,0.004467458,0.000029563742,0.00069824664],"about_ca_topic_score_codex":0.001973618,"about_ca_topic_score_gemma":0.008723598,"teacher_disagreement_score":0.83620363,"about_ca_system_score_codex":0.00020831237,"about_ca_system_score_gemma":0.00037814476,"threshold_uncertainty_score":0.9999644},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018836126,0.00034649117,0.9880902,0.0026500216,0.0016528552,0.00064158475,0.00004646491,0.00037681323,0.004311916],"genre_scores_gemma":[0.60920376,0.00011910027,0.37871462,0.01082626,0.0008067217,0.000018220855,0.00017529934,0.00008316334,0.00005284085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994863,0.000039403,0.0007740943,0.002165714,0.0012653416,0.0008924956],"domain_scores_gemma":[0.9956302,0.00023023173,0.0002865612,0.0032625808,0.00026675052,0.0003236538],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008936976,0.00077859516,0.0006464851,0.0015099884,0.00036892464,0.0011768134,0.010839396,0.00032259218,0.00002342352],"category_scores_gemma":[0.000012167538,0.00067129615,0.00010896083,0.0011371712,0.00019565142,0.0021970752,0.0034981114,0.00092827925,0.00021242845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020766656,0.00006402686,0.00006819119,0.0007312558,0.000048772454,0.00011501295,0.01649574,0.091580726,0.00086314033,0.0637276,0.000005116716,0.82627964],"study_design_scores_gemma":[0.0005585964,0.00023673386,0.00019433939,0.0031174838,0.00003279269,0.00010501539,0.000004211773,0.79120857,0.0020868282,0.19546457,0.005558458,0.0014324236],"about_ca_topic_score_codex":0.00039564114,"about_ca_topic_score_gemma":0.0041948683,"teacher_disagreement_score":0.8248472,"about_ca_system_score_codex":0.00025172715,"about_ca_system_score_gemma":0.0007654224,"threshold_uncertainty_score":0.99986005},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011254933,0.0006360287,0.99733174,0.00024716379,0.0004513961,0.00041205785,0.00009800639,0.00003290479,0.00067818345],"genre_scores_gemma":[0.14844236,0.00007917614,0.8500676,0.0010392044,0.00015207335,0.000007715933,0.00011008636,0.000025964573,0.00007582009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961211,0.00010540726,0.0005977136,0.0015136342,0.0011774446,0.0004846623],"domain_scores_gemma":[0.9941887,0.00075243384,0.000335819,0.0044153687,0.00022930244,0.00007836139],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021924055,0.00040946176,0.00050287606,0.0005348577,0.00013158149,0.0004566899,0.01417005,0.00024253422,0.000015094004],"category_scores_gemma":[0.0001343471,0.00026302363,0.000047187918,0.00074367045,0.0005570783,0.0013609902,0.0054675937,0.00079167093,0.000010907855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005064536,0.00004629496,0.00013601047,0.000041269046,0.000007188891,0.000026581361,0.0009098084,0.08597558,0.000030642677,0.024369871,0.00040564663,0.888046],"study_design_scores_gemma":[0.00012467908,0.000045068842,0.0021717953,0.00013619455,0.0000023004388,0.000014443309,9.937263e-8,0.86555564,0.00003257494,0.13148999,0.00015280845,0.00027441845],"about_ca_topic_score_codex":0.0007945919,"about_ca_topic_score_gemma":0.0006670136,"teacher_disagreement_score":0.8877716,"about_ca_system_score_codex":0.00006130311,"about_ca_system_score_gemma":0.00058918376,"threshold_uncertainty_score":0.9999822},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003269599,0.00020899525,0.992474,0.0041195625,0.0011365998,0.0006423694,0.000011144557,0.000133552,0.00094677287],"genre_scores_gemma":[0.2720101,0.000016501113,0.7213228,0.005176082,0.0010912705,0.00010452673,0.000048488728,0.00004479137,0.00018546658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625236,0.000062982035,0.00041191137,0.0013534416,0.0014430498,0.0004762324],"domain_scores_gemma":[0.9965544,0.00047620657,0.00025807586,0.0020868285,0.00047251474,0.00015197026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017816445,0.00040805343,0.00027890372,0.0003580325,0.0007744157,0.0005687305,0.004078169,0.00032726716,0.0000622834],"category_scores_gemma":[0.000038291317,0.00030344454,0.00011359173,0.0006678208,0.0009646817,0.00066186406,0.00048046073,0.0010244487,0.00004438173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037006612,0.00013205367,0.000016970238,0.000014030809,0.000010625645,0.0000066837983,0.0005225622,0.13368222,0.0013734646,0.09814116,0.000042712814,0.7660538],"study_design_scores_gemma":[0.00021399207,0.0000695677,0.0006555868,0.000050466664,0.000011093231,0.000025986565,3.2639267e-7,0.7836522,0.00066867156,0.21237302,0.0019248028,0.00035427522],"about_ca_topic_score_codex":0.000035266166,"about_ca_topic_score_gemma":0.00028265265,"teacher_disagreement_score":0.7656995,"about_ca_system_score_codex":0.00022779408,"about_ca_system_score_gemma":0.0014311767,"threshold_uncertainty_score":0.99994177},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032071017,0.0009727133,0.99216205,0.00015385791,0.0015180744,0.000685588,0.0000019120796,0.00020055335,0.0010981775],"genre_scores_gemma":[0.8039815,0.000045643945,0.19053222,0.0046166265,0.00061503774,0.00001988188,0.000007772681,0.000097999226,0.00008333715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99351066,0.00005652674,0.00082514196,0.0024596185,0.001709451,0.0014386144],"domain_scores_gemma":[0.9957763,0.0014902849,0.0004575609,0.0017887581,0.00025110086,0.00023602904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016916026,0.00089659775,0.00085342187,0.0010771373,0.0002965444,0.00045537387,0.0037561131,0.00062544254,0.00001820638],"category_scores_gemma":[0.000031634903,0.0007648149,0.00014247015,0.0014291067,0.0008039917,0.00051937875,0.0014672936,0.0023008557,0.00003019239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005672748,0.00003609838,0.00012851189,0.0000092311375,0.000009595964,0.00053444464,0.00013647114,0.5555591,0.0000053097633,0.013666604,0.000009161235,0.42984873],"study_design_scores_gemma":[0.0006645648,0.0004479939,0.00041238655,0.0017372951,0.000006409863,0.00014185635,1.0317618e-7,0.97304595,0.00004694491,0.022484606,0.00010932419,0.00090255146],"about_ca_topic_score_codex":0.00004913355,"about_ca_topic_score_gemma":0.0023255015,"teacher_disagreement_score":0.8016298,"about_ca_system_score_codex":0.0006001427,"about_ca_system_score_gemma":0.00058635155,"threshold_uncertainty_score":0.9996201},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003566342,0.00030839947,0.9890214,0.00048464007,0.001300868,0.00039675733,0.000008079969,0.0002938581,0.007829318],"genre_scores_gemma":[0.83802664,0.000018750043,0.15856634,0.0013473344,0.001091768,0.000014909006,0.000023926403,0.000062689214,0.0008476164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952117,0.00007371267,0.0007404168,0.0018583762,0.0010669184,0.0010488733],"domain_scores_gemma":[0.99811614,0.00024824162,0.00031354095,0.00096555025,0.00016430664,0.00019219574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015607562,0.0005889453,0.0006503028,0.0011007033,0.00027398192,0.0006297358,0.0033534695,0.00047280532,0.00001883957],"category_scores_gemma":[0.00005287745,0.00058014924,0.00015425397,0.0014766216,0.00027495102,0.0004672261,0.0011064071,0.0012155246,0.000079256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014345598,0.0001462353,0.0007227903,0.00012560535,0.000015540676,0.00022624597,0.0044799014,0.8057071,0.00008974016,0.055070233,0.00018197882,0.1332203],"study_design_scores_gemma":[0.00097279844,0.000282234,0.00085736724,0.0014570542,0.000006507386,0.00020945237,8.5022583e-7,0.82321566,0.0003228866,0.15357439,0.017815145,0.0012856573],"about_ca_topic_score_codex":0.00006759684,"about_ca_topic_score_gemma":0.0003434165,"teacher_disagreement_score":0.83767,"about_ca_system_score_codex":0.00081317424,"about_ca_system_score_gemma":0.0007990457,"threshold_uncertainty_score":0.999665},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012883424,0.0002756026,0.9878026,0.0015071386,0.0005953885,0.00027191977,0.0000041085805,0.000042438915,0.008212435],"genre_scores_gemma":[0.9661043,0.000020034908,0.032067787,0.0014882106,0.00016088753,0.0000078536605,0.0000010592056,0.000015142034,0.00013466585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974816,0.00008138544,0.00041397923,0.0007956324,0.0008117182,0.00041568032],"domain_scores_gemma":[0.9976482,0.000646359,0.0002717654,0.0012527327,0.00012271668,0.000058276113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010212525,0.0003170034,0.00030072228,0.00030145605,0.0001921321,0.00020804451,0.003252475,0.000214882,0.00002191487],"category_scores_gemma":[0.00013873406,0.00019602523,0.00009940858,0.00053895306,0.00058244215,0.00023998175,0.00076843076,0.000993464,0.000014471105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056268505,0.00002844992,0.00010593646,0.000008776957,0.0000051250404,0.000008612082,0.0007988462,0.05035933,0.0002434427,0.5002514,0.0000215724,0.44816285],"study_design_scores_gemma":[0.00009353305,0.000064570544,0.00037295098,0.0006499162,0.0000029778985,0.00001890843,3.4500903e-7,0.60319453,0.0021575275,0.39299637,0.0002054619,0.00024291674],"about_ca_topic_score_codex":0.00005024365,"about_ca_topic_score_gemma":0.00014759655,"teacher_disagreement_score":0.96481603,"about_ca_system_score_codex":0.0001820014,"about_ca_system_score_gemma":0.00040249783,"threshold_uncertainty_score":0.79936767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016537053,0.00014439893,0.9838718,0.0018572358,0.0023583034,0.0006869612,0.000005960103,0.00018195799,0.010728],"genre_scores_gemma":[0.079191454,0.000019414187,0.9120511,0.00820335,0.0003039889,0.000035428457,0.000013467778,0.000031566484,0.0001502443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99500436,0.00015945829,0.0007646486,0.0020627086,0.0010301669,0.0009786732],"domain_scores_gemma":[0.99677896,0.00079243013,0.0003088652,0.001602244,0.00023761646,0.0002798959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031437108,0.0006012117,0.0007120731,0.0014613786,0.00017492553,0.0004215724,0.0033382166,0.00041955104,0.000039419287],"category_scores_gemma":[0.00006860595,0.00054287503,0.00013146778,0.0013968303,0.0002684508,0.00043913594,0.0008920094,0.0011240415,0.000058692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001385558,0.00014196141,0.00067957357,0.0000488197,0.000007091862,0.00013491695,0.0011791715,0.035592694,0.000029393064,0.03605579,0.00016280654,0.9259539],"study_design_scores_gemma":[0.0009782973,0.0011447686,0.0030975887,0.00051856827,0.00001724546,0.00011356364,0.0000019942083,0.82585084,0.00025219953,0.12048605,0.0455882,0.0019506903],"about_ca_topic_score_codex":0.000065419365,"about_ca_topic_score_gemma":0.0006853216,"teacher_disagreement_score":0.92400324,"about_ca_system_score_codex":0.001100163,"about_ca_system_score_gemma":0.003884721,"threshold_uncertainty_score":0.9997023},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021435064,0.000073584524,0.9949534,0.00023040887,0.00081423746,0.0008889855,0.000010360117,0.0003776675,0.00050788105],"genre_scores_gemma":[0.45813802,0.00001887793,0.5404794,0.0005640736,0.0001680928,0.000024346025,0.0000559428,0.000051597883,0.0004996216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995024,0.00013351541,0.0009965274,0.0015796841,0.0017267573,0.0005394787],"domain_scores_gemma":[0.99605,0.00018542095,0.0010735622,0.0014090015,0.0011182748,0.00016376268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012443705,0.0006643637,0.00094106374,0.0023834123,0.00027535248,0.00041302328,0.0015779303,0.00038878573,0.00005891741],"category_scores_gemma":[0.00005810397,0.0006065142,0.00024171759,0.0021394645,0.00049439503,0.0010765413,0.00065136026,0.00075407024,0.0000069415837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012344497,0.00033333027,0.00029451493,0.000048602044,0.00031090248,0.000024536317,0.0017374387,0.5722415,0.011865479,0.0019671884,0.0000119036295,0.41104117],"study_design_scores_gemma":[0.0004203894,0.000416479,0.001424798,0.00020166638,0.00012627798,0.000035305595,0.0000010492918,0.96396476,0.030384261,0.002372677,0.000040521063,0.0006117963],"about_ca_topic_score_codex":0.00029962696,"about_ca_topic_score_gemma":0.00089920417,"teacher_disagreement_score":0.45599452,"about_ca_system_score_codex":0.0009740469,"about_ca_system_score_gemma":0.00051360746,"threshold_uncertainty_score":0.9996386},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023203644,0.0013542848,0.98553026,0.0013247458,0.0024151658,0.0002516916,0.0000019308477,0.0003233536,0.008566515],"genre_scores_gemma":[0.26939636,0.00020437627,0.72145915,0.005481935,0.0016429593,0.000011283744,0.0000052597998,0.000050043647,0.0017486227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961379,0.000032830645,0.00050662586,0.0015723936,0.0010108455,0.00073941494],"domain_scores_gemma":[0.9973174,0.00052171113,0.00023420133,0.0015790523,0.00018354192,0.00016414773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061904994,0.00053116115,0.0005714091,0.0006300029,0.00022772767,0.0004212396,0.0038902853,0.0004061101,0.000048915474],"category_scores_gemma":[0.000108941706,0.00045603098,0.0001491285,0.00038726532,0.0013303395,0.000748521,0.0015451985,0.0007462448,0.00015700079],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036855756,0.000022079239,0.00005155278,0.000010405293,0.0000071129525,0.00013688793,0.0011350255,0.005858831,0.0001331408,0.11764115,0.00010897487,0.87489116],"study_design_scores_gemma":[0.0012163615,0.0007175974,0.001059446,0.0012212092,0.000027956541,0.00052068586,0.0000030294232,0.50794744,0.008363871,0.42836475,0.047118492,0.003439151],"about_ca_topic_score_codex":0.00002762837,"about_ca_topic_score_gemma":0.00011573918,"teacher_disagreement_score":0.871452,"about_ca_system_score_codex":0.0002444594,"about_ca_system_score_gemma":0.0006343907,"threshold_uncertainty_score":0.9997891},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011588314,0.00043455526,0.99603856,0.00052118086,0.00091323495,0.00062124134,0.000021951777,0.00013114777,0.00015928563],"genre_scores_gemma":[0.3102903,0.00006915833,0.6870397,0.0021781628,0.00019993488,0.000009378531,0.000004963391,0.00003536877,0.00017303515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676657,0.000029159772,0.0005077329,0.0014308072,0.0006098235,0.00065588113],"domain_scores_gemma":[0.9947585,0.0032715425,0.00019906428,0.0012816627,0.00029600502,0.00019321748],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001102838,0.00048988854,0.0005511251,0.0005572093,0.00027923324,0.0009148382,0.0020371566,0.0003634013,0.000002725509],"category_scores_gemma":[0.00018792808,0.00045518976,0.00011772886,0.00029359435,0.00077553693,0.0012226058,0.0010271281,0.00055492506,0.0000066178345],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005196089,0.00009806222,0.00025633245,0.0002271498,0.00003367822,0.00024595024,0.0024453439,0.0452805,0.00010821284,0.13360196,0.00013315155,0.8175177],"study_design_scores_gemma":[0.00020510405,0.00025951315,0.00003578784,0.00022690961,0.000011632469,0.0001527682,1.6165349e-7,0.7626685,0.00080269814,0.23324496,0.0018660898,0.00052587024],"about_ca_topic_score_codex":0.000055706212,"about_ca_topic_score_gemma":0.00027861842,"teacher_disagreement_score":0.8169918,"about_ca_system_score_codex":0.00016168249,"about_ca_system_score_gemma":0.00022822399,"threshold_uncertainty_score":0.99979},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009885726,0.00032452674,0.9916814,0.0012835171,0.002067908,0.00055063725,0.0000066418183,0.00025916338,0.0038163175],"genre_scores_gemma":[0.28110728,0.000036627174,0.7157973,0.0021249864,0.00054584024,0.00002771878,0.0000067131677,0.000052261144,0.0003012939],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956137,0.000023887085,0.00059553474,0.001932393,0.0008813187,0.00095318933],"domain_scores_gemma":[0.99729675,0.00044374587,0.00030515523,0.00135146,0.00034613485,0.00025676913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009391591,0.0006378227,0.00061956834,0.0007728513,0.00042536692,0.00077823,0.0038285407,0.0004918513,0.000016186503],"category_scores_gemma":[0.000101884376,0.000607939,0.00024095584,0.0005089438,0.00066835666,0.0006215015,0.0007474808,0.0008874592,0.000026326414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010919445,0.00002083471,0.000007466596,0.00006193361,0.000015251445,0.00004455696,0.0007295638,0.051762342,0.0001028008,0.31328106,0.000024490064,0.6339388],"study_design_scores_gemma":[0.00029795963,0.00016570342,0.0000066397865,0.00045169648,0.000007626079,0.00002773795,1.1995388e-7,0.4445766,0.0005544619,0.55298,0.00038820688,0.000543267],"about_ca_topic_score_codex":0.000023895393,"about_ca_topic_score_gemma":0.000034461726,"teacher_disagreement_score":0.6333955,"about_ca_system_score_codex":0.00054670416,"about_ca_system_score_gemma":0.0014458748,"threshold_uncertainty_score":0.9996372},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50849015,0.0019140866,0.4748556,0.0006014652,0.0022447347,0.004048764,0.000013488907,0.00034323175,0.007488478],"genre_scores_gemma":[0.98948693,0.0000091008815,0.009746987,0.00030357274,0.00023658056,0.00003626949,0.00001621262,0.00005758365,0.00010676351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971196,0.000011473008,0.0006380549,0.0009749828,0.0007105116,0.0005453528],"domain_scores_gemma":[0.99843615,0.00015329453,0.0004807374,0.00054121524,0.00036233646,0.00002626028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051474274,0.0005426439,0.0006231383,0.0019361004,0.00017533496,0.0002165347,0.00074314815,0.00019828945,0.000083152685],"category_scores_gemma":[0.00004656202,0.00050076575,0.000117742726,0.0007898518,0.0004860454,0.0007202562,0.0006081087,0.00050459214,0.0000347136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038598497,0.00015976476,0.25929826,0.00025894662,0.000017261054,0.0000813194,0.00020426948,0.05353613,0.00017117304,0.00015115994,0.0000021040257,0.686081],"study_design_scores_gemma":[0.0022625166,0.00007630816,0.19963476,0.0035388186,0.00032938257,0.0000074616873,0.000004004095,0.7871436,0.00008094625,0.00005821623,0.005168838,0.001695158],"about_ca_topic_score_codex":0.00015316332,"about_ca_topic_score_gemma":0.0034095624,"teacher_disagreement_score":0.7336075,"about_ca_system_score_codex":0.0003482745,"about_ca_system_score_gemma":0.00017081627,"threshold_uncertainty_score":0.9997444},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040208516,0.00006090693,0.9962353,0.00057011994,0.0003184278,0.0009792765,0.000020913314,0.00014648579,0.0012664885],"genre_scores_gemma":[0.10832477,0.000047427377,0.8900845,0.0012227836,0.00015855696,0.00003457079,0.000050295956,0.00002227406,0.000054795764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971441,0.000008543614,0.0008589267,0.0004984821,0.0009931171,0.0004968058],"domain_scores_gemma":[0.9973073,0.00027110244,0.00074967754,0.00083371805,0.00071513694,0.00012309151],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000727917,0.00044027073,0.00044591178,0.0011104746,0.0002553888,0.0006730698,0.0017632577,0.00031004555,0.000013761753],"category_scores_gemma":[0.0001024057,0.00036289243,0.00009343756,0.00059699814,0.00042745908,0.0051080375,0.00043694006,0.0004656516,0.000016416765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028576384,0.00001163383,0.000013264355,0.00005591423,0.000012651798,0.0000010257738,0.0036508236,0.8224903,0.0000111147865,0.029214961,0.00001946514,0.14449027],"study_design_scores_gemma":[0.00044420385,0.0004901823,0.00004284619,0.0003798741,0.000009203209,0.000037581525,0.0000013303767,0.9844336,0.0022473012,0.0108681135,0.00058997207,0.00045580542],"about_ca_topic_score_codex":0.000015533105,"about_ca_topic_score_gemma":0.000024759574,"teacher_disagreement_score":0.16194329,"about_ca_system_score_codex":0.0003046968,"about_ca_system_score_gemma":0.0007822324,"threshold_uncertainty_score":0.9998823},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005239519,0.00017648698,0.9833462,0.0006631769,0.00029149753,0.010664282,0.0000015703304,0.00016244645,0.0046419273],"genre_scores_gemma":[0.28005257,0.00005895925,0.7132201,0.0021621534,0.00038305763,0.003275767,0.00000589194,0.00007161067,0.00076983584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738455,0.00002866607,0.0004935174,0.0010721831,0.0005294423,0.00049167237],"domain_scores_gemma":[0.9979441,0.00016025123,0.00026713902,0.0012667772,0.00020674962,0.00015497326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079885754,0.00040116603,0.00043793145,0.00035740517,0.00035788104,0.0003463491,0.0018580949,0.00028894926,0.00003532475],"category_scores_gemma":[0.0000146748325,0.00037700182,0.00007607728,0.000382336,0.0004928863,0.0006727256,0.00023388723,0.0007057788,0.000011967258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017758251,0.000038894406,0.00006592117,0.00007045143,0.000013411764,0.00004233181,0.00043995638,0.16028513,0.00008944957,0.07440224,0.000011984561,0.76452243],"study_design_scores_gemma":[0.0009597947,0.00014004803,0.000059421644,0.0011003481,0.000013708885,0.00010586434,1.3447728e-7,0.82546496,0.00034741813,0.16558611,0.0055339457,0.0006882212],"about_ca_topic_score_codex":0.00007865184,"about_ca_topic_score_gemma":0.0000783549,"teacher_disagreement_score":0.76383424,"about_ca_system_score_codex":0.0002527349,"about_ca_system_score_gemma":0.0008244144,"threshold_uncertainty_score":0.9998682},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009047805,0.0017339153,0.99373215,0.000024510928,0.0025730804,0.00043629078,0.0000030586007,0.000091831986,0.0013146809],"genre_scores_gemma":[0.91848636,0.0012604918,0.078274034,0.0006117828,0.0005423946,0.000044567336,0.000008650319,0.00019043831,0.000581312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978447,0.000026983775,0.0004946419,0.0006549868,0.00045655156,0.00052216335],"domain_scores_gemma":[0.9990139,0.0001661393,0.00006129159,0.00059571705,0.000060347404,0.000102619706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058835244,0.000424641,0.00043399303,0.000595971,0.0000466727,0.00018429152,0.0008253939,0.00027915157,0.000051930772],"category_scores_gemma":[0.00002110723,0.00039617016,0.000057611294,0.00024433527,0.0001410103,0.00011348581,0.00010943664,0.0006942646,0.000051383537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010586162,0.0000057733937,0.00004660428,0.00006921617,0.0000050476337,0.00007336058,0.0002582025,0.8879788,0.000039432947,0.00059148675,0.000013246381,0.110917784],"study_design_scores_gemma":[0.000063776,0.00005674755,0.000022296615,0.0007908253,0.000004353775,0.000049414837,3.7231243e-7,0.9874566,0.0033464138,0.006304144,0.0012931522,0.000611858],"about_ca_topic_score_codex":0.00003846374,"about_ca_topic_score_gemma":0.00006175406,"teacher_disagreement_score":0.9183959,"about_ca_system_score_codex":0.00038537796,"about_ca_system_score_gemma":0.00006859534,"threshold_uncertainty_score":0.999849},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013814779,0.00047559786,0.9949104,0.0013561681,0.00059761066,0.00031372765,0.000006717095,0.00022227183,0.0019793443],"genre_scores_gemma":[0.14980093,0.00018356563,0.8456711,0.0025638097,0.00027909482,0.00001684181,0.00005748521,0.000049842733,0.0013773387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961548,0.000067869274,0.00058092794,0.0017512852,0.00077947415,0.0006656334],"domain_scores_gemma":[0.99802303,0.00028830694,0.00033975733,0.001056382,0.00015673123,0.00013577928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010284155,0.00048821364,0.00044547697,0.0008918422,0.00026977752,0.0005629831,0.0023749592,0.00036542476,0.00001187329],"category_scores_gemma":[0.00016651199,0.00048444147,0.000073481104,0.0011271796,0.00026502472,0.00081262505,0.00043372114,0.0013405593,0.000032465367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056984736,0.000065532506,0.0003391428,0.000019168248,0.0000035992884,0.00001196801,0.0003844771,0.038193457,0.00063372904,0.00937715,0.000042455264,0.9509236],"study_design_scores_gemma":[0.0005156035,0.00012640656,0.0017965699,0.000303576,0.000003534448,0.000032392203,1.8112227e-7,0.95112246,0.00031281187,0.017217932,0.027852092,0.0007164113],"about_ca_topic_score_codex":0.00008397364,"about_ca_topic_score_gemma":0.0006027391,"teacher_disagreement_score":0.95020723,"about_ca_system_score_codex":0.00053465413,"about_ca_system_score_gemma":0.000383937,"threshold_uncertainty_score":0.99976075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024685913,0.0006353905,0.99660975,0.00005418371,0.00046282512,0.0007724227,0.000010975245,0.00008363273,0.0013461536],"genre_scores_gemma":[0.05184546,0.00004238686,0.9477182,0.00013545014,0.00017433548,0.00004002588,0.000010269767,0.000016578215,0.000017263157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753076,0.000006777963,0.0005346712,0.0008907773,0.0006491808,0.00038783823],"domain_scores_gemma":[0.997685,0.0009554673,0.00030716092,0.00075949973,0.00021759665,0.00007528172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000865442,0.0003035252,0.00037724708,0.0005107426,0.0001397402,0.00021499628,0.0020777748,0.00024216539,0.0000031268505],"category_scores_gemma":[0.00007020037,0.00026478103,0.00010241143,0.0005032345,0.00017352439,0.00040381213,0.00040799504,0.00028270183,0.0000031645898],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039622246,0.00001784954,0.000006832799,0.00005679911,0.0000047943004,7.2886866e-7,0.00018179748,0.032744966,0.00011451192,0.019995399,0.00001675017,0.9468556],"study_design_scores_gemma":[0.00017609006,0.00011114414,0.00002484611,0.0002992709,0.000006111828,0.000007396175,9.129762e-8,0.8236841,0.001349466,0.17126384,0.0027304292,0.0003472425],"about_ca_topic_score_codex":0.000006641575,"about_ca_topic_score_gemma":0.000007671698,"teacher_disagreement_score":0.94650835,"about_ca_system_score_codex":0.00011127904,"about_ca_system_score_gemma":0.00013483818,"threshold_uncertainty_score":0.99998045},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009404688,0.00012282183,0.9958939,0.00066668075,0.0008948553,0.0013049691,0.000006129979,0.00017597694,0.00092529046],"genre_scores_gemma":[0.2964372,0.000012959575,0.70204127,0.000939221,0.00021336736,0.00004533547,0.0000080176105,0.00003447997,0.00026815612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968753,0.000027999522,0.0005481566,0.0011585503,0.0008549399,0.0005350682],"domain_scores_gemma":[0.9978002,0.0004772738,0.00020910507,0.0009778915,0.00036653818,0.00016903969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090089027,0.00039671102,0.0005439423,0.00074716675,0.00025702862,0.0005378814,0.0017643555,0.0001864276,0.000029414148],"category_scores_gemma":[0.00010598922,0.00036017742,0.00016204362,0.0003406019,0.00056965475,0.00048637058,0.0005051937,0.0004556467,0.000047272646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006778858,0.000027942036,0.0000063546527,0.0030093007,0.000021987102,0.000059116654,0.0005425278,0.45210162,0.00003440618,0.20600522,0.0000115834055,0.33817318],"study_design_scores_gemma":[0.0003638083,0.00011243807,0.0000080206655,0.0036952626,0.00000848299,0.0001422996,2.397216e-7,0.8901899,0.0009414568,0.104059204,0.00003979853,0.0004390793],"about_ca_topic_score_codex":0.000010658003,"about_ca_topic_score_gemma":0.000023246508,"teacher_disagreement_score":0.4380883,"about_ca_system_score_codex":0.0006006969,"about_ca_system_score_gemma":0.0011042281,"threshold_uncertainty_score":0.999885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009421419,0.00014280649,0.9965457,0.00020969627,0.002179857,0.00039743446,0.000012662959,0.000358842,0.000058800568],"genre_scores_gemma":[0.009968634,0.000014988367,0.9890662,0.0003676908,0.00017517782,0.000022889999,0.000007505217,0.00003851017,0.00033843907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971216,0.000025633972,0.000377866,0.0014299396,0.0005267408,0.0005182201],"domain_scores_gemma":[0.99772245,0.00057662843,0.00016823648,0.0010264836,0.00034213375,0.00016409547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001077913,0.0004915644,0.00043951083,0.00050103274,0.00019834057,0.0003519836,0.0019391846,0.00038587314,0.000004309294],"category_scores_gemma":[0.00050225086,0.00043813357,0.000070816124,0.00024144229,0.0005702471,0.0010766782,0.0010492443,0.0008828989,0.0000024398673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000132612895,0.0000129969385,0.0000053361496,0.000027665805,0.000008580007,0.000004253432,0.0003922938,0.5896321,0.0011993365,0.010064397,0.0000067071633,0.3986331],"study_design_scores_gemma":[0.0001921449,0.00013425383,0.000026489377,0.000091831585,0.0000046544465,0.00002167404,1.2537224e-7,0.751521,0.0026511562,0.24435724,0.0005915898,0.00040786795],"about_ca_topic_score_codex":0.000005408914,"about_ca_topic_score_gemma":0.00003729755,"teacher_disagreement_score":0.39822522,"about_ca_system_score_codex":0.0001935667,"about_ca_system_score_gemma":0.0004220653,"threshold_uncertainty_score":0.99980706},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006345972,0.0002781812,0.98768556,0.00027905352,0.0005679167,0.00051409664,0.000008341848,0.00014242066,0.009889861],"genre_scores_gemma":[0.4345772,0.000063893436,0.56165326,0.0016472943,0.00039691027,0.000039307568,0.000018110595,0.00012752086,0.0014765357],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947813,0.000066836576,0.0004973783,0.0019251676,0.0015578587,0.0011714263],"domain_scores_gemma":[0.9969736,0.00072098797,0.00025307387,0.0016057463,0.00024204033,0.00020456863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096427894,0.0006240724,0.0006084114,0.0019053327,0.0002438892,0.0004626704,0.0039813076,0.0002811351,0.000014066144],"category_scores_gemma":[0.00007464642,0.0005342684,0.00011396747,0.0016002737,0.0013854316,0.0009325547,0.0008093213,0.0012540931,0.00005605418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019096669,0.00021340608,0.0073347827,0.00019229819,0.000050994462,0.0030845783,0.001526144,0.27685356,0.00097551825,0.22119986,0.0002556352,0.48812225],"study_design_scores_gemma":[0.0014102635,0.0007585036,0.0017579203,0.0013340197,0.000008646454,0.0001889467,5.663648e-7,0.20781958,0.001394036,0.7803315,0.0030498477,0.0019461635],"about_ca_topic_score_codex":0.00010468533,"about_ca_topic_score_gemma":0.0005008531,"teacher_disagreement_score":0.5591316,"about_ca_system_score_codex":0.00039567068,"about_ca_system_score_gemma":0.0005064799,"threshold_uncertainty_score":0.99971086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016392782,0.00040915393,0.9900702,0.0015844546,0.0035946777,0.0006831743,0.000014978818,0.00039238817,0.0030870012],"genre_scores_gemma":[0.0303348,0.00005291446,0.96586406,0.001016051,0.0011777196,0.000023025226,0.0000027128779,0.00008251264,0.0014462296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99283135,0.000064546526,0.0008952453,0.0026417917,0.0021846378,0.0013824205],"domain_scores_gemma":[0.9934067,0.00093358534,0.0003141649,0.0042561693,0.0006631035,0.00042626963],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0014169486,0.00089643925,0.0008276491,0.0013016502,0.0004797455,0.0011358846,0.011760163,0.0008416707,0.000071701455],"category_scores_gemma":[0.0003422065,0.0008261125,0.00028161102,0.0009958057,0.0022496295,0.0010172526,0.0046395455,0.0027424821,0.00030819906],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049168243,0.000047019927,0.000026469386,0.000016356487,0.0000133093345,0.00019572373,0.0015927169,0.007681895,0.0005807186,0.004675182,0.00003680641,0.9851289],"study_design_scores_gemma":[0.00020328154,0.00021743617,0.0000638477,0.00024960292,0.000009131506,0.00011118184,8.3220004e-7,0.82707435,0.020844026,0.14816388,0.0020349661,0.0010274767],"about_ca_topic_score_codex":0.0002946041,"about_ca_topic_score_gemma":0.001202635,"teacher_disagreement_score":0.9841014,"about_ca_system_score_codex":0.00038619406,"about_ca_system_score_gemma":0.00096033537,"threshold_uncertainty_score":0.99990106},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027865037,0.0002912114,0.97021085,0.00012000703,0.000579128,0.0004883171,0.000005227162,0.00036521058,0.00007503602],"genre_scores_gemma":[0.6701359,0.000012736233,0.32953256,0.00009868646,0.00014161505,0.00001373227,0.000007404644,0.000024256044,0.000033080763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686766,0.000032337735,0.0006148948,0.001339006,0.0006944987,0.00045163403],"domain_scores_gemma":[0.9980302,0.00006558301,0.000586317,0.0008375153,0.0003052313,0.00017518514],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00045915405,0.00046619488,0.00045230976,0.00078222534,0.001392756,0.0004224536,0.001261162,0.0005038587,0.000005641864],"category_scores_gemma":[0.00002204878,0.00046775446,0.000091533475,0.0007145664,0.0006023329,0.0006309339,0.0023355116,0.0010130961,0.000002244514],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008229185,0.00007378222,0.0014495677,0.000038205657,0.000004722214,0.000017155895,0.0009273463,0.0043403176,0.011478982,0.0012128403,0.0000015961439,0.98044723],"study_design_scores_gemma":[0.00019666279,0.00022632067,0.000708251,0.00019560575,0.000018671404,0.00013555527,5.402266e-7,0.96201634,0.023969157,0.010275457,0.0015958892,0.0006615307],"about_ca_topic_score_codex":0.00025893017,"about_ca_topic_score_gemma":0.0005504368,"teacher_disagreement_score":0.97978574,"about_ca_system_score_codex":0.00040677635,"about_ca_system_score_gemma":0.00035878184,"threshold_uncertainty_score":0.9999073},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026963272,0.00069215766,0.99170715,0.00059436075,0.0011353255,0.0004002947,0.0000015060426,0.00016832135,0.002604541],"genre_scores_gemma":[0.8932721,0.00005029191,0.10418682,0.0006591371,0.0006259203,0.00001331143,0.0000026953026,0.000052242325,0.0011374811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948076,0.00007068102,0.00081141386,0.0017845832,0.0014167388,0.0011089562],"domain_scores_gemma":[0.9967671,0.0009975274,0.00054122455,0.001152591,0.00033245247,0.00020911373],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015919821,0.0007488184,0.00071719184,0.0003974253,0.00088429626,0.0019763391,0.004674237,0.00032182093,0.00002626428],"category_scores_gemma":[0.00006647478,0.00047604265,0.00025673636,0.000560979,0.0007798537,0.0005807916,0.00092760945,0.0012970273,0.000054243264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006039695,0.00002115661,0.000008559236,0.000023506402,0.000042990567,0.000074129646,0.0020214054,0.14736263,0.000011830137,0.09291975,0.000050806237,0.7574572],"study_design_scores_gemma":[0.0002429119,0.00015876106,0.000028959654,0.0005400603,0.000019711664,0.00008495052,0.0000044094195,0.99524164,0.00007493497,0.0010944353,0.001803503,0.0007057395],"about_ca_topic_score_codex":0.000027148471,"about_ca_topic_score_gemma":0.00032412697,"teacher_disagreement_score":0.89057577,"about_ca_system_score_codex":0.00030444926,"about_ca_system_score_gemma":0.0004848037,"threshold_uncertainty_score":0.99976915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015091748,0.0019689167,0.98808885,0.0009917712,0.0015505787,0.00050520175,0.0000028597867,0.00017548168,0.0052071474],"genre_scores_gemma":[0.77364606,0.00015123827,0.22330712,0.0009914696,0.0014395912,0.000015334152,0.0000016621511,0.00006200353,0.000385532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99414456,0.00010198732,0.0009453935,0.0018640364,0.0015273904,0.0014166067],"domain_scores_gemma":[0.9962368,0.0010454959,0.00029259743,0.0018570352,0.000283939,0.00028414573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024891314,0.0006637646,0.00074164994,0.0013619649,0.00023419909,0.0007163406,0.005253303,0.0004500033,0.00004530403],"category_scores_gemma":[0.00024627612,0.00063713867,0.00018549646,0.0011800902,0.0008661428,0.0013982789,0.0025787975,0.0016626228,0.00021577098],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004341353,0.000023035609,0.0006859436,0.000032256692,0.000005130688,0.00011281919,0.0025524718,0.02505987,0.00013026953,0.019821666,0.000005928741,0.9515663],"study_design_scores_gemma":[0.00014392388,0.000118677934,0.0014682695,0.0011139718,0.0000073631422,0.000086861866,0.00000275179,0.889973,0.0038776437,0.10108945,0.00083580846,0.001282283],"about_ca_topic_score_codex":0.00017540329,"about_ca_topic_score_gemma":0.00026588087,"teacher_disagreement_score":0.950284,"about_ca_system_score_codex":0.0006643886,"about_ca_system_score_gemma":0.00043641892,"threshold_uncertainty_score":0.999608},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010519633,0.0003318279,0.9946882,0.00065033225,0.0012465859,0.00050568825,0.00001089155,0.00013450891,0.0013800036],"genre_scores_gemma":[0.37565693,0.000039148068,0.623084,0.0006074995,0.00034547216,0.00002233805,0.000012746747,0.00003462326,0.00019722598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627453,0.000027352084,0.0006461257,0.0014815326,0.00083825877,0.000732225],"domain_scores_gemma":[0.9980299,0.00021541184,0.00021419035,0.0012043884,0.00016076086,0.0001753719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000761383,0.0005541903,0.00059812376,0.0014345053,0.00025455188,0.0003731919,0.0017458182,0.00019243963,0.000017756107],"category_scores_gemma":[0.00014381982,0.00048431908,0.00008543693,0.0008538998,0.0003438215,0.0013926947,0.0013254434,0.00077888096,0.000039411992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009945239,0.000024905534,0.000100226636,0.00011186321,0.0000062565264,0.00017314417,0.007181141,0.12547608,0.0005364338,0.31027552,0.0000070024425,0.55609745],"study_design_scores_gemma":[0.0010054414,0.0006279532,0.00077382004,0.010692643,0.00001346158,0.0002962466,0.000010474501,0.51105094,0.015814425,0.4504712,0.0061037196,0.0031396663],"about_ca_topic_score_codex":0.00037680456,"about_ca_topic_score_gemma":0.0026297434,"teacher_disagreement_score":0.55295783,"about_ca_system_score_codex":0.0006231455,"about_ca_system_score_gemma":0.0005060804,"threshold_uncertainty_score":0.99976087},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048719975,0.002084703,0.98991776,0.0015867321,0.00069442706,0.00018460289,0.000028198594,0.000080269936,0.0005513366],"genre_scores_gemma":[0.36215237,0.0028800587,0.613022,0.0029359702,0.0009794511,0.0000023972016,0.00007074495,0.000089966234,0.01786699],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973474,0.000046364625,0.0003229663,0.0011712606,0.000679543,0.0004324347],"domain_scores_gemma":[0.99751717,0.0003028273,0.00032516767,0.0014833367,0.0002268793,0.00014459217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000950467,0.00036181492,0.00049789995,0.00042479817,0.0004713333,0.00026759392,0.0033287867,0.00033388333,0.000059842107],"category_scores_gemma":[0.000058204518,0.0002901039,0.00013705174,0.00046629537,0.0014223631,0.0005535211,0.0022607471,0.0008790357,0.000024392357],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018556273,0.00003817794,0.00039980304,0.000072229814,0.00005941216,0.00012227838,0.0061458535,0.0011282914,0.0018180443,0.0015277802,0.00021590128,0.9884537],"study_design_scores_gemma":[0.002616063,0.00084443484,0.004953764,0.0015210647,0.0003506823,0.0004208308,0.000005131542,0.5553601,0.01676685,0.044846755,0.36853403,0.0037803338],"about_ca_topic_score_codex":0.0001662847,"about_ca_topic_score_gemma":0.0013000651,"teacher_disagreement_score":0.9846733,"about_ca_system_score_codex":0.000085407264,"about_ca_system_score_gemma":0.00023937246,"threshold_uncertainty_score":0.9999551},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000098005905,0.00080605,0.9955174,0.0006039181,0.00066396425,0.00041399268,0.000011326859,0.00042249737,0.0014629014],"genre_scores_gemma":[0.43779793,0.000014241589,0.5612987,0.0002097925,0.00036567976,0.000016209737,0.000017715896,0.000030150044,0.00024953438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964893,0.00003682833,0.00053859473,0.0014273886,0.0008895164,0.0006183872],"domain_scores_gemma":[0.9978258,0.00044314365,0.0003440389,0.0009454586,0.00026477737,0.00017679772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005301248,0.000496308,0.0004419954,0.00063204335,0.00069700956,0.00044854474,0.002537288,0.0002430811,0.00001775329],"category_scores_gemma":[0.000042023457,0.0004686135,0.00014899693,0.00073380186,0.00047840772,0.00027395829,0.0008351684,0.0008905502,0.00005768943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040424957,0.000062473475,0.0005709056,0.00012272663,0.000015599666,0.000097979704,0.00034478298,0.7093677,0.00034490382,0.14815754,0.000005294307,0.14090605],"study_design_scores_gemma":[0.0003521542,0.00009203978,0.0002545614,0.00045269768,0.0000067674855,0.000045358818,2.218871e-7,0.98585516,0.0009223134,0.009847143,0.0016522026,0.00051936996],"about_ca_topic_score_codex":0.000048932772,"about_ca_topic_score_gemma":0.00006367575,"teacher_disagreement_score":0.4376999,"about_ca_system_score_codex":0.00068269816,"about_ca_system_score_gemma":0.0006793426,"threshold_uncertainty_score":0.99977654},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034211492,0.0004512247,0.9946006,0.0015413968,0.001017742,0.0010287397,0.000018389177,0.00022834797,0.0007714697],"genre_scores_gemma":[0.08506737,0.000019298279,0.91140544,0.002429893,0.00089537876,0.00006756687,0.000008201224,0.000029884524,0.00007694637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996643,0.00006384341,0.00051718915,0.0016089706,0.0007323128,0.00043469603],"domain_scores_gemma":[0.997008,0.00018006546,0.00019581537,0.0021863962,0.00015179651,0.0002779139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013853885,0.0004059139,0.00040786449,0.0003694616,0.00026506258,0.00037807538,0.003675182,0.00022127372,0.0000056604704],"category_scores_gemma":[0.00003118961,0.00032274096,0.00006208945,0.0006216414,0.00019503586,0.00060404657,0.00058440224,0.00042105123,0.0000947434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004431754,0.000011520314,0.000012755118,0.000027675442,0.0000042780334,0.000004287071,0.0022719838,0.026131893,0.0001523177,0.051758427,0.0000076946835,0.91961277],"study_design_scores_gemma":[0.00014178756,0.00022637985,0.0014726885,0.00040528557,0.0000175557,0.000047302983,0.0000014943658,0.94755894,0.0013873479,0.017177397,0.030783704,0.000780115],"about_ca_topic_score_codex":0.00016779486,"about_ca_topic_score_gemma":0.00027830954,"teacher_disagreement_score":0.9214271,"about_ca_system_score_codex":0.00038831262,"about_ca_system_score_gemma":0.00022188741,"threshold_uncertainty_score":0.99992245},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036894,0.0011799092,0.9917281,0.00039194367,0.0022669174,0.00028967575,0.0000011217488,0.00021286527,0.0038925405],"genre_scores_gemma":[0.007730678,0.00034888953,0.9900425,0.0011557274,0.00032971287,0.000005561266,0.0000014872782,0.000027269803,0.0003581686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963653,0.0000421709,0.0005362336,0.0015227352,0.0009739156,0.00055964437],"domain_scores_gemma":[0.99767023,0.00035774833,0.00034155088,0.0011894624,0.0002892235,0.00015179664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077191094,0.0004404425,0.00046021186,0.00070209254,0.00040229113,0.00029326085,0.0020928432,0.00017807462,0.000030167048],"category_scores_gemma":[0.00020693317,0.00040788137,0.00012949681,0.0005621124,0.0006209399,0.0011291531,0.0010177896,0.0008052549,0.00009113949],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012464898,0.0000069248144,0.000012527557,0.000012131946,0.000002616245,0.000031279214,0.00027602358,0.008245143,0.00016403847,0.0008164262,0.000008752067,0.9904229],"study_design_scores_gemma":[0.00024303874,0.00009949988,0.000054027565,0.000652889,0.0000031611003,0.00050673145,8.722023e-8,0.9545195,0.00085797976,0.04063006,0.0019000946,0.0005329318],"about_ca_topic_score_codex":0.0000066287653,"about_ca_topic_score_gemma":0.000007749974,"teacher_disagreement_score":0.98989,"about_ca_system_score_codex":0.0002995197,"about_ca_system_score_gemma":0.00048404137,"threshold_uncertainty_score":0.9998373},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090856175,0.003204552,0.9923266,0.00016436285,0.00088967406,0.00023837193,7.539555e-7,0.000114659146,0.0021524678],"genre_scores_gemma":[0.67479205,0.00085532427,0.3236491,0.00034545892,0.0002367879,0.000012230249,0.0000031633065,0.000030010595,0.00007586025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735796,0.0000141708715,0.0003975729,0.0011232882,0.0006865934,0.0004204296],"domain_scores_gemma":[0.99899006,0.00014730755,0.00016650364,0.00046443494,0.0001288896,0.00010281885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037479145,0.0003315679,0.0003305889,0.0008824474,0.00014250645,0.0004225459,0.0009538314,0.00017649,7.0579557e-7],"category_scores_gemma":[0.0001051908,0.00031485816,0.000037607235,0.0006025921,0.00041681435,0.0027154903,0.00051989924,0.00048243182,0.000005195587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020916198,0.00000702824,0.00003257249,0.000025865453,6.407734e-7,0.00002980909,0.0004477394,0.05450994,0.000011039043,0.0007914162,6.195519e-7,0.9441412],"study_design_scores_gemma":[0.00014322076,0.00006423253,0.0000308095,0.00044645945,0.0000014034614,0.000107036954,1.8953752e-7,0.93106425,0.00024060842,0.06724968,0.0003146644,0.0003374592],"about_ca_topic_score_codex":0.000012212509,"about_ca_topic_score_gemma":0.00016940509,"teacher_disagreement_score":0.9438038,"about_ca_system_score_codex":0.00021746207,"about_ca_system_score_gemma":0.00028870592,"threshold_uncertainty_score":0.9999303},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023801024,0.00027582946,0.99286354,0.0009769375,0.0024138736,0.00040580603,0.00004620048,0.00039163677,0.0023881593],"genre_scores_gemma":[0.82943934,0.00003105654,0.16592789,0.00233354,0.0016440246,0.000019905858,0.00023056021,0.00008618923,0.00028749462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947701,0.000060644652,0.00068816234,0.0019728714,0.0014777725,0.0010304677],"domain_scores_gemma":[0.99639434,0.00062524225,0.00040020375,0.002066793,0.00029805722,0.00021538697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006500964,0.00074851944,0.00064305944,0.0005786554,0.00030303537,0.00083846657,0.0042890846,0.00059148535,0.0000276483],"category_scores_gemma":[0.000054427546,0.00073957565,0.00023527117,0.0007313897,0.0006558254,0.0005132314,0.0009441789,0.0011904276,0.000065594686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000091588645,0.00009312013,0.0005713157,0.000068817484,0.000012926969,0.00031997796,0.00021985287,0.24491723,0.000041894415,0.022900583,0.0004935096,0.7303516],"study_design_scores_gemma":[0.00037343276,0.0001363262,0.0006506056,0.0004778367,0.000009980607,0.00003379237,4.8200775e-8,0.9603997,0.0012441768,0.032959316,0.0027782489,0.0009365452],"about_ca_topic_score_codex":0.00010271611,"about_ca_topic_score_gemma":0.00031720067,"teacher_disagreement_score":0.82920134,"about_ca_system_score_codex":0.00055807893,"about_ca_system_score_gemma":0.00047017122,"threshold_uncertainty_score":0.9995055},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000997001,0.000389904,0.99401087,0.00048754783,0.00073230086,0.0006707748,0.000022621969,0.0006286591,0.0030473438],"genre_scores_gemma":[0.010623316,0.00013630891,0.98392844,0.0019044436,0.00025733572,0.00003283352,0.000010022733,0.000050868053,0.003056407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959832,0.000023806577,0.0006234728,0.0017350982,0.0008357345,0.000798683],"domain_scores_gemma":[0.99702877,0.00040803515,0.0003380586,0.0015354091,0.0004878693,0.00020187609],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000797305,0.000585886,0.0006377424,0.0008340642,0.000491432,0.00039025635,0.0039522042,0.00041454978,0.000004693959],"category_scores_gemma":[0.00011288357,0.00057067565,0.00021278748,0.00049009157,0.00056932546,0.0005417463,0.0012092318,0.00059322815,0.000020039733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056084714,0.000031739368,0.0000018008403,0.00003665735,0.0000068822064,0.000015917416,0.0005252354,0.8146219,0.000024579425,0.0036283785,0.0009920902,0.18010917],"study_design_scores_gemma":[0.00027821376,0.00008594902,0.0000029331882,0.00024732345,0.000004285964,0.000051275,2.698577e-8,0.9217396,0.0012642007,0.07503738,0.00066712085,0.0006217086],"about_ca_topic_score_codex":0.000009887622,"about_ca_topic_score_gemma":0.000021226697,"teacher_disagreement_score":0.17948745,"about_ca_system_score_codex":0.0002905739,"about_ca_system_score_gemma":0.0010328892,"threshold_uncertainty_score":0.9996745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000041038393,0.0003156266,0.9954245,0.00036561402,0.0021435206,0.00077777664,0.000017234173,0.0006875427,0.000264049],"genre_scores_gemma":[0.0007801949,0.000014597629,0.9979451,0.00045998485,0.00039361915,0.000055610857,0.000018006242,0.000055568908,0.00027732155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959111,0.000089332185,0.00058827805,0.0018525982,0.00081752316,0.00074117066],"domain_scores_gemma":[0.9915883,0.00593022,0.0003474797,0.0017361374,0.0002684321,0.0001294557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019608836,0.00062948366,0.00066947966,0.0007989011,0.00023616827,0.00029281524,0.002860096,0.00034213447,0.000004114954],"category_scores_gemma":[0.0009523977,0.0005958288,0.00020006965,0.0004540626,0.0002819491,0.0003628399,0.00063360616,0.0006949871,0.000020478952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049530263,0.000017920149,0.0000025734014,0.00002843881,0.000005193325,0.000010802971,0.00007925515,0.5141537,0.00006415916,0.029699026,0.00006285224,0.4558711],"study_design_scores_gemma":[0.0003114995,0.00024614215,0.00012053515,0.00025477214,0.000007787323,0.000028149334,5.439643e-8,0.27454224,0.0024655834,0.7185471,0.0027294594,0.0007466441],"about_ca_topic_score_codex":0.0000058494606,"about_ca_topic_score_gemma":0.000008410398,"teacher_disagreement_score":0.6888481,"about_ca_system_score_codex":0.00036618204,"about_ca_system_score_gemma":0.00023580252,"threshold_uncertainty_score":0.9996493},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048811204,0.0005371153,0.9959957,0.0005598092,0.00012255246,0.00025875858,0.000009161516,0.00015192662,0.0018768375],"genre_scores_gemma":[0.14320964,0.000024016961,0.8556736,0.0005926457,0.00023170665,0.000014710298,0.000010881296,0.000031838445,0.00021094624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720335,0.000020965981,0.00032659838,0.0013534224,0.000568744,0.00052690704],"domain_scores_gemma":[0.99841,0.00043128306,0.00024292275,0.00062539714,0.00011904294,0.00017134009],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073425594,0.00042237595,0.00037395212,0.00037386644,0.0005387554,0.0009908298,0.0014946961,0.00016541859,0.0000061086557],"category_scores_gemma":[0.00005704196,0.0003618573,0.0000278598,0.00045437992,0.0011046486,0.00083129236,0.0007808128,0.0006768244,0.000005403189],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012261916,0.000010032762,0.000030696177,0.000023620238,0.0000048224942,0.000014905519,0.0010743956,0.0008057574,0.00019547349,0.0018944738,0.000031817992,0.9959128],"study_design_scores_gemma":[0.0004206999,0.0002033458,0.000055164903,0.0013508967,0.000013906674,0.00036025103,0.0000025645327,0.9880051,0.0010382792,0.003110604,0.0045323544,0.0009068565],"about_ca_topic_score_codex":0.000006196479,"about_ca_topic_score_gemma":0.000015269285,"teacher_disagreement_score":0.9950059,"about_ca_system_score_codex":0.000113110946,"about_ca_system_score_gemma":0.0003646694,"threshold_uncertainty_score":0.99988335},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005910994,0.00021305241,0.9929406,0.0001610214,0.0010739634,0.0020181832,0.00001464161,0.0001992212,0.002788219],"genre_scores_gemma":[0.8081017,0.000016625681,0.19104649,0.00032653485,0.0002064225,0.00016359134,0.000017410153,0.000048003683,0.000073198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99527264,0.00009302779,0.0011300409,0.0014642873,0.0012443941,0.0007956077],"domain_scores_gemma":[0.99639755,0.0005716092,0.0008023525,0.0018032332,0.00030134307,0.0001239055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022942787,0.000572351,0.00079122325,0.0018245428,0.00015870592,0.00025335254,0.0032113683,0.00051957084,0.0000034946274],"category_scores_gemma":[0.000090143665,0.00054986676,0.00017546724,0.0007722638,0.00035343028,0.00050989696,0.00032362354,0.0006045392,0.000006628185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022232789,0.00041497452,0.00052532856,0.0011093843,0.000055562163,0.00013514457,0.0020330993,0.21442798,0.004321009,0.3132882,0.00011514285,0.46335185],"study_design_scores_gemma":[0.0018104397,0.0017911516,0.00023610084,0.0025998913,0.000014126985,0.000051376475,0.0000017886395,0.9479416,0.018782789,0.024255736,0.0013033781,0.0012116089],"about_ca_topic_score_codex":0.00011357146,"about_ca_topic_score_gemma":0.00012823328,"teacher_disagreement_score":0.8075106,"about_ca_system_score_codex":0.0008995423,"about_ca_system_score_gemma":0.0007334666,"threshold_uncertainty_score":0.9996953},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022886375,0.00035750744,0.98915744,0.0006866018,0.004167303,0.00038505867,0.00002141478,0.00035094467,0.004644885],"genre_scores_gemma":[0.63031346,0.000018449173,0.36485395,0.0034745247,0.0007624995,0.000010879348,0.000032296164,0.00006521931,0.00046869976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948938,0.000086143606,0.000853168,0.0019477779,0.0012009963,0.0010181532],"domain_scores_gemma":[0.9963531,0.0005099988,0.0005382537,0.0019647332,0.000337198,0.0002966982],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014775599,0.00076816464,0.00083689764,0.0008276477,0.0003801444,0.0011584398,0.004180636,0.00045987434,0.000028700226],"category_scores_gemma":[0.00014997843,0.0007391342,0.00023045397,0.0008057823,0.00048623502,0.00037303756,0.00073555385,0.0010928909,0.00015155048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022676402,0.00022405495,0.0008229641,0.00048695056,0.00007541731,0.0011459528,0.00084075896,0.2677042,0.001137389,0.072663374,0.00038780746,0.65448844],"study_design_scores_gemma":[0.00041344867,0.00013322705,0.00006270845,0.0008039685,0.000009066601,0.00007554367,5.7917322e-8,0.9691805,0.00023588099,0.016258147,0.011818097,0.0010093136],"about_ca_topic_score_codex":0.0000075733888,"about_ca_topic_score_gemma":0.000008824656,"teacher_disagreement_score":0.70147634,"about_ca_system_score_codex":0.00034397765,"about_ca_system_score_gemma":0.0011179121,"threshold_uncertainty_score":0.99987847},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008896692,0.00038319957,0.9912217,0.00020058361,0.0003403158,0.0011563589,0.000005309281,0.00025273822,0.0063508004],"genre_scores_gemma":[0.014693953,0.000006868767,0.9835643,0.0002436992,0.0004081768,0.00008223048,0.000025503716,0.000037644677,0.000937618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99528897,0.000025821673,0.00073022646,0.002020654,0.0010508246,0.0008835346],"domain_scores_gemma":[0.9984669,0.00015558087,0.00029901238,0.00062221487,0.0001881407,0.00026812876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000394387,0.00066589384,0.00048232105,0.0006613096,0.0005869258,0.0005340971,0.0028279095,0.00027727848,0.00001332006],"category_scores_gemma":[0.000024545274,0.00065518945,0.00012356708,0.0011031779,0.0006243828,0.00050217554,0.0015245698,0.00068461266,0.00005818104],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029246028,0.000125441,0.00006768966,0.00003823237,0.000023777526,0.000048980073,0.0011543814,0.036854833,0.000052899617,0.016740615,0.0002045748,0.94468564],"study_design_scores_gemma":[0.00052910764,0.00014456606,0.0022547415,0.0003704787,0.00001427203,0.0007865428,0.0000030696003,0.8757426,0.00010947134,0.10524211,0.013049479,0.0017535334],"about_ca_topic_score_codex":0.000083744744,"about_ca_topic_score_gemma":0.00004743192,"teacher_disagreement_score":0.9429321,"about_ca_system_score_codex":0.0011282332,"about_ca_system_score_gemma":0.0025643408,"threshold_uncertainty_score":0.9995899},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8884763,0.0005998324,0.10926135,0.00017615846,0.0007185721,0.00047637534,0.00002468426,0.00000494462,0.0002617818],"genre_scores_gemma":[0.9818182,0.00015979534,0.016657587,0.00097148464,0.00028371392,0.000003406223,0.000010613626,0.000026119187,0.00006906358],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998038,0.000038716727,0.00023802673,0.0010709838,0.00023166959,0.000382621],"domain_scores_gemma":[0.999142,0.000030348725,0.000084750754,0.00049754453,0.00011442088,0.00013094218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000495679,0.0003386567,0.0003256805,0.00018062232,0.00010257411,0.0000712885,0.00021907211,0.00023657565,0.0000027535548],"category_scores_gemma":[0.00004047185,0.00032678424,0.000047868656,0.00012015176,0.00024561072,0.0000031260438,0.0004171292,0.00020746232,0.000001698839],"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.00005726471,0.000040968338,0.0013865392,0.00001542844,0.00001527514,0.0000358194,0.0002939101,0.0031644371,0.94083637,0.000069096524,0.0000088652,0.05407601],"study_design_scores_gemma":[0.0036514048,0.0049622757,0.1668897,0.0005795405,0.00008399478,0.00022097879,0.000014743364,0.030062541,0.76147234,0.009470769,0.017436825,0.0051548732],"about_ca_topic_score_codex":0.0000641104,"about_ca_topic_score_gemma":0.0015785511,"teacher_disagreement_score":0.17936403,"about_ca_system_score_codex":0.000056365596,"about_ca_system_score_gemma":0.00009328312,"threshold_uncertainty_score":0.9999184},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019281576,0.000037768372,0.99599016,0.00007372502,0.000880304,0.00044119672,0.0000072635216,0.00009586754,0.00054554665],"genre_scores_gemma":[0.84258944,0.0000048140955,0.15582272,0.0014256308,0.00011837695,0.00000636662,0.000010294287,0.000013181787,0.000009170122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977132,0.00017207707,0.00045761745,0.00060712587,0.0006673485,0.00038261007],"domain_scores_gemma":[0.9976126,0.0009260111,0.00025428052,0.0008181929,0.00019502144,0.00019387616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025300584,0.000354814,0.000332023,0.0014814469,0.00018507712,0.00031361086,0.0012530778,0.0002489327,0.000024847908],"category_scores_gemma":[0.000106870524,0.0003219357,0.000073398354,0.00056430436,0.00020142192,0.0012182718,0.00029059133,0.00034480993,0.000008051889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035734984,0.00006483882,0.000056329463,0.0000961569,0.000014348316,0.0000074498157,0.0063728075,0.033627402,0.001596767,0.2252594,0.000020667809,0.7325265],"study_design_scores_gemma":[0.00045711896,0.0011598832,0.0011929731,0.0005604277,0.000014170891,0.000013020388,0.0000010376518,0.8155562,0.008745062,0.17142646,0.00018797447,0.00068564696],"about_ca_topic_score_codex":0.0000014738922,"about_ca_topic_score_gemma":0.0000019109814,"teacher_disagreement_score":0.8406613,"about_ca_system_score_codex":0.000071781265,"about_ca_system_score_gemma":0.00011603518,"threshold_uncertainty_score":0.9999233},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013361562,0.002674078,0.9926431,0.000911828,0.001835561,0.00069422164,0.000014568194,0.0006229524,0.0005903132],"genre_scores_gemma":[0.02662827,0.00001770633,0.9707287,0.0004404282,0.00093000656,0.00003539403,0.00003924357,0.00004661088,0.00113366],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99615943,0.000032270316,0.00057029905,0.0017620255,0.0008007857,0.00067520293],"domain_scores_gemma":[0.9973149,0.0007295567,0.0003250982,0.0011270083,0.00034628884,0.00015718523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007313843,0.00055753544,0.00054353883,0.0008339537,0.00029009453,0.00068608776,0.0034036462,0.00057269516,0.000011328334],"category_scores_gemma":[0.0001951664,0.00039029843,0.00016779154,0.0006135052,0.0007083272,0.00073265086,0.0009660839,0.00088014314,0.000028512359],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072484863,0.00006353899,0.0000057215975,0.0000748959,0.000008324745,0.00004814089,0.0002482388,0.000121726254,0.0016207194,0.0053795776,0.00071724836,0.99170464],"study_design_scores_gemma":[0.00029283614,0.00020783165,0.000013694565,0.00076796097,0.000017232522,0.000062703555,8.9396835e-8,0.40664002,0.0072924327,0.5681481,0.015730908,0.00082621217],"about_ca_topic_score_codex":0.00017840702,"about_ca_topic_score_gemma":0.00015126645,"teacher_disagreement_score":0.9908784,"about_ca_system_score_codex":0.00040164634,"about_ca_system_score_gemma":0.00062901445,"threshold_uncertainty_score":0.99985486},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47831354,0.000018603527,0.5212235,0.000026558144,0.00017097175,0.00021383661,0.0000030179383,0.000029697292,3.048996e-7],"genre_scores_gemma":[0.84961134,9.1350415e-7,0.15015312,0.00015189269,0.000059701586,0.000009933603,0.00000441119,0.000008661974,3.4859973e-8],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999161,0.000018608689,0.00019311135,0.00029041368,0.00012564374,0.00021121341],"domain_scores_gemma":[0.9994104,0.00023350674,0.000031887375,0.00020398387,0.00006567915,0.00005457472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018910744,0.00013727293,0.00018365194,0.00022763865,0.000074881595,0.000115467745,0.00019602853,0.000053511874,0.0000011354507],"category_scores_gemma":[0.00004424507,0.0001234755,0.000016181813,0.0005987567,0.00019701368,0.0007771422,0.000044593166,0.0002969787,5.0266394e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002355617,0.000091944,0.01174235,0.000019901885,0.000005183105,0.000003673482,0.0039021731,0.69780093,0.21743539,0.000015278525,0.0000010036173,0.068958625],"study_design_scores_gemma":[0.0003356349,0.000097961114,0.011345211,0.000013164072,0.0000024081078,0.0000033277781,0.000008626325,0.7919418,0.19566374,0.00045424394,0.000009195748,0.00012468595],"about_ca_topic_score_codex":0.000031891224,"about_ca_topic_score_gemma":0.00023752503,"teacher_disagreement_score":0.3712978,"about_ca_system_score_codex":0.000015251355,"about_ca_system_score_gemma":0.000024475486,"threshold_uncertainty_score":0.50351846},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035206547,0.00006434371,0.9936209,0.001857621,0.0004366445,0.00034773548,0.0000011634538,0.00013246603,0.000018513207],"genre_scores_gemma":[0.43784446,3.9293104e-7,0.55965763,0.0024342742,0.00005017448,0.0000073279657,0.0000011741079,0.0000042148117,3.6595299e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738777,0.00028634918,0.00034578054,0.0009274187,0.00044732483,0.0006053509],"domain_scores_gemma":[0.99799114,0.00083328155,0.000105369014,0.00079096615,0.00016220237,0.00011701442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031267523,0.0002261626,0.0002803619,0.00075241027,0.00021202739,0.000644749,0.0018558503,0.00009013616,0.0000012984856],"category_scores_gemma":[0.0003998937,0.00020492666,0.00006505843,0.0025914707,0.00011985336,0.0013274153,0.00009037259,0.0002370065,0.000003040499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011239945,0.00007266172,0.00008338897,0.000005747531,4.3444183e-7,0.000013539133,0.00042182975,0.32063207,0.022982802,0.00021830009,0.0000039035394,0.65555406],"study_design_scores_gemma":[0.0005581799,0.0003223312,0.0055633886,0.000041461823,0.0000017725574,0.000010094588,2.7477245e-7,0.8155635,0.13547774,0.04223473,0.000007476357,0.00021905031],"about_ca_topic_score_codex":0.00006138881,"about_ca_topic_score_gemma":0.000026298772,"teacher_disagreement_score":0.655335,"about_ca_system_score_codex":0.00014077847,"about_ca_system_score_gemma":0.00030659192,"threshold_uncertainty_score":0.83566666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006816731,0.00062555337,0.97134805,0.000046586072,0.001074969,0.018441247,0.000005392161,0.00019527275,0.0014462025],"genre_scores_gemma":[0.980065,0.000052169515,0.01619765,0.0005372498,0.000464539,0.0025754634,0.000010259243,0.00007953337,0.000018164174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980294,0.000029449582,0.0004207697,0.000682123,0.0004264508,0.0004117979],"domain_scores_gemma":[0.99930316,0.00009705307,0.00007070019,0.00034957528,0.000098909775,0.00008057716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057816383,0.0003797758,0.0003520089,0.00037164646,0.000089076784,0.00019256848,0.00041878823,0.00038478762,0.000013508263],"category_scores_gemma":[0.000017444569,0.00037219046,0.000036857302,0.0002881646,0.00007616337,0.0004693507,0.00022081337,0.0007650241,0.0000045999764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008457297,0.0000114554,0.000089595116,0.00046726747,0.0000027891729,0.0000144801015,0.00063788466,0.96922415,0.00008284699,0.00020558952,0.0000010393782,0.029254457],"study_design_scores_gemma":[0.00036883543,0.000032145927,0.00004271496,0.0008391709,0.0000040106943,0.000013226877,2.8443952e-7,0.9794569,0.00042585118,0.018285088,0.00017009294,0.0003617025],"about_ca_topic_score_codex":0.000014171118,"about_ca_topic_score_gemma":0.0002845977,"teacher_disagreement_score":0.97324824,"about_ca_system_score_codex":0.000258035,"about_ca_system_score_gemma":0.00006359731,"threshold_uncertainty_score":0.999873},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9553952,0.000087418106,0.041422043,0.0011669362,0.0010730627,0.0005015909,0.00001748782,0.000047527858,0.00028868957],"genre_scores_gemma":[0.99631304,0.00014805111,0.0015023375,0.0016628811,0.000090978676,0.000008708804,0.000001287063,0.000017848373,0.00025487685],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997806,0.000023843826,0.00027419036,0.0011443853,0.00037309784,0.00037849564],"domain_scores_gemma":[0.99919415,0.00024315159,0.0001291263,0.00035095317,0.000012124385,0.00007047537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015927455,0.00033197936,0.0003068509,0.00033838314,0.00013110472,0.0000868507,0.00047780588,0.00022977899,0.00003277679],"category_scores_gemma":[0.000055724835,0.0002699761,0.00003898116,0.00011723377,0.0010403293,0.00017914067,0.0004570581,0.0008444535,0.000016846896],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031785625,0.00011593984,0.016754726,0.00003834156,0.0000028623238,0.0004464353,0.0019356363,0.0008206514,0.44008794,0.00025718295,0.0000036901174,0.5395048],"study_design_scores_gemma":[0.0028540522,0.0018765702,0.38130078,0.0011116965,0.000049291775,0.0008137463,0.0000035318865,0.01061063,0.48541135,0.10793871,0.0042149676,0.0038146707],"about_ca_topic_score_codex":0.000020679563,"about_ca_topic_score_gemma":0.00009610349,"teacher_disagreement_score":0.5356901,"about_ca_system_score_codex":0.00007131914,"about_ca_system_score_gemma":0.000023940285,"threshold_uncertainty_score":0.99997526},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005810367,0.000476668,0.99724,0.00035857252,0.00063757534,0.0008932079,0.000007698006,0.00012207899,0.00020611171],"genre_scores_gemma":[0.3054074,0.00008157529,0.6928375,0.0009977533,0.00049549993,0.00004577313,0.00001017152,0.000033596003,0.00009070985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971669,0.000027127604,0.00045258738,0.0013016111,0.00052770704,0.00052410475],"domain_scores_gemma":[0.9980232,0.0007770513,0.000197053,0.0007235244,0.00010571761,0.00017346996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087456807,0.00046436544,0.00038674814,0.00036257124,0.0003431447,0.00048389914,0.001507468,0.00023097497,0.000022906604],"category_scores_gemma":[0.00005680034,0.00047414465,0.00008050581,0.00020618249,0.0003049302,0.00051248964,0.0008186765,0.0004620652,0.000009487894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015339358,0.000057913032,0.000009287925,0.0001085521,0.00003451726,0.000019256173,0.004428148,0.4996668,0.00024609023,0.13065656,0.00004673435,0.3647108],"study_design_scores_gemma":[0.00031584865,0.00016911067,0.000011313,0.00018142485,0.00000720279,0.00003158409,5.316786e-7,0.97852963,0.0022768483,0.013988745,0.003953379,0.0005343689],"about_ca_topic_score_codex":0.000005529284,"about_ca_topic_score_gemma":0.0000043942323,"teacher_disagreement_score":0.47886285,"about_ca_system_score_codex":0.00036955118,"about_ca_system_score_gemma":0.00022902108,"threshold_uncertainty_score":0.999771},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000781075,0.00085723464,0.99283373,0.000012500642,0.00092060055,0.00030876166,0.0000086764,0.00067084015,0.0036065737],"genre_scores_gemma":[0.117462076,0.00022723297,0.8812998,0.00023904948,0.00050977047,0.0000038201897,0.00000530447,0.00016057584,0.00009239103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753934,0.000010251001,0.00045201115,0.0007348529,0.0006196622,0.00064387935],"domain_scores_gemma":[0.9987716,0.00015394317,0.00012311558,0.00066802837,0.00015225535,0.00013104243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001825401,0.0005273423,0.00049113686,0.0007264077,0.00023891877,0.00018145717,0.0008888065,0.000260032,0.00004390247],"category_scores_gemma":[0.00006472341,0.00055629027,0.00009900892,0.00031958942,0.00061399495,0.0004217122,0.0004266264,0.0008231033,0.000020434623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050757712,0.0000152318,0.000017266757,0.00010719893,0.000013115925,0.00043076754,0.0005243491,0.5243052,0.050831914,0.0000634658,0.00007321162,0.4236132],"study_design_scores_gemma":[0.00021759486,0.00003864168,0.000022196438,0.00087867334,0.000009756764,0.0002346124,1.7002843e-7,0.94498813,0.04723271,0.0037607322,0.0017167628,0.0009000343],"about_ca_topic_score_codex":0.000010689323,"about_ca_topic_score_gemma":0.000008441425,"teacher_disagreement_score":0.42271316,"about_ca_system_score_codex":0.0006059285,"about_ca_system_score_gemma":0.000111264475,"threshold_uncertainty_score":0.99968886},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073989603,0.00010771808,0.98699665,0.00031327215,0.0012529385,0.000475805,0.000012238477,0.00020108931,0.00990039],"genre_scores_gemma":[0.66618884,0.000023929982,0.33300358,0.00010449751,0.00037434665,0.000013474754,0.000054133372,0.000017600736,0.00021961161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979653,0.00018101656,0.00041324066,0.0005340027,0.0005865299,0.0003199225],"domain_scores_gemma":[0.9975472,0.0007915528,0.0004267539,0.00080879277,0.00032623057,0.00009946939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013004632,0.00019654096,0.0003420618,0.00064783555,0.00028146562,0.000102486265,0.002140646,0.00037474497,0.000020411846],"category_scores_gemma":[0.0009003332,0.00018684594,0.000049003214,0.00070446625,0.0018509513,0.000489076,0.00040102645,0.0007581752,0.000010082023],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007344295,0.000053365362,0.00002069459,0.00003723937,0.0000061195756,0.000008053023,0.02495337,0.0018875371,0.00040278144,0.005500873,0.000006056988,0.9671166],"study_design_scores_gemma":[0.00091556745,0.00030523693,0.00030056827,0.003744401,0.000032915414,0.000026949061,0.0002743474,0.9501202,0.0074261636,0.02872195,0.0071548237,0.0009768781],"about_ca_topic_score_codex":0.0011408764,"about_ca_topic_score_gemma":0.0057974034,"teacher_disagreement_score":0.9661397,"about_ca_system_score_codex":0.0016720229,"about_ca_system_score_gemma":0.002989082,"threshold_uncertainty_score":0.76193565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002018206,0.001115722,0.99101585,0.0014044205,0.0032747588,0.00022463143,0.000006609473,0.0001237826,0.0026323956],"genre_scores_gemma":[0.0649406,0.00015643713,0.92367405,0.004606488,0.0043616355,0.000012026053,0.000026077609,0.000043986307,0.0021786958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653256,0.000024848061,0.0004542932,0.001451488,0.0010111594,0.0005256609],"domain_scores_gemma":[0.9983147,0.00032533988,0.00019682037,0.0006960633,0.0002551501,0.00021196561],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007334259,0.0004633175,0.0003895395,0.00083189394,0.00036489725,0.0009202679,0.001502645,0.00025461905,0.00003802303],"category_scores_gemma":[0.0000531112,0.00044757832,0.00010054281,0.0005868618,0.00052210223,0.00089706015,0.0010160941,0.0005975039,0.000041006202],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004115039,0.00002891069,0.00001417215,0.000014855875,0.000010019067,0.00004916487,0.00031760646,0.03519328,0.00007104477,0.021531725,0.00009478979,0.94267035],"study_design_scores_gemma":[0.00037193013,0.00025209875,0.0003588093,0.00018845116,0.000009628568,0.00027927177,9.7072906e-8,0.8363881,0.00052525516,0.12389829,0.036854956,0.00087307143],"about_ca_topic_score_codex":0.000007957179,"about_ca_topic_score_gemma":0.000028632243,"teacher_disagreement_score":0.94179726,"about_ca_system_score_codex":0.00021424663,"about_ca_system_score_gemma":0.0005697657,"threshold_uncertainty_score":0.9997976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017015407,0.00029864468,0.99527156,0.00015054882,0.0012549623,0.0011541145,0.00001075425,0.0001175097,0.0017248604],"genre_scores_gemma":[0.08166026,0.000026680787,0.91445583,0.0022604105,0.0007830438,0.00016864492,0.00020144286,0.000038642884,0.00040503198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973109,0.000019430572,0.00068109756,0.00071978866,0.0007532886,0.00051551865],"domain_scores_gemma":[0.99809974,0.0004231849,0.0003049694,0.00081042503,0.000286112,0.00007554036],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019142288,0.00034181905,0.00035730985,0.0013994931,0.00021432215,0.0014778061,0.0021430224,0.00019535849,0.0000033194588],"category_scores_gemma":[0.00009253127,0.00032946866,0.000052339365,0.00070611347,0.00017618819,0.002376962,0.0003906949,0.0003645197,0.000027109789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026126847,0.000015659485,0.00008703049,0.00018580497,0.000004159402,0.000008252039,0.0006264294,0.4636363,0.000006869541,0.018497448,0.000044019365,0.5168854],"study_design_scores_gemma":[0.00032138688,0.00010594325,0.000036845613,0.0005036823,0.0000024028473,0.0000028963557,0.0000013419401,0.9844245,0.00028088014,0.0026185845,0.011302954,0.00039859372],"about_ca_topic_score_codex":0.00008607505,"about_ca_topic_score_gemma":0.00005195711,"teacher_disagreement_score":0.5207882,"about_ca_system_score_codex":0.0002958907,"about_ca_system_score_gemma":0.0003295477,"threshold_uncertainty_score":0.9999157},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010294855,0.0010527566,0.9790323,0.000795454,0.0023495348,0.0007519307,8.724129e-7,0.00039141966,0.015615451],"genre_scores_gemma":[0.36549965,0.000104711486,0.6239656,0.004327091,0.0028039792,0.000059257436,0.000028437304,0.00007864069,0.0031326376],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952336,0.00004262755,0.0006570423,0.0018336895,0.0012135687,0.001019448],"domain_scores_gemma":[0.99741393,0.00014401141,0.0003592516,0.0016345237,0.00020685069,0.0002414115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010685659,0.00064237334,0.0005983145,0.0005975245,0.00028401575,0.0008885032,0.004363425,0.0003714177,0.000049557548],"category_scores_gemma":[0.000026840344,0.0005296953,0.00019922198,0.00060562947,0.0006483214,0.00063810206,0.0015199316,0.00079429854,0.00024262961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017265837,0.000042524178,0.000104186816,0.000026719728,0.00001112496,0.000093449045,0.00031078374,0.00073383504,0.0000106994685,0.18668456,0.00003251412,0.8119479],"study_design_scores_gemma":[0.000520475,0.0007257901,0.00007949906,0.00012534813,0.000017202638,0.00026610744,4.5509182e-7,0.09556941,0.00034726932,0.80078083,0.10003976,0.0015278663],"about_ca_topic_score_codex":0.000059717386,"about_ca_topic_score_gemma":0.00021661492,"teacher_disagreement_score":0.81042,"about_ca_system_score_codex":0.00040737513,"about_ca_system_score_gemma":0.00041523288,"threshold_uncertainty_score":0.99971545},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002402041,0.0007143015,0.993204,0.00017300421,0.0008273952,0.0004354923,0.000001891503,0.0002454654,0.0041582594],"genre_scores_gemma":[0.032400858,0.000056326146,0.9665911,0.0004889082,0.00018088183,0.000009056394,0.000004318526,0.000022786046,0.0002457738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966384,0.0000735058,0.00047153205,0.001420594,0.0008682748,0.00052768725],"domain_scores_gemma":[0.9976903,0.00025217087,0.00044211058,0.0012194891,0.00024759345,0.00014830212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013214325,0.0004798538,0.00048460235,0.00067697605,0.00030852453,0.00075951475,0.0018100914,0.00029190094,0.0000020662642],"category_scores_gemma":[0.00013329132,0.0003945917,0.00005691699,0.0005975092,0.0004609602,0.001163902,0.0004163818,0.0006104058,0.000013448901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010096642,0.000009350486,0.00003038817,0.000073949035,0.000006923282,0.000052689003,0.00022639381,0.01220723,0.000049004753,0.12995382,0.0000029220855,0.85737723],"study_design_scores_gemma":[0.00031800204,0.00056841184,0.0011624618,0.0018494551,0.0000207298,0.00068290264,6.6874196e-7,0.94445753,0.00074481743,0.04892191,0.00039208969,0.00088101206],"about_ca_topic_score_codex":0.000027108581,"about_ca_topic_score_gemma":0.00004165432,"teacher_disagreement_score":0.9322503,"about_ca_system_score_codex":0.0004477688,"about_ca_system_score_gemma":0.0003268207,"threshold_uncertainty_score":0.9998506},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015337311,0.0003826163,0.95854527,0.000034772776,0.002802717,0.0001827428,0.000004807292,0.00023007081,0.037663616],"genre_scores_gemma":[0.93553555,0.0003745121,0.061559476,0.00036227648,0.0015431782,0.000015297781,0.000047862122,0.00008593605,0.00047590828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988043,0.000011645098,0.00031162423,0.0004265694,0.00023169612,0.0002141726],"domain_scores_gemma":[0.99946463,0.00006626232,0.000036410584,0.00022855667,0.00016149896,0.00004265178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009446582,0.0002992435,0.00024790099,0.0003569424,0.00009431759,0.00012684296,0.00024504893,0.00028329066,0.000088824505],"category_scores_gemma":[0.00001001322,0.00029344248,0.00007223284,0.00027733267,0.00032967812,0.0004693831,0.000022545879,0.00046558498,0.00003469259],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048372167,0.0000063746156,0.0000055690093,0.000023411416,0.000010010567,0.0000022980046,0.00096678466,0.022145964,0.00032255324,0.044598326,0.000014899079,0.93189895],"study_design_scores_gemma":[0.00052379473,0.00019845241,0.000102667786,0.0009831521,0.00004255509,0.0002442459,0.000003420877,0.66128296,0.02639844,0.28853714,0.0204792,0.001203938],"about_ca_topic_score_codex":0.0000037510085,"about_ca_topic_score_gemma":0.000061119965,"teacher_disagreement_score":0.9353822,"about_ca_system_score_codex":0.00029986957,"about_ca_system_score_gemma":0.00009707026,"threshold_uncertainty_score":0.9999518},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005519041,0.00033003048,0.99109703,0.0017095042,0.00021371632,0.0001170307,0.0000041672906,0.000053253152,0.00095619727],"genre_scores_gemma":[0.49114475,0.000048571404,0.507209,0.0012544316,0.00021090447,0.0000039819665,0.0000027277003,0.000017079337,0.00010857797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976329,0.000039555103,0.000339313,0.0009858075,0.0006934007,0.00030898929],"domain_scores_gemma":[0.9967746,0.00038785493,0.00022244758,0.002432072,0.00007885236,0.00010413449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009205515,0.00030501155,0.0003505299,0.000400422,0.0002100157,0.00032228825,0.0035371697,0.00012533981,0.000013545679],"category_scores_gemma":[0.00006383063,0.0002079599,0.00007064935,0.00030779094,0.0004834549,0.00041546836,0.0012800085,0.000436602,0.000008727362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067336655,0.00009696902,0.00004027782,0.00002880378,0.0000370352,0.00003853262,0.008325205,0.025667654,0.003565156,0.2187222,0.00005270819,0.74341875],"study_design_scores_gemma":[0.0003593622,0.00057214964,0.00015694025,0.0011576647,0.000029837789,0.00006321893,0.0000059990084,0.8349818,0.033126432,0.12504505,0.0033158616,0.001185714],"about_ca_topic_score_codex":0.00002862816,"about_ca_topic_score_gemma":0.000014038681,"teacher_disagreement_score":0.80931413,"about_ca_system_score_codex":0.00006791454,"about_ca_system_score_gemma":0.00014346321,"threshold_uncertainty_score":0.8480359},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010775916,0.00042790323,0.9898725,0.00063216285,0.000756332,0.00041031424,0.0000042007746,0.00023901791,0.0075497706],"genre_scores_gemma":[0.33423197,0.00027990373,0.661315,0.0018634138,0.00033949595,0.000020847214,0.0000056864747,0.00005023019,0.0018934493],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666286,0.00003491376,0.00066973915,0.0011176842,0.0010185661,0.0004962699],"domain_scores_gemma":[0.99725384,0.00038916638,0.00050348404,0.0012511268,0.00046760665,0.00013480772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008445547,0.0004185749,0.0005824598,0.00068665063,0.00016056106,0.0002871949,0.0031324064,0.00028479897,0.000025165647],"category_scores_gemma":[0.00009985756,0.0003637583,0.0001654799,0.00070052664,0.0006733134,0.0005538827,0.0009935888,0.00057666807,0.000027583583],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014916332,0.000074893745,0.000044466808,0.00010296282,0.000019859472,0.0001039953,0.0012254383,0.0005830951,0.013148978,0.113740616,0.000021433236,0.87091935],"study_design_scores_gemma":[0.00065982563,0.0007456392,0.00041583154,0.0016370785,0.000024972851,0.00026434037,0.0000018276813,0.13557173,0.2809863,0.57220715,0.005776992,0.0017082886],"about_ca_topic_score_codex":0.00004713463,"about_ca_topic_score_gemma":0.000025075407,"teacher_disagreement_score":0.8692111,"about_ca_system_score_codex":0.00025488902,"about_ca_system_score_gemma":0.00048267338,"threshold_uncertainty_score":0.99988145},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007669674,0.0010104075,0.99548846,0.00004661306,0.0005818276,0.00010317804,0.0000026883383,0.00025368313,0.0017461884],"genre_scores_gemma":[0.93475586,0.00014073597,0.06407719,0.0002016405,0.00043899214,0.0000014042226,0.0000087030685,0.00005496556,0.0003205035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978662,0.000009526896,0.00037797703,0.00068531407,0.00058339734,0.0004775859],"domain_scores_gemma":[0.99902743,0.00014848654,0.00008026314,0.00053003355,0.00009149594,0.00012227143],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034057393,0.00042393556,0.00046725347,0.0014771493,0.00017766714,0.00019100463,0.0007246895,0.00029057573,0.000030336587],"category_scores_gemma":[0.000041633495,0.0003900885,0.00015023007,0.00081823545,0.00011662085,0.00014238554,0.00017588987,0.0006632045,0.0000446753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.3297235e-7,0.0000050985614,0.0000092873115,0.000013036612,0.00000832383,0.00001659555,0.00008134298,0.5045277,0.0003363483,0.00001547377,0.0000025791605,0.49498346],"study_design_scores_gemma":[0.00012922252,0.000026583615,0.00009338922,0.00024799208,0.000025477433,0.000012822708,4.673772e-8,0.9888849,0.00069411926,0.009258889,0.00017048346,0.0004560244],"about_ca_topic_score_codex":0.00003600017,"about_ca_topic_score_gemma":0.000029871773,"teacher_disagreement_score":0.93398887,"about_ca_system_score_codex":0.00025544176,"about_ca_system_score_gemma":0.00003930971,"threshold_uncertainty_score":0.9998551},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011789856,0.0015522568,0.9912937,0.0010817623,0.0008525066,0.0009996746,0.0000027439753,0.00017285174,0.002865484],"genre_scores_gemma":[0.8314157,0.00015866135,0.16539805,0.0026006831,0.00025915404,0.00003465166,0.000007185063,0.000041346757,0.000084543986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99615717,0.000076265365,0.000528537,0.0015871056,0.0009737362,0.00067716726],"domain_scores_gemma":[0.99807084,0.0006119549,0.00026054168,0.0007427372,0.00019337871,0.000120545796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009697002,0.0005296432,0.00054077856,0.0018634826,0.00022135636,0.00030242302,0.0018050639,0.00024303589,0.0000034469556],"category_scores_gemma":[0.00008498563,0.00047016193,0.000155552,0.0014863998,0.00047147178,0.00019355076,0.00050904346,0.00093422463,0.000019754512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007437322,0.000089043984,0.00008044739,0.00006569246,0.0000064869223,0.00013310208,0.0006751964,0.3269126,0.000019904799,0.006130096,0.000011381517,0.6658686],"study_design_scores_gemma":[0.00047610147,0.00054000114,0.0037757566,0.0032081637,0.000008188659,0.00005935189,4.7111348e-7,0.9102591,0.0006551402,0.07999921,0.0001804593,0.00083801],"about_ca_topic_score_codex":0.000039190483,"about_ca_topic_score_gemma":0.00007129143,"teacher_disagreement_score":0.83023673,"about_ca_system_score_codex":0.00031899285,"about_ca_system_score_gemma":0.0003207748,"threshold_uncertainty_score":0.999775},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004135068,0.0008334007,0.9878191,0.0018294558,0.0006112166,0.00024671902,0.000006657439,0.00013362493,0.008478492],"genre_scores_gemma":[0.26428536,0.00084033207,0.73108673,0.0027471161,0.0003137605,0.000021642614,0.000010752265,0.000029424606,0.0006648875],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980979,0.000018572982,0.00035619483,0.0006873926,0.0004531927,0.00038676092],"domain_scores_gemma":[0.99868923,0.00035577323,0.00011473661,0.00065720663,0.00009477423,0.00008828667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040537963,0.00028422897,0.00028171108,0.0004687334,0.00030121751,0.00047811226,0.0013747036,0.00013722206,0.000041659267],"category_scores_gemma":[0.00003779461,0.00024446825,0.000054181277,0.00030389774,0.0005289355,0.00070426636,0.00039442856,0.0003276933,0.000021273601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.0143255e-7,0.000007916354,0.00005683684,0.000017485427,0.000006056353,0.000015126979,0.0015583547,0.00039680273,0.000009504893,0.3869467,0.00003591638,0.61094856],"study_design_scores_gemma":[0.0002959232,0.00011808849,0.0004418408,0.00012290858,0.000010720632,0.00012226736,0.0000011303068,0.14632499,0.0003771338,0.8466033,0.0050433506,0.0005383939],"about_ca_topic_score_codex":0.000019400295,"about_ca_topic_score_gemma":0.00008875101,"teacher_disagreement_score":0.6104102,"about_ca_system_score_codex":0.000081324855,"about_ca_system_score_gemma":0.00014679335,"threshold_uncertainty_score":0.9969126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008454815,0.00008495407,0.9969191,0.00062359666,0.0006637477,0.0007856795,0.000034919107,0.00021577766,0.00058766914],"genre_scores_gemma":[0.009649567,0.0000017653321,0.9886514,0.0009846374,0.00026240104,0.0000840163,0.00003205991,0.000041179614,0.00029297665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962392,0.000013365068,0.00057704083,0.0016385512,0.0008183788,0.0007134927],"domain_scores_gemma":[0.99645823,0.00071910047,0.00036406965,0.0014717376,0.00083345425,0.00015343353],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00190152,0.00046774166,0.0004330753,0.0006894669,0.00039783563,0.00065202336,0.0036383127,0.0002443867,0.0000036243669],"category_scores_gemma":[0.00031252953,0.00043814283,0.00010276445,0.0008453351,0.00041616661,0.00048284096,0.0009702931,0.0004661368,0.000013429707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046205723,0.000019424298,0.000008068768,0.00006483979,0.000003650732,0.000005427011,0.00021373702,0.16604462,0.000092294365,0.010033927,0.000014257111,0.82349515],"study_design_scores_gemma":[0.00029049732,0.00007147835,0.000036948866,0.00046040144,0.000008993452,0.0000131700845,8.770889e-8,0.9358248,0.00039389898,0.062259927,0.00014938685,0.0004903879],"about_ca_topic_score_codex":0.000018897914,"about_ca_topic_score_gemma":0.000040416293,"teacher_disagreement_score":0.8230047,"about_ca_system_score_codex":0.0002369996,"about_ca_system_score_gemma":0.0012610082,"threshold_uncertainty_score":0.99980706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080809364,0.0008155399,0.99331135,0.00021548163,0.00071385596,0.0002932966,0.0000032139765,0.000058602505,0.003780547],"genre_scores_gemma":[0.23065917,0.00004131647,0.76783556,0.000764222,0.00016280323,0.000004913092,0.0000035351595,0.000020989286,0.0005075065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969359,0.00009977346,0.0006400263,0.00091385096,0.0009112618,0.0004991921],"domain_scores_gemma":[0.9981519,0.0004865803,0.00030488012,0.0007960678,0.0001841277,0.00007642219],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017306767,0.00037250243,0.0005164609,0.001174568,0.00010431413,0.0002805868,0.0018830644,0.00010973974,0.000011099056],"category_scores_gemma":[0.00007786284,0.00034553,0.00011408766,0.0006784792,0.00043952782,0.00034942568,0.00050387206,0.0004941873,0.000005979885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009674497,0.000043464148,0.00008083653,0.00007459797,0.0000053773597,0.0002010426,0.0014335627,0.16112225,0.0015244812,0.0050747357,0.000012315084,0.83041763],"study_design_scores_gemma":[0.0007876015,0.00023011697,0.0012300676,0.000982181,0.000011542224,0.00013092501,7.5632624e-7,0.8624567,0.04920179,0.08406032,0.000100893754,0.00080710446],"about_ca_topic_score_codex":0.000057315552,"about_ca_topic_score_gemma":0.000014702287,"teacher_disagreement_score":0.8296106,"about_ca_system_score_codex":0.00025983164,"about_ca_system_score_gemma":0.00034080545,"threshold_uncertainty_score":0.9998997},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064597605,0.0018338452,0.99264956,0.00006314283,0.00038694733,0.00025019413,0.0000050044237,0.000034852874,0.0041304906],"genre_scores_gemma":[0.9496314,0.00004014654,0.04893793,0.00029032113,0.00049710006,0.000020971785,0.000091754206,0.00004381332,0.00044655413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804693,0.000044822093,0.00027725124,0.00096191897,0.0003322774,0.00033679887],"domain_scores_gemma":[0.99898756,0.000026440322,0.00022441648,0.0005392126,0.00011669171,0.00010566632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051577494,0.00031258486,0.00024748503,0.00026773495,0.0002376973,0.00014931044,0.00044650884,0.00032646095,0.000011339802],"category_scores_gemma":[0.00007336191,0.00028912834,0.00008355971,0.00015546713,0.00024769167,0.000006183515,0.00020885724,0.0005021406,0.0000035875191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029272625,0.000021190195,0.00013677638,0.00007494786,0.000013789514,0.00013988376,0.00012713707,0.9464406,0.009856919,0.0017637265,0.000011801789,0.041383978],"study_design_scores_gemma":[0.0012515695,0.0005440037,0.000029827037,0.0011766535,0.000033593948,0.0014798477,0.00000641726,0.95953214,0.016466113,0.0017843088,0.016379694,0.0013158034],"about_ca_topic_score_codex":0.000046738485,"about_ca_topic_score_gemma":0.00001776231,"teacher_disagreement_score":0.94898546,"about_ca_system_score_codex":0.00016736776,"about_ca_system_score_gemma":0.0005322294,"threshold_uncertainty_score":0.9999561},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023568563,0.0005591255,0.9935073,0.00016036413,0.0033709237,0.0007267722,0.000008573028,0.00027209052,0.0011591373],"genre_scores_gemma":[0.03592466,0.00028223207,0.96070856,0.0002339657,0.0024595375,0.0000152322145,0.000071207825,0.000096114556,0.00020847569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99400246,0.00005583834,0.0009094653,0.0026739195,0.0010418023,0.0013165172],"domain_scores_gemma":[0.9940225,0.0016772497,0.00049384026,0.003311847,0.00028188294,0.00021267256],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023363403,0.0007014663,0.00073525606,0.0011990706,0.00027707886,0.0005853966,0.0060718423,0.00068417634,0.000005407464],"category_scores_gemma":[0.00014611142,0.0007253981,0.00011383574,0.0011045753,0.00045817706,0.00085488195,0.0023128702,0.0010115382,0.000018173758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008274202,0.000021283176,0.00007590822,0.00001566057,0.0000058343767,0.000067118715,0.00010919275,0.64907,0.00004595259,0.0015384112,0.000010816792,0.34903154],"study_design_scores_gemma":[0.00037396993,0.000112019174,0.00017009022,0.00077941077,0.000008142154,0.00004068625,1.5373683e-7,0.9934958,0.0004007486,0.0035350996,0.00033910014,0.00074474444],"about_ca_topic_score_codex":0.00007035305,"about_ca_topic_score_gemma":0.00016505866,"teacher_disagreement_score":0.34828678,"about_ca_system_score_codex":0.000710105,"about_ca_system_score_gemma":0.00039405515,"threshold_uncertainty_score":0.9995197},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000077401564,0.0002868858,0.9950838,0.0002638611,0.0015656567,0.0008603716,0.00012076361,0.0003969485,0.0013443048],"genre_scores_gemma":[0.007722435,0.000017332557,0.9891807,0.0015357638,0.0010604542,0.00004493317,0.000042540636,0.00005898331,0.0003368463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996209,0.000030481415,0.0005537244,0.001726753,0.00059224095,0.0008877537],"domain_scores_gemma":[0.99582386,0.001898205,0.00036907545,0.0014381601,0.00026932903,0.00020138701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001169442,0.0005819949,0.0006287172,0.000589735,0.00035867107,0.0008438286,0.0035194787,0.00035808366,0.00002230162],"category_scores_gemma":[0.00014721564,0.00054295314,0.00021264188,0.00035636307,0.00058408873,0.00093246216,0.00064304535,0.00038456375,0.000015223607],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007239262,0.000027987231,0.00000772433,0.00004105941,0.000013434057,0.000030605326,0.00039363862,0.0026788025,0.00016894948,0.022722622,0.000055077522,0.9738529],"study_design_scores_gemma":[0.00064619025,0.00037737307,0.0000084449675,0.00022952491,0.000013616205,0.00011847474,0.0000018016974,0.89915603,0.0018117598,0.09088954,0.006053097,0.0006941184],"about_ca_topic_score_codex":0.000010935206,"about_ca_topic_score_gemma":0.000011172644,"teacher_disagreement_score":0.9731587,"about_ca_system_score_codex":0.00015764927,"about_ca_system_score_gemma":0.00041791203,"threshold_uncertainty_score":0.9997022},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033087435,0.00021027889,0.966844,0.00012588488,0.0013679108,0.000568516,7.57482e-7,0.00037898042,0.030470552],"genre_scores_gemma":[0.051775273,0.000011130336,0.9466326,0.00038110945,0.0003707898,0.000022720105,0.000004976609,0.00003723176,0.00076414726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99497885,0.000081266146,0.0008589076,0.0017787387,0.0014062001,0.00089605636],"domain_scores_gemma":[0.99636334,0.00080792693,0.00063818,0.0016246648,0.00045079985,0.00011506842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018480555,0.0006046484,0.0005121117,0.00047774913,0.00047811083,0.0006329402,0.0038808193,0.00031177443,0.0000139664235],"category_scores_gemma":[0.0010296719,0.00058249384,0.00010780587,0.0010639419,0.000864517,0.0012846487,0.0017817039,0.0012393901,0.00006506101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022342376,0.000012510045,0.00004352254,0.000079437705,0.0000035065007,0.00002622502,0.0003437227,0.652309,0.00018760403,0.06937807,0.000010892572,0.2776033],"study_design_scores_gemma":[0.00012918672,0.00024040914,0.000130126,0.0005427476,0.0000069110047,0.000059856608,9.755498e-8,0.84136385,0.00097608496,0.1546771,0.001246929,0.0006267423],"about_ca_topic_score_codex":0.00006424536,"about_ca_topic_score_gemma":0.0000075911826,"teacher_disagreement_score":0.27697656,"about_ca_system_score_codex":0.0006712433,"about_ca_system_score_gemma":0.000581486,"threshold_uncertainty_score":0.99966264},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042192372,0.00012145019,0.99377304,0.0007673419,0.000398078,0.00049568457,0.000017045455,0.000048998158,0.00015910922],"genre_scores_gemma":[0.115650594,0.00008425414,0.88357025,0.0003334088,0.00023819268,0.000029718743,0.000031295378,0.00002871067,0.000033571687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537426,0.00042469136,0.00084265845,0.0015018054,0.0011478371,0.0007087644],"domain_scores_gemma":[0.9968338,0.0011026822,0.00036987118,0.0012795889,0.00028741994,0.00012666595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037818328,0.00037574474,0.0007050931,0.0015217679,0.00014872634,0.00042176613,0.0029678892,0.00040569413,0.00004814995],"category_scores_gemma":[0.0002731273,0.0003437534,0.00016121227,0.0016850797,0.0004870668,0.0013566666,0.0009870615,0.0010587373,0.0000030532103],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100895695,0.000046664933,0.0020479206,0.000015689156,0.000012951254,0.00001354435,0.0011223033,0.0035678355,0.0002598361,0.0022385558,0.0000034271225,0.9906612],"study_design_scores_gemma":[0.0026591597,0.0011071694,0.002804451,0.000575366,0.000045344754,0.000017578683,0.000018917102,0.56729084,0.027528029,0.39422587,0.0020239104,0.0017033487],"about_ca_topic_score_codex":0.0015409777,"about_ca_topic_score_gemma":0.0017526681,"teacher_disagreement_score":0.9889578,"about_ca_system_score_codex":0.00032241782,"about_ca_system_score_gemma":0.001447011,"threshold_uncertainty_score":0.9999015},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056629542,0.00039112175,0.9945812,0.000079807316,0.0011516012,0.00015608211,0.000007239503,0.00022819414,0.003348102],"genre_scores_gemma":[0.028674308,0.000060024697,0.9702965,0.00019906173,0.0004782603,0.000002709297,0.0000055206006,0.000043710552,0.00023987493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998674,0.000007364397,0.00023537796,0.0004037955,0.0003396193,0.00033989083],"domain_scores_gemma":[0.99926394,0.00012089698,0.000032506203,0.00035217215,0.0001255357,0.00010492062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002420942,0.00027625266,0.00025356477,0.00041418622,0.00008281023,0.00012371977,0.0004917309,0.00021834727,0.000099747405],"category_scores_gemma":[0.000026637405,0.00027032127,0.00005624969,0.00020883686,0.00043268068,0.00012962356,0.00013214425,0.0006630625,0.00007409141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.1531815e-7,0.000002960554,0.0000066670873,0.0000094813895,0.000005579432,0.0000073779142,0.00034692712,0.73945284,0.000025024045,0.00018133383,0.000002087725,0.259959],"study_design_scores_gemma":[0.0001869888,0.00001685814,0.000020468959,0.00011789157,0.0000036613278,0.000032158307,5.215073e-7,0.99720985,0.0008838163,0.0010920436,0.00012359665,0.00031215977],"about_ca_topic_score_codex":0.0000037475488,"about_ca_topic_score_gemma":0.000015193168,"teacher_disagreement_score":0.25964686,"about_ca_system_score_codex":0.00022914658,"about_ca_system_score_gemma":0.00011803151,"threshold_uncertainty_score":0.9999749},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043843367,0.000774639,0.9910858,0.00026614143,0.0022341073,0.0005012123,0.00003133876,0.0004317894,0.0046311105],"genre_scores_gemma":[0.25229844,0.000049305236,0.7431666,0.0009815539,0.0015063139,0.000049557235,0.000036344092,0.00008606452,0.0018258111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957982,0.00004795277,0.00067010865,0.0016426151,0.0008967088,0.0009444312],"domain_scores_gemma":[0.99660015,0.001313195,0.00036791514,0.0011810384,0.0003266342,0.00021108484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013786212,0.0006177572,0.00068349513,0.0006294538,0.0005701326,0.00071110664,0.0030183217,0.00043831073,0.000006311614],"category_scores_gemma":[0.000051884454,0.0005867402,0.00019327377,0.0004041826,0.0007095687,0.0005993589,0.00066220516,0.0007366736,0.000022609102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012472138,0.000008474154,0.0000083322175,0.0000790156,0.0000139059475,0.0000642582,0.0024288227,0.6628052,0.000010460159,0.22602458,0.00008509327,0.10845935],"study_design_scores_gemma":[0.0003139061,0.00029761717,5.627084e-7,0.0010709208,0.000011026516,0.00010136596,0.000003389135,0.94396055,0.0002269218,0.046414163,0.0069059837,0.00069358986],"about_ca_topic_score_codex":0.000081605016,"about_ca_topic_score_gemma":0.000021263904,"teacher_disagreement_score":0.28115532,"about_ca_system_score_codex":0.00041494198,"about_ca_system_score_gemma":0.0007509567,"threshold_uncertainty_score":0.9996584},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005250389,0.00034312712,0.9923684,0.00017801693,0.0025769428,0.00055123254,0.0000016659071,0.0001027604,0.0033528323],"genre_scores_gemma":[0.27887538,0.000051181432,0.7185449,0.0017760664,0.0004441652,0.000011210671,0.0000063616612,0.00005336922,0.00023736355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566686,0.0000857253,0.0008161027,0.0015372037,0.0012124653,0.00068165193],"domain_scores_gemma":[0.9968308,0.00033962252,0.0006723434,0.0017823471,0.00023984294,0.00013504921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013903971,0.00054196,0.0005936545,0.0010888247,0.00018690502,0.00040491836,0.0032463847,0.00024319302,0.00004011987],"category_scores_gemma":[0.000058156547,0.0005416584,0.00017794353,0.0010345792,0.00045235697,0.00058857683,0.0016663463,0.00058022264,0.000017768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004907071,0.000034638917,0.00008382082,0.00009333429,0.000027498165,0.00007116842,0.00041160337,0.5208227,0.0005042081,0.01897683,0.000057881327,0.4589114],"study_design_scores_gemma":[0.000314106,0.00016968745,0.000016800366,0.0011490484,0.000026765634,0.00003854822,2.7759737e-7,0.92532814,0.01415593,0.05456316,0.0034146677,0.0008228527],"about_ca_topic_score_codex":0.000024278279,"about_ca_topic_score_gemma":0.000014438326,"teacher_disagreement_score":0.45808852,"about_ca_system_score_codex":0.0006475138,"about_ca_system_score_gemma":0.00033631377,"threshold_uncertainty_score":0.99970347},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027028684,0.000024881523,0.95226705,0.0013616782,0.00033513893,0.045762617,0.0000067616556,0.00021020182,0.00002894397],"genre_scores_gemma":[0.03872278,0.0000028957488,0.93392426,0.0020321978,0.0002459169,0.024077207,0.000017652614,0.00008620509,0.00089088734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564624,0.000051638566,0.00065558194,0.0017663058,0.0011091527,0.0007710647],"domain_scores_gemma":[0.99779874,0.00040689163,0.00034776676,0.0010414574,0.00024331185,0.00016183505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010955408,0.00061645097,0.0005654642,0.0009774456,0.00025341817,0.00047881098,0.0019779159,0.000515993,0.000018968309],"category_scores_gemma":[0.0003094004,0.00057216646,0.00006964033,0.0008105647,0.0005059006,0.00058772665,0.0009252498,0.00063828577,0.000011297667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020656622,0.00005272757,0.00016515171,0.000028577933,0.0000044547696,0.000015382266,0.00010578902,0.69351447,0.000016612606,0.0032152613,0.000026504229,0.30283442],"study_design_scores_gemma":[0.003083014,0.0004372223,0.00016719074,0.0007556747,0.0000052814453,0.000008428902,1.8349209e-7,0.9833293,0.00022205866,0.0061770338,0.00519283,0.0006217688],"about_ca_topic_score_codex":0.000009472813,"about_ca_topic_score_gemma":0.000051924333,"teacher_disagreement_score":0.30221266,"about_ca_system_score_codex":0.00088617124,"about_ca_system_score_gemma":0.0005371907,"threshold_uncertainty_score":0.99967295},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21928662,0.0024460834,0.7682544,0.0003410458,0.0005128537,0.0016764808,0.00012128236,0.000056087396,0.0073051592],"genre_scores_gemma":[0.9815701,0.00003705446,0.017639708,0.0002526023,0.00005568033,0.000008116414,0.000053114873,0.000012378357,0.00037123097],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983748,0.000009153054,0.00037996637,0.00042314947,0.000569393,0.00024354279],"domain_scores_gemma":[0.9982816,0.00014386159,0.00041136317,0.0006880158,0.0003559055,0.00011927585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013825578,0.00023214884,0.0007949512,0.0005679714,0.000030173365,0.000007384426,0.00030811422,0.00009956836,0.00030228944],"category_scores_gemma":[0.000023193827,0.00015904944,0.00011973821,0.0006753727,0.0006772263,0.00006361302,0.00006215729,0.00014313588,0.00001673467],"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.00005187972,0.00026466054,0.59807885,0.00018265306,0.0005027175,0.0000019824029,0.00030989075,0.002037143,0.00011519323,0.00027094124,0.000006074242,0.398178],"study_design_scores_gemma":[0.0022943588,0.0031936292,0.9286863,0.0029866693,0.0024420966,0.0000016892159,7.180965e-7,0.05208887,0.0045750425,0.0015776663,0.0014223687,0.000730564],"about_ca_topic_score_codex":0.000010041585,"about_ca_topic_score_gemma":0.000010982597,"teacher_disagreement_score":0.7622835,"about_ca_system_score_codex":0.00015256392,"about_ca_system_score_gemma":0.000266336,"threshold_uncertainty_score":0.6485848},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038280545,0.00042783792,0.98871124,0.0010289628,0.0031119748,0.00067388976,0.0000072544044,0.00024152898,0.0057590096],"genre_scores_gemma":[0.03932228,0.000028887136,0.9544982,0.005147644,0.0006455136,0.000023076016,0.000006839855,0.000031263404,0.0002963152],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959085,0.000023289691,0.00059813645,0.0017239718,0.0006802185,0.0010658787],"domain_scores_gemma":[0.9949776,0.0031301826,0.00034559664,0.0009882279,0.00039255735,0.00016583406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012757201,0.00054780114,0.0007353632,0.0010147812,0.0002824785,0.00035387563,0.0030472586,0.000699681,0.00002818011],"category_scores_gemma":[0.0006333266,0.00050281675,0.00020747338,0.00050359324,0.0009637295,0.00038256316,0.0010410651,0.0008651612,0.000051248193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000139575495,0.000023564473,0.00011977553,0.000052038573,0.00002231601,0.00017380077,0.0013519299,0.00019315832,0.000010340965,0.217355,0.000028387794,0.78065574],"study_design_scores_gemma":[0.00043669785,0.00043198792,0.0004376873,0.0007201192,0.000016859014,0.00021207292,0.0000019132844,0.055625584,0.00071495445,0.93671864,0.0037722487,0.0009112601],"about_ca_topic_score_codex":0.000016651888,"about_ca_topic_score_gemma":0.00013385025,"teacher_disagreement_score":0.77974445,"about_ca_system_score_codex":0.00019463424,"about_ca_system_score_gemma":0.00065250305,"threshold_uncertainty_score":0.9997423},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007117253,0.00053290086,0.9934235,0.0006075376,0.0034273788,0.0011522564,0.00013143153,0.0004526072,0.00020119078],"genre_scores_gemma":[0.5531091,0.000094026414,0.44314146,0.00095138507,0.0021488261,0.00006988026,0.00031537272,0.0001004649,0.00006947563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943353,0.00004371948,0.0009043964,0.0022706466,0.001041651,0.0014042874],"domain_scores_gemma":[0.99541,0.0011707124,0.0005550003,0.0019475013,0.00058421405,0.00033257346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007882578,0.00090206903,0.0008769502,0.0005042171,0.00052010245,0.0009369301,0.0038655533,0.00087243953,0.000014136846],"category_scores_gemma":[0.00031363888,0.0009137842,0.00030896039,0.00079183845,0.0010283747,0.00056178495,0.0011889746,0.0011859117,0.000019817338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003243393,0.000071971066,0.000030008,0.000116313226,0.000037603317,0.00015700767,0.0002865787,0.62230635,0.000042813015,0.10251996,0.00006438089,0.2743346],"study_design_scores_gemma":[0.00061160274,0.00024108271,0.00004855123,0.0005746365,0.000024427396,0.00010328668,1.3282815e-7,0.8577428,0.00037335034,0.1367446,0.0026209129,0.0009146463],"about_ca_topic_score_codex":0.00001051605,"about_ca_topic_score_gemma":0.000030060271,"teacher_disagreement_score":0.55303794,"about_ca_system_score_codex":0.0010368356,"about_ca_system_score_gemma":0.00075316423,"threshold_uncertainty_score":0.9993313},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045068883,0.000523803,0.81244206,0.0051596817,0.0027080672,0.0031158852,0.00017614609,0.0008214088,0.17054607],"genre_scores_gemma":[0.9934237,0.00022684348,0.0053745764,0.00030537398,0.00014238911,0.000021845646,0.000007518302,0.000017157687,0.00048061463],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970519,0.000026175176,0.00076923764,0.00046385237,0.0011308084,0.0005580545],"domain_scores_gemma":[0.99753326,0.0009837318,0.00051184243,0.0003649938,0.0005554444,0.00005075485],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014557152,0.0003080079,0.00058521476,0.0014248709,0.00036147263,0.00010519317,0.0011343319,0.00044134853,0.00003937376],"category_scores_gemma":[0.0007463644,0.00028816838,0.00009340158,0.0011999595,0.003366959,0.00034207923,0.00050069904,0.0004941826,0.00002604323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002071775,0.00019224788,0.034661468,0.00029165862,0.000068190086,0.00018456652,0.11706593,0.0021944428,0.000030655723,0.05437778,0.00034428103,0.79056805],"study_design_scores_gemma":[0.0053543174,0.0037744276,0.0122491,0.009969405,0.00018184054,0.00023130048,0.006997521,0.018941008,0.0026169077,0.80389684,0.12748915,0.008298161],"about_ca_topic_score_codex":0.00040998607,"about_ca_topic_score_gemma":0.0034285006,"teacher_disagreement_score":0.9889168,"about_ca_system_score_codex":0.00020812901,"about_ca_system_score_gemma":0.00053492596,"threshold_uncertainty_score":0.999957},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059235585,0.0012044135,0.99383354,0.0006607306,0.0014139443,0.00026935182,0.00001988598,0.00036094294,0.0016448353],"genre_scores_gemma":[0.6415509,0.0018457778,0.34848836,0.006100561,0.00080115616,0.000017220476,0.000029196124,0.000120994184,0.0010457967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960551,0.00004039344,0.0005117495,0.0017231643,0.00092484936,0.00074474467],"domain_scores_gemma":[0.9970298,0.0006746334,0.0002686829,0.0016718978,0.00010625763,0.0002487457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065427844,0.0006212652,0.00060501293,0.0007827502,0.00031425976,0.0005565319,0.0030606624,0.00035653057,0.000032959342],"category_scores_gemma":[0.00006599045,0.0005602698,0.00012255079,0.00039508208,0.00075277616,0.000693213,0.0019676934,0.0007520836,0.0000593092],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000432479,0.00003892296,0.00034644242,0.000064527325,0.000020360467,0.0007608408,0.0014834305,0.0025225857,0.000030477162,0.013763849,0.0001284199,0.9808358],"study_design_scores_gemma":[0.0007798661,0.0003721878,0.0024042164,0.0009970998,0.000013916526,0.0011908546,3.804028e-7,0.8678609,0.00049066835,0.11541258,0.008638986,0.001838331],"about_ca_topic_score_codex":0.000033735447,"about_ca_topic_score_gemma":0.000025195135,"teacher_disagreement_score":0.97899747,"about_ca_system_score_codex":0.00014154126,"about_ca_system_score_gemma":0.0003242238,"threshold_uncertainty_score":0.9996849},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024266921,0.00017123148,0.97050405,0.0019596017,0.0022628638,0.00029362232,0.000008017007,0.00010607595,0.024451887],"genre_scores_gemma":[0.19536252,0.0000072796406,0.7898507,0.0014826156,0.0012570532,0.0000110272085,0.000004460484,0.000048265978,0.0119760465],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99334085,0.00007573047,0.00087105297,0.0017452538,0.003218495,0.00074861187],"domain_scores_gemma":[0.9951458,0.0021089436,0.0004499915,0.0016415172,0.00039699048,0.00025675196],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.008365664,0.00045416082,0.0005986111,0.0012811872,0.0007955322,0.0010911227,0.0031128337,0.00048048884,0.0003348039],"category_scores_gemma":[0.0015258645,0.0003364383,0.00021944333,0.00052839186,0.0009995498,0.0003885887,0.00091097376,0.002458273,0.0005395932],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007215283,0.000083783925,0.00027053937,0.000009606613,0.000020187603,0.000038617654,0.0011404225,0.030271312,0.001328352,0.01892077,0.00013803196,0.94777113],"study_design_scores_gemma":[0.00022422409,0.00010395438,0.00010515643,0.00024309894,0.000021968692,0.000044296634,6.501689e-7,0.09052912,0.0011119053,0.87558657,0.031352505,0.00067656656],"about_ca_topic_score_codex":0.00006351451,"about_ca_topic_score_gemma":0.00015758858,"teacher_disagreement_score":0.9470946,"about_ca_system_score_codex":0.00019236306,"about_ca_system_score_gemma":0.0006852063,"threshold_uncertainty_score":0.9999458},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041209245,0.000081879865,0.993934,0.000025246633,0.0011253239,0.00023174447,0.00000980806,0.000121842604,0.00034926398],"genre_scores_gemma":[0.7150314,0.000019947369,0.2844463,0.0000788337,0.00031771435,0.0000053964914,0.00005958414,0.000033262633,0.000007598888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987385,0.0000051492743,0.00026521165,0.00049258856,0.00023752158,0.0002609881],"domain_scores_gemma":[0.99940234,0.00006796755,0.0000871206,0.00026722273,0.00010777683,0.00006757585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012888381,0.00027348506,0.00028940692,0.00040207704,0.00013959798,0.000119263204,0.00032635438,0.00021612621,0.000027150652],"category_scores_gemma":[0.000012920628,0.00024893924,0.000078427554,0.00023790076,0.00022568535,0.0002581329,0.000035335856,0.00029003053,0.000002077515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030990568,0.0000018211333,0.000039357703,0.000026004263,0.000015166624,0.0000021512342,0.00017687806,0.72337687,0.0005081263,0.004301043,8.183645e-7,0.2715487],"study_design_scores_gemma":[0.00017988616,0.000069658716,0.00016776593,0.00011525702,0.000023335295,0.00002084155,5.08103e-7,0.7682112,0.0021793647,0.22866349,0.000028154756,0.0003405765],"about_ca_topic_score_codex":0.000020702686,"about_ca_topic_score_gemma":0.000055297885,"teacher_disagreement_score":0.71091044,"about_ca_system_score_codex":0.0002018686,"about_ca_system_score_gemma":0.000046511013,"threshold_uncertainty_score":0.9999963},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019200355,0.00009513742,0.97720236,0.0014620157,0.0006173772,0.0012540519,0.000013986212,0.000033005403,0.00012173155],"genre_scores_gemma":[0.97715384,0.00006116638,0.021325294,0.0009786237,0.00017811655,0.00008683047,0.00007472011,0.00001234791,0.00012905609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986645,0.000004603395,0.00040191715,0.00042660543,0.00034955778,0.00015284138],"domain_scores_gemma":[0.99885714,0.00013180853,0.00019903794,0.0002821958,0.00052164664,0.000008170076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009128531,0.00019786609,0.00020615214,0.00025277017,0.00020685677,0.000075321084,0.00027255775,0.000070496775,0.000011368517],"category_scores_gemma":[0.00010241315,0.00014648715,0.00003263149,0.00023843917,0.00039586445,0.00029887387,0.000044454697,0.00018171864,0.000008499866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029499017,0.00006416439,0.00017005876,0.0025895173,0.00003805834,4.396113e-7,0.001304104,0.10834798,0.00012883279,0.022599729,0.000031849275,0.8646958],"study_design_scores_gemma":[0.00020749088,0.0000762361,0.0010776166,0.00032487378,0.000046483652,1.9957479e-7,0.0000074879335,0.966597,0.000400782,0.029776933,0.0012261374,0.0002587176],"about_ca_topic_score_codex":0.00005299344,"about_ca_topic_score_gemma":0.0005025649,"teacher_disagreement_score":0.9579535,"about_ca_system_score_codex":0.000043556345,"about_ca_system_score_gemma":0.000050334427,"threshold_uncertainty_score":0.5973573},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014451699,0.0012546843,0.9767873,0.0013250711,0.0043468387,0.00057144416,0.000005626715,0.00020396005,0.015360507],"genre_scores_gemma":[0.67187566,0.00045855422,0.30383357,0.008971518,0.002768581,0.00015352774,0.000023141247,0.00022120526,0.011694241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953046,0.00007533172,0.0007886969,0.0017814394,0.0011889379,0.0008610099],"domain_scores_gemma":[0.996646,0.00078020344,0.00037143411,0.0016579891,0.00033801375,0.00020639363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088131154,0.0006199788,0.0007439527,0.001377178,0.00020225685,0.0008712556,0.00446671,0.0004156442,0.0000678351],"category_scores_gemma":[0.000089322646,0.0005991101,0.00015929596,0.0010406274,0.0005746763,0.0010764287,0.00124954,0.0012705968,0.00021625853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036155583,0.00020201676,0.00090564723,0.00021619603,0.000052995303,0.0018275264,0.006235878,0.11838726,0.00029409945,0.2647517,0.00031798208,0.60677254],"study_design_scores_gemma":[0.000818858,0.00019979478,0.00023538031,0.0019487119,0.000010158643,0.0007349553,0.000002666838,0.8841721,0.00013981183,0.079047754,0.031292513,0.0013973356],"about_ca_topic_score_codex":0.00035747627,"about_ca_topic_score_gemma":0.0006852512,"teacher_disagreement_score":0.7657848,"about_ca_system_score_codex":0.0009650051,"about_ca_system_score_gemma":0.00066451414,"threshold_uncertainty_score":0.999646},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017746602,0.00016249625,0.9963219,0.00021847022,0.00014810843,0.00026040061,0.000091991096,0.000043325963,0.000978609],"genre_scores_gemma":[0.25934312,0.000018128354,0.74021304,0.00020470128,0.00015657135,0.0000013338506,0.000026836966,0.000009928897,0.00002636128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983433,0.000039910803,0.00039980692,0.0006236194,0.00038678362,0.00020659069],"domain_scores_gemma":[0.9979802,0.0006256011,0.00027354303,0.0009682884,0.00011793248,0.000034471635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006814542,0.00024097941,0.00038761357,0.0001281446,0.00014802981,0.00010675546,0.0014907282,0.0002022088,0.000020504873],"category_scores_gemma":[0.0006537454,0.00012856134,0.00005791753,0.00018037006,0.00056364556,0.0001968649,0.0007470091,0.000334091,0.0000022908773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006850037,0.00046021753,0.00009715144,0.00020513832,0.00010526104,0.000053717155,0.0013621688,0.42049983,0.017606195,0.08760913,0.0004936603,0.47143903],"study_design_scores_gemma":[0.00004934901,0.000028072827,0.000026899777,0.00014774954,0.000016017171,0.0000035582825,1.3885908e-7,0.71756625,0.0015608569,0.28046077,0.000007934596,0.00013243312],"about_ca_topic_score_codex":0.000040792722,"about_ca_topic_score_gemma":0.0000065331687,"teacher_disagreement_score":0.4713066,"about_ca_system_score_codex":0.00005588562,"about_ca_system_score_gemma":0.00012027825,"threshold_uncertainty_score":0.52425796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063323,0.00010150113,0.99392,0.00032784193,0.0024881314,0.00042900635,0.0000030328354,0.0001945631,0.001902655],"genre_scores_gemma":[0.30336025,0.0000022353972,0.69531083,0.0006908367,0.000476336,0.0000033497959,0.0000012379363,0.000025671543,0.00012922205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622077,0.000027446047,0.000543212,0.0016799922,0.00082479394,0.00070380745],"domain_scores_gemma":[0.9979679,0.0001564557,0.00020933116,0.0012775838,0.0002037328,0.00018497375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008249616,0.00046858608,0.00044791374,0.0008123931,0.00021377171,0.00058605976,0.0022218288,0.00026617452,0.0000076723545],"category_scores_gemma":[0.00007053792,0.0004783415,0.00009543556,0.0004528195,0.00038269052,0.000534081,0.0012023002,0.00058602076,0.000026744076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013819594,0.000010523326,0.00004460579,0.000037186226,0.0000045777397,0.00008467513,0.0002750422,0.38558593,0.0025163307,0.013525373,0.0000043149817,0.59791005],"study_design_scores_gemma":[0.00012623568,0.000060590748,0.0000440902,0.00053670525,0.000005819282,0.00008227584,7.5369236e-8,0.9515792,0.0019961735,0.044859827,0.00014849551,0.0005605144],"about_ca_topic_score_codex":0.00013576036,"about_ca_topic_score_gemma":0.000068179535,"teacher_disagreement_score":0.5973496,"about_ca_system_score_codex":0.00047580522,"about_ca_system_score_gemma":0.00047321242,"threshold_uncertainty_score":0.9997668},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044394255,0.00011342935,0.99091136,0.00006971641,0.00079678907,0.00034810326,4.0059723e-7,0.0005102747,0.0068059955],"genre_scores_gemma":[0.779457,0.000012853937,0.21955566,0.0000911295,0.00048785013,0.00000742824,0.000014453416,0.00010594861,0.0002677146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975974,0.000009745467,0.00042352956,0.00062442664,0.00075420673,0.0005906844],"domain_scores_gemma":[0.9990458,0.000115641196,0.00016076326,0.00042247435,0.00013347412,0.00012185736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000381879,0.0004783054,0.00038103687,0.00090778235,0.00020108088,0.00020949432,0.00043906542,0.00023022153,0.000055669043],"category_scores_gemma":[0.00003398627,0.0004626591,0.000070767695,0.00045334556,0.0002190184,0.00031462227,0.000085278225,0.0010791159,0.000029335648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009928016,0.000005042402,0.000095818905,0.00012625889,0.000011858675,0.00003807022,0.00020377312,0.98754454,0.00036845644,0.00014384733,0.0000014547713,0.011450949],"study_design_scores_gemma":[0.00039248553,0.00008402091,0.00029177289,0.0006803567,0.000010539309,0.000036636746,3.7143934e-7,0.98546284,0.011718441,0.0005439835,0.00021356625,0.00056499656],"about_ca_topic_score_codex":0.0000075085745,"about_ca_topic_score_gemma":0.000033123197,"teacher_disagreement_score":0.77901304,"about_ca_system_score_codex":0.0007442821,"about_ca_system_score_gemma":0.00012416512,"threshold_uncertainty_score":0.9997825},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021179378,0.00017474181,0.9973839,0.00024155584,0.0007031922,0.00025150232,0.0000022230656,0.00029781842,0.00073325605],"genre_scores_gemma":[0.28618035,0.000106873915,0.7122634,0.00076018024,0.0005147979,0.0000062421896,0.0000027782862,0.000040080133,0.00012530015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764603,0.000017053628,0.0003891065,0.0010074811,0.0005532837,0.0003870439],"domain_scores_gemma":[0.9984158,0.00018007822,0.00028666988,0.0007671709,0.00022294611,0.0001272777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006613901,0.00032554846,0.0003210534,0.00040543615,0.000315456,0.0006271493,0.0011619647,0.0003408339,0.0000092720675],"category_scores_gemma":[0.000039866318,0.0003033892,0.00006614912,0.00026356505,0.0004865219,0.0011861477,0.00056740054,0.00080258877,0.000006381878],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048703796,0.000025219255,0.000024752855,0.000050869003,0.000008765236,0.000034620913,0.00047865257,0.0019511279,0.015371183,0.05396651,0.0000036699166,0.9280798],"study_design_scores_gemma":[0.00008750133,0.000041413357,0.000036216934,0.00012224322,0.000005069626,0.00007990095,1.687896e-7,0.6209756,0.016395802,0.36107644,0.00080466655,0.00037497515],"about_ca_topic_score_codex":0.0000391197,"about_ca_topic_score_gemma":0.000024603161,"teacher_disagreement_score":0.9277048,"about_ca_system_score_codex":0.00014011841,"about_ca_system_score_gemma":0.0002415814,"threshold_uncertainty_score":0.9999418},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013252938,0.00075943285,0.9947812,0.0012502917,0.00069831405,0.0007230894,0.0000135815735,0.00043545553,0.000013350079],"genre_scores_gemma":[0.083415784,0.000021299653,0.915422,0.00042283247,0.0004335234,0.00002650076,0.000012656727,0.000059409947,0.0001859852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532986,0.000108952,0.0007863414,0.0016935193,0.001272443,0.0008089048],"domain_scores_gemma":[0.99164337,0.004458644,0.00026701498,0.00122346,0.0021067092,0.00030077755],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0041984725,0.00053741987,0.00064906746,0.0008245164,0.00051485165,0.00065119547,0.0018449835,0.0004871891,0.0000017859139],"category_scores_gemma":[0.013464713,0.0005116973,0.000109296874,0.0008578969,0.00038179697,0.0004890277,0.00091176666,0.0012036838,0.00000559416],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001226279,0.00002508786,0.0441348,0.00039588462,0.000062844236,0.00003013623,0.00085108884,0.0155193275,0.00031224507,0.0045682644,0.00023084598,0.9338572],"study_design_scores_gemma":[0.0027475015,0.00096899807,0.14031868,0.0018177558,0.00013382696,0.0002702986,0.000001299606,0.44522047,0.007695075,0.3899096,0.0047890013,0.006127504],"about_ca_topic_score_codex":0.000049149392,"about_ca_topic_score_gemma":0.00007040079,"teacher_disagreement_score":0.9277297,"about_ca_system_score_codex":0.00035723392,"about_ca_system_score_gemma":0.0006541788,"threshold_uncertainty_score":0.99973345},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022900852,0.00033917266,0.99370116,0.0014001783,0.0015291332,0.00086925365,0.000014442659,0.00008628668,0.0018313519],"genre_scores_gemma":[0.16811246,0.00023657146,0.8095902,0.018925413,0.0012351259,0.00005553024,0.00001722272,0.000112946764,0.001714524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564296,0.000052018237,0.00074800337,0.0014602764,0.0013103372,0.0007863917],"domain_scores_gemma":[0.9956964,0.0014871387,0.0005234988,0.001851387,0.0002932231,0.00014834446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010365311,0.00061310007,0.0006395009,0.00052691234,0.00030444525,0.00022194014,0.0031729238,0.00029004528,0.000010061144],"category_scores_gemma":[0.000103914586,0.0004493761,0.00027079106,0.00047921683,0.0004678154,0.00017238675,0.0007386012,0.0006384033,0.0000059560994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017018448,0.000042257154,0.0000015029403,0.000018754185,0.000012271152,0.000016376134,0.00025476672,0.62912184,0.00019306151,0.0165649,0.000030493407,0.35372677],"study_design_scores_gemma":[0.0005552439,0.0007522086,0.000014376237,0.0005797219,0.000014211232,0.000012155326,2.9897637e-7,0.8933935,0.0075723235,0.09465155,0.0018796896,0.0005747131],"about_ca_topic_score_codex":0.000008126341,"about_ca_topic_score_gemma":0.000022693934,"teacher_disagreement_score":0.35315207,"about_ca_system_score_codex":0.00031205063,"about_ca_system_score_gemma":0.0002807906,"threshold_uncertainty_score":0.9997958},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006524678,0.00062656926,0.9855842,0.0006740881,0.0031687971,0.00050054706,0.000045425786,0.0003619926,0.00838594],"genre_scores_gemma":[0.36509606,0.00007046207,0.62985015,0.0026092797,0.0018767053,0.0000155024,0.00006546751,0.00005954386,0.0003568221],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930774,0.0001020967,0.0009516064,0.0031976607,0.0015851159,0.0010861198],"domain_scores_gemma":[0.9948852,0.0013046334,0.0003792529,0.002113811,0.00060375954,0.0007133314],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00082942896,0.00095037924,0.00088854146,0.0010084314,0.000431389,0.0013088769,0.0072585056,0.00055024645,0.00028487545],"category_scores_gemma":[0.00020423002,0.000894143,0.00021845754,0.0012269737,0.0006699925,0.0010394971,0.0023320804,0.0011569753,0.00085635553],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013988808,0.00009226959,0.00010782668,0.0000074065315,0.000022267368,0.00018526927,0.0032954698,0.16157068,0.00008805403,0.046441168,0.00007342609,0.78810215],"study_design_scores_gemma":[0.00006348722,0.00020250633,0.000088049856,0.00022326052,0.00000876968,0.000029595329,0.0000018166979,0.47973567,0.0011035486,0.51587665,0.0019020019,0.0007646382],"about_ca_topic_score_codex":0.00044862594,"about_ca_topic_score_gemma":0.0007440831,"teacher_disagreement_score":0.78733754,"about_ca_system_score_codex":0.00049631315,"about_ca_system_score_gemma":0.0011073728,"threshold_uncertainty_score":0.9999216},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014739616,0.00010397107,0.99400556,0.00020145983,0.00018292443,0.0011132458,0.000002704225,0.00016753878,0.004075204],"genre_scores_gemma":[0.11183737,0.00008489638,0.8856673,0.0005241315,0.00021598906,0.000033438,0.000017210557,0.00006275065,0.0015569172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577606,0.00008400731,0.00060717465,0.0017708627,0.0008545179,0.00090740883],"domain_scores_gemma":[0.99815947,0.00052400527,0.0001892718,0.0007955695,0.00014271558,0.00018895135],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009983003,0.00066551997,0.00075812364,0.0010848161,0.00019791853,0.00048304527,0.0021101618,0.00043239546,0.0000067246647],"category_scores_gemma":[0.000103787184,0.00062877615,0.00014703057,0.0005964924,0.00044766534,0.0004011163,0.0005388176,0.0013492445,0.000006522696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000233383,0.000016078291,0.000025692414,0.000037836806,0.000010252023,0.000023571352,0.001860667,0.80060536,0.00011026583,0.002520967,0.0000022340291,0.19476376],"study_design_scores_gemma":[0.00072233885,0.00062587054,0.00022138833,0.00031728207,0.000009506524,0.000032250016,4.1382881e-7,0.98391265,0.000100934376,0.012997102,0.00039666917,0.0006635744],"about_ca_topic_score_codex":0.000024005996,"about_ca_topic_score_gemma":0.000012560747,"teacher_disagreement_score":0.19410019,"about_ca_system_score_codex":0.0002803612,"about_ca_system_score_gemma":0.00032096167,"threshold_uncertainty_score":0.9996164},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021968239,0.00035470145,0.9928681,0.00020545191,0.00064699765,0.00037931642,0.0000035368178,0.000080283484,0.0052419263],"genre_scores_gemma":[0.6558366,0.000018600827,0.34350723,0.00030868824,0.0002472913,0.00001350292,0.000005012674,0.0000154041,0.00004771402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717516,0.000039850984,0.0005668828,0.0011679519,0.00061070756,0.00043944526],"domain_scores_gemma":[0.99790114,0.00028214036,0.000384022,0.0010993385,0.00023550054,0.00009788188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007134963,0.0003689506,0.0004918203,0.0008684017,0.00009311635,0.00012324529,0.0020566403,0.0003228059,0.000011187452],"category_scores_gemma":[0.00004592415,0.0003465244,0.00011336523,0.0007186818,0.000656431,0.00037739764,0.00034879803,0.0004837769,0.000022114327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005675676,0.000050620147,0.0004537335,0.00003787501,0.0000037191555,0.000007684593,0.0004646735,0.05351905,0.0004865114,0.09166896,0.0000042006213,0.8532973],"study_design_scores_gemma":[0.0003308441,0.000102533086,0.00051732553,0.00014525557,0.000004060118,0.000021501402,1.6244117e-7,0.8824723,0.0022534626,0.11310156,0.0006723975,0.00037861496],"about_ca_topic_score_codex":0.000042483625,"about_ca_topic_score_gemma":0.00019219525,"teacher_disagreement_score":0.8529187,"about_ca_system_score_codex":0.00028073485,"about_ca_system_score_gemma":0.0005256223,"threshold_uncertainty_score":0.9998987},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36085835,0.000007667305,0.6386575,0.0002625361,0.000098491786,0.000084072584,0.000002495143,0.000024799412,0.0000040642826],"genre_scores_gemma":[0.5267759,0.0000026258713,0.47309282,0.00008834679,0.00003644753,1.6016457e-7,0.0000012082346,0.000002462959,5.8248602e-8],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993309,0.000007518773,0.00012503636,0.0003188104,0.0001038953,0.000113883245],"domain_scores_gemma":[0.99921584,0.0000756845,0.00006474333,0.000537309,0.00006725109,0.00003918094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016350647,0.00006228762,0.00011578266,0.00009841343,0.00007704611,0.000027241334,0.00018084356,0.00002682092,0.0000012467971],"category_scores_gemma":[0.00008449955,0.000054283428,0.000008101563,0.00037220356,0.00043275536,0.0001865164,0.000243167,0.00020681995,1.3633907e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037236575,0.0000074641416,0.0029148373,0.000011193897,8.1754274e-7,0.0000022398394,0.000051227955,0.0016286881,0.47391742,0.000020045347,9.487535e-7,0.5214414],"study_design_scores_gemma":[0.00012408881,0.0000153329,0.0034768577,0.000063426676,0.0000052361856,0.00037661672,4.6717653e-7,0.88498294,0.10911477,0.0017592655,0.000029543993,0.000051469808],"about_ca_topic_score_codex":0.000026465681,"about_ca_topic_score_gemma":0.000009782703,"teacher_disagreement_score":0.88335425,"about_ca_system_score_codex":0.0000088440365,"about_ca_system_score_gemma":0.000053424425,"threshold_uncertainty_score":0.22136138},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0849526,0.0004422315,0.90396035,0.0026917413,0.0009813511,0.0021311643,0.00040628284,0.000036769557,0.004397509],"genre_scores_gemma":[0.9909177,0.0000034994687,0.008072051,0.0007912591,0.000116894684,0.000014168965,0.0000175695,0.000008060171,0.000058830647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99625415,0.000105894724,0.0006808438,0.0010910004,0.001250904,0.00061721454],"domain_scores_gemma":[0.99827343,0.00023510265,0.00022689327,0.00077550724,0.0002427818,0.0002463111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014171496,0.0002915345,0.00075805455,0.00060878316,0.0003585914,0.000121220044,0.0019753124,0.0001318445,0.000052086445],"category_scores_gemma":[0.00014492802,0.00022034136,0.00013907239,0.0020427692,0.0005589911,0.0001548312,0.00025068392,0.00043688127,9.321803e-7],"study_design_candidate":"observational","study_design_consensus":null,"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.000052105483,0.00007562826,0.10602153,0.00020302166,0.00007673281,0.0000082961,0.20870808,0.38174853,0.0000027115002,0.0012698461,0.000008982008,0.30182454],"study_design_scores_gemma":[0.00053583813,0.00014760956,0.96738565,0.00047249204,0.0001316659,2.2215414e-7,0.0006262004,0.016223265,0.00009919017,0.010947204,0.0020297014,0.001400965],"about_ca_topic_score_codex":0.9846126,"about_ca_topic_score_gemma":0.9988806,"teacher_disagreement_score":0.9059651,"about_ca_system_score_codex":0.0033198188,"about_ca_system_score_gemma":0.011048847,"threshold_uncertainty_score":0.99455756},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021490388,0.0002907799,0.99728376,0.00006244892,0.0005428994,0.00065246987,0.0000066702746,0.000401562,0.00054451387],"genre_scores_gemma":[0.22542526,0.0001772611,0.7740445,0.00010765511,0.00017087067,0.000012946756,0.0000089686355,0.000032299988,0.000020233681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968443,0.000057930825,0.0005120809,0.001384542,0.0006280308,0.000573096],"domain_scores_gemma":[0.9982765,0.0001811134,0.00037384042,0.0008187653,0.00022116155,0.0001286532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004769263,0.0005754507,0.0004878089,0.0012575367,0.00060472824,0.0003958455,0.0014054332,0.00040781492,0.0000029412981],"category_scores_gemma":[0.000019348963,0.00053758296,0.00010209823,0.00060254516,0.00065566675,0.0013180035,0.0010164178,0.0007089539,0.0000014799336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004188019,0.00009427403,0.00070736033,0.00026888595,0.000061252525,0.00071508787,0.005796586,0.113970116,0.02119464,0.012165578,0.000012227324,0.84497213],"study_design_scores_gemma":[0.00030176714,0.00029922824,0.00017494346,0.0013757327,0.00001886361,0.0011231732,2.8804342e-7,0.77553767,0.06039833,0.15870693,0.00045823134,0.0016048227],"about_ca_topic_score_codex":0.000019856778,"about_ca_topic_score_gemma":0.0000057562665,"teacher_disagreement_score":0.8433673,"about_ca_system_score_codex":0.00033863814,"about_ca_system_score_gemma":0.00018216092,"threshold_uncertainty_score":0.9997076},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.678693,0.0067557455,0.20042294,0.052449334,0.0052575544,0.006695616,0.0011323396,0.00041441707,0.048179045],"genre_scores_gemma":[0.99693066,0.000083910716,0.0018991545,0.00048169505,0.0004541945,0.0000037950433,0.000029322711,8.104242e-7,0.000116486786],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986975,0.000027122194,0.00028518884,0.0004037589,0.00035266727,0.0002337671],"domain_scores_gemma":[0.9994328,0.00019592469,0.00013525855,0.00013561704,0.00006258962,0.00003779437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030880826,0.0001631131,0.00020648965,0.00005174004,0.00012529755,0.0000611281,0.0007366175,0.00015171786,0.00003553066],"category_scores_gemma":[0.000024843266,0.000060705872,0.000075143784,0.00037514194,0.0003048972,0.00007131766,0.00007348282,0.00028112554,0.0000035831274],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014031285,0.0001285059,0.0012311825,0.000012826829,0.000008238257,0.000033942455,0.0012256346,0.009888658,0.023108797,0.0065724924,0.000016375987,0.9577593],"study_design_scores_gemma":[0.00038159126,0.0014699819,0.6173873,0.0004107209,0.000028091537,0.0001327856,0.0000044539324,0.010276661,0.0007156896,0.35549596,0.013051352,0.000645439],"about_ca_topic_score_codex":0.00009291964,"about_ca_topic_score_gemma":0.0012298875,"teacher_disagreement_score":0.95711386,"about_ca_system_score_codex":0.00004186657,"about_ca_system_score_gemma":0.000042490323,"threshold_uncertainty_score":0.24755137},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004235902,0.00042716102,0.9908499,0.00065543025,0.0028367052,0.0004493231,0.000004697198,0.00040464746,0.00013624753],"genre_scores_gemma":[0.05497018,0.0000092791115,0.9440593,0.00050226937,0.00030592,0.000011287711,0.000001953949,0.000028578188,0.00011122225],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956759,0.000091899994,0.0004813663,0.002061276,0.0009928964,0.0006966433],"domain_scores_gemma":[0.9945493,0.0032740256,0.00022262085,0.0013558523,0.0003833839,0.0002148587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00432906,0.0005792443,0.0006282184,0.00072869845,0.00033141993,0.00042874168,0.0022423286,0.00037265776,0.000004441805],"category_scores_gemma":[0.0028329282,0.000537371,0.00008085838,0.0007751616,0.00049186463,0.0006869841,0.0025743803,0.0011090416,0.0000071860977],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010291961,0.0000069572143,0.00019259023,0.000053358348,0.0000068975414,0.00001359673,0.00044390486,0.26547307,0.0006467789,0.0012167478,0.0000031921286,0.73193264],"study_design_scores_gemma":[0.00058521464,0.00084481045,0.0063117296,0.0017065256,0.000027586453,0.00026808228,0.000003762019,0.3276452,0.020696886,0.6381272,0.00088425225,0.0028987331],"about_ca_topic_score_codex":0.000016862843,"about_ca_topic_score_gemma":0.00002802223,"teacher_disagreement_score":0.7290339,"about_ca_system_score_codex":0.0005154992,"about_ca_system_score_gemma":0.0004261915,"threshold_uncertainty_score":0.99970776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005199479,0.00009842831,0.9931458,0.00072792737,0.0010375007,0.00057748856,0.000004607514,0.000255813,0.003632443],"genre_scores_gemma":[0.056738336,0.000029541632,0.94195455,0.0005242754,0.00042473042,0.000020565429,0.0000123008185,0.000036285815,0.00025941836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971735,0.000014014642,0.00042356332,0.0012245453,0.0006486565,0.0005157148],"domain_scores_gemma":[0.9983961,0.00017398389,0.00032090847,0.000570535,0.00039999295,0.00013846881],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031774197,0.00045765497,0.00038668668,0.0007555833,0.00036310114,0.000635101,0.0011154334,0.00027030945,0.000027072045],"category_scores_gemma":[0.000050760736,0.00040627434,0.000086088505,0.0007062676,0.0005789965,0.0011726493,0.00025623944,0.0004972705,0.000009843583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019473639,0.000018405277,0.00007159279,0.000048232687,0.000010843717,0.000019988702,0.000531828,0.395354,0.00011355375,0.0055909725,0.0000020901273,0.59821904],"study_design_scores_gemma":[0.000691371,0.00043449792,0.00007483539,0.00051305507,0.000016156908,0.000473,0.0000020801783,0.97677684,0.0023245732,0.016463973,0.0014111464,0.0008184696],"about_ca_topic_score_codex":0.000008732376,"about_ca_topic_score_gemma":0.00006286055,"teacher_disagreement_score":0.59740055,"about_ca_system_score_codex":0.00024400021,"about_ca_system_score_gemma":0.00060795783,"threshold_uncertainty_score":0.9998389},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00847925,0.00038635414,0.9873866,0.00056755525,0.00017805747,0.00026899006,0.000008308969,0.000022509681,0.0027023812],"genre_scores_gemma":[0.9291702,0.000028354874,0.070405476,0.00030218338,0.000045754034,0.0000035236953,0.000001478678,0.0000063543625,0.000036684618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982911,0.000029650455,0.0004692728,0.0004127889,0.0004966322,0.00030057476],"domain_scores_gemma":[0.99787253,0.0010638993,0.00031498502,0.00058304577,0.00012358806,0.000041957654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013354768,0.00021033564,0.00031612828,0.00061875157,0.00014621747,0.00008911585,0.0013120918,0.00014752215,0.00000248241],"category_scores_gemma":[0.000048888134,0.00016043756,0.00004800022,0.00043081262,0.00061616773,0.00031353722,0.0001707361,0.0005217187,0.000001941888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021525977,0.000099401914,0.008049987,0.00035547442,0.00002317281,0.000018436573,0.01810399,0.44105834,0.00046658498,0.037644267,0.000017964641,0.49414086],"study_design_scores_gemma":[0.0003654351,0.00026645747,0.012356332,0.0006947813,0.000011321905,0.00007254294,0.000004781021,0.97273284,0.0008623892,0.012086827,0.0002000788,0.00034621722],"about_ca_topic_score_codex":0.00008740854,"about_ca_topic_score_gemma":0.00006970775,"teacher_disagreement_score":0.92069095,"about_ca_system_score_codex":0.000042953314,"about_ca_system_score_gemma":0.00020937294,"threshold_uncertainty_score":0.6542454},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017398808,0.00050451,0.99363875,0.000232771,0.00056018494,0.0005812805,0.0000028178501,0.00008377297,0.0026560503],"genre_scores_gemma":[0.7589009,0.000038652393,0.24041879,0.00025410298,0.00028422647,0.000016260741,0.0000045323773,0.000017246755,0.000065285225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99543357,0.00017899291,0.0005787056,0.001408801,0.00180236,0.000597584],"domain_scores_gemma":[0.997504,0.0005611882,0.0004365536,0.0007635829,0.0005818379,0.000152871],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028820627,0.0004826578,0.0006491576,0.0003609578,0.00029380948,0.0003053656,0.0013446312,0.00028027207,0.000012081323],"category_scores_gemma":[0.00010281343,0.00043567974,0.000083057574,0.00044055597,0.00055671163,0.00036379864,0.0007057003,0.0009997014,0.000012628056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052681175,0.000022942962,0.000013111538,0.000014091675,0.000010042858,0.00000515347,0.0009783235,0.65113366,0.000012595576,0.015626073,0.0000045548204,0.33217415],"study_design_scores_gemma":[0.000297082,0.00031678792,0.00019808258,0.0004909495,0.000021809221,0.00003274953,3.693394e-7,0.8318276,0.000089677465,0.16631225,0.000044086748,0.00036855703],"about_ca_topic_score_codex":0.000016644208,"about_ca_topic_score_gemma":0.0000619386,"teacher_disagreement_score":0.757161,"about_ca_system_score_codex":0.0003391191,"about_ca_system_score_gemma":0.0006643148,"threshold_uncertainty_score":0.9998095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019155252,0.00025250914,0.9946199,0.0009383373,0.0006458174,0.00076262513,0.0000074125846,0.0004942083,0.002260019],"genre_scores_gemma":[0.033375487,0.000054899774,0.9631895,0.0016724629,0.00020272774,0.000050139573,0.000022675025,0.000034694272,0.001397439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960143,0.000043019478,0.00071256445,0.0016826444,0.0007984003,0.0007490447],"domain_scores_gemma":[0.9964714,0.00070259627,0.00045634588,0.0016494591,0.00052022317,0.0001999567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090076576,0.0005746875,0.000822917,0.001769176,0.00035366154,0.0010324034,0.0036460862,0.0003354816,0.000043582888],"category_scores_gemma":[0.000113837355,0.00052981096,0.00034202432,0.0013890661,0.00043384137,0.0005477219,0.0008652295,0.00047730972,0.000046116147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051063353,0.00003956604,0.000043767523,0.00004931225,0.00014861829,0.000016649661,0.0007127041,0.6676703,0.000013860872,0.07222099,0.00038014693,0.25869894],"study_design_scores_gemma":[0.00017366526,0.00010587267,0.000053198186,0.000069289425,0.000039179562,0.0000068403324,6.1721344e-8,0.7626124,0.00015571418,0.23473227,0.0015429299,0.00050860085],"about_ca_topic_score_codex":0.000038124963,"about_ca_topic_score_gemma":0.0000347774,"teacher_disagreement_score":0.25819033,"about_ca_system_score_codex":0.0002588989,"about_ca_system_score_gemma":0.0004396974,"threshold_uncertainty_score":0.9997153},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70893353,0.000017651533,0.28953263,0.0002560375,0.00047294356,0.00049578253,0.0000044450253,0.000014543416,0.00027245426],"genre_scores_gemma":[0.99751246,0.000007718246,0.0020468247,0.0002130465,0.00010325734,0.000005348929,9.906101e-7,0.0000138134355,0.0000965555],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981326,0.00015569676,0.00036204784,0.0005528397,0.0005748726,0.00022194082],"domain_scores_gemma":[0.9970935,0.0021376384,0.00020813486,0.0004652111,0.00006528808,0.00003024148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001756816,0.00019719286,0.00029312584,0.00033559476,0.00013044385,0.00005191915,0.00048217634,0.00022492769,0.00002798671],"category_scores_gemma":[0.0012663205,0.0001281161,0.00008261869,0.0002652678,0.0007508023,0.00011909728,0.00013297818,0.00065943575,0.00000921534],"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.00005548381,0.000061376864,0.001108792,0.00021044993,0.0000014121014,0.0000025537831,0.0028985762,0.022565365,0.7667333,0.0012625665,0.0000019775507,0.20509812],"study_design_scores_gemma":[0.0012550214,0.0034717657,0.019829627,0.0025074854,0.000023054641,0.000020240632,0.000002749729,0.3299602,0.59340435,0.04838543,0.00030273848,0.0008373039],"about_ca_topic_score_codex":0.000024011415,"about_ca_topic_score_gemma":0.00003907686,"teacher_disagreement_score":0.30739483,"about_ca_system_score_codex":0.00008374959,"about_ca_system_score_gemma":0.00008169851,"threshold_uncertainty_score":0.5224423},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017396916,0.00027571718,0.9904086,0.0004756596,0.0017859424,0.0017652283,0.0000062194235,0.00039014575,0.0048907483],"genre_scores_gemma":[0.0027022199,0.000028786424,0.9931371,0.0011936455,0.0009194002,0.00010576868,0.0000141442715,0.000049600534,0.0018493125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99524415,0.000018534383,0.0006374849,0.002074638,0.0010519521,0.0009732319],"domain_scores_gemma":[0.99695235,0.00027898577,0.0003730663,0.0018284263,0.00031978855,0.00024740587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010534005,0.00070264784,0.00066605286,0.00074870104,0.0002854019,0.0007375583,0.0048880726,0.00046592136,0.00003943254],"category_scores_gemma":[0.00007428028,0.0006618621,0.00019609541,0.00041957418,0.0004891148,0.00072812475,0.0012475287,0.001041788,0.00002319832],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068021536,0.000042895386,0.0000013026021,0.000044986933,0.000013792462,0.00001194235,0.0003012751,0.00025327734,0.0073234257,0.018712306,0.00019075886,0.9730972],"study_design_scores_gemma":[0.00088033365,0.0005925496,0.0000064829806,0.00028827268,0.000019995547,0.00006386961,1.0187839e-7,0.5261726,0.22017609,0.2370033,0.0132645015,0.0015318991],"about_ca_topic_score_codex":0.000023128818,"about_ca_topic_score_gemma":0.000021146128,"teacher_disagreement_score":0.9715653,"about_ca_system_score_codex":0.0003313472,"about_ca_system_score_gemma":0.00097322353,"threshold_uncertainty_score":0.99958324},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016295277,0.00007299876,0.9944401,0.0015382465,0.00095906825,0.00036807972,0.000006215577,0.00010363514,0.002348742],"genre_scores_gemma":[0.6276115,0.000019547417,0.36696583,0.0023985463,0.00164568,0.000013107847,0.000025619343,0.000046962352,0.0012732203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969997,0.000029672292,0.00039161454,0.00095350895,0.0011982785,0.00042726047],"domain_scores_gemma":[0.99856275,0.00016019607,0.0003416955,0.0006055658,0.0002273515,0.000102409016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046269817,0.00038145544,0.00037547914,0.00043371008,0.00034325157,0.00038746334,0.0016089843,0.0002301587,0.000036105113],"category_scores_gemma":[0.000012240874,0.00032342307,0.000079221376,0.00030538614,0.00035592465,0.0005783637,0.00045574337,0.00042169957,0.00007400897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026446474,0.00017435681,0.0016049874,0.0001485281,0.000106429754,0.00016141619,0.0066214358,0.035337687,0.00016889893,0.19179536,0.00045622123,0.76339823],"study_design_scores_gemma":[0.0014104437,0.00026445457,0.0033929984,0.0004624266,0.000024221457,0.00010814888,5.1407505e-7,0.95675176,0.00068599987,0.02230062,0.013245733,0.0013526581],"about_ca_topic_score_codex":0.000018277931,"about_ca_topic_score_gemma":0.00009277834,"teacher_disagreement_score":0.9214141,"about_ca_system_score_codex":0.0003396337,"about_ca_system_score_gemma":0.00039023545,"threshold_uncertainty_score":0.9999218},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010594305,0.0028907827,0.9922029,0.0013090641,0.0012205881,0.00027815055,0.0000037054604,0.001015058,0.0009738167],"genre_scores_gemma":[0.054981336,0.00004516214,0.94250363,0.0017906987,0.0004339197,0.000005217975,0.000006313825,0.00002205958,0.00021164694],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619424,0.000035549267,0.000517939,0.0015313232,0.001165794,0.0005551355],"domain_scores_gemma":[0.9974281,0.0004623808,0.0004188132,0.001339749,0.00020927425,0.00014165358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055480294,0.0005314974,0.0005085829,0.0007573248,0.00022839518,0.0009821234,0.0039802813,0.00046570998,0.00004881344],"category_scores_gemma":[0.00014096014,0.00045789,0.00012329935,0.0005838517,0.0004222327,0.0012772185,0.0007498386,0.0011767694,0.000051333183],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012457635,0.000017946135,0.000008603425,0.000013826063,0.000004762316,0.00010154709,0.00030814682,0.0002459623,0.00051829696,0.005465375,0.000025396423,0.9932889],"study_design_scores_gemma":[0.00007276598,0.000094971314,0.000053994463,0.0005869877,0.000006607732,0.00005811199,9.3202836e-8,0.3280716,0.005182772,0.6649761,0.00040436987,0.0004916286],"about_ca_topic_score_codex":0.00009247086,"about_ca_topic_score_gemma":0.000056602603,"teacher_disagreement_score":0.99279726,"about_ca_system_score_codex":0.00032437537,"about_ca_system_score_gemma":0.0003839391,"threshold_uncertainty_score":0.9997873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028631657,0.0003589116,0.9941111,0.0006476823,0.0010997248,0.00073960726,0.00000520896,0.000050016588,0.00012454874],"genre_scores_gemma":[0.4715153,0.000004638324,0.52723444,0.00091278506,0.00026439156,0.000010209665,0.000014192242,0.000018990324,0.000025059631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996665,0.00011359547,0.00078913674,0.001130922,0.0007832618,0.0005180624],"domain_scores_gemma":[0.9971006,0.001149557,0.0004447016,0.0008188354,0.0003826981,0.00010359582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016457369,0.0003919403,0.000463517,0.00059364503,0.00031163235,0.00026591722,0.001607359,0.00019710303,0.000008975721],"category_scores_gemma":[0.00021162225,0.00032568793,0.00014211655,0.0007742271,0.00029990164,0.00047878077,0.00041681906,0.0004536798,0.0000030894166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007767713,0.000063894084,0.0000636808,0.000031802552,0.000006730584,0.000004583873,0.0005905272,0.5325614,0.00061477313,0.024758898,0.000024053617,0.4412719],"study_design_scores_gemma":[0.00032672434,0.0002656843,0.00026203634,0.00020172032,0.0000064466117,0.000025635247,0.0000010798564,0.90136164,0.0019081621,0.09517606,0.00013417946,0.0003305995],"about_ca_topic_score_codex":0.000077567085,"about_ca_topic_score_gemma":0.00041230296,"teacher_disagreement_score":0.46865216,"about_ca_system_score_codex":0.0002145978,"about_ca_system_score_gemma":0.0004266207,"threshold_uncertainty_score":0.99991953},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008580059,0.0026886868,0.99471927,0.00006515903,0.0012322558,0.00050947897,0.0000024736637,0.00043421958,0.00026262892],"genre_scores_gemma":[0.10211455,0.00016214557,0.8966921,0.00014351352,0.00078988157,0.000012561737,0.0000029612604,0.00005947573,0.000022823793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978335,0.000013189062,0.00031837611,0.0005850173,0.00025795927,0.0009919887],"domain_scores_gemma":[0.9982204,0.0010362926,0.000045070472,0.00050629367,0.00008359544,0.00010837803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047713483,0.0003948434,0.00046536617,0.00028691525,0.00013640855,0.000067526475,0.0009184954,0.0007152663,0.000024196524],"category_scores_gemma":[0.000081586084,0.00035314876,0.00008076213,0.000259875,0.0010386477,0.00015331668,0.00041728877,0.001006448,0.0000074552554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000461917,0.0000032406083,0.0000057555035,0.000014791449,0.0000056391887,0.000007657973,0.00001711076,0.7306565,0.00007713999,0.004719426,0.000006327544,0.26448178],"study_design_scores_gemma":[0.00009376414,0.00008504832,0.000007289289,0.000085794796,0.000009026763,0.00003133752,1.1863876e-7,0.9244181,0.0004202012,0.07399256,0.00047889608,0.0003778571],"about_ca_topic_score_codex":0.0000011579447,"about_ca_topic_score_gemma":0.0000044768576,"teacher_disagreement_score":0.26410392,"about_ca_system_score_codex":0.00030500305,"about_ca_system_score_gemma":0.000053301465,"threshold_uncertainty_score":0.99989206},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095774117,0.0005262192,0.987522,0.00009071644,0.00023332027,0.00042367828,0.000010520181,0.00004089281,0.01019491],"genre_scores_gemma":[0.38015658,0.00016216114,0.6193685,0.000080746206,0.00012547299,0.0000059699537,0.000042295917,0.000017772873,0.00004050739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691164,0.000050144612,0.0005700186,0.0016509669,0.00043754064,0.00037967818],"domain_scores_gemma":[0.997089,0.00027707568,0.0003897711,0.0020753834,0.00009601132,0.00007270743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001132661,0.00033620733,0.00046604846,0.00086703914,0.00012160014,0.00031331755,0.0030208838,0.00018620877,6.938487e-7],"category_scores_gemma":[0.000026783579,0.00030658676,0.000035013218,0.0012449062,0.0004580269,0.0012611785,0.002075234,0.0003634991,0.0000012202535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068633117,0.000089910136,0.0014684496,0.000114759336,0.000007077371,0.000011346748,0.0014633494,0.02450746,0.00011151321,0.027483767,0.0000067919336,0.94472873],"study_design_scores_gemma":[0.00016577278,0.0000326026,0.0017183243,0.00023404032,0.0000069041216,0.00002615777,6.3577096e-7,0.97513556,0.000028560215,0.022126205,0.00020130616,0.0003239028],"about_ca_topic_score_codex":0.0002334215,"about_ca_topic_score_gemma":0.00038574068,"teacher_disagreement_score":0.9506281,"about_ca_system_score_codex":0.00019734693,"about_ca_system_score_gemma":0.0003441342,"threshold_uncertainty_score":0.9999386},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057690236,0.00009644003,0.9969929,0.000043608732,0.0006469617,0.00012922451,0.000009357428,0.000042688112,0.0014619175],"genre_scores_gemma":[0.9752166,0.000051532235,0.024226882,0.00015697541,0.00019273713,0.0000019623499,0.00006201523,0.00003142934,0.000059859954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986337,0.00001096922,0.0003845252,0.00037346466,0.00040534194,0.00019198883],"domain_scores_gemma":[0.99907815,0.00016595224,0.00013643992,0.0004246597,0.00014747899,0.00004729856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020294859,0.00022078704,0.00038187843,0.000758464,0.000051188155,0.000077132754,0.0003057803,0.00019281775,0.000033071243],"category_scores_gemma":[0.000091875474,0.00022108926,0.00010509158,0.00071023096,0.00016720564,0.00009302157,0.000031446238,0.00021125341,0.0000021438243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018981794,0.0000049301584,0.00002920167,0.000029254812,0.00003926373,0.000004674406,0.000110976776,0.91565055,0.0002340839,0.0010238594,0.000008448571,0.082862884],"study_design_scores_gemma":[0.0000778672,0.00001956053,0.00036267348,0.000074513344,0.00010449607,0.0000015835994,6.5091555e-8,0.99415964,0.001244901,0.0034913488,0.0002318064,0.0002315677],"about_ca_topic_score_codex":0.00004584092,"about_ca_topic_score_gemma":0.0003428984,"teacher_disagreement_score":0.9746397,"about_ca_system_score_codex":0.000116377494,"about_ca_system_score_gemma":0.00008051164,"threshold_uncertainty_score":0.90157586},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000043517325,0.00055507926,0.9904555,0.0015421774,0.00091884664,0.00056731,0.0000032179835,0.00010295642,0.005850548],"genre_scores_gemma":[0.0013629844,0.00027213217,0.99568665,0.0017239605,0.00026076008,0.000014846011,0.000009319886,0.000041201773,0.0006281303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949123,0.0001548861,0.0008550797,0.0017238387,0.0014941607,0.0008596887],"domain_scores_gemma":[0.9969535,0.00068161904,0.00033932604,0.001341988,0.00046401646,0.00021958564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024112863,0.00047841977,0.0006172439,0.0016582906,0.00021800105,0.0008111069,0.0028112885,0.0003358567,0.00011308717],"category_scores_gemma":[0.00071199634,0.00048668933,0.00008953035,0.0016502013,0.00044360713,0.00071012456,0.00096505333,0.0010146925,0.000041918967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018159122,0.00001596205,0.000027263053,0.000032854532,0.0000035549879,0.00015684158,0.00017752321,0.77054954,0.0000072516136,0.010638399,0.000020832917,0.21836817],"study_design_scores_gemma":[0.00030531234,0.000057064928,0.000045000546,0.00040338712,0.0000027009737,0.000055348675,1.0566324e-7,0.9805203,0.000081148304,0.016943019,0.0010982099,0.0004883966],"about_ca_topic_score_codex":0.000022455919,"about_ca_topic_score_gemma":0.000012980912,"teacher_disagreement_score":0.21787977,"about_ca_system_score_codex":0.0006087617,"about_ca_system_score_gemma":0.0007429732,"threshold_uncertainty_score":0.9997585},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018317868,0.0018208518,0.98071533,0.00068642513,0.0010399069,0.00031632325,0.0000042601578,0.000085624415,0.015148099],"genre_scores_gemma":[0.12602481,0.00028304473,0.87073463,0.0012111309,0.00045191622,0.000015376392,0.0000081082035,0.000050878254,0.0012201235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677813,0.00009832816,0.00048337114,0.0010665684,0.0009409288,0.00063269597],"domain_scores_gemma":[0.99704385,0.0004556448,0.00044109928,0.0015263556,0.00040173644,0.0001313211],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001182687,0.00044814785,0.00052625814,0.00034755367,0.00055114535,0.00037407846,0.0032463467,0.00023120671,0.000007735849],"category_scores_gemma":[0.000112407986,0.00027710706,0.00013320877,0.0005950892,0.003171959,0.00029791135,0.00077843113,0.00057684135,0.00001654571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015789676,0.00003089972,0.00007541486,0.0000308053,0.000020400812,0.000021148297,0.00038589927,0.0019290906,0.000055877026,0.87940794,0.00010128764,0.117925435],"study_design_scores_gemma":[0.00058203866,0.0003707615,0.00047302985,0.00033628283,0.000017494407,0.00011135174,3.4831294e-7,0.20559554,0.0018620922,0.7816731,0.008233041,0.00074494694],"about_ca_topic_score_codex":0.00004042156,"about_ca_topic_score_gemma":0.00021322041,"teacher_disagreement_score":0.20366645,"about_ca_system_score_codex":0.00020617404,"about_ca_system_score_gemma":0.00045889895,"threshold_uncertainty_score":0.9999681},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028362818,0.000119208744,0.9690238,0.00076824706,0.0012835424,0.0003150294,0.0000011097393,0.00011828275,0.000007946176],"genre_scores_gemma":[0.48775136,0.0000015941015,0.5116336,0.0005629818,0.00003979395,0.000006518989,5.9793933e-7,0.000003270362,2.798807e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975983,0.000071937146,0.00042760398,0.0007919425,0.0003795208,0.0007306999],"domain_scores_gemma":[0.998082,0.0010836693,0.000114838425,0.00047660424,0.00016431377,0.00007859468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031102046,0.0002104312,0.0003046446,0.000574246,0.00021239735,0.0002598948,0.0016236521,0.00014268178,5.691365e-7],"category_scores_gemma":[0.0004816896,0.00018255971,0.00005671125,0.0012828816,0.00025806238,0.00067913544,0.0003862659,0.00035003544,0.0000017389647],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055598266,0.00007739319,0.0024565475,0.000006048891,0.000002031299,0.000026574546,0.003252269,0.0038716749,0.0016398372,0.00097505166,0.0000013554395,0.9876857],"study_design_scores_gemma":[0.0006510735,0.000098211785,0.05072104,0.00006456791,0.0000014022356,0.000036093603,0.000011094873,0.90581495,0.011374742,0.03099541,0.000008953068,0.00022248132],"about_ca_topic_score_codex":0.00038432475,"about_ca_topic_score_gemma":0.0062465686,"teacher_disagreement_score":0.9874632,"about_ca_system_score_codex":0.0001827907,"about_ca_system_score_gemma":0.00018632032,"threshold_uncertainty_score":0.7444569},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048746084,0.00033021887,0.99662566,0.00031772954,0.00035696843,0.0008943006,0.000009191498,0.00015343519,0.0008250545],"genre_scores_gemma":[0.30327788,0.000028104716,0.69633305,0.00009246687,0.00016694379,0.000023207915,0.0000023099549,0.000017620841,0.00005843177],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975145,0.000029215842,0.0006152595,0.0009650838,0.0005463233,0.0003296462],"domain_scores_gemma":[0.9977131,0.0005226696,0.00042460862,0.0008961933,0.00034493406,0.000098526085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010395068,0.0003029645,0.0004048606,0.0006476631,0.00013476925,0.000268608,0.0014578009,0.00022672642,0.0000070500496],"category_scores_gemma":[0.00008487252,0.00030034906,0.00008188594,0.00026978014,0.0006893977,0.00047344534,0.00037735698,0.00027680988,0.000004054789],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052745804,0.000038610327,0.000106863285,0.00012141449,0.000021143616,0.0000058105015,0.0015114584,0.0051396796,0.0057781665,0.21194175,0.000016751537,0.7753131],"study_design_scores_gemma":[0.00071998144,0.00060614554,0.00027255766,0.0017571071,0.000032609358,0.00012087605,9.3490604e-7,0.38543257,0.20906898,0.3994626,0.0011761305,0.0013494771],"about_ca_topic_score_codex":0.00000749387,"about_ca_topic_score_gemma":0.0000067438646,"teacher_disagreement_score":0.77396363,"about_ca_system_score_codex":0.0001762665,"about_ca_system_score_gemma":0.00028892737,"threshold_uncertainty_score":0.99994487},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000028234924,0.00030893294,0.99489796,0.00041381657,0.0006062207,0.0003848045,0.000007155776,0.000882709,0.0024955706],"genre_scores_gemma":[0.00872683,0.00003864281,0.9869202,0.0037858372,0.00032953534,0.000017987748,0.0000068855734,0.00006173178,0.00011239444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99483436,0.00003854666,0.0005752534,0.0021830816,0.0014786657,0.00089011],"domain_scores_gemma":[0.99631333,0.00059932156,0.00038361325,0.0020971587,0.0003740486,0.00023252133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006454876,0.00074737624,0.00064212846,0.0012370946,0.0004844029,0.00058239436,0.0045263376,0.00035443006,0.000012697361],"category_scores_gemma":[0.00019266515,0.00070444815,0.00017055628,0.0009030019,0.0009401782,0.0008658148,0.001205107,0.0011616193,0.000038770275],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036321658,0.000036640675,0.000008508904,0.000021473494,0.0000030713734,0.00020861434,0.00016296392,0.01807734,0.00007650922,0.0006672906,0.00006949273,0.9806645],"study_design_scores_gemma":[0.00018808333,0.00016898265,0.000018015786,0.0004994186,0.0000032775795,0.000080464444,2.8303635e-8,0.8665597,0.003345043,0.12579373,0.0026302945,0.0007129936],"about_ca_topic_score_codex":0.000010288181,"about_ca_topic_score_gemma":0.0000043649925,"teacher_disagreement_score":0.97995144,"about_ca_system_score_codex":0.0004948418,"about_ca_system_score_gemma":0.0008745327,"threshold_uncertainty_score":0.9995407},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010841062,0.00022895525,0.99601704,0.000112226066,0.0018391458,0.00056989293,0.000010223989,0.00009648525,0.0010176225],"genre_scores_gemma":[0.052640717,0.00005088896,0.9466215,0.00025238024,0.00027263255,0.0000297715,0.000011013021,0.000022684333,0.000098441626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687153,0.000037458278,0.00067165744,0.0010934914,0.00096721377,0.00035863993],"domain_scores_gemma":[0.99529177,0.002115012,0.00053295365,0.0011377902,0.00085421663,0.000068257934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011238146,0.00035908862,0.00044379995,0.00059777644,0.0002640231,0.00017320011,0.0019457357,0.0003015451,0.000011001707],"category_scores_gemma":[0.0011318775,0.00030907808,0.00011596781,0.0006682525,0.0005069786,0.00084178196,0.00062079163,0.00029714475,0.0000065313857],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003772157,0.000027697017,0.00003295041,0.00021063909,0.00000719386,7.717717e-7,0.0005811911,0.1347706,0.00057168707,0.071546465,0.00004047376,0.7921726],"study_design_scores_gemma":[0.00030140873,0.000202613,0.0002737833,0.0006842541,0.000008580082,0.000009705685,2.5310086e-7,0.6441487,0.007673176,0.34259206,0.0037149428,0.00039050195],"about_ca_topic_score_codex":0.0000065477075,"about_ca_topic_score_gemma":0.0000131701145,"teacher_disagreement_score":0.7917821,"about_ca_system_score_codex":0.00013157944,"about_ca_system_score_gemma":0.000513587,"threshold_uncertainty_score":0.9999361},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044100772,0.0002401878,0.9977821,0.00015468016,0.0005560048,0.0004251208,0.0000045672687,0.00005265329,0.00034367104],"genre_scores_gemma":[0.01661429,0.000004184249,0.9827827,0.00037871706,0.00012902166,0.000012160283,0.0000110864985,0.00002792004,0.00003990286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855024,0.000027027818,0.00039707392,0.00037580845,0.00038829644,0.00026154128],"domain_scores_gemma":[0.9987894,0.0006720549,0.00010848451,0.00023601344,0.00012308665,0.0000709292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079114095,0.00022805136,0.00030412574,0.00030941653,0.000047239286,0.000026660131,0.00021503707,0.00015568022,0.000045055644],"category_scores_gemma":[0.000091471324,0.00022122187,0.0000793361,0.0002414874,0.00014038419,0.000069976115,0.000032097036,0.00023167099,0.0000018206506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000080612,0.000004473264,0.00003479835,0.00006691523,0.000013183249,8.064262e-7,0.000089736226,0.70080787,0.0103982985,0.004703468,0.000020033734,0.28385234],"study_design_scores_gemma":[0.00019112059,0.00017898288,0.00010489925,0.000072153736,0.000011178734,0.0000033331187,2.0581862e-8,0.7837858,0.028129673,0.18716964,0.00016815524,0.0001850061],"about_ca_topic_score_codex":0.0000053288795,"about_ca_topic_score_gemma":0.000017603243,"teacher_disagreement_score":0.28366733,"about_ca_system_score_codex":0.0001588568,"about_ca_system_score_gemma":0.000085674554,"threshold_uncertainty_score":0.9021166},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003676668,0.00011230932,0.998175,0.0000980536,0.00033436087,0.0005553582,0.00001860948,0.00001853834,0.00032005424],"genre_scores_gemma":[0.3895659,0.000013811404,0.6079635,0.0011170073,0.0005305801,0.00007518777,0.0005113745,0.000045405606,0.00017720784],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984581,0.00001356782,0.00021775927,0.00089373725,0.00017366654,0.00024318455],"domain_scores_gemma":[0.9990333,0.000010397344,0.00015799896,0.000574955,0.00014137365,0.000082022714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002247621,0.00024862742,0.00016122243,0.00015730184,0.00011684052,0.00011804736,0.0005187435,0.0002596404,0.000008235819],"category_scores_gemma":[0.000015286574,0.00023375424,0.000081159036,0.0000752842,0.00023185462,0.000011109767,0.00007893076,0.00013115966,0.0000010183707],"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.000045748442,0.000030719337,0.0000048089537,0.0000479089,0.0000041702015,3.3903956e-7,0.000049541944,0.038842134,0.90169966,0.000021418726,0.000016511593,0.059237015],"study_design_scores_gemma":[0.000853405,0.00044824154,0.00003039783,0.000057740017,0.000010743138,0.0000042680963,8.828799e-7,0.23422495,0.7617388,0.0013326445,0.0008688297,0.00042913502],"about_ca_topic_score_codex":0.0000040803384,"about_ca_topic_score_gemma":0.000027630269,"teacher_disagreement_score":0.39021152,"about_ca_system_score_codex":0.00010718646,"about_ca_system_score_gemma":0.00040327216,"threshold_uncertainty_score":0.9532221},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048224305,0.00019394708,0.9943865,0.0010986415,0.001235652,0.00038005854,0.0000051941724,0.00025819908,0.001959583],"genre_scores_gemma":[0.24507895,0.00010530945,0.75354123,0.0007699046,0.0001918016,0.000009042209,0.000012223657,0.000027757238,0.00026376804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965612,0.000056901,0.0008143784,0.0012323366,0.00081826025,0.0005168925],"domain_scores_gemma":[0.9978795,0.00015774705,0.0005331313,0.00087079965,0.00044785003,0.00011093907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072218396,0.00045806024,0.00054853305,0.0013062231,0.00014722682,0.00023083991,0.0019590678,0.00039868834,0.000009720257],"category_scores_gemma":[0.00011322248,0.0004691581,0.00010679765,0.00086366537,0.0005932051,0.0004991196,0.00069737853,0.0006814487,0.000004159402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012987264,0.00006636066,0.00017858118,0.000078095756,0.000013849445,0.00003330964,0.002214461,0.5046602,0.00038886842,0.014106588,0.00002276319,0.47822395],"study_design_scores_gemma":[0.00061330106,0.00013742442,0.00018133399,0.0005957773,0.000008591615,0.000045479093,6.316628e-7,0.95545423,0.005646769,0.035792906,0.0007784662,0.0007450855],"about_ca_topic_score_codex":0.000091413225,"about_ca_topic_score_gemma":0.00044136323,"teacher_disagreement_score":0.47747886,"about_ca_system_score_codex":0.00041558413,"about_ca_system_score_gemma":0.000740635,"threshold_uncertainty_score":0.999776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0910498,0.00038806204,0.90634674,0.00058323896,0.0001687148,0.0003729518,0.000003821792,0.000011795081,0.0010748523],"genre_scores_gemma":[0.9759555,0.000043718956,0.023393467,0.00041206589,0.000081110426,0.0000058086644,0.000018494902,0.000014589697,0.000075253236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988298,0.000014534283,0.00018991415,0.0005675851,0.00017387558,0.00022430137],"domain_scores_gemma":[0.9994249,0.00003756435,0.0001545538,0.00021603772,0.00011331893,0.00005367868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030175174,0.00018620354,0.00018682753,0.00008599101,0.00010648831,0.000033523487,0.00018181372,0.00019927805,0.0000050742206],"category_scores_gemma":[0.000071477574,0.00015568318,0.00002444053,0.00005819286,0.0002347824,0.0000034152808,0.00012419758,0.0001589635,0.0000010131168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055801294,0.00008857224,0.019413445,0.00012707453,0.000064977874,0.000017543172,0.000869278,0.67744553,0.002121976,0.0014693162,0.000011170843,0.29831532],"study_design_scores_gemma":[0.008911019,0.010730519,0.08796742,0.003546077,0.00020071022,0.00042555842,0.000019931702,0.34198162,0.021019382,0.51526624,0.0038435939,0.0060879486],"about_ca_topic_score_codex":0.000007877059,"about_ca_topic_score_gemma":0.000056459205,"teacher_disagreement_score":0.8849057,"about_ca_system_score_codex":0.00008734679,"about_ca_system_score_gemma":0.00023043664,"threshold_uncertainty_score":0.63485765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018235305,0.00017199533,0.99676883,0.000565735,0.0011364603,0.0006396126,0.0000014909174,0.00008546536,0.0004480788],"genre_scores_gemma":[0.35603967,0.00009118529,0.6422916,0.000826364,0.0004250433,0.000039944545,0.000007325806,0.00003312349,0.00024574623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967939,0.000073213734,0.00054683804,0.0014666505,0.00057274045,0.0005466328],"domain_scores_gemma":[0.9980986,0.00034763725,0.00033795924,0.0010515167,0.00007063152,0.000093632945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014431812,0.00039780713,0.0004437397,0.0008861253,0.0001849442,0.00028255922,0.0016713225,0.00038822312,0.0000017803101],"category_scores_gemma":[0.00013812771,0.00039298812,0.00011764214,0.00054197205,0.000230378,0.0006144194,0.00024418838,0.0005808425,0.000014945108],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014241561,0.000026928778,0.00011481901,0.000015632913,0.0000030559484,0.000016269623,0.00015647768,0.013569316,0.00037179023,0.00097128114,0.0000020960226,0.9847381],"study_design_scores_gemma":[0.0007023692,0.00041464483,0.01232059,0.0003064286,0.0000065478466,0.000056356635,1.8582173e-7,0.86257875,0.0038543988,0.11666171,0.002351343,0.00074667827],"about_ca_topic_score_codex":0.000013754004,"about_ca_topic_score_gemma":0.00014257165,"teacher_disagreement_score":0.9839914,"about_ca_system_score_codex":0.00048148006,"about_ca_system_score_gemma":0.0001772642,"threshold_uncertainty_score":0.9998522},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006752653,0.00031143244,0.9820042,0.00014483911,0.0004637834,0.0008870651,0.00000933087,0.00021457311,0.0152894715],"genre_scores_gemma":[0.6637963,0.000041321367,0.33426768,0.00056495686,0.00015119434,0.000038990158,0.000014583513,0.00004217005,0.0010828174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944534,0.00011627299,0.0013538272,0.0018454236,0.0013120102,0.00091907906],"domain_scores_gemma":[0.9956944,0.00066820794,0.0007888673,0.0023147403,0.00036712326,0.00016666108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026064154,0.0006423329,0.0014410033,0.0036206408,0.0001470923,0.00017875277,0.0043423674,0.00049351656,0.00002886525],"category_scores_gemma":[0.00016199666,0.0005984003,0.0003202762,0.0028909524,0.00053580845,0.00093803095,0.00072200265,0.0007603204,0.000013593914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003558877,0.0001393716,0.00024754365,0.00022806774,0.00015136052,0.00022331104,0.0040125297,0.24442151,0.001756735,0.0185584,0.000052048763,0.7301735],"study_design_scores_gemma":[0.00040434158,0.0005768282,0.0006367733,0.0009698984,0.000099504214,0.0000665956,6.243354e-7,0.8504663,0.012092168,0.13328086,0.0002100369,0.0011960389],"about_ca_topic_score_codex":0.00010728872,"about_ca_topic_score_gemma":0.00097608607,"teacher_disagreement_score":0.7289775,"about_ca_system_score_codex":0.0009441764,"about_ca_system_score_gemma":0.00050739,"threshold_uncertainty_score":0.9996467},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028250343,0.0010132433,0.9897896,0.0009306627,0.00192332,0.0005226484,0.000024926516,0.00042868336,0.002541897],"genre_scores_gemma":[0.79611784,0.000032054504,0.2004994,0.00053242693,0.001051368,0.00007715696,0.000023022978,0.00008525856,0.0015814353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941548,0.00008139672,0.00063211867,0.002328218,0.0013710671,0.0014323738],"domain_scores_gemma":[0.996679,0.0011923308,0.0005192035,0.0010416716,0.0002656902,0.00030211097],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010329693,0.0009272202,0.00083586463,0.001025205,0.0007701938,0.0018516341,0.0028167309,0.0004356837,0.000011613763],"category_scores_gemma":[0.00015685856,0.00093321304,0.00026305605,0.0007049235,0.0005681753,0.00080491963,0.0013290734,0.0014490753,0.000020643596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014434645,0.00007038462,0.003927027,0.00018648386,0.00007496356,0.0011085836,0.00637464,0.07688003,0.00017646723,0.0031761867,0.00003737497,0.9079734],"study_design_scores_gemma":[0.005028529,0.0016170562,0.011046572,0.020989634,0.00025800077,0.0012914538,0.00002814186,0.8541327,0.012417886,0.06673038,0.015692368,0.010767273],"about_ca_topic_score_codex":0.000065437416,"about_ca_topic_score_gemma":0.0001336845,"teacher_disagreement_score":0.8972061,"about_ca_system_score_codex":0.00045310575,"about_ca_system_score_gemma":0.0006844943,"threshold_uncertainty_score":0.99931186},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022076245,0.0002879047,0.9948183,0.001883866,0.00029447553,0.00036322034,0.000031394608,0.000034432494,0.00007880051],"genre_scores_gemma":[0.68065864,0.00010803255,0.31819347,0.0007309065,0.0001265677,0.000022339802,0.000023172972,0.000017064882,0.000119824006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749404,0.000024453895,0.00061831146,0.00090300216,0.0006050915,0.00035509764],"domain_scores_gemma":[0.99752903,0.0007784016,0.00027669617,0.0010242156,0.00028807987,0.00010360294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006420189,0.0002968871,0.00058749254,0.0018645413,0.00035173804,0.00030096402,0.0016278663,0.00014326819,0.00004243454],"category_scores_gemma":[0.0000686255,0.00021488988,0.00032041623,0.0025347448,0.0004352456,0.00018675308,0.0006725872,0.00025628708,9.762604e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000175949,0.00004501464,0.00034345602,0.000019720404,0.0007759474,0.0000032377952,0.002843148,0.036442213,0.000164913,0.09420324,0.000027828524,0.8651137],"study_design_scores_gemma":[0.00025154077,0.00014307268,0.0024899053,0.000034383847,0.00048283738,0.0000031803668,8.765778e-7,0.969645,0.00016969029,0.024599819,0.0018659948,0.00031369066],"about_ca_topic_score_codex":0.000059819173,"about_ca_topic_score_gemma":0.001019411,"teacher_disagreement_score":0.9332028,"about_ca_system_score_codex":0.000065777036,"about_ca_system_score_gemma":0.00012710808,"threshold_uncertainty_score":0.8762955},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015515427,0.00020440746,0.97811675,0.00035165253,0.0011718803,0.0007472181,0.000026407035,0.000078293364,0.0037879804],"genre_scores_gemma":[0.7124028,0.0000057277352,0.2857394,0.0006634297,0.0004498946,0.0000085370075,0.000009003674,0.000039138038,0.0006820494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952217,0.00009425675,0.0011472156,0.001679914,0.0010802236,0.00077669555],"domain_scores_gemma":[0.9924127,0.005106279,0.00060087984,0.0013388266,0.00034050184,0.00020081045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003687471,0.0005093441,0.0008514101,0.0010832588,0.00027382866,0.000516067,0.0032411215,0.00050939043,0.0002300441],"category_scores_gemma":[0.0012156855,0.00041873977,0.00023660772,0.0010871105,0.0011670438,0.0003045242,0.0006437486,0.0010677818,0.00013765473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010568269,0.000088107336,0.00066683546,0.000015331634,0.000016732387,0.000026558359,0.0029822749,0.18464965,0.00026193773,0.3682949,0.00014232378,0.44274968],"study_design_scores_gemma":[0.00020899465,0.00009580184,0.0005492555,0.0002214107,0.0000065171193,0.000019859486,0.0000010023949,0.3559242,0.00022559098,0.6411068,0.0012807616,0.00035981456],"about_ca_topic_score_codex":0.000027729267,"about_ca_topic_score_gemma":0.000036988647,"teacher_disagreement_score":0.69688743,"about_ca_system_score_codex":0.00015952806,"about_ca_system_score_gemma":0.00036245259,"threshold_uncertainty_score":0.99982643},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024385296,0.00014464086,0.9933283,0.0011578286,0.0018130469,0.00032558446,0.000004244299,0.0001893141,0.0030127007],"genre_scores_gemma":[0.021434903,0.000016298478,0.9765987,0.0012605578,0.00029311233,0.000003917925,0.0000053817816,0.000038270395,0.00034888645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608344,0.000029289191,0.00061237573,0.0015139969,0.0011158633,0.0006450465],"domain_scores_gemma":[0.9969162,0.00038746189,0.0004299157,0.0014871473,0.0005532672,0.00022606265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008198571,0.0005052291,0.0004286082,0.0016831633,0.0005802073,0.00094149756,0.0024238601,0.00031839524,0.00004861574],"category_scores_gemma":[0.00028820313,0.00047846002,0.00012259034,0.0015356343,0.0011577157,0.0017618636,0.0009996209,0.0011769672,0.0000550569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004028059,0.000072584946,0.0000070995907,0.000041791034,0.000012651192,0.0002526593,0.00037749656,0.048709754,0.010791913,0.07566171,0.000026045354,0.8640423],"study_design_scores_gemma":[0.00020061721,0.000053330634,0.00008058877,0.00020227165,0.00000851954,0.00028433086,3.189055e-7,0.86198246,0.0021890125,0.13358662,0.00083814136,0.0005737878],"about_ca_topic_score_codex":0.00002444798,"about_ca_topic_score_gemma":0.000035396133,"teacher_disagreement_score":0.86346847,"about_ca_system_score_codex":0.0003539877,"about_ca_system_score_gemma":0.0008584858,"threshold_uncertainty_score":0.9997667},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004700237,0.000045518256,0.9845638,0.00018975516,0.0008227038,0.0003251323,0.000029119023,0.00008660241,0.009237129],"genre_scores_gemma":[0.9693891,0.000059498827,0.028642422,0.0010931238,0.000137231,0.000004648227,0.0000016299799,0.00003854291,0.000633799],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99756014,0.00003372279,0.00034788437,0.00091165566,0.00065989123,0.00048673135],"domain_scores_gemma":[0.9979719,0.00088621356,0.00028518503,0.0006285595,0.00011894871,0.00010918965],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009510635,0.00034371557,0.00040726544,0.00056236744,0.0003012715,0.00008219091,0.00062369916,0.00016550737,0.00007726632],"category_scores_gemma":[0.0001883546,0.00028371115,0.00009247698,0.00035655225,0.00087262323,0.0003182591,0.00018622882,0.0007360619,0.00004700952],"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.00036126177,0.0007439581,0.00066495663,0.0003737015,0.00009752892,0.0070833624,0.018226208,0.13188075,0.4803611,0.015006759,0.00053557,0.34466484],"study_design_scores_gemma":[0.0014357871,0.0013868433,0.00020351687,0.0021743064,0.000068103196,0.0077084335,0.0000038256117,0.16820367,0.7916952,0.011114947,0.0137481,0.0022573147],"about_ca_topic_score_codex":0.00001198928,"about_ca_topic_score_gemma":0.000063948704,"teacher_disagreement_score":0.96468884,"about_ca_system_score_codex":0.000104103565,"about_ca_system_score_gemma":0.00033759503,"threshold_uncertainty_score":0.9999615},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011625005,0.000095791096,0.9959296,0.0007021316,0.0006888005,0.00024745474,0.000004082286,0.0001398515,0.0010297936],"genre_scores_gemma":[0.46022,0.00015641276,0.5325815,0.0055739977,0.00087204063,0.000019534724,0.000015582273,0.000071962386,0.0004889696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962619,0.00003398658,0.0006482859,0.0014475688,0.0009256603,0.0006826058],"domain_scores_gemma":[0.9980802,0.00015704532,0.00013850872,0.0011564814,0.00018828253,0.0002794759],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010074858,0.00045870067,0.00047906174,0.0016486016,0.00016460379,0.00085062714,0.0029705695,0.00015611065,0.00001854477],"category_scores_gemma":[0.0001603099,0.00045766923,0.00008904444,0.0011894982,0.00011358366,0.001955894,0.0014250447,0.0006082467,0.00006283343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029922553,0.000025807629,0.00010083421,0.00001653599,0.000003248604,0.000057968944,0.0011717153,0.67000145,0.000031991465,0.012239946,0.000007060424,0.31634048],"study_design_scores_gemma":[0.00019984863,0.00004045907,0.000059114558,0.000539452,0.0000036431377,0.000008858672,4.968352e-7,0.9896243,0.00020406718,0.0065854066,0.002171935,0.0005623894],"about_ca_topic_score_codex":0.0000895991,"about_ca_topic_score_gemma":0.00035601656,"teacher_disagreement_score":0.4633481,"about_ca_system_score_codex":0.0003481656,"about_ca_system_score_gemma":0.0003246896,"threshold_uncertainty_score":0.9997875},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015733074,0.003613643,0.9934107,0.00031638652,0.001292287,0.00054433907,0.000033474353,0.0005080063,0.00012381292],"genre_scores_gemma":[0.10016599,0.000006835258,0.8979344,0.0012087802,0.00045593275,0.000011181976,0.00006521439,0.00003650391,0.00011520259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962898,0.000023703795,0.00047221183,0.0014388821,0.0010810498,0.00069438317],"domain_scores_gemma":[0.99713945,0.0005885033,0.00029703206,0.0013379984,0.00047342363,0.00016361078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012182385,0.00051027816,0.0004124235,0.0009187595,0.00032719638,0.00069657667,0.0035603368,0.0002763319,0.0000069126177],"category_scores_gemma":[0.00021999353,0.0004484294,0.00011246193,0.00051755016,0.00060307066,0.00076021254,0.0008260956,0.00078428147,0.00000686221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030280446,0.000078676916,0.0000133875,0.00019355686,0.000014549542,0.00024757703,0.0027436214,0.007635194,0.003283407,0.19839321,0.000038441078,0.78732806],"study_design_scores_gemma":[0.00025850575,0.0001768385,0.00001461428,0.00041663015,0.000011589077,0.00011749815,9.22137e-7,0.9001681,0.020966047,0.0766658,0.0003429653,0.00086049427],"about_ca_topic_score_codex":0.000022745962,"about_ca_topic_score_gemma":0.0001290953,"teacher_disagreement_score":0.8925329,"about_ca_system_score_codex":0.00027823861,"about_ca_system_score_gemma":0.00050675834,"threshold_uncertainty_score":0.99979675},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24239826,0.0065523414,0.60051316,0.0014955511,0.015732804,0.0022664878,0.000051000072,0.00046444638,0.13052598],"genre_scores_gemma":[0.9795997,0.00000987505,0.017814135,0.00020753453,0.0009079468,9.731755e-7,0.0000037000605,0.000022841503,0.0014332993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983052,0.000025454548,0.00051727094,0.00047138848,0.0004002738,0.00028043258],"domain_scores_gemma":[0.99919736,0.00010472443,0.00026857283,0.00027103105,0.00011889921,0.000039399914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042091715,0.00024520233,0.00050405064,0.00048034277,0.00015019582,0.00019773559,0.0004438858,0.00011971231,0.00020880169],"category_scores_gemma":[0.000047229736,0.00019874629,0.00010436673,0.00007052769,0.0003020986,0.00020873455,0.00022864688,0.00029862617,0.0000020134157],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055693414,0.00011716359,0.0002397882,0.00042897396,0.000034890265,0.00022633738,0.05538629,0.03562071,0.035339024,0.032360353,0.00006488085,0.84012586],"study_design_scores_gemma":[0.0018779539,0.0009024164,0.00039364272,0.01627334,0.00026334266,0.00008754405,0.000042658983,0.51718205,0.027356278,0.35547397,0.07482801,0.00531881],"about_ca_topic_score_codex":0.0005646224,"about_ca_topic_score_gemma":0.0011634845,"teacher_disagreement_score":0.8348071,"about_ca_system_score_codex":0.00055167073,"about_ca_system_score_gemma":0.00006836119,"threshold_uncertainty_score":0.81046385},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004137276,0.00012934687,0.99487907,0.00014624081,0.0020566287,0.00089214277,0.000012911164,0.00037180344,0.0015077051],"genre_scores_gemma":[0.0026547413,0.000018204351,0.9936124,0.002934145,0.00035958132,0.000016378826,0.000007079833,0.00007640284,0.00032104107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936598,0.00007620558,0.0006904426,0.0028629259,0.0016394962,0.0010711582],"domain_scores_gemma":[0.99535155,0.0008744366,0.00047898167,0.0020799027,0.0008516955,0.00036340707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008844045,0.0009481284,0.00075212657,0.0019317211,0.00044410856,0.00040961336,0.0031159197,0.00052838144,0.00002481303],"category_scores_gemma":[0.0002470453,0.0009315595,0.0002245358,0.0013502006,0.00096439564,0.000546521,0.0010526795,0.001377047,0.00011470494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070138203,0.000074450785,0.000017676888,0.000008173474,0.000007628962,0.00025202148,0.00020400216,0.41746572,0.000019230389,0.00035846137,0.0000021497108,0.58158344],"study_design_scores_gemma":[0.00084371254,0.0002905533,0.0007507253,0.0002260876,0.0000085656175,0.00007273276,1.8653515e-7,0.986491,0.001513435,0.008608435,0.00020732787,0.0009872094],"about_ca_topic_score_codex":0.00002950387,"about_ca_topic_score_gemma":0.00006949688,"teacher_disagreement_score":0.58059627,"about_ca_system_score_codex":0.0011858611,"about_ca_system_score_gemma":0.00087578676,"threshold_uncertainty_score":0.9993135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002034218,0.00041315524,0.9970489,0.00029838667,0.0008889254,0.00031789404,0.0000056021668,0.0006941963,0.00012952831],"genre_scores_gemma":[0.06276258,0.000032972202,0.9363951,0.00041683795,0.0002314068,0.000024421768,0.000026614734,0.000037999907,0.00007203767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607724,0.000029170045,0.00077032676,0.0014095608,0.0008420659,0.0008716079],"domain_scores_gemma":[0.99747384,0.0007831875,0.0003718194,0.0010779654,0.00013382656,0.00015934375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014874707,0.00055378396,0.00052928855,0.00085316587,0.00019562623,0.00050521985,0.0032208394,0.00035911906,0.00002205005],"category_scores_gemma":[0.0003076825,0.0005457574,0.0000840447,0.0007919127,0.00017949076,0.0009689081,0.0015197091,0.0009843146,0.000020456331],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003585685,0.000036973717,0.0015246322,0.000058183967,0.000007281361,0.00020116201,0.0005491337,0.032371357,0.00001177707,0.0024020725,0.000020664558,0.9628132],"study_design_scores_gemma":[0.0011196604,0.0003930431,0.010042443,0.0034816165,0.0000214571,0.00046812042,6.7044044e-7,0.7274515,0.0044227745,0.11763809,0.12973453,0.005226092],"about_ca_topic_score_codex":0.000036354355,"about_ca_topic_score_gemma":0.00018772118,"teacher_disagreement_score":0.95758706,"about_ca_system_score_codex":0.00061393034,"about_ca_system_score_gemma":0.0006891764,"threshold_uncertainty_score":0.9996994},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012159558,0.00020613422,0.99362916,0.0002824655,0.00091363664,0.0009906857,0.000002724683,0.00032090285,0.0035326988],"genre_scores_gemma":[0.16902806,0.000029264087,0.82871205,0.0008936839,0.00068950513,0.00004588932,0.000022853825,0.00005027684,0.00052843365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99629366,0.0000385814,0.00043838343,0.0016310554,0.000808945,0.00078935135],"domain_scores_gemma":[0.9971614,0.0002903455,0.00036340643,0.0014127147,0.00054377725,0.0002283655],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007150056,0.0005926872,0.00054276467,0.0005462175,0.00037558516,0.0010371142,0.0029930363,0.00037717118,0.000010564781],"category_scores_gemma":[0.000079882,0.00045066216,0.00012429524,0.0006898039,0.0006623086,0.00082462665,0.00041995873,0.0005348732,0.000029061375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015926154,0.00015606955,0.00025179688,0.00010077943,0.000019474135,0.00005843732,0.0021103378,0.01205687,0.00003258155,0.219761,0.000023363189,0.76541334],"study_design_scores_gemma":[0.0005018852,0.0014840914,0.00008651853,0.00028282986,0.000017768118,0.00007729299,2.5459454e-7,0.8349906,0.00026997828,0.15940854,0.0021048365,0.0007753741],"about_ca_topic_score_codex":0.000009540827,"about_ca_topic_score_gemma":0.00008285032,"teacher_disagreement_score":0.8229338,"about_ca_system_score_codex":0.00018625899,"about_ca_system_score_gemma":0.0003419759,"threshold_uncertainty_score":0.9999999},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37523028,0.0000119248925,0.6238157,0.00025018246,0.000059764658,0.00016716785,9.283204e-7,0.00021325183,0.00025080403],"genre_scores_gemma":[0.9644777,8.1935804e-7,0.03468137,0.00065124006,0.00016343185,0.000003290463,0.000012054228,0.0000071053,0.0000029848836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988765,0.000029293142,0.00018569612,0.00031131232,0.00034629635,0.00025089976],"domain_scores_gemma":[0.9987483,0.0008397333,0.00006171122,0.00018692002,0.000086261665,0.00007708507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024288843,0.00011359911,0.00018356822,0.00012774736,0.000111122616,0.0001083304,0.000106083244,0.00005474783,0.00006833284],"category_scores_gemma":[0.00012876818,0.00007831585,0.000021976459,0.0008097787,0.00022347261,0.00020718508,0.000015300493,0.00011620211,0.0000072400744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031254304,0.00019144455,0.07524419,0.000018243327,0.000015963953,0.00014846165,0.0005108467,0.79643565,0.030383931,0.00011185295,0.00002529302,0.096601576],"study_design_scores_gemma":[0.0030350494,0.00012825026,0.071676016,0.000051994906,0.000009362694,0.00005323609,2.8957734e-7,0.921474,0.003182919,0.00024820078,0.000036740978,0.00010395859],"about_ca_topic_score_codex":0.00018099746,"about_ca_topic_score_gemma":0.000045639415,"teacher_disagreement_score":0.5892474,"about_ca_system_score_codex":0.00005515204,"about_ca_system_score_gemma":0.00012773073,"threshold_uncertainty_score":0.31936276},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079880224,0.0041439743,0.9908205,0.00018431719,0.0008740315,0.000626403,0.000006866584,0.00008013692,0.0024649482],"genre_scores_gemma":[0.8012864,0.000114796225,0.19729339,0.0000871545,0.0002602042,0.00001535286,0.0000012819145,0.0000440417,0.00089737365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995409,0.00009398923,0.0008781779,0.0012023231,0.0017448461,0.00067165756],"domain_scores_gemma":[0.99631286,0.00036320448,0.0005538675,0.0019184805,0.00070427783,0.00014732388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014659435,0.00047263753,0.0008786324,0.0013354716,0.00013705422,0.00021267652,0.004691912,0.00030435866,0.000007592129],"category_scores_gemma":[0.00015807808,0.0003896677,0.00018268559,0.000988211,0.0023059738,0.0006082914,0.0014757391,0.0007793196,0.000012049815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005245619,0.00014482839,0.0002532679,0.0009079044,0.00007103159,0.000044437966,0.0015970205,0.09684461,0.00730127,0.5362927,0.000011582941,0.3564789],"study_design_scores_gemma":[0.0009909652,0.0010302905,0.00015256101,0.0045581846,0.000028566745,0.0002332937,0.000002242927,0.5048929,0.0581876,0.42582262,0.002456849,0.0016439409],"about_ca_topic_score_codex":0.000031639574,"about_ca_topic_score_gemma":0.000034237546,"teacher_disagreement_score":0.8004876,"about_ca_system_score_codex":0.00020201849,"about_ca_system_score_gemma":0.00076684705,"threshold_uncertainty_score":0.9998555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008149403,0.00011942443,0.99726146,0.0004689752,0.00029511584,0.00035417982,0.000005311051,0.00010728661,0.0013067267],"genre_scores_gemma":[0.00827766,0.0001215804,0.9901864,0.0012252915,0.0000968183,0.000007158753,0.000010315346,0.000008993759,0.00006581338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778056,0.000022945113,0.0006092023,0.00048718593,0.00083991466,0.00026017884],"domain_scores_gemma":[0.99844915,0.00020902477,0.00042301448,0.0005534991,0.00025000755,0.000115324285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066240143,0.00025703377,0.00029582536,0.0007316235,0.00007668738,0.00028686156,0.0011622938,0.00016642016,0.00003139074],"category_scores_gemma":[0.00009206719,0.00024094187,0.000046603163,0.00031951163,0.0007639113,0.0023016923,0.0006367701,0.00030941362,0.000016843633],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023602267,0.000009430815,0.000018027271,0.000054555367,0.00000345406,0.000006023796,0.00082442444,0.00014714894,0.0011320302,0.0022443389,0.000032162337,0.995526],"study_design_scores_gemma":[0.0014334837,0.0006717797,0.0005437744,0.0011098147,0.000027706657,0.00019033793,0.0000023278512,0.5697198,0.2715218,0.15215704,0.0010816674,0.0015404937],"about_ca_topic_score_codex":0.000011561817,"about_ca_topic_score_gemma":0.0000068386853,"teacher_disagreement_score":0.99398553,"about_ca_system_score_codex":0.00013958446,"about_ca_system_score_gemma":0.0002348487,"threshold_uncertainty_score":0.98253244},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011723019,0.00025795243,0.9922901,0.000101137455,0.0039783847,0.00051100773,0.0000020863683,0.00014435711,0.0015426873],"genre_scores_gemma":[0.47046715,0.000029739173,0.52717173,0.0005146053,0.001003156,0.000026834394,0.0000050233916,0.000078273435,0.00070351316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99497604,0.000033953056,0.00061646337,0.0017881753,0.0015514193,0.0010339493],"domain_scores_gemma":[0.99704725,0.0009003761,0.00013107035,0.0012944291,0.000297036,0.00032986162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093316514,0.00055170077,0.000515639,0.002293931,0.00022999883,0.00038854155,0.0031537309,0.0002999819,0.000017392398],"category_scores_gemma":[0.0008535875,0.0005735776,0.000101811616,0.0016107158,0.0003393452,0.00044774386,0.0022291546,0.0010716964,0.00015146998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003879084,0.00027324163,0.008257045,0.00021537124,0.000056889017,0.0013946807,0.0061539914,0.55289495,0.0010650243,0.0025697004,0.00052077963,0.42655954],"study_design_scores_gemma":[0.00075090706,0.00026020574,0.008536071,0.0016192633,0.0000059600548,0.00014782508,1.4584e-7,0.97238386,0.0007878394,0.010355016,0.0037967728,0.0013561249],"about_ca_topic_score_codex":0.000061862986,"about_ca_topic_score_gemma":0.000071636365,"teacher_disagreement_score":0.46929485,"about_ca_system_score_codex":0.0016656901,"about_ca_system_score_gemma":0.0013026979,"threshold_uncertainty_score":0.9996716},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005401113,0.0021078945,0.99609286,0.00030677055,0.00074311905,0.00022721398,0.00002499421,0.0002114149,0.0002317308],"genre_scores_gemma":[0.33956662,0.0000062517834,0.6598809,0.00022224447,0.0002464552,0.0000023070775,0.000007060159,0.000016544953,0.000051637482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996474,0.000037979287,0.00053724047,0.0011420725,0.001281836,0.00052682386],"domain_scores_gemma":[0.99748886,0.00035569957,0.00042669146,0.001094733,0.00049145863,0.0001425561],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008536879,0.00044371534,0.0005452101,0.00041297532,0.0002337688,0.00026320413,0.0035730836,0.0004698245,0.000014123549],"category_scores_gemma":[0.00029229853,0.00038644127,0.00014421536,0.00054253475,0.0018839014,0.00052752317,0.00114998,0.001293062,0.0000018380148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016123162,0.000058947124,0.00006661091,0.0000741443,0.000015511527,0.00009733937,0.00059839606,0.0020208813,0.009550933,0.5537135,0.000012798309,0.43377483],"study_design_scores_gemma":[0.00020950889,0.00011668461,0.000032370648,0.00061940413,0.000011075783,0.00013664011,9.373082e-8,0.23339263,0.12911376,0.6346411,0.00088714284,0.0008395608],"about_ca_topic_score_codex":0.000025599642,"about_ca_topic_score_gemma":0.0000393588,"teacher_disagreement_score":0.43293527,"about_ca_system_score_codex":0.00027262705,"about_ca_system_score_gemma":0.00076884404,"threshold_uncertainty_score":0.99985874},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018738852,0.0005252428,0.99247473,0.00052708894,0.0023504188,0.0002819122,0.000010786218,0.00024323708,0.0035678684],"genre_scores_gemma":[0.08035179,0.00013981841,0.9172953,0.0012625187,0.00035593082,0.000008014254,0.000022332466,0.000051421524,0.00051289564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959091,0.000019027237,0.00048345362,0.0017682762,0.0010947972,0.0007253454],"domain_scores_gemma":[0.99736613,0.000206577,0.00026589862,0.0017869073,0.00016885139,0.00020560913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005916078,0.00055222603,0.00049862027,0.0007797207,0.00035075864,0.0007412108,0.0045291386,0.0003329972,0.000046016725],"category_scores_gemma":[0.000041437757,0.00048949703,0.00012686262,0.0005488453,0.00046983457,0.0010177158,0.0027394348,0.00088105834,0.00010969849],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032783823,0.000027813094,0.0000062918734,0.00003970809,0.000007242165,0.00021025556,0.0003678214,0.027948432,0.00021197386,0.06480221,0.000021013997,0.90635395],"study_design_scores_gemma":[0.00025382955,0.00011080298,0.00006348453,0.0007289508,0.0000043254245,0.000079271114,5.411728e-8,0.70016533,0.00037606497,0.29615045,0.001432198,0.000635266],"about_ca_topic_score_codex":0.000032123447,"about_ca_topic_score_gemma":0.000034813493,"teacher_disagreement_score":0.9057187,"about_ca_system_score_codex":0.0005710868,"about_ca_system_score_gemma":0.00069645676,"threshold_uncertainty_score":0.9997557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000053338003,0.0003373069,0.9944032,0.0005908599,0.0019420366,0.0010343274,0.000033160686,0.00021148124,0.001442338],"genre_scores_gemma":[0.0044394415,0.000055539018,0.99276763,0.0006169107,0.0011090549,0.000055773682,0.0000421006,0.000047698744,0.0008658384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955332,0.000026887028,0.00063779537,0.0019393549,0.0010053826,0.00085732917],"domain_scores_gemma":[0.9971484,0.00033661106,0.00040748678,0.0016434735,0.00023712515,0.00022693211],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079638354,0.0006314495,0.0005745649,0.0005930149,0.0003974414,0.0008315899,0.003378451,0.00035600938,0.000036883677],"category_scores_gemma":[0.000057729252,0.000549313,0.00020147725,0.00038228874,0.00033868922,0.0010450769,0.0013259157,0.00062771427,0.000027792277],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064375554,0.000062148734,0.0000025127315,0.000049284863,0.0000127630765,0.000019505282,0.00033635506,0.0070175845,0.00033575328,0.015005823,0.00017093605,0.9769809],"study_design_scores_gemma":[0.000448856,0.00029755238,0.000023456683,0.00018689074,0.000008829905,0.000036347858,1.16104154e-7,0.9129539,0.001398324,0.08014229,0.0038657081,0.0006377012],"about_ca_topic_score_codex":0.000016149754,"about_ca_topic_score_gemma":0.0000079630945,"teacher_disagreement_score":0.9763432,"about_ca_system_score_codex":0.00044484623,"about_ca_system_score_gemma":0.00028839285,"threshold_uncertainty_score":0.99969584},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029888572,0.00018505927,0.99655586,0.0016618129,0.00019517011,0.0005898203,0.000003110562,0.000056056113,0.00045424263],"genre_scores_gemma":[0.027089529,0.00010194847,0.9712236,0.0010583216,0.0002457814,0.000015474096,0.0000059295,0.000017184255,0.00024221551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982431,0.000010763973,0.00029305398,0.00081260403,0.00039234388,0.000248146],"domain_scores_gemma":[0.99869204,0.00015447983,0.00018213985,0.0006671905,0.00014269513,0.00016144334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001354779,0.00023844841,0.00026557827,0.00031412905,0.00012905232,0.000117737574,0.0010328996,0.000115023824,0.000004757447],"category_scores_gemma":[0.000013396499,0.00021625817,0.000039751194,0.0006496014,0.00021307323,0.00018753139,0.00050733774,0.00026493124,0.000015680227],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006104685,0.000009745666,0.000010408618,0.000013917107,0.0000034989903,0.000004060051,0.0005347505,0.024177542,0.006554535,0.004492951,0.00024309097,0.9639494],"study_design_scores_gemma":[0.00065520965,0.0007841756,0.00081559294,0.00036958273,0.000021597736,0.00022780205,3.4116172e-7,0.80536485,0.020820616,0.15242885,0.01723254,0.0012788705],"about_ca_topic_score_codex":0.000030433239,"about_ca_topic_score_gemma":0.000049926963,"teacher_disagreement_score":0.9626705,"about_ca_system_score_codex":0.000062528045,"about_ca_system_score_gemma":0.00021821317,"threshold_uncertainty_score":0.8818752},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008826297,0.0019035814,0.99177366,0.000087788525,0.004001021,0.0012139275,0.000116641444,0.00023318578,0.00058195554],"genre_scores_gemma":[0.18858697,0.000026620906,0.80998445,0.00014698644,0.0009175765,0.000028413066,0.00008096886,0.00005786189,0.0001701591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994063,0.00007266612,0.001492629,0.0018835652,0.0013218933,0.0011662156],"domain_scores_gemma":[0.99485797,0.0012033125,0.0009772652,0.0018304005,0.00083843124,0.00029263122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023922457,0.000779864,0.0012109049,0.0008676071,0.0002926462,0.00058775616,0.004468823,0.00059362367,0.0000035849068],"category_scores_gemma":[0.00018756399,0.0007398524,0.0003334319,0.00092669774,0.0005696979,0.00031068161,0.0009304286,0.0006593101,0.00001574455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017968589,0.00005456568,0.00005381558,0.000341607,0.000051067822,0.00006229764,0.0004110264,0.8458645,0.00006247395,0.019861225,0.000042006275,0.13317747],"study_design_scores_gemma":[0.00062606926,0.00025265283,0.00006873434,0.0009514363,0.000019906442,0.0001115908,6.93142e-7,0.97612983,0.00018189379,0.01890099,0.0019555828,0.0008006443],"about_ca_topic_score_codex":0.000049964114,"about_ca_topic_score_gemma":0.000014262165,"teacher_disagreement_score":0.18849869,"about_ca_system_score_codex":0.00031712078,"about_ca_system_score_gemma":0.0007476989,"threshold_uncertainty_score":0.9995053},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016100157,0.0004101989,0.9764542,0.00079327216,0.00045785136,0.00070498226,0.0000017379393,0.00048344076,0.020678194],"genre_scores_gemma":[0.14537017,0.00033462892,0.8447387,0.0023757485,0.00054951647,0.00004071703,0.000012222634,0.000084841755,0.0064934636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99486136,0.00007027718,0.0007379689,0.0018841963,0.0016581081,0.0007880867],"domain_scores_gemma":[0.9962695,0.0006598502,0.00036295652,0.0019866496,0.00051039737,0.00021059575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010637123,0.0006305665,0.0009676984,0.0016844615,0.00031746604,0.000745331,0.0043605715,0.0004132658,0.00012200931],"category_scores_gemma":[0.00021748384,0.0005647029,0.00027071626,0.0012560765,0.0006925369,0.0010013813,0.0015608231,0.0009904886,0.00023829953],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015418824,0.000050099712,0.00003694225,0.000019892947,0.000032676344,0.00012833838,0.00041827178,0.022567065,0.0003153809,0.117887475,0.000048865008,0.85847956],"study_design_scores_gemma":[0.0007310397,0.00018498342,0.000018165872,0.00019190495,0.00001628133,0.00004507797,6.760131e-8,0.7325559,0.0027586892,0.2609909,0.0017933359,0.0007136698],"about_ca_topic_score_codex":0.000026062533,"about_ca_topic_score_gemma":0.000030957814,"teacher_disagreement_score":0.8577659,"about_ca_system_score_codex":0.0004704659,"about_ca_system_score_gemma":0.00037561628,"threshold_uncertainty_score":0.99968046},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007094329,0.00081332924,0.9943008,0.00008523548,0.00071327103,0.00040329382,0.0000019786335,0.00017426266,0.0027984157],"genre_scores_gemma":[0.57789594,0.00015937668,0.41906822,0.001069037,0.00082776294,0.00003568086,0.00000850916,0.00019737879,0.000738116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791294,0.000013129075,0.00030674846,0.0006428323,0.0004914948,0.0006328328],"domain_scores_gemma":[0.9987233,0.00028198955,0.00008444472,0.00070321467,0.00010765626,0.00009935247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008717975,0.0004499735,0.00035208216,0.00023516474,0.0002935805,0.00038571862,0.0009901973,0.00021875107,0.00007146069],"category_scores_gemma":[0.000015504378,0.00030097735,0.00007683387,0.00033652873,0.0005149801,0.00019503539,0.00020072132,0.0010293635,0.000036572714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043664736,0.0000025797847,0.0000044691906,0.000020854011,0.000009503007,0.000055975466,0.0004906878,0.78733146,0.0001335086,0.00021194459,0.000012799086,0.21172185],"study_design_scores_gemma":[0.00009229873,0.00010395372,0.00001553422,0.00032437994,0.000012809116,0.000077970966,0.0000012653039,0.98646,0.0053366446,0.0011252671,0.005854906,0.0005950129],"about_ca_topic_score_codex":0.000014377679,"about_ca_topic_score_gemma":0.00006651571,"teacher_disagreement_score":0.57718647,"about_ca_system_score_codex":0.00018021913,"about_ca_system_score_gemma":0.00010632503,"threshold_uncertainty_score":0.9999442},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000083306986,0.00053723995,0.9929483,0.0006959031,0.0003610855,0.0006875317,0.000004824472,0.00038852452,0.00429332],"genre_scores_gemma":[0.20806189,0.000107106,0.7899032,0.0010587561,0.00021553393,0.00004534691,0.00000990928,0.00003891536,0.0005593128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971769,0.000021752809,0.00046706162,0.0013491352,0.0005206463,0.00046450648],"domain_scores_gemma":[0.9981003,0.0004141405,0.00027949517,0.0006461906,0.00042768172,0.00013221927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068914134,0.00042383472,0.0004521042,0.0006991239,0.00037704883,0.0004420555,0.0016314362,0.00028004945,0.0000072008356],"category_scores_gemma":[0.00012941362,0.00040757176,0.00007661778,0.00041613166,0.00055890845,0.00053425133,0.00033821032,0.0003671489,0.00000461474],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011128789,0.000028738392,0.000018442777,0.00012608689,0.000008467527,0.000010334139,0.0008957877,0.070389695,0.00001761374,0.008974028,0.000043921966,0.91947573],"study_design_scores_gemma":[0.00030841486,0.0001363684,0.000019311856,0.0002751566,0.000006633545,0.00003911655,1.9151832e-7,0.7815372,0.0013502302,0.21531554,0.0005297741,0.00048211854],"about_ca_topic_score_codex":0.000007963506,"about_ca_topic_score_gemma":0.00001181731,"teacher_disagreement_score":0.91899365,"about_ca_system_score_codex":0.00010544009,"about_ca_system_score_gemma":0.00043313994,"threshold_uncertainty_score":0.99983764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002912911,0.00010558348,0.98880154,0.0007137014,0.0012570099,0.0006657318,0.000005264073,0.00055785984,0.007602032],"genre_scores_gemma":[0.12962908,0.000019957572,0.86665666,0.002973933,0.00016266643,0.000016247466,0.00001379565,0.000025855245,0.00050178036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628973,0.00002613974,0.0006988542,0.0011933366,0.0011401783,0.0006517658],"domain_scores_gemma":[0.9972765,0.00021493855,0.00033299296,0.001617617,0.00037120937,0.00018673712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090552686,0.0005111647,0.000443029,0.0014986341,0.00026105094,0.0008818569,0.003622871,0.00045894706,0.000007654624],"category_scores_gemma":[0.00054349395,0.00047339682,0.00011482286,0.0011050089,0.0004500681,0.0013884815,0.0011796777,0.000807484,0.00013411087],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011135726,0.000043440417,0.000015778358,0.00003092834,0.000007470112,0.0000069290722,0.002060665,0.010812264,0.00011536077,0.029394086,0.0000813794,0.9574206],"study_design_scores_gemma":[0.0014743587,0.00059656054,0.00021911788,0.00038052787,0.000019838946,0.00015061146,0.000008603848,0.74190646,0.048544176,0.14314301,0.06055653,0.0030001714],"about_ca_topic_score_codex":0.000007892414,"about_ca_topic_score_gemma":0.0000047300355,"teacher_disagreement_score":0.9544204,"about_ca_system_score_codex":0.00036779512,"about_ca_system_score_gemma":0.00044838467,"threshold_uncertainty_score":0.9997718},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010839046,0.000118728,0.9935454,0.0004204756,0.0014809052,0.0015565698,0.000012156733,0.00044126448,0.0023160763],"genre_scores_gemma":[0.005315966,0.0001299982,0.9911766,0.0014303563,0.0005770984,0.00008794096,0.000039740873,0.000065937915,0.001176347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951716,0.000051960338,0.00076303876,0.0020429483,0.0009970677,0.00097335764],"domain_scores_gemma":[0.9971229,0.00032633482,0.00037966546,0.0017411613,0.00019974561,0.00023020542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010754094,0.0006634693,0.000575206,0.00083414395,0.00033371476,0.00068934937,0.00339071,0.000301926,0.000067811765],"category_scores_gemma":[0.000036964426,0.0006467229,0.00024195979,0.00049378176,0.0002889596,0.0006003639,0.0010946054,0.00045447858,0.00022397113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010212272,0.00006548046,0.000011653864,0.00006813755,0.000023965871,0.000050616003,0.00029859823,0.3303842,0.00011610813,0.0055828826,0.00018443997,0.6632037],"study_design_scores_gemma":[0.00062181405,0.00014486528,0.00004997654,0.00039116334,0.000013536374,0.000014055687,4.388754e-8,0.9813333,0.00030046815,0.009965305,0.0065032365,0.0006622368],"about_ca_topic_score_codex":0.000029001998,"about_ca_topic_score_gemma":0.000038431142,"teacher_disagreement_score":0.66254145,"about_ca_system_score_codex":0.0008302999,"about_ca_system_score_gemma":0.00038903474,"threshold_uncertainty_score":0.9995984},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022780393,0.00080493797,0.98795366,0.0010160931,0.00068561547,0.00016625645,0.0000012504653,0.00027799208,0.008866403],"genre_scores_gemma":[0.5821436,0.00030140838,0.4118391,0.0020736412,0.0009872111,0.000008214035,0.000007078677,0.00007849345,0.0025612358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966503,0.000059914633,0.0003648355,0.0015205186,0.0007494795,0.00065495056],"domain_scores_gemma":[0.99840367,0.000322343,0.00017808663,0.0008012104,0.00008260933,0.00021207178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062416703,0.00050454336,0.00047148,0.0005918849,0.00040213353,0.0007685404,0.0019046379,0.00024719184,0.000027541573],"category_scores_gemma":[0.00004159997,0.0004515854,0.0000953728,0.00037900254,0.00049963134,0.00069100497,0.0009841258,0.0016380266,0.000027529757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017384117,0.0000056320123,0.000020171532,0.000010018303,0.0000033046542,0.000070919516,0.00047657627,0.3045144,0.000006527065,0.008616619,0.000003599821,0.6862705],"study_design_scores_gemma":[0.0001452263,0.00012884068,0.000054446275,0.00012533533,0.0000036441338,0.00017035674,7.610252e-8,0.8482506,0.000026408417,0.14925118,0.0013961428,0.00044772477],"about_ca_topic_score_codex":0.000045975863,"about_ca_topic_score_gemma":0.000012299758,"teacher_disagreement_score":0.6858228,"about_ca_system_score_codex":0.00007674338,"about_ca_system_score_gemma":0.00017452812,"threshold_uncertainty_score":0.9997936},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032213996,0.00013355035,0.9868995,0.0056697885,0.0028566576,0.00075204484,0.0000014889315,0.000302823,0.00016277909],"genre_scores_gemma":[0.1667983,0.00000739619,0.8285983,0.0015368509,0.002806732,0.000031652184,0.000006835679,0.00006376779,0.00015013624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99461746,0.00007276884,0.00067655504,0.0025414506,0.0009932346,0.0010985208],"domain_scores_gemma":[0.9970344,0.00018162864,0.00022089473,0.001973922,0.00023177847,0.0003574176],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012202577,0.000661606,0.00062440947,0.0017041117,0.00025335368,0.0011017394,0.003816559,0.00032855285,0.000025476587],"category_scores_gemma":[0.00009296803,0.0005951143,0.00011051512,0.00133054,0.0003472053,0.00080721197,0.0012072066,0.0012601139,0.000106892134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003240529,0.000047340753,0.000031071573,0.00001923178,0.0000033155625,0.00004305447,0.0012051134,0.16763704,0.0001990945,0.014074876,0.000037812104,0.8166988],"study_design_scores_gemma":[0.00017968773,0.00048172416,0.00029996314,0.00023092152,0.0000026711218,0.000090047004,4.434849e-7,0.93690634,0.00030895328,0.053868443,0.0068238303,0.0008069818],"about_ca_topic_score_codex":0.00010840145,"about_ca_topic_score_gemma":0.00013823874,"teacher_disagreement_score":0.81589186,"about_ca_system_score_codex":0.00032775092,"about_ca_system_score_gemma":0.00036475065,"threshold_uncertainty_score":0.9999352},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000039617935,0.0010540003,0.99179375,0.00091038406,0.0032409853,0.0017392136,0.000066566994,0.00017726034,0.0010138709],"genre_scores_gemma":[0.06601698,0.00011642845,0.92548347,0.001882411,0.0025574388,0.0003594522,0.000087294145,0.00012287125,0.0033736466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995585,0.00005470553,0.00060555123,0.001969342,0.00088339375,0.00090199447],"domain_scores_gemma":[0.9954963,0.0016599802,0.00044508275,0.0021231154,0.00015470103,0.000120874894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014768469,0.0006412819,0.0005984938,0.0002787012,0.00055673515,0.0005995619,0.004410737,0.00028455447,0.0000042834686],"category_scores_gemma":[0.000048834834,0.0004611571,0.0002828748,0.00034708527,0.0007010719,0.00023396383,0.0011945592,0.0007016164,0.00004679885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032464377,0.00002363402,0.0000034433583,0.000025440931,0.000021496264,0.000027617249,0.00013213822,0.14043844,0.00001406254,0.0030219296,0.00057110377,0.8557175],"study_design_scores_gemma":[0.0003227963,0.00019436274,0.00012226038,0.00025051192,0.000013340159,0.00008637782,9.4849895e-8,0.921985,0.000071706585,0.03128304,0.04511489,0.0005556572],"about_ca_topic_score_codex":0.000045456138,"about_ca_topic_score_gemma":0.000015150742,"teacher_disagreement_score":0.8551618,"about_ca_system_score_codex":0.0005865998,"about_ca_system_score_gemma":0.0002285615,"threshold_uncertainty_score":0.999784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014267059,0.00016486681,0.9961515,0.0004192955,0.0013279762,0.00055242237,0.000011226071,0.00015778102,0.0010722562],"genre_scores_gemma":[0.41356763,0.000014994295,0.58553594,0.0003927632,0.00026337232,0.000016949143,0.000012831046,0.000025228926,0.00017031122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971188,0.000051351453,0.0006333583,0.0010292608,0.0006323298,0.0005349525],"domain_scores_gemma":[0.99793017,0.00035342056,0.0003485264,0.0008695989,0.0003515898,0.00014671129],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011338559,0.00040172276,0.00035579395,0.0007065269,0.000508119,0.0005782644,0.0015057651,0.0003170967,0.000011890306],"category_scores_gemma":[0.000116939074,0.00039015381,0.00014507839,0.00041071582,0.00025870412,0.00061315775,0.00043784172,0.0006456682,0.000031059106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007835576,0.000056511162,0.000014708207,0.000103815044,0.00000950504,0.0000113474,0.0017541003,0.57369983,0.00016081196,0.11648227,0.000053007592,0.30764624],"study_design_scores_gemma":[0.00018538811,0.000089669134,0.0000106654325,0.0004059089,0.000010128444,0.000048097223,3.2322666e-7,0.9059787,0.0004690697,0.09201675,0.0003841173,0.00040122477],"about_ca_topic_score_codex":0.000008547246,"about_ca_topic_score_gemma":0.000011140086,"teacher_disagreement_score":0.41342497,"about_ca_system_score_codex":0.00055871345,"about_ca_system_score_gemma":0.00021043069,"threshold_uncertainty_score":0.99985504},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05508127,0.0024444812,0.15594402,0.016294062,0.011361296,0.0029625178,0.00004072786,0.00010730405,0.7557643],"genre_scores_gemma":[0.98657644,0.000034981047,0.0004129409,0.0013615779,0.00041595558,0.000017297354,7.2641416e-7,0.000012759849,0.011167314],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975536,0.00009953337,0.00031340544,0.0004916369,0.0010345686,0.0005072587],"domain_scores_gemma":[0.9976139,0.00120872,0.00036471128,0.00059084664,0.00017173249,0.00005006718],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00063196494,0.00023618163,0.00025573996,0.000043234235,0.0007061499,0.00023897168,0.0019920182,0.00012136794,0.00006319178],"category_scores_gemma":[0.00040498588,0.0001082663,0.00014098089,0.00036645425,0.0068096216,0.00035259812,0.00081865164,0.00045137134,0.0000070991755],"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.000016630138,0.00003141171,0.0003851486,0.000009556217,0.000021048905,0.0000079953525,0.72503823,0.006927043,0.000076833196,0.012893081,0.00028789951,0.25430512],"study_design_scores_gemma":[0.00067389174,0.00035720973,0.0036973804,0.0029843159,0.00010876589,0.000027226071,0.005304919,0.0066239014,0.015786635,0.24987455,0.7126569,0.0019042715],"about_ca_topic_score_codex":0.00049691414,"about_ca_topic_score_gemma":0.006796457,"teacher_disagreement_score":0.9314952,"about_ca_system_score_codex":0.00025924822,"about_ca_system_score_gemma":0.0004204761,"threshold_uncertainty_score":0.9958933},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053388247,0.00024143573,0.99710834,0.000059317805,0.00037830585,0.0009549463,0.0000011854202,0.000033595657,0.0006889937],"genre_scores_gemma":[0.61780226,0.0000068100653,0.3818107,0.000074713804,0.00013283515,0.000018557594,0.0000023053237,0.00001258596,0.0001392281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996715,0.00008845337,0.0006942409,0.0013381955,0.0007247064,0.00043938137],"domain_scores_gemma":[0.9977467,0.00055024994,0.00046351313,0.0010272067,0.00012920109,0.000083104904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017595994,0.0003683794,0.0008517899,0.0013313061,0.00009093081,0.00014907535,0.0017724108,0.00019357335,0.000010219705],"category_scores_gemma":[0.00006797079,0.00031539836,0.00017566583,0.0012357023,0.0001747608,0.00022517797,0.00074571895,0.00036052865,0.0000066547054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020205343,0.0003139113,0.0035289552,0.000038790644,0.000236901,0.000058839814,0.014375563,0.4221778,0.000032170334,0.03657547,0.0000014407925,0.52264],"study_design_scores_gemma":[0.0009440933,0.0014662175,0.00190806,0.00005188308,0.00013027948,0.000012756479,0.000009540876,0.91558427,0.000218069,0.07767563,0.0012482184,0.00075100653],"about_ca_topic_score_codex":0.00009698874,"about_ca_topic_score_gemma":0.0003888155,"teacher_disagreement_score":0.6172684,"about_ca_system_score_codex":0.00026278786,"about_ca_system_score_gemma":0.00017649337,"threshold_uncertainty_score":0.9999298},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005500682,0.001160559,0.98113304,0.0035203442,0.0040100953,0.00049437163,0.0000019827542,0.00019896691,0.009425656],"genre_scores_gemma":[0.2082299,0.0007559447,0.76139754,0.015113166,0.0025376612,0.000081573104,0.000006085641,0.00023071757,0.011647425],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945029,0.000089877896,0.0008634845,0.0019511571,0.001490393,0.0011021981],"domain_scores_gemma":[0.99425083,0.0015375313,0.00045190152,0.0031518312,0.0003857353,0.00022219584],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019603935,0.000634383,0.00053831167,0.00043393127,0.00071211846,0.0017599668,0.0069545293,0.00038416535,0.00003364628],"category_scores_gemma":[0.0004061767,0.00049313466,0.00020057075,0.00072441925,0.0019357132,0.00075539935,0.001527171,0.001208225,0.0002562584],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006353877,0.000026151522,0.00001575386,0.000010214877,0.000016887107,0.00005282782,0.00081497984,0.008833703,0.000078197416,0.14395967,0.00016110855,0.84602416],"study_design_scores_gemma":[0.00008797917,0.00021722764,0.000030544543,0.00023395564,0.000010621464,0.00008939283,5.596231e-7,0.24682663,0.0067788158,0.6961818,0.048580866,0.00096161093],"about_ca_topic_score_codex":0.000044804798,"about_ca_topic_score_gemma":0.00031164134,"teacher_disagreement_score":0.84506255,"about_ca_system_score_codex":0.00048496382,"about_ca_system_score_gemma":0.0006356352,"threshold_uncertainty_score":0.99975204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022356265,0.0003521653,0.99147534,0.00093327346,0.0010119985,0.0005795106,0.00004583757,0.00021826253,0.005160049],"genre_scores_gemma":[0.36569577,0.000044244294,0.6304979,0.0022303404,0.0011659781,0.000027091268,0.00006723441,0.00007712221,0.0001943653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953126,0.000056811677,0.0006802865,0.0019326921,0.0011296725,0.00088795775],"domain_scores_gemma":[0.99725324,0.0003639478,0.00046009105,0.0013039634,0.00037292327,0.0002458558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006808939,0.00067042594,0.0005689495,0.0008499719,0.00074958656,0.000551602,0.0026608382,0.00039661748,0.00011081744],"category_scores_gemma":[0.00003161331,0.000690197,0.00019818963,0.0006947201,0.0009790742,0.0010142414,0.00057636946,0.0010618647,0.00016989827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001065411,0.00029752826,0.0015464732,0.00017843115,0.00009629627,0.0003113078,0.0023711775,0.14344618,0.0027920888,0.0960974,0.00033349768,0.75251895],"study_design_scores_gemma":[0.0006001872,0.0001627624,0.0011437727,0.00084887195,0.000022988606,0.00018210888,0.0000014106053,0.79002357,0.0016401653,0.20238385,0.0016000465,0.0013902978],"about_ca_topic_score_codex":0.00014856466,"about_ca_topic_score_gemma":0.000043058975,"teacher_disagreement_score":0.7511287,"about_ca_system_score_codex":0.0015602541,"about_ca_system_score_gemma":0.001058756,"threshold_uncertainty_score":0.99955493},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20204023,0.000010228065,0.79517287,0.0020335063,0.00027656983,0.00025436658,0.000015665193,0.00013893795,0.00005766178],"genre_scores_gemma":[0.88239557,0.000003619495,0.11669134,0.0006808633,0.00013920262,0.000024352516,0.000052876476,0.000008218477,0.000003967988],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99886316,0.0000130181,0.00016575727,0.00045524063,0.00024626596,0.00025657468],"domain_scores_gemma":[0.999107,0.00015697267,0.000060025053,0.00040241185,0.00017100577,0.00010258852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017241188,0.000115920826,0.00012379067,0.00025220905,0.00024354486,0.000057586294,0.00016706913,0.000033149056,0.000008384558],"category_scores_gemma":[0.0002384048,0.00010156787,0.000038289254,0.0023587348,0.000286971,0.0001736861,0.000068250796,0.00040286672,0.000016039665],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028967883,0.00030626703,0.07578608,0.00002372474,0.0000059989616,0.00005590983,0.00024288763,0.0021795917,0.102158986,0.0065976577,0.00010992893,0.812504],"study_design_scores_gemma":[0.0011261948,0.0005386336,0.57360166,0.0001140963,0.00005700139,0.0010474741,0.0000036762783,0.28245866,0.11770021,0.019255351,0.0035296613,0.00056737167],"about_ca_topic_score_codex":0.000031455904,"about_ca_topic_score_gemma":0.0000139341055,"teacher_disagreement_score":0.8119366,"about_ca_system_score_codex":0.00008054668,"about_ca_system_score_gemma":0.000088990564,"threshold_uncertainty_score":0.41418177},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02514308,0.00013424264,0.9682064,0.00058564276,0.0013774107,0.0011860325,0.00002294661,0.000088901645,0.003255321],"genre_scores_gemma":[0.9718428,0.000006128894,0.015751852,0.0034471175,0.000677348,0.00002446397,0.0000037770303,0.000029813815,0.008216669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939607,0.000072214694,0.0011074924,0.0011677687,0.0032080219,0.00048380045],"domain_scores_gemma":[0.99650085,0.0010075287,0.00052538153,0.0012128451,0.0005646358,0.00018878191],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002994913,0.0004815001,0.00058862905,0.001487669,0.00037948438,0.0014384516,0.0019806116,0.00020387085,0.0009840423],"category_scores_gemma":[0.00023465215,0.00036880453,0.00018691106,0.00080862525,0.0004027468,0.0015973933,0.0005519829,0.00057411555,0.0004565815],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041058927,0.00015076292,0.0058018537,0.000006322695,0.00003286185,0.0023676527,0.0066980594,0.082723066,0.0000030927908,0.0021235668,0.00083851436,0.8992132],"study_design_scores_gemma":[0.004893076,0.0008444445,0.01202051,0.00018446909,0.00018380642,0.00084106356,0.00018482374,0.8039021,0.000016878175,0.018731596,0.1557572,0.0024400542],"about_ca_topic_score_codex":0.00009503467,"about_ca_topic_score_gemma":0.0014929193,"teacher_disagreement_score":0.95245457,"about_ca_system_score_codex":0.00020899155,"about_ca_system_score_gemma":0.00026436336,"threshold_uncertainty_score":0.9999292},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078602246,0.0010095277,0.9943764,0.00051215827,0.0023610785,0.00073522906,0.00001822467,0.000095920106,0.00010542468],"genre_scores_gemma":[0.50308335,0.0004044705,0.49417868,0.0011283942,0.0010304145,0.00007007047,0.000010454896,0.000043625834,0.000050537903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970163,0.00002858497,0.00051961053,0.0010403963,0.00078143046,0.00061366585],"domain_scores_gemma":[0.99767363,0.00068307796,0.0003053649,0.00087788334,0.00035090692,0.00010915177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061538885,0.0004321043,0.00035839799,0.0006494184,0.0011744486,0.00054546853,0.0020733778,0.00019376847,0.000016319398],"category_scores_gemma":[0.00005222742,0.00032240723,0.00024888577,0.000736073,0.00066113914,0.00058912736,0.0006909231,0.00050976593,0.0000044131802],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071184163,0.000036043784,0.000061523075,0.000037141017,0.000035073226,0.000013019845,0.0019058187,0.004743497,0.0004037232,0.011994509,0.000052010353,0.9807105],"study_design_scores_gemma":[0.0004100064,0.00017360465,0.000119499804,0.00011324302,0.000020965539,0.00012643829,9.50409e-7,0.96777785,0.0048883166,0.010231708,0.015577458,0.0005599582],"about_ca_topic_score_codex":0.000077925324,"about_ca_topic_score_gemma":0.00039716414,"teacher_disagreement_score":0.9801506,"about_ca_system_score_codex":0.00019361991,"about_ca_system_score_gemma":0.00037084246,"threshold_uncertainty_score":0.9999228},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047060697,0.00009600618,0.98704445,0.001902404,0.0014322331,0.0009908077,0.0000114852955,0.000627382,0.007848166],"genre_scores_gemma":[0.7120886,0.000014511985,0.28341487,0.0030231155,0.0007604234,0.00010618131,0.00007447698,0.000089203764,0.0004286489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995954,0.00017289456,0.00062679825,0.0019364674,0.0006161375,0.0006937542],"domain_scores_gemma":[0.9972346,0.0007150722,0.00046091244,0.0011045007,0.0002527166,0.00023222106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017412511,0.0007357386,0.00075672416,0.00082878344,0.00051969045,0.0010320668,0.0024820894,0.0005428124,0.000033237204],"category_scores_gemma":[0.00007987188,0.0005771376,0.00029669626,0.0003343131,0.00029660476,0.0007756517,0.00045213132,0.0012166034,0.000009428408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059426096,0.00009137565,0.000019507423,0.00021680658,0.000023780203,0.000025985522,0.003010155,0.01222986,0.00019089362,0.27565694,0.00011017084,0.7083651],"study_design_scores_gemma":[0.0017364426,0.0035312036,0.00006256902,0.0025929043,0.000023024679,0.00016144346,0.000022852806,0.84033597,0.0018577848,0.12483708,0.022871815,0.001966897],"about_ca_topic_score_codex":0.00004493599,"about_ca_topic_score_gemma":0.00008556236,"teacher_disagreement_score":0.8281061,"about_ca_system_score_codex":0.0007818007,"about_ca_system_score_gemma":0.00045460378,"threshold_uncertainty_score":0.999668},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15498503,0.000011086215,0.8443464,0.00009994182,0.0000954109,0.00038951906,0.0000032717212,0.000034360546,0.000034995697],"genre_scores_gemma":[0.75372666,0.000002016134,0.24535136,0.0008148897,0.000065794724,0.000026663849,0.0000037375733,0.000008546679,3.0351697e-7],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99885136,0.00005892691,0.00019295204,0.0004553439,0.00019406996,0.0002473232],"domain_scores_gemma":[0.9995207,0.00008088061,0.00006221963,0.00022424538,0.00004839603,0.00006351356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028757218,0.00016004234,0.00014830193,0.00019459601,0.00009567515,0.000099886674,0.00018378232,0.00003844286,0.00002203364],"category_scores_gemma":[0.000021036849,0.00013970169,0.000015787637,0.0008002973,0.0001855251,0.0002911937,0.000021015996,0.00015613472,5.467793e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025658333,0.00038246132,0.22107461,0.00001160154,0.000007106524,0.0000054660554,0.011148414,0.20230713,0.062440526,0.0013650135,0.0000057611855,0.50099534],"study_design_scores_gemma":[0.00040628508,0.00054564065,0.0102219675,0.000058713304,0.0000011582376,8.221758e-7,0.0000027762649,0.33920956,0.64369255,0.0056386623,0.000019015219,0.00020282336],"about_ca_topic_score_codex":0.00017654858,"about_ca_topic_score_gemma":0.000026233916,"teacher_disagreement_score":0.59899503,"about_ca_system_score_codex":0.00008450998,"about_ca_system_score_gemma":0.000102498256,"threshold_uncertainty_score":0.56968695},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025136376,0.00045077538,0.9900557,0.00031421342,0.001350468,0.0052368273,0.000027072661,0.00027354213,0.0022662878],"genre_scores_gemma":[0.047032904,0.00028785918,0.9430167,0.003028446,0.0016555736,0.0021209747,0.00014032138,0.00015781251,0.0025594274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945778,0.00004987571,0.000642763,0.0022073006,0.0013132463,0.0012089809],"domain_scores_gemma":[0.99647975,0.00039315043,0.00025492496,0.0022243706,0.00036391098,0.0002839191],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013918532,0.00065507623,0.0005976299,0.00074001955,0.00034809863,0.00070514,0.0047398787,0.00028405714,0.00005518993],"category_scores_gemma":[0.00004442314,0.00061209,0.0002349487,0.0010206837,0.00046961318,0.00040710138,0.0021467607,0.00066398765,0.000082264174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024661633,0.00006182144,0.000020311334,0.00011272445,0.000024761408,0.00013683178,0.00023218396,0.17540672,0.000016170006,0.01834411,0.00045213103,0.80516756],"study_design_scores_gemma":[0.0005966741,0.0011730047,0.000021957203,0.00034272805,0.000015581762,0.000030597792,1.8901164e-7,0.8139432,0.00045819464,0.059578627,0.122954614,0.0008846438],"about_ca_topic_score_codex":0.00001960625,"about_ca_topic_score_gemma":0.00003720744,"teacher_disagreement_score":0.8042829,"about_ca_system_score_codex":0.00091677706,"about_ca_system_score_gemma":0.0006708027,"threshold_uncertainty_score":0.9996331},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015901369,0.000064030304,0.9965024,0.00023328565,0.0008530225,0.0002901723,0.00019531441,0.000066287124,0.0002053777],"genre_scores_gemma":[0.26699045,0.000008945985,0.73222965,0.00034935836,0.0002880765,0.000008789499,0.00003449868,0.000020167921,0.000070075046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968493,0.000025482388,0.0006310229,0.0013642659,0.00072804175,0.00040185958],"domain_scores_gemma":[0.9965853,0.00036899123,0.0004490023,0.002090779,0.00035212067,0.00015379713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006513996,0.0003513108,0.0004887932,0.00033729148,0.00023101785,0.000296914,0.0027423347,0.00019341396,0.000019586249],"category_scores_gemma":[0.00008440224,0.00033924857,0.00010212578,0.00049884943,0.0005301881,0.00036475048,0.0012620129,0.00038688272,0.00000930723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028775066,0.00009237887,0.0003878401,0.00007917045,0.000023390265,0.000014522904,0.0006405183,0.023008436,0.0031691995,0.04880367,0.000057223915,0.9237208],"study_design_scores_gemma":[0.00022915321,0.00004841892,0.0007998417,0.000210067,0.000012489893,0.000041534546,1.8995524e-7,0.9799621,0.003831007,0.013840066,0.00061522645,0.0004099112],"about_ca_topic_score_codex":0.00036854943,"about_ca_topic_score_gemma":0.00008032339,"teacher_disagreement_score":0.95695364,"about_ca_system_score_codex":0.00010872119,"about_ca_system_score_gemma":0.0004245661,"threshold_uncertainty_score":0.99990594},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021571715,0.00015966377,0.99344796,0.00048295362,0.0016696271,0.00094550743,0.0000060955313,0.00014201259,0.0009890053],"genre_scores_gemma":[0.8142632,0.000030870542,0.18378784,0.0010672978,0.0004816991,0.00003302966,0.000006771858,0.000043546403,0.0002856962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504155,0.000032652966,0.0009351173,0.0019629132,0.000824064,0.001203686],"domain_scores_gemma":[0.996756,0.0011659769,0.0004308655,0.0012295616,0.00021923441,0.00019836634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013096564,0.00068173715,0.00073549594,0.0015475026,0.00025150678,0.00083841226,0.003928743,0.0004248676,0.000009022378],"category_scores_gemma":[0.00022166598,0.000681844,0.00020025914,0.00088256644,0.00047053187,0.0010978078,0.0006803017,0.0010254928,0.000040596537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000125860515,0.000036562666,0.00033333548,0.000030083283,0.000005323767,0.00009373309,0.0018526978,0.069666736,0.0007501692,0.004987664,0.0000059039894,0.9222252],"study_design_scores_gemma":[0.00021091569,0.00024148925,0.0009606097,0.0006961906,0.0000037338934,0.000025071451,0.0000012583188,0.88055634,0.00444312,0.11159441,0.00038876958,0.00087809266],"about_ca_topic_score_codex":0.00005569812,"about_ca_topic_score_gemma":0.00042574934,"teacher_disagreement_score":0.9213471,"about_ca_system_score_codex":0.00055421604,"about_ca_system_score_gemma":0.00055984576,"threshold_uncertainty_score":0.9995633},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027420415,0.0003431369,0.9710309,0.00008585995,0.00045744408,0.0002381673,0.0000017503288,0.000048577906,0.00037377694],"genre_scores_gemma":[0.8623374,0.000036128597,0.13747609,0.00008303334,0.00004816975,0.0000018892113,3.9493162e-7,0.000010602872,0.0000062607787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977412,0.00009438473,0.0006281136,0.00081496907,0.00039538354,0.00032590434],"domain_scores_gemma":[0.99775696,0.00087385916,0.00047426284,0.00066850806,0.00016691782,0.0000595027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014218386,0.00030804888,0.0006573914,0.0011053937,0.00005500182,0.00010094243,0.0011360528,0.00022360563,0.0000025819738],"category_scores_gemma":[0.00024914395,0.00028728606,0.00008844768,0.0007000496,0.00043184328,0.0005316872,0.00037218764,0.00054624357,8.633576e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064891906,0.000020231768,0.00018161484,0.00007372521,0.0000061404703,0.000016692191,0.0009870323,0.0014304591,0.0026456842,0.0009535949,9.225349e-8,0.9936783],"study_design_scores_gemma":[0.0007438473,0.00083807064,0.049370907,0.0029966705,0.000014295322,0.0001315596,0.0000013629447,0.5304947,0.1391505,0.275397,0.000038934253,0.000822163],"about_ca_topic_score_codex":0.00005570757,"about_ca_topic_score_gemma":0.0005959765,"teacher_disagreement_score":0.9928561,"about_ca_system_score_codex":0.00012937373,"about_ca_system_score_gemma":0.00019945765,"threshold_uncertainty_score":0.9999579},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025176886,0.00029005998,0.99183106,0.001567665,0.00068801123,0.00016899713,0.000008549186,0.00021909451,0.0049747815],"genre_scores_gemma":[0.62928885,0.000051755072,0.36861372,0.0015389587,0.00033108727,0.00000491727,0.000018690265,0.00002619173,0.00012582274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653774,0.000029139286,0.00057127455,0.001257776,0.0010230449,0.00058104657],"domain_scores_gemma":[0.9979495,0.00020820589,0.0002811611,0.0012630549,0.00013656354,0.00016155468],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009833629,0.00047596483,0.00049477577,0.0010171097,0.00034753408,0.0010437969,0.0036797111,0.00025731916,0.000036306188],"category_scores_gemma":[0.000039946088,0.00042065073,0.00017248967,0.0005839603,0.00021103157,0.0017067312,0.00062247243,0.00073169096,0.00008784459],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022717486,0.000022754088,0.000043203516,0.00007093814,0.000024397927,0.000067047804,0.0038459785,0.019545702,0.0004381359,0.032194782,0.000015995705,0.9437288],"study_design_scores_gemma":[0.00035462566,0.000100893056,0.000056120756,0.0008243019,0.000026873466,0.000052053518,6.700112e-7,0.79742056,0.0007405352,0.19707257,0.0025074664,0.0008433243],"about_ca_topic_score_codex":0.000068589405,"about_ca_topic_score_gemma":0.00025587942,"teacher_disagreement_score":0.94288546,"about_ca_system_score_codex":0.00028291834,"about_ca_system_score_gemma":0.00071623473,"threshold_uncertainty_score":0.9999932},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018199782,0.000106488864,0.9980392,0.00077992637,0.00024119909,0.00049345626,0.0000015347646,0.00011106617,0.00020895],"genre_scores_gemma":[0.37944883,0.000004016654,0.620094,0.00034856505,0.00007102595,0.0000062362956,0.0000013999017,0.000010131082,0.00001576045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791014,0.000025677133,0.00051539054,0.000661508,0.000649373,0.0002379191],"domain_scores_gemma":[0.9976637,0.00027194092,0.00044573177,0.001053639,0.00050210877,0.000062877596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094561727,0.00023240804,0.00033956542,0.00044006042,0.00015625684,0.00010593982,0.0022397228,0.00021461537,0.0000016382583],"category_scores_gemma":[0.00009259207,0.00018231709,0.00007506111,0.0006688956,0.00017902885,0.00020750146,0.0006640586,0.0004124636,0.0000038296844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023583586,0.000010638833,0.0000062585887,0.000020144682,0.0000013859665,2.1797909e-7,0.0003280183,0.7936396,0.00042074808,0.006553873,0.0000029436305,0.19901381],"study_design_scores_gemma":[0.00005505504,0.00007661294,0.000025474663,0.00012612401,0.0000031361078,0.0000039516835,6.350776e-8,0.9325351,0.004075438,0.06202433,0.0009009528,0.00017372113],"about_ca_topic_score_codex":0.000014109114,"about_ca_topic_score_gemma":0.000018156103,"teacher_disagreement_score":0.37943062,"about_ca_system_score_codex":0.000050696002,"about_ca_system_score_gemma":0.00026267543,"threshold_uncertainty_score":0.7434675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008731671,0.00004689861,0.9663018,0.00015434349,0.0005814678,0.032149777,0.000006889812,0.00029448434,0.0004555887],"genre_scores_gemma":[0.39328545,0.000005411726,0.53765804,0.00080096576,0.00037572058,0.067612424,0.000044421453,0.00012661309,0.0000909834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948724,0.00005844775,0.00089389534,0.0022451724,0.0007962648,0.0011338121],"domain_scores_gemma":[0.9966595,0.0007017892,0.00056843745,0.0015556812,0.00029610127,0.00021849982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067952625,0.00082281814,0.00069203996,0.0012367509,0.0003935128,0.0004552053,0.0031446696,0.0007210078,0.000009045234],"category_scores_gemma":[0.00001804966,0.0008195248,0.00023668936,0.0014151277,0.0006992503,0.0003413868,0.00048647777,0.00092105236,0.0000030967221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001615236,0.00008831229,0.000011534312,0.00006518513,0.0000036765775,0.000014006304,0.000045630193,0.86683756,0.00012084574,0.009975946,0.0000010848073,0.122820064],"study_design_scores_gemma":[0.0011929497,0.00018978845,0.00001934512,0.00042162774,0.000005140324,0.000009451751,1.3452726e-7,0.95807254,0.0030994704,0.035460588,0.00071742514,0.0008115105],"about_ca_topic_score_codex":0.000051765277,"about_ca_topic_score_gemma":0.00050639414,"teacher_disagreement_score":0.4286438,"about_ca_system_score_codex":0.0010656036,"about_ca_system_score_gemma":0.0009480618,"threshold_uncertainty_score":0.99942553},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074035546,0.00070962467,0.9960579,0.00064545637,0.0011398863,0.0008169245,0.000020762123,0.00038323508,0.0001521459],"genre_scores_gemma":[0.13054906,0.0000065972035,0.86803705,0.0006579472,0.00048736137,0.000031797932,0.000026630552,0.000031959546,0.00017160678],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964441,0.000022934866,0.00053469563,0.0014025732,0.00097444456,0.0006212722],"domain_scores_gemma":[0.99812126,0.00021955048,0.00042263416,0.00091530517,0.00021225656,0.000108991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057778566,0.0005040831,0.00041022288,0.0005927243,0.00028763316,0.0007249519,0.0027963268,0.000348513,0.000009266465],"category_scores_gemma":[0.000044651635,0.00044097664,0.0001232687,0.00027397048,0.0002766933,0.0006851132,0.0009706116,0.0005966746,0.000003151471],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008582575,0.00002600282,0.000011763368,0.00012268452,0.000007966771,0.000040433628,0.0004962031,0.0052188653,0.0019219182,0.021635005,0.0000953807,0.9704152],"study_design_scores_gemma":[0.0002339893,0.0001535719,0.000010178647,0.0003793339,0.000012286173,0.000042775286,5.757742e-8,0.29621434,0.041701954,0.6596311,0.0010508077,0.0005696141],"about_ca_topic_score_codex":0.00002183575,"about_ca_topic_score_gemma":0.000036620462,"teacher_disagreement_score":0.9698456,"about_ca_system_score_codex":0.0005178901,"about_ca_system_score_gemma":0.0003070386,"threshold_uncertainty_score":0.9998042},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011779541,0.00042630878,0.9855458,0.000046749705,0.00028845793,0.0006862229,0.000007435427,0.0008203861,0.0003990566],"genre_scores_gemma":[0.48474613,0.00001373605,0.5151021,0.000025317639,0.00004150434,0.000008296484,0.0000073270885,0.00005223406,0.000003344155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971356,0.00005545849,0.00083201035,0.0008533559,0.00049949245,0.0006241013],"domain_scores_gemma":[0.9983443,0.0004300914,0.00030808809,0.00055672927,0.00019107736,0.00016970553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016203619,0.00055620883,0.0007556643,0.0005166205,0.00020143822,0.0003870388,0.0006436153,0.00026304566,0.0000022171025],"category_scores_gemma":[0.00033134385,0.000563775,0.00007282439,0.0003466213,0.0010896572,0.00024569567,0.00065303274,0.0008490088,3.0016332e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038322546,0.000016790616,0.00027823343,0.00046174775,0.000040503055,0.00002183333,0.003391949,0.55143154,0.00039323728,0.0017288728,0.0000012512068,0.4422302],"study_design_scores_gemma":[0.0006965818,0.00006561139,0.0000767719,0.0016131517,0.000030349032,0.00018880561,0.000011451056,0.99303514,0.0013505508,0.0023431564,0.000028654576,0.0005597874],"about_ca_topic_score_codex":0.00003461445,"about_ca_topic_score_gemma":0.0000062619742,"teacher_disagreement_score":0.4729666,"about_ca_system_score_codex":0.00021236208,"about_ca_system_score_gemma":0.00016144497,"threshold_uncertainty_score":0.99968135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005633327,0.00093970797,0.9949269,0.0006102047,0.0016594328,0.00092786626,0.0001641858,0.0001539339,0.0006120894],"genre_scores_gemma":[0.0015847198,0.00006921382,0.9957131,0.0010182712,0.000639081,0.000016566115,0.00013296702,0.000066040455,0.0007600162],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99480385,0.000032161326,0.00061793,0.0025383674,0.0011068954,0.000900815],"domain_scores_gemma":[0.99395,0.0007617302,0.00042109963,0.004531639,0.000075619115,0.00025988187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010577069,0.0006928064,0.0006703131,0.0006241016,0.0004000731,0.00022758348,0.005158103,0.00034303023,0.000010436017],"category_scores_gemma":[0.00013586077,0.000584361,0.000115328774,0.00032193708,0.0006852157,0.0010697519,0.004903866,0.00077433075,0.00002799975],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038446113,0.00006172318,0.000023166984,0.00014058794,0.000026546335,0.00012298858,0.0006341531,0.029928481,0.00055472617,0.05078573,0.00035323174,0.9173302],"study_design_scores_gemma":[0.00068169826,0.00023186198,0.00003142867,0.00096580543,0.000015448384,0.00011412598,2.8460025e-7,0.3423029,0.0020382467,0.033144288,0.6192089,0.0012650698],"about_ca_topic_score_codex":0.000041198822,"about_ca_topic_score_gemma":0.00018037765,"teacher_disagreement_score":0.91606516,"about_ca_system_score_codex":0.00022837194,"about_ca_system_score_gemma":0.0002775083,"threshold_uncertainty_score":0.9996608},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000987061,0.0008042607,0.9958283,0.000098784025,0.00035106845,0.00021874194,0.000008444676,0.00038561944,0.0013177567],"genre_scores_gemma":[0.21953985,0.000062572675,0.77996576,0.0002002935,0.00014051492,0.0000027195215,0.0000017891097,0.000027367274,0.000059145907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974315,0.000010637667,0.00045651424,0.00094964844,0.00068413303,0.00046757565],"domain_scores_gemma":[0.9981688,0.00029840617,0.00025558955,0.0009904366,0.00015393598,0.00013280407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009134391,0.00040120727,0.00050046656,0.00078760093,0.00007912413,0.00017794265,0.0018002043,0.00027622943,0.000008540378],"category_scores_gemma":[0.00002809743,0.00039275672,0.00008248724,0.000301937,0.00052923785,0.00038679954,0.0009930633,0.0006221895,0.0000045167626],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023805408,0.0000034916072,0.00009005919,0.00009990132,0.000010376558,0.00012579573,0.00035500617,0.0030106483,0.0016295492,0.03184685,0.00001179145,0.96281415],"study_design_scores_gemma":[0.0003757246,0.00022674978,0.0010654621,0.0020984954,0.000017385042,0.00031198162,1.4058533e-7,0.93687195,0.031764306,0.022020781,0.003739392,0.0015076558],"about_ca_topic_score_codex":0.00004056376,"about_ca_topic_score_gemma":0.000013580696,"teacher_disagreement_score":0.9613065,"about_ca_system_score_codex":0.00012438018,"about_ca_system_score_gemma":0.00020935826,"threshold_uncertainty_score":0.9998524},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003082608,0.00017332964,0.993495,0.0004680423,0.00089596125,0.00059054303,0.000004453466,0.00007151937,0.0042703245],"genre_scores_gemma":[0.20717756,0.000041402167,0.7923022,0.00034290805,0.00004379446,0.000009580662,0.0000113156075,0.000018633664,0.000052592168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686563,0.00006916851,0.0009788607,0.00097590295,0.0007398587,0.00037060675],"domain_scores_gemma":[0.9979948,0.00025113247,0.00058836763,0.00067816634,0.00038737783,0.000100194346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075318024,0.00036834533,0.00060442864,0.0011799546,0.0001149313,0.00018630379,0.00086540985,0.0003030861,0.000058713707],"category_scores_gemma":[0.00015032658,0.00037750407,0.00009041897,0.00088087324,0.0008096675,0.0005346851,0.00022282124,0.00052481407,0.000005427648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026430203,0.000041143958,0.00047664443,0.000028414783,0.000004379083,0.000009184371,0.0005322778,0.6525956,0.000040761453,0.017098973,0.0000030763827,0.32916692],"study_design_scores_gemma":[0.00038656595,0.00011234918,0.00021539976,0.00030988661,0.0000057336406,0.000038189497,0.0000012573065,0.9873904,0.0008259486,0.01027325,0.000060247872,0.00038078826],"about_ca_topic_score_codex":0.00001610316,"about_ca_topic_score_gemma":0.00008795788,"teacher_disagreement_score":0.33479482,"about_ca_system_score_codex":0.0003276502,"about_ca_system_score_gemma":0.0007155929,"threshold_uncertainty_score":0.9998677},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024102256,0.000095088515,0.99683714,0.0011296808,0.0008465815,0.00034297115,0.000004538805,0.00013113407,0.00037181535],"genre_scores_gemma":[0.076658726,0.000007657462,0.9216737,0.0010732844,0.0003830605,0.000004421839,0.000039396964,0.000029548095,0.0001301623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99365616,0.00022551371,0.0009940583,0.0023360683,0.0021325464,0.000655641],"domain_scores_gemma":[0.9955833,0.00082880125,0.00065016723,0.0021550367,0.0003802103,0.00040246465],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001887169,0.00062047027,0.001068469,0.0031397128,0.00040262894,0.0012174868,0.0030497722,0.00062867027,0.000088389024],"category_scores_gemma":[0.00017865452,0.0005708084,0.0006051549,0.0031988833,0.000305704,0.0006698059,0.0010270576,0.0015105547,0.000015154507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001338055,0.000046891222,0.001062703,0.000012945777,0.00016209879,0.000057365793,0.000561586,0.57315546,0.0031294748,0.006352871,0.000004381631,0.41544083],"study_design_scores_gemma":[0.0003268543,0.00006235411,0.0014255592,0.000075529206,0.00022762697,0.000011748061,1.3385487e-7,0.9432198,0.0029814064,0.050878856,0.00020999681,0.00058017124],"about_ca_topic_score_codex":0.00059146946,"about_ca_topic_score_gemma":0.0011466673,"teacher_disagreement_score":0.41486064,"about_ca_system_score_codex":0.00037864893,"about_ca_system_score_gemma":0.0010848402,"threshold_uncertainty_score":0.99981934},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000070171855,0.00046021098,0.9956447,0.00037121758,0.001733129,0.00053184346,0.0000084198555,0.0008203929,0.00042306006],"genre_scores_gemma":[0.009945388,0.000046293353,0.98828125,0.0010246015,0.00037739586,0.000032754884,0.000010599968,0.000050102644,0.00023162898],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969444,0.000011313571,0.00047059281,0.0012869692,0.00064177613,0.0006449092],"domain_scores_gemma":[0.9970507,0.0010434361,0.00027428445,0.0012303109,0.00021099957,0.00019027946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082235783,0.00049814215,0.0004381702,0.00066480547,0.00021093793,0.0005130389,0.0029798343,0.00033255504,0.00002739619],"category_scores_gemma":[0.00039930103,0.00047937775,0.00016798518,0.00035717178,0.00022124453,0.0006816135,0.00087924575,0.0007330541,0.000022388205],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011636746,0.000027726855,0.000045007437,0.00014020115,0.000016313881,0.00017688813,0.00066684297,0.17342289,0.000013335045,0.03063113,0.00011163044,0.7947364],"study_design_scores_gemma":[0.00042757057,0.00095328386,0.000061323735,0.0016810676,0.000025449632,0.0002454384,1.6798624e-7,0.22896089,0.004366826,0.71249515,0.048981894,0.0018009706],"about_ca_topic_score_codex":0.0000135838145,"about_ca_topic_score_gemma":0.000003855064,"teacher_disagreement_score":0.79293543,"about_ca_system_score_codex":0.00038428674,"about_ca_system_score_gemma":0.0007345449,"threshold_uncertainty_score":0.9997658},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039687115,0.0040718233,0.96020365,0.0001166241,0.00250238,0.00030651133,0.0000025655202,0.00013929502,0.032260302],"genre_scores_gemma":[0.2966468,0.00006664121,0.6989793,0.0005525343,0.0013375594,0.0000054844336,0.000004632876,0.000068870344,0.002338163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971892,0.00012433414,0.0005059546,0.0009913498,0.0006471902,0.00054194237],"domain_scores_gemma":[0.997664,0.00037339816,0.00051143277,0.0010944295,0.00025786035,0.000098908364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011009026,0.00040067124,0.0004070998,0.00046164775,0.0002513297,0.00017291986,0.0028382372,0.00017255903,0.00003743585],"category_scores_gemma":[0.00014025939,0.00030137313,0.00016050095,0.00039289938,0.001279298,0.00045681055,0.0012306083,0.0007548908,0.000016967646],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029521796,0.000032225755,0.00060784275,0.000072730494,0.000024044604,0.00014726033,0.009114283,0.0036830786,0.0001784545,0.013138034,0.00016023625,0.9728389],"study_design_scores_gemma":[0.0004630733,0.00024125616,0.0003677467,0.0012340567,0.000040392413,0.0011508202,0.000008986072,0.9444278,0.00029706693,0.020485813,0.02986969,0.0014133025],"about_ca_topic_score_codex":0.000036813966,"about_ca_topic_score_gemma":0.000017921482,"teacher_disagreement_score":0.97142553,"about_ca_system_score_codex":0.0006884548,"about_ca_system_score_gemma":0.0004997869,"threshold_uncertainty_score":0.99994385},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000085847896,0.0005071407,0.993881,0.0008481403,0.001047902,0.00083321607,0.00026154393,0.00028239455,0.0022528183],"genre_scores_gemma":[0.011417175,0.00007992335,0.9852025,0.0017992659,0.00074547174,0.00013588562,0.0002657811,0.00007721505,0.00027678645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951175,0.000022743643,0.0008116935,0.0021661962,0.0008962123,0.0009856436],"domain_scores_gemma":[0.99642193,0.0006928598,0.0004008257,0.0018253166,0.0003589723,0.0003000929],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00087811385,0.00068960845,0.0006796927,0.00073365116,0.0005722973,0.0011229919,0.0044282717,0.00036416284,0.000054928492],"category_scores_gemma":[0.00011134557,0.000677285,0.00018053532,0.00068243855,0.00044480828,0.0008505995,0.0009518675,0.0006168591,0.000060333583],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030871356,0.000028488113,0.0000184178,0.000026844595,0.000016868962,0.000054278447,0.0009229994,0.0035772596,0.000037637907,0.010999643,0.00012842365,0.98418605],"study_design_scores_gemma":[0.0007057315,0.00036251245,0.00010358577,0.000953122,0.000023306498,0.00021210578,0.0000011130916,0.8787906,0.00057987595,0.07963644,0.03716614,0.0014654587],"about_ca_topic_score_codex":0.000053572785,"about_ca_topic_score_gemma":0.00004822239,"teacher_disagreement_score":0.9827206,"about_ca_system_score_codex":0.000400229,"about_ca_system_score_gemma":0.0006294445,"threshold_uncertainty_score":0.99991393},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029345498,0.0007034306,0.99512297,0.00017661342,0.001629143,0.0013064987,0.00007188761,0.000437833,0.00052229356],"genre_scores_gemma":[0.032474194,0.000033332453,0.9654144,0.0009514802,0.0009375844,0.000030717063,0.000017238908,0.00006899017,0.00007203607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949594,0.000080364036,0.0008509028,0.002269737,0.00082364,0.0010159175],"domain_scores_gemma":[0.9954333,0.0010812104,0.0008111232,0.001900709,0.0005079147,0.00026580037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064399006,0.0008625807,0.00095975725,0.0008296502,0.0005300909,0.0005750741,0.004307863,0.0004951719,0.0000175998],"category_scores_gemma":[0.0000963363,0.00079156,0.00023964008,0.00049123506,0.0013801771,0.002088394,0.0030988778,0.0010769143,0.000004421745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004190267,0.00002590178,0.0000063220546,0.00001831806,0.000013987858,0.00004869443,0.00013747138,0.14929634,0.0012497928,0.007733437,0.00008052892,0.8413473],"study_design_scores_gemma":[0.000398516,0.00016894627,0.000010953767,0.00052449614,0.000012355569,0.00014106363,2.3124744e-7,0.94217694,0.0060737077,0.04893168,0.00072431547,0.0008368061],"about_ca_topic_score_codex":0.000015484136,"about_ca_topic_score_gemma":0.000013403566,"teacher_disagreement_score":0.8405105,"about_ca_system_score_codex":0.0005369188,"about_ca_system_score_gemma":0.00036814043,"threshold_uncertainty_score":0.99945354},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9774393,0.000009239039,0.01905437,0.00040074802,0.0011186105,0.00061578164,0.000006784853,0.000039933322,0.0013152246],"genre_scores_gemma":[0.99692667,0.000023901672,0.00037345884,0.002327167,0.00019715371,0.000013217897,0.0000010866909,0.000017331506,0.0001200313],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99719965,0.00010669498,0.0003231111,0.0011531394,0.0008933293,0.00032408012],"domain_scores_gemma":[0.99816656,0.0006862229,0.0002509185,0.00055493246,0.00023316588,0.00010816942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007194734,0.0003184881,0.00025904272,0.0005015693,0.0006688896,0.00029097643,0.0009286782,0.00011572031,0.000020326383],"category_scores_gemma":[0.0004327977,0.00023278705,0.000040343144,0.0005359938,0.002228635,0.0007268112,0.00028231455,0.0010460825,0.000010118964],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032335703,0.0009986248,0.008750451,0.000084275154,0.000008564913,0.000070498296,0.020533372,0.01564316,0.2097909,0.012677509,0.0000039424767,0.73111534],"study_design_scores_gemma":[0.0017615806,0.01689566,0.30247942,0.0015928455,0.000105858046,0.00066004315,0.00010183491,0.061519004,0.5673242,0.043831628,0.00095351273,0.0027743941],"about_ca_topic_score_codex":0.000013488908,"about_ca_topic_score_gemma":0.000042979173,"teacher_disagreement_score":0.7283409,"about_ca_system_score_codex":0.000058459766,"about_ca_system_score_gemma":0.00026121852,"threshold_uncertainty_score":0.949278},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000803207,0.00021452816,0.9953705,0.00048411373,0.0017366873,0.0009690491,0.00002504257,0.0002883578,0.00083137053],"genre_scores_gemma":[0.011260271,0.000006006191,0.984896,0.0024490147,0.0011812601,0.000013765382,0.000059029986,0.000060334805,0.00007430614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99377036,0.00011328778,0.0009575381,0.002201333,0.0015026843,0.0014547963],"domain_scores_gemma":[0.99481535,0.0024151343,0.0003963557,0.0019311613,0.00021066141,0.00023134986],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0046296758,0.00082001707,0.000828091,0.0011013241,0.00053708017,0.0010104639,0.006982529,0.00048069863,0.0000039646607],"category_scores_gemma":[0.00013006864,0.0006537791,0.00017312319,0.001050636,0.0006666634,0.0010712598,0.00086940156,0.0014022079,0.000032685624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031677714,0.00006627664,0.0000734201,0.00001897572,0.00000908636,0.00042212382,0.0021195423,0.09018083,0.000061431085,0.002670851,0.000019468696,0.9043548],"study_design_scores_gemma":[0.00035523452,0.00037958362,0.00044122888,0.00046043916,0.000010901836,0.00029740704,0.0000020511488,0.9800077,0.00012502351,0.0168252,0.0002707961,0.000824434],"about_ca_topic_score_codex":0.000052485455,"about_ca_topic_score_gemma":0.000034574932,"teacher_disagreement_score":0.9035304,"about_ca_system_score_codex":0.00040403978,"about_ca_system_score_gemma":0.0005056405,"threshold_uncertainty_score":0.99959135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000076308526,0.0041784076,0.98008174,0.0040663113,0.0018882982,0.00029427363,0.0000059247573,0.00048810095,0.008920614],"genre_scores_gemma":[0.15380783,0.00021975,0.8434198,0.0015372882,0.0007137701,0.0000053247395,0.000013020772,0.000031955184,0.0002512406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99497515,0.00004502678,0.0006841913,0.0024156885,0.0010473407,0.0008326244],"domain_scores_gemma":[0.9947201,0.0007540686,0.0002993029,0.003929873,0.0001519491,0.00014470183],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010146038,0.0006463116,0.0007358109,0.000728462,0.00034646393,0.00075535156,0.012113102,0.00044132434,0.000022552953],"category_scores_gemma":[0.0002730194,0.00055339513,0.000117491385,0.0005380535,0.0010516462,0.0014925501,0.003987813,0.0009456462,0.00007308152],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028268703,0.00001666688,0.00006525102,0.000032678214,0.000012107561,0.0000933009,0.0011571166,0.0036371346,0.00010298069,0.015288671,0.00005161645,0.97953963],"study_design_scores_gemma":[0.00030928466,0.00012487707,0.00014079598,0.00037136674,0.00001518341,0.00010279964,0.0000013032671,0.8402466,0.00033367673,0.14403324,0.013358099,0.00096276344],"about_ca_topic_score_codex":0.00006630168,"about_ca_topic_score_gemma":0.0020517888,"teacher_disagreement_score":0.9785769,"about_ca_system_score_codex":0.00021693495,"about_ca_system_score_gemma":0.00094442215,"threshold_uncertainty_score":0.9996918},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5324876,0.000057315054,0.46584505,0.00017430683,0.00067822053,0.00071005017,0.0000065666673,0.000022478045,0.000018438523],"genre_scores_gemma":[0.9758314,0.0000093034105,0.022656744,0.00022410987,0.0012161819,0.000038416547,0.000010947777,0.0000103117045,0.0000025929082],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99812317,0.00007434441,0.00033863532,0.00062138215,0.00046297506,0.00037951488],"domain_scores_gemma":[0.9986202,0.0006840543,0.00007156578,0.00041152816,0.00011656327,0.000096082455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064140174,0.00017454464,0.00041508372,0.00019795365,0.00019934944,0.000035314908,0.00015727467,0.000068246845,0.0000033391973],"category_scores_gemma":[0.0005170475,0.00014784718,0.00015269131,0.00090154377,0.00024130159,0.00016452253,0.00007104639,0.00018207463,0.0000040481864],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047427355,0.0014292172,0.2526632,0.00004446698,0.0001824777,0.0008728517,0.017377457,0.17483968,0.025847923,0.000043056763,0.000075361146,0.5218816],"study_design_scores_gemma":[0.022737622,0.0032446661,0.85790354,0.00015043229,0.0001056298,0.00052303425,0.00002212485,0.046759613,0.06596648,0.0016895818,0.00016123705,0.0007360388],"about_ca_topic_score_codex":0.00010122068,"about_ca_topic_score_gemma":0.000071186645,"teacher_disagreement_score":0.60524035,"about_ca_system_score_codex":0.0002425621,"about_ca_system_score_gemma":0.0002687161,"threshold_uncertainty_score":0.6029033},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035755438,0.000096847965,0.97824746,0.0008305915,0.0011035417,0.00087268854,0.000004564002,0.00021438941,0.018594135],"genre_scores_gemma":[0.41449788,0.000008313729,0.5803064,0.0024341848,0.000619932,0.00006779907,0.0000053005547,0.00006017736,0.0020000164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553144,0.000030314108,0.0005558727,0.0019262477,0.0012481305,0.00070799794],"domain_scores_gemma":[0.9972854,0.00017568303,0.00025689512,0.0016961646,0.00028358243,0.00030225114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007721063,0.00053523417,0.0005565021,0.0010056585,0.0002506742,0.000873207,0.004115844,0.00029739225,0.000009240925],"category_scores_gemma":[0.00007982653,0.0004952803,0.00014302928,0.0010156563,0.0002783054,0.00056167546,0.001305223,0.00073375396,0.00013702849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009749829,0.0004871556,0.00005738488,0.00016603315,0.0000774638,0.000038354374,0.10000234,0.004615858,0.00075629825,0.16645135,0.00015978639,0.7271782],"study_design_scores_gemma":[0.0002885559,0.00010333104,0.00018034867,0.00027969942,0.000008790045,0.00011637187,6.593562e-7,0.9721934,0.0004576054,0.019792743,0.005672929,0.0009055385],"about_ca_topic_score_codex":0.00002354575,"about_ca_topic_score_gemma":0.000018335835,"teacher_disagreement_score":0.9675776,"about_ca_system_score_codex":0.00037545615,"about_ca_system_score_gemma":0.00025479973,"threshold_uncertainty_score":0.9997499},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017781224,0.0005646866,0.99128824,0.0023836638,0.00045064138,0.00044583698,0.0000021920318,0.00023384804,0.004613087],"genre_scores_gemma":[0.012994084,0.000055860404,0.984558,0.0010320299,0.0005463358,0.000022057782,0.000004568851,0.000021538106,0.0007655125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662036,0.000017326609,0.00044038508,0.0014224726,0.00086513883,0.00063431397],"domain_scores_gemma":[0.9978398,0.00013841089,0.00021053776,0.0014005984,0.00022267835,0.00018796709],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035162785,0.0003849854,0.000355513,0.0005028183,0.00034989085,0.000530902,0.0032003075,0.00024821685,0.00001483468],"category_scores_gemma":[0.00001993818,0.00040157276,0.00011860979,0.0006917557,0.0004679027,0.0004295866,0.000791096,0.0006302917,0.00008926681],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.169669e-7,0.000039675313,0.0000057513093,0.000008191987,0.0000040285677,0.000018625322,0.00012755422,0.007151819,0.00003731435,0.037652653,0.000014008542,0.95493984],"study_design_scores_gemma":[0.00016282513,0.00017520667,0.0006954516,0.0002088743,0.000008087817,0.00007837483,5.661279e-8,0.56100357,0.00017432764,0.41850686,0.018302364,0.0006840273],"about_ca_topic_score_codex":0.000010450689,"about_ca_topic_score_gemma":0.00002541779,"teacher_disagreement_score":0.9542558,"about_ca_system_score_codex":0.0002548987,"about_ca_system_score_gemma":0.0004692801,"threshold_uncertainty_score":0.9998436},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005442898,0.0005466442,0.99029386,0.0013769593,0.0014751639,0.0005141703,0.0000017139901,0.00030720912,0.005429851],"genre_scores_gemma":[0.63462615,0.000028474331,0.3603498,0.004336886,0.00056329224,0.000010534994,0.0000022004801,0.000038960945,0.000043678265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959075,0.00006749158,0.0005372402,0.0017489773,0.00091820786,0.0008205887],"domain_scores_gemma":[0.99741673,0.0006098416,0.00024078024,0.001261564,0.00017212398,0.0002989702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007180849,0.0006384209,0.0006924973,0.00046834382,0.0003289402,0.00083027146,0.0024802552,0.00042126983,0.000008334495],"category_scores_gemma":[0.00006025231,0.00053837366,0.000134253,0.00047338867,0.00044118217,0.00026202347,0.00081430085,0.00088352384,0.000012618251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012576901,0.00003077163,0.000027732174,0.0000220522,0.000010459277,0.00013812925,0.00017677169,0.86009353,0.000021814996,0.025320735,0.000005183872,0.11414021],"study_design_scores_gemma":[0.0008475299,0.00033797105,0.00010921985,0.00022556559,0.000011463499,0.00005149886,7.1618956e-8,0.96226686,0.000030182022,0.035472535,0.000067875204,0.0005792427],"about_ca_topic_score_codex":0.000018805596,"about_ca_topic_score_gemma":0.00001193479,"teacher_disagreement_score":0.63457173,"about_ca_system_score_codex":0.0003010186,"about_ca_system_score_gemma":0.00046507217,"threshold_uncertainty_score":0.9997068},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017133317,0.01295892,0.9714085,0.0030733559,0.0025584104,0.00031162245,0.000015065049,0.000057989975,0.007902823],"genre_scores_gemma":[0.6801588,0.0008973545,0.27122068,0.018174237,0.0063781533,0.000018704319,0.0002569699,0.000115359806,0.022779757],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980501,0.000022878754,0.0002192653,0.00089607044,0.00042101002,0.0003906608],"domain_scores_gemma":[0.99881524,0.000067736495,0.00010686143,0.00082963664,0.00012444367,0.000056088604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004913411,0.00028275698,0.00021355278,0.00011353714,0.0003488526,0.0003711348,0.00116543,0.00043836597,0.00000809438],"category_scores_gemma":[0.00014982568,0.00017814028,0.00010437922,0.0002736816,0.0017206398,0.000006491703,0.00039664764,0.0005375223,0.000009696762],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010647203,0.000013727467,0.000015282782,0.000017972816,0.00001106012,0.000026864427,0.00073451985,0.0010109498,0.005431051,0.00073997275,0.00075991027,0.99122804],"study_design_scores_gemma":[0.0004964851,0.0008295042,0.00025551624,0.0012567836,0.00003147416,0.00027795872,0.0000023091582,0.0049119066,0.027827373,0.14404315,0.81879014,0.0012774301],"about_ca_topic_score_codex":0.0000041313015,"about_ca_topic_score_gemma":0.000037788886,"teacher_disagreement_score":0.9899506,"about_ca_system_score_codex":0.000031307096,"about_ca_system_score_gemma":0.00022048777,"threshold_uncertainty_score":0.726435},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009919175,0.0002597545,0.9910509,0.0015740566,0.0019891926,0.0008919068,0.000004507999,0.0002898015,0.0039299675],"genre_scores_gemma":[0.003038426,0.000011525994,0.99453574,0.0018456473,0.0001905485,0.00006482173,0.000005434208,0.000028239765,0.00027962608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580693,0.00009500014,0.000585,0.0015663442,0.0011433115,0.00080338883],"domain_scores_gemma":[0.9967643,0.0002490848,0.00035782126,0.0020089343,0.00037606174,0.00024380104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017754593,0.00046933434,0.00040855625,0.0009623906,0.0004041225,0.00059338275,0.0034481266,0.00031519058,0.000017889084],"category_scores_gemma":[0.00044191635,0.00045532253,0.00010495418,0.0010779742,0.0004471003,0.0009322529,0.0012104538,0.0006087795,0.00017220221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004951591,0.000040495073,0.0000054236466,0.000024757135,0.000008140202,0.000033841676,0.0007944401,0.051733825,0.00007526775,0.3206037,0.0001114266,0.6265637],"study_design_scores_gemma":[0.00019461832,0.0002224514,0.00009781416,0.0002611062,0.0000068791346,0.00009668147,1.3139513e-7,0.78635806,0.0005614111,0.20799175,0.003572622,0.0006364689],"about_ca_topic_score_codex":0.00000778077,"about_ca_topic_score_gemma":0.000009942813,"teacher_disagreement_score":0.73462427,"about_ca_system_score_codex":0.00053886656,"about_ca_system_score_gemma":0.0005429856,"threshold_uncertainty_score":0.99978983},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014630007,0.0005573775,0.9876804,0.0003219175,0.000784075,0.00024157281,0.000008974905,0.00009341754,0.010165964],"genre_scores_gemma":[0.49149823,0.00006231558,0.5072567,0.0007913871,0.00023770014,0.0000032044275,0.000013636913,0.00001781545,0.000119026285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959636,0.000034105222,0.00071176473,0.0013955532,0.0011920531,0.000702923],"domain_scores_gemma":[0.9971789,0.00016540245,0.0004732745,0.0016724182,0.00033336715,0.000176635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008465071,0.00048577925,0.0009165261,0.001364177,0.00018467463,0.00025947316,0.0031716905,0.00033070063,0.000051378614],"category_scores_gemma":[0.0000423076,0.0003900266,0.00038129272,0.0019751207,0.0007882576,0.0007228318,0.0015620555,0.0005376994,0.000011622199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000769897,0.000038869435,0.00019458262,0.000017247867,0.00006134177,0.00013675525,0.0006858499,0.04013535,0.000018675786,0.016568832,0.000023416627,0.9421114],"study_design_scores_gemma":[0.00031917045,0.00037284565,0.0010919749,0.00014322376,0.00007518446,0.0000660298,3.1943566e-7,0.90700895,0.00033429486,0.08840846,0.00148367,0.0006959028],"about_ca_topic_score_codex":0.00013235353,"about_ca_topic_score_gemma":0.00008750745,"teacher_disagreement_score":0.9414155,"about_ca_system_score_codex":0.00014654164,"about_ca_system_score_gemma":0.00044092044,"threshold_uncertainty_score":0.99985516},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011514846,0.00018539421,0.9919182,0.000230994,0.0018118847,0.0020218138,0.0000036817994,0.0003124712,0.0023640813],"genre_scores_gemma":[0.19734617,0.000042377596,0.7963966,0.004419565,0.0010783445,0.00009896998,0.0000063441903,0.00012253512,0.00048906927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932322,0.00007017533,0.00082130334,0.0027428335,0.0017287192,0.001404749],"domain_scores_gemma":[0.99600685,0.00032996447,0.00049161166,0.0025263624,0.0002834269,0.00036177714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012483298,0.0009419183,0.00079129444,0.0012551775,0.00046640757,0.00096912315,0.004705045,0.00024370837,0.000066138586],"category_scores_gemma":[0.000045339726,0.0008216659,0.00017425638,0.0014884063,0.00045380642,0.00077557354,0.0030526007,0.00083335146,0.00010432954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012314105,0.00003756372,0.00011660103,0.0000334561,0.000024689076,0.00045606054,0.0005947263,0.6796702,0.000053414336,0.0016541686,0.000054535332,0.31729227],"study_design_scores_gemma":[0.000518751,0.0004512457,0.00007380039,0.0012491121,0.000023339293,0.00013662536,8.8768496e-7,0.98692924,0.0006080408,0.003448378,0.005404402,0.0011561563],"about_ca_topic_score_codex":0.00011912768,"about_ca_topic_score_gemma":0.00017804914,"teacher_disagreement_score":0.31613612,"about_ca_system_score_codex":0.001081371,"about_ca_system_score_gemma":0.00047730573,"threshold_uncertainty_score":0.99942344},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004118717,0.00023966035,0.99464107,0.00023816348,0.0003587396,0.0006032842,0.000015186837,0.00021725651,0.0032747919],"genre_scores_gemma":[0.1632485,0.000050541385,0.8344321,0.00057979516,0.00038482976,0.00008000194,0.000016510096,0.000059989085,0.001147691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967064,0.00002306367,0.0003948201,0.0015016879,0.0008498093,0.0005242124],"domain_scores_gemma":[0.9976247,0.0002443461,0.00018132891,0.0016958686,0.00011822176,0.0001355326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039783772,0.000464723,0.00041727902,0.0005223521,0.00037911543,0.0009411918,0.003374011,0.0001279626,0.000027047145],"category_scores_gemma":[0.000012285514,0.00039040452,0.00005756251,0.0005290968,0.0005252456,0.0007337057,0.0013354066,0.00053519185,0.00003536698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011265962,0.00011857933,0.000090659116,0.000020699103,0.00001885495,0.0001518007,0.0024020642,0.024088684,0.0000049733844,0.0023883926,0.00002695627,0.9706771],"study_design_scores_gemma":[0.00056543236,0.0015438331,0.00093354634,0.0006252795,0.000027851016,0.00021705267,0.000004793754,0.9705679,0.00011222438,0.020945236,0.0033238283,0.0011330266],"about_ca_topic_score_codex":0.000066943314,"about_ca_topic_score_gemma":0.00018499709,"teacher_disagreement_score":0.96954405,"about_ca_system_score_codex":0.0001332918,"about_ca_system_score_gemma":0.0003355082,"threshold_uncertainty_score":0.9998548},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004680849,0.0021013774,0.99169356,0.002379101,0.0019594743,0.00073880464,0.000003852245,0.00038133605,0.0006956919],"genre_scores_gemma":[0.3666919,0.00019772915,0.62963724,0.0013739939,0.001376577,0.00016954329,0.000004719713,0.00008887031,0.0004594298],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99288154,0.00005524029,0.00063494255,0.0020074893,0.0034564955,0.0009643215],"domain_scores_gemma":[0.9941549,0.0025227545,0.00021886235,0.0016633245,0.0011530217,0.00028718766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004171778,0.0006105276,0.0006322698,0.0006446414,0.0002856699,0.00041072766,0.0033356533,0.000359688,0.000016709157],"category_scores_gemma":[0.003360518,0.0005789359,0.0002260629,0.00051074405,0.00046280737,0.00054454454,0.00065598666,0.00077513943,0.000020745232],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024493083,0.00005453276,0.000029882773,0.00010163528,0.000026187456,0.000016355261,0.0009053753,0.021055663,0.00061800686,0.016491795,0.000056477085,0.96061957],"study_design_scores_gemma":[0.0045719347,0.0028060062,0.03736065,0.0026248803,0.000045492776,0.00019890135,0.000003650268,0.27813402,0.01573888,0.62769043,0.023767292,0.007057865],"about_ca_topic_score_codex":0.000010097723,"about_ca_topic_score_gemma":0.000043146523,"teacher_disagreement_score":0.9535617,"about_ca_system_score_codex":0.0010617169,"about_ca_system_score_gemma":0.0011317382,"threshold_uncertainty_score":0.9996662},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000116785784,0.0065771714,0.97692925,0.00046917042,0.0020661172,0.00040474496,0.000009978095,0.000043473738,0.013383306],"genre_scores_gemma":[0.75666964,0.0023874817,0.23218663,0.0010735625,0.0015349415,0.000018176232,0.000025803978,0.00010559408,0.005998157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665475,0.000052522963,0.00059305766,0.0011806984,0.0009513893,0.0005675994],"domain_scores_gemma":[0.9959652,0.0010448362,0.00034027227,0.0022333362,0.000300235,0.00011615847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032689602,0.0003663909,0.0005221278,0.0004173276,0.00023023055,0.00044728298,0.0045907306,0.00027742586,0.0000043346],"category_scores_gemma":[0.00034000629,0.00025604985,0.000048657585,0.0005588418,0.0012661796,0.00039409165,0.0036948598,0.0005824955,0.000009358852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001260443,0.00006409096,0.002221584,0.00032343043,0.000026742098,0.00023303872,0.0035915284,0.001352813,0.000027365255,0.20757021,0.0003615553,0.78421503],"study_design_scores_gemma":[0.0005038434,0.00019485258,0.0015286421,0.00079444685,0.000017810162,0.00023796294,0.0000028883883,0.9252382,0.00008260012,0.045684174,0.024922034,0.0007925644],"about_ca_topic_score_codex":0.000102135156,"about_ca_topic_score_gemma":0.0007893701,"teacher_disagreement_score":0.92388535,"about_ca_system_score_codex":0.00010752966,"about_ca_system_score_gemma":0.00032207338,"threshold_uncertainty_score":0.99998915},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030979745,0.0015055888,0.96674615,0.00013654116,0.000096131786,0.00043921717,0.000011761109,0.000013995517,0.000070860486],"genre_scores_gemma":[0.530726,0.00010549169,0.46856865,0.00017406214,0.00017359368,0.0000050228114,0.00016618206,0.000024307777,0.000056686487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981666,0.000028062197,0.00037093592,0.00089554006,0.00018091359,0.0003579165],"domain_scores_gemma":[0.99888337,0.00014372588,0.00022865526,0.0005171225,0.00012847647,0.00009865018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004887966,0.00026939847,0.0002669445,0.00022317121,0.00030878602,0.00011609138,0.0003256131,0.00026447445,0.0000036521628],"category_scores_gemma":[0.00013515865,0.0002181698,0.000020486203,0.00014643944,0.00037332517,0.000013836432,0.0004899906,0.00020919785,5.665168e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017919125,0.000018762372,0.04042179,0.000071888855,0.000039732553,0.000005890776,0.00021499534,0.053984623,0.00068303203,0.00008639113,0.000004713149,0.90445024],"study_design_scores_gemma":[0.0008965548,0.0009088408,0.2727468,0.00056503573,0.00014094381,0.00040125384,0.0000035028238,0.70483434,0.00011053066,0.016094696,0.0020885335,0.0012089862],"about_ca_topic_score_codex":0.000060772483,"about_ca_topic_score_gemma":0.001445312,"teacher_disagreement_score":0.9032413,"about_ca_system_score_codex":0.000043969307,"about_ca_system_score_gemma":0.00019122372,"threshold_uncertainty_score":0.8896706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009356815,0.0002435971,0.99494326,0.00069635676,0.0009472875,0.0007476908,0.000016312073,0.0001675165,0.0021444373],"genre_scores_gemma":[0.015736857,0.000111018664,0.98319083,0.00021571154,0.00026446246,0.000048623893,0.0000073240026,0.000027402753,0.00039777145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972454,0.000033844757,0.00044459203,0.0012837263,0.0005535914,0.00043885643],"domain_scores_gemma":[0.99761313,0.0003523127,0.00033100782,0.0012185884,0.00036569402,0.0001192672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006879442,0.00039044218,0.00037614774,0.0007411894,0.00043573836,0.00051084836,0.0014179455,0.0002434228,0.000008446285],"category_scores_gemma":[0.00010885129,0.00034841138,0.00006818209,0.00048414065,0.0012111292,0.0008410668,0.0003060526,0.00044613748,0.00001566631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008461741,0.000027922673,0.00010030185,0.00004987637,0.00001374971,0.000004186037,0.000578278,0.00497396,0.00005688943,0.35973662,0.000024934803,0.6344248],"study_design_scores_gemma":[0.00047398225,0.00033793383,0.0010342303,0.0002952816,0.000023678775,0.0002855426,7.176513e-7,0.8188652,0.001317831,0.1704902,0.0060821823,0.0007932169],"about_ca_topic_score_codex":0.0000050795875,"about_ca_topic_score_gemma":0.000027875,"teacher_disagreement_score":0.81389123,"about_ca_system_score_codex":0.00020170871,"about_ca_system_score_gemma":0.00017746845,"threshold_uncertainty_score":0.99989676},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003398036,0.0005018618,0.9934601,0.00006952981,0.0009661986,0.00071217713,0.000019099909,0.000066311164,0.0008066401],"genre_scores_gemma":[0.34229442,0.0004202066,0.6557399,0.00055524596,0.00033383205,0.000036232104,0.000013054097,0.00006641295,0.0005407094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961295,0.00003630358,0.00086517376,0.001292385,0.0010524963,0.0006241498],"domain_scores_gemma":[0.9965072,0.00073003274,0.0007343223,0.0014638907,0.0004160585,0.00014847827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046890977,0.00050446234,0.00083614915,0.00074843905,0.00014740386,0.000067455265,0.0024461797,0.00036038237,0.0000051351135],"category_scores_gemma":[0.00005457747,0.00047846147,0.00027308834,0.0005058698,0.0008605021,0.00025291147,0.0005694052,0.00041095685,0.0000018608246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022683484,0.00004941634,0.000022356711,0.000065847606,0.000018724308,0.000050295344,0.0009047282,0.9313743,0.000286097,0.0056614643,0.000063419575,0.06148067],"study_design_scores_gemma":[0.00060454494,0.0007681584,0.000027059306,0.0005666054,0.000012488356,0.000062992935,3.6836778e-7,0.97374743,0.015696699,0.0060352813,0.0018416445,0.00063672656],"about_ca_topic_score_codex":0.00002076034,"about_ca_topic_score_gemma":0.000012388388,"teacher_disagreement_score":0.3388964,"about_ca_system_score_codex":0.0001925869,"about_ca_system_score_gemma":0.00039765527,"threshold_uncertainty_score":0.9997667},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018107257,0.00016307946,0.99386734,0.0018861111,0.000385581,0.0014110259,0.0000057995317,0.00017656613,0.0021026987],"genre_scores_gemma":[0.0011555749,0.00000632744,0.99346733,0.0016496129,0.0010962749,0.00010559112,0.000027401164,0.00003952942,0.0024523716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963632,0.000052830615,0.00047304103,0.0018177846,0.00073009974,0.00056303345],"domain_scores_gemma":[0.997562,0.0003387152,0.00020007227,0.0012111852,0.00034321463,0.00034481997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010774237,0.00046844737,0.0004765012,0.0007014149,0.00036714372,0.0005125763,0.002317581,0.00031703533,0.000018343197],"category_scores_gemma":[0.00008137877,0.0004414143,0.00013064196,0.00066053105,0.00016603079,0.00052302424,0.0006951889,0.00063472753,0.00004379625],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008700798,0.000022065376,6.7781644e-7,0.00001987211,0.000005824304,0.0000022223046,0.00027482666,0.034899827,0.0006207936,0.1275557,0.0002717119,0.8363178],"study_design_scores_gemma":[0.00041560383,0.00018182448,0.000013679643,0.00007753826,0.000013172962,0.000025518968,6.0260845e-8,0.6868825,0.0011113234,0.2989165,0.01166547,0.0006968173],"about_ca_topic_score_codex":0.000021262704,"about_ca_topic_score_gemma":0.00001622368,"teacher_disagreement_score":0.83562094,"about_ca_system_score_codex":0.0002601688,"about_ca_system_score_gemma":0.0008130878,"threshold_uncertainty_score":0.9998038},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005841796,0.0000746195,0.9907021,0.00061623513,0.00068169023,0.0013090763,0.000039734852,0.00010698905,0.0006277429],"genre_scores_gemma":[0.880208,0.000075180855,0.11447823,0.0032030928,0.00043848043,0.0001082715,0.000101064514,0.000069815724,0.0013178159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952865,0.0000926488,0.0008357187,0.0012837767,0.0015438034,0.00095754175],"domain_scores_gemma":[0.9969311,0.0004995042,0.00018706008,0.0011212431,0.0009762423,0.00028486433],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0026978543,0.0004266835,0.00046038826,0.0014465395,0.0003979082,0.0013745052,0.002772158,0.0003483989,0.000038774895],"category_scores_gemma":[0.000114999064,0.0003873007,0.00010270567,0.0010526886,0.00045842136,0.0033950019,0.00096396386,0.0007506369,0.00012148461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010349853,0.00013651092,0.0004986165,0.00022642035,0.000009728971,0.00004247097,0.022049833,0.020959018,0.000963475,0.05002427,0.00020770084,0.9047785],"study_design_scores_gemma":[0.00084868324,0.00040859834,0.00023581873,0.00029754263,0.0000024837393,0.000008263584,0.00000720638,0.98759454,0.004257887,0.0045997887,0.0011971683,0.0005419871],"about_ca_topic_score_codex":0.000058034995,"about_ca_topic_score_gemma":0.00017163262,"teacher_disagreement_score":0.9666355,"about_ca_system_score_codex":0.00045467602,"about_ca_system_score_gemma":0.0012146366,"threshold_uncertainty_score":0.9998579},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012687244,0.00018662093,0.9837378,0.00038781652,0.0003994029,0.0012028787,0.00040241945,0.000079764504,0.0009160416],"genre_scores_gemma":[0.5672013,0.000050536117,0.43194908,0.00042697322,0.00007699782,0.00007941629,0.000059059224,0.000044646615,0.00011198574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996884,0.00002577689,0.0010570608,0.00075255433,0.00067333377,0.00060730905],"domain_scores_gemma":[0.998273,0.00050503993,0.0002770346,0.0006132527,0.00021748016,0.00011416315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011044531,0.00044753274,0.0006417198,0.0010286289,0.00018743202,0.00011647015,0.0013447388,0.00028411672,0.00021752244],"category_scores_gemma":[0.00007960718,0.00043576825,0.00016968357,0.00034622443,0.0007316548,0.00089950877,0.00010193354,0.00038795912,0.000021088945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047581132,0.00012735855,0.0000022053493,0.00018439216,0.0000057921475,0.0000029822481,0.0042617656,0.801418,0.020275032,0.0014023948,0.0000045114307,0.17226799],"study_design_scores_gemma":[0.0011597775,0.00012485615,0.000013953944,0.00031741773,0.000023077157,0.000015912248,0.000001439238,0.9751886,0.0059435745,0.016685136,0.00009681706,0.0004294011],"about_ca_topic_score_codex":0.0000140885195,"about_ca_topic_score_gemma":0.0010389299,"teacher_disagreement_score":0.55451405,"about_ca_system_score_codex":0.00033063226,"about_ca_system_score_gemma":0.0007009225,"threshold_uncertainty_score":0.9998094},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026098915,0.0004085903,0.99285203,0.0011944864,0.0011900174,0.00035159462,0.0000069958164,0.0003563227,0.0036138897],"genre_scores_gemma":[0.01571344,0.00012792741,0.9766669,0.0042756503,0.00047387407,0.000013692947,0.000012157135,0.000046125064,0.002670218],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619216,0.000026013873,0.0005160434,0.0015911653,0.0010716241,0.0006030154],"domain_scores_gemma":[0.9970264,0.00037301297,0.000370362,0.0017765147,0.00028269307,0.00017103899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007915102,0.0005163639,0.0004260184,0.00052863033,0.00026126925,0.0006592995,0.0037485594,0.0004966756,0.00004091977],"category_scores_gemma":[0.00018704166,0.0004792879,0.00011196301,0.0005520823,0.0008860195,0.0014146392,0.0009464471,0.0015238343,0.0000696783],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006756539,0.000018893877,0.000018922263,0.00001577171,0.0000033435879,0.00008058557,0.00013753767,0.00007371737,0.012373058,0.007141332,0.0003744297,0.97975564],"study_design_scores_gemma":[0.00026542417,0.00039417009,0.00004863891,0.00038192762,0.00000829874,0.00017304566,5.721843e-8,0.040428262,0.24878703,0.63729846,0.070808835,0.0014058602],"about_ca_topic_score_codex":0.0000122191395,"about_ca_topic_score_gemma":0.000025609343,"teacher_disagreement_score":0.9783498,"about_ca_system_score_codex":0.00018449327,"about_ca_system_score_gemma":0.00038118777,"threshold_uncertainty_score":0.9997659},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000086713844,0.0001886734,0.99177796,0.0015885076,0.0011586657,0.00030209066,0.000015861011,0.00020417605,0.0046773404],"genre_scores_gemma":[0.09052068,0.00011686922,0.9018851,0.0035318846,0.0010635754,0.000019538476,0.000069360554,0.000054805543,0.0027381913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965995,0.000029574248,0.00043859484,0.0013812465,0.0010621524,0.000488948],"domain_scores_gemma":[0.9978174,0.000203672,0.00029026764,0.0011461545,0.00036093462,0.00018158686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007285492,0.0004198819,0.00038276686,0.0015176802,0.00022702519,0.0007000032,0.00233365,0.0002703593,0.00018615574],"category_scores_gemma":[0.000059475973,0.00034789953,0.00009442179,0.0014629911,0.0005038705,0.0007348814,0.00050754996,0.0006298156,0.0002757771],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005129956,0.000035069603,0.000039465955,0.000020340378,0.000008155102,0.00004105611,0.00034869707,0.00023291653,0.00003816576,0.0029098408,0.00012940545,0.99619174],"study_design_scores_gemma":[0.0020087168,0.0013604126,0.004127071,0.0008659533,0.00007009068,0.0011065961,5.16304e-7,0.64867795,0.0045943987,0.17258228,0.15990523,0.004700806],"about_ca_topic_score_codex":0.000030716586,"about_ca_topic_score_gemma":0.00012920887,"teacher_disagreement_score":0.99149096,"about_ca_system_score_codex":0.00024954558,"about_ca_system_score_gemma":0.0004986051,"threshold_uncertainty_score":0.9998973},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0096657155,0.0003258249,0.987884,0.00075387233,0.0002959601,0.00035271395,0.000003390359,0.00004444372,0.00067408395],"genre_scores_gemma":[0.92072105,0.00007262969,0.077940024,0.0010644882,0.00007843234,0.0000029065625,0.0000019101876,0.000016013943,0.00010255343],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769866,0.000028776687,0.00029534855,0.00089219736,0.0007438357,0.0003411875],"domain_scores_gemma":[0.9980637,0.0004897832,0.0002974235,0.0009267095,0.00015316892,0.000069236215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021190023,0.0003658251,0.0003453716,0.000335584,0.00025540034,0.000113058086,0.0015562235,0.00015165146,0.000013093129],"category_scores_gemma":[0.00004873791,0.00021253749,0.000041214214,0.00040614294,0.00082709384,0.00027644495,0.00051738555,0.0004974769,0.0000019968707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023400988,0.00003918509,0.00007625664,0.000068992216,0.000022214215,0.00010821199,0.0017671713,0.02478831,0.0011164937,0.31669462,0.000031279822,0.65526384],"study_design_scores_gemma":[0.00068218895,0.001260619,0.0012359195,0.0008680213,0.000018248065,0.00039105644,8.792583e-7,0.111555,0.019709125,0.86252785,0.0007138442,0.0010372291],"about_ca_topic_score_codex":0.0000043831924,"about_ca_topic_score_gemma":0.00003774875,"teacher_disagreement_score":0.9110553,"about_ca_system_score_codex":0.00010223096,"about_ca_system_score_gemma":0.00024129722,"threshold_uncertainty_score":0.86670274},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02256077,0.0025420683,0.8544195,0.006876486,0.0035904746,0.0023204004,0.000004390744,0.0010126277,0.106673285],"genre_scores_gemma":[0.93537,0.00023963384,0.056516986,0.0010793941,0.00046539717,0.00016465005,0.0000072077296,0.000046691122,0.006109997],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99668294,0.00007052324,0.00044159885,0.0010949662,0.0009614921,0.0007484635],"domain_scores_gemma":[0.9976752,0.00048454874,0.0003034816,0.0011904713,0.00015687327,0.00018945604],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001201822,0.00036697203,0.00040885565,0.00031961207,0.00096513884,0.0004668108,0.003352729,0.00048334943,0.0010360898],"category_scores_gemma":[0.00027874895,0.0003258558,0.00011449356,0.00042788975,0.003206136,0.00045766885,0.0014876153,0.0007574532,0.00013859863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069348803,0.000038614442,0.0016080952,0.000018586112,0.000011679214,0.000012800344,0.068795614,0.00013944438,0.00008890344,0.04439473,0.000065347886,0.88481927],"study_design_scores_gemma":[0.0007801162,0.0001958006,0.00035010543,0.0015780926,0.000026056694,0.000022057486,0.00024709088,0.09115053,0.00082396396,0.3451756,0.55694383,0.0027067352],"about_ca_topic_score_codex":0.0010733615,"about_ca_topic_score_gemma":0.0076347627,"teacher_disagreement_score":0.91280925,"about_ca_system_score_codex":0.0006025063,"about_ca_system_score_gemma":0.00026020344,"threshold_uncertainty_score":0.99991935},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32207623,0.000008760317,0.6776005,0.000038566068,0.00009270315,0.00014775684,9.571285e-7,0.000026761056,0.0000077728055],"genre_scores_gemma":[0.9665898,0.0000010784281,0.03325091,0.000089367255,0.00005368946,0.0000022660054,0.000007648811,0.000004497829,7.149672e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979816,0.00013185557,0.0004811811,0.0005489424,0.0005808236,0.00027556397],"domain_scores_gemma":[0.99901694,0.00013483808,0.00017627157,0.00047680887,0.00015401166,0.000041116236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080176955,0.00013207347,0.00020106345,0.0004908055,0.00009416388,0.00024282618,0.00083784614,0.000050091516,0.000002619371],"category_scores_gemma":[0.00008261232,0.00012134301,0.000024557494,0.0038866156,0.00012863062,0.000713226,0.00027837773,0.00009657681,8.460761e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048240827,0.00049021083,0.03522694,0.0000095420755,0.0000013555833,0.000027918179,0.00091017445,0.94851375,0.00068910833,0.0061759083,0.000005888545,0.007944379],"study_design_scores_gemma":[0.0005699402,0.00011647322,0.0063088634,0.000026051523,0.0000018587511,0.000009753222,0.00000469905,0.9880662,0.00081992644,0.0039012078,0.000039086965,0.00013594843],"about_ca_topic_score_codex":0.0012382385,"about_ca_topic_score_gemma":0.0016913878,"teacher_disagreement_score":0.6445136,"about_ca_system_score_codex":0.00011620294,"about_ca_system_score_gemma":0.00018232931,"threshold_uncertainty_score":0.49482244},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035936846,0.001158073,0.9766999,0.002079337,0.0020838482,0.0005305567,0.0000024022359,0.0002533223,0.017156651],"genre_scores_gemma":[0.20957935,0.000058008423,0.76695794,0.016743686,0.0025333932,0.00004812008,0.0000151014,0.00012047764,0.003943911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944869,0.000084714084,0.000865987,0.0021059413,0.0014773599,0.0009790915],"domain_scores_gemma":[0.9958329,0.0012829775,0.00057556864,0.0015700371,0.0005061178,0.0002324009],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013711918,0.0007507325,0.0011175381,0.0010400636,0.00045823734,0.0011226874,0.003915412,0.00043222486,0.00004505674],"category_scores_gemma":[0.0003014637,0.0006390877,0.0002917346,0.0007819637,0.000936778,0.00075696973,0.0014416897,0.0010616134,0.0000745527],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006747673,0.0000555334,0.000020605714,0.00005282524,0.000026811213,0.00038904534,0.00073127495,0.038951736,0.00022798196,0.020703888,0.00065851654,0.9381143],"study_design_scores_gemma":[0.002226584,0.0001958206,0.00014204663,0.0005566456,0.000025136049,0.00013433982,1.5504384e-7,0.78756773,0.00061913417,0.20008871,0.007142089,0.0013015829],"about_ca_topic_score_codex":0.000022168906,"about_ca_topic_score_gemma":0.00008369776,"teacher_disagreement_score":0.9368127,"about_ca_system_score_codex":0.0003075508,"about_ca_system_score_gemma":0.0011428355,"threshold_uncertainty_score":0.9999142},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015587331,0.00007618495,0.9959464,0.00024128656,0.0002874731,0.0005727008,0.00000370775,0.0010607394,0.001795926],"genre_scores_gemma":[0.013436964,0.00012734925,0.98572177,0.00043033165,0.00010181001,0.0000235808,0.000016849224,0.000043119886,0.00009825206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684334,0.000021137785,0.0005118838,0.0011702103,0.0009573801,0.00049602595],"domain_scores_gemma":[0.99804443,0.000052938263,0.00018973318,0.0012543717,0.0002807887,0.00017771329],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004733331,0.0004940805,0.00038635146,0.0008601496,0.00021583804,0.0003324051,0.0027028604,0.00038844187,0.000006609882],"category_scores_gemma":[0.0000066732296,0.00049752346,0.000093911076,0.00045867983,0.00025936068,0.0020635114,0.0003806252,0.0006305575,0.000013158066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014559561,0.000012656432,6.301649e-7,0.000015665513,0.000002056552,0.000010355477,0.0011552277,0.7106978,0.000014180578,0.04433751,0.0000068863264,0.24374555],"study_design_scores_gemma":[0.00011447953,0.00014579226,0.0000013865823,0.00016728193,0.000003270742,0.00009588312,1.2360277e-8,0.93611395,0.0005589717,0.061449856,0.0008321031,0.00051698415],"about_ca_topic_score_codex":0.0000146705615,"about_ca_topic_score_gemma":0.000010721718,"teacher_disagreement_score":0.24322855,"about_ca_system_score_codex":0.00033859405,"about_ca_system_score_gemma":0.00052882783,"threshold_uncertainty_score":0.99974763},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017116654,0.0005239646,0.99557966,0.00016325177,0.00082332164,0.00038154016,0.0000016798899,0.0004262449,0.0020832447],"genre_scores_gemma":[0.040533412,0.000020563913,0.9587904,0.00023012233,0.0002926295,0.000008810777,0.00000785192,0.000024583787,0.00009160593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971647,0.00005844623,0.000532866,0.0010201541,0.000732324,0.0004914976],"domain_scores_gemma":[0.99689925,0.0011858761,0.0005191828,0.0009635509,0.0003657683,0.00006636433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084799324,0.00045974916,0.0005589263,0.0004067803,0.00013932123,0.00019654934,0.0017451734,0.00027609625,0.000004978678],"category_scores_gemma":[0.0001125907,0.00037966427,0.00006910843,0.00065184594,0.0005080827,0.000701101,0.00030060692,0.0004896623,0.0000068561194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046040695,0.000010095525,0.000029608638,0.00006260439,0.000009616202,0.000020708736,0.00015227725,0.87220883,0.00007154586,0.034430053,0.0000099955705,0.09299006],"study_design_scores_gemma":[0.0005447289,0.00082114886,0.0008753508,0.00096170127,0.00003521608,0.000106723885,3.294816e-7,0.44096172,0.011670445,0.5407958,0.0016557383,0.0015710756],"about_ca_topic_score_codex":0.0000091305565,"about_ca_topic_score_gemma":0.00003528839,"teacher_disagreement_score":0.5063658,"about_ca_system_score_codex":0.00018258336,"about_ca_system_score_gemma":0.0003489085,"threshold_uncertainty_score":0.99986553},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007334907,0.00073169504,0.98676604,0.0050774375,0.002576116,0.0008707902,0.00000872304,0.00017759604,0.0037842407],"genre_scores_gemma":[0.0012514105,0.000028755074,0.99374646,0.0017862979,0.001243235,0.00001824548,0.0000051999814,0.000037312897,0.0018830863],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956662,0.00006247599,0.0006369615,0.0020017852,0.00078947644,0.00084310415],"domain_scores_gemma":[0.9959859,0.0013469938,0.00023945367,0.0017138575,0.00026464625,0.00044915313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009938461,0.0005710598,0.00060070725,0.0015508702,0.0005159432,0.00065461977,0.00391912,0.00034130522,0.000074909374],"category_scores_gemma":[0.00014071395,0.0004983521,0.00034515958,0.0009792756,0.00045581974,0.00060678757,0.0010871239,0.0005981371,0.000040709692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010097147,0.000025509173,0.000029578187,0.000019879562,0.000023855964,0.000023702656,0.0008970932,0.007730802,0.00044763536,0.05374952,0.00041177362,0.93663055],"study_design_scores_gemma":[0.0012494548,0.0006483115,0.0010986874,0.00051566685,0.00006861078,0.00026657435,5.1971614e-7,0.17720032,0.024140792,0.690677,0.10196539,0.0021686964],"about_ca_topic_score_codex":0.0000308716,"about_ca_topic_score_gemma":0.00014831315,"teacher_disagreement_score":0.93446183,"about_ca_system_score_codex":0.00015037286,"about_ca_system_score_gemma":0.00072930445,"threshold_uncertainty_score":0.9997468},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000097416756,0.0010159526,0.9867745,0.00033479926,0.0005587925,0.0002903427,0.0000053292256,0.0007889425,0.010133926],"genre_scores_gemma":[0.21573979,0.000018419252,0.78239775,0.0011648096,0.00040973848,0.000003854945,0.000002031086,0.00004761151,0.0002160163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540555,0.000034054294,0.0006613139,0.0018629552,0.0011793749,0.000856723],"domain_scores_gemma":[0.9972481,0.00045965172,0.00046679482,0.0012569863,0.00035454714,0.00021388002],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00074081356,0.00072754285,0.0007187282,0.0009642018,0.00038074396,0.002674086,0.005072782,0.0003646317,0.0000130927465],"category_scores_gemma":[0.00013470183,0.0006996627,0.00016652966,0.0006414906,0.0014131775,0.0028716945,0.00281627,0.00089926936,0.000025169164],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002498434,0.000034108343,0.000024831881,0.0000313683,0.000007473414,0.000086597276,0.0002498651,0.0134248575,0.0013863164,0.0057294792,0.000013138629,0.97900945],"study_design_scores_gemma":[0.00016026881,0.00007549247,0.000039149872,0.00093682174,0.0000098604805,0.00012268459,6.32785e-8,0.8347253,0.008801056,0.15249412,0.0017208838,0.00091425754],"about_ca_topic_score_codex":0.000026015006,"about_ca_topic_score_gemma":0.00004878919,"teacher_disagreement_score":0.97809523,"about_ca_system_score_codex":0.00051350833,"about_ca_system_score_gemma":0.0007455129,"threshold_uncertainty_score":0.99954545},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006550339,0.00074571226,0.9960409,0.00035684597,0.0004887888,0.0003980206,0.0000020958776,0.00029391857,0.0016082379],"genre_scores_gemma":[0.024456795,0.00016417436,0.97153014,0.0032649674,0.00022156657,0.000009532605,0.000007606684,0.000027875689,0.00031732488],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967779,0.000043685646,0.0005497381,0.0012051282,0.000937651,0.00048591945],"domain_scores_gemma":[0.9979524,0.00066177093,0.00036797023,0.00061598053,0.0001901343,0.0002117215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016054511,0.0003728892,0.00037161718,0.00060279167,0.0002098141,0.00045981724,0.0012543593,0.00027990085,0.000016567914],"category_scores_gemma":[0.0002777971,0.0003554093,0.00005528774,0.00034392063,0.0007044981,0.0009797633,0.00075544167,0.0006558646,0.000009160872],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024325375,0.000013581874,0.000024018034,0.000040256822,0.00000534281,0.00003795174,0.0009624598,0.0000307964,0.005848594,0.0035548282,0.00004212811,0.9894376],"study_design_scores_gemma":[0.0015160199,0.0009684067,0.00089674495,0.004034318,0.000036281308,0.00027733194,0.00000415224,0.23415695,0.5361209,0.21642745,0.0021995956,0.003361842],"about_ca_topic_score_codex":0.000025247315,"about_ca_topic_score_gemma":0.00003827473,"teacher_disagreement_score":0.98607576,"about_ca_system_score_codex":0.00026616323,"about_ca_system_score_gemma":0.00019824159,"threshold_uncertainty_score":0.9998898},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028916831,0.00042767837,0.99578524,0.0005535313,0.000999193,0.0015906007,0.000019659827,0.0002499837,0.00034521738],"genre_scores_gemma":[0.5722135,0.000030382284,0.42484742,0.0024013922,0.0002462536,0.00010005537,0.000011084215,0.00003924949,0.000110665234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630153,0.00013471837,0.00067896774,0.001438302,0.0007235518,0.00072291866],"domain_scores_gemma":[0.99676704,0.0007008759,0.00042701454,0.0014869233,0.00028400734,0.00033413776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017065209,0.0005498119,0.0006317426,0.00061833934,0.00024589774,0.0005658147,0.002531808,0.00042111374,0.000008343723],"category_scores_gemma":[0.00027819184,0.0005048616,0.00010950042,0.00048649576,0.00031117356,0.0008136371,0.0006760465,0.0005707742,0.000103897626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055099474,0.000053091786,0.000069533715,0.00006264435,0.000028141872,0.000021392316,0.0025733735,0.011281774,0.00048548434,0.33744803,0.000017704688,0.64790374],"study_design_scores_gemma":[0.0013583398,0.00015367023,0.00069066905,0.0006101434,0.000026587717,0.00006242999,5.4335027e-7,0.69915944,0.0005335732,0.2946517,0.0017955325,0.00095737644],"about_ca_topic_score_codex":0.00003297664,"about_ca_topic_score_gemma":0.000035352507,"teacher_disagreement_score":0.68787766,"about_ca_system_score_codex":0.00028924175,"about_ca_system_score_gemma":0.00016343885,"threshold_uncertainty_score":0.9997403},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003588445,0.00030817118,0.98227763,0.00033437487,0.00069185585,0.00040802706,0.0000017588338,0.00053723407,0.015082105],"genre_scores_gemma":[0.39980072,0.000032997774,0.5981563,0.0006631689,0.00019490284,0.000014273235,0.00001199529,0.000047578513,0.0010780867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959424,0.0000613686,0.0007378046,0.0016442963,0.0008732593,0.0007408859],"domain_scores_gemma":[0.99779457,0.00022599027,0.00039113607,0.0011904209,0.00028117222,0.00011669705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011302878,0.00055427384,0.00054473046,0.0016574105,0.00023313017,0.0005447815,0.0029121304,0.0004177748,0.000011766158],"category_scores_gemma":[0.00010085139,0.00055365416,0.00010491988,0.0013729043,0.00040467846,0.00071630103,0.00094870094,0.0009672165,0.000020908315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000697202,0.000069753936,0.0001139997,0.000050404808,0.000005285798,0.00012334448,0.0013768486,0.86653113,0.000120122604,0.010566963,0.00022527114,0.12080993],"study_design_scores_gemma":[0.00029361207,0.0001392377,0.00027324702,0.0008133103,0.0000035593584,0.000052141313,2.7666158e-7,0.9292499,0.002295985,0.06529749,0.00072274543,0.00085853034],"about_ca_topic_score_codex":0.00007453479,"about_ca_topic_score_gemma":0.000048731752,"teacher_disagreement_score":0.39944187,"about_ca_system_score_codex":0.0003519662,"about_ca_system_score_gemma":0.0005590997,"threshold_uncertainty_score":0.9996915},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078840405,0.00014004638,0.99049795,0.0001196078,0.0003420136,0.000690258,0.000015894411,0.0000908854,0.00021931525],"genre_scores_gemma":[0.94367796,0.000009589417,0.054975014,0.0005830107,0.0005492297,0.00003673277,0.00006313028,0.000059111586,0.00004622908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975967,0.0000073029523,0.0003120264,0.00096355035,0.00052324816,0.0005971711],"domain_scores_gemma":[0.99890745,0.00017108548,0.00017418184,0.00059654756,0.000030002091,0.00012073494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000422189,0.00040594657,0.00038172991,0.0001445037,0.0002954485,0.00031106596,0.00077066827,0.0002549834,0.00004266954],"category_scores_gemma":[0.0000048159695,0.00030095127,0.00007552556,0.00020920915,0.000106581065,0.0004392677,0.0002453887,0.00027126182,0.000012538673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017205988,0.0000136721355,0.003789585,0.000047376383,0.0000041190624,0.000020845182,0.00004648178,0.9912562,0.0000067548744,0.000007805095,0.0000066107054,0.004783363],"study_design_scores_gemma":[0.0003697308,0.00010928335,0.000117306314,0.00043279177,0.000021088257,0.0000051728944,6.529794e-8,0.9974657,0.00005771459,0.00058518886,0.00037755852,0.00045834295],"about_ca_topic_score_codex":0.0009242762,"about_ca_topic_score_gemma":0.0047664023,"teacher_disagreement_score":0.93579394,"about_ca_system_score_codex":0.00019809895,"about_ca_system_score_gemma":0.000044185595,"threshold_uncertainty_score":0.99994427},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004136896,0.0005413494,0.98190325,0.00032269614,0.001202168,0.0009949829,0.0000038659496,0.00014013243,0.014850199],"genre_scores_gemma":[0.043707106,0.00013713191,0.9538138,0.0014047711,0.0003938811,0.00006297044,0.00001276016,0.000032762313,0.00043484013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587774,0.00003497447,0.00066562695,0.0018879371,0.000806675,0.00072701735],"domain_scores_gemma":[0.99757713,0.0003978583,0.00027838562,0.0014651767,0.00015269987,0.00012877017],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010921893,0.00047925487,0.0005110537,0.0011594075,0.00031185502,0.000324788,0.0038884378,0.00019741422,0.000005891695],"category_scores_gemma":[0.00004464185,0.0004961004,0.00015910898,0.0005736148,0.00044027957,0.00043030173,0.0012249964,0.00063001394,0.000016785207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010574199,0.00008727984,0.000009896023,0.00014226517,0.00001640447,0.00010357723,0.0013295152,0.0869715,0.0000074421328,0.04007939,0.00021488537,0.8710273],"study_design_scores_gemma":[0.0005166443,0.000073894924,0.00006241655,0.00018164395,0.0000048687293,0.000116895746,4.2631456e-7,0.94019395,0.00033878873,0.05276735,0.0051032784,0.0006398326],"about_ca_topic_score_codex":0.000012146723,"about_ca_topic_score_gemma":0.0000060320135,"teacher_disagreement_score":0.87038743,"about_ca_system_score_codex":0.00039605016,"about_ca_system_score_gemma":0.00029010535,"threshold_uncertainty_score":0.99974906},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019509473,0.00038859484,0.9886579,0.00007373254,0.006092208,0.00030412572,0.000002168121,0.00022333757,0.0023070113],"genre_scores_gemma":[0.26832253,0.00004624959,0.7258499,0.00037835428,0.003393239,0.0000077520335,0.0000032657433,0.000105541556,0.0018931325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575746,0.00003942238,0.0005856534,0.0016807566,0.0010232226,0.0009134656],"domain_scores_gemma":[0.99743235,0.0003551826,0.00040772225,0.0012002315,0.0003965417,0.00020796953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093773153,0.00065134227,0.0006259531,0.0008439454,0.00061489234,0.00095573626,0.002981593,0.00044915086,0.00001887944],"category_scores_gemma":[0.00013516698,0.00062983297,0.00020584882,0.00042288878,0.00044976265,0.0008792824,0.0016608872,0.0017545132,0.000075167285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012046744,0.000047038007,0.0005787243,0.00018157059,0.00006913951,0.00064343744,0.010947643,0.2061559,0.024493039,0.16896777,0.000001963571,0.5879017],"study_design_scores_gemma":[0.0005477054,0.00037297973,0.00039411924,0.0035068565,0.00003563689,0.00054806774,0.0000028585282,0.8900085,0.027590033,0.049604706,0.02400468,0.003383859],"about_ca_topic_score_codex":0.00025934813,"about_ca_topic_score_gemma":0.000081670776,"teacher_disagreement_score":0.6838526,"about_ca_system_score_codex":0.00053872383,"about_ca_system_score_gemma":0.0004946831,"threshold_uncertainty_score":0.9996153},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031820561,0.00078652654,0.9938703,0.000337728,0.00068739266,0.00063511555,0.000025333422,0.00015493375,0.00032059153],"genre_scores_gemma":[0.6474803,0.000019465659,0.35167482,0.00032532457,0.00024513845,0.000016098733,0.000117013835,0.000022512515,0.00009930169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997286,0.00003742463,0.0003435447,0.0013018198,0.00061174075,0.00041943396],"domain_scores_gemma":[0.9978438,0.00043000825,0.0002807327,0.0009301524,0.00036984673,0.0001454298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004741637,0.00041968856,0.00036129783,0.000450386,0.00043953734,0.0007300078,0.0011646714,0.00017397982,0.000004772801],"category_scores_gemma":[0.000052544954,0.00033870776,0.000054363372,0.00037356938,0.0006664215,0.00066071993,0.00025539324,0.00040167785,0.0000055686933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001327744,0.00047387357,0.00028305568,0.000535566,0.000064716885,0.00016267326,0.012644372,0.08198094,0.008196727,0.6060909,0.000062499625,0.28937188],"study_design_scores_gemma":[0.00040148615,0.00027043474,0.00045856825,0.0002742541,0.000017160524,0.0001239961,0.0000012718714,0.99004054,0.0025725546,0.005166844,0.0001524943,0.00052039],"about_ca_topic_score_codex":0.000016237931,"about_ca_topic_score_gemma":0.00008760822,"teacher_disagreement_score":0.9080596,"about_ca_system_score_codex":0.00012002448,"about_ca_system_score_gemma":0.000205749,"threshold_uncertainty_score":0.9999065},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010264821,0.00026295506,0.9934348,0.00057977386,0.001275275,0.00058250845,0.0000100977195,0.0005495916,0.0022785289],"genre_scores_gemma":[0.5306166,0.000011254581,0.4688825,0.00028212735,0.00008206144,0.000009823664,0.000005056352,0.000024647827,0.00008596321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959043,0.000052664753,0.0008372812,0.0014287643,0.0011471546,0.00062982726],"domain_scores_gemma":[0.9961713,0.0003234944,0.0008712738,0.0021989476,0.00032980638,0.00010517347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047682316,0.0005909287,0.0007214052,0.00076844846,0.0003609083,0.000584826,0.0042502694,0.0005296897,0.000017191633],"category_scores_gemma":[0.000047881258,0.0005241996,0.00018954473,0.00079964835,0.00090290763,0.0012091564,0.0013166511,0.0007738443,0.000020631622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011187154,0.00006719839,0.00024073951,0.0005248039,0.00005389812,0.00005460528,0.00138431,0.08370632,0.003435368,0.7815934,0.00007829855,0.12884991],"study_design_scores_gemma":[0.00043604965,0.00008354527,0.00013615584,0.0011896222,0.000023336905,0.000044130564,0.000003802105,0.26066408,0.011011237,0.72512364,0.00045004563,0.00083435193],"about_ca_topic_score_codex":0.00016502476,"about_ca_topic_score_gemma":0.000021167085,"teacher_disagreement_score":0.5295901,"about_ca_system_score_codex":0.0005842803,"about_ca_system_score_gemma":0.0005472907,"threshold_uncertainty_score":0.99972093},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005670915,0.006364317,0.9784456,0.0001354802,0.0008748788,0.00043181996,0.000007757824,0.0002187608,0.007850507],"genre_scores_gemma":[0.99319375,0.0007781775,0.0049265516,0.00017041672,0.0006822882,0.000025250969,0.000016496351,0.00006113067,0.00014591387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826306,0.00000840497,0.00033560357,0.0006078963,0.00023368438,0.0005513401],"domain_scores_gemma":[0.99917513,0.00016025902,0.00006442701,0.00045398754,0.000056808993,0.00008941293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002610755,0.0003774054,0.00034237106,0.00045941054,0.00010597596,0.000115426286,0.0006085882,0.00035144633,0.000014180168],"category_scores_gemma":[0.0000077915465,0.0003936533,0.000035580793,0.0004138362,0.00020840637,0.00024698148,0.00026504675,0.00080803956,0.000009261681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010884471,0.0000037766151,0.00039733062,0.00006077237,0.000002734412,0.000007516221,0.000105691644,0.861664,0.000015243175,0.00025093678,0.00008511545,0.13740578],"study_design_scores_gemma":[0.00013004568,0.000023212286,0.006355989,0.00036935046,0.000004354527,0.00002459415,3.313439e-8,0.99005294,0.00005979135,0.0014092786,0.00115112,0.00041930086],"about_ca_topic_score_codex":0.000009888543,"about_ca_topic_score_gemma":0.00023426811,"teacher_disagreement_score":0.98752284,"about_ca_system_score_codex":0.00021933616,"about_ca_system_score_gemma":0.000045024237,"threshold_uncertainty_score":0.9998515},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025517066,0.00029669385,0.99159414,0.00094265246,0.00010479807,0.0012037595,0.000010711538,0.00011264894,0.005479409],"genre_scores_gemma":[0.7724059,0.000013840932,0.22643371,0.00086137233,0.00007390028,0.00008725748,0.0000066027555,0.000020851294,0.000096569864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962657,0.000040711828,0.00078675186,0.0013398031,0.00103178,0.0005352196],"domain_scores_gemma":[0.99661696,0.00059939123,0.00047935251,0.0017883186,0.00037149817,0.00014448048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000838839,0.0004742717,0.0006204502,0.0009814003,0.00010464411,0.00023179324,0.003207776,0.00023938894,0.000028726974],"category_scores_gemma":[0.000036327136,0.00043491996,0.00008427344,0.0009253506,0.0008295778,0.0004398353,0.0004291585,0.0007094375,0.000015974581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029864188,0.00021667861,0.00011393372,0.00010732141,0.000012963017,0.000014411916,0.0013516463,0.2208077,0.00075536163,0.189952,0.000012813937,0.5866253],"study_design_scores_gemma":[0.001657143,0.00081877096,0.00027089578,0.0010462209,0.000016318307,0.00003388816,0.0000018709818,0.7671735,0.026071478,0.18376417,0.017745975,0.0013997596],"about_ca_topic_score_codex":0.000050619463,"about_ca_topic_score_gemma":0.00053890195,"teacher_disagreement_score":0.7721507,"about_ca_system_score_codex":0.00039664257,"about_ca_system_score_gemma":0.0010697062,"threshold_uncertainty_score":0.9998103},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035866408,0.0008966968,0.9922754,0.00012400604,0.00090712326,0.00031562208,0.000026067035,0.000026558964,0.0018418734],"genre_scores_gemma":[0.56837845,0.0000755596,0.42076707,0.002363233,0.0046537225,0.000024423105,0.00043162674,0.00007454283,0.0032313948],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980744,0.000011975172,0.00028331828,0.0009723041,0.00021438666,0.00044360105],"domain_scores_gemma":[0.99914765,0.00008848747,0.00013420443,0.00039784028,0.00016221224,0.00006960014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003824642,0.00032564107,0.00028325096,0.00011130809,0.00014389309,0.00009532746,0.0007002183,0.00041848177,0.000004022099],"category_scores_gemma":[0.00007601802,0.00026122987,0.00015271,0.00008625574,0.00031658067,0.000003898818,0.00042324624,0.00020228075,0.0000048381767],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038478272,0.000053614967,0.00019831026,0.000050896262,0.000031450294,0.000022261218,0.000017905368,0.01798441,0.1555882,0.00031506454,0.00056747784,0.82513195],"study_design_scores_gemma":[0.0015366989,0.0030294284,0.00079795124,0.0003420584,0.00005706834,0.00012401641,2.3213315e-7,0.14986521,0.6664268,0.085549906,0.08926378,0.0030068746],"about_ca_topic_score_codex":0.00000845576,"about_ca_topic_score_gemma":0.000020256786,"teacher_disagreement_score":0.8221251,"about_ca_system_score_codex":0.00003969581,"about_ca_system_score_gemma":0.00014026623,"threshold_uncertainty_score":0.99998397},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008685881,0.0018419105,0.9838818,0.00090674846,0.0018529069,0.0005017054,0.000012056332,0.00027371122,0.0106423255],"genre_scores_gemma":[0.025862709,0.00045653316,0.969736,0.0031998176,0.00029865236,0.000011003307,0.000007593188,0.00004993951,0.00037775628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949486,0.000054208766,0.0006284262,0.0022971288,0.0010548068,0.0010168037],"domain_scores_gemma":[0.9972658,0.00022007475,0.0003344826,0.0016788217,0.00018199226,0.00031880708],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080065307,0.00079566,0.00074867456,0.0007400452,0.000485208,0.0009697214,0.0033560917,0.00050723256,0.000023414457],"category_scores_gemma":[0.00006669488,0.0006885292,0.00014897723,0.00066611974,0.0012681,0.0007896384,0.0022098252,0.0010316134,0.00009783143],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041267963,0.000062969295,0.000082654464,0.000071824266,0.000022048329,0.00031426657,0.001998504,0.0046335757,0.000014064902,0.030491013,0.00024778777,0.9620572],"study_design_scores_gemma":[0.00054279563,0.00018433889,0.00039516558,0.00031182062,0.000011018905,0.00025115593,2.6820064e-7,0.85756576,0.000040361574,0.13581456,0.003843259,0.0010394753],"about_ca_topic_score_codex":0.000038486287,"about_ca_topic_score_gemma":0.000029677167,"teacher_disagreement_score":0.96101767,"about_ca_system_score_codex":0.00021581519,"about_ca_system_score_gemma":0.00020416104,"threshold_uncertainty_score":0.9995566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.882658e-7,0.00025990754,0.90089494,0.00019049855,0.0021689252,0.093932554,0.000004227885,0.00047307246,0.002074899],"genre_scores_gemma":[0.0011565005,0.000015171465,0.8792904,0.0019034205,0.0034929619,0.11319797,0.000007813092,0.00012427468,0.00081148825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99338424,0.000044010154,0.000980612,0.002670071,0.0011895248,0.0017315372],"domain_scores_gemma":[0.99544823,0.0007820647,0.0006557053,0.0024073182,0.00039245977,0.00031421575],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016264977,0.00092365086,0.0008851223,0.00044461843,0.0006307216,0.0010336223,0.0056382213,0.00062279234,0.000054023312],"category_scores_gemma":[0.00006825598,0.0008647126,0.0003153286,0.0010335529,0.0006317486,0.0008223821,0.0022473712,0.0011949419,0.000054792687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017329168,0.00003066561,0.0000071676372,0.00007974448,0.000010253632,0.00002903142,0.0003028151,0.4386373,0.0000089625855,0.024565578,0.00020609392,0.5361051],"study_design_scores_gemma":[0.0014006505,0.000966322,0.000017929598,0.0018746105,0.000011231504,0.00006693202,1.313095e-7,0.5864432,0.00066306104,0.34463742,0.062483057,0.0014354518],"about_ca_topic_score_codex":0.0000069864495,"about_ca_topic_score_gemma":0.000055249908,"teacher_disagreement_score":0.53466964,"about_ca_system_score_codex":0.0007861309,"about_ca_system_score_gemma":0.0015166147,"threshold_uncertainty_score":0.99974173},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000097676195,0.0004016214,0.99257314,0.0003342584,0.0022783226,0.0004250502,0.0000013337897,0.0001669372,0.00372166],"genre_scores_gemma":[0.34087282,0.000011860765,0.6550238,0.0030242282,0.0005521364,0.0000074022123,0.000003950441,0.000046420268,0.00045736873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949007,0.00007976334,0.0007142611,0.0020737096,0.0012645482,0.000967031],"domain_scores_gemma":[0.9967799,0.0002914699,0.00037034106,0.001867408,0.00033292721,0.00035795776],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017447768,0.00062176015,0.000896553,0.0019902354,0.00038445642,0.0011008527,0.0033559192,0.00036019873,0.00002719333],"category_scores_gemma":[0.00014537713,0.0005545649,0.00034329545,0.0029030908,0.0003492665,0.00045634405,0.0011101359,0.0006069553,0.00009575773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073174165,0.00007194019,0.0009187893,0.0000857287,0.00027611645,0.00032351483,0.0027258343,0.2650454,0.00018311394,0.1809361,0.00006157113,0.54936457],"study_design_scores_gemma":[0.00026559902,0.00016520087,0.00010719746,0.000112620604,0.00014506067,0.00013371464,6.7990106e-7,0.7984814,0.000875486,0.18648933,0.011643964,0.0015797763],"about_ca_topic_score_codex":0.00011179044,"about_ca_topic_score_gemma":0.00012019556,"teacher_disagreement_score":0.5477848,"about_ca_system_score_codex":0.00043389882,"about_ca_system_score_gemma":0.00036022183,"threshold_uncertainty_score":0.9999361},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008735791,0.0011749401,0.992609,0.000115539435,0.003336864,0.0018145315,0.0000021722096,0.00036157278,0.0004979714],"genre_scores_gemma":[0.36207795,0.000006016555,0.6367891,0.00006338217,0.00075501134,0.00013053237,0.000003117556,0.00004139049,0.00013349442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588627,0.000046119567,0.00053407066,0.0018480065,0.00081127736,0.000874243],"domain_scores_gemma":[0.9969999,0.0004885284,0.0005540449,0.0011594327,0.00053898024,0.00025907892],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013374384,0.0006341927,0.00075008464,0.00052777433,0.00067067327,0.0020071473,0.0017631516,0.0006031578,8.0822736e-7],"category_scores_gemma":[0.00011069263,0.0004893683,0.00010445847,0.0005082528,0.0007994145,0.00073694804,0.00057562155,0.0010575047,0.000006934249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012398665,0.00001776055,0.00017521669,0.00029609894,0.000029586048,0.000048089092,0.0015752577,0.0005550237,0.000021045475,0.7643299,0.0000014702207,0.23293814],"study_design_scores_gemma":[0.0020048514,0.0031644301,0.00033618332,0.004947144,0.00017676454,0.004313871,0.000052000876,0.3931378,0.0008287714,0.54891986,0.037192225,0.004926106],"about_ca_topic_score_codex":0.00009041572,"about_ca_topic_score_gemma":0.000096650154,"teacher_disagreement_score":0.39258277,"about_ca_system_score_codex":0.0002935525,"about_ca_system_score_gemma":0.00045609535,"threshold_uncertainty_score":0.9997558},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011722384,0.0001525647,0.9966858,0.0000914257,0.0008522626,0.0005004267,0.000017348428,0.000017445533,0.0005104854],"genre_scores_gemma":[0.9770078,0.000015737014,0.021121277,0.000571445,0.0007231706,0.000024582745,0.00023554049,0.000052482585,0.00024798134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824524,0.000015832646,0.000291718,0.0008206978,0.00033354602,0.00029296117],"domain_scores_gemma":[0.99888897,0.000060446215,0.00014140873,0.00060586334,0.00022636114,0.00007695665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019985154,0.00031263943,0.0002518511,0.00021177487,0.00018020457,0.00009949418,0.00040557774,0.00027923984,0.0000065595286],"category_scores_gemma":[0.000041621304,0.00030493212,0.00018511481,0.00007899647,0.00008136223,0.0000074324425,0.000075585885,0.00023799953,0.000008331218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034530687,0.000034080913,7.4063746e-7,0.000036381516,0.0000075048606,0.0000034598695,0.000008772031,0.8985035,0.09624778,0.00031954117,0.000025659901,0.004778087],"study_design_scores_gemma":[0.00030693237,0.00037336288,6.326784e-7,0.00019354568,0.000012384517,0.0000034803777,8.802557e-8,0.969228,0.026403416,0.0006575651,0.0024947233,0.00032583508],"about_ca_topic_score_codex":0.000010691882,"about_ca_topic_score_gemma":0.000009828634,"teacher_disagreement_score":0.97583556,"about_ca_system_score_codex":0.000095104464,"about_ca_system_score_gemma":0.00025172677,"threshold_uncertainty_score":0.9999403},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020070677,0.00036789395,0.960038,0.0046727806,0.0026365218,0.00030086594,0.0000021752182,0.00020381363,0.03157724],"genre_scores_gemma":[0.5345716,0.0002786743,0.4200524,0.039234594,0.0025309518,0.000032466738,0.0000048106576,0.00010461042,0.003189909],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967382,0.00003664707,0.00037163158,0.0011845902,0.0009688466,0.0007001099],"domain_scores_gemma":[0.99644303,0.0013591251,0.00018585724,0.0017670252,0.00013895311,0.000105976505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014529632,0.00045747988,0.00038926848,0.0006914759,0.00026900132,0.00049510325,0.0052772905,0.00028676464,0.00004537418],"category_scores_gemma":[0.0001771805,0.00029231384,0.00014016403,0.0005035904,0.0008811818,0.00026432335,0.001584982,0.000956627,0.00022154866],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005934715,0.000023258524,0.00003285367,0.000014327466,0.0000099201,0.00015302924,0.00084456854,0.00058710406,0.000056001172,0.17544238,0.00021550749,0.8226151],"study_design_scores_gemma":[0.00040995004,0.00057519163,0.00053049234,0.0010252337,0.000013096835,0.00019309943,0.0000014860074,0.34288353,0.004289596,0.6225761,0.026000388,0.0015017958],"about_ca_topic_score_codex":0.00001951087,"about_ca_topic_score_gemma":0.00017686553,"teacher_disagreement_score":0.82111335,"about_ca_system_score_codex":0.00020541463,"about_ca_system_score_gemma":0.00029461255,"threshold_uncertainty_score":0.9999529},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024445527,0.00016406827,0.9951594,0.00014616417,0.0008533914,0.0002524723,0.0000035974076,0.0000577551,0.0031187346],"genre_scores_gemma":[0.10904268,0.000119131444,0.8890696,0.00033496294,0.00030973437,0.000009156119,0.000016464759,0.000024673798,0.0010735865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979453,0.000011057631,0.00035271357,0.00082378846,0.00059996685,0.00026715366],"domain_scores_gemma":[0.9985726,0.0001462466,0.00026718673,0.0008142735,0.00012723739,0.000072467315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326177,0.00023172697,0.00023690109,0.0007196671,0.0000910018,0.00025863037,0.0013274826,0.00016025522,0.00000974242],"category_scores_gemma":[0.000022381582,0.00021810965,0.000043921635,0.0003527831,0.00038790368,0.0009612539,0.0006835288,0.00031332654,0.0000122296315],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015096729,0.000021575928,0.00012173504,0.000018235492,0.0000029891014,0.000018013316,0.00008035819,0.00006545225,0.0003931249,0.033251792,0.0000132023315,0.966012],"study_design_scores_gemma":[0.0010630464,0.00061784964,0.08165832,0.00080613734,0.00009257,0.00017411845,0.0000011098252,0.76356417,0.0065647173,0.11365939,0.029533982,0.0022646121],"about_ca_topic_score_codex":0.000010378462,"about_ca_topic_score_gemma":0.000026179208,"teacher_disagreement_score":0.9637474,"about_ca_system_score_codex":0.00007714709,"about_ca_system_score_gemma":0.00007908987,"threshold_uncertainty_score":0.88942534},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058813588,0.00037160542,0.9967516,0.0012873703,0.00013058376,0.0005716128,0.000010214189,0.00019971098,0.00061845285],"genre_scores_gemma":[0.15878181,0.0001817289,0.83970624,0.00095287384,0.00015133992,0.00002827927,0.000021337848,0.000035436817,0.00014097383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678767,0.000055910034,0.00044654188,0.0014247211,0.0008443066,0.0004408257],"domain_scores_gemma":[0.99766576,0.00049924885,0.00026383324,0.0010887128,0.0003651118,0.00011733249],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083403656,0.0004355354,0.0004104795,0.0005624953,0.00016490943,0.00044789826,0.0013768394,0.00016422986,0.000007875536],"category_scores_gemma":[0.00033194353,0.00036021374,0.000038018185,0.0008022173,0.0009169766,0.0010598961,0.00041477196,0.00060964824,0.0000058523874],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004699435,0.000141358,0.00039409692,0.0002446634,0.0000074729796,0.00010290223,0.00038731223,0.004693583,0.0015194891,0.038744293,0.000018221459,0.9536996],"study_design_scores_gemma":[0.0007270799,0.00032427727,0.0019164446,0.0011026642,0.000016679867,0.0000707895,3.4820306e-7,0.88672054,0.028800365,0.075701416,0.003265795,0.0013535836],"about_ca_topic_score_codex":0.000038725033,"about_ca_topic_score_gemma":0.00031532644,"teacher_disagreement_score":0.952346,"about_ca_system_score_codex":0.00030280717,"about_ca_system_score_gemma":0.0006382532,"threshold_uncertainty_score":0.99988496},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020214738,0.0000053978456,0.9653421,0.03169587,0.000097154065,0.00067191484,0.0000021780602,0.000098567696,0.000065354856],"genre_scores_gemma":[0.28309152,1.7790173e-7,0.7090617,0.007592928,0.00019029106,0.00003379446,0.000010415524,0.0000059172103,0.0000132766145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988746,0.000016143063,0.00017880416,0.00041143238,0.00028620657,0.00023279067],"domain_scores_gemma":[0.99916285,0.00020197075,0.000039739683,0.00039162347,0.000070810325,0.00013299493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041768455,0.00010185879,0.00013849164,0.00016703067,0.00007880729,0.000052525425,0.00022070605,0.000027692924,0.000016725851],"category_scores_gemma":[0.00018551375,0.00008042784,0.00003850527,0.00073938124,0.00006080158,0.000041605814,0.000030951607,0.00012466875,0.0000043182145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009218732,0.0002922696,0.0012342436,0.00006170798,0.0000026305495,0.000016715225,0.000088168155,0.023775887,0.12323935,0.0014009116,0.024823619,0.82497233],"study_design_scores_gemma":[0.00046264686,0.00028190267,0.001515052,0.00015896178,0.000006510062,0.000011139265,8.0152425e-8,0.82981706,0.15801346,0.0039625596,0.005671205,0.00009944645],"about_ca_topic_score_codex":0.00021997165,"about_ca_topic_score_gemma":0.0000344416,"teacher_disagreement_score":0.82487285,"about_ca_system_score_codex":0.000079819365,"about_ca_system_score_gemma":0.00019766144,"threshold_uncertainty_score":0.3279752},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021267373,0.00040483306,0.97610784,0.000010869992,0.0017952478,0.00021628215,0.0000066654306,0.000031772193,0.00015909506],"genre_scores_gemma":[0.9687239,0.000015806329,0.030727858,0.00026021592,0.00018302331,0.0000013329862,0.000010581645,0.000023535435,0.00005378051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984203,0.000035889367,0.0004193359,0.00049179397,0.0003844046,0.00024829694],"domain_scores_gemma":[0.99918187,0.00008574076,0.00028675311,0.00029404368,0.00009658233,0.00005503522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037625473,0.00022197765,0.00028523497,0.00032583822,0.00016836387,0.00018995837,0.0002883986,0.00015892724,0.000033498338],"category_scores_gemma":[0.00004074523,0.00021962497,0.00007526647,0.00036798802,0.00045053076,0.00028196815,0.000112545655,0.00025062496,0.0000030188528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002118288,0.00008659113,0.07771,0.00047091843,0.000060777103,0.00011973985,0.0009659477,0.42708397,0.0020649405,0.0009668982,0.00006600572,0.49038303],"study_design_scores_gemma":[0.00023856664,0.000015568003,0.012246725,0.00026869628,0.000028769147,0.000107017615,3.4956145e-7,0.98132646,0.00026582615,0.005205564,0.00006222418,0.00023425893],"about_ca_topic_score_codex":0.0000294245,"about_ca_topic_score_gemma":0.00004840237,"teacher_disagreement_score":0.9474565,"about_ca_system_score_codex":0.00005889813,"about_ca_system_score_gemma":0.00003990208,"threshold_uncertainty_score":0.8956046},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003298611,0.0008121623,0.9894285,0.0026329164,0.0011014126,0.00038074565,0.0000043929767,0.0024158808,0.0031909556],"genre_scores_gemma":[0.02900715,0.00008981725,0.9614568,0.008648426,0.0005217352,0.000008803256,0.0000012413069,0.00005785926,0.00020819964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952644,0.00006079028,0.0006299246,0.0018138889,0.001232889,0.0009980998],"domain_scores_gemma":[0.9949201,0.0015743528,0.00036163928,0.0027416826,0.00022262268,0.00017962666],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012817301,0.0007173932,0.0005900614,0.0007478898,0.0007985505,0.0013530281,0.006140446,0.0005461646,0.000074369294],"category_scores_gemma":[0.00026800198,0.0005573237,0.0002172527,0.0009954231,0.0009063488,0.0005604887,0.001808911,0.001712616,0.000045369237],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074236364,0.000038977625,0.00011878748,0.000040734132,0.000024892686,0.0001340492,0.004689309,0.06349618,0.00002923421,0.0086476635,0.001194181,0.9215786],"study_design_scores_gemma":[0.000065330256,0.000061489096,0.0000107832,0.0009310442,0.000010107378,0.00016039071,9.893617e-8,0.4985569,0.00045226343,0.49769604,0.001489595,0.0005659456],"about_ca_topic_score_codex":0.00010008978,"about_ca_topic_score_gemma":0.000012885049,"teacher_disagreement_score":0.92101264,"about_ca_system_score_codex":0.0003368097,"about_ca_system_score_gemma":0.00067467167,"threshold_uncertainty_score":0.99968785},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003820026,0.00070078654,0.9917369,0.00057776144,0.0025300095,0.00040948763,0.000003448892,0.00025507194,0.0034045235],"genre_scores_gemma":[0.18342844,0.000070002396,0.80902505,0.005113228,0.0017842087,0.0000101996575,0.000030645846,0.00007059926,0.0004676056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961372,0.000037943413,0.00063970004,0.0014692103,0.0009967193,0.0007192531],"domain_scores_gemma":[0.99755526,0.0005465974,0.0003162191,0.0010526604,0.00029352782,0.00023573478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006333049,0.0005495462,0.0005633087,0.0012095018,0.0002896004,0.00049940625,0.0024806208,0.00033892068,0.000023756578],"category_scores_gemma":[0.000031297135,0.00053380046,0.00019288926,0.00072201976,0.00048200513,0.0006516187,0.0010548574,0.00072755135,0.00013208913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001032217,0.000025471998,0.0000063721413,0.000026494288,0.0000113681535,0.00015137032,0.0003249145,0.013135859,0.00035621398,0.027042406,0.000024433699,0.9588848],"study_design_scores_gemma":[0.00083627977,0.0003210786,0.0004571144,0.00043973047,0.0000141702785,0.00023013471,1.6971632e-7,0.5762887,0.00397337,0.4066432,0.009561318,0.0012347454],"about_ca_topic_score_codex":0.000033556225,"about_ca_topic_score_gemma":0.00004492777,"teacher_disagreement_score":0.95765,"about_ca_system_score_codex":0.00041438156,"about_ca_system_score_gemma":0.00041656964,"threshold_uncertainty_score":0.99971133},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036069785,0.0022896286,0.9926514,0.0022159545,0.00045343905,0.0007999465,0.000018597553,0.0005452148,0.0009897731],"genre_scores_gemma":[0.022772903,0.000016671609,0.97509724,0.0014991511,0.00025676622,0.000049291408,0.00001062376,0.000048771406,0.00024856726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962851,0.000017669492,0.00048253784,0.001637487,0.0007851535,0.00079205784],"domain_scores_gemma":[0.9970946,0.00036607392,0.00036721223,0.0014955163,0.00054589065,0.00013074708],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005106863,0.0006628164,0.0006315177,0.0006549159,0.00031168186,0.00084624725,0.0046099657,0.00033107458,0.000009759034],"category_scores_gemma":[0.0002826381,0.0005072975,0.00009643279,0.0007908573,0.0009874359,0.0008057243,0.0012898691,0.0006698366,0.0000052342366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027410957,0.00003062172,0.000045720815,0.00021926548,0.000029236891,0.00038747035,0.0010201642,0.00079661474,0.00016222082,0.53625816,0.00005145904,0.46097168],"study_design_scores_gemma":[0.0009705337,0.00032253354,0.000025635927,0.0031682868,0.000027693748,0.0002916998,0.0000012400398,0.007419645,0.007934442,0.9764532,0.0016371302,0.0017479786],"about_ca_topic_score_codex":0.00007027636,"about_ca_topic_score_gemma":0.00045375235,"teacher_disagreement_score":0.4592237,"about_ca_system_score_codex":0.0004586789,"about_ca_system_score_gemma":0.0019059145,"threshold_uncertainty_score":0.99973786},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001429746,0.00070391904,0.9869313,0.00039141864,0.0021849289,0.0008078371,0.000009066766,0.00025869333,0.008569851],"genre_scores_gemma":[0.070365146,0.00003568586,0.9280221,0.00075057254,0.0004725218,0.000009718441,0.0000066872344,0.000050336323,0.0002872233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993299,0.00006837767,0.0012104072,0.002346638,0.0019292925,0.0011462542],"domain_scores_gemma":[0.9947972,0.0007515882,0.0006774277,0.002787672,0.00068031123,0.00030576784],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023782775,0.0007926307,0.0011105449,0.0013503606,0.00025824533,0.00037561342,0.006414457,0.00048142555,0.000060302005],"category_scores_gemma":[0.00011936493,0.00073990016,0.00028175584,0.0017449851,0.002789948,0.00059264916,0.0036577934,0.0010441109,0.000045642824],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007998453,0.00018102139,0.00020231128,0.00019661953,0.000027469145,0.00010547713,0.0006564633,0.101684056,0.00027761539,0.08922474,0.000028524355,0.8074077],"study_design_scores_gemma":[0.0002721046,0.0002906244,0.00051130756,0.00021478631,0.000007943717,0.000084237836,1.1522976e-7,0.50636727,0.0014106982,0.48899865,0.0011177437,0.0007245224],"about_ca_topic_score_codex":0.00013908227,"about_ca_topic_score_gemma":0.0003673386,"teacher_disagreement_score":0.8066832,"about_ca_system_score_codex":0.0006501957,"about_ca_system_score_gemma":0.00093336473,"threshold_uncertainty_score":0.9999239},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000115782874,0.0008195918,0.9926459,0.0025132108,0.00031532612,0.00089593173,0.000019750281,0.00012101147,0.0025534902],"genre_scores_gemma":[0.70961165,0.00008670807,0.2887072,0.0009812986,0.00024297634,0.00008214197,0.000043404143,0.00004325038,0.00020136086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996634,0.000044563378,0.0006042138,0.0013408681,0.00070564257,0.0006707045],"domain_scores_gemma":[0.9971633,0.0004484578,0.00018479068,0.001850439,0.00021929352,0.00013373689],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008495136,0.00049065426,0.0006032341,0.0005638892,0.00023608812,0.000596756,0.0037208705,0.0003300568,0.000005535952],"category_scores_gemma":[0.00002911061,0.00042462847,0.00010080425,0.00071801216,0.00055283494,0.00067980174,0.00038169316,0.00073334976,0.000011151098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037829624,0.00005582304,0.00013222585,0.00008520081,0.000015537145,0.00004480708,0.0016120867,0.10113947,0.000019554016,0.026932985,0.00007431222,0.86985016],"study_design_scores_gemma":[0.001171344,0.0005208683,0.0008652359,0.0027056874,0.00001444548,0.00014178996,0.0000021497356,0.8909277,0.00022147063,0.055562504,0.046198085,0.0016687587],"about_ca_topic_score_codex":0.00012029889,"about_ca_topic_score_gemma":0.0010956553,"teacher_disagreement_score":0.8681814,"about_ca_system_score_codex":0.00025533306,"about_ca_system_score_gemma":0.00042770454,"threshold_uncertainty_score":0.99982053},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011668391,0.000115130664,0.9894088,0.0008982114,0.0027221818,0.0005848121,0.00002844462,0.000050580376,0.006075179],"genre_scores_gemma":[0.5715541,0.00022986624,0.40173244,0.017132392,0.0025420175,0.00015392927,0.00009872487,0.0001629118,0.0063935816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696887,0.000025321475,0.00041454897,0.0014109346,0.0005554527,0.0006248846],"domain_scores_gemma":[0.9975798,0.0007374107,0.00026995246,0.00084721285,0.00044833822,0.00011730089],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039936963,0.00050408527,0.00043641138,0.0007207082,0.00022524945,0.00043641997,0.002152692,0.0002583903,0.00007552386],"category_scores_gemma":[0.00015577927,0.0004442865,0.00019081194,0.0003020482,0.00032203732,0.0007444661,0.00051290443,0.00063167757,0.00027747446],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036229692,0.00010787614,0.000007425529,0.000045881377,0.000032234042,0.000037487982,0.000724346,0.0049807862,0.00072933995,0.01356722,0.0006047528,0.9791264],"study_design_scores_gemma":[0.0010447765,0.0027256212,0.000085125575,0.0015220793,0.000030152994,0.00007243215,6.372408e-7,0.676934,0.08319188,0.22123685,0.011303945,0.0018524696],"about_ca_topic_score_codex":0.000007562862,"about_ca_topic_score_gemma":0.000015792362,"teacher_disagreement_score":0.97727394,"about_ca_system_score_codex":0.00024709507,"about_ca_system_score_gemma":0.00011358868,"threshold_uncertainty_score":0.99980086},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50794166,0.000085198015,0.49056172,0.0012449337,0.000067183,0.00006127647,3.4124838e-7,0.000029266334,0.000008440883],"genre_scores_gemma":[0.8377312,0.000010598258,0.15979071,0.0023959198,0.000060147944,0.000001230334,0.0000027131312,0.000006147947,0.0000013497977],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838686,0.000060325143,0.0001970977,0.00053597445,0.00044151684,0.000378221],"domain_scores_gemma":[0.9989413,0.00041273655,0.00004337099,0.00028581388,0.00006400269,0.00025279738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050046283,0.00014903695,0.00034583642,0.00026110988,0.00021071572,0.000045228786,0.00020091678,0.000098007105,0.000034373275],"category_scores_gemma":[0.00064517884,0.000107125845,0.000070369366,0.0017102672,0.0010597827,0.000058276986,0.00009546928,0.0006532666,0.000004257586],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005755193,0.00013633716,0.77877384,0.000023679459,0.000038601498,0.0014653467,0.0003394335,0.14886086,0.015166502,0.000013426397,0.000017225302,0.05510719],"study_design_scores_gemma":[0.00045091216,0.000131044,0.2804337,0.000018896437,0.000043587304,0.0003822425,2.8161764e-7,0.716393,0.0019475877,0.00008630612,0.000018349352,0.000094093055],"about_ca_topic_score_codex":0.00003962246,"about_ca_topic_score_gemma":0.000008414394,"teacher_disagreement_score":0.5675321,"about_ca_system_score_codex":0.00005784805,"about_ca_system_score_gemma":0.00015972655,"threshold_uncertainty_score":0.43684652},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005422395,0.000103280676,0.9863821,0.0021721767,0.0005287541,0.0004485102,0.0000045873394,0.00016424437,0.010142069],"genre_scores_gemma":[0.15092622,0.000080482794,0.84765106,0.0004508754,0.00032643476,0.000029066545,0.000008194948,0.000022970831,0.0005046775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648404,0.000077945464,0.00076411426,0.0012789889,0.00092865486,0.0004662733],"domain_scores_gemma":[0.99642557,0.0012971794,0.0005739011,0.0013895484,0.00017412276,0.00013970475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081552606,0.00039032046,0.0006523835,0.00083818263,0.00018890774,0.00018793951,0.0029039134,0.00020151629,0.000022189275],"category_scores_gemma":[0.00004608582,0.00032193627,0.00012587858,0.0011892855,0.00095509103,0.00022087627,0.00070407847,0.0007694814,0.00003087462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031766135,0.00007515804,0.00008794957,0.000024014837,0.000006817631,0.0000050840317,0.00023150565,0.013383565,0.0004884709,0.24999025,0.0002275535,0.73547643],"study_design_scores_gemma":[0.00018965897,0.00026566375,0.00037058626,0.00030722425,0.000009045467,0.000007312683,1.3588635e-7,0.7609068,0.0016237411,0.23290113,0.00301805,0.0004006476],"about_ca_topic_score_codex":0.000032054355,"about_ca_topic_score_gemma":0.000060850904,"teacher_disagreement_score":0.74752325,"about_ca_system_score_codex":0.00017156563,"about_ca_system_score_gemma":0.00015601802,"threshold_uncertainty_score":0.9999233},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000065859866,0.0005656299,0.99386674,0.0012522567,0.0010956469,0.0009184751,0.000016793672,0.0002523813,0.0019662026],"genre_scores_gemma":[0.08872966,0.000007085652,0.9061232,0.00317308,0.0007321983,0.000098859644,0.000011577966,0.00004642042,0.0010778911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958618,0.000026326134,0.00054685795,0.0018314795,0.00074561144,0.0009879055],"domain_scores_gemma":[0.9969943,0.000875944,0.00026144087,0.001228081,0.00031730076,0.00032294603],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010334431,0.00060223177,0.0006147967,0.00082788937,0.00040683048,0.0008205505,0.003573398,0.00032902445,0.000024311268],"category_scores_gemma":[0.00009796979,0.00057903375,0.00014734593,0.000503743,0.00024686754,0.00049915764,0.0010345527,0.0007260242,0.000063598134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012046464,0.000016482127,0.000044521068,0.00004724524,0.000010332473,0.00004363443,0.0024295067,0.43187076,0.00017245168,0.006292452,0.00020424854,0.5588563],"study_design_scores_gemma":[0.00041214217,0.00072274875,0.000048291073,0.0015451901,0.000012493334,0.00008457452,6.6422126e-7,0.9291992,0.0009988861,0.041631773,0.024069041,0.0012750046],"about_ca_topic_score_codex":0.000016269858,"about_ca_topic_score_gemma":0.000032458687,"teacher_disagreement_score":0.5575813,"about_ca_system_score_codex":0.00025437566,"about_ca_system_score_gemma":0.0007171656,"threshold_uncertainty_score":0.9996661},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035029792,0.0008508951,0.99632066,0.00009363848,0.0012408951,0.0003382441,0.0000036077038,0.00059793814,0.00020381216],"genre_scores_gemma":[0.16209161,0.000024011226,0.83703107,0.000252839,0.0005002126,0.0000098341525,0.0000032710238,0.000044503984,0.000042670035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961489,0.000026685717,0.00055076566,0.0012422927,0.0011866321,0.0008447331],"domain_scores_gemma":[0.9977101,0.00007213977,0.00020206434,0.0016455185,0.00015032518,0.00021987119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000986458,0.0005594871,0.00048636433,0.0007466714,0.00016877968,0.00033150657,0.0028063108,0.00035144982,0.000022167907],"category_scores_gemma":[0.000012728611,0.00054657395,0.00013106801,0.00034564023,0.0001669827,0.0006519284,0.0020309947,0.000878981,0.000019520388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017901308,0.000019490424,0.000015983895,0.000026909103,0.000008793325,0.00005342353,0.00093839393,0.50116926,0.00044039183,0.02714855,0.0000024140684,0.4701746],"study_design_scores_gemma":[0.00011340852,0.000045963498,0.0000040929604,0.0002972429,0.000009255733,0.000059186055,4.84974e-8,0.9877793,0.0020577293,0.008011995,0.0010177359,0.00060400995],"about_ca_topic_score_codex":0.00007592609,"about_ca_topic_score_gemma":0.000019644664,"teacher_disagreement_score":0.48661008,"about_ca_system_score_codex":0.0006072364,"about_ca_system_score_gemma":0.0003163168,"threshold_uncertainty_score":0.9996986},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033455759,0.00035998988,0.9934421,0.00006870587,0.0013289909,0.0008266314,0.000010791836,0.00018230236,0.00043487395],"genre_scores_gemma":[0.39321738,0.0000015093399,0.6062748,0.00035740415,0.00010940771,0.0000041198314,0.0000034117566,0.000014433052,0.00001754527],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971847,0.00007617856,0.00055999594,0.00072468934,0.0009887639,0.0004657029],"domain_scores_gemma":[0.99633634,0.0008456359,0.0005350859,0.0014919625,0.00067997223,0.00011102781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030127454,0.0004061594,0.0005008356,0.0006628995,0.00028333598,0.0008843699,0.004075246,0.00036347087,0.0000053140693],"category_scores_gemma":[0.0004725893,0.00029364193,0.0001059317,0.0009354581,0.0008561111,0.0015893833,0.0016785089,0.0011788736,0.000010240402],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003428199,0.000075665645,0.00028808607,0.0011045053,0.000043982178,0.00008812058,0.0060535776,0.03078991,0.3176127,0.11231198,0.0000069478488,0.5312817],"study_design_scores_gemma":[0.00031460368,0.00024586316,0.00018150212,0.00091180747,0.000011458474,0.0000910676,3.7109857e-7,0.19037634,0.5886211,0.21842787,0.00012850421,0.00068955676],"about_ca_topic_score_codex":0.0000982226,"about_ca_topic_score_gemma":0.00001469714,"teacher_disagreement_score":0.53059214,"about_ca_system_score_codex":0.00024872177,"about_ca_system_score_gemma":0.0005508538,"threshold_uncertainty_score":0.9999516},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011833567,0.0035011445,0.9275698,0.033125196,0.006102011,0.0012005082,0.00005558617,0.00059045124,0.02667193],"genre_scores_gemma":[0.55102,0.007564528,0.29550782,0.13059697,0.011263035,0.00031402495,0.00028632226,0.00040567358,0.0030416239],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961946,0.000068960544,0.0006547385,0.0011497497,0.0009881606,0.0009438123],"domain_scores_gemma":[0.9964755,0.0004703884,0.00034828775,0.0017137885,0.00074548,0.00024651978],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010227688,0.00055644324,0.00040528408,0.00031595182,0.0013607697,0.0013568529,0.0025337765,0.0003838117,0.000018980192],"category_scores_gemma":[0.000035170444,0.0004256731,0.0001015973,0.0011835297,0.0004814855,0.0012479648,0.0017237514,0.001157606,0.00005567742],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018564835,0.00007494413,0.00045399464,0.00019856438,0.000028734794,0.00001562865,0.008550684,0.0014745268,0.000008279442,0.15430136,0.0007760632,0.83409864],"study_design_scores_gemma":[0.0003824748,0.00007625937,0.001867274,0.00010255245,0.000012482476,0.000072857525,0.0000063682282,0.31453398,0.000103630926,0.16600497,0.51594466,0.0008924635],"about_ca_topic_score_codex":0.00040933455,"about_ca_topic_score_gemma":0.0089854775,"teacher_disagreement_score":0.8332062,"about_ca_system_score_codex":0.00031326135,"about_ca_system_score_gemma":0.0006114883,"threshold_uncertainty_score":0.9999393},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035640521,0.00094606087,0.99611014,0.0011888826,0.00030163673,0.0004025045,0.000004140821,0.00020795879,0.00083508715],"genre_scores_gemma":[0.009637256,0.000120118435,0.9886646,0.0013045317,0.00017616258,0.00000782799,0.000002037675,0.00002659896,0.000060831688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969456,0.000060089937,0.00046310824,0.0011535826,0.00093203643,0.00044555307],"domain_scores_gemma":[0.99679804,0.0011839594,0.0003440927,0.0013001304,0.0002536226,0.000120174176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000931952,0.0004559548,0.0005368591,0.0005450485,0.000322543,0.00027277163,0.0025384347,0.00021363827,0.00000471081],"category_scores_gemma":[0.00024592286,0.00032106315,0.00011517943,0.0005427493,0.0017599663,0.00050643325,0.00086438854,0.00069671933,0.0000022350405],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019029974,0.000012991785,0.000005001532,0.00001941603,0.00000399936,0.000012819278,0.00058288465,0.0065872637,0.00008067003,0.010045014,0.00002488668,0.982606],"study_design_scores_gemma":[0.00041410138,0.00012103788,0.000021877138,0.0004917492,0.0000055288488,0.00005430026,9.6398196e-8,0.7436744,0.0015081895,0.25288087,0.00052796636,0.000299856],"about_ca_topic_score_codex":0.000038278635,"about_ca_topic_score_gemma":0.0000067831875,"teacher_disagreement_score":0.9823062,"about_ca_system_score_codex":0.0001491121,"about_ca_system_score_gemma":0.0006201189,"threshold_uncertainty_score":0.9999241},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017686566,0.0034763755,0.97658765,0.000024753168,0.0013065257,0.0001731911,0.0000028200752,0.000064421714,0.00067767873],"genre_scores_gemma":[0.9342683,0.000032741376,0.06537168,0.000070636204,0.00020058837,0.000004098912,6.7176177e-7,0.000020884601,0.00003038147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898225,0.000002811199,0.00029209326,0.00030750662,0.00025086422,0.0001644871],"domain_scores_gemma":[0.99950814,0.00008273835,0.00003611298,0.00023421911,0.00008920988,0.000049577255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018783993,0.00021668435,0.0003356816,0.00021759572,0.00006219163,0.000055810513,0.00023432003,0.00013736942,0.0000069835487],"category_scores_gemma":[0.000018709983,0.00019334407,0.000031460488,0.00007072466,0.0002649572,0.00010201,0.00012465657,0.0002774661,0.000002221665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003333592,0.000018371406,0.000010145516,0.00022925093,0.00004395468,0.0000064683436,0.0062435395,0.89336425,0.07381545,0.0020458477,0.0000017938344,0.024217585],"study_design_scores_gemma":[0.00017656475,0.00003131188,0.0000015193497,0.0002854299,0.000005489033,0.000027432028,0.000004094532,0.992442,0.0063279206,0.00042560967,0.0000713096,0.00020130363],"about_ca_topic_score_codex":0.00001149612,"about_ca_topic_score_gemma":0.000082329796,"teacher_disagreement_score":0.91658175,"about_ca_system_score_codex":0.00005884672,"about_ca_system_score_gemma":0.000040351762,"threshold_uncertainty_score":0.7884342},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082138875,0.00035132247,0.995473,0.00070439186,0.0017276669,0.00034790128,0.00005149093,0.00021124263,0.0010508137],"genre_scores_gemma":[0.030030254,0.00008333243,0.96464056,0.0030335442,0.0016706445,0.000056292894,0.00010937348,0.00006943177,0.00030656977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961647,0.000037684953,0.000524095,0.0015505465,0.0009969207,0.00072606886],"domain_scores_gemma":[0.9958365,0.00024248697,0.00029296058,0.0030655782,0.00020468,0.00035782342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081836194,0.0004885143,0.0003988369,0.0005401416,0.00033955293,0.0006684057,0.0050661233,0.00024370382,0.000073761614],"category_scores_gemma":[0.000053964595,0.0004561844,0.00009832468,0.0005344154,0.0004750692,0.0014985404,0.0015802365,0.00055409316,0.00014320196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.660169e-7,0.000050478273,0.00008279685,0.000010276552,0.0000066867465,0.000014257116,0.00089798786,0.0004896389,0.000043355663,0.03469237,0.00008682288,0.96362466],"study_design_scores_gemma":[0.0008121276,0.00035557247,0.0013407433,0.00031783257,0.000033101573,0.00014323133,9.587426e-7,0.75604403,0.0013125087,0.20562051,0.031996645,0.0020227586],"about_ca_topic_score_codex":0.00012329087,"about_ca_topic_score_gemma":0.00009813407,"teacher_disagreement_score":0.9616019,"about_ca_system_score_codex":0.00024157584,"about_ca_system_score_gemma":0.0003560145,"threshold_uncertainty_score":0.999789},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004508133,0.0011745848,0.99520355,0.0005107675,0.00040292594,0.00034058528,0.000003363276,0.000068973495,0.0022501524],"genre_scores_gemma":[0.4253097,0.00039331501,0.5730404,0.0007680602,0.00028104777,0.000037893067,0.0000093809795,0.000036688714,0.00012350926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719256,0.00005528462,0.0005020935,0.0009641551,0.00078026275,0.0005056716],"domain_scores_gemma":[0.99762243,0.00067562197,0.00038001421,0.0010552608,0.00018842016,0.00007823314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010889893,0.00032765645,0.00037087864,0.00030515683,0.00026628046,0.00025387233,0.002825617,0.00019666947,0.0000024886833],"category_scores_gemma":[0.000036956335,0.00024509543,0.00009672514,0.0008301741,0.0007302852,0.00024742825,0.00048149496,0.00074711675,0.000009760374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040290606,0.000025177464,0.00022432393,0.000009804158,0.0000025588386,0.000025303098,0.00011761956,0.048750836,0.00001465899,0.005966676,0.0000058744286,0.9448531],"study_design_scores_gemma":[0.00024831542,0.00009616989,0.00024581578,0.00014567515,0.000003170161,0.000010490327,2.8192386e-7,0.9618777,0.00005984111,0.028048027,0.008988111,0.00027639754],"about_ca_topic_score_codex":0.00004486557,"about_ca_topic_score_gemma":0.00031085653,"teacher_disagreement_score":0.94457674,"about_ca_system_score_codex":0.00019242958,"about_ca_system_score_gemma":0.0005444611,"threshold_uncertainty_score":0.9994701},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016505347,0.0010203944,0.996649,0.00039207606,0.000381866,0.00040465657,0.0000021213618,0.00074026297,0.00024451848],"genre_scores_gemma":[0.008252323,0.00012976967,0.9901229,0.0008027517,0.00024950822,0.000017404715,0.000003638345,0.000035084653,0.000386585],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612236,0.000018547775,0.00045995018,0.0014638433,0.0011740784,0.00076119584],"domain_scores_gemma":[0.99718875,0.0012251402,0.00012774368,0.0010320644,0.00018990804,0.00023638066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010951193,0.0005015515,0.00044273946,0.0010423221,0.00020868744,0.000576358,0.003342316,0.000477685,0.000006530553],"category_scores_gemma":[0.0006200475,0.000474985,0.000053329997,0.0005432043,0.00040973193,0.00074459764,0.0018547091,0.0015342243,0.000025053456],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012029113,0.0000052489845,0.0001734081,0.00002874278,0.000003922829,0.00005403258,0.0003044291,0.0003094553,0.00011866862,0.0010965378,0.00001407279,0.9978903],"study_design_scores_gemma":[0.0014071286,0.0016591747,0.027819885,0.008939427,0.000031344083,0.0016692631,4.3540518e-7,0.06353695,0.19502908,0.5495848,0.14029332,0.010029196],"about_ca_topic_score_codex":0.0000025471124,"about_ca_topic_score_gemma":0.0000041707867,"teacher_disagreement_score":0.9878611,"about_ca_system_score_codex":0.00041667154,"about_ca_system_score_gemma":0.0007655176,"threshold_uncertainty_score":0.99977016},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007499959,0.0007530189,0.99581134,0.00022021537,0.0011856934,0.00046295745,0.000024177736,0.000384067,0.00040850896],"genre_scores_gemma":[0.40872025,0.00006943633,0.5895351,0.0004875948,0.0004006158,0.0000096163085,0.00027183947,0.00012877352,0.00037672863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99353576,0.000092341616,0.00086204807,0.0029940212,0.0011433563,0.0013724723],"domain_scores_gemma":[0.99468505,0.00071900536,0.00053151953,0.0036264558,0.00021936868,0.00021856767],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00096785126,0.0009309994,0.0008776663,0.0008388977,0.0002980619,0.0008180746,0.0069931466,0.0006522969,0.0000066404523],"category_scores_gemma":[0.00006031933,0.0008089452,0.00008605541,0.0018153548,0.0009933548,0.0007382028,0.0031549602,0.0018532879,0.000012812813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000115095,0.00006121153,0.0007320595,0.000013450754,0.000012520989,0.00042497806,0.0001350034,0.95854014,0.000013007203,0.00037436048,0.000024393765,0.03965737],"study_design_scores_gemma":[0.00068176154,0.0000943343,0.0007072841,0.0009112682,0.000011911947,0.0001229763,2.9769782e-7,0.99546456,0.000066010354,0.0002550295,0.0006922213,0.0009923128],"about_ca_topic_score_codex":0.00025608978,"about_ca_topic_score_gemma":0.0015094399,"teacher_disagreement_score":0.40797028,"about_ca_system_score_codex":0.00041559167,"about_ca_system_score_gemma":0.00033254974,"threshold_uncertainty_score":0.99943614},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082722686,0.00012632321,0.9166475,0.000093694565,0.00009837255,0.0001422543,0.000006999988,0.000103935505,0.000058209906],"genre_scores_gemma":[0.7609699,0.0000015108968,0.23892574,0.000023723174,0.000044425018,5.250934e-7,0.000004022182,0.000018164874,0.000012034344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834394,0.00001237753,0.00034421615,0.0005406452,0.00037753186,0.0003812599],"domain_scores_gemma":[0.99891716,0.00035530626,0.00020554397,0.00025786945,0.0001535627,0.000110548746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027507148,0.00031622246,0.00056557305,0.00050611264,0.00020852686,0.0000720743,0.00038348947,0.00022190134,0.000008112867],"category_scores_gemma":[0.00035338878,0.00024363831,0.00006906488,0.00036024215,0.00021638267,0.000119282595,0.000337609,0.00070250354,2.5063522e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010826366,0.0000025938193,0.0007982667,0.000038509148,0.000028907714,0.000008486546,0.0002745146,0.857607,0.10875961,0.00093326514,7.2056444e-8,0.03153792],"study_design_scores_gemma":[0.00038632858,0.0000825182,0.00035750054,0.00093649013,0.000051331906,0.000026592183,0.0000037745192,0.90034723,0.0875299,0.009816769,0.000019830919,0.00044175953],"about_ca_topic_score_codex":0.00009412943,"about_ca_topic_score_gemma":0.000006878817,"teacher_disagreement_score":0.67824715,"about_ca_system_score_codex":0.00024817314,"about_ca_system_score_gemma":0.000086491935,"threshold_uncertainty_score":0.9935282},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011326669,0.00033672608,0.98955435,0.00031772535,0.0016260421,0.0017900361,0.0000060010757,0.00030670754,0.005949147],"genre_scores_gemma":[0.023280839,0.00012449762,0.9690142,0.005582245,0.00069164304,0.000093664,0.0000128304755,0.00009623609,0.0011038167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99312717,0.000096574295,0.00084499695,0.0026935088,0.0017817592,0.0014559852],"domain_scores_gemma":[0.9960781,0.0001968272,0.00047721525,0.0027242585,0.00016259197,0.0003610301],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012667648,0.0009559265,0.00069969567,0.0024759148,0.0004434145,0.000801444,0.0054050256,0.0003019083,0.000094092065],"category_scores_gemma":[0.000018688288,0.0009654965,0.00027346765,0.0019593574,0.00056573184,0.0005551399,0.0034160914,0.0007002751,0.00012061576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005283237,0.00008727271,0.00004130211,0.00007686217,0.000030442028,0.000694178,0.000114464885,0.5456723,0.000020512389,0.00642901,0.00007727632,0.44675112],"study_design_scores_gemma":[0.0007917151,0.00014246548,0.00007841126,0.00059792923,0.000020251897,0.00002925658,2.972019e-7,0.9615398,0.00010161598,0.015021263,0.020700432,0.0009765856],"about_ca_topic_score_codex":0.00008817104,"about_ca_topic_score_gemma":0.000059248694,"teacher_disagreement_score":0.44577453,"about_ca_system_score_codex":0.0020518962,"about_ca_system_score_gemma":0.00064536324,"threshold_uncertainty_score":0.9999762},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008690061,0.00008419261,0.98639446,0.0014778385,0.00059638085,0.00083055266,0.000011840589,0.000057139732,0.0018575147],"genre_scores_gemma":[0.98124105,0.00013131608,0.012189412,0.0051135155,0.00017058813,0.000034482397,0.000005835573,0.000039204708,0.0010746218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976853,0.00006570402,0.0003233137,0.00093036576,0.0006642819,0.00033101955],"domain_scores_gemma":[0.9988084,0.00042641172,0.00017341555,0.00044969298,0.000052966614,0.00008915494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005136698,0.0003513836,0.0002940288,0.00014378956,0.0003464082,0.00032032395,0.0006962543,0.00018994235,0.00002257591],"category_scores_gemma":[0.00014015817,0.0002218854,0.000069875496,0.00018036952,0.00090627075,0.0004739152,0.00014883616,0.00073473406,0.000016875823],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065565975,0.000018159957,3.2161833e-7,0.000038925376,0.0000016658072,0.000018268462,0.0014638181,0.0069775125,0.17271084,0.0348268,0.000051015606,0.7838271],"study_design_scores_gemma":[0.00025406876,0.000076405035,3.662808e-7,0.00011588143,0.0000056855147,0.000039205544,1.3081001e-7,0.5960378,0.18024276,0.22298351,0.00006508303,0.00017907482],"about_ca_topic_score_codex":0.0000060335997,"about_ca_topic_score_gemma":0.0000054689,"teacher_disagreement_score":0.9742051,"about_ca_system_score_codex":0.000053768326,"about_ca_system_score_gemma":0.000074138195,"threshold_uncertainty_score":0.90482247},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041360132,0.0001044597,0.9887847,0.0002955441,0.0047260346,0.00046481178,0.0000027145022,0.0002781879,0.004929963],"genre_scores_gemma":[0.07306693,0.0000071344075,0.9246679,0.001120542,0.0009483292,0.000017262068,0.0000023886894,0.000043077456,0.00012643037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99548954,0.000016331616,0.00048940507,0.0020328364,0.0012451346,0.0007267463],"domain_scores_gemma":[0.9968012,0.0003960161,0.00020250902,0.0020711299,0.00020899095,0.00032013134],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001151889,0.00057094597,0.0005081454,0.0011021326,0.0004152778,0.0011654502,0.004440122,0.0005147332,0.000017322365],"category_scores_gemma":[0.00017278684,0.0005155897,0.0001572476,0.00091625407,0.0002930029,0.0006791278,0.0021253242,0.0013849679,0.00013707527],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009718587,0.000029399802,0.000026888962,0.00002201065,0.000005794296,0.000022621643,0.00070331217,0.0141330855,0.0012921529,0.0063597662,0.000040251918,0.977355],"study_design_scores_gemma":[0.00032299626,0.0003233272,0.0006016277,0.0005145152,0.000009214742,0.00020779537,1.14681654e-7,0.68731505,0.006079202,0.2955309,0.007777695,0.0013175807],"about_ca_topic_score_codex":0.00007687433,"about_ca_topic_score_gemma":0.0003575998,"teacher_disagreement_score":0.97603744,"about_ca_system_score_codex":0.00022620606,"about_ca_system_score_gemma":0.00024298049,"threshold_uncertainty_score":0.99987143},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014990377,0.00005516061,0.98054695,0.00009822278,0.0004738121,0.0007084826,0.000016127788,0.00017886388,0.016423339],"genre_scores_gemma":[0.027101846,0.000010268728,0.97022086,0.00091268413,0.00024112237,0.000013648699,0.0000554049,0.000029946195,0.0014141934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994084,0.00006436972,0.0010075681,0.0015358281,0.0027982313,0.0005100119],"domain_scores_gemma":[0.9955314,0.00030098108,0.00056568487,0.0031826019,0.00025523425,0.00016413089],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.004937675,0.00045102066,0.0005187628,0.0018555858,0.00034278847,0.002194292,0.007358542,0.000205615,0.0003515246],"category_scores_gemma":[0.00010568433,0.0003514399,0.000081518236,0.00082840637,0.0005121698,0.0030507057,0.0027770055,0.00036133925,0.00015180882],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001533511,0.000027288697,0.00010198665,0.000030423309,0.0000084771245,0.000015650186,0.000493064,0.0023758658,0.000018234832,0.0012070774,0.0003207193,0.99539965],"study_design_scores_gemma":[0.000091630136,0.000041930267,0.0003061449,0.00018231725,0.000028455397,0.00001800127,0.000011287419,0.98158246,0.000046451638,0.014244833,0.0029583191,0.00048813934],"about_ca_topic_score_codex":0.000022359194,"about_ca_topic_score_gemma":0.000014770071,"teacher_disagreement_score":0.99491155,"about_ca_system_score_codex":0.00017594971,"about_ca_system_score_gemma":0.00012728735,"threshold_uncertainty_score":0.9998938},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022251474,0.00009501662,0.9930021,0.00083712616,0.00029143857,0.0005536031,0.0000017679249,0.00029118927,0.0049055195],"genre_scores_gemma":[0.023705663,0.000036857702,0.97529787,0.0005565997,0.000103331535,0.000012619848,0.00001009221,0.000015571479,0.00026138447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671245,0.000043843178,0.0007989093,0.0009288328,0.0011974421,0.00031852315],"domain_scores_gemma":[0.9973795,0.00022051368,0.0007083107,0.0012296803,0.00034679598,0.00011521],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010922622,0.00031191504,0.0003934488,0.00068097445,0.000091671754,0.00028789113,0.0022318077,0.00023460868,0.000035681333],"category_scores_gemma":[0.00017854769,0.00028906256,0.00008550409,0.00055147865,0.000709427,0.0008954241,0.00028312978,0.00044515586,0.000018955257],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.453344e-7,0.000027821208,0.0000034142597,0.00007059167,0.0000028001416,0.000008583243,0.00029579087,0.00018251812,0.009007356,0.0075901533,0.000055659482,0.98275465],"study_design_scores_gemma":[0.00019553331,0.00028979595,0.0004319463,0.0007806484,0.0000084595495,0.00003395903,1.6133785e-7,0.7115872,0.041598726,0.24448557,0.000137666,0.00045035788],"about_ca_topic_score_codex":0.000010501602,"about_ca_topic_score_gemma":0.000013709038,"teacher_disagreement_score":0.98230433,"about_ca_system_score_codex":0.00023026708,"about_ca_system_score_gemma":0.00045802048,"threshold_uncertainty_score":0.99995613},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013318988,0.002436264,0.9918488,0.00033633152,0.0023516428,0.00071888574,0.0000068545555,0.00029468987,0.00067459705],"genre_scores_gemma":[0.41296223,0.00016625378,0.5779136,0.0021224692,0.006436934,0.000022296073,0.000018933508,0.00008489331,0.00027240108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940108,0.00017989376,0.001102517,0.0022332682,0.0010187848,0.001454709],"domain_scores_gemma":[0.99540347,0.0010006527,0.00077400194,0.0019687298,0.00041630666,0.0004368635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002711257,0.0008044815,0.0011498634,0.0001948961,0.00047721245,0.0004293686,0.0031748987,0.0005365696,0.00008517597],"category_scores_gemma":[0.00006976168,0.0007781964,0.00017314099,0.0010382746,0.0012142395,0.0009595644,0.0014809128,0.0010597665,0.000022130454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022256347,0.000020377563,0.00017624635,0.000019398574,0.000017675025,0.000018094508,0.00011473852,0.3860388,0.000016789563,0.00793202,0.00005347437,0.60557014],"study_design_scores_gemma":[0.0004086437,0.0003000651,0.0003630814,0.00033271153,0.000028544675,0.000041975763,1.1510525e-7,0.97185975,0.000043661697,0.024763508,0.0010747421,0.0007831829],"about_ca_topic_score_codex":0.000041144413,"about_ca_topic_score_gemma":0.00024197895,"teacher_disagreement_score":0.60478693,"about_ca_system_score_codex":0.0001934762,"about_ca_system_score_gemma":0.00070128654,"threshold_uncertainty_score":0.9994669},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007923145,0.0006660514,0.99664974,0.0009731276,0.00016223837,0.00060462044,0.000004551658,0.000008109712,0.00013922296],"genre_scores_gemma":[0.7202263,0.0000692267,0.27839926,0.00048731646,0.00034655683,0.000038585007,0.000082635364,0.000020514575,0.0003296042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854815,0.000017347918,0.00033523838,0.00060106046,0.00015466937,0.00034352203],"domain_scores_gemma":[0.9991174,0.00012717817,0.00019791858,0.00039096022,0.00011706767,0.00004952326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006425366,0.00021301434,0.0002874438,0.00024083929,0.000111176014,0.00005717989,0.00046441125,0.00034181314,0.000008089296],"category_scores_gemma":[0.00014011424,0.0001570213,0.0001683618,0.00033934528,0.00009369594,0.000005553605,0.0001728338,0.00021819338,0.0000015163779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002702354,0.0000203848,0.0074850623,0.000020495972,0.00015826084,0.0000015505138,0.0002940307,0.49608684,0.00029582577,0.0024965475,0.000058095808,0.49305588],"study_design_scores_gemma":[0.002417968,0.0015829492,0.0325679,0.00039174707,0.00078156363,0.000020209462,0.000005523285,0.47017944,0.0018169355,0.44914916,0.038990814,0.0020957915],"about_ca_topic_score_codex":0.00010224109,"about_ca_topic_score_gemma":0.0020661706,"teacher_disagreement_score":0.71943396,"about_ca_system_score_codex":0.0001083621,"about_ca_system_score_gemma":0.00037373786,"threshold_uncertainty_score":0.64031434},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009107977,0.00047597228,0.9980899,0.00010196067,0.0006406204,0.0004696356,0.000009862713,0.00003219877,0.000088759385],"genre_scores_gemma":[0.075285025,0.00009283293,0.92436683,0.00007396319,0.00008768595,0.000042027048,0.0000049046207,0.000026409665,0.00002031267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986575,0.000028958973,0.0005075594,0.0003194116,0.0002572899,0.0002292517],"domain_scores_gemma":[0.99126446,0.008091773,0.00014625597,0.00031152772,0.00014630353,0.000039674724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011523843,0.0002494829,0.00033559898,0.0002825905,0.000096751064,0.000039977866,0.00043666374,0.00015764797,0.000008877641],"category_scores_gemma":[0.0006032717,0.00019346508,0.000050218983,0.00027924211,0.00054192275,0.00014238048,0.00013660203,0.0006162657,0.000001255719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002858241,0.0000035458,0.0000045541956,0.00005774282,0.0000029503747,1.5465673e-7,0.00019468526,0.49484742,0.00012360464,0.0010469403,1.7609928e-7,0.5037154],"study_design_scores_gemma":[0.00010287722,0.00009240335,0.000053857344,0.00026021,0.000010340151,0.0000022275785,0.0000010552224,0.8922897,0.001904349,0.10481329,0.00029057538,0.00017911564],"about_ca_topic_score_codex":0.0000017937533,"about_ca_topic_score_gemma":0.00001714301,"teacher_disagreement_score":0.5035363,"about_ca_system_score_codex":0.00010431628,"about_ca_system_score_gemma":0.00005721501,"threshold_uncertainty_score":0.78892773},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029100296,0.008644719,0.40703684,0.004182617,0.0075572887,0.0014738232,0.000052113683,0.00037557806,0.56776696],"genre_scores_gemma":[0.8659987,0.0012064321,0.02567582,0.010618814,0.007915507,0.000051616138,0.000058833502,0.0001814623,0.0882928],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99760133,0.000028270792,0.0002938223,0.0007196085,0.0008283384,0.00052862207],"domain_scores_gemma":[0.9988427,0.00033221385,0.00016089558,0.00032328343,0.00013319614,0.00020771379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068531133,0.00027934829,0.00037401807,0.00035276366,0.00017411148,0.0007545906,0.0006629098,0.00029380794,0.000011532151],"category_scores_gemma":[0.0001490389,0.00024916296,0.000063770945,0.00029468167,0.0018766627,0.00034232088,0.0002679427,0.000334507,0.000011761353],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003840141,0.000019111018,0.00021701041,0.000053551328,0.000008143296,0.00007589218,0.0025562127,0.0020479064,0.000025928715,0.010007251,0.00092708104,0.9840581],"study_design_scores_gemma":[0.00022894687,0.000086578264,0.00029821295,0.00068301935,0.000014604629,0.000022548025,0.000006400003,0.006188765,0.00004861777,0.028804563,0.9629133,0.000704496],"about_ca_topic_score_codex":0.00071605213,"about_ca_topic_score_gemma":0.0010237904,"teacher_disagreement_score":0.98335356,"about_ca_system_score_codex":0.00018146103,"about_ca_system_score_gemma":0.00022422653,"threshold_uncertainty_score":0.99999607},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012888206,0.001829488,0.99238175,0.000177897,0.0012813158,0.0005118468,0.0000021497303,0.0005880223,0.0030986294],"genre_scores_gemma":[0.019063894,0.000073886746,0.9796559,0.0007595934,0.000256443,0.000021082114,0.0000017388936,0.00004106747,0.0001263533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601614,0.00005406427,0.0006136066,0.0017675243,0.00089251966,0.0006561191],"domain_scores_gemma":[0.9971708,0.0008312478,0.00031007695,0.0012747056,0.00021978728,0.00019338987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009764689,0.0006027541,0.0006345173,0.000513519,0.00037118807,0.00054598687,0.0023634944,0.00030641494,0.000022350016],"category_scores_gemma":[0.00039401758,0.00056288793,0.000085141786,0.00054492056,0.00087211275,0.0006844014,0.0023708367,0.00077048206,0.000019992869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011803744,0.00017922366,0.00020591682,0.0003835835,0.000027803162,0.00036640637,0.0043956037,0.017760005,0.0010875202,0.12043122,0.00025693906,0.854894],"study_design_scores_gemma":[0.00017068529,0.0002991974,0.000032895143,0.0012693672,0.000006896673,0.0006240002,2.053055e-7,0.87607694,0.0022072212,0.11735739,0.0010747119,0.00088051317],"about_ca_topic_score_codex":0.00004465209,"about_ca_topic_score_gemma":0.000015703694,"teacher_disagreement_score":0.8583169,"about_ca_system_score_codex":0.00031075,"about_ca_system_score_gemma":0.0005289669,"threshold_uncertainty_score":0.99968225},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027432901,0.00028119583,0.98328984,0.001751203,0.000811001,0.00040058396,0.0000048407123,0.00034233325,0.013091586],"genre_scores_gemma":[0.40465924,0.00009162468,0.5913753,0.0017209017,0.00038136772,0.000027686303,0.0000040130553,0.00006459389,0.0016753009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514806,0.00004651682,0.00057792856,0.0020428607,0.0012052075,0.0009794466],"domain_scores_gemma":[0.99702615,0.00030258932,0.00030228292,0.0017090485,0.00034864273,0.0003112693],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006133805,0.0007592648,0.000659729,0.0006787262,0.00028863244,0.0010580451,0.0038886273,0.00040857092,0.00005163791],"category_scores_gemma":[0.000056002973,0.0006060055,0.00013000233,0.00069213,0.0012654553,0.0009497032,0.0008404268,0.001182872,0.00006555446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017380771,0.000063510866,0.000061005,0.00015524011,0.000035639212,0.00031561923,0.0033123177,0.06291985,0.00003009716,0.17919202,0.00010176196,0.75379556],"study_design_scores_gemma":[0.00023973297,0.00035981674,0.000022309365,0.0005777769,0.000010326485,0.0001539938,5.073011e-7,0.74318653,0.00026725608,0.25343677,0.00078697246,0.0009579888],"about_ca_topic_score_codex":0.000023484205,"about_ca_topic_score_gemma":0.000042057276,"teacher_disagreement_score":0.7528376,"about_ca_system_score_codex":0.00034174137,"about_ca_system_score_gemma":0.0007577463,"threshold_uncertainty_score":0.99997896},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004677924,0.0003360974,0.996134,0.00012552833,0.0021116023,0.0007799856,0.000010780319,0.00025408814,0.00020117137],"genre_scores_gemma":[0.017138086,0.000027787592,0.9822213,0.00016206459,0.00022915035,0.00003856638,0.0000029182643,0.000034718636,0.00014540828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964911,0.000054308333,0.0007662128,0.0012041198,0.00094236265,0.0005419405],"domain_scores_gemma":[0.9966561,0.0007170127,0.00063235406,0.0014714628,0.00044214164,0.000080929654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013304612,0.0004648411,0.0006014429,0.00094003265,0.00022436414,0.00025119272,0.002935631,0.00039285305,0.000011458692],"category_scores_gemma":[0.0005043297,0.0004400312,0.00020478545,0.0006497136,0.0005669896,0.0007833064,0.0005260183,0.00049985066,0.000016902864],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003007594,0.000022129603,0.0000039293063,0.0001288143,0.000010859142,0.0000038097107,0.00039073307,0.005839976,0.00035385444,0.008164967,0.000005759038,0.98507214],"study_design_scores_gemma":[0.00022443087,0.00030156746,0.00006898523,0.00029840268,0.000012568837,0.0000431455,1.2621439e-7,0.88666844,0.01652604,0.09453348,0.000888212,0.000434594],"about_ca_topic_score_codex":0.000015687103,"about_ca_topic_score_gemma":0.00001677036,"teacher_disagreement_score":0.98463756,"about_ca_system_score_codex":0.00027353395,"about_ca_system_score_gemma":0.00019954739,"threshold_uncertainty_score":0.99980515},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040431773,0.00020351769,0.98372155,0.009234858,0.0015145168,0.00039376784,0.000013660205,0.0003643529,0.0045133466],"genre_scores_gemma":[0.13627271,0.00021574424,0.8607463,0.0012741426,0.00054155034,0.000016522488,0.00003071269,0.000048387057,0.00085388205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614495,0.0000433258,0.00047121407,0.0017516634,0.00089032896,0.0006985392],"domain_scores_gemma":[0.99750733,0.00044719107,0.00035492628,0.0011882612,0.00026699787,0.0002353076],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005404146,0.0005509113,0.0005128988,0.00066677766,0.00041031506,0.0018875465,0.0020670898,0.00039053202,0.00012233436],"category_scores_gemma":[0.00013629737,0.000539877,0.00016480192,0.0006432376,0.0012801306,0.0007920917,0.00081024884,0.00088765466,0.000046800626],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027844874,0.000015336076,0.00008267676,0.000006949935,0.000011430848,0.00008047019,0.00040225725,0.011099508,0.00005829877,0.02470151,0.000012027541,0.9635267],"study_design_scores_gemma":[0.0008647745,0.00015111499,0.0004920442,0.00067951524,0.000024722041,0.00020254994,0.0000025694233,0.649915,0.0007784289,0.30610514,0.038977657,0.0018065135],"about_ca_topic_score_codex":0.000058769532,"about_ca_topic_score_gemma":0.0004258047,"teacher_disagreement_score":0.9617202,"about_ca_system_score_codex":0.0003065013,"about_ca_system_score_gemma":0.0007288714,"threshold_uncertainty_score":0.99970526},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002564027,0.00026282354,0.99423724,0.0001607794,0.0004584106,0.00061246747,0.000008554313,0.00013637921,0.00409769],"genre_scores_gemma":[0.058213484,0.00011532012,0.94079936,0.0003904924,0.0002379572,0.000009699498,0.000012969705,0.000027454153,0.00019328005],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973434,0.00003165027,0.0006112887,0.0009466405,0.0005836047,0.00048341235],"domain_scores_gemma":[0.9967524,0.0016448643,0.00040153455,0.0006021022,0.0004928899,0.00010621945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012132849,0.00033293953,0.0004922405,0.00090133434,0.00022669659,0.00013445855,0.001249914,0.00030210437,0.000008333927],"category_scores_gemma":[0.0004129091,0.0003086795,0.00017590918,0.00056507287,0.00079568475,0.00046855927,0.0004985637,0.0007680561,0.000006060976],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016937001,0.000016942011,0.000013435525,0.00004437896,0.00000585365,0.000013343785,0.00018515764,0.0012957109,0.0007036561,0.014081908,0.000006931954,0.98361576],"study_design_scores_gemma":[0.0004976195,0.0009107674,0.000033218348,0.0008697881,0.000017701612,0.00008917458,4.06609e-7,0.2756791,0.114003204,0.5987756,0.0083435485,0.00077983935],"about_ca_topic_score_codex":0.0000053588114,"about_ca_topic_score_gemma":0.000008352334,"teacher_disagreement_score":0.9828359,"about_ca_system_score_codex":0.00016046724,"about_ca_system_score_gemma":0.00037932282,"threshold_uncertainty_score":0.9999365},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005670009,0.0068740463,0.9849129,0.0011568988,0.0011536229,0.0006652183,0.000020404073,0.00010897059,0.0050512874],"genre_scores_gemma":[0.07931632,0.00020543013,0.91868347,0.00055742095,0.00092474977,0.000010547652,0.000012633128,0.000044141132,0.00024528714],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552256,0.00010349507,0.00070866744,0.001989762,0.00093059766,0.0007449152],"domain_scores_gemma":[0.9932174,0.001379121,0.00040654602,0.004464792,0.0003287643,0.00020334614],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0032480317,0.0005597124,0.0006783772,0.00046785412,0.00028156844,0.00035705915,0.010132955,0.00029021097,0.000015161265],"category_scores_gemma":[0.00009223477,0.00039436464,0.00008968595,0.00075162493,0.0019500194,0.00092389813,0.013244734,0.0008973255,0.000021032612],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022530187,0.000052771076,0.00017426944,0.000085116124,0.000013517691,0.00000839286,0.0013452788,0.0006969285,0.00002765624,0.028198056,0.0000758401,0.96931994],"study_design_scores_gemma":[0.00032055334,0.00023533283,0.0011095573,0.0003175378,0.000031892352,0.0002037226,3.8614064e-7,0.44477126,0.00032708343,0.5369332,0.01484384,0.0009056608],"about_ca_topic_score_codex":0.00003505995,"about_ca_topic_score_gemma":0.00012907549,"teacher_disagreement_score":0.96841425,"about_ca_system_score_codex":0.00014416513,"about_ca_system_score_gemma":0.00062032306,"threshold_uncertainty_score":0.9998508},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020480041,0.0006577736,0.99602705,0.00034612056,0.0003150797,0.00035729806,0.000009878504,0.000082065184,0.001999919],"genre_scores_gemma":[0.1442689,0.00082264974,0.85324955,0.0008210047,0.00014467382,0.000049331087,0.000012638104,0.000036692287,0.00059456355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973765,0.00004712614,0.0004312358,0.0010168948,0.00068416557,0.0004440937],"domain_scores_gemma":[0.99831706,0.0002933611,0.0002062463,0.0007667764,0.00023587991,0.00018067667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070237654,0.00033210462,0.0004753827,0.00044417602,0.00016913717,0.00027554735,0.0016207428,0.00015371955,0.000025601083],"category_scores_gemma":[0.00003458499,0.00031781686,0.00006808599,0.00044184344,0.0006767518,0.0007310034,0.0008789226,0.00043985667,0.0000041419107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049209466,0.00005730319,0.00013629488,0.00005959348,0.000008734604,0.000020192898,0.00077172695,0.2043031,0.00030836227,0.018511098,0.0000064217456,0.77581227],"study_design_scores_gemma":[0.0006504444,0.00069366087,0.0006643701,0.00088475377,0.000009292326,0.00006324678,9.320592e-7,0.951264,0.007947455,0.03445644,0.0022564703,0.0011089345],"about_ca_topic_score_codex":0.000024155932,"about_ca_topic_score_gemma":0.000010604382,"teacher_disagreement_score":0.7747033,"about_ca_system_score_codex":0.0000973348,"about_ca_system_score_gemma":0.00024591928,"threshold_uncertainty_score":0.9999274},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007040605,0.0004535998,0.9973793,0.00034183593,0.00077262364,0.00035925666,0.0000025334461,0.00032518554,0.0002952763],"genre_scores_gemma":[0.050312657,0.000039779516,0.9472259,0.0018305004,0.0004733104,0.0000012161449,0.0000041865383,0.000049067654,0.000063351064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642396,0.000038080816,0.0005679303,0.001405059,0.0008367862,0.0007281776],"domain_scores_gemma":[0.9977886,0.00036856002,0.00032428853,0.0010076164,0.0002979286,0.00021297144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012079689,0.0005283214,0.00046994135,0.00078945287,0.00034589932,0.0008906848,0.001986116,0.00039184658,0.000014245796],"category_scores_gemma":[0.0000751112,0.000497674,0.000120505596,0.0008114586,0.0009631626,0.00072422955,0.0010816241,0.00093649933,0.0000030095873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005263458,0.000044224358,0.000075665535,0.00012694803,0.000014099733,0.00031013327,0.0002968902,0.029271634,0.006752447,0.0035823851,0.0000029208995,0.95947003],"study_design_scores_gemma":[0.0001860238,0.000108886255,0.000057182533,0.00021565193,0.00000788328,0.000093558076,9.3682445e-8,0.98424846,0.009168525,0.00523224,0.00013424119,0.0005472812],"about_ca_topic_score_codex":0.000013451536,"about_ca_topic_score_gemma":0.000011471696,"teacher_disagreement_score":0.95892274,"about_ca_system_score_codex":0.0003020625,"about_ca_system_score_gemma":0.0002604585,"threshold_uncertainty_score":0.9997475},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032276163,0.0011283655,0.99546975,0.0002540856,0.00047871715,0.00076320284,0.0000356746,0.00013142776,0.0014159903],"genre_scores_gemma":[0.3543839,0.00020145584,0.64447045,0.00033919475,0.00021344543,0.00007099854,0.00004589912,0.000060829283,0.00021383632],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99602497,0.000077635596,0.00062974915,0.0015086853,0.0010946768,0.00066426786],"domain_scores_gemma":[0.9974224,0.00047102242,0.00038335178,0.0010836885,0.00046831774,0.00017123375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009701729,0.00047642857,0.0005509041,0.0011659829,0.00025568253,0.00021491048,0.0017722577,0.00026009645,0.000010836563],"category_scores_gemma":[0.00007874292,0.00044936078,0.00013667885,0.0012626012,0.0022674627,0.0009134511,0.0008075031,0.0007161477,0.000006789099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066318826,0.0001707588,0.00064732326,0.00043605574,0.00003773974,0.00020877073,0.00062855135,0.003820771,0.0011283071,0.16261367,0.00007338959,0.8301683],"study_design_scores_gemma":[0.00032932952,0.00028452,0.0003846308,0.00061451376,0.000008326171,0.00006871662,2.4915187e-7,0.023014622,0.0026942499,0.9718765,0.00019857525,0.0005257536],"about_ca_topic_score_codex":0.00002186775,"about_ca_topic_score_gemma":0.00008830918,"teacher_disagreement_score":0.8296426,"about_ca_system_score_codex":0.00009245317,"about_ca_system_score_gemma":0.00024538854,"threshold_uncertainty_score":0.9997958},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025556685,0.0006356047,0.9955781,0.0007181269,0.0013261558,0.0009974835,0.00002596518,0.000051433926,0.00041156964],"genre_scores_gemma":[0.9457426,0.000002709867,0.05139602,0.000999325,0.0006322534,0.000021009284,0.0000026090274,0.000034946464,0.0011685258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939673,0.000044572298,0.0011089798,0.0015741144,0.0027240356,0.0005810194],"domain_scores_gemma":[0.9901516,0.006346901,0.00056249136,0.002032171,0.0007337588,0.00017308361],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004609799,0.00044001715,0.0005788243,0.0008075957,0.0008151832,0.0013361144,0.0035846857,0.00024043891,0.00009694455],"category_scores_gemma":[0.001120483,0.00026389823,0.0002848698,0.00053015334,0.0005417854,0.00044949507,0.0005919411,0.00039712395,0.000047601032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014168718,0.000009595966,0.000067197725,0.0000031815384,0.0000026412333,0.0000036043584,0.0007559507,0.74147713,0.000006975289,0.015661212,0.000039572034,0.24195874],"study_design_scores_gemma":[0.00015759814,0.000067643676,0.00018832201,0.00007226942,0.000004588067,0.000005197893,9.178198e-7,0.59191847,0.0000037741816,0.4054638,0.0019139773,0.00020344419],"about_ca_topic_score_codex":0.00062434946,"about_ca_topic_score_gemma":0.017466234,"teacher_disagreement_score":0.945487,"about_ca_system_score_codex":0.00043295257,"about_ca_system_score_gemma":0.0013045104,"threshold_uncertainty_score":0.99998134},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009732192,0.0011105161,0.99046206,0.0010816996,0.0010533674,0.0008859979,0.000024692932,0.000953774,0.004418168],"genre_scores_gemma":[0.004439367,0.00005419358,0.9904545,0.0018968127,0.00090830075,0.00005746554,0.00001863986,0.000074926786,0.0020958108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950738,0.00002610399,0.000725763,0.0022383248,0.0009471739,0.0009888319],"domain_scores_gemma":[0.9965261,0.0006907463,0.00046079332,0.0015538567,0.0005017334,0.00026673853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092355214,0.0008109464,0.00076988834,0.0012942551,0.0004950116,0.00071988895,0.004545099,0.0005292723,0.000021658261],"category_scores_gemma":[0.00018164323,0.0007427703,0.00026958706,0.0007580255,0.000520669,0.000636172,0.00122524,0.0009257693,0.000022782264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014490411,0.00008459769,0.000007967073,0.00010823398,0.000019960928,0.000014025772,0.00089012017,0.34207535,0.00036459538,0.0046845954,0.00040185917,0.6513342],"study_design_scores_gemma":[0.0005805619,0.0001667801,0.000022631779,0.00063680316,0.0000123181135,0.00007308728,8.442556e-8,0.93999666,0.0056552296,0.031638257,0.020047268,0.0011703405],"about_ca_topic_score_codex":0.000016414539,"about_ca_topic_score_gemma":0.000055961813,"teacher_disagreement_score":0.6501639,"about_ca_system_score_codex":0.00036670675,"about_ca_system_score_gemma":0.00069777144,"threshold_uncertainty_score":0.99950236},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004240463,0.00033780173,0.9901348,0.0011312698,0.0006466002,0.0002738206,0.000003328635,0.00027729128,0.006771073],"genre_scores_gemma":[0.30470434,0.00007889208,0.6937578,0.00033290658,0.00021295316,0.0000064185733,0.0000040771306,0.00002565378,0.00087701145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709976,0.000023128463,0.0005828622,0.0011486508,0.0007090988,0.0004365246],"domain_scores_gemma":[0.99719167,0.00024406974,0.00056870695,0.0016398153,0.0002754907,0.000080220794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047524736,0.00040442997,0.0004410162,0.0007372057,0.00016144948,0.00031454142,0.0034664301,0.0004362631,0.00003838231],"category_scores_gemma":[0.000087936955,0.00036827102,0.00012711344,0.00070431,0.00085198577,0.00056374824,0.0009306958,0.0006023985,0.00004441568],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028347213,0.000029009381,0.0001879043,0.000023819108,0.000007710465,0.000004828353,0.00022621185,0.0021661166,0.0013331787,0.1902351,0.000025949155,0.80575734],"study_design_scores_gemma":[0.00053699,0.0001346945,0.0031339366,0.00065655645,0.00002815349,0.00017772825,0.0000018386385,0.513264,0.0244604,0.4490279,0.007032197,0.001545624],"about_ca_topic_score_codex":0.000018747116,"about_ca_topic_score_gemma":0.000032369386,"teacher_disagreement_score":0.80421174,"about_ca_system_score_codex":0.00030056926,"about_ca_system_score_gemma":0.00040597157,"threshold_uncertainty_score":0.9998769},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000054172383,0.00006423254,0.991424,0.00047033656,0.00035707492,0.0020172424,0.000001092323,0.00023368714,0.005426908],"genre_scores_gemma":[0.016434718,0.000009677003,0.98171735,0.0005596998,0.00013845351,0.00014970097,0.000020891168,0.00005546774,0.000914069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559855,0.000029226996,0.00057145767,0.0016005255,0.0013602581,0.0008399599],"domain_scores_gemma":[0.99699473,0.00018443166,0.00038169618,0.0018384887,0.00038358298,0.00021704592],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00091023097,0.00054910657,0.00037798184,0.00066338025,0.0006089241,0.0014468108,0.003749519,0.00020498282,7.8625976e-7],"category_scores_gemma":[0.000055278386,0.0004031801,0.00006883285,0.0014537085,0.00033333848,0.0004218682,0.0011597738,0.0005841971,0.000028889903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044747176,0.000016093041,0.000014138703,0.000016586926,0.000005035641,0.000003663107,0.00019173695,0.77763736,0.0000057551188,0.004459505,0.000010085346,0.21763559],"study_design_scores_gemma":[0.000117998236,0.000262579,0.000016943959,0.00014514089,0.000009600365,0.00003577699,6.100121e-7,0.99522215,0.00003990412,0.0012141328,0.002397696,0.00053747476],"about_ca_topic_score_codex":0.000026396514,"about_ca_topic_score_gemma":0.000021109885,"teacher_disagreement_score":0.2175848,"about_ca_system_score_codex":0.00046625367,"about_ca_system_score_gemma":0.0003408119,"threshold_uncertainty_score":0.999842},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008309461,0.0001401128,0.9653858,0.00012694432,0.0031067792,0.030692529,0.000008868755,0.00025844533,0.000272191],"genre_scores_gemma":[0.0400654,0.0000066239027,0.9315608,0.0033876046,0.0026829543,0.021936774,0.000011658155,0.00016963079,0.00017852234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99430615,0.00007730918,0.00079565035,0.0024414177,0.0011373338,0.0012421435],"domain_scores_gemma":[0.99559397,0.0007287409,0.00057999964,0.002048999,0.0006553732,0.00039291798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012998468,0.000836464,0.000755688,0.0006495369,0.00064392516,0.000946783,0.0040096464,0.00079959194,0.00003927685],"category_scores_gemma":[0.000054643864,0.0007546842,0.00027622547,0.00063330174,0.0008695735,0.00055904745,0.0007331151,0.0012267062,0.000004101507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006254845,0.00010364995,0.000009140967,0.000017066985,0.000017000519,0.000033801294,0.00013415514,0.74710906,0.0006061747,0.007882899,0.00001571218,0.24400878],"study_design_scores_gemma":[0.0010404432,0.0004846343,0.000024315334,0.00027975437,0.000009662246,0.00010969702,5.867445e-8,0.9695882,0.00037207073,0.014574024,0.012678519,0.0008386168],"about_ca_topic_score_codex":0.000010990624,"about_ca_topic_score_gemma":0.00011343211,"teacher_disagreement_score":0.24317016,"about_ca_system_score_codex":0.000372485,"about_ca_system_score_gemma":0.00081421,"threshold_uncertainty_score":0.99949044},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6589068,0.0000058456867,0.3404224,0.00028873622,0.00010448865,0.0002119559,0.0000031735697,0.000046129284,0.0000104614965],"genre_scores_gemma":[0.794735,0.000003828653,0.20508118,0.00011116683,0.000053986227,0.0000055603273,0.000004423429,0.0000043517307,4.87945e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998357,0.00005125185,0.00023856938,0.00038147942,0.0006727372,0.00029896924],"domain_scores_gemma":[0.9988652,0.0004113952,0.00006858269,0.00033243358,0.00022110244,0.000101279016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005274324,0.00010964285,0.00027014455,0.0005704491,0.00016266423,0.000033597233,0.000209596,0.000058314243,0.00007451068],"category_scores_gemma":[0.000724136,0.00008142043,0.00006499158,0.0025542604,0.0005662385,0.000089769776,0.00016064652,0.00033542674,0.0000046638743],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038990587,0.00022465593,0.079701014,0.000035550125,0.000056445137,0.000011034795,0.00077656884,0.030530468,0.8128235,0.000011023784,0.000009309457,0.075781465],"study_design_scores_gemma":[0.00020996257,0.00012257828,0.30421582,0.00003682054,0.000029143539,0.0000027096228,0.0000016962157,0.61785984,0.07746328,0.000010618704,9.2741084e-7,0.00004661203],"about_ca_topic_score_codex":0.00007968164,"about_ca_topic_score_gemma":0.00010355554,"teacher_disagreement_score":0.7353602,"about_ca_system_score_codex":0.00007613469,"about_ca_system_score_gemma":0.00014947509,"threshold_uncertainty_score":0.33202288},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014792566,0.000073357005,0.94772506,0.00021543563,0.00095600466,0.0006722034,0.0000018873596,0.00022929022,0.05011196],"genre_scores_gemma":[0.006291158,0.0000066811817,0.9918221,0.001163322,0.00030819094,0.000025022344,0.0000040715404,0.000033989178,0.00034546445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99551743,0.000047924248,0.00069936813,0.0016956781,0.0013343719,0.00070525083],"domain_scores_gemma":[0.9965249,0.0002963763,0.00027447048,0.0023321086,0.00028581696,0.00028634805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029292034,0.00048306974,0.00048437135,0.0011822477,0.00020251868,0.00048094863,0.004309794,0.00040250155,0.0000135623495],"category_scores_gemma":[0.00032770375,0.00045363302,0.00011177573,0.0011486553,0.00046765502,0.00062185415,0.0010421509,0.00075908937,0.0002893563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046628143,0.000045735345,0.0000022839238,0.00004495699,0.0000040085115,0.0000064003248,0.0008598562,0.005784736,0.00012822874,0.4760549,0.000013822247,0.5170504],"study_design_scores_gemma":[0.00013194766,0.00013347913,0.00011767712,0.00019990992,0.0000064004303,0.00009928407,2.5921003e-7,0.7550907,0.0025509892,0.23795338,0.0030100183,0.00070595444],"about_ca_topic_score_codex":0.0000042792417,"about_ca_topic_score_gemma":0.000002533661,"teacher_disagreement_score":0.74930596,"about_ca_system_score_codex":0.00047450475,"about_ca_system_score_gemma":0.0003158825,"threshold_uncertainty_score":0.99979156},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046108707,0.0005263581,0.9902425,0.00018064481,0.0023670082,0.0007259095,0.0000034591635,0.0003246873,0.005168378],"genre_scores_gemma":[0.30933732,0.0000063852376,0.6878952,0.0009168313,0.0010396566,0.000012354331,0.000003202358,0.000041009753,0.0007480559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99474573,0.000062538005,0.0006826448,0.0022386438,0.0010351401,0.0012353098],"domain_scores_gemma":[0.9972667,0.0002485223,0.00031891945,0.0015388058,0.00032514712,0.00030190768],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001297142,0.00073542714,0.0007569384,0.000698169,0.00063595094,0.0024014534,0.0037617416,0.00033407978,0.0000034546401],"category_scores_gemma":[0.00012627701,0.00063479727,0.00017699873,0.0010035161,0.00029590272,0.0014068144,0.00178264,0.00078043004,0.000049429207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004127533,0.000031360167,0.000056560686,0.00011594795,0.00001316759,0.00022088518,0.0027024143,0.04159833,0.0007405603,0.031558048,0.000015259633,0.92294335],"study_design_scores_gemma":[0.0002685385,0.00057139015,0.00007444125,0.0037560724,0.000025249305,0.00044100653,0.0000034322018,0.9701832,0.007875734,0.01014849,0.0043115583,0.0023408812],"about_ca_topic_score_codex":0.000044911296,"about_ca_topic_score_gemma":0.00007785996,"teacher_disagreement_score":0.9285849,"about_ca_system_score_codex":0.00077615207,"about_ca_system_score_gemma":0.0007131052,"threshold_uncertainty_score":0.9996103},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006952856,0.000053325697,0.99606663,0.00031729398,0.0010484371,0.0009800841,0.00008986813,0.000106460335,0.0006425928],"genre_scores_gemma":[0.051652923,0.0000055407454,0.94635046,0.0010873389,0.0004092558,0.000031998632,0.00003481658,0.00006568474,0.00036201385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951432,0.00009394727,0.0010151234,0.001707862,0.0008285314,0.0012113659],"domain_scores_gemma":[0.99641263,0.0018315157,0.0004495036,0.00092473987,0.00019616104,0.00018545333],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021454277,0.00063180446,0.00061791897,0.0016111715,0.0002589513,0.0023018622,0.0022792318,0.00021837172,0.000028133209],"category_scores_gemma":[0.0002907937,0.00064198516,0.00022549243,0.00091254624,0.00021670586,0.002536141,0.001353518,0.00042361688,0.000014318857],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014601211,0.000051280025,0.000058602815,0.000054689728,0.000020054149,0.00009009993,0.0019114708,0.02145486,0.0017752755,0.0033874593,0.000050567945,0.9709996],"study_design_scores_gemma":[0.0011876234,0.00047580045,0.000049563678,0.00033426104,0.000010125918,0.00007116071,0.0000012787074,0.9401929,0.0023046625,0.05052288,0.003969219,0.00088054984],"about_ca_topic_score_codex":0.00003339188,"about_ca_topic_score_gemma":0.00004113578,"teacher_disagreement_score":0.97011906,"about_ca_system_score_codex":0.000513291,"about_ca_system_score_gemma":0.00045216343,"threshold_uncertainty_score":0.99960315},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20293382,0.00014985741,0.79659706,0.00002279142,0.00013479611,0.00009383998,0.000030646304,0.000010397424,0.000026783475],"genre_scores_gemma":[0.98295987,0.0000662521,0.01664963,0.000041642677,0.00021332431,5.713297e-7,0.00004939535,0.000009679172,0.00000961583],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893665,0.000020129748,0.0003108689,0.00042044037,0.00017083183,0.00014108547],"domain_scores_gemma":[0.99935514,0.000025892363,0.00021874259,0.00024031296,0.00012466354,0.000035277935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019344622,0.00018036722,0.0002684313,0.00014692871,0.000054640237,0.000016808963,0.00016855841,0.0002265162,0.0000011014209],"category_scores_gemma":[0.000020369143,0.00014879188,0.0000726821,0.00009931872,0.0005555391,0.000006026263,0.00007954861,0.00014023871,3.0006383e-8],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007674609,0.000023852554,0.002281792,0.000067240384,0.000032512224,0.0000018291807,0.00007293531,0.025329199,0.714129,0.0000858683,0.0000025924398,0.25789645],"study_design_scores_gemma":[0.00013544458,0.0007985383,0.0016279827,0.00022287593,0.00007843781,0.000028368191,2.3707675e-7,0.6286502,0.36534742,0.0027236508,0.00006675256,0.00032007098],"about_ca_topic_score_codex":0.000019244675,"about_ca_topic_score_gemma":0.00013081793,"teacher_disagreement_score":0.7800261,"about_ca_system_score_codex":0.0000099250055,"about_ca_system_score_gemma":0.00005198412,"threshold_uncertainty_score":0.6067557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015729383,0.00057928753,0.98543304,0.00036601175,0.00037388795,0.00037058268,0.00004200546,0.000011706717,0.012666201],"genre_scores_gemma":[0.15539859,0.00022554133,0.830199,0.0048501,0.0021822655,0.000057931917,0.0005611548,0.0000728638,0.0064525525],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99757665,0.000018695107,0.00026282278,0.0014607275,0.0003612292,0.00031987796],"domain_scores_gemma":[0.99808663,0.000011588251,0.00013082977,0.0015158765,0.00012630463,0.0001287506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003355682,0.00029809712,0.00021775936,0.00019057204,0.000095786774,0.00009745524,0.0015193907,0.00021667173,0.000027611506],"category_scores_gemma":[0.000029308745,0.00026813755,0.000052673622,0.00013851014,0.00025159918,0.00001168309,0.00096412015,0.00023083588,0.000035603865],"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.00004619268,0.000069515685,0.0000030744948,0.000017357308,0.000019244975,0.000001997668,0.00016943015,0.0021758329,0.63739675,0.0002631554,0.0026645206,0.35717294],"study_design_scores_gemma":[0.0005356344,0.0004536624,0.000076242635,0.00019481048,0.000026770114,0.000028204586,0.0000020784057,0.017055815,0.53162503,0.0014703056,0.4473064,0.0012250304],"about_ca_topic_score_codex":0.000003907761,"about_ca_topic_score_gemma":0.000022673155,"teacher_disagreement_score":0.44464186,"about_ca_system_score_codex":0.000090038324,"about_ca_system_score_gemma":0.00030743613,"threshold_uncertainty_score":0.9999771},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008511343,0.00027858288,0.99212635,0.0015660955,0.0020669585,0.00069778814,0.000014195141,0.00023729735,0.0029276428],"genre_scores_gemma":[0.15876442,0.000014901275,0.8382786,0.0014535346,0.0007702935,0.000027410344,0.000008249891,0.00005257412,0.0006300316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995767,0.000026477259,0.000653361,0.0015974345,0.0009166339,0.0010391086],"domain_scores_gemma":[0.9972035,0.0004989657,0.00027490442,0.0014852842,0.000383371,0.00015394903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013579406,0.00059420406,0.00061564485,0.0006264643,0.00037129998,0.0008833574,0.0040707886,0.0004033201,0.000013626845],"category_scores_gemma":[0.00012819012,0.0005562558,0.00026342776,0.00044702765,0.0005452506,0.001112789,0.0013773481,0.0007093684,0.000034601708],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021867703,0.00009515369,0.00006195913,0.00021975725,0.000027382726,0.00006655689,0.0010405447,0.044366207,0.00020580928,0.12715559,0.00049428595,0.8262449],"study_design_scores_gemma":[0.00032603653,0.00030827496,0.00007883935,0.00030455567,0.000013541291,0.00006024757,1.2151934e-7,0.6493993,0.0034598669,0.33940062,0.0058708186,0.00077782746],"about_ca_topic_score_codex":0.000051695213,"about_ca_topic_score_gemma":0.00018649727,"teacher_disagreement_score":0.82546705,"about_ca_system_score_codex":0.0003898453,"about_ca_system_score_gemma":0.00069433893,"threshold_uncertainty_score":0.99968886},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006511495,0.00008859906,0.97622573,0.00043376797,0.010568391,0.00058605993,0.00000360808,0.0006972583,0.010745424],"genre_scores_gemma":[0.3251795,0.00002433713,0.6576929,0.005471638,0.0040111,0.00012437189,0.000059991893,0.00020467855,0.0072314595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938176,0.00014963132,0.0011678792,0.0027118837,0.0009899278,0.0011630565],"domain_scores_gemma":[0.995095,0.00035310208,0.0009974322,0.0026001933,0.00080005865,0.00015417863],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011855412,0.0009954287,0.0008859247,0.0034814824,0.0005063088,0.00080400443,0.0065448005,0.00082686136,0.0002771321],"category_scores_gemma":[0.00007612473,0.0009669055,0.0002549138,0.001356339,0.001081733,0.0030172,0.0030541695,0.0031903887,0.0010314466],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023770372,0.00033989266,0.00012951264,0.00010573737,0.00009831991,0.00039787145,0.0033307539,0.0026779738,0.001859712,0.03682567,0.006098791,0.948112],"study_design_scores_gemma":[0.0015005966,0.002480655,0.0018532514,0.0025730168,0.000054822198,0.001573877,0.0000020466575,0.47681296,0.03644898,0.44029182,0.03172237,0.0046856035],"about_ca_topic_score_codex":0.00007843164,"about_ca_topic_score_gemma":0.0001381017,"teacher_disagreement_score":0.9434264,"about_ca_system_score_codex":0.001708285,"about_ca_system_score_gemma":0.00078922947,"threshold_uncertainty_score":0.9997464},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019264853,0.0000993079,0.92056197,0.00050612114,0.00079278025,0.00068035565,0.000038417787,0.00010606714,0.05795012],"genre_scores_gemma":[0.9706226,0.00002191895,0.021876158,0.0019488322,0.00024831007,0.000010274979,0.00002222568,0.000033670232,0.0052160043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99441695,0.000029028231,0.0007595915,0.0010428178,0.0032767882,0.00047483362],"domain_scores_gemma":[0.9976628,0.00043803302,0.00045784045,0.0009236866,0.00034411962,0.00017355874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00135919,0.0004388677,0.0005592285,0.0012443298,0.00025823523,0.0007535324,0.0024277065,0.00018112443,0.0008052423],"category_scores_gemma":[0.000031677933,0.00030312454,0.000120651355,0.0007515116,0.00084100623,0.0009530882,0.00040499176,0.00049745024,0.00057679863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008165264,0.000037161233,0.0009741099,0.000005512704,0.000016888736,0.00015478967,0.0008878138,0.016344298,0.000024992676,0.005184103,0.0002400472,0.97604865],"study_design_scores_gemma":[0.002464972,0.0012912959,0.025901953,0.0015243205,0.000118979566,0.00021966791,0.0000149439,0.5581686,0.0008181156,0.35038182,0.05487666,0.0042187017],"about_ca_topic_score_codex":0.000022039409,"about_ca_topic_score_gemma":0.00011300388,"teacher_disagreement_score":0.97182995,"about_ca_system_score_codex":0.00013102677,"about_ca_system_score_gemma":0.00021792942,"threshold_uncertainty_score":0.99994206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000060492584,0.000109666755,0.99680537,0.00017850297,0.00018155333,0.0014866968,0.000004484563,0.0011660142,0.0000616337],"genre_scores_gemma":[0.019499635,0.000004533266,0.97974163,0.00037057415,0.00015493778,0.00009685066,0.000008694058,0.000064285865,0.000058856407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965048,0.000029968893,0.0004530261,0.0014420578,0.0008645113,0.0007056344],"domain_scores_gemma":[0.9963185,0.0015176105,0.00027126382,0.0012661641,0.0004678562,0.00015857561],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007599623,0.0005730911,0.00051999016,0.000875101,0.00028224353,0.00033839076,0.002381488,0.00030144912,0.0000030525084],"category_scores_gemma":[0.00005727669,0.0005145049,0.00013528398,0.0006722483,0.0004645969,0.0004234173,0.00029468155,0.00049475196,0.000006265775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009081715,0.000013912179,0.000007130733,0.000027037173,0.0000059600065,0.000026979,0.00010925527,0.70269513,0.000016164182,0.0016266105,0.00001210406,0.29545063],"study_design_scores_gemma":[0.00029814953,0.0004239914,0.0000069804137,0.00047989344,0.00000693114,0.000021322357,5.645543e-9,0.9841383,0.0011496432,0.01044082,0.002387793,0.0006461625],"about_ca_topic_score_codex":0.0000057302796,"about_ca_topic_score_gemma":0.000003675829,"teacher_disagreement_score":0.29480448,"about_ca_system_score_codex":0.00024413444,"about_ca_system_score_gemma":0.00067663955,"threshold_uncertainty_score":0.99973065},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000999889,0.00019117014,0.9916851,0.0055211675,0.00049504795,0.00069241616,0.00010659427,0.00008580137,0.00022280512],"genre_scores_gemma":[0.45674708,0.000052041283,0.5382055,0.0043446543,0.00031183867,0.00003693075,0.00022789228,0.000028199065,0.000045857534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952384,0.00006123953,0.00059011305,0.0025221691,0.0010271581,0.00056090247],"domain_scores_gemma":[0.99575603,0.0005256413,0.00021527294,0.0031654902,0.00011097703,0.00022660744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008086455,0.00050314795,0.00048423343,0.00064403086,0.00028963783,0.0005289991,0.0036348465,0.00030347603,0.0000059610547],"category_scores_gemma":[0.00007680642,0.00041918925,0.000049204238,0.0007265698,0.00035949989,0.0009745259,0.0022043653,0.00065825775,0.000029332836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003138315,0.000090072615,0.00015712234,0.000023999533,0.000005482277,0.00005413768,0.00019064169,0.40356296,0.0007083284,0.008472337,0.00016866816,0.58653486],"study_design_scores_gemma":[0.00043474868,0.00012167931,0.0049698,0.00031255063,0.0000052969463,0.000015807826,1.10952186e-7,0.9806306,0.00018791886,0.011488468,0.0013033022,0.00052973034],"about_ca_topic_score_codex":0.000055107183,"about_ca_topic_score_gemma":0.00009239606,"teacher_disagreement_score":0.58600515,"about_ca_system_score_codex":0.0005404314,"about_ca_system_score_gemma":0.0006772656,"threshold_uncertainty_score":0.999826},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062532217,0.0005039353,0.996435,0.0001244775,0.00077913865,0.00016955128,0.000007573797,0.00017176333,0.0011832428],"genre_scores_gemma":[0.16328603,0.00004797341,0.8363505,0.00015474008,0.00009445612,0.000003782982,0.000004577671,0.000016216432,0.000041697873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801093,0.000015213285,0.00037941933,0.00077746133,0.00055165234,0.000265291],"domain_scores_gemma":[0.9974532,0.0013958646,0.0002530684,0.0007027751,0.00013678745,0.000058321486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047377258,0.00027910314,0.00030953326,0.0005075979,0.00014023208,0.00034029307,0.0014164839,0.00018055658,0.000017916176],"category_scores_gemma":[0.00015632458,0.0002613728,0.000053498217,0.0003800307,0.00024388114,0.0006074112,0.000895216,0.00033831137,0.0000041990597],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035482396,0.000014414242,0.00027320546,0.000019458848,0.000011289278,0.000021223157,0.00044552266,0.018659353,0.0001279831,0.00577257,0.00012552415,0.9745259],"study_design_scores_gemma":[0.00028562557,0.00018432454,0.0025523787,0.0017272029,0.000025940197,0.000049015318,3.006718e-7,0.54567426,0.002428587,0.42798805,0.017953528,0.0011307625],"about_ca_topic_score_codex":0.00009368186,"about_ca_topic_score_gemma":0.00005320795,"teacher_disagreement_score":0.97339517,"about_ca_system_score_codex":0.00012685891,"about_ca_system_score_gemma":0.00018716934,"threshold_uncertainty_score":0.99998385},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36414593,0.00001922365,0.6328759,0.0020990174,0.00016667189,0.0006331707,3.545714e-7,0.00004308582,0.00001662127],"genre_scores_gemma":[0.8355999,0.0000022464833,0.16188374,0.0024060234,0.00007541167,0.000020810989,0.0000027368897,0.0000043698847,0.0000047535063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891305,0.000029359568,0.00023525079,0.00031779867,0.00023665358,0.0002678724],"domain_scores_gemma":[0.9994846,0.00018311232,0.00004232864,0.00018458848,0.000044963872,0.000060402344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048660082,0.000104987645,0.00017663714,0.0003701541,0.000095600786,0.000062381376,0.00012278743,0.000038498107,0.000017121447],"category_scores_gemma":[0.00015110374,0.00008802231,0.000048460566,0.00074175966,0.000047712514,0.00008956983,0.00003362224,0.00010945856,0.000004458825],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007002736,0.00008815453,0.00031235584,0.000035225647,0.0000026280031,0.000031469324,0.0012805404,0.008538241,0.010540159,0.000011684707,0.000016050306,0.97907346],"study_design_scores_gemma":[0.0033695668,0.000370956,0.012921511,0.00015378755,0.00001113831,0.00009574143,0.000009157307,0.97029823,0.011330975,0.001254427,0.00006486287,0.000119673125],"about_ca_topic_score_codex":0.00001600122,"about_ca_topic_score_gemma":0.000061426064,"teacher_disagreement_score":0.9789538,"about_ca_system_score_codex":0.00015454329,"about_ca_system_score_gemma":0.000080928345,"threshold_uncertainty_score":0.35894457},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039356157,0.0015918977,0.9970663,0.00012971343,0.00023033607,0.0007040511,0.000025589285,0.00018426779,0.000028484561],"genre_scores_gemma":[0.26808205,0.00014166538,0.73159015,0.000070595146,0.000030716754,0.000049429076,0.0000052299574,0.000018689067,0.000011445975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975756,0.0000138659,0.0005999998,0.0007986507,0.00067093835,0.00034098208],"domain_scores_gemma":[0.99798197,0.00034561375,0.00031248003,0.0010147431,0.00027686273,0.00006831136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012204874,0.00039497207,0.00081275863,0.0012479072,0.0001695044,0.0002699329,0.0018585849,0.00013455782,7.979592e-7],"category_scores_gemma":[0.000005783048,0.00028636982,0.00038375388,0.0007148116,0.00030020185,0.00049037935,0.00025159845,0.00033637122,1.5392871e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013890145,0.000004984969,7.45188e-7,0.000060825143,0.00035727344,0.0000010528348,0.0005822009,0.82069635,0.0000097186,0.15039727,5.022641e-7,0.02788768],"study_design_scores_gemma":[0.00008176943,0.000043386513,0.0000013390746,0.00010763722,0.0008523642,0.000008124786,3.96809e-8,0.91689444,0.00062935916,0.08102278,0.0000899081,0.0002688464],"about_ca_topic_score_codex":0.000054218308,"about_ca_topic_score_gemma":0.000009547719,"teacher_disagreement_score":0.26804268,"about_ca_system_score_codex":0.00013039824,"about_ca_system_score_gemma":0.00018008509,"threshold_uncertainty_score":0.9999589},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032150667,0.00014911075,0.9963671,0.00015024649,0.0017196854,0.0002345481,0.0000020120424,0.000106033396,0.00094974163],"genre_scores_gemma":[0.29842377,0.000025791434,0.7008668,0.00025136926,0.00029555615,0.000002337369,0.000008673183,0.000018622672,0.000107065134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681765,0.000024245426,0.0006107264,0.0010053193,0.0011068971,0.00043516952],"domain_scores_gemma":[0.9981533,0.00029029293,0.0002977454,0.00091761124,0.00020765989,0.0001333852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011939772,0.00029840108,0.00035274908,0.00093920063,0.000103077844,0.00015392654,0.0018820601,0.00030924418,0.000009241274],"category_scores_gemma":[0.00015799902,0.00028937627,0.0000744452,0.0005282739,0.00039264845,0.00054736633,0.0008771615,0.00044555642,0.000008744108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041729204,0.00002851039,0.00046124353,0.000055267836,0.0000068080567,0.000029859375,0.00047362284,0.029737769,0.0008088511,0.018244397,0.0000027592725,0.95014673],"study_design_scores_gemma":[0.00024303056,0.0000892035,0.00019629874,0.00048542023,0.0000041321173,0.00001849936,8.560656e-8,0.95375586,0.0024859793,0.041750483,0.00063961797,0.00033141402],"about_ca_topic_score_codex":0.000077754215,"about_ca_topic_score_gemma":0.00006389743,"teacher_disagreement_score":0.94981533,"about_ca_system_score_codex":0.00024186561,"about_ca_system_score_gemma":0.0002745294,"threshold_uncertainty_score":0.99995583},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001977283,0.0011746753,0.880859,0.00014353654,0.0015070414,0.00025999363,0.0000137742145,0.000066749715,0.1139979],"genre_scores_gemma":[0.91017836,0.000023442637,0.07630066,0.0018828482,0.0024114102,0.00001627081,0.000008321462,0.00007472161,0.009103954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804115,0.000011984331,0.0005086398,0.00080155407,0.00009847258,0.00053818786],"domain_scores_gemma":[0.9987478,0.0001631815,0.00040668948,0.0005412273,0.000053695116,0.00008740685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097531994,0.00033341962,0.0005969919,0.00033080447,0.0002002749,0.00026293617,0.0006932615,0.00021385656,0.00024242372],"category_scores_gemma":[0.00003284663,0.00030989063,0.000067402565,0.00019340421,0.00070151134,0.0002224791,0.00016044153,0.00048785537,0.00036003243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006493653,0.000006180944,0.0010184466,0.000031432104,0.000021137672,0.000016090808,0.001089522,0.09152348,0.0000022249226,0.8944726,0.0001165016,0.011695877],"study_design_scores_gemma":[0.00020703884,0.00016020972,0.00019251883,0.000387364,0.0000036194365,0.000042226002,7.602089e-7,0.05917524,0.000021187321,0.9325794,0.00656938,0.00066106394],"about_ca_topic_score_codex":0.00008857988,"about_ca_topic_score_gemma":0.00003312454,"teacher_disagreement_score":0.9082011,"about_ca_system_score_codex":0.00014366441,"about_ca_system_score_gemma":0.000063752304,"threshold_uncertainty_score":0.9999353},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008731004,0.0008161093,0.9953192,0.0004989985,0.00038733077,0.00027145154,0.0000024269636,0.00037234012,0.0014590464],"genre_scores_gemma":[0.13359722,0.0005224824,0.8648602,0.00062649837,0.00022199853,0.000008000816,0.000008530216,0.000035099496,0.00011996586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967886,0.000028178123,0.00049603684,0.0014682688,0.000746964,0.00047195345],"domain_scores_gemma":[0.9977276,0.0004148405,0.00038677518,0.000980272,0.00037159154,0.00011896635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004515399,0.000473023,0.000523909,0.0009286654,0.00042148354,0.00088540383,0.0018614008,0.00022073861,0.000010190335],"category_scores_gemma":[0.00013126509,0.00045261552,0.00007588584,0.00074381597,0.00052708155,0.0024564522,0.0012545132,0.00051487755,0.000016774422],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029243731,0.000014809017,0.00005892508,0.000029230232,0.0000123916625,0.00010577721,0.00083853723,0.008229408,0.00024162003,0.015767088,0.000017211742,0.9746821],"study_design_scores_gemma":[0.0006160781,0.00019148744,0.0009303304,0.00084580085,0.000032966072,0.0007747988,9.93494e-7,0.5496661,0.006200065,0.43219063,0.0064890464,0.002061715],"about_ca_topic_score_codex":0.0000492495,"about_ca_topic_score_gemma":0.000120758064,"teacher_disagreement_score":0.97262037,"about_ca_system_score_codex":0.00023189237,"about_ca_system_score_gemma":0.00022193363,"threshold_uncertainty_score":0.9997926},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026338952,0.00006856218,0.995261,0.0003033861,0.00035670275,0.00017571013,0.000005848117,0.000026730075,0.0035386798],"genre_scores_gemma":[0.89232,0.00003578563,0.104507715,0.0024418347,0.00026607857,0.000006226627,0.00003619707,0.00001890017,0.0003672692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977759,0.000053901404,0.00044003778,0.0006458858,0.00082071585,0.00026354744],"domain_scores_gemma":[0.9985263,0.00014651072,0.000205695,0.0009771057,0.00010831948,0.00003611214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090128934,0.0002239951,0.0002661655,0.00044018045,0.00007862706,0.00022753546,0.002563964,0.00013155788,0.000015510583],"category_scores_gemma":[0.0000339649,0.00016717987,0.00006334688,0.00058579294,0.00038416262,0.0003656984,0.000505312,0.00028916955,0.000011577386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010169846,0.0005113299,0.0025939255,0.00017620578,0.000019161882,0.00017484797,0.011777819,0.069398485,0.0011816333,0.22505042,0.0012930541,0.687813],"study_design_scores_gemma":[0.00041351197,0.00015701496,0.003779269,0.00036260727,0.000007892697,0.000032894994,0.0000027945098,0.9097926,0.0008594631,0.08077537,0.0031617875,0.00065480504],"about_ca_topic_score_codex":0.00009759645,"about_ca_topic_score_gemma":0.00007485482,"teacher_disagreement_score":0.8920566,"about_ca_system_score_codex":0.00012435259,"about_ca_system_score_gemma":0.00017532494,"threshold_uncertainty_score":0.6817397},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007751861,0.0003696121,0.99696267,0.000041663065,0.00038100706,0.0012320773,0.00001978504,0.0001148399,0.00010318268],"genre_scores_gemma":[0.5367131,0.0000046416794,0.46282294,0.000071288945,0.00013910345,0.000008085059,0.00021643324,0.000018973968,0.0000054269703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580115,0.000029294357,0.000604829,0.0021432335,0.000890783,0.0005306864],"domain_scores_gemma":[0.9945168,0.00047335084,0.0005803954,0.0039142435,0.00035549255,0.00015975293],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016649574,0.00043687536,0.00052271946,0.00043855765,0.0002724231,0.00073126366,0.0057484005,0.00029495556,0.0000015718286],"category_scores_gemma":[0.00016380603,0.00032726512,0.000029844436,0.00052804954,0.00053467456,0.0012698577,0.0012704618,0.00035747528,7.3771093e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031136464,0.000055439057,0.0019809983,0.00020183949,0.0000112946755,0.000007490783,0.00028036028,0.00588126,0.00008362546,0.016432814,0.000002848337,0.9750309],"study_design_scores_gemma":[0.0004624945,0.0007083388,0.000701954,0.0002502146,0.000019934325,0.00003774172,0.0000012590067,0.93254644,0.0004460582,0.06351772,0.00081490004,0.00049297966],"about_ca_topic_score_codex":0.000094840245,"about_ca_topic_score_gemma":0.0005483719,"teacher_disagreement_score":0.9745379,"about_ca_system_score_codex":0.00006623773,"about_ca_system_score_gemma":0.0006555207,"threshold_uncertainty_score":0.9999179},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000081860984,0.00008124345,0.9876983,0.0011124141,0.0019647216,0.0004687057,0.0000016238956,0.0005771336,0.008013955],"genre_scores_gemma":[0.070733435,0.000018286762,0.92268944,0.0029933364,0.0007692907,0.000009393733,0.000013257247,0.00005086192,0.0027226869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99437,0.00009159259,0.0007675806,0.0019961733,0.00175945,0.0010152112],"domain_scores_gemma":[0.9968368,0.00050319335,0.00037375654,0.0015064914,0.00039863677,0.00038113107],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015149488,0.0007320727,0.00065944233,0.0010304312,0.0005270005,0.0012492675,0.0033147465,0.00040423416,0.0001476235],"category_scores_gemma":[0.00024558828,0.00073644763,0.0001701442,0.0008789998,0.00029123237,0.000853812,0.0017320795,0.0015423348,0.0003634329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005912207,0.000014542905,0.00012117021,0.000017421387,0.000013180487,0.000040522787,0.0007436466,0.86261606,0.00013377752,0.0039893794,0.000102400736,0.13220201],"study_design_scores_gemma":[0.00027607963,0.000569318,0.002661989,0.0002870183,0.000012845907,0.00009877104,1.8823775e-7,0.97461504,0.00034511587,0.010672948,0.009410883,0.0010497957],"about_ca_topic_score_codex":0.000015414163,"about_ca_topic_score_gemma":0.000008457592,"teacher_disagreement_score":0.13115221,"about_ca_system_score_codex":0.00064478285,"about_ca_system_score_gemma":0.00065477996,"threshold_uncertainty_score":0.9997875},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002181671,0.00079905643,0.98123014,0.00014178937,0.0009162013,0.0003522897,0.000017939368,0.00002243521,0.014338464],"genre_scores_gemma":[0.8679579,0.00034287627,0.12072309,0.0018164406,0.0054190583,0.000019209012,0.00009320475,0.00011091618,0.0035173069],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99785984,0.000027325834,0.00028973952,0.0009409977,0.00045931613,0.00042278503],"domain_scores_gemma":[0.9988184,0.000046563677,0.00015650837,0.0007545413,0.0001004287,0.00012355721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035352353,0.00038743968,0.00032122585,0.00015768882,0.00012750369,0.00009977324,0.00094101846,0.0003471799,0.0001017907],"category_scores_gemma":[0.000049163868,0.0003396875,0.00011707813,0.00007820647,0.00030598414,0.000005750279,0.0004502063,0.00024161016,0.00003738416],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024337362,0.00001120006,0.00012657272,0.00002624693,0.000047610323,0.000036954454,0.00005050539,0.0024512163,0.16334435,0.0019009117,0.00010283042,0.83187723],"study_design_scores_gemma":[0.0004622037,0.00054742786,0.000101134945,0.0001992314,0.000031633073,0.000046237295,1.3633608e-7,0.0004566859,0.75355506,0.17657152,0.06694327,0.0010854426],"about_ca_topic_score_codex":0.000014979369,"about_ca_topic_score_gemma":0.000017870354,"teacher_disagreement_score":0.86577624,"about_ca_system_score_codex":0.00005734684,"about_ca_system_score_gemma":0.00016965297,"threshold_uncertainty_score":0.9999055},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3477252,0.000009837842,0.64957947,0.0016440725,0.00054844975,0.00013239765,0.0000013612749,0.00008881785,0.00027036818],"genre_scores_gemma":[0.9333686,0.0000011986355,0.05883983,0.0076391557,0.000120863886,0.000009496792,1.01616976e-7,0.000012474491,0.000008281965],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99749345,0.00010108975,0.0001697603,0.0010142432,0.0006456573,0.0005758295],"domain_scores_gemma":[0.9958193,0.003521278,0.00007666681,0.00043204808,0.000057189365,0.000093566814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005562153,0.0002177618,0.0001884765,0.0003099925,0.0003859054,0.00013128626,0.000864635,0.000041126747,0.00004538544],"category_scores_gemma":[0.0022367812,0.00016963949,0.000034285018,0.0018328768,0.0010122985,0.00062050915,0.00034886444,0.00034780861,0.00005023479],"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.0007778085,0.000647517,0.049151056,0.00006487203,0.000015584796,0.0011569983,0.040750112,0.11724539,0.47347596,0.009417235,0.00021321155,0.30708423],"study_design_scores_gemma":[0.00086032826,0.0011192614,0.08191689,0.00017779454,0.000005808979,0.000723204,0.0000174673,0.08583333,0.76675725,0.06154849,0.00011102452,0.0009291188],"about_ca_topic_score_codex":0.00009300632,"about_ca_topic_score_gemma":0.00025945206,"teacher_disagreement_score":0.59073967,"about_ca_system_score_codex":0.000118036376,"about_ca_system_score_gemma":0.00017199316,"threshold_uncertainty_score":0.6917697},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031746877,0.0005513924,0.9892607,0.00033758327,0.0013972761,0.00031180296,0.000028952654,0.0001645689,0.007916025],"genre_scores_gemma":[0.059728123,0.00005022118,0.9382369,0.00034634557,0.0005269339,0.0000102181275,0.00003389102,0.000043601096,0.0010237928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646837,0.0000343579,0.0007293141,0.0012508288,0.0009928623,0.000524301],"domain_scores_gemma":[0.9971902,0.000303748,0.00051773846,0.0015776333,0.00031119506,0.00009953381],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005556911,0.0004872949,0.0007023436,0.00067568524,0.0002067373,0.0001258451,0.0015750908,0.00019421436,0.000021015081],"category_scores_gemma":[0.000053298518,0.00044318056,0.00014331684,0.00053670234,0.0011187992,0.00086518517,0.0009895095,0.00046084952,0.000021402477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007956321,0.000030528314,0.000039402043,0.00010637494,0.000010688326,0.000050849798,0.0004353649,0.021162273,0.0006545158,0.859546,0.00016805589,0.11778801],"study_design_scores_gemma":[0.0011460058,0.00059320463,0.0011680876,0.0023396253,0.000026458822,0.00024666075,0.000002517159,0.34578308,0.012419006,0.48489767,0.14832827,0.0030493913],"about_ca_topic_score_codex":0.00016962252,"about_ca_topic_score_gemma":0.00024042955,"teacher_disagreement_score":0.3746483,"about_ca_system_score_codex":0.0002554503,"about_ca_system_score_gemma":0.00042297065,"threshold_uncertainty_score":0.999802},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023702882,0.00049034355,0.99529016,0.00023907392,0.0011719147,0.0021823272,0.000046433663,0.00038235518,0.00017370333],"genre_scores_gemma":[0.03593597,0.00020261793,0.96137816,0.0012657696,0.00053003913,0.00016696993,0.000054370157,0.00012598852,0.0003401265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99250364,0.0000847574,0.0011136904,0.0033137326,0.0013210304,0.0016631592],"domain_scores_gemma":[0.9940907,0.00076605025,0.00074481557,0.0030938105,0.0008559395,0.00044872155],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013766296,0.0012387397,0.0013592452,0.000573855,0.0007382846,0.00070112833,0.0059911353,0.00075464096,0.000004175786],"category_scores_gemma":[0.00006363209,0.0010360095,0.0003029012,0.0008617952,0.001388704,0.0008324416,0.0017118566,0.0016860242,0.00001107819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002850737,0.000097244796,0.000034094355,0.000054260938,0.000022987375,0.00009774111,0.00050289265,0.81861144,0.000009279966,0.0013544443,0.00014742972,0.17903969],"study_design_scores_gemma":[0.0012336829,0.0002913225,0.00005181838,0.00067047786,0.000021773609,0.00018427247,1.225633e-7,0.9931236,0.00002149487,0.0026976566,0.00043547052,0.0012682977],"about_ca_topic_score_codex":0.00004869627,"about_ca_topic_score_gemma":0.00087861693,"teacher_disagreement_score":0.17777139,"about_ca_system_score_codex":0.00050436,"about_ca_system_score_gemma":0.0009920325,"threshold_uncertainty_score":0.9993869},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017429314,0.00026866293,0.9899098,0.00035521731,0.0064446256,0.00092960795,0.000007553577,0.00014902753,0.00019255177],"genre_scores_gemma":[0.8347668,0.000072109506,0.16232751,0.00044586632,0.0020422235,0.00020587536,0.000018540994,0.00005331625,0.000067766174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957391,0.00006333792,0.000775297,0.0015532007,0.0012306261,0.00063841796],"domain_scores_gemma":[0.9971163,0.00091100315,0.00033167723,0.0010733234,0.00026252706,0.0003051428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018850915,0.0004646659,0.00061635824,0.0008576551,0.00023330477,0.00050280313,0.0030491247,0.0006173792,0.000012732212],"category_scores_gemma":[0.00028653606,0.00041220052,0.00014817732,0.00035572605,0.00028465758,0.0006927971,0.0006997038,0.000818705,0.000019926845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001643967,0.00014697034,0.0029513133,0.00047342837,0.000021003909,0.00021379591,0.009579587,0.006405886,0.00043717647,0.059084956,0.00001151986,0.92065793],"study_design_scores_gemma":[0.0007155252,0.00043229008,0.000835098,0.0025318814,0.000012622293,0.00008159883,0.0000036484273,0.97124153,0.008148393,0.012196719,0.0026016526,0.0011990156],"about_ca_topic_score_codex":0.00014181821,"about_ca_topic_score_gemma":0.0014704244,"teacher_disagreement_score":0.96483564,"about_ca_system_score_codex":0.000523243,"about_ca_system_score_gemma":0.0005111606,"threshold_uncertainty_score":0.999833},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019991056,0.0004778719,0.996481,0.0005998477,0.00089576497,0.00037451895,0.000002917378,0.000783017,0.00036507403],"genre_scores_gemma":[0.055827137,0.00004868853,0.94320256,0.0005091577,0.00021618168,0.000014446555,0.000005544217,0.0000454634,0.00013083556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658,0.00006973027,0.0004736613,0.0014116378,0.00078821153,0.0006767369],"domain_scores_gemma":[0.99686784,0.0009943713,0.00024180468,0.0016126633,0.00013247585,0.00015082749],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013246554,0.00053411373,0.00046335632,0.0008077502,0.00013452416,0.0006657104,0.0036377325,0.00036709747,0.0000072360526],"category_scores_gemma":[0.00010499019,0.00052216585,0.000080818354,0.0007266561,0.00028926771,0.0012805755,0.0005544692,0.0009774098,0.000018947589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006092653,0.00007213605,0.0002857985,0.000029312398,0.0000060555394,0.0003438125,0.00017393084,0.5150226,0.000025962172,0.0075225765,0.00017083819,0.4763409],"study_design_scores_gemma":[0.0002042607,0.00029747127,0.00052692124,0.00034458018,0.0000074928157,0.00009025619,3.931871e-8,0.67984676,0.0005405472,0.31555787,0.0016920072,0.00089181593],"about_ca_topic_score_codex":0.000114978175,"about_ca_topic_score_gemma":0.00010129781,"teacher_disagreement_score":0.4754491,"about_ca_system_score_codex":0.00028389684,"about_ca_system_score_gemma":0.00057938084,"threshold_uncertainty_score":0.999723},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000571849,0.00023299553,0.965532,0.00064743974,0.001115153,0.00081836956,0.000120444565,0.000022441853,0.03145395],"genre_scores_gemma":[0.049017373,0.0012941376,0.9114175,0.014715884,0.00087939244,0.000039933282,0.00052063307,0.00012844008,0.021986742],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99207896,0.00010066518,0.0011291303,0.0025603373,0.003487298,0.000643628],"domain_scores_gemma":[0.9943151,0.00091895286,0.00045900344,0.00410074,0.00006261876,0.00014360604],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.010061226,0.0004368567,0.00056536414,0.0017779323,0.0001580642,0.00067963044,0.008479815,0.00019961412,0.00020419972],"category_scores_gemma":[0.00038450566,0.0003631418,0.000049622045,0.0014444257,0.00094193226,0.00096982374,0.008723586,0.0005455105,0.0004968034],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020720143,0.000060464863,0.000092649534,0.000013713401,0.000018472609,0.00029009467,0.00038556164,0.006073211,0.0000047790486,0.026365615,0.00049784983,0.96617687],"study_design_scores_gemma":[0.00062866404,0.000097669355,0.0017440692,0.00025874766,0.000017908485,0.0000053018707,0.0000072935713,0.032089837,0.00009579449,0.4043665,0.5598968,0.00079140626],"about_ca_topic_score_codex":0.000018654575,"about_ca_topic_score_gemma":0.0005303887,"teacher_disagreement_score":0.96538544,"about_ca_system_score_codex":0.00033981533,"about_ca_system_score_gemma":0.00011313364,"threshold_uncertainty_score":0.99988204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024055226,0.00015118995,0.9882929,0.0005561612,0.0007275048,0.00026851767,0.000011207551,0.00014421072,0.007442816],"genre_scores_gemma":[0.9682088,0.00004673663,0.02928469,0.0019890708,0.0001975563,0.0000070818796,0.000009319222,0.000020048117,0.00023671657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632156,0.000044914555,0.0005655885,0.001319285,0.0012087874,0.00053989457],"domain_scores_gemma":[0.9971853,0.00045926878,0.00031316897,0.0016666878,0.00022058084,0.00015498976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066203554,0.00049415854,0.00078728155,0.0017277614,0.00016117709,0.00018963014,0.0028967794,0.00030722175,0.00016455725],"category_scores_gemma":[0.000017373632,0.00043635242,0.00031921608,0.0021492587,0.0004281892,0.00031892923,0.0002584626,0.00065775675,0.00003803667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000117212185,0.000022245013,0.00014110352,0.000010835054,0.000041137697,0.000012622656,0.00006024198,0.5565211,0.0000034422594,0.003313216,0.000010330854,0.43985197],"study_design_scores_gemma":[0.00031460339,0.00022013363,0.00057418476,0.0002445428,0.0000959544,0.0000034948455,2.4386708e-8,0.99508756,0.000059743288,0.0017771877,0.0011818554,0.00044074084],"about_ca_topic_score_codex":0.000006741598,"about_ca_topic_score_gemma":0.00006662144,"teacher_disagreement_score":0.96580327,"about_ca_system_score_codex":0.00014588678,"about_ca_system_score_gemma":0.00062468,"threshold_uncertainty_score":0.99980885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019437914,0.00009833863,0.9962096,0.000055279583,0.00033526972,0.00042037034,0.0000046484406,0.00010698139,0.0008257155],"genre_scores_gemma":[0.12696967,0.0000034707832,0.87273586,0.00014466477,0.0000588041,0.0000062630224,0.0000095843525,0.000022390295,0.00004929079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614006,0.0000615911,0.0006899049,0.0012696708,0.001287537,0.0005512118],"domain_scores_gemma":[0.99674124,0.00029161444,0.0007178318,0.0017067603,0.00043181368,0.0001107243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011176874,0.00045677775,0.00077480875,0.002074403,0.00014090742,0.0003427693,0.0026909425,0.000212937,0.000004605326],"category_scores_gemma":[0.00006412393,0.00037853347,0.00015743088,0.0038769299,0.0009807544,0.0006946862,0.0005722538,0.0004562212,0.000002933283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008600041,0.00007730455,0.001119909,0.00008354368,0.00014385628,0.00003705404,0.0006161038,0.42778873,0.00021478605,0.024648398,0.0000023065907,0.5452594],"study_design_scores_gemma":[0.00013558728,0.0002445049,0.0013474852,0.00026109838,0.00014747797,0.0000238514,1.3799503e-7,0.9767974,0.001017578,0.01946774,0.00008689584,0.00047024092],"about_ca_topic_score_codex":0.00010413342,"about_ca_topic_score_gemma":0.000116372146,"teacher_disagreement_score":0.54900867,"about_ca_system_score_codex":0.00029765686,"about_ca_system_score_gemma":0.00049580995,"threshold_uncertainty_score":0.99986666},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018346863,0.00007767235,0.994346,0.00007233392,0.0018765501,0.00042075405,0.000002227547,0.0004324869,0.0009372438],"genre_scores_gemma":[0.51418906,0.0000021469461,0.48521474,0.00013229964,0.00027853056,0.000007007271,0.0000011997887,0.000035691974,0.00013931323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596286,0.000093809795,0.000511982,0.0017590809,0.0010156444,0.0006566466],"domain_scores_gemma":[0.9969779,0.00028277718,0.00040724434,0.0018223696,0.00032320936,0.00018647176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016186256,0.00059352024,0.00061247445,0.00089790544,0.00055233913,0.00070731586,0.0024663454,0.0004809993,0.000004846031],"category_scores_gemma":[0.000047151345,0.00046971565,0.000125319,0.00062333414,0.00055529096,0.0005764669,0.00068153994,0.0014210297,0.000036998776],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013403169,0.00004448622,0.00022757579,0.0001540635,0.000022912629,0.00031739703,0.0007630053,0.0085993605,0.008422449,0.004149347,8.1161323e-7,0.9772852],"study_design_scores_gemma":[0.002380598,0.0015553167,0.005161206,0.003037699,0.000041738083,0.001474078,0.0000014300957,0.9024569,0.058266807,0.020557113,0.001575428,0.0034916927],"about_ca_topic_score_codex":0.000057298636,"about_ca_topic_score_gemma":0.0006786901,"teacher_disagreement_score":0.9737935,"about_ca_system_score_codex":0.00026867833,"about_ca_system_score_gemma":0.00023592779,"threshold_uncertainty_score":0.99977547},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009500414,0.0027337947,0.97618943,0.004236777,0.0015131859,0.0010980183,0.0000125539045,0.00009834376,0.0046175034],"genre_scores_gemma":[0.9672177,0.0011990779,0.026604595,0.0034754642,0.0012467392,0.000025211239,0.00002112474,0.000023252684,0.00018684755],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974675,0.00014532977,0.00034980988,0.0007562625,0.00085584115,0.00042523275],"domain_scores_gemma":[0.9985658,0.0004864316,0.00021520922,0.00054699276,0.00012052849,0.000065035965],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020863437,0.00025618385,0.0002600368,0.00019379971,0.00096091506,0.0014306199,0.0016046722,0.0005694611,0.000020719215],"category_scores_gemma":[0.00028765286,0.00021006698,0.00004402769,0.0004218804,0.00083825423,0.0014024386,0.0005911765,0.0012164223,0.000011791758],"study_design_candidate":"theoretical_or_conceptual","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.000090393725,0.00036253803,0.014916737,0.0009881922,0.00005141602,0.00020032677,0.12845165,0.003497764,0.0013946977,0.08756058,0.00082257314,0.76166314],"study_design_scores_gemma":[0.00051189854,0.000095483956,0.005710887,0.0015472164,0.000028678642,0.000021057385,0.00003617673,0.03583581,0.00040923842,0.9095635,0.045092676,0.0011473726],"about_ca_topic_score_codex":0.0030736153,"about_ca_topic_score_gemma":0.074362494,"teacher_disagreement_score":0.9577173,"about_ca_system_score_codex":0.00019771606,"about_ca_system_score_gemma":0.00033573032,"threshold_uncertainty_score":0.999606},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043215562,0.000716041,0.9871142,0.00067366683,0.00084833946,0.00017547281,0.000056232035,0.00005905402,0.009924863],"genre_scores_gemma":[0.8354753,0.0011077673,0.1509479,0.0011057272,0.0010127057,0.000005104311,0.000021574451,0.000059111022,0.0102647925],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99101627,0.00015790194,0.0013535463,0.0024799993,0.0043074586,0.0006848065],"domain_scores_gemma":[0.99286175,0.0023453797,0.0010019678,0.0028415003,0.00065939914,0.0002900154],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0038117485,0.000615652,0.0014415198,0.0048402757,0.0005336912,0.0009820379,0.0044095283,0.0004915487,0.0025046444],"category_scores_gemma":[0.0014717561,0.00044154914,0.0009997776,0.006039543,0.0011762286,0.0004015267,0.00080497924,0.0011392785,0.00047553217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005964856,0.000009521546,0.0026585562,0.0000013789453,0.00014855537,0.000039350703,0.00037028326,0.27585563,0.0000036880358,0.00069006806,0.00007803235,0.72013897],"study_design_scores_gemma":[0.00013538737,0.000048842387,0.00406515,0.000019971276,0.00037568793,0.000008519499,4.604991e-7,0.48831367,0.000055653833,0.5015593,0.004874424,0.00054290466],"about_ca_topic_score_codex":0.00011003472,"about_ca_topic_score_gemma":0.0012368609,"teacher_disagreement_score":0.83616626,"about_ca_system_score_codex":0.000216859,"about_ca_system_score_gemma":0.0001929791,"threshold_uncertainty_score":0.9998036},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012525085,0.00004966394,0.9902786,0.0007853382,0.0010434687,0.00034964585,0.000005884808,0.000060646435,0.0061742505],"genre_scores_gemma":[0.36040527,0.000016888946,0.63624674,0.0026209925,0.00026315445,0.000009453471,0.000009474056,0.00003673839,0.00039125982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966271,0.000049677703,0.000539845,0.0012416312,0.0011066443,0.0004350985],"domain_scores_gemma":[0.997783,0.0003851357,0.00028533852,0.0010273709,0.00037138883,0.00014773561],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006482453,0.00047448257,0.0005217464,0.00071409065,0.00012791446,0.0002304444,0.001525065,0.0001986917,0.00005667503],"category_scores_gemma":[0.000071056864,0.00039598736,0.00012047327,0.0008145817,0.00037204725,0.00041289016,0.00040023235,0.00053044094,0.00006848959],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016708109,0.00013705475,0.000101811514,0.0001143365,0.00004985075,0.0002603097,0.0020557968,0.050327275,0.0009924194,0.12787741,0.00018113261,0.8177355],"study_design_scores_gemma":[0.002431353,0.0022311069,0.001083338,0.0030573672,0.00004600161,0.0012817907,9.431013e-7,0.46228427,0.07457353,0.4428008,0.0069556423,0.0032538706],"about_ca_topic_score_codex":0.0000054913203,"about_ca_topic_score_gemma":0.000039487153,"teacher_disagreement_score":0.8144817,"about_ca_system_score_codex":0.0002285477,"about_ca_system_score_gemma":0.0004100889,"threshold_uncertainty_score":0.9998492},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092618994,0.0004753154,0.9940521,0.00007654514,0.0025342542,0.0015558274,0.000005892017,0.00009618805,0.00027770267],"genre_scores_gemma":[0.9098295,0.00005447906,0.089206584,0.0002811922,0.00032582617,0.000039181003,0.000016677937,0.000034000168,0.00021257455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99481535,0.00009800586,0.0012831369,0.0017171719,0.0012795774,0.0008067448],"domain_scores_gemma":[0.9967375,0.00034659918,0.00073161256,0.0015336757,0.0003980907,0.00025255998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030833585,0.00053452177,0.00079868326,0.0011734472,0.00014046331,0.00027634922,0.0026477065,0.0004712628,0.0000072892412],"category_scores_gemma":[0.00007347409,0.00050960685,0.000114066985,0.001258164,0.0001673579,0.00049259467,0.0009497925,0.0005817175,0.000034579312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021672022,0.000092511866,0.005843239,0.00016632488,0.000008759753,0.000060240887,0.0008368874,0.7518282,0.00079241395,0.003725789,0.00002367707,0.23660031],"study_design_scores_gemma":[0.00042142477,0.00017662821,0.0072061154,0.00048825314,0.0000028047275,0.000028101183,4.9743926e-7,0.98974586,0.00031895598,0.00033974857,0.0007169286,0.0005547091],"about_ca_topic_score_codex":0.0007369665,"about_ca_topic_score_gemma":0.0017351882,"teacher_disagreement_score":0.9089033,"about_ca_system_score_codex":0.0005687859,"about_ca_system_score_gemma":0.00033399725,"threshold_uncertainty_score":0.99973553},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11393736,0.033034667,0.84551716,0.0018500884,0.0005032569,0.0004721403,0.00010896998,0.00001993486,0.0045564105],"genre_scores_gemma":[0.9636909,0.0046368567,0.030487048,0.00063523336,0.00031600965,0.0000051275265,0.00010784368,0.000019988045,0.00010104326],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989219,0.000029128756,0.00021597338,0.00041036637,0.00028393112,0.00013871421],"domain_scores_gemma":[0.99941844,0.00013460152,0.00010813408,0.00024237239,0.00006392227,0.00003254589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023822201,0.00019119063,0.00019009858,0.00008335684,0.000054029544,0.000020217203,0.0004591167,0.0001826956,0.000012191359],"category_scores_gemma":[0.00002215501,0.00014996126,0.0000458194,0.000029042862,0.00074772123,0.0000068568206,0.00018806779,0.00017551724,6.1641657e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017991879,0.00020352784,0.00065557903,0.00020543054,0.00012729275,0.00018520796,0.0038471674,0.05996415,0.022075461,0.003265395,0.00029658602,0.90899426],"study_design_scores_gemma":[0.0056101,0.0023543837,0.022855733,0.0023486267,0.00014284968,0.0013779455,0.000055033262,0.2685725,0.056265738,0.6106763,0.025163172,0.004577605],"about_ca_topic_score_codex":0.00000617312,"about_ca_topic_score_gemma":0.000009995113,"teacher_disagreement_score":0.9044167,"about_ca_system_score_codex":0.0000130764265,"about_ca_system_score_gemma":0.0001609622,"threshold_uncertainty_score":0.6115242},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018836202,0.000058051734,0.9689834,0.00062810763,0.0005635457,0.00047163133,0.000020462108,0.0000579333,0.010380656],"genre_scores_gemma":[0.9844809,0.0000063665716,0.0143037755,0.00060848135,0.00022049253,0.000015687405,0.00003462148,0.0000130346125,0.00031663492],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964034,0.00008471653,0.0010975709,0.00074989366,0.0013039396,0.00036045455],"domain_scores_gemma":[0.99708813,0.0011570972,0.00048885576,0.00084813824,0.0003420473,0.00007571064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002854263,0.0003151759,0.00041221274,0.001491981,0.00018066798,0.0009027633,0.0011408157,0.00024485012,0.00014197969],"category_scores_gemma":[0.0005389625,0.00026877222,0.00008116653,0.0011103712,0.00049393316,0.0019013778,0.00039955004,0.00057611254,0.00030456673],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011866698,0.00001067063,0.0015556221,0.00000869914,0.0000017698446,0.000002814172,0.0004946939,0.24775705,0.00060490903,0.016923865,0.00011997735,0.73250806],"study_design_scores_gemma":[0.00047601716,0.00012031499,0.02595294,0.00029986326,0.000008597789,0.000038334623,0.0000024906724,0.33046827,0.0008615469,0.62664557,0.014303562,0.0008225297],"about_ca_topic_score_codex":0.00013010515,"about_ca_topic_score_gemma":0.00070380245,"teacher_disagreement_score":0.9656447,"about_ca_system_score_codex":0.00026938235,"about_ca_system_score_gemma":0.00025898812,"threshold_uncertainty_score":0.99997646},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032063326,0.00004986058,0.9921518,0.0015027332,0.0010080485,0.00093470246,0.000010186669,0.0007697825,0.003252256],"genre_scores_gemma":[0.5753803,0.000009684007,0.4209734,0.0025759465,0.0005610874,0.000038598315,0.00001263196,0.000055812194,0.0003925272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99422014,0.00009759505,0.00080734614,0.0024744908,0.0015829703,0.00081743224],"domain_scores_gemma":[0.99556035,0.0009333468,0.0004609198,0.0025413546,0.0002733034,0.00023071776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012257106,0.00070440106,0.0006443857,0.0012957378,0.00037710814,0.00066949415,0.005336206,0.00041072565,0.000018428627],"category_scores_gemma":[0.00023841497,0.0006344436,0.00013495825,0.0009374499,0.00058367354,0.0007711776,0.00154838,0.0014477968,0.00014463105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019062,0.00041895502,0.0037911907,0.000019601479,0.00002784347,0.00014912679,0.0017048183,0.0023936639,0.00023950965,0.014247158,0.00045429904,0.9765348],"study_design_scores_gemma":[0.0009804931,0.0010467931,0.007305071,0.00043790197,0.000015997408,0.000054065204,0.0000015255324,0.9483105,0.003960999,0.024342066,0.0117073255,0.0018372592],"about_ca_topic_score_codex":0.000008736178,"about_ca_topic_score_gemma":0.000056731104,"teacher_disagreement_score":0.97469753,"about_ca_system_score_codex":0.0007377238,"about_ca_system_score_gemma":0.000475565,"threshold_uncertainty_score":0.99961066},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005058648,0.0004188643,0.9941244,0.0008398456,0.0028415404,0.00087636453,0.000047795085,0.00022629341,0.0006198371],"genre_scores_gemma":[0.0055211876,0.00005373252,0.9917046,0.0011197306,0.00093574164,0.000025539333,0.000032546977,0.000046070494,0.0005608829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99497336,0.000018353745,0.0006280346,0.002213762,0.0012315104,0.000934966],"domain_scores_gemma":[0.99655944,0.00049620407,0.0003448208,0.0019673829,0.00023171715,0.00040041702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006486956,0.00069560244,0.00061419606,0.0005395931,0.00038883073,0.000713961,0.0048374897,0.0003729558,0.000031583335],"category_scores_gemma":[0.0000898197,0.00061420683,0.00020571574,0.00043804306,0.00035698418,0.0010082644,0.0020534417,0.00055173587,0.000047666046],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069196417,0.000027147917,0.0000060211246,0.00003426044,0.000010931199,0.00007046696,0.00034657196,0.019338366,0.00038458366,0.028693426,0.00015042225,0.9509309],"study_design_scores_gemma":[0.0008582515,0.00029301608,0.000019911737,0.00059041934,0.000009518187,0.00008683229,1.2188325e-7,0.60728115,0.0051620044,0.37548605,0.009296233,0.0009165058],"about_ca_topic_score_codex":0.0001346384,"about_ca_topic_score_gemma":0.00003861032,"teacher_disagreement_score":0.95001435,"about_ca_system_score_codex":0.00067729736,"about_ca_system_score_gemma":0.0015876568,"threshold_uncertainty_score":0.9996309},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030513947,0.00016811765,0.9944709,0.0005697569,0.00026606212,0.00023272482,0.0000018440438,0.00008764263,0.00417242],"genre_scores_gemma":[0.17653047,0.00013401893,0.82054186,0.0019750798,0.00010724606,0.000005576149,0.000009599085,0.000024406689,0.0006717627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973695,0.00004844359,0.00036254394,0.0011043324,0.00071602396,0.0003991072],"domain_scores_gemma":[0.99824685,0.0003465147,0.00016221372,0.00086380943,0.00024895303,0.00013168993],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007637202,0.00030098477,0.00037313427,0.0013270087,0.00021617749,0.0010670272,0.0011019001,0.00020058698,0.000033900214],"category_scores_gemma":[0.000059830814,0.00027740694,0.00008716845,0.0014318783,0.00040709027,0.0008677206,0.00043293223,0.00041511026,0.000010295285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010820507,0.0000074721834,0.00005350687,0.000010997387,0.000020536425,0.000012071475,0.00036602723,0.8998618,0.000006685551,0.022974325,0.0000041422186,0.07668135],"study_design_scores_gemma":[0.00010457122,0.00005912228,0.00009757487,0.000037471684,0.000015826994,0.0000042337874,1.7877421e-7,0.8842318,0.000026959427,0.11431306,0.0008302695,0.00027890026],"about_ca_topic_score_codex":0.00001399333,"about_ca_topic_score_gemma":0.00008775668,"teacher_disagreement_score":0.17649995,"about_ca_system_score_codex":0.00011034301,"about_ca_system_score_gemma":0.00031843243,"threshold_uncertainty_score":0.99996996},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052719108,0.00032703814,0.970717,0.00020215852,0.0015178266,0.0002678614,0.0000018917051,0.0002100328,0.02670347],"genre_scores_gemma":[0.2865633,0.00027078862,0.67194283,0.0017806602,0.0031316006,0.000024618821,0.000008799463,0.0001814025,0.036095988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598795,0.000043399326,0.00050303346,0.0016626398,0.0010235775,0.0007793873],"domain_scores_gemma":[0.99793804,0.0002946634,0.0002602277,0.0011365174,0.00020483462,0.00016571836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064223574,0.0005602191,0.0005430551,0.0007730827,0.0003601755,0.0006086956,0.0027465895,0.0003348336,0.000069126705],"category_scores_gemma":[0.000024469173,0.0005132244,0.00018007682,0.00042263692,0.00030556766,0.00073327683,0.00067457696,0.0013207409,0.00028212013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035838661,0.000008287123,0.0000032127687,0.000009436675,0.000007969638,0.00005704292,0.000744577,0.507426,0.000018025456,0.09527411,0.0000030090437,0.3964447],"study_design_scores_gemma":[0.00012136854,0.00011378442,0.000007071654,0.00058091665,0.0000050750123,0.000058455575,2.692716e-7,0.8471661,0.0008433845,0.11064707,0.03971901,0.00073746126],"about_ca_topic_score_codex":0.00007531922,"about_ca_topic_score_gemma":0.000012366327,"teacher_disagreement_score":0.39570725,"about_ca_system_score_codex":0.00036763793,"about_ca_system_score_gemma":0.0004005795,"threshold_uncertainty_score":0.99973196},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024286867,0.00041143212,0.9920291,0.00010180462,0.0034116434,0.0006506868,0.000017628552,0.00009607765,0.00085294107],"genre_scores_gemma":[0.96089053,0.0000320719,0.038613394,0.00012397312,0.00022516017,0.000022122633,0.000011943775,0.000020885129,0.000059934635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996347,0.00006852527,0.0010271237,0.0010741176,0.0009518533,0.00053134566],"domain_scores_gemma":[0.99739337,0.00036506026,0.00050211,0.0013239227,0.00031084527,0.000104669096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015849413,0.00036945392,0.00061002705,0.000698257,0.00015084892,0.00017903019,0.0019331119,0.00032189407,0.000004359855],"category_scores_gemma":[0.00018689838,0.0003241196,0.000100715704,0.001008198,0.00036052105,0.0006441507,0.00055809633,0.0005422568,0.000008476255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019382926,0.00025895896,0.18248583,0.0011944368,0.000059875714,0.00010132042,0.0030390935,0.6550862,0.00030455342,0.01658304,0.00007866936,0.14078861],"study_design_scores_gemma":[0.000579226,0.00020171242,0.005449349,0.0025695818,0.000010047159,0.000052061238,9.563457e-7,0.97603315,0.00046450115,0.01330387,0.00063620874,0.0006993316],"about_ca_topic_score_codex":0.00010355481,"about_ca_topic_score_gemma":0.0000550319,"teacher_disagreement_score":0.9584618,"about_ca_system_score_codex":0.0004691865,"about_ca_system_score_gemma":0.00043250815,"threshold_uncertainty_score":0.9999211},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21297152,0.000023971425,0.78511745,0.0015822602,0.00018361313,0.000051373358,4.822623e-7,0.000037083377,0.000032237782],"genre_scores_gemma":[0.9453189,0.0000025564152,0.053724434,0.00089351664,0.000056405275,7.1705506e-7,3.9276608e-7,0.000002344179,7.5681663e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991871,0.000013393758,0.00017986723,0.00017510416,0.00027277277,0.00017177923],"domain_scores_gemma":[0.99958616,0.00002423325,0.000024584797,0.00026308492,0.000033913726,0.00006799968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003061398,0.00007507881,0.0001148301,0.00010319057,0.00003922241,0.000036576133,0.00039710707,0.000017806095,0.0000050954745],"category_scores_gemma":[0.00017159544,0.000052136937,0.00003696211,0.0012818218,0.00013341043,0.000058165962,0.000032550128,0.00010949386,0.0000017093523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.6470643e-7,0.000021307007,0.00023680771,0.000011494625,0.0000033704443,0.0000066533185,0.00012847429,0.23092563,0.18927148,0.00014084882,0.000022638395,0.57923084],"study_design_scores_gemma":[0.00009495138,0.000040607458,0.0062375898,0.00006876125,0.0000042426345,0.000010420081,2.3120197e-7,0.94298404,0.048440907,0.0020026742,0.00002986145,0.00008571528],"about_ca_topic_score_codex":0.000014220812,"about_ca_topic_score_gemma":0.000014727445,"teacher_disagreement_score":0.73234737,"about_ca_system_score_codex":0.000028365479,"about_ca_system_score_gemma":0.00003223905,"threshold_uncertainty_score":0.21260826},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008833553,0.00052063464,0.99503505,0.0003160502,0.00065818924,0.001900204,0.0000044277426,0.00016860553,0.0013085172],"genre_scores_gemma":[0.121492654,0.000032156353,0.87609637,0.0010466276,0.0006037905,0.00012295843,0.0000058343708,0.000062869185,0.00053673546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963325,0.00004064447,0.0004958399,0.001613497,0.0008709042,0.0006465727],"domain_scores_gemma":[0.99767184,0.000253665,0.0003587461,0.0013234952,0.00022096021,0.00017128905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064104167,0.00050984626,0.00045867835,0.0006471819,0.0003133215,0.00059053116,0.0021779253,0.00028240637,0.000017678016],"category_scores_gemma":[0.000053381285,0.00049876043,0.000080467464,0.00055563176,0.0008044611,0.00093425624,0.001861317,0.000641839,0.000016241012],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055689666,0.00006546467,0.00053125294,0.00021007755,0.000012596582,0.00017912341,0.0015242336,0.02121325,0.00021794187,0.10269751,0.000018057093,0.87332493],"study_design_scores_gemma":[0.0002502548,0.00006748999,0.0003749071,0.00035429225,0.0000067323676,0.000092375274,5.5028906e-8,0.54707783,0.000723698,0.4492942,0.0011065566,0.00065155595],"about_ca_topic_score_codex":0.000027424803,"about_ca_topic_score_gemma":0.000073275354,"teacher_disagreement_score":0.8726734,"about_ca_system_score_codex":0.0003062069,"about_ca_system_score_gemma":0.0002954126,"threshold_uncertainty_score":0.9997464},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013770061,0.00016508077,0.9960301,0.00044919865,0.0008246527,0.00077288516,0.000016690996,0.0003510953,0.0012526284],"genre_scores_gemma":[0.1096106,0.0001901647,0.8883453,0.0010699676,0.0004194376,0.00006389389,0.00004293402,0.00006653556,0.0001911835],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961797,0.00005457095,0.00079221744,0.0014516555,0.0008261295,0.00069570175],"domain_scores_gemma":[0.9964108,0.0012023152,0.0006129694,0.0009110157,0.0006722693,0.00019064883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012266297,0.0005490035,0.0007352893,0.0012386575,0.00024274795,0.0003184998,0.0020887812,0.00064828177,0.000051633906],"category_scores_gemma":[0.00036077652,0.00055419037,0.00027291445,0.00071047555,0.0008245796,0.0007316681,0.00062192616,0.0011863722,0.000039231352],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018222303,0.000038837225,0.000011399662,0.00008146557,0.00001321051,0.000046851914,0.00031259816,0.00046244703,0.00016832472,0.007276599,0.000012208819,0.99155784],"study_design_scores_gemma":[0.00044825271,0.00081279257,0.0000325645,0.002323626,0.000025396776,0.0001680316,8.9397014e-7,0.11676251,0.028103892,0.8482417,0.0020508796,0.0010294733],"about_ca_topic_score_codex":0.000016852966,"about_ca_topic_score_gemma":0.000016201406,"teacher_disagreement_score":0.99052835,"about_ca_system_score_codex":0.00027082098,"about_ca_system_score_gemma":0.00035654736,"threshold_uncertainty_score":0.99969095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008357504,0.0018581754,0.9909447,0.00014396604,0.003868443,0.00047996527,0.0000035815312,0.0015762992,0.0011165361],"genre_scores_gemma":[0.004926686,0.000118631346,0.99378824,0.0002917142,0.0005633799,0.000013109994,0.0000018293457,0.00005977746,0.00023662455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99538267,0.00003960261,0.00063388416,0.0018844932,0.0010419138,0.0010174476],"domain_scores_gemma":[0.99580145,0.0016095282,0.0002977067,0.0018506908,0.00026989222,0.00017074043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010275174,0.00085600826,0.00089238334,0.00065987714,0.00017661913,0.000525227,0.0040811235,0.0004843565,0.0000030332073],"category_scores_gemma":[0.00034601637,0.00082862505,0.00016003766,0.00085728016,0.00025247043,0.0011965731,0.0011944671,0.0012930362,0.000056817567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022785475,0.000012187202,0.0000012203253,0.00004634091,0.000016286334,0.00011520579,0.0005243399,0.8218159,0.00006144059,0.038485426,0.000009816477,0.13890956],"study_design_scores_gemma":[0.00029104677,0.00028992828,0.000054076503,0.00085520145,0.000014953804,0.00024190922,3.2065893e-7,0.8247815,0.0011345048,0.16755517,0.0032517586,0.0015296377],"about_ca_topic_score_codex":0.000011242007,"about_ca_topic_score_gemma":0.0000025626268,"teacher_disagreement_score":0.13737993,"about_ca_system_score_codex":0.0007371854,"about_ca_system_score_gemma":0.00040471906,"threshold_uncertainty_score":0.9994165},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019232197,0.00026044348,0.9939256,0.00012032763,0.0043518334,0.0007041451,0.00009102561,0.00024492302,0.00028251924],"genre_scores_gemma":[0.006314123,0.00000693498,0.9903045,0.00059721735,0.0025158837,0.000014370906,0.00008553621,0.000045248198,0.00011614548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951153,0.000031182873,0.0007634415,0.002192912,0.0009936248,0.0009035604],"domain_scores_gemma":[0.9960899,0.00047622577,0.00057290436,0.0020149073,0.0005033086,0.00034276856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013210911,0.0007029195,0.00066009414,0.0005476691,0.00063194963,0.0010284303,0.0046216184,0.00047238587,0.0000069758466],"category_scores_gemma":[0.00007791687,0.00060924655,0.00016251946,0.00053557346,0.00064409786,0.0017865441,0.0013766928,0.0009696995,0.0000050356357],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007403603,0.00001879997,0.000013521305,0.000022556256,0.000005604767,0.000028271721,0.00014400811,0.0016402216,0.00013100723,0.005117824,0.000014594988,0.9928562],"study_design_scores_gemma":[0.00038459394,0.00034417727,0.00007543499,0.00015739055,0.000006329162,0.00003360217,1.8795686e-7,0.89747596,0.0007494035,0.09881674,0.0012527277,0.0007034274],"about_ca_topic_score_codex":0.000062495594,"about_ca_topic_score_gemma":0.00025235594,"teacher_disagreement_score":0.99215275,"about_ca_system_score_codex":0.0003083659,"about_ca_system_score_gemma":0.00055654044,"threshold_uncertainty_score":0.9996359},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004894896,0.0027559137,0.987542,0.00022325476,0.0008388242,0.00020928684,0.00003524177,0.0000059541912,0.003494676],"genre_scores_gemma":[0.9194969,0.0008111562,0.07688244,0.0011051724,0.0010893008,0.000003937597,0.00019913411,0.00002365891,0.00038831044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998722,0.000009650406,0.00025038872,0.0006443625,0.0001424112,0.00023117491],"domain_scores_gemma":[0.99915653,0.000045414334,0.00010086416,0.0005994647,0.000036059602,0.000061661354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073011784,0.00019700298,0.00017670686,0.00017787145,0.00010642845,0.00016963642,0.0009748079,0.00029963622,0.0000031919956],"category_scores_gemma":[0.00007925564,0.00016104113,0.00002136743,0.00011178715,0.00092870137,0.000032740925,0.0012297457,0.00039830367,0.0000026571242],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025775842,0.000040475094,0.0004094151,0.000062308565,0.000013231347,0.0000055387,0.00047230878,0.0024895163,0.013755981,0.004002413,0.0002088739,0.97851413],"study_design_scores_gemma":[0.0013139392,0.00094560534,0.0015213768,0.0010988632,0.000032675605,0.00011798428,0.000005698567,0.8096928,0.013168117,0.118900225,0.050801594,0.0024011387],"about_ca_topic_score_codex":0.000012669293,"about_ca_topic_score_gemma":0.0015417262,"teacher_disagreement_score":0.976113,"about_ca_system_score_codex":0.000015768079,"about_ca_system_score_gemma":0.00046442085,"threshold_uncertainty_score":0.6567067},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008235554,0.00062300044,0.9900164,0.0009368243,0.0018948033,0.00031880572,0.000030553594,0.00025606717,0.0059153144],"genre_scores_gemma":[0.025678502,0.000637023,0.96386576,0.004517302,0.0023419438,0.000012575106,0.00026437265,0.0000987896,0.0025837324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99509305,0.000026619111,0.0004671064,0.0023682273,0.0013452584,0.0006997265],"domain_scores_gemma":[0.9957481,0.00016741428,0.00034622286,0.0034590203,0.00013198599,0.00014727928],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.000671503,0.00058459834,0.00048156764,0.0007561898,0.0004632638,0.0012733454,0.009929093,0.00019439199,0.000015530302],"category_scores_gemma":[0.00008339608,0.0005146435,0.00006650336,0.0005644356,0.0008156128,0.0023528868,0.006079261,0.00073727383,0.00010945461],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043193077,0.000022921522,0.0000068405043,0.00003093036,0.0000065968293,0.0002171927,0.00024065556,0.001274544,0.000004711356,0.002413405,0.00033231213,0.99544555],"study_design_scores_gemma":[0.00031607604,0.00020927805,0.00008077918,0.0007647363,0.000009889971,0.000073323055,1.2017242e-7,0.92013675,0.00040243097,0.017593645,0.059398636,0.0010143224],"about_ca_topic_score_codex":0.00005539922,"about_ca_topic_score_gemma":0.00011865762,"teacher_disagreement_score":0.99443126,"about_ca_system_score_codex":0.00013873188,"about_ca_system_score_gemma":0.00048786242,"threshold_uncertainty_score":0.9997634},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013320965,0.00012102748,0.98608136,0.00117535,0.0017911387,0.00377106,0.0000043328046,0.00023935665,0.0068030786],"genre_scores_gemma":[0.05358667,0.000010332744,0.93319505,0.008314355,0.0018067413,0.0007040769,0.000008484536,0.00010355874,0.0022707195],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99512786,0.000052062092,0.00062846317,0.0019593611,0.0012610293,0.00097124523],"domain_scores_gemma":[0.99666774,0.000686,0.000275649,0.0018126051,0.00024242689,0.00031557723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011264756,0.00067696214,0.000735094,0.0008081037,0.00031923616,0.0009766881,0.0050675035,0.00045933953,0.000028201497],"category_scores_gemma":[0.00007184594,0.0006097535,0.000171969,0.0009981386,0.0002449172,0.00054843235,0.0019135803,0.0009566803,0.00012841652],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015065501,0.00003594137,0.0000110273095,0.00003526871,0.000010553609,0.00010432854,0.00023698578,0.15426394,0.00036897458,0.054275792,0.00070898724,0.78993315],"study_design_scores_gemma":[0.0014168688,0.00050125574,0.00021650743,0.0010683007,0.0000114484055,0.00007631405,4.4745203e-8,0.46089333,0.0035422603,0.490228,0.040084787,0.0019608776],"about_ca_topic_score_codex":0.0000924119,"about_ca_topic_score_gemma":0.0001646642,"teacher_disagreement_score":0.7879723,"about_ca_system_score_codex":0.00027245336,"about_ca_system_score_gemma":0.00048117325,"threshold_uncertainty_score":0.9996354},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046560053,0.000940144,0.99403834,0.00046052787,0.0029236265,0.00025642524,0.0000032758721,0.00022646184,0.0011046287],"genre_scores_gemma":[0.13787855,0.00013592312,0.858577,0.0020368716,0.0010462959,0.0000041541434,0.00001079079,0.00004893514,0.00026147024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954269,0.00005006543,0.00065168674,0.001870662,0.000982335,0.0010183406],"domain_scores_gemma":[0.9973447,0.00024950787,0.00035344792,0.0014422655,0.00035565035,0.00025448477],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009069807,0.0006905923,0.0006360424,0.0007613429,0.00040735395,0.0009246837,0.0035443932,0.00050249626,0.000017803286],"category_scores_gemma":[0.000059305778,0.0006529342,0.00013361599,0.0010227875,0.00039985578,0.0006325339,0.0011201317,0.0014197796,0.000027563803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022843699,0.000015695245,0.0000044802564,0.000009363764,0.000005294038,0.00005050317,0.000120145785,0.3024368,0.000023197746,0.025017552,0.000017283448,0.6722974],"study_design_scores_gemma":[0.00012895765,0.00012795167,0.000017917453,0.0005654281,0.0000082468805,0.000061030856,3.903587e-8,0.7867147,0.000087682354,0.21124953,0.00039689895,0.00064161594],"about_ca_topic_score_codex":0.000036341906,"about_ca_topic_score_gemma":0.000030042343,"teacher_disagreement_score":0.6716558,"about_ca_system_score_codex":0.00041770478,"about_ca_system_score_gemma":0.00066637626,"threshold_uncertainty_score":0.9995922},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000042589563,0.0003127328,0.9421919,0.00026535284,0.001561344,0.00022520636,0.0000025358077,0.0007234658,0.054713175],"genre_scores_gemma":[0.023190765,0.00007073936,0.968286,0.006804465,0.0005888804,0.000008891484,0.000006835443,0.000054166478,0.0009892813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995029,0.000054444827,0.00070808636,0.0019709899,0.0012846057,0.00095290976],"domain_scores_gemma":[0.9965356,0.00066500297,0.00039470984,0.0017638679,0.00039267837,0.00024812194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016303213,0.0006979399,0.0005828878,0.0015810978,0.00040696177,0.00065589097,0.0044587804,0.00048452013,0.000021471042],"category_scores_gemma":[0.000081043036,0.0006500224,0.0001393264,0.0014974496,0.0004674584,0.00041322966,0.0011209387,0.00093959866,0.000049647686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009206688,0.000073389456,0.0000054744874,0.000021996888,0.0000096412,0.00010394464,0.00020871838,0.24199487,0.000030732885,0.32140404,0.0001191564,0.43601882],"study_design_scores_gemma":[0.0001980148,0.00028486786,0.0000060929337,0.00043178425,0.000005146826,0.000056165332,3.799784e-8,0.8513751,0.0018062571,0.13864933,0.0063977367,0.00078946166],"about_ca_topic_score_codex":0.000036478552,"about_ca_topic_score_gemma":0.000018572986,"teacher_disagreement_score":0.60938025,"about_ca_system_score_codex":0.0003668754,"about_ca_system_score_gemma":0.0007508827,"threshold_uncertainty_score":0.9995951},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030112073,0.00011941902,0.99189353,0.0006012737,0.0013301087,0.0008356984,0.000007156915,0.00030088186,0.0019007054],"genre_scores_gemma":[0.21058139,0.0001482632,0.78656256,0.0006775249,0.00074465945,0.00007365316,0.000007927793,0.000083657505,0.0011203408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956165,0.000039102342,0.0009874273,0.0015969083,0.0008541542,0.00090592325],"domain_scores_gemma":[0.99661267,0.0013846563,0.0005047904,0.0011346745,0.00021235259,0.00015085806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015453704,0.00055280706,0.0006258374,0.0012994991,0.00020982484,0.00067453814,0.0026920172,0.00031563872,0.000054476113],"category_scores_gemma":[0.00023263534,0.00054561713,0.00016010633,0.00061591354,0.00051336235,0.0012257639,0.00061480235,0.0006546072,0.00017021067],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048523298,0.000028074872,0.000029776264,0.00003658064,0.0000054133498,0.000035572335,0.0014022766,0.059708044,0.000687028,0.0037043435,0.00002594088,0.9343321],"study_design_scores_gemma":[0.00009729772,0.00012305683,0.00021446502,0.0004908831,0.0000044428634,0.00002680048,4.266042e-7,0.82511955,0.005336465,0.16721979,0.0008055834,0.00056121615],"about_ca_topic_score_codex":0.00009567576,"about_ca_topic_score_gemma":0.0003553211,"teacher_disagreement_score":0.9337709,"about_ca_system_score_codex":0.00075455295,"about_ca_system_score_gemma":0.0005388001,"threshold_uncertainty_score":0.99969953},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004759465,0.000728264,0.99692327,0.0002322787,0.00062455,0.0005894475,0.00006147719,0.00021733773,0.00057580427],"genre_scores_gemma":[0.0077005145,0.00007991669,0.99093074,0.0007963446,0.00036186585,0.000009683497,0.00004250156,0.000019768593,0.000058685844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996077,0.000020722591,0.00045802153,0.0021436156,0.00062827923,0.0006723371],"domain_scores_gemma":[0.99653554,0.0006997858,0.00023088786,0.0021616637,0.00019100423,0.0001810912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020441378,0.00043318098,0.00045066248,0.000536067,0.00037370302,0.00053940533,0.0049130213,0.00038963972,0.0000048227284],"category_scores_gemma":[0.00016174375,0.0003381685,0.000049454862,0.00038166216,0.0008287043,0.0004410655,0.006247173,0.0005703273,0.0000035438734],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064157994,0.000020555353,0.000027509031,0.000028674434,0.00000402211,0.000032759268,0.00007730899,0.0014016632,0.0002989066,0.012337503,0.000033402102,0.9857313],"study_design_scores_gemma":[0.00013716661,0.00017274225,0.000031871085,0.00037712711,0.0000037558168,0.0000795932,8.8547445e-8,0.95361483,0.0010736089,0.035835635,0.008181765,0.0004918186],"about_ca_topic_score_codex":0.000023321189,"about_ca_topic_score_gemma":0.000011538312,"teacher_disagreement_score":0.98523945,"about_ca_system_score_codex":0.00013727706,"about_ca_system_score_gemma":0.00028324517,"threshold_uncertainty_score":0.999907},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034041456,0.00027916036,0.99396485,0.00076622854,0.00020240946,0.0007591204,0.00002847066,0.00014233105,0.00045328942],"genre_scores_gemma":[0.7463068,0.0000478809,0.25266954,0.00056481815,0.00021088906,0.00004869954,0.000011210056,0.00003390432,0.000106289895],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974911,0.00003090132,0.00040364233,0.00086916686,0.0006687532,0.00053641933],"domain_scores_gemma":[0.99808526,0.00037931104,0.00044942007,0.0007216024,0.000282903,0.00008151254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006401602,0.00049158686,0.00047113406,0.00046413392,0.000506648,0.00025747032,0.0015516764,0.0002226527,0.000001913327],"category_scores_gemma":[0.000018659892,0.0003126477,0.00012825808,0.0002673887,0.0017590967,0.0008197609,0.0004940926,0.0004829138,3.8017697e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012932337,0.00004043046,0.00030446294,0.0002112176,0.00008572279,0.000015764133,0.00997765,0.0049347878,0.0003270593,0.045656923,0.000024150966,0.9382925],"study_design_scores_gemma":[0.0021159651,0.0021509568,0.0034205797,0.004374881,0.0001745194,0.00027370927,0.00002671235,0.11218825,0.07151378,0.7825243,0.017691959,0.0035443795],"about_ca_topic_score_codex":0.000010490713,"about_ca_topic_score_gemma":0.0002347118,"teacher_disagreement_score":0.9347481,"about_ca_system_score_codex":0.00013294189,"about_ca_system_score_gemma":0.0001204347,"threshold_uncertainty_score":0.9999326},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000092363895,0.00082263886,0.99413157,0.0004675976,0.0020682178,0.0014890525,0.000020948593,0.00014412464,0.0007634953],"genre_scores_gemma":[0.7275353,0.000040072762,0.26989076,0.0007048727,0.0010036081,0.00029948715,0.000040533672,0.000074523305,0.00041082906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960718,0.000063938845,0.0009439993,0.0013880332,0.0008408561,0.00069137284],"domain_scores_gemma":[0.99463016,0.0018703173,0.0008166038,0.0018729101,0.00071286474,0.00009715719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008895506,0.0005293583,0.00059732166,0.00036376313,0.00040968167,0.00019029345,0.0035982928,0.00034054002,0.000008236775],"category_scores_gemma":[0.00004467058,0.00042784802,0.00028531114,0.00096665154,0.000732074,0.00023497587,0.0005196189,0.00048570966,0.000004408259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001421463,0.000029850364,0.0000219949,0.00004487686,0.000013684395,0.0000016799243,0.00021069984,0.74933684,0.00003485403,0.018187888,0.00015132793,0.23195212],"study_design_scores_gemma":[0.00025262433,0.00009663201,0.000030435129,0.00029139136,0.000025694166,0.0000072522416,5.930105e-7,0.9850771,0.0004020151,0.010147746,0.0032265997,0.0004419488],"about_ca_topic_score_codex":0.0000487874,"about_ca_topic_score_gemma":0.00036232555,"teacher_disagreement_score":0.7274429,"about_ca_system_score_codex":0.00023811612,"about_ca_system_score_gemma":0.00044664307,"threshold_uncertainty_score":0.9998173},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000455765,0.00053743756,0.99602777,0.00010507375,0.0012091136,0.0005442217,0.00001928642,0.000018163426,0.0010831977],"genre_scores_gemma":[0.09113125,0.00017669224,0.90446496,0.0009811275,0.001793435,0.0000765328,0.00006780701,0.00009873264,0.0012094529],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980711,0.000009902155,0.00025672995,0.0009228564,0.00029986378,0.00043956953],"domain_scores_gemma":[0.9990976,0.000046238907,0.00014052569,0.00050911977,0.00011641968,0.00009008658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044442053,0.0003360918,0.00026397692,0.00015406737,0.00016822663,0.000101726335,0.0006494924,0.00033617008,0.000026574255],"category_scores_gemma":[0.000068454894,0.00031745402,0.00013474774,0.000060159156,0.00016208597,0.0000072599564,0.0003259016,0.00017444228,0.000015533175],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042033196,0.00002226094,0.00001120228,0.00010418243,0.000031797405,0.000021959368,0.000087725784,0.008823015,0.15699536,0.0010980148,0.000020701296,0.83274174],"study_design_scores_gemma":[0.0007212253,0.00094394956,0.000016920298,0.0007693662,0.000024977166,0.000056470617,2.8568138e-7,0.008270952,0.87904096,0.09834136,0.010678263,0.0011352925],"about_ca_topic_score_codex":0.000005429636,"about_ca_topic_score_gemma":0.0000076853175,"teacher_disagreement_score":0.83160645,"about_ca_system_score_codex":0.00011306885,"about_ca_system_score_gemma":0.00027645665,"threshold_uncertainty_score":0.99992776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028591488,0.000028660332,0.9902146,0.004301666,0.0033175282,0.0009106827,0.000004124958,0.00018594904,0.0010081873],"genre_scores_gemma":[0.044411413,0.00003105222,0.94146335,0.010916672,0.001103063,0.000050489343,0.000013056168,0.00005561521,0.0019553069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962995,0.000053260526,0.0006368484,0.0013336133,0.0008172829,0.0008594907],"domain_scores_gemma":[0.9967152,0.001197742,0.00036987432,0.0012069923,0.00027932954,0.00023089573],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010960947,0.00054154894,0.000448084,0.0005525671,0.00065382395,0.0013407676,0.0026893574,0.00038414833,0.00012960308],"category_scores_gemma":[0.0004319469,0.00032991025,0.000119694596,0.0015017515,0.0004892833,0.00076851354,0.0015881186,0.0011567087,0.00008377873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004635543,0.000027936178,0.000030610223,0.000022498634,0.000018764238,0.000054186523,0.0016183336,0.31316632,0.00021108745,0.0019350856,0.00020564014,0.6826632],"study_design_scores_gemma":[0.0003132735,0.00042352136,0.00009147781,0.0006295628,0.000015534013,0.00013220999,5.802448e-7,0.9721677,0.00038969665,0.01174038,0.013394578,0.0007015116],"about_ca_topic_score_codex":0.000025453064,"about_ca_topic_score_gemma":0.0020916767,"teacher_disagreement_score":0.68196166,"about_ca_system_score_codex":0.00028549656,"about_ca_system_score_gemma":0.0008213216,"threshold_uncertainty_score":0.9999153},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017775851,0.00062982104,0.9857022,0.0030700054,0.0009181609,0.0003336186,6.947652e-7,0.00030819656,0.007259722],"genre_scores_gemma":[0.82060397,0.00008428772,0.17045145,0.0051983795,0.0018481738,0.000015833204,0.0000112260495,0.00008086376,0.001705811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960207,0.00012576378,0.0003580764,0.0013458367,0.0012207952,0.00092883094],"domain_scores_gemma":[0.9977342,0.00051824155,0.00026007116,0.0011812623,0.00013714527,0.00016909072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094013556,0.0005855337,0.00047012442,0.00029189116,0.001116452,0.0006260811,0.0035775118,0.0001966385,0.000021499502],"category_scores_gemma":[0.00004101785,0.00038211336,0.00012724004,0.00073050667,0.0008604413,0.00043673307,0.0014332205,0.0016971314,0.00005438507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012376741,0.000014172458,0.0006049607,0.000012126554,0.0000152078155,0.00014911754,0.0014732238,0.5878205,0.000012364679,0.0017762808,0.0002914849,0.40781823],"study_design_scores_gemma":[0.0004668971,0.00051132625,0.00089082646,0.00021553665,0.000011029292,0.00043680394,5.5597235e-7,0.9752465,0.000044815853,0.003993109,0.017362967,0.0008196179],"about_ca_topic_score_codex":0.00006432848,"about_ca_topic_score_gemma":0.00012261604,"teacher_disagreement_score":0.8188264,"about_ca_system_score_codex":0.00014363696,"about_ca_system_score_gemma":0.00032034385,"threshold_uncertainty_score":0.9998631},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027313065,0.00014838985,0.9951688,0.00025384812,0.00084218924,0.00044820216,0.0000010239272,0.0003747471,0.000031484837],"genre_scores_gemma":[0.2947737,0.0000038832527,0.7037296,0.0013695466,0.000070199516,0.000046484765,0.0000011156781,0.000005134929,3.1423272e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815595,0.00006934835,0.0002959796,0.00060500996,0.00044858886,0.00042513624],"domain_scores_gemma":[0.9987838,0.00029348148,0.00010479143,0.00057177804,0.00012246081,0.00012367926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011147172,0.00015440412,0.00020963205,0.0002931183,0.00016785078,0.00020668376,0.0014968327,0.0000615629,0.000019980242],"category_scores_gemma":[0.000099404184,0.0001350005,0.000060814782,0.0011066018,0.00023449624,0.0009248711,0.00034707584,0.00013716237,0.00001134312],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014691078,0.000033458113,0.0005673934,0.000035560555,0.0000031477728,0.000008256991,0.0029625208,0.00027849208,0.0019313322,0.00040445194,0.000060090857,0.99371386],"study_design_scores_gemma":[0.00018742736,0.00018654074,0.004042401,0.00016552728,0.0000037474215,0.000011309638,0.0000011852285,0.77417994,0.19250794,0.028445339,0.000022621529,0.00024602265],"about_ca_topic_score_codex":0.000011943354,"about_ca_topic_score_gemma":8.0179956e-7,"teacher_disagreement_score":0.9934678,"about_ca_system_score_codex":0.00009522679,"about_ca_system_score_gemma":0.00013358773,"threshold_uncertainty_score":0.55051607},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002645043,0.000064528605,0.9912234,0.00035966892,0.0008575149,0.0001316702,0.000013266925,0.00006788741,0.007255598],"genre_scores_gemma":[0.12478666,0.00029127317,0.8729786,0.00078286964,0.00033512528,0.0000044653907,0.00004608914,0.00003294214,0.0007419677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794805,0.00002483324,0.00045951485,0.0007510795,0.00059383793,0.0002226879],"domain_scores_gemma":[0.9981223,0.00019629527,0.00045394528,0.00082668907,0.00032676366,0.000074027266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029621433,0.00024491732,0.00031364482,0.0007386137,0.00009072484,0.00023129584,0.0015859517,0.0001639926,0.000051090294],"category_scores_gemma":[0.00007419033,0.00023196892,0.00007615368,0.0004439133,0.0006374365,0.00068671897,0.0004701813,0.0003172799,0.00004896034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019974882,0.000030817082,0.000055226516,0.00002804795,0.000010336488,0.000006318285,0.00044654228,0.0013095923,0.00012047883,0.3496028,0.000046779947,0.64834106],"study_design_scores_gemma":[0.00013458365,0.0000704208,0.00013072768,0.00025613722,0.000007309713,0.000031157637,4.3053714e-7,0.8837775,0.0012938085,0.11179509,0.0022065055,0.0002963158],"about_ca_topic_score_codex":0.0000055022697,"about_ca_topic_score_gemma":0.000005766692,"teacher_disagreement_score":0.8824679,"about_ca_system_score_codex":0.00014880035,"about_ca_system_score_gemma":0.00017119845,"threshold_uncertainty_score":0.9459418},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011301879,0.00008305136,0.9963907,0.0001536342,0.000989978,0.0010427576,0.000010949222,0.00007722354,0.00012151996],"genre_scores_gemma":[0.5717501,0.000001236901,0.4277267,0.0001734736,0.00018585827,0.000024010951,0.00006741553,0.000017526165,0.00005371184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961795,0.00008060834,0.00082965434,0.0013420042,0.0009696266,0.0005985653],"domain_scores_gemma":[0.99797094,0.0001238419,0.00043942654,0.00088694255,0.00040883446,0.00017003874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001235125,0.00041518544,0.0005511792,0.0006174155,0.00013689157,0.00024909992,0.001820522,0.00026769663,0.0000024165556],"category_scores_gemma":[0.00007122324,0.00038791198,0.000101146135,0.001113614,0.00016503733,0.0004952912,0.00059508276,0.00040067662,0.0000063550447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009429114,0.00030720956,0.0018577491,0.000075323944,0.000008884876,0.000022132652,0.0009432236,0.8093592,0.00019705191,0.0047669373,0.00013074452,0.18232211],"study_design_scores_gemma":[0.00039720585,0.0001304148,0.010545739,0.00043490028,0.0000043121063,0.000013220331,4.7088125e-7,0.9857019,0.0001347404,0.0016066888,0.00061708107,0.00041332308],"about_ca_topic_score_codex":0.00022384182,"about_ca_topic_score_gemma":0.00020812094,"teacher_disagreement_score":0.5706199,"about_ca_system_score_codex":0.0004546193,"about_ca_system_score_gemma":0.00024862052,"threshold_uncertainty_score":0.9998573},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004112327,0.00016712352,0.99489635,0.00060654344,0.00052537717,0.00032682918,0.0000070011615,0.00024090095,0.003188731],"genre_scores_gemma":[0.033955567,0.000036100733,0.96363384,0.0018476452,0.00017706769,0.0000076161646,0.0000044459252,0.00002937045,0.00030833503],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99642676,0.000051441217,0.00067754585,0.0011372698,0.0012117766,0.00049519964],"domain_scores_gemma":[0.9973017,0.0009311307,0.00033059678,0.0010982762,0.00016188395,0.00017641483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083358155,0.00041826602,0.0005272285,0.00083975185,0.000119289434,0.00026192656,0.0032162997,0.00023938663,0.00013580205],"category_scores_gemma":[0.00016073146,0.0003836045,0.0001260117,0.0004606599,0.0009733181,0.00068854605,0.0008834015,0.00071074255,0.000044268305],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035002627,0.00002758448,0.000005524226,0.000046422167,0.0000068436757,0.000085483174,0.0006131323,0.004155665,0.0021131341,0.002573147,0.00006441263,0.9903051],"study_design_scores_gemma":[0.00067507994,0.00044240564,0.00022747001,0.0016442828,0.000016067177,0.00019196456,3.8951924e-7,0.27438948,0.10809278,0.6125994,0.00035137686,0.0013693299],"about_ca_topic_score_codex":0.000047177782,"about_ca_topic_score_gemma":0.000010962668,"teacher_disagreement_score":0.9889358,"about_ca_system_score_codex":0.00015200608,"about_ca_system_score_gemma":0.0003870087,"threshold_uncertainty_score":0.9998616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057108162,0.0007187335,0.992874,0.0011634193,0.0010948686,0.00014639302,0.000006407533,0.00022807634,0.0037109808],"genre_scores_gemma":[0.1469332,0.00010907266,0.84937245,0.0020838715,0.0007517601,0.000008253859,0.00002565812,0.000048165643,0.00066757685],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99551624,0.000028956454,0.00057835394,0.0019831823,0.0011212158,0.0007720621],"domain_scores_gemma":[0.9968849,0.00028868933,0.00030713124,0.002083203,0.00020875329,0.00022733961],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00095207634,0.0005927525,0.00065802055,0.0012749952,0.00043439385,0.001076506,0.005264784,0.00031828057,0.000052180665],"category_scores_gemma":[0.000115865274,0.00054145686,0.00020094987,0.0011772887,0.0006891034,0.000989529,0.002153697,0.00081997545,0.00013043215],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020918487,0.000031186682,0.000056414196,0.000059574795,0.000034761735,0.0001783467,0.0013683911,0.052021913,0.00026205543,0.05963326,0.0000625794,0.8862894],"study_design_scores_gemma":[0.00040382362,0.0001731282,0.000067736815,0.0013854423,0.00003253785,0.000083672625,5.869454e-7,0.44953233,0.0018204219,0.53710276,0.007858013,0.0015395329],"about_ca_topic_score_codex":0.00021167072,"about_ca_topic_score_gemma":0.00016321131,"teacher_disagreement_score":0.8847499,"about_ca_system_score_codex":0.0004233959,"about_ca_system_score_gemma":0.000983914,"threshold_uncertainty_score":0.9999605},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014776454,0.00015560878,0.9977101,0.0003016632,0.000662832,0.0006664109,0.00007743268,0.00021535996,0.00019582086],"genre_scores_gemma":[0.10960172,0.00015965593,0.8859023,0.001597538,0.0009092789,0.000058720787,0.0014781171,0.00009662771,0.0001960668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957808,0.00005321319,0.0009102392,0.001245624,0.0015556804,0.0004544074],"domain_scores_gemma":[0.9974798,0.00037518804,0.0005726938,0.0010841271,0.00034511468,0.00014308176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015526838,0.0004203697,0.0005499994,0.0010573788,0.00021045092,0.0002561165,0.002538037,0.00039802378,0.000019445524],"category_scores_gemma":[0.00007515664,0.00041050024,0.00012931954,0.0007006574,0.0004092486,0.0004889573,0.0012310966,0.0002623329,0.000003944342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020669937,0.00021875964,0.00008937769,0.0002462196,0.000034901408,0.00003591687,0.00029958686,0.015178698,0.00019419617,0.8147913,0.004077873,0.1648125],"study_design_scores_gemma":[0.00029435914,0.00025107246,0.000020252925,0.00045656902,0.000008425099,0.000013637775,1.5125655e-8,0.8481958,0.003277131,0.14467573,0.0024110219,0.00039599065],"about_ca_topic_score_codex":0.00009387523,"about_ca_topic_score_gemma":0.000027697208,"teacher_disagreement_score":0.8330171,"about_ca_system_score_codex":0.00018385622,"about_ca_system_score_gemma":0.0005078597,"threshold_uncertainty_score":0.99983466},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005418678,0.00040548327,0.9922711,0.00003693542,0.00052417815,0.0009735388,0.000005042573,0.00014056145,0.00022445041],"genre_scores_gemma":[0.6732414,0.00007850486,0.32627356,0.00008939302,0.00024897975,0.000011923753,0.000010231038,0.000019097366,0.00002692012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710923,0.00006849428,0.00056321966,0.0013390569,0.00058220566,0.0003378178],"domain_scores_gemma":[0.99764955,0.00068930595,0.00039783324,0.0009110904,0.00026722092,0.00008501408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018366041,0.00035270717,0.0005652196,0.00090944156,0.00040689428,0.00021028113,0.0017150138,0.00023949148,0.0000043861305],"category_scores_gemma":[0.00009849436,0.00032690467,0.000043664193,0.0005932091,0.00030183527,0.0006481483,0.002173174,0.0006516626,6.5387457e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046105706,0.00006251662,0.00005190886,0.000038077556,0.000013171545,0.0000055956084,0.003002235,0.0008629627,0.0006766965,0.00020811101,0.000001686301,0.99503094],"study_design_scores_gemma":[0.0004576139,0.0019958406,0.000046830348,0.0002829102,0.000017350014,0.000033860197,0.0000058981254,0.9821686,0.0076926816,0.0052668005,0.001640312,0.00039129166],"about_ca_topic_score_codex":0.000073156945,"about_ca_topic_score_gemma":0.0010961574,"teacher_disagreement_score":0.99463964,"about_ca_system_score_codex":0.000094862175,"about_ca_system_score_gemma":0.0000909109,"threshold_uncertainty_score":0.9999183},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063448714,0.00032435884,0.9937643,0.00023173852,0.0006712174,0.0002981768,0.000005481844,0.0026933472,0.0013769171],"genre_scores_gemma":[0.39969924,0.000013176204,0.5998992,0.00019147487,0.0001260686,0.0000065068584,0.0000015587545,0.000017048795,0.000045767712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967266,0.000038891518,0.00062216586,0.0010715086,0.0010666436,0.00047424427],"domain_scores_gemma":[0.99701726,0.00054764276,0.00047006537,0.0012370519,0.000626312,0.00010163693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008101678,0.00044783717,0.00055882183,0.00075994205,0.00023757562,0.00020413582,0.0026555147,0.00029048356,0.0000040512436],"category_scores_gemma":[0.0009846757,0.00038854254,0.000092811206,0.0007641573,0.0007723352,0.00052389177,0.0012486598,0.0005845507,0.000011450273],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000319572,0.000040584746,0.00023659688,0.00013454467,0.000008560399,0.000048005546,0.0017871759,0.005086007,0.00021874375,0.0026190148,0.00024014269,0.9895774],"study_design_scores_gemma":[0.00015164759,0.0003030839,0.0008921886,0.0014318035,0.0000065573836,0.00019930143,3.5503977e-8,0.5662834,0.008762676,0.4212406,0.00007859079,0.0006501366],"about_ca_topic_score_codex":0.00023715585,"about_ca_topic_score_gemma":0.000011834306,"teacher_disagreement_score":0.9889273,"about_ca_system_score_codex":0.00022322152,"about_ca_system_score_gemma":0.00076731405,"threshold_uncertainty_score":0.99985665},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020411257,0.0001167374,0.99628586,0.00047395175,0.0006800412,0.000077832934,0.0000010222626,0.00023977611,0.00008363202],"genre_scores_gemma":[0.60627705,0.000003824915,0.387798,0.0057944697,0.00010820485,0.000007006683,0.000002677652,0.000005350318,0.000003373378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750197,0.000070822665,0.00037905472,0.00072703644,0.00089942536,0.00042168173],"domain_scores_gemma":[0.99855363,0.0005213439,0.00013953223,0.00036096844,0.0002507784,0.00017372439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092879834,0.0001840279,0.00016622701,0.00063224835,0.000227523,0.0002993043,0.0005929873,0.00008715772,0.000043875018],"category_scores_gemma":[0.00014390302,0.0001699579,0.000034939058,0.0021139584,0.00046325036,0.0009042834,0.0003935318,0.000119152995,0.0000033360125],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066693387,0.00013375214,0.00022461722,0.0000068214235,0.0000052992136,0.000024121598,0.0008203974,0.0016146385,0.0050307233,0.0074205003,0.00012210383,0.98459035],"study_design_scores_gemma":[0.0002550555,0.00023167806,0.0028998216,0.000050968305,0.0000026808514,0.00008294399,0.0000024898075,0.81916004,0.15759572,0.01940595,0.00008273734,0.00022991185],"about_ca_topic_score_codex":0.00006813795,"about_ca_topic_score_gemma":0.000058391055,"teacher_disagreement_score":0.98436046,"about_ca_system_score_codex":0.0001739854,"about_ca_system_score_gemma":0.00018145436,"threshold_uncertainty_score":0.6930682},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039298648,0.0006952849,0.9820147,0.0000584478,0.0010540824,0.00073485804,0.00002727638,0.00019463857,0.015181418],"genre_scores_gemma":[0.42154795,0.000009595361,0.577464,0.0005440409,0.00035470712,0.000009284491,0.000009010134,0.000030273013,0.000031186377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99476063,0.00009672586,0.0008424744,0.0019274323,0.0014966925,0.00087607035],"domain_scores_gemma":[0.99633086,0.00035575635,0.0005736321,0.002073127,0.0003902407,0.00027639413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019289475,0.0007104876,0.0010715164,0.00089663715,0.00023925815,0.00033519123,0.004723182,0.0005202216,0.0000043475034],"category_scores_gemma":[0.000031441876,0.0005681154,0.0002349615,0.000824251,0.00091911905,0.0007650074,0.0007759214,0.00085031096,0.000015481817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064100306,0.00015359311,0.0000380623,0.0002450836,0.00005092907,0.00040752723,0.0023669556,0.12121622,0.000038610287,0.17773543,0.000015502399,0.69766796],"study_design_scores_gemma":[0.0006049836,0.0005594111,0.000059666007,0.00030983324,0.000021139389,0.00019794273,0.0000014338852,0.9681105,0.00012347504,0.029105505,0.00024643276,0.00065968104],"about_ca_topic_score_codex":0.00009545303,"about_ca_topic_score_gemma":0.000029038743,"teacher_disagreement_score":0.84689426,"about_ca_system_score_codex":0.00029908787,"about_ca_system_score_gemma":0.0004355392,"threshold_uncertainty_score":0.999677},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051320955,0.00018740947,0.98977,0.002228234,0.0035976993,0.0002929222,0.0000031131544,0.0003762804,0.0030311444],"genre_scores_gemma":[0.035968423,0.000014446845,0.9576829,0.0036164194,0.0011159576,0.000012225868,0.000003958623,0.00005361708,0.0015320465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959065,0.00004654326,0.00047719295,0.0017183435,0.001037555,0.0008138715],"domain_scores_gemma":[0.99735683,0.00019232147,0.00023505194,0.0016722339,0.00022673211,0.0003168252],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009640758,0.00057830475,0.00058787124,0.00085215276,0.0004739027,0.001064751,0.003965347,0.0003603054,0.000053790543],"category_scores_gemma":[0.00018544006,0.0005222302,0.00014244852,0.0007047836,0.0004348558,0.00044441991,0.0019512817,0.0015860576,0.0001557206],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037768266,0.00001623338,0.000025023528,0.00001703821,0.0000067456717,0.000112938775,0.0010013427,0.023257505,0.000812936,0.012462456,0.000016989068,0.96226704],"study_design_scores_gemma":[0.00052695355,0.0004380489,0.00040674108,0.0004954893,0.000012157542,0.0002652849,2.1856204e-7,0.7718852,0.008674857,0.16247539,0.052736755,0.002082902],"about_ca_topic_score_codex":0.00023484706,"about_ca_topic_score_gemma":0.00019657651,"teacher_disagreement_score":0.9601841,"about_ca_system_score_codex":0.00014224333,"about_ca_system_score_gemma":0.00042899713,"threshold_uncertainty_score":0.9999722},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001843576,0.00015920066,0.9824937,0.0009625262,0.004121608,0.00037578365,0.000016782706,0.0006451822,0.011206805],"genre_scores_gemma":[0.041170575,0.00008994727,0.9560795,0.0012956059,0.0006460221,0.000025303974,0.000021022352,0.000052715804,0.000619303],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955101,0.000025344427,0.0005599478,0.001956109,0.0011910903,0.0007574345],"domain_scores_gemma":[0.99518126,0.0005110152,0.00041685163,0.003375823,0.00031230165,0.00020275691],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008133386,0.0005901762,0.00052379706,0.00079297693,0.00027241244,0.0006825423,0.006708858,0.00058548036,0.00003842799],"category_scores_gemma":[0.00020828772,0.00057378534,0.00012933036,0.0006729316,0.001027458,0.0010553229,0.0018441224,0.0016503206,0.00018383103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020362477,0.000043414602,0.0000693534,0.000034489105,0.000013182336,0.00008283603,0.00025559627,0.00037182082,0.0042587793,0.21458398,0.00014868018,0.7801175],"study_design_scores_gemma":[0.001514722,0.00062120525,0.0008835513,0.000607508,0.0000201543,0.00015941724,1.8652935e-7,0.23121154,0.06869977,0.60216075,0.0908526,0.0032686077],"about_ca_topic_score_codex":0.000012805141,"about_ca_topic_score_gemma":0.000057776502,"teacher_disagreement_score":0.7768489,"about_ca_system_score_codex":0.00035857366,"about_ca_system_score_gemma":0.0006720114,"threshold_uncertainty_score":0.99967134},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001654181,0.0020064414,0.9730931,0.0015418353,0.010772052,0.00092362706,0.000003189569,0.00030556586,0.01133767],"genre_scores_gemma":[0.047832094,0.003879537,0.912526,0.01713227,0.005749745,0.000113758615,0.00007808124,0.00016903266,0.012519492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948182,0.00002990785,0.0007729142,0.00204067,0.0010964959,0.0012417772],"domain_scores_gemma":[0.9958839,0.0009897358,0.00046784562,0.0018408573,0.00047117058,0.00034652321],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009834999,0.00083517417,0.00082766096,0.00084550097,0.0005341066,0.003500812,0.0054120123,0.00058147864,0.00003623026],"category_scores_gemma":[0.00021735218,0.0007210413,0.0003960826,0.0006401615,0.0006227196,0.004064918,0.0012879309,0.00078392995,0.0002177542],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001301649,0.000035476554,0.00000537866,0.00006576561,0.000013024567,0.000021120542,0.0009835307,0.0013450864,0.000028451976,0.06986768,0.00033933556,0.92728215],"study_design_scores_gemma":[0.0012774502,0.0009933444,0.00017477309,0.0015757955,0.00002257261,0.00016843805,0.0000017192788,0.4526109,0.0022860693,0.32620096,0.21248816,0.0021998242],"about_ca_topic_score_codex":0.0000092536075,"about_ca_topic_score_gemma":0.00006475011,"teacher_disagreement_score":0.9250823,"about_ca_system_score_codex":0.0004423535,"about_ca_system_score_gemma":0.0011465498,"threshold_uncertainty_score":0.9999692},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009591292,0.00007831547,0.98451144,0.00035014728,0.0033834984,0.0009420276,0.000039091214,0.00005212244,0.010547479],"genre_scores_gemma":[0.46252063,0.0000590516,0.51498264,0.0165964,0.0027668267,0.00010515895,0.00013264957,0.00017847924,0.0026582042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955733,0.000023660717,0.0006960136,0.0018891832,0.0008170061,0.0010008744],"domain_scores_gemma":[0.99439114,0.0026810435,0.0004978882,0.0012279893,0.0009873249,0.00021463343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000875724,0.00074348995,0.00074574933,0.0011199896,0.00034581966,0.0009994609,0.0033623483,0.00037672234,0.00003433274],"category_scores_gemma":[0.00054494233,0.00068773556,0.00034427285,0.0005058345,0.0005856996,0.00201792,0.0010734835,0.0010049236,0.00008651195],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024356997,0.00018725156,0.0000172919,0.00020538244,0.00013677307,0.00039733763,0.0060169054,0.0036573138,0.01140415,0.04720629,0.00064106483,0.9298867],"study_design_scores_gemma":[0.002126821,0.0027168838,0.00043261418,0.002976844,0.00009201183,0.00035402074,0.0000075994917,0.66267586,0.13490745,0.16564636,0.024281036,0.0037825068],"about_ca_topic_score_codex":0.00006234053,"about_ca_topic_score_gemma":0.00007502646,"teacher_disagreement_score":0.9261042,"about_ca_system_score_codex":0.0006384169,"about_ca_system_score_gemma":0.00058458076,"threshold_uncertainty_score":0.9995574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004894726,0.0002613051,0.99649906,0.00019961502,0.00063730543,0.00034070187,0.000005352496,0.00017264124,0.0013945487],"genre_scores_gemma":[0.45224202,0.000045500074,0.54708433,0.00030134668,0.00016954051,0.00000988171,0.0000049039472,0.000021144475,0.00012133372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967852,0.000026695672,0.0006499336,0.0010281845,0.0010802064,0.00042976916],"domain_scores_gemma":[0.99624753,0.00068548904,0.00057764584,0.0021693038,0.000272133,0.000047904454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00130386,0.0003614673,0.0003908175,0.0006174214,0.0002721838,0.00032550126,0.0053173103,0.00021287226,0.0000054486645],"category_scores_gemma":[0.0001083635,0.00025839914,0.00010061484,0.000660976,0.00077133166,0.0007726,0.0014476854,0.0005942964,0.000009507916],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043256555,0.000011097819,0.00009433254,0.000023148212,0.0000024153692,0.000005485848,0.000112763686,0.0072553405,0.0012451345,0.0075228517,0.00005254783,0.98367053],"study_design_scores_gemma":[0.0001777338,0.0001426867,0.0010894585,0.0005394498,0.000006282611,0.000043370645,7.050412e-8,0.9288601,0.030148594,0.03737944,0.00115398,0.00045877992],"about_ca_topic_score_codex":0.000036292928,"about_ca_topic_score_gemma":0.00003479492,"teacher_disagreement_score":0.98321176,"about_ca_system_score_codex":0.00019452978,"about_ca_system_score_gemma":0.0003355901,"threshold_uncertainty_score":0.9999868},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019340987,0.0002366796,0.995087,0.00077580963,0.00066323264,0.0026007162,0.00006330088,0.00019839744,0.0003554653],"genre_scores_gemma":[0.686691,0.000010681509,0.30848563,0.0027136453,0.0008260018,0.0009261113,0.000023030761,0.00007263,0.0002512557],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958675,0.000034188433,0.0006262943,0.0018556685,0.0008834738,0.00073286815],"domain_scores_gemma":[0.9965901,0.0008961226,0.00046604793,0.001622047,0.00018509114,0.00024059339],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063327816,0.0005923842,0.00062887446,0.0011030979,0.00042718832,0.00054026156,0.0030757983,0.00036169458,0.000017615355],"category_scores_gemma":[0.000057894336,0.00061642047,0.00025816303,0.00059806416,0.00055455166,0.00060436525,0.000718807,0.0005133707,0.000077122226],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051002894,0.00006318168,0.000013532504,0.000071091155,0.000015669004,0.000008521105,0.00020047344,0.0251182,0.0003861951,0.024526386,0.00000973235,0.9495819],"study_design_scores_gemma":[0.0025715923,0.0006807586,0.000056773184,0.0014211038,0.00003649584,0.00010210191,0.0000011935459,0.42713916,0.016863713,0.4373807,0.11110087,0.0026455275],"about_ca_topic_score_codex":0.0000728987,"about_ca_topic_score_gemma":0.000070512964,"teacher_disagreement_score":0.94693637,"about_ca_system_score_codex":0.0012480343,"about_ca_system_score_gemma":0.0015281567,"threshold_uncertainty_score":0.9996287},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042455198,0.00041419105,0.9813676,0.00150282,0.0016612343,0.00056117075,0.000006973295,0.00015405504,0.014289491],"genre_scores_gemma":[0.4545666,0.00017585984,0.54220915,0.00091155677,0.0011718269,0.000059598937,0.00005023049,0.000052124895,0.00080309465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967265,0.00008789606,0.0007335614,0.000982567,0.0011377118,0.00033176003],"domain_scores_gemma":[0.9972717,0.00022963532,0.00053429604,0.0011090208,0.00076894305,0.0000863717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031522026,0.00034343963,0.00044128016,0.0009434421,0.00014774244,0.00019294568,0.0015324907,0.0002665473,0.00011021654],"category_scores_gemma":[0.00008160651,0.00031744255,0.00012572389,0.00053157733,0.000200052,0.0007188804,0.00057905336,0.0004434774,0.000024337705],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013502705,0.00002635748,0.000013008208,0.00001340314,0.000008589236,8.490638e-7,0.00015791082,0.0053214584,0.000059891056,0.0053545465,0.000112517395,0.9889301],"study_design_scores_gemma":[0.0003243266,0.00021517533,0.00009358397,0.0003118347,0.000023905579,0.000036703223,2.0641808e-7,0.8980274,0.0026454593,0.08366312,0.014201643,0.00045663925],"about_ca_topic_score_codex":0.00003202533,"about_ca_topic_score_gemma":0.00015096417,"teacher_disagreement_score":0.9884735,"about_ca_system_score_codex":0.0004532793,"about_ca_system_score_gemma":0.000562332,"threshold_uncertainty_score":0.99992776},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000728427,0.00010861206,0.9921096,0.0012270912,0.002257208,0.00040573496,0.000007640755,0.00020910666,0.0029465705],"genre_scores_gemma":[0.3513856,0.0000074441577,0.64238816,0.0054337825,0.00047041342,0.000014271818,0.0000048147867,0.000028161066,0.00026737395],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552613,0.000069464804,0.00065265776,0.0017932978,0.0012274745,0.0007309826],"domain_scores_gemma":[0.9969651,0.0005530772,0.00032327487,0.0015985161,0.0002840959,0.0002759048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013038091,0.00052864436,0.0005479587,0.0006930816,0.00030893664,0.000433516,0.0038762216,0.00030798616,0.000048489364],"category_scores_gemma":[0.0001530255,0.0005133112,0.000125798,0.0004011396,0.00030407554,0.0005244876,0.0022152844,0.0008157471,0.00008281982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012858252,0.000024988787,0.00017308435,0.000049808048,0.000026516955,0.000067444875,0.0022666194,0.015221651,0.00038614747,0.1530309,0.00006488999,0.8286751],"study_design_scores_gemma":[0.0006839145,0.00025862988,0.0022059414,0.00062377873,0.000014666821,0.0000799333,7.833497e-7,0.05738965,0.0072997184,0.92838204,0.0013023516,0.001758596],"about_ca_topic_score_codex":0.00020069972,"about_ca_topic_score_gemma":0.00011567811,"teacher_disagreement_score":0.8269165,"about_ca_system_score_codex":0.0003799184,"about_ca_system_score_gemma":0.00037904628,"threshold_uncertainty_score":0.99973184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007805874,0.00015380252,0.9927724,0.0010358455,0.0028452664,0.00062213367,0.0000015240137,0.00015963556,0.0023313498],"genre_scores_gemma":[0.14104255,0.000035409113,0.8543668,0.0034001863,0.00031838822,0.00004186217,0.000016823502,0.00004116943,0.0007368434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721897,0.000056984267,0.0004629768,0.001123956,0.00063617696,0.00050096685],"domain_scores_gemma":[0.99796474,0.00030097982,0.00029606483,0.00094931445,0.0003002172,0.00018868924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011077274,0.00036847522,0.00034173395,0.00044765332,0.00033390085,0.0008430339,0.0021829994,0.00019043575,0.0000514714],"category_scores_gemma":[0.000097541975,0.00035310135,0.000103726765,0.00038016296,0.00022458336,0.00072995236,0.00021596973,0.00045284227,0.00006634178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016602754,0.000068292684,0.000011950969,0.000035938243,0.000007890373,0.000005856131,0.0029760303,0.09528181,0.000024110037,0.0488255,0.00009503973,0.8526659],"study_design_scores_gemma":[0.00013954603,0.00027557364,0.00005829941,0.00016590494,0.000009677582,0.000023531822,0.000006503338,0.94722,0.00030832295,0.044163506,0.0071748,0.0004543103],"about_ca_topic_score_codex":0.000010434109,"about_ca_topic_score_gemma":0.000036002646,"teacher_disagreement_score":0.8522116,"about_ca_system_score_codex":0.00030365345,"about_ca_system_score_gemma":0.0007311845,"threshold_uncertainty_score":0.9998921},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003880607,0.0001795943,0.9887154,0.0019663805,0.0023332615,0.0003989799,0.000004828064,0.000114273644,0.0062484574],"genre_scores_gemma":[0.4163346,0.00033282363,0.57015675,0.009627001,0.0011740901,0.000031032083,0.000027081447,0.00006819408,0.0022484006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723667,0.000048571153,0.00046791259,0.0010038053,0.00076348515,0.00047956035],"domain_scores_gemma":[0.99822116,0.00039141154,0.00024477654,0.0008886709,0.00015483462,0.00009915194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006480005,0.00038076562,0.00033070135,0.0006825634,0.0002616955,0.0003778441,0.0017746666,0.00023921848,0.000111320594],"category_scores_gemma":[0.000053131305,0.00031180787,0.00010740494,0.000659824,0.00061930495,0.0007280234,0.00052251894,0.00080343586,0.00006668141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043012597,0.000018316003,0.00011633476,0.000009407286,0.0000051539328,0.000027738102,0.0010975214,0.38973603,0.0000117905765,0.02133989,0.00014839858,0.58748513],"study_design_scores_gemma":[0.00053050846,0.000079086385,0.0009378216,0.00032238624,0.0000065709673,0.000047737485,0.000001751404,0.94210774,0.00011253793,0.04650145,0.008701486,0.00065091986],"about_ca_topic_score_codex":0.00006038574,"about_ca_topic_score_gemma":0.0050999736,"teacher_disagreement_score":0.5868342,"about_ca_system_score_codex":0.0005773303,"about_ca_system_score_gemma":0.0005075574,"threshold_uncertainty_score":0.9999334},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18136495,0.00001769725,0.8172302,0.0006729348,0.000059139875,0.00047597758,4.615927e-7,0.000071986666,0.00010660679],"genre_scores_gemma":[0.55181074,0.0000010233164,0.44732064,0.0007033802,0.000100146164,0.00004777941,0.000007410245,0.000004854321,0.0000040399154],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903786,0.000012157019,0.00013316155,0.00028640422,0.00023436658,0.00029604204],"domain_scores_gemma":[0.9994581,0.00002158835,0.00003683669,0.00026661978,0.00010181049,0.000115064104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023691029,0.00010177792,0.00011950865,0.00015287624,0.00010335011,0.00003704454,0.00011202857,0.000052126034,0.0000031876032],"category_scores_gemma":[0.000021482361,0.000066407054,0.000012775565,0.00063755736,0.00010667622,0.00034242304,0.00005148665,0.00012666703,0.000014616813],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000223155,0.001229251,0.021240955,0.000080757774,0.000008005106,0.0000034581042,0.0141857425,0.06389411,0.57662153,0.0028481106,0.00017925096,0.3194857],"study_design_scores_gemma":[0.0011644303,0.00076768367,0.017801726,0.00015225056,0.000029575678,0.00017781895,0.000012531218,0.5097031,0.46461704,0.0038601619,0.0012453574,0.00046830004],"about_ca_topic_score_codex":0.000009743348,"about_ca_topic_score_gemma":0.0000043053647,"teacher_disagreement_score":0.445809,"about_ca_system_score_codex":0.00012367073,"about_ca_system_score_gemma":0.000032003267,"threshold_uncertainty_score":0.2708001},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003594988,0.0032522536,0.9902163,0.00084013253,0.00064446696,0.00024444266,0.0000050007548,0.000067099565,0.0011353036],"genre_scores_gemma":[0.70352864,0.00025243685,0.2942648,0.0012851377,0.0003596546,0.0000032650769,8.7919534e-7,0.000030345358,0.0002748472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974455,0.00004556304,0.00042710933,0.00096387055,0.00067310955,0.0004448315],"domain_scores_gemma":[0.9973937,0.0011206156,0.0003405195,0.0009672115,0.00009456411,0.00008338137],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011133222,0.00034736434,0.00038547814,0.00020795251,0.0002601249,0.00033717413,0.002665652,0.0001663613,0.000020198771],"category_scores_gemma":[0.00011078358,0.00024699655,0.000077508455,0.00036598218,0.0014078679,0.0005291244,0.0012513977,0.00043281162,0.0000019376528],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003445463,0.000017046399,0.000031293093,0.000048253205,0.000013862588,0.00000831775,0.0018145236,0.013657106,0.002796779,0.011804781,0.000036356923,0.9697682],"study_design_scores_gemma":[0.0002141748,0.0001378404,0.000062132814,0.0007904585,0.000017118167,0.000115125265,0.000001824255,0.8700284,0.0064753597,0.12054509,0.0009902836,0.000622232],"about_ca_topic_score_codex":0.000059527327,"about_ca_topic_score_gemma":0.000010483956,"teacher_disagreement_score":0.969146,"about_ca_system_score_codex":0.00008338414,"about_ca_system_score_gemma":0.00025266287,"threshold_uncertainty_score":0.9999982},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011088669,0.00012320653,0.99855185,0.0002027888,0.00020409805,0.0005680175,0.00006314381,0.00007566473,0.00010032552],"genre_scores_gemma":[0.07869748,0.000009360954,0.9208274,0.00013104665,0.00011417741,0.00004445072,0.00007214943,0.00001647401,0.000087472814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971181,0.00001539432,0.000595566,0.0011342489,0.00072987145,0.00040677693],"domain_scores_gemma":[0.99768984,0.00040311296,0.00035960152,0.00091797125,0.0004840963,0.00014539652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038194167,0.00031419328,0.0005134848,0.0011305676,0.00024894203,0.00022350982,0.0019282765,0.00014970468,0.00002265291],"category_scores_gemma":[0.000018971588,0.00028205445,0.00018983128,0.0012237638,0.00047732092,0.0003197029,0.00024776603,0.00021845372,0.000004371911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011496509,0.000060610997,0.0001421824,0.000020206842,0.00005250684,0.000003901912,0.00022441143,0.58483416,0.0000059882022,0.042927697,0.0000053637696,0.37172183],"study_design_scores_gemma":[0.00012914532,0.00017639334,0.003808701,0.00003841691,0.00008871368,0.000009404724,1.4392951e-7,0.88931596,0.000013299585,0.10576044,0.00036469058,0.00029469383],"about_ca_topic_score_codex":0.000021361675,"about_ca_topic_score_gemma":0.000042720636,"teacher_disagreement_score":0.37142715,"about_ca_system_score_codex":0.00015821426,"about_ca_system_score_gemma":0.00028138512,"threshold_uncertainty_score":0.99996316},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000062999316,0.0007347859,0.99295324,0.00015866497,0.0010254687,0.0007186138,0.00004903059,0.00016846559,0.0041287066],"genre_scores_gemma":[0.12399617,0.000108299035,0.87380654,0.00055561826,0.00084474677,0.0002089657,0.00009652943,0.00007799681,0.00030515276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953224,0.00005144814,0.0006835908,0.0023613311,0.00088988384,0.00069132535],"domain_scores_gemma":[0.9955964,0.00065695855,0.0002939656,0.0031660344,0.00014061517,0.0001460379],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015641701,0.00049994065,0.00057904073,0.00094556593,0.0002617875,0.0011476376,0.008390818,0.00024392988,0.0000058262567],"category_scores_gemma":[0.00015217147,0.00048109662,0.000048335427,0.0009988586,0.00041948052,0.0011443328,0.0031726572,0.00080839824,0.000033266988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002175023,0.000022578135,0.00005116628,0.000023555982,0.000007037634,0.000061248786,0.00074846926,0.014784621,0.000015040114,0.0032693658,0.000030028525,0.9809847],"study_design_scores_gemma":[0.00018966444,0.000041121428,0.0000962637,0.0011962013,0.0000064061087,0.000102435544,0.000001988392,0.9822849,0.000039798197,0.010387706,0.0050330195,0.0006204901],"about_ca_topic_score_codex":0.00026226824,"about_ca_topic_score_gemma":0.00034082175,"teacher_disagreement_score":0.9803642,"about_ca_system_score_codex":0.00027993476,"about_ca_system_score_gemma":0.00057173846,"threshold_uncertainty_score":0.99988925},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086357596,0.00025186667,0.98536766,0.0035922301,0.00031641516,0.00048399394,0.000004874213,0.00012693007,0.0089924475],"genre_scores_gemma":[0.8979173,0.000056429744,0.098050594,0.0021481614,0.00043560623,0.000020024047,0.0000041932462,0.00005296572,0.0013147584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612576,0.00014062622,0.0004139994,0.0014605881,0.0011447697,0.00071424263],"domain_scores_gemma":[0.9883507,0.009276378,0.00020860737,0.0018141407,0.0001439273,0.00020623207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020168084,0.00046977325,0.0004086257,0.0008705747,0.0006128083,0.0005386678,0.0036146394,0.00028505013,0.000018597071],"category_scores_gemma":[0.0007917689,0.0003322384,0.000099256,0.0010036889,0.0015125935,0.0005036926,0.001382837,0.0016432086,0.00005798346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005754075,0.000008693611,0.0029483873,0.000009863862,0.000005985515,0.000036075566,0.00025251097,0.0015360012,0.000003730377,0.73441726,0.000021624744,0.26075414],"study_design_scores_gemma":[0.00015203524,0.0001995439,0.0045965253,0.00021869635,0.0000039796273,0.000029734189,1.0135401e-7,0.015030384,0.00008207943,0.97853976,0.000762877,0.00038426876],"about_ca_topic_score_codex":0.0000065436498,"about_ca_topic_score_gemma":0.000026878142,"teacher_disagreement_score":0.8970537,"about_ca_system_score_codex":0.00019839098,"about_ca_system_score_gemma":0.0002724291,"threshold_uncertainty_score":0.999913},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008535449,0.00038541656,0.9869469,0.00076120923,0.000847794,0.00070530217,0.000020883192,0.00037145376,0.0014255841],"genre_scores_gemma":[0.74442726,0.00001019122,0.25447792,0.0006314946,0.00027342627,0.000008266327,0.00002877628,0.000033573164,0.000109083216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939964,0.00008545347,0.0010594957,0.0025077118,0.0011785175,0.0011724307],"domain_scores_gemma":[0.9968141,0.00038603946,0.00051227974,0.0016129653,0.0003149676,0.0003596788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014816513,0.00086867885,0.00094628095,0.0006571655,0.0004997306,0.0009307972,0.0025433241,0.0004399863,0.000011467548],"category_scores_gemma":[0.0000699688,0.0008082565,0.00022835421,0.0005054279,0.0008352895,0.0006216898,0.0015555911,0.0011911476,0.000019128058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002226635,0.00006736037,0.00013542786,0.00029408422,0.000024960867,0.00016513404,0.002218334,0.7686216,0.0005303794,0.035609066,0.000018391012,0.19229297],"study_design_scores_gemma":[0.00045739432,0.00017052818,0.00029684504,0.0005672318,0.000009497146,0.00031999964,2.2901905e-7,0.76711607,0.0001649032,0.23003928,0.0000837462,0.0007742809],"about_ca_topic_score_codex":0.00007585198,"about_ca_topic_score_gemma":0.00006215447,"teacher_disagreement_score":0.7358918,"about_ca_system_score_codex":0.00050753367,"about_ca_system_score_gemma":0.0008431018,"threshold_uncertainty_score":0.99943686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011730081,0.0008429903,0.99484384,0.00008381037,0.0012905652,0.0002933185,0.0000056161557,0.00010225109,0.0013645733],"genre_scores_gemma":[0.050189756,0.000038908973,0.94901997,0.0003703899,0.00026763612,0.0000011809037,0.0000021296603,0.000043840766,0.00006619684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99541837,0.00007979193,0.000787986,0.0014683275,0.0014592558,0.00078626454],"domain_scores_gemma":[0.99665374,0.00058656646,0.0004964362,0.0015678224,0.0005255897,0.00016984378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013213757,0.0005891114,0.00082234596,0.0011576959,0.00039509108,0.00039925205,0.0036294851,0.00032521095,0.000010116337],"category_scores_gemma":[0.00017533898,0.0005496704,0.00022849454,0.000949559,0.0016003262,0.0007649027,0.0016223125,0.00073285744,0.00001717067],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018145809,0.00007194309,0.00005955518,0.00010477211,0.000022782315,0.00048975204,0.001018415,0.022112941,0.016238872,0.0016333662,0.000025842017,0.9582036],"study_design_scores_gemma":[0.00056332885,0.00016437742,0.00020485348,0.0008325165,0.000016224576,0.00044881226,1.2565731e-7,0.9357173,0.023718735,0.037210196,0.00023093824,0.00089260156],"about_ca_topic_score_codex":0.000049784656,"about_ca_topic_score_gemma":0.000024980525,"teacher_disagreement_score":0.95731103,"about_ca_system_score_codex":0.00027157253,"about_ca_system_score_gemma":0.00063530734,"threshold_uncertainty_score":0.9996955},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040870178,0.00278141,0.9932123,0.00040172946,0.0007038129,0.00027950786,0.0000046074215,0.00036331592,0.0022124625],"genre_scores_gemma":[0.056740444,0.000021371687,0.9420284,0.00074173434,0.00019541751,0.00000399059,0.0000052597893,0.000032379554,0.00023099239],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965072,0.000027003915,0.00062711415,0.0012316508,0.0010470712,0.0005599501],"domain_scores_gemma":[0.9974692,0.0003147753,0.00039185162,0.0013506649,0.0003775451,0.000095984964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007608273,0.00048322056,0.00057869294,0.0009780765,0.00014609218,0.00032078708,0.0043779253,0.00037075527,0.0000085030815],"category_scores_gemma":[0.0000834413,0.00043093404,0.00013713214,0.0007707236,0.00062882586,0.00061694236,0.0014909357,0.0007843344,0.000008410005],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008874946,0.000050692855,0.000059270875,0.00024344717,0.00001575604,0.00014878692,0.0008345343,0.011028824,0.004865089,0.038072783,0.00012283264,0.9445491],"study_design_scores_gemma":[0.00042475495,0.00023235692,0.000018616463,0.0016683683,0.000016875496,0.000091978254,1.4343807e-7,0.43373597,0.03653667,0.5252288,0.00078769785,0.0012577696],"about_ca_topic_score_codex":0.00007661186,"about_ca_topic_score_gemma":0.000040803498,"teacher_disagreement_score":0.94329137,"about_ca_system_score_codex":0.00023959317,"about_ca_system_score_gemma":0.0004561817,"threshold_uncertainty_score":0.9998143},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009384425,0.000512648,0.9874709,0.00025511527,0.0011759406,0.0002651727,0.000008219231,0.00012257058,0.010095587],"genre_scores_gemma":[0.48644224,0.00003107293,0.51207423,0.0004405294,0.00041778275,0.0000049123814,0.000006578711,0.000039413964,0.00054324896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99550796,0.00003991164,0.0006674588,0.0014420856,0.001583142,0.00075947354],"domain_scores_gemma":[0.9971396,0.0004982285,0.00023400148,0.0016396403,0.00034007142,0.0001484613],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010482667,0.0004795639,0.0006170782,0.0012355382,0.00022900193,0.00024354333,0.004971639,0.00029362828,0.000027636537],"category_scores_gemma":[0.00002532362,0.00044892367,0.00021789198,0.0012141796,0.0023711992,0.0003747676,0.0020051452,0.0008996894,0.000030067959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034255665,0.000074075484,0.000026937018,0.00006237461,0.000007267095,0.00007605889,0.00027713133,0.10727225,0.00007906038,0.091434166,0.00004061475,0.8006466],"study_design_scores_gemma":[0.00023956146,0.00025036014,0.00013640261,0.0003201453,0.0000051014686,0.0000621528,1.9635405e-7,0.79779416,0.0043879803,0.19544125,0.0007720945,0.00059057877],"about_ca_topic_score_codex":0.000111707486,"about_ca_topic_score_gemma":0.000055055403,"teacher_disagreement_score":0.80005604,"about_ca_system_score_codex":0.00019743518,"about_ca_system_score_gemma":0.00067077624,"threshold_uncertainty_score":0.9997963},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034901197,0.00042247094,0.95905435,0.0008660643,0.0011628502,0.00028422498,0.000004523281,0.000334446,0.03783614],"genre_scores_gemma":[0.17824845,0.00013380601,0.813919,0.005850808,0.00093357346,0.00001431204,0.00002339055,0.000080069454,0.0007965886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952976,0.00006728362,0.00054091465,0.0019876126,0.0011766028,0.0009299502],"domain_scores_gemma":[0.9973352,0.00045478874,0.00025991147,0.0015939089,0.00013092074,0.0002252694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008740142,0.0006645837,0.0006153041,0.0007630354,0.0004407056,0.0009076163,0.004193692,0.0004150278,0.00015754976],"category_scores_gemma":[0.000052552256,0.00058007916,0.00020602923,0.0007750865,0.00057423057,0.00060700224,0.00086993765,0.001412322,0.00025837653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054070238,0.000017927718,0.00004126281,0.000016506285,0.0000058363685,0.00017232385,0.00029913362,0.2022928,0.00000737746,0.005589995,0.000052895062,0.79149854],"study_design_scores_gemma":[0.0002829723,0.00024720049,0.000073113406,0.00023003467,0.00000617071,0.000055632256,6.074695e-8,0.87619835,0.00010616092,0.09573074,0.026290342,0.0007792024],"about_ca_topic_score_codex":0.000033886594,"about_ca_topic_score_gemma":0.000026193824,"teacher_disagreement_score":0.79071933,"about_ca_system_score_codex":0.0002431898,"about_ca_system_score_gemma":0.0006421461,"threshold_uncertainty_score":0.9996651},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025356124,0.0004688948,0.9788426,0.0013847126,0.0015909545,0.0007940138,0.000016638905,0.00038993152,0.016258651],"genre_scores_gemma":[0.19115458,0.00007250209,0.7909577,0.016745595,0.0006560854,0.000047771195,0.00009102009,0.000088216606,0.00018653666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99442697,0.000044791665,0.000806513,0.0022750176,0.0014515611,0.0009951486],"domain_scores_gemma":[0.99696726,0.00018714217,0.00045180618,0.0017920405,0.00040431652,0.00019746194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045723314,0.00089586695,0.00067917333,0.00076405087,0.00046206417,0.0006780634,0.00478659,0.000369644,0.000030105295],"category_scores_gemma":[0.0000023381472,0.0008230419,0.00018821197,0.001177024,0.00045822465,0.00079965836,0.0017436773,0.0008817931,0.0001283732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030747073,0.00042073664,0.000098122226,0.0010744322,0.00013912733,0.00088313967,0.007019475,0.34170964,0.00034388187,0.10555158,0.00008317719,0.54264593],"study_design_scores_gemma":[0.0019568359,0.00027738156,0.00044994216,0.002172766,0.00008778858,0.00030732277,0.000008362123,0.69740164,0.0048601115,0.28222388,0.007439776,0.0028141828],"about_ca_topic_score_codex":0.00017481847,"about_ca_topic_score_gemma":0.00043144036,"teacher_disagreement_score":0.53983176,"about_ca_system_score_codex":0.00030605853,"about_ca_system_score_gemma":0.00025474408,"threshold_uncertainty_score":0.999422},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019491092,0.0013910794,0.9935234,0.0010996661,0.0018716496,0.00038968882,0.000005037877,0.0012077009,0.0004922852],"genre_scores_gemma":[0.0051888907,0.000090896945,0.9925259,0.00039068185,0.0011068601,0.000010554729,0.0000045046604,0.000062997344,0.00061876315],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994939,0.00005482588,0.0005985768,0.002165078,0.0012106156,0.0010318534],"domain_scores_gemma":[0.9951953,0.0018204282,0.0003002859,0.0021978104,0.00030816082,0.00017800031],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015007384,0.00075696915,0.00077923486,0.001115006,0.00028010726,0.00046317422,0.005195895,0.0003694739,0.000008051082],"category_scores_gemma":[0.0012356251,0.00073206145,0.00012409245,0.00088013377,0.00064035703,0.0012214438,0.0026374813,0.0012991158,0.000061074184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010868622,0.0000049378987,0.00005909295,0.00005367404,0.00001001126,0.00006263231,0.0003072413,0.22851938,0.000030715986,0.0026621274,0.000009315633,0.7682798],"study_design_scores_gemma":[0.00034601774,0.00021937194,0.000680267,0.0009008537,0.000026789112,0.00016942185,3.2024752e-7,0.04271118,0.0069348603,0.939798,0.0057472773,0.0024656437],"about_ca_topic_score_codex":0.000006099186,"about_ca_topic_score_gemma":0.000012857901,"teacher_disagreement_score":0.9371359,"about_ca_system_score_codex":0.0005230495,"about_ca_system_score_gemma":0.0004928077,"threshold_uncertainty_score":0.99951303},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004892105,0.0001829179,0.972461,0.00041455746,0.0008829733,0.0002129393,0.000007021206,0.000064327716,0.020882184],"genre_scores_gemma":[0.9476893,0.000023994106,0.04309988,0.0020984646,0.00037045128,0.000015379912,0.000005904581,0.000031514428,0.0066651152],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952704,0.00010612954,0.0006832372,0.0016883604,0.0017914805,0.00046041995],"domain_scores_gemma":[0.9951004,0.002649352,0.0003788197,0.0014257189,0.00026500807,0.0001807222],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019968823,0.00037637624,0.00048261878,0.0005376006,0.00046542817,0.00068103406,0.0029508518,0.0002546071,0.0012133751],"category_scores_gemma":[0.0012010771,0.00030255728,0.00013725126,0.000760251,0.0012020654,0.00035758814,0.0005783886,0.0009284539,0.0007390162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010436088,0.00002823099,0.00047948517,0.0000023835205,0.0000062898125,0.00004659943,0.0054360456,0.10894522,0.00080286135,0.022704113,0.00008724976,0.8614511],"study_design_scores_gemma":[0.0001321,0.00006065514,0.00020428051,0.00008168869,0.000004196234,0.000016551789,0.0000037121943,0.03468002,0.0019534635,0.924556,0.03781315,0.00049416],"about_ca_topic_score_codex":0.000016800404,"about_ca_topic_score_gemma":0.000027018661,"teacher_disagreement_score":0.9427972,"about_ca_system_score_codex":0.000113082046,"about_ca_system_score_gemma":0.00017560586,"threshold_uncertainty_score":0.99994266},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005456248,0.0014693533,0.9873293,0.0002172868,0.00055875466,0.0002590864,0.0000046571554,0.00012303326,0.009492911],"genre_scores_gemma":[0.48916754,0.00025618143,0.509578,0.0005267124,0.00027050968,0.000009814518,0.0000026784048,0.00004381263,0.00014476986],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99616206,0.00006193048,0.0007137738,0.0014616932,0.0010153014,0.0005852282],"domain_scores_gemma":[0.99684924,0.0006007284,0.00047435527,0.0016093667,0.00026105388,0.00020527461],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013642551,0.00053312484,0.00083340803,0.0028241056,0.00022054333,0.00038777056,0.002915311,0.00029578846,0.0000255148],"category_scores_gemma":[0.00009862571,0.0004870787,0.0002642698,0.0028908702,0.00079747936,0.0005097254,0.0014101394,0.00056946004,0.0000142363915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011280726,0.000042392352,0.0007109747,0.00013237933,0.000060903578,0.00007863281,0.00036912036,0.00080601964,0.00030969112,0.31263378,0.000012721821,0.6848321],"study_design_scores_gemma":[0.00055502047,0.00041881218,0.0005987857,0.00094208174,0.00006323919,0.00022608679,8.668734e-7,0.22469677,0.002209598,0.7662754,0.0026804628,0.001332892],"about_ca_topic_score_codex":0.000019836885,"about_ca_topic_score_gemma":0.000019346566,"teacher_disagreement_score":0.6834992,"about_ca_system_score_codex":0.000121661564,"about_ca_system_score_gemma":0.00020522632,"threshold_uncertainty_score":0.99975806},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012797796,0.002700388,0.9912094,0.0006926858,0.0023769527,0.0001525258,0.0000027148021,0.00015028557,0.0014353091],"genre_scores_gemma":[0.27400544,0.000038762773,0.7231134,0.0016648738,0.00050870836,0.000016400483,0.0000027237543,0.000036503112,0.00061317324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966434,0.00005433252,0.00043960466,0.0016272129,0.000643173,0.00059222477],"domain_scores_gemma":[0.99770457,0.00080253475,0.00022129768,0.0009155387,0.00009336305,0.00026272834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007244191,0.00047760032,0.00048020325,0.00047039852,0.0005069364,0.00062611594,0.0014858783,0.00032110888,0.000026153926],"category_scores_gemma":[0.00010509543,0.00043826358,0.00007506889,0.0003811294,0.00038361005,0.0005365917,0.0007275071,0.00081773754,0.000012692167],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061835767,0.00002714895,0.0003187945,0.00003923629,0.00001701761,0.006287817,0.02270304,0.005924189,0.00006667151,0.0065322663,0.00034968977,0.95772797],"study_design_scores_gemma":[0.0006590073,0.0005430317,0.000047598864,0.0011509861,0.0000319732,0.0062842043,0.000010316507,0.7808805,0.0012981384,0.17852312,0.027597299,0.0029738217],"about_ca_topic_score_codex":0.00019161389,"about_ca_topic_score_gemma":0.00004315635,"teacher_disagreement_score":0.9547541,"about_ca_system_score_codex":0.00044771752,"about_ca_system_score_gemma":0.000262568,"threshold_uncertainty_score":0.99980694},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000061015227,0.00016313481,0.9932405,0.0004597111,0.0016772223,0.0010601665,0.00067436823,0.0008078178,0.0018561136],"genre_scores_gemma":[0.2000492,0.00027924185,0.7951925,0.002623434,0.0004575226,0.00012472815,0.0010199199,0.00009279137,0.00016071036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938119,0.000060253507,0.0009810047,0.0027303924,0.0014518807,0.00096457487],"domain_scores_gemma":[0.99471253,0.0004108134,0.0006721653,0.003745121,0.000260282,0.00019911352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008107168,0.000817468,0.0006835973,0.00068214035,0.00041731828,0.00071901095,0.0052583204,0.000529221,0.000028139355],"category_scores_gemma":[0.00026495205,0.00077893084,0.00014645352,0.00072909007,0.0009574887,0.0020323023,0.001961756,0.0010183137,0.000076120894],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028409637,0.0002358783,0.00022811003,0.00017550304,0.000058881444,0.000115181894,0.00094686716,0.007817335,0.014800626,0.052973993,0.0007645225,0.9218547],"study_design_scores_gemma":[0.0023536682,0.00062892673,0.0015322044,0.0024356376,0.00004264304,0.00008747961,0.0000013515839,0.4934064,0.07943959,0.3897254,0.027318005,0.0030287253],"about_ca_topic_score_codex":0.00004938497,"about_ca_topic_score_gemma":0.00005841507,"teacher_disagreement_score":0.918826,"about_ca_system_score_codex":0.0011087959,"about_ca_system_score_gemma":0.0008137048,"threshold_uncertainty_score":0.9994662},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012881255,0.002055558,0.9907085,0.0015655136,0.00073198887,0.00030486402,0.0000045996117,0.00035796734,0.0029828914],"genre_scores_gemma":[0.28979734,0.00061412144,0.7076882,0.001121066,0.00050247,0.0000078246385,0.000009320121,0.00003505804,0.00022458521],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99578047,0.00003959958,0.00057171885,0.0018666392,0.00084705855,0.000894506],"domain_scores_gemma":[0.99671364,0.0010882296,0.00030729405,0.0015464512,0.00015184717,0.00019251391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008434975,0.0006361499,0.0008420425,0.00086344,0.00042834887,0.00042890655,0.0028871107,0.00036813045,0.0000072005387],"category_scores_gemma":[0.00030768383,0.0005600331,0.00010455132,0.00043996467,0.0016712591,0.0008565214,0.0030934338,0.0009165703,0.000029508072],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071698437,0.000023992043,0.0034259502,0.00014773358,0.00005069624,0.0010246673,0.002447865,0.0010131679,0.0001475358,0.067171,0.00011133974,0.9244289],"study_design_scores_gemma":[0.0025097553,0.0012467747,0.01898377,0.0053053773,0.00013456526,0.0033476804,0.0000127492485,0.4394399,0.007354407,0.4854562,0.028964574,0.007244255],"about_ca_topic_score_codex":0.000093851704,"about_ca_topic_score_gemma":0.00009511329,"teacher_disagreement_score":0.91718465,"about_ca_system_score_codex":0.00015641128,"about_ca_system_score_gemma":0.00042854025,"threshold_uncertainty_score":0.9996851},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0144694,0.0024507914,0.9821436,0.000043476375,0.00018758953,0.00019247354,0.0000044094204,0.000010817297,0.00049743266],"genre_scores_gemma":[0.92815506,0.0002895263,0.07020763,0.000147238,0.00069680915,0.0000048801935,0.000041722098,0.00004638885,0.0004107345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978757,0.000016873346,0.0004224505,0.00090487895,0.00038938783,0.00039069555],"domain_scores_gemma":[0.99865633,0.000026082495,0.0002644016,0.0007322928,0.00021817184,0.00010272589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022198522,0.0003495849,0.00038630018,0.00021227461,0.00008831375,0.000039074184,0.0008293123,0.00044108398,0.000014729652],"category_scores_gemma":[0.00001341704,0.0003461467,0.00016638933,0.00021679632,0.00048558088,0.0000053269073,0.00031446945,0.00028182464,0.000003054883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009231683,0.000013176206,0.00015012948,0.00001909831,0.00002544214,0.000004421417,0.000034289034,0.9107927,0.0001614212,0.000045979406,0.0000018314657,0.08874226],"study_design_scores_gemma":[0.00013185169,0.000102778205,0.000023511533,0.00010472358,0.000034396362,0.000025070343,1.9411789e-7,0.9940263,0.0014350493,0.0036053085,0.00016322432,0.00034757305],"about_ca_topic_score_codex":0.000014021059,"about_ca_topic_score_gemma":0.00019069051,"teacher_disagreement_score":0.9136857,"about_ca_system_score_codex":0.000072724695,"about_ca_system_score_gemma":0.0002534785,"threshold_uncertainty_score":0.999899},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008511247,0.00018383452,0.99111366,0.0009885534,0.00017898675,0.00021037261,0.0000021045155,0.000098487646,0.0063728755],"genre_scores_gemma":[0.9778309,0.000015939282,0.01907856,0.0018962411,0.0010690583,0.000011081845,0.00003595609,0.000027259684,0.00003499093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977982,0.000005365923,0.00042172705,0.00063303096,0.0008860922,0.00025560657],"domain_scores_gemma":[0.9982503,0.000066659864,0.00047281678,0.00043661543,0.0007632565,0.000010358472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065914856,0.0003268862,0.0003582888,0.0008781855,0.0002461298,0.00045016894,0.0009410295,0.0001687323,0.000017865977],"category_scores_gemma":[0.00007575576,0.0002266397,0.00009029385,0.0010266736,0.0001478469,0.00076677627,0.00018019417,0.00028991283,0.000012534823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069868934,0.000025423507,0.000021071863,0.00070064265,0.000005899043,3.8343597e-7,0.00010741618,0.8827434,0.000009156187,0.00068394234,0.0000012518609,0.11569443],"study_design_scores_gemma":[0.00013398583,0.000006365712,0.000010178913,0.00064014713,0.000053390497,6.103582e-7,0.0000016618842,0.98435766,0.00002373031,0.014393208,0.00013166621,0.0002473959],"about_ca_topic_score_codex":0.00011407094,"about_ca_topic_score_gemma":0.00011226452,"teacher_disagreement_score":0.9769798,"about_ca_system_score_codex":0.000059771108,"about_ca_system_score_gemma":0.000292447,"threshold_uncertainty_score":0.92420995},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004182636,0.00022175373,0.99290514,0.00094668864,0.0004783,0.00052265095,0.000025753785,0.0002870051,0.004570863],"genre_scores_gemma":[0.8373996,0.00001318439,0.16067079,0.0012069648,0.00019523366,0.000025453715,0.000025254494,0.000040074716,0.00042344155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596834,0.000052039275,0.000773481,0.0013466087,0.001189663,0.0006698695],"domain_scores_gemma":[0.9976326,0.00033583568,0.0004349631,0.0010180505,0.00036200936,0.00021652092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089958136,0.00056976476,0.00063673494,0.0007199051,0.00047354453,0.0009187521,0.0026560111,0.0002854109,0.00001622218],"category_scores_gemma":[0.00004172968,0.00056052895,0.00016728064,0.00051114045,0.00038609665,0.0012125359,0.0005251606,0.00070532074,0.000041197443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016433567,0.000023878278,0.000004434491,0.000058964208,0.000007034872,0.000004537955,0.0010454643,0.05398406,0.00038514702,0.0018610947,0.00010244852,0.9425213],"study_design_scores_gemma":[0.00024472384,0.000059875074,0.000008292492,0.0004914362,0.000007861131,0.000059144313,3.1454258e-7,0.97546846,0.0005175109,0.020359304,0.002167154,0.0006159266],"about_ca_topic_score_codex":0.000022866636,"about_ca_topic_score_gemma":0.00009656779,"teacher_disagreement_score":0.9419054,"about_ca_system_score_codex":0.00039905464,"about_ca_system_score_gemma":0.0006210428,"threshold_uncertainty_score":0.99968463},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010413473,0.00085628283,0.9814715,0.00053055363,0.0019883527,0.0023680944,0.000013529694,0.000926371,0.011741204],"genre_scores_gemma":[0.092771895,0.000033915356,0.90083236,0.0016089006,0.0019344793,0.00017993135,0.000010787381,0.00014743056,0.002480286],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929923,0.00008329597,0.001021802,0.0031732558,0.0013817206,0.0013476526],"domain_scores_gemma":[0.9945474,0.0007623185,0.0006411859,0.0032584378,0.0004962392,0.00029437873],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018329864,0.0010824597,0.001090637,0.0015568184,0.00040129654,0.0007837485,0.0069085835,0.00049802446,0.000021190612],"category_scores_gemma":[0.00020614607,0.0009781363,0.00035677673,0.000793271,0.0008640983,0.00032795334,0.0013218786,0.001146837,0.00003675031],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029489705,0.00007959037,0.0000328062,0.00039989263,0.00004205657,0.00021800378,0.0027259702,0.014210042,0.004784455,0.010535751,0.000587912,0.966354],"study_design_scores_gemma":[0.000839326,0.0007820859,0.000038231734,0.0015208686,0.0000360919,0.00090134784,5.720941e-7,0.23045366,0.10859554,0.6480518,0.005781525,0.002998941],"about_ca_topic_score_codex":0.000019000103,"about_ca_topic_score_gemma":0.00006311325,"teacher_disagreement_score":0.96335506,"about_ca_system_score_codex":0.00046470063,"about_ca_system_score_gemma":0.0008290407,"threshold_uncertainty_score":0.9992669},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009809563,0.0008651204,0.986535,0.00017695788,0.001254175,0.0007447917,0.000023472341,0.00019807223,0.010104321],"genre_scores_gemma":[0.0071566165,0.000041502815,0.9900564,0.0016327313,0.000652792,0.00002540934,0.000009338565,0.000046872912,0.00037832497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950924,0.00006138259,0.00076773454,0.0021618411,0.0010326114,0.00088404125],"domain_scores_gemma":[0.99685836,0.00028499775,0.00039903005,0.0018008888,0.0003689221,0.00028779084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075881265,0.0007199343,0.0009082385,0.00083051156,0.00061661407,0.00031789436,0.0020758554,0.00025977482,0.0000053092613],"category_scores_gemma":[0.00017715718,0.0006438979,0.00016058925,0.00093869993,0.0008204576,0.0013305342,0.0021627597,0.0007511161,0.000032877222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034339144,0.00010559283,0.000077291006,0.00029076077,0.00004926152,0.0004026979,0.013457476,0.16178404,0.000921713,0.22534327,0.00033194505,0.5972016],"study_design_scores_gemma":[0.00085375464,0.0005737412,0.000086184504,0.0030990345,0.000026275588,0.0021323743,0.000011602331,0.74869704,0.0055207927,0.024068536,0.21050179,0.0044288873],"about_ca_topic_score_codex":0.00011003545,"about_ca_topic_score_gemma":0.00005700658,"teacher_disagreement_score":0.5927727,"about_ca_system_score_codex":0.00043551493,"about_ca_system_score_gemma":0.00070838677,"threshold_uncertainty_score":0.99960124},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002331018,0.0009033398,0.99648005,0.00033152185,0.00037719164,0.00063130533,0.0000045361653,0.00016862953,0.00087029976],"genre_scores_gemma":[0.07813392,0.00009580242,0.9214009,0.00013676904,0.000065099135,0.00001830607,0.0000069380058,0.00002475433,0.00011752006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690217,0.000052371703,0.0006977255,0.001213065,0.0007137004,0.00042095006],"domain_scores_gemma":[0.99699616,0.0005583621,0.0006386303,0.0012285025,0.0004910519,0.00008730552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077683775,0.00041476433,0.00050061266,0.00033395924,0.0003613526,0.00028224287,0.0017614828,0.00020599845,0.000002670772],"category_scores_gemma":[0.00011224568,0.00032551645,0.00007515957,0.00032677702,0.0013729221,0.0006292242,0.0009981927,0.0005048053,0.0000016563018],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016127857,0.00003699183,0.0023173157,0.000047819587,0.000013577775,0.00001257238,0.00056426966,0.018945722,0.0000746318,0.0061767353,0.00000988671,0.97178435],"study_design_scores_gemma":[0.00016842577,0.000071582,0.0011896141,0.00021156692,0.0000049119108,0.000017330296,2.2847412e-7,0.8351943,0.0018451933,0.16078742,0.00017743399,0.00033203253],"about_ca_topic_score_codex":0.000035401292,"about_ca_topic_score_gemma":0.0005377485,"teacher_disagreement_score":0.9714523,"about_ca_system_score_codex":0.00044177132,"about_ca_system_score_gemma":0.00023171397,"threshold_uncertainty_score":0.9999197},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4737789,0.000057760146,0.52569103,0.00014287661,0.00019403089,0.00010165287,4.226063e-7,0.00001838588,0.000014896522],"genre_scores_gemma":[0.84156567,0.0000020499713,0.15810844,0.00021383337,0.00010024902,0.0000013202143,4.827593e-7,0.000007695989,2.8374805e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864686,0.000031510375,0.00024630333,0.00035145495,0.00039551166,0.00032834194],"domain_scores_gemma":[0.9992864,0.000087332126,0.000087295855,0.00035414443,0.0001380931,0.00004670227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023354235,0.00013603558,0.00018705403,0.00035073207,0.00017558005,0.00004479816,0.00025508262,0.00004302243,8.5708257e-7],"category_scores_gemma":[0.00006471517,0.000089922745,0.00011047273,0.0022892675,0.0006228518,0.00013931702,0.000095857584,0.00024642888,3.729559e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025316222,0.000082573555,0.15596835,0.00003543383,0.0000044071544,0.0000018966192,0.00033146163,0.77980405,0.05818231,0.000014534677,0.000001799728,0.0055478727],"study_design_scores_gemma":[0.0003402508,0.00008053781,0.019921923,0.0003212403,0.000019866422,0.00011134753,0.0000015845459,0.96389157,0.01212218,0.0030649789,0.000010896035,0.00011360035],"about_ca_topic_score_codex":0.0003513264,"about_ca_topic_score_gemma":0.000024370709,"teacher_disagreement_score":0.36778674,"about_ca_system_score_codex":0.000041739502,"about_ca_system_score_gemma":0.00012894598,"threshold_uncertainty_score":0.3666943},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005323074,0.0021026349,0.9946677,0.0002984753,0.0012735327,0.00033759832,0.000001877405,0.0002606709,0.0005251988],"genre_scores_gemma":[0.11120994,0.000020479894,0.8859847,0.0022334792,0.00041357463,0.0000047240533,0.000009176379,0.000013283293,0.00011059908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998035,0.00001943955,0.00034078088,0.000661156,0.0006094495,0.00033417132],"domain_scores_gemma":[0.9987896,0.00006330122,0.00020998727,0.00056952453,0.00025686232,0.00011070981],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044123174,0.0003251314,0.00024419546,0.0009685845,0.0002107862,0.0009591287,0.0009966634,0.00023744167,0.0000057496823],"category_scores_gemma":[0.000093471936,0.00029520094,0.00004081046,0.00052749907,0.00013386983,0.0027232363,0.00061322097,0.0005706596,0.000009398844],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002828016,0.000005303961,0.000007158186,0.000019911575,0.0000021355422,0.00001918307,0.0008552104,0.0013616385,0.0045976364,0.0044958866,0.000021772617,0.98861134],"study_design_scores_gemma":[0.00014133194,0.00009631392,0.000025935464,0.0004134906,0.000008402408,0.00041671155,7.9832614e-7,0.9484707,0.015264256,0.031956438,0.0024349403,0.00077065337],"about_ca_topic_score_codex":0.00007302057,"about_ca_topic_score_gemma":0.00007508238,"teacher_disagreement_score":0.98784065,"about_ca_system_score_codex":0.00032269087,"about_ca_system_score_gemma":0.00029133674,"threshold_uncertainty_score":0.99995},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017539048,0.00008546042,0.9945815,0.00056601776,0.0012055368,0.00028017524,0.0000035498026,0.00028790484,0.0028144708],"genre_scores_gemma":[0.06515518,0.0000021059536,0.93251055,0.0013670909,0.0006541003,0.0000080201935,0.0000085085185,0.000046218913,0.00024822558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956588,0.00003245816,0.0004438367,0.0017553315,0.0012158585,0.0008937276],"domain_scores_gemma":[0.9971521,0.0005263829,0.00041802914,0.0014587871,0.00020221375,0.00024249348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012555382,0.00062312547,0.0005370053,0.0008159925,0.00055206346,0.00096868933,0.003188924,0.00032096487,0.000040932086],"category_scores_gemma":[0.00010608754,0.0005138028,0.00011199023,0.0004883233,0.00066864863,0.00043055986,0.00059676525,0.00217118,0.000038850365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048776974,0.00001561782,0.000097963704,0.00003996969,0.000008172726,0.00008391134,0.0006461257,0.041344896,0.0009305554,0.0025135686,0.0000012862835,0.95431304],"study_design_scores_gemma":[0.0005095842,0.00034229498,0.000083603365,0.0004936919,0.000009827051,0.00008955579,3.496256e-7,0.9831012,0.002635853,0.009327758,0.002428783,0.000977531],"about_ca_topic_score_codex":0.0000672293,"about_ca_topic_score_gemma":0.000101741054,"teacher_disagreement_score":0.9533355,"about_ca_system_score_codex":0.00014935296,"about_ca_system_score_gemma":0.0010481788,"threshold_uncertainty_score":0.99973136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026817946,0.000992356,0.98309267,0.0013818865,0.0027797373,0.0004731199,0.0000015621896,0.00029864305,0.010711858],"genre_scores_gemma":[0.25634933,0.0015558334,0.73405194,0.0059945313,0.0010252817,0.000054515214,0.000019488982,0.000060940947,0.00088813086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955768,0.000059258073,0.0005301271,0.001658255,0.001253145,0.00092242355],"domain_scores_gemma":[0.9982292,0.00023022831,0.00026703704,0.0010371063,0.00008601037,0.00015042785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005073676,0.0005525143,0.0006093642,0.00070267246,0.00040440523,0.00022279684,0.0036437206,0.0003859269,0.000046015743],"category_scores_gemma":[0.000046211913,0.00049217936,0.00014469468,0.00053071947,0.0012360102,0.000648545,0.0028734,0.00086792937,0.00012818846],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008648968,0.000086453096,0.0003343192,0.000093108785,0.000052293053,0.0019392474,0.0039786394,0.00046897508,0.000023241928,0.022071859,0.00034401342,0.9705992],"study_design_scores_gemma":[0.003870418,0.0025620998,0.012072053,0.0027315996,0.00010397476,0.0029246593,0.000011403576,0.5133763,0.0014746573,0.24673037,0.20848979,0.0056527136],"about_ca_topic_score_codex":0.000104309445,"about_ca_topic_score_gemma":0.000056879722,"teacher_disagreement_score":0.9649465,"about_ca_system_score_codex":0.00033015566,"about_ca_system_score_gemma":0.00015445612,"threshold_uncertainty_score":0.999753},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01662658,0.0006766191,0.97826624,0.00004719215,0.0018053693,0.00035035663,0.00005318287,0.00003340324,0.0021410391],"genre_scores_gemma":[0.68466645,0.00010222644,0.3090353,0.0014539717,0.0039735227,0.0000048172856,0.000115797564,0.00011580103,0.0005320819],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975165,0.000035606663,0.0003870653,0.0010638988,0.00049387326,0.0005030324],"domain_scores_gemma":[0.998811,0.000058785285,0.00018952128,0.00063843565,0.00015885069,0.00014339968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005049262,0.00042280668,0.0003241477,0.00034925656,0.00022308355,0.00012281693,0.0006906561,0.0007757125,0.000105886276],"category_scores_gemma":[0.00009337895,0.00039664545,0.00013076917,0.00014987406,0.00036464026,0.00001609596,0.0004033623,0.0006853515,0.0000063695884],"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.000045042725,0.000008343343,0.000022919952,0.00003482099,0.000023729,0.00002634416,0.000042230782,0.0028999478,0.73661256,0.00031129507,0.00001735225,0.2599554],"study_design_scores_gemma":[0.0005920724,0.0006019733,0.000092133494,0.0005466471,0.000044011427,0.00028809375,2.9948217e-7,0.032369833,0.9119046,0.043000534,0.00939244,0.0011673782],"about_ca_topic_score_codex":0.000009356705,"about_ca_topic_score_gemma":0.000024236157,"teacher_disagreement_score":0.66923094,"about_ca_system_score_codex":0.00010002795,"about_ca_system_score_gemma":0.00040497532,"threshold_uncertainty_score":0.99984854},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000045725387,0.00029336894,0.991691,0.0031971813,0.0019811532,0.0009440011,0.00002520451,0.00014778435,0.0017157488],"genre_scores_gemma":[0.017671043,0.000058972073,0.9800211,0.0017946408,0.00029538927,0.000032991513,0.0000073644956,0.000024369243,0.00009411295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997114,0.000023496214,0.0005155345,0.0011326076,0.0006781652,0.0005361731],"domain_scores_gemma":[0.9972907,0.0009111477,0.00028431247,0.0010469286,0.00032962268,0.0001372914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007726546,0.00043664002,0.00038592968,0.0004124089,0.00050985476,0.0006101515,0.0019348724,0.00026155156,0.00012298992],"category_scores_gemma":[0.000055617787,0.00033493465,0.00019597363,0.00041477047,0.0015890846,0.00034618456,0.00045514826,0.00055468146,0.000017068984],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012129296,0.000008701443,0.0000037940895,0.000008694961,0.000011719655,0.000014039982,0.0003369137,0.010915785,0.0000061671967,0.16593629,0.000008148421,0.82274854],"study_design_scores_gemma":[0.00050478097,0.00010181164,0.00004632985,0.00016864174,0.000011401553,0.00012705947,0.0000011705315,0.6468995,0.00010283124,0.34949607,0.0021005594,0.000439836],"about_ca_topic_score_codex":0.000019343517,"about_ca_topic_score_gemma":0.00008948966,"teacher_disagreement_score":0.8223087,"about_ca_system_score_codex":0.00037670284,"about_ca_system_score_gemma":0.0014950725,"threshold_uncertainty_score":0.9999103},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000358831,0.0015273911,0.98854345,0.0005623917,0.0065161237,0.0015990555,0.000012240495,0.00015787891,0.001045614],"genre_scores_gemma":[0.07460942,0.00022534537,0.9139712,0.0060298177,0.0016488311,0.00024538,0.00004475011,0.00016618578,0.0030590747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955151,0.000096027565,0.0008183231,0.0017876942,0.0010201978,0.00076262676],"domain_scores_gemma":[0.99697083,0.0004277234,0.0005256757,0.0015370302,0.00030639523,0.00023233511],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014075333,0.00066756335,0.00069939793,0.00084827986,0.00026973203,0.0007865617,0.0024460175,0.0003748554,0.000009628593],"category_scores_gemma":[0.00008991747,0.0005720111,0.00025445412,0.00047729188,0.00020474925,0.0003350826,0.00051964994,0.00055338134,0.000036256864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010968186,0.0000756331,0.000018537234,0.00036957013,0.00005279476,0.000052057207,0.0027004231,0.49983984,0.0006452066,0.07713513,0.00055447797,0.41854537],"study_design_scores_gemma":[0.00047119142,0.00028897854,0.000025268548,0.0006687993,0.00001874518,0.00014923108,6.5529537e-7,0.909865,0.0018083316,0.033626243,0.05188951,0.0011880369],"about_ca_topic_score_codex":0.000028888759,"about_ca_topic_score_gemma":0.000053725365,"teacher_disagreement_score":0.41735733,"about_ca_system_score_codex":0.00044054497,"about_ca_system_score_gemma":0.00039829678,"threshold_uncertainty_score":0.9996731},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012801163,0.00070584385,0.99552137,0.00010528925,0.00039023027,0.00024264673,0.000014041554,0.00024809217,0.0014923841],"genre_scores_gemma":[0.6432874,0.00023620056,0.35573977,0.0002119825,0.00034904393,0.00000804647,0.0000054012658,0.00010244118,0.000059674618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818933,0.000010549851,0.00042482436,0.0005320298,0.00042764193,0.00041559854],"domain_scores_gemma":[0.99914354,0.00017187529,0.00010441182,0.00046670812,0.000052987823,0.00006047208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013993582,0.00044088764,0.0004937896,0.0007409532,0.000042908217,0.00006560418,0.0005967865,0.0001375053,0.00002604535],"category_scores_gemma":[0.000030231806,0.00039984673,0.00006925191,0.00015605394,0.0004203724,0.00028661772,0.00025288863,0.00059052504,0.0000025502784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017027634,0.00002494188,0.0001634254,0.00012369305,0.000009369282,0.0001413867,0.00034133004,0.29125252,0.021876333,0.00048028302,0.00001868706,0.685551],"study_design_scores_gemma":[0.00034422,0.00013954879,0.00048159895,0.002289956,0.00001574462,0.00015431178,7.881116e-7,0.5956874,0.34900126,0.049944006,0.00077835674,0.0011628432],"about_ca_topic_score_codex":0.000015664247,"about_ca_topic_score_gemma":0.000053536252,"teacher_disagreement_score":0.68438816,"about_ca_system_score_codex":0.00030369635,"about_ca_system_score_gemma":0.000039718285,"threshold_uncertainty_score":0.9998453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014535975,0.0005672591,0.99610424,0.00015055222,0.00095049065,0.0006024885,0.0000041514186,0.00035802575,0.0011174614],"genre_scores_gemma":[0.005163068,0.00011972537,0.9926606,0.0013896354,0.00026853848,0.000013814621,0.0000085019865,0.00003670893,0.00033940485],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99570924,0.00007020882,0.0007100184,0.0014742363,0.001419474,0.00061684824],"domain_scores_gemma":[0.9977081,0.00041959403,0.00042685232,0.0009744561,0.0002498191,0.00022120897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070052355,0.0005094143,0.0004940628,0.00089780305,0.0004432317,0.0005167032,0.002089856,0.00027990073,0.00007150474],"category_scores_gemma":[0.00013339816,0.00050061557,0.00012876495,0.0005493956,0.0011761459,0.0013798294,0.0010578467,0.000730131,0.00004792824],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038953804,0.000047181376,0.00004107445,0.00006200752,0.000014111194,0.00020920845,0.003319644,0.00090592384,0.020499954,0.00017265663,0.000057744644,0.9746666],"study_design_scores_gemma":[0.00085904106,0.00039073374,0.00027475102,0.0017425953,0.000024398769,0.000518918,0.000002638686,0.42755058,0.5441497,0.022133172,0.0004110769,0.0019423879],"about_ca_topic_score_codex":0.00004475635,"about_ca_topic_score_gemma":0.00005412392,"teacher_disagreement_score":0.9727242,"about_ca_system_score_codex":0.00065103394,"about_ca_system_score_gemma":0.00086707016,"threshold_uncertainty_score":0.99974453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011730739,0.0017999976,0.9945111,0.00012493624,0.0011114166,0.00034517766,0.0000030911003,0.00039056788,0.0015963505],"genre_scores_gemma":[0.103809334,0.00017371181,0.89371806,0.0012182468,0.00085877755,0.000004200528,0.000002856702,0.000054609616,0.00016018595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601865,0.000035574816,0.00053950574,0.0014152377,0.0009890193,0.0010019976],"domain_scores_gemma":[0.9975049,0.00029935632,0.0002365525,0.0014714866,0.00024218205,0.00024554462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086429255,0.0006134966,0.0005889683,0.0008472403,0.00034495015,0.0004946914,0.003272338,0.00037323765,0.000044859768],"category_scores_gemma":[0.00009771953,0.0005725428,0.00017571381,0.0006730783,0.0007708837,0.0022028147,0.0020440728,0.0009855899,0.000049475337],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027610674,0.00001998717,0.000051692812,0.000026216523,0.0000064290452,0.000054267424,0.00077455555,0.0011220663,0.002071436,0.013965601,0.000006307996,0.98189867],"study_design_scores_gemma":[0.0005468872,0.00049636746,0.00025472802,0.0016450658,0.000041339892,0.000814511,0.0000010805169,0.48849282,0.04422356,0.44848096,0.011308056,0.0036946323],"about_ca_topic_score_codex":0.00001862826,"about_ca_topic_score_gemma":0.000006959753,"teacher_disagreement_score":0.9782041,"about_ca_system_score_codex":0.0004890941,"about_ca_system_score_gemma":0.0003601904,"threshold_uncertainty_score":0.9996726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000865601,0.00039824363,0.9951022,0.00050368824,0.0016901899,0.0003869808,0.000031967964,0.0003784226,0.0014996503],"genre_scores_gemma":[0.0044595865,0.000076483586,0.9901749,0.0016814072,0.0006086017,0.000008211502,0.00010637946,0.0000558125,0.002828603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953261,0.000029802555,0.00058664475,0.0018707437,0.0012421155,0.0009445774],"domain_scores_gemma":[0.9968169,0.00023626321,0.00032180114,0.00218456,0.00021295276,0.00022754369],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012824748,0.0006518062,0.00055233744,0.000839938,0.0003444459,0.0010850895,0.005322744,0.0003068572,0.000021824562],"category_scores_gemma":[0.0000969463,0.0005970989,0.00015459869,0.00092216244,0.00088444544,0.0012088146,0.0032441516,0.0007604985,0.00009077527],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004233373,0.000047404348,0.00004705414,0.00004136461,0.000018414092,0.00027444048,0.0003117995,0.0056493254,0.00002624764,0.029633554,0.00017711545,0.963769],"study_design_scores_gemma":[0.0005481323,0.0001687639,0.00027024475,0.00042088295,0.000016379548,0.000057697787,5.2642577e-7,0.86615884,0.0006605555,0.038673785,0.09164576,0.0013784106],"about_ca_topic_score_codex":0.000033358865,"about_ca_topic_score_gemma":0.00006729838,"teacher_disagreement_score":0.96239066,"about_ca_system_score_codex":0.00025976152,"about_ca_system_score_gemma":0.00022088438,"threshold_uncertainty_score":0.9999519},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074770255,0.000740048,0.99033666,0.0019645216,0.0012116975,0.00076089974,0.0000868535,0.00024720017,0.0039043953],"genre_scores_gemma":[0.07713414,0.0001108574,0.913584,0.0073966673,0.0013034915,0.000019723582,0.0000832469,0.0000664097,0.000301494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933122,0.0000520266,0.0006958656,0.0029238367,0.0019135516,0.0011025146],"domain_scores_gemma":[0.99549466,0.0003570308,0.0003581407,0.0029387858,0.00034100004,0.0005104086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006842424,0.0009734763,0.00085035415,0.0009910017,0.0003661693,0.0009922903,0.0053797043,0.0003952851,0.00010710815],"category_scores_gemma":[0.000050526156,0.0008199803,0.0001896056,0.0016615562,0.00047227164,0.0010822205,0.0018951166,0.0010158836,0.00017411039],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000653195,0.0001578988,0.00027582483,0.000035853576,0.000052935884,0.00042143275,0.0016237596,0.005412642,0.00026770262,0.019774934,0.0009579178,0.97095376],"study_design_scores_gemma":[0.0045151175,0.005548126,0.0088744145,0.007034416,0.00017302234,0.00047074546,0.0000040947934,0.14227356,0.010009805,0.55603147,0.25488758,0.010177636],"about_ca_topic_score_codex":0.00026059494,"about_ca_topic_score_gemma":0.00082998973,"teacher_disagreement_score":0.96077615,"about_ca_system_score_codex":0.00017648608,"about_ca_system_score_gemma":0.00054617086,"threshold_uncertainty_score":0.9996919},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002996581,0.00025440173,0.99057794,0.0020768568,0.0018362921,0.00040225097,0.00055242423,0.00021970247,0.004050155],"genre_scores_gemma":[0.12604654,0.00024530975,0.85336244,0.016869962,0.0017942337,0.000024346155,0.0011666275,0.00012836228,0.0003621853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99482757,0.00005768677,0.0006778544,0.0021707811,0.0014708916,0.0007952308],"domain_scores_gemma":[0.99664783,0.00059899804,0.00016258124,0.0019596438,0.00022624199,0.00040468227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074416667,0.00071663153,0.00056340767,0.00089660764,0.00033486393,0.00070060324,0.0035820042,0.0004890473,0.000059098355],"category_scores_gemma":[0.000105757455,0.0006591347,0.0002648066,0.0012312799,0.00047802113,0.00071187573,0.00044170037,0.0012655563,0.000068256726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006735236,0.00012068984,0.000015388361,0.000037174625,0.00003847773,0.0003269925,0.00088826055,0.013421086,0.00004005074,0.7590229,0.004789143,0.2212325],"study_design_scores_gemma":[0.0015342544,0.00066746405,0.00030518018,0.00058185705,0.000020440079,0.00014816195,1.7948649e-7,0.018413661,0.0009509249,0.921963,0.05385612,0.0015587633],"about_ca_topic_score_codex":0.00003161705,"about_ca_topic_score_gemma":0.00020649651,"teacher_disagreement_score":0.21967374,"about_ca_system_score_codex":0.00022984933,"about_ca_system_score_gemma":0.00081021665,"threshold_uncertainty_score":0.999586},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005716199,0.000672845,0.98356897,0.00080424635,0.0017934673,0.0005483608,0.000005903788,0.00022801987,0.012372463],"genre_scores_gemma":[0.3748108,0.0008921203,0.60569704,0.010359486,0.003305658,0.00013156739,0.000025704474,0.00030736026,0.004470242],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939613,0.00008428581,0.00055075786,0.0022557224,0.001833165,0.0013147875],"domain_scores_gemma":[0.9959521,0.0008239489,0.00027866702,0.0023937502,0.00019039768,0.00036109504],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011121025,0.000742042,0.0006150002,0.0012785265,0.00041474172,0.00049035985,0.005708372,0.00044007177,0.00007055596],"category_scores_gemma":[0.000087076674,0.0006648352,0.00017958088,0.000946755,0.00094270066,0.000587113,0.0010518103,0.0017980126,0.00018280622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009759877,0.00007642309,0.00001771151,0.000022747825,0.000021752452,0.0004892639,0.00036688804,0.25167835,0.00004655478,0.28186882,0.00011165915,0.4652901],"study_design_scores_gemma":[0.00021146484,0.0003458397,0.000027342296,0.00030847627,0.0000029066482,0.000047122856,5.8177985e-8,0.4501351,0.00021512776,0.5475614,0.00050471013,0.0006404062],"about_ca_topic_score_codex":0.0000070047367,"about_ca_topic_score_gemma":0.000013125148,"teacher_disagreement_score":0.46464968,"about_ca_system_score_codex":0.00059449073,"about_ca_system_score_gemma":0.00021177028,"threshold_uncertainty_score":0.9996712},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009812762,0.0008392099,0.99207664,0.00025640952,0.0008398558,0.0007079721,0.000027562599,0.00024367457,0.004027379],"genre_scores_gemma":[0.8055206,0.00020648581,0.19267625,0.0006544897,0.00047401147,0.000028769613,0.000014839641,0.000098234275,0.00032634547],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99323183,0.00010069259,0.00075356115,0.0027736963,0.0017971636,0.0013430256],"domain_scores_gemma":[0.9953023,0.0010319666,0.00031652278,0.0023936841,0.00036686868,0.0005886247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018862116,0.00088131445,0.0008866345,0.0013700869,0.00045218994,0.0006871373,0.005337762,0.0005656894,0.000040008705],"category_scores_gemma":[0.00016598286,0.0008087526,0.0001609219,0.00087660976,0.0017921332,0.0011350411,0.004295896,0.0018900105,0.00007081155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007523116,0.000038749924,0.0037970378,0.000031201198,0.000025351917,0.0003606939,0.0010152158,0.0006388796,0.000078734636,0.031093396,0.000010529609,0.96290267],"study_design_scores_gemma":[0.00044607674,0.0006281747,0.0071351374,0.0005144621,0.000023213595,0.00024568907,5.8121856e-7,0.040308923,0.0011243589,0.9466272,0.0012476345,0.0016985408],"about_ca_topic_score_codex":0.00003142437,"about_ca_topic_score_gemma":0.00009843513,"teacher_disagreement_score":0.9612042,"about_ca_system_score_codex":0.00027148487,"about_ca_system_score_gemma":0.0005843672,"threshold_uncertainty_score":0.9994363},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015560708,0.0001568361,0.9700243,0.0003196973,0.00045834453,0.0007052979,0.000009406707,0.00012680372,0.026643233],"genre_scores_gemma":[0.5357531,0.0000118596045,0.4626636,0.0008666261,0.00038874266,0.0000143726575,0.00003266766,0.000044491117,0.00022457216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939305,0.00008182428,0.0006973086,0.0014889926,0.00307742,0.00072396285],"domain_scores_gemma":[0.9967543,0.00022991931,0.00046328982,0.001703286,0.0006685138,0.00018072744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003406246,0.0005625046,0.0005827609,0.00096808036,0.0002221084,0.00021723851,0.0035996425,0.00028030135,0.0000054671227],"category_scores_gemma":[0.000017870296,0.00046960698,0.000099446355,0.0011976028,0.00041250864,0.00026599228,0.0011322214,0.00089258316,0.000011979214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017912877,0.000021636863,0.000023571598,0.00011544909,0.00001749856,0.0000137543475,0.00052703073,0.6713075,0.000005197606,0.0035738354,0.000010886396,0.32436574],"study_design_scores_gemma":[0.00053597917,0.00017997576,0.00024256024,0.0010976549,0.000035963647,0.000085305706,3.2467528e-7,0.9833447,0.00010156046,0.013055827,0.00079373043,0.0005264534],"about_ca_topic_score_codex":0.000010021106,"about_ca_topic_score_gemma":0.00005467414,"teacher_disagreement_score":0.534197,"about_ca_system_score_codex":0.00028542292,"about_ca_system_score_gemma":0.000598399,"threshold_uncertainty_score":0.9997756},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031373583,0.00009098835,0.9913094,0.002012379,0.0023470202,0.00037823568,0.000008397866,0.00021958651,0.0033202334],"genre_scores_gemma":[0.057853226,0.000050587172,0.9354115,0.0027248343,0.00075343717,0.000014541863,0.000013573187,0.000042566808,0.0031357163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960805,0.000021765192,0.00042338014,0.0010846832,0.0015637691,0.00082589744],"domain_scores_gemma":[0.99731845,0.00022118923,0.0002532841,0.0014703958,0.00044310416,0.00029355235],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009277873,0.0005073434,0.00044973067,0.00089726015,0.000408863,0.0014226801,0.0044719246,0.00050468586,0.00006843216],"category_scores_gemma":[0.000099031065,0.00043162156,0.0001787402,0.00062372716,0.0008496505,0.001431392,0.0016762578,0.0017476262,0.00018962045],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007142912,0.00003295868,0.000038989772,0.00003698564,0.000008355362,0.00014016798,0.0011652107,0.004180811,0.0009119074,0.039249938,0.000056590598,0.95417094],"study_design_scores_gemma":[0.0008460939,0.00064442796,0.0006193101,0.0003024338,0.000017965462,0.00041159874,6.238252e-7,0.8435633,0.018754061,0.043339282,0.089071564,0.002429318],"about_ca_topic_score_codex":0.000010206088,"about_ca_topic_score_gemma":0.0000258597,"teacher_disagreement_score":0.95174164,"about_ca_system_score_codex":0.00018727194,"about_ca_system_score_gemma":0.00073937903,"threshold_uncertainty_score":0.99981356},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002468415,0.00004361019,0.9952947,0.0004745417,0.0013394388,0.0020699576,0.000031248022,0.00010134594,0.00039829704],"genre_scores_gemma":[0.0034530242,0.000015277848,0.9953648,0.0002241688,0.0002868221,0.00013232508,0.000074550415,0.000070998416,0.00037805087],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963207,0.00006958407,0.0010932909,0.001170031,0.0008392408,0.0005071488],"domain_scores_gemma":[0.9959701,0.0019318493,0.00079105375,0.00081588916,0.00038151816,0.00010959064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003395049,0.00044940965,0.0005538221,0.0006408033,0.00016746187,0.00016059539,0.0009123422,0.0005719819,0.00003424705],"category_scores_gemma":[0.0017039097,0.00043146446,0.00011537885,0.00053548964,0.00055459864,0.00027863277,0.0002756475,0.0009766663,0.000029285628],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010846166,0.00072798296,0.00007086761,0.0018893987,0.000039995313,0.00000916276,0.004464241,0.07949802,0.04900272,0.11264811,0.00038462065,0.7511564],"study_design_scores_gemma":[0.00030651034,0.00006673748,0.0000017231038,0.00024158762,0.000014188782,0.0000031910324,4.56138e-7,0.49315083,0.010317964,0.49452648,0.0010619535,0.00030838992],"about_ca_topic_score_codex":0.000021092168,"about_ca_topic_score_gemma":0.00007843035,"teacher_disagreement_score":0.75084805,"about_ca_system_score_codex":0.00045934579,"about_ca_system_score_gemma":0.00021063819,"threshold_uncertainty_score":0.99981374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017603438,0.0008551244,0.9948241,0.0002690798,0.0011638901,0.0007252183,0.0000068806185,0.000298883,0.000096448086],"genre_scores_gemma":[0.2252125,0.00017612365,0.7734994,0.0005351033,0.0004350344,0.00003886257,0.0000049502005,0.000035607758,0.00006236281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965937,0.000022752301,0.0006058858,0.0014580945,0.00068466883,0.0006348626],"domain_scores_gemma":[0.9974748,0.00077901536,0.00030629605,0.0010647068,0.00020878272,0.00016639988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065954827,0.0005037513,0.00055156637,0.00042097564,0.0006218639,0.0004354835,0.0014777676,0.00049782085,0.0000021488502],"category_scores_gemma":[0.00015533819,0.00043761177,0.0001131081,0.00035413186,0.00049877487,0.0018561431,0.0007861781,0.00068136497,0.0000028769234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016107986,0.000023796341,0.000938664,0.0005899925,0.000016661555,0.000019446064,0.005867618,0.26680642,0.000012630532,0.009904093,0.00002567469,0.7157789],"study_design_scores_gemma":[0.0001780347,0.00013268791,0.00009650399,0.0007564387,0.000004794178,0.00008701206,3.0073736e-7,0.89443827,0.00041284747,0.10326445,0.00011555137,0.00051310647],"about_ca_topic_score_codex":0.00001622294,"about_ca_topic_score_gemma":0.000009522872,"teacher_disagreement_score":0.71526575,"about_ca_system_score_codex":0.00019475727,"about_ca_system_score_gemma":0.0005035494,"threshold_uncertainty_score":0.99980754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007769763,0.0005104035,0.97687876,0.0005723506,0.0025573594,0.00037133094,0.000004755908,0.00036136003,0.018665997],"genre_scores_gemma":[0.0549556,0.000094967945,0.941342,0.002433544,0.0007337556,0.000007779273,0.0000067821043,0.00006515207,0.00036043103],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940795,0.000049211605,0.0007209412,0.0020992467,0.0017950719,0.0012560473],"domain_scores_gemma":[0.99620754,0.0007499749,0.00028860156,0.0021303992,0.00025704375,0.0003664353],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021236078,0.00071266224,0.0006584503,0.0022395193,0.0005852316,0.00091030047,0.0057541975,0.00037291757,0.000044743858],"category_scores_gemma":[0.000096164826,0.00068167126,0.0003202216,0.0014069887,0.0014044743,0.0007882812,0.0029720499,0.0018321845,0.000090602065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030646138,0.00002588117,0.000015566473,0.000024505194,0.000010252926,0.00017921533,0.00046896152,0.0063040163,0.000027029284,0.26724395,0.000008465089,0.7256891],"study_design_scores_gemma":[0.00018156892,0.000117193784,0.00011735912,0.0003204486,0.000004437387,0.00012518953,1.4310123e-7,0.3140184,0.00039528817,0.68190473,0.0021309073,0.000684301],"about_ca_topic_score_codex":0.00007777414,"about_ca_topic_score_gemma":0.00019230985,"teacher_disagreement_score":0.7250048,"about_ca_system_score_codex":0.00028967138,"about_ca_system_score_gemma":0.00048910896,"threshold_uncertainty_score":0.99962515},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028276178,0.0006800976,0.96982425,0.0020852273,0.0022476597,0.000334508,0.000003999579,0.00031335565,0.024482602],"genre_scores_gemma":[0.061866317,0.0012789277,0.907272,0.020213023,0.005352647,0.000034672656,0.00009960149,0.00021649757,0.0036663185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958694,0.000048119207,0.0005843036,0.0016252336,0.0011641671,0.0007087624],"domain_scores_gemma":[0.99752724,0.00020871704,0.00032340173,0.0014951641,0.00026474427,0.00018072757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004088555,0.00060366344,0.0004845236,0.0015785461,0.00043940792,0.00085475505,0.0036690577,0.00026180304,0.00009074634],"category_scores_gemma":[0.000016149464,0.0005683567,0.00012872054,0.0014255202,0.0003527194,0.0008477682,0.0013932541,0.0005788303,0.00009097975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038770463,0.000030876614,0.00007837148,0.000087701745,0.00001915521,0.00008389446,0.0032425472,0.11844982,0.0000728118,0.2107332,0.000052573843,0.6671452],"study_design_scores_gemma":[0.0002403103,0.00008880615,0.00008469195,0.00036965832,0.000011330641,0.000055423447,2.8798206e-7,0.5904512,0.00092416466,0.39165264,0.015318727,0.00080278306],"about_ca_topic_score_codex":0.00004707031,"about_ca_topic_score_gemma":0.00023138981,"teacher_disagreement_score":0.6663424,"about_ca_system_score_codex":0.00019452794,"about_ca_system_score_gemma":0.00019274847,"threshold_uncertainty_score":0.99967676},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008190136,0.00007729818,0.99362105,0.00033434422,0.0026595546,0.0006215557,0.000008235437,0.00038052362,0.0022892328],"genre_scores_gemma":[0.00101869,0.000028020106,0.9962631,0.0009992459,0.0004557205,0.000015937356,0.000023283963,0.00006780728,0.001128192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536204,0.00005250631,0.00063549884,0.0020532354,0.0011332674,0.00076345995],"domain_scores_gemma":[0.99643666,0.0004889663,0.00047249236,0.0017408959,0.0006142127,0.00024678893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006264314,0.0006994267,0.0005966485,0.0010367878,0.0004081708,0.00082062837,0.0031681347,0.00061379996,0.0001932972],"category_scores_gemma":[0.00026938983,0.0006903687,0.00016792583,0.00082235143,0.0012420279,0.001415981,0.0014038238,0.0013305624,0.00016934144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005039136,0.000029192943,0.0000018451688,0.000009294699,0.00001104907,0.000048671656,0.0002956554,0.8379529,0.00026862216,0.0022356058,0.0000039749025,0.15913817],"study_design_scores_gemma":[0.00038344774,0.000092177725,0.000004121856,0.00009237169,0.000008557586,0.00008890342,5.1783402e-8,0.94748294,0.0024673676,0.047983892,0.00065109733,0.00074504624],"about_ca_topic_score_codex":0.0000068956083,"about_ca_topic_score_gemma":0.000023179931,"teacher_disagreement_score":0.15839311,"about_ca_system_score_codex":0.00044330617,"about_ca_system_score_gemma":0.00071245106,"threshold_uncertainty_score":0.99955475},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003280805,0.00030909895,0.9950894,0.00068599335,0.000546488,0.0007617227,0.00005147606,0.00009567622,0.0024273295],"genre_scores_gemma":[0.11776478,0.000050785315,0.88019943,0.0011994337,0.0003700481,0.00003403463,0.000059180747,0.000023652074,0.00029865987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658394,0.000029445939,0.0004749673,0.0016414202,0.00076355936,0.0005066878],"domain_scores_gemma":[0.9979699,0.0005772809,0.0002857781,0.0007194097,0.00025165864,0.00019592574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012273035,0.00041906844,0.00046569706,0.0017931508,0.00030243382,0.0006406808,0.0015587953,0.00042736455,0.0000039681363],"category_scores_gemma":[0.000133265,0.00039954754,0.00011063028,0.0015253654,0.0005043978,0.00030386733,0.0005253138,0.00053312717,0.000019226341],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012467407,0.000030596148,0.0000033504193,0.000019659587,0.000008588876,0.0000033455522,0.00034058964,0.000107561966,0.000017861435,0.020345835,0.00008402315,0.97902614],"study_design_scores_gemma":[0.0010179782,0.00054417626,0.0014892687,0.00013410661,0.000029482702,0.00008853213,0.0000013778306,0.5145583,0.0010482955,0.47201747,0.0076853475,0.0013856549],"about_ca_topic_score_codex":0.0000127097455,"about_ca_topic_score_gemma":0.000024961933,"teacher_disagreement_score":0.97764045,"about_ca_system_score_codex":0.0002051899,"about_ca_system_score_gemma":0.00030455706,"threshold_uncertainty_score":0.9998456},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014202921,0.0001578773,0.99589235,0.0012956868,0.00052942993,0.00055208715,0.0000070817123,0.00022613854,0.001197327],"genre_scores_gemma":[0.09467085,0.000115940056,0.9022806,0.0008280273,0.000614203,0.000027179603,0.00002854552,0.000050175862,0.0013844206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676275,0.000024552906,0.00050707883,0.0012636728,0.0010386818,0.00040323797],"domain_scores_gemma":[0.99763834,0.0005977124,0.00033725007,0.0006896819,0.00059634424,0.00014067319],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009448529,0.00040080582,0.00037390343,0.00040910352,0.00025635326,0.0009466586,0.0013700457,0.00030593353,0.000013640454],"category_scores_gemma":[0.00030759268,0.00031514757,0.00006925706,0.00043293362,0.0010891864,0.0012438555,0.00038646892,0.0007130368,0.0000069923267],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001930672,0.00006910498,0.000042583106,0.00011335962,0.000011506136,0.000043637265,0.00020892704,0.0001491043,0.004123874,0.024232164,0.00006948861,0.9707432],"study_design_scores_gemma":[0.0012513647,0.0017073015,0.00068525545,0.0013677318,0.00001882257,0.0004054004,4.8333965e-7,0.71476513,0.14858988,0.124977246,0.0048890295,0.0013423337],"about_ca_topic_score_codex":0.00001922167,"about_ca_topic_score_gemma":0.000041108495,"teacher_disagreement_score":0.9694008,"about_ca_system_score_codex":0.0002716642,"about_ca_system_score_gemma":0.0004566672,"threshold_uncertainty_score":0.9999301},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010444759,0.0008124706,0.9870062,0.00014994146,0.00045382115,0.00043165096,0.000019285702,0.00014973806,0.00053215795],"genre_scores_gemma":[0.25416198,0.000048142407,0.7454946,0.00015016344,0.00006134645,0.000004367432,0.0000022150768,0.000021914775,0.00005524176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961777,0.000015260888,0.0007212287,0.0015830469,0.00088523026,0.0006175733],"domain_scores_gemma":[0.9972039,0.000282767,0.0006247309,0.0013321534,0.0004300178,0.00012645952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007641445,0.0004971411,0.0007953119,0.0016122733,0.0001935264,0.0003487638,0.0040692757,0.0003069823,0.00000803721],"category_scores_gemma":[0.00020143588,0.0004920496,0.00008790508,0.0017727803,0.00067537464,0.00067056325,0.0039209025,0.0005610132,9.2780357e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020392723,0.00005160759,0.001948434,0.00017925665,0.00007113843,0.000085305255,0.0024055347,0.18791346,0.0051937494,0.06069921,0.000040999315,0.7413909],"study_design_scores_gemma":[0.00031431863,0.00032539575,0.0004820191,0.0029957457,0.00001909659,0.000042290627,0.0000011066794,0.6334322,0.016749134,0.34465554,0.00019653875,0.00078658963],"about_ca_topic_score_codex":0.000052077616,"about_ca_topic_score_gemma":0.000039874336,"teacher_disagreement_score":0.74060434,"about_ca_system_score_codex":0.00018958644,"about_ca_system_score_gemma":0.00024364248,"threshold_uncertainty_score":0.9997531},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015201451,0.0004615101,0.98999155,0.0005584398,0.0010966435,0.00037220382,0.0000014128904,0.00016819955,0.0058299107],"genre_scores_gemma":[0.18911308,0.00012571922,0.80910444,0.0014143871,0.0001258152,0.0000061457918,0.0000037351838,0.000029955947,0.0000766973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99490035,0.00008073871,0.000737154,0.0020395613,0.0011985322,0.0010436464],"domain_scores_gemma":[0.99695295,0.0010320288,0.00029752168,0.0013754445,0.00012315008,0.00021887688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013947252,0.00067774387,0.0007343463,0.0011466269,0.00025719896,0.000847772,0.0041750045,0.00045483847,0.000017330245],"category_scores_gemma":[0.00020569049,0.0005889975,0.00018498984,0.0010153293,0.0006733923,0.00068312103,0.0012660599,0.0016377713,0.00008006548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067254628,0.000018846682,0.00003450164,0.0000064134215,0.0000025232384,0.00022907034,0.0005210861,0.33541587,0.0000017286733,0.0045564347,0.00000763089,0.6591992],"study_design_scores_gemma":[0.00030777854,0.000394288,0.00023120632,0.00039641216,0.000003966578,0.000102572776,2.523471e-7,0.7231306,0.00004891273,0.27409434,0.0006343333,0.0006553402],"about_ca_topic_score_codex":0.000022476777,"about_ca_topic_score_gemma":0.000031005624,"teacher_disagreement_score":0.6585438,"about_ca_system_score_codex":0.00036860342,"about_ca_system_score_gemma":0.00037456883,"threshold_uncertainty_score":0.99965614},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011857309,0.004733009,0.98975545,0.0005548657,0.0023637763,0.0009259915,0.000022301494,0.00022900762,0.00022985398],"genre_scores_gemma":[0.9496203,0.00050670054,0.047342673,0.000590844,0.001547337,0.0001539908,0.000026318012,0.000104056875,0.000107782886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981522,0.00001833984,0.00039605712,0.00064137485,0.0003072295,0.00048482086],"domain_scores_gemma":[0.9990299,0.00034655654,0.00010197149,0.00034092346,0.000062747684,0.00011792233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023491225,0.00045394088,0.00042949963,0.00031704002,0.00014981764,0.00025786983,0.00033805496,0.00032509802,0.000013627949],"category_scores_gemma":[0.00002776759,0.000406914,0.00012087987,0.00016782143,0.00015533918,0.00015143867,0.00008206036,0.0005560664,0.0000056443814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009400121,0.0000025930183,0.000025833215,0.00005697404,0.000011875835,0.0000016788562,0.00020783169,0.41849467,0.000030500238,0.000046131485,0.000022819777,0.5810897],"study_design_scores_gemma":[0.00030897337,0.00011125145,0.00014462389,0.0002937127,0.000018606168,0.000030388912,3.4587293e-7,0.95564836,0.000030342275,0.0032222534,0.039741747,0.00044938305],"about_ca_topic_score_codex":0.000006139657,"about_ca_topic_score_gemma":0.00075823313,"teacher_disagreement_score":0.9484346,"about_ca_system_score_codex":0.00020379691,"about_ca_system_score_gemma":0.000031507378,"threshold_uncertainty_score":0.9998383},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021972597,0.000053391806,0.9489333,0.00093340187,0.00016516876,0.00038801756,0.00001545432,0.00012327972,0.049168278],"genre_scores_gemma":[0.594489,0.000009765593,0.39497307,0.0013126564,0.00049351377,0.0000118393355,0.00000861292,0.00004595744,0.008655619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557525,0.00002753467,0.0007276701,0.0012982814,0.0019747242,0.00039653495],"domain_scores_gemma":[0.9953102,0.0021909303,0.0004442901,0.0013923183,0.0005274992,0.00013480365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001836386,0.0003621599,0.00043703723,0.0008158961,0.00030877517,0.0006124895,0.0020246012,0.0002470601,0.00055538956],"category_scores_gemma":[0.00034231893,0.00026090443,0.00010181513,0.00094781193,0.00065073883,0.00032784697,0.00049012527,0.000551118,0.00007301127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006251134,0.000010411487,0.00040754484,0.0000023114387,0.000002570999,0.000006164583,0.00008213014,0.18189134,0.000003813137,0.008332083,0.00007603482,0.80917937],"study_design_scores_gemma":[0.000109587534,0.000054871554,0.00038266476,0.00009065954,0.000004565555,0.000015438041,3.9282193e-7,0.7931635,0.000044011296,0.19622491,0.009589549,0.0003198784],"about_ca_topic_score_codex":0.000011145701,"about_ca_topic_score_gemma":0.00029935504,"teacher_disagreement_score":0.80885947,"about_ca_system_score_codex":0.00029553758,"about_ca_system_score_gemma":0.0002735983,"threshold_uncertainty_score":0.9999843},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033625608,0.0005902993,0.9926014,0.00025147345,0.00032364405,0.00032868332,0.000047156493,0.000034020988,0.0054870513],"genre_scores_gemma":[0.74256927,0.000038868504,0.25558916,0.0010484722,0.0003548516,0.000035729736,0.00001482849,0.00005065944,0.00029818222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981891,0.0000016836901,0.00044693524,0.0009203573,0.00010587491,0.00033605788],"domain_scores_gemma":[0.998855,0.00010238207,0.00036643978,0.00050491537,0.00009422751,0.00007705535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029617432,0.00027473157,0.0004214684,0.00033920445,0.00018508977,0.00012847694,0.00048993935,0.00015161064,0.000041742263],"category_scores_gemma":[0.00005575334,0.0002673091,0.000057594476,0.00038921408,0.00029987405,0.0001753248,0.00009878588,0.00037680496,0.000051475785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009245772,0.000029390343,0.0006190702,0.000042540105,0.000009805411,0.000004976033,0.0002931765,0.0072911712,0.000007069351,0.90773016,0.000002466732,0.08396093],"study_design_scores_gemma":[0.00025106152,0.0000965671,0.00095361134,0.00010260952,0.000003843352,0.000011224102,2.2136216e-7,0.09150466,0.000045793175,0.9043806,0.0021926798,0.00045712586],"about_ca_topic_score_codex":0.00010195715,"about_ca_topic_score_gemma":0.000098587414,"teacher_disagreement_score":0.742233,"about_ca_system_score_codex":0.00029049147,"about_ca_system_score_gemma":0.00012577647,"threshold_uncertainty_score":0.9999779},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039576036,0.00063806446,0.9931267,0.0003714008,0.003401497,0.00033205634,0.0000069619377,0.00025721523,0.0018265103],"genre_scores_gemma":[0.10177619,0.000037256836,0.89407235,0.002132294,0.0013617183,0.000015041011,0.000022211649,0.000066819084,0.0005160884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954384,0.0000584427,0.00065850746,0.0018091194,0.001064344,0.0009711972],"domain_scores_gemma":[0.9965268,0.0012646964,0.00041326464,0.0010874257,0.00050275296,0.00020510312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002302206,0.0006367843,0.00069155113,0.0011313341,0.0003719313,0.00058570586,0.0024006355,0.00051288167,0.0000076017477],"category_scores_gemma":[0.00023607047,0.0005908925,0.00025907398,0.00079613575,0.0004731373,0.0006701127,0.0006446929,0.0006819672,0.0000058656765],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017416438,0.000028173705,0.00009727945,0.00003089652,0.000014773405,0.00006224137,0.0002572444,0.0027622464,0.00008746843,0.048031393,0.000031490938,0.9485794],"study_design_scores_gemma":[0.0016484199,0.0011428309,0.002223564,0.0010221124,0.00003055948,0.00027313165,5.0509374e-7,0.50050914,0.025168272,0.4185301,0.04634642,0.0031049734],"about_ca_topic_score_codex":0.00006252126,"about_ca_topic_score_gemma":0.00042165726,"teacher_disagreement_score":0.9454744,"about_ca_system_score_codex":0.0002615477,"about_ca_system_score_gemma":0.0005436146,"threshold_uncertainty_score":0.99965423},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017024351,0.0002984736,0.9917954,0.00074671494,0.0034079668,0.00036139868,0.0000035171474,0.00027782528,0.0029384128],"genre_scores_gemma":[0.315445,0.000024661505,0.65293795,0.003153562,0.0047791223,0.000029189237,0.0000075732432,0.00014268384,0.023480235],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950585,0.000058381273,0.00047293882,0.002211605,0.0013085757,0.00089002325],"domain_scores_gemma":[0.99665797,0.00018163613,0.00041120817,0.0020012213,0.00044578128,0.0003022137],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008729144,0.00074471976,0.0006567103,0.0007887952,0.00071015774,0.0019149197,0.0045190677,0.0005803785,0.0000352069],"category_scores_gemma":[0.00004728959,0.00067005353,0.00020129436,0.00037587702,0.0006309487,0.0014637214,0.0011805864,0.0018850686,0.000053837077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059331815,0.00006230043,0.000046383007,0.000028480763,0.000029967137,0.00023730785,0.008990575,0.0016280018,0.008437257,0.48935562,0.000036751073,0.4911414],"study_design_scores_gemma":[0.0008671963,0.0025241128,0.0002605667,0.0022358114,0.000023537603,0.0004113771,0.000009785958,0.31086174,0.068764865,0.26282376,0.34541965,0.005797622],"about_ca_topic_score_codex":0.000118558695,"about_ca_topic_score_gemma":0.00009890138,"teacher_disagreement_score":0.4853438,"about_ca_system_score_codex":0.00030351468,"about_ca_system_score_gemma":0.00037115693,"threshold_uncertainty_score":0.9995751},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015172786,0.0012948711,0.98940223,0.0002412047,0.0011165857,0.00043647125,0.000014395504,0.00016232002,0.005814618],"genre_scores_gemma":[0.5406017,0.0013038716,0.4568646,0.00093577855,0.00018341276,0.000011749651,0.000010106696,0.000041384184,0.000047443325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931274,0.0001550793,0.0010766364,0.0027627044,0.0017040317,0.0011741669],"domain_scores_gemma":[0.99435675,0.0016604053,0.0005446163,0.0029114524,0.00022588884,0.00030086705],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017639064,0.00087937986,0.0012556191,0.0029901234,0.00031583224,0.00064095773,0.0058099814,0.0005701234,0.00007076536],"category_scores_gemma":[0.000243868,0.0007319504,0.0004814912,0.0039231223,0.0016955212,0.00059264805,0.0018766013,0.0015091257,0.00012884426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014761836,0.00006385436,0.0011169579,0.00001953696,0.00005426286,0.0005960611,0.0017364887,0.21886209,7.6599235e-7,0.015789786,0.00002986127,0.7617156],"study_design_scores_gemma":[0.0002858102,0.00012787494,0.0014230942,0.0001739565,0.000046702702,0.00007725775,1.4226656e-7,0.61706364,0.000016712755,0.37974784,0.00036734238,0.00066964625],"about_ca_topic_score_codex":0.00008502383,"about_ca_topic_score_gemma":0.00023302244,"teacher_disagreement_score":0.76104593,"about_ca_system_score_codex":0.00045519957,"about_ca_system_score_gemma":0.00049432914,"threshold_uncertainty_score":0.99956906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010375928,0.000094756,0.9870788,0.0012979031,0.00012879171,0.0008373977,0.000014214302,0.000060620485,0.000111601854],"genre_scores_gemma":[0.23860554,0.00003552708,0.7606916,0.00039125647,0.00017178907,0.000019749854,0.000024068977,0.000017231758,0.000043221855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881065,0.0000080774735,0.00034935537,0.00040595196,0.00026063374,0.00016531096],"domain_scores_gemma":[0.9992925,0.0001489776,0.00013672942,0.0002587458,0.00009621398,0.00006684143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031580916,0.00015827792,0.0003173952,0.00032543528,0.00004425079,0.000024075835,0.00014406395,0.00016084182,0.000015971797],"category_scores_gemma":[0.00019715539,0.00013902455,0.000041343472,0.00020688058,0.00043079627,0.000074974036,0.00006970901,0.0002747855,2.099595e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053500615,0.00007957071,0.000034308618,0.0004504715,0.0000072439016,0.000025327307,0.00020448418,0.00032364152,0.029228602,0.00073532236,0.000032755084,0.96882474],"study_design_scores_gemma":[0.0010440157,0.00046068346,0.0007491836,0.001997621,0.00004332557,0.00016632555,6.0711864e-7,0.87521416,0.043077867,0.07674818,0.00023425427,0.00026378524],"about_ca_topic_score_codex":0.0000373235,"about_ca_topic_score_gemma":0.000035393827,"teacher_disagreement_score":0.968561,"about_ca_system_score_codex":0.00013215833,"about_ca_system_score_gemma":0.00029943587,"threshold_uncertainty_score":0.56692564},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012159023,0.00014201552,0.9911679,0.00018413003,0.0016049857,0.0003175294,0.000013013067,0.0000927602,0.005261734],"genre_scores_gemma":[0.4039636,0.000052665266,0.59427696,0.0006700991,0.0006239545,0.0000087355065,0.000019359293,0.00004889138,0.00033569653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646115,0.000039547365,0.0006960848,0.0011661543,0.0010924784,0.000544585],"domain_scores_gemma":[0.9974348,0.0003522787,0.0005135286,0.0011334283,0.000381477,0.00018446444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067517115,0.00041253798,0.00046592535,0.001068448,0.00027474095,0.00023281548,0.002013227,0.0004997827,0.0000578605],"category_scores_gemma":[0.00010089213,0.00036670128,0.00015161477,0.000648195,0.0006392335,0.0007398972,0.00081267045,0.0006898011,0.000036745187],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021018843,0.000087433364,0.00020247123,0.0000689608,0.000012974148,0.000044372013,0.0008644592,0.0087875975,0.042653877,0.011499445,0.00006347877,0.9356939],"study_design_scores_gemma":[0.00051676185,0.00017061249,0.0014793334,0.0016062969,0.00001981405,0.00004851772,0.0000015823368,0.90386724,0.02554114,0.06208681,0.0036345518,0.0010273542],"about_ca_topic_score_codex":0.000025941841,"about_ca_topic_score_gemma":0.00003597319,"teacher_disagreement_score":0.9346666,"about_ca_system_score_codex":0.00019985664,"about_ca_system_score_gemma":0.0005416035,"threshold_uncertainty_score":0.99987847},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003731279,0.0005159724,0.9913459,0.0010187239,0.002361418,0.00023413597,0.00000874698,0.00019106489,0.0042867167],"genre_scores_gemma":[0.016139269,0.00013148921,0.97777957,0.0053033717,0.0003758225,0.000006904773,0.000018861849,0.000030385438,0.00021432275],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964759,0.00004883987,0.00047102734,0.0016293544,0.0008580068,0.00051689806],"domain_scores_gemma":[0.9979202,0.00034184198,0.00029768882,0.0010379871,0.00023954734,0.00016270518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005407275,0.00044595683,0.00039721394,0.0006141403,0.00026289263,0.00057435734,0.0019468581,0.00022666458,0.00007863413],"category_scores_gemma":[0.00013607542,0.00041546606,0.000111040215,0.0005352733,0.00045551787,0.0014500257,0.0005404193,0.0006896139,0.00016889929],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015583538,0.000010854803,0.000014927653,0.0000061672245,0.0000034825612,0.00003643087,0.00020044789,0.002086226,0.0002952471,0.0014469596,0.000026068743,0.9958716],"study_design_scores_gemma":[0.00021064539,0.00006752375,0.000053855245,0.00042135353,0.000005439177,0.000040145933,1.9962717e-7,0.3269471,0.0045570093,0.66406703,0.0030106301,0.0006190692],"about_ca_topic_score_codex":0.00003199215,"about_ca_topic_score_gemma":0.000026176704,"teacher_disagreement_score":0.99525255,"about_ca_system_score_codex":0.00027801417,"about_ca_system_score_gemma":0.00020614004,"threshold_uncertainty_score":0.9998297},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019404561,0.011856257,0.95988524,0.006175899,0.0033239066,0.0016163888,0.000038749633,0.00022346132,0.0149396695],"genre_scores_gemma":[0.9781503,0.00210682,0.015539527,0.0016968545,0.0020910613,0.000024081522,0.000007551606,0.000042930216,0.00034083807],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979485,0.000025142186,0.00025874216,0.0007247064,0.00045279926,0.0005900844],"domain_scores_gemma":[0.9984591,0.0006910316,0.00015505747,0.0003563474,0.00017899199,0.00015948017],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007666527,0.0003569339,0.00041527383,0.00032505312,0.0007193075,0.0013331779,0.0011159051,0.00030191592,0.000022447568],"category_scores_gemma":[0.00011754742,0.00026578957,0.00011173073,0.0001489044,0.0013575692,0.00077100703,0.00025557302,0.00031887184,0.0000065220647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073304977,0.000010120015,0.00004169968,0.000024397235,0.000012735285,0.0000039709957,0.017642796,0.0009822323,0.000015275198,0.21937078,0.00000422804,0.76188445],"study_design_scores_gemma":[0.00037145955,0.00007979114,0.00008959564,0.0005368621,0.000013450777,0.000005889416,0.000039001858,0.0018358277,0.00007955929,0.98095024,0.015488331,0.0005099849],"about_ca_topic_score_codex":0.00087498076,"about_ca_topic_score_gemma":0.0043566516,"teacher_disagreement_score":0.9762099,"about_ca_system_score_codex":0.00020818479,"about_ca_system_score_gemma":0.00058474013,"threshold_uncertainty_score":0.99997944},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020989482,0.0005729485,0.9950216,0.00027555367,0.0006862111,0.00032422107,0.000005255756,0.00009908586,0.0009161827],"genre_scores_gemma":[0.6551287,0.00015458526,0.34410146,0.00030185535,0.00019484223,0.000004632652,0.000006561388,0.000022505576,0.00008485342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733806,0.000032886106,0.00058197055,0.0010388577,0.00060151855,0.00040669492],"domain_scores_gemma":[0.9981392,0.0005006093,0.00042119462,0.0006371233,0.00015537118,0.00014649252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037582958,0.000390461,0.0005433205,0.0012421381,0.00014895812,0.00018265651,0.0012478653,0.00022483848,0.000006252611],"category_scores_gemma":[0.000114031405,0.0003626968,0.00009409438,0.0009436428,0.00083885423,0.000476773,0.000697188,0.00033726453,0.000004215228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008677173,0.00003004005,0.00007680551,0.00005299909,0.000011521125,0.000030313957,0.00078433123,0.014981184,0.00010200827,0.002494507,0.0000410335,0.9813866],"study_design_scores_gemma":[0.00058100297,0.00022932672,0.0007304613,0.00027399565,0.000010661187,0.00019933106,2.2500477e-7,0.97066575,0.0018420744,0.024425307,0.00041022117,0.0006316483],"about_ca_topic_score_codex":0.000028463242,"about_ca_topic_score_gemma":0.000011017602,"teacher_disagreement_score":0.9807549,"about_ca_system_score_codex":0.000120998804,"about_ca_system_score_gemma":0.00052496506,"threshold_uncertainty_score":0.9998825},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000070622686,0.0004523561,0.9620244,0.0017214996,0.0032487053,0.0007072277,0.000004575291,0.0003664423,0.031404164],"genre_scores_gemma":[0.5889812,0.00010238429,0.38321722,0.020554854,0.0046661356,0.000052367803,0.000015200943,0.00014150118,0.0022691383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99472386,0.00005132626,0.0005446909,0.0021687716,0.0011160381,0.0013953376],"domain_scores_gemma":[0.9965539,0.00062658644,0.0002620724,0.0017756111,0.00033026608,0.0004515438],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010585566,0.0007375786,0.0006660886,0.0012933081,0.0008117461,0.0007055143,0.0044616717,0.00039919824,0.000039419323],"category_scores_gemma":[0.00020753137,0.0006677349,0.00020331341,0.0012534357,0.0004401941,0.0004813692,0.0028133725,0.0010617934,0.0005564317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052444857,0.00008316571,0.00004004885,0.000022710276,0.000011080748,0.00015171478,0.002682778,0.017629145,0.000022826724,0.2065029,0.0002327914,0.7726156],"study_design_scores_gemma":[0.00053955044,0.0009618729,0.0005423823,0.0012693322,0.00001534294,0.00021908403,4.3890898e-7,0.7806597,0.00018319902,0.1956343,0.018054407,0.0019204197],"about_ca_topic_score_codex":0.000066380366,"about_ca_topic_score_gemma":0.0002533121,"teacher_disagreement_score":0.77069515,"about_ca_system_score_codex":0.00057935674,"about_ca_system_score_gemma":0.00037026664,"threshold_uncertainty_score":0.9995774},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001134119,0.0002519359,0.9934959,0.00009591012,0.0026023695,0.0013113329,0.0000040772275,0.00019141496,0.0009129527],"genre_scores_gemma":[0.75341594,0.000021013426,0.244757,0.00040561406,0.0005544587,0.000057711102,0.000012889679,0.00005013945,0.00072522997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948027,0.00012767217,0.0009206897,0.002148706,0.001205053,0.00079517136],"domain_scores_gemma":[0.99739766,0.00013582109,0.00038968198,0.0015457736,0.00020057375,0.00033049734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013546481,0.0006225879,0.000713896,0.0014950638,0.00024930123,0.0009549777,0.002619947,0.00043106728,0.0000074829322],"category_scores_gemma":[0.000059805076,0.0005830024,0.00011807335,0.00080865447,0.00013493065,0.000867089,0.00068978855,0.0006534294,0.00010229701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006465141,0.00021837393,0.00040831068,0.0001548407,0.000010880662,0.000041261344,0.008559265,0.8501452,0.0008369122,0.0039169467,0.00001977402,0.13568173],"study_design_scores_gemma":[0.00047980726,0.00012392465,0.00092218874,0.00054882944,0.0000043105465,0.00003789775,0.0000013414842,0.99612147,0.00012413795,0.00041406104,0.00052589504,0.000696158],"about_ca_topic_score_codex":0.00024871415,"about_ca_topic_score_gemma":0.00013739089,"teacher_disagreement_score":0.75228184,"about_ca_system_score_codex":0.0006823211,"about_ca_system_score_gemma":0.0001318632,"threshold_uncertainty_score":0.99966216},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020241254,0.0005558684,0.99419147,0.00052671094,0.0005555977,0.00058641605,0.000005567061,0.0004827605,0.0028931878],"genre_scores_gemma":[0.07828948,0.000106026964,0.91806984,0.0027719282,0.00041115965,0.000016236145,0.000004402255,0.000057567475,0.00027335284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99409443,0.000049854494,0.00083041174,0.002428661,0.0015448396,0.0010518249],"domain_scores_gemma":[0.9961856,0.00030982838,0.00033740682,0.0025235354,0.00023730038,0.00040630312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080154685,0.0008493769,0.00086590374,0.0018183689,0.00036903808,0.0008799173,0.004735611,0.00032708998,0.000115911804],"category_scores_gemma":[0.00007938177,0.00081050023,0.00026650605,0.0014109885,0.0004896864,0.001350065,0.0016064424,0.00083891023,0.0001261041],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008562523,0.00004396748,0.00001893735,0.000015009824,0.000016331647,0.00022751193,0.00036828403,0.07397829,0.0008479581,0.009247679,0.000028279725,0.91519916],"study_design_scores_gemma":[0.00035684803,0.00044768583,0.0000412519,0.0011348245,0.000046160116,0.0002626024,2.4457376e-7,0.4026644,0.016289279,0.55762875,0.01854985,0.002578116],"about_ca_topic_score_codex":0.000075337746,"about_ca_topic_score_gemma":0.000107774824,"teacher_disagreement_score":0.9126211,"about_ca_system_score_codex":0.00091422646,"about_ca_system_score_gemma":0.0005884468,"threshold_uncertainty_score":0.9994346},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008324743,0.0005681976,0.9764997,0.00086303847,0.0028968507,0.00048244142,0.0000013088751,0.00028550922,0.018394638],"genre_scores_gemma":[0.9022072,0.00005945205,0.09373523,0.0013131555,0.0010107857,0.00002167968,0.00001602599,0.000041997333,0.0015944762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996512,0.000044985187,0.0004927883,0.0013627363,0.0009686316,0.00061885593],"domain_scores_gemma":[0.9979713,0.00018423593,0.0003531936,0.0010851619,0.00028850132,0.000117601194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059442024,0.00048187227,0.00048473774,0.00047552225,0.00034477114,0.0006921153,0.0023585171,0.00037122107,0.000023503884],"category_scores_gemma":[0.000025971676,0.00043362947,0.0001403886,0.00058665505,0.00044255488,0.00094356784,0.0007153808,0.0005775319,0.00018724009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032908426,0.00007494943,0.000024385166,0.00007627167,0.000018227202,0.00011815692,0.0021408722,0.006687024,0.00009228016,0.6092873,0.00019856635,0.38127863],"study_design_scores_gemma":[0.00030691212,0.00022908802,0.000029013527,0.000090417954,0.000008166333,0.00013894924,1.7321915e-7,0.43121558,0.0007356936,0.5593763,0.007176098,0.00069358357],"about_ca_topic_score_codex":0.00005089405,"about_ca_topic_score_gemma":0.00002356488,"teacher_disagreement_score":0.90219885,"about_ca_system_score_codex":0.0003218442,"about_ca_system_score_gemma":0.00013423174,"threshold_uncertainty_score":0.99981153},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022001038,0.0016305208,0.99497336,0.00004722963,0.00047040678,0.0004825466,0.000035343655,0.000029881052,0.0021106896],"genre_scores_gemma":[0.97565174,0.00019175513,0.023641825,0.00017426143,0.00007664343,0.00002713334,0.000009342745,0.0000149211055,0.00021240105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973889,0.00003011713,0.0006568313,0.0009817422,0.00055740506,0.00038501437],"domain_scores_gemma":[0.9986004,0.00026502402,0.00028470045,0.00068811094,0.000052903084,0.00010881733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047477472,0.00036549268,0.0006001159,0.00040381416,0.00007777405,0.00017285025,0.0012142786,0.00021710833,0.000029310586],"category_scores_gemma":[0.00003551385,0.00033425345,0.00005979007,0.00031186533,0.00054322643,0.00035185122,0.00021113372,0.00043592803,0.000010042508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012680184,0.000063580526,0.00010105686,0.00006325284,0.000007544486,0.000043345444,0.0005891446,0.06421942,0.0004464223,0.009134901,0.000008550915,0.9253101],"study_design_scores_gemma":[0.0010409073,0.00030976316,0.00066447887,0.0011948091,0.00001113174,0.000043665004,4.803153e-7,0.957644,0.0006337253,0.03593188,0.0019065685,0.0006186245],"about_ca_topic_score_codex":0.000029837202,"about_ca_topic_score_gemma":0.000019719122,"teacher_disagreement_score":0.9754317,"about_ca_system_score_codex":0.00015795912,"about_ca_system_score_gemma":0.0001941036,"threshold_uncertainty_score":0.99991095},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007915275,0.0005918593,0.99346405,0.00009292749,0.0011876383,0.002093965,0.0000025355257,0.000058476642,0.0017169972],"genre_scores_gemma":[0.7706084,0.00007523803,0.22802812,0.00038768235,0.00050538365,0.00025523116,0.000014609454,0.000033879438,0.00009144098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552953,0.00011917606,0.000776213,0.0012104865,0.001744989,0.0006195854],"domain_scores_gemma":[0.9974372,0.00041353074,0.0005436723,0.0010431572,0.00049503794,0.00006740265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004702615,0.00039067448,0.00045550478,0.00060903287,0.00013369582,0.0003448413,0.0018907114,0.00020303176,0.00002962804],"category_scores_gemma":[0.000068344336,0.00039474637,0.000121929574,0.00080760976,0.00019541054,0.0006676729,0.00059697876,0.00031451002,0.0000065539452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019246347,0.000017077862,0.000042864456,0.000025050784,0.0000070008114,0.0000030805784,0.0003284981,0.6277798,0.0000051916163,0.0074421414,0.000057774716,0.3642896],"study_design_scores_gemma":[0.00038516638,0.00017642837,0.00016090467,0.00039770937,0.000023392031,0.0000018652513,6.368366e-7,0.8919441,0.00008011673,0.10600878,0.00051096664,0.00030990533],"about_ca_topic_score_codex":0.000042628122,"about_ca_topic_score_gemma":0.00049430487,"teacher_disagreement_score":0.7698169,"about_ca_system_score_codex":0.00073388894,"about_ca_system_score_gemma":0.0005609161,"threshold_uncertainty_score":0.99985045},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017232401,0.0005025006,0.99389094,0.00031735262,0.0018799982,0.0011620001,0.000009140899,0.00022234145,0.001843392],"genre_scores_gemma":[0.033189554,0.000013394391,0.96377504,0.0016552035,0.0008802101,0.000042598127,0.000008040464,0.00006495593,0.0003710053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952547,0.000129226,0.0005594567,0.0021602071,0.0009260071,0.00097040494],"domain_scores_gemma":[0.9956772,0.0011678961,0.00029449823,0.0021002977,0.00047974105,0.00028040598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022337828,0.00069355796,0.0007093855,0.00081532466,0.00045247117,0.00084639475,0.0048341746,0.00041542697,0.000022354985],"category_scores_gemma":[0.00027943988,0.0006265438,0.0002715298,0.000543636,0.0005153683,0.001508917,0.0011700918,0.0008170783,0.000022311668],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000441881,0.000047839236,0.000009166665,0.00009750054,0.000017386003,0.00026581786,0.0010185303,0.03949679,0.003444576,0.008152715,0.000022030907,0.94738346],"study_design_scores_gemma":[0.001057222,0.000709245,0.00015594905,0.00055869285,0.000022164966,0.00021074765,1.297928e-7,0.5108669,0.01563427,0.46880767,0.0009846988,0.0009923262],"about_ca_topic_score_codex":0.00004609495,"about_ca_topic_score_gemma":0.000035637873,"teacher_disagreement_score":0.9463911,"about_ca_system_score_codex":0.0004618007,"about_ca_system_score_gemma":0.00061740936,"threshold_uncertainty_score":0.9996186},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006795415,0.00006253482,0.9942656,0.0023506074,0.0003656966,0.00047436796,0.000034481727,0.00022629202,0.0021524783],"genre_scores_gemma":[0.54395616,0.0000060548687,0.45533982,0.00036866651,0.0001803447,0.000023393632,0.00004822091,0.000015753587,0.00006161149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646777,0.000029770918,0.000446287,0.0014408875,0.0010710752,0.00054418505],"domain_scores_gemma":[0.99782115,0.00011103669,0.0002383182,0.0010696717,0.0005661293,0.00019367175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059252465,0.00045904407,0.00038952183,0.0003230514,0.00034564274,0.0005398235,0.0018377977,0.0002565923,0.00002862148],"category_scores_gemma":[0.00007522899,0.00037026874,0.00009034269,0.00055464054,0.0010938812,0.0006903069,0.0005316997,0.0007834034,0.000037075875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064326027,0.000056553607,0.000023679506,0.00004090653,0.000009503697,0.000038557926,0.00019457738,0.056449965,0.000039695522,0.75698686,0.0000063662155,0.18614689],"study_design_scores_gemma":[0.00021734239,0.0002130935,0.0002958133,0.0003197273,0.000007324714,0.00008021597,3.796886e-8,0.17036226,0.00092183944,0.82705915,0.00007713252,0.00044606804],"about_ca_topic_score_codex":0.00003607906,"about_ca_topic_score_gemma":0.00008521312,"teacher_disagreement_score":0.54388815,"about_ca_system_score_codex":0.00069431606,"about_ca_system_score_gemma":0.0025387255,"threshold_uncertainty_score":0.99987495},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032240726,0.00023954327,0.99249315,0.0015455113,0.0035636274,0.00071092584,0.000026178817,0.00033744675,0.0007612039],"genre_scores_gemma":[0.47518218,0.000105414874,0.51932746,0.0037147691,0.0014119674,0.00001545254,0.000092564434,0.00010654156,0.00004367564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935743,0.000163089,0.000812996,0.0029941297,0.0014282695,0.0010272135],"domain_scores_gemma":[0.99192804,0.0021380102,0.0004925985,0.004921272,0.0002858307,0.00023426629],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0021120675,0.0008248401,0.0008016513,0.0013464944,0.00027356166,0.0008187651,0.00835359,0.0011167306,0.000023594455],"category_scores_gemma":[0.00043474042,0.0007972248,0.000119216,0.0011831934,0.0012441921,0.0009096205,0.002349196,0.005341034,0.000041697534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025752275,0.00013255977,0.00029749176,0.000037920534,0.000009088854,0.00035026364,0.0003926644,0.5321124,0.000053689135,0.007141316,0.000032212138,0.45941463],"study_design_scores_gemma":[0.0004047063,0.00014162585,0.00056721654,0.0009855737,0.0000066087605,0.00004514887,1.95613e-7,0.9782196,0.00032225775,0.017930012,0.0005649676,0.0008120507],"about_ca_topic_score_codex":0.00006062463,"about_ca_topic_score_gemma":0.0010298494,"teacher_disagreement_score":0.47485977,"about_ca_system_score_codex":0.00039237345,"about_ca_system_score_gemma":0.0007057663,"threshold_uncertainty_score":0.9994479},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021228164,0.0050038616,0.988335,0.00036726595,0.0010505248,0.0002495841,0.000038929993,0.00013168175,0.0027002993],"genre_scores_gemma":[0.73614436,0.00011427605,0.2626385,0.0004963564,0.00041172453,0.000004013108,0.0000053188623,0.000034542303,0.00015087714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714375,0.00004837357,0.00061618385,0.0007211256,0.0009301623,0.0005404001],"domain_scores_gemma":[0.99615645,0.001029632,0.0005619117,0.001944305,0.00019228684,0.00011539176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080212345,0.00041272384,0.0007380121,0.000708769,0.00009104303,0.00011999917,0.004406155,0.00021314116,0.000051791973],"category_scores_gemma":[0.00013009657,0.00035702102,0.00015985242,0.00034820227,0.0012332619,0.0008960922,0.0019239533,0.0004265516,0.000010847352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010691906,0.00008715663,0.00011804027,0.00036471614,0.000041053096,0.00003308756,0.0019311733,0.0010410484,0.001849131,0.72069854,0.000053209013,0.27377218],"study_design_scores_gemma":[0.000419976,0.00033865808,0.0009212235,0.0011719487,0.00003088858,0.000080530815,0.00000466493,0.054926306,0.028081164,0.9125322,0.000615862,0.00087656104],"about_ca_topic_score_codex":0.000065371445,"about_ca_topic_score_gemma":0.00002995082,"teacher_disagreement_score":0.73402154,"about_ca_system_score_codex":0.00010262481,"about_ca_system_score_gemma":0.00030495378,"threshold_uncertainty_score":0.9998882},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14592202,0.00007039646,0.85292715,0.000060789105,0.0006196624,0.00025395743,0.000016134969,0.000030089363,0.00009982593],"genre_scores_gemma":[0.91299677,0.000014622054,0.086622715,0.00006406862,0.0002738335,0.0000011399769,0.0000055695805,0.000019432326,0.0000018775993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680275,0.000027013504,0.00091930095,0.0007822792,0.0010022732,0.00046639],"domain_scores_gemma":[0.9958297,0.00071572996,0.0015385156,0.0011051556,0.00071895757,0.00009191651],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001003615,0.00041768266,0.0009052817,0.0003411876,0.00014421923,0.00006098422,0.0019239761,0.00036536716,0.000011205081],"category_scores_gemma":[0.00007389623,0.0003293213,0.00020074494,0.001259038,0.0004476292,0.0003717069,0.00075931853,0.0009669088,8.7468084e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014033439,0.000078442106,0.0010913446,0.00016259773,0.00005670074,0.0000072210437,0.0012065169,0.943331,0.0046023116,0.0036133884,0.0000038842895,0.04570624],"study_design_scores_gemma":[0.0005211989,0.0014726748,0.001703744,0.0026314869,0.000026930062,0.00003219218,5.1242347e-7,0.95614356,0.024731645,0.012276682,0.000018212633,0.0004411886],"about_ca_topic_score_codex":0.00023364565,"about_ca_topic_score_gemma":0.00037403856,"teacher_disagreement_score":0.7670747,"about_ca_system_score_codex":0.00010730917,"about_ca_system_score_gemma":0.00048261572,"threshold_uncertainty_score":0.9999159},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007426028,0.00056326477,0.9950455,0.00044052102,0.0009090192,0.00018190438,0.000010078796,0.00029361085,0.0018135175],"genre_scores_gemma":[0.3496782,0.00013581125,0.6483422,0.00090926676,0.00044885898,0.0000048767465,0.000019822863,0.000040199408,0.000420782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960471,0.0000549626,0.0005490905,0.0016215227,0.0011116297,0.00061570894],"domain_scores_gemma":[0.9968847,0.0003306084,0.0004130888,0.0020095806,0.00018755299,0.00017448752],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006587709,0.00052269245,0.00058596133,0.0011784813,0.00047670954,0.00073018845,0.0036674466,0.00034809567,0.000021734248],"category_scores_gemma":[0.000108912245,0.00047136704,0.00017761967,0.0010312304,0.00059598626,0.00072621217,0.0010327996,0.0007921617,0.000057080084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017220417,0.00004761448,0.00007769552,0.000050295323,0.000039237937,0.0002584424,0.0013330481,0.013822575,0.0015023232,0.004258937,0.0003263542,0.97828174],"study_design_scores_gemma":[0.00013291769,0.000049149286,0.00026808484,0.0002727397,0.000021117501,0.0002553895,2.0031037e-7,0.99103665,0.00017946237,0.0063181836,0.00091111416,0.00055500894],"about_ca_topic_score_codex":0.00004760436,"about_ca_topic_score_gemma":0.000054153687,"teacher_disagreement_score":0.97772676,"about_ca_system_score_codex":0.00034922353,"about_ca_system_score_gemma":0.0009342539,"threshold_uncertainty_score":0.9997738},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009891197,0.00013839391,0.9890409,0.0022104548,0.0015315256,0.0005002455,0.0000036763165,0.00007498704,0.006400881],"genre_scores_gemma":[0.5717926,0.00011412717,0.4245741,0.0031056607,0.00026123723,0.000024668272,0.000014943744,0.000030656473,0.00008200862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964808,0.00014420417,0.0005465903,0.0011538784,0.0011215727,0.0005529024],"domain_scores_gemma":[0.99755245,0.0009948432,0.00015995667,0.00097043667,0.00021609834,0.00010620268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015173749,0.0003565924,0.00030632308,0.00089472695,0.00030796693,0.00062316,0.0015168508,0.00023243025,0.00005962046],"category_scores_gemma":[0.00014402816,0.00029893802,0.00011402701,0.001088,0.001345956,0.0005338141,0.0003784673,0.0010329274,0.00002126487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001393498,0.000029305016,0.00012951667,0.000013991656,0.000009777775,0.00014621572,0.0018929145,0.3809335,0.000014040211,0.08689285,0.000023204735,0.5299008],"study_design_scores_gemma":[0.0014130389,0.00022933417,0.0008319006,0.00023652757,0.000012371729,0.00038938166,0.000020322175,0.9371318,0.00025961502,0.058036543,0.00059773045,0.0008414299],"about_ca_topic_score_codex":0.000047325964,"about_ca_topic_score_gemma":0.00026810647,"teacher_disagreement_score":0.57169366,"about_ca_system_score_codex":0.00027317615,"about_ca_system_score_gemma":0.0006973882,"threshold_uncertainty_score":0.9999463},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20440166,0.0025295701,0.77188414,0.0065046675,0.0027483336,0.002150853,0.00012381133,0.0007730123,0.008883981],"genre_scores_gemma":[0.9973961,0.000019645873,0.0018480791,0.00037543604,0.0002718926,0.000008214938,0.000014021409,0.000002487346,0.0000641112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982339,0.000032023665,0.00038301,0.0006122265,0.0004135953,0.00032523394],"domain_scores_gemma":[0.99886787,0.000500461,0.00024745773,0.00018406496,0.00013633941,0.00006382591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003613217,0.00027602483,0.00042534157,0.00009963096,0.00010616073,0.000057331952,0.00086045015,0.00043116626,0.00009161087],"category_scores_gemma":[0.00003681396,0.00012054757,0.00015460975,0.0003408122,0.00071939663,0.00008350574,0.00014610247,0.00048667172,0.00001940907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006602655,0.000075111486,0.00075211114,0.000028278255,0.000014223867,0.00001185698,0.00004504943,0.0076079704,0.011253817,0.0038193918,0.000013863071,0.9763123],"study_design_scores_gemma":[0.00086518493,0.0016835905,0.016658356,0.0018542819,0.0000932457,0.000028492841,0.0000020186587,0.888427,0.006203462,0.07635781,0.0059850523,0.0018414678],"about_ca_topic_score_codex":0.00002075465,"about_ca_topic_score_gemma":0.00023922545,"teacher_disagreement_score":0.97447085,"about_ca_system_score_codex":0.000049847822,"about_ca_system_score_gemma":0.000035112073,"threshold_uncertainty_score":0.49157873},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028052408,0.0000333428,0.9698226,0.0013297994,0.00016122615,0.00041353292,0.00000103866,0.00015318785,0.000032906348],"genre_scores_gemma":[0.51584953,0.000009672899,0.48076543,0.0033413966,0.00001859223,0.000010013969,0.0000018036399,0.000002924751,5.9920416e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977712,0.00010059975,0.00032115143,0.00073420955,0.00063642464,0.0004364339],"domain_scores_gemma":[0.99883753,0.00043447834,0.00009183499,0.00043822604,0.000070714676,0.00012720766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088313397,0.00019722334,0.00018174095,0.000553061,0.00012102434,0.00041537732,0.0007966812,0.00006085586,0.0000061301166],"category_scores_gemma":[0.00026015405,0.0001665941,0.000022066206,0.0016672903,0.00029818976,0.00096351455,0.00009743491,0.00025524056,0.0000043034056],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010097522,0.00010136341,0.002000497,0.000010845761,6.065056e-7,0.00002603805,0.0009909265,0.0123452265,0.04927606,0.000035078123,0.000012652435,0.9351906],"study_design_scores_gemma":[0.0006963221,0.00046854076,0.026848266,0.00010720775,0.000001120817,0.000018400333,0.0000016207218,0.5870155,0.3784527,0.0061316853,0.0000025470515,0.0002560864],"about_ca_topic_score_codex":0.0000238626,"about_ca_topic_score_gemma":0.00001625945,"teacher_disagreement_score":0.9349345,"about_ca_system_score_codex":0.00017460306,"about_ca_system_score_gemma":0.00015710447,"threshold_uncertainty_score":0.67935103},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009457113,0.000047534966,0.9948824,0.00006694655,0.0005589633,0.00045890233,0.000012170418,0.00014354089,0.0028838126],"genre_scores_gemma":[0.023160385,0.000030836858,0.9761931,0.00020183783,0.00012533645,0.0000062385957,0.000010830878,0.000030291252,0.00024117547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653107,0.00005562473,0.0006811197,0.001146924,0.0009755273,0.0006097269],"domain_scores_gemma":[0.99610114,0.00051520026,0.00058052613,0.0020290108,0.0006025949,0.00017151222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018341896,0.00042913822,0.00046990984,0.0009660979,0.00025765333,0.00024350882,0.0018420127,0.00033396768,0.000011396517],"category_scores_gemma":[0.0001507273,0.00036678585,0.00009068465,0.00087384053,0.0009194057,0.0018681684,0.0006676246,0.00058877235,0.000032049447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053606294,0.00006659403,0.000041890908,0.00006262424,0.0000177951,0.00085003494,0.0010554165,0.013342549,0.0014657199,0.13408434,0.000017265158,0.84894216],"study_design_scores_gemma":[0.0005669052,0.00084810215,0.000911525,0.0006181275,0.000035435496,0.005010908,7.668932e-7,0.9546574,0.010697578,0.023879787,0.0015308224,0.0012426577],"about_ca_topic_score_codex":0.00007326341,"about_ca_topic_score_gemma":0.00004825002,"teacher_disagreement_score":0.9413148,"about_ca_system_score_codex":0.00024760966,"about_ca_system_score_gemma":0.00042875126,"threshold_uncertainty_score":0.9998784},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003773272,0.00012049513,0.99724966,0.00007194898,0.0011775151,0.00043361337,0.00002398873,0.00021610128,0.0006689561],"genre_scores_gemma":[0.3321272,0.0000064975193,0.6668354,0.00042697464,0.0003986787,0.000009488313,0.000014987452,0.00007248362,0.000108209286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982512,0.000011962089,0.0003687557,0.0005419401,0.00037518237,0.00045098396],"domain_scores_gemma":[0.99904597,0.00021560203,0.00009408145,0.00037092497,0.00011315845,0.00016028823],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003502408,0.00039085085,0.0003519117,0.0006516665,0.00015783035,0.00022272328,0.0004945245,0.00022011613,0.000041278698],"category_scores_gemma":[0.000052959364,0.0003664252,0.000059318467,0.0003475589,0.00011679608,0.00016308115,0.00009759344,0.00077568414,0.000009632402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013836217,0.0000046436594,0.0000027469493,0.0000306498,0.00001197315,0.000013791836,0.00023732611,0.94813144,0.00017226262,0.00010135502,0.0000097410975,0.05127024],"study_design_scores_gemma":[0.0001773349,0.000042071708,0.000012706893,0.00035424603,0.00001686957,0.000033857075,2.0409401e-7,0.9900579,0.0036415288,0.0041200006,0.0011267005,0.00041659703],"about_ca_topic_score_codex":0.000017123682,"about_ca_topic_score_gemma":0.00010833512,"teacher_disagreement_score":0.33208948,"about_ca_system_score_codex":0.00039350294,"about_ca_system_score_gemma":0.0001314158,"threshold_uncertainty_score":0.99987876},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004558449,0.00008400829,0.9961508,0.0011864642,0.00058505934,0.00018233866,0.000030586056,0.00013780379,0.0011870861],"genre_scores_gemma":[0.14274976,0.00011707829,0.85436726,0.0018482468,0.00050815445,0.000014993104,0.00011888149,0.000047189427,0.00022844136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959946,0.00009544441,0.00055877835,0.0017089134,0.00095558085,0.0006866535],"domain_scores_gemma":[0.9974261,0.0007732684,0.0001970836,0.0012744605,0.0001559875,0.00017308777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012347554,0.0005170677,0.00056121306,0.0024781097,0.00024828064,0.00042601887,0.002335444,0.00027096947,0.00003308441],"category_scores_gemma":[0.00012817823,0.00048971997,0.00013863695,0.001432652,0.00032646625,0.0006078946,0.0006547516,0.0008580719,0.00003630861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036825465,0.00005512655,0.000105134866,0.000012712294,0.0000061957417,0.00015638684,0.00046583702,0.07000962,0.000021857975,0.000082469254,0.00009393701,0.928987],"study_design_scores_gemma":[0.00035048637,0.00015851173,0.00007688931,0.00047634068,0.0000051195793,0.00002552513,6.696217e-7,0.9965114,0.00036133986,0.0004031948,0.0011170232,0.00051351136],"about_ca_topic_score_codex":0.00007312773,"about_ca_topic_score_gemma":0.0001584391,"teacher_disagreement_score":0.92847353,"about_ca_system_score_codex":0.00035242728,"about_ca_system_score_gemma":0.00088936416,"threshold_uncertainty_score":0.99975544},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005458982,0.0005152735,0.9891175,0.0005198932,0.0013313914,0.00036681985,0.000016938138,0.00008739419,0.007498884],"genre_scores_gemma":[0.717142,0.00028940322,0.27468535,0.0067179324,0.0009039573,0.000013167221,0.000019901596,0.00007592509,0.00015237993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961746,0.000054885983,0.00056657544,0.0012722242,0.001291762,0.00064000307],"domain_scores_gemma":[0.99509025,0.0018559357,0.00036453872,0.0023369922,0.00020303679,0.00014925364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015648268,0.00050009246,0.00048326163,0.00093024445,0.00026648317,0.00028602887,0.005143004,0.00029764025,0.0000449778],"category_scores_gemma":[0.0001399454,0.00034818775,0.00022692398,0.0011300321,0.0012451349,0.0003444057,0.0013139689,0.0010398438,0.000053093496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009051979,0.00006778716,0.000058881422,0.000035622295,0.000012919718,0.00004235548,0.00070139096,0.0019331988,0.0000668187,0.7867328,0.000089624446,0.21024956],"study_design_scores_gemma":[0.00029179186,0.00045766003,0.00048970006,0.0006284282,0.000013324304,0.000036858062,3.3778787e-7,0.10686913,0.0038619922,0.8813553,0.0051402743,0.0008552245],"about_ca_topic_score_codex":0.000021738246,"about_ca_topic_score_gemma":0.00009579879,"teacher_disagreement_score":0.71659607,"about_ca_system_score_codex":0.00008533469,"about_ca_system_score_gemma":0.00022839686,"threshold_uncertainty_score":0.999897},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033492288,0.00076653383,0.99140817,0.0012139381,0.0012478805,0.00025095537,0.000007727938,0.0003638245,0.004707458],"genre_scores_gemma":[0.023103373,0.00014814624,0.96869004,0.0068596574,0.00049828767,0.0000034345974,0.000013612539,0.00004348093,0.0006399721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956788,0.00003047082,0.0005679178,0.0019023581,0.0010697931,0.0007506958],"domain_scores_gemma":[0.99718416,0.0003357586,0.00031632106,0.0017326775,0.00022695436,0.00020412767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003856994,0.0006119949,0.0005880135,0.0006643517,0.00028187476,0.0007565648,0.0039260904,0.00029209,0.000037871458],"category_scores_gemma":[0.000089301924,0.00056198286,0.00014097575,0.0007342455,0.0004901777,0.0011223906,0.0012664589,0.0010154817,0.00014457188],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029531245,0.000017737138,0.000017074815,0.0000037423272,0.0000052360074,0.000069890244,0.00018440507,0.0052392925,0.00041017187,0.007725596,0.00006999256,0.9862539],"study_design_scores_gemma":[0.0002295455,0.00008962169,0.0001241494,0.00026109663,0.000004724704,0.000030762207,7.4513494e-8,0.6554591,0.0013865953,0.33107045,0.010757253,0.00058661215],"about_ca_topic_score_codex":0.000017760953,"about_ca_topic_score_gemma":0.000015837308,"teacher_disagreement_score":0.9856673,"about_ca_system_score_codex":0.00032289748,"about_ca_system_score_gemma":0.00040183743,"threshold_uncertainty_score":0.99968314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009218363,0.00042778294,0.991613,0.00025618888,0.0047784387,0.00068583776,0.000004689387,0.00009468898,0.0020472151],"genre_scores_gemma":[0.07650525,0.00001915536,0.92014647,0.0020110214,0.00069442304,0.00007320526,0.0000033940723,0.000058407946,0.0004886526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632055,0.00004774826,0.0006688149,0.0015186023,0.00063938077,0.0008049172],"domain_scores_gemma":[0.9979829,0.00047329333,0.0002493262,0.0009364046,0.00022109269,0.00013698624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014383615,0.00047017835,0.00059108733,0.0011333425,0.00023853,0.0004700548,0.0018935667,0.00033241237,0.000008515979],"category_scores_gemma":[0.000040375202,0.00043522165,0.000212672,0.0007838155,0.00023850518,0.0001865528,0.00041053773,0.0005759661,0.000013535131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000224627,0.000031407355,0.000008562747,0.000022748309,0.000007017886,0.00003635751,0.00053462054,0.45289308,0.000016878796,0.022478102,0.00004015477,0.5239288],"study_design_scores_gemma":[0.00035266712,0.00012172039,0.000007046536,0.0003902664,0.0000028444713,0.00008040649,4.0618954e-7,0.95693576,0.00010801959,0.038103554,0.0034097454,0.00048757167],"about_ca_topic_score_codex":0.000027424254,"about_ca_topic_score_gemma":0.00007303246,"teacher_disagreement_score":0.52344126,"about_ca_system_score_codex":0.00037526657,"about_ca_system_score_gemma":0.00021862968,"threshold_uncertainty_score":0.99981},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010638386,0.00019939519,0.9963647,0.000830113,0.00064656197,0.00040430564,0.000010734636,0.000112654416,0.0014208585],"genre_scores_gemma":[0.053071056,0.0013979741,0.9358802,0.0065331636,0.0011104371,0.00002723391,0.00040803966,0.000045336812,0.0015265724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998082,0.000019521613,0.0004670982,0.0005794175,0.00058868836,0.00026327692],"domain_scores_gemma":[0.9983892,0.00023997857,0.0003486687,0.00041449748,0.0004803216,0.00012737315],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004843372,0.00026489337,0.00025918678,0.0007783196,0.0004353544,0.001056778,0.0008136562,0.00015971981,0.000005491847],"category_scores_gemma":[0.00025088995,0.00025864906,0.00003775693,0.0007908314,0.0002599127,0.0030638531,0.0003071889,0.00014892897,0.0000092381015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005325926,0.000011865721,0.00005743578,0.00006157639,0.00000837731,0.0000024560377,0.005178969,0.016766742,0.000016997381,0.23949379,0.00079413684,0.73760235],"study_design_scores_gemma":[0.00032168406,0.00011288619,0.000056828565,0.00014890659,0.0000073999445,0.000018819883,0.000001571315,0.9325469,0.00033198105,0.024930373,0.041159637,0.0003629991],"about_ca_topic_score_codex":0.000010419603,"about_ca_topic_score_gemma":0.00003764621,"teacher_disagreement_score":0.9157802,"about_ca_system_score_codex":0.00013740076,"about_ca_system_score_gemma":0.00076116214,"threshold_uncertainty_score":0.9999866},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052923867,0.00007931241,0.991829,0.00013505587,0.00042277802,0.000097839664,0.0000051521524,0.000066900284,0.002071615],"genre_scores_gemma":[0.972267,0.000008441229,0.027426735,0.00014165876,0.00010830444,0.000001409402,0.000003019639,0.000017591945,0.000025861042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988509,0.000010038504,0.00025849626,0.00034020664,0.0003618157,0.00017858655],"domain_scores_gemma":[0.9989637,0.00037662804,0.000064584216,0.00046692594,0.00009169132,0.00003648394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043087744,0.00019941397,0.0002497184,0.00024211984,0.00008787498,0.000050661132,0.0004973548,0.00016520714,0.00002757352],"category_scores_gemma":[0.000057189613,0.00014151477,0.00008594084,0.000200184,0.0003085774,0.000041342206,0.00007704604,0.000675595,0.00001353583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.9423214e-7,0.0000050549256,0.0000051419865,0.000018585439,0.000007658817,0.000001098783,0.00013529258,0.8852204,0.00031324007,0.0004987274,0.0000036860504,0.11379041],"study_design_scores_gemma":[0.000036444475,0.000023230898,0.000025145806,0.00012285948,0.000009376394,0.0000012802526,5.7426966e-8,0.93517053,0.001258687,0.063185096,0.000026036008,0.00014128194],"about_ca_topic_score_codex":0.0000106898215,"about_ca_topic_score_gemma":0.00005612481,"teacher_disagreement_score":0.9669746,"about_ca_system_score_codex":0.00005809703,"about_ca_system_score_gemma":0.00005223454,"threshold_uncertainty_score":0.5770805},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004169178,0.0058378894,0.9916903,0.00003967665,0.0011441411,0.00028632712,0.000001250854,0.00020896444,0.00037455984],"genre_scores_gemma":[0.40774596,0.00091355725,0.5901312,0.0002444021,0.000805046,0.0000075316043,0.000006420491,0.00009950257,0.000046331606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977411,0.000015067307,0.00045982012,0.0007787827,0.00038592325,0.0006192872],"domain_scores_gemma":[0.9988569,0.00037492136,0.00010909878,0.00048054688,0.00006735992,0.000111157126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037359912,0.00047430975,0.00046156647,0.00038243335,0.000112073714,0.00013539245,0.00047331175,0.00057969557,0.00001348558],"category_scores_gemma":[0.000066017485,0.0005146884,0.00004651296,0.0004584568,0.00023969324,0.0003162766,0.00025119312,0.0014853294,0.0000056917147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022443594,0.0000036415854,0.00017143314,0.000025849275,0.0000036403824,0.000032283995,0.0002766825,0.81474733,0.00003785023,0.00018901804,0.0000021405103,0.18450786],"study_design_scores_gemma":[0.00020859328,0.00001498394,0.00009135627,0.0011051167,0.0000052509768,0.000011333998,2.5957755e-7,0.9944039,0.00010618634,0.0032477228,0.0002859402,0.0005193775],"about_ca_topic_score_codex":0.000005599706,"about_ca_topic_score_gemma":0.00010427257,"teacher_disagreement_score":0.40732905,"about_ca_system_score_codex":0.0005964768,"about_ca_system_score_gemma":0.00006347695,"threshold_uncertainty_score":0.99973047},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038000903,0.0004938184,0.99742955,0.00007759943,0.00035062933,0.00036044774,0.000008507518,0.000017511606,0.00088192394],"genre_scores_gemma":[0.11378538,0.00013510449,0.88180584,0.0017970274,0.0016597467,0.000024782634,0.00018092715,0.00007607727,0.0005351182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804884,0.000018090568,0.0003382042,0.0008188608,0.00020020701,0.0005758193],"domain_scores_gemma":[0.998781,0.00015737406,0.00022055361,0.00049767835,0.00023736802,0.0001060005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007046774,0.0003293609,0.0003688112,0.00016003527,0.00016043687,0.000044676573,0.0005118796,0.00051226205,0.0000092225655],"category_scores_gemma":[0.00007386005,0.0002831221,0.00010393864,0.00011381215,0.0003194088,0.0000048229094,0.00027186502,0.00028393776,0.0000031854358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020961475,0.000016508702,0.0012711752,0.000010164975,0.000047332764,0.0000066422103,0.000024714007,0.10469212,0.00032708552,0.000057794357,0.00008664375,0.8934389],"study_design_scores_gemma":[0.0012656553,0.0018610422,0.004716192,0.00015268082,0.000072555005,0.000092684146,5.311315e-7,0.9386825,0.0018124247,0.025518462,0.02432881,0.0014964781],"about_ca_topic_score_codex":0.00002174148,"about_ca_topic_score_gemma":0.00064669375,"teacher_disagreement_score":0.8919424,"about_ca_system_score_codex":0.00006986525,"about_ca_system_score_gemma":0.00019354829,"threshold_uncertainty_score":0.9999621},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007517205,0.00013257739,0.9935002,0.000059511854,0.0010276901,0.0002642533,0.000003457818,0.000070940485,0.0041896636],"genre_scores_gemma":[0.5583732,0.000056664034,0.44084707,0.00012791096,0.00015855428,0.000003038092,0.0000054511156,0.000033785203,0.0003943209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969396,0.000042934087,0.00074344163,0.0010246051,0.00081768143,0.00043173035],"domain_scores_gemma":[0.9978557,0.00036696164,0.00050815224,0.0009944941,0.0001958735,0.00007877858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063056586,0.0003678172,0.0006065231,0.0012229984,0.00007035693,0.00009782508,0.0016486185,0.00021020767,0.0000085369],"category_scores_gemma":[0.000048428752,0.00034103257,0.00010060157,0.00066879264,0.00041461803,0.00064750446,0.00074991264,0.00047351737,0.000017532],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013190773,0.00004541853,0.00004612287,0.00006250041,0.0000030529714,0.000039082563,0.0005525384,0.015121846,0.04009801,0.0004438818,0.000007530664,0.9435668],"study_design_scores_gemma":[0.00062684383,0.00048224776,0.0008557757,0.0014759789,0.0000058143023,0.000050820294,3.5975808e-7,0.8764381,0.07861039,0.04050151,0.00025458398,0.00069760054],"about_ca_topic_score_codex":0.00008325417,"about_ca_topic_score_gemma":0.00012185837,"teacher_disagreement_score":0.94286925,"about_ca_system_score_codex":0.00018411089,"about_ca_system_score_gemma":0.000209514,"threshold_uncertainty_score":0.99990416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036338974,0.0008604755,0.966651,0.0005960544,0.0018863744,0.0002815902,0.0000012284229,0.00015618389,0.02956341],"genre_scores_gemma":[0.122069344,0.000068409376,0.8677867,0.0028841174,0.0017449426,0.00001612779,0.000025867157,0.00005505913,0.0053494098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970741,0.000032756936,0.00040215405,0.0011521076,0.0008528371,0.00048601473],"domain_scores_gemma":[0.9981503,0.00018481704,0.0002485195,0.0010892116,0.00013937667,0.00018776032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058948225,0.00036743566,0.00033962223,0.00047596818,0.00017345275,0.00056719343,0.0020355897,0.00025772068,0.00007338965],"category_scores_gemma":[0.000054855467,0.00032730866,0.00011684946,0.00047237365,0.00022917251,0.00038189287,0.0003687963,0.0004740777,0.00025369786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012972686,0.00001333563,0.000020093215,0.00001411694,0.0000054974926,0.000052109062,0.00062301545,0.00040855038,0.00004882817,0.56884086,0.00026261128,0.4297097],"study_design_scores_gemma":[0.0003688659,0.00015665169,0.00011245862,0.00006389101,0.000007943183,0.00024526176,4.8856066e-7,0.016629659,0.0009457279,0.93357176,0.047046836,0.0008504383],"about_ca_topic_score_codex":0.00004284735,"about_ca_topic_score_gemma":0.000056524987,"teacher_disagreement_score":0.42885926,"about_ca_system_score_codex":0.00021939044,"about_ca_system_score_gemma":0.0005204546,"threshold_uncertainty_score":0.9999179},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009858574,0.00029699018,0.9977156,0.00031746147,0.00058298686,0.00035216857,0.00014698262,0.000014983775,0.00047424462],"genre_scores_gemma":[0.0434818,0.000040629584,0.9460064,0.0022319441,0.0023463652,0.000019267538,0.0023125398,0.000090801,0.0034702532],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99809927,0.00002407148,0.00019995871,0.0011700741,0.00024261186,0.00026398938],"domain_scores_gemma":[0.9987757,0.000034578054,0.00018092485,0.0008258401,0.00012536572,0.000057556077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040401702,0.00027701329,0.00021562284,0.00020004984,0.00014586416,0.00008277648,0.0007904331,0.00036205375,0.000010787809],"category_scores_gemma":[0.000036631816,0.00024645816,0.000070312984,0.00013172558,0.00010633139,0.000008550833,0.0002587622,0.00026098834,0.0000017249552],"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.00008905208,0.00003473189,0.000038524235,0.000038900613,0.000018611741,0.0000018980382,0.000022774688,0.016372861,0.797759,0.00011076296,0.005382051,0.18013084],"study_design_scores_gemma":[0.0007361683,0.00061999925,0.0001672185,0.0001620596,0.00004718065,0.00007015033,1.6885838e-7,0.24935873,0.48683482,0.0020669384,0.25908715,0.0008494229],"about_ca_topic_score_codex":0.000020154223,"about_ca_topic_score_gemma":0.000091698195,"teacher_disagreement_score":0.31092417,"about_ca_system_score_codex":0.000088576926,"about_ca_system_score_gemma":0.00039686574,"threshold_uncertainty_score":0.99999875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007870693,0.00083225867,0.9100644,0.0011886109,0.0030791392,0.0009021493,5.0879163e-7,0.0002624386,0.07579982],"genre_scores_gemma":[0.9825762,0.00009783767,0.0128041385,0.0001596353,0.00028611868,0.00003551483,0.000002872535,0.000015983587,0.004021698],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99783707,0.000084773244,0.0003736391,0.0005544283,0.0005767323,0.00057334796],"domain_scores_gemma":[0.9991238,0.000179861,0.0002457698,0.00027717542,0.000080609076,0.00009277225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019612126,0.0002076772,0.00022635954,0.0006925164,0.00039342983,0.00020471175,0.0007783715,0.00033185736,0.00010691255],"category_scores_gemma":[0.00019076218,0.00020145692,0.00004083546,0.00044530645,0.00088973885,0.0003381923,0.0001381217,0.0007433978,0.000039359275],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024853532,0.00003826546,0.012324877,0.000027317932,0.000007588823,0.000028601038,0.10414995,0.0056851376,0.00007159248,0.12978725,0.000025976935,0.74785095],"study_design_scores_gemma":[0.0025273666,0.0007116945,0.010085797,0.008492449,0.00016564352,0.00012836952,0.01752248,0.108778454,0.0033548672,0.24570452,0.5928295,0.009698841],"about_ca_topic_score_codex":0.00044699534,"about_ca_topic_score_gemma":0.0007627959,"teacher_disagreement_score":0.9747055,"about_ca_system_score_codex":0.0006391407,"about_ca_system_score_gemma":0.000240242,"threshold_uncertainty_score":0.82151747},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074009285,0.000011142495,0.9911735,0.00065239356,0.00019552236,0.00047020047,0.0000023874945,0.000091424154,0.0000024705841],"genre_scores_gemma":[0.5048021,0.0000011103064,0.49437317,0.00076843955,0.00004027466,0.0000074509417,0.0000058307537,0.0000013583171,2.4630168e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983028,0.000052939355,0.00048565812,0.00038792263,0.0005431003,0.00022754146],"domain_scores_gemma":[0.9987912,0.0002529547,0.00021218625,0.00041005848,0.00027518498,0.000058381247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012637118,0.00011145437,0.00015767307,0.00024965417,0.000106955355,0.00012577568,0.0006670929,0.000054422013,0.000002208283],"category_scores_gemma":[0.00030990006,0.00010052255,0.000028959665,0.0007404601,0.00008149571,0.0010942994,0.0000917684,0.00007811348,0.0000010946443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015812644,0.000022510274,0.0000057280836,0.0000057451625,3.755031e-7,1.0014559e-7,0.00030429143,0.56039214,0.028324403,0.000723037,0.0000029536232,0.4102171],"study_design_scores_gemma":[0.00015065489,0.00011674218,0.00013498607,0.000009751266,8.2157715e-7,2.8825576e-7,1.1447746e-7,0.62434167,0.3524756,0.022699002,9.867703e-7,0.00006939212],"about_ca_topic_score_codex":0.000010475725,"about_ca_topic_score_gemma":0.000006268539,"teacher_disagreement_score":0.49740118,"about_ca_system_score_codex":0.000111640984,"about_ca_system_score_gemma":0.00011241961,"threshold_uncertainty_score":0.40991905},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005487062,0.00033056425,0.97484744,0.00074407837,0.00070065184,0.00031939935,0.000010317251,0.00006745685,0.022431392],"genre_scores_gemma":[0.6257493,0.00002161462,0.37341496,0.00037081752,0.00034473787,0.000010828587,0.000014868486,0.000009710288,0.00006319047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966465,0.000064621345,0.0006349446,0.0012050301,0.0009641637,0.00048470843],"domain_scores_gemma":[0.9980725,0.0005318106,0.00026682776,0.00070376624,0.00030325624,0.000121840814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095682725,0.00037564558,0.00049608387,0.00061767903,0.00013722003,0.00013776487,0.0016900005,0.00036416514,0.000065253276],"category_scores_gemma":[0.00016777952,0.00032662635,0.00014512557,0.0005658395,0.0014258969,0.0005099242,0.0006576796,0.00073128426,0.000043012773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000905444,0.00012639507,0.0007625521,0.000036358448,0.000004189635,0.00003302998,0.00023079396,0.004928624,0.00008781646,0.8978767,0.000009244234,0.095895275],"study_design_scores_gemma":[0.0003576242,0.00017175493,0.00857473,0.00027078635,0.0000047147214,0.00008326913,7.302593e-8,0.10957667,0.0004077886,0.8798601,0.00025233635,0.00044017538],"about_ca_topic_score_codex":0.000015048373,"about_ca_topic_score_gemma":0.00023285892,"teacher_disagreement_score":0.62520057,"about_ca_system_score_codex":0.0005445146,"about_ca_system_score_gemma":0.001093643,"threshold_uncertainty_score":0.9999186},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028814489,0.00011335571,0.969479,0.00010439128,0.00041288283,0.00027545655,0.000023128752,0.000010450311,0.0007668326],"genre_scores_gemma":[0.23540744,0.00007899042,0.7609296,0.0007365022,0.000990792,0.00004219682,0.00012031471,0.000046867444,0.0016472935],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99867594,0.000010497846,0.00020659622,0.0006540976,0.00023894056,0.00021390883],"domain_scores_gemma":[0.99897844,0.00006644684,0.00019002735,0.00048037808,0.00022258396,0.000062154715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014495428,0.0002473752,0.00022317767,0.00011756243,0.00007133163,0.000051257808,0.0004880737,0.00030974828,0.000021627378],"category_scores_gemma":[0.00004070417,0.00018346148,0.00007255047,0.00007643005,0.00041745676,0.000005321414,0.00012107588,0.00022207932,0.0000031233508],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010260892,0.0000623822,0.0015508191,0.000048613387,0.000032754717,0.0000022100896,0.00011552638,0.0012023929,0.1547107,0.0005149183,0.00010068332,0.8415564],"study_design_scores_gemma":[0.0009591195,0.0019161969,0.0011849634,0.00032189852,0.000040726787,0.000032771757,8.531197e-7,0.017071495,0.93587244,0.013744468,0.027812792,0.0010422552],"about_ca_topic_score_codex":0.0000062223376,"about_ca_topic_score_gemma":0.00013087182,"teacher_disagreement_score":0.8405141,"about_ca_system_score_codex":0.000014491494,"about_ca_system_score_gemma":0.00023546365,"threshold_uncertainty_score":0.7481342},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019387365,0.0005829421,0.99021536,0.00022443019,0.0036903825,0.0002983864,0.0000030457848,0.00034537644,0.0044461945],"genre_scores_gemma":[0.86172,0.00011953194,0.13455042,0.0018397334,0.0010835308,0.000017195816,0.000014124642,0.00011226158,0.00054315105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925417,0.00014891526,0.0012097162,0.0029437474,0.001308538,0.0018473862],"domain_scores_gemma":[0.9955599,0.0007306613,0.0006240633,0.0024043585,0.00033149857,0.00034952577],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011209706,0.0011084249,0.0011383907,0.0013838176,0.0003462365,0.00063050125,0.0051542814,0.00065239915,0.000027967106],"category_scores_gemma":[0.000042746226,0.0010743032,0.0002611853,0.0015362565,0.0007587309,0.00062181085,0.002339975,0.0017489304,0.000021214133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008464857,0.00003507488,0.00007933461,0.000008709836,0.000008987079,0.00033425802,0.00041103605,0.6960695,0.000015837157,0.01822287,0.0000097646625,0.28479618],"study_design_scores_gemma":[0.0005393242,0.00009726842,0.00005586706,0.0008104066,0.0000076813085,0.00011728764,3.7812063e-7,0.9853358,0.00031692378,0.010976348,0.0005596214,0.0011830898],"about_ca_topic_score_codex":0.0004888775,"about_ca_topic_score_gemma":0.0013730325,"teacher_disagreement_score":0.8615262,"about_ca_system_score_codex":0.0006022021,"about_ca_system_score_gemma":0.000449667,"threshold_uncertainty_score":0.9991707},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027639818,0.00018789255,0.99119914,0.0003664058,0.00045107183,0.00031834858,0.000023089695,0.00007794298,0.0070996857],"genre_scores_gemma":[0.40408197,0.000041925286,0.5669542,0.0008544135,0.0019214523,0.000011631535,0.000054289234,0.00014968555,0.02593042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918662,0.00007412437,0.000746382,0.0018856929,0.0045966343,0.0008309849],"domain_scores_gemma":[0.9946437,0.0027264713,0.00041960477,0.0010846072,0.0009143707,0.00021123308],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0023353302,0.0004933359,0.000687374,0.0015461646,0.00036291135,0.0006863947,0.0027878992,0.00028129306,0.00038138928],"category_scores_gemma":[0.0012199088,0.00033681007,0.00010932012,0.0012354896,0.004078715,0.0004441993,0.00083428924,0.0018246085,0.00018286901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010328649,0.00002271007,0.00023220282,0.000003697719,0.0000040325945,0.00020038137,0.00008334239,0.3114365,0.000014172635,0.00014763798,0.00004374131,0.68780124],"study_design_scores_gemma":[0.0012363121,0.0009661843,0.0021754606,0.00068643724,0.0000139667345,0.0004633297,0.0000039255387,0.6471535,0.0006926398,0.31576863,0.029092567,0.001747069],"about_ca_topic_score_codex":0.000020598305,"about_ca_topic_score_gemma":0.00023006939,"teacher_disagreement_score":0.68605417,"about_ca_system_score_codex":0.00028946274,"about_ca_system_score_gemma":0.0007348454,"threshold_uncertainty_score":0.9999084},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005923661,0.0025434243,0.993252,0.0009797355,0.0015367543,0.00076342875,0.0000042848515,0.00016515616,0.000695983],"genre_scores_gemma":[0.56968564,0.0010007882,0.4228211,0.004128225,0.001602171,0.00013038819,0.0000126386585,0.00012010758,0.0004989552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946439,0.00010445811,0.000764752,0.002258471,0.0009302769,0.0012980992],"domain_scores_gemma":[0.99370694,0.0038750581,0.00044570558,0.0014959548,0.00026975223,0.00020660783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016067787,0.0008165897,0.0009041741,0.0012238139,0.00045588534,0.000731619,0.0036542648,0.0006263304,0.0000019803342],"category_scores_gemma":[0.00006580783,0.0006485094,0.00020598396,0.002086278,0.0008349201,0.00045684868,0.0011647439,0.0011127425,0.0000015252609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005143499,0.000033605305,0.000009037762,0.00000960577,0.000009701667,0.000023681732,0.0001006441,0.3043934,0.000005529553,0.030503934,0.000011290158,0.6648944],"study_design_scores_gemma":[0.00055169855,0.00022533006,0.000107164735,0.00035981013,0.000012892426,0.00007514569,1.5084692e-7,0.9551592,0.00014697912,0.041655477,0.0009727481,0.0007334161],"about_ca_topic_score_codex":0.00012007664,"about_ca_topic_score_gemma":0.0006158108,"teacher_disagreement_score":0.66416097,"about_ca_system_score_codex":0.00036642025,"about_ca_system_score_gemma":0.0003371986,"threshold_uncertainty_score":0.9995966},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026266454,0.00049803586,0.99517274,0.0002961656,0.00017189403,0.00025229802,0.0000024302485,0.000035273857,0.0009445012],"genre_scores_gemma":[0.9610598,0.00012148191,0.038569577,0.00006721359,0.000086122556,0.0000062381905,0.000006893272,0.000008415812,0.00007426369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997707,0.000041355106,0.0005645819,0.00083921873,0.0005034335,0.00034442518],"domain_scores_gemma":[0.9985028,0.00021346271,0.00039355663,0.00069546775,0.00013690587,0.000057833488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067455403,0.00024729344,0.000430238,0.0017239251,0.00008115381,0.00024080767,0.0009273781,0.00019255775,0.000010445058],"category_scores_gemma":[0.000027121288,0.00023586511,0.00008789423,0.0013181926,0.00020586968,0.000745986,0.00021392833,0.00033727492,0.0000048343704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000550001,0.00007931455,0.007728064,0.000080638674,0.00009142672,0.0000064828823,0.0030524684,0.1534555,0.0016567276,0.30518988,0.000004165568,0.52864987],"study_design_scores_gemma":[0.00017844998,0.000060108938,0.050117057,0.00009198539,0.000028856603,0.000004931042,8.4873085e-7,0.922697,0.00024205132,0.026147824,0.00014788419,0.00028298845],"about_ca_topic_score_codex":0.00010020229,"about_ca_topic_score_gemma":0.0027997936,"teacher_disagreement_score":0.95843315,"about_ca_system_score_codex":0.00024647627,"about_ca_system_score_gemma":0.00044829526,"threshold_uncertainty_score":0.96182996},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007044551,0.0004706745,0.99495846,0.0003966722,0.0005068823,0.00043789382,0.000006035556,0.0000929115,0.003060031],"genre_scores_gemma":[0.098946355,0.0005121036,0.8987857,0.001388765,0.0001890514,0.000008242748,0.000009305825,0.000033117725,0.0001273235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660003,0.00005989447,0.00056991004,0.0014122783,0.0008188834,0.0005390295],"domain_scores_gemma":[0.9978154,0.00042512122,0.00031491418,0.0011709261,0.00014192947,0.00013176068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068317004,0.0004901909,0.0005514473,0.0005596599,0.00021259711,0.00048165445,0.0022387719,0.0002775876,0.000016060283],"category_scores_gemma":[0.00003951341,0.00043327812,0.000080445556,0.00054737006,0.00062844885,0.00089762773,0.0007936819,0.00053965027,0.000016306325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008349155,0.000015030397,0.0000056210015,0.000017508864,0.000004671611,0.000019927415,0.0005422329,0.57385963,0.000018483986,0.007922776,0.000020437974,0.41756532],"study_design_scores_gemma":[0.00018156215,0.0001966616,0.000025675123,0.00009769039,0.0000067668334,0.000048550988,5.0088033e-8,0.7589054,0.00006438686,0.23987176,0.0002663831,0.00033514088],"about_ca_topic_score_codex":0.000027327018,"about_ca_topic_score_gemma":0.000008317424,"teacher_disagreement_score":0.4172302,"about_ca_system_score_codex":0.0001058723,"about_ca_system_score_gemma":0.00044495368,"threshold_uncertainty_score":0.9998119},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003973713,0.0013588193,0.99109775,0.0004000331,0.0012329852,0.000659281,0.0000014254034,0.00030585675,0.0009701617],"genre_scores_gemma":[0.6002016,0.000047690814,0.39910758,0.0003505353,0.00019396607,0.000017400058,0.0000022444767,0.00002302375,0.000055929613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592423,0.000044767003,0.00069350266,0.0015487088,0.001044098,0.0007446992],"domain_scores_gemma":[0.99806243,0.000294812,0.00015659063,0.0010578891,0.00030384603,0.00012442653],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025469374,0.00048417188,0.0005181245,0.0014547803,0.00021173208,0.0014087069,0.0023409207,0.0003869978,0.0000013416352],"category_scores_gemma":[0.00016155692,0.00045951293,0.00004142311,0.0009855457,0.00028668848,0.0008544412,0.0016622562,0.000835536,0.000011228275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022276379,0.0000056057165,0.000013768474,0.000022429349,0.0000026061496,0.00003952251,0.0005084569,0.7304443,0.00010741813,0.021989914,0.0000024717344,0.24686125],"study_design_scores_gemma":[0.00015040448,0.00016118253,0.000026403377,0.00062313856,0.0000030968804,0.000048244412,0.0000023219065,0.96481836,0.00009682682,0.033532,0.00006200585,0.0004760029],"about_ca_topic_score_codex":0.00013634388,"about_ca_topic_score_gemma":0.00055604917,"teacher_disagreement_score":0.59622794,"about_ca_system_score_codex":0.00045527043,"about_ca_system_score_gemma":0.00049763074,"threshold_uncertainty_score":0.99978566},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049973183,0.00017584996,0.9911056,0.0006487229,0.0026455414,0.00047988724,0.0000069773387,0.0002759111,0.0046115317],"genre_scores_gemma":[0.01237732,0.000015726368,0.98491323,0.0018564485,0.00025387714,0.000011753262,0.0000038672897,0.000027904012,0.00053989387],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957645,0.000057640984,0.0006546634,0.001474013,0.0010454403,0.0010037737],"domain_scores_gemma":[0.99720025,0.00035712204,0.00031084416,0.0015684877,0.00029424726,0.0002690758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028391404,0.00049630756,0.00045014045,0.0014464053,0.00048771582,0.00058603584,0.0035901135,0.00027495078,0.000017950106],"category_scores_gemma":[0.0003038535,0.00047420067,0.000112487396,0.0012144279,0.0006782108,0.0009053511,0.0018640782,0.000808934,0.00014246357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007820202,0.000021285057,0.000060265054,0.000028342314,0.000007008121,0.000057860045,0.0014775452,0.030691486,0.00016780905,0.25154924,0.000037409915,0.7158939],"study_design_scores_gemma":[0.00022034722,0.0004563081,0.000673464,0.00047891066,0.000007875078,0.00013006642,6.0702683e-7,0.41704404,0.00373978,0.5642015,0.011529343,0.0015177793],"about_ca_topic_score_codex":0.000046464724,"about_ca_topic_score_gemma":0.00017008136,"teacher_disagreement_score":0.71437615,"about_ca_system_score_codex":0.00059614395,"about_ca_system_score_gemma":0.000511613,"threshold_uncertainty_score":0.99977094},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003426471,0.00013322417,0.9931872,0.000009836936,0.0048738653,0.00026091113,0.000007832106,0.00015486436,0.0010296552],"genre_scores_gemma":[0.10639518,0.00007103598,0.8927004,0.00008382315,0.00049949065,0.0000036566885,0.000010951391,0.000076030236,0.00015948257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978957,0.00001221998,0.0005747127,0.0005507934,0.0005489455,0.00041759427],"domain_scores_gemma":[0.99896395,0.00011515837,0.00019970565,0.0005047068,0.00012032237,0.000096159965],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025051783,0.00043484065,0.0006335382,0.0005660927,0.00011096885,0.00009312764,0.0004115734,0.0003543638,0.00004469207],"category_scores_gemma":[0.000013532071,0.0004279242,0.00013987791,0.00021577129,0.00020734889,0.00015881735,0.0002043101,0.00048949715,0.000006206423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032449327,0.000011604494,0.0000017172823,0.00007091973,0.000012927899,0.000021704824,0.00018180153,0.8290917,0.00028829856,0.0030506374,0.000002979106,0.16726242],"study_design_scores_gemma":[0.00020718282,0.00013521413,0.000014447514,0.00045921994,0.000021028509,0.00013357555,3.1014213e-7,0.9741075,0.0005270172,0.023963599,0.00001833242,0.000412568],"about_ca_topic_score_codex":0.00008893514,"about_ca_topic_score_gemma":0.00011644943,"teacher_disagreement_score":0.16684985,"about_ca_system_score_codex":0.0003069796,"about_ca_system_score_gemma":0.000079690726,"threshold_uncertainty_score":0.99981725},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001107826,0.0011281596,0.99494624,0.00032110373,0.0011844237,0.00041581457,0.000020998741,0.0004795611,0.0013929302],"genre_scores_gemma":[0.17798424,0.00023528753,0.82042867,0.00058867806,0.0004840062,0.00001440994,0.0000070790175,0.00004709081,0.00021055728],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958976,0.000023966739,0.00054221245,0.0018900343,0.0009456484,0.00070056005],"domain_scores_gemma":[0.997078,0.0002694013,0.00031701277,0.0019085909,0.00023763886,0.0001893738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046238783,0.00062795216,0.0006073785,0.00050630455,0.00032003337,0.0007214794,0.0036681422,0.0004036457,0.000013142151],"category_scores_gemma":[0.00009239972,0.0005798542,0.00016731217,0.00044530086,0.00081612443,0.0026016238,0.0017024201,0.0014391369,0.000042791147],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015349768,0.00004052816,0.000024863808,0.000033811197,0.000014919463,0.00014812102,0.00078479404,0.027674034,0.017780293,0.0105588455,0.000009493837,0.94291496],"study_design_scores_gemma":[0.00022685462,0.000060877897,0.000057542773,0.00049526425,0.0000063205284,0.000024059485,1.1262732e-7,0.32987836,0.097137265,0.57045,0.00083753536,0.0008257953],"about_ca_topic_score_codex":0.00010725191,"about_ca_topic_score_gemma":0.0000728546,"teacher_disagreement_score":0.94208914,"about_ca_system_score_codex":0.00018644471,"about_ca_system_score_gemma":0.00027782313,"threshold_uncertainty_score":0.99966526},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012414495,0.00031737215,0.97492737,0.00021130682,0.0007390048,0.0002549578,0.0000017403604,0.00023903442,0.023296805],"genre_scores_gemma":[0.41769713,0.00056135707,0.5734887,0.0017396675,0.0015733286,0.000042405627,0.000021657515,0.00038435482,0.004491414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840313,0.000010853788,0.0002630936,0.00043318415,0.00047007474,0.00041963474],"domain_scores_gemma":[0.998917,0.00027331556,0.000085547865,0.0005422516,0.00010166394,0.00008024554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043792507,0.00033453206,0.00025070817,0.00018524427,0.0002514243,0.00041293175,0.00073342014,0.00017386573,0.000015856842],"category_scores_gemma":[0.000016680842,0.00021801525,0.00004649286,0.00023544344,0.00039300698,0.00009900974,0.000119378485,0.00058355264,0.00003374918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020329003,0.0000013764344,0.000032055403,0.000042729742,0.000008714048,0.0000043418436,0.0001993347,0.80940825,0.000010531314,0.0068500424,0.000036492474,0.18340407],"study_design_scores_gemma":[0.00019748141,0.000082921004,0.000022667733,0.0006774145,0.000009638852,0.000039500723,1.6260451e-7,0.9420814,0.00021083692,0.021875916,0.034237392,0.0005647026],"about_ca_topic_score_codex":0.0000035469322,"about_ca_topic_score_gemma":0.00009320176,"teacher_disagreement_score":0.4176847,"about_ca_system_score_codex":0.00011905219,"about_ca_system_score_gemma":0.000086266846,"threshold_uncertainty_score":0.8890404},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022833038,0.00012450165,0.99442863,0.00015789353,0.0020161273,0.0002175546,0.000027774184,0.00008879911,0.0006554288],"genre_scores_gemma":[0.78966,0.0003451177,0.20881923,0.00045735005,0.00037094945,0.000014679423,0.000011825928,0.00006418092,0.0002567233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906015,9.721905e-7,0.00019060455,0.00031829375,0.00019452094,0.00023543609],"domain_scores_gemma":[0.99952704,0.000023907382,0.000024415962,0.00026773318,0.000052457486,0.00010447109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013621236,0.0002153689,0.00018183926,0.00026013982,0.00008186668,0.000109012835,0.00030785144,0.00018681206,0.000025613193],"category_scores_gemma":[0.000006070653,0.00019845467,0.000028974093,0.00014483786,0.00015660335,0.00017711593,0.00008332126,0.0003215769,0.0000065141744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008883331,0.000008917802,0.000015068666,0.00018201287,0.000016220358,0.000036205252,0.0017940647,0.0310622,0.039747834,0.022683384,0.000010720092,0.9044345],"study_design_scores_gemma":[0.00013775799,0.00012305338,0.00012142157,0.00017577069,0.00001319858,0.00009431219,5.6155443e-7,0.8774975,0.015589025,0.097992994,0.0073825587,0.00087187043],"about_ca_topic_score_codex":0.000003770624,"about_ca_topic_score_gemma":0.00021329857,"teacher_disagreement_score":0.9035626,"about_ca_system_score_codex":0.00004530432,"about_ca_system_score_gemma":0.000046346788,"threshold_uncertainty_score":0.8092747},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045817613,0.00010171094,0.9954924,0.00009280609,0.0017467209,0.00064734236,0.0000065072823,0.00038018796,0.0010741244],"genre_scores_gemma":[0.45472816,0.000005315506,0.54158825,0.000104232924,0.0013552725,0.000051164614,0.000024751362,0.00007648252,0.0020663973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960949,0.00004649814,0.00056859286,0.0015784785,0.0009544218,0.00075712375],"domain_scores_gemma":[0.99771583,0.00034730302,0.0003996107,0.00076197874,0.0005495757,0.0002257144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000969545,0.0005673159,0.00054346654,0.00072526064,0.0008015256,0.00083716237,0.0018510951,0.0002501879,0.000012015951],"category_scores_gemma":[0.000053887296,0.000500586,0.00015424532,0.00035021998,0.00031854838,0.0008208573,0.00040986878,0.0009555203,0.00002953871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006459092,0.000014483977,0.000027818127,0.000076958786,0.00001468803,0.000041245075,0.00063856103,0.58281046,0.000042110103,0.39865446,4.7000486e-7,0.017672312],"study_design_scores_gemma":[0.00051507086,0.0017270109,0.00009258767,0.004640003,0.000023266506,0.0004041153,0.000009639785,0.96632224,0.0017270576,0.017909756,0.0052550198,0.001374208],"about_ca_topic_score_codex":0.00003899886,"about_ca_topic_score_gemma":0.000015917838,"teacher_disagreement_score":0.45426998,"about_ca_system_score_codex":0.0010915196,"about_ca_system_score_gemma":0.00082329166,"threshold_uncertainty_score":0.9997446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013844765,0.00015223995,0.99152553,0.00069095194,0.0007429624,0.0012620063,0.00010417466,0.0005484232,0.004835249],"genre_scores_gemma":[0.016646262,0.000023276172,0.9791982,0.0025998005,0.0007910732,0.000057840873,0.00014330774,0.00006305823,0.00047715285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99272466,0.00008150384,0.00075426797,0.0033265578,0.0019665712,0.0011464179],"domain_scores_gemma":[0.9936507,0.00012742396,0.0003433699,0.0048932433,0.00031584303,0.00066946243],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014451086,0.00088766706,0.00072048896,0.0009684264,0.0004705658,0.0013899233,0.009635007,0.00038702457,0.000016511121],"category_scores_gemma":[0.000078930665,0.00078411674,0.000113616436,0.0010282772,0.0005029192,0.0026681775,0.00417625,0.001099153,0.00013276139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010741052,0.00017210243,0.000003855912,0.000066872904,0.000007817927,0.00012171344,0.0006484906,0.03523903,0.004394387,0.017101184,0.00018413775,0.9420497],"study_design_scores_gemma":[0.0003026772,0.00019558736,0.000020129562,0.00062401884,0.0000048673787,0.00008177249,3.582006e-7,0.975912,0.002228708,0.00947235,0.010010928,0.0011466013],"about_ca_topic_score_codex":0.000066200606,"about_ca_topic_score_gemma":0.000030609495,"teacher_disagreement_score":0.94090307,"about_ca_system_score_codex":0.0004011313,"about_ca_system_score_gemma":0.0008346057,"threshold_uncertainty_score":0.9996467},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026230899,0.0005007665,0.9633842,0.00012921421,0.0017550368,0.0003406121,0.0000042073057,0.00012358665,0.033736125],"genre_scores_gemma":[0.041619584,0.000039132086,0.9573766,0.0005403332,0.00017754249,0.0000041950125,0.0000019941463,0.00002522594,0.00021536596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593824,0.000046549907,0.00087012333,0.0012839058,0.0012562532,0.0006049003],"domain_scores_gemma":[0.9962929,0.0004117472,0.00056994095,0.002068362,0.0004999427,0.00015711144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002336385,0.00045251567,0.000605159,0.0011384751,0.00014957364,0.00016563635,0.0040222816,0.00040910134,0.000015530792],"category_scores_gemma":[0.00016418446,0.00043034364,0.00016057972,0.00083236716,0.0012433374,0.0009326343,0.001145073,0.00072060345,0.0000237907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041376375,0.00001866695,0.000008873767,0.000040961288,0.0000057961947,0.000016651002,0.00044236454,0.01858465,0.00012260015,0.44318566,0.0000042902307,0.53756535],"study_design_scores_gemma":[0.00012361408,0.000118901524,0.00004327932,0.00023174591,0.0000055248697,0.000048155507,1.1122436e-7,0.66165423,0.00491243,0.33211425,0.0003597364,0.00038803683],"about_ca_topic_score_codex":0.00002097348,"about_ca_topic_score_gemma":0.000018651506,"teacher_disagreement_score":0.64306957,"about_ca_system_score_codex":0.00024650522,"about_ca_system_score_gemma":0.00059963914,"threshold_uncertainty_score":0.9998148},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010720516,0.0020922024,0.9760844,0.00026042422,0.005737824,0.00080906064,0.00002309788,0.00032699143,0.014558813],"genre_scores_gemma":[0.111613154,0.000065759115,0.88090223,0.0010198867,0.0031193718,0.000043421616,0.000024085104,0.00011320217,0.0030988804],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948405,0.00003754211,0.00065920805,0.002455389,0.0007496242,0.0012577411],"domain_scores_gemma":[0.9955755,0.00083185127,0.00045020116,0.0020851875,0.0006890898,0.00036815632],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010288339,0.0009174887,0.0008930086,0.00087993237,0.00075222837,0.0010016159,0.005656329,0.0009817156,0.000048525253],"category_scores_gemma":[0.00041517883,0.0007867401,0.00032320945,0.00069255364,0.0009515327,0.00066893356,0.0018685475,0.0017850288,0.000060038048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011788488,0.0000557001,0.00006548439,0.00013294605,0.000026980555,0.00004118426,0.0031595952,0.00085298106,0.0010013172,0.23909575,0.00013176922,0.7554245],"study_design_scores_gemma":[0.0010455609,0.0004945576,0.00027280225,0.0009429084,0.000036941005,0.00026033417,3.5653864e-7,0.30651078,0.007121803,0.61269975,0.06844211,0.0021720955],"about_ca_topic_score_codex":0.000013639487,"about_ca_topic_score_gemma":0.00052199006,"teacher_disagreement_score":0.75325245,"about_ca_system_score_codex":0.00030731017,"about_ca_system_score_gemma":0.0012635515,"threshold_uncertainty_score":0.99972355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009742051,0.00015383384,0.9918075,0.0019332672,0.0016133772,0.00037429202,0.00001350918,0.0001547418,0.0038520156],"genre_scores_gemma":[0.385979,0.00017518277,0.5940459,0.017409569,0.0011024798,0.000020824324,0.00011445894,0.000088057575,0.0010645366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99610907,0.000059291215,0.00052513496,0.0015386723,0.0012569671,0.0005108422],"domain_scores_gemma":[0.99723965,0.0008311112,0.0003084848,0.0010099504,0.00035908565,0.0002516939],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013850519,0.0004377283,0.00042779135,0.0035791586,0.00028146672,0.0006644265,0.0014858427,0.00045757162,0.000030429173],"category_scores_gemma":[0.00033884114,0.000404924,0.00011342093,0.002782276,0.00052214466,0.00035981182,0.0004152689,0.00075527094,0.000058787475],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001570508,0.000057142573,0.00013189671,0.000035512727,0.000005334652,0.00012590256,0.00013493067,0.00016881975,0.000018463146,0.0024668856,0.0003091736,0.99653023],"study_design_scores_gemma":[0.0009014867,0.00075321447,0.0039566318,0.00032731675,0.00002212695,0.00020309414,1.6859859e-7,0.9324321,0.001228177,0.038253415,0.020554459,0.0013677746],"about_ca_topic_score_codex":0.000025817097,"about_ca_topic_score_gemma":0.000026366717,"teacher_disagreement_score":0.9951625,"about_ca_system_score_codex":0.00031307095,"about_ca_system_score_gemma":0.00035379297,"threshold_uncertainty_score":0.99984026},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011094539,0.0004382168,0.991426,0.0004138191,0.0013221953,0.0005929814,0.00028125913,0.00019106892,0.0053233635],"genre_scores_gemma":[0.016482009,0.0000029739037,0.9802605,0.00069143286,0.00096967584,0.00002790049,0.0004374774,0.000042342006,0.0010857104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994943,0.000040480718,0.0007530865,0.0022022729,0.0011938489,0.00086727506],"domain_scores_gemma":[0.99531794,0.0011229428,0.0007300097,0.002293526,0.00040478248,0.00013080194],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002237826,0.0005368993,0.0006683607,0.0004415319,0.00043068684,0.0011724556,0.006066059,0.00041565893,0.0000036593333],"category_scores_gemma":[0.00034625706,0.0005173389,0.00013694799,0.0005121498,0.00018969816,0.0008326679,0.0013211727,0.0004971961,0.000008990158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008512201,0.0001052641,0.000528756,0.00029233546,0.000048591366,0.00003386884,0.0002743313,0.2995608,0.00005143889,0.006482648,0.005410568,0.68720293],"study_design_scores_gemma":[0.00037849502,0.0000490013,0.00006735521,0.00030368022,0.000013116253,0.0000109177,1.6599425e-7,0.9811556,0.00005423499,0.003406205,0.013971042,0.00059020024],"about_ca_topic_score_codex":0.000048443566,"about_ca_topic_score_gemma":0.000035720117,"teacher_disagreement_score":0.6866127,"about_ca_system_score_codex":0.00045084587,"about_ca_system_score_gemma":0.0006579065,"threshold_uncertainty_score":0.9998644},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013538623,0.00006668473,0.9696008,0.00045581363,0.0015721428,0.00048112962,0.000017055341,0.00027849455,0.026174018],"genre_scores_gemma":[0.9475337,0.00004180299,0.03894659,0.003233396,0.0010039862,0.000017804792,0.000025162213,0.000117602794,0.009079943],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9959517,0.00008190851,0.00035788864,0.0018358397,0.0010489443,0.0007237036],"domain_scores_gemma":[0.99856496,0.000311715,0.0003571682,0.00043403712,0.00022592132,0.000106202075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041711013,0.0005971034,0.0004762553,0.0006686369,0.0007515956,0.0004934777,0.00096253713,0.00054221676,0.000052614665],"category_scores_gemma":[0.00021463963,0.0005537931,0.00015240823,0.0011453466,0.0006849849,0.0006550615,0.00031113584,0.001509299,0.00013015719],"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.000095528994,0.00018091295,0.00011142172,0.00019782197,0.000017968301,0.00017772544,0.004192549,0.016233437,0.76544464,0.012451874,0.0015163405,0.19937979],"study_design_scores_gemma":[0.0013338345,0.0012016766,0.00043283918,0.002029091,0.00006514995,0.00048269203,0.0000034036202,0.13388777,0.45724896,0.39390126,0.0061186305,0.0032947143],"about_ca_topic_score_codex":0.000018143166,"about_ca_topic_score_gemma":0.000033970206,"teacher_disagreement_score":0.94617987,"about_ca_system_score_codex":0.0005782147,"about_ca_system_score_gemma":0.000383608,"threshold_uncertainty_score":0.99969137},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014575658,0.000052116357,0.9835487,0.00093429524,0.00035736134,0.0002103335,5.5245897e-7,0.00025842374,0.00006257967],"genre_scores_gemma":[0.42226896,0.0000031717,0.5761437,0.0014496803,0.00012430502,0.000004214941,7.7063436e-7,0.0000037357133,0.0000014911741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770194,0.000058241327,0.00036088933,0.0006468044,0.0007414266,0.0004906955],"domain_scores_gemma":[0.9987807,0.00012539426,0.00014299963,0.0006740818,0.00013249373,0.00014430788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000969941,0.00016766918,0.00015918238,0.00033018313,0.00022577879,0.00050386775,0.0015613243,0.00004814057,0.00001526846],"category_scores_gemma":[0.00016709622,0.00014964536,0.00003711369,0.0013999185,0.00031572473,0.0022774695,0.00043260012,0.00024087109,0.000023372044],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017702783,0.00004238379,0.00016502495,0.0000082452625,0.0000013943148,0.000018004304,0.0004780587,0.0423566,0.014560328,0.0001612024,0.0000524649,0.9421545],"study_design_scores_gemma":[0.0001261265,0.000043672648,0.00010054957,0.000030891548,0.0000010573215,0.00008334797,1.9939272e-7,0.7485667,0.2485082,0.0023166158,0.000082306404,0.00014032105],"about_ca_topic_score_codex":0.00006938487,"about_ca_topic_score_gemma":0.00003157619,"teacher_disagreement_score":0.9420142,"about_ca_system_score_codex":0.00028475208,"about_ca_system_score_gemma":0.0003067263,"threshold_uncertainty_score":0.61023605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003429763,0.0006018202,0.99626464,0.0007452291,0.00068735663,0.0009558297,0.000006801861,0.000021001122,0.0003743709],"genre_scores_gemma":[0.9834168,0.000043261025,0.01515246,0.00093479,0.00021993369,0.000028912254,9.039155e-7,0.000030897,0.00017202033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985541,0.00004291974,0.00046162307,0.00027217166,0.0003467556,0.00032243377],"domain_scores_gemma":[0.9977416,0.0013149859,0.00016544621,0.0006481954,0.00010451343,0.000025293544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063215743,0.0002448701,0.00034013117,0.0001233921,0.00013475605,0.00012544186,0.0013940019,0.00013508431,0.000004713824],"category_scores_gemma":[0.00011662312,0.00012809933,0.00015053006,0.00019415605,0.00040163897,0.00008256204,0.000099887904,0.0004184353,0.0000012434361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008481348,0.000009901031,0.00003006037,0.000033654156,0.000012878411,7.038456e-7,0.00053674186,0.8417947,0.00047359697,0.0022667546,0.000016292035,0.15481623],"study_design_scores_gemma":[0.0008825753,0.00007096836,0.0012301926,0.00043251138,0.000025605927,0.000007722745,0.0000010599025,0.9877215,0.00097517803,0.0052229706,0.0031854345,0.00024429665],"about_ca_topic_score_codex":0.000013098865,"about_ca_topic_score_gemma":0.00039632802,"teacher_disagreement_score":0.98307383,"about_ca_system_score_codex":0.00007973832,"about_ca_system_score_gemma":0.00009039508,"threshold_uncertainty_score":0.5223739},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038264322,0.000392652,0.9928922,0.00062472734,0.0041580363,0.00054766174,0.0000026278212,0.00019288652,0.00080657296],"genre_scores_gemma":[0.3719091,0.000017665056,0.6256216,0.0011162875,0.0010493458,0.000060258215,0.00004322061,0.000028903007,0.00015358483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962315,0.00010847182,0.001170357,0.0007378459,0.0008986127,0.0008532461],"domain_scores_gemma":[0.9974621,0.00026589946,0.0006214974,0.0010525234,0.00041902854,0.0001789487],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001630666,0.0004486988,0.0004617331,0.0019411356,0.00027574613,0.001178343,0.0032706775,0.0003500009,0.000017518674],"category_scores_gemma":[0.00016697147,0.0004537667,0.00015959812,0.0024382828,0.0004715822,0.0047982815,0.00112582,0.0009377553,0.00018214206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019753659,0.00011692811,0.00021072074,0.00014434376,0.000002135862,0.0000039442984,0.0057948097,0.023440536,0.000011531337,0.0009229716,0.00008159636,0.9692685],"study_design_scores_gemma":[0.0001304849,0.00012561695,0.0029163556,0.0019454764,0.00000851629,0.00006267492,0.000003247051,0.9556726,0.00045824228,0.036633752,0.0013023994,0.0007406059],"about_ca_topic_score_codex":0.00007061041,"about_ca_topic_score_gemma":0.00027502183,"teacher_disagreement_score":0.9685279,"about_ca_system_score_codex":0.0013677072,"about_ca_system_score_gemma":0.0017355882,"threshold_uncertainty_score":0.99985856},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035370828,0.00079946633,0.9966104,0.00031740652,0.00045308506,0.0012918282,0.000108275446,0.00004688486,0.000018967656],"genre_scores_gemma":[0.007979426,0.000105443374,0.9906317,0.00049576146,0.0004202444,0.0001288569,0.00012879983,0.000025467607,0.00008432128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976743,0.000016856604,0.00039072265,0.0011824152,0.00035110686,0.00038458902],"domain_scores_gemma":[0.9988277,0.00022069977,0.00022997106,0.00052721385,0.00006170839,0.0001327221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047247976,0.0003464074,0.0003215495,0.0002454823,0.00032078804,0.00024751056,0.00041061675,0.00011653462,0.000006384817],"category_scores_gemma":[0.000010201708,0.0003228328,0.000045527868,0.00006690874,0.00029678873,0.0012494454,0.00038499487,0.00011508864,0.0000017255987],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009222162,0.000011659222,0.000022830785,0.000045552486,0.0000067782216,0.0000020117188,0.001453295,0.0010321249,0.00079696457,0.023319114,0.000009555117,0.9732909],"study_design_scores_gemma":[0.004143785,0.0027575337,0.00077194016,0.00043058427,0.00005499163,0.00017900844,0.000045248253,0.73995894,0.025952382,0.10131939,0.12168563,0.0027005633],"about_ca_topic_score_codex":0.000019408542,"about_ca_topic_score_gemma":0.000083917585,"teacher_disagreement_score":0.97059035,"about_ca_system_score_codex":0.00016038133,"about_ca_system_score_gemma":0.000082956074,"threshold_uncertainty_score":0.9999224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11607095,0.002477576,0.87041795,0.0000594817,0.0010406917,0.00026969524,0.00008305672,0.0004016878,0.009178925],"genre_scores_gemma":[0.98618555,0.000032549535,0.011895533,0.000086520835,0.0016788251,0.0000026284144,0.000016089354,0.000028538585,0.000073756426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749976,0.000012273926,0.00045599812,0.0009861218,0.0005035027,0.0005423333],"domain_scores_gemma":[0.9988153,0.00021382685,0.0002711787,0.00048702204,0.00008269423,0.00012998552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026114742,0.00042039633,0.00049459975,0.00031951736,0.0003619339,0.0003645949,0.00051928434,0.00027522372,0.00006590861],"category_scores_gemma":[0.000049732353,0.00040358864,0.00009209126,0.00036978285,0.00046102068,0.00022092437,0.0002999958,0.00086088484,0.0000036320369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016953479,0.00008290552,0.0024267621,0.0015372041,0.00013581454,0.00040147844,0.0005366126,0.32679692,0.015561259,0.0028461518,0.000027602287,0.6494778],"study_design_scores_gemma":[0.00014263384,0.0000467606,0.000047606314,0.00048030788,0.00012781125,0.00024232698,0.0000011655079,0.97248673,0.011740644,0.014104013,0.000045556193,0.0005344374],"about_ca_topic_score_codex":0.00010579433,"about_ca_topic_score_gemma":0.000024537287,"teacher_disagreement_score":0.8701146,"about_ca_system_score_codex":0.00036869803,"about_ca_system_score_gemma":0.00019105033,"threshold_uncertainty_score":0.9998416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006733866,0.0050270306,0.95768666,0.0014314835,0.0012913635,0.000893034,0.000012561759,0.0003383441,0.026585659],"genre_scores_gemma":[0.32330516,0.0010409177,0.6600847,0.0076655415,0.0008053889,0.000020101783,0.00005058052,0.00020500537,0.006822598],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99779344,0.000009375004,0.00031368135,0.00089013216,0.0004496122,0.00054373435],"domain_scores_gemma":[0.9987038,0.00032297496,0.000115658906,0.0005420501,0.00007164941,0.00024391344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027274364,0.0004250901,0.00048422834,0.00060147146,0.00015639135,0.00035073643,0.00033764108,0.00024101972,0.00008040423],"category_scores_gemma":[0.00008673334,0.00035146406,0.00010473027,0.0003870979,0.0011545867,0.00042209725,0.00015699875,0.0008905512,0.000018326338],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021091956,0.00026620054,0.01953012,0.0007953403,0.0002052838,0.00014657305,0.0026294251,0.0010897161,0.004824156,0.0030122513,0.0011746808,0.96611536],"study_design_scores_gemma":[0.004108978,0.003546261,0.0033997684,0.0068119615,0.00037688165,0.008776991,0.000007626065,0.008398972,0.014573923,0.25877485,0.68730956,0.0039141965],"about_ca_topic_score_codex":0.000009364128,"about_ca_topic_score_gemma":0.000005280114,"teacher_disagreement_score":0.9622011,"about_ca_system_score_codex":0.00006247389,"about_ca_system_score_gemma":0.00021408127,"threshold_uncertainty_score":0.9998937},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000079590376,0.0015254958,0.9932225,0.0005785297,0.00039345713,0.002136498,0.0000049719793,0.00011727402,0.001941708],"genre_scores_gemma":[0.014845396,0.002300593,0.98043585,0.00088287296,0.0002620491,0.0004410149,0.000019063422,0.00007468367,0.0007384504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540025,0.00015945191,0.00066515594,0.0019295666,0.0008431508,0.0010024003],"domain_scores_gemma":[0.9953664,0.0013191705,0.00022837623,0.0026567993,0.00020415224,0.00022513382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025637117,0.00055541954,0.0006700643,0.0009203592,0.00028161833,0.00054440915,0.0042190156,0.00039650436,0.00001180131],"category_scores_gemma":[0.000044948156,0.0005284738,0.00011940492,0.0009714986,0.0008527627,0.00034099986,0.0026590293,0.0011418415,0.0000063958864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008488035,0.00004320747,0.000014225408,0.000049622242,0.000011100641,0.000021187217,0.0002102237,0.2709066,0.0000067237725,0.0045482954,0.00003963083,0.7241407],"study_design_scores_gemma":[0.0004452923,0.00015988045,0.00018577684,0.00025810007,0.000004765373,0.000025640236,2.489932e-7,0.9140942,0.000031266532,0.08070801,0.00355903,0.0005278051],"about_ca_topic_score_codex":0.00002080631,"about_ca_topic_score_gemma":0.00007818066,"teacher_disagreement_score":0.7236129,"about_ca_system_score_codex":0.00040592795,"about_ca_system_score_gemma":0.0001816344,"threshold_uncertainty_score":0.9997167},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011988875,0.000488649,0.9914845,0.00039892178,0.0049639004,0.0004209218,0.000015796297,0.00008511357,0.00094327645],"genre_scores_gemma":[0.04796851,0.000038118033,0.94922936,0.0010601112,0.0010548099,0.0000062165263,0.000011706316,0.000055593275,0.00057560194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935619,0.00015138925,0.0017325858,0.0019140964,0.0017906269,0.000849395],"domain_scores_gemma":[0.9908949,0.0057261917,0.0008172381,0.0011638443,0.0011105913,0.00028720158],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.012023601,0.00050164823,0.0009276791,0.001532766,0.00087018526,0.0012334161,0.001938029,0.00060688483,0.000097225835],"category_scores_gemma":[0.008318354,0.00043093337,0.00040926086,0.001555508,0.0010553366,0.00057374866,0.00030215617,0.0009660622,0.000022411012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008891899,0.000018361092,0.00027868408,0.0000042922866,0.000013620732,0.000004069028,0.00026840522,0.9023369,0.0000070752735,0.0021555617,0.000009995969,0.09489417],"study_design_scores_gemma":[0.00038391748,0.000094944124,0.000027322658,0.0001973398,0.00003851919,0.000028707094,0.0000038137898,0.91212344,0.00003036122,0.08373671,0.0028550152,0.0004798843],"about_ca_topic_score_codex":0.000011672747,"about_ca_topic_score_gemma":0.000025496422,"teacher_disagreement_score":0.09441429,"about_ca_system_score_codex":0.00020197705,"about_ca_system_score_gemma":0.0012975443,"threshold_uncertainty_score":0.9998143},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00149831,0.0002299267,0.9942268,0.00020307538,0.0015913451,0.000491762,4.8879446e-7,0.0002806762,0.0014775839],"genre_scores_gemma":[0.854559,0.00006056055,0.1413269,0.00048169322,0.00071977294,0.000039388808,0.000005202905,0.000090451606,0.0027170242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99524957,0.00010860274,0.000713594,0.0018570832,0.0011696287,0.00090153585],"domain_scores_gemma":[0.99832773,0.0002931557,0.00040751745,0.00066868315,0.0000914055,0.00021150106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018387518,0.0006010274,0.0005708889,0.0015606399,0.000406066,0.0005892702,0.0018876196,0.0003277409,0.000014876492],"category_scores_gemma":[0.00016661684,0.00063137506,0.00011817034,0.00067508867,0.00011303326,0.0009526999,0.0011610815,0.0017262882,0.00017667362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003843966,0.000026185724,0.00036306397,0.000037897873,0.000010292659,0.00011606158,0.0050781136,0.77019036,0.0015509999,0.03185267,9.712803e-7,0.19076952],"study_design_scores_gemma":[0.0016789313,0.0019586713,0.0016121259,0.00623158,0.000026610085,0.00010044835,0.000029169292,0.8596725,0.017677804,0.036166213,0.069915436,0.0049305013],"about_ca_topic_score_codex":0.00005901138,"about_ca_topic_score_gemma":0.000028547043,"teacher_disagreement_score":0.85306066,"about_ca_system_score_codex":0.0017798898,"about_ca_system_score_gemma":0.00043553382,"threshold_uncertainty_score":0.99961376},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006944134,0.00044899166,0.99457955,0.0014627726,0.0008618544,0.00017765419,0.00004127589,0.0001229123,0.0022355272],"genre_scores_gemma":[0.57276684,0.00003303602,0.41918173,0.005952376,0.0014343355,0.000012716493,0.00012309551,0.00006397316,0.0004318608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957696,0.00007400544,0.00054695865,0.0015867116,0.0013659882,0.0006567431],"domain_scores_gemma":[0.9964384,0.0007913295,0.00032889086,0.0021298844,0.00014334879,0.0001681537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091989094,0.0005475184,0.0005352128,0.00066249445,0.00057656434,0.0010281658,0.0048671043,0.00029886415,0.00013222233],"category_scores_gemma":[0.000072701565,0.0003823793,0.00017264884,0.0010294975,0.0006053709,0.00048109345,0.00052629923,0.0009681138,0.00003275428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008236195,0.000023637884,0.00012490105,0.000032407625,0.00004124174,0.00019001197,0.0021684899,0.13537799,0.00029829695,0.0072752293,0.00025764378,0.8542019],"study_design_scores_gemma":[0.0002834103,0.000101831916,0.0005983347,0.00037271972,0.000034483943,0.000065207656,5.7490485e-7,0.9211915,0.00077652145,0.062112864,0.013588574,0.00087398844],"about_ca_topic_score_codex":0.000062347346,"about_ca_topic_score_gemma":0.000084754756,"teacher_disagreement_score":0.85332793,"about_ca_system_score_codex":0.0001774465,"about_ca_system_score_gemma":0.0007160311,"threshold_uncertainty_score":0.9998628},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009849996,0.000070782495,0.9950906,0.0010135847,0.0005677668,0.0009567165,0.000020814869,0.00030368366,0.0019661984],"genre_scores_gemma":[0.32393515,0.0000049623413,0.6718144,0.0033767263,0.00028106195,0.00006932398,0.000012224498,0.00004599932,0.00046016873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954414,0.00002864173,0.000564506,0.0020562122,0.00093404297,0.000975193],"domain_scores_gemma":[0.99744666,0.00048460232,0.00030250655,0.0010567115,0.00042137364,0.00028814466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008337729,0.00070237526,0.0005740949,0.0008081376,0.00037029665,0.00079661247,0.0026661723,0.0004207367,0.000010903198],"category_scores_gemma":[0.00010305465,0.0006723209,0.00023235664,0.0003972025,0.00043609837,0.00045895806,0.00047351772,0.0008057579,0.000025670368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012603933,0.00004782086,0.0000017159656,0.000023837887,0.000005793673,0.000014573654,0.00036749328,0.35138968,0.0000035535813,0.008123256,0.000010340227,0.63999933],"study_design_scores_gemma":[0.00046818197,0.00031640858,0.000003887012,0.0006751628,0.000013969838,0.000010511022,1.0569463e-7,0.9310467,0.00016225317,0.06634486,0.0002453036,0.0007126436],"about_ca_topic_score_codex":0.000006051271,"about_ca_topic_score_gemma":0.000040369763,"teacher_disagreement_score":0.6392867,"about_ca_system_score_codex":0.00037938484,"about_ca_system_score_gemma":0.0012613749,"threshold_uncertainty_score":0.9995728},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001507952,0.0005372371,0.99577826,0.00003210016,0.00039360844,0.00020894346,0.00003588566,0.000007215391,0.0028559463],"genre_scores_gemma":[0.67197007,0.00055660383,0.32240325,0.0011109856,0.0017914199,0.000008507772,0.0005234095,0.00006163695,0.0015741275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863225,0.0000120257455,0.00039897783,0.00045173755,0.0001895459,0.00031545883],"domain_scores_gemma":[0.9990993,0.0000385193,0.00022196032,0.00044910226,0.00013036845,0.000060717874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023079451,0.00026000326,0.00029858842,0.00009053793,0.000062265746,0.000039114948,0.00059379806,0.0004411916,0.00001223185],"category_scores_gemma":[0.000020112437,0.0001772481,0.00007182378,0.00007382162,0.0006990511,0.0000031625887,0.00043227492,0.00028972342,0.0000032377782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041882573,0.00004426322,0.00040965877,0.000056497578,0.000036164052,0.000015970723,0.00004843723,0.49251541,0.0020048018,0.0020385212,0.0021066873,0.5006817],"study_design_scores_gemma":[0.00063359074,0.0012977851,0.00041882944,0.00031126742,0.000027797807,0.000059888065,2.0130048e-7,0.9278892,0.002650541,0.034090426,0.031413283,0.0012071645],"about_ca_topic_score_codex":0.0000113401275,"about_ca_topic_score_gemma":0.000046200123,"teacher_disagreement_score":0.673375,"about_ca_system_score_codex":0.000027584349,"about_ca_system_score_gemma":0.00016779502,"threshold_uncertainty_score":0.7227968},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006495388,0.000116833464,0.9939089,0.00005842419,0.0025443481,0.0008692523,0.000014079925,0.00010570068,0.0023175532],"genre_scores_gemma":[0.12608203,0.0000059985687,0.873558,0.00012693596,0.00014039486,0.00002990735,0.000011466811,0.000014547795,0.00003074915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970353,0.000023179515,0.0010013852,0.0006317803,0.0008807342,0.00042760858],"domain_scores_gemma":[0.99646705,0.0005267748,0.00094398536,0.0013154821,0.0006539691,0.000092720715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018793824,0.00035155367,0.00061049295,0.0007721474,0.00019649109,0.00075173395,0.0030296291,0.0004649386,0.0000010584263],"category_scores_gemma":[0.00046133343,0.00033549144,0.00012022828,0.00038222226,0.00041311278,0.0030145126,0.00060400105,0.0006975587,0.000007670878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005896978,0.000013204702,0.000011055621,0.00015842999,0.0000045228417,2.2967293e-7,0.0012159387,0.29995576,0.00076511083,0.24280801,0.0000036701415,0.45505816],"study_design_scores_gemma":[0.0001549301,0.000104921986,0.000018344968,0.00023446453,0.0000061321534,0.000007632231,4.3212748e-7,0.9538301,0.012178429,0.03182851,0.0013028376,0.00033325425],"about_ca_topic_score_codex":0.000008026829,"about_ca_topic_score_gemma":0.000005620807,"teacher_disagreement_score":0.65387434,"about_ca_system_score_codex":0.00018810046,"about_ca_system_score_gemma":0.00046841998,"threshold_uncertainty_score":0.9999097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032350872,0.00060880935,0.9920576,0.00039614103,0.0053666253,0.00042112352,0.000005597545,0.00082504004,0.00028668495],"genre_scores_gemma":[0.00227417,0.000046280016,0.9956943,0.0006642876,0.0010436617,0.000016058446,0.000008446145,0.000054012387,0.00019877464],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956886,0.000058212598,0.00052781473,0.0018049573,0.0010763172,0.0008441055],"domain_scores_gemma":[0.99637496,0.0009369679,0.00027379126,0.0019308114,0.0002719537,0.00021149269],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011208778,0.0006943289,0.0006176733,0.0011396623,0.0002851085,0.00048289914,0.0039915,0.0006046646,0.000019418076],"category_scores_gemma":[0.0012505964,0.0006389586,0.0001599677,0.0007886474,0.00060219906,0.0005496298,0.0016436549,0.0019287084,0.00003305428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014756037,0.000008451277,0.0000049045407,0.000019381567,0.0000052117307,0.00005050444,0.0002335126,0.2846176,0.0007233759,0.0034949633,0.000005528238,0.7108351],"study_design_scores_gemma":[0.00042313556,0.00025939022,0.00013559451,0.00023547179,0.000015140407,0.0002780228,5.457636e-8,0.16691086,0.0205697,0.8030304,0.006244299,0.0018979561],"about_ca_topic_score_codex":0.000008463484,"about_ca_topic_score_gemma":0.000041640193,"teacher_disagreement_score":0.7995354,"about_ca_system_score_codex":0.00033449076,"about_ca_system_score_gemma":0.0006649677,"threshold_uncertainty_score":0.9996062},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34508336,0.0009050499,0.6532706,0.00006066621,0.00031314566,0.00019351448,0.000045183653,0.000009026041,0.000119449425],"genre_scores_gemma":[0.90674305,0.00016673471,0.09155469,0.00022527108,0.0009952354,0.000003149402,0.00011861974,0.00004227919,0.00015099035],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984822,0.000023312903,0.00029477422,0.0006878722,0.0001821509,0.0003296645],"domain_scores_gemma":[0.9989048,0.000071049544,0.00032968112,0.00045191834,0.00015070905,0.00009181122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039195424,0.0003368591,0.00037291946,0.00017257946,0.00025211865,0.0001224852,0.00045575137,0.0005379335,0.0000034162715],"category_scores_gemma":[0.000018958082,0.00032115463,0.00008758494,0.000080865866,0.00036082702,0.0000093568215,0.0004501413,0.00040136825,0.0000014938914],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003946998,0.000084835316,0.052532744,0.0002496682,0.00064827944,0.00002248845,0.0063402206,0.057241745,0.7920835,0.0006565693,0.000045688274,0.090054765],"study_design_scores_gemma":[0.0024989655,0.00088042114,0.045779727,0.000863566,0.00020977201,0.00025745848,0.000027424636,0.5919941,0.20703432,0.119266525,0.024897838,0.006289891],"about_ca_topic_score_codex":0.000009994774,"about_ca_topic_score_gemma":0.00013661616,"teacher_disagreement_score":0.5850492,"about_ca_system_score_codex":0.00018133476,"about_ca_system_score_gemma":0.00025825904,"threshold_uncertainty_score":0.99992406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041799764,0.0006452348,0.953742,0.00013692834,0.0012444989,0.00022782126,0.000021463957,0.00024377702,0.039558295],"genre_scores_gemma":[0.91201466,0.000017261022,0.08503967,0.000345217,0.0015179177,0.000016421021,0.00006660877,0.000057684905,0.00092457596],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99618256,0.000025290523,0.00065867865,0.0012018246,0.0014510244,0.00048059723],"domain_scores_gemma":[0.9973566,0.00044415364,0.0004957086,0.0011587157,0.00039419442,0.0001506184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013848653,0.00048733572,0.0007452215,0.0005278418,0.00024827677,0.00024964122,0.0013078075,0.0006589103,0.0008523028],"category_scores_gemma":[0.00017455244,0.00044647537,0.00019173247,0.00050485804,0.00058843696,0.00014012118,0.00038052638,0.0011772601,0.000054821354],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013859874,0.00025527796,0.0014531636,0.0021063297,0.00032824755,0.0001543424,0.0012641265,0.011573081,0.1895912,0.017865459,0.00006821597,0.775202],"study_design_scores_gemma":[0.0032112405,0.00017809916,0.00069847034,0.0017497845,0.0007809531,0.0002873265,0.0000056041563,0.42473647,0.4783683,0.081521615,0.0042240536,0.004238068],"about_ca_topic_score_codex":0.00005779319,"about_ca_topic_score_gemma":0.000047952235,"teacher_disagreement_score":0.90783465,"about_ca_system_score_codex":0.0006850652,"about_ca_system_score_gemma":0.0005000005,"threshold_uncertainty_score":0.9997987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014312551,0.0006139075,0.9951696,0.000681608,0.0003619662,0.00030606418,0.0000046574637,0.0007360274,0.0019830675],"genre_scores_gemma":[0.14750925,0.00012224755,0.8490627,0.0013564457,0.00030787417,0.000019298783,0.000023534649,0.000047774116,0.0015508843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946909,0.000055985016,0.00086122716,0.002130135,0.0014882628,0.00077352213],"domain_scores_gemma":[0.9959197,0.00041815784,0.00066155905,0.0024918648,0.00029252007,0.00021617819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009566785,0.00072124635,0.0009866881,0.002411108,0.00027636462,0.0006663454,0.0041801916,0.00045886883,0.00017009577],"category_scores_gemma":[0.000072111434,0.00068518135,0.00045607603,0.0029828486,0.00050812133,0.0016638825,0.0011144945,0.0009844884,0.000090475325],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014259092,0.000046336936,0.00009268912,0.000016491802,0.00012648234,0.00003900125,0.00017122919,0.029220557,0.00021460236,0.0045089778,0.00011436141,0.96544784],"study_design_scores_gemma":[0.000120028606,0.000080638,0.0001868048,0.00011074495,0.00016279775,0.000028359465,7.109492e-8,0.91219795,0.0023838452,0.079817064,0.0040269974,0.0008847205],"about_ca_topic_score_codex":0.000037385034,"about_ca_topic_score_gemma":0.00028721127,"teacher_disagreement_score":0.96456313,"about_ca_system_score_codex":0.0007547525,"about_ca_system_score_gemma":0.00025454018,"threshold_uncertainty_score":0.99955994},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030405989,0.00031210025,0.99294996,0.0002184229,0.0019886245,0.00034766784,0.00001350165,0.0007559294,0.0033833897],"genre_scores_gemma":[0.1360673,0.0000563118,0.862644,0.00053740223,0.00037721006,0.0000075620665,0.000008158136,0.000043562817,0.00025847074],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954039,0.000017074099,0.0005347542,0.0019415146,0.0011409875,0.00096179085],"domain_scores_gemma":[0.99656826,0.0005420385,0.00034994428,0.0021779458,0.00020763563,0.00015420275],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005291686,0.000650718,0.00060762005,0.0013380329,0.00031072393,0.0004089257,0.005936773,0.00047940275,0.000028279335],"category_scores_gemma":[0.00015994007,0.0006054595,0.0001296322,0.0007950364,0.0013216895,0.0010438197,0.0041694655,0.001321996,0.00007923061],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006516497,0.00001763913,0.000007443971,0.000012736121,0.000009184283,0.00022623176,0.00019980546,0.0034725196,0.00020911964,0.15315464,0.000021543774,0.84266263],"study_design_scores_gemma":[0.00039056115,0.00032247146,0.00007819266,0.00043721325,0.000010815878,0.00013691248,5.251118e-7,0.480611,0.007290556,0.50716645,0.002152904,0.0014024207],"about_ca_topic_score_codex":0.00001426816,"about_ca_topic_score_gemma":0.00007343162,"teacher_disagreement_score":0.8412602,"about_ca_system_score_codex":0.0005486913,"about_ca_system_score_gemma":0.00029915466,"threshold_uncertainty_score":0.9996397},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012454555,0.00067493005,0.97303575,0.00010328194,0.0012634884,0.0005718398,0.000024656292,0.000027386755,0.01184409],"genre_scores_gemma":[0.7514395,0.000029612742,0.2479453,0.00030679148,0.00004666169,0.0000047357366,0.000001380686,0.000028717865,0.00019727688],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991161,0.000167386,0.0020495383,0.0022218472,0.003762412,0.00063783035],"domain_scores_gemma":[0.9898385,0.006572537,0.0008915584,0.0017419023,0.0007866683,0.00016885225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00562029,0.00055627164,0.0010148879,0.0034524465,0.00024938738,0.00064192514,0.0026642901,0.00049811444,0.000095304],"category_scores_gemma":[0.0038529993,0.00045833673,0.00013976915,0.0019749154,0.0010034051,0.0008456682,0.0014876175,0.00087079214,0.00004226828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003642962,0.000040818846,0.0007693946,0.000010220021,0.0000032053224,0.000038194816,0.0009847996,0.3214137,0.000082352766,0.009567278,0.000038765225,0.66701484],"study_design_scores_gemma":[0.0003553263,0.000057677415,0.0012296154,0.0010546513,0.000005241955,0.000034997873,0.0000017457243,0.3234227,0.00004643186,0.6731891,0.00023906046,0.00036343694],"about_ca_topic_score_codex":0.000014123133,"about_ca_topic_score_gemma":0.00020117797,"teacher_disagreement_score":0.738985,"about_ca_system_score_codex":0.00025973085,"about_ca_system_score_gemma":0.00036762562,"threshold_uncertainty_score":0.99978685},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005748987,0.00022265103,0.992699,0.0033913585,0.001085257,0.000653432,4.6475478e-7,0.00021207487,0.0011608333],"genre_scores_gemma":[0.045775574,0.000029909814,0.9525725,0.0008244228,0.0001670389,0.000022497228,0.0000019050688,0.000023603137,0.00058251026],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948132,0.00040136283,0.00073074887,0.001960914,0.0011059757,0.0009877781],"domain_scores_gemma":[0.994908,0.0026227161,0.0003241416,0.0010428096,0.0009931666,0.00010918225],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0061616455,0.0005479086,0.0006153334,0.0017244612,0.00055029255,0.000624868,0.0018876352,0.0006611243,0.000020423115],"category_scores_gemma":[0.0011848073,0.00047088272,0.000054496555,0.0009088192,0.0017348854,0.00123877,0.0021832315,0.0027948443,0.000071895185],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036013764,0.000044553344,0.000007780258,0.000023330815,0.000024580704,0.00024733858,0.002524802,0.0010030576,0.0015891865,0.075921506,0.00021327428,0.9183646],"study_design_scores_gemma":[0.00088385027,0.0021831032,0.00056777394,0.0011723724,0.000018980389,0.0037638375,0.000005912512,0.18428335,0.11848719,0.64318645,0.0430964,0.0023507928],"about_ca_topic_score_codex":0.000008124309,"about_ca_topic_score_gemma":0.000030522446,"teacher_disagreement_score":0.9160138,"about_ca_system_score_codex":0.0007243414,"about_ca_system_score_gemma":0.00090471044,"threshold_uncertainty_score":0.9997743},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095492566,0.000458768,0.9948003,0.00023205891,0.0020118952,0.0006030376,0.000011928111,0.00017672824,0.00075033616],"genre_scores_gemma":[0.33329937,0.000331853,0.66241986,0.0015745907,0.0019202634,0.000028482153,0.000029178653,0.00007468374,0.00032173583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563885,0.00006267625,0.0008230696,0.0015587839,0.001072661,0.00084395066],"domain_scores_gemma":[0.99645966,0.00044150895,0.0007095204,0.0018639881,0.00032659373,0.00019871535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095846056,0.0005892265,0.0007468818,0.00040274314,0.00020246414,0.00026771287,0.0034719298,0.00046155628,0.0000336349],"category_scores_gemma":[0.00006323536,0.00057055766,0.00017700798,0.0008676422,0.00064287364,0.0007787097,0.0013662119,0.00087778346,0.00003072628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010711006,0.00004508175,0.00017054744,0.00004317801,0.0000144084115,0.000025193769,0.0006366358,0.07836079,0.0009864471,0.008925741,0.000021874263,0.9107594],"study_design_scores_gemma":[0.00034243363,0.00020533323,0.0011333249,0.00064425456,0.00000971146,0.000039596853,3.428303e-8,0.96631813,0.00092947,0.022254413,0.0073745144,0.00074880064],"about_ca_topic_score_codex":0.000008023843,"about_ca_topic_score_gemma":0.000103228966,"teacher_disagreement_score":0.9100106,"about_ca_system_score_codex":0.00028490674,"about_ca_system_score_gemma":0.000390966,"threshold_uncertainty_score":0.99967456},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2467175,0.000025343821,0.75230354,0.00068216067,0.000030152412,0.00020134174,9.1399727e-7,0.000035511945,0.0000035553387],"genre_scores_gemma":[0.57567286,0.000007380557,0.42394808,0.0003487154,0.000010193427,0.00000286351,0.000006408039,0.0000029096755,6.017692e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911165,0.0000121452995,0.00023153711,0.00024187697,0.00024975496,0.00015302913],"domain_scores_gemma":[0.99905336,0.0004741572,0.000070806134,0.0001828829,0.00014611938,0.00007269976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042199309,0.000079587284,0.00012743038,0.00016682727,0.000052132375,0.000023700057,0.00010054561,0.000024819818,0.0000074173176],"category_scores_gemma":[0.0005410054,0.00006390419,0.000014415112,0.0006360485,0.0004097692,0.00006219883,0.00004742865,0.00008057312,6.8970826e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002077266,0.00013063327,0.00551422,0.00010977071,0.000004599735,0.000025884525,0.00059297064,0.030625155,0.06508418,0.00018451268,0.000016449208,0.89769083],"study_design_scores_gemma":[0.00020960663,0.00009537472,0.0057472643,0.00008125583,0.000009164136,0.000077432895,0.0000012453839,0.96245074,0.027291179,0.003966468,0.0000075658686,0.000062702675],"about_ca_topic_score_codex":0.000034516597,"about_ca_topic_score_gemma":0.000009294671,"teacher_disagreement_score":0.9318256,"about_ca_system_score_codex":0.00005156888,"about_ca_system_score_gemma":0.00004999637,"threshold_uncertainty_score":0.26059374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008744824,0.00041768566,0.9902348,0.00071709463,0.006074689,0.00086428726,0.000023788327,0.00047891235,0.0011013026],"genre_scores_gemma":[0.17940082,0.000038265607,0.81711996,0.0015752319,0.00079170096,0.000039547904,0.000029213668,0.000104066654,0.000901175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931998,0.00008360105,0.0010161059,0.002599485,0.0016015915,0.0014994094],"domain_scores_gemma":[0.9953011,0.0004152617,0.00060773257,0.002745397,0.0004183544,0.0005121333],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012271893,0.000990035,0.0010346342,0.00088109414,0.0005091592,0.0014244085,0.006688928,0.00071216805,0.00005508955],"category_scores_gemma":[0.000110484034,0.00093260064,0.00032413463,0.00076785486,0.00085057394,0.0009917996,0.0017846102,0.0018461174,0.00027781303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001570973,0.00015175762,0.00042291768,0.00008604169,0.000052978277,0.0003405284,0.0017200991,0.015545612,0.012868987,0.0035931407,0.000039383835,0.9651628],"study_design_scores_gemma":[0.001535655,0.000077983444,0.00041207223,0.0004262566,0.000019444726,0.00019768352,2.323583e-7,0.97058827,0.005192606,0.012451498,0.007717545,0.0013807614],"about_ca_topic_score_codex":0.00010129799,"about_ca_topic_score_gemma":0.00030289614,"teacher_disagreement_score":0.9637821,"about_ca_system_score_codex":0.00051384466,"about_ca_system_score_gemma":0.0006046271,"threshold_uncertainty_score":0.9996122},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06343025,0.000857335,0.9349782,0.00008576199,0.00011601453,0.00041622203,0.00004703334,0.000024769806,0.000044432545],"genre_scores_gemma":[0.7319917,0.000023168099,0.26792505,0.00001626187,0.000022184004,8.888628e-7,0.0000034778095,0.000011775004,0.0000054736843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662447,0.0003245359,0.0008318754,0.0011403153,0.0007115057,0.0003672857],"domain_scores_gemma":[0.99571776,0.0015408682,0.00080645387,0.0015253632,0.00031438193,0.00009518556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001984388,0.00038668694,0.0009132978,0.000553553,0.00012603466,0.000120667144,0.0016695461,0.00014597441,0.0000034543446],"category_scores_gemma":[0.00030908323,0.0003503333,0.00003354925,0.00049450103,0.002273514,0.0008533521,0.001067237,0.00036256984,6.5742555e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027209445,0.00026644443,0.026500277,0.0015397231,0.00009705716,0.00008185955,0.012535863,0.67484754,0.07422683,0.01173888,0.000005960152,0.19788747],"study_design_scores_gemma":[0.00072935957,0.00030195498,0.0023677547,0.0012321989,0.000017888615,0.000063207015,0.000006228731,0.98629177,0.005029951,0.0036224935,0.0000030729425,0.0003341282],"about_ca_topic_score_codex":0.00064658653,"about_ca_topic_score_gemma":0.0001676866,"teacher_disagreement_score":0.66856146,"about_ca_system_score_codex":0.00013273409,"about_ca_system_score_gemma":0.00039947344,"threshold_uncertainty_score":0.99989486},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021764596,0.000003754482,0.9899802,0.001872265,0.00032967006,0.00044501649,0.000044067623,0.000018514245,0.00513004],"genre_scores_gemma":[0.35026628,0.0000022614154,0.646396,0.0025843037,0.00035006736,0.000026646314,0.00003537519,0.000045448105,0.0002936334],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973274,0.000057536672,0.000704641,0.00029786344,0.001366423,0.00024614175],"domain_scores_gemma":[0.9964062,0.002299708,0.0003891418,0.0005559178,0.0002852565,0.000063754946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021531652,0.0002956183,0.00037732834,0.00027687938,0.0004397023,0.00009522654,0.0006672748,0.00015288302,0.00055608375],"category_scores_gemma":[0.00029578968,0.0001545578,0.00029740288,0.00026040265,0.00063000363,0.00022987583,0.00006941351,0.0010496468,0.0000075415714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008966418,0.00052039936,0.000018121067,0.0003874463,0.00012546543,0.00000445494,0.0015481081,0.037712354,0.0011883132,0.34113806,0.00004831605,0.6172193],"study_design_scores_gemma":[0.00040140894,0.000057872978,0.000013032227,0.00031171864,0.000032835367,0.0000053502854,1.9635681e-7,0.27759528,0.0040392783,0.7170695,0.0003186022,0.00015493073],"about_ca_topic_score_codex":0.00000696948,"about_ca_topic_score_gemma":0.000052882126,"teacher_disagreement_score":0.61706436,"about_ca_system_score_codex":0.00006728802,"about_ca_system_score_gemma":0.00024266342,"threshold_uncertainty_score":0.63026845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021170388,0.00033954345,0.98031557,0.0031898143,0.0011177238,0.00027141083,0.0000024555566,0.00025985314,0.014501518],"genre_scores_gemma":[0.0038564655,0.00006733272,0.99133515,0.003206306,0.0004286325,0.0000036967658,0.000008115655,0.000027470636,0.0010668479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620616,0.00003257313,0.00054543576,0.0015300511,0.0010794227,0.00060636416],"domain_scores_gemma":[0.9976046,0.00025525453,0.00034127952,0.0012790516,0.0003395567,0.00018023411],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006229016,0.00049803767,0.0004163042,0.0007430437,0.00042999498,0.0007944765,0.002303265,0.00022267338,0.000023487391],"category_scores_gemma":[0.000078395286,0.00048307647,0.00012673094,0.0006905578,0.0005709243,0.0018342211,0.0006343413,0.00079256867,0.0000623084],"study_design_candidate":"design_other","study_design_consensus":null,"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.662826e-7,0.000017011558,0.0000010200364,0.0000069718535,0.0000024871401,0.000048105732,0.00018809385,0.0034184211,0.00037742345,0.0072500394,0.000027859505,0.9886616],"study_design_scores_gemma":[0.00020445522,0.00008507239,0.000052762287,0.0002246695,0.0000045103143,0.00013247551,2.566914e-7,0.7834748,0.0008186913,0.21177211,0.002697489,0.00053268694],"about_ca_topic_score_codex":0.000006863081,"about_ca_topic_score_gemma":0.0000074780432,"teacher_disagreement_score":0.9881289,"about_ca_system_score_codex":0.00035299626,"about_ca_system_score_gemma":0.00040694122,"threshold_uncertainty_score":0.9997621},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018191204,0.014903267,0.8918701,0.0029114017,0.0013394662,0.00028842603,0.0000043807777,0.0002584218,0.08840638],"genre_scores_gemma":[0.08634258,0.011245448,0.89553845,0.0039061655,0.0014831625,0.00003054091,0.000013781595,0.00011165913,0.0013281963],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576133,0.000030052468,0.00044512632,0.0020619074,0.0008844144,0.00081717595],"domain_scores_gemma":[0.99769336,0.00021122562,0.00023628524,0.0014985254,0.00011578446,0.00024479927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006230837,0.00063411985,0.00061903486,0.00079453393,0.00025129935,0.00056725077,0.002621196,0.00038574077,0.000021734899],"category_scores_gemma":[0.000030032046,0.0005309154,0.00010433729,0.00053562695,0.00064347166,0.0006913268,0.0015631478,0.00076930516,0.00003238086],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025457953,0.00002169708,0.000010583837,0.000023895906,0.0000069512867,0.00020005324,0.00070438616,0.000623136,0.000002057683,0.060020175,0.00003516098,0.93834937],"study_design_scores_gemma":[0.0006219768,0.000571379,0.0010175298,0.00048481132,0.000014026851,0.00066001294,3.3393502e-7,0.27789485,0.000037574842,0.67930233,0.037852235,0.0015429306],"about_ca_topic_score_codex":0.000016232256,"about_ca_topic_score_gemma":0.00009998641,"teacher_disagreement_score":0.93680644,"about_ca_system_score_codex":0.00018522918,"about_ca_system_score_gemma":0.00020330693,"threshold_uncertainty_score":0.99971426},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032181637,0.0011240289,0.9943811,0.00038540212,0.0001479672,0.00046576216,0.0000014404329,0.000021960264,0.00025414565],"genre_scores_gemma":[0.72065103,0.00003856503,0.27918163,0.000029657862,0.000050633527,0.000011779463,0.0000016375573,0.0000060487387,0.000029009063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813366,0.000044690732,0.00059144717,0.00055808364,0.00036997025,0.00030212803],"domain_scores_gemma":[0.9984617,0.00039780096,0.00032725107,0.00063965545,0.00013699938,0.000036548165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076138345,0.00018638275,0.00026072864,0.0003709284,0.00010228275,0.00006688019,0.0013305348,0.00013524992,0.0000010778989],"category_scores_gemma":[0.00006885283,0.00015608667,0.00005765741,0.00091628986,0.00027816294,0.0002454254,0.0002794923,0.00030623795,0.0000011827995],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003005657,0.00004033143,0.00127225,0.000009612371,0.0000014439098,0.0000022555619,0.0002457544,0.07085001,0.00035156327,0.049824137,3.0231976e-7,0.8773993],"study_design_scores_gemma":[0.000111252855,0.000064882275,0.067782536,0.00016395583,0.0000015081251,0.000005436357,4.313836e-7,0.49932715,0.0002123592,0.43205473,0.00013701756,0.00013874964],"about_ca_topic_score_codex":0.0002651213,"about_ca_topic_score_gemma":0.0005722908,"teacher_disagreement_score":0.87726057,"about_ca_system_score_codex":0.00022763312,"about_ca_system_score_gemma":0.00020235869,"threshold_uncertainty_score":0.636503},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09332209,0.011977187,0.8840691,0.00065192184,0.00063232915,0.0016194038,0.00027589747,0.000038303657,0.0074137673],"genre_scores_gemma":[0.89674586,0.007816749,0.086944394,0.0015396323,0.0006348061,0.00004919004,0.0005893912,0.00012910424,0.0055508763],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845344,0.000018258124,0.00030122988,0.00065441785,0.00030799594,0.0002646515],"domain_scores_gemma":[0.9991936,0.000015274127,0.00013555321,0.0004760781,0.00009694956,0.00008250863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002455346,0.00024846557,0.00026257077,0.0001897455,0.00008324164,0.0000400818,0.00039795248,0.00020221317,0.00006128867],"category_scores_gemma":[0.000015084127,0.00024839822,0.000061232226,0.00009941789,0.00044126427,0.0000068154827,0.00025141943,0.00015542208,0.0000072107064],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004802117,0.00010903464,0.00035123824,0.00010149715,0.00013566227,0.000013780144,0.00034642793,0.002645162,0.75567156,0.00007309538,0.00024848274,0.24025603],"study_design_scores_gemma":[0.009605277,0.0072934856,0.011650668,0.002111816,0.0005338963,0.0003469124,0.000008449167,0.00870876,0.35034016,0.047277197,0.5542598,0.007863596],"about_ca_topic_score_codex":0.000018279161,"about_ca_topic_score_gemma":0.00001868663,"teacher_disagreement_score":0.80342376,"about_ca_system_score_codex":0.000047357888,"about_ca_system_score_gemma":0.00009632368,"threshold_uncertainty_score":0.99999684},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004416172,0.00021706463,0.99626833,0.0006743696,0.0012347309,0.0007643486,0.000018175195,0.00012590179,0.00065292005],"genre_scores_gemma":[0.12380683,0.00015674328,0.87504506,0.00044268675,0.0001525895,0.000020119367,0.000017498616,0.000023903793,0.00033457356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757314,0.00003253444,0.0004526096,0.0010302064,0.00048489496,0.0004266125],"domain_scores_gemma":[0.99808073,0.00049083907,0.00023891857,0.0005502193,0.0004970503,0.00014226006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046854874,0.00035545268,0.00036099798,0.0005555592,0.0005103597,0.0002843048,0.00069908804,0.00026243337,0.000014286972],"category_scores_gemma":[0.0001012478,0.00036046843,0.0000852869,0.00036057338,0.0011809852,0.00072869717,0.00037287155,0.00043692975,0.000007752464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015311793,0.000024267392,0.00060634466,0.00005515049,0.000016796139,0.000017401684,0.0024916674,0.15358397,0.00007206868,0.054917276,0.00006372451,0.788136],"study_design_scores_gemma":[0.00062976696,0.00007023732,0.0007362329,0.00015199781,0.000005433368,0.00020229397,7.070064e-7,0.98760504,0.00026171826,0.009600068,0.00031445397,0.0004220685],"about_ca_topic_score_codex":0.000018659506,"about_ca_topic_score_gemma":0.0000691098,"teacher_disagreement_score":0.83402103,"about_ca_system_score_codex":0.00031021948,"about_ca_system_score_gemma":0.0005646704,"threshold_uncertainty_score":0.9998847},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032655331,0.000041190844,0.99081373,0.0013368541,0.00334253,0.00080162287,0.00003794827,0.00013808452,0.00022250917],"genre_scores_gemma":[0.77879655,0.0000071107215,0.20865677,0.009179063,0.0028007715,0.000039289105,0.000012755178,0.00010433747,0.00040333875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650854,0.00003223083,0.0004729492,0.0015389296,0.00076066627,0.0006866997],"domain_scores_gemma":[0.99752367,0.0012419807,0.00028662654,0.00069027557,0.000102272716,0.00015515105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038715996,0.00049231306,0.0004360271,0.00052318804,0.00044392128,0.00039804153,0.0009826545,0.00039405833,0.00004966593],"category_scores_gemma":[0.0004700314,0.00045817308,0.00017187723,0.00037984666,0.0006883796,0.00021807043,0.00020796306,0.00076635194,0.00002810198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006403462,0.000037247315,0.0000029738173,0.00003661069,0.0000021121816,0.00004836856,0.00009578847,0.10349027,0.120805874,0.046148505,0.000014872094,0.72925335],"study_design_scores_gemma":[0.00015369113,0.00021565652,0.000011698745,0.00015915996,0.00000988857,0.000026284146,4.45975e-8,0.73660624,0.13356751,0.12779295,0.0009867718,0.00047007157],"about_ca_topic_score_codex":0.0000038995668,"about_ca_topic_score_gemma":0.00002321872,"teacher_disagreement_score":0.78215694,"about_ca_system_score_codex":0.00022602527,"about_ca_system_score_gemma":0.00023433375,"threshold_uncertainty_score":0.999787},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002006356,0.00019524913,0.9935179,0.00030764425,0.0016704097,0.00033954205,0.00005743765,0.00021936723,0.0016861204],"genre_scores_gemma":[0.40914387,0.000015268075,0.5897964,0.00019888827,0.0007651435,0.0000041805365,0.00002801941,0.00003237438,0.000015849035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596936,0.00005070074,0.00059681013,0.0017414427,0.0008846392,0.00075702806],"domain_scores_gemma":[0.9976052,0.0004620225,0.00023997325,0.0012898725,0.0002047817,0.00019816738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006382355,0.0005878959,0.00058509747,0.001453488,0.00054173335,0.0010022002,0.0030893097,0.0003551366,0.000012650264],"category_scores_gemma":[0.00003895181,0.00059709244,0.00026523325,0.0011176086,0.0009346371,0.0018124754,0.0008855346,0.0013670333,0.0000108491895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016812843,0.00012398437,0.0003018169,0.000070510585,0.00009053656,0.00021255962,0.004276278,0.26359743,0.00057282863,0.032069318,0.00014338897,0.69852453],"study_design_scores_gemma":[0.00075571204,0.000490645,0.0008449837,0.0012241909,0.00010368519,0.00035026253,0.0000023211421,0.7522577,0.0034809883,0.23492722,0.0028687525,0.002693556],"about_ca_topic_score_codex":0.00020546971,"about_ca_topic_score_gemma":0.000101252364,"teacher_disagreement_score":0.695831,"about_ca_system_score_codex":0.00035516298,"about_ca_system_score_gemma":0.0004738257,"threshold_uncertainty_score":0.99964803},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043634366,0.00005029757,0.954437,0.00071684265,0.0005867953,0.00044337616,0.0000037149607,0.000097960954,0.00002962783],"genre_scores_gemma":[0.6334999,0.0000035960413,0.36629352,0.00014797343,0.000045220688,0.0000041498593,5.935536e-7,0.000003984783,0.0000010578772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777836,0.000046382236,0.0002616916,0.00083641784,0.00042965167,0.000647513],"domain_scores_gemma":[0.99817413,0.0008802124,0.00008722023,0.00049539283,0.0001985055,0.00016455505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025477065,0.00015802326,0.00015883707,0.00048182558,0.00029826036,0.00026036287,0.0009024998,0.000071594375,7.0388586e-7],"category_scores_gemma":[0.0003035065,0.00014342993,0.0000322015,0.001573379,0.00084264,0.00089778856,0.00043059874,0.00023830036,0.0000018380847],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050020975,0.000022263679,0.0014367432,0.000019792498,0.0000034989334,0.000022494292,0.0014589104,0.009616855,0.0040816874,0.026030637,0.000004872823,0.9572522],"study_design_scores_gemma":[0.0017497345,0.00046016998,0.02060912,0.000092405804,0.0000023301002,0.00015423672,0.0000072256616,0.6635081,0.024080621,0.2886712,0.00021770921,0.0004471575],"about_ca_topic_score_codex":0.000031564105,"about_ca_topic_score_gemma":0.00017369042,"teacher_disagreement_score":0.95680505,"about_ca_system_score_codex":0.00013466226,"about_ca_system_score_gemma":0.00017217839,"threshold_uncertainty_score":0.5848903},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004131563,0.000027071792,0.99484646,0.0016530508,0.0008105405,0.0006426352,0.0000060171164,0.00023017691,0.0017799072],"genre_scores_gemma":[0.0073648547,0.0000054300303,0.98798966,0.0042537465,0.00019667743,0.000022724544,0.000012070834,0.000016947382,0.0001378868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967058,0.00008335285,0.0010175994,0.00088089734,0.00086509343,0.00044726252],"domain_scores_gemma":[0.99645394,0.00066888274,0.00061468483,0.0013933822,0.0005942649,0.0002748492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014845531,0.00042395198,0.00047601934,0.0011308715,0.00011311807,0.00045019086,0.002830244,0.0002957264,0.000033624336],"category_scores_gemma":[0.0005110797,0.00039738763,0.00013176289,0.0006623694,0.00095503655,0.0017042716,0.0006881691,0.0006259471,0.000050545812],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008076049,0.000017573822,0.000001160741,0.000045964884,0.0000041134253,0.000016049344,0.00039260703,0.001534484,0.0009625354,0.006943982,0.00020555724,0.9898679],"study_design_scores_gemma":[0.00041654703,0.00057078974,0.000018655777,0.00056065,0.000010625748,0.000047308116,8.796802e-7,0.74159926,0.22341971,0.030023225,0.0025597499,0.0007726143],"about_ca_topic_score_codex":0.00003318145,"about_ca_topic_score_gemma":0.000040576328,"teacher_disagreement_score":0.9890953,"about_ca_system_score_codex":0.00040412397,"about_ca_system_score_gemma":0.00087244995,"threshold_uncertainty_score":0.9998478},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041059105,0.0004694496,0.98805463,0.0069963783,0.0010715318,0.0011185532,0.00001734471,0.00018213579,0.0016793987],"genre_scores_gemma":[0.20573981,0.000090920046,0.7788808,0.013319012,0.0011610882,0.00013047998,0.0001072878,0.00011198791,0.00045864933],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691796,0.000043402782,0.00044925674,0.0015135695,0.0005564258,0.0005193969],"domain_scores_gemma":[0.9972602,0.00039300992,0.00033281426,0.0009368769,0.00090289355,0.00017421192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005965682,0.00055328204,0.00046111396,0.00083552854,0.0004179565,0.0006901294,0.0016400368,0.00037467948,0.0000069871944],"category_scores_gemma":[0.000035716617,0.000502822,0.00006589118,0.0010689205,0.00019986962,0.0008098336,0.0006776062,0.00048167608,0.000011149747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007055831,0.000060672402,0.000040043826,0.00042186308,0.00003942304,0.000018014485,0.015188499,0.023749543,0.0023776635,0.28636596,0.00004767884,0.6716201],"study_design_scores_gemma":[0.0010847105,0.0006174826,0.00011697316,0.00057647703,0.00004186242,0.00009773219,0.0000026199205,0.45878884,0.006124495,0.5146171,0.0166384,0.0012933415],"about_ca_topic_score_codex":0.00011028224,"about_ca_topic_score_gemma":0.003156224,"teacher_disagreement_score":0.6703267,"about_ca_system_score_codex":0.00013299487,"about_ca_system_score_gemma":0.00049142353,"threshold_uncertainty_score":0.9997423},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022232515,0.00040217256,0.9957826,0.0007785641,0.0013039055,0.0002815476,0.0000013998807,0.00048285324,0.0007445951],"genre_scores_gemma":[0.39272872,0.00034276702,0.60561913,0.0005458649,0.0002520776,0.0000055388273,0.000005316652,0.000035965844,0.00046459484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966086,0.000019727504,0.0005599238,0.0013277411,0.00091195124,0.00057202706],"domain_scores_gemma":[0.99757326,0.00020666965,0.00041699997,0.0014181082,0.00028739768,0.00009756046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003764362,0.00044929565,0.00040630225,0.0009952112,0.0004146527,0.0004923663,0.0029587962,0.00035241147,0.000010518435],"category_scores_gemma":[0.00012106678,0.0004290273,0.00009371008,0.0009419464,0.00073741726,0.0009901457,0.001227603,0.0006045428,0.000050312436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043769337,0.00006421811,0.00031556727,0.00009358598,0.000020764606,0.00018236595,0.002110519,0.040907145,0.009097582,0.105420284,0.00006735024,0.84171623],"study_design_scores_gemma":[0.00020934084,0.00009598215,0.000121181525,0.00037636198,0.0000095851265,0.00020723365,0.0000010067587,0.870905,0.036365896,0.088772476,0.0019528588,0.0009830967],"about_ca_topic_score_codex":0.000022894936,"about_ca_topic_score_gemma":0.000031203086,"teacher_disagreement_score":0.8407332,"about_ca_system_score_codex":0.00039544117,"about_ca_system_score_gemma":0.0005718154,"threshold_uncertainty_score":0.9998162},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011107406,0.0007584817,0.99230367,0.0028014542,0.0013710032,0.0011946366,0.000005073978,0.00042616963,0.00113839],"genre_scores_gemma":[0.01662917,0.00007079371,0.9718576,0.009482129,0.0010917532,0.00012190477,0.0000028989982,0.00006756603,0.00067615137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963086,0.00007269396,0.0005844985,0.0013177787,0.00091405783,0.0008023435],"domain_scores_gemma":[0.9918405,0.005160912,0.00043834606,0.0020505313,0.00040937867,0.000100358026],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0054875817,0.0005224193,0.00036599467,0.00044296146,0.0010557296,0.00061618455,0.005663828,0.00027733462,0.0000075676835],"category_scores_gemma":[0.0007923456,0.00032427043,0.00017876585,0.0009186229,0.0010440177,0.00044104064,0.0013275127,0.0010756103,0.000010581867],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038544986,0.0000069332405,0.0000034943505,0.00001538627,0.000006734931,0.00000719836,0.00034685165,0.011866565,0.00006231513,0.019841237,0.00010455579,0.9677349],"study_design_scores_gemma":[0.00016625978,0.00023691687,0.000021120524,0.0002552909,0.000009945878,0.00008541107,0.0000015806144,0.75230205,0.0043818257,0.19553548,0.046335198,0.00066891924],"about_ca_topic_score_codex":0.000029703153,"about_ca_topic_score_gemma":0.00017956266,"teacher_disagreement_score":0.96706593,"about_ca_system_score_codex":0.0003267846,"about_ca_system_score_gemma":0.00035085194,"threshold_uncertainty_score":0.99992096},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020126605,0.00045266014,0.9914362,0.00007331193,0.0017198287,0.00040567352,0.000012084277,0.00011529245,0.0037723267],"genre_scores_gemma":[0.94995606,0.000021635833,0.049421508,0.00021647174,0.0002619031,0.000011006116,0.0000052129208,0.000025514735,0.0000806827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675506,0.000055048928,0.0006040188,0.0010645872,0.0009346842,0.00058657804],"domain_scores_gemma":[0.9977472,0.00026106724,0.00042067262,0.0012066413,0.00024191229,0.00012253577],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011811974,0.00039918788,0.0004672436,0.00088766625,0.00018898812,0.0002641246,0.002305301,0.0001910968,0.00005596458],"category_scores_gemma":[0.000015975118,0.00036633882,0.00017206589,0.00087812875,0.00035059938,0.00017515497,0.0008213669,0.00037574198,0.000015450689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069497387,0.00006556664,0.00033158885,0.00007198337,0.000024517289,0.00003998669,0.0012541469,0.073045336,0.00016308404,0.38100892,0.000017157565,0.54397076],"study_design_scores_gemma":[0.0013238702,0.0010761452,0.00070705754,0.0011892649,0.000045662146,0.00014020091,0.000009214177,0.7363048,0.003091482,0.24965234,0.004730393,0.0017295466],"about_ca_topic_score_codex":0.000040665007,"about_ca_topic_score_gemma":0.00004079997,"teacher_disagreement_score":0.9479434,"about_ca_system_score_codex":0.00014349523,"about_ca_system_score_gemma":0.0002829296,"threshold_uncertainty_score":0.9998789},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037476406,0.00016901924,0.9927923,0.0010379866,0.0007921853,0.0007353065,0.000014889243,0.00022912037,0.0038544156],"genre_scores_gemma":[0.6239219,0.000084262916,0.3753241,0.0005175493,0.00007445263,0.0000116591045,0.0000058700116,0.000022155524,0.000038081344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964283,0.00004599911,0.0006056281,0.0015274759,0.0008527139,0.000539877],"domain_scores_gemma":[0.9977989,0.00038043354,0.00037996477,0.0008130679,0.00036663847,0.00026096342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053847407,0.00061839406,0.00067438633,0.00075901573,0.00038404393,0.00058002264,0.00063785724,0.00034075545,0.000080573154],"category_scores_gemma":[0.00003988479,0.0005287368,0.00008723513,0.00043013034,0.0025626356,0.0009854278,0.00034008612,0.0007245884,0.000008997541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020729167,0.000012129578,0.000104628714,0.00003369659,0.00002198584,0.00008619123,0.0004552513,0.1433829,0.000033690125,0.40103808,0.0000011904187,0.45480952],"study_design_scores_gemma":[0.0037077332,0.00033825127,0.0011648125,0.001002937,0.0000425591,0.0013286247,0.0000024085518,0.5239459,0.00037436432,0.4666828,0.00005910113,0.0013504786],"about_ca_topic_score_codex":0.00013597423,"about_ca_topic_score_gemma":0.00045701055,"teacher_disagreement_score":0.6235471,"about_ca_system_score_codex":0.00039946425,"about_ca_system_score_gemma":0.001573485,"threshold_uncertainty_score":0.9997164},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018547598,0.00035249468,0.9886104,0.0015879621,0.0014010601,0.00023746416,0.000005447546,0.00023937221,0.0075472393],"genre_scores_gemma":[0.08223833,0.00022102878,0.9094788,0.001896366,0.0020110002,0.000021273658,0.00008093352,0.000049435348,0.004002871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968268,0.000042875956,0.00042439334,0.001402674,0.00086855283,0.00043469275],"domain_scores_gemma":[0.9976917,0.00016124573,0.00026726048,0.001582241,0.00015079843,0.0001467783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061404274,0.0003784251,0.00031265372,0.00056116463,0.00025690327,0.0006292012,0.0025200197,0.00027305802,0.00006418444],"category_scores_gemma":[0.00010925087,0.00034558025,0.00008080797,0.00037859753,0.00028550284,0.0006650518,0.00065016805,0.0007139613,0.00019037917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017310912,0.000028551452,0.00010501801,0.000019246578,0.0000068989625,0.000027594691,0.00038673647,0.034625936,0.00013976396,0.07593908,0.0003948072,0.8883246],"study_design_scores_gemma":[0.00016327992,0.000089563684,0.0002924353,0.000073487194,0.000004251804,0.000031712,1.6123364e-8,0.9604045,0.0000841633,0.025744379,0.012719564,0.0003926557],"about_ca_topic_score_codex":0.0000140953325,"about_ca_topic_score_gemma":0.000025622629,"teacher_disagreement_score":0.92577857,"about_ca_system_score_codex":0.0001923308,"about_ca_system_score_gemma":0.0002013896,"threshold_uncertainty_score":0.9998996},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006566688,0.00027642297,0.9887282,0.00082346285,0.0024793597,0.00040874878,0.0000060473585,0.00027314853,0.006347919],"genre_scores_gemma":[0.93666774,0.000035760655,0.057675995,0.0031140745,0.0007908075,0.000009091938,0.000012086574,0.000060308914,0.0016341192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958085,0.000048486658,0.00064119126,0.0014782747,0.0012617942,0.00076175894],"domain_scores_gemma":[0.99710876,0.00027971735,0.00028095287,0.001824571,0.00023838441,0.00026760492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014073874,0.00047901538,0.00051646755,0.0010240171,0.00017743152,0.0007058977,0.0039062523,0.0004372779,0.00005072069],"category_scores_gemma":[0.00004860774,0.00045464994,0.00016413955,0.0007396671,0.00053960196,0.00056733395,0.0012364788,0.0008977679,0.00028954435],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000133266985,0.00014509972,0.00083518535,0.00013934566,0.00005785579,0.0005689286,0.047879253,0.00053252565,0.000090964844,0.106303826,0.0003731795,0.8430605],"study_design_scores_gemma":[0.0006372764,0.00020416737,0.0017636864,0.0005783556,0.000018793373,0.00019777808,7.9527354e-7,0.5047839,0.0007244623,0.42251757,0.0667506,0.0018225558],"about_ca_topic_score_codex":0.000037284677,"about_ca_topic_score_gemma":0.00022223522,"teacher_disagreement_score":0.9360111,"about_ca_system_score_codex":0.00026819692,"about_ca_system_score_gemma":0.00034772482,"threshold_uncertainty_score":0.99979055},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008592083,0.0013212502,0.98823017,0.00003448788,0.0009767263,0.0005474588,0.00013255881,0.00000906928,0.00015622542],"genre_scores_gemma":[0.60310984,0.000107287226,0.39536312,0.00013428048,0.0010604556,0.000013220266,0.00007774513,0.000034837965,0.00009922464],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985736,0.000013977717,0.0003226845,0.0006460066,0.00021677633,0.00022698057],"domain_scores_gemma":[0.9992206,0.000032610304,0.0002014375,0.0003444554,0.00013503837,0.000065864355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015313501,0.00026121075,0.0003345026,0.00010577818,0.00009072282,0.000042728345,0.00035207026,0.0004286402,0.000023704108],"category_scores_gemma":[0.000038276507,0.00024010106,0.000072771465,0.000039611725,0.0003077493,0.0000065710565,0.00017097131,0.00017266862,5.892716e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015521834,0.00002471858,0.00011602636,0.00021628317,0.000044814024,0.0000027590002,0.00017955418,0.03186302,0.48040447,0.00038688045,0.000024694262,0.48658156],"study_design_scores_gemma":[0.0015524075,0.0025495104,0.00054829224,0.0003890879,0.000055987508,0.00004698234,7.141119e-7,0.022659505,0.8542498,0.11452076,0.0026268566,0.000800143],"about_ca_topic_score_codex":0.0000059257436,"about_ca_topic_score_gemma":0.000018797497,"teacher_disagreement_score":0.5945177,"about_ca_system_score_codex":0.000027576705,"about_ca_system_score_gemma":0.00026233887,"threshold_uncertainty_score":0.9791037},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013646296,0.0003000005,0.995398,0.0009087513,0.0005076618,0.0005708562,0.0000033619954,0.000291404,0.002006345],"genre_scores_gemma":[0.019330652,0.00054037035,0.9777471,0.00077292515,0.0003116324,0.00004209378,0.00007885033,0.000050549374,0.0011258593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667543,0.00004577022,0.00051285094,0.0014751888,0.00072822557,0.0005625146],"domain_scores_gemma":[0.9982399,0.00014017615,0.00030529362,0.0009227409,0.0002260601,0.00016586404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003346706,0.00047555842,0.0003789494,0.00045171828,0.00042917405,0.0006905355,0.0020468212,0.00028478488,0.00010956688],"category_scores_gemma":[0.000014129135,0.00044686077,0.000104647734,0.00089028943,0.0002973203,0.00062226586,0.00048219893,0.00082266115,0.00007169951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013903557,0.0000142889785,7.611185e-7,0.0000028618274,0.0000030641852,0.000009838283,0.00004636484,0.5023291,0.000018396315,0.0012665176,0.00000717624,0.49630025],"study_design_scores_gemma":[0.0001926786,0.000104571016,0.000040724863,0.00009726997,0.0000066012385,0.00003636684,5.5685383e-8,0.9592518,0.000080170095,0.038344093,0.001367788,0.0004778851],"about_ca_topic_score_codex":0.000009846194,"about_ca_topic_score_gemma":0.000012746785,"teacher_disagreement_score":0.49582237,"about_ca_system_score_codex":0.00026666507,"about_ca_system_score_gemma":0.0002651447,"threshold_uncertainty_score":0.9997983},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007769236,0.0008305165,0.99207985,0.00050719536,0.0014841737,0.00031291062,0.000003351155,0.00012789572,0.0038771983],"genre_scores_gemma":[0.35301867,0.00022535106,0.6334127,0.010629497,0.0007708182,0.000012911162,0.000022090398,0.000058558446,0.0018493835],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99685913,0.000024861853,0.00046480552,0.0013073217,0.0008468108,0.00049704267],"domain_scores_gemma":[0.9981218,0.00047275476,0.00021616339,0.00067410315,0.00030323688,0.0002119483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010554066,0.00042353486,0.00037610246,0.0012106285,0.00027624075,0.00057875353,0.001264124,0.00028213664,0.000022710576],"category_scores_gemma":[0.00006629426,0.00040580405,0.000094483556,0.0007409385,0.000544028,0.00061217585,0.0008489274,0.0005615534,0.000038981325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008472547,0.000028782059,0.00008359229,0.0000398763,0.000014864493,0.00008681266,0.0006473691,0.02824184,0.00034760212,0.25600338,0.000078949706,0.7144185],"study_design_scores_gemma":[0.000529946,0.00027363753,0.00095591723,0.00029244737,0.000012362477,0.00022625423,1.234077e-7,0.44167355,0.0035722877,0.5340144,0.017394435,0.0010546402],"about_ca_topic_score_codex":0.000014504042,"about_ca_topic_score_gemma":0.000023207489,"teacher_disagreement_score":0.7133638,"about_ca_system_score_codex":0.00015221749,"about_ca_system_score_gemma":0.00042217245,"threshold_uncertainty_score":0.99983937},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026084518,0.030333137,0.8888448,0.009605483,0.030329349,0.0043840418,0.000044996017,0.00037232664,0.010001343],"genre_scores_gemma":[0.9522966,0.0016829643,0.035634875,0.0009836697,0.0035396744,0.00012608067,0.00003509468,0.00006215853,0.005638887],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973296,0.00012579569,0.00045334577,0.00094950106,0.00045547905,0.0006862652],"domain_scores_gemma":[0.9966986,0.0010571416,0.00073932536,0.0005293045,0.0007128615,0.00026272083],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0027379955,0.0004334651,0.0004808954,0.00030266627,0.0010151531,0.0012040839,0.0008615098,0.00039241093,0.00006243428],"category_scores_gemma":[0.00026598413,0.00037119616,0.00009293146,0.0010954262,0.002998782,0.001403959,0.0002033672,0.0003819176,0.000017898274],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043201475,0.000067624256,0.0029494928,0.000050342558,0.000012648655,7.2965065e-7,0.026116222,0.00023008208,0.000010494973,0.033534378,0.0002139873,0.9367708],"study_design_scores_gemma":[0.00049385475,0.00019140354,0.003630537,0.0012313359,0.000042055908,0.0000035491707,0.00032513717,0.0013278222,0.00044065434,0.8177399,0.17298923,0.0015845057],"about_ca_topic_score_codex":0.00002399659,"about_ca_topic_score_gemma":0.0024451273,"teacher_disagreement_score":0.93518627,"about_ca_system_score_codex":0.0003822783,"about_ca_system_score_gemma":0.0013528133,"threshold_uncertainty_score":0.999874},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007155732,0.00084204477,0.97420543,0.010592053,0.0006204928,0.00057176006,0.0000033733065,0.000074869444,0.005934224],"genre_scores_gemma":[0.98450786,0.000036272722,0.009813091,0.0037894426,0.0012036473,0.0000060932957,0.0000032496512,0.000027207328,0.00061314774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846864,0.0000020350908,0.00028242148,0.0006128095,0.00043301488,0.00020105962],"domain_scores_gemma":[0.9988089,0.000037848913,0.00022245165,0.0004962936,0.00041937522,0.000015128158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002589308,0.00022527571,0.00026537318,0.0005003191,0.00021745886,0.00019656855,0.0006581971,0.000112272624,0.000033666296],"category_scores_gemma":[0.000099345285,0.00015381433,0.000067142646,0.0007108148,0.0002776996,0.00028565805,0.00050109247,0.00023053985,0.000019115721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001724546,0.0000657865,0.0010695739,0.0004473242,0.000021885526,0.0000038308203,0.0003408363,0.19796549,0.0010890837,0.011595889,0.00028377364,0.7870993],"study_design_scores_gemma":[0.00040912174,0.000019147885,0.007850202,0.002532121,0.00017625,0.000015024574,0.0000026225057,0.86458987,0.0006454074,0.08847984,0.03407938,0.001201033],"about_ca_topic_score_codex":0.000037981205,"about_ca_topic_score_gemma":0.00012393646,"teacher_disagreement_score":0.97735214,"about_ca_system_score_codex":0.000028324428,"about_ca_system_score_gemma":0.000073911826,"threshold_uncertainty_score":0.6272366},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5057341,0.000014969825,0.49387214,0.00021375927,0.000022029992,0.00011662358,0.0000025954726,0.000021078618,0.0000027361957],"genre_scores_gemma":[0.6850222,0.000018009998,0.31480783,0.000115973875,0.00002211366,0.0000031076668,0.000006494212,0.000003924025,4.1199635e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99923265,0.000011679538,0.00020918071,0.00023325307,0.00021723221,0.00009602404],"domain_scores_gemma":[0.99945885,0.00006261937,0.00012043624,0.00025596365,0.00007654029,0.000025571338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006774433,0.00006850846,0.00015372824,0.00013979146,0.000053180247,0.0000040743753,0.000107116226,0.000024477935,0.000004981356],"category_scores_gemma":[0.00005227846,0.000056272584,0.000029590488,0.00044236862,0.00020706233,0.000092836286,0.00006811811,0.000083950865,5.356082e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011209363,0.00008191932,0.15931436,0.000015793968,0.0000012556492,0.00000392053,0.00041515837,0.0019499441,0.7887014,0.000021990061,0.000004408663,0.049478598],"study_design_scores_gemma":[0.00021254773,0.000073394,0.54908437,0.00007719713,0.0000045046754,0.000018885568,7.0935005e-7,0.054955404,0.39196888,0.0035574634,0.0000015822518,0.000045034893],"about_ca_topic_score_codex":0.00016536671,"about_ca_topic_score_gemma":0.0000025654965,"teacher_disagreement_score":0.39673254,"about_ca_system_score_codex":0.000036988204,"about_ca_system_score_gemma":0.000026491703,"threshold_uncertainty_score":0.22947294},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017110308,0.000505817,0.9935609,0.00028554862,0.002291846,0.0013266779,0.000016630585,0.00010688537,0.00019467092],"genre_scores_gemma":[0.3718684,0.00001585869,0.6260204,0.0003550893,0.0013375524,0.00006855956,0.000017316488,0.00003962701,0.00027725188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653685,0.000027497632,0.0007577668,0.0015303302,0.00041700326,0.00073053996],"domain_scores_gemma":[0.99723333,0.0010691038,0.00028926932,0.0008638328,0.00043437726,0.000110078734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006752995,0.00045258718,0.00046703918,0.0010062291,0.0004229274,0.00043386588,0.001974444,0.00033397292,0.0000044955677],"category_scores_gemma":[0.00034699374,0.00046297652,0.0001673145,0.0005111895,0.00037131057,0.00079885696,0.00053269445,0.00040429411,0.000009173858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060701705,0.00003021563,0.00003736468,0.000037856164,0.0000043537752,0.000006629912,0.002412782,0.395976,0.0030972054,0.012530784,0.000029750647,0.585831],"study_design_scores_gemma":[0.00016208581,0.00013427729,0.000022652279,0.00008824871,0.000004571061,0.000013307869,1.9957312e-7,0.94768363,0.006843162,0.043491915,0.001061186,0.00049476384],"about_ca_topic_score_codex":0.00003571908,"about_ca_topic_score_gemma":0.00086186995,"teacher_disagreement_score":0.5853362,"about_ca_system_score_codex":0.000503618,"about_ca_system_score_gemma":0.00075760856,"threshold_uncertainty_score":0.9997822},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5050793,0.000045918223,0.49434125,0.0002435009,0.000084386695,0.00017838848,0.0000021670924,0.000011559338,0.000013483331],"genre_scores_gemma":[0.7443731,8.092819e-7,0.25541222,0.00017027449,0.000024133711,0.0000064601663,0.000002592907,0.0000057385605,0.000004697327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985047,0.00002233508,0.00038035456,0.0003307456,0.00052762165,0.00023422379],"domain_scores_gemma":[0.99927634,0.00010120319,0.00012761352,0.00035746614,0.00007615794,0.000061229795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003327708,0.0001276837,0.00024625016,0.0002446114,0.000042196054,0.000011945556,0.00011355681,0.000038213522,0.000040424202],"category_scores_gemma":[0.000098947115,0.00011013281,0.000051722353,0.0004192934,0.00024092599,0.00016392379,0.00013898306,0.00011567003,0.0000040113455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008054657,0.0002775929,0.002973706,0.000029179859,0.00000810914,0.0000015231075,0.0026026994,0.7945583,0.1648494,0.000011145358,0.0000016923432,0.034606095],"study_design_scores_gemma":[0.00077284797,0.00042594664,0.00092712836,0.000054885895,0.0000049426103,0.000010502582,0.00000465203,0.5975407,0.40017053,0.000026512285,0.000001471226,0.000059909835],"about_ca_topic_score_codex":0.000014245546,"about_ca_topic_score_gemma":0.000008522186,"teacher_disagreement_score":0.23929371,"about_ca_system_score_codex":0.00019778615,"about_ca_system_score_gemma":0.00015870473,"threshold_uncertainty_score":0.44910854},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039092905,0.00028067132,0.99421024,0.00018327238,0.002031118,0.00020297588,0.0000020556536,0.000281427,0.0027691156],"genre_scores_gemma":[0.0113635585,0.000023327051,0.9878901,0.00023772678,0.00020869088,0.000006564019,9.843222e-7,0.000022684138,0.0002463195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753565,0.000030831212,0.00044049104,0.00092485646,0.0007233806,0.00034478202],"domain_scores_gemma":[0.99691164,0.00088451523,0.000386768,0.0015169184,0.00019345521,0.00010669783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010521192,0.00033388106,0.00041875578,0.00055175903,0.00012530497,0.0002140841,0.0030654331,0.00037566727,0.000012583554],"category_scores_gemma":[0.00014660726,0.00030801675,0.000114633556,0.00036541052,0.00028695815,0.00050997623,0.0010832471,0.001028888,0.0000062658223],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065220243,0.000051695937,0.00009204118,0.00011180547,0.000027178758,0.00014981483,0.0009182,0.008959372,0.007227076,0.019009108,0.000031243067,0.9634159],"study_design_scores_gemma":[0.00034933718,0.00054052396,0.00028445682,0.00097413873,0.00003162218,0.00048917346,8.9744304e-8,0.41837892,0.20629467,0.3359426,0.035141055,0.0015734368],"about_ca_topic_score_codex":0.000040764666,"about_ca_topic_score_gemma":0.0000063392404,"teacher_disagreement_score":0.9618425,"about_ca_system_score_codex":0.00008178895,"about_ca_system_score_gemma":0.00027676788,"threshold_uncertainty_score":0.9999372},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035238706,0.00024279916,0.9929481,0.0010679085,0.0013537329,0.00039069157,0.0000020402638,0.00023542135,0.0002354367],"genre_scores_gemma":[0.7984053,0.000031359832,0.20029172,0.00026920877,0.0005042011,0.00001746474,0.0000016067395,0.000030345489,0.0004487987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997293,0.000033605305,0.0004589896,0.0010349252,0.00054483535,0.0006346604],"domain_scores_gemma":[0.9978101,0.0006592719,0.0004114393,0.00073703274,0.00031025033,0.00007185689],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009861301,0.00036846704,0.00044198395,0.00055027317,0.0006454955,0.00029563898,0.002281277,0.00028719843,0.0000012050365],"category_scores_gemma":[0.00012972078,0.0002920206,0.00018046908,0.0004948715,0.00083026587,0.00029266495,0.0005434696,0.00066516316,0.0000035695243],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019699855,0.000033666198,0.0010560636,0.00004323249,0.0000352274,0.000006929104,0.0005645238,0.014787734,0.0020285656,0.009644984,0.000049173443,0.9717302],"study_design_scores_gemma":[0.0011446995,0.0017436895,0.023934688,0.001399723,0.00005152325,0.000080912665,0.0000036839117,0.7107397,0.033068065,0.21651568,0.009628476,0.0016892053],"about_ca_topic_score_codex":0.000028631277,"about_ca_topic_score_gemma":0.000086763524,"teacher_disagreement_score":0.970041,"about_ca_system_score_codex":0.00026235575,"about_ca_system_score_gemma":0.0003032941,"threshold_uncertainty_score":0.9999532},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017568308,0.001229492,0.9933811,0.00046505223,0.0016231511,0.0003440209,0.0000026745317,0.00025871443,0.0025201049],"genre_scores_gemma":[0.029822426,0.00007101697,0.9670351,0.0013397151,0.0004971611,0.0000073709516,0.0000061636238,0.00005706504,0.0011639748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953177,0.000064911874,0.00058673916,0.0018669276,0.0012861339,0.0008775878],"domain_scores_gemma":[0.99661565,0.00072062545,0.00037278337,0.0016205516,0.00046627098,0.00020413639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080967316,0.00078968855,0.0007851178,0.0009823896,0.00052621635,0.00083503925,0.003450331,0.00025873064,0.000015482912],"category_scores_gemma":[0.00012309349,0.0006117806,0.00017254215,0.0008537805,0.0011235058,0.0011622565,0.00092824386,0.0012532775,0.000038184186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060344195,0.00007274857,0.000048191698,0.00012931478,0.000043556738,0.0022023802,0.0031698826,0.052776046,0.0029750513,0.0019957596,0.00017312805,0.9363536],"study_design_scores_gemma":[0.0009298575,0.00045400098,0.00014235605,0.0011713527,0.000025493411,0.0016329258,4.1672644e-7,0.95975053,0.005763797,0.02626558,0.0019378003,0.0019258972],"about_ca_topic_score_codex":0.000030565163,"about_ca_topic_score_gemma":0.00003920789,"teacher_disagreement_score":0.9344277,"about_ca_system_score_codex":0.00033547098,"about_ca_system_score_gemma":0.00073954376,"threshold_uncertainty_score":0.9996334},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027688578,0.00028402853,0.97901785,0.00077720423,0.0021342016,0.00029148883,0.000010786325,0.00036784942,0.016839702],"genre_scores_gemma":[0.72978723,0.00006495322,0.2544924,0.010751925,0.0012734215,0.000023653372,0.000025681456,0.00015003812,0.003430731],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99557596,0.000041763025,0.0005390795,0.0018413516,0.0011630089,0.00083883404],"domain_scores_gemma":[0.9969934,0.0006724465,0.00024152231,0.0017999655,0.00011362281,0.00017902223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007604828,0.0006810861,0.00058337214,0.00095523824,0.00027571165,0.0006348846,0.004193838,0.00037344507,0.000044829507],"category_scores_gemma":[0.000054399956,0.00060874113,0.00022460747,0.0006211362,0.00068073405,0.00047970368,0.0005648125,0.0009458489,0.00017520125],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008696841,0.00005261749,0.0000030734245,0.00002905795,0.000010754989,0.00024933703,0.00038119883,0.10700237,0.00020542968,0.08716384,0.00023727636,0.8046563],"study_design_scores_gemma":[0.0003537593,0.00035317673,0.00012969568,0.0005002586,0.000009170765,0.000051546776,8.389347e-8,0.45509326,0.002000642,0.5375657,0.0028625163,0.0010802043],"about_ca_topic_score_codex":0.000064159445,"about_ca_topic_score_gemma":0.00003479619,"teacher_disagreement_score":0.8035761,"about_ca_system_score_codex":0.00028739576,"about_ca_system_score_gemma":0.00037113205,"threshold_uncertainty_score":0.9996364},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014177795,0.001625164,0.97363377,0.000039955798,0.0040723416,0.00031527496,0.000021173113,0.00016684669,0.0059476867],"genre_scores_gemma":[0.9690644,0.0001871553,0.030314099,0.000036360594,0.0002085688,0.0000032394669,0.000007956838,0.00003024987,0.00014797381],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865764,0.000013058312,0.0004037604,0.0004118083,0.0002769336,0.00023679934],"domain_scores_gemma":[0.9991682,0.00018481488,0.00013541266,0.00035554235,0.00006328508,0.000092700626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025450435,0.00028851972,0.00039634822,0.00055470667,0.00013465199,0.000081943144,0.00036503558,0.00032745468,0.000036997888],"category_scores_gemma":[0.000012878228,0.00026687304,0.00008308106,0.00034001796,0.00077021634,0.00018638126,0.0000858114,0.0006319236,0.000008935906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003427988,0.000014880683,0.0013364691,0.0008512334,0.0002546178,0.000037761398,0.003218622,0.11891854,0.05962602,0.045187213,0.000086116466,0.77043426],"study_design_scores_gemma":[0.0013232317,0.000521716,0.0033043304,0.0026615346,0.00024347883,0.0009146983,0.000016836484,0.17193161,0.009225964,0.7941652,0.013260605,0.0024308073],"about_ca_topic_score_codex":0.00007226843,"about_ca_topic_score_gemma":0.0001548799,"teacher_disagreement_score":0.9548866,"about_ca_system_score_codex":0.000040209856,"about_ca_system_score_gemma":0.00009678172,"threshold_uncertainty_score":0.99997836},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010061754,0.00028360923,0.9785194,0.0016025653,0.00030903483,0.0007319992,0.000009376717,0.00013713598,0.018396826],"genre_scores_gemma":[0.13194405,0.00019010082,0.86494625,0.0010905238,0.0002801599,0.0001262434,0.000019945675,0.000029527633,0.0013732123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968,0.000020124968,0.0006091414,0.0015389341,0.00053168833,0.00050012843],"domain_scores_gemma":[0.9972442,0.00020694274,0.00023082437,0.0020576918,0.00013558794,0.00012479148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058284955,0.00039868557,0.00036323268,0.0012858771,0.0002088248,0.00060988736,0.0036953222,0.00012084115,0.000024334535],"category_scores_gemma":[0.000010940544,0.000405999,0.00008557965,0.0010379003,0.00023362458,0.0009077366,0.0013551912,0.00074260746,0.00016641169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012309964,0.000043386328,0.000003794921,0.000009801658,0.0000032149974,0.0000061844016,0.00012750328,0.42425323,0.00003132328,0.074655995,0.00003715396,0.5008272],"study_design_scores_gemma":[0.00011671351,0.000025849777,0.00000985555,0.00015123139,0.000003855349,0.000013213193,2.297447e-7,0.81400144,0.000088489585,0.124046184,0.061188005,0.00035492264],"about_ca_topic_score_codex":0.00004437227,"about_ca_topic_score_gemma":0.00028985596,"teacher_disagreement_score":0.5004723,"about_ca_system_score_codex":0.0004498056,"about_ca_system_score_gemma":0.0002994043,"threshold_uncertainty_score":0.9998392},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041296516,0.000260823,0.981978,0.00026498752,0.0054422016,0.0003802245,4.314909e-7,0.0001287282,0.011503285],"genre_scores_gemma":[0.73643607,0.0000784761,0.25681943,0.0015761929,0.0026751808,0.000015153213,0.00001529667,0.000069469126,0.0023147208],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705744,0.000032664157,0.0004673535,0.0011752178,0.0007221842,0.000545123],"domain_scores_gemma":[0.9981781,0.00015595456,0.00023848559,0.0010879905,0.00022000338,0.00011943826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008773509,0.00037186162,0.00042082634,0.00075441547,0.00014248636,0.00054449396,0.0025223864,0.00045257906,0.000038634087],"category_scores_gemma":[0.00010927915,0.00032734429,0.000073290765,0.00085566245,0.0003828251,0.00045077983,0.00072959915,0.00081027346,0.00013994363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051724624,0.000043505734,0.0004933324,0.000043221407,0.0000057102166,0.00015093954,0.0012940933,0.0021697422,0.0003323911,0.4129175,0.00003046813,0.5825139],"study_design_scores_gemma":[0.0004460625,0.0002778255,0.00056129077,0.00011020223,0.0000058215587,0.000103241284,2.255501e-7,0.11193185,0.0017787812,0.82725567,0.05643653,0.0010925008],"about_ca_topic_score_codex":0.00007745073,"about_ca_topic_score_gemma":0.00083080557,"teacher_disagreement_score":0.7363948,"about_ca_system_score_codex":0.00018991741,"about_ca_system_score_gemma":0.00046760234,"threshold_uncertainty_score":0.99991786},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040381936,0.0001834438,0.99578273,0.0005514906,0.00033123896,0.0016058154,0.00003173936,0.00028830016,0.0011848295],"genre_scores_gemma":[0.33836418,0.00007601611,0.65893555,0.0010039692,0.0007385409,0.00044919597,0.00017412653,0.000054989072,0.00020342015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967706,0.000021067905,0.00051159493,0.0014327962,0.000691,0.00057290995],"domain_scores_gemma":[0.9971401,0.00043715828,0.000260584,0.001640579,0.00037741615,0.0001441247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006079611,0.00045751675,0.00048962096,0.00038524932,0.0004215917,0.00038498535,0.0024321976,0.00027789702,0.000018095727],"category_scores_gemma":[0.000022080474,0.000359428,0.000119937096,0.00080753246,0.00058729737,0.0004666625,0.00028841975,0.00039523505,0.000040674273],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026583573,0.000058053483,0.00022875854,0.00012382225,0.000021261098,0.000004860424,0.00030868943,0.05196235,0.00002797082,0.008341885,0.00006699339,0.93882877],"study_design_scores_gemma":[0.0013775943,0.0008017414,0.0023823953,0.0010007519,0.00004497843,0.0001550294,4.758001e-7,0.74008495,0.00077692315,0.19515762,0.056161847,0.0020557016],"about_ca_topic_score_codex":0.00001501103,"about_ca_topic_score_gemma":0.00005926518,"teacher_disagreement_score":0.93677306,"about_ca_system_score_codex":0.00033627384,"about_ca_system_score_gemma":0.00064884336,"threshold_uncertainty_score":0.9998858},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009171076,0.00006600611,0.9935191,0.0012669107,0.0020792228,0.001061247,0.000007080265,0.00038556094,0.001605679],"genre_scores_gemma":[0.35105243,0.000022894732,0.643036,0.0032373553,0.00082808064,0.00006553116,0.0001830725,0.00011577774,0.0014588302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99443525,0.000041464635,0.00091178244,0.0017663996,0.0017125926,0.0011325248],"domain_scores_gemma":[0.99586433,0.0010756177,0.0006743161,0.0016778915,0.00045068434,0.00025714113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012324188,0.00085944857,0.0007583576,0.0008837247,0.0006353983,0.0008314013,0.0035723364,0.00040419653,0.000031826447],"category_scores_gemma":[0.00055243896,0.0008081136,0.00028033243,0.0006920395,0.0007063178,0.00047224827,0.0009262704,0.001301766,0.000057780355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023989674,0.00001842091,0.00001336681,0.00007326604,0.00001698473,0.00003122017,0.00018845798,0.9098111,0.000016766162,0.064436615,0.000015603575,0.025354201],"study_design_scores_gemma":[0.0010050182,0.0013989824,0.000012603186,0.00075846247,0.000018316876,0.000008807978,1.9036645e-7,0.95705116,0.0026092057,0.032982085,0.0033048138,0.00085036294],"about_ca_topic_score_codex":0.000012861842,"about_ca_topic_score_gemma":0.0000058163423,"teacher_disagreement_score":0.35104325,"about_ca_system_score_codex":0.0011216066,"about_ca_system_score_gemma":0.0013942573,"threshold_uncertainty_score":0.999437},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52401626,0.000010709571,0.47577506,0.000047744576,0.00008831961,0.00004260206,0.0000010326955,0.000011560001,0.000006716336],"genre_scores_gemma":[0.9328857,0.0000057299844,0.06697371,0.000117332565,0.000013547522,5.6843083e-7,2.1108129e-7,0.0000028878587,2.82099e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866015,0.000079346086,0.00022130914,0.0004216844,0.00040210856,0.00021540382],"domain_scores_gemma":[0.99900556,0.0005360903,0.00008560833,0.0002547941,0.00006832211,0.00004964391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036418284,0.00008741632,0.00020649929,0.00051339663,0.00019326436,0.000026386731,0.00030022816,0.00004413952,0.0000049331243],"category_scores_gemma":[0.0003581228,0.00006401069,0.00006032953,0.003454735,0.000977532,0.00028101957,0.00009310448,0.00009806797,4.7378276e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025547977,0.0000206193,0.0066804215,0.0000039143724,0.00000149688,0.000004202888,0.0011832258,0.65954465,0.32357267,0.00003790122,5.730214e-8,0.008948291],"study_design_scores_gemma":[0.000073355106,0.00003078776,0.018298343,0.000027068112,0.0000071405243,0.000008407088,8.435458e-7,0.8549991,0.12532796,0.0011610276,1.8110755e-7,0.000065780165],"about_ca_topic_score_codex":0.00009178494,"about_ca_topic_score_gemma":0.0000039637025,"teacher_disagreement_score":0.40886948,"about_ca_system_score_codex":0.000043725406,"about_ca_system_score_gemma":0.000144973,"threshold_uncertainty_score":0.36017576},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006257206,0.0003083085,0.99722296,0.0007363759,0.0007326424,0.00052044285,0.0000034107409,0.000110020985,0.00030329556],"genre_scores_gemma":[0.19307512,0.00012767801,0.80621976,0.00022657914,0.00015905051,0.000014936227,0.000025699022,0.000022690783,0.00012851667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996787,0.0000711039,0.000583684,0.0013034632,0.0006972699,0.00055743894],"domain_scores_gemma":[0.99820185,0.00041800638,0.0002622405,0.0009719275,0.000052265976,0.000093729046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007816379,0.000471823,0.0004612621,0.0007683948,0.00016724141,0.00031671068,0.002123341,0.00034270732,0.00001347358],"category_scores_gemma":[0.00011143278,0.0004227651,0.00007925471,0.0005318308,0.00041587552,0.00084005547,0.0009430188,0.00056709436,0.000033314507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057238494,0.00003880082,0.00010094136,0.000007089713,0.0000029825217,0.000057002217,0.0004198086,0.7585964,0.00006624909,0.0012056397,0.000004355901,0.23949498],"study_design_scores_gemma":[0.00029680328,0.00010735357,0.0010479401,0.0003200644,0.0000054788648,0.000029620986,5.0739555e-7,0.9758228,0.0011093175,0.020766592,0.000041677595,0.00045185228],"about_ca_topic_score_codex":0.000018492161,"about_ca_topic_score_gemma":0.00008740601,"teacher_disagreement_score":0.23904313,"about_ca_system_score_codex":0.000507044,"about_ca_system_score_gemma":0.00021480079,"threshold_uncertainty_score":0.99982244},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000092980474,0.00018664787,0.9977176,0.00049351086,0.00072021404,0.00023743573,0.0000022750926,0.00020489597,0.00034442992],"genre_scores_gemma":[0.017268848,0.00013659275,0.97935486,0.0029122834,0.00022305915,0.000015076924,0.000008720991,0.000028358883,0.000052198146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966908,0.00006224747,0.0005190614,0.0014113358,0.0008247111,0.0004918247],"domain_scores_gemma":[0.99782133,0.000440465,0.00014730834,0.0011443975,0.0001810845,0.0002654159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008088847,0.00040894738,0.00042734272,0.0009710492,0.00014455047,0.00067593734,0.0022661076,0.00061444275,0.00007415045],"category_scores_gemma":[0.00018476017,0.0003901528,0.000045263994,0.0005724954,0.0008481796,0.0014183795,0.0009142905,0.0010920558,0.0000036171205],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033930692,0.00004514043,0.00014075346,0.000022463544,0.0000029068137,0.000078833975,0.001199478,0.010754817,0.0011648448,0.02253675,0.0000039133456,0.9640467],"study_design_scores_gemma":[0.00021727075,0.00021620312,0.00009730757,0.00039734558,0.0000036851086,0.000051902123,2.983754e-7,0.72732836,0.015092534,0.255758,0.00014587684,0.00069122144],"about_ca_topic_score_codex":0.000051002437,"about_ca_topic_score_gemma":0.00015629738,"teacher_disagreement_score":0.9633555,"about_ca_system_score_codex":0.0001312585,"about_ca_system_score_gemma":0.00029655546,"threshold_uncertainty_score":0.99985504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026218986,0.0007436706,0.98941505,0.0005193553,0.002299277,0.00030213504,0.0000013882436,0.0002500651,0.0062068887],"genre_scores_gemma":[0.082336634,0.00007952931,0.91275173,0.0020954846,0.0010095381,0.0000024425135,0.000004271147,0.000048960486,0.0016713928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952115,0.00008633539,0.00062326505,0.0018859342,0.0012857544,0.0009072278],"domain_scores_gemma":[0.99710685,0.00043009556,0.00033231062,0.0016429464,0.00027989436,0.00020790561],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012838213,0.00060752884,0.00063470815,0.0009948261,0.0005119432,0.0012044469,0.0035727231,0.00033709416,0.00002848593],"category_scores_gemma":[0.00015801379,0.0005595884,0.00018720234,0.0008414156,0.00046764893,0.0007427346,0.0011849757,0.0010358774,0.000063063126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005556092,0.000035153727,0.000010132522,0.000018444007,0.0000038963954,0.000234732,0.0005978232,0.019383634,0.0032999788,0.0066725165,0.000021831378,0.9697163],"study_design_scores_gemma":[0.0008263474,0.00048946205,0.00050507265,0.001355325,0.000019354242,0.00031981606,2.6861375e-7,0.78441924,0.016376955,0.18964511,0.004505725,0.0015373148],"about_ca_topic_score_codex":0.000025168876,"about_ca_topic_score_gemma":0.000010055526,"teacher_disagreement_score":0.968179,"about_ca_system_score_codex":0.00038972596,"about_ca_system_score_gemma":0.0004457804,"threshold_uncertainty_score":0.9998324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026776825,0.00018999017,0.99577063,0.000120444645,0.0013551458,0.0008618543,0.0000068625786,0.000101317426,0.0015669537],"genre_scores_gemma":[0.018730273,0.000020505222,0.98079085,0.00010640215,0.0001789222,0.000036037003,0.0000021771696,0.000019948246,0.00011486546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972896,0.000028770313,0.0008653519,0.00082568364,0.00064087374,0.00034973302],"domain_scores_gemma":[0.9970492,0.00049068517,0.00080158695,0.001167691,0.00041472327,0.00007612384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014875643,0.00031321478,0.0005609283,0.00073404936,0.0001839023,0.00017921746,0.0018008844,0.00027355956,0.0000037614961],"category_scores_gemma":[0.00023991098,0.0002977533,0.00015812123,0.0003072712,0.0004914708,0.00078733586,0.0002966488,0.00038582072,0.0000074754266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004414888,0.000020597396,0.0000023009716,0.0021041024,0.000017014396,0.0000012100268,0.00052669423,0.3584142,0.00039706373,0.44037116,0.0000022888191,0.19813895],"study_design_scores_gemma":[0.000101574435,0.000050748855,0.0000052535274,0.0016418954,0.00001576584,0.0000477881,2.3834431e-7,0.8515239,0.0035142598,0.14282456,0.000028686316,0.00024538173],"about_ca_topic_score_codex":0.0000036661258,"about_ca_topic_score_gemma":0.000008651887,"teacher_disagreement_score":0.49310964,"about_ca_system_score_codex":0.00031387934,"about_ca_system_score_gemma":0.0003904357,"threshold_uncertainty_score":0.9999475},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09565808,0.003705133,0.8993305,0.00007924436,0.00045830582,0.0003492216,0.00026464768,0.000010658371,0.00014419932],"genre_scores_gemma":[0.9361073,0.0007359566,0.06138623,0.00023361921,0.00029214442,0.0000026162393,0.0011852597,0.000026154543,0.000030733543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798894,0.000021210755,0.00051926024,0.0008660458,0.00027599416,0.0003285622],"domain_scores_gemma":[0.9984192,0.00017504458,0.0002680876,0.00097604847,0.00005194349,0.000109634624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041947127,0.00031358722,0.00041446812,0.0002264127,0.00008043175,0.000050211038,0.001400631,0.00034261344,0.000002904736],"category_scores_gemma":[0.00018153679,0.00026636414,0.000025572917,0.00017848836,0.0015638937,0.000032119955,0.0028605706,0.0003350866,6.598355e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007174963,0.00009105154,0.0007906981,0.0006458147,0.00031579175,0.0009385621,0.0024467579,0.015348184,0.019717757,0.00013544997,0.0009775935,0.9585206],"study_design_scores_gemma":[0.0006756468,0.0009341842,0.00023956894,0.0016013455,0.000045765977,0.0015818002,0.0000044528765,0.99159384,0.0015137701,0.00053947134,0.00062364864,0.00064648024],"about_ca_topic_score_codex":0.0000457722,"about_ca_topic_score_gemma":0.00035465098,"teacher_disagreement_score":0.9762457,"about_ca_system_score_codex":0.000096966374,"about_ca_system_score_gemma":0.0011319616,"threshold_uncertainty_score":0.99997884},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012548597,0.00040966147,0.9603676,0.036711417,0.00044787108,0.0010229957,0.0000052264095,0.00014676164,0.0007629736],"genre_scores_gemma":[0.06737026,0.000055508073,0.9277091,0.004358342,0.00005583125,0.0000388144,0.0000039794013,0.00002563384,0.00038253044],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630857,0.00010763286,0.00054827397,0.0010240482,0.0014713387,0.0005401424],"domain_scores_gemma":[0.9957026,0.0007924539,0.00031137175,0.0023358995,0.0007616989,0.000095959644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022951516,0.00041575852,0.00042349886,0.0005096053,0.00032133947,0.00042291146,0.004889348,0.00023178426,0.000007878162],"category_scores_gemma":[0.00025801794,0.00032663715,0.00006423007,0.001112681,0.0006871896,0.0005109594,0.002325438,0.00058426836,0.000015544276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006109262,0.000018532513,0.000064346255,0.000020238449,0.00002157949,0.000008068852,0.0069441125,0.046163905,0.00018216409,0.078317724,0.0037596696,0.86449355],"study_design_scores_gemma":[0.0006602589,0.0008942652,0.0009457777,0.0005408845,0.00003883919,0.00013087057,0.000020738242,0.09060322,0.019266611,0.805692,0.079589814,0.0016167244],"about_ca_topic_score_codex":0.000101141064,"about_ca_topic_score_gemma":0.00016996068,"teacher_disagreement_score":0.86287683,"about_ca_system_score_codex":0.00020484184,"about_ca_system_score_gemma":0.00023665681,"threshold_uncertainty_score":0.9999186},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010253446,0.001447936,0.99371445,0.0014782075,0.00094782823,0.0011120131,0.000017591236,0.00020796587,0.0009714804],"genre_scores_gemma":[0.12481952,0.00041523538,0.8716527,0.0014004575,0.0003702605,0.00021215924,0.000110289475,0.000065305496,0.0009540406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952867,0.0000925627,0.00062326464,0.0017215608,0.001688347,0.0005875368],"domain_scores_gemma":[0.9969278,0.0003535084,0.0003026778,0.0013366604,0.0008862346,0.00019310549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008029921,0.0005492238,0.00048214057,0.0005889818,0.0007349138,0.00018449893,0.0020766263,0.00030397638,0.00006149103],"category_scores_gemma":[0.000053493863,0.0005239428,0.00013975492,0.00085812306,0.0009776069,0.0006497219,0.0008611261,0.0006429884,0.00012711344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009888441,0.00015798271,0.000028865245,0.000021890759,0.00003314741,0.000069712274,0.00068400736,0.45639926,0.0002527206,0.009146867,0.00022873643,0.5329669],"study_design_scores_gemma":[0.00045233677,0.00011653889,0.0003783406,0.00012304077,0.000013835508,0.00024428585,2.2100981e-7,0.9567673,0.00013926506,0.038998965,0.002177443,0.0005883911],"about_ca_topic_score_codex":0.000030461264,"about_ca_topic_score_gemma":0.000056098837,"teacher_disagreement_score":0.5323785,"about_ca_system_score_codex":0.0011512849,"about_ca_system_score_gemma":0.0013075265,"threshold_uncertainty_score":0.9997212},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005366008,0.00020167677,0.99065834,0.0004327166,0.00025945978,0.0004643475,3.6121054e-7,0.000009670633,0.007436843],"genre_scores_gemma":[0.98115027,0.00021217616,0.016983617,0.00018239286,0.0006349622,0.000016757027,0.0000083013765,0.000020607093,0.0007908946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973233,0.00026574635,0.0002646272,0.0007084758,0.0009204174,0.00051743886],"domain_scores_gemma":[0.9986623,0.0007276753,0.0001863652,0.0002129591,0.000062210296,0.00014849906],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022769708,0.00019952375,0.00028636985,0.000549145,0.00078378373,0.001278759,0.0010113827,0.00020411107,0.00014674861],"category_scores_gemma":[0.00043265524,0.00020316143,0.00005840828,0.0006614647,0.00065025385,0.0016426763,0.0004105952,0.00080140244,0.000011638133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003046413,0.000031450898,0.0021834136,0.0000050986355,0.000008471124,0.000018570863,0.003550505,0.57559174,0.00003443209,0.0010112991,0.0000023234531,0.41755965],"study_design_scores_gemma":[0.00019081226,0.00005554094,0.0012712694,0.0005976515,0.000012215646,0.0000013948937,0.000041306605,0.9512179,0.000041446998,0.04459719,0.0015189826,0.00045430788],"about_ca_topic_score_codex":0.0009295668,"about_ca_topic_score_gemma":0.0013121682,"teacher_disagreement_score":0.9806137,"about_ca_system_score_codex":0.0011003294,"about_ca_system_score_gemma":0.0004577886,"threshold_uncertainty_score":0.999758},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046018624,0.0011902367,0.9892243,0.0005850673,0.0010076952,0.0004595948,0.00011937142,0.0000375457,0.0073301783],"genre_scores_gemma":[0.07385352,0.00017316337,0.9183438,0.0018345724,0.004240145,0.00018247805,0.00003120313,0.000085451196,0.0012556566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980598,6.918588e-7,0.000530994,0.00092514715,0.00007037458,0.00041295483],"domain_scores_gemma":[0.9987791,0.00024092686,0.00033653845,0.00049189664,0.00006797125,0.00008351907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028522298,0.0002738368,0.0005108838,0.00042126514,0.00019337956,0.00014665438,0.00080422993,0.00033456102,0.000053027758],"category_scores_gemma":[0.0001557143,0.00030508885,0.00015054276,0.0002887105,0.00028411055,0.00010249587,0.00015855579,0.0003442196,0.000084158244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008231146,0.000015135806,0.000034533336,0.000011972264,0.000005059682,0.0000017806302,0.00008288306,0.0014483563,0.0000012951294,0.89557844,0.000012292578,0.1028],"study_design_scores_gemma":[0.00019623167,0.00008329024,0.0001943832,0.000055606164,0.000003749791,0.000006609881,4.870079e-8,0.030581063,0.000014650486,0.94563717,0.022880983,0.00034620098],"about_ca_topic_score_codex":0.000040940617,"about_ca_topic_score_gemma":0.00004430574,"teacher_disagreement_score":0.1024538,"about_ca_system_score_codex":0.000174369,"about_ca_system_score_gemma":0.0001239958,"threshold_uncertainty_score":0.9999401},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021045598,0.00013355644,0.99575555,0.00038936394,0.0015599536,0.00095446955,0.000012930698,0.00015463469,0.0010184867],"genre_scores_gemma":[0.0119096525,0.000015267615,0.98619515,0.0010661519,0.00033927773,0.000045106968,0.000013630928,0.000026366033,0.00038940134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695796,0.000020524554,0.0004981021,0.0011826806,0.00066286745,0.00067785115],"domain_scores_gemma":[0.99746954,0.0007623684,0.00021409869,0.0010667222,0.0003311717,0.00015607812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015337073,0.0003743195,0.0003394175,0.0011210801,0.00052331865,0.00050057564,0.00194803,0.00021721689,0.000032816995],"category_scores_gemma":[0.00006192852,0.00035768258,0.00016305788,0.0007781311,0.00039596407,0.0004305596,0.0006052939,0.0004222629,0.000019290383],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012352213,0.00005656954,0.000026087737,0.000034397675,0.000020865798,0.000021922318,0.00088936253,0.012793155,0.00008172824,0.21919851,0.00013760754,0.76672745],"study_design_scores_gemma":[0.000655267,0.0004569765,0.00009877747,0.00012999876,0.000017806464,0.000060583643,3.682826e-7,0.602838,0.00072172977,0.3602792,0.033899315,0.0008420072],"about_ca_topic_score_codex":0.000013775246,"about_ca_topic_score_gemma":0.00016305316,"teacher_disagreement_score":0.7658854,"about_ca_system_score_codex":0.0001976921,"about_ca_system_score_gemma":0.00055473356,"threshold_uncertainty_score":0.9998875},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018087105,0.00083394063,0.9870506,0.006814055,0.0027200077,0.00054037786,0.000015593907,0.0001821283,0.0018252295],"genre_scores_gemma":[0.055314805,0.0002929367,0.93027186,0.0107895415,0.002315576,0.000035673223,0.000022775404,0.000067259614,0.00088954344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958123,0.000044306722,0.00044560884,0.0016080609,0.0013477551,0.000741948],"domain_scores_gemma":[0.9968727,0.00019404937,0.0002102234,0.0022580188,0.0002209133,0.00024406491],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00067012996,0.0005501079,0.00046012554,0.0005391978,0.0006747192,0.0005764337,0.005702949,0.0003221986,0.000019838328],"category_scores_gemma":[0.000086125576,0.00036543055,0.00014666173,0.0007795236,0.00041382207,0.00057764037,0.003351536,0.00095683493,0.00015364344],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048979805,0.000017033673,0.0000033892609,0.000009739288,0.0000071261534,0.00009062181,0.0011551102,0.017650707,0.000048682,0.0047473777,0.0024511681,0.97381413],"study_design_scores_gemma":[0.00034843793,0.0003813514,0.00029500175,0.0004621398,0.000009958133,0.0004848585,2.3119767e-7,0.78283983,0.00093566737,0.043867946,0.1692011,0.0011734834],"about_ca_topic_score_codex":0.00009198055,"about_ca_topic_score_gemma":0.00010789641,"teacher_disagreement_score":0.9726407,"about_ca_system_score_codex":0.00027502773,"about_ca_system_score_gemma":0.0007657772,"threshold_uncertainty_score":0.9998798},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017197604,0.0005094583,0.98441416,0.00038373182,0.0041196207,0.00054224394,0.000004635025,0.00020068372,0.009808248],"genre_scores_gemma":[0.003598747,0.0000410135,0.9921795,0.0030481112,0.0002742813,0.00002104725,0.0000044276144,0.00004387113,0.0007890153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99524426,0.00008777241,0.000672637,0.0018776752,0.0013054183,0.0008122291],"domain_scores_gemma":[0.996326,0.00032644364,0.00041585002,0.0023900878,0.00034630168,0.00019528801],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019537546,0.000622742,0.0005555077,0.00083098,0.00029591756,0.00070134515,0.004685933,0.00041466753,0.000034498393],"category_scores_gemma":[0.00018752376,0.0005811061,0.00014025882,0.00077377167,0.00088842085,0.0010450336,0.0010343235,0.00093033334,0.0000886125],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053197527,0.00004218556,0.00003562556,0.00006811729,0.00001276127,0.000050194605,0.00068080303,0.0067197983,0.00016661391,0.176301,0.0001541668,0.8157634],"study_design_scores_gemma":[0.00039622825,0.00036693667,0.0001244826,0.00053476146,0.000014461891,0.00027080663,2.1495829e-7,0.5160299,0.0074882256,0.38735133,0.08574469,0.0016779782],"about_ca_topic_score_codex":0.0000128748625,"about_ca_topic_score_gemma":0.000027382594,"teacher_disagreement_score":0.8140854,"about_ca_system_score_codex":0.0004787482,"about_ca_system_score_gemma":0.0005404262,"threshold_uncertainty_score":0.999664},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029442195,0.00069470145,0.99269336,0.001153829,0.0005779248,0.0002465145,0.0000018674368,0.00027303098,0.0040643676],"genre_scores_gemma":[0.048419036,0.00023649792,0.947279,0.0025749973,0.0008340566,0.0000037001028,0.000002897906,0.00005697887,0.0005928439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600965,0.0000335098,0.0005745845,0.0017498945,0.00082464836,0.0008077138],"domain_scores_gemma":[0.9978695,0.0004644359,0.00031084026,0.0009412889,0.0001593542,0.00025461093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007330276,0.00056788186,0.00057168846,0.00067743525,0.00041724896,0.0007392325,0.0021147206,0.00023705758,0.000044205128],"category_scores_gemma":[0.00007394288,0.00053771684,0.000103253995,0.00046217977,0.0005723657,0.0014271858,0.0014467357,0.0009805586,0.0000725552],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022655117,0.000009915429,0.000034055643,0.000012913869,0.0000039149195,0.00004938277,0.0005164502,0.0024232354,0.0015131279,0.0012387016,0.000006867939,0.99418914],"study_design_scores_gemma":[0.00025024184,0.00008094961,0.00029398056,0.0005434954,0.0000051147317,0.00020048251,1.4745596e-7,0.97190475,0.00090985815,0.023305302,0.001828061,0.00067762827],"about_ca_topic_score_codex":0.0000212013,"about_ca_topic_score_gemma":0.000017336297,"teacher_disagreement_score":0.99351156,"about_ca_system_score_codex":0.0002412993,"about_ca_system_score_gemma":0.000229905,"threshold_uncertainty_score":0.99970746},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016798815,0.0027193564,0.98032135,0.00063475076,0.0011725243,0.00030533655,0.0000018364983,0.00014311491,0.013021831],"genre_scores_gemma":[0.7517116,0.0003341118,0.24749763,0.00027130812,0.00009604674,0.000005405614,0.0000014799158,0.000014097175,0.00006829211],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996597,0.000052244177,0.00069386547,0.0012332648,0.00082163804,0.0006019757],"domain_scores_gemma":[0.99735415,0.0006036617,0.00035461833,0.0014124674,0.0002021689,0.000072942705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064339355,0.00041985765,0.0007420712,0.0012002899,0.000118750024,0.00009946588,0.0030265593,0.00038638184,0.0000048814477],"category_scores_gemma":[0.00037541,0.00037623863,0.00013397163,0.0007061506,0.0012151209,0.0005117187,0.0012048669,0.00060811883,0.000011460408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025579428,0.00015607523,0.0017151884,0.00017462073,0.000028174194,0.0012488589,0.004393184,0.075123206,0.000561092,0.1876729,0.00006298409,0.72883815],"study_design_scores_gemma":[0.0006506994,0.00047269868,0.012810685,0.0010205475,0.00000949509,0.00034371534,0.000001708016,0.42349017,0.0039679683,0.5555263,0.00060849637,0.0010974777],"about_ca_topic_score_codex":0.00019448782,"about_ca_topic_score_gemma":0.0009498208,"teacher_disagreement_score":0.75003177,"about_ca_system_score_codex":0.0002831361,"about_ca_system_score_gemma":0.00072291936,"threshold_uncertainty_score":0.9998689},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010685393,0.00027940268,0.9574925,0.00021455917,0.0035556338,0.00024077918,0.0000023282194,0.00021115255,0.037896816],"genre_scores_gemma":[0.4198226,0.00009634532,0.575541,0.0027092213,0.0010518385,0.000012305004,0.000004526358,0.000048238642,0.0007138743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965901,0.000028502413,0.00045084168,0.001583041,0.0007051308,0.0006424256],"domain_scores_gemma":[0.9979362,0.00012565019,0.00022101904,0.0013848642,0.00016581449,0.00016644072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000524918,0.00050680374,0.00046204342,0.0006269014,0.00024056119,0.00042672426,0.0033987432,0.0003384609,0.000095891955],"category_scores_gemma":[0.000027332828,0.00043832758,0.00015693576,0.00044613233,0.00067662174,0.00071345136,0.0012136063,0.00083833694,0.00020114967],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061431497,0.000025817006,0.000030011744,0.000015596946,0.0000060448183,0.000072496914,0.0021478264,0.0026582656,0.000031708798,0.02339584,0.00006413867,0.9715461],"study_design_scores_gemma":[0.00045323337,0.0006587114,0.0006796873,0.00048988976,0.000011569713,0.0002941323,6.0544625e-7,0.5326997,0.00043049842,0.45511582,0.0075599253,0.0016061945],"about_ca_topic_score_codex":0.00004897126,"about_ca_topic_score_gemma":0.00007966416,"teacher_disagreement_score":0.9699399,"about_ca_system_score_codex":0.00027415153,"about_ca_system_score_gemma":0.00028216493,"threshold_uncertainty_score":0.9998068},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026718373,0.0001581454,0.9924959,0.0006840553,0.0009716663,0.00022269897,0.000011976737,0.00006561988,0.0027180968],"genre_scores_gemma":[0.8932813,0.000010350788,0.104921795,0.00079241465,0.00046900965,0.0000070065917,0.000026256099,0.000019199522,0.00047266833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786264,0.000027007218,0.0004594603,0.00082951586,0.0005446693,0.00027668718],"domain_scores_gemma":[0.99847573,0.00055539253,0.00027940827,0.00046518148,0.00013558814,0.00008872346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035329882,0.00029916796,0.0003494168,0.0007157687,0.00019046829,0.00020922595,0.0007431376,0.0001652352,0.000011277367],"category_scores_gemma":[0.00003318923,0.00028217072,0.00008340396,0.00031039934,0.00040545678,0.000382118,0.00038269444,0.00029982737,0.00001603071],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022307355,0.00008377473,0.000039534127,0.00004073377,0.000016245467,0.000017880946,0.0002350603,0.1441602,0.001899144,0.12822483,0.0004399201,0.7248204],"study_design_scores_gemma":[0.000525421,0.00044801325,0.001950429,0.00036310902,0.000012263769,0.00006310517,6.956691e-8,0.5447821,0.0039989785,0.4467579,0.00049651874,0.00060206256],"about_ca_topic_score_codex":0.00003734053,"about_ca_topic_score_gemma":0.000028482009,"teacher_disagreement_score":0.89060944,"about_ca_system_score_codex":0.00014292872,"about_ca_system_score_gemma":0.00034761653,"threshold_uncertainty_score":0.99996305},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047503407,0.000054310953,0.9937678,0.000023991737,0.00039975301,0.00080652145,0.0000021093033,0.000052031453,0.00014313117],"genre_scores_gemma":[0.17259985,0.0000058034325,0.82729423,0.000057879908,0.000021305039,0.000007896339,2.5821467e-7,0.000008255452,0.000004549191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981696,0.00006588083,0.00066118035,0.00036379855,0.00050617504,0.00023333872],"domain_scores_gemma":[0.99754006,0.0008587356,0.0005303258,0.0009070284,0.00013847425,0.00002537468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002356589,0.00021168964,0.0003202888,0.0008108755,0.000055016764,0.000072955816,0.0015765224,0.00011108389,0.0000027642843],"category_scores_gemma":[0.00009829364,0.00015520368,0.000061273786,0.0010635575,0.00014092805,0.0003977464,0.0009013477,0.00041869373,1.9872539e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025981735,0.0000630554,0.00060012826,0.0000901126,0.0000107654505,0.00014506561,0.01625302,0.007428947,0.000034715675,0.0009437587,0.0000029830985,0.97442484],"study_design_scores_gemma":[0.0010974199,0.0018233509,0.0010637494,0.00072155986,0.00004373009,0.002144348,0.000110455,0.9591034,0.013338054,0.019007469,0.00056460587,0.0009818713],"about_ca_topic_score_codex":0.0008504661,"about_ca_topic_score_gemma":0.0006732757,"teacher_disagreement_score":0.973443,"about_ca_system_score_codex":0.000100090096,"about_ca_system_score_gemma":0.00030147683,"threshold_uncertainty_score":0.63290226},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012226144,0.00078824384,0.9917242,0.005447845,0.00032499572,0.00057287526,0.000010789062,0.000082807484,0.0010470015],"genre_scores_gemma":[0.0042937277,0.0004380929,0.98962134,0.0041438737,0.000714472,0.000010649595,0.0000119011165,0.000028691149,0.00073723466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996699,0.00019393086,0.0004216558,0.0011518436,0.0010382264,0.0004953719],"domain_scores_gemma":[0.9924512,0.005686961,0.00029117803,0.00097249745,0.00039348128,0.00020466842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034549516,0.0003769961,0.0004841865,0.0008257888,0.0006177164,0.0007417358,0.0020245218,0.00020683545,0.0000064565907],"category_scores_gemma":[0.0007929363,0.00026334068,0.00016908564,0.0010674966,0.00066264876,0.00054008537,0.00062395906,0.00062720355,0.000005910587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010544978,0.000012376742,0.0000050461904,0.000006206753,0.00009897902,0.000008764815,0.0011482738,0.11922767,0.0000023130883,0.018709708,0.00009766313,0.8606725],"study_design_scores_gemma":[0.0003220743,0.00028407466,0.000027057842,0.00008880706,0.000103932405,0.000037892027,5.9962326e-7,0.88675207,0.00010445856,0.102213785,0.009635501,0.00042977915],"about_ca_topic_score_codex":0.000015863056,"about_ca_topic_score_gemma":0.000014963973,"teacher_disagreement_score":0.86024266,"about_ca_system_score_codex":0.00011145523,"about_ca_system_score_gemma":0.0005651754,"threshold_uncertainty_score":0.9999819},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006552877,0.0011167865,0.9955015,0.00025728883,0.0021030842,0.00053404673,0.000007336936,0.00009905194,0.00031533948],"genre_scores_gemma":[0.011482668,0.00008928328,0.98649156,0.00033917878,0.0004099103,0.000017305567,0.0000011190198,0.000038201135,0.0011307669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648917,0.000057074463,0.00071965606,0.0012700135,0.00085259235,0.00061148696],"domain_scores_gemma":[0.99676335,0.0011149027,0.0005544015,0.000789225,0.00068225915,0.00009589047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001190858,0.00048680935,0.0007906396,0.0006989444,0.00026825647,0.00025205358,0.0025606488,0.00034142422,0.000007048728],"category_scores_gemma":[0.00030615772,0.00043140896,0.00018414142,0.00054094166,0.00021774325,0.00039895345,0.0009070454,0.00065697473,0.000009170179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023949875,0.000014394194,0.000037043377,0.00026668314,0.000055369066,0.000040394178,0.004626837,0.07454823,0.00058902235,0.34401023,0.000041649655,0.5757462],"study_design_scores_gemma":[0.00069639424,0.0014038977,0.000081212194,0.009349821,0.00003367913,0.00036937848,0.0000030430294,0.52085394,0.1283653,0.13735014,0.1985226,0.0029706112],"about_ca_topic_score_codex":0.000011952472,"about_ca_topic_score_gemma":0.000008051419,"teacher_disagreement_score":0.5727756,"about_ca_system_score_codex":0.000343283,"about_ca_system_score_gemma":0.00078446575,"threshold_uncertainty_score":0.9998138},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000136661865,0.000047467045,0.9809588,0.000058626043,0.00071933406,0.01752842,9.791972e-7,0.00051323546,0.00015944184],"genre_scores_gemma":[0.00015387886,0.0000016838532,0.9956382,0.00018890074,0.0002473289,0.003453276,0.0000010243116,0.000047340003,0.00026839468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956857,0.00006389544,0.00066821754,0.001671254,0.0010152037,0.0008957215],"domain_scores_gemma":[0.9974831,0.0005212439,0.00034666958,0.001211822,0.0003029576,0.00013423654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010845514,0.0007033445,0.0006078723,0.0007102647,0.0003355486,0.00061639154,0.00272133,0.00030706121,0.000012005999],"category_scores_gemma":[0.00031806904,0.00063945225,0.00009816549,0.0006806715,0.00044198654,0.0008338389,0.0017600097,0.0008632797,0.000019358999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023384123,0.000015666827,0.0000050604585,0.000055378972,0.00000907282,0.000072389776,0.001014569,0.32228693,0.00012991678,0.0017870279,0.0000020702514,0.67461956],"study_design_scores_gemma":[0.00057406415,0.00024979882,0.000024244471,0.000975855,0.0000075454795,0.00015863996,3.0518626e-7,0.88032234,0.0111971395,0.089509144,0.014901131,0.0020798119],"about_ca_topic_score_codex":0.0000022161619,"about_ca_topic_score_gemma":0.0000054360466,"teacher_disagreement_score":0.6725398,"about_ca_system_score_codex":0.000847753,"about_ca_system_score_gemma":0.000683327,"threshold_uncertainty_score":0.99960566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011868782,0.0005799206,0.97102153,0.024714174,0.0014859652,0.0011682635,0.000109714776,0.00071670435,0.000085008265],"genre_scores_gemma":[0.021820411,0.000041318643,0.97370666,0.0029560323,0.0011989386,0.00005893974,0.000088532775,0.000078060344,0.000051098577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948574,0.00004806599,0.0006252296,0.0024461993,0.00085950876,0.0011636234],"domain_scores_gemma":[0.9915253,0.001046295,0.00045181977,0.006456138,0.00032849613,0.00019194462],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0007120425,0.0008624176,0.0008268078,0.00081456103,0.0005309753,0.0008631008,0.03288765,0.0010164196,0.000015204014],"category_scores_gemma":[0.0022600247,0.00077583815,0.00019120572,0.0007006176,0.0014208099,0.00052487233,0.052959893,0.0018206617,0.0000066562116],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017721903,0.000055484434,0.000018220362,0.00015844592,0.000028079308,0.000040044502,0.00024815288,0.010281342,0.000024292158,0.005234887,0.007914127,0.9759792],"study_design_scores_gemma":[0.00034925938,0.00014197624,0.000037508613,0.00022546611,0.000009242654,0.00002555689,1.3861364e-7,0.5965478,0.00008140522,0.39776665,0.0042505963,0.0005644055],"about_ca_topic_score_codex":0.000018123817,"about_ca_topic_score_gemma":0.000082845254,"teacher_disagreement_score":0.9754148,"about_ca_system_score_codex":0.00028315015,"about_ca_system_score_gemma":0.00052133074,"threshold_uncertainty_score":0.9994693},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041197796,0.003306126,0.99109626,0.0007992777,0.00044026435,0.00017301274,0.000004827018,0.00021083445,0.0035574252],"genre_scores_gemma":[0.3719943,0.0002060569,0.62256765,0.0030746164,0.0011883419,0.000011657101,0.0000049821747,0.000055432556,0.000896996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975379,0.00003562816,0.00031914047,0.0011259917,0.0005081979,0.0004731184],"domain_scores_gemma":[0.9979817,0.0004764326,0.00017358286,0.0011251929,0.00009950457,0.00014353811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008126975,0.00041786671,0.00038553172,0.00039533715,0.00031170386,0.00055266975,0.0019726818,0.00021855143,0.000024944871],"category_scores_gemma":[0.000074086405,0.00031725678,0.000076667544,0.0002370063,0.00046931568,0.0005645548,0.0014998119,0.0005389449,0.00001399864],"study_design_candidate":"design_other","study_design_consensus":null,"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.5017746e-7,0.000009259083,0.00000618626,0.000013584863,0.0000052481755,0.00003232616,0.0015073546,0.001242136,0.0016637291,0.02996557,0.000023860266,0.9655299],"study_design_scores_gemma":[0.00036092225,0.00013890213,0.00011883051,0.0012583035,0.000007726976,0.00030608344,0.000003608192,0.6647392,0.014652966,0.30754253,0.009551939,0.0013189908],"about_ca_topic_score_codex":0.000009062704,"about_ca_topic_score_gemma":0.000020079564,"teacher_disagreement_score":0.9642109,"about_ca_system_score_codex":0.000100364094,"about_ca_system_score_gemma":0.00018315094,"threshold_uncertainty_score":0.99992794},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009332671,0.00036401188,0.9755218,0.0004508443,0.006681577,0.0005357987,0.0000034458621,0.00034731103,0.016001908],"genre_scores_gemma":[0.616279,0.000031001407,0.3783466,0.001079158,0.002738048,0.000035374425,0.000008771385,0.00010936401,0.0013727085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946555,0.000048455957,0.0008531465,0.0020179984,0.0014345729,0.0009903626],"domain_scores_gemma":[0.9962146,0.00091710786,0.00040016498,0.0018569399,0.0004207725,0.00019036673],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010309669,0.0006885685,0.0006751321,0.00081774656,0.00035372085,0.0010678483,0.005084082,0.0004452783,0.0000329559],"category_scores_gemma":[0.0003371783,0.00065586704,0.00019229407,0.00071304175,0.0014504694,0.0008053678,0.0018668273,0.0010324662,0.00015612316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058650326,0.00007119552,0.00007177079,0.000053907544,0.000010522551,0.0001667826,0.00073566666,0.07711703,0.00014057462,0.3526067,0.00026158564,0.56875837],"study_design_scores_gemma":[0.00008058629,0.00012745157,0.000028931494,0.00026725393,0.0000064522756,0.00003378351,9.842352e-8,0.36365637,0.0019833676,0.6302988,0.0028613685,0.00065552857],"about_ca_topic_score_codex":0.00011188475,"about_ca_topic_score_gemma":0.00012038533,"teacher_disagreement_score":0.61618567,"about_ca_system_score_codex":0.00062743144,"about_ca_system_score_gemma":0.00083320844,"threshold_uncertainty_score":0.9999691},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03750094,0.0005205343,0.9610121,0.000033763412,0.00032234474,0.00033439999,0.000006753564,0.000012037284,0.00025709122],"genre_scores_gemma":[0.8064259,0.00013388852,0.19269295,0.00024485093,0.0004257829,0.000006913593,0.000017726914,0.000026400714,0.00002554974],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984973,0.000034996265,0.00024635583,0.0007504866,0.00018921001,0.00028164696],"domain_scores_gemma":[0.9994953,0.000041309253,0.00008781717,0.00026233343,0.00004407849,0.000069114016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007134356,0.00024381779,0.00018918264,0.00026159233,0.00008683667,0.0000627202,0.00029485117,0.00033386072,0.000004972054],"category_scores_gemma":[0.000016318363,0.0002327708,0.000044342487,0.000069350295,0.00020949564,0.000013562254,0.000032411863,0.0002548835,0.0000015162045],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019470526,0.000004981308,0.0000061913734,0.00000794064,0.0000018004216,0.0000035375876,0.00010356199,0.0007746135,0.44976166,0.000013820514,1.7792509e-8,0.5493024],"study_design_scores_gemma":[0.00055501895,0.0017925916,0.0002735194,0.00025548166,0.000010335095,0.000046677298,0.0000013880965,0.18695939,0.7940994,0.014916016,0.0003630615,0.00072712],"about_ca_topic_score_codex":0.00004386745,"about_ca_topic_score_gemma":0.00031531122,"teacher_disagreement_score":0.768925,"about_ca_system_score_codex":0.00004582323,"about_ca_system_score_gemma":0.00008399878,"threshold_uncertainty_score":0.9492118},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044535987,0.0002219789,0.9011648,0.0022162986,0.00733413,0.004951107,0.00017598971,0.00038000057,0.039019685],"genre_scores_gemma":[0.9836161,0.00018258176,0.008602357,0.0051658275,0.0004913544,0.00006955892,0.000006706605,0.000060825718,0.001804676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694985,0.000032176336,0.0005869768,0.0011369953,0.00060706167,0.00068691856],"domain_scores_gemma":[0.9965013,0.002324605,0.00030158515,0.00059395796,0.00013745145,0.00014104713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000097641634,0.00048157517,0.0005798691,0.00093854667,0.00032457657,0.0002114786,0.0010866272,0.00030025767,0.00010717961],"category_scores_gemma":[0.0009271386,0.00043674506,0.00020421107,0.00029958953,0.0009866997,0.00058477727,0.00021668141,0.0008079752,0.00007431237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085031625,0.0003420651,0.00010372309,0.00020799959,0.00003984992,0.00082619034,0.039707117,0.21889187,0.15357426,0.0032912595,0.0018269584,0.58033836],"study_design_scores_gemma":[0.009775117,0.0019721503,0.0007647467,0.0030859583,0.00007867184,0.0013308685,0.000057548226,0.7544525,0.107476115,0.041056454,0.07478387,0.0051659965],"about_ca_topic_score_codex":0.000020298443,"about_ca_topic_score_gemma":0.0005948082,"teacher_disagreement_score":0.9390801,"about_ca_system_score_codex":0.00035922008,"about_ca_system_score_gemma":0.00058235927,"threshold_uncertainty_score":0.99980843},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000113448405,0.00045069377,0.990364,0.0004863225,0.0024536294,0.00030451294,0.0000028890088,0.00034421677,0.005480299],"genre_scores_gemma":[0.55389994,0.0016915008,0.42854837,0.013260111,0.001849484,0.00003138766,0.000029269908,0.00013500328,0.00055494555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609214,0.0000329226,0.0007068228,0.0011751512,0.0011553101,0.00083765324],"domain_scores_gemma":[0.99718934,0.0002943002,0.00038588498,0.0015734326,0.00029114063,0.00026586954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005557568,0.0006032959,0.00056883943,0.0011491034,0.00042868988,0.00056930695,0.003558594,0.0004283743,0.000028773246],"category_scores_gemma":[0.000025287653,0.0005487851,0.00024408281,0.0010707912,0.0009265027,0.0009578591,0.0009539558,0.0010363236,0.00012911955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008779221,0.000041077303,0.00006374027,0.000038446437,0.000021710957,0.00020498782,0.0014504091,0.08505819,0.000018784996,0.14635298,0.00055999774,0.7661809],"study_design_scores_gemma":[0.00022971934,0.00010840721,0.00010546644,0.00017584136,0.000003694497,0.00021041713,1.8756926e-7,0.9642644,0.00011738884,0.026368419,0.007694675,0.0007213626],"about_ca_topic_score_codex":0.00001188434,"about_ca_topic_score_gemma":0.000014592194,"teacher_disagreement_score":0.87920624,"about_ca_system_score_codex":0.00014976792,"about_ca_system_score_gemma":0.0004000977,"threshold_uncertainty_score":0.9996964},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006781952,0.00014708501,0.9956322,0.0020940884,0.00063582323,0.000978417,0.000038030947,0.0002513576,0.00015520545],"genre_scores_gemma":[0.018165955,0.00012302694,0.97680974,0.0045341477,0.00013274522,0.00004953423,0.0000915328,0.000036477915,0.000056846184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616474,0.00006639694,0.0009097166,0.001533921,0.00086617214,0.00045906167],"domain_scores_gemma":[0.99724543,0.00089661527,0.00059869856,0.0007112372,0.00032254623,0.00022549373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018372185,0.00041964362,0.0004797207,0.0003861284,0.0002475836,0.0005827748,0.0014365014,0.00034580458,0.000015902528],"category_scores_gemma":[0.00026368815,0.0004125089,0.00009848985,0.00026066488,0.0008136996,0.00089697546,0.00056507194,0.0006307633,0.000009406623],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004301324,0.00003533073,0.00006786341,0.00006454978,0.000009341831,0.0000079957845,0.00042180353,0.000018583185,0.0017764934,0.0006350861,0.00048737676,0.9964713],"study_design_scores_gemma":[0.0027907633,0.0009813067,0.0013504513,0.0013176466,0.00004336436,0.00006455245,0.0000034106583,0.84868145,0.019991878,0.122591525,0.00054965843,0.0016339734],"about_ca_topic_score_codex":0.000015745907,"about_ca_topic_score_gemma":0.00000812912,"teacher_disagreement_score":0.9948373,"about_ca_system_score_codex":0.00028598245,"about_ca_system_score_gemma":0.00036820528,"threshold_uncertainty_score":0.9998327},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052600383,0.00011069614,0.9830898,0.0005151457,0.00086397363,0.00030982832,0.000005540818,0.0002243264,0.014354651],"genre_scores_gemma":[0.78599304,0.000045451703,0.20874968,0.0043551396,0.00050323614,0.000026561183,0.000008018987,0.000051905186,0.00026693582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965883,0.000042523327,0.00039492987,0.00150727,0.00088815065,0.0005788594],"domain_scores_gemma":[0.9972666,0.0005811264,0.00018143866,0.0016936471,0.0001112025,0.00016599805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007568228,0.00046755435,0.00034898595,0.0010846014,0.00034670357,0.0004028461,0.003167847,0.00025207803,0.00008690824],"category_scores_gemma":[0.00004220334,0.0004297086,0.00019376741,0.0008046953,0.00050576153,0.00023503217,0.0005819564,0.00067763304,0.00020133697],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014001584,0.00004632014,0.000005445156,0.000008035139,0.0000051587645,0.000018739534,0.00031449733,0.07788002,0.000044007116,0.17284772,0.000014914061,0.7488012],"study_design_scores_gemma":[0.00028957627,0.0002880755,0.00015583534,0.00029663084,0.000007084113,0.000033513617,4.163558e-8,0.5168937,0.0016952301,0.47713882,0.0024822352,0.00071928673],"about_ca_topic_score_codex":0.000009467575,"about_ca_topic_score_gemma":0.0000119154265,"teacher_disagreement_score":0.7854671,"about_ca_system_score_codex":0.00016323164,"about_ca_system_score_gemma":0.00018821252,"threshold_uncertainty_score":0.99981546},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013298046,0.00011481688,0.9975622,0.000042065305,0.0013460339,0.0005118786,0.000018870469,0.00015182009,0.00023901247],"genre_scores_gemma":[0.044087663,0.00002233721,0.9543146,0.00048574,0.0006272094,0.000032370597,0.00023911716,0.00010580362,0.00008514487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986134,0.000005243969,0.0002979535,0.00042493324,0.00032691503,0.00033154225],"domain_scores_gemma":[0.9992198,0.00018059774,0.000061168124,0.0003161614,0.00014839723,0.00007390947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023907154,0.00028582857,0.00024541267,0.0004259786,0.00009386349,0.00013453259,0.0003111681,0.0002402679,0.000007072948],"category_scores_gemma":[0.000014475131,0.00029140984,0.00007755898,0.00021834641,0.00012719564,0.00016951162,0.00003565256,0.00026747497,0.000004010412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011386016,0.0000034655059,9.632291e-7,0.00001999478,0.0000017757873,0.0000036723566,0.000028797383,0.5948635,0.000017491328,0.00019346655,0.0000031297056,0.40486264],"study_design_scores_gemma":[0.00018449464,0.000103739614,0.0000027025997,0.00007887753,0.0000075796115,0.000003150875,1.7372221e-7,0.9943781,0.000632907,0.004029597,0.00026308047,0.00031561],"about_ca_topic_score_codex":0.0000043941745,"about_ca_topic_score_gemma":0.00008557682,"teacher_disagreement_score":0.40454704,"about_ca_system_score_codex":0.0003139066,"about_ca_system_score_gemma":0.000068138725,"threshold_uncertainty_score":0.9999538},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000983302,0.00045583418,0.9909828,0.004266626,0.0014800926,0.00068792555,0.000005235622,0.00014977384,0.0018734363],"genre_scores_gemma":[0.70845425,0.00004180037,0.27648523,0.012503048,0.0016622538,0.00005722199,0.000012451078,0.00006185336,0.0007218922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532616,0.00006398149,0.00070173776,0.0019026384,0.0009708144,0.0010346643],"domain_scores_gemma":[0.9974198,0.00043728354,0.00023130562,0.0014264794,0.00015763959,0.00032750441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009880118,0.0006602224,0.00066339615,0.0008253052,0.00018072841,0.00052601757,0.004015828,0.00037237696,0.000026187641],"category_scores_gemma":[0.00004421718,0.00063895795,0.000102773316,0.0013309857,0.00020512803,0.00046241278,0.0013595701,0.0010038258,0.00012780326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063680936,0.000025248773,0.0000437991,0.000009790328,0.000005975121,0.000038051807,0.00030016128,0.40124264,7.777398e-7,0.009165916,0.000041349573,0.5891199],"study_design_scores_gemma":[0.00044211655,0.00009469248,0.00046787105,0.0003833821,0.000007259016,0.000028140994,2.2117428e-7,0.9804715,0.0000068018735,0.015164253,0.0022174008,0.00071637897],"about_ca_topic_score_codex":0.00003541832,"about_ca_topic_score_gemma":0.0014645624,"teacher_disagreement_score":0.7144975,"about_ca_system_score_codex":0.00039000352,"about_ca_system_score_gemma":0.00041551565,"threshold_uncertainty_score":0.9996062},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095694733,0.00038052755,0.9939773,0.000058670026,0.0013157603,0.00057956896,0.0000061305745,0.00011784869,0.0026072364],"genre_scores_gemma":[0.11734875,0.000008333119,0.8822313,0.000071207694,0.00020796248,0.000010077752,0.0000059930017,0.000031894193,0.000084453975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961003,0.00008990945,0.00076797395,0.0012811351,0.0012495595,0.00051108596],"domain_scores_gemma":[0.99649346,0.00021042701,0.0008387605,0.0019249513,0.00042969274,0.00010270407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015570376,0.00046781797,0.0005857625,0.0009406148,0.00019153467,0.0003745815,0.0028386784,0.00032133007,0.0000026353812],"category_scores_gemma":[0.000047673035,0.00040471545,0.000083712766,0.0010409128,0.0008880119,0.0008883583,0.0004678768,0.0005094894,0.000008094169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028970724,0.000078906356,0.00017685223,0.00030479362,0.00002917994,0.000043316668,0.0009261157,0.43408814,0.004398565,0.3837544,0.000018865876,0.17615189],"study_design_scores_gemma":[0.0003025166,0.00024068997,0.00029797675,0.00074185623,0.00001440305,0.00015594093,4.6630248e-7,0.9505572,0.005575914,0.040536065,0.0008713356,0.000705639],"about_ca_topic_score_codex":0.000105864565,"about_ca_topic_score_gemma":0.000012836198,"teacher_disagreement_score":0.51646906,"about_ca_system_score_codex":0.00044352704,"about_ca_system_score_gemma":0.0005640184,"threshold_uncertainty_score":0.9998405},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010532807,0.00013090717,0.9955713,0.00008374754,0.0017979856,0.00081761123,0.00003184125,0.00028201097,0.0012740247],"genre_scores_gemma":[0.3609781,0.00012827531,0.62927574,0.004814125,0.0015864187,0.00017154217,0.00039611867,0.0002011488,0.0024485325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666375,0.000023144406,0.0005876931,0.0013234153,0.00087566534,0.0005263255],"domain_scores_gemma":[0.99782616,0.00015011398,0.0003615403,0.0011193225,0.00036494256,0.00017791796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006531203,0.00043655044,0.0004516128,0.0007875622,0.0002895345,0.00078635116,0.0026230267,0.0002582546,0.000021663398],"category_scores_gemma":[0.000060847316,0.000419288,0.00015040305,0.0007082574,0.00024301388,0.00062950846,0.0007714417,0.00021527357,0.000057156776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057821744,0.00008102022,0.00001971866,0.00042871808,0.000027620528,0.000053809465,0.0010436284,0.105456635,0.00006288764,0.70043206,0.0001886247,0.19219948],"study_design_scores_gemma":[0.0004892706,0.00018778034,0.000008633935,0.0006628438,0.000015833204,0.000024375675,5.121475e-7,0.9516248,0.0010155699,0.038637474,0.00674695,0.0005859298],"about_ca_topic_score_codex":0.0000092918,"about_ca_topic_score_gemma":0.000013869991,"teacher_disagreement_score":0.84616816,"about_ca_system_score_codex":0.000623015,"about_ca_system_score_gemma":0.0006293413,"threshold_uncertainty_score":0.9998259},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010810965,0.00036922548,0.98060906,0.00020694495,0.0009012582,0.0004418283,0.0000020743234,0.00028044518,0.017081056],"genre_scores_gemma":[0.0112315295,0.00001415485,0.98747706,0.00059511664,0.00028542214,0.000016142436,0.0000032594817,0.00010380478,0.0002735237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974591,0.000066917906,0.00057863625,0.0006978452,0.00058143004,0.00061605196],"domain_scores_gemma":[0.99810565,0.0007495199,0.00018042976,0.00076170807,0.00011126514,0.00009142702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016083834,0.0004886973,0.00043940297,0.00037267758,0.00026881997,0.00040130076,0.0010444607,0.00028956812,0.00002523726],"category_scores_gemma":[0.00019474591,0.00038481265,0.00010987091,0.00049789815,0.00043984494,0.00019626647,0.00023585085,0.00097556075,0.000013536447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010260751,0.0000037248499,0.00004327659,0.000060966824,0.00001359065,0.0000074938653,0.0007531206,0.63857824,0.00015602622,0.0005220427,0.00002181477,0.35983866],"study_design_scores_gemma":[0.00016127118,0.00002859389,0.00002702283,0.00034329662,0.000015812977,0.00003877653,5.54251e-7,0.9781695,0.001065458,0.018802673,0.0008418608,0.0005051624],"about_ca_topic_score_codex":0.000003518359,"about_ca_topic_score_gemma":0.000017874641,"teacher_disagreement_score":0.35933352,"about_ca_system_score_codex":0.0002584404,"about_ca_system_score_gemma":0.000097148666,"threshold_uncertainty_score":0.9998604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001490284,0.00017622893,0.99294525,0.00072387734,0.00031999356,0.0003399534,0.0000015757649,0.0037452513,0.0015988655],"genre_scores_gemma":[0.09658715,0.000013447226,0.9011765,0.001713495,0.00024438062,0.00000934766,0.0000050437325,0.000030545947,0.00022007726],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99593794,0.00002626207,0.0004935771,0.0015263392,0.0010819958,0.0009338527],"domain_scores_gemma":[0.99692553,0.0006295548,0.0004004809,0.0015301013,0.00037511004,0.00013923724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012258876,0.0005402119,0.0004441507,0.00066294154,0.0004135407,0.00073738577,0.0030228293,0.00021379803,0.0000056685485],"category_scores_gemma":[0.0002378573,0.00046106926,0.0000736264,0.00087917794,0.00038280792,0.00078429916,0.0010127132,0.0006907822,0.000013876473],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027626706,0.000017668277,0.0016470973,0.000023038885,0.0000043026557,0.00007132951,0.0002957274,0.0014304973,0.000061378654,0.0060363114,0.000087235436,0.99032265],"study_design_scores_gemma":[0.00032294044,0.00073938293,0.004015154,0.0019990036,0.000014543169,0.00026015154,6.8398236e-8,0.2508256,0.0018198658,0.73595494,0.0025604118,0.0014878856],"about_ca_topic_score_codex":0.00005561455,"about_ca_topic_score_gemma":0.00008575537,"teacher_disagreement_score":0.98883474,"about_ca_system_score_codex":0.0002713197,"about_ca_system_score_gemma":0.0005343001,"threshold_uncertainty_score":0.9997841},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010289876,0.0013603461,0.7255282,0.0002962438,0.005314811,0.0004590759,0.000009598714,0.000121116085,0.26588166],"genre_scores_gemma":[0.95185494,0.00023818543,0.036235042,0.0004478028,0.0027590848,0.000013092094,0.000009282802,0.00006991314,0.008372655],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99688977,0.00004515989,0.00044286854,0.00091118814,0.0009707055,0.0007403154],"domain_scores_gemma":[0.99846053,0.00067547994,0.0002481818,0.0003355642,0.00015588578,0.00012435633],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001043931,0.00036097874,0.0004372403,0.00068809267,0.00023677456,0.00053044275,0.0010142318,0.00031618582,0.000038459577],"category_scores_gemma":[0.00014259419,0.00036621315,0.00010455777,0.00047682427,0.001037975,0.00066521653,0.0002985094,0.0009193587,0.000020037265],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023034077,0.00002479571,0.00020377137,0.0000130528,0.0000066276198,0.00012855415,0.027124524,0.018842937,0.000019620886,0.009527228,0.000047077843,0.94403875],"study_design_scores_gemma":[0.00052228273,0.0002214195,0.000589851,0.0027330942,0.000016351905,0.000015017776,0.000147434,0.013843283,0.00026904466,0.057796337,0.92193556,0.0019103471],"about_ca_topic_score_codex":0.00027846338,"about_ca_topic_score_gemma":0.006033496,"teacher_disagreement_score":0.9508259,"about_ca_system_score_codex":0.0011800473,"about_ca_system_score_gemma":0.0005504564,"threshold_uncertainty_score":0.999879},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004423769,0.0006047347,0.9936879,0.0003834145,0.002007904,0.00053528656,0.000003455839,0.00019400835,0.0025390377],"genre_scores_gemma":[0.17942685,0.00010432106,0.8179416,0.0011387304,0.0008252778,0.000017740058,0.000034212928,0.000044432927,0.0004668639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995937,0.000029568782,0.0006016555,0.001527876,0.0013113247,0.0005925685],"domain_scores_gemma":[0.9978979,0.0003172484,0.00036259403,0.00088454277,0.00035836626,0.00017933772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008752365,0.00050315034,0.00042968406,0.0025941506,0.000359266,0.0008207152,0.0020139008,0.00031292767,0.00007919038],"category_scores_gemma":[0.0001272923,0.0004994636,0.00013719875,0.0026614643,0.00017869563,0.001172571,0.00086844,0.0006006367,0.00004258056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013753494,0.00002025698,0.000011928462,0.000021826161,0.000006431737,0.000020620671,0.00017503375,0.81477606,0.000035321973,0.024243323,0.0000085452175,0.16067925],"study_design_scores_gemma":[0.00037731393,0.00013259205,0.00010291293,0.00026309214,0.000007426829,0.000056394943,3.654844e-8,0.88980347,0.0006485884,0.10734882,0.00066978246,0.00058954675],"about_ca_topic_score_codex":0.000016998707,"about_ca_topic_score_gemma":0.000014476889,"teacher_disagreement_score":0.1793826,"about_ca_system_score_codex":0.0006608139,"about_ca_system_score_gemma":0.0008963424,"threshold_uncertainty_score":0.9997457},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026432758,0.0006659559,0.9631176,0.0014349822,0.0018417048,0.0022865725,0.000019298714,0.00021982404,0.0039813253],"genre_scores_gemma":[0.9456964,0.000030247615,0.05346593,0.00011334124,0.00025397804,0.000056842855,0.000008339156,0.000031776148,0.00034316088],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627084,0.000121597775,0.0004447282,0.0009195786,0.0017192261,0.00052401714],"domain_scores_gemma":[0.9967071,0.0004559837,0.00037690133,0.0007366736,0.0016037673,0.0001195904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037827375,0.00030796597,0.0004616324,0.00058735325,0.00031822285,0.00012588163,0.0016319896,0.0005591222,0.0002160287],"category_scores_gemma":[0.0008525685,0.00030543795,0.00009362439,0.00048250437,0.0013171982,0.00049070717,0.00023793845,0.00043518547,0.000026360332],"study_design_candidate":"design_other","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.0000094727,0.000040364965,0.000032755666,0.000022344864,0.000015738156,6.5134213e-7,0.009737513,0.0037569166,0.00041987564,0.00351059,0.000063646105,0.9823901],"study_design_scores_gemma":[0.0021052232,0.0013875358,0.0011671593,0.00085764675,0.00021710718,0.000009621147,0.00006421104,0.34709063,0.008849148,0.62965,0.0071099005,0.0014918438],"about_ca_topic_score_codex":0.000756822,"about_ca_topic_score_gemma":0.021124586,"teacher_disagreement_score":0.98089826,"about_ca_system_score_codex":0.00045855585,"about_ca_system_score_gemma":0.0013500963,"threshold_uncertainty_score":0.9999398},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075693084,0.00037680005,0.9910627,0.000034322537,0.00022644101,0.00018054414,0.000033051325,0.000011251714,0.00050560647],"genre_scores_gemma":[0.88898015,0.00006339971,0.11038901,0.00016392929,0.00028620238,0.00000474103,0.00003377668,0.000019224677,0.00005958147],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986491,0.000012730286,0.00026211707,0.0005485638,0.00029029677,0.00023715258],"domain_scores_gemma":[0.9991785,0.00004350319,0.0001411119,0.00041782027,0.00016404709,0.000054976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011289647,0.00022011402,0.00024045762,0.00008957341,0.000092175535,0.000024474488,0.00044812873,0.00024320825,0.000004240498],"category_scores_gemma":[0.00016452253,0.00019319181,0.00005891274,0.00009118071,0.00086927594,0.0000062815143,0.00029632155,0.00028270172,0.0000017409177],"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.000046596277,0.00003496511,0.0000642675,0.00008442463,0.00003628874,0.000021635382,0.00026936794,0.01188389,0.8244854,0.001575767,0.000022872764,0.1614745],"study_design_scores_gemma":[0.0005266279,0.000526472,0.00014325154,0.00033207738,0.000032998945,0.00024485617,4.3694143e-7,0.07447198,0.8893479,0.032376833,0.0010114362,0.0009851211],"about_ca_topic_score_codex":0.000016661383,"about_ca_topic_score_gemma":0.000023029645,"teacher_disagreement_score":0.88141084,"about_ca_system_score_codex":0.00004372079,"about_ca_system_score_gemma":0.0003929796,"threshold_uncertainty_score":0.78781337},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015281704,0.0013969875,0.99483824,0.00008125828,0.0011488129,0.00044586216,0.000056051664,0.00013922135,0.0003653712],"genre_scores_gemma":[0.57013315,0.0007991903,0.42754626,0.0005446992,0.00034222557,0.00015162115,0.00009374352,0.00019211955,0.00019702618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981859,0.0000061298847,0.0003827848,0.0006768455,0.00027994474,0.0004684332],"domain_scores_gemma":[0.9984463,0.0006867142,0.00007949624,0.0005448041,0.0001456258,0.000097101605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024800154,0.0003779695,0.00047167295,0.00022268416,0.00013187117,0.00011209209,0.0005055464,0.00022079809,0.0000064147443],"category_scores_gemma":[0.000082378494,0.00040613132,0.00014650752,0.000225148,0.00014209369,0.00009277429,0.000068973786,0.00029539832,0.000008954811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017601398,0.000007679311,0.000010195762,0.00010807387,0.000029041901,0.0000012820816,0.000118358825,0.94531375,0.03107358,0.00026658867,0.00024449965,0.022825183],"study_design_scores_gemma":[0.00009295369,0.000018612054,0.0000023477241,0.00027089412,0.000020697997,0.0000013930156,2.2985618e-7,0.9458668,0.0404767,0.012022755,0.00065112684,0.0005754914],"about_ca_topic_score_codex":0.0000037162395,"about_ca_topic_score_gemma":0.00001843798,"teacher_disagreement_score":0.56860495,"about_ca_system_score_codex":0.0002745943,"about_ca_system_score_gemma":0.00017383261,"threshold_uncertainty_score":0.99983907},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080948847,0.0001624981,0.9929251,0.0009012928,0.0039370987,0.0006128476,0.0000138785745,0.00016709503,0.00047071726],"genre_scores_gemma":[0.32733986,0.00002980386,0.67081183,0.0008877258,0.000546202,0.0000528126,0.000015388918,0.000053584045,0.0002627874],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963459,0.000055809436,0.0007308464,0.0015470331,0.00067419285,0.0006462466],"domain_scores_gemma":[0.9968569,0.0009749513,0.0003576908,0.0014217413,0.00026988224,0.00011880953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002810346,0.0004659557,0.000576258,0.0009905113,0.00020862035,0.00059876184,0.0028564713,0.00038857397,0.00001155752],"category_scores_gemma":[0.0004053993,0.00042762017,0.00015667436,0.00062063354,0.00042712083,0.0006606181,0.00056470954,0.0008399722,0.000026199197],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016006903,0.00006791349,0.003286657,0.00011439337,0.000011854964,0.00007018545,0.0009363069,0.0017008049,0.00515383,0.019830732,0.00002158422,0.96878976],"study_design_scores_gemma":[0.0010642143,0.0004735541,0.037416596,0.00051782664,0.000016823833,0.0001688108,2.0785417e-7,0.230847,0.026288098,0.69440323,0.006777816,0.0020258448],"about_ca_topic_score_codex":0.000042218307,"about_ca_topic_score_gemma":0.0010585751,"teacher_disagreement_score":0.9667639,"about_ca_system_score_codex":0.00016175196,"about_ca_system_score_gemma":0.0005397835,"threshold_uncertainty_score":0.99981755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029839046,0.00045855952,0.9781495,0.0035424486,0.0012527449,0.00047305846,0.0000081688195,0.00045660662,0.015360562],"genre_scores_gemma":[0.24191476,0.000050625345,0.7410433,0.015651448,0.0010082745,0.00001349251,0.0000611055,0.00006404486,0.0001929082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954179,0.00005122115,0.0007078503,0.0017667196,0.0011843268,0.00087199116],"domain_scores_gemma":[0.9966081,0.00037810675,0.00042799494,0.0018446862,0.00048025497,0.0002608964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005972724,0.00071742054,0.00061696867,0.00127425,0.0006572899,0.0008968778,0.0040004645,0.0003972981,0.000030324254],"category_scores_gemma":[0.000007009947,0.00069493585,0.00016911974,0.001583578,0.00019084582,0.0012322085,0.0012800089,0.0009881939,0.000074049254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012477628,0.000052826417,0.000015759852,0.00010645155,0.000024099863,0.00007554656,0.005112445,0.44284067,0.0021014279,0.034261025,0.000016070888,0.5153812],"study_design_scores_gemma":[0.00042002357,0.00015303446,0.00011315363,0.001023797,0.000023101902,0.00013676615,0.0000010434849,0.9201947,0.0027791858,0.069902696,0.004235629,0.0010168998],"about_ca_topic_score_codex":0.000076433265,"about_ca_topic_score_gemma":0.00048369516,"teacher_disagreement_score":0.5143643,"about_ca_system_score_codex":0.0002986417,"about_ca_system_score_gemma":0.0005602314,"threshold_uncertainty_score":0.99955016},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021288359,0.00077513774,0.99045944,0.00061043026,0.006727654,0.0005647336,0.000029707706,0.00030988271,0.0005017221],"genre_scores_gemma":[0.042403165,0.00030698482,0.951154,0.0026693507,0.003082183,0.000028207689,0.000095256335,0.00009284551,0.00016803763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99508256,0.000043334876,0.0007631194,0.002064495,0.0008645078,0.0011819749],"domain_scores_gemma":[0.9964164,0.0010177995,0.00037959384,0.0016232637,0.00024387223,0.00031909486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007375624,0.0007152594,0.00072701863,0.00062392507,0.0005967759,0.0005657492,0.0038475203,0.00047646408,0.000016394883],"category_scores_gemma":[0.000110804394,0.00066899875,0.00029250653,0.00057285844,0.0006542279,0.0005570756,0.000975734,0.0012520107,0.0000082157385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009561929,0.000019255076,0.0000076274805,0.00001527653,0.0000081411945,0.00006792169,0.00065173005,0.23600173,0.0000027738483,0.0008818021,0.00051896286,0.7618152],"study_design_scores_gemma":[0.0003449002,0.00024329191,0.00001350414,0.00029055923,0.000007941823,0.0001672165,2.2656687e-7,0.9800004,0.000026879303,0.0048794267,0.013276737,0.0007489575],"about_ca_topic_score_codex":0.0000077237055,"about_ca_topic_score_gemma":0.000027893806,"teacher_disagreement_score":0.76106626,"about_ca_system_score_codex":0.00017708266,"about_ca_system_score_gemma":0.00031598477,"threshold_uncertainty_score":0.99957615},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009135863,0.0002680721,0.98739433,0.0007588767,0.00044100985,0.00046289785,0.000005084491,0.00017472135,0.010403618],"genre_scores_gemma":[0.09740877,0.00016276367,0.90035576,0.0014296591,0.00020379253,0.0000057881234,0.000007639731,0.00003603177,0.0003897788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99612266,0.00005335337,0.0004526103,0.0014259696,0.0011210217,0.0008244004],"domain_scores_gemma":[0.9977583,0.00041885575,0.00018058416,0.0010500947,0.0002403065,0.00035182247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016795268,0.00043539182,0.00044635218,0.0010370602,0.00042544396,0.0008510196,0.0024016476,0.0002462397,0.000025987252],"category_scores_gemma":[0.000068983674,0.00040339067,0.00009297062,0.0006301249,0.0015232048,0.00068494864,0.0019332122,0.0011373507,0.00001644988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007352595,0.000038796836,0.00027128504,0.000051523253,0.000013659068,0.00006421455,0.0010172715,0.029599363,0.000029445275,0.2996483,0.000014444421,0.66924435],"study_design_scores_gemma":[0.00025100049,0.00012635585,0.00049218937,0.00013710454,0.00000259636,0.000037732036,1.7902597e-7,0.826452,0.00015524206,0.170817,0.0010591262,0.0004694259],"about_ca_topic_score_codex":0.00005944856,"about_ca_topic_score_gemma":0.00018588247,"teacher_disagreement_score":0.7968527,"about_ca_system_score_codex":0.00017842204,"about_ca_system_score_gemma":0.00038571388,"threshold_uncertainty_score":0.9998418},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009780835,0.00041704232,0.991482,0.002125331,0.0028163707,0.00047977726,0.00002503075,0.0001398392,0.0024167674],"genre_scores_gemma":[0.017578948,0.00008098136,0.97076946,0.010682331,0.0007342557,0.000017866,0.000008845248,0.00004200368,0.000085323954],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99498326,0.000038203674,0.0006055178,0.0019910235,0.0013046297,0.001077344],"domain_scores_gemma":[0.9962978,0.0007108367,0.00044271883,0.0018766097,0.00033164618,0.00034042264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012819447,0.00057988195,0.0005918429,0.0010383733,0.0003493254,0.0009654122,0.0046478184,0.00042625362,0.000018115794],"category_scores_gemma":[0.0004583079,0.0005218153,0.00009090239,0.0010331965,0.0002601995,0.002207505,0.0034623255,0.0018004583,0.000055312135],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004640422,0.00030199872,0.00040819234,0.00009320978,0.000022143158,0.0011890717,0.0028575694,0.0156075675,0.0005666872,0.0824059,0.00032971735,0.8961715],"study_design_scores_gemma":[0.0014439012,0.0005388461,0.0011853572,0.0036058077,0.00002219838,0.00027657702,0.0000056007084,0.36152634,0.0032725015,0.10215001,0.5228331,0.0031397333],"about_ca_topic_score_codex":0.0001292527,"about_ca_topic_score_gemma":0.0017132402,"teacher_disagreement_score":0.8930318,"about_ca_system_score_codex":0.0002845256,"about_ca_system_score_gemma":0.0005099645,"threshold_uncertainty_score":0.9997233},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80261415,0.000020177777,0.19607718,0.00031684275,0.00031906608,0.0005929457,0.0000014478928,0.0000389861,0.00001917199],"genre_scores_gemma":[0.94945145,0.0000011651571,0.049284212,0.00095384737,0.0002714956,0.000027893691,0.000001630526,0.000007387499,9.3025596e-7],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988266,0.00002354158,0.00018019878,0.0004403604,0.00025167313,0.00027761175],"domain_scores_gemma":[0.99769115,0.0018185197,0.00004581408,0.00019473095,0.00011050173,0.00013929175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053443265,0.00012374634,0.00021045472,0.00014228388,0.0001368859,0.00012797538,0.0001456697,0.00005170702,0.000026318503],"category_scores_gemma":[0.0011450391,0.00009460817,0.000034530065,0.0004691119,0.00030333805,0.00014148369,0.00006030803,0.00021382657,0.000001933718],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041444326,0.0005081575,0.3700536,0.0000366966,0.000028813036,0.00007998683,0.006137602,0.0011238676,0.14421052,0.000036652822,0.000006875402,0.47736278],"study_design_scores_gemma":[0.021994598,0.0028139919,0.65265757,0.00013893514,0.000090749134,0.0001903026,0.0000535007,0.14174533,0.17528975,0.0031412707,0.0011889371,0.0006950926],"about_ca_topic_score_codex":0.000018560804,"about_ca_topic_score_gemma":0.00013967794,"teacher_disagreement_score":0.4766677,"about_ca_system_score_codex":0.000016528733,"about_ca_system_score_gemma":0.00015800318,"threshold_uncertainty_score":0.3858009},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023013905,0.00020805853,0.98433375,0.00061317586,0.00735411,0.00076035486,0.000011700385,0.00021032522,0.004207118],"genre_scores_gemma":[0.41347346,0.000011556762,0.5804487,0.0009837258,0.0014309859,0.000022442468,0.00001953178,0.00006203201,0.0035475607],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912409,0.00011859108,0.0010525275,0.0035573582,0.003024801,0.0010058053],"domain_scores_gemma":[0.9931706,0.0023245197,0.00068168953,0.0029821335,0.00057154184,0.00026950345],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.012192829,0.00064286846,0.00082069065,0.0018669488,0.0007126481,0.0029668568,0.0056844596,0.00044141995,0.00011822741],"category_scores_gemma":[0.0031849595,0.00047364464,0.00023838345,0.001666446,0.0020462186,0.00047744537,0.0035300988,0.0014600356,0.0003408429],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010463609,0.000025284226,0.0009767715,0.000011325009,0.000009088712,0.0000412013,0.00025456346,0.0040579904,0.00021610309,0.0011423411,0.00007171487,0.99318314],"study_design_scores_gemma":[0.0009185489,0.0005289941,0.003419997,0.0016691039,0.000049477494,0.00014087568,0.00000402653,0.2755472,0.001912831,0.48797294,0.2250395,0.0027964944],"about_ca_topic_score_codex":0.00005248836,"about_ca_topic_score_gemma":0.00036635826,"teacher_disagreement_score":0.99038666,"about_ca_system_score_codex":0.00021586397,"about_ca_system_score_gemma":0.00034042625,"threshold_uncertainty_score":0.99977154},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010037804,0.0002942472,0.99539596,0.0008113961,0.0011461381,0.0007850765,0.000012654019,0.00036354893,0.0011809282],"genre_scores_gemma":[0.010996893,0.0001315922,0.98558635,0.00257419,0.00042240653,0.000085425236,0.000007328633,0.000065427135,0.00013039792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599564,0.00006589272,0.0006982921,0.0017196488,0.0007936285,0.0007268955],"domain_scores_gemma":[0.9960829,0.001590052,0.00030920317,0.0013707891,0.00043452953,0.00021251505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016764029,0.00058240216,0.0007250298,0.0012746123,0.00040172273,0.0009753517,0.003200905,0.00036274295,0.000012761278],"category_scores_gemma":[0.00028117895,0.00054780213,0.00031637342,0.00071285135,0.0005919086,0.00053268,0.0008502131,0.0005730169,0.0000062812965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002316197,0.00004648198,0.000012223676,0.00010312274,0.000023532048,0.00003751426,0.00038334826,0.0010468944,0.00010753776,0.50684905,0.0002629388,0.4911042],"study_design_scores_gemma":[0.00033987287,0.00014704932,0.0000052301043,0.00027898545,0.000009513407,0.000032390944,3.5376125e-8,0.59280217,0.0046513323,0.3955897,0.0055495165,0.0005942056],"about_ca_topic_score_codex":0.0000061238406,"about_ca_topic_score_gemma":0.000009338019,"teacher_disagreement_score":0.5917553,"about_ca_system_score_codex":0.00015431952,"about_ca_system_score_gemma":0.0003501744,"threshold_uncertainty_score":0.9996973},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000061527804,0.000101175756,0.9946856,0.0017273887,0.00145895,0.00090193056,0.000033322824,0.00026670285,0.00076343765],"genre_scores_gemma":[0.009587475,0.000010379073,0.9869554,0.0026292235,0.0004382809,0.00003587754,0.00011147791,0.000032866217,0.0001990308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614924,0.00008704218,0.00042336865,0.0018296097,0.0008714365,0.0006392796],"domain_scores_gemma":[0.9972453,0.0006092611,0.00036428683,0.0011022836,0.0004522993,0.00022657414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001326322,0.0005472534,0.000469423,0.00088021357,0.0003911908,0.0006365836,0.0016769485,0.00059353956,0.000022500803],"category_scores_gemma":[0.000098775046,0.0004995284,0.00019725328,0.00049003464,0.00014500605,0.0007137164,0.00015365066,0.00077638874,0.000039421106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022528182,0.00006911352,3.6670673e-7,0.000029668661,0.000003521549,0.000013811281,0.00017765239,0.048249796,0.0019754174,0.00030193018,0.00010494996,0.94905126],"study_design_scores_gemma":[0.0004577973,0.00042601844,0.000036451213,0.00042684918,0.000014224074,0.000040366256,3.5818027e-7,0.93150777,0.018466061,0.045526534,0.0024493095,0.000648263],"about_ca_topic_score_codex":0.0000087204135,"about_ca_topic_score_gemma":0.000023159957,"teacher_disagreement_score":0.948403,"about_ca_system_score_codex":0.00026881022,"about_ca_system_score_gemma":0.00037652696,"threshold_uncertainty_score":0.9997456},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001681207,0.0010915447,0.99288476,0.0007402299,0.0014821355,0.0007173009,0.000033147437,0.00029533505,0.0027387145],"genre_scores_gemma":[0.0022704045,0.00012340641,0.9945667,0.0011528083,0.00079585426,0.00005033155,0.000025333124,0.00006124765,0.0009539465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552464,0.000028766432,0.0007243177,0.0019585958,0.00082485744,0.0009388424],"domain_scores_gemma":[0.99659765,0.0005308289,0.00045821426,0.0018385885,0.00037409077,0.00020065308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010365604,0.0006644599,0.0007565791,0.0005996799,0.00053857366,0.0004405789,0.002244931,0.00031032454,0.000012797781],"category_scores_gemma":[0.00020279847,0.0006167427,0.00020639425,0.00053167896,0.0007809357,0.0014772483,0.0013230137,0.00055585604,0.000015165861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011551393,0.00001714514,0.0000101185,0.00014662779,0.000014291225,0.00013286354,0.00073083915,0.008170378,0.00024168346,0.5718001,0.00013185418,0.41859257],"study_design_scores_gemma":[0.0008987927,0.0005729486,0.00001674679,0.0028547577,0.000022009835,0.00054285175,0.0000032111145,0.2961,0.0037510365,0.42469063,0.26798645,0.002560587],"about_ca_topic_score_codex":0.000030192206,"about_ca_topic_score_gemma":0.00005498134,"teacher_disagreement_score":0.416032,"about_ca_system_score_codex":0.00025883122,"about_ca_system_score_gemma":0.00046511402,"threshold_uncertainty_score":0.99962837},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09796325,0.0015229151,0.8834316,0.011344142,0.00058564026,0.002290876,0.00011919958,0.00010960835,0.002632758],"genre_scores_gemma":[0.95843065,0.00006487503,0.018769795,0.022160748,0.00018495454,0.000028110764,0.0001235561,0.00003662079,0.00020067733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982973,0.000013484936,0.00027277865,0.0007434051,0.0004647694,0.00020827321],"domain_scores_gemma":[0.99905634,0.0002779107,0.00008754633,0.00031731886,0.000103889455,0.00015699131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015285848,0.00022536449,0.00033067854,0.00033227805,0.00006747696,0.000018053574,0.00013116853,0.000105357954,0.000106734355],"category_scores_gemma":[0.00009041337,0.00018009027,0.000057690762,0.00022111084,0.0002247395,0.00007692266,0.00017653314,0.00023993498,0.000019580722],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085505727,0.000692447,0.0021900986,0.00030081405,0.00007831705,0.0008418974,0.00015589595,0.012008355,0.037353616,0.0037382531,0.0008628655,0.9409224],"study_design_scores_gemma":[0.008986289,0.0047608176,0.09029415,0.0017470265,0.00037316358,0.0015703845,4.3392356e-7,0.5898098,0.018517805,0.2742989,0.006845642,0.00279561],"about_ca_topic_score_codex":0.000008503367,"about_ca_topic_score_gemma":0.000008750561,"teacher_disagreement_score":0.9381268,"about_ca_system_score_codex":0.000030798692,"about_ca_system_score_gemma":0.00010300055,"threshold_uncertainty_score":0.7343868},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000715478,0.0004595289,0.99680597,0.000081794045,0.0008096275,0.00026269033,0.0000015388074,0.0003640939,0.00049930124],"genre_scores_gemma":[0.30622512,0.00005158521,0.6932581,0.00030770642,0.00010826857,0.0000031948118,0.0000018995756,0.00002752241,0.00001657706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738044,0.000014987122,0.00046123666,0.0010573003,0.00058754603,0.0004985137],"domain_scores_gemma":[0.9970742,0.0015543232,0.00020216004,0.00087055913,0.00019254316,0.00010625198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010075815,0.00038337638,0.0004188129,0.0011703622,0.0002007546,0.0005742585,0.0018105895,0.000285578,0.0000137481875],"category_scores_gemma":[0.0004630599,0.0003854149,0.000039720962,0.0012295085,0.00019927541,0.00081448286,0.0015727191,0.00082237757,0.000011391346],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058791857,0.000029966055,0.007229748,0.00006364302,0.0000068235954,0.00019414199,0.0011676901,0.06442236,0.000030160603,0.0048859813,0.000035309877,0.9219283],"study_design_scores_gemma":[0.00031629272,0.00013207963,0.009538701,0.0019910638,0.000009774231,0.0001722692,3.1507014e-7,0.84104204,0.00042017162,0.1430651,0.002218397,0.0010938166],"about_ca_topic_score_codex":0.00003092391,"about_ca_topic_score_gemma":0.00015963116,"teacher_disagreement_score":0.9208345,"about_ca_system_score_codex":0.00023215984,"about_ca_system_score_gemma":0.0001975275,"threshold_uncertainty_score":0.99985975},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010433078,0.00044435967,0.9953937,0.001436701,0.0005717239,0.0006663277,0.0000106056,0.00035750636,0.000075784985],"genre_scores_gemma":[0.19282666,0.00007911067,0.8063325,0.00030701532,0.00022735336,0.000038033904,0.000012831299,0.000024953106,0.00015153369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710345,0.000021168076,0.00045102145,0.0011878003,0.0007129359,0.00052361365],"domain_scores_gemma":[0.99850947,0.00027968836,0.0002292696,0.0006521541,0.00023653086,0.00009290999],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080609665,0.00038196938,0.00034244472,0.0007663766,0.00046123835,0.0006419424,0.001593901,0.00027279867,0.0000057797943],"category_scores_gemma":[0.00003677332,0.00035544834,0.000076879485,0.00033564228,0.00016691502,0.00080458337,0.0010585216,0.00050359505,0.000008676407],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028757836,0.0000107356245,0.0000030493438,0.000034075296,0.0000052779346,0.0000028516492,0.0004076347,0.042469278,0.00083677965,0.009868125,0.000011669348,0.94634765],"study_design_scores_gemma":[0.00030146033,0.00016386485,0.00002838789,0.00020279165,0.0000066355833,0.00004303204,0.0000012737032,0.8991419,0.010773844,0.08881139,0.00017099646,0.00035439202],"about_ca_topic_score_codex":0.000009000267,"about_ca_topic_score_gemma":0.000020385576,"teacher_disagreement_score":0.94599324,"about_ca_system_score_codex":0.00019742842,"about_ca_system_score_gemma":0.00016587906,"threshold_uncertainty_score":0.99988973},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000600393,0.00029751478,0.99413747,0.0022576258,0.0012573946,0.00058206235,0.000006381703,0.000041427153,0.0008197073],"genre_scores_gemma":[0.43712056,0.00008612868,0.5599906,0.0023521865,0.0003393902,0.000017410368,0.000029494136,0.00002256761,0.00004165346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970239,0.00010085325,0.0005631777,0.0012804421,0.0006581171,0.00037353058],"domain_scores_gemma":[0.9955666,0.0012144961,0.0003436861,0.002709088,0.000112408066,0.000053730382],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.002875881,0.00033982436,0.000489757,0.0005035013,0.00016754468,0.00097298296,0.012630105,0.00027735683,0.000005146751],"category_scores_gemma":[0.00025387693,0.00024272378,0.000041896375,0.00047347046,0.0007880042,0.002355069,0.0055535655,0.00090401754,0.0000037000061],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028127899,0.000090831105,0.00049005094,0.00011262793,0.0000120235945,0.00013795221,0.009444524,0.002648362,0.0006989262,0.033313483,0.00004818614,0.9529749],"study_design_scores_gemma":[0.0008512545,0.00032746,0.00069465284,0.0013170376,0.000015820864,0.00004071773,0.0000086696455,0.66673213,0.0021223016,0.32378346,0.003316493,0.00078998535],"about_ca_topic_score_codex":0.00014131394,"about_ca_topic_score_gemma":0.001697825,"teacher_disagreement_score":0.9521849,"about_ca_system_score_codex":0.00004468584,"about_ca_system_score_gemma":0.0004260086,"threshold_uncertainty_score":0.992712},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075171506,0.0007882999,0.98864794,0.0006734913,0.00047020393,0.00044818435,0.000011617315,0.000028613083,0.0014144859],"genre_scores_gemma":[0.48316723,0.00004790532,0.5161176,0.0005551333,0.00008728511,0.0000026880812,0.0000015179735,0.000011841231,0.000008847287],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996625,0.000305744,0.0007322456,0.0008698813,0.00087834254,0.00058879895],"domain_scores_gemma":[0.9972279,0.0011088717,0.00037383422,0.001099061,0.000109240245,0.000081078746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037412827,0.00042527902,0.0007347812,0.00073594047,0.00010651795,0.00019727451,0.0027992302,0.00030517587,0.000005628654],"category_scores_gemma":[0.00013164278,0.000306247,0.000103270955,0.00073773856,0.0009841776,0.00068019563,0.0010988928,0.001027717,6.1266593e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006132131,0.00019027358,0.011413143,0.00061858044,0.000028221288,0.00033259278,0.02162169,0.002046749,0.0039909263,0.03330981,0.000023595365,0.9263631],"study_design_scores_gemma":[0.0014111866,0.0003213837,0.04883978,0.00071094494,0.000021486941,0.00023322349,0.0000025899453,0.12523828,0.01395129,0.8079262,0.00031095755,0.0010326803],"about_ca_topic_score_codex":0.000077899254,"about_ca_topic_score_gemma":0.00011522687,"teacher_disagreement_score":0.9253304,"about_ca_system_score_codex":0.000107908716,"about_ca_system_score_gemma":0.00018762781,"threshold_uncertainty_score":0.99993896},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000104045275,0.00006228597,0.99488026,0.0011699441,0.0016165054,0.0009805835,0.0000073196934,0.00028053072,0.0009921597],"genre_scores_gemma":[0.057090495,0.000035029767,0.9360958,0.0049879905,0.0009771385,0.00020764119,0.00003722953,0.00003136351,0.00053735916],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970195,0.000046375284,0.0005141024,0.001052577,0.00092616613,0.00044123977],"domain_scores_gemma":[0.99768424,0.0008683657,0.00023044476,0.0006756543,0.00035616168,0.00018511977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080954,0.00034578206,0.00039618553,0.0006604888,0.0002593406,0.0004454979,0.0014174593,0.00040058498,0.00009976021],"category_scores_gemma":[0.00025179604,0.00031791764,0.00017386478,0.00028612162,0.00060721545,0.00076494983,0.00044249496,0.000735318,0.000047432495],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013489415,0.000017297947,0.0000021219566,0.000031683,0.000013266721,0.0000059237673,0.00014719817,0.0014115857,0.0008445683,0.006036964,0.00029596238,0.99117994],"study_design_scores_gemma":[0.0009382009,0.0003441102,0.00007376087,0.00013380812,0.000010973962,0.00006686928,9.638598e-8,0.44207573,0.02650388,0.52722543,0.0021006798,0.00052645657],"about_ca_topic_score_codex":0.00001614504,"about_ca_topic_score_gemma":0.0000140554685,"teacher_disagreement_score":0.99065346,"about_ca_system_score_codex":0.00024511965,"about_ca_system_score_gemma":0.00029602266,"threshold_uncertainty_score":0.9999273},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005101371,0.0020741655,0.99037826,0.0016343056,0.0024099678,0.00032052025,0.0000016995815,0.00041973632,0.0022511908],"genre_scores_gemma":[0.59273344,0.000010140726,0.4046388,0.0020806324,0.0002976859,0.0000048592165,0.0000040132945,0.00002572159,0.00020468762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960293,0.000026667934,0.00049057836,0.0015759713,0.0010283205,0.00084913196],"domain_scores_gemma":[0.9973744,0.0004309986,0.0002633267,0.0016276679,0.00016383895,0.00013972973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063361996,0.0005992759,0.0006185296,0.0009850775,0.00025353447,0.0006039984,0.0039489176,0.0003240077,0.000025044232],"category_scores_gemma":[0.00015653571,0.0005180483,0.00019636303,0.00069541915,0.00071980356,0.0004997598,0.0010800373,0.0009686602,0.000090099624],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008281778,0.00006401137,0.00017829372,0.00026416106,0.000031752163,0.0013566447,0.0028026171,0.029986793,0.0012662573,0.05228305,0.000032633474,0.9117255],"study_design_scores_gemma":[0.0009469471,0.0001689452,0.0007042081,0.0019308892,0.000016130789,0.00018830488,0.0000017971701,0.84062624,0.010497329,0.14260341,0.0005888115,0.0017269794],"about_ca_topic_score_codex":0.00006680187,"about_ca_topic_score_gemma":0.00010458187,"teacher_disagreement_score":0.90999854,"about_ca_system_score_codex":0.00038154205,"about_ca_system_score_gemma":0.00095060567,"threshold_uncertainty_score":0.99972713},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016803653,0.0000572545,0.99702626,0.0011874295,0.00015973223,0.0006326228,0.0000063415923,0.000120585166,0.0007929773],"genre_scores_gemma":[0.0065267864,0.000011888003,0.989166,0.0041141086,0.00008945276,0.000025112939,0.000009660041,0.000018362563,0.000038585356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713916,0.0001020981,0.00036158768,0.0011062085,0.0009792533,0.00031167248],"domain_scores_gemma":[0.9977801,0.0011210657,0.00024085124,0.00060155906,0.0001261048,0.00013034618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001659766,0.00034709458,0.00027372493,0.00045877107,0.00032949122,0.0007675135,0.0010199441,0.00016241129,0.000020979605],"category_scores_gemma":[0.0001869679,0.00025883238,0.000045313176,0.000322169,0.00079042796,0.0004527911,0.00051685044,0.0005469382,0.0000023875532],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008849511,0.000051666368,0.000016611823,0.000086754604,0.000010846063,0.000035259975,0.001741187,0.010130374,0.0023746034,0.048477996,0.000012871786,0.93705297],"study_design_scores_gemma":[0.00035905428,0.00010910722,0.00014088259,0.00019548673,0.000007853322,0.00003174435,8.8541805e-7,0.9100186,0.007306259,0.081499696,0.00001682283,0.000313579],"about_ca_topic_score_codex":0.000028061135,"about_ca_topic_score_gemma":0.0000058304963,"teacher_disagreement_score":0.9367394,"about_ca_system_score_codex":0.00023791619,"about_ca_system_score_gemma":0.00030442647,"threshold_uncertainty_score":0.9999864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002872014,0.000079087506,0.9946459,0.0020768682,0.00065798935,0.00069295435,0.000019563427,0.00015426359,0.0013861705],"genre_scores_gemma":[0.01445569,0.0000071139193,0.98230076,0.0026084061,0.00035384003,0.000065938635,0.000015908705,0.000030583404,0.00016177114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953972,0.000023449895,0.0006761465,0.002128069,0.0010094655,0.00076564634],"domain_scores_gemma":[0.99704117,0.00039939996,0.00019267514,0.001768501,0.00022984864,0.00036840487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001846983,0.000452602,0.00045976508,0.0013869453,0.00024841478,0.00037334824,0.0032857182,0.0002204738,0.000006572741],"category_scores_gemma":[0.000096146505,0.000468458,0.00006856066,0.002103293,0.00018407096,0.0004358582,0.001985888,0.0005707189,0.00012012513],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018239172,0.00002678886,0.000016026204,0.0000064103097,0.000002497579,0.000018539964,0.000570706,0.011471049,0.00045623098,0.008857727,0.00004666646,0.9785255],"study_design_scores_gemma":[0.00019124016,0.000095308606,0.00060756877,0.00039476,0.0000041673256,0.000037315327,8.100392e-7,0.9651362,0.001552011,0.016626537,0.014547062,0.0008070775],"about_ca_topic_score_codex":0.00010511331,"about_ca_topic_score_gemma":0.00017548504,"teacher_disagreement_score":0.9777185,"about_ca_system_score_codex":0.00047382578,"about_ca_system_score_gemma":0.00043462325,"threshold_uncertainty_score":0.9997767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007816464,0.00096918095,0.9936322,0.0009492058,0.0008606595,0.00079613255,0.0000055630953,0.00014331107,0.0026359102],"genre_scores_gemma":[0.3002456,0.000020559677,0.6982625,0.0010028671,0.00034013452,0.000023349374,0.000022488503,0.000026858535,0.00005561529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596673,0.00019794318,0.00078030815,0.0013337543,0.0011904219,0.00053084193],"domain_scores_gemma":[0.99659044,0.0012405246,0.0006044775,0.00094918185,0.00045012948,0.00016523115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011535095,0.0005505674,0.0006409383,0.00085921143,0.00029694923,0.00022895585,0.0014485458,0.00048402377,0.000008409082],"category_scores_gemma":[0.00011687892,0.0005044332,0.0001414596,0.0005995488,0.0005670614,0.00057841773,0.0002711968,0.00060330133,0.0000040276304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009317192,0.000040867428,0.000041465173,0.000018418454,0.00000784879,0.000010985089,0.000033526438,0.9574726,0.0000110821675,0.0066727386,0.000014663517,0.035582624],"study_design_scores_gemma":[0.0011757547,0.00034017843,0.0003758867,0.00030115095,0.0000150145825,0.000016718895,5.6417946e-8,0.9759939,0.000007152202,0.021295901,0.000012721876,0.00046562075],"about_ca_topic_score_codex":0.000012553948,"about_ca_topic_score_gemma":0.0000026552289,"teacher_disagreement_score":0.3002378,"about_ca_system_score_codex":0.000410477,"about_ca_system_score_gemma":0.0006720548,"threshold_uncertainty_score":0.9997407},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097518265,0.00003307546,0.8979446,0.00052899943,0.0008687998,0.002188844,0.000004874159,0.0001122068,0.0008003297],"genre_scores_gemma":[0.9212542,0.0000010406906,0.077559985,0.00088166434,0.00014836447,0.00004765418,0.0000021107815,0.00004061909,0.000064344014],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580055,0.00019816747,0.0007261011,0.0015194344,0.0010973142,0.0006584021],"domain_scores_gemma":[0.99548405,0.0010620988,0.00044921355,0.0025726405,0.00031478854,0.000117207615],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.003370862,0.00046800863,0.0005310873,0.0008497554,0.00032546092,0.0010888639,0.0100800395,0.00025381276,0.000019977768],"category_scores_gemma":[0.00039231667,0.0003612168,0.00006464685,0.0014401858,0.0006213597,0.0012133084,0.0036864032,0.0015714155,0.000014296812],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015035333,0.001922498,0.010770171,0.000055626133,0.000055685818,0.00017729288,0.17536329,0.07297005,0.0036295822,0.09281769,0.000021393751,0.64206636],"study_design_scores_gemma":[0.0029634717,0.0047271093,0.013461814,0.0023662408,0.00003308822,0.0000916269,0.00031603596,0.46659353,0.016267616,0.48589587,0.0031477967,0.0041357935],"about_ca_topic_score_codex":0.00014308152,"about_ca_topic_score_gemma":0.0014248062,"teacher_disagreement_score":0.82373595,"about_ca_system_score_codex":0.00024334838,"about_ca_system_score_gemma":0.0010667712,"threshold_uncertainty_score":0.9999481},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000816924,0.00020332633,0.99611616,0.00019871879,0.001441184,0.0009483304,0.000010701695,0.000090315196,0.00017436323],"genre_scores_gemma":[0.24402319,0.0000011213564,0.75526065,0.00019318564,0.00044720244,0.000021252616,0.00001780464,0.00002341225,0.0000121660005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967154,0.00006811717,0.00060834544,0.0013481978,0.0005922216,0.00066769344],"domain_scores_gemma":[0.9974863,0.00065205584,0.00042537667,0.0012399991,0.000092553724,0.00010374974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022705868,0.00048069697,0.000476805,0.0004931935,0.0005661663,0.00076236704,0.0022525324,0.00034715232,0.0000026572004],"category_scores_gemma":[0.00010484482,0.00038657468,0.00014564628,0.00044105796,0.00040223592,0.00031703056,0.00059346075,0.0009737119,0.0000043112595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003834708,0.00002445398,0.00002401943,0.00004851166,0.000005132038,0.00008366482,0.0003675683,0.95732355,0.00010443631,0.0025963252,0.0000014989889,0.03941699],"study_design_scores_gemma":[0.00032579812,0.000057463447,0.000010573905,0.0003366958,0.000009374476,0.00045199846,4.9269437e-7,0.9924069,0.00026941198,0.0054267915,0.00026062885,0.00044387995],"about_ca_topic_score_codex":0.00009248715,"about_ca_topic_score_gemma":0.000022675837,"teacher_disagreement_score":0.24320626,"about_ca_system_score_codex":0.00034118118,"about_ca_system_score_gemma":0.0004538482,"threshold_uncertainty_score":0.9998586},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000119241515,0.00033960605,0.99062467,0.0004722086,0.004879584,0.0007845234,0.0000060667144,0.00046412853,0.002309973],"genre_scores_gemma":[0.093648754,0.00001846136,0.89940226,0.0037009784,0.0025176054,0.000021630327,0.000020836054,0.00012410853,0.000545345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929918,0.000057675265,0.0009775365,0.0025558067,0.0014376203,0.0019795385],"domain_scores_gemma":[0.99422747,0.002185878,0.000648178,0.0020968947,0.0004970527,0.00034450862],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022949215,0.0009342818,0.000903837,0.0008652069,0.0006547283,0.0007387613,0.004392765,0.00072785007,0.00001028122],"category_scores_gemma":[0.00010210198,0.00092352845,0.00036317142,0.0012101856,0.00075933884,0.00034732983,0.0010571477,0.0011119645,0.0000271778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011774508,0.000022435985,0.000033067576,0.000028980412,0.000010286934,0.00007577735,0.00009045969,0.6997235,0.000032883923,0.025710043,0.000039758634,0.27422106],"study_design_scores_gemma":[0.00049508514,0.00016621733,0.00002447852,0.00067473424,0.000013979179,0.00003101062,1.2011503e-7,0.9847863,0.0010182894,0.008400052,0.0033520493,0.0010376837],"about_ca_topic_score_codex":0.000017500519,"about_ca_topic_score_gemma":0.00012573769,"teacher_disagreement_score":0.28506285,"about_ca_system_score_codex":0.0005708394,"about_ca_system_score_gemma":0.0006250745,"threshold_uncertainty_score":0.9993215},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010067836,0.000095894546,0.9938974,0.0007721228,0.00050659274,0.0009185397,0.000007765357,0.00013162396,0.0036599964],"genre_scores_gemma":[0.01972407,0.00002529731,0.97734565,0.0026222302,0.0000756366,0.00008971644,0.000037330057,0.000017193212,0.00006289766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979365,0.000010730801,0.000358482,0.0007374678,0.00057174446,0.00038506315],"domain_scores_gemma":[0.9983273,0.0001707814,0.00029938953,0.0008593961,0.00025343162,0.00008968593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004168395,0.00032477683,0.0002732742,0.00050296786,0.00025981417,0.00037343407,0.0014078971,0.00020377545,0.0000024248543],"category_scores_gemma":[0.000020533505,0.00025640783,0.00006706064,0.0004812981,0.00023804109,0.0011456215,0.00023276846,0.00030410071,0.000020233998],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011650678,0.000019161947,0.000013260551,0.000046049772,0.0000081666285,0.000003147942,0.00031657596,0.0330257,0.000011134942,0.031830236,0.000033698838,0.93468124],"study_design_scores_gemma":[0.00030738916,0.00024835064,0.000110698275,0.00007284033,0.0000060121565,0.000055161832,1.2469489e-7,0.88228077,0.000027802136,0.1055195,0.010989526,0.00038182238],"about_ca_topic_score_codex":0.00000537599,"about_ca_topic_score_gemma":0.00001741007,"teacher_disagreement_score":0.9342994,"about_ca_system_score_codex":0.00026406583,"about_ca_system_score_gemma":0.0002906729,"threshold_uncertainty_score":0.9999888},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009885425,0.00031207342,0.9833599,0.0003877072,0.0007208542,0.0003801016,0.000007921979,0.0005194514,0.01430211],"genre_scores_gemma":[0.13911283,0.00003904984,0.85680556,0.0029489216,0.00048082313,0.00001165267,0.000008733541,0.00005828896,0.00053414115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955726,0.00003090858,0.00052634877,0.0018266244,0.0012144896,0.0008289958],"domain_scores_gemma":[0.9971261,0.0004253963,0.0003056183,0.0017906066,0.00019502455,0.00015725316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060771225,0.0006585371,0.00054780766,0.0009940157,0.00028010734,0.0005093396,0.0032251945,0.00027936883,0.00001205394],"category_scores_gemma":[0.00008159967,0.00059770816,0.0002090988,0.0009947994,0.0006978544,0.00073627994,0.00048728613,0.0010450392,0.000024051647],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023413528,0.00006269339,0.00009431649,0.00007860846,0.000007901047,0.00073567004,0.0001423837,0.16492891,0.000549536,0.07204639,0.0002344756,0.7610957],"study_design_scores_gemma":[0.00025072324,0.00040592987,0.00008772953,0.0007348871,0.000005729821,0.000034227527,3.9293596e-8,0.5208559,0.026929319,0.44645944,0.003192461,0.0010436104],"about_ca_topic_score_codex":0.00002188664,"about_ca_topic_score_gemma":0.000031571133,"teacher_disagreement_score":0.7600521,"about_ca_system_score_codex":0.00076839095,"about_ca_system_score_gemma":0.0006320546,"threshold_uncertainty_score":0.99964744},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001437409,0.00021398046,0.9939705,0.0002151677,0.0005769292,0.0005920057,0.0000018700058,0.0003534701,0.0026386317],"genre_scores_gemma":[0.05875646,0.000102896156,0.93924797,0.00078925455,0.00051952054,0.0000073264714,0.0000020987493,0.00007165954,0.00050284294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948682,0.00004423605,0.0007316621,0.001988154,0.0014534302,0.00091432687],"domain_scores_gemma":[0.9971643,0.0001642503,0.00046866864,0.0015386785,0.00043937544,0.00022473343],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011052733,0.00071120803,0.0006715125,0.0011890138,0.00069260417,0.0010890996,0.0035081299,0.00019000145,0.000022559361],"category_scores_gemma":[0.00006192442,0.00065762183,0.00012797967,0.001223039,0.0006829776,0.0026812726,0.00181277,0.0010237601,0.000057373967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065382183,0.00008816609,0.00010500802,0.000046703582,0.0000074098425,0.00010410368,0.0013882832,0.013098457,0.0010762559,0.00037886578,0.000007931626,0.9836923],"study_design_scores_gemma":[0.00035046434,0.00018947064,0.00019557735,0.0005811548,0.000011493008,0.00010787752,5.78679e-7,0.9918419,0.00052439014,0.0049016243,0.0004946874,0.0008007591],"about_ca_topic_score_codex":0.000018187235,"about_ca_topic_score_gemma":0.000009882397,"teacher_disagreement_score":0.9828915,"about_ca_system_score_codex":0.00039642703,"about_ca_system_score_gemma":0.0007378129,"threshold_uncertainty_score":0.99994785},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010164866,0.0004593853,0.9950266,0.00006088888,0.0012712115,0.0006306071,0.000007714142,0.00018624206,0.0022557105],"genre_scores_gemma":[0.22364567,0.00007856768,0.7726257,0.0009819478,0.0018813293,0.000041746367,0.000019443665,0.00020328957,0.0005223128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984275,0.000003830976,0.00031296015,0.0004560802,0.00035871108,0.00044091573],"domain_scores_gemma":[0.9988606,0.00039355826,0.00006714503,0.00045701445,0.00016399992,0.000057674846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057206815,0.0003192214,0.00025536455,0.00023500081,0.00021431108,0.00021933306,0.00067712687,0.00023796727,0.000008193996],"category_scores_gemma":[0.00005342719,0.00024426432,0.00007138406,0.0002441948,0.00021068676,0.00018061814,0.00012494833,0.0004445507,0.00000777678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019952354,9.925726e-7,0.00001376082,0.00004360012,0.000008334637,0.0000037399107,0.0003352704,0.95823467,0.00018561707,0.00076905,0.000028822455,0.040374126],"study_design_scores_gemma":[0.00014873454,0.000027585433,0.00001546396,0.00018063172,0.000011815393,0.0000133779495,2.8151072e-7,0.99118394,0.0022669085,0.0031252822,0.0026898638,0.00033610614],"about_ca_topic_score_codex":0.000012755373,"about_ca_topic_score_gemma":0.000111618036,"teacher_disagreement_score":0.22354403,"about_ca_system_score_codex":0.0005483797,"about_ca_system_score_gemma":0.00021021834,"threshold_uncertainty_score":0.996081},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000022057934,0.0000801748,0.99401814,0.0023789222,0.00083592784,0.001001418,0.000009464395,0.00036845187,0.001305297],"genre_scores_gemma":[0.0015127133,0.000037661717,0.9948029,0.0029245587,0.00031702974,0.00006629384,0.000022482945,0.00003188522,0.00028447702],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964877,0.000030371402,0.00056121004,0.0013552621,0.0009990078,0.0005664788],"domain_scores_gemma":[0.99763715,0.00053529517,0.00027019458,0.0010355982,0.00028401212,0.00023775386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078066933,0.00041174694,0.00039655573,0.0007555014,0.00026168273,0.00052180944,0.0025216222,0.0002700619,0.00004272067],"category_scores_gemma":[0.00020053073,0.0003867643,0.0001558799,0.0004344785,0.0009780333,0.0008557857,0.00069260277,0.00062768126,0.000029782066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055886153,0.000040123123,0.0000014110514,0.00006615505,0.000008795738,0.000058905705,0.00061258447,0.0007190134,0.0020744517,0.12743779,0.0001919265,0.8687833],"study_design_scores_gemma":[0.0005005406,0.00026325436,0.0000095696,0.0003388561,0.000008903977,0.000052064363,1.6969166e-7,0.071960114,0.03446113,0.89160717,0.00026627118,0.00053197925],"about_ca_topic_score_codex":0.000011274873,"about_ca_topic_score_gemma":0.000013182369,"teacher_disagreement_score":0.86825126,"about_ca_system_score_codex":0.00054081634,"about_ca_system_score_gemma":0.0008052796,"threshold_uncertainty_score":0.99985844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15330476,0.000160158,0.8457695,0.00015784567,0.00023043927,0.00022770892,4.6622216e-7,0.00014740495,0.0000017004605],"genre_scores_gemma":[0.5600624,0.000016997645,0.43885383,0.0010147628,0.000041162893,0.0000050749627,7.4745566e-7,0.0000048544507,1.7063567e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979952,0.00010015816,0.0002962525,0.00067188893,0.0005719882,0.00036451058],"domain_scores_gemma":[0.99907583,0.00028900645,0.00010646276,0.00033186362,0.00007573782,0.000121083525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005577973,0.00018199313,0.00018864872,0.0005191918,0.00023651315,0.0001969765,0.0005123815,0.00010335555,0.0000040516816],"category_scores_gemma":[0.00016221394,0.00016510714,0.000022795968,0.0016591828,0.0005923983,0.001257055,0.00018949893,0.0003670102,0.0000015157209],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000887326,0.00009256339,0.0007231218,0.000011420439,0.0000015162942,0.00008964918,0.0025426438,0.014013729,0.099679425,0.000005424341,0.000005688708,0.882826],"study_design_scores_gemma":[0.0006539432,0.00012948811,0.0043614036,0.000041514293,0.0000015240856,0.00052930746,0.0000029601952,0.50896347,0.48395807,0.0011663182,0.000003736503,0.0001882427],"about_ca_topic_score_codex":0.00019211702,"about_ca_topic_score_gemma":0.000094604184,"teacher_disagreement_score":0.8826377,"about_ca_system_score_codex":0.00022648255,"about_ca_system_score_gemma":0.00013415443,"threshold_uncertainty_score":0.67328733},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010969582,0.00030906583,0.9927316,0.00023853428,0.004374561,0.0008728267,0.0000050237145,0.0002878655,0.0011695814],"genre_scores_gemma":[0.00040490305,0.000015915957,0.99747723,0.00039156273,0.00033516414,0.000059407397,0.000007714227,0.000055819884,0.0012523016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960976,0.0000625641,0.0005875425,0.0018099104,0.00063504407,0.0008073376],"domain_scores_gemma":[0.9952693,0.0014140304,0.0004676472,0.0021929494,0.0003814409,0.00027461982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025894546,0.0005763964,0.0005579547,0.0008500285,0.0007108821,0.0007728697,0.0034461292,0.00047818874,0.000024977846],"category_scores_gemma":[0.00062811736,0.00048665705,0.000120656514,0.00085191237,0.0004991295,0.001377294,0.0010874104,0.0012850655,0.000016303922],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014267048,0.0000186658,0.0000074314307,0.00005842715,0.000015038328,0.0000034453938,0.0005111364,0.022562545,0.013939969,0.034176532,0.0000097704315,0.92868274],"study_design_scores_gemma":[0.00030746448,0.0002727778,0.000033703793,0.0007005532,0.000022329341,0.00008197485,3.7507624e-7,0.77708733,0.0079070255,0.20655939,0.006315076,0.00071203045],"about_ca_topic_score_codex":0.000027197624,"about_ca_topic_score_gemma":0.000040110426,"teacher_disagreement_score":0.92797077,"about_ca_system_score_codex":0.0003335769,"about_ca_system_score_gemma":0.0012773109,"threshold_uncertainty_score":0.9997585},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000051388874,0.0015091877,0.99269855,0.0007533213,0.00045268142,0.00074788346,0.00003320928,0.0008811886,0.0029188674],"genre_scores_gemma":[0.065820865,0.0000054916018,0.93030244,0.0033873841,0.00031813115,0.000017830049,0.000050456485,0.000040642037,0.000056740908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99517286,0.00007703674,0.0006060479,0.0019679796,0.00141033,0.0007657479],"domain_scores_gemma":[0.9972901,0.0004232285,0.00018634643,0.0013847006,0.00038969057,0.0003259362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010569172,0.00069362926,0.0006479821,0.0008723013,0.00025546452,0.0008367236,0.003764326,0.00044397946,0.000014580413],"category_scores_gemma":[0.00023480684,0.00062377803,0.00012567916,0.0010382351,0.00033341302,0.000626929,0.00042386624,0.0012801103,0.000011511086],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015537365,0.000068914254,0.0000052087503,0.00006770702,0.0000049374025,0.000049302245,0.0010183743,0.009300861,0.00017681136,0.016696922,0.00004744577,0.972548],"study_design_scores_gemma":[0.00032731946,0.00023624655,0.00001163005,0.00032612515,0.000011766602,0.000021173233,1.1309238e-7,0.8925324,0.0016555538,0.10324451,0.00081646023,0.0008167104],"about_ca_topic_score_codex":0.000026502115,"about_ca_topic_score_gemma":0.000026529307,"teacher_disagreement_score":0.97173125,"about_ca_system_score_codex":0.00034119494,"about_ca_system_score_gemma":0.00056384475,"threshold_uncertainty_score":0.99962133},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001214039,0.0002387925,0.8023912,0.00048416777,0.011990582,0.0003335429,0.000003977216,0.00021757295,0.18312612],"genre_scores_gemma":[0.95663196,0.00007214819,0.022222571,0.0023306615,0.004790081,0.00009552101,0.00002465777,0.0001272786,0.013705136],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99702084,0.000049552407,0.0005436727,0.0012131074,0.0005930607,0.0005797723],"domain_scores_gemma":[0.9981746,0.00047353783,0.00033351107,0.00076358,0.00017108822,0.00008368631],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002597007,0.00046113145,0.00047729508,0.00051147543,0.00032616002,0.00026622068,0.0009011326,0.0003089805,0.0009901853],"category_scores_gemma":[0.000053945532,0.00046243623,0.00019347698,0.00030471408,0.0005986621,0.0007652129,0.00029592705,0.0012557565,0.00047744502],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000985308,0.00023964782,0.00065640744,0.00006347261,0.000109789944,0.0003473107,0.015335493,0.04047235,0.0012631423,0.057345547,0.00446936,0.879599],"study_design_scores_gemma":[0.0035649324,0.0018565934,0.020445136,0.0046230466,0.0002160222,0.00070571044,0.00012071037,0.013334044,0.011248709,0.38134155,0.55457515,0.007968419],"about_ca_topic_score_codex":0.0011181342,"about_ca_topic_score_gemma":0.0003732131,"teacher_disagreement_score":0.95541793,"about_ca_system_score_codex":0.0003788548,"about_ca_system_score_gemma":0.00008314977,"threshold_uncertainty_score":0.99992305},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068361737,0.00042701865,0.99556184,0.0008299193,0.0009790976,0.00056441635,0.000007291669,0.000121493395,0.0008252778],"genre_scores_gemma":[0.85494965,0.000054817647,0.14319326,0.0012906261,0.00031973326,0.000015757652,0.0000039190345,0.000013872646,0.000158361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976677,0.000018160099,0.00045612126,0.0009241936,0.0005004564,0.00043341372],"domain_scores_gemma":[0.99793303,0.00046737812,0.00033262226,0.00084785686,0.0003616628,0.000057424575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005534593,0.0003633702,0.0006005933,0.00044866712,0.00028279464,0.00010415237,0.0018910643,0.0004475018,0.000006206063],"category_scores_gemma":[0.00014356877,0.0003144525,0.00012710644,0.00029970543,0.00082627585,0.00029600863,0.00036489227,0.000462044,0.000005396957],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002377939,0.0000477053,0.0002983852,0.00009089416,0.000029590223,0.000010200823,0.0022247415,0.012109242,0.000044954963,0.13716786,0.00005240923,0.8479003],"study_design_scores_gemma":[0.00074129214,0.0008046887,0.0013938608,0.00029964017,0.000026436506,0.000029339622,3.6347427e-7,0.5305231,0.00030633662,0.46305016,0.002237128,0.0005876233],"about_ca_topic_score_codex":0.0000048112097,"about_ca_topic_score_gemma":0.000053824704,"teacher_disagreement_score":0.85426605,"about_ca_system_score_codex":0.0001043771,"about_ca_system_score_gemma":0.0002318228,"threshold_uncertainty_score":0.99993074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019578874,0.0007261899,0.98819697,0.0073935576,0.0016008925,0.0010714971,0.000013266285,0.00017159797,0.0008240623],"genre_scores_gemma":[0.0023351773,0.00015106608,0.99358314,0.002447611,0.0009817012,0.000029913384,0.000017569138,0.000035918638,0.0004178794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956445,0.00004467022,0.00058442884,0.0017599787,0.0011832808,0.0007831261],"domain_scores_gemma":[0.9949058,0.001859861,0.00038110733,0.0022921537,0.0003647457,0.00019629352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015002162,0.00058039854,0.00055797846,0.00035151714,0.00072812475,0.0009560958,0.0038032169,0.0003719168,0.000009664371],"category_scores_gemma":[0.00012103935,0.0003814543,0.00017803964,0.00043300097,0.0005946601,0.0009776907,0.0018411401,0.001060087,0.00002870205],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009844927,0.000045667184,0.00000238185,0.000016502916,0.0000072255207,0.00006114338,0.00012825438,0.00566241,0.000025163074,0.019941654,0.00057762983,0.9735221],"study_design_scores_gemma":[0.00027627,0.0003544027,0.00010217465,0.0003105052,0.000015897896,0.00020615889,1.4014856e-7,0.8381378,0.00022116616,0.13233094,0.027528247,0.00051627966],"about_ca_topic_score_codex":0.000029551924,"about_ca_topic_score_gemma":0.00004528861,"teacher_disagreement_score":0.97300583,"about_ca_system_score_codex":0.00019063611,"about_ca_system_score_gemma":0.0005215124,"threshold_uncertainty_score":0.99986374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024415203,0.00017049373,0.9966032,0.00022470942,0.0009140148,0.0008790215,0.000068103036,0.00017142134,0.0007249125],"genre_scores_gemma":[0.800207,0.000012326517,0.19904722,0.00032163502,0.00031811438,0.000032854343,0.000032076383,0.000022555621,0.0000061609417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961566,0.000036984184,0.0007275869,0.001618892,0.0009642323,0.00049570616],"domain_scores_gemma":[0.9959428,0.00044480356,0.00053170376,0.0024472766,0.00038170852,0.00025174159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000904662,0.00046568693,0.0005655505,0.0011087563,0.00014809698,0.00046684864,0.0042833188,0.0002750588,0.0000069490807],"category_scores_gemma":[0.00006857994,0.00043777557,0.00011901962,0.00085615506,0.00036342096,0.0013828467,0.00088853826,0.00062511675,0.000029233497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002650271,0.00020772869,0.000026218004,0.00010605835,0.000017406483,0.000018007562,0.0017974238,0.060436156,0.00054281723,0.1946137,0.000019870919,0.7421881],"study_design_scores_gemma":[0.00018062785,0.0003359129,0.0006222217,0.0003519396,0.0000073432598,0.000025750945,6.2062406e-7,0.93529683,0.0014185086,0.059216917,0.0020122558,0.00053109514],"about_ca_topic_score_codex":0.00011538942,"about_ca_topic_score_gemma":0.000115135976,"teacher_disagreement_score":0.87486064,"about_ca_system_score_codex":0.00017013916,"about_ca_system_score_gemma":0.0003158278,"threshold_uncertainty_score":0.9998074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001012821,0.00014889993,0.99726087,0.00019123482,0.0005691354,0.0009904408,0.00008316621,0.000137074,0.0005179226],"genre_scores_gemma":[0.012872086,0.000016137,0.98639613,0.00027691902,0.00017580965,0.000022814189,0.000040350973,0.000044670756,0.00015509587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618345,0.00007622888,0.00066778855,0.0013215509,0.0010739036,0.0006770493],"domain_scores_gemma":[0.99630666,0.0012173065,0.0004828417,0.0012554262,0.0005596348,0.00017812614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011084612,0.0004848411,0.00070131134,0.00090889365,0.00030914336,0.00024810093,0.00263854,0.000322064,0.000019217483],"category_scores_gemma":[0.00009711346,0.00046025537,0.00021981337,0.0006705005,0.0013644755,0.0005507118,0.00043989712,0.00054677716,0.00003197336],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022669523,0.000031693846,0.000007606803,0.00008988168,0.000020857477,0.000006908276,0.0002900593,0.0054258835,0.0018826649,0.093591906,0.000014379929,0.8986155],"study_design_scores_gemma":[0.00034102707,0.00027050587,0.000010309561,0.00018681672,0.000004740125,0.000022987213,4.5096186e-8,0.60081774,0.004370524,0.39336386,0.0002824503,0.00032900914],"about_ca_topic_score_codex":0.000004746623,"about_ca_topic_score_gemma":0.000004605032,"teacher_disagreement_score":0.89828646,"about_ca_system_score_codex":0.00015746464,"about_ca_system_score_gemma":0.0003835277,"threshold_uncertainty_score":0.99978495},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000106282125,0.0026482942,0.9857813,0.0002760422,0.0006534122,0.00040686707,5.680637e-7,0.00016683181,0.009960368],"genre_scores_gemma":[0.94938684,0.00021494133,0.049409106,0.00033904906,0.00025667643,0.000012136592,0.0000025191423,0.0000225912,0.0003561309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972778,0.000029422867,0.00037789735,0.0012171466,0.0004854632,0.0006122741],"domain_scores_gemma":[0.9987015,0.00015745191,0.00016951577,0.00069326576,0.000087436005,0.00019082945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068551686,0.00038458573,0.0004671596,0.00042787552,0.00047122422,0.00090231973,0.001190141,0.00022637204,0.0000066911116],"category_scores_gemma":[0.000020043422,0.00033578163,0.000051765826,0.00029916284,0.00082449743,0.00045762587,0.0010374496,0.00051157974,0.000018899667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026540054,0.000025798656,0.00064206397,0.000105590756,0.000015621714,0.000046897378,0.0023413666,0.0045765205,0.000025944139,0.32057196,0.00001900761,0.67162657],"study_design_scores_gemma":[0.00030606924,0.0001687579,0.00025692213,0.00014064851,0.000010123121,0.0003035622,3.0304162e-7,0.49563137,0.000029928202,0.49086517,0.01163182,0.0006553143],"about_ca_topic_score_codex":0.00008927605,"about_ca_topic_score_gemma":0.00014764538,"teacher_disagreement_score":0.94928056,"about_ca_system_score_codex":0.000088148605,"about_ca_system_score_gemma":0.00015819039,"threshold_uncertainty_score":0.9999094},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010025979,0.00037836135,0.99276096,0.0007252121,0.0019314408,0.00081177114,0.000009273664,0.00020001433,0.0031729322],"genre_scores_gemma":[0.0006934068,0.00008289424,0.9954931,0.0013374083,0.00059620076,0.000014224769,0.0000025104555,0.00007084752,0.0017094014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992814,0.00009378877,0.00086141744,0.0025122538,0.0024504685,0.0012680542],"domain_scores_gemma":[0.99537057,0.00051056367,0.0002873224,0.0025169372,0.0006790526,0.0006355555],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010894967,0.0007501487,0.0007921592,0.002067519,0.00039267816,0.0013289598,0.0060957647,0.00039160176,0.0002534532],"category_scores_gemma":[0.00035099467,0.0007342926,0.00015503602,0.0018994663,0.0005887554,0.0005554302,0.0031848163,0.0010237751,0.00033098905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021237151,0.000024199831,0.000005070081,0.00001700116,0.000010387566,0.000177605,0.00025659174,0.6024654,0.000034264092,0.0011930325,0.00004381068,0.39577052],"study_design_scores_gemma":[0.00026665593,0.00013903102,0.000030927284,0.00018895084,0.000008901411,0.00016513905,6.853014e-8,0.9865824,0.00040078547,0.0101582855,0.0012625661,0.0007962626],"about_ca_topic_score_codex":0.000032515563,"about_ca_topic_score_gemma":0.0000050390554,"teacher_disagreement_score":0.39497426,"about_ca_system_score_codex":0.0006251274,"about_ca_system_score_gemma":0.0007089811,"threshold_uncertainty_score":0.99970776},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001737777,0.00019816343,0.9894569,0.0064789876,0.001380244,0.00045828221,0.000004852113,0.00014322388,0.0017055647],"genre_scores_gemma":[0.12587336,0.000011031264,0.8688386,0.0020292208,0.0011369942,0.000015966878,0.000015750667,0.000043712113,0.0020353799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966579,0.00007110742,0.0002807744,0.0014899719,0.0009689979,0.0005312233],"domain_scores_gemma":[0.9976265,0.00030709637,0.0002553639,0.0015197902,0.0001318695,0.00015941306],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011786243,0.0004561987,0.00031676877,0.00058604457,0.00071291,0.0011485431,0.0035246497,0.00045950836,0.000010387586],"category_scores_gemma":[0.00016782142,0.00032276477,0.00009258195,0.00074503396,0.0003057129,0.00042942056,0.0011289029,0.0022651628,0.00003233279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009972521,0.000028991537,0.0001628724,0.000027693535,0.000014335047,0.000012244584,0.0013280698,0.0886968,0.0034998797,0.037477717,0.00009309859,0.86864835],"study_design_scores_gemma":[0.00023633408,0.00017768868,0.0046403753,0.00023148979,0.000025801346,0.00047240683,6.8927034e-7,0.92082566,0.0054247277,0.05308654,0.013728115,0.0011501828],"about_ca_topic_score_codex":0.00006750059,"about_ca_topic_score_gemma":0.00040233426,"teacher_disagreement_score":0.86749816,"about_ca_system_score_codex":0.0002142558,"about_ca_system_score_gemma":0.00042384877,"threshold_uncertainty_score":0.99992245},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018379773,0.0034684,0.9945179,0.00013644631,0.0010951958,0.00025031826,0.0000028276638,0.0002960824,0.00021441393],"genre_scores_gemma":[0.00088892574,0.00014793884,0.9980845,0.00038449973,0.00020163198,0.000009377216,0.0000025142986,0.00003040425,0.00025023834],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967248,0.000043693148,0.00063961785,0.0011918683,0.0008606909,0.0005393365],"domain_scores_gemma":[0.9968952,0.0011407419,0.00034239618,0.0012276426,0.00028042428,0.00011359514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009515973,0.00052417244,0.0006969652,0.00065966113,0.00012622937,0.000108032786,0.00305783,0.00026508662,0.000014855623],"category_scores_gemma":[0.00046962633,0.00048198778,0.00011014614,0.0005243176,0.00046416276,0.0005026229,0.0016324517,0.0005997529,0.000018674695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012196427,0.00000939875,0.000008472632,0.00005216478,0.000009389283,0.00001688348,0.00060007843,0.24891713,0.000059545087,0.0062714196,0.0000043149385,0.74404997],"study_design_scores_gemma":[0.0009306726,0.0004884303,0.00090032,0.003338341,0.000026814318,0.00018950325,4.321362e-7,0.1326655,0.079517215,0.7581882,0.01966239,0.004092183],"about_ca_topic_score_codex":0.000002094443,"about_ca_topic_score_gemma":0.000015511338,"teacher_disagreement_score":0.75191677,"about_ca_system_score_codex":0.00039867207,"about_ca_system_score_gemma":0.0007654316,"threshold_uncertainty_score":0.9997632},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002623996,0.00027597096,0.97861683,0.0009870613,0.002149108,0.00036851983,0.0000023929188,0.00031006685,0.01726382],"genre_scores_gemma":[0.29011995,0.00008759024,0.706728,0.0022453298,0.00025267995,0.000011501186,0.000006688642,0.000042520864,0.0005057349],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965874,0.000029144689,0.00054896035,0.0013936814,0.0008753723,0.0005654745],"domain_scores_gemma":[0.99787366,0.00027675886,0.00028465246,0.0010980681,0.000249828,0.00021700223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004414938,0.00049105677,0.00045324533,0.00085798843,0.00035068943,0.0005598781,0.0017205667,0.00027285257,0.00012845737],"category_scores_gemma":[0.00018453196,0.00049958844,0.00014682837,0.00063684885,0.0008227654,0.00047583104,0.0006818289,0.00072019506,0.000114090806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002947712,0.000021494547,0.00003391661,0.000034481196,0.000009181683,0.00013255811,0.0004990025,0.14389755,0.000039973544,0.22584622,0.000006138561,0.62947655],"study_design_scores_gemma":[0.00053169084,0.00021843522,0.00021390492,0.0006374163,0.000016288821,0.0004407053,3.0359482e-7,0.4897167,0.0002335352,0.5046307,0.002311069,0.0010492497],"about_ca_topic_score_codex":0.000093143506,"about_ca_topic_score_gemma":0.00009749732,"teacher_disagreement_score":0.6284273,"about_ca_system_score_codex":0.0006663928,"about_ca_system_score_gemma":0.0016031537,"threshold_uncertainty_score":0.99974555},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020591664,0.0005518734,0.9964323,0.00047997813,0.0012647457,0.0001825018,0.00027197937,0.00015126973,0.00045941977],"genre_scores_gemma":[0.032269903,0.00007309635,0.9652814,0.0008052048,0.0010472286,0.00001949151,0.00024538214,0.000035641155,0.00022260463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967971,0.000019672892,0.00042358926,0.001372157,0.0008137798,0.0005737445],"domain_scores_gemma":[0.9975492,0.00032588353,0.000206908,0.0016057357,0.00009675897,0.00021554733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000418561,0.00042410428,0.0003735051,0.00039574617,0.00028645233,0.00040646343,0.0028673606,0.00015597265,0.00010081452],"category_scores_gemma":[0.000023709896,0.00040655202,0.00010084223,0.0002731362,0.00026538616,0.0011040271,0.0007435057,0.0005328071,0.000077284334],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010789313,0.000033666704,0.00018328846,0.000009994911,0.0000120720415,0.000020960882,0.00041536964,0.0008252141,0.000063111765,0.010383597,0.0000365005,0.9880152],"study_design_scores_gemma":[0.00051952817,0.0001093771,0.002157915,0.0009933959,0.000052487623,0.00013732501,9.977009e-7,0.88211364,0.0021311892,0.05993964,0.04976878,0.0020757506],"about_ca_topic_score_codex":0.00020305706,"about_ca_topic_score_gemma":0.0000949065,"teacher_disagreement_score":0.9859394,"about_ca_system_score_codex":0.00013659339,"about_ca_system_score_gemma":0.00023190895,"threshold_uncertainty_score":0.99983865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003938709,0.00041754704,0.99428535,0.00025650396,0.0001628827,0.0002537189,0.000007318612,0.000046643963,0.004176148],"genre_scores_gemma":[0.9566133,0.0000066069965,0.040632397,0.00014840053,0.0024364998,0.000008014288,0.000016866084,0.00003420176,0.00010373557],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975836,0.000050781255,0.00044642738,0.00055731565,0.0006974947,0.0006643778],"domain_scores_gemma":[0.9985097,0.00037354825,0.00033481163,0.0004866724,0.00018973956,0.00010550749],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011304144,0.00031451197,0.0005465409,0.00028883855,0.00017996949,0.000052935797,0.0011534336,0.00021173026,0.00022986077],"category_scores_gemma":[0.000011015529,0.00029980717,0.00022957094,0.00053982786,0.0008461224,0.00010651835,0.0004929525,0.0011853517,0.000010446448],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017071921,0.00003540275,0.0057517453,0.000037759874,0.0000594457,0.0000026421383,0.00033010737,0.026617698,0.00014725937,0.035839926,0.00034136223,0.9308196],"study_design_scores_gemma":[0.0003320702,0.000099916586,0.001143951,0.00067085744,0.00009357191,0.000001035039,4.6901428e-7,0.19320713,0.0016197674,0.7958607,0.0060720644,0.000898492],"about_ca_topic_score_codex":0.0000621188,"about_ca_topic_score_gemma":0.000017098591,"teacher_disagreement_score":0.95621943,"about_ca_system_score_codex":0.0001234695,"about_ca_system_score_gemma":0.00037979858,"threshold_uncertainty_score":0.9999454},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001949749,0.00009902344,0.9753855,0.001214927,0.00071591855,0.013555568,0.0000046879854,0.00023772402,0.00876718],"genre_scores_gemma":[0.28454423,0.00008500159,0.6788888,0.009513838,0.001853463,0.014259889,0.000012308605,0.00020304628,0.0106394505],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611735,0.000018561559,0.00059939234,0.0017224681,0.00079463853,0.0007476004],"domain_scores_gemma":[0.99794537,0.00016613536,0.0002531729,0.0011352734,0.00023928305,0.00026073967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076315086,0.00059569185,0.00060214894,0.00046789192,0.00028494498,0.00042272385,0.0020712595,0.00040429467,0.00008646426],"category_scores_gemma":[0.000018135232,0.0005287857,0.000114224116,0.00047896663,0.0005469543,0.0007164753,0.00018135011,0.00089097663,0.000044836215],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024023313,0.00003784905,0.000108712484,0.00007859314,0.000017432176,0.00016078667,0.00027636407,0.038948044,0.00003546521,0.089790635,0.00008034818,0.87044173],"study_design_scores_gemma":[0.0048517007,0.001018457,0.0010234837,0.0030722455,0.000049449216,0.000480273,3.0994298e-7,0.43228385,0.0015874604,0.433089,0.1190228,0.0035210068],"about_ca_topic_score_codex":0.00004568919,"about_ca_topic_score_gemma":0.00011929164,"teacher_disagreement_score":0.8669207,"about_ca_system_score_codex":0.00021295802,"about_ca_system_score_gemma":0.0010741488,"threshold_uncertainty_score":0.99971634},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008909492,0.00034773018,0.9946367,0.000494461,0.00057990034,0.00014709901,0.000008588201,0.000014163207,0.0028803684],"genre_scores_gemma":[0.94102764,0.0001981858,0.05604073,0.0006375583,0.0007216216,0.000008747563,0.00009239435,0.000039756203,0.0012333461],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99827325,0.000029959996,0.0002737406,0.00075260276,0.00042329045,0.00024712872],"domain_scores_gemma":[0.99897856,0.000023069555,0.00020557566,0.00056944956,0.00010719112,0.00011615239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002559911,0.00026096505,0.0002516463,0.00027442843,0.00009851607,0.00004197796,0.0006057415,0.0005396151,0.00004009852],"category_scores_gemma":[0.000049177735,0.00021539275,0.00010033744,0.00012499992,0.00056646246,0.00000605461,0.00020302627,0.00058432843,0.000002750036],"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.00004329579,0.00003317074,0.000017259856,0.000028077571,0.000011232808,0.0000052129326,0.000100376055,0.012086149,0.8452636,0.001023318,0.00013064864,0.14125764],"study_design_scores_gemma":[0.0007733146,0.0007040086,0.000085581836,0.00037863833,0.000018663643,0.000027810678,7.186259e-7,0.05889027,0.87228227,0.030761266,0.03530448,0.00077295717],"about_ca_topic_score_codex":0.0000050881167,"about_ca_topic_score_gemma":0.000008089921,"teacher_disagreement_score":0.94013673,"about_ca_system_score_codex":0.000025120295,"about_ca_system_score_gemma":0.00025675233,"threshold_uncertainty_score":0.87834615},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003856894,0.00036123683,0.997212,0.0009782608,0.0005876058,0.00032968912,0.0000050084677,0.00013016358,0.0003921902],"genre_scores_gemma":[0.0018354749,0.00008990492,0.9964556,0.00037618657,0.00026185645,0.000006173911,0.0000076201372,0.00002521931,0.0009419423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958289,0.000059247577,0.00053081167,0.0015792192,0.0013697997,0.0006320132],"domain_scores_gemma":[0.9972785,0.0004390577,0.00023386483,0.0010915269,0.00044081963,0.00051623094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009225891,0.00041455307,0.0005950903,0.0011143124,0.00026605302,0.0009441224,0.0021285545,0.00032243205,0.00019182185],"category_scores_gemma":[0.0002760624,0.00038556833,0.00012310183,0.0024938209,0.00027144904,0.00063411135,0.0013529975,0.0009003605,0.000038517803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016574531,0.000015392494,0.000010865712,0.000006222841,0.00003622623,0.000032689106,0.00018917702,0.5371015,0.000014976286,0.0031284252,0.000003991565,0.4594589],"study_design_scores_gemma":[0.00023221332,0.00007465418,0.000036160236,0.000023324294,0.00004474882,0.00003065997,4.9787534e-8,0.9908392,0.00093790726,0.007083177,0.000294818,0.00040310936],"about_ca_topic_score_codex":0.000030322968,"about_ca_topic_score_gemma":0.000012300177,"teacher_disagreement_score":0.45905578,"about_ca_system_score_codex":0.00012066321,"about_ca_system_score_gemma":0.00065836817,"threshold_uncertainty_score":0.99985963},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47633237,0.000015037619,0.52209115,0.00056862104,0.00072974275,0.00012517825,0.000007989055,0.00010388905,0.000026029198],"genre_scores_gemma":[0.96239877,0.0000074348914,0.034288242,0.0031027626,0.00017316952,0.0000069284542,0.000004949952,0.000012683585,0.0000050889435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971587,0.000109898014,0.00033567834,0.0010213957,0.0006814189,0.0006928875],"domain_scores_gemma":[0.9985944,0.00046433051,0.00011831048,0.0005628054,0.00008181946,0.00017833083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032882273,0.00027179383,0.00025969176,0.0003054764,0.0004444859,0.00019444968,0.0013299546,0.00009167004,0.000036916066],"category_scores_gemma":[0.0004195562,0.00022823637,0.00007868316,0.0019415427,0.0011916538,0.0006430586,0.0005242664,0.0003829798,0.00006905521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020162124,0.0011309747,0.16857664,0.00009957622,0.00001585212,0.0022799368,0.01619252,0.38406324,0.19942917,0.0005856111,0.0035034104,0.22392142],"study_design_scores_gemma":[0.00061621104,0.00021934966,0.010117521,0.000064184984,0.0000025781746,0.0003481404,0.000001248229,0.621863,0.36245745,0.002402283,0.001417385,0.000490645],"about_ca_topic_score_codex":0.00008414119,"about_ca_topic_score_gemma":0.000119285905,"teacher_disagreement_score":0.4878029,"about_ca_system_score_codex":0.00012498224,"about_ca_system_score_gemma":0.00023770725,"threshold_uncertainty_score":0.9307209},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003720216,0.00016775224,0.9923549,0.0014645818,0.0012251398,0.0005670665,0.000012175139,0.000161462,0.004043197],"genre_scores_gemma":[0.11437324,0.0000531508,0.88318557,0.001498382,0.00040358806,0.00001127796,0.000009408907,0.00002649492,0.00043891807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968757,0.000022681132,0.0004720071,0.0011970915,0.000846517,0.0005859937],"domain_scores_gemma":[0.9977166,0.0006918647,0.00016328628,0.0008011803,0.00042756574,0.00019950344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009445831,0.0003804391,0.00038906603,0.0012366923,0.00024968287,0.00048540556,0.0017039548,0.00031121718,0.00006946891],"category_scores_gemma":[0.00010607409,0.00037121467,0.00015062858,0.00075205317,0.000984098,0.00047834733,0.0005339281,0.000584537,0.00003685764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023141674,0.000009281574,0.000010480985,0.000012894822,0.0000051766037,0.000008060585,0.00013804235,0.1558108,0.000007883865,0.054461382,0.000016218512,0.78951746],"study_design_scores_gemma":[0.00032106234,0.000109624314,0.000033515204,0.000084531894,0.0000056234053,0.000069028094,2.8610975e-7,0.9689849,0.00037827043,0.025943805,0.0036343012,0.00043504857],"about_ca_topic_score_codex":0.000007846671,"about_ca_topic_score_gemma":0.00006823929,"teacher_disagreement_score":0.81317407,"about_ca_system_score_codex":0.00047609222,"about_ca_system_score_gemma":0.00095892185,"threshold_uncertainty_score":0.999874},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003001478,0.0006352949,0.9931433,0.0014459159,0.0014063484,0.0006717749,0.00004138145,0.00011989516,0.0025060712],"genre_scores_gemma":[0.06774536,0.0001440234,0.92697006,0.002470484,0.0017203406,0.00009585664,0.0002832621,0.000049235106,0.0005213593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961458,0.000050116854,0.00045846996,0.00157351,0.0012843511,0.0004877534],"domain_scores_gemma":[0.9968234,0.0004753076,0.00026642182,0.0017757465,0.0005404604,0.00011868888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022951765,0.00034902434,0.00032825983,0.000487663,0.00037030427,0.0006402599,0.0030397582,0.00028007218,0.000044447792],"category_scores_gemma":[0.00030020945,0.00031605913,0.0000828133,0.00026538473,0.00024479764,0.0013897856,0.0010454201,0.00037754042,0.000052945703],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000521719,0.000016595472,0.000006142328,0.00001713616,0.000007603658,0.0000027513142,0.00016420854,0.014369041,0.0002848864,0.0026519983,0.0006239013,0.9818505],"study_design_scores_gemma":[0.0003157845,0.0000642759,0.000028701335,0.00040534238,0.000019470315,0.0000148358895,2.1155286e-7,0.858064,0.0017680211,0.115668066,0.023240231,0.00041104524],"about_ca_topic_score_codex":0.000006469545,"about_ca_topic_score_gemma":0.0001789839,"teacher_disagreement_score":0.9814395,"about_ca_system_score_codex":0.00019998624,"about_ca_system_score_gemma":0.00064792397,"threshold_uncertainty_score":0.99992913},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000875612,0.00045889514,0.9946855,0.0011106763,0.0009024185,0.00063813344,0.000014265311,0.00011609012,0.0020653224],"genre_scores_gemma":[0.13049579,0.000018476387,0.8660691,0.0029327094,0.00022533025,0.000009020665,0.0000025794445,0.000021861913,0.00022517731],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693066,0.000020410362,0.0006390107,0.0012103593,0.00059691106,0.00060264504],"domain_scores_gemma":[0.9973727,0.00061459164,0.0004342931,0.0010452622,0.00036462885,0.00016851048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055303855,0.00045001414,0.0007078777,0.0006538845,0.00017834715,0.00020859845,0.0023809022,0.00018954214,0.000012244878],"category_scores_gemma":[0.00009745452,0.00039363126,0.00021371932,0.0003031418,0.0008090852,0.00047725977,0.00032962637,0.00046095406,0.000008311617],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006905757,0.00002151239,0.000004250209,0.000020055464,0.000007199337,0.000018315928,0.00021676384,0.004686801,0.00027981054,0.06647749,0.000009423979,0.92825145],"study_design_scores_gemma":[0.00070340885,0.00028878124,0.000024747218,0.00032019985,0.000008149502,0.000056769764,1.1184416e-7,0.733877,0.0019918275,0.25640252,0.005871273,0.00045518417],"about_ca_topic_score_codex":0.000006175097,"about_ca_topic_score_gemma":0.000006502624,"teacher_disagreement_score":0.9277963,"about_ca_system_score_codex":0.00018241059,"about_ca_system_score_gemma":0.00066522707,"threshold_uncertainty_score":0.9998516},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007866038,0.0002633694,0.99436164,0.0002072005,0.003295798,0.0009941978,0.000006727651,0.0003859806,0.00040641928],"genre_scores_gemma":[0.86572635,0.00007163542,0.13166946,0.0011167459,0.0007711009,0.000059774262,0.000025605485,0.00010154952,0.00045776475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923891,0.00014328929,0.001434124,0.0031760866,0.0011062257,0.0017511758],"domain_scores_gemma":[0.9956399,0.0007356265,0.0007096524,0.0022055793,0.00040577573,0.00030343106],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015356452,0.0011979355,0.001199136,0.0010968243,0.0003768902,0.0012196777,0.006189401,0.0009807387,0.000015067875],"category_scores_gemma":[0.00006952089,0.0011990621,0.00024484115,0.0014930929,0.00074864534,0.0011606248,0.003204361,0.002634774,0.0000309735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008041732,0.00013654042,0.00039740585,0.000041205356,0.00001658436,0.00032509485,0.0011632721,0.78247875,0.000014295511,0.004732228,0.00010089194,0.21058567],"study_design_scores_gemma":[0.0007901493,0.000114439266,0.0005145255,0.0012139077,0.000008197971,0.000058895333,7.203326e-7,0.9920793,0.00010501365,0.0038312727,0.000054769378,0.0012287801],"about_ca_topic_score_codex":0.0002867549,"about_ca_topic_score_gemma":0.0035322912,"teacher_disagreement_score":0.8656477,"about_ca_system_score_codex":0.0008628903,"about_ca_system_score_gemma":0.0006198096,"threshold_uncertainty_score":0.99981713},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021801976,0.000083491985,0.9932625,0.0014364007,0.00047362773,0.0029855275,0.000006244421,0.00030941144,0.0014209587],"genre_scores_gemma":[0.25743133,0.0000060826515,0.740175,0.0014082851,0.0002386797,0.0003993816,0.00001333112,0.000054696135,0.00027319134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955418,0.000041698248,0.00051734736,0.0018354835,0.0013653918,0.0006982536],"domain_scores_gemma":[0.9965088,0.00028824818,0.00046519248,0.0021154822,0.0003962745,0.00022605015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064063125,0.000590876,0.00045742627,0.00077010994,0.00028239866,0.00048775706,0.0033800134,0.00027990926,0.00007882083],"category_scores_gemma":[0.00007514849,0.00051413255,0.00009968867,0.00084754615,0.0009060391,0.0008892619,0.0007469265,0.0007393787,0.00011780222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027236554,0.00015264937,0.00006486029,0.00017557168,0.000015726664,0.00009947155,0.002734926,0.031532016,0.00015288618,0.50607157,0.000005267625,0.45896783],"study_design_scores_gemma":[0.00075885927,0.00032286134,0.00017921714,0.0006942244,0.000011543955,0.000032436208,1.3305824e-7,0.33967343,0.002671957,0.6534453,0.0013590049,0.000851059],"about_ca_topic_score_codex":0.000009022109,"about_ca_topic_score_gemma":0.00005795385,"teacher_disagreement_score":0.45811677,"about_ca_system_score_codex":0.0006365717,"about_ca_system_score_gemma":0.0011575039,"threshold_uncertainty_score":0.999731},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038153077,0.00037316492,0.9918787,0.000034638077,0.00068245723,0.00039305683,0.000026089676,0.000386401,0.0061873435],"genre_scores_gemma":[0.77748626,0.00014187131,0.22105522,0.00019291799,0.00071928726,0.000033253626,0.000023265151,0.00008901407,0.00025888975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987426,0.0000025936026,0.0002394227,0.0004114449,0.00029397773,0.0003099904],"domain_scores_gemma":[0.9992788,0.00014423091,0.000054183325,0.0003391421,0.00012756909,0.00005606362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022023708,0.00027265388,0.00025461294,0.00027817173,0.00009449346,0.0001389688,0.00041879187,0.00023324137,0.00001911147],"category_scores_gemma":[0.00003674443,0.00026755076,0.00006373527,0.00012962623,0.0002241744,0.00011409968,0.000054116204,0.00025118026,0.000004776763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046400205,0.0000050924677,0.000013464297,0.00021184325,0.000008935282,0.000011775042,0.00028146195,0.60898334,0.0014673624,0.0067246775,0.0001101042,0.3821773],"study_design_scores_gemma":[0.00030126024,0.00017041252,0.00008105794,0.00085614325,0.000020131509,0.000023594042,7.7316265e-8,0.37941277,0.022429543,0.5908237,0.0049652136,0.0009161058],"about_ca_topic_score_codex":0.000041449977,"about_ca_topic_score_gemma":0.00013578724,"teacher_disagreement_score":0.7774481,"about_ca_system_score_codex":0.00050405774,"about_ca_system_score_gemma":0.00019630133,"threshold_uncertainty_score":0.99997765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091270864,0.00018028052,0.9961683,0.00016099543,0.0011003269,0.00040114258,9.477952e-7,0.000050721523,0.0010245502],"genre_scores_gemma":[0.21462993,0.000020571344,0.78517073,0.000097555196,0.00004681041,0.000007299459,0.0000027321357,0.000009675793,0.000014666125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969256,0.00010699394,0.0005731723,0.0008970097,0.0011416553,0.00035554662],"domain_scores_gemma":[0.9978127,0.00035239232,0.00038514275,0.0009382262,0.00043879932,0.00007273332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004290743,0.00028496727,0.00036885866,0.00087019446,0.00012988239,0.00011020242,0.0014267745,0.00022489383,0.000013789823],"category_scores_gemma":[0.00046149557,0.00026892466,0.00006245622,0.00063257135,0.00042616625,0.0011249052,0.0006169423,0.0008080575,0.0000068101053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022602183,0.00001666683,0.00013908774,0.000017620689,9.735519e-7,8.73503e-7,0.000266241,0.13065253,0.0014655231,0.00092555705,2.698161e-7,0.8665124],"study_design_scores_gemma":[0.00029050626,0.000044824086,0.0041738795,0.00033126317,0.00000520107,0.000008521391,6.990102e-8,0.93883485,0.008650142,0.047354262,0.00005251865,0.00025397452],"about_ca_topic_score_codex":0.000022405318,"about_ca_topic_score_gemma":0.00005894223,"teacher_disagreement_score":0.86625844,"about_ca_system_score_codex":0.00031905543,"about_ca_system_score_gemma":0.00044976835,"threshold_uncertainty_score":0.9999763},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05899003,0.0015030014,0.86766446,0.00018796355,0.00124253,0.0006154663,0.000020259982,0.000111925954,0.06966435],"genre_scores_gemma":[0.9965163,0.000050342733,0.0020470514,0.000117478805,0.0002513667,0.000008230462,0.000004087103,0.000021398,0.0009837726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813163,0.000027825676,0.0005527712,0.0008532689,0.00008419774,0.00035028503],"domain_scores_gemma":[0.99895316,0.00027742362,0.0004384944,0.00023059204,0.000046317935,0.000053987333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011935977,0.00026248215,0.00047847914,0.0006137386,0.00019154107,0.00014566851,0.0005119267,0.00027883603,0.000053545697],"category_scores_gemma":[0.00022815789,0.00029544524,0.00004332638,0.00022822693,0.0003357034,0.00026453703,0.00020738038,0.00070553983,0.00006942324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027099482,0.000044698267,0.044535074,0.0002317729,0.00001749992,0.000009874079,0.011238479,0.0039288267,0.00004611305,0.6795552,0.0000067054357,0.26035866],"study_design_scores_gemma":[0.0004152891,0.00016937075,0.045202933,0.0004665934,0.0000039328356,0.000008822196,0.0000013580698,0.024981081,0.00006131051,0.92565477,0.0023107578,0.000723791],"about_ca_topic_score_codex":0.00017122632,"about_ca_topic_score_gemma":0.00015013848,"teacher_disagreement_score":0.9375262,"about_ca_system_score_codex":0.00012718888,"about_ca_system_score_gemma":0.00004958838,"threshold_uncertainty_score":0.99994975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016619873,0.0021944623,0.9953129,0.000033804583,0.00017496478,0.00025505465,0.000007738553,0.00014647929,0.00021256646],"genre_scores_gemma":[0.9411061,0.0001989695,0.057896495,0.00022454486,0.00027128475,0.0000064774413,0.000010597285,0.00007089728,0.00021464578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983623,0.000008488996,0.00028140654,0.0006073687,0.00026236908,0.00047805088],"domain_scores_gemma":[0.9992194,0.00025934455,0.00009175938,0.0002809094,0.00008152449,0.000067034736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000254959,0.00040331087,0.0004798584,0.0002827226,0.00017797554,0.00019973339,0.00034477602,0.00021669717,0.000002638978],"category_scores_gemma":[0.000007310791,0.00034328527,0.0000861644,0.00023839003,0.0002809672,0.00013024188,0.00009110386,0.0004106761,0.0000010577902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015080205,0.000004529411,0.00007538077,0.00009660614,0.000052953976,0.000050989445,0.00029475888,0.8518757,0.0008587013,0.000104807936,0.000011483691,0.14655897],"study_design_scores_gemma":[0.00023938091,0.00004661999,0.00003837874,0.0006250726,0.000041569594,0.000027713824,0.0000015258178,0.99795216,0.00010144837,0.0003329359,0.0001318757,0.0004613105],"about_ca_topic_score_codex":0.000008867578,"about_ca_topic_score_gemma":0.000064608495,"teacher_disagreement_score":0.9394441,"about_ca_system_score_codex":0.000091789705,"about_ca_system_score_gemma":0.00003786638,"threshold_uncertainty_score":0.9999019},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96047515,0.0016923965,0.018825449,0.00023862105,0.0022525217,0.00048839295,0.00010827834,0.000034058,0.015885165],"genre_scores_gemma":[0.9974677,0.00017127433,0.0007359012,0.00057659124,0.00023616022,0.0000059903614,0.0000057321886,0.000023430399,0.00077719503],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99837625,0.00003507642,0.0003158172,0.00067068636,0.00023463974,0.00036753822],"domain_scores_gemma":[0.99869126,0.00062494585,0.00014559494,0.0003431233,0.0000987478,0.000096315656],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00035873236,0.0002839314,0.00030071562,0.00018491762,0.00025130212,0.00007567911,0.0003157406,0.000279848,0.00009772773],"category_scores_gemma":[0.00007372841,0.0002218594,0.00007619451,0.00011707827,0.004455348,0.00009608786,0.00031992255,0.00053527823,0.000008158721],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018852694,0.000097527896,0.011646971,0.0001725291,0.00017908806,0.000020608812,0.07575209,0.00033090042,0.000091359005,0.01680202,0.000050734838,0.8946676],"study_design_scores_gemma":[0.007876966,0.0042384113,0.806795,0.0024213383,0.00044548896,0.0014268754,0.0064878054,0.0065835463,0.0003232431,0.1312915,0.027251756,0.004858091],"about_ca_topic_score_codex":0.00020601311,"about_ca_topic_score_gemma":0.0005338119,"teacher_disagreement_score":0.88980955,"about_ca_system_score_codex":0.000039567753,"about_ca_system_score_gemma":0.00010308851,"threshold_uncertainty_score":0.99825394},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004960046,0.0007665914,0.99590945,0.00035416093,0.0010428505,0.0013752492,0.000019744586,0.00016076013,0.00036623064],"genre_scores_gemma":[0.0027766214,0.00012282758,0.9925868,0.0011238023,0.00014290787,0.00004532576,0.0000074862005,0.00004780083,0.003146447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995243,0.000054704156,0.0006013035,0.002581387,0.00074382214,0.0007757565],"domain_scores_gemma":[0.99681276,0.000419117,0.0004445322,0.0010654799,0.00088271516,0.00037541654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006131686,0.0007357686,0.00088432187,0.0013868194,0.0003862701,0.00041831724,0.0019904473,0.00034655523,0.00002689109],"category_scores_gemma":[0.00036075033,0.00058779214,0.00023708274,0.0019761857,0.0003880422,0.001058555,0.0008348888,0.00057276076,0.0000137607185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026089623,0.000082973245,0.00012704892,0.000072017385,0.00028149495,0.000051200357,0.002400223,0.5019221,0.00017392196,0.013192414,0.00003790773,0.48163262],"study_design_scores_gemma":[0.000746294,0.00016294018,0.000102163285,0.00008391362,0.00007490982,0.00003305606,4.645044e-7,0.98427397,0.0014606111,0.011412547,0.00082249416,0.00082662835],"about_ca_topic_score_codex":0.000030927567,"about_ca_topic_score_gemma":0.00012238577,"teacher_disagreement_score":0.4823519,"about_ca_system_score_codex":0.0004183873,"about_ca_system_score_gemma":0.0007308513,"threshold_uncertainty_score":0.99965733},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005947819,0.0010483648,0.99042374,0.000053923573,0.00026927545,0.00024039726,0.000026249982,0.000013045099,0.00197717],"genre_scores_gemma":[0.9049041,0.00033353374,0.08996343,0.0005509626,0.000668783,0.000021311702,0.00029708873,0.00005381982,0.0032069392],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99809635,0.000020902111,0.00035054877,0.00084048446,0.00044473683,0.0002469998],"domain_scores_gemma":[0.99854225,0.00003466034,0.00031702156,0.000807828,0.00021339666,0.00008482494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040211488,0.000247048,0.0003354258,0.00050698326,0.0000666361,0.000029054836,0.00063948147,0.00032085503,0.00007199771],"category_scores_gemma":[0.000032676307,0.00021690926,0.00015862798,0.00047282016,0.0004033871,0.000006039026,0.00022131436,0.00017790281,0.0000058168534],"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.0000311744,0.000030476747,0.00030761675,0.000014416263,0.000056255132,0.0000025739198,0.000053649008,0.01610417,0.91548294,0.000037230326,0.00009383028,0.06778565],"study_design_scores_gemma":[0.00013932551,0.00010931674,0.0009295367,0.00009597619,0.00009596224,0.0000021579451,3.0950366e-7,0.0095727015,0.9860558,0.00052758626,0.0021521521,0.0003191606],"about_ca_topic_score_codex":0.0000050486806,"about_ca_topic_score_gemma":0.00001649723,"teacher_disagreement_score":0.9004603,"about_ca_system_score_codex":0.00003981197,"about_ca_system_score_gemma":0.0002827939,"threshold_uncertainty_score":0.8845303},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016315632,0.00030438104,0.99650955,0.00018316884,0.00060659135,0.0003360135,0.0000026542962,0.00022014708,0.0016743283],"genre_scores_gemma":[0.46271184,0.00010046267,0.5358264,0.0007973711,0.00029582094,0.0000021782848,0.0000015423403,0.000029499684,0.00023490627],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99698573,0.00005088624,0.00064219144,0.0011073306,0.0007396795,0.00047420122],"domain_scores_gemma":[0.9979478,0.00021045915,0.0003574476,0.0011410386,0.00026293154,0.000080308295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007028492,0.00043558917,0.00055387063,0.0017524353,0.00012865002,0.0001686388,0.0018169737,0.00038738604,0.000007425814],"category_scores_gemma":[0.00012939979,0.00040903213,0.00014233323,0.0009394621,0.000410118,0.0005328245,0.00045118586,0.0008793303,0.000006326413],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008706535,0.000010754399,0.0000022251452,0.000023692606,0.0000027800975,0.00006036003,0.00020721435,0.0021672505,0.008589443,0.0003154033,0.000003885894,0.9886083],"study_design_scores_gemma":[0.00022371257,0.0003335025,0.00032212626,0.0002451796,0.000004138979,0.00008495885,1.3579739e-7,0.09958803,0.6922347,0.2060959,0.00039366283,0.00047396318],"about_ca_topic_score_codex":0.00021471347,"about_ca_topic_score_gemma":0.0002128659,"teacher_disagreement_score":0.9881343,"about_ca_system_score_codex":0.00025917304,"about_ca_system_score_gemma":0.00025291808,"threshold_uncertainty_score":0.99983615},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002838989,0.0006933793,0.976649,0.00020531238,0.0030967142,0.0004730918,0.0000067320802,0.00036207636,0.018229794],"genre_scores_gemma":[0.37991425,0.000012683361,0.61660004,0.00049421174,0.0016216191,0.00001990869,0.000020363635,0.000065625136,0.0012513277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495703,0.000054861477,0.0006844224,0.0020629356,0.00103703,0.001203698],"domain_scores_gemma":[0.9971107,0.00042716405,0.00045970007,0.0013648251,0.0004145122,0.00022305788],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00088665757,0.0008027551,0.0007592102,0.00075519754,0.00049792486,0.0011191104,0.0035888297,0.0004832824,0.000022440347],"category_scores_gemma":[0.00008997037,0.00071030704,0.0002407542,0.000790274,0.0015055145,0.0006802071,0.0017097142,0.0010365125,0.000060529703],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032337844,0.000029570612,0.0006602476,0.000055679906,0.000018246563,0.0001931902,0.001223859,0.0017897472,0.00010569057,0.027036455,0.000081844046,0.9688022],"study_design_scores_gemma":[0.0012049823,0.0007011536,0.00044050597,0.0010042705,0.000059973052,0.0018032196,0.000004867016,0.69027895,0.0063860966,0.27371696,0.020139173,0.004259824],"about_ca_topic_score_codex":0.00008088001,"about_ca_topic_score_gemma":0.00041663164,"teacher_disagreement_score":0.9645424,"about_ca_system_score_codex":0.00044569725,"about_ca_system_score_gemma":0.00056494965,"threshold_uncertainty_score":0.9999178},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015698718,0.00020255525,0.97074205,0.0018146324,0.0035738954,0.001040646,0.000008755276,0.00014321355,0.006775532],"genre_scores_gemma":[0.17419131,0.000116262556,0.79609185,0.024241075,0.004098551,0.000014330792,0.0000147266455,0.00012979617,0.001102111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954677,0.0000387747,0.00096262374,0.0017171229,0.0011009393,0.0007128324],"domain_scores_gemma":[0.9878661,0.009473313,0.00027596217,0.0013153453,0.00031688728,0.0007524044],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015639601,0.0005498916,0.0010766368,0.00046887292,0.00017764149,0.00015978357,0.0007162156,0.0008523681,0.00006544774],"category_scores_gemma":[0.01654842,0.0004434049,0.00030766486,0.00030510785,0.0008016669,0.000112939604,0.0004947492,0.00219423,0.00010678313],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018606482,0.00035498448,0.00061625044,0.00002403685,0.00003531523,0.000370395,0.00079432054,0.029290449,0.00025588996,0.0016095256,0.00013593175,0.96632683],"study_design_scores_gemma":[0.0066461833,0.008181243,0.0033075893,0.08119881,0.00033622608,0.0009925799,0.0000027412148,0.7278125,0.005642128,0.14655234,0.014756349,0.004571258],"about_ca_topic_score_codex":0.000072774405,"about_ca_topic_score_gemma":0.000049568567,"teacher_disagreement_score":0.9617556,"about_ca_system_score_codex":0.0002507064,"about_ca_system_score_gemma":0.0010358104,"threshold_uncertainty_score":0.99980175},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000076668,0.00025978344,0.9850357,0.0008233938,0.0014749866,0.00051434315,0.0000035744781,0.0002009184,0.011679638],"genre_scores_gemma":[0.028879717,0.00015580037,0.96176374,0.005580332,0.00057360146,0.000016637634,0.0000109877865,0.000058417667,0.0029607918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570465,0.00002320721,0.0005866263,0.0014782059,0.0013454937,0.0008618255],"domain_scores_gemma":[0.99745184,0.00032556205,0.00023563686,0.0013692314,0.00032025416,0.00029744607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001313799,0.00047329135,0.00042500132,0.0010354725,0.00026362282,0.0006887826,0.0033236938,0.000271591,0.000061843275],"category_scores_gemma":[0.00009886309,0.00042829337,0.00012158884,0.0007201186,0.00053039216,0.00047420367,0.0015532715,0.0008161713,0.00011851635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039659353,0.000042671203,0.00001732669,0.000045460238,0.000009368244,0.000114007424,0.00043128314,0.02636534,0.00009969963,0.04761256,0.00007282607,0.9251855],"study_design_scores_gemma":[0.0004084051,0.00040308642,0.00004103946,0.00029178834,0.0000052435594,0.000042844265,1.0871164e-7,0.8679409,0.000755814,0.1200059,0.009280665,0.00082419446],"about_ca_topic_score_codex":0.000021406608,"about_ca_topic_score_gemma":0.00005673467,"teacher_disagreement_score":0.9243613,"about_ca_system_score_codex":0.00036335379,"about_ca_system_score_gemma":0.0005774263,"threshold_uncertainty_score":0.9998169},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038843567,0.000023977305,0.9770235,0.000076707285,0.000046708825,0.0003123828,0.000007598383,0.000051685765,0.018573076],"genre_scores_gemma":[0.67606246,0.000007124316,0.32347292,0.000116646544,0.000048290913,9.453937e-7,0.000005436778,0.000025150273,0.0002610199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824804,0.0000051938227,0.00033457635,0.00064506615,0.00050045614,0.0002666583],"domain_scores_gemma":[0.9990767,0.000053512675,0.00025249057,0.0005188337,0.000033480963,0.00006497588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017789232,0.00026751123,0.00024304986,0.00019707052,0.00009748831,0.00014203702,0.000407672,0.00012515858,0.00002842619],"category_scores_gemma":[0.000010886478,0.0002233859,0.000058429334,0.00022748674,0.00093520764,0.00032327682,0.00031167912,0.00024869508,0.000009467567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062816744,0.000043699834,0.000105118736,0.0000124961925,0.0000044251756,0.0000036570086,0.00054211984,0.046099257,0.05815174,0.000044432523,0.0000048239644,0.8949819],"study_design_scores_gemma":[0.00007531041,0.0001919781,0.000040129697,0.000271363,0.0000119903725,0.00002805221,5.6378263e-7,0.9574364,0.026357824,0.014921512,0.00028508028,0.0003798138],"about_ca_topic_score_codex":0.00005006023,"about_ca_topic_score_gemma":0.000029917928,"teacher_disagreement_score":0.91133714,"about_ca_system_score_codex":0.00034095222,"about_ca_system_score_gemma":0.00003781217,"threshold_uncertainty_score":0.91094124},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09416657,0.0018107928,0.88825464,0.00028220355,0.0014220567,0.00043811588,0.000014985022,0.00004894483,0.013561686],"genre_scores_gemma":[0.97796696,0.00002620116,0.019677516,0.0008409629,0.0008759515,0.0000024845633,0.000052551713,0.000021404774,0.0005359661],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979585,0.000025156269,0.00032738002,0.00097322866,0.00026234036,0.00045339554],"domain_scores_gemma":[0.99925715,0.00004899027,0.000121775,0.00045428888,0.000053938995,0.00006386113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030848206,0.00034704202,0.00030522802,0.00021747134,0.00008101261,0.00008862965,0.0008185422,0.00047800472,0.000015035375],"category_scores_gemma":[0.00006272647,0.00027785098,0.00009808743,0.00016568825,0.00046578248,0.0000046225573,0.00060041016,0.0004202896,0.0000048633774],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087740955,0.00007062351,0.004156025,0.000067752466,0.000022737622,0.00017298793,0.000096010896,0.06909011,0.08273124,0.0017922096,0.00034356213,0.841369],"study_design_scores_gemma":[0.0038699962,0.0037095654,0.04247472,0.0017822107,0.000054765776,0.0003926224,0.0000016326813,0.07303495,0.27257857,0.4896756,0.104192264,0.008233082],"about_ca_topic_score_codex":0.000031389853,"about_ca_topic_score_gemma":0.0002572414,"teacher_disagreement_score":0.8838004,"about_ca_system_score_codex":0.000058444577,"about_ca_system_score_gemma":0.00014657264,"threshold_uncertainty_score":0.99996734},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016166003,0.0006515591,0.97989815,0.0002722918,0.0012259308,0.0005531848,0.00009267229,0.00047820495,0.00066199887],"genre_scores_gemma":[0.844409,0.0003653089,0.15377463,0.000884372,0.00031944868,0.000036844525,0.00007234802,0.000053010048,0.00008504859],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99523306,0.00004753101,0.00087960926,0.0016588556,0.0012449812,0.00093595317],"domain_scores_gemma":[0.9970857,0.00043239578,0.000263246,0.0017644102,0.0002042001,0.00025006421],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052963925,0.00076049427,0.0007019777,0.000675645,0.0005768978,0.00058189087,0.0037700064,0.00043572034,0.00006112412],"category_scores_gemma":[0.000024042414,0.00065070903,0.00022839403,0.0007059439,0.0005150484,0.0020485506,0.00050683046,0.001128679,0.000060462036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007024092,0.000026457168,0.00077097607,0.00008719606,0.000017666463,0.000009848177,0.0022959837,0.13518986,0.00001833693,0.00016071432,0.000021515516,0.8613944],"study_design_scores_gemma":[0.00047884695,0.00019415178,0.0011249819,0.0012753684,0.000018507606,0.000098900215,4.4496235e-7,0.87635595,0.0010762209,0.117394924,0.0005540791,0.0014276342],"about_ca_topic_score_codex":0.0001906426,"about_ca_topic_score_gemma":0.00012151133,"teacher_disagreement_score":0.8599668,"about_ca_system_score_codex":0.0002808927,"about_ca_system_score_gemma":0.00045039968,"threshold_uncertainty_score":0.9995944},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031070516,0.002023479,0.91571635,0.000027977168,0.0018753068,0.0006769511,0.000047917652,0.00032241162,0.07620258],"genre_scores_gemma":[0.9610465,0.000012773257,0.038429618,0.000045570778,0.00011423895,0.000012637643,0.00000910439,0.000057821628,0.00027170192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795336,0.000023381373,0.00063687266,0.000508693,0.0005499879,0.00032771225],"domain_scores_gemma":[0.9981029,0.00029096508,0.0001550223,0.0012680726,0.00008435846,0.00009865137],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035329457,0.00034625691,0.0005048992,0.0002530396,0.00005950698,0.000051771327,0.0009745641,0.00024786475,0.000024244844],"category_scores_gemma":[0.000017493301,0.00033778526,0.000087007975,0.0002050507,0.00035855625,0.00012469634,0.00026734328,0.0004950337,0.00002625292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007887006,0.0000895981,0.000019870584,0.00085597095,0.00010774813,0.00010015385,0.0031621421,0.8344807,0.016953198,0.027310934,0.0002253454,0.11661547],"study_design_scores_gemma":[0.0018411287,0.00020150573,0.00004806643,0.0033159654,0.000022709324,0.00023072046,0.0000074124046,0.7855489,0.18616079,0.0015012219,0.019425701,0.0016958363],"about_ca_topic_score_codex":0.0000097261955,"about_ca_topic_score_gemma":0.000007866612,"teacher_disagreement_score":0.9579395,"about_ca_system_score_codex":0.0005265259,"about_ca_system_score_gemma":0.000072089264,"threshold_uncertainty_score":0.99990743},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018207407,0.0004547683,0.98784244,0.003468783,0.0004798074,0.0007803055,0.0000063330885,0.00018646866,0.006599001],"genre_scores_gemma":[0.091536365,0.000025194773,0.90577316,0.0022685616,0.00031617374,0.000027926222,0.00001365779,0.000013925058,0.000025022853],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99568844,0.00014965687,0.00074549776,0.001169389,0.0017310001,0.000515996],"domain_scores_gemma":[0.9979577,0.00036239903,0.00031788842,0.001105419,0.00014784081,0.00010872037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018134962,0.0004173931,0.00033482118,0.0004676266,0.00019167103,0.0005287413,0.002811958,0.00029458303,0.00003225102],"category_scores_gemma":[0.000066348126,0.00031980584,0.00010765613,0.0010543953,0.00067574106,0.0004228428,0.0001983849,0.0006961608,0.000024026549],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049342707,0.000066058376,0.000045320412,0.000023504794,0.000003730238,0.00008107451,0.0019468358,0.0043418068,0.00020712131,0.048936438,0.00003281956,0.94431037],"study_design_scores_gemma":[0.000611189,0.0002616209,0.0007949109,0.00049631775,0.000009253748,0.00013035261,0.0000020079522,0.47073886,0.0010031846,0.5247861,0.00036680727,0.0007993583],"about_ca_topic_score_codex":0.00007178347,"about_ca_topic_score_gemma":0.0004293585,"teacher_disagreement_score":0.943511,"about_ca_system_score_codex":0.00053605903,"about_ca_system_score_gemma":0.000461847,"threshold_uncertainty_score":0.9999254},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027091048,0.00020682251,0.9953754,0.000409651,0.00041730734,0.0015193346,0.000033874152,0.0010836369,0.00095126283],"genre_scores_gemma":[0.0042849146,0.000022400267,0.99396926,0.00080201053,0.00040576927,0.0001887892,0.0000147719165,0.000072394716,0.00023967415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590474,0.0000113729475,0.00057663454,0.0018011312,0.00085661456,0.0008494905],"domain_scores_gemma":[0.9966732,0.0003648231,0.0002506012,0.0021098622,0.00036490164,0.00023657929],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007259585,0.0006611921,0.000570285,0.0012631457,0.00024949317,0.00031318926,0.004631971,0.0005290348,0.0000036997003],"category_scores_gemma":[0.000015263164,0.0006496054,0.00022921871,0.0006071399,0.0004497956,0.00034382677,0.0011528899,0.0009450133,0.000013497018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002215771,0.000012722423,0.0000025795543,0.000038599363,0.000006038231,0.0000056815943,0.00013816966,0.33555394,0.00015701819,0.16371532,0.00003267088,0.50033504],"study_design_scores_gemma":[0.00013532842,0.00007289603,0.000002689901,0.00014774127,0.000006779171,0.000029216284,6.4615606e-9,0.7691791,0.00048495826,0.18549357,0.043883067,0.00056462333],"about_ca_topic_score_codex":0.0000035936816,"about_ca_topic_score_gemma":0.00004669715,"teacher_disagreement_score":0.4997704,"about_ca_system_score_codex":0.00039238803,"about_ca_system_score_gemma":0.0006070327,"threshold_uncertainty_score":0.9995955},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030376588,0.0010247637,0.99375534,0.000032237946,0.001222882,0.00019147975,0.0000055591363,0.00018357561,0.0005464814],"genre_scores_gemma":[0.93217915,0.00012837685,0.06738184,0.000043127533,0.00012634766,0.000006796113,0.0000061203414,0.000038229195,0.00009000658],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987134,0.0000035475691,0.0003660511,0.00033051765,0.00030127232,0.00028523288],"domain_scores_gemma":[0.99907523,0.00005330767,0.00013127089,0.00064471544,0.000058110796,0.000037378304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025134406,0.0002152951,0.00023850294,0.00045356384,0.000036022393,0.000021411477,0.0007810799,0.00023674067,0.000021529293],"category_scores_gemma":[0.000028740546,0.00022277147,0.00003644904,0.00022110566,0.00038802312,0.00021304833,0.0001917745,0.0003787054,0.00004075698],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020168561,0.000013150761,0.00053199707,0.00012931965,0.000021092223,0.000005462965,0.00016761005,0.12986663,0.0289509,0.011234294,0.000007868155,0.8290697],"study_design_scores_gemma":[0.0004268179,0.00008521509,0.0032344111,0.00062484544,0.000037683603,0.00003750153,1.18450146e-7,0.25583196,0.46408507,0.26535434,0.009039028,0.0012429961],"about_ca_topic_score_codex":0.0000012558362,"about_ca_topic_score_gemma":0.000003867625,"teacher_disagreement_score":0.9291415,"about_ca_system_score_codex":0.00018964325,"about_ca_system_score_gemma":0.000022316435,"threshold_uncertainty_score":0.9084357},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013319533,0.00008464206,0.9971541,0.00007414729,0.0002047509,0.0001316259,0.000015202836,0.000069622474,0.000933962],"genre_scores_gemma":[0.946177,0.000008660438,0.053649623,0.00004036946,0.000054567972,0.0000021017893,0.000033395107,0.000016725913,0.00001757238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989199,0.0000027989481,0.00028162907,0.0003290275,0.000309896,0.00015675706],"domain_scores_gemma":[0.9991419,0.00013349333,0.000094661395,0.0004857824,0.00009960694,0.00004458751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013422531,0.00018315717,0.00030253336,0.0004158069,0.000044510638,0.0000519671,0.00038159147,0.00013892226,0.000029355118],"category_scores_gemma":[0.000013701565,0.00018525466,0.000094917144,0.00067139167,0.0002056264,0.000040954117,0.000033450095,0.0001911235,0.000003359173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.499432e-7,0.000005958076,0.0000649479,0.000024523815,0.000028184473,0.0000015071513,0.000041020725,0.97193104,0.00043616214,0.002231207,0.0000011342617,0.025233654],"study_design_scores_gemma":[0.00007798547,0.000011465565,0.0014455756,0.00008542417,0.000090876245,3.939386e-7,2.650574e-8,0.9851664,0.002230161,0.010646879,0.000048637266,0.00019620963],"about_ca_topic_score_codex":0.00008080631,"about_ca_topic_score_gemma":0.0003175028,"teacher_disagreement_score":0.944845,"about_ca_system_score_codex":0.00014965142,"about_ca_system_score_gemma":0.00014884271,"threshold_uncertainty_score":0.75544655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015548132,0.00007410474,0.97326887,0.00018999014,0.0018450142,0.011943501,0.000022880697,0.00017325573,0.01246683],"genre_scores_gemma":[0.011840999,0.0000055367527,0.979907,0.0017430043,0.0006065952,0.0054042335,0.000025438658,0.00006813776,0.00039906986],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960666,0.000045354755,0.0007763813,0.0015099437,0.0010178908,0.0005838724],"domain_scores_gemma":[0.9965807,0.00033974543,0.00044092519,0.0019929062,0.00041904746,0.00022666696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064328924,0.000518305,0.0005915467,0.0026468884,0.00012371644,0.00024997612,0.0037356724,0.0002518218,0.000065138884],"category_scores_gemma":[0.00008001869,0.00050640595,0.0002575613,0.0015219394,0.00078616996,0.0010227946,0.0013419942,0.00085529813,0.00001612182],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089339665,0.00057152245,0.00036301214,0.00044602202,0.00005544223,0.000115508665,0.0033097595,0.020420024,0.0011146279,0.24096908,0.014390913,0.7181547],"study_design_scores_gemma":[0.0014160426,0.0010544347,0.002274092,0.0018636177,0.000036843627,0.00012932986,6.207163e-7,0.106606625,0.0016204377,0.3758319,0.50639206,0.0027739913],"about_ca_topic_score_codex":0.00019586184,"about_ca_topic_score_gemma":0.00055285764,"teacher_disagreement_score":0.7153808,"about_ca_system_score_codex":0.0005594984,"about_ca_system_score_gemma":0.00091662846,"threshold_uncertainty_score":0.99973875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035197147,0.0017480224,0.9964346,0.00024226465,0.00038955596,0.00027720252,0.000003065004,0.00029322298,0.00057685876],"genre_scores_gemma":[0.2541806,0.000017448032,0.74542356,0.00007755373,0.00009354817,0.000005754158,0.000007975105,0.000019249399,0.0001742991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972623,0.000031544954,0.00057432,0.0009948037,0.0008294801,0.00030754393],"domain_scores_gemma":[0.99800694,0.00017002727,0.0005055632,0.00094466994,0.00030301843,0.00006976399],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001140148,0.00032462072,0.000380579,0.00083356514,0.00018371946,0.00029153656,0.0029150096,0.0003751444,0.000007035791],"category_scores_gemma":[0.00012482252,0.00028904967,0.000097530734,0.00065453077,0.0005129581,0.000619017,0.0004809001,0.0013942387,0.000004680998],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005376187,0.000041511044,0.00004606888,0.00015682803,0.000008544303,0.000012784146,0.0017761273,0.0056227637,0.035972964,0.049298182,0.0000010237467,0.9070578],"study_design_scores_gemma":[0.00011013941,0.00005411313,0.000014533331,0.00013445286,0.0000066509106,0.000048319915,4.9893494e-8,0.6401487,0.059732452,0.29921466,0.0001641536,0.00037179532],"about_ca_topic_score_codex":0.000016822296,"about_ca_topic_score_gemma":0.000017910683,"teacher_disagreement_score":0.906686,"about_ca_system_score_codex":0.0000740878,"about_ca_system_score_gemma":0.00024156354,"threshold_uncertainty_score":0.9999562},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015040403,0.0012485029,0.990599,0.00013137895,0.0022428522,0.0012451473,0.000045329816,0.0003479105,0.0026358739],"genre_scores_gemma":[0.1292734,0.000039372702,0.86948127,0.00037362846,0.0006789853,0.0000140041975,0.000046118228,0.00006524723,0.000027950346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909346,0.000075832635,0.0014504892,0.0038636967,0.0023139298,0.0013614316],"domain_scores_gemma":[0.99312717,0.0026089917,0.0006645787,0.0027629996,0.00042470108,0.00041154693],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015750864,0.0011917284,0.0012922554,0.0010003555,0.0006704494,0.0017895999,0.0061823134,0.0007503118,0.000048445196],"category_scores_gemma":[0.00055576646,0.0009779211,0.00032053495,0.0010565001,0.0011739184,0.0008143414,0.0035502696,0.0013599697,0.00014715915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029823857,0.0001391858,0.000036268437,0.000082346254,0.000014257179,0.0001314563,0.0007092826,0.31691426,0.000012925677,0.03271295,0.000026428661,0.64919084],"study_design_scores_gemma":[0.0004398327,0.00017563239,0.00021245255,0.0008813933,0.000015431064,0.00006297606,3.6489544e-7,0.5232021,0.000012961921,0.4740728,0.00020316111,0.0007208424],"about_ca_topic_score_codex":0.00014721524,"about_ca_topic_score_gemma":0.00006404615,"teacher_disagreement_score":0.64847,"about_ca_system_score_codex":0.001028105,"about_ca_system_score_gemma":0.0013478327,"threshold_uncertainty_score":0.9992671},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000029999592,0.0018063465,0.9842749,0.010094017,0.0008814951,0.0011008867,0.00004182671,0.00014591218,0.0016515757],"genre_scores_gemma":[0.0023132302,0.000117725984,0.9926786,0.0022676694,0.00057833776,0.00014143926,0.000045285735,0.000044100212,0.0018136523],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965335,0.0000511314,0.00060452434,0.0013725148,0.00073717575,0.00070114963],"domain_scores_gemma":[0.9959771,0.0015203266,0.00032702164,0.0015168693,0.00049037277,0.00016829603],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00073024567,0.00048549162,0.00037771804,0.00043394289,0.001539243,0.0005438857,0.003010825,0.0002475864,0.0000073362557],"category_scores_gemma":[0.000098378914,0.0003766654,0.00022379302,0.0007940324,0.0007454149,0.00031830705,0.00065557007,0.0006904046,0.000029759409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062579484,0.000050185496,0.0000134853435,0.00003811268,0.000028873412,0.000010068447,0.00029115906,0.08500205,0.00003156962,0.38217407,0.001595753,0.53075844],"study_design_scores_gemma":[0.00018878856,0.00008770215,0.00007170541,0.00011313803,0.000008824763,0.000082663784,2.0467246e-7,0.40642434,0.000027329994,0.53071064,0.061907787,0.00037690732],"about_ca_topic_score_codex":0.0000055645755,"about_ca_topic_score_gemma":0.000025434338,"teacher_disagreement_score":0.5303815,"about_ca_system_score_codex":0.00039045865,"about_ca_system_score_gemma":0.00057052623,"threshold_uncertainty_score":0.9998685},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16144925,0.0015608487,0.83232474,0.00014003036,0.00026240348,0.0009818951,0.0000126444065,0.000010042133,0.0032581466],"genre_scores_gemma":[0.9981144,0.000036825684,0.0015842452,0.000018895858,0.000032226857,0.000007750212,0.0000032134224,0.000006032992,0.00019638675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987954,0.000022568453,0.00059584616,0.00035396047,0.00011111586,0.00012112737],"domain_scores_gemma":[0.9987453,0.00027978932,0.0005933411,0.0002924836,0.00007481622,0.000014239352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009712712,0.00011556652,0.00035849353,0.00053084816,0.00007809974,0.000059020946,0.00030657573,0.0000714021,0.000085294574],"category_scores_gemma":[0.00016498081,0.00010003849,0.00003827437,0.00038689896,0.00012314715,0.00017898962,0.00012477813,0.00021262947,0.000008090797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018489265,0.00034181826,0.13965994,0.00022894955,0.00008740198,0.000005977179,0.057327762,0.2856449,0.000020766953,0.22451842,0.00001910839,0.29212648],"study_design_scores_gemma":[0.0003285281,0.00029560208,0.03561049,0.00015910761,0.000008190713,0.0000028158097,0.000042361648,0.89791113,0.0000046858218,0.06502914,0.00043459906,0.00017333236],"about_ca_topic_score_codex":0.00071037764,"about_ca_topic_score_gemma":0.00065228814,"teacher_disagreement_score":0.83666515,"about_ca_system_score_codex":0.00003495744,"about_ca_system_score_gemma":0.00002246639,"threshold_uncertainty_score":0.40794513},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005015891,0.0003218269,0.94498175,0.006731963,0.0017898019,0.0006438805,0.0000053714784,0.000103221035,0.04537201],"genre_scores_gemma":[0.9392245,0.00005424098,0.048538927,0.0046464736,0.0032664894,0.000022980183,0.0000089180985,0.000057384976,0.0041801143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947622,0.000058824033,0.00055872946,0.0012813642,0.001968434,0.0013704546],"domain_scores_gemma":[0.9980257,0.00031623253,0.00020375887,0.0006399546,0.00042458784,0.00038974642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024284543,0.0005118284,0.0006585627,0.0005419242,0.00067062944,0.000602443,0.0022882603,0.00067646126,0.000120012264],"category_scores_gemma":[0.00026748542,0.00048957585,0.000150905,0.0010779934,0.0010594033,0.00043745356,0.00052472303,0.0012419246,0.000035089866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012207441,0.00001430595,0.00038538853,0.000004580062,0.0000047012504,0.000044491288,0.0018350541,0.806563,3.0513976e-7,0.041256096,0.00011335933,0.14976649],"study_design_scores_gemma":[0.00034563153,0.000047348592,0.0003536501,0.00030808087,0.000010496173,0.000002317964,0.000001538237,0.6236413,0.0000011162265,0.3696107,0.0050350106,0.00064283167],"about_ca_topic_score_codex":0.0010532772,"about_ca_topic_score_gemma":0.010914177,"teacher_disagreement_score":0.9391743,"about_ca_system_score_codex":0.0008108506,"about_ca_system_score_gemma":0.0013510336,"threshold_uncertainty_score":0.99975556},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001599927,0.00018424647,0.9937188,0.0004906203,0.0009220647,0.0003234677,0.0000054093084,0.0028776487,0.0013177621],"genre_scores_gemma":[0.39080974,0.000001656259,0.60843074,0.00033420388,0.0002746904,0.000015141359,0.000015176063,0.000030439465,0.0000882123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964106,0.00004120738,0.0006320153,0.0014295245,0.00076211715,0.0007245255],"domain_scores_gemma":[0.9966621,0.0015757171,0.00034680462,0.0010027629,0.0003120607,0.00010058556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012406695,0.0004990208,0.00050883536,0.0012616058,0.00021321113,0.0006074014,0.0024174436,0.00033089044,0.0000020248472],"category_scores_gemma":[0.00092674274,0.0005052417,0.000076923956,0.0015196219,0.0003420772,0.0005346269,0.0010475845,0.0007831556,0.00000956666],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003054505,0.000058571815,0.0025337653,0.00006333127,0.0000042444653,0.0002564792,0.0003436073,0.10237932,0.00009434758,0.0026144618,0.0006259769,0.89102286],"study_design_scores_gemma":[0.00016547083,0.00008788857,0.0006108081,0.0008935054,0.000002717392,0.00006233307,2.0599005e-8,0.68062675,0.0004688185,0.3163786,0.00016737796,0.00053574605],"about_ca_topic_score_codex":0.00020676485,"about_ca_topic_score_gemma":0.000030234987,"teacher_disagreement_score":0.8904871,"about_ca_system_score_codex":0.0005072118,"about_ca_system_score_gemma":0.00037153126,"threshold_uncertainty_score":0.99973994},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.6216625e-7,0.00014449088,0.99407345,0.00060667173,0.0011199387,0.00085583585,0.000006485152,0.00040991136,0.0027823646],"genre_scores_gemma":[0.005114235,0.000027636503,0.9919425,0.0021088077,0.00034036406,0.000014998433,0.000017222248,0.000037249712,0.0003969795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965756,0.000038348226,0.00057471206,0.001457901,0.0008134947,0.00053995725],"domain_scores_gemma":[0.99705577,0.00051902427,0.00041322154,0.0013598845,0.00045665057,0.00019542182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086890673,0.00044848962,0.00045612105,0.00066136144,0.00025144685,0.00044673786,0.002611291,0.0003919678,0.000030817795],"category_scores_gemma":[0.00016717143,0.00041403697,0.00013110264,0.00038631825,0.00070376316,0.0006377082,0.0006471207,0.0006355393,0.000023631243],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044141743,0.000017456854,0.0000026045127,0.000045640885,0.0000065911327,0.000013838975,0.00040354402,0.0006935483,0.0009748405,0.00839881,0.000242636,0.98919606],"study_design_scores_gemma":[0.00026373626,0.00013353174,0.00003998067,0.0003547758,0.000010516274,0.000034708326,1.8037574e-7,0.8469773,0.012038994,0.13848367,0.001093617,0.0005689824],"about_ca_topic_score_codex":0.000013754825,"about_ca_topic_score_gemma":0.000018603692,"teacher_disagreement_score":0.9886271,"about_ca_system_score_codex":0.00024586686,"about_ca_system_score_gemma":0.00038321663,"threshold_uncertainty_score":0.99983114},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055975013,0.0046453844,0.99288076,0.0007139235,0.00024358474,0.0003966113,0.0000051684556,0.0001841279,0.00037068102],"genre_scores_gemma":[0.31504518,0.000023247841,0.6838954,0.00079797837,0.00015321537,0.0000041725016,0.000003965243,0.000020272952,0.00005659985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970716,0.000056282,0.00044404904,0.0011016376,0.00073307037,0.0005933638],"domain_scores_gemma":[0.998202,0.00057738594,0.00022061827,0.00083834556,0.00009252435,0.000069100235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000943776,0.00041988023,0.00035725586,0.0007256577,0.00043511792,0.0006408107,0.0023924587,0.00032857127,0.0000030840279],"category_scores_gemma":[0.00007331508,0.00032454883,0.00007042823,0.00064546405,0.00058464333,0.00068680133,0.00081984093,0.0009635229,0.0000020389489],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018610312,0.00011357041,0.002273431,0.00018252859,0.000020373416,0.00047413862,0.008653832,0.055869643,0.0058666044,0.027519913,0.00012238687,0.89888495],"study_design_scores_gemma":[0.00030267762,0.000044287626,0.00015936409,0.00048436457,0.000009981878,0.00024294936,3.050349e-7,0.8338345,0.0022879934,0.16025099,0.0017119944,0.0006705319],"about_ca_topic_score_codex":0.00013521011,"about_ca_topic_score_gemma":0.00095330935,"teacher_disagreement_score":0.89821446,"about_ca_system_score_codex":0.00029572606,"about_ca_system_score_gemma":0.00025702512,"threshold_uncertainty_score":0.99992067},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012423152,0.0061370376,0.99112827,0.00018845976,0.0012013894,0.00088348944,0.000022327229,0.00013275146,0.0001820448],"genre_scores_gemma":[0.04096072,0.00030702262,0.9567338,0.001260331,0.00044906014,0.00011696691,0.0001236821,0.00003551823,0.000012860703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996497,0.000035477555,0.00058532145,0.0015330225,0.0006981517,0.00065103936],"domain_scores_gemma":[0.9974337,0.0005204752,0.00029679798,0.0014042645,0.00023475746,0.00011000364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012058868,0.00044904056,0.0004695624,0.0010730077,0.00023025731,0.00068228523,0.003060064,0.00037991174,0.0000072320145],"category_scores_gemma":[0.00005997763,0.00045659134,0.00019302448,0.0012012112,0.00045666678,0.0012940877,0.00064575765,0.00064544776,0.0000070582228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002393951,0.00012727696,0.00018692082,0.0001377763,0.000008047242,0.000030848452,0.00039423455,0.22158009,0.000040036623,0.12831062,0.00022147429,0.6489387],"study_design_scores_gemma":[0.0005128832,0.0001891953,0.00021806774,0.00040219384,0.0000070327214,0.000006423104,1.6922452e-7,0.7102231,0.00021948258,0.26864287,0.01894205,0.00063656585],"about_ca_topic_score_codex":0.00001969981,"about_ca_topic_score_gemma":0.00068633974,"teacher_disagreement_score":0.64830214,"about_ca_system_score_codex":0.00021034679,"about_ca_system_score_gemma":0.0003793209,"threshold_uncertainty_score":0.9997886},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009772767,0.00007135267,0.98551494,0.00025129417,0.0023846717,0.00044863686,0.000001483639,0.00030213312,0.010927748],"genre_scores_gemma":[0.34724537,0.000047625505,0.6385052,0.0010146211,0.0007218474,0.00006868387,0.000002338547,0.00010567353,0.012288638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99535227,0.000041334497,0.00058189314,0.0018791418,0.0012549309,0.00089040614],"domain_scores_gemma":[0.99762166,0.00017817298,0.00032701105,0.001258479,0.00036629135,0.0002483794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007976594,0.0006396992,0.00059917767,0.0008399003,0.0003785646,0.0008735775,0.0023575497,0.00017756494,0.000040408424],"category_scores_gemma":[0.000040592204,0.0005570655,0.000109516346,0.00072126894,0.00012302143,0.002237955,0.00097572507,0.0010773933,0.00021705782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008730502,0.000021744067,0.0000056651775,0.000028181763,0.000015017336,0.00017368913,0.0026151387,0.60985506,0.00023401805,0.23870757,0.000012347548,0.14832282],"study_design_scores_gemma":[0.00036512205,0.0017659051,0.00002256211,0.0023936941,0.000016167203,0.00043964796,0.0000043962023,0.8913164,0.0076266737,0.07208485,0.021945424,0.0020191448],"about_ca_topic_score_codex":0.00011832236,"about_ca_topic_score_gemma":0.00004981399,"teacher_disagreement_score":0.34714764,"about_ca_system_score_codex":0.00067294104,"about_ca_system_score_gemma":0.0002464123,"threshold_uncertainty_score":0.9996881},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034486517,0.000079991565,0.9698195,0.0004971112,0.00009893829,0.00037936884,0.000043972374,0.00030769335,0.028428564],"genre_scores_gemma":[0.85607684,0.000019929941,0.13888702,0.00019911035,0.00046661016,0.0001147316,0.00010422209,0.00006553058,0.0040659895],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99769926,0.0000022418328,0.00042316705,0.0009960795,0.000528298,0.0003509387],"domain_scores_gemma":[0.9984051,0.000041429856,0.00027843585,0.0009854467,0.00019856635,0.00009102605],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020181629,0.00034534186,0.0002815255,0.0003302104,0.00019456925,0.00029196474,0.0012144411,0.00035502156,0.0018003843],"category_scores_gemma":[0.000039326,0.00034097044,0.00008712137,0.00039829686,0.00032446298,0.0001479579,0.00028519152,0.00069435546,0.00004064074],"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.000010539865,0.00016863184,0.000031984593,0.00030873384,0.000022962453,0.000022859704,0.00017557072,0.0041568214,0.5785935,0.18502271,0.00003508553,0.23145062],"study_design_scores_gemma":[0.00030967453,0.000036275127,0.00005328548,0.0007847504,0.000015497024,0.000029816687,1.6380547e-7,0.013604329,0.60606164,0.37290964,0.0053515863,0.0008433322],"about_ca_topic_score_codex":0.000032603926,"about_ca_topic_score_gemma":0.000019695428,"teacher_disagreement_score":0.85573196,"about_ca_system_score_codex":0.0005335236,"about_ca_system_score_gemma":0.00032402482,"threshold_uncertainty_score":0.9999042},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040889806,0.00026463208,0.99239016,0.00022964262,0.0008193012,0.0013913906,0.000010594218,0.000065228734,0.0007400528],"genre_scores_gemma":[0.9028201,0.000005990475,0.095955156,0.00055571884,0.00030274072,0.000063136904,0.000017496295,0.000050323833,0.00022934774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997585,0.000024695655,0.0005637522,0.00078834395,0.00072478305,0.00031344508],"domain_scores_gemma":[0.9979806,0.00043691896,0.00029623279,0.00073466,0.00042771277,0.00012387284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010714119,0.00030551915,0.0006966439,0.00036463197,0.000098463155,0.000039405924,0.00020129528,0.00018128142,0.0000073017886],"category_scores_gemma":[0.00018667769,0.00026308355,0.00013045437,0.00018587014,0.00033113718,0.00014626441,0.000082380706,0.0002536601,0.0000065288973],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045983962,0.00015991055,0.0031032441,0.0019444131,0.00012853536,0.000043377488,0.001806321,0.016365761,0.004599036,0.004276814,0.000046717178,0.96706605],"study_design_scores_gemma":[0.010306508,0.008445032,0.006402654,0.015628908,0.0006413411,0.0019349882,0.000034564066,0.64161026,0.28164864,0.011604577,0.0169305,0.0048120613],"about_ca_topic_score_codex":0.000019967432,"about_ca_topic_score_gemma":0.000057410714,"teacher_disagreement_score":0.962254,"about_ca_system_score_codex":0.0006734853,"about_ca_system_score_gemma":0.00054577156,"threshold_uncertainty_score":0.9999821},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027549004,0.00042647275,0.9895108,0.0025804024,0.00086825574,0.0005191769,0.000003772312,0.0005608631,0.0055275126],"genre_scores_gemma":[0.025984472,0.00006768502,0.96545297,0.0059013166,0.0008910136,0.000019571418,0.00001301218,0.000051831157,0.0016181062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99509054,0.00006279489,0.0006762315,0.0019006854,0.0013155787,0.0009541489],"domain_scores_gemma":[0.99654555,0.0002727391,0.0003880553,0.0021455085,0.00040201584,0.00024612295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011342339,0.0006828838,0.00066180853,0.00068303756,0.00036077164,0.00078852725,0.004219195,0.00054602063,0.000041511605],"category_scores_gemma":[0.00007732004,0.00061396655,0.00023690643,0.0011610839,0.00079089927,0.0006146454,0.0006757957,0.0010973553,0.000064460146],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068655263,0.000044546116,0.000008935194,0.00002820293,0.000008415544,0.000100769736,0.00008019094,0.019322962,0.0002606772,0.033604216,0.00015546559,0.94637877],"study_design_scores_gemma":[0.00020163652,0.0001934718,0.00014707904,0.00037824738,0.000009204528,0.000035068115,4.4257014e-8,0.8205397,0.004552532,0.16529483,0.007839352,0.0008088362],"about_ca_topic_score_codex":0.000006260842,"about_ca_topic_score_gemma":0.000008667005,"teacher_disagreement_score":0.94556993,"about_ca_system_score_codex":0.0003984023,"about_ca_system_score_gemma":0.00079972134,"threshold_uncertainty_score":0.99963117},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024264294,0.0023083023,0.9957374,0.0000620311,0.0004692714,0.0002328551,0.000015460979,0.00020505642,0.0007270258],"genre_scores_gemma":[0.21552508,0.000041835174,0.7837531,0.00031396214,0.00024051043,0.0000028894565,0.000010656113,0.00006429932,0.000047685342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796283,0.0000085432675,0.00037675083,0.000741784,0.00039176378,0.0005183462],"domain_scores_gemma":[0.9985967,0.000565219,0.00006760072,0.00048083166,0.00016578723,0.00012380732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011680312,0.00042499686,0.00049626024,0.00053964567,0.00016481215,0.00016887936,0.00057268335,0.00040711585,0.000005062905],"category_scores_gemma":[0.000089215595,0.00040725584,0.00014089973,0.0002761002,0.00009185655,0.00012817036,0.0001245233,0.00067993166,0.0000016753745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037501393,0.0000022039737,0.0000015958994,0.00008319788,0.000014624407,0.000004471181,0.00014645763,0.81578904,0.00023009107,0.000033881588,0.000003618183,0.18368706],"study_design_scores_gemma":[0.00023197125,0.000033677006,2.566724e-7,0.00036879373,0.00003856377,0.0000047645485,3.5533407e-7,0.9692187,0.0019599337,0.02762296,0.000049139962,0.00047090012],"about_ca_topic_score_codex":0.000023807444,"about_ca_topic_score_gemma":0.00015089386,"teacher_disagreement_score":0.21528244,"about_ca_system_score_codex":0.00015912385,"about_ca_system_score_gemma":0.00010321457,"threshold_uncertainty_score":0.99983793},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007296428,0.0003586915,0.99628145,0.00004195359,0.00085161685,0.0013101323,0.000007419234,0.00027552084,0.0001435601],"genre_scores_gemma":[0.8803503,0.0000065019235,0.119099125,0.00017365933,0.00027493367,0.00003247938,0.0000065758854,0.00004509584,0.000011362325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984278,0.000015154746,0.0002754182,0.00056351325,0.00036021517,0.00035787188],"domain_scores_gemma":[0.9988186,0.00060076214,0.00007939983,0.0003051955,0.00010526092,0.000090787966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005543117,0.00033880307,0.00028828307,0.00054245745,0.00018057853,0.00013635831,0.00034251946,0.00035356535,0.0000021556668],"category_scores_gemma":[0.000025556163,0.00030334428,0.00006004189,0.00023983032,0.00018841753,0.0001145889,0.000053064112,0.00044813813,0.0000021773967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002385232,0.0000030705612,0.000006077192,0.00066786265,0.0000049938662,0.000006928473,0.0002460208,0.93649477,0.00025196627,0.000042561314,8.128832e-7,0.06225111],"study_design_scores_gemma":[0.0002597578,0.00011417186,0.00002125047,0.00090523047,0.000011273189,0.000017805427,3.4697203e-7,0.99424154,0.0013342259,0.0020736065,0.0006903049,0.0003304634],"about_ca_topic_score_codex":0.0000059221134,"about_ca_topic_score_gemma":0.00008919427,"teacher_disagreement_score":0.8796206,"about_ca_system_score_codex":0.00020650378,"about_ca_system_score_gemma":0.00009486835,"threshold_uncertainty_score":0.9999419},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005691333,0.002466883,0.9959477,0.00006422021,0.00048108565,0.0002813867,0.000111905225,0.000013212024,0.000064433836],"genre_scores_gemma":[0.3688888,0.00050713716,0.62742877,0.0003650196,0.0009989028,0.00002634639,0.0011105128,0.00004120458,0.0006333314],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977787,0.0000143297475,0.00030936027,0.0012510369,0.00033569202,0.00031087198],"domain_scores_gemma":[0.9975021,0.00011623089,0.00021331948,0.0018964801,0.00014802146,0.00012388702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048028867,0.0002812751,0.00028240506,0.00036662084,0.00014845612,0.0000852928,0.0014588453,0.00034069206,0.000025255169],"category_scores_gemma":[0.00018862459,0.00023441316,0.00012965531,0.00023746715,0.00019178,0.000017054786,0.00087760476,0.00015139273,0.0000053341087],"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.000036090016,0.00005826534,0.0007165383,0.000011676048,0.000034173583,8.7591764e-7,0.00004330409,0.0055958596,0.609663,0.000009415719,0.00029978564,0.38353103],"study_design_scores_gemma":[0.0012227707,0.00030206575,0.0037396527,0.00024923537,0.00029295223,0.000011804289,8.331712e-7,0.17840713,0.73828757,0.0017685315,0.07447304,0.0012444075],"about_ca_topic_score_codex":0.0000036822344,"about_ca_topic_score_gemma":0.00010469529,"teacher_disagreement_score":0.3822866,"about_ca_system_score_codex":0.00004195847,"about_ca_system_score_gemma":0.00016295929,"threshold_uncertainty_score":0.95590913},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06132349,0.00019319785,0.9263556,0.0015765582,0.0014525123,0.00077630865,0.000026888707,0.00014920247,0.008146257],"genre_scores_gemma":[0.9870696,0.0000013714465,0.009405855,0.0028330174,0.00037217978,0.0000061573755,0.0000036104375,0.000028557923,0.00027966054],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975937,0.000056890865,0.00042289862,0.00084557344,0.0005834017,0.0004975397],"domain_scores_gemma":[0.99862623,0.00064483564,0.00019137665,0.00039120094,0.00007185995,0.000074473886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017766209,0.0003100118,0.00028358726,0.0006709521,0.00067684904,0.00062083453,0.00082734355,0.00012496348,0.000017085344],"category_scores_gemma":[0.00017274545,0.00024489325,0.00008242334,0.00067949534,0.00046580317,0.00034055286,0.00028268277,0.0010561487,0.000019720715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004493734,0.00015346262,0.00021216438,0.000076033524,0.000005450214,0.0006881248,0.0054036533,0.18535563,0.48875257,0.0012240545,0.000052609867,0.3180313],"study_design_scores_gemma":[0.0003467996,0.0000925897,0.00069112726,0.0016623106,0.000019788136,0.00054845476,0.0000114400955,0.9197949,0.07317257,0.002026415,0.0007189672,0.0009146316],"about_ca_topic_score_codex":0.00012909461,"about_ca_topic_score_gemma":0.0005748306,"teacher_disagreement_score":0.9257461,"about_ca_system_score_codex":0.00031891646,"about_ca_system_score_gemma":0.00022041952,"threshold_uncertainty_score":0.99864566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024874061,0.00030856908,0.9712104,0.00029567763,0.0018494916,0.00061960897,0.000093431496,0.0002610058,0.0004877515],"genre_scores_gemma":[0.5652158,0.000040291114,0.43364087,0.00054468325,0.00036357052,0.00001948485,0.000010303978,0.000030372366,0.00013463503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99502605,0.00004639432,0.0009241811,0.0018548004,0.0013604389,0.0007881437],"domain_scores_gemma":[0.99613446,0.0004211153,0.00031104047,0.002499019,0.00034761202,0.00028673297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006297776,0.0006860036,0.0009020101,0.0010292112,0.00031353923,0.00025214296,0.0043967604,0.00043512203,0.000056433226],"category_scores_gemma":[0.00007412647,0.0005801117,0.00021066034,0.000879788,0.000653377,0.0006452391,0.0012096263,0.00083127414,0.000088014865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014775126,0.00003034033,0.00014166115,0.000059048227,0.000013878171,0.000009699862,0.0019022101,0.40368608,0.00003165185,0.0006586804,0.00002486666,0.5934271],"study_design_scores_gemma":[0.0005351651,0.0005182283,0.0036367709,0.0019542212,0.000025885725,0.000071597286,5.5117164e-7,0.5587064,0.0033758502,0.4291089,0.00054825674,0.0015181771],"about_ca_topic_score_codex":0.00050533656,"about_ca_topic_score_gemma":0.00012511913,"teacher_disagreement_score":0.59190893,"about_ca_system_score_codex":0.00029519756,"about_ca_system_score_gemma":0.00072090817,"threshold_uncertainty_score":0.999665},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011343061,0.0008951548,0.995596,0.00022636793,0.00080962287,0.0005777566,0.000053935535,0.00018572263,0.00052117155],"genre_scores_gemma":[0.038965594,0.0003624991,0.95894027,0.0011244636,0.00036310015,0.000007968301,0.000060159568,0.000039742266,0.00013622525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554914,0.00006662994,0.0007799778,0.0017972321,0.0009816488,0.0008253845],"domain_scores_gemma":[0.9976305,0.0004067412,0.0003870609,0.0011161324,0.00021298096,0.00024660013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016788214,0.0005898317,0.0006351857,0.0012023156,0.00026209824,0.00045356812,0.002132281,0.0002926075,0.000011469513],"category_scores_gemma":[0.00015380506,0.00055248296,0.00010741601,0.0011241045,0.0016939341,0.0009308523,0.00086434395,0.0009790066,0.000007210829],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009105553,0.00023907109,0.0006922766,0.00025922278,0.000018919945,0.0006817816,0.0013262171,0.00026435964,0.0135821365,0.037245218,0.000104330335,0.9454954],"study_design_scores_gemma":[0.0011849116,0.0006415751,0.0014906336,0.001291184,0.000034237073,0.00068500376,0.0000014159494,0.8617247,0.082217395,0.034002576,0.013856079,0.0028703285],"about_ca_topic_score_codex":0.00006503761,"about_ca_topic_score_gemma":0.000049967308,"teacher_disagreement_score":0.9426251,"about_ca_system_score_codex":0.0006401697,"about_ca_system_score_gemma":0.000546304,"threshold_uncertainty_score":0.9996927},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010114939,0.0002663525,0.9930614,0.00040919287,0.0018082306,0.00074420363,0.000004256251,0.00027755462,0.0033276374],"genre_scores_gemma":[0.15703075,0.000027037024,0.8404687,0.0011318602,0.00070898194,0.00003338641,0.000008262997,0.000051242776,0.0005397633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996247,0.000020219743,0.00072119624,0.0014314601,0.0008483105,0.00073184405],"domain_scores_gemma":[0.99675894,0.0008492317,0.0003592386,0.0014817946,0.00039030792,0.00016048914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001385737,0.00045827345,0.00043800677,0.00080270134,0.00026793437,0.0006240228,0.0035635452,0.00036799666,0.000036414105],"category_scores_gemma":[0.00018070408,0.00044053028,0.0001488099,0.00056443375,0.00068254326,0.00066586555,0.00048874476,0.0004992373,0.000109410095],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025234701,0.000017121178,0.0000059071335,0.00003246194,0.000005044347,0.000012634079,0.0003885672,0.011797889,0.00013252412,0.063854516,0.000023879331,0.9237269],"study_design_scores_gemma":[0.000050869563,0.00015363363,0.000037552185,0.000146153,0.000004722422,0.000018860423,2.795918e-7,0.70529544,0.0058561657,0.28658855,0.0014360707,0.00041168093],"about_ca_topic_score_codex":0.000019541923,"about_ca_topic_score_gemma":0.00009166198,"teacher_disagreement_score":0.9233152,"about_ca_system_score_codex":0.00035616528,"about_ca_system_score_gemma":0.0006060041,"threshold_uncertainty_score":0.9998047},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9460645,0.000050593084,0.052710224,0.0008032417,0.00021214897,0.000116946736,8.495715e-7,0.000021598258,0.000019899428],"genre_scores_gemma":[0.9901164,0.0000123310565,0.009362193,0.00035698406,0.00013748865,0.0000026591767,0.0000070784977,0.0000045981224,2.7069703e-7],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989493,0.000036220295,0.00021908387,0.00039707715,0.00021643806,0.00018190272],"domain_scores_gemma":[0.9980845,0.0015918401,0.000050975937,0.00013229111,0.00005551212,0.00008488953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005726892,0.00009382172,0.00018664246,0.00020498146,0.000060888753,0.00008420337,0.000060968017,0.000095960364,0.000017045486],"category_scores_gemma":[0.0006539994,0.00007775837,0.000021196302,0.00047060495,0.00025722853,0.00020029387,0.000045764133,0.00028825778,0.0000013180259],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028509814,0.000034782446,0.4795201,0.000006940647,0.0000013511576,0.000045544082,0.00085040234,0.00027396492,0.006182326,0.000029121484,1.8207798e-7,0.5130268],"study_design_scores_gemma":[0.0007346649,0.000021221997,0.8375451,0.00006853109,0.0000029013638,0.000019904606,0.0000035155344,0.15903962,0.0016879297,0.0007572542,0.000036029058,0.00008332758],"about_ca_topic_score_codex":0.000040398325,"about_ca_topic_score_gemma":0.00015472827,"teacher_disagreement_score":0.51294345,"about_ca_system_score_codex":0.000024967136,"about_ca_system_score_gemma":0.00007718498,"threshold_uncertainty_score":0.3170894},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038800377,0.00013287952,0.99425894,0.00016175513,0.002808014,0.0008353093,0.000004697829,0.0001882909,0.0012220894],"genre_scores_gemma":[0.41064528,0.000004041664,0.5856292,0.00086753175,0.0013322086,0.00004857126,0.00002581477,0.000050929157,0.0013964269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654084,0.00006397636,0.00060209964,0.0015294123,0.00059652753,0.0006671306],"domain_scores_gemma":[0.9979973,0.0004681514,0.0005251149,0.00069445546,0.00020825239,0.00010674165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011883769,0.00044118383,0.00048889255,0.0005989121,0.00052317133,0.00044867696,0.0015985365,0.00036638646,0.000009307661],"category_scores_gemma":[0.00009907367,0.00042489922,0.00014580337,0.00021825006,0.00017712421,0.0006641895,0.000432754,0.0005643,0.00001371223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008162328,0.000052219548,0.00063223956,0.00014084773,0.000018392137,0.000012074524,0.0012083579,0.024583846,0.0017261688,0.034150638,0.00046526417,0.93700176],"study_design_scores_gemma":[0.00044080135,0.00017590617,0.00043360333,0.00016087004,0.000008919145,0.000042083728,1.417003e-7,0.9775502,0.0009661587,0.013192675,0.0065007964,0.0005278645],"about_ca_topic_score_codex":0.0011301917,"about_ca_topic_score_gemma":0.00079851144,"teacher_disagreement_score":0.95296633,"about_ca_system_score_codex":0.0004770558,"about_ca_system_score_gemma":0.00031122522,"threshold_uncertainty_score":0.9998203},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030467447,0.0012132862,0.53813845,0.014928244,0.027591098,0.0017890667,0.000034001772,0.0002314785,0.41302764],"genre_scores_gemma":[0.9035184,0.00010183127,0.03515469,0.043521058,0.0078257695,0.00010996782,0.00009596623,0.00014586354,0.009526455],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982261,0.000061862964,0.0002713653,0.0006768156,0.00040868082,0.00035518903],"domain_scores_gemma":[0.9984515,0.0006585464,0.00015704198,0.0005728967,0.000106252795,0.000053811586],"candidate_categories":["research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00056103634,0.0002876213,0.000269812,0.00040585326,0.00016556261,0.00017930688,0.00089962204,0.000752585,0.001205943],"category_scores_gemma":[0.000110836416,0.00020951184,0.0001046014,0.0002841369,0.0004643406,0.00010830435,0.00009149559,0.0026989568,0.00041124664],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059815455,0.00012094394,0.00021691412,0.000018622966,0.000023257793,0.0002825016,0.018870987,0.00018015635,0.00028850106,0.013269349,0.00070008566,0.96596885],"study_design_scores_gemma":[0.0017245106,0.0006491651,0.019433027,0.0011497685,0.00008979754,0.0010478075,0.000045147048,0.0024906334,0.00030985486,0.84315753,0.1276941,0.0022086313],"about_ca_topic_score_codex":0.000101099635,"about_ca_topic_score_gemma":0.0011964992,"teacher_disagreement_score":0.96376026,"about_ca_system_score_codex":0.000094631774,"about_ca_system_score_gemma":0.00010074369,"threshold_uncertainty_score":0.9997071},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005753021,0.0009943163,0.9748605,0.001461016,0.002291212,0.0004633454,0.0000013497182,0.0004222721,0.019448485],"genre_scores_gemma":[0.32755673,0.00016773098,0.66113305,0.0056719966,0.0016925572,0.000015624488,0.00002197744,0.00008808013,0.003652284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949661,0.0000538587,0.00058490294,0.0020474733,0.0011653691,0.0011823212],"domain_scores_gemma":[0.9970126,0.00027737525,0.00034755628,0.0017259673,0.00034819244,0.0002882689],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009743605,0.00079511566,0.0007340396,0.00072424294,0.00040989037,0.001082814,0.004438567,0.00051483314,0.00002349587],"category_scores_gemma":[0.00006833955,0.0006579547,0.00023965687,0.00094694056,0.0007854074,0.000656698,0.0013894691,0.0010864012,0.00012840713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031404134,0.00006541749,0.00008219077,0.000037763813,0.000017246672,0.0001921851,0.0012558177,0.008749274,0.00003810635,0.2419132,0.00006145719,0.7475842],"study_design_scores_gemma":[0.00034979265,0.00042405014,0.00018275311,0.0004965891,0.000020308891,0.00021233417,6.2177855e-7,0.29833913,0.00039371024,0.6904249,0.007829491,0.001326299],"about_ca_topic_score_codex":0.00001589459,"about_ca_topic_score_gemma":0.000096265365,"teacher_disagreement_score":0.7462579,"about_ca_system_score_codex":0.00032747994,"about_ca_system_score_gemma":0.00056922,"threshold_uncertainty_score":0.99995416},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029691339,0.0008232151,0.9840315,0.0010426347,0.0017512969,0.0002816947,0.000005047475,0.00024348297,0.01179142],"genre_scores_gemma":[0.15053973,0.00013636064,0.8324443,0.0143751865,0.0005418407,0.000024589552,0.000014205627,0.000109764886,0.0018139848],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634016,0.000069191454,0.00050633686,0.0014258772,0.0009173263,0.00074112444],"domain_scores_gemma":[0.99693537,0.0006475721,0.0002838628,0.001692177,0.000251934,0.00018907715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010297179,0.00060457573,0.0005938149,0.00062156306,0.00033397943,0.0006949388,0.004204224,0.00031125324,0.00004136628],"category_scores_gemma":[0.00008752286,0.0005326752,0.00013924761,0.00063858257,0.001300618,0.0007293398,0.0012953049,0.0008967426,0.0001088984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004206155,0.000033751792,0.000018348434,0.00003212319,0.000018409604,0.00020407383,0.0018758482,0.007504558,0.000063986074,0.39674655,0.00014704454,0.5933511],"study_design_scores_gemma":[0.0002443335,0.00017230472,0.000032291013,0.0002353419,0.0000069532853,0.0001437249,5.822885e-7,0.15476505,0.0017936828,0.83660907,0.005160937,0.0008357484],"about_ca_topic_score_codex":0.000022977041,"about_ca_topic_score_gemma":0.000041187872,"teacher_disagreement_score":0.59251535,"about_ca_system_score_codex":0.0002850641,"about_ca_system_score_gemma":0.0005297822,"threshold_uncertainty_score":0.99971247},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003329332,0.00025353947,0.99260384,0.00019288588,0.0007999184,0.00066325563,0.000005314117,0.00020829069,0.0019435997],"genre_scores_gemma":[0.45059013,0.000010105099,0.54643345,0.00078521133,0.0009709445,0.000019024457,0.0000021754333,0.00005784256,0.0011311269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99469656,0.0000881319,0.00079932803,0.0020757583,0.0012804783,0.0010597314],"domain_scores_gemma":[0.99761015,0.0003562751,0.0003768452,0.0008356738,0.0005034444,0.00031760137],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012895776,0.0007740709,0.0009792149,0.001105743,0.0006246842,0.000921625,0.0022450124,0.00038277634,0.000059105634],"category_scores_gemma":[0.00014262421,0.00066623517,0.00036497522,0.00074151595,0.00027758142,0.00087240135,0.0019938203,0.0013989446,0.00005365145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023309301,0.00015082025,0.0011097256,0.00016215707,0.00035839935,0.0008195857,0.0067983107,0.66454744,0.0035394197,0.046123438,0.000004140172,0.27636325],"study_design_scores_gemma":[0.0019543061,0.0018516222,0.007866454,0.009512083,0.0014597452,0.0015863025,0.000012328081,0.8603386,0.036958642,0.0521764,0.013340157,0.01294333],"about_ca_topic_score_codex":0.00009711055,"about_ca_topic_score_gemma":0.0000857431,"teacher_disagreement_score":0.4472608,"about_ca_system_score_codex":0.00062338373,"about_ca_system_score_gemma":0.00036405845,"threshold_uncertainty_score":0.9995789},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016751846,0.0009371186,0.98421836,0.0010596935,0.00073902134,0.00014112874,0.000011215342,0.0002519804,0.012473952],"genre_scores_gemma":[0.2183725,0.00003750016,0.77480835,0.0030375556,0.0012336277,0.000004289061,0.000015775726,0.000053954645,0.0024364376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956335,0.00003433516,0.00054600375,0.0018542745,0.0011293228,0.0008025822],"domain_scores_gemma":[0.9968588,0.00030371716,0.00032407133,0.0021924907,0.00014666757,0.00017428987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009497963,0.0005804412,0.00063292583,0.0011507084,0.000232822,0.00093298935,0.004888758,0.00031422178,0.00009271839],"category_scores_gemma":[0.00012947945,0.00052896305,0.00022281474,0.00092908123,0.00046462115,0.0008263091,0.001912659,0.0008933905,0.00027747208],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002878939,0.000027397255,0.000037404938,0.000024058685,0.000025316176,0.00026410297,0.0016036627,0.006184204,0.00020873935,0.009615663,0.00011028523,0.9818963],"study_design_scores_gemma":[0.0005064034,0.00019704415,0.000115659415,0.001239107,0.000046575162,0.00030097592,0.000001754183,0.94941515,0.002031594,0.022629106,0.021540709,0.001975896],"about_ca_topic_score_codex":0.000020500762,"about_ca_topic_score_gemma":0.00008310162,"teacher_disagreement_score":0.9799204,"about_ca_system_score_codex":0.00025623376,"about_ca_system_score_gemma":0.00044827367,"threshold_uncertainty_score":0.9997162},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003655377,0.00036662156,0.994286,0.0012458115,0.001771261,0.0007711062,0.00001000111,0.0003776915,0.0011678495],"genre_scores_gemma":[0.0022811084,0.0000726187,0.99257565,0.003485691,0.00057689135,0.000042670727,0.00002373243,0.000036177793,0.0009054464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99493104,0.000032609863,0.0008592688,0.0014711451,0.0020823348,0.0006236016],"domain_scores_gemma":[0.99670535,0.0009817302,0.00035883574,0.0011940558,0.00041629412,0.00034371373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031337377,0.00040210746,0.00042439235,0.00087141857,0.00028650297,0.0006854228,0.003819046,0.00046599656,0.000084959676],"category_scores_gemma":[0.0007158783,0.0003762661,0.00014643346,0.00044560243,0.0013744972,0.0008101193,0.0009285363,0.0007235252,0.000047820817],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034376144,0.000028116938,0.0000067492797,0.000047128386,0.0000054943575,0.00004633636,0.00019099396,0.00005317754,0.0005144407,0.0028419537,0.00035714358,0.99590504],"study_design_scores_gemma":[0.0011068844,0.00038026218,0.00029586363,0.0010459239,0.000022622777,0.00020859095,4.2979704e-7,0.5104857,0.14756408,0.32881042,0.0084014535,0.0016777971],"about_ca_topic_score_codex":0.000013066244,"about_ca_topic_score_gemma":0.00003795816,"teacher_disagreement_score":0.99422723,"about_ca_system_score_codex":0.0003047645,"about_ca_system_score_gemma":0.00078105787,"threshold_uncertainty_score":0.9998689},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000044825833,0.001223849,0.9892521,0.0017747602,0.0035912485,0.0013618629,0.000021055777,0.00025409358,0.002516567],"genre_scores_gemma":[0.002462498,0.000109740075,0.99322647,0.0020666674,0.0013799604,0.000046205307,0.000007741219,0.00004922281,0.00065148005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99473524,0.000032708343,0.0007325579,0.0019243901,0.0013838192,0.0011912792],"domain_scores_gemma":[0.9946157,0.002121312,0.00037310252,0.0021980645,0.0004731854,0.00021864117],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00290977,0.0007074192,0.000620035,0.00074867374,0.00095075864,0.00093296805,0.007047702,0.0004183058,0.000018037941],"category_scores_gemma":[0.000103249135,0.0005297816,0.0003504981,0.0010380264,0.0014841815,0.0005910992,0.0019589413,0.0012824233,0.000026360556],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006110049,0.00003092485,0.000013152207,0.000041041832,0.000019392282,0.000027038504,0.00044307616,0.0024317421,0.000008996905,0.1070016,0.00006530747,0.8899116],"study_design_scores_gemma":[0.00031607307,0.00018795759,0.0001083445,0.00017693653,0.000014708346,0.000075702104,2.4150768e-7,0.51787144,0.0003314492,0.45147088,0.028761327,0.00068496674],"about_ca_topic_score_codex":0.000051351923,"about_ca_topic_score_gemma":0.00024919523,"teacher_disagreement_score":0.8892267,"about_ca_system_score_codex":0.00028692925,"about_ca_system_score_gemma":0.0006608829,"threshold_uncertainty_score":0.9997154},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005496119,0.00043689072,0.9937976,0.0008128103,0.0010617294,0.00028255658,0.0000019902548,0.0006251251,0.002975776],"genre_scores_gemma":[0.01129375,0.0000556718,0.9873433,0.0008401769,0.00024226561,0.000014874276,0.0000014517577,0.000040483654,0.00016799207],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970459,0.00002601227,0.0003428426,0.001295224,0.0007293239,0.000560699],"domain_scores_gemma":[0.9969752,0.0009109377,0.0002390223,0.0015455215,0.00018177288,0.00014758306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001082118,0.0005207654,0.00044697608,0.0006128562,0.00020496237,0.0006347279,0.0032492597,0.00028684296,0.000050280716],"category_scores_gemma":[0.00010498116,0.000417006,0.00009316611,0.0005822957,0.00039197213,0.0009388282,0.00094321935,0.0009090109,0.000027341084],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011345363,0.000040433133,0.000047508573,0.00011588569,0.00003097045,0.00032852188,0.0010984549,0.21085916,0.00003479991,0.06372497,0.000046085624,0.72366184],"study_design_scores_gemma":[0.0005188135,0.0009229867,0.00012081928,0.0019502824,0.000029281808,0.0005785737,1.2719268e-7,0.3860376,0.004823149,0.5444998,0.058376603,0.0021419632],"about_ca_topic_score_codex":0.000050742314,"about_ca_topic_score_gemma":0.00005063033,"teacher_disagreement_score":0.7215199,"about_ca_system_score_codex":0.00034695186,"about_ca_system_score_gemma":0.00047762366,"threshold_uncertainty_score":0.99982816},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016100863,0.00074043963,0.99456364,0.0013518633,0.0012788071,0.00073896925,0.000017003078,0.00007779161,0.0012153684],"genre_scores_gemma":[0.016565237,0.00002475663,0.9800159,0.0027568934,0.00042880437,0.00001745176,0.0000036470083,0.000023401737,0.00016390844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967753,0.000040446863,0.00056010426,0.0011747144,0.0007834675,0.0006659168],"domain_scores_gemma":[0.9967197,0.0011145069,0.0004019083,0.001368765,0.0002787392,0.000116359086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095311354,0.00046810607,0.0005860538,0.00034019165,0.00027884723,0.0004913865,0.0040016775,0.00026732287,0.0000056390563],"category_scores_gemma":[0.000084709434,0.00031444448,0.00022809186,0.00051041535,0.0007967728,0.00040800287,0.00082862773,0.00055522623,0.0000040820373],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022190134,0.000023595025,0.000001888759,0.0000126939285,0.000009844469,0.000014547704,0.00073356665,0.003687247,0.000015196213,0.017193992,0.000046738776,0.9782585],"study_design_scores_gemma":[0.0003045598,0.00036211076,0.000029702998,0.00021101497,0.000014114827,0.000041972366,2.9996173e-7,0.80170304,0.0005662319,0.19287933,0.00348125,0.0004063763],"about_ca_topic_score_codex":0.000016518994,"about_ca_topic_score_gemma":0.000013473956,"teacher_disagreement_score":0.9778521,"about_ca_system_score_codex":0.00010786394,"about_ca_system_score_gemma":0.0003124113,"threshold_uncertainty_score":0.99993074},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022579763,0.00004550346,0.93800265,0.000049336555,0.00039783726,0.060998984,0.000004554883,0.00006189276,0.00021347293],"genre_scores_gemma":[0.8399061,0.0000058672717,0.11536621,0.00038975343,0.00024344742,0.04401187,0.0000040842788,0.000051380663,0.00002126834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958984,0.000118777185,0.0006143127,0.0014505648,0.0012989737,0.0006189267],"domain_scores_gemma":[0.9966423,0.0007288105,0.00074285216,0.0009834776,0.0007690816,0.00013347805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029411702,0.0005560295,0.00066319096,0.00024845504,0.00029173977,0.00026979763,0.0011504233,0.00025985815,0.000005117271],"category_scores_gemma":[0.00004678039,0.00045854395,0.000070292954,0.0003964568,0.00050598884,0.000503524,0.00019900304,0.00053386204,8.178286e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073980635,0.00002979756,0.000063151565,0.00006925321,0.000013823256,0.0000024876285,0.00010548546,0.68923444,0.000043164684,0.03366412,0.0000035259827,0.27669674],"study_design_scores_gemma":[0.0027972949,0.0012343446,0.00012482166,0.0012960084,0.000030254194,0.00002300183,1.4999692e-7,0.97432053,0.00057991233,0.019022057,0.00007089244,0.00050070434],"about_ca_topic_score_codex":0.0000039802308,"about_ca_topic_score_gemma":0.00003804595,"teacher_disagreement_score":0.8396803,"about_ca_system_score_codex":0.00030791687,"about_ca_system_score_gemma":0.00047556724,"threshold_uncertainty_score":0.9997866},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012271268,0.006741815,0.98859036,0.000071260736,0.003017552,0.00061384944,0.00000612959,0.00022438387,0.000611916],"genre_scores_gemma":[0.34800592,0.00003178748,0.6512933,0.0002827495,0.00024024157,0.000021040127,0.0000071974623,0.00005044384,0.00006737186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942368,0.0001076378,0.001318066,0.0014652938,0.0019279857,0.00094417954],"domain_scores_gemma":[0.99543,0.0008617073,0.00079918443,0.002143633,0.00049241405,0.0002730559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002389715,0.0007212318,0.0010798558,0.0012122588,0.0002354271,0.00032692117,0.005059107,0.00040116752,0.00001778291],"category_scores_gemma":[0.00010296208,0.0006570073,0.00016558808,0.0007752095,0.0007144177,0.0004638156,0.0015048288,0.0006576894,0.00007283953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007463651,0.000077558005,0.00017819057,0.001045447,0.000031495365,0.000050490522,0.0010821688,0.19443643,0.00014092718,0.034315903,0.000011135657,0.76862276],"study_design_scores_gemma":[0.0006189654,0.00014514421,0.000097518256,0.0065213307,0.00002668315,0.00015013768,3.500438e-7,0.967998,0.0038402,0.01272589,0.006153639,0.0017221195],"about_ca_topic_score_codex":0.000014953917,"about_ca_topic_score_gemma":0.000007889976,"teacher_disagreement_score":0.7735616,"about_ca_system_score_codex":0.00065417314,"about_ca_system_score_gemma":0.001361793,"threshold_uncertainty_score":0.99958813},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000112381385,0.0001535099,0.99588406,0.00026866028,0.0007053752,0.0007206932,0.000007003843,0.000159823,0.0019885015],"genre_scores_gemma":[0.053150762,0.000022473638,0.9455079,0.000817046,0.00039528264,0.000018765795,0.000012864847,0.000025842035,0.00004905836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644226,0.00001825592,0.00051587675,0.0015080775,0.00101381,0.00050170626],"domain_scores_gemma":[0.9971622,0.00026695497,0.00036255652,0.0018968397,0.00017633574,0.00013509287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009945107,0.0003753916,0.00029097905,0.0009488971,0.00031905997,0.0006576325,0.0030696625,0.00027680266,0.000010609406],"category_scores_gemma":[0.000041864845,0.0003845895,0.000074900425,0.0009846737,0.00026614126,0.0008342412,0.0016742239,0.0005463329,0.000048962378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017816216,0.000026393329,0.000048208367,0.000023046518,0.000008138234,0.00000894721,0.00008091255,0.03267577,0.00041678097,0.34593165,0.000012200563,0.62076616],"study_design_scores_gemma":[0.000094248426,0.000023020313,0.00010021276,0.00015405187,0.00000782113,0.000009421814,8.4413806e-8,0.7182306,0.0005306083,0.27665508,0.0038458027,0.00034905932],"about_ca_topic_score_codex":0.000046083976,"about_ca_topic_score_gemma":0.000021864735,"teacher_disagreement_score":0.6855548,"about_ca_system_score_codex":0.0004299904,"about_ca_system_score_gemma":0.00023291787,"threshold_uncertainty_score":0.9998606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013824052,0.0011019685,0.9925131,0.0019673381,0.0011767315,0.0004971826,0.00000439346,0.0002414038,0.0023596424],"genre_scores_gemma":[0.8083228,0.00023774795,0.18121293,0.0070193694,0.0018275707,0.00007914842,0.00003432445,0.00009718694,0.0011689094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964863,0.00003129982,0.000535052,0.0014547535,0.00069357647,0.00079901284],"domain_scores_gemma":[0.9979026,0.0002539371,0.0002624166,0.0011202581,0.0002512808,0.00020951251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036553186,0.00055759406,0.00046551245,0.00040789982,0.0005126632,0.000796086,0.0030222395,0.00020305383,0.000019532736],"category_scores_gemma":[0.000012840448,0.00043696465,0.00015285195,0.00085948186,0.0006799088,0.00058023573,0.0011101136,0.0007718549,0.000021666507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022134857,0.000020685251,0.000017253085,0.000006383402,0.000006115878,0.000019607445,0.000103450584,0.6640758,0.000007688878,0.016779544,0.000099993995,0.31886125],"study_design_scores_gemma":[0.00013082022,0.00007734536,0.000055967605,0.00012598465,0.0000045416505,0.00009764489,9.107992e-8,0.89662135,0.000037659327,0.098259516,0.004118,0.0004711054],"about_ca_topic_score_codex":0.000019510808,"about_ca_topic_score_gemma":0.000051685896,"teacher_disagreement_score":0.81130016,"about_ca_system_score_codex":0.00019958476,"about_ca_system_score_gemma":0.00021891369,"threshold_uncertainty_score":0.9998082},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008146332,0.0007006214,0.9952456,0.00090744847,0.0015235498,0.0010594437,0.000015453856,0.00024484878,0.00022161276],"genre_scores_gemma":[0.011120473,0.00007067908,0.9878736,0.0006516903,0.000032079133,0.00004456104,0.000011679018,0.000030119598,0.00016512885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970302,0.00008333936,0.000561356,0.0011011322,0.00076127046,0.00046271592],"domain_scores_gemma":[0.9975008,0.00053744897,0.0002680992,0.0013685505,0.00021635447,0.00010874155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001005753,0.0004508677,0.00045536822,0.00047358606,0.0001864481,0.00018187349,0.0018757976,0.00016712303,0.0000018836663],"category_scores_gemma":[0.00007867252,0.00034492108,0.00005680275,0.0010518188,0.00024392242,0.00014129268,0.0011899297,0.00044015382,0.0000053316608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005147119,0.000007509669,0.000005982621,0.00026101517,0.00004944812,0.0000406142,0.0004562861,0.8021826,0.000009879112,0.038328897,0.00001126742,0.15864135],"study_design_scores_gemma":[0.0019109143,0.0007147099,0.0028743816,0.0068091885,0.00020044997,0.00038732364,0.000018967097,0.43033177,0.0019900892,0.5329073,0.018362315,0.0034926066],"about_ca_topic_score_codex":0.000006960161,"about_ca_topic_score_gemma":0.0000060832667,"teacher_disagreement_score":0.4945784,"about_ca_system_score_codex":0.0001716634,"about_ca_system_score_gemma":0.000039923427,"threshold_uncertainty_score":0.9999003},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018129263,0.00013752498,0.9908921,0.0044958275,0.00061068195,0.00021364985,0.00002073784,0.0001991289,0.0032490543],"genre_scores_gemma":[0.27444866,0.000042469423,0.7155328,0.007958628,0.00061321247,0.000019311392,0.000016923337,0.000064386906,0.0013036454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952608,0.00007260671,0.00048668333,0.0019163928,0.0014613352,0.0008022112],"domain_scores_gemma":[0.99654037,0.0009385483,0.00019826599,0.0018725205,0.0001520444,0.0002982607],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001167484,0.0006014308,0.0006371252,0.0017686575,0.0004615523,0.0011005539,0.0037975598,0.00027210984,0.00006721223],"category_scores_gemma":[0.0002873261,0.00053669495,0.0001871673,0.0011908904,0.0005087567,0.0005768954,0.00092915446,0.0008277013,0.00014956213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008466676,0.0000522146,0.00028869763,0.00006116087,0.000022826624,0.00022056338,0.0014912906,0.22560357,0.00010703667,0.007580612,0.00047312948,0.7640904],"study_design_scores_gemma":[0.00016096493,0.00033133882,0.00017268764,0.00082463585,0.000011629465,0.000013612669,5.3469194e-7,0.98236203,0.0014550452,0.009603576,0.004202298,0.00086164364],"about_ca_topic_score_codex":0.00004551803,"about_ca_topic_score_gemma":0.00008412842,"teacher_disagreement_score":0.7632288,"about_ca_system_score_codex":0.0002758415,"about_ca_system_score_gemma":0.00037373198,"threshold_uncertainty_score":0.9999364},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010911784,0.000055619243,0.9739942,0.0007547671,0.0010589779,0.020556787,0.0000022323593,0.00030344215,0.0032630763],"genre_scores_gemma":[0.5615032,0.0000067957553,0.42251748,0.001882704,0.0016211764,0.012034687,0.0000043754667,0.00011036338,0.00031924417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99474984,0.000068401816,0.0007653327,0.0019322156,0.0014625804,0.0010216091],"domain_scores_gemma":[0.99587166,0.00078900007,0.0006106594,0.0022076727,0.00033840231,0.00018258783],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014137792,0.000695657,0.00050211855,0.000309575,0.00073635887,0.0011911184,0.006233239,0.0003098498,0.000026038802],"category_scores_gemma":[0.00020113387,0.0005303585,0.00015835885,0.0010592086,0.0010022557,0.0008577591,0.0017951985,0.0014611045,0.00004143455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075957073,0.000029274519,0.0000542778,0.000077318175,0.000011072409,0.00017440243,0.001287769,0.24756771,0.00008953554,0.3970677,0.000009997702,0.35362333],"study_design_scores_gemma":[0.00047509975,0.00014797116,0.00017717626,0.0012877289,0.0000065797885,0.00013413835,1.764931e-7,0.661806,0.0012721419,0.33251014,0.0012724779,0.0009103695],"about_ca_topic_score_codex":0.000030952393,"about_ca_topic_score_gemma":0.0001136887,"teacher_disagreement_score":0.56149226,"about_ca_system_score_codex":0.0010330821,"about_ca_system_score_gemma":0.0012169838,"threshold_uncertainty_score":0.99984574},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015951249,0.00015203378,0.98770636,0.00091093784,0.0028207947,0.000545854,0.000008885795,0.0002643799,0.007431214],"genre_scores_gemma":[0.05631419,0.000063910964,0.9386558,0.0026993942,0.0009861783,0.00003570257,0.000007545749,0.000112193935,0.0011250919],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939331,0.000062320476,0.00054607855,0.002390076,0.0018832148,0.0011852501],"domain_scores_gemma":[0.9949691,0.0008578011,0.00024310786,0.0032550204,0.0002950632,0.00037989882],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001446384,0.00073159405,0.00062551454,0.0014177377,0.00044179324,0.00064610806,0.006676265,0.00051329785,0.00007565688],"category_scores_gemma":[0.0002343023,0.00062781177,0.00022455196,0.00086848775,0.0012470927,0.00066197745,0.0025906505,0.0028450983,0.00033249147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014266311,0.00004602248,0.0000105111185,0.00002254121,0.000007623961,0.0002462263,0.00033201906,0.0072967927,0.0012421972,0.115080625,0.00000901633,0.8756921],"study_design_scores_gemma":[0.00024940778,0.00034086354,0.00004306539,0.00024465288,0.0000028233658,0.00007341748,6.878283e-8,0.14281924,0.0044183205,0.8460973,0.0049373438,0.00077348214],"about_ca_topic_score_codex":0.000007005413,"about_ca_topic_score_gemma":0.00008183303,"teacher_disagreement_score":0.8749187,"about_ca_system_score_codex":0.0002901988,"about_ca_system_score_gemma":0.0005450833,"threshold_uncertainty_score":0.99961734},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058912724,0.00028674293,0.99592096,0.00020680092,0.0014624436,0.00051247043,0.00003276073,0.00026004485,0.00072865415],"genre_scores_gemma":[0.08528615,0.00007483145,0.91364825,0.00054299354,0.00025610786,0.00002550892,0.000051100564,0.000037860627,0.00007719583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959238,0.00008046496,0.0007561753,0.0016300535,0.00095822697,0.00065127085],"domain_scores_gemma":[0.99700034,0.0003792527,0.00045754673,0.0017291238,0.00029145443,0.00014226217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006811395,0.0005104422,0.0004907923,0.001286116,0.00035080285,0.00038247154,0.0032804173,0.00045303674,0.00004155969],"category_scores_gemma":[0.00045927355,0.00053529703,0.0001013859,0.0011309799,0.00062769535,0.0015683993,0.00072187075,0.0011053128,0.000039485993],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011304484,0.0000614491,0.00047827832,0.00011363765,0.000013405934,0.00015513378,0.005270863,0.07376811,0.0014599555,0.04682516,0.000100597426,0.8717421],"study_design_scores_gemma":[0.0007056426,0.00019797469,0.008026625,0.0011233424,0.000010213291,0.00038377687,0.000001334564,0.7664926,0.007486303,0.21092927,0.0027437294,0.0018991492],"about_ca_topic_score_codex":0.000022053002,"about_ca_topic_score_gemma":0.0000562961,"teacher_disagreement_score":0.86984295,"about_ca_system_score_codex":0.0006297886,"about_ca_system_score_gemma":0.0005723157,"threshold_uncertainty_score":0.99970984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006881817,0.0042358944,0.9878662,0.0009882186,0.0024286136,0.00028233122,0.00000295313,0.00018198583,0.0033255836],"genre_scores_gemma":[0.25942576,0.0010675262,0.73546016,0.0019107169,0.0009987617,0.000011744642,0.000004250971,0.00007801454,0.0010430855],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960064,0.00004875841,0.000735714,0.0011924041,0.0011371357,0.00087955105],"domain_scores_gemma":[0.9953037,0.0019455028,0.000381324,0.001958167,0.00027889843,0.00013243147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023498803,0.00050807,0.0006065175,0.0007456279,0.000380433,0.00039723047,0.004979216,0.0003584469,0.000008603274],"category_scores_gemma":[0.0003062212,0.00036688306,0.00018871171,0.00071134616,0.0012602685,0.00041735888,0.001633483,0.00083184947,0.00002227364],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016595426,0.000017772394,0.00009665245,0.000040740062,0.000018400822,0.00012168217,0.00061636016,0.0042565144,0.00029296934,0.033822794,0.000036209272,0.9606633],"study_design_scores_gemma":[0.0010833998,0.00086698105,0.0045574554,0.0017575497,0.000044781656,0.0005793658,0.000005356531,0.4029432,0.030735645,0.52507716,0.029557437,0.002791702],"about_ca_topic_score_codex":0.000053784875,"about_ca_topic_score_gemma":0.00018702935,"teacher_disagreement_score":0.9578716,"about_ca_system_score_codex":0.00017367076,"about_ca_system_score_gemma":0.00051837397,"threshold_uncertainty_score":0.9998783},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002210438,0.0002497995,0.994198,0.0008680336,0.0009390392,0.0013655778,0.0000024063677,0.00066018023,0.0016948619],"genre_scores_gemma":[0.019326964,0.00002492288,0.976577,0.0033441025,0.00049811235,0.00002771491,0.0000025329396,0.00004721473,0.00015148016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957255,0.00003825038,0.0006450736,0.0017590489,0.0009269976,0.00090512115],"domain_scores_gemma":[0.99718225,0.00017751037,0.00032693235,0.0014331387,0.0005812101,0.00029896328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094099395,0.00059583853,0.0006004503,0.0007881622,0.0005324205,0.0006033817,0.0033845806,0.0003470708,0.000012380097],"category_scores_gemma":[0.00012063676,0.000561061,0.0001258377,0.0013468995,0.00032805873,0.00045421493,0.0016797299,0.0007457183,0.00003486977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006904713,0.000019994552,0.000008136974,0.000025086478,0.000005303683,0.000027339154,0.0002452687,0.92147267,0.00006110538,0.016295245,0.00005620755,0.061776742],"study_design_scores_gemma":[0.00015604006,0.00022405059,0.000011788853,0.0009000476,0.000006072844,0.00003966007,3.8245705e-8,0.8190021,0.00058374915,0.17763653,0.0007642217,0.0006757022],"about_ca_topic_score_codex":0.000019465138,"about_ca_topic_score_gemma":0.000016249154,"teacher_disagreement_score":0.16134128,"about_ca_system_score_codex":0.00042594707,"about_ca_system_score_gemma":0.0014702767,"threshold_uncertainty_score":0.9996841},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018326638,0.00017283653,0.99545574,0.000017917351,0.0009582849,0.0009005843,0.000011102014,0.00020566287,0.0004451798],"genre_scores_gemma":[0.055553365,0.000005961029,0.94382006,0.00007343266,0.00038357475,0.000038067035,0.000034241828,0.00008557763,0.00000574249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974255,0.00003627255,0.0006267713,0.0007968871,0.00059274375,0.0005218003],"domain_scores_gemma":[0.9976349,0.0013956812,0.00016975701,0.00051165465,0.00015211162,0.00013588755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012379787,0.0004440648,0.000545458,0.00049366924,0.00010914292,0.000114465176,0.00080176344,0.0003536923,0.000007720397],"category_scores_gemma":[0.0001815819,0.00043590937,0.00006324633,0.0003551819,0.00026171512,0.00013277686,0.00014085753,0.00088868116,0.000008368056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006676646,0.00004498487,0.0000037515726,0.00012356765,0.0000044405847,0.000004430172,0.00064659206,0.906989,0.0024700905,0.00089060416,2.8770825e-7,0.08881558],"study_design_scores_gemma":[0.00019227323,0.00007840369,0.000016677,0.00015479943,0.0000053908007,0.000027296546,3.6937564e-7,0.76038706,0.00086534803,0.23787877,0.000021365864,0.000372256],"about_ca_topic_score_codex":0.0000016488526,"about_ca_topic_score_gemma":0.000006903862,"teacher_disagreement_score":0.23698817,"about_ca_system_score_codex":0.00031250718,"about_ca_system_score_gemma":0.00008619215,"threshold_uncertainty_score":0.99980927},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027082112,0.0000967354,0.98527116,0.0019823227,0.0006884855,0.00041683993,0.000009462762,0.00029103074,0.011241256],"genre_scores_gemma":[0.050859805,0.000039337985,0.9356412,0.011632062,0.0004123159,0.000028940978,0.000015177416,0.00007108963,0.0013000233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960922,0.0000666762,0.0004624406,0.001490713,0.0013142013,0.0005737619],"domain_scores_gemma":[0.9974827,0.00029418283,0.0002724379,0.001585907,0.0001923107,0.00017242579],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010233561,0.00054200314,0.00042042474,0.0007273582,0.0002723577,0.00047280508,0.0031772004,0.0002869385,0.00004757682],"category_scores_gemma":[0.00005634151,0.00044762882,0.00016603102,0.0006591232,0.00074097567,0.0004317051,0.00055485824,0.0007486988,0.0000596141],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009446545,0.000048609003,0.000017947643,0.00002673858,0.0000075608086,0.0000654483,0.00013449622,0.0004915761,0.00043283027,0.06437141,0.000039169357,0.9343548],"study_design_scores_gemma":[0.00037358628,0.0005114875,0.0000724421,0.00038265946,0.000008864661,0.00003659052,1.3965503e-7,0.71530706,0.05015794,0.2267661,0.0053211874,0.0010619409],"about_ca_topic_score_codex":0.000018938603,"about_ca_topic_score_gemma":0.00000627492,"teacher_disagreement_score":0.9332928,"about_ca_system_score_codex":0.00038898984,"about_ca_system_score_gemma":0.0003430648,"threshold_uncertainty_score":0.9997975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013883775,0.00080802804,0.98086447,0.013978108,0.0013862628,0.0008834092,0.000028566265,0.0009955075,0.0010417949],"genre_scores_gemma":[0.0041324515,0.0002446992,0.99262416,0.0016454627,0.00039899762,0.000027964756,0.000012852331,0.000063638814,0.0008497432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940888,0.00001749371,0.0007179604,0.0027554831,0.001207588,0.0012126542],"domain_scores_gemma":[0.984176,0.00071338995,0.00041135584,0.014155912,0.00027629136,0.000267096],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0007168027,0.0008009004,0.00077651156,0.0011325156,0.0004047582,0.0005647494,0.06982067,0.00070668285,0.000007844064],"category_scores_gemma":[0.006373213,0.00076499645,0.00023903244,0.00080204156,0.0009726656,0.0012935755,0.09622557,0.0011725614,0.000043602515],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000123987675,0.000042716863,0.000012322342,0.000063939566,0.000024556572,0.00008437526,0.0006220454,0.028777422,0.00009036482,0.012513794,0.047359917,0.91039616],"study_design_scores_gemma":[0.00022092788,0.00007374993,0.0000040679834,0.00013910374,0.000004080243,0.000058220558,1.7226258e-8,0.53998613,0.00041517033,0.45469937,0.003931608,0.00046756992],"about_ca_topic_score_codex":0.000023985656,"about_ca_topic_score_gemma":0.000033193144,"teacher_disagreement_score":0.90992856,"about_ca_system_score_codex":0.00052693166,"about_ca_system_score_gemma":0.0019426598,"threshold_uncertainty_score":0.9994801},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004170153,0.0002812416,0.99767977,0.00023448862,0.00073146675,0.00035247114,0.0000078372395,0.00032678436,0.0003817939],"genre_scores_gemma":[0.047505993,0.000074173826,0.95072925,0.000574451,0.0008789088,0.000031681437,0.000010180001,0.00006666908,0.00012867828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986403,0.0000042759048,0.00031145973,0.00046492557,0.00027354388,0.0003055113],"domain_scores_gemma":[0.9989995,0.00032430215,0.00007753495,0.00044823976,0.000101837075,0.000048632697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024285946,0.00030732117,0.0002961281,0.00026003722,0.00012001245,0.000087240056,0.00062523276,0.0001601894,0.000033095457],"category_scores_gemma":[0.000051060488,0.00022007574,0.00014907209,0.0002447433,0.00027312676,0.0001443715,0.00015944318,0.0005359961,0.000007721635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012893287,0.0000029814594,2.7867566e-7,0.0000150457245,0.00001128578,0.000002180257,0.00008790705,0.39624912,0.00014280013,0.00022835372,0.000013641439,0.6032451],"study_design_scores_gemma":[0.00008391888,0.000087622764,0.000002304439,0.00016644053,0.000016596137,0.000009370321,1.6283462e-7,0.86005247,0.00847958,0.12907301,0.0017620947,0.0002664584],"about_ca_topic_score_codex":0.000012914861,"about_ca_topic_score_gemma":0.000032720567,"teacher_disagreement_score":0.60297865,"about_ca_system_score_codex":0.00040986465,"about_ca_system_score_gemma":0.00003780655,"threshold_uncertainty_score":0.8974428},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011011992,0.0004784526,0.99417585,0.0033237545,0.0008465139,0.00036227,0.0000048465085,0.0000607121,0.00073659886],"genre_scores_gemma":[0.019212788,0.000027268146,0.97861207,0.0005368997,0.00043342225,0.000008209746,0.0000024485428,0.000019299443,0.0011475753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998171,0.000014111541,0.0003216438,0.00070999964,0.00045994288,0.0003233334],"domain_scores_gemma":[0.9981164,0.00065540615,0.0002321679,0.000758421,0.00013007078,0.00010757261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006061938,0.0002685987,0.00030586682,0.00030687157,0.00036507717,0.00025088593,0.0017782942,0.00015773448,0.0000084379235],"category_scores_gemma":[0.00011464516,0.00018926038,0.000099556055,0.00034085117,0.00054819696,0.00022141587,0.00050749985,0.0005045216,0.000002484336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029725666,0.000008843561,0.000013462635,0.000050640425,0.000012117413,0.000002405737,0.001154117,0.060570106,0.00001948305,0.11257694,0.000026750391,0.8255622],"study_design_scores_gemma":[0.00025151903,0.00012893822,0.00006775135,0.00013760156,0.000008565884,0.00001826901,3.0782456e-7,0.80166584,0.00012869021,0.1937654,0.003613743,0.00021335746],"about_ca_topic_score_codex":0.0000671038,"about_ca_topic_score_gemma":0.000028614118,"teacher_disagreement_score":0.8253488,"about_ca_system_score_codex":0.0000735376,"about_ca_system_score_gemma":0.0007171292,"threshold_uncertainty_score":0.7717814},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009392522,0.0031404563,0.9813578,0.0006439447,0.00065581716,0.0007181359,0.000047509435,0.000050370352,0.0039934595],"genre_scores_gemma":[0.8893575,0.00009276121,0.103645064,0.0022212008,0.0016405567,0.000034838973,0.00019182521,0.000102867634,0.0027133727],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99767727,0.000013147649,0.00030627093,0.0011221827,0.0003772289,0.00050388346],"domain_scores_gemma":[0.9987366,0.000032467677,0.00016680654,0.00073988957,0.0001844388,0.00013979945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002605049,0.00040602422,0.000386214,0.00028666452,0.00013418846,0.00014388129,0.0009681029,0.00016900516,0.00002295839],"category_scores_gemma":[0.000027989452,0.0003962314,0.00010600529,0.00015648699,0.00027721605,0.000005606747,0.0006702749,0.00025074882,0.00005154346],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013779239,0.00015178871,0.021593839,0.00025206938,0.00020793531,0.00021306284,0.0007752209,0.2244108,0.11464871,0.00055221264,0.003565908,0.6334907],"study_design_scores_gemma":[0.0037253771,0.0032057723,0.038527247,0.0019955272,0.00017927168,0.0003043822,0.000009158663,0.042361762,0.16061042,0.023135982,0.7165744,0.009370725],"about_ca_topic_score_codex":0.000022076358,"about_ca_topic_score_gemma":0.00014887571,"teacher_disagreement_score":0.879965,"about_ca_system_score_codex":0.000100527956,"about_ca_system_score_gemma":0.00013944972,"threshold_uncertainty_score":0.99984896},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066476077,0.001589576,0.98949975,0.00053020526,0.002426548,0.0014053837,0.00001756739,0.00006774422,0.0037984422],"genre_scores_gemma":[0.9878376,0.00010742271,0.009866259,0.0009886973,0.0010587102,0.000037884856,0.000004282214,0.000019138488,0.00008001951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971805,0.0000776253,0.0004555671,0.00088538503,0.0007033521,0.0006975563],"domain_scores_gemma":[0.9976208,0.0013416287,0.0002862795,0.00030131583,0.0002857405,0.00016422322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022375172,0.00032033864,0.00055093435,0.0005923498,0.0004883861,0.0007690757,0.0009726686,0.000644086,0.00001220566],"category_scores_gemma":[0.000579205,0.00028832065,0.00007824924,0.00048590475,0.0011164997,0.00064636016,0.00019523356,0.00069352763,0.000002885672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001446567,0.000061614905,0.0067894515,0.00015357557,0.000023619628,0.000058793255,0.0060469853,0.0034146982,0.000008676817,0.79421455,0.000012973564,0.18907039],"study_design_scores_gemma":[0.0011984975,0.00015095498,0.0022366417,0.00080678886,0.000029327715,0.0000067990322,0.00001466275,0.068768494,0.0000094509205,0.9214577,0.004600806,0.0007198681],"about_ca_topic_score_codex":0.0012625238,"about_ca_topic_score_gemma":0.0055842404,"teacher_disagreement_score":0.98717284,"about_ca_system_score_codex":0.0003766005,"about_ca_system_score_gemma":0.00035342932,"threshold_uncertainty_score":0.9999569},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008676473,0.00011272354,0.99689054,0.00040694495,0.00048592853,0.0012564387,0.00010924679,0.0002943413,0.00043512843],"genre_scores_gemma":[0.010316818,0.0000151570775,0.98821145,0.00042975563,0.00022978694,0.00004502548,0.00026398757,0.000043670316,0.0004443277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965189,0.000069799025,0.0005356589,0.0014275387,0.00078423583,0.00066388334],"domain_scores_gemma":[0.99763507,0.00069309276,0.000305953,0.0008184242,0.0003927948,0.000154667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070825673,0.00048415488,0.00046102796,0.0007297384,0.00042161468,0.00061646657,0.0017324683,0.00031695532,0.00003804315],"category_scores_gemma":[0.00022768223,0.00044940953,0.00008852991,0.0005181297,0.00044394043,0.0006403704,0.0007398735,0.0009374344,0.0000076288106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002127073,0.000065040615,0.00014143722,0.00043656147,0.000024970068,0.00008557099,0.0007751594,0.4967178,0.0062302803,0.1503006,0.0011665628,0.3440347],"study_design_scores_gemma":[0.00034762805,0.0001907184,0.000035468616,0.00043593583,0.000007289954,0.00007320324,1.2656088e-7,0.91145015,0.010506534,0.06954125,0.006766574,0.00064511836],"about_ca_topic_score_codex":0.000027062557,"about_ca_topic_score_gemma":0.000051513736,"teacher_disagreement_score":0.41473234,"about_ca_system_score_codex":0.000242004,"about_ca_system_score_gemma":0.00061188074,"threshold_uncertainty_score":0.9997958},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014518417,0.00014625548,0.9951936,0.000030939587,0.0004674459,0.00031704645,0.000004829644,0.00012977485,0.0022582759],"genre_scores_gemma":[0.9748158,0.000024026682,0.024671208,0.00007512869,0.00018644433,0.0000149705065,0.00000880949,0.00003027949,0.00017335355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992031,0.000008435135,0.00014891181,0.00032489843,0.00015422332,0.00016042797],"domain_scores_gemma":[0.9996693,0.00005727993,0.000038770533,0.00012456898,0.000070710754,0.000039384355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018570815,0.00017659205,0.0001684794,0.00025807513,0.00010725987,0.00011143693,0.00010241946,0.0001551422,0.0000073645656],"category_scores_gemma":[0.000014825682,0.00016841144,0.000042619038,0.00007227531,0.00009488141,0.0001029748,0.000017198978,0.00018146257,0.0000065230106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018969966,0.000022937176,0.000072199044,0.0018454805,0.000048897386,0.000009332029,0.0024612392,0.13375024,0.014449429,0.017701583,0.00020833306,0.8294114],"study_design_scores_gemma":[0.0003706062,0.0001495305,0.0013390766,0.0012226922,0.00003520033,0.000088419096,0.0000030678236,0.9811143,0.00081958226,0.01338237,0.0008851257,0.0005899774],"about_ca_topic_score_codex":0.0000010257901,"about_ca_topic_score_gemma":0.000007909673,"teacher_disagreement_score":0.97336394,"about_ca_system_score_codex":0.00023866411,"about_ca_system_score_gemma":0.000015570131,"threshold_uncertainty_score":0.6867619},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059460774,0.00044870967,0.99311334,0.0012300402,0.0024026167,0.00041120467,0.000017797318,0.00013034137,0.0021865098],"genre_scores_gemma":[0.0038670718,0.00004111045,0.9931121,0.0014423492,0.00048277856,0.0000124236285,0.0000064787455,0.000027662592,0.0010080661],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749833,0.000024152123,0.00036285864,0.0012463056,0.0003907229,0.00047761525],"domain_scores_gemma":[0.998027,0.00042600415,0.00016352684,0.0009706596,0.00016733567,0.00024541878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051963126,0.0003837255,0.0003505749,0.0007609767,0.0005300507,0.0004553549,0.0011792182,0.00021635847,0.000016590511],"category_scores_gemma":[0.00006476523,0.0003679762,0.00015346712,0.00055426743,0.0006521696,0.00036010644,0.0004278113,0.00045109406,0.000010123306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010155247,0.000016633732,0.00002361407,0.000021773669,0.000016897235,0.0000074183213,0.00024184959,0.0016499289,0.000070984715,0.29774657,0.0004120391,0.69978213],"study_design_scores_gemma":[0.00057151186,0.00041971958,0.000038577607,0.00022527925,0.000030345573,0.00018821798,6.407455e-7,0.056924757,0.0006652687,0.85899806,0.081151895,0.00078574853],"about_ca_topic_score_codex":0.000008024206,"about_ca_topic_score_gemma":0.00004457945,"teacher_disagreement_score":0.6989964,"about_ca_system_score_codex":0.00008413703,"about_ca_system_score_gemma":0.0003935683,"threshold_uncertainty_score":0.9998772},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011720065,0.0005019583,0.9928135,0.00085549575,0.0018685465,0.0009261419,0.000012037456,0.00042228765,0.002588276],"genre_scores_gemma":[0.14608048,0.00012044211,0.8483237,0.0032826504,0.0010542453,0.0000484637,0.0000093109675,0.000068638496,0.0010120787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964415,0.000031545555,0.00052216864,0.0013669734,0.000926417,0.00071139715],"domain_scores_gemma":[0.99637556,0.0013022019,0.00033583774,0.0013771191,0.00047218008,0.00013710467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013891248,0.00051591115,0.00043787176,0.00061533356,0.0005097658,0.0005587747,0.0046513416,0.00030255134,0.000020811289],"category_scores_gemma":[0.000116093,0.00038195582,0.00020712492,0.00048204177,0.0006326595,0.00038222305,0.0010797287,0.00072325836,0.000014010068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025967562,0.00005022034,0.000040492007,0.00004590521,0.000044315402,0.000024669664,0.002961373,0.20961384,0.000025786918,0.043239377,0.0005687178,0.7433593],"study_design_scores_gemma":[0.00026832137,0.00027881435,0.00008246751,0.00022358896,0.0000074013633,0.00003321778,2.2922934e-7,0.9039296,0.00047083755,0.08863114,0.0055732597,0.0005010996],"about_ca_topic_score_codex":0.000017439243,"about_ca_topic_score_gemma":0.000022712868,"teacher_disagreement_score":0.74285823,"about_ca_system_score_codex":0.0002906612,"about_ca_system_score_gemma":0.0003969531,"threshold_uncertainty_score":0.9998632},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008121285,0.000502277,0.9867631,0.0004900216,0.001850508,0.0011953079,0.0000012472024,0.00043555288,0.0087538455],"genre_scores_gemma":[0.6454613,0.000022382354,0.35209122,0.00050625217,0.00085997186,0.000088918074,0.0000091693,0.000059866135,0.0009008729],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951099,0.00004422071,0.0006447668,0.0019897625,0.0012625541,0.0009487528],"domain_scores_gemma":[0.9970257,0.00023144933,0.00045137672,0.0016439361,0.00037670613,0.00027081312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010995882,0.00063442567,0.00062674755,0.00061023765,0.0003214027,0.00094253244,0.0040880363,0.0004121647,0.000021933896],"category_scores_gemma":[0.00015793016,0.00052960415,0.00017341356,0.00077072607,0.0011573862,0.0006059919,0.0013475216,0.0008879645,0.00011277401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020654631,0.000042213083,0.000020354619,0.00008691603,0.000012088022,0.00009113834,0.0013612709,0.0036710117,0.000006570729,0.45170066,0.0000058235228,0.5429999],"study_design_scores_gemma":[0.000328186,0.0003922598,0.000042790376,0.0002043255,0.000012543671,0.00011685515,3.456903e-7,0.05337734,0.00018209602,0.9383295,0.006200156,0.0008136043],"about_ca_topic_score_codex":0.00005327238,"about_ca_topic_score_gemma":0.00008739042,"teacher_disagreement_score":0.6454532,"about_ca_system_score_codex":0.00065958087,"about_ca_system_score_gemma":0.0012847742,"threshold_uncertainty_score":0.99971557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039077923,0.000719114,0.99052334,0.0021424282,0.0015121581,0.0004765606,0.000019438728,0.000096503536,0.0006026403],"genre_scores_gemma":[0.45533526,0.00006573461,0.53963953,0.0036684338,0.00056476,0.000019307165,0.0000040191226,0.00004961576,0.0006533395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604625,0.00008756991,0.0007390472,0.0015074096,0.001001963,0.0006177832],"domain_scores_gemma":[0.99568796,0.0012181125,0.00032447372,0.002252456,0.0003469277,0.00017009633],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008670537,0.0005331508,0.00062404614,0.00039392547,0.00026011234,0.00036772384,0.005986797,0.000278258,0.000049993414],"category_scores_gemma":[0.00023384622,0.00038771005,0.0001645626,0.00068571797,0.00076449214,0.00051705714,0.0019488514,0.0008810725,0.00010144503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006950683,0.00016901713,0.0005392313,0.000093382005,0.00010496016,0.00013373235,0.038546022,0.26497462,0.005136967,0.0048922845,0.0049297693,0.6804105],"study_design_scores_gemma":[0.0008651317,0.0011978131,0.0007440248,0.0033898188,0.000051796706,0.00020329996,0.000007525808,0.59931254,0.19650383,0.11855004,0.07595573,0.003218458],"about_ca_topic_score_codex":0.00034986326,"about_ca_topic_score_gemma":0.00029399944,"teacher_disagreement_score":0.67719203,"about_ca_system_score_codex":0.00019869287,"about_ca_system_score_gemma":0.0003838166,"threshold_uncertainty_score":0.9998575},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072763977,0.00017722492,0.9963212,0.00080179336,0.00034009296,0.0011985332,0.000017738725,0.00019179512,0.00022395968],"genre_scores_gemma":[0.0241948,0.000006590847,0.9743682,0.00052864145,0.0002652883,0.00004181948,0.000007605212,0.000077924444,0.0005091133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958884,0.000031872623,0.00052298873,0.0014992513,0.0012555001,0.00080199493],"domain_scores_gemma":[0.99264693,0.004392188,0.00033595966,0.001978489,0.00043029521,0.00021613257],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011950635,0.000505874,0.00072606,0.00072664104,0.00019010645,0.0009437506,0.008680223,0.00036332017,0.000013940102],"category_scores_gemma":[0.0006227194,0.0004201948,0.00010387659,0.0007578699,0.00046632995,0.00062970706,0.0035184901,0.0011330304,0.000011933968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040214472,0.000099374985,0.00013545259,0.00028935302,0.00005452528,0.000040117695,0.0017944332,0.22965173,0.0001734183,0.05279275,0.00013437076,0.7147943],"study_design_scores_gemma":[0.00093458395,0.0011382259,0.00054927595,0.0041235792,0.0000190586,0.00012415428,0.0000013175437,0.67347175,0.0020021359,0.30553597,0.010567151,0.0015328043],"about_ca_topic_score_codex":0.0000673205,"about_ca_topic_score_gemma":0.00004307953,"teacher_disagreement_score":0.7132614,"about_ca_system_score_codex":0.00022230596,"about_ca_system_score_gemma":0.00067587016,"threshold_uncertainty_score":0.999825},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003207042,0.00028616042,0.9972625,0.00008020115,0.00042793044,0.0009177265,0.0000103431485,0.00070323405,0.0002798312],"genre_scores_gemma":[0.031656224,0.00006741207,0.9678102,0.0000616756,0.0002578345,0.00005553561,0.000011302456,0.0000588162,0.000021006994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983369,0.000005558847,0.00033450767,0.00055774325,0.0002511885,0.0005140865],"domain_scores_gemma":[0.99859333,0.0005504864,0.00008527551,0.00059004343,0.00012668697,0.000054151722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024405454,0.0003608726,0.00029488895,0.00019130873,0.00023457958,0.000112464346,0.0009086302,0.00030181368,0.0000014177651],"category_scores_gemma":[0.00007137936,0.00026931934,0.00006472615,0.00026600054,0.0006715025,0.00025708697,0.00012440956,0.0006625811,0.0000026789312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011236073,0.0000038279727,4.4419806e-7,0.000012659691,0.0000060029174,0.0000019443958,0.00015749267,0.33988607,0.00029846426,0.00023571587,0.0000025741542,0.65939367],"study_design_scores_gemma":[0.00017479234,0.00009101451,0.0000068161767,0.00009299685,0.000008525119,0.000017346953,8.307738e-7,0.98386943,0.0009980827,0.014208519,0.0002007374,0.00033089292],"about_ca_topic_score_codex":0.0000029352962,"about_ca_topic_score_gemma":0.000027151153,"teacher_disagreement_score":0.6590628,"about_ca_system_score_codex":0.00020823776,"about_ca_system_score_gemma":0.00004331258,"threshold_uncertainty_score":0.9999759},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010756023,0.00036157438,0.98647666,0.0023876773,0.0034269805,0.000264466,0.0000019018757,0.00030566435,0.0066674943],"genre_scores_gemma":[0.19499932,0.000019536115,0.8021135,0.0024265659,0.00031216038,0.0000067633346,0.0000035598505,0.000021914751,0.000096729476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666667,0.00003257051,0.0004702823,0.0014799578,0.00068724784,0.00066329073],"domain_scores_gemma":[0.99766654,0.0003957683,0.00027626887,0.0013432427,0.00018849851,0.00012968393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004983861,0.00048272382,0.0005671386,0.0008294679,0.00022118886,0.00036016904,0.0028272509,0.00046444347,0.000048833615],"category_scores_gemma":[0.000106982756,0.00043648435,0.0001403905,0.00041915648,0.001446542,0.00045503062,0.0006286442,0.00068227993,0.00006469878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006449524,0.000022560092,0.00015445572,0.000035327346,0.000008588671,0.00017180746,0.00022246594,0.021341635,0.000085804575,0.39537382,0.000009366358,0.58256775],"study_design_scores_gemma":[0.00055633724,0.000249475,0.0003414465,0.000336539,0.000009825116,0.00023130393,1.9339487e-7,0.18415661,0.0030922466,0.80937046,0.0009216122,0.00073397195],"about_ca_topic_score_codex":0.00006912441,"about_ca_topic_score_gemma":0.00023208228,"teacher_disagreement_score":0.5818338,"about_ca_system_score_codex":0.00041539318,"about_ca_system_score_gemma":0.0016195802,"threshold_uncertainty_score":0.99980867},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075640013,0.00090690353,0.318802,0.0025440452,0.00515335,0.0010825295,0.000008686446,0.00033774978,0.66360074],"genre_scores_gemma":[0.74679625,0.00081819086,0.06461907,0.00951499,0.010782179,0.000016328973,0.00004080456,0.00013611557,0.16727604],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977007,0.000024778668,0.00024582742,0.00078490074,0.00073486695,0.0005089205],"domain_scores_gemma":[0.99908614,0.00014848699,0.00013490637,0.00029346446,0.00010541749,0.00023160658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063769415,0.00028672212,0.00032261026,0.00030083006,0.0004018736,0.00038473078,0.00045168752,0.00029795614,0.000069350455],"category_scores_gemma":[0.000038603594,0.00026902882,0.00009145184,0.00020391434,0.0016113627,0.00030431096,0.00030819364,0.000385775,0.00003776035],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033410415,0.000012247927,0.00010806153,0.000010250664,0.0000041445505,0.000023689898,0.0030382914,0.00036194723,0.000023294308,0.008968542,0.00007322015,0.987373],"study_design_scores_gemma":[0.0006189428,0.00067470514,0.002984808,0.0007311474,0.00003334584,0.00006147138,0.0000039633883,0.0054043704,0.0002083053,0.07340608,0.9143938,0.001479064],"about_ca_topic_score_codex":0.00010181917,"about_ca_topic_score_gemma":0.0017247834,"teacher_disagreement_score":0.9858939,"about_ca_system_score_codex":0.00043804766,"about_ca_system_score_gemma":0.00021355621,"threshold_uncertainty_score":0.9999762},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058861646,0.00042757601,0.9943158,0.00033862196,0.0019532095,0.00023593171,0.000006071469,0.00033987098,0.0023240722],"genre_scores_gemma":[0.24651107,0.00009182444,0.7498715,0.0012658685,0.0006814231,0.000009919209,0.000015505417,0.00007325868,0.0014796408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99447405,0.00009232469,0.0007704523,0.0021956332,0.0014478574,0.0010196576],"domain_scores_gemma":[0.9972338,0.00038802737,0.00043433177,0.0013593592,0.00028447475,0.0002999725],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008148131,0.0008200191,0.00075303076,0.0007038981,0.000522022,0.0010667264,0.003603187,0.0005227497,0.000013025546],"category_scores_gemma":[0.00006204113,0.0007570571,0.00020196616,0.0007184171,0.0013493287,0.0013047578,0.0016949546,0.0019250792,0.00007799744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004587595,0.000039724782,0.000014307826,0.000018735393,0.000012198359,0.0002456032,0.00083472923,0.10641166,0.000098235345,0.0012508561,0.000031069365,0.8910383],"study_design_scores_gemma":[0.00021415556,0.00033244933,0.00003423125,0.00041870849,0.000008371317,0.00042371493,5.338018e-7,0.9675149,0.0010963687,0.02851543,0.00046402958,0.0009771488],"about_ca_topic_score_codex":0.00006924609,"about_ca_topic_score_gemma":0.000054501128,"teacher_disagreement_score":0.89006114,"about_ca_system_score_codex":0.00044460353,"about_ca_system_score_gemma":0.00074246473,"threshold_uncertainty_score":0.99997026},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021096123,0.0030495198,0.9889615,0.00019579395,0.001443043,0.00053549715,0.0000075061703,0.000087779255,0.005698244],"genre_scores_gemma":[0.006288129,0.00032896397,0.9920876,0.0002964523,0.00029032017,0.000008343376,0.0000028538968,0.000026977017,0.0006703759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99446774,0.000083994004,0.0010024573,0.0015370678,0.0021429823,0.0007657691],"domain_scores_gemma":[0.9948081,0.0014072682,0.00051633385,0.0015919814,0.0014468642,0.00022949035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017825257,0.0005593175,0.0011213756,0.0017395216,0.00020572316,0.0002276397,0.0038804426,0.00026182522,0.000032061238],"category_scores_gemma":[0.0002816265,0.000494869,0.00014679528,0.0014093411,0.0020666667,0.00036382512,0.002055712,0.0008064714,0.000056443012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008893937,0.00007325526,0.000028197015,0.00012828752,0.00009952035,0.00019747914,0.0030422234,0.13427536,0.00006480464,0.018043268,0.00006683015,0.84397185],"study_design_scores_gemma":[0.00035729172,0.00031450632,0.00014645682,0.0003402732,0.000014105082,0.0000677186,0.0000013084529,0.9023206,0.002314937,0.09286935,0.0005987117,0.0006547151],"about_ca_topic_score_codex":0.000013719384,"about_ca_topic_score_gemma":0.000026872072,"teacher_disagreement_score":0.84331715,"about_ca_system_score_codex":0.00031575,"about_ca_system_score_gemma":0.0007551709,"threshold_uncertainty_score":0.9997503},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13467854,0.000057946265,0.86471194,0.00015384001,0.00023752371,0.00010135371,0.0000021617363,0.000042473013,0.000014232488],"genre_scores_gemma":[0.79514897,0.0000011465588,0.20470458,0.000034451125,0.00009763234,0.000001414901,0.000005808485,0.0000051131847,8.717525e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941915,0.0000072895023,0.000119853226,0.00018619702,0.000112306894,0.00015518072],"domain_scores_gemma":[0.999717,0.00008453699,0.00001776665,0.000117720956,0.00003520958,0.000027751155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013613566,0.00007401987,0.000077345954,0.00006634961,0.00009346016,0.00008234329,0.0000950959,0.000040008523,0.0000014646022],"category_scores_gemma":[0.000032147746,0.0000679519,0.000013954065,0.00028936964,0.00007088117,0.000108824504,0.000014781621,0.0000529264,4.19071e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012454379,0.0000056585413,0.00052615866,0.000011174297,5.3388385e-7,6.924038e-7,0.00005265433,0.9864695,0.010762307,0.00015404656,0.000032795393,0.0019832542],"study_design_scores_gemma":[0.00011079547,0.00001537869,0.0014950042,0.000016812104,0.0000017046762,0.0000016028732,2.8963896e-7,0.97773254,0.015970098,0.004533298,0.000037455015,0.0000850249],"about_ca_topic_score_codex":0.000023596642,"about_ca_topic_score_gemma":0.00006236054,"teacher_disagreement_score":0.6604704,"about_ca_system_score_codex":0.000032861746,"about_ca_system_score_gemma":0.000023622373,"threshold_uncertainty_score":0.27709982},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008240019,0.00016366228,0.9936676,0.0010437221,0.001728243,0.00036289665,0.0012912181,0.00024708177,0.001413194],"genre_scores_gemma":[0.6515327,0.0003311463,0.33204892,0.0069765975,0.0018047072,0.00005418229,0.0069659315,0.00013211288,0.00015368983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953527,0.000048861086,0.00054753444,0.001860575,0.0013971515,0.0007931765],"domain_scores_gemma":[0.9970139,0.0004787826,0.0003241645,0.0016244304,0.00027214855,0.0002865706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005085797,0.0006669628,0.00049834495,0.0005627325,0.0004460523,0.0007270001,0.0033311357,0.0004185204,0.000114594055],"category_scores_gemma":[0.000111849906,0.00063011626,0.00025595343,0.0010038178,0.00075747474,0.0008396365,0.0009852392,0.0011540808,0.00009903096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020621601,0.00017875331,0.00006961117,0.00004801735,0.000031332984,0.00021781882,0.00029341743,0.049876194,0.000013141078,0.89240164,0.002571603,0.054277826],"study_design_scores_gemma":[0.0007446227,0.00042959966,0.00078267086,0.00070294534,0.00001923866,0.000109145054,1.7996689e-7,0.31963712,0.00022247212,0.662638,0.013305764,0.001408263],"about_ca_topic_score_codex":0.00001537772,"about_ca_topic_score_gemma":0.000050120572,"teacher_disagreement_score":0.66161865,"about_ca_system_score_codex":0.00046381177,"about_ca_system_score_gemma":0.00022896014,"threshold_uncertainty_score":0.999615},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004153959,0.000047234083,0.9891789,0.0019574852,0.0018744492,0.0003100208,0.00007822677,0.00015437251,0.006357801],"genre_scores_gemma":[0.008382059,0.000011594575,0.9870694,0.0030962655,0.0007351874,0.000015120998,0.00008150788,0.00003780582,0.00057101174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958466,0.000023825853,0.00045222568,0.0023266214,0.00079839263,0.0005522945],"domain_scores_gemma":[0.99380136,0.00091191987,0.00031023764,0.004635285,0.00016133842,0.00017988021],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009412728,0.00047977225,0.00040942253,0.0006328246,0.00032217233,0.0009316064,0.009440475,0.0003008357,0.000025990297],"category_scores_gemma":[0.00019075761,0.00042566584,0.0000658954,0.00046837627,0.00054694765,0.001136077,0.005112799,0.0013791637,0.00015920027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003352983,0.00003579888,0.000004722684,0.000007788257,0.000009132723,0.000027980315,0.0005839099,0.00049599574,0.000073549185,0.004955477,0.00025854312,0.99354374],"study_design_scores_gemma":[0.00024913243,0.00015800468,0.00005379585,0.00040383273,0.000009219534,0.00008574684,3.4491114e-7,0.93756175,0.00065458217,0.024470337,0.03563812,0.0007151086],"about_ca_topic_score_codex":0.000024849474,"about_ca_topic_score_gemma":0.00012571881,"teacher_disagreement_score":0.99282867,"about_ca_system_score_codex":0.00013125478,"about_ca_system_score_gemma":0.00041719602,"threshold_uncertainty_score":0.9998195},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034094264,0.0005038117,0.99206203,0.00035891758,0.0014723061,0.00074249465,0.0000016808485,0.00047352625,0.004044276],"genre_scores_gemma":[0.32797718,0.00007424758,0.6700808,0.0013436496,0.00035774647,0.0000477039,0.0000027140313,0.000033214736,0.0000827303],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621534,0.00008793072,0.00044630136,0.0017975465,0.0006912333,0.0007616534],"domain_scores_gemma":[0.9968774,0.000693731,0.00025528806,0.0018237684,0.00018330447,0.00016654206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008040326,0.00057708926,0.00070548966,0.000884621,0.00034568823,0.0003136187,0.004560778,0.0005399185,0.000009167213],"category_scores_gemma":[0.00007739594,0.0005051416,0.00013481939,0.00042914422,0.0010030137,0.00079932914,0.001048172,0.001012611,0.000039073293],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008873183,0.000053431544,0.00010246641,0.000037271766,0.00001522311,0.00070902926,0.0026573774,0.0069373585,0.0011161361,0.027253928,0.000027736241,0.96108115],"study_design_scores_gemma":[0.0006301854,0.0014439328,0.0026360783,0.00077934726,0.00001911478,0.002902519,0.0000010167715,0.18980312,0.018022293,0.77894336,0.0023500763,0.0024689347],"about_ca_topic_score_codex":0.00013311305,"about_ca_topic_score_gemma":0.00027858093,"teacher_disagreement_score":0.9586122,"about_ca_system_score_codex":0.0002874472,"about_ca_system_score_gemma":0.0003795611,"threshold_uncertainty_score":0.99974},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064487,0.0001990957,0.99285346,0.0002119656,0.0031171264,0.0003555742,0.0000015883094,0.00013463141,0.0024816631],"genre_scores_gemma":[0.025913432,0.000026167829,0.9729525,0.00064022985,0.0003129195,0.000005428623,0.0000013068145,0.00003252299,0.0001154982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614525,0.00007206538,0.0006276926,0.0015087989,0.0009366092,0.00070957135],"domain_scores_gemma":[0.9972342,0.00030856475,0.00033538637,0.0017989785,0.00018091503,0.00014195002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018572106,0.00048296372,0.00049707515,0.0012918022,0.0002046921,0.0005019989,0.0039504417,0.00055962475,0.000023805933],"category_scores_gemma":[0.0002545578,0.00046594796,0.00009856421,0.0008843023,0.00082986424,0.0010018782,0.0014197992,0.0017981997,0.00004694887],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008377938,0.00004507357,0.0002956893,0.000058283305,0.000005730659,0.00011256312,0.0012492636,0.036962446,0.0055912267,0.10041666,0.0000026157334,0.8552521],"study_design_scores_gemma":[0.00021306206,0.00009179922,0.0004819189,0.0003537943,0.0000043391906,0.00012955054,1.6300795e-7,0.79812425,0.010415359,0.18732396,0.0021020107,0.0007597708],"about_ca_topic_score_codex":0.00006484451,"about_ca_topic_score_gemma":0.00016166101,"teacher_disagreement_score":0.8544923,"about_ca_system_score_codex":0.0004359362,"about_ca_system_score_gemma":0.0005980009,"threshold_uncertainty_score":0.9997792},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001052047,0.00019607943,0.9943478,0.00016556073,0.00082588644,0.0003910939,0.000010395633,0.00011954346,0.003933083],"genre_scores_gemma":[0.2226144,0.000037538844,0.7744465,0.0013881897,0.0008487335,0.000011289379,0.0000070067454,0.00013123939,0.0005151054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969893,0.000009530707,0.0005338263,0.00088470965,0.00093302486,0.00064961973],"domain_scores_gemma":[0.99615395,0.0027273514,0.00024196714,0.00046008517,0.0002456167,0.0001710469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075911725,0.00046880922,0.00053828675,0.00047575828,0.00021552139,0.00018568666,0.00082855084,0.00036991332,0.000073920906],"category_scores_gemma":[0.0010277891,0.00039886206,0.0000721108,0.00045660924,0.0004527541,0.000137658,0.00028777512,0.0006994082,0.000024654892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005990977,0.000093393224,0.000001064821,0.0017881205,0.000037102585,0.00018676257,0.0015261404,0.008634063,0.000012913739,0.60884696,0.0001086272,0.37870497],"study_design_scores_gemma":[0.00018892875,0.00013143833,2.7270107e-7,0.000624907,0.000026393887,0.00006744861,7.0466876e-7,0.18668656,0.000077823264,0.8116694,0.00011542897,0.00041070214],"about_ca_topic_score_codex":0.0000014923546,"about_ca_topic_score_gemma":0.00013171977,"teacher_disagreement_score":0.37829426,"about_ca_system_score_codex":0.00044526116,"about_ca_system_score_gemma":0.00043983912,"threshold_uncertainty_score":0.99984634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038601724,0.000620978,0.9951396,0.0014204343,0.0012248732,0.0009058188,0.0000036738156,0.00013388431,0.00051212613],"genre_scores_gemma":[0.084715866,0.000050587423,0.91278696,0.0011565693,0.0005664682,0.0000543914,0.000025432122,0.000029736279,0.0006139598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728256,0.000031324485,0.0005451941,0.0009936248,0.00069434254,0.0004529302],"domain_scores_gemma":[0.99741566,0.00040184788,0.00037430256,0.0012898967,0.00039889064,0.0001194204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010766435,0.00034709112,0.0003635407,0.0004808628,0.000332719,0.0004410773,0.00239405,0.00023661104,0.000010868743],"category_scores_gemma":[0.00008935092,0.0003143575,0.00014689752,0.00025639604,0.00024322685,0.00054640404,0.0008240402,0.0003905986,0.000031598138],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038496087,0.000030034174,0.00001920861,0.000036544647,0.000008361652,0.0000037971292,0.00067127566,0.007270819,0.000084935426,0.03253822,0.00008410553,0.95924884],"study_design_scores_gemma":[0.0004060039,0.00013309892,0.00016265134,0.0006034789,0.000008676626,0.0000405658,2.780525e-7,0.9201357,0.0005117352,0.028297665,0.049108405,0.0005917851],"about_ca_topic_score_codex":0.000019958372,"about_ca_topic_score_gemma":0.0001041349,"teacher_disagreement_score":0.9586571,"about_ca_system_score_codex":0.0003417973,"about_ca_system_score_gemma":0.00026734284,"threshold_uncertainty_score":0.99993086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009788089,0.0020262918,0.99299,0.0006897131,0.00200108,0.0013923773,0.000008156315,0.0004034614,0.00039102256],"genre_scores_gemma":[0.8078141,0.00015523417,0.19065332,0.00061389094,0.00048568423,0.00014237607,0.000021128224,0.000039810006,0.00007445621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963533,0.00006004252,0.0008024244,0.0013755052,0.00066377077,0.0007449331],"domain_scores_gemma":[0.99033666,0.0060066497,0.0004595324,0.0027314322,0.00028152094,0.00018420143],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015415846,0.00055097864,0.0006902793,0.00041756802,0.00052049896,0.00048591814,0.0040873815,0.0004703605,0.0000033299575],"category_scores_gemma":[0.00047703666,0.00047216436,0.0002186737,0.00045704297,0.000526036,0.00070486096,0.0009765973,0.0006663415,0.00002731307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001724941,0.000056689456,0.0022832106,0.00031068636,0.00002711814,0.000017803119,0.0007821001,0.5070718,0.000002851587,0.011141197,0.0001401916,0.47814912],"study_design_scores_gemma":[0.0004488096,0.000119174074,0.000504666,0.0013560805,0.000013716429,0.000055191897,2.8439797e-7,0.9806485,0.00007033095,0.012743036,0.0034398546,0.00060034584],"about_ca_topic_score_codex":0.0000355479,"about_ca_topic_score_gemma":0.00016256742,"teacher_disagreement_score":0.8077162,"about_ca_system_score_codex":0.00069912267,"about_ca_system_score_gemma":0.00039063793,"threshold_uncertainty_score":0.999773},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010483571,0.0003487255,0.99517435,0.0013258128,0.0010455803,0.0007897685,0.000019648885,0.000054877743,0.00019287175],"genre_scores_gemma":[0.42278564,0.00000977607,0.5751285,0.0009730051,0.0008399539,0.000011825414,0.000037843416,0.000031511343,0.00018195467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669635,0.000043849952,0.0007422921,0.0010690427,0.000897381,0.0005510626],"domain_scores_gemma":[0.99717957,0.0011689593,0.00041371223,0.0007109038,0.00042471167,0.00010212945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015468459,0.00040639978,0.00054340455,0.0008020535,0.00024078543,0.00017254744,0.0019157268,0.00021287004,0.000015654578],"category_scores_gemma":[0.00015419084,0.0003298597,0.00017394783,0.0010411231,0.000462376,0.00017009434,0.00080084946,0.0005113164,0.00001358888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009331945,0.000052896212,0.000006842176,0.00003135821,0.000007875702,0.000008518879,0.0005871289,0.8665373,0.00024743937,0.017023658,0.000009581081,0.115478076],"study_design_scores_gemma":[0.00053689745,0.00023028401,0.00010053002,0.00020544423,0.000006101462,0.000026012165,2.945451e-7,0.9334616,0.0022527163,0.06246098,0.00038983105,0.00032928164],"about_ca_topic_score_codex":0.000035209265,"about_ca_topic_score_gemma":0.000026242937,"teacher_disagreement_score":0.42173728,"about_ca_system_score_codex":0.00026405588,"about_ca_system_score_gemma":0.0010007459,"threshold_uncertainty_score":0.99991536},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035498133,0.000068536276,0.9949695,0.0008014526,0.00024339261,0.00014196114,7.100734e-7,0.00013922225,0.00008543821],"genre_scores_gemma":[0.47896212,0.0000049899813,0.52048135,0.00048305292,0.00006118928,0.0000032615048,4.6824007e-7,0.0000022420493,0.0000013260722],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99810505,0.000056531775,0.00036772896,0.00049601006,0.0006805348,0.00029412046],"domain_scores_gemma":[0.99850625,0.0005187643,0.00015706183,0.00058003893,0.0001505593,0.00008732637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008523852,0.00012639603,0.00015328889,0.00028665754,0.00008226322,0.00018579644,0.0014096271,0.000050037394,0.000018201088],"category_scores_gemma":[0.0005590376,0.00011126665,0.00002828638,0.0013378876,0.0005117028,0.0011180994,0.00021298885,0.00017095481,0.0000106126245],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016701705,0.00006632173,0.0004216886,0.000013910111,0.0000016009329,0.000005155971,0.0006358384,0.009949193,0.0894489,0.00032641485,0.000060580685,0.8990687],"study_design_scores_gemma":[0.00017350538,0.00010931752,0.0027094602,0.000054825086,0.0000016583512,0.000038134745,3.9496246e-7,0.2298557,0.7618867,0.004994296,0.000017506169,0.0001584842],"about_ca_topic_score_codex":0.000024423569,"about_ca_topic_score_gemma":0.000018993846,"teacher_disagreement_score":0.8989102,"about_ca_system_score_codex":0.00009103652,"about_ca_system_score_gemma":0.00017695481,"threshold_uncertainty_score":0.45373222},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028587267,0.00030859557,0.9969096,0.00038364917,0.0011186738,0.000453279,0.0000022273873,0.00036882615,0.00016926999],"genre_scores_gemma":[0.057421453,0.000017865832,0.94192636,0.0003055061,0.00016868675,0.00003444611,0.0000066444627,0.000042192438,0.000076834185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99499637,0.000029356586,0.0006428942,0.0018622789,0.0015129091,0.00095618883],"domain_scores_gemma":[0.9966715,0.0012878539,0.00014014126,0.0014953997,0.00022413748,0.00018097153],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008820441,0.0005064678,0.00046685548,0.0013203558,0.00023938138,0.0005175767,0.0035781653,0.00035798445,0.00002053257],"category_scores_gemma":[0.00092415104,0.0005079145,0.00010562419,0.0015404582,0.00048183638,0.0008367758,0.001999246,0.0014355121,0.00004313894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041681774,0.00005554762,0.0017996657,0.00010559846,0.000012415124,0.0004328682,0.0028499719,0.3035766,0.000046777364,0.009295715,0.0000089477835,0.68181175],"study_design_scores_gemma":[0.0016469151,0.00026953095,0.015195182,0.0023146588,0.000009243236,0.00024245284,7.563539e-7,0.52813137,0.0041580945,0.44399992,0.001065556,0.0029663115],"about_ca_topic_score_codex":0.0001079118,"about_ca_topic_score_gemma":0.00018581691,"teacher_disagreement_score":0.6788454,"about_ca_system_score_codex":0.0009920294,"about_ca_system_score_gemma":0.0019340382,"threshold_uncertainty_score":0.99973726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038500322,0.00019999423,0.974399,0.0003995299,0.0010603956,0.00043466158,1.7681589e-7,0.00031192106,0.023155848],"genre_scores_gemma":[0.6001106,0.00071263756,0.37265012,0.0010515209,0.0006231231,0.000037170714,0.000020703204,0.000134026,0.024660103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994575,0.00009721199,0.0009717394,0.0016623603,0.0015447064,0.0011489352],"domain_scores_gemma":[0.99723357,0.0005613707,0.00053502433,0.0012487009,0.00021093088,0.00021043238],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0014484585,0.0006915959,0.0006557687,0.0018623538,0.00047306612,0.00081072113,0.0033717763,0.00042242414,0.0001405219],"category_scores_gemma":[0.0003523065,0.0007209074,0.00014217352,0.0011599432,0.0004966671,0.0009313479,0.0019982364,0.003139857,0.00027795433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018002879,0.000009474928,0.00019449994,0.000024491124,0.000007078985,0.00008053609,0.0010000612,0.8959591,0.00002666361,0.012402527,0.0000069096072,0.090286896],"study_design_scores_gemma":[0.00034355317,0.00041554903,0.00013665791,0.00052906165,0.000005770522,0.000040334216,5.469884e-7,0.98733693,0.000068382105,0.0049506975,0.0054143355,0.0007581717],"about_ca_topic_score_codex":0.00003021724,"about_ca_topic_score_gemma":0.00001797927,"teacher_disagreement_score":0.6017488,"about_ca_system_score_codex":0.00083680754,"about_ca_system_score_gemma":0.0003227981,"threshold_uncertainty_score":0.9995242},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058893715,0.000112268004,0.9967858,0.00039131643,0.0005888482,0.0013376467,0.000013433342,0.00017540854,0.00053638464],"genre_scores_gemma":[0.059299514,0.000016571938,0.939643,0.0006869106,0.00018825002,0.000048934322,0.000006274488,0.0000409305,0.00006956458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594444,0.000031895794,0.0006461711,0.0011049754,0.0013636226,0.00090889964],"domain_scores_gemma":[0.9969434,0.0005377493,0.0003029127,0.0013065685,0.0007172282,0.00019211274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012447231,0.0005448048,0.0004971051,0.000980933,0.00038656837,0.0008458737,0.0029968037,0.00032137035,0.0000030959002],"category_scores_gemma":[0.00044100088,0.0004916029,0.0001502455,0.0004822466,0.0008188618,0.0017679565,0.0014423712,0.0006492129,0.000012568434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012446111,0.000009127132,3.7684057e-7,0.000121672005,0.0000050098924,0.0000031708682,0.00068239786,0.7599996,0.00004017239,0.040435057,0.0000012222062,0.19868976],"study_design_scores_gemma":[0.00026752288,0.00007749817,7.213133e-7,0.00027468396,0.0000046786904,0.00003278678,1.1563743e-7,0.56012326,0.00027187256,0.43858257,0.00005160135,0.00031271775],"about_ca_topic_score_codex":0.000013127852,"about_ca_topic_score_gemma":0.000017079205,"teacher_disagreement_score":0.3981475,"about_ca_system_score_codex":0.001144717,"about_ca_system_score_gemma":0.0016294625,"threshold_uncertainty_score":0.99975353},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054862157,0.00091287674,0.9791043,0.00012490887,0.00763529,0.00031081476,0.000009323631,0.0005005062,0.011347112],"genre_scores_gemma":[0.37151507,0.00020757361,0.5781697,0.002622424,0.012065084,0.00008654163,0.00012050031,0.00073986925,0.034473237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973809,0.000019083129,0.00049138535,0.0007326086,0.0006259608,0.0007500418],"domain_scores_gemma":[0.9985636,0.0001898918,0.000106043364,0.00087208056,0.00009987501,0.00016852023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004362744,0.00052683504,0.0005773013,0.0007902492,0.00014570152,0.00042870463,0.0013760849,0.00045144832,0.000070712624],"category_scores_gemma":[0.000027405624,0.00047600133,0.00012375946,0.00088193314,0.0003099728,0.00020241471,0.00025319235,0.0015094941,0.00015822396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.2244675e-7,0.000008793209,0.000022299075,0.00008869465,0.000011865942,0.00003450797,0.00013158718,0.93106824,0.0008980601,0.00011678945,0.002410284,0.06520828],"study_design_scores_gemma":[0.00016207038,0.00002296761,0.0001158416,0.0005042145,0.000010711493,0.000033449327,5.6372766e-8,0.97507256,0.0016780179,0.004744968,0.016938562,0.00071659434],"about_ca_topic_score_codex":0.00001719599,"about_ca_topic_score_gemma":0.000295919,"teacher_disagreement_score":0.4009346,"about_ca_system_score_codex":0.0003054845,"about_ca_system_score_gemma":0.00032312892,"threshold_uncertainty_score":0.99976915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025118561,0.00069825177,0.9946581,0.00057809113,0.0025113486,0.00058908435,0.000003822142,0.00028340716,0.00042669647],"genre_scores_gemma":[0.37762493,0.000017459079,0.6214974,0.00048009257,0.0002926865,0.000016488804,0.0000108872455,0.000021259313,0.000038783455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692327,0.00005468258,0.0004997723,0.0015012322,0.00044211405,0.0005789137],"domain_scores_gemma":[0.9967772,0.0009863399,0.00029861642,0.0014217987,0.00038916967,0.0001268812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005234094,0.00046403497,0.00052990986,0.000770258,0.00031858718,0.00031506922,0.0028048123,0.0006374154,0.000007854354],"category_scores_gemma":[0.00030250582,0.0004349814,0.00012918076,0.00043575626,0.00058866653,0.000618425,0.00033206362,0.0005112736,0.000017515944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021305397,0.00010461677,0.00013468685,0.00006758522,0.000012701437,0.00002234125,0.0022639325,0.14736906,0.00028353382,0.13806549,0.000028048285,0.7116267],"study_design_scores_gemma":[0.0002175381,0.0003077245,0.00024799554,0.00018224139,0.0000060262196,0.000021501492,1.5415063e-7,0.7628964,0.0022955278,0.23274358,0.00067282753,0.00040845692],"about_ca_topic_score_codex":0.000014090901,"about_ca_topic_score_gemma":0.000112204514,"teacher_disagreement_score":0.71121824,"about_ca_system_score_codex":0.00025746957,"about_ca_system_score_gemma":0.0006789081,"threshold_uncertainty_score":0.9998102},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038426195,0.0025177817,0.984196,0.003865708,0.0015945772,0.0004027288,0.000001785227,0.00018919856,0.007193763],"genre_scores_gemma":[0.11441366,0.00045358352,0.8548449,0.027733091,0.001743613,0.000015062692,0.000007474117,0.00010204302,0.00068652397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954154,0.000051517913,0.0004928197,0.0014706753,0.0016635143,0.0009061026],"domain_scores_gemma":[0.99597347,0.0012249048,0.0002651177,0.0020750975,0.0001740971,0.00028733804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014606065,0.0005957481,0.0004436449,0.0012393899,0.00047595202,0.0009591915,0.00494657,0.0002931794,0.00006905277],"category_scores_gemma":[0.00014404482,0.00041005702,0.0002727356,0.0015345707,0.00076473225,0.00051646074,0.00093914487,0.0012514797,0.000047178084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007646081,0.00005384486,0.00024198106,0.000102869446,0.0000246707,0.00010655051,0.0003143599,0.013824911,0.000031294512,0.16295728,0.0002980616,0.8220365],"study_design_scores_gemma":[0.00070531067,0.00037551275,0.002065564,0.0026601588,0.00002824985,0.00006559181,2.3825663e-7,0.8362015,0.0013844148,0.118765734,0.036205005,0.0015427488],"about_ca_topic_score_codex":0.000037657013,"about_ca_topic_score_gemma":0.00009606207,"teacher_disagreement_score":0.82237655,"about_ca_system_score_codex":0.00014604387,"about_ca_system_score_gemma":0.00079904875,"threshold_uncertainty_score":0.99983513},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017758524,0.0004264205,0.9907869,0.00046039038,0.0013414423,0.00034132626,0.0000027860824,0.00025180005,0.0046131015],"genre_scores_gemma":[0.28498164,0.00016748325,0.71088755,0.0019756118,0.00088269205,0.000012199787,0.0000030032652,0.000068696165,0.0010211068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99522394,0.000030797128,0.000565235,0.0018560897,0.0013897179,0.00093421014],"domain_scores_gemma":[0.9971466,0.000351088,0.00031495257,0.0016583726,0.00029536508,0.00023362173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043443358,0.000642896,0.0005839861,0.0008087867,0.00035561333,0.0005407838,0.0043132817,0.00031440402,0.00002766965],"category_scores_gemma":[0.00006388185,0.00053316756,0.00011481055,0.00072375365,0.0014329315,0.00088489836,0.001240143,0.0009343591,0.00014269965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000137303205,0.000038337188,0.00035174782,0.000021081023,0.000019243358,0.00087740744,0.0031963976,0.09207852,0.00022058563,0.013875109,0.00007597676,0.88923186],"study_design_scores_gemma":[0.00016799709,0.00040203397,0.00029896072,0.00053168094,0.000008233722,0.0007227848,3.1747823e-7,0.9275812,0.007472689,0.05818017,0.0032019909,0.0014319432],"about_ca_topic_score_codex":0.000052419706,"about_ca_topic_score_gemma":0.00013771659,"teacher_disagreement_score":0.8877999,"about_ca_system_score_codex":0.00030841277,"about_ca_system_score_gemma":0.0007786829,"threshold_uncertainty_score":0.999712},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003716453,0.0004683205,0.99782455,0.00006185613,0.000053027896,0.00022572376,0.0000076256856,0.000023303093,0.0009639487],"genre_scores_gemma":[0.15304835,0.00005212493,0.8467454,0.00010651242,0.0000121169805,0.0000044612334,0.000008286983,0.0000061415567,0.000016649856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979296,0.0000620196,0.0004508885,0.0009960884,0.00032520952,0.00023623432],"domain_scores_gemma":[0.99761885,0.00089954503,0.00025211045,0.0009719679,0.00018935236,0.00006818822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038435652,0.00020510088,0.0003908376,0.001484559,0.00007392567,0.00021713966,0.0010017941,0.00011273723,0.0000012285907],"category_scores_gemma":[0.00011398284,0.0001969581,0.000027155755,0.0023028397,0.0003092031,0.0004495302,0.0010160847,0.00022092885,5.907957e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017384519,0.000014463234,0.0026377286,0.00002627063,0.000016989714,0.0000030766819,0.00020623102,0.035614084,0.00007031401,0.017997788,6.771775e-7,0.94341063],"study_design_scores_gemma":[0.00007557809,0.00002615921,0.057941597,0.000047110283,0.000016832328,0.0000024728613,9.944258e-8,0.9097109,0.00008468421,0.03187675,0.000037921433,0.00017993552],"about_ca_topic_score_codex":0.0006035396,"about_ca_topic_score_gemma":0.0007963675,"teacher_disagreement_score":0.9432307,"about_ca_system_score_codex":0.00006396075,"about_ca_system_score_gemma":0.000094554816,"threshold_uncertainty_score":0.8031719},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015855759,0.002632004,0.9919927,0.00005583613,0.0015672835,0.0005254072,0.000026648231,0.00028152793,0.0013330191],"genre_scores_gemma":[0.8286036,0.00025461303,0.16930506,0.00034672092,0.0006858579,0.000055706972,0.000030202942,0.00016431339,0.0005539019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804676,0.000005992695,0.00043072895,0.0006531798,0.0002996818,0.00056367],"domain_scores_gemma":[0.9989241,0.00021510138,0.0000883741,0.0005698937,0.00009404346,0.000108510925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045227827,0.00045070052,0.000452816,0.0005664781,0.00014388365,0.00011134933,0.0008330707,0.00032473388,0.000021492462],"category_scores_gemma":[0.000019113368,0.00043565704,0.00017365877,0.00031377314,0.0002103633,0.00015397834,0.000097258475,0.0005317726,0.000021068536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015544785,0.000021309817,0.000020490772,0.0004551376,0.0000584377,0.000018572848,0.0005800246,0.50613666,0.006423932,0.032706726,0.000025557158,0.45353758],"study_design_scores_gemma":[0.0002794308,0.000092492875,0.000009275504,0.00057615817,0.000014667498,0.000034517772,2.2999484e-7,0.8206666,0.0018536028,0.17272763,0.0030872473,0.00065812614],"about_ca_topic_score_codex":0.000002563051,"about_ca_topic_score_gemma":0.000064215004,"teacher_disagreement_score":0.827018,"about_ca_system_score_codex":0.00014251015,"about_ca_system_score_gemma":0.000057703222,"threshold_uncertainty_score":0.9998095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015466571,0.001803502,0.99460447,0.0006242019,0.0015142935,0.00068888837,0.000015198211,0.0005019973,0.0002459115],"genre_scores_gemma":[0.0016689874,0.00001017336,0.99589384,0.0018946572,0.00030773747,0.000025942394,0.000034807745,0.000033976154,0.0001298619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962245,0.00005080843,0.00058488833,0.0015851377,0.00074650894,0.00080813986],"domain_scores_gemma":[0.9966088,0.0011927208,0.00040597486,0.0012208092,0.0004036371,0.00016808075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028879647,0.00055873516,0.000540604,0.0006815174,0.0003098431,0.0006179122,0.0032041387,0.00046280448,0.0000074312757],"category_scores_gemma":[0.00034621477,0.0005038939,0.00020296611,0.0007144294,0.0004076957,0.00054066407,0.0009110908,0.0007624725,0.0000038126761],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010426367,0.000017678592,0.0000027200233,0.00006670834,0.0000051625007,0.000018092634,0.000097616656,0.00046144502,0.0004850385,0.027480721,0.000042670315,0.97131175],"study_design_scores_gemma":[0.00029502972,0.00017666428,0.0000073380534,0.0006821561,0.000013686656,0.000027753651,7.924835e-8,0.60950387,0.048067667,0.3330929,0.007324152,0.0008087185],"about_ca_topic_score_codex":0.000009411952,"about_ca_topic_score_gemma":0.000012694624,"teacher_disagreement_score":0.970503,"about_ca_system_score_codex":0.0007569861,"about_ca_system_score_gemma":0.0005447538,"threshold_uncertainty_score":0.99974126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028168296,0.00009312545,0.99511784,0.0005390138,0.00076936866,0.00034973098,0.0000057397015,0.00006167135,0.00024666302],"genre_scores_gemma":[0.8264843,0.000020299876,0.17246477,0.0007034789,0.0001457353,0.000014330018,0.000007706719,0.000027358334,0.00013200281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974028,0.000029785748,0.00039863316,0.001239733,0.00035012857,0.0005789474],"domain_scores_gemma":[0.99891007,0.00032661983,0.00023835718,0.00041273152,0.000036171623,0.00007603121],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068796834,0.00036668676,0.00039658838,0.0006577081,0.00017730103,0.00023131387,0.0008880124,0.00029704077,0.0000048567576],"category_scores_gemma":[0.00009843607,0.00035384364,0.00006735643,0.00022636795,0.00033415595,0.00038827234,0.0006666819,0.0006482997,0.000007959702],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014383126,0.00007664676,0.0022363255,0.000030601146,0.000010609439,0.000036452497,0.00028242305,0.0015589434,0.00049559807,0.0074601537,0.000009122,0.98778874],"study_design_scores_gemma":[0.0013142677,0.00052151625,0.0118174255,0.000594813,0.000012368046,0.00009657711,0.0000010623667,0.927678,0.0029617548,0.050010927,0.0040027834,0.0009885303],"about_ca_topic_score_codex":0.0000324645,"about_ca_topic_score_gemma":0.00022559798,"teacher_disagreement_score":0.9868002,"about_ca_system_score_codex":0.00021367773,"about_ca_system_score_gemma":0.000066485736,"threshold_uncertainty_score":0.99989134},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012423436,0.00064434204,0.99256086,0.00013975294,0.0006763377,0.00035722362,0.000008053259,0.00005877908,0.004312316],"genre_scores_gemma":[0.47555524,0.000070969305,0.5239497,0.00017804197,0.00014340656,0.0000114590375,0.000008085065,0.000017452583,0.0000656224],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665517,0.00003792084,0.0007034173,0.0011078134,0.00096585724,0.00052982656],"domain_scores_gemma":[0.9977961,0.00068948575,0.00028885202,0.0009831295,0.0001669531,0.000075488744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008549655,0.0003818046,0.0005453366,0.0010037716,0.00012082551,0.00026829008,0.0022093235,0.0002477386,0.000012173365],"category_scores_gemma":[0.00012838621,0.00031656335,0.00010031068,0.00077070016,0.0007419302,0.0005428286,0.0009022775,0.00047688067,0.000009878445],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001136943,0.00006246019,0.000408646,0.00008518761,0.0000036656484,0.00008970378,0.00046464597,0.2783925,0.00007027729,0.04096875,0.00005049611,0.67939234],"study_design_scores_gemma":[0.00019077574,0.00015371299,0.0011971669,0.0005190873,0.0000032580567,0.000025195091,1.3895385e-7,0.38216665,0.0002911872,0.6147927,0.0003075799,0.00035254218],"about_ca_topic_score_codex":0.00015623098,"about_ca_topic_score_gemma":0.00084449037,"teacher_disagreement_score":0.6790398,"about_ca_system_score_codex":0.00026292118,"about_ca_system_score_gemma":0.000457599,"threshold_uncertainty_score":0.99992865},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001481225,0.0004618542,0.98239106,0.000790925,0.0018048399,0.00062545325,0.0000054175193,0.00020127538,0.013571036],"genre_scores_gemma":[0.3227607,0.0000865666,0.67221826,0.00305507,0.0009900142,0.000041335134,0.000024659726,0.00007042494,0.0007529733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941196,0.00007218668,0.0010246853,0.0022277741,0.0015201018,0.0010356462],"domain_scores_gemma":[0.99650365,0.0005928142,0.0003814344,0.0018694624,0.00043714684,0.00021548069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016544547,0.0006428329,0.00059606583,0.0016000152,0.00023430242,0.0004115455,0.004187513,0.00056100026,0.000035283356],"category_scores_gemma":[0.00016781258,0.00063671794,0.0001655105,0.0011549665,0.0010232985,0.00095864566,0.0012319391,0.0013460547,0.00035111044],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000115790335,0.00013090031,0.0013370486,0.00005031955,0.0000083891455,0.00009454112,0.0012060344,0.020998787,0.00011995841,0.01775189,0.00007922726,0.9582113],"study_design_scores_gemma":[0.000106564155,0.00013531192,0.0020581337,0.0002921231,0.0000042194333,0.0000597764,0.0000010905668,0.93334144,0.00033447982,0.05971456,0.0031876452,0.0007646628],"about_ca_topic_score_codex":0.00016795036,"about_ca_topic_score_gemma":0.00033407944,"teacher_disagreement_score":0.95744663,"about_ca_system_score_codex":0.00095471105,"about_ca_system_score_gemma":0.0006689694,"threshold_uncertainty_score":0.9996084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000051033885,0.0015360083,0.98476416,0.00016628312,0.0004705421,0.00031657805,0.0000074313925,0.00030872563,0.012425172],"genre_scores_gemma":[0.12248688,0.0001357165,0.87502927,0.0007373318,0.00025233338,0.0000068621393,0.0000061500295,0.000044087534,0.0013013572],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99641854,0.00002282261,0.00058676774,0.001311556,0.001049807,0.0006105173],"domain_scores_gemma":[0.9973623,0.00026471235,0.00036178256,0.0015360645,0.0003505798,0.00012454538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005160546,0.0005237064,0.00065879134,0.0008406465,0.00013123226,0.00020629606,0.0033485678,0.00036304706,0.0000075290272],"category_scores_gemma":[0.000029312152,0.00046620367,0.00018234111,0.00074688054,0.0011357298,0.0011169729,0.0013633681,0.000769872,0.000008680734],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008060648,0.000032865086,0.0000042516776,0.000046369703,0.000006299979,0.00006796798,0.00010667785,0.11682554,0.00022406336,0.06985235,0.00024331373,0.81258225],"study_design_scores_gemma":[0.00015945903,0.0002091994,0.000027542215,0.00037592812,0.0000064334167,0.000059088852,7.307434e-8,0.22373714,0.07665512,0.6969403,0.0012730566,0.0005566732],"about_ca_topic_score_codex":0.000059965954,"about_ca_topic_score_gemma":0.000023004091,"teacher_disagreement_score":0.81202555,"about_ca_system_score_codex":0.00021166207,"about_ca_system_score_gemma":0.0004248556,"threshold_uncertainty_score":0.999779},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023793168,0.0029064817,0.9694519,0.00012999124,0.00082112534,0.0012591252,0.000103873645,0.00003241612,0.0015019403],"genre_scores_gemma":[0.98487425,0.0000676497,0.014288949,0.00023796129,0.00029296346,0.000021644319,0.000085692336,0.000021803253,0.000109077606],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986676,0.000006742245,0.0003155555,0.00040271247,0.00036602383,0.00024137215],"domain_scores_gemma":[0.9990568,0.00012142835,0.00019606928,0.0003701989,0.00016006255,0.00009540815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018365623,0.00021315664,0.0003643371,0.00017995284,0.00005010767,0.000022643471,0.00012915223,0.00008100825,0.000015180234],"category_scores_gemma":[0.000027372698,0.00017925506,0.00084709254,0.00008427113,0.0001870004,0.00009860627,0.000021920141,0.00011012024,0.00000472848],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025548812,0.00022817349,0.02663264,0.0008177546,0.00050986104,0.000009802924,0.00064566365,0.0011945333,0.0012715766,0.0020485842,0.000026134594,0.9663598],"study_design_scores_gemma":[0.011297655,0.0040444117,0.7970246,0.006381859,0.007817925,0.00065579603,0.0000021324217,0.02676454,0.030226488,0.11022596,0.002785204,0.0027734141],"about_ca_topic_score_codex":0.000020057392,"about_ca_topic_score_gemma":0.000007320176,"teacher_disagreement_score":0.9635864,"about_ca_system_score_codex":0.0001218545,"about_ca_system_score_gemma":0.00018884125,"threshold_uncertainty_score":0.7309809},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016126377,0.00070314243,0.99375015,0.00021177733,0.002035104,0.00096275227,0.000019366676,0.00028184857,0.00042323448],"genre_scores_gemma":[0.34691802,0.00005068748,0.651616,0.0006543395,0.00056973996,0.000055794077,0.000010519161,0.00003726879,0.00008763307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952059,0.0000298843,0.00082430284,0.0020648863,0.0010024294,0.0008726399],"domain_scores_gemma":[0.996649,0.0004754748,0.00038125776,0.0018711338,0.00042479782,0.00019828288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012928654,0.0006927909,0.00080294075,0.00051308377,0.00054449803,0.00056955346,0.003487573,0.00047777288,0.000010315561],"category_scores_gemma":[0.0000626265,0.00058249786,0.00026147,0.00044533177,0.000437747,0.0015988443,0.0008862504,0.000666241,0.000025860558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009558774,0.000019592435,0.000030453282,0.00008266091,0.00001584574,0.0000060159623,0.0008129559,0.68912953,0.00011285549,0.0051571615,0.0000060417565,0.30461732],"study_design_scores_gemma":[0.00036338516,0.00015249527,0.00002204493,0.0004309075,0.000012652142,0.000012995217,9.400996e-8,0.79502136,0.0015955755,0.20173582,0.00006815733,0.00058454],"about_ca_topic_score_codex":0.00007014235,"about_ca_topic_score_gemma":0.00003920085,"teacher_disagreement_score":0.34530538,"about_ca_system_score_codex":0.0006136713,"about_ca_system_score_gemma":0.0013884341,"threshold_uncertainty_score":0.99966264},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03826367,0.00041977217,0.95654464,0.0016352151,0.0022015295,0.0005355729,0.0000021911267,0.00009669976,0.00030073788],"genre_scores_gemma":[0.41201714,0.000051805342,0.586568,0.0008509753,0.00037964387,0.000014867676,6.464792e-7,0.000022011689,0.00009491985],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750894,0.000029245099,0.00039880135,0.0010423224,0.00061508967,0.00040562],"domain_scores_gemma":[0.9983937,0.00026147222,0.00018515387,0.00079043646,0.00021159435,0.00015762365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007916191,0.0003707261,0.00033228166,0.00032161857,0.0003701449,0.00095887674,0.0010045222,0.0001864752,0.000002943296],"category_scores_gemma":[0.00018020494,0.00026526148,0.000060850816,0.00038358063,0.0014899857,0.0012051421,0.0011573172,0.0004264554,0.000003420199],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021013673,0.0000047953695,0.000044891924,0.000047187285,0.0000048305956,0.0000037646003,0.00131843,0.0012907627,0.00023235605,0.010818201,0.000002181928,0.9862305],"study_design_scores_gemma":[0.000088868386,0.00022912365,0.0005157016,0.0011798189,0.000017524764,0.0011246069,0.0000026091993,0.37165123,0.0031453643,0.6213143,0.00019529127,0.0005355709],"about_ca_topic_score_codex":0.000067098204,"about_ca_topic_score_gemma":0.0001812501,"teacher_disagreement_score":0.98569494,"about_ca_system_score_codex":0.00016933437,"about_ca_system_score_gemma":0.00040463117,"threshold_uncertainty_score":0.99998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005413943,0.003251344,0.99262893,0.00017216546,0.0018983837,0.0006989204,0.000011693284,0.00019884823,0.0005983296],"genre_scores_gemma":[0.46290576,0.000064368774,0.53540164,0.0006530362,0.00052512425,0.000021031046,0.000024132309,0.000050864728,0.0003540273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99568665,0.000031299816,0.0006075503,0.0019237038,0.0007395476,0.0010112361],"domain_scores_gemma":[0.9973423,0.0006361719,0.0003554779,0.0012514465,0.00024651564,0.00016809432],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009848505,0.0006590408,0.0006632039,0.0010915485,0.00032752095,0.00113543,0.0030748325,0.00033100665,0.0000052734563],"category_scores_gemma":[0.00030974855,0.00058082625,0.00016021405,0.00078197266,0.00043862232,0.0018673552,0.0013544008,0.0010177187,0.0000111267545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022251214,0.00011485787,0.0003937504,0.0005007825,0.000015668023,0.0007435489,0.0057200757,0.013689055,0.00089422945,0.06117606,0.000031266773,0.91669846],"study_design_scores_gemma":[0.0008146937,0.00013208388,0.00035471874,0.0024957003,0.0000146631955,0.00014258857,0.0000016639301,0.9383751,0.0021940516,0.053740125,0.00047488752,0.0012597048],"about_ca_topic_score_codex":0.00009248402,"about_ca_topic_score_gemma":0.0008106437,"teacher_disagreement_score":0.9246861,"about_ca_system_score_codex":0.0006210646,"about_ca_system_score_gemma":0.0008834712,"threshold_uncertainty_score":0.9999015},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004439571,0.0001926473,0.99588096,0.00039355824,0.00026433732,0.0006558718,0.0000067598367,0.0015194587,0.001042013],"genre_scores_gemma":[0.099560075,0.000056973437,0.8987304,0.0013064826,0.00013220486,0.000040360937,0.000006488137,0.00005883082,0.00010816822],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947366,0.00004177367,0.0007031166,0.0022709717,0.0013707931,0.00087673805],"domain_scores_gemma":[0.9961289,0.00029976654,0.00054154854,0.0022387004,0.00049686746,0.00029421557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007426974,0.000814877,0.00091254263,0.003020692,0.00034547248,0.0006349239,0.0035064803,0.0003643518,0.00003826976],"category_scores_gemma":[0.0000912292,0.00070899545,0.00023895327,0.0030764895,0.00086058123,0.0012436802,0.0011629049,0.0010469923,0.000013721499],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105624285,0.000036914793,0.00004016962,0.000038407634,0.00011263908,0.00026721394,0.000514427,0.046968594,0.00032903563,0.02545754,0.000005260011,0.9262192],"study_design_scores_gemma":[0.00054165494,0.0015405507,0.00010686491,0.001761667,0.00028417492,0.00033947363,7.6714554e-7,0.15801398,0.13140883,0.70103693,0.0015474567,0.00341764],"about_ca_topic_score_codex":0.000069935544,"about_ca_topic_score_gemma":0.00018350843,"teacher_disagreement_score":0.9228016,"about_ca_system_score_codex":0.0010463345,"about_ca_system_score_gemma":0.0008603342,"threshold_uncertainty_score":0.9995361},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008386725,0.0010053457,0.99392164,0.00096535037,0.0009659006,0.00023536562,0.000002032224,0.00018015597,0.0018855332],"genre_scores_gemma":[0.43991318,0.00009929099,0.5564643,0.002572717,0.00044350562,0.000005703209,0.000003019832,0.000040032977,0.00045826266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967247,0.00004234083,0.0005029145,0.0014715822,0.00059873,0.0006597298],"domain_scores_gemma":[0.99804085,0.00053675426,0.00023484296,0.00095729064,0.000084112085,0.00014611683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00099612,0.00047401083,0.00050776376,0.00072700315,0.0001759985,0.00042738553,0.0022495484,0.00028591938,0.0000149478865],"category_scores_gemma":[0.00011656316,0.00042371388,0.00006626717,0.0006738818,0.0006686984,0.00063464,0.0014660351,0.0007908833,0.000030396805],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047651747,0.00005362615,0.0013364136,0.00008734975,0.0000057543853,0.0006869827,0.0012152849,0.014329795,0.00012073823,0.097767375,0.000017876722,0.884374],"study_design_scores_gemma":[0.00022215124,0.000095233445,0.0004400198,0.00048115212,0.0000023939492,0.00014630875,1.9029208e-7,0.7992298,0.00012376516,0.198094,0.0006275414,0.0005374399],"about_ca_topic_score_codex":0.00005048467,"about_ca_topic_score_gemma":0.000056667464,"teacher_disagreement_score":0.8838366,"about_ca_system_score_codex":0.00015052065,"about_ca_system_score_gemma":0.00016721283,"threshold_uncertainty_score":0.9998215},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012182295,0.00028522368,0.98496455,0.0071800337,0.003873027,0.0011125655,0.000029055243,0.0004761558,0.00086114113],"genre_scores_gemma":[0.7950861,0.000065793494,0.1853914,0.014656159,0.0016785288,0.00009531316,0.000011056295,0.00013733773,0.0028783628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936801,0.0000673994,0.0007249623,0.0025477994,0.0016189489,0.0013607825],"domain_scores_gemma":[0.9946543,0.00072726264,0.000685824,0.002794633,0.0005606202,0.0005773794],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012070525,0.00093973626,0.0010635869,0.0010665646,0.0004556257,0.0012452694,0.005026886,0.0005316468,0.000022164651],"category_scores_gemma":[0.0004631481,0.0007855689,0.00025524778,0.0012148959,0.0006945837,0.00083900406,0.0018235807,0.0010463694,0.00014851298],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024347979,0.00013294922,0.015067423,0.00046144327,0.000076530065,0.0007243219,0.004399787,0.037442226,0.00016920266,0.001317812,0.0019298175,0.9382541],"study_design_scores_gemma":[0.0052368706,0.0034162998,0.031240407,0.0125415,0.00015564324,0.0018236315,0.0000138681735,0.7635386,0.0058037103,0.058846768,0.10283333,0.014549378],"about_ca_topic_score_codex":0.00004910529,"about_ca_topic_score_gemma":0.00017745489,"teacher_disagreement_score":0.92370474,"about_ca_system_score_codex":0.0012357781,"about_ca_system_score_gemma":0.0005418801,"threshold_uncertainty_score":0.99979156},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02757884,0.00017521446,0.96434295,0.000018710429,0.0016167959,0.0006154638,0.000013796574,0.000044021504,0.0055941786],"genre_scores_gemma":[0.95350385,0.00004678411,0.045673687,0.00016343851,0.00032460043,0.000022041579,0.000042647538,0.000068330606,0.00015462031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986451,0.000012143983,0.000300239,0.00041338845,0.00034837917,0.00028069498],"domain_scores_gemma":[0.99936134,0.000117956406,0.000050690625,0.00038719364,0.00003669641,0.000046135458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044753635,0.00031046485,0.0003571341,0.00048078757,0.000036294212,0.00005750699,0.00033345554,0.00022214164,0.00002168611],"category_scores_gemma":[0.000022623688,0.00027037517,0.00006838712,0.00021954933,0.0001042399,0.00008777456,0.00005530419,0.00042369938,0.000013486715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004058988,0.000006419759,0.000020435395,0.00008906401,0.0000045676143,0.000011343065,0.00008474445,0.9176752,0.00032491118,0.00036034477,0.000014234113,0.081404656],"study_design_scores_gemma":[0.00023827425,0.00025403732,0.00002659336,0.0001810356,0.000004599349,0.0000050879207,7.0777793e-9,0.994346,0.0025889617,0.0020418556,0.00006795906,0.0002455395],"about_ca_topic_score_codex":0.0000058036153,"about_ca_topic_score_gemma":0.00009271517,"teacher_disagreement_score":0.925925,"about_ca_system_score_codex":0.00020885587,"about_ca_system_score_gemma":0.0000363049,"threshold_uncertainty_score":0.99997485},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003153952,0.0004991738,0.9974416,0.000017031201,0.00015500661,0.0001809624,0.000023215003,0.00012775177,0.0012398646],"genre_scores_gemma":[0.5853649,0.000052739106,0.41396898,0.00017140187,0.00022679416,0.000006116595,0.000054979406,0.00004913375,0.00010498784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998062,0.000009220574,0.00033549804,0.00082402816,0.00037147125,0.00039778632],"domain_scores_gemma":[0.99900347,0.00015673187,0.00008010281,0.00051950064,0.00011846089,0.00012171558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050137326,0.00039464052,0.00060955685,0.0010156055,0.0001199655,0.00014300577,0.0005208706,0.00028844262,0.00003258174],"category_scores_gemma":[0.000030040419,0.0003570435,0.00024401354,0.0006569982,0.00021095952,0.00009287867,0.00009274017,0.0003847171,0.0000024872418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000832941,0.000010224741,0.00006901052,0.00010051952,0.00013594046,0.0000043926457,0.00014019969,0.86185396,0.0000651153,0.000053956835,0.000004531025,0.13755381],"study_design_scores_gemma":[0.0001447568,0.00004779878,0.000025759095,0.000054363867,0.00028975555,0.0000018831122,7.3685705e-8,0.9964788,0.00029613575,0.0021399932,0.00010303073,0.00041767926],"about_ca_topic_score_codex":0.000013505519,"about_ca_topic_score_gemma":0.000017880855,"teacher_disagreement_score":0.5850495,"about_ca_system_score_codex":0.00009441123,"about_ca_system_score_gemma":0.00007293601,"threshold_uncertainty_score":0.9998882},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039930965,0.00022041745,0.9966076,0.00044941567,0.00037205438,0.00016742799,0.00000707095,0.00009877456,0.0020372977],"genre_scores_gemma":[0.2493488,0.00006190942,0.747045,0.0016805279,0.0010819054,0.000021711134,0.000012302781,0.00007684972,0.0006710173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893725,0.000008876592,0.00020196491,0.00035777807,0.00026389817,0.00023021168],"domain_scores_gemma":[0.99895656,0.00053741835,0.000045181536,0.00036634866,0.00005824812,0.00003623769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056045916,0.0002189639,0.00021599121,0.00024553266,0.000113945796,0.000111395595,0.00047341094,0.00012830715,0.000025435838],"category_scores_gemma":[0.00004938495,0.00015296366,0.00010995302,0.00014437837,0.00006587595,0.00005975988,0.000047108428,0.00031314077,0.00001614334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.814444e-7,0.000001662533,1.81548e-7,0.00000968683,0.0000069386897,4.7119534e-7,0.00009071426,0.71238464,0.000059750753,0.0024204596,0.00005866269,0.28496587],"study_design_scores_gemma":[0.00005154166,0.00002781742,0.0000012050084,0.00008820678,0.000013154032,0.0000021109176,6.1177474e-8,0.9434144,0.0006257326,0.054574188,0.0010275228,0.00017408583],"about_ca_topic_score_codex":0.0000039801207,"about_ca_topic_score_gemma":0.000027402144,"teacher_disagreement_score":0.28479177,"about_ca_system_score_codex":0.00011812499,"about_ca_system_score_gemma":0.000034491764,"threshold_uncertainty_score":0.62376773},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027679796,0.00055435207,0.9918208,0.0001634722,0.0010250567,0.0013289413,0.00014050216,0.0007324148,0.0042316676],"genre_scores_gemma":[0.0092251375,0.00005565408,0.9888636,0.0005355681,0.00021767008,0.000100246165,0.000033303502,0.0000477534,0.000921109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955267,0.00001755118,0.0005506915,0.00215989,0.00079911324,0.00094608567],"domain_scores_gemma":[0.9961454,0.00088432734,0.00039639382,0.0022446066,0.00021064901,0.00011859028],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004887454,0.0006571221,0.0006097278,0.0009306017,0.00039073234,0.00036771898,0.0056164446,0.00034533703,0.00007150216],"category_scores_gemma":[0.00008964978,0.0006341573,0.00016165711,0.0007020987,0.00082182063,0.0007297208,0.0039838273,0.00074392365,0.00007517383],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031969369,0.000024981575,0.0000010195259,0.000043200012,0.000017141723,0.000095362506,0.00022313702,0.047528088,0.0000068519357,0.041636683,0.00071043125,0.90970993],"study_design_scores_gemma":[0.00031535194,0.0003559901,0.000010255374,0.00039567056,0.0000112561975,0.000046192974,0.0000010579531,0.7840487,0.00040354027,0.19440417,0.019136962,0.00087087776],"about_ca_topic_score_codex":0.000005036181,"about_ca_topic_score_gemma":0.000010035997,"teacher_disagreement_score":0.90883905,"about_ca_system_score_codex":0.0005447609,"about_ca_system_score_gemma":0.00010491945,"threshold_uncertainty_score":0.99976367},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028410709,0.000109050954,0.96700287,0.0036282844,0.00038028386,0.00013155134,1.5422223e-7,0.000083173225,0.0002539305],"genre_scores_gemma":[0.87480545,0.0000053003496,0.12412071,0.0009657138,0.00007567029,0.000005486262,1.0841773e-7,0.0000050316626,0.000016509342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808717,0.00017644747,0.00021894234,0.00054815173,0.0005770072,0.0003922655],"domain_scores_gemma":[0.9984054,0.0007116762,0.000110686546,0.0006232202,0.000085790314,0.000063220315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000840857,0.00015824163,0.00017366878,0.0001661334,0.0002861404,0.00019264399,0.0019586121,0.00004489269,0.000049579266],"category_scores_gemma":[0.0004391261,0.000095285024,0.00005306706,0.0014297368,0.0005392272,0.0002452949,0.00040651354,0.0005403002,0.00004662983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016918734,0.000057262794,0.0011555617,0.0000061563187,0.0000027056722,0.000009272393,0.0030476202,0.4052904,0.00028428258,0.00820219,0.00003438904,0.58190846],"study_design_scores_gemma":[0.00015675528,0.00022564013,0.0008681327,0.000048037942,6.8378824e-7,0.000013212809,8.1862123e-7,0.9921871,0.0016687977,0.0045036413,0.00019289415,0.00013428264],"about_ca_topic_score_codex":0.000028058646,"about_ca_topic_score_gemma":0.0000022252434,"teacher_disagreement_score":0.8463948,"about_ca_system_score_codex":0.00003206463,"about_ca_system_score_gemma":0.00004081962,"threshold_uncertainty_score":0.38856107},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006470918,0.00014170204,0.9940697,0.0015494829,0.001872846,0.00051435357,0.000004891715,0.00020398825,0.0009959306],"genre_scores_gemma":[0.4470258,0.000018817722,0.5513715,0.0007856711,0.0006440937,0.00002033406,0.000009589644,0.000025735422,0.0000984234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960072,0.00003662611,0.0005381832,0.0018044761,0.0009872885,0.0006262118],"domain_scores_gemma":[0.99752307,0.00011410775,0.0002728565,0.0017085965,0.00019023298,0.00019113156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058502855,0.00048253618,0.00038732824,0.00023432824,0.0005695492,0.00056752434,0.0023298748,0.00018166224,0.000023200751],"category_scores_gemma":[0.0000090266585,0.0004347971,0.00012319417,0.0005360547,0.00050345174,0.000678729,0.0010965178,0.000635272,0.000035709105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030388198,0.0000613561,0.0000016438303,0.000011099434,0.0000044388007,0.000015409074,0.00029598677,0.7607423,0.00043651572,0.10539022,0.0000069692987,0.13303101],"study_design_scores_gemma":[0.00028329968,0.00013935391,0.00007268507,0.00025293897,0.0000068238023,0.000112253074,1.7313674e-7,0.6485785,0.0014897794,0.34818023,0.0003256728,0.00055827765],"about_ca_topic_score_codex":0.000099581215,"about_ca_topic_score_gemma":0.000053900545,"teacher_disagreement_score":0.4463787,"about_ca_system_score_codex":0.0005327562,"about_ca_system_score_gemma":0.00039476866,"threshold_uncertainty_score":0.9998104},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010597221,0.0008232084,0.9926496,0.0022704825,0.0011330993,0.00024071177,0.000005032003,0.00006994274,0.002701942],"genre_scores_gemma":[0.5213906,0.00017723665,0.47380817,0.0025358386,0.0006854349,0.0000065818112,0.000006830726,0.00003183663,0.001357447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971505,0.000042557713,0.00054812717,0.0008688771,0.001015229,0.00037471266],"domain_scores_gemma":[0.9972887,0.00049641775,0.0003999282,0.0014665608,0.0002613092,0.000087108114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017587019,0.00027641622,0.0003435424,0.00089894264,0.0002421642,0.0004374062,0.0042717564,0.0002238707,0.000028906832],"category_scores_gemma":[0.00015259237,0.00020460847,0.00012460815,0.0013785111,0.00063196075,0.0004165736,0.0010315534,0.0006900238,0.000025954716],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013544887,0.000017934759,0.000022815804,0.000029907169,0.00000845787,0.0000074572936,0.0016336329,0.0052423733,0.00016744237,0.06072472,0.00007390013,0.93207],"study_design_scores_gemma":[0.00030460724,0.00009423532,0.0004892203,0.00045688607,0.00001489457,0.0000769077,8.188065e-7,0.84125966,0.0044140248,0.11613268,0.035882723,0.0008733556],"about_ca_topic_score_codex":0.000030429743,"about_ca_topic_score_gemma":0.0000441747,"teacher_disagreement_score":0.93119663,"about_ca_system_score_codex":0.00015719408,"about_ca_system_score_gemma":0.0003477618,"threshold_uncertainty_score":0.8343691},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003843117,0.00077282084,0.9931566,0.0008007213,0.0013750428,0.000608167,0.00001753569,0.00029494028,0.0029357094],"genre_scores_gemma":[0.09088293,0.00022089733,0.9019194,0.0053165304,0.0009557989,0.00005904917,0.000052854757,0.00008366616,0.0005088277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960253,0.000020178659,0.0005206314,0.0017341812,0.001001853,0.0006978036],"domain_scores_gemma":[0.9975091,0.00037825468,0.0002822347,0.0011653638,0.00048060837,0.0001843983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037974268,0.00058007496,0.0004906503,0.0009956334,0.00050698884,0.0003194981,0.0029816097,0.00036525354,0.0000069377716],"category_scores_gemma":[0.000015734178,0.00054396386,0.00019321028,0.00073715637,0.0003083207,0.0010078064,0.00084942486,0.00051751937,0.000016423402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066388934,0.000022488863,0.0000026630667,0.000045449706,0.000012166497,0.000008581791,0.001092284,0.7776456,0.000031252635,0.03206895,0.00004411231,0.18901983],"study_design_scores_gemma":[0.0002094725,0.00007660413,0.0000031965146,0.00012913044,0.0000066818666,0.000055501827,7.30026e-8,0.7070115,0.00036312026,0.29088002,0.0008388984,0.00042581029],"about_ca_topic_score_codex":0.000026970849,"about_ca_topic_score_gemma":0.00015013388,"teacher_disagreement_score":0.25881106,"about_ca_system_score_codex":0.0002726278,"about_ca_system_score_gemma":0.00096878636,"threshold_uncertainty_score":0.9997012},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028947974,0.00016989151,0.9949707,0.00048281506,0.0013412214,0.00058072177,0.000010388882,0.00027154703,0.001883265],"genre_scores_gemma":[0.043231785,0.0000153605,0.95498914,0.0007374717,0.00059246604,0.000013629157,0.000009991299,0.000047093235,0.00036306237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954063,0.000032254586,0.00051864545,0.002131396,0.001097279,0.00081406604],"domain_scores_gemma":[0.9961977,0.00028828243,0.00038798136,0.0025277766,0.0003327306,0.00026555324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084744603,0.0006729778,0.0006085041,0.00052311626,0.00044580307,0.0010306295,0.0042269947,0.00043009516,0.000020229729],"category_scores_gemma":[0.00006700556,0.0004987305,0.00010429862,0.00047607362,0.00092526374,0.0012572514,0.0026089398,0.0015877156,0.000020807998],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019136827,0.000057111894,0.00007342185,0.000074882955,0.000014280569,0.00016423354,0.00043412475,0.001325863,0.0045947563,0.010133321,0.00001090958,0.983098],"study_design_scores_gemma":[0.00072113064,0.0005870665,0.0003105656,0.0008250072,0.00001749227,0.00032839514,2.1150305e-7,0.9165761,0.018109675,0.05620853,0.0045960075,0.001719814],"about_ca_topic_score_codex":0.000086117914,"about_ca_topic_score_gemma":0.00019468908,"teacher_disagreement_score":0.98137814,"about_ca_system_score_codex":0.00018440887,"about_ca_system_score_gemma":0.0009560122,"threshold_uncertainty_score":0.99974644},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013570413,0.00057045603,0.99347764,0.0003019979,0.003155165,0.0015875817,0.000022239186,0.00020900909,0.0005402095],"genre_scores_gemma":[0.63942325,0.000018476081,0.35796413,0.00089294056,0.0011159419,0.00011831939,0.000048033304,0.00007565288,0.000343223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571115,0.00008838568,0.00074005837,0.0018233362,0.0009583138,0.0006787623],"domain_scores_gemma":[0.99697965,0.00032390957,0.00045034767,0.0013943962,0.0006033644,0.000248302],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010681347,0.0006298385,0.0006628759,0.0009056997,0.00026193896,0.0010450014,0.0027889598,0.00039276594,0.000006817398],"category_scores_gemma":[0.00005425293,0.00055182667,0.00015689424,0.00057856063,0.00018475727,0.0005505662,0.00029267685,0.0005063932,0.000014001962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013487938,0.00003435209,0.000011690596,0.00008729345,0.000012508405,0.000022327598,0.0010278069,0.907713,0.0001378913,0.009719886,0.000023686083,0.081196085],"study_design_scores_gemma":[0.0004522781,0.00032523932,0.000003590221,0.0005883061,0.000009454431,0.000021568176,7.1862354e-7,0.98691875,0.00034779301,0.007943289,0.0027713927,0.00061761955],"about_ca_topic_score_codex":0.00011479024,"about_ca_topic_score_gemma":0.00020799963,"teacher_disagreement_score":0.6392876,"about_ca_system_score_codex":0.00046662265,"about_ca_system_score_gemma":0.00066226686,"threshold_uncertainty_score":0.999992},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015991883,0.0016189779,0.9941182,0.00063969794,0.0011526247,0.0008958995,0.000029141464,0.00017359386,0.0012119134],"genre_scores_gemma":[0.043824542,0.00039272718,0.95391613,0.0009211167,0.00044077897,0.00003108244,0.000013776179,0.000054009728,0.00040581822],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99526244,0.00005452577,0.00052148494,0.0020826324,0.0011062426,0.0009726835],"domain_scores_gemma":[0.9966247,0.0010166111,0.00027950626,0.0014248801,0.00036770734,0.00028661665],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008775974,0.0006364204,0.0007448452,0.000910529,0.00067214074,0.00042796961,0.003591495,0.00032447846,0.000011500468],"category_scores_gemma":[0.00013761422,0.00056963845,0.00015293041,0.0006717283,0.0033743812,0.0008204329,0.0016124025,0.00086041004,0.000012995755],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003798558,0.00002558468,0.00007807269,0.000105253006,0.000025086965,0.00010233654,0.0010813718,0.003947681,0.0001423096,0.10009258,0.000092783215,0.89426893],"study_design_scores_gemma":[0.0005375393,0.0002566943,0.000198991,0.00016122853,0.0000044838803,0.00019953134,3.0836065e-7,0.24687745,0.0010479745,0.7430902,0.0068937303,0.0007318373],"about_ca_topic_score_codex":0.0000086566315,"about_ca_topic_score_gemma":0.000091281225,"teacher_disagreement_score":0.8935371,"about_ca_system_score_codex":0.00022142306,"about_ca_system_score_gemma":0.00042898074,"threshold_uncertainty_score":0.9996755},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014863459,0.000020717976,0.95627004,0.028159164,0.00022772611,0.00026500132,4.3886007e-7,0.000112332804,0.00008110372],"genre_scores_gemma":[0.57714486,0.0000016391691,0.41019827,0.012611717,0.000035388686,0.0000033998913,2.3267982e-7,0.0000026489138,0.0000018272013],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978656,0.0001354415,0.0002758396,0.00055557204,0.0008126591,0.00035488754],"domain_scores_gemma":[0.99796426,0.0008303278,0.000139756,0.00087239034,0.000089652196,0.000103640356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014134829,0.0001574979,0.00017223897,0.00028922883,0.00014310729,0.00017920017,0.0023112013,0.00004097966,0.0000150781325],"category_scores_gemma":[0.0006333395,0.000104606006,0.000047302357,0.0019307988,0.00043672742,0.00043276954,0.00029901805,0.00027940847,0.000010649282],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007189059,0.00010793017,0.00014290081,0.000010247179,0.0000018260444,0.000036034646,0.0020505742,0.0032071618,0.030747104,0.0054417686,0.0008525281,0.9573947],"study_design_scores_gemma":[0.00021627315,0.0004885367,0.004499123,0.0001767681,0.000001067392,0.000021305634,0.000001842696,0.23756753,0.7182536,0.03850276,0.00006282249,0.00020836983],"about_ca_topic_score_codex":0.00001977384,"about_ca_topic_score_gemma":0.000006735506,"teacher_disagreement_score":0.95718634,"about_ca_system_score_codex":0.00008009105,"about_ca_system_score_gemma":0.00015101396,"threshold_uncertainty_score":0.42948258},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001017387,0.00061860826,0.9862425,0.00029286058,0.0038045973,0.0004418817,8.8594317e-7,0.00011181719,0.008385165],"genre_scores_gemma":[0.8726743,0.00007718014,0.12514052,0.00021377952,0.0005155574,0.000011773652,0.000008917805,0.000041377203,0.0013166165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964572,0.00008645432,0.00056472176,0.001165445,0.0011836266,0.00054251857],"domain_scores_gemma":[0.99764705,0.000120302066,0.00033555095,0.0012369993,0.0005227874,0.00013732478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014025652,0.00037311914,0.00049890304,0.0007933787,0.00020646235,0.00032851414,0.002502187,0.0003305805,0.000023856346],"category_scores_gemma":[0.000103337625,0.0003367084,0.00012083685,0.0009639096,0.00049793505,0.00058880635,0.00077277794,0.0005345501,0.000016631284],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054647444,0.000041507796,0.000090861075,0.00016832094,0.000017300797,0.000029121202,0.002005688,0.03096141,0.00043790494,0.14861612,0.00006087512,0.81756544],"study_design_scores_gemma":[0.00045352537,0.00043477237,0.00015772984,0.00025657285,0.000018334315,0.00031294965,0.0000021210747,0.52023464,0.01557665,0.45767182,0.0038079263,0.0010729362],"about_ca_topic_score_codex":0.00019971843,"about_ca_topic_score_gemma":0.00004968726,"teacher_disagreement_score":0.87257254,"about_ca_system_score_codex":0.0002703709,"about_ca_system_score_gemma":0.00069752225,"threshold_uncertainty_score":0.9999085},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006756003,0.00020120198,0.9922751,0.0007877174,0.0010472916,0.00066419307,0.000019217603,0.00033388237,0.003995787],"genre_scores_gemma":[0.64726174,0.000054091004,0.35114577,0.00073535385,0.0005216985,0.000016607013,0.000026498763,0.000053365748,0.00018486308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951426,0.0000887128,0.00086221535,0.001650243,0.0013767801,0.000879464],"domain_scores_gemma":[0.9970943,0.00092831167,0.00021613631,0.0010995726,0.00035650833,0.00030519257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081436394,0.0007189087,0.0007352087,0.0010409561,0.0006809119,0.00062540616,0.0027595607,0.0004667907,0.000026101598],"category_scores_gemma":[0.00016263321,0.00070565677,0.00025827705,0.00078147603,0.0008651839,0.0020539684,0.0003986729,0.001544535,0.00010875362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015910642,0.000051287232,0.0007953785,0.00006475613,0.000040024766,0.00013915527,0.023680216,0.012064013,0.00073337427,0.0032451998,0.00002935243,0.9591413],"study_design_scores_gemma":[0.002646475,0.00039217062,0.005299404,0.0007047708,0.000034568307,0.00018598425,0.000007716659,0.95025474,0.005156512,0.010174217,0.022495704,0.002647766],"about_ca_topic_score_codex":0.000052965886,"about_ca_topic_score_gemma":0.0000876703,"teacher_disagreement_score":0.95649356,"about_ca_system_score_codex":0.00034424427,"about_ca_system_score_gemma":0.0004909488,"threshold_uncertainty_score":0.99953943},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007004931,0.0010346627,0.99273396,0.00048714495,0.0034017903,0.00065303233,0.000012014293,0.00029762922,0.00130974],"genre_scores_gemma":[0.14296183,0.000029816258,0.8545345,0.0014801627,0.00038743197,0.00003465848,0.000010981983,0.000047413636,0.0005132234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939796,0.00003416874,0.0010200649,0.0022649802,0.0015848354,0.0011163598],"domain_scores_gemma":[0.9966802,0.00022072402,0.00044485717,0.001949093,0.00034026522,0.0003648786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090394117,0.0008627551,0.0008600277,0.0006377437,0.00046229805,0.0009066958,0.0047625136,0.0006117565,0.000029389466],"category_scores_gemma":[0.00008364271,0.0007728684,0.00020093369,0.00079770834,0.00049367204,0.00054557086,0.0014898295,0.0012898098,0.00027381923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073499127,0.00016317838,0.00005728954,0.00014226988,0.000042308286,0.0005343133,0.004122476,0.11091789,0.000054662945,0.08050696,0.000040072922,0.80341125],"study_design_scores_gemma":[0.0019000544,0.00031615788,0.0009445141,0.0077468427,0.000021244194,0.00031902432,0.0000011702372,0.74002993,0.0023736323,0.1819336,0.060096193,0.0043176413],"about_ca_topic_score_codex":0.000032794644,"about_ca_topic_score_gemma":0.00006741674,"teacher_disagreement_score":0.7990936,"about_ca_system_score_codex":0.0010186215,"about_ca_system_score_gemma":0.0017312677,"threshold_uncertainty_score":0.9994722},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002528951,0.00046473995,0.98478913,0.0010403453,0.0016930058,0.00039915764,0.0000011225682,0.00035563693,0.011003983],"genre_scores_gemma":[0.1293897,0.000026834094,0.8687951,0.00068433717,0.0004946286,0.000010140538,0.0000011433004,0.000038254788,0.0005598731],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959253,0.0000230386,0.00042782578,0.0016839377,0.0010547843,0.00088511273],"domain_scores_gemma":[0.9973644,0.00043171443,0.00029349464,0.0014419627,0.00028580808,0.00018261648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008465369,0.0005828451,0.00055954384,0.0006756732,0.00039519402,0.0008754593,0.0041438504,0.00042437066,0.000018640125],"category_scores_gemma":[0.0001012634,0.0004414352,0.0000922036,0.0005529369,0.0006441064,0.0008237178,0.0016127909,0.0015095033,0.000053198302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001099146,0.000043314118,0.00033650934,0.00012688019,0.000029307548,0.0005043224,0.0026242968,0.009464744,0.001836142,0.06952096,0.000015642547,0.9154869],"study_design_scores_gemma":[0.0013087993,0.0013123517,0.002240617,0.0033369665,0.000054079173,0.0013832347,0.0000018291316,0.5092311,0.03328146,0.43349332,0.009915791,0.0044404683],"about_ca_topic_score_codex":0.000020230547,"about_ca_topic_score_gemma":0.0002568051,"teacher_disagreement_score":0.91104645,"about_ca_system_score_codex":0.000140718,"about_ca_system_score_gemma":0.00063837913,"threshold_uncertainty_score":0.9998037},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017022487,0.00077041,0.99447423,0.000049250775,0.00042479226,0.00040531333,0.000015283726,0.00005063852,0.0021078084],"genre_scores_gemma":[0.9935453,0.00001340265,0.0060257306,0.000043419594,0.00022194981,0.000026345284,0.000017694758,0.00002223263,0.00008395067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986594,0.00001040044,0.00042913167,0.00037434892,0.00025632273,0.00027039472],"domain_scores_gemma":[0.9992745,0.00020197073,0.00009729283,0.00031589996,0.00008111766,0.000029209616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029472425,0.0002105346,0.00032953345,0.00033846902,0.0000319705,0.000054964923,0.00033824617,0.00024721358,0.0000027574833],"category_scores_gemma":[0.000028680843,0.00020368861,0.00006603141,0.00020648906,0.00013585297,0.000113395756,0.000028500925,0.00023324323,0.0000030709518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001077109,0.000008562631,0.00016361068,0.0000953192,0.000004858171,0.0000028187758,0.00015600298,0.9586649,0.000632951,0.0007703507,0.000068353525,0.03942148],"study_design_scores_gemma":[0.00038093043,0.000075449156,0.001961312,0.00032369437,0.0000057580064,0.000003237298,3.3360362e-7,0.97939277,0.0005540959,0.014993163,0.0020593684,0.00024991937],"about_ca_topic_score_codex":0.00004490926,"about_ca_topic_score_gemma":0.00032591185,"teacher_disagreement_score":0.99184304,"about_ca_system_score_codex":0.0001929588,"about_ca_system_score_gemma":0.000114043185,"threshold_uncertainty_score":0.830618},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007820938,0.002275065,0.9941356,0.00033441113,0.00083341653,0.00035813072,0.000019716921,0.00013434667,0.0018310711],"genre_scores_gemma":[0.0073112915,0.000111792775,0.9902915,0.0014514324,0.0005916537,0.0000036871618,0.000008161597,0.000031415224,0.00019907916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624234,0.000047820085,0.00067054236,0.0015855628,0.00075712404,0.0006965768],"domain_scores_gemma":[0.9976465,0.00028346528,0.0003958261,0.0013113429,0.00016554318,0.00019730315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093211734,0.00054859684,0.0006937684,0.00054625486,0.0004187135,0.00036436846,0.0013176346,0.00019364567,0.0000064678093],"category_scores_gemma":[0.000068568916,0.0004995485,0.00009901303,0.0003746433,0.0006192072,0.0010724845,0.0015793525,0.00061881205,0.0000103497405],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034290815,0.0000121060775,0.000022778528,0.000095596486,0.000006895857,0.00016001325,0.00042943034,0.007220087,0.0010992829,0.09486546,0.000011638764,0.8960733],"study_design_scores_gemma":[0.00046316517,0.00027569113,0.00010840231,0.003179039,0.00001598548,0.00084173033,8.8926924e-7,0.81577426,0.0006472489,0.1111593,0.06573532,0.001798984],"about_ca_topic_score_codex":0.00004398097,"about_ca_topic_score_gemma":0.00007294408,"teacher_disagreement_score":0.8942743,"about_ca_system_score_codex":0.00023368004,"about_ca_system_score_gemma":0.0002790648,"threshold_uncertainty_score":0.9997456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059509976,0.00009538818,0.9963242,0.0012538861,0.000903,0.00041009992,0.0000037621742,0.00011838477,0.0002962106],"genre_scores_gemma":[0.71179414,0.0000106380485,0.28717044,0.0005976215,0.00013607943,0.0000069068406,0.0000042024712,0.000021882817,0.00025810127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972155,0.00008039509,0.0004294004,0.0013073119,0.0005612168,0.00040614008],"domain_scores_gemma":[0.99782556,0.0005612135,0.00024144532,0.0011246596,0.0001114577,0.00013566118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009915264,0.0004125828,0.00032924287,0.00065646117,0.00030139115,0.00025181234,0.0013740268,0.00024230235,0.0000069433813],"category_scores_gemma":[0.00010067699,0.00030742635,0.00007077163,0.000241305,0.00020842969,0.00046895098,0.0005962259,0.0005227501,0.000024648303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018080942,0.000078611374,0.0074837017,0.00010697273,0.000021886639,0.000041469346,0.0015023615,0.1085688,0.00030383398,0.052725594,0.000009304508,0.8291394],"study_design_scores_gemma":[0.00036191972,0.000070049944,0.00071643427,0.0005505413,0.0000029679975,0.000008354373,8.7813795e-8,0.9024567,0.00019052003,0.09516905,0.00012400871,0.00034933919],"about_ca_topic_score_codex":0.000010877847,"about_ca_topic_score_gemma":0.000043354656,"teacher_disagreement_score":0.82879007,"about_ca_system_score_codex":0.0002949873,"about_ca_system_score_gemma":0.00032794118,"threshold_uncertainty_score":0.9999378},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028151553,0.00063055084,0.98702127,0.0009749102,0.0016494412,0.00032602908,0.000004733478,0.0003657481,0.0089991465],"genre_scores_gemma":[0.57407,0.0001306792,0.42161036,0.002009196,0.0008907192,0.000014825558,0.000020271438,0.00006625692,0.0011877379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949941,0.000067285764,0.00082323083,0.002017176,0.0010484961,0.0010496865],"domain_scores_gemma":[0.9970345,0.00043280429,0.0003360719,0.0016776181,0.00018891998,0.00033008264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010053556,0.0007408723,0.00067208224,0.00092741946,0.00056303164,0.0010318102,0.0036822194,0.0006752342,0.00012685123],"category_scores_gemma":[0.00005679282,0.0007217683,0.00018847514,0.0009418091,0.00064283656,0.0009627441,0.00087236403,0.0017288219,0.00013940183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009948065,0.000028999191,0.0002022563,0.000014845896,0.00001505071,0.0001561523,0.00047980616,0.3606441,0.0000060732355,0.05163808,0.0001408089,0.5866639],"study_design_scores_gemma":[0.00015989188,0.00012388574,0.000082777515,0.0004226677,0.000008565346,0.000080642276,6.77681e-8,0.79138166,0.000029940995,0.2058605,0.0011450747,0.00070435164],"about_ca_topic_score_codex":0.00006903665,"about_ca_topic_score_gemma":0.00010612249,"teacher_disagreement_score":0.58595955,"about_ca_system_score_codex":0.00036286234,"about_ca_system_score_gemma":0.0008300764,"threshold_uncertainty_score":0.99952334},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016547769,0.00049610826,0.9907268,0.0011632404,0.003065181,0.00041826896,0.000005073608,0.00019788732,0.0037619264],"genre_scores_gemma":[0.1667844,0.0002511257,0.7997152,0.030437097,0.0008820193,0.000032445194,0.000009570351,0.00015594171,0.0017321525],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952635,0.00006519892,0.00048884563,0.00207025,0.0012403233,0.0008718809],"domain_scores_gemma":[0.9965321,0.00070605095,0.00025035976,0.0021122857,0.00013653706,0.00026271067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006988881,0.0007215143,0.0005822647,0.0014760713,0.0003889742,0.00053383096,0.0036058535,0.0004550192,0.000026716494],"category_scores_gemma":[0.000097590935,0.0006023631,0.00027878289,0.0007883041,0.00079635845,0.0004162196,0.00068572845,0.0013318475,0.00021900053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001661404,0.00025572308,0.000035382276,0.000039752562,0.000034224224,0.00036062417,0.0006024069,0.03613381,0.00016214102,0.35175654,0.0002146957,0.6103881],"study_design_scores_gemma":[0.0013860012,0.0014453968,0.00052181823,0.0012410812,0.000021616057,0.00012747706,1.7475895e-7,0.24619868,0.0074220416,0.7335276,0.00575341,0.00235468],"about_ca_topic_score_codex":0.000010587424,"about_ca_topic_score_gemma":0.000018713397,"teacher_disagreement_score":0.6080334,"about_ca_system_score_codex":0.00022239602,"about_ca_system_score_gemma":0.00027883914,"threshold_uncertainty_score":0.9996428},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027916204,0.00006115272,0.9665645,0.00035005395,0.0016446756,0.0023545125,0.00010535654,0.0002726686,0.00073090446],"genre_scores_gemma":[0.5047717,0.0000026094658,0.4939302,0.0004515248,0.0003261139,0.00016848606,0.000048381535,0.000096918084,0.00020409423],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99781185,0.000016020707,0.0006019046,0.0006516428,0.00038416378,0.0005344317],"domain_scores_gemma":[0.99811673,0.0008038886,0.00010203679,0.0006426018,0.00016312106,0.00017159674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036021342,0.0004646983,0.00059583684,0.0006308734,0.0001309788,0.00038306438,0.00069370936,0.00038675164,0.00027648313],"category_scores_gemma":[0.00014050011,0.00046233743,0.000078213605,0.00020699186,0.00020646145,0.00019327352,0.0002521043,0.00059054495,0.000035940102],"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.000027446045,0.00001708268,0.000016476864,0.00017173136,0.000016941047,0.00010025537,0.0006331137,0.282595,0.6935111,0.005400925,0.000053827804,0.017456042],"study_design_scores_gemma":[0.00054812274,0.00022802479,0.00015965245,0.00080129557,0.000023441751,0.000041470463,1.0960965e-7,0.07019038,0.9016412,0.024825752,0.0005032721,0.0010373147],"about_ca_topic_score_codex":0.000010506265,"about_ca_topic_score_gemma":0.00015577539,"teacher_disagreement_score":0.4768555,"about_ca_system_score_codex":0.00017222378,"about_ca_system_score_gemma":0.0001225864,"threshold_uncertainty_score":0.99978286},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005404319,0.00075487274,0.9814347,0.0005445947,0.0013380283,0.0003172186,0.00001235124,0.0004920507,0.009701883],"genre_scores_gemma":[0.47801697,0.00036777847,0.51665556,0.0031476817,0.0011187819,0.000011249187,0.000009802951,0.00009985233,0.0005723314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953059,0.000054692347,0.00068091945,0.0019950576,0.0011108423,0.0008526068],"domain_scores_gemma":[0.9969992,0.0006415005,0.00036889804,0.0016279434,0.0001178876,0.00024456385],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001258733,0.00066588284,0.0006086125,0.0006894658,0.0003993078,0.0011556257,0.0039087757,0.00027372997,0.00005955746],"category_scores_gemma":[0.00008749328,0.000618858,0.00011725635,0.00037749292,0.00064670615,0.0011079784,0.002325601,0.00091348705,0.000063808286],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034358782,0.000019426838,0.00008026748,0.00003444255,0.000013083942,0.00017648589,0.0006588456,0.0055858865,0.00012870398,0.027753003,0.000011378944,0.96553504],"study_design_scores_gemma":[0.00028871556,0.00009513,0.00025646802,0.00053057674,0.0000061994165,0.0001920717,2.542591e-7,0.7097574,0.0006477731,0.28680038,0.0007529431,0.00067210826],"about_ca_topic_score_codex":0.000094628056,"about_ca_topic_score_gemma":0.000028270602,"teacher_disagreement_score":0.96486294,"about_ca_system_score_codex":0.00019929868,"about_ca_system_score_gemma":0.00034762113,"threshold_uncertainty_score":0.99988127},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012331611,0.00039743618,0.9872678,0.00009123774,0.0005319927,0.00021045574,0.00014695004,0.000072193216,0.010048767],"genre_scores_gemma":[0.91463524,0.000027384283,0.08434776,0.00026859323,0.00014471951,0.0000020351133,0.00005733646,0.00003456925,0.0004823482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729955,0.00001833731,0.00047268122,0.0008628044,0.00082516274,0.000521457],"domain_scores_gemma":[0.9984409,0.00012388744,0.0002586607,0.0008021254,0.0001458316,0.0002285683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021275457,0.0004359552,0.0006812987,0.001040225,0.00014296138,0.00030827033,0.0011190859,0.0001457286,0.0002042196],"category_scores_gemma":[0.000012460564,0.00039547772,0.00022434187,0.00073805655,0.00064351864,0.0006066186,0.00076200697,0.0002837614,0.000008091881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002719037,0.00069293904,0.004466916,0.00039224475,0.0008306577,0.0001853038,0.002031082,0.0024062088,0.0033172176,0.0072951335,0.000056457204,0.97829866],"study_design_scores_gemma":[0.00076966523,0.0002044064,0.008916148,0.00015925696,0.0012930647,0.00008614484,2.6349736e-7,0.9783955,0.0018916351,0.005800299,0.001279679,0.0012039214],"about_ca_topic_score_codex":0.00001542389,"about_ca_topic_score_gemma":0.00003467349,"teacher_disagreement_score":0.9770947,"about_ca_system_score_codex":0.00006494084,"about_ca_system_score_gemma":0.00022382135,"threshold_uncertainty_score":0.99984974},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069584227,0.00016914002,0.9871238,0.00051822804,0.0020117306,0.00071903394,0.0000017065297,0.00022780214,0.002270131],"genre_scores_gemma":[0.47255865,0.00000315437,0.5252789,0.00061805616,0.0006728899,0.000018263809,9.173288e-7,0.000038652855,0.0008104779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950431,0.000100688536,0.0006972521,0.002121896,0.001053039,0.0009840102],"domain_scores_gemma":[0.99689776,0.00057838706,0.00026451616,0.0016708231,0.0002518723,0.00033665166],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002541106,0.0005820799,0.000624798,0.0010006549,0.00031586355,0.0010243645,0.0038485504,0.000552265,0.00003472063],"category_scores_gemma":[0.0005864669,0.0005470655,0.00011810162,0.0009093603,0.00018715327,0.000859738,0.0012810077,0.0025813612,0.00012936797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017456918,0.00012483927,0.0011470278,0.00019883996,0.000014400964,0.0005040069,0.059574142,0.10880402,0.012066145,0.30963713,0.000002108476,0.5079099],"study_design_scores_gemma":[0.00060341414,0.0019066973,0.0029240367,0.012714249,0.000017611199,0.00033967785,0.000024961586,0.5451839,0.038409773,0.3773298,0.015141668,0.0054042265],"about_ca_topic_score_codex":0.00024450434,"about_ca_topic_score_gemma":0.00038681002,"teacher_disagreement_score":0.50250566,"about_ca_system_score_codex":0.0004390249,"about_ca_system_score_gemma":0.00048519397,"threshold_uncertainty_score":0.99971974},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030537115,0.00004749347,0.9941226,0.0019209821,0.0003229975,0.00037637315,0.0000015393074,0.0001302341,0.000024043968],"genre_scores_gemma":[0.46153563,0.000003799883,0.53709006,0.0012857905,0.00007220201,0.000008847912,7.9238936e-7,0.0000019641095,8.974347e-7],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981739,0.000043884596,0.00038034806,0.00054543786,0.0005135652,0.00034289056],"domain_scores_gemma":[0.99852306,0.00042236253,0.0001944329,0.0005426479,0.00022811459,0.00008936022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080552045,0.00013854261,0.00020736667,0.0002166047,0.00009245098,0.0001921167,0.0013063906,0.00007538244,0.0000045928778],"category_scores_gemma":[0.0006839282,0.00012286029,0.000052733954,0.0010606691,0.00030493079,0.000667256,0.00009859701,0.00015404174,0.0000010273438],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061278283,0.000056607485,0.000018846273,0.000009717794,0.0000012838066,0.0000021498477,0.0004301302,0.0013297545,0.16236341,0.005708553,0.00003438989,0.830039],"study_design_scores_gemma":[0.00018316407,0.00025207349,0.0007564147,0.00005688651,0.000001178587,0.000004388304,2.7296164e-7,0.14693461,0.71155477,0.1401444,0.00000290886,0.00010891923],"about_ca_topic_score_codex":0.000010529533,"about_ca_topic_score_gemma":0.000003585674,"teacher_disagreement_score":0.8299301,"about_ca_system_score_codex":0.00006221157,"about_ca_system_score_gemma":0.00016932692,"threshold_uncertainty_score":0.5010097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000552962,0.00019996362,0.9974331,0.00023050682,0.00061983545,0.0003867572,0.000012923712,0.0004242471,0.00063736574],"genre_scores_gemma":[0.117316246,0.00002863783,0.88072264,0.0015668435,0.00015494814,0.000004885787,0.000024598154,0.000055380217,0.00012580432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617845,0.0000668496,0.00052803394,0.0015173367,0.0010113571,0.0006979707],"domain_scores_gemma":[0.99747294,0.00019506631,0.00038626615,0.0011897527,0.0005486959,0.00020727885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005995145,0.0006172634,0.0005419405,0.00067101006,0.00040319996,0.00065972004,0.0018866599,0.00035308985,0.000013284795],"category_scores_gemma":[0.000056618945,0.0005468525,0.00009114368,0.0009985475,0.0008684185,0.0005866216,0.00052144396,0.0006436835,0.000008347726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068285917,0.000019181574,0.00007564581,0.000026466509,0.000014723082,0.00007990467,0.0001778365,0.93545604,0.000021020029,0.0027517756,0.000047056976,0.061323542],"study_design_scores_gemma":[0.0002641398,0.00014685586,0.000011514743,0.0004251754,0.000012749956,0.00019701618,3.8352113e-7,0.9903787,0.00080528914,0.0062067965,0.00083261664,0.0007188121],"about_ca_topic_score_codex":0.000027229262,"about_ca_topic_score_gemma":0.00001958257,"teacher_disagreement_score":0.11726095,"about_ca_system_score_codex":0.00074795075,"about_ca_system_score_gemma":0.0007247794,"threshold_uncertainty_score":0.9996983},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016335279,0.00034752933,0.98209065,0.000012804012,0.0002855086,0.00009500325,0.000007939031,0.00014025523,0.00068501855],"genre_scores_gemma":[0.86237955,0.000005061093,0.1373362,0.000039481132,0.00016837793,3.0476684e-7,0.000007792298,0.00004195061,0.000021297563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803656,0.000009123764,0.00047848118,0.00051037315,0.00055018853,0.00041529135],"domain_scores_gemma":[0.9991974,0.00009430321,0.00010638508,0.0004083877,0.00012218903,0.000071334056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028992488,0.00034848048,0.0004944438,0.0006615246,0.00007663565,0.00008752222,0.00043882907,0.00024358674,0.000025253055],"category_scores_gemma":[0.000014651783,0.00034310573,0.00016567357,0.00046295644,0.00021390618,0.00013891548,0.000072450806,0.00045989428,0.000002384819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003414859,0.0000060266084,0.0000075276535,0.000044354292,0.00001449223,0.00001661646,0.00005272494,0.99049217,0.001990587,0.000032314223,0.0000015337358,0.0073382375],"study_design_scores_gemma":[0.00013042944,0.000020080379,0.0000030585074,0.000400478,0.00004180997,0.0000056900835,4.8257807e-8,0.9871781,0.0054607163,0.0064075235,0.0000027674423,0.00034930737],"about_ca_topic_score_codex":0.000025676574,"about_ca_topic_score_gemma":0.000010658373,"teacher_disagreement_score":0.84604424,"about_ca_system_score_codex":0.00023721856,"about_ca_system_score_gemma":0.00012727625,"threshold_uncertainty_score":0.99990207},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005349761,0.0015391693,0.99071974,0.00038082415,0.0011795828,0.00045452346,0.0000093857225,0.00019709003,0.0054662144],"genre_scores_gemma":[0.010578893,0.000097228076,0.9868752,0.0012757427,0.00025968696,0.000026774025,0.0000053007557,0.00006010368,0.0008210863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954988,0.000034336816,0.0005409293,0.002015685,0.001022638,0.00088764034],"domain_scores_gemma":[0.9967838,0.00023320109,0.0003950039,0.0021375811,0.00023215612,0.00021825857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006905479,0.00069972407,0.000690615,0.00055302074,0.00037487154,0.00037123807,0.0020693173,0.00024573418,0.000018628041],"category_scores_gemma":[0.00005368587,0.0005736281,0.00009938417,0.00078964216,0.0009205796,0.0016326231,0.0008649375,0.0008383954,0.000048312697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001863821,0.0000517603,0.00011384136,0.00016481886,0.0000316987,0.00065169606,0.0006720023,0.017304735,0.00051953545,0.5120714,0.000067247376,0.46833268],"study_design_scores_gemma":[0.0028468322,0.0022121868,0.00035600874,0.009143502,0.00005209695,0.003181694,0.000002940091,0.35465905,0.0169545,0.20577861,0.39601874,0.008793831],"about_ca_topic_score_codex":0.000012991552,"about_ca_topic_score_gemma":0.00012625585,"teacher_disagreement_score":0.45953885,"about_ca_system_score_codex":0.0003591801,"about_ca_system_score_gemma":0.0005110339,"threshold_uncertainty_score":0.9996715},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011183438,0.0006950139,0.99546254,0.0002938994,0.00082060817,0.00023692695,0.0003913183,0.000101712605,0.0008796507],"genre_scores_gemma":[0.051205885,0.000090341295,0.9477469,0.0002924558,0.00032686,0.0000053351423,0.00023765104,0.000029563102,0.00006501172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959705,0.000020280679,0.0006309416,0.0019223528,0.0009984545,0.00045746268],"domain_scores_gemma":[0.9943685,0.00056243944,0.00043382272,0.004270627,0.00020494856,0.00015964023],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00048357193,0.00040858777,0.000515625,0.00043839845,0.00021975028,0.00024208557,0.0081952615,0.00020437327,0.000016491807],"category_scores_gemma":[0.00010049496,0.00037821324,0.0000655918,0.0006425868,0.00069044967,0.00029515303,0.0041642324,0.00043031553,0.000028755097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.0379e-7,0.00005917028,0.000050831804,0.000011377385,0.000015241068,0.000045436424,0.00087033154,0.018634507,0.00010068518,0.0013613628,0.00023197656,0.9786182],"study_design_scores_gemma":[0.00016727445,0.000053584015,0.00023676513,0.00036390414,0.000009659478,0.000035894733,3.4190901e-7,0.99247634,0.00063770864,0.0028807914,0.0026918715,0.00044586844],"about_ca_topic_score_codex":0.00023324623,"about_ca_topic_score_gemma":0.00004451265,"teacher_disagreement_score":0.9781723,"about_ca_system_score_codex":0.00012338333,"about_ca_system_score_gemma":0.00056605565,"threshold_uncertainty_score":0.99986696},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014893345,0.00029807343,0.9965247,0.000090279136,0.0012386568,0.00022872632,0.0000031445975,0.0002978963,0.0011695973],"genre_scores_gemma":[0.092520215,0.00003335518,0.906908,0.00012609632,0.0002338802,0.0000051911998,0.0000029923444,0.000026703108,0.00014356595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684113,0.000031305924,0.00071233005,0.000999397,0.0006806064,0.00073521584],"domain_scores_gemma":[0.99669904,0.00115206,0.0006121734,0.0011753069,0.00026979292,0.00009163635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017412712,0.00038041786,0.0005200959,0.0005114823,0.00017052804,0.00016785298,0.0025860146,0.00025045013,0.000008902005],"category_scores_gemma":[0.000817855,0.0003756327,0.00011332685,0.00054320873,0.00058879756,0.0010121672,0.0011005125,0.00061347184,0.0000068117365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027794028,0.000006762226,0.00007446313,0.00005034661,0.000005507427,0.000027498729,0.0007145531,0.32503667,0.00059976697,0.013737139,0.0000022434128,0.6597423],"study_design_scores_gemma":[0.00046309136,0.0003060799,0.00042543196,0.0007881486,0.000013370546,0.0001633313,0.0000011767411,0.5502289,0.027438322,0.41691306,0.0019107836,0.0013483013],"about_ca_topic_score_codex":0.000009175055,"about_ca_topic_score_gemma":0.0000052095634,"teacher_disagreement_score":0.658394,"about_ca_system_score_codex":0.00022228429,"about_ca_system_score_gemma":0.00032719265,"threshold_uncertainty_score":0.9998696},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016483244,0.00006979197,0.9959822,0.00017384242,0.0005210851,0.0005954566,0.000009900243,0.0000782944,0.0009211026],"genre_scores_gemma":[0.8014848,0.00003268531,0.19780758,0.00038828034,0.000183384,0.000012084257,0.000023441962,0.000016138709,0.000051563842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978299,0.000022387965,0.00041964732,0.0009538617,0.00042073915,0.0003534716],"domain_scores_gemma":[0.998854,0.0003097754,0.00019938227,0.00039931512,0.00013977636,0.00009774845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000371209,0.0003092845,0.00033065342,0.00076498196,0.00034052206,0.00023396565,0.0006877762,0.00023898174,0.00000815904],"category_scores_gemma":[0.000050648323,0.00030817004,0.000067375775,0.00018178813,0.00049912365,0.0007548846,0.000380802,0.0003497007,0.0000048463844],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006811681,0.000031467156,0.000023850385,0.000026821599,0.0000028882446,0.000036139674,0.00086611987,0.032311853,0.0002951841,0.0021217794,0.000015084698,0.964262],"study_design_scores_gemma":[0.0006058257,0.0001275108,0.00020691758,0.00022504879,0.0000028678674,0.00007451652,1.3334868e-7,0.86779815,0.00094407005,0.12965979,0.00004894074,0.00030620728],"about_ca_topic_score_codex":0.00006630903,"about_ca_topic_score_gemma":0.00057697715,"teacher_disagreement_score":0.9639558,"about_ca_system_score_codex":0.0001572224,"about_ca_system_score_gemma":0.00018363066,"threshold_uncertainty_score":0.99993706},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008260286,0.0016727074,0.99423873,0.0014018171,0.0010404548,0.0006958576,0.000012876718,0.00047428682,0.00045502593],"genre_scores_gemma":[0.023184057,0.000006959784,0.9712971,0.0042998707,0.0002723195,0.000037449023,0.00000863581,0.0000519512,0.00084165967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960949,0.00004250284,0.00046717256,0.0016710005,0.00089621363,0.00082820904],"domain_scores_gemma":[0.9971011,0.00074967433,0.00019438671,0.0012956047,0.00049134664,0.00016784229],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011182713,0.000602135,0.0005365536,0.0010767727,0.0001607722,0.00083146326,0.0044279234,0.0004176644,0.000029665598],"category_scores_gemma":[0.0002216167,0.00051583623,0.00019352672,0.0006152784,0.00050378864,0.00055742665,0.000877713,0.0008990323,0.000015828156],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021176204,0.00005368685,0.00002155126,0.00030390485,0.00002148941,0.00012832128,0.00071965286,0.0054959054,0.00059884845,0.0735098,0.0007244969,0.9184012],"study_design_scores_gemma":[0.0003414922,0.00030540526,0.0000033900242,0.0007036717,0.000009583399,0.00006203026,6.4380444e-8,0.7191354,0.047625933,0.22612374,0.0047714533,0.00091781217],"about_ca_topic_score_codex":0.000015287125,"about_ca_topic_score_gemma":0.000023297367,"teacher_disagreement_score":0.9174833,"about_ca_system_score_codex":0.00032064985,"about_ca_system_score_gemma":0.00058380194,"threshold_uncertainty_score":0.99972934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020553878,0.00013465386,0.99583673,0.00021122182,0.0006395368,0.0008508399,0.000019674519,0.00004165023,0.0022451123],"genre_scores_gemma":[0.008672663,0.00012183715,0.988871,0.00031561634,0.00028838796,0.000012619087,0.000043564527,0.000036686135,0.0016376377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531543,0.000026447993,0.0011428864,0.0011645773,0.0018856005,0.00046505962],"domain_scores_gemma":[0.9958173,0.000883011,0.00080923864,0.0009048048,0.0014501758,0.00013545353],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003637387,0.00036217488,0.0006003635,0.0012669223,0.00017329887,0.00024623607,0.001607948,0.0004422115,0.000024073384],"category_scores_gemma":[0.0006804076,0.00028402236,0.0002023683,0.0010906339,0.00067394006,0.00037306626,0.00026143657,0.00032168717,0.000006171158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022034665,0.000018273991,0.000040396444,0.000006320888,0.0000029906055,0.0000018698264,0.00024242468,0.68663955,0.0000018694657,0.0014232977,0.00001907614,0.31158188],"study_design_scores_gemma":[0.00023728202,0.00014775443,0.0000028054953,0.00010365089,0.000011109267,0.00000579115,5.3463975e-7,0.92922133,0.00006280853,0.06914036,0.0007839042,0.0002826699],"about_ca_topic_score_codex":0.00001428126,"about_ca_topic_score_gemma":0.000102799546,"teacher_disagreement_score":0.3112992,"about_ca_system_score_codex":0.00012992542,"about_ca_system_score_gemma":0.0006080978,"threshold_uncertainty_score":0.9999612},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001368254,0.00069161144,0.99348485,0.0006004887,0.0016964283,0.00095015235,0.00010885894,0.00078508933,0.0015456796],"genre_scores_gemma":[0.21022971,0.000045867553,0.7881785,0.0006598013,0.00047433638,0.000013309335,0.00028228603,0.00006096669,0.000055239136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918436,0.000056679204,0.00093023956,0.0046292795,0.0014605072,0.0010797383],"domain_scores_gemma":[0.986972,0.0003654968,0.00044419232,0.011536189,0.00046302786,0.00021914163],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0032735527,0.0007038116,0.0007821086,0.0019861893,0.00028125104,0.001320548,0.032713924,0.0005595517,0.0000032440387],"category_scores_gemma":[0.00035654596,0.0007069255,0.000026658787,0.0040979893,0.00057141366,0.0036735972,0.02281945,0.0011402658,0.000035391397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015171988,0.000048588732,0.00061496167,0.00011035275,0.000016222433,0.0004501838,0.0010460829,0.09580056,0.000040187035,0.034750246,0.00015116856,0.8669563],"study_design_scores_gemma":[0.00025206016,0.00012357502,0.0001936424,0.0012305647,0.000006680805,0.000041362408,0.0000032534679,0.98697484,0.00011820635,0.008350634,0.0018983792,0.00080680975],"about_ca_topic_score_codex":0.000060210077,"about_ca_topic_score_gemma":0.0037327583,"teacher_disagreement_score":0.89117426,"about_ca_system_score_codex":0.0012024884,"about_ca_system_score_gemma":0.0010602991,"threshold_uncertainty_score":0.99971616},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029317292,0.00004284957,0.9890947,0.00015951371,0.0034844237,0.00046043404,0.000008436335,0.00021573104,0.0036022312],"genre_scores_gemma":[0.095253654,0.000015731652,0.9028679,0.00069176627,0.00090591924,0.000008485495,0.000031265357,0.00005507821,0.0001702089],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953616,0.00010409717,0.0007039604,0.0018601733,0.0010916832,0.00087848946],"domain_scores_gemma":[0.99682415,0.0003514878,0.00055452756,0.0015521792,0.00050882733,0.00020885766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018509534,0.00066253176,0.0007106471,0.0010504826,0.00081259187,0.000646014,0.001708581,0.0005869785,0.000088348264],"category_scores_gemma":[0.000105355524,0.00065625936,0.000177011,0.00089741097,0.0006401481,0.0010467482,0.0008658982,0.0015422339,0.000067849425],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000822316,0.000060226062,0.00010203228,0.00006314974,0.000022043063,0.00013374512,0.00039883275,0.003061291,0.033784434,0.00088927295,0.0000132647665,0.9614635],"study_design_scores_gemma":[0.0010297312,0.00036669977,0.0026207345,0.0008599112,0.000034814875,0.000506147,4.0674357e-7,0.8028158,0.025245534,0.15950556,0.0048688855,0.0021457744],"about_ca_topic_score_codex":0.00011692738,"about_ca_topic_score_gemma":0.00048606232,"teacher_disagreement_score":0.9593177,"about_ca_system_score_codex":0.00031948907,"about_ca_system_score_gemma":0.00041356383,"threshold_uncertainty_score":0.99958885},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012356651,0.0016119132,0.98377633,0.0005873341,0.0014687881,0.0005813778,0.0000011134416,0.00033763464,0.011511949],"genre_scores_gemma":[0.5763855,0.00029236657,0.41776928,0.002367273,0.0012194733,0.000034838333,0.000010125992,0.000102422586,0.0018187537],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951424,0.000052655494,0.0005912036,0.0019402374,0.0012432892,0.0010302298],"domain_scores_gemma":[0.9968876,0.00028060423,0.00042212708,0.001875781,0.00024203573,0.00029180452],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062021724,0.0007321836,0.0007358208,0.000638035,0.00044548753,0.000749215,0.004013191,0.00042468015,0.000016161363],"category_scores_gemma":[0.000031547665,0.0005486169,0.00015979494,0.00083705195,0.0010616991,0.00063823623,0.0010051064,0.00091594015,0.00017588005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015746553,0.0000840104,0.0011134102,0.00009130018,0.000052070955,0.0013034617,0.0032744366,0.005142399,0.000038683473,0.20612563,0.0003206593,0.78243816],"study_design_scores_gemma":[0.0022490064,0.0021983534,0.0013255259,0.00063153665,0.000040627343,0.0038931805,0.0000016305031,0.09932055,0.0008712806,0.6968312,0.1877932,0.0048438692],"about_ca_topic_score_codex":0.00012266502,"about_ca_topic_score_gemma":0.0004415181,"teacher_disagreement_score":0.7775943,"about_ca_system_score_codex":0.0002878551,"about_ca_system_score_gemma":0.0008648681,"threshold_uncertainty_score":0.99969655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006213467,0.00023968355,0.97140026,0.0006317373,0.003175005,0.00040128923,0.0000044354842,0.0002780393,0.02380744],"genre_scores_gemma":[0.021047467,0.000020982287,0.97519624,0.0019627323,0.00083939335,0.000017281562,0.00000672136,0.00004596033,0.00086319324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556315,0.000063124025,0.00067076174,0.0017224866,0.0012529704,0.0007275324],"domain_scores_gemma":[0.99675125,0.00034732977,0.00046010988,0.0019841306,0.00029659987,0.00016058244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013738804,0.00058286666,0.00049194094,0.00095698977,0.00033528614,0.0007374845,0.0037452271,0.00043111568,0.000027911594],"category_scores_gemma":[0.00010388175,0.0005612087,0.00017098365,0.00077252754,0.0006120944,0.0012712775,0.00091288023,0.0011079395,0.00010689198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000086704,0.00007931449,0.00004517316,0.00008366382,0.000016324253,0.00009054204,0.00044293335,0.10308717,0.0007791246,0.092551745,0.0006238903,0.80219144],"study_design_scores_gemma":[0.00032493478,0.00028525235,0.0003117411,0.0003547583,0.000014632915,0.00022122194,2.0554673e-7,0.8343799,0.0085357465,0.1325033,0.021833934,0.0012343677],"about_ca_topic_score_codex":0.00008042372,"about_ca_topic_score_gemma":0.00006470522,"teacher_disagreement_score":0.8009571,"about_ca_system_score_codex":0.0004786568,"about_ca_system_score_gemma":0.0004130958,"threshold_uncertainty_score":0.9996839},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011480967,0.000042365486,0.9807609,0.0006544714,0.00080332486,0.014108741,0.000010069319,0.00007198951,0.0034333623],"genre_scores_gemma":[0.63078177,0.000025014799,0.33804014,0.010857203,0.00065058586,0.018789565,0.00005560887,0.000178206,0.00062187173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966394,0.00018955831,0.0006980073,0.0010017321,0.0010471214,0.0004242184],"domain_scores_gemma":[0.9952971,0.000666721,0.00058840465,0.003006535,0.000326702,0.00011453328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017548267,0.000438468,0.00052186154,0.00030756427,0.00037489933,0.00039185587,0.005159529,0.0002581792,0.000023423867],"category_scores_gemma":[0.00009690326,0.00029802628,0.00011117339,0.00065074285,0.00073795416,0.00046981568,0.0007013505,0.00079443416,0.000014902262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028792821,0.00019791053,0.000012022393,0.00009220033,0.000012692669,0.000024762345,0.0010964255,0.022864727,0.00012599753,0.4127515,0.00021088957,0.5625821],"study_design_scores_gemma":[0.00065779494,0.0006233021,0.00010370825,0.0017276449,0.0000058676696,0.00008044872,9.4237316e-7,0.7584765,0.0014312076,0.22309734,0.012984125,0.0008111409],"about_ca_topic_score_codex":0.000041522133,"about_ca_topic_score_gemma":0.00007025144,"teacher_disagreement_score":0.73561174,"about_ca_system_score_codex":0.00016205953,"about_ca_system_score_gemma":0.00023542985,"threshold_uncertainty_score":0.9999472},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009306758,0.00039065903,0.9885659,0.00010398746,0.0003948538,0.00040703831,0.0000058410446,0.000042935062,0.0007820255],"genre_scores_gemma":[0.7035654,0.00003655346,0.29522434,0.001033113,0.00006663908,0.0000037909542,0.0000020654481,0.000017845929,0.00005021945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690926,0.000028515671,0.0004019682,0.0013499182,0.00064519676,0.0006651292],"domain_scores_gemma":[0.9987595,0.00039438592,0.00014324594,0.0004939665,0.000044822857,0.00016406945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005716548,0.0004314348,0.0004660111,0.00094636297,0.00013544591,0.00018418583,0.0012903517,0.00023186674,0.000003673633],"category_scores_gemma":[0.00006874969,0.0004101066,0.00005452493,0.00034395556,0.0011722547,0.00033700216,0.001325122,0.00052145135,0.000008092667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026850337,0.000046429846,0.0005896964,0.000021905209,0.00001218667,0.0001459904,0.005720289,0.115511954,0.00042745387,0.01048843,4.7161794e-7,0.8670083],"study_design_scores_gemma":[0.0003504687,0.00013431215,0.0010879065,0.00026831587,0.00000704104,0.000027533059,0.000002882955,0.9247705,0.000341336,0.07247715,0.000018504737,0.000514057],"about_ca_topic_score_codex":0.00011056904,"about_ca_topic_score_gemma":0.00062854774,"teacher_disagreement_score":0.8664943,"about_ca_system_score_codex":0.00025433925,"about_ca_system_score_gemma":0.00021856581,"threshold_uncertainty_score":0.9998351},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006415252,0.00039728577,0.99597394,0.00042541724,0.0010136843,0.00033317227,0.0000033448973,0.000060887312,0.0017280864],"genre_scores_gemma":[0.054092404,0.00010581373,0.9448105,0.00059912406,0.00017530001,0.000008586593,0.0000014852557,0.000023812903,0.0001829765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963786,0.00006798367,0.0007661948,0.0012073865,0.0009711053,0.0006087167],"domain_scores_gemma":[0.99768865,0.00049860025,0.0003898957,0.001082847,0.00019539705,0.00014459123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010944264,0.0004223137,0.00064425654,0.0009624466,0.0000925946,0.0002024268,0.0026853157,0.00027826297,0.000030498457],"category_scores_gemma":[0.00020016731,0.0003762246,0.00012148809,0.0012972024,0.00056365976,0.0007178035,0.0009904808,0.0007160661,0.000017567845],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002338094,0.000049388727,0.00011351278,0.000061102415,0.000003891116,0.000073672956,0.0006702073,0.019799491,0.00015409672,0.021599771,0.000005896122,0.9574666],"study_design_scores_gemma":[0.00019801321,0.0002060178,0.0002801296,0.00052135455,0.000004042434,0.000050846545,1.7346579e-7,0.8219631,0.0030984622,0.17281832,0.0003793865,0.00048020695],"about_ca_topic_score_codex":0.000055577668,"about_ca_topic_score_gemma":0.00001756159,"teacher_disagreement_score":0.9569864,"about_ca_system_score_codex":0.00020343911,"about_ca_system_score_gemma":0.00018698956,"threshold_uncertainty_score":0.999869},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006297597,0.00049741124,0.9897373,0.00026572138,0.0017896597,0.0006139422,0.0000019066035,0.00013893553,0.006892147],"genre_scores_gemma":[0.40341437,0.00007068668,0.5930906,0.0024593014,0.00078056165,0.000018372073,0.000010954519,0.000061008886,0.00009417809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946503,0.00004085955,0.00089008926,0.0020596152,0.0011126096,0.001246551],"domain_scores_gemma":[0.99712104,0.0005565005,0.0003033606,0.001584027,0.00018909013,0.00024596925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021144745,0.0006761509,0.00075337925,0.0011073779,0.00024319092,0.00055815687,0.0037571688,0.00060286967,0.000008562725],"category_scores_gemma":[0.00007882926,0.00059548405,0.0001563807,0.0013603441,0.0011119837,0.00047385436,0.0014821494,0.0016557068,0.000037555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012129474,0.000032300555,0.000070495924,0.000026268382,0.00000338125,0.00060627237,0.00046098136,0.38461304,0.0000029567946,0.009032025,0.000022199343,0.6051179],"study_design_scores_gemma":[0.00037682863,0.00013711286,0.00027226735,0.00046798476,0.000004533029,0.00009021187,2.0896947e-7,0.9066534,0.000016011589,0.0907212,0.0006061386,0.0006541163],"about_ca_topic_score_codex":0.00010113723,"about_ca_topic_score_gemma":0.0004964897,"teacher_disagreement_score":0.6044638,"about_ca_system_score_codex":0.00048745985,"about_ca_system_score_gemma":0.00044483863,"threshold_uncertainty_score":0.99964964},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007517358,0.0004624932,0.97213817,0.00014967406,0.0023812628,0.0001710962,0.000010397105,0.00011787633,0.017051686],"genre_scores_gemma":[0.5128046,0.0000041068074,0.48259503,0.0027278285,0.00073189364,0.0000036689087,0.000015035422,0.000070474416,0.0010473295],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975538,0.00034948613,0.00044437256,0.0006569454,0.00045227187,0.000543091],"domain_scores_gemma":[0.99755347,0.0011415551,0.0002430684,0.0007509673,0.0002419673,0.00006899696],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022094317,0.0004234588,0.00052524684,0.0008780153,0.0004771169,0.00017440964,0.0010979121,0.00036255995,0.0012630501],"category_scores_gemma":[0.00011160894,0.00039529198,0.00010410901,0.00030693374,0.0012064675,0.00012799336,0.000356469,0.0023130425,0.00005525336],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054905893,0.00003270464,0.00027222966,0.000016248394,0.00004198565,0.000095497475,0.010433683,0.0148427915,0.00038436372,0.03402377,0.000054059692,0.93974775],"study_design_scores_gemma":[0.0025172343,0.0009993471,0.008749496,0.007591504,0.00010684692,0.0016890131,0.000027564502,0.26751086,0.0005083047,0.632441,0.07315223,0.0047066202],"about_ca_topic_score_codex":0.0003306319,"about_ca_topic_score_gemma":0.000028593922,"teacher_disagreement_score":0.9350411,"about_ca_system_score_codex":0.00022014305,"about_ca_system_score_gemma":0.00018833704,"threshold_uncertainty_score":0.9999887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035213832,0.00020917112,0.9971193,0.0005920285,0.0002968085,0.0008693508,0.000004703343,0.000019453302,0.0008856683],"genre_scores_gemma":[0.014230857,0.00027513158,0.9805654,0.001504224,0.0010734833,0.00011059772,0.000086168286,0.0000465713,0.0021075343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985972,0.000015664134,0.00023291836,0.000688569,0.00021597285,0.00024969858],"domain_scores_gemma":[0.9991166,0.000027443148,0.00017947583,0.00039562848,0.00022525118,0.00005557716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003174712,0.00023742972,0.00015017425,0.000142395,0.00023533449,0.000114033566,0.00050145714,0.0002747817,0.00000949773],"category_scores_gemma":[0.000020385733,0.00018179418,0.000080633676,0.00016508455,0.0001610603,0.000010206732,0.000096781965,0.00020468788,0.0000011378175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011033524,0.000013249559,0.0000032867506,0.000011716365,0.0000075689004,3.8745654e-7,0.000044607717,0.22399572,0.011054578,0.00010215307,0.00018860676,0.7645671],"study_design_scores_gemma":[0.00026790448,0.0003088289,0.000040818268,0.00010623176,0.000015440306,0.000015426318,3.1658212e-7,0.92994744,0.04761036,0.0056941435,0.015666934,0.00032616977],"about_ca_topic_score_codex":0.0000048854567,"about_ca_topic_score_gemma":0.000025235046,"teacher_disagreement_score":0.7642409,"about_ca_system_score_codex":0.00007155086,"about_ca_system_score_gemma":0.00030182628,"threshold_uncertainty_score":0.74133515},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031728292,0.0007988077,0.99527204,0.00028919088,0.00085941167,0.00033279584,0.000007273128,0.00001710473,0.0021061054],"genre_scores_gemma":[0.3797867,0.0006935128,0.5721036,0.008260383,0.009079782,0.00011221717,0.0005415823,0.00023006713,0.029192138],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985592,0.000007805574,0.0001675393,0.000774386,0.0002112274,0.00027984622],"domain_scores_gemma":[0.99922276,0.000022576412,0.000130313,0.0003606797,0.00019303581,0.000070651855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029292784,0.0002322018,0.00015801634,0.00023350063,0.00012818696,0.00006365315,0.00040142023,0.0004697217,0.0000104535875],"category_scores_gemma":[0.000035979006,0.00021546167,0.00009330485,0.00013551959,0.00017042116,0.0000048719253,0.00010559146,0.0002387923,0.0000040340074],"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.000077668774,0.000018559887,0.00007439302,0.000039043825,0.000011613244,8.994202e-7,0.00005794487,0.0020198743,0.51852244,0.00036755105,0.0020699904,0.47674003],"study_design_scores_gemma":[0.0004946909,0.000428525,0.00015426922,0.00016122867,0.000014966362,0.000034539014,3.5615804e-7,0.006782094,0.59637296,0.0058818897,0.38905698,0.0006174835],"about_ca_topic_score_codex":0.0000024336966,"about_ca_topic_score_gemma":0.00007568823,"teacher_disagreement_score":0.47612256,"about_ca_system_score_codex":0.0000793482,"about_ca_system_score_gemma":0.00024837977,"threshold_uncertainty_score":0.8786272},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003300895,0.00036238728,0.9918037,0.001707643,0.0010028991,0.00054634316,0.0000072287903,0.0003254967,0.0042112954],"genre_scores_gemma":[0.034574322,0.000028662425,0.9611265,0.0019755065,0.00076695863,0.000020721256,0.00000598036,0.00007322137,0.0014281012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939263,0.00006967258,0.0006456046,0.002217397,0.0019508004,0.0011902272],"domain_scores_gemma":[0.99549526,0.0012536186,0.0003098985,0.0021755528,0.00044423554,0.0003214218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010397121,0.0007346848,0.0006631862,0.0013741264,0.00036100872,0.00066489907,0.005143554,0.000398787,0.00003735995],"category_scores_gemma":[0.00019675761,0.000694957,0.0001813279,0.0008909575,0.0010202876,0.0009045421,0.0024656972,0.0013459476,0.00015012232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072362786,0.000022625884,0.0000044609633,0.000024559793,0.0000064008027,0.00008274017,0.0002684843,0.36775082,0.00005542626,0.002897929,0.00001160585,0.6288677],"study_design_scores_gemma":[0.00045015063,0.00019692075,0.00002718541,0.00035406553,0.000003635581,0.000049455182,8.535582e-8,0.9364316,0.0018008983,0.05614419,0.0037954287,0.000746379],"about_ca_topic_score_codex":0.000018619881,"about_ca_topic_score_gemma":0.000073222196,"teacher_disagreement_score":0.6281213,"about_ca_system_score_codex":0.0008461926,"about_ca_system_score_gemma":0.0010193286,"threshold_uncertainty_score":0.99955016},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009881016,0.00069324765,0.99429315,0.0006817769,0.0007162349,0.0007073524,0.000005152202,0.0007632323,0.0021299815],"genre_scores_gemma":[0.008905432,0.00003177059,0.98749316,0.002043552,0.0006369153,0.000022886099,0.000008890904,0.000058379617,0.00079899025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958337,0.000037250666,0.0007134682,0.0017788942,0.0007563463,0.00088032073],"domain_scores_gemma":[0.9971127,0.0005569511,0.00044558116,0.0013599762,0.00033049312,0.0001942966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012405852,0.00063603587,0.0006374037,0.0009142938,0.00046742742,0.0007511951,0.0037960343,0.0004182232,0.000009144127],"category_scores_gemma":[0.00013562506,0.00063525414,0.00022220687,0.0004959064,0.00042179393,0.00048445535,0.0013207962,0.00073887134,0.000023584696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065484546,0.000039139857,0.000014119037,0.00005000949,0.0000116066885,0.000018253244,0.0005118766,0.34356263,0.000044612818,0.016909102,0.0000785167,0.6387536],"study_design_scores_gemma":[0.00038224296,0.00010719393,0.000011412756,0.00047437052,0.000007215269,0.000044002656,1.0915866e-7,0.96592796,0.0011380143,0.019885767,0.011294511,0.0007272016],"about_ca_topic_score_codex":0.000007959113,"about_ca_topic_score_gemma":0.000021994858,"teacher_disagreement_score":0.63802636,"about_ca_system_score_codex":0.0003565946,"about_ca_system_score_gemma":0.0004175655,"threshold_uncertainty_score":0.9996099},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22290486,0.00059291016,0.7685251,0.0014995037,0.0033604922,0.0016927714,0.000005320267,0.000036882237,0.0013821098],"genre_scores_gemma":[0.96513176,0.000010324362,0.033557363,0.00068763644,0.00039983305,0.000009702543,0.000023114351,0.000019074616,0.0001612205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978814,0.0001087599,0.000583259,0.00054825237,0.0006612718,0.00021707342],"domain_scores_gemma":[0.9986485,0.00037455602,0.00030196176,0.000437648,0.00017573158,0.000061586805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008143549,0.00024944925,0.0004343579,0.0004616493,0.00010663324,0.000035658184,0.0001671117,0.00021212129,0.000015733849],"category_scores_gemma":[0.00012958485,0.00017872419,0.00010287312,0.0004167209,0.00045046667,0.00014732021,0.00008904058,0.00050266524,0.0000017735239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029397084,0.00037813486,0.05207974,0.00032684972,0.000044913188,0.0001186354,0.009832879,0.46774498,0.0025389667,0.001758136,0.00007818147,0.46480462],"study_design_scores_gemma":[0.0050026313,0.002353821,0.3890352,0.008662035,0.00014460989,0.00032279777,0.000009650346,0.57112545,0.006825655,0.013670208,0.0015544728,0.0012935082],"about_ca_topic_score_codex":0.0000264459,"about_ca_topic_score_gemma":0.00006929539,"teacher_disagreement_score":0.7422269,"about_ca_system_score_codex":0.00033494955,"about_ca_system_score_gemma":0.00035967983,"threshold_uncertainty_score":0.7288161},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010850434,0.00005238762,0.98383933,0.00007244109,0.0034772302,0.00037510286,0.000003159022,0.00025199342,0.0010779293],"genre_scores_gemma":[0.9603183,0.0000069713565,0.03840547,0.00029471613,0.0007250358,0.0000105758045,0.000006177368,0.000033565553,0.00019918413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968993,0.00003565897,0.00046836573,0.0012953805,0.00079450774,0.0005068019],"domain_scores_gemma":[0.99846846,0.000093877796,0.00025340653,0.00079304876,0.00025326558,0.00013795099],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000582224,0.00043496137,0.00034339848,0.00089724275,0.00091061945,0.0005950821,0.00091250293,0.00043096434,0.00006132131],"category_scores_gemma":[0.000017750821,0.00043828084,0.00015192344,0.000551323,0.0003363019,0.00055311626,0.00017584769,0.0012339026,0.000045489087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019797899,0.00008357038,0.000007628832,0.000069753034,0.000015819069,0.00002500397,0.0004923289,0.07165551,0.10970724,0.005896775,9.259631e-7,0.81202567],"study_design_scores_gemma":[0.00038060397,0.00023790903,0.00009957283,0.00027966307,0.000025799505,0.000095026924,4.367092e-7,0.8686468,0.05323099,0.075071625,0.0011829393,0.0007486277],"about_ca_topic_score_codex":0.000041035448,"about_ca_topic_score_gemma":0.00047066834,"teacher_disagreement_score":0.9494679,"about_ca_system_score_codex":0.00042184486,"about_ca_system_score_gemma":0.00020131725,"threshold_uncertainty_score":0.9998069},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008202943,0.0011079422,0.9940247,0.00036813013,0.000618843,0.00029496584,0.000002134267,0.00024086924,0.0032603717],"genre_scores_gemma":[0.20827037,0.00015709523,0.79074246,0.00037731137,0.0002658974,0.000019922396,0.0000028035824,0.0000297833,0.00013436396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697924,0.00003730526,0.00038241653,0.0008114364,0.0014886595,0.0003009481],"domain_scores_gemma":[0.9971338,0.000802576,0.000293667,0.0009560047,0.0007379118,0.00007605846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00165459,0.00029099404,0.00033400298,0.0005455283,0.00007590495,0.00018911612,0.0020829786,0.00022700742,0.000057026053],"category_scores_gemma":[0.00069405115,0.00026257528,0.000064943,0.00070850976,0.00023708717,0.0006371304,0.0005642954,0.00044705803,0.000013659263],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022799418,0.000046079138,0.00015649793,0.00013977352,0.00001164718,0.000015952837,0.0007823218,0.04967882,0.000028930323,0.0022897455,0.00013102038,0.9467169],"study_design_scores_gemma":[0.00017892197,0.00021175893,0.00018398999,0.00048389492,0.000025464942,0.00005929606,4.525872e-8,0.84353685,0.0033055835,0.14614023,0.00533855,0.0005354229],"about_ca_topic_score_codex":0.0000076150586,"about_ca_topic_score_gemma":0.000007118701,"teacher_disagreement_score":0.94618154,"about_ca_system_score_codex":0.00016673165,"about_ca_system_score_gemma":0.00056483055,"threshold_uncertainty_score":0.99998266},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033096363,0.0013742315,0.995376,0.0004249925,0.001138136,0.0007009608,0.000100918005,0.00016382617,0.0006878721],"genre_scores_gemma":[0.075801186,0.00002514448,0.9211632,0.0008315286,0.0015647293,0.000014099962,0.00005360307,0.000045029334,0.0005014823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960991,0.000028209717,0.00060881424,0.0016570204,0.0006553661,0.0009514728],"domain_scores_gemma":[0.9978648,0.00039028557,0.0003727937,0.00093009096,0.0002481696,0.00019388372],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00087020115,0.0005773826,0.00060799194,0.00047172935,0.0004821552,0.001403209,0.0028655673,0.00031597042,0.00001980428],"category_scores_gemma":[0.000035706842,0.00052866625,0.00012172253,0.00037146828,0.000279876,0.00054682494,0.0018001357,0.000565792,0.000006382396],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013873461,0.0000064636165,0.000018527677,0.000036409438,0.000011145123,0.000013158602,0.0003521751,0.0053374367,0.000013397841,0.0054660104,0.00010505714,0.9886388],"study_design_scores_gemma":[0.00042149978,0.00011355082,0.00006508257,0.0004340503,0.000009705763,0.00010668745,2.6654516e-7,0.9274648,0.00013683591,0.040256593,0.030274723,0.00071622187],"about_ca_topic_score_codex":0.000015189085,"about_ca_topic_score_gemma":0.00005000536,"teacher_disagreement_score":0.9879226,"about_ca_system_score_codex":0.00015948132,"about_ca_system_score_gemma":0.00031839608,"threshold_uncertainty_score":0.99971646},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002932837,0.00020518182,0.9910521,0.00023139143,0.0019241861,0.00032104488,0.000010437861,0.00017918124,0.005783186],"genre_scores_gemma":[0.010288559,0.000028049923,0.9868369,0.0023417242,0.00044618433,0.0000022178288,0.000011304523,0.000036934645,0.000008134899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960316,0.000034784513,0.0005480366,0.0015551487,0.0009899853,0.00084046094],"domain_scores_gemma":[0.99774235,0.00025129,0.00031524856,0.00122571,0.00026013146,0.00020523847],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010577143,0.00054574484,0.00047695686,0.0006452454,0.00039177338,0.0011104048,0.0025026705,0.0003908398,0.00004776097],"category_scores_gemma":[0.000039800612,0.0004955406,0.00015455573,0.0006107539,0.0007086448,0.0008356564,0.0011864544,0.0008507734,0.00016962111],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002129297,0.000017198945,0.00002211544,0.00002254738,0.000005114763,0.00023293331,0.00030514022,0.001418911,0.000016601747,0.000041958643,0.000011670113,0.9979037],"study_design_scores_gemma":[0.00019445781,0.0001138064,0.00008711333,0.00028813235,0.0000076069373,0.00018199814,9.490673e-8,0.95224994,0.00010335064,0.04565192,0.0004550269,0.00066656957],"about_ca_topic_score_codex":0.00007424253,"about_ca_topic_score_gemma":0.000057168123,"teacher_disagreement_score":0.9972371,"about_ca_system_score_codex":0.00031290122,"about_ca_system_score_gemma":0.00039138543,"threshold_uncertainty_score":0.99992657},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020179595,0.00011227263,0.98877585,0.000026307034,0.0004935816,0.00067697477,0.0000023991167,0.00018178781,0.0077128867],"genre_scores_gemma":[0.85632807,0.0000026681535,0.14271116,0.00008787436,0.00021861616,0.000017395194,0.000022535722,0.00006203663,0.0005496713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838823,0.000007685789,0.0003302922,0.000513687,0.0005108354,0.0002492943],"domain_scores_gemma":[0.9993117,0.00007286836,0.00008773435,0.00041426643,0.00007097422,0.00004245639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002300911,0.00030871964,0.00031425408,0.00045373055,0.000063708925,0.00006523395,0.00045644122,0.0001019457,0.000030677795],"category_scores_gemma":[0.000012967545,0.000277079,0.000028198576,0.0002136501,0.00007040331,0.00006243195,0.00007769638,0.00027675915,0.000014981398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004359297,0.00003877473,0.000019946912,0.00005347575,0.0000052747646,0.0000063621815,0.0002100748,0.85506463,0.0000070365227,0.0000027880433,0.000029118946,0.14455816],"study_design_scores_gemma":[0.00035383465,0.00016221179,0.0005678391,0.0004177644,0.000010074173,0.0000017240294,6.332595e-8,0.9921121,0.0047443025,0.00057992846,0.0005772563,0.00047290593],"about_ca_topic_score_codex":0.0000046781033,"about_ca_topic_score_gemma":0.00001757755,"teacher_disagreement_score":0.8543101,"about_ca_system_score_codex":0.00013359309,"about_ca_system_score_gemma":0.000114518465,"threshold_uncertainty_score":0.9999681},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014986139,0.0013030311,0.9901965,0.0008439887,0.0012311277,0.0005680509,0.000012718828,0.0009780995,0.0047166203],"genre_scores_gemma":[0.22060907,0.0004458046,0.77568215,0.0019715019,0.0008328777,0.000025903086,0.000015053582,0.00007244114,0.00034517827],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99369067,0.00008282021,0.00093988463,0.0024332902,0.0015053023,0.0013480622],"domain_scores_gemma":[0.9960065,0.00048569593,0.0006196133,0.002260617,0.00032789086,0.00029967728],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010848371,0.00109401,0.0010347348,0.002817483,0.0006712753,0.00092352496,0.005737854,0.0005999396,0.000017424627],"category_scores_gemma":[0.00007040499,0.0010044903,0.0005222183,0.0017615198,0.0011699639,0.0014988796,0.0013838813,0.0014684848,0.000018509958],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017257118,0.0000488983,0.00013061723,0.000051702416,0.000027151536,0.00031769008,0.0005903242,0.0036910092,0.00019384944,0.026790434,0.00010277188,0.9680383],"study_design_scores_gemma":[0.0006502604,0.0010024153,0.0012712271,0.0020026062,0.000047408463,0.0004322481,5.056759e-7,0.03702156,0.009926764,0.9283255,0.016422955,0.0028965997],"about_ca_topic_score_codex":0.000015439962,"about_ca_topic_score_gemma":0.000030479085,"teacher_disagreement_score":0.9651417,"about_ca_system_score_codex":0.00027499796,"about_ca_system_score_gemma":0.00040686643,"threshold_uncertainty_score":0.9996416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023572209,0.00026630185,0.99080825,0.000989418,0.0008471022,0.00027721078,0.000013422039,0.0003556538,0.006440288],"genre_scores_gemma":[0.046538882,0.0005739063,0.94679916,0.003422181,0.0006479898,0.000011120005,0.000044699882,0.00006820114,0.001893882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616736,0.000026281561,0.0004344417,0.0018385777,0.001033282,0.00050003343],"domain_scores_gemma":[0.99542814,0.00033576152,0.00024269792,0.0037143154,0.00013950815,0.00013958805],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006022527,0.00043883227,0.00038984258,0.0005867813,0.00028571038,0.0004517695,0.0078122523,0.00024205848,0.000016931523],"category_scores_gemma":[0.00011865063,0.0003750883,0.00007792106,0.00049620966,0.00061629055,0.00085812784,0.0036351667,0.0007508587,0.0000909596],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064309056,0.000022643497,0.0000036465217,0.000025153251,0.0000070769433,0.000119393546,0.00024253153,0.0008098234,0.00015864993,0.014177821,0.00021704727,0.9842098],"study_design_scores_gemma":[0.00018680042,0.00022833672,0.000052262094,0.00047151116,0.0000050004933,0.0001522446,4.7352597e-8,0.9063972,0.0054134107,0.073583305,0.012620414,0.00088944583],"about_ca_topic_score_codex":0.000010123035,"about_ca_topic_score_gemma":0.000013510456,"teacher_disagreement_score":0.98332036,"about_ca_system_score_codex":0.00020960956,"about_ca_system_score_gemma":0.0003735584,"threshold_uncertainty_score":0.9998701},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011248287,0.00010330645,0.99047136,0.0031735746,0.0014870504,0.0008875011,0.000007502461,0.00080966053,0.0019352084],"genre_scores_gemma":[0.57614756,0.00006572259,0.4218357,0.0012628582,0.00019116745,0.00007668968,0.000014361302,0.00003940424,0.00036653175],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573827,0.000034123943,0.00058976084,0.0018816664,0.0011449577,0.00061121956],"domain_scores_gemma":[0.99634904,0.0003028272,0.00037158528,0.002493907,0.00035020034,0.00013243909],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000902351,0.00055428036,0.0004672368,0.00094296085,0.00037446266,0.0006413459,0.004128053,0.0006113991,0.000022066213],"category_scores_gemma":[0.00023696327,0.0004716899,0.00014093908,0.0009932454,0.0011636823,0.0008472055,0.0009411011,0.0014689466,0.00007718855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008844844,0.000083587765,0.00018654177,0.00004904935,0.000007873632,0.00001683514,0.00034193665,0.0012255446,0.0019355946,0.34779528,0.00002729246,0.6483216],"study_design_scores_gemma":[0.00039278055,0.00034026874,0.0007340715,0.00027937558,0.0000063188504,0.000013673713,2.6329724e-7,0.05922051,0.030632447,0.9048135,0.0026684601,0.0008983166],"about_ca_topic_score_codex":0.000005828201,"about_ca_topic_score_gemma":0.00004727807,"teacher_disagreement_score":0.6474233,"about_ca_system_score_codex":0.00033735667,"about_ca_system_score_gemma":0.00049687864,"threshold_uncertainty_score":0.9997735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031966665,0.00076771155,0.9854382,0.0011259401,0.0011981032,0.0039127953,0.000021443577,0.00005874691,0.0074450597],"genre_scores_gemma":[0.5075772,0.00484713,0.4141917,0.044059075,0.006245444,0.00976276,0.00007897086,0.00043062025,0.012807106],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968246,0.00016914152,0.000939205,0.0007100948,0.00053318567,0.0008237478],"domain_scores_gemma":[0.9956411,0.0019382935,0.0006723646,0.0011414231,0.00034697287,0.00025980966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022667341,0.00031549938,0.00051455083,0.00033787318,0.00083816366,0.000010534058,0.0012662887,0.00046003456,0.00033376002],"category_scores_gemma":[0.00016080971,0.0002148327,0.00007113856,0.0003848387,0.00086300063,0.00006964168,0.00040654518,0.0015993895,0.00015118298],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000819016,0.000063864325,0.0004099635,0.0007036685,0.000013439134,0.000010975192,0.0054090586,0.002250062,0.000070695,0.09283189,0.0017426556,0.89641184],"study_design_scores_gemma":[0.0014235717,0.00077578845,0.0018621861,0.0027304832,0.00007897116,0.000046761706,0.000007634214,0.027465304,0.00028957013,0.7754318,0.18870378,0.0011841656],"about_ca_topic_score_codex":0.00032263863,"about_ca_topic_score_gemma":0.0002816803,"teacher_disagreement_score":0.8952277,"about_ca_system_score_codex":0.00023119015,"about_ca_system_score_gemma":0.003014682,"threshold_uncertainty_score":0.87606233},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009869559,0.0004661749,0.99506855,0.00051294034,0.0012070925,0.00035647248,0.000014429224,0.00015262642,0.0022118187],"genre_scores_gemma":[0.05062989,0.000102766506,0.94811314,0.00023776125,0.00039114105,0.0000061983687,0.000015593998,0.00005766701,0.0004458115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941866,0.000034911824,0.0007281851,0.0022928962,0.00177164,0.0009858136],"domain_scores_gemma":[0.9940843,0.00048519488,0.00031756758,0.0045070127,0.00034071732,0.0002651922],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012051644,0.0005360007,0.0007265948,0.0009317759,0.00020677748,0.00038004888,0.011590866,0.00033633263,0.000027709166],"category_scores_gemma":[0.00021573684,0.00050949084,0.000092564835,0.0010270565,0.0010230704,0.0012304967,0.012651553,0.0011748475,0.000045928522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008135601,0.0000479449,0.000010081007,0.00014013426,0.000014415236,0.00021305656,0.00028618262,0.28997484,0.00020007411,0.009538195,0.000010008741,0.69955695],"study_design_scores_gemma":[0.00030470692,0.00017680918,0.000027811173,0.00036634834,0.0000045561364,0.0001226205,1.08958794e-7,0.8738716,0.00095818925,0.123164244,0.00050020247,0.0005027671],"about_ca_topic_score_codex":0.00010510435,"about_ca_topic_score_gemma":0.000083791725,"teacher_disagreement_score":0.6990542,"about_ca_system_score_codex":0.0006443911,"about_ca_system_score_gemma":0.0013184109,"threshold_uncertainty_score":0.99973565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005449638,0.00023694268,0.9952088,0.000991953,0.0012825633,0.0004301242,0.00014567914,0.00005723186,0.0011017564],"genre_scores_gemma":[0.06623097,0.00010163245,0.93072,0.0016340269,0.0006712919,0.00005339764,0.0003394594,0.000047587113,0.00020163914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653727,0.000032153686,0.00068891514,0.0015130043,0.00082969334,0.0003989661],"domain_scores_gemma":[0.99677694,0.00025854204,0.0005046179,0.0019190456,0.00038565104,0.00015519289],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037232184,0.0004077025,0.00045720558,0.00048730153,0.00022840104,0.00035828608,0.0024923626,0.00022859403,0.000033032797],"category_scores_gemma":[0.000060366154,0.00039718163,0.000117450334,0.00059658865,0.00041337087,0.0005609849,0.0005961081,0.00044196352,0.00003661628],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.7268655e-7,0.00008210037,0.0002509084,0.000014744993,0.000031936204,0.000030305762,0.0013687949,0.0077414545,0.002148246,0.007555238,0.0005967847,0.98017883],"study_design_scores_gemma":[0.0005897067,0.00020070562,0.001902993,0.0004927334,0.00004357073,0.000039567603,0.0000013958504,0.86186844,0.027029255,0.10457713,0.00206073,0.0011937872],"about_ca_topic_score_codex":0.0005239549,"about_ca_topic_score_gemma":0.00027484918,"teacher_disagreement_score":0.978985,"about_ca_system_score_codex":0.00022155856,"about_ca_system_score_gemma":0.00034196218,"threshold_uncertainty_score":0.999848},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026102496,0.00075339165,0.9711013,0.000012842846,0.0007119157,0.00063642114,0.00000479523,0.0000790316,0.00059783796],"genre_scores_gemma":[0.9452416,0.000004358159,0.05447599,0.000007852161,0.00015499657,0.000030997446,0.000003134695,0.000038952694,0.00004215883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842393,0.000014547898,0.00055462273,0.00040172972,0.00032031408,0.00028487123],"domain_scores_gemma":[0.9992867,0.000105219304,0.000096439675,0.00034675328,0.000114117065,0.000050755352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029587487,0.00023708935,0.00036197703,0.0005795443,0.000116083895,0.000073030234,0.00044124632,0.00017163299,0.000008125157],"category_scores_gemma":[0.000045760804,0.00025951484,0.000038175636,0.00045175495,0.00013454267,0.00014965476,0.00017904457,0.00044593218,0.00001120714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.4526408e-7,0.0000066416483,0.00028804378,0.000074641066,0.000002445074,0.000006152356,0.0005147707,0.97243255,0.016120834,0.0010102257,5.077513e-7,0.009542744],"study_design_scores_gemma":[0.00010380382,0.000043841228,0.001345607,0.0022065246,0.000010588321,0.00003963606,0.0000043231707,0.99183655,0.0029581238,0.0007976066,0.00016331299,0.0004900568],"about_ca_topic_score_codex":0.0003695272,"about_ca_topic_score_gemma":0.00006523682,"teacher_disagreement_score":0.9191391,"about_ca_system_score_codex":0.0005636203,"about_ca_system_score_gemma":0.00020882778,"threshold_uncertainty_score":0.9999857},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000081720646,0.0003821171,0.9815747,0.0014838126,0.00077106874,0.00054852193,0.0000028249879,0.0008700987,0.014285109],"genre_scores_gemma":[0.01634423,0.000013958038,0.97920454,0.0029370713,0.00028752693,0.000008154052,0.000005074411,0.00006386059,0.0011355849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938082,0.00007600547,0.0006741815,0.0022893485,0.0018036197,0.0013486531],"domain_scores_gemma":[0.9964659,0.000692322,0.00029021272,0.002109983,0.0001471763,0.00029436903],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023506833,0.0007647021,0.0006497328,0.0026840789,0.00047268657,0.00063321384,0.0063630296,0.00048695804,0.00002632172],"category_scores_gemma":[0.00013843927,0.00074323924,0.00017179326,0.0018443482,0.00082251726,0.00028279758,0.004635533,0.0020820766,0.000038037822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001944857,0.000026139069,0.000112431386,0.000043600965,0.00001614454,0.0005656671,0.00010951878,0.21919079,0.0000358596,0.009781891,0.00007457411,0.77002394],"study_design_scores_gemma":[0.00027790837,0.00018913012,0.00010878272,0.0005675307,0.000011637521,0.000069851405,1.8244512e-7,0.9379856,0.0004440678,0.0259074,0.03356149,0.0008764002],"about_ca_topic_score_codex":0.00002411193,"about_ca_topic_score_gemma":0.00006423115,"teacher_disagreement_score":0.7691475,"about_ca_system_score_codex":0.0007053491,"about_ca_system_score_gemma":0.00024232332,"threshold_uncertainty_score":0.9995019},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063198275,0.0003836202,0.9970066,0.0006957177,0.00061888195,0.00044303728,0.000015833866,0.00007613648,0.00012820344],"genre_scores_gemma":[0.0655682,0.00003575223,0.93380135,0.0001227106,0.0003727568,0.00003049871,0.000001564511,0.00002103238,0.000046139794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974608,0.000012206761,0.00043708095,0.000992245,0.0006526741,0.00044502915],"domain_scores_gemma":[0.9981849,0.00009208621,0.00033164833,0.00087148737,0.00039478415,0.00012508918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027738366,0.00031893668,0.00034097437,0.0004307851,0.0002516003,0.00019753884,0.002201529,0.00024547236,0.000023983408],"category_scores_gemma":[0.000008974738,0.00029561433,0.00010702868,0.000678408,0.000761949,0.0003419713,0.00082861487,0.00057816424,0.000004519875],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011775558,0.000057289846,0.00038973324,0.000042409098,0.000010336082,0.0000098116225,0.00026330343,0.01693748,0.0019201294,0.0060971207,0.0000017158974,0.9742695],"study_design_scores_gemma":[0.00015807187,0.000060847018,0.0028662456,0.00044379753,0.00001905835,0.00021605154,1.2943879e-7,0.93961906,0.0022475163,0.05285815,0.00090940436,0.0006016677],"about_ca_topic_score_codex":0.00010927211,"about_ca_topic_score_gemma":0.00006456618,"teacher_disagreement_score":0.9736678,"about_ca_system_score_codex":0.00014405843,"about_ca_system_score_gemma":0.00071092846,"threshold_uncertainty_score":0.9999496},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001663911,0.0017089056,0.99429536,0.00041772518,0.0008881701,0.00037062878,0.000013574975,0.00071623345,0.0015727612],"genre_scores_gemma":[0.05156066,0.000025238276,0.94632405,0.0015527435,0.00028787606,0.000011579571,0.000012402042,0.00004397566,0.00018147941],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564713,0.000047532165,0.0005323462,0.0017367922,0.0012414164,0.0007948082],"domain_scores_gemma":[0.99669755,0.0009155124,0.00030322443,0.0015615679,0.00027596366,0.000246189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083064206,0.00062242313,0.0005788159,0.00087808643,0.0002091485,0.000846322,0.0044305734,0.00044738644,0.0000660912],"category_scores_gemma":[0.00021304634,0.0005418396,0.00011198723,0.00062673824,0.00086038053,0.00059166114,0.0009790875,0.0012059398,0.000045608467],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011306204,0.00004099789,0.00007916209,0.00007236388,0.0000051677343,0.0007352338,0.0000862191,0.00041717352,0.0005683193,0.07505599,0.000044975986,0.9228831],"study_design_scores_gemma":[0.00041262546,0.0003537508,0.00019281133,0.0011409656,0.000013466009,0.0002666994,2.2896952e-8,0.21145546,0.0070472625,0.7743796,0.0033073986,0.0014299438],"about_ca_topic_score_codex":0.00002086252,"about_ca_topic_score_gemma":0.00003089986,"teacher_disagreement_score":0.9214532,"about_ca_system_score_codex":0.0004202867,"about_ca_system_score_gemma":0.0009165219,"threshold_uncertainty_score":0.9997033},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022176525,0.000110129586,0.9946555,0.00016741669,0.0011396192,0.00094328483,0.00007121815,0.00015904424,0.002532039],"genre_scores_gemma":[0.16049542,0.000002638627,0.8386243,0.00050292106,0.00021761881,0.00002352508,0.000030465086,0.000035504436,0.00006759086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563575,0.00005700036,0.00076608383,0.0017251888,0.0011947895,0.0006211677],"domain_scores_gemma":[0.99662846,0.00038324742,0.0005787784,0.0016048354,0.0005253216,0.0002793428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006789295,0.0006345182,0.0008361411,0.0010984264,0.00024663133,0.00015856382,0.001984245,0.0003356884,0.000004715294],"category_scores_gemma":[0.00012280596,0.000562878,0.0001683821,0.0010091816,0.0007894763,0.0006941012,0.0010701935,0.0008571693,0.000016834403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005713373,0.00021296217,0.000043065662,0.00019113791,0.00003310953,0.000049440412,0.0021775449,0.4639656,0.0020232939,0.07893051,0.00002004212,0.45229617],"study_design_scores_gemma":[0.0007749823,0.00063141587,0.0002585291,0.0009012582,0.000018338305,0.00005653547,0.0000022873699,0.9667994,0.01118831,0.016818894,0.0013112527,0.0012388394],"about_ca_topic_score_codex":0.00008247722,"about_ca_topic_score_gemma":0.000138528,"teacher_disagreement_score":0.5028338,"about_ca_system_score_codex":0.00019007418,"about_ca_system_score_gemma":0.0007098091,"threshold_uncertainty_score":0.99968225},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010115782,0.00022532389,0.99677795,0.00025580602,0.0005492747,0.00074823154,0.000024691271,0.00011630812,0.000290844],"genre_scores_gemma":[0.010128441,0.000006767508,0.98861647,0.00031074585,0.00037112524,0.00003239195,0.000008227375,0.000049251274,0.00047655834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586535,0.000037972008,0.00049309974,0.0015783204,0.0011549239,0.00087035063],"domain_scores_gemma":[0.99559665,0.0015289467,0.00035883122,0.0016604075,0.00065029936,0.00020484423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089563936,0.0005561635,0.00067422196,0.00097422546,0.00023446158,0.00031100094,0.0037306664,0.00034915569,0.000013191766],"category_scores_gemma":[0.00016674255,0.0004404508,0.00018981552,0.00069286104,0.0019021884,0.00066007813,0.001093537,0.0009079028,0.000006024814],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025117395,0.0000790913,0.00013534269,0.000066735316,0.000025881549,0.000043281718,0.00046349276,0.0027916508,0.005854964,0.013027221,0.000010105312,0.97747713],"study_design_scores_gemma":[0.00065415225,0.0016569956,0.000064464664,0.00027403407,0.000014318608,0.00011557045,2.4160423e-7,0.4948785,0.06502911,0.43489242,0.001486824,0.00093335594],"about_ca_topic_score_codex":0.000007170179,"about_ca_topic_score_gemma":0.00010984563,"teacher_disagreement_score":0.9765438,"about_ca_system_score_codex":0.00011201694,"about_ca_system_score_gemma":0.0004416426,"threshold_uncertainty_score":0.99980474},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004292516,0.0010950539,0.99351144,0.00013985911,0.0019633607,0.0017721646,0.0000033892395,0.00017810751,0.00090739795],"genre_scores_gemma":[0.23095933,0.0002128289,0.75953686,0.005115841,0.0031486996,0.00036437003,0.000043380973,0.00008606776,0.0005326026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995412,0.000050328603,0.0007838755,0.0019706993,0.00080592505,0.0009771906],"domain_scores_gemma":[0.99731183,0.0004677095,0.00042477477,0.001416378,0.00021775719,0.00016154684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013060399,0.0006136205,0.00052681693,0.00087113446,0.00027473734,0.0009896621,0.0034783173,0.0003126293,0.000018391693],"category_scores_gemma":[0.000030173587,0.00062137767,0.00012313014,0.0010357004,0.00018198797,0.0009782069,0.0015001257,0.0005779147,0.000021996611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019129327,0.000017729755,0.000042576936,0.000033952896,0.0000044296494,0.000020034944,0.00012648194,0.5501394,0.00004995764,0.0010601012,0.00005644245,0.44844696],"study_design_scores_gemma":[0.00039293684,0.00021526247,0.00003830225,0.00039507105,0.000008509782,0.000009028486,1.8946669e-7,0.98380595,0.00007083185,0.0049140896,0.009566914,0.0005829315],"about_ca_topic_score_codex":0.000030002733,"about_ca_topic_score_gemma":0.00058672595,"teacher_disagreement_score":0.44786403,"about_ca_system_score_codex":0.00070196064,"about_ca_system_score_gemma":0.0003383692,"threshold_uncertainty_score":0.9996238},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040059353,0.0010803094,0.994705,0.00013205362,0.0012425293,0.0005694309,0.00007851447,0.00072049495,0.0010710754],"genre_scores_gemma":[0.17572612,0.00014645958,0.82335496,0.00021724061,0.00028807044,0.000006202199,0.00010542137,0.000083618994,0.000071911614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927684,0.000074617106,0.0009559854,0.0033678454,0.0016100735,0.0012230444],"domain_scores_gemma":[0.9915258,0.0010017148,0.000690743,0.0062449547,0.00027191342,0.0002648403],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013688408,0.0009643226,0.0009831794,0.0014835701,0.0006543151,0.001212838,0.013375506,0.00050871767,0.000013182337],"category_scores_gemma":[0.00041939717,0.00094295683,0.00014982942,0.0009235851,0.0010605897,0.0031808114,0.01025986,0.001326937,0.00001690171],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007754398,0.000034091154,0.0003391311,0.000051931693,0.000026699505,0.0004386939,0.00047233686,0.00803497,0.00017475532,0.0004610694,0.000119155055,0.98983943],"study_design_scores_gemma":[0.00045806958,0.00009228063,0.00017211822,0.0013177312,0.000020313439,0.0005559015,2.8367984e-7,0.98207855,0.0003083456,0.013534549,0.0004811777,0.0009806968],"about_ca_topic_score_codex":0.0001606821,"about_ca_topic_score_gemma":0.0005377424,"teacher_disagreement_score":0.9888587,"about_ca_system_score_codex":0.00084377703,"about_ca_system_score_gemma":0.0012577253,"threshold_uncertainty_score":0.999824},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004036268,0.0045586806,0.9790397,0.00054541056,0.002993237,0.001180292,0.0000044456838,0.00038720568,0.01125062],"genre_scores_gemma":[0.059948076,0.0005156203,0.92143023,0.0054907813,0.009690826,0.0002528279,0.000016215974,0.00012730621,0.002528111],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99482036,0.000070560294,0.0007495623,0.0020130263,0.0008416364,0.0015048785],"domain_scores_gemma":[0.99679226,0.00082463434,0.00036021625,0.0015932772,0.00016233498,0.00026727066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015113582,0.0007233206,0.0007747244,0.00036323405,0.0007577889,0.00076984096,0.00409253,0.00040342566,0.000058937378],"category_scores_gemma":[0.000015128263,0.00069195573,0.0002974574,0.0008441029,0.00054298464,0.00043924735,0.00075445254,0.0007858689,0.00005392445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013568642,0.00000824514,0.000009282406,0.000011563257,0.000012665312,0.000029860563,0.00028956254,0.3976695,4.7062161e-7,0.035457976,0.00038356948,0.5661137],"study_design_scores_gemma":[0.00030821614,0.00021390927,0.000014424426,0.00032438285,0.000012035336,0.000026369617,8.602601e-8,0.46187684,0.0000016576998,0.46231353,0.074341014,0.0005675412],"about_ca_topic_score_codex":0.000006943776,"about_ca_topic_score_gemma":0.000053594205,"teacher_disagreement_score":0.5655462,"about_ca_system_score_codex":0.00019112448,"about_ca_system_score_gemma":0.00032772848,"threshold_uncertainty_score":0.99955314},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005498583,0.0024334034,0.9903749,0.000029799916,0.0006173286,0.00025612072,0.000002931905,0.000044856035,0.00074206933],"genre_scores_gemma":[0.7756786,0.0009638438,0.21664603,0.00077553757,0.003373858,0.000007845102,0.00035091277,0.00015896148,0.0020444386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964793,0.00009609371,0.0005728198,0.0014658864,0.0007217898,0.0006641105],"domain_scores_gemma":[0.99777126,0.0000596709,0.00054342026,0.0011204586,0.000312586,0.00019258358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012747314,0.0005511058,0.0005012678,0.00037918138,0.00031355853,0.0001253793,0.000989634,0.00089969864,0.000025936652],"category_scores_gemma":[0.00009337481,0.0005685988,0.00027282865,0.00043749475,0.0006344707,0.000010859371,0.00063616136,0.00065149454,0.000008555363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003568738,0.000010995158,0.000480798,0.000006260576,0.000060002094,0.000014791555,0.000024843786,0.73382246,0.0051191635,0.000034987974,0.00003059685,0.2603594],"study_design_scores_gemma":[0.00072401727,0.00040675138,0.0019016404,0.00016341139,0.00017887956,0.00009474244,3.1249692e-7,0.96685696,0.018920777,0.00420763,0.005161127,0.0013837648],"about_ca_topic_score_codex":0.000011824383,"about_ca_topic_score_gemma":0.00011998395,"teacher_disagreement_score":0.7737289,"about_ca_system_score_codex":0.000167084,"about_ca_system_score_gemma":0.0002484527,"threshold_uncertainty_score":0.9996765},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005475726,0.0002507847,0.99026203,0.00049575337,0.0017866872,0.00063307496,0.000018213492,0.00019235794,0.00635563],"genre_scores_gemma":[0.017438909,0.000037761678,0.9778734,0.0017254861,0.0011776929,0.000024462139,0.000015823474,0.00004025055,0.0016662297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625045,0.000016401613,0.0004265805,0.0016907578,0.0008039784,0.00081182516],"domain_scores_gemma":[0.9977285,0.00045102212,0.0002880754,0.0012330345,0.00015715757,0.00014220043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090399006,0.00051714096,0.00046060613,0.0008327923,0.00035234864,0.000914659,0.0040970026,0.00020494986,0.000013549336],"category_scores_gemma":[0.000077509765,0.00048779,0.00015579697,0.0004896649,0.0002897654,0.0014488822,0.0020977235,0.00049543707,0.00004234687],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036611711,0.000016435799,0.0000046667765,0.000027064369,0.0000127471,0.0000398813,0.00043718997,0.008250537,0.000019773446,0.041109636,0.0001097488,0.94996864],"study_design_scores_gemma":[0.00032109165,0.00020625225,0.000024434163,0.00036563235,0.000010812143,0.000014338603,3.452784e-7,0.89992976,0.00033256478,0.09122691,0.0068367114,0.0007311208],"about_ca_topic_score_codex":0.0000071524164,"about_ca_topic_score_gemma":0.000037907696,"teacher_disagreement_score":0.9492375,"about_ca_system_score_codex":0.00029581346,"about_ca_system_score_gemma":0.0002935649,"threshold_uncertainty_score":0.99975735},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029205405,0.0006594264,0.9922125,0.0018235634,0.0017256106,0.000635759,0.000010892229,0.00035105314,0.0025520131],"genre_scores_gemma":[0.025400633,0.00010709588,0.9698702,0.0034234957,0.0005337103,0.000017069344,0.000011940933,0.00003166058,0.0006041891],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996603,0.000013722536,0.0006771775,0.0010772573,0.00077162037,0.00085723016],"domain_scores_gemma":[0.9970831,0.0007063157,0.0003146627,0.0014750398,0.00026339217,0.00015747614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080460386,0.00058745354,0.0006956474,0.0009151188,0.00024113686,0.00067049195,0.0038126132,0.00037923388,0.000009864654],"category_scores_gemma":[0.00022236674,0.00050124293,0.00021711265,0.0005238711,0.0003950699,0.00076041283,0.0008146968,0.0005343887,0.000046650835],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004916586,0.000023172186,0.000013302279,0.000117312506,0.000012523795,0.000045731173,0.00048876164,0.0069440813,0.000031801985,0.019258568,0.00021043023,0.97284937],"study_design_scores_gemma":[0.0003410011,0.00026284513,0.00005607916,0.00042217044,0.000012328858,0.000097297045,2.4733149e-7,0.8606634,0.00044510898,0.13190469,0.0051359213,0.0006588858],"about_ca_topic_score_codex":0.000006986479,"about_ca_topic_score_gemma":0.000062185776,"teacher_disagreement_score":0.9721905,"about_ca_system_score_codex":0.00019376917,"about_ca_system_score_gemma":0.0006972439,"threshold_uncertainty_score":0.99974394},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010344391,0.00020311988,0.97715586,0.00011315865,0.0012113855,0.00022906339,0.0000031430395,0.000058686812,0.019991146],"genre_scores_gemma":[0.9386126,0.00001539539,0.05987773,0.00032130847,0.0005332694,0.0000033117508,0.0000032606113,0.000033969878,0.00059916463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981929,0.000017987699,0.00038784757,0.0005527098,0.0005466741,0.00030185797],"domain_scores_gemma":[0.9983582,0.0005638834,0.00025932747,0.0006267992,0.00012406321,0.00006774798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058861077,0.00029622234,0.00043279547,0.000449974,0.00008885864,0.000036199537,0.0006289352,0.00035201298,0.00030077389],"category_scores_gemma":[0.00015272484,0.00026519372,0.00012386625,0.00030801227,0.00047499235,0.00012316811,0.00023472092,0.0005975301,0.000029576777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022818835,0.000061624625,0.000010221441,0.0002609477,0.00003594251,0.0000419396,0.00068145734,0.0028290881,0.00011301692,0.7766724,0.000020081752,0.21925044],"study_design_scores_gemma":[0.00020199109,0.00017919911,0.000026382255,0.00040445582,0.00002464041,0.000030417008,3.017194e-7,0.0014690816,0.0032950894,0.9940088,0.00009870183,0.00026096508],"about_ca_topic_score_codex":0.000010596889,"about_ca_topic_score_gemma":0.000019551542,"teacher_disagreement_score":0.93757814,"about_ca_system_score_codex":0.00014463437,"about_ca_system_score_gemma":0.00029134357,"threshold_uncertainty_score":0.99998003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014021175,0.00019892158,0.98373,0.0010413624,0.0014290041,0.00044190497,0.000007722455,0.00024152426,0.012769301],"genre_scores_gemma":[0.44878936,0.00013390569,0.54595476,0.0028657475,0.0010060609,0.00002786271,0.0000060026937,0.00008503681,0.0011312559],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950818,0.00006212077,0.0004935599,0.0018726314,0.0015555065,0.000934372],"domain_scores_gemma":[0.9965897,0.00078284455,0.00023991747,0.0018816196,0.00022720515,0.0002787031],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010458321,0.00059596234,0.00050208543,0.0014223054,0.00032370246,0.0004868319,0.0030453373,0.00035330624,0.000088231536],"category_scores_gemma":[0.00012634325,0.0005501723,0.00016358866,0.00074500707,0.0014619104,0.00074470876,0.0010931517,0.0015042116,0.00023408495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008398046,0.000015750264,0.00004342066,0.000010018561,0.0000066317425,0.00007459675,0.00015877135,0.018739298,0.00012259171,0.14300233,0.000012550515,0.8378056],"study_design_scores_gemma":[0.0003740826,0.00041060615,0.00047995255,0.0003115081,0.0000041529865,0.000121501835,1.6054777e-7,0.11538371,0.0020337477,0.877189,0.0028056018,0.0008859708],"about_ca_topic_score_codex":0.000009833951,"about_ca_topic_score_gemma":0.00008334064,"teacher_disagreement_score":0.83691967,"about_ca_system_score_codex":0.00059997273,"about_ca_system_score_gemma":0.00049434544,"threshold_uncertainty_score":0.999695},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020577302,0.00030659797,0.9931177,0.0012691851,0.001253909,0.00080906076,0.000014823538,0.00019067511,0.0030360231],"genre_scores_gemma":[0.017450584,0.00009487901,0.98054564,0.0013085223,0.00026205037,0.00003684623,0.0000148096005,0.000032625736,0.0002540396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967182,0.000032584285,0.0006160289,0.0013651622,0.00076893985,0.00049908494],"domain_scores_gemma":[0.9970756,0.00097507064,0.00034365873,0.0009850262,0.00044551905,0.00017511421],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009953352,0.0005191493,0.0006119823,0.0008114135,0.0002833409,0.00060359447,0.0015000316,0.00033332457,0.00030502948],"category_scores_gemma":[0.00023741694,0.00043598682,0.0003139727,0.00044919833,0.00071796175,0.00067140633,0.000408442,0.0003950614,0.000020736978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004704743,0.0000090462045,0.0000016362021,0.0000069313105,0.000024518464,0.0000034700224,0.00008692377,0.49157572,0.000003596906,0.06773471,0.000011147686,0.4405376],"study_design_scores_gemma":[0.0003657854,0.00008357428,0.000007615998,0.00009673539,0.00007913546,0.00006656401,1.1677917e-7,0.9025465,0.00012853116,0.094891675,0.0012700892,0.00046366977],"about_ca_topic_score_codex":0.0000032084824,"about_ca_topic_score_gemma":0.000041321127,"teacher_disagreement_score":0.44007394,"about_ca_system_score_codex":0.00028319375,"about_ca_system_score_gemma":0.0005461424,"threshold_uncertainty_score":0.9998092},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068044676,0.00008632512,0.9952153,0.0007524124,0.0017206378,0.0009127902,0.000017611063,0.0003538308,0.0008730486],"genre_scores_gemma":[0.051531255,0.0000065339327,0.9467773,0.0008048035,0.00066037686,0.000045026314,0.000045074456,0.000049883452,0.000079753365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949232,0.00005374855,0.00066933513,0.002341572,0.0011212594,0.00089088734],"domain_scores_gemma":[0.9965342,0.0006190233,0.0003098883,0.0019698527,0.000253118,0.00031390978],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011988059,0.00060020824,0.00061770494,0.00081954984,0.00034683789,0.00079814886,0.0040482553,0.00042530437,0.0000069741122],"category_scores_gemma":[0.00019729543,0.00057005865,0.0001623327,0.0005648154,0.00067953405,0.00094118813,0.00064182916,0.00081895926,0.000018217243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105639,0.000078414196,0.00006215435,0.00004010551,0.000011367114,0.00015908806,0.0020909791,0.261737,0.000295795,0.032765545,0.0000138080895,0.7027352],"study_design_scores_gemma":[0.00032012517,0.00035853873,0.0002620228,0.00023484004,0.000006715902,0.00009745663,2.3609195e-7,0.7159875,0.0005742989,0.28153706,0.000079649566,0.0005415303],"about_ca_topic_score_codex":0.000033711323,"about_ca_topic_score_gemma":0.000013004987,"teacher_disagreement_score":0.7021937,"about_ca_system_score_codex":0.00040709693,"about_ca_system_score_gemma":0.00087351934,"threshold_uncertainty_score":0.9996751},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009687331,0.00043362667,0.9797069,0.0004285261,0.00044664356,0.00020008069,0.0000057756893,0.00019075922,0.018490808],"genre_scores_gemma":[0.65558004,0.000112284004,0.34067467,0.00037251718,0.00055332074,0.000008419659,0.00012511776,0.000053317282,0.0025203296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966832,0.00009191266,0.00062693167,0.001247662,0.0009014608,0.0004488736],"domain_scores_gemma":[0.9969586,0.00064180384,0.0005941016,0.0013836174,0.0003162966,0.00010555727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010311516,0.00039989638,0.0005219603,0.0008276074,0.00024453754,0.00037578846,0.002644898,0.00029817343,0.00004182123],"category_scores_gemma":[0.00038675638,0.0003591171,0.00010733866,0.00088142796,0.0004746084,0.0005007404,0.00086738745,0.0011698107,0.000048789265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074331356,0.000050006543,0.0021747868,0.00012185135,0.000010672659,0.00005159736,0.00040308904,0.06915992,0.000531793,0.06168378,0.00018055254,0.8656245],"study_design_scores_gemma":[0.0003117312,0.00030887086,0.0031098335,0.0010137645,0.000013746655,0.00003448893,1.3441283e-7,0.9168166,0.0011162503,0.050746758,0.025670333,0.00085749396],"about_ca_topic_score_codex":0.0000849732,"about_ca_topic_score_gemma":0.000036231402,"teacher_disagreement_score":0.864767,"about_ca_system_score_codex":0.00016301457,"about_ca_system_score_gemma":0.00037395657,"threshold_uncertainty_score":0.9998861},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022945795,0.00009760459,0.9964752,0.0004556006,0.00021632342,0.00027729018,0.0000031142192,0.00009467296,0.00008559332],"genre_scores_gemma":[0.82330555,0.000017195463,0.17649093,0.000063258725,0.000056920555,0.0000032458443,0.0000015249421,0.0000081660655,0.000053184805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977144,0.00006861672,0.00041115523,0.00087051425,0.000633749,0.0003015446],"domain_scores_gemma":[0.9972557,0.00047952292,0.0005151247,0.0013640388,0.0003457662,0.000039836188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010062713,0.0003081865,0.0005286736,0.0013945318,0.000107556916,0.000063177155,0.0019669393,0.00021356385,0.000007649852],"category_scores_gemma":[0.00028926085,0.00020054939,0.0002698518,0.0017364507,0.00065878994,0.00015832913,0.00021967279,0.0004906673,0.0000038443945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011162737,0.000059801205,0.0004702032,0.000010850644,0.0000924865,0.0000060372627,0.00024692912,0.44042316,0.0006958305,0.004174336,0.000012226065,0.55379695],"study_design_scores_gemma":[0.00030163777,0.0029150895,0.047196742,0.00093830476,0.0002375069,0.000054574637,3.6972457e-7,0.6355877,0.017772902,0.29398525,0.00002515725,0.0009847988],"about_ca_topic_score_codex":0.000032714717,"about_ca_topic_score_gemma":0.000013322899,"teacher_disagreement_score":0.821011,"about_ca_system_score_codex":0.00019586389,"about_ca_system_score_gemma":0.00029218537,"threshold_uncertainty_score":0.8178166},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037221433,0.0006451071,0.99578047,0.00026803013,0.0015946637,0.00034159017,0.000010514814,0.00023221665,0.00075519265],"genre_scores_gemma":[0.13271028,0.00003642188,0.86454225,0.0016575572,0.00087041775,0.000006017082,0.000017653805,0.00005604568,0.00010334497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958605,0.000037958358,0.000516823,0.0016903457,0.0011493313,0.0007449984],"domain_scores_gemma":[0.9972627,0.00023278981,0.00027032322,0.001819166,0.00016143595,0.00025355766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005765342,0.000578768,0.00056650524,0.000938831,0.00033044972,0.00065186544,0.0036180087,0.0004239005,0.0000318525],"category_scores_gemma":[0.00005552601,0.0004983069,0.00016920098,0.0008562024,0.00062939577,0.0009574498,0.0022956778,0.0010278935,0.000029709812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014021391,0.00010242138,0.00008681001,0.00008258966,0.00002393282,0.0013974418,0.0017796166,0.0760348,0.0022369935,0.060081933,0.000022713666,0.8581367],"study_design_scores_gemma":[0.00051636016,0.00014134627,0.0002037674,0.0009721621,0.000012108125,0.00032180865,3.0184472e-7,0.8412332,0.0010557413,0.15399292,0.000551361,0.0009989048],"about_ca_topic_score_codex":0.00014043837,"about_ca_topic_score_gemma":0.00004295719,"teacher_disagreement_score":0.8571378,"about_ca_system_score_codex":0.00032938243,"about_ca_system_score_gemma":0.00085955724,"threshold_uncertainty_score":0.99974686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009975121,0.0005296849,0.9855671,0.00037198394,0.00074559834,0.00066384743,0.000027747694,0.000055939243,0.0020629817],"genre_scores_gemma":[0.95235604,0.0001804872,0.046732903,0.00052583136,0.00008391934,0.000009084174,0.000008653056,0.000025136902,0.00007792997],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99524176,0.000105694926,0.0011077364,0.0012223846,0.0017243078,0.00059810013],"domain_scores_gemma":[0.9957301,0.00034561363,0.00095101714,0.0022508206,0.00059243676,0.0001299868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001111598,0.000502902,0.00079279684,0.001306989,0.0004005255,0.00014993636,0.004178682,0.0002636132,0.00007138008],"category_scores_gemma":[0.000068064,0.00038167273,0.0005522901,0.0033326822,0.0016669515,0.00032213598,0.001817171,0.0005849971,0.000004171954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032328153,0.0005483375,0.01939313,0.00039124492,0.00040823617,0.00005775318,0.0048555587,0.010273909,0.010453243,0.22718875,0.00010510689,0.72629243],"study_design_scores_gemma":[0.0026358624,0.00089175283,0.03937276,0.0014735983,0.00035314925,0.00011443981,0.000008655327,0.29259834,0.019715643,0.63489586,0.005247168,0.002692763],"about_ca_topic_score_codex":0.0002174038,"about_ca_topic_score_gemma":0.0006917294,"teacher_disagreement_score":0.9423809,"about_ca_system_score_codex":0.00018786895,"about_ca_system_score_gemma":0.00047853647,"threshold_uncertainty_score":0.9998635},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015858505,0.0010567197,0.99059355,0.0010816584,0.0020875174,0.000608555,0.000006617616,0.00025594558,0.002723554],"genre_scores_gemma":[0.97209096,0.00013729911,0.025434192,0.0010698942,0.0003572406,0.000019650923,0.0000092197415,0.000048666723,0.0008328647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537736,0.00008929434,0.0008265764,0.0017269189,0.0011329761,0.00084684987],"domain_scores_gemma":[0.99707824,0.00035309614,0.00035145794,0.0017532014,0.0002248143,0.000239176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070758327,0.0005882373,0.0006769874,0.001419564,0.00022771722,0.00051804556,0.0038200829,0.00028151856,0.00005049618],"category_scores_gemma":[0.00008739603,0.0005729302,0.00015624124,0.0010786469,0.00052600156,0.000604261,0.0010481576,0.0008967921,0.00017553246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016560774,0.00023825183,0.0012140659,0.0002697738,0.000044823264,0.00065060623,0.13198152,0.0009543202,0.00036479044,0.015320162,0.00017155764,0.84877354],"study_design_scores_gemma":[0.0009831858,0.000100197634,0.0016965184,0.0010205428,0.000007979091,0.00020072113,7.892201e-7,0.945316,0.00069283036,0.03478872,0.013702848,0.0014896356],"about_ca_topic_score_codex":0.0001096506,"about_ca_topic_score_gemma":0.0005549632,"teacher_disagreement_score":0.9705051,"about_ca_system_score_codex":0.00042340238,"about_ca_system_score_gemma":0.00044796526,"threshold_uncertainty_score":0.99967223},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000078571225,0.00012683727,0.99450874,0.0019563993,0.0015515607,0.0014981502,0.000009614458,0.00016125839,0.00010889282],"genre_scores_gemma":[0.0076525393,0.000016080006,0.99052316,0.0010868692,0.00034483534,0.00006095263,0.000006221157,0.000049618335,0.000259708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582744,0.00006889327,0.00067439635,0.0013382756,0.0012791707,0.00081182126],"domain_scores_gemma":[0.9947745,0.0023084744,0.0004045316,0.0016813064,0.00063828455,0.00019289595],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021673464,0.00045123723,0.00044679537,0.00041962907,0.0006783123,0.0014140918,0.0033132872,0.00023785685,0.00007520049],"category_scores_gemma":[0.0010564036,0.00033261444,0.000148917,0.0006630576,0.00087297923,0.00064812356,0.0010656568,0.0009271383,0.000017850913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036083666,0.00002608251,0.0000057341335,0.000049414062,0.000017213128,0.000012427021,0.00026169053,0.6747792,0.000093849005,0.0021903676,0.00002305991,0.3225374],"study_design_scores_gemma":[0.000272925,0.000073348754,0.0000062418508,0.00010675137,0.000019957106,0.000060233586,1.6902501e-7,0.9776235,0.0030538016,0.017790569,0.0005981085,0.000394368],"about_ca_topic_score_codex":0.000007013614,"about_ca_topic_score_gemma":0.0000054886495,"teacher_disagreement_score":0.32214305,"about_ca_system_score_codex":0.00021611359,"about_ca_system_score_gemma":0.00077786174,"threshold_uncertainty_score":0.99991256},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005129202,0.0003721077,0.9898176,0.0033863457,0.001915502,0.0003657314,0.0000044060507,0.00018315423,0.0034421978],"genre_scores_gemma":[0.15513341,0.000031337193,0.83496803,0.0055771875,0.0012929242,0.000011180748,0.000008142744,0.000033601213,0.002944181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961898,0.000026218258,0.00049236696,0.0015332825,0.0011628743,0.00059548055],"domain_scores_gemma":[0.9978834,0.0003614394,0.00018053812,0.00097236707,0.0003310638,0.00027119066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008100993,0.00046816943,0.00042074572,0.0011117489,0.00029379432,0.00077021087,0.0027301472,0.00022832201,0.0000532397],"category_scores_gemma":[0.00009828773,0.00045887753,0.00012070654,0.0010532973,0.00020840403,0.0007498588,0.0012181974,0.0004953198,0.00028851937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026580374,0.000014212308,0.000009719629,0.000008860882,0.0000049724827,0.000018448229,0.0004377134,0.43112203,0.00013866933,0.011666879,0.00013146603,0.55644435],"study_design_scores_gemma":[0.00027369848,0.0002694971,0.00041063217,0.00027711352,0.000008244027,0.000079370715,1.19042085e-7,0.8380027,0.0031920876,0.10161501,0.054722793,0.0011487269],"about_ca_topic_score_codex":0.000013476357,"about_ca_topic_score_gemma":0.00006943127,"teacher_disagreement_score":0.55529565,"about_ca_system_score_codex":0.00030557418,"about_ca_system_score_gemma":0.00056860124,"threshold_uncertainty_score":0.9997863},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014584354,0.0004904451,0.99517494,0.00015209314,0.0028472368,0.0007407743,0.000048285056,0.0002544833,0.0001459216],"genre_scores_gemma":[0.0073907753,0.00002021657,0.9910739,0.0008715534,0.00048321445,0.000021790307,0.000010674357,0.00006202338,0.000065827524],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949478,0.000061447354,0.00070169766,0.0020646837,0.0010935882,0.0011308078],"domain_scores_gemma":[0.9968438,0.00063909066,0.00045410098,0.0014245168,0.00036524332,0.00027324626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026530183,0.0008009283,0.0007863881,0.0008928267,0.00096023857,0.0010280097,0.0038418327,0.00059760624,0.0000076140864],"category_scores_gemma":[0.00008369388,0.00075458403,0.00032472407,0.00069351285,0.0008487841,0.0009900986,0.0011139472,0.001539491,0.000004208995],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058103897,0.000055754965,0.000002834795,0.00008198664,0.000031069823,0.000035473506,0.0012121461,0.004472139,0.016579902,0.013011133,0.000004978538,0.96450675],"study_design_scores_gemma":[0.00023855617,0.00007194505,9.849905e-7,0.00024243852,0.0000142040135,0.0000674639,3.7841212e-7,0.41714782,0.02673991,0.55448776,0.00029036377,0.0006981956],"about_ca_topic_score_codex":0.000035380173,"about_ca_topic_score_gemma":0.000056031597,"teacher_disagreement_score":0.9638086,"about_ca_system_score_codex":0.00015320371,"about_ca_system_score_gemma":0.00041112365,"threshold_uncertainty_score":0.9994905},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006085218,0.00006160159,0.99580455,0.0000059714557,0.00086625316,0.00013801148,0.000005524142,0.000040168645,0.0024694114],"genre_scores_gemma":[0.23943505,0.000049482882,0.76028246,0.000042757078,0.00008313507,0.0000014058402,0.000004988595,0.000039907467,0.00006080615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883914,0.0000045299707,0.0003994214,0.00024063325,0.00031320888,0.00020305418],"domain_scores_gemma":[0.9992359,0.000057458747,0.00014719613,0.00042426854,0.00008215088,0.00005299198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020178327,0.00021310749,0.00036688792,0.00032536796,0.000020682319,0.000011556971,0.00044048353,0.00012337843,0.000025430543],"category_scores_gemma":[0.000019681836,0.00020219861,0.00007496011,0.000119083634,0.00022506197,0.00007234159,0.00014364015,0.00023805167,0.0000042962056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001631792,0.000007309926,0.000007168492,0.00020811538,0.000009810506,0.0000078611165,0.00016398489,0.9562577,0.00052260316,0.021716977,0.0000061468454,0.021090662],"study_design_scores_gemma":[0.00007173234,0.000050293045,0.000009529407,0.00028890045,0.00001212372,0.000012709805,8.073009e-8,0.89854586,0.0027996795,0.09802569,0.000012725983,0.00017069106],"about_ca_topic_score_codex":0.000013545074,"about_ca_topic_score_gemma":0.00002663157,"teacher_disagreement_score":0.23882653,"about_ca_system_score_codex":0.00007795836,"about_ca_system_score_gemma":0.00006089675,"threshold_uncertainty_score":0.82454205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010234865,0.0012428401,0.9945213,0.0011212354,0.0009083421,0.0004037679,0.0000025040872,0.00016613881,0.00061038684],"genre_scores_gemma":[0.31001016,0.000018029403,0.6884978,0.0012321688,0.0000688532,0.00001019595,0.0000017351679,0.000020945663,0.00014012851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737114,0.00007709362,0.00046788523,0.0008071566,0.0009140779,0.00036262025],"domain_scores_gemma":[0.99797106,0.00030455447,0.0003740779,0.0011513018,0.00014442495,0.000054588818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076699565,0.00032639626,0.0003582607,0.00041265163,0.00016207677,0.00024084527,0.0020207288,0.0002660216,0.000011711525],"category_scores_gemma":[0.00020139513,0.00023898594,0.00010589558,0.001005149,0.00067326095,0.00048321008,0.00088024465,0.0007582183,0.000003909028],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042187544,0.0000674348,0.00034633256,0.00015309083,0.000008571296,0.00010733756,0.0018910734,0.0050291386,0.0005025058,0.02402003,0.00007066545,0.9677996],"study_design_scores_gemma":[0.00018153618,0.00006538188,0.00049781735,0.0012919836,0.000006359523,0.00017640468,1.8905406e-7,0.6206818,0.0053805215,0.37116098,0.00015397805,0.00040302737],"about_ca_topic_score_codex":0.000029754787,"about_ca_topic_score_gemma":0.000045371162,"teacher_disagreement_score":0.96739656,"about_ca_system_score_codex":0.00032376667,"about_ca_system_score_gemma":0.00048297294,"threshold_uncertainty_score":0.9745564},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000731168,0.00015323331,0.9954793,0.00033436768,0.00007624669,0.00043252832,0.00012586638,0.0001658935,0.0031594485],"genre_scores_gemma":[0.017846046,0.00004465586,0.97995573,0.00041449166,0.00068482093,0.000101294274,0.00009516745,0.000058315356,0.0007994686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977242,0.000003199969,0.0003079489,0.0010502294,0.0004421837,0.00047223826],"domain_scores_gemma":[0.9984196,0.00021119874,0.00014343004,0.0009739686,0.00014038572,0.00011145629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003428413,0.0003408186,0.00028152773,0.000352922,0.00022497957,0.00012012153,0.00088268716,0.00025589418,0.00011328592],"category_scores_gemma":[0.00002991049,0.00035248272,0.0001109375,0.0002119012,0.00024041158,0.00018819823,0.0002681338,0.00073048123,0.0000061777628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087873545,0.00004782556,0.000019422385,0.00026411063,0.000014376543,0.0000067069395,0.00003557545,0.09623725,0.18499337,0.0076323133,0.000042930016,0.71061826],"study_design_scores_gemma":[0.00021229974,0.00003196218,7.541372e-7,0.00025970186,0.000010840686,0.0000042696342,8.6821856e-8,0.82361776,0.10676342,0.06812555,0.0005960848,0.00037728282],"about_ca_topic_score_codex":0.0000060861644,"about_ca_topic_score_gemma":0.000009130381,"teacher_disagreement_score":0.7273805,"about_ca_system_score_codex":0.0004537635,"about_ca_system_score_gemma":0.00032306297,"threshold_uncertainty_score":0.9998927},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035904633,0.00042514602,0.9750828,0.0005548055,0.0017577689,0.00084258727,0.0000029989958,0.00046996074,0.020504845],"genre_scores_gemma":[0.46621192,0.000027954904,0.53138375,0.00042698998,0.0008201108,0.000037781218,0.000031828902,0.000087140936,0.00097253587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99429655,0.000042099375,0.0005303386,0.0023005262,0.0015967918,0.0012337182],"domain_scores_gemma":[0.9968217,0.00027337123,0.00045119404,0.0015947884,0.00048587716,0.00037305572],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00078072737,0.0008943841,0.00070395466,0.00064444914,0.0006538239,0.0012728415,0.0034877125,0.0004316914,0.000018018753],"category_scores_gemma":[0.00008569635,0.0007077676,0.00021117386,0.0008677555,0.0011925161,0.0010114928,0.0011434011,0.0011879549,0.00009636592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014473607,0.00016009324,0.00021116917,0.0001037128,0.00006492055,0.0004171947,0.0019395272,0.010907865,0.000047065416,0.5726889,0.000027333814,0.4132875],"study_design_scores_gemma":[0.008613517,0.007856129,0.001013718,0.0077743563,0.00016152959,0.0012744467,0.00000610595,0.49071348,0.0055404217,0.46125337,0.008694227,0.0070987106],"about_ca_topic_score_codex":0.00005073917,"about_ca_topic_score_gemma":0.00061895204,"teacher_disagreement_score":0.4798056,"about_ca_system_score_codex":0.00076330436,"about_ca_system_score_gemma":0.0017544864,"threshold_uncertainty_score":0.9997639},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010509773,0.00042291085,0.99760425,0.0001807415,0.00035592896,0.0007500972,0.000004856723,0.00021752625,0.0003586008],"genre_scores_gemma":[0.014621936,0.000058739424,0.9845114,0.00015988425,0.00031480976,0.000014528679,0.000004706445,0.000064808184,0.00024921625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99485147,0.00002546028,0.00039579312,0.0024173274,0.0014420863,0.00086784316],"domain_scores_gemma":[0.99738836,0.00036471555,0.0002581272,0.0014263035,0.00021754789,0.00034496275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036337404,0.00064667675,0.00056377257,0.0008225614,0.00034392384,0.00083394017,0.0022205806,0.00026722963,0.0000035597511],"category_scores_gemma":[0.00007902767,0.0005760062,0.0000733646,0.0007622688,0.0008594554,0.0010582687,0.0024341205,0.00094264577,0.0000057390585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011575158,0.00003120789,0.00016490399,0.000052852676,0.000020099775,0.000056192042,0.0012415522,0.2858587,0.0003683842,0.00021748677,5.826607e-7,0.71197647],"study_design_scores_gemma":[0.001050493,0.0002465701,0.0016562747,0.0003713059,0.000005983858,0.00052523543,0.000001617923,0.98088765,0.0013657681,0.013142261,0.000024629064,0.0007222107],"about_ca_topic_score_codex":0.00026728917,"about_ca_topic_score_gemma":0.00006472266,"teacher_disagreement_score":0.71125424,"about_ca_system_score_codex":0.0005062191,"about_ca_system_score_gemma":0.0007804301,"threshold_uncertainty_score":0.99966913},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043548886,0.00014486027,0.98752844,0.0028614723,0.0017964136,0.00047819913,0.0000073325996,0.000038272967,0.0027900918],"genre_scores_gemma":[0.97424215,0.000012932616,0.022795511,0.0020824117,0.00023355456,0.000010884469,0.0000018453594,0.000015236011,0.0006054995],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744624,0.0000650568,0.00036789617,0.00072488724,0.0010943855,0.0003015202],"domain_scores_gemma":[0.99694407,0.0010581037,0.0003116027,0.0013524668,0.00027334833,0.00006039103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046200253,0.00031619763,0.0002643166,0.0003355728,0.000280189,0.00028622278,0.0035342516,0.00014789449,0.00014648939],"category_scores_gemma":[0.00012390352,0.00016767601,0.0001793137,0.0007931723,0.0005587856,0.00025110375,0.0008284803,0.0005580077,0.00004246976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000244698,0.000030867453,0.000021485266,0.000013856795,0.000016952246,0.0000023903963,0.00064633903,0.062117327,0.00024368014,0.46356186,0.00018341844,0.47315937],"study_design_scores_gemma":[0.00009778182,0.000106750034,0.00070648035,0.00015134955,0.0000046938403,0.00001082147,1.3892394e-7,0.31617084,0.0050394963,0.6768333,0.000604531,0.00027380508],"about_ca_topic_score_codex":0.000012124288,"about_ca_topic_score_gemma":0.0000182648,"teacher_disagreement_score":0.96988726,"about_ca_system_score_codex":0.000078786754,"about_ca_system_score_gemma":0.00033715516,"threshold_uncertainty_score":0.6837629},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020623358,0.00015907502,0.9932916,0.00038594002,0.0019406307,0.00056982413,0.000063197374,0.00015645583,0.0034126204],"genre_scores_gemma":[0.054016404,0.000011727623,0.94205314,0.0010246247,0.0011566642,0.00004022873,0.00004818498,0.00005660223,0.0015924497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996494,0.00003222629,0.00045529922,0.0015754903,0.0007427187,0.00070028],"domain_scores_gemma":[0.99749815,0.0006013678,0.00023192966,0.0012483636,0.00026409616,0.0001560689],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063279533,0.0004845885,0.00043824335,0.00080979685,0.00048452677,0.0007137996,0.0029331974,0.00025325437,0.000014884052],"category_scores_gemma":[0.00004306229,0.00042063324,0.00017803123,0.00039695023,0.00043952442,0.00097192934,0.0020089466,0.00077364047,0.000034790504],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015336589,0.000037112513,0.000013616719,0.000036314894,0.00001731965,0.000040235027,0.00094719173,0.04092916,0.00010914011,0.017886955,0.0011868303,0.9387808],"study_design_scores_gemma":[0.00028129722,0.00025404658,0.000054672644,0.00037445326,0.0000066547123,0.00005271241,4.7634325e-7,0.8983258,0.00034042582,0.091387056,0.008366094,0.00055633223],"about_ca_topic_score_codex":0.00009072119,"about_ca_topic_score_gemma":0.00012975589,"teacher_disagreement_score":0.93822443,"about_ca_system_score_codex":0.0002757264,"about_ca_system_score_gemma":0.0003536215,"threshold_uncertainty_score":0.9998245},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008563199,0.00030047732,0.99543005,0.0004836276,0.00084140734,0.00030596563,0.000049376482,0.00015598933,0.0015767604],"genre_scores_gemma":[0.87408847,0.000036011625,0.12379339,0.001720201,0.00030118864,0.0000030050649,0.000028083472,0.000022614362,0.000007016979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644613,0.00003499457,0.00047271344,0.0015704348,0.00088268623,0.00059301365],"domain_scores_gemma":[0.9981542,0.0004915974,0.00011238075,0.00090462784,0.00012681511,0.00021032787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006505312,0.0005249671,0.0004891261,0.00085865636,0.00033719977,0.000674405,0.0020240247,0.00026950781,0.00003350734],"category_scores_gemma":[0.000033129476,0.00049411313,0.00015037472,0.00043207212,0.0009574289,0.0006166409,0.0008120234,0.0009538942,0.00001911308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075162243,0.000049642196,0.0000491931,0.000042514104,0.00001546895,0.000090312285,0.0009153342,0.010190431,0.000027422087,0.7660505,0.000011507367,0.22255015],"study_design_scores_gemma":[0.0008037727,0.00054378866,0.0011042807,0.0010169012,0.00001294445,0.00015694022,4.1843938e-7,0.120490335,0.0006009179,0.8736416,0.0006154809,0.0010126142],"about_ca_topic_score_codex":0.000022334905,"about_ca_topic_score_gemma":0.000052476178,"teacher_disagreement_score":0.8732322,"about_ca_system_score_codex":0.00017409962,"about_ca_system_score_gemma":0.000315653,"threshold_uncertainty_score":0.99975103},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031841628,0.0010609335,0.9921004,0.00023421705,0.001084905,0.0005005422,0.000014941529,0.0006267746,0.004345444],"genre_scores_gemma":[0.14905135,0.00054134044,0.8478886,0.0014657594,0.0007928125,0.000018183426,0.000007664764,0.0000681682,0.00016609783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518967,0.000049240552,0.0006414063,0.0021939548,0.0011561073,0.00076964323],"domain_scores_gemma":[0.996645,0.000522003,0.00042757863,0.0017400213,0.00043310065,0.00023231051],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039264007,0.00075489946,0.00070130714,0.00079094095,0.00038597526,0.00046473127,0.0032863063,0.0004474659,0.000052820644],"category_scores_gemma":[0.00015801228,0.0007072385,0.00023658594,0.00082380115,0.0008503074,0.0018518447,0.0017226222,0.0013287906,0.00011364145],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014865412,0.000032831143,0.0000039563374,0.000006682668,0.000011759155,0.00023083214,0.00035849647,0.000331872,0.0015421739,0.000991984,0.00002847029,0.9964461],"study_design_scores_gemma":[0.00041291057,0.00087756314,0.00017631474,0.00042148045,0.000014443663,0.00018543137,3.3564257e-7,0.54944116,0.115519725,0.3288682,0.0026671926,0.0014152165],"about_ca_topic_score_codex":0.00005298612,"about_ca_topic_score_gemma":0.000038413316,"teacher_disagreement_score":0.9950309,"about_ca_system_score_codex":0.00051447016,"about_ca_system_score_gemma":0.00042437992,"threshold_uncertainty_score":0.9995379},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014429537,0.00041213937,0.9810517,0.000010119241,0.0020028248,0.00046696054,0.000006303824,0.00020157795,0.0014188373],"genre_scores_gemma":[0.9777725,0.000011008869,0.02143204,0.000044968492,0.0005385891,0.000007928638,0.00012494021,0.0000442387,0.000023835577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830294,0.000026246511,0.0005199852,0.00041212517,0.00044305262,0.00029565734],"domain_scores_gemma":[0.9992656,0.00014531931,0.00012872212,0.0002366734,0.00015693315,0.00006674274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006006583,0.00029170496,0.0002826952,0.0008920648,0.000084963816,0.00016166469,0.00024344672,0.00032499043,0.000030370675],"category_scores_gemma":[0.000018462788,0.00032021067,0.000045272714,0.00036004742,0.00011440902,0.000352834,0.000054635377,0.00042736033,0.00003473615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005313117,0.00001601668,0.00010549592,0.0003147766,0.000005492246,0.000020373709,0.00083547126,0.38224038,0.0013236578,0.00040705554,0.0000036340055,0.6147223],"study_design_scores_gemma":[0.00024470474,0.00003076002,0.0003425332,0.0016414197,0.000010319333,0.000023485423,5.061112e-7,0.9900245,0.0015749834,0.0057384623,0.00003718837,0.0003311465],"about_ca_topic_score_codex":0.0001523364,"about_ca_topic_score_gemma":0.00030027877,"teacher_disagreement_score":0.9633429,"about_ca_system_score_codex":0.0008634552,"about_ca_system_score_gemma":0.00010661323,"threshold_uncertainty_score":0.999925},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006905278,0.0004342835,0.99488354,0.0008067665,0.00095027476,0.0013086091,0.000008020279,0.0001905155,0.0013489213],"genre_scores_gemma":[0.2765781,0.000014011992,0.72107434,0.00033769643,0.00086975953,0.00004582136,0.000018729339,0.0000781254,0.0009834113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954297,0.000035830402,0.0008453367,0.0017335507,0.001064511,0.0008910916],"domain_scores_gemma":[0.99518305,0.001878851,0.00082412356,0.0014766036,0.0004282028,0.00020915063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092716224,0.00066078844,0.000735275,0.0007796432,0.00028026133,0.00053246156,0.00277509,0.0004591973,0.0000068792087],"category_scores_gemma":[0.00021169224,0.00062218646,0.00025380313,0.0011551866,0.00081865286,0.0008777282,0.00084515405,0.00081147003,0.0000056969907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002842102,0.0001263237,0.00036152828,0.00015286935,0.00002386901,0.000041148192,0.0006495833,0.19888213,0.0003971872,0.05480445,0.0003106974,0.7442218],"study_design_scores_gemma":[0.0005091257,0.00034013033,0.00022650367,0.00060709997,0.000020928777,0.000049722552,2.6373303e-7,0.8052138,0.0014088037,0.18822756,0.0027426097,0.0006534473],"about_ca_topic_score_codex":0.00022332593,"about_ca_topic_score_gemma":0.00056463905,"teacher_disagreement_score":0.74356836,"about_ca_system_score_codex":0.00025086736,"about_ca_system_score_gemma":0.0009929235,"threshold_uncertainty_score":0.99962294},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027544473,0.0010642909,0.99589163,0.00010941845,0.0011060497,0.0009299809,0.00003665384,0.00045315587,0.00013338814],"genre_scores_gemma":[0.07127434,0.000027155847,0.9275261,0.0005089771,0.0005005207,0.000038290924,0.000038208298,0.000058298563,0.00002807065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944318,0.000034876226,0.000961089,0.0020914814,0.0014239693,0.0010567977],"domain_scores_gemma":[0.9958817,0.0004151471,0.0005176199,0.0023984055,0.0005122952,0.0002748759],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015156947,0.0007447866,0.0007054604,0.0008678244,0.0008464466,0.0005733285,0.0035547588,0.00060540484,0.000009207905],"category_scores_gemma":[0.00003243735,0.0006981786,0.00028813622,0.001259852,0.0007233587,0.00072026835,0.0010332164,0.0010776999,0.00003359811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073796273,0.00004308103,0.00034029377,0.00017048491,0.000009062613,0.000030707954,0.0003065621,0.7849647,0.00008215823,0.0028406945,0.0000068486224,0.21119803],"study_design_scores_gemma":[0.00035871397,0.000049399776,0.000061785235,0.0008456109,0.000009565864,0.0000539821,5.9973047e-7,0.9591893,0.0006504762,0.033941545,0.003891178,0.0009478714],"about_ca_topic_score_codex":0.000014720238,"about_ca_topic_score_gemma":0.00002268791,"teacher_disagreement_score":0.21025017,"about_ca_system_score_codex":0.0012458023,"about_ca_system_score_gemma":0.0011693202,"threshold_uncertainty_score":0.99954695},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007164795,0.00023073959,0.9923885,0.0022187356,0.0020581477,0.00037257985,0.0000028167346,0.0001633027,0.0024935242],"genre_scores_gemma":[0.1762638,0.00003895398,0.818882,0.0039053329,0.000509219,0.000004844295,0.0000031875838,0.000026854048,0.00036585185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965846,0.000063803,0.0004884885,0.0011305774,0.0012176097,0.0005149295],"domain_scores_gemma":[0.99734384,0.00056736165,0.00023650558,0.0014131141,0.00028146018,0.00015770532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010252446,0.00041338388,0.00033079137,0.0005083421,0.00049246184,0.00075994467,0.0026301374,0.00030125823,0.000034230437],"category_scores_gemma":[0.00016013265,0.00030811448,0.00011046017,0.00095418,0.00075774395,0.000122618,0.0007199596,0.0012344269,0.000060124486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014106989,0.000009720675,0.00001178611,0.0000048792044,0.0000031466259,0.000019641424,0.0005464452,0.5739968,0.0000068143436,0.04971795,0.000008417381,0.37567303],"study_design_scores_gemma":[0.00008508987,0.00007431779,0.00025688822,0.00014789417,0.000005396037,0.00007221355,3.1274683e-7,0.93358064,0.00012926068,0.06495066,0.00033260026,0.00036469873],"about_ca_topic_score_codex":0.000008945879,"about_ca_topic_score_gemma":0.000023258168,"teacher_disagreement_score":0.37530833,"about_ca_system_score_codex":0.000265953,"about_ca_system_score_gemma":0.00069787557,"threshold_uncertainty_score":0.9999371},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007990715,0.00011897848,0.9427695,0.0020906199,0.00034845422,0.0020392567,0.000029472998,0.00009746315,0.052498225],"genre_scores_gemma":[0.69665045,0.0000086591235,0.2963928,0.0034616878,0.001341484,0.00077096693,0.000020578529,0.000047122656,0.0013062919],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99713576,0.000026173773,0.0003179941,0.0010205526,0.0008718235,0.0006277051],"domain_scores_gemma":[0.99843246,0.0003676842,0.0001688936,0.0005394269,0.00021867931,0.00027285577],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078582944,0.00031158232,0.0003658848,0.00040236377,0.0007949253,0.0004091447,0.0015907902,0.0003190419,0.000034951838],"category_scores_gemma":[0.00007580539,0.0002868231,0.00014246345,0.0004502934,0.00077359506,0.0001705288,0.0001747729,0.00033599965,0.00003144359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024867904,0.00015924628,0.00010119976,0.000049315084,0.00001712175,0.000002502673,0.0015021139,0.07016102,0.00010439744,0.3778395,0.000065727625,0.549973],"study_design_scores_gemma":[0.0015337539,0.00028804573,0.00021552539,0.0003046801,0.00006561735,0.0000019198174,0.000011008818,0.07103197,0.00027550812,0.4354191,0.489296,0.0015568874],"about_ca_topic_score_codex":0.0001691066,"about_ca_topic_score_gemma":0.00062295527,"teacher_disagreement_score":0.69664246,"about_ca_system_score_codex":0.00069186673,"about_ca_system_score_gemma":0.001975792,"threshold_uncertainty_score":0.9999584},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015183179,0.0009853133,0.9889373,0.0021823037,0.0010030669,0.0001542846,7.169818e-7,0.00029359464,0.0062915585],"genre_scores_gemma":[0.14811742,0.00026719004,0.8410378,0.0025465467,0.0015092638,0.000006621602,0.000004395039,0.00007302905,0.006437722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645156,0.000057597375,0.00039701923,0.001592325,0.00080974324,0.00069176214],"domain_scores_gemma":[0.99828994,0.0004467308,0.00024782348,0.0006763204,0.0001210995,0.00021810508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009077156,0.0005181007,0.000484281,0.000686467,0.00048763127,0.0008659538,0.0016799822,0.00029989542,0.000029753148],"category_scores_gemma":[0.00009562846,0.00047312846,0.00009539134,0.00037150737,0.0005271925,0.0005132417,0.0014585927,0.0018094594,0.000053898842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001407494,0.00000856502,0.0001683,0.000020542855,0.000007625863,0.00003991328,0.00046247055,0.039294444,0.000057919195,0.009724664,0.000008910671,0.9502052],"study_design_scores_gemma":[0.00028144688,0.0001843167,0.0005629858,0.00033358877,0.0000073275155,0.00016455936,3.6369983e-7,0.94038653,0.00012108574,0.042741053,0.01444422,0.00077250245],"about_ca_topic_score_codex":0.000017285794,"about_ca_topic_score_gemma":0.000021872223,"teacher_disagreement_score":0.94943273,"about_ca_system_score_codex":0.00017722543,"about_ca_system_score_gemma":0.0002612363,"threshold_uncertainty_score":0.999772},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009273075,0.00041277113,0.9874985,0.005784099,0.0011790551,0.0013448626,0.000050597468,0.0010030161,0.002634343],"genre_scores_gemma":[0.072122335,0.00007712798,0.92532545,0.0019297176,0.0002466141,0.000049672053,0.000028936032,0.000062734376,0.00015739325],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922992,0.000044115626,0.00088750484,0.0033983353,0.0016880728,0.0016827658],"domain_scores_gemma":[0.98144835,0.0028600986,0.0007170703,0.013862175,0.00081874884,0.00029354688],"candidate_categories":["metaresearch","metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0018571521,0.0011672816,0.0010480519,0.0013998069,0.00048081856,0.0010092028,0.058913216,0.0010952941,0.000025915635],"category_scores_gemma":[0.012572377,0.00095346745,0.00018032614,0.0014699979,0.0021414694,0.0015745538,0.06664021,0.0022188325,0.000041629643],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008458467,0.0001559493,0.001171248,0.00034382162,0.00007724256,0.00047214236,0.00059305003,0.0073554716,0.0001585891,0.088282086,0.0019238748,0.89938194],"study_design_scores_gemma":[0.0005339278,0.00046014242,0.00021069655,0.00067759014,0.00001742405,0.00008541666,3.122288e-7,0.25730735,0.0013189947,0.7350598,0.002998922,0.0013294461],"about_ca_topic_score_codex":0.000055109125,"about_ca_topic_score_gemma":0.00029201314,"teacher_disagreement_score":0.8980525,"about_ca_system_score_codex":0.0006573647,"about_ca_system_score_gemma":0.001459207,"threshold_uncertainty_score":0.9992916},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012474398,0.00012988722,0.98551035,0.00015931585,0.000067762725,0.0009484586,0.00016161053,0.00003733119,0.0005108705],"genre_scores_gemma":[0.5055926,0.00006050969,0.49383026,0.000028075876,0.000047003734,0.000018066361,0.0002090846,0.000015882555,0.0001985321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840885,0.0000070501014,0.0003124598,0.00048554182,0.0006114646,0.00017463863],"domain_scores_gemma":[0.99868685,0.00010706307,0.00036132926,0.00037017983,0.0004200348,0.00005452298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019053098,0.00022591428,0.00043688866,0.00015492763,0.00009883545,0.000020197242,0.00016442711,0.00009355632,0.000016075444],"category_scores_gemma":[0.0000028010008,0.00017030415,0.00007050381,0.00013608136,0.00027825424,0.00028017582,0.00006189324,0.00024636416,4.4984765e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018383148,0.00010234288,0.00028915342,0.000057512512,0.000019091103,0.0000018891523,0.000054401607,0.9329343,0.038926993,0.0006060265,0.000013889066,0.026810605],"study_design_scores_gemma":[0.00053191965,0.00052955805,0.0025237247,0.00049040053,0.00008147599,0.000024989626,9.455365e-7,0.98288125,0.008372229,0.0040136534,0.0003565069,0.00019332129],"about_ca_topic_score_codex":0.00004794692,"about_ca_topic_score_gemma":0.000027886585,"teacher_disagreement_score":0.4931182,"about_ca_system_score_codex":0.00025764195,"about_ca_system_score_gemma":0.00029297345,"threshold_uncertainty_score":0.6944802},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010542601,0.00061192195,0.99749804,0.00006650232,0.00080659706,0.0006560325,0.000086169384,0.00008011837,0.0001841067],"genre_scores_gemma":[0.01609461,0.000037412414,0.98316467,0.00016122547,0.00036430915,0.000022701346,0.00008744331,0.000025311818,0.00004233017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671465,0.000023749388,0.00061744876,0.0014231025,0.0007873455,0.00043370004],"domain_scores_gemma":[0.9953653,0.0005030031,0.00036993646,0.0034450619,0.00022128686,0.00009538601],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009423163,0.0003820783,0.00045956476,0.00025051666,0.00049164135,0.00011555858,0.0059009925,0.00014085836,0.000002425999],"category_scores_gemma":[0.00008081906,0.00025957436,0.000059051577,0.00023536642,0.0007243393,0.0009434529,0.002256381,0.0003050417,0.0000021437854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008673454,0.000041114887,0.000018513048,0.000076710574,0.000017206166,0.000005015285,0.0020453678,0.025248982,0.00006424959,0.0058225747,0.000032796834,0.9666188],"study_design_scores_gemma":[0.00024685933,0.00012954949,0.00009793587,0.00016399514,0.00000758305,0.00004794366,0.0000012646609,0.95659256,0.0016985914,0.0012802747,0.039161857,0.0005715865],"about_ca_topic_score_codex":0.00005398906,"about_ca_topic_score_gemma":0.00028167688,"teacher_disagreement_score":0.9660472,"about_ca_system_score_codex":0.00008803023,"about_ca_system_score_gemma":0.0010659081,"threshold_uncertainty_score":0.99998564},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018969803,0.00014967872,0.9952699,0.001234425,0.0006587178,0.00034397168,0.0000063518323,0.00013375646,0.0003062217],"genre_scores_gemma":[0.65823895,0.00007402216,0.34101874,0.0003767794,0.00020440794,0.000011472423,0.0000043915106,0.000022638762,0.00004861041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725735,0.00008018151,0.00034641,0.0008276248,0.0011055316,0.00038291587],"domain_scores_gemma":[0.9971688,0.0012247794,0.0002188392,0.0010840473,0.00022283895,0.00008071449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017885463,0.00032638904,0.00029680366,0.00096198113,0.000109956134,0.00067465706,0.002838525,0.00024344206,0.000014010667],"category_scores_gemma":[0.0002136279,0.00024131339,0.00007797082,0.00061527546,0.00037390826,0.0019598822,0.0005870933,0.000912371,0.0000019562376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041967985,0.000075214775,0.0002664147,0.00007554922,0.000019443929,0.000073850344,0.0025997101,0.123962276,0.0016456569,0.39119977,0.00005525097,0.47998488],"study_design_scores_gemma":[0.00038065336,0.000745232,0.00061556435,0.0009832773,0.000007958393,0.000042478474,0.0000064082014,0.61915696,0.013410807,0.3596308,0.004005984,0.0010139124],"about_ca_topic_score_codex":0.000017699507,"about_ca_topic_score_gemma":0.00006544893,"teacher_disagreement_score":0.65634197,"about_ca_system_score_codex":0.0001408103,"about_ca_system_score_gemma":0.00025965748,"threshold_uncertainty_score":0.9840475},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005141327,0.0004135656,0.982974,0.00006330224,0.0012759971,0.0002984401,0.0000082365095,0.00013473928,0.014317618],"genre_scores_gemma":[0.88891596,0.000048756825,0.11020459,0.00042810035,0.00019735827,0.000009918116,0.000007817915,0.000032890086,0.00015464064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960158,0.00006156731,0.00073476165,0.0013911963,0.0011536508,0.00064303016],"domain_scores_gemma":[0.9961776,0.0007646236,0.0004681752,0.002055657,0.00034043757,0.00019347917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002491107,0.0005052327,0.0009061443,0.0032273238,0.00018886995,0.000372337,0.0036035033,0.00031864605,0.000070389426],"category_scores_gemma":[0.000029473455,0.00044279988,0.0005382797,0.00476353,0.001241124,0.0003589569,0.00085987005,0.00058349647,0.00002030192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026261754,0.00004342105,0.00039382043,0.000060882317,0.00019951536,0.000064309614,0.0006677288,0.034279276,0.000036385267,0.9009479,0.000005354387,0.06327512],"study_design_scores_gemma":[0.0005202179,0.00017833526,0.00021958434,0.00048105168,0.0003471087,0.00005675133,7.405923e-7,0.41801608,0.0008449911,0.57783663,0.00047962577,0.0010188681],"about_ca_topic_score_codex":0.000053297168,"about_ca_topic_score_gemma":0.000056510708,"teacher_disagreement_score":0.8884018,"about_ca_system_score_codex":0.000100662386,"about_ca_system_score_gemma":0.00021305072,"threshold_uncertainty_score":0.99980235},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007496602,0.00033851922,0.9986666,0.00013611841,0.0002167364,0.000423998,0.000013371253,0.0000310147,0.00009866757],"genre_scores_gemma":[0.23421273,0.00006140834,0.7634443,0.0009806708,0.00051946804,0.000014170216,0.000053319127,0.000055250137,0.00065867114],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978841,0.000028909379,0.00026770268,0.001025513,0.00032964256,0.0004641085],"domain_scores_gemma":[0.99888116,0.00010040583,0.00010328319,0.0005728981,0.00024166823,0.000100587524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005907685,0.0003559539,0.0003239197,0.00023816849,0.00015433466,0.0000725894,0.00053348124,0.00040618723,0.0000017038656],"category_scores_gemma":[0.00007681742,0.0003077185,0.0001484801,0.00016536962,0.00081759004,0.0000052855607,0.00020190894,0.00028025298,0.0000019543154],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075473166,0.000035020865,0.0000021807705,0.00002764996,0.00004421265,0.000013816028,0.000030308183,0.056826636,0.032860138,0.00013942891,0.0001283131,0.9098168],"study_design_scores_gemma":[0.0005932813,0.0013412089,0.0000059289573,0.0003149862,0.00006880664,0.0001172417,8.206912e-7,0.21245189,0.7457097,0.033241373,0.0046871505,0.0014676045],"about_ca_topic_score_codex":0.0000025091856,"about_ca_topic_score_gemma":0.000015136115,"teacher_disagreement_score":0.9083492,"about_ca_system_score_codex":0.00008823926,"about_ca_system_score_gemma":0.00025059204,"threshold_uncertainty_score":0.9999375},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003053839,0.000020784113,0.99236465,0.001127511,0.00047520403,0.00054832734,0.000011644457,0.0000233248,0.002374731],"genre_scores_gemma":[0.8874679,0.0000072357275,0.112039655,0.00027611124,0.00009188141,0.000009240103,0.000043851815,0.000015405498,0.000048696154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832374,0.000040126197,0.0005417284,0.00026907297,0.00060614105,0.0002191638],"domain_scores_gemma":[0.99856925,0.0003490835,0.00033964007,0.000452537,0.0002592443,0.000030258469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016866507,0.00020301594,0.0002848482,0.0004183902,0.00009245714,0.00021137352,0.00061334274,0.00016121932,0.000028007045],"category_scores_gemma":[0.00042021513,0.00015176476,0.000044217228,0.00073896546,0.0002035204,0.0011102647,0.00021921084,0.0002579104,0.0000098561395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008981778,0.000039417257,0.00088149734,0.00033620998,0.0000085637985,0.0000021054911,0.007829107,0.6549434,0.00000682582,0.2314723,0.00006408322,0.10440752],"study_design_scores_gemma":[0.0003290614,0.000033422726,0.030525237,0.00064002123,0.000011491194,0.000007568067,0.000003079083,0.06474367,0.0001519643,0.90267533,0.0005255786,0.00035355194],"about_ca_topic_score_codex":0.00044516323,"about_ca_topic_score_gemma":0.00059275667,"teacher_disagreement_score":0.8844141,"about_ca_system_score_codex":0.00028579263,"about_ca_system_score_gemma":0.0002452401,"threshold_uncertainty_score":0.6188787},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009895704,0.00046994817,0.9613221,0.00008891735,0.0011108428,0.00034016962,0.000031173713,0.00052311143,0.035124153],"genre_scores_gemma":[0.53024065,0.0012025895,0.46346775,0.0021060824,0.0018170653,0.000040069397,0.00006155075,0.00029883045,0.0007653906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855727,0.000004225433,0.00032365628,0.000519732,0.00017688645,0.00041822842],"domain_scores_gemma":[0.99917287,0.000109439505,0.000056502675,0.00053789304,0.000026590802,0.000096686534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002479645,0.0003484667,0.00039053318,0.0003218924,0.0000729574,0.00015054712,0.0007347325,0.00033510325,0.0002068933],"category_scores_gemma":[0.000008826336,0.0003662006,0.00008205609,0.0001108871,0.00023077762,0.00012270255,0.0001426649,0.00060491735,0.0000689391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000687969,0.0000056045733,0.000081023994,0.0000858985,0.000021336378,0.00007369956,0.0008402374,0.3155659,0.00004970758,0.0016161891,0.0008171819,0.6808363],"study_design_scores_gemma":[0.00021359915,0.0000773585,0.000031694162,0.00054579164,0.00001278588,0.000092767,2.1098363e-7,0.8780501,0.0012238284,0.04118506,0.07759278,0.0009740151],"about_ca_topic_score_codex":0.000006806592,"about_ca_topic_score_gemma":0.000030511756,"teacher_disagreement_score":0.6798623,"about_ca_system_score_codex":0.00020599515,"about_ca_system_score_gemma":0.00007591297,"threshold_uncertainty_score":0.999879},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067397165,0.00037334277,0.99109674,0.000108352106,0.0007584821,0.00057631993,0.00001240465,0.000065250315,0.000269397],"genre_scores_gemma":[0.84567463,0.000050111,0.15372048,0.00025869362,0.00022133821,0.000007700482,0.000032216976,0.000022265613,0.000012557518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959816,0.00011061269,0.001146154,0.0012552924,0.0008739088,0.00063247106],"domain_scores_gemma":[0.9966374,0.00072385126,0.00085170125,0.0012145498,0.00046088325,0.00011160838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011228902,0.00049553526,0.0009258872,0.0006789868,0.00008977555,0.00014087939,0.0022285373,0.00047860743,0.0000041461076],"category_scores_gemma":[0.000101891084,0.00049126614,0.0001307356,0.0013981762,0.0005001128,0.00038496839,0.00068753166,0.0008089681,0.0000012454569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008110547,0.000038061346,0.00007932578,0.000027903176,0.0000071892064,0.000045960685,0.0002473103,0.51182723,0.0016532271,0.0048067444,0.000009777027,0.48124915],"study_design_scores_gemma":[0.00046676825,0.0001863265,0.0008626684,0.000689176,0.0000068097065,0.000021749962,2.4120078e-7,0.98823905,0.0023498968,0.006725781,0.000020313772,0.00043119676],"about_ca_topic_score_codex":0.00004917655,"about_ca_topic_score_gemma":0.00016975126,"teacher_disagreement_score":0.8389349,"about_ca_system_score_codex":0.00026194012,"about_ca_system_score_gemma":0.0003656807,"threshold_uncertainty_score":0.9997539},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06803807,0.0051833633,0.8859084,0.0010263411,0.003133867,0.00079482084,0.00014510458,0.00010305588,0.035666976],"genre_scores_gemma":[0.9925851,0.0004120889,0.004446991,0.0014573298,0.000297145,0.0000021289336,0.000023756726,0.00003672522,0.000738709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977634,0.0000033029503,0.0007150904,0.00090722844,0.00013124227,0.0004797552],"domain_scores_gemma":[0.9988878,0.00010421188,0.00037599655,0.00045727222,0.000088690496,0.00008606898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038909088,0.00033110759,0.0006086694,0.00088365097,0.00016366642,0.00014041793,0.00052051945,0.0003052658,0.0002963771],"category_scores_gemma":[0.000035304824,0.000364224,0.00011746339,0.00032414123,0.0003328565,0.00021056639,0.00019139201,0.000651345,0.00015230683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011675172,0.000022500177,0.008848981,0.000016335209,0.00001596633,0.00015052334,0.00084139185,0.9768071,0.0000020935247,0.005774877,0.000087039734,0.0074215084],"study_design_scores_gemma":[0.00038144668,0.000086145665,0.006805592,0.00020678976,0.0000034214193,0.000033691187,2.8209493e-7,0.9651331,0.000042086707,0.018658152,0.007992902,0.0006564274],"about_ca_topic_score_codex":0.00023318367,"about_ca_topic_score_gemma":0.000115672636,"teacher_disagreement_score":0.9245471,"about_ca_system_score_codex":0.00030002336,"about_ca_system_score_gemma":0.00011032783,"threshold_uncertainty_score":0.99988097},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005607276,0.00032648857,0.99146473,0.00020820396,0.0018744085,0.000650476,0.0000023650878,0.00022535438,0.0046872604],"genre_scores_gemma":[0.65678203,0.000014199068,0.33912188,0.002906185,0.00062345667,0.000019034309,0.000022956538,0.00007127796,0.00043900975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930186,0.00009805003,0.0010398874,0.002593597,0.0016380252,0.0016118265],"domain_scores_gemma":[0.9964933,0.00068421726,0.00042139954,0.0017523742,0.00028366654,0.00036504047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021146578,0.00079177256,0.00080418185,0.0011980773,0.00031933616,0.0006928296,0.0045785694,0.0003984801,0.000004641599],"category_scores_gemma":[0.00014130029,0.00081192807,0.00013083023,0.0025903077,0.00041617893,0.00041579816,0.0018576175,0.0012746825,0.000044082954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006076141,0.000073927426,0.00007918631,0.0000142171075,0.000007860673,0.00007017465,0.00034002654,0.8087539,0.000012191255,0.008480766,0.00015713034,0.18200453],"study_design_scores_gemma":[0.00031759107,0.000116251584,0.00032680083,0.00075458107,0.0000059555196,0.00007974359,2.7656705e-7,0.99457765,0.00012415784,0.002087327,0.0007280328,0.0008816271],"about_ca_topic_score_codex":0.00008398561,"about_ca_topic_score_gemma":0.00013782884,"teacher_disagreement_score":0.6562213,"about_ca_system_score_codex":0.0007795834,"about_ca_system_score_gemma":0.00039852326,"threshold_uncertainty_score":0.99943316},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008870627,0.00014548001,0.9955779,0.00029574017,0.0012053018,0.00070575,0.000028493707,0.000821645,0.0012108316],"genre_scores_gemma":[0.009261947,0.00063555164,0.9836045,0.0027708965,0.0017352217,0.00003766883,0.00069087575,0.00018276159,0.0010806095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99405295,0.0000471652,0.000979748,0.0023651223,0.0017639631,0.00079102616],"domain_scores_gemma":[0.9953308,0.0004902686,0.00045949864,0.0027086106,0.0006856831,0.00032512992],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0031450167,0.00060584105,0.00066610315,0.0014696149,0.000381264,0.0009786023,0.0076097175,0.0006351162,0.000067368666],"category_scores_gemma":[0.0002778719,0.0006118923,0.00012577459,0.0012693584,0.00044065967,0.001089042,0.004004938,0.0005226472,0.000019204106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014113876,0.000084682295,0.000055613436,0.00012756987,0.00003534505,0.00008368852,0.00045870937,0.0007749309,0.00015014589,0.2563426,0.0011981583,0.7406745],"study_design_scores_gemma":[0.00025511414,0.0001780344,0.000034052693,0.00041342966,0.000008540111,0.000039582097,5.2714494e-8,0.9463091,0.00068280107,0.039610356,0.011797466,0.00067147036],"about_ca_topic_score_codex":0.00004430076,"about_ca_topic_score_gemma":0.000072886374,"teacher_disagreement_score":0.94553417,"about_ca_system_score_codex":0.00022250011,"about_ca_system_score_gemma":0.0009586384,"threshold_uncertainty_score":0.99963325},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023177436,0.00028620454,0.98802716,0.0015499117,0.0049998653,0.0007366516,0.000009813767,0.00040027013,0.0016724122],"genre_scores_gemma":[0.17191684,0.000020380754,0.8200459,0.0048510903,0.0021202664,0.00002869296,0.0000060861207,0.00012967718,0.00088105764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939206,0.00003839211,0.0007695616,0.002644521,0.0012378903,0.0013890375],"domain_scores_gemma":[0.99536157,0.00145121,0.0005524205,0.0019161204,0.0003637052,0.00035497866],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015224766,0.00091951294,0.0008188107,0.0011237634,0.0011204617,0.0012412813,0.0050874413,0.00073706417,0.000037068105],"category_scores_gemma":[0.00044345175,0.0008414191,0.00038890258,0.00073750044,0.000631015,0.00045265988,0.0020408405,0.0023391617,0.000108416265],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011653693,0.000029300278,0.000015538722,0.00008196368,0.00002396843,0.00010610552,0.002071084,0.0107589355,0.0014641257,0.023742901,0.000017816965,0.9616766],"study_design_scores_gemma":[0.00028835554,0.00034526005,0.00001782503,0.00040321963,0.00000967914,0.00029591448,2.7568814e-7,0.6597269,0.007378769,0.3248192,0.0058713406,0.00084326783],"about_ca_topic_score_codex":0.00006161349,"about_ca_topic_score_gemma":0.000038321738,"teacher_disagreement_score":0.9608333,"about_ca_system_score_codex":0.0002004435,"about_ca_system_score_gemma":0.00090646266,"threshold_uncertainty_score":0.9999625},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014397801,0.00029000925,0.98896307,0.0006056993,0.0013117389,0.0010920408,0.000006898981,0.0002729531,0.00601781],"genre_scores_gemma":[0.8030618,0.00008518068,0.19044861,0.001340117,0.0019655153,0.00009775147,0.000038701764,0.0000993748,0.002862954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943861,0.000079030586,0.0011118222,0.0020724237,0.0014147147,0.0009359146],"domain_scores_gemma":[0.996626,0.00029248637,0.00063656317,0.0020224305,0.00018960917,0.00023289092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015471085,0.0006132642,0.00077939546,0.0009070495,0.00029913126,0.0005762268,0.0023210566,0.00041078273,0.000047014033],"category_scores_gemma":[0.0001579121,0.0005349627,0.00020718077,0.00064110814,0.00034124506,0.00081089593,0.0009805618,0.00071641465,0.00019106608],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026605938,0.00012144498,0.00079877116,0.00017924474,0.00007490596,0.0024810405,0.0053673177,0.0075313016,0.00022200012,0.005838385,0.00030650382,0.97705245],"study_design_scores_gemma":[0.0018774684,0.002796185,0.011329677,0.0051257247,0.0001462429,0.0032514166,0.0000016558641,0.7340642,0.0074873,0.19405454,0.03484786,0.005017689],"about_ca_topic_score_codex":0.00022664458,"about_ca_topic_score_gemma":0.00003653122,"teacher_disagreement_score":0.9720348,"about_ca_system_score_codex":0.00032996188,"about_ca_system_score_gemma":0.0011008582,"threshold_uncertainty_score":0.9997102},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086743344,0.0016120102,0.9937324,0.00006101294,0.0017090702,0.00059900346,0.000023730105,0.00018250759,0.0012128411],"genre_scores_gemma":[0.030765694,0.000041307983,0.9675752,0.0005935505,0.0006775078,0.000002892579,0.000008795311,0.000055597895,0.0002794799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614716,0.00004103899,0.00050387764,0.0016304808,0.0009089636,0.00076846645],"domain_scores_gemma":[0.99730164,0.00075021276,0.00031599047,0.0011568693,0.00026259854,0.00021268232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013462614,0.0005729517,0.000631842,0.0008733789,0.0004903684,0.0003571741,0.001104582,0.0002983843,0.0000058104984],"category_scores_gemma":[0.00017483546,0.00050916953,0.000091465656,0.00077749405,0.0013719983,0.00052267057,0.0018341276,0.000704814,0.000011554023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008036209,0.000049315124,0.00024461775,0.0002827444,0.00004063283,0.00042316198,0.0020141052,0.13291398,0.0015670259,0.31014654,0.000008281278,0.5522292],"study_design_scores_gemma":[0.0006089768,0.00032677522,0.00023057904,0.0012947541,0.000020213658,0.0004090873,0.0000010278219,0.939466,0.008895948,0.03883945,0.008390326,0.0015168334],"about_ca_topic_score_codex":0.00006352817,"about_ca_topic_score_gemma":0.00005060123,"teacher_disagreement_score":0.80655205,"about_ca_system_score_codex":0.00032011667,"about_ca_system_score_gemma":0.0003590685,"threshold_uncertainty_score":0.999736},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019788725,0.0016327541,0.99614483,0.000055174252,0.0008303274,0.000613648,0.0000036896613,0.00016869872,0.00035296768],"genre_scores_gemma":[0.018680766,0.000013594121,0.98100257,0.000042598807,0.00016556676,0.000035210644,0.000007897304,0.000025244495,0.000026565256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660325,0.000053601652,0.0005515228,0.0009579103,0.0014094977,0.00042419622],"domain_scores_gemma":[0.9966419,0.001417466,0.00023907456,0.0008629606,0.0007890758,0.00004952562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0043580662,0.00035520602,0.00044729176,0.00056269794,0.00012146381,0.00018739483,0.001776759,0.00020490629,0.0000024778215],"category_scores_gemma":[0.0003867662,0.00033756538,0.00009129164,0.00029889424,0.00018216683,0.00053063285,0.000517962,0.0002813511,0.0000023725465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011502448,0.0000045005067,4.3473088e-7,0.000017171576,0.000004006209,0.0000014529138,0.00023675426,0.55462736,0.00018418119,0.0037055581,0.0000021608394,0.4412153],"study_design_scores_gemma":[0.00028804902,0.00005120046,0.000017557953,0.00026053362,0.000008430891,0.000007979164,4.7250296e-7,0.67023814,0.006512405,0.32121256,0.00095522235,0.00044743175],"about_ca_topic_score_codex":0.0000022662805,"about_ca_topic_score_gemma":0.000008111536,"teacher_disagreement_score":0.44076785,"about_ca_system_score_codex":0.0005099634,"about_ca_system_score_gemma":0.0006806098,"threshold_uncertainty_score":0.9999076},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054776818,0.0006921288,0.98488134,0.00002106117,0.005818679,0.0022936328,0.000015890126,0.00024639769,0.0005532144],"genre_scores_gemma":[0.9074246,0.0000070842225,0.0921751,0.000036790392,0.0002301727,0.000052261137,0.0000017477083,0.000032235082,0.00003999925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99492496,0.00016425143,0.0015370874,0.0015267137,0.0012763827,0.000570619],"domain_scores_gemma":[0.99492884,0.00075115287,0.0011890199,0.0022412355,0.0007043645,0.00018537669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023330394,0.0006238071,0.0014383148,0.0008017624,0.00031729817,0.00066756515,0.002455582,0.000353679,0.000003602513],"category_scores_gemma":[0.00015258623,0.00053226453,0.00017724358,0.0008581422,0.00049151696,0.0005955867,0.0007471542,0.0009804801,0.000013636703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008884137,0.003933609,0.0063542407,0.13564214,0.0018608768,0.05446048,0.1324547,0.18585885,0.0030292596,0.192202,0.00005396297,0.28406107],"study_design_scores_gemma":[0.001022151,0.0008419472,0.000021814063,0.014263048,0.00012920062,0.026208848,0.00008805565,0.95132077,0.00040633147,0.0039624195,0.00012684145,0.0016085658],"about_ca_topic_score_codex":0.00038388924,"about_ca_topic_score_gemma":0.00032585268,"teacher_disagreement_score":0.9019469,"about_ca_system_score_codex":0.00029861793,"about_ca_system_score_gemma":0.00061176077,"threshold_uncertainty_score":0.9997129},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005365543,0.001187015,0.9912629,0.0003513626,0.001232324,0.00024475832,0.000004886093,0.00006202628,0.005118153],"genre_scores_gemma":[0.5851395,0.00012010074,0.412115,0.0013993805,0.00062059454,0.0000035168537,0.000009618332,0.000028014094,0.00056424394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972736,0.000029148276,0.0005076107,0.0009933803,0.00079624634,0.00039999248],"domain_scores_gemma":[0.997885,0.000659373,0.0002839056,0.00070721476,0.0003154042,0.00014909433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011120648,0.00035561476,0.00043811792,0.0009916141,0.00015969093,0.00019791363,0.0013206744,0.00024566636,0.000018545175],"category_scores_gemma":[0.00008727284,0.00033028555,0.00008418906,0.00062322366,0.0007255444,0.00043114324,0.00078229146,0.0004323921,0.0000106357575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063177395,0.00002015095,0.00003899927,0.00003842649,0.0000098496275,0.000025368212,0.00057848246,0.0072450605,0.00032381754,0.22037786,0.0000141076125,0.77132154],"study_design_scores_gemma":[0.0005647089,0.00037986823,0.0008772941,0.0003659904,0.000016279748,0.00020680223,4.9731267e-7,0.54195684,0.012821942,0.4379273,0.0039336653,0.0009488065],"about_ca_topic_score_codex":0.000014525685,"about_ca_topic_score_gemma":0.000032377593,"teacher_disagreement_score":0.77037275,"about_ca_system_score_codex":0.00010062188,"about_ca_system_score_gemma":0.00044744255,"threshold_uncertainty_score":0.99991494},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073615863,0.0014049083,0.9933896,0.00045504628,0.0004810668,0.0004983349,0.0000041040103,0.00003676205,0.0029939911],"genre_scores_gemma":[0.9407364,0.0006108813,0.05815108,0.00013492774,0.00011762703,0.000014253561,0.0000017453331,0.000017927663,0.00021515264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735725,0.000079240264,0.0005195034,0.0009020503,0.0007078121,0.00043415863],"domain_scores_gemma":[0.998413,0.0003011628,0.000378096,0.0006563037,0.00017407045,0.00007736251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052641705,0.0003451577,0.00060881884,0.00070636754,0.000102570855,0.000103587125,0.0014193624,0.00017536315,0.000022990447],"category_scores_gemma":[0.00008328543,0.0003170345,0.00015233814,0.0006535884,0.00052677427,0.0007432821,0.0003520907,0.00050775544,0.00000562383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018506933,0.00009832374,0.0028370467,0.00015955504,0.00003140397,0.00009382783,0.012419553,0.29103455,0.0021034046,0.0018763016,0.000009005155,0.68931854],"study_design_scores_gemma":[0.00084035855,0.00058144995,0.011016236,0.002160262,0.000022402166,0.000033149587,0.000005023588,0.8888291,0.07796827,0.017491387,0.00012979233,0.000922578],"about_ca_topic_score_codex":0.00029528324,"about_ca_topic_score_gemma":0.00018351643,"teacher_disagreement_score":0.94000024,"about_ca_system_score_codex":0.00008290917,"about_ca_system_score_gemma":0.000117260955,"threshold_uncertainty_score":0.9999282},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000116246316,0.00021098729,0.98713666,0.001078317,0.0018687036,0.0004291125,0.000004212395,0.0001489062,0.009006879],"genre_scores_gemma":[0.036469597,0.00013005795,0.95475614,0.004092463,0.00057085016,0.000028394585,0.000020202639,0.000050938306,0.0038813665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963357,0.000034851804,0.0005116812,0.0015021143,0.00081592845,0.0007997178],"domain_scores_gemma":[0.99764675,0.00026108936,0.00021408545,0.0016041907,0.00011661879,0.0001572923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085076224,0.00048044568,0.00047525935,0.0011794309,0.00020507301,0.0008657645,0.0035741653,0.0001463054,0.00007629345],"category_scores_gemma":[0.00008118279,0.0004394701,0.0000890614,0.0008528099,0.0005041537,0.0019223725,0.0033321457,0.0007860648,0.00020145618],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002591769,0.00004081812,0.0002569561,0.000038213555,0.000011608893,0.0002930272,0.00092672266,0.010214001,0.00007032377,0.1525326,0.00043981837,0.8351733],"study_design_scores_gemma":[0.0006881688,0.00012258394,0.00036355053,0.00091286044,0.000009793035,0.000041716932,0.0000010775132,0.63745993,0.0004560306,0.33074695,0.027750675,0.0014466908],"about_ca_topic_score_codex":0.00022301803,"about_ca_topic_score_gemma":0.0003931988,"teacher_disagreement_score":0.83372664,"about_ca_system_score_codex":0.00024511045,"about_ca_system_score_gemma":0.00026103557,"threshold_uncertainty_score":0.9998057},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003693795,0.00041077996,0.9962005,0.000181056,0.0017538493,0.0006491681,0.00023425408,0.00010498775,0.0004284783],"genre_scores_gemma":[0.0071503012,0.000057479414,0.9919292,0.00017398299,0.00040595178,0.000011707492,0.00010481135,0.000029871202,0.00013670018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967112,0.000023756596,0.0006598757,0.001435998,0.0006993976,0.00046977377],"domain_scores_gemma":[0.9963513,0.00031469326,0.0004986853,0.0024951128,0.00022850516,0.000111685236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076925516,0.0004008541,0.0005588468,0.0005010097,0.00020160394,0.000116709416,0.002769934,0.0001858416,0.000015003732],"category_scores_gemma":[0.00008048992,0.00036797058,0.00008690937,0.0003753457,0.0007513469,0.0013571081,0.0024673804,0.00029766056,0.000007708147],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003269736,0.000042936255,0.0001068174,0.00023916944,0.000031156702,0.000054683722,0.0003427165,0.005075962,0.00069208234,0.1272627,0.0001504525,0.86596864],"study_design_scores_gemma":[0.0012192243,0.0005653037,0.00004091393,0.0012435472,0.000036215748,0.00083861226,0.0000016689856,0.76498556,0.0056813955,0.13438559,0.08943873,0.0015632756],"about_ca_topic_score_codex":0.00007361699,"about_ca_topic_score_gemma":0.0001502299,"teacher_disagreement_score":0.86440533,"about_ca_system_score_codex":0.00015275109,"about_ca_system_score_gemma":0.00035249288,"threshold_uncertainty_score":0.9998772},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018749083,0.00030856513,0.9961923,0.00014600923,0.00028417615,0.00027417645,0.000051289164,0.000022057551,0.0008465384],"genre_scores_gemma":[0.5581907,0.000037581533,0.4371626,0.0016999606,0.0009747566,0.000022561622,0.0015985933,0.000039373044,0.00027384402],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968545,0.000049685375,0.00032807182,0.0019722974,0.00046930302,0.00032614282],"domain_scores_gemma":[0.99693644,0.000023454953,0.00021440501,0.0024541393,0.00016091067,0.00021064642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040716617,0.00035863728,0.00032965012,0.0006064981,0.00013892907,0.00014922657,0.0020017899,0.00031467885,0.000021514436],"category_scores_gemma":[0.000047966147,0.0003214017,0.00010545645,0.00042824345,0.00017837583,0.000027963724,0.0009183432,0.0002812782,0.0000062362324],"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.000086517095,0.0001279654,0.0000991133,0.000012758412,0.000061413884,0.0000029088267,0.00017817132,0.19350855,0.6792794,0.000026181433,0.00014245568,0.12647457],"study_design_scores_gemma":[0.0004167693,0.00022884329,0.0005488176,0.000088120716,0.00010943711,0.000009146185,0.0000015657874,0.30723163,0.67900795,0.00037005675,0.011106298,0.0008813747],"about_ca_topic_score_codex":0.000009593256,"about_ca_topic_score_gemma":0.000038090428,"teacher_disagreement_score":0.55902964,"about_ca_system_score_codex":0.00009729752,"about_ca_system_score_gemma":0.00029580054,"threshold_uncertainty_score":0.9999238},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002774419,0.00055043807,0.99182755,0.00007170263,0.001180045,0.00056779996,0.00001888292,0.00021988289,0.0027892813],"genre_scores_gemma":[0.9978581,0.00008406479,0.00080105604,0.000095260206,0.00091182505,0.00011800437,0.000028011185,0.00003459876,0.000069090966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877167,0.0000083066925,0.0002971167,0.0004406443,0.00027799906,0.00020424751],"domain_scores_gemma":[0.99951035,0.00009835615,0.00007482223,0.00019325783,0.00004629184,0.00007691758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017687591,0.00024304476,0.00023961208,0.000341335,0.000071184724,0.00013393332,0.00020831742,0.0002964231,0.000012911327],"category_scores_gemma":[0.00002330138,0.00023484498,0.000038361235,0.00020582422,0.0001224051,0.00011528773,0.00003374973,0.0003912974,0.000014256177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032082962,0.0000053994077,0.00004089882,0.000036267676,0.000005467965,0.0000020495943,0.0000971765,0.06574357,0.000052224386,0.000013647819,0.00003438671,0.9339657],"study_design_scores_gemma":[0.0004133575,0.000093053386,0.0000458794,0.0004184196,0.0000210091,0.000029983094,7.0423425e-7,0.9723251,0.0047510606,0.009721891,0.011576315,0.0006032435],"about_ca_topic_score_codex":0.00003228478,"about_ca_topic_score_gemma":0.0002248915,"teacher_disagreement_score":0.9950837,"about_ca_system_score_codex":0.00014529088,"about_ca_system_score_gemma":0.000033639782,"threshold_uncertainty_score":0.95767003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013120093,0.00029043254,0.9897465,0.00043061978,0.0002886773,0.0002774737,0.0000023046045,0.000020373389,0.0076316115],"genre_scores_gemma":[0.3413263,0.0000507431,0.65146124,0.0021890241,0.0013396944,0.000025499889,0.00002203916,0.000053662698,0.0035318155],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99812055,0.000021050175,0.00030168338,0.0009533452,0.00027530224,0.00032806105],"domain_scores_gemma":[0.9990771,0.000023582152,0.00009910975,0.00059113576,0.00006513143,0.00014398809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033425988,0.0002625411,0.00022144735,0.0003160228,0.00006367156,0.000106556705,0.0007259916,0.000276344,0.000019810503],"category_scores_gemma":[0.00008547085,0.0002430926,0.00006435802,0.00022373378,0.00011733324,0.0000075507055,0.00031799203,0.00028224871,0.000017939925],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001570139,0.000020475836,0.000037801594,0.000020714799,0.000004411702,0.0000020843115,0.00021170189,0.008137056,0.39272657,0.0000782151,0.00038259072,0.5983627],"study_design_scores_gemma":[0.001177517,0.0003947778,0.0019654336,0.0007129799,0.000019286012,0.00010144591,0.000003503171,0.026606334,0.9043992,0.0060762246,0.056667045,0.0018762577],"about_ca_topic_score_codex":0.000010383564,"about_ca_topic_score_gemma":0.00005209635,"teacher_disagreement_score":0.5964864,"about_ca_system_score_codex":0.00009856494,"about_ca_system_score_gemma":0.00039806968,"threshold_uncertainty_score":0.9913028},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027083375,0.00027173813,0.99403346,0.00007538053,0.0012353761,0.00043342996,0.000016112175,0.0000211288,0.0012050519],"genre_scores_gemma":[0.7187644,0.000018845107,0.27959245,0.00062869943,0.0006209849,0.000028056942,0.000038616265,0.000043570697,0.0002643361],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983123,0.000024307688,0.00028897118,0.0007934786,0.00022406311,0.00035688977],"domain_scores_gemma":[0.9988465,0.00022596371,0.00023176857,0.00046841943,0.0001507556,0.00007663787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050785585,0.0003174269,0.00027176575,0.00015161672,0.00017702911,0.00009773051,0.0007791155,0.00027535178,0.000028205865],"category_scores_gemma":[0.00017861181,0.00028621705,0.00014196185,0.000043261472,0.00022060623,0.000010538719,0.00022646633,0.00020776606,0.000013683009],"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.00010451172,0.000023032413,0.000027754031,0.00008753039,0.00002232425,0.000009578439,0.00012552855,0.005065973,0.7495018,0.00042798358,0.000014410084,0.24458955],"study_design_scores_gemma":[0.00037669955,0.00043376983,0.000007858829,0.0005922676,0.000013919787,0.00001581791,4.262523e-7,0.018620292,0.9475652,0.025542619,0.00616095,0.00067015924],"about_ca_topic_score_codex":0.000035703666,"about_ca_topic_score_gemma":0.000054842625,"teacher_disagreement_score":0.7160561,"about_ca_system_score_codex":0.00004066402,"about_ca_system_score_gemma":0.00018912829,"threshold_uncertainty_score":0.999959},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003126161,0.0049389033,0.9895654,0.00004741154,0.0006028784,0.0016392171,0.000011778242,0.0002744279,0.0026073689],"genre_scores_gemma":[0.41795468,0.0010783621,0.5755663,0.0017184718,0.002068849,0.00087965105,0.00001367882,0.00008681964,0.0006331662],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99624467,0.0000466178,0.0005535925,0.0017426107,0.00072027696,0.0006922157],"domain_scores_gemma":[0.99732226,0.00045028562,0.00023566003,0.0016373687,0.00015054317,0.00020388464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007714064,0.00054218085,0.00061265036,0.00038163687,0.00043157765,0.00033761418,0.0022853499,0.00036416418,0.000024193265],"category_scores_gemma":[0.000010997974,0.00044912484,0.00011713277,0.0006128624,0.0009920726,0.00026723908,0.0009298408,0.0007917795,0.00005662723],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000081314865,0.000019385172,0.00014729559,0.000041598993,0.000009698306,0.000009708688,0.0005600277,0.15060912,0.0000030578947,0.0020133625,0.000030504296,0.8465481],"study_design_scores_gemma":[0.0005384039,0.0011453772,0.00048462214,0.0007248291,0.000023522423,0.00028367515,7.466256e-7,0.44588757,0.00025229907,0.47877312,0.0701133,0.0017725402],"about_ca_topic_score_codex":0.000021449518,"about_ca_topic_score_gemma":0.000041666495,"teacher_disagreement_score":0.84477556,"about_ca_system_score_codex":0.00016769339,"about_ca_system_score_gemma":0.00038598158,"threshold_uncertainty_score":0.99979603},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019764308,0.00042469575,0.99349326,0.00023803642,0.0010097101,0.0010386112,0.000016246355,0.00010586919,0.003653837],"genre_scores_gemma":[0.063261986,0.00002290213,0.93531346,0.0010245345,0.00031944222,0.000016487096,0.000004919272,0.000024272309,0.000011981699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957392,0.00009100252,0.00068937667,0.0014420935,0.0013284391,0.0007098696],"domain_scores_gemma":[0.99598134,0.0006685041,0.00036166355,0.0025223338,0.00025491265,0.00021123941],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0029634282,0.0005021483,0.00058974006,0.000990452,0.00026035187,0.0004199986,0.0067402828,0.0002950944,0.0000045441698],"category_scores_gemma":[0.000109408706,0.0003570679,0.00017180316,0.0016531023,0.00057622476,0.00041612095,0.0019073325,0.0007164347,0.00002317774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030125773,0.00010532465,0.00003110589,0.00011117238,0.000032006184,0.00002726699,0.0039299247,0.10607707,0.0002660717,0.6703098,0.00014630618,0.21893382],"study_design_scores_gemma":[0.00047276678,0.00046557302,0.00019598525,0.00061323465,0.000017948916,0.00013480482,0.0000010479969,0.7205825,0.00270463,0.2579468,0.015579184,0.0012855355],"about_ca_topic_score_codex":0.000036245532,"about_ca_topic_score_gemma":0.000029836656,"teacher_disagreement_score":0.6145054,"about_ca_system_score_codex":0.0001046216,"about_ca_system_score_gemma":0.00031548613,"threshold_uncertainty_score":0.9998881},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066376075,0.006393371,0.8688436,0.008926401,0.003559875,0.0015968201,0.000026202202,0.00015235163,0.044125285],"genre_scores_gemma":[0.9968128,0.0004266761,0.0013155609,0.00037578156,0.0008626946,0.0000018391519,0.000001044192,0.0000060145207,0.00019756015],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809813,0.00011744696,0.00030477985,0.0003920076,0.0007764958,0.00031116177],"domain_scores_gemma":[0.99883753,0.00041420673,0.00026529198,0.00023319651,0.00017862645,0.000071126284],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0011194391,0.00016812458,0.00030403933,0.00021942436,0.0015081564,0.00013656581,0.0009054984,0.0002174266,0.00006953706],"category_scores_gemma":[0.000113128764,0.00012531881,0.00015224137,0.0005685699,0.00531288,0.000105484745,0.00019805148,0.0004989205,0.0000015675475],"study_design_candidate":"design_other","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.000010143128,0.000054025888,0.023512853,0.000050954673,0.00006732698,0.000029539115,0.04570278,0.020561034,0.0000084193625,0.025492506,0.00011879479,0.8843916],"study_design_scores_gemma":[0.00053029985,0.00022623445,0.122805886,0.001198101,0.00018708498,0.00001574213,0.000046943438,0.019064276,0.00003928828,0.83167416,0.022706421,0.0015055876],"about_ca_topic_score_codex":0.0013267432,"about_ca_topic_score_gemma":0.020437138,"teacher_disagreement_score":0.93043673,"about_ca_system_score_codex":0.00006903232,"about_ca_system_score_gemma":0.0006766986,"threshold_uncertainty_score":0.99979174},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014022242,0.00035753747,0.9933901,0.00040518536,0.0009765642,0.0005998764,0.00008834124,0.00025401035,0.003914388],"genre_scores_gemma":[0.10823354,0.00039049322,0.8785286,0.005056748,0.0010759574,0.00013936432,0.0008006301,0.00016970006,0.0056049656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957481,0.00005040495,0.000541587,0.0015642542,0.0012866226,0.0008090383],"domain_scores_gemma":[0.9977406,0.00020128733,0.00024466857,0.0012407396,0.0003136157,0.00025907558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006971618,0.0005119357,0.00046625774,0.0004654247,0.00030724358,0.0008182402,0.0034273136,0.00034632478,0.00006900813],"category_scores_gemma":[0.000036264195,0.00048319335,0.00012910368,0.0007996426,0.0005863462,0.0006553527,0.0013929408,0.0008183662,0.00007375593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004232957,0.00015393947,0.000055906585,0.00006557458,0.000021850157,0.00017295,0.00069987384,0.44068852,0.000052533844,0.0060026264,0.0114059895,0.540676],"study_design_scores_gemma":[0.00027950943,0.00013152817,0.000014314302,0.00010001251,0.0000033122424,0.000023154958,6.648119e-8,0.9345199,0.00043990515,0.040343817,0.023568256,0.0005762657],"about_ca_topic_score_codex":0.000060616483,"about_ca_topic_score_gemma":0.000021558699,"teacher_disagreement_score":0.54009974,"about_ca_system_score_codex":0.00046030642,"about_ca_system_score_gemma":0.00045746763,"threshold_uncertainty_score":0.999762},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010252035,0.00026349636,0.9848269,0.00185603,0.0015556498,0.00045669504,0.000003930191,0.0002284824,0.010798561],"genre_scores_gemma":[0.0029811258,0.00011585515,0.9920029,0.0006285874,0.0005092298,0.000012128851,0.000012489114,0.000040993807,0.0036966626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99490607,0.00007072264,0.0006617941,0.0017300976,0.0018652036,0.00076611206],"domain_scores_gemma":[0.99665964,0.0005041335,0.0003014266,0.0016089443,0.0006550984,0.00027075564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014965697,0.0005013294,0.00050837774,0.0016321383,0.0002757791,0.0008773175,0.0042630266,0.00035738468,0.000266861],"category_scores_gemma":[0.0002127803,0.00048065317,0.0001205505,0.0011195146,0.00054669345,0.0009089165,0.0015568549,0.0010074009,0.00028868893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028769864,0.000036807163,0.0000042703273,0.000014138579,0.00000854645,0.000053672884,0.00019329785,0.07978016,0.000013028224,0.02797738,0.0000663412,0.89184946],"study_design_scores_gemma":[0.00029750203,0.00011186311,0.00002665774,0.00010524134,0.0000040997265,0.00005315796,3.4096754e-8,0.95439553,0.0004672458,0.038454678,0.0055797435,0.00050426647],"about_ca_topic_score_codex":0.000007566883,"about_ca_topic_score_gemma":0.000011521853,"teacher_disagreement_score":0.8913452,"about_ca_system_score_codex":0.0005404003,"about_ca_system_score_gemma":0.0008923116,"threshold_uncertainty_score":0.9997645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011800842,0.00030745295,0.9954561,0.00021212373,0.00036306467,0.000817598,0.000010113658,0.00048295208,0.0011705217],"genre_scores_gemma":[0.70776635,0.000014006723,0.29008597,0.0007316674,0.0002943492,0.00005906551,0.0000097954135,0.000085591586,0.0009532001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823713,0.0000029427297,0.00024097571,0.00064355263,0.0003729363,0.00050244085],"domain_scores_gemma":[0.99922943,0.000056499095,0.000040295512,0.00048232896,0.00005863682,0.00013279813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001794312,0.0004028427,0.0003957931,0.00041585535,0.00008316961,0.000119764016,0.000633699,0.0001494693,0.0000035035243],"category_scores_gemma":[0.0000055875616,0.00034912204,0.00009114864,0.0001759053,0.00008642715,0.00008988154,0.00007729075,0.00026727424,0.0000103974935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063201915,0.0000058742717,6.547857e-8,0.000042314085,0.0000089383375,0.000012758628,0.00032359824,0.65646344,0.0000985362,0.0004695595,0.000040224313,0.34252837],"study_design_scores_gemma":[0.0003840367,0.00012718908,0.0000067678056,0.00019316915,0.000024082177,0.0000055811606,1.3124898e-7,0.9927232,0.00012439904,0.0024190845,0.003544444,0.00044789774],"about_ca_topic_score_codex":0.0000017691771,"about_ca_topic_score_gemma":0.00006124811,"teacher_disagreement_score":0.7065863,"about_ca_system_score_codex":0.00019402595,"about_ca_system_score_gemma":0.000098328615,"threshold_uncertainty_score":0.99989605},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004236229,0.008972002,0.9876982,0.00022079534,0.0011361603,0.00042766865,0.000023025214,0.000028765851,0.0010697739],"genre_scores_gemma":[0.97569996,0.0021055033,0.016748844,0.0025551578,0.0016506162,0.000014745793,0.00025993554,0.000051458548,0.0009137792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978913,0.000021719097,0.00042748154,0.00076704373,0.00032943732,0.00056304],"domain_scores_gemma":[0.99876285,0.00006813702,0.0003194442,0.00058002706,0.00014277655,0.00012677614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047363964,0.00041736587,0.00040336495,0.00016014447,0.00023786612,0.0001503689,0.0008396504,0.00061725866,0.00001017406],"category_scores_gemma":[0.00002750674,0.00039709927,0.000098426564,0.00013715628,0.00043617585,0.000011332106,0.0003766566,0.000470104,0.0000073583788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001262233,0.000047894348,0.00013763539,0.00023827366,0.00010904116,0.00005058111,0.00036467932,0.2239746,0.031889327,0.0057549262,0.004520019,0.7327868],"study_design_scores_gemma":[0.00074179005,0.00085337384,0.000067302484,0.0018001421,0.000048451086,0.00040974168,0.0000029283397,0.9616262,0.0032413716,0.0064050695,0.023105875,0.001697809],"about_ca_topic_score_codex":0.000010351637,"about_ca_topic_score_gemma":0.00008466719,"teacher_disagreement_score":0.97527635,"about_ca_system_score_codex":0.000119046694,"about_ca_system_score_gemma":0.00022157076,"threshold_uncertainty_score":0.99984807},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007246795,0.0006835821,0.99189675,0.00024161939,0.0046982593,0.0014991747,0.00001195744,0.00029820603,0.0005980001],"genre_scores_gemma":[0.20433266,0.000013893852,0.79333067,0.0010095808,0.0007083191,0.00006291755,0.000009555605,0.00008059077,0.00045179357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504405,0.000080397615,0.0008467691,0.0020589153,0.0010297169,0.00094013056],"domain_scores_gemma":[0.9968008,0.00052707735,0.00061493856,0.0014788787,0.0003385361,0.00023979046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014451224,0.0007393936,0.00076955755,0.00095444213,0.0005248272,0.0008135363,0.002567993,0.0004645107,0.0000046401383],"category_scores_gemma":[0.0001412124,0.0006641985,0.00029875283,0.00049190206,0.00020085662,0.0005363236,0.0005207744,0.0006837677,0.000024200539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016182626,0.0001100103,0.00012068815,0.0014067926,0.000074093085,0.00017044433,0.0063518984,0.21721509,0.0035540587,0.02430432,0.000098158474,0.7465783],"study_design_scores_gemma":[0.00087577605,0.00016229367,0.00013313442,0.0016888891,0.000020773601,0.00018197516,0.0000016052323,0.98505664,0.003235819,0.004368598,0.0031193045,0.0011551864],"about_ca_topic_score_codex":0.00003039599,"about_ca_topic_score_gemma":0.00013762232,"teacher_disagreement_score":0.7678416,"about_ca_system_score_codex":0.0007242725,"about_ca_system_score_gemma":0.00037006923,"threshold_uncertainty_score":0.9995809},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032158685,0.00013934945,0.9959533,0.0015361645,0.00029354382,0.00025623204,0.000009148445,0.0002110421,0.0012796095],"genre_scores_gemma":[0.3917372,0.00006167702,0.6056954,0.001980983,0.00027290246,0.0000036106176,0.000006805488,0.000036343823,0.00020507479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971069,0.00004556286,0.0003702319,0.0012655075,0.00077296206,0.00043884374],"domain_scores_gemma":[0.9980348,0.0007697996,0.00015154576,0.0005932159,0.00028953145,0.00016113509],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010021497,0.00037761236,0.0003446472,0.0005834118,0.00041138593,0.0010162118,0.0009975438,0.00032202958,0.000007301791],"category_scores_gemma":[0.0002172546,0.00033845444,0.000041409112,0.00037083178,0.0022545198,0.0005298801,0.0007969293,0.001099356,0.0000054214934],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004838817,0.000054969565,0.000046393132,0.000098397184,0.000007694391,0.000117462616,0.0023747995,0.00009238902,0.035664175,0.018875614,0.000012590804,0.9426071],"study_design_scores_gemma":[0.0007054096,0.00066072994,0.0003675085,0.0006334955,0.000008381632,0.00008310701,0.0000028017432,0.68765837,0.28458098,0.023165151,0.0011133107,0.0010207692],"about_ca_topic_score_codex":0.000014112673,"about_ca_topic_score_gemma":0.000009733971,"teacher_disagreement_score":0.9415864,"about_ca_system_score_codex":0.00009490592,"about_ca_system_score_gemma":0.0003671117,"threshold_uncertainty_score":0.9999067},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031835402,0.00023139127,0.99466544,0.00047508322,0.00078251306,0.00042767831,0.0000519442,0.000022844404,0.00015953211],"genre_scores_gemma":[0.036790032,0.000008010585,0.9610493,0.00049268606,0.0008615041,0.000056331985,0.000117703166,0.00001857785,0.00060584914],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99857724,0.000010765943,0.00020407295,0.0007067205,0.00023374174,0.00026743388],"domain_scores_gemma":[0.9993266,0.000073856274,0.00009672908,0.00031026345,0.00010300566,0.00008953146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029285369,0.00020298664,0.00018436152,0.000145683,0.00017337596,0.00010492083,0.0005195461,0.00039101258,0.000013176069],"category_scores_gemma":[0.0001601642,0.00017591205,0.00007075877,0.00009100409,0.00044536416,0.000005421342,0.00020383328,0.00023616657,0.000007024566],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045426837,0.000007576074,0.0000031435252,0.000006324231,0.000009247635,0.0000037404297,0.000086392654,0.00007196272,0.07003789,0.000082506194,0.000011463404,0.9296752],"study_design_scores_gemma":[0.001108053,0.0023220694,0.00024432913,0.0009243896,0.000059305727,0.00005881413,0.0000061980563,0.027286848,0.5537889,0.28806895,0.124217995,0.0019141316],"about_ca_topic_score_codex":0.00003856065,"about_ca_topic_score_gemma":0.00018938989,"teacher_disagreement_score":0.9277611,"about_ca_system_score_codex":0.00003711353,"about_ca_system_score_gemma":0.00017905554,"threshold_uncertainty_score":0.7173486},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012815405,0.00023479722,0.9864736,0.00068600825,0.00083308213,0.00038712734,0.000012150861,0.00023834717,0.011122042],"genre_scores_gemma":[0.19563414,0.000047325542,0.7984479,0.0033703742,0.00057282724,0.000024116587,0.000027916538,0.000053196953,0.0018222174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953233,0.000023139235,0.00061678514,0.0022616135,0.0011295588,0.00064561394],"domain_scores_gemma":[0.9960746,0.0002162729,0.00037917928,0.0028698896,0.00027053128,0.0001895038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093229325,0.0005464023,0.00054386194,0.00051280233,0.00028098942,0.00065684237,0.0033241345,0.00034835358,0.000005317764],"category_scores_gemma":[0.00011345199,0.00050614274,0.00013917318,0.00054117467,0.00025783596,0.0004667684,0.00046078456,0.0007742723,0.000053958283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021723358,0.00001900529,5.7361945e-7,0.000010723743,0.0000029916098,0.000029083525,0.000115287614,0.3820489,0.000028366618,0.056648675,0.000040745574,0.56105345],"study_design_scores_gemma":[0.00014418806,0.0001156465,0.000013573341,0.0004086113,0.00000348287,0.00003649939,2.2713165e-8,0.81021464,0.00021016886,0.18760717,0.0007898912,0.0004560908],"about_ca_topic_score_codex":0.00000928053,"about_ca_topic_score_gemma":0.0000061657975,"teacher_disagreement_score":0.56059736,"about_ca_system_score_codex":0.00042596384,"about_ca_system_score_gemma":0.00039050003,"threshold_uncertainty_score":0.999739},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059376584,0.00005702535,0.99323225,0.0016358773,0.0003288663,0.0012831443,0.00002626219,0.00015494089,0.0032222832],"genre_scores_gemma":[0.046530586,0.000031728785,0.9491973,0.0033939644,0.00037344554,0.000072220835,0.000021242186,0.000032070122,0.00034744624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584043,0.000040536648,0.00065535784,0.0018134355,0.0009496409,0.00070062047],"domain_scores_gemma":[0.9966288,0.00022445913,0.00023029,0.0024268378,0.0002186519,0.00027093207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011953214,0.00042444622,0.00041744154,0.0011084718,0.00049361103,0.0009145058,0.004431121,0.0001500467,0.000016934691],"category_scores_gemma":[0.00002860962,0.0004343052,0.000090350106,0.0011541699,0.00018576508,0.0005166281,0.002729253,0.000519281,0.00012152766],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016262823,0.000045000193,0.000022510283,0.000031209056,0.000008641961,0.000006747541,0.000124924,0.021511635,0.0006378991,0.068913884,0.00004441396,0.90865153],"study_design_scores_gemma":[0.00034458018,0.00018904149,0.00028799995,0.00029890874,0.00001757484,0.000017203387,6.630302e-7,0.8581664,0.0005022178,0.089658834,0.04931898,0.0011975955],"about_ca_topic_score_codex":0.00005869741,"about_ca_topic_score_gemma":0.000050353396,"teacher_disagreement_score":0.9074539,"about_ca_system_score_codex":0.0006232424,"about_ca_system_score_gemma":0.000392931,"threshold_uncertainty_score":0.9998109},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006658624,0.00033120878,0.9906048,0.00011755648,0.0014478447,0.00028643385,0.00003139912,0.00010232529,0.00041977203],"genre_scores_gemma":[0.78435355,0.000013642095,0.21514206,0.00012265654,0.00017646381,0.0000059458753,0.000042620584,0.000044348253,0.00009872005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845725,0.0000081211865,0.00041640265,0.00042232726,0.00041683594,0.00027907002],"domain_scores_gemma":[0.99908346,0.0002188606,0.00008282519,0.00042295488,0.000118434946,0.000073437324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020845523,0.0003008606,0.0004060695,0.00054843514,0.000050361698,0.000041775507,0.0005428899,0.00032189873,0.00006332712],"category_scores_gemma":[0.000024174995,0.00029456054,0.00006872292,0.00028883727,0.00028902988,0.000101258636,0.00018554802,0.0009790517,0.000010287244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004365036,0.000015488733,0.00008388496,0.000053898202,0.000009540795,0.000012263062,0.00010448863,0.96978605,0.00018990756,0.0023750823,0.0000053102412,0.027359707],"study_design_scores_gemma":[0.0003176877,0.000030906303,0.0012137095,0.00022899141,0.000009956285,0.000014091731,4.038223e-8,0.9685764,0.000055436038,0.029003153,0.00026858124,0.00028106265],"about_ca_topic_score_codex":0.000035464942,"about_ca_topic_score_gemma":0.0019373853,"teacher_disagreement_score":0.77769494,"about_ca_system_score_codex":0.00006889701,"about_ca_system_score_gemma":0.00011963939,"threshold_uncertainty_score":0.99995065},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019120214,0.00028905598,0.9937085,0.00036949269,0.0007568805,0.0006568592,0.0000033125075,0.00007573625,0.0022281439],"genre_scores_gemma":[0.97107404,0.000004699065,0.028450824,0.00016720261,0.00012660543,0.000019098574,0.000008100033,0.000012481797,0.00013695401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960694,0.00012094479,0.0006855109,0.0010139595,0.0017863683,0.00032383963],"domain_scores_gemma":[0.9964321,0.00030309867,0.0005836066,0.001479244,0.0010943299,0.00010761399],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026530714,0.0003285953,0.000577944,0.00074266904,0.00012762196,0.00023670956,0.002267676,0.00020629559,0.000029192008],"category_scores_gemma":[0.00011185959,0.00030566033,0.00011645812,0.00051352347,0.0004490664,0.00032055733,0.00048114828,0.0003157642,0.00006528106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007967043,0.00011220415,0.00012696002,0.00016500759,0.000066091634,0.000002054968,0.04893547,0.0039876495,0.0026991807,0.37241647,0.000047076453,0.57143384],"study_design_scores_gemma":[0.00025625047,0.00006800542,0.0003265795,0.00022861575,0.000022915854,0.000009713559,4.4014422e-7,0.87237924,0.0032343285,0.12249015,0.0006948181,0.00028895936],"about_ca_topic_score_codex":0.00001393971,"about_ca_topic_score_gemma":0.000046092602,"teacher_disagreement_score":0.969162,"about_ca_system_score_codex":0.00023819183,"about_ca_system_score_gemma":0.00057486846,"threshold_uncertainty_score":0.99993956},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7121383,0.00005488378,0.2871417,0.000012735801,0.0004217556,0.00015026616,1.3574554e-7,0.000060802045,0.000019435367],"genre_scores_gemma":[0.9922989,6.46703e-7,0.0074614747,0.00008006974,0.0001438335,0.000007902867,1.7964742e-7,0.0000066978555,3.0454774e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929166,0.000025067553,0.00013234222,0.00018535081,0.00021333648,0.00015221648],"domain_scores_gemma":[0.99965006,0.00009385048,0.00001467714,0.00017839705,0.000017336277,0.000045704095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001842047,0.00009012108,0.00012582142,0.00015440016,0.000036595797,0.000040957464,0.0002029238,0.000025219188,0.0000068378954],"category_scores_gemma":[0.000013352282,0.000075920456,0.000015333377,0.00034833368,0.000044803284,0.0001522634,0.000023108263,0.00007238024,0.000008583415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005839488,0.00066927786,0.0066632624,0.000025462741,0.000005725213,0.000012844957,0.009478688,0.5055384,0.1385065,0.0000383416,0.000007625089,0.33904803],"study_design_scores_gemma":[0.0002623689,0.00031950956,0.011711088,0.000027364405,9.3890736e-7,0.0000033507736,0.00000437542,0.49953902,0.488004,0.00001008753,0.000012598438,0.00010529963],"about_ca_topic_score_codex":0.000011702455,"about_ca_topic_score_gemma":0.000027960108,"teacher_disagreement_score":0.3494975,"about_ca_system_score_codex":0.00005177534,"about_ca_system_score_gemma":0.000015662927,"threshold_uncertainty_score":0.30959466},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034229374,0.0006372403,0.9810891,0.00069894164,0.00020037369,0.00020680748,0.000001171189,0.00013449369,0.013608909],"genre_scores_gemma":[0.93954366,0.00003549452,0.054180987,0.0041912487,0.0017717786,0.000010327411,0.000013400323,0.000069957234,0.00018314242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970616,0.0000051154047,0.0004355604,0.0013224487,0.00060208794,0.0005731763],"domain_scores_gemma":[0.99885315,0.00006246002,0.00019393655,0.00055022025,0.0002912866,0.00004897002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006246789,0.0005343363,0.00061253266,0.0018758561,0.00040493498,0.00096949836,0.0009437764,0.00020931885,0.000011791819],"category_scores_gemma":[0.00009379731,0.0004660288,0.000114570306,0.0010869285,0.00022517705,0.00037546596,0.0008289273,0.00061776186,0.000019863854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073878164,0.000015420048,0.0001389325,0.00011027751,0.000012297074,0.000007901688,0.00010185973,0.706648,0.000009957283,0.0011830016,0.0000037677903,0.29176122],"study_design_scores_gemma":[0.00013048098,0.0000061392793,0.00002233372,0.0003149136,0.000060408052,0.000015029341,8.0032663e-7,0.94036347,0.0000028542893,0.05786191,0.00066545483,0.00055623014],"about_ca_topic_score_codex":0.00051779003,"about_ca_topic_score_gemma":0.00014435042,"teacher_disagreement_score":0.93612075,"about_ca_system_score_codex":0.000065400185,"about_ca_system_score_gemma":0.00006586785,"threshold_uncertainty_score":0.99977916},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083928625,0.00091243343,0.9782267,0.000981851,0.001256857,0.00060643925,0.0000038872713,0.00014345699,0.017029064],"genre_scores_gemma":[0.8130724,0.000036664445,0.18314019,0.0025882774,0.0003511444,0.000024991386,0.0000038216117,0.00003675097,0.00074574386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99471253,0.000077270306,0.00089827226,0.0021064267,0.0009984828,0.0012070293],"domain_scores_gemma":[0.9971642,0.0005918783,0.00021303259,0.0014620356,0.00024275138,0.00032608406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001229945,0.0007242981,0.0010150905,0.0018188799,0.00015302874,0.0004796038,0.004249632,0.00043775397,0.000028846991],"category_scores_gemma":[0.000134091,0.00067241146,0.00015002652,0.0014127935,0.000953783,0.0006418029,0.0019173668,0.0011198673,0.00016683318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024534547,0.00016038008,0.0011055947,0.00005990948,0.000009380638,0.0004426265,0.00689047,0.27390593,0.000065342014,0.068642266,0.00010752855,0.64858603],"study_design_scores_gemma":[0.00084411463,0.00021659772,0.0014757299,0.00097866,0.000005015677,0.00010782878,0.0000024889446,0.90032446,0.00046204138,0.08966462,0.0045804903,0.0013379201],"about_ca_topic_score_codex":0.00017879454,"about_ca_topic_score_gemma":0.006176287,"teacher_disagreement_score":0.81223315,"about_ca_system_score_codex":0.0009950501,"about_ca_system_score_gemma":0.0009629125,"threshold_uncertainty_score":0.9995727},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025122043,0.0003560678,0.9885811,0.0003696821,0.003008975,0.0007691206,0.000011657526,0.00022868643,0.0066495733],"genre_scores_gemma":[0.0067253965,0.000016889177,0.99057823,0.00066367653,0.0005784502,0.000047168403,0.00001145416,0.000043166317,0.0013355473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960481,0.000037004917,0.0006478337,0.0016344696,0.00086391834,0.000768691],"domain_scores_gemma":[0.99661887,0.0006839831,0.00041718892,0.0017523869,0.00039932257,0.0001282557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014125475,0.0005403075,0.0005507487,0.00076449587,0.0003259179,0.00059140485,0.0038473487,0.00038557503,0.000011685847],"category_scores_gemma":[0.00021655246,0.00051511824,0.00014957538,0.00067786215,0.00071009656,0.0009540071,0.00076771824,0.00048523778,0.00003109196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011802651,0.000043673976,0.000036551395,0.0001552377,0.000011836952,0.000018413006,0.0003018041,0.0476593,0.0003486407,0.23892151,0.00052318274,0.71196806],"study_design_scores_gemma":[0.00028107973,0.0002039395,0.00007861847,0.00023264393,0.000009310493,0.00003680398,7.336827e-8,0.65586585,0.005447911,0.3263946,0.010735589,0.0007135682],"about_ca_topic_score_codex":0.000031814,"about_ca_topic_score_gemma":0.00003804904,"teacher_disagreement_score":0.7112545,"about_ca_system_score_codex":0.0003157857,"about_ca_system_score_gemma":0.00060397125,"threshold_uncertainty_score":0.99973005},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023636812,0.0004560735,0.9912056,0.005726082,0.0009139251,0.0005475144,0.000003160118,0.00032883656,0.00079519657],"genre_scores_gemma":[0.66475147,0.00007673112,0.33383125,0.0005472255,0.0002704983,0.000048634352,0.000012222032,0.000022736014,0.00043922017],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761903,0.000015157943,0.00041656758,0.001027797,0.0004888525,0.00043261304],"domain_scores_gemma":[0.9978713,0.00035409295,0.00035001885,0.0011527104,0.00021717328,0.00005472034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006919256,0.0003371008,0.00028628774,0.0005609722,0.00047574125,0.00084156357,0.0038440344,0.00024320952,0.000011246545],"category_scores_gemma":[0.00012053536,0.00023394967,0.000112387504,0.0007341977,0.0008216083,0.0007068665,0.0006093899,0.00039937563,0.000017778526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018101784,0.00000945861,0.00011213796,0.0000185776,0.000006337985,0.0000037556129,0.00037089878,0.010439201,0.00010115359,0.48707882,0.000026597809,0.50183123],"study_design_scores_gemma":[0.0001636474,0.00010596503,0.000091199865,0.00010393523,0.0000068296877,0.000009722852,7.377824e-7,0.11016761,0.0024657873,0.8843121,0.0021917834,0.0003807043],"about_ca_topic_score_codex":0.00002915206,"about_ca_topic_score_gemma":0.000052513715,"teacher_disagreement_score":0.6647278,"about_ca_system_score_codex":0.00032328186,"about_ca_system_score_gemma":0.0006402599,"threshold_uncertainty_score":0.95401907},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010046172,0.00055746594,0.9929233,0.0019551388,0.000728148,0.00047097114,0.000019580035,0.0005188963,0.002816429],"genre_scores_gemma":[0.09873398,0.0001494655,0.8945281,0.004027498,0.0007173256,0.000025007383,0.000035356024,0.00006663248,0.0017166553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960428,0.000046789148,0.00047292135,0.0015264372,0.001256969,0.0006540848],"domain_scores_gemma":[0.99763346,0.00032187052,0.0003643512,0.0010775155,0.00040343773,0.00019936418],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000542135,0.00060466054,0.00061321486,0.0007866657,0.00043488108,0.000559474,0.002935501,0.00049215823,0.00005092221],"category_scores_gemma":[0.00011839208,0.00054652593,0.0002611252,0.0007633712,0.0017091951,0.0005859379,0.00036848753,0.0010437377,0.000021297103],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017270504,0.00006446558,0.0000054255415,0.000029765153,0.0000096411395,0.00017375677,0.0005191525,0.00013606665,0.0019619924,0.006380589,0.00010704772,0.9905948],"study_design_scores_gemma":[0.0026078126,0.00063200225,0.000033835477,0.0007011299,0.000023459474,0.00032738585,4.4542696e-7,0.82840765,0.06840448,0.028923284,0.06780069,0.0021378032],"about_ca_topic_score_codex":0.000004584992,"about_ca_topic_score_gemma":0.000004355095,"teacher_disagreement_score":0.988457,"about_ca_system_score_codex":0.00030631825,"about_ca_system_score_gemma":0.0012155786,"threshold_uncertainty_score":0.99969864},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008304567,0.00050661,0.99719846,0.00008613337,0.00035522977,0.0005560158,0.00001629583,0.000015245833,0.00043555655],"genre_scores_gemma":[0.17189929,0.0001446454,0.8254205,0.00079928973,0.0014419754,0.000032339092,0.000109926164,0.000032925636,0.00011910343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861616,0.000008186788,0.00027387988,0.00058433966,0.00018118495,0.0003362379],"domain_scores_gemma":[0.9988807,0.00003453073,0.00018702085,0.0006889629,0.00012126485,0.00008754657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032685703,0.00022764823,0.00018720764,0.000090842375,0.00023483617,0.00008136156,0.00063919055,0.00047561538,0.0000035795692],"category_scores_gemma":[0.00005871704,0.00021952155,0.00008583504,0.00007023078,0.0003219758,0.0000092690125,0.00021302626,0.00030632733,0.0000033190254],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073512405,0.000068504036,0.00008747872,0.00012379064,0.000034238365,0.000004493218,0.0005159762,0.053611733,0.011053285,0.008769088,0.00026069354,0.9253972],"study_design_scores_gemma":[0.00072471437,0.0017771476,0.000223086,0.00063713844,0.000030792427,0.000113758244,8.331731e-7,0.62155735,0.027494416,0.30255437,0.043026157,0.0018602115],"about_ca_topic_score_codex":0.0000059224817,"about_ca_topic_score_gemma":0.00004371532,"teacher_disagreement_score":0.923537,"about_ca_system_score_codex":0.00005089712,"about_ca_system_score_gemma":0.0002185829,"threshold_uncertainty_score":0.89518285},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07547082,0.00002231832,0.92260206,0.0005634676,0.000539906,0.00033050723,0.000006898513,0.000029214947,0.00043478934],"genre_scores_gemma":[0.97444725,0.0000418354,0.023171717,0.00071239297,0.00055181765,0.0000034610632,0.00006604044,0.000033506203,0.0009719543],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99898607,0.0000069352163,0.00020073984,0.00040551598,0.0002730302,0.00012769175],"domain_scores_gemma":[0.9992638,0.00005226464,0.00021245812,0.00024461816,0.00017338013,0.000053435197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001830204,0.00017478602,0.0002809872,0.00042564975,0.00006490852,0.000035031415,0.000103275066,0.00019502969,0.00005750465],"category_scores_gemma":[0.00002207671,0.0001390884,0.000020384974,0.00012427154,0.0003684828,0.00016578122,0.000073807474,0.00043856096,0.000004099401],"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.00009688392,0.00003126756,0.00012142338,0.00013410492,0.000014771327,0.000021526888,0.0007728386,0.000015806152,0.5381011,0.0014306308,0.0000017530627,0.45925796],"study_design_scores_gemma":[0.0015904824,0.0049747513,0.009145535,0.0031492605,0.00016391158,0.0011320395,0.0000013100383,0.025346197,0.91791856,0.02104131,0.014529961,0.0010066939],"about_ca_topic_score_codex":0.000008385902,"about_ca_topic_score_gemma":0.000043576343,"teacher_disagreement_score":0.89943033,"about_ca_system_score_codex":0.00005958167,"about_ca_system_score_gemma":0.000104769075,"threshold_uncertainty_score":0.567186},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003474665,0.0004084784,0.99453986,0.00009876403,0.002139246,0.00037622027,0.000013962708,0.0001885141,0.0018874696],"genre_scores_gemma":[0.46369964,0.000014781976,0.53376544,0.001862127,0.0005499513,0.000001807024,0.000043729317,0.000037934726,0.000024591882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552125,0.0000504957,0.00068715744,0.0020945813,0.001051985,0.00059453805],"domain_scores_gemma":[0.9950867,0.0007113105,0.00046291965,0.003172534,0.0004277117,0.00013877366],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007848395,0.0005651805,0.00047491505,0.0009746771,0.00043236313,0.0007479979,0.0063743396,0.00035450154,0.00005800487],"category_scores_gemma":[0.000051695602,0.00050801196,0.00007430016,0.0009618224,0.00023347672,0.0015210279,0.0029924908,0.00062848505,0.000046623503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010917416,0.000015428992,0.000022925102,0.00002153702,0.000011260231,0.000040514613,0.0008235785,0.42579034,0.00019827869,0.004840573,0.0000026037067,0.56822205],"study_design_scores_gemma":[0.00016761721,0.000054190237,0.00005875059,0.0005600372,0.000014260534,0.000035357316,1.7049405e-7,0.9055262,0.00061878987,0.091381,0.0010523318,0.000531254],"about_ca_topic_score_codex":0.000078548386,"about_ca_topic_score_gemma":0.00035258065,"teacher_disagreement_score":0.5676908,"about_ca_system_score_codex":0.00015992306,"about_ca_system_score_gemma":0.0005660144,"threshold_uncertainty_score":0.99973714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023228847,0.00013869422,0.99373,0.00025189584,0.00043193615,0.00034632182,0.000024900171,0.000077830526,0.0047661215],"genre_scores_gemma":[0.06337418,0.000031327374,0.8595313,0.00050078245,0.0015479737,0.000013443524,0.00009011082,0.00011519445,0.07479571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925017,0.00008192599,0.0007909642,0.0016941045,0.0042306697,0.00070068694],"domain_scores_gemma":[0.99525493,0.0020658416,0.0005039021,0.0010518478,0.0009692887,0.00015416926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002787314,0.00042935586,0.00055450614,0.0013471144,0.00043445153,0.00088665663,0.0021291978,0.00026442893,0.00032817086],"category_scores_gemma":[0.0012583268,0.00029938927,0.00006941556,0.0015404489,0.0010234175,0.0007660939,0.00068237906,0.0014715238,0.00010259109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001610694,0.000025646625,0.00016404806,0.0000064455244,0.0000036038311,0.000078193094,0.000094408635,0.77032554,0.000057045538,0.0004178814,0.000040537365,0.22877055],"study_design_scores_gemma":[0.00045166377,0.00042920056,0.00052223215,0.00021101901,0.0000056443455,0.00005116641,0.0000015157888,0.8527621,0.0004841783,0.110204995,0.034215465,0.00066079595],"about_ca_topic_score_codex":0.000060364975,"about_ca_topic_score_gemma":0.0003094176,"teacher_disagreement_score":0.22810976,"about_ca_system_score_codex":0.00035253773,"about_ca_system_score_gemma":0.00071345194,"threshold_uncertainty_score":0.9999458},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009431539,0.0013082074,0.99513435,0.0013276568,0.0005411206,0.00063509913,0.000044754146,0.0005611932,0.00043815485],"genre_scores_gemma":[0.079979345,0.000009636386,0.9177622,0.00062230433,0.0013038982,0.0000141177225,0.000069696245,0.000038976206,0.0001998125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579465,0.000025143923,0.00059217535,0.0021301522,0.00078993535,0.00066795043],"domain_scores_gemma":[0.9949386,0.0016003113,0.000429206,0.0026172611,0.00029060288,0.00012401363],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013044607,0.00045195044,0.00048397496,0.0007171934,0.0004580411,0.00090705237,0.008845273,0.0003128246,0.0000057235284],"category_scores_gemma":[0.0007539637,0.0004248419,0.00009577883,0.000567636,0.0003784197,0.001626319,0.0043388093,0.0007938281,0.000010298445],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017456438,0.000009456245,0.00021764234,0.00004173134,0.000009651474,0.000011867594,0.000321586,0.0012305423,0.00012119837,0.012373614,0.00007550952,0.98558545],"study_design_scores_gemma":[0.00025749867,0.00006311993,0.0000760436,0.0005828053,0.000017939697,0.000031770054,1.4883314e-7,0.8155689,0.0035309852,0.17581066,0.0032893252,0.0007707601],"about_ca_topic_score_codex":0.000034722732,"about_ca_topic_score_gemma":0.00013247234,"teacher_disagreement_score":0.9848147,"about_ca_system_score_codex":0.00022857595,"about_ca_system_score_gemma":0.00039174777,"threshold_uncertainty_score":0.99982035},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016804372,0.0012909371,0.9376187,0.0003340422,0.003315068,0.0004042255,8.5773473e-7,0.00036357236,0.0566558],"genre_scores_gemma":[0.6582548,0.00023384215,0.32729822,0.0022349567,0.002527533,0.000031834843,0.00001233364,0.00012797814,0.009278471],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99531496,0.00005182864,0.00058778026,0.001815722,0.0011429742,0.0010867491],"domain_scores_gemma":[0.9971958,0.00030388535,0.0003374186,0.0016578044,0.00024433594,0.00026075525],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011547259,0.0006146772,0.0006855231,0.000702559,0.00041753834,0.0011933331,0.0036179752,0.0004159244,0.000037415186],"category_scores_gemma":[0.000076657096,0.000537414,0.00018221725,0.0008850604,0.00056072784,0.0007493198,0.0012635137,0.0008224795,0.00019523333],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032801265,0.00003434779,0.00018404576,0.000040412546,0.00001457063,0.00026468828,0.0006647845,0.0028659205,0.000071844486,0.1350621,0.00009306929,0.86070096],"study_design_scores_gemma":[0.00045741923,0.0003558068,0.00009154166,0.0002443902,0.000017939328,0.0005141155,4.235335e-7,0.21604794,0.0014964067,0.64030796,0.1387498,0.0017162352],"about_ca_topic_score_codex":0.00015074287,"about_ca_topic_score_gemma":0.00010228455,"teacher_disagreement_score":0.8589847,"about_ca_system_score_codex":0.00035218603,"about_ca_system_score_gemma":0.00049549906,"threshold_uncertainty_score":0.99984354},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000072066185,0.0011758172,0.98932236,0.00009754629,0.00053747476,0.00040219934,0.0000121873845,0.00010672108,0.008273595],"genre_scores_gemma":[0.99608636,0.000115208255,0.002104236,0.0005854862,0.0007528478,0.000007837345,0.000005605674,0.00007448673,0.00026793356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978667,0.000021780588,0.00039689607,0.00046803604,0.0005277248,0.00071885233],"domain_scores_gemma":[0.99891365,0.0003161086,0.00008172529,0.0005589476,0.000060263483,0.00006929156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081203535,0.00041169042,0.00031861235,0.0001794756,0.0005548496,0.00025175026,0.0011418408,0.00015985851,0.00009071633],"category_scores_gemma":[0.000013503574,0.00024699527,0.00014867654,0.0002955673,0.0005471776,0.00016157085,0.0001233849,0.0008427457,0.00001547263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002880875,0.000006040557,0.000011898245,0.00006539868,0.000057964837,0.00003999197,0.0014550093,0.345903,0.001432376,0.0124883605,0.00008066455,0.6384564],"study_design_scores_gemma":[0.0002375071,0.00006393785,0.000015545893,0.00039332605,0.00006977104,0.00012245937,0.0000027112972,0.921515,0.0032930465,0.05939905,0.014164247,0.0007233945],"about_ca_topic_score_codex":0.00002538487,"about_ca_topic_score_gemma":0.00009047402,"teacher_disagreement_score":0.9960143,"about_ca_system_score_codex":0.00017712363,"about_ca_system_score_gemma":0.000061961815,"threshold_uncertainty_score":0.9999982},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012560791,0.00085970486,0.98567706,0.0017776043,0.0007813596,0.00035432068,0.000005061273,0.00032910847,0.010203245],"genre_scores_gemma":[0.28421575,0.00010436501,0.7072171,0.0065500396,0.00064301485,0.00001904696,0.000011529794,0.00006426874,0.0011749025],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951077,0.000022807159,0.0006329839,0.0020469646,0.0012607706,0.0009287399],"domain_scores_gemma":[0.99677056,0.00032219276,0.00040893778,0.0016686909,0.00054654694,0.00028306965],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005316605,0.00074928487,0.000667381,0.0008826921,0.00031515016,0.001173704,0.005428302,0.00041293504,0.000041897605],"category_scores_gemma":[0.00017140266,0.000658956,0.00013267124,0.0013240932,0.0006676757,0.00083806127,0.0006804818,0.00087823573,0.000106009844],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006613581,0.00006119625,0.00006589188,0.0002366941,0.0000063305633,0.00019885381,0.00023916138,0.009227401,0.00003059944,0.027507117,0.000055153738,0.962365],"study_design_scores_gemma":[0.0005597341,0.00057192944,0.0002703859,0.0018002454,0.000016970453,0.00013851713,1.05210184e-7,0.3124664,0.003961964,0.6707601,0.0075730677,0.0018805551],"about_ca_topic_score_codex":0.000011236783,"about_ca_topic_score_gemma":0.00006006168,"teacher_disagreement_score":0.96048445,"about_ca_system_score_codex":0.00025017725,"about_ca_system_score_gemma":0.0027278287,"threshold_uncertainty_score":0.9999528},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005529398,0.00009691828,0.95943767,0.000046034347,0.0018469077,0.0002145905,0.000008679205,0.000033667664,0.032786157],"genre_scores_gemma":[0.98670566,0.0000117141235,0.012553416,0.0002341893,0.00027482686,0.0000029297823,0.000012850645,0.000022629676,0.00018177745],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982774,0.000019678424,0.0003945717,0.00062842376,0.00041376834,0.00026616134],"domain_scores_gemma":[0.99910146,0.00012231368,0.00015839779,0.00042217644,0.00012888804,0.0000667525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037291605,0.00023641356,0.0002982844,0.0004878822,0.000123025,0.00003923881,0.00051857857,0.00031634755,0.00055314635],"category_scores_gemma":[0.000030676383,0.0002065567,0.000109585075,0.00013975124,0.00050566124,0.000068790076,0.00015150837,0.00043938265,0.00006556811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035049714,0.000079959915,0.000027974957,0.000040149567,0.000014125709,0.00003389401,0.0023749266,0.070353545,0.00034755006,0.20806931,0.000007148555,0.71861637],"study_design_scores_gemma":[0.00054094184,0.00023166258,0.00007691582,0.00069549563,0.000016148146,0.000026189473,7.408111e-7,0.046549693,0.00030281895,0.9512024,0.000042668198,0.00031430603],"about_ca_topic_score_codex":0.00002412874,"about_ca_topic_score_gemma":0.00006608716,"teacher_disagreement_score":0.98117626,"about_ca_system_score_codex":0.000096395655,"about_ca_system_score_gemma":0.00009597434,"threshold_uncertainty_score":0.84231377},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013978266,0.00037261794,0.99749225,0.00002667754,0.00035616476,0.00017430053,0.000005078901,0.0001515877,0.000023494518],"genre_scores_gemma":[0.22682747,0.000018762452,0.7730038,0.000062224826,0.00005397803,0.0000010062756,0.0000029693858,0.000017595186,0.000012198735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981181,0.000028129096,0.00036646446,0.0007655254,0.00042397628,0.0002978116],"domain_scores_gemma":[0.9972898,0.0016034585,0.0002617714,0.000596605,0.00019843207,0.0000499304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042261538,0.00030763925,0.00038874015,0.0005520149,0.00012384077,0.00019163205,0.0007399199,0.0001890967,4.3311098e-7],"category_scores_gemma":[0.0003342789,0.0003127043,0.000046253586,0.00033271327,0.00043503795,0.0009213792,0.000674644,0.00030175623,2.6961666e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014863357,0.0000054684065,0.0000514273,0.00004291636,0.0000026904922,0.000020473355,0.00011878765,0.9382216,0.0009728989,0.00264575,7.5687655e-7,0.057915777],"study_design_scores_gemma":[0.00008397357,0.000040012663,0.000074019845,0.00035740063,0.0000067068813,0.00009642356,3.2680564e-8,0.95135075,0.002778609,0.04491752,0.00000383259,0.0002907098],"about_ca_topic_score_codex":0.00002735921,"about_ca_topic_score_gemma":0.000006118624,"teacher_disagreement_score":0.22542964,"about_ca_system_score_codex":0.00023073,"about_ca_system_score_gemma":0.00017648064,"threshold_uncertainty_score":0.9999325},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17761995,0.0017939853,0.80491644,0.0004888136,0.0066993223,0.0017096158,0.0017973833,0.000089652895,0.004884831],"genre_scores_gemma":[0.9747833,0.00009436473,0.023581762,0.00019292955,0.0008486837,0.0000014305216,0.0004089701,0.0000021716533,0.000086378175],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824786,0.000038234768,0.00061612955,0.0005597901,0.00029422154,0.0002437496],"domain_scores_gemma":[0.9944544,0.0046330933,0.00037701533,0.00014773772,0.00030092546,0.00008685046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039881477,0.00018082136,0.0004557921,0.000088230154,0.00008270193,0.000027186214,0.0005531452,0.00037464697,0.0005242196],"category_scores_gemma":[0.0004050572,0.00008242086,0.0001537271,0.0002335443,0.00012410703,0.00013438736,0.00009968302,0.00035022377,0.0000027712276],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015515495,0.00007383256,0.0058951303,0.00003556692,0.000018829765,0.000014879862,0.00017618385,0.00075207435,0.021863675,0.0034425196,0.000099879195,0.96747226],"study_design_scores_gemma":[0.00071941543,0.008519692,0.04549284,0.0009225755,0.000215958,0.0007150477,0.000012070519,0.19257247,0.057765447,0.67976207,0.011043581,0.00225883],"about_ca_topic_score_codex":0.00033631022,"about_ca_topic_score_gemma":0.00152429,"teacher_disagreement_score":0.9652134,"about_ca_system_score_codex":0.000042519096,"about_ca_system_score_gemma":0.00006773428,"threshold_uncertainty_score":0.57398367},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1284691,0.0000068209542,0.860147,0.010381395,0.0002634874,0.00050193915,0.000008129487,0.00017563572,0.000046528196],"genre_scores_gemma":[0.68174714,0.0000012649109,0.31263044,0.0053819567,0.00019607095,0.000024155237,0.000007625172,0.000010132733,0.0000012373036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983175,0.000028350214,0.00022020546,0.0006480179,0.0004073628,0.00037855594],"domain_scores_gemma":[0.9984253,0.00022201755,0.00007493241,0.0009454303,0.00011948041,0.00021282611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057120284,0.0001755284,0.0002266992,0.00023592995,0.00022095915,0.000060952218,0.00046851637,0.00011661104,0.00005080267],"category_scores_gemma":[0.0001908204,0.0001443195,0.000049976767,0.0011316785,0.0007347052,0.00014966671,0.00006005945,0.0005430133,0.0000071340733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012412705,0.0011034588,0.009142273,0.000023039074,0.0000021549138,0.000048420978,0.00022789837,0.019399637,0.45441797,0.0016121797,0.000083719526,0.5138151],"study_design_scores_gemma":[0.0008348221,0.0005346507,0.014199378,0.00005014645,0.000005232892,0.00003841628,5.171996e-7,0.78355,0.19378456,0.0063205315,0.00047954288,0.00020216592],"about_ca_topic_score_codex":0.00007927448,"about_ca_topic_score_gemma":0.0000959535,"teacher_disagreement_score":0.7641504,"about_ca_system_score_codex":0.0000700738,"about_ca_system_score_gemma":0.0002707394,"threshold_uncertainty_score":0.5885179},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069765486,0.0000213094,0.9834461,0.00018041815,0.00014282645,0.00036038895,0.00009283315,0.000027257547,0.008752309],"genre_scores_gemma":[0.495408,0.000017922383,0.50328094,0.00084086746,0.00013388944,0.0000012439123,0.0002034439,0.000025327015,0.000088360684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807507,0.000020419142,0.00025095596,0.0007712697,0.00068906334,0.00019322075],"domain_scores_gemma":[0.9988199,0.00027599034,0.00018451017,0.00062576024,0.000022427856,0.00007143624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069583213,0.00019931837,0.00018775315,0.00023027431,0.00011923386,0.00006325067,0.0005984136,0.00014367359,0.00005414346],"category_scores_gemma":[0.000027687442,0.00016588048,0.000024702224,0.00023929487,0.00091595814,0.00016601932,0.00038556027,0.00026789546,0.000027712136],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012619986,0.000022870829,0.00017295495,0.00000461242,0.0000025407032,0.0000021505168,0.00026922376,0.004224474,0.0003902053,0.000007951814,0.000013524903,0.99487686],"study_design_scores_gemma":[0.0012787305,0.0011772347,0.038453262,0.0011229161,0.0001281454,0.00004899829,0.000007563514,0.87312645,0.031452302,0.050027713,0.0016189049,0.0015577566],"about_ca_topic_score_codex":0.00009692649,"about_ca_topic_score_gemma":0.00042769354,"teacher_disagreement_score":0.9933191,"about_ca_system_score_codex":0.00012122529,"about_ca_system_score_gemma":0.00004394626,"threshold_uncertainty_score":0.67644095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027038426,0.00034640005,0.994353,0.00040366434,0.0021677401,0.0006712733,0.000008177557,0.00020953368,0.0018131796],"genre_scores_gemma":[0.008920791,0.000022783504,0.9894821,0.00074654294,0.0003291369,0.000015796983,0.000007437853,0.000026333662,0.0004490435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654174,0.000024966925,0.00057178334,0.0017039975,0.00058969134,0.00056779664],"domain_scores_gemma":[0.9974671,0.0004407329,0.00031985965,0.0012344829,0.00041358825,0.0001242481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008067264,0.00043468195,0.00049449573,0.0005494684,0.00030255775,0.00029632525,0.001605665,0.0001951115,0.0000113159595],"category_scores_gemma":[0.00017633916,0.00039556183,0.0001683534,0.0004989439,0.00053705025,0.00093069806,0.0006346389,0.0004938948,0.00001727483],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039365,0.00002204902,0.0000378885,0.000037768725,0.0000032081357,0.00000566293,0.00006633424,0.0033038876,0.00013255536,0.0050891778,0.000026567868,0.99127096],"study_design_scores_gemma":[0.00036602086,0.00010144083,0.000101929836,0.0004549539,0.000005401984,0.000046961974,7.223804e-8,0.84655786,0.0016234978,0.14489739,0.0053352728,0.0005092075],"about_ca_topic_score_codex":0.000012419661,"about_ca_topic_score_gemma":0.000026096686,"teacher_disagreement_score":0.99076176,"about_ca_system_score_codex":0.0003374919,"about_ca_system_score_gemma":0.00031066188,"threshold_uncertainty_score":0.9998496},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000069726564,0.004675964,0.9882836,0.00018802765,0.00081503106,0.0007575731,0.000028074077,0.0003701372,0.004811891],"genre_scores_gemma":[0.105357625,0.00005697005,0.89102465,0.0006712236,0.0016363971,0.000036548136,0.000044231027,0.00008887245,0.001083477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99429035,0.00008939257,0.0010654253,0.0023632306,0.0010444928,0.0011471171],"domain_scores_gemma":[0.99532366,0.0010389357,0.0006539515,0.0022509613,0.0003385124,0.00039397893],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015805324,0.0008015724,0.00078222906,0.0008289328,0.0009546634,0.001349558,0.0057026935,0.00052583683,0.000011423149],"category_scores_gemma":[0.00013069784,0.0007932589,0.00024753113,0.0011891141,0.00056183507,0.0006299007,0.0022542307,0.0012316934,0.00011263756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002592784,0.000052780357,0.00001403394,0.000032880773,0.000013299701,0.000014398793,0.00040638703,0.33225775,0.00024842654,0.0064945817,0.00009212223,0.66037077],"study_design_scores_gemma":[0.0002966807,0.000050601408,0.000007521136,0.0006938888,0.00001411237,0.00009824828,3.5369922e-7,0.9333531,0.00008825804,0.007595414,0.05690618,0.00089559157],"about_ca_topic_score_codex":0.00004222148,"about_ca_topic_score_gemma":0.000035141617,"teacher_disagreement_score":0.65947515,"about_ca_system_score_codex":0.0006021315,"about_ca_system_score_gemma":0.0009199223,"threshold_uncertainty_score":0.99968714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006374114,0.0002632816,0.9907036,0.000102825914,0.001645474,0.00042457055,8.362354e-7,0.00023083272,0.00025446308],"genre_scores_gemma":[0.43960106,0.000021943162,0.5590937,0.0002526168,0.00086718576,0.000011128449,0.0000026021637,0.000035244055,0.000114514696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967294,0.000058105612,0.00052107044,0.0012398663,0.0007697423,0.00068185804],"domain_scores_gemma":[0.9981991,0.00012123597,0.0003541959,0.0009477154,0.0002450401,0.00013272205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069772435,0.00041499044,0.0003236451,0.00075854297,0.0004626061,0.00078213343,0.0015297667,0.0004019187,0.000012741687],"category_scores_gemma":[0.000035507714,0.00043113518,0.000132728,0.00083302427,0.00037827232,0.00063018716,0.00061517867,0.0006202076,0.00002153594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002978463,0.000024394809,0.00005736121,0.000026144764,0.0000044042563,0.000021975671,0.00032629305,0.11695708,0.00086222956,0.00054650067,0.0000056039994,0.881165],"study_design_scores_gemma":[0.00013406316,0.00011578602,0.00031767087,0.00023906582,0.00001361883,0.00017936333,9.739791e-8,0.96972555,0.003484747,0.022524113,0.002778208,0.00048770662],"about_ca_topic_score_codex":0.00012758977,"about_ca_topic_score_gemma":0.0004395545,"teacher_disagreement_score":0.88067734,"about_ca_system_score_codex":0.00062147604,"about_ca_system_score_gemma":0.00029903688,"threshold_uncertainty_score":0.99981403},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044043938,0.00030809367,0.99104923,0.00033813174,0.002210228,0.00018426882,0.0000075932135,0.0002355297,0.0052264915],"genre_scores_gemma":[0.6021063,0.000044939025,0.39436272,0.001646553,0.0012393756,0.000012403088,0.000028635153,0.00015095125,0.00040816446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985183,0.000009155885,0.00023101264,0.0004661774,0.00046802955,0.00030733124],"domain_scores_gemma":[0.9990581,0.0002952316,0.000054390206,0.0004667402,0.000058228234,0.00006727394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001907155,0.00034506436,0.00025341168,0.00032532786,0.00015286899,0.0001297838,0.0005361422,0.00018081488,0.00005348941],"category_scores_gemma":[0.00004240331,0.0002468895,0.00007699735,0.00028731822,0.00019277523,0.000063732055,0.00008495189,0.00065482233,0.000039466642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004647766,0.000010895388,5.1772025e-7,0.000010440955,0.0000073046563,0.000015357295,0.00018148373,0.92183995,0.000024705327,0.0011910737,0.000006357841,0.07670724],"study_design_scores_gemma":[0.00024236165,0.00010506626,0.0000115179155,0.00039635133,0.0000067571705,0.000021598633,1.4336474e-7,0.9864699,0.0013045915,0.01102349,0.00008283572,0.00033534033],"about_ca_topic_score_codex":0.0000051311094,"about_ca_topic_score_gemma":0.0000052433616,"teacher_disagreement_score":0.60166585,"about_ca_system_score_codex":0.00026525394,"about_ca_system_score_gemma":0.00006455485,"threshold_uncertainty_score":0.99999833},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45142055,0.000025068752,0.5480358,0.00022016474,0.00014830881,0.00010635832,2.7126896e-7,0.000031561,0.0000119186225],"genre_scores_gemma":[0.6180808,5.8653603e-7,0.38146603,0.00037033518,0.00007444714,0.0000010674806,9.756168e-7,0.000005368303,3.8727967e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99855304,0.000030183748,0.0002733301,0.00036343408,0.0003360837,0.0004439319],"domain_scores_gemma":[0.99927926,0.00026060594,0.00006792255,0.00022188308,0.00008863292,0.00008170945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014373891,0.00012458049,0.0001610015,0.0004773262,0.00012232474,0.000105655155,0.00013968402,0.00004616886,0.000003072601],"category_scores_gemma":[0.00030586234,0.00011111427,0.000031029875,0.0014236456,0.00028322233,0.00023739303,0.000033894015,0.00030977555,0.0000013736836],"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.00011109237,0.00010514111,0.02930669,0.00009070937,0.0000030482267,0.00011261579,0.0017285836,0.014943408,0.8227981,0.000019576632,7.122663e-7,0.13078037],"study_design_scores_gemma":[0.0011271285,0.00038743945,0.019687926,0.00048981584,0.000010958341,0.00037094214,0.000021331363,0.27910224,0.6961238,0.0023234868,0.000050845898,0.00030409917],"about_ca_topic_score_codex":0.0003216967,"about_ca_topic_score_gemma":0.00026121127,"teacher_disagreement_score":0.26415884,"about_ca_system_score_codex":0.00013207398,"about_ca_system_score_gemma":0.0001709156,"threshold_uncertainty_score":0.45311084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009808746,0.002041837,0.99089676,0.00033346057,0.0011309308,0.0003647028,0.0000025328882,0.00017275638,0.0049589095],"genre_scores_gemma":[0.65811574,0.00022959843,0.34036183,0.0006201409,0.0004513391,0.0000074415257,0.00001810344,0.000049832845,0.0001459533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963358,0.000075943484,0.00081416016,0.0011641588,0.0009387405,0.0006712173],"domain_scores_gemma":[0.9952526,0.0009290585,0.00064058736,0.0027156738,0.00035265938,0.00010939586],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009682408,0.00050938426,0.0006759438,0.00075080025,0.00024096353,0.00033392772,0.0056487257,0.0005479189,0.000010840857],"category_scores_gemma":[0.0000482713,0.0005251852,0.00016702632,0.00079040445,0.0011409431,0.0005128883,0.0020147297,0.0012963207,0.000011500123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027850278,0.0000271321,0.000060858176,0.000021897142,0.0000091739075,0.000022712853,0.00028127668,0.71017754,0.00002240661,0.025551062,0.00008132805,0.26374185],"study_design_scores_gemma":[0.00018527322,0.00006141014,0.00012525728,0.0005598961,0.000007589935,0.000042273678,7.9498044e-8,0.9166009,0.00027101138,0.081151485,0.0005137847,0.00048108204],"about_ca_topic_score_codex":0.00011174371,"about_ca_topic_score_gemma":0.00014100628,"teacher_disagreement_score":0.6580177,"about_ca_system_score_codex":0.00032301783,"about_ca_system_score_gemma":0.00025494155,"threshold_uncertainty_score":0.9997312},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003618818,0.0005823403,0.97640246,0.01063081,0.00444183,0.0010741468,0.000017463228,0.0008320652,0.005657003],"genre_scores_gemma":[0.2566024,0.000013905302,0.73386717,0.0032233226,0.0011034578,0.00009681288,0.000013647161,0.00012558523,0.0049536605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909249,0.000055412234,0.0010755016,0.0029454827,0.0032930674,0.0017056292],"domain_scores_gemma":[0.99394596,0.0006993161,0.00032821938,0.0038678013,0.0008242549,0.00033445074],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0026801196,0.0009819651,0.0010932034,0.003447897,0.00028090217,0.0015774117,0.011923339,0.00074745715,0.000005722166],"category_scores_gemma":[0.0009099912,0.0009619423,0.000166449,0.0027806214,0.0005668383,0.00070875644,0.005684517,0.0016500383,0.00014884578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007930465,0.000036457957,0.00024984244,0.00005045768,0.000012860681,0.0005088608,0.00074926554,0.7927998,0.000083286264,0.015209714,0.006802124,0.18348943],"study_design_scores_gemma":[0.0008379176,0.0004419622,0.0005820681,0.002190052,0.000014302061,0.00023050646,0.0000018674319,0.7908299,0.0010491991,0.15157251,0.04942321,0.0028264862],"about_ca_topic_score_codex":0.000522966,"about_ca_topic_score_gemma":0.00115649,"teacher_disagreement_score":0.25624055,"about_ca_system_score_codex":0.0010574026,"about_ca_system_score_gemma":0.00057691225,"threshold_uncertainty_score":0.999459},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017510743,0.00077383633,0.9942784,0.000057825917,0.0015687087,0.00046182243,0.000007577389,0.0000902212,0.0027440994],"genre_scores_gemma":[0.3431068,0.00029199684,0.6533089,0.001162758,0.0009438265,0.00007627665,0.000023284732,0.00016691697,0.0009192128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985379,0.0000061270334,0.00026692354,0.00052176847,0.00030672256,0.0003605501],"domain_scores_gemma":[0.9992683,0.00012202951,0.000055827662,0.00038438116,0.00009419657,0.00007524784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025740868,0.00031014142,0.00027638918,0.00024572853,0.000097077114,0.000101412435,0.00044396156,0.0002012144,0.000041316325],"category_scores_gemma":[0.000024212719,0.00029303736,0.00008770145,0.000117561656,0.00017729562,0.00011021458,0.000059891918,0.00030234578,0.000020938578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017874,0.000003305414,0.0000011547336,0.000032911852,0.000008169999,0.0000053081853,0.00016586161,0.68758446,0.00005310609,0.0033744993,0.00005108835,0.30871835],"study_design_scores_gemma":[0.00009056747,0.00010322664,0.000006319428,0.0001916574,0.000009885389,0.00001364546,1.4320193e-7,0.9406639,0.0028808378,0.050703507,0.0049088206,0.0004275181],"about_ca_topic_score_codex":0.0000049244104,"about_ca_topic_score_gemma":0.000035066536,"teacher_disagreement_score":0.34308928,"about_ca_system_score_codex":0.00035099994,"about_ca_system_score_gemma":0.000079530015,"threshold_uncertainty_score":0.9999522},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026059666,0.0005390456,0.99626803,0.0005194089,0.0012361748,0.0007815853,0.000006794379,0.00019071167,0.00043216147],"genre_scores_gemma":[0.58423764,0.000055086228,0.41298205,0.0009803049,0.0013527261,0.000051750474,0.000005897304,0.000042856784,0.00029170388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99547625,0.000048386457,0.00079914206,0.0018672155,0.0008255143,0.0009834833],"domain_scores_gemma":[0.9973375,0.0006013203,0.00056369294,0.00092833675,0.00038293452,0.00018617277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013420584,0.0006785356,0.0008137718,0.0006549982,0.00028639546,0.0006887157,0.004196103,0.00047481034,0.000022520666],"category_scores_gemma":[0.00008884236,0.0006016803,0.00037017465,0.00052374176,0.00044488083,0.00043768305,0.0010885049,0.0009946259,0.000014865304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014680607,0.00003110769,0.00001904405,0.000030607407,0.0000319275,0.000065232634,0.00022316034,0.3896279,0.00009992065,0.18976912,0.00006791936,0.4200194],"study_design_scores_gemma":[0.00024122697,0.00014136545,0.000022282582,0.0004145246,0.00000862146,0.000074634394,4.664853e-8,0.98737794,0.00036287928,0.0077216774,0.0029325793,0.00070224947],"about_ca_topic_score_codex":0.000003878716,"about_ca_topic_score_gemma":0.00015762381,"teacher_disagreement_score":0.59775,"about_ca_system_score_codex":0.00034444884,"about_ca_system_score_gemma":0.00037023335,"threshold_uncertainty_score":0.99964345},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011124413,0.0005961581,0.9898218,0.0014823066,0.0024144317,0.00025190972,0.000002733479,0.00012303289,0.0051964135],"genre_scores_gemma":[0.02586865,0.00021848132,0.96907824,0.00380675,0.00044920936,0.000018881285,0.0000021923138,0.000058685997,0.00049891556],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563056,0.000117457,0.0006130644,0.0016695667,0.00106224,0.00090711564],"domain_scores_gemma":[0.99730486,0.00062517467,0.00021029529,0.0014031238,0.000269552,0.000186979],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002157488,0.0005797596,0.0006638596,0.0020387436,0.00022903123,0.00080218085,0.0032052393,0.0002302755,0.000014355201],"category_scores_gemma":[0.00015143414,0.0005511433,0.00013951541,0.0017660769,0.00057933043,0.0016093958,0.00097106415,0.0010452376,0.000037271642],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009309782,0.000031469914,0.00015809319,0.000041536878,0.00000767685,0.0003937033,0.0009805347,0.010647768,0.00019117126,0.019549552,0.000039314964,0.96794987],"study_design_scores_gemma":[0.0024189958,0.00048963685,0.0030107945,0.0033558195,0.000028096038,0.00187321,0.0000018135653,0.3417866,0.017631898,0.6137307,0.011015923,0.004656519],"about_ca_topic_score_codex":0.00006665935,"about_ca_topic_score_gemma":0.000046153695,"teacher_disagreement_score":0.9632934,"about_ca_system_score_codex":0.00044247642,"about_ca_system_score_gemma":0.00046465793,"threshold_uncertainty_score":0.999694},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052987004,0.00020966928,0.99561214,0.0003707174,0.00019907452,0.00027829246,0.000020737803,0.000040827497,0.0027386874],"genre_scores_gemma":[0.9140024,0.00003854636,0.08513591,0.00046141562,0.00007667259,0.000015658483,0.000021044507,0.000018235223,0.00023009663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976043,0.000032052736,0.0005241187,0.0007306292,0.0008279754,0.00028093424],"domain_scores_gemma":[0.9966499,0.0010508944,0.00043790173,0.0016215459,0.0001929329,0.000046819907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074530835,0.00026646742,0.00058414956,0.0011414299,0.0001403008,0.00010287881,0.0029809491,0.00012879581,0.000017028373],"category_scores_gemma":[0.000033628476,0.0001811598,0.00033023214,0.002092204,0.0008423353,0.00010618414,0.0005344216,0.00029158822,0.0000043921946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010859868,0.0001383985,0.00027059062,0.000035507837,0.00027378823,0.000014594222,0.00068337464,0.22485779,0.0009464744,0.35422584,0.00013956256,0.4184032],"study_design_scores_gemma":[0.00020436254,0.00007228132,0.0010329626,0.000089048546,0.00010144506,0.000003176567,1.0995199e-7,0.9152091,0.0050593643,0.077627406,0.00035687353,0.00024383307],"about_ca_topic_score_codex":0.00008083771,"about_ca_topic_score_gemma":0.000055889257,"teacher_disagreement_score":0.91347253,"about_ca_system_score_codex":0.000040644867,"about_ca_system_score_gemma":0.00014991546,"threshold_uncertainty_score":0.73874825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010590264,0.00013764677,0.99369186,0.00052409206,0.001372619,0.00086536777,0.000011738166,0.00027501848,0.0031110384],"genre_scores_gemma":[0.035859317,0.000025799809,0.9603595,0.0016829319,0.0003612519,0.000054247375,0.000032879263,0.00006454792,0.0015594861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961385,0.00003283872,0.00060764427,0.0014516636,0.0010420444,0.0007273242],"domain_scores_gemma":[0.99626476,0.0013041849,0.00045447022,0.0013875504,0.0004150579,0.00017395332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060954684,0.000482889,0.00045540766,0.00092438457,0.00048538126,0.00045063614,0.0027544734,0.00021236323,0.0000097928905],"category_scores_gemma":[0.00028201545,0.00047881206,0.00017126376,0.0005136511,0.00066534604,0.00069921673,0.0007010542,0.00070844346,0.000020467745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001092931,0.000009462705,0.000075554904,0.000025322308,0.000013014842,0.000047896334,0.001080621,0.97136706,0.0000129340415,0.0013165222,0.00016764957,0.025873005],"study_design_scores_gemma":[0.00043222838,0.00034233154,0.000104224215,0.00030253257,0.000007763867,0.000028900666,2.25028e-7,0.9799962,0.00065799465,0.0159685,0.0016719201,0.00048717894],"about_ca_topic_score_codex":0.000009979569,"about_ca_topic_score_gemma":0.0000047411318,"teacher_disagreement_score":0.035848726,"about_ca_system_score_codex":0.00034508941,"about_ca_system_score_gemma":0.0009248069,"threshold_uncertainty_score":0.99976635},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007929839,0.00017953571,0.9961273,0.0007154533,0.0004715572,0.0011623988,0.00001706181,0.00006319105,0.0004704823],"genre_scores_gemma":[0.9225347,0.00001308617,0.07619187,0.0006263636,0.00024069888,0.00008604534,0.000012198893,0.000024972462,0.0002700394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675626,0.0000648162,0.00062130584,0.0013654119,0.0006510709,0.00054113055],"domain_scores_gemma":[0.9967278,0.0018780599,0.00044486948,0.00074521935,0.00010750139,0.00009650388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011183076,0.00041525488,0.0005322364,0.0006646339,0.00017166004,0.00048324518,0.0014736616,0.00026441677,0.0000042039105],"category_scores_gemma":[0.00033552127,0.00042316888,0.000072109746,0.000313223,0.00030738572,0.0013493455,0.00067852763,0.00044139003,0.0000071258996],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001568217,0.000055978377,0.0033648422,0.00011062759,0.000013825774,0.000029782927,0.00079591916,0.026243748,0.0005675354,0.0040922756,0.000029641962,0.96468014],"study_design_scores_gemma":[0.0012276801,0.00015777064,0.0038945617,0.0006358542,0.0000069263124,0.00002241287,2.414575e-7,0.89964885,0.00040812278,0.090564325,0.0027770218,0.0006562627],"about_ca_topic_score_codex":0.00012837337,"about_ca_topic_score_gemma":0.000199777,"teacher_disagreement_score":0.9640239,"about_ca_system_score_codex":0.00037527646,"about_ca_system_score_gemma":0.00026909227,"threshold_uncertainty_score":0.999822},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018755019,0.001161291,0.104363106,0.003104941,0.0018408122,0.0006523911,0.000004066343,0.00008344241,0.88691443],"genre_scores_gemma":[0.96331024,0.00016909506,0.009754892,0.0027165422,0.0027808973,0.000017530918,0.000013860383,0.000060282448,0.02117664],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977346,0.000034786153,0.0003741469,0.00067670614,0.0005420974,0.00063762936],"domain_scores_gemma":[0.9989433,0.00033994313,0.00015239404,0.000381172,0.00007701578,0.00010615476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010934393,0.00028462242,0.00033134755,0.00032064551,0.00019925467,0.00058543,0.0012862128,0.00023358308,0.00004630469],"category_scores_gemma":[0.00010322961,0.00022288863,0.00011472747,0.0003423594,0.0011156469,0.000357537,0.00021490274,0.0005898778,0.000029091914],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036839451,0.000019300585,0.00069604674,0.000022626002,0.0000053065587,0.00006772288,0.0057772216,0.0262837,0.0000031716281,0.044871252,0.00012614056,0.92212385],"study_design_scores_gemma":[0.00027513015,0.00006224106,0.0005256684,0.00062461954,0.000012997501,0.0000076796405,0.000014672189,0.010842628,0.000060899663,0.24622276,0.7405785,0.0007722079],"about_ca_topic_score_codex":0.0005659125,"about_ca_topic_score_gemma":0.009544285,"teacher_disagreement_score":0.9614348,"about_ca_system_score_codex":0.0002619912,"about_ca_system_score_gemma":0.000472011,"threshold_uncertainty_score":0.9089135},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021973022,0.0003098406,0.9944902,0.00121504,0.0018312843,0.00032098984,0.0000033230804,0.00006766203,0.0015419301],"genre_scores_gemma":[0.7450351,0.00051382,0.23988722,0.0056086476,0.0015890946,0.000052870946,0.000008092509,0.00013078422,0.007174354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740463,0.000033928343,0.00044202013,0.0007835561,0.0007824156,0.00055343815],"domain_scores_gemma":[0.9976529,0.0005153418,0.00019037742,0.0014022228,0.00014868473,0.00009049737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007113613,0.00033725164,0.0003575602,0.00033026232,0.00023401783,0.0002464868,0.003412569,0.000121441066,0.0000034255734],"category_scores_gemma":[0.00013562864,0.00022626913,0.00015968077,0.0010500768,0.0004018363,0.0003995608,0.0010142326,0.00094675255,0.000022274606],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007339555,0.00005225348,0.00002713786,0.000034992852,0.000009944246,0.00004094062,0.0006688624,0.11411563,0.00021410773,0.042408243,0.00016826279,0.84225225],"study_design_scores_gemma":[0.00030219308,0.00016651483,0.0010205266,0.00063829834,0.000007345366,0.00003602404,1.2811647e-7,0.5342563,0.0020226194,0.41943347,0.04144254,0.00067405467],"about_ca_topic_score_codex":0.000026916458,"about_ca_topic_score_gemma":0.00020027999,"teacher_disagreement_score":0.84157825,"about_ca_system_score_codex":0.00024610932,"about_ca_system_score_gemma":0.0004070255,"threshold_uncertainty_score":0.92269874},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08843029,0.000047454858,0.90962404,0.000640175,0.00093201565,0.00017476326,3.45867e-7,0.00008536929,0.00006553011],"genre_scores_gemma":[0.69890827,0.000003071567,0.30062267,0.00034417445,0.00010754609,0.00000907073,1.6045757e-7,0.000004597062,4.2206378e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971715,0.00004614857,0.0003359346,0.00091711903,0.00085977773,0.00066950754],"domain_scores_gemma":[0.9988745,0.00014193774,0.00010074593,0.00050211314,0.00024237962,0.00013830977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001383622,0.00022681266,0.00020801014,0.00048775348,0.00020502233,0.0006777494,0.0019051266,0.00011988061,0.000018210647],"category_scores_gemma":[0.0003579934,0.00019799003,0.00003398027,0.0032186953,0.00028670693,0.0010415466,0.0002628261,0.0006545381,0.00002311439],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009322838,0.00025857284,0.050081465,0.000046208566,0.0000045310594,0.00003947721,0.0016778546,0.013612074,0.15558241,0.004956596,0.000012595593,0.7737189],"study_design_scores_gemma":[0.0006416186,0.00018567657,0.15518245,0.00013539991,0.0000026298467,0.00018186704,6.6371484e-7,0.7014056,0.08626322,0.055309568,0.000102905935,0.0005884143],"about_ca_topic_score_codex":0.00010527693,"about_ca_topic_score_gemma":0.0023146905,"teacher_disagreement_score":0.7731305,"about_ca_system_score_codex":0.0001564632,"about_ca_system_score_gemma":0.00047234696,"threshold_uncertainty_score":0.8073799},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016803671,0.0004087767,0.69492596,0.0017637307,0.0052970666,0.0010219322,0.000028800192,0.00015963046,0.29622605],"genre_scores_gemma":[0.4723196,0.00061510986,0.18672858,0.012571373,0.012879652,0.000101826394,0.00008601039,0.00019346236,0.31450438],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979022,0.000018961322,0.00025545282,0.00067599973,0.00061016314,0.0005372099],"domain_scores_gemma":[0.9983095,0.0007178115,0.00016723831,0.0002821528,0.00034718378,0.00017610831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060338195,0.0002723451,0.00035099397,0.00028575485,0.00020956284,0.00047694086,0.0008315905,0.0002661647,0.00004582593],"category_scores_gemma":[0.00039354147,0.00024723946,0.00011510309,0.00026801846,0.0011323402,0.0004640614,0.000118704025,0.00037235138,0.000016915063],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014650753,0.000015342592,0.000004592376,0.0000070955384,0.0000055967434,0.000009131004,0.00881918,0.00027293045,0.0000094532215,0.013735674,0.00011081327,0.9769955],"study_design_scores_gemma":[0.00024187798,0.00035178283,0.000043259224,0.00053431845,0.000014750073,0.0000040235236,0.000014577553,0.0019880596,0.00026847256,0.23888762,0.75698316,0.00066810154],"about_ca_topic_score_codex":0.00005292281,"about_ca_topic_score_gemma":0.0011260837,"teacher_disagreement_score":0.9763274,"about_ca_system_score_codex":0.00041003316,"about_ca_system_score_gemma":0.0008695057,"threshold_uncertainty_score":0.999998},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025372612,0.0016995195,0.9940162,0.000074306336,0.00024928848,0.0002880729,0.000004341578,0.000010095595,0.0011209727],"genre_scores_gemma":[0.41831756,0.0015826711,0.57328933,0.0026485913,0.0016625988,0.000041095453,0.00009972677,0.00015968604,0.002198745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982772,0.000014332039,0.00027318075,0.0006407499,0.00035435022,0.00044022268],"domain_scores_gemma":[0.9991604,0.000050049417,0.00013787823,0.00046890537,0.00012063178,0.00006214747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005045288,0.00025038724,0.00016857077,0.00013788052,0.00016226106,0.000089420195,0.0005971737,0.00021526498,0.0000029398946],"category_scores_gemma":[0.000027855534,0.0001798823,0.000040561517,0.00020031344,0.0006594183,0.000003999943,0.00022208308,0.00030763698,0.000002870538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017338507,0.000020570089,0.0018116432,0.000023729523,0.000013657654,0.000026498506,0.00013258767,0.20031616,0.0006543645,0.00018557513,0.000022471622,0.7967754],"study_design_scores_gemma":[0.0012267322,0.001146813,0.0075181522,0.00042079965,0.000021498157,0.00025525226,0.0000028514305,0.8903927,0.0016283775,0.020945184,0.07480441,0.0016371958],"about_ca_topic_score_codex":0.00003536661,"about_ca_topic_score_gemma":0.0027848552,"teacher_disagreement_score":0.7951382,"about_ca_system_score_codex":0.000076107295,"about_ca_system_score_gemma":0.0003086104,"threshold_uncertainty_score":0.73353875},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016194547,0.00030605483,0.9874403,0.00710233,0.0015111322,0.0020778521,0.0000083889545,0.0006747222,0.0007173154],"genre_scores_gemma":[0.0893577,0.00001914599,0.90611935,0.0011344028,0.000330914,0.00020556645,0.000008036867,0.000050288785,0.002774607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99482936,0.000020021624,0.0005790629,0.0021507493,0.001584953,0.00083588006],"domain_scores_gemma":[0.99742955,0.0002478627,0.00025359917,0.0009636296,0.0008872536,0.00021812749],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013738587,0.000595773,0.00055446493,0.001733827,0.0003495072,0.0011427002,0.0025010866,0.0003720773,0.0000019290303],"category_scores_gemma":[0.00026162327,0.00058366713,0.00009187354,0.0013089494,0.00025181338,0.0005713026,0.0016638035,0.0004876201,0.000026323669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016981849,0.000025067193,0.000023899587,0.000171303,0.0000329217,0.000031237632,0.000616681,0.17081288,0.000091472,0.123595014,0.000754849,0.7038277],"study_design_scores_gemma":[0.0008742838,0.0010542104,0.00030721864,0.0015382535,0.000040329036,0.00016015953,0.000002638017,0.6504795,0.0016661315,0.25613225,0.08597891,0.0017661175],"about_ca_topic_score_codex":0.000026159609,"about_ca_topic_score_gemma":0.000041672756,"teacher_disagreement_score":0.7020616,"about_ca_system_score_codex":0.0007449421,"about_ca_system_score_gemma":0.00024262705,"threshold_uncertainty_score":0.9998942},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016310852,0.00030430045,0.9939046,0.0010024826,0.00041034844,0.00044626696,0.00002522068,0.00016569092,0.0021100317],"genre_scores_gemma":[0.6566308,0.000079405356,0.33847454,0.0042363657,0.00038196717,0.000017201359,0.00012568434,0.000027437136,0.000026581649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657845,0.00002740673,0.0006685219,0.0012813777,0.0009647246,0.00047948744],"domain_scores_gemma":[0.9972263,0.00016483325,0.0005524517,0.0013609645,0.0005781031,0.000117325944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037268945,0.000522429,0.0005241072,0.0007308248,0.00020836749,0.0002995582,0.0030795936,0.00036890028,0.0000071549894],"category_scores_gemma":[0.000004678329,0.00045855614,0.0001161247,0.0009403352,0.0001786166,0.0018189612,0.0007361922,0.00050360634,0.00001584923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021479513,0.000050178136,0.0000133223275,0.000088414665,0.000011010288,0.000004485815,0.0020382844,0.16612314,0.017735494,0.018873498,0.0000011014549,0.7950396],"study_design_scores_gemma":[0.00021829207,0.000075845004,0.00018850197,0.00046523695,0.000015404989,0.0000075553057,6.4193904e-7,0.79525554,0.0049173613,0.19835399,0.00013240258,0.00036924114],"about_ca_topic_score_codex":0.00026944058,"about_ca_topic_score_gemma":0.0013001452,"teacher_disagreement_score":0.79467034,"about_ca_system_score_codex":0.00013784341,"about_ca_system_score_gemma":0.0003887282,"threshold_uncertainty_score":0.9997866},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042610918,0.0001668156,0.9876137,0.00548041,0.0041210875,0.0011345942,0.000019005676,0.000118208496,0.0009200928],"genre_scores_gemma":[0.08258603,0.000006572194,0.9099082,0.003065277,0.0016040138,0.000058004756,0.000006414754,0.00006795699,0.0026975414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99341714,0.0002930715,0.0009383694,0.0022604696,0.001980081,0.0011108662],"domain_scores_gemma":[0.99306095,0.0014762817,0.00055177056,0.0040313085,0.00056078006,0.0003189273],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002386672,0.00069707626,0.0009849613,0.0008039648,0.00031746156,0.0004785725,0.012324418,0.00041612098,0.000011161783],"category_scores_gemma":[0.0007308828,0.0005111477,0.00035760188,0.0035735136,0.001053114,0.00036707317,0.006846793,0.0011152002,0.00005418435],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065597587,0.00012597669,0.0002780018,0.000093785886,0.000022232754,0.000029292609,0.0017466188,0.04201342,0.00021394492,0.0017669658,0.0023423992,0.9513608],"study_design_scores_gemma":[0.0008130151,0.0012460105,0.0042083883,0.0010984322,0.00004452844,0.00018713187,6.120915e-7,0.75506216,0.00732693,0.17696679,0.05098251,0.0020634844],"about_ca_topic_score_codex":0.000047090398,"about_ca_topic_score_gemma":0.00031065123,"teacher_disagreement_score":0.9492973,"about_ca_system_score_codex":0.00074707303,"about_ca_system_score_gemma":0.0024142817,"threshold_uncertainty_score":0.999734},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019598089,0.0010271146,0.99572927,0.0010517668,0.00036135837,0.0003374576,0.000013857067,0.00007160879,0.001211612],"genre_scores_gemma":[0.057102002,0.000047563826,0.9417717,0.00025682946,0.0004076546,0.00002578066,0.000017886785,0.000018545381,0.00035206752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757266,0.00004447739,0.0005300485,0.0009297708,0.0005662521,0.00035681773],"domain_scores_gemma":[0.9976622,0.00024294204,0.00017345254,0.0015114973,0.00031996568,0.00008994281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042390972,0.00030249203,0.00029312048,0.0004290763,0.00054681115,0.00021668436,0.0028551356,0.00016655104,0.000017749659],"category_scores_gemma":[0.000020868549,0.00023537458,0.00011814768,0.00071589154,0.0008348866,0.00057285867,0.00069182954,0.00044220005,0.000012069682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.682953e-7,0.000046075962,0.000031943622,0.0000059842187,0.000006606158,0.0000067352257,0.000106280306,0.89575595,0.00009281229,0.02668343,0.00006156894,0.07720187],"study_design_scores_gemma":[0.00009119692,0.000060244878,0.0016814842,0.000059162106,0.000009110682,0.000045229343,1.5055906e-7,0.93398416,0.000118752265,0.06320289,0.00047524294,0.00027236433],"about_ca_topic_score_codex":0.00013577676,"about_ca_topic_score_gemma":0.00007334453,"teacher_disagreement_score":0.07692951,"about_ca_system_score_codex":0.00015994335,"about_ca_system_score_gemma":0.00060939323,"threshold_uncertainty_score":0.9598297},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010254856,0.0014485393,0.99590075,0.00032577806,0.0007104413,0.0006653761,0.0000051498037,0.0003838134,0.00045761367],"genre_scores_gemma":[0.02373939,0.000019330837,0.9744682,0.00071901164,0.00030112473,0.000030307883,0.000018747263,0.00003330122,0.0006706247],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966757,0.000016094522,0.00052607094,0.0014583978,0.00073891174,0.00058480114],"domain_scores_gemma":[0.99818045,0.00032242943,0.00025762012,0.0008935084,0.00024401514,0.00010198278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073317194,0.00048108818,0.0004190104,0.00071824394,0.00031623355,0.00097034004,0.0030112327,0.00033548995,0.000008341229],"category_scores_gemma":[0.00009372988,0.00042877224,0.000102176666,0.00044978614,0.00036922778,0.0011213478,0.00071471615,0.0005081689,0.000011130507],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013552675,0.00002295632,0.0000027557353,0.000049397186,0.0000071972117,0.000019155508,0.00088164536,0.0036061679,0.0003017741,0.035563912,0.000017424503,0.9595141],"study_design_scores_gemma":[0.00049849955,0.0003664486,0.000011681756,0.0010836725,0.0000140171815,0.000101393445,3.4060798e-7,0.23639987,0.11176525,0.64036244,0.007679954,0.0017164294],"about_ca_topic_score_codex":0.0000075007583,"about_ca_topic_score_gemma":0.000048198635,"teacher_disagreement_score":0.95779765,"about_ca_system_score_codex":0.00048680196,"about_ca_system_score_gemma":0.0024005792,"threshold_uncertainty_score":0.9998164},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046827006,0.001615698,0.9911026,0.00018444784,0.0017065585,0.0004779252,0.0000021595285,0.000072721894,0.00015521266],"genre_scores_gemma":[0.9713034,0.000022316659,0.027552301,0.0004444062,0.00041595238,0.0000076108413,0.0000065541926,0.000022908534,0.00022453937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969495,0.00008473353,0.0006821548,0.0008999079,0.0009758811,0.00040784507],"domain_scores_gemma":[0.99802256,0.00020885142,0.0005175666,0.00087303657,0.00031182723,0.00006618147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000639778,0.00038205183,0.00042420442,0.00037297985,0.0003129316,0.00029907146,0.0017719627,0.000261199,0.0000062891827],"category_scores_gemma":[0.00004937952,0.00028168602,0.0001960517,0.00082801824,0.0004070809,0.00036182674,0.0008132338,0.00042373867,0.000002697973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009621991,0.000015534493,0.000022291391,0.000015962722,0.00000781904,0.0000041881904,0.00015000661,0.75430053,0.0004958783,0.0022072713,0.000010906201,0.24275996],"study_design_scores_gemma":[0.0003150164,0.00006253466,0.00015886455,0.0003365759,0.000010349339,0.000026943733,5.9797514e-8,0.9801147,0.0066724713,0.011624983,0.00034855265,0.00032896295],"about_ca_topic_score_codex":0.0000218377,"about_ca_topic_score_gemma":0.00008392786,"teacher_disagreement_score":0.9666207,"about_ca_system_score_codex":0.00021637462,"about_ca_system_score_gemma":0.00033166603,"threshold_uncertainty_score":0.9999635},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011931005,0.00024082912,0.9854601,0.0061816536,0.0051458995,0.0015208541,0.00001676053,0.0006903412,0.0006242437],"genre_scores_gemma":[0.034154277,0.000009012895,0.9551392,0.0072377943,0.0023656315,0.0000651399,0.00003271483,0.00008787309,0.0009083464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99227214,0.000019490339,0.00091023126,0.0028358528,0.0022841126,0.0016781829],"domain_scores_gemma":[0.9945683,0.00064320565,0.0003823469,0.0024113245,0.0015712734,0.00042358018],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002460433,0.0010047498,0.0008552011,0.002089167,0.000550553,0.0016876087,0.0068214647,0.0010400083,0.000008355172],"category_scores_gemma":[0.0007943951,0.00097647595,0.00022217572,0.0020475416,0.0004401972,0.0009023279,0.0032451903,0.0014476299,0.000028991557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007577514,0.000012365651,0.000012931754,0.000012526006,0.000012015322,0.000018874503,0.0003941829,0.4108513,0.00073571183,0.010832129,0.0013919284,0.57571846],"study_design_scores_gemma":[0.00032926374,0.00033072731,0.00012713339,0.00025551612,0.0000126778,0.00010102773,4.6286928e-7,0.93525344,0.0010008186,0.026542867,0.03485535,0.0011907287],"about_ca_topic_score_codex":0.000022434017,"about_ca_topic_score_gemma":0.00031152565,"teacher_disagreement_score":0.57452774,"about_ca_system_score_codex":0.0008476831,"about_ca_system_score_gemma":0.00052024436,"threshold_uncertainty_score":0.99934876},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050937415,0.0006037529,0.9846927,0.0004386764,0.0009364192,0.00033229488,0.0000059843273,0.00020363723,0.01273561],"genre_scores_gemma":[0.17231491,0.0002595188,0.8241007,0.002143824,0.0005687317,0.000018316441,0.00001771014,0.000043824435,0.0005325109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552923,0.0000361972,0.00056933484,0.0019469812,0.0011622007,0.00075605285],"domain_scores_gemma":[0.9968464,0.00033799614,0.0002783279,0.0020930003,0.0002239936,0.00022031569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059374707,0.0005668929,0.00079643,0.0015006168,0.00035780168,0.0004925074,0.0042355345,0.00031768938,0.000035314784],"category_scores_gemma":[0.00006651642,0.0004706762,0.00035062214,0.002198858,0.00090609636,0.00044054736,0.0012491412,0.00070675294,0.000090514746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004501653,0.00006567132,0.0001396106,0.0000337505,0.000100118785,0.0004097119,0.0009782276,0.1463739,0.000005470676,0.016485067,0.00013490951,0.8352691],"study_design_scores_gemma":[0.00017628435,0.00015206153,0.0005167104,0.00006889055,0.000060487484,0.000089844645,3.6553523e-8,0.8708769,0.000033707624,0.12412851,0.003101968,0.0007945899],"about_ca_topic_score_codex":0.000039758506,"about_ca_topic_score_gemma":0.0001179747,"teacher_disagreement_score":0.8344745,"about_ca_system_score_codex":0.00026514241,"about_ca_system_score_gemma":0.00046729093,"threshold_uncertainty_score":0.9997745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009625756,0.00026890798,0.99513793,0.0008532366,0.0019896997,0.0005341812,0.00004575673,0.00013400558,0.0010266518],"genre_scores_gemma":[0.0004902474,0.0000240715,0.99682635,0.0017536175,0.00037110155,0.000067184024,0.000026061416,0.000036808182,0.00040456853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965481,0.000047521833,0.0005377715,0.0017088845,0.00047304184,0.0006846372],"domain_scores_gemma":[0.99702394,0.0006729478,0.00029580016,0.001600024,0.0002215979,0.00018568992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015284303,0.00047095522,0.00047742284,0.0005057807,0.0003444716,0.00072059233,0.0033138662,0.00026042975,0.000018477172],"category_scores_gemma":[0.00010629503,0.00044988733,0.00016805728,0.0003931405,0.0003103428,0.00047528927,0.00087745895,0.00043109152,0.000012287848],"study_design_candidate":"design_other","study_design_consensus":null,"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.3512543e-7,0.000017246424,0.000007741018,0.000024495705,0.000010899128,0.000007929607,0.00029775474,0.0011369566,0.0001340952,0.02498415,0.00009550793,0.9732824],"study_design_scores_gemma":[0.00033449143,0.00017254576,0.000019990366,0.00028740114,0.000020103573,0.00008325583,3.347378e-7,0.8102114,0.0033014014,0.14121516,0.04344239,0.0009115024],"about_ca_topic_score_codex":0.000019130699,"about_ca_topic_score_gemma":0.00002103079,"teacher_disagreement_score":0.97237086,"about_ca_system_score_codex":0.00023829678,"about_ca_system_score_gemma":0.00037794939,"threshold_uncertainty_score":0.99979526},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023610894,0.000671471,0.99432063,0.00044542382,0.0023624718,0.0002732658,0.0000036659228,0.00055508723,0.0013443881],"genre_scores_gemma":[0.0074634985,0.00021979124,0.9904845,0.0007546639,0.00047697077,0.000008400645,0.0000051310767,0.00003815648,0.00054891536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964744,0.000048431913,0.00048905937,0.0014650249,0.00085580844,0.00066729874],"domain_scores_gemma":[0.9969294,0.000989769,0.00019636318,0.0014639888,0.00027112116,0.00014937432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008238141,0.0005099835,0.00055548124,0.0005832963,0.00025747417,0.00028743048,0.002754126,0.0003440077,0.000011735729],"category_scores_gemma":[0.00055987225,0.00048580053,0.00010678675,0.00045413797,0.00064536254,0.00066171587,0.0008001678,0.00080999854,0.000054498654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019087802,0.000011721882,0.0000051799007,0.000022145994,0.000008420036,0.00017261352,0.00036929004,0.64778584,0.0011496007,0.014708486,0.00010335894,0.33566144],"study_design_scores_gemma":[0.00027698788,0.00018521804,0.00005178129,0.00022454052,0.000006736815,0.00033239552,4.9749918e-8,0.8416157,0.011920283,0.13901225,0.005229196,0.0011448804],"about_ca_topic_score_codex":0.000004757205,"about_ca_topic_score_gemma":0.00001653495,"teacher_disagreement_score":0.33451656,"about_ca_system_score_codex":0.00027620883,"about_ca_system_score_gemma":0.00046101047,"threshold_uncertainty_score":0.9997594},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035206126,0.00009793336,0.9921358,0.0013305609,0.00129532,0.0003928663,0.000002522373,0.0003647435,0.00085959135],"genre_scores_gemma":[0.24602483,0.00003305232,0.7499091,0.0034481562,0.0003216299,0.000020260304,0.000014383612,0.000047535887,0.00018105794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954335,0.000048680864,0.0007649539,0.0017306745,0.0013253752,0.00069679914],"domain_scores_gemma":[0.9975072,0.00023162091,0.00028541076,0.0014882707,0.000245597,0.00024187536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016102035,0.0005109394,0.00066659297,0.0021194168,0.00022160557,0.00056542514,0.0029665749,0.00042838787,0.000027865875],"category_scores_gemma":[0.00011185779,0.00048204328,0.0001268377,0.0018938859,0.00024415023,0.0006767108,0.0009627251,0.00094392383,0.000026809146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022915488,0.00016345407,0.0015884197,0.00006852564,0.000029335073,0.0007466364,0.016070541,0.32396433,0.003899689,0.023072584,0.00008977854,0.6302838],"study_design_scores_gemma":[0.0002842641,0.00010155094,0.0007244611,0.0003402776,0.0000086603395,0.000024696672,0.0000011039161,0.9355942,0.001112682,0.057360083,0.0035253859,0.0009226606],"about_ca_topic_score_codex":0.00004279881,"about_ca_topic_score_gemma":0.0007536301,"teacher_disagreement_score":0.62936115,"about_ca_system_score_codex":0.00031669636,"about_ca_system_score_gemma":0.00047264103,"threshold_uncertainty_score":0.99976313},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017752015,0.00026910828,0.99290943,0.001092701,0.0009113485,0.0024370207,0.0000026910589,0.000279874,0.0019202885],"genre_scores_gemma":[0.18172175,0.00006137111,0.8074661,0.0042766975,0.0037094813,0.000604638,0.000012196179,0.00012959514,0.0020181665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540114,0.000047998787,0.00057344843,0.0018625198,0.0012187895,0.0008961175],"domain_scores_gemma":[0.9977473,0.00028323603,0.00022361545,0.0012185099,0.00029115804,0.00023618623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086852507,0.00068098056,0.0006314483,0.0007120229,0.000385846,0.0008428928,0.0026627595,0.0004126696,0.000045230183],"category_scores_gemma":[0.000016350243,0.0004947917,0.00015122048,0.0007070298,0.00037345756,0.00086121494,0.0007583972,0.0011146528,0.00004156561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015509033,0.000019024836,0.0000035402963,0.000016832282,0.000009408973,0.000025263043,0.00020147914,0.65842986,0.0000050013223,0.0013393135,0.000022190732,0.3399126],"study_design_scores_gemma":[0.00051396404,0.00023052428,0.000006380761,0.0006209649,0.00000831664,0.000113539085,8.025223e-8,0.98481953,0.0000805053,0.008801375,0.00406744,0.0007374037],"about_ca_topic_score_codex":0.00001733595,"about_ca_topic_score_gemma":0.00025249145,"teacher_disagreement_score":0.3391752,"about_ca_system_score_codex":0.00032716754,"about_ca_system_score_gemma":0.0007932699,"threshold_uncertainty_score":0.9997504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039027607,0.00016718185,0.9953354,0.0002972824,0.00020389855,0.0003804253,0.0000016624039,0.00037665767,0.0031984474],"genre_scores_gemma":[0.17859015,0.000008755426,0.82073224,0.000425486,0.00012851007,0.000008289098,0.00002867763,0.00004375707,0.00003412293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822843,0.000025540192,0.0003391967,0.0005819369,0.00047961914,0.00034529218],"domain_scores_gemma":[0.99885994,0.0002012464,0.00012959291,0.0004396468,0.00028867973,0.00008090026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052622135,0.00035160084,0.00027521586,0.000525222,0.00015402661,0.00020234137,0.00045784056,0.00023324297,0.000017487911],"category_scores_gemma":[0.000030659114,0.0003363959,0.00003811164,0.0005205062,0.00017830505,0.00023318703,0.00004142237,0.0004576278,0.000011204862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032664109,0.0000073201554,0.000020013402,0.000051741572,0.0000046600953,0.000004357086,0.000132886,0.8409003,0.0001582562,0.0005821121,0.0000038287317,0.15813123],"study_design_scores_gemma":[0.00021452243,0.00009789421,0.000115245755,0.0005984296,0.000012794353,0.000016631406,1.5501094e-7,0.98598105,0.0015461913,0.010941956,0.000066781366,0.00040835678],"about_ca_topic_score_codex":0.000004703881,"about_ca_topic_score_gemma":0.000036597183,"teacher_disagreement_score":0.17855112,"about_ca_system_score_codex":0.00045156715,"about_ca_system_score_gemma":0.0002444934,"threshold_uncertainty_score":0.9999088},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016301294,0.00013110161,0.9965059,0.0011033148,0.0006782559,0.0010690567,0.000011613844,0.00007429116,0.00041016375],"genre_scores_gemma":[0.0136410855,0.000007241003,0.9835387,0.0026028487,0.000110910034,0.00003475318,0.000021512313,0.000024473635,0.000018474493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962217,0.00024132765,0.0005334803,0.0013844403,0.0011217201,0.0004973009],"domain_scores_gemma":[0.98958224,0.008749398,0.0003392095,0.00061267964,0.0005791109,0.00013738517],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0075821523,0.0004128425,0.00041615588,0.0008772648,0.00031491194,0.00036421182,0.0009284593,0.00014302893,0.000023509687],"category_scores_gemma":[0.0011206694,0.00036196556,0.00009554652,0.00041144702,0.00039641847,0.0007831683,0.00033016733,0.00042674068,0.0000055891023],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034035085,0.000013938951,5.705676e-7,0.000018272473,0.000005536396,0.0000029656096,0.0022082273,0.034310088,0.00008026698,0.18761714,0.0000041507337,0.7757048],"study_design_scores_gemma":[0.0006067855,0.0003159731,0.000018206703,0.0001483681,0.000010565947,0.0000037943523,0.0000081193775,0.6356393,0.0019000662,0.36095408,0.000118774784,0.00027595987],"about_ca_topic_score_codex":0.0000051214743,"about_ca_topic_score_gemma":0.000013228997,"teacher_disagreement_score":0.77542883,"about_ca_system_score_codex":0.0003057472,"about_ca_system_score_gemma":0.00043053474,"threshold_uncertainty_score":0.99988323},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050711504,0.00005574535,0.9872961,0.007614876,0.002083653,0.0005163808,0.000028642226,0.00088548195,0.0010119756],"genre_scores_gemma":[0.23030205,0.000025205052,0.76825255,0.0011016553,0.00015149562,0.00001585829,0.000026828622,0.00004801186,0.000076319935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99451876,0.000040818886,0.0005266606,0.0023574566,0.0016897442,0.00086655415],"domain_scores_gemma":[0.9859261,0.00080598646,0.0004260034,0.012478002,0.00020804709,0.00015586277],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00060143665,0.000787147,0.0006202041,0.0013546427,0.00040962012,0.0009972327,0.043233108,0.0008985669,0.00005773734],"category_scores_gemma":[0.0039665685,0.00071189535,0.00015124594,0.0006166277,0.0010961203,0.0009522908,0.0505763,0.0020224184,0.00004278055],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000313427,0.00012721159,0.00017188798,0.00011444024,0.000027108097,0.00009878897,0.00031704307,0.080284834,0.0018953553,0.04766376,0.0017724651,0.8674958],"study_design_scores_gemma":[0.00018081711,0.00006625096,0.00006397511,0.00016513965,0.000004176874,0.0000050897665,1.6123925e-8,0.53617454,0.0061525987,0.45667863,0.00009107619,0.00041771238],"about_ca_topic_score_codex":0.000012833006,"about_ca_topic_score_gemma":0.00005922707,"teacher_disagreement_score":0.86707807,"about_ca_system_score_codex":0.00031122164,"about_ca_system_score_gemma":0.0006659513,"threshold_uncertainty_score":0.99953324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014432413,0.00050307316,0.9544664,0.00035667047,0.0016058354,0.00058829883,0.0000068988347,0.00048193862,0.04197646],"genre_scores_gemma":[0.16434263,0.000032457796,0.8327142,0.00081871817,0.00074484537,0.00003043648,0.000005762538,0.00005391401,0.0012570339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957862,0.00005000005,0.0006618076,0.0017508037,0.0009945257,0.0007566898],"domain_scores_gemma":[0.997359,0.00029818405,0.0003841888,0.0015814597,0.00022848112,0.00014869789],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011027127,0.0006207142,0.00064463995,0.0009330256,0.0002628555,0.0006900563,0.0037062017,0.0004038806,0.000010267595],"category_scores_gemma":[0.000024932688,0.0005482723,0.00018018427,0.00058774196,0.000413033,0.0007369072,0.001507521,0.0009016246,0.000039954382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004861342,0.00005539807,0.00014602319,0.00007212382,0.000022418735,0.0002811068,0.00033308082,0.005593909,0.00037380643,0.1267206,0.0007651076,0.8656316],"study_design_scores_gemma":[0.00027540335,0.00031798234,0.00005454028,0.00071389735,0.000008136131,0.00015077062,1.4307021e-7,0.7259902,0.0059674457,0.2549343,0.010303941,0.0012832499],"about_ca_topic_score_codex":0.00007061004,"about_ca_topic_score_gemma":0.000082230945,"teacher_disagreement_score":0.8643483,"about_ca_system_score_codex":0.00037861397,"about_ca_system_score_gemma":0.0006008747,"threshold_uncertainty_score":0.99969685},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029634683,0.00058828935,0.9960244,0.0010906091,0.0003563869,0.00035044074,0.000030478903,0.00020067311,0.0013290318],"genre_scores_gemma":[0.08517775,0.0000126372,0.9122562,0.0010456722,0.00029237015,0.000019428433,0.000025042764,0.00003100058,0.0011398983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591726,0.00006138519,0.0006144913,0.0017532338,0.00084219733,0.0008114473],"domain_scores_gemma":[0.99645543,0.0014789738,0.00041235567,0.0011784543,0.0002731472,0.00020162361],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022631043,0.0005592704,0.00076851586,0.0013960155,0.00043508768,0.0005516881,0.0028472021,0.00035223842,0.000010631764],"category_scores_gemma":[0.00015225845,0.0005306938,0.00037186692,0.0011687374,0.00035561496,0.00063389644,0.0004730444,0.00073210616,0.000011806492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060743428,0.000014851551,0.000009067245,0.000022093296,0.000069820686,0.000008402889,0.0126036415,0.76149887,0.000009007667,0.026302448,0.000040132938,0.1994156],"study_design_scores_gemma":[0.00021116012,0.000073642,0.0000071938366,0.00019263003,0.000070303104,0.0000072204525,8.426256e-7,0.8978344,0.00008491503,0.100551546,0.00038038142,0.0005857707],"about_ca_topic_score_codex":0.000019942752,"about_ca_topic_score_gemma":0.000097813514,"teacher_disagreement_score":0.19882983,"about_ca_system_score_codex":0.00029486153,"about_ca_system_score_gemma":0.0006527848,"threshold_uncertainty_score":0.99971443},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003944661,0.00090945995,0.99283946,0.003125134,0.0010896075,0.001577293,0.00001436269,0.00031256911,0.00009268869],"genre_scores_gemma":[0.020041367,0.00007249612,0.9776066,0.0015342474,0.00025739043,0.000108915985,0.0000039565775,0.000055674158,0.00031937828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938782,0.00040990795,0.001157913,0.002005741,0.0012175967,0.00133065],"domain_scores_gemma":[0.99298483,0.0039778766,0.00045333197,0.0018265614,0.00055533927,0.00020205429],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0039234874,0.0008059569,0.0007485476,0.000674027,0.00091635506,0.0015581927,0.004697923,0.0005302365,0.00003867535],"category_scores_gemma":[0.0008886523,0.0006611515,0.00019624963,0.0016989636,0.0011373255,0.0012785776,0.00071112625,0.0015971316,0.00007426748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058266793,0.00008061441,0.00005385586,0.000028057359,0.000023834664,0.00013135085,0.00573308,0.42020193,0.00004064591,0.0031314164,0.00025740638,0.5702595],"study_design_scores_gemma":[0.00094150106,0.0007135241,0.00016056797,0.0012622412,0.00003277898,0.000104960905,0.000009225844,0.72730684,0.0027992784,0.26033023,0.0042068525,0.0021320104],"about_ca_topic_score_codex":0.000016479951,"about_ca_topic_score_gemma":0.0004091188,"teacher_disagreement_score":0.5681275,"about_ca_system_score_codex":0.0007453423,"about_ca_system_score_gemma":0.0022513166,"threshold_uncertainty_score":0.99958396},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008050738,0.0008878998,0.9954581,0.00023198406,0.0014200393,0.0008533081,0.000013450568,0.0005044585,0.0005502459],"genre_scores_gemma":[0.059273284,0.000069535985,0.93962145,0.00073691097,0.00020301946,0.000024123654,0.000004544367,0.000040885327,0.000026236608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622685,0.000025906887,0.00050853426,0.0018678035,0.00054932537,0.000821563],"domain_scores_gemma":[0.99810904,0.00033103046,0.00026268465,0.0009015889,0.00020406878,0.00019158128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050185964,0.0006100565,0.0005878038,0.0005412682,0.00043100494,0.00073831726,0.0018984794,0.00036450254,0.000003196597],"category_scores_gemma":[0.0000569507,0.0005475936,0.00012440055,0.00040900055,0.00052747893,0.0005052915,0.0014387901,0.0004979654,0.000007373654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005741197,0.000027795379,0.000022156366,0.00008318477,0.000017678305,0.00009329986,0.0015055666,0.10904447,0.00003284597,0.001824451,0.0000049855626,0.8873378],"study_design_scores_gemma":[0.000647561,0.00023185075,0.0005086874,0.0003399969,0.000009816039,0.00013624737,4.215382e-7,0.9494099,0.00010529701,0.047874127,0.000109789806,0.0006263043],"about_ca_topic_score_codex":0.000058316084,"about_ca_topic_score_gemma":0.00007980592,"teacher_disagreement_score":0.88671154,"about_ca_system_score_codex":0.00036089844,"about_ca_system_score_gemma":0.00042417002,"threshold_uncertainty_score":0.99969757},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052321623,0.0022917045,0.9866392,0.0034047097,0.000389963,0.0009640007,0.000071922106,0.000019176614,0.0009871569],"genre_scores_gemma":[0.82257795,0.0010449636,0.1751253,0.0006645126,0.00027556714,0.000033614346,0.000070958056,0.000036964168,0.00017016877],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99868554,0.000020039268,0.00022892888,0.0005304183,0.00024778867,0.00028729226],"domain_scores_gemma":[0.99912965,0.000058800626,0.00009535186,0.00049493846,0.00012174288,0.0000995047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002590895,0.00021001413,0.00018888024,0.00021922891,0.00020573862,0.000032719985,0.00051118655,0.0001411504,0.000008034641],"category_scores_gemma":[0.000030178424,0.0001628291,0.000077806464,0.00015906658,0.00047669397,0.0000050402837,0.0004702457,0.00017541036,0.0000039281663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048919388,0.00016102781,0.00061919104,0.000114504866,0.00017669595,0.000027037462,0.0027104025,0.031539943,0.15132652,0.00070136273,0.0012616266,0.81131274],"study_design_scores_gemma":[0.008738092,0.011619189,0.027655194,0.0032721623,0.0005265855,0.0032682063,0.000021743852,0.1552,0.3515679,0.19712187,0.23046967,0.010539384],"about_ca_topic_score_codex":0.000033623317,"about_ca_topic_score_gemma":0.00040974852,"teacher_disagreement_score":0.8173458,"about_ca_system_score_codex":0.000032813325,"about_ca_system_score_gemma":0.00013667758,"threshold_uncertainty_score":0.6639978},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003639541,0.0029676184,0.98788047,0.00043021957,0.00095875264,0.0011271504,0.000008773011,0.00018785146,0.00607522],"genre_scores_gemma":[0.72325194,0.000071575516,0.2751273,0.00076035794,0.0005483939,0.000069378395,0.0000058785818,0.000048121463,0.00011707827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99530077,0.00008848121,0.0007980526,0.0020051943,0.00090342714,0.0009040632],"domain_scores_gemma":[0.9947606,0.0030062716,0.00040420616,0.0013277851,0.000320873,0.00018028397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037715435,0.00059233303,0.0008122286,0.0012547654,0.00020431935,0.00047273716,0.00272801,0.00047743053,0.000012733565],"category_scores_gemma":[0.00032510745,0.00057294243,0.00020031293,0.0005780557,0.0004200612,0.0010214333,0.000812411,0.0007288035,0.000023181095],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013259767,0.000040185587,0.00026496252,0.00016302225,0.00001033677,0.000055077497,0.0023618687,0.00063491106,0.00013558373,0.0045380513,0.000004351314,0.9917784],"study_design_scores_gemma":[0.0034449531,0.0014788656,0.0028343564,0.0058103665,0.00004477468,0.00046872118,0.00004571735,0.6169686,0.021597037,0.3349825,0.0072705043,0.0050536105],"about_ca_topic_score_codex":0.0000815274,"about_ca_topic_score_gemma":0.0037829932,"teacher_disagreement_score":0.9867248,"about_ca_system_score_codex":0.0004943304,"about_ca_system_score_gemma":0.00044200692,"threshold_uncertainty_score":0.9996722},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069366855,0.00021368296,0.990192,0.0016078025,0.002426523,0.00070798816,0.0000043775967,0.00019890131,0.0039550564],"genre_scores_gemma":[0.51312655,0.00007225907,0.4766379,0.009055834,0.0007924507,0.00002833736,0.0000049497885,0.00007675976,0.0002049504],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99531484,0.000045013374,0.00058935443,0.0018814047,0.0012928373,0.0008765686],"domain_scores_gemma":[0.996665,0.00087542366,0.00024592353,0.0017188092,0.00017759071,0.00031727337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009489031,0.0006769136,0.00071350246,0.0015789336,0.0003800905,0.0008740789,0.003925753,0.00029883618,0.00003728049],"category_scores_gemma":[0.00013700491,0.0005685809,0.00027984747,0.0010160785,0.00045009478,0.00047240208,0.0012182392,0.0010607769,0.00018506208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011948019,0.00011168097,0.00004588288,0.00007690531,0.000045738514,0.0004890093,0.0018550815,0.23959404,0.00034632877,0.2632709,0.00007233652,0.4939726],"study_design_scores_gemma":[0.0038332827,0.0009673889,0.00041452618,0.0031956255,0.000025693045,0.00015691263,2.0727275e-7,0.08359817,0.0046009645,0.8965509,0.004430934,0.0022254304],"about_ca_topic_score_codex":0.000026517067,"about_ca_topic_score_gemma":0.000038140533,"teacher_disagreement_score":0.63328,"about_ca_system_score_codex":0.00037132323,"about_ca_system_score_gemma":0.00043053212,"threshold_uncertainty_score":0.9996766},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011739788,0.0010355338,0.9862227,0.0008833921,0.00080736337,0.00027805613,0.000002432668,0.00075882475,0.009999996],"genre_scores_gemma":[0.0541305,0.000033888267,0.9398737,0.004487477,0.00033658434,0.000009029248,0.000002099424,0.000051455125,0.0010752507],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99589175,0.000021536722,0.00043344698,0.0017512909,0.0011857739,0.00071618357],"domain_scores_gemma":[0.99717766,0.00042647822,0.000296328,0.0017182729,0.00021572408,0.00016550913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005769423,0.00060191785,0.000503645,0.0010450062,0.00024498889,0.0007295417,0.0052219066,0.00041048936,0.00005001495],"category_scores_gemma":[0.00015806274,0.0005148426,0.00013334298,0.0006740816,0.00044649185,0.000605794,0.001480804,0.0012954166,0.00011996144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000261606,0.00001908273,0.00000288712,0.00002450563,0.000005133099,0.00015493385,0.0003831889,0.0006260947,0.00021230067,0.29948932,0.00017559422,0.69890434],"study_design_scores_gemma":[0.00012553217,0.00022683425,0.0000045301645,0.00055098825,0.0000041084218,0.00010707261,1.6363323e-8,0.10582257,0.0054265107,0.8859702,0.001047025,0.0007146072],"about_ca_topic_score_codex":0.000014398188,"about_ca_topic_score_gemma":0.000008793168,"teacher_disagreement_score":0.69818974,"about_ca_system_score_codex":0.00039298434,"about_ca_system_score_gemma":0.00018300457,"threshold_uncertainty_score":0.9997303},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000082593015,0.00023429074,0.9948446,0.0010456691,0.0010912938,0.0007354366,0.00004028158,0.00021399229,0.0017861833],"genre_scores_gemma":[0.0025132739,0.00012887502,0.99425465,0.0015306261,0.0005781535,0.000017975452,0.00005634356,0.00004261347,0.00087751023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963467,0.0000306561,0.00052268413,0.0014669863,0.0008644179,0.0007685402],"domain_scores_gemma":[0.9976323,0.00057851244,0.00019047577,0.0010775919,0.0002634439,0.00025766462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006987557,0.00047702706,0.00047188066,0.0007538969,0.000315792,0.0005811883,0.0030573916,0.00030156958,0.000054567983],"category_scores_gemma":[0.00009263684,0.00043326293,0.00015394036,0.0004630051,0.00041640765,0.0006260856,0.0006559148,0.00072405546,0.000032474596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002244481,0.000043561045,0.0000034689933,0.000015776151,0.0000062472363,0.000015339689,0.00038537433,0.16998653,0.000009943427,0.002570368,0.000022415721,0.82693875],"study_design_scores_gemma":[0.00039532283,0.00016016874,0.000009781531,0.00017979444,0.0000040552027,0.000020677184,1.005091e-7,0.9374744,0.00012962638,0.0556607,0.0054911072,0.0004742178],"about_ca_topic_score_codex":0.000034022676,"about_ca_topic_score_gemma":0.00008864229,"teacher_disagreement_score":0.82646453,"about_ca_system_score_codex":0.00020762425,"about_ca_system_score_gemma":0.0005811708,"threshold_uncertainty_score":0.9998119},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022117514,0.0001674827,0.99050593,0.0018162183,0.0018281157,0.00036826477,0.0000030840972,0.00017610191,0.00511266],"genre_scores_gemma":[0.002087249,0.0000118874905,0.98989934,0.006122783,0.000578502,0.000006608981,0.0000033178378,0.000045340294,0.0012449796],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9947041,0.000032220178,0.00057131867,0.0022626591,0.0014888227,0.0009408446],"domain_scores_gemma":[0.9966485,0.00036128212,0.00038798558,0.001991621,0.00023006451,0.00038056774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011238711,0.0007623063,0.0006685248,0.00096732954,0.00034370815,0.0008590856,0.0042669224,0.00047798894,0.00007229275],"category_scores_gemma":[0.00008490156,0.0006769187,0.00019472356,0.0007260393,0.0003003071,0.00044857277,0.00063689734,0.0016358432,0.000116400115],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011181758,0.000038674534,0.0000017935209,0.000028240549,0.000005782856,0.000057104662,0.00026444657,0.06513854,0.13142109,0.00031240756,0.000045694567,0.80267507],"study_design_scores_gemma":[0.00025613126,0.0001256489,0.0000012237264,0.0002955607,0.0000051374077,0.000025343015,2.6252218e-8,0.38642973,0.54127187,0.0702008,0.0008706604,0.0005178827],"about_ca_topic_score_codex":0.000021174501,"about_ca_topic_score_gemma":0.000044349494,"teacher_disagreement_score":0.80215716,"about_ca_system_score_codex":0.00030186394,"about_ca_system_score_gemma":0.0020721299,"threshold_uncertainty_score":0.9995682},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031951459,0.00052230136,0.98364353,0.0010934827,0.0015815094,0.0002521217,0.0000023691443,0.0001378299,0.009571687],"genre_scores_gemma":[0.9200408,0.00009762599,0.07657355,0.0021150743,0.00030846338,0.000012150408,0.0000060126677,0.000023413662,0.0008229169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968136,0.00003230307,0.00040861146,0.0013149355,0.00087845174,0.0005520839],"domain_scores_gemma":[0.9981476,0.00076477166,0.00017199462,0.00069805945,0.0001281669,0.00008938068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058062084,0.00044241617,0.00042333777,0.00085484615,0.0002453198,0.000544668,0.0011842729,0.0003679732,0.00001761593],"category_scores_gemma":[0.0001762198,0.00038527942,0.0000766675,0.00040059464,0.0006546833,0.00046365286,0.000725034,0.00066317274,0.00003983049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057249203,0.00015866567,0.004184817,0.00015185103,0.000022542234,0.0009466316,0.0013652773,0.20236947,0.00021998708,0.50053066,0.0008417565,0.2891511],"study_design_scores_gemma":[0.0004483479,0.00034371793,0.014733525,0.00045624678,0.0000060648736,0.00019891425,7.342564e-7,0.25080568,0.00036757643,0.73117733,0.0007711802,0.0006906765],"about_ca_topic_score_codex":0.00014818367,"about_ca_topic_score_gemma":0.001199803,"teacher_disagreement_score":0.9168457,"about_ca_system_score_codex":0.00031603454,"about_ca_system_score_gemma":0.00027762476,"threshold_uncertainty_score":0.9998599},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007505323,0.000101008045,0.9968786,0.0002466496,0.00026212062,0.00031577598,0.000023694645,0.00010754263,0.0013140753],"genre_scores_gemma":[0.23649456,0.000010115423,0.76295793,0.000300133,0.00008305617,0.000012372243,0.000007838932,0.00002318597,0.000110815876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997039,0.000005683596,0.00058535056,0.0011350821,0.00079323066,0.0004416392],"domain_scores_gemma":[0.99839026,0.00009935267,0.00027137133,0.0009415363,0.00016854277,0.00012894717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035438262,0.00038444196,0.00042518598,0.0006143273,0.00018851769,0.00018729756,0.002811628,0.00021565908,0.000018433195],"category_scores_gemma":[0.0000198384,0.00038159214,0.00013140508,0.00061828265,0.00055411557,0.00030948425,0.0011355784,0.0003174214,0.000036549918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003428128,0.00012311267,0.000007675984,0.000043103853,0.000015946896,0.000014095946,0.00093282765,0.36885938,0.051841643,0.23727317,0.000004022103,0.3408816],"study_design_scores_gemma":[0.00015091445,0.000030981424,0.000027619197,0.0001186648,0.000007103373,0.00003563988,1.2637895e-7,0.8189138,0.025419658,0.15477346,0.000090142596,0.0004318741],"about_ca_topic_score_codex":0.000025838044,"about_ca_topic_score_gemma":0.000038538663,"teacher_disagreement_score":0.4500544,"about_ca_system_score_codex":0.00035883626,"about_ca_system_score_gemma":0.0015871942,"threshold_uncertainty_score":0.9998636},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000928049,0.00021085424,0.99345016,0.00039186998,0.0033836819,0.0005334469,0.00002535545,0.0002609889,0.0016508389],"genre_scores_gemma":[0.7169082,0.00003123197,0.27957508,0.0007360902,0.0018163304,0.000029997378,0.00012962894,0.00007533657,0.000698089],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952225,0.000052725976,0.00093357806,0.001756629,0.0012684105,0.0007661478],"domain_scores_gemma":[0.99720854,0.00032436496,0.0004860541,0.0014567081,0.00034293925,0.00018140714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008603192,0.0005964419,0.0005716985,0.00078171963,0.00033771183,0.0006005461,0.0025968112,0.00039206585,0.000029913497],"category_scores_gemma":[0.00009936195,0.0005538314,0.00017661061,0.0009948045,0.0004446487,0.00062903593,0.0008948612,0.0006918789,0.0001444466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011324111,0.00012096469,0.00012829357,0.000074967706,0.000020432473,0.00016995463,0.0007168381,0.10704564,0.00048823177,0.14537936,0.0002445246,0.74559945],"study_design_scores_gemma":[0.00010410152,0.0001370876,0.00032480533,0.0003473284,0.000009235358,0.000046677353,2.5396517e-7,0.88217354,0.0048488546,0.10819628,0.002914421,0.00089743646],"about_ca_topic_score_codex":0.000132467,"about_ca_topic_score_gemma":0.00019505847,"teacher_disagreement_score":0.7751279,"about_ca_system_score_codex":0.00045575053,"about_ca_system_score_gemma":0.00041624988,"threshold_uncertainty_score":0.9996913},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046868856,0.000034683177,0.9931955,0.00010276907,0.0015204867,0.000792499,0.0000073924452,0.00046415383,0.0038356967],"genre_scores_gemma":[0.41104347,0.0000024527294,0.5878821,0.0005277777,0.00044208422,0.000021924025,0.0000073532674,0.000025995436,0.000046847454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723613,0.000034093668,0.00065197865,0.0009142957,0.00074552384,0.00041800062],"domain_scores_gemma":[0.9973905,0.0007713722,0.0005305443,0.00080011424,0.00042545027,0.00008203883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015005622,0.00038832013,0.00047466552,0.0014749087,0.0002247517,0.0002745379,0.0011445055,0.00035541962,0.0000046740456],"category_scores_gemma":[0.000069707625,0.00037900332,0.00016304842,0.0005459922,0.0001707991,0.0005970345,0.0001664924,0.00045152815,0.00000795812],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032398868,0.00004908814,0.0000012838617,0.00031054261,0.000009778005,0.000024047451,0.00017862147,0.024898153,0.00030876917,0.00630046,0.000024125204,0.9678627],"study_design_scores_gemma":[0.00038051023,0.00047849707,0.000026222731,0.00070010294,0.000009621283,0.000036464426,3.8365533e-7,0.91136134,0.08134645,0.0046850545,0.000604581,0.00037078813],"about_ca_topic_score_codex":0.00003455333,"about_ca_topic_score_gemma":0.000021533038,"teacher_disagreement_score":0.9674919,"about_ca_system_score_codex":0.00068796444,"about_ca_system_score_gemma":0.00039943864,"threshold_uncertainty_score":0.9998662},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021121452,0.00022089994,0.9918907,0.003011205,0.0032591806,0.00082993216,0.00000385626,0.00017155758,0.00040144284],"genre_scores_gemma":[0.70458096,0.000104774306,0.28579214,0.004288133,0.0016867288,0.00010208273,0.0000272143,0.000056432382,0.0033615353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708426,0.00003713431,0.0005298435,0.0011363763,0.00074714894,0.00046522252],"domain_scores_gemma":[0.9980052,0.00028464376,0.00030540762,0.0009516791,0.00034475286,0.00010827861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082963664,0.0003918819,0.0003219055,0.00048181,0.0006521153,0.00078807387,0.0017894208,0.00023409848,0.000029349903],"category_scores_gemma":[0.00007538833,0.00029150292,0.00023587469,0.0004820456,0.00026574227,0.00083894446,0.00028292913,0.0005369688,0.000051952484],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013378062,0.00004555158,0.00005466122,0.000021609,0.000012500555,0.000010364724,0.0002590265,0.006857244,0.00026810454,0.020819923,0.00010349891,0.97153413],"study_design_scores_gemma":[0.00052501657,0.0005655673,0.0015465497,0.00018938328,0.00002078176,0.00009032163,5.513918e-7,0.89398926,0.0007574631,0.085896045,0.015780712,0.0006383642],"about_ca_topic_score_codex":0.000032372613,"about_ca_topic_score_gemma":0.00021467937,"teacher_disagreement_score":0.97089577,"about_ca_system_score_codex":0.00028356258,"about_ca_system_score_gemma":0.0002846831,"threshold_uncertainty_score":0.9999537},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007910869,0.00095793634,0.98761606,0.00043708284,0.0014497826,0.000343241,0.000007707877,0.00048751433,0.0007898112],"genre_scores_gemma":[0.23616648,0.00010174468,0.76105165,0.00048779423,0.0013400363,0.0000032951664,0.000017145465,0.000054834934,0.0007770301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953398,0.000047647027,0.00064779934,0.0021808208,0.0010713874,0.000712512],"domain_scores_gemma":[0.9968329,0.00014922078,0.00026091092,0.0023672758,0.0001814396,0.00020826956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012139563,0.00053166447,0.00056378514,0.00067467976,0.0006521132,0.0006171834,0.0038982779,0.0002668902,0.0000069213766],"category_scores_gemma":[0.000052884145,0.00050815305,0.0000619357,0.00059832627,0.00038168026,0.0003895415,0.0058846814,0.00085283554,0.000007440707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052528385,0.000030148714,0.00012898323,0.000060508883,0.000012976968,0.000013745091,0.00021777027,0.740853,0.000020421794,0.0006613038,0.00004312795,0.25795278],"study_design_scores_gemma":[0.00024354631,0.00008201508,0.000085943466,0.0005126615,0.000018873641,0.00007716367,1.2689866e-7,0.99295914,0.000022964252,0.003289532,0.0022119847,0.00049606065],"about_ca_topic_score_codex":0.00015627264,"about_ca_topic_score_gemma":0.000053315653,"teacher_disagreement_score":0.25745672,"about_ca_system_score_codex":0.0010669506,"about_ca_system_score_gemma":0.0002869438,"threshold_uncertainty_score":0.999737},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009658833,0.00015457156,0.9946188,0.00018150959,0.0003865319,0.0003112619,0.0000041047515,0.0002034764,0.0040431856],"genre_scores_gemma":[0.2796907,0.00006757653,0.71917254,0.00067406875,0.00019292612,0.0000066132775,0.000014712173,0.000024182702,0.0001566769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715394,0.00003369812,0.0006375997,0.000935885,0.00081956846,0.0004192826],"domain_scores_gemma":[0.9981297,0.0001911365,0.0003702927,0.0010113121,0.00019468166,0.000102876926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005430694,0.0003644896,0.00043805616,0.0006544227,0.00015852752,0.0002658285,0.0018807839,0.00020186053,0.00003393353],"category_scores_gemma":[0.00003369688,0.00034469253,0.000100770776,0.00043671217,0.0003051604,0.00041060988,0.00049787626,0.00031641094,0.000011050857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026604039,0.000047396556,0.000009530414,0.000022301465,0.0000072343605,0.000011494176,0.00047746938,0.34315264,0.00044205502,0.009466336,0.00010283077,0.64625806],"study_design_scores_gemma":[0.0001330368,0.0002492013,0.000010369695,0.00013204914,0.0000044196554,0.000012794005,4.0433992e-8,0.8399098,0.010113702,0.14820988,0.00087723,0.0003474861],"about_ca_topic_score_codex":0.000017846802,"about_ca_topic_score_gemma":0.000018279301,"teacher_disagreement_score":0.64591056,"about_ca_system_score_codex":0.00026501168,"about_ca_system_score_gemma":0.00032101356,"threshold_uncertainty_score":0.9999005},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015237642,0.00020720313,0.9947416,0.0011624568,0.00092278357,0.00027354673,0.000010420917,0.00013425137,0.0010239731],"genre_scores_gemma":[0.89112365,0.000033724515,0.10674338,0.0016284037,0.0001735947,0.000007888091,0.00002152382,0.000028805896,0.00023901687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99498516,0.000095655974,0.00058563,0.0018336626,0.0017677805,0.00073209155],"domain_scores_gemma":[0.9952932,0.0021653362,0.00025409585,0.0017822724,0.00032713302,0.00017795451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026428597,0.00049711525,0.00054990704,0.0027787937,0.00026378184,0.0010160875,0.004900387,0.00030816614,0.000019081],"category_scores_gemma":[0.00051564805,0.00047645424,0.00013154425,0.001998432,0.00054723216,0.001656894,0.0013329926,0.0010528652,0.000044954562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006352055,0.00024293228,0.025388293,0.00015814307,0.000017338083,0.0005024764,0.0029375192,0.30634576,0.00037363442,0.006746687,0.00010427163,0.6571194],"study_design_scores_gemma":[0.00037546392,0.00018133043,0.002122908,0.0009831201,0.000006482593,0.00000551467,2.897544e-7,0.992354,0.0007204388,0.0020292108,0.0006647784,0.000556507],"about_ca_topic_score_codex":0.00022622195,"about_ca_topic_score_gemma":0.0015188621,"teacher_disagreement_score":0.8895999,"about_ca_system_score_codex":0.00091773097,"about_ca_system_score_gemma":0.00088204094,"threshold_uncertainty_score":0.99976873},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001593509,0.00007359266,0.9926197,0.0006646789,0.0009124292,0.0004814941,0.0000065443287,0.00018924796,0.005036396],"genre_scores_gemma":[0.1215554,0.000010588975,0.87625587,0.0014207909,0.00018717599,0.000024222263,0.000029383098,0.000012862652,0.00050367316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980019,0.000009032037,0.00046088468,0.0006049456,0.0005217889,0.00040146385],"domain_scores_gemma":[0.9983167,0.0002731913,0.00025571568,0.0007732435,0.00032457456,0.000056593013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005327685,0.00032440026,0.00032203196,0.000698629,0.00018005863,0.0006050631,0.0018945279,0.00027376477,0.000001290655],"category_scores_gemma":[0.00010857223,0.00027639105,0.00010460556,0.00028783755,0.00025298767,0.0014896239,0.00040418957,0.00030461606,0.000014799568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052013156,0.000008607356,0.0000039297556,0.000026667693,0.0000030728995,0.0000023418484,0.00062486687,0.2088862,0.00003027144,0.15948284,0.00019521921,0.6307308],"study_design_scores_gemma":[0.00014977489,0.00005446064,0.000021935264,0.00007959555,0.0000033998879,0.0000073563606,1.0786363e-7,0.740401,0.00040248004,0.25804847,0.0005886286,0.00024278092],"about_ca_topic_score_codex":0.000028814866,"about_ca_topic_score_gemma":0.00012405284,"teacher_disagreement_score":0.630488,"about_ca_system_score_codex":0.00019076736,"about_ca_system_score_gemma":0.00044050944,"threshold_uncertainty_score":0.9999688},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029236327,0.0012389189,0.9940759,0.001313878,0.00053280004,0.00029688407,0.000001987424,0.00020730654,0.0023030927],"genre_scores_gemma":[0.096119344,0.000023929293,0.90165913,0.0018453401,0.00019665518,0.0000017881478,0.0000015423064,0.000023758026,0.00012848558],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967305,0.00003545693,0.00060653,0.00093397923,0.0011689882,0.0005245341],"domain_scores_gemma":[0.996627,0.00078584393,0.00055649754,0.0016247923,0.00032886883,0.000077049306],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021511337,0.00041179315,0.00049986114,0.00057211326,0.00024017155,0.00032241238,0.005811009,0.0003284093,0.000020832293],"category_scores_gemma":[0.00017290989,0.00028978015,0.00013081942,0.0007792204,0.0012171959,0.00036659284,0.0024356863,0.0010852714,0.00001005639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051004204,0.000017405684,0.000028559827,0.000083945306,0.000010742314,0.00009339186,0.0023154342,0.0010757436,0.0010900075,0.109107494,0.0000764873,0.8860957],"study_design_scores_gemma":[0.00008636514,0.00009339843,0.000039649265,0.00055916526,0.000009626138,0.000112380265,1.17299535e-7,0.13898405,0.0138010215,0.8448972,0.0009671384,0.00044985246],"about_ca_topic_score_codex":0.00003371744,"about_ca_topic_score_gemma":0.000070178925,"teacher_disagreement_score":0.8856458,"about_ca_system_score_codex":0.00017505359,"about_ca_system_score_gemma":0.0002724723,"threshold_uncertainty_score":0.9999554},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001482899,0.0003731805,0.99658614,0.000109195156,0.00051428494,0.00019800241,0.000004309109,0.00035056646,0.0003814362],"genre_scores_gemma":[0.38128993,0.00017208926,0.617998,0.00021761384,0.00019722334,0.0000058687724,0.000013803917,0.000030068308,0.00007540838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969867,0.00004929256,0.0005206268,0.0012956723,0.00066649105,0.00048123373],"domain_scores_gemma":[0.9985027,0.00016435937,0.00032607568,0.00071539654,0.00018314143,0.00010832863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038501978,0.00043817604,0.0004203409,0.0010399838,0.00028302902,0.00022981165,0.0012431646,0.00031436986,0.000001681551],"category_scores_gemma":[0.000038232032,0.00040868018,0.00005832936,0.0008629128,0.00042804942,0.00067479734,0.00043436757,0.000582755,8.586774e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009066093,0.000022651207,0.0002220638,0.000010685462,0.0000051344155,0.000024357254,0.00042767945,0.7458152,0.00016429143,0.00017637837,0.00003130196,0.2530912],"study_design_scores_gemma":[0.00037234844,0.00017757298,0.000042913045,0.0004473407,0.0000034506197,0.00018426908,1.8108184e-7,0.9923289,0.0039831204,0.0016318506,0.00040249716,0.00042557795],"about_ca_topic_score_codex":0.00049975386,"about_ca_topic_score_gemma":0.00012600559,"teacher_disagreement_score":0.37980703,"about_ca_system_score_codex":0.0005334353,"about_ca_system_score_gemma":0.000412577,"threshold_uncertainty_score":0.9998365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23069967,0.0000059621743,0.7681677,0.00078974373,0.00008869957,0.00017123569,4.6454548e-7,0.00007009587,0.000006429821],"genre_scores_gemma":[0.78679454,0.000003863184,0.21251972,0.00059766474,0.0000679236,0.000010445131,0.0000034190584,0.0000022847064,1.3249974e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993398,0.000007647516,0.00014228995,0.00017374761,0.000194349,0.00014215191],"domain_scores_gemma":[0.9995598,0.00002903096,0.00004551499,0.00019485387,0.0001073548,0.00006344258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026526337,0.00007343772,0.000082074475,0.0001413961,0.0001456858,0.00003899399,0.000074936645,0.00005515725,0.0000026587513],"category_scores_gemma":[0.000049815848,0.00006417357,0.000017198226,0.00039937117,0.00017168483,0.00043276738,0.000050074308,0.00024035358,0.0000017242692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015058729,0.000025999534,0.0039612264,0.000015162128,6.5367914e-7,6.330466e-7,0.00019083591,0.0019518276,0.19575962,0.00006968261,0.0000022796173,0.798007],"study_design_scores_gemma":[0.0004151999,0.0001382967,0.2167424,0.000058212576,0.000005919488,0.00046678822,0.0000012379124,0.46740153,0.30681577,0.0063793473,0.0014011962,0.00017407909],"about_ca_topic_score_codex":0.000050184048,"about_ca_topic_score_gemma":0.00007308573,"teacher_disagreement_score":0.79783297,"about_ca_system_score_codex":0.000039210106,"about_ca_system_score_gemma":0.000026407115,"threshold_uncertainty_score":0.26169223},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7430612,0.00010935087,0.25630417,0.00007044114,0.0002587227,0.00012999235,0.00002006591,0.000035153946,0.000010894384],"genre_scores_gemma":[0.9183775,0.0000030887538,0.080252245,0.0013183501,0.000024412204,0.0000034382886,0.000014791528,0.000005980652,1.5200023e-7],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988399,0.000036612975,0.00021512773,0.00041464632,0.00024369318,0.00025000251],"domain_scores_gemma":[0.99924225,0.000224077,0.00007157938,0.00035014952,0.000021631067,0.00009034411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012378064,0.00013046876,0.0002513404,0.00014209014,0.00005070254,0.000013153253,0.0002361389,0.00005050891,0.000048776863],"category_scores_gemma":[0.00011142537,0.0000939271,0.00004583981,0.00038937575,0.0002797,0.0001019513,0.00011281057,0.0001617759,0.0000060231055],"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.00012272522,0.0013811727,0.7795177,0.000057069057,0.000029135119,0.001020004,0.0021595974,0.0020906525,0.010051306,0.000008294454,0.000043002718,0.2035193],"study_design_scores_gemma":[0.000810148,0.00033391302,0.8050561,0.00008296715,0.000016434627,0.000012428209,7.32723e-7,0.18307473,0.009451865,0.0010554604,0.0000049680293,0.00010026435],"about_ca_topic_score_codex":0.00013176184,"about_ca_topic_score_gemma":0.00001047511,"teacher_disagreement_score":0.20341904,"about_ca_system_score_codex":0.000015448075,"about_ca_system_score_gemma":0.000063105974,"threshold_uncertainty_score":0.3830236},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039180042,0.000049964186,0.99547315,0.00036494707,0.00084553007,0.0005596132,0.000019772782,0.00011869924,0.0021765325],"genre_scores_gemma":[0.45536807,0.0000050164654,0.5440599,0.00033798008,0.00016612954,0.000021685162,0.000007650021,0.000014367657,0.000019221116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967147,0.000020264242,0.0005170097,0.0013431992,0.00092738785,0.00047741062],"domain_scores_gemma":[0.99731064,0.00022014146,0.00034201844,0.0016112216,0.00033289928,0.00018309931],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058969064,0.00041640995,0.00044936588,0.0006040439,0.00018339761,0.00024909203,0.0030621698,0.00037524707,0.000003830711],"category_scores_gemma":[0.000045836834,0.00038233137,0.000097612945,0.00058121106,0.00032022956,0.00047481278,0.0007534066,0.00071122363,0.000026005346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007813564,0.00003345489,0.00010383619,0.00005231977,0.000004418334,0.000006023431,0.0005410676,0.5161787,0.0030377759,0.015430946,0.000006444731,0.46459714],"study_design_scores_gemma":[0.00013731056,0.000115764735,0.00019379148,0.00015953189,0.0000048791844,0.000005271305,6.6347006e-8,0.8363143,0.007710621,0.15482078,0.00016073592,0.00037694696],"about_ca_topic_score_codex":0.00003168122,"about_ca_topic_score_gemma":0.000023874038,"teacher_disagreement_score":0.4642202,"about_ca_system_score_codex":0.0001546891,"about_ca_system_score_gemma":0.0004193344,"threshold_uncertainty_score":0.99986285},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005473274,0.0050996174,0.96095973,0.00039866674,0.0017008566,0.00085111556,0.000020091886,0.000054816705,0.025441814],"genre_scores_gemma":[0.63528764,0.0084084105,0.31183758,0.005098387,0.008775671,0.00009667071,0.00046032944,0.0004513787,0.029583931],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997704,0.000018147215,0.00026305404,0.0010407761,0.00051514764,0.00045885312],"domain_scores_gemma":[0.9987938,0.000021769481,0.00011762729,0.0008306589,0.00012603676,0.00011014485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003179805,0.0003818597,0.0002834275,0.00025828803,0.00014147538,0.00006416211,0.00081980927,0.00029746597,0.000096149706],"category_scores_gemma":[0.000034292727,0.0003609965,0.00013309185,0.00012752129,0.00048956607,0.000005582451,0.00055774715,0.0003069086,0.00006362097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040468683,0.00007364237,0.00033260838,0.0000787173,0.00009392738,0.00015439364,0.00044754962,0.009373872,0.05248424,0.0000957673,0.0011874813,0.93563735],"study_design_scores_gemma":[0.0028594888,0.0032865962,0.00206503,0.0007047189,0.000103214676,0.00068581,0.0000011244929,0.017807031,0.08443515,0.0077028284,0.8755788,0.004770186],"about_ca_topic_score_codex":0.000009294293,"about_ca_topic_score_gemma":0.00003550317,"teacher_disagreement_score":0.93086714,"about_ca_system_score_codex":0.00009899928,"about_ca_system_score_gemma":0.00024262586,"threshold_uncertainty_score":0.9998842},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031532686,0.0039158966,0.95944697,0.00034868316,0.00041098075,0.0002583136,0.000019207797,0.00006532824,0.0040019113],"genre_scores_gemma":[0.9706738,0.00034729726,0.02886324,0.000033952998,0.00004750254,9.3160924e-7,0.000004469794,0.000010116162,0.000018718698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932265,0.000003426458,0.0002048463,0.00023622543,0.000112063266,0.00012079063],"domain_scores_gemma":[0.9996986,0.00006578916,0.00004105845,0.00013152196,0.000029151664,0.000033895958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006930356,0.00014244203,0.00021236335,0.0003801824,0.000035466855,0.000046934987,0.000115838346,0.000104381616,0.000019577064],"category_scores_gemma":[0.000015392452,0.00012602273,0.000021389378,0.00018150608,0.00020036603,0.000117493895,0.000042489908,0.00016019326,3.382878e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014606993,0.0000025821614,0.00030120986,0.00005008697,0.000009416805,0.0000043590458,0.00063268805,0.67020005,0.0005970048,0.0054396656,9.89873e-7,0.3227605],"study_design_scores_gemma":[0.00030832624,0.00005426026,0.0073685334,0.0004969639,0.000022120765,0.000030089246,0.0000012274596,0.9076108,0.003168145,0.080415756,0.0000517658,0.00047204466],"about_ca_topic_score_codex":0.000043786877,"about_ca_topic_score_gemma":0.000287871,"teacher_disagreement_score":0.9391411,"about_ca_system_score_codex":0.000049990642,"about_ca_system_score_gemma":0.00003441577,"threshold_uncertainty_score":0.5139058},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000120620665,0.000504981,0.9968081,0.00024895466,0.00066203164,0.00084956555,0.0000061038245,0.00020587147,0.0005937889],"genre_scores_gemma":[0.60158837,0.00008184862,0.39464375,0.00054545136,0.0012372936,0.00020165749,0.000024904026,0.00010559164,0.001571117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544287,0.000025173837,0.00055785856,0.0017118419,0.0014011866,0.0008610609],"domain_scores_gemma":[0.99689966,0.00073301373,0.0002387949,0.001275599,0.0006433709,0.00020953943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015824086,0.00046358147,0.0006401848,0.0009161343,0.00025434926,0.0007888276,0.0032273578,0.00030285734,0.0000036709669],"category_scores_gemma":[0.0004187362,0.0004237226,0.00019027162,0.00084652536,0.00019712208,0.0008581238,0.0005252639,0.0006511977,0.000015178885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018355347,0.000090011425,0.00006058026,0.0004223795,0.00006519563,0.000088295994,0.0007272176,0.44675258,0.00040654672,0.0109858,0.000016927188,0.5403661],"study_design_scores_gemma":[0.0002394822,0.00021372529,0.000018097999,0.0005921543,0.00001201796,0.000034670527,2.5455563e-7,0.95368695,0.0018570252,0.041534703,0.0012812588,0.0005296605],"about_ca_topic_score_codex":0.000032668533,"about_ca_topic_score_gemma":0.000010989432,"teacher_disagreement_score":0.6021643,"about_ca_system_score_codex":0.0005382092,"about_ca_system_score_gemma":0.00069631863,"threshold_uncertainty_score":0.9998215},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017992932,0.0003478088,0.9745969,0.0033449647,0.0009840588,0.0006300025,0.000027730697,0.00028359785,0.0017919637],"genre_scores_gemma":[0.7198846,0.000028404074,0.2729508,0.005990275,0.0009466729,0.000019830308,0.000072334864,0.00005329513,0.00005384565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951803,0.00008485192,0.0005723047,0.0019790689,0.0013359899,0.0008474478],"domain_scores_gemma":[0.99655193,0.0006847189,0.00026500243,0.0016098985,0.0005162657,0.00037218374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008114338,0.0007142384,0.000648787,0.0010550305,0.00060935627,0.0010079071,0.0035638886,0.00060804543,0.000026712856],"category_scores_gemma":[0.000007144405,0.00065254985,0.00010767095,0.0011541314,0.0005765477,0.0007552804,0.0016565928,0.0017484142,0.00004886638],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001076265,0.00026733876,0.0022477286,0.0016722982,0.00013003926,0.00025347582,0.012896991,0.017848058,0.013488313,0.041522108,0.000010334686,0.9095557],"study_design_scores_gemma":[0.0024280734,0.00097084354,0.0058816504,0.0030359894,0.00010265431,0.00025707364,0.0000034664001,0.787676,0.021311076,0.16918528,0.0057720193,0.0033758846],"about_ca_topic_score_codex":0.00022888576,"about_ca_topic_score_gemma":0.0010750315,"teacher_disagreement_score":0.9061798,"about_ca_system_score_codex":0.00015262583,"about_ca_system_score_gemma":0.0008114526,"threshold_uncertainty_score":0.9995926},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010589563,0.00037709007,0.98826784,0.000028063856,0.00040171863,0.00019717468,0.000007760022,0.0000037274378,0.00012707457],"genre_scores_gemma":[0.9814563,0.000059625705,0.017630836,0.00014254241,0.0005564914,0.0000019357597,0.000049091093,0.000014491191,0.000088721434],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904644,0.000011564112,0.00032406373,0.0003204933,0.00013626293,0.00016116031],"domain_scores_gemma":[0.999293,0.000018121666,0.00030606726,0.00027218967,0.00007502857,0.000035587553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003074594,0.00015283137,0.00017479804,0.00006292028,0.00008016364,0.00006573275,0.00023115016,0.00018377852,0.0000032101736],"category_scores_gemma":[0.000011432404,0.00014728529,0.000037479604,0.000048464655,0.00032148662,0.000006559276,0.00022209268,0.00014573039,7.099558e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052251846,0.000021844528,0.00012000588,0.00017477832,0.00004290663,8.9339215e-7,0.00019113548,0.12136594,0.47872186,0.0011848907,0.00028127836,0.3978422],"study_design_scores_gemma":[0.00038797787,0.00030049816,0.00007112319,0.00039349557,0.000036031663,0.00005066746,5.806171e-7,0.8676486,0.10731031,0.018029783,0.0051236562,0.00064725627],"about_ca_topic_score_codex":0.000009674161,"about_ca_topic_score_gemma":0.000024847608,"teacher_disagreement_score":0.9708667,"about_ca_system_score_codex":0.000019117553,"about_ca_system_score_gemma":0.000054014567,"threshold_uncertainty_score":0.600612},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039312723,0.0006358216,0.99120283,0.0004947331,0.0013787585,0.0014639187,0.0002682618,0.00007428071,0.00055011915],"genre_scores_gemma":[0.25993323,0.0000056297495,0.73773605,0.000557184,0.0009200754,0.000066635774,0.0005543596,0.00006879058,0.0001580701],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785286,0.000008666102,0.00037194035,0.00092810096,0.00052592764,0.000312508],"domain_scores_gemma":[0.9979184,0.0004897834,0.00020648139,0.00057220855,0.000637789,0.0001753265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018174743,0.0003742191,0.00049646257,0.00032833568,0.00019840228,0.00014866635,0.00023417606,0.00023762116,0.00012020576],"category_scores_gemma":[0.00038006948,0.00031958855,0.0009929113,0.00013802346,0.0005100957,0.00017154435,0.00013157933,0.00041693173,0.000028042454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019060103,0.006711084,0.011827967,0.0016873339,0.005583901,0.0008034533,0.0036405588,0.019157609,0.08077993,0.022105219,0.0012965591,0.84450036],"study_design_scores_gemma":[0.0051393565,0.0015831857,0.02349144,0.0040867617,0.0020719455,0.0002254619,0.000001994103,0.07013231,0.0069183405,0.8849088,0.00016670093,0.0012737372],"about_ca_topic_score_codex":0.0001714199,"about_ca_topic_score_gemma":0.00016300584,"teacher_disagreement_score":0.8628036,"about_ca_system_score_codex":0.00048337042,"about_ca_system_score_gemma":0.00036414462,"threshold_uncertainty_score":0.9999256},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010022722,0.00008000727,0.99267423,0.00037528077,0.001525965,0.000540331,0.000007945408,0.00025703205,0.0035369329],"genre_scores_gemma":[0.13838513,0.000015884129,0.8586818,0.0025041664,0.00022828524,0.000025298812,0.00000898829,0.000043989166,0.00010646335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961074,0.00012000483,0.0006927039,0.0013010739,0.0012334544,0.0005453791],"domain_scores_gemma":[0.9951483,0.0026142783,0.00052207784,0.001179258,0.00036182403,0.00017427723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009874711,0.0005805823,0.00074489345,0.0014420693,0.00014334341,0.0003082539,0.0025886286,0.00042633674,0.00009640054],"category_scores_gemma":[0.0006742154,0.0005194502,0.00025231714,0.0005639105,0.00057602883,0.00032218735,0.00036760897,0.0007094472,0.00025467534],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003443433,0.00005047599,0.000008597638,0.00021251569,0.000011762025,0.00007398841,0.00010821653,0.000108330445,0.0006030961,0.0015621268,0.000017058326,0.99724036],"study_design_scores_gemma":[0.0006791469,0.0009042707,0.00014655071,0.0044934284,0.00003793932,0.00008840016,2.123711e-7,0.46230882,0.24726276,0.2827017,0.00022179098,0.0011549849],"about_ca_topic_score_codex":0.000022807286,"about_ca_topic_score_gemma":0.00004524643,"teacher_disagreement_score":0.9960854,"about_ca_system_score_codex":0.0002668831,"about_ca_system_score_gemma":0.00044664642,"threshold_uncertainty_score":0.9997257},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006877696,0.00019636063,0.99550706,0.00002911577,0.00092255755,0.00022816221,0.0000041417284,0.00035909662,0.002065714],"genre_scores_gemma":[0.9574582,0.00016499084,0.040866096,0.0006351905,0.0006104576,0.000013957989,0.000053995667,0.00007454391,0.00012258315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866724,0.000009709761,0.00025188565,0.0004070105,0.0004091989,0.0002549674],"domain_scores_gemma":[0.9994656,0.00010153393,0.000053874777,0.0002046722,0.00010156163,0.00007278352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015228675,0.00027116307,0.00020832715,0.00049070775,0.000109679204,0.00007451225,0.00027622303,0.00021747481,0.000072840616],"category_scores_gemma":[0.000022253033,0.0002781384,0.00007303217,0.0003090562,0.00016272861,0.00011370474,0.00003810965,0.000496437,0.00006522807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007294111,0.000012122755,0.000027196542,0.00004299717,0.000007485041,0.000011452244,0.00018380661,0.5125362,0.0014123081,0.00009872794,0.000068233676,0.48559216],"study_design_scores_gemma":[0.00017987394,0.00011957501,0.00006650101,0.0001967721,0.00000705573,0.000022294376,5.980901e-8,0.9436942,0.050532594,0.002197397,0.002524749,0.00045894991],"about_ca_topic_score_codex":0.000016258007,"about_ca_topic_score_gemma":0.00013060847,"teacher_disagreement_score":0.9567704,"about_ca_system_score_codex":0.0003362565,"about_ca_system_score_gemma":0.00008449597,"threshold_uncertainty_score":0.9999671},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014748056,0.0010099,0.98982805,0.0024467693,0.0010880436,0.0007198517,0.000012497732,0.000018489794,0.004728924],"genre_scores_gemma":[0.4724925,0.0007543946,0.50040555,0.018371835,0.004571073,0.0001989813,0.000143996,0.00015471809,0.0029069323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828696,0.000055863922,0.0003304094,0.00061859965,0.00032114593,0.00038700987],"domain_scores_gemma":[0.9964814,0.0027015738,0.00019121215,0.00047101796,0.00010754029,0.00004722092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018678799,0.00023546688,0.00022920598,0.00021059031,0.0002243378,0.00018264288,0.00064450287,0.00021278497,0.000060105336],"category_scores_gemma":[0.00006658208,0.00015228424,0.000055533827,0.00018971339,0.0009593081,0.00006507666,0.000074071235,0.00045835986,0.000014562762],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004034767,0.000021323289,0.00022558466,0.00000774471,0.000011051002,0.0000060416232,0.0023888366,0.0006954317,0.000018530392,0.008406393,0.0001035699,0.98811144],"study_design_scores_gemma":[0.0021293007,0.0004489228,0.21523914,0.001505467,0.0001772182,0.00062604167,0.00019839911,0.6497834,0.000053463227,0.110479385,0.017347936,0.0020113604],"about_ca_topic_score_codex":0.00018553952,"about_ca_topic_score_gemma":0.00012917777,"teacher_disagreement_score":0.9861001,"about_ca_system_score_codex":0.0001813273,"about_ca_system_score_gemma":0.00017359908,"threshold_uncertainty_score":0.6209971},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005633918,0.00032598828,0.9918819,0.0006082799,0.0011327788,0.00045969768,0.0000011838921,0.00029932184,0.005234524],"genre_scores_gemma":[0.17258036,0.000024209614,0.8241085,0.0014793797,0.0013351275,0.000006790183,0.000002144696,0.000052045532,0.00041148413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561834,0.00006485134,0.0006432779,0.0015595254,0.0012202221,0.00089377357],"domain_scores_gemma":[0.99811614,0.00016009013,0.00033947447,0.0010299529,0.00020517263,0.00014917085],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016705057,0.0005526356,0.00061553647,0.00094853726,0.0005861871,0.0012994101,0.0032255389,0.00037397214,0.000011812157],"category_scores_gemma":[0.000018040077,0.000520911,0.00018970092,0.00047438726,0.00029815827,0.00086293905,0.001705532,0.000958575,0.000009901889],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017321152,0.000011214623,0.000011406646,0.00003652835,0.0000073540727,0.0000684526,0.0006411646,0.0009038751,0.0003913298,0.012093477,0.000017628397,0.9858158],"study_design_scores_gemma":[0.0003681632,0.0002932058,0.00007431102,0.0008448032,0.000013845424,0.00024177696,5.1454464e-7,0.76667553,0.0060972413,0.21950915,0.004271748,0.0016097106],"about_ca_topic_score_codex":0.00012407587,"about_ca_topic_score_gemma":0.00003143449,"teacher_disagreement_score":0.98420614,"about_ca_system_score_codex":0.0008243039,"about_ca_system_score_gemma":0.00060388044,"threshold_uncertainty_score":0.9997373},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051051856,0.00026147804,0.9949323,0.00027374155,0.0007524271,0.00037073356,0.00003100967,0.00019999914,0.002667782],"genre_scores_gemma":[0.017639313,0.000016666429,0.9805515,0.000737325,0.000698683,0.0000133575495,0.000045921235,0.000037193975,0.00026004118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956215,0.000028212697,0.0006123607,0.0019024145,0.0010337224,0.00080180157],"domain_scores_gemma":[0.997393,0.0001994017,0.00033196597,0.0016500436,0.00019945376,0.00022613893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087753433,0.00056377216,0.0005201597,0.00071049464,0.0005013312,0.00064370217,0.003648473,0.00028972537,0.00001686894],"category_scores_gemma":[0.000046109286,0.00055100827,0.00012364153,0.0009452395,0.0006098239,0.0009035463,0.0023844838,0.0006972171,0.00003260368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030296467,0.00009635034,0.00021782341,0.000032911186,0.000027399637,0.000041928568,0.0010843464,0.025528636,0.00040149942,0.023600936,0.00011422848,0.9488509],"study_design_scores_gemma":[0.00026799567,0.000069047936,0.00009647052,0.0001919357,0.000013016661,0.00015357292,9.040051e-7,0.99143237,0.0005062198,0.002611811,0.003954782,0.0007019011],"about_ca_topic_score_codex":0.00005277056,"about_ca_topic_score_gemma":0.000022238251,"teacher_disagreement_score":0.9659037,"about_ca_system_score_codex":0.0005048967,"about_ca_system_score_gemma":0.0004966032,"threshold_uncertainty_score":0.99969417},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007069542,0.00008303943,0.99546367,0.00089960766,0.001206999,0.0007133872,0.000021807238,0.0004989636,0.0010418366],"genre_scores_gemma":[0.04147247,0.000010608506,0.9555736,0.0023941526,0.00028651115,0.00004729336,0.000016097885,0.000047220332,0.00015201529],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964232,0.000016093607,0.00045887637,0.0016582351,0.00070074346,0.0007428962],"domain_scores_gemma":[0.9970011,0.0005083694,0.00031452297,0.0018066944,0.00021186759,0.00015742799],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008202661,0.00059790706,0.0005010181,0.0010180908,0.00046009204,0.0006127674,0.004524835,0.0004239496,0.0000067677297],"category_scores_gemma":[0.000062467094,0.0005411748,0.00023459425,0.0003929313,0.00055739714,0.0005248509,0.001000321,0.0011198554,0.000007684462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012934115,0.00023458544,0.0007208003,0.00043057458,0.000056414927,0.00018308133,0.000650002,0.011344902,0.009636672,0.15085275,0.0002229862,0.82553786],"study_design_scores_gemma":[0.0006198328,0.0005070378,0.000052092495,0.00088860386,0.000008784953,0.000019417253,4.325514e-8,0.29017472,0.09018692,0.60733336,0.009058746,0.001150462],"about_ca_topic_score_codex":0.0000051230954,"about_ca_topic_score_gemma":0.000009029365,"teacher_disagreement_score":0.82438743,"about_ca_system_score_codex":0.00014220554,"about_ca_system_score_gemma":0.00017632176,"threshold_uncertainty_score":0.999704},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002132444,0.00027524238,0.9841341,0.00012471693,0.001185668,0.00090620184,0.0000031294571,0.00004473751,0.011193811],"genre_scores_gemma":[0.9512458,0.000012519058,0.047874093,0.00051820907,0.00019976479,0.000022963759,0.0000024030676,0.000030024052,0.000094234776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99678695,0.0001494458,0.00040948714,0.0011548693,0.0007977413,0.00070151157],"domain_scores_gemma":[0.99137205,0.007004915,0.00016425874,0.0010718374,0.00029884718,0.0000880674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0058892434,0.00039888002,0.00052693347,0.00081179437,0.00018510624,0.00019206964,0.003047528,0.00029403585,0.000007695949],"category_scores_gemma":[0.0002866639,0.00027506505,0.00015873752,0.0007440582,0.0006495667,0.00022327683,0.0007585402,0.0007589411,0.000013228289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009349327,0.00010021181,0.00059478235,0.0002651238,0.000017026492,0.000058168425,0.0017717954,0.019062726,0.00025802408,0.5503694,0.000011708822,0.42739752],"study_design_scores_gemma":[0.0010961237,0.0009490389,0.003653976,0.002884442,0.000009330172,0.000037859525,7.1098583e-7,0.41060695,0.023372047,0.5559676,0.0004537331,0.00096814655],"about_ca_topic_score_codex":0.000030468023,"about_ca_topic_score_gemma":0.00010051343,"teacher_disagreement_score":0.94911337,"about_ca_system_score_codex":0.00029267257,"about_ca_system_score_gemma":0.00043130844,"threshold_uncertainty_score":0.99997014},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027500056,0.004913332,0.96141165,0.0010101689,0.0018866244,0.0008503543,0.000004224395,0.000090670226,0.0023329286],"genre_scores_gemma":[0.9831618,0.00091467,0.015630726,0.000064252614,0.00017842223,0.000007895836,4.9920703e-7,0.000018231378,0.000023521476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985409,0.00004712604,0.00041477015,0.0003208276,0.00035380447,0.00032258677],"domain_scores_gemma":[0.99695474,0.0024683403,0.00018826533,0.0002293823,0.00011610277,0.00004316331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011823811,0.00026090076,0.0003805686,0.00037959966,0.000113161994,0.00008651697,0.0003594459,0.00010341815,0.000006224594],"category_scores_gemma":[0.00017234871,0.0001737762,0.00002244743,0.00043843745,0.0006349522,0.00017496853,0.00005937863,0.0007128025,0.0000011562088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010108084,0.000027251714,0.0020518485,0.00010246001,0.000072950745,0.0006469672,0.03308517,0.29676035,0.000015127521,0.0022893834,0.000012536268,0.66483486],"study_design_scores_gemma":[0.003783639,0.0019401407,0.0018054614,0.007363711,0.00014633535,0.0010037494,0.0020295556,0.94818455,0.0017148342,0.021243658,0.0063527124,0.0044316817],"about_ca_topic_score_codex":0.0001354404,"about_ca_topic_score_gemma":0.0018459063,"teacher_disagreement_score":0.9556617,"about_ca_system_score_codex":0.0001932241,"about_ca_system_score_gemma":0.00014275775,"threshold_uncertainty_score":0.7086388},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15129346,0.00043073256,0.761192,0.0043801963,0.003338964,0.0043496345,0.000072725394,0.00072125584,0.07422101],"genre_scores_gemma":[0.99625385,0.00000261056,0.0020311717,0.0011602758,0.00033729256,0.00003236544,0.000020662521,0.000017036933,0.00014476274],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647963,0.0000722689,0.00048108678,0.0006234179,0.0016686415,0.0006749262],"domain_scores_gemma":[0.9983925,0.00046233577,0.00024741408,0.0005038676,0.00027431792,0.00011954063],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010590843,0.0003720863,0.0003779072,0.00037459025,0.000785031,0.0024775425,0.0021595366,0.00019551569,0.000012788755],"category_scores_gemma":[0.00017011765,0.00024590138,0.00013190023,0.0012295886,0.0015844402,0.003438387,0.0006457346,0.00052858226,0.000021243191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029769095,0.00030085133,0.030364208,0.0014101113,0.00014145234,0.00008698673,0.26146746,0.053867646,0.00001572196,0.10486359,0.0009827012,0.5462016],"study_design_scores_gemma":[0.0074064564,0.0056235986,0.13964392,0.022818817,0.0005787461,0.00052158977,0.011821557,0.22605331,0.0017962441,0.5311619,0.031631973,0.02094189],"about_ca_topic_score_codex":0.0040816716,"about_ca_topic_score_gemma":0.017194694,"teacher_disagreement_score":0.8449604,"about_ca_system_score_codex":0.00058522925,"about_ca_system_score_gemma":0.00047602673,"threshold_uncertainty_score":0.99999934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050751874,0.0011459644,0.98984927,0.00048732487,0.0060058236,0.0016088807,0.000009093535,0.00046524985,0.0003776609],"genre_scores_gemma":[0.14576659,0.00018338214,0.8414664,0.005868232,0.0053378786,0.00014193532,0.000047698013,0.00016515645,0.0010226773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99471307,0.00008662063,0.0007029632,0.0021078982,0.0012433212,0.0011461332],"domain_scores_gemma":[0.99629414,0.00076420297,0.00063471915,0.0010839523,0.0009666775,0.00025628041],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013004275,0.00084999786,0.0008214123,0.0011974497,0.0010826738,0.0009364078,0.0018902802,0.0012119977,0.0000053641647],"category_scores_gemma":[0.00007615162,0.0008132623,0.00030957014,0.0014238466,0.0003698332,0.00080064224,0.0006132067,0.0017175284,0.000011707271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011122222,0.000019950985,0.0000030850724,0.0000860469,0.000012981128,0.0000079000665,0.00014606745,0.6969263,0.00025000965,0.0030638964,0.00042602612,0.29894653],"study_design_scores_gemma":[0.0005447233,0.0005313671,0.00003877271,0.0006285006,0.000021857864,0.000113068534,1.8735298e-7,0.9621733,0.0011963674,0.023091864,0.010836101,0.0008239162],"about_ca_topic_score_codex":0.000043420434,"about_ca_topic_score_gemma":0.00063603657,"teacher_disagreement_score":0.2981226,"about_ca_system_score_codex":0.0008257338,"about_ca_system_score_gemma":0.00049220014,"threshold_uncertainty_score":0.99943185},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.492351,0.06317577,0.09545528,0.18027627,0.04720455,0.0049387836,0.00005163509,0.001079922,0.115466796],"genre_scores_gemma":[0.9932869,0.00017884017,0.00076753966,0.0041284617,0.0013929188,0.000010134346,0.0000024113972,0.000015334237,0.00021747124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979974,0.000025784355,0.0003431267,0.000545859,0.00062615087,0.0004616629],"domain_scores_gemma":[0.9989751,0.0001685023,0.00020409859,0.00038404853,0.00024292328,0.000025308456],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005597569,0.00026409046,0.00028937362,0.0001313539,0.0003819683,0.0014379072,0.0009934993,0.000075041295,0.00082527194],"category_scores_gemma":[0.00009007188,0.00018575987,0.00004161459,0.00092679454,0.00035180323,0.001236389,0.00032773984,0.00019585516,0.000029299694],"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.00028185613,0.0005391746,0.089234844,0.0030914822,0.00030681037,0.0005548092,0.0044962857,0.07912143,0.0022556358,0.014774432,0.1466642,0.65867907],"study_design_scores_gemma":[0.0016040183,0.000006626571,0.02004167,0.00071621203,0.000030992647,0.00003660429,0.000040221308,0.88043416,0.0000095674395,0.00035614308,0.096159,0.00056477264],"about_ca_topic_score_codex":0.15913528,"about_ca_topic_score_gemma":0.61766565,"teacher_disagreement_score":0.80131274,"about_ca_system_score_codex":0.00012072451,"about_ca_system_score_gemma":0.00012194742,"threshold_uncertainty_score":0.9995987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000994559,0.0012797277,0.9950539,0.00019702833,0.001728238,0.00035658866,0.0000012531764,0.00015795439,0.00023074912],"genre_scores_gemma":[0.64332706,0.0023070718,0.3447017,0.0033247753,0.0052146986,0.00004282533,0.000033960605,0.00012810345,0.00091981125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719226,0.000043922908,0.00041743362,0.0013165221,0.00050667796,0.00052316295],"domain_scores_gemma":[0.998422,0.000316718,0.00028891387,0.0006211527,0.00017868685,0.00017252688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040148437,0.00042759825,0.00037664536,0.00036626068,0.0007509596,0.0004000748,0.0008975122,0.00027158472,0.000016523893],"category_scores_gemma":[0.000023474864,0.00040896997,0.00009212424,0.0007230612,0.0005432266,0.00067171536,0.00064224773,0.0008711132,0.0000126841605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015436577,0.00001628211,0.0002787768,0.000014528587,0.000012747118,0.00001859181,0.00011786669,0.45797274,0.00020856809,0.0020069785,0.00004495267,0.5392925],"study_design_scores_gemma":[0.00016822125,0.00017514714,0.00019949042,0.00012748121,0.0000147573755,0.00008758175,1.2170685e-7,0.9916472,0.0001638273,0.0040069236,0.0029730748,0.00043618088],"about_ca_topic_score_codex":0.000027557755,"about_ca_topic_score_gemma":0.000022288305,"teacher_disagreement_score":0.6503522,"about_ca_system_score_codex":0.00012081232,"about_ca_system_score_gemma":0.00020838786,"threshold_uncertainty_score":0.9998362},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52087855,0.0026962555,0.46771827,0.00018458856,0.00021122034,0.00039147236,0.00000791612,0.000051103376,0.007860621],"genre_scores_gemma":[0.952652,0.00019083556,0.04544735,0.0007111021,0.00061138626,0.0000025251736,0.000019729254,0.000023171033,0.00034193837],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984182,0.000010950844,0.0001959516,0.0008341685,0.00020239485,0.0003383409],"domain_scores_gemma":[0.9994441,0.000041268682,0.00010244816,0.00027181843,0.000056482993,0.00008386981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021961225,0.00028991562,0.00023126864,0.00009526352,0.00015734417,0.0001469524,0.00040400648,0.0002478979,0.000010446572],"category_scores_gemma":[0.000022378917,0.0002099747,0.000040843566,0.00008558355,0.00043616502,0.0000072277594,0.0003404856,0.0002683383,0.000001997934],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058278147,0.000014683088,0.0015348846,0.00004083955,0.000024292847,0.000043261956,0.000100163285,0.013845018,0.029576028,0.00023133715,0.000013261969,0.95451796],"study_design_scores_gemma":[0.00716778,0.019593474,0.0062006307,0.004595959,0.00024603645,0.002346331,0.0000075847197,0.3736755,0.39689124,0.07286673,0.10326896,0.013139764],"about_ca_topic_score_codex":0.000013160535,"about_ca_topic_score_gemma":0.00005121604,"teacher_disagreement_score":0.9413782,"about_ca_system_score_codex":0.000019175492,"about_ca_system_score_gemma":0.00009148759,"threshold_uncertainty_score":0.856252},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002066937,0.0000553025,0.99680793,0.00018675781,0.0009030506,0.00073925836,0.000010194714,0.0007727522,0.00031806563],"genre_scores_gemma":[0.16557766,0.0000025007512,0.8335136,0.0006002487,0.00019185586,0.00004454975,0.0000067710453,0.00004387563,0.000018888062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957271,0.0000643647,0.00055013836,0.0017146241,0.0010762349,0.00086754095],"domain_scores_gemma":[0.99569255,0.0016586112,0.0003522601,0.0013747739,0.00072992366,0.00019188602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011189415,0.0007077703,0.0005963469,0.00090009393,0.00037343794,0.00087639724,0.0020779201,0.00038868448,0.0000015964433],"category_scores_gemma":[0.0032349566,0.0006434328,0.00009927893,0.001726018,0.00045719213,0.0018803712,0.00065683725,0.0010205939,0.0000051287357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051260263,0.000026245843,0.000011319375,0.000067608344,0.0000035352994,0.00050490344,0.0005857079,0.7332409,0.000017540511,0.0019828444,7.2426053e-7,0.26355353],"study_design_scores_gemma":[0.00031106654,0.00037342132,0.000035596517,0.00045765948,0.000007905616,0.000437405,7.119528e-7,0.9490285,0.000733407,0.04786018,0.000018502667,0.00073563075],"about_ca_topic_score_codex":0.000022021259,"about_ca_topic_score_gemma":0.000021699272,"teacher_disagreement_score":0.2628179,"about_ca_system_score_codex":0.0007473,"about_ca_system_score_gemma":0.0015617079,"threshold_uncertainty_score":0.9996017},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015363826,0.000056182485,0.99599576,0.0010017995,0.0002597729,0.0004938034,0.0000020641307,0.00018539182,0.0018515709],"genre_scores_gemma":[0.5811803,0.000020455487,0.41373494,0.004448599,0.00016214559,0.00006159565,0.000018859355,0.00003400027,0.00033916105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970134,0.00003682216,0.00030421859,0.0012796806,0.0009531698,0.00041273303],"domain_scores_gemma":[0.9983527,0.00025525183,0.00010729056,0.00083036465,0.000264097,0.00019029558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003203563,0.00037533516,0.000307318,0.0013441371,0.00044529515,0.00032364193,0.0014233525,0.00021277134,0.000013002765],"category_scores_gemma":[0.000043688928,0.00030670335,0.00006408356,0.0012468597,0.00021804777,0.00037029924,0.00031093688,0.0006506756,0.00023966454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072142384,0.00002303044,0.000010004694,0.000006844345,0.000002485747,0.00002206638,0.0001582771,0.6601515,0.00009562671,0.0010583099,0.000041516298,0.33842313],"study_design_scores_gemma":[0.00025517715,0.00059322844,0.00009797429,0.00034303888,0.000004872651,0.0000373345,2.9754514e-7,0.98747075,0.0053384737,0.0011722099,0.0041523897,0.00053428166],"about_ca_topic_score_codex":0.00005236072,"about_ca_topic_score_gemma":0.000117471354,"teacher_disagreement_score":0.58226085,"about_ca_system_score_codex":0.00025536053,"about_ca_system_score_gemma":0.0004076364,"threshold_uncertainty_score":0.9999385},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020839346,0.0008877654,0.99559075,0.00034170423,0.00024878516,0.000525657,0.0000017948854,0.00025449262,0.00006510302],"genre_scores_gemma":[0.72197205,0.00031198034,0.2771534,0.00017336383,0.00018072569,0.000042854706,0.0000061146798,0.000027939526,0.00013155726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977346,0.000013846934,0.00024987638,0.0010090228,0.00063704106,0.0003555961],"domain_scores_gemma":[0.997817,0.0012757336,0.000089602814,0.00044876194,0.00016383706,0.00020508778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004729615,0.00026442285,0.00023003432,0.0007071836,0.00030848058,0.0002868298,0.0007631113,0.00016154916,0.0000018138037],"category_scores_gemma":[0.0009328231,0.00026878522,0.000023188051,0.00050036807,0.00015428833,0.00052206236,0.00091355556,0.00058601034,0.000017001727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028195773,0.0000073710507,0.0006513838,0.000051440336,0.000004825319,0.00004338904,0.00057878124,0.15840238,0.00008771021,0.001162106,0.000018272753,0.8389895],"study_design_scores_gemma":[0.00010415432,0.00014282475,0.0028105937,0.00015686142,0.000002794522,0.0004365885,6.097026e-8,0.992271,0.00030490445,0.0014184652,0.0020554136,0.00029632528],"about_ca_topic_score_codex":0.000016581582,"about_ca_topic_score_gemma":0.000007780492,"teacher_disagreement_score":0.8386932,"about_ca_system_score_codex":0.00017477422,"about_ca_system_score_gemma":0.0001916808,"threshold_uncertainty_score":0.99997646},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10318818,0.00017314353,0.8954766,0.000057152392,0.0003836714,0.00054095685,0.000011591795,0.000056177956,0.00011255271],"genre_scores_gemma":[0.99209785,0.00002033758,0.0075729345,0.00012383379,0.00006227626,0.000015197411,0.000021596637,0.000043037984,0.000042947227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978212,0.000026044087,0.0006137907,0.00060645177,0.00051279034,0.00041971696],"domain_scores_gemma":[0.9991483,0.00023600539,0.00013900973,0.00031231806,0.00008843723,0.0000759232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004451324,0.00038498078,0.00043514557,0.0013361298,0.00004919858,0.00019537134,0.00035386902,0.00030985373,0.000012811694],"category_scores_gemma":[0.000055262408,0.0004271265,0.00007162803,0.00048440593,0.00020668321,0.00034181474,0.00013114308,0.0005385248,0.000002290879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011504422,0.0000338604,0.0015107847,0.00007522021,0.000003844062,0.000032199372,0.00020828455,0.8850844,0.0006390072,0.00018692427,6.0998104e-7,0.11221338],"study_design_scores_gemma":[0.00031635707,0.000046218138,0.0020179423,0.000538937,0.000011818296,0.000002710447,0.0000032283988,0.99615586,0.00027991095,0.00016598174,0.00007041456,0.0003906178],"about_ca_topic_score_codex":0.000020389176,"about_ca_topic_score_gemma":0.0005526094,"teacher_disagreement_score":0.88890964,"about_ca_system_score_codex":0.00045460506,"about_ca_system_score_gemma":0.00009591221,"threshold_uncertainty_score":0.999818},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000070586335,0.0007077888,0.99649674,0.00073667825,0.00028663094,0.00022424509,0.0000016840237,0.00018524614,0.0012904287],"genre_scores_gemma":[0.59121627,0.00010645575,0.40769768,0.0007500132,0.00010301803,0.0000036925396,0.000004762897,0.00002062642,0.000097485434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963821,0.00003061285,0.0004788625,0.0016254561,0.0008217093,0.0006612657],"domain_scores_gemma":[0.9980657,0.00026629952,0.00017526565,0.0009767644,0.0002712485,0.00024469907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059833465,0.0005755014,0.0004866343,0.00055828656,0.00032672015,0.00062112114,0.0016743045,0.00038645716,0.000006054506],"category_scores_gemma":[0.000038305643,0.00049475813,0.00005987646,0.00048672387,0.00048156022,0.00078496704,0.0005850385,0.0011872253,0.000006122209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038875564,0.0000070428287,0.000015742942,0.0000064730316,0.000004150897,0.000025239153,0.00011845563,0.60148937,0.0000031916516,0.032922544,4.7708494e-7,0.36540344],"study_design_scores_gemma":[0.00014472163,0.00015349398,0.000049948234,0.0004284205,0.000006653094,0.000080927224,6.397079e-8,0.78603107,0.0000035650603,0.21258375,0.00001752597,0.0004998922],"about_ca_topic_score_codex":0.00002087973,"about_ca_topic_score_gemma":0.00012320517,"teacher_disagreement_score":0.5911457,"about_ca_system_score_codex":0.00018058145,"about_ca_system_score_gemma":0.0005842094,"threshold_uncertainty_score":0.99975044},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002685803,0.00020201744,0.9878358,0.0013804549,0.00047814127,0.0003241335,0.000004211991,0.00017187677,0.009576453],"genre_scores_gemma":[0.113097295,0.0001750677,0.8828437,0.0021670696,0.00038407187,0.000020505524,0.00000992083,0.000045913876,0.0012564624],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693024,0.00012265288,0.00059503684,0.00089205895,0.001032808,0.00042721262],"domain_scores_gemma":[0.996748,0.0012218435,0.00034760294,0.0013192934,0.00025345254,0.0001098233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002163175,0.00036385708,0.00034357116,0.00048589567,0.00037761693,0.00040596563,0.0035368952,0.00027638848,0.000047471724],"category_scores_gemma":[0.00010333161,0.0002735825,0.00015890104,0.00047813225,0.0015215719,0.00052190886,0.0006206077,0.000739051,0.000021441087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013139086,0.000016493832,0.0000059054246,0.0000064417954,0.000010416228,0.0000075501566,0.00074806955,0.0171828,0.000022092574,0.40232486,0.000037320526,0.57962495],"study_design_scores_gemma":[0.00013371311,0.0001515396,0.000043832017,0.00011863649,0.0000051832294,0.000024573204,3.9407604e-7,0.41987222,0.0012681363,0.5690118,0.009014194,0.00035576083],"about_ca_topic_score_codex":0.0000052230735,"about_ca_topic_score_gemma":0.000019493567,"teacher_disagreement_score":0.5792692,"about_ca_system_score_codex":0.00014716912,"about_ca_system_score_gemma":0.0009255048,"threshold_uncertainty_score":0.9999716},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017633662,0.0003302671,0.99675536,0.00025454897,0.00045815442,0.001086291,0.00003277754,0.0008580875,0.00020685025],"genre_scores_gemma":[0.031021355,0.000025055617,0.96702874,0.0011280989,0.0002949832,0.00029869625,0.000018505472,0.000056914618,0.00012764975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705726,0.000015184758,0.00041320545,0.0013410136,0.0006156457,0.00055771763],"domain_scores_gemma":[0.9973496,0.000285362,0.00019165844,0.0018217706,0.00019685847,0.00015471569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034670072,0.0004887866,0.00043361494,0.0007137871,0.00018139518,0.0002214579,0.0032187162,0.0002973806,0.000008380428],"category_scores_gemma":[0.000012286859,0.00048914825,0.00018836322,0.0003643943,0.00031679234,0.0002769127,0.00060553756,0.0005022531,0.000021301614],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027680017,0.000031757714,0.0000294127,0.00006382655,0.0000074065815,0.000037465907,0.0004529147,0.014948674,0.00018862424,0.0032654828,0.00016794814,0.9808037],"study_design_scores_gemma":[0.00034918022,0.00012881233,0.000032355365,0.0002727834,0.0000070672945,0.000038212736,2.005322e-8,0.91504544,0.0021280588,0.004273969,0.07701188,0.0007122119],"about_ca_topic_score_codex":0.000011906711,"about_ca_topic_score_gemma":0.00001560613,"teacher_disagreement_score":0.9800915,"about_ca_system_score_codex":0.00028288888,"about_ca_system_score_gemma":0.00047969515,"threshold_uncertainty_score":0.99975604},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0105786435,0.0001648627,0.9875343,0.00024172015,0.00062035787,0.0006843283,0.000010317009,0.000051728246,0.00011374787],"genre_scores_gemma":[0.7260492,0.0000039362067,0.27363563,0.00008953824,0.00014944367,0.000016080698,0.000009181561,0.000016857308,0.000030156905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646956,0.000040423573,0.00084933545,0.0011542755,0.0008798865,0.0006065252],"domain_scores_gemma":[0.99845284,0.00031606734,0.00043124516,0.0006400315,0.00006103283,0.00009879292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007000291,0.00041999805,0.00048314972,0.0010489915,0.00011474315,0.0001772195,0.0014171124,0.00017404204,0.000009171788],"category_scores_gemma":[0.000023602835,0.00041330972,0.00012594974,0.00048743267,0.00040138362,0.00017548318,0.00087091135,0.00040420878,0.000010970953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044166945,0.000057236797,0.0002878104,0.000024955714,0.000004029241,0.000019356197,0.0005813988,0.2708669,0.00024116148,0.0005427902,0.0000039571228,0.727366],"study_design_scores_gemma":[0.0010027379,0.00022192446,0.0063977563,0.00023518449,0.0000079858155,0.000021564749,9.4349997e-7,0.98119193,0.003579238,0.0064264964,0.00032786705,0.00058636785],"about_ca_topic_score_codex":0.000495159,"about_ca_topic_score_gemma":0.00036092315,"teacher_disagreement_score":0.72677964,"about_ca_system_score_codex":0.0005319257,"about_ca_system_score_gemma":0.00040622547,"threshold_uncertainty_score":0.99983186},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031085467,0.00042389918,0.9912388,0.0001538795,0.004330888,0.0006283389,0.0000045530273,0.00013560435,0.0030529846],"genre_scores_gemma":[0.0208023,0.000036055557,0.9751356,0.0015285322,0.0014869792,0.000026450558,0.0000069341418,0.00005744903,0.00091965724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959275,0.00003957823,0.00086496765,0.0015439356,0.000697618,0.0009263805],"domain_scores_gemma":[0.9973115,0.0008856904,0.00034613488,0.0009980561,0.00029987463,0.00015878947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021954647,0.00051072834,0.0006293659,0.001544171,0.00024770346,0.00038539837,0.002547709,0.00045993886,0.000009312743],"category_scores_gemma":[0.00007296082,0.00048110128,0.00021569862,0.0010402265,0.00031014078,0.00047510685,0.000675747,0.00088266475,0.000016589504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023588593,0.000016954331,0.000021623875,0.000020530873,0.0000064892006,0.00005566837,0.00035768904,0.017451217,0.000011207355,0.012548147,0.000021712855,0.9694864],"study_design_scores_gemma":[0.00035238414,0.0001651149,0.0000208584,0.000540733,0.000002968772,0.0000965804,3.403902e-7,0.95408344,0.00015592048,0.039876405,0.0041789636,0.000526317],"about_ca_topic_score_codex":0.000076377946,"about_ca_topic_score_gemma":0.00035951656,"teacher_disagreement_score":0.9689601,"about_ca_system_score_codex":0.0003236405,"about_ca_system_score_gemma":0.0002732621,"threshold_uncertainty_score":0.9997641},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024260987,0.0001222326,0.9687527,0.00023109639,0.00073112425,0.00075324276,0.0000814741,0.000104692655,0.004962468],"genre_scores_gemma":[0.9644115,0.000008408968,0.035008613,0.00028678504,0.00011133587,0.000016561287,0.000052443404,0.000032828553,0.00007153147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667084,0.000058889986,0.0011231441,0.00068714755,0.00095863995,0.0005013265],"domain_scores_gemma":[0.99821866,0.0006167454,0.00030863722,0.0005648387,0.00019032974,0.00010080279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000984001,0.00041554277,0.00058363617,0.00092336186,0.00016475121,0.00012943026,0.0010505943,0.00030781803,0.0007060322],"category_scores_gemma":[0.000082303835,0.00039883197,0.00013835702,0.0006054737,0.0006217387,0.0009505523,0.00008172643,0.00053646095,0.000070620794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021266262,0.00011068122,0.00000948315,0.000069710375,0.000002451339,0.000011329353,0.0013405504,0.966285,0.0075674346,0.00026410285,0.000012927134,0.024305096],"study_design_scores_gemma":[0.00084704167,0.00013363054,0.000086641645,0.00027749772,0.00001397313,0.000012856361,0.0000010550202,0.9777234,0.015962694,0.004395211,0.00013929872,0.00040670036],"about_ca_topic_score_codex":0.00006256148,"about_ca_topic_score_gemma":0.00011553243,"teacher_disagreement_score":0.9401505,"about_ca_system_score_codex":0.00019713421,"about_ca_system_score_gemma":0.00038500052,"threshold_uncertainty_score":0.99984634},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04349219,0.00024051953,0.95262384,0.00034113976,0.0009024405,0.0011257593,0.0000118440585,0.0000074067293,0.0012548555],"genre_scores_gemma":[0.9917237,0.000028721519,0.007762792,0.00009183168,0.00030674483,0.000014006099,0.000012726558,0.000012926508,0.000046545516],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998864,0.000048557464,0.00035029845,0.00029791612,0.00023494886,0.00020425626],"domain_scores_gemma":[0.99860734,0.00016445709,0.0004507324,0.00063385785,0.00011193109,0.000031674994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084383815,0.00021854625,0.00022057006,0.000053725933,0.000190083,0.000049208884,0.0006745193,0.00028898215,0.000007390446],"category_scores_gemma":[0.0000612157,0.00012333207,0.00010031742,0.0000838541,0.001830885,0.0000057648285,0.00025764538,0.00064802705,0.0000011975586],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033674476,0.000013946293,0.000041527157,0.00010928337,0.00006237742,0.0000016033688,0.00008687638,0.022743488,0.12665632,0.021965165,0.000015427539,0.8279672],"study_design_scores_gemma":[0.00045323235,0.002329534,0.000046953006,0.00090190687,0.000024543699,0.000054402,0.0000011674487,0.1799826,0.7466819,0.06537036,0.0036292637,0.0005241298],"about_ca_topic_score_codex":0.000013340396,"about_ca_topic_score_gemma":0.00007170681,"teacher_disagreement_score":0.9482315,"about_ca_system_score_codex":0.00002623009,"about_ca_system_score_gemma":0.00008605972,"threshold_uncertainty_score":0.6745972},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006782787,0.000593556,0.9916516,0.0003314509,0.00052476954,0.00036997377,0.000008092469,0.00022390056,0.006228807],"genre_scores_gemma":[0.051139783,0.0002042584,0.94661,0.00085880945,0.0003715397,0.000025477428,0.000026709247,0.000039851762,0.0007236195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670666,0.000029034753,0.00042443743,0.0014646043,0.0008178846,0.0005573702],"domain_scores_gemma":[0.9978879,0.00012885447,0.0003202063,0.0013093313,0.00021993194,0.00013375162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005262547,0.00047536302,0.00042896502,0.0005452582,0.00033510575,0.0003692867,0.0013515037,0.00020478205,0.000021775233],"category_scores_gemma":[0.00003495297,0.00037970828,0.000066289605,0.00054132164,0.00052107364,0.001530471,0.00044976108,0.00053691526,0.000057014026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013934673,0.000015901966,0.000022508539,0.00004206525,0.000006696611,0.00009274507,0.00043735595,0.029699767,0.00013060869,0.320061,0.000011410079,0.64946604],"study_design_scores_gemma":[0.0008606885,0.000848673,0.0010266429,0.0040015476,0.000026759808,0.00080337806,9.0725405e-7,0.688373,0.002154428,0.26481932,0.03456232,0.0025222905],"about_ca_topic_score_codex":0.000040316776,"about_ca_topic_score_gemma":0.000119595,"teacher_disagreement_score":0.6586733,"about_ca_system_score_codex":0.00026669833,"about_ca_system_score_gemma":0.00028527997,"threshold_uncertainty_score":0.9998655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002190312,0.0010855632,0.99458283,0.0010016258,0.0015051871,0.00097282097,0.000032499567,0.000120030614,0.00067752786],"genre_scores_gemma":[0.4202786,0.00006109002,0.5758893,0.0015981551,0.0012403558,0.00025316188,0.000056373385,0.000075846045,0.0005471159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964496,0.000014015778,0.0005424337,0.0016137185,0.0007937359,0.00058653136],"domain_scores_gemma":[0.9978838,0.0003824644,0.0002686526,0.0009812085,0.0003149491,0.00016890359],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080278405,0.00044656405,0.0005025024,0.00047003286,0.00027173926,0.00039475472,0.0029488245,0.0005481641,0.000018290139],"category_scores_gemma":[0.000039061906,0.00043175058,0.00014288006,0.0005137909,0.00046188495,0.00050291815,0.00016323125,0.0010834954,0.000026010386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001552153,0.00006424936,0.000013763339,0.00011034558,0.000007436165,0.000017011045,0.00096935587,0.062706076,0.0013179145,0.018711973,0.0000975973,0.9159688],"study_design_scores_gemma":[0.0007596838,0.00010258612,0.00018047531,0.0003836272,0.0000044154367,0.000044697743,5.2080185e-7,0.6778751,0.0014647619,0.2727343,0.045414016,0.0010358128],"about_ca_topic_score_codex":0.000019983818,"about_ca_topic_score_gemma":0.00027293642,"teacher_disagreement_score":0.91493297,"about_ca_system_score_codex":0.00015742838,"about_ca_system_score_gemma":0.0005979568,"threshold_uncertainty_score":0.99981344},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010479621,0.00014151394,0.9969612,0.00013705734,0.000661479,0.0008100151,0.000025188461,0.00091807544,0.00024071588],"genre_scores_gemma":[0.040031955,0.000034740224,0.9585987,0.000809856,0.00026475274,0.00003982204,0.000021152286,0.000051796236,0.00014725425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587864,0.000016981927,0.0006167824,0.0017487287,0.0009312546,0.00080760074],"domain_scores_gemma":[0.99719375,0.00011887994,0.0002530553,0.0018904215,0.00032882395,0.00021507157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083613425,0.0006935294,0.0006458598,0.0008019124,0.00030194796,0.00042468568,0.0041926866,0.00040087555,0.0000044795393],"category_scores_gemma":[0.000007884109,0.00069724757,0.00012004399,0.00036661525,0.00040435154,0.0012460263,0.00069247413,0.00064672984,0.0000092264245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021920875,0.00003109587,0.000003272244,0.000019973251,0.0000061277124,0.000010256152,0.00012068355,0.119922474,0.00015004014,0.046795513,0.000013891206,0.8329245],"study_design_scores_gemma":[0.00024083492,0.0004871563,0.000023714041,0.00022964037,0.000008708698,0.000034828096,1.1101791e-8,0.9193921,0.0039748806,0.07435337,0.00050130964,0.000753435],"about_ca_topic_score_codex":0.000014014437,"about_ca_topic_score_gemma":0.000006511669,"teacher_disagreement_score":0.832171,"about_ca_system_score_codex":0.0004436891,"about_ca_system_score_gemma":0.0005235048,"threshold_uncertainty_score":0.99954784},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.1248123e-7,0.00029935484,0.99494636,0.0016080328,0.0010920983,0.0009582835,0.000013689518,0.0003138767,0.00076802075],"genre_scores_gemma":[0.00060265453,0.000031696007,0.99563646,0.0028805365,0.00037402337,0.00004154162,0.000012406188,0.000040379487,0.00038032152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961838,0.000030023524,0.00048482444,0.0014739749,0.0009998071,0.0008275618],"domain_scores_gemma":[0.9971766,0.00068231305,0.00022566556,0.001158151,0.00049648876,0.00026077617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007539514,0.0004852218,0.0004810479,0.0009851076,0.000386038,0.00046330565,0.0029863229,0.00028544833,0.000020476888],"category_scores_gemma":[0.000080342885,0.0004537412,0.00018600559,0.00059730187,0.00049996056,0.0005023985,0.0006162832,0.0005650781,0.00004133346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002563712,0.000030387755,3.764088e-7,0.00002119278,0.0000071856393,0.00002684459,0.00034680916,0.14106461,0.0000050248877,0.0032892325,0.0001402355,0.8550655],"study_design_scores_gemma":[0.0005510624,0.00027183953,0.0000018119271,0.00016062436,0.0000041366843,0.000045115525,4.2421473e-8,0.9716779,0.00011314348,0.023007916,0.0036545496,0.0005118617],"about_ca_topic_score_codex":0.0000069825505,"about_ca_topic_score_gemma":0.000009590131,"teacher_disagreement_score":0.8545537,"about_ca_system_score_codex":0.00029099666,"about_ca_system_score_gemma":0.0013101122,"threshold_uncertainty_score":0.99979144},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004153777,0.00029272627,0.99428296,0.00011021915,0.0005053484,0.0002477057,0.0000016490258,0.000054071636,0.0003515383],"genre_scores_gemma":[0.8987259,0.00004691783,0.100865655,0.00026612164,0.000050941013,0.0000027981998,0.0000042265297,0.000015100463,0.000022343753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786454,0.000033601616,0.0004500861,0.00084544666,0.0004984977,0.00030780767],"domain_scores_gemma":[0.9988218,0.00019082612,0.00023647716,0.0005444408,0.00012747924,0.00007900364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066571066,0.0002860721,0.00035083463,0.0012700799,0.00012746903,0.00013647538,0.0008927056,0.00020732504,0.000005639328],"category_scores_gemma":[0.00004111584,0.0002754503,0.0000638797,0.0009056044,0.0005142279,0.000562676,0.00051077583,0.00031183276,0.0000024213016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000500038,0.000039018098,0.00031055487,0.000053882377,0.0000051043025,0.000036223344,0.0022539722,0.04804215,0.00050577347,0.8254649,6.0120055e-7,0.12328281],"study_design_scores_gemma":[0.00026325695,0.00009733662,0.0010572141,0.00046501175,0.000003818726,0.000022650112,2.850139e-7,0.20782374,0.0014853355,0.7884885,0.000014461479,0.0002783613],"about_ca_topic_score_codex":0.000035709636,"about_ca_topic_score_gemma":0.000048042453,"teacher_disagreement_score":0.89457214,"about_ca_system_score_codex":0.00009325498,"about_ca_system_score_gemma":0.0001774663,"threshold_uncertainty_score":0.9999698},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017717038,0.000029276325,0.99439394,0.00047706658,0.001532335,0.00073213334,0.000027600452,0.00005687082,0.0009790951],"genre_scores_gemma":[0.95982105,0.0000017167928,0.03911005,0.00026008644,0.00042184792,0.000057325906,0.000028657656,0.000027843791,0.00027140658],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963567,0.000114359,0.00072757987,0.0013879704,0.0010424658,0.0003708989],"domain_scores_gemma":[0.99525064,0.002616859,0.00048194436,0.0010522166,0.0004601401,0.00013820131],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004179571,0.000321826,0.000386526,0.00096245756,0.0004545806,0.00043587387,0.0017659169,0.0004369709,0.00010696879],"category_scores_gemma":[0.0005640952,0.0002882906,0.000109013636,0.0008686685,0.0008376756,0.0004382395,0.00011388962,0.0007691039,0.000025797097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020545594,0.00009966045,0.000029171988,0.000007844711,0.0000046439627,0.00000364479,0.00030491487,0.34900424,0.000972582,0.072417505,0.000018285275,0.5769321],"study_design_scores_gemma":[0.00028977034,0.00014382579,0.00021085661,0.000046020843,0.0000039732945,0.0000038712187,0.0000032434602,0.4690245,0.00063908315,0.52773017,0.0016675327,0.00023712256],"about_ca_topic_score_codex":0.000011790903,"about_ca_topic_score_gemma":0.00026985304,"teacher_disagreement_score":0.95804936,"about_ca_system_score_codex":0.00025250338,"about_ca_system_score_gemma":0.0005604629,"threshold_uncertainty_score":0.9999569},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025851394,0.00015010186,0.99195915,0.0033139593,0.0017483719,0.0021934635,0.00003288951,0.000105986655,0.00047023047],"genre_scores_gemma":[0.0019640382,0.00002000853,0.9954736,0.0014298633,0.000775131,0.000079365826,0.000015863923,0.000029447074,0.0002126665],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99637216,0.000050562838,0.00061326777,0.001494822,0.0006508113,0.0008184023],"domain_scores_gemma":[0.996016,0.0017738062,0.0002886253,0.001423424,0.00032814103,0.00016995163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025436422,0.0004723647,0.00047250447,0.0004837743,0.0008538004,0.0007864781,0.00304513,0.00022964433,0.000037380512],"category_scores_gemma":[0.0001796398,0.00035425072,0.00037498475,0.000683318,0.0003171403,0.00044974513,0.0007589692,0.0005022859,0.000004091449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014243081,0.00002777479,0.000051555686,0.000060097354,0.000020477535,0.000003771363,0.0016107567,0.0061563295,0.00003293976,0.25009587,0.00019028736,0.7417359],"study_design_scores_gemma":[0.00034461563,0.00015487616,0.000023590472,0.000057431807,0.00001225201,0.000025738602,5.0014233e-7,0.32930416,0.00019670729,0.62547266,0.044075552,0.0003318983],"about_ca_topic_score_codex":0.00008714689,"about_ca_topic_score_gemma":0.0004245716,"teacher_disagreement_score":0.741404,"about_ca_system_score_codex":0.00021800831,"about_ca_system_score_gemma":0.0007096256,"threshold_uncertainty_score":0.9998909},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006774284,0.00014018959,0.9926834,0.0017729099,0.0035202322,0.00023759277,0.0000072870866,0.00006856077,0.001502067],"genre_scores_gemma":[0.41203254,0.0029654119,0.5623818,0.007927695,0.0028737406,0.000041887153,0.00007505951,0.00021909185,0.011482778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678254,0.00003257695,0.0005621251,0.0008622756,0.0013039861,0.00045649084],"domain_scores_gemma":[0.9967601,0.0005058267,0.00040204028,0.0018181805,0.00037479482,0.00013911349],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011931853,0.0003488682,0.00036712099,0.00033748732,0.00035119764,0.0007465749,0.005464562,0.00020574454,0.000007466714],"category_scores_gemma":[0.00008494554,0.00023947777,0.00012500976,0.0005223676,0.0011454347,0.0003505019,0.0018283523,0.00080893387,0.000031992204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005240172,0.00013972893,0.0002516332,0.000059603142,0.000048342215,0.000054309145,0.0026441664,0.006329549,0.0011451278,0.33887562,0.0002924035,0.6501543],"study_design_scores_gemma":[0.0006194104,0.00042958293,0.0010315409,0.0005061063,0.00004114765,0.000068962305,0.0000014208207,0.6712098,0.01220715,0.28467473,0.027648391,0.0015617486],"about_ca_topic_score_codex":0.00001529117,"about_ca_topic_score_gemma":0.00016128838,"teacher_disagreement_score":0.6648803,"about_ca_system_score_codex":0.00006587315,"about_ca_system_score_gemma":0.0003503065,"threshold_uncertainty_score":0.9999164},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016413001,0.00018456012,0.97998047,0.00013021058,0.0023776588,0.00032985263,0.000002791364,0.00012683286,0.00045464226],"genre_scores_gemma":[0.89570487,0.000021246464,0.10353201,0.00023557805,0.00033373342,0.000004032568,0.0000050301583,0.00002758154,0.00013593871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664587,0.000045693654,0.00061020924,0.0011792991,0.0010751913,0.00044376706],"domain_scores_gemma":[0.99841666,0.00008245768,0.000431667,0.0005940896,0.00034776426,0.00012735446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006053327,0.00042909404,0.0004484008,0.0010089654,0.00027520728,0.00035646008,0.0012076732,0.00036061008,0.000048417853],"category_scores_gemma":[0.000049407387,0.00040651576,0.00022454851,0.0007468666,0.00041620084,0.0010669654,0.00048473687,0.0006526175,0.000021180278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020545664,0.00020703844,0.000098180935,0.00015572848,0.000033789896,0.00008179286,0.00058214366,0.04500933,0.06831797,0.027954254,0.000004732135,0.85753447],"study_design_scores_gemma":[0.0007110927,0.0006948771,0.0029642964,0.0009263336,0.000028800294,0.0003850723,9.556038e-7,0.93857926,0.013783262,0.04080077,0.00013233759,0.0009929562],"about_ca_topic_score_codex":0.00005269834,"about_ca_topic_score_gemma":0.00003160316,"teacher_disagreement_score":0.89356995,"about_ca_system_score_codex":0.0004534751,"about_ca_system_score_gemma":0.00051566126,"threshold_uncertainty_score":0.99983865},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026768554,0.00019316409,0.9869802,0.0003677297,0.0010930696,0.00023171917,0.000008522345,0.00011454604,0.010984306],"genre_scores_gemma":[0.38088056,0.00019478482,0.61777675,0.00066828314,0.0002024745,0.000004170124,0.000008026351,0.000025503557,0.0002394706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735284,0.00002378263,0.0005672243,0.0008478442,0.0007517659,0.00045652463],"domain_scores_gemma":[0.9980319,0.00030663292,0.00039086485,0.0007803023,0.00037788245,0.000112426904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005078258,0.00031921963,0.00040162815,0.0007421265,0.00028310952,0.00014756023,0.0013451219,0.00023626426,0.000096576034],"category_scores_gemma":[0.00010513001,0.0003272533,0.00012231052,0.00054627814,0.0018185367,0.000508687,0.00056768383,0.00048671398,0.000029792162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017510935,0.000021538519,0.00011391518,0.000025258652,0.000012491673,0.00003332564,0.00068235083,0.04820459,0.00012700605,0.03546497,0.000062071405,0.9152507],"study_design_scores_gemma":[0.0004968024,0.000120465986,0.00068438816,0.00053111085,0.000012075677,0.0004381,4.9547776e-7,0.9644462,0.0009011732,0.029860836,0.0016277275,0.00088066864],"about_ca_topic_score_codex":0.0000134977245,"about_ca_topic_score_gemma":0.00004584471,"teacher_disagreement_score":0.9162416,"about_ca_system_score_codex":0.00018463159,"about_ca_system_score_gemma":0.0009023653,"threshold_uncertainty_score":0.9999179},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000090302834,0.00029859395,0.98879707,0.0032150082,0.0021759544,0.00031509306,0.0000047478634,0.0023373892,0.002765845],"genre_scores_gemma":[0.06267611,0.000037094775,0.9273721,0.00802697,0.0008619195,0.000019534033,0.0000022811703,0.00005614564,0.0009478405],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961702,0.00003308303,0.00045736783,0.0015179076,0.001077362,0.0007440812],"domain_scores_gemma":[0.9953367,0.0014016414,0.00031008237,0.0025351394,0.00025933408,0.00015710565],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014017815,0.0005579655,0.00044387876,0.0006044915,0.00068571203,0.0010263337,0.0062376317,0.00045126324,0.000024630099],"category_scores_gemma":[0.00039605712,0.00040497255,0.00016319935,0.0006551088,0.0010225915,0.00040045404,0.002065055,0.0018491071,0.000116026255],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024012763,0.000030222582,0.00059104257,0.0000316187,0.00001270003,0.00009861789,0.001817043,0.0005180994,0.00021947894,0.0092810355,0.0012931497,0.9861046],"study_design_scores_gemma":[0.00014910707,0.00019502868,0.00015319766,0.0005778165,0.000014667352,0.00037748116,7.4310734e-8,0.09266762,0.0041631577,0.8861525,0.01450246,0.0010468907],"about_ca_topic_score_codex":0.00009066815,"about_ca_topic_score_gemma":0.00003256631,"teacher_disagreement_score":0.9850577,"about_ca_system_score_codex":0.00016538647,"about_ca_system_score_gemma":0.00048752656,"threshold_uncertainty_score":0.9998402},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060842016,0.0002836599,0.9902265,0.0005436329,0.00090723956,0.00056982005,0.0000039069046,0.0002985006,0.0071058865],"genre_scores_gemma":[0.05660048,0.00007649196,0.93827534,0.0008555076,0.0004166771,0.000030973984,0.0000040738887,0.000105366096,0.003635116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993881,0.00004456852,0.0005360867,0.0020984197,0.002171846,0.0012680948],"domain_scores_gemma":[0.9963836,0.00044730757,0.0002752292,0.0022602007,0.00031424788,0.000319396],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00067568105,0.0007353229,0.00064112595,0.0011574995,0.00043609258,0.0010453721,0.005521765,0.00026770867,0.00004649772],"category_scores_gemma":[0.000055592613,0.0006251734,0.00010466983,0.0010186961,0.0010138553,0.00096144027,0.0036028237,0.0013136953,0.00013684433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001191772,0.000051401385,0.000040890165,0.0000634349,0.000021912796,0.0005578496,0.0007852809,0.2799994,0.000050796825,0.0025540888,0.000021329075,0.7158417],"study_design_scores_gemma":[0.0006014543,0.00044530592,0.00006958602,0.00067616295,0.0000058430746,0.00027095477,2.4869567e-7,0.9817252,0.000550488,0.011543305,0.0031463408,0.00096508046],"about_ca_topic_score_codex":0.000022980637,"about_ca_topic_score_gemma":0.00005835374,"teacher_disagreement_score":0.7148766,"about_ca_system_score_codex":0.0006864566,"about_ca_system_score_gemma":0.00028403534,"threshold_uncertainty_score":0.99999166},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012790799,0.002281219,0.9917862,0.0015839316,0.0022996578,0.0005548279,0.000002956926,0.00019569005,0.0011675989],"genre_scores_gemma":[0.075603426,0.00005191587,0.92210186,0.0009845542,0.00079348724,0.000019790035,0.000004448396,0.000036264286,0.00040426003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631095,0.00003253872,0.00062535296,0.0015544732,0.00054814003,0.00092857203],"domain_scores_gemma":[0.99714607,0.001221312,0.0002616845,0.0010931198,0.00018593976,0.0000918737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010177122,0.00052787183,0.0006937712,0.00080325775,0.00020415579,0.0005407575,0.0029723844,0.00043674727,0.0000039726965],"category_scores_gemma":[0.00015693445,0.00048201092,0.00014616999,0.00055232306,0.00065699813,0.00025505046,0.00092651794,0.00062416855,0.0000051771062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008843932,0.000026262867,0.00033870916,0.000044285745,0.000007638815,0.00015743793,0.00020455908,0.6790579,0.000023693643,0.032872893,0.00046983224,0.28678796],"study_design_scores_gemma":[0.00032162425,0.00010015421,0.0003414477,0.00036104574,0.0000051133065,0.0000510454,2.0773787e-7,0.87556505,0.00019245174,0.12080656,0.0016966588,0.0005586225],"about_ca_topic_score_codex":0.00018379085,"about_ca_topic_score_gemma":0.000506013,"teacher_disagreement_score":0.28622934,"about_ca_system_score_codex":0.00023452111,"about_ca_system_score_gemma":0.0002974502,"threshold_uncertainty_score":0.99976313},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019510906,0.0004061417,0.9724938,0.0009869377,0.0040958817,0.0007064483,0.000002561763,0.0004330194,0.0013642493],"genre_scores_gemma":[0.59979624,0.000025045929,0.39836663,0.0011643159,0.00043074627,0.000010451072,0.000004474481,0.000029412158,0.00017266945],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948129,0.00014844649,0.00078195584,0.0022384454,0.0009799586,0.001038285],"domain_scores_gemma":[0.9963218,0.00066877215,0.00046507345,0.0019333662,0.00040101854,0.00020994963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011500084,0.0007788419,0.000912389,0.001155514,0.00048790415,0.0009729801,0.0043591084,0.00051763724,0.000020214591],"category_scores_gemma":[0.0003354192,0.0006907892,0.00011111601,0.00081122183,0.0007016911,0.0015397517,0.00094940467,0.0009838383,0.000013426791],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010554573,0.00019304798,0.001896331,0.0000130021,0.000023403225,0.00031680014,0.003559228,0.0055756997,0.000101602134,0.008560634,0.0000108653785,0.97973883],"study_design_scores_gemma":[0.0027508629,0.0062396675,0.14139228,0.0011108434,0.00023401325,0.0035500985,0.00018281997,0.32092014,0.00542189,0.5030288,0.006321955,0.008846605],"about_ca_topic_score_codex":0.0006321285,"about_ca_topic_score_gemma":0.007443518,"teacher_disagreement_score":0.97089225,"about_ca_system_score_codex":0.0006997396,"about_ca_system_score_gemma":0.001995619,"threshold_uncertainty_score":0.99955434},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013114324,0.0007995146,0.9886414,0.0009206865,0.00076485664,0.00021483276,0.0000034406842,0.0000920807,0.008432039],"genre_scores_gemma":[0.7898289,0.00049828674,0.2077238,0.0008165628,0.0003409158,0.000010821984,0.0000019841013,0.000035854417,0.0007429017],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99674493,0.00005831891,0.00058902253,0.0011370633,0.00091241277,0.0005582631],"domain_scores_gemma":[0.99670845,0.00084015966,0.00027112558,0.0017574393,0.0002961055,0.00012671956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001242481,0.0003876617,0.00043549613,0.00026046232,0.00036576684,0.00039165976,0.0044499016,0.00025370516,0.000023103485],"category_scores_gemma":[0.000115277544,0.00027467514,0.00015482417,0.00045113763,0.0015136695,0.00033358712,0.00084045617,0.000837049,0.000034369066],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059493723,0.000015164011,0.000024608757,0.000014473336,0.000006973012,0.0000092978935,0.00040385887,0.013380981,0.000035256704,0.0689598,0.000013967962,0.91712964],"study_design_scores_gemma":[0.00009022316,0.00013137824,0.00011175052,0.00019955181,0.000004548679,0.0000223266,1.2727564e-7,0.3259539,0.0008757155,0.670662,0.0015998692,0.0003486112],"about_ca_topic_score_codex":0.000044780798,"about_ca_topic_score_gemma":0.0000527715,"teacher_disagreement_score":0.91678107,"about_ca_system_score_codex":0.00013065747,"about_ca_system_score_gemma":0.00070172054,"threshold_uncertainty_score":0.99997056},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032291457,0.00019871544,0.98335165,0.00054077414,0.0013706847,0.00041922808,0.0000020382197,0.00055705226,0.01352756],"genre_scores_gemma":[0.0062333653,0.00010745814,0.991032,0.0013795571,0.0005441636,0.000007868577,0.00001081751,0.000046410947,0.0006383691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958419,0.0000522984,0.00073034666,0.0016231013,0.0010319514,0.0007203807],"domain_scores_gemma":[0.9974939,0.0002962304,0.00039429113,0.0014353929,0.0002589843,0.00012120387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010325662,0.00057496486,0.0006203789,0.0009897763,0.00028850118,0.0009305377,0.0041937274,0.0005918744,0.00005909391],"category_scores_gemma":[0.00010781705,0.0005778437,0.0001229794,0.0010254484,0.00047949425,0.0009441974,0.001538876,0.0011957545,0.00008788273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015887254,0.00014200865,0.00010877701,0.00008612109,0.000016902515,0.00025554118,0.0048990976,0.65697086,0.0008875876,0.07949153,0.00019827834,0.2569274],"study_design_scores_gemma":[0.0002998341,0.0000906632,0.000037129128,0.00046922907,0.000005261889,0.000055021883,1.0054008e-7,0.84731126,0.0043949606,0.14281909,0.0036360158,0.0008814241],"about_ca_topic_score_codex":0.000028121269,"about_ca_topic_score_gemma":0.00003983315,"teacher_disagreement_score":0.25604597,"about_ca_system_score_codex":0.0003063743,"about_ca_system_score_gemma":0.0004357299,"threshold_uncertainty_score":0.9996673},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000052181426,0.0020226748,0.99433494,0.00048376393,0.0012079322,0.0006506899,0.000024110313,0.0005858256,0.00068483653],"genre_scores_gemma":[0.033666637,0.000011265258,0.9653033,0.00032575315,0.0005106946,0.000030332294,0.000029851104,0.000043708395,0.00007845425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675757,0.000024478422,0.00047216026,0.0014485164,0.0006974356,0.0005998721],"domain_scores_gemma":[0.99755555,0.0008134093,0.00022957058,0.0009943418,0.0002660329,0.00014107539],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010204087,0.00049631245,0.0004729528,0.0005988002,0.00028524347,0.0007018471,0.0027766703,0.00049525464,0.00001228128],"category_scores_gemma":[0.00030825275,0.00044434823,0.000106976666,0.00039661775,0.0005348661,0.0007088938,0.00054493616,0.0013368957,0.0000029706105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008273854,0.000014218952,0.0000035499286,0.00007730972,0.0000047272647,0.000017402279,0.00070318644,0.00038796233,0.00016745272,0.049658872,0.0000059159297,0.9489511],"study_design_scores_gemma":[0.00020580726,0.00009425736,0.000005485667,0.00018947948,0.0000089268415,0.00002894255,9.066124e-8,0.5018255,0.0031406647,0.49179262,0.0021459935,0.000562197],"about_ca_topic_score_codex":0.000011595846,"about_ca_topic_score_gemma":0.00010825368,"teacher_disagreement_score":0.94838893,"about_ca_system_score_codex":0.00013494997,"about_ca_system_score_gemma":0.00029637443,"threshold_uncertainty_score":0.9998008},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010088746,0.00065874256,0.99140567,0.00064605294,0.0040352326,0.00073182007,0.00006004804,0.0002995502,0.0021527698],"genre_scores_gemma":[0.0011795417,0.00012321163,0.99528915,0.0013020318,0.0015447142,0.000029686373,0.000020325084,0.000051112762,0.00046021672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99499804,0.000019769335,0.0007284257,0.0020814282,0.0011100866,0.0010622515],"domain_scores_gemma":[0.99659795,0.0007774399,0.0003438514,0.0016466437,0.00034641466,0.000287698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067287515,0.00076707645,0.0007802695,0.001148013,0.0006506161,0.0005740142,0.0047031455,0.0004819651,0.00003694929],"category_scores_gemma":[0.00004937036,0.0007388111,0.0004076149,0.0007109079,0.0010873986,0.00071719906,0.0012310843,0.0009877781,0.000048402402],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051327047,0.000042563384,0.000001476623,0.00001899967,0.000017519616,0.00010082901,0.00034323733,0.001381715,0.000014844198,0.0008566097,0.0008841271,0.99633294],"study_design_scores_gemma":[0.00056325,0.00022603606,0.000045423276,0.0001959466,0.000008043811,0.00014811703,6.515877e-8,0.91056085,0.00056670746,0.061917447,0.024861239,0.00090685725],"about_ca_topic_score_codex":0.000028418455,"about_ca_topic_score_gemma":0.00003864307,"teacher_disagreement_score":0.99542606,"about_ca_system_score_codex":0.00029877233,"about_ca_system_score_gemma":0.00087440363,"threshold_uncertainty_score":0.9995063},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067172875,0.0007644063,0.9888523,0.001551901,0.0026396438,0.0006833812,0.000035287267,0.00037251328,0.004428788],"genre_scores_gemma":[0.25603774,0.000054990818,0.7374582,0.0029926428,0.0029384927,0.00007453015,0.00005673579,0.000094341085,0.00029228564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954478,0.000035590503,0.0006591561,0.0018603682,0.001021248,0.0009757952],"domain_scores_gemma":[0.9967971,0.00078389165,0.00030494248,0.0015182529,0.0003472896,0.00024853286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048742615,0.0007112676,0.00063769316,0.0010657406,0.00063642405,0.0008384273,0.0047630807,0.00039819384,0.000006911714],"category_scores_gemma":[0.0000055140586,0.00065766537,0.00025528166,0.0007591565,0.00036636862,0.00065796275,0.0014359877,0.000886434,0.000028916038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056098746,0.0002559754,0.0007602749,0.0009838227,0.000101037665,0.00018702226,0.0036662521,0.11448377,0.004741119,0.07679974,0.00007263333,0.7978922],"study_design_scores_gemma":[0.0008529156,0.00036717183,0.00043291305,0.0015996627,0.00003879933,0.00010968596,8.1645663e-7,0.7115654,0.005272365,0.2658703,0.012392471,0.0014975378],"about_ca_topic_score_codex":0.00009181494,"about_ca_topic_score_gemma":0.000310454,"teacher_disagreement_score":0.7963947,"about_ca_system_score_codex":0.00019786235,"about_ca_system_score_gemma":0.00042414485,"threshold_uncertainty_score":0.9995875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003726037,0.0034366217,0.9923625,0.0005884819,0.000796576,0.00047230168,0.000002003121,0.00054595195,0.0017582919],"genre_scores_gemma":[0.0584686,0.000015669173,0.9406972,0.00039597476,0.00028803552,0.000004906301,0.0000065868103,0.00004043832,0.000082602804],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963172,0.000029259552,0.00062601845,0.0014577714,0.0010695228,0.00050022115],"domain_scores_gemma":[0.99794865,0.00015882749,0.0003911014,0.0011737762,0.00021864084,0.00010901955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009559041,0.00049916375,0.00044474198,0.0008932441,0.00023030366,0.00047527172,0.0020224408,0.00045864418,0.000020729474],"category_scores_gemma":[0.000041831125,0.0004627151,0.00015241365,0.0006910782,0.00039226416,0.0011848162,0.0002473872,0.0008112704,0.000006965212],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046652517,0.00001636331,0.0000045565725,0.00005201008,0.0000070561014,0.0004149229,0.001280666,0.012273781,0.0022464455,0.006696838,0.0000011044275,0.9770016],"study_design_scores_gemma":[0.00026406982,0.00007251855,0.000004811088,0.0008034608,0.000016298733,0.0006819626,9.981087e-8,0.35485202,0.012381691,0.6299672,0.00020382131,0.000752057],"about_ca_topic_score_codex":0.000064121734,"about_ca_topic_score_gemma":0.00004662975,"teacher_disagreement_score":0.9762495,"about_ca_system_score_codex":0.000498123,"about_ca_system_score_gemma":0.00087217777,"threshold_uncertainty_score":0.99978244},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006008982,0.00037295243,0.9937098,0.0012303651,0.0020514952,0.0006654289,0.000008897943,0.00072024297,0.0006399008],"genre_scores_gemma":[0.30922955,0.000047777463,0.68521696,0.0024079012,0.0012521878,0.00007836471,0.00000980749,0.00015886468,0.0015985707],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926763,0.00007615188,0.00068863365,0.002411418,0.0028183104,0.0013291615],"domain_scores_gemma":[0.9935614,0.00222572,0.00017152738,0.0029219114,0.0005020965,0.00061737996],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016604235,0.0008108524,0.0008368683,0.0014837083,0.00026968657,0.00082752923,0.0066143475,0.00044027824,0.00005201179],"category_scores_gemma":[0.0017654693,0.00071686413,0.00021697141,0.0013709303,0.0003773227,0.0004520212,0.0031073843,0.0014725394,0.0001973837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000097330085,0.00004716699,0.001155998,0.00007268949,0.000018767385,0.00017118365,0.00069235,0.020187436,0.00011603316,0.0045812814,0.00010951375,0.97283787],"study_design_scores_gemma":[0.0041840207,0.0032303599,0.12832984,0.008249903,0.000071776194,0.0010894297,0.0000012308203,0.30533987,0.011933696,0.47875452,0.04243984,0.01637549],"about_ca_topic_score_codex":0.00005229748,"about_ca_topic_score_gemma":0.00012784344,"teacher_disagreement_score":0.9564624,"about_ca_system_score_codex":0.00090631883,"about_ca_system_score_gemma":0.00044535406,"threshold_uncertainty_score":0.9995282},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015398134,0.00047880766,0.89997613,0.0009945172,0.0011658247,0.0003319754,0.00000396887,0.00006296008,0.09683185],"genre_scores_gemma":[0.84971154,0.000050198472,0.14638549,0.0033434662,0.00029771193,0.000015860596,0.000005351367,0.00002923272,0.00016117592],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965617,0.00017624868,0.00063603226,0.0011141249,0.0008909297,0.0006209306],"domain_scores_gemma":[0.9963866,0.0015104719,0.00033637724,0.001558661,0.00013145556,0.00007642066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027818126,0.00043786052,0.0004854898,0.0006700272,0.0002035849,0.00034343687,0.0045381896,0.0002775999,0.00003561658],"category_scores_gemma":[0.000155213,0.00030278158,0.00016941951,0.0010903222,0.00075107894,0.00047718003,0.001009286,0.0010416294,0.00002506041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014037445,0.000061091036,0.0002756998,0.00003640123,0.00001252469,0.00013174867,0.0057790545,0.021871706,0.000008401245,0.1245057,0.000067846304,0.8472358],"study_design_scores_gemma":[0.0002445481,0.00022838578,0.00037554768,0.0005463085,0.000011090023,0.0001736113,0.0000061317564,0.18073127,0.000038813243,0.8154048,0.0016808249,0.0005586893],"about_ca_topic_score_codex":0.000040884202,"about_ca_topic_score_gemma":0.000130103,"teacher_disagreement_score":0.8495575,"about_ca_system_score_codex":0.00015873722,"about_ca_system_score_gemma":0.00027137765,"threshold_uncertainty_score":0.9999424},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009458561,0.0013191119,0.99536157,0.00036882062,0.0010406373,0.00041917225,0.0000029316777,0.00015373998,0.0012394359],"genre_scores_gemma":[0.26180682,0.00032249623,0.7357914,0.0014884257,0.00040019464,0.000008606128,0.000008643219,0.0000589131,0.000114544775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637914,0.00006032696,0.0005642459,0.0013442282,0.0010679212,0.00058414927],"domain_scores_gemma":[0.9970497,0.0004435674,0.0004457101,0.0015466998,0.00035757618,0.00015677427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004115019,0.0005351564,0.0005785204,0.000913746,0.00021531578,0.000164129,0.003556065,0.0003137229,0.000017553928],"category_scores_gemma":[0.000018057932,0.0004864095,0.00012976202,0.0009282015,0.00046374617,0.0004202329,0.0011054232,0.00049572974,0.00002954427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015322184,0.00005510222,0.000030274425,0.00012310212,0.000031344178,0.00019403089,0.003941152,0.570839,0.00056003,0.0040766294,0.00001603267,0.420118],"study_design_scores_gemma":[0.00038798325,0.0004860786,0.000032174117,0.0005943503,0.000016732518,0.00041751063,1.9238442e-7,0.91810894,0.03722917,0.04013143,0.0016552861,0.0009401293],"about_ca_topic_score_codex":0.000047215497,"about_ca_topic_score_gemma":0.00006757182,"teacher_disagreement_score":0.4191779,"about_ca_system_score_codex":0.0001625264,"about_ca_system_score_gemma":0.00062190427,"threshold_uncertainty_score":0.9997588},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051980016,0.00008114261,0.9965781,0.00023393471,0.0007878706,0.0011658581,0.000008012918,0.00024692857,0.00084617734],"genre_scores_gemma":[0.21994306,0.000010896111,0.77915025,0.00046866588,0.00033001628,0.000035944682,0.000007377523,0.0000259643,0.000027814993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963415,0.00008633903,0.00075087685,0.0012685347,0.0010716636,0.00048107025],"domain_scores_gemma":[0.99640906,0.00018276079,0.00058814284,0.0020197881,0.0006536037,0.00014667174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010804856,0.00044458915,0.0006156647,0.0007099864,0.00015565973,0.000207568,0.0041734837,0.0002696308,0.0000039710026],"category_scores_gemma":[0.000034960605,0.00034688812,0.00016140938,0.0010171169,0.00072207284,0.0006286372,0.000690844,0.00052991597,0.000004090557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012794943,0.00008970927,0.000022621905,0.00003372566,0.000010971631,0.0000036598458,0.0005807693,0.15789884,0.00030461277,0.008621652,0.000009031168,0.8324116],"study_design_scores_gemma":[0.0003262519,0.00092411187,0.0001193634,0.00023008372,0.000014646807,0.00008371735,3.9144277e-7,0.95435786,0.0060495827,0.035331797,0.0020273512,0.0005348254],"about_ca_topic_score_codex":0.000039638602,"about_ca_topic_score_gemma":0.000032692315,"teacher_disagreement_score":0.83187675,"about_ca_system_score_codex":0.00017517597,"about_ca_system_score_gemma":0.00028058665,"threshold_uncertainty_score":0.9998983},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040245923,0.00046339683,0.9716127,0.0013465278,0.002121783,0.00046022033,0.00001237002,0.0004636895,0.023479104],"genre_scores_gemma":[0.12973654,0.0001884901,0.8585356,0.005663048,0.0024504762,0.00002612889,0.000031877975,0.00015200401,0.0032158182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947318,0.000060937677,0.0007733157,0.002040755,0.0013355421,0.0010576623],"domain_scores_gemma":[0.9967333,0.00038465875,0.00032413803,0.0019221485,0.00029673884,0.00033900767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010314329,0.000713086,0.0007552901,0.0006742713,0.00036350562,0.00102224,0.0045281765,0.0005137186,0.00003860864],"category_scores_gemma":[0.00006689592,0.00064795767,0.000185418,0.001015402,0.0004653822,0.0007840621,0.0017556754,0.0013075722,0.00020892956],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000126171035,0.00014075868,0.00014164847,0.00016841394,0.00004976077,0.0007684061,0.0020222932,0.012557372,0.00008028745,0.09901144,0.0006193537,0.88442767],"study_design_scores_gemma":[0.0007185946,0.00022340778,0.00010774533,0.0007478183,0.000014785735,0.00068650075,2.0910821e-7,0.76833993,0.0002645204,0.10021276,0.12707599,0.0016077494],"about_ca_topic_score_codex":0.000016677777,"about_ca_topic_score_gemma":0.000029072819,"teacher_disagreement_score":0.8828199,"about_ca_system_score_codex":0.000441282,"about_ca_system_score_gemma":0.00070009765,"threshold_uncertainty_score":0.9995972},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085793546,0.000058055477,0.99736285,0.000062471285,0.00032381428,0.0010262349,8.374313e-7,0.00013842672,0.00016937547],"genre_scores_gemma":[0.48945558,0.00002410027,0.51012087,0.00024263091,0.00006305808,0.000008477135,0.0000072099524,0.000036191865,0.000041853207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940781,0.0000818006,0.00094287156,0.0019491101,0.001859563,0.0010885352],"domain_scores_gemma":[0.99753773,0.00034560572,0.00068091834,0.0010968086,0.00018218235,0.00015677176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010977329,0.00082914287,0.00071840244,0.0014078525,0.0004990694,0.000567285,0.0021012188,0.0003509145,0.000059004502],"category_scores_gemma":[0.00009580055,0.00076861965,0.00013252467,0.0007685847,0.00052277395,0.0008120486,0.00169274,0.0016579205,0.00004921894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019305291,0.00003075158,0.00095697003,0.000028934275,0.000014906674,0.0001090996,0.00216468,0.9465256,0.0004192832,0.00025710172,5.251152e-7,0.049472895],"study_design_scores_gemma":[0.0011544762,0.0004862364,0.0038397738,0.0015300312,0.000014420984,0.00007485309,0.0000023634468,0.99095005,0.00012168031,0.0008490243,0.00009479853,0.0008822911],"about_ca_topic_score_codex":0.00007395181,"about_ca_topic_score_gemma":0.000058036778,"teacher_disagreement_score":0.48859766,"about_ca_system_score_codex":0.0043051466,"about_ca_system_score_gemma":0.000578296,"threshold_uncertainty_score":0.99951714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019589458,0.00027439973,0.9944975,0.00017062676,0.0029886663,0.00020932835,0.00000426815,0.0005251813,0.0011341538],"genre_scores_gemma":[0.009354111,0.000035950754,0.9898689,0.00015091103,0.00022769085,0.0000039305955,0.0000014846713,0.000036549918,0.0003204948],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99678653,0.00003442778,0.0005388142,0.0012359277,0.0007924333,0.0006118691],"domain_scores_gemma":[0.9958023,0.0017871744,0.0003822286,0.0016660426,0.0002362553,0.00012600978],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012818298,0.00048801443,0.0006468872,0.000998177,0.00013523662,0.00015056519,0.0040043714,0.0004226558,0.000012831362],"category_scores_gemma":[0.00069605466,0.00045863248,0.00013237874,0.00072507194,0.00073880167,0.00057718233,0.0016550617,0.0013917822,0.00002534042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055177925,0.000021071799,0.00004255964,0.000111554335,0.000018881445,0.00011335812,0.0009195908,0.3130612,0.0116354665,0.02439933,0.000004172141,0.6496673],"study_design_scores_gemma":[0.00037104954,0.00026679417,0.0001940472,0.00075279566,0.000014334422,0.000116037685,1.6229339e-7,0.1464254,0.06516404,0.7837137,0.0015142973,0.0014673552],"about_ca_topic_score_codex":0.000008750528,"about_ca_topic_score_gemma":0.000019355552,"teacher_disagreement_score":0.75931436,"about_ca_system_score_codex":0.00015788239,"about_ca_system_score_gemma":0.0003320198,"threshold_uncertainty_score":0.99978656},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011659262,0.00004431591,0.9937164,0.0028317499,0.000809225,0.001416069,0.00007324028,0.0007205372,0.0002718455],"genre_scores_gemma":[0.13025887,0.0000036212505,0.86848176,0.0009779336,0.0001038419,0.00009364461,0.000006837886,0.00003765355,0.000035860103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99524033,0.000076346674,0.00055756076,0.0023378367,0.0010003078,0.0007875962],"domain_scores_gemma":[0.99340755,0.00362655,0.00035351145,0.0020471779,0.00032540248,0.00023980805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014885372,0.0006693613,0.00064655853,0.0009921845,0.00052686717,0.00064676016,0.0040585618,0.0003713288,0.00003178175],"category_scores_gemma":[0.00078681076,0.00058229634,0.00020032968,0.00092648854,0.00043863076,0.0003248147,0.0003617693,0.00063967664,0.000021937061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029885112,0.000087448796,0.000012020957,0.000020683015,0.0000064433502,0.0000045398533,0.00048183856,0.5728508,0.00024729312,0.056107637,0.0000066780117,0.37014472],"study_design_scores_gemma":[0.00056891557,0.00086366397,0.00013529838,0.00016148739,0.000013777571,0.0000025191332,5.2146044e-7,0.6963485,0.012148962,0.28860882,0.00055779313,0.000589768],"about_ca_topic_score_codex":0.00003887241,"about_ca_topic_score_gemma":0.000040360548,"teacher_disagreement_score":0.36955494,"about_ca_system_score_codex":0.00049458444,"about_ca_system_score_gemma":0.00060766935,"threshold_uncertainty_score":0.9996629},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008624057,0.00028726467,0.9966715,0.000051643656,0.0005922596,0.00034853295,0.000005189218,0.00013376294,0.001047434],"genre_scores_gemma":[0.881112,0.00008712648,0.11753791,0.0005357499,0.0001697956,0.000006964388,0.00002473739,0.00006639749,0.0004593172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998772,0.000009435292,0.0002657725,0.00041721825,0.00030375418,0.00023179082],"domain_scores_gemma":[0.99940616,0.000122040736,0.00005898275,0.00026841083,0.000089481735,0.00005493891],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022098028,0.0002642257,0.00019668952,0.00036912362,0.000091037895,0.00015134604,0.00018140633,0.00021709433,0.000016008566],"category_scores_gemma":[0.000035000397,0.0002671478,0.000035846057,0.0001766724,0.0001374165,0.00018788915,0.00006222837,0.00030467572,0.000010491731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011066705,0.00000417781,0.00006835681,0.000034847002,0.000003531245,0.0000030182905,0.00025163995,0.9162287,0.000050608705,0.0003685225,0.00000399049,0.08298149],"study_design_scores_gemma":[0.000201845,0.000019585155,0.00033237782,0.00007805954,0.000006935405,0.0000050919216,1.3451192e-7,0.9933206,0.00007232551,0.0045570782,0.0011175753,0.00028843217],"about_ca_topic_score_codex":0.0000039920646,"about_ca_topic_score_gemma":0.000043111202,"teacher_disagreement_score":0.8802496,"about_ca_system_score_codex":0.00018631817,"about_ca_system_score_gemma":0.000050865303,"threshold_uncertainty_score":0.99997807},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024767423,0.00082255574,0.99286944,0.0017002877,0.0016786141,0.0009210924,0.00001713958,0.00009058397,0.001875531],"genre_scores_gemma":[0.16245525,0.0005305138,0.80488414,0.00214974,0.0027635125,0.00013135718,0.000021084126,0.0002635735,0.02680084],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899113,0.000110557936,0.0011359701,0.0021613052,0.0054343464,0.0012465114],"domain_scores_gemma":[0.99072075,0.005093814,0.0005202977,0.0022157454,0.0011365092,0.00031286507],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00531014,0.0006036992,0.0006738952,0.0011418747,0.0011148293,0.0016592323,0.006657433,0.0003938449,0.000218164],"category_scores_gemma":[0.0027961477,0.00035371972,0.00022876445,0.001628708,0.0036504525,0.0005413105,0.0018096602,0.0016938632,0.00053894677],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021908318,0.000028538874,0.000038268867,0.0000076959,0.000011162589,0.000111875466,0.00043761593,0.116331495,0.000052780168,0.0014837706,0.000091682785,0.8813832],"study_design_scores_gemma":[0.0008092171,0.0001953489,0.00031475688,0.00021824375,0.0000058320516,0.00005670367,0.000001306056,0.15470679,0.000925641,0.8213385,0.020734169,0.00069352175],"about_ca_topic_score_codex":0.00002961102,"about_ca_topic_score_gemma":0.00038455243,"teacher_disagreement_score":0.8806897,"about_ca_system_score_codex":0.00075494754,"about_ca_system_score_gemma":0.0015294518,"threshold_uncertainty_score":0.99989146},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00869245,0.0017744747,0.9859395,0.0018023623,0.0009090151,0.0004893544,0.0000019222073,0.000055584984,0.0003353294],"genre_scores_gemma":[0.68570054,0.00049473264,0.31185013,0.0012860468,0.0002935378,0.00003288616,0.000007964819,0.000028574612,0.0003055705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979027,0.00004235539,0.0003627,0.00086873816,0.00046771852,0.00035579695],"domain_scores_gemma":[0.99818236,0.0008547292,0.00015180974,0.0005831388,0.00011157085,0.000116385825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094440335,0.0002813879,0.00025664686,0.00043369643,0.00038039644,0.0005507957,0.00083234534,0.00017383258,0.0000023068396],"category_scores_gemma":[0.00011271013,0.0002082535,0.00003387709,0.0004564456,0.00046485243,0.0003525194,0.0007955123,0.0006155537,0.0000045045244],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039584424,0.000035675745,0.00022624369,0.00005761999,0.000012166786,0.000029668894,0.002561887,0.023293952,0.0016220636,0.019210767,0.000023886347,0.9529221],"study_design_scores_gemma":[0.00025760432,0.00015130572,0.0019012077,0.0002661101,0.0000058580167,0.00012372437,3.8805723e-7,0.6949204,0.00047111587,0.2987619,0.0027225765,0.00041779372],"about_ca_topic_score_codex":0.000025640866,"about_ca_topic_score_gemma":0.0006725298,"teacher_disagreement_score":0.95250434,"about_ca_system_score_codex":0.00007147481,"about_ca_system_score_gemma":0.00021732948,"threshold_uncertainty_score":0.84923315},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088469737,0.0011645929,0.993001,0.0000101410515,0.0008005088,0.00027005843,0.000005205558,0.00009979044,0.0037640184],"genre_scores_gemma":[0.83156675,0.000449022,0.1672978,0.00008315706,0.00044834922,0.000009172733,0.000021407996,0.00007002912,0.000054284723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768734,0.000029990071,0.00040351544,0.0004103397,0.0012326193,0.00023619422],"domain_scores_gemma":[0.99879366,0.00018100192,0.00014512142,0.00048290307,0.00035094,0.000046374305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084028405,0.00025191988,0.00031889562,0.0002823999,0.000050699062,0.000021626549,0.00038199272,0.00021058785,0.00004188682],"category_scores_gemma":[0.00008656405,0.00026186017,0.0000570184,0.00027986334,0.00029197268,0.00021610416,0.00009511256,0.00032115728,0.000005286451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013095488,0.0000029716487,0.000018039218,0.000019560803,0.00000542827,9.1941376e-7,0.00012913583,0.7474643,0.000076687094,0.00011909245,0.000013715245,0.25214884],"study_design_scores_gemma":[0.00019047207,0.000018158318,0.0003993269,0.00019312707,0.000013597079,0.000004238677,3.3257596e-8,0.9860963,0.0009614989,0.011694664,0.00016337774,0.0002651811],"about_ca_topic_score_codex":0.000005245641,"about_ca_topic_score_gemma":0.000035459918,"teacher_disagreement_score":0.8306821,"about_ca_system_score_codex":0.00039096014,"about_ca_system_score_gemma":0.00016435176,"threshold_uncertainty_score":0.9999834},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056986307,0.00015551566,0.99428785,0.0007741425,0.00087874115,0.00047573744,0.000004763683,0.0000911881,0.0027621798],"genre_scores_gemma":[0.9751759,0.000012362886,0.022968123,0.00045856903,0.00014303433,0.0000149215075,0.000016019618,0.000023525921,0.0011875142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662,0.0000509993,0.00067751604,0.0012521441,0.00088581647,0.0005135046],"domain_scores_gemma":[0.9980866,0.00020361286,0.0002823068,0.0012598996,0.000049284237,0.00011833786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007785657,0.00038449283,0.00040857022,0.00086775026,0.00011279474,0.00037080544,0.0023580499,0.00027767997,0.000022734052],"category_scores_gemma":[0.000037661524,0.000382914,0.00008925177,0.0004516912,0.00054995203,0.00043271133,0.0005246938,0.00048598208,0.00013827987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013892603,0.000559812,0.00227985,0.00021105378,0.000042497988,0.00033159507,0.03893717,0.011066341,0.0029812418,0.1788033,0.00016676533,0.7646065],"study_design_scores_gemma":[0.0005109288,0.00006810729,0.002773455,0.00031905202,0.0000065869253,0.000047624955,3.818171e-7,0.869336,0.000650067,0.12147236,0.00408838,0.0007270307],"about_ca_topic_score_codex":0.00004782194,"about_ca_topic_score_gemma":0.000114198665,"teacher_disagreement_score":0.97460604,"about_ca_system_score_codex":0.00033997212,"about_ca_system_score_gemma":0.00024745963,"threshold_uncertainty_score":0.99986225},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027729902,0.0006335627,0.98642313,0.0008666404,0.002485795,0.0015206956,0.0000050536796,0.00029019645,0.0077721346],"genre_scores_gemma":[0.42691395,0.000006330774,0.56710345,0.0005078069,0.0026245967,0.00014534798,0.000015851114,0.000058639795,0.0026240307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604875,0.000033283282,0.00054458407,0.0016078432,0.0009892571,0.0007762766],"domain_scores_gemma":[0.99761117,0.0002747435,0.0003820977,0.0011234217,0.00042030273,0.00018824221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001042665,0.00052905764,0.0005783698,0.0005358997,0.0003543204,0.0007135934,0.0027812955,0.00038081044,0.0000068364866],"category_scores_gemma":[0.000044629567,0.0004365072,0.0002068326,0.00038844242,0.00045592085,0.0004959106,0.0006998769,0.00046745825,0.000060089635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075695457,0.00003483042,0.0000133337,0.00023909361,0.000016293976,0.000044371976,0.00037628683,0.0063912505,0.00004677839,0.71420085,0.000069106536,0.27856025],"study_design_scores_gemma":[0.00089395145,0.00079743966,0.00002396753,0.00043474315,0.000027107739,0.00063717796,6.606773e-7,0.6531912,0.00274216,0.29409403,0.045599125,0.0015584356],"about_ca_topic_score_codex":0.000015716088,"about_ca_topic_score_gemma":0.000051297182,"teacher_disagreement_score":0.6467999,"about_ca_system_score_codex":0.0005728544,"about_ca_system_score_gemma":0.00076195155,"threshold_uncertainty_score":0.99980867},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004972865,0.0000389226,0.9067435,0.00027993217,0.0005505678,0.00057329267,0.000024746823,0.00012697207,0.091164745],"genre_scores_gemma":[0.22137098,0.000024637944,0.7699986,0.0009724127,0.00084584387,0.00003849635,0.000034779918,0.00017384902,0.0065403837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721766,0.000020431324,0.00060786936,0.00082419394,0.00080053485,0.000529322],"domain_scores_gemma":[0.9974603,0.001144775,0.00033132793,0.00071993045,0.00021188888,0.00013177849],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065064186,0.0004721258,0.0006401331,0.00041799925,0.0002530052,0.00034964198,0.0007583227,0.00036296982,0.00024687024],"category_scores_gemma":[0.00042473793,0.00040822843,0.00017507661,0.00023124994,0.00061116513,0.00024025654,0.00038821538,0.0008255912,0.000104294966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024865749,0.00049399707,0.00005624031,0.00116418,0.00009522332,0.0004754686,0.0020230692,0.0010869084,0.0011560002,0.84480244,0.0019796877,0.14664191],"study_design_scores_gemma":[0.00014425567,0.00007283852,0.000012148846,0.00043540276,0.000022594157,0.00009129104,3.662907e-7,0.19901279,0.00020284357,0.79878557,0.0007717457,0.00044818135],"about_ca_topic_score_codex":0.000062154424,"about_ca_topic_score_gemma":0.00014545559,"teacher_disagreement_score":0.2208737,"about_ca_system_score_codex":0.0002611551,"about_ca_system_score_gemma":0.00027915672,"threshold_uncertainty_score":0.999837},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011202567,0.00022226281,0.9920714,0.0006925585,0.0011816153,0.00028945992,0.00012651466,0.00025075642,0.0040451926],"genre_scores_gemma":[0.12632047,0.00018181895,0.86791927,0.003550573,0.001267127,0.000041406518,0.00013879476,0.00008310095,0.0004974282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99560386,0.000024964304,0.0005580064,0.0021423853,0.0009535808,0.00071720587],"domain_scores_gemma":[0.9966633,0.00050475524,0.0002857361,0.0021964456,0.00012361424,0.00022615276],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00043042251,0.00055422634,0.00050727994,0.0006521121,0.0003464683,0.00177496,0.007815873,0.00028549283,0.00012212784],"category_scores_gemma":[0.00003156486,0.00052298943,0.00012319365,0.0006917982,0.00042692455,0.00092258834,0.0023496978,0.0006686245,0.00015128887],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016102537,0.000033414606,0.00011281131,0.000007795138,0.000009079245,0.000053025244,0.00041108383,0.005895467,0.00003202228,0.0023962713,0.00008806815,0.99095935],"study_design_scores_gemma":[0.00028741182,0.00007819184,0.0005349938,0.0004991368,0.00001265445,0.000031679887,2.3530502e-7,0.94633394,0.000475535,0.040122982,0.010743073,0.000880179],"about_ca_topic_score_codex":0.00015079847,"about_ca_topic_score_gemma":0.0001479181,"teacher_disagreement_score":0.99007916,"about_ca_system_score_codex":0.00017433705,"about_ca_system_score_gemma":0.0005303473,"threshold_uncertainty_score":0.9997222},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053359085,0.00088102923,0.99397314,0.0021992559,0.0009511633,0.00071915303,0.00002649176,0.00024973348,0.00046647244],"genre_scores_gemma":[0.26465282,0.000097473945,0.7333816,0.0011237488,0.00041279616,0.000027323042,0.00002324962,0.00005728659,0.00022367532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960761,0.0000894303,0.0007081818,0.001715408,0.00061780086,0.0007930631],"domain_scores_gemma":[0.9958709,0.0010096926,0.0004647601,0.0021150094,0.00030878503,0.00023083815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015711113,0.0006438506,0.000753302,0.00048874965,0.0008514544,0.0009989969,0.0033943595,0.0003349969,0.000007686959],"category_scores_gemma":[0.00012794278,0.00058484473,0.0001776541,0.0004211697,0.0016581919,0.00043783456,0.0022840383,0.00095424167,0.000004356097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011691379,0.000068057314,0.000023407089,0.00016168995,0.000021532047,0.000007362965,0.0015566251,0.0053258943,0.000088856745,0.19612439,0.000030474503,0.79658],"study_design_scores_gemma":[0.0003001236,0.00015817913,0.000115174764,0.00020186376,0.0000067956203,0.00004110202,1.6562831e-7,0.67881435,0.000092933835,0.31850344,0.0012715693,0.0004943215],"about_ca_topic_score_codex":0.000080562975,"about_ca_topic_score_gemma":0.00009692032,"teacher_disagreement_score":0.7960857,"about_ca_system_score_codex":0.00019068446,"about_ca_system_score_gemma":0.00022017487,"threshold_uncertainty_score":0.9996603},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000067139816,0.00009048303,0.99714553,0.000038607817,0.00035609782,0.0003889081,0.000031126718,0.00004602053,0.0018360679],"genre_scores_gemma":[0.58404464,0.00002067179,0.41547439,0.0000830432,0.00012889194,0.0000149238585,0.00013350327,0.000034460376,0.00006550792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990837,0.000004257004,0.00031805533,0.00019744285,0.00023891163,0.0001576644],"domain_scores_gemma":[0.9995266,0.00012358978,0.0000607682,0.00017058337,0.00009299518,0.000025463705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012983545,0.00017659193,0.000204314,0.000279971,0.000060974267,0.000053166998,0.00016227177,0.00011575369,0.0000054985003],"category_scores_gemma":[0.000010449769,0.00017000471,0.000050528262,0.00012624316,0.00009984598,0.0001265143,0.000011994529,0.000104774575,0.0000015624938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012572034,0.000004557299,8.678077e-7,0.000076031945,0.0000046937193,4.2212594e-7,0.00030237535,0.9283216,0.00011803159,0.0017416459,0.000022296708,0.069406234],"study_design_scores_gemma":[0.00013805885,0.000055905268,0.000008508392,0.00016690335,0.000010208429,0.0000016744594,8.2537575e-8,0.9809291,0.006258189,0.012092737,0.00017310072,0.00016557284],"about_ca_topic_score_codex":0.000004580852,"about_ca_topic_score_gemma":0.000017482063,"teacher_disagreement_score":0.58397746,"about_ca_system_score_codex":0.0001357618,"about_ca_system_score_gemma":0.000051643594,"threshold_uncertainty_score":0.69325906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011728401,0.00014495631,0.988072,0.0035668474,0.0017411283,0.00067241973,0.000005640363,0.00014007812,0.005539655],"genre_scores_gemma":[0.06081181,0.00017061614,0.9245297,0.008823969,0.0017210833,0.00002534976,0.00004951832,0.00006280844,0.0038051757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591315,0.000042117103,0.0004950053,0.0015725251,0.0012319284,0.000745268],"domain_scores_gemma":[0.9978842,0.0001921078,0.000121396806,0.0014663398,0.00014805525,0.00018789261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013613821,0.00044124736,0.00045905335,0.0018588244,0.00014588579,0.000862087,0.004526786,0.00018379536,0.000021785358],"category_scores_gemma":[0.0000589259,0.00042529596,0.00007786961,0.0015267322,0.00022102689,0.0010589703,0.0019091154,0.00068996946,0.00017126137],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046230925,0.000033897497,0.0000327278,0.000015547146,0.0000032896876,0.0001195634,0.00031685413,0.012336944,0.00005583112,0.014446785,0.00016953038,0.9724644],"study_design_scores_gemma":[0.00092028274,0.00043303115,0.00060527585,0.0007875358,0.0000056648055,0.000024923846,2.6249987e-7,0.912908,0.0010128599,0.06819475,0.014010415,0.0010970116],"about_ca_topic_score_codex":0.00002865544,"about_ca_topic_score_gemma":0.00019565348,"teacher_disagreement_score":0.9713674,"about_ca_system_score_codex":0.000288194,"about_ca_system_score_gemma":0.0002943804,"threshold_uncertainty_score":0.9998199},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008795348,0.00014729585,0.99440575,0.0006980031,0.00057124306,0.00035883478,0.000007886236,0.00020776626,0.0035152475],"genre_scores_gemma":[0.13471358,0.000041702246,0.86218894,0.0020323794,0.0005412519,0.000014674823,0.000028683215,0.00003801197,0.0004008129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962005,0.00001930062,0.00056260556,0.0017966257,0.00084168435,0.00057926995],"domain_scores_gemma":[0.9967898,0.00030428052,0.00026530272,0.002377164,0.00012218962,0.00014124416],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012661592,0.00036998044,0.00035049274,0.0011595559,0.00021593088,0.00030692221,0.0054696356,0.00030763453,0.000014966596],"category_scores_gemma":[0.00005081068,0.0003691693,0.00006821093,0.0009073542,0.00056002353,0.000459132,0.0023128404,0.0007146439,0.000026987333],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044379917,0.000035763725,0.000095640404,0.000011565189,0.0000028818142,0.00004949398,0.00032295735,0.0053580673,0.000037994505,0.01238646,0.000092356124,0.9816024],"study_design_scores_gemma":[0.00027734324,0.00013350394,0.00052531116,0.0002767206,0.000005219236,0.000090629874,5.3283327e-7,0.95173454,0.00052779156,0.030369759,0.015277706,0.00078092905],"about_ca_topic_score_codex":0.00011527315,"about_ca_topic_score_gemma":0.000525824,"teacher_disagreement_score":0.98082143,"about_ca_system_score_codex":0.00028732105,"about_ca_system_score_gemma":0.00043089926,"threshold_uncertainty_score":0.99991125},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014062591,0.0020196224,0.9956524,0.0002674805,0.00068067666,0.00024082101,0.0000032108442,0.00028383007,0.0007113749],"genre_scores_gemma":[0.12680724,0.00004520053,0.87246764,0.00028145194,0.00024324137,0.0000023716746,0.000001684926,0.000025831825,0.00012534809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967259,0.0000399304,0.0005529915,0.0011597024,0.0010178601,0.00050358404],"domain_scores_gemma":[0.9976538,0.00044135968,0.00044287022,0.0011037188,0.00023622988,0.00012205859],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056281255,0.000437242,0.0005121592,0.0010311129,0.00017225856,0.00033245736,0.002806358,0.00038101408,0.000028638953],"category_scores_gemma":[0.00016004403,0.0003887766,0.00013931814,0.00071390474,0.00079252763,0.0008931316,0.0009966984,0.0011292793,0.000007976674],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005771111,0.00004605231,0.000018771456,0.00008146181,0.00000831079,0.00012641863,0.0004013459,0.002121443,0.004860984,0.032673005,0.000014335265,0.9596421],"study_design_scores_gemma":[0.0001432491,0.0001514536,0.00001371782,0.0007712025,0.0000116461715,0.00029945892,7.1895606e-8,0.51863265,0.026238255,0.4527029,0.0004013406,0.0006340461],"about_ca_topic_score_codex":0.000046213663,"about_ca_topic_score_gemma":0.000010811946,"teacher_disagreement_score":0.95900804,"about_ca_system_score_codex":0.00026743577,"about_ca_system_score_gemma":0.00031216722,"threshold_uncertainty_score":0.9998564},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060984894,0.0001579497,0.9918583,0.00084304594,0.00046520695,0.00026746455,0.000021791619,0.00018041022,0.0055960054],"genre_scores_gemma":[0.006462094,0.000044243,0.9906436,0.00088675035,0.00044248035,0.000023525208,0.000035997447,0.000032115968,0.0014291948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659044,0.00002595601,0.00040535338,0.0012870872,0.0011188543,0.0005723004],"domain_scores_gemma":[0.99787706,0.00028972604,0.0004104302,0.0010927912,0.00019019566,0.00013978186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006409412,0.00042034825,0.00040390374,0.00046143273,0.00034122393,0.0008154651,0.0024902325,0.0002221256,0.00003491597],"category_scores_gemma":[0.00004639952,0.00036503188,0.000073364325,0.00049796305,0.00023313813,0.0006789421,0.00088223105,0.00045461077,0.000075997625],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024257733,0.000041089108,0.0002697709,0.000012600944,0.000027705239,0.00003698768,0.0006268972,0.0014752258,0.00008903081,0.015049655,0.00034023687,0.98202837],"study_design_scores_gemma":[0.0006963487,0.0002374208,0.0005104731,0.00038433098,0.000025748208,0.00007534528,5.4744356e-7,0.9670764,0.0010313236,0.020059008,0.008827381,0.0010756273],"about_ca_topic_score_codex":0.000045151417,"about_ca_topic_score_gemma":0.00010648076,"teacher_disagreement_score":0.98095274,"about_ca_system_score_codex":0.00053931464,"about_ca_system_score_gemma":0.00021616138,"threshold_uncertainty_score":0.99988014},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000244158,0.0010859399,0.99184585,0.000891856,0.0038446696,0.00083923107,0.000026092364,0.00028828485,0.0011536791],"genre_scores_gemma":[0.17580359,0.0001135003,0.82104254,0.0011844333,0.0012416515,0.000044140823,0.000015899042,0.00006973554,0.00048452377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950103,0.00004421295,0.0007713255,0.0020285593,0.0009583001,0.001187261],"domain_scores_gemma":[0.9962563,0.00101486,0.00049077114,0.0016713566,0.0003287543,0.00023795919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000989166,0.000679524,0.00061553356,0.00061243813,0.00049784215,0.00047898391,0.0044035143,0.00050268444,0.000039500883],"category_scores_gemma":[0.00020071564,0.0006464014,0.000272386,0.0006687734,0.0010735161,0.0006880751,0.0011460515,0.0009888811,0.00009428433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010796393,0.000021369864,0.000061120845,0.000020811467,0.00001374685,0.000036360885,0.00041591868,0.5686284,0.000006933032,0.057931043,0.00009046165,0.37276307],"study_design_scores_gemma":[0.000069961985,0.00013574821,0.00006832105,0.00022288463,0.0000076472215,0.000026647196,1.0471343e-7,0.50281996,0.000066207314,0.4945051,0.001639333,0.0004380704],"about_ca_topic_score_codex":0.000054007174,"about_ca_topic_score_gemma":0.00023891356,"teacher_disagreement_score":0.43657407,"about_ca_system_score_codex":0.00084906444,"about_ca_system_score_gemma":0.0010632494,"threshold_uncertainty_score":0.99959874},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051639574,0.00043062537,0.976619,0.00016430338,0.0030600114,0.00037903973,0.0000022968177,0.00031314357,0.018979952],"genre_scores_gemma":[0.009635337,0.000046132605,0.9878727,0.0015644571,0.00051153544,0.000007000338,0.0000043484642,0.000039303613,0.0003191672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529713,0.000040094375,0.00074022677,0.0015742738,0.0013642616,0.0009839918],"domain_scores_gemma":[0.9967198,0.0004173981,0.0004608107,0.001881593,0.00029512035,0.00022527525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003065808,0.0005830373,0.0005215651,0.0013138411,0.00035364548,0.00063331035,0.004759584,0.00047652802,0.000017592765],"category_scores_gemma":[0.00022286708,0.00056135055,0.00015308442,0.0009393105,0.00072015455,0.0014995789,0.0016788029,0.001094898,0.00012270229],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043959376,0.00001203571,0.000029567349,0.00003459341,0.000005147856,0.000056181067,0.00092567876,0.0020627824,0.00019224535,0.10633804,0.000011486243,0.8903279],"study_design_scores_gemma":[0.0004617247,0.00039182734,0.00027273357,0.00081515085,0.000017069677,0.00048086545,5.6701447e-7,0.7188947,0.0141644385,0.23918547,0.023300057,0.0020153841],"about_ca_topic_score_codex":0.000020703583,"about_ca_topic_score_gemma":0.00003321268,"teacher_disagreement_score":0.88831246,"about_ca_system_score_codex":0.0006043469,"about_ca_system_score_gemma":0.0003657346,"threshold_uncertainty_score":0.9996838},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066257064,0.000172367,0.9918573,0.00014052815,0.0016576312,0.00057009043,0.000004398403,0.00026233308,0.0046728184],"genre_scores_gemma":[0.05752608,0.000011725451,0.9415287,0.00045541878,0.00025719378,0.000010389196,0.000003301136,0.000042807264,0.00016437894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950581,0.00009362937,0.00078327605,0.0018915888,0.0013744703,0.00079893396],"domain_scores_gemma":[0.99608886,0.0004962613,0.00052020693,0.00226724,0.00042642228,0.00020102026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001810201,0.0005533975,0.00050257,0.0010696909,0.0005339057,0.0005895261,0.0033728345,0.00035588376,0.000009901015],"category_scores_gemma":[0.00051101914,0.0005587209,0.00016523188,0.0011486909,0.0006632567,0.00056466955,0.0015131672,0.00090956775,0.000028459248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003917946,0.000025171455,0.000030144662,0.000018339908,0.0000063506623,0.00002433448,0.00078426563,0.8693443,0.00035753852,0.04417194,0.0000014763434,0.085232235],"study_design_scores_gemma":[0.00021994188,0.000035218945,0.00005046266,0.00024306544,0.00001378823,0.000090300346,3.208441e-7,0.9506485,0.0012126716,0.046836603,0.00008218252,0.00056697585],"about_ca_topic_score_codex":0.000048958926,"about_ca_topic_score_gemma":0.00001910705,"teacher_disagreement_score":0.08466526,"about_ca_system_score_codex":0.00067361695,"about_ca_system_score_gemma":0.00059576327,"threshold_uncertainty_score":0.9996864},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023433291,0.0013071868,0.9916681,0.00029237499,0.00066243706,0.00027384,0.0000030210456,0.00007465727,0.0033750331],"genre_scores_gemma":[0.80803275,0.00012243191,0.19113104,0.0003434439,0.00015573767,0.000008356727,0.0000011591973,0.0000221085,0.00018294455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623716,0.000040066032,0.00073578744,0.0013350147,0.0009562763,0.0006957092],"domain_scores_gemma":[0.99792266,0.00021449482,0.00032243182,0.0011079416,0.0002890767,0.00014342139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009320662,0.0004924904,0.00068843097,0.0022616927,0.000114976836,0.000262999,0.0033592826,0.00032811172,0.00001492114],"category_scores_gemma":[0.00012554415,0.00042501293,0.00012554842,0.0018202119,0.0007819151,0.00055986666,0.0010787933,0.0008260467,0.000023336836],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018549945,0.000099134,0.00032341407,0.00012195453,0.000013608987,0.00016518885,0.0015928051,0.031806014,0.0008557499,0.026099145,0.000011040834,0.9388934],"study_design_scores_gemma":[0.0006397668,0.00052837643,0.0005949982,0.0023329246,0.000013162758,0.00018425379,0.0000010797202,0.7991942,0.0098092435,0.18475868,0.000546035,0.0013972573],"about_ca_topic_score_codex":0.00014647217,"about_ca_topic_score_gemma":0.00012778903,"teacher_disagreement_score":0.9374961,"about_ca_system_score_codex":0.00027133635,"about_ca_system_score_gemma":0.00071031845,"threshold_uncertainty_score":0.9998202},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012681492,0.00025979293,0.996343,0.00006283276,0.001004437,0.00018250263,0.000004013586,0.00011022315,0.0007650356],"genre_scores_gemma":[0.88284993,0.00011592236,0.116356,0.0002763363,0.0003564878,0.0000032741793,0.000010687402,0.000017691733,0.00001368194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757457,0.000032229407,0.0005694738,0.0008656342,0.00055995875,0.00039814002],"domain_scores_gemma":[0.9983513,0.00020453216,0.000212967,0.00091072,0.00021985432,0.000100643956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006655137,0.00034945933,0.00043352298,0.0006739472,0.00020052391,0.00017006726,0.001897454,0.00026019118,0.000021798902],"category_scores_gemma":[0.000034512253,0.00034183834,0.00015481752,0.0006275274,0.00047236518,0.00043447304,0.00034581448,0.0005610936,0.000010461381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008905661,0.000015464042,0.000023182038,0.000014870849,0.0000064292935,0.0000146604925,0.00019868344,0.5252941,0.000019075454,0.11372617,2.6012754e-7,0.3606782],"study_design_scores_gemma":[0.000089419664,0.00006609007,0.000032565298,0.00024611206,0.0000072626244,0.000016869102,2.541342e-8,0.79246205,0.00007880069,0.20663373,0.00008839987,0.00027865893],"about_ca_topic_score_codex":0.000007356133,"about_ca_topic_score_gemma":0.000006560217,"teacher_disagreement_score":0.8815818,"about_ca_system_score_codex":0.000076070406,"about_ca_system_score_gemma":0.0002455746,"threshold_uncertainty_score":0.9999034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028092452,0.0005557704,0.9957248,0.00028327687,0.001986394,0.00036187973,0.0000043105706,0.00054087973,0.0005146185],"genre_scores_gemma":[0.02116117,0.00003130857,0.9779227,0.00040110058,0.0002581895,0.0000045490724,0.0000038429835,0.00004215527,0.00017499548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965683,0.00004831845,0.0003899248,0.0014528246,0.000881381,0.0006592235],"domain_scores_gemma":[0.99723923,0.0006902041,0.00027031734,0.0014006628,0.0002630272,0.00013655977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000876577,0.00058597984,0.00056177063,0.00073863275,0.0002430271,0.00042360844,0.002642509,0.00045978444,0.0000069353855],"category_scores_gemma":[0.00024925554,0.0005617943,0.00011777917,0.0005822462,0.0004627196,0.0013608747,0.0008410849,0.001152946,0.0000089103905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021289407,0.0000050332746,7.4919683e-7,0.000024505918,0.000005166759,0.000054526092,0.0004363431,0.85829896,0.00040301433,0.044747677,0.0000016526791,0.09602024],"study_design_scores_gemma":[0.00014752419,0.00004985859,0.000005853082,0.00025571036,0.0000042151387,0.000042719836,1.0510725e-7,0.44164124,0.0028199377,0.5545192,0.000045187306,0.00046844574],"about_ca_topic_score_codex":0.000011975342,"about_ca_topic_score_gemma":0.0000069319008,"teacher_disagreement_score":0.5097715,"about_ca_system_score_codex":0.00080229517,"about_ca_system_score_gemma":0.00079268165,"threshold_uncertainty_score":0.9996834},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053626666,0.00014777842,0.9770454,0.0012755269,0.008299016,0.0013602598,0.000017434319,0.00022792851,0.011090375],"genre_scores_gemma":[0.6747109,0.00003328146,0.30228347,0.0144187575,0.0034696923,0.0002892456,0.00010987625,0.0001409039,0.0045438395],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965037,0.00008147787,0.00096466084,0.00087476353,0.00079147314,0.00078393734],"domain_scores_gemma":[0.9970714,0.00077578553,0.000566255,0.0008811754,0.00048054918,0.00022487814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021418016,0.0003484084,0.0004545009,0.00069014716,0.0012373539,0.000066117944,0.00083560846,0.0007536867,0.00013613289],"category_scores_gemma":[0.00017203938,0.00029709702,0.000067849665,0.00026715238,0.0003978683,0.00012231067,0.00026056275,0.0020154486,0.0006045447],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030857648,0.00014109594,0.007440224,0.014397386,0.00005207716,0.00029181503,0.022453386,0.0071470668,0.0032693737,0.1620449,0.0011648355,0.7812893],"study_design_scores_gemma":[0.006502361,0.0007565103,0.030169211,0.03417703,0.0001508518,0.00013255769,0.000038784063,0.33890402,0.009534657,0.2218933,0.34971592,0.0080247875],"about_ca_topic_score_codex":0.00007111693,"about_ca_topic_score_gemma":0.00034729097,"teacher_disagreement_score":0.77326447,"about_ca_system_score_codex":0.0007232647,"about_ca_system_score_gemma":0.003595051,"threshold_uncertainty_score":0.99994814},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014564767,0.000012675982,0.9961275,0.0016072548,0.00017282122,0.00024345265,0.0000017677829,0.00026107943,0.000116994466],"genre_scores_gemma":[0.45132664,7.3754654e-7,0.5453212,0.0032716498,0.00006138714,0.000012198646,0.0000018790407,0.0000032676462,9.892711e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967658,0.00016287527,0.00040757714,0.0010214124,0.0010529577,0.00058936834],"domain_scores_gemma":[0.99792445,0.00057502603,0.000060927443,0.0008820263,0.00016460096,0.000392964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014363505,0.00019198176,0.00030447028,0.0008006869,0.00017841486,0.00046419963,0.0023013675,0.00008026877,0.000025883804],"category_scores_gemma":[0.0005363135,0.0001625281,0.000056607434,0.0063363803,0.000440671,0.0006200069,0.0007355412,0.0003879591,0.000041218722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004939252,0.00021747436,0.0007684247,0.000008237199,0.000017712011,0.000015545364,0.0015928671,0.07129427,0.0018916061,0.0071186693,0.000063240244,0.917007],"study_design_scores_gemma":[0.00013694668,0.00006687232,0.0071402127,0.000008206997,0.000013313087,0.000015465366,8.135088e-7,0.97433937,0.015288399,0.0027326052,0.00002898172,0.00022881247],"about_ca_topic_score_codex":0.000033433083,"about_ca_topic_score_gemma":0.000025803662,"teacher_disagreement_score":0.9167782,"about_ca_system_score_codex":0.00017025118,"about_ca_system_score_gemma":0.00019989243,"threshold_uncertainty_score":0.66277033},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050755493,0.0001679474,0.93817836,0.0000937404,0.0013118483,0.000491731,0.000012590451,0.00005552192,0.00893275],"genre_scores_gemma":[0.776925,0.000018805664,0.22158712,0.00043239695,0.00036849073,0.000006822884,0.0000052974037,0.00006222819,0.0005937997],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976401,0.00003107113,0.00065327913,0.00063348754,0.00060654123,0.00043555818],"domain_scores_gemma":[0.9980499,0.0007463078,0.00035458276,0.00067379395,0.00009951293,0.00007586077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014077165,0.0003308736,0.000534314,0.00070317445,0.000078828125,0.00004523642,0.0010400738,0.0003712624,0.00021210646],"category_scores_gemma":[0.00030377661,0.0003101697,0.0000989567,0.0003796048,0.00055517064,0.00012957345,0.00046135247,0.0009052907,0.000018809318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008856273,0.0005036788,0.0033053984,0.001251284,0.00010436141,0.00035339565,0.011845895,0.0010712566,0.008074707,0.30631456,0.000049789327,0.6670371],"study_design_scores_gemma":[0.00031109058,0.000090320944,0.00013215361,0.0005898311,0.0000140275215,0.000027634174,0.0000010378393,0.0025561543,0.0090203835,0.98620355,0.00064087735,0.00041292427],"about_ca_topic_score_codex":0.00001623413,"about_ca_topic_score_gemma":0.00015526469,"teacher_disagreement_score":0.7261695,"about_ca_system_score_codex":0.00010185469,"about_ca_system_score_gemma":0.0001707606,"threshold_uncertainty_score":0.99993503},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014131663,0.0005905161,0.9907998,0.00022133965,0.0019911544,0.000847581,0.000027821916,0.00015969566,0.0052207657],"genre_scores_gemma":[0.5286228,0.000041129926,0.46747667,0.0011842328,0.00059149385,0.000034450404,0.00004688898,0.00008917443,0.0019131202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940863,0.000059176,0.00082429266,0.0024939482,0.0014673377,0.001068896],"domain_scores_gemma":[0.996783,0.00024823952,0.00032132753,0.0021615787,0.00022851968,0.000257338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001180494,0.00069578027,0.0008015529,0.0014569646,0.00020255802,0.0009266658,0.0052459864,0.0003153821,0.0000029532898],"category_scores_gemma":[0.000078745834,0.00060623453,0.00011493457,0.0011385223,0.0003745326,0.00078593055,0.0027624108,0.0011428951,0.00004992909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038589715,0.0001635726,0.00010205706,0.000148378,0.000010536006,0.0004319422,0.0004124326,0.6642567,0.000111093505,0.015053013,0.0007850064,0.31848666],"study_design_scores_gemma":[0.00033751386,0.00010283559,0.00045157704,0.0007560715,0.000002505591,0.0001811258,1.9919369e-7,0.978368,0.000045956756,0.01597204,0.0030243087,0.00075786],"about_ca_topic_score_codex":0.00024794458,"about_ca_topic_score_gemma":0.00004431964,"teacher_disagreement_score":0.52848154,"about_ca_system_score_codex":0.00079565006,"about_ca_system_score_gemma":0.0005244081,"threshold_uncertainty_score":0.9996389},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054100507,0.00017699994,0.9971034,0.0006803484,0.00030358578,0.0005464404,0.000023691548,0.00011228307,0.000999167],"genre_scores_gemma":[0.106291756,0.000026166357,0.89262474,0.00029652772,0.00030825654,0.00009132296,0.00003953318,0.000023217553,0.00029848047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768007,0.000010664315,0.00036406534,0.0012147691,0.00037486386,0.00035557052],"domain_scores_gemma":[0.9978939,0.00070331653,0.000217594,0.00091317855,0.00019179953,0.0000801571],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052985596,0.00029604926,0.00029100094,0.00034569367,0.00028959638,0.00066022767,0.001614247,0.00016384134,0.0000017218516],"category_scores_gemma":[0.000118402306,0.00027245097,0.00004930988,0.00031483188,0.00049129064,0.00044065661,0.000510159,0.00026778312,0.0000050110875],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011452947,0.000016291748,0.000029593046,0.00003062184,0.0000027491894,0.0000016870086,0.00014237681,0.0027709848,0.00009239684,0.10250337,0.00004437923,0.8943644],"study_design_scores_gemma":[0.00013528427,0.000059557933,0.0007125301,0.00014292839,0.0000061247706,0.000009745981,6.6306754e-8,0.789461,0.000057567966,0.206829,0.0023005742,0.00028563512],"about_ca_topic_score_codex":0.000021606082,"about_ca_topic_score_gemma":0.00007555119,"teacher_disagreement_score":0.8940788,"about_ca_system_score_codex":0.000113005095,"about_ca_system_score_gemma":0.00026784753,"threshold_uncertainty_score":0.99997276},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009403907,0.00062340853,0.9934906,0.00037280083,0.0010508503,0.00025669497,5.9113466e-7,0.00023134919,0.0038796659],"genre_scores_gemma":[0.8425007,0.00015686157,0.15573475,0.00095657073,0.00035344393,0.000008719282,0.000011553833,0.000044859888,0.00023253442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957476,0.00007727645,0.00069203903,0.0017004904,0.0008851624,0.0008973909],"domain_scores_gemma":[0.99814326,0.00040410305,0.00028722011,0.00073021953,0.00023198099,0.00020319207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011006456,0.0005775249,0.0005948644,0.0009585945,0.00025611673,0.00058773893,0.0023912021,0.0005047066,0.0000137396255],"category_scores_gemma":[0.00005380173,0.0005799063,0.0001116825,0.001108839,0.0006242802,0.0006029022,0.0010093907,0.0020271204,0.0000413384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025113204,0.000012911109,0.00010380656,0.000008332172,0.0000020917785,0.00008351893,0.00019471592,0.56195897,0.0000039409406,0.0057701557,0.0000047931876,0.43185425],"study_design_scores_gemma":[0.00022270708,0.00015191134,0.00014800778,0.0005927793,0.0000032522953,0.00007503103,2.522558e-7,0.8984457,0.00003279129,0.09952447,0.00023573593,0.00056731264],"about_ca_topic_score_codex":0.000072673196,"about_ca_topic_score_gemma":0.00019454512,"teacher_disagreement_score":0.8424067,"about_ca_system_score_codex":0.0004168095,"about_ca_system_score_gemma":0.0004710248,"threshold_uncertainty_score":0.99966526},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028763732,0.00045189116,0.9837859,0.00029515158,0.00202474,0.00030079272,0.0000017401239,0.00023992435,0.012612175],"genre_scores_gemma":[0.35236928,0.000036699766,0.6436237,0.0030222414,0.0007212379,0.0000036421254,0.0000042197885,0.000053979904,0.00016501443],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995362,0.000059368293,0.0007175353,0.0018149511,0.0009877562,0.0010584167],"domain_scores_gemma":[0.99696153,0.000910297,0.00028575974,0.0014771412,0.00016310511,0.00020216446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027502757,0.0006074878,0.000627293,0.0022981418,0.00026798417,0.00053146813,0.0043933806,0.00043121935,0.000024326431],"category_scores_gemma":[0.000084492276,0.0005990009,0.00019944558,0.001683056,0.0008461919,0.00053388096,0.0019181834,0.0014277097,0.00005128143],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073619044,0.000037062524,0.0002723478,0.000025026255,0.0000065108743,0.00026290765,0.00085426896,0.008859404,0.000028930888,0.15364045,0.0000071762724,0.83599854],"study_design_scores_gemma":[0.00047594495,0.00021834493,0.00078640704,0.0007765051,0.0000057653674,0.00013512687,3.9525216e-7,0.36956915,0.0004741665,0.6237984,0.0026385952,0.0011212357],"about_ca_topic_score_codex":0.000033842665,"about_ca_topic_score_gemma":0.00020767609,"teacher_disagreement_score":0.8348773,"about_ca_system_score_codex":0.00028083342,"about_ca_system_score_gemma":0.00034375157,"threshold_uncertainty_score":0.9996461},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000930167,0.0006873874,0.99368936,0.00026893063,0.0016251531,0.00069260696,0.000007759093,0.00051417603,0.0024216324],"genre_scores_gemma":[0.02353362,0.00006441783,0.9745207,0.0006880403,0.0008387659,0.0000055332503,0.000029791667,0.000048262955,0.00027086775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99425054,0.00005907418,0.00077938987,0.0022332896,0.0016620309,0.0010156834],"domain_scores_gemma":[0.99641746,0.00019698282,0.00050683605,0.0022023078,0.0003248027,0.00035162125],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007398155,0.0008387938,0.0007881005,0.0008011421,0.00054559315,0.001116524,0.0048842817,0.00053742697,0.000029505349],"category_scores_gemma":[0.000025385136,0.00068950903,0.00018852393,0.000808029,0.00042133871,0.0012950588,0.0023724127,0.0011895075,0.000036595895],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062382856,0.00011399321,0.000012552802,0.0000374876,0.000009764903,0.00013364127,0.00025432126,0.012339227,0.00029356673,0.0042124405,0.000017231438,0.9825695],"study_design_scores_gemma":[0.00042081042,0.0003221462,0.00005542755,0.0009367542,0.00001353052,0.00014362158,9.9456045e-8,0.94594556,0.0009807881,0.0433154,0.006973914,0.0008919352],"about_ca_topic_score_codex":0.000025028765,"about_ca_topic_score_gemma":0.000020211393,"teacher_disagreement_score":0.9816776,"about_ca_system_score_codex":0.0003702059,"about_ca_system_score_gemma":0.00065974495,"threshold_uncertainty_score":0.9999204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002733797,0.00028889737,0.9960565,0.0011018058,0.00082192273,0.00027343526,0.00003436927,0.00020182761,0.0011939098],"genre_scores_gemma":[0.007904635,0.000037092053,0.98850733,0.0023436071,0.00037467945,0.000013512568,0.000020420033,0.00002837224,0.0007703527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962488,0.000018369694,0.0005219948,0.0017338399,0.0008023954,0.00067459396],"domain_scores_gemma":[0.99723417,0.0002219206,0.00027755497,0.0018760046,0.00017834573,0.00021202219],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060630817,0.00050978235,0.00044322954,0.00057879416,0.00030269244,0.0007106826,0.0044914857,0.00025458555,0.000016675804],"category_scores_gemma":[0.000047309797,0.0004790828,0.000115108596,0.00050359016,0.00036701825,0.000576202,0.0012100424,0.0006270832,0.000097834876],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.997125e-7,0.000030721403,0.000017805223,0.0000073162023,0.0000047152207,0.000045542354,0.0003721783,0.0012706794,0.00006104141,0.0013844001,0.000049007125,0.9967563],"study_design_scores_gemma":[0.00030647672,0.00012684191,0.0009793278,0.00041554216,0.000008017207,0.0000894093,2.1018495e-7,0.97436553,0.00041402655,0.01698263,0.0054382836,0.0008736829],"about_ca_topic_score_codex":0.000043345153,"about_ca_topic_score_gemma":0.00008672769,"teacher_disagreement_score":0.99588263,"about_ca_system_score_codex":0.0002276205,"about_ca_system_score_gemma":0.00037801338,"threshold_uncertainty_score":0.9997661},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018935289,0.000435631,0.9832819,0.010857764,0.00070455053,0.004190736,0.000005715495,0.00012712253,0.00037766097],"genre_scores_gemma":[0.2737539,0.000115025534,0.7128193,0.0056537925,0.0011506225,0.0012177733,0.0000034877219,0.00010752221,0.0051785796],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959319,0.00006966855,0.0006185982,0.00140043,0.0012548409,0.0007245318],"domain_scores_gemma":[0.99611074,0.00049500936,0.0004538852,0.0022757002,0.0004699631,0.00019469012],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011046984,0.00051368406,0.00050784444,0.00045686984,0.0004336634,0.00072892784,0.005684479,0.00019452693,0.000007147119],"category_scores_gemma":[0.00043339486,0.00029515816,0.00012715001,0.0006165557,0.0010327073,0.0010433027,0.002282368,0.0006622207,0.000051802177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016821892,0.000054744745,0.0000046232103,0.00007293558,0.000016998763,0.000023415809,0.00224236,0.025376402,0.00089726073,0.2227157,0.000022768263,0.74855596],"study_design_scores_gemma":[0.00029800882,0.00035523597,0.000033225133,0.00069946004,0.00000863564,0.000051925726,4.7353552e-7,0.42475572,0.012921926,0.5338007,0.026243577,0.0008310865],"about_ca_topic_score_codex":0.000007791558,"about_ca_topic_score_gemma":0.000045045846,"teacher_disagreement_score":0.7477249,"about_ca_system_score_codex":0.00023118852,"about_ca_system_score_gemma":0.0007108409,"threshold_uncertainty_score":0.99995005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021873135,0.00033849425,0.9824042,0.00022727136,0.008239309,0.00050937815,0.0000016787378,0.0009565436,0.007301279],"genre_scores_gemma":[0.49024525,0.00005190134,0.48072186,0.0015286665,0.005713787,0.000036574063,0.000021324371,0.00021322204,0.021467414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99376255,0.00014669546,0.0009937962,0.002208178,0.0017925825,0.0010962127],"domain_scores_gemma":[0.9962927,0.0005849641,0.00065301784,0.0017361639,0.00044834422,0.00028479687],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022123628,0.0008758886,0.0009203851,0.0012469444,0.000604533,0.0012648057,0.0040966156,0.00050364214,0.000015951926],"category_scores_gemma":[0.00014365475,0.00081517186,0.00029826842,0.0007193871,0.00028204097,0.00059019116,0.0009496259,0.0018194647,0.00024190926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075575863,0.000027347709,0.000033655586,0.00012249319,0.000016391024,0.0002671885,0.0006813423,0.29692435,0.00008959606,0.11712345,0.000018506762,0.5846881],"study_design_scores_gemma":[0.00025496163,0.0005097426,0.000037026974,0.002355679,0.000012680455,0.00009817999,0.0000012872363,0.9063057,0.0010967441,0.003707511,0.08453401,0.0010865285],"about_ca_topic_score_codex":0.000063425476,"about_ca_topic_score_gemma":0.0000115901485,"teacher_disagreement_score":0.60938126,"about_ca_system_score_codex":0.0012519554,"about_ca_system_score_gemma":0.00085075037,"threshold_uncertainty_score":0.99977195},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024153255,0.00022227918,0.9740719,0.000106098516,0.00043961703,0.00017572774,0.0000057434922,0.000018506935,0.0008068546],"genre_scores_gemma":[0.43668467,0.000036554153,0.56116915,0.0013188287,0.0005343613,0.0000047631133,0.00008307115,0.000019883168,0.00014871679],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985913,0.000013506909,0.00018910391,0.00077228586,0.00019368547,0.00024011143],"domain_scores_gemma":[0.9994904,0.000048345937,0.00009108705,0.0002205934,0.000073513766,0.00007607169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024169352,0.00022305988,0.00017190352,0.00012992945,0.00013592963,0.00008019223,0.00034131363,0.00032829551,0.0000072517564],"category_scores_gemma":[0.00005617647,0.00018248797,0.000055746295,0.000096606105,0.0005383619,0.0000041016788,0.0003555744,0.00030802473,0.0000029275186],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013306442,0.000016972504,0.00043240405,0.0000112476055,0.000009235551,0.00002279673,0.00003432268,0.00050688174,0.09038037,0.00005112787,0.000006455253,0.90851486],"study_design_scores_gemma":[0.0015080248,0.0012469097,0.0032261105,0.00032408876,0.000030756462,0.00034180234,0.000001107521,0.0557396,0.87416553,0.04632314,0.014902744,0.0021902048],"about_ca_topic_score_codex":0.0000076278366,"about_ca_topic_score_gemma":0.00003093535,"teacher_disagreement_score":0.9063247,"about_ca_system_score_codex":0.000018830331,"about_ca_system_score_gemma":0.00014732096,"threshold_uncertainty_score":0.7441644},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024020143,0.00046106975,0.99274975,0.00012043294,0.0009083019,0.00042771257,0.0000024688122,0.00036309668,0.0049431426],"genre_scores_gemma":[0.014465746,0.00023257562,0.9832268,0.0011245105,0.00026371313,0.000008005053,0.000003994118,0.000042921183,0.0006317817],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688095,0.000026256912,0.00048581447,0.001372984,0.00062194635,0.0006120529],"domain_scores_gemma":[0.997614,0.00017220076,0.00036090333,0.0014158059,0.0002921474,0.00014490906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057122303,0.0004744615,0.00043863535,0.0007988689,0.00031848735,0.00035863512,0.0024229982,0.00029903912,0.000018760149],"category_scores_gemma":[0.00006865229,0.00044583733,0.00013173783,0.0007771889,0.0005259812,0.0014553759,0.0011032951,0.0006976067,0.000028915347],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000130469,0.00004920827,0.000079719655,0.000061784376,0.000017904238,0.00019118538,0.00089216145,0.006333269,0.002769915,0.066734865,0.00011431679,0.9227426],"study_design_scores_gemma":[0.00020376394,0.00026589827,0.000029154504,0.00056752376,0.000014711986,0.00014621367,1.8129198e-7,0.1370495,0.04827926,0.80940264,0.0031523423,0.0008888238],"about_ca_topic_score_codex":0.000054050673,"about_ca_topic_score_gemma":0.000021304175,"teacher_disagreement_score":0.9218538,"about_ca_system_score_codex":0.0004469768,"about_ca_system_score_gemma":0.00048845046,"threshold_uncertainty_score":0.9997993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001607996,0.00057640066,0.99242634,0.0043391334,0.0014047038,0.00027788169,0.000049728296,0.00043742603,0.00032759923],"genre_scores_gemma":[0.021788135,0.0002383766,0.9771781,0.00041955462,0.00016868142,0.0000047729045,0.00013086128,0.00003248611,0.00003902543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961624,0.000033966433,0.00046175683,0.002099927,0.0007422811,0.00049964315],"domain_scores_gemma":[0.9893999,0.00034594763,0.00029714566,0.009729684,0.00012306859,0.00010423263],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011079966,0.00045120172,0.0003756565,0.0005621015,0.00038370106,0.0008732618,0.029153422,0.0005986755,0.000012996883],"category_scores_gemma":[0.0026072052,0.00040670641,0.000033343993,0.00047129532,0.0006790884,0.002279887,0.050572746,0.0014451646,0.000004467244],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029111154,0.000015381474,0.00003691843,0.00003899588,0.0000066587027,0.000015460813,0.00013925454,0.00021295104,0.027251646,0.0011772364,0.0013665749,0.96973604],"study_design_scores_gemma":[0.00014096161,0.00004471635,0.000013119944,0.00028725967,0.000006017725,0.000051412935,1.4730327e-7,0.7932851,0.020264834,0.18298355,0.0024946234,0.0004282978],"about_ca_topic_score_codex":0.000053458833,"about_ca_topic_score_gemma":0.0001212202,"teacher_disagreement_score":0.9693077,"about_ca_system_score_codex":0.0001281575,"about_ca_system_score_gemma":0.00019956591,"threshold_uncertainty_score":0.9998385},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019165837,0.0004275062,0.99471384,0.0010137586,0.0010374044,0.0008131762,0.00002071215,0.00047545423,0.0013064919],"genre_scores_gemma":[0.06813658,0.00007896431,0.9294956,0.0015942202,0.00025597666,0.000040361752,0.000013297763,0.00005974867,0.0003252732],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99462545,0.00004753744,0.000662039,0.0024431893,0.0013356543,0.00088612764],"domain_scores_gemma":[0.9957729,0.0004855228,0.0005473078,0.002464664,0.0003527718,0.0003768255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073730166,0.0008007781,0.000781324,0.0007521698,0.0004920979,0.000618928,0.003754381,0.0004427592,0.00003401087],"category_scores_gemma":[0.00012844431,0.0006440553,0.00007399308,0.00049761817,0.0016798587,0.0011463901,0.0030074918,0.0017135793,0.000015424985],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049606333,0.00007545266,0.00007082031,0.00012212458,0.000027950191,0.0004044336,0.0019108006,0.003266639,0.0070346002,0.06311563,0.00020829639,0.9237136],"study_design_scores_gemma":[0.0024118943,0.0021884835,0.00049851777,0.0062142727,0.00006447449,0.0014242266,0.0000043102746,0.35670763,0.10186001,0.45450404,0.06844693,0.00567523],"about_ca_topic_score_codex":0.000027773029,"about_ca_topic_score_gemma":0.00012546412,"teacher_disagreement_score":0.9180384,"about_ca_system_score_codex":0.00024460373,"about_ca_system_score_gemma":0.00060158974,"threshold_uncertainty_score":0.99960107},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001204538,0.0001752193,0.99541986,0.00032305074,0.0015030595,0.00026577988,0.0000028111072,0.0009335056,0.0013646521],"genre_scores_gemma":[0.004518836,0.000017474022,0.9937751,0.0009819381,0.000527399,0.0000012744881,0.0000042090824,0.000057844776,0.000115881914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957895,0.000035372763,0.00045704766,0.0019881113,0.00091023813,0.0008196983],"domain_scores_gemma":[0.99661267,0.00026526488,0.0003591542,0.00205704,0.00044338498,0.0002624995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000811092,0.0006312351,0.000531573,0.000998279,0.0005202155,0.0009346694,0.004640687,0.00049942284,0.000007817964],"category_scores_gemma":[0.00009037068,0.0006334447,0.00009866416,0.00068816554,0.001187616,0.0021835745,0.0014993553,0.0018459474,0.000018666486],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013440258,0.000012561491,0.0000030160643,0.000011803879,0.0000029255557,0.00014599091,0.00037198525,0.00069488713,0.0054879473,0.0022245771,0.000003231465,0.99103975],"study_design_scores_gemma":[0.000109694294,0.00011172428,0.0000058163105,0.00026486494,0.0000052444266,0.00016341444,1.4344748e-7,0.7274822,0.017496713,0.2526575,0.0010565275,0.0006461553],"about_ca_topic_score_codex":0.000023522303,"about_ca_topic_score_gemma":0.000047860703,"teacher_disagreement_score":0.9903936,"about_ca_system_score_codex":0.00035581546,"about_ca_system_score_gemma":0.00072942587,"threshold_uncertainty_score":0.9996117},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032858745,0.000094684336,0.9903831,0.00004861771,0.0004540527,0.007674983,0.000010844951,0.000046616693,0.0012542595],"genre_scores_gemma":[0.022456013,0.000017721411,0.9733037,0.00030835526,0.00081364485,0.002532858,0.000038609538,0.000090108435,0.00043898597],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985615,0.000018182496,0.0004212928,0.0004980092,0.0002649713,0.00023603324],"domain_scores_gemma":[0.9986922,0.00018985437,0.0004672585,0.0003969135,0.00021574368,0.00003802425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027597183,0.0002735876,0.0004466374,0.00024736693,0.0001034268,0.000061491846,0.00039290072,0.00011668216,0.000054857264],"category_scores_gemma":[0.000012078635,0.0002509133,0.00011830299,0.00015812929,0.00027480337,0.00018073725,0.000029871911,0.0002695279,5.822835e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023733333,0.000064093314,0.0013101673,0.000020873109,0.000016761094,1.8828823e-7,0.00026736464,0.0067008333,0.0034564359,0.0023062914,0.00034693847,0.9854863],"study_design_scores_gemma":[0.0015163757,0.0010685043,0.00012781557,0.00049188687,0.000013089586,0.000004115064,5.4597683e-7,0.20225537,0.5673379,0.1750964,0.05111961,0.00096839044],"about_ca_topic_score_codex":0.000011222519,"about_ca_topic_score_gemma":0.0000012977004,"teacher_disagreement_score":0.98451793,"about_ca_system_score_codex":0.00012444699,"about_ca_system_score_gemma":0.00014310198,"threshold_uncertainty_score":0.99999434},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028049577,0.00063663576,0.95661855,0.0002985746,0.0018935095,0.0002476093,0.000008625409,0.00004235288,0.012204562],"genre_scores_gemma":[0.9168164,0.0000495772,0.07865061,0.0021731954,0.0011840512,0.0000032375287,0.000023233113,0.000031034564,0.001068648],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980153,0.000015436908,0.00025614974,0.0010151977,0.0002679391,0.00042998005],"domain_scores_gemma":[0.9989434,0.000055118395,0.00013300529,0.0006427297,0.00012072605,0.00010500424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039515685,0.00033502432,0.0002616385,0.00010853531,0.00015529133,0.00009363508,0.000988829,0.0005986237,0.000046495534],"category_scores_gemma":[0.00011954952,0.00026486706,0.00011693487,0.00009789881,0.00071989116,0.000004519229,0.00072856183,0.0007009725,0.00003144228],"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.000038544647,0.00004834906,0.0004995868,0.000027819686,0.000021490001,0.000059029273,0.000076110504,0.001687974,0.6214739,0.0014280685,0.00007541863,0.37456372],"study_design_scores_gemma":[0.0012845928,0.0027375652,0.0022805098,0.0006555813,0.000035603294,0.00040546004,4.491871e-7,0.012314815,0.60166246,0.118803605,0.2554601,0.0043592392],"about_ca_topic_score_codex":0.000002990881,"about_ca_topic_score_gemma":0.000031907628,"teacher_disagreement_score":0.8887668,"about_ca_system_score_codex":0.00002457527,"about_ca_system_score_gemma":0.0001585893,"threshold_uncertainty_score":0.99998033},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005413181,0.00016104791,0.99567354,0.00027454103,0.0010724455,0.000350999,0.0000027373817,0.000104721395,0.0018186434],"genre_scores_gemma":[0.033885352,0.000028152985,0.9646317,0.0011813133,0.00016278205,0.000006325622,0.0000021041353,0.000023375842,0.00007892545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955484,0.00009197436,0.0007298145,0.0017663827,0.0011429342,0.00072047004],"domain_scores_gemma":[0.9969938,0.0002701094,0.00029663,0.00200012,0.0002304357,0.00020890894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017411229,0.00048228423,0.000713302,0.003950301,0.00019621414,0.00031849142,0.004006849,0.00032421766,0.000015956408],"category_scores_gemma":[0.00023833399,0.00048523673,0.00019560287,0.0046787197,0.00043365886,0.000768364,0.0014008193,0.00075947656,0.00004747139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088579945,0.000042740776,0.00067602156,0.000023621815,0.000041822637,0.00015300007,0.0026025446,0.5247783,0.00023765482,0.017688055,0.000011219969,0.45373616],"study_design_scores_gemma":[0.00012266563,0.000072295334,0.0015386371,0.00014002669,0.000019689798,0.000055661283,1.1122331e-7,0.9785176,0.0010221553,0.0172757,0.0006264602,0.0006089919],"about_ca_topic_score_codex":0.00009439382,"about_ca_topic_score_gemma":0.0001470274,"teacher_disagreement_score":0.4537393,"about_ca_system_score_codex":0.00077023596,"about_ca_system_score_gemma":0.0004883351,"threshold_uncertainty_score":0.9997599},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000676814,0.000329679,0.99071246,0.000338109,0.004093035,0.0011146445,0.000015349984,0.00034400256,0.002985017],"genre_scores_gemma":[0.012978644,0.000008708258,0.98392,0.0007876072,0.0007439013,0.00006297008,0.000017151331,0.000086431886,0.0013945886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946552,0.000041804054,0.00079702865,0.0024210515,0.0008781942,0.0012067204],"domain_scores_gemma":[0.99607956,0.0007128011,0.00044395533,0.0020909787,0.00033094728,0.0003417243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011323548,0.0008668506,0.00086060003,0.0009049669,0.00035191036,0.00051818875,0.005219036,0.00051339844,0.000011412178],"category_scores_gemma":[0.0002405638,0.0007649622,0.00024768588,0.00047939055,0.00071626663,0.0004243224,0.0012315203,0.000818762,0.00007405425],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022420167,0.0000969314,0.00011235588,0.00014165347,0.00003830268,0.00021170842,0.0017772061,0.08651319,0.000057133526,0.04530221,0.00012363722,0.86560327],"study_design_scores_gemma":[0.00047967088,0.00049514096,0.0002862284,0.00055258774,0.000027978598,0.00024016185,1.5620954e-7,0.7452464,0.00034949742,0.2486137,0.002485797,0.0012226639],"about_ca_topic_score_codex":0.0000457894,"about_ca_topic_score_gemma":0.00005570281,"teacher_disagreement_score":0.8643806,"about_ca_system_score_codex":0.0003924433,"about_ca_system_score_gemma":0.00078906654,"threshold_uncertainty_score":0.9994801},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006115452,0.0005693889,0.97599983,0.0036328041,0.0027740225,0.0024145404,0.000071051596,0.0004467593,0.0079761725],"genre_scores_gemma":[0.735212,0.00029548391,0.2583271,0.0039533735,0.0009059181,0.00011410129,0.000054060278,0.00005595378,0.0010819922],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973138,0.000063626474,0.00040927372,0.0009636894,0.0006907756,0.00055884133],"domain_scores_gemma":[0.99684405,0.0011689843,0.0002672836,0.0011444904,0.00033626915,0.00023890656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011966736,0.0003457016,0.00044743804,0.00049997243,0.00048716879,0.00020048738,0.003019351,0.00058405474,0.000102232625],"category_scores_gemma":[0.00042878886,0.00032202425,0.000090998525,0.0002871387,0.0015967026,0.00030067255,0.0003056849,0.00066922116,0.00004084251],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046660025,0.00022388497,0.000018166622,0.000007585975,0.000010208036,0.000003503083,0.01768194,0.0016754944,0.00053003454,0.02240187,0.000064748165,0.9573359],"study_design_scores_gemma":[0.0058198255,0.007553802,0.0009441886,0.0014338591,0.0001111988,0.000037348007,0.00026971186,0.23402898,0.012521732,0.22679397,0.50548553,0.0049998597],"about_ca_topic_score_codex":0.00025294622,"about_ca_topic_score_gemma":0.0047066794,"teacher_disagreement_score":0.9523361,"about_ca_system_score_codex":0.00034246928,"about_ca_system_score_gemma":0.00049591204,"threshold_uncertainty_score":0.99992317},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04310849,0.00017300111,0.95363855,0.00018998038,0.00018516903,0.0003997642,0.0000119924935,0.000026614382,0.0022664545],"genre_scores_gemma":[0.6937714,0.000023846223,0.3043906,0.00034683346,0.00058255385,0.000006496915,0.00014350776,0.00003774806,0.00069699995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778765,0.000036011763,0.00045589797,0.0007803018,0.0005426943,0.00039745687],"domain_scores_gemma":[0.9984723,0.000026796315,0.00031972496,0.00089704,0.0001741083,0.00011003256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049493974,0.00038840805,0.00036846384,0.00048763904,0.00016742609,0.00014599554,0.0008159721,0.00038415584,0.000026721726],"category_scores_gemma":[0.00006955085,0.00036760795,0.00017055133,0.00035004504,0.00043603723,0.000013879591,0.00049666385,0.0005103731,0.000015296559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004015373,0.00006265678,0.0020459588,0.00009375644,0.00019428426,0.000009097038,0.00040272402,0.78622717,0.1201002,0.0012240055,0.0000116447145,0.08958835],"study_design_scores_gemma":[0.00021485124,0.00014275403,0.0015201259,0.00011095307,0.00009030869,0.000021734362,6.688008e-7,0.9817289,0.009773835,0.00027710389,0.00551341,0.0006053334],"about_ca_topic_score_codex":0.00002685301,"about_ca_topic_score_gemma":0.000106839514,"teacher_disagreement_score":0.6506629,"about_ca_system_score_codex":0.00017378076,"about_ca_system_score_gemma":0.00027033754,"threshold_uncertainty_score":0.9998776},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026501,0.00056310237,0.98082495,0.0023136423,0.00095815735,0.00034310855,0.0000038581165,0.0002577462,0.014708909],"genre_scores_gemma":[0.023921778,0.00006852497,0.97034717,0.0024892245,0.001263735,0.000011133449,0.0000070788997,0.000046093468,0.0018452444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962469,0.000028999542,0.00027957628,0.0016818619,0.0009519311,0.0008107753],"domain_scores_gemma":[0.9980588,0.00013790965,0.00022961084,0.001115035,0.0002673401,0.00019131057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004956669,0.0005988417,0.0005164704,0.0006467934,0.0003440484,0.0009193691,0.0025953266,0.00040438672,0.000054862616],"category_scores_gemma":[0.000019061119,0.00045564192,0.00009352728,0.00087336014,0.0004207093,0.0009549056,0.0007002687,0.00100494,0.000056704674],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001671546,0.000037198028,0.000056224748,0.000037065434,0.000015288944,0.00011002543,0.0004152958,0.022590125,0.00007311798,0.0117669245,0.00070699304,0.96417505],"study_design_scores_gemma":[0.0006047395,0.0007717477,0.00032057826,0.00049908075,0.00002050502,0.0006021578,2.0859092e-7,0.89481914,0.0006955749,0.04725069,0.052890714,0.0015248597],"about_ca_topic_score_codex":0.00001859125,"about_ca_topic_score_gemma":0.00017782349,"teacher_disagreement_score":0.9626502,"about_ca_system_score_codex":0.0003483112,"about_ca_system_score_gemma":0.0005473871,"threshold_uncertainty_score":0.99978954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011480547,0.0010788356,0.99471045,0.00084944116,0.0017584867,0.00057756115,0.000032701726,0.00014761258,0.0007300994],"genre_scores_gemma":[0.015150644,0.000047040623,0.98224455,0.0015164093,0.00059918244,0.000018153301,0.000007682778,0.00004774549,0.00036859466],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959515,0.00004117694,0.0005428234,0.0019389511,0.0007824288,0.00074313756],"domain_scores_gemma":[0.99715036,0.0009897322,0.0002719229,0.0011289539,0.0002530586,0.00020596014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010491512,0.0006479756,0.0006661236,0.0006008516,0.00036681135,0.0008600295,0.0023649007,0.00029265656,0.000016266187],"category_scores_gemma":[0.0001206487,0.0005892979,0.00018762705,0.0003249644,0.00063761487,0.0009547103,0.0016906634,0.0006339118,0.00001321841],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008837813,0.000054964814,0.0000035088447,0.000070001646,0.000046503385,0.0003748317,0.0016769218,0.02612774,0.042986237,0.020910768,0.000039277176,0.90762085],"study_design_scores_gemma":[0.0022446606,0.0007720821,0.00021351852,0.0015838523,0.00004500488,0.00030818564,6.3222416e-7,0.26761106,0.036598463,0.6872527,0.0016069862,0.001762871],"about_ca_topic_score_codex":0.00013622924,"about_ca_topic_score_gemma":0.000013467678,"teacher_disagreement_score":0.905858,"about_ca_system_score_codex":0.00037317065,"about_ca_system_score_gemma":0.00053830526,"threshold_uncertainty_score":0.99965584},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015803802,0.00010490431,0.9942118,0.0019091173,0.0007143492,0.0023229257,8.755714e-7,0.000084163206,0.00049383356],"genre_scores_gemma":[0.05509897,0.0000031713964,0.93200785,0.010148229,0.0025529733,0.000095684976,0.000005477521,0.000066258865,0.000021378173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960244,0.000018617207,0.00045963706,0.0012088096,0.0012436447,0.0010448407],"domain_scores_gemma":[0.9933941,0.00032576392,0.00019384031,0.00071946916,0.0053243525,0.00004250372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0124618225,0.00037150292,0.00031644624,0.003238224,0.0010356066,0.0010242225,0.002081989,0.00022857187,0.000013254847],"category_scores_gemma":[0.0006927489,0.00035502546,0.0000293264,0.0072484273,0.00027936298,0.001994812,0.0012304292,0.000557617,0.000061471015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008818929,0.000032522254,0.000015433247,0.00042999818,0.0000072697376,0.000004862383,0.000589412,0.7661237,0.060048006,0.022051081,0.00003783171,0.15057167],"study_design_scores_gemma":[0.00009550699,0.000025218893,0.000004671079,0.0005478758,0.000011069403,0.000007477835,0.0000013742108,0.7820312,0.011509003,0.20451996,0.00075953675,0.0004871522],"about_ca_topic_score_codex":0.00022624533,"about_ca_topic_score_gemma":0.000040103878,"teacher_disagreement_score":0.18246888,"about_ca_system_score_codex":0.00041404998,"about_ca_system_score_gemma":0.0013090761,"threshold_uncertainty_score":0.99989015},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041708534,0.00019051351,0.99571025,0.0003185721,0.00039720882,0.00022644277,0.000009581827,0.000042864594,0.0026874675],"genre_scores_gemma":[0.7180071,0.00026889076,0.2804633,0.0010958299,0.00008994039,0.0000054894344,0.000014085891,0.000012156976,0.000043217195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982769,0.000016975973,0.00046069841,0.00042654658,0.0005584658,0.00026041342],"domain_scores_gemma":[0.9986195,0.0002722946,0.00027987402,0.0005817712,0.00016570884,0.00008085973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038629162,0.00022989298,0.0002823954,0.0008339043,0.00016173594,0.00024350938,0.0010230463,0.00013414309,0.000037528564],"category_scores_gemma":[0.000036681315,0.00020571597,0.000058866317,0.00039002034,0.00045192768,0.0013849968,0.0007461569,0.00031848016,0.000007352443],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027080341,0.000017038083,0.00008890251,0.000059473183,0.000005864063,0.0000053009244,0.0024545307,0.0011323642,0.0000543973,0.15323755,0.000049122737,0.84289277],"study_design_scores_gemma":[0.0007585267,0.00033004157,0.0013842746,0.0005744911,0.000010741481,0.00007998313,0.000001518103,0.81782883,0.001207467,0.16229887,0.014781933,0.0007433196],"about_ca_topic_score_codex":0.000025758185,"about_ca_topic_score_gemma":0.000022772592,"teacher_disagreement_score":0.84214944,"about_ca_system_score_codex":0.000048721904,"about_ca_system_score_gemma":0.00007516873,"threshold_uncertainty_score":0.83888537},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35955256,0.00005596375,0.6398201,0.00026110568,0.00011041522,0.0001587263,2.7831638e-7,0.00003490233,0.0000059779495],"genre_scores_gemma":[0.9755845,0.0000030258054,0.02301996,0.0012581425,0.00012403462,0.0000027808273,0.000005705959,0.0000017960648,3.514991e-8],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999094,0.000045618573,0.0001640888,0.00019732102,0.00030978187,0.00018919233],"domain_scores_gemma":[0.9994829,0.000011861971,0.000033639502,0.00021526651,0.00008621468,0.00017011222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068156206,0.000078171004,0.00011936009,0.000187017,0.00013160659,0.00007220427,0.000049274597,0.000052757347,0.0000024503229],"category_scores_gemma":[0.00006964118,0.00007220994,0.000043274882,0.0004155245,0.000047205845,0.0008863144,0.000020266787,0.0001279883,0.0000017894262],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000480702,0.000024259465,0.0023753818,0.00003871507,0.0000013533648,0.0000022079155,0.0002225249,0.0030148819,0.0039384165,0.000002008903,1.9189322e-7,0.990332],"study_design_scores_gemma":[0.0004972578,0.00014432363,0.63784516,0.00004956849,0.000009814101,0.00021663551,7.24763e-7,0.3541003,0.005929673,0.0011181136,0.000011564687,0.000076876495],"about_ca_topic_score_codex":0.00006051343,"about_ca_topic_score_gemma":0.000029542793,"teacher_disagreement_score":0.9902551,"about_ca_system_score_codex":0.00008602493,"about_ca_system_score_gemma":0.000060294926,"threshold_uncertainty_score":0.2944636},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013564467,0.0005219692,0.9939999,0.00035779603,0.00085484504,0.000401472,0.000004429617,0.00011292064,0.0036110426],"genre_scores_gemma":[0.76469344,0.00016078446,0.23132132,0.0013621211,0.0012016073,0.000017392555,0.00001076558,0.000041691455,0.0011908775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974151,0.000027443357,0.00045428303,0.0010152656,0.00060829555,0.00047957318],"domain_scores_gemma":[0.9987893,0.00012900172,0.00026839453,0.00058904826,0.00010889843,0.00011536364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062115665,0.00042317653,0.00041263876,0.00043849088,0.00043007228,0.0004772504,0.0013481356,0.00022950927,0.000019559226],"category_scores_gemma":[0.0000055531696,0.00035407746,0.00008880031,0.00021611947,0.00022330612,0.0005589254,0.0008223522,0.0003884139,0.00002166033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004109306,0.00003125554,0.000027821916,0.000047503538,0.000020309144,0.000007595691,0.004111421,0.26639435,0.000075962416,0.05680505,0.00004373772,0.6724309],"study_design_scores_gemma":[0.0002606247,0.000055753444,0.000016740902,0.00014335653,0.0000034243692,0.000012324084,3.2830548e-7,0.9722623,0.0005488701,0.020254718,0.006058673,0.00038285466],"about_ca_topic_score_codex":0.000054684584,"about_ca_topic_score_gemma":0.000023762555,"teacher_disagreement_score":0.7645578,"about_ca_system_score_codex":0.00026767055,"about_ca_system_score_gemma":0.00015723467,"threshold_uncertainty_score":0.9998911},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029168563,0.00044853738,0.98206776,0.00065400655,0.002122546,0.0005702933,0.000010702591,0.0002934036,0.013803582],"genre_scores_gemma":[0.06593307,0.00037940915,0.91742665,0.005027043,0.0020803686,0.000057782872,0.000067549496,0.00014812636,0.008880008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995178,0.00003125789,0.000530531,0.002054417,0.0013868834,0.0008189417],"domain_scores_gemma":[0.99676687,0.00032498565,0.00028064003,0.0021943732,0.0002029892,0.00023015357],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00057190494,0.00064216874,0.00056715275,0.0008617072,0.0003536765,0.00076345005,0.005744161,0.00023376412,0.000040769377],"category_scores_gemma":[0.00018447997,0.00058598345,0.00014503975,0.00076756167,0.00088159036,0.00095520774,0.00279075,0.0007866659,0.0003854462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057434254,0.000084852014,0.000014165024,0.00010111185,0.000024847506,0.0014489477,0.0007810331,0.008096101,0.000008890294,0.05723263,0.0007772244,0.93142444],"study_design_scores_gemma":[0.0006080175,0.0005548726,0.0001562986,0.00061792025,0.000027267455,0.00056364766,1.789227e-7,0.653226,0.00013651753,0.30553895,0.036716703,0.0018535873],"about_ca_topic_score_codex":0.000027811655,"about_ca_topic_score_gemma":0.00003456008,"teacher_disagreement_score":0.92957085,"about_ca_system_score_codex":0.000295764,"about_ca_system_score_gemma":0.00059102237,"threshold_uncertainty_score":0.9996592},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044284146,0.0003525436,0.9929156,0.00007838225,0.00044458517,0.00013832185,0.000009659735,0.000053191412,0.0015793326],"genre_scores_gemma":[0.84084105,0.00003867477,0.15878537,0.00018501955,0.000064209264,6.706323e-7,0.0000032498504,0.00001232484,0.00006943971],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982393,0.000036258043,0.00042456956,0.0005925181,0.00044892507,0.00025846603],"domain_scores_gemma":[0.9983473,0.00044766956,0.0003591003,0.00062943384,0.00015057405,0.00006592368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011144347,0.00023973791,0.00039319985,0.00068235036,0.000058016343,0.000067169465,0.0010663413,0.00012789886,0.000008708434],"category_scores_gemma":[0.000050042087,0.00021312051,0.00006416766,0.0003542627,0.0012480469,0.00029019386,0.0007807875,0.00030738654,0.0000017453451],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010001914,0.000026573818,0.00012159094,0.00011654537,0.000011775704,0.000021771577,0.0018572876,0.0031272522,0.00116909,0.06968737,0.000002902883,0.92384785],"study_design_scores_gemma":[0.00038562255,0.0004400896,0.0022746588,0.00095765025,0.000009400204,0.000062552965,0.000002389785,0.41359887,0.02654385,0.55501556,0.00016911687,0.000540246],"about_ca_topic_score_codex":0.00009627357,"about_ca_topic_score_gemma":0.00012020851,"teacher_disagreement_score":0.9233076,"about_ca_system_score_codex":0.00006729241,"about_ca_system_score_gemma":0.00010165017,"threshold_uncertainty_score":0.86908025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050911218,0.00039920476,0.982385,0.00021900111,0.00065386354,0.00026562426,0.000003619989,0.00040197273,0.015620804],"genre_scores_gemma":[0.1067276,0.000014938339,0.89245135,0.00054652715,0.00010490334,0.000002878576,0.0000019747106,0.00003216054,0.00011764259],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605954,0.0000193972,0.0007045034,0.0013036473,0.0012860884,0.0006268485],"domain_scores_gemma":[0.996911,0.0003098308,0.0004481314,0.0015275239,0.0006447566,0.00015876883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016138277,0.00048395206,0.0005939845,0.001095774,0.00012371804,0.00060708844,0.0042296425,0.0003189556,0.0000068346967],"category_scores_gemma":[0.0002782074,0.00046201056,0.00013919394,0.00081245345,0.0008990215,0.0012322015,0.002301541,0.0007741852,0.000014651489],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045759543,0.000041955867,0.000028143668,0.00009643426,0.000007408992,0.00007792239,0.0003631537,0.00077987433,0.00026175985,0.0062597776,0.000012600954,0.9920664],"study_design_scores_gemma":[0.00026975927,0.00026019508,0.00010209995,0.0015497701,0.0000092902455,0.00015603812,1.1664231e-7,0.32269728,0.063204296,0.6098904,0.0007650712,0.0010956676],"about_ca_topic_score_codex":0.000027213382,"about_ca_topic_score_gemma":0.00004991969,"teacher_disagreement_score":0.99097073,"about_ca_system_score_codex":0.00023474841,"about_ca_system_score_gemma":0.000621378,"threshold_uncertainty_score":0.99978316},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017076542,0.000081451726,0.99623644,0.000031170985,0.0019198686,0.00017165866,0.0000027218477,0.0005392713,0.0008466569],"genre_scores_gemma":[0.20361683,0.000013059363,0.7960145,0.00004627573,0.00018282945,0.000004714892,0.00002204158,0.000040471557,0.000059292517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998851,0.000005363026,0.0003065313,0.00030849664,0.00030781823,0.00022080728],"domain_scores_gemma":[0.9992903,0.00009864939,0.00009326434,0.00028985954,0.00016807708,0.000059884038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024107921,0.0002235283,0.00025086885,0.0003669611,0.000053848045,0.000089053756,0.00036602406,0.0002967337,0.000036812107],"category_scores_gemma":[0.000052228024,0.00021443101,0.000053072352,0.00022460138,0.00037987562,0.00011351611,0.000050445866,0.00051270466,0.000010791379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013274841,0.000004629832,0.000005744395,0.000036828354,0.000008266822,0.0000037268624,0.0002851593,0.77312756,0.0007049234,0.00026857867,0.000003576361,0.2255497],"study_design_scores_gemma":[0.00011697591,0.000026136313,0.000011930936,0.00016353013,0.000006626455,0.0000067940164,2.7244263e-7,0.9822432,0.016187647,0.0007714104,0.0002411671,0.0002243314],"about_ca_topic_score_codex":0.0000042827114,"about_ca_topic_score_gemma":0.000017825765,"teacher_disagreement_score":0.22532536,"about_ca_system_score_codex":0.00006795743,"about_ca_system_score_gemma":0.00009490189,"threshold_uncertainty_score":0.8744243},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017615305,0.00003982005,0.9692822,0.00026525368,0.0007014272,0.0006142881,0.000011152677,0.00008988122,0.02723442],"genre_scores_gemma":[0.9945144,0.0000011228561,0.0039349655,0.0007282966,0.00048663234,0.000010323072,0.00003000569,0.0000114541945,0.00028281726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978258,0.000029541476,0.00040599355,0.00045474045,0.0008997738,0.00038416844],"domain_scores_gemma":[0.998911,0.0002427146,0.0002396324,0.0001902586,0.00031151806,0.00010487074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008433,0.00022989525,0.00026722343,0.00076665473,0.0010277582,0.00030852816,0.0003149942,0.00020854824,0.00003373263],"category_scores_gemma":[0.00007953632,0.0002353256,0.00005153369,0.0003013557,0.000655657,0.00024565548,0.00014532344,0.00022523594,0.0000224612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002184663,0.000031229974,0.00954012,0.00013598624,0.000026302507,0.000044380748,0.031119741,0.66087216,0.000051917104,0.0049151494,0.00024908548,0.29299206],"study_design_scores_gemma":[0.005059569,0.0025789358,0.101814836,0.0059782765,0.0002712255,0.000029465053,0.00017123362,0.5548152,0.00071678107,0.1742613,0.14650977,0.007793407],"about_ca_topic_score_codex":0.0012351634,"about_ca_topic_score_gemma":0.0032779737,"teacher_disagreement_score":0.99275285,"about_ca_system_score_codex":0.00014828781,"about_ca_system_score_gemma":0.00018286788,"threshold_uncertainty_score":0.9596299},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009948038,0.000059288283,0.9954684,0.000008242101,0.0007656542,0.00017627743,0.00001864277,0.00007929299,0.0024293973],"genre_scores_gemma":[0.945897,0.00018220503,0.053179212,0.000038384987,0.00048632405,0.0000054955394,0.000056317702,0.00009785966,0.000057191843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914,8.531182e-7,0.00023253875,0.00023154881,0.00017369365,0.0002213228],"domain_scores_gemma":[0.9995866,0.000042375043,0.00005165422,0.00021956312,0.000055835917,0.000043964963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077292934,0.0002054644,0.0002709433,0.00016554518,0.00002588952,0.000019922467,0.00025548856,0.00012434232,0.000009560781],"category_scores_gemma":[0.0000037445384,0.00021697136,0.00006177869,0.000106424864,0.000073572024,0.00009076548,0.000020207206,0.00018226149,0.0000016849174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054175484,0.000008213251,0.00003705222,0.00024224805,0.000016975924,0.000005234752,0.00025746942,0.72266227,0.0026970075,0.0025453165,0.000007886317,0.27151492],"study_design_scores_gemma":[0.0001628584,0.000054144697,0.00041703435,0.00023468978,0.00001578417,0.0000033249714,7.3387156e-8,0.98553526,0.00042861264,0.002212782,0.01058979,0.00034563986],"about_ca_topic_score_codex":0.000003643494,"about_ca_topic_score_gemma":0.0000055455007,"teacher_disagreement_score":0.9449022,"about_ca_system_score_codex":0.00007669048,"about_ca_system_score_gemma":0.000031135227,"threshold_uncertainty_score":0.8847835},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006208913,0.00011379903,0.9913958,0.00021980243,0.0012595307,0.00024191689,0.0000035416035,0.0002136858,0.00034303914],"genre_scores_gemma":[0.88213193,0.000019116822,0.115908116,0.0009462462,0.00056752074,0.0000017588121,0.000022445707,0.000034322064,0.00036853412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960009,0.00004167691,0.0007300321,0.001532795,0.0009667647,0.0007278614],"domain_scores_gemma":[0.99828815,0.000089878544,0.00047526354,0.0007256415,0.00025650504,0.00016456601],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074998767,0.0005839844,0.0006357286,0.00093204336,0.00028611496,0.00090886623,0.002699024,0.00035976464,0.000030086272],"category_scores_gemma":[0.000025688903,0.0005504077,0.00022872089,0.00066029525,0.00026301946,0.0007557765,0.0005315201,0.0007543662,0.000036202757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025208287,0.000034692497,0.000011634928,0.000013016593,0.000012068108,0.00010335177,0.0007860531,0.30588812,0.000264951,0.020063428,0.0000025769727,0.6728176],"study_design_scores_gemma":[0.00012892194,0.00009583709,0.00012995281,0.000307668,0.000021188142,0.00008293279,1.0543956e-7,0.9975695,0.00017725596,0.0006317754,0.00025755182,0.0005972946],"about_ca_topic_score_codex":0.0000057114207,"about_ca_topic_score_gemma":0.000037819365,"teacher_disagreement_score":0.87592304,"about_ca_system_score_codex":0.0003209711,"about_ca_system_score_gemma":0.00033983937,"threshold_uncertainty_score":0.99969476},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031812054,0.00009054252,0.9953382,0.000081224636,0.00022141523,0.00074816484,0.000011078401,0.000020409982,0.00030774483],"genre_scores_gemma":[0.9971821,0.000008142259,0.0025674396,0.00003309306,0.00015913488,0.000013150652,0.0000036733647,0.00001702562,0.000016290282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881303,0.00003429786,0.00036202016,0.00022096356,0.00034693305,0.00022278084],"domain_scores_gemma":[0.99873716,0.0005755495,0.00012804718,0.0004545635,0.000072938485,0.00003177171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004459897,0.00017752887,0.00031334665,0.00021568498,0.000056311837,0.00003947664,0.0007293107,0.000110410394,0.000006167243],"category_scores_gemma":[0.000015907843,0.00012283948,0.00006171526,0.00021254149,0.00011019351,0.00005748238,0.00006637694,0.00019236584,0.0000039060587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005254771,0.0000064899705,0.00006693443,0.00001572714,0.000010209095,3.7779174e-7,0.00049840333,0.93175113,0.0098704025,0.0012500647,0.0000014454737,0.056523558],"study_design_scores_gemma":[0.00018690879,0.00002634587,0.0006493267,0.00007890775,0.000013390283,0.0000018204344,3.124907e-7,0.9975952,0.000121073164,0.0011610569,0.00004422578,0.00012142997],"about_ca_topic_score_codex":0.00005346202,"about_ca_topic_score_gemma":0.0000788918,"teacher_disagreement_score":0.99400085,"about_ca_system_score_codex":0.00007443115,"about_ca_system_score_gemma":0.00003378757,"threshold_uncertainty_score":0.5009249},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000067570254,0.00016768204,0.993592,0.00048278828,0.0029438068,0.0016890726,0.000039417442,0.0006463712,0.00037124462],"genre_scores_gemma":[0.010290219,0.000028479932,0.9875506,0.00029123484,0.0009402761,0.00008373511,0.00003839587,0.00008289564,0.00069415686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99313504,0.0000960891,0.0010753479,0.002886948,0.0014694262,0.0013371827],"domain_scores_gemma":[0.99184716,0.0032250201,0.0008619716,0.0028840376,0.0007958312,0.000385983],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002618701,0.0009929105,0.0011355637,0.00091799407,0.00062130543,0.0016902416,0.0073160287,0.00089685776,0.000033702694],"category_scores_gemma":[0.00064744154,0.00091784575,0.00023513126,0.0008821262,0.0008937484,0.0015429024,0.0014343673,0.001203077,0.00016864922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011015696,0.00019459562,0.00013628931,0.00074149447,0.00017978661,0.00045211308,0.0021739567,0.20380843,0.049334683,0.09805696,0.00033920805,0.6444723],"study_design_scores_gemma":[0.0009406051,0.0006011251,0.00021520392,0.0014067937,0.00004283764,0.00019060221,2.3136843e-7,0.5516502,0.029651208,0.411463,0.0013105059,0.0025276549],"about_ca_topic_score_codex":0.00015969719,"about_ca_topic_score_gemma":0.00005590171,"teacher_disagreement_score":0.64194465,"about_ca_system_score_codex":0.0003906722,"about_ca_system_score_gemma":0.0013241317,"threshold_uncertainty_score":0.9993461},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004223708,0.000071535884,0.9823862,0.010396626,0.0007842517,0.0007640466,0.000004121448,0.0005597999,0.005029216],"genre_scores_gemma":[0.15275922,0.00002279718,0.8420215,0.002821598,0.00047195464,0.000047814032,0.000046282243,0.00003861003,0.0017701621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964623,0.00002520663,0.0005266986,0.001584967,0.0008721664,0.0005286589],"domain_scores_gemma":[0.9970871,0.0005604129,0.00035900978,0.0016179371,0.00021646309,0.00015904779],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005168717,0.00046821794,0.000389465,0.0012420194,0.00028444268,0.00067028106,0.0030399114,0.00047627083,0.000013344913],"category_scores_gemma":[0.00020415738,0.0004243908,0.00014212402,0.00079018954,0.00032022985,0.0005046569,0.00024954465,0.0005971472,0.000046979796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009540847,0.000023465032,0.000008302818,0.000009350778,0.0000017469916,0.0000020190093,0.000063189305,0.0060367947,0.00012705952,0.28998733,0.0001825474,0.70354867],"study_design_scores_gemma":[0.00032324166,0.00033279238,0.00030591336,0.000095453564,0.000004716792,0.0000031415389,1.01574805e-7,0.5292954,0.0010871884,0.46161193,0.006554146,0.0003859665],"about_ca_topic_score_codex":0.000005427708,"about_ca_topic_score_gemma":0.000012478426,"teacher_disagreement_score":0.70316267,"about_ca_system_score_codex":0.00039539425,"about_ca_system_score_gemma":0.0009038347,"threshold_uncertainty_score":0.99982077},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014889818,0.00062318315,0.9950814,0.00009903622,0.0012011754,0.0010956785,0.0000076140323,0.00005499225,0.0003479082],"genre_scores_gemma":[0.7838652,0.000052208175,0.2144724,0.00093524007,0.0004779594,0.000034901906,0.0000053395056,0.000036988025,0.000119761076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972548,0.000034476852,0.00050933665,0.0011557365,0.00049854483,0.00054709666],"domain_scores_gemma":[0.99860525,0.0002584923,0.0002984388,0.0006170029,0.00010361046,0.00011723278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006818217,0.00039952213,0.0004898048,0.0008193268,0.00019917585,0.00043664317,0.0011446637,0.00023295566,0.000006928539],"category_scores_gemma":[0.000034370732,0.00036756508,0.00007970245,0.0003272504,0.00019570516,0.0005545137,0.00039732322,0.00033415278,0.0000019449178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025041383,0.00004433297,0.0064572054,0.0002603281,0.000035618184,0.00012030182,0.0036442336,0.40241352,0.0007892789,0.016496884,0.000059806953,0.56965345],"study_design_scores_gemma":[0.0007864166,0.00008070538,0.0018333928,0.00034743635,0.000007279456,0.000043473745,3.544086e-7,0.9596731,0.00009283551,0.03549261,0.001222201,0.0004201921],"about_ca_topic_score_codex":0.000098759934,"about_ca_topic_score_gemma":0.00010048912,"teacher_disagreement_score":0.7823762,"about_ca_system_score_codex":0.00024752918,"about_ca_system_score_gemma":0.0001370243,"threshold_uncertainty_score":0.99987763},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013257778,0.00077941344,0.9947199,0.00017307194,0.00039313224,0.0003152199,0.000007168763,0.00033181687,0.0031477034],"genre_scores_gemma":[0.2405571,0.0000051442908,0.7588769,0.000116919575,0.000037150465,0.000010001711,0.00000326758,0.000019884235,0.00037358346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686754,0.000035722147,0.00081271963,0.00086868415,0.00095755106,0.0004577662],"domain_scores_gemma":[0.99680424,0.00069706776,0.0006548676,0.0012570558,0.00049009203,0.0000966605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060822803,0.0003804271,0.0006287262,0.0010045959,0.00015008484,0.00016076685,0.003379822,0.00032517873,0.000012248397],"category_scores_gemma":[0.00019418751,0.00033730626,0.00014171381,0.00075850316,0.0007935825,0.00058307155,0.0014351156,0.0005653045,0.0000028702857],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000781912,0.0003748632,0.00012685928,0.0003556951,0.000028447143,0.00009103794,0.001831168,0.012700352,0.010013988,0.21955468,0.00014612041,0.75476897],"study_design_scores_gemma":[0.0003936641,0.00022450954,0.000076645476,0.0021496906,0.00001496157,0.000034948982,3.126071e-7,0.5909125,0.060040455,0.34538886,0.00019959972,0.0005638436],"about_ca_topic_score_codex":0.000039510374,"about_ca_topic_score_gemma":0.000017680462,"teacher_disagreement_score":0.7542051,"about_ca_system_score_codex":0.00013112629,"about_ca_system_score_gemma":0.0005305006,"threshold_uncertainty_score":0.9999079},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000086950095,0.000080158774,0.9972173,0.0004464378,0.0005700787,0.0007411975,0.00006774867,0.00009317651,0.0006969803],"genre_scores_gemma":[0.20268358,0.00004903865,0.7962233,0.0001980013,0.0002488152,0.00014407719,0.00026296804,0.000041673833,0.00014853291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738383,0.000056930312,0.00047136302,0.0010354877,0.00071577186,0.00033659118],"domain_scores_gemma":[0.99618983,0.0015845923,0.00062160764,0.00096132525,0.00056766265,0.00007498144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013433354,0.00029209274,0.0004023021,0.0004856532,0.00023737508,0.00018368845,0.0016034722,0.00029597717,0.0000015187504],"category_scores_gemma":[0.00024106422,0.0002857134,0.00012215239,0.00060650846,0.00025369474,0.0004302481,0.00023255272,0.00027139374,0.0000061320407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002654243,0.0001463635,0.00044631734,0.00035827683,0.000031246433,0.0000029528417,0.0003455723,0.047020048,0.0025152497,0.072748415,0.00012673554,0.87623227],"study_design_scores_gemma":[0.00041782839,0.00012928054,0.0019867704,0.00039461715,0.000013087165,0.0000033573308,8.709305e-8,0.9514627,0.0050493544,0.039139003,0.0010449362,0.0003589843],"about_ca_topic_score_codex":0.000012116622,"about_ca_topic_score_gemma":0.0000072006205,"teacher_disagreement_score":0.90444267,"about_ca_system_score_codex":0.00054796593,"about_ca_system_score_gemma":0.00057198474,"threshold_uncertainty_score":0.9999595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033001408,0.0005270521,0.99181074,0.00049256283,0.0020991517,0.00022419024,0.000014884845,0.00027132547,0.0045271195],"genre_scores_gemma":[0.11713561,0.00004476064,0.87360007,0.006343482,0.0018921376,0.000009691006,0.00005331269,0.00007909422,0.00084187224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576247,0.000036140114,0.0005533667,0.0016493006,0.0010676398,0.0009310731],"domain_scores_gemma":[0.99684393,0.00078540365,0.00028722166,0.0016777607,0.00015869735,0.00024699228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015088735,0.00055254216,0.00047400786,0.0007911819,0.00033369914,0.0004970762,0.0032565878,0.00025225725,0.000051027957],"category_scores_gemma":[0.00008479326,0.00051257253,0.00012113002,0.00050458463,0.00047249018,0.00065639,0.0014434094,0.0010445608,0.0001417743],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036256022,0.000017660604,0.00037465294,0.00003642042,0.000008482174,0.00032477005,0.00042829182,0.012035345,0.000023491202,0.0071436623,0.0001077725,0.9794958],"study_design_scores_gemma":[0.000426237,0.00026114524,0.00018537378,0.0013488417,0.00001607346,0.00020434016,1.5308082e-7,0.9318179,0.0026707097,0.031177647,0.030242378,0.0016492154],"about_ca_topic_score_codex":0.00010127274,"about_ca_topic_score_gemma":0.00009350508,"teacher_disagreement_score":0.9778466,"about_ca_system_score_codex":0.00017072467,"about_ca_system_score_gemma":0.0004984837,"threshold_uncertainty_score":0.9997326},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072477816,0.0008389319,0.9953001,0.00065127545,0.00041974636,0.00029996404,0.00006517556,0.00033354983,0.0013664769],"genre_scores_gemma":[0.9266127,0.0002081652,0.072708316,0.00017432838,0.0000878856,0.000052570686,0.000033775734,0.000037933572,0.00008437766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987224,0.00000525099,0.00030570073,0.0003980512,0.00018514323,0.00038349372],"domain_scores_gemma":[0.9987381,0.00035680828,0.000068018904,0.00074918347,0.0000550233,0.000032856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023152807,0.0002778096,0.00031011307,0.0006409754,0.000075813005,0.0000636912,0.001173558,0.00024435724,0.000007223619],"category_scores_gemma":[0.00003713458,0.00026852975,0.00006016884,0.00016755486,0.0003453134,0.00011112446,0.00014085686,0.0005314903,0.000010485636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011352324,0.000028119128,0.000063071864,0.00008659926,0.000008469116,0.000015812402,0.00008573024,0.6814283,0.00023349683,0.0040504895,0.00016655319,0.313822],"study_design_scores_gemma":[0.000370925,0.000039735714,0.000100182195,0.0005702773,0.0000029987193,0.000006517659,4.3522232e-7,0.9696033,0.001961785,0.019731136,0.0072302287,0.00038249826],"about_ca_topic_score_codex":0.0000046921614,"about_ca_topic_score_gemma":0.00028278737,"teacher_disagreement_score":0.9258879,"about_ca_system_score_codex":0.00026663448,"about_ca_system_score_gemma":0.000111726695,"threshold_uncertainty_score":0.9999767},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05810607,0.000674511,0.93483007,0.00042575508,0.00034439028,0.0003046496,0.00001495953,0.000012784585,0.005286782],"genre_scores_gemma":[0.9751744,0.0001444718,0.018578561,0.00056073104,0.00076782785,0.000008145559,0.00012055626,0.000046664798,0.0045985864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982081,0.000017865495,0.00024800852,0.0007110782,0.00033846856,0.00047650174],"domain_scores_gemma":[0.99925107,0.000036950307,0.00007414975,0.00048733407,0.00007380188,0.00007672307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039431007,0.00023951729,0.00022859579,0.00028893974,0.00005804228,0.0000837078,0.0007010172,0.00030386826,0.000008383839],"category_scores_gemma":[0.000056567376,0.00022346068,0.000064027874,0.00013876158,0.000441472,0.000006198297,0.00044436174,0.00041311144,0.00000861137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014333257,0.000108374814,0.011466445,0.00016002807,0.000031624764,0.0005595574,0.00007188994,0.10973002,0.06901549,0.0051355003,0.00038383677,0.8031939],"study_design_scores_gemma":[0.0027337908,0.001868806,0.0044425186,0.0012715961,0.000020088733,0.00032093303,0.0000013665613,0.81777966,0.081470676,0.067955844,0.018621515,0.0035132193],"about_ca_topic_score_codex":0.000101228296,"about_ca_topic_score_gemma":0.0018189866,"teacher_disagreement_score":0.91706836,"about_ca_system_score_codex":0.00021720662,"about_ca_system_score_gemma":0.0002456981,"threshold_uncertainty_score":0.91124624},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030309832,0.0008938128,0.9926103,0.00024685377,0.0022219438,0.00031213995,0.000003480186,0.0003297773,0.0030785971],"genre_scores_gemma":[0.51103866,0.00009077468,0.4861665,0.001286741,0.0009612295,0.000013601375,0.000020661626,0.000057126053,0.00036471884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963487,0.00006804279,0.00049282674,0.0014084738,0.00091598526,0.0007659905],"domain_scores_gemma":[0.99675596,0.00042771167,0.00032602073,0.0020263828,0.00018690119,0.00027704134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014145686,0.0004904574,0.00042952594,0.0006836477,0.00030324655,0.00065442483,0.0038193215,0.00038408453,0.000056127978],"category_scores_gemma":[0.00006506565,0.0004501263,0.000094831856,0.0007398423,0.00047684484,0.0022316582,0.00078531634,0.0007588531,0.00014668457],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032526705,0.000049726023,0.00012744927,0.000017300215,0.0000044527856,0.000023222397,0.0006440065,0.006930765,0.0002622589,0.12177881,0.00001616288,0.8701426],"study_design_scores_gemma":[0.00019391025,0.00021065708,0.0010171528,0.00035005732,0.000008651456,0.00009007303,2.0006324e-7,0.57952726,0.001008418,0.41471702,0.0020460016,0.0008306065],"about_ca_topic_score_codex":0.000020448288,"about_ca_topic_score_gemma":0.000027122973,"teacher_disagreement_score":0.869312,"about_ca_system_score_codex":0.0002916533,"about_ca_system_score_gemma":0.00039702913,"threshold_uncertainty_score":0.999795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021340139,0.00011682648,0.9862298,0.002089733,0.00058300834,0.00030860314,0.0000064294436,0.0001121513,0.010340081],"genre_scores_gemma":[0.7792568,0.000029856545,0.21637458,0.0034915921,0.00025888195,0.000014826763,0.000005174528,0.000039155602,0.00052911084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750876,0.000045928686,0.00034427198,0.0008477423,0.00086371874,0.00038955794],"domain_scores_gemma":[0.99706656,0.0008273049,0.00030341317,0.0015484256,0.00017975195,0.00007453417],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006852089,0.00034559006,0.00036725958,0.0003822471,0.00036760463,0.0002465933,0.002423011,0.00014822619,0.000071553],"category_scores_gemma":[0.0000697052,0.00021614338,0.000093479,0.0005550127,0.0029469978,0.0002631985,0.0005189822,0.0005981519,0.00003130558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008498291,0.000035141373,0.000005645265,0.000011567755,0.000011736967,0.0000125596625,0.0002941179,0.0047562467,0.000039477087,0.96233094,0.00007891728,0.03241518],"study_design_scores_gemma":[0.00015699233,0.00027785203,0.00011918315,0.00028357765,0.000006205561,0.000040433126,1.8423665e-7,0.33077377,0.00059823826,0.66698366,0.0005023401,0.00025758753],"about_ca_topic_score_codex":0.00002586589,"about_ca_topic_score_gemma":0.000046625955,"teacher_disagreement_score":0.77904344,"about_ca_system_score_codex":0.00015841793,"about_ca_system_score_gemma":0.00018681947,"threshold_uncertainty_score":0.9997664},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019140335,0.000317126,0.99424237,0.0011187785,0.001797042,0.0007679527,0.000020308526,0.00014942304,0.0013955837],"genre_scores_gemma":[0.1421306,0.000053271833,0.8524566,0.0026783675,0.0012355297,0.00003942408,0.00013708239,0.000036529706,0.0012325528],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967423,0.000037210782,0.0005224401,0.001417241,0.0007868221,0.0004940019],"domain_scores_gemma":[0.9977531,0.0007130439,0.00031675084,0.00070058793,0.0003621972,0.00015433316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095797883,0.00045474834,0.0004406518,0.0010896318,0.00036515517,0.0004680343,0.0015048633,0.0002676603,0.000015421858],"category_scores_gemma":[0.000106534186,0.00044512306,0.00018374536,0.00078207423,0.0001959063,0.0007764887,0.00017790942,0.00040521816,0.000013671753],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016707821,0.00004558842,0.000004291051,0.000024159894,0.000011171322,0.00001148419,0.00020913346,0.06951231,0.00038352594,0.08199368,0.000078345765,0.8477096],"study_design_scores_gemma":[0.00060277455,0.00048999354,0.00023265778,0.00010771692,0.000012385106,0.000033397937,7.935981e-8,0.45567527,0.004010418,0.5360365,0.0022671486,0.00053163193],"about_ca_topic_score_codex":0.000005671948,"about_ca_topic_score_gemma":0.000068294394,"teacher_disagreement_score":0.847178,"about_ca_system_score_codex":0.0002451815,"about_ca_system_score_gemma":0.00051885145,"threshold_uncertainty_score":0.9998},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0123364385,0.00025483657,0.9840352,0.0017766375,0.0012686971,0.00013375233,0.0000010786938,0.00012430311,0.00006906937],"genre_scores_gemma":[0.6326372,0.000034470504,0.36656213,0.00063477125,0.00012121543,0.000004702133,5.473283e-7,0.0000033821452,0.0000016093226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784786,0.00006480985,0.00025042385,0.0006577129,0.00062542903,0.0005537687],"domain_scores_gemma":[0.9980636,0.0005268429,0.00007934086,0.0010809395,0.000122639,0.00012661621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006343123,0.00016670262,0.00014487626,0.00014411619,0.0010820666,0.00036730518,0.0030857418,0.000053453205,0.0000042432616],"category_scores_gemma":[0.00009080609,0.00010209274,0.000043991597,0.0015297992,0.001037239,0.0006956969,0.0011238551,0.00028535235,0.000028272636],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027636997,0.000036351717,0.0007466326,0.0000017722706,0.0000021952985,0.00008236193,0.00068062096,0.0027793562,0.0005566303,0.004075577,0.000103593906,0.99093217],"study_design_scores_gemma":[0.00021099935,0.00006266586,0.004492482,0.000022485538,5.5387045e-7,0.00025646592,4.058117e-7,0.9705986,0.0053181634,0.017163407,0.0016825995,0.00019120656],"about_ca_topic_score_codex":0.00003566128,"about_ca_topic_score_gemma":0.000016276836,"teacher_disagreement_score":0.99074095,"about_ca_system_score_codex":0.000067781184,"about_ca_system_score_gemma":0.00032145635,"threshold_uncertainty_score":0.83224905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013132242,0.00016411806,0.9914981,0.00009154093,0.0014171879,0.00033628746,6.8319184e-7,0.00028489283,0.0048939353],"genre_scores_gemma":[0.6331773,0.00004139046,0.3541983,0.0006999775,0.0017482319,0.000004181621,0.000009072903,0.000103796774,0.010017738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952402,0.00011086556,0.00082518155,0.0018079223,0.0012172473,0.0007985558],"domain_scores_gemma":[0.9970789,0.0006368289,0.00060740975,0.00097517663,0.00047894847,0.00022275365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00153298,0.000590306,0.00070014695,0.00057454145,0.0004306563,0.0006161265,0.0022410748,0.00038251944,0.000020424217],"category_scores_gemma":[0.00025120933,0.00048329166,0.0001614966,0.00049274386,0.00038593862,0.0006506158,0.0009089674,0.002085904,0.00010899157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010806046,0.000036032558,0.010305657,0.0000166606,0.000022080909,0.00007040492,0.00049744995,0.39314014,0.0000028222782,0.017495701,0.0000036987958,0.5783986],"study_design_scores_gemma":[0.0008602049,0.0012135385,0.0033721132,0.0024579745,0.00001769756,0.000044620858,4.680539e-7,0.9306229,0.0001051814,0.0026693144,0.05712743,0.0015085661],"about_ca_topic_score_codex":0.000027333403,"about_ca_topic_score_gemma":0.000019966279,"teacher_disagreement_score":0.63729984,"about_ca_system_score_codex":0.00032455844,"about_ca_system_score_gemma":0.00034875615,"threshold_uncertainty_score":0.9997619},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012568219,0.00030372036,0.9959035,0.00019025133,0.00063934573,0.0002446577,0.0000017311005,0.00026143773,0.0011985502],"genre_scores_gemma":[0.42485318,0.00011506125,0.57420933,0.0005434725,0.00017746333,0.000006578982,0.0000019920144,0.000021383388,0.00007154441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800295,0.000018830971,0.00031465982,0.0008005935,0.0004684701,0.00039450213],"domain_scores_gemma":[0.99842125,0.0007020612,0.00015738775,0.00056251686,0.00007911653,0.00007765619],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012123487,0.0002780112,0.00025923428,0.0009119993,0.00010051243,0.00029287479,0.00067074236,0.00026678556,0.000008082679],"category_scores_gemma":[0.00020619803,0.00027296855,0.00003541412,0.00050930376,0.000121535915,0.0008815376,0.00052581937,0.0007003946,0.000005436442],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051789643,0.00001403363,0.0157926,0.00004471012,0.0000046395676,0.000052635478,0.0007631444,0.0047061658,0.00007286697,0.018381901,0.000020780686,0.96014136],"study_design_scores_gemma":[0.0005961883,0.0003358416,0.14523438,0.0009176412,0.000008376604,0.00020734858,3.9209309e-7,0.6609724,0.0009900227,0.18225032,0.00714853,0.0013385237],"about_ca_topic_score_codex":0.00008917549,"about_ca_topic_score_gemma":0.0002920167,"teacher_disagreement_score":0.9588028,"about_ca_system_score_codex":0.0001676989,"about_ca_system_score_gemma":0.00010757074,"threshold_uncertainty_score":0.9999722},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016235315,0.00007952134,0.9952188,0.00028157025,0.0009002448,0.0005550296,0.000004202278,0.00014270427,0.0011943609],"genre_scores_gemma":[0.27352652,0.0000071324894,0.7251774,0.00058450847,0.0003318642,0.000030450787,0.000030944902,0.000040429153,0.00027072467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964608,0.000044708933,0.00047820786,0.0015378741,0.00093889656,0.00053951924],"domain_scores_gemma":[0.9980745,0.00014804293,0.00034004948,0.0010904183,0.00022945239,0.00011758627],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047659248,0.0004890652,0.0005160906,0.0016076082,0.00034912248,0.00060750096,0.0013926523,0.00030707323,0.000035226545],"category_scores_gemma":[0.000038369784,0.00041628873,0.0002571743,0.0012593431,0.00033176257,0.00060914987,0.00037498612,0.0005944982,0.000022542186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026474137,0.00007670768,0.000035697372,0.000048388993,0.000038913902,0.000045733515,0.00018042228,0.83909154,0.0015241911,0.0013177159,0.00006917786,0.15754506],"study_design_scores_gemma":[0.00021166484,0.00016423808,0.00005343477,0.0005893143,0.00007007588,0.000011926939,2.0162163e-7,0.9675171,0.011202745,0.019373538,0.00021947527,0.00058629736],"about_ca_topic_score_codex":0.0000612572,"about_ca_topic_score_gemma":0.000017305594,"teacher_disagreement_score":0.271903,"about_ca_system_score_codex":0.00031412387,"about_ca_system_score_gemma":0.00033350088,"threshold_uncertainty_score":0.9998289},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048300107,0.0007418339,0.9926176,0.00027219093,0.0009961299,0.00028481634,0.0000011482473,0.000060619543,0.00019562007],"genre_scores_gemma":[0.5679746,0.00009452948,0.4309823,0.0005156395,0.0003466385,0.0000036140007,8.888657e-7,0.000030362788,0.000051417534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637824,0.000104151186,0.0005633099,0.0015848158,0.00067359966,0.00069589965],"domain_scores_gemma":[0.99816525,0.0004916052,0.00026682176,0.00090546097,0.000038537986,0.00013230159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016243965,0.0004932117,0.00053857686,0.00091738306,0.00023449663,0.00052364694,0.0013322098,0.00037637056,0.0000062041677],"category_scores_gemma":[0.00008980801,0.00049974164,0.000084242885,0.0005678125,0.00040704483,0.00094684924,0.0007826882,0.00095680193,0.0000067916644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052921037,0.000017739078,0.00066870893,0.00001451112,0.000004877943,0.000055789184,0.00043662768,0.16815385,0.0009248034,0.00011334193,2.1058831e-7,0.82960427],"study_design_scores_gemma":[0.00051857455,0.0000776028,0.008198919,0.0006586049,0.00000703411,0.00017937546,3.7918613e-7,0.97017163,0.0025076426,0.01637924,0.0004759856,0.0008250165],"about_ca_topic_score_codex":0.000042463565,"about_ca_topic_score_gemma":0.00078758766,"teacher_disagreement_score":0.8287792,"about_ca_system_score_codex":0.00045484863,"about_ca_system_score_gemma":0.00013326031,"threshold_uncertainty_score":0.9997454},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004428179,0.00018527184,0.99676037,0.00080996915,0.00025702105,0.0004606888,0.0008156565,0.000031076346,0.0002371418],"genre_scores_gemma":[0.9885094,0.00008759235,0.009487134,0.00028607174,0.00056822,0.000011640151,0.00096471584,0.000017128888,0.00006806738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995419,0.00017987736,0.00057241425,0.0018965108,0.001462928,0.0004692268],"domain_scores_gemma":[0.99120384,0.0019576077,0.00052587804,0.005703302,0.00044752788,0.00016183194],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.005811795,0.00033790187,0.0009284598,0.0016662142,0.0009954233,0.00039849966,0.008239733,0.0003004525,0.00029222452],"category_scores_gemma":[0.0006014086,0.00027546074,0.00035041256,0.003822118,0.0024262136,0.0009284767,0.00090407016,0.00043551877,0.0000030796402],"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.000028968165,0.00016309277,0.00075892935,0.00003276906,0.00273325,0.0000036187478,0.0076369112,0.44240102,0.00004206374,0.0038336453,0.000012465129,0.5423533],"study_design_scores_gemma":[0.00013854014,0.000053008524,0.0025219952,0.000036344012,0.006421628,8.1891706e-8,0.000032966884,0.9811393,0.00005818817,0.008481299,0.00070442347,0.00041223373],"about_ca_topic_score_codex":0.012154099,"about_ca_topic_score_gemma":0.36614206,"teacher_disagreement_score":0.9880666,"about_ca_system_score_codex":0.00029365672,"about_ca_system_score_gemma":0.0021792483,"threshold_uncertainty_score":0.9999698},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014314556,0.00024506004,0.9938244,0.00020057122,0.0013553775,0.0002864509,0.000003408698,0.00013999126,0.002513266],"genre_scores_gemma":[0.026098039,0.000017020064,0.9724824,0.000925975,0.00039436037,0.0000011271206,0.0000047272133,0.000030862906,0.000045477827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966206,0.000088739806,0.0005834768,0.0013651972,0.00070065557,0.00064131356],"domain_scores_gemma":[0.99771917,0.0006151385,0.00033886067,0.0007903836,0.00035031416,0.00018613298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013947877,0.00049062294,0.0005324266,0.0010621292,0.00042550787,0.0009332458,0.0011321413,0.00030873067,0.000019918785],"category_scores_gemma":[0.00010868679,0.0004897244,0.000102697675,0.0005637658,0.00091338716,0.0010888919,0.00071321207,0.0006209856,0.000010647007],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012355827,0.000019163936,0.000007443555,0.000029864572,0.000007643007,0.00014506416,0.000260337,0.00084397785,0.06470934,0.0013848583,0.0000046395594,0.9325753],"study_design_scores_gemma":[0.0005670562,0.00020120766,0.00027201624,0.0006411948,0.000018423103,0.0018455414,2.9905792e-7,0.8699764,0.022969611,0.10248415,0.0001847785,0.0008393101],"about_ca_topic_score_codex":0.000047299298,"about_ca_topic_score_gemma":0.000031409258,"teacher_disagreement_score":0.931736,"about_ca_system_score_codex":0.00037479145,"about_ca_system_score_gemma":0.00023462115,"threshold_uncertainty_score":0.99975544},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026842413,0.0007133714,0.9941732,0.00019556387,0.002632377,0.00057678705,0.0000061248456,0.0001945166,0.0012396201],"genre_scores_gemma":[0.18246526,0.000089432506,0.81463504,0.0008727784,0.001161732,0.000006598277,0.000005336552,0.00006165823,0.00070213905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950443,0.000054129225,0.0008096888,0.0018882217,0.0013414497,0.00086223683],"domain_scores_gemma":[0.9972839,0.00017398834,0.00051949493,0.0015503088,0.00022832307,0.00024398734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089703413,0.0006741415,0.0006383988,0.0009714059,0.00040901708,0.0007521338,0.0031347065,0.00039798464,0.00003753724],"category_scores_gemma":[0.00003376135,0.0006410561,0.00020089606,0.0005228476,0.0002701962,0.0016317997,0.0013798436,0.0007044055,0.00007049957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032693142,0.000055756507,0.00007057632,0.000056644098,0.000017083865,0.00007892066,0.001336161,0.65547866,0.0005139645,0.007311686,0.000019840425,0.33505744],"study_design_scores_gemma":[0.00038117098,0.000032341053,0.00010158427,0.00047090233,0.000008133176,0.00006268381,1.476884e-7,0.9868999,0.0005347318,0.009914629,0.00089960126,0.00069416926],"about_ca_topic_score_codex":0.00008007555,"about_ca_topic_score_gemma":0.000099310884,"teacher_disagreement_score":0.33436328,"about_ca_system_score_codex":0.00070596306,"about_ca_system_score_gemma":0.00038474915,"threshold_uncertainty_score":0.99960405},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006471281,0.0002678903,0.99448645,0.00025168122,0.0017890906,0.0010936612,0.00005058122,0.00033809256,0.0010754482],"genre_scores_gemma":[0.075714625,0.000010064902,0.9167554,0.0055552167,0.0017237177,0.000021467218,0.00013599411,0.00006732625,0.000016222253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99443054,0.000066164874,0.0007020719,0.0024390158,0.0012378161,0.0011243629],"domain_scores_gemma":[0.9961651,0.00033552537,0.0004751567,0.0015979079,0.0010567991,0.00036952939],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089885475,0.00091503543,0.0007535237,0.0010410334,0.0007039855,0.00084213266,0.0046962635,0.00057262764,0.000006226706],"category_scores_gemma":[0.0000046632927,0.00080598536,0.000215995,0.0013502849,0.00034699272,0.0015889445,0.0009977625,0.0009371748,0.000009134026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016448816,0.00031417614,0.00004260398,0.00046799303,0.00010479794,0.000100856625,0.009177038,0.56402457,0.0046744547,0.015970381,0.000013453143,0.4049452],"study_design_scores_gemma":[0.00054459716,0.00040759536,0.000031774864,0.00031733984,0.00003232655,0.00016160679,0.000007560015,0.98630446,0.0017158748,0.009075736,0.00038621758,0.0010149183],"about_ca_topic_score_codex":0.0001846573,"about_ca_topic_score_gemma":0.00030476105,"teacher_disagreement_score":0.4222799,"about_ca_system_score_codex":0.00039305948,"about_ca_system_score_gemma":0.0005283116,"threshold_uncertainty_score":0.9994391},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010240118,0.00033823075,0.99207157,0.00040942425,0.0014898136,0.00031332026,0.000008789178,0.00013378919,0.0042110565],"genre_scores_gemma":[0.79637223,0.00001730521,0.20268144,0.00050785067,0.00028712876,0.0000048087304,0.0000025190425,0.000023666815,0.00010304021],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961837,0.00006115647,0.0006813453,0.0016465917,0.0008339703,0.0005932635],"domain_scores_gemma":[0.9964907,0.00057250785,0.0003776314,0.0021825193,0.0002042019,0.00017242189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017332833,0.00048506065,0.0006608505,0.00094757235,0.00017642221,0.0002200691,0.0040325234,0.0003136601,0.000059891303],"category_scores_gemma":[0.00013946138,0.00045044528,0.00028538363,0.000834912,0.0014101331,0.0004521327,0.0013047296,0.0006287643,0.000022736212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018115785,0.000067444336,0.00007620025,0.000060090362,0.000016571432,0.00003249498,0.0011705707,0.0068906927,0.0005629376,0.33514947,0.000007622698,0.6559478],"study_design_scores_gemma":[0.0003058863,0.00029200662,0.00020299242,0.0003916255,0.00000954722,0.00003216462,2.0343838e-7,0.01309219,0.007035965,0.9776457,0.00040033224,0.0005913944],"about_ca_topic_score_codex":0.000038629973,"about_ca_topic_score_gemma":0.000033648965,"teacher_disagreement_score":0.7953482,"about_ca_system_score_codex":0.0002350061,"about_ca_system_score_gemma":0.00091725163,"threshold_uncertainty_score":0.9997947},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012444619,0.000047690264,0.9743826,0.0014079198,0.003955215,0.0010624368,0.000023618744,0.0002212025,0.0064546983],"genre_scores_gemma":[0.9265675,0.000050695082,0.04696492,0.019526873,0.0008130416,0.00003326665,0.000007820484,0.000087701694,0.0059482083],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9964541,0.000071417984,0.0004336541,0.0015705761,0.00086171186,0.00060854474],"domain_scores_gemma":[0.99794316,0.0006083269,0.00019039917,0.00087824004,0.00011653043,0.00026333856],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003613765,0.00052237586,0.00044826718,0.00054275355,0.00030904825,0.00037233275,0.001380159,0.00028249915,0.00035942896],"category_scores_gemma":[0.0003988861,0.0004275889,0.000103230304,0.0003808457,0.00041905037,0.0004063413,0.00051293767,0.0007882685,0.0010686851],"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.000015586707,0.000025746815,0.0000021147266,0.000018432429,0.000001423041,0.000120831646,0.0004249966,0.002955801,0.671147,0.016545694,0.00015446874,0.3085879],"study_design_scores_gemma":[0.00012364578,0.00026720407,0.000011306172,0.0002447245,0.000005037836,0.00007977953,2.5208078e-7,0.034906168,0.8838188,0.07890523,0.0010888469,0.0005489789],"about_ca_topic_score_codex":0.000006494337,"about_ca_topic_score_gemma":0.000020457865,"teacher_disagreement_score":0.9274177,"about_ca_system_score_codex":0.00011961251,"about_ca_system_score_gemma":0.00012212599,"threshold_uncertainty_score":0.9998176},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014454017,0.00051551434,0.993318,0.00039354878,0.0013425933,0.0002787478,0.000024497316,0.00013689479,0.003845648],"genre_scores_gemma":[0.12308282,0.00014263518,0.87313205,0.0029326174,0.0005755098,0.000004127451,0.000022680279,0.000045707126,0.00006184343],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956692,0.000029689234,0.000718498,0.001487093,0.0013569036,0.00073862],"domain_scores_gemma":[0.99650115,0.0006729626,0.0004321167,0.0019502543,0.00022105323,0.000222455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001431177,0.0005397909,0.00064189575,0.0011691916,0.0001745878,0.00033530197,0.0045613283,0.00043711858,0.000047464975],"category_scores_gemma":[0.00010288513,0.0004381865,0.00022484674,0.0010205418,0.0009471883,0.00089620694,0.0019103537,0.0009931352,0.000013281699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004465688,0.00009133138,0.00024255492,0.00018561675,0.000046713514,0.00036796517,0.005400093,0.002622814,0.00022128073,0.26586434,0.000063529566,0.7248491],"study_design_scores_gemma":[0.0011536661,0.0008210882,0.0011724324,0.0020951284,0.000053321222,0.00039294348,0.0000015657868,0.2054495,0.006777337,0.7438471,0.035373695,0.0028622393],"about_ca_topic_score_codex":0.00005990191,"about_ca_topic_score_gemma":0.00024137468,"teacher_disagreement_score":0.72198683,"about_ca_system_score_codex":0.000110527384,"about_ca_system_score_gemma":0.00047137123,"threshold_uncertainty_score":0.999807},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028362678,0.00071355613,0.98724544,0.00027499095,0.00614889,0.0011721046,0.000003741505,0.00027796114,0.004134956],"genre_scores_gemma":[0.4667205,0.000090454705,0.52351636,0.003844928,0.0016516128,0.0000701514,0.000036969,0.00017314153,0.003895863],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948547,0.000039320046,0.0007323784,0.0019452625,0.0011410363,0.0012872855],"domain_scores_gemma":[0.99663156,0.00047537964,0.00048455995,0.0015617661,0.00052092504,0.00032579523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001721466,0.00073455216,0.0007925754,0.00092403515,0.00041931792,0.0007554501,0.004058846,0.00060097576,0.000012659846],"category_scores_gemma":[0.00012811091,0.00065136363,0.00031275424,0.00053119357,0.0008501142,0.0005085491,0.00092504174,0.00077244674,0.00007098367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008431834,0.000043221135,0.00006169551,0.000076858756,0.000021375274,0.00009893233,0.00073059555,0.0008843076,0.000010116428,0.47583225,0.00008504818,0.5221472],"study_design_scores_gemma":[0.00061959255,0.00057517685,0.00005298108,0.00010277729,0.000017537106,0.00014399222,7.0744505e-7,0.03563168,0.00072326494,0.9312571,0.029771835,0.0011033092],"about_ca_topic_score_codex":0.00011834199,"about_ca_topic_score_gemma":0.00025799198,"teacher_disagreement_score":0.52104384,"about_ca_system_score_codex":0.0004172704,"about_ca_system_score_gemma":0.00055414636,"threshold_uncertainty_score":0.99959373},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007693423,0.001083628,0.99560887,0.00088055513,0.0009654591,0.0004207801,0.00007547457,0.0002599145,0.0006284021],"genre_scores_gemma":[0.016267719,0.00009782607,0.9813903,0.0011136717,0.0007013438,0.000018277104,0.00005249582,0.000055778917,0.0003026183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942201,0.000060616418,0.00076007517,0.0022934992,0.001579809,0.001085942],"domain_scores_gemma":[0.99537826,0.0013865251,0.00032742362,0.0020960306,0.00054509554,0.0002666988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001980102,0.0006841207,0.0008730496,0.0017553499,0.0005555592,0.00066492386,0.004783176,0.00042976893,0.000025903297],"category_scores_gemma":[0.00023907458,0.0006462619,0.00034527874,0.0015776858,0.0006787163,0.0006131911,0.00083926803,0.00081198185,0.00002542305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030554547,0.000029743422,0.000028186654,0.00004046397,0.000028738366,0.00014095275,0.00065178773,0.010014498,0.0001115137,0.00034837375,0.00017330953,0.98842937],"study_design_scores_gemma":[0.00050131476,0.00024098576,0.000012106306,0.00049443136,0.000022339926,0.000045730736,2.5291135e-7,0.98986965,0.001578611,0.0045565297,0.0019113526,0.0007667173],"about_ca_topic_score_codex":0.000031887113,"about_ca_topic_score_gemma":0.000039728264,"teacher_disagreement_score":0.9876627,"about_ca_system_score_codex":0.00033557913,"about_ca_system_score_gemma":0.0017496516,"threshold_uncertainty_score":0.99959886},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015036878,0.000597223,0.9804079,0.00006996965,0.0015968328,0.00020833121,0.000002913114,0.00036868133,0.016597804],"genre_scores_gemma":[0.89123607,0.000067942376,0.107084915,0.0004235619,0.00069624983,0.0000106737525,0.000008384036,0.00008906494,0.000383132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981808,0.000008714451,0.00036234473,0.0005248275,0.00053707155,0.0003862337],"domain_scores_gemma":[0.9990779,0.00012406344,0.000055503468,0.00053781434,0.00008792446,0.00011678977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001976126,0.00036747666,0.0003603417,0.00044034835,0.00012698969,0.00018868725,0.00055947975,0.0002326581,0.00006365208],"category_scores_gemma":[0.000023959528,0.00035407682,0.000086769534,0.00018596862,0.0002902348,0.0001555696,0.00007854922,0.0005101558,0.000116769574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003539237,0.000011477325,0.0000562479,0.00016099286,0.000020280559,0.00018094385,0.00079771713,0.6927328,0.0018598221,0.0003801306,0.00025439076,0.30354166],"study_design_scores_gemma":[0.00022456534,0.000035577847,0.000084794185,0.00029671748,0.000005624563,0.0000698199,1.4863468e-7,0.9917998,0.0015651908,0.0004159775,0.0050030495,0.0004987552],"about_ca_topic_score_codex":0.000012416211,"about_ca_topic_score_gemma":0.00010183977,"teacher_disagreement_score":0.8910857,"about_ca_system_score_codex":0.00024909223,"about_ca_system_score_gemma":0.00016358207,"threshold_uncertainty_score":0.9998911},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7797423,0.00007565019,0.2188198,0.00076467975,0.00019850396,0.00030586935,0.0000022884224,0.000047775105,0.00004314836],"genre_scores_gemma":[0.91520804,0.0000017883391,0.08394711,0.0005833227,0.00022746212,0.000009470459,0.000012069861,0.000008034847,0.0000026919956],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983483,0.00006209353,0.00028426707,0.00057793595,0.0004450045,0.0002824053],"domain_scores_gemma":[0.99871707,0.0007405137,0.00005482758,0.0002281959,0.00015163561,0.00010772783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006266564,0.00016765337,0.00027340354,0.00015418255,0.0002073055,0.000088977395,0.00010460762,0.00008259697,0.000024088273],"category_scores_gemma":[0.00032371192,0.00011922174,0.00002817217,0.00075173617,0.00079296477,0.00018709508,0.000026076172,0.00025085907,0.0000014860226],"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.00009312195,0.0005549504,0.84600145,0.00019267239,0.000009152897,0.00006323849,0.0013763648,0.024048863,0.11141805,0.00014000997,0.00007041226,0.01603173],"study_design_scores_gemma":[0.0013972833,0.0014395453,0.8041352,0.0005086898,0.000044827397,0.009737676,0.000012587113,0.13529232,0.043654103,0.0031517504,0.000085124026,0.00054089364],"about_ca_topic_score_codex":0.000046942878,"about_ca_topic_score_gemma":0.00002552984,"teacher_disagreement_score":0.13546577,"about_ca_system_score_codex":0.00010871523,"about_ca_system_score_gemma":0.0004014701,"threshold_uncertainty_score":0.48617214},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012501532,0.00029014394,0.9916445,0.0006715383,0.00047672115,0.00053197215,0.0000066160733,0.0008982703,0.0054677418],"genre_scores_gemma":[0.009779755,0.000035893674,0.98754776,0.0019746765,0.00019464482,0.000015149281,0.000004461461,0.00005112621,0.00039652947],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951107,0.000054231903,0.0005593496,0.0021545999,0.0012369824,0.0008841382],"domain_scores_gemma":[0.9970253,0.0003319557,0.00050569273,0.0016194971,0.00029068431,0.00022684906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084580056,0.00075317564,0.00067107374,0.0008525019,0.00033609284,0.00060460094,0.0034089044,0.000415831,0.000015400632],"category_scores_gemma":[0.000071237104,0.0006622025,0.00011509392,0.0009638125,0.00041141882,0.0010894625,0.0010098513,0.0013677116,0.000016129216],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005667782,0.000020568437,0.0000040769655,0.000019453742,0.000009838198,0.00009650708,0.00019540086,0.0056646937,0.0006012421,0.011868938,0.000050039915,0.98146355],"study_design_scores_gemma":[0.000714245,0.0014037499,0.000028698423,0.001132145,0.00002435747,0.00082432316,3.6222698e-7,0.21076539,0.13352765,0.6196762,0.029292788,0.0026101023],"about_ca_topic_score_codex":0.000021787499,"about_ca_topic_score_gemma":0.00007967033,"teacher_disagreement_score":0.97885346,"about_ca_system_score_codex":0.000508286,"about_ca_system_score_gemma":0.0004259797,"threshold_uncertainty_score":0.99958295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025858675,0.0003899756,0.99461615,0.0005747772,0.0016114665,0.0012153966,0.00000796239,0.00039072146,0.0009349776],"genre_scores_gemma":[0.26661938,0.00014362915,0.7306581,0.0013057615,0.0006605494,0.00008855237,0.000008465151,0.000082816,0.0004327443],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995919,0.0000376168,0.00066894444,0.0015616738,0.0010337338,0.0007790471],"domain_scores_gemma":[0.9978608,0.00038438867,0.00028491917,0.0012362445,0.00007510941,0.0001585355],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010675895,0.00054196385,0.0005694797,0.0008282206,0.00034347203,0.0021831985,0.0048871976,0.00022779185,0.000009917952],"category_scores_gemma":[0.000043819084,0.00048707644,0.00024025317,0.00039767096,0.0001937314,0.0015098028,0.0034705235,0.00065461645,0.000011381825],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008929742,0.00006345632,0.0002927778,0.0002869865,0.000040141473,0.00010328498,0.0027602024,0.010364664,0.00009831422,0.09151095,0.000039010396,0.8944313],"study_design_scores_gemma":[0.0007216159,0.0006347841,0.00026313777,0.005703177,0.000016270347,0.00013173296,0.0000011577747,0.18455674,0.009634103,0.78595924,0.010331383,0.002046671],"about_ca_topic_score_codex":0.000033787805,"about_ca_topic_score_gemma":0.000018212932,"teacher_disagreement_score":0.8923846,"about_ca_system_score_codex":0.00043514548,"about_ca_system_score_gemma":0.0005187655,"threshold_uncertainty_score":0.99975806},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035984564,0.0012370588,0.9912242,0.0037527115,0.00038289552,0.0005850038,0.0000023972077,0.000106212705,0.0023496642],"genre_scores_gemma":[0.26780504,0.00016117624,0.7284521,0.0022338417,0.00040184372,0.000032819622,0.000008474042,0.000025524734,0.0008791747],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970717,0.000059245518,0.0004198741,0.0012184813,0.0008288456,0.0004018582],"domain_scores_gemma":[0.9980689,0.0004189495,0.00022457616,0.00089055224,0.00027660484,0.00012041038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013109581,0.00040991136,0.0004138595,0.0004454841,0.00045719335,0.00070187484,0.0015284647,0.0001576508,0.00000926396],"category_scores_gemma":[0.000052674597,0.00026011225,0.0000877386,0.0006811032,0.0016027681,0.0005297945,0.000730838,0.00052554504,0.0000078361745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011593387,0.0000229669,0.000041063075,0.000029077419,0.000013911577,0.000011344467,0.00059640367,0.068188004,0.000028849325,0.25719038,0.000011665893,0.67385477],"study_design_scores_gemma":[0.0010239732,0.000172341,0.0012339595,0.00018752064,0.000014768638,0.00015447549,1.5113747e-7,0.42456463,0.00030422886,0.56866163,0.0031256163,0.00055671815],"about_ca_topic_score_codex":0.00001672308,"about_ca_topic_score_gemma":0.00019437441,"teacher_disagreement_score":0.673298,"about_ca_system_score_codex":0.000113999515,"about_ca_system_score_gemma":0.0004229298,"threshold_uncertainty_score":0.9999851},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049864277,0.0005424003,0.9572247,0.0004300421,0.0032730042,0.00033009212,0.0000025980296,0.00029983892,0.03784744],"genre_scores_gemma":[0.31344593,0.00013747571,0.67806095,0.0038212605,0.0014623703,0.000021195909,0.0000042376896,0.00011433969,0.002932266],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504775,0.000036500653,0.00075396546,0.002023793,0.0011293467,0.0010086662],"domain_scores_gemma":[0.99638027,0.00046074443,0.00036950145,0.0022194814,0.00032729277,0.00024268306],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010139603,0.0006702963,0.00060410483,0.0009838676,0.0004299809,0.00073724164,0.006557342,0.00042798242,0.00015872906],"category_scores_gemma":[0.0001274803,0.00063679664,0.00020096284,0.0005965326,0.0013735631,0.0010624214,0.0024664854,0.0011006661,0.00043729614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026918312,0.0000280505,0.00005101839,0.000019259793,0.000010059612,0.0001279453,0.003336358,0.003343114,0.00016413587,0.14457214,0.00006454169,0.84828067],"study_design_scores_gemma":[0.00005775458,0.00017636329,0.000042816453,0.0003015633,0.000008208712,0.00005274555,3.6056133e-7,0.1086245,0.011397881,0.8747952,0.003572668,0.0009699254],"about_ca_topic_score_codex":0.000078044075,"about_ca_topic_score_gemma":0.00025651656,"teacher_disagreement_score":0.8473108,"about_ca_system_score_codex":0.0003138848,"about_ca_system_score_gemma":0.00056487013,"threshold_uncertainty_score":0.99960834},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006279471,0.00038503186,0.99732685,0.00013377085,0.0007893601,0.00024290285,0.000013551991,0.00020323967,0.0002773468],"genre_scores_gemma":[0.155161,0.00001418923,0.8437882,0.00032515463,0.0004162925,0.0000041737258,0.000027907296,0.000024420679,0.00023867053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996441,0.000044302116,0.00062439713,0.0014336132,0.00097124104,0.00048544593],"domain_scores_gemma":[0.99705666,0.00022126462,0.0004644169,0.001948518,0.00016574837,0.00014340594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008419956,0.00041841433,0.00053506036,0.0015345762,0.00028975093,0.00081847317,0.003022259,0.0002376882,0.000067682675],"category_scores_gemma":[0.000057765494,0.0003716098,0.00018975894,0.0014319504,0.00024692112,0.0010778126,0.001413755,0.00047012907,0.00005423478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.198427e-7,0.000025370879,0.000025295787,0.00001683952,0.00004790314,0.00003404442,0.00088892796,0.097519636,0.0007895073,0.002089934,0.000004214467,0.8985576],"study_design_scores_gemma":[0.00012306173,0.000018057306,0.0006272096,0.00013163181,0.00006490544,0.000018132774,1.8822833e-7,0.99104565,0.0006129277,0.006785988,0.00014536224,0.00042686934],"about_ca_topic_score_codex":0.00012381173,"about_ca_topic_score_gemma":0.00006773393,"teacher_disagreement_score":0.8981307,"about_ca_system_score_codex":0.00032556805,"about_ca_system_score_gemma":0.00026443254,"threshold_uncertainty_score":0.9998736},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13559617,0.004160875,0.84767514,0.0011389581,0.0023042082,0.0021721988,0.00010228945,0.0001147453,0.0067353924],"genre_scores_gemma":[0.70664644,0.00053908856,0.27498177,0.002405673,0.0030629241,0.000060449413,0.0005227933,0.0002989155,0.011481966],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974723,0.000026182834,0.00042149308,0.0011220131,0.00040519677,0.00055284356],"domain_scores_gemma":[0.99876666,0.000042387044,0.00022674976,0.00074464665,0.000104553554,0.00011501042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005585314,0.0004067796,0.00037318995,0.00026256553,0.00009132285,0.00011736966,0.0009962982,0.0005999956,0.00006118401],"category_scores_gemma":[0.00010737466,0.00040315435,0.00009847181,0.00018026667,0.00054750394,0.00001003624,0.0005920704,0.0006990533,0.000029136852],"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.00002481369,0.000057353027,0.0002884355,0.00005113631,0.000025283065,0.000039529295,0.0001994486,0.0031633375,0.8874263,0.00002046843,0.00011974644,0.10858413],"study_design_scores_gemma":[0.0060849404,0.0033214032,0.001248374,0.0021237577,0.00014635055,0.0002751103,0.0000032498274,0.087870754,0.64371556,0.019724393,0.22729357,0.008192552],"about_ca_topic_score_codex":0.000033585984,"about_ca_topic_score_gemma":0.000119115524,"teacher_disagreement_score":0.5726934,"about_ca_system_score_codex":0.00008897196,"about_ca_system_score_gemma":0.00022072744,"threshold_uncertainty_score":0.99984205},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006888858,0.00046859193,0.9837347,0.0013217119,0.0015476298,0.0002756465,0.0000033549554,0.00030987745,0.012269557],"genre_scores_gemma":[0.33698025,0.0002281603,0.6566312,0.0026946764,0.0011302588,0.000016581325,0.000011597411,0.000072599214,0.0022347325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99443895,0.000046070065,0.00080084585,0.0022214116,0.0015099131,0.0009827927],"domain_scores_gemma":[0.99585974,0.00055328576,0.00039595677,0.002594646,0.00032412205,0.0002722358],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001041485,0.0006496979,0.00084001827,0.0024585593,0.00031228035,0.0009462935,0.006128519,0.00045513405,0.000121849],"category_scores_gemma":[0.00015220666,0.0006102791,0.0004318999,0.0036723553,0.0011475494,0.0007522463,0.0016947697,0.001053325,0.00020731748],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031515985,0.000034649274,0.00078327575,0.000009800551,0.000095914285,0.00023820547,0.00072923524,0.07286685,0.000032738066,0.05135441,0.000041669497,0.8738101],"study_design_scores_gemma":[0.00005021957,0.00012898387,0.00020508621,0.000104286024,0.000074490854,0.000046536275,2.3667965e-7,0.7005513,0.0013094784,0.2895618,0.0071035624,0.00086402847],"about_ca_topic_score_codex":0.000112475325,"about_ca_topic_score_gemma":0.0004441618,"teacher_disagreement_score":0.8729461,"about_ca_system_score_codex":0.00042941445,"about_ca_system_score_gemma":0.00044920182,"threshold_uncertainty_score":0.99963486},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029635497,0.00007058486,0.98593986,0.00023063285,0.0011973456,0.00031586437,0.00001610016,0.00032204,0.011877965],"genre_scores_gemma":[0.11607587,0.000012650568,0.88229984,0.0005812959,0.00069273834,0.000022262526,0.000041207153,0.000036514994,0.00023764043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663365,0.00002589257,0.00050225825,0.0015998151,0.0007520623,0.00048631444],"domain_scores_gemma":[0.997099,0.00030233638,0.0003520278,0.0017219129,0.00031616722,0.00020855168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010180043,0.00038944898,0.00035076885,0.0007586666,0.00028881952,0.00075539947,0.0034425964,0.00026386965,0.000006703925],"category_scores_gemma":[0.000028184937,0.00036702122,0.0000740417,0.00061181776,0.0003969442,0.0011889323,0.0007989529,0.000694294,0.000115607785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018025816,0.000025364743,0.0000058951127,0.000016511669,0.0000050556996,0.00001705162,0.0004430456,0.00047363443,0.00008013904,0.11621901,0.0000128114825,0.88269967],"study_design_scores_gemma":[0.0001170999,0.00011544175,0.00017288116,0.000302584,0.0000064383485,0.00008581938,0.0000022291279,0.98095334,0.0005000358,0.014616931,0.002642865,0.0004843566],"about_ca_topic_score_codex":0.00003576312,"about_ca_topic_score_gemma":0.00005078415,"teacher_disagreement_score":0.98047966,"about_ca_system_score_codex":0.000540101,"about_ca_system_score_gemma":0.00035652408,"threshold_uncertainty_score":0.99987817},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005431639,0.00066582265,0.99376416,0.0011475828,0.00047104544,0.0013345233,0.0000052400815,0.0001401825,0.0019282597],"genre_scores_gemma":[0.50801784,0.00008559868,0.48578456,0.0035449064,0.0012100328,0.00024616448,0.000018162951,0.00005498313,0.0010377717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678046,0.000024995808,0.00044310433,0.0014227564,0.0008480003,0.00048066973],"domain_scores_gemma":[0.99818367,0.0003217632,0.00020081477,0.00063278864,0.00043777816,0.00022315871],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009385102,0.00037520227,0.0003389767,0.0007660824,0.00037882145,0.00050787395,0.001317285,0.00017752041,0.000010220331],"category_scores_gemma":[0.00008485412,0.0003674316,0.000059994018,0.0011785942,0.00014022857,0.0002868906,0.00093422126,0.00039870283,0.000049062546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003052393,0.000045136378,0.00002386198,0.00006399638,0.000006807933,0.000010168661,0.00081937434,0.5201557,0.00036158052,0.05010036,0.000010530645,0.4283994],"study_design_scores_gemma":[0.0001882871,0.0000814037,0.00014667623,0.00015685869,0.0000061826245,0.000060807153,1.407408e-7,0.9574083,0.00034851025,0.034197636,0.0069224634,0.00048272943],"about_ca_topic_score_codex":0.000007587623,"about_ca_topic_score_gemma":0.000032625543,"teacher_disagreement_score":0.50797963,"about_ca_system_score_codex":0.00020408581,"about_ca_system_score_gemma":0.00034460452,"threshold_uncertainty_score":0.99987775},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034146247,0.0012237399,0.992538,0.00023328605,0.001194031,0.0003177642,0.00000443224,0.00028921987,0.003858076],"genre_scores_gemma":[0.31331065,0.00033602398,0.6839845,0.0012599928,0.0005289709,0.000015016585,0.0000074942955,0.000069818925,0.00048748113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582446,0.000028757715,0.00049393973,0.0017340143,0.001140798,0.0007780362],"domain_scores_gemma":[0.9973561,0.00029435765,0.0002894942,0.001619615,0.00022065327,0.00021977109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047800152,0.00063463947,0.00058192987,0.00067719026,0.0003343463,0.00040041664,0.00355299,0.00026350035,0.000015949478],"category_scores_gemma":[0.0000140363445,0.00050736143,0.00012413197,0.0005817339,0.00089198805,0.0007280919,0.0010001743,0.00085122214,0.000054399705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006430957,0.000036340265,0.000021749282,0.000026383554,0.000012821341,0.0002321219,0.0014326435,0.581077,0.000016790465,0.03361909,0.000045001867,0.38347366],"study_design_scores_gemma":[0.00025069024,0.00023329194,0.0000070546093,0.00038877066,0.000005552443,0.00020413997,1.4717718e-7,0.943732,0.0004331684,0.052350823,0.0016852205,0.00070912135],"about_ca_topic_score_codex":0.000032509583,"about_ca_topic_score_gemma":0.000009648926,"teacher_disagreement_score":0.38276455,"about_ca_system_score_codex":0.00023653166,"about_ca_system_score_gemma":0.00063150574,"threshold_uncertainty_score":0.9997378},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021904754,0.00014855455,0.99149334,0.0009285329,0.0003338993,0.0007430449,0.00010412032,0.00003545903,0.0040225936],"genre_scores_gemma":[0.7391197,0.00006609412,0.2566634,0.0018922535,0.00027429164,0.000022090022,0.000017205002,0.00003087258,0.0019140502],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933568,0.00013915623,0.0013382782,0.0018005348,0.0029261408,0.0004390842],"domain_scores_gemma":[0.9952023,0.0014970857,0.0006376804,0.0019334138,0.00056332676,0.00016621411],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.011668473,0.00038220276,0.00080298126,0.0006313561,0.0001690987,0.00054624345,0.0027730947,0.00022598461,0.00007919589],"category_scores_gemma":[0.0027711818,0.00029670377,0.00013703294,0.00059774844,0.002402944,0.0009971566,0.0025657506,0.0004629581,0.000022629885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019387446,0.00006458906,0.000074849835,0.000115785144,0.000008871124,0.000002688999,0.00073889585,0.29010558,0.000018897643,0.22879344,0.000028770015,0.48002824],"study_design_scores_gemma":[0.000111768684,0.000048771366,0.000096323936,0.00008814232,0.000010801332,0.0000021878625,6.3218056e-7,0.35785663,0.000018440525,0.6408778,0.00067722413,0.00021132018],"about_ca_topic_score_codex":0.00012310795,"about_ca_topic_score_gemma":0.0023310776,"teacher_disagreement_score":0.73692924,"about_ca_system_score_codex":0.00024141614,"about_ca_system_score_gemma":0.0004845001,"threshold_uncertainty_score":0.9999485},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012438119,0.00013321875,0.9947017,0.00044560715,0.0021478601,0.00042728154,0.00003902338,0.00023885391,0.0017420794],"genre_scores_gemma":[0.039126467,0.0000067085184,0.9583722,0.0018560512,0.00050175557,0.00001779438,0.00004442517,0.000023215902,0.000051398154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947619,0.00004462792,0.0005270281,0.0024701343,0.001369315,0.0008269971],"domain_scores_gemma":[0.9960431,0.00023731145,0.0002608055,0.0026784637,0.00029409988,0.0004862375],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010665822,0.00064478046,0.00054712076,0.0010168822,0.00045470093,0.0010013892,0.0073338496,0.0003666453,0.000026121861],"category_scores_gemma":[0.000077472876,0.0005479941,0.00010498935,0.000921888,0.0005674799,0.0012840163,0.0015207877,0.0011751949,0.000042590855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071010672,0.00011475039,0.00005596465,0.00004626502,0.000004870387,0.000058528447,0.00072867057,0.096966125,0.002002838,0.0068562496,0.000058688034,0.89309996],"study_design_scores_gemma":[0.00016994242,0.00021730746,0.00006358914,0.0002447431,0.0000049250934,0.000041083797,2.0698354e-7,0.97426826,0.0024635002,0.016599905,0.0050463015,0.0008802193],"about_ca_topic_score_codex":0.000064723834,"about_ca_topic_score_gemma":0.000048178026,"teacher_disagreement_score":0.8922197,"about_ca_system_score_codex":0.00012952111,"about_ca_system_score_gemma":0.00072237465,"threshold_uncertainty_score":0.99969715},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008105354,0.0006104828,0.99472165,0.0008869398,0.0007968043,0.00020389807,0.000010043756,0.00021331394,0.001746308],"genre_scores_gemma":[0.69165605,0.00027888353,0.29775053,0.0057371394,0.001246762,0.000020967735,0.000037427093,0.00008349468,0.0031887393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770325,0.000024367651,0.00033827493,0.0010261919,0.00049545604,0.00041245396],"domain_scores_gemma":[0.99852765,0.00030944665,0.0001533289,0.00074734,0.00013147337,0.00013074264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057121704,0.00035352216,0.0003128794,0.0005347198,0.00026936762,0.0005437997,0.0012815363,0.00014469701,0.000025329877],"category_scores_gemma":[0.000040995543,0.00030522607,0.00006032903,0.00032310767,0.00047569507,0.0007300508,0.0008444404,0.00041688894,0.000042613512],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018755877,0.000010739961,0.000048998943,0.0000121129915,0.000006084046,0.000017024006,0.00031211387,0.009475858,0.00014442368,0.017180322,0.000039462877,0.97275096],"study_design_scores_gemma":[0.00019049786,0.00007596346,0.00046499545,0.00007183725,0.000005077193,0.00007328688,1.0723694e-7,0.73439115,0.00029609722,0.26031947,0.0036921466,0.0004193794],"about_ca_topic_score_codex":0.000027140783,"about_ca_topic_score_gemma":0.0001895222,"teacher_disagreement_score":0.9723316,"about_ca_system_score_codex":0.00012804399,"about_ca_system_score_gemma":0.00018591463,"threshold_uncertainty_score":0.99994},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021969812,0.0006181624,0.9974116,0.000053876134,0.00071462843,0.00028122964,0.000013150067,0.000053916716,0.00063370116],"genre_scores_gemma":[0.8285896,0.000080702324,0.17069907,0.0002512327,0.00018039804,0.000007660769,0.000049220067,0.000066769186,0.000075299984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986987,0.000006988688,0.0004234237,0.00032117855,0.00030538376,0.0002443132],"domain_scores_gemma":[0.99914634,0.00023683472,0.00010549759,0.00031745658,0.00014512283,0.000048747755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032897043,0.00022009712,0.00043576802,0.00040796053,0.0000664471,0.000053262043,0.00028376785,0.0001669594,0.000007663449],"category_scores_gemma":[0.00008050913,0.0002157298,0.000074337106,0.00031634458,0.00018586537,0.00006520794,0.00004161505,0.00019748001,0.0000010501567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028978448,0.00000858247,0.00008541804,0.00017218672,0.000009633818,7.487744e-7,0.00018133187,0.95014787,0.00024680473,0.0010244306,0.000053189073,0.04806691],"study_design_scores_gemma":[0.00015845992,0.00007387921,0.000038114067,0.00025684788,0.000013420449,0.0000014749613,2.0942028e-7,0.97902507,0.009580812,0.00784593,0.0027607782,0.00024499974],"about_ca_topic_score_codex":0.000005610569,"about_ca_topic_score_gemma":0.000015798292,"teacher_disagreement_score":0.82837,"about_ca_system_score_codex":0.00013662994,"about_ca_system_score_gemma":0.00004622384,"threshold_uncertainty_score":0.87972057},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091526395,0.0007153268,0.9925618,0.00027317804,0.00035190137,0.00024638438,0.0000044017606,0.00010458744,0.004827156],"genre_scores_gemma":[0.36871564,0.00013049673,0.62827,0.0018162655,0.00040994745,0.000007859966,0.0000061661763,0.00004548211,0.00059817877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585223,0.00009146872,0.0005105008,0.0020307752,0.00080743415,0.00070758595],"domain_scores_gemma":[0.9973085,0.000819141,0.00020501862,0.0013687303,0.00010715779,0.00019147393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032608309,0.00046354943,0.0005974142,0.0014166237,0.0002055519,0.00070796715,0.0028675485,0.0002489336,0.0000038474655],"category_scores_gemma":[0.00052373915,0.00042674018,0.000084193685,0.0015925729,0.00038036885,0.000658561,0.0019306467,0.000862654,0.000011831401],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026998992,0.00003191778,0.00012923451,0.000050513274,0.000010947119,0.00010655076,0.001819425,0.013075635,0.00052983663,0.031806443,0.000009902429,0.9524026],"study_design_scores_gemma":[0.000439766,0.00013004523,0.00013750963,0.00064850197,0.0000150753585,0.00013817682,0.0000014957845,0.919184,0.00029831278,0.07667516,0.0013703218,0.000961593],"about_ca_topic_score_codex":0.000026235102,"about_ca_topic_score_gemma":0.000063443775,"teacher_disagreement_score":0.951441,"about_ca_system_score_codex":0.00022083313,"about_ca_system_score_gemma":0.00036907732,"threshold_uncertainty_score":0.99981844},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006494112,0.00014843445,0.99113256,0.0011052495,0.0013963205,0.00083132234,0.0000014701922,0.00021383268,0.0045214146],"genre_scores_gemma":[0.5733511,0.0000021879869,0.42538127,0.00070219423,0.00026235284,0.000041147498,0.000018137458,0.00003380684,0.00020783095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620605,0.00007530587,0.0004220218,0.0013674847,0.0012784629,0.0006506986],"domain_scores_gemma":[0.9972104,0.00077101454,0.00040928723,0.00069863634,0.00077013084,0.0001405203],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022224751,0.0004641591,0.00042497786,0.00063755974,0.0024428247,0.013705767,0.0016955015,0.00022775844,0.00005188813],"category_scores_gemma":[0.0006057699,0.00041065438,0.00011131722,0.00062260294,0.0014846199,0.001534401,0.0003046656,0.00090453133,0.00001951679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015549585,0.000019884013,0.00007836812,0.00004491477,0.000008103382,0.000005535393,0.0019268258,0.52748895,0.00007049635,0.021830918,0.0000056485082,0.44850484],"study_design_scores_gemma":[0.0011310326,0.000528183,0.00020184815,0.00078844314,0.000022245595,0.000026564181,0.000004812538,0.95069504,0.0009774123,0.03538987,0.009463319,0.00077120896],"about_ca_topic_score_codex":0.000029593039,"about_ca_topic_score_gemma":0.00011423888,"teacher_disagreement_score":0.57270163,"about_ca_system_score_codex":0.00080001424,"about_ca_system_score_gemma":0.012315392,"threshold_uncertainty_score":0.99983454},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000095511896,0.0012855177,0.9929367,0.0010908796,0.0009943177,0.00050138857,0.00001421492,0.00021972103,0.0028617913],"genre_scores_gemma":[0.01907181,0.00018420295,0.9755209,0.0039579934,0.00073320826,0.000036565354,0.000009871794,0.000056695797,0.0004287213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996462,0.000051835796,0.0004965765,0.0016689121,0.00067515887,0.0006455384],"domain_scores_gemma":[0.99743426,0.00049120607,0.00024613354,0.0013694742,0.00019960095,0.0002593405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006185952,0.00054734846,0.0004809837,0.00087758095,0.00059953105,0.00046618617,0.0020894797,0.0002650946,0.000016387414],"category_scores_gemma":[0.00004698296,0.0005074735,0.0001030106,0.00082887104,0.0013664291,0.0003562308,0.0011241958,0.00096689316,0.000019738682],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014149313,0.000023325234,0.000042476633,0.000052281226,0.000012063921,0.000042978143,0.00019964801,0.026616992,0.000022455,0.07894456,0.000042747382,0.89399904],"study_design_scores_gemma":[0.0002633985,0.00013710214,0.00006376112,0.0003282712,0.000014103622,0.0007091638,5.5779526e-7,0.6538493,0.00011053674,0.32212138,0.021537205,0.0008651958],"about_ca_topic_score_codex":0.000013248818,"about_ca_topic_score_gemma":0.000014587254,"teacher_disagreement_score":0.8931339,"about_ca_system_score_codex":0.00012119568,"about_ca_system_score_gemma":0.00044504856,"threshold_uncertainty_score":0.9997377},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068973366,0.00024050576,0.99185646,0.00066208484,0.0012085659,0.00046016308,0.000007907281,0.00006926026,0.0048053153],"genre_scores_gemma":[0.9628533,0.000013714065,0.036574896,0.00040296238,0.00011281683,0.000008881644,0.0000018567831,0.000022624223,0.000008938238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963453,0.00010327239,0.000739788,0.0010476877,0.001208849,0.0005551388],"domain_scores_gemma":[0.995448,0.0015473434,0.0006194931,0.0019439785,0.00032132707,0.00011985512],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017550876,0.00050296733,0.000639674,0.0007341244,0.00031832265,0.00021958005,0.00412321,0.00024020082,0.000009115792],"category_scores_gemma":[0.00010150531,0.00037638802,0.0003025028,0.0010447046,0.0017789732,0.00029680118,0.0006452671,0.00077923853,0.0000056185986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014334699,0.00025723665,0.00023442431,0.0005331121,0.000054223194,0.00008504559,0.0025667911,0.11384589,0.00078435167,0.714113,0.00004146147,0.16734111],"study_design_scores_gemma":[0.00037915996,0.00067592366,0.00006797392,0.0011224034,0.000011427765,0.000014093374,8.434022e-7,0.4369019,0.0023609465,0.5578544,0.00019628803,0.00041461672],"about_ca_topic_score_codex":0.000040165352,"about_ca_topic_score_gemma":0.00004455409,"teacher_disagreement_score":0.96216357,"about_ca_system_score_codex":0.00016014664,"about_ca_system_score_gemma":0.00081957714,"threshold_uncertainty_score":0.9998688},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005887938,0.004143467,0.99060833,0.0005458722,0.0011094954,0.0023782223,0.0000062974354,0.0005416002,0.0000778932],"genre_scores_gemma":[0.12013918,0.0002883353,0.8778127,0.00097551936,0.00013019692,0.0004609386,0.0000041062035,0.000061422434,0.0001276365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950557,0.00009750246,0.0007006759,0.0024373431,0.00076665153,0.00094217836],"domain_scores_gemma":[0.9939019,0.0030086301,0.000833474,0.0017102569,0.0003938093,0.00015189553],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025068151,0.0007579188,0.00078924675,0.00067608454,0.00049688766,0.0011609772,0.0036061546,0.00068409625,0.000010314655],"category_scores_gemma":[0.00064184854,0.00069259777,0.00014777,0.0008743174,0.0010880183,0.0012495414,0.0011209304,0.0009314226,0.000017558541],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010703023,0.00022318905,0.00016686931,0.00037964643,0.00009187845,0.000104058345,0.0046851295,0.09939368,0.00067990413,0.00945853,0.0003445599,0.8843655],"study_design_scores_gemma":[0.0010323824,0.002494864,0.00001837463,0.0011494845,0.00006579249,0.00019439291,0.00001353493,0.64352185,0.01064567,0.32291698,0.015586255,0.0023604017],"about_ca_topic_score_codex":0.000009348763,"about_ca_topic_score_gemma":0.0000138464275,"teacher_disagreement_score":0.8820051,"about_ca_system_score_codex":0.00032030878,"about_ca_system_score_gemma":0.0003543197,"threshold_uncertainty_score":0.9998759},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001411482,0.00023877315,0.987108,0.0004553887,0.0004562442,0.00036127932,0.00000758302,0.00047214946,0.010759425],"genre_scores_gemma":[0.11556588,0.00000716564,0.8813377,0.00233366,0.00019849825,0.000014777162,0.000018496532,0.000059746395,0.00046407612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578786,0.000055790406,0.0005475865,0.0015345073,0.0012568736,0.0008173846],"domain_scores_gemma":[0.99704796,0.0006359601,0.00027101507,0.0015534053,0.00020950445,0.00028214828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060514716,0.000675524,0.0006028063,0.00066775817,0.00036569408,0.0007116027,0.0029619979,0.0003365205,0.000097811244],"category_scores_gemma":[0.00005075674,0.00055712496,0.000095652846,0.00062246306,0.0006522195,0.00034007028,0.00037220574,0.00084278034,0.0000906565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000611806,0.00012537825,0.00016057407,0.00012145498,0.000045335255,0.0012680934,0.0016136963,0.49197975,0.00010385999,0.0070323534,0.00014132203,0.49734703],"study_design_scores_gemma":[0.00055692357,0.00049166806,0.000046612862,0.0011697577,0.000015491902,0.000085570384,1.11584896e-7,0.97201246,0.0021175197,0.021681555,0.0009024713,0.000919872],"about_ca_topic_score_codex":0.00003144292,"about_ca_topic_score_gemma":0.000012722322,"teacher_disagreement_score":0.49642715,"about_ca_system_score_codex":0.00023350613,"about_ca_system_score_gemma":0.0011405275,"threshold_uncertainty_score":0.999688},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012879643,0.00017511634,0.99123263,0.0024289272,0.0019010842,0.00070512213,0.0000060120947,0.00030175413,0.0019613933],"genre_scores_gemma":[0.34761956,0.00014386133,0.6223841,0.008980769,0.0047202744,0.000106974985,0.000040704148,0.00020017513,0.015803602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591875,0.000038009224,0.0005679851,0.0017324548,0.0009385404,0.0008042647],"domain_scores_gemma":[0.99750733,0.00038747548,0.0003015099,0.0014136931,0.00019735841,0.00019262292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007983489,0.0005530321,0.0005307321,0.0007954006,0.00037593886,0.00072849705,0.003294103,0.00032516106,0.000018771363],"category_scores_gemma":[0.000061861654,0.00050284574,0.0002221852,0.0006725306,0.0003708577,0.000109275745,0.0016911025,0.00067824917,0.0000485958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063467874,0.000046410878,0.000026798029,0.00006450782,0.000016795331,0.000034490848,0.00043317868,0.020494496,0.00009852418,0.013332497,0.000040984596,0.965405],"study_design_scores_gemma":[0.00039332517,0.00016239494,0.00016739593,0.0005468445,0.000010289504,0.000027900893,6.87485e-8,0.9558323,0.00009403478,0.028060654,0.014061915,0.00064287224],"about_ca_topic_score_codex":0.0000044126364,"about_ca_topic_score_gemma":0.000011057067,"teacher_disagreement_score":0.9647621,"about_ca_system_score_codex":0.0002486114,"about_ca_system_score_gemma":0.00019219007,"threshold_uncertainty_score":0.9997423},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012219471,0.00037363134,0.9817306,0.0025792378,0.0028785332,0.00036609883,0.000009534218,0.00016560833,0.011884562],"genre_scores_gemma":[0.026946051,0.00036363158,0.95413446,0.010094479,0.0035411317,0.000016732352,0.00021382947,0.00011666485,0.0045730025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99500364,0.000048174847,0.00051693665,0.0022174171,0.0013593913,0.0008544297],"domain_scores_gemma":[0.9946391,0.0005546388,0.00031757922,0.0042429627,0.00010903884,0.00013667204],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0018572344,0.00056209444,0.00043883006,0.00059911155,0.0004944188,0.0017252518,0.015698293,0.00018675161,0.000047969937],"category_scores_gemma":[0.00010374072,0.00040865835,0.0000923047,0.00093705027,0.00071295595,0.0018089454,0.010653995,0.0007283215,0.0000926932],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019220693,0.00001956947,0.0000151758095,0.000011503987,0.000016989212,0.00017941858,0.0003299919,0.0006846302,0.000011449896,0.007880098,0.00053943205,0.99030983],"study_design_scores_gemma":[0.000249795,0.00009338929,0.000065056105,0.00020937769,0.000018641587,0.000074916075,9.81123e-7,0.9131372,0.000074862146,0.026792461,0.058573123,0.0007102188],"about_ca_topic_score_codex":0.00002798814,"about_ca_topic_score_gemma":0.00006176911,"teacher_disagreement_score":0.9895996,"about_ca_system_score_codex":0.00013118002,"about_ca_system_score_gemma":0.00028572735,"threshold_uncertainty_score":0.9998365},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025040137,0.00004959494,0.97326654,0.00044901206,0.000703667,0.00031427105,0.0000013462538,0.00016615939,0.00000925471],"genre_scores_gemma":[0.3185434,0.000006758973,0.68044245,0.0008235417,0.00016615109,0.000005635268,0.00000414444,0.000006207981,0.0000017157796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746674,0.00017356807,0.00052122696,0.0008447951,0.00062252954,0.0003711502],"domain_scores_gemma":[0.99886495,0.00022774115,0.00019565514,0.0004485598,0.00016228722,0.00010082289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012653635,0.00018345033,0.00021487121,0.00035302708,0.00023138634,0.0005075946,0.00068192236,0.000100516234,0.000004521502],"category_scores_gemma":[0.00014029685,0.0001749849,0.000043542223,0.0013150667,0.00057399616,0.0012613784,0.0004193755,0.0002663213,0.0000038979406],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010749344,0.00010739738,0.004387849,0.000017169055,0.0000034748646,0.000016081336,0.00022289851,0.009745435,0.020561825,0.0001267786,0.00006590411,0.96473444],"study_design_scores_gemma":[0.0006654407,0.0001997832,0.0254966,0.0000655912,0.000007061487,0.000055862252,0.0000017809299,0.9272655,0.04027175,0.005711447,0.000004351415,0.00025481614],"about_ca_topic_score_codex":0.00013387036,"about_ca_topic_score_gemma":0.0000355935,"teacher_disagreement_score":0.9644796,"about_ca_system_score_codex":0.00012934855,"about_ca_system_score_gemma":0.00015399409,"threshold_uncertainty_score":0.71356773},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027581444,0.00008261674,0.98877776,0.0019673607,0.00047876494,0.0006087101,0.0000034846817,0.0002028014,0.007850941],"genre_scores_gemma":[0.08057329,0.000036047175,0.9148819,0.0033598386,0.00019386988,0.000033194876,0.0000072415414,0.000030436498,0.0008841854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971168,0.000022558663,0.0003911057,0.0012946364,0.0007553607,0.0004195586],"domain_scores_gemma":[0.9980111,0.00013065123,0.00020901232,0.0011493051,0.0002842554,0.00021566432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029231855,0.00038989136,0.00036056995,0.00074216904,0.00022688319,0.0003997531,0.0013876794,0.00018178388,0.00008343161],"category_scores_gemma":[0.00003000679,0.0003437438,0.00006708639,0.0007486638,0.00036279927,0.00037513376,0.00038836474,0.0003663855,0.00012296741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053445947,0.000015424313,0.000085743064,0.000012375169,0.0000075582543,0.000022379834,0.00041207613,0.09775104,0.000095782336,0.060168397,0.000034995934,0.8413889],"study_design_scores_gemma":[0.000506472,0.00021924509,0.00044406508,0.00021029297,0.000011764328,0.00016232043,1.3900035e-7,0.9571117,0.00057292485,0.03218069,0.007648987,0.0009313633],"about_ca_topic_score_codex":0.000020431313,"about_ca_topic_score_gemma":0.00012439793,"teacher_disagreement_score":0.8593607,"about_ca_system_score_codex":0.00024426688,"about_ca_system_score_gemma":0.000288035,"threshold_uncertainty_score":0.9999015},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040480812,0.00032229646,0.99618477,0.00010048421,0.0018826212,0.00077177177,0.000010021103,0.00018540933,0.0005021597],"genre_scores_gemma":[0.0019681514,0.000023922306,0.9953679,0.0020677492,0.00025479443,0.000044497792,0.0000065092618,0.000052175717,0.00021431722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958556,0.00005986137,0.0007295038,0.0017560375,0.00081434567,0.00078464707],"domain_scores_gemma":[0.997132,0.00023772322,0.0004795589,0.0015638991,0.00044083892,0.00014596987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023999028,0.0005800521,0.00055004965,0.00060954003,0.00047582915,0.00072924886,0.0031150447,0.00038261642,0.0000041126464],"category_scores_gemma":[0.00038799376,0.0005637618,0.00017156394,0.00039671818,0.00044805548,0.000857391,0.0006822063,0.0006151476,0.0000081917215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045797315,0.000025879695,0.0000073769384,0.000073238545,0.0000111036825,0.00000598909,0.0009016282,0.49607363,0.000917239,0.22730386,0.000020390069,0.2746551],"study_design_scores_gemma":[0.00028851684,0.000076767086,0.00000367511,0.00019513063,0.000007421521,0.000027400527,1.3784481e-7,0.9354431,0.0037735766,0.059082825,0.0005071433,0.0005943206],"about_ca_topic_score_codex":0.000008047495,"about_ca_topic_score_gemma":0.00002530256,"teacher_disagreement_score":0.43936947,"about_ca_system_score_codex":0.00045193228,"about_ca_system_score_gemma":0.00047735567,"threshold_uncertainty_score":0.9996814},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003229813,0.00023726682,0.9963998,0.00019368231,0.0014541993,0.00062839093,0.00001138601,0.00070169463,0.00034126028],"genre_scores_gemma":[0.14433256,0.00009418915,0.8540565,0.0009144102,0.00037006562,0.000067246525,0.000043452455,0.00009680294,0.000024779356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805343,0.000009924286,0.0003992791,0.00064704724,0.00034249236,0.00054782507],"domain_scores_gemma":[0.9984253,0.0005856836,0.00011115436,0.0005886757,0.00021591752,0.00007329347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026407497,0.00043250527,0.00037839983,0.00038769346,0.00014963206,0.00011553274,0.0005840315,0.00058204663,0.0000058536575],"category_scores_gemma":[0.0002072685,0.00043125477,0.000087451896,0.00038300248,0.00025367222,0.00018296158,0.000077470715,0.00067005755,0.000004854772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043194377,0.000004691015,0.0000013548029,0.00002921515,0.000005630371,0.000007028054,0.00001797466,0.83962727,0.000045665038,0.038141597,0.000026165235,0.12208908],"study_design_scores_gemma":[0.00017377437,0.000077437755,0.0000026810721,0.00015514609,0.000008249165,0.0000025738946,9.4191186e-8,0.7452865,0.0004437033,0.2530714,0.0004199143,0.00035848664],"about_ca_topic_score_codex":8.086307e-7,"about_ca_topic_score_gemma":0.0000243261,"teacher_disagreement_score":0.2149298,"about_ca_system_score_codex":0.00037926703,"about_ca_system_score_gemma":0.000082991224,"threshold_uncertainty_score":0.9998139},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021415774,0.0002284741,0.9847003,0.00041520683,0.0022190278,0.00049620494,0.0000038233425,0.00031464733,0.011408118],"genre_scores_gemma":[0.009403779,0.00007311949,0.989088,0.00063574954,0.00026919736,0.00001846512,0.0000072664075,0.00003834569,0.00046608754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951782,0.00009984905,0.00079864456,0.0018399832,0.001193987,0.0008892932],"domain_scores_gemma":[0.99667364,0.00032586118,0.000370009,0.0022458613,0.00019638153,0.00018823313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019765412,0.00059451675,0.0006142444,0.0014602443,0.00016926262,0.0004788139,0.0052278256,0.00049353717,0.000044963588],"category_scores_gemma":[0.0001706757,0.0005707547,0.00011615259,0.0014549752,0.0006410733,0.0011154789,0.0015922472,0.0011260044,0.00013953155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010209857,0.000057328165,0.000058477344,0.000029450699,0.0000060571674,0.0002167563,0.00073208177,0.016180431,0.000103937564,0.047475185,0.000031384432,0.9350987],"study_design_scores_gemma":[0.00034977074,0.00014241479,0.00038225154,0.00029966317,0.0000036543768,0.00012118344,1.0893699e-7,0.9350987,0.0011036419,0.058140453,0.0036927196,0.00066540873],"about_ca_topic_score_codex":0.00003096274,"about_ca_topic_score_gemma":0.00003375824,"teacher_disagreement_score":0.9344333,"about_ca_system_score_codex":0.00057644385,"about_ca_system_score_gemma":0.00057320774,"threshold_uncertainty_score":0.9996744},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010675003,0.0012485187,0.9899429,0.00057121686,0.0009049555,0.0007545453,0.000024910067,0.000021763104,0.0054636933],"genre_scores_gemma":[0.36368752,0.00027070407,0.60338753,0.008520094,0.0056953817,0.00009572315,0.00025512982,0.00026231713,0.017825618],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99805063,0.000008967264,0.00025259284,0.0009257744,0.0003068451,0.0004551811],"domain_scores_gemma":[0.9989194,0.000051047566,0.00011692721,0.0006521301,0.00016429948,0.00009616227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033823473,0.00034153622,0.0002454895,0.00019885239,0.00009181783,0.00008918777,0.0007407688,0.00034640898,0.000041281244],"category_scores_gemma":[0.00006113248,0.00031880333,0.00012952105,0.00007531381,0.00029618922,0.0000070133337,0.00043157616,0.00020194081,0.000026854703],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010294017,0.00010586172,0.0003089196,0.00011521049,0.0001041222,0.000017120148,0.0003491269,0.016559416,0.046678953,0.00058849546,0.0018242316,0.9332456],"study_design_scores_gemma":[0.0033154706,0.0025637483,0.0009494656,0.00048495122,0.000068645684,0.00018329905,5.263336e-7,0.027152045,0.059036974,0.027728684,0.87505937,0.0034568184],"about_ca_topic_score_codex":0.000001286926,"about_ca_topic_score_gemma":0.00003939764,"teacher_disagreement_score":0.92978877,"about_ca_system_score_codex":0.00007542602,"about_ca_system_score_gemma":0.00019251269,"threshold_uncertainty_score":0.9999264},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007908153,0.00042290668,0.99325347,0.0012486601,0.0023054625,0.0016084076,0.00003273246,0.00014694224,0.00019058622],"genre_scores_gemma":[0.31887752,0.000032476815,0.6792614,0.0013633444,0.000262174,0.00014023592,0.0000066990847,0.00003554333,0.00002062462],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99559367,0.000060112325,0.00068979344,0.0019712148,0.00077927223,0.000905923],"domain_scores_gemma":[0.9968544,0.0008359407,0.00033172104,0.0013528897,0.00044367483,0.00018134352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008581693,0.00065452175,0.00077623,0.00090093084,0.0002462064,0.0006781906,0.003651104,0.00062187924,0.000038774528],"category_scores_gemma":[0.00026202638,0.0006385995,0.00013268697,0.0012964199,0.0007893719,0.0010819645,0.00088879094,0.0008861756,0.000028766513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007213319,0.00020745122,0.001257977,0.00029094692,0.000039684808,0.00014977503,0.007876564,0.014767358,0.00007254873,0.46116835,0.000010013186,0.5140872],"study_design_scores_gemma":[0.0007279386,0.00036777733,0.00047281638,0.0014066126,0.000007400562,0.00002273798,7.6335783e-7,0.06772926,0.0018969369,0.92613524,0.0003716506,0.0008608767],"about_ca_topic_score_codex":0.00013716027,"about_ca_topic_score_gemma":0.00045186846,"teacher_disagreement_score":0.51322633,"about_ca_system_score_codex":0.0011306342,"about_ca_system_score_gemma":0.0016932449,"threshold_uncertainty_score":0.99960655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000098913015,0.00024876976,0.9892107,0.0022711284,0.0012733699,0.00060142035,0.000009814511,0.00033634796,0.0060385326],"genre_scores_gemma":[0.07806682,0.000040494644,0.9144721,0.0058311457,0.00054411363,0.00002213192,0.000021652637,0.00006382328,0.0009377329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946288,0.000073646566,0.0006905333,0.0018701492,0.0017010815,0.0010357915],"domain_scores_gemma":[0.99658597,0.0006738345,0.00032394798,0.0017061837,0.00034350812,0.00036655966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010453428,0.0006645853,0.0006596304,0.0012951302,0.00039629373,0.00082962395,0.0039608134,0.00039904326,0.000097925804],"category_scores_gemma":[0.00010194534,0.0006084444,0.00017106302,0.00078316807,0.0006522019,0.00045985822,0.00089097384,0.0012710115,0.0003087443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037468324,0.00007686049,0.000026433025,0.000013087765,0.0000052578034,0.00003800772,0.00027791457,0.5019386,0.000008913331,0.004247311,0.00010327555,0.4932606],"study_design_scores_gemma":[0.0005424886,0.00029941747,0.000063693355,0.00026958785,0.0000039153824,0.000013367469,7.555534e-8,0.9861614,0.00053269626,0.006117547,0.005305945,0.00068985973],"about_ca_topic_score_codex":0.000026419195,"about_ca_topic_score_gemma":0.000089724155,"teacher_disagreement_score":0.49257073,"about_ca_system_score_codex":0.00047150228,"about_ca_system_score_gemma":0.00092938123,"threshold_uncertainty_score":0.9996367},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008792159,0.00031042658,0.9926854,0.0009691495,0.0019173091,0.0016359482,0.000045212113,0.00018435868,0.002164315],"genre_scores_gemma":[0.8565175,0.000034775614,0.13876192,0.0028776615,0.00062087283,0.00010486818,0.00002674162,0.00009295572,0.00096272095],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99479514,0.000064289685,0.0007023059,0.0023760092,0.0011342292,0.0009280496],"domain_scores_gemma":[0.99635106,0.0010798568,0.00055768964,0.0014646306,0.0002867119,0.00026007215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080280134,0.0007987845,0.000912674,0.0009152479,0.00042113502,0.000664398,0.0025509459,0.00040205396,0.000021537897],"category_scores_gemma":[0.00014190671,0.0008185075,0.00034181954,0.00039526835,0.0006801688,0.001065248,0.0012513913,0.00071907346,0.00012081271],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024102343,0.00006105531,0.000014737663,0.00010718264,0.00006782445,0.00021426307,0.0039213514,0.0044511533,0.00036875118,0.017710362,0.000020198442,0.97303903],"study_design_scores_gemma":[0.0042410484,0.0010800341,0.00022098412,0.0049912487,0.000092032045,0.00069078815,0.000025274325,0.36771905,0.017958578,0.5921626,0.006520615,0.004297716],"about_ca_topic_score_codex":0.000051087827,"about_ca_topic_score_gemma":0.0001776158,"teacher_disagreement_score":0.9687413,"about_ca_system_score_codex":0.0011190637,"about_ca_system_score_gemma":0.0006794264,"threshold_uncertainty_score":0.9994266},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016959224,0.00065062364,0.99498755,0.00027762417,0.0012368985,0.0005606784,0.000010420651,0.00032113315,0.0017854617],"genre_scores_gemma":[0.58247805,0.00015244992,0.41509703,0.0009167492,0.0006094908,0.00003352175,0.000044485932,0.00010266167,0.00056556845],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945244,0.00006768453,0.00063177384,0.0018699224,0.0016825956,0.0012236106],"domain_scores_gemma":[0.9954567,0.0010378095,0.0003196331,0.0020466906,0.00079308177,0.0003460652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019635775,0.00062286423,0.0005413989,0.0019961551,0.0004932313,0.0006485634,0.0051857764,0.00038589074,0.000014662097],"category_scores_gemma":[0.00028435374,0.00060205563,0.0001437197,0.0033061954,0.0014692991,0.0010736001,0.0019985444,0.0014167613,0.00007095388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002548349,0.0000605891,0.0003200924,0.00008392972,0.000022552902,0.00025950174,0.00048554924,0.08687076,0.0001410968,0.25201744,0.000010210348,0.6597028],"study_design_scores_gemma":[0.00041668428,0.000289096,0.0007786251,0.0005740187,0.000009269911,0.00010278443,4.5768658e-7,0.20539409,0.0017097312,0.7878494,0.0017927794,0.0010830582],"about_ca_topic_score_codex":0.000023381017,"about_ca_topic_score_gemma":0.00014985002,"teacher_disagreement_score":0.65861976,"about_ca_system_score_codex":0.00046637858,"about_ca_system_score_gemma":0.00059105776,"threshold_uncertainty_score":0.9996431},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028338216,0.000849749,0.9956442,0.0012629024,0.0007981346,0.00027242606,0.000014433723,0.00012351846,0.0010062897],"genre_scores_gemma":[0.0069738356,0.0003400977,0.9871093,0.0027988628,0.0016166482,0.000012107448,0.000054851524,0.000032407468,0.0010618798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668616,0.000028331486,0.00030767397,0.0018696337,0.00057862146,0.00052958075],"domain_scores_gemma":[0.99647474,0.0003275039,0.00015700802,0.0027906597,0.00008270197,0.00016735753],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00044337165,0.00035120733,0.0003360279,0.00030007635,0.0002801741,0.0008034036,0.0065513942,0.00019303874,0.000007448768],"category_scores_gemma":[0.000032542153,0.0002968016,0.000032364565,0.00096758874,0.0005725406,0.00070843706,0.0044908742,0.0006298954,0.000009128433],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.14654e-7,0.00000935032,0.000025761407,0.000010476801,0.0000034854731,0.000032438686,0.00007272005,0.003765514,0.000012871981,0.0039958763,0.001213375,0.9908576],"study_design_scores_gemma":[0.0001049403,0.00003689048,0.00022681634,0.00006689259,0.0000044511485,0.00013944632,3.0272044e-8,0.76826096,0.000045431367,0.21217342,0.018573677,0.00036702555],"about_ca_topic_score_codex":0.000021681955,"about_ca_topic_score_gemma":0.000053231084,"teacher_disagreement_score":0.9904906,"about_ca_system_score_codex":0.00009350035,"about_ca_system_score_gemma":0.0004728241,"threshold_uncertainty_score":0.9999484},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003182195,0.000058969687,0.9979586,0.00006276483,0.001005563,0.0004180717,0.000005499087,0.00013084275,0.00004144433],"genre_scores_gemma":[0.010805337,0.000021826438,0.98868513,0.00023511573,0.00016593699,0.000009230088,0.0000056271883,0.000051202147,0.000020584475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672973,0.000014751486,0.0005449598,0.0013640444,0.00069035724,0.0006561743],"domain_scores_gemma":[0.9985816,0.00012234999,0.00020937595,0.00079546403,0.000117392716,0.00017381445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046364908,0.00049270474,0.0004018642,0.0007155733,0.00017783885,0.0002770487,0.0013443122,0.00031727672,0.000014295027],"category_scores_gemma":[0.00008005714,0.0005467464,0.000077687255,0.0007122105,0.0002567959,0.0013106251,0.0010357231,0.00096775376,0.000007678738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014964489,0.000037243542,0.000005873403,0.0000062051577,0.0000034990526,0.000024352727,0.00038307568,0.9520991,0.0008568261,0.00025696767,2.2586287e-8,0.04632534],"study_design_scores_gemma":[0.0005179043,0.000032614673,0.00000468733,0.00013919115,0.000004460619,0.000061292165,4.405119e-7,0.99526733,0.0019189547,0.0014707342,0.000012093887,0.0005702658],"about_ca_topic_score_codex":0.000038676782,"about_ca_topic_score_gemma":0.00003229975,"teacher_disagreement_score":0.045755073,"about_ca_system_score_codex":0.0007459387,"about_ca_system_score_gemma":0.00023151317,"threshold_uncertainty_score":0.9996984},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045133595,0.0016381918,0.9900319,0.0003639448,0.0039566294,0.00075639266,0.0000021211806,0.00051050883,0.00228895],"genre_scores_gemma":[0.4644807,0.00054905185,0.52779144,0.0049986136,0.0018532601,0.000019827541,0.000015975149,0.0001670188,0.00012411636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927213,0.00009156924,0.0011466789,0.0025997795,0.0016733953,0.0017672401],"domain_scores_gemma":[0.99537444,0.0009981851,0.0004653128,0.0024709466,0.00031175377,0.0003793334],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018427268,0.0009903449,0.0010258146,0.00168508,0.00024395656,0.0010036019,0.005907306,0.0009635982,0.00003929535],"category_scores_gemma":[0.000080438585,0.0010138698,0.00020363633,0.0018790344,0.00056335615,0.000694846,0.0024872764,0.0021675387,0.000057891226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016766682,0.00012628632,0.00018168087,0.00003801544,0.000026878732,0.001348565,0.0020718293,0.64106137,0.0000173079,0.009411088,0.000039916376,0.34566027],"study_design_scores_gemma":[0.000643797,0.00016897783,0.00009071173,0.00044620823,0.000009951095,0.00029227897,2.16006e-7,0.9672308,0.000445325,0.027576305,0.0018887882,0.0012066404],"about_ca_topic_score_codex":0.00006542954,"about_ca_topic_score_gemma":0.00059656805,"teacher_disagreement_score":0.46402937,"about_ca_system_score_codex":0.001207251,"about_ca_system_score_gemma":0.0004824554,"threshold_uncertainty_score":0.9994712},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023418586,0.000032961107,0.9928459,0.000525713,0.0011632114,0.0003689903,0.0000030496944,0.00037965216,0.0046570897],"genre_scores_gemma":[0.5930501,0.000013222683,0.39946103,0.0060880315,0.0009262436,0.000040731065,0.000009310808,0.00004464717,0.0003666827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681586,0.00003798262,0.00040814522,0.001227505,0.0011023182,0.00040817377],"domain_scores_gemma":[0.9981607,0.00028399247,0.00024796068,0.0008932495,0.00031065967,0.0001034311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006224275,0.0003625648,0.000264056,0.0012644388,0.0003188879,0.00044319202,0.0012230936,0.00028802612,0.000042475556],"category_scores_gemma":[0.00007603193,0.00038271956,0.00012434207,0.00065343356,0.00024632222,0.00073703256,0.0002047806,0.0006735691,0.0000878697],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008012546,0.000023891405,0.0000017684098,0.000009735609,0.000002394006,0.000018880419,0.00010104694,0.03922089,0.00024523746,0.00064069306,0.000008601808,0.9597188],"study_design_scores_gemma":[0.00034171672,0.0003954987,0.0003713816,0.00015809081,0.000005693161,0.000041943542,8.382508e-8,0.79470694,0.15044565,0.051535722,0.0014000116,0.0005972741],"about_ca_topic_score_codex":0.00002209406,"about_ca_topic_score_gemma":0.00008480317,"teacher_disagreement_score":0.9591216,"about_ca_system_score_codex":0.00058159523,"about_ca_system_score_gemma":0.00039392218,"threshold_uncertainty_score":0.9998625},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002843636,0.0012075688,0.983387,0.00020286161,0.0043503535,0.0007214209,0.000004077562,0.00039437064,0.009703896],"genre_scores_gemma":[0.35990155,0.00022119995,0.6335964,0.0011045873,0.0021714047,0.000094399984,0.00001290928,0.00008570866,0.002811807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611616,0.000037516842,0.0005184766,0.001726075,0.00073372485,0.0008680386],"domain_scores_gemma":[0.99715537,0.00055152504,0.0003736482,0.0012893457,0.0004257884,0.00020430009],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007520974,0.00058911525,0.0007053509,0.0006961003,0.00055662706,0.00049238093,0.0031251602,0.0004517295,0.000006371286],"category_scores_gemma":[0.00013604372,0.0004976749,0.00025192506,0.0005793138,0.00047289568,0.0006139921,0.00078459614,0.0005749111,0.00008850091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002263966,0.00007432133,0.00005281467,0.00045426728,0.000036998284,0.00020878647,0.0015963205,0.012436112,0.00021518853,0.1737766,0.0005004214,0.81062555],"study_design_scores_gemma":[0.00083878107,0.00058457267,0.00010683192,0.00084718753,0.000030015177,0.0008777328,8.0357194e-7,0.8868011,0.0020000902,0.0893359,0.017103203,0.0014737663],"about_ca_topic_score_codex":0.000022553908,"about_ca_topic_score_gemma":0.0000867869,"teacher_disagreement_score":0.874365,"about_ca_system_score_codex":0.00071116496,"about_ca_system_score_gemma":0.00074552314,"threshold_uncertainty_score":0.9997475},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017447437,0.00072409515,0.9948457,0.00029936485,0.0008491271,0.0004965488,0.00003968103,0.00019359333,0.0008071804],"genre_scores_gemma":[0.16395634,0.00012305046,0.8341558,0.0012174092,0.00039198098,0.000023047964,0.000021677926,0.000057181853,0.000053498938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654204,0.000011743361,0.0006173389,0.0013238841,0.00083199947,0.00067296927],"domain_scores_gemma":[0.99736506,0.00041160034,0.0003668977,0.0013213707,0.00036775076,0.00016732619],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000291163,0.0005930099,0.0006876841,0.0009750767,0.00018545688,0.000168715,0.004395354,0.00032172256,0.000003507137],"category_scores_gemma":[0.000008686384,0.00053839554,0.00022653693,0.00049503305,0.00022247131,0.0005469135,0.0012033923,0.0004648304,0.00000873353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014407974,0.000040404826,0.000040612787,0.00062078156,0.000038036997,0.00002316615,0.003822416,0.87484735,0.0028211453,0.018382048,0.000009991442,0.09933962],"study_design_scores_gemma":[0.00030519438,0.00012597078,0.00003146234,0.0005736497,0.000011832338,0.000036362657,2.5403762e-7,0.97570586,0.0024312364,0.01837621,0.0018636255,0.00053831324],"about_ca_topic_score_codex":0.000029641407,"about_ca_topic_score_gemma":0.00015080498,"teacher_disagreement_score":0.1622116,"about_ca_system_score_codex":0.0000946578,"about_ca_system_score_gemma":0.0004550277,"threshold_uncertainty_score":0.99970675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20497747,0.000045212015,0.79236233,0.002394374,0.000016912918,0.00014961431,6.704449e-7,0.000018042729,0.00003537945],"genre_scores_gemma":[0.5445151,0.0000040638765,0.45511425,0.00034173855,0.00001894936,0.000002567757,3.7661684e-7,0.0000016389394,0.0000013655508],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994682,0.000006598191,0.00011784627,0.00017220511,0.00013475651,0.00010039399],"domain_scores_gemma":[0.99955285,0.000096916345,0.00004914566,0.00023325306,0.00004456658,0.00002329441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014766824,0.000050269336,0.00007479941,0.000036993508,0.000086490945,0.000017144777,0.000103464125,0.000022992821,0.0000020326615],"category_scores_gemma":[0.00009226928,0.000034258654,0.000014830023,0.0003625342,0.00031465775,0.00009125235,0.000045087327,0.00010517016,3.3805108e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006033811,0.00006649499,0.008332454,0.00002650055,0.0000010191832,6.683478e-7,0.00060639746,0.016676182,0.6487243,0.00033370344,0.000019155159,0.3252071],"study_design_scores_gemma":[0.00029422998,0.00012206126,0.0761186,0.00019358261,0.000008999481,0.0002027978,0.0000026976059,0.658707,0.25649008,0.007273962,0.00045493373,0.00013105872],"about_ca_topic_score_codex":0.000011644727,"about_ca_topic_score_gemma":0.000035606456,"teacher_disagreement_score":0.64203084,"about_ca_system_score_codex":0.000038510665,"about_ca_system_score_gemma":0.000043921547,"threshold_uncertainty_score":0.13970274},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000765038,0.00044920508,0.9846573,0.0012937249,0.00045141098,0.0002936118,0.0000012672763,0.00017429017,0.012602683],"genre_scores_gemma":[0.22959985,0.00010293213,0.7646182,0.003654982,0.0005562872,0.000023156948,0.00001101281,0.000045126362,0.001388416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697447,0.000018837629,0.00046572552,0.0013306205,0.0006347975,0.00057556044],"domain_scores_gemma":[0.99797094,0.00019805781,0.0001715494,0.0014537958,0.000080287944,0.00012538915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058966136,0.00037484948,0.0003913446,0.0008325684,0.00016669036,0.00049654813,0.0033706469,0.00024057139,0.000014653004],"category_scores_gemma":[0.000031291125,0.0003686083,0.00009704881,0.0008910692,0.00030881542,0.00048652283,0.0008279383,0.00069614756,0.00009648386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.7681094e-7,0.000024391264,0.000021357497,0.000010012874,0.0000016585236,0.00006574658,0.00041361563,0.0068027377,0.0002633963,0.045760676,0.000012527383,0.9466232],"study_design_scores_gemma":[0.00029138837,0.00007907636,0.0008704914,0.00043758604,0.0000037606649,0.0000828562,1.2223175e-7,0.6070163,0.0013612167,0.37549746,0.01350807,0.0008516605],"about_ca_topic_score_codex":0.000030367375,"about_ca_topic_score_gemma":0.00015039292,"teacher_disagreement_score":0.9457715,"about_ca_system_score_codex":0.00027130928,"about_ca_system_score_gemma":0.0003982376,"threshold_uncertainty_score":0.99987656},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052894815,0.0010011647,0.9940898,0.00059895776,0.0020083708,0.0009963979,0.000009089599,0.00023321532,0.0010101376],"genre_scores_gemma":[0.059077077,0.000045610454,0.9391074,0.0007418692,0.0007324264,0.000029820885,0.000013335433,0.000040774725,0.00021164464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959615,0.000025870891,0.0006742667,0.0017059216,0.000866557,0.00076586986],"domain_scores_gemma":[0.9971401,0.00072642893,0.00039812873,0.0011490409,0.0003983961,0.00018790126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009308786,0.000596336,0.0006196342,0.0011895864,0.0003640053,0.00076613884,0.0028203588,0.00039603555,0.000004896282],"category_scores_gemma":[0.00008611354,0.0005410504,0.00029913156,0.0008198961,0.00041543375,0.00064357277,0.00045904273,0.00056559005,0.000019656294],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074422132,0.00006436104,0.000018126844,0.000105253326,0.00002155184,0.000011392387,0.00040666317,0.02608799,0.0003550323,0.08760837,0.000020497331,0.8852933],"study_design_scores_gemma":[0.0005891148,0.00038723866,0.00014371765,0.00059956126,0.000018167586,0.00009013489,1.6947924e-7,0.7252823,0.0015148696,0.26312795,0.0073836176,0.000863134],"about_ca_topic_score_codex":0.000012585535,"about_ca_topic_score_gemma":0.000032701675,"teacher_disagreement_score":0.88443017,"about_ca_system_score_codex":0.00018095794,"about_ca_system_score_gemma":0.0004393587,"threshold_uncertainty_score":0.9997041},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005101046,0.0008179348,0.9894618,0.00025791055,0.0011131465,0.00019072116,0.000010650592,0.000045186975,0.003001619],"genre_scores_gemma":[0.53281957,0.00012050312,0.46493253,0.00093785924,0.0006626831,0.0000062757913,0.00001961583,0.00002302103,0.00047791775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983512,0.00001920218,0.00028350417,0.00076404447,0.00032428507,0.0002577224],"domain_scores_gemma":[0.99907386,0.00038369882,0.000115685616,0.00025598417,0.00008242422,0.00008833361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004176601,0.0002150695,0.00022435574,0.00068077614,0.00016496876,0.00025653033,0.00037961148,0.00016595692,0.000017011205],"category_scores_gemma":[0.000050163937,0.00021823468,0.000026217453,0.00044467137,0.00031292994,0.0003322298,0.0003488936,0.00041131175,0.000008929715],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032691983,0.000010697619,0.0010245708,0.000011108611,0.000006403312,0.000022788136,0.00061153487,0.0018258312,0.00009803988,0.018859187,0.000010437613,0.9775161],"study_design_scores_gemma":[0.00047533392,0.000093995535,0.005430571,0.0003298689,0.000009210786,0.00031187313,0.0000022009438,0.8612271,0.0006027685,0.12769143,0.0030547865,0.00077086734],"about_ca_topic_score_codex":0.00003973054,"about_ca_topic_score_gemma":0.00012484932,"teacher_disagreement_score":0.97674525,"about_ca_system_score_codex":0.00008488375,"about_ca_system_score_gemma":0.00031871905,"threshold_uncertainty_score":0.8899352},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040842555,0.000083414896,0.9919602,0.000043420212,0.0011912964,0.00032947786,0.0000027571825,0.00032448175,0.0019806903],"genre_scores_gemma":[0.2893928,0.00003462139,0.7098964,0.00018250915,0.00029903685,0.000008438375,0.0000066708703,0.000079722515,0.000099808465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846035,0.000015734751,0.00026471203,0.0005489272,0.0003662334,0.00034405102],"domain_scores_gemma":[0.99898446,0.00032434368,0.0000702346,0.00043414428,0.00007412325,0.00011272726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037588688,0.0003169809,0.00030458794,0.00032903088,0.000111199384,0.0002593943,0.00043963065,0.00036856902,0.000015053807],"category_scores_gemma":[0.0001445827,0.00031929425,0.000038670096,0.00029016408,0.00034603267,0.000119778626,0.00020804281,0.0012094473,0.0000069836033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044440803,0.000010321877,0.00017021233,0.000065758504,0.0000088955485,0.000018336848,0.000346102,0.41324246,0.00047554358,0.0012489293,0.000002244232,0.58440673],"study_design_scores_gemma":[0.00022917484,0.00010489473,0.0005189821,0.00036744858,0.000008443055,0.00002159221,6.002765e-8,0.98006356,0.0012405616,0.015864763,0.0010548243,0.0005257189],"about_ca_topic_score_codex":0.000009279306,"about_ca_topic_score_gemma":0.00004044128,"teacher_disagreement_score":0.583881,"about_ca_system_score_codex":0.00014621453,"about_ca_system_score_gemma":0.00007831353,"threshold_uncertainty_score":0.9999259},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003684463,0.0008938118,0.9912412,0.00114506,0.002637217,0.0011869536,0.0000012415406,0.0002770645,0.0026137484],"genre_scores_gemma":[0.028597418,0.00003228472,0.96649235,0.002301621,0.00081852166,0.000048929833,0.0000063839316,0.000038438993,0.0016640687],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99558586,0.00012407612,0.0006422058,0.001953272,0.0006386029,0.0010559758],"domain_scores_gemma":[0.9968949,0.0008225751,0.00040138324,0.0013622078,0.00032515716,0.00019376258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027874934,0.00058994046,0.0008493198,0.00064664887,0.0003408001,0.00049789145,0.0034208568,0.0005565509,0.0000046769924],"category_scores_gemma":[0.0002793826,0.00040331282,0.00024667956,0.0004673549,0.0006588393,0.00042013844,0.0007050618,0.00066847465,0.000024043791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009869728,0.000021937209,0.00001165484,0.000040678486,0.0000106100015,0.00003857201,0.00039246632,0.0010073541,0.00007388438,0.1367986,0.000033963668,0.8615604],"study_design_scores_gemma":[0.00035160038,0.00069741864,0.000022745082,0.000052907475,0.0000141278515,0.00018294028,1.5681834e-7,0.10221728,0.0004990065,0.8653925,0.029900964,0.0006683754],"about_ca_topic_score_codex":0.00004695806,"about_ca_topic_score_gemma":0.00008568318,"teacher_disagreement_score":0.86089206,"about_ca_system_score_codex":0.0002391499,"about_ca_system_score_gemma":0.0005698052,"threshold_uncertainty_score":0.99984187},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006792774,0.00031731153,0.9958217,0.00023568056,0.0013679368,0.00043675466,0.0000023275002,0.0005228229,0.0012275086],"genre_scores_gemma":[0.025761066,0.000029481811,0.9736846,0.00009828887,0.00019095968,0.000019466768,0.0000047074836,0.00003741196,0.00017399089],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996496,0.000036890633,0.0006112748,0.0012822835,0.0009207867,0.00065273466],"domain_scores_gemma":[0.9966784,0.00096609216,0.00040052066,0.0013352513,0.0004951822,0.00012454134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089156517,0.0004898289,0.0005995346,0.00097274565,0.00017674996,0.00017607078,0.0028163514,0.00025958096,0.000013782374],"category_scores_gemma":[0.0008327474,0.0004714238,0.00012784934,0.0014449677,0.0007985052,0.00078639906,0.0008661118,0.00073330896,0.0000110487435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032367873,0.00002995059,0.00003793726,0.00008488732,0.000013778622,0.000044630993,0.0009636452,0.19682129,0.00009581406,0.050892375,0.0000020551706,0.7510104],"study_design_scores_gemma":[0.0003320388,0.00033320393,0.000116038675,0.0007290894,0.000015827567,0.000138523,9.339713e-7,0.111916676,0.0036578353,0.8794283,0.0022609949,0.0010704824],"about_ca_topic_score_codex":0.000005531654,"about_ca_topic_score_gemma":0.000018491137,"teacher_disagreement_score":0.828536,"about_ca_system_score_codex":0.00025130887,"about_ca_system_score_gemma":0.0005279085,"threshold_uncertainty_score":0.99977374},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046349818,0.0006594723,0.99525374,0.0005457399,0.00041073395,0.00039562437,0.000001930447,0.00007864585,0.0026077458],"genre_scores_gemma":[0.47746405,0.00034771554,0.52025783,0.0006918431,0.00044546058,0.000032135773,0.0000026779585,0.000028619454,0.00072967156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972352,0.000030345964,0.00044409314,0.0013218571,0.0004423305,0.0005261997],"domain_scores_gemma":[0.99830794,0.00051625335,0.00018424146,0.0007238355,0.00013993356,0.00012780742],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006455762,0.00034856045,0.00036374564,0.00050614314,0.00031707567,0.0003147717,0.0016091388,0.0002516155,0.000009905431],"category_scores_gemma":[0.00005726497,0.00034851846,0.000053447715,0.0010809447,0.00056946033,0.0004638754,0.0011515825,0.0008903239,0.000009959008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019789468,0.00005071499,0.00046542144,0.000011925265,0.000005275396,0.000046301913,0.001560351,0.10879175,0.0000044313883,0.112575985,0.000008726298,0.77647716],"study_design_scores_gemma":[0.00007403099,0.000053878008,0.0012244273,0.00015321525,0.000001871249,0.00004354146,2.1075526e-7,0.8249727,0.00002245522,0.17298311,0.00015291366,0.00031766185],"about_ca_topic_score_codex":0.000038647107,"about_ca_topic_score_gemma":0.00008491703,"teacher_disagreement_score":0.77615947,"about_ca_system_score_codex":0.000562573,"about_ca_system_score_gemma":0.0004197554,"threshold_uncertainty_score":0.9998967},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103404514,0.00008881779,0.8935091,0.0003575877,0.0012865701,0.00035836478,0.000015309854,0.00011394391,0.0008658147],"genre_scores_gemma":[0.9811654,0.000020150394,0.01777607,0.00079596683,0.00017372199,0.0000011658577,0.000002084736,0.000018624785,0.000046782632],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981318,0.000034387427,0.00028429646,0.00088360143,0.00040792962,0.00025794638],"domain_scores_gemma":[0.99922526,0.000115961266,0.00017409299,0.00032805928,0.000061064646,0.00009555081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027469243,0.00023484456,0.00030288147,0.0003938875,0.00016208373,0.00010505367,0.00052457507,0.00022564335,0.000096214964],"category_scores_gemma":[0.00007162695,0.00020404087,0.00004098537,0.00023300716,0.0009745109,0.00024333103,0.00023072236,0.00035093943,0.000015746311],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024693416,0.000038698072,6.043952e-7,0.000053173266,5.767875e-7,0.000013906727,0.00064497255,0.0036253454,0.64783376,0.017492916,4.987997e-7,0.33027083],"study_design_scores_gemma":[0.0002090336,0.0006197203,0.00007917436,0.00021363325,0.000005054662,0.000049411763,4.156017e-7,0.06714439,0.280324,0.65091443,0.00009005557,0.00035063736],"about_ca_topic_score_codex":0.000009489113,"about_ca_topic_score_gemma":0.000015562246,"teacher_disagreement_score":0.8777609,"about_ca_system_score_codex":0.000054098142,"about_ca_system_score_gemma":0.00017136228,"threshold_uncertainty_score":0.83205456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009163881,0.00009306266,0.9904234,0.00046870555,0.0005323002,0.00021631832,0.000096388256,0.00011527762,0.007962904],"genre_scores_gemma":[0.063792616,0.0000064550177,0.93501973,0.00077419815,0.00017445053,0.0000063062466,0.00003712389,0.000020285019,0.00016885858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971172,0.000018274819,0.0005972734,0.0009714884,0.00081242115,0.0004833384],"domain_scores_gemma":[0.9971083,0.0007854849,0.00047243232,0.0012035444,0.00029411528,0.00013617174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011996379,0.0003238481,0.00043129013,0.0007728236,0.00021126089,0.0002480341,0.0026053584,0.00025307864,0.000022910834],"category_scores_gemma":[0.00011318941,0.00032256258,0.00011932627,0.0007951435,0.00077201833,0.00029809927,0.0005636916,0.00046177948,0.000017293316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.860183e-7,0.000049931103,0.0001147346,0.000018006138,0.000013102815,0.000025447871,0.0003476104,0.0034606284,0.00040243607,0.040362388,0.00009413108,0.9551106],"study_design_scores_gemma":[0.00029656015,0.00010300241,0.00021589811,0.00026364866,0.000012050416,0.000015266936,4.541773e-7,0.9794309,0.0014354329,0.015306576,0.0024023305,0.00051785656],"about_ca_topic_score_codex":0.000018215682,"about_ca_topic_score_gemma":0.000068188194,"teacher_disagreement_score":0.97597027,"about_ca_system_score_codex":0.00018333443,"about_ca_system_score_gemma":0.0010230141,"threshold_uncertainty_score":0.99992263},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005806268,0.0016761615,0.99612707,0.0002137134,0.0006067732,0.00054732215,0.000020148871,0.00036199903,0.0004410329],"genre_scores_gemma":[0.0199685,0.000014401736,0.9791886,0.00042695348,0.00028803284,0.0000065402082,0.000007408673,0.000035530324,0.00006400499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683887,0.0000230172,0.0004787801,0.0013266339,0.0007590207,0.0005736601],"domain_scores_gemma":[0.9979625,0.0006351221,0.00021621551,0.0007859668,0.00027967198,0.000120574674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006383706,0.00043500177,0.0004368009,0.0006582146,0.00023850377,0.0005106692,0.002137736,0.00036518968,0.000009462439],"category_scores_gemma":[0.00009076085,0.000395657,0.00010370199,0.0003869259,0.00042147381,0.0008620012,0.0003753979,0.0005995305,0.0000031210368],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057273214,0.000017535205,7.2379083e-7,0.00007002952,0.000005260164,0.000035727044,0.00058260816,0.03153589,0.0003292289,0.12770048,0.000008210304,0.83970857],"study_design_scores_gemma":[0.00009099648,0.0000570748,1.6731269e-7,0.00013952708,0.000005377538,0.00003082824,2.2072102e-8,0.5498098,0.0012464158,0.44826663,0.0000824463,0.00027069962],"about_ca_topic_score_codex":0.000014289418,"about_ca_topic_score_gemma":0.000016162712,"teacher_disagreement_score":0.8394379,"about_ca_system_score_codex":0.00027158044,"about_ca_system_score_gemma":0.00045819755,"threshold_uncertainty_score":0.99984956},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047852233,0.0003333294,0.9453556,0.00011159568,0.00016855492,0.00047865484,0.0000028056036,0.00008762363,0.0056095826],"genre_scores_gemma":[0.678714,0.0000066684042,0.32101312,0.000076796496,0.000080345315,0.0000064279625,0.0000014341558,0.000024294239,0.000076909004],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960248,0.000036084264,0.0006813379,0.0015753306,0.0010562363,0.00062621565],"domain_scores_gemma":[0.99714077,0.00064638216,0.00053004635,0.0009514525,0.0004974799,0.00023385127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012699782,0.0005597179,0.00078629446,0.00034986387,0.00024980132,0.00072467915,0.0010118405,0.00027952605,0.000010925383],"category_scores_gemma":[0.00007442217,0.0004197101,0.000043036915,0.00066492375,0.0017423948,0.0010171924,0.0006270818,0.00069549994,0.0000039146385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020819523,0.00047531456,0.45976147,0.0018461202,0.00015022651,0.00031863284,0.0077766683,0.08101157,0.00048839976,0.05281416,0.000008497744,0.39514074],"study_design_scores_gemma":[0.002260969,0.003259222,0.03597511,0.0062713437,0.00009350612,0.001739992,0.000017424753,0.8784878,0.004683965,0.06361322,0.00033370548,0.0032637333],"about_ca_topic_score_codex":0.000086341555,"about_ca_topic_score_gemma":0.00022759468,"teacher_disagreement_score":0.79747623,"about_ca_system_score_codex":0.00012237077,"about_ca_system_score_gemma":0.0005851888,"threshold_uncertainty_score":0.9998255},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005314639,0.0001091435,0.99310887,0.00023433506,0.0006667381,0.00013523131,0.000003125193,0.000027457101,0.00040043434],"genre_scores_gemma":[0.8665236,0.00007626596,0.12963393,0.0020865095,0.0013950393,0.000007877659,0.000073916824,0.000029198227,0.00017360682],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99845123,0.00001005416,0.00024407143,0.00040399432,0.0006230039,0.00026764435],"domain_scores_gemma":[0.99923515,0.00003611392,0.0001500985,0.00034550502,0.00012039201,0.00011271286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000523913,0.00020310457,0.00016909152,0.00015233351,0.000115852316,0.0000770955,0.0004728451,0.00062669575,0.000023059403],"category_scores_gemma":[0.00030874854,0.00015104773,0.000039931943,0.00009831502,0.00068343146,0.000010664349,0.0002876525,0.0006061588,0.0000066666466],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004483085,0.0000065265294,0.000029847286,0.000021053007,0.0000072548846,0.0000061638734,0.000051662515,0.000086001644,0.012623936,0.000021969776,0.00000418294,0.98709655],"study_design_scores_gemma":[0.0026300866,0.005395408,0.00075073796,0.000692233,0.000059330625,0.00062998966,0.000003436282,0.06748233,0.77901566,0.005364351,0.13580851,0.002167941],"about_ca_topic_score_codex":0.00001426548,"about_ca_topic_score_gemma":0.00021605719,"teacher_disagreement_score":0.9849286,"about_ca_system_score_codex":0.000041451407,"about_ca_system_score_gemma":0.0004002375,"threshold_uncertainty_score":0.61595476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041752393,0.00024107784,0.99589586,0.00021702041,0.0015581318,0.00048938196,0.00004892776,0.00014324381,0.0009888135],"genre_scores_gemma":[0.8055456,0.000042641903,0.19273582,0.0002922072,0.0011993018,0.000018960978,0.000032363347,0.00008430454,0.000048773065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756795,0.000007049387,0.00041341534,0.00071764895,0.0007487123,0.0005452209],"domain_scores_gemma":[0.9986025,0.00057194114,0.000105616054,0.0003686019,0.00016769565,0.00018360806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004949855,0.0004183041,0.0003703504,0.00034470545,0.0001449955,0.00020877548,0.0006588827,0.00023508543,0.00013087054],"category_scores_gemma":[0.00026238908,0.00036267133,0.00011057575,0.00017541113,0.00032450346,0.00018436152,0.00010020167,0.00069068803,0.0000069892803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001084408,0.000013427074,0.000011496717,0.00011787585,0.000022543032,0.000031890955,0.00050080044,0.6659277,0.0040292237,0.00095969456,0.000033069737,0.3283414],"study_design_scores_gemma":[0.000417269,0.00008287265,0.000049040038,0.0011665752,0.000022660823,0.000061172585,3.8633814e-7,0.9485918,0.0047674184,0.044050075,0.00021865498,0.0005720358],"about_ca_topic_score_codex":0.00004280888,"about_ca_topic_score_gemma":0.000079023324,"teacher_disagreement_score":0.8051281,"about_ca_system_score_codex":0.0005688956,"about_ca_system_score_gemma":0.0006234486,"threshold_uncertainty_score":0.9998825},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029637123,0.00066223886,0.9941702,0.0003463293,0.0012937584,0.0013749213,0.00005406889,0.00031117196,0.0014909459],"genre_scores_gemma":[0.1226747,0.000101820006,0.87573904,0.0008289535,0.00034831767,0.00007193486,0.000029218272,0.00006085187,0.00014517248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951508,0.000044788456,0.0006741735,0.0019814821,0.0012369531,0.0009117897],"domain_scores_gemma":[0.9956356,0.0014593167,0.00049838074,0.0014749067,0.00067570375,0.0002560359],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004969947,0.00076144916,0.0008183363,0.0022758394,0.0005737472,0.0006686659,0.003199748,0.00036133602,0.00001411782],"category_scores_gemma":[0.00017824904,0.0006416711,0.00024339088,0.0023780323,0.0013569808,0.00073095795,0.0006746109,0.0007263251,0.000011914374],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005552657,0.00012436451,0.00007344378,0.000118428936,0.00007191397,0.00011890013,0.0014652482,0.002390144,0.00013250789,0.06434068,0.000107759115,0.93100107],"study_design_scores_gemma":[0.0017866233,0.0012000381,0.00025067865,0.00073019584,0.000030571857,0.00046345816,8.912104e-7,0.87574136,0.0023221823,0.111816525,0.0037105414,0.0019469179],"about_ca_topic_score_codex":0.000020168369,"about_ca_topic_score_gemma":0.00007510115,"teacher_disagreement_score":0.92905414,"about_ca_system_score_codex":0.00038921493,"about_ca_system_score_gemma":0.0008215436,"threshold_uncertainty_score":0.99960345},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018077409,0.00045900675,0.9945056,0.0000289339,0.000258751,0.00018213011,0.000004770021,0.00041709433,0.003962929],"genre_scores_gemma":[0.7037161,0.00012426272,0.2955952,0.00023323229,0.00020041277,0.0000062478625,0.000006781625,0.00005751457,0.000060264065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818134,0.00000580203,0.0003032395,0.00059933134,0.00054349774,0.00036677663],"domain_scores_gemma":[0.99924225,0.0000900243,0.00006843376,0.00043673106,0.00006666632,0.0000959024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016151214,0.00037901243,0.00038805546,0.00045270124,0.000076388744,0.000061982406,0.00069607684,0.00019967493,0.000070153634],"category_scores_gemma":[0.000017824985,0.00034955554,0.000101675796,0.0003503142,0.00037726155,0.00021988201,0.00030230143,0.00062586984,0.00004168556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043224804,0.000011661269,0.000014325003,0.00002185381,0.000016968299,0.000049696187,0.0000886531,0.3624332,0.0010842117,0.0035575023,0.000010524651,0.63270706],"study_design_scores_gemma":[0.0002260294,0.00023404694,0.00007132099,0.0007397824,0.00002437251,0.000020417017,1.6812137e-7,0.6034989,0.035485666,0.35806283,0.00055843935,0.001078015],"about_ca_topic_score_codex":0.000015973426,"about_ca_topic_score_gemma":0.000026738897,"teacher_disagreement_score":0.7035353,"about_ca_system_score_codex":0.0007161869,"about_ca_system_score_gemma":0.00006003985,"threshold_uncertainty_score":0.99989563},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019378612,0.0003451331,0.9936277,0.00015692912,0.00084941305,0.00039035713,0.0000017427395,0.00011924151,0.004315681],"genre_scores_gemma":[0.003344196,0.00001974372,0.9952514,0.00089918094,0.00033226752,0.0000015779476,8.3036e-7,0.00003452957,0.00011627388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960079,0.00011386687,0.00075878843,0.0011807282,0.0011431874,0.00079548894],"domain_scores_gemma":[0.99592555,0.0015049666,0.0005589829,0.0014585998,0.00042410582,0.00012782056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00426773,0.0005039026,0.0005852146,0.00087399944,0.0004470688,0.00057740946,0.003994076,0.0002717616,0.0000131002225],"category_scores_gemma":[0.00015245902,0.00038345,0.00020042133,0.00094927446,0.00096444297,0.0008364677,0.0018239506,0.0009561484,0.000010765148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022788498,0.00008315996,0.000073037794,0.0002559458,0.0000613761,0.0004200673,0.008750416,0.015835878,0.048075013,0.021979263,0.000051143976,0.9043919],"study_design_scores_gemma":[0.0003671712,0.00010906248,0.000041336138,0.0006990251,0.000028133836,0.00018513622,6.9095813e-7,0.8942295,0.011065553,0.09146476,0.0011306846,0.0006789795],"about_ca_topic_score_codex":0.000115833325,"about_ca_topic_score_gemma":0.00007665074,"teacher_disagreement_score":0.9037129,"about_ca_system_score_codex":0.00029013687,"about_ca_system_score_gemma":0.00071340275,"threshold_uncertainty_score":0.9998617},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001746762,0.00037344257,0.9853903,0.00040458606,0.000877973,0.0007868533,0.0000133330095,0.00020893691,0.011927111],"genre_scores_gemma":[0.06080859,0.00012525536,0.93528444,0.0014800883,0.0006434228,0.00008658383,0.000011759202,0.00009643739,0.0014634043],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954202,0.000040670056,0.00048325848,0.0018264956,0.0011911148,0.001038224],"domain_scores_gemma":[0.99684316,0.0008161578,0.00019427438,0.0016909657,0.00023476002,0.00022070129],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010006306,0.0005599332,0.0005260134,0.0009750895,0.00036896468,0.0009631975,0.0051614754,0.00032505757,0.0000481337],"category_scores_gemma":[0.00004934802,0.0005156602,0.00018558653,0.00061209826,0.0010155991,0.0012426057,0.0009260702,0.0007995112,0.000067308734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016858707,0.000021753678,0.0000042270876,0.000028480175,0.000011313027,0.000039245355,0.00027980687,0.024332076,0.00012610912,0.31867868,0.000027019345,0.6564344],"study_design_scores_gemma":[0.00028262314,0.00023571376,0.000010421613,0.00015158346,0.0000034024245,0.000023156521,2.163624e-7,0.14550382,0.000608154,0.8474615,0.005213719,0.00050565373],"about_ca_topic_score_codex":0.0000047474787,"about_ca_topic_score_gemma":0.00001863537,"teacher_disagreement_score":0.6559288,"about_ca_system_score_codex":0.00027537002,"about_ca_system_score_gemma":0.00095188717,"threshold_uncertainty_score":0.9997295},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33675534,0.00001814794,0.66222906,0.00017434145,0.00037965327,0.00024248869,0.000001046763,0.00019705632,0.000002879204],"genre_scores_gemma":[0.474248,0.0000039647766,0.5251358,0.0005675216,0.000031042604,0.0000081256685,7.739979e-7,0.000004632731,1.5035724e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979453,0.00007081693,0.0003056387,0.00068262307,0.0005862401,0.0004093489],"domain_scores_gemma":[0.99866533,0.00038026285,0.0001344818,0.0005099094,0.00014913444,0.00016087267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007695829,0.00019111462,0.00017149175,0.000511049,0.00024350976,0.00070340314,0.00092432956,0.000065882596,0.000012049106],"category_scores_gemma":[0.0002642089,0.00016800522,0.00003156751,0.0016416059,0.000728011,0.0014870929,0.00031164385,0.00034446004,0.0000027675023],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"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.969565e-7,0.000025988804,0.004149947,0.000017052458,0.0000020849811,0.0000067615465,0.0015116815,0.00047134922,0.48125675,0.000034763496,0.000004553162,0.51251817],"study_design_scores_gemma":[0.00024607743,0.00006140803,0.0060348166,0.000037020265,0.0000028665647,0.00008113608,0.0000021330216,0.58997196,0.3967559,0.0066077663,0.0000013879646,0.00019750913],"about_ca_topic_score_codex":0.00006008948,"about_ca_topic_score_gemma":0.000029985962,"teacher_disagreement_score":0.5895006,"about_ca_system_score_codex":0.000045596717,"about_ca_system_score_gemma":0.00014618687,"threshold_uncertainty_score":0.68510544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021098927,0.000435903,0.99443823,0.00052881014,0.00070172694,0.00050399656,0.000037412803,0.00014261037,0.0030003095],"genre_scores_gemma":[0.10955749,0.00006211273,0.88858855,0.0012043451,0.00030931502,0.000026217564,0.0000111996105,0.00004081626,0.00019993745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671096,0.000029452996,0.0004560968,0.0014947949,0.0007227339,0.0005859929],"domain_scores_gemma":[0.99759126,0.00045525987,0.00036184423,0.0010833233,0.00029931404,0.00020897973],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006367709,0.0005646435,0.0006361459,0.00036586798,0.0004278164,0.0003504929,0.0009277168,0.00024429918,0.00002115916],"category_scores_gemma":[0.000084816216,0.00044872618,0.000050725743,0.00025040156,0.0040408364,0.0009929823,0.001009745,0.0009735007,0.000008171938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022843513,0.000020654976,0.00015400407,0.000084619256,0.00002841803,0.00043912345,0.0016908939,0.0003934854,0.00079397013,0.59016925,0.0000053152353,0.4061974],"study_design_scores_gemma":[0.009578356,0.0067783096,0.0017210095,0.01582443,0.0001774586,0.012807476,0.00009955616,0.1306341,0.049010966,0.5724235,0.18573458,0.015210215],"about_ca_topic_score_codex":0.00004768205,"about_ca_topic_score_gemma":0.00035110847,"teacher_disagreement_score":0.3909872,"about_ca_system_score_codex":0.00014949193,"about_ca_system_score_gemma":0.0005183937,"threshold_uncertainty_score":0.99979645},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018845014,0.00011674518,0.9786021,0.00026932085,0.00021791026,0.0009941806,0.00006047896,0.000021317044,0.0008729034],"genre_scores_gemma":[0.9768039,0.000036945956,0.022794198,0.000092003604,0.00011383888,0.000015172692,0.000009262046,0.000021559354,0.00011310057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825937,0.00001146747,0.0005290546,0.00037120143,0.0006080004,0.00022089473],"domain_scores_gemma":[0.9980333,0.00097270467,0.00029015192,0.00045312662,0.000200841,0.000049876773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019007787,0.00024897672,0.0005823072,0.0002631161,0.000068192436,0.00003299362,0.00030215754,0.00013019053,0.000019224359],"category_scores_gemma":[0.000028566345,0.00015933682,0.00011753246,0.00014818009,0.0005131285,0.0000945617,0.00009388148,0.00021837736,5.3097256e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002123765,0.00020567644,0.00006246808,0.0002086111,0.00009915262,0.0000363101,0.0038079307,0.73052114,0.00028516827,0.016666355,0.0000067058936,0.24788812],"study_design_scores_gemma":[0.003287283,0.0027740486,0.00061611726,0.0005687809,0.00021426193,0.00015433096,0.000055530327,0.91628593,0.0006183493,0.07497833,0.000091646936,0.0003554127],"about_ca_topic_score_codex":0.000039362065,"about_ca_topic_score_gemma":0.00022109525,"teacher_disagreement_score":0.9579589,"about_ca_system_score_codex":0.000044594166,"about_ca_system_score_gemma":0.00042935982,"threshold_uncertainty_score":0.6497567},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019973428,0.0020699813,0.98704326,0.00024295147,0.0005495492,0.00033957118,0.000017894432,0.000012338138,0.0077270824],"genre_scores_gemma":[0.55908024,0.0011462315,0.4258855,0.0015093724,0.0028809942,0.000012935677,0.00012589312,0.00012311661,0.009235673],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985939,0.000007825498,0.00025666342,0.0005724731,0.000314304,0.00025480802],"domain_scores_gemma":[0.99907917,0.000019107045,0.0001533788,0.00057321973,0.000115969706,0.00005917712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028629784,0.00021922651,0.00024340507,0.00018166499,0.00003447206,0.000020972891,0.00062071125,0.00023196396,0.00004355416],"category_scores_gemma":[0.00003215234,0.00020807088,0.00009330676,0.00008905826,0.00035518763,0.0000041845524,0.0003689103,0.00015975127,0.000009897123],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021509963,0.00004008461,0.00020456174,0.00007936824,0.000052109608,0.00001532932,0.0001355867,0.00901339,0.09238313,0.00044532106,0.00016971167,0.8974399],"study_design_scores_gemma":[0.00259132,0.002540547,0.0012232213,0.0010896851,0.00012955039,0.00017810267,9.913385e-7,0.019802216,0.6360103,0.044745084,0.28816962,0.0035194021],"about_ca_topic_score_codex":0.0000047812473,"about_ca_topic_score_gemma":0.000032292923,"teacher_disagreement_score":0.8939205,"about_ca_system_score_codex":0.000038739334,"about_ca_system_score_gemma":0.00017063796,"threshold_uncertainty_score":0.8484884},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088670396,0.00020382789,0.996126,0.00012626292,0.0014776738,0.00042673264,0.000021929229,0.000015135433,0.0007157363],"genre_scores_gemma":[0.21501,0.00010300341,0.77434987,0.0025712764,0.005059874,0.00008855515,0.00012257771,0.00014907081,0.002545764],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983783,0.000009399879,0.00022293313,0.0007891447,0.00024166539,0.00035859086],"domain_scores_gemma":[0.99899423,0.0000673376,0.00013157117,0.00058784126,0.0001372525,0.000081745995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042029424,0.00029819657,0.00023643607,0.000114490744,0.00015032898,0.00010623256,0.0007754002,0.00047805705,0.000022779135],"category_scores_gemma":[0.000065323555,0.00026622662,0.00012625325,0.000035091885,0.00021499208,0.0000058854735,0.00029940854,0.00027700487,0.0000186214],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015031522,0.000011008704,0.000020984113,0.000042872885,0.000012641228,0.000006788017,0.00004705291,0.00066941854,0.27132666,0.00026139658,0.000013838977,0.7275723],"study_design_scores_gemma":[0.0006559428,0.00093047536,0.000057805002,0.0004064205,0.000027506254,0.00008315973,2.2218761e-7,0.0114941895,0.6836827,0.23990434,0.061237425,0.0015198594],"about_ca_topic_score_codex":0.000012383019,"about_ca_topic_score_gemma":0.00013070756,"teacher_disagreement_score":0.72605246,"about_ca_system_score_codex":0.000019947742,"about_ca_system_score_gemma":0.00014602055,"threshold_uncertainty_score":0.999979},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059359914,0.011543236,0.9600833,0.00024671157,0.0026835091,0.0003631897,0.0000029633961,0.00013287674,0.024884861],"genre_scores_gemma":[0.5344628,0.0066510923,0.44892025,0.0053256606,0.0033325108,0.000029018194,0.000035290042,0.00017226863,0.001071092],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629587,0.000034377907,0.00055129116,0.0013121944,0.0009837735,0.00082249346],"domain_scores_gemma":[0.99807036,0.00052046933,0.00023744833,0.0009062357,0.00008266806,0.00018284122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014877374,0.00043377889,0.00049812166,0.0013800426,0.00012905586,0.00035427095,0.002268807,0.00030186897,0.000022741448],"category_scores_gemma":[0.000123517,0.00039797678,0.00008553055,0.0010399494,0.00036704243,0.00081395294,0.0006927133,0.0006918767,0.0000540101],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012271433,0.000019588935,0.00019364974,0.00003654048,0.000003411584,0.00042224335,0.00143339,0.0033332147,0.000029674075,0.029004605,0.000008707621,0.9655027],"study_design_scores_gemma":[0.0027254953,0.0007439769,0.00064675993,0.0048122946,0.000016641336,0.0004804571,0.000022421958,0.25337285,0.0032255258,0.6904697,0.03934965,0.0041342555],"about_ca_topic_score_codex":0.000033218974,"about_ca_topic_score_gemma":0.0013076563,"teacher_disagreement_score":0.96136844,"about_ca_system_score_codex":0.00095296354,"about_ca_system_score_gemma":0.00040271602,"threshold_uncertainty_score":0.99984723},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010217367,0.0008286962,0.99304277,0.00043529103,0.002061621,0.0011323515,0.000033902612,0.00081969047,0.0015434785],"genre_scores_gemma":[0.08089034,0.00011197851,0.9158549,0.0012489319,0.0014086618,0.00003136372,0.0000685242,0.00007335954,0.000311971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932122,0.00020925577,0.0010241007,0.0028183055,0.0013799706,0.0013561625],"domain_scores_gemma":[0.99549276,0.0010004981,0.0005448217,0.0023546377,0.00022204047,0.0003852548],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010059574,0.00105003,0.0010221511,0.0005890903,0.0005072352,0.0018519254,0.0060866675,0.0012212816,0.00007628175],"category_scores_gemma":[0.00006162183,0.001007409,0.0002937316,0.0007221726,0.0004294696,0.00059215905,0.0011202933,0.0023673603,0.00016881606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008948485,0.000048913942,0.00004686693,0.000015090208,0.000024023651,0.00019172797,0.00041508704,0.5074249,0.000007002091,0.0023543518,0.000070415736,0.48939267],"study_design_scores_gemma":[0.0004228194,0.00025753962,0.00009564377,0.0009020631,0.000013694405,0.00005813002,2.2586433e-7,0.9230783,0.00002177562,0.06774368,0.0062450697,0.0011610601],"about_ca_topic_score_codex":0.00017825139,"about_ca_topic_score_gemma":0.000062451065,"teacher_disagreement_score":0.4882316,"about_ca_system_score_codex":0.000300552,"about_ca_system_score_gemma":0.0006891054,"threshold_uncertainty_score":0.9999342},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38017416,0.000080090256,0.61870915,0.0008524493,0.000018367991,0.0001535276,6.8181566e-7,0.000008393952,0.0000031966674],"genre_scores_gemma":[0.83794814,0.0000011862132,0.1601607,0.0018235099,0.00003632942,0.000020860702,0.000006726376,0.0000022141198,3.25488e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936116,0.000005032313,0.00011474739,0.00026006927,0.00013872038,0.000120290846],"domain_scores_gemma":[0.9996385,0.00018397377,0.000031245567,0.0000780906,0.000026824217,0.000041359606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009545956,0.00006323165,0.00009501598,0.00006453595,0.00006553592,0.000008902595,0.00004937612,0.000017436707,0.0000020334396],"category_scores_gemma":[0.00011478643,0.00004476116,0.0000118471335,0.00017538278,0.000111826834,0.000054918994,0.000045989043,0.000046964,4.1326024e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017611276,0.0003137146,0.0632943,0.000069033864,0.000006111769,0.000006779123,0.0003574834,0.022077732,0.007364894,0.00020665141,0.000016498752,0.9061107],"study_design_scores_gemma":[0.0021738969,0.00045372214,0.46242228,0.00006793184,0.000012359999,0.00005711617,0.0000017673541,0.5083405,0.023406414,0.0016385809,0.0012648023,0.00016062235],"about_ca_topic_score_codex":9.8038e-7,"about_ca_topic_score_gemma":0.000008675788,"teacher_disagreement_score":0.90595007,"about_ca_system_score_codex":0.000012534027,"about_ca_system_score_gemma":0.00005727226,"threshold_uncertainty_score":0.18253072},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000445196,0.00086348987,0.99396384,0.0004125612,0.0032740596,0.00045458064,0.0000025261606,0.0003189556,0.000665458],"genre_scores_gemma":[0.13054825,0.000013288502,0.86498994,0.002331605,0.0019916685,0.00000706744,0.000002399727,0.00004931771,0.00006643986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503094,0.000061421946,0.0007113758,0.0018798525,0.001115533,0.0012008698],"domain_scores_gemma":[0.99714327,0.00046349625,0.0004028307,0.0014433522,0.0002712035,0.0002758454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008905166,0.0007101251,0.0006717292,0.00044732654,0.000535758,0.0007698683,0.0032352332,0.00041584187,0.00003897592],"category_scores_gemma":[0.00003668846,0.00069891283,0.00021783853,0.00090444984,0.0005441307,0.0004007697,0.00081419264,0.0009967415,0.000038656417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013425863,0.000010418211,0.000015009746,0.000005590281,0.000005814721,0.00008257398,0.00004159938,0.5044113,0.000003040689,0.005363306,0.0000041597996,0.4900559],"study_design_scores_gemma":[0.00047652563,0.000116088326,0.000050284474,0.00058283826,0.000017402996,0.00006704972,3.9274397e-8,0.9412382,0.000032182434,0.056259457,0.0004362964,0.00072363165],"about_ca_topic_score_codex":0.000044153523,"about_ca_topic_score_gemma":0.00003187612,"teacher_disagreement_score":0.48933226,"about_ca_system_score_codex":0.0005899611,"about_ca_system_score_gemma":0.0017823623,"threshold_uncertainty_score":0.99954623},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000902636,0.0007732668,0.9921141,0.00061843544,0.0021784413,0.000650058,0.000004842163,0.00030427586,0.0024539214],"genre_scores_gemma":[0.29802114,0.00010903916,0.70003825,0.0005626837,0.0006858842,0.000011779081,0.000038040715,0.000101002166,0.00043217654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926202,0.0000987117,0.00087446044,0.0034437391,0.001630531,0.0013323365],"domain_scores_gemma":[0.994379,0.00055939093,0.00049740454,0.004052201,0.00025862953,0.00025336642],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013100033,0.00090191135,0.0008746512,0.0014992346,0.00039675145,0.00069750065,0.0060659233,0.0005909446,0.00001271997],"category_scores_gemma":[0.00008148861,0.0007972351,0.00009994417,0.0027361144,0.0010169939,0.00040367898,0.0025377774,0.0016564425,0.000014610993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028991653,0.000077738354,0.000046817695,0.000013237171,0.000010981452,0.0006877127,0.00027490922,0.92570543,0.00001817317,0.0043767067,0.000013954548,0.06874535],"study_design_scores_gemma":[0.000798559,0.0002415702,0.00025311497,0.001251467,0.000011701528,0.00044949632,3.418404e-7,0.99374914,0.00009387926,0.0019203174,0.00028927397,0.00094111776],"about_ca_topic_score_codex":0.00016268977,"about_ca_topic_score_gemma":0.0014205414,"teacher_disagreement_score":0.29711848,"about_ca_system_score_codex":0.0011316858,"about_ca_system_score_gemma":0.0011525403,"threshold_uncertainty_score":0.9994479},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026765457,0.00025099047,0.99108803,0.0007840734,0.0004990228,0.00019714673,0.000029046218,0.000056932433,0.006827122],"genre_scores_gemma":[0.8075648,0.000013241616,0.17003408,0.0006931763,0.012836938,0.00002150706,0.00016405359,0.00010012167,0.008572062],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99822456,0.0000038261437,0.0003220087,0.0006275776,0.00039060184,0.00043142634],"domain_scores_gemma":[0.99922055,0.000045455497,0.0001676827,0.00035433806,0.000042380285,0.00016958074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013692943,0.00032136287,0.000303755,0.00011989286,0.00017858054,0.0002819289,0.00052939734,0.000120983306,0.0003069534],"category_scores_gemma":[0.0000041013277,0.00030572558,0.00010518491,0.00017237947,0.00030031046,0.00016908947,0.00014773337,0.00040186234,0.0000358589],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004946531,0.000022316828,0.00018612949,0.000006238447,0.000010611648,0.0000017400436,0.00012266413,0.000981529,0.000073581905,0.014143109,0.000569111,0.983878],"study_design_scores_gemma":[0.0004553532,0.000109838256,0.000032014304,0.00024583476,0.000023964054,0.0000046265113,6.082041e-7,0.010557558,0.007999092,0.14181873,0.83770645,0.0010459613],"about_ca_topic_score_codex":0.00010047623,"about_ca_topic_score_gemma":0.000017224947,"teacher_disagreement_score":0.9828321,"about_ca_system_score_codex":0.00010795541,"about_ca_system_score_gemma":0.0004973136,"threshold_uncertainty_score":0.9999395},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068690064,0.00038775027,0.9883224,0.0015987755,0.00062927377,0.0010145168,0.000017245922,0.00009918739,0.0010618551],"genre_scores_gemma":[0.46975306,0.0001024052,0.5216442,0.0018355547,0.0013930057,0.000032121257,0.00010500867,0.00010596798,0.0050286804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981322,0.0000079650845,0.00043588123,0.00060318224,0.00045552725,0.000365231],"domain_scores_gemma":[0.99878985,0.00042385765,0.00014651057,0.00034933817,0.0001285393,0.00016189566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021136641,0.00034853988,0.0004749039,0.00038792272,0.00022052877,0.00022184686,0.00011299795,0.00022119582,0.000079649566],"category_scores_gemma":[0.00012049676,0.00030441914,0.000116041316,0.00021501993,0.00041376177,0.0005408358,0.00007960727,0.0004008615,0.000017850125],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022975531,0.000028004848,0.0005243423,0.00019561502,0.000021337068,0.000023860159,0.00083469274,0.0021849726,0.00016970823,0.00088742626,0.000091371214,0.9950157],"study_design_scores_gemma":[0.016645178,0.0050101653,0.019239696,0.01222817,0.0006487138,0.0038296971,0.000007472805,0.7726893,0.0026413607,0.0647594,0.09838158,0.0039192666],"about_ca_topic_score_codex":0.000009692687,"about_ca_topic_score_gemma":0.000040954736,"teacher_disagreement_score":0.99109644,"about_ca_system_score_codex":0.00016047811,"about_ca_system_score_gemma":0.0003440741,"threshold_uncertainty_score":0.9999408},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1513167,0.000016357077,0.84798163,0.00010994251,0.00026161486,0.00022000953,0.0000052378323,0.000013374232,0.00007513785],"genre_scores_gemma":[0.68075836,1.1906798e-7,0.31894976,0.0002600659,0.00002075706,0.000005541181,2.9589162e-7,0.000003614141,0.0000014722249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897623,0.000056018427,0.00021915372,0.00026493354,0.00024420297,0.00023945796],"domain_scores_gemma":[0.99844855,0.00093747757,0.000111466456,0.00037824284,0.000089452486,0.000034828132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006187801,0.00009934693,0.00016012038,0.00011123554,0.00011833701,0.00004176868,0.00045916156,0.00006171574,0.000037236998],"category_scores_gemma":[0.00092002476,0.000060085673,0.00007332392,0.0012870923,0.00022757049,0.000053795316,0.00005279317,0.0001274317,8.68035e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000638664,0.0023207567,0.11532328,0.0005525728,0.00005361867,0.00001529286,0.0008146027,0.21755315,0.050136413,0.4254011,0.000949748,0.18681559],"study_design_scores_gemma":[0.0012187541,0.000359494,0.047456916,0.000091106136,0.000018498797,0.000016600763,0.0000041630265,0.33717877,0.16710047,0.44609746,0.00010216153,0.000355591],"about_ca_topic_score_codex":0.000009895901,"about_ca_topic_score_gemma":0.000013536193,"teacher_disagreement_score":0.52944165,"about_ca_system_score_codex":0.00003515132,"about_ca_system_score_gemma":0.0002008692,"threshold_uncertainty_score":0.24502227},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064680018,0.00034319938,0.9862444,0.00014619855,0.0021567747,0.00064824923,0.000002452549,0.00006246302,0.003928274],"genre_scores_gemma":[0.9330985,0.000042663825,0.06632538,0.00015950881,0.00023089923,0.00001113111,0.0000046224777,0.000016050479,0.000111257905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958794,0.00004826199,0.0006163318,0.00097052264,0.0021152191,0.00037024936],"domain_scores_gemma":[0.9975938,0.000109647066,0.0004941818,0.0010975508,0.00061200734,0.000092785565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022620226,0.00033798857,0.00039781354,0.00062657456,0.00014052786,0.0001524064,0.0017991422,0.00022130946,0.00004385232],"category_scores_gemma":[0.000071567585,0.00030498492,0.00010360123,0.000443416,0.00021970131,0.0006654336,0.00049219205,0.00031086663,0.000043656146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022310444,0.000026229973,0.0001431969,0.00006653315,0.000008250427,0.0000040441837,0.0008335759,0.24952735,0.00027135058,0.00787177,0.0000054873776,0.74123996],"study_design_scores_gemma":[0.0004718574,0.00013775827,0.002917796,0.0007302124,0.000015388645,0.000016185792,8.2072695e-8,0.97426605,0.0038043242,0.017087223,0.0001611044,0.0003920378],"about_ca_topic_score_codex":0.000032022795,"about_ca_topic_score_gemma":0.000030389403,"teacher_disagreement_score":0.9266305,"about_ca_system_score_codex":0.0006232273,"about_ca_system_score_gemma":0.0010010948,"threshold_uncertainty_score":0.9999402},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003560584,0.0008262236,0.7913124,0.0019927337,0.00050884427,0.00081882224,0.00003096914,0.000041429943,0.200908],"genre_scores_gemma":[0.99631125,0.000029315604,0.002592306,0.0005398058,0.00021427742,0.00000770361,0.0000029801986,0.000009011449,0.0002933731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982044,0.00006911244,0.00036304185,0.00048947183,0.0005070595,0.00036693376],"domain_scores_gemma":[0.99870443,0.00051337434,0.00023448192,0.0003545766,0.00013993095,0.000053208463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010184401,0.00022886934,0.00034035338,0.00033148762,0.00022032888,0.00017451431,0.0017445603,0.00022978093,0.000019914643],"category_scores_gemma":[0.00008427059,0.00016383323,0.00010173043,0.00038186103,0.00208395,0.00022077179,0.00015270451,0.0005459055,0.000003652863],"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.00004190433,0.00014108451,0.0010682696,0.00003290252,0.00001958341,0.00007154164,0.036270842,0.051871356,0.00006407898,0.6407389,0.000097701624,0.26958185],"study_design_scores_gemma":[0.00045966503,0.00017368449,0.0010939728,0.00032876272,0.000020220084,0.0000048913603,0.00003923724,0.09743752,0.00018321711,0.8966114,0.003064517,0.00058292266],"about_ca_topic_score_codex":0.0012718393,"about_ca_topic_score_gemma":0.0187759,"teacher_disagreement_score":0.99275064,"about_ca_system_score_codex":0.00008374406,"about_ca_system_score_gemma":0.0005833368,"threshold_uncertainty_score":0.9991289},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024130028,0.00021264594,0.9970124,0.00030966155,0.0003171467,0.00035083917,0.000059171896,0.00006908114,0.0014278033],"genre_scores_gemma":[0.3435284,0.000041565436,0.65588313,0.00022917535,0.000108101485,0.000005257349,0.000011673917,0.000020473286,0.00017220905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613255,0.000035063167,0.0007998996,0.0014924225,0.0010681031,0.00047196363],"domain_scores_gemma":[0.9956248,0.0002944463,0.00051406794,0.0030765035,0.0003619717,0.00012822174],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009810609,0.00044124934,0.0007115551,0.0005216362,0.000074803924,0.000112844646,0.006101603,0.0002486375,0.000012194562],"category_scores_gemma":[0.0001112008,0.00038672757,0.00010705412,0.0004123236,0.00069882494,0.00050026894,0.0027478337,0.0005325416,0.000007831015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058850987,0.0000618816,0.0000097091115,0.0001202404,0.000013606666,0.0000055215764,0.0002824381,0.7400763,0.0004805222,0.05565817,0.0000309569,0.20325477],"study_design_scores_gemma":[0.00016086634,0.00015761751,0.000013977422,0.0005401308,0.000015597165,0.0000088088345,4.3684217e-8,0.9291247,0.0005732016,0.06895786,0.00009947771,0.0003476817],"about_ca_topic_score_codex":0.000022211338,"about_ca_topic_score_gemma":0.0001011738,"teacher_disagreement_score":0.34328708,"about_ca_system_score_codex":0.00013854983,"about_ca_system_score_gemma":0.00096741744,"threshold_uncertainty_score":0.99985844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014744307,0.00018802307,0.990332,0.00025956077,0.0015776193,0.0002768481,0.000002423039,0.000048232738,0.0058408827],"genre_scores_gemma":[0.8811143,0.0000410947,0.11638791,0.0016454828,0.00028398944,0.000013334899,0.0000037044738,0.000040094157,0.00047009558],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965493,0.000056318015,0.000514366,0.0015297246,0.00061822066,0.00073204166],"domain_scores_gemma":[0.99852455,0.00024288044,0.00025220306,0.0005858072,0.00026939297,0.00012517962],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061107986,0.00052183005,0.0004959158,0.0014985793,0.00017360382,0.0003414671,0.0026196353,0.000351577,0.000092678856],"category_scores_gemma":[0.0000835226,0.0004840161,0.00014228039,0.00084283686,0.00043367036,0.0013561066,0.0010901121,0.001310084,0.00008472132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023691733,0.00068281445,0.011090678,0.00027360782,0.00018607691,0.00089275854,0.020317558,0.03756309,0.04236725,0.36727756,0.0005985525,0.51851314],"study_design_scores_gemma":[0.0010020266,0.0011038404,0.012672187,0.001848175,0.000022050517,0.0002857474,0.0000026080525,0.42933768,0.09493341,0.4508887,0.004932029,0.0029715307],"about_ca_topic_score_codex":0.00011972954,"about_ca_topic_score_gemma":0.00022841449,"teacher_disagreement_score":0.87963986,"about_ca_system_score_codex":0.00033150514,"about_ca_system_score_gemma":0.0002996151,"threshold_uncertainty_score":0.99976116},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020110537,0.00027032668,0.98119223,0.000024917705,0.0007228036,0.00017142454,0.000005096459,0.00013433909,0.017277768],"genre_scores_gemma":[0.7017211,0.00006735595,0.29771128,0.00012638983,0.00021984002,0.0000022080583,0.000008959771,0.000056165216,0.000086702814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986094,0.000006326931,0.00037109695,0.00037866188,0.0003584257,0.0002760429],"domain_scores_gemma":[0.9991641,0.00016005768,0.000084704654,0.00043844312,0.0000892451,0.0000634654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005168485,0.00024339701,0.00030878725,0.00035776905,0.000045069002,0.00005561944,0.0004191241,0.00019770347,0.00004304986],"category_scores_gemma":[0.000035567402,0.00022888782,0.00007184603,0.00023380123,0.0003860875,0.000098898636,0.00012457918,0.000392458,0.0000062695913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015284638,0.000006695583,0.00015166002,0.00013138907,0.000005256862,0.0000030699787,0.00035569642,0.7496028,0.00007000709,0.0016565401,0.000002772004,0.2480126],"study_design_scores_gemma":[0.00016112151,0.000041803465,0.00030789708,0.00055551855,0.0000077663435,0.000010827784,2.062221e-7,0.9534868,0.004332279,0.03978683,0.00081276125,0.00049621233],"about_ca_topic_score_codex":0.0000058253954,"about_ca_topic_score_gemma":0.00002875857,"teacher_disagreement_score":0.70151997,"about_ca_system_score_codex":0.00012163546,"about_ca_system_score_gemma":0.0000536352,"threshold_uncertainty_score":0.9333774},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007685183,0.00009845573,0.9949837,0.00048950507,0.00020357012,0.00047896852,0.000009048308,0.00013693325,0.0035230175],"genre_scores_gemma":[0.29640174,0.0000029026955,0.7027001,0.00032569945,0.0002571425,0.000022026108,0.000017351593,0.000026070582,0.00024701108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663126,0.000059922277,0.00045935708,0.0011590405,0.0012651541,0.00042524413],"domain_scores_gemma":[0.99755025,0.00071760017,0.00038516617,0.00065284,0.00053927395,0.00015489983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005753842,0.00041054885,0.00050035625,0.000768494,0.00030040785,0.00023127525,0.0021233815,0.00011382797,0.0000094563675],"category_scores_gemma":[0.00007796507,0.00035619535,0.00008231951,0.00078139256,0.0007003952,0.00021236265,0.0006708376,0.0008173082,0.000026116262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030518863,0.000024470022,0.00014403391,0.00001800928,0.000009607713,0.000011406657,0.00025070657,0.7699527,0.00000923286,0.022704853,0.00000851427,0.2068634],"study_design_scores_gemma":[0.0002479604,0.00029076028,0.00080857426,0.0002958164,0.0000087093795,0.00004298331,1.4623059e-7,0.82442105,0.00020217388,0.17140324,0.001793116,0.00048547116],"about_ca_topic_score_codex":0.00019917032,"about_ca_topic_score_gemma":0.000077667886,"teacher_disagreement_score":0.29632488,"about_ca_system_score_codex":0.00015296656,"about_ca_system_score_gemma":0.00038065537,"threshold_uncertainty_score":0.999889},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002724679,0.00007813127,0.99093723,0.0011280652,0.0015581934,0.00035331206,0.0000017772717,0.000026834987,0.0031917724],"genre_scores_gemma":[0.88263017,0.00001623737,0.11469602,0.002156689,0.00017731999,0.000014086626,0.000003864867,0.000015299014,0.000290343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976898,0.000100256395,0.0004945261,0.0008105376,0.00064989756,0.0002550014],"domain_scores_gemma":[0.9975302,0.0011506139,0.0002431489,0.0008348279,0.00019442035,0.000046785946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017859827,0.00024661032,0.0003149382,0.00073565636,0.00010520513,0.00011980378,0.0012404466,0.0001590478,0.00002614525],"category_scores_gemma":[0.0004090847,0.00018428652,0.00009787809,0.00095102185,0.00028676787,0.0002732262,0.00028261053,0.0005186914,0.0000117160025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019933239,0.00008633333,0.00004456078,0.000026253147,0.0000049549217,0.000010777466,0.0007140857,0.5437805,0.00014076252,0.12574223,0.00007985249,0.32934976],"study_design_scores_gemma":[0.00028788968,0.00028005187,0.00031380195,0.00023035397,0.0000028816874,0.000015015411,2.3105942e-7,0.5706542,0.0025435137,0.42460427,0.0007845358,0.0002832596],"about_ca_topic_score_codex":0.000017403023,"about_ca_topic_score_gemma":0.00006390578,"teacher_disagreement_score":0.87990546,"about_ca_system_score_codex":0.0002853416,"about_ca_system_score_gemma":0.00028468008,"threshold_uncertainty_score":0.7514986},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004769352,0.0019075908,0.98596466,0.0008451773,0.00076509523,0.00041544755,0.000009942476,0.0001831171,0.00943206],"genre_scores_gemma":[0.086578615,0.00017503243,0.902244,0.008602689,0.00072594895,0.000012824783,0.000009910959,0.00007790065,0.0015731372],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966457,0.000023999779,0.00041077958,0.001515596,0.00073570205,0.0006682478],"domain_scores_gemma":[0.99687284,0.0005009984,0.00021042707,0.002090483,0.00010869535,0.00021656729],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015269719,0.00048789743,0.0005270961,0.000604213,0.0002895044,0.001640389,0.00802571,0.00027896962,0.000047706835],"category_scores_gemma":[0.00010721775,0.0004223097,0.00006973766,0.00045004577,0.00087369676,0.00091339374,0.0072245835,0.000640332,0.000034206816],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006205548,0.000019707735,0.000044337674,0.000033512155,0.000010208641,0.0002680058,0.00089180854,0.00019221523,0.00013694781,0.10107566,0.000076211814,0.89724517],"study_design_scores_gemma":[0.0011618409,0.00043607535,0.0009501685,0.0009404772,0.00001856941,0.00047901378,0.0000025284382,0.18257064,0.0023107617,0.7976554,0.011494404,0.00198011],"about_ca_topic_score_codex":0.00008406265,"about_ca_topic_score_gemma":0.00017588894,"teacher_disagreement_score":0.8952651,"about_ca_system_score_codex":0.00013249979,"about_ca_system_score_gemma":0.00031474658,"threshold_uncertainty_score":0.99982285},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036261583,0.002194941,0.9949806,0.00011421122,0.00061122567,0.0007022142,0.000015718359,0.0005947357,0.00042373632],"genre_scores_gemma":[0.78027207,0.0017219973,0.21663928,0.0005779487,0.00042004648,0.00004545389,0.000080351965,0.00014301573,0.00009985912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981037,0.0000095201,0.00036918122,0.0006242818,0.00027050835,0.00062284275],"domain_scores_gemma":[0.9991065,0.00021576484,0.000084601554,0.0004205007,0.00007504685,0.000097578224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019164712,0.00046235535,0.00054622244,0.0004565275,0.0001486149,0.00020915583,0.0005818839,0.0004480913,0.0000071082436],"category_scores_gemma":[0.000021665164,0.0004302909,0.00011987372,0.00031526125,0.00053390383,0.00012506144,0.00009964488,0.00038521618,9.910067e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022239572,0.000011392834,0.00007281039,0.00012499973,0.000029050067,0.000008538008,0.00016994789,0.5462869,0.0000955972,0.0036998536,0.00005412422,0.44942454],"study_design_scores_gemma":[0.0007361798,0.000056000357,0.00006884405,0.00023076271,0.000024132532,0.000012830625,7.1699543e-7,0.9763399,0.003704157,0.01579285,0.0024571489,0.0005764924],"about_ca_topic_score_codex":0.0000024706387,"about_ca_topic_score_gemma":0.000016879108,"teacher_disagreement_score":0.77990943,"about_ca_system_score_codex":0.00008374653,"about_ca_system_score_gemma":0.000032759377,"threshold_uncertainty_score":0.99981487},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068654044,0.000501207,0.99251217,0.0028771532,0.0012645723,0.0012073378,0.0000428829,0.00080372026,0.0007222972],"genre_scores_gemma":[0.03251015,0.000015460571,0.96529603,0.001260978,0.00048050168,0.00007119051,0.000028906776,0.0000649025,0.00027188583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926442,0.000084135674,0.0010784566,0.0029555783,0.0015188004,0.001718825],"domain_scores_gemma":[0.9956503,0.0008954955,0.00035702295,0.0024189164,0.00033831105,0.00033995468],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015115252,0.0010116679,0.001050216,0.0018233415,0.00031763958,0.00081999204,0.007050409,0.0006670763,0.0000074073782],"category_scores_gemma":[0.00026565616,0.0009961012,0.00015193458,0.0040534516,0.0005372631,0.00058905594,0.0030248917,0.0015370228,0.00007681822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007535763,0.000028589337,0.00010933311,0.000012039607,0.0000072620687,0.00027078303,0.00023289524,0.21598496,0.00004090548,0.0021396698,0.00040772097,0.7807583],"study_design_scores_gemma":[0.0003705109,0.00028774477,0.00056113006,0.0008024486,0.000007631049,0.000056079396,2.9688653e-7,0.9174868,0.0021139744,0.069889516,0.006994477,0.0014294079],"about_ca_topic_score_codex":0.000088578745,"about_ca_topic_score_gemma":0.00034771123,"teacher_disagreement_score":0.7793289,"about_ca_system_score_codex":0.0011707164,"about_ca_system_score_gemma":0.0005137399,"threshold_uncertainty_score":0.9992489},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000080761754,0.0024086111,0.9937792,0.00008635754,0.0018746424,0.0008129683,0.0000470443,0.00074262684,0.00016781033],"genre_scores_gemma":[0.06445157,0.00007370782,0.934685,0.000114937815,0.0003657896,0.00005642133,0.000008866151,0.000060104954,0.00018358728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957825,0.000049467853,0.00053965615,0.0020915354,0.00071353774,0.00082329457],"domain_scores_gemma":[0.9945237,0.0032280723,0.00024285747,0.001534737,0.00031161465,0.0001590414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007653354,0.0006683791,0.0007598152,0.00069317885,0.0002915381,0.0004221111,0.0028236255,0.0003715379,0.0000027904553],"category_scores_gemma":[0.0008555829,0.0006452184,0.00019159564,0.00043924173,0.00045617335,0.00077493384,0.0007600798,0.0007142243,0.000008683192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012050795,0.000013348543,0.00000561325,0.000019036715,0.000014729935,0.000014621779,0.0033194555,0.88088024,0.00016467393,0.009312759,0.0000049772657,0.1062385],"study_design_scores_gemma":[0.00029977853,0.00007341997,0.0000066078383,0.00036977275,0.000007937192,0.000012516495,0.0000018343111,0.85809714,0.0002974194,0.1400551,0.00016646435,0.00061200524],"about_ca_topic_score_codex":0.000045282763,"about_ca_topic_score_gemma":0.000033021475,"teacher_disagreement_score":0.13074234,"about_ca_system_score_codex":0.0007160784,"about_ca_system_score_gemma":0.0004947167,"threshold_uncertainty_score":0.99959993},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003350625,0.014830547,0.96105486,0.00009467528,0.0013945302,0.000358184,0.0000036957408,0.00017770828,0.022052316],"genre_scores_gemma":[0.75927365,0.00035779088,0.23862022,0.00029120588,0.0009468703,0.000009302003,0.0000026919347,0.00003772852,0.0004605641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689215,0.000051975152,0.0006092385,0.0011655808,0.00082086516,0.00046021424],"domain_scores_gemma":[0.9977935,0.00021528726,0.00035208795,0.0011391469,0.00023684085,0.00026311228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010640217,0.00039128313,0.0006267828,0.00072298,0.00019358796,0.00023076433,0.0016865012,0.00032324647,0.0000011772662],"category_scores_gemma":[0.000022872635,0.00034285762,0.00010769246,0.00060246274,0.00034617464,0.0008780657,0.0005620709,0.00038620198,0.000006152666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043878927,0.000013887527,0.000019270456,0.00010332605,0.000008416692,0.000014564726,0.00034355072,0.01669535,0.000033227727,0.648331,0.00000622235,0.3344268],"study_design_scores_gemma":[0.0002599726,0.00020164665,0.00015218418,0.0007504965,0.000013442366,0.00014076846,0.0000010242059,0.5952748,0.00002907438,0.40245008,0.0003226908,0.0004038191],"about_ca_topic_score_codex":0.0006124958,"about_ca_topic_score_gemma":0.00033279986,"teacher_disagreement_score":0.7592401,"about_ca_system_score_codex":0.00046028174,"about_ca_system_score_gemma":0.0005984796,"threshold_uncertainty_score":0.99990237},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004155122,0.00010818141,0.99807173,0.00018665941,0.0004097959,0.00047039113,0.000010285911,0.0001801383,0.0005212767],"genre_scores_gemma":[0.0023537062,0.00002629247,0.9959064,0.0014017079,0.00018548245,0.0000058909927,0.000015739568,0.00002418181,0.00008056518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693906,0.000036967846,0.0005305182,0.0010569507,0.0009953739,0.0004411388],"domain_scores_gemma":[0.998316,0.00026307057,0.00026563415,0.00069249095,0.0002566348,0.00020616432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011205671,0.0003687855,0.00031982074,0.0008478717,0.00024524497,0.00038976214,0.0012088655,0.00024524043,0.000021801821],"category_scores_gemma":[0.00008943685,0.0003591075,0.00005771297,0.00050591305,0.001176476,0.0008257008,0.00088266504,0.0005535573,0.00001375255],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027620308,0.000018850254,0.00001407444,0.00005739727,0.000007427698,0.000049159753,0.00083340105,0.0017504226,0.0026311085,0.0018844648,0.000024710771,0.9927262],"study_design_scores_gemma":[0.00024186517,0.00009197337,0.0000406615,0.00023054665,0.00000912739,0.00011585835,0.0000011438926,0.954839,0.019762687,0.024139468,0.000063752195,0.0004639386],"about_ca_topic_score_codex":0.000032042455,"about_ca_topic_score_gemma":0.000026147001,"teacher_disagreement_score":0.9922623,"about_ca_system_score_codex":0.00030506324,"about_ca_system_score_gemma":0.00035044938,"threshold_uncertainty_score":0.9998861},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015626728,0.000974919,0.9925151,0.00059068744,0.0011837536,0.0020714584,0.00003116253,0.00018828256,0.0022883946],"genre_scores_gemma":[0.18257937,0.00075169984,0.8105084,0.0035697971,0.00077787315,0.000412457,0.0000407127,0.00021061536,0.0011490752],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932319,0.00007605922,0.00090375415,0.0026294428,0.0015100613,0.0016488063],"domain_scores_gemma":[0.9946265,0.0018770925,0.0003563353,0.0022910587,0.00047045958,0.00037852878],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013222744,0.0008469974,0.0009737081,0.0025189407,0.00043151266,0.0004131938,0.0069303378,0.00046605364,0.000014059862],"category_scores_gemma":[0.00021804118,0.0008199583,0.00031288975,0.0016878254,0.0022910575,0.00090605847,0.0018351944,0.0014638453,0.0000431359],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009214609,0.00013141055,0.0002811543,0.0001206755,0.000031231273,0.0007115309,0.001433149,0.020073332,0.00064988196,0.060037214,0.00025481256,0.9161835],"study_design_scores_gemma":[0.0018877962,0.0005757246,0.00026772206,0.00086320407,0.000007660246,0.00028351697,3.7125886e-7,0.37927198,0.0013405025,0.586301,0.027377253,0.0018232443],"about_ca_topic_score_codex":0.0000182822,"about_ca_topic_score_gemma":0.00014783442,"teacher_disagreement_score":0.9143602,"about_ca_system_score_codex":0.0004963065,"about_ca_system_score_gemma":0.0009026126,"threshold_uncertainty_score":0.9994251},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013942015,0.00017194568,0.995307,0.000161905,0.0005948921,0.0013531486,0.000011211503,0.000111798276,0.00089389243],"genre_scores_gemma":[0.84317917,0.00007265716,0.15578613,0.00051554025,0.0002342677,0.00009968356,0.000010042615,0.00003367992,0.00006881266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959645,0.000037570488,0.00079958193,0.0014679888,0.0010017839,0.00072854315],"domain_scores_gemma":[0.99702257,0.0002429473,0.0005760424,0.0016983625,0.00029361426,0.00016644679],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007886384,0.0005680347,0.001010113,0.0016260906,0.0002143813,0.00029056997,0.004007103,0.0003695156,0.00003802416],"category_scores_gemma":[0.000016430875,0.0005172173,0.0003137038,0.0021617752,0.0005790769,0.0006074672,0.00097278535,0.0007741032,0.000013794763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025471513,0.000042566237,0.003819016,0.00010803444,0.00011548632,0.000043764012,0.0007809981,0.33218023,0.000113879265,0.0038834622,0.0000012352065,0.6589088],"study_design_scores_gemma":[0.00031769005,0.00014159699,0.0036441272,0.0008921908,0.00006550261,0.000009927089,9.4211984e-8,0.9885026,0.0006457672,0.005102866,0.000041232302,0.00063638564],"about_ca_topic_score_codex":0.00015511374,"about_ca_topic_score_gemma":0.0003426212,"teacher_disagreement_score":0.841785,"about_ca_system_score_codex":0.00030873774,"about_ca_system_score_gemma":0.0005979732,"threshold_uncertainty_score":0.99972796},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051230873,0.0013446079,0.9929709,0.0007456618,0.00083271,0.0003443399,0.0000167827,0.00045663922,0.0027760644],"genre_scores_gemma":[0.15969397,0.0003765612,0.834406,0.0018095197,0.0013667328,0.000008863781,0.000015612464,0.000074722404,0.0022479857],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9956465,0.000031450712,0.0006507151,0.0017851449,0.0011609221,0.0007253012],"domain_scores_gemma":[0.99711317,0.0004306233,0.00033496556,0.0014238947,0.00043046637,0.0002668621],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011158801,0.0005903769,0.00053779944,0.00066380773,0.00030049824,0.0022451212,0.003160582,0.00046894985,0.000065314394],"category_scores_gemma":[0.0003021087,0.0005313089,0.00014221776,0.00065677235,0.0021877082,0.0014440417,0.0016207903,0.0009845255,0.00007803188],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029921006,0.00004726338,0.00016107614,0.000103353195,0.000012765491,0.00026769738,0.0033134918,0.000058342255,0.006842455,0.019634956,0.000020245941,0.9695084],"study_design_scores_gemma":[0.0020608513,0.0007070182,0.0077263736,0.0010463387,0.000037438454,0.0010337417,0.0000023801865,0.21831049,0.4865959,0.26626754,0.011229447,0.0049824766],"about_ca_topic_score_codex":0.000010966957,"about_ca_topic_score_gemma":0.0000066754087,"teacher_disagreement_score":0.96452594,"about_ca_system_score_codex":0.00028778546,"about_ca_system_score_gemma":0.00043797027,"threshold_uncertainty_score":0.99971384},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056171804,0.0026835771,0.99284625,0.0015169228,0.0006283838,0.0011593044,0.000030536252,0.0001110786,0.0009677708],"genre_scores_gemma":[0.18973674,0.0002962789,0.8060914,0.0027797471,0.0005685315,0.00011957763,0.000043604563,0.00007970631,0.00028439405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956214,0.00013077391,0.000635127,0.0019314218,0.0008875126,0.00079379143],"domain_scores_gemma":[0.9932607,0.0015401024,0.0002849163,0.004417251,0.00030353313,0.00019353654],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0026727498,0.00045361993,0.0006414625,0.00079093437,0.00027454764,0.0008916432,0.0102937175,0.00033869705,0.0000025932507],"category_scores_gemma":[0.00008480027,0.00042946788,0.000052639378,0.00074676663,0.0004909895,0.0010402532,0.0035881025,0.00087834324,0.000013328256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057866877,0.00011230205,0.0006493301,0.0013111987,0.000062822946,0.00010684539,0.0013727585,0.038755603,0.00016503055,0.073250175,0.00023747531,0.8839186],"study_design_scores_gemma":[0.00075515016,0.000065557586,0.00008232951,0.0008289347,0.0000045419024,0.000048615697,6.4420203e-7,0.9849703,0.000033264714,0.004688187,0.00809583,0.00042666297],"about_ca_topic_score_codex":0.00008085021,"about_ca_topic_score_gemma":0.0005816519,"teacher_disagreement_score":0.9462147,"about_ca_system_score_codex":0.0003126455,"about_ca_system_score_gemma":0.0004667203,"threshold_uncertainty_score":0.9998157},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01868536,0.00014448284,0.97936505,0.00019900352,0.000103690276,0.00016772455,0.00003694937,0.0000057356715,0.0012919916],"genre_scores_gemma":[0.9865542,0.0000058321707,0.013318852,0.000032535176,0.000044965524,0.000002700744,0.000013495949,0.000007432147,0.00001995661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920785,0.0000050133417,0.00019509118,0.00024929945,0.00015896118,0.00018375537],"domain_scores_gemma":[0.99949986,0.0001596172,0.00009298452,0.0001768362,0.000047273603,0.000023442552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118792,0.00012781746,0.0001561709,0.00007851271,0.00014162979,0.000055113756,0.00021337818,0.00005315973,0.000013548104],"category_scores_gemma":[0.0000030162548,0.00009811072,0.000029338424,0.000113989394,0.00031256443,0.00008377177,0.00017308765,0.00029544742,2.458623e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011442631,0.00003829748,0.0068588685,0.000026392121,0.000038713948,0.0000016835742,0.0011416448,0.08892832,0.021103684,0.7098725,0.0000011033918,0.17197737],"study_design_scores_gemma":[0.00013274178,0.000022404623,0.00013646772,0.00002995317,0.0000057644584,2.2826686e-7,0.0000019202455,0.25052804,0.023304012,0.72569054,0.000034358975,0.0001135606],"about_ca_topic_score_codex":0.00032547634,"about_ca_topic_score_gemma":0.00043847327,"teacher_disagreement_score":0.96786886,"about_ca_system_score_codex":0.000049898725,"about_ca_system_score_gemma":0.00009732539,"threshold_uncertainty_score":0.40008393},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008442632,0.00008821121,0.99648744,0.0007429355,0.00038298327,0.00029889104,0.00003084735,0.000074609175,0.0010498449],"genre_scores_gemma":[0.4065205,0.000025749023,0.5893321,0.003644052,0.0003401224,0.000009602214,0.00009191916,0.000020774087,0.000015175989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971353,0.00004352254,0.00073953706,0.00069991994,0.000936142,0.00044559868],"domain_scores_gemma":[0.997904,0.00040786047,0.00036518768,0.0010068663,0.00018066072,0.00013543348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093497493,0.00033443252,0.0004381371,0.001510426,0.000092491464,0.0002753367,0.0023988069,0.00029143694,0.000046403897],"category_scores_gemma":[0.00012400936,0.00033056719,0.00013862234,0.0007953513,0.00085290516,0.001434865,0.0007082943,0.0008009805,0.000040951145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005036508,0.000102600075,0.0000888117,0.00014057603,0.000008826849,0.000046466517,0.0017854677,0.049751643,0.0001750075,0.067714,0.00011585207,0.8800204],"study_design_scores_gemma":[0.0007030271,0.00016047772,0.00023618145,0.00047208995,0.0000056672447,0.000024182924,1.5935312e-7,0.92563635,0.0014523874,0.06645615,0.004321279,0.0005320291],"about_ca_topic_score_codex":0.000039455517,"about_ca_topic_score_gemma":0.000057580175,"teacher_disagreement_score":0.87948835,"about_ca_system_score_codex":0.000113611866,"about_ca_system_score_gemma":0.00060307543,"threshold_uncertainty_score":0.99991465},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006043486,0.0003326321,0.995324,0.0003243614,0.0009962311,0.0006816257,0.0000062218055,0.00013443235,0.0015961024],"genre_scores_gemma":[0.99406856,0.000040680858,0.005083285,0.0004315923,0.00022527223,0.000025505222,0.0000025699958,0.000021607028,0.00010091782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966116,0.00008519062,0.0008503076,0.0010490066,0.000945522,0.00045838227],"domain_scores_gemma":[0.9975698,0.00033537654,0.0004638561,0.0012474795,0.00027010366,0.00011339618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093727163,0.0003988095,0.0008921615,0.0011033664,0.00007658719,0.00036983346,0.004423288,0.00022772198,0.000004797316],"category_scores_gemma":[0.00005392279,0.00035699527,0.0001606352,0.0006576782,0.00047219353,0.0008078343,0.0009284167,0.0005767006,0.000015203345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038913895,0.0007922004,0.0026379395,0.0017405158,0.00011438583,0.00068627344,0.121531,0.008548321,0.0015745445,0.054075826,0.0005235939,0.80773646],"study_design_scores_gemma":[0.00048373104,0.00024117528,0.00031461014,0.0014222153,0.0000091055645,0.00015264304,5.6464336e-7,0.9776043,0.0028221214,0.01268505,0.0035152896,0.00074918475],"about_ca_topic_score_codex":0.000085980704,"about_ca_topic_score_gemma":0.00004718391,"teacher_disagreement_score":0.99346423,"about_ca_system_score_codex":0.00021187491,"about_ca_system_score_gemma":0.00039230307,"threshold_uncertainty_score":0.9998882},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012203027,0.00013598728,0.99655277,0.0006056901,0.0009799167,0.00021511732,0.0000018857538,0.00018878886,0.0011978088],"genre_scores_gemma":[0.05005501,0.000028536086,0.94765234,0.0017390532,0.000445027,0.0000017215516,0.000005334605,0.000019596793,0.000053379255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712735,0.00004410366,0.00045350727,0.0010219736,0.0007995469,0.0005535329],"domain_scores_gemma":[0.99810946,0.00015555065,0.00028961775,0.0010266367,0.00025322076,0.00016551251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008297285,0.0003827486,0.00032134098,0.0006039153,0.00047195336,0.000608928,0.0019246846,0.000253274,0.000025649475],"category_scores_gemma":[0.00008959874,0.00036102036,0.000090019916,0.00039457827,0.00033203873,0.003858066,0.00080972194,0.00091295526,0.000036438858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025207978,0.00001904508,0.0000050017347,0.000015727712,0.000002103431,0.000013852084,0.0008754807,0.024741625,0.0005509753,0.0015414073,0.0000054201682,0.97222686],"study_design_scores_gemma":[0.0001438201,0.000064352804,0.000057972033,0.0001869502,0.000003240105,0.00006997295,2.5145104e-7,0.96265197,0.0009390514,0.034841668,0.0006125562,0.00042817235],"about_ca_topic_score_codex":0.000028553206,"about_ca_topic_score_gemma":0.00004189398,"teacher_disagreement_score":0.97179866,"about_ca_system_score_codex":0.00046529135,"about_ca_system_score_gemma":0.00040492948,"threshold_uncertainty_score":0.9998842},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031712636,0.0022236346,0.9913646,0.00016523332,0.0028801824,0.0022222397,0.000014807858,0.00032585676,0.00077171525],"genre_scores_gemma":[0.2716825,0.00015715556,0.7240282,0.0015047201,0.0019327179,0.0002628479,0.000040568008,0.00009570541,0.0002955548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944829,0.00004882177,0.00085710204,0.0024337792,0.001011882,0.0011655341],"domain_scores_gemma":[0.994439,0.0018310134,0.00048750744,0.0025130752,0.00046509624,0.0002642882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015790028,0.00072642445,0.00077939907,0.0003559962,0.00044010332,0.00058323075,0.0036941892,0.0005777546,0.000032116488],"category_scores_gemma":[0.00014484487,0.0007107135,0.00026316798,0.00080479693,0.00068669836,0.00065143994,0.0012438871,0.0008383453,0.000028346438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009286384,0.000021417507,0.0000044101403,0.000036093945,0.0000058615383,0.000011765214,0.00013291925,0.61245954,0.0000019511003,0.013774773,0.000020611797,0.37352133],"study_design_scores_gemma":[0.0002811134,0.00029677805,0.000035253375,0.00027955827,0.000010037985,0.000009266435,3.58796e-8,0.645085,0.000023827639,0.3494366,0.0040384936,0.00050405326],"about_ca_topic_score_codex":0.000010692671,"about_ca_topic_score_gemma":0.00012401732,"teacher_disagreement_score":0.37301728,"about_ca_system_score_codex":0.0009156086,"about_ca_system_score_gemma":0.0009093016,"threshold_uncertainty_score":0.99953437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027821647,0.00014934511,0.9923562,0.00039647086,0.0015671062,0.00079684507,0.0000033364408,0.003557208,0.0011456812],"genre_scores_gemma":[0.049552497,0.000013660299,0.9489929,0.000731,0.00037399016,0.00007413929,0.000014084972,0.000033137676,0.00021461118],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971398,0.000010651015,0.00044130386,0.001225397,0.0006032571,0.00057956734],"domain_scores_gemma":[0.9969884,0.0005123334,0.00034707057,0.0016093354,0.000411225,0.00013163601],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009963816,0.00041759436,0.00037847678,0.0004980819,0.00030379614,0.00063092326,0.0031913847,0.00041051427,0.0000031484738],"category_scores_gemma":[0.00026377643,0.0003850664,0.000116382864,0.00039241323,0.0006227203,0.0004916139,0.00056294614,0.00071578193,0.000021315109],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032021685,0.000018743154,0.00005536904,0.000041049116,0.0000035531482,0.0000046747896,0.0002626759,0.0001645254,0.00013105609,0.016890459,0.00006815403,0.98235655],"study_design_scores_gemma":[0.00021149559,0.00031296513,0.000070567075,0.00040796286,0.0000070497954,0.00006480653,1.7060588e-8,0.29303378,0.0044636307,0.6848918,0.015815765,0.0007201133],"about_ca_topic_score_codex":0.00002072162,"about_ca_topic_score_gemma":0.000018047185,"teacher_disagreement_score":0.9816364,"about_ca_system_score_codex":0.00012968344,"about_ca_system_score_gemma":0.00045943246,"threshold_uncertainty_score":0.9998601},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062718433,0.0003034797,0.23737085,0.00027996025,0.0024449376,0.001472112,0.000046102985,0.0004936566,0.7513171],"genre_scores_gemma":[0.991644,0.00003103585,0.004591206,0.00029806772,0.00037919576,0.000025289371,0.000006129654,0.000044272336,0.0029807824],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99380535,0.00015186163,0.00074295205,0.001723517,0.002670906,0.00090541283],"domain_scores_gemma":[0.997265,0.00058234675,0.00041181364,0.0009593837,0.0005060683,0.00027543312],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0045834086,0.00053852866,0.00065570604,0.00052580074,0.0009313688,0.0013210969,0.0024122498,0.00032937666,0.00014402322],"category_scores_gemma":[0.0005700163,0.00048094805,0.00023650003,0.00043469307,0.0029657437,0.0011063594,0.0009912757,0.00091118325,0.000053305786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000673814,0.00009133956,0.0014588897,0.00047081927,0.000038670903,0.000059534297,0.013370963,0.0014318391,0.0000016736989,0.37302017,0.000015876265,0.60997283],"study_design_scores_gemma":[0.0008521935,0.00067022955,0.002147408,0.005317274,0.00008439302,0.000008008397,0.0006766828,0.002677581,0.00019580848,0.9711886,0.013881264,0.0023005644],"about_ca_topic_score_codex":0.00061266025,"about_ca_topic_score_gemma":0.001380363,"teacher_disagreement_score":0.9853722,"about_ca_system_score_codex":0.0032926858,"about_ca_system_score_gemma":0.0007186948,"threshold_uncertainty_score":0.9997642},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004941062,0.00019194312,0.9932285,0.000027180688,0.00036407355,0.0004834562,0.000060050468,0.0000703189,0.00063341844],"genre_scores_gemma":[0.9919462,0.000096256634,0.007510956,0.000056389203,0.00016685652,0.00001321465,0.0001733252,0.000024699222,0.000012082056],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886423,0.000039620612,0.00032946715,0.0003148763,0.00027367988,0.00017814578],"domain_scores_gemma":[0.9973673,0.0020178882,0.00012636882,0.00020540429,0.0002210675,0.00006191976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044616862,0.00022852012,0.00024841275,0.00033620693,0.0002772988,0.000059147467,0.0002092691,0.00017837044,0.0000046351374],"category_scores_gemma":[0.0001282981,0.00017629957,0.000071310664,0.00018570817,0.0007512844,0.00019591721,0.000044900466,0.00036419052,0.0000013740776],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083153165,0.000015579659,0.0014730727,0.000103677005,0.000035443787,0.0000032338746,0.0017823437,0.0032169083,0.0006038913,0.0047163605,0.000049884402,0.98791647],"study_design_scores_gemma":[0.00087456586,0.00073398935,0.027727144,0.0007385835,0.00009263691,0.000027686454,0.0000052772757,0.06848505,0.008194825,0.8921984,0.00022228075,0.000699553],"about_ca_topic_score_codex":0.000010687995,"about_ca_topic_score_gemma":0.00011688547,"teacher_disagreement_score":0.9872169,"about_ca_system_score_codex":0.00003446642,"about_ca_system_score_gemma":0.00005585394,"threshold_uncertainty_score":0.71892875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038113524,0.00043746814,0.9945918,0.0010083858,0.0018432831,0.00082578784,0.000033756292,0.00012839513,0.0007500105],"genre_scores_gemma":[0.15226191,0.000004391305,0.8436659,0.0010120133,0.0017280796,0.000040872415,0.00002837414,0.00004178482,0.0012167022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943934,0.00006129105,0.0010644302,0.001763331,0.001930454,0.00078707107],"domain_scores_gemma":[0.994267,0.0028060374,0.0004896956,0.0011293538,0.0010885596,0.0002193429],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0064913924,0.000448361,0.00066412485,0.0014610614,0.0007177531,0.0015298519,0.0016819036,0.00037414645,0.00014211531],"category_scores_gemma":[0.003065219,0.00038686654,0.00031597662,0.0009654584,0.0009555711,0.00035839522,0.00022141731,0.000577617,0.000099098295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007208322,0.000026042404,0.000085559295,0.000005826822,0.000009807116,0.0000049058453,0.00010599988,0.18724434,0.00026970895,0.0020819593,0.00009849887,0.81006014],"study_design_scores_gemma":[0.00046085272,0.00014503788,0.000045774796,0.00013528572,0.000034268218,0.000023250679,5.556881e-7,0.94043916,0.00097083655,0.037523486,0.019668534,0.00055295206],"about_ca_topic_score_codex":0.000016500986,"about_ca_topic_score_gemma":0.00020791945,"teacher_disagreement_score":0.8095072,"about_ca_system_score_codex":0.0002540626,"about_ca_system_score_gemma":0.0012948497,"threshold_uncertainty_score":0.9998583},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016127466,0.00034533898,0.9753164,0.00039444986,0.0029721837,0.00019386252,0.0000018164828,0.00022833938,0.02053145],"genre_scores_gemma":[0.0019193201,0.000023318114,0.99435216,0.0023188724,0.0002347086,0.000009707137,0.0000027150993,0.000036410867,0.0011027906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586236,0.00008193553,0.0006090373,0.0016282956,0.0010941697,0.00072420767],"domain_scores_gemma":[0.99672633,0.0003419614,0.0003811784,0.002125051,0.00024381773,0.00018164917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020527733,0.0005166691,0.00049396907,0.00084299804,0.00027291253,0.00051910285,0.0040029315,0.00040491074,0.000031450993],"category_scores_gemma":[0.00031863098,0.0004958679,0.00012128591,0.0008460161,0.0006297739,0.00083808665,0.0009798297,0.0009925596,0.00015194411],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028392851,0.000015519776,0.000020457835,0.000025631847,0.0000068687577,0.000040098617,0.00030929167,0.006361555,0.0001850467,0.17718479,0.000047854748,0.8158001],"study_design_scores_gemma":[0.00037646593,0.00028090144,0.00013785403,0.00052870077,0.000012778813,0.0002385673,9.070697e-8,0.6852813,0.007402657,0.2639699,0.040215,0.0015558223],"about_ca_topic_score_codex":0.000006960867,"about_ca_topic_score_gemma":0.00000920928,"teacher_disagreement_score":0.8142442,"about_ca_system_score_codex":0.0004005396,"about_ca_system_score_gemma":0.00042296163,"threshold_uncertainty_score":0.9997493},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015370956,0.0070396485,0.9870243,0.0014479276,0.00092267554,0.000674087,0.000021084417,0.00008620623,0.0012469494],"genre_scores_gemma":[0.89663184,0.00012587447,0.10259021,0.0004651553,0.00009030267,0.000022438648,0.0000019775887,0.000019721436,0.000052502335],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996129,0.00014187522,0.0005488896,0.0008316554,0.0019884573,0.0003601424],"domain_scores_gemma":[0.9947011,0.0022060575,0.0005632909,0.0019652238,0.0005137404,0.00005060454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015063654,0.00034149952,0.0003849404,0.00022449277,0.00025108492,0.00025508887,0.005137091,0.00024492657,0.00003530716],"category_scores_gemma":[0.0008607028,0.00019939996,0.00016648984,0.0006245777,0.0009371157,0.0003475916,0.0011917059,0.0006741659,0.0000041596436],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060528546,0.000025417672,0.00004213383,0.000011917701,0.000015220171,0.0000056512254,0.0012496533,0.004036751,0.00028867606,0.012246093,0.000028023444,0.9820444],"study_design_scores_gemma":[0.00020095202,0.00006887698,0.00067600666,0.00086980144,0.00003307723,0.000012073257,2.2204114e-7,0.07779202,0.015792688,0.9038967,0.00034918188,0.00030842167],"about_ca_topic_score_codex":0.00011766298,"about_ca_topic_score_gemma":0.00013272655,"teacher_disagreement_score":0.981736,"about_ca_system_score_codex":0.00018395511,"about_ca_system_score_gemma":0.00084067864,"threshold_uncertainty_score":0.95460784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.3114643e-7,0.00027111286,0.996035,0.0008892205,0.0004097771,0.00056881143,0.00002223631,0.0002850423,0.0015180974],"genre_scores_gemma":[0.005945063,0.00012306549,0.99097663,0.0011438461,0.00014479193,0.000050645405,0.000013466122,0.000025897394,0.00157661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692696,0.00001314128,0.00049135217,0.0012502221,0.0007955536,0.0005227758],"domain_scores_gemma":[0.9979098,0.00030406684,0.00021756836,0.001078022,0.00033930098,0.00015128507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048767682,0.00038428206,0.00040536252,0.0004678215,0.00026345588,0.000236532,0.00225156,0.00023548082,0.000009834895],"category_scores_gemma":[0.00009782571,0.00034476872,0.00012258271,0.00029209527,0.0006480746,0.00027597204,0.0005714967,0.0004165831,0.000016104283],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007826169,0.000043523978,0.0000017442884,0.000038759186,0.0000055682567,0.000020131258,0.00032821222,0.0016502317,0.00014807958,0.10115898,0.00046246802,0.8961345],"study_design_scores_gemma":[0.0001468349,0.00015019988,0.000007093112,0.00007051144,0.000004512093,0.000027415512,1.8666785e-8,0.8464089,0.0013751206,0.14126696,0.010158611,0.0003838391],"about_ca_topic_score_codex":0.000006501767,"about_ca_topic_score_gemma":0.000009771727,"teacher_disagreement_score":0.89575064,"about_ca_system_score_codex":0.0003972618,"about_ca_system_score_gemma":0.0007170714,"threshold_uncertainty_score":0.99990046},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017159744,0.0004996802,0.9943314,0.0019883302,0.00037127463,0.000598015,0.0000065022223,0.0001174862,0.00037134282],"genre_scores_gemma":[0.5383997,0.00017171753,0.45517224,0.0059638685,0.00008000406,0.000034553006,0.000010134675,0.000036259487,0.0001314879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971303,0.000036531834,0.0004950944,0.0012810793,0.0004617014,0.0005953058],"domain_scores_gemma":[0.99790716,0.0005596018,0.00024822314,0.0011049148,0.000074731666,0.000105392995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010194153,0.0004029263,0.00046927808,0.0005219224,0.00023809331,0.0002587399,0.0025567373,0.0003624268,0.000004846081],"category_scores_gemma":[0.00008485468,0.0004015535,0.00006649933,0.00041949248,0.0005998453,0.00038767498,0.0017031893,0.00068673736,0.0000060846023],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008150742,0.00009119013,0.00056538597,0.00012330743,0.000009044898,0.000016680257,0.0019940312,0.002596201,0.00015956382,0.008882744,0.000018684827,0.985535],"study_design_scores_gemma":[0.00074071536,0.0002508467,0.0015057856,0.00027269562,0.0000062603344,0.00006911202,0.000002404577,0.89420503,0.0016813145,0.0958988,0.0044805524,0.00088649296],"about_ca_topic_score_codex":0.000022793067,"about_ca_topic_score_gemma":0.00011640991,"teacher_disagreement_score":0.9846485,"about_ca_system_score_codex":0.0002448412,"about_ca_system_score_gemma":0.00022533996,"threshold_uncertainty_score":0.99984366},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029429108,0.00062240625,0.9962488,0.0005925226,0.0011249438,0.00046620183,0.00002703811,0.0000978776,0.0007907704],"genre_scores_gemma":[0.015073638,0.000026000936,0.98092735,0.00083067454,0.0006915268,0.000017406963,0.000033824348,0.000023681901,0.0023758796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974705,0.000016272996,0.0003534348,0.0011712224,0.00056004367,0.00042854904],"domain_scores_gemma":[0.99859464,0.00040110637,0.00017342869,0.00049488875,0.00021615873,0.00011977362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004536718,0.00036708915,0.00034644836,0.00063292857,0.00028055772,0.0006620961,0.0010593006,0.00020965232,0.0000065642444],"category_scores_gemma":[0.000041662875,0.00036305643,0.00009741142,0.00039845155,0.0003201884,0.0006380104,0.00043833363,0.00027024283,0.00001035789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015090341,0.000012801218,0.0000036346166,0.0000150507085,0.0000052378537,0.000009588321,0.00014475474,0.042872794,0.000037840167,0.0064559225,0.00013249938,0.9503084],"study_design_scores_gemma":[0.0002685199,0.00015304817,0.00013509399,0.00006413249,0.000006923274,0.000055709785,1.07151024e-7,0.9258098,0.00048189724,0.06265633,0.0099546,0.00041383083],"about_ca_topic_score_codex":0.000016224369,"about_ca_topic_score_gemma":0.000019920011,"teacher_disagreement_score":0.94989455,"about_ca_system_score_codex":0.00012561295,"about_ca_system_score_gemma":0.0003481252,"threshold_uncertainty_score":0.99988216},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002106724,0.0003159524,0.9871428,0.00028762288,0.001725989,0.0003356207,0.0000017331051,0.00006737659,0.009912257],"genre_scores_gemma":[0.84844816,0.00003211113,0.14940998,0.00059166434,0.000561584,0.000012053914,0.0000020585683,0.000032259562,0.00091015163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967001,0.00006405005,0.00081780844,0.0011594879,0.0007249639,0.00053359335],"domain_scores_gemma":[0.99782234,0.00036993893,0.00036154967,0.0011254117,0.00021912593,0.00010160409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00125918,0.00040775986,0.0007118431,0.0009844276,0.000087694214,0.00023623262,0.0026352482,0.00032254405,0.000017373959],"category_scores_gemma":[0.00003996872,0.00035448003,0.00014418748,0.0006410147,0.00039728664,0.00031508086,0.00072624895,0.00061715575,0.000025006597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070751807,0.000035139583,0.0003071067,0.000088366054,0.000009949042,0.000043870532,0.0014194135,0.102081835,0.00022405921,0.08164202,0.00007530479,0.8140659],"study_design_scores_gemma":[0.00041751197,0.00035369577,0.00028575244,0.0014965814,0.000004306817,0.00014028867,4.109156e-7,0.9174484,0.00061642943,0.07172094,0.0067930846,0.0007225971],"about_ca_topic_score_codex":0.00010528479,"about_ca_topic_score_gemma":0.00062727934,"teacher_disagreement_score":0.84823745,"about_ca_system_score_codex":0.00019499483,"about_ca_system_score_gemma":0.00025107627,"threshold_uncertainty_score":0.99989074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030552599,0.00009485657,0.9966551,0.00034701597,0.0012478459,0.000751084,0.000022755676,0.00023746687,0.00064083224],"genre_scores_gemma":[0.0004869871,0.00002956084,0.99644977,0.0019181957,0.00052788155,0.000010214445,0.000038721904,0.00004123124,0.0004974413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965491,0.000027708182,0.0005281097,0.0014070614,0.0006736595,0.0008143264],"domain_scores_gemma":[0.9973382,0.00034817765,0.00021833928,0.0012677376,0.00051964575,0.00030791713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013483585,0.00044641833,0.00041718018,0.0009616802,0.00029765724,0.00069185084,0.003413003,0.00032922713,0.00001709325],"category_scores_gemma":[0.00005149441,0.00042184227,0.00011112486,0.0005850099,0.0003773981,0.0008253335,0.00085849396,0.0006464061,0.0000084646135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029578077,0.00003821274,0.0000016483342,0.000020010672,0.000004973948,0.000012123243,0.00021950102,0.051980205,0.00007134671,0.0017881255,0.000003279481,0.94585764],"study_design_scores_gemma":[0.0003965703,0.00038535488,0.00001103765,0.00011533061,0.000003300103,0.000025317246,1.6186763e-7,0.9757868,0.00022763295,0.019700255,0.002853055,0.00049516384],"about_ca_topic_score_codex":0.000020668058,"about_ca_topic_score_gemma":0.00022927446,"teacher_disagreement_score":0.94536245,"about_ca_system_score_codex":0.00017679,"about_ca_system_score_gemma":0.0005027739,"threshold_uncertainty_score":0.99982333},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003429129,0.0011702422,0.99283236,0.0011461171,0.0013643303,0.00028700454,0.000025225152,0.0002110259,0.0029293941],"genre_scores_gemma":[0.01803179,0.00010459005,0.97704226,0.0024785933,0.00082992396,0.000016224101,0.00005661347,0.000046794416,0.0013931871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996173,0.000034153436,0.00052893744,0.0015540865,0.0010764785,0.0006333438],"domain_scores_gemma":[0.9974622,0.00028923052,0.00028803298,0.0015496465,0.00020431001,0.00020655715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005892234,0.0005006272,0.00042428044,0.0004977263,0.0005056505,0.00090978073,0.003798092,0.00029935053,0.000039895705],"category_scores_gemma":[0.000055525285,0.0004536657,0.00009961015,0.00046261694,0.00036926608,0.0011882049,0.002118342,0.00078788033,0.00006963837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010029598,0.000058962683,0.0000073615624,0.000013282556,0.000006414028,0.000021409865,0.00028322364,0.019480443,0.00030756355,0.021246592,0.0008705557,0.9577032],"study_design_scores_gemma":[0.00029027514,0.00009564328,0.00002093678,0.00024021126,0.00000461596,0.00002615073,5.273639e-8,0.93521756,0.00067055464,0.045929253,0.016878325,0.000626405],"about_ca_topic_score_codex":0.000021899035,"about_ca_topic_score_gemma":0.000029702796,"teacher_disagreement_score":0.9570768,"about_ca_system_score_codex":0.00025955547,"about_ca_system_score_gemma":0.0003713857,"threshold_uncertainty_score":0.9997915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024381964,0.0007612649,0.951417,0.0028505058,0.001241328,0.0006233746,0.000029215267,0.00008051314,0.040558595],"genre_scores_gemma":[0.9692938,0.000081105456,0.027019735,0.0011371662,0.0002692742,0.000015162093,0.000004011443,0.000021999815,0.0021577717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954819,0.00007308092,0.00081329176,0.0015349963,0.0016020761,0.00049465674],"domain_scores_gemma":[0.99611723,0.0018193763,0.00032759842,0.001244543,0.00034961506,0.00014161173],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026014224,0.00039262013,0.000617651,0.0010358267,0.00017529358,0.00037217425,0.003050224,0.0002455037,0.0008340453],"category_scores_gemma":[0.0006690867,0.00031860243,0.00012209422,0.0011483947,0.0019591092,0.00035897546,0.00065982935,0.00071237003,0.0007929526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001433958,0.000050970244,0.0006851796,0.000009235259,0.0000044536973,0.000067045985,0.0020238683,0.03346306,0.00016550573,0.74486476,0.000033423526,0.21861814],"study_design_scores_gemma":[0.00018757714,0.00006278161,0.000946849,0.00026911098,0.0000030110527,0.000016638216,0.000004958029,0.005588916,0.0013629311,0.9834641,0.007699645,0.00039348195],"about_ca_topic_score_codex":0.000054585023,"about_ca_topic_score_gemma":0.00032060329,"teacher_disagreement_score":0.9668556,"about_ca_system_score_codex":0.00023417834,"about_ca_system_score_gemma":0.0004997676,"threshold_uncertainty_score":0.99998504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006435745,0.00039105216,0.99631745,0.0005333761,0.0005964837,0.00068012136,0.00010768252,0.00019885843,0.0011685634],"genre_scores_gemma":[0.0012943796,0.00014913386,0.9965594,0.0013048846,0.00046821198,0.000015865386,0.000056590226,0.000015764132,0.00013580018],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99777573,0.000012144814,0.0004894343,0.00077777385,0.0005311395,0.00041378167],"domain_scores_gemma":[0.997993,0.0002940323,0.00029026362,0.0010423755,0.00025549377,0.00012483014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080767873,0.00036274272,0.00036964676,0.0005936221,0.0002854813,0.00031520956,0.0010243829,0.00019416568,0.000004176318],"category_scores_gemma":[0.00015522509,0.00032154928,0.000058006517,0.00028357044,0.0004738088,0.004836378,0.0010640153,0.00035417476,0.000008835425],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011418149,0.0000053765643,0.0000027510189,0.00008712131,0.0000036160532,0.000005373665,0.00023545571,0.00026340585,0.00011736035,0.23671322,0.00005070981,0.7625042],"study_design_scores_gemma":[0.0005310545,0.0003938286,0.000023309181,0.001009158,0.000012155339,0.0001955453,5.04822e-7,0.2715457,0.010587573,0.062318046,0.652055,0.0013280796],"about_ca_topic_score_codex":0.000009236412,"about_ca_topic_score_gemma":0.00002328543,"teacher_disagreement_score":0.7611761,"about_ca_system_score_codex":0.0001433923,"about_ca_system_score_gemma":0.00027773294,"threshold_uncertainty_score":0.99992365},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043565236,0.0029112296,0.8607563,0.00017514704,0.006012371,0.00041810496,0.000014355156,0.000150118,0.12912677],"genre_scores_gemma":[0.86920774,0.000146907,0.08700725,0.0034698695,0.02120244,0.000037170925,0.000049651295,0.00014987857,0.018729094],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997978,0.000018387555,0.00032077715,0.0006143563,0.00055559527,0.0005129208],"domain_scores_gemma":[0.999009,0.00014671998,0.00015972427,0.00043149706,0.000120682,0.00013237752],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004679331,0.00035504947,0.00038691622,0.0003301981,0.00032299105,0.00042281754,0.0006071122,0.00015877833,0.0010349952],"category_scores_gemma":[0.0000398507,0.00029096825,0.00012169216,0.00006414324,0.00083557836,0.0003379559,0.00025673868,0.0005307571,0.00020443388],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016730777,0.00010902625,0.000028875289,0.00023351036,0.000049388647,0.000033054665,0.0513909,0.0013490639,0.00043320138,0.3525032,0.00040522823,0.5934478],"study_design_scores_gemma":[0.0014467306,0.0007654542,0.00017556302,0.0032235302,0.00024025039,0.00020174807,0.00006834287,0.048095234,0.0052098203,0.28104034,0.65450054,0.0050324346],"about_ca_topic_score_codex":0.000044729222,"about_ca_topic_score_gemma":0.00023804726,"teacher_disagreement_score":0.8687721,"about_ca_system_score_codex":0.00015549592,"about_ca_system_score_gemma":0.00016078711,"threshold_uncertainty_score":0.9999542},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034749155,0.00068516645,0.99314404,0.0006591386,0.0027701862,0.0015907866,0.000008277386,0.00024813044,0.00085955375],"genre_scores_gemma":[0.017894277,0.000036919355,0.97238296,0.008335105,0.0010194287,0.00005493502,0.000020421476,0.000095570285,0.00016040412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99313956,0.00008393184,0.0015556029,0.0024285722,0.0014289111,0.001363404],"domain_scores_gemma":[0.99212426,0.00237976,0.0011234162,0.0026349542,0.0014128627,0.00032474977],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.003963285,0.00087579474,0.0011862093,0.00081210193,0.00039356734,0.00047058766,0.0068000476,0.0008305417,0.000016035045],"category_scores_gemma":[0.00019133842,0.00084044767,0.00028565014,0.0018634483,0.00040661768,0.00079840963,0.0026212672,0.0012867603,0.000018102517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034857796,0.000073773335,0.00006123553,0.00027042406,0.000029695513,0.00002179705,0.00086308917,0.24220757,0.000079152655,0.06512389,0.000030336567,0.6912042],"study_design_scores_gemma":[0.00072586903,0.00016736737,0.00017353838,0.00074514933,0.000012070757,0.000022416274,3.983785e-7,0.9726329,0.000267619,0.023085995,0.0012606748,0.00090599543],"about_ca_topic_score_codex":0.00015985548,"about_ca_topic_score_gemma":0.0017050635,"teacher_disagreement_score":0.73042536,"about_ca_system_score_codex":0.00031544504,"about_ca_system_score_gemma":0.00070827856,"threshold_uncertainty_score":0.9994046},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00102627,0.0014549928,0.9944598,0.000520451,0.0009781318,0.0007280619,0.000012065224,0.0000954794,0.00072476716],"genre_scores_gemma":[0.71236134,0.00018903687,0.28606185,0.00067413936,0.00034278838,0.00007105096,0.000007302933,0.000049861985,0.00024263638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729925,0.000047102938,0.00050515425,0.0010194988,0.00056346005,0.00056550506],"domain_scores_gemma":[0.9966049,0.0015965202,0.00029920627,0.0011261745,0.00024155532,0.00013159889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018725607,0.00040609227,0.0004108787,0.00063548837,0.001087783,0.00053237664,0.0023009665,0.00024124375,0.000008087656],"category_scores_gemma":[0.00016096933,0.0003106578,0.0002075049,0.00066569104,0.0025271447,0.0003814237,0.0007549157,0.0005489438,0.0000037401649],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002520592,0.00002141267,0.00010807141,0.0000778322,0.000015912721,0.000017922119,0.0022557348,0.0019228227,0.00052670203,0.20322452,0.000006695283,0.79179716],"study_design_scores_gemma":[0.0005244012,0.0010107744,0.0006804008,0.0007442417,0.000029929293,0.0002102334,0.0000031093205,0.5926333,0.00047942434,0.39716852,0.005568208,0.00094743713],"about_ca_topic_score_codex":0.0000047021945,"about_ca_topic_score_gemma":0.00003126707,"teacher_disagreement_score":0.79084975,"about_ca_system_score_codex":0.00009167857,"about_ca_system_score_gemma":0.00048953376,"threshold_uncertainty_score":0.99993455},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000075077776,0.0004898005,0.97381884,0.0011023688,0.0012094157,0.0006518646,0.0000040993114,0.00029623942,0.022352288],"genre_scores_gemma":[0.04031106,0.00025828273,0.94531274,0.0027946723,0.0014101483,0.00003885058,0.000013948348,0.00012336581,0.009736926],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942117,0.000074436975,0.00059196027,0.0021613843,0.0017933664,0.0011671998],"domain_scores_gemma":[0.99632686,0.00059857074,0.0002847259,0.0020546035,0.00031778385,0.00041747888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079113897,0.00069848174,0.00066632574,0.001396038,0.00048466073,0.00062787335,0.004427701,0.0003911512,0.00005322049],"category_scores_gemma":[0.000106946805,0.00063413894,0.00022224257,0.0010585311,0.001071092,0.00093332224,0.0012625025,0.0013975698,0.00028544935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026536654,0.000043825523,0.00003827605,0.000020025394,0.000012652751,0.0001971709,0.000782778,0.0071099503,0.00016539174,0.090292,0.0006147554,0.90069664],"study_design_scores_gemma":[0.0008582451,0.0011408322,0.00019969395,0.0006937159,0.0000076222727,0.0003157956,2.2642949e-7,0.055231113,0.0042588264,0.90727,0.028606536,0.0014173817],"about_ca_topic_score_codex":0.00001791326,"about_ca_topic_score_gemma":0.000069820104,"teacher_disagreement_score":0.89927924,"about_ca_system_score_codex":0.00045820398,"about_ca_system_score_gemma":0.0010538162,"threshold_uncertainty_score":0.999611},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009548019,0.00063892,0.9892521,0.0055174762,0.0017900574,0.0006157188,0.00012910574,0.000013822497,0.0020332336],"genre_scores_gemma":[0.093946464,0.0017188612,0.74985135,0.02370234,0.006763624,0.00019554477,0.00009066045,0.00016895465,0.12356221],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957047,0.00006964752,0.0008091686,0.00090251863,0.0021079967,0.00040598467],"domain_scores_gemma":[0.98951197,0.00771038,0.0005200766,0.0019101399,0.00029425495,0.000053161617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009555518,0.00026547865,0.00038518192,0.00022483729,0.0008758458,0.0007816733,0.0048366194,0.00011824974,0.00003151305],"category_scores_gemma":[0.00095110905,0.0001269588,0.00020920396,0.00042521147,0.0021148198,0.0005003261,0.001997638,0.0003354231,0.00002242836],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006741015,0.000012622724,0.0000017145999,0.0000038137987,0.000015152451,0.0000010209276,0.0002612905,0.003545868,0.0000029446915,0.019614344,0.0013067336,0.9752278],"study_design_scores_gemma":[0.00019730821,0.00014311034,0.0001240064,0.000067368084,0.00002816582,0.000003881177,0.0000059427352,0.20619698,0.00023612328,0.38650343,0.40619478,0.00029889614],"about_ca_topic_score_codex":0.00005677484,"about_ca_topic_score_gemma":0.00045439164,"teacher_disagreement_score":0.97492886,"about_ca_system_score_codex":0.000094169576,"about_ca_system_score_gemma":0.00026473327,"threshold_uncertainty_score":0.89877224},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000947122,0.0001952448,0.9944822,0.00042302304,0.00044620497,0.0007360524,0.000025432671,0.0003077389,0.0024369524],"genre_scores_gemma":[0.23622647,0.000051689352,0.7623238,0.00094596896,0.00020377718,0.000020115724,0.000024503832,0.000063031024,0.00014064921],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99581754,0.00005886797,0.0007314955,0.0015097646,0.0012198796,0.0006624767],"domain_scores_gemma":[0.9969294,0.00027533565,0.00065335975,0.0012147092,0.0007386473,0.000188542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007239973,0.00066614256,0.00085426384,0.0013384356,0.00022613825,0.0004419873,0.0022280724,0.00034617507,0.00005523603],"category_scores_gemma":[0.00006742967,0.0005717231,0.00017916349,0.0007708553,0.0010154201,0.0009456958,0.00067976426,0.00091064157,0.000017274007],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006635401,0.0001405999,0.000053607655,0.00019481641,0.00006307455,0.00030204887,0.0005561787,0.002547955,0.0025698817,0.009386712,0.000043248467,0.98407555],"study_design_scores_gemma":[0.0013765425,0.0011562428,0.00013182186,0.0043042256,0.00005364308,0.0006889515,4.4428072e-7,0.040906638,0.17865898,0.77103966,0.00012775,0.0015551185],"about_ca_topic_score_codex":0.0000956369,"about_ca_topic_score_gemma":0.00006744659,"teacher_disagreement_score":0.9825204,"about_ca_system_score_codex":0.00041665678,"about_ca_system_score_gemma":0.0010864598,"threshold_uncertainty_score":0.9996734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035310502,0.00073992065,0.9889631,0.0009769798,0.0011311411,0.00036063578,0.00000614849,0.00005862528,0.0077280845],"genre_scores_gemma":[0.055016767,0.00021136667,0.94242305,0.001511567,0.0003616171,0.000010101847,0.000002546391,0.000025957743,0.00043702102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970803,0.0001257113,0.00048796696,0.0010733306,0.0007819585,0.0004506906],"domain_scores_gemma":[0.9961667,0.0021444347,0.00034900062,0.0010370467,0.00019931095,0.00010347651],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002057252,0.00041685122,0.000640845,0.0006003356,0.0003704163,0.00048749847,0.0026478728,0.00018155936,0.000015632744],"category_scores_gemma":[0.00012433853,0.00029751196,0.00016694365,0.00079849,0.002166649,0.0005399998,0.0016220427,0.0007328316,0.0000032904054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016378419,0.000014782936,0.000027003272,0.0000286237,0.000026575583,0.000032699445,0.003275066,0.006152807,0.000030982083,0.45288724,0.00001676343,0.5374911],"study_design_scores_gemma":[0.0005196847,0.00008857672,0.00003623623,0.0002467924,0.0000107890155,0.000113406684,9.259363e-7,0.51255786,0.00039205013,0.48401922,0.001694984,0.00031948488],"about_ca_topic_score_codex":0.000054924945,"about_ca_topic_score_gemma":0.000043937795,"teacher_disagreement_score":0.5371716,"about_ca_system_score_codex":0.0001178348,"about_ca_system_score_gemma":0.00024565597,"threshold_uncertainty_score":0.9999477},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032989455,0.00017074848,0.9922781,0.00018170741,0.000570931,0.0003942471,0.000013913489,0.00027984905,0.0028115301],"genre_scores_gemma":[0.59870213,0.00006351594,0.40105957,0.000059594724,0.000040141895,0.000009937066,7.64122e-7,0.000020924703,0.000043428052],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.995871,0.00003589409,0.0007709051,0.0014002502,0.0012962184,0.0006257391],"domain_scores_gemma":[0.99588186,0.00070467254,0.00090202957,0.0016788322,0.0007137038,0.00011890789],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006523761,0.00059902976,0.0010442764,0.00070281286,0.0002297193,0.00016601718,0.0038392001,0.00044796738,0.000020138483],"category_scores_gemma":[0.00017725778,0.00048010313,0.00014476386,0.00079962297,0.0017054217,0.0006831939,0.0015821082,0.0012553491,0.000004350009],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015692766,0.00004833816,0.000061420666,0.00016233262,0.00004415224,0.00003565473,0.0013235647,0.020933826,0.059055384,0.12958916,0.000006604019,0.7885826],"study_design_scores_gemma":[0.0006587993,0.00062541675,0.0000280816,0.003008629,0.00001616621,0.000056995854,0.0000046590612,0.089141354,0.76307017,0.14254135,0.0000829818,0.00076541223],"about_ca_topic_score_codex":0.000016338558,"about_ca_topic_score_gemma":0.000040778068,"teacher_disagreement_score":0.78781724,"about_ca_system_score_codex":0.00015682804,"about_ca_system_score_gemma":0.00056933163,"threshold_uncertainty_score":0.99976504},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16459477,0.0014863964,0.8270942,0.001252556,0.0007418006,0.0033899574,0.00017223295,0.00011755618,0.0011505492],"genre_scores_gemma":[0.99942344,0.00002329205,0.0003502434,0.00008365781,0.00003967614,0.000060584887,0.0000026731977,0.0000016147617,0.000014805444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998703,0.00004681581,0.00037032503,0.00043517567,0.00024338778,0.00020131133],"domain_scores_gemma":[0.9971484,0.0022472988,0.00023234672,0.00017848691,0.00016154606,0.000031943488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081840355,0.00019069921,0.0004213233,0.000040934385,0.00012562881,0.000045222998,0.00039340582,0.00030696206,0.0000070097053],"category_scores_gemma":[0.00013589018,0.00006619017,0.00006141571,0.00016317364,0.00061681756,0.000048618982,0.00006750919,0.00019409624,7.139818e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026691295,0.00018557173,0.00025968783,0.0005556895,0.00008525257,0.0000022784977,0.00015344801,0.033305068,0.012314838,0.47312692,0.00004059437,0.47970375],"study_design_scores_gemma":[0.00024200423,0.0011756526,0.00031403598,0.00075458834,0.00007876689,0.00001643737,0.000007684126,0.70139325,0.002221603,0.29296282,0.00036729663,0.0004658584],"about_ca_topic_score_codex":0.000033514698,"about_ca_topic_score_gemma":0.000031358548,"teacher_disagreement_score":0.8348287,"about_ca_system_score_codex":0.000026462132,"about_ca_system_score_gemma":0.00001173156,"threshold_uncertainty_score":0.26991567},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030410269,0.0003779348,0.9831117,0.00013493243,0.0025287832,0.0004437503,0.000001974379,0.00019460797,0.010165289],"genre_scores_gemma":[0.83942556,0.0000068629365,0.15550078,0.00072029047,0.0015237795,0.00002425573,0.000010824273,0.00009456378,0.0026930545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996563,0.00050412264,0.00039676292,0.0013538329,0.0003561162,0.000826131],"domain_scores_gemma":[0.9958262,0.0027746942,0.000441535,0.00068633957,0.00019433901,0.000076923236],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006722058,0.0005287844,0.0006280294,0.0006539142,0.0005483293,0.00019846667,0.0008786312,0.00059281033,0.00032336623],"category_scores_gemma":[0.0007452357,0.0004952995,0.00020264491,0.00042439756,0.0007284456,0.00014834454,0.0002540192,0.0031198196,0.000045676406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008025985,0.000025332363,0.00027952704,0.000019277933,0.000045589404,0.000027571903,0.002221415,0.19508915,0.00006544669,0.052642938,0.0000039012266,0.7494996],"study_design_scores_gemma":[0.002773524,0.002870251,0.008558642,0.001974063,0.00017714918,0.00026387975,0.000005224052,0.14796449,0.0006066272,0.81690866,0.014028434,0.003869034],"about_ca_topic_score_codex":0.00005417321,"about_ca_topic_score_gemma":0.0000075032676,"teacher_disagreement_score":0.83638453,"about_ca_system_score_codex":0.00047592755,"about_ca_system_score_gemma":0.00036236082,"threshold_uncertainty_score":0.99974984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021899166,0.00024118074,0.995196,0.00022616102,0.0013757041,0.00031818383,0.000007009869,0.000053528995,0.0023632392],"genre_scores_gemma":[0.66568816,0.00007059826,0.3291735,0.00037581872,0.003453924,0.00002883541,0.000009481661,0.000059023794,0.0011406497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99339527,0.000038629816,0.0006879632,0.00075184676,0.0043547675,0.00077155355],"domain_scores_gemma":[0.9961013,0.0014188783,0.0003869868,0.0010953251,0.0007427329,0.00025474056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025660144,0.0003610972,0.00043629933,0.001258658,0.0002954704,0.0008798486,0.0021294905,0.00022570316,0.00010858164],"category_scores_gemma":[0.0008787677,0.0002445064,0.00007478316,0.00089960743,0.0009081747,0.0027598115,0.00077511,0.0008828966,0.0005192742],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018305838,0.0000061682176,0.00043700272,0.000004878087,0.0000035876592,0.000014778633,0.0004874066,0.0680882,0.00001473089,0.00020406679,0.000007859953,0.930713],"study_design_scores_gemma":[0.0020101974,0.0011186854,0.007324367,0.001184528,0.00003588248,0.00038107246,0.000011890296,0.43886012,0.02440495,0.41129795,0.109953925,0.0034164211],"about_ca_topic_score_codex":0.000013854209,"about_ca_topic_score_gemma":0.000019867826,"teacher_disagreement_score":0.9272966,"about_ca_system_score_codex":0.00031203724,"about_ca_system_score_gemma":0.00046849638,"threshold_uncertainty_score":0.99706817},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014031371,0.00007400086,0.98957413,0.0035578369,0.00034847384,0.0005774169,0.000025973455,0.00015209847,0.00554973],"genre_scores_gemma":[0.07435758,0.00014146365,0.91234434,0.0096745435,0.0007681238,0.000043042415,0.000025083487,0.00004829787,0.0025975225],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957133,0.000028392042,0.00031365725,0.0016770215,0.0014671809,0.0008004601],"domain_scores_gemma":[0.9966489,0.00047939626,0.00009646475,0.0019309755,0.00031890947,0.0005253542],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004613703,0.00036859975,0.0003553123,0.00094251573,0.0002769761,0.0031295377,0.007827261,0.00018442955,0.000058551705],"category_scores_gemma":[0.00013120881,0.00034237097,0.00010038681,0.0010813347,0.0003588422,0.0015554983,0.0034484714,0.0007036847,0.00042574547],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037821467,0.000027315835,0.000041607393,0.0000037993923,0.000005713532,0.00006743591,0.00015055318,0.003813709,0.000115270035,0.013434121,0.0002911236,0.9820456],"study_design_scores_gemma":[0.00051623967,0.0004006993,0.008961543,0.00061843666,0.000010715397,0.000024234616,1.4453421e-7,0.2527425,0.003703576,0.6433122,0.087900735,0.0018089871],"about_ca_topic_score_codex":0.00028223483,"about_ca_topic_score_gemma":0.00013916635,"teacher_disagreement_score":0.9802366,"about_ca_system_score_codex":0.00027455483,"about_ca_system_score_gemma":0.0007130571,"threshold_uncertainty_score":0.99990284},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57742757,0.00009221317,0.4183846,0.003160533,0.000522673,0.00030327894,0.0000017512895,0.000065561304,0.000041829877],"genre_scores_gemma":[0.9066068,0.0000031450263,0.0908749,0.0019201151,0.0005456144,0.000020025607,0.0000014483597,0.000011442093,0.000016535381],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99787956,0.000024655075,0.00035380336,0.0005879838,0.0006790517,0.00047493237],"domain_scores_gemma":[0.999146,0.00003778559,0.00006799737,0.0004982012,0.0000684961,0.00018150784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043302745,0.00019630391,0.0002551241,0.00027760607,0.00007902311,0.00007318157,0.00012676916,0.00006619225,0.00010835483],"category_scores_gemma":[0.00011944146,0.00015888116,0.000081658196,0.0005140711,0.00028351456,0.00019803875,0.00021220757,0.00025691598,0.000066952955],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102895734,0.0003421443,0.044851717,0.000046418467,0.000017473283,0.00007262755,0.0023096781,0.05808175,0.0087638525,0.000012887858,0.000032156022,0.8853664],"study_design_scores_gemma":[0.0022562346,0.0012920127,0.66398233,0.00035434138,0.000020813619,0.00038202025,0.000004491654,0.2931397,0.037768554,0.00019957812,0.00026882873,0.0003310839],"about_ca_topic_score_codex":0.000013544718,"about_ca_topic_score_gemma":0.000042969918,"teacher_disagreement_score":0.88503534,"about_ca_system_score_codex":0.0003883785,"about_ca_system_score_gemma":0.00014487532,"threshold_uncertainty_score":0.64789855},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011450702,0.00017037729,0.9803411,0.000512849,0.0008620233,0.016993115,0.000029311654,0.00020551521,0.0008845906],"genre_scores_gemma":[0.00039025757,0.000009865532,0.9908603,0.0006933501,0.00035399504,0.0072915703,0.000045344193,0.00005421132,0.00030111359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603546,0.00013070724,0.00085413654,0.0015240111,0.00069157867,0.00076410844],"domain_scores_gemma":[0.9945292,0.0015651817,0.00071177515,0.002503268,0.00056766707,0.00012292704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0041217064,0.0005422092,0.00065672956,0.00064371695,0.00044869896,0.0007134167,0.004827849,0.0004367228,0.0000028088841],"category_scores_gemma":[0.00048239084,0.0005317312,0.00023693222,0.0005220952,0.0004051118,0.0008445714,0.0009873083,0.0005692907,0.0000073617975],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002935384,0.00005044635,0.000004325829,0.0002521063,0.00001244535,0.000002221482,0.00058632734,0.049209554,0.00043339623,0.1351824,0.00019453932,0.81404287],"study_design_scores_gemma":[0.00044033874,0.0002386528,0.000020257623,0.00037739376,0.0000104454475,0.000017039803,1.05332326e-7,0.73397833,0.0042454298,0.22410522,0.036058094,0.00050867366],"about_ca_topic_score_codex":0.000043857104,"about_ca_topic_score_gemma":0.00004658515,"teacher_disagreement_score":0.8135342,"about_ca_system_score_codex":0.00057570846,"about_ca_system_score_gemma":0.0005370365,"threshold_uncertainty_score":0.9997134},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002667356,0.00046431352,0.9847532,0.00080339797,0.0017513827,0.00036137743,0.0000047540784,0.0001847853,0.011410056],"genre_scores_gemma":[0.32100892,0.000073703464,0.67216736,0.0020136377,0.0018526508,0.000018209792,0.00004021046,0.000050404287,0.0027748952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964392,0.00004260402,0.0005850858,0.0013856032,0.0010230516,0.00052446086],"domain_scores_gemma":[0.9980052,0.00032750767,0.00022921394,0.0010317294,0.00022202796,0.00018430279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006363983,0.0004616797,0.00044579452,0.0012365248,0.0004266519,0.0006428998,0.001982324,0.0002694255,0.000114830844],"category_scores_gemma":[0.00006028438,0.0004498847,0.00015748544,0.000993447,0.00031251664,0.00082952215,0.000469887,0.0005374253,0.00013098474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054412453,0.000025604106,0.000023075341,0.00001028619,0.000011050146,0.000032157357,0.00046835898,0.1548488,0.00012062323,0.027344765,0.000035278397,0.81707454],"study_design_scores_gemma":[0.00039706376,0.0000984557,0.0003056316,0.00017901533,0.000011132698,0.00007807382,5.2285074e-8,0.7315187,0.0007475619,0.25717956,0.008884443,0.0006002948],"about_ca_topic_score_codex":0.000011105281,"about_ca_topic_score_gemma":0.000030500474,"teacher_disagreement_score":0.81647426,"about_ca_system_score_codex":0.0002256957,"about_ca_system_score_gemma":0.0007370292,"threshold_uncertainty_score":0.9997953},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007102505,0.00021369816,0.9921347,0.00038968446,0.0010666362,0.0043203537,0.000020664676,0.0006473505,0.0011359154],"genre_scores_gemma":[0.03705348,0.000045975048,0.96089417,0.0007015063,0.00057647517,0.00059299316,0.000011137863,0.00004981679,0.00007442628],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959282,0.000057479636,0.00061994797,0.001795258,0.0007276776,0.00087139505],"domain_scores_gemma":[0.996863,0.00072712445,0.0004651825,0.0013599509,0.00040764434,0.00017711296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010472651,0.0006934841,0.0006985994,0.0010445144,0.00042517766,0.00060289376,0.003163901,0.00045730534,0.0000049272085],"category_scores_gemma":[0.00009276043,0.0006271537,0.00028985232,0.00061299297,0.0006450653,0.0012835759,0.0009775959,0.0006846673,0.00001692909],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043464046,0.00004631197,0.000018596047,0.00013080449,0.000022182554,0.000039641538,0.0008266429,0.0034339114,0.0016367412,0.1354331,0.00003603316,0.8583326],"study_design_scores_gemma":[0.0008731167,0.00087334006,0.00007684718,0.0011817408,0.00002447809,0.00011222153,2.5267647e-7,0.3416712,0.038273003,0.5865085,0.02884607,0.0015592393],"about_ca_topic_score_codex":0.0000037910106,"about_ca_topic_score_gemma":0.00001783431,"teacher_disagreement_score":0.8567733,"about_ca_system_score_codex":0.0005316729,"about_ca_system_score_gemma":0.00021133832,"threshold_uncertainty_score":0.999618},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012400611,0.000038012946,0.99616843,0.00088774355,0.0010709402,0.00045331914,0.00009216659,0.000938287,0.00022708428],"genre_scores_gemma":[0.019655056,0.0000049637565,0.97879237,0.0011752348,0.00018823148,0.000039445396,0.000021641603,0.000040571802,0.00008246696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670017,0.0000150992355,0.0004985723,0.0012356056,0.0010051477,0.0005453944],"domain_scores_gemma":[0.9976681,0.00023382524,0.00012538106,0.0013978182,0.00029988258,0.00027500236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046591117,0.0005106122,0.0004172994,0.0011043329,0.00021924205,0.0004045126,0.0030456395,0.0003484313,0.00001898201],"category_scores_gemma":[0.000017317825,0.00051303295,0.00013852253,0.00056406186,0.0002371582,0.0006167921,0.0004688022,0.0010680709,0.000037148995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002665095,0.000015712072,0.0000033267393,0.0000080557975,0.0000047378494,0.000008444182,0.0005750106,0.703133,0.00053104764,0.007627342,0.000028702094,0.28806198],"study_design_scores_gemma":[0.000101790516,0.00005373614,0.000013125204,0.00013645453,0.000003894146,0.0000061907067,6.2799397e-9,0.8565473,0.00980221,0.1277554,0.0050720884,0.0005077854],"about_ca_topic_score_codex":0.000081100974,"about_ca_topic_score_gemma":0.00018403656,"teacher_disagreement_score":0.2875542,"about_ca_system_score_codex":0.00030687783,"about_ca_system_score_gemma":0.00078942144,"threshold_uncertainty_score":0.99973214},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011350002,0.00077757146,0.9950448,0.0004793033,0.0012726374,0.00057468534,0.0000039835254,0.000121061144,0.0016124042],"genre_scores_gemma":[0.19245602,0.00003793171,0.80528367,0.0015820109,0.0002990939,0.00005879152,0.000006556558,0.000051051,0.00022485417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961208,0.000043814303,0.0006569925,0.0016798851,0.0006460292,0.0008524553],"domain_scores_gemma":[0.9977419,0.00063327706,0.0002452651,0.0009681404,0.00023780117,0.00017363987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014363948,0.0005320767,0.00058118807,0.0007614091,0.00020417245,0.0005253743,0.0024617242,0.0003444185,0.0000049506866],"category_scores_gemma":[0.00032256823,0.0005052181,0.0001204654,0.0005312188,0.00036201137,0.00038930355,0.0005450421,0.00086018007,0.000010085782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001293686,0.0000467994,0.00009504079,0.000117084295,0.000010001018,0.0000783212,0.0019711119,0.39306867,0.00004035834,0.15386303,0.00004620349,0.45065045],"study_design_scores_gemma":[0.00015870538,0.00014770293,0.000026378633,0.00093369855,0.000004541532,0.000036258738,3.1990072e-7,0.7116536,0.0004056266,0.2855846,0.0005287509,0.00051984016],"about_ca_topic_score_codex":0.00002207735,"about_ca_topic_score_gemma":0.000053406402,"teacher_disagreement_score":0.4501306,"about_ca_system_score_codex":0.0004030046,"about_ca_system_score_gemma":0.00057137676,"threshold_uncertainty_score":0.99973994},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036038575,0.00027721436,0.98321396,0.0003618948,0.0011337071,0.00043607378,0.000018621062,0.0002675619,0.014254951],"genre_scores_gemma":[0.35611624,0.000024474848,0.6396579,0.003070348,0.00055543263,0.000017376384,0.000048414957,0.00005858251,0.00045121025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941976,0.000047951005,0.00070828915,0.0021601273,0.001842288,0.0010437542],"domain_scores_gemma":[0.99606574,0.0004325897,0.00047042387,0.0023663219,0.00035684247,0.00030808456],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015866911,0.00075224653,0.0010090007,0.0021796732,0.000298174,0.0011080382,0.004124412,0.0004319023,0.000038283124],"category_scores_gemma":[0.000021460452,0.00056212675,0.00027183234,0.0029350587,0.00072473165,0.00052310934,0.0006791701,0.0008405492,0.000065444576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023137723,0.000059975882,0.0008298977,0.00008316598,0.00018391377,0.0010864985,0.00043519278,0.7756211,0.0000055927458,0.011204547,0.00014622652,0.21032071],"study_design_scores_gemma":[0.00042463845,0.0004051336,0.00022496458,0.00015209807,0.00009696784,0.00008007702,1.7705133e-7,0.98801446,0.000039364713,0.0034097428,0.0062664477,0.0008858997],"about_ca_topic_score_codex":0.00008804337,"about_ca_topic_score_gemma":0.00026421546,"teacher_disagreement_score":0.35608017,"about_ca_system_score_codex":0.00035201968,"about_ca_system_score_gemma":0.0010846793,"threshold_uncertainty_score":0.9999289},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040139118,0.00046578434,0.99553114,0.00019565088,0.00019737754,0.0003132658,0.000001104829,0.00020851557,0.0026857818],"genre_scores_gemma":[0.09430722,0.000107546715,0.9047968,0.00031892565,0.0001623002,0.0000086971895,0.000006678712,0.000024774848,0.00026710297],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974393,0.00004240869,0.0004754387,0.0011013628,0.0005277941,0.0004136862],"domain_scores_gemma":[0.998766,0.0002999584,0.0003074107,0.00041432737,0.00013906455,0.00007326213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007292852,0.0003728659,0.000379983,0.00078036246,0.00019259767,0.0005497529,0.0009248946,0.00018658956,0.0000038582384],"category_scores_gemma":[0.00011422508,0.00035978542,0.00004823689,0.0006045683,0.00045318794,0.0013775504,0.00092854875,0.0008221763,0.000005252966],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029963496,0.000011894771,0.0010995027,0.000034478697,0.0000017196654,0.00010349526,0.00035267824,0.0023449697,0.0025187556,0.00226346,0.000008227118,0.99125785],"study_design_scores_gemma":[0.000582611,0.000590005,0.0009930155,0.0010768606,0.000007488066,0.00011770229,0.0000017012626,0.43839568,0.06877055,0.487133,0.0008926407,0.0014387376],"about_ca_topic_score_codex":0.000049901424,"about_ca_topic_score_gemma":0.000056307395,"teacher_disagreement_score":0.9898191,"about_ca_system_score_codex":0.00022720596,"about_ca_system_score_gemma":0.00015798249,"threshold_uncertainty_score":0.99988544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013511997,0.00019722442,0.9912953,0.00027136458,0.0028514932,0.0036486757,0.000094614436,0.00019787042,0.00009225037],"genre_scores_gemma":[0.69804925,0.00004540714,0.3004524,0.00034095036,0.00077156984,0.00019774225,0.00006797616,0.00006247437,0.000012224343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946075,0.000068557936,0.0011564472,0.0021766769,0.00095971004,0.0010310803],"domain_scores_gemma":[0.9912742,0.004856928,0.0006666188,0.002040737,0.000937323,0.00022419676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024387476,0.0007801173,0.0013294487,0.00051470747,0.00044480624,0.00032320808,0.0032077895,0.001049028,0.000003441837],"category_scores_gemma":[0.00036487362,0.00072659965,0.0005866151,0.0005356137,0.0009222539,0.0003253323,0.00055488414,0.0013115263,0.0000014346768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051434065,0.0000743807,0.000004827485,0.00012951107,0.00002722293,0.00000261859,0.00026638285,0.84096164,0.00024811545,0.048697475,0.0000110603505,0.10906243],"study_design_scores_gemma":[0.002793692,0.00023719418,0.0000014842414,0.00028058176,0.00002373242,0.000010280309,1.7548832e-7,0.7416962,0.0014771334,0.25287834,0.00009045746,0.0005107287],"about_ca_topic_score_codex":0.000014755974,"about_ca_topic_score_gemma":0.000054164302,"teacher_disagreement_score":0.69669807,"about_ca_system_score_codex":0.0002224708,"about_ca_system_score_gemma":0.00030106842,"threshold_uncertainty_score":0.9995185},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015650693,0.0014382327,0.99578506,0.00014297102,0.00071309105,0.0012176733,0.00015917634,0.00025717574,0.0001301197],"genre_scores_gemma":[0.019242015,0.00077152,0.97851825,0.0005866781,0.00046004253,0.00007866433,0.00021544003,0.000064468935,0.000062919935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950303,0.00011640288,0.0006248639,0.0025103437,0.000988546,0.0007295742],"domain_scores_gemma":[0.9969506,0.0006414755,0.0003937105,0.0009573701,0.00073914166,0.0003176937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062647014,0.0007156242,0.00067277823,0.00096326094,0.0007476982,0.0003881913,0.001550761,0.00018527472,0.0000065262807],"category_scores_gemma":[0.00013053432,0.0007220074,0.000112701004,0.00067630113,0.0009818742,0.0024844082,0.0010549371,0.0005462717,0.0000029158507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024406989,0.00010169613,0.00004621166,0.00007116547,0.000018769431,0.00003212617,0.0010890717,0.6102181,0.00004878913,0.0024798212,0.000044201486,0.3858256],"study_design_scores_gemma":[0.0007883789,0.0002642701,0.00026006612,0.00017370691,0.000016833676,0.00021828442,0.000002283144,0.9937702,0.00014066798,0.003201485,0.00036895517,0.0007948971],"about_ca_topic_score_codex":0.00014265138,"about_ca_topic_score_gemma":0.00003150982,"teacher_disagreement_score":0.38503072,"about_ca_system_score_codex":0.00057184533,"about_ca_system_score_gemma":0.0007841831,"threshold_uncertainty_score":0.9995231},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056951365,0.00011271529,0.99126834,0.0015604048,0.000978417,0.0004364473,0.000012543231,0.00014248435,0.0054316726],"genre_scores_gemma":[0.013839659,0.000018597268,0.9835495,0.0016341002,0.0004411904,0.000009125343,0.000030321296,0.000035840312,0.0004416954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597716,0.00006179186,0.0005301783,0.0013686146,0.0013011786,0.00076106365],"domain_scores_gemma":[0.99782795,0.00041811637,0.00022888016,0.0010043642,0.00033331438,0.00018735607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016742684,0.00052273856,0.00049938116,0.0007357326,0.0006207327,0.00092211145,0.0023449345,0.00026278922,0.00008963582],"category_scores_gemma":[0.00003915741,0.00042230275,0.00011323786,0.00059012306,0.0010147562,0.0014721738,0.00046391055,0.0012802146,0.000034697845],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009448041,0.000111481495,0.000046936457,0.00015802823,0.00005404345,0.0004929874,0.0016899456,0.007628768,0.03477747,0.09197768,0.0002298066,0.8627384],"study_design_scores_gemma":[0.0017247398,0.0005710383,0.00023696435,0.00068649184,0.000029093719,0.00052459486,4.251449e-7,0.6613115,0.03548041,0.2923418,0.0056475466,0.0014454004],"about_ca_topic_score_codex":0.00005597734,"about_ca_topic_score_gemma":0.00019310565,"teacher_disagreement_score":0.86129296,"about_ca_system_score_codex":0.00026357968,"about_ca_system_score_gemma":0.000675871,"threshold_uncertainty_score":0.99982285},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013339688,0.0011728517,0.9903098,0.0005084624,0.0006401774,0.00036273117,0.0000055214514,0.00068153517,0.006305615],"genre_scores_gemma":[0.05686737,0.00004950909,0.94059366,0.0010906524,0.0003259769,0.000013846262,0.000004996387,0.000041140705,0.0010128693],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961625,0.000022779424,0.00038706706,0.0015268772,0.0013016388,0.0005991889],"domain_scores_gemma":[0.99784386,0.00013795418,0.0002868601,0.0013568732,0.00022310702,0.00015134207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044221585,0.0005274549,0.0004031505,0.00075991306,0.00023652968,0.00069206423,0.0032866457,0.00033622226,0.000023295184],"category_scores_gemma":[0.000038170572,0.00041172653,0.000070896516,0.0006725688,0.000536557,0.0010696298,0.0009870002,0.00084287947,0.00004107328],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072465036,0.000040369112,0.00008436038,0.00005372314,0.000016460783,0.00022915384,0.0006398406,0.0015530633,0.00022521311,0.029758804,0.00016221138,0.96722955],"study_design_scores_gemma":[0.00056720374,0.0008291754,0.000079101395,0.0018723098,0.00002496263,0.00056076614,1.3604098e-7,0.2663314,0.011125857,0.7136352,0.003353334,0.0016205272],"about_ca_topic_score_codex":0.000014128954,"about_ca_topic_score_gemma":0.000013650437,"teacher_disagreement_score":0.965609,"about_ca_system_score_codex":0.00038559872,"about_ca_system_score_gemma":0.00021791813,"threshold_uncertainty_score":0.99983346},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004536986,0.0013177459,0.987713,0.00020334253,0.0005036142,0.00024564177,0.000016714288,0.000020459236,0.005442528],"genre_scores_gemma":[0.8367336,0.0027965857,0.15547562,0.002542109,0.0014144847,0.0000070170313,0.00014191348,0.00006986268,0.0008188429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986466,0.000010890375,0.0002754519,0.000543987,0.00019885607,0.00032418818],"domain_scores_gemma":[0.9992317,0.000033337215,0.00013815315,0.00042932405,0.000063322055,0.000104154955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028519696,0.0002765463,0.00025462997,0.00013496478,0.00017669544,0.00008651715,0.0004300625,0.00032767156,0.000008572135],"category_scores_gemma":[0.000019560735,0.00025319096,0.000065833374,0.00006872795,0.0009287929,0.000007704375,0.00049159577,0.0003158124,0.000007051917],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005008763,0.00006746518,0.00042950906,0.00014134194,0.00005352667,0.000050232018,0.0010340246,0.003361478,0.0028153583,0.0026402157,0.0011667734,0.98819],"study_design_scores_gemma":[0.0037346259,0.0058382275,0.0011726893,0.002160691,0.00009999533,0.0021486918,0.000006879392,0.50648445,0.02403547,0.20791768,0.23852043,0.00788017],"about_ca_topic_score_codex":0.000010584172,"about_ca_topic_score_gemma":0.00007466489,"teacher_disagreement_score":0.98030984,"about_ca_system_score_codex":0.000038435235,"about_ca_system_score_gemma":0.000155389,"threshold_uncertainty_score":0.999992},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015141837,0.0011422206,0.9880953,0.0010708608,0.002100285,0.0006638996,0.0000034532525,0.00040238386,0.0065064626],"genre_scores_gemma":[0.58247536,0.00014278998,0.41062376,0.002400932,0.0017638643,0.00015514159,0.000013353294,0.00011675172,0.0023080667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964029,0.00009787968,0.0005824405,0.0014421915,0.00084362185,0.00063096615],"domain_scores_gemma":[0.99712133,0.00037865958,0.00036417902,0.0017417651,0.00025195954,0.0001420877],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010924673,0.0005309111,0.00042239454,0.00040211328,0.00071041076,0.0012158877,0.0033349341,0.00030580763,0.0000050749013],"category_scores_gemma":[0.00003419101,0.00036491884,0.00013457102,0.00038047947,0.0005082926,0.0009837566,0.0008762224,0.0007261214,0.000013903027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008531793,0.000028973347,0.000022966486,0.000011476426,0.000009997165,0.000038646154,0.000449398,0.0016814145,0.000050135688,0.044876296,0.0004606537,0.9523615],"study_design_scores_gemma":[0.00023082379,0.0006264554,0.000087799504,0.00024668683,0.0000061346104,0.0001599849,5.5422663e-7,0.7967335,0.0018730306,0.18151161,0.01767949,0.00084391097],"about_ca_topic_score_codex":0.0004923299,"about_ca_topic_score_gemma":0.0009103708,"teacher_disagreement_score":0.9515176,"about_ca_system_score_codex":0.00039862626,"about_ca_system_score_gemma":0.00032462284,"threshold_uncertainty_score":0.99988025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017261776,0.00027174954,0.9903883,0.000099158155,0.0016647334,0.0004846582,0.0000066919933,0.00021001487,0.006702078],"genre_scores_gemma":[0.19277021,0.00003054362,0.8066786,0.00011397764,0.00021387637,0.000014209385,0.0000035906717,0.000027080465,0.00014792966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960442,0.00006867409,0.000896519,0.0012177236,0.0011286307,0.0006442616],"domain_scores_gemma":[0.9964301,0.00023382923,0.0007519247,0.0020704272,0.00037620464,0.00013749734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016120153,0.00046053756,0.00059255154,0.0009033837,0.00020835407,0.0002363311,0.0037937888,0.00039184385,0.000013981841],"category_scores_gemma":[0.00010454178,0.0004452678,0.00014427531,0.0008156923,0.000550158,0.0010689192,0.0008391885,0.0006338531,0.000059211874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005562157,0.000037942613,0.000024438963,0.00021665788,0.0000125720435,0.000014674831,0.00076506217,0.010326619,0.0003834669,0.1825951,0.00001857153,0.80559933],"study_design_scores_gemma":[0.00021902399,0.00021051256,0.00021321994,0.00045930396,0.000010542213,0.00013405953,3.4613754e-7,0.9822006,0.0074754404,0.0074529015,0.0011039716,0.00052005734],"about_ca_topic_score_codex":0.000015152136,"about_ca_topic_score_gemma":0.000004947465,"teacher_disagreement_score":0.971874,"about_ca_system_score_codex":0.0004520679,"about_ca_system_score_gemma":0.00027298435,"threshold_uncertainty_score":0.9997999},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006193752,0.0001052781,0.9889783,0.00026126934,0.00038260166,0.0007936838,0.0000020189573,0.00003924507,0.0032437977],"genre_scores_gemma":[0.8321572,0.0000126373325,0.16597445,0.0010386626,0.00014074333,0.000018256012,0.00000554942,0.000024228502,0.0006282645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495524,0.000088555484,0.00081447914,0.00090800377,0.002833541,0.00040018832],"domain_scores_gemma":[0.9969582,0.00082211324,0.0007727716,0.0006267973,0.0006905696,0.00012954857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008052346,0.00035336736,0.00041726293,0.0009159802,0.00033679671,0.00095020473,0.0010739706,0.00014291819,0.00024638762],"category_scores_gemma":[0.00035568437,0.00024374168,0.00006820771,0.00030854752,0.00042841665,0.0009836841,0.0004216204,0.00036362134,0.000054866454],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003422267,0.0000133379535,0.0014641439,0.000010753417,0.00001126854,0.000022047117,0.003880714,0.02101945,0.000038769384,0.0012774157,0.000023657205,0.9722042],"study_design_scores_gemma":[0.0010132806,0.000517331,0.0075992467,0.0005393805,0.00012957837,0.00009353984,0.000015986852,0.77123666,0.00037229495,0.21640176,0.0009928606,0.0010881125],"about_ca_topic_score_codex":0.000028328443,"about_ca_topic_score_gemma":0.00016132728,"teacher_disagreement_score":0.9711161,"about_ca_system_score_codex":0.00012465981,"about_ca_system_score_gemma":0.0004782761,"threshold_uncertainty_score":0.9939497},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18222077,0.00009026705,0.815134,0.0012388127,0.0010259305,0.00022604555,6.0267786e-7,0.0000477377,0.000015830776],"genre_scores_gemma":[0.6225826,0.000001968342,0.37518248,0.0018552943,0.00036546364,0.000002107876,0.0000019641025,0.0000060835046,0.0000020064708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858725,0.00006248983,0.00020928566,0.0004274195,0.00036864626,0.00034492477],"domain_scores_gemma":[0.99908453,0.00022375616,0.00008286794,0.00041725102,0.00009627407,0.00009530518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046346965,0.00016814873,0.00022179932,0.00014952965,0.00029706914,0.00009059306,0.00023506107,0.00007832216,0.00001798635],"category_scores_gemma":[0.000052441035,0.00009944522,0.000074684176,0.00092913286,0.00019921464,0.00017192725,0.00013764546,0.0003046756,0.000010507511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021952996,0.000110756235,0.00796488,0.0000050799076,0.000011169265,0.000014594068,0.00043664654,0.08794328,0.00058876607,0.000004373566,0.000017170303,0.9028813],"study_design_scores_gemma":[0.00055146014,0.00013666846,0.045420043,0.00006832279,0.00002782358,0.00087787904,0.0000010337855,0.9418635,0.010485533,0.00018539059,0.0002740764,0.00010828913],"about_ca_topic_score_codex":0.00021885145,"about_ca_topic_score_gemma":0.00019340187,"teacher_disagreement_score":0.902773,"about_ca_system_score_codex":0.00030524528,"about_ca_system_score_gemma":0.00016076771,"threshold_uncertainty_score":0.40552583},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41015452,0.00006416342,0.5883872,0.0009694195,0.00015926656,0.00020426212,0.0000014239694,0.000031997977,0.0000277862],"genre_scores_gemma":[0.9052475,9.993763e-7,0.092563465,0.002044879,0.000115546674,0.000014903179,0.0000035657856,0.0000062258264,0.0000028756822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988464,0.000013542184,0.00014524181,0.00044067408,0.0002148838,0.00033922977],"domain_scores_gemma":[0.9995545,0.0001414423,0.000029071445,0.00016260889,0.000041997646,0.00007035889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010509929,0.00012319162,0.00018242383,0.000097282864,0.00010344223,0.00004677895,0.00015138702,0.000055178858,0.0000051245897],"category_scores_gemma":[0.000086660315,0.00008447036,0.000063088046,0.000391621,0.00019050497,0.00005693569,0.000075085416,0.00013307818,0.000003439104],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005849434,0.0022695356,0.42774397,0.00008711459,0.000016666414,0.0013902023,0.00036004404,0.11074146,0.012187964,0.0004139966,0.00012995215,0.44407415],"study_design_scores_gemma":[0.0037864598,0.0011813858,0.4004653,0.000052051113,0.000013937479,0.00007203596,2.131771e-7,0.57603973,0.005942154,0.01202632,0.0002285151,0.00019188781],"about_ca_topic_score_codex":0.000039085724,"about_ca_topic_score_gemma":0.000007770966,"teacher_disagreement_score":0.4958237,"about_ca_system_score_codex":0.000028124956,"about_ca_system_score_gemma":0.000059053047,"threshold_uncertainty_score":0.34446013},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038465086,0.00048905524,0.9960704,0.00066651305,0.0011075137,0.0008207461,0.0000051483207,0.000101830665,0.00035417546],"genre_scores_gemma":[0.53980654,0.000015406567,0.45927906,0.0003996171,0.00041544889,0.000035996494,0.0000034854968,0.000018039113,0.000026433072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651456,0.00006352336,0.00076636916,0.0010658557,0.00079177134,0.00079790235],"domain_scores_gemma":[0.9957527,0.0015166075,0.0005570794,0.0014780698,0.0005614765,0.00013404648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027284992,0.00043529895,0.00050247216,0.00018931225,0.0003785403,0.00027366975,0.0031032122,0.0002693336,0.0000059639756],"category_scores_gemma":[0.00031683152,0.0003242796,0.00016518949,0.0006048255,0.00066647516,0.00037655837,0.0008953325,0.00059915363,0.000004429408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050474623,0.000029445486,0.00021458867,0.0000793036,0.0000070624938,7.7459873e-7,0.0008318191,0.36327702,0.00006106779,0.16612604,0.0000063747475,0.46936145],"study_design_scores_gemma":[0.000089950576,0.000081265,0.00020551679,0.00033321997,0.000008526812,0.00000433335,1.7777157e-7,0.6925787,0.00041688728,0.30587906,0.00011780968,0.0002845906],"about_ca_topic_score_codex":0.000020000094,"about_ca_topic_score_gemma":0.0000332577,"teacher_disagreement_score":0.53942186,"about_ca_system_score_codex":0.00017533942,"about_ca_system_score_gemma":0.0005737028,"threshold_uncertainty_score":0.9999209},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001212434,0.000611624,0.9697286,0.007969219,0.0010450901,0.0009510111,0.000005454666,0.00008267532,0.019594202],"genre_scores_gemma":[0.68029326,0.0014261316,0.3046958,0.0050713657,0.0017905574,0.0001465391,0.000013718272,0.000054885077,0.00650774],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844205,0.000033952358,0.00022702728,0.00036445144,0.0006100212,0.0003225075],"domain_scores_gemma":[0.9965569,0.0022686438,0.0001726999,0.0005242787,0.00041922246,0.000058284175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017791832,0.00014587899,0.0001682468,0.00027160742,0.000612558,0.00009741177,0.0015577378,0.00026877064,0.000052026517],"category_scores_gemma":[0.00052745565,0.00010879499,0.000073089395,0.00022411066,0.0022049188,0.00010201979,0.00023674076,0.0004139321,0.000014725225],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011725354,0.000011132283,0.000022405568,0.0000030524598,0.000009068774,0.000001251065,0.003021969,0.0003582399,0.000022215534,0.17063151,0.00009618985,0.8258112],"study_design_scores_gemma":[0.00079686654,0.00017250402,0.00022807524,0.0001844035,0.00003601707,0.0000048220886,0.00006645383,0.29617894,0.00047757887,0.2523943,0.44879478,0.00066526316],"about_ca_topic_score_codex":0.00027778858,"about_ca_topic_score_gemma":0.010575507,"teacher_disagreement_score":0.82514596,"about_ca_system_score_codex":0.00026944396,"about_ca_system_score_gemma":0.0005430194,"threshold_uncertainty_score":0.8124115},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008148235,0.0007643843,0.94815135,0.00062694075,0.0021030214,0.000505709,0.0000024758103,0.00030312725,0.04746148],"genre_scores_gemma":[0.63692594,0.00010162995,0.35664177,0.0019215064,0.0012207326,0.000027472459,0.000015307305,0.00007726258,0.0030683493],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99561155,0.000045644738,0.0006065949,0.0018329785,0.0010561198,0.0008471149],"domain_scores_gemma":[0.99695784,0.00029026595,0.00036451084,0.0016727613,0.00045874072,0.00025589493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008653329,0.0006536709,0.0005967867,0.0008740214,0.00043166857,0.0006873092,0.0037329737,0.0004260463,0.000052795323],"category_scores_gemma":[0.0001640486,0.00056360965,0.00018884649,0.0008397424,0.0010003765,0.0007787951,0.0012472281,0.00095676584,0.00027997728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045444185,0.000058672475,0.000112162495,0.00007411111,0.000012663726,0.00015935916,0.0012567866,0.0055203866,0.000119845135,0.4594996,0.00001786826,0.533164],"study_design_scores_gemma":[0.00060916255,0.00038431233,0.00047778408,0.0008699556,0.000017722228,0.00021109654,2.870274e-7,0.11665006,0.0024647808,0.87417024,0.0028548785,0.0012896877],"about_ca_topic_score_codex":0.000039537535,"about_ca_topic_score_gemma":0.00015446213,"teacher_disagreement_score":0.63684446,"about_ca_system_score_codex":0.00048221523,"about_ca_system_score_gemma":0.0018468258,"threshold_uncertainty_score":0.99968153},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008726578,0.00006376134,0.99353474,0.0017684291,0.0013487657,0.000957024,0.00008909605,0.00026044907,0.0018904605],"genre_scores_gemma":[0.05466559,0.0000908881,0.9375563,0.005078406,0.0013749761,0.00015181527,0.00021997662,0.000095044204,0.00076699245],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649185,0.000024861367,0.00038810493,0.0016947043,0.0007621213,0.0006383335],"domain_scores_gemma":[0.9975838,0.00074138475,0.00032724746,0.0006950671,0.00049231213,0.00016018786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055746065,0.0005449522,0.00043468951,0.00074288115,0.00040177628,0.00060356903,0.0014554911,0.00048484423,0.00003269796],"category_scores_gemma":[0.00023822187,0.0005025123,0.00017253417,0.00060528796,0.00028946224,0.0008367911,0.00023385895,0.0008442976,0.00015055755],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004536661,0.00014928036,0.000018412606,0.00013203916,0.000012513896,0.00003768666,0.00035324693,0.007224283,0.009997503,0.0032943126,0.0012121747,0.9775232],"study_design_scores_gemma":[0.0013753654,0.0016779373,0.00019275188,0.0022044824,0.000026191003,0.00008275558,3.778674e-7,0.13986401,0.1473533,0.70214564,0.0032696892,0.0018074625],"about_ca_topic_score_codex":0.000015728061,"about_ca_topic_score_gemma":0.000050782048,"teacher_disagreement_score":0.9757157,"about_ca_system_score_codex":0.00047526983,"about_ca_system_score_gemma":0.0005913084,"threshold_uncertainty_score":0.9997426},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004896409,0.00022525556,0.9887332,0.0055194534,0.0013391663,0.0010850324,0.000007515988,0.00023770316,0.0023630746],"genre_scores_gemma":[0.8307355,0.00021872889,0.15880905,0.008004532,0.0015322104,0.0001368157,0.00006681415,0.00008049226,0.00041587595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958795,0.00017041061,0.00049762824,0.0016119045,0.0012371958,0.00060338556],"domain_scores_gemma":[0.99754876,0.0005135292,0.00025006928,0.0010318768,0.00046162293,0.0001941682],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0030924305,0.00054861885,0.0005552272,0.0009615845,0.00038480436,0.0014864781,0.001572604,0.00046824434,0.000023383833],"category_scores_gemma":[0.000079932026,0.00049604446,0.00011515327,0.0004708662,0.00033715455,0.00093363464,0.0007498653,0.0009856421,0.00000980296],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064839487,0.000038517013,0.00006821367,0.000022035007,0.0000065312197,0.000009271093,0.00057131465,0.0029023318,0.000013664692,0.0010056908,0.00035017863,0.9950058],"study_design_scores_gemma":[0.0006594803,0.0012581134,0.001356191,0.00049623527,0.000012151862,0.00011054512,7.3025166e-7,0.9217989,0.0018696468,0.05779086,0.013573974,0.0010731628],"about_ca_topic_score_codex":0.00004711,"about_ca_topic_score_gemma":0.00007258275,"teacher_disagreement_score":0.9939326,"about_ca_system_score_codex":0.00050552253,"about_ca_system_score_gemma":0.00036934574,"threshold_uncertainty_score":0.9997491},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000085986474,0.0008351425,0.9875272,0.00064452906,0.004513743,0.0020922106,0.00004601173,0.0006216174,0.003633545],"genre_scores_gemma":[0.09015429,0.000042683354,0.90615594,0.0017827895,0.001379391,0.00008208308,0.000018517674,0.00009556179,0.00028876387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99144745,0.00007178775,0.0012801851,0.003507659,0.0019935886,0.0016993546],"domain_scores_gemma":[0.99090105,0.0036894893,0.0006659286,0.0031387217,0.0010945718,0.00051025127],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0033302775,0.0011400131,0.0012556091,0.0018220431,0.0006446296,0.0014504314,0.007677839,0.00069336704,0.000019261373],"category_scores_gemma":[0.0006406025,0.0010860285,0.00043298642,0.0018263013,0.0026451142,0.0008157956,0.0025247836,0.0013078935,0.000077046134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022845981,0.00025098884,0.00033775746,0.00042858784,0.000045019442,0.00036721272,0.0007613761,0.030718967,0.00027200405,0.37321585,0.000058842914,0.5935205],"study_design_scores_gemma":[0.00035613848,0.0005594808,0.00016945384,0.00035181045,0.000012099412,0.000304303,2.9646228e-7,0.59664077,0.00016982782,0.397675,0.0027367529,0.0010240884],"about_ca_topic_score_codex":0.00021539163,"about_ca_topic_score_gemma":0.00023483344,"teacher_disagreement_score":0.59249645,"about_ca_system_score_codex":0.0008128556,"about_ca_system_score_gemma":0.0012191018,"threshold_uncertainty_score":0.99958616},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008543526,0.0004458053,0.9969258,0.00031327867,0.0006670073,0.00083959167,0.000016581274,0.00003898546,0.00066755636],"genre_scores_gemma":[0.55975586,0.000015996202,0.43968216,0.00024099578,0.0001844505,0.000017759441,0.000011953611,0.000019339936,0.00007147806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973121,0.000022782422,0.00081724784,0.0006879849,0.0008023538,0.00035749804],"domain_scores_gemma":[0.9975035,0.0007524659,0.00065794867,0.0006626629,0.0003613824,0.0000620471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000684113,0.00030820267,0.00055171875,0.00045978714,0.0001227835,0.00020150408,0.0020810314,0.0001248965,0.0000036603017],"category_scores_gemma":[0.000047424557,0.0002368959,0.00015168905,0.0004401596,0.00048460535,0.0005121647,0.00046176775,0.00022250543,0.0000032436685],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073459523,0.000052353826,0.00005132275,0.00006852813,0.000017928362,6.3551744e-7,0.0015460574,0.020333195,0.00022536068,0.013225792,0.00003276637,0.96443874],"study_design_scores_gemma":[0.00036936745,0.00033778252,0.0002497348,0.00021134608,0.000015426207,0.0000073826372,0.0000013587696,0.93585235,0.007818686,0.05443069,0.00044444553,0.00026142268],"about_ca_topic_score_codex":0.000013001532,"about_ca_topic_score_gemma":0.00001554659,"teacher_disagreement_score":0.9641773,"about_ca_system_score_codex":0.00009300135,"about_ca_system_score_gemma":0.00025884225,"threshold_uncertainty_score":0.96603346},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014340706,0.0004200862,0.99242145,0.0018140784,0.00075039885,0.00056713616,0.000009627327,0.00034810053,0.003654807],"genre_scores_gemma":[0.07850774,0.0001311503,0.9155528,0.0023551318,0.0010061782,0.000027741116,0.000022822034,0.0000637225,0.0023327314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585766,0.000058582125,0.000717304,0.0016069307,0.0011289855,0.000630557],"domain_scores_gemma":[0.99683684,0.00027131956,0.0005060093,0.0016392986,0.0005720899,0.0001744697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090120634,0.0005577651,0.00047995322,0.0008445958,0.00040128094,0.0009303537,0.0028302555,0.00047091104,0.000095366355],"category_scores_gemma":[0.00009778391,0.0005046657,0.00015041442,0.0009312668,0.00048020747,0.0012741797,0.0005634392,0.00086268777,0.00008240225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007943737,0.000059297374,0.000031350417,0.00005034466,0.000014840935,0.000032258045,0.00052625727,0.0029171195,0.0073598293,0.073884174,0.00007012769,0.91504645],"study_design_scores_gemma":[0.00020746059,0.000082498205,0.00023498813,0.00031183366,0.000013581492,0.000074869444,3.7307316e-7,0.9287755,0.013295969,0.049660586,0.006576441,0.000765899],"about_ca_topic_score_codex":0.000018712808,"about_ca_topic_score_gemma":0.000017698976,"teacher_disagreement_score":0.9258584,"about_ca_system_score_codex":0.00061910646,"about_ca_system_score_gemma":0.0008569966,"threshold_uncertainty_score":0.9997405},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000105615894,0.00028126198,0.9972277,0.00022337523,0.0005957485,0.00043898265,0.000021158337,0.00040829153,0.0006978638],"genre_scores_gemma":[0.59141433,0.0002414327,0.40512967,0.001473789,0.0011150882,0.00003296115,0.00021538339,0.00007598352,0.00030137444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964374,0.00006140492,0.0007599363,0.0011282393,0.0010698877,0.0005431319],"domain_scores_gemma":[0.9977643,0.000303336,0.0005421812,0.00094505196,0.00026110085,0.00018404087],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075176725,0.00047308358,0.00043333063,0.0008554077,0.00037376257,0.0010013928,0.0020383415,0.0003314624,0.000014444192],"category_scores_gemma":[0.000049058897,0.0004707566,0.00010221992,0.00056416856,0.00022485113,0.0014457254,0.001103945,0.00056196126,0.00001860949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030464448,0.00006245078,0.00020202216,0.00010677278,0.00001096846,0.000020108622,0.001201896,0.007182755,0.00041024794,0.1014405,0.0014286042,0.88793063],"study_design_scores_gemma":[0.00019807478,0.00013753577,0.00014283796,0.0005739383,0.000007406946,0.000017505028,1.4040687e-7,0.9171193,0.0051546074,0.07012029,0.005887432,0.000640897],"about_ca_topic_score_codex":0.000016141386,"about_ca_topic_score_gemma":0.0000070532324,"teacher_disagreement_score":0.9099366,"about_ca_system_score_codex":0.00028822978,"about_ca_system_score_gemma":0.00015152474,"threshold_uncertainty_score":0.9997744},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032239452,0.00022362413,0.9943003,0.00035912433,0.0010502998,0.0006102642,0.00001836923,0.00017102077,0.0032637964],"genre_scores_gemma":[0.04237249,0.00005778355,0.9558281,0.0003777219,0.0007089935,0.0000115691755,0.000017354405,0.00008945517,0.0005365469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985999,0.0000042154584,0.0002818677,0.00041543416,0.0003252516,0.00037335098],"domain_scores_gemma":[0.9987986,0.00037964943,0.00010251697,0.00046287593,0.00015455548,0.000101766775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028720495,0.00034083048,0.0002641337,0.00017092413,0.00018195945,0.00029577725,0.00068111497,0.00021531165,0.000036127152],"category_scores_gemma":[0.000038522554,0.00023160482,0.00005383423,0.00019217355,0.00037953875,0.00007742096,0.00009879371,0.0007210546,0.0000051789434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003199936,0.0000025452086,0.000012383744,0.000047331985,0.000014475096,0.000003052811,0.0002964162,0.7790682,0.00006920551,0.00238147,0.000072495306,0.21802926],"study_design_scores_gemma":[0.00049349375,0.00012536281,0.000014518876,0.00043795255,0.000031468717,0.000059390517,4.7274435e-7,0.96091205,0.00084499386,0.014468846,0.022018239,0.0005932044],"about_ca_topic_score_codex":0.000007938289,"about_ca_topic_score_gemma":0.00014789267,"teacher_disagreement_score":0.21743606,"about_ca_system_score_codex":0.0000659577,"about_ca_system_score_gemma":0.00023173605,"threshold_uncertainty_score":0.94445705},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008651231,0.0009733511,0.9878722,0.0011500919,0.0016376497,0.00027421463,0.0000024109167,0.00016892643,0.007834647],"genre_scores_gemma":[0.1569245,0.00008331285,0.8354579,0.0032310283,0.0019415139,0.000012440393,0.000012665229,0.000039285045,0.0022973116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966276,0.000025502713,0.0004857314,0.0013691229,0.00095392985,0.0005380997],"domain_scores_gemma":[0.9980482,0.00031814125,0.00021659317,0.001010813,0.00023974739,0.00016651323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074533763,0.00042580845,0.00037764508,0.0010312326,0.0002673041,0.0005657034,0.0023171038,0.00023317138,0.000050950217],"category_scores_gemma":[0.00006585616,0.00041510147,0.00013117689,0.00079191313,0.000277194,0.0007965974,0.0010073856,0.00057710375,0.00013045875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002978088,0.000018708071,0.000006083985,0.000010316268,0.000005532894,0.00002890955,0.00022993721,0.10379598,0.00020727303,0.047199424,0.00002699856,0.8484678],"study_design_scores_gemma":[0.00028142193,0.00019208313,0.00011457256,0.0002127674,0.000006752508,0.00014296721,7.291144e-8,0.8286142,0.0025385404,0.15006112,0.017020665,0.00081487803],"about_ca_topic_score_codex":0.00000845563,"about_ca_topic_score_gemma":0.000045129094,"teacher_disagreement_score":0.847653,"about_ca_system_score_codex":0.0003153047,"about_ca_system_score_gemma":0.0006760079,"threshold_uncertainty_score":0.99983007},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005500047,0.0009037092,0.99214816,0.0007825987,0.002900307,0.0012182742,0.000069650385,0.0003386178,0.0015836882],"genre_scores_gemma":[0.38299397,0.000018278744,0.6058709,0.0013383764,0.003015673,0.000097466575,0.00013628583,0.000110068555,0.006418993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99467003,0.000111178946,0.0009153864,0.0020159893,0.001165588,0.001121803],"domain_scores_gemma":[0.9965187,0.00078803155,0.0004892069,0.0015414134,0.00035844796,0.00030420473],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002389559,0.00067085645,0.00079337746,0.00073336886,0.0005457702,0.0011068865,0.0039017904,0.0005066663,0.0000056732597],"category_scores_gemma":[0.000113697286,0.0006275889,0.00026167923,0.0005855017,0.0002857976,0.00042476077,0.001151158,0.00082228484,0.000053258413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028914897,0.00029156925,0.00015126984,0.00039333702,0.00005846823,0.0000911775,0.0032904902,0.5860008,0.00015065796,0.07217897,0.0013978209,0.33596653],"study_design_scores_gemma":[0.0006856265,0.0001550997,0.000075802585,0.00048804635,0.000009340998,0.0000706848,5.177773e-7,0.8794586,0.000041610965,0.0032136065,0.11513756,0.0006634883],"about_ca_topic_score_codex":0.000015266407,"about_ca_topic_score_gemma":0.000043699423,"teacher_disagreement_score":0.38627726,"about_ca_system_score_codex":0.00050538447,"about_ca_system_score_gemma":0.00041999656,"threshold_uncertainty_score":0.9999301},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013350512,0.00061539817,0.9939966,0.00010815512,0.0005816878,0.00033821465,0.000046705347,0.0008601265,0.003319578],"genre_scores_gemma":[0.15432057,0.00012060957,0.8447916,0.00017084833,0.00027582547,0.000008338874,0.000040534393,0.0000434679,0.00022821444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961802,0.000063543834,0.0006445379,0.0013243947,0.0010918673,0.00069548184],"domain_scores_gemma":[0.99666137,0.00054000394,0.00056665443,0.0016272863,0.00042111432,0.00018358833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088301994,0.0005441567,0.00069076126,0.0009975957,0.00014258518,0.00017457065,0.004360856,0.00038913864,0.000013560705],"category_scores_gemma":[0.00017797344,0.0005113596,0.00012812941,0.0007262834,0.00078196335,0.0013148652,0.00269334,0.0011658199,0.000009181883],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009806935,0.00008634659,0.0001231986,0.000045685214,0.000024070416,0.000024705145,0.0017901574,0.039833654,0.00027187433,0.015973082,0.000050366438,0.94176704],"study_design_scores_gemma":[0.00014602876,0.00030046346,0.00016760788,0.00058022677,0.000013623542,0.00003978282,2.6370216e-7,0.89736825,0.0025490127,0.09773002,0.0005904924,0.0005141968],"about_ca_topic_score_codex":0.000047702033,"about_ca_topic_score_gemma":0.0000160319,"teacher_disagreement_score":0.9412528,"about_ca_system_score_codex":0.00025261438,"about_ca_system_score_gemma":0.00038159254,"threshold_uncertainty_score":0.9997338},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016080898,0.0002050129,0.9886688,0.0005639013,0.0006245876,0.00055035617,0.000006157226,0.00029520597,0.008925178],"genre_scores_gemma":[0.3260294,0.000072495495,0.6709855,0.0020360067,0.0002632222,0.00002791478,0.0000059740114,0.000095249074,0.00048424109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99410516,0.00006494636,0.00050560274,0.0022270388,0.0016665735,0.0014306612],"domain_scores_gemma":[0.99623066,0.00051865104,0.00028033703,0.002230155,0.00040899252,0.00033119178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014170028,0.00071237155,0.0006496715,0.0010554637,0.00047501098,0.00058529404,0.0050226334,0.000365085,0.000070533635],"category_scores_gemma":[0.000081843165,0.0006005174,0.00017075558,0.0015932873,0.0013118894,0.001141099,0.0019363192,0.0017140511,0.00013799348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019421608,0.000047341924,0.0002690826,0.00005274413,0.000020741458,0.00044685687,0.0006638622,0.018899187,0.00005253838,0.85887384,0.000004607239,0.12064976],"study_design_scores_gemma":[0.0005884274,0.00022340665,0.00012286194,0.0007021426,0.000005340792,0.00022261587,2.0129572e-7,0.025388937,0.0010517591,0.9699575,0.0008453386,0.00089152623],"about_ca_topic_score_codex":0.000016854923,"about_ca_topic_score_gemma":0.000120916746,"teacher_disagreement_score":0.3258686,"about_ca_system_score_codex":0.00046591464,"about_ca_system_score_gemma":0.0011211111,"threshold_uncertainty_score":0.99964464},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20316671,0.00006516099,0.7944614,0.0018165263,0.000095909396,0.00033550317,3.003997e-7,0.00003701995,0.000021456273],"genre_scores_gemma":[0.61000097,0.0000017895343,0.38620657,0.0036348028,0.0001461895,0.0000030776905,8.7406477e-7,0.0000034256652,0.0000022673883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989152,0.000020298208,0.00016604053,0.00035855337,0.00022552576,0.00031436558],"domain_scores_gemma":[0.999449,0.00008845773,0.00004634006,0.0002618728,0.00008504541,0.00006925464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004931419,0.00011679182,0.00016060164,0.00017631038,0.00018675889,0.00008107689,0.0002042201,0.000040462743,0.000006524936],"category_scores_gemma":[0.00014949293,0.00009947366,0.00005385342,0.00072382245,0.00019226637,0.00015038208,0.000015586153,0.000118845746,0.0000032329444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041028846,0.0007180255,0.034165002,0.0002617021,0.000028632381,0.00016488034,0.0031609577,0.07970691,0.27954328,0.00079269387,0.0003908056,0.6006568],"study_design_scores_gemma":[0.0012040862,0.0014853159,0.2994893,0.00032725287,0.00003984425,0.00037761027,0.000006535071,0.6726467,0.013483451,0.009684855,0.00088770606,0.0003673412],"about_ca_topic_score_codex":0.000013644835,"about_ca_topic_score_gemma":0.000006114956,"teacher_disagreement_score":0.60028946,"about_ca_system_score_codex":0.000100342426,"about_ca_system_score_gemma":0.00010036343,"threshold_uncertainty_score":0.4056418},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001654602,0.0008283184,0.99011654,0.004471155,0.0005049825,0.0006832664,0.000010549891,0.00005188636,0.0016786861],"genre_scores_gemma":[0.9909717,0.000030807525,0.0067263655,0.0017256163,0.00028066654,0.000025689742,0.0000031004745,0.000016426739,0.00021966573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970552,0.00020534862,0.00056471006,0.0008890707,0.000891295,0.00039441633],"domain_scores_gemma":[0.99528515,0.002753229,0.0003523519,0.0013142754,0.00022876711,0.000066203145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021516762,0.00035553297,0.00047496034,0.0005423835,0.00024014796,0.00039504687,0.003401414,0.00020255551,0.000011960299],"category_scores_gemma":[0.00014467849,0.0002187987,0.00009470452,0.0007226991,0.0013344588,0.0005761472,0.000718084,0.00067712663,0.00003041097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007762423,0.00007195366,0.0004188438,0.00005066417,0.000021419975,0.000024054647,0.009357188,0.006555731,0.000092752474,0.030911915,0.0000684792,0.9524192],"study_design_scores_gemma":[0.0011829856,0.0003851568,0.0071080937,0.0015865875,0.00003821006,0.00061683246,0.000023960603,0.87389475,0.00069320586,0.1054574,0.0075206845,0.0014921323],"about_ca_topic_score_codex":0.00011672067,"about_ca_topic_score_gemma":0.0005409399,"teacher_disagreement_score":0.98931706,"about_ca_system_score_codex":0.00013034219,"about_ca_system_score_gemma":0.0005610087,"threshold_uncertainty_score":0.8922352},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47972247,0.000012837626,0.5198024,0.00032336215,0.0000067111127,0.000112962814,4.8767157e-7,0.000017363685,0.0000014394379],"genre_scores_gemma":[0.6053507,0.0000027065905,0.39436418,0.00020496857,0.00006506749,0.000007703186,0.0000025569923,0.000002065579,9.980695e-8],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937963,0.000008482716,0.00012244203,0.00025460913,0.000093651426,0.00014115387],"domain_scores_gemma":[0.99961996,0.000117664546,0.00003381852,0.00012956152,0.000044028064,0.0000549719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110987174,0.000058630358,0.00012148014,0.00006483817,0.00005115586,0.000011410932,0.0000914224,0.00004174986,0.0000013883027],"category_scores_gemma":[0.00005233849,0.000044334432,0.000018110853,0.0002472934,0.00018506523,0.00008512422,0.000038923732,0.00009654028,1.4852137e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001479721,0.00018937413,0.0014887591,0.0000157941,0.0000010383006,0.0000035573905,0.0001245485,0.07922272,0.4505807,0.0011882891,0.000003765724,0.46703348],"study_design_scores_gemma":[0.0002958102,0.00065037986,0.0069867107,0.000020914516,0.0000032393768,0.00003911405,2.1528511e-7,0.6276852,0.35722962,0.006896949,0.00013000707,0.000061864026],"about_ca_topic_score_codex":0.0000010795833,"about_ca_topic_score_gemma":3.4373784e-7,"teacher_disagreement_score":0.54846245,"about_ca_system_score_codex":0.000021397704,"about_ca_system_score_gemma":0.00002749853,"threshold_uncertainty_score":0.18079057},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018763607,0.000014770072,0.95784116,0.0008312262,0.00211879,0.00040701902,0.0000033745246,0.000068024034,0.019952029],"genre_scores_gemma":[0.9467976,4.0881648e-7,0.05099112,0.0010937949,0.00021888613,0.000025043435,0.000011178979,0.00001799754,0.0008439671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979834,0.0000889904,0.0006387888,0.00054946955,0.00048623714,0.0002531258],"domain_scores_gemma":[0.99882597,0.000113557515,0.0002295057,0.0005199653,0.00023019635,0.00008080033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010873836,0.00024408393,0.00030523195,0.0004982302,0.00012685549,0.00009938062,0.00087392144,0.00019941146,0.0005441843],"category_scores_gemma":[0.00006359154,0.00017163072,0.00006033331,0.00025687413,0.00023355399,0.00014815805,0.00016239156,0.00043662408,0.0001337476],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024181236,0.00003076855,0.000081006554,0.000013989435,0.000009039943,0.0000019789989,0.032823205,0.0022670752,0.00011358337,0.0023547513,0.00006319834,0.9622172],"study_design_scores_gemma":[0.0047304854,0.001838002,0.31136048,0.0052891895,0.00006979996,0.00035870893,0.0003027773,0.48031375,0.012083128,0.0356017,0.14316101,0.004890961],"about_ca_topic_score_codex":0.000037722926,"about_ca_topic_score_gemma":0.0013883925,"teacher_disagreement_score":0.95732623,"about_ca_system_score_codex":0.00027050579,"about_ca_system_score_gemma":0.00017926615,"threshold_uncertainty_score":0.6998898},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078067335,0.00013475576,0.9974636,0.000100283396,0.0003935993,0.00040304053,0.000026532474,0.000119402284,0.0005781107],"genre_scores_gemma":[0.15478338,0.000008617427,0.8445042,0.0000837967,0.00035649538,0.000019554316,0.000045320525,0.000049438167,0.00014924178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987249,0.0000075445782,0.00027033142,0.00041455613,0.0003123907,0.0002703153],"domain_scores_gemma":[0.99891245,0.00028292858,0.00009206517,0.0004558879,0.00019339749,0.00006326804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020305162,0.000295318,0.0003219816,0.000122924,0.000106395804,0.00011706648,0.000591046,0.00014306529,0.000022067767],"category_scores_gemma":[0.000017838807,0.00019236542,0.000056262008,0.00025697105,0.00026300942,0.0001351216,0.000046932822,0.00025586245,0.0000022564618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016745043,0.000015292353,0.000049821418,0.000054026263,0.000023636003,0.0000057033512,0.0002618411,0.8384499,0.000032637316,0.00029461164,0.000009973205,0.16078581],"study_design_scores_gemma":[0.00028007978,0.00010168929,0.00014990314,0.00019979235,0.0000244985,0.00004779481,4.8138276e-7,0.9954673,0.0007258243,0.0025772639,0.00012647339,0.00029887742],"about_ca_topic_score_codex":0.0000069873113,"about_ca_topic_score_gemma":0.000021544813,"teacher_disagreement_score":0.16048694,"about_ca_system_score_codex":0.00004495607,"about_ca_system_score_gemma":0.00008595576,"threshold_uncertainty_score":0.7844434},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002408671,0.00027695185,0.99514556,0.00027278627,0.0004373489,0.00025428867,0.00074629276,0.000050002465,0.00040810741],"genre_scores_gemma":[0.13347203,0.000056002318,0.8657519,0.00018108072,0.00018375904,0.000008940861,0.00025739794,0.00002255377,0.000066288645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966268,0.000025053401,0.0007291748,0.0014607799,0.00077977276,0.00037844887],"domain_scores_gemma":[0.994678,0.0006956529,0.00060380873,0.0036713455,0.00022886672,0.00012232449],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005129005,0.00037186616,0.0005719874,0.00035474583,0.00008890537,0.00019679399,0.0076062256,0.00019916688,0.000051072006],"category_scores_gemma":[0.00006995096,0.0003322533,0.00007156673,0.00033463215,0.0004889603,0.0006852947,0.0032913787,0.00034013772,0.000013056348],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015078168,0.000047278198,0.00016883564,0.000030180148,0.000031661977,0.000009253069,0.0007912658,0.0023643754,0.00033999767,0.0032263813,0.00010199853,0.99288726],"study_design_scores_gemma":[0.00021029374,0.00014170694,0.00062204135,0.00069311296,0.000022780903,0.00000867226,0.0000018902111,0.9597427,0.0031574643,0.03439527,0.00050156156,0.0005024691],"about_ca_topic_score_codex":0.0016594523,"about_ca_topic_score_gemma":0.000226868,"teacher_disagreement_score":0.9923848,"about_ca_system_score_codex":0.00007693914,"about_ca_system_score_gemma":0.00037673916,"threshold_uncertainty_score":0.999913},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003780961,0.00016450736,0.99366844,0.00016634843,0.00038791168,0.00031715058,0.00008601994,0.00009290712,0.001335756],"genre_scores_gemma":[0.78421617,0.000014488094,0.21517411,0.00018418011,0.00011155939,0.000016177708,0.000117041825,0.000025250623,0.00014105307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964007,0.00003791477,0.0006405385,0.0012286598,0.0011405555,0.000551636],"domain_scores_gemma":[0.99699277,0.00016740256,0.00046541067,0.0019258171,0.0003305637,0.000118024785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055775116,0.00043682999,0.0007233518,0.0028168587,0.00035854208,0.00040939942,0.0025421544,0.00020014415,0.00006174642],"category_scores_gemma":[0.000026286438,0.00037592603,0.00026636716,0.0034811918,0.00055189733,0.00051722326,0.0010546368,0.00052623777,0.0000020628736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057101443,0.00088689197,0.046639457,0.0003976209,0.0025130066,0.00018487654,0.009320081,0.29139274,0.0003187578,0.32588276,0.0010292269,0.3213775],"study_design_scores_gemma":[0.0011367664,0.0005517443,0.008629722,0.00040117503,0.00086474704,0.000034137942,0.0000030475062,0.7411015,0.0005307321,0.24263473,0.002535988,0.0015757114],"about_ca_topic_score_codex":0.00031562144,"about_ca_topic_score_gemma":0.0030414748,"teacher_disagreement_score":0.7804352,"about_ca_system_score_codex":0.00014277022,"about_ca_system_score_gemma":0.00027336305,"threshold_uncertainty_score":0.9998693},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042966306,0.0009645826,0.98810476,0.0008513837,0.0013982262,0.0004926703,0.0000053780373,0.00015235323,0.0037340228],"genre_scores_gemma":[0.8589608,0.000026068376,0.13712582,0.0028644216,0.0009338636,0.000011445008,0.000021131478,0.000034697274,0.000021754911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616444,0.00008939002,0.00083184184,0.0012512672,0.0009999404,0.0006631096],"domain_scores_gemma":[0.9970333,0.0006047522,0.00054186716,0.001395731,0.00033519417,0.000089132925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010300671,0.00055195316,0.00058578444,0.00075138087,0.0002596914,0.00042685197,0.004563062,0.00031470912,0.000004115676],"category_scores_gemma":[0.000012676241,0.0004072397,0.00011548426,0.0016778143,0.00036380911,0.0004682834,0.0014350812,0.00088862743,0.000004828476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060398706,0.00004161241,0.00072075415,0.000104114806,0.000010840405,0.000037239693,0.0013335549,0.7402767,0.0010699867,0.004425723,0.000012031254,0.25196138],"study_design_scores_gemma":[0.00027416958,0.00010666765,0.0010843906,0.0004947199,0.000008762,0.000028511284,6.2172654e-7,0.9821797,0.00094588037,0.013959384,0.0005017223,0.00041549775],"about_ca_topic_score_codex":0.0007837976,"about_ca_topic_score_gemma":0.0047528953,"teacher_disagreement_score":0.85466415,"about_ca_system_score_codex":0.00013206548,"about_ca_system_score_gemma":0.00043628147,"threshold_uncertainty_score":0.99983793},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017018137,0.004368929,0.97243387,0.006316016,0.0029528043,0.0021718512,0.00006662251,0.00015239864,0.01152049],"genre_scores_gemma":[0.9798996,0.00018063524,0.0073702303,0.005881534,0.004704006,0.000094399344,0.000016757615,0.000055837812,0.0017970416],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963768,0.00009426532,0.00053429726,0.00103799,0.001012343,0.00094426423],"domain_scores_gemma":[0.9975242,0.00076821406,0.00045341632,0.0005507579,0.00042619163,0.0002772126],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001389466,0.00040094485,0.00075375126,0.00047101852,0.0012647125,0.0012213716,0.0025804476,0.00035594788,0.00003188471],"category_scores_gemma":[0.00016777308,0.00036172476,0.0001746696,0.00031558293,0.0009043664,0.0006743871,0.00025074408,0.0005022169,0.00001578793],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045399174,0.0000235405,0.00029861773,0.00021344704,0.000038501425,0.000015645075,0.005041963,0.02278259,0.000001079495,0.097768,0.00034260188,0.8734286],"study_design_scores_gemma":[0.0040944056,0.000517324,0.0007171743,0.0014825468,0.000103125945,0.000009755964,0.000039467122,0.064247444,0.000014321231,0.034071445,0.89222854,0.0024744167],"about_ca_topic_score_codex":0.0010887346,"about_ca_topic_score_gemma":0.00963952,"teacher_disagreement_score":0.97988254,"about_ca_system_score_codex":0.0008549735,"about_ca_system_score_gemma":0.00157682,"threshold_uncertainty_score":0.9998835},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018492005,0.000965227,0.99192303,0.00085762475,0.0014477159,0.00028193233,0.000004587176,0.0001400299,0.0043613324],"genre_scores_gemma":[0.059538707,0.0003226948,0.93573,0.0012616563,0.0005767317,0.0000058782193,0.000016825406,0.000074887284,0.0024726368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504185,0.00022891494,0.0008582355,0.0016902431,0.0014427507,0.00073802384],"domain_scores_gemma":[0.9932943,0.0026155198,0.00076018245,0.0028591116,0.00024229709,0.00022857219],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0034731706,0.0004920742,0.00062921876,0.00048054417,0.00067148573,0.000897031,0.0075132204,0.0002867168,0.00003716773],"category_scores_gemma":[0.0011718106,0.00039270052,0.00014337682,0.0007720856,0.00070488395,0.00094875053,0.003948036,0.0016051487,0.000033122065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000127449875,0.000021415311,0.00017235453,0.00003300496,0.000032756903,0.00003961951,0.0014371992,0.06282067,0.00015063718,0.0119555285,0.00015485626,0.9231692],"study_design_scores_gemma":[0.0003155586,0.00011768882,0.00028002803,0.0001845095,0.000010719285,0.00005308698,0.0000012108846,0.961772,0.00008912794,0.010503491,0.026196262,0.0004762746],"about_ca_topic_score_codex":0.00003226012,"about_ca_topic_score_gemma":0.000032965276,"teacher_disagreement_score":0.92269295,"about_ca_system_score_codex":0.00014597089,"about_ca_system_score_gemma":0.0005359397,"threshold_uncertainty_score":0.9998525},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003168595,0.00015885614,0.9845787,0.0007143195,0.0003821749,0.001365371,0.000008097937,0.00029194323,0.012468841],"genre_scores_gemma":[0.74124706,0.000007885212,0.25629297,0.0016109925,0.0006135568,0.00008870838,0.000019718182,0.00003541184,0.00008366768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969248,0.00006144751,0.00041332058,0.0010173464,0.0006697028,0.0009133797],"domain_scores_gemma":[0.99859947,0.0004002779,0.00023856477,0.00045761882,0.00013771468,0.00016635335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014109829,0.0003932067,0.0004649573,0.0009953227,0.00063412916,0.00041970078,0.0011171453,0.0004086415,0.000014887572],"category_scores_gemma":[0.00011304381,0.00037557274,0.00014474879,0.0009576588,0.00091224874,0.00019059738,0.00015914775,0.00047146835,0.0000021902786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023980203,0.000039041824,0.000058034286,0.000048588972,0.000009819678,0.00038700248,0.00040808533,0.82918483,2.478927e-7,0.03771177,0.0000061484902,0.13212249],"study_design_scores_gemma":[0.0010898763,0.000053546933,0.000060536473,0.00029995118,0.000018512723,0.000011127153,0.0000022366803,0.9819718,0.00000399498,0.015569808,0.00047957074,0.00043906368],"about_ca_topic_score_codex":0.0019027838,"about_ca_topic_score_gemma":0.002116435,"teacher_disagreement_score":0.7412154,"about_ca_system_score_codex":0.0010521316,"about_ca_system_score_gemma":0.0014368374,"threshold_uncertainty_score":0.99986964},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005749295,0.00049606315,0.9810782,0.0006579236,0.001399209,0.0066649937,0.000002377699,0.00030134973,0.009394132],"genre_scores_gemma":[0.015536044,0.00005118644,0.9734795,0.0065578823,0.0010497264,0.0016119345,0.000005993207,0.00014369549,0.0015640381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939299,0.00008306511,0.00080577016,0.0024634432,0.0014232465,0.0012945313],"domain_scores_gemma":[0.9956566,0.000426913,0.00049120304,0.0028107865,0.00028447498,0.00033002777],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014356889,0.0008185095,0.0007848505,0.0006086963,0.00039903235,0.0010966476,0.005512074,0.000539529,0.000041466326],"category_scores_gemma":[0.00010358494,0.0007788713,0.00020912875,0.0009814202,0.0006650029,0.0007949362,0.0016088762,0.0014724048,0.000098655146],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000400137,0.000030643478,0.000041066945,0.000045817545,0.000011073193,0.00019308219,0.0005318886,0.017490357,0.000043251028,0.03276947,0.00014544664,0.94869393],"study_design_scores_gemma":[0.00073501095,0.0005664561,0.00008258935,0.0018996908,0.000013157883,0.00032167087,2.0025709e-7,0.7518076,0.0011078838,0.19539963,0.04588503,0.0021811433],"about_ca_topic_score_codex":0.0000055332503,"about_ca_topic_score_gemma":0.00006231038,"teacher_disagreement_score":0.94651276,"about_ca_system_score_codex":0.00051919516,"about_ca_system_score_gemma":0.00075514504,"threshold_uncertainty_score":0.99994034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009059534,0.00028362332,0.9952185,0.00046556722,0.00039923747,0.00021254722,0.000003681833,0.000053383705,0.0032728368],"genre_scores_gemma":[0.07885386,0.000021474842,0.9199197,0.0008897474,0.00008858698,0.000003796238,0.0000015317825,0.00001884988,0.00020241308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696124,0.000023404837,0.00057232525,0.0011514674,0.0007675477,0.0005240459],"domain_scores_gemma":[0.99838346,0.0002445752,0.00019827654,0.00086937664,0.00019018279,0.00011410122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047825417,0.00038676115,0.0005349871,0.0008454857,0.00008599608,0.00015720424,0.001881973,0.00018615466,0.0000046463365],"category_scores_gemma":[0.000072767936,0.0003520881,0.00010912031,0.00053805026,0.0006082649,0.00057080074,0.00094570994,0.0006519192,0.000008413514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031347251,0.00001956816,0.00001208817,0.000009242021,0.0000016005797,0.000036601486,0.0002851209,0.66575867,0.00059986016,0.0069162976,0.00001367053,0.32634413],"study_design_scores_gemma":[0.00023736602,0.000053007036,0.000020622128,0.0002467009,0.0000018687707,0.00001580701,9.3144735e-8,0.8895254,0.004915376,0.10460992,0.00004579302,0.0003280236],"about_ca_topic_score_codex":0.000013174023,"about_ca_topic_score_gemma":0.000057876834,"teacher_disagreement_score":0.32601613,"about_ca_system_score_codex":0.00022919342,"about_ca_system_score_gemma":0.0004703525,"threshold_uncertainty_score":0.9998931},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012666799,0.0010590655,0.99633163,0.00039044928,0.00091537327,0.0007304766,0.0000064884553,0.00038953725,0.00016431413],"genre_scores_gemma":[0.033682983,0.000022657801,0.9653723,0.0005302175,0.0002753535,0.000022220465,0.000029441992,0.000028422175,0.00003637354],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99624497,0.00003267543,0.0007010349,0.0016780115,0.00076781993,0.0005754794],"domain_scores_gemma":[0.99760616,0.0001633639,0.00046213498,0.0013227278,0.00032770302,0.00011790959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016741388,0.00042063338,0.00043465485,0.0011260589,0.00021722012,0.00046887062,0.0019585697,0.00045546205,0.0000041009343],"category_scores_gemma":[0.00012230572,0.00040407188,0.0000930851,0.00078924996,0.000277844,0.0013302943,0.00045575856,0.00068176456,0.0000018083384],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051835063,0.0000280945,0.000012931698,0.000027546672,0.0000021038047,0.00015425656,0.0003999042,0.006120722,0.00017562936,0.02112299,0.0000047100943,0.97194594],"study_design_scores_gemma":[0.0001426514,0.0001593362,0.000050219616,0.00036661103,0.0000025732256,0.00008315414,6.876163e-8,0.42875734,0.0022314705,0.5676777,0.00014425741,0.00038462915],"about_ca_topic_score_codex":0.00010818366,"about_ca_topic_score_gemma":0.00020148617,"teacher_disagreement_score":0.9715613,"about_ca_system_score_codex":0.0010770747,"about_ca_system_score_gemma":0.0007746519,"threshold_uncertainty_score":0.9998411},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032274344,0.0008753534,0.99777,0.00007684454,0.00019496414,0.0006048701,0.000036701087,0.00001735741,0.000101148944],"genre_scores_gemma":[0.18565531,0.000083829764,0.8129296,0.0005730194,0.00035655333,0.000051073173,0.00022821857,0.000035316833,0.00008710253],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772453,0.000021397042,0.00022867862,0.0014923017,0.00028984676,0.00024322035],"domain_scores_gemma":[0.99851334,0.000013473926,0.00013065222,0.0010881542,0.000118276505,0.00013607275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002220474,0.0002782517,0.00019001853,0.00021025431,0.000130032,0.000071239425,0.0008934922,0.00026744616,0.0000033376546],"category_scores_gemma":[0.000031799467,0.0002616203,0.000029020106,0.00014051131,0.00011787705,0.000011740081,0.00095795596,0.00018760307,0.0000037200632],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017423432,0.000031559848,0.00001249796,0.00003313228,0.0000046968057,0.0000015739107,0.000080488186,0.0753451,0.56673235,0.0000046592204,0.000010200161,0.3577263],"study_design_scores_gemma":[0.00048007094,0.00011029263,0.00039388603,0.00013697233,0.000009316141,0.000014357234,5.889553e-7,0.7180531,0.2790925,0.00023164805,0.0010405416,0.0004367525],"about_ca_topic_score_codex":0.0000069470693,"about_ca_topic_score_gemma":0.000011569352,"teacher_disagreement_score":0.642708,"about_ca_system_score_codex":0.00008085971,"about_ca_system_score_gemma":0.00027174663,"threshold_uncertainty_score":0.9999836},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006790945,0.0009027704,0.996199,0.00021991778,0.0007762402,0.00020836983,0.0000028047773,0.00016047571,0.0008513352],"genre_scores_gemma":[0.9440156,0.000017837974,0.055205625,0.00022637786,0.00021111644,0.000004087906,0.000022117007,0.000029250727,0.00026799322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628806,0.00008818637,0.0008388967,0.0011664074,0.0010153718,0.0006031012],"domain_scores_gemma":[0.9976533,0.00042604748,0.00071534474,0.0007033627,0.00033974627,0.00016219802],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001290296,0.000512568,0.00068213907,0.0010306245,0.00011246603,0.00023532151,0.0029149293,0.00034991905,0.00009739813],"category_scores_gemma":[0.000108081615,0.0004528414,0.00027467962,0.0006495978,0.00054362754,0.00037324821,0.000493774,0.0010630734,0.000050625258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009177187,0.000075732896,0.0000862484,0.00005305961,0.000029579283,0.000013586691,0.0011832248,0.44683537,0.00009011177,0.07189964,0.000011173655,0.47971308],"study_design_scores_gemma":[0.00020969994,0.00016794231,0.00010304504,0.0002723135,0.00002175938,0.000013461225,2.3052456e-7,0.9966951,0.0004415457,0.00035297425,0.0012811283,0.0004408045],"about_ca_topic_score_codex":0.000016252032,"about_ca_topic_score_gemma":0.00011575647,"teacher_disagreement_score":0.9433365,"about_ca_system_score_codex":0.00022489528,"about_ca_system_score_gemma":0.0003121304,"threshold_uncertainty_score":0.99979234},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007285376,0.0014252269,0.99422485,0.00051480194,0.0013054854,0.00020807057,0.0000091699085,0.0003780952,0.0019270098],"genre_scores_gemma":[0.0032250527,0.0000714101,0.99573207,0.0003698343,0.00028602176,0.0000034019354,0.000011446714,0.000027298256,0.000273465],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964622,0.0000296243,0.00037566476,0.0019151501,0.00067792466,0.00053938554],"domain_scores_gemma":[0.9955831,0.0010372524,0.00017342197,0.0030062306,0.00009441593,0.0001055482],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011737171,0.00045163545,0.00045260738,0.00051792874,0.0001454334,0.000341451,0.0048269774,0.00020634614,0.000003941233],"category_scores_gemma":[0.00038753237,0.00041624715,0.000034775865,0.0003601292,0.0005193873,0.00069288065,0.0054932614,0.00062523317,0.000009566791],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015611222,0.000010500107,0.0000137557445,0.000042111966,0.0000073348156,0.00012747599,0.00009643135,0.15574396,0.00006939821,0.023074063,0.00012284348,0.8206906],"study_design_scores_gemma":[0.0002648335,0.00014273339,0.0002883693,0.0003304199,0.000009489119,0.00012906364,5.2630288e-8,0.3305598,0.00063860277,0.6583807,0.008251115,0.0010048685],"about_ca_topic_score_codex":0.000018367256,"about_ca_topic_score_gemma":0.000037973998,"teacher_disagreement_score":0.8196857,"about_ca_system_score_codex":0.0001749686,"about_ca_system_score_gemma":0.00023604809,"threshold_uncertainty_score":0.99982893},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009177262,0.00025471247,0.99622744,0.0005950584,0.0007218946,0.00040851283,0.000067033514,0.00015521042,0.00065240805],"genre_scores_gemma":[0.05880113,0.00007200789,0.9395185,0.0006386266,0.000567108,0.00004774199,0.000036721347,0.000026998103,0.00029115478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973369,0.000019123114,0.00043910183,0.0013464593,0.00043699908,0.000421371],"domain_scores_gemma":[0.9976052,0.00094075955,0.00023216213,0.0009403598,0.00014652922,0.00013500801],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008221812,0.00032993805,0.0003667875,0.000337553,0.00043778663,0.0005894424,0.0013581287,0.00018923124,0.000004212742],"category_scores_gemma":[0.00013353642,0.00030756573,0.000059691964,0.00029493493,0.0003236092,0.0006602661,0.00074626773,0.00030049644,0.000003955386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002612778,0.00001606359,0.00004445478,0.00002820032,0.0000067698156,0.000010491521,0.0003874719,0.0011983331,0.00008404161,0.02034808,0.000043276297,0.97783023],"study_design_scores_gemma":[0.0005657217,0.00035877476,0.000872249,0.00051813584,0.00002477423,0.00036070755,0.0000012671748,0.8514928,0.000534118,0.13241784,0.011948484,0.00090509653],"about_ca_topic_score_codex":0.00007247328,"about_ca_topic_score_gemma":0.000055261393,"teacher_disagreement_score":0.97692513,"about_ca_system_score_codex":0.00011273957,"about_ca_system_score_gemma":0.0001902536,"threshold_uncertainty_score":0.99993765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014256343,0.00013165838,0.99615735,0.0002671565,0.0005073084,0.00020194391,0.000017451048,0.0000612425,0.0012302559],"genre_scores_gemma":[0.81579405,0.000062310726,0.1833265,0.00053547363,0.00014191045,0.0000036951087,0.00003033076,0.000012796636,0.000092960996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687594,0.000027694641,0.0006303215,0.0010409183,0.0009816326,0.00044346196],"domain_scores_gemma":[0.9978023,0.00023445263,0.0003519817,0.0012445765,0.00025091667,0.00011575456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003717123,0.00035876484,0.0006937284,0.0027099487,0.00016462045,0.00027707484,0.0024614416,0.00018781365,0.00011903557],"category_scores_gemma":[0.000024573446,0.00032558365,0.00037063198,0.002432494,0.0004329221,0.00030841265,0.0006224411,0.00040711908,0.00000393225],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038501466,0.000058789294,0.00019939076,0.000013863311,0.00014790086,0.000019410298,0.0009839059,0.010640549,0.00020146264,0.112883545,0.00001048694,0.87483686],"study_design_scores_gemma":[0.0003936087,0.00024950432,0.0046538385,0.00010289187,0.00024703,0.000010332272,3.100216e-7,0.8218479,0.0013445015,0.16925175,0.0011536705,0.00074464956],"about_ca_topic_score_codex":0.00005320608,"about_ca_topic_score_gemma":0.00032191307,"teacher_disagreement_score":0.8740922,"about_ca_system_score_codex":0.00009209726,"about_ca_system_score_gemma":0.00021354434,"threshold_uncertainty_score":0.9999196},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010410447,0.0009540523,0.9957516,0.00024516808,0.0011838241,0.000462466,0.000016830216,0.0001649505,0.001116993],"genre_scores_gemma":[0.08042162,0.00025972645,0.91660875,0.00097268674,0.001079832,0.000039930244,0.00001949552,0.00012282112,0.00047515848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984719,0.0000043855925,0.00023380636,0.000512035,0.00042440425,0.00035343895],"domain_scores_gemma":[0.99865466,0.00055402395,0.00007151107,0.00048880046,0.00015591715,0.00007511305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022447555,0.0003744703,0.00028300798,0.0002442312,0.0002715462,0.00014476244,0.0006233298,0.0001701178,0.000018905072],"category_scores_gemma":[0.000049464914,0.00024598176,0.00007605952,0.00024041852,0.0004289602,0.000097331904,0.000074844844,0.0006131368,0.0000136738345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022037975,0.000008638437,0.000003293373,0.000015824166,0.0000233246,0.000011168786,0.0002737574,0.94518316,0.0000022752974,0.00013422915,0.000008137183,0.05431417],"study_design_scores_gemma":[0.00035133786,0.0002379375,0.000008086339,0.00023924444,0.000014429558,0.00003516599,2.2622422e-7,0.9969341,0.00026147757,0.0008712684,0.000705824,0.00034091008],"about_ca_topic_score_codex":0.000004576463,"about_ca_topic_score_gemma":0.000037303325,"teacher_disagreement_score":0.08031752,"about_ca_system_score_codex":0.00014110596,"about_ca_system_score_gemma":0.00013074139,"threshold_uncertainty_score":0.9999992},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014764119,0.0005295684,0.9963773,0.00014857495,0.0006839605,0.00047034211,0.0000023172645,0.00024474977,0.00006680521],"genre_scores_gemma":[0.07885824,0.00009801188,0.92016065,0.0003415738,0.00036589356,0.000021938833,0.0000014002953,0.000036930498,0.00011536307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957912,0.0000656107,0.00037136525,0.0018173221,0.0011904873,0.00076400436],"domain_scores_gemma":[0.9968468,0.0011524206,0.000108290464,0.0012843988,0.00023568886,0.0003724088],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011378943,0.0004960111,0.00057125185,0.0028360826,0.00029646017,0.0005919823,0.0020130454,0.0002758481,0.000006818867],"category_scores_gemma":[0.00020053826,0.00047895446,0.00013948821,0.00296582,0.00032769097,0.00035455072,0.0012170103,0.0007064782,0.00003795495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008316953,0.000015903535,0.00014553912,0.000017168233,0.000083631945,0.00035345272,0.0011092253,0.40487894,0.001170585,0.00033503823,0.000024490928,0.5918577],"study_design_scores_gemma":[0.00031725608,0.00047079293,0.0025903778,0.00011227131,0.00004070379,0.00025741768,1.1439287e-7,0.96967083,0.012945335,0.010980344,0.0014103389,0.0012042046],"about_ca_topic_score_codex":0.000027000036,"about_ca_topic_score_gemma":0.00006448989,"teacher_disagreement_score":0.5906535,"about_ca_system_score_codex":0.0004291748,"about_ca_system_score_gemma":0.00028650597,"threshold_uncertainty_score":0.99976623},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009864841,0.0018933387,0.9944291,0.00036262622,0.0013807585,0.0004989686,0.0000014266174,0.00023499223,0.0011001494],"genre_scores_gemma":[0.6386469,0.0009079452,0.3587357,0.0010893008,0.00030852348,0.000018435689,0.0000108952745,0.00005406672,0.00022821664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960842,0.00013820294,0.0008039828,0.0014573961,0.00058052165,0.00093570154],"domain_scores_gemma":[0.9968466,0.00073570065,0.00034013359,0.0016267485,0.0002340654,0.00021674247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009472427,0.0006080691,0.00069049146,0.0008623632,0.0003705983,0.0006434583,0.004008954,0.00033297788,0.00004220141],"category_scores_gemma":[0.00023177174,0.0006082425,0.00013147217,0.0013636061,0.0005555074,0.00047865213,0.0017377174,0.0013576895,0.000020377664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074458144,0.000055179717,0.00014868105,0.000019984755,0.000009060646,0.00016375665,0.0010789387,0.3003725,0.00007858692,0.012197635,0.0000060519283,0.6858622],"study_design_scores_gemma":[0.00089127553,0.00006459846,0.0008033738,0.0010647918,0.0000053600756,0.000053812848,1.4600933e-7,0.98761755,0.00007474427,0.008208048,0.00051178655,0.0007045055],"about_ca_topic_score_codex":0.00002392565,"about_ca_topic_score_gemma":0.0005265374,"teacher_disagreement_score":0.687245,"about_ca_system_score_codex":0.0008571974,"about_ca_system_score_gemma":0.0006997275,"threshold_uncertainty_score":0.9996369},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011083334,0.0010329827,0.9967105,0.00053080096,0.000111328125,0.00040005372,0.000025922876,0.000067515895,0.000012582128],"genre_scores_gemma":[0.9180937,0.00012864385,0.08149955,0.000109162516,0.000073515774,0.0000172284,0.000007716993,0.000011455859,0.000059065598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968504,0.00008957865,0.00056362833,0.001125843,0.0009134267,0.00045716937],"domain_scores_gemma":[0.992296,0.00565268,0.00027042144,0.0012320875,0.00044080438,0.000108011234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019268725,0.00033326892,0.0007429797,0.001102639,0.00037050378,0.00034107507,0.0019109836,0.00021769752,0.000004131449],"category_scores_gemma":[0.0006692105,0.00024261021,0.000325778,0.0015442449,0.0010351435,0.0003186717,0.00058076065,0.00053932494,7.721522e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005813377,0.00001685939,0.00050746894,0.0001055014,0.00017135414,0.0000020092916,0.0007388158,0.04459165,0.000023092085,0.00064467516,3.5765618e-7,0.9531924],"study_design_scores_gemma":[0.00011780244,0.00021063605,0.001711397,0.00007251679,0.00014918945,0.0000032327155,8.569801e-7,0.7517615,0.00039971442,0.24519859,0.000118181044,0.0002564202],"about_ca_topic_score_codex":0.00015647132,"about_ca_topic_score_gemma":0.00052463135,"teacher_disagreement_score":0.952936,"about_ca_system_score_codex":0.00020340718,"about_ca_system_score_gemma":0.00027834575,"threshold_uncertainty_score":0.9893357},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048156682,0.0000380603,0.99716157,0.0007343684,0.000042693377,0.0014103646,0.0000017190982,0.00010184927,0.000027799533],"genre_scores_gemma":[0.27621415,0.000002390717,0.7224877,0.0010935412,0.000023205223,0.00015455455,0.000014431469,0.000009035666,9.787293e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891627,0.000020129184,0.0001926007,0.00038262756,0.00023330258,0.00025509702],"domain_scores_gemma":[0.9992118,0.00015066165,0.000067624016,0.00035027415,0.00016088886,0.000058777885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004904967,0.00012222977,0.0001334594,0.00011921608,0.0003077229,0.000059355778,0.00020508243,0.000061747436,0.0000027657836],"category_scores_gemma":[0.00015840541,0.00008593987,0.000041816133,0.0010185316,0.00023512059,0.00013627202,0.000032366497,0.00013930541,7.9274577e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005113223,0.00007792396,0.00015692237,0.000032267944,9.4426787e-7,4.6817914e-7,0.0002513763,0.61466765,0.0008017417,0.0004927934,0.000015212745,0.38349757],"study_design_scores_gemma":[0.00046539615,0.000094000825,0.00008886672,0.00004986406,0.000009753757,0.000012130993,0.0000028086556,0.9763919,0.015604464,0.00690136,0.0002795053,0.00009995785],"about_ca_topic_score_codex":0.000008418547,"about_ca_topic_score_gemma":0.0000042778333,"teacher_disagreement_score":0.3833976,"about_ca_system_score_codex":0.00011620831,"about_ca_system_score_gemma":0.00022384043,"threshold_uncertainty_score":0.35045263},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033257555,0.000079375,0.993424,0.0005884358,0.003678127,0.00071769446,0.00004339385,0.00019414535,0.0009422364],"genre_scores_gemma":[0.022341898,0.00006618129,0.9738998,0.0016414777,0.0014149443,0.00008587083,0.000108811,0.00005194333,0.0003890819],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965436,0.00003079554,0.0004971825,0.0014978036,0.00078668055,0.00064394734],"domain_scores_gemma":[0.997723,0.00044879463,0.00033273792,0.00091373007,0.00038664273,0.00019511535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006836312,0.00048586924,0.00044150001,0.0006764352,0.00042531916,0.0005363669,0.002035995,0.00050875754,0.00008491972],"category_scores_gemma":[0.00017246371,0.00043042187,0.00019158956,0.00026874975,0.0003580562,0.00088444893,0.00071088946,0.0009177727,0.00013862566],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002026869,0.00003526153,0.000006942042,0.000040453157,0.000004056771,0.0000138168825,0.00031059,0.00024980927,0.025153128,0.00092154765,0.00015492561,0.9730892],"study_design_scores_gemma":[0.0010297229,0.0003203999,0.0000306985,0.0009983152,0.000013520121,0.000052115447,2.6510594e-7,0.10338267,0.25301155,0.6131464,0.02670553,0.0013087525],"about_ca_topic_score_codex":0.000008372075,"about_ca_topic_score_gemma":0.000033452245,"teacher_disagreement_score":0.9717804,"about_ca_system_score_codex":0.000113446215,"about_ca_system_score_gemma":0.00032115294,"threshold_uncertainty_score":0.99981475},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011019488,0.000351189,0.9853314,0.005642351,0.001857548,0.00074326806,0.000018779843,0.00024122598,0.004712301],"genre_scores_gemma":[0.9221848,0.0000038566923,0.07395178,0.0030794695,0.00054691033,0.000006772308,0.0000094404695,0.000037913247,0.00017904319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99442136,0.00011512758,0.0010803282,0.0017610475,0.001514105,0.0011080402],"domain_scores_gemma":[0.9950461,0.0011039557,0.000703796,0.0022150718,0.00066799036,0.00026309027],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021244362,0.00071155553,0.0008937456,0.0006669254,0.00063284434,0.0011963607,0.007942237,0.00025910535,0.000010067331],"category_scores_gemma":[0.00014734594,0.0005603199,0.00020398552,0.001622443,0.00062369864,0.0004385696,0.003190306,0.00097182114,0.000043166638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000129105665,0.00007072874,0.00014935137,0.00047681626,0.00007138989,0.0000555579,0.018372443,0.4785155,0.00027639183,0.10558055,0.00015897959,0.3962594],"study_design_scores_gemma":[0.00076106377,0.00039844416,0.0006897429,0.0037538628,0.000021528429,0.00017012618,0.00001658071,0.8573059,0.0011024276,0.115540095,0.01842533,0.0018149264],"about_ca_topic_score_codex":0.00019534318,"about_ca_topic_score_gemma":0.000060116126,"teacher_disagreement_score":0.92108285,"about_ca_system_score_codex":0.00038651883,"about_ca_system_score_gemma":0.001044502,"threshold_uncertainty_score":0.9998405},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009231908,0.00009587438,0.9958019,0.0003763607,0.0010223669,0.00028234327,0.0000018804723,0.00017033947,0.0021565605],"genre_scores_gemma":[0.066450976,0.000022987544,0.9328541,0.00043028503,0.00013641566,0.0000027891099,0.0000073931083,0.000019180214,0.00007584722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978725,0.0000327532,0.00042249024,0.00079120905,0.0005609204,0.00032012557],"domain_scores_gemma":[0.99777323,0.00020194428,0.00039465114,0.0012527211,0.00028105866,0.000096416035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069634576,0.0003003999,0.00025800214,0.0006737295,0.0004176459,0.0006474283,0.0016342001,0.00032422296,0.000047278194],"category_scores_gemma":[0.000093193245,0.00031055303,0.000065910266,0.00041700454,0.00044190115,0.0010861839,0.00076175755,0.0008453059,0.000019763385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012826887,0.000008268048,0.000036113634,0.000014640311,0.0000029170208,0.000004269058,0.0003616334,0.038101327,0.00230351,0.013082313,8.7276084e-7,0.94608283],"study_design_scores_gemma":[0.00013254459,0.000025503681,0.00010821789,0.000118428834,0.0000053123013,0.000055842505,1.0305321e-7,0.9751242,0.0012160086,0.02258822,0.00028207968,0.0003435321],"about_ca_topic_score_codex":0.000051803298,"about_ca_topic_score_gemma":0.00020258443,"teacher_disagreement_score":0.9457393,"about_ca_system_score_codex":0.00027701844,"about_ca_system_score_gemma":0.0004767654,"threshold_uncertainty_score":0.9999347},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00268487,0.00005955868,0.9960189,0.000012383428,0.00017932558,0.0005468357,0.0000055966784,0.000063647705,0.00042887387],"genre_scores_gemma":[0.9688191,0.0000012369663,0.030981492,0.00005371952,0.000103611,0.0000065986537,0.0000031039954,0.00002730888,0.0000038683834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987881,0.000005016909,0.00031243864,0.0002998364,0.0003729373,0.00022162277],"domain_scores_gemma":[0.9993399,0.00009496275,0.00012420819,0.00025724634,0.000120587145,0.00006308872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022387455,0.00020339302,0.00031083872,0.00024950976,0.00005335434,0.00006198162,0.00025846082,0.00013255927,0.0000013126336],"category_scores_gemma":[0.000013577245,0.00017947053,0.00003725908,0.0002016016,0.000026700218,0.00017497364,0.00003396586,0.00016010582,0.0000025103452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010056424,0.0000026975592,0.00000605582,0.000054576434,0.000007301397,8.091519e-7,0.00010591042,0.967588,0.003907165,0.0032202608,2.6916112e-8,0.025097119],"study_design_scores_gemma":[0.00033324715,0.00007803305,0.000009040976,0.00038483922,0.000012245922,0.0000031835639,1.4368474e-7,0.9885841,0.0006563298,0.009730283,0.000008759865,0.00019980004],"about_ca_topic_score_codex":0.000064629014,"about_ca_topic_score_gemma":0.0001056558,"teacher_disagreement_score":0.9661342,"about_ca_system_score_codex":0.0004899012,"about_ca_system_score_gemma":0.00008699232,"threshold_uncertainty_score":0.73185956},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003501995,0.0042611687,0.9878101,0.0007176758,0.0032616586,0.00056072907,0.0000013655495,0.00019628322,0.0031559952],"genre_scores_gemma":[0.18641159,0.0016981578,0.7942132,0.015378442,0.0013774087,0.000058680358,0.000015922826,0.00018841613,0.0006581874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939279,0.00010256816,0.0009344807,0.0024790224,0.0010628164,0.0014932104],"domain_scores_gemma":[0.9962784,0.0005461927,0.0004439204,0.0022949735,0.00017139461,0.00026513654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019026166,0.0008111692,0.00083516806,0.0008687639,0.00024466892,0.0007939818,0.0051063374,0.0006477654,0.00003642271],"category_scores_gemma":[0.00008073211,0.0008049614,0.00017158918,0.0015205526,0.000584995,0.0008327629,0.002023458,0.0020893004,0.00006204936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035633952,0.000019361367,0.000071508104,0.00001020447,0.000005707556,0.00021373578,0.00021595009,0.3157553,0.000003554346,0.01735866,0.000075737174,0.6662667],"study_design_scores_gemma":[0.00034579396,0.0000964668,0.00010161394,0.00052477384,0.0000048141956,0.00009160313,9.089384e-8,0.9171061,0.00004210873,0.0726022,0.008173194,0.0009112552],"about_ca_topic_score_codex":0.0000085934325,"about_ca_topic_score_gemma":0.00026700864,"teacher_disagreement_score":0.66535544,"about_ca_system_score_codex":0.00059322437,"about_ca_system_score_gemma":0.00042384872,"threshold_uncertainty_score":0.99944013},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018742945,0.0003802825,0.9881224,0.0010717016,0.0003681945,0.0002802449,0.000001055875,0.00023358724,0.009355079],"genre_scores_gemma":[0.028959533,0.00013578989,0.96982056,0.0004279281,0.00022512375,0.0000029583714,0.0000016942219,0.000025340854,0.00040109004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732226,0.00003119671,0.0003984653,0.0011972492,0.00060498057,0.0004458367],"domain_scores_gemma":[0.9984462,0.00037962032,0.00028120444,0.0005637711,0.00018620859,0.0001429688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000697474,0.00035928108,0.0003479872,0.0006846214,0.00045540684,0.00052342843,0.00085879286,0.00021197884,0.000017814022],"category_scores_gemma":[0.00013846077,0.0003595036,0.00006240029,0.00050164823,0.00046173297,0.00060753804,0.0008015748,0.0006250934,0.000029222838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034895086,0.000011758274,0.00012139666,0.000028871786,0.000010054314,0.00008434543,0.0019857192,0.1957854,0.0003642879,0.0063449955,0.000013037215,0.79524666],"study_design_scores_gemma":[0.00020059862,0.00005805386,0.000089149886,0.00049654924,0.000004113181,0.00033700766,2.398308e-7,0.98585325,0.00043876257,0.011487949,0.0005395545,0.00049479154],"about_ca_topic_score_codex":0.000019046473,"about_ca_topic_score_gemma":0.000042704833,"teacher_disagreement_score":0.7947518,"about_ca_system_score_codex":0.00018977161,"about_ca_system_score_gemma":0.00040526327,"threshold_uncertainty_score":0.9998857},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019933132,0.0005170299,0.9846431,0.00008194178,0.0033409344,0.0004919117,0.00008542069,0.000020218316,0.008826131],"genre_scores_gemma":[0.603657,0.00006330053,0.38203362,0.006349966,0.00596589,0.000033062475,0.00023723913,0.0001739692,0.0014859273],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976378,0.00007352457,0.0002721786,0.0012054258,0.00040041312,0.00041066398],"domain_scores_gemma":[0.9986713,0.00007737452,0.00013825113,0.00082489575,0.0001278071,0.00016036739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047706222,0.00043658033,0.0003850476,0.00016569202,0.0001560613,0.00015292139,0.0010045536,0.00057614857,0.00012774399],"category_scores_gemma":[0.00015094614,0.00039407134,0.00011027972,0.00011349693,0.00023249681,0.000008295213,0.0004252283,0.0004284262,0.000017594908],"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.0001926629,0.000038318994,0.0000071968516,0.000054409742,0.00008538104,0.00002674983,0.00041925762,0.0017357208,0.6767543,0.01815482,0.00042511898,0.30210608],"study_design_scores_gemma":[0.0005608076,0.00043149313,0.00000656249,0.00017498065,0.000024383204,0.000025549256,8.014548e-7,0.0006030814,0.54941314,0.41977796,0.027950808,0.001030468],"about_ca_topic_score_codex":0.000009177843,"about_ca_topic_score_gemma":0.0000060135344,"teacher_disagreement_score":0.60260946,"about_ca_system_score_codex":0.00005977142,"about_ca_system_score_gemma":0.00025269462,"threshold_uncertainty_score":0.9998511},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006537573,0.0029074305,0.9906334,0.00041252383,0.0031164887,0.0013781923,0.0000031511431,0.00018254724,0.001300844],"genre_scores_gemma":[0.10294755,0.00034425844,0.88948214,0.0045041083,0.0014786503,0.00015169886,0.000019846193,0.00017027213,0.0009014737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935423,0.00009797003,0.0011149348,0.0027654865,0.0008835964,0.001595684],"domain_scores_gemma":[0.9955095,0.0012535397,0.0006821216,0.002078461,0.0002533342,0.00022302856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029297946,0.0008215802,0.00090454466,0.000681308,0.00036461843,0.0007669016,0.00412374,0.00075105776,0.000014485898],"category_scores_gemma":[0.00021914787,0.00082974817,0.00026769648,0.0011377784,0.00037946788,0.00077594887,0.0015402955,0.0017413824,0.000008534567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009300036,0.000030220242,0.00013461111,0.00005327578,0.000012726109,0.00008348405,0.0006199321,0.32062912,0.000008911462,0.012257042,0.00015824127,0.6660031],"study_design_scores_gemma":[0.0005023553,0.00017467792,0.000053742217,0.0010883593,0.000009133518,0.00007684907,2.5861186e-7,0.9396424,0.00007312436,0.051001687,0.006470559,0.0009068384],"about_ca_topic_score_codex":0.0000051393686,"about_ca_topic_score_gemma":0.00024438548,"teacher_disagreement_score":0.6650963,"about_ca_system_score_codex":0.0005493155,"about_ca_system_score_gemma":0.00042623145,"threshold_uncertainty_score":0.99941534},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035615694,0.000030097171,0.9921452,0.00079802016,0.0007925506,0.00065757066,0.0000063232214,0.000051563653,0.0019571069],"genre_scores_gemma":[0.95126075,0.000004700735,0.04341234,0.0032912863,0.0011810762,0.000023829196,0.00008487144,0.00004428224,0.00069685193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985743,0.0000081729195,0.0003286169,0.0005142378,0.0003339551,0.00024072034],"domain_scores_gemma":[0.9990335,0.0003424238,0.00013430827,0.00022664515,0.00017176814,0.00009133301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003363998,0.00020664452,0.00031588043,0.00039511916,0.0000804804,0.0000765397,0.00016278664,0.00031065822,0.00014722356],"category_scores_gemma":[0.00022332915,0.00017879737,0.000046160716,0.00022787531,0.00011446851,0.00013748593,0.000054194414,0.0004155464,0.000013177811],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070272064,0.000040128503,0.00036505697,0.00009069104,0.000005783603,0.000031336775,0.0005707306,0.0014595194,0.036998805,0.0011369163,7.132626e-7,0.95923007],"study_design_scores_gemma":[0.0059411246,0.0012148232,0.0057149245,0.0022858493,0.000079657955,0.000082556435,5.537403e-7,0.5976481,0.08697637,0.018581284,0.28018945,0.0012853101],"about_ca_topic_score_codex":0.000003640329,"about_ca_topic_score_gemma":0.0001065431,"teacher_disagreement_score":0.95794475,"about_ca_system_score_codex":0.00008761946,"about_ca_system_score_gemma":0.000182019,"threshold_uncertainty_score":0.72911453},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016067286,0.00092862226,0.9920264,0.00086708076,0.0011933021,0.0004140561,0.000008382975,0.00012504985,0.002830381],"genre_scores_gemma":[0.17958276,0.0003569986,0.8166189,0.002059468,0.0011711939,0.000043150878,0.0000060816105,0.000058397938,0.00010302846],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972165,0.00001884316,0.00046736136,0.0012020003,0.0006593611,0.00043589956],"domain_scores_gemma":[0.9972432,0.00044845112,0.0003336714,0.001457695,0.00034755107,0.00016938963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004348434,0.00041634156,0.00045080067,0.00072714087,0.00022405859,0.00025596807,0.0029380491,0.00034510222,0.000007327405],"category_scores_gemma":[0.000009362902,0.0003844597,0.000077158445,0.0008699038,0.0003029316,0.0004856391,0.0015836686,0.000882755,0.000014205456],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074029695,0.00003540064,0.0003079305,0.0002717461,0.000021515329,0.000012757184,0.0015711462,0.0027746863,0.010317901,0.009860721,7.4654463e-7,0.97481805],"study_design_scores_gemma":[0.0012213112,0.00053698395,0.002091586,0.0027131594,0.0000805438,0.00032993435,0.000003825315,0.15807924,0.10293957,0.705263,0.023777992,0.0029628202],"about_ca_topic_score_codex":0.000076015975,"about_ca_topic_score_gemma":0.0003495777,"teacher_disagreement_score":0.9718552,"about_ca_system_score_codex":0.00005081216,"about_ca_system_score_gemma":0.00037808574,"threshold_uncertainty_score":0.9998607},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000109686654,0.00006106865,0.99452156,0.0010457214,0.00091202225,0.00052515353,0.000014917436,0.0000966724,0.0027132009],"genre_scores_gemma":[0.03930638,0.000011967939,0.9580277,0.002110301,0.00024167079,0.000031109845,0.000059824186,0.000016630149,0.00019438958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741733,0.000016354592,0.0006374103,0.00062181475,0.00089062564,0.00041648353],"domain_scores_gemma":[0.99839884,0.00016090782,0.0002698467,0.0008152073,0.00024133932,0.00011386685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064565364,0.00032357904,0.0003135727,0.0011721745,0.00014374986,0.0002200658,0.0011639708,0.00019753144,0.000015962027],"category_scores_gemma":[0.00014961729,0.00031375294,0.000052108775,0.00084216846,0.00017285698,0.004758226,0.00090934726,0.0004700544,0.00010811731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004383701,0.000008278014,0.00007957297,0.00003991668,0.0000022314193,0.0000089858095,0.0014818537,0.24908066,0.000029272642,0.60201555,0.000012624585,0.14723666],"study_design_scores_gemma":[0.00084533036,0.00021826499,0.003479751,0.0020462826,0.0000033568529,0.00005373649,0.0000010977868,0.39649412,0.0004532203,0.53232217,0.06273527,0.001347373],"about_ca_topic_score_codex":0.00011348383,"about_ca_topic_score_gemma":0.00016726792,"teacher_disagreement_score":0.14741348,"about_ca_system_score_codex":0.0005399917,"about_ca_system_score_gemma":0.00060331123,"threshold_uncertainty_score":0.99993145},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093477755,0.000070276146,0.99547136,0.00015974953,0.0008732311,0.00047418984,0.0000053828826,0.000029900428,0.0019811061],"genre_scores_gemma":[0.3531961,0.000009526317,0.6465495,0.0001473119,0.000053224234,0.000003830381,0.000001804834,0.000007892279,0.000030765645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969563,0.000071408016,0.00087204756,0.0007098373,0.0010181341,0.00037228758],"domain_scores_gemma":[0.9966364,0.00016051739,0.0008587816,0.0019856894,0.00030849353,0.00005014276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024230385,0.0002570943,0.0003546759,0.00030401078,0.00015482682,0.00006358406,0.0036465537,0.00015882573,0.000010065223],"category_scores_gemma":[0.00017936944,0.00020135455,0.00013241905,0.0005953523,0.000649143,0.00082943426,0.0010055737,0.00034550545,0.000002093438],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061324395,0.000031214222,0.00020495127,0.00005881023,0.000005223016,3.940397e-7,0.0006506855,0.0029088338,0.002582515,0.05601461,0.000002380701,0.9375343],"study_design_scores_gemma":[0.0005067336,0.00047753204,0.016460693,0.00073066424,0.000025852809,0.000022263062,9.5158464e-7,0.47903845,0.24065472,0.26052737,0.00083727104,0.00071750727],"about_ca_topic_score_codex":0.000018196182,"about_ca_topic_score_gemma":0.000011838649,"teacher_disagreement_score":0.93681675,"about_ca_system_score_codex":0.00025907796,"about_ca_system_score_gemma":0.00036674694,"threshold_uncertainty_score":0.8211},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006426435,0.000091801616,0.998427,0.0002720006,0.00048823594,0.00039625287,0.00015312411,0.000039293307,0.000068045745],"genre_scores_gemma":[0.0007761059,0.00001645757,0.9985058,0.00037146595,0.00019657321,0.000011647025,0.00007388848,0.000015036802,0.00003302451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978315,0.000020869233,0.00040892497,0.0009843679,0.0003957855,0.0003585554],"domain_scores_gemma":[0.9974777,0.0015082674,0.0003113078,0.00044572493,0.00018005703,0.000076926975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015507401,0.00024504343,0.00028586495,0.0005874567,0.00016237715,0.00036259554,0.0006198395,0.0001672597,0.0000026501077],"category_scores_gemma":[0.0002734649,0.0002503925,0.000032506217,0.00039706798,0.00010039486,0.000716474,0.0004290454,0.00041554458,0.0000017946622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053918275,0.000034575114,0.00007890734,0.00003686438,0.000007144931,0.000004572516,0.00038708592,0.00293333,0.0013080637,0.024268523,0.000018059918,0.97091746],"study_design_scores_gemma":[0.0002632296,0.000042540058,0.00018846255,0.00026039034,0.000009205099,0.000053498658,5.839354e-7,0.98103654,0.00082516356,0.01509624,0.0019457086,0.00027843833],"about_ca_topic_score_codex":0.00017692216,"about_ca_topic_score_gemma":0.00036098636,"teacher_disagreement_score":0.9781032,"about_ca_system_score_codex":0.0005243536,"about_ca_system_score_gemma":0.0002211388,"threshold_uncertainty_score":0.9999948},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016755675,0.0004817453,0.9952691,0.001034653,0.00087415293,0.00047916654,0.0000054737607,0.00052887027,0.001310089],"genre_scores_gemma":[0.038088933,0.0000689742,0.958603,0.0017213608,0.00049569696,0.00000319742,0.00000618935,0.00006291465,0.00094971235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955157,0.000058492842,0.0006143838,0.0017699255,0.0012959758,0.0007455055],"domain_scores_gemma":[0.9962466,0.00060128386,0.0004635244,0.0019441282,0.00052948657,0.00021497696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006443552,0.0006556702,0.00057588646,0.0010691751,0.0003906191,0.00085077825,0.003711587,0.0005081396,0.000028477909],"category_scores_gemma":[0.00029522507,0.00059590663,0.00024236282,0.0011107983,0.0010965772,0.0007789995,0.00076411123,0.0010760257,0.000039192222],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010003816,0.0003068652,0.00021443049,0.00035765802,0.00005442658,0.0014406809,0.0011444178,0.004671918,0.037130576,0.034866575,0.00023300166,0.9194794],"study_design_scores_gemma":[0.00039254857,0.00016623466,0.000076076096,0.000518704,0.000013859456,0.0001810538,9.9750466e-8,0.798445,0.16112463,0.036106005,0.0018809346,0.0010948412],"about_ca_topic_score_codex":0.000019392597,"about_ca_topic_score_gemma":0.0000041216576,"teacher_disagreement_score":0.91838455,"about_ca_system_score_codex":0.000546283,"about_ca_system_score_gemma":0.00057294784,"threshold_uncertainty_score":0.9996492},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003978893,0.0007973293,0.9965111,0.00018544872,0.0009883627,0.0003006304,0.0000056216163,0.00011097382,0.00070264743],"genre_scores_gemma":[0.17737174,0.000020023695,0.8213554,0.00039833738,0.00057086354,0.0000050637286,0.0000049892883,0.000034175475,0.00023938263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746996,0.000022056278,0.00033796177,0.0010892897,0.0005122147,0.00056854513],"domain_scores_gemma":[0.99815303,0.00083918555,0.00015068708,0.0005442534,0.00017201097,0.0001408567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085734826,0.00034548002,0.0003359073,0.00060348253,0.0004682987,0.00059460895,0.0010102834,0.00025195538,0.0000066202924],"category_scores_gemma":[0.000090294045,0.00034126334,0.00006306846,0.00025368348,0.00026641303,0.0004503904,0.00040514313,0.00066033466,0.000006236853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090310505,0.000014687444,0.00024000798,0.00017859886,0.000013303872,0.00010130457,0.0016795531,0.57350147,0.0001906568,0.004588333,0.00003509711,0.41944796],"study_design_scores_gemma":[0.00016743033,0.000106561994,0.00008103037,0.00068832224,0.0000071718587,0.00011004584,2.1236646e-7,0.9735983,0.00025730158,0.024188811,0.00039917836,0.0003956479],"about_ca_topic_score_codex":0.000028436452,"about_ca_topic_score_gemma":0.0000037453103,"teacher_disagreement_score":0.4190523,"about_ca_system_score_codex":0.00016574663,"about_ca_system_score_gemma":0.00021087955,"threshold_uncertainty_score":0.9999039},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000040127247,0.00015247804,0.9885977,0.00068595755,0.0027296224,0.0011138882,0.0000090747435,0.00044567842,0.00626158],"genre_scores_gemma":[0.00022043647,0.0000063653565,0.9958199,0.0027243416,0.00033550974,0.000060713628,0.0000058794276,0.00006040176,0.00076644565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946101,0.00015014868,0.00097180967,0.0021963832,0.001095013,0.000976594],"domain_scores_gemma":[0.993945,0.0019063225,0.0006757419,0.0025345625,0.0007113928,0.00022695113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004998675,0.0007020164,0.000761396,0.0010282287,0.0004094252,0.0006925179,0.004984088,0.00049503485,0.0000066423518],"category_scores_gemma":[0.0024137339,0.0006729346,0.00018765051,0.0011618151,0.00045773495,0.000875116,0.0012108841,0.0007615394,0.000036521065],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004226493,0.000023701561,0.0000067526444,0.00007441684,0.000011750255,0.000013606676,0.00032871735,0.01459143,0.00030233726,0.04597106,0.00019320179,0.9384788],"study_design_scores_gemma":[0.0003296864,0.00018275861,0.000025920614,0.00023982972,0.000012179103,0.00013877066,6.826979e-8,0.8179978,0.003234351,0.16893224,0.008248371,0.0006580339],"about_ca_topic_score_codex":0.000016851945,"about_ca_topic_score_gemma":0.00000609826,"teacher_disagreement_score":0.9378208,"about_ca_system_score_codex":0.00049814704,"about_ca_system_score_gemma":0.00077516853,"threshold_uncertainty_score":0.99957216},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090019405,0.00061781803,0.9939329,0.00054243475,0.0014818269,0.0004731784,0.000005534514,0.00012949659,0.0019166349],"genre_scores_gemma":[0.25138617,0.000029744944,0.7454597,0.002625312,0.00040997867,0.000007046098,0.0000088098295,0.00003918592,0.000034079832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948083,0.000063783715,0.00080261537,0.0019614229,0.001283125,0.0010807137],"domain_scores_gemma":[0.99743134,0.0002927317,0.00037695473,0.0015319375,0.00017527546,0.00019173959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001319323,0.00068163936,0.0007040113,0.001071681,0.0003035057,0.00070112187,0.0034879805,0.0004176748,0.000023870463],"category_scores_gemma":[0.00006801799,0.00062179816,0.00015818844,0.0009953922,0.00048423628,0.0008069789,0.001118469,0.000932801,0.000022974462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061511146,0.00003629966,0.00015714018,0.000022086173,0.0000046685286,0.0001442786,0.00023456437,0.6358743,0.00003619441,0.0011569808,0.0000041784433,0.3623232],"study_design_scores_gemma":[0.00053595245,0.00010342529,0.00008794265,0.00063011795,0.0000060928455,0.000021051532,1.273188e-7,0.96675855,0.00017470407,0.03003974,0.00093462755,0.00070769584],"about_ca_topic_score_codex":0.00014912328,"about_ca_topic_score_gemma":0.00035439496,"teacher_disagreement_score":0.3616155,"about_ca_system_score_codex":0.00094344054,"about_ca_system_score_gemma":0.00092416885,"threshold_uncertainty_score":0.99962336},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003900256,0.00009555296,0.9968956,0.000368694,0.0009930695,0.00050609576,0.000005228481,0.00076943525,0.00032732717],"genre_scores_gemma":[0.057788424,0.000029546776,0.9408538,0.0006188934,0.00022630183,0.000032999822,0.00001704954,0.000057736255,0.00037529608],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974309,0.000019182278,0.00047901203,0.0010854135,0.00043959927,0.000545889],"domain_scores_gemma":[0.997634,0.0009410228,0.00023303328,0.00080912246,0.00029344548,0.000089355046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008249378,0.000407125,0.00040290225,0.0008266051,0.00018762573,0.000480404,0.0022908326,0.00030839053,0.00004509838],"category_scores_gemma":[0.001012156,0.00041502574,0.00008657952,0.0009018295,0.00016783635,0.0006507585,0.00089072884,0.00092201435,0.000021161559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073593465,0.000061159255,0.00070626533,0.0001489777,0.000014372446,0.00008419206,0.0017495996,0.30204594,0.00005056926,0.02997656,0.000118652955,0.6650363],"study_design_scores_gemma":[0.0008638786,0.001011472,0.00037309044,0.0014561425,0.000021111839,0.00020588751,5.7610544e-7,0.46399933,0.002046416,0.48790315,0.039953183,0.002165777],"about_ca_topic_score_codex":0.000025645442,"about_ca_topic_score_gemma":0.00003674646,"teacher_disagreement_score":0.6628706,"about_ca_system_score_codex":0.00043245935,"about_ca_system_score_gemma":0.0008404418,"threshold_uncertainty_score":0.9998302},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060961043,0.000051936702,0.99699515,0.00016784533,0.0008515903,0.0012900915,0.00013397544,0.00012205323,0.00032642158],"genre_scores_gemma":[0.0006981654,0.00007859605,0.99705666,0.00031260273,0.00072140497,0.000048786584,0.00031946538,0.000034930803,0.00072937977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685603,0.000022609134,0.0005957106,0.0012960666,0.0006933146,0.00053623883],"domain_scores_gemma":[0.99787027,0.00034471197,0.0004202372,0.0009386982,0.00029302904,0.00013303215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089305756,0.00041603946,0.0004976608,0.001368089,0.00015400657,0.0004477057,0.0021497344,0.00020848888,0.00003828345],"category_scores_gemma":[0.00004560792,0.00039899437,0.00016631486,0.0008176367,0.00011438898,0.0013229328,0.0005625399,0.00017784421,0.000014774502],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000906871,0.000048769663,0.0000062971535,0.000034654,0.000016573033,0.000005412471,0.00008635764,0.0007143321,0.00011414663,0.00012297792,0.00020068446,0.9986407],"study_design_scores_gemma":[0.0010049491,0.0011001027,0.00015479658,0.00023141528,0.000028649665,0.000010599613,1.9205775e-7,0.94952303,0.0015593204,0.043990314,0.0017774743,0.00061912584],"about_ca_topic_score_codex":0.00009050086,"about_ca_topic_score_gemma":0.000046336754,"teacher_disagreement_score":0.9980216,"about_ca_system_score_codex":0.00017988354,"about_ca_system_score_gemma":0.000232193,"threshold_uncertainty_score":0.9998462},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034240486,0.0002885716,0.9963303,0.0005007173,0.0019124439,0.0004698349,0.00003029929,0.00034158735,0.000092007314],"genre_scores_gemma":[0.005831044,0.00003120624,0.9924655,0.00070489384,0.0006267816,0.000017058454,0.00000981694,0.00004009699,0.00027361835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703753,0.000019449433,0.0004856683,0.0012810308,0.00056923495,0.0006070818],"domain_scores_gemma":[0.99490374,0.0032810422,0.00019068182,0.0011613726,0.0003273155,0.0001358252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096945727,0.0004987138,0.0004590875,0.0005498739,0.00026616058,0.00063942024,0.0018949262,0.00031522004,0.000007513012],"category_scores_gemma":[0.0007507007,0.00047569157,0.00013451987,0.00027915402,0.00036982296,0.0012371355,0.00075529667,0.00063941116,0.0000146176235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027674616,0.000010743106,0.00000372617,0.000031966218,0.000007507039,0.00042015003,0.00016008064,0.5892819,0.000049728318,0.01793776,0.000028430173,0.39206523],"study_design_scores_gemma":[0.00046844815,0.00016866377,0.00006646993,0.0003280096,0.00001334942,0.0022282808,1.7899042e-7,0.7158554,0.0016261743,0.26670232,0.011100664,0.0014420543],"about_ca_topic_score_codex":0.000007268523,"about_ca_topic_score_gemma":0.00004099881,"teacher_disagreement_score":0.39062318,"about_ca_system_score_codex":0.0002887055,"about_ca_system_score_gemma":0.0003702925,"threshold_uncertainty_score":0.99976945},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055125376,0.0002400233,0.98894006,0.0014549132,0.0038340231,0.00044695626,0.000001092817,0.00026918386,0.004758609],"genre_scores_gemma":[0.10076705,0.00002585603,0.8931234,0.0032460622,0.0012884467,0.00004890373,0.0000123969685,0.000084074636,0.0014038375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968949,0.000037250265,0.00038761424,0.0013214514,0.00062557927,0.0007331998],"domain_scores_gemma":[0.9980599,0.00048714157,0.00024221384,0.000737231,0.0002649475,0.00020856364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009956877,0.0004984947,0.00044546326,0.00081482023,0.00040267486,0.00083643594,0.0020759862,0.000320691,0.000036749],"category_scores_gemma":[0.0002535136,0.0004956413,0.00016696802,0.00067247264,0.00013318782,0.00047436066,0.0003268739,0.001202335,0.000046113713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008030197,0.000043592623,0.000103098144,0.00016455808,0.000017639064,0.000029573539,0.0016725856,0.6682032,0.0005156563,0.04065635,0.00024047884,0.28834525],"study_design_scores_gemma":[0.0004907544,0.00019471705,0.00006196551,0.000311294,0.000008141454,0.000031781743,0.0000020117975,0.8897817,0.0007460557,0.003746823,0.10381378,0.0008109865],"about_ca_topic_score_codex":0.0000031767652,"about_ca_topic_score_gemma":0.000010034025,"teacher_disagreement_score":0.28753427,"about_ca_system_score_codex":0.0002935741,"about_ca_system_score_gemma":0.00091054523,"threshold_uncertainty_score":0.99974954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022440695,0.0007104044,0.99598646,0.000046728976,0.00039821892,0.00038269625,0.000002835973,0.000053994845,0.0001746058],"genre_scores_gemma":[0.9416868,0.000054870263,0.05785091,0.00005405622,0.00019756677,0.000007095419,0.0000065362397,0.00003356042,0.00010859601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989571,0.0000049697805,0.00020379946,0.00039605924,0.00018403518,0.0002540232],"domain_scores_gemma":[0.9996504,0.000059187983,0.000016131777,0.00019197442,0.000014201346,0.000068094174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002323498,0.00020643891,0.00023154859,0.00018019737,0.000110900386,0.0001899047,0.00015884438,0.00014658122,0.0000023870546],"category_scores_gemma":[0.0000073181254,0.00019426995,0.000020379935,0.000050877028,0.00013880747,0.0001130633,0.00008188481,0.00021004184,0.0000022324862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.527559e-7,0.0000016943654,0.000048932987,0.000092270195,0.000005870259,0.0000037295029,0.00035336716,0.9696954,0.0007486583,0.00060765864,0.0000011523158,0.028440697],"study_design_scores_gemma":[0.00017726455,0.000046264213,0.00036442408,0.00029974623,0.0000054926627,0.00001516308,1.9326893e-7,0.99649084,0.00084468536,0.0014059162,0.00012702963,0.00022300713],"about_ca_topic_score_codex":0.000012540124,"about_ca_topic_score_gemma":0.000017920049,"teacher_disagreement_score":0.93944275,"about_ca_system_score_codex":0.00022641776,"about_ca_system_score_gemma":0.000071441194,"threshold_uncertainty_score":0.7922098},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030372797,0.0033464304,0.9909792,0.00029774036,0.0020166698,0.00025888713,0.000015575166,0.00017498214,0.0028801179],"genre_scores_gemma":[0.084832944,0.000589316,0.9116393,0.0010045074,0.0010957359,0.000021199305,0.000019652782,0.000064535314,0.0007328445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968779,0.000026215863,0.00051148003,0.0012667611,0.00061495294,0.0007027013],"domain_scores_gemma":[0.9977317,0.0002141649,0.00027014563,0.001361037,0.00018884425,0.00023412566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006431921,0.00055414904,0.0005708225,0.00048464086,0.0003001983,0.00032022636,0.0013853845,0.00024560041,0.000020141088],"category_scores_gemma":[0.00006617859,0.00047875923,0.00007156112,0.0002844095,0.0010703219,0.0016857539,0.0021470813,0.0006274177,0.000023612358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034859158,0.000009062458,0.00006655013,0.000058156133,0.000007731696,0.000033339096,0.0011531208,0.000871731,0.000045872355,0.38966486,0.000016025882,0.6080701],"study_design_scores_gemma":[0.00068898784,0.00041301743,0.00014384,0.0012860314,0.000030436866,0.0008702565,0.0000032299442,0.37309554,0.0022821487,0.35960677,0.25817314,0.0034065864],"about_ca_topic_score_codex":0.00008443537,"about_ca_topic_score_gemma":0.00016054884,"teacher_disagreement_score":0.6046635,"about_ca_system_score_codex":0.00016209568,"about_ca_system_score_gemma":0.00032491106,"threshold_uncertainty_score":0.9997664},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002256317,0.00009378438,0.9961382,0.0004923455,0.00024420395,0.00058297254,0.0001401301,0.00010738863,0.0019753077],"genre_scores_gemma":[0.010568342,0.000015658532,0.98819745,0.0005805162,0.00027933717,0.000049636048,0.00012449796,0.000023232207,0.00016133644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972646,0.00002544025,0.0003498726,0.0013893684,0.0005090142,0.00046167854],"domain_scores_gemma":[0.99776083,0.0007323358,0.00036633376,0.000666713,0.00032325296,0.00015054918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079035666,0.00036989062,0.0004081206,0.00035222643,0.00041324407,0.0008193811,0.0014897446,0.0002654531,0.0000028322365],"category_scores_gemma":[0.00014035437,0.00035448867,0.00006461191,0.00024028817,0.00034233654,0.0007689181,0.00051185983,0.0003340911,0.0000043260634],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046572486,0.000051837418,0.000020999876,0.000028948323,0.00002359865,0.000004141839,0.0033252758,0.0023216351,0.000053711094,0.107503384,0.000015754478,0.88664603],"study_design_scores_gemma":[0.00051747484,0.0002510114,0.00051098753,0.00020348883,0.000018903045,0.00001930383,0.0000026928458,0.8203733,0.00052775786,0.17673321,0.00024278922,0.00059906574],"about_ca_topic_score_codex":0.00005526694,"about_ca_topic_score_gemma":0.000017292365,"teacher_disagreement_score":0.886047,"about_ca_system_score_codex":0.00038255382,"about_ca_system_score_gemma":0.00042424462,"threshold_uncertainty_score":0.9998907},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090146594,0.00023268223,0.90618515,0.0020655289,0.00057211897,0.00027304972,0.0000024690082,0.00013727308,0.00038510418],"genre_scores_gemma":[0.92997694,0.00016318368,0.06849133,0.0008697515,0.00048113518,0.0000069366356,0.0000022995619,0.0000058568726,0.0000025375525],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978418,0.00014888482,0.00020781216,0.00056082866,0.00071174593,0.0005289589],"domain_scores_gemma":[0.99886084,0.00017172378,0.00007362291,0.00059523125,0.00014851353,0.00015007464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011792108,0.00013032365,0.0001648436,0.00025914997,0.0011329808,0.0001725758,0.001585864,0.000103219994,0.000025776675],"category_scores_gemma":[0.0009622651,0.00012215604,0.00004296714,0.0021090854,0.0010065514,0.0012603299,0.000586985,0.00027646785,0.00002670499],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059978047,0.00040368055,0.017640585,0.00005871239,0.0000132071855,0.00015577066,0.12818952,0.0359752,0.0022472527,0.01429845,0.00089461985,0.800063],"study_design_scores_gemma":[0.0007964357,0.0001819158,0.010187909,0.00014533626,0.000007331569,0.00007195032,0.00001807608,0.48145863,0.0054481938,0.4926682,0.008121231,0.00089476607],"about_ca_topic_score_codex":0.0012240935,"about_ca_topic_score_gemma":0.00027292842,"teacher_disagreement_score":0.8398304,"about_ca_system_score_codex":0.0001931876,"about_ca_system_score_gemma":0.00042115682,"threshold_uncertainty_score":0.8714087},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029594444,0.00029174003,0.991182,0.00049489393,0.0037873632,0.0007995548,0.0000038694734,0.00029183205,0.0001892829],"genre_scores_gemma":[0.6925568,0.000024877227,0.30021358,0.0021037185,0.0039060025,0.000046761856,0.000022536567,0.00007019473,0.001055524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99568677,0.000045780253,0.00073823886,0.0016929249,0.00091455353,0.000921748],"domain_scores_gemma":[0.99820334,0.00014945767,0.0002938271,0.0007626914,0.00037124095,0.0002194375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090492994,0.0005757509,0.00052591326,0.0006125764,0.00054759014,0.0007023766,0.0017419286,0.00037558764,0.000014266304],"category_scores_gemma":[0.00004723938,0.0005556996,0.00033951283,0.00059318595,0.00020959003,0.00096931314,0.0006964882,0.0006154673,0.000030396786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010643021,0.000024165247,0.000013981204,0.000015770025,0.0000066209645,0.0000064980813,0.00006871332,0.68829834,0.0001435804,0.0042293523,0.00001222841,0.30717012],"study_design_scores_gemma":[0.00042431007,0.00032192367,0.00003395025,0.00012593773,0.000012868479,0.000035352547,9.7176894e-8,0.96450794,0.00008307429,0.0328904,0.00095503026,0.0006090927],"about_ca_topic_score_codex":0.000012322557,"about_ca_topic_score_gemma":0.00006314731,"teacher_disagreement_score":0.69096845,"about_ca_system_score_codex":0.0003120078,"about_ca_system_score_gemma":0.00023992402,"threshold_uncertainty_score":0.99968946},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005153795,0.000020529003,0.97790945,0.00037684655,0.00044210005,0.0025511777,0.000028987102,0.0000649983,0.01855436],"genre_scores_gemma":[0.26705736,0.000008400746,0.7313398,0.00023440493,0.0003929645,0.00039276245,0.000013279743,0.000024341052,0.00053667946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861854,0.000025006297,0.00037044546,0.00039359977,0.0003356639,0.0002567529],"domain_scores_gemma":[0.9968084,0.0021300477,0.00034632397,0.00019797555,0.000447418,0.000069808964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012137741,0.00018736908,0.00034608113,0.00032188365,0.00023392464,0.00015698303,0.0004954876,0.0001999891,0.00007209888],"category_scores_gemma":[0.0016067106,0.00017509559,0.00013727685,0.000114677205,0.0007239945,0.00024008614,0.0000778679,0.0002303929,0.0000027269446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026563897,0.00008595165,0.0000034795814,0.00020252187,0.000016813932,3.2857244e-7,0.014720476,0.00006638175,0.000029341618,0.8254725,0.000058804657,0.15931687],"study_design_scores_gemma":[0.00021334304,0.0001503857,0.0000015276139,0.0011002057,0.000024731555,0.0000013380395,0.0000393964,0.0037747447,0.0014563035,0.98976547,0.0032620714,0.00021050702],"about_ca_topic_score_codex":0.000039340044,"about_ca_topic_score_gemma":0.00007966278,"teacher_disagreement_score":0.2670058,"about_ca_system_score_codex":0.00030409923,"about_ca_system_score_gemma":0.00075810245,"threshold_uncertainty_score":0.71401906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029305611,0.00016939596,0.9943325,0.0022785857,0.0009293229,0.0009177243,0.000006364582,0.00021891479,0.0011178842],"genre_scores_gemma":[0.001165665,0.00006546003,0.99221367,0.005667735,0.0004016864,0.00005950136,0.000031470725,0.000023796487,0.0003710153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519217,0.000055341883,0.0008149957,0.0014038107,0.0019343557,0.0005993194],"domain_scores_gemma":[0.9975682,0.0008212944,0.0003006868,0.00071761635,0.00030667504,0.00028552304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017503103,0.00044224237,0.0005324815,0.00104934,0.00014837962,0.00038406078,0.0023800551,0.00042201477,0.00019907182],"category_scores_gemma":[0.000313176,0.00040669699,0.00013149215,0.00052420323,0.0006726486,0.0009881235,0.00048571316,0.00071873056,0.00003273687],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001057675,0.000053667496,0.000009422502,0.000035462715,0.000005965594,0.00009211465,0.00029260956,0.0005764511,0.0004361912,0.0053852,0.00022013401,0.9928822],"study_design_scores_gemma":[0.0014593609,0.00059836166,0.00019388353,0.0008450859,0.000011093417,0.00012332338,5.832665e-7,0.7531037,0.033824295,0.20763879,0.0011572717,0.0010442936],"about_ca_topic_score_codex":0.000011344117,"about_ca_topic_score_gemma":0.000025775147,"teacher_disagreement_score":0.9918379,"about_ca_system_score_codex":0.00042103726,"about_ca_system_score_gemma":0.000854958,"threshold_uncertainty_score":0.9998385},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001030298,0.00017501034,0.9923617,0.0005573552,0.001014852,0.0007600446,0.000017575809,0.00035412735,0.004656261],"genre_scores_gemma":[0.7788613,0.00002344649,0.21954845,0.00069284247,0.00038731823,0.000024509325,0.000054232565,0.000040432038,0.00036750548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996217,0.00015019959,0.00067305233,0.0016524288,0.00071905873,0.0005882426],"domain_scores_gemma":[0.9973815,0.00031492012,0.0005706939,0.00086676906,0.0006941031,0.00017198056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010426957,0.00062096503,0.00065969035,0.00073557935,0.0003276687,0.00082779786,0.0014232374,0.00037330802,0.000013247738],"category_scores_gemma":[0.000024527728,0.0005807641,0.00014288955,0.0004157282,0.00036966358,0.0014916322,0.00035666075,0.0007418747,0.000013259371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021702495,0.000045372904,0.0000126457135,0.000017940383,0.000021453861,0.000056715533,0.0014031546,0.005787707,0.00024031107,0.036682114,0.00008737328,0.9556235],"study_design_scores_gemma":[0.000620498,0.00093576504,0.00027203775,0.00053888874,0.000014256346,0.00013758085,0.000014022165,0.9566401,0.0042026793,0.03417991,0.0013507071,0.0010935098],"about_ca_topic_score_codex":0.00069974706,"about_ca_topic_score_gemma":0.00068929227,"teacher_disagreement_score":0.95453,"about_ca_system_score_codex":0.0006354094,"about_ca_system_score_gemma":0.00044348766,"threshold_uncertainty_score":0.99966437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000114384435,0.00050466874,0.9836693,0.0009851765,0.0044133104,0.00040368518,0.00002558851,0.00038555212,0.009498378],"genre_scores_gemma":[0.25246313,0.00051706366,0.7302588,0.010410282,0.0052203718,0.000037032696,0.00030576324,0.00015017786,0.0006373362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99483496,0.000041260133,0.0006606185,0.0019171576,0.0015199041,0.0010260991],"domain_scores_gemma":[0.9962477,0.00052909285,0.00036946803,0.0019673686,0.0004628282,0.00042350419],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001144985,0.0006445606,0.0005105608,0.0018889992,0.0006438584,0.0017054401,0.0037600554,0.0005858165,0.00016026363],"category_scores_gemma":[0.00028903762,0.0006231419,0.0002052736,0.0017225192,0.0007238481,0.0035476894,0.0015172716,0.0012886112,0.00036931774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062130794,0.00007177324,0.00009316788,0.000019983865,0.000016118744,0.00005970031,0.00043595483,0.0007831446,0.000095695556,0.7853652,0.000121826444,0.21293119],"study_design_scores_gemma":[0.00030791637,0.00029015835,0.00016481229,0.00015216513,0.000012527386,0.00013233296,7.192468e-7,0.025996538,0.00079308706,0.8970911,0.07403311,0.0010255399],"about_ca_topic_score_codex":0.00013856546,"about_ca_topic_score_gemma":0.00012450309,"teacher_disagreement_score":0.25341043,"about_ca_system_score_codex":0.00032248785,"about_ca_system_score_gemma":0.0010149735,"threshold_uncertainty_score":0.999622},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013131878,0.0001154832,0.9946178,0.0012149389,0.0016499545,0.00050863874,0.000009093336,0.00023874675,0.0016321681],"genre_scores_gemma":[0.09691087,0.000014138206,0.90096354,0.0013567602,0.000117368516,0.000018032672,0.000016516591,0.00003291794,0.0005698378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997218,0.000024090063,0.00047205357,0.0012264249,0.0005640867,0.0004953489],"domain_scores_gemma":[0.9980572,0.00036560485,0.0003027938,0.0008860679,0.00024642659,0.00014190048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054652564,0.00042077922,0.00040128824,0.0007930201,0.000259925,0.00052726915,0.0016154158,0.0002635798,0.00007078068],"category_scores_gemma":[0.00011574794,0.00041368217,0.00018133021,0.00041978643,0.00038996275,0.0004943404,0.00034147018,0.0004614646,0.00002540892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006287711,0.00001940969,0.00010157103,0.000039925053,0.00000805286,0.000019783465,0.00023025216,0.114669494,0.000019898189,0.010714504,0.00003847041,0.87413234],"study_design_scores_gemma":[0.0003507651,0.0001278661,0.00009212743,0.0003283121,0.000005936598,0.00002790226,7.7596894e-8,0.9796601,0.00011534282,0.017141256,0.0016899501,0.00046038887],"about_ca_topic_score_codex":0.000009390536,"about_ca_topic_score_gemma":0.00009285073,"teacher_disagreement_score":0.87367195,"about_ca_system_score_codex":0.00036877548,"about_ca_system_score_gemma":0.00037921176,"threshold_uncertainty_score":0.9998315},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017221203,0.0025541438,0.98637587,0.0020305896,0.0015324814,0.00033068494,0.000004013453,0.00032256526,0.005127552],"genre_scores_gemma":[0.32321823,0.001457795,0.66193914,0.011589162,0.00021391302,0.000009491459,0.0000058179708,0.00009182606,0.0014745977],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963389,0.000028923725,0.00044180534,0.0016637021,0.0009225102,0.0006041314],"domain_scores_gemma":[0.99778676,0.00039429657,0.00021143472,0.0011907856,0.00018991006,0.00022680762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006280598,0.00051966537,0.0004787271,0.00091571506,0.00033417443,0.0004193889,0.0018332072,0.00029160577,0.000008652228],"category_scores_gemma":[0.00007088294,0.00044511547,0.00009207175,0.00047124567,0.00094845844,0.00036207074,0.0009726133,0.0007679756,0.000088587534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009644498,0.000065779626,0.00010516265,0.0000552983,0.000017981012,0.0002998649,0.0015776292,0.015552166,0.000410829,0.11485234,0.00037985967,0.86667347],"study_design_scores_gemma":[0.0005799082,0.0004565317,0.00018093215,0.0008781953,0.000009447351,0.00033643923,1.1209546e-7,0.2246021,0.0018247447,0.76616204,0.0037757873,0.0011937384],"about_ca_topic_score_codex":0.000023506718,"about_ca_topic_score_gemma":0.000013292622,"teacher_disagreement_score":0.8654797,"about_ca_system_score_codex":0.00008269974,"about_ca_system_score_gemma":0.0002407458,"threshold_uncertainty_score":0.9998001},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013169028,0.00072639674,0.99450105,0.0019131405,0.0012681715,0.0005813424,0.000059056034,0.00027754833,0.00054159726],"genre_scores_gemma":[0.65433097,0.000095759184,0.33989742,0.0024624255,0.0021900148,0.00003737227,0.00012051736,0.000057656558,0.00080787425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99468,0.00005448819,0.00066868996,0.0025877736,0.0011661222,0.00084291364],"domain_scores_gemma":[0.99445164,0.000874732,0.0003593279,0.0036662926,0.0004012009,0.00024677505],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019494629,0.000611428,0.000891019,0.0010938387,0.00031087545,0.000749828,0.008270193,0.00037945237,0.000030159377],"category_scores_gemma":[0.00006867949,0.00056578504,0.00028322465,0.0013726727,0.00049733085,0.00082097074,0.0014051235,0.00063004956,0.000031668194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050580184,0.000021353922,0.000010149104,0.000008330107,0.00008855446,0.000010436821,0.000086212836,0.2638254,0.0000016067665,0.01126705,0.000095970914,0.7245799],"study_design_scores_gemma":[0.00044097088,0.00007358343,0.00003454688,0.00008478477,0.00018666316,0.000015208378,8.886075e-8,0.98307437,0.000013276177,0.0069642495,0.008466444,0.00064580183],"about_ca_topic_score_codex":0.000007980785,"about_ca_topic_score_gemma":0.00069855485,"teacher_disagreement_score":0.72393405,"about_ca_system_score_codex":0.00023232131,"about_ca_system_score_gemma":0.0008406485,"threshold_uncertainty_score":0.9996794},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012806949,0.00065673376,0.942441,0.0020787797,0.0019502946,0.00033393526,0.000006465925,0.00026084817,0.052259132],"genre_scores_gemma":[0.04104721,0.00020763006,0.9433009,0.011781905,0.0014834742,0.000010467954,0.000016001946,0.00005973785,0.0020926439],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99497056,0.00003936999,0.00061727484,0.002085636,0.0012835317,0.0010036179],"domain_scores_gemma":[0.9967881,0.00027866176,0.00030389192,0.0021674267,0.000197884,0.0002640469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080094516,0.0007150588,0.00068066677,0.0007181782,0.00034889395,0.00093295326,0.005178059,0.0005270144,0.000041084815],"category_scores_gemma":[0.000047626236,0.0006017675,0.00021074146,0.00076615193,0.0006250622,0.0007778926,0.0013985109,0.0011490183,0.00019274125],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029761088,0.000025786594,0.000012528161,0.000011875259,0.0000068783,0.00017660038,0.00038259488,0.0070733903,0.00001107537,0.032009076,0.0002665065,0.9600207],"study_design_scores_gemma":[0.00034906092,0.00041646714,0.0002669449,0.00027769292,0.000009818505,0.00016663277,9.4597354e-8,0.42193273,0.00015138548,0.533009,0.042208333,0.001211883],"about_ca_topic_score_codex":0.000017862294,"about_ca_topic_score_gemma":0.0000385481,"teacher_disagreement_score":0.95880884,"about_ca_system_score_codex":0.00030922168,"about_ca_system_score_gemma":0.00053754344,"threshold_uncertainty_score":0.9996434},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008718715,0.00005729349,0.9930696,0.00038801707,0.0010259566,0.0006658692,0.0000034915874,0.0002916384,0.0036262907],"genre_scores_gemma":[0.25718132,0.0000036275467,0.7400238,0.0019387106,0.0006747883,0.000015714462,0.000005025364,0.000025528338,0.00013150068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958988,0.000065722576,0.00056455896,0.001888352,0.0009249634,0.0006576105],"domain_scores_gemma":[0.9970637,0.00018767691,0.00022925912,0.0018797775,0.0003067221,0.00033288987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007482261,0.0005329564,0.00046936283,0.00095286395,0.00037182166,0.00096967345,0.003236949,0.0003129749,0.000013164842],"category_scores_gemma":[0.00009936591,0.00050161645,0.00009693863,0.00078898465,0.00036099576,0.0012246626,0.00056587043,0.0006199242,0.000092573166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012654586,0.000048216705,9.040615e-7,0.0000062956333,0.0000035261837,0.00026022675,0.0025503526,0.13610649,0.00033951938,0.009707979,0.000015140083,0.8509601],"study_design_scores_gemma":[0.00003474595,0.00027617475,0.000009408518,0.000070486734,0.0000054226057,0.0007657249,8.265891e-7,0.9383015,0.009026035,0.050769173,0.00017086975,0.0005696103],"about_ca_topic_score_codex":0.000044766282,"about_ca_topic_score_gemma":0.00015571096,"teacher_disagreement_score":0.8503905,"about_ca_system_score_codex":0.00044813528,"about_ca_system_score_gemma":0.00044450077,"threshold_uncertainty_score":0.9997435},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041890927,0.0003633975,0.9898634,0.00010490221,0.0005303445,0.00029613925,0.00016526779,0.00002322569,0.0044642203],"genre_scores_gemma":[0.9065363,0.000023151884,0.090193324,0.0013241312,0.00053780555,0.0000033086426,0.0009842125,0.00004603167,0.00035173292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981496,0.000016211314,0.00032109785,0.00082283764,0.0003568571,0.00033345155],"domain_scores_gemma":[0.9986949,0.00007919936,0.00014940929,0.00078437506,0.00018723022,0.000104900326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015502085,0.00034136666,0.0002486598,0.00022338676,0.00016080699,0.00010377935,0.00062357174,0.0005135352,0.00004024224],"category_scores_gemma":[0.000091398004,0.00034565866,0.0001062593,0.00014378474,0.00045265377,0.000008839986,0.0002676371,0.00042516642,0.000008016246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055819604,0.000042113046,0.00022641002,0.0000251449,0.00010910582,0.0001325385,0.00022602438,0.4865431,0.13018562,0.019488836,0.000015757281,0.36294955],"study_design_scores_gemma":[0.00080566196,0.00029527163,0.0003627814,0.00017457236,0.00006333149,0.00004735974,4.782622e-7,0.6745943,0.061779216,0.2551694,0.0050932863,0.0016143516],"about_ca_topic_score_codex":0.00003608298,"about_ca_topic_score_gemma":0.00083965925,"teacher_disagreement_score":0.9023472,"about_ca_system_score_codex":0.00015006748,"about_ca_system_score_gemma":0.00044387905,"threshold_uncertainty_score":0.99989957},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024837878,0.00046586723,0.9860066,0.00026343032,0.0019031691,0.00036308888,0.0000023105072,0.00019855636,0.010548588],"genre_scores_gemma":[0.030803565,0.000033506574,0.9677159,0.0006112432,0.00031899038,0.000013650523,0.0000055963474,0.000036097394,0.00046142534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576265,0.00008976895,0.0007067528,0.0016772136,0.0009872895,0.00077631825],"domain_scores_gemma":[0.9971628,0.00034525502,0.00035627917,0.0018508547,0.00016007206,0.0001247369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019693724,0.00051910913,0.0005158443,0.0014400994,0.00018204543,0.0004505457,0.004045402,0.00043717577,0.000011852859],"category_scores_gemma":[0.00019837782,0.0005160744,0.00010493305,0.0012087359,0.00059896504,0.0010954763,0.0013696236,0.0011669748,0.000056817382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010408341,0.00006426463,0.0004218141,0.00006106114,0.0000055089954,0.00027072916,0.0007374459,0.14312217,0.00031121838,0.1106752,0.000113036236,0.74420714],"study_design_scores_gemma":[0.00025355836,0.00013989094,0.0017527628,0.0005941114,0.0000036289125,0.00007367902,9.919585e-8,0.9039777,0.0011652982,0.08889745,0.0023870314,0.00075482164],"about_ca_topic_score_codex":0.000094966395,"about_ca_topic_score_gemma":0.00007795696,"teacher_disagreement_score":0.7608555,"about_ca_system_score_codex":0.0005908757,"about_ca_system_score_gemma":0.00046485037,"threshold_uncertainty_score":0.9997291},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013095783,0.00083210034,0.99477315,0.0004400123,0.0014425186,0.00083715323,0.00013891705,0.00014417879,0.0013788984],"genre_scores_gemma":[0.16532563,0.00006026494,0.8324737,0.00096291816,0.0005648086,0.00004220676,0.00017118415,0.00004186656,0.00035744155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950392,0.00011321153,0.000966255,0.002059019,0.0011953341,0.0006269381],"domain_scores_gemma":[0.9951008,0.00048730406,0.0005017447,0.003620232,0.00015435311,0.00013554304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002121463,0.00051791884,0.00069087103,0.00080589356,0.00015910646,0.00036225564,0.003706449,0.00020439594,0.0000064765286],"category_scores_gemma":[0.000067830464,0.00047641806,0.000063134445,0.0005544087,0.0003483779,0.0015758368,0.0014200534,0.0005152154,0.000028898668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013093127,0.000041032632,0.00004441209,0.0001509106,0.000011748895,0.000108427506,0.00014241888,0.5105294,0.000007094565,0.14619893,0.000021550431,0.342731],"study_design_scores_gemma":[0.00074429915,0.000051462306,0.00017220162,0.0007641286,0.000006753319,0.00001198804,0.0000010425344,0.9775267,0.000017422219,0.0035696877,0.016550744,0.00058355526],"about_ca_topic_score_codex":0.00030633446,"about_ca_topic_score_gemma":0.0014008018,"teacher_disagreement_score":0.46699733,"about_ca_system_score_codex":0.00042687572,"about_ca_system_score_gemma":0.0004038359,"threshold_uncertainty_score":0.99976873},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014717692,0.00012967232,0.9894978,0.00020530848,0.0003760223,0.0065087397,0.0000021204837,0.0000994929,0.0030336725],"genre_scores_gemma":[0.047883347,0.0000046867704,0.9503575,0.0005521903,0.0005632135,0.00047417148,0.0000042741754,0.000026302614,0.00013434433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996582,0.000069942944,0.0005273055,0.0013115498,0.0008931437,0.00061606977],"domain_scores_gemma":[0.99739987,0.00008631179,0.00037730727,0.0015904221,0.0003961996,0.00014990682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012449156,0.00044903654,0.0004774214,0.0006609152,0.00031550645,0.0005818029,0.0038276867,0.00025492467,0.0000026007503],"category_scores_gemma":[0.00006444213,0.00031752183,0.0001726395,0.0014165449,0.0004821526,0.0003793002,0.0006956018,0.0005379481,0.000006383329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009918204,0.00010600608,0.00008986374,0.00007548553,0.000014322745,0.0000059007125,0.003996209,0.036734216,0.0005183094,0.06457331,0.000024207488,0.89385223],"study_design_scores_gemma":[0.00031311435,0.0004499207,0.0004984252,0.00051303254,0.000016835562,0.000092393864,8.7104127e-7,0.935581,0.001400175,0.04779937,0.01246045,0.0008743787],"about_ca_topic_score_codex":0.000023139419,"about_ca_topic_score_gemma":0.000022559954,"teacher_disagreement_score":0.8988468,"about_ca_system_score_codex":0.00014597224,"about_ca_system_score_gemma":0.0004582359,"threshold_uncertainty_score":0.9999277},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000080952295,0.000115732255,0.99012166,0.0007178987,0.00082765793,0.00074082013,0.000010644712,0.0003219321,0.007135553],"genre_scores_gemma":[0.0042939633,0.0001101937,0.99288744,0.0012096136,0.000506316,0.000016890643,0.000007105026,0.000040840987,0.00092765986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960271,0.000028911381,0.00055141706,0.0014815356,0.0010324293,0.0008785946],"domain_scores_gemma":[0.99697524,0.0009463298,0.00024851577,0.0012556796,0.000395196,0.00017904287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015149437,0.00044021456,0.00046389623,0.00088485685,0.00040053276,0.00078208843,0.003299877,0.00032551956,0.00008830322],"category_scores_gemma":[0.0001414032,0.0004036632,0.00016551735,0.0005443854,0.0001548032,0.0007443628,0.0013709079,0.00046737806,0.00013160551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109622,0.000053911524,0.000007994901,0.000032263724,0.000009697145,0.000022253435,0.00069003616,0.057637773,0.000072410854,0.07839555,0.00026614234,0.862801],"study_design_scores_gemma":[0.00036222962,0.00013191366,0.00001595957,0.00034442876,0.000003741805,0.0000216271,4.3297142e-8,0.88345754,0.000080054364,0.10434662,0.010784959,0.00045087867],"about_ca_topic_score_codex":0.0000022142667,"about_ca_topic_score_gemma":0.00002057057,"teacher_disagreement_score":0.8623501,"about_ca_system_score_codex":0.00033986376,"about_ca_system_score_gemma":0.0005556378,"threshold_uncertainty_score":0.9998415},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020009065,0.00042646888,0.97350454,0.00046125788,0.002723341,0.00036654578,0.000009310441,0.00008910673,0.022219349],"genre_scores_gemma":[0.34857392,0.0024171802,0.5897702,0.0077115903,0.0012654691,0.000030550083,0.00006151696,0.00024028898,0.049929272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99352753,0.00009275183,0.0010981024,0.001957224,0.0026660697,0.00065833074],"domain_scores_gemma":[0.99638265,0.0006386526,0.00076143787,0.0012257139,0.0007717448,0.00021978436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032469463,0.0005503479,0.0006773202,0.001679698,0.00040447654,0.00083908293,0.0019239198,0.0005009442,0.00044389995],"category_scores_gemma":[0.00058768934,0.00045790488,0.00019134568,0.002029528,0.0006127981,0.0006884995,0.0002876464,0.00081100606,0.00022439875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000111430345,0.000021242722,0.00041476765,0.000003760203,0.000008418878,0.000037198595,0.0002935987,0.34249026,0.000059081915,0.0031261628,0.0005874778,0.6529469],"study_design_scores_gemma":[0.00021855552,0.00011386834,0.0002931608,0.00010398754,0.000015166937,0.0001580027,4.74776e-7,0.6209656,0.00026540333,0.34676716,0.030415254,0.0006833403],"about_ca_topic_score_codex":0.000026937214,"about_ca_topic_score_gemma":0.000292945,"teacher_disagreement_score":0.6522636,"about_ca_system_score_codex":0.00037880585,"about_ca_system_score_gemma":0.00063215493,"threshold_uncertainty_score":0.9997873},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015307317,0.0014114132,0.9930941,0.00022442988,0.0015221898,0.0003882636,5.4808737e-7,0.00013819739,0.0016901232],"genre_scores_gemma":[0.93602866,0.00035964686,0.061881784,0.0002653935,0.0005167402,0.000026220589,0.000006261094,0.00004228267,0.0008730165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968676,0.00011851951,0.00041253484,0.0013367776,0.0007834946,0.0004810885],"domain_scores_gemma":[0.99828863,0.0004913777,0.0003032048,0.0006344454,0.00016606355,0.00011625742],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095470215,0.0003734701,0.00041639936,0.0009023383,0.0002558635,0.00044499137,0.0012169192,0.00030033648,0.000005153938],"category_scores_gemma":[0.0001935788,0.000385197,0.000045074557,0.0006125869,0.00043368436,0.0006340939,0.0006077561,0.0010388508,0.000016065364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005709988,0.000049317936,0.0040946594,0.00015174439,0.0000074208574,0.00012451054,0.009435307,0.45184192,0.000078912875,0.012747582,0.000034590466,0.52142835],"study_design_scores_gemma":[0.00017040584,0.0001351495,0.0022832544,0.0005346767,0.000002612818,0.00022158977,0.0000011309876,0.9905719,0.000034807766,0.003125081,0.0024448705,0.00047451007],"about_ca_topic_score_codex":0.00012917024,"about_ca_topic_score_gemma":0.00007608469,"teacher_disagreement_score":0.9344979,"about_ca_system_score_codex":0.00045449755,"about_ca_system_score_gemma":0.00049794896,"threshold_uncertainty_score":0.99986},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055776673,0.00010105907,0.98988926,0.0010225448,0.0008872334,0.0004125249,0.000006180697,0.00009891439,0.0075264783],"genre_scores_gemma":[0.046999145,0.00006534641,0.9490185,0.0027017663,0.00046545325,0.000021766527,0.000016891818,0.00003557795,0.0006755653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648917,0.000028742072,0.00042150426,0.0013536501,0.0010277258,0.0006792389],"domain_scores_gemma":[0.99736965,0.00025897194,0.00019447373,0.0020301112,0.00006991009,0.00007688032],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015898611,0.00045247126,0.00035324862,0.0007244933,0.00024118768,0.0011344474,0.0076416275,0.0002283108,0.0000068916706],"category_scores_gemma":[0.00003859796,0.00032877325,0.00009064291,0.0006499839,0.0004906632,0.0010629611,0.0020247686,0.0013013532,0.000034165412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018750189,0.000046737106,0.000017556844,0.000029360826,0.000005143508,0.00012420153,0.0014198419,0.06610565,0.000104040686,0.08609121,0.000030004228,0.8460244],"study_design_scores_gemma":[0.000121659425,0.000029960966,0.000019696596,0.000089060755,0.000003216856,0.0000151241065,2.6522935e-7,0.80259573,0.00016305488,0.19565524,0.0009644301,0.00034254612],"about_ca_topic_score_codex":0.000020275977,"about_ca_topic_score_gemma":0.00015657846,"teacher_disagreement_score":0.84568185,"about_ca_system_score_codex":0.00008794244,"about_ca_system_score_gemma":0.00020388914,"threshold_uncertainty_score":0.99991643},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028025784,0.01038351,0.9603264,0.00007697679,0.00041886288,0.0003390495,0.00017284886,0.000029903376,0.00022669397],"genre_scores_gemma":[0.7478906,0.00033684072,0.24722789,0.0006439832,0.001386436,0.00000678926,0.0020286841,0.00010951941,0.0003692619],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974537,0.000028225311,0.00034998584,0.0014701321,0.00029809723,0.00039985852],"domain_scores_gemma":[0.9983584,0.000042330863,0.00027182885,0.001119633,0.00010269646,0.00010509918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000401043,0.0003857098,0.00025877738,0.00016619623,0.00021566615,0.00016511483,0.0010813707,0.0004184472,0.0000068252375],"category_scores_gemma":[0.000056216573,0.000380213,0.000049678547,0.000100699624,0.00044285262,0.000024221068,0.0015326494,0.0003140485,0.0000028350807],"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.000009671634,0.000008425429,0.00013257476,0.000036572852,0.000007509852,0.000010871674,0.000017833236,0.000998291,0.9456914,0.0000016951454,0.0002535018,0.052831654],"study_design_scores_gemma":[0.00027117736,0.00006022316,0.00007843733,0.000393727,0.000017596747,0.00008259838,9.4878544e-8,0.009961336,0.976604,0.0012360949,0.010705212,0.0005895313],"about_ca_topic_score_codex":0.000018886334,"about_ca_topic_score_gemma":0.000031032014,"teacher_disagreement_score":0.7198648,"about_ca_system_score_codex":0.00007156178,"about_ca_system_score_gemma":0.00019236602,"threshold_uncertainty_score":0.999865},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033469446,0.00020805345,0.99586904,0.00046429635,0.0015375958,0.0010117835,0.000078093224,0.00018311596,0.0003133408],"genre_scores_gemma":[0.51882046,0.00000511112,0.47932035,0.0005419382,0.0006261933,0.00012238434,0.00023833218,0.000042416897,0.00028282296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958059,0.000024581472,0.00059953076,0.0017318344,0.001109297,0.0007288156],"domain_scores_gemma":[0.99702764,0.00030798189,0.0004498908,0.0012314244,0.000725014,0.00025803165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005785721,0.00060436217,0.00086072367,0.0007963659,0.00036207002,0.0009341606,0.0026820684,0.0003684037,0.000012355068],"category_scores_gemma":[0.000019550891,0.0004780364,0.00029901316,0.001492677,0.00077703426,0.00042094305,0.00041203792,0.0007661082,0.000011267248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040873954,0.00027240397,0.0010653612,0.00017978734,0.00044975968,0.00012331559,0.0006829785,0.030513255,0.000835892,0.051530182,0.000038045975,0.91426814],"study_design_scores_gemma":[0.0016396607,0.0011603968,0.0012912797,0.0009020429,0.0002434988,0.00019851615,3.375012e-7,0.948125,0.002574446,0.018594563,0.02301939,0.0022508681],"about_ca_topic_score_codex":0.000028061442,"about_ca_topic_score_gemma":0.00040654227,"teacher_disagreement_score":0.9176117,"about_ca_system_score_codex":0.00018162561,"about_ca_system_score_gemma":0.00057075947,"threshold_uncertainty_score":0.9997671},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03572612,0.002745946,0.9564541,0.0005969055,0.00028085033,0.00065345626,0.00004432424,0.000011433422,0.0034868426],"genre_scores_gemma":[0.9008233,0.00019318875,0.098471515,0.00017744013,0.00010540601,0.000005796926,0.00004116591,0.000013800223,0.00016842128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904054,0.000011511575,0.00020062139,0.00042087666,0.00016169633,0.0001647234],"domain_scores_gemma":[0.9995262,0.000030131161,0.000073918345,0.00025748493,0.00006190983,0.000050354945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015226676,0.00016555225,0.00020762431,0.0002538124,0.000039540486,0.00001613226,0.00028718676,0.0001447678,0.000008560677],"category_scores_gemma":[0.000011727115,0.00016276805,0.000034573437,0.00012904675,0.0004978667,0.0000056359336,0.00013958362,0.00015744168,0.0000022712572],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099984674,0.0003609087,0.0076184305,0.0003598364,0.00016762404,0.000036723253,0.009299005,0.22480674,0.11430619,0.004061411,0.0003237873,0.63855934],"study_design_scores_gemma":[0.0101776505,0.004086815,0.023715986,0.003609671,0.00026824963,0.00029415858,0.00004397791,0.41900533,0.36565346,0.103200294,0.06257344,0.0073709874],"about_ca_topic_score_codex":0.000010047584,"about_ca_topic_score_gemma":0.00024208042,"teacher_disagreement_score":0.86509717,"about_ca_system_score_codex":0.000030503375,"about_ca_system_score_gemma":0.00014290829,"threshold_uncertainty_score":0.66374886},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03281713,0.00027183205,0.9644091,0.000026339847,0.0006854247,0.0001594417,0.000010359658,0.00003498292,0.0015853748],"genre_scores_gemma":[0.96693915,0.0000519844,0.03260504,0.00022320235,0.000115964394,0.000001064205,0.00000959174,0.000021745094,0.000032239997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845433,0.000009507271,0.00044244112,0.00027233784,0.0006295431,0.00019183163],"domain_scores_gemma":[0.99935776,0.00008425433,0.00013345433,0.00026336825,0.00009235375,0.00006880771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030896647,0.00019706374,0.00037598287,0.0005705557,0.000021773976,0.000021199308,0.00035718724,0.000099842415,0.00003120631],"category_scores_gemma":[0.00004356511,0.00016374132,0.00008486843,0.00023578932,0.00026733268,0.00006769441,0.00006860276,0.00023326634,0.0000051998045],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036962715,0.00002881617,0.00069486187,0.00027298025,0.000020440693,0.000005523817,0.0005446374,0.040509075,0.0012966789,0.000026813797,0.000009945628,0.95658654],"study_design_scores_gemma":[0.0015969604,0.00095518545,0.012271357,0.009291447,0.00019442846,0.0000079676465,0.0000025639663,0.8841056,0.08507163,0.004615271,0.00046674215,0.0014208076],"about_ca_topic_score_codex":0.000010441148,"about_ca_topic_score_gemma":0.000007627436,"teacher_disagreement_score":0.95516574,"about_ca_system_score_codex":0.00007907281,"about_ca_system_score_gemma":0.00003597145,"threshold_uncertainty_score":0.6677177},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021094686,0.0003319248,0.99737376,0.00051776314,0.00080941914,0.00024276257,0.00001382488,0.00010495591,0.0005844813],"genre_scores_gemma":[0.23528673,0.00050012354,0.7524861,0.009271154,0.0011201407,0.000014881129,0.00010102039,0.00014677478,0.001073046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697626,0.000040464096,0.0006072917,0.0008349987,0.001150571,0.0003904002],"domain_scores_gemma":[0.99732363,0.00027869793,0.00049565337,0.0013234258,0.00044700498,0.00013158085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000799847,0.00036436334,0.00039909245,0.0004987851,0.00025247067,0.0004671242,0.0037697484,0.00021127265,0.000039107053],"category_scores_gemma":[0.0002568351,0.00026647645,0.00012991483,0.0010248004,0.0006901283,0.0005710785,0.0011169757,0.00043494848,0.000025338144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044406615,0.000077401935,0.00013328977,0.00012200987,0.000029063054,0.00005666657,0.0020646802,0.042782575,0.000064461885,0.39970237,0.00012682825,0.5548362],"study_design_scores_gemma":[0.00058181694,0.0002571347,0.00020939931,0.0015227658,0.00003234931,0.00010625648,8.932865e-7,0.59432346,0.0024481216,0.39441022,0.0051578735,0.0009496816],"about_ca_topic_score_codex":0.000020678968,"about_ca_topic_score_gemma":0.00003973261,"teacher_disagreement_score":0.55388653,"about_ca_system_score_codex":0.00018332459,"about_ca_system_score_gemma":0.001014999,"threshold_uncertainty_score":0.9999787},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006967563,0.0006100989,0.99348575,0.00015044268,0.0018431738,0.00081630086,0.0000064212904,0.000036291378,0.0023547846],"genre_scores_gemma":[0.94676095,0.000038555114,0.051816106,0.00011516403,0.00029126182,0.000024819248,0.0000023403663,0.000020004774,0.00093078293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997034,0.00008277628,0.0009857448,0.00074400834,0.00078745413,0.00036598527],"domain_scores_gemma":[0.99744576,0.0004998638,0.000775826,0.0009751224,0.00023734165,0.00006610595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012428155,0.0003025347,0.0005302412,0.0008947238,0.00018722615,0.00015208358,0.0019774775,0.00019570481,0.000011061565],"category_scores_gemma":[0.000084426865,0.00023341658,0.00011937487,0.0010183298,0.00028681455,0.00030742187,0.0005746303,0.0003993064,0.000005496982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005160811,0.00010892907,0.0008213835,0.00025497947,0.00002935757,0.00001568956,0.0060978727,0.81777775,0.00043444367,0.01183859,0.000061019513,0.16255482],"study_design_scores_gemma":[0.00029774575,0.00006301696,0.001411987,0.00082020403,0.0000074581367,0.000018396213,0.0000015980595,0.9943263,0.0008457561,0.0006996148,0.0012585846,0.00024936296],"about_ca_topic_score_codex":0.0004122191,"about_ca_topic_score_gemma":0.00038904557,"teacher_disagreement_score":0.94606423,"about_ca_system_score_codex":0.0004293748,"about_ca_system_score_gemma":0.000587824,"threshold_uncertainty_score":0.95184517},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015553299,0.00021120886,0.9809109,0.000049745722,0.0017929748,0.0002375842,0.000005505433,0.00014484291,0.0010939199],"genre_scores_gemma":[0.7273909,0.00010042888,0.27065802,0.0005210127,0.0010831528,0.0000052884698,0.000029824254,0.000049661652,0.00016172536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682224,0.000046069978,0.00065659574,0.001186429,0.0008590161,0.00042966337],"domain_scores_gemma":[0.9980986,0.00022689601,0.0005925808,0.0006915902,0.00026406912,0.00012622325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035193845,0.0004196494,0.0005232644,0.0009856448,0.00041993172,0.00023834321,0.0012955844,0.00033678242,0.000065415246],"category_scores_gemma":[0.00003480123,0.00043509997,0.00018265734,0.0005199042,0.00050177716,0.00091424724,0.00050924625,0.0006938287,0.000027127673],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006012514,0.00006366087,0.000060054455,0.000027281783,0.000020013398,0.00004768362,0.0010549036,0.0025649182,0.008367505,0.00024475117,0.000019784635,0.98752344],"study_design_scores_gemma":[0.0011691268,0.00075595285,0.0005776571,0.0026788786,0.000073407566,0.00025711016,0.0000026258194,0.79404855,0.07398121,0.1201947,0.0037973654,0.0024633817],"about_ca_topic_score_codex":0.00025821722,"about_ca_topic_score_gemma":0.00015905018,"teacher_disagreement_score":0.98506004,"about_ca_system_score_codex":0.00040079982,"about_ca_system_score_gemma":0.00031081957,"threshold_uncertainty_score":0.9998101},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018117954,0.00018636353,0.9887275,0.0005008197,0.0015646275,0.00023636113,0.0000046829664,0.00013826722,0.008460188],"genre_scores_gemma":[0.399065,0.00008757808,0.5910888,0.008001523,0.00042651748,0.000015062198,0.000013630266,0.00008562617,0.0012163117],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699926,0.000045276563,0.00049432827,0.0011120795,0.000924926,0.00042411813],"domain_scores_gemma":[0.9973163,0.00048453506,0.00032356154,0.0016260804,0.00014860382,0.00010092361],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087666675,0.00040650342,0.00046115476,0.0006895697,0.00013676216,0.00023474805,0.0024727806,0.00025868017,0.000045712437],"category_scores_gemma":[0.000096555064,0.0003565011,0.00012110021,0.0004569862,0.00042213287,0.00043701785,0.00053170905,0.00047199617,0.00005617671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050885074,0.00005353372,0.0000058966025,0.000034162917,0.000010349616,0.000034571553,0.00040065538,0.012982782,0.00034959288,0.4180692,0.00017454562,0.5678796],"study_design_scores_gemma":[0.00030843524,0.00028602264,0.0000526183,0.00042254565,0.0000055362093,0.000041763175,7.404116e-8,0.39745724,0.0068305666,0.5924261,0.0016203488,0.0005487323],"about_ca_topic_score_codex":0.000006851527,"about_ca_topic_score_gemma":0.000006232785,"teacher_disagreement_score":0.5673309,"about_ca_system_score_codex":0.00014509531,"about_ca_system_score_gemma":0.0002542358,"threshold_uncertainty_score":0.9998887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016863203,0.00017159956,0.99459237,0.0002476409,0.0008500502,0.0011698729,0.0000120435625,0.00004525566,0.0012248215],"genre_scores_gemma":[0.82278687,0.0000201353,0.17647079,0.0003359657,0.00023287015,0.000053996377,0.00003139612,0.0000224312,0.00004556661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677753,0.00008543593,0.0007245677,0.0009023603,0.0011210344,0.0003890697],"domain_scores_gemma":[0.9977376,0.00029563898,0.0003914306,0.0010575433,0.0004290382,0.000088747765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025644533,0.0003004964,0.0004143428,0.0009588742,0.00013467157,0.00018087182,0.0017260334,0.00025186286,0.00002982194],"category_scores_gemma":[0.00007033658,0.00029096307,0.00010435687,0.00049618667,0.00014296858,0.0011185015,0.0001481136,0.0002530851,0.0000072971498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073444166,0.000070070455,0.00017377934,0.000043661308,0.000005904484,0.000001342855,0.0022527743,0.2512356,0.0002794003,0.02443641,0.00000940108,0.7214843],"study_design_scores_gemma":[0.00056740956,0.00014140952,0.0017100825,0.00021558869,0.000010655343,0.000006007755,3.4060588e-7,0.9225926,0.0008338678,0.07337768,0.00025048468,0.00029387826],"about_ca_topic_score_codex":0.00010162001,"about_ca_topic_score_gemma":0.00050318014,"teacher_disagreement_score":0.82110053,"about_ca_system_score_codex":0.0003031096,"about_ca_system_score_gemma":0.00051919493,"threshold_uncertainty_score":0.9999542},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047209077,0.00029660112,0.99399054,0.00010268964,0.00037213851,0.00017100648,0.000012380334,0.000034175297,0.00029953348],"genre_scores_gemma":[0.95861703,0.00002339918,0.04112841,0.00007990387,0.000102485035,0.0000031563375,0.000010252514,0.000016565056,0.000018810772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991784,0.0000036645208,0.00024111236,0.00020110427,0.00026980834,0.00010590727],"domain_scores_gemma":[0.99922913,0.0001497449,0.00010784058,0.00042821246,0.00006233233,0.000022761249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005248222,0.00014731666,0.00019584074,0.00010237062,0.000052780848,0.000016174692,0.00047626614,0.00015915734,0.0000127429275],"category_scores_gemma":[0.000023233735,0.00011566831,0.00004248718,0.00020140469,0.00021359469,0.00006642571,0.000081839826,0.00023808698,0.000003116305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.0682627e-7,0.0000047702088,0.000025963145,0.000018158347,0.0000035460673,2.8651928e-7,0.00033406896,0.8894486,0.00081039505,0.00011200882,0.00002301391,0.10921871],"study_design_scores_gemma":[0.00007031267,0.0000143226725,0.0023624464,0.00022348517,0.000010348805,0.000003248703,1.4043658e-7,0.94084066,0.03838967,0.017249176,0.000674293,0.00016189375],"about_ca_topic_score_codex":0.000049390474,"about_ca_topic_score_gemma":0.000021256297,"teacher_disagreement_score":0.9538961,"about_ca_system_score_codex":0.000050101833,"about_ca_system_score_gemma":0.000057184407,"threshold_uncertainty_score":0.47168165},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025275277,0.0002769612,0.9775008,0.00006376976,0.00083264627,0.0004937729,0.000004318177,0.000042581203,0.020532425],"genre_scores_gemma":[0.04297049,0.00008317897,0.9547094,0.00043614703,0.00054137246,0.0000050606923,0.000005990717,0.00006292211,0.0011854456],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768066,0.000061699684,0.00069156813,0.0005750463,0.00065155735,0.00033947424],"domain_scores_gemma":[0.99602216,0.002526139,0.0004214644,0.00064374943,0.00029477838,0.000091678194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032534816,0.00033458526,0.00078411726,0.0005895401,0.00008428235,0.000053068405,0.00060437,0.00031954542,0.000033353364],"category_scores_gemma":[0.0008972532,0.00027638464,0.00019139962,0.00023748627,0.00043467607,0.00008525631,0.00023155373,0.00043084234,1.8729324e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027754245,0.00004540334,0.000030088404,0.00029765937,0.000033422315,0.00004354068,0.0012425525,0.0027889651,0.0003849561,0.044068396,0.000057202036,0.95073026],"study_design_scores_gemma":[0.00871167,0.0002607946,0.000011546558,0.0017838127,0.00011825045,0.00007396528,0.0000010311783,0.13516542,0.012836363,0.83604527,0.00377261,0.0012192791],"about_ca_topic_score_codex":0.000010780271,"about_ca_topic_score_gemma":0.00010902892,"teacher_disagreement_score":0.949511,"about_ca_system_score_codex":0.00011098913,"about_ca_system_score_gemma":0.00016748434,"threshold_uncertainty_score":0.9999688},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11885341,0.00020809901,0.87954974,0.0000029539945,0.00067018374,0.00056851865,0.00004289444,0.00008250226,0.000021687483],"genre_scores_gemma":[0.9176026,0.0000067150377,0.08197872,0.00001500826,0.00024787552,0.00009522065,0.000003788442,0.000044164513,0.000005903287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986289,0.000011950305,0.00043232512,0.0004118131,0.000238349,0.0002766474],"domain_scores_gemma":[0.9990119,0.00034864017,0.00016937699,0.000269418,0.000083992876,0.000116706484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024622236,0.000300363,0.00040754935,0.00032795744,0.0000799357,0.0000685409,0.00027332333,0.0001990253,0.000005746286],"category_scores_gemma":[0.000054332726,0.00029699257,0.00007744207,0.000080309685,0.00011415275,0.00051034766,0.000080463346,0.0002187034,6.333381e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001753955,0.00004227375,0.000021562935,0.000107505264,0.00001477043,9.0227593e-7,0.0011221087,0.0804224,0.20765121,0.0000019685594,1.6933801e-7,0.7105976],"study_design_scores_gemma":[0.00030736183,0.00027357627,0.000015219171,0.00016382517,0.0000067968613,0.000011729893,0.0000042681404,0.66239417,0.33656237,0.000043399872,0.000025522566,0.00019176406],"about_ca_topic_score_codex":0.000050323564,"about_ca_topic_score_gemma":0.00011640547,"teacher_disagreement_score":0.7987492,"about_ca_system_score_codex":0.00012849313,"about_ca_system_score_gemma":0.000019850757,"threshold_uncertainty_score":0.9999482},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005994116,0.00007625433,0.9971857,0.00020599853,0.000687285,0.0011655523,0.000011006109,0.000022853166,0.000045945893],"genre_scores_gemma":[0.49563125,0.000002929907,0.50411683,0.000078938356,0.00006785387,0.0000707424,0.0000036866873,0.000014631867,0.000013126429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794424,0.0000108821205,0.00038817982,0.0008329222,0.00047511503,0.000348693],"domain_scores_gemma":[0.9971894,0.0016518217,0.00025960975,0.00074302213,0.00010415257,0.000051999654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072128535,0.0002528432,0.0003058826,0.0002979575,0.00016091266,0.00018425735,0.0013812627,0.00021562858,8.587908e-7],"category_scores_gemma":[0.00021665118,0.00018528166,0.00008553262,0.0001715364,0.00034648125,0.0004248642,0.00027881318,0.00035510605,0.0000030359752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014495813,0.000076116594,0.0001109804,0.00006854052,0.000013221922,0.000003515654,0.001529626,0.24247403,0.0015231037,0.011220944,0.000004176317,0.7428308],"study_design_scores_gemma":[0.00026810818,0.00019507838,0.00013566152,0.00043759972,0.000007198535,0.000008907367,4.2239927e-7,0.95224303,0.0002851861,0.046126444,0.00008171318,0.00021062362],"about_ca_topic_score_codex":0.000011516067,"about_ca_topic_score_gemma":0.00017380794,"teacher_disagreement_score":0.74262017,"about_ca_system_score_codex":0.00020177153,"about_ca_system_score_gemma":0.00015790577,"threshold_uncertainty_score":0.7555567},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032877186,0.00006759712,0.9910835,0.00001357079,0.00014026645,0.008055867,0.000002004556,0.00012128843,0.00048301995],"genre_scores_gemma":[0.31156033,0.00007244612,0.6874922,0.00002461789,0.00014396102,0.0006142345,0.000010919567,0.00006909116,0.0000121997855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866325,0.00000880552,0.0003590988,0.00042976154,0.00032350537,0.00021559554],"domain_scores_gemma":[0.99941653,0.00007869467,0.0001406665,0.00021075208,0.00010448626,0.000048881117],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013827303,0.00027525096,0.0002883122,0.0003024991,0.000087653534,0.000042614007,0.00018783195,0.00021098192,0.000009942818],"category_scores_gemma":[0.000010666502,0.0002773483,0.000032744065,0.000262509,0.0001935562,0.00037121624,0.00006091116,0.00028388115,5.932401e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007657826,0.000003036585,0.000010693236,0.00010302899,0.000003110603,0.0000016017808,0.00028612578,0.7436899,0.00033364352,0.0009604964,2.2936635e-7,0.25460047],"study_design_scores_gemma":[0.00030350283,0.000057064262,0.00005866,0.0011475646,0.0000052326727,0.000004902704,1.4251194e-7,0.9547828,0.0024311813,0.04092995,0.000026541868,0.00025246863],"about_ca_topic_score_codex":0.0000032698313,"about_ca_topic_score_gemma":0.000005221741,"teacher_disagreement_score":0.31152746,"about_ca_system_score_codex":0.00024342419,"about_ca_system_score_gemma":0.00006617188,"threshold_uncertainty_score":0.9999679},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006390801,0.00018915182,0.99098337,0.00020188681,0.002270838,0.0004208262,0.000011380241,0.00028325073,0.0055754036],"genre_scores_gemma":[0.009194367,0.00001271345,0.98819846,0.00078119064,0.00038406564,0.000010767648,0.000009244767,0.00003866995,0.0013705372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959043,0.000077013545,0.000644586,0.0016716776,0.0009784234,0.00072396826],"domain_scores_gemma":[0.9962822,0.0005376081,0.0003749506,0.0023292433,0.00029532926,0.0001806504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013306687,0.0005614458,0.00048302306,0.00095470314,0.00030978757,0.0009671886,0.0031360842,0.00041852408,0.000017163833],"category_scores_gemma":[0.00021184077,0.0005345126,0.00013850561,0.00077881746,0.00076088466,0.0015366521,0.001300958,0.0008907668,0.00011870368],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050703693,0.000036550115,0.000029098253,0.000037511458,0.000008794722,0.002313337,0.0003393113,0.025561398,0.00010130753,0.08526391,0.00027485008,0.8860289],"study_design_scores_gemma":[0.00027266,0.00015208992,0.00009761374,0.0002225422,0.000011725901,0.003527688,6.406465e-8,0.852841,0.0023057582,0.12685193,0.012630963,0.0010859248],"about_ca_topic_score_codex":0.00011580462,"about_ca_topic_score_gemma":0.00007220487,"teacher_disagreement_score":0.88494295,"about_ca_system_score_codex":0.00041744983,"about_ca_system_score_gemma":0.0003843313,"threshold_uncertainty_score":0.9997106},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025889582,0.0006568985,0.97089624,0.0005193865,0.0005769818,0.00039152175,0.0000019191314,0.0005559682,0.026375163],"genre_scores_gemma":[0.03586603,0.00008987442,0.9611625,0.0013350226,0.00049730105,0.000013182872,0.000013183837,0.000046103247,0.0009768148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553525,0.000038533308,0.00060122757,0.0018236759,0.0011671302,0.0008341747],"domain_scores_gemma":[0.99730736,0.00019236,0.0003864017,0.0016339871,0.0002501411,0.00022977519],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063358224,0.000701098,0.00062573625,0.0009340517,0.00035903708,0.0007527051,0.0037802719,0.00033926492,0.00008431724],"category_scores_gemma":[0.000028339698,0.0006087771,0.000118932316,0.00064301974,0.0005393644,0.0007607084,0.0012496012,0.00084535213,0.000039292998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016951482,0.000095232754,0.00010483264,0.000032530403,0.00003392036,0.00025345036,0.0016095433,0.40656954,0.00008977322,0.029636566,0.00042891264,0.56112874],"study_design_scores_gemma":[0.00042603537,0.00032180035,0.000054122298,0.0006218777,0.000008344257,0.00017256694,2.1545561e-7,0.96249497,0.002605574,0.021843916,0.010212881,0.0012376872],"about_ca_topic_score_codex":0.000015987267,"about_ca_topic_score_gemma":0.000019648143,"teacher_disagreement_score":0.55989105,"about_ca_system_score_codex":0.0004219537,"about_ca_system_score_gemma":0.000573213,"threshold_uncertainty_score":0.99963635},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022927357,0.0005096259,0.9954452,0.0012485508,0.0007848674,0.00046674244,0.000011322156,0.00047711263,0.0008273197],"genre_scores_gemma":[0.032926943,0.000030850973,0.9626418,0.0027899677,0.0006994982,0.00000259983,0.000010109156,0.00005595207,0.00084232504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995331,0.000056967383,0.0006460355,0.0017338312,0.0014443583,0.00078781886],"domain_scores_gemma":[0.99686193,0.0003941025,0.0004025094,0.0015241269,0.00058419583,0.00023310386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087706157,0.0006779762,0.00061301887,0.00093234447,0.0003769452,0.0009896024,0.003764466,0.000498358,0.00009660453],"category_scores_gemma":[0.0002060562,0.0006070793,0.0002561508,0.00081366336,0.0013040175,0.0009679806,0.0008797406,0.001124048,0.00005869745],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008229607,0.00017047333,0.00008784675,0.00013659203,0.000028266102,0.000273471,0.0009340954,0.0007532289,0.1389292,0.02834817,0.00004686174,0.8302095],"study_design_scores_gemma":[0.00077117997,0.0004083306,0.00066654914,0.00073223363,0.000031393745,0.0002367012,0.0000011668185,0.574228,0.40070593,0.017968573,0.002183639,0.0020663296],"about_ca_topic_score_codex":0.00001806713,"about_ca_topic_score_gemma":0.000008702891,"teacher_disagreement_score":0.8281432,"about_ca_system_score_codex":0.0006332287,"about_ca_system_score_gemma":0.0009645452,"threshold_uncertainty_score":0.9996381},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000838819,0.00044088005,0.98782057,0.00025881827,0.00080980576,0.00031424704,0.000027970855,0.00024518094,0.009243718],"genre_scores_gemma":[0.5306907,0.00007349989,0.46746656,0.0010638825,0.0004852147,0.00001177341,0.00013747269,0.000035421035,0.000035470697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99590456,0.0000411301,0.000607093,0.0017274567,0.000996078,0.00072370237],"domain_scores_gemma":[0.99777347,0.00040787688,0.00031024672,0.0010840456,0.00019583062,0.00022853026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067879964,0.0005904537,0.00061908836,0.001258835,0.0004609712,0.0008108263,0.0022719316,0.0003300825,0.000029450763],"category_scores_gemma":[0.000046470886,0.0006018377,0.00013919207,0.00094347587,0.0012184707,0.0009974146,0.0015229171,0.00091783877,0.000022989583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018254046,0.0001336319,0.0046479423,0.0002006687,0.000073402836,0.0003910063,0.0020761504,0.014852682,0.00037818606,0.76583177,0.00081407663,0.21058226],"study_design_scores_gemma":[0.0006325861,0.00008273322,0.0038178007,0.0004355005,0.000012551781,0.00020748666,4.979968e-7,0.45206827,0.00023134283,0.53504205,0.006299306,0.0011699031],"about_ca_topic_score_codex":0.0001490501,"about_ca_topic_score_gemma":0.00018491218,"teacher_disagreement_score":0.5298519,"about_ca_system_score_codex":0.0001574454,"about_ca_system_score_gemma":0.0002848506,"threshold_uncertainty_score":0.9996433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000085203465,0.0026052361,0.9944028,0.00028609825,0.0012005545,0.0008146147,0.0000075455678,0.0003646688,0.00023326458],"genre_scores_gemma":[0.034790453,0.000012625422,0.9636639,0.00087344256,0.0004050588,0.000020550535,0.000007897827,0.000039835155,0.00018628355],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627596,0.000041350446,0.00051805616,0.0016699662,0.00076483097,0.00072984124],"domain_scores_gemma":[0.9972939,0.00072756654,0.0003790169,0.0011115967,0.00030764978,0.00018030834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016780703,0.0006017781,0.0005335397,0.0006453362,0.00046291295,0.0008138259,0.0030718474,0.0004497371,0.000007663438],"category_scores_gemma":[0.00018623928,0.00051917817,0.00010922973,0.00032503722,0.00075565855,0.00056519936,0.0021268448,0.00096393307,0.000003984846],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011111476,0.000023505354,0.000017245775,0.00005932824,0.000012664638,0.000029937813,0.0012635051,0.00016649054,0.0016005199,0.05492311,0.0000091880875,0.9418834],"study_design_scores_gemma":[0.00042679973,0.00025502717,0.000028132188,0.00059576414,0.0000109352295,0.00008454386,6.2989284e-7,0.24556002,0.03882001,0.7128713,0.0004964472,0.00085035607],"about_ca_topic_score_codex":0.000013996118,"about_ca_topic_score_gemma":0.00004927874,"teacher_disagreement_score":0.94103307,"about_ca_system_score_codex":0.00020236413,"about_ca_system_score_gemma":0.0002537672,"threshold_uncertainty_score":0.999726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013722857,0.0002899181,0.9853997,0.0022296514,0.0019812076,0.0004157926,0.0000012068574,0.0001724153,0.008137816],"genre_scores_gemma":[0.8271923,0.000031339783,0.16823576,0.0030267853,0.00060932885,0.000021649885,0.000005768982,0.000055564782,0.0008214808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963462,0.000048861573,0.0005887857,0.0014040109,0.0008700967,0.0007420814],"domain_scores_gemma":[0.99708945,0.00072279305,0.00037937483,0.0013593484,0.00039318658,0.00005586845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001605546,0.00050989655,0.0004345445,0.002086811,0.00035000668,0.00033698158,0.003814717,0.00045932003,0.000037307196],"category_scores_gemma":[0.00025071728,0.00039149806,0.00010629334,0.0014271922,0.001245662,0.00074641703,0.0015633642,0.0022096888,0.00006432972],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001552506,0.000038657552,0.000214085,0.00001911835,0.0000133274,0.00028464646,0.004607658,0.004293765,0.00088366313,0.15631667,0.00004669108,0.8332662],"study_design_scores_gemma":[0.0010176628,0.0007610072,0.002055699,0.001718009,0.000014792939,0.00066301617,0.000013720943,0.690427,0.010231035,0.28149927,0.009652273,0.0019465165],"about_ca_topic_score_codex":0.00004347561,"about_ca_topic_score_gemma":0.0005731659,"teacher_disagreement_score":0.8313197,"about_ca_system_score_codex":0.00073784,"about_ca_system_score_gemma":0.00033213163,"threshold_uncertainty_score":0.9998537},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010880291,0.00012312902,0.99211484,0.0007277896,0.0013642351,0.00022336598,0.000016296464,0.00013844599,0.0051831035],"genre_scores_gemma":[0.099077635,0.000006679291,0.8944427,0.005438886,0.0003728737,0.0000134055945,0.00004865892,0.000033538105,0.0005656259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956164,0.00006279204,0.00047958008,0.002084909,0.001135848,0.0006204861],"domain_scores_gemma":[0.9972227,0.00030150535,0.00024323988,0.0018068019,0.00014450804,0.00028120176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006506675,0.0005239804,0.00052139343,0.0009584293,0.00025594435,0.0010195998,0.0034375375,0.00025272582,0.000030122024],"category_scores_gemma":[0.000085978034,0.00048413998,0.00016341497,0.0009852666,0.00020489903,0.0008076612,0.00071008125,0.00068853336,0.000086476175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008382099,0.00010045999,0.00013500989,0.000017599896,0.000029973027,0.000062566054,0.00043225812,0.19134574,0.00029148112,0.0031554054,0.00044613468,0.803975],"study_design_scores_gemma":[0.00023613425,0.000091716385,0.00012645013,0.00013832064,0.00002096948,0.000015758435,1.9031806e-7,0.9788588,0.00075766037,0.0120568145,0.0069714235,0.00072573265],"about_ca_topic_score_codex":0.00012880741,"about_ca_topic_score_gemma":0.000032331624,"teacher_disagreement_score":0.80324924,"about_ca_system_score_codex":0.0002516922,"about_ca_system_score_gemma":0.000243714,"threshold_uncertainty_score":0.99976104},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040072246,0.0006829071,0.9800914,0.0012792521,0.0013370848,0.001091953,0.000013522546,0.0002590358,0.014844116],"genre_scores_gemma":[0.51991135,0.00010349557,0.47304472,0.002057131,0.0009667894,0.00007036394,0.000011655705,0.00015506735,0.0036794546],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99266446,0.00008734636,0.00073483726,0.0028493176,0.0021659818,0.0014980835],"domain_scores_gemma":[0.9947972,0.0010340692,0.0006992726,0.0025294689,0.0005111178,0.00042883283],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011068785,0.0010187243,0.0010108474,0.0016406492,0.00047474296,0.0007493877,0.0060353135,0.0005908161,0.00020303235],"category_scores_gemma":[0.00012937702,0.0009248433,0.0003027969,0.0011483349,0.002813914,0.0014185627,0.0020632402,0.0019510625,0.0002034296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006388407,0.00016819866,0.0003667228,0.00009600407,0.00007836149,0.00040292987,0.00091674057,0.017202266,0.0002018917,0.07081346,0.000058873833,0.90963066],"study_design_scores_gemma":[0.0013094845,0.00040310094,0.0014874191,0.00084185804,0.000022485765,0.00036945913,0.0000053162835,0.11640595,0.006337449,0.86774045,0.002933996,0.0021430454],"about_ca_topic_score_codex":0.0000099677145,"about_ca_topic_score_gemma":0.0003759947,"teacher_disagreement_score":0.90748763,"about_ca_system_score_codex":0.0006619327,"about_ca_system_score_gemma":0.0009367259,"threshold_uncertainty_score":0.99989986},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013738278,0.00006156339,0.99523914,0.0008216157,0.00080315256,0.0016132253,0.000012859305,0.0004924795,0.0009545803],"genre_scores_gemma":[0.0031482624,0.0000220917,0.99043834,0.0056369277,0.00035040578,0.00024334174,0.000023865174,0.00005153174,0.000085250686],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9943331,0.00008089489,0.0007993323,0.0018822639,0.0020909053,0.00081352284],"domain_scores_gemma":[0.99616367,0.0005125404,0.00037880422,0.0019401837,0.00038560104,0.0006192072],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024052085,0.00061340217,0.0006043037,0.0008448545,0.00021501374,0.00042658846,0.0058411174,0.0005818939,0.00028650204],"category_scores_gemma":[0.00025658167,0.00054367806,0.00019088211,0.00037111779,0.0012848745,0.0007931841,0.00075065554,0.00077803107,0.00003130927],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022483227,0.00025133337,0.000010084716,0.00014448585,0.000017130613,0.00026178022,0.00043700688,0.00016114535,0.014816701,0.028352695,0.00037905292,0.9551461],"study_design_scores_gemma":[0.000678685,0.0010918191,0.0000089958185,0.0006955841,0.000015735865,0.00007588111,1.2159191e-7,0.2303171,0.5237466,0.24061114,0.0016320557,0.0011262947],"about_ca_topic_score_codex":0.000024815772,"about_ca_topic_score_gemma":0.000018068282,"teacher_disagreement_score":0.9540198,"about_ca_system_score_codex":0.00038778537,"about_ca_system_score_gemma":0.0014210709,"threshold_uncertainty_score":0.9997015},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034355836,0.00017392407,0.9947421,0.000030068823,0.000343257,0.0004842634,0.00001808518,0.00003778299,0.000734923],"genre_scores_gemma":[0.9760486,0.000078553545,0.023155816,0.00018324408,0.00039886663,0.000013736896,0.000035927093,0.000028870614,0.000056411434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989456,0.0000057502416,0.00024321015,0.00034974638,0.00026025475,0.00019546719],"domain_scores_gemma":[0.9994645,0.0002407302,0.000075585056,0.000098998644,0.000057466365,0.000062730775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017703572,0.00021832765,0.00025334084,0.00032925478,0.0000608475,0.000039813727,0.00012284353,0.00017188444,0.000024329876],"category_scores_gemma":[0.000023495877,0.00023358094,0.00004979431,0.00008127953,0.00024120827,0.00010038477,0.000055082157,0.00022961167,0.000005598445],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024026323,0.000013887583,0.000014794221,0.00012429888,0.000017633058,0.0000058180035,0.00036905578,0.0083406,0.001305888,0.00004382684,0.0000065592358,0.98973364],"study_design_scores_gemma":[0.0013447164,0.0004724928,0.0014251075,0.0015251519,0.00005004251,0.000015349635,0.0000016505161,0.9747828,0.0072512645,0.011712517,0.0007640161,0.00065486337],"about_ca_topic_score_codex":0.000002576159,"about_ca_topic_score_gemma":0.0000075757375,"teacher_disagreement_score":0.98907876,"about_ca_system_score_codex":0.00009771668,"about_ca_system_score_gemma":0.00003766826,"threshold_uncertainty_score":0.9525154},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012491937,0.00021480149,0.9605042,0.0005663425,0.0004917681,0.0011656245,0.000105523475,0.00010958803,0.024350265],"genre_scores_gemma":[0.9688659,0.0003924862,0.029117873,0.000819141,0.00030659276,0.0000014326915,0.000065310305,0.00002062249,0.00041065674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637586,0.000021446667,0.0004026935,0.0012070428,0.0011134504,0.00087952055],"domain_scores_gemma":[0.9984474,0.00038632253,0.00006953113,0.00052843906,0.00011026962,0.00045800835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048690493,0.00047200883,0.0005057953,0.0006963383,0.00035403128,0.0003391132,0.0010474878,0.0003113101,0.00028826235],"category_scores_gemma":[0.000021691425,0.00039347188,0.00006389322,0.00041808133,0.00078759005,0.00019410904,0.00014659936,0.0007355787,0.00014272725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003684029,0.00000963104,0.00030771134,0.0000356386,0.000012630827,0.00012016645,0.0018995559,0.5571617,0.00010968077,0.000011643689,0.000020681837,0.4402741],"study_design_scores_gemma":[0.00069373543,0.0005902391,0.004367323,0.00019144299,0.000019652396,0.0001420001,0.000001356738,0.98217434,0.00088353886,0.0051744343,0.004565396,0.001196553],"about_ca_topic_score_codex":0.0011457243,"about_ca_topic_score_gemma":0.005414235,"teacher_disagreement_score":0.95637393,"about_ca_system_score_codex":0.000054262156,"about_ca_system_score_gemma":0.00031984947,"threshold_uncertainty_score":0.9998517},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005124048,0.000745002,0.98667634,0.0003033913,0.0009823204,0.00042801496,0.00000374748,0.00018967039,0.010159099],"genre_scores_gemma":[0.5496401,0.0006496982,0.44246075,0.0038690905,0.0004646537,0.00004235957,0.000005847097,0.00015537311,0.0027121198],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99535424,0.000063829706,0.0004163027,0.0020843542,0.0011389889,0.0009422876],"domain_scores_gemma":[0.9965534,0.0007199922,0.00020258164,0.0020023144,0.00019960484,0.000322064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010689261,0.0006198242,0.0005471983,0.0017642764,0.0003400511,0.00040196907,0.0040361807,0.0003189125,0.000035773144],"category_scores_gemma":[0.00010001908,0.0005448526,0.00013207333,0.00091127265,0.0017308786,0.00064892456,0.0018940193,0.0012810639,0.000101597565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014315153,0.000024058423,0.000054255703,0.000022904273,0.000008782438,0.00011625647,0.0004438899,0.00056322344,0.00012282973,0.48620757,0.000008692448,0.5124132],"study_design_scores_gemma":[0.00023643876,0.000475017,0.0002110005,0.00024562268,0.000004017623,0.0000872139,7.339917e-8,0.017514046,0.0016173589,0.977903,0.0010656759,0.000640514],"about_ca_topic_score_codex":0.000013126617,"about_ca_topic_score_gemma":0.00003359139,"teacher_disagreement_score":0.5491277,"about_ca_system_score_codex":0.00016146348,"about_ca_system_score_gemma":0.0002865625,"threshold_uncertainty_score":0.9997003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029436857,0.000048659298,0.9929357,0.002618228,0.0014623808,0.0007717571,0.000009114013,0.00075937517,0.001100375],"genre_scores_gemma":[0.10520245,0.000034630048,0.8832785,0.010424539,0.00047275613,0.00001963517,0.0000063357047,0.00005009188,0.00051106466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99431294,0.000044624565,0.0010117997,0.002323001,0.0013533635,0.00095429027],"domain_scores_gemma":[0.99545234,0.0009677005,0.00031755667,0.0020650148,0.0006296252,0.0005677548],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001168921,0.0007588897,0.00082749024,0.002044904,0.0004242495,0.0007638275,0.005539693,0.00041643172,0.00002245785],"category_scores_gemma":[0.0010805669,0.0006491998,0.0001555159,0.002222228,0.0002437531,0.0004691032,0.00354141,0.000947363,0.00016911072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003021045,0.000036204765,0.0000025645652,0.000009393714,0.000006519651,0.00005582309,0.0012195681,0.56964684,0.00022813847,0.008700563,0.00006261975,0.42000157],"study_design_scores_gemma":[0.0007840079,0.0014294568,0.00014625829,0.0032680552,0.000013637462,0.000089744695,6.448646e-7,0.8856374,0.017046724,0.08473204,0.004434164,0.0024178957],"about_ca_topic_score_codex":0.000026419893,"about_ca_topic_score_gemma":0.0001020342,"teacher_disagreement_score":0.41758367,"about_ca_system_score_codex":0.00055850757,"about_ca_system_score_gemma":0.0014018216,"threshold_uncertainty_score":0.9998408},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000067556764,0.0002723111,0.98460066,0.00067832397,0.0029973204,0.0005461878,0.000010547859,0.00024384905,0.010583252],"genre_scores_gemma":[0.007308564,0.00005310956,0.9869313,0.004314806,0.00043901516,0.000022859083,0.0000044659214,0.000046551122,0.00087927777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950728,0.00006155981,0.00073966384,0.0019517564,0.001286848,0.00088741217],"domain_scores_gemma":[0.9959191,0.00041993466,0.0004786515,0.002621484,0.0003256109,0.00023520621],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012925597,0.00066608813,0.0006399141,0.0008545651,0.0003244793,0.0010066098,0.005745513,0.00038689317,0.00014111352],"category_scores_gemma":[0.00015504748,0.0006336449,0.00017183169,0.00070485874,0.00082556333,0.0015994683,0.002107949,0.0009967486,0.0006951324],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047618555,0.0000207602,0.000018666966,0.00006690254,0.000015000437,0.000035287736,0.0011467017,0.0054269303,0.0009127565,0.11049348,0.0002478565,0.8816109],"study_design_scores_gemma":[0.00028507615,0.0001535591,0.00021039111,0.00028103124,0.000008264574,0.00009864688,1.2985934e-7,0.7381306,0.00403596,0.23723811,0.01851493,0.0010432526],"about_ca_topic_score_codex":0.000050179828,"about_ca_topic_score_gemma":0.00000830382,"teacher_disagreement_score":0.8805676,"about_ca_system_score_codex":0.00043531135,"about_ca_system_score_gemma":0.00037236762,"threshold_uncertainty_score":0.9996339},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009864604,0.0001402542,0.9885509,0.00042495882,0.0002659247,0.0002284539,0.00002677474,0.000051844247,0.00044630733],"genre_scores_gemma":[0.8623996,0.000033701308,0.13610336,0.0013146531,0.00009023525,0.000005821864,0.000013808519,0.0000139282865,0.000024898003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706376,0.00003409175,0.0005279209,0.0011136857,0.0008592238,0.00040131042],"domain_scores_gemma":[0.9978011,0.0004662651,0.0003180276,0.001082937,0.00020104107,0.00013059982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006528401,0.00036800903,0.0006128229,0.002537012,0.00018908498,0.00030031617,0.001519109,0.00016973312,0.00003811389],"category_scores_gemma":[0.000021891596,0.00033439262,0.0002112394,0.001972022,0.00052188267,0.00023721825,0.00044260672,0.0003887193,0.0000029452226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103551865,0.00008635669,0.00075570826,0.000034002074,0.000124198,0.000022797036,0.0016155867,0.027758414,0.000074662035,0.06662798,0.000013168002,0.9028768],"study_design_scores_gemma":[0.00041625096,0.00025933023,0.0035828387,0.00014668811,0.00011004167,0.000005621028,5.9496483e-7,0.9754753,0.00069045613,0.018154342,0.00062201807,0.0005364873],"about_ca_topic_score_codex":0.00005234537,"about_ca_topic_score_gemma":0.0008968869,"teacher_disagreement_score":0.9477169,"about_ca_system_score_codex":0.000099615216,"about_ca_system_score_gemma":0.0002686609,"threshold_uncertainty_score":0.99991083},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063424406,0.00061808445,0.9899539,0.0012991056,0.00237258,0.00035962055,0.0000027492933,0.00024600333,0.005084558],"genre_scores_gemma":[0.082638055,0.000028563256,0.9117595,0.0032888984,0.0012592049,0.0000066267,0.0000046086943,0.000048190042,0.0009663513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952346,0.00009905902,0.0007388228,0.0017695781,0.0012624889,0.00089543953],"domain_scores_gemma":[0.99708474,0.00044902615,0.00039622976,0.0015426668,0.00028991853,0.00023744545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002049948,0.0006480807,0.00074868934,0.00091388304,0.00037567713,0.0009706864,0.0034384492,0.0004016051,0.00005415893],"category_scores_gemma":[0.00015857231,0.0005954033,0.00022131596,0.00064793066,0.0006326593,0.0007872772,0.0016650716,0.0010709439,0.00012133656],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066952116,0.00002166752,0.000024937848,0.000021986696,0.000009150731,0.00024405419,0.00050498557,0.009358295,0.00060366286,0.00576185,0.00004169346,0.983401],"study_design_scores_gemma":[0.0006872157,0.00029165632,0.00021308873,0.0005017949,0.000015916094,0.00026419302,1.1397401e-7,0.8587748,0.010322061,0.116357505,0.011219979,0.001351713],"about_ca_topic_score_codex":0.00011300806,"about_ca_topic_score_gemma":0.00026467151,"teacher_disagreement_score":0.9820493,"about_ca_system_score_codex":0.00041212977,"about_ca_system_score_gemma":0.00078630657,"threshold_uncertainty_score":0.99964976},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031145333,0.00016237698,0.9647293,0.0016972938,0.0014067771,0.00055877573,0.000012205765,0.0001965107,0.030925315],"genre_scores_gemma":[0.26879504,0.0000149604575,0.72805536,0.0015390898,0.0011421527,0.00003421011,0.0000082661745,0.000027742637,0.00038319494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959535,0.000054770353,0.0005047872,0.0018819674,0.0009040247,0.00070096157],"domain_scores_gemma":[0.9972843,0.00045928385,0.00020396804,0.0012788541,0.00046654022,0.0003070798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082977983,0.0005035268,0.0004741774,0.00075178564,0.00048715403,0.00051074877,0.0024997476,0.000308944,0.00007241375],"category_scores_gemma":[0.00024657673,0.00045778175,0.00014950642,0.00080199423,0.00067423977,0.0007010093,0.001450349,0.00087486976,0.0002246462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056299955,0.00008873059,0.00009650408,0.00002489409,0.00001404084,0.000038233782,0.002698082,0.012960538,0.00019315157,0.34626248,0.00009796222,0.6375197],"study_design_scores_gemma":[0.00034771295,0.00046581324,0.0020309447,0.0006490061,0.000017542174,0.00021465748,5.633447e-7,0.08259662,0.0020179676,0.906758,0.0033824237,0.001518726],"about_ca_topic_score_codex":0.000038799808,"about_ca_topic_score_gemma":0.00014298382,"teacher_disagreement_score":0.636001,"about_ca_system_score_codex":0.0007574903,"about_ca_system_score_gemma":0.0010813822,"threshold_uncertainty_score":0.9997874},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013975629,0.00010932463,0.9900816,0.0011282506,0.0015746664,0.00034538686,0.0000021121216,0.00012649206,0.006492394],"genre_scores_gemma":[0.19111358,0.00017791847,0.80526036,0.002410773,0.00025138998,0.000011649095,0.000009276486,0.000050271316,0.0007147582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967108,0.00007018734,0.00052299676,0.0012852772,0.00079545326,0.0006152808],"domain_scores_gemma":[0.99822927,0.00038227934,0.0001654838,0.0008737371,0.00019451065,0.0001547376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083423004,0.00038511283,0.00039128575,0.0016385427,0.00017175915,0.0004835522,0.0015855205,0.0003070295,0.000071812596],"category_scores_gemma":[0.00012531373,0.00039384072,0.00008380279,0.0015347739,0.00032525184,0.0006307797,0.0005193516,0.000957185,0.00003885996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000352478,0.00002275608,0.000967926,0.000018724026,0.0000050568915,0.00009998982,0.00047319464,0.114607796,0.000053116626,0.016846407,0.000024222218,0.86687726],"study_design_scores_gemma":[0.0005795138,0.00012232673,0.0016557629,0.00040561002,0.0000040884006,0.00012379077,4.1588058e-7,0.9417627,0.0005665313,0.052994125,0.00092666503,0.0008585099],"about_ca_topic_score_codex":0.00007251088,"about_ca_topic_score_gemma":0.00027592893,"teacher_disagreement_score":0.8660188,"about_ca_system_score_codex":0.00049071136,"about_ca_system_score_gemma":0.0006035798,"threshold_uncertainty_score":0.99985135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014441517,0.00089816534,0.99367034,0.000034912635,0.0012192412,0.0005440654,0.00000261196,0.0007975875,0.0013888974],"genre_scores_gemma":[0.6552838,0.00008313055,0.34406537,0.00013014904,0.0003263111,0.000012698753,0.000004545413,0.00007268431,0.000021321492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967013,0.000013725788,0.0006513405,0.0010716147,0.0005157567,0.0010462478],"domain_scores_gemma":[0.99762803,0.0011132174,0.00010453708,0.00094816234,0.0000868195,0.00011924146],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00076199335,0.00059791445,0.00062286167,0.00066838146,0.00012613773,0.0001280807,0.001238224,0.0008184252,0.00001563933],"category_scores_gemma":[0.00029720695,0.00058244524,0.000094248215,0.0008255264,0.00096198043,0.00022196388,0.00060896535,0.0024708612,0.000015718178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036710792,0.0000067309247,0.0008117331,0.00002600475,0.0000027665096,0.00003870747,0.00006191533,0.6449215,0.000010768569,0.00033286054,0.0000026410662,0.3537807],"study_design_scores_gemma":[0.00018042377,0.000048526195,0.00035898355,0.00083732075,0.0000035275605,0.000012677193,3.9016584e-7,0.9662598,0.00015328571,0.030802699,0.000706673,0.0006356897],"about_ca_topic_score_codex":0.000011077417,"about_ca_topic_score_gemma":0.0006135579,"teacher_disagreement_score":0.65383965,"about_ca_system_score_codex":0.0007371208,"about_ca_system_score_gemma":0.000056121233,"threshold_uncertainty_score":0.9998305},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048450325,0.0005052621,0.9936436,0.00062173506,0.0012350793,0.00051966374,0.000036635112,0.00023409758,0.0027194333],"genre_scores_gemma":[0.38649797,0.000041718187,0.60988384,0.0012301786,0.0010390667,0.00005941922,0.00004397531,0.00006742563,0.0011363948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957082,0.000050186718,0.0006017415,0.0019757957,0.00082502,0.000839045],"domain_scores_gemma":[0.9962718,0.0014884503,0.00041742716,0.0013363215,0.00032378518,0.00016225324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001347036,0.00062375533,0.0007916237,0.0010317507,0.00043131938,0.00088270084,0.0032083215,0.00030276034,0.0000059683957],"category_scores_gemma":[0.00022340911,0.0005588239,0.00030507566,0.00064769,0.00049600983,0.0006396165,0.0011972941,0.0005533749,0.0000214646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009528214,0.000035731835,0.00022104452,0.000069263755,0.00005555401,0.00007775155,0.00046800319,0.018145438,0.0010141139,0.004846453,0.00087515987,0.97418195],"study_design_scores_gemma":[0.000600871,0.00032153665,0.00017779108,0.00072963716,0.000045615092,0.000037995127,9.529365e-7,0.9807946,0.001331666,0.008231221,0.0067997915,0.0009282876],"about_ca_topic_score_codex":0.000024464283,"about_ca_topic_score_gemma":0.00015356547,"teacher_disagreement_score":0.97325367,"about_ca_system_score_codex":0.00027167925,"about_ca_system_score_gemma":0.00045487407,"threshold_uncertainty_score":0.9996863},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018980772,0.00023252986,0.99521315,0.0007242569,0.0011683324,0.00024228854,0.0000040235777,0.00008765003,0.0021379732],"genre_scores_gemma":[0.3228449,0.000011794322,0.67506063,0.000838936,0.00059716543,0.000005326191,0.000017605495,0.000022559641,0.00060105853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722,0.000034698496,0.00057744957,0.0009197338,0.0009034929,0.0003446712],"domain_scores_gemma":[0.9977969,0.00055046094,0.00037459008,0.00083806954,0.00032760948,0.0001124004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009170876,0.0003215048,0.0004307433,0.0011808546,0.00022391441,0.00025577337,0.0016957625,0.00021161948,0.000021182304],"category_scores_gemma":[0.0001414445,0.0003146813,0.00013084637,0.0007715288,0.00030748983,0.00043368412,0.0004064438,0.00039725384,0.000024253983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045940556,0.000020048585,0.000032981407,0.00003848296,0.000014239452,0.000012826188,0.00052394025,0.2359602,0.00065362494,0.24617733,0.00005747516,0.5165042],"study_design_scores_gemma":[0.00032107398,0.000119352655,0.00030114828,0.00024834435,0.000010137948,0.00004031695,8.194763e-8,0.7083903,0.0020653205,0.28538424,0.0026639826,0.00045572134],"about_ca_topic_score_codex":0.000014320747,"about_ca_topic_score_gemma":0.000019214625,"teacher_disagreement_score":0.51604855,"about_ca_system_score_codex":0.000119286015,"about_ca_system_score_gemma":0.00044634406,"threshold_uncertainty_score":0.9999305},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000568743,0.00039840076,0.94134974,0.0015517507,0.0005975892,0.00042314397,0.0000020269586,0.00022734108,0.055393115],"genre_scores_gemma":[0.07110862,0.0006843754,0.9235063,0.0022903844,0.00040877663,0.000019208326,0.000003665959,0.000048618946,0.0019300539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591565,0.000038855804,0.00045899802,0.0016393174,0.0011463636,0.00080078514],"domain_scores_gemma":[0.9976686,0.00018622843,0.00017537788,0.0012912313,0.0004238826,0.00025466186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070381444,0.00051152456,0.00046416218,0.00091125444,0.00038321692,0.0007272268,0.0035608006,0.0003003441,0.00013712667],"category_scores_gemma":[0.000057863104,0.00047144177,0.00013227285,0.00079580204,0.00071893935,0.000975527,0.000897355,0.0010750837,0.00024229137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011192438,0.000033702785,0.00006380763,0.000024488605,0.000013427377,0.000049891274,0.0018182864,0.51449656,0.00001291236,0.13225177,0.000019335786,0.35120463],"study_design_scores_gemma":[0.00029352636,0.00017724333,0.00012148881,0.00021545778,0.000003157747,0.00005143016,3.5799567e-7,0.87963426,0.000045716606,0.11763382,0.0012716016,0.00055193715],"about_ca_topic_score_codex":0.000022155566,"about_ca_topic_score_gemma":0.00002445862,"teacher_disagreement_score":0.3651377,"about_ca_system_score_codex":0.0004389869,"about_ca_system_score_gemma":0.0009153238,"threshold_uncertainty_score":0.99977374},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055819884,0.0006264439,0.98269206,0.00342141,0.00063261174,0.00036170444,0.000108368484,0.00004509971,0.011554086],"genre_scores_gemma":[0.89164466,0.00032401047,0.06810347,0.022073692,0.0028268385,0.000015711617,0.00005594583,0.00013194204,0.014823725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761754,0.000038709088,0.0005010501,0.00053179654,0.00091865903,0.00039226876],"domain_scores_gemma":[0.9952458,0.003199873,0.00037440605,0.0009829762,0.00012997439,0.00006692659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006194149,0.00038441294,0.0004971499,0.00018519204,0.00020862307,0.00023177458,0.0016231018,0.00018648882,0.00016628487],"category_scores_gemma":[0.00034824823,0.00020609103,0.00014057316,0.00036011412,0.00044199932,0.00011930401,0.00019485914,0.0006780947,0.000018204226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009439893,0.00011308085,0.000112876165,0.00018109006,0.00009491,0.000058229143,0.0070760953,0.0004525724,0.000029203444,0.8520598,0.006860479,0.1328673],"study_design_scores_gemma":[0.00024674315,0.00011706102,0.00010825275,0.0007703662,0.000017591898,0.000011257682,0.0000019176468,0.002324439,0.00043571298,0.9773468,0.018308667,0.0003112252],"about_ca_topic_score_codex":0.00008187049,"about_ca_topic_score_gemma":0.000116907046,"teacher_disagreement_score":0.91458863,"about_ca_system_score_codex":0.00010081735,"about_ca_system_score_gemma":0.0002536426,"threshold_uncertainty_score":0.8404148},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011842602,0.0016016945,0.98714614,0.0002930526,0.003658821,0.0004490092,0.000002520601,0.00041035732,0.0063199643],"genre_scores_gemma":[0.51373214,0.0000764476,0.48214105,0.0013681466,0.002122552,0.000021771202,0.000006460377,0.00007177117,0.00045963237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949829,0.000053499207,0.0007450944,0.0017761103,0.001397083,0.0010453386],"domain_scores_gemma":[0.9963153,0.00041550942,0.00036217304,0.0021092016,0.00049574714,0.0003020814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024288315,0.0006189519,0.0007521865,0.00046028086,0.00037768885,0.000592923,0.003927554,0.0004994396,0.000009998003],"category_scores_gemma":[0.00006730981,0.00052711606,0.0001712942,0.00080973736,0.0004626993,0.0013220878,0.001994193,0.00097615365,0.00007671105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038139863,0.000009575703,0.00007424113,0.000048975595,0.000008213454,0.000032552918,0.00059156603,0.7531407,0.0000040410155,0.010802714,0.00012987734,0.23515373],"study_design_scores_gemma":[0.00016697511,0.00007205114,0.000018584547,0.00043186813,0.0000039609,0.000051029023,1.8283318e-7,0.66956013,0.000030600982,0.32772848,0.0014261625,0.0005099466],"about_ca_topic_score_codex":0.00004824446,"about_ca_topic_score_gemma":0.000045974924,"teacher_disagreement_score":0.51361376,"about_ca_system_score_codex":0.0005925175,"about_ca_system_score_gemma":0.0010713665,"threshold_uncertainty_score":0.999718},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029044798,0.000054554614,0.9609338,0.000076357755,0.00011379953,0.0002330543,0.000015823434,0.000021914775,0.009505865],"genre_scores_gemma":[0.7222095,0.0000061017986,0.27731323,0.00023451576,0.00006533086,6.22213e-7,0.000012209682,0.00002819611,0.0001302705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977227,0.000010923901,0.00036201108,0.00088458246,0.00066170155,0.00035812505],"domain_scores_gemma":[0.9989492,0.000104716135,0.00025468398,0.00056474685,0.000028283801,0.000098354234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017980523,0.00032652557,0.00032664672,0.0001372358,0.00013955872,0.00017201954,0.00048379804,0.00013196496,0.0000981772],"category_scores_gemma":[0.000016450815,0.00028287037,0.00006690964,0.00021743681,0.0010058443,0.0002630659,0.00028726866,0.00027771504,0.0000208217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014119687,0.00006473272,0.00032221677,0.000010198033,0.000011503703,0.000011986724,0.000967104,0.2352588,0.05025011,0.000026319123,0.000005193234,0.7130577],"study_design_scores_gemma":[0.00015091542,0.00009258879,0.00008019034,0.00026377867,0.00001878551,0.000016541331,6.641715e-7,0.9593203,0.02183706,0.017423525,0.00032503167,0.0004706261],"about_ca_topic_score_codex":0.00019096801,"about_ca_topic_score_gemma":0.00011119816,"teacher_disagreement_score":0.7240615,"about_ca_system_score_codex":0.00037906453,"about_ca_system_score_gemma":0.00007369127,"threshold_uncertainty_score":0.99996233},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026790934,0.0010374559,0.9953397,0.00014399804,0.0017542157,0.00027835747,0.0000059053787,0.0006760214,0.00049646787],"genre_scores_gemma":[0.045161698,0.000052170464,0.9538719,0.00024914954,0.000406644,0.0000032695305,0.0000018670481,0.000044132772,0.00020917878],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957701,0.00008264499,0.0005405491,0.0018175297,0.0008975876,0.0008916131],"domain_scores_gemma":[0.9961949,0.001569967,0.00031765565,0.0015346329,0.00021631953,0.00016649811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011030323,0.0007529302,0.0007778901,0.0009790746,0.0003085586,0.0005382565,0.0036715062,0.00038191184,0.0000056495464],"category_scores_gemma":[0.0005287619,0.00071124226,0.00014610653,0.000759771,0.0005851235,0.0011827031,0.0012837931,0.0011157803,0.000009660969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001734515,0.000007664853,0.000009600541,0.000011026099,0.0000062776026,0.000048029466,0.0001476068,0.49503714,0.00057817594,0.005654923,7.914824e-7,0.49849704],"study_design_scores_gemma":[0.00034054503,0.0003447526,0.0028615498,0.0010313095,0.000019460107,0.00017998346,4.3001168e-7,0.30654168,0.0049360846,0.6814845,0.00022771436,0.0020319698],"about_ca_topic_score_codex":0.000024752215,"about_ca_topic_score_gemma":0.000028964192,"teacher_disagreement_score":0.6758296,"about_ca_system_score_codex":0.00051716407,"about_ca_system_score_gemma":0.00046394195,"threshold_uncertainty_score":0.9995339},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007600677,0.0005299945,0.99439895,0.00050005096,0.002611722,0.0005702845,0.00011922277,0.00028616696,0.0009076134],"genre_scores_gemma":[0.010344395,0.000038995775,0.98482084,0.0035794917,0.0005174638,0.000030425479,0.00013695422,0.0000826164,0.00044884285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940311,0.00012213255,0.0008221174,0.0025902656,0.0013854415,0.0010489648],"domain_scores_gemma":[0.9947355,0.00033724605,0.00049384777,0.0036504143,0.00032232207,0.0004606986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010589339,0.0008826022,0.0007972823,0.0008566888,0.0004938727,0.00043668304,0.0032778708,0.00035207148,0.00005923972],"category_scores_gemma":[0.000110642155,0.0007964283,0.00018364358,0.0007578782,0.00087633816,0.0021593573,0.0011575959,0.0010067312,0.00010634387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003114842,0.00022179932,0.00012787091,0.0002412046,0.0000366885,0.000992364,0.00074069464,0.4347894,0.0016900217,0.22145651,0.00029964134,0.33937266],"study_design_scores_gemma":[0.0009561545,0.00047783466,0.000039189275,0.0012809878,0.000020405658,0.00020404042,6.5667456e-7,0.90466946,0.0052232537,0.022479778,0.062412653,0.002235597],"about_ca_topic_score_codex":0.000056290603,"about_ca_topic_score_gemma":0.0002024534,"teacher_disagreement_score":0.46988004,"about_ca_system_score_codex":0.0003568218,"about_ca_system_score_gemma":0.0009715725,"threshold_uncertainty_score":0.99944866},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002013203,0.0045873383,0.9552626,0.0005889389,0.001368142,0.00022293336,0.00008054704,0.000018932285,0.035857342],"genre_scores_gemma":[0.95524687,0.0008884333,0.037088472,0.0004631036,0.00080236315,0.0000080740965,0.0000039282622,0.00005141366,0.0054473686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817353,0.000003934386,0.0007185722,0.00065020827,0.0000680918,0.00038564877],"domain_scores_gemma":[0.99840045,0.00027716678,0.00052398373,0.0006929438,0.000046731497,0.00005872639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010104673,0.00023937577,0.00046773106,0.00027748643,0.0001985326,0.00013026403,0.0012260115,0.00016709496,0.000098397766],"category_scores_gemma":[0.00006667998,0.00020525794,0.00013885285,0.000121292585,0.00095595187,0.00014633678,0.00033938471,0.00032225574,0.00008174144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071500763,0.000013676166,0.00006509621,0.000011535501,0.000011167217,0.0000017703755,0.00042306376,0.051692106,0.000004283445,0.8622268,0.000023359133,0.085520014],"study_design_scores_gemma":[0.00025543003,0.00014205939,0.000056760313,0.00008458594,0.0000039952633,0.000011036735,6.721126e-7,0.1544283,0.00039400486,0.7962112,0.047900498,0.0005114906],"about_ca_topic_score_codex":0.000038001395,"about_ca_topic_score_gemma":0.00006124962,"teacher_disagreement_score":0.95323366,"about_ca_system_score_codex":0.00014482546,"about_ca_system_score_gemma":0.00009732996,"threshold_uncertainty_score":0.8370176},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002070406,0.0005665089,0.99420047,0.00012817662,0.0021824425,0.00049807504,0.00000518264,0.00019901998,0.0020130728],"genre_scores_gemma":[0.012851058,0.000054716624,0.98541087,0.0004968255,0.00015542014,0.000012213894,0.0000034809482,0.00004396711,0.0009714211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574196,0.00007830978,0.000766634,0.0017844657,0.0009020057,0.0007266457],"domain_scores_gemma":[0.997258,0.0003702564,0.00060743483,0.0012514446,0.00032101013,0.00019187124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012824208,0.0005914847,0.0005347485,0.00069999875,0.000386274,0.00073049386,0.0025398978,0.00036318408,0.000016862412],"category_scores_gemma":[0.00028947266,0.0005701168,0.0000746436,0.00066223316,0.00073761353,0.0014024127,0.0014055122,0.000879196,0.00003968203],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045527895,0.000050802548,0.00012296684,0.00010312351,0.000009923273,0.000035200315,0.0012050926,0.0026688857,0.00069223635,0.0045592417,0.000012956374,0.990535],"study_design_scores_gemma":[0.0004180085,0.00018196457,0.00014201197,0.00056638673,0.000009597335,0.000112777074,6.388306e-7,0.9878583,0.0028927547,0.005557863,0.0015145054,0.00074518763],"about_ca_topic_score_codex":0.000026996853,"about_ca_topic_score_gemma":0.000033059936,"teacher_disagreement_score":0.98978984,"about_ca_system_score_codex":0.00036946282,"about_ca_system_score_gemma":0.00014835288,"threshold_uncertainty_score":0.99967504},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041755204,0.00049232197,0.99391496,0.0008131152,0.00198214,0.00025512307,0.000062207786,0.00005001357,0.0020125688],"genre_scores_gemma":[0.88054013,0.000018458495,0.11560291,0.0007367239,0.0015605323,0.000012688409,0.000019309216,0.00004467762,0.0014645465],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99376196,0.00007787338,0.00092803774,0.0015090061,0.0029949758,0.0007281769],"domain_scores_gemma":[0.99096334,0.0065479283,0.00044142499,0.0011960318,0.0006315335,0.00021973308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002876014,0.00044999956,0.00048361323,0.00033840464,0.00096997665,0.0006628055,0.0021052705,0.00024400683,0.00013686814],"category_scores_gemma":[0.0037994857,0.00028864807,0.00012680136,0.0009245325,0.0015908665,0.0005573161,0.0011178053,0.0011322886,0.00012332849],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023617149,0.00001654565,0.00016768996,0.0000067223823,0.0000049623673,0.0027013873,0.00022611143,0.10377581,0.000020005484,0.007131988,0.00016780871,0.8857573],"study_design_scores_gemma":[0.00023666165,0.000101693324,0.00031859652,0.00021479695,0.000015660713,0.0030777222,0.0000024945143,0.31942603,0.00022152456,0.6618636,0.013853683,0.00066754635],"about_ca_topic_score_codex":0.000036780522,"about_ca_topic_score_gemma":0.00013475327,"teacher_disagreement_score":0.8850898,"about_ca_system_score_codex":0.000359329,"about_ca_system_score_gemma":0.00034848985,"threshold_uncertainty_score":0.99995655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000287956,0.000471693,0.99629045,0.000023525436,0.00059862324,0.00035208627,0.0000066973453,0.00019268533,0.0017762617],"genre_scores_gemma":[0.17337847,0.000020244308,0.82634467,0.00011154866,0.000068232344,0.0000066800394,0.0000051647626,0.000024797428,0.000040225408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954115,0.000076217206,0.00083943433,0.0016587572,0.0012341198,0.0007799484],"domain_scores_gemma":[0.9964415,0.0011520409,0.0004295916,0.0016044107,0.00023840638,0.00013404828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015858639,0.00054882304,0.0011390274,0.0033480965,0.000070508824,0.00013413206,0.003694656,0.00038323036,0.0000035805815],"category_scores_gemma":[0.00025802947,0.0005382926,0.0002367398,0.0031827486,0.00074397033,0.00086841715,0.0013989926,0.0008585222,0.0000020846792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057833086,0.0000256977,0.00011165987,0.000020448624,0.00006348923,0.00004692077,0.0014660594,0.8836698,0.000043958735,0.017565962,3.7117988e-7,0.096979834],"study_design_scores_gemma":[0.00022818196,0.0001309101,0.00071122847,0.00015548329,0.00003964377,0.0000067422766,3.9598154e-7,0.87243074,0.0003326811,0.12544595,0.0000074404,0.000510581],"about_ca_topic_score_codex":0.00005435882,"about_ca_topic_score_gemma":0.000063311876,"teacher_disagreement_score":0.1730905,"about_ca_system_score_codex":0.00048291698,"about_ca_system_score_gemma":0.0003018837,"threshold_uncertainty_score":0.99970686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018099544,0.00039749497,0.9953608,0.00038600035,0.0005753466,0.00024313189,0.00003271319,0.00010251545,0.0010920537],"genre_scores_gemma":[0.21281387,0.00005716212,0.7860395,0.0005669252,0.00012359578,0.000008804946,0.000013000147,0.000035047993,0.00034211777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969962,0.0000575609,0.0006279307,0.0011081601,0.0006680497,0.0005420878],"domain_scores_gemma":[0.99737245,0.0007809698,0.00034099125,0.0012446551,0.00012890872,0.00013205022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004657366,0.0003945885,0.0005226464,0.0007761894,0.00016358233,0.0003341988,0.0022078224,0.0002832005,0.000052247004],"category_scores_gemma":[0.000092715476,0.0003730259,0.00012016182,0.000636405,0.000905444,0.0009347904,0.0011612029,0.0006648142,0.000008866363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009711776,0.000193917,0.00036428773,0.0000836914,0.000028050257,0.00028089012,0.0023192933,0.04653808,0.008233838,0.20785291,0.00043375365,0.7336616],"study_design_scores_gemma":[0.00046458477,0.00016380032,0.00008698125,0.001908831,0.000011149309,0.0002453773,0.000001919235,0.9080464,0.01448948,0.07247839,0.0011095068,0.0009935559],"about_ca_topic_score_codex":0.000038135047,"about_ca_topic_score_gemma":0.000011936627,"teacher_disagreement_score":0.8615083,"about_ca_system_score_codex":0.00018662034,"about_ca_system_score_gemma":0.0001613167,"threshold_uncertainty_score":0.99987215},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004992762,0.0010802421,0.98895764,0.0012776413,0.0035196885,0.0007187799,0.000010026916,0.00042182207,0.0035148528],"genre_scores_gemma":[0.6672194,0.00007574593,0.32306838,0.0056860754,0.0031113923,0.000027416037,0.000008716745,0.00015967734,0.0006431954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936249,0.00005413432,0.0007864006,0.002248513,0.0015610168,0.0017250137],"domain_scores_gemma":[0.99621046,0.0006430587,0.0002685391,0.0019395106,0.00024279386,0.00069562154],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013864898,0.0009490307,0.00086724514,0.0014916135,0.00054439553,0.0007795277,0.0054380917,0.00045271395,0.000026920688],"category_scores_gemma":[0.00011023488,0.00087946607,0.00028137787,0.0012947638,0.00040667524,0.0007201522,0.0014334136,0.0014476426,0.00019725836],"study_design_candidate":"design_other","study_design_consensus":null,"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.936854e-7,0.000027526448,0.000016863296,0.000047697697,0.0000118478165,0.00007744372,0.002167144,0.034163486,0.0004267709,0.008149833,0.000017167467,0.95489323],"study_design_scores_gemma":[0.00090589194,0.00082588685,0.000526303,0.0026764013,0.00004460928,0.0010715742,6.283696e-7,0.79876465,0.0078770835,0.14583601,0.03683912,0.004631869],"about_ca_topic_score_codex":0.000023624965,"about_ca_topic_score_gemma":0.000049445116,"teacher_disagreement_score":0.95026135,"about_ca_system_score_codex":0.00035396026,"about_ca_system_score_gemma":0.00075604976,"threshold_uncertainty_score":0.99994296},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015795052,0.00007427516,0.98216987,0.0008615147,0.0004059821,0.00040370354,0.0000012174995,0.00027523137,0.000013159384],"genre_scores_gemma":[0.46062443,0.0000029379503,0.5387217,0.0005177622,0.00009513769,0.000029514276,0.0000043454556,0.0000033392278,8.4067557e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791497,0.00006534911,0.00032019883,0.00075787766,0.00045813233,0.00048348785],"domain_scores_gemma":[0.99887687,0.0003253111,0.000116267765,0.00047679624,0.00013653694,0.00006819576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007181799,0.0001621942,0.00020001577,0.00023406696,0.00024394986,0.00043078838,0.0012511854,0.00008133423,0.0000038103658],"category_scores_gemma":[0.00016597149,0.0001391156,0.00007146225,0.0012762753,0.00036754092,0.00058913906,0.00022330049,0.00018380118,0.0000033919803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039448732,0.00005200276,0.00013792128,0.000015857158,0.00000193451,0.000006274977,0.00010364205,0.0040913275,0.18955788,0.0021143795,0.00006341993,0.8038514],"study_design_scores_gemma":[0.00012785531,0.00017404779,0.0037661684,0.000021905871,0.0000010898727,0.0000054937973,2.3551245e-7,0.87070745,0.07462337,0.05036437,0.000030265774,0.00017773797],"about_ca_topic_score_codex":0.00003282059,"about_ca_topic_score_gemma":0.0000094917,"teacher_disagreement_score":0.86661613,"about_ca_system_score_codex":0.00017324465,"about_ca_system_score_gemma":0.00018313581,"threshold_uncertainty_score":0.5672969},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014917332,0.000069481255,0.98750013,0.00021399722,0.00040714047,0.008953264,0.000014707021,0.00014413617,0.0012054282],"genre_scores_gemma":[0.78987616,0.000008773081,0.20861359,0.00046691086,0.0002451409,0.00068173045,0.000015686011,0.00003585692,0.000056181256],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99481726,0.00008754252,0.00096611213,0.0018993913,0.0015440227,0.0006856916],"domain_scores_gemma":[0.99579704,0.00020851016,0.0005648061,0.0028720417,0.00035032313,0.00020728562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012103711,0.00059648283,0.0007894591,0.0010105021,0.00023686874,0.00047842338,0.005320347,0.00020836889,0.000027854132],"category_scores_gemma":[0.00004059293,0.0005166749,0.00017009386,0.0012611483,0.0005934942,0.000568518,0.0015024925,0.0007298799,0.00002295584],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039511175,0.001613814,0.00033682413,0.00010516086,0.00005218478,0.00018640321,0.008110478,0.0030374213,0.00042113362,0.07129092,0.000035654983,0.9147705],"study_design_scores_gemma":[0.0041134534,0.0045847995,0.0024516399,0.001608576,0.00007666065,0.00010195074,0.0000053535246,0.20791075,0.010706943,0.761999,0.0036746757,0.0027662178],"about_ca_topic_score_codex":0.000050920993,"about_ca_topic_score_gemma":0.00020004703,"teacher_disagreement_score":0.9120043,"about_ca_system_score_codex":0.00012656087,"about_ca_system_score_gemma":0.00034055673,"threshold_uncertainty_score":0.9997285},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040657524,0.00022553276,0.9945008,0.0000736075,0.00090376846,0.0005683557,0.000004297995,0.00009215097,0.0032248846],"genre_scores_gemma":[0.4540573,0.00004751678,0.541985,0.002664928,0.0007907968,0.000032919143,0.000015028645,0.00006821616,0.00033832173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687535,0.00002605569,0.00058360334,0.0011347717,0.00092836603,0.00045188045],"domain_scores_gemma":[0.99743754,0.0003546575,0.00039924873,0.0013680614,0.00031490036,0.00012556746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007511565,0.00037672036,0.00040475448,0.0009059885,0.00018504355,0.0001777245,0.002187426,0.00029207836,0.000027039972],"category_scores_gemma":[0.000023838382,0.00035695644,0.00010877645,0.0008562392,0.0003530376,0.0003461911,0.00065415556,0.00036993134,0.000049671144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009205735,0.00015094073,0.00013718483,0.000121150835,0.000018260222,0.000028121824,0.0010584472,0.15598339,0.0025489703,0.20838855,0.00004756762,0.63150823],"study_design_scores_gemma":[0.0002991196,0.00035873556,0.00012834888,0.00066416536,0.000017664348,0.000035800917,3.9776083e-7,0.9064967,0.021659391,0.05991933,0.009561105,0.0008592459],"about_ca_topic_score_codex":0.000035248744,"about_ca_topic_score_gemma":0.00003463917,"teacher_disagreement_score":0.7505133,"about_ca_system_score_codex":0.00022833163,"about_ca_system_score_gemma":0.0003900365,"threshold_uncertainty_score":0.99988824},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013455725,0.0007367193,0.9961525,0.00015902234,0.0010894526,0.00070874626,0.00014457566,0.00014289544,0.0008526127],"genre_scores_gemma":[0.0034727643,0.00005979905,0.99432886,0.0005003652,0.00052037026,0.0000073659185,0.00013429848,0.000055020522,0.00092115137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950669,0.00003309861,0.00067964516,0.0022295793,0.0012578411,0.0007329262],"domain_scores_gemma":[0.99450946,0.0011286103,0.00050728995,0.0033489906,0.00026314263,0.00024249003],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008303965,0.0006434725,0.0008212534,0.0007229036,0.00037030195,0.0003036626,0.007005576,0.0003772869,0.000029140343],"category_scores_gemma":[0.00012702313,0.000543726,0.00013376649,0.0004909959,0.00046636676,0.0012713968,0.0051753456,0.00069815404,0.000029070352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003918727,0.00006141847,0.0000020057498,0.000039022092,0.000015526895,0.000013979227,0.00047125138,0.13112065,0.00023414004,0.0114224665,0.0004800203,0.8561003],"study_design_scores_gemma":[0.0007308032,0.00045754595,0.000008580661,0.0014841137,0.000012533883,0.00001490704,3.1976097e-7,0.8838426,0.0022492362,0.106942765,0.0036795395,0.000577046],"about_ca_topic_score_codex":0.0001898791,"about_ca_topic_score_gemma":0.0000126142495,"teacher_disagreement_score":0.8555233,"about_ca_system_score_codex":0.00022641859,"about_ca_system_score_gemma":0.0011088169,"threshold_uncertainty_score":0.99970144},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021486352,0.00044274877,0.9837303,0.0053496836,0.0006657808,0.008755926,0.000010253704,0.0004994367,0.0005243774],"genre_scores_gemma":[0.0034171348,0.000023661507,0.99437255,0.0009549557,0.00030828232,0.00079354394,0.000009835404,0.000047169357,0.00007289743],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954268,0.00001759058,0.00064703164,0.0021407395,0.0008988601,0.0008690306],"domain_scores_gemma":[0.9894065,0.0007449096,0.0004073593,0.008893181,0.00039985753,0.00014818538],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0017161542,0.0006024213,0.00054776104,0.00093988556,0.00029747633,0.0009959018,0.030122139,0.00060608576,0.00000505366],"category_scores_gemma":[0.0045196638,0.00055643864,0.00008158649,0.0007472904,0.001113265,0.0011194469,0.05368329,0.00085374195,0.000014708598],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012504316,0.00002890994,0.00022842412,0.00017131603,0.000010827588,0.000021990747,0.00010872387,0.00027425282,0.00004797117,0.015326068,0.000932248,0.9828368],"study_design_scores_gemma":[0.00034268052,0.00022288918,0.00035918222,0.0005896445,0.000005362115,0.000054699947,5.0066713e-8,0.3150278,0.0009319498,0.67255723,0.009332159,0.000576327],"about_ca_topic_score_codex":0.000015047985,"about_ca_topic_score_gemma":0.00008631005,"teacher_disagreement_score":0.98226047,"about_ca_system_score_codex":0.00032774656,"about_ca_system_score_gemma":0.0005003998,"threshold_uncertainty_score":0.9996887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010649943,0.0008419959,0.9963668,0.0013223802,0.00016318286,0.00092606747,0.0000023696957,0.00006432025,0.00020637059],"genre_scores_gemma":[0.49578953,0.00032335837,0.50110406,0.0020442482,0.00035247806,0.00025536367,0.000015189526,0.000029918543,0.000085835534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976286,0.00005451517,0.0004420102,0.0010271204,0.0002523392,0.0005953914],"domain_scores_gemma":[0.998281,0.0008104805,0.00015628422,0.0005372513,0.0001313485,0.000083662046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012980202,0.00027965667,0.0004055235,0.0006137653,0.00016553086,0.00017779092,0.0010673987,0.00017170468,0.000005482241],"category_scores_gemma":[0.00002229809,0.0002839848,0.00006518351,0.00048204252,0.00016286799,0.00025724946,0.00026883997,0.0004336965,0.0000024497176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043861273,0.000007193368,0.000025870952,0.000009899825,0.000006148782,0.000001866453,0.00014379271,0.095040925,0.000007843923,0.11619192,0.0000025585512,0.7885576],"study_design_scores_gemma":[0.000373717,0.000079947225,0.000011502901,0.00003378423,0.000009790029,0.000022397091,4.968537e-7,0.7853033,0.0000059490712,0.21278447,0.0011552055,0.00021946774],"about_ca_topic_score_codex":0.000039559356,"about_ca_topic_score_gemma":0.0009082617,"teacher_disagreement_score":0.7883381,"about_ca_system_score_codex":0.00024420887,"about_ca_system_score_gemma":0.00038994823,"threshold_uncertainty_score":0.99996126},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034156954,0.0010425773,0.99419105,0.00014772144,0.0032981145,0.0008004003,0.000041190186,0.00018700241,0.00025778147],"genre_scores_gemma":[0.013040535,0.000031842486,0.98406196,0.0012648787,0.001377961,0.000025721392,0.000038840022,0.00005148185,0.00010677808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954518,0.000039350914,0.0006256149,0.0016876411,0.0012353624,0.00096022506],"domain_scores_gemma":[0.99592483,0.0009585619,0.00037112588,0.0020661126,0.00044233646,0.00023704028],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0025976785,0.0005401039,0.00048157573,0.0006105094,0.0009265002,0.0012455706,0.0054443195,0.00031455373,0.0000075226644],"category_scores_gemma":[0.000071409966,0.00039531605,0.00015181422,0.0006140182,0.00058553874,0.0006841243,0.0014895598,0.0008093158,0.000014480773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034447785,0.00002924106,0.0000037083084,0.000013456107,0.0000074373975,0.000038399325,0.00031637715,0.027677426,0.000078673394,0.007846301,0.000020760348,0.96396476],"study_design_scores_gemma":[0.00035473244,0.00012207114,0.00007430294,0.00024741594,0.000009584044,0.000050575905,5.336442e-7,0.97669464,0.0013714564,0.01710445,0.0034438067,0.0005264314],"about_ca_topic_score_codex":0.000036044217,"about_ca_topic_score_gemma":0.000031299773,"teacher_disagreement_score":0.96343833,"about_ca_system_score_codex":0.00031499667,"about_ca_system_score_gemma":0.00042860568,"threshold_uncertainty_score":0.9999367},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012150292,0.00017734393,0.98535705,0.0003037108,0.0010361535,0.0004064927,0.000010829045,0.000074902055,0.00048325464],"genre_scores_gemma":[0.63733387,0.00028234467,0.3599109,0.0013162601,0.0004910654,0.00002622848,0.00001927214,0.00006272642,0.0005572934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969308,0.00005606156,0.0004952118,0.0012625509,0.0007076272,0.0005477692],"domain_scores_gemma":[0.9987031,0.00022618435,0.0002542707,0.00052936573,0.00012385353,0.00016317476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070089044,0.00044508517,0.00044353734,0.0008708109,0.00023718516,0.00047075754,0.0009811402,0.00030176292,0.000038669572],"category_scores_gemma":[0.000062520456,0.00040366242,0.000070740956,0.0005553667,0.0003204449,0.000888069,0.0007852233,0.0006324297,0.000019801171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035435576,0.00007125559,0.00051297084,0.0000708739,0.000014650563,0.00039002346,0.0009718227,0.022938577,0.008339816,0.0006291694,0.000014130586,0.9660113],"study_design_scores_gemma":[0.00052570965,0.00020973926,0.0008827065,0.0004200991,0.000009883069,0.00026244743,5.349501e-7,0.9606245,0.008017297,0.027905984,0.0004754954,0.0006655728],"about_ca_topic_score_codex":0.00006994781,"about_ca_topic_score_gemma":0.00020880323,"teacher_disagreement_score":0.9653457,"about_ca_system_score_codex":0.0002018631,"about_ca_system_score_gemma":0.00028106585,"threshold_uncertainty_score":0.9998415},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034146895,0.00018498128,0.9972056,0.00013250402,0.00040292388,0.00059731107,0.0000040004343,0.00013768137,0.0013008107],"genre_scores_gemma":[0.00962299,0.00005270512,0.9896861,0.00014305957,0.00034471875,0.000008844656,0.00000550505,0.000048782484,0.00008732351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986996,0.000010161078,0.00030223318,0.00041134423,0.00027217233,0.00030449426],"domain_scores_gemma":[0.99893135,0.000544931,0.00007926426,0.00028834507,0.0001046668,0.000051473395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013624638,0.00024806816,0.00021316204,0.00020566955,0.00015137695,0.00017546263,0.00037961802,0.00019936694,0.00000387451],"category_scores_gemma":[0.00004652188,0.00020000702,0.000042568958,0.00020390662,0.0002994762,0.00011384228,0.00008561948,0.00038005423,0.000001756287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.558489e-7,0.0000010194067,0.00000987665,0.000054726446,0.0000045383963,5.5151884e-7,0.0004978011,0.6226964,0.000022998162,0.000328497,0.0000021063363,0.37638053],"study_design_scores_gemma":[0.00013563092,0.00002163755,0.00007363254,0.00014627393,0.000011655649,0.000010840539,4.469497e-7,0.9881417,0.00032281427,0.010616891,0.00028613303,0.00023234596],"about_ca_topic_score_codex":0.0000013450202,"about_ca_topic_score_gemma":0.000010273486,"teacher_disagreement_score":0.37614816,"about_ca_system_score_codex":0.00009795597,"about_ca_system_score_gemma":0.000040922467,"threshold_uncertainty_score":0.815605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025455025,0.0007373885,0.9946257,0.0006570797,0.0010433889,0.0002545075,0.000011320746,0.000107342974,0.0025378289],"genre_scores_gemma":[0.008199708,0.00005984935,0.98894763,0.0020718486,0.00030666005,0.0000030035437,0.000003587471,0.000030538515,0.00037719673],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99653405,0.00006322829,0.00048726838,0.0013791862,0.0008974575,0.00063882524],"domain_scores_gemma":[0.9978764,0.00044382183,0.00022640818,0.0010422409,0.00020346684,0.00020767644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012447954,0.00051793724,0.000563932,0.00066825806,0.00030035383,0.000858591,0.0017432411,0.00027855468,0.000021925183],"category_scores_gemma":[0.0001334787,0.00045441973,0.000077690696,0.00035391867,0.0009359954,0.00041857123,0.0012186726,0.00083544746,0.000025389027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045872603,0.000015140033,0.0000029447865,0.000049909366,0.000008480498,0.00041425446,0.00083179487,0.0020344905,0.0005935951,0.19267124,0.000048559068,0.803325],"study_design_scores_gemma":[0.00043711948,0.000174974,0.00013194694,0.00031619938,0.000006944817,0.00020606506,1.09052955e-7,0.04994407,0.0020897097,0.94495314,0.0011164241,0.0006232792],"about_ca_topic_score_codex":0.0000311319,"about_ca_topic_score_gemma":0.000023161158,"teacher_disagreement_score":0.8027017,"about_ca_system_score_codex":0.00024741102,"about_ca_system_score_gemma":0.0006453395,"threshold_uncertainty_score":0.9997907},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8285724,0.000013234664,0.1668782,0.0040620035,0.00023365136,0.0002055942,0.0000021790838,0.000010762277,0.000021971631],"genre_scores_gemma":[0.99407405,0.000004899236,0.0047645373,0.0010761685,0.00006696824,0.000008179889,2.7035404e-7,0.0000043642444,5.4282395e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984816,0.000118259086,0.00017313384,0.00048054077,0.00048809347,0.00025839452],"domain_scores_gemma":[0.99637514,0.003245857,0.000072267736,0.00026505388,0.000027316892,0.000014389916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034714508,0.00011908023,0.00014758739,0.0003041385,0.00014470113,0.000034104258,0.000538409,0.000038050777,0.000002628348],"category_scores_gemma":[0.003545181,0.000083229344,0.000021219437,0.002313235,0.00054071145,0.00044428452,0.00018905803,0.00028552278,8.664902e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039341707,0.000115248804,0.12596443,0.000031694224,9.550365e-7,0.000036684713,0.014221556,0.45021266,0.3980437,0.0008513914,0.000024068246,0.0104582915],"study_design_scores_gemma":[0.00027818698,0.000068812165,0.27915704,0.00007358954,4.6262113e-7,0.000040310602,0.00001429517,0.062785044,0.65202594,0.0053934576,0.000022336748,0.00014051021],"about_ca_topic_score_codex":0.000100158344,"about_ca_topic_score_gemma":0.00029505242,"teacher_disagreement_score":0.3874276,"about_ca_system_score_codex":0.00009988215,"about_ca_system_score_gemma":0.00010598062,"threshold_uncertainty_score":0.42441687},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062223324,0.0005857053,0.99071985,0.0007207706,0.0004545996,0.0003406271,0.0000026673176,0.000095656396,0.000857758],"genre_scores_gemma":[0.9045986,0.000082615355,0.09353278,0.001296894,0.00028246237,0.0000038866997,7.534631e-7,0.000022535176,0.0001794726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967914,0.000065646105,0.00034211105,0.0013118343,0.0009295892,0.0005593954],"domain_scores_gemma":[0.9977427,0.0005002643,0.00017457156,0.0012805592,0.00015642575,0.00014546883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012703872,0.00041537755,0.0003424055,0.0003637268,0.0005245091,0.0007912675,0.002631794,0.00013888856,0.00000968123],"category_scores_gemma":[0.00004920628,0.00027519383,0.00007581048,0.00042531107,0.0010488324,0.00058079313,0.0016086859,0.0010234679,0.000008347931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010650508,0.000028195034,0.000255143,0.000029932997,0.00001753846,0.00007325964,0.0012417429,0.09312539,0.00017522185,0.006329687,0.0000053485523,0.89870787],"study_design_scores_gemma":[0.00008872266,0.00009304579,0.00016470453,0.00033717058,0.000008563749,0.00018014568,6.791843e-7,0.98546726,0.00014491199,0.0128302965,0.00030541507,0.00037910423],"about_ca_topic_score_codex":0.00013378095,"about_ca_topic_score_gemma":0.0002740075,"teacher_disagreement_score":0.8983763,"about_ca_system_score_codex":0.00022611169,"about_ca_system_score_gemma":0.00045855425,"threshold_uncertainty_score":0.99997},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022446613,0.00091702165,0.78615516,0.025834935,0.008028298,0.0007548608,0.0000026034759,0.0003791689,0.1777035],"genre_scores_gemma":[0.6382216,0.002049078,0.23119141,0.009602785,0.0046422174,0.00014542625,0.000030013496,0.000116757685,0.11400066],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982616,0.00011052227,0.0002282293,0.00041123736,0.00053877017,0.00044965834],"domain_scores_gemma":[0.9971542,0.0014509985,0.00014872767,0.001007248,0.00015016856,0.00008870948],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018364376,0.00015769944,0.00017507668,0.00022734555,0.0007496748,0.00031999924,0.0041938755,0.0004683945,0.00008101092],"category_scores_gemma":[0.0008472875,0.000114649025,0.000055997476,0.00048080616,0.0048846416,0.00009512498,0.00075219217,0.0014569878,0.00009930914],"study_design_candidate":"design_other","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.0000016900971,0.000011819901,0.0001255938,0.0000023812806,0.000003264466,0.0000029105386,0.0034829518,0.000014532598,0.000012502163,0.03176978,0.0012372793,0.9633353],"study_design_scores_gemma":[0.000073392745,0.000016554779,0.00007402217,0.000043761553,0.000002522313,0.00000279659,0.0000018200146,0.0069898483,0.00012393427,0.094445094,0.89803666,0.00018958628],"about_ca_topic_score_codex":0.00044816968,"about_ca_topic_score_gemma":0.03911389,"teacher_disagreement_score":0.96314573,"about_ca_system_score_codex":0.0002505093,"about_ca_system_score_gemma":0.0014541139,"threshold_uncertainty_score":0.9978235},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007611606,0.00651836,0.83185905,0.0380725,0.049803756,0.018797057,0.00013683917,0.0005130247,0.046687827],"genre_scores_gemma":[0.833713,0.0012414157,0.09692449,0.040331185,0.016131092,0.0006878772,0.000054060583,0.00063599914,0.010280892],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946365,0.0004611116,0.0015264364,0.0010772338,0.0009862441,0.0013125028],"domain_scores_gemma":[0.99573535,0.0003921014,0.0011802351,0.0018425465,0.000573667,0.0002761074],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0026035963,0.00048685062,0.00085090584,0.0002974673,0.0009775477,0.000016630103,0.0020986132,0.000836039,0.000152514],"category_scores_gemma":[0.000058778947,0.00033450092,0.00016100852,0.000572895,0.0005358998,0.00019943425,0.00054782134,0.0043016323,0.000078701756],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017901955,0.000079927246,0.0038823555,0.0032048526,0.000018888244,0.0000044219205,0.006291361,0.00012227612,0.0009819795,0.017503181,0.00018562588,0.9677072],"study_design_scores_gemma":[0.0014578964,0.0018946426,0.0075429888,0.014942792,0.00007267827,0.000038942075,0.000009117953,0.012522752,0.0010428666,0.6675733,0.29025057,0.0026514784],"about_ca_topic_score_codex":0.0008854875,"about_ca_topic_score_gemma":0.012980807,"teacher_disagreement_score":0.96505576,"about_ca_system_score_codex":0.00056049885,"about_ca_system_score_gemma":0.004174705,"threshold_uncertainty_score":0.9999107},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017632857,0.000070914546,0.9964486,0.00017534272,0.00023473607,0.00016261514,0.0000025830473,0.00012000251,0.0010219201],"genre_scores_gemma":[0.91694987,0.000005906488,0.08260569,0.00024126311,0.000093357536,0.0000013969386,0.000012462867,0.00003305345,0.000057029098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988915,0.0000050104945,0.00018789258,0.00033665108,0.00034227534,0.00023669205],"domain_scores_gemma":[0.999424,0.00005542126,0.00004489838,0.00033916548,0.00007428609,0.00006224459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012035407,0.00021350395,0.0001673203,0.00009088629,0.00005986285,0.0001324345,0.00020915711,0.00012652614,0.000027005008],"category_scores_gemma":[0.000008436441,0.00018385866,0.000029306831,0.00017737615,0.00018498898,0.00009626884,0.000017051603,0.00022051146,0.000011974942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041209246,0.0000050646636,0.00004515494,0.00003052107,0.0000029638036,0.000019924524,0.000060480867,0.99057263,0.00031678172,0.0014993176,0.0000046743644,0.007438338],"study_design_scores_gemma":[0.0002296017,0.00008494563,0.000052461855,0.00023575623,0.0000060983866,0.0000047872895,3.9878362e-8,0.9851759,0.008429616,0.005414511,0.0001099988,0.00025627302],"about_ca_topic_score_codex":0.000011882057,"about_ca_topic_score_gemma":0.000094993644,"teacher_disagreement_score":0.9151866,"about_ca_system_score_codex":0.00019344508,"about_ca_system_score_gemma":0.0001578201,"threshold_uncertainty_score":0.74975383},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000131338575,0.00006895326,0.9943388,0.000400254,0.0010090509,0.00038764358,0.000006039119,0.0006861754,0.0030899672],"genre_scores_gemma":[0.009232198,0.000023535775,0.9886798,0.00094663625,0.0005494842,0.000031348394,0.00000482352,0.00003689196,0.0004952266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969089,0.000017038574,0.00045315368,0.0015260448,0.0005592853,0.00053557946],"domain_scores_gemma":[0.9972848,0.00011059956,0.00024492954,0.0019417761,0.00019069121,0.00022714895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005780197,0.0004428379,0.00036928183,0.0006443482,0.00043836862,0.0006690311,0.003659493,0.000450783,0.000036174828],"category_scores_gemma":[0.000015785214,0.00043351293,0.00011608744,0.00046838066,0.0005331928,0.0007623841,0.0012045085,0.0011650602,0.000054311735],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.934918e-7,0.000018646546,0.0000017646191,0.0000058264236,0.0000025103054,0.00001623069,0.00017990782,0.0018680271,0.00040643237,0.008555176,0.000002918618,0.9889421],"study_design_scores_gemma":[0.000085409214,0.00016100057,0.000028093624,0.000062834006,0.000003909665,0.00013536958,8.493473e-8,0.857691,0.0045328056,0.12579559,0.010937578,0.0005663044],"about_ca_topic_score_codex":0.00004373853,"about_ca_topic_score_gemma":0.00014513222,"teacher_disagreement_score":0.9883758,"about_ca_system_score_codex":0.00020216634,"about_ca_system_score_gemma":0.0003569999,"threshold_uncertainty_score":0.99981165},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01498755,0.000030871972,0.9818932,0.0002526562,0.00043846708,0.0004959772,0.00005893598,0.000094598894,0.0017477471],"genre_scores_gemma":[0.8138997,0.000068017274,0.18239553,0.0029169049,0.00014125768,0.000026245445,0.000030384523,0.000041594205,0.0004803757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692965,0.000081166276,0.0005143488,0.0011131684,0.001011026,0.0003506711],"domain_scores_gemma":[0.99783105,0.0011706162,0.00033458343,0.00034106438,0.00020455646,0.000118146694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023143829,0.00031533104,0.00040032543,0.00044331898,0.00038956734,0.00006288777,0.00070068106,0.00016762363,0.000051366318],"category_scores_gemma":[0.0008655607,0.0003088237,0.00008968785,0.00050200114,0.0006534512,0.00038167147,0.00034726874,0.00060227857,0.000026781052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023293936,0.000016469628,0.0000048644606,0.0000132472205,0.0000030639278,0.0000332872,0.0025041031,0.9464544,0.046267264,0.0020430642,0.000018652358,0.0026182756],"study_design_scores_gemma":[0.00020873225,0.00019733851,0.0000117341715,0.00016033201,0.0000056406134,0.000056821955,7.261274e-7,0.7522036,0.1650202,0.08186734,0.000020286123,0.00024724647],"about_ca_topic_score_codex":0.000005360116,"about_ca_topic_score_gemma":0.0000037158884,"teacher_disagreement_score":0.79949766,"about_ca_system_score_codex":0.00010927104,"about_ca_system_score_gemma":0.00032440515,"threshold_uncertainty_score":0.9999364},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010971573,0.0016202119,0.9925264,0.0007368138,0.0018295678,0.0005992345,0.0000039397682,0.00030516586,0.0022689253],"genre_scores_gemma":[0.17031725,0.00008955437,0.8272496,0.000932359,0.0004653242,0.000023618104,0.0000059941003,0.000037630496,0.00087866554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963943,0.00002019041,0.0005533725,0.0016662991,0.00053523236,0.00083060795],"domain_scores_gemma":[0.9974477,0.0005286388,0.00018346593,0.00141858,0.00031141093,0.00011020229],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008302673,0.000562825,0.0006426869,0.0007350674,0.00025132406,0.0005569002,0.0038712067,0.00038260806,0.0000039732495],"category_scores_gemma":[0.00015383941,0.00049937464,0.0002265661,0.00040944063,0.00031543852,0.00054988463,0.00089563796,0.0005336424,0.00003159988],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000474982,0.000022276858,0.0000030917417,0.000036940193,0.0000065412733,0.00002086061,0.00049998617,0.04768537,0.0000324639,0.020360075,0.000010394915,0.93131727],"study_design_scores_gemma":[0.00020562108,0.00013810948,0.000016254719,0.00025460206,0.000007281332,0.00003550468,1.133013e-7,0.73572737,0.00007029134,0.2623989,0.00067737664,0.00046860383],"about_ca_topic_score_codex":0.0000067567426,"about_ca_topic_score_gemma":0.000103330254,"teacher_disagreement_score":0.93084866,"about_ca_system_score_codex":0.00032842671,"about_ca_system_score_gemma":0.00050358876,"threshold_uncertainty_score":0.9997458},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011641149,0.0011145835,0.9923626,0.0001674022,0.00092731975,0.00025553827,0.0000013210862,0.000047434918,0.00511216],"genre_scores_gemma":[0.028494282,0.00029160638,0.967679,0.0022551857,0.00047029793,0.0000059640515,0.00002681597,0.00003705397,0.0007397533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968084,0.00004047123,0.0008324738,0.0009861116,0.00093017134,0.00040235824],"domain_scores_gemma":[0.9975607,0.000291279,0.0006433264,0.0011320134,0.00026567932,0.00010700906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018374546,0.00036380484,0.00065263995,0.0014095128,0.00011625122,0.0001878725,0.0020340926,0.00022865275,0.000061319704],"category_scores_gemma":[0.00008116016,0.00031560447,0.00023379293,0.0011479525,0.00035197716,0.00035137802,0.00044654825,0.0003698953,0.00006239155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039555425,0.000034936413,0.00036822524,0.00007329271,0.0000126246205,0.00001488264,0.0002581995,0.021634262,0.00023269157,0.021363389,0.00008551812,0.955918],"study_design_scores_gemma":[0.00035417406,0.00012664372,0.00016479257,0.0011877341,0.000029111106,0.000006602679,1.1476434e-7,0.9498696,0.005923233,0.010996062,0.030514937,0.0008270387],"about_ca_topic_score_codex":0.000015728863,"about_ca_topic_score_gemma":0.000033864868,"teacher_disagreement_score":0.955091,"about_ca_system_score_codex":0.00013526205,"about_ca_system_score_gemma":0.00030880174,"threshold_uncertainty_score":0.9999296},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012565877,0.00019476992,0.99431944,0.0002072514,0.00086063467,0.00022720965,0.000006260578,0.00009832382,0.0028295137],"genre_scores_gemma":[0.9897662,0.000019006771,0.009691259,0.0002619778,0.0001460355,0.000003040726,0.000009357858,0.00004601668,0.00005710724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986333,0.000013888234,0.00026845338,0.00033621246,0.00046112444,0.0002869773],"domain_scores_gemma":[0.9990766,0.00028489032,0.00004476556,0.0004974262,0.000049494887,0.000046840916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043814027,0.00030863137,0.0002916448,0.00025667978,0.0000736313,0.00007360977,0.0007004583,0.00022386771,0.000016980555],"category_scores_gemma":[0.000043181844,0.00022389942,0.000101099715,0.00018874482,0.0002527736,0.000072281655,0.00007527769,0.00068012014,0.000015376574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004288958,0.0000016067471,0.0000058624278,0.00007513268,0.0000065203394,0.0000030431786,0.00014920725,0.86816233,0.00001366724,0.0018541991,0.0000011369945,0.12972298],"study_design_scores_gemma":[0.0001623943,0.000113850845,0.000007160483,0.0003454634,0.000009988878,0.0000051174725,2.4003685e-7,0.9906087,0.00043619343,0.008089462,0.000005251121,0.00021616805],"about_ca_topic_score_codex":0.000008051556,"about_ca_topic_score_gemma":0.00019569421,"teacher_disagreement_score":0.9885096,"about_ca_system_score_codex":0.00037226308,"about_ca_system_score_gemma":0.000070712485,"threshold_uncertainty_score":0.91303533},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010221501,0.0007091224,0.99591815,0.00060569245,0.0004043726,0.0011112768,0.00001818012,0.00006868774,0.0010622895],"genre_scores_gemma":[0.014413292,0.000604148,0.97915125,0.0025383292,0.0017979457,0.00017502924,0.000034135068,0.00017615693,0.0011097332],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982286,0.000024047684,0.00029269207,0.0006501347,0.00036867204,0.00043585425],"domain_scores_gemma":[0.99861693,0.0002183743,0.0002811968,0.00062445813,0.0001988565,0.000060191433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037108842,0.00039102958,0.00030865317,0.00013976188,0.00042438676,0.00027782086,0.0007513208,0.00010497715,0.00004818278],"category_scores_gemma":[0.0000045378397,0.00025356564,0.00012208764,0.00015817882,0.0005943236,0.00020552009,0.00003421751,0.0003146468,0.0000011000134],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055587927,0.000025012612,0.00005555142,0.000004493808,0.000049057602,0.0000034025684,0.00015693219,0.0055857226,0.0009965089,0.00965039,0.00024374391,0.9831736],"study_design_scores_gemma":[0.0034092886,0.0013392755,0.00010236461,0.00020970032,0.000027237362,0.00003438723,0.0000010193163,0.08279752,0.03633012,0.69573075,0.17822307,0.0017952572],"about_ca_topic_score_codex":0.00001588943,"about_ca_topic_score_gemma":0.0000043127066,"teacher_disagreement_score":0.9813783,"about_ca_system_score_codex":0.00013334889,"about_ca_system_score_gemma":0.00020793776,"threshold_uncertainty_score":0.99999166},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036595597,0.0040646847,0.983337,0.00022241424,0.0010907486,0.00024735305,0.0000055584214,0.0003182516,0.0106773805],"genre_scores_gemma":[0.5618583,0.00015369366,0.43584463,0.00043561353,0.0004466144,0.000011228596,0.0000075641115,0.00007277892,0.0011695714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995643,0.00009147508,0.00083411904,0.001467792,0.0011708237,0.0007927939],"domain_scores_gemma":[0.9967865,0.0008278851,0.0007297322,0.0012271284,0.00024230193,0.00018646031],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014992529,0.0005907102,0.00090766815,0.00070900464,0.00036822542,0.00036111166,0.003098408,0.00033959895,0.000023761891],"category_scores_gemma":[0.00011487617,0.00055320706,0.0002016061,0.0008201521,0.0004095217,0.00049491297,0.00083211134,0.0012295381,0.000037708414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006988881,0.000022772356,0.0003469484,0.00087479735,0.000033125114,0.00027101845,0.006518124,0.14810234,0.0000681358,0.09731369,0.000045548346,0.74639654],"study_design_scores_gemma":[0.00026084195,0.00023344986,0.000055888162,0.0066644726,0.000016636304,0.00013953474,0.0000016084517,0.9723863,0.00033044626,0.011270336,0.0077556064,0.00088485744],"about_ca_topic_score_codex":0.000020774161,"about_ca_topic_score_gemma":0.00001181549,"teacher_disagreement_score":0.82428396,"about_ca_system_score_codex":0.00029626468,"about_ca_system_score_gemma":0.0003764139,"threshold_uncertainty_score":0.99969196},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025622567,0.00017647246,0.98038733,0.00005858999,0.0012132674,0.0004279476,0.000007874298,0.00032103522,0.017381834],"genre_scores_gemma":[0.5420119,0.00009984224,0.45674774,0.0006215993,0.00019053192,0.000022422279,0.0000023421146,0.00003680133,0.00026681434],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702036,0.000027056754,0.00056890264,0.0010980758,0.000781463,0.0005041301],"domain_scores_gemma":[0.99726915,0.0002510121,0.0005166881,0.0014017504,0.000439031,0.00012235466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005260903,0.00046047373,0.00055447215,0.0010219474,0.00013691209,0.0000987264,0.0028520327,0.00027549593,0.000054824057],"category_scores_gemma":[0.00009088515,0.00043827825,0.00014572122,0.0005855608,0.00091355335,0.0006051931,0.0016608338,0.0006507412,0.000012946155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000122165775,0.000043427815,0.000022986665,0.00005377715,0.000016359529,0.000024710731,0.0045371368,0.0024428475,0.00017346363,0.22007415,0.0000244599,0.7725745],"study_design_scores_gemma":[0.00015604986,0.0005134432,0.000033784836,0.0003221475,0.000007067185,0.0000584726,4.912429e-7,0.023561345,0.08974519,0.88204926,0.0029069039,0.0006458215],"about_ca_topic_score_codex":0.00018705292,"about_ca_topic_score_gemma":0.000091510265,"teacher_disagreement_score":0.77192867,"about_ca_system_score_codex":0.0003544223,"about_ca_system_score_gemma":0.000359465,"threshold_uncertainty_score":0.9998069},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016216052,0.0002657478,0.9960926,0.0002885548,0.0012856817,0.0005242826,0.000011162588,0.00039248515,0.0011232614],"genre_scores_gemma":[0.030512357,0.00006799461,0.96691453,0.0010185514,0.000681477,0.00003623111,0.000026957836,0.000059417132,0.0006824842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995719,0.000050101768,0.00056221045,0.0020507928,0.00067999907,0.0009378711],"domain_scores_gemma":[0.9972666,0.00038697984,0.0003290077,0.0012195007,0.00049607677,0.0003018379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010066889,0.00064246124,0.00059063383,0.0006576493,0.0004955487,0.00092134404,0.0035200613,0.00043165614,0.00001784679],"category_scores_gemma":[0.00007409333,0.00061028707,0.00017057863,0.0005033691,0.00043988958,0.0008750484,0.0006377938,0.0010329813,0.000018942741],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004394159,0.000030412075,0.000006665737,0.000015311318,0.000011000154,0.000022617785,0.00038977878,0.014174917,0.0002930781,0.005149518,0.000009932353,0.9798924],"study_design_scores_gemma":[0.00030186115,0.00056426163,0.000008190862,0.0001985334,0.000009258994,0.000045146804,3.618866e-7,0.8965454,0.0007474825,0.09961889,0.0012866373,0.00067393394],"about_ca_topic_score_codex":0.000040876657,"about_ca_topic_score_gemma":0.00002947368,"teacher_disagreement_score":0.9792184,"about_ca_system_score_codex":0.00025649052,"about_ca_system_score_gemma":0.0005911004,"threshold_uncertainty_score":0.99963486},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060108236,0.0008520109,0.9890693,0.0009528933,0.005018783,0.0007336581,0.00000518689,0.00033737536,0.0029707109],"genre_scores_gemma":[0.5280879,0.00017690874,0.45783108,0.00782252,0.0028937624,0.00007942263,0.000021703916,0.00015623792,0.0029304544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99387646,0.00007830933,0.0010667042,0.0022014643,0.0017427951,0.0010342513],"domain_scores_gemma":[0.9954996,0.00067839626,0.00054720795,0.0025067697,0.00041545997,0.00035255827],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011516325,0.00082860026,0.00077952433,0.0011735565,0.00032263497,0.0012364696,0.0056807837,0.0005037705,0.000059550628],"category_scores_gemma":[0.00014247815,0.0007202214,0.00025114373,0.00063720375,0.00071702944,0.0006803594,0.0010505144,0.0011015377,0.00038924866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008034433,0.00006742555,0.000026916538,0.000040152758,0.000007375953,0.0001920134,0.0006086573,0.12871796,0.00057836267,0.01326535,0.000080494065,0.8564073],"study_design_scores_gemma":[0.00008892574,0.00027457444,0.000040557105,0.0014119977,0.000008766633,0.000044679182,4.3069662e-7,0.892054,0.033003602,0.055325102,0.016556693,0.001190674],"about_ca_topic_score_codex":0.000031746928,"about_ca_topic_score_gemma":0.000020150186,"teacher_disagreement_score":0.85521656,"about_ca_system_score_codex":0.0006384638,"about_ca_system_score_gemma":0.0007639006,"threshold_uncertainty_score":0.9998003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005414817,0.00044451683,0.99437773,0.0009590042,0.002323972,0.00087965874,0.00013533162,0.0002771875,0.0005972101],"genre_scores_gemma":[0.0013895449,0.000018357181,0.9952558,0.00048589037,0.0010885746,0.000031966294,0.00011482816,0.00008476637,0.0015302252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927568,0.000040938874,0.0006801395,0.0032815756,0.0018564432,0.0013841109],"domain_scores_gemma":[0.9937458,0.0010882845,0.000325514,0.004079757,0.0004799419,0.00028069623],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0014348316,0.0007634051,0.00075427163,0.0009719799,0.00049632305,0.00080793933,0.00928976,0.00039547827,0.000006993034],"category_scores_gemma":[0.00014544876,0.00074160594,0.00013065933,0.0007356648,0.0007755291,0.0013440333,0.010005248,0.0010460573,0.000032782384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056394674,0.00002654929,0.0000013943115,0.000042775242,0.000012601879,0.000105801344,0.00005405139,0.13688105,0.000056682118,0.0011965171,0.00017085946,0.8614461],"study_design_scores_gemma":[0.000519793,0.00016698819,0.000020688209,0.0002812272,0.0000071373015,0.00012352089,5.493044e-8,0.91919756,0.0002703518,0.07646069,0.0021872255,0.0007647794],"about_ca_topic_score_codex":0.00011343379,"about_ca_topic_score_gemma":0.00017133537,"teacher_disagreement_score":0.8606813,"about_ca_system_score_codex":0.0005727097,"about_ca_system_score_gemma":0.00081695436,"threshold_uncertainty_score":0.9995035},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12970668,0.00023485532,0.8646986,0.0017889683,0.00034345902,0.0005365272,0.000022995553,0.000009265935,0.0026586559],"genre_scores_gemma":[0.9957123,0.000003551646,0.002459896,0.00097303686,0.0001942775,0.000003115657,0.0000075878224,0.0000172665,0.0006289913],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985244,0.000042089196,0.000224472,0.0004533455,0.0004410734,0.00031458514],"domain_scores_gemma":[0.9989758,0.000099957884,0.00015965743,0.00064199854,0.00008572244,0.00003682985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046578722,0.00020442792,0.00018079377,0.000059295067,0.00035404233,0.00018342557,0.0010379292,0.00013690036,0.000009668335],"category_scores_gemma":[0.0000340206,0.00011414376,0.000110070534,0.00007182442,0.0013441361,0.000004327817,0.0005420286,0.0004390261,0.0000027267538],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010301998,0.00011678925,0.0024265985,0.00032541322,0.00008234306,0.00003301973,0.00063844764,0.057714038,0.7030499,0.01617744,0.001055498,0.21827751],"study_design_scores_gemma":[0.0014052548,0.0013432816,0.0109172175,0.003973953,0.0000323004,0.000096536685,0.000002651161,0.06563315,0.44134808,0.4668285,0.006571578,0.0018475116],"about_ca_topic_score_codex":0.0001941114,"about_ca_topic_score_gemma":0.00034662464,"teacher_disagreement_score":0.8660056,"about_ca_system_score_codex":0.00004497156,"about_ca_system_score_gemma":0.00022566161,"threshold_uncertainty_score":0.49525252},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024131393,0.000014638291,0.9706413,0.00082166295,0.0038849972,0.00017941328,0.0000011942674,0.0002445074,0.00008090756],"genre_scores_gemma":[0.51286304,5.916319e-7,0.48585233,0.0011875458,0.00008383513,0.000004455308,5.3595403e-7,0.0000057447887,0.000001911038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971137,0.000052932744,0.0002729246,0.0011019679,0.00072850194,0.0007299712],"domain_scores_gemma":[0.9975425,0.00066291186,0.00010304076,0.0013727262,0.00011127606,0.00020755157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091219635,0.00027190923,0.0002397804,0.0004490773,0.00027470823,0.0005187131,0.0031696358,0.00012650543,0.000010102595],"category_scores_gemma":[0.0005096006,0.00023190973,0.00005738535,0.0018360963,0.00035507316,0.00061991555,0.0006490923,0.00083345635,0.0000862227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034562424,0.00016425339,0.0022316682,0.000005426821,0.0000029932785,0.00012250457,0.00079972565,0.45702857,0.00671928,0.0016283211,0.000026228709,0.5312676],"study_design_scores_gemma":[0.0003888223,0.00012144815,0.0090542985,0.000039549483,9.13198e-7,0.00008325522,9.57439e-8,0.968088,0.010452977,0.011438403,0.000029432767,0.00030284276],"about_ca_topic_score_codex":0.000041126958,"about_ca_topic_score_gemma":0.00003442346,"teacher_disagreement_score":0.53096473,"about_ca_system_score_codex":0.00011225053,"about_ca_system_score_gemma":0.00024381754,"threshold_uncertainty_score":0.9457004},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051720453,0.00015942423,0.9971811,0.00094074424,0.00064520014,0.0007042376,0.00004655203,0.00023316653,0.000037807644],"genre_scores_gemma":[0.20430447,0.00013880772,0.7933628,0.0017412987,0.00019197729,0.000013153626,0.000036826088,0.000039332906,0.00017134257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996846,0.00003154952,0.00072945765,0.001139438,0.00080975937,0.0004437962],"domain_scores_gemma":[0.99658746,0.0010154658,0.00040447453,0.0012045895,0.0006180994,0.00016989045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006368917,0.00042294335,0.0006078005,0.0011481242,0.00017833622,0.00039844558,0.002607577,0.00039302756,0.00001243208],"category_scores_gemma":[0.0002153825,0.00039551716,0.00020000941,0.0006868981,0.00048693529,0.0006494003,0.0008020773,0.00041082798,9.499079e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068215327,0.00006134937,0.00001262408,0.000043901902,0.000013770454,0.000007725721,0.00013098889,0.0039586267,0.00012389547,0.13184986,0.000057569952,0.8637329],"study_design_scores_gemma":[0.00021158396,0.00022347695,0.000105257,0.00022210072,0.0000069691114,0.000009462725,9.373315e-9,0.75803,0.00087965315,0.23891674,0.0010659905,0.0003287422],"about_ca_topic_score_codex":0.00003607643,"about_ca_topic_score_gemma":0.00007762901,"teacher_disagreement_score":0.86340415,"about_ca_system_score_codex":0.00011082028,"about_ca_system_score_gemma":0.0005097719,"threshold_uncertainty_score":0.9998497},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072494446,0.0003905898,0.996588,0.00032933278,0.0008877726,0.00088241557,0.000018699739,0.000091519854,0.000086705375],"genre_scores_gemma":[0.38111064,0.000043768257,0.6170361,0.0011289386,0.0004572244,0.00004260176,0.000033303084,0.000045720324,0.00010167801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695504,0.000054800836,0.0005724979,0.0012849991,0.00058812846,0.00054456224],"domain_scores_gemma":[0.9977819,0.0007465845,0.0003542874,0.0008102066,0.00016513487,0.00014193548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011117525,0.0004534205,0.0005709784,0.0006129081,0.0003618421,0.000583683,0.0011922384,0.00025875104,0.0000027392102],"category_scores_gemma":[0.000054956326,0.0004208791,0.00013905612,0.0002913519,0.00019872916,0.00047607347,0.00030660353,0.00031116317,0.000004967227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001235055,0.00007239041,0.0072835963,0.0004023079,0.00008395722,0.000032193253,0.001833449,0.44947895,0.000105824656,0.012422602,0.00013347236,0.5281389],"study_design_scores_gemma":[0.000493422,0.00010707902,0.00026853534,0.00034073976,0.0000204543,0.0000033314636,6.8053396e-8,0.97817725,0.00047195202,0.01809028,0.0014930691,0.0005338199],"about_ca_topic_score_codex":0.000029469596,"about_ca_topic_score_gemma":0.00002238406,"teacher_disagreement_score":0.52869827,"about_ca_system_score_codex":0.00020388552,"about_ca_system_score_gemma":0.00016518669,"threshold_uncertainty_score":0.9998243},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014107258,0.00017131794,0.99351597,0.00022772398,0.00356408,0.0002120395,0.0000027998383,0.00022860369,0.0006667627],"genre_scores_gemma":[0.31171778,0.000020097461,0.68675643,0.0005802239,0.0007750114,0.000004769538,0.000010276626,0.000045445588,0.0000899308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537736,0.00012303895,0.00071185874,0.0018553281,0.0012064499,0.0007259641],"domain_scores_gemma":[0.99685484,0.0005742695,0.0005432326,0.0013849768,0.0004448036,0.0001978812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014775414,0.000570726,0.0006303031,0.0010631438,0.0004133801,0.0007244063,0.0020216592,0.0005009206,0.000018413835],"category_scores_gemma":[0.00023792806,0.0005590238,0.00018892891,0.0010647748,0.00058378035,0.0011657083,0.00090420776,0.0010499426,0.000009404189],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011192259,0.000042507825,0.0006846394,0.000021333366,0.000015204973,0.0001549415,0.00059669634,0.011310206,0.004403562,0.009837339,0.00000206677,0.9729203],"study_design_scores_gemma":[0.00045039871,0.00016010301,0.00074623356,0.00034710357,0.000013416801,0.000176122,2.4808926e-7,0.86101085,0.027273953,0.10723854,0.0015482529,0.001034792],"about_ca_topic_score_codex":0.00023381987,"about_ca_topic_score_gemma":0.00036552947,"teacher_disagreement_score":0.9718855,"about_ca_system_score_codex":0.000237875,"about_ca_system_score_gemma":0.00069056184,"threshold_uncertainty_score":0.9996861},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002554606,0.00008262482,0.9911876,0.0033822544,0.00089510926,0.00064567453,0.0000030025697,0.00034851232,0.0034297258],"genre_scores_gemma":[0.04691496,0.00006424879,0.93930006,0.011957676,0.0011004728,0.0000517306,0.000016987491,0.000047560392,0.0005462928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957682,0.00011798051,0.0005553463,0.0013576032,0.0017335877,0.00046726762],"domain_scores_gemma":[0.99632734,0.0013398654,0.00037989492,0.0015631393,0.00023650464,0.00015325072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013904142,0.0004393381,0.00033027053,0.00069469545,0.0002979244,0.00048481068,0.002592986,0.00026469585,0.0002587414],"category_scores_gemma":[0.00039508697,0.0003269029,0.0001564147,0.00069424836,0.0006450174,0.00076100416,0.0004430843,0.001076982,0.00012108264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054708767,0.000042121686,0.000007300848,0.000010950861,0.000004549595,0.000039669067,0.00017458481,0.011416525,0.0005489003,0.0022519836,0.00015895418,0.985339],"study_design_scores_gemma":[0.00019072724,0.00019094645,0.00011059381,0.00022247319,0.0000066627354,0.000023952658,1.9389368e-7,0.964193,0.019836845,0.014062275,0.0007735703,0.00038874795],"about_ca_topic_score_codex":0.000015450683,"about_ca_topic_score_gemma":0.00001628864,"teacher_disagreement_score":0.98495024,"about_ca_system_score_codex":0.00034941355,"about_ca_system_score_gemma":0.00042268497,"threshold_uncertainty_score":0.9999183},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047761696,0.0012106706,0.9935984,0.0005502764,0.00069699157,0.0007487201,0.000074297524,0.00012284092,0.0029500194],"genre_scores_gemma":[0.15069254,0.00006959324,0.8458683,0.0020182948,0.0007141748,0.000021657215,0.0002110025,0.00005560054,0.00034887457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951506,0.000062600964,0.00066571514,0.0025985613,0.0006976348,0.0008248574],"domain_scores_gemma":[0.99614394,0.0006617093,0.0003199222,0.0024282953,0.00027420418,0.00017192504],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015867535,0.0005784673,0.0007534213,0.00084867683,0.00029410142,0.0005917874,0.005873888,0.00025097225,7.096253e-7],"category_scores_gemma":[0.00019036235,0.0005464738,0.00008092571,0.0006525577,0.0006212044,0.00055934937,0.0042511458,0.0008064115,0.0000035963808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037326805,0.000072650626,0.00026782654,0.0003367579,0.000047971625,0.00032107913,0.005109271,0.20118123,0.00002272877,0.019495795,0.001619281,0.7714881],"study_design_scores_gemma":[0.00065860065,0.00009546534,0.0001020141,0.0004920367,0.0000065394197,0.00036763863,0.0000019312874,0.9786011,0.000014702103,0.01339017,0.00560779,0.00066203723],"about_ca_topic_score_codex":0.00010524669,"about_ca_topic_score_gemma":0.000059329872,"teacher_disagreement_score":0.7774198,"about_ca_system_score_codex":0.00018175114,"about_ca_system_score_gemma":0.00036956323,"threshold_uncertainty_score":0.9996987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015634524,0.00030080558,0.99518484,0.000075541364,0.0019051405,0.00036752032,0.000005432179,0.0003189603,0.0016853991],"genre_scores_gemma":[0.014436846,0.00008055054,0.9846268,0.00031329753,0.00028704933,0.000008247819,0.0000028487582,0.00004221547,0.0002021003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597436,0.00003769034,0.0006481242,0.0015445838,0.0011194409,0.0006757853],"domain_scores_gemma":[0.99685925,0.00029161765,0.00046056963,0.0018655333,0.0003399674,0.00018305055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000884551,0.0005245807,0.00046395836,0.0009480171,0.00058133213,0.0004243936,0.0032445819,0.00042475158,0.0000116848905],"category_scores_gemma":[0.00021638261,0.0005343418,0.00016039879,0.0005849491,0.00066843256,0.0015429545,0.0011095244,0.0010926201,0.00004144411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002291368,0.000017619795,0.0000125285105,0.000019344967,0.0000052381606,0.00002775496,0.00061578146,0.62506104,0.00019933641,0.0040837303,0.000009973171,0.36994538],"study_design_scores_gemma":[0.00009755633,0.000036923753,0.000050580693,0.00022141937,0.000006950893,0.00021858118,6.304915e-8,0.94823956,0.0016335087,0.048517518,0.0004289026,0.00054844836],"about_ca_topic_score_codex":0.000019739538,"about_ca_topic_score_gemma":0.000015285763,"teacher_disagreement_score":0.36939692,"about_ca_system_score_codex":0.000666626,"about_ca_system_score_gemma":0.0009301241,"threshold_uncertainty_score":0.9997108},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051527277,0.000108438515,0.99471706,0.0002457866,0.0010710601,0.00053144875,0.0000061086284,0.00028407818,0.0029844968],"genre_scores_gemma":[0.033563886,0.000049733306,0.96477973,0.0008217035,0.00026713,0.000017238517,0.000026706984,0.000028532304,0.00044533683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99629176,0.00006615862,0.0007567545,0.0013212732,0.0011604945,0.0004035577],"domain_scores_gemma":[0.9969387,0.00035569374,0.0005439681,0.0015796507,0.00045253013,0.00012946353],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005315934,0.0003715245,0.00048823387,0.0011354838,0.00018314632,0.00026787253,0.0022940713,0.00028904533,0.000026020241],"category_scores_gemma":[0.00019462986,0.00033258935,0.00012987482,0.0016375723,0.00070586347,0.0012949124,0.0006059508,0.00052943605,0.000009487323],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051611764,0.00012563466,0.00010079244,0.000037580543,0.0000074963295,0.000019682899,0.0003907543,0.0020310762,0.008689507,0.0026853469,0.00021684123,0.9856901],"study_design_scores_gemma":[0.0006088914,0.0007408868,0.0011077272,0.00030916836,0.000024980869,0.00004747247,7.5266985e-7,0.7389268,0.12552388,0.1315391,0.0003211898,0.0008491355],"about_ca_topic_score_codex":0.00025826358,"about_ca_topic_score_gemma":0.000036314505,"teacher_disagreement_score":0.984841,"about_ca_system_score_codex":0.0002152825,"about_ca_system_score_gemma":0.00028444832,"threshold_uncertainty_score":0.9999126},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00799937,0.0024186668,0.9575968,0.0064564855,0.0021428193,0.0016042425,0.0000029702742,0.00024595938,0.021532716],"genre_scores_gemma":[0.9469408,0.00012746832,0.019922296,0.004145095,0.0010334227,0.00020473082,0.000039989824,0.00011526402,0.027470956],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99629235,0.00015787077,0.000534759,0.001428047,0.0008900898,0.0006968829],"domain_scores_gemma":[0.9977287,0.0008601054,0.000429124,0.0007476255,0.00007499203,0.0001594364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000869991,0.0005159138,0.0004135859,0.0008916901,0.00051439845,0.00025124682,0.0011582904,0.00020075585,0.0003632339],"category_scores_gemma":[0.00009381383,0.0004468073,0.00013808448,0.0006516393,0.00072992506,0.00009683567,0.00029847506,0.0017175684,0.00037525457],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051264742,0.00005509977,0.0022278894,0.000022981278,0.000026537686,0.000025100197,0.01315274,0.38121593,0.00030686407,0.0016006647,0.00035454452,0.6009604],"study_design_scores_gemma":[0.0005585136,0.00047032392,0.0039787856,0.00091935217,0.000049560877,0.000050606974,0.00006655676,0.03026245,0.00036931623,0.004423086,0.95723855,0.0016129204],"about_ca_topic_score_codex":0.00030923486,"about_ca_topic_score_gemma":0.0001813591,"teacher_disagreement_score":0.95688397,"about_ca_system_score_codex":0.0006154412,"about_ca_system_score_gemma":0.00025750135,"threshold_uncertainty_score":0.99979836},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036326203,0.03548858,0.9235019,0.0005492904,0.001901313,0.0003781066,0.00003244873,0.0000432322,0.0017789409],"genre_scores_gemma":[0.89295834,0.0004496355,0.10454537,0.00094558817,0.00070150144,0.0000063080092,0.000010726747,0.000021755674,0.00036077652],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985933,0.000014618175,0.0003109177,0.0005789427,0.00024526607,0.00025695778],"domain_scores_gemma":[0.999151,0.00007415418,0.00017986484,0.00039373172,0.00014765475,0.00005360054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018226559,0.00023191124,0.00032748407,0.00013276262,0.000075134594,0.00001610111,0.00033798002,0.00026499986,0.000011342344],"category_scores_gemma":[0.0001296039,0.00018742005,0.00008113914,0.00008848392,0.00158742,0.0000030414078,0.00046279572,0.00021435792,0.000002087206],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008966706,0.000015397502,0.000028770013,0.000038744707,0.000039052396,0.0001828817,0.00087131374,0.0021426035,0.0016271264,0.000101131656,0.000110437184,0.9948336],"study_design_scores_gemma":[0.0043518813,0.00867135,0.00022912478,0.0056552375,0.00021047362,0.009225903,0.0001540531,0.023013221,0.47655156,0.046875183,0.41844943,0.006612603],"about_ca_topic_score_codex":0.000006289902,"about_ca_topic_score_gemma":0.000041165047,"teacher_disagreement_score":0.988221,"about_ca_system_score_codex":0.000043803815,"about_ca_system_score_gemma":0.00013927186,"threshold_uncertainty_score":0.7642768},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025111673,0.0021252194,0.9961034,0.00003283912,0.0005308061,0.00058754714,0.000011311563,0.00004886601,0.0003088962],"genre_scores_gemma":[0.9505528,0.000058879134,0.049206246,0.00003903183,0.000076386794,0.000012176526,0.0000058362425,0.000038356553,0.00001028399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854696,0.00003665117,0.0005041305,0.0003404554,0.00037758713,0.00019421404],"domain_scores_gemma":[0.99851704,0.0005001709,0.00028252424,0.00039003332,0.00027240827,0.000037825088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046187895,0.00027767336,0.00043889869,0.00028019559,0.00006996447,0.000057916615,0.00030026605,0.0001131817,0.0000039858783],"category_scores_gemma":[0.00017222333,0.00022375524,0.000032659664,0.0002458465,0.00018747583,0.0001826401,0.000029204704,0.00026732392,4.407752e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008439826,0.000004207992,0.0000074092845,0.0001257503,0.00001943094,0.0000010590217,0.00007117979,0.9834484,0.00014215746,0.012362463,0.0000013660084,0.0038081321],"study_design_scores_gemma":[0.00028450316,0.00006555848,0.0000034815052,0.00064538704,0.000017737062,0.000012004891,7.231987e-7,0.99606735,0.00084190926,0.0018585729,0.000014952012,0.00018781789],"about_ca_topic_score_codex":0.000009653869,"about_ca_topic_score_gemma":0.0000026376167,"teacher_disagreement_score":0.9503017,"about_ca_system_score_codex":0.00014352136,"about_ca_system_score_gemma":0.000073274925,"threshold_uncertainty_score":0.9124474},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30152598,0.00003625471,0.6977822,0.00007351204,0.00042170857,0.00008131496,0.0000042426564,0.00005326856,0.000021484115],"genre_scores_gemma":[0.82667875,0.000006480533,0.17300001,0.00018363226,0.00011661108,0.0000050244184,8.94807e-7,0.000008032598,5.841379e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929655,0.000011289844,0.00010685638,0.00020287994,0.00014161214,0.00024079451],"domain_scores_gemma":[0.9996478,0.000116942305,0.000010250276,0.00013368258,0.000027064933,0.000064244035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094563926,0.000110591005,0.00012148735,0.000099176264,0.000059326045,0.00013990233,0.00012380265,0.000042549436,0.00003654765],"category_scores_gemma":[0.000038785285,0.00009275227,0.000011181047,0.00016325402,0.000103420585,0.00008762584,0.0000724008,0.00016625132,0.00003239557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.331964e-7,0.0000031692834,0.000026029677,0.000023161583,0.0000016987501,0.0000014954073,0.000298772,0.69288796,0.010159596,0.000047798694,0.000018698898,0.29653087],"study_design_scores_gemma":[0.00006417802,0.000044947803,0.0018723126,0.000051480223,0.0000017815485,0.0000035404842,2.3045322e-7,0.97664535,0.012616738,0.008503743,0.000056119046,0.00013957515],"about_ca_topic_score_codex":0.000023756185,"about_ca_topic_score_gemma":0.0000061362875,"teacher_disagreement_score":0.52515274,"about_ca_system_score_codex":0.000028813673,"about_ca_system_score_gemma":0.000013070979,"threshold_uncertainty_score":0.37823278},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016984397,0.004211768,0.9899245,0.0018706751,0.0010482703,0.00031315378,0.0000073067954,0.00024004186,0.0022144767],"genre_scores_gemma":[0.8121141,0.00094010984,0.18258345,0.0030797515,0.00064434466,0.000011152551,0.000003697373,0.000046666686,0.00057672325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947102,0.000054419426,0.0006998004,0.0022767552,0.0013655795,0.000893216],"domain_scores_gemma":[0.9968755,0.0004404194,0.0003002759,0.0016590888,0.00035284497,0.00037187221],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012122487,0.00072857935,0.0007118525,0.00064452796,0.0003624753,0.0011456138,0.0035095734,0.0005821206,0.00003486728],"category_scores_gemma":[0.00006014167,0.0006872501,0.000111668785,0.0004658454,0.0011447171,0.00095832127,0.0018730118,0.0015144731,0.00008553099],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004421528,0.000020456184,0.000053959247,0.000020306685,0.0000070894607,0.000081780134,0.00056341663,0.0035078535,0.000045278604,0.108041465,0.000045807014,0.8876082],"study_design_scores_gemma":[0.0004591228,0.00024104609,0.00029017602,0.0006310899,0.000010566754,0.0003336359,5.325998e-7,0.5645121,0.00057184853,0.42180055,0.009615719,0.0015336621],"about_ca_topic_score_codex":0.00006430462,"about_ca_topic_score_gemma":0.00021697133,"teacher_disagreement_score":0.8860745,"about_ca_system_score_codex":0.00027116228,"about_ca_system_score_gemma":0.00071879174,"threshold_uncertainty_score":0.9998913},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022828002,0.00026252875,0.99363667,0.00046859583,0.0022494239,0.0005595293,0.000024891806,0.00023003788,0.00028554304],"genre_scores_gemma":[0.35473955,0.000096060015,0.6356735,0.0009929497,0.0025440857,0.0000353617,0.00003464713,0.0001250438,0.005758771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951199,0.00008154399,0.00061722065,0.0019345846,0.0014094235,0.0008372938],"domain_scores_gemma":[0.9952376,0.0028108119,0.00044052157,0.00088085973,0.00042678273,0.00020344599],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088716805,0.00059007155,0.00067717367,0.0007737784,0.0005489496,0.00055136706,0.0022949555,0.00037324225,0.000015225518],"category_scores_gemma":[0.00050753553,0.0005452083,0.000276615,0.000522845,0.00028307835,0.0007688481,0.00059773383,0.0011743,0.000022431748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003406112,0.00004035261,0.00009755819,0.0000119951355,0.00002213667,0.00006347901,0.00090933585,0.04477044,0.0005926281,0.0039407513,0.0001724658,0.9493448],"study_design_scores_gemma":[0.0005919346,0.00049431325,0.0026405035,0.00078009896,0.000008281308,0.00007735127,1.3738614e-7,0.9321019,0.002396579,0.038206313,0.021774001,0.0009285921],"about_ca_topic_score_codex":0.00009884283,"about_ca_topic_score_gemma":0.00009132193,"teacher_disagreement_score":0.94841623,"about_ca_system_score_codex":0.0006414772,"about_ca_system_score_gemma":0.00067706435,"threshold_uncertainty_score":0.99969995},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000069380517,0.00029164055,0.99525505,0.0003166269,0.0011561238,0.0011249932,0.00000398148,0.00016807622,0.0016765794],"genre_scores_gemma":[0.008550384,0.00008269614,0.9889792,0.0015713235,0.00021054891,0.000045709046,0.000014187128,0.000031512707,0.0005144419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966665,0.000025519335,0.0005096883,0.0011515603,0.0008193099,0.0008274066],"domain_scores_gemma":[0.9979361,0.00038773863,0.00024662653,0.0008111546,0.0004104813,0.00020789447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001419239,0.00035182716,0.0003527422,0.00068362284,0.00034312392,0.00049351266,0.00214334,0.00026218902,0.000030278565],"category_scores_gemma":[0.00011452989,0.0003378212,0.00012812644,0.0005641509,0.0003398916,0.00051158754,0.00069396757,0.00041589787,0.000027745024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067921433,0.000029724686,0.000011425494,0.000048581704,0.000007455673,0.00001093229,0.0006453579,0.10686525,0.00006719428,0.013473058,0.00006921962,0.878765],"study_design_scores_gemma":[0.0004237664,0.00015456259,0.000009230437,0.0001910092,0.000003539671,0.000014553065,1.0036548e-7,0.9576231,0.0004325933,0.033460002,0.0073099085,0.00037760797],"about_ca_topic_score_codex":0.00001318444,"about_ca_topic_score_gemma":0.00004382293,"teacher_disagreement_score":0.8783874,"about_ca_system_score_codex":0.00034319836,"about_ca_system_score_gemma":0.00047780375,"threshold_uncertainty_score":0.9999074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000034837497,0.0009048637,0.9887743,0.0057726293,0.001859873,0.00061898696,0.0000034173163,0.00013306967,0.0019293824],"genre_scores_gemma":[0.012957682,0.00018922093,0.97038424,0.012012088,0.0014178755,0.000100909994,0.000013496609,0.0000740868,0.0028504191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965208,0.000043914664,0.00047575598,0.0013514304,0.000780071,0.00082802284],"domain_scores_gemma":[0.99688274,0.0007108127,0.0004009388,0.0014922246,0.0003729521,0.00014036377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014548473,0.00046538314,0.00035650367,0.00041157482,0.0009656941,0.0010229093,0.0027386649,0.0002276691,0.000003003278],"category_scores_gemma":[0.000201343,0.0003494921,0.00012559142,0.0008300951,0.00056621863,0.00032131665,0.00035485748,0.00043269855,0.0000079083275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016990782,0.000019459443,0.0000054062507,0.000042088235,0.00000789391,0.0000045249353,0.00022071862,0.24629316,0.0000074281024,0.030202564,0.00036884524,0.7228109],"study_design_scores_gemma":[0.000358793,0.00021152316,0.0000033130116,0.00027890084,0.0000058435453,0.0000120404,8.5480714e-8,0.8779075,0.001154895,0.09175557,0.027840251,0.0004712476],"about_ca_topic_score_codex":0.0000093532335,"about_ca_topic_score_gemma":0.000047733203,"teacher_disagreement_score":0.7223397,"about_ca_system_score_codex":0.00041806643,"about_ca_system_score_gemma":0.0012170672,"threshold_uncertainty_score":0.9998957},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035948102,0.00025437537,0.9953399,0.0007456852,0.0007776011,0.00063371897,0.0000020969046,0.00036606114,0.0018446379],"genre_scores_gemma":[0.594824,0.000034592915,0.40310758,0.00048618318,0.00022395085,0.00007495829,0.000015295662,0.00003694016,0.0011964701],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751794,0.00003491507,0.00041628213,0.0011852831,0.0004085332,0.00043706776],"domain_scores_gemma":[0.99820167,0.00034461106,0.0004186181,0.00074727676,0.00023022894,0.000057570298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009649657,0.0003777353,0.00034649152,0.0012022819,0.00017312662,0.00037869895,0.0020981694,0.00048229942,0.000007961402],"category_scores_gemma":[0.00019482392,0.00034669635,0.000077921846,0.00096143194,0.00037275098,0.0008698502,0.00051020726,0.0006354887,0.000014886392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063455495,0.000014709911,0.00018842958,0.000017870123,0.0000025368822,0.0000020076702,0.00037552544,0.0016175436,0.00015477111,0.49537298,0.000018353876,0.5022289],"study_design_scores_gemma":[0.00021646224,0.00014132916,0.0003077201,0.00012763453,0.0000035568569,0.000011870785,5.022703e-7,0.15051858,0.004535016,0.84295774,0.00078270864,0.00039690654],"about_ca_topic_score_codex":0.000014263116,"about_ca_topic_score_gemma":0.00012588786,"teacher_disagreement_score":0.5947881,"about_ca_system_score_codex":0.00034539006,"about_ca_system_score_gemma":0.00038361875,"threshold_uncertainty_score":0.9998985},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031322055,0.0007199556,0.9888954,0.000021896849,0.0003689795,0.00021282177,0.000004711192,0.00083694025,0.005807079],"genre_scores_gemma":[0.41890466,0.000039429255,0.5803369,0.00010140566,0.00040318063,0.0000047989793,0.000007097222,0.00011986615,0.00008264973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781525,0.0000052302003,0.00035991316,0.00083165657,0.00037523606,0.00061270804],"domain_scores_gemma":[0.99890924,0.00018399909,0.00009880598,0.0006776331,0.000058624122,0.00007172225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007293262,0.00050874037,0.00046620943,0.0005607688,0.00010480849,0.0001261955,0.0010682729,0.00040868536,0.0000029555574],"category_scores_gemma":[0.00007175279,0.0005010075,0.00010354721,0.00048962753,0.0005341732,0.00014036077,0.00038365246,0.0011242012,0.0000057482034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.595949e-7,0.0000055314235,0.00002492267,0.00004792415,0.0000060867196,0.000026984346,0.000025884427,0.91385555,0.014518188,0.0003152271,0.0000070827004,0.07116567],"study_design_scores_gemma":[0.00011887951,0.000027271555,0.000021740443,0.00019290822,0.00001570707,0.00007321695,1.9157993e-7,0.93761796,0.021421019,0.039287727,0.00046991857,0.00075345166],"about_ca_topic_score_codex":0.000014399344,"about_ca_topic_score_gemma":0.0000074896748,"teacher_disagreement_score":0.41577247,"about_ca_system_score_codex":0.00039929754,"about_ca_system_score_gemma":0.00002173765,"threshold_uncertainty_score":0.9997442},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019380412,0.00067529833,0.97988325,0.0010862577,0.0055408427,0.00056558434,0.0000019819279,0.00043731707,0.011790079],"genre_scores_gemma":[0.68877196,0.000037180624,0.30649507,0.002278507,0.0016475442,0.00002162739,0.0000016660722,0.000072929004,0.0006735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995091,0.00008317848,0.0010043256,0.0016827587,0.0010473765,0.0010913576],"domain_scores_gemma":[0.9964908,0.0009344041,0.00047203465,0.0015372211,0.0003087755,0.00025681732],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001747578,0.00070457364,0.0009755449,0.00052436185,0.00041191326,0.0011016534,0.0037263434,0.00048752746,0.00006178501],"category_scores_gemma":[0.000120394536,0.00062095694,0.00027029082,0.00059594586,0.00057291857,0.0006203164,0.0011339956,0.0010689407,0.00012643325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008843928,0.000016813037,0.000007759398,0.00003724299,0.000031348503,0.000083388906,0.0004962074,0.72660524,0.000022407627,0.14236292,0.00010874065,0.13021907],"study_design_scores_gemma":[0.00034811214,0.00015998061,0.000009796726,0.0015304992,0.000009220609,0.000117911804,2.499353e-7,0.82746404,0.00010978461,0.16804579,0.0015591407,0.0006454878],"about_ca_topic_score_codex":0.00003225247,"about_ca_topic_score_gemma":0.000102772196,"teacher_disagreement_score":0.6887526,"about_ca_system_score_codex":0.0007521081,"about_ca_system_score_gemma":0.0007213551,"threshold_uncertainty_score":0.99993527},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113823235,0.00015713314,0.88457364,0.0003804804,0.00062967226,0.00015148109,0.0000017723086,0.000050047038,0.00023256028],"genre_scores_gemma":[0.9865024,0.000023625953,0.011442764,0.0007798508,0.001205196,0.0000021403034,0.0000033043093,0.000033333254,0.00000734973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975779,0.000013315051,0.00060332794,0.00084036106,0.0006161851,0.00034891194],"domain_scores_gemma":[0.9980524,0.00024718695,0.0005935259,0.000625005,0.0004571155,0.000024751522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018297442,0.00037411397,0.00068306347,0.0005079504,0.0003711332,0.00043108407,0.00080871704,0.00034362217,0.000010954185],"category_scores_gemma":[0.00025534703,0.00025958102,0.0001966034,0.000522046,0.0008235166,0.0004969423,0.00052866235,0.0009803436,0.0000030769845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019550662,0.000050921837,0.001832591,0.00031382655,0.000020534653,0.000009242074,0.000038543894,0.5346127,0.00064216484,0.0005666168,5.261297e-7,0.46189275],"study_design_scores_gemma":[0.00023634452,0.000007229513,0.000077807694,0.00039638003,0.00010023855,0.0000019810445,2.678984e-7,0.97903746,0.00007907771,0.019716738,0.000040992785,0.00030547692],"about_ca_topic_score_codex":0.00026767093,"about_ca_topic_score_gemma":0.00032902698,"teacher_disagreement_score":0.87313086,"about_ca_system_score_codex":0.000020001125,"about_ca_system_score_gemma":0.00027930824,"threshold_uncertainty_score":0.99998564},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003250707,0.00013495701,0.9945658,0.0022912996,0.00051134446,0.0013938481,0.000006614252,0.0002249097,0.000546154],"genre_scores_gemma":[0.03583596,0.000008256226,0.9615711,0.0019651502,0.0002945363,0.00013405673,0.0000039112724,0.00003286236,0.00015416456],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958309,0.000036400317,0.00048831076,0.001964048,0.00088975136,0.00079062406],"domain_scores_gemma":[0.99708396,0.00035260903,0.00017656123,0.0016371484,0.00025413546,0.0004955636],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010098396,0.0005910412,0.00055066723,0.0009433548,0.00058573124,0.0013149921,0.0030554174,0.00023490748,0.000011478336],"category_scores_gemma":[0.000052807118,0.00049900124,0.00008502483,0.0013967712,0.0007444093,0.00048128047,0.0017439668,0.0011212081,0.000023522605],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005803954,0.000033737808,0.00007878953,0.000045005403,0.00000979198,0.000027741766,0.0012624345,0.0010459193,0.00023063888,0.07155226,0.000005202176,0.9257027],"study_design_scores_gemma":[0.0007796304,0.0017738462,0.0012863206,0.0023637244,0.000048670634,0.00068282726,0.000006452779,0.155805,0.0035550736,0.75942904,0.06996858,0.004300821],"about_ca_topic_score_codex":0.00010345335,"about_ca_topic_score_gemma":0.00086139695,"teacher_disagreement_score":0.92140186,"about_ca_system_score_codex":0.00017280705,"about_ca_system_score_gemma":0.0002862203,"threshold_uncertainty_score":0.99974614},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004099724,0.000028969596,0.99272317,0.0017226003,0.00002715743,0.0010089395,0.0000013453816,0.00019636838,0.0001917487],"genre_scores_gemma":[0.4251944,0.0000013245473,0.5740163,0.00065425894,0.00008335066,0.000029575123,0.000003019676,0.000006737028,0.000011033272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868137,0.000010601175,0.00018878015,0.00058294396,0.00017390947,0.00036237674],"domain_scores_gemma":[0.9991816,0.00012776244,0.000059984897,0.00045004528,0.00006316523,0.00011743562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025215294,0.00013885282,0.0002132319,0.00016154017,0.00016989416,0.00006169478,0.00029159838,0.00003832912,0.0000029774199],"category_scores_gemma":[0.00019591284,0.000113843926,0.000044887707,0.00082976004,0.00013393164,0.0000912605,0.000060456987,0.00021548037,0.000001845042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009163122,0.00014947109,0.0010378672,0.00008110003,0.0000031752313,0.000006369275,0.0005674155,0.10688086,0.017284207,0.001184125,0.00011140387,0.8726024],"study_design_scores_gemma":[0.0006939684,0.0002892213,0.00064380135,0.000116433745,0.000012702355,0.00016755516,4.005379e-7,0.935401,0.009524738,0.052686553,0.0002966768,0.00016693426],"about_ca_topic_score_codex":0.000014529755,"about_ca_topic_score_gemma":0.0000015036707,"teacher_disagreement_score":0.87243545,"about_ca_system_score_codex":0.0000972716,"about_ca_system_score_gemma":0.0002178705,"threshold_uncertainty_score":0.46424204},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019133668,0.00017675893,0.9879903,0.000048443722,0.0023433533,0.00040270897,0.000023962542,0.0002532882,0.0068477755],"genre_scores_gemma":[0.9916381,0.000045984027,0.0074226013,0.00019409155,0.0003980357,0.000011749735,0.000015380028,0.000039032053,0.00023498839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982956,0.000015849553,0.00037506074,0.0005534632,0.00045346422,0.00030653283],"domain_scores_gemma":[0.9993417,0.000079435005,0.000054592554,0.0003517847,0.00011164901,0.00006082901],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025790997,0.0003469366,0.0003311907,0.00033476666,0.00020035158,0.0002871855,0.00036321324,0.00043573452,0.0000654501],"category_scores_gemma":[0.00003443053,0.00031184359,0.000069382826,0.00022881049,0.00013027473,0.0003232506,0.0000635283,0.00076011533,0.00011160642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058488718,0.000005076963,0.0000011914517,0.000024120984,0.000007614429,0.000012147883,0.00032701428,0.9313415,0.0012074783,0.0034246396,0.000018561717,0.06362478],"study_design_scores_gemma":[0.0007517644,0.0005030016,0.0001157102,0.001845895,0.000019813751,0.000070607035,0.0000016833748,0.9418615,0.002840736,0.046466675,0.0044040577,0.0011185445],"about_ca_topic_score_codex":0.00009818087,"about_ca_topic_score_gemma":0.00034770972,"teacher_disagreement_score":0.98972476,"about_ca_system_score_codex":0.00069405825,"about_ca_system_score_gemma":0.00014402081,"threshold_uncertainty_score":0.99993336},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036887926,0.00047737325,0.9923431,0.0012186234,0.002781164,0.0010979179,0.000034217628,0.00039343955,0.0016172635],"genre_scores_gemma":[0.3951943,0.000008426987,0.6023102,0.0009378567,0.0008614335,0.00010265779,0.00006624762,0.0000787081,0.0004401989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570644,0.000049801572,0.0009156429,0.0016355752,0.000987012,0.00070553645],"domain_scores_gemma":[0.9971098,0.0005122739,0.0004232636,0.001272088,0.00049742707,0.00018516439],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013715287,0.00062284165,0.0006646377,0.0008055936,0.00040774257,0.0008977474,0.002739959,0.00049630116,0.000006442639],"category_scores_gemma":[0.00003182822,0.0005622102,0.00024879852,0.00035482532,0.0001577388,0.00048521545,0.0004811534,0.00058766745,0.0000066510656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011158089,0.00012181845,0.00017095255,0.0002909557,0.000025415065,0.000038281873,0.00018051972,0.79112554,0.00020379109,0.035164874,0.0031333396,0.16953336],"study_design_scores_gemma":[0.00031373513,0.0001143912,0.0000059768836,0.00080344704,0.0000081710805,0.000028332712,1.2832041e-7,0.9599672,0.00031769366,0.034033485,0.0037621371,0.000645282],"about_ca_topic_score_codex":0.00013972435,"about_ca_topic_score_gemma":0.000026429308,"teacher_disagreement_score":0.3951574,"about_ca_system_score_codex":0.0004975304,"about_ca_system_score_gemma":0.0009266214,"threshold_uncertainty_score":0.99968296},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010522839,0.00009900453,0.99296564,0.00036413674,0.0022604938,0.0008199274,0.0000071074155,0.00040876234,0.0029696806],"genre_scores_gemma":[0.5260998,0.00005826679,0.47228372,0.0010639718,0.0003338184,0.000012334488,0.000012663201,0.000040545703,0.00009490834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955627,0.000051662828,0.0007699778,0.0017060855,0.0010962333,0.0008133594],"domain_scores_gemma":[0.997102,0.00050712546,0.0005146067,0.0010521391,0.0004921492,0.0003319805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009770577,0.00071270164,0.0005690046,0.0011430788,0.00046790845,0.0006258619,0.0009654524,0.00050870306,0.00014165686],"category_scores_gemma":[0.000066928806,0.0006473578,0.0001484851,0.00079064164,0.0015529038,0.00072435406,0.00037196616,0.0012342727,0.000030707197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014278286,0.000016115222,0.00056088064,0.00001159325,0.000021507556,0.00008572655,0.0002566118,0.32303727,0.0000320826,0.008330688,0.0000046492837,0.6676286],"study_design_scores_gemma":[0.00092850835,0.00024464724,0.0036024288,0.00034253488,0.000018546096,0.0006210721,0.0000018282925,0.98861486,0.00022907398,0.004070848,0.00035423215,0.0009714052],"about_ca_topic_score_codex":0.00011538332,"about_ca_topic_score_gemma":0.0020888748,"teacher_disagreement_score":0.6666572,"about_ca_system_score_codex":0.00071895175,"about_ca_system_score_gemma":0.0007506428,"threshold_uncertainty_score":0.9995978},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023186996,0.00032841924,0.9875828,0.0005206491,0.0033315483,0.00038139758,0.0015987967,0.0001444097,0.0037932543],"genre_scores_gemma":[0.96991795,0.000028653723,0.019052166,0.001634697,0.00046561158,0.000030415373,0.008683315,0.000031347663,0.00015583767],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974558,0.00014912512,0.0003979593,0.0011319189,0.0004781367,0.00038708607],"domain_scores_gemma":[0.9983114,0.00047409371,0.00035286119,0.00047782974,0.00024083802,0.00014298639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036600974,0.00044772885,0.0003424203,0.000557016,0.00028197616,0.00013078636,0.00033788354,0.0005402348,0.0006379127],"category_scores_gemma":[0.00007587775,0.00043041757,0.00011901946,0.00024588537,0.00064957124,0.00018434996,0.000042577514,0.0007393327,0.00008728689],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003691588,0.00038389303,0.0005308772,0.00008461564,0.000070423404,0.00011658465,0.001570867,0.00061887107,0.0006653029,0.024401011,0.0013241303,0.96986425],"study_design_scores_gemma":[0.006824915,0.0019972427,0.024213154,0.0031899342,0.00025213693,0.00011518804,0.000011489369,0.03788262,0.005082602,0.9133644,0.003459974,0.0036063227],"about_ca_topic_score_codex":0.00025430403,"about_ca_topic_score_gemma":0.0002234023,"teacher_disagreement_score":0.96853065,"about_ca_system_score_codex":0.00026666108,"about_ca_system_score_gemma":0.00020082625,"threshold_uncertainty_score":0.99981475},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006131031,0.00041742163,0.99429363,0.00029133065,0.00039588605,0.0003686335,0.0000037467198,0.00011883666,0.0034974318],"genre_scores_gemma":[0.03057844,0.000037941358,0.96858466,0.00042833187,0.00023101336,0.0000074391173,0.0000053225317,0.000025195843,0.00010166953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969968,0.000024681387,0.0003331448,0.0013108457,0.0008179844,0.00051655114],"domain_scores_gemma":[0.99861604,0.00012687755,0.0002499298,0.000778706,0.00011076953,0.000117689546],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003691162,0.0004612325,0.00038778738,0.0004383053,0.00027727612,0.0012385425,0.0014064916,0.00017926918,0.000004050337],"category_scores_gemma":[0.000005326873,0.00035129965,0.000046027668,0.0003509319,0.00053369795,0.00067657296,0.0007771657,0.0004319373,0.000011618191],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004357478,0.000030520416,0.000102633305,0.00007431267,0.000011663777,0.00017619638,0.0009990259,0.027346864,0.00009713129,0.0031315861,0.000022959553,0.96800274],"study_design_scores_gemma":[0.00038565343,0.0002605223,0.00091908773,0.0003379612,0.000012261553,0.0002325016,5.274764e-7,0.8301761,0.0002455185,0.16639213,0.00024818952,0.0007895088],"about_ca_topic_score_codex":0.0000823291,"about_ca_topic_score_gemma":0.000041108957,"teacher_disagreement_score":0.9672132,"about_ca_system_score_codex":0.00011854755,"about_ca_system_score_gemma":0.0001557521,"threshold_uncertainty_score":0.9998939},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037767375,0.0013104703,0.99053764,0.000030232257,0.0015214521,0.0002502012,0.0000061667392,0.00035844665,0.0059476225],"genre_scores_gemma":[0.87603503,0.000012984106,0.12312192,0.00046528137,0.00024654996,0.000009873127,0.000003906385,0.0000931921,0.000011257468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997466,0.000015252416,0.00035008907,0.0006130196,0.0009322103,0.000623377],"domain_scores_gemma":[0.9989799,0.00011450605,0.00008209693,0.0005532515,0.00014664116,0.00012357971],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006827664,0.00045426647,0.0004724321,0.00039898505,0.00017944229,0.00016917285,0.0006700321,0.00020801618,0.000016837877],"category_scores_gemma":[0.000046802536,0.00045497296,0.000104558654,0.00025648205,0.000234421,0.00012310476,0.000060870338,0.0006361378,0.000017299402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016445606,0.000009963425,0.000021284983,0.00028015056,0.00002902637,0.00004064359,0.00014240171,0.8999971,0.001116449,0.0001665191,0.000017032171,0.098177746],"study_design_scores_gemma":[0.00023036034,0.000037348942,0.00002945807,0.0015185993,0.000037208694,0.000036619214,7.2090234e-7,0.9937719,0.002827159,0.0004371008,0.00050764787,0.0005658701],"about_ca_topic_score_codex":0.00001312658,"about_ca_topic_score_gemma":0.000019951358,"teacher_disagreement_score":0.87599725,"about_ca_system_score_codex":0.0008174119,"about_ca_system_score_gemma":0.00016254738,"threshold_uncertainty_score":0.9997902},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012235735,0.00013512635,0.9970824,0.00009354947,0.0012657373,0.0002931453,0.000049697657,0.00009764554,0.0008603154],"genre_scores_gemma":[0.17961319,0.00005990958,0.8189601,0.00030443683,0.00019423368,0.0000077227805,0.00007225934,0.00003808952,0.0007500692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960884,0.00004031898,0.0009424675,0.0012850063,0.0012266972,0.00041714875],"domain_scores_gemma":[0.99701965,0.00026275255,0.00064417574,0.0016100019,0.0003076551,0.00015578237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008353398,0.0003831818,0.00045871997,0.00059755304,0.00017733322,0.0003237545,0.0026830058,0.00023654776,0.0000382732],"category_scores_gemma":[0.000108652326,0.0003345989,0.00006713971,0.0005239903,0.00055780273,0.0007567415,0.0012084582,0.0005194948,0.0000485872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012455394,0.000117191485,0.000074311196,0.00010209165,0.000024614794,0.0001737706,0.0011858235,0.026313648,0.0012307774,0.053140473,0.00012512352,0.9174997],"study_design_scores_gemma":[0.00025020546,0.00014408505,0.00040531324,0.00031619368,0.000009112585,0.000052363164,1.3943915e-7,0.90541863,0.0052776244,0.08751301,0.00019122016,0.0004220864],"about_ca_topic_score_codex":0.000029543686,"about_ca_topic_score_gemma":0.0000084314825,"teacher_disagreement_score":0.91707766,"about_ca_system_score_codex":0.0001732032,"about_ca_system_score_gemma":0.00024444086,"threshold_uncertainty_score":0.9999106},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000048906104,0.00081170286,0.99127406,0.0007364771,0.0018588777,0.0005442952,0.000008757165,0.0002480152,0.00451291],"genre_scores_gemma":[0.03851666,0.0000698145,0.95822716,0.001655573,0.0004572241,0.000034891287,0.00000589694,0.00003927164,0.0009935282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955944,0.0000794524,0.0006592356,0.0019785531,0.00084204104,0.00084633846],"domain_scores_gemma":[0.99638635,0.0010262582,0.00034449095,0.0014378596,0.0005620485,0.00024301236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020277312,0.00061910786,0.0006584582,0.00069925823,0.00035145544,0.0007462798,0.0038446723,0.0006153932,0.000045744997],"category_scores_gemma":[0.00016263756,0.0005893138,0.00021005237,0.00048224448,0.0005937429,0.00081294024,0.0009560491,0.00097327534,0.000059458278],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055856535,0.000021328542,0.0000035239848,0.000028486898,0.0000090862595,0.000010288083,0.00032614268,0.00501596,0.000230287,0.11622222,0.00004635266,0.8780807],"study_design_scores_gemma":[0.00023059724,0.00020759334,0.000009431478,0.00024583313,0.000008313332,0.00005820196,1.1971989e-7,0.6656669,0.0012332462,0.3301315,0.0016444763,0.00056380156],"about_ca_topic_score_codex":0.000014391977,"about_ca_topic_score_gemma":0.000011495307,"teacher_disagreement_score":0.8775169,"about_ca_system_score_codex":0.00028069675,"about_ca_system_score_gemma":0.00045024272,"threshold_uncertainty_score":0.99965584},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007439971,0.00019397882,0.9922259,0.000909221,0.0013583371,0.0010789584,0.000010601513,0.00022357077,0.00399198],"genre_scores_gemma":[0.0325801,0.00005696398,0.95980453,0.0024265414,0.0011781538,0.00014048256,0.000012105174,0.00011758795,0.003683511],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99485713,0.000054171996,0.00050548627,0.0021756247,0.0013244839,0.0010830984],"domain_scores_gemma":[0.99541545,0.0016131492,0.0002650932,0.0020837546,0.00036706854,0.0002555079],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016727403,0.00062984746,0.00063012907,0.0012483638,0.00038652125,0.0005360484,0.0054714456,0.00033104635,0.00001144289],"category_scores_gemma":[0.0002155501,0.0005409229,0.00022370959,0.00065806735,0.0009920916,0.00040656433,0.0011756115,0.0009032,0.00007398688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010816139,0.00002165729,0.000003319152,0.00003895905,0.000007952259,0.000013779746,0.00024475722,0.038965136,0.00008808585,0.20088042,0.000030369953,0.75969476],"study_design_scores_gemma":[0.00031769267,0.00060961896,0.000009311952,0.00028514964,0.0000028927604,0.000020883203,4.8620805e-8,0.4089937,0.0012599393,0.57755095,0.010428968,0.000520829],"about_ca_topic_score_codex":0.0000053200242,"about_ca_topic_score_gemma":0.00005867475,"teacher_disagreement_score":0.7591739,"about_ca_system_score_codex":0.00027128865,"about_ca_system_score_gemma":0.00035649416,"threshold_uncertainty_score":0.9999094},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007906177,0.00004626204,0.99742126,0.000024519397,0.00054308295,0.00065475726,0.000021379743,0.00013895813,0.001070707],"genre_scores_gemma":[0.4778522,0.0000022933154,0.52160835,0.00014524026,0.00023752601,0.000013250362,0.00011908258,0.000012918618,0.000009143515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974232,0.00004597924,0.00059148704,0.000796366,0.0007842302,0.00035875896],"domain_scores_gemma":[0.9981178,0.00011664681,0.00049806974,0.0005881045,0.0005768763,0.00010251234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007920784,0.00035532267,0.0004079243,0.0009292133,0.00036647567,0.000779563,0.0008093091,0.00030001294,0.000001775457],"category_scores_gemma":[0.00003352806,0.00033799827,0.00012695252,0.00055293686,0.0002543903,0.0023688043,0.0001368566,0.00024091585,0.0000026048635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008290302,0.000014553244,0.00013638765,0.00010209262,0.000014175337,0.0000020162815,0.0006782322,0.6608686,0.00013519403,0.064028755,0.0000069183343,0.2740048],"study_design_scores_gemma":[0.0002139733,0.00012285185,0.00017279979,0.00013697309,0.000025223266,0.00003210043,0.0000034169154,0.99531907,0.00009660808,0.0034593693,0.000044944354,0.0003726538],"about_ca_topic_score_codex":0.00012703723,"about_ca_topic_score_gemma":0.000052349722,"teacher_disagreement_score":0.47777313,"about_ca_system_score_codex":0.0006985236,"about_ca_system_score_gemma":0.0004894606,"threshold_uncertainty_score":0.9999072},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065956,0.0057314197,0.98442096,0.0014755329,0.0020049175,0.0004685369,0.0000032852072,0.00031836328,0.004917444],"genre_scores_gemma":[0.8219929,0.0006912244,0.1480299,0.020227335,0.008078109,0.000023897946,0.000117430354,0.00018006464,0.00065914466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588513,0.000008338944,0.00075868133,0.0012682981,0.0010411767,0.0010383971],"domain_scores_gemma":[0.9980894,0.000080948514,0.000676584,0.0007200508,0.00038432798,0.000048698937],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013323448,0.0006783386,0.0007305663,0.0014166828,0.0005473534,0.0010838809,0.0014933698,0.00024136154,0.00022634545],"category_scores_gemma":[0.000017245717,0.0006190046,0.00020173925,0.0013089838,0.00022754016,0.0015067233,0.001252796,0.0006116574,0.00026971573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000120941295,0.00004135303,0.00044600674,0.0011999491,0.00004138966,0.00002531665,0.00011164546,0.05853726,0.0000049575688,0.00147931,0.00006267324,0.93803805],"study_design_scores_gemma":[0.00055537705,0.000018563667,0.00043323505,0.0072784694,0.00022609357,0.000008414355,0.0000047020403,0.88857436,0.0000148287545,0.073077254,0.027685149,0.0021235407],"about_ca_topic_score_codex":0.0003479409,"about_ca_topic_score_gemma":0.00019238664,"teacher_disagreement_score":0.9359145,"about_ca_system_score_codex":0.00019846798,"about_ca_system_score_gemma":0.00010562133,"threshold_uncertainty_score":0.9999531},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002960405,0.00038080863,0.9863779,0.0004494157,0.0009321837,0.00027835378,0.0000021561261,0.00026288454,0.011020265],"genre_scores_gemma":[0.047937322,0.00013550611,0.94931513,0.0010175754,0.00075234723,0.000009269328,0.00001335581,0.000044349297,0.0007751653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963497,0.000029482793,0.0005769106,0.0014311282,0.0009740104,0.00063875894],"domain_scores_gemma":[0.9978528,0.00021662262,0.00031408144,0.0012163513,0.00021976435,0.00018037543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006521712,0.000548744,0.00055352796,0.0007728616,0.00034417285,0.00080085726,0.002692451,0.00023506473,0.000094277624],"category_scores_gemma":[0.000042002528,0.0004603328,0.0002064595,0.0012723686,0.0002451794,0.0009360268,0.0011140032,0.00056423224,0.00007736247],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003124343,0.000026101412,0.00023181296,0.000026479505,0.000021825967,0.00007613394,0.0009149368,0.013346364,0.00006581541,0.003664923,0.0000098421215,0.9816126],"study_design_scores_gemma":[0.00023274201,0.00009307702,0.00015512874,0.00011758917,0.000013856998,0.0000703603,2.6989872e-7,0.95691377,0.00010877128,0.04008472,0.0016132919,0.00059639977],"about_ca_topic_score_codex":0.000026069536,"about_ca_topic_score_gemma":0.00009081448,"teacher_disagreement_score":0.9810162,"about_ca_system_score_codex":0.00028151655,"about_ca_system_score_gemma":0.0002613739,"threshold_uncertainty_score":0.9997848},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032606746,0.0043769274,0.98960865,0.003920051,0.00068428414,0.00059408165,0.0000057622597,0.0005681228,0.0002095196],"genre_scores_gemma":[0.017792009,0.000037007205,0.9782821,0.0022208765,0.00094710273,0.000023660148,0.000005823214,0.00003843739,0.0006530032],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99653023,0.00001750659,0.0004984414,0.0015628672,0.0006890012,0.0007019479],"domain_scores_gemma":[0.9975915,0.0003538705,0.00025998199,0.0013008029,0.0003652824,0.000128562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009445506,0.00049976894,0.0004829071,0.0006403259,0.00030157014,0.0008265326,0.00309043,0.00028119484,0.00000926227],"category_scores_gemma":[0.00031886238,0.00040953947,0.00012772527,0.00049155473,0.00053242943,0.0009823289,0.0011171985,0.0006404774,0.000010673774],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074513864,0.000019400755,0.000013444477,0.000065166925,0.0000065524114,0.000018338296,0.0009908519,0.0012295522,0.0007149523,0.024587039,0.00013611469,0.9722111],"study_design_scores_gemma":[0.00029898155,0.00023056533,0.000019535319,0.00073094317,0.00001960733,0.00008567386,1.6811758e-7,0.22842011,0.036015503,0.7271428,0.005982251,0.0010538778],"about_ca_topic_score_codex":0.000025918876,"about_ca_topic_score_gemma":0.00020759633,"teacher_disagreement_score":0.97115725,"about_ca_system_score_codex":0.00026311498,"about_ca_system_score_gemma":0.00047193476,"threshold_uncertainty_score":0.99983567},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017701533,0.00015531742,0.99757916,0.00064676086,0.00046702434,0.00021407123,0.000008831016,0.00007107269,0.0006807513],"genre_scores_gemma":[0.047608197,0.00015582344,0.9511716,0.0008265052,0.00006566203,0.0000045012657,0.000011942465,0.00001723827,0.0001385823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719924,0.00003881305,0.00050147646,0.001102275,0.0007390654,0.00041910924],"domain_scores_gemma":[0.9978235,0.00034018952,0.00030457127,0.0010806095,0.00027422333,0.00017694144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010017679,0.00032415305,0.0006603852,0.0017690966,0.00016832641,0.0005192497,0.0019021922,0.00023674648,0.000046634836],"category_scores_gemma":[0.000078663994,0.0002881458,0.00014083553,0.0015195194,0.0008744963,0.0004509516,0.0011699969,0.0006659786,0.000003972703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062047307,0.00004005701,0.00027583705,0.000051116276,0.00017993724,0.00004205393,0.0013139489,0.057171203,0.0012515086,0.020415494,0.0000041296503,0.9192485],"study_design_scores_gemma":[0.0001799433,0.0000550472,0.00014221454,0.00006465296,0.00004600452,0.000009346565,7.54126e-8,0.9720691,0.0008646017,0.025624836,0.0006189483,0.00032523673],"about_ca_topic_score_codex":0.00003388395,"about_ca_topic_score_gemma":0.00007908395,"teacher_disagreement_score":0.91892326,"about_ca_system_score_codex":0.0000475874,"about_ca_system_score_gemma":0.00021305647,"threshold_uncertainty_score":0.9999571},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026719648,0.00020048214,0.98756677,0.0010196411,0.0014595381,0.00050343067,0.0000058106903,0.0004048256,0.008812806],"genre_scores_gemma":[0.024251724,0.00008691248,0.9700771,0.0022875925,0.000925159,0.00003234905,0.0000051839334,0.0001049373,0.0022290237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99380136,0.00004150748,0.0006015168,0.0023697186,0.0018631626,0.0013227093],"domain_scores_gemma":[0.99613637,0.00062476966,0.0002716597,0.0024157409,0.0002368773,0.00031458552],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009081809,0.0007582913,0.0006774448,0.0012814285,0.00034920513,0.00075210875,0.0055154664,0.00035857983,0.000039194863],"category_scores_gemma":[0.0001487724,0.0007105035,0.00015323063,0.00082748407,0.0006613423,0.00080128905,0.0033391241,0.0015260669,0.00019326025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009272439,0.000023578674,0.0000019249812,0.000037384605,0.000007049735,0.00012647473,0.0002170478,0.2603814,0.00013909653,0.005785213,0.000013825932,0.7332577],"study_design_scores_gemma":[0.00037057739,0.00022860813,0.000019110239,0.0004953673,0.0000022306567,0.00009445687,6.62334e-8,0.9231737,0.0009868353,0.07241725,0.001456342,0.000755421],"about_ca_topic_score_codex":0.000008092715,"about_ca_topic_score_gemma":0.000035573506,"teacher_disagreement_score":0.73250234,"about_ca_system_score_codex":0.00085062295,"about_ca_system_score_gemma":0.0004146173,"threshold_uncertainty_score":0.9998652},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036019428,0.0003478287,0.99419063,0.0004409193,0.0011916019,0.00064803154,0.000020995501,0.0006373258,0.0025190373],"genre_scores_gemma":[0.0023314373,0.000034752768,0.9951713,0.0007650892,0.0004630799,0.000020242775,0.00008558606,0.000046710895,0.0010817744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965929,0.000032499625,0.00058009237,0.0015469015,0.0006642676,0.00058333593],"domain_scores_gemma":[0.997319,0.00038634063,0.0003820313,0.0014106053,0.00038569546,0.000116336065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083604845,0.0005383348,0.0005084238,0.0008968185,0.00036427545,0.0007252431,0.0033119041,0.0003323956,0.000013958165],"category_scores_gemma":[0.000099459794,0.0005176706,0.00014334681,0.0005608752,0.00032088062,0.00068892067,0.0009693698,0.00043894554,0.000008469283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030208216,0.000018829913,0.0000066066705,0.000026829754,0.000004154009,0.000008880517,0.000044825803,0.843696,0.0000066783296,0.004758413,0.0005345213,0.15089124],"study_design_scores_gemma":[0.0002336672,0.00011179543,0.0000068206477,0.00016308628,0.000006675051,0.000019888956,1.242456e-8,0.96404827,0.00025032373,0.032762073,0.0018286374,0.00056876324],"about_ca_topic_score_codex":0.000023236445,"about_ca_topic_score_gemma":0.000016434027,"teacher_disagreement_score":0.15032248,"about_ca_system_score_codex":0.00022745253,"about_ca_system_score_gemma":0.00037009188,"threshold_uncertainty_score":0.9997275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017394705,0.0005576966,0.9754933,0.0003530857,0.0008724424,0.00084753375,0.0000020859816,0.0025849272,0.019271497],"genre_scores_gemma":[0.0074472465,0.00037293936,0.98974603,0.000686529,0.0002384517,0.000039627685,0.000010373065,0.000044815803,0.0014140113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953949,0.00005089488,0.00063202274,0.0019026134,0.0011529083,0.00086670154],"domain_scores_gemma":[0.99726653,0.00017539205,0.00033411483,0.0017116654,0.0002971566,0.00021514506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062917406,0.0006724756,0.00058474956,0.0011295202,0.00042214658,0.00057791604,0.004282808,0.00036371654,0.00001452932],"category_scores_gemma":[0.000034018216,0.0006436879,0.0001796042,0.0010601616,0.0006497685,0.00044949463,0.002077932,0.0008256785,0.000054180866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004554524,0.0000742345,0.00001045669,0.000032853473,0.000022351716,0.00028222048,0.0004160914,0.13435568,0.0000034484851,0.0048423368,0.0006280052,0.8593278],"study_design_scores_gemma":[0.00028346284,0.00023526615,0.000083963576,0.00031585936,0.0000095219275,0.00016569092,7.172333e-8,0.97369146,0.0004527027,0.008674387,0.015181101,0.00090651604],"about_ca_topic_score_codex":0.000012860233,"about_ca_topic_score_gemma":0.0000064965016,"teacher_disagreement_score":0.85842127,"about_ca_system_score_codex":0.00033051838,"about_ca_system_score_gemma":0.00031201128,"threshold_uncertainty_score":0.9996014},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014983388,0.0011221652,0.99482876,0.0007741356,0.0010276051,0.00030179686,0.000018180037,0.00017009048,0.0016074382],"genre_scores_gemma":[0.043738484,0.00020108456,0.95373654,0.0011338717,0.0008460394,0.000007906731,0.000036720903,0.000030056457,0.00026930164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964585,0.00003931062,0.00048383872,0.0016233881,0.0008805312,0.000514452],"domain_scores_gemma":[0.99751693,0.00018661984,0.0002831986,0.0016197079,0.00016569943,0.00022786857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005281497,0.00048594028,0.00048095622,0.00044985002,0.00042626346,0.0006105141,0.0026145477,0.00028664857,0.000033141554],"category_scores_gemma":[0.000026187448,0.00042474386,0.00007327813,0.00027144016,0.000914881,0.0010009985,0.0023755233,0.00067764695,0.00003918006],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066182565,0.000031585627,0.000026127163,0.000019502273,0.0000054998995,0.000031241023,0.00024868874,0.0021489891,0.00044912234,0.03891011,0.000070058406,0.95805246],"study_design_scores_gemma":[0.00038033345,0.00012360449,0.0010848733,0.00028019084,0.00000685343,0.00012476652,8.0827974e-8,0.83598655,0.0016200629,0.14823909,0.011418317,0.00073526514],"about_ca_topic_score_codex":0.000027608285,"about_ca_topic_score_gemma":0.000019820725,"teacher_disagreement_score":0.9573172,"about_ca_system_score_codex":0.00017022739,"about_ca_system_score_gemma":0.0002271598,"threshold_uncertainty_score":0.9998204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048801177,0.0004090829,0.9941594,0.000017400891,0.00008200184,0.00025792205,4.4334988e-7,0.00014499284,0.00004861855],"genre_scores_gemma":[0.82639176,0.00008919689,0.17344409,0.0000073047736,0.00004758179,0.0000031002862,9.511147e-7,0.000014885281,0.0000011518646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999297,0.0000026393298,0.0001593554,0.00024430887,0.00015704239,0.00013960768],"domain_scores_gemma":[0.99965996,0.00005193851,0.000040520707,0.00016599886,0.000058143887,0.00002344605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009773505,0.00016181875,0.00017220245,0.00015969141,0.000047931015,0.000034632594,0.000092392525,0.00019211111,4.1439077e-7],"category_scores_gemma":[0.000020147094,0.00013961784,0.000008771834,0.00014283259,0.00024999471,0.00017750172,0.000066277324,0.00032985304,7.774326e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046021178,9.0283714e-7,0.0000052364235,0.000029069428,0.0000019516615,0.0000011639659,0.000053542313,0.8568668,0.000026840795,0.0008508775,1.5820367e-8,0.14215903],"study_design_scores_gemma":[0.000090456444,0.00008962641,0.0000112018515,0.00035637093,0.000004287183,0.0000042614415,1.7125134e-7,0.95200825,0.000053060197,0.04723865,0.000001745931,0.00014191229],"about_ca_topic_score_codex":0.000003057055,"about_ca_topic_score_gemma":0.000019837322,"teacher_disagreement_score":0.8215116,"about_ca_system_score_codex":0.00009018222,"about_ca_system_score_gemma":0.000018741537,"threshold_uncertainty_score":0.56934506},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023262935,0.00007178088,0.9943635,0.0010173226,0.0016214619,0.0014838242,0.000048392732,0.00061038206,0.0007600984],"genre_scores_gemma":[0.120569825,0.0000109372195,0.8773703,0.0011280068,0.00042516628,0.0001458397,0.00008428133,0.000049184986,0.00021647263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995942,0.00006622064,0.0006241635,0.0019085737,0.00095253764,0.0005064818],"domain_scores_gemma":[0.99605477,0.0007560693,0.00049493887,0.0018482317,0.0006667122,0.00017929505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011583911,0.00054327206,0.0005288213,0.0009513597,0.00037409368,0.0005809167,0.0023858326,0.0008348431,0.0000136187955],"category_scores_gemma":[0.00030031876,0.00049678347,0.00021593015,0.0005611807,0.00040480975,0.00053527986,0.00031046668,0.0012730713,0.000019205014],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045276174,0.00014516995,0.000019332148,0.00019804332,0.000011634418,0.000033210075,0.00023872935,0.004754583,0.009999651,0.006055773,0.00005927362,0.97843933],"study_design_scores_gemma":[0.00054377946,0.00024147469,0.000110898516,0.00059030065,0.000012672577,0.000014729543,2.0246698e-7,0.9032984,0.0810926,0.012281904,0.0012489151,0.00056412444],"about_ca_topic_score_codex":0.000008680763,"about_ca_topic_score_gemma":0.00004740826,"teacher_disagreement_score":0.9778752,"about_ca_system_score_codex":0.0003806286,"about_ca_system_score_gemma":0.00047208185,"threshold_uncertainty_score":0.9997484},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012086827,0.00012332735,0.99520105,0.0020152894,0.00053503,0.00030464062,0.0000018332111,0.00021954143,0.00039062172],"genre_scores_gemma":[0.28525448,0.000003983316,0.7125994,0.0009558095,0.00059302524,0.000009676794,0.000007685782,0.00004352736,0.0005324079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660426,0.00006954598,0.00042261824,0.0015376137,0.00069735415,0.0006685814],"domain_scores_gemma":[0.99746704,0.0011403908,0.00032407872,0.00060444156,0.0002570945,0.00020692797],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0021199903,0.00050563214,0.000538378,0.00082508544,0.0008848399,0.00089235674,0.0016975882,0.0003967158,0.000005350837],"category_scores_gemma":[0.0006721506,0.00045420893,0.00013903294,0.00037839898,0.0005658339,0.00043706028,0.00049955054,0.0033649332,0.00000543447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083056575,0.000037687692,0.00020316812,0.000112279704,0.000011995704,0.000022547767,0.0008506834,0.067210466,0.00019609286,0.0029677805,0.0000028838376,0.92837614],"study_design_scores_gemma":[0.0003119407,0.0002785115,0.000035749195,0.00035476807,0.000016324459,0.000019857138,4.6896022e-7,0.953715,0.00021480997,0.042186268,0.002309867,0.00055641873],"about_ca_topic_score_codex":0.00001114535,"about_ca_topic_score_gemma":0.000033754146,"teacher_disagreement_score":0.92781967,"about_ca_system_score_codex":0.00007653126,"about_ca_system_score_gemma":0.0005839987,"threshold_uncertainty_score":0.99979097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016304939,0.0002072903,0.99678904,0.00016804461,0.0008353461,0.0005456117,0.0000013103524,0.00010985791,0.0013271716],"genre_scores_gemma":[0.1216878,0.000039763374,0.8770858,0.0008356026,0.00025176347,0.000015083689,0.000008235788,0.000023675299,0.00005229104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744815,0.00005098276,0.00040343957,0.0009909513,0.00063968886,0.00046680056],"domain_scores_gemma":[0.9983973,0.00048677265,0.0002571274,0.000494621,0.00024439866,0.00011978224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008123627,0.00036816412,0.00032233718,0.0009914101,0.00016869571,0.00034112605,0.00080842926,0.00026058452,0.000021051132],"category_scores_gemma":[0.000038588652,0.00033137287,0.00003429764,0.0010711672,0.00036719916,0.00065071817,0.00022642715,0.0006328693,0.0000063060056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000129568525,0.000009823153,0.00011327528,0.0000037064633,0.000003237428,0.00011400162,0.0009132593,0.75629526,0.0000044730677,0.001738567,0.0000075747716,0.24078384],"study_design_scores_gemma":[0.00040497596,0.00016225963,0.0006234909,0.0004073657,0.0000029403295,0.00004217712,0.0000013025991,0.9937909,0.0001678913,0.0038319745,0.00013428064,0.00043038736],"about_ca_topic_score_codex":0.000010066624,"about_ca_topic_score_gemma":0.00014871241,"teacher_disagreement_score":0.24035345,"about_ca_system_score_codex":0.0003912622,"about_ca_system_score_gemma":0.00048820808,"threshold_uncertainty_score":0.9999138},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016580537,0.000890891,0.9929215,0.000090207344,0.00026778178,0.0002713846,0.000013244119,0.0005801358,0.0047990833],"genre_scores_gemma":[0.08010051,0.00019541482,0.91840833,0.0005131062,0.00028049632,0.0000066756897,0.000036000638,0.0001163933,0.00034304822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977292,0.000010792636,0.00048413366,0.0007036675,0.00055841316,0.0005137874],"domain_scores_gemma":[0.9987819,0.00021293698,0.00013524569,0.00061167823,0.000096025615,0.00016221253],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043503847,0.00046650093,0.0005321599,0.00040586453,0.00008536589,0.0001318474,0.0008128895,0.00029684362,0.0000480939],"category_scores_gemma":[0.000061890685,0.00044771115,0.00011443399,0.00049615465,0.00044029264,0.00035430843,0.00018705332,0.0006500798,0.000041141437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005703376,0.000021252961,0.000011581954,0.00008322547,0.000019839084,0.00002355887,0.00013768798,0.19558975,0.03457444,0.00038522738,0.000547279,0.76860046],"study_design_scores_gemma":[0.000192439,0.00008268801,0.000012392664,0.00026854646,0.000030330673,0.000013239485,1.6107332e-7,0.7933577,0.122996755,0.07082421,0.01093298,0.0012885615],"about_ca_topic_score_codex":0.000014470191,"about_ca_topic_score_gemma":0.000013349928,"teacher_disagreement_score":0.7673119,"about_ca_system_score_codex":0.00042726027,"about_ca_system_score_gemma":0.000051721385,"threshold_uncertainty_score":0.99979746},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013010586,0.00012396745,0.9966207,0.0005162352,0.00027462078,0.00039845568,0.000005697706,0.000063249034,0.00069600716],"genre_scores_gemma":[0.76095974,0.00009568457,0.23751496,0.0011759793,0.00013746346,0.000015469643,0.000051934578,0.000011247977,0.00003750261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803954,0.000039666236,0.0005509496,0.00054017,0.0005505205,0.0002791708],"domain_scores_gemma":[0.9984594,0.00011966973,0.00029462558,0.00086118147,0.00016584762,0.00009925903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007153134,0.00026005463,0.00025853966,0.0007177607,0.00016608505,0.00046485316,0.0013715889,0.0002176126,0.0000043164605],"category_scores_gemma":[0.000032533942,0.0002515524,0.000033271306,0.00027566435,0.00014852689,0.0025688817,0.0006005763,0.000338324,0.000013051056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029302428,0.000025465657,0.00035068105,0.000023036131,0.0000021675323,0.0000013829836,0.0026859913,0.53199404,0.00009747737,0.027227495,0.00001036891,0.43757895],"study_design_scores_gemma":[0.00022325754,0.000040472103,0.0026083302,0.00009999157,0.0000016625041,0.000009504796,2.4104452e-7,0.9810904,0.000051737672,0.015313985,0.0002936617,0.00026672787],"about_ca_topic_score_codex":0.00004424348,"about_ca_topic_score_gemma":0.0003376277,"teacher_disagreement_score":0.7596587,"about_ca_system_score_codex":0.0002878353,"about_ca_system_score_gemma":0.00022595657,"threshold_uncertainty_score":0.9999937},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040076808,0.0002348655,0.9928406,0.0009576461,0.0034873884,0.0009275032,0.000019996178,0.0006730017,0.00081894035],"genre_scores_gemma":[0.40875688,0.000006519785,0.57875776,0.011217745,0.0006954953,0.0000590755,0.00004113237,0.000117422955,0.00034797535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930836,0.00016655723,0.0010706389,0.0025597727,0.0017382476,0.001381168],"domain_scores_gemma":[0.99515194,0.0007905095,0.00068428763,0.0025506206,0.00043690653,0.00038576368],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014693225,0.001019781,0.0010357568,0.0009440154,0.00047170994,0.0025319722,0.0047098226,0.00054562505,0.000008092595],"category_scores_gemma":[0.00010565481,0.0009445048,0.00033943285,0.00096246676,0.00052124605,0.00071588566,0.0008482372,0.0010796867,0.00007537444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019859866,0.00015033744,0.0006305825,0.00073420873,0.00007089982,0.0011009087,0.00071853324,0.43002456,0.000037873982,0.024497602,0.0009849748,0.54102963],"study_design_scores_gemma":[0.00072236604,0.000270246,0.000081800936,0.0021318526,0.000020100202,0.00024046261,2.9508564e-7,0.938541,0.00013716792,0.0019304141,0.05437522,0.0015490493],"about_ca_topic_score_codex":0.00016587494,"about_ca_topic_score_gemma":0.00007059718,"teacher_disagreement_score":0.5394806,"about_ca_system_score_codex":0.0006091716,"about_ca_system_score_gemma":0.0006558638,"threshold_uncertainty_score":0.99930054},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034127902,0.0006219411,0.99165,0.00041565494,0.00042803417,0.00034518025,0.000003941469,0.000097682736,0.0060963095],"genre_scores_gemma":[0.63513124,0.000100435136,0.363925,0.0005663972,0.00014678363,0.000007669094,0.0000026317932,0.000018768978,0.00010105565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969929,0.000048697162,0.0004902885,0.0012034145,0.00081633474,0.00044838083],"domain_scores_gemma":[0.99805206,0.00034288559,0.000285009,0.0008100351,0.0003557282,0.00015427147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006209415,0.00044999758,0.0005830076,0.000658686,0.00013258161,0.00024430754,0.0015842976,0.00032037956,0.0000025068796],"category_scores_gemma":[0.00006498985,0.00040909433,0.000098345656,0.00043599957,0.0005558728,0.0006645577,0.00054212107,0.0005950614,0.0000050018007],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055460687,0.000015442874,0.000003916247,0.000023346834,0.000007125784,0.000012724227,0.0010172988,0.03374237,0.0002098792,0.08068005,0.0000034880338,0.88427883],"study_design_scores_gemma":[0.00013651335,0.0002483795,0.0001344176,0.00023365451,0.000007017037,0.00002114265,1.0287202e-7,0.55007416,0.0012648773,0.44758925,0.000018097351,0.00027240007],"about_ca_topic_score_codex":0.000056150577,"about_ca_topic_score_gemma":0.00003931733,"teacher_disagreement_score":0.88400644,"about_ca_system_score_codex":0.00014302626,"about_ca_system_score_gemma":0.00040592,"threshold_uncertainty_score":0.9998361},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000043740597,0.0003980859,0.99653244,0.0006973667,0.00035742545,0.0005173636,0.000006857816,0.00013140033,0.0013547083],"genre_scores_gemma":[0.015357377,0.000015387688,0.9823258,0.0016139696,0.00040630318,0.00003302563,0.000013267309,0.000029543597,0.00020531319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730134,0.00004293885,0.0003545371,0.0013385575,0.0004893525,0.00047324604],"domain_scores_gemma":[0.9983037,0.0005992136,0.0002351551,0.0005307643,0.00018967422,0.00014146425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009955012,0.00042532192,0.00038668103,0.00058443786,0.00028584193,0.0004905367,0.0010920651,0.00041808584,0.000004494275],"category_scores_gemma":[0.00011703664,0.00039447495,0.00010930787,0.00043414521,0.00028847138,0.0004743378,0.00026658666,0.00052467163,0.0000021600404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007323423,0.000018636083,0.000002843289,0.00006341081,0.0000054729553,0.0000021399708,0.00016495767,0.11355847,0.000064975844,0.0364741,0.000035571375,0.8496021],"study_design_scores_gemma":[0.00026497382,0.0001287568,0.000011025413,0.000091574664,0.000011566222,0.000024664501,1.6982284e-8,0.86484724,0.0008610278,0.13239782,0.0009776138,0.00038371593],"about_ca_topic_score_codex":0.000004377189,"about_ca_topic_score_gemma":0.000010885731,"teacher_disagreement_score":0.84921837,"about_ca_system_score_codex":0.00012407317,"about_ca_system_score_gemma":0.00032953464,"threshold_uncertainty_score":0.9998507},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024472954,0.0011086279,0.9949692,0.0007960085,0.0011461783,0.00080515916,0.0000050263916,0.00055277976,0.0005925789],"genre_scores_gemma":[0.012601712,0.00001665796,0.98568785,0.0010561969,0.00028009323,0.00004493251,0.0000084608155,0.00003118961,0.00027288546],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973346,0.000020850403,0.00044748638,0.001068998,0.0006712387,0.00045680616],"domain_scores_gemma":[0.997663,0.0006337287,0.00035073835,0.000978294,0.00027678118,0.000097413424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009965195,0.00041003898,0.00048554363,0.00067957136,0.00023422275,0.0006660128,0.0029201456,0.00038200646,0.000031626765],"category_scores_gemma":[0.0002281056,0.0003395895,0.00014124012,0.0003427366,0.00072093157,0.0006721081,0.00071029004,0.00069994904,0.000022334247],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006131058,0.00001090708,0.0000021374121,0.000095875905,0.000005625656,0.000011699637,0.00042484244,0.000095306976,0.0014005294,0.06984574,0.00002090095,0.9280803],"study_design_scores_gemma":[0.000438105,0.000058434733,0.0000022914057,0.00025127007,0.000007812525,0.000030135563,5.021664e-8,0.31555206,0.023341807,0.659571,0.00036059867,0.00038646153],"about_ca_topic_score_codex":0.00001482867,"about_ca_topic_score_gemma":0.000053026357,"teacher_disagreement_score":0.92769384,"about_ca_system_score_codex":0.00019189344,"about_ca_system_score_gemma":0.0003950901,"threshold_uncertainty_score":0.9999056},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005086513,0.0012290005,0.9960676,0.00028333726,0.0010384269,0.0005170438,0.00008912798,0.000068621135,0.0001982273],"genre_scores_gemma":[0.1592192,0.00028169935,0.8390276,0.00064324745,0.00058141036,0.000011255348,0.00010132316,0.00004464017,0.00008965514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961821,0.000025650956,0.0004610592,0.0020342886,0.00070327497,0.0005936542],"domain_scores_gemma":[0.9968858,0.0005527943,0.00019139217,0.0021223368,0.00009317344,0.00015454192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061440136,0.00046917945,0.0005233526,0.00070011884,0.000262683,0.00038070386,0.004536664,0.0002598371,0.000005716219],"category_scores_gemma":[0.00008696909,0.0003887147,0.000055856573,0.00034554082,0.00054214784,0.00058645976,0.0033913087,0.0005083889,0.0000026754549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020090243,0.000037533282,0.00009594682,0.000042239088,0.000008217927,0.00011443549,0.00088138244,0.034113772,0.000052594904,0.006192732,0.00022227372,0.95821875],"study_design_scores_gemma":[0.0005858397,0.00013714985,0.0016432923,0.00019673716,0.000004911179,0.0001092287,2.303382e-7,0.97384655,0.00015589637,0.018992426,0.00380938,0.0005183554],"about_ca_topic_score_codex":0.00007585324,"about_ca_topic_score_gemma":0.0002332784,"teacher_disagreement_score":0.95770043,"about_ca_system_score_codex":0.000121681325,"about_ca_system_score_gemma":0.00038778945,"threshold_uncertainty_score":0.9998565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018335179,0.00201261,0.99584436,0.00041940753,0.00049977895,0.00026894585,0.0000090416015,0.0000801649,0.0006823547],"genre_scores_gemma":[0.32713777,0.0001986467,0.67192227,0.00058667193,0.00008439454,0.000006006991,0.000012954673,0.000018961257,0.000032324268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971111,0.000051413837,0.00056741666,0.0011072087,0.00064076623,0.00052211195],"domain_scores_gemma":[0.9974596,0.00063656433,0.00035925786,0.0011216574,0.00024047156,0.0001824467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007186195,0.0004340673,0.00069788436,0.0019568717,0.00018002065,0.00025805508,0.0020099876,0.0002585375,0.000019968706],"category_scores_gemma":[0.000009123503,0.00038629674,0.00017000792,0.0018803101,0.00031001962,0.000570781,0.0006501116,0.00048372266,0.0000056092026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048501806,0.000018065775,0.00003705398,0.0000391203,0.00012356827,0.000007033584,0.0033135733,0.53337127,0.00008008589,0.006326169,3.8772077e-7,0.45667884],"study_design_scores_gemma":[0.00009068157,0.000059203332,0.000117837786,0.00015717931,0.00015463858,0.0000133335125,4.6087592e-7,0.9369047,0.00037308145,0.06164694,0.0001034387,0.00037846158],"about_ca_topic_score_codex":0.000056770517,"about_ca_topic_score_gemma":0.00018709214,"teacher_disagreement_score":0.45630038,"about_ca_system_score_codex":0.00008929935,"about_ca_system_score_gemma":0.00021707175,"threshold_uncertainty_score":0.9998589},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050072494,0.00042654906,0.99365973,0.00014746402,0.003508519,0.0015244675,0.000010945455,0.00006674146,0.00015484256],"genre_scores_gemma":[0.71341807,0.000031740234,0.28533134,0.000252963,0.00031678707,0.000068926354,0.000024188334,0.00003637098,0.0005196056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966484,0.00007726458,0.00087087334,0.0010907965,0.00090321456,0.00040950812],"domain_scores_gemma":[0.9972863,0.00030522875,0.0008496454,0.00092687766,0.0005276794,0.00010422245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014921997,0.00038844466,0.00052253745,0.0006420721,0.00017514238,0.0002913135,0.0012992927,0.0003017995,0.000004664493],"category_scores_gemma":[0.00011055463,0.00035139252,0.00016997482,0.00035429152,0.0001358791,0.00052953814,0.0002271671,0.00022591774,0.000016242742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022097662,0.0002853997,0.0005924496,0.0009185516,0.000078589845,0.000017693163,0.004577645,0.68689775,0.0047333553,0.10343254,0.00010775574,0.19833615],"study_design_scores_gemma":[0.0006582988,0.00027825974,0.00035947878,0.0005329835,0.000017099488,0.00001538685,4.996858e-7,0.97800195,0.0066568777,0.012420227,0.0005258962,0.0005330329],"about_ca_topic_score_codex":0.000051897397,"about_ca_topic_score_gemma":0.000016941076,"teacher_disagreement_score":0.7129173,"about_ca_system_score_codex":0.00034525982,"about_ca_system_score_gemma":0.00021820386,"threshold_uncertainty_score":0.9998938},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016150609,0.000035802823,0.9799622,0.0026697086,0.00043301043,0.0004372657,0.0000018767895,0.0003052215,0.0000042507804],"genre_scores_gemma":[0.4297486,9.53835e-7,0.5661032,0.0040726596,0.000061165236,0.0000028228344,0.0000056809536,0.0000041882618,7.0261717e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696934,0.00015906326,0.00048145128,0.0009450714,0.00094934035,0.00049575546],"domain_scores_gemma":[0.9983356,0.00027238496,0.00025920215,0.0007148105,0.0002454047,0.00017261574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007910613,0.00026235334,0.00022640913,0.00049980095,0.00027944928,0.00064297987,0.0015105512,0.00013150448,0.000019279358],"category_scores_gemma":[0.00029141761,0.00023849447,0.000050932165,0.0023274603,0.00035946962,0.0015037678,0.0001246663,0.000330513,0.000003715467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008287059,0.000104404186,0.0005803522,0.000016427537,0.0000026717526,0.000044631255,0.00090902305,0.09687538,0.32418808,0.0003484088,0.000041615705,0.5768807],"study_design_scores_gemma":[0.00035461536,0.00011137882,0.0013561276,0.000059391452,0.0000018522419,0.00002166733,7.1111316e-7,0.6764158,0.317166,0.0043178857,0.000002136752,0.00019242379],"about_ca_topic_score_codex":0.00006330191,"about_ca_topic_score_gemma":0.000049217346,"teacher_disagreement_score":0.57954043,"about_ca_system_score_codex":0.0003015396,"about_ca_system_score_gemma":0.00044084364,"threshold_uncertainty_score":0.9725522},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007805702,0.0010516782,0.9948257,0.00018664676,0.001046674,0.0006161494,0.000027076849,0.000023020097,0.0014424662],"genre_scores_gemma":[0.34882882,0.0010688371,0.61465496,0.0132139865,0.009441644,0.0002868879,0.00039088432,0.00022293253,0.0118910745],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821043,0.000019191424,0.00033472507,0.00057326537,0.0004758446,0.0003865262],"domain_scores_gemma":[0.9982255,0.0003227561,0.00035895372,0.00029008838,0.000706409,0.00009628173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001169876,0.00029176264,0.00028825618,0.00020154072,0.0002606301,0.00007934941,0.00035589808,0.00023484798,0.000008963622],"category_scores_gemma":[0.00080295175,0.00027567174,0.00012108409,0.00011681001,0.0001366718,0.000019207342,0.00023164312,0.00021495651,0.000013406146],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094222376,0.00016550286,0.000750022,0.00068513723,0.000907692,0.000017287059,0.0013049537,0.022680378,0.14549173,0.0039934684,0.0010056106,0.822056],"study_design_scores_gemma":[0.0042348825,0.0036125553,0.00085900736,0.002520662,0.00040458882,0.00002846342,0.000013508206,0.036940683,0.694907,0.17424127,0.07739572,0.004841635],"about_ca_topic_score_codex":0.0000039910005,"about_ca_topic_score_gemma":0.000045806348,"teacher_disagreement_score":0.81721437,"about_ca_system_score_codex":0.00022134253,"about_ca_system_score_gemma":0.0003557106,"threshold_uncertainty_score":0.99996954},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014646476,0.00021207912,0.9810427,0.001051912,0.0008796136,0.0003464483,0.000018391307,0.000029380917,0.0017730043],"genre_scores_gemma":[0.9888422,0.00006917735,0.009376698,0.0015098419,0.00010667326,0.000004277483,0.000002939561,0.000013911798,0.00007431587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969038,0.00010355231,0.0006262583,0.00085500407,0.0010855658,0.00042582778],"domain_scores_gemma":[0.9954009,0.001605966,0.0005867683,0.0021115215,0.00021375621,0.000081078106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006932656,0.00040530637,0.00066646526,0.0009406175,0.00025525584,0.00017173086,0.0041285264,0.00019651845,0.00004738431],"category_scores_gemma":[0.00007615782,0.00023404691,0.0005467588,0.002469935,0.0010942166,0.00013683632,0.0011030303,0.00074744684,0.000004576942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006947592,0.00041812158,0.016428156,0.00016325446,0.0010452362,0.00010221127,0.0041646766,0.39988083,0.0008005203,0.06562211,0.00007841025,0.511227],"study_design_scores_gemma":[0.00044685372,0.0002931601,0.08312042,0.0009137026,0.0003777067,0.000020823458,5.236786e-7,0.8855738,0.0026707787,0.025204217,0.0006488151,0.0007291981],"about_ca_topic_score_codex":0.00008233737,"about_ca_topic_score_gemma":0.0002526361,"teacher_disagreement_score":0.97419566,"about_ca_system_score_codex":0.00007007866,"about_ca_system_score_gemma":0.00018084771,"threshold_uncertainty_score":0.95441556},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0348583,0.000026991169,0.9635704,0.00031793313,0.00064305577,0.00017908901,2.735799e-7,0.00028497668,0.00011893423],"genre_scores_gemma":[0.48539332,0.000014465664,0.5139868,0.00053542893,0.000058152826,0.0000062879412,6.511596e-7,0.0000026448809,0.0000022110776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807763,0.000057574813,0.00031316682,0.0005757824,0.00061615097,0.000359694],"domain_scores_gemma":[0.998863,0.00016253778,0.00013083451,0.000581878,0.0001435856,0.00011816461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007072974,0.00013943904,0.00014460385,0.0002940892,0.00031513043,0.00021818496,0.0010872711,0.00006546249,0.000011867112],"category_scores_gemma":[0.00028021587,0.00012320082,0.0000315272,0.0015161359,0.0006232846,0.001988928,0.00015987015,0.00022805629,0.000016850605],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033896322,0.00004264702,0.009405238,0.0000091504235,0.000002114161,0.000025413621,0.0012575681,0.004100302,0.019779218,0.00025879082,0.000048780843,0.9650674],"study_design_scores_gemma":[0.0003124192,0.00013505945,0.006589066,0.000056461813,0.0000013499582,0.0016192462,9.844363e-7,0.5731285,0.40421265,0.013630107,0.000022323833,0.00029183415],"about_ca_topic_score_codex":0.000062030915,"about_ca_topic_score_gemma":0.000024596424,"teacher_disagreement_score":0.96477556,"about_ca_system_score_codex":0.0001584679,"about_ca_system_score_gemma":0.0002864302,"threshold_uncertainty_score":0.5023984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009303889,0.0025986077,0.9934829,0.00055773195,0.0014452566,0.0005865031,0.000014520951,0.0003104407,0.0009947579],"genre_scores_gemma":[0.0120098125,0.000053201016,0.9862648,0.00069531787,0.00054577086,0.000022020842,0.000008591676,0.000036003486,0.00036448587],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99624294,0.000025311141,0.0006554875,0.001378805,0.00096875866,0.0007286728],"domain_scores_gemma":[0.99712783,0.0004851217,0.00046592733,0.0012998106,0.00042493787,0.00019635663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096298254,0.0004901535,0.0006239766,0.0011199857,0.00015028012,0.00022776642,0.004741694,0.00050139386,0.00003935336],"category_scores_gemma":[0.00025162104,0.000402255,0.00018887463,0.0008627958,0.00090753945,0.00049130793,0.0014804553,0.0006697991,0.000014386168],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008117816,0.0000317132,0.0000067431442,0.00009360822,0.000009290943,0.000047559504,0.00046499225,0.000014898309,0.00019885949,0.039239716,0.000206381,0.9596781],"study_design_scores_gemma":[0.00040046294,0.0004804714,0.00000601211,0.0009704487,0.000020244788,0.00013255041,1.1441725e-7,0.049971435,0.025281684,0.89538413,0.026374085,0.0009783545],"about_ca_topic_score_codex":0.000023745482,"about_ca_topic_score_gemma":0.000008716386,"teacher_disagreement_score":0.95869976,"about_ca_system_score_codex":0.0001838703,"about_ca_system_score_gemma":0.0006291165,"threshold_uncertainty_score":0.99984294},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014625083,0.00007641808,0.99205834,0.0018334456,0.0005091526,0.00039835644,0.0000075421085,0.000050781095,0.0036034712],"genre_scores_gemma":[0.73251265,0.00004970334,0.25983164,0.0059113726,0.0003491368,0.000023571762,0.000013124656,0.00004289657,0.0012658881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734414,0.000049277936,0.00042897815,0.000902672,0.0009361573,0.00033876413],"domain_scores_gemma":[0.9976152,0.0007883929,0.00027129133,0.0010208823,0.0002161081,0.00008809297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066139584,0.00036692273,0.00037844724,0.00057751033,0.00017287863,0.00025718287,0.0020849134,0.00012045269,0.00012514718],"category_scores_gemma":[0.00007543563,0.00021134656,0.000097360746,0.000744462,0.0004906304,0.00030237937,0.00041303682,0.00045805975,0.00003631467],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002551924,0.000088181296,0.000013255566,0.00005284228,0.0000445062,0.00014657892,0.0015753041,0.06897536,0.00018175461,0.22315267,0.00016512185,0.70534927],"study_design_scores_gemma":[0.00084381003,0.0023810505,0.00021194176,0.0016991678,0.000020129944,0.00039468292,7.093459e-7,0.54083264,0.006782165,0.4430603,0.0027650322,0.0010083506],"about_ca_topic_score_codex":0.000008469059,"about_ca_topic_score_gemma":0.00006491463,"teacher_disagreement_score":0.73222667,"about_ca_system_score_codex":0.00011498073,"about_ca_system_score_gemma":0.0004945832,"threshold_uncertainty_score":0.86184627},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000909606,0.0031029328,0.9945992,0.00070653384,0.00053006393,0.00056306715,0.000001281471,0.00011975588,0.00028619324],"genre_scores_gemma":[0.50694174,0.0004106432,0.48947924,0.0024830238,0.00022838994,0.000021939308,0.000014016139,0.000033200387,0.00038781686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746686,0.00006586371,0.0004674099,0.0011524757,0.00034828903,0.0004991149],"domain_scores_gemma":[0.99718827,0.00087317446,0.00026657045,0.00086283655,0.00067241467,0.00013674943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009145405,0.00044321662,0.00044740055,0.00041443115,0.00088444224,0.0006314092,0.0014443921,0.00026272464,0.0000020143784],"category_scores_gemma":[0.0001064034,0.00042014275,0.000052592968,0.0006664341,0.0003741413,0.000603754,0.00095130526,0.00074446213,0.0000026359492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053086046,0.000012293779,0.000018091605,0.000008867775,0.00000800353,0.0000043274385,0.00070154585,0.36735585,0.00008703652,0.02571356,0.000012286913,0.60607284],"study_design_scores_gemma":[0.0004200672,0.000114306604,0.0003671985,0.0009003943,0.0000070077554,0.000023152246,7.8624396e-7,0.9917801,0.00015458779,0.005436513,0.00029167582,0.0005042211],"about_ca_topic_score_codex":0.000002215073,"about_ca_topic_score_gemma":0.000043502412,"teacher_disagreement_score":0.6244242,"about_ca_system_score_codex":0.0002354418,"about_ca_system_score_gemma":0.00031956763,"threshold_uncertainty_score":0.99982506},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041587892,0.00030082912,0.9761605,0.001612184,0.0017825286,0.00015942265,0.0000013123953,0.00018586959,0.019381464],"genre_scores_gemma":[0.8665581,0.00005244071,0.107607424,0.014816418,0.008252312,0.000012556053,0.000063296386,0.00016174595,0.002475747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738497,0.000002258401,0.0003902307,0.0009976309,0.0006929578,0.00053198],"domain_scores_gemma":[0.9984213,0.000079247344,0.0003164431,0.0006972974,0.00045878981,0.000026886422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005460283,0.0004573268,0.0005215953,0.0009890524,0.00038436902,0.0010330179,0.0013143254,0.00035052854,0.00027536188],"category_scores_gemma":[0.000078629455,0.0004039727,0.00013958987,0.00077657064,0.0005127148,0.0008241119,0.0006486033,0.0009406406,0.00032795282],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011890152,0.000043057345,0.00048514185,0.00019576526,0.000021589245,0.000059838814,0.000043820226,0.10927587,0.00022720508,0.007887443,0.00009079463,0.8816576],"study_design_scores_gemma":[0.00022288055,0.000006129601,0.000072003466,0.00049796747,0.000055409768,0.000007295223,1.0932921e-7,0.6900867,0.000093913906,0.2744873,0.03368482,0.0007854674],"about_ca_topic_score_codex":0.00018203312,"about_ca_topic_score_gemma":0.00038251362,"teacher_disagreement_score":0.88087213,"about_ca_system_score_codex":0.0000492867,"about_ca_system_score_gemma":0.0001311327,"threshold_uncertainty_score":0.9998412},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023812374,0.00021723565,0.9909473,0.00070349756,0.0019624815,0.00039136087,0.000007266897,0.0005127499,0.005234262],"genre_scores_gemma":[0.009563845,0.00005547516,0.98682845,0.002575576,0.000314521,0.0000091486045,0.0000044219773,0.000032920103,0.0006156644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956129,0.00006387122,0.0006380217,0.0016853379,0.0012365456,0.0007632958],"domain_scores_gemma":[0.9959973,0.00036023516,0.0007497011,0.0024045485,0.0002862069,0.00020201303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015226718,0.00058168836,0.00056054606,0.0010274701,0.0002715665,0.000665332,0.004620691,0.00039447538,0.000018737295],"category_scores_gemma":[0.00031927356,0.00055586215,0.00013032813,0.0008042065,0.0005425402,0.0011045918,0.0010668037,0.00095338695,0.00015752176],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003634273,0.000024034896,0.000013904579,0.000025869604,0.000004344036,0.00009776066,0.00027436166,0.01630113,0.000038602102,0.035474297,0.000036193876,0.94770586],"study_design_scores_gemma":[0.00020322706,0.00016976571,0.00064358255,0.00041852635,0.0000052636774,0.00006613036,7.333775e-8,0.7258241,0.001893304,0.26232457,0.007685842,0.0007656061],"about_ca_topic_score_codex":0.0000056216827,"about_ca_topic_score_gemma":0.000015361898,"teacher_disagreement_score":0.94694024,"about_ca_system_score_codex":0.0003732075,"about_ca_system_score_gemma":0.00034471284,"threshold_uncertainty_score":0.9996893},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028083895,0.00055558427,0.98874706,0.00038640844,0.002053959,0.00028325416,0.0000027955648,0.00014315467,0.0075469613],"genre_scores_gemma":[0.9039057,0.0001761203,0.09240396,0.0018584129,0.0010085283,0.000016468008,0.000010729478,0.000038292543,0.00058181264],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973065,0.00003832975,0.00046413724,0.0009666507,0.00061741535,0.0006069647],"domain_scores_gemma":[0.9983717,0.00034065288,0.00023038853,0.00077641563,0.00012247037,0.00015833045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078312296,0.00035791437,0.00037384251,0.0011600886,0.00023311563,0.00040958743,0.00147464,0.00029744764,0.00009362091],"category_scores_gemma":[0.00006539032,0.0003538597,0.000105396655,0.00066708366,0.00028503052,0.0013808915,0.0005709706,0.00094889506,0.00017350697],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027354547,0.000038855298,0.00010992892,0.000018335444,0.0000046299074,0.000035911777,0.0005027922,0.00049165706,0.00021160225,0.020572022,0.00002174486,0.9779898],"study_design_scores_gemma":[0.0021696065,0.0006281301,0.009148431,0.003569839,0.00004178769,0.0005914337,0.0000017080687,0.26666966,0.0063898917,0.6486727,0.05771433,0.00440249],"about_ca_topic_score_codex":0.000024846182,"about_ca_topic_score_gemma":0.00023483738,"teacher_disagreement_score":0.9735873,"about_ca_system_score_codex":0.00036965864,"about_ca_system_score_gemma":0.00018756265,"threshold_uncertainty_score":0.99989134},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027261887,0.0003786713,0.99342036,0.0016453989,0.002105714,0.0010577025,0.000019358127,0.0008424714,0.00025772915],"genre_scores_gemma":[0.09449032,0.00046274567,0.8654327,0.03723443,0.0018141568,0.000035839217,0.0001023456,0.00017283334,0.00025464396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99204105,0.00006229495,0.0014067395,0.003089279,0.002103019,0.0012975914],"domain_scores_gemma":[0.99433154,0.0004831212,0.0005737955,0.0028460156,0.0010537229,0.00071181107],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0013058606,0.0013388777,0.0012899144,0.004382941,0.001048984,0.0029601462,0.006955783,0.00085189316,0.000014503295],"category_scores_gemma":[0.00006163011,0.0013002341,0.000471635,0.0034071254,0.0014816576,0.001121854,0.0032387828,0.0016490226,0.000032315627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012004667,0.00014892656,0.000049039245,0.000060695074,0.000030529805,0.00011570908,0.0018737672,0.0010929282,0.000035571113,0.4809901,0.00033265815,0.5152581],"study_design_scores_gemma":[0.0003836195,0.00090483285,0.00023103155,0.0006756101,0.00001465561,0.00008926864,1.3941481e-7,0.6057826,0.00084694615,0.36909133,0.020601366,0.0013785859],"about_ca_topic_score_codex":0.00014228224,"about_ca_topic_score_gemma":0.0006037958,"teacher_disagreement_score":0.6046897,"about_ca_system_score_codex":0.00035361492,"about_ca_system_score_gemma":0.0010537663,"threshold_uncertainty_score":0.9999362},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042484455,0.0007422377,0.98788697,0.00029250872,0.0018840511,0.00033065045,0.00002043986,0.00026310727,0.008537554],"genre_scores_gemma":[0.05554153,0.000082461636,0.9384473,0.0017367637,0.0017835434,0.000014497224,0.00009648284,0.00008558967,0.0022118182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953048,0.00003660533,0.00061522995,0.0019143659,0.00132426,0.00080470677],"domain_scores_gemma":[0.9968889,0.00022975277,0.0003392555,0.0021348398,0.0001930092,0.00021425691],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000558972,0.00064555684,0.0006038772,0.0007925823,0.00041109585,0.0007615834,0.0050218673,0.000393534,0.00004100775],"category_scores_gemma":[0.000022108965,0.00054617214,0.0001560825,0.00043144092,0.00056538766,0.0010467672,0.0035911454,0.00093926146,0.0001181376],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009033764,0.00008117618,0.000036285805,0.000048611666,0.000010578578,0.00030841844,0.00022981632,0.06781049,0.0012750094,0.019871056,0.0005747174,0.9097448],"study_design_scores_gemma":[0.0004256976,0.00018386087,0.0005282371,0.00045256515,0.00000763328,0.00009438128,3.555637e-8,0.81740916,0.00079863827,0.14914075,0.029820018,0.0011390074],"about_ca_topic_score_codex":0.00006473767,"about_ca_topic_score_gemma":0.00002221385,"teacher_disagreement_score":0.9086058,"about_ca_system_score_codex":0.00027880998,"about_ca_system_score_gemma":0.00036611402,"threshold_uncertainty_score":0.999699},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061414116,0.00050359993,0.989915,0.00031665753,0.00029111866,0.0019871104,0.000005017869,0.000016544094,0.0008235496],"genre_scores_gemma":[0.877149,0.000009671738,0.12233564,0.00029747144,0.00011837695,0.000049919854,0.000004610323,0.000016517044,0.000018814459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778765,0.00004529536,0.0003476332,0.00036945517,0.0012731447,0.00017681486],"domain_scores_gemma":[0.9980415,0.00009792295,0.00019094805,0.0007700154,0.00079740357,0.00010218468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029577157,0.0001561791,0.0003844879,0.00024790672,0.000054214222,0.0000125135875,0.00030975728,0.00014518868,0.000030720294],"category_scores_gemma":[0.00039087405,0.00011306258,0.00017333165,0.00024308101,0.0003844488,0.000045257926,0.00015118162,0.00035815095,0.000005267912],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006798056,0.00006197231,0.00014827681,0.00058289897,0.00003964111,0.0000036975734,0.00028595905,0.013062166,0.02096633,0.00055938447,0.0000030414521,0.9642187],"study_design_scores_gemma":[0.0043110666,0.0011152301,0.083553076,0.018353816,0.0019668983,0.00036008304,9.3176806e-7,0.4491844,0.11560599,0.3236813,0.0007293077,0.0011379258],"about_ca_topic_score_codex":0.000022989303,"about_ca_topic_score_gemma":0.00003973339,"teacher_disagreement_score":0.9630807,"about_ca_system_score_codex":0.00012085643,"about_ca_system_score_gemma":0.0007965549,"threshold_uncertainty_score":0.46105585},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027654106,0.00008182603,0.99480027,0.0013033457,0.00013410037,0.00058973377,0.000043677035,0.00000543622,0.00027622946],"genre_scores_gemma":[0.98623794,0.0000047848835,0.0131303,0.00033984214,0.00023064484,0.000012230991,0.000012103648,0.000011458849,0.000020711243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901175,0.000017410071,0.00029285124,0.00032145408,0.00021008111,0.0001464728],"domain_scores_gemma":[0.99816835,0.0010192463,0.00035666605,0.00029882786,0.00013094571,0.000025969246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034269853,0.00017115858,0.00028659907,0.000067947396,0.00013117776,0.000034488883,0.00043890448,0.00005180306,0.000018150213],"category_scores_gemma":[0.000004972376,0.00010291624,0.00009558475,0.00008493033,0.00074559235,0.000040677434,0.0001242982,0.00019733823,8.308342e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000137383095,0.000014145971,0.000008298729,0.0000052669798,0.000013293982,9.185489e-8,0.00034592047,0.013272156,0.000008430834,0.94807345,0.00003867182,0.038206566],"study_design_scores_gemma":[0.00034107728,0.000054115393,0.000014245162,0.00005229557,0.000009883971,3.9937223e-7,0.000001152673,0.4541663,0.0001258368,0.54495555,0.00020392127,0.00007524862],"about_ca_topic_score_codex":0.000017878197,"about_ca_topic_score_gemma":0.0000062713843,"teacher_disagreement_score":0.9834725,"about_ca_system_score_codex":0.000017646184,"about_ca_system_score_gemma":0.000094875126,"threshold_uncertainty_score":0.41968024},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019882757,0.0006386423,0.9930701,0.00028908218,0.0027445338,0.0012699856,0.00047686935,0.00041064576,0.0010802422],"genre_scores_gemma":[0.43329954,0.0000047044437,0.56500936,0.0004695689,0.0007969785,0.00009688785,0.00005311474,0.000072594165,0.00019724466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943171,0.00003922839,0.0010926229,0.002174396,0.0011368754,0.0012397417],"domain_scores_gemma":[0.9934772,0.0029569797,0.00073023053,0.0016165631,0.0008903128,0.00032871487],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012527762,0.0008453726,0.0009975922,0.000623176,0.00054131664,0.0015104,0.003829399,0.00049965165,0.0000076178967],"category_scores_gemma":[0.0009336086,0.0008076377,0.00022455993,0.0011054977,0.00093568116,0.0005301385,0.00053913274,0.00073335104,0.000025064232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008102042,0.00015853168,0.00038343592,0.0006714033,0.000036429537,0.00027136187,0.00016256122,0.37407988,0.00060577196,0.052306637,0.0002835067,0.57103235],"study_design_scores_gemma":[0.0006538347,0.00023838038,0.00005760901,0.002110139,0.000013201414,0.00012154473,1.6982676e-7,0.981391,0.00025358435,0.008968229,0.005231592,0.0009607023],"about_ca_topic_score_codex":0.000031288524,"about_ca_topic_score_gemma":0.000007880392,"teacher_disagreement_score":0.6073111,"about_ca_system_score_codex":0.0005713087,"about_ca_system_score_gemma":0.0006839139,"threshold_uncertainty_score":0.99952614},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049351,0.00023377212,0.99272174,0.00025573434,0.0007726784,0.0005044797,0.0000054509705,0.00012371833,0.0004473323],"genre_scores_gemma":[0.2963299,0.000030945244,0.7028617,0.0005838159,0.00012367641,0.000008155793,0.000016504802,0.000021396823,0.000023897528],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677384,0.00012518205,0.00063518976,0.0011661181,0.0008534391,0.00044621428],"domain_scores_gemma":[0.99785775,0.00047448033,0.00035900387,0.0008933446,0.00026421025,0.00015118928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014046172,0.00040716355,0.00047950255,0.0015296583,0.00008899847,0.0002544682,0.0018830373,0.00032706978,0.00005002758],"category_scores_gemma":[0.00015147975,0.00039427623,0.00009964561,0.0009408334,0.00049474475,0.0010866825,0.0002331492,0.000650539,0.000037930306],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007718771,0.00002738825,0.000036266378,0.00003105355,0.000004094622,0.000108139415,0.0012410813,0.0014210939,0.002603876,0.0007397945,0.0000019608422,0.9937775],"study_design_scores_gemma":[0.0006233855,0.00033393237,0.0007701339,0.0012658981,0.000011261849,0.00012628191,0.0000019823547,0.2881589,0.18476316,0.5229996,0.000009053011,0.0009364625],"about_ca_topic_score_codex":0.00011462807,"about_ca_topic_score_gemma":0.00019849824,"teacher_disagreement_score":0.99284106,"about_ca_system_score_codex":0.00035927416,"about_ca_system_score_gemma":0.0006101287,"threshold_uncertainty_score":0.9998509},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32942903,0.0000016052081,0.66390693,0.000028694769,0.000033273693,0.006592588,0.0000014483784,0.000004604439,0.0000018324864],"genre_scores_gemma":[0.9063948,3.3432574e-8,0.09297515,0.00002591733,0.0000968597,0.0005034446,2.9268458e-7,0.000003501252,1.44885535e-8],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866307,0.000076803975,0.000542225,0.000206632,0.00032116057,0.00019011155],"domain_scores_gemma":[0.99796915,0.0015597921,0.00017698028,0.00016849725,0.00008551956,0.000040041738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034999095,0.0000837206,0.00024697615,0.00008518497,0.000050774754,0.000024453717,0.0002904953,0.000057038127,0.0000014217553],"category_scores_gemma":[0.000090243906,0.000056552333,0.00004086184,0.0005040161,0.00026788714,0.000065908054,0.000097049946,0.00017185851,4.228107e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010935288,0.0006582784,0.69521374,0.0019902363,0.000023537952,0.0000137560155,0.0041217497,0.011009071,0.011605897,0.0016545672,0.0000053971903,0.2735944],"study_design_scores_gemma":[0.00079449755,0.00030478032,0.025289971,0.0047958186,0.000011368788,0.00004216689,0.000033955796,0.9617674,0.006328792,0.0004901677,0.0000025240968,0.00013860867],"about_ca_topic_score_codex":0.000032727756,"about_ca_topic_score_gemma":0.00002877198,"teacher_disagreement_score":0.9507583,"about_ca_system_score_codex":0.000033748736,"about_ca_system_score_gemma":0.00024424598,"threshold_uncertainty_score":0.23061372},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001270189,0.00039417564,0.9966372,0.00028800443,0.0012994356,0.00083051075,0.00001855483,0.0002291086,0.00017594888],"genre_scores_gemma":[0.01882247,0.000078719306,0.980322,0.0002479536,0.00025845604,0.0000063307543,0.000009617526,0.000038917617,0.00021554939],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965564,0.000032323653,0.00067259464,0.0013281534,0.0008728136,0.0005377373],"domain_scores_gemma":[0.9969258,0.00032853684,0.00069962814,0.0010833648,0.0008418575,0.000120814264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009522719,0.00045978045,0.00050668203,0.0006531071,0.00027032878,0.00034192234,0.0015437334,0.00038035493,0.000008773838],"category_scores_gemma":[0.00021922754,0.00043161868,0.00023340282,0.0006786698,0.00074770546,0.0011830518,0.00040552858,0.00060352864,0.000006106956],"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.00014468079,0.00018312228,0.000011649419,0.00034724962,0.000022654973,0.000023675093,0.0005110374,0.0016650615,0.78669536,0.012188294,0.000016227297,0.19819099],"study_design_scores_gemma":[0.0006038768,0.00039939943,0.00031678885,0.0006319562,0.00003137078,0.0000668268,7.7111605e-7,0.14996561,0.72145146,0.12541234,0.00040566514,0.0007139247],"about_ca_topic_score_codex":0.000032314267,"about_ca_topic_score_gemma":0.000016382775,"teacher_disagreement_score":0.19747706,"about_ca_system_score_codex":0.0007108347,"about_ca_system_score_gemma":0.00063766225,"threshold_uncertainty_score":0.99981356},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081000064,0.0020180817,0.11633074,0.0009105591,0.012106243,0.0004424072,0.000141165,0.00028838654,0.8669524],"genre_scores_gemma":[0.93739766,0.00020647382,0.004569847,0.002890032,0.014028343,0.000010066505,0.000062657855,0.00013827489,0.040696632],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828935,0.0000038919625,0.0002536248,0.000551379,0.0005399585,0.00036182377],"domain_scores_gemma":[0.9990526,0.00026820597,0.00011522835,0.00035784038,0.000102041544,0.000104097286],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011480411,0.0002919626,0.00030202986,0.0003376012,0.00018918325,0.0010105277,0.0007761073,0.00011588666,0.0036229894],"category_scores_gemma":[0.00005984338,0.00022993494,0.00009205138,0.00005674583,0.0010320415,0.0004379555,0.00028454082,0.00039815996,0.0005361542],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031103832,0.000026927764,0.000026448177,0.000025507285,0.000010173056,0.000070450486,0.008754698,0.00016820282,0.0000030446154,0.052090958,0.0006572478,0.9381632],"study_design_scores_gemma":[0.0005027331,0.00025008526,0.000065226704,0.0009897065,0.000029155844,0.000033364435,0.0000054223624,0.014100554,0.00024347658,0.3384875,0.6436292,0.0016635827],"about_ca_topic_score_codex":0.000013434627,"about_ca_topic_score_gemma":0.00018303421,"teacher_disagreement_score":0.9365877,"about_ca_system_score_codex":0.000071761046,"about_ca_system_score_gemma":0.000081204504,"threshold_uncertainty_score":0.9972878},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002182988,0.0003755119,0.9946711,0.00047955365,0.0014073597,0.0009702008,0.000017723527,0.0003057684,0.0017509224],"genre_scores_gemma":[0.0075333463,0.000047308895,0.9911505,0.00060000905,0.0003374009,0.0000647803,0.000010393869,0.000034740107,0.00022151193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685025,0.00006874036,0.00058838754,0.0012164188,0.0007092058,0.0005670243],"domain_scores_gemma":[0.9973509,0.0002903503,0.00043831646,0.0015050957,0.00034239516,0.00007299652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018699259,0.0004461576,0.00038488762,0.00052065926,0.00045969326,0.00054950645,0.0029524195,0.00022890983,0.0000022760653],"category_scores_gemma":[0.0000628801,0.00034123665,0.000140403,0.00045298517,0.00083941274,0.00095818366,0.0006736859,0.0005637049,0.0000029227374],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005760474,0.000010215018,0.000002543897,0.00002406475,0.000005235247,0.0000029441107,0.00019948732,0.059476648,0.00030309558,0.16571869,0.000031843167,0.77421945],"study_design_scores_gemma":[0.00007085656,0.000059479473,0.000009718655,0.000058145673,0.0000040487166,0.00004065639,5.199169e-8,0.57969844,0.009165291,0.4096212,0.0010180409,0.0002540581],"about_ca_topic_score_codex":0.00006360634,"about_ca_topic_score_gemma":0.000035941084,"teacher_disagreement_score":0.7739654,"about_ca_system_score_codex":0.00031336362,"about_ca_system_score_gemma":0.00026672613,"threshold_uncertainty_score":0.999904},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021693642,0.0007090668,0.9888308,0.00039653352,0.0017553334,0.00084883487,0.00005800469,0.00023170769,0.0071479958],"genre_scores_gemma":[0.103008166,0.00005239741,0.8927004,0.0011617455,0.0015934219,0.000034408833,0.0002094853,0.00006670398,0.0011732925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99311477,0.00010449996,0.000949507,0.0035580655,0.001241077,0.001032073],"domain_scores_gemma":[0.9940565,0.00041037795,0.00045850105,0.004674023,0.00018002448,0.00022052496],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002419518,0.00074427534,0.00084684783,0.00096654467,0.0002262641,0.00073516846,0.009924386,0.00041093465,0.000010086403],"category_scores_gemma":[0.00012881345,0.00069477235,0.00011074833,0.0010643977,0.00042991806,0.000801507,0.0053746835,0.001271387,0.00006495476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024040735,0.00039454148,0.00023137538,0.00013998979,0.00004905438,0.0002275221,0.0031426284,0.59992594,0.000025843208,0.010311504,0.00081515795,0.3847124],"study_design_scores_gemma":[0.00065783475,0.000088048466,0.00018898738,0.00044178875,0.000006079455,0.00012049016,6.570389e-7,0.983171,0.00002835145,0.0027651098,0.011705795,0.00082588656],"about_ca_topic_score_codex":0.00010145486,"about_ca_topic_score_gemma":0.0002268398,"teacher_disagreement_score":0.38388652,"about_ca_system_score_codex":0.000630492,"about_ca_system_score_gemma":0.0008196899,"threshold_uncertainty_score":0.99955034},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018608246,0.000101328915,0.99779075,0.00022346774,0.0005068446,0.00015736256,0.000010877925,0.000060876042,0.0009624354],"genre_scores_gemma":[0.15168817,0.000028875536,0.8469212,0.0009352558,0.00017316114,0.00000315324,0.000068320434,0.000017183975,0.000164689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739766,0.000014738885,0.0004272609,0.0010456983,0.00079252827,0.0003221005],"domain_scores_gemma":[0.99808604,0.00015389171,0.00030341835,0.0012112866,0.00013504493,0.000110321904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011012647,0.00028142132,0.00040996977,0.0021720391,0.00010197616,0.00032782098,0.0017027981,0.00013336462,0.000025551108],"category_scores_gemma":[0.00001226262,0.0002597543,0.00009153442,0.0009546813,0.00033059096,0.000660317,0.00045707478,0.00026246102,0.000004592479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048288457,0.000050418388,0.00020211411,0.000037015903,0.00006289068,0.000033823897,0.00013621627,0.054711323,0.00009232576,0.010095381,0.00000773581,0.9345659],"study_design_scores_gemma":[0.00015593518,0.00016305715,0.0026541955,0.00007073104,0.00009032981,0.0000014235117,1.6518017e-7,0.9886259,0.00064633787,0.005806716,0.0014607265,0.00032451414],"about_ca_topic_score_codex":0.00006325617,"about_ca_topic_score_gemma":0.00018658896,"teacher_disagreement_score":0.9342414,"about_ca_system_score_codex":0.00010021003,"about_ca_system_score_gemma":0.00009839902,"threshold_uncertainty_score":0.99998546},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013082383,0.00036619673,0.9961856,0.0014302589,0.00069238845,0.00033239755,0.000004522624,0.00012466637,0.00073316635],"genre_scores_gemma":[0.18025418,0.00003089192,0.8185587,0.00046688336,0.0005100338,0.000016182254,0.000016276805,0.000026427915,0.00012042035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697435,0.00002247606,0.00043473722,0.0012439458,0.0006508301,0.00067367655],"domain_scores_gemma":[0.99803895,0.000395817,0.0002135258,0.0010404512,0.00017261188,0.000138654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042347948,0.00042329094,0.00037551468,0.00056990504,0.00035907846,0.00028382297,0.0023857546,0.00032995475,0.000009298966],"category_scores_gemma":[0.000020598278,0.0003699187,0.00006837192,0.0008142044,0.00072121975,0.0006121692,0.0008706424,0.0015079603,0.000009571269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031836175,0.000035316836,0.00074217794,0.000009623441,0.0000037367688,0.000072704985,0.000107850145,0.89415485,0.000027700848,0.031619765,0.000008336863,0.07321478],"study_design_scores_gemma":[0.000174473,0.000075278054,0.0018614425,0.00014546583,0.0000036701172,0.00022036476,1.2032974e-7,0.9593043,0.000027728505,0.03743412,0.00029890632,0.00045416385],"about_ca_topic_score_codex":0.000043235257,"about_ca_topic_score_gemma":0.0002731307,"teacher_disagreement_score":0.18012336,"about_ca_system_score_codex":0.00016801126,"about_ca_system_score_gemma":0.00035752813,"threshold_uncertainty_score":0.99987525},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020964411,0.00065201096,0.99516356,0.00090974895,0.0004650571,0.0005513323,0.000004618269,0.00033624296,0.0018964587],"genre_scores_gemma":[0.018870056,0.00011644575,0.9776837,0.002937579,0.00019530715,0.000006108485,0.0000043466243,0.000039970608,0.00014645384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628645,0.000022512095,0.00057173346,0.0014624356,0.0008994815,0.0007574082],"domain_scores_gemma":[0.9977708,0.0004756969,0.00023200258,0.0010134589,0.00027404088,0.00023402243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012126453,0.00058594963,0.00057961483,0.0008543954,0.00027085232,0.00058116723,0.0020045117,0.00032402092,0.000011373514],"category_scores_gemma":[0.00008444584,0.0005180867,0.0001396298,0.00050719146,0.0008803326,0.0013081689,0.0005611547,0.00095394667,0.000008982169],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010580053,0.000016346283,0.000006458127,0.000043192984,0.0000044425915,0.00016068613,0.00018707241,0.00005427861,0.0022976925,0.002776068,0.0000044486133,0.9944387],"study_design_scores_gemma":[0.0011085343,0.00085511274,0.00015831321,0.0011647932,0.000021882941,0.00029035367,4.5109746e-7,0.414334,0.3397816,0.23367535,0.006568381,0.002041229],"about_ca_topic_score_codex":0.000025821535,"about_ca_topic_score_gemma":0.00003476596,"teacher_disagreement_score":0.9923975,"about_ca_system_score_codex":0.00026633925,"about_ca_system_score_gemma":0.00024191203,"threshold_uncertainty_score":0.9997271},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08137863,0.0044352994,0.90423965,0.00012503934,0.00095011457,0.00059925305,0.000010476173,0.000018193747,0.008243323],"genre_scores_gemma":[0.9273123,0.000233468,0.07147622,0.00024138614,0.0003388922,0.0000030212052,0.000022775503,0.000029453506,0.00034244955],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99832296,0.000020185844,0.00034185202,0.0006669308,0.00033449818,0.00031355413],"domain_scores_gemma":[0.99923253,0.000029257595,0.00018212931,0.00042383152,0.00008271247,0.00004952232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003964063,0.00024154216,0.00029204207,0.00026344453,0.000037176953,0.000028996243,0.0006684877,0.0002176167,0.000022898268],"category_scores_gemma":[0.000029426257,0.00023750991,0.000065692,0.0001591788,0.00037959858,0.0000059659133,0.0004228283,0.00018990482,0.000004589883],"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.00004246956,0.0001234929,0.005001231,0.00015778697,0.00005678095,0.00017024379,0.0013678119,0.062465306,0.4811076,0.00028281938,0.00004482697,0.44917962],"study_design_scores_gemma":[0.0024202333,0.0015743421,0.0017017452,0.0021540022,0.00003479649,0.0001819936,0.000007908651,0.034430075,0.9248598,0.01887229,0.011075435,0.0026873762],"about_ca_topic_score_codex":0.000031150674,"about_ca_topic_score_gemma":0.000038858656,"teacher_disagreement_score":0.8459337,"about_ca_system_score_codex":0.00006901484,"about_ca_system_score_gemma":0.00015702937,"threshold_uncertainty_score":0.96853733},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005541364,0.0002834925,0.9774287,0.000639838,0.0015033756,0.00041402824,0.0000022168372,0.0005751397,0.019147698],"genre_scores_gemma":[0.0015107685,0.000079349426,0.9933835,0.0031379287,0.00047618494,0.000015038263,0.0000075890152,0.000038699483,0.0013509213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533266,0.00004445973,0.0006554594,0.0016631659,0.0015382495,0.00076603366],"domain_scores_gemma":[0.99711865,0.00037816254,0.00029054892,0.0016724179,0.00024710433,0.00029308713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010614967,0.0005489224,0.0005360412,0.0009878454,0.00024004882,0.0006993394,0.0044224565,0.00035472063,0.0002715806],"category_scores_gemma":[0.0001642912,0.0005107684,0.00013236904,0.00077097234,0.0006244434,0.00092992745,0.0017159254,0.0010033781,0.00018744875],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014961873,0.000017063909,0.0000053992544,0.000020577349,0.0000054744896,0.0003226798,0.0002708345,0.001250089,0.00039561323,0.0026490728,0.00015408176,0.9949076],"study_design_scores_gemma":[0.0004932078,0.0002804029,0.000027360235,0.00088825304,0.000014390333,0.000602898,2.0430504e-7,0.7617274,0.0181729,0.20721596,0.009001208,0.0015757971],"about_ca_topic_score_codex":0.000020137506,"about_ca_topic_score_gemma":0.000022250339,"teacher_disagreement_score":0.99333185,"about_ca_system_score_codex":0.00038350903,"about_ca_system_score_gemma":0.00048222416,"threshold_uncertainty_score":0.9997344},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013692382,0.00006297209,0.996631,0.0007135772,0.001501743,0.000663585,0.000009785046,0.00009666396,0.00018372065],"genre_scores_gemma":[0.040745046,0.0000041481794,0.95804846,0.0007290452,0.0003013697,0.000043444285,0.000023216502,0.000018671302,0.00008659727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970877,0.00006368558,0.00050667743,0.0012992482,0.00053877075,0.0005039263],"domain_scores_gemma":[0.9979505,0.0009135492,0.00025363278,0.0005363523,0.00024747607,0.00009850105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016625454,0.00036111273,0.00036535444,0.0006868395,0.00022987481,0.00036404832,0.0014672043,0.00036751348,0.00002076278],"category_scores_gemma":[0.00018044608,0.00036433514,0.00011249385,0.0005293488,0.00021507358,0.0004917051,0.00031275445,0.0008324816,0.000005498463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009393009,0.000024932355,0.00010795771,0.000027756874,0.0000033891542,0.0000032813282,0.00012469367,0.08451474,0.0029185307,0.019627925,0.0000029137884,0.8926345],"study_design_scores_gemma":[0.00040747426,0.000083347375,0.0001676215,0.000095043564,0.0000038609205,0.00001144492,4.031204e-8,0.8410073,0.009119092,0.14782251,0.00093868026,0.00034360122],"about_ca_topic_score_codex":0.000029878269,"about_ca_topic_score_gemma":0.00015112854,"teacher_disagreement_score":0.8922909,"about_ca_system_score_codex":0.00060379255,"about_ca_system_score_gemma":0.00081421935,"threshold_uncertainty_score":0.99988085},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015838367,0.00013718448,0.9945094,0.0008665414,0.001192329,0.0008833459,0.0000025758832,0.000112922,0.0007118653],"genre_scores_gemma":[0.0062752306,0.00002041233,0.9922267,0.001166993,0.00015332746,0.000021802047,0.0000037925988,0.000029646842,0.00010210169],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969193,0.00011577525,0.00037070943,0.001467568,0.0006478094,0.00047888161],"domain_scores_gemma":[0.9982215,0.00026532065,0.00021675961,0.00081955997,0.00026962574,0.00020721264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009075766,0.000482126,0.00042425763,0.00080157974,0.00032986348,0.00074915733,0.0008709049,0.00036156373,0.000022056405],"category_scores_gemma":[0.00010174366,0.000416899,0.00008166291,0.00059494365,0.0003333909,0.00063776196,0.00038907444,0.0006393227,0.0000151318145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011508308,0.00008754877,0.000006742234,0.00011616857,0.000014236889,0.000036275367,0.0007596015,0.2634833,0.021310488,0.0054065697,0.0000687118,0.7085953],"study_design_scores_gemma":[0.0003997346,0.0005192236,0.000010242183,0.0010251683,0.0000115753355,0.000048193873,0.0000018204436,0.90029657,0.047608327,0.047692735,0.001631393,0.0007550369],"about_ca_topic_score_codex":0.000013016524,"about_ca_topic_score_gemma":0.0000054640236,"teacher_disagreement_score":0.70784026,"about_ca_system_score_codex":0.00018082616,"about_ca_system_score_gemma":0.0004911346,"threshold_uncertainty_score":0.9998283},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08650066,0.00038012507,0.90323216,0.00004570974,0.00440783,0.0010948128,0.000034753564,0.000016913218,0.004287041],"genre_scores_gemma":[0.6361957,0.000016713733,0.36028454,0.0012409907,0.00050388026,0.00001439849,0.0000022156632,0.00010241056,0.0016391237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99107647,0.0006835472,0.0017789964,0.001646381,0.003895881,0.000918713],"domain_scores_gemma":[0.992135,0.0034549967,0.0016211264,0.0016365555,0.00094544305,0.0002069149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.013029681,0.0005887589,0.0012451434,0.0008054074,0.00029057293,0.0001460948,0.0028199207,0.00020694791,0.00009748839],"category_scores_gemma":[0.0025987069,0.0004827752,0.00015318353,0.0015629961,0.00049809244,0.00020819495,0.0013928161,0.0006060804,4.0557745e-7],"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.00004963059,0.000056763987,0.0014700216,0.000023315384,0.000021368185,0.000023776429,0.0005657236,0.8678382,0.00004588606,0.00004685704,0.0003143621,0.12954411],"study_design_scores_gemma":[0.00042656268,0.0002816737,0.0007358968,0.0002683512,0.000024579733,0.000010301227,0.00000313719,0.95659953,0.00017464056,0.04086288,0.00016619451,0.00044622645],"about_ca_topic_score_codex":0.0041623767,"about_ca_topic_score_gemma":0.04497109,"teacher_disagreement_score":0.5496951,"about_ca_system_score_codex":0.0004443586,"about_ca_system_score_gemma":0.0014300821,"threshold_uncertainty_score":0.9997624},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029899032,0.00061259174,0.99559313,0.00088477693,0.0008788099,0.00087563595,0.0000033946208,0.00026540132,0.0005872765],"genre_scores_gemma":[0.19246228,0.00008452377,0.8019339,0.0033941013,0.0016323313,0.00007396868,0.000016177582,0.00006946301,0.00033327483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957367,0.000049314207,0.00077361695,0.0017125777,0.00068511337,0.0010426553],"domain_scores_gemma":[0.99666643,0.0013717706,0.00034415285,0.0011254995,0.00028154533,0.00021060662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012737277,0.0006293547,0.0007253879,0.0008489251,0.00022891769,0.0004079934,0.0027455466,0.0004896756,0.000016938962],"category_scores_gemma":[0.00006225249,0.00061396026,0.00021152501,0.0007689198,0.00032012025,0.00047400966,0.00047033047,0.0008120672,0.000024643721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018594801,0.00002156153,0.000026100442,0.000010824549,0.000005798173,0.000035971025,0.000053152096,0.49161223,0.00002369753,0.0036783875,0.000033141056,0.50448054],"study_design_scores_gemma":[0.0009117002,0.00015602929,0.000040344697,0.000481967,0.000009586994,0.00002057511,4.4974847e-8,0.99160683,0.000038336435,0.004695007,0.0013801634,0.0006594399],"about_ca_topic_score_codex":0.00002340546,"about_ca_topic_score_gemma":0.00022433352,"teacher_disagreement_score":0.50382113,"about_ca_system_score_codex":0.00046599619,"about_ca_system_score_gemma":0.00089939573,"threshold_uncertainty_score":0.99963117},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019634902,0.00053702673,0.97312176,0.001525406,0.0024515896,0.00035416623,0.000024385037,0.000101205886,0.019920979],"genre_scores_gemma":[0.49096993,0.00003934718,0.48476136,0.0023970678,0.002729338,0.000016517864,0.000043746524,0.000102623286,0.018940074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940014,0.00009317684,0.0012156462,0.0015950951,0.0022597383,0.0008349504],"domain_scores_gemma":[0.9946268,0.0030402082,0.00042427846,0.0012222867,0.00047512347,0.00021126962],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007073249,0.00040291317,0.0006069925,0.0035661233,0.00039266015,0.00052938215,0.0020442223,0.0005073755,0.00025284998],"category_scores_gemma":[0.0029240986,0.00035183498,0.0001917961,0.0022329146,0.0010314501,0.00041056072,0.00047365105,0.0010402226,0.0011044969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008648827,0.00013360009,0.00050632475,0.000009147277,0.00001847961,0.0001564371,0.0016941312,0.31695634,0.00048374062,0.005192925,0.0013284493,0.67343396],"study_design_scores_gemma":[0.00074363366,0.00018274461,0.0021232278,0.0003703524,0.000022193968,0.000080571575,0.0000019499523,0.73868185,0.00031102393,0.239909,0.016579794,0.0009936524],"about_ca_topic_score_codex":0.00008618248,"about_ca_topic_score_gemma":0.0005312253,"teacher_disagreement_score":0.6724403,"about_ca_system_score_codex":0.0004618691,"about_ca_system_score_gemma":0.00089355477,"threshold_uncertainty_score":0.99989337},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024594468,0.000862368,0.9944067,0.00032670685,0.0011409954,0.00018307472,0.0000012187329,0.00004772407,0.0027852738],"genre_scores_gemma":[0.09629074,0.00034964757,0.90076405,0.00096978055,0.0006385388,0.000002054517,0.0000146978855,0.000041163665,0.0009293327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964599,0.000022093767,0.0005619236,0.0010911131,0.0013923254,0.000472671],"domain_scores_gemma":[0.9980034,0.00024748844,0.00038233466,0.001018124,0.00020872611,0.00013992465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000808242,0.0003617814,0.0005274362,0.0008215668,0.00012066858,0.00023588775,0.0020957058,0.00022745437,0.000051411866],"category_scores_gemma":[0.000027671234,0.00028723606,0.0001369359,0.0006948973,0.00046019338,0.00043136775,0.0007755059,0.00046509842,0.000018549896],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006742703,0.00007142047,0.0005800216,0.00006255871,0.00006735732,0.00007547185,0.000945997,0.005012311,0.00016362539,0.02951552,0.00004106874,0.9633972],"study_design_scores_gemma":[0.0043061767,0.0047336374,0.0049669724,0.004759155,0.00011048682,0.00027511144,0.000002994798,0.80526114,0.023578348,0.10508097,0.042315293,0.004609696],"about_ca_topic_score_codex":0.000005328782,"about_ca_topic_score_gemma":0.000014800934,"teacher_disagreement_score":0.9587875,"about_ca_system_score_codex":0.0001483786,"about_ca_system_score_gemma":0.0002845923,"threshold_uncertainty_score":0.999958},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014425245,0.00020326924,0.9950693,0.0007613433,0.0013204754,0.00088308426,0.00015754707,0.0004887797,0.0009719046],"genre_scores_gemma":[0.5146869,0.0000064696937,0.4831433,0.0008646429,0.00092942,0.000032718704,0.00018704454,0.000064340566,0.000085179236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99507594,0.000048171954,0.00078897626,0.0020042532,0.0010458336,0.0010368319],"domain_scores_gemma":[0.99627495,0.00052171515,0.00040881976,0.002079504,0.00034364485,0.00037135935],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00103345,0.00079087523,0.00086184026,0.00057247037,0.00039452835,0.0012346864,0.0059124576,0.00051792996,0.000018014403],"category_scores_gemma":[0.000044834298,0.0006863306,0.00025724512,0.0006113578,0.0004557458,0.0005035212,0.00079776085,0.00077137386,0.000048989627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000243187,0.00018456667,0.000028604169,0.0008231802,0.00004832667,0.0001225108,0.0017999595,0.5401331,0.00030325164,0.27030835,0.000042295575,0.1861815],"study_design_scores_gemma":[0.00042331766,0.0002582117,0.00001423362,0.00073890376,0.0000104864575,0.000096602416,2.2158655e-7,0.53995967,0.000120591416,0.4552551,0.0024869742,0.0006356818],"about_ca_topic_score_codex":0.0000139367385,"about_ca_topic_score_gemma":0.000050418123,"teacher_disagreement_score":0.51454264,"about_ca_system_score_codex":0.00033872522,"about_ca_system_score_gemma":0.0008875581,"threshold_uncertainty_score":0.9998021},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013086817,0.00023711509,0.99613285,0.000042198106,0.00046841553,0.00023339374,0.000013556372,0.00043386224,0.0023077393],"genre_scores_gemma":[0.5240671,0.00006172059,0.47457826,0.00014460429,0.00040978883,0.000027373486,0.00003003142,0.00008895579,0.0005921846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986435,0.0000038218077,0.0002865985,0.0004982097,0.00025828744,0.00030953562],"domain_scores_gemma":[0.99923575,0.00020530041,0.00006202084,0.00035281343,0.0000909199,0.00005320861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001401462,0.00029578258,0.00033406724,0.00043941205,0.000098979566,0.00008175793,0.00050760753,0.00017141792,0.000013870744],"category_scores_gemma":[0.000022964416,0.0002712672,0.00012602178,0.00027927035,0.00025291828,0.00016368424,0.00012837062,0.00035390301,0.0000080419295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016746127,0.000006259607,0.000016009992,0.000030686446,0.0000083794075,0.000002967038,0.00004013753,0.7464584,0.00056627137,0.00032609768,0.00015688037,0.25238618],"study_design_scores_gemma":[0.0000683747,0.00007257021,0.000035253393,0.00015937726,0.000013018807,0.0000053292856,8.619612e-8,0.92835575,0.0061098337,0.05958474,0.005182041,0.0004136195],"about_ca_topic_score_codex":0.000015903846,"about_ca_topic_score_gemma":0.00012305229,"teacher_disagreement_score":0.5239362,"about_ca_system_score_codex":0.00023539936,"about_ca_system_score_gemma":0.000022353624,"threshold_uncertainty_score":0.99997395},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034257423,0.00021692038,0.99498516,0.00020070604,0.00020885529,0.0005929589,0.000004741254,0.00013610233,0.00022879077],"genre_scores_gemma":[0.616573,0.000031403215,0.38276103,0.00045218543,0.000106530366,0.000017138502,0.0000032573516,0.00002058246,0.000034869954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971819,0.00001873488,0.00044658544,0.0012875946,0.00069660245,0.00036857033],"domain_scores_gemma":[0.9979312,0.00013282258,0.00016348899,0.0013267256,0.00029487855,0.00015089144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005096944,0.00035732123,0.00049313036,0.00046982078,0.00014577822,0.00015268064,0.0012449796,0.00021853187,0.0000036448957],"category_scores_gemma":[0.000027043332,0.00026818048,0.00005626447,0.00045614457,0.00022257083,0.00041760918,0.000540466,0.0003239986,0.000014035184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027174709,0.000019813526,0.0004779101,0.00010165883,0.000007344233,0.000009640622,0.0009453168,0.3415891,0.00006557627,0.00050535693,0.0000029414366,0.65624815],"study_design_scores_gemma":[0.00026177673,0.0002747611,0.0005438564,0.0008071667,0.000007439444,0.00006614961,2.415718e-7,0.9784852,0.00029460926,0.018489692,0.00028855275,0.0004805045],"about_ca_topic_score_codex":0.00008890759,"about_ca_topic_score_gemma":0.000067259105,"teacher_disagreement_score":0.6557677,"about_ca_system_score_codex":0.000104897474,"about_ca_system_score_gemma":0.00024171242,"threshold_uncertainty_score":0.99997705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014623083,0.00049212435,0.9710306,0.0048847385,0.004692966,0.0011607734,0.000042721087,0.00013826213,0.0029347509],"genre_scores_gemma":[0.95735013,0.00018696561,0.026518932,0.010230944,0.00439638,0.000026419439,0.0000062267436,0.000051678446,0.0012323199],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99545217,0.00009996154,0.00048738488,0.001348839,0.001550729,0.0010609399],"domain_scores_gemma":[0.99772155,0.0001967777,0.00013783008,0.0007321879,0.00035003913,0.00086163514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008754445,0.0004444109,0.00044372515,0.00064600696,0.00075737364,0.00025692073,0.0017988132,0.0003185522,0.00011723113],"category_scores_gemma":[0.00018893728,0.00045196593,0.00011852753,0.00061948,0.0009626362,0.0004257748,0.000407594,0.00052116317,0.00012705348],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008096674,0.00020506569,0.00015531595,0.00007229007,0.000020800027,0.00031019832,0.3583489,0.0068027372,0.00020231612,0.0049055624,0.00076726306,0.6281286],"study_design_scores_gemma":[0.0013731315,0.0030705195,0.0073124156,0.01861877,0.00016030174,0.00024583953,0.0014797465,0.035940804,0.0054241084,0.12676266,0.7857709,0.013840809],"about_ca_topic_score_codex":0.0006545092,"about_ca_topic_score_gemma":0.003834972,"teacher_disagreement_score":0.94451165,"about_ca_system_score_codex":0.00122064,"about_ca_system_score_gemma":0.00077217177,"threshold_uncertainty_score":0.99979323},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001428893,0.00028989618,0.9956691,0.0010972974,0.00074799714,0.0007527011,0.00067531643,0.00008892584,0.0005358246],"genre_scores_gemma":[0.057589073,0.000019999863,0.94053286,0.00073064584,0.00047837922,0.000019659115,0.0003633974,0.000047365917,0.0002185947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584055,0.000025064843,0.000717648,0.0019446193,0.0008165932,0.0006555207],"domain_scores_gemma":[0.9943343,0.000734627,0.0005730249,0.003863272,0.00030384382,0.00019093938],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006206453,0.0005486108,0.0006941505,0.00050447875,0.00022580268,0.00052997493,0.008845815,0.00027045497,0.000032520686],"category_scores_gemma":[0.00010754872,0.0004734515,0.00011230713,0.0004924236,0.00055313105,0.000893076,0.0021121828,0.00046368653,0.000010934875],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016189364,0.000025183952,0.000054251588,0.00005847182,0.000021276108,0.0000064866454,0.0003827537,0.0019550966,0.00021059696,0.0029491496,0.0007699376,0.9935652],"study_design_scores_gemma":[0.00034613642,0.00017358943,0.00028217732,0.00040931604,0.000020145688,0.00003525572,7.5622665e-7,0.9587175,0.00070319936,0.034256823,0.0044625006,0.0005925881],"about_ca_topic_score_codex":0.0002104723,"about_ca_topic_score_gemma":0.00038102877,"teacher_disagreement_score":0.9929726,"about_ca_system_score_codex":0.00015027224,"about_ca_system_score_gemma":0.0005327724,"threshold_uncertainty_score":0.9997717},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011995431,0.0001954811,0.9702675,0.000828877,0.0011382186,0.00027346914,0.0000029769506,0.00012454228,0.027049001],"genre_scores_gemma":[0.1933545,0.00030289622,0.80026776,0.004210183,0.00044410833,0.000014055473,0.000012315637,0.000044265973,0.0013499141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718136,0.000033801178,0.00052772573,0.0011624822,0.00060913304,0.00048552777],"domain_scores_gemma":[0.998566,0.00017538408,0.00015628134,0.0008722072,0.00010157644,0.00012857046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004282776,0.0003715159,0.00038982986,0.0010438961,0.00014292818,0.00036440624,0.00146894,0.00022202873,0.00020584867],"category_scores_gemma":[0.000037165762,0.00037142792,0.000094987365,0.0006514703,0.0005057726,0.0005392858,0.000371427,0.00061667635,0.000076445365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002717932,0.000014077403,0.00022661644,0.0000073748174,0.0000028388902,0.00009907251,0.00027855884,0.07779964,0.000018698402,0.037811123,0.000011920776,0.8837274],"study_design_scores_gemma":[0.00042582472,0.00007801132,0.0016645663,0.00023689705,0.0000037125078,0.00017422417,1.0245858e-7,0.83417875,0.00017164815,0.15971583,0.0026228612,0.00072754576],"about_ca_topic_score_codex":0.000045137796,"about_ca_topic_score_gemma":0.00036311417,"teacher_disagreement_score":0.88299984,"about_ca_system_score_codex":0.00027979986,"about_ca_system_score_gemma":0.0006374296,"threshold_uncertainty_score":0.99987376},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021824909,0.001423581,0.9890948,0.0014120118,0.0023503434,0.00026415268,0.0000016015692,0.0003437685,0.004891476],"genre_scores_gemma":[0.27899376,0.00011847695,0.71505624,0.0048285997,0.00046922558,0.000016737567,0.00000395212,0.000041323863,0.00047167894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960799,0.000036112364,0.0005067714,0.0016510442,0.00087696814,0.00084919017],"domain_scores_gemma":[0.9971664,0.00059059117,0.0002596765,0.0016585487,0.00015721945,0.0001675889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044586265,0.0005653189,0.00064962934,0.0009482199,0.00036285166,0.0003153237,0.0041221115,0.00044823057,0.00002464088],"category_scores_gemma":[0.00015834282,0.0004977291,0.00018229718,0.00047180816,0.0010871443,0.00045612568,0.0009462014,0.0007120302,0.00008447942],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009829315,0.00004900206,0.0003594292,0.00003882071,0.00001423386,0.0009956713,0.0017546803,0.014799222,0.00015012753,0.010529774,0.00030032688,0.9709989],"study_design_scores_gemma":[0.00082067697,0.0003881182,0.0010227507,0.0006640925,0.000011802753,0.0004856085,3.4014366e-7,0.92405146,0.0054096575,0.058338225,0.007067775,0.0017395004],"about_ca_topic_score_codex":0.0000401703,"about_ca_topic_score_gemma":0.00012601646,"teacher_disagreement_score":0.9692594,"about_ca_system_score_codex":0.0003352142,"about_ca_system_score_gemma":0.00083925744,"threshold_uncertainty_score":0.99974746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048030756,0.0022540474,0.9768388,0.00007551216,0.0014653156,0.0005598294,0.000020557374,0.000075013246,0.018230585],"genre_scores_gemma":[0.73919314,0.00014397362,0.25939804,0.00039332962,0.00056239346,0.000014075332,0.000016265036,0.000059755257,0.00021904499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996222,0.000037799844,0.0006897598,0.0017508374,0.0005985659,0.000701018],"domain_scores_gemma":[0.9965605,0.0007374049,0.0004124836,0.0015343687,0.000486654,0.00026859835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011060659,0.00063688634,0.0007893183,0.001223751,0.00021444491,0.00027524898,0.0030047917,0.0004144818,0.00001934956],"category_scores_gemma":[0.00006597886,0.0005814171,0.00019338471,0.001068372,0.0013328978,0.00094028143,0.002483535,0.0009879048,0.000025375886],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027796359,0.00021343688,0.00023336487,0.00022581755,0.000040523504,0.000045073633,0.006751815,0.0003477467,0.00014117846,0.021607725,0.00020856386,0.97015697],"study_design_scores_gemma":[0.0022942598,0.001666809,0.0041023963,0.004011803,0.00007650869,0.00031295556,0.0000026430373,0.6003383,0.019299438,0.3309738,0.033261433,0.0036596993],"about_ca_topic_score_codex":0.000024317793,"about_ca_topic_score_gemma":0.00029195976,"teacher_disagreement_score":0.96649724,"about_ca_system_score_codex":0.00015084662,"about_ca_system_score_gemma":0.00047841715,"threshold_uncertainty_score":0.9996637},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003745714,0.00015745481,0.99604577,0.0011979744,0.0006344153,0.0014802516,0.000013771599,0.00018103932,0.00025185334],"genre_scores_gemma":[0.081502944,0.00016825265,0.91414917,0.0034750905,0.00024091169,0.00013459689,0.00002253304,0.00003807505,0.00026841593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757004,0.00006725697,0.0006086586,0.00062801805,0.0008127062,0.0003132962],"domain_scores_gemma":[0.99731976,0.0011456446,0.00045198758,0.0007708892,0.00026709668,0.00004463348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001139802,0.0002625168,0.00025927037,0.00035247632,0.0001774931,0.00027145536,0.0022082976,0.00014185508,0.000015012463],"category_scores_gemma":[0.00031729657,0.00016590559,0.000082717044,0.00069537445,0.0007755814,0.00056716945,0.00040804554,0.0003274872,0.0000021054059],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010423535,0.00005328123,0.0001865483,0.00010054847,0.000013568933,0.0000047309572,0.0029960275,0.027312178,0.008544029,0.003489403,0.0002980595,0.9569912],"study_design_scores_gemma":[0.000790529,0.00018336157,0.0018875104,0.0007081684,0.000020565827,0.00003495096,0.0000022712372,0.67515165,0.26511958,0.055284455,0.00027797496,0.0005389533],"about_ca_topic_score_codex":0.000026158079,"about_ca_topic_score_gemma":0.000099032244,"teacher_disagreement_score":0.95645225,"about_ca_system_score_codex":0.00022277846,"about_ca_system_score_gemma":0.00036787466,"threshold_uncertainty_score":0.67654335},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013407446,0.0020193583,0.9936622,0.0003872667,0.0022043174,0.00040036943,0.0000157706,0.00016314477,0.0010135452],"genre_scores_gemma":[0.89790165,0.000010052571,0.10036822,0.0011280761,0.00038662984,0.000015724458,0.000010416863,0.00003277856,0.00014643301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958256,0.000044957687,0.00080523494,0.0013664485,0.0009833425,0.00097442337],"domain_scores_gemma":[0.99720055,0.0005756913,0.0004545985,0.0013360407,0.0002078595,0.00022528223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013437544,0.0005633307,0.00066386216,0.00067123,0.00018796868,0.000501511,0.0029413584,0.00040562954,0.0000293578],"category_scores_gemma":[0.00014112871,0.000536128,0.00015766331,0.0006519972,0.0003291287,0.000872437,0.0005762902,0.0010708788,0.00010725101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045892443,0.000050454702,0.00066128833,0.00006318412,0.0000049742603,0.00011820611,0.000398185,0.044759367,0.000035883084,0.0053675794,0.000025683363,0.9485106],"study_design_scores_gemma":[0.0014866688,0.00020948223,0.0026689952,0.0034725736,0.000011722407,0.00014321004,0.0000013323147,0.9421828,0.0013440993,0.02722012,0.018835083,0.0024239167],"about_ca_topic_score_codex":0.00010448906,"about_ca_topic_score_gemma":0.00027508562,"teacher_disagreement_score":0.9460867,"about_ca_system_score_codex":0.00044871052,"about_ca_system_score_gemma":0.00065016025,"threshold_uncertainty_score":0.999709},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020651885,0.0002451869,0.97588956,0.0016974395,0.0015161696,0.0007277135,0.0000064279106,0.00029667182,0.019414317],"genre_scores_gemma":[0.5985713,0.00003955721,0.39568412,0.003567211,0.001124991,0.00002394784,0.0000039904844,0.0000691563,0.000915731],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99398196,0.00002451515,0.00081947545,0.0022442292,0.0017410285,0.0011887945],"domain_scores_gemma":[0.9959287,0.0009084814,0.00021306315,0.002177043,0.0003232715,0.00044946437],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011799146,0.00071799627,0.0007032901,0.0012378406,0.00031736854,0.0010178456,0.006425225,0.0003774472,0.00013231536],"category_scores_gemma":[0.00013932562,0.00068586954,0.00015284136,0.0009147303,0.000925888,0.0004830731,0.002348344,0.0012546123,0.0012958337],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069913294,0.00003452627,0.000011967429,0.000020983869,0.0000074784866,0.000070973794,0.0010086597,0.10550114,0.00031782428,0.046378836,0.00010017183,0.84654045],"study_design_scores_gemma":[0.00029165702,0.0005735687,0.0008537646,0.0009919169,0.000021288115,0.00015397882,0.0000023547873,0.569946,0.030343799,0.36268532,0.03046364,0.0036727327],"about_ca_topic_score_codex":0.000050544848,"about_ca_topic_score_gemma":0.000142502,"teacher_disagreement_score":0.84286773,"about_ca_system_score_codex":0.0005091341,"about_ca_system_score_gemma":0.00066970044,"threshold_uncertainty_score":0.9995592},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002387791,0.000111590685,0.9942691,0.0011705672,0.0005899248,0.00045741707,0.000031219744,0.00015713742,0.0008252553],"genre_scores_gemma":[0.02169928,0.00004484455,0.97544444,0.0016798059,0.00079660397,0.0000133152,0.00016974335,0.00003102932,0.00012096508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823856,0.000012927364,0.00036749436,0.00064741116,0.00051046035,0.00022316558],"domain_scores_gemma":[0.9989723,0.000099036864,0.00016298634,0.00041210104,0.00021262339,0.00014093347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000251725,0.00022414474,0.00029097844,0.0003447467,0.00013393832,0.000048008686,0.00019055097,0.00026542353,0.00014721518],"category_scores_gemma":[0.00007822651,0.00020211042,0.00009132765,0.00032916164,0.0005429052,0.000102535836,0.00006264872,0.000552021,0.000009586819],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002918642,0.00009225153,0.0015781164,0.00004916744,0.000054019984,0.000035714675,0.00016621042,0.004703912,0.008215366,0.0007993593,0.0003379253,0.98393875],"study_design_scores_gemma":[0.0004421783,0.00011291812,0.0003630679,0.0009841644,0.00009325259,0.00030364166,1.8989014e-7,0.9516651,0.0026382962,0.038161412,0.004934409,0.00030139493],"about_ca_topic_score_codex":0.0000671432,"about_ca_topic_score_gemma":0.0000056814074,"teacher_disagreement_score":0.9836374,"about_ca_system_score_codex":0.00023954826,"about_ca_system_score_gemma":0.00027194715,"threshold_uncertainty_score":0.82418233},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014492837,0.0027505518,0.9112862,0.0070050186,0.0041000918,0.003849707,0.00014757489,0.000636908,0.055731155],"genre_scores_gemma":[0.96736497,0.00012026355,0.02853674,0.0005485103,0.0012001238,0.000017943566,0.00009206824,0.000050341918,0.0020690295],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966014,0.000019456464,0.0005077005,0.0009907932,0.0012538531,0.0006267692],"domain_scores_gemma":[0.99839836,0.00018128923,0.00011243706,0.0007221581,0.00018089969,0.00040485075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005235903,0.0004129414,0.0006318257,0.0005759841,0.00014543007,0.00009270701,0.0003930409,0.00035392737,0.00031023324],"category_scores_gemma":[0.0000753771,0.0003101839,0.00020872088,0.00027938516,0.00077971094,0.0001284762,0.0002619338,0.0010122797,0.00014791166],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049095403,0.00061403646,0.43512577,0.000436542,0.00017136124,0.01141466,0.00042351545,0.005097177,0.00006050545,0.00920019,0.00011811011,0.5368472],"study_design_scores_gemma":[0.03844649,0.024201797,0.22307079,0.012762246,0.000748706,0.011360888,0.0000022514555,0.08443729,0.0051229964,0.53422904,0.05981029,0.0058072344],"about_ca_topic_score_codex":0.000070106405,"about_ca_topic_score_gemma":0.000048443017,"teacher_disagreement_score":0.95287216,"about_ca_system_score_codex":0.0008561642,"about_ca_system_score_gemma":0.00088852894,"threshold_uncertainty_score":0.99993503},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091668515,0.00025227916,0.9972176,0.0000084182,0.00038687504,0.00012122668,0.000014456008,0.000033419292,0.0010490564],"genre_scores_gemma":[0.61688954,0.000037514954,0.38263354,0.000015332374,0.00032965906,0.0000024616472,0.000013006454,0.000020517315,0.000058420308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989656,0.0000046838436,0.00036165962,0.0002943198,0.00021932101,0.00015437389],"domain_scores_gemma":[0.99935585,0.00007410403,0.00012682311,0.00022194523,0.00019358225,0.000027711481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031939292,0.00017115769,0.00031956364,0.0004897307,0.00005458406,0.000019938301,0.00021781556,0.0001531509,0.000011796806],"category_scores_gemma":[0.000012930627,0.0001670794,0.00010305617,0.00014543494,0.00020697588,0.00008991505,0.000030134093,0.00016595247,4.959944e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000216899,0.0000033461915,0.0000058888595,0.000045944642,0.000020839781,5.2012734e-7,0.00014159453,0.627076,0.006841946,0.00029880632,0.000008571712,0.3655543],"study_design_scores_gemma":[0.000092229944,0.000071094386,0.000005669904,0.00016443538,0.000025829575,0.0000033552762,2.8724332e-7,0.95861304,0.034960035,0.0058944537,0.000013189688,0.00015635947],"about_ca_topic_score_codex":0.000011878713,"about_ca_topic_score_gemma":0.000054611628,"teacher_disagreement_score":0.6159729,"about_ca_system_score_codex":0.000073978954,"about_ca_system_score_gemma":0.000037635928,"threshold_uncertainty_score":0.68133},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019410185,0.0007960376,0.98576576,0.0052644843,0.0018007347,0.00067008834,0.000010568635,0.0001651554,0.003586147],"genre_scores_gemma":[0.46135604,0.00055904145,0.44239816,0.09307153,0.0008156579,0.0000983514,0.000077952805,0.0002864104,0.0013368333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944714,0.000076505174,0.00071562774,0.0022120168,0.0012155046,0.0013089606],"domain_scores_gemma":[0.9970904,0.00032384248,0.00047607496,0.0017825566,0.0000840413,0.00024309427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010289005,0.0008021911,0.0007020415,0.0014418518,0.0002281525,0.00039503275,0.0045437757,0.00043383823,0.000049597686],"category_scores_gemma":[0.000018253351,0.0007657155,0.00010578554,0.0014010424,0.0002368907,0.0005790644,0.0018111819,0.0011572351,0.00009537556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021898933,0.00020190395,0.0009783146,0.0004067381,0.000049852944,0.0007742829,0.010557066,0.058836002,0.0048418473,0.0070913034,0.000018541727,0.9162223],"study_design_scores_gemma":[0.0012034808,0.00033134723,0.0006841749,0.0013802225,0.000025214185,0.00024821874,0.000004732164,0.86119884,0.004322417,0.09948273,0.028610986,0.0025076366],"about_ca_topic_score_codex":0.0000745189,"about_ca_topic_score_gemma":0.008885598,"teacher_disagreement_score":0.9137146,"about_ca_system_score_codex":0.0004016992,"about_ca_system_score_gemma":0.00034551971,"threshold_uncertainty_score":0.99947935},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012429815,0.0000799089,0.99610925,0.00047970956,0.0008294307,0.0003163617,0.0000113693195,0.00009604865,0.0008349578],"genre_scores_gemma":[0.10439443,0.000100311074,0.89457947,0.000668455,0.000101589336,0.0000051958673,0.000050642942,0.000022901653,0.00007702586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980535,0.000034064073,0.0004221577,0.000780066,0.0004904734,0.00021976292],"domain_scores_gemma":[0.9983376,0.00018297033,0.00034786182,0.00049679633,0.0005367214,0.000098003205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029775413,0.00026819215,0.00028562977,0.0005978823,0.00017833439,0.00032140844,0.0005062748,0.000207639,0.00013869014],"category_scores_gemma":[0.00011183042,0.0002673523,0.000040613006,0.00055760395,0.0007685084,0.0006905067,0.00024683014,0.00026459328,0.000027420028],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023966343,0.0000100375,0.00034004776,0.00004624894,0.0000052305245,0.000004900724,0.0002713232,0.003315646,0.0002735692,0.0033120196,0.000008608727,0.99240994],"study_design_scores_gemma":[0.00063047674,0.0002192349,0.0032395865,0.00064143405,0.000023046505,0.00023457097,0.0000014514685,0.86530405,0.0052356315,0.12324265,0.0004010487,0.0008267954],"about_ca_topic_score_codex":0.000020737316,"about_ca_topic_score_gemma":0.000022765118,"teacher_disagreement_score":0.99158317,"about_ca_system_score_codex":0.00014702059,"about_ca_system_score_gemma":0.00044186454,"threshold_uncertainty_score":0.9999779},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013630338,0.0017018915,0.9783963,0.00094223116,0.0009347169,0.0009900411,0.000008543085,0.00021699375,0.016672978],"genre_scores_gemma":[0.52092254,0.00019872394,0.47400525,0.003861152,0.00039738778,0.00009702098,0.00004158468,0.00006507465,0.00041126928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956274,0.0000682989,0.00083606853,0.0017684508,0.00092214526,0.0007776353],"domain_scores_gemma":[0.99644035,0.00020831049,0.0004098749,0.0026071055,0.00016456074,0.00016977516],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010395102,0.000682417,0.000709629,0.0014613846,0.00024279163,0.0007397145,0.006812517,0.00036126946,0.0000065227637],"category_scores_gemma":[0.000004868021,0.00063224806,0.00013429725,0.0009494126,0.00033616688,0.000704753,0.0027985275,0.0010286979,0.00003585085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009726281,0.0001162939,0.00002295122,0.00014145389,0.000035155448,0.000026898928,0.0038318338,0.22993162,0.000018097982,0.103969716,0.000007504525,0.6618887],"study_design_scores_gemma":[0.0007401261,0.00006855451,0.00035616616,0.00080308923,0.000014344181,0.000092663184,0.000008188583,0.98026735,0.00006665512,0.009583793,0.0071615484,0.0008374972],"about_ca_topic_score_codex":0.000551102,"about_ca_topic_score_gemma":0.0010319492,"teacher_disagreement_score":0.75033575,"about_ca_system_score_codex":0.00064686703,"about_ca_system_score_gemma":0.00035709538,"threshold_uncertainty_score":0.99961287},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015374853,0.0011356886,0.6931977,0.0015176699,0.0031554336,0.00032531077,0.00008227993,0.00012354439,0.29892486],"genre_scores_gemma":[0.906021,0.000019611609,0.036265634,0.02315305,0.005036319,0.000039965984,0.00009202865,0.00019376747,0.029178618],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629223,0.00006860617,0.00049244595,0.0016587463,0.0006419144,0.0008460575],"domain_scores_gemma":[0.99845105,0.00033567994,0.00020674277,0.0007168595,0.00012224744,0.00016742521],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007896373,0.00054819364,0.000584037,0.00046935605,0.00018431747,0.00011342148,0.0011890535,0.00070423406,0.0023896957],"category_scores_gemma":[0.000019622636,0.00050533784,0.00022868862,0.00027748337,0.001407772,0.000100223,0.00015412089,0.0011339926,0.00031373955],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007828464,0.00025578274,0.0010250466,0.00006130025,0.00009793659,0.00045323474,0.004890212,0.0013213403,0.00008401703,0.05976288,0.0069482643,0.9250217],"study_design_scores_gemma":[0.003401828,0.00097622356,0.19546561,0.0005639059,0.00014210166,0.0015189007,0.000003655492,0.004157728,0.000066864624,0.48836312,0.30079365,0.004546401],"about_ca_topic_score_codex":0.00024151403,"about_ca_topic_score_gemma":0.0004417701,"teacher_disagreement_score":0.9204753,"about_ca_system_score_codex":0.00016816938,"about_ca_system_score_gemma":0.00020436125,"threshold_uncertainty_score":0.9997398},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020153417,0.0010869547,0.993726,0.0006404276,0.0020955775,0.0003370273,0.0000016522715,0.00023870589,0.0016720798],"genre_scores_gemma":[0.68098754,0.00009823579,0.3135101,0.0034328524,0.0014367657,0.00002039097,0.0000067151823,0.00007337825,0.00043403913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546003,0.000039673145,0.00057465694,0.0017443695,0.0012461621,0.00093507644],"domain_scores_gemma":[0.99717796,0.0006014809,0.0003204542,0.0013242004,0.00035393093,0.00022196652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038996,0.0006324344,0.0005524322,0.00058371073,0.0004749069,0.0004911554,0.003670459,0.0003392128,0.000029125524],"category_scores_gemma":[0.000057012632,0.0005342342,0.00013338673,0.0006297,0.0019067839,0.0008624122,0.001168302,0.00087490585,0.00002877743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009874035,0.000022331078,0.000120787394,0.0000066077005,0.000010673082,0.00041823505,0.0009983846,0.5746716,0.000014631098,0.00629631,0.00013571818,0.41729483],"study_design_scores_gemma":[0.00008183132,0.00017353735,0.00006479043,0.00022110397,0.0000040404407,0.0006518383,2.8585885e-7,0.98267835,0.0004682543,0.013434585,0.0015226706,0.0006986925],"about_ca_topic_score_codex":0.000032357115,"about_ca_topic_score_gemma":0.00012056762,"teacher_disagreement_score":0.680786,"about_ca_system_score_codex":0.00035126987,"about_ca_system_score_gemma":0.0005142711,"threshold_uncertainty_score":0.9997109},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004995501,0.0022223466,0.9929045,0.0003720205,0.0016018765,0.00033125674,0.00011731947,0.0003378959,0.0020628471],"genre_scores_gemma":[0.027236957,0.00021754918,0.96850157,0.0014853093,0.0013603191,0.000015421412,0.00045461784,0.000091322414,0.00063695764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99476534,0.000044497407,0.0007157879,0.0024128077,0.0012312582,0.0008302934],"domain_scores_gemma":[0.9943328,0.0006157077,0.00045039615,0.004217612,0.000199704,0.00018378718],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011659722,0.0006393178,0.00066342484,0.0010374937,0.00041325032,0.00046400094,0.0060326434,0.00029994283,0.000014018903],"category_scores_gemma":[0.00014720396,0.00055985217,0.000099549005,0.0008399082,0.0009708436,0.0019388932,0.0049597267,0.00080701534,0.0000534454],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012058275,0.00008812314,0.0012674008,0.00027823262,0.000063466585,0.00076123286,0.00072500267,0.05105402,0.0003842399,0.12433423,0.00063388527,0.8203981],"study_design_scores_gemma":[0.00059658015,0.00017519543,0.0005111255,0.0015654855,0.000023749915,0.0002602704,5.439972e-7,0.75192094,0.000559495,0.061335593,0.18053126,0.0025197593],"about_ca_topic_score_codex":0.00026936654,"about_ca_topic_score_gemma":0.0005775914,"teacher_disagreement_score":0.81787837,"about_ca_system_score_codex":0.00011699016,"about_ca_system_score_gemma":0.00047329764,"threshold_uncertainty_score":0.9996853},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002188056,0.00019758586,0.9957353,0.0005438284,0.0009727692,0.0004623665,0.000005788192,0.00016519932,0.00169838],"genre_scores_gemma":[0.5215427,0.000009176454,0.47471467,0.0019966527,0.0005280378,0.00001863856,0.000009617864,0.000046165664,0.0011343156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565977,0.000032765223,0.00058198685,0.0018580026,0.0009855528,0.000881914],"domain_scores_gemma":[0.99727297,0.0006960534,0.00041430243,0.0009895788,0.0004568266,0.00017027931],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013623594,0.0006437026,0.0008101962,0.00067723653,0.00035246386,0.0009232367,0.0035634448,0.00032557684,0.000024502444],"category_scores_gemma":[0.00008116292,0.0004980963,0.00024042829,0.00053274917,0.00052812207,0.00049495685,0.00070856605,0.00064263487,0.000035647536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035112174,0.00006184275,0.00007950066,0.00015529286,0.000091991315,0.00007779378,0.001022927,0.09948075,0.000064369495,0.44504577,0.00043799487,0.45344666],"study_design_scores_gemma":[0.00038387298,0.00033758648,0.0000181197,0.00039026822,0.000025913858,0.0000630328,2.7610736e-7,0.9814072,0.00052886934,0.0056424863,0.010436693,0.00076566514],"about_ca_topic_score_codex":0.00004031159,"about_ca_topic_score_gemma":0.00067664706,"teacher_disagreement_score":0.8819265,"about_ca_system_score_codex":0.0002230901,"about_ca_system_score_gemma":0.00047541337,"threshold_uncertainty_score":0.99974704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045175772,0.00009595052,0.9942271,0.00091848226,0.0004954165,0.0004230415,0.00003357223,0.00020964202,0.0031450281],"genre_scores_gemma":[0.12118149,0.000046631274,0.8765412,0.0013472192,0.00050842384,0.000031309217,0.00004909463,0.00005242637,0.00024218603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594253,0.00002214356,0.000521579,0.0017584799,0.0010880467,0.00066721876],"domain_scores_gemma":[0.9974314,0.00015438945,0.0003441305,0.0016892153,0.00016989767,0.00021095226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005722699,0.00056171656,0.0004844794,0.00056236447,0.0003342666,0.0009101329,0.0038429063,0.00020347438,0.000044550023],"category_scores_gemma":[0.000021189424,0.0004819924,0.00009685461,0.00059567724,0.0004939866,0.00072474626,0.0013944877,0.0005933176,0.000040791383],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006722088,0.000054952434,0.00014682244,0.00005808363,0.000027795793,0.00019137656,0.00072038476,0.0051672324,0.00033372408,0.017853307,0.000038951617,0.9754006],"study_design_scores_gemma":[0.0028157935,0.001236257,0.00082802936,0.004966435,0.00007957838,0.0005485807,0.0000021982214,0.9204497,0.003983122,0.05451907,0.0070424476,0.0035288164],"about_ca_topic_score_codex":0.00006121132,"about_ca_topic_score_gemma":0.00026174798,"teacher_disagreement_score":0.97187185,"about_ca_system_score_codex":0.00041060027,"about_ca_system_score_gemma":0.0011228304,"threshold_uncertainty_score":0.9997632},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064887316,0.00002252163,0.9833444,0.0015953116,0.0056652008,0.0007540742,0.000011522765,0.00007454949,0.0020437164],"genre_scores_gemma":[0.7102883,0.000027572465,0.28224626,0.0017110896,0.0053889025,0.000004341747,0.00005895417,0.000024998191,0.00024957227],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979685,0.000030343888,0.00031120863,0.00034850198,0.000985996,0.00035546307],"domain_scores_gemma":[0.9984574,0.00031689287,0.00030087694,0.0002147791,0.00058116874,0.00012889964],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021223961,0.00016710539,0.00019037948,0.00045444016,0.0017708885,0.00040515358,0.0006877172,0.00042537018,0.000049098267],"category_scores_gemma":[0.0009892994,0.00017224495,0.00005771771,0.00054722524,0.0010107607,0.0009366838,0.0003082869,0.0004615083,0.000007063093],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006167896,0.00006594773,0.00056214776,0.00013536445,0.000016984046,0.0000036982992,0.19328536,0.000881724,0.0008918988,0.031028092,0.00005078574,0.77301633],"study_design_scores_gemma":[0.0019431458,0.00047545173,0.00036763214,0.0011763815,0.00012442778,0.000017474367,0.00015274915,0.27302936,0.0032161963,0.5122381,0.20476271,0.0024963971],"about_ca_topic_score_codex":0.00011213827,"about_ca_topic_score_gemma":0.0002955606,"teacher_disagreement_score":0.7705199,"about_ca_system_score_codex":0.00044914667,"about_ca_system_score_gemma":0.0017183768,"threshold_uncertainty_score":0.99952865},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000062546187,0.00089649565,0.99068516,0.0008240827,0.0022225385,0.00044987618,0.0000026130776,0.00043722254,0.004475727],"genre_scores_gemma":[0.006764147,0.00012147615,0.9913565,0.00077210617,0.00038085904,0.000026020076,0.0000027610745,0.00004493405,0.00053120794],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576473,0.00010756599,0.0005249426,0.0017674303,0.001057833,0.0007774691],"domain_scores_gemma":[0.9953035,0.0013090776,0.00031218378,0.0027277176,0.00021051623,0.00013697808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002081634,0.0006187738,0.0005374255,0.00044153247,0.0003989253,0.00054183364,0.005346158,0.000302581,0.00000756083],"category_scores_gemma":[0.00053196657,0.00046559368,0.0001320442,0.0008831856,0.000889404,0.0007452659,0.0011257589,0.0014207476,0.000025027504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003481422,0.00002331632,0.000017820501,0.00006527516,0.000018149814,0.000068898866,0.0017544252,0.3783399,0.00042946351,0.14089972,0.000040354025,0.4783392],"study_design_scores_gemma":[0.00043919857,0.0001932001,0.00018962329,0.00066366594,0.000022077402,0.00059598376,0.0000024896412,0.2490822,0.005817589,0.7078234,0.032449484,0.0027210775],"about_ca_topic_score_codex":0.000004373218,"about_ca_topic_score_gemma":0.0000035669361,"teacher_disagreement_score":0.5669237,"about_ca_system_score_codex":0.00054909656,"about_ca_system_score_gemma":0.0003370419,"threshold_uncertainty_score":0.9997796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014306685,0.0013066625,0.9932889,0.0005362654,0.0024872983,0.002107965,0.000020033842,0.00013076706,0.00010780652],"genre_scores_gemma":[0.15212,0.000031173677,0.8463885,0.0007849177,0.0004364279,0.00012155248,0.000009426202,0.00004050247,0.00006747218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953684,0.00034132216,0.00089528324,0.001747493,0.00083063863,0.0008168537],"domain_scores_gemma":[0.9937849,0.004025445,0.0005842816,0.0010785358,0.0003339442,0.00019287737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0052876836,0.00056274736,0.00085016544,0.0010163513,0.00030813518,0.0006565937,0.0020951265,0.00032354024,0.000005551062],"category_scores_gemma":[0.0001744921,0.00051051955,0.00013204674,0.00047798228,0.00030345313,0.00047349258,0.0004352655,0.0003956303,0.0000037684215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027766144,0.0000087497,0.00003296882,0.0001055893,0.000024307199,0.000030070607,0.00029997394,0.75812876,0.000183984,0.014898956,0.000035419223,0.22622344],"study_design_scores_gemma":[0.0011230967,0.00035951388,0.000013498934,0.0002643051,0.000023558383,0.00010760785,5.983779e-7,0.9693545,0.000271462,0.026676245,0.0012798937,0.0005256837],"about_ca_topic_score_codex":0.000055960136,"about_ca_topic_score_gemma":0.00003032031,"teacher_disagreement_score":0.22569776,"about_ca_system_score_codex":0.00041789614,"about_ca_system_score_gemma":0.0006072086,"threshold_uncertainty_score":0.99973464},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010694848,0.00024179589,0.988757,0.002417527,0.00055114005,0.0004652462,0.000023961633,0.000032399596,0.0074039428],"genre_scores_gemma":[0.51796496,0.00006994642,0.4780196,0.003136164,0.00015870323,0.000009272583,0.000011915457,0.000017277813,0.0006121513],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99615556,0.0001374763,0.0010938386,0.00084507576,0.0013765434,0.00039151395],"domain_scores_gemma":[0.996137,0.0005053701,0.0009218567,0.0018962437,0.00048454796,0.00005495429],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011597914,0.0003631041,0.0006682853,0.00019354711,0.00020503376,0.00015563138,0.003501261,0.00015165748,0.000042940323],"category_scores_gemma":[0.00009977762,0.000271074,0.00022941476,0.0005495675,0.0011510161,0.0005277757,0.00091679423,0.00043961912,0.0000056819417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001397341,0.00033353394,0.00007198652,0.00029633602,0.000056700523,0.00000914241,0.0043389504,0.0072462424,0.03883668,0.37421444,0.0003702045,0.5742118],"study_design_scores_gemma":[0.00079957454,0.000526534,0.0037705307,0.0009797488,0.000031849435,0.000019002524,0.0000026131747,0.045601066,0.3578835,0.585194,0.00409582,0.0010957853],"about_ca_topic_score_codex":0.00010567668,"about_ca_topic_score_gemma":0.00005503743,"teacher_disagreement_score":0.573116,"about_ca_system_score_codex":0.0001583415,"about_ca_system_score_gemma":0.00067199755,"threshold_uncertainty_score":0.99997413},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015952175,0.00044279962,0.99656636,0.00013835443,0.0005409198,0.00038621583,0.0000016488669,0.00014815174,0.00018035069],"genre_scores_gemma":[0.70336527,0.00016844712,0.2959149,0.0002391752,0.00025142418,0.000007358853,0.00000322423,0.00004547737,0.000004704112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810624,0.0000126469695,0.00051162444,0.0004846639,0.00032480652,0.00056004303],"domain_scores_gemma":[0.9984812,0.0007794725,0.00010183823,0.00053707627,0.00005315232,0.000047242036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003759719,0.00036051337,0.00038822758,0.00030368663,0.000067168505,0.000056160992,0.0008055249,0.0006187925,0.000020242132],"category_scores_gemma":[0.00005145128,0.00028634904,0.00007054539,0.0004422585,0.00059944805,0.00012134485,0.0003087091,0.0019195256,0.0000020133432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024701112,0.0000054207167,0.000033464723,0.0000063252473,0.000004905062,0.000006359283,0.00003470645,0.7870999,0.000020840424,0.007146878,0.0000030530584,0.20563568],"study_design_scores_gemma":[0.00017322777,0.000051918076,0.00014904984,0.00029929084,0.000006277485,0.0000049208907,8.8972047e-7,0.9894413,0.00018601239,0.009383453,0.000026713275,0.000276959],"about_ca_topic_score_codex":0.0000048111747,"about_ca_topic_score_gemma":0.00016196088,"teacher_disagreement_score":0.70177007,"about_ca_system_score_codex":0.0003205588,"about_ca_system_score_gemma":0.000039597882,"threshold_uncertainty_score":0.9999589},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001944718,0.0014804106,0.9898459,0.0006238959,0.0038698814,0.00059389556,0.000010446323,0.00033382775,0.0030473145],"genre_scores_gemma":[0.31116557,0.0021783854,0.67496943,0.006183776,0.0035262557,0.000031398686,0.0001668645,0.00029018652,0.0014881126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913988,0.00012992155,0.0011417494,0.0039377725,0.0016402161,0.0017515055],"domain_scores_gemma":[0.9917359,0.0010262477,0.0005461672,0.0060782535,0.00027144927,0.0003420321],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013463417,0.001000995,0.0011035727,0.0015225295,0.0003879959,0.0013135119,0.0181011,0.00085246656,0.000019859895],"category_scores_gemma":[0.00013169374,0.0009818515,0.00013597032,0.0021231712,0.0011069113,0.0019409235,0.012045974,0.0020642027,0.000039469393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009242072,0.000049138238,0.00012226692,0.000019615773,0.000008609884,0.0005682176,0.00016965363,0.833309,0.0000062185686,0.00051489833,0.00026672927,0.16495639],"study_design_scores_gemma":[0.00047672348,0.00007888765,0.0001980686,0.00062591187,0.0000066298076,0.0002553905,1.0402966e-7,0.99284536,0.00009065228,0.0016971672,0.0026685505,0.0010565626],"about_ca_topic_score_codex":0.00015439403,"about_ca_topic_score_gemma":0.0008862375,"teacher_disagreement_score":0.3148764,"about_ca_system_score_codex":0.0005599294,"about_ca_system_score_gemma":0.0007238946,"threshold_uncertainty_score":0.9997232},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036698868,0.00074075535,0.99451804,0.00086896704,0.0013623049,0.00085397303,0.000020848724,0.00016487316,0.0014665748],"genre_scores_gemma":[0.0040826458,0.000011724979,0.9919456,0.00091741385,0.0015238677,0.00010768143,0.000075235635,0.000027690801,0.0013080986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696165,0.000016545586,0.0004975341,0.0013432618,0.0006918135,0.000489205],"domain_scores_gemma":[0.9977889,0.00053989084,0.0002495291,0.00084750756,0.00045694047,0.00011722099],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069457706,0.00038460176,0.0003447327,0.0007656028,0.00042120513,0.0005251448,0.0018799953,0.00018169562,0.000007770687],"category_scores_gemma":[0.00002783845,0.0003917919,0.00013887676,0.0006502004,0.0002271687,0.00044248087,0.00052089314,0.00034913287,0.000040382023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015783568,0.000024515111,0.0000033965061,0.000030006404,0.0000066813736,0.000004344093,0.000061144776,0.30070838,0.00014508294,0.06313461,0.0001820143,0.63569826],"study_design_scores_gemma":[0.0002679938,0.00006343184,0.000009336402,0.000067679845,0.0000074513064,0.000017360147,3.667474e-8,0.69768447,0.0009156209,0.27325577,0.027306188,0.00040463946],"about_ca_topic_score_codex":0.000018610413,"about_ca_topic_score_gemma":0.000040904284,"teacher_disagreement_score":0.6352936,"about_ca_system_score_codex":0.00022274807,"about_ca_system_score_gemma":0.00048081376,"threshold_uncertainty_score":0.9998534},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007723676,0.0008130893,0.9893247,0.002938479,0.0012096976,0.000575594,0.000007918007,0.0003692404,0.004684068],"genre_scores_gemma":[0.39691466,0.000020015152,0.5942612,0.0077451854,0.0006899606,0.000012921862,0.0000070927617,0.000064063446,0.0002849045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941249,0.00015555814,0.0005693405,0.002325111,0.0016104631,0.001214621],"domain_scores_gemma":[0.99554443,0.0010754704,0.00046897406,0.0021324113,0.00048274614,0.0002959804],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019508087,0.00095525914,0.0010708054,0.0010316173,0.00043386882,0.0011947522,0.0037799636,0.0005177496,0.0000104344235],"category_scores_gemma":[0.00012824654,0.0007639277,0.00026034037,0.0009890585,0.0007191921,0.00083035324,0.00027635533,0.001657026,0.000030841446],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042248517,0.000053780423,0.0008080022,0.000037668513,0.00003058752,0.00040136246,0.00025114405,0.044107407,0.00014389138,0.007826363,0.000034561843,0.94626296],"study_design_scores_gemma":[0.0061184834,0.0028228138,0.020557124,0.0034966532,0.00011804357,0.00080639037,5.010259e-7,0.6609371,0.006693111,0.27744636,0.014998959,0.0060044797],"about_ca_topic_score_codex":0.00002436027,"about_ca_topic_score_gemma":0.00009071855,"teacher_disagreement_score":0.9402585,"about_ca_system_score_codex":0.00030687376,"about_ca_system_score_gemma":0.0010646073,"threshold_uncertainty_score":0.9998421},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011669984,0.00021880523,0.98665124,0.00012123444,0.0009681608,0.00021741145,0.000013209824,0.000013272967,0.00012666553],"genre_scores_gemma":[0.97214854,0.00013091804,0.025509771,0.0007737594,0.0009411615,0.000016389402,0.00004735983,0.000035308858,0.00039677747],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998619,0.000013011896,0.00020298515,0.00073236466,0.00021749141,0.00021515026],"domain_scores_gemma":[0.9992131,0.000039634408,0.00012602522,0.0004727854,0.000070514405,0.00007793836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001893769,0.00023572372,0.00016431829,0.00015118797,0.0001365191,0.00011858692,0.00030222416,0.00034434895,0.000010459327],"category_scores_gemma":[0.00004615285,0.0002078855,0.000052089876,0.000072210714,0.00028183247,0.000014391882,0.00041665186,0.0003339837,0.0000027594608],"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.000033964774,0.000009321592,0.00007006854,0.000029028311,0.0000072299686,9.9093e-7,0.00007464668,0.0029020144,0.7905404,0.000005295354,0.0000096518625,0.20631741],"study_design_scores_gemma":[0.0007132382,0.00046365886,0.00077937,0.00021107896,0.000023238372,0.000077040204,9.531049e-7,0.07431097,0.8808727,0.0060907756,0.0355174,0.0009395387],"about_ca_topic_score_codex":0.000021624408,"about_ca_topic_score_gemma":0.00033962383,"teacher_disagreement_score":0.96114147,"about_ca_system_score_codex":0.00003737124,"about_ca_system_score_gemma":0.00009092763,"threshold_uncertainty_score":0.8477325},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013200734,0.00026934242,0.9906398,0.003363685,0.002255919,0.00056093896,0.00008103093,0.00026310163,0.002434172],"genre_scores_gemma":[0.05475781,0.000055868994,0.9385161,0.0050569135,0.00125703,0.000016977574,0.00009469854,0.000053081258,0.0001915607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99461716,0.000040260828,0.00040850218,0.0028433432,0.0012636589,0.0008270903],"domain_scores_gemma":[0.9932101,0.00048999133,0.00021882985,0.0055261217,0.0001839035,0.00037109022],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00078612444,0.00068946835,0.00056198816,0.0012644139,0.00033887126,0.0022859892,0.011887818,0.00029679533,0.000038814687],"category_scores_gemma":[0.0002152574,0.0005882962,0.00011343046,0.0010044284,0.00040107506,0.0018379171,0.006718883,0.0010002981,0.00015921915],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007304899,0.00004421931,0.000031710413,0.000037723737,0.000015108957,0.000077299504,0.00045342598,0.0017003245,0.00015330754,0.09864315,0.00078686734,0.8980496],"study_design_scores_gemma":[0.0004932536,0.00052689825,0.000617491,0.00093590096,0.000017302214,0.000098100594,3.422224e-7,0.5622832,0.0014137406,0.37168807,0.059653133,0.00227258],"about_ca_topic_score_codex":0.0000655767,"about_ca_topic_score_gemma":0.00015310285,"teacher_disagreement_score":0.895777,"about_ca_system_score_codex":0.00011529418,"about_ca_system_score_gemma":0.00023377266,"threshold_uncertainty_score":0.99965686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018092811,0.00034207935,0.9811378,0.00025699646,0.001918939,0.000411896,0.000023801775,0.00029169838,0.015435866],"genre_scores_gemma":[0.36597028,0.00022124713,0.62677556,0.0024007342,0.0019218981,0.000011165488,0.00008306723,0.00010107798,0.0025149568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99458426,0.00002944882,0.00059986574,0.002009559,0.0017725788,0.0010042957],"domain_scores_gemma":[0.9964354,0.00092306547,0.00031833502,0.001907405,0.00017774892,0.00023802744],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016236046,0.0007108617,0.0006740235,0.0026481356,0.00033563192,0.0012424614,0.00533132,0.00030973495,0.000023675402],"category_scores_gemma":[0.00013113685,0.0006283293,0.00014077123,0.002246396,0.00064313516,0.0012075348,0.0023320531,0.00091044157,0.00016754436],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002841374,0.00003210958,0.0005117489,0.000025680787,0.00002061602,0.00020571066,0.00020724056,0.0045319335,0.000006720481,0.013732593,0.000096878255,0.9806259],"study_design_scores_gemma":[0.0022338626,0.0043505686,0.02508949,0.0034325905,0.0001475869,0.0001181484,0.0000035441358,0.53598726,0.007055468,0.3356869,0.075495705,0.010398923],"about_ca_topic_score_codex":0.000034224653,"about_ca_topic_score_gemma":0.000060082817,"teacher_disagreement_score":0.970227,"about_ca_system_score_codex":0.00025536705,"about_ca_system_score_gemma":0.00025351127,"threshold_uncertainty_score":0.99979436},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001951963,0.00032004944,0.995906,0.00034291242,0.0012188246,0.00074658147,0.0000034034417,0.00016213824,0.0012805903],"genre_scores_gemma":[0.5189835,0.00005687202,0.4791688,0.0011679623,0.00042669085,0.000034335437,0.000010914446,0.00003716522,0.00011378655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572057,0.000035442907,0.0007835117,0.0017185934,0.0007557106,0.000986169],"domain_scores_gemma":[0.9970556,0.0009110965,0.0003260722,0.0011468319,0.00035616625,0.00020424834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018859907,0.0005739158,0.00057108916,0.0010130277,0.0002005973,0.0005481004,0.0028362793,0.00056103565,0.0000067713663],"category_scores_gemma":[0.0002111803,0.0005470071,0.0001234927,0.0008650248,0.00040979037,0.0006765654,0.00064824015,0.0010442719,0.0000101723945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010034422,0.0000292652,0.00008385131,0.000049234462,0.0000036320685,0.00003676571,0.00034270817,0.16312675,0.000022677716,0.083019264,0.0000064880255,0.7532693],"study_design_scores_gemma":[0.00022151231,0.00015645099,0.00007905813,0.0005301536,0.0000031963418,0.000010760367,9.152925e-8,0.7820716,0.0001248756,0.21616717,0.00012291809,0.0005122155],"about_ca_topic_score_codex":0.00003606214,"about_ca_topic_score_gemma":0.00027638566,"teacher_disagreement_score":0.75275713,"about_ca_system_score_codex":0.00036610823,"about_ca_system_score_gemma":0.0007335245,"threshold_uncertainty_score":0.99969816},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016516287,0.00034998677,0.99336815,0.00042537096,0.0034536032,0.0010029008,0.000012428206,0.00020195873,0.0010204539],"genre_scores_gemma":[0.013607578,0.000009352675,0.9851412,0.0006944644,0.0003815931,0.000033652574,0.000008446368,0.0000315941,0.00009212918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958683,0.000100649915,0.0008394554,0.001476272,0.0012036484,0.0005116304],"domain_scores_gemma":[0.99637777,0.00068235525,0.0004031252,0.0020841004,0.00023216564,0.00022050536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017829629,0.0004972732,0.0006545973,0.00082325295,0.00023278169,0.0006452391,0.0041130167,0.00045121223,0.000023961466],"category_scores_gemma":[0.00029074115,0.00045070268,0.00014294537,0.0005467777,0.00028678885,0.000823455,0.0005860868,0.00089604175,0.00027099266],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012131389,0.00004756546,0.000014956589,0.0011497808,0.000031770072,0.000033150765,0.004481918,0.0138555365,0.0054676044,0.06552024,0.000006446818,0.9093789],"study_design_scores_gemma":[0.00022259867,0.00017224053,0.00017711226,0.0046708654,0.000025817346,0.000037050137,2.9478912e-7,0.72738796,0.011576074,0.25388557,0.0008208923,0.0010235145],"about_ca_topic_score_codex":0.000033081997,"about_ca_topic_score_gemma":0.00008965578,"teacher_disagreement_score":0.90835536,"about_ca_system_score_codex":0.00022778778,"about_ca_system_score_gemma":0.00029824243,"threshold_uncertainty_score":0.9997945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009931877,0.00022094797,0.9937271,0.0027052977,0.00071270776,0.0006531152,0.000004551568,0.00019714056,0.0016798142],"genre_scores_gemma":[0.44387397,0.000057088462,0.5530033,0.000705137,0.00033190244,0.00009466514,0.000013631555,0.000030809017,0.0018894593],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975155,0.000022984279,0.00050242175,0.00095872366,0.00065320695,0.00034717732],"domain_scores_gemma":[0.9974409,0.0006498548,0.000494964,0.0010562814,0.00032406437,0.00003399021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059753336,0.00028014893,0.000302001,0.00056745217,0.0002533799,0.0003038354,0.002527498,0.00021425833,0.0000064539227],"category_scores_gemma":[0.00014522678,0.00020959035,0.0001259356,0.00089012657,0.00073345425,0.0005336713,0.0005253655,0.00034253058,0.000006410556],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008364235,0.000030909967,0.00016747008,0.00003304829,0.000010077406,0.0000016855722,0.0003681072,0.015621447,0.0011033429,0.1354791,0.00054205756,0.8466344],"study_design_scores_gemma":[0.00025084184,0.00017198159,0.0004030835,0.000106774256,0.000010953891,0.000018619674,0.0000012439244,0.3961002,0.018771222,0.58154297,0.0022685374,0.00035359664],"about_ca_topic_score_codex":0.000035141984,"about_ca_topic_score_gemma":0.000064622065,"teacher_disagreement_score":0.8462808,"about_ca_system_score_codex":0.000154317,"about_ca_system_score_gemma":0.00023867296,"threshold_uncertainty_score":0.85468465},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017743051,0.0027626164,0.98593885,0.0064674877,0.0020245682,0.0020307847,0.0000060375287,0.00029309405,0.000299121],"genre_scores_gemma":[0.65687567,0.00026308955,0.33927512,0.001915195,0.0013693277,0.00018513549,0.0000030181927,0.000060623697,0.000052842057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938974,0.00014775762,0.0010091258,0.0023255819,0.0016196141,0.0010005314],"domain_scores_gemma":[0.985559,0.01158117,0.00041100383,0.0018367002,0.00025421905,0.0003579067],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.004275492,0.00073664146,0.0010027731,0.0005004584,0.00056736433,0.0010394516,0.0055377535,0.00048313904,0.0000068748873],"category_scores_gemma":[0.0019265892,0.00051905744,0.00025795776,0.00067663426,0.0027142498,0.0004308474,0.0027922143,0.0010787864,0.000017653501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021011278,0.00004645679,0.000038128863,0.00021359799,0.000026897607,0.00009505987,0.0012935752,0.008561359,0.0000010253207,0.15711732,0.000009360682,0.8325762],"study_design_scores_gemma":[0.0005361017,0.00019459914,0.00006202001,0.0010004088,0.000026219584,0.0005322591,6.635308e-7,0.84401274,0.00010767007,0.15257235,0.00038036754,0.0005745756],"about_ca_topic_score_codex":0.000043074153,"about_ca_topic_score_gemma":0.000095496674,"teacher_disagreement_score":0.8354514,"about_ca_system_score_codex":0.0005769784,"about_ca_system_score_gemma":0.0009719972,"threshold_uncertainty_score":0.9999998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012818019,0.010620459,0.9818451,0.00043131452,0.003055275,0.0020480142,0.000019533698,0.0004042943,0.0015632161],"genre_scores_gemma":[0.023629513,0.00046483878,0.96562725,0.003985958,0.0037577238,0.00049274554,0.00007886734,0.00022299647,0.0017400872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936005,0.000051020266,0.0008380439,0.00283419,0.0011218776,0.0015543863],"domain_scores_gemma":[0.99514216,0.0010742134,0.00050778565,0.002613025,0.0003571185,0.00030570975],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009798143,0.0010503159,0.0009769369,0.00076089153,0.00043556685,0.000871774,0.005811488,0.0009083445,0.000022487848],"category_scores_gemma":[0.000043387594,0.0009663155,0.00040831615,0.00093861244,0.00080586615,0.0004790964,0.001807302,0.0017489752,0.000021013904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000855391,0.000020724343,0.0000029169057,0.000030076066,0.000009852425,0.000039904953,0.00015614757,0.4667177,0.0000070296146,0.003422374,0.0006692579,0.52891546],"study_design_scores_gemma":[0.00045202725,0.00045608872,0.000013609321,0.00037605752,0.00001579589,0.00010112575,6.9275536e-8,0.76461864,0.00006755282,0.13110813,0.101750515,0.0010403738],"about_ca_topic_score_codex":0.000005758833,"about_ca_topic_score_gemma":0.000239212,"teacher_disagreement_score":0.52787507,"about_ca_system_score_codex":0.00040506895,"about_ca_system_score_gemma":0.00057618564,"threshold_uncertainty_score":0.99956757},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036947767,0.0004095544,0.9961687,0.00020675117,0.00064180227,0.00026328416,0.000052191936,0.00043621717,0.0014520211],"genre_scores_gemma":[0.04315763,0.00022460292,0.95481956,0.00074841676,0.0005732838,0.0000047460007,0.00011640587,0.000057140664,0.00029818612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994004,0.000088535744,0.00080192933,0.0030791266,0.0011892122,0.0008372067],"domain_scores_gemma":[0.9932417,0.00024298207,0.00043530815,0.005548804,0.00022542711,0.00030576822],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016240664,0.0007124335,0.000753525,0.0014295954,0.0004002122,0.0014029559,0.010207152,0.00035722824,0.00007565146],"category_scores_gemma":[0.00011284788,0.00065199554,0.00012731331,0.0010430169,0.0005817767,0.0017447063,0.0054860627,0.000764,0.00003894021],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022751997,0.00006180655,0.000096293166,0.00002453566,0.000033297747,0.00022789938,0.0005709143,0.0025097388,0.0005522153,0.0004998196,0.000054371645,0.9953668],"study_design_scores_gemma":[0.00008420597,0.00015157643,0.000011839372,0.00057055283,0.00003818266,0.000108711094,5.950988e-7,0.9895432,0.0016180688,0.002586162,0.0044858586,0.00080102],"about_ca_topic_score_codex":0.00008435656,"about_ca_topic_score_gemma":0.0000975199,"teacher_disagreement_score":0.9945658,"about_ca_system_score_codex":0.0003086696,"about_ca_system_score_gemma":0.00042440149,"threshold_uncertainty_score":0.99963367},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005201823,0.00035031617,0.93617904,0.0005430396,0.0014514682,0.001290951,0.000012510293,0.00068121677,0.059486285],"genre_scores_gemma":[0.02518036,0.00011899659,0.96357375,0.0028800122,0.001208245,0.00016168976,0.000018453891,0.0001446311,0.0067138723],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948453,0.000055327982,0.0008657906,0.0021783684,0.0010100205,0.0010452153],"domain_scores_gemma":[0.995513,0.0009237158,0.0005042214,0.002352436,0.00046118282,0.00024543636],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019962697,0.0007291103,0.00086692447,0.001139557,0.00032427863,0.0007909734,0.005386028,0.0005981483,0.000046641235],"category_scores_gemma":[0.00014701107,0.0006945982,0.00025445002,0.00058598816,0.000534,0.00087382854,0.00044219327,0.0007521446,0.00010874071],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000138111955,0.00004391361,0.000026252677,0.00014144865,0.000025480074,0.00013456642,0.00060983305,0.0012766882,0.00096311787,0.07058826,0.0021793996,0.9239972],"study_design_scores_gemma":[0.0005155662,0.00053694303,0.000013883573,0.0010979284,0.000012137266,0.00050800113,1.610659e-7,0.18650132,0.024325265,0.73167855,0.053223938,0.0015863073],"about_ca_topic_score_codex":0.000044052173,"about_ca_topic_score_gemma":0.000055850087,"teacher_disagreement_score":0.9224109,"about_ca_system_score_codex":0.0005501101,"about_ca_system_score_gemma":0.000699272,"threshold_uncertainty_score":0.9999953},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015084959,0.00060504,0.9920515,0.0013535183,0.00089705247,0.00030938408,0.000018180895,0.00009334267,0.0046569225],"genre_scores_gemma":[0.023723586,0.00012147573,0.97306657,0.002226714,0.00019383192,0.00001889941,0.000034594144,0.000032296426,0.0005820282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592716,0.000050119754,0.000537036,0.0020111084,0.0008377563,0.0006367997],"domain_scores_gemma":[0.9960083,0.000512688,0.00022327586,0.002976995,0.00011851923,0.00016024327],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014630429,0.00039850138,0.00039175065,0.000860636,0.0002639619,0.00035807787,0.0071062776,0.00027299108,0.00001868929],"category_scores_gemma":[0.00010880719,0.00040239538,0.000053396143,0.001243388,0.0005866443,0.0011011689,0.0024821379,0.0009997068,0.000048771537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027915864,0.000084592146,0.00024238549,0.000023159067,0.000009907824,0.00014289738,0.00035032677,0.019209052,0.000044260418,0.3454045,0.00021107277,0.634275],"study_design_scores_gemma":[0.00021627119,0.000043985077,0.00032090346,0.00019813735,0.0000037010848,0.00008239589,3.1082416e-7,0.6307813,0.00004274982,0.3600271,0.007766411,0.000516721],"about_ca_topic_score_codex":0.000023319693,"about_ca_topic_score_gemma":0.0001745475,"teacher_disagreement_score":0.6337583,"about_ca_system_score_codex":0.0003008123,"about_ca_system_score_gemma":0.00065961474,"threshold_uncertainty_score":0.99984276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033936405,0.000314165,0.9869749,0.0032884513,0.0017175957,0.0005691704,0.0000037372333,0.0059151975,0.0011828335],"genre_scores_gemma":[0.052955218,0.000013862149,0.944983,0.00096839387,0.00057043426,0.000039053368,0.0000074951495,0.00006007614,0.00040244372],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951881,0.000043260803,0.0005544587,0.0023288256,0.0011788767,0.00070644077],"domain_scores_gemma":[0.9947919,0.0010519901,0.0003798362,0.00329351,0.00027863056,0.00020409384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010890272,0.0006921342,0.0005577114,0.0010396286,0.0004321059,0.0007678309,0.0047510685,0.0004575122,0.00001671293],"category_scores_gemma":[0.0008981464,0.0006080346,0.00014636431,0.00082685455,0.000851738,0.0004419968,0.0010822733,0.0016711652,0.00007101653],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006145495,0.00005479601,0.00007516827,0.00004667971,0.000006993989,0.000029015164,0.0005724704,0.0017387033,0.000057504545,0.017639896,0.00033190864,0.97944075],"study_design_scores_gemma":[0.00017525915,0.0002182481,0.0001111571,0.00057996414,0.000008268505,0.000083835694,2.8525916e-8,0.080434985,0.0056834365,0.9095946,0.0021242534,0.0009859591],"about_ca_topic_score_codex":0.000016080498,"about_ca_topic_score_gemma":0.000012582112,"teacher_disagreement_score":0.97845477,"about_ca_system_score_codex":0.00021276734,"about_ca_system_score_gemma":0.00057763216,"threshold_uncertainty_score":0.9996371},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008240839,0.00069144444,0.9968609,0.000357612,0.0005123222,0.00070548314,0.0000046287246,0.00041016293,0.00037501974],"genre_scores_gemma":[0.10789998,0.00012969367,0.889557,0.0012676603,0.0005156111,0.000032569635,0.000008285701,0.000053078573,0.0005361127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645627,0.000044775643,0.000581192,0.0015270239,0.0006276585,0.00076306413],"domain_scores_gemma":[0.9980297,0.00044682078,0.00032251212,0.00082968164,0.0002496383,0.00012163831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009721388,0.0005084228,0.0005650157,0.0010863318,0.00025149956,0.00023369219,0.0018284817,0.00038404184,0.000004423107],"category_scores_gemma":[0.00029867562,0.0005037234,0.00017102419,0.0009854977,0.00035153935,0.0008844053,0.0003771486,0.0012969491,0.000009070151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023703087,0.000029425617,0.000024086721,0.0000440772,0.000002772663,0.00001880083,0.00008021266,0.12359468,0.0007210241,0.00030861024,0.0000027705373,0.87514985],"study_design_scores_gemma":[0.00045650426,0.000389632,0.00007524947,0.00057340506,0.000004264896,0.00001532695,1.6090206e-7,0.94047177,0.027004166,0.019652069,0.010760964,0.0005964796],"about_ca_topic_score_codex":0.00001591354,"about_ca_topic_score_gemma":0.00017943312,"teacher_disagreement_score":0.8745534,"about_ca_system_score_codex":0.0005290868,"about_ca_system_score_gemma":0.0004461606,"threshold_uncertainty_score":0.99974144},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014254783,0.0005520137,0.99341136,0.000032174183,0.0014316742,0.0033336596,0.00000460579,0.0003674521,0.0007244838],"genre_scores_gemma":[0.24906027,0.000012955716,0.7489699,0.00041071963,0.00092074694,0.00050356815,0.000018067212,0.000066177534,0.00003758702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99428076,0.00006574603,0.0009171762,0.0025377378,0.00094415765,0.0012544208],"domain_scores_gemma":[0.9953778,0.0011310478,0.00066742,0.0020821793,0.00045120125,0.00029039197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002604627,0.00074236625,0.0007950931,0.00056297774,0.00068077137,0.0008533139,0.003609842,0.00051138795,0.000010036678],"category_scores_gemma":[0.000036450365,0.0007375795,0.00020823261,0.0007836879,0.00027009237,0.0006465441,0.0011231775,0.0008586168,0.000011436577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034121929,0.000021702137,0.000005229436,0.000030362273,0.0000047490553,0.0000035002927,0.00042552172,0.54033935,0.00012035073,0.019336443,9.433998e-7,0.4397084],"study_design_scores_gemma":[0.0003756214,0.0003978866,0.000006006735,0.0004042977,0.000013981604,0.000029231698,6.119949e-7,0.8810907,0.0011112257,0.11506487,0.0007914408,0.0007141413],"about_ca_topic_score_codex":0.000064568194,"about_ca_topic_score_gemma":0.00008438035,"teacher_disagreement_score":0.43899426,"about_ca_system_score_codex":0.0009176,"about_ca_system_score_gemma":0.0008677597,"threshold_uncertainty_score":0.99950755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002606801,0.00020429635,0.9811718,0.0007622289,0.0006940329,0.00030657274,0.0000045807865,0.00016696737,0.016663477],"genre_scores_gemma":[0.38264897,0.000074816584,0.61612403,0.00069416,0.00017421131,0.000009135598,0.000006591111,0.000022696893,0.00024538746],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723625,0.00006147242,0.00036871422,0.0009933601,0.0008054419,0.0005347851],"domain_scores_gemma":[0.9981458,0.00044769075,0.00029439433,0.0006966382,0.00023460739,0.00018085979],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008022956,0.00041626507,0.00037210158,0.00066734455,0.000224016,0.000438082,0.0013337018,0.00017818125,0.00014705208],"category_scores_gemma":[0.000037368343,0.0003425628,0.000060408154,0.0004673969,0.0014443157,0.00096822984,0.0004154545,0.0005553716,0.0000511506],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034788952,0.000009944886,0.000064561245,0.000017212707,0.000012265704,0.000014965661,0.004811268,0.0081208,0.000007928984,0.049242396,0.0000036590145,0.9376915],"study_design_scores_gemma":[0.0011815111,0.0005526772,0.0009765758,0.0016292644,0.000046485762,0.00044918244,0.000024743575,0.40468892,0.0011896163,0.5849626,0.0014013114,0.0028970737],"about_ca_topic_score_codex":0.000012522507,"about_ca_topic_score_gemma":0.00009794063,"teacher_disagreement_score":0.9347944,"about_ca_system_score_codex":0.00018996572,"about_ca_system_score_gemma":0.00048557034,"threshold_uncertainty_score":0.99990267},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1577797,0.00010010457,0.84173864,0.00003446064,0.00012111106,0.00004673956,6.6947604e-7,0.000051771975,0.00012680824],"genre_scores_gemma":[0.8377572,8.0127575e-7,0.16217321,0.000013062948,0.000047963327,0.000002532722,7.7296244e-7,0.0000043536693,1.3842461e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944663,0.0000024882277,0.00014346029,0.00012529358,0.00012656808,0.00015553058],"domain_scores_gemma":[0.99970764,0.000071365976,0.000018294466,0.00015972274,0.000022923781,0.000020056095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076031654,0.000061037936,0.000100012374,0.00011200293,0.000041713913,0.000030810068,0.00023392332,0.000025115387,0.0000018143095],"category_scores_gemma":[0.0000043815053,0.00005909188,0.0000163915,0.0006561877,0.00007597204,0.0000850674,0.000041479063,0.00007751904,0.0000015432108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.319979e-7,0.000013877141,0.002567478,0.0000058211717,5.010628e-7,1.5069493e-7,0.00020321402,0.97329706,0.005296893,0.001054735,0.000007890496,0.017552262],"study_design_scores_gemma":[0.000042453965,0.0000067426286,0.0017313855,0.000012832806,9.49189e-7,8.796008e-7,5.4178497e-7,0.9488268,0.03276927,0.01653849,0.000008398174,0.000061273946],"about_ca_topic_score_codex":0.00003622205,"about_ca_topic_score_gemma":0.000018924748,"teacher_disagreement_score":0.6799775,"about_ca_system_score_codex":0.00003123307,"about_ca_system_score_gemma":0.00001238943,"threshold_uncertainty_score":0.24096969},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011571287,0.00009645095,0.99423856,0.00069463754,0.00019487385,0.0005647353,0.0000061417745,0.00008267746,0.004110346],"genre_scores_gemma":[0.07346183,0.000079653335,0.9243825,0.0012637074,0.000090271285,0.000011029512,0.0000074326003,0.000029030394,0.00067455217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695307,0.000028801554,0.00042521878,0.0011479431,0.0009410725,0.00050386885],"domain_scores_gemma":[0.9974945,0.00055564614,0.0002643009,0.001088246,0.00039806654,0.00019920962],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052889826,0.00036302346,0.00045928886,0.0005353298,0.00018041291,0.00017385876,0.0022418746,0.00018913829,0.000008615106],"category_scores_gemma":[0.000058218062,0.00028848572,0.000076762895,0.00048399772,0.00049556966,0.0004952516,0.00043560922,0.00048040538,0.000004347542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017926015,0.000020913089,0.0000037478246,0.000034842444,0.0000059552767,0.000008278338,0.00053867005,0.72052824,0.000007792401,0.10199192,0.00007160335,0.17677009],"study_design_scores_gemma":[0.00032907526,0.00036080473,0.000004754882,0.0003157835,0.000002213012,0.0000130869485,6.7697485e-8,0.78205925,0.0003383001,0.21585347,0.00043340967,0.00028975398],"about_ca_topic_score_codex":0.000054460153,"about_ca_topic_score_gemma":0.00005712646,"teacher_disagreement_score":0.17648034,"about_ca_system_score_codex":0.00014799666,"about_ca_system_score_gemma":0.0011429507,"threshold_uncertainty_score":0.9999567},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49395236,0.000006811068,0.5051868,0.000504887,0.000081860875,0.0002470247,5.6881765e-7,0.000016080998,0.0000036105757],"genre_scores_gemma":[0.955473,7.9612107e-7,0.04070442,0.0037275783,0.00005945801,0.00002850361,6.847201e-7,0.0000052714536,2.9178275e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856895,0.00008425683,0.00016257833,0.00062133465,0.00030632265,0.0002565609],"domain_scores_gemma":[0.99930733,0.00028617677,0.000046949146,0.0002789334,0.000023037222,0.000057572957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038434044,0.00011040911,0.000085431,0.00029777997,0.00020319941,0.0001388436,0.0004183789,0.00003437109,0.0000013244487],"category_scores_gemma":[0.000101716025,0.00008124842,0.000011152973,0.0021901748,0.00009992278,0.0002952053,0.000086724656,0.0001306369,0.0000033827785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011306673,0.000040120674,0.00026242342,0.0000057238967,3.537797e-8,0.0000031213667,0.00031628087,0.5237066,0.13382667,0.000125342,4.6540134e-7,0.34170187],"study_design_scores_gemma":[0.00017122763,0.000040238097,0.0017996394,0.000017611575,4.6425527e-7,0.000006577547,6.4225134e-7,0.6411699,0.34829155,0.008431375,3.019142e-7,0.00007046966],"about_ca_topic_score_codex":0.000029020439,"about_ca_topic_score_gemma":0.00013946721,"teacher_disagreement_score":0.46448237,"about_ca_system_score_codex":0.00005106316,"about_ca_system_score_gemma":0.00004087113,"threshold_uncertainty_score":0.33132145},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000025250565,0.0006389489,0.9920784,0.0010042625,0.0026257066,0.0008579518,0.0000037906282,0.00008069057,0.0027077133],"genre_scores_gemma":[0.00082657643,0.00006931647,0.99374366,0.0008425864,0.00021437221,0.000022151853,0.0000049454616,0.000019635625,0.0042567328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975854,0.00005010332,0.00034656614,0.0012660819,0.00035218516,0.0003996301],"domain_scores_gemma":[0.99817866,0.0003975249,0.00025753578,0.0008655137,0.0001299411,0.00017084967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007705486,0.0003833331,0.0003849462,0.0005506289,0.00023774049,0.0005189462,0.001261918,0.00019167435,0.000011161096],"category_scores_gemma":[0.00004252408,0.00033996147,0.00009309747,0.0003073606,0.00010377744,0.0005417564,0.00053880323,0.00039056037,0.0000069267717],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027152062,0.000008800395,0.0000094683965,0.00006390562,0.000016708838,0.000004029907,0.0003574232,0.00078149774,0.00009718079,0.046470635,0.00041531067,0.95177233],"study_design_scores_gemma":[0.0009557646,0.00024047241,0.000553299,0.0009111478,0.00004801363,0.000121522535,5.8680047e-7,0.5487453,0.0023835127,0.28530565,0.15941004,0.0013247137],"about_ca_topic_score_codex":0.000016489243,"about_ca_topic_score_gemma":0.000042871154,"teacher_disagreement_score":0.9504476,"about_ca_system_score_codex":0.0001732244,"about_ca_system_score_gemma":0.00012945362,"threshold_uncertainty_score":0.9999052},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005272213,0.00021456389,0.9913431,0.0003012194,0.0003473514,0.00033600227,0.000022699442,0.00032731664,0.006580566],"genre_scores_gemma":[0.1910066,0.000007274868,0.80734247,0.0011199387,0.0002948264,0.000013191018,0.000026372585,0.00005598234,0.00013337386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577725,0.000068596775,0.00043190128,0.0018969515,0.000941874,0.00088342547],"domain_scores_gemma":[0.9961787,0.0014288563,0.00040531863,0.0015673185,0.00019198873,0.00022781028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007487259,0.0006965472,0.0005645158,0.00080573244,0.0007247849,0.00061085314,0.0020259686,0.00022024105,0.000047406316],"category_scores_gemma":[0.00009612097,0.00059376506,0.00009403323,0.0008158241,0.0005232536,0.0010468,0.0005137246,0.0013336794,0.000022980368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031697546,0.00002144313,0.000081917555,0.00004085484,0.000017111288,0.0030764777,0.00079335796,0.17282891,0.000024016208,0.003198123,0.00001376183,0.8198723],"study_design_scores_gemma":[0.0005856973,0.00039168453,0.00005338521,0.003562305,0.000019778105,0.002492129,0.0000010254438,0.97628057,0.0043189027,0.0075985244,0.0031952085,0.0015007788],"about_ca_topic_score_codex":0.00023731145,"about_ca_topic_score_gemma":0.00013898504,"teacher_disagreement_score":0.81837153,"about_ca_system_score_codex":0.00029734167,"about_ca_system_score_gemma":0.0011950562,"threshold_uncertainty_score":0.9996514},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023998415,0.00034406348,0.9960002,0.0006900139,0.0014101929,0.00045835527,0.000027740196,0.00015279984,0.00089266535],"genre_scores_gemma":[0.05763238,0.000024565443,0.93863493,0.00076626346,0.0025859782,0.00007801822,0.000045401724,0.00004777919,0.00018467623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678415,0.000016626127,0.00046338217,0.0013150154,0.0005517495,0.0008690747],"domain_scores_gemma":[0.99780595,0.00054930977,0.00030460596,0.000976784,0.00017773987,0.00018561065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009607954,0.00043824993,0.0004485928,0.00035036806,0.00061617454,0.0006225276,0.0031805756,0.00031517338,0.000013293085],"category_scores_gemma":[0.000040625946,0.000416843,0.00014522867,0.00046629863,0.000511011,0.0006094965,0.0010816104,0.000487615,0.000016348706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019490094,0.000023682225,0.000008112975,0.000013720153,0.000008548124,0.0000045780725,0.0008588299,0.0023265216,0.0000246722,0.06380815,0.00024869115,0.93267256],"study_design_scores_gemma":[0.00022626578,0.00009667615,0.00008512113,0.00010448919,0.00001582265,0.000019356514,7.9033805e-7,0.9439571,0.0001332386,0.041151,0.013504369,0.00070577074],"about_ca_topic_score_codex":0.0000078045405,"about_ca_topic_score_gemma":0.000011052347,"teacher_disagreement_score":0.9416306,"about_ca_system_score_codex":0.00016420362,"about_ca_system_score_gemma":0.000249669,"threshold_uncertainty_score":0.99982834},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034962576,0.0040712883,0.9910532,0.000022579461,0.0005475724,0.00014606609,0.000075602955,0.0000956272,0.0004918028],"genre_scores_gemma":[0.19679457,0.00038274255,0.8022828,0.00018219974,0.00014564572,8.031743e-7,0.0000981799,0.000062317595,0.00005074307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975007,0.000022787628,0.00040385238,0.00112516,0.0005192029,0.0004282919],"domain_scores_gemma":[0.9980636,0.0004064553,0.00009443149,0.0012371046,0.00007039174,0.00012798807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006371477,0.0004392168,0.0006195867,0.0012678864,0.00012398527,0.00032331073,0.0010258915,0.0002906462,0.000020794701],"category_scores_gemma":[0.00013255206,0.0004226776,0.00007045806,0.0016181758,0.00018052601,0.00029425035,0.0004886329,0.00066070963,0.000007756211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019324689,0.000009318209,0.000045340374,0.000029833274,0.000041210966,0.000008983914,0.000035821144,0.90941674,0.00001770654,0.0000036053434,0.000017552875,0.09037195],"study_design_scores_gemma":[0.00017487453,0.000025006095,0.000013301646,0.000119593824,0.00006395259,0.000012915866,1.8603227e-7,0.9948883,0.00005008633,0.004123543,0.000053399428,0.00047483816],"about_ca_topic_score_codex":0.00009680905,"about_ca_topic_score_gemma":0.000016471904,"teacher_disagreement_score":0.19329831,"about_ca_system_score_codex":0.0001907397,"about_ca_system_score_gemma":0.000083582505,"threshold_uncertainty_score":0.9998225},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001278889,0.00044903185,0.75580746,0.0034475657,0.0017932429,0.0009846318,0.000005516268,0.00041461436,0.23581907],"genre_scores_gemma":[0.80120414,0.00009239335,0.19597642,0.000760541,0.00033658533,0.000031923944,0.000042687032,0.00002373125,0.0015315489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981793,0.00007219686,0.00050788734,0.00032919765,0.000558436,0.00035299294],"domain_scores_gemma":[0.99837744,0.0005567661,0.0002755967,0.00055516657,0.00016292286,0.00007211215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009169733,0.00018250104,0.00023147406,0.0008044042,0.0005671391,0.00024977824,0.001051197,0.0004933791,0.000044488916],"category_scores_gemma":[0.0003830427,0.00019590268,0.000052296386,0.00055823446,0.001597568,0.00060969254,0.00027799341,0.00076913665,0.00007619264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007804667,0.000062954416,0.0043389183,0.00002160638,0.00000728204,0.000021791777,0.02861342,0.018728064,0.000045927616,0.04758582,0.00029515076,0.90027124],"study_design_scores_gemma":[0.0007960133,0.00006736013,0.0041742376,0.0005758704,0.000013125658,0.0000129509435,0.000020389007,0.71258277,0.00017244309,0.06367154,0.21689908,0.001014221],"about_ca_topic_score_codex":0.0022475119,"about_ca_topic_score_gemma":0.005296031,"teacher_disagreement_score":0.89925706,"about_ca_system_score_codex":0.0005314069,"about_ca_system_score_gemma":0.0008753377,"threshold_uncertainty_score":0.79886794},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.263468,0.000046745707,0.7353422,0.00019696915,0.0005558985,0.00027634553,0.0000010705663,0.00004882548,0.00006393101],"genre_scores_gemma":[0.5895921,0.000001078576,0.40972528,0.00046284628,0.00020352524,0.0000033765225,0.000004349607,0.000005622604,0.0000018378901],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99873316,0.000008252521,0.00020034182,0.000390361,0.00026102344,0.00040688747],"domain_scores_gemma":[0.9985395,0.0009229097,0.00004631625,0.00025332387,0.00013193338,0.00010603519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008430958,0.00011570025,0.0001454418,0.00031312997,0.00014126033,0.00006270836,0.0001525818,0.000045502053,0.000007935286],"category_scores_gemma":[0.00074789865,0.000095955096,0.000054706306,0.0010739969,0.00032934878,0.00013369994,0.000021967862,0.00017124215,0.0000092169585],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015733237,0.00030061236,0.22533472,0.000117308264,0.0000142001145,0.000008432593,0.0020684125,0.018277917,0.028814388,0.00013902884,0.00004795388,0.7247197],"study_design_scores_gemma":[0.0025435942,0.0012429389,0.66834515,0.00038924228,0.00007146934,0.0007457758,0.0000067846017,0.28273422,0.015143898,0.023844248,0.0042394344,0.0006932431],"about_ca_topic_score_codex":0.000017413642,"about_ca_topic_score_gemma":0.00004843092,"teacher_disagreement_score":0.72402644,"about_ca_system_score_codex":0.000099113175,"about_ca_system_score_gemma":0.00010556264,"threshold_uncertainty_score":0.39129353},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035759775,0.00025515084,0.96126866,0.0007033564,0.0012111177,0.00024826225,0.000008286486,0.00018314592,0.035764392],"genre_scores_gemma":[0.2729057,0.0000897437,0.7046025,0.0021763984,0.001675208,0.000009877119,0.000007935289,0.00013779984,0.018394848],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975628,0.000020120075,0.00041254103,0.0008106612,0.00065251713,0.0005413208],"domain_scores_gemma":[0.9974896,0.0012016796,0.00022071355,0.0008614853,0.000105668514,0.000120874516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005147438,0.0003776159,0.0005229556,0.0007995896,0.00014323762,0.00010676149,0.0011561648,0.00036702526,0.0006201371],"category_scores_gemma":[0.0004590371,0.00032888123,0.00010759606,0.0004756304,0.00073568855,0.00012348006,0.00057230983,0.00068449584,0.00015531818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007862964,0.00013772602,0.00007144496,0.00022593571,0.000047280493,0.00036694793,0.0011151102,0.0006939498,0.000026856991,0.40030584,0.0012590387,0.59574205],"study_design_scores_gemma":[0.00026127943,0.000120706165,0.000048460755,0.0001616726,0.000022462847,0.00016877631,1.7570447e-7,0.024139252,0.00007242151,0.9684329,0.0060974457,0.00047444875],"about_ca_topic_score_codex":0.000007942232,"about_ca_topic_score_gemma":0.000015935064,"teacher_disagreement_score":0.5952676,"about_ca_system_score_codex":0.00013897095,"about_ca_system_score_gemma":0.00013194152,"threshold_uncertainty_score":0.9999163},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058115493,0.0001756575,0.9973528,0.00032074464,0.00058631157,0.00026405198,0.0000053550957,0.00013041137,0.0011065857],"genre_scores_gemma":[0.06251841,0.000045773715,0.935743,0.0008319567,0.0002994085,0.000009264687,0.00006268599,0.000033784683,0.00045571895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996123,0.000062649575,0.00060368836,0.0016429377,0.0010128292,0.0005548932],"domain_scores_gemma":[0.9979881,0.00018910745,0.0003213923,0.0011583782,0.00018618046,0.00015683961],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007042204,0.0005337061,0.00052677625,0.00084445917,0.00027146842,0.0005329404,0.002520672,0.00031621184,0.0000257857],"category_scores_gemma":[0.000036813482,0.00046914988,0.00012131166,0.00061806047,0.00044760745,0.00086531194,0.0008349075,0.0005898617,0.000059372473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004005678,0.000033385295,0.00007385633,0.000007111594,0.000016428621,0.00005794028,0.0003844759,0.14137354,0.000121870136,0.016254595,0.000024074878,0.8416487],"study_design_scores_gemma":[0.00015372541,0.00013398082,0.00027427718,0.00013942074,0.000010754975,0.000010265346,2.4879424e-7,0.954015,0.00081154547,0.042157173,0.001680552,0.00061303086],"about_ca_topic_score_codex":0.00012643427,"about_ca_topic_score_gemma":0.00019773586,"teacher_disagreement_score":0.84103566,"about_ca_system_score_codex":0.0007066929,"about_ca_system_score_gemma":0.00054328213,"threshold_uncertainty_score":0.999776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007758154,0.00013709726,0.9952207,0.0009962743,0.0021380736,0.00070716144,0.0000017118421,0.00044277805,0.0002786178],"genre_scores_gemma":[0.06532443,0.000020040525,0.9317377,0.0013500887,0.0004996394,0.000018341383,0.0000014947116,0.000055617453,0.0009926513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99452776,0.000042662137,0.0005063792,0.0019933921,0.0018033966,0.0011263913],"domain_scores_gemma":[0.9963487,0.000798456,0.00012023763,0.0021368403,0.0002547102,0.0003410944],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014354734,0.0006074777,0.0005309686,0.0014118545,0.00022229056,0.0008405221,0.005597641,0.00028253673,0.000012803062],"category_scores_gemma":[0.00047182845,0.00046250864,0.00010889152,0.0009497418,0.00022843879,0.00069029763,0.0023249243,0.0008345797,0.00012615374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055596493,0.000015660367,0.000034063047,0.000026923906,0.00000813875,0.00014944769,0.0003954862,0.32429716,0.0007114556,0.00037949198,0.000021653726,0.67395496],"study_design_scores_gemma":[0.00028099903,0.0004713486,0.00055538176,0.00082811667,0.0000052135474,0.000043382865,8.0259596e-8,0.94528973,0.0061355424,0.043531887,0.0016869691,0.0011713238],"about_ca_topic_score_codex":0.000017801116,"about_ca_topic_score_gemma":0.00002367348,"teacher_disagreement_score":0.6727836,"about_ca_system_score_codex":0.0006787598,"about_ca_system_score_gemma":0.0004168995,"threshold_uncertainty_score":0.9997827},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57256764,0.00007426197,0.4241908,0.0014439096,0.00060761045,0.0010573486,0.00000906601,0.000020300282,0.000029085691],"genre_scores_gemma":[0.8105328,0.000011001082,0.18889579,0.000286561,0.00012129014,0.00012967567,0.000013715313,0.0000075536823,0.0000016178711],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99835014,0.00003675427,0.00030130628,0.00050298887,0.00056083954,0.00024798524],"domain_scores_gemma":[0.99841195,0.00015321137,0.0001381035,0.00044259487,0.0007602265,0.00009390836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015101759,0.00014283358,0.00022082168,0.00021530417,0.000090913265,0.000067704335,0.00016484222,0.000058971444,0.000014315873],"category_scores_gemma":[0.0007808512,0.00010458586,0.000045844292,0.00054714154,0.00020554308,0.00020863373,0.000079980855,0.00013120311,0.000002804787],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009427425,0.00013620841,0.007313654,0.00005407912,0.00000942095,0.0000040257733,0.0011342567,0.0019993973,0.15054552,0.0000133791245,0.000031174488,0.8386646],"study_design_scores_gemma":[0.0020327764,0.0015750945,0.039577276,0.0005195589,0.00010272843,0.000031226213,0.000004948426,0.2508896,0.70213574,0.0027539355,0.00016982206,0.00020726891],"about_ca_topic_score_codex":0.00008162796,"about_ca_topic_score_gemma":0.00021945869,"teacher_disagreement_score":0.83845735,"about_ca_system_score_codex":0.00020515826,"about_ca_system_score_gemma":0.00039815105,"threshold_uncertainty_score":0.42648876},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042551514,0.00030216892,0.99486715,0.00040109264,0.0017160939,0.0006581137,0.00004337545,0.000096717966,0.0014897855],"genre_scores_gemma":[0.2564691,0.00009974747,0.740801,0.0012741094,0.00069228373,0.000044049706,0.00013721998,0.000042523356,0.00043996016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996639,0.000025254512,0.00051767664,0.0014742959,0.00073698646,0.00060679816],"domain_scores_gemma":[0.99824834,0.00027853655,0.00025355717,0.00081559824,0.00025831492,0.00014566432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079935114,0.00040675484,0.00039942167,0.00049681496,0.0002032571,0.00030873535,0.0012567377,0.00028083086,0.000005517176],"category_scores_gemma":[0.000104273175,0.00037185362,0.00009653392,0.0006989053,0.0003338665,0.0012084481,0.0006558569,0.00042539716,0.000017130063],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006531468,0.00006767485,0.0000667146,0.00006288357,0.0000062249296,0.00006096231,0.00045839982,0.011636612,0.00048272318,0.015943818,0.00013874102,0.9710099],"study_design_scores_gemma":[0.001339484,0.0003202023,0.00037204963,0.0026370077,0.000011637442,0.00009576776,0.0000012966036,0.6665523,0.0070291134,0.31561345,0.0047472343,0.0012804781],"about_ca_topic_score_codex":0.000031985375,"about_ca_topic_score_gemma":0.00018111255,"teacher_disagreement_score":0.9697295,"about_ca_system_score_codex":0.0004589937,"about_ca_system_score_gemma":0.00024599192,"threshold_uncertainty_score":0.99987334},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004924664,0.00016143701,0.99564254,0.00048419533,0.00050221797,0.00044342753,0.0000012529567,0.00015875185,0.0021137185],"genre_scores_gemma":[0.62548316,0.000023879475,0.37405726,0.00018199149,0.0001494092,0.000010072362,0.0000030749054,0.000014725791,0.00007639467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977319,0.000034293706,0.00026032145,0.0011575831,0.000521729,0.00029411993],"domain_scores_gemma":[0.99883205,0.00011144345,0.0002244824,0.0005157012,0.00021421832,0.00010211159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005292647,0.0003023132,0.00026529416,0.00043494292,0.0003054816,0.00043947608,0.00046016678,0.00018801044,0.0000089022005],"category_scores_gemma":[0.0000405251,0.00026385626,0.000035441837,0.0004188949,0.0006731712,0.00088762864,0.00028890683,0.0004330463,0.000004684621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009121229,0.000010368503,0.00007234032,0.000036705598,0.0000049715854,0.0000053898943,0.0007291597,0.11218879,0.00010573844,0.012531997,3.9292254e-7,0.874305],"study_design_scores_gemma":[0.0009931513,0.00049639796,0.0036386137,0.0013400555,0.00002529421,0.00067641033,0.0000011069234,0.7942363,0.0023688336,0.19486785,0.00022072732,0.0011352306],"about_ca_topic_score_codex":0.00003076614,"about_ca_topic_score_gemma":0.00006118829,"teacher_disagreement_score":0.8731698,"about_ca_system_score_codex":0.00041055554,"about_ca_system_score_gemma":0.00044817978,"threshold_uncertainty_score":0.99998134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011377174,0.00009560175,0.9856199,0.00041774457,0.0016239765,0.00020563425,0.0000012578681,0.00022820472,0.0004305067],"genre_scores_gemma":[0.6111597,0.0000026382695,0.38822955,0.0005451141,0.00004834577,0.0000055849723,0.000001018899,0.000005121816,0.0000029042917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729216,0.00008365174,0.00026621553,0.0009964661,0.00066612253,0.00069538783],"domain_scores_gemma":[0.99841094,0.00018960048,0.00007206256,0.0010882654,0.00009705471,0.00014209915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001089595,0.00022049349,0.00018992531,0.00045376623,0.00025057318,0.0006753705,0.0023663568,0.00004960851,0.000014398519],"category_scores_gemma":[0.00021070204,0.00019126845,0.000048050126,0.003753217,0.00025326805,0.0004806049,0.00066660735,0.00021430086,0.000058858725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012634197,0.00020889132,0.0020008397,0.0000082223105,0.000005563606,0.00010028417,0.0006106294,0.17003374,0.0008350358,0.019134477,0.000042653774,0.8070184],"study_design_scores_gemma":[0.00021899276,0.00006120354,0.0026292522,0.0000239064,0.0000019300971,0.000022701519,5.576227e-7,0.9834992,0.005076837,0.007491591,0.00067523983,0.00029856584],"about_ca_topic_score_codex":0.000017476694,"about_ca_topic_score_gemma":0.00001704674,"teacher_disagreement_score":0.8134655,"about_ca_system_score_codex":0.00010625214,"about_ca_system_score_gemma":0.00016687592,"threshold_uncertainty_score":0.7799701},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039196474,0.0006097827,0.988358,0.00023102747,0.0023243758,0.00039933668,0.000002123403,0.00028974618,0.0073936093],"genre_scores_gemma":[0.2950802,0.00011713487,0.6980101,0.0033931388,0.0022556123,0.000013224277,0.0000047989797,0.00010681073,0.0010189965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951535,0.00003624143,0.00054326747,0.0018206404,0.0014807982,0.000965549],"domain_scores_gemma":[0.99694526,0.00046820682,0.00032831758,0.0015921611,0.00039438735,0.00027163894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010125038,0.00067420985,0.00056888035,0.0009773932,0.00045245612,0.0008357401,0.0028646027,0.00050822174,0.0001287008],"category_scores_gemma":[0.00006276335,0.0005667753,0.00014518546,0.0010806622,0.00068281416,0.0011110185,0.0011672152,0.0014217588,0.0001113048],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003254379,0.000033214616,0.000102943064,0.00004583409,0.000020085028,0.00018569121,0.00054171146,0.014998901,0.00017486693,0.0048363605,0.000085802334,0.97894204],"study_design_scores_gemma":[0.00087642245,0.0011477347,0.00074100017,0.0014804811,0.00002370656,0.0004963784,2.7285398e-7,0.9175813,0.0074449065,0.051325347,0.016732957,0.0021494415],"about_ca_topic_score_codex":0.000038717288,"about_ca_topic_score_gemma":0.0004299351,"teacher_disagreement_score":0.97679263,"about_ca_system_score_codex":0.00047001775,"about_ca_system_score_gemma":0.00041811733,"threshold_uncertainty_score":0.9996784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010677794,0.00014445551,0.9965737,0.0001132882,0.0007316288,0.00086792465,0.000009788184,0.0007162254,0.00073624105],"genre_scores_gemma":[0.39581773,0.00014474783,0.6023953,0.00049847766,0.0007118679,0.000086266875,0.000040888863,0.00013479845,0.00016991266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637085,0.00003553595,0.0006655946,0.0016363831,0.0007284909,0.00056315755],"domain_scores_gemma":[0.9978704,0.00025247206,0.00039115042,0.000967084,0.00034097256,0.00017792375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010450736,0.000545149,0.0005652383,0.0012562072,0.00039233526,0.00088561187,0.001662837,0.0003129019,0.0000030019298],"category_scores_gemma":[0.00003586118,0.0005344331,0.00013052477,0.0006896532,0.00034434546,0.00032406743,0.0011227032,0.00022702132,0.0000033354102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060990797,0.000035205063,0.000010365687,0.0003081825,0.0000151189615,0.000019091502,0.0017519782,0.019362891,0.00039078604,0.813265,0.000015589363,0.16481966],"study_design_scores_gemma":[0.00032184628,0.00023178133,0.000024258838,0.001110168,0.000009207853,0.00004781235,4.3912917e-7,0.9445032,0.0021370433,0.050807334,0.00021271272,0.0005942089],"about_ca_topic_score_codex":0.000028290697,"about_ca_topic_score_gemma":0.000013024762,"teacher_disagreement_score":0.9251403,"about_ca_system_score_codex":0.00044417268,"about_ca_system_score_gemma":0.0003672276,"threshold_uncertainty_score":0.99971074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037228738,0.00034736755,0.99193364,0.0018700275,0.0018684493,0.0007304563,0.000046533118,0.00021714646,0.0029826325],"genre_scores_gemma":[0.0030384744,0.0000756009,0.99324006,0.0022072128,0.00069782493,0.00003538521,0.000064940476,0.000040208477,0.000600286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596286,0.000014548418,0.0005735883,0.0018594693,0.00080942136,0.00078010006],"domain_scores_gemma":[0.9968648,0.0005822836,0.00030227238,0.0018210037,0.00027789682,0.00015172524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009856807,0.0005420489,0.0005019075,0.00077038317,0.00046492918,0.00087255787,0.0037702406,0.00014718411,0.000020421721],"category_scores_gemma":[0.00020747293,0.0005122605,0.00015138906,0.00059303985,0.00048366174,0.0014576137,0.0029252062,0.00046147406,0.00003510539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058674796,0.00005526559,0.000027404476,0.00024898243,0.000027109721,0.00012677143,0.00022877654,0.022551546,0.000012065168,0.29468563,0.0002030388,0.68182755],"study_design_scores_gemma":[0.00080963376,0.0002106789,0.000047304075,0.0016453736,0.000026804044,0.000047818983,5.1041707e-7,0.7074399,0.00033903963,0.25083834,0.037240703,0.0013538967],"about_ca_topic_score_codex":0.00006642721,"about_ca_topic_score_gemma":0.0002055144,"teacher_disagreement_score":0.68488836,"about_ca_system_score_codex":0.00030418072,"about_ca_system_score_gemma":0.00049789436,"threshold_uncertainty_score":0.9997329},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016979095,0.00003114101,0.91516614,0.00048819592,0.0025367842,0.0028748375,0.00017879323,0.0012874834,0.060457543],"genre_scores_gemma":[0.9221733,0.0000103720095,0.07352557,0.002940106,0.0008500763,0.000015242365,0.000042718424,0.00008699009,0.00035560314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954894,0.000094162584,0.0005560623,0.0019006098,0.001158811,0.0008009129],"domain_scores_gemma":[0.9975457,0.00072399364,0.00029721597,0.00083682686,0.00029914782,0.00029710997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031188174,0.0007192535,0.00058342476,0.00088350783,0.0006089995,0.00048546595,0.0010697661,0.0002910551,0.000045213525],"category_scores_gemma":[0.00011601651,0.00061954587,0.00011182085,0.0006745887,0.00033672366,0.000517082,0.0006510314,0.00066790526,0.0002261839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019848802,0.0005421911,0.0004637214,0.00023985695,0.000038685157,0.0007699443,0.005182459,0.89239097,0.0063829194,0.008723877,0.00041881984,0.08464804],"study_design_scores_gemma":[0.0009907803,0.0006732075,0.0020610534,0.000639095,0.00006204407,0.00018426948,6.9071825e-7,0.9428178,0.0020395983,0.023381198,0.025350437,0.0017998137],"about_ca_topic_score_codex":0.00003367007,"about_ca_topic_score_gemma":0.00010798191,"teacher_disagreement_score":0.9051942,"about_ca_system_score_codex":0.00045711882,"about_ca_system_score_gemma":0.00026523092,"threshold_uncertainty_score":0.99962556},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000490801,0.00045162445,0.98491144,0.003022462,0.0025028137,0.00044212653,0.0000032831733,0.00008069894,0.008094743],"genre_scores_gemma":[0.582413,0.000056074834,0.3736367,0.03755033,0.0016297416,0.000047424426,0.000019256086,0.00009624632,0.004551219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966267,0.00010316042,0.00046860374,0.001239059,0.0010441229,0.0005184081],"domain_scores_gemma":[0.99683523,0.0014452921,0.00025792545,0.0011227281,0.00020928783,0.00012952395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012229715,0.00046430732,0.00041634278,0.0007374954,0.00046278426,0.0007297979,0.0020655254,0.00022744936,0.00009704625],"category_scores_gemma":[0.00024587457,0.00034296061,0.00018042502,0.00079933385,0.00040126548,0.00036927158,0.00046534935,0.00066406565,0.00009156484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022098187,0.00008884342,0.0000060348193,0.000025245894,0.000031798125,0.00007731551,0.0011178545,0.051607553,0.0012812,0.39109278,0.0009508743,0.5536984],"study_design_scores_gemma":[0.0004994462,0.0004605129,0.000035922803,0.000298698,0.000013385415,0.000111304726,3.4432495e-7,0.5524068,0.01131222,0.42378327,0.010168576,0.00090955046],"about_ca_topic_score_codex":0.000004799666,"about_ca_topic_score_gemma":0.000006009447,"teacher_disagreement_score":0.6112748,"about_ca_system_score_codex":0.00022955785,"about_ca_system_score_gemma":0.00045056653,"threshold_uncertainty_score":0.99990225},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011549021,0.00089340034,0.99480313,0.00072663,0.0021048656,0.00056736957,0.000059890972,0.00019397971,0.0006392012],"genre_scores_gemma":[0.011607058,0.000022854383,0.98631936,0.00073582324,0.00053078454,0.000016783917,0.00010165424,0.000039877443,0.0006258254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604315,0.000019958306,0.0006642178,0.0019751422,0.0007465387,0.0005510268],"domain_scores_gemma":[0.9959679,0.0005679247,0.00038904708,0.0026400173,0.00028985628,0.0001452528],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086110266,0.00047549297,0.0004947573,0.00043702842,0.00040260307,0.00022502024,0.003751227,0.00023857408,0.000018648787],"category_scores_gemma":[0.00026781167,0.00043621028,0.00008491255,0.00037733198,0.00056106463,0.002280929,0.0037911006,0.0005514532,0.00004231454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013140426,0.000020355681,0.000023533,0.00014547171,0.000019493196,0.000020669233,0.0009604711,0.06525339,0.00025896495,0.7273746,0.000098946366,0.20581092],"study_design_scores_gemma":[0.000679496,0.00018607582,0.000023005658,0.0014050284,0.000011789813,0.0000613285,9.2844084e-7,0.5121343,0.0041800267,0.36210158,0.11810232,0.0011141201],"about_ca_topic_score_codex":0.000050373754,"about_ca_topic_score_gemma":0.0001107662,"teacher_disagreement_score":0.4468809,"about_ca_system_score_codex":0.00037454726,"about_ca_system_score_gemma":0.0009568236,"threshold_uncertainty_score":0.99980897},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001762851,0.00006153555,0.9973125,0.00033621932,0.00052857446,0.0012345967,0.000031855685,0.000290802,0.000027631073],"genre_scores_gemma":[0.021505719,0.000011681349,0.97414225,0.003923,0.00012440588,0.000021414686,0.0002307366,0.000030850715,0.0000099344725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961024,0.00007860013,0.0008630965,0.0015080586,0.00091472006,0.00053314766],"domain_scores_gemma":[0.9970536,0.0004847273,0.0005106787,0.0015836089,0.00022006108,0.00014732446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010329527,0.00043622486,0.000552834,0.001199713,0.00015748931,0.0005264586,0.0028189267,0.00028687762,0.00002050604],"category_scores_gemma":[0.00034873336,0.00043526056,0.00006970272,0.00090349396,0.00043238807,0.0011930807,0.00052444683,0.00035504476,0.0000038464786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007056166,0.00008167568,0.00001679112,0.00009323365,0.000004173713,0.000035822995,0.00015656548,0.12918478,0.00096981606,0.00023093857,0.000033409804,0.86918575],"study_design_scores_gemma":[0.0008125811,0.00026924335,0.000018652521,0.0006828694,0.00001226597,0.000012919491,8.973128e-8,0.98139995,0.005768916,0.010467287,0.000115341594,0.00043987736],"about_ca_topic_score_codex":0.000027157326,"about_ca_topic_score_gemma":0.00003279301,"teacher_disagreement_score":0.86874586,"about_ca_system_score_codex":0.00046175127,"about_ca_system_score_gemma":0.0006895353,"threshold_uncertainty_score":0.9998099},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022662478,0.00013222458,0.98284215,0.0010937322,0.003384305,0.00039345497,0.0000062968393,0.00030791984,0.009573697],"genre_scores_gemma":[0.98166895,0.000016510716,0.016703267,0.00065206614,0.0007170955,0.000012209549,0.000025828103,0.000043735326,0.00016035304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987078,0.000011923372,0.00025836157,0.00033265213,0.0004532196,0.00023607952],"domain_scores_gemma":[0.99902207,0.00037983156,0.000087958004,0.0003134167,0.00012368002,0.00007303266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045266544,0.00023250614,0.00015105298,0.00020852654,0.00034535563,0.0002360239,0.00043048462,0.00022850193,0.00001905905],"category_scores_gemma":[0.00017831681,0.00018344475,0.000044050357,0.000223367,0.0003754588,0.00014451552,0.000071626215,0.0009217481,0.00004312917],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036242145,0.0000050341687,0.00006683842,0.000029689134,0.0000069843077,0.0000063537154,0.00029422453,0.040693805,0.0027965761,0.0040858327,0.00007575301,0.9519353],"study_design_scores_gemma":[0.00028341284,0.000101772624,0.00031120784,0.0005522469,0.000009412167,0.000014846259,3.4785347e-7,0.83083254,0.027379943,0.12772556,0.012174302,0.00061442476],"about_ca_topic_score_codex":0.000011275554,"about_ca_topic_score_gemma":0.00025793462,"teacher_disagreement_score":0.97940266,"about_ca_system_score_codex":0.00012295444,"about_ca_system_score_gemma":0.00006467458,"threshold_uncertainty_score":0.74806595},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002377876,0.000342129,0.9833186,0.0043376735,0.0022885844,0.0004976806,0.000009508869,0.00028494402,0.008897072],"genre_scores_gemma":[0.017525062,0.00022356368,0.9708019,0.004468754,0.0008963156,0.00002131596,0.0000137345705,0.000091725255,0.0059576645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950596,0.000054172353,0.00058238796,0.0018557053,0.001455881,0.00099227],"domain_scores_gemma":[0.9966027,0.00027516962,0.00028332823,0.0019776367,0.00045380683,0.00040732854],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010715943,0.00063258654,0.00057062606,0.00085680047,0.00055769243,0.001553164,0.0050083227,0.00057925965,0.00016857758],"category_scores_gemma":[0.00009004392,0.00055316143,0.0001639504,0.00074815756,0.0012812862,0.0006777216,0.0018872216,0.0015099775,0.00011822642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011703548,0.00015605724,0.00021618362,0.00016700957,0.000049419265,0.0002868567,0.0069745197,0.11975214,0.0020902348,0.14797676,0.00076073024,0.7215584],"study_design_scores_gemma":[0.00048781704,0.00023394608,0.000042869902,0.00033754102,0.000009577788,0.00010648559,3.2882485e-7,0.7927067,0.0021858362,0.15647642,0.045975015,0.0014374233],"about_ca_topic_score_codex":0.00007369712,"about_ca_topic_score_gemma":0.0009779439,"teacher_disagreement_score":0.72012097,"about_ca_system_score_codex":0.00020967225,"about_ca_system_score_gemma":0.0012165449,"threshold_uncertainty_score":0.99969196},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007019914,0.00038349864,0.98595834,0.0013006037,0.00071304006,0.0002907417,0.000017887,0.00014990107,0.011115808],"genre_scores_gemma":[0.03541567,0.00005236315,0.960707,0.002587457,0.00057682575,0.000029411724,0.00001035381,0.000040427392,0.00058050564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965413,0.000030868316,0.0005025078,0.0015035574,0.00073202245,0.00068972405],"domain_scores_gemma":[0.997651,0.0006340572,0.0003065574,0.0011339717,0.00012639434,0.00014804617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008795962,0.00044259155,0.00049514865,0.00079238106,0.00024294246,0.0006506356,0.0027521863,0.0003094085,0.000013465171],"category_scores_gemma":[0.0001585584,0.00043987806,0.0000936822,0.00074988394,0.0004472769,0.0007532132,0.0010509373,0.0011769198,0.000032008713],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000134104,0.000024952406,0.00017582865,0.000012325994,0.000009874995,0.00006159589,0.0019217947,0.0079719005,0.000039596187,0.022493823,0.00014654794,0.96714044],"study_design_scores_gemma":[0.00062998745,0.00011290786,0.002227968,0.0011377168,0.000011960672,0.00007679142,0.0000046865557,0.8763993,0.0008975095,0.10060322,0.016256517,0.0016414473],"about_ca_topic_score_codex":0.00005710756,"about_ca_topic_score_gemma":0.00050137384,"teacher_disagreement_score":0.965499,"about_ca_system_score_codex":0.0006145433,"about_ca_system_score_gemma":0.0004763724,"threshold_uncertainty_score":0.9998053},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000159828,0.00043983964,0.98847455,0.0059991507,0.00028973736,0.00078316394,0.000011933662,0.00014201984,0.0038435948],"genre_scores_gemma":[0.34057772,0.0014324285,0.6394835,0.007534686,0.0013463286,0.00018624947,0.000020374075,0.00014363365,0.009275064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719155,0.00004662252,0.00036070464,0.0011022121,0.0007955539,0.00050334644],"domain_scores_gemma":[0.9968187,0.0015637506,0.00012589143,0.0010484395,0.00034089742,0.00010232305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014683626,0.0003592339,0.0002946494,0.0005551431,0.00034585648,0.00082751084,0.002648573,0.00018124278,0.000014533026],"category_scores_gemma":[0.000110636836,0.00023901889,0.000109180095,0.00044487516,0.0011876835,0.0002499124,0.0009239966,0.0006988633,0.000027289176],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008146194,0.000025868292,0.0000074792174,0.00003612289,0.000005366865,0.000007384865,0.00018812914,0.00019117382,0.000649466,0.103153124,0.0003609064,0.89536685],"study_design_scores_gemma":[0.00019030621,0.00062448217,0.00008143858,0.00049998134,0.000008604844,0.0000405382,8.836549e-7,0.45256782,0.2734947,0.2410458,0.030594157,0.0008512927],"about_ca_topic_score_codex":0.000011356127,"about_ca_topic_score_gemma":0.0000057463576,"teacher_disagreement_score":0.8945155,"about_ca_system_score_codex":0.00017192899,"about_ca_system_score_gemma":0.00034222836,"threshold_uncertainty_score":0.97469074},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004154836,0.00081914413,0.9925325,0.000094364834,0.00070586265,0.0012884202,0.000047954458,0.00006851882,0.00028841486],"genre_scores_gemma":[0.9681338,0.00003230949,0.031487744,0.000120638,0.00007751844,0.00006488677,0.0000140687025,0.00001746785,0.0000515616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959359,0.00014332858,0.0008253007,0.0013818404,0.0013635213,0.00035009807],"domain_scores_gemma":[0.9956642,0.0009447844,0.0005694396,0.0012889369,0.0014149814,0.00011767132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031829812,0.0003902717,0.0010847542,0.0014903754,0.000172312,0.00027855468,0.0014517711,0.00026732503,0.0000026956045],"category_scores_gemma":[0.00020117236,0.00036242217,0.00023844352,0.0008632891,0.00052157615,0.0005874853,0.0006692012,0.0003155328,0.0000015299985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012503891,0.00006277074,0.00021892329,0.000117796146,0.00023603629,0.0000038382873,0.0030344578,0.26129887,0.00011191103,0.00068263884,0.000011847524,0.7342084],"study_design_scores_gemma":[0.00028180773,0.00013109902,0.00021643288,0.00022056302,0.0002044104,0.000028911798,4.2497686e-7,0.99281436,0.0001335117,0.0055852393,0.00004553203,0.00033769215],"about_ca_topic_score_codex":0.00011037026,"about_ca_topic_score_gemma":0.00045171348,"teacher_disagreement_score":0.96397895,"about_ca_system_score_codex":0.00044788513,"about_ca_system_score_gemma":0.00060544314,"threshold_uncertainty_score":0.99988276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37401557,0.000011298001,0.6244932,0.0009349041,0.00016438297,0.0003175961,0.0000044680887,0.000044719476,0.000013843564],"genre_scores_gemma":[0.5859247,2.3709096e-7,0.41222635,0.0017085586,0.00011130502,0.000008061966,0.000005274694,0.000008261761,0.000007276596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869263,0.000015521615,0.00022626048,0.00040643572,0.00030593062,0.0003532321],"domain_scores_gemma":[0.99909055,0.00016808687,0.000048675618,0.00038278857,0.00020885779,0.0001010354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023894526,0.00015846684,0.00023631922,0.00021398759,0.00012553637,0.00007481792,0.00020325097,0.00006156237,0.000008192376],"category_scores_gemma":[0.00016451287,0.00012399748,0.000052703588,0.0004849846,0.00032751999,0.00032002162,0.00007322245,0.00014025414,0.000009547812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041368537,0.00016824865,0.007427853,0.000041906264,0.0000039490906,0.000014283513,0.001872188,0.94224924,0.019989163,0.0003338848,0.00003616519,0.02782178],"study_design_scores_gemma":[0.0009215275,0.00043766046,0.0073217084,0.00004233914,0.000008562555,0.000034595756,0.000002791882,0.9802456,0.007463304,0.0033689977,0.000007991407,0.00014491199],"about_ca_topic_score_codex":0.000051084695,"about_ca_topic_score_gemma":0.00040388273,"teacher_disagreement_score":0.21226688,"about_ca_system_score_codex":0.00009225298,"about_ca_system_score_gemma":0.00024475093,"threshold_uncertainty_score":0.50564706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053577733,0.0002739055,0.99002486,0.00011884208,0.0019110481,0.00043106655,0.0000034749428,0.00031702986,0.006866207],"genre_scores_gemma":[0.01229423,0.00008614958,0.9853027,0.0014782329,0.00028319328,0.000010764922,0.0000036083218,0.000044360004,0.0004967492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99517,0.000064328204,0.0007018183,0.0019106673,0.0012891021,0.0008641054],"domain_scores_gemma":[0.9966194,0.00016967305,0.0004610004,0.002251893,0.00029347753,0.00020454312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018230802,0.0006521179,0.0005770804,0.0008729713,0.00032328907,0.0006158565,0.004839069,0.0005458106,0.000021032447],"category_scores_gemma":[0.00023348692,0.00061106886,0.00017562007,0.0008316702,0.00071184407,0.0011298232,0.0018136668,0.0011616296,0.00005473681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005242888,0.0000420483,0.00004639629,0.000030702002,0.000008828387,0.000057866102,0.00073550275,0.3093268,0.00021870216,0.252717,0.000013572842,0.43679735],"study_design_scores_gemma":[0.00021895199,0.0000618938,0.000084324805,0.00016714288,0.0000059014883,0.000050129634,5.7812215e-8,0.8574085,0.00076578785,0.14007643,0.0005508122,0.0006100751],"about_ca_topic_score_codex":0.00001637934,"about_ca_topic_score_gemma":0.000026879057,"teacher_disagreement_score":0.5480817,"about_ca_system_score_codex":0.0005640966,"about_ca_system_score_gemma":0.0004981783,"threshold_uncertainty_score":0.9996341},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009212883,0.00042420597,0.99667656,0.00034761528,0.00017205787,0.0017574601,0.000019250178,0.000018355055,0.00049234845],"genre_scores_gemma":[0.049110968,0.00016588211,0.9457796,0.00062317314,0.0011462081,0.0002503067,0.00013054033,0.000074233045,0.002719077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981794,0.000027998622,0.000243211,0.0007544417,0.00041181705,0.00038313115],"domain_scores_gemma":[0.9988489,0.000052534142,0.00012597168,0.00058752944,0.00029532035,0.000089759065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057644455,0.00024939456,0.0001757538,0.00016302682,0.00031961146,0.00021589194,0.00080245495,0.00028672666,0.000042356358],"category_scores_gemma":[0.00006630555,0.00018734788,0.000079056634,0.00015595544,0.0003233852,0.000015326013,0.00021732399,0.00026584888,0.000003829927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020707035,0.00003390191,0.0000042097427,0.000028340342,0.000015330812,0.000004933419,0.00007309316,0.23357502,0.012502403,0.000286213,0.00005009204,0.75340575],"study_design_scores_gemma":[0.0003331824,0.00064961717,0.000004409537,0.00008057661,0.0000064241294,0.00001484092,2.6682818e-7,0.9631455,0.023830242,0.0016399146,0.010005194,0.00028984027],"about_ca_topic_score_codex":0.000013038221,"about_ca_topic_score_gemma":0.000032520824,"teacher_disagreement_score":0.7531159,"about_ca_system_score_codex":0.000065656124,"about_ca_system_score_gemma":0.0002065308,"threshold_uncertainty_score":0.7639824},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22055097,0.000013558751,0.7787829,0.00008380582,0.0001602619,0.0003310391,0.000003511294,0.000070398775,0.0000035588962],"genre_scores_gemma":[0.55167806,8.517966e-7,0.44813278,0.00010761052,0.000064460524,0.0000032840553,0.000003992254,0.000008765571,1.7416758e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990804,0.000007016435,0.00020216974,0.0002608678,0.00018159742,0.00026790932],"domain_scores_gemma":[0.9996057,0.000074671916,0.000028813116,0.00018229985,0.000050788974,0.00005769771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000268596,0.00012452144,0.00010898828,0.00013730662,0.00010639678,0.00011453232,0.0001759886,0.000032703767,0.0000019060185],"category_scores_gemma":[0.00005632484,0.00013159464,0.000023049477,0.0006047944,0.000044560435,0.00019035987,0.000030929004,0.00008540956,8.6564086e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018591488,0.000008521273,0.00006961179,0.000009693929,8.1384803e-7,5.5273637e-7,0.00007406865,0.534489,0.4632641,0.000011640042,0.000002409456,0.0020677403],"study_design_scores_gemma":[0.000112925576,0.000022548329,0.00009446002,0.000045829216,0.0000013819227,0.00002465426,4.2748434e-7,0.6271626,0.37236774,0.00003758168,0.000027176127,0.000102682796],"about_ca_topic_score_codex":0.000046730613,"about_ca_topic_score_gemma":0.0001299594,"teacher_disagreement_score":0.33112714,"about_ca_system_score_codex":0.00026102923,"about_ca_system_score_gemma":0.00003142885,"threshold_uncertainty_score":0.53662735},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64921224,0.00019441627,0.34943855,0.00085804326,0.000073643045,0.00012672349,4.189078e-7,0.000013194392,0.000082769235],"genre_scores_gemma":[0.8783048,0.0000046553228,0.121117614,0.00051290105,0.000050735125,0.0000025569404,6.843479e-7,0.0000034893776,0.0000025640775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920976,0.000008065844,0.00015426197,0.00019618109,0.00025146914,0.00018023922],"domain_scores_gemma":[0.99953747,0.000086153974,0.000040107505,0.00023593691,0.000049646576,0.00005068232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013892014,0.00007894556,0.00017779376,0.00024188064,0.00003408459,0.000013260014,0.00013824092,0.000029719626,0.00003812049],"category_scores_gemma":[0.00008590061,0.000056758345,0.00003323434,0.0008159161,0.00020104976,0.000082534934,0.00005794593,0.00007377717,0.00001665421],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020588406,0.000341525,0.115538366,0.00009429412,0.0000140356715,0.00002115852,0.0013960872,0.011549578,0.003296897,0.000043775235,0.000009851622,0.8676739],"study_design_scores_gemma":[0.0053017787,0.0013591418,0.38973138,0.00079309416,0.00007132783,0.00022130199,0.000008127384,0.42638153,0.16958168,0.005833657,0.00024812965,0.00046885447],"about_ca_topic_score_codex":0.000018546745,"about_ca_topic_score_gemma":0.000024812009,"teacher_disagreement_score":0.86720496,"about_ca_system_score_codex":0.000042444128,"about_ca_system_score_gemma":0.00007458514,"threshold_uncertainty_score":0.2314538},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021291577,0.00039545324,0.9941741,0.00013631373,0.0013299355,0.00027858585,0.000007916273,0.00010077355,0.0033639765],"genre_scores_gemma":[0.08793817,0.00012107455,0.9106288,0.00060786254,0.00032517835,0.0000046254468,0.000024331543,0.000035950507,0.0003140185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964111,0.000030324813,0.00063358655,0.0012644358,0.0011780774,0.00048251278],"domain_scores_gemma":[0.9968994,0.00046711485,0.0004401211,0.0017184425,0.0003345555,0.00014031674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008409935,0.00037753908,0.0005288206,0.0010742527,0.00015645991,0.00019775482,0.0029760296,0.0002747205,0.000026882379],"category_scores_gemma":[0.00007868165,0.00032860698,0.00013808416,0.0010282885,0.0004764074,0.00073576265,0.001511991,0.00052794075,0.000017971264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098676755,0.000037279133,0.00016988245,0.00003358579,0.000010894461,0.00007585581,0.00032430864,0.0039724456,0.00052838074,0.045510076,0.000047925412,0.9492795],"study_design_scores_gemma":[0.0007108724,0.000341067,0.0011471125,0.0007181621,0.000015620186,0.00009173837,2.656378e-7,0.57118124,0.017900823,0.40510368,0.0018041168,0.0009852947],"about_ca_topic_score_codex":0.000081786915,"about_ca_topic_score_gemma":0.000055412584,"teacher_disagreement_score":0.9482942,"about_ca_system_score_codex":0.00010828866,"about_ca_system_score_gemma":0.00027852223,"threshold_uncertainty_score":0.9999166},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002418192,0.00015766057,0.9970883,0.00028730085,0.00021108249,0.00051260216,0.000012717434,0.00028163812,0.0012068585],"genre_scores_gemma":[0.20272823,0.000007476939,0.7961898,0.0008519679,0.000104050305,0.000021792031,0.000022313763,0.00002534804,0.000049052484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965516,0.000023149654,0.00060178066,0.0016892252,0.000642124,0.00049213384],"domain_scores_gemma":[0.997465,0.0004491751,0.000423251,0.0011427777,0.0003425273,0.00017726494],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007333055,0.0004417412,0.00074531895,0.0013039792,0.00025965617,0.0018910081,0.0019415778,0.00022704634,0.000004018878],"category_scores_gemma":[0.00013826023,0.00043624977,0.00015967926,0.0011042235,0.0006080211,0.0016051242,0.0005360551,0.0003538814,0.0000021100186],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011555098,0.000080879996,0.0004493409,0.000056689154,0.000052748765,0.000015126204,0.0007330781,0.00513526,0.00040286002,0.014158194,0.000041143918,0.9788631],"study_design_scores_gemma":[0.00018149534,0.00022356788,0.00079187966,0.00009033156,0.000059091304,0.00002036163,3.7254958e-7,0.6372434,0.0038260585,0.35662448,0.00036081398,0.00057817553],"about_ca_topic_score_codex":0.000046044843,"about_ca_topic_score_gemma":0.00020104033,"teacher_disagreement_score":0.97828496,"about_ca_system_score_codex":0.0001559408,"about_ca_system_score_gemma":0.00018778094,"threshold_uncertainty_score":0.9998089},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78916115,0.00012880814,0.2088557,0.0013605095,0.00009098902,0.0002555977,0.000013336619,0.000031290645,0.00010262545],"genre_scores_gemma":[0.95484895,0.00010570519,0.043890506,0.00097521686,0.000105640465,0.000034195546,0.000011507326,0.0000072111247,0.0000210703],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99860305,0.000029106217,0.00012253175,0.0005626336,0.0003287205,0.00035398285],"domain_scores_gemma":[0.9994068,0.00007337226,0.000026822645,0.0003018673,0.00006652116,0.0001245944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027718963,0.00013002651,0.00011338695,0.000058978556,0.00013572894,0.00003612137,0.00033134283,0.00011186071,0.000018302839],"category_scores_gemma":[0.00028898602,0.00009914654,0.00002657823,0.00037181276,0.0017304168,0.000008195842,0.00015452979,0.00019468614,0.0000016510863],"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.0001950186,0.00010732522,0.021964934,0.000033469692,0.000004134991,0.000011783767,0.00007537897,0.0006295721,0.94832677,0.000009916144,0.00042515952,0.028216565],"study_design_scores_gemma":[0.00021659599,0.00057958567,0.0031357538,0.000034571396,0.000001170462,0.000027953074,1.8644184e-7,0.005578502,0.98601437,0.0030552004,0.0011814516,0.00017467869],"about_ca_topic_score_codex":0.000020837131,"about_ca_topic_score_gemma":0.000010321171,"teacher_disagreement_score":0.1656878,"about_ca_system_score_codex":0.00006047407,"about_ca_system_score_gemma":0.00022999734,"threshold_uncertainty_score":0.63757926},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014693871,0.004691374,0.9894392,0.00029551896,0.001329382,0.0020720654,0.00060144276,0.00014107887,0.0014284601],"genre_scores_gemma":[0.0012128878,0.00029274207,0.9934488,0.00035174805,0.00059864065,0.00033406212,0.00018260344,0.000044105556,0.0035343866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99556905,0.000035705925,0.000673494,0.0021632414,0.0008372842,0.0007212475],"domain_scores_gemma":[0.9964506,0.0005536749,0.00040688214,0.0020376302,0.00030974188,0.00024148528],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001326406,0.0005167986,0.00060823385,0.0005965855,0.00081994216,0.0010641206,0.001778957,0.00016294712,0.000013139135],"category_scores_gemma":[0.000043687596,0.00047843976,0.00005971318,0.00046059804,0.0010379135,0.0010253367,0.0016606444,0.00037112023,0.000072419156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006494802,0.000040460334,0.000011050524,0.00044108593,0.000015992582,0.000031927553,0.00010053299,0.0019954431,0.000019673973,0.76113975,0.00058729475,0.23561032],"study_design_scores_gemma":[0.00055348757,0.0001089815,0.000025141515,0.0009805002,0.000028026017,0.000086965614,0.0000021763676,0.20398992,0.00006789584,0.018560618,0.7746572,0.000939088],"about_ca_topic_score_codex":0.000026922766,"about_ca_topic_score_gemma":0.000119975644,"teacher_disagreement_score":0.7740699,"about_ca_system_score_codex":0.00023092296,"about_ca_system_score_gemma":0.0002875969,"threshold_uncertainty_score":0.9999729},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003867728,0.00047639443,0.9828523,0.000827985,0.0012851546,0.00054736744,0.000002171329,0.000087318345,0.013882648],"genre_scores_gemma":[0.20122592,0.0013308679,0.7802669,0.0079157995,0.0010601925,0.00007886657,0.000007816725,0.00013922896,0.007974406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586856,0.000039898347,0.00067259255,0.0012763488,0.0013913998,0.00075121404],"domain_scores_gemma":[0.9962492,0.00045919052,0.00044708644,0.0024943992,0.00020867394,0.00014143008],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013076153,0.000470465,0.00043681418,0.0004381799,0.00032593257,0.00038517368,0.0060019265,0.00018068073,0.000019273344],"category_scores_gemma":[0.000048373644,0.000349005,0.00017592029,0.00063836406,0.000766058,0.00034795108,0.0025666268,0.0005496968,0.000036720743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025186275,0.00001620976,0.000009485106,0.000014005067,0.000010996044,0.00002494249,0.000101943326,0.5074282,0.000008612056,0.04256282,0.00027205903,0.44954818],"study_design_scores_gemma":[0.00013588656,0.00007938741,0.000016094105,0.00013809785,0.000007326129,0.0000072991006,5.668686e-8,0.84902865,0.00017461968,0.14298622,0.0071166423,0.0003097249],"about_ca_topic_score_codex":0.000018004657,"about_ca_topic_score_gemma":0.00007277348,"teacher_disagreement_score":0.44923848,"about_ca_system_score_codex":0.00033392682,"about_ca_system_score_gemma":0.00042495044,"threshold_uncertainty_score":0.99989617},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028143998,0.0010053375,0.98805326,0.0005899272,0.0015754622,0.00036388767,0.000023829001,0.00024385334,0.007862988],"genre_scores_gemma":[0.04246098,0.00026033,0.94639415,0.008091163,0.0016066068,0.000020010082,0.00003668714,0.00009263137,0.0010374595],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99540615,0.000039076116,0.00055209815,0.0020792969,0.001030594,0.0008927808],"domain_scores_gemma":[0.9966044,0.00030201706,0.00029501552,0.002415431,0.00015154706,0.00023158127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071069936,0.0006686532,0.0005530302,0.0009108356,0.00035581752,0.0005640717,0.005075601,0.0004231385,0.00016243917],"category_scores_gemma":[0.00003657107,0.0006193286,0.00024051011,0.00065023167,0.0008245339,0.0007400949,0.0031706048,0.00078428455,0.0002691478],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018528171,0.00010826655,0.0003236936,0.000046848687,0.000026961334,0.0001871947,0.0013756253,0.0025660088,0.00032727167,0.0660439,0.0003552385,0.92862046],"study_design_scores_gemma":[0.0018581913,0.0005939777,0.0014344625,0.0011452109,0.00004359667,0.0004639282,3.590486e-7,0.24521168,0.0075887023,0.5064078,0.23069613,0.0045559835],"about_ca_topic_score_codex":0.00003083516,"about_ca_topic_score_gemma":0.00043870512,"teacher_disagreement_score":0.92406446,"about_ca_system_score_codex":0.000354315,"about_ca_system_score_gemma":0.00028855968,"threshold_uncertainty_score":0.9996258},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014896711,0.0002575923,0.99485344,0.00052710803,0.0023561323,0.000714627,0.0000041695953,0.00020423518,0.0009337356],"genre_scores_gemma":[0.009256322,0.000026751472,0.9889257,0.0008855001,0.0006269003,0.000026816935,0.000006406102,0.000028719836,0.00021688572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621356,0.000057935216,0.0007658374,0.001507651,0.0007502462,0.00070479495],"domain_scores_gemma":[0.9973081,0.0004501992,0.00037219527,0.0015238491,0.00022181177,0.00012387648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022296428,0.00048503446,0.00052721717,0.0009828152,0.0002252932,0.00048250717,0.003557663,0.0003664358,0.0000037554794],"category_scores_gemma":[0.00036067786,0.00047092602,0.000118545526,0.0007335798,0.00030723884,0.00082892855,0.0006537977,0.00067145756,0.000012090187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004413734,0.000022238262,0.000010959494,0.0000263022,0.0000023332534,0.000012143119,0.00029540516,0.09668557,0.00035694212,0.019376071,0.00001067568,0.88319695],"study_design_scores_gemma":[0.0002975943,0.00021550883,0.000081064834,0.0002438078,0.0000031004136,0.000025067538,1.0022951e-7,0.9049164,0.0039616516,0.08896679,0.0008111558,0.00047775797],"about_ca_topic_score_codex":0.000012676973,"about_ca_topic_score_gemma":0.000029330637,"teacher_disagreement_score":0.88271916,"about_ca_system_score_codex":0.00036323388,"about_ca_system_score_gemma":0.00042610662,"threshold_uncertainty_score":0.9997742},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030894065,0.0011179246,0.99227566,0.000045342134,0.0011972144,0.0002759674,0.0000022754405,0.00007868902,0.001917508],"genre_scores_gemma":[0.9688897,0.00010092581,0.030390725,0.00013657741,0.00036660396,0.000002917066,0.000002132518,0.00003386591,0.00007655104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986385,0.000013240433,0.00039248052,0.00031184327,0.00041245748,0.00023145955],"domain_scores_gemma":[0.9991992,0.00015968143,0.000101472986,0.0003886484,0.000106465166,0.000044542838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027760965,0.00024075393,0.0002853884,0.00026927525,0.00015595718,0.00012533624,0.0004927092,0.00012627692,0.000030806554],"category_scores_gemma":[0.00002259749,0.00018490532,0.00006163309,0.00023235366,0.00024656887,0.00017930413,0.00008376714,0.0003052121,0.000013053819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001907996,0.000005097403,0.000040692063,0.00009933028,0.000016969185,0.000010584433,0.0015884073,0.84897465,0.0043598185,0.0006061012,0.00002197819,0.14427449],"study_design_scores_gemma":[0.00009817835,0.000019390274,0.000116596755,0.0003410628,0.0000081948065,0.00008677441,5.4273215e-7,0.9965055,0.001415267,0.00042594594,0.000759945,0.00022259602],"about_ca_topic_score_codex":0.00002105222,"about_ca_topic_score_gemma":0.000050020983,"teacher_disagreement_score":0.9658003,"about_ca_system_score_codex":0.00017081638,"about_ca_system_score_gemma":0.00011478336,"threshold_uncertainty_score":0.754022},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03524622,0.00015313478,0.96271956,0.0005789947,0.00030527767,0.00036718207,0.000013814325,0.000024164809,0.0005916792],"genre_scores_gemma":[0.9286569,0.000016740614,0.070511036,0.0005972889,0.00015189998,0.000004618972,0.000013821334,0.00001180694,0.000035911507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975602,0.000043863984,0.00058190926,0.00072635076,0.00080579595,0.0002818707],"domain_scores_gemma":[0.99735826,0.001246351,0.00046756427,0.00049635244,0.0003486505,0.00008279627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084894156,0.00030177343,0.0004159538,0.0006000366,0.00019376492,0.00011938844,0.0010254601,0.00015807162,0.000014451858],"category_scores_gemma":[0.00010774832,0.00023789862,0.00009955113,0.0006100174,0.0005708078,0.0002565676,0.00051233347,0.00033573038,0.0000040659693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003577671,0.000074752126,0.00009094907,0.000058335412,0.000026599124,0.0000066894727,0.0010463103,0.32729948,0.0016136519,0.1470712,0.00008830532,0.52258795],"study_design_scores_gemma":[0.00033207162,0.00032595178,0.0013976827,0.00013398308,0.000009954593,0.00001957692,4.6007992e-7,0.75771177,0.006036061,0.23357956,0.00018461484,0.00026830618],"about_ca_topic_score_codex":0.000015775555,"about_ca_topic_score_gemma":0.000047528716,"teacher_disagreement_score":0.8934107,"about_ca_system_score_codex":0.00007305138,"about_ca_system_score_gemma":0.000404567,"threshold_uncertainty_score":0.97012246},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002221988,0.00019039387,0.9904886,0.00031581573,0.00073075714,0.0056340545,0.000012120086,0.00017468257,0.0022314063],"genre_scores_gemma":[0.7152417,0.000077512595,0.27921236,0.0015537513,0.001112772,0.0018544181,0.000053422296,0.000116030205,0.0007780686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955607,0.000058762074,0.00082383765,0.0016928035,0.0011428536,0.0007210567],"domain_scores_gemma":[0.99749553,0.00019706115,0.00043016172,0.0014905671,0.00022788903,0.00015877422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007298982,0.0005526068,0.0007010467,0.0008694751,0.00019990277,0.00044539035,0.0032669774,0.00040142526,0.000009798073],"category_scores_gemma":[0.00010371326,0.00051258825,0.0001265081,0.0010742137,0.00033774256,0.00094488036,0.00093031017,0.0008489105,0.00004815448],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027023592,0.00015135606,0.003909586,0.00021940429,0.000016568787,0.0006649795,0.004495596,0.042640056,0.00011066997,0.026146857,0.0001932106,0.9214247],"study_design_scores_gemma":[0.0015835584,0.0005029409,0.016647246,0.005108647,0.0000051131815,0.0003551282,3.6981257e-7,0.8504121,0.0005601173,0.09633419,0.025987573,0.0025030726],"about_ca_topic_score_codex":0.00015198838,"about_ca_topic_score_gemma":0.00014014186,"teacher_disagreement_score":0.9189216,"about_ca_system_score_codex":0.00056225766,"about_ca_system_score_gemma":0.0004963012,"threshold_uncertainty_score":0.99973255},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004419302,0.00007759317,0.99335396,0.0001759205,0.00046581437,0.00023818576,0.0000038924545,0.00009395308,0.0011713897],"genre_scores_gemma":[0.90890145,0.000023209837,0.09076719,0.00016926556,0.000035786314,0.00000266836,0.000004682213,0.000015442069,0.000080292346],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981916,0.000042529387,0.00032059566,0.0007508436,0.0004274495,0.00026698908],"domain_scores_gemma":[0.99862653,0.00012929038,0.00032350118,0.00063424936,0.00020631355,0.00008014227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068062503,0.00028916355,0.00035403948,0.00054114824,0.00010880967,0.00013355291,0.0010195791,0.000112729285,0.000007956178],"category_scores_gemma":[0.000014888814,0.00022871797,0.000037834292,0.0003265493,0.0011846136,0.0005252248,0.0005813487,0.00031550383,0.0000031379402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056883022,0.000058235823,0.0002056125,0.00010060808,0.000023734303,0.000028591545,0.0032525903,0.0018374965,0.00060855545,0.21295771,0.0000055060727,0.7808645],"study_design_scores_gemma":[0.00047050987,0.00088734826,0.0024263812,0.0004692465,0.000008403782,0.000077646895,4.9372426e-7,0.23105592,0.0062056966,0.7578874,0.00005848312,0.00045245292],"about_ca_topic_score_codex":0.00012003501,"about_ca_topic_score_gemma":0.0002030172,"teacher_disagreement_score":0.9044822,"about_ca_system_score_codex":0.00010550512,"about_ca_system_score_gemma":0.00014387428,"threshold_uncertainty_score":0.9326848},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028927447,0.00033532214,0.99538946,0.0009393143,0.00045604934,0.00033696144,0.0000047632725,0.00031404823,0.0021951317],"genre_scores_gemma":[0.032146353,0.00006324685,0.96511525,0.0020087713,0.00025581257,0.0000036438703,0.000010224048,0.000032610824,0.0003641127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968725,0.00002777614,0.0004632344,0.0012319385,0.0009312726,0.00047331184],"domain_scores_gemma":[0.9978231,0.00037178287,0.00028868226,0.0009405245,0.00041554673,0.0001603256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012399697,0.00039594347,0.0003484311,0.0009145119,0.00022347142,0.0006140625,0.0015802584,0.00031606198,0.000011938422],"category_scores_gemma":[0.00013855204,0.00036597069,0.00008156551,0.000783837,0.0008925419,0.00067751814,0.0004721111,0.0006162686,0.000025462596],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002300117,0.000035167577,0.000027936616,0.000073198506,0.0000060429097,0.00010087285,0.00028753324,0.00007773214,0.009462263,0.026145387,0.000018136621,0.96374273],"study_design_scores_gemma":[0.00065237755,0.000518534,0.00072297145,0.0005227398,0.000017260356,0.000108438806,2.425824e-7,0.52137786,0.25046223,0.21823555,0.0058175456,0.0015642241],"about_ca_topic_score_codex":0.0000071049967,"about_ca_topic_score_gemma":0.0000063516172,"teacher_disagreement_score":0.9621785,"about_ca_system_score_codex":0.00022452793,"about_ca_system_score_gemma":0.0004289881,"threshold_uncertainty_score":0.99987924},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006869397,0.00017788043,0.996816,0.000041378655,0.0007433209,0.00069959514,0.00004308767,0.00036824515,0.0004235947],"genre_scores_gemma":[0.17874861,0.000014146006,0.8206408,0.0002571892,0.0000911834,0.000024047198,0.00006225806,0.00011950467,0.00004225573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961442,0.00009080462,0.0009207803,0.0010971853,0.0008707805,0.00087626406],"domain_scores_gemma":[0.9975614,0.0007410034,0.00030482156,0.0009996201,0.0002496545,0.00014351221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015537059,0.0007886283,0.0010325052,0.002853991,0.00020401676,0.00024724499,0.0008036589,0.0005271235,0.00011518088],"category_scores_gemma":[0.0000797477,0.00078874023,0.00020799613,0.001858677,0.0004840089,0.00041750673,0.00017960004,0.000882885,0.000009328947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007143867,0.00001459855,0.00005794723,0.00011952275,0.00008128342,0.000084648884,0.0002208964,0.9944891,0.0016012756,0.00007624456,0.000022407203,0.0032249303],"study_design_scores_gemma":[0.00023933624,0.00008628318,0.000040151077,0.0003121666,0.00021338719,0.000021574115,4.903492e-7,0.98979276,0.0062811635,0.0021258867,0.0000400624,0.000846739],"about_ca_topic_score_codex":0.0000464068,"about_ca_topic_score_gemma":0.00003387289,"teacher_disagreement_score":0.17806168,"about_ca_system_score_codex":0.0008023169,"about_ca_system_score_gemma":0.00035634832,"threshold_uncertainty_score":0.99945635},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005002095,0.00019547489,0.99107,0.00048704114,0.004937102,0.00042244242,0.0000061171745,0.000039849285,0.002341809],"genre_scores_gemma":[0.97127724,0.00000799037,0.02724431,0.00030921857,0.00094356394,0.000012600895,0.000004450173,0.000014602526,0.00018603602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758863,0.000070125425,0.0006893122,0.00070999557,0.0006208354,0.00032107712],"domain_scores_gemma":[0.9977427,0.0007130583,0.0004851209,0.000803847,0.00021182699,0.000043460037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090397673,0.00027513414,0.00038730403,0.0005123236,0.0001527589,0.000253291,0.0016765532,0.00012934426,0.000007420731],"category_scores_gemma":[0.000121660625,0.00020506886,0.00009222182,0.00060656527,0.0002797855,0.0005046957,0.00046406768,0.00056035304,0.000010628488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018810932,0.00014201473,0.0015942599,0.00010939529,0.000026372187,0.00006555158,0.00989864,0.074609004,0.00286219,0.11475667,0.0004077864,0.7955093],"study_design_scores_gemma":[0.0008142178,0.00013687709,0.0018783665,0.000984465,0.000009875505,0.000035098357,0.00000192461,0.9533808,0.0030177622,0.033776775,0.0052494053,0.0007144188],"about_ca_topic_score_codex":0.0006494883,"about_ca_topic_score_gemma":0.0022935113,"teacher_disagreement_score":0.97077703,"about_ca_system_score_codex":0.00023365732,"about_ca_system_score_gemma":0.00034257388,"threshold_uncertainty_score":0.83624655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051070663,0.00012722546,0.9952444,0.00016122675,0.0011653007,0.00022712129,0.00000916913,0.0001331866,0.002881335],"genre_scores_gemma":[0.017226787,0.000027866006,0.98038965,0.0017048841,0.0003032576,0.0000020562256,0.000027755328,0.00002905213,0.00028869882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953019,0.000044361983,0.0011939417,0.0013339012,0.0015061953,0.000619716],"domain_scores_gemma":[0.997061,0.00037303445,0.0006037499,0.0012879153,0.00046270763,0.00021160446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014836675,0.00051941845,0.0007365404,0.0011537082,0.00017266754,0.0003615215,0.0037663188,0.00030100995,0.00003803951],"category_scores_gemma":[0.000060292045,0.0004806033,0.00012822283,0.00080222706,0.0006367243,0.00050771714,0.002050081,0.0005016117,0.000058783186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003782365,0.000063215586,0.000090916175,0.000118814045,0.000026946314,0.00003678128,0.0026622768,0.009465508,0.000048572154,0.06917764,0.000052621483,0.91825294],"study_design_scores_gemma":[0.000636832,0.00020050931,0.00057800487,0.00096851226,0.000015848107,0.00004515892,8.8624523e-7,0.9418008,0.0034689645,0.01963571,0.031072926,0.0015758837],"about_ca_topic_score_codex":0.000011830268,"about_ca_topic_score_gemma":0.00006678446,"teacher_disagreement_score":0.93233526,"about_ca_system_score_codex":0.00024019064,"about_ca_system_score_gemma":0.0009657717,"threshold_uncertainty_score":0.99976456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010511428,0.00033990538,0.98313475,0.0034318015,0.0022025914,0.0007599045,0.00001801201,0.0003052017,0.00970273],"genre_scores_gemma":[0.074173965,0.00003568495,0.91105914,0.013755171,0.00072880613,0.000028461487,0.000023701528,0.000051572544,0.0001435029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99521834,0.00004047624,0.0006618896,0.001977043,0.0010740142,0.0010282347],"domain_scores_gemma":[0.9963471,0.00073715934,0.00038859318,0.0017004382,0.0005437183,0.00028298452],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071372604,0.00075374055,0.0007864126,0.00083172444,0.00036548325,0.0006249981,0.00503942,0.000521999,0.00003403669],"category_scores_gemma":[0.000060070815,0.00062774617,0.0002562277,0.0008267411,0.00063196843,0.00038981208,0.0010913903,0.00074740447,0.00002343028],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025480716,0.000053217485,0.00008882443,0.00015831062,0.000024012637,0.00015422047,0.0005621645,0.016733408,0.00011785505,0.09368418,0.000022634249,0.8883757],"study_design_scores_gemma":[0.00083308,0.00050913973,0.00012992274,0.00051233533,0.000026942087,0.00015250541,3.797451e-7,0.669159,0.0020620138,0.30692258,0.01854752,0.0011446014],"about_ca_topic_score_codex":0.000049804094,"about_ca_topic_score_gemma":0.00046798852,"teacher_disagreement_score":0.8872311,"about_ca_system_score_codex":0.00017887844,"about_ca_system_score_gemma":0.0010367618,"threshold_uncertainty_score":0.9996174},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017819014,0.00041270835,0.9948361,0.00063895824,0.0004738066,0.000754183,0.000015699961,0.000096327894,0.0025940267],"genre_scores_gemma":[0.80898905,0.00015339217,0.18888001,0.0008576841,0.00023274636,0.00004193448,0.00002199592,0.00002527459,0.0007979313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814177,0.0000501445,0.00035778937,0.00044073054,0.00058918435,0.0004204025],"domain_scores_gemma":[0.99821955,0.0006732134,0.0002611543,0.00037863848,0.00037462512,0.00009284381],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084183854,0.0002686055,0.0003418778,0.00035561208,0.0012324327,0.00027679434,0.0009579222,0.00028747477,0.000017172835],"category_scores_gemma":[0.00024748148,0.00025772105,0.00011590497,0.00016842819,0.002002389,0.00050855125,0.00015325224,0.00036267977,0.000009800681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017091961,0.000025392672,0.000021893644,0.000027264543,0.00000795086,0.0000034050477,0.03513665,0.19011028,0.0000012804076,0.06536768,0.000017508186,0.7092636],"study_design_scores_gemma":[0.00032852273,0.000040260267,0.000018203551,0.00013416316,0.000011944258,0.0000027196888,0.000010156174,0.84950745,0.000010027886,0.14931232,0.0003700993,0.00025411748],"about_ca_topic_score_codex":0.0005873074,"about_ca_topic_score_gemma":0.005233659,"teacher_disagreement_score":0.80881083,"about_ca_system_score_codex":0.0002750545,"about_ca_system_score_gemma":0.0006630544,"threshold_uncertainty_score":0.9999875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023857813,0.0015838881,0.99586606,0.00015585557,0.00063833,0.00026377494,0.0000067362253,0.0005689588,0.00067783],"genre_scores_gemma":[0.76596135,0.0008544744,0.2325407,0.00012246832,0.00028077036,0.000017808434,0.00006516657,0.00008269501,0.00007456681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980144,0.000007454548,0.00039780117,0.00063570193,0.00031092917,0.0006336967],"domain_scores_gemma":[0.9989358,0.00024954227,0.0000649615,0.00062654284,0.000058540638,0.000064597756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024798434,0.0004035453,0.00040487212,0.00039399086,0.000059367147,0.000087097855,0.00091108034,0.0005030065,0.000011989954],"category_scores_gemma":[0.00005598538,0.00040093198,0.000049014227,0.0006234778,0.00036943785,0.00023059078,0.00028900173,0.0010810829,0.000015662452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015236292,0.000004756372,0.000020573701,0.000011210653,0.0000027030665,0.000014227533,0.000011967649,0.7624303,0.000015095321,0.00092793436,0.000004839161,0.23655488],"study_design_scores_gemma":[0.00010498202,0.000027538836,0.00022771709,0.00026871066,0.0000033078366,0.0000068599243,9.8050016e-8,0.9654661,0.000056459958,0.032676876,0.0007484842,0.00041289168],"about_ca_topic_score_codex":0.0000046212135,"about_ca_topic_score_gemma":0.0004025873,"teacher_disagreement_score":0.76572275,"about_ca_system_score_codex":0.000731762,"about_ca_system_score_gemma":0.00004442958,"threshold_uncertainty_score":0.99984425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017470053,0.00008998226,0.99625933,0.00068694865,0.0005038095,0.0004611709,0.000002177038,0.00037311277,0.0014487819],"genre_scores_gemma":[0.06766686,0.000018586972,0.92810017,0.0037870763,0.0003097984,0.00000868737,0.0000041651656,0.000021667662,0.00008302148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611145,0.00003881127,0.00082064455,0.0010753804,0.0012522818,0.0007014222],"domain_scores_gemma":[0.997401,0.00029624664,0.00038198513,0.001351136,0.00036687191,0.0002027337],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00095058593,0.0005414015,0.0005912004,0.0014903054,0.00027397243,0.0011745434,0.0023778738,0.0002905473,0.000017440616],"category_scores_gemma":[0.00015867464,0.0005192726,0.00015663808,0.0009905975,0.00034394552,0.0034460754,0.0018208714,0.00065665034,0.00007399504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046015493,0.000012172315,0.00002112039,0.00001790035,0.000010586333,0.000016193375,0.00053283235,0.10964973,0.00039917853,0.03326285,0.00002672374,0.8560461],"study_design_scores_gemma":[0.00021009335,0.00017077108,0.000052728854,0.00055185874,0.000018720371,0.00010897592,3.0019413e-7,0.82724667,0.005932338,0.1453058,0.019202696,0.0011990756],"about_ca_topic_score_codex":0.00003475306,"about_ca_topic_score_gemma":0.00006628852,"teacher_disagreement_score":0.854847,"about_ca_system_score_codex":0.0009759003,"about_ca_system_score_gemma":0.0005217614,"threshold_uncertainty_score":0.9998623},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5613749,0.00192632,0.4176928,0.0020742516,0.0014565975,0.001566425,0.00041717288,0.0026144823,0.010877051],"genre_scores_gemma":[0.9968879,0.000011533949,0.0020912,0.00061106967,0.00030556094,0.0000066554785,0.000058241916,0.0000031008105,0.000024744219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981163,0.000023183646,0.00027584296,0.00078557857,0.0003524648,0.00044661574],"domain_scores_gemma":[0.9993768,0.0001361431,0.0000930102,0.00024715497,0.00004604603,0.0001008751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033359704,0.00031129917,0.00034427314,0.00009185843,0.00025423628,0.00011745287,0.0011570014,0.0004371434,0.00018205922],"category_scores_gemma":[0.000009097225,0.00013194176,0.000088307475,0.00019132142,0.00025170296,0.00011415654,0.000084452135,0.00048229616,0.000053408574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003992829,0.00004344951,0.00010137207,0.000018757066,0.0000066061866,0.00017109317,0.0001269193,0.056853022,0.009296329,0.0017459798,0.000002850856,0.9315937],"study_design_scores_gemma":[0.00017868051,0.00032734624,0.00009649074,0.00027218513,0.000013128466,0.00003798473,0.0000023383052,0.9909287,0.0011146212,0.0062045297,0.00030741064,0.0005165611],"about_ca_topic_score_codex":0.00012797139,"about_ca_topic_score_gemma":0.0013678988,"teacher_disagreement_score":0.9340757,"about_ca_system_score_codex":0.00008706638,"about_ca_system_score_gemma":0.000042730288,"threshold_uncertainty_score":0.5380429},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008561069,0.00019183353,0.99245995,0.0014921218,0.0015308571,0.000838225,0.0000022231052,0.0003707125,0.0031055063],"genre_scores_gemma":[0.006367807,0.00005045147,0.9909204,0.0011726747,0.00048619005,0.000024186624,0.000014313683,0.00005003666,0.00091390713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546117,0.000040583778,0.0005991942,0.0016861341,0.0012854027,0.0009274986],"domain_scores_gemma":[0.9971334,0.00019840921,0.00027929767,0.0015867857,0.00046285536,0.0003392875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012596021,0.0005632737,0.0004991547,0.0008827765,0.000396823,0.00081240473,0.004007978,0.0005261382,0.00008160944],"category_scores_gemma":[0.000067700756,0.0005055268,0.00015057356,0.00082519447,0.00084661075,0.00091784954,0.001690924,0.0019108927,0.000119474316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002227085,0.000042133084,0.000023835786,0.00007067839,0.000010620487,0.00006231264,0.001019568,0.06364529,0.00040622175,0.007031662,0.000007374784,0.92767805],"study_design_scores_gemma":[0.00022012852,0.00017740099,0.00000813142,0.0002284678,0.000004224746,0.000083704435,5.5839646e-8,0.90303874,0.0007020946,0.08079757,0.014086258,0.0006532214],"about_ca_topic_score_codex":0.000023909784,"about_ca_topic_score_gemma":0.00011869748,"teacher_disagreement_score":0.92702484,"about_ca_system_score_codex":0.0001439366,"about_ca_system_score_gemma":0.0006419509,"threshold_uncertainty_score":0.99973965},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05774764,0.0028935284,0.92851985,0.0013101354,0.0002704421,0.000886385,0.000022108348,0.00003358128,0.008316334],"genre_scores_gemma":[0.9332557,0.0005463242,0.055480495,0.0016555939,0.00083483855,0.000012768783,0.00007517655,0.00006509833,0.008074043],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99786776,0.00003929529,0.00019300994,0.000994687,0.0004594257,0.0004458145],"domain_scores_gemma":[0.9988876,0.00004214474,0.0000622052,0.0006475592,0.00021581473,0.00014469097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004850821,0.0002870474,0.00024255,0.0003275081,0.00015066397,0.00010508318,0.00044251216,0.00028218693,0.00010762999],"category_scores_gemma":[0.000030136955,0.0002261041,0.000042507672,0.00014076519,0.000936636,0.000010977701,0.0005626217,0.0004772331,0.000016133934],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023671558,0.000045193032,0.00036463916,0.00006337331,0.00003261654,0.00017011439,0.00019294073,0.009637989,0.07219436,0.00084247766,0.00005463675,0.91616493],"study_design_scores_gemma":[0.008754635,0.008620841,0.005646736,0.0010158397,0.00006303286,0.0025651813,0.000004832827,0.16387424,0.41551745,0.0063919094,0.3826587,0.00488662],"about_ca_topic_score_codex":0.000023032582,"about_ca_topic_score_gemma":0.00021062052,"teacher_disagreement_score":0.9112783,"about_ca_system_score_codex":0.00004171037,"about_ca_system_score_gemma":0.00028970922,"threshold_uncertainty_score":0.92202574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124023676,0.000020008065,0.8755615,0.00014109026,0.000083432074,0.00008264419,7.080987e-7,0.00006588698,0.000021059464],"genre_scores_gemma":[0.7579788,9.870588e-7,0.24184752,0.000099801684,0.00006574052,0.0000023703712,5.6579245e-7,0.000004085066,1.5321977e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993527,0.0000043020905,0.00013259436,0.000191007,0.00015507422,0.00016434763],"domain_scores_gemma":[0.9996295,0.00006283097,0.000022504868,0.00019233949,0.000047141104,0.000045683886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007802713,0.00009145157,0.00011550187,0.00010509042,0.000035500554,0.00004405571,0.00021773395,0.000034589906,0.000002213981],"category_scores_gemma":[0.00000374925,0.00007453963,0.000015065346,0.0005273543,0.00007455399,0.000120888166,0.000026571082,0.00012424163,0.0000025541278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019151428,0.000019578361,0.000071402035,0.000004074154,0.0000010652029,0.000001862026,0.0001432899,0.83972704,0.0021325434,0.00011779759,0.0000034450222,0.15777601],"study_design_scores_gemma":[0.00013284758,0.00008675663,0.00037567012,0.000029454557,0.000001723476,0.000015511072,1.2343737e-7,0.9865789,0.011500341,0.0011554841,0.000031044296,0.00009214613],"about_ca_topic_score_codex":0.0000036430554,"about_ca_topic_score_gemma":0.0000068426098,"teacher_disagreement_score":0.6339551,"about_ca_system_score_codex":0.00003570054,"about_ca_system_score_gemma":0.000028957611,"threshold_uncertainty_score":0.3039638},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038329446,0.0029225112,0.9851446,0.00507648,0.0009262627,0.0007965111,0.0000042093125,0.0002448961,0.0048461794],"genre_scores_gemma":[0.22621372,0.000114282324,0.7684544,0.0027249258,0.0014768263,0.00003852666,0.0000031069824,0.00007831932,0.0008959048],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995693,0.00014850797,0.0006414011,0.0017040436,0.0010259354,0.0007871105],"domain_scores_gemma":[0.9961763,0.0012615261,0.00039436598,0.0017443661,0.00013742459,0.0002860106],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021183186,0.0007020914,0.00071204937,0.0006389339,0.000543047,0.0012449536,0.004130592,0.00033755737,0.00002840275],"category_scores_gemma":[0.000055368444,0.00048376355,0.00027155917,0.0008076381,0.001500299,0.00062003627,0.0009385536,0.0010698889,0.000024941692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004338916,0.000015493591,0.000021348565,0.000050521357,0.000018443041,0.000024492145,0.0011205067,0.014211381,0.00004139085,0.34769425,0.000057045654,0.63670176],"study_design_scores_gemma":[0.0015120103,0.0002327796,0.000043895463,0.0006866643,0.000031152667,0.00011561357,5.2170816e-7,0.35929418,0.00041715018,0.6183757,0.018316364,0.00097397575],"about_ca_topic_score_codex":0.000041216917,"about_ca_topic_score_gemma":0.00012875363,"teacher_disagreement_score":0.63572776,"about_ca_system_score_codex":0.00011468509,"about_ca_system_score_gemma":0.0005763321,"threshold_uncertainty_score":0.99979186},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010412136,0.00023826277,0.98602,0.007935894,0.00072953413,0.001180857,0.0000023876676,0.00016062154,0.0026912226],"genre_scores_gemma":[0.75914663,0.000013673278,0.21277408,0.025169848,0.0017583239,0.0000594114,0.000020484087,0.00006346549,0.000994082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964628,0.00008219543,0.000505893,0.0013483855,0.00091771723,0.00068299857],"domain_scores_gemma":[0.99771595,0.00050981954,0.00022867421,0.001309745,0.00013664103,0.00009914352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001830406,0.00042504276,0.00036800303,0.0009008326,0.00037470896,0.0006873643,0.004175783,0.00022376025,0.0000013862661],"category_scores_gemma":[0.00004836091,0.00032997917,0.0001200944,0.0012288612,0.00015110646,0.00007357066,0.0010018221,0.00044473738,0.000013096019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013766192,0.000048435144,0.000015514719,0.00007154238,0.0000061877513,0.00002043576,0.0035896946,0.23413482,0.000059854432,0.013562085,0.00014433157,0.74833333],"study_design_scores_gemma":[0.00033348417,0.0002767737,0.0002708612,0.00054120424,0.000007945543,0.000018450402,0.000002481719,0.930096,0.000047404024,0.041182123,0.026783336,0.00043995303],"about_ca_topic_score_codex":0.00003334668,"about_ca_topic_score_gemma":0.00031458648,"teacher_disagreement_score":0.77324593,"about_ca_system_score_codex":0.00029481406,"about_ca_system_score_gemma":0.0001697913,"threshold_uncertainty_score":0.99991524},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018594461,0.00049689243,0.99416685,0.0006190828,0.0020688847,0.0008534675,0.00003700666,0.00022907599,0.0015101696],"genre_scores_gemma":[0.005621487,0.00017409911,0.992295,0.00091829407,0.0005747658,0.00010152211,0.000033788696,0.000041243195,0.00023978815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595535,0.000026777156,0.0006437993,0.0016464901,0.000815682,0.00091191876],"domain_scores_gemma":[0.99736774,0.0005082213,0.00029702153,0.0012593993,0.00034788996,0.00021974789],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008927792,0.00055490405,0.0005116998,0.0018595164,0.0008304101,0.000831404,0.0023590736,0.0002754989,0.0000612073],"category_scores_gemma":[0.00003751478,0.00054302515,0.0003519132,0.0014509199,0.00060156046,0.00068590505,0.00071046635,0.00060514547,0.000016725584],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002627615,0.000042171312,0.000032844247,0.00001611906,0.000021659615,0.00002349259,0.00031310206,0.0017658441,0.000014677839,0.079971805,0.00009846149,0.9176972],"study_design_scores_gemma":[0.0006416435,0.00025831378,0.00012815798,0.00014613535,0.000021230398,0.00010136106,8.877722e-7,0.56618196,0.00002534814,0.40757903,0.024154902,0.00076101924],"about_ca_topic_score_codex":0.000040154217,"about_ca_topic_score_gemma":0.00022027906,"teacher_disagreement_score":0.91693616,"about_ca_system_score_codex":0.00016544167,"about_ca_system_score_gemma":0.000371377,"threshold_uncertainty_score":0.99970216},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011438136,0.000089652174,0.99352837,0.000403608,0.0018586931,0.0021407169,0.000015989384,0.00020817798,0.0006109553],"genre_scores_gemma":[0.585374,0.0000094071775,0.4127909,0.0009067987,0.00068486284,0.00009327313,0.000021393156,0.00007119418,0.000048172387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99416894,0.000082277984,0.0009782566,0.0023879034,0.000856633,0.0015260029],"domain_scores_gemma":[0.99378216,0.0031438186,0.0007311166,0.0015727637,0.00048750467,0.00028265748],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0020108516,0.0008862098,0.001048482,0.000667153,0.00040718066,0.00083528034,0.0032976684,0.0008013331,0.00001322799],"category_scores_gemma":[0.00019507356,0.0007958079,0.00014903217,0.0009769095,0.0013777408,0.00051961764,0.0011083978,0.0023389093,0.0000051058837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056588702,0.00005061619,0.00031199644,0.00007754684,0.000030575895,0.00035898038,0.0013600716,0.2619075,0.00043691136,0.027469005,0.000015291596,0.7079249],"study_design_scores_gemma":[0.0012075687,0.00024670237,0.00007938564,0.0010854315,0.000012476876,0.00022520444,0.0000016230231,0.9879884,0.0006909963,0.0071886624,0.00025627826,0.0010172322],"about_ca_topic_score_codex":0.000036200054,"about_ca_topic_score_gemma":0.0009991305,"teacher_disagreement_score":0.72608095,"about_ca_system_score_codex":0.00038431567,"about_ca_system_score_gemma":0.0007722385,"threshold_uncertainty_score":0.99996275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000085150685,0.000193999,0.9774358,0.00040860582,0.0015630114,0.0007850578,0.000010884184,0.00029528575,0.019222181],"genre_scores_gemma":[0.3661418,0.000009611928,0.62762403,0.0023518426,0.0009263156,0.000081619204,0.000022594208,0.000078948615,0.002763257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952912,0.000026530828,0.00074278185,0.0019265687,0.0011724944,0.0008404316],"domain_scores_gemma":[0.99759686,0.00018351195,0.00029861915,0.0014211921,0.00024523193,0.00025455572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008536956,0.00061731593,0.00074723136,0.00086887187,0.00037918062,0.0008626661,0.0026332054,0.00038560334,0.000013974216],"category_scores_gemma":[0.000042786865,0.00059835496,0.00014917625,0.001538664,0.0002677759,0.0003738536,0.00075272226,0.00068056467,0.0001088945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005249666,0.00014373715,0.000058950616,0.0002001234,0.000039139744,0.00027370834,0.0015736055,0.27271953,0.0027809665,0.06538443,0.003251922,0.65352136],"study_design_scores_gemma":[0.001121864,0.00025895564,0.00021614674,0.001015748,0.0000119679025,0.00013039271,4.0405752e-7,0.92555845,0.0032230143,0.03757742,0.028949603,0.0019360087],"about_ca_topic_score_codex":0.000087527864,"about_ca_topic_score_gemma":0.00013308374,"teacher_disagreement_score":0.65283895,"about_ca_system_score_codex":0.0005507358,"about_ca_system_score_gemma":0.00046373912,"threshold_uncertainty_score":0.9996468},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004382211,0.0008778179,0.99637187,0.00010005249,0.0014645533,0.00076343765,0.00004307136,0.0001620553,0.00017329965],"genre_scores_gemma":[0.04586071,0.0006174643,0.95148987,0.00040161173,0.00059306406,0.000026644708,0.0008704711,0.00012468653,0.000015457344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974829,0.000027164224,0.0005923307,0.0009531537,0.0004195148,0.000524921],"domain_scores_gemma":[0.9983394,0.00026114393,0.00017870784,0.0009587706,0.00018674393,0.000075235876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008490094,0.00042616506,0.0004166098,0.0004540483,0.00011138091,0.00015745683,0.0006842337,0.00035759003,0.000012287058],"category_scores_gemma":[0.00014573804,0.00046452542,0.000042672134,0.00052741653,0.00015172656,0.00072399684,0.00021266626,0.0005860761,0.0000027158076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004660736,0.0000065085187,0.000014060649,0.000046999867,0.0000053811723,0.00000523198,0.00007817683,0.86355716,0.00001270524,0.00044601786,0.00002845814,0.13579462],"study_design_scores_gemma":[0.00041629813,0.000025206287,0.00001566327,0.00041770376,0.00001306164,0.000006700591,3.0406437e-7,0.97923714,0.00012428909,0.019058954,0.00022372915,0.00046097886],"about_ca_topic_score_codex":0.0000035634998,"about_ca_topic_score_gemma":0.00014569188,"teacher_disagreement_score":0.13533364,"about_ca_system_score_codex":0.00047069165,"about_ca_system_score_gemma":0.000110274996,"threshold_uncertainty_score":0.99978065},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2936537,0.00024564526,0.70430195,0.0007095561,0.00028421226,0.00045315985,0.0000066126863,0.000020237138,0.00032492657],"genre_scores_gemma":[0.9696007,0.000089852605,0.030106397,0.000073845586,0.00008054388,0.0000036151775,0.0000063802136,0.000009532326,0.00002917183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998611,0.000017041462,0.00037251343,0.00036478072,0.00046658603,0.00016811168],"domain_scores_gemma":[0.9988911,0.000085513864,0.00030471818,0.0005254182,0.00016344569,0.000029779465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035974875,0.00020527813,0.00041663164,0.0003818769,0.00015410906,0.000030391877,0.00022723008,0.00015324778,0.000011064613],"category_scores_gemma":[0.000030244884,0.000112376496,0.0001554156,0.0004835378,0.0006624331,0.00012365651,0.00016336559,0.00030767362,3.282761e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118888405,0.000059366866,0.00088540994,0.00017748204,0.00020909644,0.000010839758,0.0037402185,0.9802899,0.0025325164,0.00072258036,7.7903167e-7,0.011252929],"study_design_scores_gemma":[0.0012338528,0.00038547604,0.009061297,0.0007710677,0.0026200963,0.00018494511,0.000015378644,0.80726033,0.15260552,0.025485266,0.000009451627,0.00036734695],"about_ca_topic_score_codex":0.000074426105,"about_ca_topic_score_gemma":0.000025039815,"teacher_disagreement_score":0.67594695,"about_ca_system_score_codex":0.0001904764,"about_ca_system_score_gemma":0.00013928123,"threshold_uncertainty_score":0.45825806},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000307212,0.00031206672,0.9696937,0.0013946672,0.0037079607,0.00037386382,0.0000061284686,0.00025193754,0.02422891],"genre_scores_gemma":[0.06974322,0.000054555734,0.9255816,0.0035241398,0.0007642746,0.000009930929,0.000007497248,0.000048625163,0.00026618395],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952097,0.000033447657,0.0005552572,0.0020654763,0.0011751493,0.0009609975],"domain_scores_gemma":[0.996545,0.0003480609,0.000315448,0.002272602,0.00022051646,0.00029834217],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007897865,0.00070105575,0.00063658797,0.0007004482,0.00042297217,0.000923296,0.005582385,0.0006693655,0.00006298234],"category_scores_gemma":[0.00006704146,0.00059400336,0.00019867222,0.0006414489,0.00093125063,0.0007511508,0.0019684848,0.0017765611,0.00016238194],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040234295,0.000029597868,0.000031935357,0.000021373084,0.000009793138,0.00025643848,0.0006678719,0.0028713292,0.000058979753,0.022733565,0.000051690397,0.9732634],"study_design_scores_gemma":[0.00028374782,0.00027154898,0.00014808228,0.00020828044,0.000008538454,0.00021456067,8.671557e-8,0.47516993,0.00053847855,0.5121721,0.009857332,0.0011273444],"about_ca_topic_score_codex":0.000037415703,"about_ca_topic_score_gemma":0.000110065615,"teacher_disagreement_score":0.9721361,"about_ca_system_score_codex":0.0001960407,"about_ca_system_score_gemma":0.00059853564,"threshold_uncertainty_score":0.9997979},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068223214,0.00058977935,0.9942604,0.00036555974,0.0008695794,0.00017242608,0.000022627408,0.00009738154,0.0029400247],"genre_scores_gemma":[0.068335794,0.00010664308,0.93041825,0.00058308576,0.00046166568,0.0000033145727,0.000013974359,0.000018884624,0.000058357375],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970077,0.000028602937,0.00051501027,0.00095673505,0.0010199806,0.0004719148],"domain_scores_gemma":[0.99755,0.00051184517,0.00055292033,0.0010826683,0.0002024168,0.00010011673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008424819,0.0003298455,0.00044646725,0.0007438981,0.0001378542,0.00026535336,0.0027275013,0.0003086319,0.000021032942],"category_scores_gemma":[0.00013575025,0.00031919437,0.00015102561,0.00054270576,0.00029054336,0.0007407688,0.0011149815,0.0004756299,0.00001876563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045411116,0.00004631689,0.00071537,0.000046592533,0.000022627857,0.0000173465,0.0015656523,0.0026175752,0.0001627859,0.22409639,0.00006171877,0.7706431],"study_design_scores_gemma":[0.0006939343,0.00031200887,0.0026338433,0.0009863208,0.000030723517,0.000038113365,4.3335982e-7,0.2651629,0.005262067,0.7040021,0.01930508,0.0015725084],"about_ca_topic_score_codex":0.0000105709,"about_ca_topic_score_gemma":0.000045244255,"teacher_disagreement_score":0.76907057,"about_ca_system_score_codex":0.00022546193,"about_ca_system_score_gemma":0.00023341132,"threshold_uncertainty_score":0.99992603},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000051517545,0.000059728365,0.9933616,0.002365793,0.00023842698,0.0017659963,0.0001116865,0.00019558564,0.0018960364],"genre_scores_gemma":[0.04689425,0.000007621198,0.9501219,0.0020582243,0.00013551772,0.0005479172,0.0000796476,0.000024879086,0.00013008757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960683,0.00001833386,0.00061863795,0.001785408,0.000989659,0.00051966694],"domain_scores_gemma":[0.99655545,0.0002928362,0.00032432043,0.0022799962,0.00037181246,0.00017558257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012711767,0.00044124507,0.00042645706,0.0005535262,0.00039759124,0.00038716008,0.0029477163,0.000201315,0.000011455231],"category_scores_gemma":[0.00002396887,0.00041600666,0.0001752588,0.00046192197,0.00038012065,0.00039857294,0.0012037352,0.00037798574,0.000020102792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019391623,0.00006665575,0.0000031379873,0.00004221155,0.0000055582996,0.0000012205106,0.00002713683,0.28067097,0.00008011492,0.5258615,0.000024636869,0.19321494],"study_design_scores_gemma":[0.00042702013,0.00003776017,0.000082051105,0.000058661357,0.0000072114353,0.0000013987283,3.8288437e-8,0.713309,0.0000972797,0.28158352,0.0040402687,0.00035578766],"about_ca_topic_score_codex":0.000029085317,"about_ca_topic_score_gemma":0.000054090193,"teacher_disagreement_score":0.43263805,"about_ca_system_score_codex":0.00069990574,"about_ca_system_score_gemma":0.002727892,"threshold_uncertainty_score":0.9998292},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007141161,0.00056921045,0.9914264,0.001614679,0.00072893075,0.00041728007,0.000006543687,0.0001466581,0.004376165],"genre_scores_gemma":[0.738047,0.000016757429,0.26117608,0.0003513349,0.00021532999,0.000012277333,0.000013078156,0.000023464301,0.00014466757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968345,0.00011047435,0.0007858885,0.0009502743,0.0007753246,0.00054351025],"domain_scores_gemma":[0.99574673,0.0021939187,0.0005961621,0.001176936,0.00022105631,0.000065194065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016135467,0.00037563627,0.0004712692,0.0004957179,0.00084236194,0.00045623648,0.0026499783,0.000206629,0.0000046772457],"category_scores_gemma":[0.00025625344,0.00030016433,0.00013055599,0.000731268,0.0007818371,0.00051620795,0.0009503311,0.00093105494,0.0000093828585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005115974,0.00011854575,0.0017718909,0.0003005235,0.00006897797,0.000093256844,0.00774214,0.37897095,0.008703407,0.086092316,0.0013414318,0.5147914],"study_design_scores_gemma":[0.00025625576,0.00006839889,0.00084167,0.0019199725,0.00002489466,0.00014133757,0.00000990354,0.90354174,0.0078744395,0.08384256,0.00070164335,0.00077720726],"about_ca_topic_score_codex":0.00012556041,"about_ca_topic_score_gemma":0.000037940288,"teacher_disagreement_score":0.7373329,"about_ca_system_score_codex":0.00016425976,"about_ca_system_score_gemma":0.00023827027,"threshold_uncertainty_score":0.99994504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010284011,0.00028611848,0.9964296,0.00004997647,0.00049167377,0.00061942684,0.000008873074,0.0000073825518,0.0010785047],"genre_scores_gemma":[0.93565273,0.00000698317,0.0639685,0.00019670272,0.00011935455,0.000009660719,0.0000053361555,0.000010893352,0.000029866607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792576,0.00007622446,0.00039953002,0.00057176483,0.00080168433,0.00022504025],"domain_scores_gemma":[0.99650186,0.00077023153,0.00043899604,0.0002590012,0.0019899963,0.000039941227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004207399,0.00020582399,0.0003176264,0.00055344176,0.00008405788,0.00004726248,0.00058135245,0.000161997,0.000006676825],"category_scores_gemma":[0.00024877107,0.00018988489,0.000087595436,0.00023950948,0.00035941912,0.0004338909,0.00013108419,0.00020350769,0.0000010445584],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006296214,0.00003480459,0.00004346405,0.00007162713,0.00004641107,7.946211e-7,0.0010338182,0.007715951,0.020142999,0.098094516,0.000007459845,0.8727452],"study_design_scores_gemma":[0.00075169443,0.0004347988,0.00073343655,0.0003020849,0.000067088935,0.000020104277,9.056323e-7,0.6812486,0.05423446,0.261915,0.000064961714,0.00022686573],"about_ca_topic_score_codex":0.000010329597,"about_ca_topic_score_gemma":0.000009801002,"teacher_disagreement_score":0.9346243,"about_ca_system_score_codex":0.00017292533,"about_ca_system_score_gemma":0.00036318626,"threshold_uncertainty_score":0.77432805},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015347902,0.00009823915,0.9987351,0.0000034009624,0.0005588603,0.00027347906,0.000017107152,0.00012798276,0.000032386466],"genre_scores_gemma":[0.07300291,0.00001697037,0.92675,0.000006388308,0.00016504311,0.000003976909,0.000009922405,0.00004069197,0.0000041079197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986235,0.000020164536,0.0002986188,0.00039197336,0.00038062313,0.00028512065],"domain_scores_gemma":[0.9993331,0.00007814517,0.000049602608,0.00031105644,0.00013570077,0.000092387454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026517993,0.00024300761,0.00027576817,0.00051606126,0.00008921221,0.00007716484,0.0003972912,0.0002074906,0.0000285048],"category_scores_gemma":[0.000021718653,0.00025473617,0.000044321605,0.0002674121,0.00015363294,0.0002493629,0.00012415691,0.00034564256,0.0000019235724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000396949,0.00001649783,5.32982e-7,0.000041533942,0.000008919311,0.000007323332,0.00007708952,0.9720961,0.008721806,0.000108215725,7.903246e-8,0.018917922],"study_design_scores_gemma":[0.00017311874,0.000074470314,0.000012035657,0.00029206282,0.00000631287,0.000012541885,1.0073115e-7,0.9824648,0.015525326,0.0011976298,0.0000013021829,0.00024032823],"about_ca_topic_score_codex":0.00004256166,"about_ca_topic_score_gemma":0.0000023853397,"teacher_disagreement_score":0.07284944,"about_ca_system_score_codex":0.00041176385,"about_ca_system_score_gemma":0.0001831063,"threshold_uncertainty_score":0.99999046},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003343325,0.00022531956,0.99509835,0.00030648356,0.0013156602,0.00068815704,0.000013683504,0.0018670722,0.00015091054],"genre_scores_gemma":[0.040593736,0.000009661749,0.95834166,0.00044744954,0.000388946,0.00003546349,0.000004217802,0.000050520845,0.00012832003],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588615,0.000049527604,0.0008014248,0.0014429846,0.0010745174,0.00074537826],"domain_scores_gemma":[0.9911831,0.005572352,0.00068144803,0.0017558067,0.00064550206,0.00016181153],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023470481,0.00056337257,0.0007485481,0.0007376799,0.00030023843,0.00037836636,0.0034940408,0.00058176334,0.000012572197],"category_scores_gemma":[0.0027842438,0.00052749383,0.00022622639,0.0006015964,0.00073893915,0.00034204443,0.001102364,0.0012439684,0.00002565282],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024907642,0.000066841276,0.00026039357,0.00012729639,0.000027495193,0.0000387547,0.0016889174,0.024873078,0.00086125993,0.0052587036,0.000098335695,0.96667403],"study_design_scores_gemma":[0.000114715185,0.0003410521,0.000036937916,0.00079651846,0.000010141052,0.00001622447,1.3311368e-8,0.40463737,0.0036136976,0.5899448,0.000091177106,0.00039735562],"about_ca_topic_score_codex":0.000036522204,"about_ca_topic_score_gemma":0.000008941185,"teacher_disagreement_score":0.96627665,"about_ca_system_score_codex":0.000113586124,"about_ca_system_score_gemma":0.00079953927,"threshold_uncertainty_score":0.99971765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022628017,0.0001129629,0.991438,0.00079916173,0.0018819942,0.00049497565,0.000029123297,0.000047332644,0.004970182],"genre_scores_gemma":[0.93356395,0.000035074198,0.060734525,0.0039202007,0.0009292894,0.000029188755,0.00014508837,0.000023385204,0.0006193154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950008,0.00009901111,0.0013615323,0.000736442,0.0024444347,0.00035781402],"domain_scores_gemma":[0.99671364,0.0013388445,0.0005854989,0.0009643491,0.0002984045,0.000099258825],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007487278,0.00030799935,0.0004669549,0.0021784098,0.00012279423,0.0013470707,0.0019217212,0.00025500514,0.00006485833],"category_scores_gemma":[0.0013453887,0.00024067725,0.00008280713,0.0008833184,0.00030257943,0.0020746642,0.00035852732,0.0005753278,0.00024378514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009051222,0.000015959491,0.00004490697,0.00002579004,0.0000018140887,0.000008794171,0.00092486496,0.25589126,0.000006142041,0.0073831403,0.00014313827,0.73554516],"study_design_scores_gemma":[0.00035475587,0.000074415984,0.00022710601,0.0005080871,0.0000052495056,0.0000039197093,0.000009414974,0.95553136,0.00026574556,0.014975707,0.027633045,0.00041118465],"about_ca_topic_score_codex":0.000086192566,"about_ca_topic_score_gemma":0.000875713,"teacher_disagreement_score":0.9333376,"about_ca_system_score_codex":0.00037353174,"about_ca_system_score_gemma":0.00032527887,"threshold_uncertainty_score":0.99968964},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005876537,0.00022243199,0.99698967,0.00044119896,0.00045264408,0.00021645403,0.00005219015,0.00013266785,0.00090507243],"genre_scores_gemma":[0.050655592,0.0000736026,0.94733876,0.0010208413,0.00047642642,0.00001959787,0.00007054102,0.000040502022,0.00030412394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687576,0.000013486508,0.0004125351,0.0015917579,0.00060096756,0.00050551246],"domain_scores_gemma":[0.99787277,0.00021351464,0.00017196783,0.0014647916,0.00012633522,0.00015061566],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005025612,0.00040326812,0.00034613765,0.0005210633,0.00030649084,0.0014807433,0.0034736858,0.00016170231,0.0000069883586],"category_scores_gemma":[0.000026962607,0.00038125357,0.00004935122,0.0003745747,0.00024557454,0.0014223128,0.0032260579,0.00040523073,0.0000069302514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001123812,0.000026173138,0.00026519725,0.000047237092,0.000007487942,0.000059703983,0.0002619833,0.049633168,0.0000346595,0.0064235074,0.00015553996,0.94308424],"study_design_scores_gemma":[0.00012689069,0.00002478155,0.00006790662,0.00032505006,0.0000065147988,0.000042937307,1.367702e-7,0.989112,0.00011336388,0.0087232655,0.0009977671,0.00045936208],"about_ca_topic_score_codex":0.00016733928,"about_ca_topic_score_gemma":0.00015971504,"teacher_disagreement_score":0.94262487,"about_ca_system_score_codex":0.00008608143,"about_ca_system_score_gemma":0.00021289868,"threshold_uncertainty_score":0.9998639},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052825466,0.00043993033,0.99312484,0.00027806123,0.0030085049,0.0008146391,0.0000017613506,0.0003591816,0.0014448168],"genre_scores_gemma":[0.8565639,0.00004870524,0.14068505,0.0017848944,0.0006894882,0.000012713528,0.0000059586514,0.00008137939,0.00012784985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99157,0.00020082886,0.001493704,0.0030560945,0.0016164179,0.0020629475],"domain_scores_gemma":[0.9938865,0.002220272,0.0006414869,0.0025011427,0.0003699318,0.0003807049],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003576631,0.0010749666,0.0014488986,0.0013375618,0.0003197456,0.00064130995,0.004529606,0.0010124424,0.000015328209],"category_scores_gemma":[0.00015290949,0.0010506647,0.00028345973,0.0018904814,0.0012545441,0.0005385963,0.0013743347,0.0024749385,0.000024094461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021574238,0.000063747604,0.00032776402,0.000019583431,0.000010329255,0.0003072942,0.0001724688,0.8109648,0.000016073704,0.011439021,0.0000022486165,0.1766551],"study_design_scores_gemma":[0.0010248212,0.00010891078,0.00037407211,0.0007072611,0.0000111406625,0.00007713046,3.1358726e-7,0.9918515,0.00009848065,0.0046138363,0.00008589133,0.001046627],"about_ca_topic_score_codex":0.00013129934,"about_ca_topic_score_gemma":0.0007685368,"teacher_disagreement_score":0.8560357,"about_ca_system_score_codex":0.0010417034,"about_ca_system_score_gemma":0.00046346863,"threshold_uncertainty_score":0.9998264},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015251609,0.0001595087,0.99257153,0.00074548007,0.0031798014,0.0010194888,0.00003443743,0.00015720328,0.0019800207],"genre_scores_gemma":[0.009663129,0.0000025328795,0.98564774,0.0013898232,0.0017624481,0.000028528792,0.000009329738,0.000073518146,0.0014229399],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924707,0.00017770813,0.0011271741,0.0024382614,0.0029400077,0.0008461545],"domain_scores_gemma":[0.96646357,0.03016017,0.0007948817,0.0017578729,0.0006464138,0.0001770705],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.009010034,0.0007002469,0.0009230258,0.001977375,0.00048347184,0.0007421104,0.003083374,0.0007038248,0.000064716834],"category_scores_gemma":[0.024440024,0.00053021224,0.00036304464,0.0012672237,0.00076355383,0.00018076976,0.0007064417,0.001496835,0.00004069123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005816245,0.000013741808,0.000039543072,0.000014199659,0.0000041088774,0.000010317149,0.00014312768,0.34330404,0.000008958943,0.0032857952,0.00008876121,0.65302926],"study_design_scores_gemma":[0.00020875927,0.00038250268,0.00017703339,0.000701845,0.000011347274,0.00003626463,1.6791044e-7,0.13408287,0.00026427282,0.8599088,0.0036965911,0.0005295205],"about_ca_topic_score_codex":0.000011200336,"about_ca_topic_score_gemma":0.000041004023,"teacher_disagreement_score":0.85662305,"about_ca_system_score_codex":0.00036993582,"about_ca_system_score_gemma":0.00043401215,"threshold_uncertainty_score":0.999715},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001880441,0.00040668386,0.97674406,0.00032519325,0.001198764,0.0003409263,0.0000026318744,0.0001410253,0.020821944],"genre_scores_gemma":[0.0056534614,0.000092799506,0.99276793,0.00058397086,0.0002598823,0.0000066252996,0.0000029638938,0.000021995393,0.0006103517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996805,0.000028426737,0.0005111111,0.0012811648,0.0008275823,0.0005467051],"domain_scores_gemma":[0.99745244,0.00030432368,0.00028138264,0.0015551404,0.00023699319,0.0001697221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018886811,0.0003553282,0.00031335148,0.0008476582,0.00028680352,0.00046617564,0.0023384884,0.00024584203,0.000022220507],"category_scores_gemma":[0.00017598073,0.00034866502,0.000049375805,0.00068267854,0.0007430785,0.00092936656,0.0009816458,0.00055415573,0.00005050209],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021432047,0.000017944803,0.000055970355,0.000021260716,0.0000041772887,0.000014596339,0.0003250843,0.0007011138,0.00024451822,0.21999195,0.000019916517,0.77860135],"study_design_scores_gemma":[0.00036366598,0.00024495085,0.001699488,0.00043469944,0.00001283174,0.00015110882,3.5434292e-7,0.5082206,0.0070323176,0.45701614,0.023577277,0.0012465715],"about_ca_topic_score_codex":0.000011204935,"about_ca_topic_score_gemma":0.00001791425,"teacher_disagreement_score":0.7773548,"about_ca_system_score_codex":0.00029797672,"about_ca_system_score_gemma":0.00025707425,"threshold_uncertainty_score":0.9998965},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001839635,0.00068522024,0.9961037,0.00011972073,0.00057756493,0.00061483704,0.000001981201,0.0006865767,0.0010264205],"genre_scores_gemma":[0.6282002,0.000010618259,0.3707815,0.0006665495,0.0002704244,0.000012366693,0.0000028172888,0.00002952877,0.000025987547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582607,0.00008913326,0.0006556616,0.0017929261,0.00095680053,0.00067939435],"domain_scores_gemma":[0.9975494,0.00018465873,0.0004540439,0.0013783094,0.00026987566,0.0001636941],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001127647,0.0006244668,0.00065116707,0.0014060064,0.00027682813,0.000688929,0.0027561923,0.00044439328,0.0000015938388],"category_scores_gemma":[0.000092779104,0.0005873136,0.00012692568,0.0013492996,0.00035617818,0.001527642,0.00042959242,0.0012512216,0.000008808275],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015436575,0.000022826931,0.00004070626,0.000064506654,0.0000016358044,0.00015964753,0.00012513902,0.012304265,0.0014692966,0.0019974983,7.230151e-7,0.9837983],"study_design_scores_gemma":[0.00044223803,0.0008858808,0.0007580866,0.0022719926,0.0000058300197,0.00011678903,5.472417e-7,0.862448,0.06725539,0.0645749,0.00012320057,0.001117157],"about_ca_topic_score_codex":0.000031553187,"about_ca_topic_score_gemma":0.00024733687,"teacher_disagreement_score":0.98268116,"about_ca_system_score_codex":0.00074366527,"about_ca_system_score_gemma":0.0004753589,"threshold_uncertainty_score":0.9996578},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101177844,0.00018446492,0.99308324,0.0038773278,0.00036490423,0.0009084104,0.000006557881,0.000105185834,0.001368748],"genre_scores_gemma":[0.274839,0.00005840223,0.71032447,0.014200374,0.0001704308,0.000025191204,0.0000116206265,0.00002582194,0.00034467466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963353,0.0001925592,0.0008476887,0.0009831325,0.0010766708,0.000564599],"domain_scores_gemma":[0.99677,0.00092411815,0.00041845255,0.0015467923,0.00014136628,0.00019926492],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032715567,0.0004598384,0.00054339744,0.00063706806,0.00025994197,0.0014285996,0.002364506,0.00025336063,0.0000015190506],"category_scores_gemma":[0.00019192793,0.000336038,0.00007960215,0.0004889327,0.0002725684,0.0014390569,0.0004295982,0.0008823399,0.000011149546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011054855,0.000024816343,0.0000320756,0.0000762357,0.0000022239374,0.0000012897007,0.0014284102,0.7317459,0.0000014608671,0.124035075,0.000042828113,0.14259866],"study_design_scores_gemma":[0.0002147707,0.00016455514,0.00022685836,0.00036149606,0.0000014695214,0.000008582577,6.8507376e-7,0.9760676,0.00002223297,0.021302091,0.0012782249,0.00035144488],"about_ca_topic_score_codex":0.00023580092,"about_ca_topic_score_gemma":0.000090131834,"teacher_disagreement_score":0.28275877,"about_ca_system_score_codex":0.00043490287,"about_ca_system_score_gemma":0.0011746461,"threshold_uncertainty_score":0.99990916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009088483,0.0001487359,0.9770369,0.000046973928,0.0001642603,0.00014255945,8.9184886e-7,0.00006607531,0.013305135],"genre_scores_gemma":[0.98087513,0.00001890982,0.017058715,0.0010494589,0.0006895566,0.0000021831784,0.000017283965,0.000036509395,0.0002522482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766964,0.000005889787,0.00044679543,0.00076564605,0.00066391815,0.00044810516],"domain_scores_gemma":[0.9981583,0.00022356966,0.0006380577,0.00066388305,0.0002940459,0.000022177457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011016392,0.00038854414,0.0007260611,0.0026812374,0.00020294622,0.0001782237,0.000958531,0.00018127215,0.00011345238],"category_scores_gemma":[0.000042946223,0.00031064547,0.00018668146,0.003152557,0.0007840724,0.00060006103,0.00037723046,0.0004399688,0.00000723035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031728487,0.000010887074,0.012364574,0.00003872879,0.00018256513,0.000016278675,0.00004093201,0.8670983,0.0000033395797,0.0021626647,0.0000012115041,0.11804882],"study_design_scores_gemma":[0.00013326759,0.000025723957,0.0022614812,0.00027503484,0.0007144913,0.0000021290073,5.101959e-7,0.9905918,0.000019675314,0.0048249564,0.000712829,0.0004380524],"about_ca_topic_score_codex":0.000042506297,"about_ca_topic_score_gemma":0.00063245883,"teacher_disagreement_score":0.9717867,"about_ca_system_score_codex":0.00008825979,"about_ca_system_score_gemma":0.000046843055,"threshold_uncertainty_score":0.99993455},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042024683,0.00018880819,0.9942533,0.000511716,0.00064002705,0.0010602465,0.0000114811255,0.0006625928,0.0026298133],"genre_scores_gemma":[0.09660045,0.000016198508,0.90157044,0.0012832895,0.0002974511,0.00002604525,0.000021039903,0.000049489903,0.00013559956],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9950844,0.00009052549,0.00057654263,0.0021052526,0.001413538,0.0007297614],"domain_scores_gemma":[0.9963831,0.00021838209,0.00037883793,0.00204246,0.0006883015,0.00028894623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001358379,0.00069441076,0.00067212223,0.0008816128,0.00030372426,0.000979707,0.0044332026,0.00048454045,0.000020575912],"category_scores_gemma":[0.00014669033,0.0005995156,0.00022826993,0.0009834791,0.001298075,0.0011595422,0.0005784232,0.0010569198,0.00003606493],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006224868,0.00027718846,0.0000151514205,0.00015644437,0.000021647278,0.0001312719,0.0005992955,0.0008969376,0.029751375,0.065641984,0.0000035575883,0.9024429],"study_design_scores_gemma":[0.0009091907,0.0010481776,0.00046039434,0.00041446378,0.000020253065,0.00006784915,5.446151e-7,0.24522243,0.6323969,0.11772738,0.00025192546,0.0014805199],"about_ca_topic_score_codex":0.000038800506,"about_ca_topic_score_gemma":0.0000032972703,"teacher_disagreement_score":0.90096235,"about_ca_system_score_codex":0.0008554812,"about_ca_system_score_gemma":0.0011709717,"threshold_uncertainty_score":0.99964565},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059087406,0.00068352604,0.98517644,0.00061960926,0.0007879875,0.00037299437,0.000007240734,0.00028141917,0.011479879],"genre_scores_gemma":[0.4182827,0.00037324618,0.576419,0.00061177346,0.0004036574,0.00001864302,0.000022967559,0.00008041197,0.0037875783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968458,0.00006869133,0.0006168789,0.0012910864,0.00070459733,0.0004729444],"domain_scores_gemma":[0.99803185,0.00024007233,0.00033505756,0.001084696,0.00014131589,0.00016698288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010001162,0.00042755084,0.0005383577,0.0005832381,0.00029891945,0.0003128031,0.0014582996,0.00029481866,0.000037107948],"category_scores_gemma":[0.000039171187,0.00038778273,0.00010940436,0.00061167596,0.0006374056,0.00039730643,0.00067744486,0.000992498,0.00002462782],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055356445,0.000105645246,0.00018634404,0.00014841167,0.000052950287,0.00003771471,0.0027900077,0.0377717,0.00006491335,0.025578957,0.000017657447,0.9332402],"study_design_scores_gemma":[0.00036281522,0.00026542778,0.000375212,0.0002838695,0.000017139106,0.00013729674,1.918771e-7,0.75817084,0.00013504799,0.23612143,0.003586339,0.0005443537],"about_ca_topic_score_codex":0.00006988661,"about_ca_topic_score_gemma":0.000020646043,"teacher_disagreement_score":0.9326958,"about_ca_system_score_codex":0.00010307656,"about_ca_system_score_gemma":0.00031971262,"threshold_uncertainty_score":0.9998574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000016292681,0.00027390505,0.9946892,0.0019325716,0.0008272458,0.0016060724,0.000007149359,0.0004860285,0.00017616696],"genre_scores_gemma":[0.025215473,0.000008662796,0.97100294,0.0014151211,0.0002698019,0.00015967828,0.00004278598,0.0000772796,0.0018082769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99547195,0.00009698088,0.0005715118,0.0015589718,0.0012467558,0.0010538077],"domain_scores_gemma":[0.9959772,0.0018384459,0.00034897905,0.0012074552,0.00042742668,0.0002004901],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016403359,0.0005550021,0.00047810166,0.0005978335,0.00089344993,0.0014202911,0.0042482098,0.00028151402,0.0000069841203],"category_scores_gemma":[0.00028204705,0.00042062261,0.0001816751,0.0013954121,0.00080278335,0.00048206374,0.0008696707,0.0011194466,0.000014521712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002401233,0.00005063347,0.0000013489284,0.000033615965,0.000006151826,0.0000053009444,0.0005464471,0.7150054,0.000014285511,0.00026382972,0.00002024271,0.28405035],"study_design_scores_gemma":[0.00056244707,0.00046967054,0.000010080636,0.00045287595,0.00001117357,0.000025988362,4.7155675e-7,0.98245966,0.000042367727,0.013483776,0.0019647693,0.00051673775],"about_ca_topic_score_codex":0.000014583779,"about_ca_topic_score_gemma":0.00003849635,"teacher_disagreement_score":0.2835336,"about_ca_system_score_codex":0.0013105611,"about_ca_system_score_gemma":0.004593493,"threshold_uncertainty_score":0.9998246},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024164513,0.00009801961,0.9965529,0.0012495583,0.0009081902,0.0006278717,0.000009041971,0.00006943875,0.00024332317],"genre_scores_gemma":[0.5848125,0.00014547231,0.41176182,0.002150964,0.0005802002,0.000058737645,0.00009890302,0.00003674313,0.00035466242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977758,0.000024525947,0.00048247122,0.0006804883,0.00066788465,0.00036882356],"domain_scores_gemma":[0.997877,0.0004427673,0.000539232,0.0006654897,0.00042739796,0.000048133585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083717756,0.00031740675,0.00033493707,0.00029828152,0.00047772532,0.00045890248,0.0013526889,0.0001293942,0.000006528775],"category_scores_gemma":[0.000043918462,0.00023652143,0.00008080905,0.00039890243,0.00029160175,0.00073632644,0.00014342564,0.0002444886,0.0000012699238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019969255,0.000012566425,0.00008193365,0.000052333915,0.0000052267205,6.596035e-7,0.0005351273,0.379593,0.00009048477,0.0016074358,0.000007986198,0.61799324],"study_design_scores_gemma":[0.0003945092,0.00033117336,0.0007426241,0.00038842755,0.000013574546,0.0000025313802,0.0000011573175,0.9891324,0.0049093287,0.0034710637,0.00034117483,0.00027201982],"about_ca_topic_score_codex":0.000004924493,"about_ca_topic_score_gemma":0.000022724811,"teacher_disagreement_score":0.6177212,"about_ca_system_score_codex":0.0001243007,"about_ca_system_score_gemma":0.00039536622,"threshold_uncertainty_score":0.9645064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004260635,0.00048659928,0.9931953,0.00026692587,0.003785867,0.0016366739,0.000017566641,0.000090981026,0.00009403598],"genre_scores_gemma":[0.27782065,0.00002815471,0.72132325,0.00024006834,0.00036881302,0.00006959193,0.000014966232,0.000030419613,0.00010409203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996138,0.00018907634,0.0009967908,0.0012970944,0.000805352,0.00057372096],"domain_scores_gemma":[0.996151,0.0010168102,0.00077561237,0.0014534973,0.0004656237,0.00013746358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002855469,0.0004681323,0.0006861956,0.0005577526,0.0005589945,0.00044630203,0.0026689211,0.0003076113,0.0000042484335],"category_scores_gemma":[0.000087381355,0.0003442606,0.0002195227,0.00036645564,0.00034335884,0.0005647845,0.00047397942,0.00042756938,0.000007180366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046446435,0.000039724513,0.0000059807876,0.000108840155,0.000020744988,0.000005541158,0.0024820403,0.91773254,0.00033987447,0.03501267,0.000001718471,0.044245712],"study_design_scores_gemma":[0.0004572541,0.00013365183,0.000021128606,0.0003949941,0.000020206517,0.000032072043,0.0000031616469,0.983577,0.00053029327,0.013947575,0.00050716806,0.00037550562],"about_ca_topic_score_codex":0.00038313554,"about_ca_topic_score_gemma":0.00010428409,"teacher_disagreement_score":0.27739456,"about_ca_system_score_codex":0.0003825854,"about_ca_system_score_gemma":0.0005098397,"threshold_uncertainty_score":0.99990094},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002263077,0.00026387468,0.97747403,0.00054901495,0.001852967,0.00037837517,0.0000058386263,0.00014435405,0.01930891],"genre_scores_gemma":[0.08059894,0.00038185687,0.9066018,0.00584951,0.0012100564,0.00004138513,0.00004628457,0.00010833771,0.0051618274],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99607337,0.00003584349,0.0005477833,0.0017081413,0.0008508292,0.0007840574],"domain_scores_gemma":[0.99755514,0.00019163592,0.00022151576,0.0017878037,0.00010099129,0.00014292804],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012095723,0.0005200372,0.0005297121,0.0013122412,0.0001308069,0.00055800803,0.0055412757,0.00023654386,0.00006721245],"category_scores_gemma":[0.00005375055,0.00047153153,0.00011227191,0.0008611292,0.0005093298,0.0011420945,0.0026788942,0.00078111363,0.00015784656],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043666,0.000033990826,0.000049568964,0.000026328114,0.000007022241,0.00022453496,0.0004858285,0.0067100655,0.000011204904,0.061158575,0.00010111952,0.9311874],"study_design_scores_gemma":[0.00061834825,0.00015876086,0.00040157663,0.0004661476,0.0000073464616,0.0000280299,1.6190347e-7,0.49073917,0.00020464767,0.49146307,0.014795295,0.0011174424],"about_ca_topic_score_codex":0.00012686345,"about_ca_topic_score_gemma":0.00030627396,"teacher_disagreement_score":0.9300699,"about_ca_system_score_codex":0.0002445767,"about_ca_system_score_gemma":0.00028069623,"threshold_uncertainty_score":0.99983925},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013548437,0.00053248584,0.995343,0.00023369698,0.0018779696,0.0007531811,0.0000074169834,0.0007357443,0.0005029225],"genre_scores_gemma":[0.0026758898,0.000023661323,0.995865,0.000501216,0.00036936242,0.00003693187,0.0000061768496,0.00004229126,0.00047950892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962195,0.000029498895,0.00051875965,0.0016694224,0.0006916765,0.0008711375],"domain_scores_gemma":[0.99655277,0.0013140166,0.0002076654,0.0014155362,0.00035701942,0.00015300687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011727387,0.00058101455,0.0006207228,0.00072634645,0.00022774078,0.00025424984,0.0028898139,0.00034830876,0.0000021340495],"category_scores_gemma":[0.0010715672,0.00055175344,0.00017113297,0.00056648406,0.0002517655,0.0006470492,0.0008299821,0.00071067066,0.0000116780575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024071342,0.0000070797228,6.12294e-7,0.000022598044,0.0000036708411,0.000011427926,0.00019691659,0.54815024,0.00007558411,0.010238244,0.0000065288846,0.4412847],"study_design_scores_gemma":[0.0001672656,0.00014705301,0.0000023899784,0.00018019234,0.0000039885153,0.000020655298,7.266514e-8,0.7083345,0.00082525436,0.28931868,0.00066499633,0.0003349185],"about_ca_topic_score_codex":0.0000028445124,"about_ca_topic_score_gemma":0.00000460024,"teacher_disagreement_score":0.44094977,"about_ca_system_score_codex":0.00032881653,"about_ca_system_score_gemma":0.00038345953,"threshold_uncertainty_score":0.9996934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026768843,0.0004193954,0.99415106,0.000044400946,0.0013197855,0.00041256731,0.0000038118321,0.00021242659,0.0034098167],"genre_scores_gemma":[0.08364635,0.000015285925,0.9132847,0.0002001102,0.0013946649,0.000038241047,0.000009909747,0.00006857221,0.0013421674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984717,0.0000074945992,0.00030255562,0.0005037659,0.00026917664,0.00044531142],"domain_scores_gemma":[0.9991259,0.00021368283,0.0000721871,0.0003103783,0.00022415785,0.000053667212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029801248,0.00031403577,0.00027774324,0.00039105458,0.00017101788,0.00028879708,0.00044069585,0.0002476761,0.000012847503],"category_scores_gemma":[0.000013064709,0.0003090347,0.00008323843,0.00020864692,0.00022342746,0.00026841354,0.00006470924,0.00034408466,0.0000044628077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046269074,0.000003004408,0.0000057642415,0.000079968064,0.0000069271737,0.00001015626,0.00003320048,0.7368191,0.000106227046,0.028962607,0.00064562255,0.23332278],"study_design_scores_gemma":[0.00015900974,0.00005343366,0.000024649926,0.00016605791,0.0000085424945,0.000020924568,1.5678465e-7,0.88659257,0.0020813341,0.0984482,0.012048517,0.0003966012],"about_ca_topic_score_codex":0.000008261119,"about_ca_topic_score_gemma":0.000014552921,"teacher_disagreement_score":0.23292619,"about_ca_system_score_codex":0.00038972555,"about_ca_system_score_gemma":0.00013334166,"threshold_uncertainty_score":0.99993616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059647695,0.0011996767,0.98769933,0.0014789517,0.0026423275,0.00035489563,0.0000021274452,0.00049375644,0.0055324384],"genre_scores_gemma":[0.23693855,0.00019636757,0.7536695,0.006604369,0.0014440856,0.000021320364,0.000005756876,0.000082127386,0.0010379311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573493,0.000042042207,0.00061640196,0.0016659691,0.0010530491,0.00088762277],"domain_scores_gemma":[0.99715585,0.00039499303,0.00021330995,0.0019175474,0.0001252981,0.00019299703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058929663,0.0006332298,0.000719027,0.0008248429,0.0002793017,0.00074717886,0.0041466053,0.00038738633,0.00016209116],"category_scores_gemma":[0.00006568905,0.0005401691,0.0001734357,0.0005919751,0.00073909946,0.00058722124,0.00090951595,0.00069057144,0.00032845724],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017728235,0.000028847868,0.000048137656,0.00005396205,0.000015834885,0.00025358086,0.00065973744,0.0049829693,0.00005893032,0.016260386,0.00013511452,0.97750074],"study_design_scores_gemma":[0.00025601382,0.00013768833,0.00030355982,0.0004221462,0.000013321667,0.00022793931,1.6394688e-7,0.78464264,0.0009220798,0.2090973,0.0030846526,0.0008925132],"about_ca_topic_score_codex":0.000032564843,"about_ca_topic_score_gemma":0.00008291741,"teacher_disagreement_score":0.9766082,"about_ca_system_score_codex":0.00020550158,"about_ca_system_score_gemma":0.000652238,"threshold_uncertainty_score":0.99970496},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017407598,0.0003711585,0.9926538,0.000399204,0.0041053086,0.00052022556,0.000008752403,0.00044259286,0.0013249206],"genre_scores_gemma":[0.50244063,0.000012495505,0.49374482,0.002468565,0.00081269,0.000015658126,0.000019250365,0.000099902834,0.00038598105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577564,0.00007684521,0.0007299552,0.0015859163,0.0011673154,0.00066430576],"domain_scores_gemma":[0.99739325,0.00028263414,0.00046578763,0.0014486164,0.00019070166,0.00021903511],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009862892,0.00057056086,0.00061331387,0.0009152588,0.0002454887,0.00052234204,0.0024704137,0.0003480447,0.00001131349],"category_scores_gemma":[0.00004537693,0.0005194808,0.0001921333,0.0006076494,0.00021256905,0.0004661717,0.00029728672,0.0005850207,0.000034997494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014891041,0.00025960102,0.00035380106,0.0010754868,0.00006685127,0.000689656,0.0021567233,0.14189014,0.001444466,0.10357883,0.00045865893,0.7480109],"study_design_scores_gemma":[0.00039410853,0.000092936076,0.000084834006,0.00092637516,0.000009250197,0.00006619551,3.342679e-7,0.9916236,0.00091452425,0.0021850134,0.00306187,0.0006409611],"about_ca_topic_score_codex":0.0000318587,"about_ca_topic_score_gemma":0.00005514259,"teacher_disagreement_score":0.8497335,"about_ca_system_score_codex":0.0007216343,"about_ca_system_score_gemma":0.00041016896,"threshold_uncertainty_score":0.9997257},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007317684,0.00085679744,0.99239,0.0010571198,0.0005401968,0.0007609066,0.0000079977835,0.00048994995,0.0038238761],"genre_scores_gemma":[0.12180187,0.00013448638,0.8745795,0.0018207066,0.0010607309,0.00007397944,0.000008445048,0.00011959834,0.0004006765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945922,0.00006976288,0.0006132312,0.00235686,0.0013223647,0.0010455683],"domain_scores_gemma":[0.99582434,0.00065447367,0.0004196637,0.0024948376,0.00029249274,0.0003141818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009055969,0.0008714273,0.00072800653,0.0013381195,0.00058371486,0.00087959156,0.0049808496,0.00035596758,0.00003229265],"category_scores_gemma":[0.00003195912,0.00067860767,0.0002179787,0.001776376,0.0013898683,0.00037814814,0.0012694407,0.0014918514,0.00008071754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048146767,0.00006515977,0.000037669062,0.00004931554,0.000026534712,0.00010516921,0.00053340977,0.06055072,0.000026313659,0.20834632,0.000022139386,0.7302324],"study_design_scores_gemma":[0.00024026216,0.0002482003,0.000076935496,0.0003816651,0.000012032358,0.00024255412,1.2488692e-7,0.7529708,0.00006708123,0.24038915,0.004554206,0.00081699045],"about_ca_topic_score_codex":0.000016228152,"about_ca_topic_score_gemma":0.000026615817,"teacher_disagreement_score":0.7294154,"about_ca_system_score_codex":0.00014879025,"about_ca_system_score_gemma":0.0003818676,"threshold_uncertainty_score":0.9995665},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003092922,0.00056642253,0.9756443,0.00045161598,0.0016885082,0.0002925514,0.0000033124306,0.00032854485,0.020715471],"genre_scores_gemma":[0.35945544,0.00020720191,0.6352995,0.002664031,0.001401686,0.00002706916,0.000011735841,0.00009182069,0.00084151316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958772,0.000034822016,0.0004837211,0.0017543762,0.0009784377,0.0008714227],"domain_scores_gemma":[0.9972145,0.0003168811,0.00023552334,0.0018160028,0.00018239026,0.00023471791],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010773076,0.00060627185,0.000571795,0.0010728805,0.00038790985,0.0008219111,0.0046945163,0.00033236886,0.0000873326],"category_scores_gemma":[0.00002298098,0.00055707997,0.00026326888,0.0010006429,0.0008281285,0.0006365453,0.001502572,0.0008676026,0.00009388799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026893902,0.00005614049,0.00007623275,0.000033463362,0.000027792474,0.000360354,0.0008570904,0.036039535,0.00020587852,0.36929283,0.00004704041,0.59297675],"study_design_scores_gemma":[0.0008303328,0.00037762005,0.000098300436,0.00056714955,0.00002259666,0.0005204277,3.3378845e-7,0.23708168,0.002390202,0.7396453,0.016746266,0.0017197834],"about_ca_topic_score_codex":0.00002066519,"about_ca_topic_score_gemma":0.000028607828,"teacher_disagreement_score":0.591257,"about_ca_system_score_codex":0.0001704724,"about_ca_system_score_gemma":0.00036268772,"threshold_uncertainty_score":0.9996881},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015381846,0.0003894323,0.9852006,0.0012691004,0.0005912248,0.00035500966,0.000004417473,0.000057850462,0.011978537],"genre_scores_gemma":[0.5444634,0.0003119899,0.44270867,0.009071349,0.0004915804,0.00004799587,0.000005071542,0.00014260186,0.0027573307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964856,0.0000989357,0.0003992855,0.0011016087,0.0013028106,0.0006117843],"domain_scores_gemma":[0.9952609,0.0021323366,0.0002480775,0.0020173774,0.00022478789,0.000116497824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014826212,0.0004059295,0.0004405635,0.00075358996,0.00023013898,0.00019880453,0.0048509925,0.00018862014,0.00004879293],"category_scores_gemma":[0.00027862293,0.00026603136,0.00015112167,0.0010124377,0.00096838316,0.00028037903,0.0008829194,0.0009087249,0.000037424586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101029855,0.000029309598,0.000018610908,0.000022457984,0.00001136025,0.000031864107,0.00031492964,0.014752628,0.00012857618,0.7660144,0.00007124944,0.21859452],"study_design_scores_gemma":[0.00017231915,0.000268541,0.000021407574,0.00025205215,0.000002901739,0.000024990373,1.4218162e-7,0.058639403,0.0039902185,0.9349281,0.0013553948,0.00034453216],"about_ca_topic_score_codex":0.0000034375048,"about_ca_topic_score_gemma":0.000023509234,"teacher_disagreement_score":0.5443096,"about_ca_system_score_codex":0.000112751644,"about_ca_system_score_gemma":0.00027113783,"threshold_uncertainty_score":0.9999792},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014168996,0.0001661912,0.9921116,0.0003643517,0.00033468186,0.00033608713,0.0000031287311,0.004007119,0.002535114],"genre_scores_gemma":[0.19083038,0.000001892676,0.8079874,0.0010097867,0.00008908209,0.0000054426,0.0000016492621,0.000027560938,0.000046836918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960629,0.000034737644,0.00074536353,0.001322505,0.001178969,0.00065554556],"domain_scores_gemma":[0.9958973,0.0010407745,0.00053961744,0.0018560598,0.00050128775,0.00016494497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011866083,0.0005777329,0.0007259929,0.0010277611,0.00019261503,0.00030501612,0.0038804205,0.00034005317,0.000004059602],"category_scores_gemma":[0.0009059872,0.0005348062,0.00015528368,0.0009801731,0.00059355237,0.00034856232,0.0007991444,0.0007158501,0.000008276922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010130364,0.000026501597,0.00006563299,0.000063702435,0.0000027731544,0.000025391531,0.00014458912,0.21886402,0.000030883723,0.0007357085,0.0000510758,0.7799887],"study_design_scores_gemma":[0.000112379326,0.00019884975,0.00009541392,0.001158366,0.000006623537,0.000029154957,5.4873683e-9,0.7433535,0.0008507242,0.25375912,0.000021860715,0.00041401945],"about_ca_topic_score_codex":0.000035288864,"about_ca_topic_score_gemma":0.0000064623337,"teacher_disagreement_score":0.7795747,"about_ca_system_score_codex":0.00027648726,"about_ca_system_score_gemma":0.0016229962,"threshold_uncertainty_score":0.9997103},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045447687,0.00028808817,0.99105775,0.0018902896,0.0009762368,0.0004976465,0.000013607526,0.0003423487,0.0048885876],"genre_scores_gemma":[0.1492837,0.000055989363,0.8437759,0.004534566,0.0009059873,0.000029032057,0.00010192743,0.000072187606,0.0012406431],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953209,0.000054009677,0.0006216698,0.0017828895,0.0015379676,0.0006825617],"domain_scores_gemma":[0.99710155,0.00032104625,0.00043427112,0.0015412325,0.00039023452,0.00021164218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010564406,0.0006117731,0.00048915186,0.0009955791,0.00030012208,0.00074236764,0.003283678,0.0003589257,0.00007594093],"category_scores_gemma":[0.00008898125,0.000595557,0.0001773097,0.000768268,0.00055952644,0.0012432383,0.000693865,0.000896743,0.0001516363],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010768807,0.00009095585,0.000008037674,0.000072452836,0.000018073963,0.0001472543,0.0009430349,0.024283431,0.0029788695,0.19223039,0.00013065641,0.77908605],"study_design_scores_gemma":[0.00029572556,0.00014646148,0.00018696273,0.0003310107,0.000012252804,0.00008720516,9.102248e-8,0.44946617,0.0025178771,0.54521483,0.0010630555,0.00067838404],"about_ca_topic_score_codex":0.000008560263,"about_ca_topic_score_gemma":0.000022082204,"teacher_disagreement_score":0.7784077,"about_ca_system_score_codex":0.000562532,"about_ca_system_score_gemma":0.0007275145,"threshold_uncertainty_score":0.9996496},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000076463424,0.0010228894,0.99534893,0.00055232766,0.0016435133,0.0006737595,0.0000033303197,0.00015567392,0.0005230914],"genre_scores_gemma":[0.22710088,0.0005324051,0.76943797,0.0009232167,0.0007256329,0.000089396366,0.000013358291,0.000053731135,0.0011234105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996496,0.00020007516,0.0005391194,0.0016152584,0.0006947093,0.0004548054],"domain_scores_gemma":[0.99672097,0.00090991857,0.0003206783,0.0014747506,0.00042453167,0.00014915157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010445248,0.00041091695,0.00044419488,0.00060962164,0.000275224,0.00077856064,0.0026062045,0.0002769317,0.0000035419084],"category_scores_gemma":[0.0001958467,0.00038936155,0.000056569726,0.0008311323,0.0007461088,0.0011046239,0.00057612837,0.00066992495,0.000072599665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079302015,0.00034653454,0.0002207387,0.00033347963,0.000071533876,0.00015914235,0.01739218,0.13781634,0.0012437273,0.025906077,0.0043476135,0.8120833],"study_design_scores_gemma":[0.00027316442,0.00025499208,0.0006067618,0.00043112,0.0000084728,0.00026693338,9.1120614e-7,0.9506446,0.0037249182,0.03569603,0.0072771325,0.0008149499],"about_ca_topic_score_codex":0.00002032906,"about_ca_topic_score_gemma":0.0000063845932,"teacher_disagreement_score":0.8128283,"about_ca_system_score_codex":0.00066469697,"about_ca_system_score_gemma":0.001006261,"threshold_uncertainty_score":0.9998558},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024343608,0.000335254,0.9793477,0.000016979242,0.0010478863,0.0001906371,0.000006014061,0.00005324242,0.018977921],"genre_scores_gemma":[0.7791057,0.00011696051,0.2200016,0.00019080291,0.00032979329,0.0000043891364,0.000029551118,0.000058358408,0.00016279699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982692,0.00001196087,0.00028444655,0.00023840525,0.0010239448,0.00017203609],"domain_scores_gemma":[0.99920154,0.000099409786,0.00007850047,0.00028082216,0.00029566156,0.00004406426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014938044,0.00016830997,0.0001824646,0.00033730303,0.000030968386,0.00003628997,0.0002684915,0.0001558143,0.0000889104],"category_scores_gemma":[0.000052566545,0.00016584335,0.000033661792,0.00016889193,0.00014191729,0.000051332598,0.000055713434,0.00023744283,0.0000099907675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.2162603e-7,0.0000031244701,0.00000770632,0.000020700409,0.000004556444,8.1844126e-7,0.000099526194,0.7292898,0.000023309885,0.0003730594,0.000015460719,0.27016145],"study_design_scores_gemma":[0.00012612277,0.000026267866,0.00003159639,0.00017757015,0.000020021736,0.0000031349573,4.109497e-8,0.9839214,0.0009732291,0.013738432,0.00081140647,0.0001707443],"about_ca_topic_score_codex":0.0000018705286,"about_ca_topic_score_gemma":0.000016420241,"teacher_disagreement_score":0.7790814,"about_ca_system_score_codex":0.00023882605,"about_ca_system_score_gemma":0.00012703484,"threshold_uncertainty_score":0.67628956},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008090095,0.0016113503,0.9939574,0.001943165,0.00093489955,0.0005341993,0.000002435272,0.00010525791,0.00010228986],"genre_scores_gemma":[0.2450108,0.0009212601,0.7511968,0.0017888105,0.0005295378,0.00011682136,0.000013435254,0.00004235536,0.0003801825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737483,0.000019726358,0.00043785773,0.0011598165,0.00048328904,0.00052445347],"domain_scores_gemma":[0.9983132,0.00046444588,0.00016199153,0.0007823027,0.00015983469,0.00011826271],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050887774,0.000306225,0.00032665688,0.00034787692,0.00030761285,0.00039447861,0.0014205846,0.00017324185,0.0000030093229],"category_scores_gemma":[0.00004287305,0.00028667218,0.00009277802,0.00055503636,0.00037956407,0.0012968883,0.00062155153,0.00032978604,0.000019432548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010494855,0.00019414298,0.00016981941,0.00005504745,0.000009910757,0.00008413913,0.003899669,0.059567638,0.0009971586,0.11664362,0.00015997882,0.8182084],"study_design_scores_gemma":[0.0002940862,0.00012804782,0.00031123194,0.00042925755,0.0000027305052,0.000059613816,6.7005305e-7,0.8937381,0.0018429809,0.09882387,0.0039219144,0.00044751467],"about_ca_topic_score_codex":0.000032531785,"about_ca_topic_score_gemma":0.00009423905,"teacher_disagreement_score":0.83417046,"about_ca_system_score_codex":0.00024228699,"about_ca_system_score_gemma":0.00027389554,"threshold_uncertainty_score":0.9999585},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000043636596,0.00027009923,0.9899971,0.0004398357,0.0011164634,0.00037920615,0.0000017443095,0.0005218058,0.0072694197],"genre_scores_gemma":[0.02452088,0.00009020941,0.9707778,0.0030521695,0.00065897766,0.000018804954,0.0000028611428,0.00003413882,0.00084412406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963282,0.000033586617,0.0005244369,0.0013649174,0.0012060166,0.00054287823],"domain_scores_gemma":[0.99779654,0.00023364293,0.00025143864,0.0012658988,0.00023063697,0.00022186768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008125152,0.00042890754,0.0003843251,0.00089173525,0.00019045903,0.00047169445,0.0029828716,0.000333962,0.000060672093],"category_scores_gemma":[0.00006869031,0.000404817,0.00011303313,0.000526124,0.00058272877,0.0013977536,0.0010524368,0.0008310631,0.000080891616],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012952929,0.000013503925,5.3282196e-7,0.000011606023,0.0000033190843,0.000024029821,0.00027366896,0.005591059,0.000509412,0.004142831,0.000029385206,0.9893994],"study_design_scores_gemma":[0.00015262808,0.00011069806,0.000005786543,0.00016807645,0.0000044478647,0.000057315367,5.7090777e-8,0.7340591,0.038439795,0.2257778,0.0007294601,0.0004948382],"about_ca_topic_score_codex":0.000015024306,"about_ca_topic_score_gemma":0.000038724316,"teacher_disagreement_score":0.98890454,"about_ca_system_score_codex":0.00045045296,"about_ca_system_score_gemma":0.00034778452,"threshold_uncertainty_score":0.9998404},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043010918,0.0012101523,0.9966062,0.00004266776,0.00080542464,0.00037114465,0.0000033894905,0.0001739676,0.00035695173],"genre_scores_gemma":[0.11476022,0.00018114268,0.88482034,0.000105545565,0.000061631494,0.000013065978,6.257194e-7,0.000025084291,0.000032368498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969799,0.00007724001,0.0004936045,0.001434453,0.00047368198,0.0005411556],"domain_scores_gemma":[0.99693215,0.0017481354,0.00016627769,0.0007798169,0.00028043715,0.000093173374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012806308,0.0004573308,0.00056887226,0.0015757789,0.0002433611,0.0002907456,0.0015463013,0.00027367807,0.000004161618],"category_scores_gemma":[0.0008725114,0.00045178563,0.00005801795,0.0015020394,0.00033701665,0.00081035827,0.0014593038,0.00080104574,0.0000034278416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065356494,0.000006663752,0.00003625934,0.000009599529,0.0000055322453,0.000044048,0.0019494715,0.7585597,0.000013587353,0.004882105,6.4313e-7,0.23448588],"study_design_scores_gemma":[0.00012366356,0.00005312185,0.00014835021,0.0005076214,0.0000032786672,0.000016991393,6.488341e-7,0.607952,0.000044971825,0.3908108,0.000010228901,0.00032830166],"about_ca_topic_score_codex":0.000010832132,"about_ca_topic_score_gemma":0.0001031084,"teacher_disagreement_score":0.3859287,"about_ca_system_score_codex":0.0006300639,"about_ca_system_score_gemma":0.00048746142,"threshold_uncertainty_score":0.9997934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016935775,0.00012916129,0.9771143,0.018613108,0.0013237725,0.0011850364,0.00008354157,0.00015030215,0.0013838373],"genre_scores_gemma":[0.22688489,0.000033365814,0.76670396,0.0052451054,0.00055621745,0.000106283056,0.000059801874,0.000057881774,0.00035249838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715585,0.00006463947,0.00061949284,0.0011233308,0.0005075072,0.000529189],"domain_scores_gemma":[0.99613947,0.0012454871,0.0006030418,0.0016056509,0.00029364735,0.00011268166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016351162,0.0004952068,0.0005690308,0.00060246704,0.0003717396,0.0004471989,0.0029377595,0.00023667086,0.000011330148],"category_scores_gemma":[0.00009970519,0.00034509637,0.00023637009,0.00038506417,0.00028074902,0.00033653606,0.00047065425,0.0006908484,0.0000026689427],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015495107,0.000055521443,0.000021855329,0.00006666437,0.000021066622,0.0000056577924,0.0003169497,0.003850374,0.00018193875,0.012388069,0.0035021834,0.9795742],"study_design_scores_gemma":[0.0003161539,0.00026939865,0.0000121927405,0.00075416506,0.000008964692,0.000021266993,2.7543905e-7,0.9179185,0.005272835,0.041650593,0.033257723,0.00051793194],"about_ca_topic_score_codex":0.0000678432,"about_ca_topic_score_gemma":0.00011246955,"teacher_disagreement_score":0.9790563,"about_ca_system_score_codex":0.00024506843,"about_ca_system_score_gemma":0.0004398235,"threshold_uncertainty_score":0.9999001},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039239653,0.0000648806,0.9875066,0.0078408085,0.0002941681,0.0014277989,0.000052358595,0.00021353604,0.0022074487],"genre_scores_gemma":[0.07355358,0.000023962953,0.9224156,0.0035762032,0.00006893651,0.00016709561,0.00001781051,0.000026303815,0.00015051843],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99583006,0.000057314024,0.00087388733,0.0015401972,0.0009698642,0.00072867],"domain_scores_gemma":[0.9964364,0.00041861128,0.00035369914,0.002224821,0.0003671507,0.00019928027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009872551,0.00050863106,0.0006811382,0.0012356528,0.00011850208,0.00019136259,0.004912099,0.00028592284,0.000003585878],"category_scores_gemma":[0.000104796454,0.000507202,0.00008203733,0.003323188,0.00043265783,0.00025102904,0.0024219207,0.00051738444,0.000029736848],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019623092,0.00013672249,0.0001809165,0.000152325,0.000038247712,0.000042830135,0.0023629307,0.094485044,0.0003331743,0.10086171,0.00017424628,0.80121225],"study_design_scores_gemma":[0.0018757151,0.0008966381,0.027669007,0.002136537,0.00004704552,0.0000638281,0.000021243004,0.23377834,0.018098854,0.6717616,0.03859323,0.0050579836],"about_ca_topic_score_codex":0.00011191478,"about_ca_topic_score_gemma":0.0010500252,"teacher_disagreement_score":0.79615426,"about_ca_system_score_codex":0.00044488846,"about_ca_system_score_gemma":0.00021645088,"threshold_uncertainty_score":0.999738},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030346294,0.0026322757,0.9927937,0.00011065761,0.00045672266,0.0005511961,0.0000017789246,0.00003600399,0.00038307326],"genre_scores_gemma":[0.8985502,0.00015267126,0.10091223,0.00018151653,0.00015150623,0.000011193838,0.0000033565407,0.000027385811,0.000009910057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963367,0.00010621556,0.00088516966,0.0011125184,0.0007044424,0.0008549733],"domain_scores_gemma":[0.9948596,0.0033514868,0.0005712308,0.0008956942,0.00020432044,0.000117695956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036157623,0.00047256742,0.0005342155,0.00091300166,0.00019222696,0.00037534538,0.002017711,0.00037093728,0.0000034047218],"category_scores_gemma":[0.00021064271,0.00036586658,0.000110686306,0.0013817025,0.0005855128,0.00049365987,0.0008945904,0.0011651545,8.1725403e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012612294,0.00001005033,0.00048072977,0.000011409516,0.0000024470683,0.000041771757,0.00039399302,0.41612414,0.000010947207,0.00069246476,0.0000017087438,0.58221775],"study_design_scores_gemma":[0.00046938672,0.00021090932,0.0063053397,0.0008763246,0.0000026926589,0.00003219565,5.88219e-7,0.98459756,0.000049207396,0.00708384,0.000026128379,0.0003458502],"about_ca_topic_score_codex":0.00007722456,"about_ca_topic_score_gemma":0.0010557268,"teacher_disagreement_score":0.8955156,"about_ca_system_score_codex":0.0005264722,"about_ca_system_score_gemma":0.00040028532,"threshold_uncertainty_score":0.9998793},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003987704,0.0007020114,0.98596305,0.0024418258,0.00076859473,0.00032853303,0.000019021336,0.00015083158,0.00563842],"genre_scores_gemma":[0.5117407,0.00020325386,0.48131686,0.0058303117,0.0006786816,0.000011248541,0.000029901457,0.00005281304,0.00013625523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970738,0.00003383016,0.0005253411,0.0011381148,0.0007416822,0.00048718863],"domain_scores_gemma":[0.99784875,0.00033495668,0.0003424954,0.0010050096,0.00030058497,0.0001681779],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043227113,0.00044714415,0.0004919776,0.001067147,0.0002692573,0.00025839597,0.0021983085,0.0002626592,0.000015482632],"category_scores_gemma":[0.000006526067,0.00041694043,0.0000851643,0.0009978215,0.00032778634,0.000623684,0.0013589287,0.0005733928,0.000021697067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002423234,0.00012667177,0.00021865743,0.00048971776,0.00006291412,0.00006550371,0.007354428,0.036263715,0.014787991,0.12010401,0.000017236958,0.82048494],"study_design_scores_gemma":[0.0009932407,0.00038296793,0.00056522025,0.0021199835,0.00005561913,0.00034814895,0.0000028945021,0.8912176,0.012175802,0.08278381,0.0077930395,0.0015616732],"about_ca_topic_score_codex":0.000068815534,"about_ca_topic_score_gemma":0.0006469405,"teacher_disagreement_score":0.8549539,"about_ca_system_score_codex":0.00010989293,"about_ca_system_score_gemma":0.00031240517,"threshold_uncertainty_score":0.9998282},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003128749,0.00009737117,0.9950152,0.0014460781,0.0006700017,0.00078609015,0.000005491581,0.0004797316,0.0014968944],"genre_scores_gemma":[0.028192895,0.000036272202,0.9701781,0.001061496,0.0002731942,0.000042171014,0.00005094443,0.0000142413,0.00015068459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689484,0.000032856005,0.0007230516,0.00093073276,0.0008386566,0.0005798405],"domain_scores_gemma":[0.9973329,0.00040298232,0.000530512,0.00095728465,0.0006049616,0.00017141618],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010829424,0.0004331642,0.0005610512,0.0014041875,0.00025393936,0.001053107,0.0018738166,0.00031245354,0.000009061009],"category_scores_gemma":[0.00017022314,0.00039879957,0.00027887456,0.001221132,0.0003307115,0.0014132031,0.0007127526,0.00051883986,0.000022169372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003843207,0.000036669913,0.000035924142,0.000024365434,0.00004906602,0.0000035769567,0.0003558757,0.10947073,8.075835e-7,0.038307264,0.00012355969,0.8515883],"study_design_scores_gemma":[0.00021079551,0.00019211818,0.000028010076,0.000091654176,0.000047985148,0.000018942583,9.6511116e-8,0.9667496,0.00011652709,0.013938467,0.018131083,0.00047470912],"about_ca_topic_score_codex":0.000008514131,"about_ca_topic_score_gemma":0.000025597074,"teacher_disagreement_score":0.8572789,"about_ca_system_score_codex":0.00028989805,"about_ca_system_score_gemma":0.00057571457,"threshold_uncertainty_score":0.9999839},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012413342,0.00016711843,0.98611146,0.0005600679,0.0003730009,0.00051945855,0.000008635169,0.00003438534,0.010984565],"genre_scores_gemma":[0.9872467,0.0000051295965,0.010785803,0.0014224778,0.00049968617,0.0000023978314,7.621204e-7,0.000015973152,0.000021055106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974475,0.00007126529,0.00036371275,0.000538146,0.0010478998,0.00053145783],"domain_scores_gemma":[0.99851084,0.00025728747,0.0003230113,0.0003869409,0.00041434038,0.00010758356],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011056283,0.00027672277,0.00038716863,0.000486429,0.00059239496,0.000338219,0.0016613726,0.00027871266,0.00002737155],"category_scores_gemma":[0.00016549042,0.00018458087,0.00011031757,0.00061524386,0.00318256,0.0004188299,0.00016730036,0.00047609909,0.0000010989372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004211486,0.000019668425,0.0016248593,0.000015574476,0.000013612015,0.000008792184,0.00064075296,0.7933223,0.00006800019,0.033780143,1.0335946e-7,0.17046404],"study_design_scores_gemma":[0.00057993387,0.00004072113,0.00016152693,0.0003973449,0.00003233223,0.0000050385565,0.0000035728851,0.91009235,0.00010702272,0.08823368,0.000047816997,0.00029865818],"about_ca_topic_score_codex":0.002886522,"about_ca_topic_score_gemma":0.003484584,"teacher_disagreement_score":0.98600537,"about_ca_system_score_codex":0.0003834036,"about_ca_system_score_gemma":0.002326024,"threshold_uncertainty_score":0.9995302},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008180073,0.00012760134,0.99233055,0.00015147979,0.00021691732,0.0005182648,0.000043112057,0.00028759774,0.006242684],"genre_scores_gemma":[0.7480239,0.0000018689218,0.24618524,0.0002303244,0.0040994305,0.00007745795,0.0003852372,0.00006553946,0.0009309393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973724,0.00003500868,0.0005303662,0.0009882048,0.0004487039,0.0006253521],"domain_scores_gemma":[0.9981769,0.00039625305,0.00044964958,0.00049584307,0.0004124292,0.00006894372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049369957,0.0004837787,0.00091784046,0.00062680896,0.00047557434,0.0003089467,0.00084504136,0.00019123954,0.000086569584],"category_scores_gemma":[0.0000048806983,0.00047015067,0.00048598833,0.0030672674,0.00044877737,0.00011263681,0.00030017973,0.00039015317,0.0000048708102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023276925,0.000048674,0.0056260973,0.000010145928,0.0007873138,0.000004341157,0.0002370066,0.81237525,0.00000484994,0.024259029,0.007661417,0.14896257],"study_design_scores_gemma":[0.0002947377,0.00007428486,0.0016557099,0.00012170596,0.00072995573,2.5396548e-7,3.741829e-7,0.69309497,0.00008072999,0.2917079,0.011181161,0.0010582325],"about_ca_topic_score_codex":0.00004440836,"about_ca_topic_score_gemma":0.00012053607,"teacher_disagreement_score":0.74794215,"about_ca_system_score_codex":0.00017812465,"about_ca_system_score_gemma":0.00025907025,"threshold_uncertainty_score":0.999775},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010574019,0.00079418276,0.99299026,0.0011019729,0.0007551509,0.0011217365,0.000107657586,0.0006647357,0.002453741],"genre_scores_gemma":[0.00222835,0.00021379263,0.9914547,0.003705586,0.0012692285,0.000038322323,0.00016783788,0.00005437575,0.0008677855],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952215,0.000041985888,0.0008139349,0.0019931833,0.0009283641,0.0010010217],"domain_scores_gemma":[0.9966279,0.0006508995,0.00045000843,0.0013627673,0.0005739967,0.00033440327],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016868698,0.0006702981,0.0006835268,0.0012102755,0.00039119102,0.00082791207,0.0028175698,0.0004401947,0.000073001385],"category_scores_gemma":[0.00034025635,0.00067781855,0.00024153943,0.000680783,0.00019621855,0.0013298804,0.00092156563,0.0008517061,0.000076950244],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009618264,0.000035862275,0.0000015353816,0.000043083422,0.0000071751665,0.00004061727,0.00013748827,0.000052928142,0.00027239195,0.0036183884,0.00034442087,0.9954365],"study_design_scores_gemma":[0.0014610338,0.0008282752,0.000011997566,0.00243559,0.00003500089,0.00021666715,2.9908804e-7,0.26264986,0.033318434,0.6727286,0.02459963,0.0017146099],"about_ca_topic_score_codex":0.0000178759,"about_ca_topic_score_gemma":0.000118335105,"teacher_disagreement_score":0.9937219,"about_ca_system_score_codex":0.00026713396,"about_ca_system_score_gemma":0.00081282406,"threshold_uncertainty_score":0.99956733},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024111944,0.00071307685,0.99388796,0.0006080792,0.0032644265,0.0009047989,0.000029428342,0.00017699461,0.00017409664],"genre_scores_gemma":[0.28587976,0.000119336815,0.7123042,0.00024236813,0.0012918959,0.000020012103,0.00006562058,0.000044214943,0.00003259158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607897,0.000032458465,0.0007508461,0.0015926147,0.0008063002,0.00073880784],"domain_scores_gemma":[0.9966242,0.0005047237,0.0006216995,0.0014364256,0.0006749729,0.00013802123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007242969,0.0005476592,0.00069533737,0.00038843325,0.00024315214,0.00027247195,0.002131002,0.00044046002,0.0000074719364],"category_scores_gemma":[0.00017718745,0.0005438815,0.00021528531,0.00069886463,0.0013145794,0.00049136067,0.000619402,0.0007507183,0.0000041306125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002012671,0.00003797299,0.000053246986,0.00011193012,0.000024235369,0.000013350313,0.00026453406,0.3202223,0.00008615398,0.2202059,0.000023626955,0.45893663],"study_design_scores_gemma":[0.00051160535,0.00021476296,0.000046039582,0.0007321659,0.000020790649,0.000117046344,2.6367564e-7,0.7993563,0.005469273,0.19103579,0.0017519459,0.00074401376],"about_ca_topic_score_codex":0.000015446336,"about_ca_topic_score_gemma":0.000016010761,"teacher_disagreement_score":0.47913402,"about_ca_system_score_codex":0.0004688996,"about_ca_system_score_gemma":0.0005434475,"threshold_uncertainty_score":0.99970126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024186342,0.00046784244,0.99505544,0.00022279784,0.00054394547,0.0005404814,0.00003324346,0.00011591093,0.0006016865],"genre_scores_gemma":[0.976485,0.000023649758,0.02056227,0.001249472,0.0012468887,0.0000100403795,0.00018377727,0.00008501537,0.00015385674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976778,0.000060022976,0.00038621243,0.0005683588,0.0007345591,0.00057305204],"domain_scores_gemma":[0.9985039,0.00036162426,0.000083131505,0.00093582994,0.000048020564,0.0000674499],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058027974,0.00042806673,0.00030435724,0.00024122451,0.00014312511,0.00026801063,0.0017070886,0.00028878852,0.00001298901],"category_scores_gemma":[0.000013042114,0.00028473744,0.00007972152,0.00043567125,0.00024973336,0.00024306933,0.000134387,0.0009946098,0.000010679474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.786636e-7,0.000015169177,0.000018276389,0.000006651556,0.000004892817,0.000014402898,0.0004004207,0.8766754,0.000026402446,0.000031872336,0.00011640164,0.12268918],"study_design_scores_gemma":[0.00018104566,0.000037697602,0.00044935374,0.00009303223,0.000008871844,0.000017646287,4.757747e-7,0.9943106,0.000039544484,0.0020223318,0.00251149,0.00032787482],"about_ca_topic_score_codex":0.00021182123,"about_ca_topic_score_gemma":0.00083216524,"teacher_disagreement_score":0.9744932,"about_ca_system_score_codex":0.00025891862,"about_ca_system_score_gemma":0.000048646147,"threshold_uncertainty_score":0.9999605},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008650776,0.0001418205,0.99411386,0.00030197116,0.00060426735,0.00063051295,0.0000037013583,0.00015988653,0.0031788817],"genre_scores_gemma":[0.8640616,0.000010804869,0.1351498,0.00038705807,0.00019652818,0.000020770804,0.000013112732,0.000026531674,0.0001337858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959383,0.00004844012,0.00073241635,0.0010568699,0.0014314655,0.0007925306],"domain_scores_gemma":[0.9975616,0.0005680172,0.0002896538,0.0010559862,0.00039646696,0.0001282997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009202486,0.0005203771,0.0004688302,0.0016603488,0.00014428231,0.0007992906,0.0024419,0.00028845432,0.000011729927],"category_scores_gemma":[0.00008316928,0.00045377557,0.00007783976,0.0011187036,0.00077834463,0.0022459996,0.0006257811,0.00091056165,0.00012082954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008432294,0.000012562977,0.0000447217,0.00001443932,0.0000024212702,0.000021066986,0.0017570726,0.55224854,0.000012748578,0.0051220986,0.00000626513,0.44074962],"study_design_scores_gemma":[0.00014452444,0.00026786778,0.00031629184,0.0004605593,0.000004108035,0.000043229593,0.000002546073,0.96291953,0.00092642923,0.034170203,0.00018929149,0.00055543357],"about_ca_topic_score_codex":0.00042302144,"about_ca_topic_score_gemma":0.0014657155,"teacher_disagreement_score":0.86319655,"about_ca_system_score_codex":0.00057437876,"about_ca_system_score_gemma":0.00086249044,"threshold_uncertainty_score":0.9997914},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010726182,0.00073411793,0.9916949,0.00042547347,0.0006745065,0.0002011767,0.0000068835257,0.00011120492,0.006044461],"genre_scores_gemma":[0.871809,0.00007393521,0.12660858,0.00051711587,0.0001944822,0.000007899038,0.0000025953748,0.000021973503,0.0007644138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962767,0.00003045824,0.0005931247,0.0011871638,0.0014042641,0.0005083395],"domain_scores_gemma":[0.99782956,0.00013973977,0.0003246504,0.0010872972,0.00047212827,0.00014662067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060442317,0.00043373366,0.0005079503,0.00062360003,0.00016187484,0.0002624763,0.0032791016,0.00036261012,0.00005477932],"category_scores_gemma":[0.0000733914,0.00037918604,0.00012085786,0.00042859832,0.0010578034,0.00064152305,0.0009395702,0.0008662716,0.00006628856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105856925,0.00011624828,0.00007952616,0.00018834135,0.00003274009,0.00007846543,0.0013203401,0.058402758,0.0025133586,0.4073154,0.000083630985,0.5298586],"study_design_scores_gemma":[0.00019082149,0.00016535922,0.000054507298,0.0008448875,0.000006971658,0.000104850915,1.486328e-7,0.67960554,0.008597417,0.30947307,0.00031200028,0.000644418],"about_ca_topic_score_codex":0.000022176484,"about_ca_topic_score_gemma":0.000013327336,"teacher_disagreement_score":0.8717017,"about_ca_system_score_codex":0.00013852908,"about_ca_system_score_gemma":0.00057892926,"threshold_uncertainty_score":0.999866},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019310287,0.00051993615,0.99643695,0.00043046466,0.00051580096,0.0005674404,0.0000032167177,0.000097145516,0.0012359659],"genre_scores_gemma":[0.89261013,0.000044965636,0.10666184,0.00030807604,0.00028548486,0.000023161683,0.0000012988007,0.000024297704,0.000040752446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973537,0.00006321658,0.00057762983,0.0009392164,0.00051127636,0.0005549932],"domain_scores_gemma":[0.99861085,0.0003874687,0.00039319735,0.00043900855,0.00008835912,0.00008110057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095991144,0.00039155368,0.0007438631,0.00051123195,0.00022931957,0.00042521564,0.0012453032,0.00027143135,0.000006443871],"category_scores_gemma":[0.00002276574,0.00035789612,0.000094326846,0.00038496606,0.00042790093,0.00055006804,0.00070970797,0.0004586958,9.54935e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034141678,0.00007476376,0.003833892,0.000746077,0.0000853609,0.00013188792,0.007440911,0.0055803824,0.000976567,0.43621174,0.0001758186,0.5447085],"study_design_scores_gemma":[0.001093213,0.00022951592,0.00031290468,0.0021767707,0.00001219408,0.00005494286,0.0000042944193,0.58093035,0.0005504963,0.4130665,0.0006278273,0.0009409995],"about_ca_topic_score_codex":0.00014130322,"about_ca_topic_score_gemma":0.000115137635,"teacher_disagreement_score":0.892417,"about_ca_system_score_codex":0.0003705317,"about_ca_system_score_gemma":0.00028464288,"threshold_uncertainty_score":0.9998873},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007234134,0.00051781215,0.9937658,0.00008792964,0.0014785762,0.00073389814,0.000005413357,0.00011822249,0.0025689728],"genre_scores_gemma":[0.62490386,0.00017180463,0.36111507,0.010138335,0.00069384585,0.00010678594,0.000025691044,0.00012234278,0.0027222878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99455845,0.000058380763,0.00061009766,0.002569792,0.0012854204,0.0009178794],"domain_scores_gemma":[0.9972499,0.00040057398,0.00039498456,0.001594855,0.00007848044,0.00028118293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000445367,0.00077969953,0.00063894386,0.00067469507,0.00030452057,0.00057858083,0.0034663212,0.00026485813,0.000020118909],"category_scores_gemma":[0.00002120411,0.00070613343,0.00016886827,0.000559779,0.00043485075,0.0011677335,0.0021220546,0.0011648507,0.0001231706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019224557,0.000107729276,0.000016656768,0.000008384192,0.000008153745,0.000020560086,0.00040848795,0.30065963,0.000081693644,0.001065919,0.00006763006,0.69753593],"study_design_scores_gemma":[0.00031837096,0.0005926473,0.0003712922,0.0006108485,0.000007231456,0.000019502393,0.0000011129785,0.97311276,0.0012702396,0.0029904542,0.019560847,0.0011446945],"about_ca_topic_score_codex":0.0000067429814,"about_ca_topic_score_gemma":0.000017514387,"teacher_disagreement_score":0.6963912,"about_ca_system_score_codex":0.00056709984,"about_ca_system_score_gemma":0.00012237001,"threshold_uncertainty_score":0.99953896},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005043288,0.000091407244,0.95943344,0.00038883105,0.00077939604,0.0004964828,0.000004805655,0.00024558723,0.038509645],"genre_scores_gemma":[0.02800901,0.000016344024,0.96423185,0.0011410924,0.00068601104,0.000016424146,0.000047618858,0.000046998324,0.0058046645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952332,0.0000501899,0.0004125731,0.0019794458,0.001446079,0.0008785149],"domain_scores_gemma":[0.9978784,0.00014211597,0.000104271756,0.0014754562,0.00018176872,0.00021800787],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013304732,0.00049445056,0.00046166652,0.0012352875,0.0003567496,0.0015807861,0.005526937,0.0001906007,0.00001591768],"category_scores_gemma":[0.000044222532,0.00047081194,0.00012472532,0.0011519421,0.00031661504,0.0009969495,0.004150794,0.00096810993,0.00017089478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031516674,0.00007356645,0.000091020156,0.00006607711,0.00001243061,0.00006556038,0.00054152997,0.17554125,0.00005666175,0.025518877,0.00037651902,0.7976534],"study_design_scores_gemma":[0.0002394009,0.00013272883,0.00018986007,0.00012939033,0.000006366746,0.000015512649,2.1762176e-7,0.97503924,0.00024063225,0.012600747,0.010648714,0.00075715844],"about_ca_topic_score_codex":0.00009579392,"about_ca_topic_score_gemma":0.000022381077,"teacher_disagreement_score":0.799498,"about_ca_system_score_codex":0.00022949779,"about_ca_system_score_gemma":0.00023535396,"threshold_uncertainty_score":0.9998536},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003857684,0.00020654392,0.98096687,0.0008609501,0.0021245827,0.00025194229,0.0000076281135,0.00020693995,0.0153359575],"genre_scores_gemma":[0.06815494,0.00010945824,0.918257,0.008121923,0.0020983366,0.000008806405,0.000024564803,0.0000821586,0.0031427902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952835,0.00003809884,0.00043923393,0.0018615467,0.0015538078,0.0008237995],"domain_scores_gemma":[0.9969036,0.00034883386,0.00021137205,0.0021199647,0.00015747739,0.00025877394],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00080646086,0.00058170344,0.00048909703,0.0008691864,0.0004679648,0.001210916,0.004698886,0.00029781664,0.000031396907],"category_scores_gemma":[0.000054944958,0.00048594305,0.00014618233,0.0005178993,0.00044052055,0.0008712703,0.0018753789,0.0013104222,0.00014588573],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062866225,0.000037991394,0.0000033815866,0.00000832218,0.0000037416212,0.00016199121,0.00020227341,0.009946528,0.000047096448,0.017597387,0.000103749844,0.9718813],"study_design_scores_gemma":[0.00035228237,0.0007450566,0.0002002243,0.00096806145,0.000004790285,0.00009406233,7.9842955e-8,0.7504653,0.00055353146,0.22159378,0.023946974,0.001075877],"about_ca_topic_score_codex":0.000017796448,"about_ca_topic_score_gemma":0.000015687692,"teacher_disagreement_score":0.97080535,"about_ca_system_score_codex":0.0002894087,"about_ca_system_score_gemma":0.000450847,"threshold_uncertainty_score":0.9998259},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012100157,0.00042976433,0.9959666,0.00038898183,0.0005386288,0.00043845017,0.000010102578,0.000056417255,0.00096105563],"genre_scores_gemma":[0.28399396,0.000055261044,0.7152387,0.00034777474,0.00007697185,0.0000071491836,0.000017866685,0.000017688992,0.00024460457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677026,0.00004243158,0.00041054253,0.0009849971,0.0014346656,0.00035709393],"domain_scores_gemma":[0.9983334,0.00014833723,0.00027450395,0.00089375983,0.00027145763,0.00007856355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017435647,0.0003235126,0.00036750612,0.0006376031,0.000118468895,0.00036796232,0.0016120257,0.00010302952,0.000008769954],"category_scores_gemma":[0.000054522105,0.00029230892,0.000053724645,0.0003940423,0.00050610193,0.000394763,0.0009820441,0.0002587947,0.0000058250134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019423771,0.000017690987,0.0000046875225,0.000024959476,0.000006890586,0.000008583086,0.00037515923,0.14240535,0.000029780587,0.008195241,0.00000282286,0.8489269],"study_design_scores_gemma":[0.00024856863,0.00014219467,0.00038959927,0.0001898661,0.000022510872,0.000009972213,3.1100424e-7,0.95028955,0.000089221125,0.04821778,0.00011019748,0.00029022034],"about_ca_topic_score_codex":0.000010113465,"about_ca_topic_score_gemma":0.000021205195,"teacher_disagreement_score":0.8486367,"about_ca_system_score_codex":0.00018531013,"about_ca_system_score_gemma":0.0003064341,"threshold_uncertainty_score":0.9999529},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017147997,0.00008178814,0.99547756,0.000111553934,0.0018562065,0.0005058055,0.0000026478547,0.00005349097,0.0001961241],"genre_scores_gemma":[0.8856867,0.000026093803,0.11210397,0.000106540516,0.00055371784,0.00002891028,0.0000062710265,0.000035039688,0.0014527885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978979,0.000049997572,0.0003909203,0.0007801431,0.0005074475,0.00037356286],"domain_scores_gemma":[0.9975318,0.00094283733,0.00040803527,0.00032979058,0.00069924135,0.000088349014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014196663,0.00028088977,0.00029094977,0.0002614919,0.0007160096,0.00044044605,0.00088020664,0.00020207142,0.0000011062309],"category_scores_gemma":[0.00030934575,0.00022303894,0.00007559117,0.00013645733,0.00033184746,0.0003831005,0.00043931487,0.0007745984,0.0000012363738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010761676,0.000020362822,0.0000408988,0.00004970106,0.00001833346,0.0000036117126,0.001828854,0.0014561703,0.005452767,0.718322,1.9232992e-7,0.2727964],"study_design_scores_gemma":[0.00044599906,0.001046152,0.00022997864,0.00075835985,0.0000130016215,0.000042968928,0.0000049199307,0.80905324,0.014296599,0.17264526,0.0009642031,0.0004993151],"about_ca_topic_score_codex":0.00003538206,"about_ca_topic_score_gemma":0.00005368351,"teacher_disagreement_score":0.88397187,"about_ca_system_score_codex":0.00009331332,"about_ca_system_score_gemma":0.00022370504,"threshold_uncertainty_score":0.9095264},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012332454,0.00017833439,0.9927426,0.0039994195,0.0004049396,0.00097280944,0.0000124666285,0.00038308237,0.0013050952],"genre_scores_gemma":[0.039155595,0.00001756044,0.9563602,0.0024328534,0.0004294113,0.00005705623,0.00002404241,0.00005284565,0.0014704205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963922,0.000019783467,0.00046921207,0.00163227,0.0009107246,0.000575801],"domain_scores_gemma":[0.99703157,0.00029695212,0.00039894952,0.0015478666,0.0005042941,0.0002203653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004936826,0.00055442203,0.0004529324,0.00063324143,0.00024343979,0.00066437136,0.002821503,0.0003992596,0.000040485065],"category_scores_gemma":[0.00006656248,0.00043509706,0.0001527579,0.00074082345,0.00041941856,0.0006054646,0.00025691141,0.0005821677,0.000025725212],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037357295,0.000041370244,0.000016689708,0.00008150941,0.000010928142,0.000016669686,0.00022528533,0.0010776855,0.00091318035,0.09000502,0.000141772,0.90743256],"study_design_scores_gemma":[0.001336981,0.00079035,0.0004253532,0.0010151484,0.000029063041,0.00005025517,2.8019437e-7,0.64800215,0.028940873,0.30397165,0.013994551,0.0014433486],"about_ca_topic_score_codex":0.000017556684,"about_ca_topic_score_gemma":0.000023971901,"teacher_disagreement_score":0.90598917,"about_ca_system_score_codex":0.00046757716,"about_ca_system_score_gemma":0.002277806,"threshold_uncertainty_score":0.9998101},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009535,0.0014900177,0.9941249,0.000025942989,0.00063303235,0.0007063899,0.000004896947,0.0004740738,0.0024454268],"genre_scores_gemma":[0.13957268,0.00010165674,0.8596053,0.00017229698,0.00038440857,0.00004578264,0.000010439934,0.00006787337,0.00003953296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976143,0.000004125689,0.00044150426,0.0008012161,0.0003001591,0.0008386755],"domain_scores_gemma":[0.9985107,0.0006736414,0.00006574275,0.0006114338,0.00006467936,0.00007376778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034513645,0.00046187537,0.0005307973,0.00048159348,0.00006687321,0.000070313974,0.0010591003,0.0006129659,0.0000021595724],"category_scores_gemma":[0.00011483053,0.00044662994,0.00009072957,0.0005109135,0.0005162719,0.00016243695,0.00024167416,0.0010745702,0.0000023637583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000641806,0.000005888221,0.000020950276,0.000029243103,0.0000026047153,0.000008344698,0.000027244494,0.6411587,0.000012379605,0.0006837387,0.0000063383845,0.35803813],"study_design_scores_gemma":[0.00031338783,0.000048233793,0.000040558152,0.00019406406,0.0000031211964,0.000008153297,2.1096254e-7,0.9769169,0.00013142015,0.021041142,0.0008222022,0.00048057036],"about_ca_topic_score_codex":0.0000025076477,"about_ca_topic_score_gemma":0.00016345573,"teacher_disagreement_score":0.35755756,"about_ca_system_score_codex":0.00030465188,"about_ca_system_score_gemma":0.00002956843,"threshold_uncertainty_score":0.99979854},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015882657,0.0005780126,0.99538344,0.0003026989,0.00022026793,0.00030577823,9.946898e-7,0.000029896395,0.0030200866],"genre_scores_gemma":[0.9916858,0.00003064673,0.0069578732,0.0011647239,0.00007649322,0.000005115162,0.0000020122975,0.000015153954,0.00006218574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992601,0.000056034693,0.00014457415,0.00020485079,0.00019854898,0.00013587756],"domain_scores_gemma":[0.9977123,0.0018996599,0.00005945038,0.00013378805,0.0001609079,0.00003385405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009792091,0.0001289212,0.00014428819,0.00013828315,0.00006993837,0.000061219966,0.00014233477,0.00007634303,0.000011120999],"category_scores_gemma":[0.00163265,0.00009514588,0.000019192874,0.00014029685,0.00017389232,0.000107282474,0.000055569544,0.00027121246,0.0000061407795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041345025,0.0000070859546,0.00003951823,0.00003251228,0.00002171501,0.000007607727,0.002976506,0.7530837,0.0001663327,0.031481393,0.000014025467,0.21212824],"study_design_scores_gemma":[0.0012190159,0.0007153864,0.002585783,0.0036623406,0.00016558019,0.00043974438,0.000025831747,0.84956914,0.0063266396,0.09364744,0.039860796,0.0017822915],"about_ca_topic_score_codex":0.0000013744287,"about_ca_topic_score_gemma":0.0000047393273,"teacher_disagreement_score":0.99152696,"about_ca_system_score_codex":0.00003744572,"about_ca_system_score_gemma":0.000024827192,"threshold_uncertainty_score":0.38799363},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011062554,0.0020623477,0.9900233,0.0018018091,0.0015088716,0.00058802025,0.000009160569,0.0028308085,0.0010650598],"genre_scores_gemma":[0.04569759,0.00006021407,0.934331,0.019040337,0.0006635544,0.000015817901,0.0000054394195,0.00006265033,0.00012338611],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950074,0.00008316643,0.00067131745,0.0020412875,0.0013446562,0.00085219066],"domain_scores_gemma":[0.99536055,0.00083275064,0.00028570087,0.0028838462,0.00036550203,0.00027164022],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009666588,0.0007593434,0.0007129804,0.00058212935,0.0005374888,0.0011441627,0.0064666644,0.00035164837,0.000008485133],"category_scores_gemma":[0.00021338393,0.0005689731,0.00018655264,0.0010073831,0.0004516929,0.0008875731,0.0021252413,0.0010177146,0.00003421837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051548236,0.000028827619,0.000035708486,0.000012716533,0.000013319689,0.0000846371,0.0051879324,0.049981937,0.00009784389,0.004406129,0.0012898429,0.93885595],"study_design_scores_gemma":[0.00008546317,0.00009539318,0.000035705445,0.000987167,0.000010883863,0.000043675154,1.3852784e-7,0.44990593,0.00035796946,0.5439788,0.0039169393,0.0005819162],"about_ca_topic_score_codex":0.00037291882,"about_ca_topic_score_gemma":0.00008522025,"teacher_disagreement_score":0.938274,"about_ca_system_score_codex":0.0003807572,"about_ca_system_score_gemma":0.00056493643,"threshold_uncertainty_score":0.9998928},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022827773,0.00019531292,0.9954074,0.00007939992,0.00093429687,0.0007461154,0.000004022412,0.000048630518,0.00030206278],"genre_scores_gemma":[0.6289464,0.000010189192,0.3707761,0.00008937554,0.00011908079,0.000012699444,0.000008049296,0.000014224609,0.000023867684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972466,0.00010595294,0.0006786842,0.00081067695,0.00080165354,0.0003564052],"domain_scores_gemma":[0.99770993,0.00024743922,0.0005240161,0.0010726103,0.00040189846,0.000044112872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025311718,0.00029110516,0.0003091717,0.00043689177,0.00017467201,0.00014754926,0.0015439718,0.00023674798,0.0000025026677],"category_scores_gemma":[0.0003780708,0.00021657794,0.0000664177,0.0010028769,0.0009153372,0.00071149756,0.0003867917,0.00055981963,0.0000033607546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047145997,0.00007176828,0.00012928997,0.0001258938,0.000008894928,0.000004103678,0.0021185994,0.34696847,0.002404491,0.13363288,0.0000011294168,0.5144873],"study_design_scores_gemma":[0.000104634324,0.0001157233,0.0016407566,0.00035693953,0.000008189871,0.000012494712,8.569331e-7,0.9400693,0.0057211784,0.05161875,0.00009794819,0.00025322378],"about_ca_topic_score_codex":0.000055316443,"about_ca_topic_score_gemma":0.000040417162,"teacher_disagreement_score":0.6266636,"about_ca_system_score_codex":0.0006342569,"about_ca_system_score_gemma":0.000357415,"threshold_uncertainty_score":0.88317925},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056997927,0.0009197747,0.9728694,0.0006132379,0.0011329389,0.00055340887,0.000014092154,0.0003372461,0.023502924],"genre_scores_gemma":[0.08083237,0.000055928296,0.9160231,0.0013069096,0.0008292401,0.000046075238,0.00004434493,0.00005450901,0.0008075618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99454504,0.000038602015,0.00071782194,0.0021990591,0.0014117155,0.0010877332],"domain_scores_gemma":[0.9969315,0.00045659873,0.00033963486,0.0016521991,0.0002782858,0.00034181352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013435165,0.0006549745,0.00056651497,0.0012806308,0.00077568897,0.00032541956,0.0037896296,0.0004926431,0.000017709348],"category_scores_gemma":[0.000049853872,0.00063916587,0.00022762924,0.0015559546,0.0013652112,0.0006447368,0.0013133984,0.0012354222,0.0000661381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008314829,0.00018347063,0.0000421085,0.000046778674,0.000025410804,0.00011084145,0.0017014695,0.12718822,0.00010962473,0.19035387,0.0001921435,0.68003774],"study_design_scores_gemma":[0.00025397816,0.00013281657,0.00047132073,0.00017081293,0.0000098343335,0.00021044324,0.0000022536417,0.91518897,0.000038933573,0.07547929,0.0072318255,0.0008095464],"about_ca_topic_score_codex":0.000015212712,"about_ca_topic_score_gemma":0.0000100092375,"teacher_disagreement_score":0.7880007,"about_ca_system_score_codex":0.0006337527,"about_ca_system_score_gemma":0.0011287059,"threshold_uncertainty_score":0.99960595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032107622,0.00025297952,0.9944228,0.00047446677,0.0002672538,0.0008507139,0.0000016497363,0.0006006243,0.0030973877],"genre_scores_gemma":[0.052215118,0.000018306324,0.9459843,0.0013315558,0.00017887879,0.000031354346,0.000005965268,0.00004003111,0.00019448565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99509555,0.000026607991,0.00048845564,0.0021917121,0.0013551714,0.00084250706],"domain_scores_gemma":[0.99709094,0.00017020598,0.0002828403,0.0016977127,0.0005054983,0.00025281377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079659227,0.00067099027,0.0006119058,0.0020362667,0.00031421005,0.00077341875,0.0037185145,0.00031550642,0.000001817391],"category_scores_gemma":[0.00013664484,0.0005787686,0.000087601664,0.0026355216,0.00046656013,0.0012778708,0.00091847655,0.0008895381,0.000023494104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001701216,0.000098077166,0.000013680498,0.00004787177,0.0000062765216,0.000037161793,0.00043570923,0.080151215,0.0005940736,0.0038277884,0.000023119304,0.914748],"study_design_scores_gemma":[0.00023108383,0.00043843593,0.00012189008,0.00035340808,0.0000081211465,0.00008791276,9.389213e-8,0.93234456,0.0014919016,0.06384834,0.00032828067,0.0007460035],"about_ca_topic_score_codex":0.000020593718,"about_ca_topic_score_gemma":0.000011200042,"teacher_disagreement_score":0.914002,"about_ca_system_score_codex":0.00064226444,"about_ca_system_score_gemma":0.00048007834,"threshold_uncertainty_score":0.9996664},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012801561,0.00044779107,0.992796,0.001860095,0.000801064,0.00067319995,0.000017834911,0.0001473626,0.0019764989],"genre_scores_gemma":[0.97736156,0.00009305093,0.017642826,0.003326708,0.0010482976,0.000035538265,0.000030429068,0.00003171771,0.0004298904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955597,0.00037649655,0.0005190913,0.0014357171,0.001519661,0.000589318],"domain_scores_gemma":[0.99696213,0.0008573617,0.00024010094,0.0011925618,0.0004183,0.00032956805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0039384025,0.0003857207,0.00042978066,0.0006387371,0.0010407954,0.00040458882,0.0013516704,0.0004651543,0.00053267257],"category_scores_gemma":[0.00063958875,0.00036663175,0.00021783552,0.00074632507,0.00246506,0.0004242124,0.000068770685,0.00082738104,0.000027200329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021434958,0.0001570039,0.0011538275,0.000067332774,0.000016103628,0.000012934575,0.004860406,0.42250937,0.000073568706,0.0022730639,0.000027119175,0.5688278],"study_design_scores_gemma":[0.0009308007,0.0013758633,0.004309471,0.0030034466,0.00030243286,0.000007716676,0.00002957803,0.5304616,0.0014899288,0.41093203,0.044000395,0.0031567274],"about_ca_topic_score_codex":0.0014008513,"about_ca_topic_score_gemma":0.01200702,"teacher_disagreement_score":0.9760814,"about_ca_system_score_codex":0.0009822565,"about_ca_system_score_gemma":0.0018684266,"threshold_uncertainty_score":0.9998786},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007276218,0.0009868785,0.990497,0.0015239152,0.0023630136,0.0003261452,0.0000223378,0.0004350748,0.003772868],"genre_scores_gemma":[0.10460886,0.00021323346,0.885768,0.0054947985,0.0018498196,0.000031778432,0.000016101869,0.000119353215,0.0018980532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955918,0.000048715745,0.0005841841,0.0018283416,0.0010540806,0.0008928319],"domain_scores_gemma":[0.99671805,0.000537427,0.00038290487,0.0018712506,0.00019677976,0.0002935873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058422633,0.0006792181,0.00065240596,0.00096964854,0.0004660698,0.00083214813,0.0043794927,0.00040933889,0.00012276655],"category_scores_gemma":[0.000050780334,0.00062137726,0.0002346298,0.0008140183,0.0006932332,0.0007804965,0.0014747748,0.0010068679,0.00026480437],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034723744,0.00012256486,0.000038294882,0.000059858598,0.00003846624,0.0007775685,0.0010808598,0.010559851,0.00036289464,0.07834559,0.00046164898,0.90814894],"study_design_scores_gemma":[0.00032826862,0.00015433061,0.00034292685,0.00067648833,0.000015404104,0.0004952763,2.7886438e-7,0.81296957,0.0020824112,0.17720447,0.004492942,0.0012376349],"about_ca_topic_score_codex":0.00002253027,"about_ca_topic_score_gemma":0.00003013897,"teacher_disagreement_score":0.9069113,"about_ca_system_score_codex":0.00036206873,"about_ca_system_score_gemma":0.00021407967,"threshold_uncertainty_score":0.9996238},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017466643,0.00039736822,0.9929461,0.00034785003,0.0012322452,0.0002589195,0.0000014303881,0.0001492379,0.0029202236],"genre_scores_gemma":[0.89726645,0.0001558002,0.091999106,0.007397982,0.0010809386,0.000011617309,0.0000052087858,0.000060789946,0.0020221148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687606,0.000027779257,0.00035579325,0.0013366494,0.0008842674,0.00051942974],"domain_scores_gemma":[0.9984884,0.00034496025,0.00015850004,0.0006984225,0.00014445398,0.00016526533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010942797,0.0004220426,0.0003492915,0.00077998097,0.00028928192,0.0005010839,0.0011814105,0.00024450052,0.000014219253],"category_scores_gemma":[0.000037551847,0.00038145986,0.00008479782,0.0003635182,0.00023092129,0.0004017793,0.0007078962,0.00071862864,0.000034711215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048179947,0.000067690984,0.00034409369,0.00006917062,0.00003729611,0.00015571523,0.0009146775,0.059007447,0.00046420316,0.047506064,0.0001596804,0.89122576],"study_design_scores_gemma":[0.000843099,0.00084706943,0.00054638536,0.00080273056,0.000018944584,0.00025512435,3.72078e-7,0.9302556,0.0017027782,0.06037304,0.003039155,0.0013157254],"about_ca_topic_score_codex":0.00003308962,"about_ca_topic_score_gemma":0.00014249643,"teacher_disagreement_score":0.900947,"about_ca_system_score_codex":0.00026523008,"about_ca_system_score_gemma":0.00018248905,"threshold_uncertainty_score":0.99986374},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009312504,0.007226466,0.9888629,0.000046199886,0.0016556948,0.00075849786,0.0000062146682,0.00037735704,0.000135427],"genre_scores_gemma":[0.31746337,0.000027243072,0.68171626,0.000087399494,0.00027463358,0.00007710329,0.000009368479,0.00009878151,0.00024583648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99502605,0.000048132642,0.0007855549,0.0013790797,0.0019697468,0.00079143094],"domain_scores_gemma":[0.9932279,0.003900585,0.00038311433,0.0019961598,0.00031226335,0.00017996239],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009281956,0.0005917581,0.00091732916,0.0011419959,0.00017462551,0.00034258555,0.0039075622,0.00029152975,0.000009713722],"category_scores_gemma":[0.0010400899,0.0005413157,0.00018817838,0.00077284256,0.0004862656,0.0004038133,0.0014827736,0.00076919614,0.000020974998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014139058,0.00023156924,0.0007830982,0.01560963,0.00021255815,0.0013091319,0.00466111,0.77639884,0.00064138504,0.005166767,0.0002861517,0.19455834],"study_design_scores_gemma":[0.004134812,0.0028622944,0.0016749009,0.059369173,0.000108546905,0.00024388301,0.0000036655747,0.8801319,0.01724631,0.028839609,0.00047857492,0.0049063186],"about_ca_topic_score_codex":0.00002409158,"about_ca_topic_score_gemma":0.000016605794,"teacher_disagreement_score":0.3165321,"about_ca_system_score_codex":0.00054147077,"about_ca_system_score_gemma":0.0005662688,"threshold_uncertainty_score":0.9997038},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000144816295,0.0018407544,0.98648196,0.0029137717,0.0014814731,0.00028638903,0.000020008853,0.00032153516,0.006639614],"genre_scores_gemma":[0.02462525,0.00042192964,0.96850336,0.0039462936,0.0013913013,0.000002833688,0.000041237694,0.000045454835,0.0010223566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99528694,0.00003278872,0.0006033512,0.0022255292,0.0010898606,0.00076151214],"domain_scores_gemma":[0.9936244,0.00053438306,0.00030372362,0.005173106,0.00020475994,0.00015964062],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011740838,0.0005584767,0.0006621578,0.0007177576,0.00022571851,0.00077673746,0.0118007455,0.00036484704,0.00003300372],"category_scores_gemma":[0.0002430988,0.0004851232,0.000093656134,0.0006239054,0.0006861882,0.0011134438,0.0060457806,0.00081557664,0.0001582431],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026417517,0.000025719217,0.00007631614,0.000047217414,0.000015871787,0.00019629182,0.00022587134,0.002355533,0.000032922468,0.044199236,0.00045863443,0.9523637],"study_design_scores_gemma":[0.00027331276,0.00010309051,0.00025642067,0.00058064016,0.000020659016,0.00020374547,1.4108113e-7,0.8394431,0.00029518994,0.108692594,0.049095064,0.0010360512],"about_ca_topic_score_codex":0.000012919541,"about_ca_topic_score_gemma":0.00011576064,"teacher_disagreement_score":0.9513277,"about_ca_system_score_codex":0.00016186983,"about_ca_system_score_gemma":0.00051934615,"threshold_uncertainty_score":0.99976003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005111401,0.0013402032,0.91565764,0.0007407653,0.0024135476,0.00048757409,0.0000029674982,0.00033506312,0.0789711],"genre_scores_gemma":[0.40675962,0.000031895674,0.58834577,0.001540753,0.0014847104,0.000033135253,0.000005474104,0.00007508455,0.0017235959],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949547,0.000052673684,0.0005773972,0.0024228895,0.00086240243,0.0011299064],"domain_scores_gemma":[0.9967465,0.000500023,0.00023307336,0.0018398568,0.00022167996,0.00045887998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010902998,0.00082204846,0.000764753,0.0012512181,0.00045277298,0.0008296157,0.005220021,0.00029504948,0.000040925526],"category_scores_gemma":[0.00016917213,0.0007184881,0.00023439762,0.0012174023,0.0006035617,0.0006611091,0.0029052405,0.0008652752,0.00038602753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041087096,0.000069788475,0.000041865667,0.000053377884,0.000013830278,0.0000868797,0.003093525,0.029112894,0.000041800886,0.3919993,0.000043874956,0.57543874],"study_design_scores_gemma":[0.001040942,0.00052475464,0.00017536731,0.0015706321,0.000030565327,0.00020883077,0.0000012411806,0.35949787,0.00457316,0.6151489,0.014362463,0.0028652952],"about_ca_topic_score_codex":0.00004470294,"about_ca_topic_score_gemma":0.0002701724,"teacher_disagreement_score":0.5725735,"about_ca_system_score_codex":0.00068456307,"about_ca_system_score_gemma":0.0013134972,"threshold_uncertainty_score":0.9995266},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013537589,0.00018031086,0.99652267,0.00017167248,0.0017859684,0.00018579075,0.0000041338335,0.00018514319,0.00082892587],"genre_scores_gemma":[0.3487133,0.0007312403,0.6452771,0.0019196111,0.002072167,0.000011389838,0.0000419299,0.000104857914,0.0011283827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730873,0.000026883406,0.00040892026,0.0011324566,0.00072259223,0.00040040968],"domain_scores_gemma":[0.99852824,0.00018223928,0.00024002738,0.0006408024,0.0002812346,0.00012744805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004431766,0.00038102997,0.00033381008,0.0004919361,0.00036996324,0.0009261224,0.0012708675,0.00031220773,0.000014403408],"category_scores_gemma":[0.00013032321,0.00037192338,0.000050429193,0.0007223652,0.00041247415,0.0010348512,0.00074913324,0.0005793189,0.000020115958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010797585,0.00013906632,0.0024052097,0.0002612874,0.000047140198,0.0000806654,0.0043824776,0.0062215,0.0052035614,0.48405954,0.00009458226,0.49709415],"study_design_scores_gemma":[0.00027535317,0.00016013422,0.00048058326,0.00039381307,0.000017712624,0.00009208734,4.0221158e-7,0.9171692,0.008432643,0.065986626,0.006175529,0.000815923],"about_ca_topic_score_codex":0.00002230994,"about_ca_topic_score_gemma":0.000033207598,"teacher_disagreement_score":0.9109477,"about_ca_system_score_codex":0.00012285104,"about_ca_system_score_gemma":0.00024766233,"threshold_uncertainty_score":0.9998733},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079797494,0.0015693597,0.99393886,0.0014278317,0.00046643047,0.0002176959,0.00001350007,0.00004726842,0.0015210658],"genre_scores_gemma":[0.85126275,0.0001094353,0.14679211,0.00095041207,0.00056759693,0.0000070311075,0.000011960593,0.00002450754,0.00027417424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723715,0.000040598246,0.0007795434,0.00096839934,0.00062416133,0.00035017816],"domain_scores_gemma":[0.9977465,0.00035807377,0.000654286,0.00084181543,0.00028444457,0.000114847164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005266346,0.000307272,0.00048514077,0.00046263647,0.00019905562,0.00028761284,0.0017209238,0.00021776985,0.000017066262],"category_scores_gemma":[0.00008294671,0.00028830115,0.00010529902,0.00055198855,0.0010452231,0.0005422636,0.00069288304,0.00054559705,0.0000014329603],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075745256,0.000042401345,0.00030464918,0.000070010115,0.000016751905,0.000005611378,0.0007796916,0.0092201615,0.0015061098,0.011336594,0.00023095023,0.9764795],"study_design_scores_gemma":[0.00022548078,0.00010725446,0.0010072202,0.0005828812,0.00002770742,0.000049722326,0.0000012719964,0.9677094,0.003701565,0.025550976,0.0005787605,0.00045771507],"about_ca_topic_score_codex":0.000029265128,"about_ca_topic_score_gemma":0.000041057578,"teacher_disagreement_score":0.97602177,"about_ca_system_score_codex":0.00005894943,"about_ca_system_score_gemma":0.00019152247,"threshold_uncertainty_score":0.9999569},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006337413,0.00062080263,0.99482334,0.0003037561,0.0005106978,0.0004418365,0.000031687887,0.00008415036,0.0031203683],"genre_scores_gemma":[0.0787146,0.000056560322,0.91988647,0.0004814911,0.00023542577,0.000026441186,0.000007968576,0.000031500782,0.0005595191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688774,0.000032356704,0.00053177756,0.0011403818,0.00093382224,0.00047393644],"domain_scores_gemma":[0.9973032,0.00038081242,0.00045224375,0.0014015798,0.00031468875,0.00014749702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003903207,0.00047789156,0.0006762608,0.00046036424,0.00019067735,0.000096479875,0.0013390131,0.00015874709,0.000023804145],"category_scores_gemma":[0.000051647992,0.0003510897,0.00008281154,0.00035632754,0.0013528478,0.00082942814,0.0009842372,0.00046453197,0.00000956193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047171732,0.00008017431,0.00009704208,0.00011705683,0.000046427416,0.00014824176,0.002548652,0.02860402,0.0008337836,0.57574093,0.000023158547,0.39171335],"study_design_scores_gemma":[0.006704998,0.007328211,0.0015978751,0.019708103,0.00017203428,0.0014383235,0.000036919188,0.32233566,0.10669588,0.2956079,0.22832778,0.010046302],"about_ca_topic_score_codex":0.000041921103,"about_ca_topic_score_gemma":0.00016725449,"teacher_disagreement_score":0.38166705,"about_ca_system_score_codex":0.00020694941,"about_ca_system_score_gemma":0.0005751234,"threshold_uncertainty_score":0.9998941},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048991335,0.000095353746,0.98960656,0.00026367378,0.0035543698,0.0004830044,0.000009871831,0.000057264708,0.0010307899],"genre_scores_gemma":[0.8990481,0.0000128374195,0.09657641,0.0034119978,0.0007736988,0.000010007754,0.000009910508,0.000056865185,0.00010016533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949648,0.00003826406,0.0005911315,0.0019912245,0.001363989,0.0010505858],"domain_scores_gemma":[0.9975654,0.0002179594,0.00030891955,0.0010989037,0.00047805015,0.00033075857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045628284,0.0007205714,0.0006279766,0.0029598183,0.00033903666,0.0007546209,0.003553986,0.0003420348,0.0000993047],"category_scores_gemma":[0.00010479479,0.0007000438,0.00024676058,0.0016682349,0.00028928727,0.0011438226,0.0023893684,0.0009819337,0.00017817046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011136394,0.00044796665,0.0016824908,0.0002620984,0.00019291813,0.0021128422,0.011541231,0.28683951,0.02942882,0.04044452,0.00008986601,0.6268464],"study_design_scores_gemma":[0.0034568293,0.003945135,0.007965311,0.006476056,0.00013500743,0.0010603144,0.000013501764,0.56569594,0.22824438,0.17118059,0.0023281858,0.009498737],"about_ca_topic_score_codex":0.00016551225,"about_ca_topic_score_gemma":0.000034813136,"teacher_disagreement_score":0.894149,"about_ca_system_score_codex":0.0011663595,"about_ca_system_score_gemma":0.00088869367,"threshold_uncertainty_score":0.9995451},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022220786,0.00023405529,0.9803174,0.00063225854,0.0017629451,0.00041970774,0.0000067504516,0.00021676121,0.016187906],"genre_scores_gemma":[0.38572246,0.00005015707,0.6113907,0.0019307206,0.00061749254,0.000008290049,0.000012205457,0.00004264548,0.0002253069],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955667,0.000037748443,0.0005911602,0.0019212947,0.0011854914,0.0006975653],"domain_scores_gemma":[0.9971635,0.00025309538,0.00032917972,0.0019136654,0.00014556322,0.00019502538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009538086,0.00055254204,0.0005067983,0.000616203,0.00031846776,0.0006059975,0.0031893034,0.00047086313,0.000081612714],"category_scores_gemma":[0.00006955397,0.00047156418,0.00017983731,0.0006430455,0.0006838207,0.00088894117,0.0012732372,0.0010203522,0.00011035698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007138276,0.00006850514,0.00051008555,0.000048629943,0.000013675022,0.000117214615,0.0014500187,0.08206849,0.000034166034,0.12758824,0.000025989177,0.7880678],"study_design_scores_gemma":[0.00035059542,0.00017214207,0.0041186223,0.00025360272,0.000007048354,0.00003643926,6.5201405e-8,0.26136595,0.00009979157,0.7318401,0.0010409597,0.0007147063],"about_ca_topic_score_codex":0.000056344245,"about_ca_topic_score_gemma":0.000083243576,"teacher_disagreement_score":0.78735316,"about_ca_system_score_codex":0.0007098928,"about_ca_system_score_gemma":0.00073727634,"threshold_uncertainty_score":0.9997736},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46999472,0.00048660702,0.5291742,0.00014743485,0.00009140877,0.000091519636,6.3555854e-7,0.000010382261,0.0000030657359],"genre_scores_gemma":[0.8283344,0.00005582154,0.17134781,0.000102661004,0.00014853013,0.0000018249092,0.0000018442056,0.0000062671998,8.375432e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987742,0.000020441883,0.00024932367,0.00036999639,0.0002975498,0.00028849306],"domain_scores_gemma":[0.99873805,0.0008198537,0.000077316836,0.0001609923,0.0001259136,0.00007790272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010718568,0.00011264027,0.00025252864,0.00038823357,0.0000850539,0.000052144947,0.00012355443,0.000053801436,0.0000032121736],"category_scores_gemma":[0.0006317477,0.00009438155,0.00005930369,0.00061871565,0.0003908501,0.00016224601,0.000055373046,0.00018948858,4.3954645e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001282665,0.0001441376,0.028641837,0.00014960919,0.000014605669,0.00027083934,0.0024982968,0.032195278,0.11621886,0.000004008791,0.000002595981,0.81973165],"study_design_scores_gemma":[0.00093827065,0.00038914423,0.04008332,0.00041535735,0.000050136277,0.0001624797,0.00003312425,0.8938521,0.06339354,0.00042518784,0.00006307769,0.00019421866],"about_ca_topic_score_codex":0.00006103601,"about_ca_topic_score_gemma":0.000022210925,"teacher_disagreement_score":0.86165684,"about_ca_system_score_codex":0.00006314733,"about_ca_system_score_gemma":0.00008473817,"threshold_uncertainty_score":0.3848768},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044613032,0.00036608128,0.99009967,0.005683007,0.0017604358,0.00047038976,0.000027599515,0.00020601871,0.00094068714],"genre_scores_gemma":[0.2760356,0.0002699987,0.71705794,0.0044372263,0.0009218008,0.00001329823,0.000053178977,0.00006536516,0.0011455538],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950077,0.000058689602,0.00050594466,0.002162285,0.0015198422,0.00074554636],"domain_scores_gemma":[0.99721503,0.0002468446,0.00020270213,0.001764034,0.00027830238,0.0002931105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014398552,0.0005573078,0.0005365164,0.00063180923,0.0005060216,0.0008978898,0.0026136513,0.00028184528,0.00003157844],"category_scores_gemma":[0.000066300985,0.0005118865,0.000110105044,0.0005393651,0.0010004094,0.0012700858,0.0044119735,0.0010158754,0.00004120488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033943514,0.00031147464,0.00020845322,0.00028443855,0.00013438138,0.0009878718,0.0018394646,0.064763054,0.0006356178,0.4296053,0.00046095258,0.50073504],"study_design_scores_gemma":[0.0015252832,0.00061947893,0.0037510372,0.0014072541,0.00007080763,0.00035748092,0.0000021584704,0.32842934,0.0028377096,0.65100324,0.007003482,0.0029927318],"about_ca_topic_score_codex":0.00006434696,"about_ca_topic_score_gemma":0.00005768525,"teacher_disagreement_score":0.49774233,"about_ca_system_score_codex":0.00029528493,"about_ca_system_score_gemma":0.00041207665,"threshold_uncertainty_score":0.99973327},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000067634,0.0001103677,0.98467314,0.0005855737,0.0018015376,0.00076203287,0.000004989426,0.0002212224,0.011834346],"genre_scores_gemma":[0.009529417,0.00008884177,0.9815614,0.0022709724,0.00083152764,0.000059247006,0.00007347791,0.00006386494,0.0055212076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965613,0.00002336752,0.00042953016,0.0014732135,0.0009419618,0.0005706247],"domain_scores_gemma":[0.99759555,0.00018129594,0.00023382207,0.0016450566,0.00020633647,0.00013791287],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00062185427,0.00044391866,0.0003599337,0.0008831454,0.00020609805,0.0012567492,0.004097972,0.00019053873,0.00006815427],"category_scores_gemma":[0.00007408593,0.00039463575,0.0000924574,0.0007845308,0.0004895585,0.0015063868,0.00203946,0.00045332976,0.00027514494],"study_design_candidate":"design_other","study_design_consensus":null,"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.9979386e-7,0.000022448587,0.000013715547,0.000048949107,0.000008348521,0.00003122879,0.00013237052,0.0074384077,0.000014622589,0.17205441,0.00021717255,0.8200174],"study_design_scores_gemma":[0.00013849862,0.00008191104,0.00007924389,0.00017878553,0.000006745286,0.000009467275,3.3845456e-8,0.51019496,0.00007886555,0.48495844,0.003753257,0.00051979395],"about_ca_topic_score_codex":0.000020927497,"about_ca_topic_score_gemma":0.000028603996,"teacher_disagreement_score":0.81949764,"about_ca_system_score_codex":0.00015069115,"about_ca_system_score_gemma":0.00021241911,"threshold_uncertainty_score":0.9998506},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049594167,0.0003545063,0.9934194,0.00046599188,0.0014411602,0.00023715459,0.0000012022618,0.000035402274,0.003549222],"genre_scores_gemma":[0.9871691,0.00018447165,0.009314731,0.0031025405,0.0001274739,0.0000145382755,0.0000018045,0.000024401623,0.000060923536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968409,0.00011856174,0.0006003899,0.0011973691,0.0006631013,0.000579655],"domain_scores_gemma":[0.9965527,0.0017611169,0.00037438248,0.0010864879,0.000117105184,0.000108220636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001151073,0.00044978107,0.0005086414,0.00051587285,0.00012215757,0.00024557626,0.002024326,0.00031460024,0.000023727012],"category_scores_gemma":[0.00006911154,0.00033864845,0.00008359756,0.0006537542,0.0012715157,0.00027493114,0.00064465404,0.00094797043,0.0000022342522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008115856,0.000041097348,0.000031387663,0.00001127893,0.000008841356,0.000038903687,0.00031234298,0.22032537,0.000021155709,0.21251492,0.000041544274,0.566645],"study_design_scores_gemma":[0.00023125311,0.00018742924,0.000043950764,0.0005437439,0.0000043445084,0.00006496759,3.5386955e-7,0.94456017,0.00027074173,0.05331915,0.00041011986,0.00036377576],"about_ca_topic_score_codex":0.000032124564,"about_ca_topic_score_gemma":0.00012542403,"teacher_disagreement_score":0.9866732,"about_ca_system_score_codex":0.00018843863,"about_ca_system_score_gemma":0.0001796123,"threshold_uncertainty_score":0.99990654},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002016026,0.0015090661,0.99125916,0.0004102915,0.0044853133,0.0017742873,0.000031675252,0.00031865036,0.00019139226],"genre_scores_gemma":[0.015748616,0.000040485585,0.9793108,0.0009231739,0.0017771597,0.00011405697,0.000022432305,0.00007877534,0.0019845162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951968,0.000051309635,0.0008260134,0.0019810041,0.0010687307,0.0008761351],"domain_scores_gemma":[0.99676055,0.0004670224,0.00054568244,0.0016140008,0.00035430523,0.00025844932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010379354,0.0007216385,0.0007539812,0.000914024,0.0003820561,0.0007923573,0.0031392972,0.000491644,0.000010083416],"category_scores_gemma":[0.00013961102,0.00062752934,0.00027576348,0.0003958137,0.00025382277,0.00048802714,0.0007616532,0.0006440282,0.00006138794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009443771,0.00006966649,0.00004626181,0.00030129193,0.000033143406,0.000036075693,0.0014214539,0.27002305,0.00014813984,0.010916876,0.00016027514,0.7168343],"study_design_scores_gemma":[0.0008230401,0.00018335135,0.000096784854,0.0008254018,0.000015637546,0.00010578781,2.5047416e-7,0.9640391,0.00029407782,0.0066480506,0.025939936,0.001028575],"about_ca_topic_score_codex":0.00004861284,"about_ca_topic_score_gemma":0.00017057893,"teacher_disagreement_score":0.71580577,"about_ca_system_score_codex":0.00051085814,"about_ca_system_score_gemma":0.0004613905,"threshold_uncertainty_score":0.9996176},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051686325,0.0009568334,0.9923574,0.0036369816,0.00045056053,0.0005187183,3.9519608e-7,0.000066263834,0.0014959845],"genre_scores_gemma":[0.6458213,0.00032082634,0.35013193,0.0031596906,0.00039856354,0.00006409325,0.0000039721544,0.00001963792,0.000079979145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758583,0.00011386804,0.0003543686,0.0009709846,0.0005448575,0.00043011474],"domain_scores_gemma":[0.99793833,0.0009608401,0.00019927036,0.00077224424,0.00007892243,0.000050386985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017182083,0.00028734235,0.0003219181,0.0005059505,0.00015445765,0.0002243156,0.0022748245,0.00026056851,0.0000020549119],"category_scores_gemma":[0.00009856525,0.00021094063,0.000038283062,0.00042166252,0.00031042748,0.0003492586,0.00039113194,0.00048706407,0.000014557372],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014956481,0.000044946006,0.0005540884,0.000033118908,0.00000704532,0.0001570177,0.0036203961,0.020791652,0.00027949008,0.21994238,0.0000311044,0.7545238],"study_design_scores_gemma":[0.00026457,0.00014301891,0.0017825082,0.000069841735,0.0000042431243,0.0001856537,0.0000011364848,0.5850997,0.00017942143,0.41046515,0.0014759182,0.00032886493],"about_ca_topic_score_codex":0.000030619736,"about_ca_topic_score_gemma":0.00034938444,"teacher_disagreement_score":0.754195,"about_ca_system_score_codex":0.00012994169,"about_ca_system_score_gemma":0.0001886244,"threshold_uncertainty_score":0.8601909},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006226685,0.00008986898,0.9961421,0.00024721396,0.000605778,0.0005790243,0.000030941697,0.00012212769,0.0021207058],"genre_scores_gemma":[0.20934956,0.0000036646875,0.78995895,0.00039900074,0.00016307463,0.0000101614405,0.00008480965,0.000014767433,0.00001599453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965307,0.00006327869,0.000984661,0.0007444141,0.0012033285,0.0004735977],"domain_scores_gemma":[0.99760306,0.00023983658,0.0006242611,0.00087345904,0.0005371623,0.00012223258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005108978,0.00043725618,0.00059140567,0.0009027864,0.00024414167,0.0003040391,0.0014477159,0.00033564866,0.000003258807],"category_scores_gemma":[0.000041370877,0.0004131615,0.0001537404,0.00065101316,0.0004658181,0.0009229353,0.0003109524,0.00044341132,0.000005164166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008938778,0.00001923253,0.000042929278,0.0000462747,0.000005597728,0.0000044358057,0.0001595062,0.954158,0.000014583999,0.02953467,0.0000062866134,0.015999543],"study_design_scores_gemma":[0.00059484533,0.00007926527,0.000088108005,0.00019819375,0.000010141599,0.000012852288,1.3773891e-7,0.89393944,0.00002207525,0.10466102,0.000025362579,0.0003685587],"about_ca_topic_score_codex":0.00010597427,"about_ca_topic_score_gemma":0.000015988964,"teacher_disagreement_score":0.2092873,"about_ca_system_score_codex":0.00027214273,"about_ca_system_score_gemma":0.0008040715,"threshold_uncertainty_score":0.99983203},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002410866,0.0026973686,0.99224114,0.00040916094,0.0006918686,0.0008206582,0.000012057246,0.00008137994,0.0006354867],"genre_scores_gemma":[0.60148215,0.00032370133,0.39403433,0.0034741883,0.0004070229,0.000057238234,0.000014737933,0.000049754522,0.0001568855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974614,0.000014055717,0.00043872066,0.0010341472,0.00043460992,0.00061709504],"domain_scores_gemma":[0.99793404,0.00077400054,0.00018190788,0.00080178556,0.00015267526,0.00015558119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006840195,0.00040901662,0.00038102485,0.00068908674,0.0003632323,0.00026922082,0.0013131008,0.00020838305,0.000015438336],"category_scores_gemma":[0.00003714331,0.00032518303,0.00017081594,0.00046252445,0.00027894066,0.00016350661,0.00052114355,0.00037841155,0.0000033372398],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012221193,0.000063970874,0.0000658344,0.00021476572,0.000039023787,0.000018554078,0.0021034002,0.0056440253,0.0003364619,0.06445334,0.000031829248,0.92701656],"study_design_scores_gemma":[0.0010758241,0.0006415429,0.0016386928,0.0011330809,0.00004422345,0.0001336756,0.0000025580518,0.76199627,0.0067489455,0.22179832,0.0033230183,0.0014638584],"about_ca_topic_score_codex":0.000021630689,"about_ca_topic_score_gemma":0.00015834827,"teacher_disagreement_score":0.9255527,"about_ca_system_score_codex":0.00008087301,"about_ca_system_score_gemma":0.00019468839,"threshold_uncertainty_score":0.99992},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018231642,0.002056089,0.9764796,0.000046811943,0.0008059851,0.00040344376,0.000008748141,0.000025619654,0.0019420615],"genre_scores_gemma":[0.5594789,0.00037938857,0.43379197,0.0007582364,0.003449203,0.000021996217,0.00018261377,0.00020253606,0.0017351868],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975495,0.000018553099,0.00035845634,0.0010346984,0.00047975345,0.0005590536],"domain_scores_gemma":[0.9988827,0.000015625039,0.00018835653,0.0006769111,0.00014459186,0.00009178508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034992615,0.00042408073,0.00032735764,0.00027772583,0.00015353125,0.00014732021,0.0007687055,0.00028780347,0.000025849182],"category_scores_gemma":[0.000016226524,0.0004322488,0.000113960756,0.00015875665,0.00019262992,0.000010286685,0.00060537463,0.00022994315,0.00001309962],"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.000020129073,0.00005091157,0.0011338748,0.00006744618,0.00009337061,0.000070641276,0.00007815672,0.2380958,0.59843826,0.000031429427,0.000049896742,0.16187006],"study_design_scores_gemma":[0.003268407,0.0011495424,0.0014977853,0.000665012,0.00023088475,0.00022303493,9.0107164e-7,0.30658418,0.6064283,0.011883413,0.0627768,0.005291694],"about_ca_topic_score_codex":0.00002120769,"about_ca_topic_score_gemma":0.00009266713,"teacher_disagreement_score":0.54268765,"about_ca_system_score_codex":0.0001258973,"about_ca_system_score_gemma":0.00026786333,"threshold_uncertainty_score":0.9998129},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012747543,0.0007977438,0.99704903,0.00017269174,0.0007160532,0.000956459,0.000011547137,0.0000844812,0.00008450612],"genre_scores_gemma":[0.21604997,0.000020047448,0.78361225,0.00006447643,0.0001401624,0.000026090833,0.000021952706,0.000031363732,0.000033715645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970812,0.00004511569,0.00068473094,0.0011330179,0.0006411429,0.00041477857],"domain_scores_gemma":[0.997015,0.0006212286,0.00064693193,0.00081928854,0.00077517075,0.00012236222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010124376,0.00041792335,0.0006091767,0.00048855226,0.00019152566,0.0005026266,0.0010654234,0.00025087583,7.567462e-7],"category_scores_gemma":[0.0002330997,0.0003574036,0.000056799458,0.00052073254,0.00036967776,0.0005984639,0.0002296837,0.00025243114,9.203745e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007239229,0.000011092385,0.00007501694,0.00026692526,0.0000136068875,0.0000045565293,0.00014928897,0.9823264,0.00006742547,0.0080181435,0.0000014619526,0.009058852],"study_design_scores_gemma":[0.0003460653,0.00018168103,0.000018973602,0.0010096455,0.00001843838,0.00007721101,8.1833144e-7,0.99381137,0.00026086954,0.0038397533,0.0000472137,0.0003879877],"about_ca_topic_score_codex":0.000027415623,"about_ca_topic_score_gemma":0.0000114220275,"teacher_disagreement_score":0.21592249,"about_ca_system_score_codex":0.00015751476,"about_ca_system_score_gemma":0.0003874508,"threshold_uncertainty_score":0.99988776},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005025873,0.0017918111,0.9879936,0.0017577078,0.00082183443,0.0006015305,0.0000022756801,0.00043283278,0.0060958243],"genre_scores_gemma":[0.63222253,0.00006147572,0.36452225,0.002187042,0.00029620508,0.000055170523,0.000011907081,0.000039870076,0.00060355145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566334,0.0000707274,0.00044636693,0.0016792774,0.0015150262,0.0006252547],"domain_scores_gemma":[0.99663156,0.0005229508,0.00037330337,0.0016646613,0.00071872975,0.000088771456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014648451,0.00055154186,0.0006206218,0.001053939,0.0005704579,0.0003774862,0.0025999858,0.00039384924,0.000021966187],"category_scores_gemma":[0.0002921304,0.00044465438,0.0000950371,0.00091773993,0.0011810595,0.00050679233,0.00067699264,0.00084418,0.000013184363],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015448824,0.00003730093,0.0005088867,0.000026777683,0.000030399155,0.00009759464,0.00096565386,0.022331867,0.000030948002,0.007295624,0.00006636792,0.9685931],"study_design_scores_gemma":[0.0008095898,0.00046994028,0.002614393,0.00081465335,0.0000408282,0.00006977141,5.7853305e-7,0.7872393,0.0012003902,0.20409799,0.0016281217,0.0010144287],"about_ca_topic_score_codex":0.000025717447,"about_ca_topic_score_gemma":0.00033028965,"teacher_disagreement_score":0.9675787,"about_ca_system_score_codex":0.00035810302,"about_ca_system_score_gemma":0.0008267958,"threshold_uncertainty_score":0.9998005},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5822646,0.00014949414,0.4080338,0.0067152786,0.00088366354,0.00024692007,0.000002218998,0.000078928206,0.0016250944],"genre_scores_gemma":[0.97626024,0.0000117017735,0.022335986,0.00046952718,0.0008926386,0.000006297124,4.6512415e-7,0.0000067487354,0.00001641473],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99784666,0.00016549269,0.00022324936,0.00042694874,0.00072033325,0.0006172845],"domain_scores_gemma":[0.9990374,0.00058885897,0.00010708701,0.00015339062,0.00006247268,0.00005082726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011675362,0.00013048573,0.00019060784,0.0001595877,0.0006587446,0.00029178825,0.00047054386,0.00010531262,0.000017719694],"category_scores_gemma":[0.0004830661,0.00013082672,0.000039440194,0.0012161058,0.00079520646,0.0006446492,0.000144697,0.0003295684,0.000008977427],"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.00006079201,0.00075557025,0.23874438,0.00004154282,0.0000085929,0.00016981663,0.0740224,0.007907128,0.0027650225,0.011550051,0.0009899817,0.6629847],"study_design_scores_gemma":[0.0033472774,0.00041565357,0.64804053,0.00045058056,0.000024327164,0.00004228518,0.00077886,0.10137443,0.04022644,0.15147886,0.05107066,0.0027500682],"about_ca_topic_score_codex":0.02589491,"about_ca_topic_score_gemma":0.050315965,"teacher_disagreement_score":0.66023463,"about_ca_system_score_codex":0.00041024084,"about_ca_system_score_gemma":0.0003006662,"threshold_uncertainty_score":0.9805917},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021927146,0.00010287623,0.9836098,0.00029129963,0.002498713,0.00039398417,0.0000018444271,0.0001832774,0.012698949],"genre_scores_gemma":[0.064659886,0.000027110125,0.9342379,0.00047024095,0.00039560863,0.000024590143,0.000003360621,0.00003240587,0.00014888943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591386,0.00007182051,0.0007475972,0.0016279533,0.00093481154,0.000703961],"domain_scores_gemma":[0.99661714,0.0006702406,0.00040143056,0.0019464367,0.0002226974,0.00014206045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021808746,0.00041679724,0.00043097138,0.0013030019,0.0003047872,0.0006312958,0.0038704586,0.00040650027,0.000025823321],"category_scores_gemma":[0.0006854617,0.00044010117,0.000103397695,0.0009940411,0.0006052788,0.0014237929,0.0012867029,0.001683355,0.000048565627],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018963308,0.00002720141,0.00026285136,0.00003629041,0.0000041271414,0.000066766755,0.0027541588,0.012604753,0.002892105,0.12025382,0.000003046352,0.861093],"study_design_scores_gemma":[0.00025393412,0.00006511083,0.0010606715,0.00045287033,0.0000046461464,0.00010397416,0.0000010076285,0.59220153,0.009703342,0.3945081,0.00081221986,0.0008325861],"about_ca_topic_score_codex":0.000057032914,"about_ca_topic_score_gemma":0.00015569205,"teacher_disagreement_score":0.86026037,"about_ca_system_score_codex":0.0003217717,"about_ca_system_score_gemma":0.00046695973,"threshold_uncertainty_score":0.9998051},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018340432,0.0003673687,0.99364096,0.00012504368,0.0010597632,0.00050886086,0.000017561339,0.002245404,0.0018516285],"genre_scores_gemma":[0.053748127,0.00000599907,0.94526774,0.0005386734,0.0002546598,0.000008219207,0.000011441049,0.000057629994,0.00010752965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945771,0.00005262349,0.00087032246,0.0021206106,0.0014318458,0.00094746443],"domain_scores_gemma":[0.996085,0.00043805776,0.0006246763,0.002306695,0.00035397106,0.00019162009],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000800956,0.0007398815,0.0006856017,0.0011003267,0.00047114026,0.00059358455,0.004672584,0.0003987997,0.000010548944],"category_scores_gemma":[0.000101054735,0.0006938527,0.00014357548,0.0009521638,0.00073490775,0.0004677801,0.0035590034,0.0009814647,0.000025706311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021765036,0.00003119663,0.000010402203,0.00002909581,0.000004198362,0.000091456706,0.000099694735,0.8682724,0.001514336,0.0085039735,0.00012294314,0.12131809],"study_design_scores_gemma":[0.00016174896,0.000055768625,0.000018842711,0.00070699176,0.0000055270875,0.00008107808,4.546551e-8,0.9571241,0.005280916,0.035218596,0.0006036424,0.0007427508],"about_ca_topic_score_codex":0.00005252642,"about_ca_topic_score_gemma":0.000011660639,"teacher_disagreement_score":0.12057534,"about_ca_system_score_codex":0.00062813825,"about_ca_system_score_gemma":0.00056304893,"threshold_uncertainty_score":0.99955124},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003130979,0.000541041,0.992732,0.0006657749,0.0013983331,0.0007273203,0.0000059874014,0.00037648727,0.0035217325],"genre_scores_gemma":[0.5480934,0.000028755592,0.44252074,0.0048346836,0.0019389926,0.000045497356,0.00008255651,0.00009430989,0.002361097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613243,0.000097218974,0.0005407946,0.0019097709,0.0006020138,0.0007177555],"domain_scores_gemma":[0.9958484,0.0022641243,0.0003527048,0.000974999,0.0004165906,0.00014317606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010011916,0.00058316527,0.00057952304,0.0007742863,0.00048790002,0.00057529955,0.0019832246,0.00030975032,0.000013565743],"category_scores_gemma":[0.0003232756,0.00056447415,0.00024319655,0.0006461219,0.0003419279,0.00027033206,0.00052409736,0.0010392404,0.000026710286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014425498,0.000036666235,0.000015788326,0.000011729661,0.0000052443797,0.000018329347,0.00033422484,0.21936803,0.000008998867,0.0031639386,0.00004173998,0.7769809],"study_design_scores_gemma":[0.0006443912,0.0007038327,0.00010814025,0.00049455935,0.000010335918,0.000015933354,6.547375e-8,0.96234286,0.0005825052,0.030825552,0.0036407406,0.00063106994],"about_ca_topic_score_codex":0.0000071648333,"about_ca_topic_score_gemma":0.000016344882,"teacher_disagreement_score":0.77634984,"about_ca_system_score_codex":0.00031612944,"about_ca_system_score_gemma":0.00055635703,"threshold_uncertainty_score":0.9996807},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49048898,0.0000030438591,0.50894076,0.000040381663,0.0002458934,0.00009582114,3.0412647e-7,0.00016093625,0.000023906006],"genre_scores_gemma":[0.77049345,9.844879e-7,0.22931834,0.00006104832,0.000110496025,0.0000035434794,8.4528426e-7,0.000011030132,2.6139995e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873805,0.000013480617,0.00018876189,0.00045481583,0.00023731988,0.0003675799],"domain_scores_gemma":[0.99918437,0.00007622672,0.00006084999,0.0005003251,0.00009153177,0.000086676766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025117747,0.00019762533,0.00026995465,0.0004673049,0.00016111843,0.00017463589,0.0004177957,0.00009978026,0.0000073281817],"category_scores_gemma":[0.000020241954,0.00017030936,0.00005589216,0.0017832245,0.0002588401,0.00028243018,0.00008684945,0.00041983023,0.000002798869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008605546,0.000034375593,0.05731271,0.000022849954,0.00006896875,0.00003453454,0.00093497953,0.24109009,0.20761772,0.000005717749,0.0000032653832,0.4928662],"study_design_scores_gemma":[0.00010691038,0.000042689622,0.0405575,0.00005101248,0.00002577274,0.000052172647,6.7892546e-7,0.74885374,0.20973264,0.00038839105,0.0000015832335,0.00018692226],"about_ca_topic_score_codex":0.000058390582,"about_ca_topic_score_gemma":0.000614741,"teacher_disagreement_score":0.5077636,"about_ca_system_score_codex":0.000053720065,"about_ca_system_score_gemma":0.000055543413,"threshold_uncertainty_score":0.6945014},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010563049,0.00035462543,0.9823533,0.0021887955,0.0031812997,0.00028474405,0.000008499337,0.00019745037,0.011325619],"genre_scores_gemma":[0.2232805,0.00012290069,0.7582545,0.016443085,0.00070841215,0.000009810145,0.000023011065,0.000067118766,0.001090607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953653,0.0000625769,0.000494536,0.0025060438,0.0009194319,0.00065206306],"domain_scores_gemma":[0.9935882,0.0004730046,0.00018954756,0.005457317,0.00014820723,0.00014371349],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013390381,0.0005310793,0.00056540465,0.0004916645,0.00020362191,0.00059750583,0.009840093,0.00029645595,0.0000344255],"category_scores_gemma":[0.00035138932,0.0004228061,0.000088561144,0.00040384047,0.000862489,0.0007155263,0.0035668572,0.00088411086,0.00012778745],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075604994,0.00006459733,0.0001251849,0.00003556061,0.000014147393,0.0001370401,0.00038619747,0.0022154166,0.000029077093,0.04148318,0.00047401388,0.955028],"study_design_scores_gemma":[0.00066335173,0.00074691686,0.00074020657,0.00088912767,0.000019493587,0.00022016537,5.973831e-7,0.510553,0.0016713751,0.4476344,0.034768395,0.0020929584],"about_ca_topic_score_codex":0.000023722661,"about_ca_topic_score_gemma":0.00011096104,"teacher_disagreement_score":0.95293504,"about_ca_system_score_codex":0.00022757892,"about_ca_system_score_gemma":0.0003724142,"threshold_uncertainty_score":0.9998224},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019358007,0.004780016,0.9909647,0.00006648763,0.002147877,0.0004997998,0.0000016847621,0.00025518044,0.0010906379],"genre_scores_gemma":[0.79191375,0.000011688681,0.20680301,0.0003624711,0.00046433785,0.000007087737,0.000006581258,0.0000379599,0.00039311155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958318,0.00006260263,0.00055300747,0.0016568403,0.00097158796,0.00092420145],"domain_scores_gemma":[0.9976758,0.000119632095,0.00047829037,0.0011689095,0.00036211917,0.00019526968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009050721,0.00065187854,0.0006608651,0.00064898346,0.00043397382,0.00086198485,0.003169202,0.00038783558,0.000009211853],"category_scores_gemma":[0.000066636145,0.0005421388,0.00017950228,0.00073325547,0.0006775209,0.0010012721,0.0012436352,0.00097306364,0.000035146422],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062592208,0.000036395235,0.00011454581,0.00010289106,0.000026638676,0.00040896432,0.0060308645,0.0034118297,0.0005150443,0.046929963,0.00000506261,0.94241154],"study_design_scores_gemma":[0.0004028394,0.00020288251,0.00010192064,0.00025065304,0.00002561532,0.00037536732,0.000002247957,0.7916461,0.0021556797,0.20203996,0.0013427743,0.0014539609],"about_ca_topic_score_codex":0.00014295214,"about_ca_topic_score_gemma":0.00010969438,"teacher_disagreement_score":0.9409576,"about_ca_system_score_codex":0.00037003306,"about_ca_system_score_gemma":0.0006317681,"threshold_uncertainty_score":0.999703},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021336142,0.00021303813,0.9919435,0.00071414263,0.0038189644,0.00061662996,0.000007867439,0.00031401715,0.0023505092],"genre_scores_gemma":[0.027213601,0.0000076011966,0.9683344,0.0008237132,0.0017263012,0.000029004603,0.0000063138646,0.00006327492,0.0017957888],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959711,0.0000073564875,0.00048375814,0.0019567555,0.0008473638,0.0007336915],"domain_scores_gemma":[0.99717337,0.00039643294,0.00033712896,0.0015746328,0.00027148804,0.00024695185],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004724027,0.0005373915,0.00044506753,0.00058908365,0.0003178311,0.0020950958,0.003482842,0.0004915775,0.00002271537],"category_scores_gemma":[0.00012214872,0.0005075508,0.00019375239,0.00051885255,0.00043852543,0.0015933127,0.0011410263,0.0009710684,0.000035247882],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007877588,0.000008669712,0.000015941569,0.000041079707,0.000006534938,0.000009259195,0.00035578362,0.0015323813,0.00023450711,0.0015998906,0.000043465898,0.9961446],"study_design_scores_gemma":[0.00058344833,0.00040528382,0.000037821104,0.00059503806,0.000013896064,0.00019299294,1.2626363e-7,0.29068512,0.011001818,0.65858376,0.036592603,0.0013081032],"about_ca_topic_score_codex":0.000016807122,"about_ca_topic_score_gemma":0.000081737264,"teacher_disagreement_score":0.9948365,"about_ca_system_score_codex":0.00029689693,"about_ca_system_score_gemma":0.0010345423,"threshold_uncertainty_score":0.9997376},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014356833,0.00015169181,0.99464285,0.0003896739,0.0017031897,0.0005310994,0.000002430023,0.00004216245,0.0011012164],"genre_scores_gemma":[0.7898269,0.000016833723,0.20919046,0.00020631542,0.00049486355,0.00001309325,0.0000065499894,0.000020992444,0.00022395956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728745,0.000037249094,0.0006546341,0.0009254305,0.0007463187,0.00034892207],"domain_scores_gemma":[0.9981805,0.00020793118,0.00039632263,0.00092517555,0.00021159329,0.00007844484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009263352,0.00030244509,0.00043239113,0.00081240584,0.000085831976,0.00018228563,0.0017116735,0.00036784617,0.000014470895],"category_scores_gemma":[0.00007984284,0.0002738284,0.000079205274,0.00044613992,0.00024401619,0.0005706525,0.00048554776,0.0006052387,0.000013864772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008547633,0.0000667596,0.00033113256,0.00015469387,0.0000093683475,0.00004480462,0.006035414,0.0573066,0.014723029,0.027316824,0.000012265244,0.8939906],"study_design_scores_gemma":[0.00052866165,0.00016725453,0.0010251794,0.0006355636,0.000004945416,0.000028835408,1.9197034e-7,0.89655834,0.022887947,0.07667305,0.0008406086,0.0006494477],"about_ca_topic_score_codex":0.00016068824,"about_ca_topic_score_gemma":0.0006258087,"teacher_disagreement_score":0.8933411,"about_ca_system_score_codex":0.00013743361,"about_ca_system_score_gemma":0.0003496361,"threshold_uncertainty_score":0.9999714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063125735,0.00022899851,0.9924549,0.0013458062,0.002216947,0.0006982391,7.936713e-7,0.00014907532,0.0028421336],"genre_scores_gemma":[0.086303085,0.00005660359,0.909653,0.0015035272,0.00074082153,0.000027409571,0.000007920569,0.00004599806,0.0016616435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965713,0.000024579263,0.00053298636,0.0012906189,0.0007940667,0.00078647357],"domain_scores_gemma":[0.9978877,0.00064352085,0.00029867567,0.0007663268,0.00027378043,0.00013004376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014073538,0.00043528457,0.0004538896,0.0011648028,0.00025177404,0.000400707,0.0017292198,0.0004276131,0.000013578902],"category_scores_gemma":[0.0002224766,0.0004300966,0.00012924167,0.00064227293,0.00067316054,0.0005862925,0.00063608104,0.0010926225,0.00002685477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103001485,0.000007813913,0.00011528354,0.000024558823,0.0000037700238,0.000030732626,0.0006819615,0.2382427,0.00006673779,0.037394773,0.000027104754,0.7233943],"study_design_scores_gemma":[0.0001571412,0.00028465726,0.00004759661,0.0004710466,0.000004025106,0.000075826145,0.0000012320307,0.85634303,0.005491077,0.122269,0.014204858,0.0006504873],"about_ca_topic_score_codex":0.00002753708,"about_ca_topic_score_gemma":0.00023631271,"teacher_disagreement_score":0.7227438,"about_ca_system_score_codex":0.00049470627,"about_ca_system_score_gemma":0.00044216367,"threshold_uncertainty_score":0.9998151},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065383624,0.00060382276,0.9956599,0.0005648831,0.00039926203,0.0004660826,0.000006155368,0.00034494998,0.0013011496],"genre_scores_gemma":[0.30953553,0.000036238973,0.686912,0.0012107256,0.00073831395,0.00004375771,0.00001358786,0.000079531725,0.0014302966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618423,0.000036940935,0.0003422588,0.0014135778,0.0013123207,0.0007106778],"domain_scores_gemma":[0.9971588,0.0008159521,0.0001665169,0.0013448329,0.00030996316,0.00020393317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058613304,0.0005100163,0.0004440143,0.00083491567,0.00017072914,0.0006084369,0.0025632877,0.00026342124,0.000040097933],"category_scores_gemma":[0.00017847735,0.00042468455,0.000072931,0.0008749203,0.0004972871,0.00070463226,0.0006185127,0.00090731325,0.000084525454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002354321,0.00005181259,0.00022867987,0.00006472224,0.0000461667,0.00059432775,0.0053839125,0.16180514,0.0012455661,0.011493764,0.000104545215,0.8189578],"study_design_scores_gemma":[0.0010781582,0.00082885264,0.0016219665,0.0008698047,0.000019305357,0.0004907168,0.0000012660742,0.96208614,0.016377961,0.008503993,0.0059515047,0.002170356],"about_ca_topic_score_codex":0.000026782582,"about_ca_topic_score_gemma":0.00020736763,"teacher_disagreement_score":0.8167875,"about_ca_system_score_codex":0.00047256777,"about_ca_system_score_gemma":0.00084609113,"threshold_uncertainty_score":0.9998205},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3892174,0.000009354237,0.6086067,0.0009823347,0.0009917306,0.000117336946,0.0000016768015,0.000059647395,0.000013820605],"genre_scores_gemma":[0.9796522,0.000003544338,0.013487693,0.0064605055,0.00037667426,0.0000024532055,0.0000032460348,0.000011496889,0.0000021441274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976496,0.000064227,0.00026848013,0.0009914789,0.0004733102,0.00055290334],"domain_scores_gemma":[0.99890935,0.00038570623,0.00008308842,0.0004755435,0.000032434724,0.000113875576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004432603,0.00021168041,0.00017605133,0.00023391627,0.00039483063,0.0003222465,0.0005269868,0.00007982689,0.000007198013],"category_scores_gemma":[0.0003416964,0.00018781566,0.00006504692,0.0017437541,0.00028933128,0.00060383324,0.00020064923,0.00036846244,0.00000375697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021160551,0.000052863998,0.00089377625,0.0000027100987,5.3672943e-7,0.000021530874,0.00003541944,0.7407791,0.14550407,0.0018342091,0.000005721501,0.1108489],"study_design_scores_gemma":[0.00018133734,0.0001243786,0.0072913202,0.00003011063,0.0000019177673,0.00010347271,3.1147522e-7,0.9792338,0.0071966606,0.0055929534,0.000020054902,0.00022370766],"about_ca_topic_score_codex":0.000018507506,"about_ca_topic_score_gemma":0.000049994665,"teacher_disagreement_score":0.595119,"about_ca_system_score_codex":0.0002827509,"about_ca_system_score_gemma":0.00006568233,"threshold_uncertainty_score":0.76589},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012764394,0.00041397472,0.99544346,0.00016150948,0.0008462806,0.00082033034,0.000006199221,0.00027719775,0.0007545976],"genre_scores_gemma":[0.6729518,0.000043035474,0.32659894,0.00015465246,0.00019252226,0.000024965966,0.00000396051,0.00001924455,0.000010841921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572855,0.0000339846,0.0009821787,0.0015866058,0.0010885856,0.00058009557],"domain_scores_gemma":[0.9963256,0.00026897324,0.00038585518,0.0023283444,0.0005232349,0.00016799677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016376931,0.00044933415,0.0006388982,0.0005091579,0.0002782864,0.00016684263,0.0031514138,0.00039865804,0.000013346393],"category_scores_gemma":[0.000046801873,0.00039361283,0.00021900186,0.0006288074,0.00041144592,0.00062997226,0.0011125436,0.000700849,0.000033005494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004625774,0.00010700677,0.0008499877,0.0005009949,0.00001670574,0.000005779184,0.0010358948,0.81613284,0.00001871489,0.023662964,7.05558e-7,0.15766378],"study_design_scores_gemma":[0.00023763196,0.00008244455,0.000101544225,0.0003679029,0.000010293792,0.000019626295,2.3128314e-7,0.8106187,0.0004193646,0.18756929,0.0001305078,0.00044245293],"about_ca_topic_score_codex":0.00011276631,"about_ca_topic_score_gemma":0.00005821773,"teacher_disagreement_score":0.6716754,"about_ca_system_score_codex":0.00062716374,"about_ca_system_score_gemma":0.0012735808,"threshold_uncertainty_score":0.9998516},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016943534,0.00020777978,0.9958797,0.00059390574,0.00048246275,0.00022984763,0.000017335551,0.00005672115,0.0008378915],"genre_scores_gemma":[0.46857908,0.00014481525,0.5304441,0.000475159,0.00009615687,0.000009234582,0.0000066696066,0.00001942807,0.00022533846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777293,0.000019065305,0.00035447578,0.0009161103,0.0005907729,0.00034663768],"domain_scores_gemma":[0.9983825,0.00034716664,0.00024887646,0.0006340407,0.00027141304,0.00011601647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039537667,0.0003311788,0.00041976952,0.0004901773,0.0001512084,0.0002015549,0.0012462453,0.0002864146,0.000007836589],"category_scores_gemma":[0.000082435414,0.00026527027,0.00008165965,0.00022752113,0.00074049766,0.0005554217,0.001088966,0.0006361105,0.000006424938],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018149347,0.00010175196,0.00017221144,0.00019801782,0.000025770103,0.00003718998,0.003962129,0.023626355,0.027960937,0.03188222,0.00004481181,0.91197044],"study_design_scores_gemma":[0.00018581018,0.0001303766,0.00011568077,0.00043437973,0.000009062347,0.000018869165,2.8899913e-7,0.6936223,0.03915472,0.2658906,0.00006929804,0.000368647],"about_ca_topic_score_codex":0.000014861319,"about_ca_topic_score_gemma":0.000050445262,"teacher_disagreement_score":0.91160184,"about_ca_system_score_codex":0.000049028622,"about_ca_system_score_gemma":0.00028279415,"threshold_uncertainty_score":0.99998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042170985,0.00023949248,0.9903833,0.00046380612,0.0007318969,0.00020786874,0.000012364474,0.000092904374,0.007826166],"genre_scores_gemma":[0.09616729,0.000100407065,0.9012904,0.0005883876,0.00043018867,0.0000025501581,0.000025145071,0.00002816974,0.0013674444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971375,0.000029243289,0.0004529017,0.0011297459,0.00085718103,0.00039345716],"domain_scores_gemma":[0.9973061,0.00030603155,0.00033117054,0.0016899662,0.00023001537,0.00013670069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039140246,0.00033822004,0.00043628525,0.00074923696,0.00017438506,0.00019734853,0.003220935,0.00020542809,0.00002917123],"category_scores_gemma":[0.00004916083,0.00030206697,0.00012405888,0.00060586026,0.0004338431,0.0008331207,0.0012512807,0.0004631201,0.00001692842],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000520207,0.00003773817,0.000047908987,0.000010917566,0.0000073378096,0.00008226403,0.00033976976,0.017271241,0.00017303946,0.036422413,0.000107546955,0.94549465],"study_design_scores_gemma":[0.00055018795,0.00037439674,0.001979607,0.0005260834,0.000015151599,0.00007764259,3.814442e-7,0.75969154,0.002259737,0.22874996,0.0049881493,0.00078714377],"about_ca_topic_score_codex":0.00006572017,"about_ca_topic_score_gemma":0.00008406918,"teacher_disagreement_score":0.94470745,"about_ca_system_score_codex":0.00013820014,"about_ca_system_score_gemma":0.00044592252,"threshold_uncertainty_score":0.99994314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003932257,0.00053246535,0.9947611,0.00048145134,0.0008244896,0.00042173264,0.0000023689918,0.002076025,0.0005071362],"genre_scores_gemma":[0.19854283,0.000047025995,0.80066687,0.00023139898,0.00015664817,0.000013902843,0.0000023864711,0.00007938123,0.000259563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99479896,0.000013495991,0.00042912707,0.0018025152,0.0016791938,0.001276697],"domain_scores_gemma":[0.99574894,0.0014784845,0.00016428187,0.0021355401,0.00030265606,0.00017007401],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011614463,0.000673169,0.0005593426,0.0022573373,0.00022637795,0.00060095,0.0052487575,0.00045478914,0.000009554484],"category_scores_gemma":[0.0006656481,0.000568336,0.00009934122,0.001600491,0.0011318556,0.00055607833,0.0024204266,0.0016156656,0.000051241972],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000129159835,0.000027831416,0.0018333076,0.0001655247,0.000035863934,0.00155072,0.00048012196,0.068238996,0.00013186398,0.00740701,0.00003135339,0.9200845],"study_design_scores_gemma":[0.0019806505,0.001986763,0.0020854718,0.0059779435,0.000039706447,0.0022760986,0.0000051740167,0.8329731,0.00972872,0.12644304,0.0097783655,0.006724964],"about_ca_topic_score_codex":0.0000136305935,"about_ca_topic_score_gemma":0.000072572,"teacher_disagreement_score":0.9133595,"about_ca_system_score_codex":0.00060169987,"about_ca_system_score_gemma":0.00078637234,"threshold_uncertainty_score":0.9996768},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016753836,0.000011733183,0.9797128,0.0022378133,0.00047145074,0.0006624773,0.00000404814,0.00014326815,0.0000025852532],"genre_scores_gemma":[0.3546342,6.950943e-7,0.64212507,0.0030970115,0.000045645545,0.00008713551,0.0000020023037,0.0000059144486,0.0000023556881],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784607,0.0000650049,0.00035103477,0.00081230566,0.0004594048,0.0004662119],"domain_scores_gemma":[0.998696,0.00042978735,0.000112050206,0.00047836493,0.00016003895,0.00012374556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012882205,0.00019043517,0.00019169723,0.00046128285,0.00014227176,0.0003561308,0.0014219916,0.00006626062,0.0000044914755],"category_scores_gemma":[0.00056095765,0.00017139936,0.0000430545,0.0011288753,0.00036568876,0.0012278475,0.0003522631,0.00036157237,0.0000031592324],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058714486,0.00013803446,0.0006533467,0.000015788759,0.0000016357974,0.000014280192,0.003888782,0.045923837,0.49483722,0.00039394078,0.000052724532,0.45407453],"study_design_scores_gemma":[0.00040529127,0.000045020355,0.0005411484,0.000013034967,4.9671337e-7,0.0000076080482,8.576712e-7,0.65644693,0.33521205,0.007193278,9.124544e-7,0.0001333881],"about_ca_topic_score_codex":0.000044685064,"about_ca_topic_score_gemma":0.0003846549,"teacher_disagreement_score":0.6105231,"about_ca_system_score_codex":0.00011026845,"about_ca_system_score_gemma":0.00031561533,"threshold_uncertainty_score":0.6989463},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017381755,0.00010682211,0.9638041,0.0027166642,0.001089655,0.028328827,0.00000129797,0.00013054037,0.0038046574],"genre_scores_gemma":[0.20760687,0.00008326852,0.6658497,0.04370062,0.015874438,0.06381796,0.0000307457,0.00034561736,0.0026908051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956671,0.00019800624,0.0007439375,0.0010306978,0.001352416,0.001007847],"domain_scores_gemma":[0.9956522,0.0011354181,0.0005315269,0.002342037,0.00018492881,0.00015387604],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0029175533,0.0005495337,0.00038027694,0.00023836693,0.0008107479,0.0011041724,0.0063943896,0.00032251558,0.000019862306],"category_scores_gemma":[0.000089399065,0.0003082243,0.0001981846,0.00062367116,0.0009157335,0.0012612188,0.0032869198,0.0018320283,0.00009154781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005962814,0.000022276257,0.000011272225,0.000048101476,0.000008642804,0.0000070598912,0.0013674804,0.0902928,0.000009135788,0.011011387,0.00028565468,0.8969302],"study_design_scores_gemma":[0.00025609354,0.000066693654,0.000054209442,0.00035505643,0.000007021873,0.00007720273,1.8140288e-7,0.92807394,0.00014659861,0.029681379,0.04084454,0.00043709093],"about_ca_topic_score_codex":0.00000341207,"about_ca_topic_score_gemma":0.00004682222,"teacher_disagreement_score":0.89649314,"about_ca_system_score_codex":0.0002645461,"about_ca_system_score_gemma":0.00030287975,"threshold_uncertainty_score":0.999937},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010446303,0.0007961632,0.99428535,0.0004547303,0.00029996983,0.00027317303,0.000007687634,0.00007961449,0.0036988347],"genre_scores_gemma":[0.09341641,0.00027146222,0.9047268,0.0005467199,0.00022868169,0.000007960203,0.0000043665314,0.00003656362,0.00076102227],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971626,0.000047697635,0.0004257114,0.001072281,0.0007803622,0.0005113483],"domain_scores_gemma":[0.997664,0.0005327037,0.00021811898,0.001150721,0.00027938097,0.00015512967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081387174,0.00034249487,0.00042128516,0.00096065714,0.00019331,0.00020223632,0.0023149299,0.00018487572,0.000022290615],"category_scores_gemma":[0.000120442295,0.0003168588,0.0000751053,0.0006900243,0.0014018698,0.00063310954,0.0014404302,0.0004420084,0.000011950669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061422015,0.000021961074,0.000050728842,0.000041915588,0.000010442949,0.000021744037,0.00069575745,0.07147395,0.0011542437,0.29920235,0.000008049207,0.6273127],"study_design_scores_gemma":[0.00024287082,0.00011902868,0.00014984922,0.00019428912,0.000004770528,0.000082543585,1.3152315e-7,0.4898001,0.0028925352,0.5050582,0.0009874129,0.00046824914],"about_ca_topic_score_codex":0.000008591444,"about_ca_topic_score_gemma":0.000039216786,"teacher_disagreement_score":0.62684447,"about_ca_system_score_codex":0.0001063729,"about_ca_system_score_gemma":0.00030354582,"threshold_uncertainty_score":0.99992836},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028596427,0.00033615986,0.99071175,0.00045323267,0.001253772,0.00022147097,0.000017545708,0.000114059876,0.0068634134],"genre_scores_gemma":[0.052879695,0.00012367989,0.9453717,0.0005753277,0.00044677116,0.000004932674,0.000018940724,0.000029206809,0.0005497317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661595,0.0000317182,0.0005785495,0.0012482499,0.0010756342,0.0004498792],"domain_scores_gemma":[0.9971585,0.00020621995,0.00041101966,0.0018500313,0.00023636321,0.00013784987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005732679,0.0003942224,0.00053095416,0.00062614976,0.00017937504,0.00022235655,0.0031720917,0.0002538889,0.00010831657],"category_scores_gemma":[0.000051623396,0.00035125794,0.00012959835,0.00052974885,0.0011252818,0.000686737,0.0018514637,0.0005860697,0.000040196854],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000511745,0.00006495323,0.00003086249,0.00006109763,0.00000878969,0.00006432018,0.0004361019,0.0041481513,0.00014902632,0.12671784,0.000127009,0.8681867],"study_design_scores_gemma":[0.00024233676,0.00017827532,0.00021707377,0.0006284655,0.0000056627096,0.00006130454,6.517307e-8,0.6432409,0.0014030886,0.35002005,0.0034657458,0.0005370088],"about_ca_topic_score_codex":0.000037383965,"about_ca_topic_score_gemma":0.00001759778,"teacher_disagreement_score":0.86764973,"about_ca_system_score_codex":0.0001545051,"about_ca_system_score_gemma":0.00017988593,"threshold_uncertainty_score":0.99989396},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003463536,0.000027074533,0.99470943,0.00017893543,0.00029448402,0.00016570157,0.0000064759233,0.000033444692,0.0011208938],"genre_scores_gemma":[0.9551876,0.0000095309715,0.044313926,0.0001737934,0.0000912549,0.0000014085649,0.000010386147,0.000008864668,0.00020321786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799466,0.000098243196,0.0004759315,0.0005538989,0.0006932273,0.00018406412],"domain_scores_gemma":[0.99822915,0.0002394676,0.00042451642,0.0008150208,0.00025858928,0.00003325233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080419116,0.00019829292,0.0002760126,0.00037425937,0.00015356144,0.00008974178,0.0018030741,0.00017469209,0.000012674383],"category_scores_gemma":[0.00015704133,0.00014313558,0.00010613583,0.0006190221,0.0006177576,0.00036757332,0.0006871469,0.0003476546,0.0000052780856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005001784,0.00031246807,0.0032133302,0.0003402398,0.00002719087,0.0000068969293,0.007912798,0.21440293,0.014299274,0.097655356,0.00034194777,0.6614826],"study_design_scores_gemma":[0.00012726978,0.00007657019,0.12408897,0.00051955844,0.000011108453,0.000008460145,0.0000011001846,0.8479621,0.00057832774,0.026290506,0.00006822621,0.00026779046],"about_ca_topic_score_codex":0.000014896953,"about_ca_topic_score_gemma":0.000019530167,"teacher_disagreement_score":0.9517241,"about_ca_system_score_codex":0.00010703667,"about_ca_system_score_gemma":0.00014848904,"threshold_uncertainty_score":0.5836899},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042531118,0.00040961837,0.9917852,0.0011188852,0.001995106,0.0004014195,0.000002094493,0.00018200534,0.0036803442],"genre_scores_gemma":[0.121566884,0.00008418401,0.87014437,0.006893034,0.0011775552,0.000006602956,0.0000053914196,0.00003000438,0.00009198609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632466,0.000053403888,0.0005708306,0.0012503278,0.0011340218,0.0006667704],"domain_scores_gemma":[0.99779,0.00032638447,0.00043421038,0.0011065602,0.0002275188,0.00011537167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007571415,0.00045922305,0.0004950376,0.00039354205,0.00067970925,0.00023988321,0.0032888204,0.00030706037,0.00004211167],"category_scores_gemma":[0.000012969787,0.00046907755,0.00017107558,0.0012695813,0.00037415206,0.00064500683,0.0028428028,0.0007052981,0.000032341613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007649784,0.000021938517,0.000008873008,0.00006618055,0.000012522339,0.00003096051,0.0006156234,0.54428697,0.000005257249,0.011768101,0.000046856887,0.4431291],"study_design_scores_gemma":[0.00042726446,0.00016246812,0.000041504332,0.0009552577,0.000024068284,0.000018334857,3.1315798e-7,0.9252506,0.00046458025,0.06548503,0.0065230187,0.0006475953],"about_ca_topic_score_codex":0.00003200268,"about_ca_topic_score_gemma":0.00029195577,"teacher_disagreement_score":0.4424815,"about_ca_system_score_codex":0.00023799308,"about_ca_system_score_gemma":0.00017506149,"threshold_uncertainty_score":0.99977607},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012810469,0.00086308806,0.99634427,0.00031135275,0.00023779226,0.00041416183,0.0000019746708,0.00026584396,0.0002804422],"genre_scores_gemma":[0.3432691,0.000020126932,0.6562968,0.00022059165,0.000046328914,0.0000050461963,0.0000043105147,0.000017334964,0.00012033024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767405,0.000045835557,0.00039628704,0.0009025084,0.0006646451,0.00031668818],"domain_scores_gemma":[0.99807334,0.00030443698,0.00044674962,0.00077113323,0.00030849507,0.00009587156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046563733,0.00037729516,0.00046298222,0.0005829463,0.00015143653,0.00043944895,0.0015412072,0.0002374411,0.000012181756],"category_scores_gemma":[0.000057960744,0.00026915796,0.000032224354,0.00043668217,0.00059752143,0.0010322919,0.0009563574,0.00046767166,0.000004036821],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007609748,0.000022845961,0.000042423282,0.00021609414,0.00000747805,0.00004058291,0.00030004783,0.0011028581,0.005304566,0.04307803,0.000025167343,0.9498523],"study_design_scores_gemma":[0.0003607415,0.00041622118,0.00035788893,0.0029213612,0.000014625713,0.00007563625,1.01425165e-7,0.6653329,0.06632533,0.2634083,0.00009318499,0.00069369934],"about_ca_topic_score_codex":0.00007378412,"about_ca_topic_score_gemma":0.000019579958,"teacher_disagreement_score":0.9491586,"about_ca_system_score_codex":0.00009326054,"about_ca_system_score_gemma":0.00024694946,"threshold_uncertainty_score":0.99997604},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025435825,0.00012048995,0.9696559,0.00039754153,0.0019144175,0.00019710268,0.0000030125057,0.00022315711,0.02723407],"genre_scores_gemma":[0.9793704,0.00013138237,0.012778158,0.0025367269,0.0027481276,0.000010174625,0.000003855069,0.0000672239,0.00235392],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997473,0.000030777734,0.00023407163,0.00073497894,0.000940374,0.0005867936],"domain_scores_gemma":[0.9983605,0.0008330171,0.00009651713,0.0004496325,0.00008650231,0.00017382904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080502447,0.00029952306,0.0002871899,0.0005168927,0.0003599238,0.0002484486,0.0009559722,0.0002915074,0.0001517597],"category_scores_gemma":[0.00024247103,0.00029140088,0.000091906426,0.0003166033,0.00047641288,0.00012634469,0.00013237026,0.00057851244,0.00013012394],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030214462,0.000013209018,0.0007307488,0.000009739034,0.0000057096236,0.00013428213,0.002780922,0.013246266,0.000006911766,0.0028942088,0.00007339953,0.9801016],"study_design_scores_gemma":[0.0022401311,0.0016093934,0.003683336,0.009667364,0.00010201011,0.00016703492,0.000015253644,0.07835182,0.0018273265,0.5376981,0.35571134,0.008926879],"about_ca_topic_score_codex":0.00027730843,"about_ca_topic_score_gemma":0.00045434834,"teacher_disagreement_score":0.9791161,"about_ca_system_score_codex":0.0004017007,"about_ca_system_score_gemma":0.0002944602,"threshold_uncertainty_score":0.9999538},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002040506,0.0012011025,0.98852634,0.00055959984,0.0013365065,0.00026384258,0.0000022994802,0.00015080631,0.007755433],"genre_scores_gemma":[0.48902857,0.00048719504,0.5065833,0.0024420184,0.0006744815,0.00001809557,0.000005365148,0.000045239034,0.00071577885],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962288,0.00004059375,0.0005146565,0.0015975637,0.00087794,0.0007404171],"domain_scores_gemma":[0.99776506,0.00034934038,0.00019608636,0.0013993597,0.00014109712,0.00014905701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005629324,0.0005073121,0.00063152786,0.0007056804,0.00020935785,0.00021003098,0.003200233,0.0002979753,0.000013428393],"category_scores_gemma":[0.00008751785,0.00045764443,0.00013907619,0.0007577923,0.00090268714,0.0007500006,0.0013484037,0.0009389704,0.00004496996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009005738,0.000051398438,0.00063023745,0.00004189796,0.000010871396,0.0010819138,0.002343953,0.04985126,0.00003662795,0.09675011,0.00006904328,0.84912366],"study_design_scores_gemma":[0.0005696852,0.0002529085,0.0025871147,0.00035852328,0.0000050686995,0.00038899027,3.8713202e-7,0.12393862,0.00065575476,0.8567947,0.012820882,0.0016273309],"about_ca_topic_score_codex":0.000034640703,"about_ca_topic_score_gemma":0.00014917615,"teacher_disagreement_score":0.84749633,"about_ca_system_score_codex":0.00032352092,"about_ca_system_score_gemma":0.0005069442,"threshold_uncertainty_score":0.9997875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020298196,0.00043121554,0.9627187,0.00018800383,0.0014394553,0.0002556391,0.000007986389,0.000044085933,0.01461672],"genre_scores_gemma":[0.98855716,0.000040425166,0.009162733,0.00088361016,0.0008803363,0.0000019035182,0.0000449751,0.0000137167735,0.0004151126],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985485,0.000010923203,0.00018370265,0.0007359022,0.00023496918,0.00028600948],"domain_scores_gemma":[0.9994089,0.000032886026,0.000082439874,0.00034675427,0.00006768588,0.00006133842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021056368,0.00025981796,0.00018908623,0.00010820278,0.00011912479,0.0000630238,0.00047798178,0.0003284105,0.000018121973],"category_scores_gemma":[0.00007120796,0.00020182334,0.00008582459,0.00009099844,0.0004948283,0.000003406111,0.00020881165,0.00028500496,0.000028918093],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019007485,0.00014808786,0.00057573005,0.00008820614,0.000049445713,0.00013929924,0.00013747852,0.13069405,0.09994202,0.0542094,0.00010185918,0.7137243],"study_design_scores_gemma":[0.0023818363,0.007917383,0.0034643933,0.0019327232,0.00005424414,0.0002103041,4.7869446e-7,0.007859973,0.5221102,0.356509,0.09286354,0.0046959003],"about_ca_topic_score_codex":0.0000029092282,"about_ca_topic_score_gemma":0.000017640064,"teacher_disagreement_score":0.968259,"about_ca_system_score_codex":0.000077445206,"about_ca_system_score_gemma":0.00020125332,"threshold_uncertainty_score":0.8230117},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016122492,0.00030115104,0.994282,0.00031954388,0.0022925818,0.0009866313,0.000008005314,0.0003202328,0.0013286212],"genre_scores_gemma":[0.08049298,0.0000035255764,0.9175213,0.0009526567,0.0005422578,0.00004927016,0.000014654151,0.000047311998,0.00037605283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99513465,0.000039491548,0.0007743908,0.0019141649,0.0010429063,0.0010943885],"domain_scores_gemma":[0.9976378,0.00044840883,0.0004048883,0.0010715893,0.00023112202,0.00020615758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010717897,0.000655349,0.0007800911,0.0012642533,0.00022418969,0.00045208397,0.0032240415,0.00038952124,0.0000012443336],"category_scores_gemma":[0.00017182388,0.0006167736,0.00014160661,0.00085160247,0.00027141927,0.00059394736,0.0006521622,0.00078290707,0.000015924568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003384905,0.00007158172,0.0005081561,0.000329406,0.00002212868,0.0008759641,0.0033657837,0.4444957,0.00006486575,0.011556158,0.0001398781,0.5385365],"study_design_scores_gemma":[0.0006870174,0.0002877419,0.0007984245,0.0025484387,0.000007416482,0.00021423695,9.861551e-7,0.9855687,0.00025524755,0.008182562,0.00071151095,0.00073769555],"about_ca_topic_score_codex":0.000016866936,"about_ca_topic_score_gemma":0.0000068025356,"teacher_disagreement_score":0.541073,"about_ca_system_score_codex":0.0007749679,"about_ca_system_score_gemma":0.0006834846,"threshold_uncertainty_score":0.99962837},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013316976,0.0004764674,0.987728,0.00022407617,0.002226327,0.00025346363,0.000005708788,0.00030312547,0.008649677],"genre_scores_gemma":[0.36256376,0.00007963209,0.63068515,0.0043081106,0.0010319347,0.000013058683,0.000009172627,0.00008918847,0.0012199968],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597085,0.000030662453,0.0005707757,0.0015795596,0.0009804195,0.0008677149],"domain_scores_gemma":[0.99662215,0.0006914022,0.0002710731,0.0019951598,0.00014865724,0.0002715434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010498125,0.0005723915,0.0005227765,0.0009612172,0.00033244197,0.00055057823,0.004491276,0.00038149115,0.000040082603],"category_scores_gemma":[0.00009613592,0.00049324357,0.00015188077,0.0005145994,0.0007566846,0.0004956237,0.0019282836,0.0007478679,0.00014693759],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004258348,0.00003093954,0.000017374246,0.00003502271,0.000008349463,0.0005377396,0.000708711,0.0024109124,0.00062532467,0.051310707,0.000039182694,0.9442715],"study_design_scores_gemma":[0.00038184214,0.00024746553,0.00017901137,0.00103603,0.000015099087,0.00041520313,3.0183693e-7,0.4539761,0.00497178,0.5274326,0.00971474,0.0016298273],"about_ca_topic_score_codex":0.000011816736,"about_ca_topic_score_gemma":0.000022864122,"teacher_disagreement_score":0.9426417,"about_ca_system_score_codex":0.00022183692,"about_ca_system_score_gemma":0.0004136887,"threshold_uncertainty_score":0.9997519},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016030417,0.00033372967,0.9957496,0.0006752232,0.00017437366,0.0003305223,0.0000048149946,0.000079978476,0.0010487487],"genre_scores_gemma":[0.63253534,0.00019014429,0.36593446,0.0009873776,0.00008015752,0.0000094334155,0.0000020332168,0.0000223283,0.0002387344],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978113,0.0000823848,0.000360723,0.00084029406,0.00064435607,0.00026092335],"domain_scores_gemma":[0.99555904,0.003125644,0.00031030457,0.000796618,0.00015142659,0.000056973717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007750143,0.00027578173,0.0003213532,0.00030719402,0.00023223941,0.0001453808,0.0012737323,0.00012216014,0.000011017187],"category_scores_gemma":[0.00035094615,0.00019320208,0.0000740166,0.00035103754,0.00079839834,0.00044791962,0.0010068556,0.00039430213,0.000008196436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002218044,0.000034311128,0.00006516701,0.000055377295,0.000015325702,0.000036483663,0.0117109865,0.0021701888,0.0016501616,0.11761975,0.00006141807,0.8665587],"study_design_scores_gemma":[0.00015796244,0.00022938139,0.00017647615,0.00043174048,0.000003915915,0.000029519098,0.0000024301241,0.19600618,0.030676994,0.7718035,0.00012324173,0.00035863934],"about_ca_topic_score_codex":0.0000134160555,"about_ca_topic_score_gemma":0.000024024932,"teacher_disagreement_score":0.86620003,"about_ca_system_score_codex":0.00011286779,"about_ca_system_score_gemma":0.000033673463,"threshold_uncertainty_score":0.7878552},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006801257,0.0005881075,0.9925317,0.0014343356,0.0026388231,0.0013072658,0.000039179726,0.00044493107,0.00033551652],"genre_scores_gemma":[0.565405,0.0000042662177,0.4286905,0.005334869,0.00037321358,0.000023522896,0.00004384642,0.00007787421,0.00004691653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941705,0.000036798643,0.00088848604,0.0023970942,0.001253907,0.0012531996],"domain_scores_gemma":[0.99586093,0.00059171,0.00059047306,0.0019634403,0.0006890048,0.00030445636],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00070145784,0.0009977147,0.00092011865,0.0011413905,0.0006180746,0.0010526265,0.0057356344,0.00050700264,0.0000044036638],"category_scores_gemma":[0.00001643835,0.00089686515,0.0002659481,0.0010241348,0.0002822417,0.0005901662,0.001283636,0.00091761834,0.000016683209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000138948135,0.000014630213,0.000008641184,0.0004041914,0.000017448814,0.000020607355,0.0015354559,0.9242046,0.00010089063,0.020911932,9.939331e-7,0.052766707],"study_design_scores_gemma":[0.0007624038,0.00013081744,0.000021014266,0.00096196646,0.000019330864,0.000042771317,5.851645e-7,0.8794618,0.00017469164,0.117464796,0.0000756344,0.0008841561],"about_ca_topic_score_codex":0.00017310125,"about_ca_topic_score_gemma":0.00078633736,"teacher_disagreement_score":0.56472486,"about_ca_system_score_codex":0.0006443498,"about_ca_system_score_gemma":0.0017248534,"threshold_uncertainty_score":0.9999844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024369081,0.0014853532,0.99632215,0.00016356369,0.0011589188,0.00024340757,0.0000022198335,0.00017171941,0.00020896745],"genre_scores_gemma":[0.27515385,0.000051809868,0.7245507,0.00006668271,0.00013738936,0.0000047910935,0.000004175267,0.000017965624,0.000012591295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756074,0.0000538963,0.00044975724,0.0008526815,0.0006046393,0.00047827998],"domain_scores_gemma":[0.997773,0.00074717635,0.00023042496,0.0010103581,0.00016163052,0.00007740947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011691718,0.00035745357,0.0004944966,0.00091087865,0.00006583417,0.000080595244,0.001827339,0.00030549846,0.000002965392],"category_scores_gemma":[0.00021163834,0.00035918754,0.000078683835,0.00058825413,0.00027272117,0.0006862172,0.0005867027,0.00075957767,0.0000071872832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042928846,0.000015093313,0.000021617814,0.000030719253,0.0000029510675,0.000007127539,0.00058953284,0.7334198,0.0010192328,0.015708055,7.4961866e-7,0.24918082],"study_design_scores_gemma":[0.00021056067,0.00008608973,0.00034362808,0.00046435828,0.0000050262174,0.00003592575,2.500536e-7,0.8371616,0.0071823024,0.15393093,0.000043111973,0.00053620647],"about_ca_topic_score_codex":0.000008851575,"about_ca_topic_score_gemma":0.000009938132,"teacher_disagreement_score":0.27491015,"about_ca_system_score_codex":0.0003545262,"about_ca_system_score_gemma":0.0001760304,"threshold_uncertainty_score":0.99988604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004548336,0.00041428627,0.98803455,0.00017661776,0.0018981964,0.00033165657,0.0000020831856,0.00015991593,0.0089372285],"genre_scores_gemma":[0.0097986525,0.00007840221,0.9885817,0.0007426754,0.00034483414,0.0000062742215,0.000002489521,0.00002957221,0.00041539618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958995,0.000038801572,0.00059720513,0.0014921685,0.0012395761,0.0007327282],"domain_scores_gemma":[0.99731183,0.00034979612,0.0003417028,0.0017719314,0.00007834499,0.00014638298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022912482,0.00048740974,0.0004192885,0.0010101247,0.00026283495,0.00037249117,0.0038690434,0.00036044206,0.000045248187],"category_scores_gemma":[0.000101123216,0.00046555325,0.00012327451,0.00044371648,0.0007194601,0.00071362196,0.0013364684,0.0008453762,0.00018861654],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034197196,0.000017178432,0.000024298106,0.000020702462,0.000005668041,0.0000505452,0.00050333916,0.013627927,0.00018660071,0.09852259,0.0000063317734,0.8870314],"study_design_scores_gemma":[0.00026343437,0.00022942605,0.00038440613,0.0003861454,0.000009114165,0.00013739003,1.9357778e-7,0.7767865,0.009693058,0.20012276,0.010835909,0.0011516754],"about_ca_topic_score_codex":0.0000078558,"about_ca_topic_score_gemma":0.0000072041066,"teacher_disagreement_score":0.88587976,"about_ca_system_score_codex":0.00055193494,"about_ca_system_score_gemma":0.00020954921,"threshold_uncertainty_score":0.99977964},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004635974,0.000099267956,0.990853,0.00009496918,0.0009609649,0.00038565407,0.0000025378868,0.0055218595,0.0020354043],"genre_scores_gemma":[0.27625874,0.0000026374387,0.7220569,0.001242999,0.00034686102,0.000013837555,0.0000061808128,0.000037253005,0.000034573637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558735,0.000053413492,0.0005019001,0.0019263364,0.0011646003,0.0007664237],"domain_scores_gemma":[0.9962493,0.0006904265,0.0003472533,0.0020694744,0.0003889799,0.00025453308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012971819,0.0006071472,0.00048724806,0.0013888074,0.00037276096,0.0006755381,0.0035932679,0.0005399847,0.0000042202228],"category_scores_gemma":[0.0002204487,0.0005636685,0.00013929131,0.0009170391,0.0006257887,0.0005850997,0.00050731463,0.0010690393,0.000017003758],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053127583,0.00004915695,0.000049784194,0.00002682067,0.000003928976,0.000054308846,0.00021081482,0.020888207,0.00009433699,0.0013825368,0.000020593436,0.9772142],"study_design_scores_gemma":[0.0001677162,0.00034791924,0.00011877166,0.0001986707,0.000006346905,0.00008479208,3.7237292e-8,0.83740926,0.004858955,0.15580219,0.00030846725,0.0006969043],"about_ca_topic_score_codex":0.000071077724,"about_ca_topic_score_gemma":0.00003429395,"teacher_disagreement_score":0.9765173,"about_ca_system_score_codex":0.00040882433,"about_ca_system_score_gemma":0.0004809331,"threshold_uncertainty_score":0.9996815},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056496664,0.0007581265,0.99003834,0.00052453636,0.001434536,0.0002468717,0.000005847607,0.00026064672,0.006166148],"genre_scores_gemma":[0.53853786,0.0005134304,0.44975328,0.0075875665,0.0011204478,0.00001850616,0.00002086942,0.000116680196,0.002331335],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967921,0.000037606314,0.00040665353,0.001449493,0.0007092403,0.0006049157],"domain_scores_gemma":[0.9979977,0.0003069238,0.00022774846,0.0011416428,0.00013234,0.00019366288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008173614,0.00047958177,0.00045921517,0.00056793896,0.00029263512,0.00064567407,0.0018721164,0.00020310869,0.00004216001],"category_scores_gemma":[0.00003162702,0.00043306832,0.00008323425,0.0004408139,0.0010182554,0.0007309874,0.0013574722,0.00062960456,0.000049436814],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070264605,0.000018367813,0.00007414824,0.000024502977,0.000009466708,0.00008432497,0.00035031792,0.0017012666,0.00007651917,0.0914232,0.000032144657,0.90619874],"study_design_scores_gemma":[0.00021459596,0.00015132884,0.0008675328,0.00015999748,0.0000057619122,0.00014309786,1.2641323e-7,0.26352507,0.00016286828,0.73037076,0.0038798912,0.00051897246],"about_ca_topic_score_codex":0.000040522136,"about_ca_topic_score_gemma":0.00007726091,"teacher_disagreement_score":0.90567976,"about_ca_system_score_codex":0.00015794786,"about_ca_system_score_gemma":0.00019267043,"threshold_uncertainty_score":0.9998121},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036414047,0.00024581345,0.99368286,0.00044141957,0.0009169115,0.00022909518,0.000004775698,0.00009904794,0.004343636],"genre_scores_gemma":[0.13227764,0.000009692219,0.86658776,0.00054667465,0.00017406055,0.000003285275,0.0000031389998,0.0000237876,0.00037394516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967008,0.00008055782,0.0006307346,0.0010994363,0.0009784047,0.0005100213],"domain_scores_gemma":[0.9972472,0.00085223035,0.00022651038,0.0012260838,0.00029682924,0.00015110223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095129834,0.00039185205,0.00053784164,0.00089210976,0.0002225184,0.0002217999,0.0023624317,0.0003107194,0.00003111315],"category_scores_gemma":[0.00017118479,0.00036383496,0.00018976342,0.00060877216,0.0005932664,0.00037286818,0.0005952794,0.00091993355,0.000024299206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056551503,0.000039927167,0.000007679475,0.000028412469,0.0000057220227,0.00005348792,0.0003498808,0.43201995,0.00020897867,0.009544191,0.000008353066,0.55772775],"study_design_scores_gemma":[0.00034670066,0.000092949194,0.000014908385,0.0002834706,0.0000070574956,0.0000231682,2.675617e-8,0.9279643,0.00077311555,0.07003171,0.00010692912,0.00035564226],"about_ca_topic_score_codex":0.00002045287,"about_ca_topic_score_gemma":0.0000072651874,"teacher_disagreement_score":0.55737215,"about_ca_system_score_codex":0.00013638996,"about_ca_system_score_gemma":0.00036555863,"threshold_uncertainty_score":0.9998814},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001157619,0.00022444836,0.9908099,0.0020768298,0.0010322909,0.0003153933,0.000007189525,0.00011820856,0.005299954],"genre_scores_gemma":[0.16629918,0.00024388626,0.82751244,0.004065648,0.0005176185,0.000018603645,0.00006475951,0.0000316517,0.0012462192],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690014,0.000042916552,0.00055790873,0.0012078879,0.0008331107,0.0004580519],"domain_scores_gemma":[0.9981359,0.00028423045,0.0002337024,0.0009508846,0.00026625773,0.00012897415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001070474,0.00031431022,0.00034064043,0.0025785083,0.0001783921,0.0005662662,0.002076342,0.00032299026,0.00004062733],"category_scores_gemma":[0.00014179759,0.00032373416,0.00009531006,0.002332785,0.000291254,0.0006637989,0.00040000444,0.0007101353,0.0001855108],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014675344,0.000039603347,0.00002128177,0.000008069987,0.0000019081967,0.000027748647,0.00043177014,0.0004905519,0.000047852045,0.005006863,0.00004511507,0.99387777],"study_design_scores_gemma":[0.00050509436,0.00014575821,0.004030389,0.0003142397,0.0000071517634,0.00006805191,2.558809e-7,0.29119524,0.0005051165,0.69417846,0.008076488,0.00097376306],"about_ca_topic_score_codex":0.000056780293,"about_ca_topic_score_gemma":0.00028172907,"teacher_disagreement_score":0.992904,"about_ca_system_score_codex":0.00039280887,"about_ca_system_score_gemma":0.00047223322,"threshold_uncertainty_score":0.9999215},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023358784,0.0002903766,0.9943132,0.00076257414,0.001660987,0.0008383587,0.000014543886,0.0006762083,0.0012101982],"genre_scores_gemma":[0.27374524,0.00012670131,0.7224678,0.002679845,0.00026340276,0.000054231823,0.000017804075,0.000065879234,0.00057912513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580944,0.00003125254,0.0006730729,0.0017691564,0.0008677655,0.0008493266],"domain_scores_gemma":[0.99717784,0.0002571338,0.0004389389,0.001377755,0.00056290027,0.00018541547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089000404,0.000653461,0.0006267016,0.00078517647,0.0004321696,0.00055326923,0.0037177426,0.00041894204,0.00001647802],"category_scores_gemma":[0.00008971697,0.0006120998,0.00011823548,0.0007323925,0.00043192532,0.0007787699,0.00069038395,0.000625894,0.00002091071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004154016,0.00016642468,0.00018141151,0.0004732368,0.00005465242,0.000031591873,0.0010197413,0.43151703,0.000059280108,0.0629519,0.0019106953,0.5015925],"study_design_scores_gemma":[0.0005767835,0.00059839874,0.00006535798,0.0006195689,0.000009851214,0.000050547016,5.3298173e-8,0.8395343,0.005926465,0.14516897,0.0062408554,0.0012088595],"about_ca_topic_score_codex":0.0000029321027,"about_ca_topic_score_gemma":0.0000033220397,"teacher_disagreement_score":0.5003836,"about_ca_system_score_codex":0.00024049157,"about_ca_system_score_gemma":0.0005582696,"threshold_uncertainty_score":0.999633},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034132082,0.0018161589,0.9902695,0.0018853287,0.0010186878,0.0010977095,0.00003134281,0.00045692563,0.0030830316],"genre_scores_gemma":[0.19950432,0.00017277001,0.7933969,0.0037472872,0.001157833,0.00007155564,0.000035196066,0.00016047915,0.0017536774],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99168307,0.00016068584,0.00095934625,0.00325302,0.002252932,0.0016909565],"domain_scores_gemma":[0.9947884,0.0006918239,0.00045522564,0.0031159427,0.0005205081,0.00042811647],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011235871,0.0011047327,0.0011136222,0.0013515499,0.00064127526,0.0011859455,0.008575876,0.00043319564,0.00006411875],"category_scores_gemma":[0.00017451533,0.00095136755,0.00029796758,0.0010954078,0.0020176326,0.0014196401,0.0028020162,0.001798211,0.00021148108],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041148418,0.00007516189,0.000037007234,0.00006614236,0.00004177989,0.00025839583,0.0016147488,0.023132661,0.029199755,0.019692706,0.000028486571,0.925812],"study_design_scores_gemma":[0.00063707656,0.00043363692,0.00030986196,0.00085708627,0.000012302914,0.000114063085,3.730957e-7,0.2506179,0.004263742,0.7339296,0.0072114505,0.0016129619],"about_ca_topic_score_codex":0.00008093374,"about_ca_topic_score_gemma":0.00018877682,"teacher_disagreement_score":0.92419904,"about_ca_system_score_codex":0.00044887,"about_ca_system_score_gemma":0.00066198345,"threshold_uncertainty_score":0.9998509},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001890388,0.000049030918,0.97326595,0.0005258281,0.0008968189,0.020914592,9.726697e-7,0.000046201447,0.0041115903],"genre_scores_gemma":[0.9291982,0.000008015548,0.060190517,0.0013090485,0.00037931002,0.008435078,0.000001601139,0.000033550914,0.0004446963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658513,0.00012801863,0.0004574164,0.0008171493,0.0016851902,0.0003270913],"domain_scores_gemma":[0.99728,0.0001815068,0.00045835262,0.0012020859,0.00081581046,0.000062235194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021743837,0.00030833768,0.00029145216,0.00023221299,0.00020488299,0.0001310397,0.002228385,0.00019097605,0.000021729491],"category_scores_gemma":[0.00009120086,0.00022103325,0.00009916476,0.0005457142,0.0004730784,0.00042336318,0.00036033534,0.00044229985,0.000009308286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000530429,0.00001856844,0.00009101617,0.000018240498,0.0000068638897,4.2090346e-7,0.00017525912,0.14698103,0.000020915306,0.007743981,0.000021055663,0.84491736],"study_design_scores_gemma":[0.000539815,0.00011609251,0.0006646143,0.0003504226,0.000017145927,0.000008833258,5.1102344e-8,0.98366725,0.0009368492,0.012383506,0.001054746,0.0002606764],"about_ca_topic_score_codex":0.0000031707389,"about_ca_topic_score_gemma":0.000018847035,"teacher_disagreement_score":0.92900914,"about_ca_system_score_codex":0.00027596697,"about_ca_system_score_gemma":0.0010458201,"threshold_uncertainty_score":0.90134746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003077654,0.0011513358,0.99698234,0.00053612556,0.00034289903,0.0005149595,0.000018023935,0.0002004762,0.00022308624],"genre_scores_gemma":[0.03604534,0.000080757316,0.9619908,0.0006754653,0.00028925756,0.000016083233,0.00002366111,0.000027865552,0.00085078634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979142,0.000021192602,0.0003271392,0.0009000099,0.0004970131,0.00034044092],"domain_scores_gemma":[0.99820584,0.0006355585,0.00021146446,0.0008074992,0.00007827412,0.000061391154],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060886826,0.00034368003,0.0002746811,0.00026352724,0.0003580925,0.00036542665,0.0014167125,0.00017441067,0.000005645197],"category_scores_gemma":[0.000059356098,0.0002574213,0.000072901305,0.0001770325,0.00038255326,0.0002215629,0.0007746076,0.0003237108,0.000005041463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038906387,0.000014809389,0.000040247254,0.000012697926,0.00000797924,0.000007699465,0.00043826256,0.33164716,0.00003176873,0.010924821,0.00013780061,0.65673286],"study_design_scores_gemma":[0.00022126138,0.00013042164,0.00035604113,0.00008553786,0.000009228792,0.000026313466,1.6722652e-7,0.96128184,0.0005680289,0.03539192,0.001537046,0.0003921835],"about_ca_topic_score_codex":0.000043191067,"about_ca_topic_score_gemma":0.000024425142,"teacher_disagreement_score":0.65634066,"about_ca_system_score_codex":0.00012960997,"about_ca_system_score_gemma":0.000105686464,"threshold_uncertainty_score":0.9999878},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000087219836,0.00020321282,0.99658746,0.00027095608,0.00020826828,0.0009444466,0.000010655951,0.00017766184,0.0015101234],"genre_scores_gemma":[0.010675143,0.00006410263,0.9881151,0.00061570725,0.00022549658,0.000026733987,0.000037100934,0.000022212656,0.0002184502],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729645,0.000037470654,0.0005577804,0.0011644727,0.0005500766,0.00039376863],"domain_scores_gemma":[0.99836457,0.0003002603,0.00038211784,0.00053396117,0.0002722676,0.00014680138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084618316,0.00038728665,0.0005007511,0.00081517815,0.00015940581,0.00035323342,0.001030407,0.0002812799,0.000011715827],"category_scores_gemma":[0.00007901237,0.0003767488,0.00012492077,0.0003639008,0.00022276244,0.00084240595,0.000285779,0.0003794292,0.0000034172829],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009450496,0.00001995955,0.000007287666,0.00006722329,0.000007954898,0.0000027275644,0.0005296312,0.00021771858,0.00064588303,0.00085505715,0.00004461316,0.9975925],"study_design_scores_gemma":[0.00094147125,0.00065755856,0.00007884522,0.0007960034,0.00003298182,0.000113951464,0.0000010070306,0.26545516,0.037547905,0.69327223,0.00020112991,0.0009017274],"about_ca_topic_score_codex":0.000034660527,"about_ca_topic_score_gemma":0.000013666078,"teacher_disagreement_score":0.99669075,"about_ca_system_score_codex":0.00013964127,"about_ca_system_score_gemma":0.00029353428,"threshold_uncertainty_score":0.99986845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033962924,0.0004471515,0.98468536,0.0006088362,0.0011642234,0.00036371243,0.000009238581,0.00008153344,0.012300287],"genre_scores_gemma":[0.50765425,0.00010514146,0.49060628,0.0013502113,0.00016241631,0.00000508551,0.000005706069,0.000035004527,0.000075877935],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961782,0.00006363757,0.00071577786,0.0013702475,0.00096672727,0.0007054069],"domain_scores_gemma":[0.9973501,0.00044160668,0.0003668009,0.0015841578,0.00012960657,0.00012775105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013443183,0.0005353488,0.000719976,0.00077073224,0.000106546075,0.00021823596,0.0037404562,0.00040918688,0.000031532694],"category_scores_gemma":[0.00007501287,0.00046193643,0.00015204196,0.0009397226,0.00081536395,0.0004952234,0.0017672214,0.0008479259,0.00003942096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012408139,0.000073742114,0.00023355926,0.00010194444,0.000012938901,0.0003305718,0.0026182083,0.14125283,0.000028869828,0.26973125,0.000026540452,0.58557713],"study_design_scores_gemma":[0.00035940527,0.00017780809,0.00045735153,0.0004869745,0.000005816741,0.000055877063,2.5474893e-7,0.09732067,0.0002686197,0.9000733,0.000242226,0.0005517072],"about_ca_topic_score_codex":0.00005397104,"about_ca_topic_score_gemma":0.00009293461,"teacher_disagreement_score":0.63034207,"about_ca_system_score_codex":0.00030698496,"about_ca_system_score_gemma":0.00058846193,"threshold_uncertainty_score":0.9997832},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005676591,0.00087768375,0.98646146,0.0011211111,0.0007480701,0.00033241842,0.000006154458,0.00009511861,0.004681392],"genre_scores_gemma":[0.8972714,0.00012427165,0.10098608,0.00035734384,0.001135867,0.0000075568705,0.000002235979,0.000019773232,0.00009547394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769133,0.00005630242,0.0003377708,0.0006414144,0.00071758626,0.00055556546],"domain_scores_gemma":[0.9992561,0.00034338757,0.000097051794,0.00015621059,0.00006842293,0.000078823905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020454377,0.0002663253,0.0003978467,0.0005318365,0.0003765652,0.000336359,0.0008631808,0.00034452864,0.000023647068],"category_scores_gemma":[0.0003065643,0.0002599488,0.00005378999,0.00027159214,0.0005927129,0.00048225845,0.00044266868,0.0005834969,0.0000026337004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008634831,0.000008976984,0.0004929333,0.000017709546,0.000013160428,0.000021039143,0.009001349,0.09490791,0.000017784545,0.018381095,0.0000015252117,0.8771279],"study_design_scores_gemma":[0.001035089,0.0000767265,0.0025304807,0.00041727914,0.000044171888,0.0000062780123,0.000029050403,0.83016175,0.000054850898,0.16231252,0.0019673344,0.0013644833],"about_ca_topic_score_codex":0.00040838282,"about_ca_topic_score_gemma":0.0017984443,"teacher_disagreement_score":0.8915948,"about_ca_system_score_codex":0.00024026593,"about_ca_system_score_gemma":0.0002664958,"threshold_uncertainty_score":0.9999853},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003992407,0.00053582015,0.99366564,0.00024739135,0.0007758916,0.00044751822,0.0000031837303,0.00025389178,0.00007827521],"genre_scores_gemma":[0.54813325,0.000013264772,0.45143443,0.00008162143,0.00022386301,0.000009583159,0.000018725956,0.000020571923,0.00006470591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968327,0.000029421188,0.0005233982,0.00078610895,0.0013628097,0.00046552505],"domain_scores_gemma":[0.9979279,0.00054698496,0.00022758686,0.0009524147,0.00025178463,0.00009329811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000719658,0.00030860552,0.00031964344,0.00090859475,0.00011960755,0.00019979314,0.0019198916,0.0001788017,0.000028121554],"category_scores_gemma":[0.00025801628,0.00030338092,0.000094676725,0.0005935275,0.00027600743,0.0014131309,0.00042526503,0.000513439,0.000023106171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004247323,0.000023419383,0.00005082402,0.00014612108,0.000009747024,0.000015338797,0.0040727546,0.018079383,0.0009098575,0.0007925988,0.000008885381,0.9758868],"study_design_scores_gemma":[0.00037922783,0.00014174242,0.002565339,0.000530379,0.000008113929,0.000031251217,0.0000010084393,0.9786173,0.009199016,0.00799389,0.000065089225,0.0004676187],"about_ca_topic_score_codex":0.000025741969,"about_ca_topic_score_gemma":0.000028645187,"teacher_disagreement_score":0.9754192,"about_ca_system_score_codex":0.0004350586,"about_ca_system_score_gemma":0.00025678947,"threshold_uncertainty_score":0.9999418},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000089546134,0.0007385325,0.9928132,0.00090510445,0.00088506046,0.00047834616,0.000004121302,0.00014593819,0.0039401175],"genre_scores_gemma":[0.06504047,0.000014866966,0.93180233,0.0022773603,0.0004727071,0.000016682761,0.0000025858433,0.0000396302,0.0003333882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604726,0.0000924663,0.00068802433,0.001419087,0.0009432276,0.0008099595],"domain_scores_gemma":[0.997121,0.0006935927,0.00046776273,0.001231504,0.0003329557,0.00015318193],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012578325,0.0005463447,0.00065370684,0.001091135,0.00032977143,0.00043701875,0.0024935363,0.00020548169,0.000019086538],"category_scores_gemma":[0.0002603828,0.0005087129,0.00022023969,0.00072355487,0.00066228234,0.00058178144,0.0008874386,0.0006812118,0.000020653177],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018709918,0.000080166814,0.00001580218,0.000048766142,0.000015617636,0.00009111302,0.00044833255,0.038298994,0.0062213526,0.025029007,0.00007334997,0.9296588],"study_design_scores_gemma":[0.0011501806,0.00028266938,0.00003835527,0.001384476,0.000030346586,0.0002969353,2.79503e-7,0.8181041,0.02410054,0.14921318,0.004100826,0.0012980948],"about_ca_topic_score_codex":0.000018290984,"about_ca_topic_score_gemma":0.000017521335,"teacher_disagreement_score":0.9283607,"about_ca_system_score_codex":0.00035814082,"about_ca_system_score_gemma":0.00063208526,"threshold_uncertainty_score":0.9997364},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001675017,0.0005041477,0.9665429,0.00012052893,0.00041696872,0.0004024986,0.0000069130765,0.00008189973,0.031756647],"genre_scores_gemma":[0.3971353,0.00009781644,0.60117996,0.000772413,0.00035972282,0.000009692294,0.000018448447,0.000029925994,0.0003967321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751186,0.000030733336,0.00041343403,0.0011015167,0.0005796256,0.00036281682],"domain_scores_gemma":[0.9985397,0.00017130001,0.00019272816,0.0007364027,0.00020511054,0.00015474464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048292248,0.00033661668,0.00044004197,0.00068696873,0.00014649669,0.0002906905,0.0014118048,0.00022346481,0.0000075901694],"category_scores_gemma":[0.000045002616,0.00030618836,0.00006369721,0.0006173409,0.00033945774,0.00042947437,0.0006413415,0.00030032604,0.0000143180305],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008885564,0.000056787263,0.00023193298,0.00007713009,0.000007796746,0.0000069345833,0.0034152088,0.012507661,0.00011379034,0.103631504,0.000026979891,0.8799154],"study_design_scores_gemma":[0.0004717941,0.0003712501,0.003331186,0.0005098078,0.000014186587,0.00011563401,3.3378416e-7,0.79231447,0.0008073355,0.19794242,0.003208035,0.0009135183],"about_ca_topic_score_codex":0.000010766663,"about_ca_topic_score_gemma":0.0000146985385,"teacher_disagreement_score":0.87900186,"about_ca_system_score_codex":0.000105341045,"about_ca_system_score_gemma":0.00022422092,"threshold_uncertainty_score":0.999939},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000102780636,0.00032209582,0.9890158,0.0006255761,0.0011658565,0.00034749124,0.0000012965547,0.00027401582,0.00814508],"genre_scores_gemma":[0.7297136,0.00009723067,0.25457814,0.014643866,0.00061126635,0.000012416485,0.00001827419,0.000055984176,0.00026919716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635893,0.000033111228,0.0005401437,0.0011117755,0.0011337124,0.0008223258],"domain_scores_gemma":[0.9976691,0.0001658278,0.00035302882,0.0013311139,0.00027511694,0.00020580346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067395123,0.00059703394,0.0005066679,0.00091345346,0.00041035473,0.0009533551,0.00331768,0.00031023668,0.000015919655],"category_scores_gemma":[0.000014052811,0.00048544057,0.00016468616,0.0011285387,0.00058307213,0.0013509823,0.000595593,0.0011311888,0.000017115537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009968753,0.000016836462,0.000044447257,0.000014013485,0.000009807462,0.00008223736,0.00084591313,0.20212474,0.000001172246,0.061219983,0.00004248692,0.7355884],"study_design_scores_gemma":[0.0003876968,0.0002226992,0.0002511302,0.00021043817,0.0000074885356,0.00016858007,1.3711515e-7,0.91755223,0.00003797989,0.07902745,0.0013930138,0.0007411404],"about_ca_topic_score_codex":0.000010629829,"about_ca_topic_score_gemma":0.00009292503,"teacher_disagreement_score":0.73484725,"about_ca_system_score_codex":0.0001241176,"about_ca_system_score_gemma":0.00022183046,"threshold_uncertainty_score":0.99975973},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011338661,0.00070239574,0.9961078,0.00045602475,0.0010326933,0.0011928641,0.000008123714,0.00027992448,0.00020879369],"genre_scores_gemma":[0.002231877,0.00007177524,0.99550956,0.0016735038,0.00023001194,0.0000596756,0.0000127925505,0.00003866819,0.00017211941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953742,0.00003529188,0.0007432279,0.0018084593,0.0011818684,0.00085697894],"domain_scores_gemma":[0.9975042,0.0004984854,0.00031504547,0.0011812575,0.00028322494,0.00021778831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015747119,0.00054140046,0.00062519324,0.0023064022,0.0002048727,0.0005622314,0.0031051335,0.00046837988,0.000026413403],"category_scores_gemma":[0.00028049282,0.00051054434,0.00021468918,0.0018265886,0.0005101022,0.0008494424,0.0011129677,0.0009857913,0.000016297128],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004463488,0.00009421271,0.00007751723,0.00015126618,0.0000122219735,0.000076053904,0.0010907452,0.02572437,0.0007731863,0.0007449368,0.000044109118,0.9712069],"study_design_scores_gemma":[0.0012742248,0.00017722059,0.00029695677,0.00097225147,0.000010601577,0.000035821064,3.7593793e-7,0.9336233,0.009674428,0.052846834,0.0002125958,0.0008753713],"about_ca_topic_score_codex":0.000031545533,"about_ca_topic_score_gemma":0.00009967843,"teacher_disagreement_score":0.97033155,"about_ca_system_score_codex":0.0007180467,"about_ca_system_score_gemma":0.0005896629,"threshold_uncertainty_score":0.99973464},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009474317,0.0011684435,0.98411685,0.00010858958,0.0015195386,0.00023254784,0.0000042031334,0.001193561,0.01070881],"genre_scores_gemma":[0.47611678,0.00032080745,0.521699,0.0005474313,0.00064366247,0.00001040674,0.0000033838458,0.0001559263,0.0005025759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997547,0.0000042707234,0.0003943354,0.00081640534,0.00047315584,0.0007648398],"domain_scores_gemma":[0.99820477,0.0006506381,0.00007518331,0.00087402517,0.00009450597,0.0001008954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018426977,0.0005272933,0.00047006903,0.00044928677,0.00014069659,0.00022073784,0.00091203174,0.00052111887,0.000048262275],"category_scores_gemma":[0.00022723772,0.0005140585,0.00009439225,0.0003829039,0.0010198245,0.0002541366,0.00047683163,0.0012102285,0.00009870925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014927814,0.0000038176495,0.000047198962,0.00003575972,0.000007662934,0.00016820105,0.00005113978,0.7660478,0.00009493925,0.0023886594,0.000019253901,0.2311341],"study_design_scores_gemma":[0.00018500487,0.00006673753,0.000055017255,0.00047430326,0.000007916917,0.000076312994,7.6984215e-8,0.8601985,0.0026944738,0.132359,0.002983774,0.0008988997],"about_ca_topic_score_codex":0.0000013256484,"about_ca_topic_score_gemma":0.000014885305,"teacher_disagreement_score":0.47516933,"about_ca_system_score_codex":0.0003015676,"about_ca_system_score_gemma":0.000029419643,"threshold_uncertainty_score":0.9997311},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040287585,0.00019579426,0.9945414,0.00029255264,0.00036738717,0.00036505936,0.00002860656,0.00004893986,0.00013149872],"genre_scores_gemma":[0.7380494,0.0000062472473,0.26155865,0.00028689211,0.000046937992,0.0000056709223,0.0000120138075,0.00001326348,0.0000209496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972044,0.00007097384,0.00061532785,0.00086473627,0.0007629869,0.00048156406],"domain_scores_gemma":[0.9972195,0.0008935956,0.00041414815,0.0010984968,0.00026358032,0.00011064768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008899414,0.00035729347,0.00049008895,0.0004958396,0.0002036237,0.00012299701,0.0015946454,0.00023119088,0.0000011788113],"category_scores_gemma":[0.00024544288,0.00029150295,0.0001192286,0.0008242686,0.00048287027,0.0002851899,0.00051079266,0.0006296633,0.0000016527797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014267686,0.000022347764,0.0002685413,0.000032109947,0.000003429938,0.00019980733,0.0016798094,0.8841187,0.00006251248,0.00097573665,0.000032733333,0.112590045],"study_design_scores_gemma":[0.00016189853,0.00018177925,0.00018259132,0.00082497083,0.0000057795587,0.00014798697,2.3046391e-7,0.99446845,0.0009915053,0.0025916686,0.0001270462,0.00031606873],"about_ca_topic_score_codex":0.0013646452,"about_ca_topic_score_gemma":0.00075790915,"teacher_disagreement_score":0.7340206,"about_ca_system_score_codex":0.00027217946,"about_ca_system_score_gemma":0.0008349766,"threshold_uncertainty_score":0.9999537},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012254785,0.00085582107,0.9911127,0.00026191038,0.0011403086,0.0002599867,0.000017742965,0.00011131492,0.0061176848],"genre_scores_gemma":[0.05722992,0.00052283786,0.94075316,0.0007382542,0.0003096594,0.000008926115,0.000027842645,0.000037937403,0.00037143906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965838,0.00003164504,0.000598145,0.0013014526,0.0010414975,0.0004434587],"domain_scores_gemma":[0.99684155,0.00040849586,0.00036592985,0.001986978,0.00024199477,0.00015504874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003691211,0.00039161686,0.00050578377,0.000927125,0.00025360828,0.00015430333,0.003447354,0.00023130939,0.00002563295],"category_scores_gemma":[0.000054562417,0.00034410742,0.00017063956,0.0007598497,0.0007644014,0.0008520278,0.0016920578,0.0006130905,0.00001992955],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010924677,0.000113808666,0.00032856976,0.00006771992,0.000029205507,0.00035026023,0.0013916446,0.012884857,0.00031303812,0.06403812,0.000743585,0.9197283],"study_design_scores_gemma":[0.0006201888,0.00033117767,0.0022454564,0.00077314366,0.000015436057,0.00039003429,2.7959774e-7,0.5587902,0.0050074244,0.42531925,0.005265511,0.0012418817],"about_ca_topic_score_codex":0.00007538124,"about_ca_topic_score_gemma":0.00002184864,"teacher_disagreement_score":0.91848636,"about_ca_system_score_codex":0.00007637096,"about_ca_system_score_gemma":0.0005276775,"threshold_uncertainty_score":0.9999011},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003508428,0.0010457606,0.9955265,0.00027518155,0.0013657717,0.0012332589,0.000018482058,0.00013153507,0.00005264921],"genre_scores_gemma":[0.9313666,0.00003414434,0.0682314,0.00016962939,0.00008281964,0.00003190916,0.000030395922,0.000025900614,0.000027190034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962441,0.00018947017,0.0011368176,0.0011027106,0.0007827082,0.0005442432],"domain_scores_gemma":[0.9963177,0.0005829825,0.0008062098,0.0017120021,0.0004258396,0.00015526003],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001944264,0.00047632214,0.00063538173,0.0010513968,0.00031152242,0.0011851597,0.0023592128,0.00049531745,0.0000014014222],"category_scores_gemma":[0.00018742884,0.0004814842,0.0000715315,0.0005831331,0.0006101268,0.0013976304,0.00056198286,0.0009868125,0.000017664379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036585265,0.00019253774,0.0006230056,0.000442759,0.00004335246,0.00008623567,0.0024006313,0.6140319,0.018327825,0.018965831,0.000007675066,0.34484163],"study_design_scores_gemma":[0.001064563,0.000033734104,0.0008516446,0.00061589625,0.00001451995,0.00010218158,0.0000011787243,0.9937173,0.00031477184,0.0027103517,0.000120485034,0.0004533605],"about_ca_topic_score_codex":0.0002950876,"about_ca_topic_score_gemma":0.00038546993,"teacher_disagreement_score":0.9310158,"about_ca_system_score_codex":0.0006012077,"about_ca_system_score_gemma":0.00023774338,"threshold_uncertainty_score":0.9998517},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001251561,0.00013427396,0.9917344,0.002541781,0.0011862626,0.0010639423,0.000070223236,0.00014789592,0.0029960861],"genre_scores_gemma":[0.76451576,0.000107779095,0.22647648,0.0018029226,0.00047437902,0.00026506616,0.00016386634,0.00011091511,0.0060828645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993603,0.000038460934,0.0008284979,0.0020929575,0.002506421,0.0009306914],"domain_scores_gemma":[0.99766743,0.000083649626,0.00025665644,0.0013856415,0.0003233508,0.00028329543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009914262,0.0006692203,0.00064086757,0.00089476415,0.00019222926,0.0004276299,0.0025687744,0.00031831753,0.00004722576],"category_scores_gemma":[0.00003783931,0.00064905506,0.00012203607,0.0014526203,0.00023950258,0.0005886748,0.00044333533,0.0007708529,0.00015427143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024196252,0.00025296578,0.00008246902,0.00016499593,0.00003764613,0.00051859464,0.0022931357,0.30908802,0.000039338436,0.010963896,0.00027095914,0.67626375],"study_design_scores_gemma":[0.0014867855,0.000361322,0.0009343199,0.0012206738,0.000023413717,0.000099270685,0.000002908393,0.86862534,0.00053759135,0.018387549,0.10637422,0.001946592],"about_ca_topic_score_codex":0.000023420527,"about_ca_topic_score_gemma":0.000028427261,"teacher_disagreement_score":0.7652579,"about_ca_system_score_codex":0.00082026934,"about_ca_system_score_gemma":0.00010923093,"threshold_uncertainty_score":0.99959606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029155986,0.00035690906,0.98574096,0.00029996686,0.0032110743,0.00041231315,0.000002981956,0.0003432462,0.009603376],"genre_scores_gemma":[0.04323874,0.00005424395,0.95526147,0.0007492649,0.00039609033,0.000011601336,0.0000029027378,0.00003723262,0.0002484821],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952305,0.00005854439,0.00065763784,0.0019174422,0.0013003846,0.0008354978],"domain_scores_gemma":[0.9965358,0.00026877545,0.0004160214,0.0023045542,0.00025315298,0.00022171994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019662122,0.0005978113,0.00055040076,0.001022463,0.00035559692,0.0006307615,0.005196568,0.000415493,0.00004797392],"category_scores_gemma":[0.00024366617,0.0005730595,0.00016625386,0.0008581033,0.0007672603,0.0012415414,0.0016846276,0.0011053303,0.000114300805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000250737,0.000019847974,0.000006179298,0.000026242098,0.0000047353724,0.00004732331,0.0003134464,0.00744486,0.0001519118,0.36393967,0.0000031266409,0.62804013],"study_design_scores_gemma":[0.00024778416,0.00014920549,0.000434278,0.00039021892,0.0000069015496,0.00011671002,7.9199026e-8,0.24279599,0.0044778655,0.7497042,0.0008917479,0.0007850483],"about_ca_topic_score_codex":0.00001850332,"about_ca_topic_score_gemma":0.000012345539,"teacher_disagreement_score":0.6272551,"about_ca_system_score_codex":0.00096712366,"about_ca_system_score_gemma":0.00083710824,"threshold_uncertainty_score":0.9996721},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030539682,0.00014562851,0.9879547,0.00093899475,0.0018695225,0.00035324803,0.000005936525,0.000530583,0.008170869],"genre_scores_gemma":[0.34981588,0.00006946722,0.64870155,0.001009949,0.00013549461,0.0000055830697,0.0000116554065,0.000034023815,0.00021640067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966824,0.000027096014,0.00053813815,0.0013813142,0.00079527695,0.0005757942],"domain_scores_gemma":[0.9980164,0.00025563565,0.00029192097,0.0009841631,0.00026537382,0.0001864693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048219148,0.0004918529,0.00043664975,0.0008925509,0.00026701405,0.0006164319,0.0017100608,0.0003256688,0.00018256353],"category_scores_gemma":[0.00008667632,0.00049233745,0.00013514691,0.00065634784,0.00087214133,0.000632712,0.0005625359,0.00079164054,0.00007413503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018267505,0.000014250668,0.00002870502,0.000018261648,0.0000090370795,0.00007648653,0.0003435072,0.092054754,0.00009670187,0.045893785,0.0000028363586,0.86145985],"study_design_scores_gemma":[0.00042694964,0.00007754634,0.00057895534,0.0005235011,0.000008320389,0.00019515314,2.067814e-7,0.8225268,0.0003274921,0.17418145,0.0003380426,0.0008155515],"about_ca_topic_score_codex":0.000016895501,"about_ca_topic_score_gemma":0.00015805053,"teacher_disagreement_score":0.8606443,"about_ca_system_score_codex":0.00073747715,"about_ca_system_score_gemma":0.0011607836,"threshold_uncertainty_score":0.9997528},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045992132,0.0014062845,0.98259735,0.0012289097,0.0014991657,0.00028606743,0.000010611751,0.00019903213,0.012726559],"genre_scores_gemma":[0.053795498,0.00033626184,0.94151366,0.002734592,0.0011062622,0.0000071942213,0.00002411165,0.000047228034,0.00043517863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531645,0.000032364027,0.0006135114,0.002269369,0.000900776,0.0008675458],"domain_scores_gemma":[0.9957846,0.00031188666,0.00019583425,0.0034650217,0.00008172844,0.00016092639],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012288832,0.0005400094,0.00058268936,0.0009956103,0.00017585495,0.0007356432,0.008977586,0.0003276836,0.000026886844],"category_scores_gemma":[0.00006358915,0.00048288377,0.00007541906,0.00082996004,0.00047185514,0.001551314,0.004918148,0.00097547495,0.00007626268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029716552,0.00003130147,0.0001005398,0.00002369116,0.0000045177726,0.0001499057,0.00035278816,0.041285392,0.000018806893,0.009382999,0.00007225866,0.94857484],"study_design_scores_gemma":[0.00024150051,0.00007239139,0.00028475997,0.00038884662,0.000003488419,0.000074770556,1.6966634e-7,0.9197023,0.00016182636,0.06409769,0.014214515,0.0007577643],"about_ca_topic_score_codex":0.00008187472,"about_ca_topic_score_gemma":0.00053218036,"teacher_disagreement_score":0.9478171,"about_ca_system_score_codex":0.00027456216,"about_ca_system_score_gemma":0.00053805753,"threshold_uncertainty_score":0.9997623},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003706099,0.00085055095,0.97442824,0.0007108302,0.0031388407,0.00029025177,0.0000053148437,0.00026193404,0.019943422],"genre_scores_gemma":[0.28217608,0.00012312301,0.7131672,0.0011581293,0.0015127823,0.000009458476,0.000011504391,0.000043565535,0.0017981296],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99598885,0.00008319483,0.00064010615,0.0015689533,0.0010706262,0.00064829213],"domain_scores_gemma":[0.9960744,0.0018139957,0.00041279016,0.0013848167,0.00015550814,0.00015848331],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000723433,0.00050790055,0.0005819344,0.0005138805,0.00044289947,0.0007553337,0.0032935336,0.00041940733,0.00020825665],"category_scores_gemma":[0.0004141097,0.00047005987,0.00014207364,0.0004287124,0.00088618865,0.0010225197,0.0011002201,0.001196075,0.00024966363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011983456,0.00006893234,0.0016437068,0.000016774507,0.000049559763,0.0004557435,0.0066110143,0.005803621,0.00014730681,0.14514734,0.00032806987,0.83971596],"study_design_scores_gemma":[0.0011073971,0.0001601886,0.002643472,0.0007062301,0.00003244268,0.00008948343,0.000003891037,0.26537105,0.0011499908,0.7118688,0.015099011,0.0017680347],"about_ca_topic_score_codex":0.000092839735,"about_ca_topic_score_gemma":0.00011361151,"teacher_disagreement_score":0.8379479,"about_ca_system_score_codex":0.00027555632,"about_ca_system_score_gemma":0.000239396,"threshold_uncertainty_score":0.9997751},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000437079,0.0003275137,0.98365766,0.00044579606,0.0010528931,0.00024740398,0.0000045515526,0.00018538443,0.013641698],"genre_scores_gemma":[0.68758327,0.00020669152,0.30465278,0.005807439,0.00037064505,0.000022220756,0.000007932677,0.000072025825,0.0012770074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972838,0.000033696135,0.00031966664,0.0013583256,0.0005644872,0.0004400111],"domain_scores_gemma":[0.9976673,0.000502091,0.00017664014,0.0013967819,0.00009191084,0.00016527489],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005477719,0.0003847161,0.00034033996,0.00075632875,0.00025934883,0.00040806798,0.002128823,0.00020276644,0.000026558684],"category_scores_gemma":[0.00006312623,0.00033114533,0.00008556941,0.0004049044,0.00070596754,0.00046498716,0.0009947849,0.0005503933,0.000044823966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031158736,0.00002060381,0.0000385313,0.000011511208,0.000007619878,0.00006421741,0.00085489644,0.00048733084,0.000044072312,0.5914788,0.000040968564,0.4069483],"study_design_scores_gemma":[0.0001665304,0.00015979621,0.0006648935,0.00020019157,0.0000052389837,0.000059582515,1.9236805e-7,0.030278776,0.00050463557,0.967142,0.00039062882,0.0004275264],"about_ca_topic_score_codex":0.000034340115,"about_ca_topic_score_gemma":0.00004173156,"teacher_disagreement_score":0.6871462,"about_ca_system_score_codex":0.000065392116,"about_ca_system_score_gemma":0.00014798448,"threshold_uncertainty_score":0.99991405},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012578922,0.00074654125,0.9923285,0.003522531,0.0013168277,0.0010641931,0.000006036786,0.00006251048,0.00094023976],"genre_scores_gemma":[0.25424585,0.0004371382,0.73095727,0.005469892,0.0021590032,0.0002586963,0.0000055867918,0.0001828958,0.0062836735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614626,0.0000894653,0.0005759452,0.001161324,0.0011801774,0.0008468149],"domain_scores_gemma":[0.99087954,0.005679352,0.00036466244,0.0024535665,0.00051586586,0.0001069902],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0037024054,0.00041470485,0.00043768543,0.00032363154,0.0009149493,0.0004970641,0.007958157,0.00019986783,0.00000548379],"category_scores_gemma":[0.00048346136,0.00018866439,0.00022812831,0.00052604027,0.0022946661,0.00028344226,0.0019936608,0.0009122134,0.00001049792],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020302079,0.000008607876,0.000011579111,0.000035838468,0.00001802767,0.0000032471107,0.00033523564,0.014555091,0.00016662371,0.09996264,0.00006778845,0.88481504],"study_design_scores_gemma":[0.00022411447,0.00020505415,0.000028203796,0.00019113782,0.000007582174,0.000019133664,3.460163e-7,0.5220261,0.0016245778,0.45115456,0.024181228,0.0003379333],"about_ca_topic_score_codex":0.000009071428,"about_ca_topic_score_gemma":0.00006914,"teacher_disagreement_score":0.8844771,"about_ca_system_score_codex":0.000117147174,"about_ca_system_score_gemma":0.00038011526,"threshold_uncertainty_score":0.9974093},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063139796,0.000039991755,0.93457675,0.0017270667,0.0001923572,0.00025132918,0.0000035417165,0.00006534103,0.000003831284],"genre_scores_gemma":[0.50721824,8.736349e-7,0.49217638,0.00053014304,0.000062869854,0.000005824737,0.0000012753615,0.000004104874,2.6664407e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980647,0.00006843018,0.00028934935,0.0006449671,0.0005165064,0.00041603326],"domain_scores_gemma":[0.99854696,0.00041724916,0.00013294232,0.000651804,0.00013021196,0.00012085147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032937544,0.0001708556,0.00018178027,0.000262081,0.00025034614,0.00009836163,0.0012033782,0.00007159974,0.0000024092835],"category_scores_gemma":[0.00008502564,0.00015738778,0.000049193277,0.002220659,0.0003759774,0.00048220187,0.0003365747,0.00027732985,0.0000048962083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048897546,0.000056568097,0.0007225908,0.0000047088383,0.0000013811726,0.0000026693322,0.0001982593,0.7462009,0.0316323,0.0009044776,0.0000087120325,0.22026254],"study_design_scores_gemma":[0.0002602874,0.0000646004,0.0033991095,0.000032426244,0.000002862386,0.000026048394,3.627223e-7,0.9051421,0.088738106,0.0021560853,0.000027269196,0.00015070994],"about_ca_topic_score_codex":0.0000086639675,"about_ca_topic_score_gemma":0.000048745045,"teacher_disagreement_score":0.44407848,"about_ca_system_score_codex":0.00016660178,"about_ca_system_score_gemma":0.00028226752,"threshold_uncertainty_score":0.64180875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008509831,0.00011702333,0.9946147,0.00035083797,0.0018905153,0.00096458493,0.00013734963,0.00050475803,0.0013350839],"genre_scores_gemma":[0.009824755,0.000012297249,0.98882926,0.00045832002,0.00047753408,0.000027161479,0.00010436946,0.00006506316,0.00020123247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938262,0.000025400834,0.00074462796,0.0029754154,0.0013445598,0.0010837924],"domain_scores_gemma":[0.9918165,0.0012899317,0.00044139053,0.0060152994,0.00020529864,0.00023153078],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0025884362,0.00072412356,0.00067418104,0.0013757944,0.00045676946,0.0009731237,0.011845908,0.00046771785,0.000021328726],"category_scores_gemma":[0.00034370794,0.00066765735,0.00013219581,0.0006077523,0.00048538737,0.00053850055,0.0121476,0.00080352294,0.000043777516],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001021199,0.000035740264,0.0000027676265,0.000027919494,0.000009335593,0.00003324089,0.00037213805,0.009945526,0.0005631198,0.0013763144,0.00014219918,0.9874815],"study_design_scores_gemma":[0.00027964293,0.00021410754,0.0000049800374,0.00078671443,0.000014389953,0.00004917859,2.405216e-7,0.9589229,0.003370698,0.032015767,0.0036130964,0.0007282736],"about_ca_topic_score_codex":0.00001622764,"about_ca_topic_score_gemma":0.00013558778,"teacher_disagreement_score":0.9867532,"about_ca_system_score_codex":0.00035059702,"about_ca_system_score_gemma":0.00039041656,"threshold_uncertainty_score":0.99957746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013201905,0.00019448409,0.9951751,0.00070187455,0.0010843689,0.0005750985,0.000051336952,0.00026481945,0.001820849],"genre_scores_gemma":[0.04193012,0.000017013956,0.9543597,0.0017553418,0.00043883955,0.000022272023,0.000016010965,0.000045074376,0.0014156265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955349,0.000019151843,0.0006554607,0.0018217954,0.0010877355,0.0008809528],"domain_scores_gemma":[0.9967403,0.00012115328,0.000245343,0.002184715,0.00030824245,0.00040024146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005699287,0.00065934315,0.000663107,0.0009326609,0.00038677358,0.00028957066,0.0024553596,0.00027153865,0.000016119302],"category_scores_gemma":[0.00004498349,0.00058178796,0.00016167124,0.0006920846,0.00042745823,0.0012626727,0.0023367137,0.000739358,0.000103674436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008568169,0.00006125256,0.000022468956,0.00002486142,0.0000066258494,0.00018452253,0.0013799462,0.32593882,0.00025108203,0.12133085,0.00013251949,0.55065846],"study_design_scores_gemma":[0.00026331726,0.0002960186,0.000030432893,0.00054826436,0.000009743541,0.0001712798,6.115068e-7,0.94447845,0.0005527688,0.032224197,0.020172494,0.0012524271],"about_ca_topic_score_codex":0.000088730616,"about_ca_topic_score_gemma":0.00077377737,"teacher_disagreement_score":0.61853963,"about_ca_system_score_codex":0.0004080172,"about_ca_system_score_gemma":0.00088614627,"threshold_uncertainty_score":0.99966335},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000016898298,0.00022995088,0.9960618,0.0011507554,0.00036346127,0.0012092907,0.00007387918,0.00013493228,0.000774251],"genre_scores_gemma":[0.001323921,0.000054678763,0.99585885,0.0015967039,0.00055129523,0.00025059987,0.000022513566,0.000026930726,0.0003145283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969443,0.000015957148,0.0004255906,0.0014428338,0.0006604283,0.0005108652],"domain_scores_gemma":[0.99816227,0.00023629956,0.00024307922,0.00074407825,0.00042181058,0.00019245529],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005039682,0.0003881722,0.00045714655,0.00073592976,0.0003497779,0.00042411365,0.0015468748,0.00018262518,0.000004779682],"category_scores_gemma":[0.000020154604,0.00039576317,0.0002311435,0.00083440304,0.00015693874,0.00073969393,0.0004544736,0.00033961175,0.00004232679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012882688,0.00002184532,3.057312e-7,0.000012791745,0.000017481743,5.559555e-7,0.00045146298,0.118955925,0.00024181492,0.002393416,0.000008297697,0.8778948],"study_design_scores_gemma":[0.00019552594,0.00005143451,0.0000029041869,0.00017542545,0.000018601198,0.0000055071014,0.0000012098546,0.9717912,0.0022883802,0.022944963,0.0020591242,0.00046569834],"about_ca_topic_score_codex":0.000014619173,"about_ca_topic_score_gemma":0.000022889588,"teacher_disagreement_score":0.8774291,"about_ca_system_score_codex":0.00036845365,"about_ca_system_score_gemma":0.00028351892,"threshold_uncertainty_score":0.99984944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002315801,0.00008715235,0.9955325,0.0015554831,0.001420246,0.0005067164,0.0000162878,0.00007323491,0.0005767946],"genre_scores_gemma":[0.72099406,0.000011906945,0.27760947,0.000954269,0.00033769876,0.00000625583,0.0000050046806,0.000020231304,0.00006107438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700135,0.00003966076,0.0005253972,0.001081214,0.0007886616,0.0005637389],"domain_scores_gemma":[0.995424,0.0021329627,0.00043683185,0.0014612022,0.0004383748,0.00010665598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007777905,0.00047158595,0.0004710306,0.00034422436,0.00035026547,0.00034014622,0.0036495994,0.00046481556,0.000025038911],"category_scores_gemma":[0.00033368566,0.0003309412,0.00014540648,0.0004751773,0.0006918931,0.00028256138,0.00051529496,0.0010870856,0.000004006218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009969862,0.000015443566,0.000010604613,0.000026249485,0.000008962102,0.000002497588,0.00039186567,0.073296025,0.001188909,0.61399466,0.00002649065,0.31102833],"study_design_scores_gemma":[0.000085641135,0.00018309375,0.00004657494,0.00023888727,0.0000057974908,0.000004953964,7.429423e-8,0.42260107,0.004193025,0.5722844,0.000098555574,0.00025792597],"about_ca_topic_score_codex":0.000011117127,"about_ca_topic_score_gemma":0.00021465134,"teacher_disagreement_score":0.7207625,"about_ca_system_score_codex":0.00007836541,"about_ca_system_score_gemma":0.00049613556,"threshold_uncertainty_score":0.9999143},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015268048,0.00040195635,0.9611051,0.0010778116,0.0013936902,0.0006319926,0.00014790804,0.0001437974,0.019829659],"genre_scores_gemma":[0.96551514,0.00007491405,0.029146375,0.00479566,0.0002284674,9.518052e-7,0.00014035785,0.0000094467905,0.00008867458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804384,0.0000349612,0.0003841955,0.0005990621,0.00062765466,0.00031027696],"domain_scores_gemma":[0.99886084,0.00034587304,0.00022581925,0.00037889316,0.00008063732,0.000107960426],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005311914,0.00025601182,0.00026468182,0.0010526653,0.0001386932,0.00008025435,0.0005861338,0.00015235422,0.0009955686],"category_scores_gemma":[0.000019876603,0.000221314,0.00007039844,0.00041221877,0.00032451283,0.00038024085,0.00003442474,0.00034367538,0.000030036555],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020635152,0.000020429728,0.0017525994,0.000013309695,0.000004774549,0.000011815367,0.0002534067,0.0017471245,0.000008860421,0.00048221587,0.00017762076,0.9955072],"study_design_scores_gemma":[0.0021382323,0.0047067534,0.010690732,0.00056117214,0.00005176016,0.00010089615,0.000013813372,0.8027134,0.009752829,0.15243374,0.015259283,0.0015773856],"about_ca_topic_score_codex":0.0012781591,"about_ca_topic_score_gemma":0.00020689533,"teacher_disagreement_score":0.9939298,"about_ca_system_score_codex":0.00002658927,"about_ca_system_score_gemma":0.0001940006,"threshold_uncertainty_score":0.9999177},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5436635,0.00019689306,0.4556947,0.00006730568,0.00010892651,0.0002285152,0.000001557464,0.00001778436,0.000020791744],"genre_scores_gemma":[0.74942154,0.0000021573871,0.25042585,0.00012864858,0.000015319149,0.0000017770674,6.150605e-7,0.0000033563008,7.1544275e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877685,0.00006133027,0.00031409896,0.00029531852,0.00033980564,0.00021260817],"domain_scores_gemma":[0.9992634,0.00011724597,0.0001026396,0.0004102513,0.000064748805,0.000041701955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005584136,0.00011400504,0.00031137886,0.00012458462,0.000038907954,0.000008229801,0.00018901045,0.00007589146,0.0000024772226],"category_scores_gemma":[0.00010651964,0.00007797656,0.00009225434,0.0009188495,0.00016250822,0.00010138096,0.000073117735,0.00017251591,1.9813362e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088348126,0.00036014154,0.19132704,0.00003886266,0.0000036338836,0.000005671795,0.0025106936,0.2160666,0.47730613,0.0001456562,0.0000036011363,0.11214363],"study_design_scores_gemma":[0.0007854746,0.00074592704,0.04036576,0.00020705031,0.000015132683,0.0000053655035,0.0000016623083,0.6524588,0.30207783,0.003290809,9.5015974e-7,0.000045244087],"about_ca_topic_score_codex":0.000023297953,"about_ca_topic_score_gemma":0.00017792598,"teacher_disagreement_score":0.4363922,"about_ca_system_score_codex":0.000083060215,"about_ca_system_score_gemma":0.00012983276,"threshold_uncertainty_score":0.3179792},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031184164,0.0006612874,0.9919666,0.00053198624,0.0011823565,0.00026211902,0.000007527764,0.00011664585,0.0049596243],"genre_scores_gemma":[0.38791114,0.00020617819,0.61075735,0.00053176534,0.00041022323,0.0000035307214,0.000021738566,0.000034414934,0.00012364068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967506,0.00004113263,0.0006277929,0.0012190295,0.00090088625,0.00046057533],"domain_scores_gemma":[0.9978112,0.00020649434,0.0005204253,0.0011367669,0.00021713677,0.00010795694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006741487,0.00040118746,0.00048787714,0.0005873032,0.00021934207,0.00027295263,0.0024112184,0.00034471156,0.000015332776],"category_scores_gemma":[0.000034010704,0.00036146987,0.00012119508,0.000536569,0.000621967,0.00047751106,0.00061604974,0.0006090837,0.000032588014],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017408423,0.000042733882,0.00005739027,0.000036039364,0.000006281182,0.000009404256,0.0004109738,0.003372708,0.0004931184,0.020568809,0.0001449208,0.9748559],"study_design_scores_gemma":[0.00022366902,0.00016874447,0.00047635345,0.00025432167,0.000008384304,0.000041163425,2.483929e-7,0.9021967,0.0008903749,0.09308882,0.002101001,0.0005501825],"about_ca_topic_score_codex":0.000022202938,"about_ca_topic_score_gemma":0.0000036131205,"teacher_disagreement_score":0.9743057,"about_ca_system_score_codex":0.00017558453,"about_ca_system_score_gemma":0.00012144116,"threshold_uncertainty_score":0.9998837},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012836742,0.0003029768,0.99299693,0.0015482967,0.000668009,0.00092075695,0.000002272962,0.00045155626,0.0018254982],"genre_scores_gemma":[0.035266627,0.0000068939544,0.9594282,0.0019542628,0.00071864855,0.000021409582,0.000005300102,0.000078723766,0.002519963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99486256,0.00002272469,0.00051130046,0.0024922474,0.0010503592,0.0010608381],"domain_scores_gemma":[0.99702084,0.00046272954,0.00042709176,0.0017107665,0.00017429545,0.00020427145],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010726525,0.0008654415,0.00074777566,0.00089218817,0.00065321394,0.00096582423,0.003841043,0.0002826976,0.0000043119553],"category_scores_gemma":[0.000053964082,0.00069439603,0.00021635254,0.00057952973,0.0003323457,0.0001234585,0.0015311242,0.00091874134,0.000037050893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024652165,0.000049004208,0.00006527194,0.000066864704,0.00002316226,0.00007328787,0.0004106905,0.6167019,0.00003781563,0.017512927,0.00001294184,0.3650215],"study_design_scores_gemma":[0.00079906924,0.00054323586,0.00016509923,0.001648627,0.000017391107,0.000050345418,3.0015113e-7,0.9705852,0.000046780926,0.02418208,0.0010602244,0.00090163015],"about_ca_topic_score_codex":0.000022005997,"about_ca_topic_score_gemma":0.000052237516,"teacher_disagreement_score":0.3641199,"about_ca_system_score_codex":0.00031199303,"about_ca_system_score_gemma":0.00012920887,"threshold_uncertainty_score":0.9995507},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010204968,0.0014208909,0.993509,0.00005733283,0.0022911981,0.00023803764,0.000015110242,0.00033135182,0.0011166156],"genre_scores_gemma":[0.24819669,0.0007848587,0.74843454,0.0010721107,0.001045311,0.000023470258,0.000016410504,0.00031297165,0.00011366756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736726,0.000017230625,0.00046286173,0.000869781,0.0004891416,0.000793699],"domain_scores_gemma":[0.99862033,0.00035171065,0.000120306286,0.00067101966,0.00008753815,0.0001491155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002798831,0.0006478091,0.000536706,0.000435897,0.00023156378,0.00029276876,0.0008242372,0.00015606084,0.00003101014],"category_scores_gemma":[0.000040703373,0.0006571613,0.0001144682,0.00029477783,0.0004002469,0.0010153026,0.00025176813,0.0008615839,0.000030749216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016683099,0.0000070555666,0.000007930911,0.00007994666,0.0000121573075,0.000044492856,0.00023558937,0.6375716,0.0026331674,0.00006424029,0.000027898215,0.35931426],"study_design_scores_gemma":[0.00024098832,0.000033826334,0.000008726774,0.0010534002,0.00002507736,0.00013724969,6.220766e-7,0.96257144,0.025515305,0.004918497,0.0043166494,0.001178187],"about_ca_topic_score_codex":0.000006220798,"about_ca_topic_score_gemma":0.0000017736847,"teacher_disagreement_score":0.3581361,"about_ca_system_score_codex":0.0003453666,"about_ca_system_score_gemma":0.00005392207,"threshold_uncertainty_score":0.99958795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048418864,0.00011049214,0.99620163,0.00060866476,0.0007213507,0.0006970164,0.000008484685,0.00019630151,0.00097188976],"genre_scores_gemma":[0.5623126,0.00002982025,0.4364144,0.0003874783,0.00041797792,0.000023803546,0.000013134734,0.00004073975,0.00036003214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99498326,0.00005939309,0.0005342088,0.002030715,0.0014422722,0.00095013756],"domain_scores_gemma":[0.9971711,0.0006298581,0.00020972242,0.0009377606,0.00075721403,0.00029432328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013339382,0.00061798986,0.00060472044,0.0005442965,0.0006634495,0.00053238665,0.0023984835,0.00040119883,0.00001507656],"category_scores_gemma":[0.000053212996,0.00052323355,0.00014024033,0.00054585724,0.0017034728,0.0006626582,0.00079604995,0.0015662708,0.000030520492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060052673,0.00006479472,0.00036415123,0.00013182675,0.000028930328,0.00009504612,0.0017215085,0.3036196,0.00019166693,0.015228849,0.00007813676,0.6784154],"study_design_scores_gemma":[0.00050860323,0.0009681768,0.0002350867,0.0004698269,0.000010030733,0.00024687164,4.916584e-7,0.9722119,0.0016758064,0.022581417,0.00029849322,0.0007932751],"about_ca_topic_score_codex":0.000048248025,"about_ca_topic_score_gemma":0.000040488827,"teacher_disagreement_score":0.67762214,"about_ca_system_score_codex":0.0004351963,"about_ca_system_score_gemma":0.0017358674,"threshold_uncertainty_score":0.99972194},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011773014,0.00087022333,0.9574397,0.0013059407,0.0018288983,0.00037413728,0.000006512368,0.00020956135,0.037953243],"genre_scores_gemma":[0.035743244,0.0001720783,0.95887434,0.0032963161,0.0012183158,0.000012377175,0.000004882006,0.000043292668,0.00063512614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959516,0.00003477095,0.0005356112,0.0017075425,0.0009790289,0.00079143036],"domain_scores_gemma":[0.99745834,0.00027682298,0.00029217164,0.0015065833,0.00026886084,0.00019721394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006436217,0.0006022973,0.00058766815,0.00061989774,0.0002768802,0.00080367696,0.003875345,0.00035492,0.00003831716],"category_scores_gemma":[0.000043583215,0.000524983,0.00012268228,0.00090247835,0.00057346444,0.0008829589,0.0019722458,0.0008042323,0.00012878327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003992132,0.000019587591,0.00000949559,0.000014869009,0.000008885407,0.00011143912,0.0009142053,0.06459867,0.000014913284,0.014903228,0.000054386706,0.91934633],"study_design_scores_gemma":[0.00031479233,0.00021013629,0.00006956945,0.00026466124,0.0000065174245,0.000091105845,2.164516e-7,0.89216006,0.0002047356,0.08634858,0.019370543,0.00095910084],"about_ca_topic_score_codex":0.000014937057,"about_ca_topic_score_gemma":0.00014664236,"teacher_disagreement_score":0.91838723,"about_ca_system_score_codex":0.00039282627,"about_ca_system_score_gemma":0.00068676897,"threshold_uncertainty_score":0.99972016},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044731324,0.00023554628,0.9974904,0.0005513465,0.00044176032,0.00051163806,0.000006404761,0.00007191147,0.00024369705],"genre_scores_gemma":[0.6099883,0.00003763581,0.38968036,0.000101835976,0.000080452664,0.000018868232,0.000027213131,0.000011491979,0.000053884294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790096,0.000023877059,0.00045634835,0.00094060076,0.00044568544,0.00023251532],"domain_scores_gemma":[0.99802357,0.0003762495,0.00046820054,0.0006963161,0.00034787884,0.00008779866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009838843,0.00023073965,0.00028691723,0.0009243532,0.00023117714,0.00022968861,0.0008729019,0.00028957153,0.0000041552616],"category_scores_gemma":[0.000102554746,0.00022772109,0.00007316906,0.00056237367,0.0003930764,0.00028374908,0.00035803937,0.0005170771,0.0000038804264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050087438,0.000025543479,0.00012123989,0.000055911594,0.000004443047,6.117742e-7,0.00032262463,0.00021554879,0.011076537,0.06256616,0.0000011076149,0.92560524],"study_design_scores_gemma":[0.00017371461,0.00006668032,0.0016135629,0.0000508209,0.000006577096,0.000015957672,1.237757e-7,0.902975,0.005955861,0.08686494,0.0020395406,0.00023720565],"about_ca_topic_score_codex":0.000021301177,"about_ca_topic_score_gemma":0.000038832473,"teacher_disagreement_score":0.9253681,"about_ca_system_score_codex":0.00010319312,"about_ca_system_score_gemma":0.00012665056,"threshold_uncertainty_score":0.9286196},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001340729,0.00091227307,0.9960594,0.000500417,0.0004098859,0.0008803093,0.0000042938314,0.000279207,0.0009407938],"genre_scores_gemma":[0.224308,0.00018945844,0.77364796,0.0013369865,0.0003172549,0.000061003826,0.0000096470285,0.000042183303,0.00008751313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955479,0.000035296576,0.0007515544,0.0019214057,0.0010458007,0.0006980402],"domain_scores_gemma":[0.99573,0.0002999091,0.0005242721,0.0027714197,0.00042068967,0.0002537344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009764616,0.00056230364,0.0008795966,0.001612918,0.0001508999,0.00024949963,0.004560226,0.00047341824,0.000014051946],"category_scores_gemma":[0.000033013188,0.0005495111,0.0002863289,0.0037179752,0.00045450692,0.00035138495,0.0016580072,0.00072281493,0.000017348559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033768442,0.000015204191,0.000036074834,0.000010642327,0.000030262841,0.000008525146,0.00016722914,0.4489609,0.000046465062,0.013731103,0.000008431868,0.53698176],"study_design_scores_gemma":[0.0001056231,0.00025465817,0.00025012027,0.0002470784,0.00007031738,0.000011105726,8.350141e-8,0.9236935,0.0016228029,0.0703617,0.0026439936,0.0007390244],"about_ca_topic_score_codex":0.000034627385,"about_ca_topic_score_gemma":0.0003402073,"teacher_disagreement_score":0.5362427,"about_ca_system_score_codex":0.0004931258,"about_ca_system_score_gemma":0.00037520376,"threshold_uncertainty_score":0.99969566},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017740113,0.0005365389,0.97472394,0.0007961144,0.0024313983,0.0003565634,0.0000041456656,0.00025229706,0.020881277],"genre_scores_gemma":[0.0059885583,0.000033045082,0.98898613,0.003290967,0.0004666894,0.000011854775,0.0000040849795,0.000047513102,0.0011711272],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951467,0.00005079043,0.0007187661,0.0018932541,0.001273153,0.00091736065],"domain_scores_gemma":[0.99678427,0.0004337484,0.00036510965,0.0019488273,0.00024213232,0.00022592732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012257496,0.0006684848,0.0006608849,0.0009825235,0.00043754315,0.00081694045,0.0043593543,0.00033826483,0.00004391069],"category_scores_gemma":[0.00011744246,0.00062660204,0.00021262495,0.0009853019,0.0008477373,0.0007273955,0.0016521704,0.0011491738,0.00006646108],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017095996,0.000036702855,0.000019223156,0.00004987416,0.00001402972,0.00011037016,0.0005266658,0.007236174,0.000055373217,0.16750865,0.000090161084,0.8243511],"study_design_scores_gemma":[0.00024295122,0.000119910255,0.000018956256,0.00034141258,0.000006436058,0.00014766812,1.3832225e-7,0.45815822,0.0006486471,0.5308659,0.008564622,0.00088509824],"about_ca_topic_score_codex":0.000012550695,"about_ca_topic_score_gemma":0.000026176263,"teacher_disagreement_score":0.823466,"about_ca_system_score_codex":0.00023463485,"about_ca_system_score_gemma":0.00036097833,"threshold_uncertainty_score":0.99961853},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015879255,0.000029628041,0.9892277,0.00020087465,0.0050751367,0.000901864,0.000111507805,0.00011308905,0.002752265],"genre_scores_gemma":[0.8893933,0.00004764625,0.09328647,0.0030121985,0.0015450293,0.00011133377,0.000027545866,0.00013624663,0.012440213],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963961,0.000029979785,0.0005659359,0.0015438936,0.0006960997,0.000767939],"domain_scores_gemma":[0.9974302,0.00116814,0.00031691542,0.0007693638,0.00016059176,0.00015479415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013558131,0.0005596149,0.00047778766,0.000550446,0.0005141491,0.00033625186,0.0011372258,0.00026437786,0.00006049902],"category_scores_gemma":[0.0004298954,0.00051514583,0.00019694936,0.0002578596,0.000681566,0.00042727243,0.00027213048,0.0006906441,0.00014314038],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028070807,0.0010309723,0.0002968058,0.0004302158,0.0000621006,0.00046697413,0.0016659419,0.052287415,0.58409894,0.0069208597,0.001971678,0.35048738],"study_design_scores_gemma":[0.0013138222,0.00061040866,0.00019680691,0.0007577022,0.00007204681,0.00014943186,8.612205e-7,0.6712051,0.28921828,0.01136142,0.02339588,0.0017182553],"about_ca_topic_score_codex":0.00003712207,"about_ca_topic_score_gemma":0.000115514296,"teacher_disagreement_score":0.89594126,"about_ca_system_score_codex":0.00032378928,"about_ca_system_score_gemma":0.00018248887,"threshold_uncertainty_score":0.99973},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055585955,0.0002271588,0.99113655,0.0005045971,0.0009752622,0.0012605641,0.0000039540905,0.000114307084,0.00021903966],"genre_scores_gemma":[0.97045463,0.00002435525,0.028619306,0.0002894421,0.00024993427,0.000032268515,0.000004528033,0.00002212607,0.0003034336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721193,0.000039593553,0.00043358756,0.0012276382,0.00071709964,0.00037015954],"domain_scores_gemma":[0.99808556,0.00042765317,0.00022208219,0.00088301173,0.00025671712,0.00012497164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066223537,0.00034717846,0.00037985406,0.0005628835,0.00034018562,0.00040854537,0.0013709129,0.00010834338,0.00000410629],"category_scores_gemma":[0.000095092146,0.0003118889,0.000053480915,0.00028885243,0.00027011603,0.0004991373,0.0005406066,0.0003068288,0.000008620299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000757727,0.0011126819,0.0042513357,0.00023091983,0.000088803616,0.00006265743,0.12330493,0.0013756744,0.000422479,0.021225175,0.00032362086,0.84752595],"study_design_scores_gemma":[0.0017394265,0.0043032384,0.0071568205,0.0003555552,0.000023457527,0.00008546863,0.0000057927105,0.947406,0.00020122848,0.03398717,0.003502081,0.0012337702],"about_ca_topic_score_codex":0.000020766658,"about_ca_topic_score_gemma":0.0000737717,"teacher_disagreement_score":0.964896,"about_ca_system_score_codex":0.00014468678,"about_ca_system_score_gemma":0.0001979635,"threshold_uncertainty_score":0.9999333},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000518769,0.0025493249,0.993842,0.0003472408,0.00031074503,0.0002271371,0.0000046264245,0.00028353982,0.002383481],"genre_scores_gemma":[0.17819002,0.0000385875,0.8205118,0.00058244524,0.00014809356,0.000003952223,0.000004456297,0.000021415832,0.0004991983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964651,0.000025717496,0.00061035337,0.0013130968,0.0010510765,0.00053469196],"domain_scores_gemma":[0.9970503,0.00032405395,0.00047441135,0.0016948207,0.00033779017,0.00011863719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082054187,0.0004499295,0.00085344486,0.0026659057,0.00012238033,0.00030464225,0.004411344,0.00033829323,0.00005630162],"category_scores_gemma":[0.00009965963,0.00039170124,0.00025982969,0.0025805573,0.0005863145,0.00062732684,0.0013647393,0.0006750214,0.000015667552],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037436494,0.000034395616,0.000086682245,0.00006120892,0.00010673648,0.000054185475,0.0005191429,0.017962597,0.00060583215,0.032667655,0.00002769155,0.94787014],"study_design_scores_gemma":[0.00013655408,0.00009614633,0.00008035975,0.0004245649,0.0001639225,0.000028740447,5.7452255e-8,0.8065279,0.01059821,0.18059896,0.0005910022,0.0007535478],"about_ca_topic_score_codex":0.000036716716,"about_ca_topic_score_gemma":0.000113704395,"teacher_disagreement_score":0.94711655,"about_ca_system_score_codex":0.00025534758,"about_ca_system_score_gemma":0.00039168156,"threshold_uncertainty_score":0.9998535},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005257789,0.0003972527,0.9930744,0.0035178654,0.0012954866,0.0005679204,0.0003696677,0.00008825826,0.00016333644],"genre_scores_gemma":[0.37257728,0.000117408104,0.621296,0.0038796056,0.0013885034,0.00009066518,0.00029834482,0.000059644804,0.0002925418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995172,0.000036976777,0.00060695974,0.0023985088,0.0010594114,0.0007261053],"domain_scores_gemma":[0.99646175,0.00026162536,0.00024787363,0.0026909232,0.00014906836,0.00018873478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006331567,0.00050565216,0.00053815637,0.00063875556,0.00023872487,0.00052364485,0.004835318,0.0002689298,0.000007778287],"category_scores_gemma":[0.00002355593,0.0004107406,0.00006662215,0.0008870411,0.00028244234,0.0012111681,0.0042669387,0.0006425174,0.00003305156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000181804,0.00012026092,0.00059870223,0.000027261212,0.000010167635,0.00013436818,0.00014465077,0.51257,0.0011182193,0.00548979,0.0009870603,0.4787813],"study_design_scores_gemma":[0.00055190176,0.00009689729,0.01719714,0.0007679731,0.000013302315,0.00012595262,9.316547e-8,0.92872286,0.00045936325,0.047811795,0.0029015276,0.0013511784],"about_ca_topic_score_codex":0.0008152589,"about_ca_topic_score_gemma":0.00064814725,"teacher_disagreement_score":0.47743014,"about_ca_system_score_codex":0.00042974082,"about_ca_system_score_gemma":0.00056713354,"threshold_uncertainty_score":0.9998344},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044512487,0.00021409706,0.9953952,0.00075712183,0.0007867143,0.00030342097,0.000009534383,0.00008546872,0.0020033184],"genre_scores_gemma":[0.10090683,0.00015492814,0.8953217,0.0028879354,0.00016250633,0.000009214695,0.000017566214,0.000038486472,0.0005008028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971822,0.000032879252,0.00040241246,0.0012461011,0.00068370614,0.00045268444],"domain_scores_gemma":[0.99848235,0.00011376853,0.00024202932,0.00081918854,0.0001641708,0.00017849641],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005158202,0.0003945399,0.00034922326,0.00052041747,0.0002504779,0.00047393402,0.0011993711,0.00027910597,0.000031392083],"category_scores_gemma":[0.00003739897,0.0003551014,0.000070853646,0.00029336818,0.00029111662,0.0007178615,0.0006645515,0.0004986625,0.000018089038],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008657361,0.000038349277,0.00008067579,0.000053667147,0.0000092927285,0.000033695516,0.000464284,0.006891177,0.0029328512,0.004563506,0.00013441224,0.98478943],"study_design_scores_gemma":[0.00018994953,0.000053018593,0.00008409722,0.00016880385,0.000008334883,0.000067116605,1.3192204e-7,0.9652345,0.0012430224,0.032163166,0.00036429093,0.00042354362],"about_ca_topic_score_codex":0.000011308945,"about_ca_topic_score_gemma":0.000013892905,"teacher_disagreement_score":0.9843659,"about_ca_system_score_codex":0.00021249508,"about_ca_system_score_gemma":0.0003289737,"threshold_uncertainty_score":0.9998901},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067874845,0.0005722173,0.9836787,0.00022275998,0.0034013358,0.00066113716,0.000019325818,0.00005783027,0.0045991926],"genre_scores_gemma":[0.9514948,0.000015521045,0.04113309,0.00089115207,0.0035296082,0.000010451058,0.00003294722,0.00005399102,0.0028384419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986381,0.0000067661,0.0003227171,0.00049562455,0.00025431992,0.00028245136],"domain_scores_gemma":[0.9993296,0.00011889613,0.000174312,0.00023023445,0.000110228335,0.0000367187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040925381,0.00019438135,0.00022000578,0.00041303886,0.00020996561,0.00040022048,0.00032035852,0.000090270245,0.00008839047],"category_scores_gemma":[0.000056630655,0.00018190927,0.00006189215,0.000051475272,0.00029272542,0.00026548826,0.000070430884,0.00024227236,0.000012819786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074746677,0.000017421435,0.000021893382,0.00006621087,0.0000038363646,0.000010528016,0.007756925,0.009024754,0.0008968292,0.022841359,0.000011367148,0.9593414],"study_design_scores_gemma":[0.0009894822,0.00029253215,0.0004189851,0.0018994882,0.00006138639,0.000026694775,0.000028460012,0.65505785,0.0028698607,0.30798775,0.02851809,0.001849401],"about_ca_topic_score_codex":0.00012468248,"about_ca_topic_score_gemma":0.0014081342,"teacher_disagreement_score":0.957492,"about_ca_system_score_codex":0.00018805085,"about_ca_system_score_gemma":0.00012054587,"threshold_uncertainty_score":0.7418045},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005102948,0.00034911162,0.9931329,0.001031577,0.001392746,0.001415295,0.000025314159,0.0005607637,0.0015820249],"genre_scores_gemma":[0.18468839,0.00007172155,0.8134424,0.0010158826,0.0001923492,0.00007000731,0.000006534449,0.000055335568,0.00045735057],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99397457,0.00003204919,0.00075700204,0.0027712567,0.0012849906,0.0011801207],"domain_scores_gemma":[0.9962903,0.00020611237,0.0003519379,0.0028429509,0.00011946714,0.00018919211],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00058486004,0.0008388282,0.00069935963,0.0020444235,0.00021265086,0.000643161,0.006336641,0.00038162756,0.000026018724],"category_scores_gemma":[0.000118308155,0.00079260534,0.00009404733,0.0013672366,0.00046738278,0.0013411407,0.0060358993,0.0012769931,0.000051527426],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050311464,0.000026203374,0.000025723579,0.000086344255,0.000014600554,0.000662338,0.0008024044,0.050148144,0.00045884654,0.033619817,0.000041968236,0.9141086],"study_design_scores_gemma":[0.0011309022,0.00059765024,0.00014179849,0.0014999913,0.000020030246,0.00012200812,0.0000065333943,0.42287487,0.008124463,0.55297464,0.009362047,0.0031450938],"about_ca_topic_score_codex":0.000015820598,"about_ca_topic_score_gemma":0.000103942635,"teacher_disagreement_score":0.9109635,"about_ca_system_score_codex":0.0013032303,"about_ca_system_score_gemma":0.00015905702,"threshold_uncertainty_score":0.9994525},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000026261614,0.00016437794,0.9945496,0.0002715854,0.0012292545,0.0005828341,0.00001522997,0.00050940964,0.0026750993],"genre_scores_gemma":[0.0024687361,0.000012921147,0.9939706,0.001352786,0.00062752626,0.00003667158,0.0000063498633,0.0000434754,0.0014809876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968228,0.000017855144,0.0004913067,0.0013582474,0.0006455536,0.00066423847],"domain_scores_gemma":[0.9980502,0.00029464302,0.0002675373,0.0010314683,0.00025569968,0.00010044309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072964607,0.00049012457,0.00046625634,0.0009454627,0.00037922699,0.0007656925,0.0024627172,0.0003159931,0.0000071708037],"category_scores_gemma":[0.00002024612,0.0004630584,0.0001984274,0.0004495991,0.00030600614,0.000716536,0.00077288155,0.0006007059,0.000021434114],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012653427,0.000010915869,3.8824805e-7,0.000019443301,0.0000045809793,0.000037263395,0.00013540295,0.0016731538,0.00016066663,0.0010075339,0.00020347642,0.9967459],"study_design_scores_gemma":[0.00031080158,0.00028772012,0.000013579385,0.0003250927,0.000009117733,0.000174099,9.97537e-8,0.54143536,0.042907175,0.40416342,0.009396912,0.0009766179],"about_ca_topic_score_codex":0.00011638022,"about_ca_topic_score_gemma":0.00005559262,"teacher_disagreement_score":0.99576926,"about_ca_system_score_codex":0.00028539717,"about_ca_system_score_gemma":0.00029480393,"threshold_uncertainty_score":0.9997821},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022010887,0.00029491354,0.9903998,0.0022446052,0.00039588058,0.00037568828,0.000003143547,0.00022007203,0.006043919],"genre_scores_gemma":[0.015825946,0.00008606352,0.9805581,0.002075656,0.00032813344,0.000008845063,0.0000089563155,0.00003586308,0.0010724532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621266,0.000033996483,0.00040969305,0.0014380779,0.0011676236,0.00073794136],"domain_scores_gemma":[0.9976753,0.00027170073,0.00020209374,0.0012731322,0.0003399608,0.00023783726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008305004,0.00047074805,0.00041429387,0.00075188297,0.0002961202,0.00087957433,0.0030801638,0.00021406714,0.00006597284],"category_scores_gemma":[0.000051488896,0.0003772475,0.00006743329,0.0007429012,0.0006354821,0.00096807384,0.0009798304,0.00081981655,0.00007779706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047491076,0.000020221558,0.000036890913,0.000020084815,0.000008985844,0.000052778665,0.00045311518,0.65120316,0.000026009964,0.025676249,0.000014487264,0.32248327],"study_design_scores_gemma":[0.0003012507,0.00019769055,0.000014027226,0.0003413275,0.0000037830644,0.000050554838,1.9480426e-7,0.9664493,0.0003865555,0.026997842,0.0046696262,0.0005878458],"about_ca_topic_score_codex":0.00001648436,"about_ca_topic_score_gemma":0.0001013564,"teacher_disagreement_score":0.32189542,"about_ca_system_score_codex":0.00024793347,"about_ca_system_score_gemma":0.00088172307,"threshold_uncertainty_score":0.9998679},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012214876,0.00013817982,0.9972134,0.000034374367,0.0004067635,0.0007643828,0.00009084229,0.00030937855,0.0009205005],"genre_scores_gemma":[0.60996294,0.000029545143,0.3889627,0.00040573342,0.00034236044,0.00006673944,0.00011535375,0.0000834951,0.000031164174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846905,0.0000065843037,0.00029258485,0.00047993445,0.00038358127,0.00036824564],"domain_scores_gemma":[0.9992951,0.00007906932,0.00006768756,0.0003886827,0.00009055567,0.00007885998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035330316,0.00031885935,0.00026559297,0.0003602512,0.00009840426,0.00015361232,0.00047812148,0.00017533705,0.0000843608],"category_scores_gemma":[0.00000362764,0.00031043254,0.00006937197,0.000107574015,0.00010276007,0.00015318542,0.000035715726,0.00023884368,0.0000033316062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021589718,0.00001972107,0.000019229576,0.0002219748,0.000009534717,0.000011136523,0.00043065372,0.65466857,0.004044557,0.0010843583,0.00020005192,0.33926862],"study_design_scores_gemma":[0.0019439943,0.0016410765,0.0000150159585,0.0004200781,0.000035171513,0.0000059874305,0.0000011777242,0.57571405,0.3233959,0.09064846,0.004902711,0.0012763783],"about_ca_topic_score_codex":0.000008670717,"about_ca_topic_score_gemma":0.000109151304,"teacher_disagreement_score":0.6098408,"about_ca_system_score_codex":0.0005118738,"about_ca_system_score_gemma":0.00022924169,"threshold_uncertainty_score":0.9999348},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010398393,0.00019394196,0.9870434,0.000098325065,0.0008891765,0.00037821356,0.0000010549151,0.00028891553,0.011003019],"genre_scores_gemma":[0.026970841,0.000026386995,0.9715217,0.00095394155,0.0002104159,0.000008289958,0.000003324047,0.00003676431,0.0002683612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957694,0.000041100615,0.0005358698,0.0015903771,0.001273483,0.00078980747],"domain_scores_gemma":[0.9972903,0.00015905978,0.00045535242,0.0015667969,0.0003604943,0.0001679548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024507304,0.00053885183,0.00045392915,0.0009547302,0.00038348782,0.00083174417,0.00294821,0.00039408958,0.0000052991845],"category_scores_gemma":[0.00014212061,0.0004659335,0.000087320725,0.0008468092,0.00073989807,0.001486518,0.0007691344,0.0010134828,0.000020668693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015043892,0.000019767087,0.00002854628,0.000041962718,0.000007709474,0.0000462396,0.0009843446,0.17853492,0.00024262397,0.3680034,0.0000026727062,0.45207277],"study_design_scores_gemma":[0.00014338197,0.00012048898,0.000050662064,0.00040480783,0.0000060193674,0.000101026475,1.5170257e-7,0.77505475,0.0012927362,0.22225152,0.00009973751,0.00047469014],"about_ca_topic_score_codex":0.000016534646,"about_ca_topic_score_gemma":0.000050224407,"teacher_disagreement_score":0.5965199,"about_ca_system_score_codex":0.00068814424,"about_ca_system_score_gemma":0.00057934795,"threshold_uncertainty_score":0.9997792},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014197333,0.00035689777,0.9906696,0.00042006795,0.0016074469,0.00028317526,0.0000011771431,0.0000841503,0.005157732],"genre_scores_gemma":[0.4159228,0.00011884595,0.58008856,0.002287202,0.0006143823,0.000016246891,0.000009106701,0.000031894015,0.000910948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592304,0.000031940534,0.0011089628,0.0014666189,0.0009695662,0.0004998625],"domain_scores_gemma":[0.9973133,0.00055004755,0.00091335655,0.0009379228,0.00018464707,0.00010069185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012370694,0.0003919971,0.00047321615,0.0012169138,0.00021388545,0.0002266553,0.0015348784,0.00022397109,0.000010740824],"category_scores_gemma":[0.00049990276,0.00038349928,0.00010233501,0.0010175924,0.0002559752,0.00047851223,0.0005587435,0.00072138465,0.000045743687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056891276,0.000029652289,0.000047797632,0.000012782718,0.0000023513714,0.00036225398,0.0004179834,0.37785006,0.000051522675,0.013251305,0.000052230826,0.60791636],"study_design_scores_gemma":[0.00037615435,0.00020575251,0.0012313805,0.0005291403,0.0000020184627,0.00028808846,4.7144827e-8,0.879211,0.0012202335,0.11387389,0.0023503446,0.0007119499],"about_ca_topic_score_codex":0.000015056218,"about_ca_topic_score_gemma":0.000057568705,"teacher_disagreement_score":0.60720444,"about_ca_system_score_codex":0.00034521607,"about_ca_system_score_gemma":0.00063627015,"threshold_uncertainty_score":0.9998617},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067471847,0.0005438264,0.9954675,0.00037228173,0.0020130095,0.00032040972,0.00000212671,0.00015027098,0.00045587678],"genre_scores_gemma":[0.59100014,0.00008603402,0.40782213,0.00060777925,0.00041171693,0.0000054022235,0.0000025787476,0.000020584368,0.00004360427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961747,0.000065089815,0.00063892885,0.0015620164,0.00092265627,0.0006366004],"domain_scores_gemma":[0.9982927,0.00021469618,0.0003943656,0.0007554916,0.0002114901,0.0001312946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008694678,0.0004814137,0.00044852434,0.0014336245,0.00030001582,0.000532135,0.0017327545,0.00024304254,0.00001848055],"category_scores_gemma":[0.000114242954,0.00046127528,0.00009890732,0.0011232366,0.00052678585,0.0022912745,0.0005835996,0.0008714645,0.00002478103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023328244,0.000014573098,0.00010462612,0.000012844577,0.0000015611242,0.000019728635,0.00031804264,0.11610008,0.0008482747,0.0006721528,5.968931e-7,0.8819052],"study_design_scores_gemma":[0.00019505293,0.00006490181,0.00032036344,0.0004487536,0.0000034749767,0.00008026292,6.2446435e-7,0.95502675,0.0038951552,0.039144512,0.00031686857,0.0005032598],"about_ca_topic_score_codex":0.000099065255,"about_ca_topic_score_gemma":0.00031891468,"teacher_disagreement_score":0.88140196,"about_ca_system_score_codex":0.0007112273,"about_ca_system_score_gemma":0.0002857739,"threshold_uncertainty_score":0.9997839},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014375451,0.00061056204,0.98239774,0.00031923436,0.0011766689,0.0007921117,0.0000012028788,0.00008651802,0.00024053206],"genre_scores_gemma":[0.8897732,0.00034272054,0.10903544,0.000032550848,0.0006117134,0.000057846384,0.000009838363,0.000038598628,0.00009811797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652994,0.00016350254,0.000511877,0.0008630479,0.0015493457,0.0003822715],"domain_scores_gemma":[0.99693066,0.0015759472,0.00019295725,0.00077972305,0.00046597293,0.00005475222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048730858,0.00024873656,0.00032437424,0.00077778543,0.00016212763,0.00036876608,0.0011212326,0.00014589225,0.0000039877004],"category_scores_gemma":[0.0005528482,0.00020568012,0.00003153137,0.0009050445,0.0003455873,0.0004101233,0.0003382185,0.00038899377,0.000007372386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012507188,0.000011320569,0.00021006461,0.00006636701,0.000012003142,0.000006478358,0.0019391559,0.35964367,0.0004467723,0.0090214005,0.000014652403,0.6286156],"study_design_scores_gemma":[0.0002684504,0.00006216985,0.0033471184,0.0003294159,0.0000056707495,0.000036962272,7.525754e-7,0.97825795,0.00051729084,0.016834898,0.00009285456,0.00024647193],"about_ca_topic_score_codex":0.00008327468,"about_ca_topic_score_gemma":0.000044747252,"teacher_disagreement_score":0.87539774,"about_ca_system_score_codex":0.0006245527,"about_ca_system_score_gemma":0.0007529214,"threshold_uncertainty_score":0.83873916},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007040058,0.00093321176,0.9854422,0.0014923713,0.0025998966,0.00050390296,0.0000029470589,0.00023645132,0.008781941],"genre_scores_gemma":[0.55613494,0.000031087926,0.4382706,0.0038323943,0.0013677266,0.000018052793,0.000013221716,0.000049239825,0.00028273673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956981,0.00007307381,0.00069489476,0.001680826,0.0009650959,0.0008880127],"domain_scores_gemma":[0.99742216,0.0003565006,0.0003284307,0.0014107496,0.00022286392,0.0002592781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006584458,0.00063072564,0.0006277227,0.0005737616,0.00027499098,0.00076608406,0.0035518685,0.0005150641,0.000019716857],"category_scores_gemma":[0.000045909575,0.0005686342,0.00020227298,0.0005252259,0.000532107,0.00044311257,0.0007542635,0.0007967507,0.000025847141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007032316,0.000012915056,0.000007159126,0.000006203298,0.0000044550384,0.000030197047,0.000027693048,0.72090775,0.000007655379,0.0017929194,0.000012388195,0.27718365],"study_design_scores_gemma":[0.00045195877,0.00017215889,0.000051198014,0.000095257295,0.00000919764,0.00003857626,3.0203264e-8,0.99191356,0.0000057965135,0.006412126,0.00023959967,0.0006105365],"about_ca_topic_score_codex":0.000015668213,"about_ca_topic_score_gemma":0.000055555152,"teacher_disagreement_score":0.5561279,"about_ca_system_score_codex":0.00039996757,"about_ca_system_score_gemma":0.00048698642,"threshold_uncertainty_score":0.9996765},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028795355,0.0009855054,0.9946746,0.000341821,0.00028704142,0.00029780145,0.0000010630171,0.00008499912,0.0004476276],"genre_scores_gemma":[0.92093706,0.00018740512,0.07861587,0.00016186362,0.00003585008,0.0000035869223,3.321717e-7,0.000010352744,0.000047650155],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99831766,0.00004158358,0.0004355227,0.00048029295,0.0005393871,0.00018556576],"domain_scores_gemma":[0.99855787,0.00011655163,0.00031900464,0.00064800755,0.00032477264,0.000033773827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079007325,0.00020085102,0.00029804205,0.00037906689,0.00016493165,0.00007632689,0.0010216417,0.0001592214,0.0000014957816],"category_scores_gemma":[0.0001117685,0.00013767376,0.00006595569,0.0003616604,0.00085857545,0.00038287663,0.0005711748,0.00043460744,9.879966e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009264942,0.000023843628,0.000036857902,0.00012162621,0.00001587092,0.000014376937,0.004659914,0.0015000657,0.006583378,0.00080235925,0.000012298373,0.9862201],"study_design_scores_gemma":[0.00012736245,0.0001987103,0.00038081149,0.0006356884,0.0000069966045,0.00016559422,3.9917762e-7,0.15227343,0.81896776,0.026870191,0.00008834372,0.00028473738],"about_ca_topic_score_codex":0.00009138127,"about_ca_topic_score_gemma":0.00002649885,"teacher_disagreement_score":0.9859354,"about_ca_system_score_codex":0.00006245346,"about_ca_system_score_gemma":0.00020274636,"threshold_uncertainty_score":0.56141734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003098108,0.0021879482,0.9916962,0.00089068303,0.0010392795,0.0008663318,0.00012002466,0.0003737005,0.0025160245],"genre_scores_gemma":[0.8728709,0.000066855224,0.12049913,0.005681366,0.0006574757,0.00009585528,0.00005194369,0.000060085727,0.000016342345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953391,0.00006304288,0.00063173176,0.0019398021,0.0010779919,0.000948323],"domain_scores_gemma":[0.99581933,0.0007828501,0.00045240382,0.0023274187,0.00027447363,0.00034349645],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005428377,0.00074532593,0.0006911202,0.00084195443,0.0003881039,0.0009853439,0.007194221,0.00043667227,0.00003525985],"category_scores_gemma":[0.0000074781406,0.00070038013,0.00021212877,0.0008519603,0.00030536592,0.0016629505,0.0016261262,0.0010889055,0.00005569706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002529756,0.00010597519,0.00016373015,0.00010153137,0.00005126411,0.000020670024,0.001607609,0.35942003,0.00066155544,0.013967412,0.0000031803006,0.62387174],"study_design_scores_gemma":[0.0003803119,0.0000331095,0.00004581713,0.00018494972,0.000020605265,0.000007045445,2.4112433e-7,0.71498525,0.00037879494,0.28141028,0.0019838414,0.0005697452],"about_ca_topic_score_codex":0.00023612201,"about_ca_topic_score_gemma":0.0017283144,"teacher_disagreement_score":0.87256116,"about_ca_system_score_codex":0.00031331318,"about_ca_system_score_gemma":0.0006702643,"threshold_uncertainty_score":0.99954474},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045954375,0.0011789766,0.99656105,0.000090294074,0.00011691973,0.00015322985,0.000011365972,0.0000052156192,0.0014233863],"genre_scores_gemma":[0.031317957,0.00010817008,0.96682423,0.0003982654,0.00029919558,0.0000018047419,0.000038299913,0.000030094378,0.0009819627],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988381,0.000010036111,0.00023058346,0.0004953433,0.00020686068,0.00021903693],"domain_scores_gemma":[0.99946076,0.00003301971,0.00010760588,0.00026127967,0.000059090627,0.00007823847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031660259,0.0001841954,0.00019404895,0.0001484399,0.000044390905,0.000027601905,0.0002775825,0.00019533306,0.00001504498],"category_scores_gemma":[0.00001127529,0.00017645914,0.00005572062,0.000082417886,0.00017844053,0.000004289495,0.0001313029,0.00015647711,9.94484e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009438409,0.000009386873,0.00007125949,0.00003477374,0.000022877603,0.0000039390193,0.0002129075,0.000730905,0.19060996,0.00011621937,0.000029466637,0.80814886],"study_design_scores_gemma":[0.0022164462,0.0017002195,0.00058017,0.0007720364,0.00016559257,0.00025617515,0.0000025211843,0.018635035,0.916168,0.03222631,0.025030648,0.0022468616],"about_ca_topic_score_codex":0.000015071176,"about_ca_topic_score_gemma":0.000037044698,"teacher_disagreement_score":0.805902,"about_ca_system_score_codex":0.000015629179,"about_ca_system_score_gemma":0.00009715653,"threshold_uncertainty_score":0.7195795},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015189516,0.00024865154,0.9918898,0.00013794318,0.0023878284,0.00068113505,0.0000014308627,0.0004668168,0.0040345285],"genre_scores_gemma":[0.3289413,0.000057143825,0.6680518,0.0010872749,0.0015596311,0.00003296688,0.000003845995,0.000045586465,0.00022048684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670774,0.000022343895,0.00056416605,0.0013537108,0.00068006257,0.00067198306],"domain_scores_gemma":[0.99786913,0.0003793902,0.0003243563,0.00097144075,0.00031282767,0.00014285478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014604046,0.00045500675,0.00048450587,0.0011387371,0.00047198634,0.0005167446,0.0020419676,0.0004742179,0.000007883145],"category_scores_gemma":[0.00006358649,0.00045234998,0.00018045341,0.00067419175,0.00037765337,0.0007380949,0.00078781607,0.0008023888,0.000017177492],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015425083,0.000015768117,0.000013398835,0.000031244133,0.000005924471,0.000010759039,0.00015467731,0.0018207058,0.00043624436,0.011665121,0.000010655036,0.98582006],"study_design_scores_gemma":[0.00022782797,0.0004869183,0.000064479784,0.00033180157,0.000009188695,0.00009776616,8.625469e-8,0.7996078,0.04122022,0.13534802,0.021861443,0.00074440974],"about_ca_topic_score_codex":0.000039459945,"about_ca_topic_score_gemma":0.0005142382,"teacher_disagreement_score":0.98507565,"about_ca_system_score_codex":0.0004041016,"about_ca_system_score_gemma":0.00017317994,"threshold_uncertainty_score":0.9997928},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000058226187,0.00017697869,0.9922434,0.0009600389,0.00044715387,0.0012572341,0.00002864141,0.0010306741,0.0038500596],"genre_scores_gemma":[0.016649192,0.00005276588,0.9794108,0.0031640546,0.00028195503,0.00016843596,0.000029159337,0.00005315495,0.00019044103],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622047,0.000042084015,0.00068154634,0.0016308541,0.00076653884,0.0006585295],"domain_scores_gemma":[0.9972777,0.0005643402,0.00032526976,0.0012617998,0.00040883778,0.00016204616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009236267,0.00060235464,0.0005878924,0.001344975,0.00023910239,0.0005076283,0.0031320641,0.0004808388,0.000051258467],"category_scores_gemma":[0.000086838445,0.0005851834,0.0002484205,0.0004779561,0.0005529169,0.0007319827,0.00039180394,0.00060908747,0.000042094573],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002063538,0.000029603552,0.000002993011,0.00004269789,0.0000058493733,0.0000164193,0.00010337298,0.00089734833,0.00014293854,0.004311169,0.000062053914,0.9943649],"study_design_scores_gemma":[0.00026790117,0.0003421128,0.000008775535,0.00077637966,0.000009443458,0.000029008326,3.2680184e-8,0.45830047,0.030282324,0.50493455,0.004325356,0.0007236241],"about_ca_topic_score_codex":0.0000112447,"about_ca_topic_score_gemma":0.000022925287,"teacher_disagreement_score":0.9936413,"about_ca_system_score_codex":0.00034806214,"about_ca_system_score_gemma":0.0006067645,"threshold_uncertainty_score":0.99965996},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003512449,0.0023948296,0.9890173,0.00013928492,0.0028917077,0.00089574524,0.000019748946,0.00025607567,0.004350188],"genre_scores_gemma":[0.8719685,0.00004948781,0.1267141,0.0003230773,0.00051635865,0.000035401197,0.0000033348701,0.0000627811,0.0003269613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941108,0.000100791636,0.001349168,0.0019023084,0.0016333624,0.0009035421],"domain_scores_gemma":[0.99539435,0.00046816797,0.0009748906,0.002517208,0.0003992964,0.000246108],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020800896,0.0007329649,0.0012194694,0.0011995445,0.00018886395,0.0002741801,0.0060007,0.0004548053,0.000006172084],"category_scores_gemma":[0.00006136039,0.00063257,0.00029622947,0.00063991407,0.00068957417,0.0009357807,0.0017212706,0.0007905409,0.000034222594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003561315,0.00011074156,0.00017295117,0.0016576896,0.00013262732,0.0003033875,0.0032193777,0.2830632,0.0007072203,0.37310106,0.00005316959,0.33744296],"study_design_scores_gemma":[0.0006689435,0.00029984245,0.000026129801,0.0044159694,0.000026059073,0.00016631326,3.5355632e-7,0.9130187,0.0007781103,0.07912534,0.0005219176,0.00095229706],"about_ca_topic_score_codex":0.000075634256,"about_ca_topic_score_gemma":0.00002727436,"teacher_disagreement_score":0.8719334,"about_ca_system_score_codex":0.00057528587,"about_ca_system_score_gemma":0.0007629402,"threshold_uncertainty_score":0.99961257},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010820504,0.00030740674,0.98991424,0.0012994476,0.0026116988,0.00040157992,0.000008721707,0.00023487947,0.0052111987],"genre_scores_gemma":[0.018242184,0.00003842132,0.9662402,0.012834855,0.0005671479,0.000026505675,0.00009182614,0.0000675309,0.0018913073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584645,0.000035518442,0.00049276144,0.001762737,0.0011691761,0.0006933615],"domain_scores_gemma":[0.9968746,0.00021277287,0.00030714172,0.002078163,0.00034789863,0.00017943005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077175576,0.00056084944,0.00042935557,0.0009366279,0.0002946892,0.00094032625,0.004629193,0.00022235732,0.00003651641],"category_scores_gemma":[0.000032466847,0.00052536395,0.00010170676,0.0012934624,0.0004147557,0.0011591119,0.0010823928,0.00051269185,0.00013248068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006047904,0.000108966786,0.00016809537,0.00026978654,0.000030045005,0.00016776018,0.0004231792,0.08416572,0.000037736096,0.09975048,0.00022215077,0.81465006],"study_design_scores_gemma":[0.00040309218,0.000111085086,0.00009344994,0.0004195416,0.000012530943,0.000011967202,2.2675906e-7,0.92226136,0.0006822037,0.042897657,0.032243855,0.0008630056],"about_ca_topic_score_codex":0.000034723744,"about_ca_topic_score_gemma":0.00006485631,"teacher_disagreement_score":0.83809566,"about_ca_system_score_codex":0.00020303339,"about_ca_system_score_gemma":0.00036112656,"threshold_uncertainty_score":0.9997198},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006313622,0.0010396477,0.99087656,0.0003480453,0.0016183225,0.0010674484,0.0000026857654,0.0004446487,0.0045395107],"genre_scores_gemma":[0.33793065,0.000049148483,0.6598773,0.0014522027,0.0002587131,0.00006362128,0.000002173005,0.00008108868,0.00028507947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99356914,0.00018206515,0.0012841894,0.0024132456,0.0014681225,0.0010832392],"domain_scores_gemma":[0.9960856,0.00041244668,0.00035492974,0.002605112,0.0003196937,0.00022223465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030632522,0.0008373828,0.0010797987,0.0021638963,0.00018068809,0.00077956356,0.00491234,0.0006563814,0.000008322616],"category_scores_gemma":[0.00017205164,0.0008023233,0.00019490786,0.0011795295,0.00035991674,0.00092929445,0.0012156938,0.0014474005,0.00005351334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009381777,0.00012107496,0.00008830439,0.0006280069,0.000031152515,0.0011449157,0.0034163853,0.6780961,0.00088110345,0.09863591,0.000115498886,0.21683213],"study_design_scores_gemma":[0.00016896371,0.00011557484,0.0000019872998,0.001691727,0.0000046176765,0.00023786564,3.3532325e-7,0.8604226,0.001482083,0.13493417,0.0001435624,0.0007965126],"about_ca_topic_score_codex":0.00012457963,"about_ca_topic_score_gemma":0.00015182844,"teacher_disagreement_score":0.33786753,"about_ca_system_score_codex":0.0010345757,"about_ca_system_score_gemma":0.00060056604,"threshold_uncertainty_score":0.99944276},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012691704,0.00040623435,0.9834636,0.00014626284,0.0002867316,0.00076339906,0.00035600777,0.00004007898,0.00184599],"genre_scores_gemma":[0.45055953,0.000016651746,0.54552346,0.00096270005,0.0008264689,0.000014420255,0.0014886939,0.000049509283,0.0005585557],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979292,0.00004080034,0.00041819605,0.00076641655,0.0005447901,0.00030056597],"domain_scores_gemma":[0.99862194,0.000031898235,0.00043600876,0.00058911793,0.00023930539,0.00008175698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027779708,0.00040668304,0.0003917378,0.00023005024,0.0001036275,0.00006383024,0.0006413812,0.0006870988,0.000034082794],"category_scores_gemma":[0.000076483695,0.00036606504,0.0001081334,0.00016617491,0.00044721915,0.000022298027,0.0002547196,0.0009492933,0.0000013007693],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017131671,0.00006628522,0.00077230803,0.00041738217,0.00007856189,0.000004674757,0.00025321616,0.12773569,0.6681151,0.00010774761,0.00017312149,0.2021046],"study_design_scores_gemma":[0.0019810956,0.0013052967,0.0031588178,0.000893404,0.00007661898,0.00013204152,0.0000011080266,0.6636983,0.3147973,0.0024068633,0.010235195,0.0013139122],"about_ca_topic_score_codex":0.000029977491,"about_ca_topic_score_gemma":0.000050927392,"teacher_disagreement_score":0.53596264,"about_ca_system_score_codex":0.00015652619,"about_ca_system_score_gemma":0.0006386416,"threshold_uncertainty_score":0.9998791},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042596253,0.00020243162,0.9930749,0.0024890292,0.0010963959,0.0009718792,0.000010445363,0.00037645077,0.0017358616],"genre_scores_gemma":[0.4624297,0.000019466897,0.5337019,0.0033179468,0.00020577229,0.0001428222,0.000024482006,0.000034504734,0.0001234111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964288,0.00019732826,0.0007503152,0.00102811,0.00081345876,0.0007820246],"domain_scores_gemma":[0.99564874,0.0007009447,0.00037930673,0.0026601618,0.00027037464,0.0003404847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025684012,0.0005711745,0.00084957184,0.0024565752,0.0006988303,0.0007205966,0.0041640694,0.000291072,0.00005182073],"category_scores_gemma":[0.000052810272,0.0005260335,0.0003125174,0.0021747148,0.00019327793,0.0005483871,0.001768034,0.0012113489,0.00005752657],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002328918,0.000098640645,0.0007222455,0.00005242747,0.00012484027,0.000012240752,0.0010925469,0.016824953,0.000077389705,0.006896632,0.00019554395,0.9739002],"study_design_scores_gemma":[0.00041700128,0.0004230907,0.0017142819,0.0009922168,0.0002706205,0.000045817356,0.0000015081398,0.90204155,0.0025816362,0.055671785,0.033263657,0.002576819],"about_ca_topic_score_codex":0.0003966791,"about_ca_topic_score_gemma":0.0006529873,"teacher_disagreement_score":0.9713234,"about_ca_system_score_codex":0.00045978927,"about_ca_system_score_gemma":0.00024830148,"threshold_uncertainty_score":0.99971914},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072075403,0.000092909235,0.99683535,0.00069096027,0.00016756245,0.00040669058,0.0000030745612,0.000017809552,0.001064918],"genre_scores_gemma":[0.9012318,0.000085866755,0.097108364,0.0012876237,0.000076154494,0.000016944057,0.0000028871004,0.000013453419,0.00017687208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975891,0.00003361361,0.00043529805,0.0007166746,0.0008681357,0.00035717498],"domain_scores_gemma":[0.998248,0.000342491,0.00018639474,0.0010944969,0.000036735106,0.000091897724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064778875,0.0002516935,0.00027719018,0.0005026871,0.00012780687,0.00012320728,0.0025123437,0.0001283844,0.0000029217563],"category_scores_gemma":[0.00008739875,0.00020136843,0.00006087811,0.00061019167,0.00029344024,0.0003755215,0.0005589788,0.00035822976,0.000020788311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047333,0.000043239987,0.00000971555,0.000009101806,0.00000418563,0.000015388454,0.009240601,0.22658859,0.00067055423,0.024181936,0.000016587186,0.7392154],"study_design_scores_gemma":[0.0003589019,0.0006962051,0.0018996635,0.00036412562,0.0000062909985,0.00008463857,0.0000055802766,0.9469916,0.0015604246,0.04255001,0.0048177885,0.0006647324],"about_ca_topic_score_codex":0.00006493529,"about_ca_topic_score_gemma":0.00010180147,"teacher_disagreement_score":0.9005111,"about_ca_system_score_codex":0.00019480182,"about_ca_system_score_gemma":0.00020070658,"threshold_uncertainty_score":0.8211566},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004876201,0.0049058613,0.97126865,0.00016883378,0.00076892856,0.0005582384,0.000032860655,0.00001957653,0.01740085],"genre_scores_gemma":[0.72869426,0.0011124181,0.25483766,0.00089780515,0.0029138348,0.000031261505,0.00034852294,0.0001903131,0.0109739145],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99816096,0.000011896219,0.00032881252,0.0007307311,0.00043720152,0.00033039722],"domain_scores_gemma":[0.9988967,0.000018255152,0.00018570312,0.0006926207,0.00014867647,0.00005800091],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031618576,0.00029383448,0.00029479375,0.00026426133,0.000052286567,0.00003528884,0.0007150625,0.00023474946,0.00003547362],"category_scores_gemma":[0.000014492456,0.0002790875,0.00011404328,0.00012002108,0.00044071933,0.0000040544965,0.00045279454,0.0001726184,0.000011664354],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040130042,0.000114289636,0.0011141828,0.00021499977,0.000112292175,0.000042699372,0.00021215284,0.036563363,0.24398233,0.00043867482,0.0007162199,0.71644866],"study_design_scores_gemma":[0.0038932886,0.0038590035,0.005320653,0.0011300346,0.0002185009,0.00014328067,0.0000017808366,0.02232333,0.53918487,0.047881965,0.37066892,0.0053744186],"about_ca_topic_score_codex":0.00001891621,"about_ca_topic_score_gemma":0.000051108986,"teacher_disagreement_score":0.72381806,"about_ca_system_score_codex":0.00006016685,"about_ca_system_score_gemma":0.00017095011,"threshold_uncertainty_score":0.99996614},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004974402,0.00021108455,0.9925944,0.0003970534,0.00025462479,0.00065995223,0.0000041738167,0.000024465273,0.00535679],"genre_scores_gemma":[0.5639899,0.0002187296,0.4291313,0.0027800463,0.0016111354,0.00015745008,0.000115557385,0.00006574023,0.0019301728],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821275,0.00003543396,0.0002208869,0.0009206585,0.0003308836,0.00027938085],"domain_scores_gemma":[0.998916,0.000009383966,0.00011676367,0.00065660645,0.00018963974,0.00011162402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002616753,0.00025394396,0.00015235801,0.00018766908,0.0002794634,0.00006843716,0.000831296,0.00025917447,0.0000053575277],"category_scores_gemma":[0.000015839356,0.00019232566,0.00006146646,0.00025575634,0.00023858702,0.000012205245,0.0002117995,0.0003054322,0.000009459643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011422962,0.00024719903,0.00027900864,0.000077643934,0.000033534267,0.0000053128288,0.0014536375,0.346721,0.35877612,0.0011167744,0.009605573,0.28157],"study_design_scores_gemma":[0.0010765133,0.0024835526,0.009189428,0.0005269648,0.000044737295,0.0006331597,0.0000055520195,0.3319809,0.22441855,0.011979429,0.41460314,0.0030580475],"about_ca_topic_score_codex":0.0000136576655,"about_ca_topic_score_gemma":0.000023624287,"teacher_disagreement_score":0.5634924,"about_ca_system_score_codex":0.00009569331,"about_ca_system_score_gemma":0.00044268204,"threshold_uncertainty_score":0.7842813},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010404186,0.0001292775,0.98776335,0.00056314195,0.00033140642,0.0004946049,0.0000026192772,0.0002868843,0.000024506799],"genre_scores_gemma":[0.5626869,0.000012163681,0.4365954,0.00047663625,0.00019653545,0.000021218593,0.000002460489,0.000007882765,7.9059686e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997482,0.00005833903,0.00044867033,0.0009762802,0.00050184265,0.0005328839],"domain_scores_gemma":[0.9976425,0.0010384836,0.00015531138,0.0006506257,0.00038388892,0.00012918348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007998736,0.00024368522,0.0002633655,0.0005143863,0.00028910895,0.0005048255,0.0016426455,0.000107505024,0.0000032566888],"category_scores_gemma":[0.0001085743,0.00023527695,0.000071028044,0.001973916,0.00017749613,0.0008707697,0.00038561446,0.00017571141,0.0000035786761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008311281,0.00005252389,0.000058951715,0.000015615718,0.0000021011804,0.000007299884,0.00054510764,0.8406699,0.00044750224,0.013612767,0.000006593371,0.14457333],"study_design_scores_gemma":[0.00030411966,0.00018490071,0.000031538697,0.00006280214,0.0000020649873,0.000014412354,1.0874639e-7,0.9377184,0.026702974,0.034001518,0.0006973038,0.0002798674],"about_ca_topic_score_codex":0.00001905406,"about_ca_topic_score_gemma":0.000057291993,"teacher_disagreement_score":0.55228275,"about_ca_system_score_codex":0.00014316116,"about_ca_system_score_gemma":0.00024904363,"threshold_uncertainty_score":0.9594316},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24186474,0.00025509452,0.7558876,0.001298115,0.00036365763,0.00024150945,0.000048891347,0.000014431002,0.000025902076],"genre_scores_gemma":[0.6889248,0.000009614442,0.310548,0.000359276,0.00013864122,0.000008386822,0.0000024961125,0.000007703315,0.0000010918177],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99836427,0.0000885678,0.0003740496,0.00041827917,0.0004830383,0.00027180588],"domain_scores_gemma":[0.9985904,0.00054214423,0.00020620789,0.00043123876,0.00018636578,0.00004362164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036903578,0.00015310581,0.00033664654,0.00013080028,0.000059273574,0.000024139388,0.00047684938,0.00004927319,0.00003473102],"category_scores_gemma":[0.00006034182,0.000106367595,0.00007959659,0.0009980447,0.00046421256,0.00008086225,0.00017093711,0.00021055211,7.8176623e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015983596,0.000068597226,0.008148948,0.000034896504,0.000008040806,0.0000027544806,0.00022440068,0.086763635,0.687426,0.0000036292668,0.000025695545,0.21727744],"study_design_scores_gemma":[0.00067088526,0.000044261713,0.04362066,0.000246038,0.00002803279,0.000031327225,0.0000011610488,0.27962342,0.67492974,0.0007184326,0.000004124615,0.00008191013],"about_ca_topic_score_codex":0.0006465138,"about_ca_topic_score_gemma":0.00020167755,"teacher_disagreement_score":0.44706005,"about_ca_system_score_codex":0.00010304571,"about_ca_system_score_gemma":0.00017971307,"threshold_uncertainty_score":0.43375444},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10829399,0.000920264,0.30227947,0.009388191,0.009079758,0.0025727125,0.00008228452,0.0003308395,0.5670525],"genre_scores_gemma":[0.99082404,0.0000621455,0.0050996286,0.0011527082,0.00035230868,0.000004092756,0.0000013928403,0.000016454458,0.0024872418],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770486,0.000031657222,0.0002972971,0.00049693364,0.0010342894,0.0004349603],"domain_scores_gemma":[0.9975442,0.0012536204,0.0002495292,0.00055900315,0.0002562043,0.00013743954],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012927739,0.00022653937,0.00026373268,0.00018602057,0.000280955,0.00028582456,0.0018528734,0.00026206314,0.000020702142],"category_scores_gemma":[0.0006615117,0.00015500712,0.000085358035,0.00025375356,0.0047025564,0.00017118757,0.00023556355,0.00070139323,0.000019243736],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002334632,0.0000206089,0.00007181654,0.000011893037,0.000004252197,0.0000055546952,0.0015329737,0.009043796,0.0001881003,0.01783639,0.000007957435,0.97125334],"study_design_scores_gemma":[0.0008692426,0.0015314078,0.004451419,0.0034294995,0.00004056799,0.0000050513127,0.000015442276,0.007470067,0.02735057,0.20761077,0.7450878,0.002138162],"about_ca_topic_score_codex":0.00016687729,"about_ca_topic_score_gemma":0.0046010246,"teacher_disagreement_score":0.96911514,"about_ca_system_score_codex":0.0001021183,"about_ca_system_score_gemma":0.00086521194,"threshold_uncertainty_score":0.99800605},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017943933,0.0019535772,0.9883178,0.00030447895,0.0012727083,0.0006607208,0.000006475231,0.00015567649,0.007149143],"genre_scores_gemma":[0.7532233,0.0008946659,0.23724055,0.0019853325,0.0016847524,0.00009323148,0.000011337456,0.00018238444,0.0046844585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951699,0.00007973657,0.00054358545,0.0020162947,0.001286955,0.00090355426],"domain_scores_gemma":[0.9969884,0.0005696728,0.00020039751,0.0017760985,0.00015882129,0.0003066078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001319443,0.000538963,0.0005850758,0.0011985208,0.00033148297,0.0008902695,0.0030239164,0.00028501268,0.000023113002],"category_scores_gemma":[0.00006929048,0.00050361105,0.000086480446,0.00064647256,0.001140594,0.0006107786,0.0013815858,0.00093558844,0.000053319578],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016810522,0.000026771822,0.000043284188,0.00006414713,0.000017880064,0.00016063321,0.00046500957,0.015460975,0.00012355448,0.05757787,0.000028696444,0.92601436],"study_design_scores_gemma":[0.000995383,0.0008098852,0.00014831111,0.0009201077,0.000014420836,0.0007299144,4.531649e-7,0.58801764,0.0006678355,0.39518893,0.0108132325,0.0016938664],"about_ca_topic_score_codex":0.000025553776,"about_ca_topic_score_gemma":0.0000150232045,"teacher_disagreement_score":0.9243205,"about_ca_system_score_codex":0.00032272495,"about_ca_system_score_gemma":0.0004492177,"threshold_uncertainty_score":0.99974155},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007333287,0.000045671266,0.9965022,0.0015271239,0.00019247195,0.0008182938,0.00007625688,0.00021150934,0.0005530915],"genre_scores_gemma":[0.16177177,0.000025375493,0.8357454,0.0018569175,0.00016636749,0.00008188559,0.00019479719,0.000029810588,0.00012765391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963517,0.000024086803,0.00044330617,0.0017474404,0.00083117664,0.0006022745],"domain_scores_gemma":[0.9977033,0.00012311529,0.0002504122,0.0012542441,0.00034418365,0.0003247142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042864442,0.0005139961,0.00040630007,0.00057530985,0.00035552963,0.00052222685,0.0018664886,0.00026716018,0.0000047215467],"category_scores_gemma":[0.000060407714,0.0004197015,0.000069871945,0.00069352804,0.0002753933,0.0009793519,0.00040997265,0.0005142384,0.00005848586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018010529,0.00010657615,0.0000022096394,0.000018478042,0.0000035284988,0.000011595982,0.0004062353,0.12530962,0.0014832823,0.003195891,0.000022662329,0.8694219],"study_design_scores_gemma":[0.0002283602,0.0003866244,0.000065648914,0.0004733251,0.000015139323,0.00005862128,6.0274573e-7,0.8744042,0.0015618256,0.12188547,0.00025496888,0.0006652229],"about_ca_topic_score_codex":0.000035083423,"about_ca_topic_score_gemma":0.00017120884,"teacher_disagreement_score":0.8687567,"about_ca_system_score_codex":0.00029391854,"about_ca_system_score_gemma":0.00034274362,"threshold_uncertainty_score":0.9998255},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010676975,0.0011771613,0.98557323,0.0002269375,0.00077649846,0.0013066017,0.000007941062,0.00011119592,0.00014343411],"genre_scores_gemma":[0.34069273,0.00008748965,0.658398,0.0005153901,0.00021070222,0.00002344527,0.000010614164,0.00003589149,0.000025739928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632144,0.000033774155,0.00060322933,0.0015677509,0.0008256086,0.0006482092],"domain_scores_gemma":[0.99714696,0.0008773008,0.00034771013,0.0010460041,0.00038173367,0.00020029857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012167178,0.00045071726,0.000437217,0.00074990775,0.00045146825,0.00031209804,0.001087707,0.0002574254,0.0000050253166],"category_scores_gemma":[0.00015736616,0.0004093749,0.00018208331,0.0008155657,0.00064458494,0.00017923868,0.0006073821,0.00038756113,0.000008144528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028335005,0.00015914987,0.00034627985,0.00042207932,0.000024975818,0.000025104355,0.0012943086,0.62631875,0.0013095344,0.013828801,0.000008061931,0.3562346],"study_design_scores_gemma":[0.0004876352,0.000074697244,0.0004410357,0.0008475684,0.000024367278,0.000069361566,6.490494e-7,0.986341,0.0030069875,0.0081190355,0.00009935638,0.00048830156],"about_ca_topic_score_codex":0.000059913666,"about_ca_topic_score_gemma":0.000032612104,"teacher_disagreement_score":0.36002225,"about_ca_system_score_codex":0.00018811443,"about_ca_system_score_gemma":0.00017688188,"threshold_uncertainty_score":0.9998358},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003820585,0.0006796277,0.9962907,0.0009585993,0.0003054648,0.0009231749,0.0000040982036,0.00007021478,0.00072990794],"genre_scores_gemma":[0.010073243,0.0001743963,0.9883118,0.0010829698,0.0001482027,0.000051260227,0.0000072471726,0.000021108799,0.00012972433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759185,0.000013081833,0.00048349297,0.00079903833,0.0006154772,0.00049707264],"domain_scores_gemma":[0.9984317,0.00020356367,0.00019650908,0.0008704943,0.00016221327,0.00013556269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008321255,0.00030785232,0.00025956976,0.00036460772,0.0003833533,0.0006977409,0.0022854784,0.00016399402,0.0000010096106],"category_scores_gemma":[0.00004811882,0.00021871942,0.000024546056,0.0007500808,0.00015605043,0.00074425543,0.0018948208,0.00047995677,0.000024593175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030179003,0.0000142598055,0.000015600614,0.000050635816,0.0000022771483,0.000006816684,0.0008841011,0.09118017,0.00010761735,0.046221573,0.000013644562,0.86150026],"study_design_scores_gemma":[0.00017919976,0.00007946392,0.000035025456,0.0005089123,0.0000016664249,0.000020493595,2.9741366e-7,0.8639758,0.00042989,0.13180378,0.0026384313,0.0003270045],"about_ca_topic_score_codex":0.00003422434,"about_ca_topic_score_gemma":0.00013607439,"teacher_disagreement_score":0.8611733,"about_ca_system_score_codex":0.00022476735,"about_ca_system_score_gemma":0.0003860782,"threshold_uncertainty_score":0.89191186},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002079686,0.000032655073,0.9912509,0.0010209668,0.00095017045,0.001051411,0.000008389062,0.00008812932,0.003517703],"genre_scores_gemma":[0.91561514,0.000006135531,0.08085534,0.0019331229,0.0012676098,0.000011516748,0.0000030625633,0.00003278475,0.00027529759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956567,0.00008841984,0.00072708615,0.0013192187,0.0015541663,0.0006543626],"domain_scores_gemma":[0.9964842,0.0007202802,0.0005034453,0.0018699215,0.0002089247,0.00021318212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015363368,0.00055011397,0.0007388254,0.0007322972,0.00025340787,0.0003666692,0.0034975049,0.00020637127,0.000039799124],"category_scores_gemma":[0.000050085302,0.0004024469,0.00016050172,0.0008170695,0.00074277696,0.0004159076,0.0013478427,0.0006921495,0.00005555171],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019884375,0.000072218594,0.0001353358,0.00002441236,0.000018548531,0.000041619933,0.0033838998,0.019362934,0.000101663885,0.0011071173,0.00004305057,0.9756893],"study_design_scores_gemma":[0.007005925,0.022267172,0.021220697,0.007300599,0.00030864755,0.0036937394,0.000060071692,0.64237034,0.032413084,0.12654664,0.12324724,0.013565844],"about_ca_topic_score_codex":0.00004575807,"about_ca_topic_score_gemma":0.00011509344,"teacher_disagreement_score":0.96212345,"about_ca_system_score_codex":0.00044061447,"about_ca_system_score_gemma":0.00055490556,"threshold_uncertainty_score":0.99984276},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44293225,0.0001719645,0.55320096,0.003232601,0.00006538019,0.00031187737,8.275702e-7,0.00007569217,0.000008432035],"genre_scores_gemma":[0.60768634,0.000009455591,0.39131576,0.0009492053,0.000031566153,9.936346e-7,0.0000015152991,0.000004627433,5.5241054e-7],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99802566,0.00005910957,0.00026181803,0.00083413534,0.000447543,0.00037174224],"domain_scores_gemma":[0.99845535,0.00042063562,0.000046852805,0.0007434626,0.00009616542,0.00023754039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011248174,0.00016841145,0.0002786348,0.0005233156,0.00017268633,0.00030383602,0.0003676432,0.00005231813,0.0000026038902],"category_scores_gemma":[0.0021208005,0.00014471964,0.000013708009,0.0035949457,0.00032333078,0.00026353123,0.000301296,0.00038429975,0.0000012320712],"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.00010035644,0.00047842442,0.49662423,0.000016734957,0.000011347764,0.000097454096,0.00049761735,0.00005563838,0.0062112035,0.00007278169,0.000076958546,0.49575725],"study_design_scores_gemma":[0.00051758264,0.0014086325,0.54401565,0.00009912404,0.000031535455,0.00006327345,0.0000060813736,0.44943917,0.0016796706,0.0025426212,0.000007019408,0.00018967237],"about_ca_topic_score_codex":0.0000739492,"about_ca_topic_score_gemma":0.000006437383,"teacher_disagreement_score":0.4955676,"about_ca_system_score_codex":0.00007176612,"about_ca_system_score_gemma":0.00007996609,"threshold_uncertainty_score":0.5901495},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015648284,0.0013296632,0.9913099,0.000088110806,0.00095448404,0.00012132457,0.000009426147,0.00003655929,0.0045856945],"genre_scores_gemma":[0.5532131,0.00044938645,0.4377288,0.0029846458,0.00299973,0.000018236753,0.00018595529,0.000106233114,0.0023138912],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998577,0.00001276224,0.00019935322,0.0007010937,0.00020748124,0.00030233574],"domain_scores_gemma":[0.9992621,0.00003410444,0.00012171157,0.0004057151,0.00009854954,0.00007782907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002879592,0.00023144681,0.00019569045,0.00012747475,0.000083318926,0.00004371662,0.00052580185,0.00045008265,0.000050714258],"category_scores_gemma":[0.00016056918,0.00020085806,0.00006808736,0.000065844586,0.00066074973,0.0000038415474,0.00035560422,0.00030838713,0.000040380783],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013299337,0.000008700384,0.000016267722,0.0000165285,0.0000064601422,0.000008496558,0.000057620422,0.000021037466,0.0048674555,0.000039287228,0.000029122179,0.9949157],"study_design_scores_gemma":[0.0030866368,0.00701816,0.0012723084,0.002245967,0.00018975628,0.0004573554,0.000003151218,0.02113165,0.30711457,0.47763443,0.17281775,0.0070282626],"about_ca_topic_score_codex":0.000024038922,"about_ca_topic_score_gemma":0.00004341983,"teacher_disagreement_score":0.98788744,"about_ca_system_score_codex":0.000031110278,"about_ca_system_score_gemma":0.00019243399,"threshold_uncertainty_score":0.8190754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032975452,0.0010283237,0.996611,0.0002512727,0.0009347496,0.00048680045,0.000014350998,0.00009863182,0.0002450924],"genre_scores_gemma":[0.17780697,0.00001441269,0.8218745,0.00015285675,0.000098251934,0.000007648468,0.0000042310144,0.000019968273,0.000021131083],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708825,0.00007471154,0.0006198773,0.0011941916,0.00043946883,0.00058347965],"domain_scores_gemma":[0.99750394,0.0009589611,0.00039050687,0.0007948354,0.00019831433,0.000153473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016174746,0.00047275014,0.0008594081,0.00084448786,0.0002828121,0.00029230633,0.0020493409,0.00025285312,0.000005714253],"category_scores_gemma":[0.00007522014,0.00042769354,0.00020705466,0.00060050713,0.00092136406,0.00042532233,0.00069870724,0.0005696855,0.0000012791714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015379159,0.000053078442,0.00006128213,0.00012938172,0.000026657764,0.000009304401,0.002167989,0.030287463,0.0010674506,0.36570334,0.0000016918162,0.600477],"study_design_scores_gemma":[0.00039132356,0.00032331364,0.00015728646,0.00036526757,0.000015213385,0.00004445457,9.435691e-7,0.11902023,0.007768233,0.87140495,0.00006536271,0.0004434156],"about_ca_topic_score_codex":0.00002004199,"about_ca_topic_score_gemma":0.0000148253985,"teacher_disagreement_score":0.6000336,"about_ca_system_score_codex":0.000089647605,"about_ca_system_score_gemma":0.00029451068,"threshold_uncertainty_score":0.9998175},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014398084,0.0002447307,0.9919192,0.0010916761,0.0013182146,0.00038033247,0.0000023408127,0.003453677,0.0014458216],"genre_scores_gemma":[0.2656575,0.000009588684,0.73081416,0.0029301995,0.0004913172,0.000012059637,0.0000054298466,0.00004230474,0.00003742427],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99583966,0.00007182338,0.0006127105,0.0016496072,0.0011023358,0.0007238839],"domain_scores_gemma":[0.99571174,0.0008906063,0.0003871768,0.0024709646,0.00033847618,0.00020103143],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013031195,0.0007076012,0.00054535846,0.00062829745,0.0007140574,0.0012073508,0.006665409,0.0004070129,0.000019275698],"category_scores_gemma":[0.0004026521,0.0004890643,0.00014442918,0.0007741208,0.0011912136,0.00077881647,0.001960531,0.0017995415,0.000019905008],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002989876,0.000019290568,0.00025603254,0.00002874345,0.000008564763,0.000058708705,0.0031812352,0.01921997,0.000054666954,0.05692877,0.00018235255,0.92005867],"study_design_scores_gemma":[0.000113848044,0.00018102193,0.00029631588,0.00052652875,0.0000057456377,0.00012066511,2.0996859e-7,0.16676179,0.0003531084,0.8305943,0.000494169,0.0005522796],"about_ca_topic_score_codex":0.00022442602,"about_ca_topic_score_gemma":0.00013875209,"teacher_disagreement_score":0.9195064,"about_ca_system_score_codex":0.00053010276,"about_ca_system_score_gemma":0.0009892096,"threshold_uncertainty_score":0.9998295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055485787,0.00078575884,0.99152964,0.00009685687,0.0009624428,0.00040924712,0.000062296946,0.00003458608,0.00057061395],"genre_scores_gemma":[0.8865369,0.000083142724,0.10480545,0.0006113653,0.0037671772,0.00012924291,0.0014799275,0.00008642609,0.0025003992],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99804693,0.00002122832,0.00030287995,0.0010844563,0.0002835877,0.00026092486],"domain_scores_gemma":[0.9989245,0.000043244192,0.00024088378,0.00059291115,0.00012635782,0.0000721073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023293088,0.0002889805,0.00020775948,0.00015150518,0.00028031308,0.00012584883,0.0003929279,0.0004456484,0.00001003105],"category_scores_gemma":[0.00004241115,0.00027069953,0.00010560909,0.00008139503,0.00020738547,0.000011623021,0.00018949735,0.00021062989,0.0000025164861],"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.00009038687,0.000030926876,0.00013547628,0.000016236956,0.000014139872,6.6071976e-7,0.00003917043,0.032790717,0.89457124,0.000049275834,0.0006560952,0.07160568],"study_design_scores_gemma":[0.00046325338,0.00019527528,0.00014312337,0.00006961043,0.000018938143,0.0000045999714,7.5214103e-7,0.02718674,0.95701635,0.0038487439,0.010673006,0.00037958624],"about_ca_topic_score_codex":0.00002299795,"about_ca_topic_score_gemma":0.000046383408,"teacher_disagreement_score":0.8867242,"about_ca_system_score_codex":0.0000787079,"about_ca_system_score_gemma":0.00017390204,"threshold_uncertainty_score":0.99997455},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000028381446,0.00046401046,0.96235347,0.0008604963,0.0037352904,0.00037415203,0.000004664941,0.00015676256,0.032048296],"genre_scores_gemma":[0.16339083,0.000092154034,0.82507324,0.00396862,0.0016767962,0.000022265971,0.0000050145554,0.000079984624,0.005691066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598885,0.00006745187,0.0005047468,0.0017970037,0.0008207951,0.00082117255],"domain_scores_gemma":[0.99698067,0.0004479724,0.0003410828,0.0014592211,0.00054957584,0.00022145553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006492536,0.00067109615,0.00066950487,0.0005279063,0.00031400516,0.0005473844,0.0031141993,0.00041318955,0.00031295503],"category_scores_gemma":[0.000083060906,0.0005711089,0.00014153091,0.00061610364,0.00088000775,0.001115461,0.001201955,0.0008750449,0.00018006677],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013907428,0.00006488459,0.00001987636,0.000015471656,0.000052164585,0.0001647147,0.0009096684,0.025006518,0.0004319724,0.051948033,0.0003584925,0.9210143],"study_design_scores_gemma":[0.00066493574,0.00038592276,0.00046194473,0.00036124868,0.00003816434,0.00005811987,1.783428e-7,0.49984285,0.0071127885,0.4497325,0.03935193,0.001989397],"about_ca_topic_score_codex":0.000057161906,"about_ca_topic_score_gemma":0.000058631656,"teacher_disagreement_score":0.9190249,"about_ca_system_score_codex":0.0002365949,"about_ca_system_score_gemma":0.00060234143,"threshold_uncertainty_score":0.999674},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010868109,0.000019957652,0.99467856,0.0006784822,0.0018373847,0.0011072791,0.000013656598,0.0002379188,0.0013180975],"genre_scores_gemma":[0.3194471,0.000011812686,0.67911536,0.000981037,0.00025545497,0.000098753924,0.000036551442,0.000025501806,0.000028435512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978479,0.000035743295,0.00052753504,0.00078389666,0.00043464135,0.0003702551],"domain_scores_gemma":[0.9981252,0.00039468013,0.0004895806,0.0006227955,0.00026194306,0.00010579911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009540637,0.00039316472,0.00035049187,0.0009837236,0.00039310032,0.0008780089,0.0007945823,0.00041133893,0.000006023274],"category_scores_gemma":[0.000060325092,0.0003699544,0.00008688634,0.00024728721,0.00016354179,0.0018798822,0.00027900335,0.0006686086,0.0000035827545],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000133348985,0.000017165967,0.000019430929,0.000035472538,0.0000030046515,9.949079e-7,0.00021028989,0.0003447861,0.00028496532,0.0021254916,0.000020112964,0.99692494],"study_design_scores_gemma":[0.000487207,0.0005039038,0.00017908293,0.00044774608,0.00001235425,0.00002842872,5.5172444e-7,0.96634555,0.0062272344,0.017522065,0.007686107,0.00055976945],"about_ca_topic_score_codex":0.000029880868,"about_ca_topic_score_gemma":0.00009597269,"teacher_disagreement_score":0.9963652,"about_ca_system_score_codex":0.00028872973,"about_ca_system_score_gemma":0.00029679743,"threshold_uncertainty_score":0.99987525},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006218312,0.00092785107,0.98712367,0.00604615,0.0017332262,0.00078458217,0.00007665357,0.0007167296,0.0025289408],"genre_scores_gemma":[0.15399115,0.0001258551,0.83384085,0.001850594,0.0026627423,0.000095086485,0.0004791194,0.00013528438,0.0068193018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99163437,0.000078219164,0.0007336493,0.0034658627,0.00250139,0.0015865226],"domain_scores_gemma":[0.99193347,0.0006427929,0.00021984526,0.00640024,0.00055430655,0.00024934937],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0034131997,0.00064369536,0.00064442836,0.0012361808,0.00037161852,0.0014378536,0.022184826,0.0005878707,0.000011046936],"category_scores_gemma":[0.0002607259,0.0005961979,0.0000893908,0.0021235177,0.0017965299,0.0014411713,0.021580772,0.002236411,0.0002607421],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064325454,0.0000848752,0.00012955599,0.00006788486,0.000017135551,0.00020500027,0.000304255,0.027701495,0.00008930816,0.055193495,0.028912775,0.8872878],"study_design_scores_gemma":[0.0002311241,0.00029765483,0.00022577199,0.0008466284,0.0000064824353,0.00010769024,1.7912868e-7,0.5360169,0.0011022547,0.34805024,0.11197679,0.0011383186],"about_ca_topic_score_codex":0.00015737615,"about_ca_topic_score_gemma":0.00039695075,"teacher_disagreement_score":0.88614947,"about_ca_system_score_codex":0.00080313627,"about_ca_system_score_gemma":0.00066537433,"threshold_uncertainty_score":0.9996489},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016745053,0.00023787262,0.9965303,0.00038227474,0.0005173634,0.00061283685,0.000016008558,0.000052174495,0.001483711],"genre_scores_gemma":[0.28273842,0.000028602328,0.71613586,0.00043034554,0.00021989137,0.000020378224,0.000012138069,0.00001867172,0.0003956941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744874,0.000027528558,0.00069008913,0.0007714444,0.00071642967,0.00034578124],"domain_scores_gemma":[0.99745667,0.0003767908,0.0005638296,0.0012038812,0.0003147151,0.00008410159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009215927,0.00030073206,0.00040581613,0.00043507846,0.00022629485,0.00014556675,0.0027077429,0.0002011704,0.000010712926],"category_scores_gemma":[0.00007829883,0.00028620104,0.00015217577,0.00022026653,0.00020779678,0.0004988959,0.00072531763,0.0002831174,0.0000073936358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054001544,0.000058746005,0.000046784993,0.0001100862,0.000016768801,0.0000015861365,0.002467473,0.45538953,0.001435324,0.08067649,0.000058241472,0.45973358],"study_design_scores_gemma":[0.0002506145,0.00005023744,0.00006745812,0.00023281423,0.000004763777,0.000004590303,6.208757e-8,0.9555443,0.00071810535,0.04250074,0.0003608021,0.0002654875],"about_ca_topic_score_codex":0.000013958777,"about_ca_topic_score_gemma":0.000052925578,"teacher_disagreement_score":0.5001548,"about_ca_system_score_codex":0.0001766114,"about_ca_system_score_gemma":0.00042005905,"threshold_uncertainty_score":0.999959},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023737155,0.00032434083,0.98593646,0.0004710245,0.0020668032,0.00036786668,0.000001508157,0.00028551597,0.010522745],"genre_scores_gemma":[0.060235623,0.00039584227,0.9330956,0.0025413085,0.0007819463,0.0000128973315,0.000007661786,0.00008606448,0.0028430643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99505156,0.000024429548,0.00071636087,0.0017016791,0.0016421949,0.00086376787],"domain_scores_gemma":[0.9963029,0.0008670126,0.00047998584,0.0017449834,0.00039689333,0.00020821569],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007656733,0.00065073237,0.00058132946,0.0010412459,0.00034512326,0.0012011939,0.004903324,0.00036855388,0.000090355345],"category_scores_gemma":[0.00041534772,0.0006001848,0.00011808495,0.0009896817,0.00047098476,0.0011901805,0.0020541013,0.0010341849,0.00023533154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004738401,0.000017544593,0.00007109214,0.00011060826,0.000010215068,0.00012489512,0.00067740696,0.22913873,0.000072820585,0.0030392061,0.000044850076,0.76668787],"study_design_scores_gemma":[0.00027365328,0.00021960869,0.00013939601,0.0013151349,0.000008770367,0.00011907168,7.973425e-8,0.9669989,0.00081005914,0.0193725,0.009715052,0.0010278022],"about_ca_topic_score_codex":0.0000039779525,"about_ca_topic_score_gemma":0.0000058767373,"teacher_disagreement_score":0.7656601,"about_ca_system_score_codex":0.00034176893,"about_ca_system_score_gemma":0.00047699394,"threshold_uncertainty_score":0.99983567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013555579,0.00022285545,0.99643874,0.000369092,0.00018727324,0.00029478312,0.0003245783,0.00010034628,0.0007067973],"genre_scores_gemma":[0.06978646,0.00010528896,0.9286947,0.00043070212,0.00035457095,0.000020445843,0.00032314425,0.000042336866,0.0002422986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676394,0.000016327882,0.00031351484,0.0018609248,0.0005904202,0.0004548592],"domain_scores_gemma":[0.9966937,0.00032545454,0.000197658,0.002536834,0.00007272442,0.00017365984],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00032036318,0.00042287994,0.0003895852,0.00022376857,0.00022609146,0.0012106793,0.004024579,0.00013567545,0.000023119348],"category_scores_gemma":[0.000013694893,0.0003298352,0.000026376903,0.00020139944,0.00030016887,0.0017694089,0.003140715,0.0004393182,0.000027198143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016183564,0.00001772086,0.000092314585,0.000015410484,0.000021743723,0.00003432838,0.00061700534,0.024332099,0.000042978092,0.004817045,0.00004309485,0.9699646],"study_design_scores_gemma":[0.00015535008,0.00005332885,0.00008599916,0.00045651675,0.000010593393,0.00002407584,4.607035e-7,0.9477169,0.000060366525,0.050658397,0.0003441859,0.00043382825],"about_ca_topic_score_codex":0.0010469159,"about_ca_topic_score_gemma":0.00017655967,"teacher_disagreement_score":0.9695308,"about_ca_system_score_codex":0.00011823232,"about_ca_system_score_gemma":0.00023246718,"threshold_uncertainty_score":0.99991536},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043300778,0.000376746,0.99191713,0.00056726957,0.0017272109,0.00046389198,0.000008796442,0.00026348396,0.0042424533],"genre_scores_gemma":[0.07855859,0.00008678233,0.91271645,0.0075655244,0.0006029975,0.000027539161,0.0000081969665,0.000121345125,0.00031258215],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99429375,0.000102655904,0.0007190738,0.002356411,0.0010781961,0.001449898],"domain_scores_gemma":[0.9964975,0.0011036479,0.00044212682,0.001405544,0.0002307914,0.000320357],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024294376,0.00084845064,0.00067421,0.001605894,0.0009977068,0.0011406299,0.0026704904,0.0003184173,0.000010125815],"category_scores_gemma":[0.00016386627,0.0007818984,0.00019181076,0.0014883124,0.0009724107,0.0007026659,0.0015264256,0.0011573685,0.000014288],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000455409,0.000035609854,0.00014069639,0.00004509021,0.00002549167,0.0001431234,0.0006329804,0.0037887027,0.000096363015,0.06466253,0.000017695038,0.93040717],"study_design_scores_gemma":[0.0007035473,0.0005497813,0.00014578394,0.00075514725,0.000022048285,0.00027063664,0.0000015112788,0.2752013,0.0014051928,0.71782804,0.0015997214,0.0015173331],"about_ca_topic_score_codex":0.000016157477,"about_ca_topic_score_gemma":0.000013875355,"teacher_disagreement_score":0.9288898,"about_ca_system_score_codex":0.000114778624,"about_ca_system_score_gemma":0.00018798374,"threshold_uncertainty_score":0.9998963},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028727209,0.00024553883,0.99710286,0.00019926259,0.0011729618,0.00075137714,0.000005730274,0.00025517706,0.0002383575],"genre_scores_gemma":[0.0049934657,0.000018801284,0.99422973,0.00013325686,0.00043858163,0.00003471722,0.0000058939568,0.000063115454,0.00008241992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985107,0.000012550539,0.00032756757,0.00047411444,0.00031915025,0.00035586944],"domain_scores_gemma":[0.9985581,0.000626955,0.00010145011,0.00048721707,0.00016820566,0.000058063175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011771874,0.00028298274,0.00023510646,0.00022003966,0.00026229126,0.0002268973,0.0007578938,0.00030937875,0.000009637639],"category_scores_gemma":[0.00013210665,0.00022528124,0.000074743024,0.00023173876,0.00025682084,0.00016825028,0.00013952664,0.0007965339,0.0000066255625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.197576e-7,0.0000028015484,0.000004489043,0.00003709889,0.0000049377104,4.0748455e-7,0.00021053008,0.6824508,0.0007198582,0.0003156403,6.2530086e-7,0.3162521],"study_design_scores_gemma":[0.0002031836,0.000016055232,0.00001237408,0.000106986234,0.000010194202,0.0000062973427,1.9116509e-7,0.98602146,0.004897437,0.007931527,0.0005251964,0.0002690993],"about_ca_topic_score_codex":0.0000033540878,"about_ca_topic_score_gemma":0.000016219588,"teacher_disagreement_score":0.31598303,"about_ca_system_score_codex":0.000114101065,"about_ca_system_score_gemma":0.00008374472,"threshold_uncertainty_score":0.91867024},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003595862,0.0004499603,0.98998284,0.0011198121,0.0008467426,0.00076094037,0.000012838741,0.0001948312,0.0066284174],"genre_scores_gemma":[0.039287094,0.00006257448,0.9569379,0.0017635442,0.00077678246,0.00003479969,0.000031698477,0.000042791,0.0010628175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949257,0.000024028988,0.0007060469,0.0022860435,0.0010978035,0.0009604239],"domain_scores_gemma":[0.9968715,0.00043817778,0.00047448697,0.0015111469,0.00044452734,0.00026020783],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007251959,0.00072107726,0.0006723226,0.00065922487,0.00040615725,0.0010444751,0.0046772724,0.000464756,0.000021909544],"category_scores_gemma":[0.00012502988,0.00066616794,0.00021414443,0.0007189751,0.0004711124,0.0010192419,0.000671991,0.0007553368,0.000021955018],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012128304,0.000070906615,0.0001098655,0.00015576821,0.000013851286,0.000029505514,0.0002240831,0.010162272,0.00002570915,0.13047488,0.000042906533,0.8586781],"study_design_scores_gemma":[0.00046520517,0.00027702056,0.0014443953,0.00036524516,0.000013743334,0.0001205635,4.892363e-8,0.5817944,0.00025960308,0.41375265,0.00050485716,0.0010022746],"about_ca_topic_score_codex":0.0000029505727,"about_ca_topic_score_gemma":0.000012775455,"teacher_disagreement_score":0.85767585,"about_ca_system_score_codex":0.0003094489,"about_ca_system_score_gemma":0.0010490865,"threshold_uncertainty_score":0.99999255},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27658644,0.00012576705,0.7209255,0.000116798714,0.0012345449,0.00072103855,0.0000020609991,0.000052202533,0.00023563358],"genre_scores_gemma":[0.96742696,0.000012308252,0.03215249,0.00015102369,0.00018558206,0.000012649661,7.6811426e-7,0.00002042715,0.000037800117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960884,0.000061570456,0.00082426576,0.0015328057,0.0009493314,0.000543632],"domain_scores_gemma":[0.9978263,0.00029406778,0.00034851936,0.0011609611,0.00021959473,0.00015058239],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010060015,0.0004301235,0.0005820384,0.0010045334,0.00011379015,0.00032041644,0.0028463057,0.0002918621,0.00001954334],"category_scores_gemma":[0.00011544276,0.00041081823,0.000046912566,0.0006262987,0.00053829415,0.000851408,0.0012941653,0.00091307523,0.0000167507],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028890683,0.0006595125,0.0010849325,0.000041709765,0.000013439459,0.00020902371,0.02575092,0.009905606,0.015380846,0.020964714,5.6756136e-7,0.9259598],"study_design_scores_gemma":[0.0003587703,0.002571991,0.0014355343,0.0004734058,0.000015364973,0.000044598386,0.000012670394,0.52506113,0.12468843,0.3438497,0.00009278733,0.0013956429],"about_ca_topic_score_codex":0.00006752074,"about_ca_topic_score_gemma":0.0026781957,"teacher_disagreement_score":0.9245642,"about_ca_system_score_codex":0.00009807835,"about_ca_system_score_gemma":0.00028022195,"threshold_uncertainty_score":0.99983436},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014616498,0.00050183944,0.99460006,0.0029172206,0.00024527826,0.00035941682,0.0000052894848,0.0002727911,0.0009519185],"genre_scores_gemma":[0.18207343,0.00028220937,0.81375414,0.0024091864,0.00041390842,0.000016864606,0.00008244436,0.000084197694,0.00088359904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583113,0.00011005446,0.0006642126,0.0013363541,0.0014537283,0.0006044995],"domain_scores_gemma":[0.99808687,0.0005316978,0.00025450086,0.000675925,0.00024376942,0.00020723332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020645668,0.0004506013,0.000490917,0.0010257164,0.00020032363,0.00051465485,0.001702071,0.00041737215,0.000057000267],"category_scores_gemma":[0.0004230367,0.00041662544,0.00008540382,0.00082507386,0.00083847274,0.0007384336,0.0006053746,0.0013121605,0.000013385747],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075388656,0.00017611736,0.0010801591,0.00021140379,0.000010169952,0.0006203967,0.00051356055,0.0019556242,0.007330064,0.0050460217,0.00008313959,0.98289794],"study_design_scores_gemma":[0.0005626078,0.00011099368,0.0010982008,0.00028356042,0.0000040694767,0.000037161295,1.171086e-7,0.9700033,0.011973482,0.01467483,0.00074229564,0.0005093575],"about_ca_topic_score_codex":0.000075575765,"about_ca_topic_score_gemma":0.00010098375,"teacher_disagreement_score":0.9823886,"about_ca_system_score_codex":0.00028818104,"about_ca_system_score_gemma":0.0008316386,"threshold_uncertainty_score":0.9998286},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012678814,0.0001913446,0.9961774,0.00011523826,0.0014011828,0.00029846161,0.0000026141242,0.00018770501,0.0003581787],"genre_scores_gemma":[0.85469073,0.000028894032,0.14455079,0.00012703848,0.0002701313,0.00001306495,0.0000013031905,0.000034917615,0.00028315693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689376,0.000020279846,0.0004042306,0.0010136078,0.0011219245,0.00054616696],"domain_scores_gemma":[0.99706185,0.0009052763,0.00017386761,0.0014058772,0.00031034282,0.00014279182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005943425,0.0003456578,0.00038856192,0.0010096992,0.00008508306,0.00025365324,0.0030749706,0.0002623071,0.00004021192],"category_scores_gemma":[0.0002587606,0.00032378786,0.000105346815,0.0005436133,0.00031935825,0.00049111346,0.0012259074,0.0007339543,0.00008729554],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014939441,0.000015929336,0.00035873265,0.00008755083,0.000009847302,0.000026986861,0.0002981676,0.012731885,0.0015452664,0.0019500005,0.0000068151153,0.9829673],"study_design_scores_gemma":[0.00044611163,0.00054926553,0.007919608,0.0009774502,0.000008773828,0.00012879373,1.4217622e-7,0.852352,0.064621344,0.07063233,0.0010218781,0.0013422915],"about_ca_topic_score_codex":0.00006960817,"about_ca_topic_score_gemma":0.000030225647,"teacher_disagreement_score":0.981625,"about_ca_system_score_codex":0.0002422202,"about_ca_system_score_gemma":0.00026484043,"threshold_uncertainty_score":0.99992144},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034233864,0.0010485376,0.99513793,0.00092368457,0.0010102374,0.0007370924,0.000025590854,0.00019783463,0.0005767501],"genre_scores_gemma":[0.21381111,0.00019511054,0.7839403,0.00074063113,0.00054308126,0.000035483088,0.000054136515,0.000044762357,0.00063535897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996801,0.00003822364,0.0004302585,0.001524027,0.00066705316,0.00053941255],"domain_scores_gemma":[0.997836,0.00084875914,0.0002093142,0.0005304413,0.00039927135,0.00017619149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007077187,0.0004891267,0.00049409654,0.0008155384,0.0003646502,0.0004959454,0.0009827379,0.00027513172,0.000005493575],"category_scores_gemma":[0.00010170483,0.00047594978,0.0001322649,0.00093867304,0.0002934618,0.0005424811,0.00031435117,0.00045200603,0.0000035614567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014322198,0.00003923849,0.000029622488,0.00003485204,0.000022265282,0.00006209515,0.0009875263,0.043252155,0.00040369577,0.008413007,0.000021569354,0.94671965],"study_design_scores_gemma":[0.00044218142,0.00026126535,0.000533877,0.0002097778,0.00001767808,0.00013809165,3.4996268e-7,0.93723506,0.00025067554,0.058759816,0.0015835132,0.0005677153],"about_ca_topic_score_codex":0.00001244246,"about_ca_topic_score_gemma":0.000099798184,"teacher_disagreement_score":0.9461519,"about_ca_system_score_codex":0.00022538855,"about_ca_system_score_gemma":0.00043428986,"threshold_uncertainty_score":0.9997692},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026371266,0.00050152483,0.99102116,0.0002439192,0.0012931278,0.0003284523,0.000004548197,0.004015001,0.002328544],"genre_scores_gemma":[0.15431824,0.000035092587,0.8437412,0.0012850664,0.0004374019,0.00000452681,0.0000025318081,0.000049529495,0.00012643544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99458975,0.000038538947,0.00077525305,0.0021264853,0.0013554322,0.0011145486],"domain_scores_gemma":[0.995018,0.0018620729,0.00048335528,0.001954842,0.00041020854,0.0002714903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022352256,0.00073185185,0.0006492202,0.0015196836,0.00052274734,0.000810998,0.0044842153,0.00047268436,0.000010307599],"category_scores_gemma":[0.0009890854,0.000697189,0.00014624877,0.0014004941,0.0012306031,0.0010252756,0.0016176197,0.0009694718,0.00002737946],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033845754,0.000045220215,0.0011249848,0.00009009122,0.000011758967,0.00047574312,0.0009337344,0.021625107,0.0017525281,0.004715927,0.00009670363,0.9691248],"study_design_scores_gemma":[0.00010297236,0.00019235266,0.00004097819,0.0014711303,0.000009470936,0.0004904428,6.957388e-8,0.62237793,0.006589961,0.36751944,0.00025266435,0.0009525994],"about_ca_topic_score_codex":0.00034736074,"about_ca_topic_score_gemma":0.00004316669,"teacher_disagreement_score":0.9681722,"about_ca_system_score_codex":0.00079904916,"about_ca_system_score_gemma":0.0013389001,"threshold_uncertainty_score":0.9995479},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000073933654,0.00033528288,0.9800629,0.00010117437,0.002209588,0.00031780076,0.000028729091,0.00014683207,0.016723737],"genre_scores_gemma":[0.055812724,0.00012886737,0.93965465,0.0008312564,0.0007839364,0.000015617712,0.000009311818,0.00006179664,0.0027018713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649566,0.000026501191,0.00066370517,0.0012480357,0.0009548242,0.0006112858],"domain_scores_gemma":[0.9971944,0.00047792142,0.0003911189,0.0015225926,0.00025248452,0.0001614878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007781426,0.00048651284,0.0006060668,0.0014072311,0.0003656962,0.00016123673,0.0015640565,0.00025869007,0.000017520799],"category_scores_gemma":[0.00008184691,0.0004433769,0.00014626596,0.0014374598,0.0006628009,0.0005861536,0.0008657858,0.00072525797,0.000018734638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026576332,0.00008333558,0.00007220962,0.0001265978,0.00002688565,0.00018854992,0.0010297935,0.08279831,0.0010100986,0.20009482,0.00011846609,0.7144244],"study_design_scores_gemma":[0.0019536405,0.0024230564,0.0003619001,0.010912178,0.000042097257,0.0006401628,0.0000066021835,0.72675544,0.034342207,0.084642515,0.13274296,0.00517723],"about_ca_topic_score_codex":0.000042489573,"about_ca_topic_score_gemma":0.00031910514,"teacher_disagreement_score":0.7092471,"about_ca_system_score_codex":0.00028204644,"about_ca_system_score_gemma":0.0005965196,"threshold_uncertainty_score":0.9998018},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010142258,0.00043340257,0.9878178,0.00021937577,0.00045352025,0.00057017605,0.000005241079,0.00008194078,0.00027626436],"genre_scores_gemma":[0.2991013,0.00007800862,0.70020884,0.00044737943,0.0000583993,0.000010808139,0.000009846602,0.000017613045,0.00006779375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593484,0.00009467001,0.0008867242,0.0015939397,0.0008958072,0.00059398694],"domain_scores_gemma":[0.99724567,0.00037553153,0.00059133297,0.0011721883,0.00045424263,0.000161017],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001367033,0.0005094891,0.00089722633,0.0030272307,0.00009069378,0.0004965711,0.0026621097,0.00036074404,0.00000548227],"category_scores_gemma":[0.00039552373,0.00047575615,0.00017353264,0.0034014855,0.0005375293,0.0016027809,0.0009228968,0.00071252964,0.000003593249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019632107,0.0000672938,0.0005663226,0.000047108537,0.00006826425,0.000034302073,0.0018035263,0.0086373165,0.00022462949,0.0664218,0.0000013492781,0.9221085],"study_design_scores_gemma":[0.00029187364,0.0005800614,0.007689795,0.00067992276,0.00009160521,0.000040225877,6.852447e-7,0.9322981,0.0027765236,0.05464192,0.00013012411,0.00077914144],"about_ca_topic_score_codex":0.000049454626,"about_ca_topic_score_gemma":0.00027135777,"teacher_disagreement_score":0.9236608,"about_ca_system_score_codex":0.00026818577,"about_ca_system_score_gemma":0.00029699202,"threshold_uncertainty_score":0.9997694},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046680827,0.0011685739,0.97241545,0.00096297136,0.0035824492,0.0006501175,0.000007502477,0.0003196544,0.020846577],"genre_scores_gemma":[0.14950864,0.00011036274,0.83647835,0.0038812347,0.0044028866,0.000049237984,0.000013116232,0.00010586042,0.0054502916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950849,0.00003754445,0.0006433943,0.0021706282,0.0009006039,0.0011629415],"domain_scores_gemma":[0.99639493,0.00091783423,0.00037364714,0.0016785243,0.0003446849,0.00029040547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012853967,0.000763038,0.0007906028,0.0007785939,0.0005645965,0.00095619174,0.0050566327,0.0004924403,0.000039545714],"category_scores_gemma":[0.00021314537,0.0006609556,0.00033108547,0.0005525415,0.0005868776,0.00090014644,0.0014547952,0.0009049751,0.000121838915],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009828366,0.00003936171,0.00003839239,0.000058932503,0.000014981388,0.00003166972,0.0013848714,0.0057299654,0.00008232288,0.109560035,0.00022409491,0.88282555],"study_design_scores_gemma":[0.00093503133,0.0004983552,0.00018990698,0.0006160235,0.000022373173,0.00015888613,2.5642572e-7,0.59594077,0.0020373666,0.30687758,0.09091938,0.0018041002],"about_ca_topic_score_codex":0.000012722419,"about_ca_topic_score_gemma":0.00015488763,"teacher_disagreement_score":0.88102144,"about_ca_system_score_codex":0.0003831559,"about_ca_system_score_gemma":0.0005209384,"threshold_uncertainty_score":0.99958414},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009152111,0.00017188549,0.98924637,0.00030675074,0.00061367534,0.0005814198,0.000005554402,0.000071205606,0.008087923],"genre_scores_gemma":[0.35889637,0.000021723024,0.6392248,0.0011179073,0.0001863006,0.000016891237,0.000010055626,0.00003052991,0.0004953766],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654895,0.000034013276,0.0005601457,0.0014273301,0.000946863,0.000482699],"domain_scores_gemma":[0.99723303,0.00037748308,0.0004948844,0.0012108559,0.0005155166,0.00016824873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081357005,0.00048361003,0.0005986745,0.0008247052,0.00025090168,0.00057439716,0.005019978,0.00025554036,0.000023402481],"category_scores_gemma":[0.00006886353,0.00040998997,0.000084183666,0.001025639,0.0005611912,0.001294686,0.0012494689,0.00037812252,0.000026280259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085212174,0.00011476542,0.00031446927,0.00011582544,0.00006278473,0.0001834544,0.0038627642,0.09401102,0.0014940039,0.13671075,0.0000965765,0.7629484],"study_design_scores_gemma":[0.001217638,0.0018582226,0.0019296156,0.0019759089,0.000040852203,0.000291058,7.027157e-7,0.20704846,0.024755718,0.7557577,0.002992197,0.0021319166],"about_ca_topic_score_codex":0.000118341486,"about_ca_topic_score_gemma":0.000084634135,"teacher_disagreement_score":0.76081645,"about_ca_system_score_codex":0.0001348793,"about_ca_system_score_gemma":0.0010298557,"threshold_uncertainty_score":0.9998352},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009945631,0.00080923294,0.98647237,0.0071729054,0.0020028064,0.0006478135,0.0000070442684,0.00068019296,0.0012130772],"genre_scores_gemma":[0.27950862,0.000118610646,0.7068015,0.011422896,0.0008054062,0.00004650942,0.000013951364,0.000118005206,0.0011645528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933837,0.00005045432,0.0007515719,0.002625532,0.0015962559,0.0015924679],"domain_scores_gemma":[0.9962166,0.00030712955,0.00039891983,0.0025371038,0.0002808557,0.00025940276],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011496504,0.0009026029,0.0009935301,0.002535715,0.00027380598,0.000994946,0.007897023,0.00064293394,0.000006565999],"category_scores_gemma":[0.00021620204,0.0009012805,0.00014699808,0.002419523,0.00052177906,0.0010008519,0.0029860495,0.0015750864,0.00003221401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054799593,0.000042857835,0.0002731485,0.000032140044,0.000008413162,0.0005048115,0.0006162754,0.21051636,0.000053753603,0.0061195134,0.00042286603,0.7814044],"study_design_scores_gemma":[0.0007824106,0.00057431584,0.0010084679,0.003285698,0.000016046031,0.00016465342,0.000007500502,0.62602955,0.002969022,0.33695045,0.024891065,0.0033208113],"about_ca_topic_score_codex":0.0001955746,"about_ca_topic_score_gemma":0.0013030045,"teacher_disagreement_score":0.77808356,"about_ca_system_score_codex":0.000881162,"about_ca_system_score_gemma":0.00035207925,"threshold_uncertainty_score":0.9993438},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020131351,0.00017442206,0.99474025,0.000998688,0.00064201764,0.000361256,0.000003497527,0.0001326146,0.002745919],"genre_scores_gemma":[0.8924847,0.00020802463,0.10298137,0.0035274047,0.00041276257,0.000022666858,0.000008698362,0.000050901006,0.0003034417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972316,0.000051350824,0.0005300618,0.0009144367,0.0009340836,0.00033847697],"domain_scores_gemma":[0.99694556,0.00070661143,0.0004032237,0.0014327606,0.00043793576,0.00007392182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010002835,0.0003782693,0.00037922512,0.000852138,0.000375992,0.0008224863,0.0030300163,0.00022834352,0.000022075877],"category_scores_gemma":[0.00009386584,0.00027351477,0.00012550682,0.0011891044,0.0009916415,0.0003346553,0.0007780422,0.00049210835,0.000009264193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025441484,0.000027250031,0.000017616021,0.000012767522,0.0000065272443,0.000008153192,0.0006154081,0.001333973,0.0000710601,0.8566376,0.00008606453,0.14118104],"study_design_scores_gemma":[0.00009309817,0.00024683404,0.000053950524,0.0003189166,0.0000037801528,0.000010932352,9.35428e-8,0.35191068,0.008864884,0.6356627,0.0025164902,0.00031769017],"about_ca_topic_score_codex":0.000018231474,"about_ca_topic_score_gemma":0.0000377078,"teacher_disagreement_score":0.89228344,"about_ca_system_score_codex":0.00009542876,"about_ca_system_score_gemma":0.00044378638,"threshold_uncertainty_score":0.9999717},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011268859,0.0008888174,0.9945852,0.0004454277,0.00024852544,0.00025002108,0.0000027107449,0.0003530545,0.0031135264],"genre_scores_gemma":[0.19430992,0.00033756316,0.8041504,0.0005342507,0.00046291863,0.000008985376,0.000012158016,0.000089233006,0.00009459446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980641,0.0000055762544,0.00025441922,0.00071336504,0.00035783573,0.00060470204],"domain_scores_gemma":[0.9979562,0.00042805716,0.000040335402,0.001493989,0.000027977487,0.0000534478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032748096,0.0003754819,0.00034661044,0.00017960212,0.000070702525,0.00014121004,0.002611662,0.0003011826,0.00000573819],"category_scores_gemma":[0.000047942744,0.0002533951,0.000025313984,0.00044083607,0.0007757738,0.00024794732,0.00082385156,0.001533953,0.000005771873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023635841,0.0000021746812,0.000006885023,0.0000045423208,0.0000027687263,0.00004139426,0.0000143537345,0.62386173,0.0000031698462,0.0015748611,0.0000094964,0.37447625],"study_design_scores_gemma":[0.00010221115,0.000059167138,0.00010679423,0.00032744723,0.0000055975547,0.000029904852,2.7259736e-7,0.9835395,0.000020238387,0.012167828,0.0032661583,0.0003748689],"about_ca_topic_score_codex":0.000001287573,"about_ca_topic_score_gemma":0.00016421403,"teacher_disagreement_score":0.3741014,"about_ca_system_score_codex":0.00016728415,"about_ca_system_score_gemma":0.000040309336,"threshold_uncertainty_score":0.99999183},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035068624,0.0004777516,0.9893013,0.0031048926,0.00124617,0.00053796946,0.000004630815,0.000119117816,0.0051730983],"genre_scores_gemma":[0.15569948,0.00040359926,0.8404846,0.0024204776,0.0005392666,0.00005783819,0.00001159194,0.000047359197,0.00033580215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996535,0.000026827533,0.0005232129,0.0011026681,0.0010969928,0.00071528176],"domain_scores_gemma":[0.9975684,0.00038096713,0.00024570388,0.0014262449,0.0002349768,0.00014368232],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011620264,0.0003957962,0.00028312765,0.00048735936,0.0008629159,0.0015737,0.0037739421,0.00015265452,0.000024888092],"category_scores_gemma":[0.000031679672,0.00028342876,0.00013662936,0.0007908613,0.00076669577,0.00054141285,0.0013372662,0.0006519643,0.000023616965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015446385,0.00001816066,0.000020503205,0.0000114270815,0.000007859654,0.000021873631,0.0011733621,0.0035341263,0.000008704597,0.5253786,0.000037861304,0.46978596],"study_design_scores_gemma":[0.0003039038,0.00014943036,0.000111370384,0.00016072764,0.0000059177796,0.00003786514,4.8920214e-7,0.030116566,0.00020227759,0.94585425,0.022562595,0.0004946338],"about_ca_topic_score_codex":0.000076282646,"about_ca_topic_score_gemma":0.00047873746,"teacher_disagreement_score":0.46929133,"about_ca_system_score_codex":0.0003484697,"about_ca_system_score_gemma":0.0008391508,"threshold_uncertainty_score":0.9999618},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002960221,0.000024579289,0.9509474,0.00029357008,0.0008774123,0.046210635,0.000009172474,0.00027314096,0.0013611164],"genre_scores_gemma":[0.0015342252,0.0000026882906,0.97457784,0.00045590923,0.00054451876,0.022518601,0.0000084697685,0.000049681163,0.00030807446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955531,0.000056200188,0.0008556093,0.001993831,0.0007985293,0.0007427593],"domain_scores_gemma":[0.9959491,0.00037023512,0.0006058786,0.002292996,0.0006087365,0.00017305874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019798595,0.00059293787,0.0005177302,0.00064365054,0.00030086606,0.00058427127,0.0040873047,0.00045244815,0.000007732896],"category_scores_gemma":[0.0003109032,0.00055702735,0.00016578806,0.0005538495,0.00058399566,0.0015137816,0.0006814168,0.00054684083,0.000015487076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021251897,0.000051152256,0.0000020499203,0.00014569511,0.000005244119,0.0000016191716,0.00038150817,0.084133215,0.00031036208,0.21401611,0.000014351876,0.7009174],"study_design_scores_gemma":[0.00033230375,0.00019556153,0.000011780697,0.00015630892,0.0000058381747,0.000014887308,5.2130904e-8,0.7676379,0.0018093938,0.2260434,0.003297831,0.00049472856],"about_ca_topic_score_codex":0.000012222581,"about_ca_topic_score_gemma":0.00004405029,"teacher_disagreement_score":0.7004227,"about_ca_system_score_codex":0.0006734186,"about_ca_system_score_gemma":0.00082607014,"threshold_uncertainty_score":0.99968815},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012227905,0.00028404116,0.9851936,0.00019755734,0.0021984624,0.000777728,0.0000019058147,0.00014918786,0.0110752545],"genre_scores_gemma":[0.04734791,0.00011753433,0.9514849,0.00045173627,0.00015531297,0.00002009026,0.0000019577294,0.000038435526,0.0003820805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955423,0.00022975913,0.00088139187,0.0016015853,0.0009417564,0.0008032021],"domain_scores_gemma":[0.99675256,0.00083339127,0.0005085712,0.0015503031,0.00019322165,0.00016193396],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0048286566,0.00057806517,0.0010032102,0.0013255567,0.00013161694,0.00040477823,0.0037828477,0.000332329,0.00003335349],"category_scores_gemma":[0.00038465697,0.00052792236,0.000196288,0.00081606326,0.0011631849,0.0011081075,0.0009466249,0.0011484416,0.00007439191],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007849159,0.00004015583,0.000026673026,0.000053972748,0.00001537984,0.00011545574,0.005269443,0.01432492,0.00008823444,0.24475461,0.0000050328053,0.7345212],"study_design_scores_gemma":[0.01117978,0.000079048354,0.000099920464,0.000401255,0.000007456895,0.000045990575,1.6781215e-7,0.4958725,0.002680977,0.48856705,0.00032552853,0.00074033724],"about_ca_topic_score_codex":0.00010225668,"about_ca_topic_score_gemma":0.00010381735,"teacher_disagreement_score":0.73378086,"about_ca_system_score_codex":0.00039337893,"about_ca_system_score_gemma":0.0004891643,"threshold_uncertainty_score":0.99971724},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018930673,0.0018702568,0.8647819,0.0069689583,0.0051592602,0.00073306746,0.000011863715,0.00019193674,0.11838966],"genre_scores_gemma":[0.95971483,0.00013468356,0.020906776,0.007418022,0.0015291201,0.0000151341865,0.00001510213,0.000054578148,0.010211742],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998436,0.000035110963,0.00027369685,0.00067393,0.0002453208,0.00033599063],"domain_scores_gemma":[0.99911964,0.00028440397,0.00011230142,0.0003465922,0.00005664436,0.00008039406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002496706,0.00025238667,0.0003160234,0.0005367262,0.0001313792,0.00012725638,0.0003954333,0.00031062128,0.00035032866],"category_scores_gemma":[0.000055567547,0.00024041433,0.000058848924,0.00021013743,0.00036591926,0.00010870406,0.00012384784,0.00071730406,0.000048840826],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014367025,0.000056885703,0.0005597307,0.000008331312,0.00001251708,0.00009117917,0.0038863271,0.004357441,0.000049915016,0.013822091,0.00064979715,0.9764914],"study_design_scores_gemma":[0.0017100807,0.00066572655,0.21916161,0.0007233774,0.00004559316,0.0003229818,0.00002006867,0.007610253,0.00014491896,0.69668263,0.0708896,0.0020231737],"about_ca_topic_score_codex":0.00014016849,"about_ca_topic_score_gemma":0.00080535526,"teacher_disagreement_score":0.97446823,"about_ca_system_score_codex":0.00010584714,"about_ca_system_score_gemma":0.00006973355,"threshold_uncertainty_score":0.9803812},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027834938,0.000083147796,0.9915679,0.0004779805,0.0006862569,0.0002601648,0.0000066375237,0.0035874438,0.003302604],"genre_scores_gemma":[0.44757575,0.000004106849,0.55102074,0.00074890116,0.00028163116,0.000011893471,0.00001195103,0.000028834795,0.00031620738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99541485,0.000040846655,0.0005296732,0.0019854899,0.0013848165,0.0006443147],"domain_scores_gemma":[0.99537015,0.0015624948,0.00037235994,0.0022373404,0.0003092406,0.00014842697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011382453,0.0005796823,0.00058999844,0.002595135,0.00031490743,0.0006674527,0.0031482638,0.00035304893,0.000012035245],"category_scores_gemma":[0.0004411758,0.000542774,0.0002576946,0.0024272955,0.00049900945,0.00038017056,0.0005552477,0.0008363771,0.000029948462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006337731,0.000120572884,0.0025629988,0.000033409906,0.000027461789,0.00015877307,0.0001189528,0.46908945,0.00007133067,0.001880533,0.0007348878,0.5251953],"study_design_scores_gemma":[0.000105742,0.00023125,0.0009843732,0.0002708552,0.00004234145,0.000036632093,6.8798025e-9,0.870444,0.0009307788,0.12615424,0.00017191446,0.00062784366],"about_ca_topic_score_codex":0.00015408017,"about_ca_topic_score_gemma":0.000040825893,"teacher_disagreement_score":0.5245675,"about_ca_system_score_codex":0.00042319068,"about_ca_system_score_gemma":0.00045855978,"threshold_uncertainty_score":0.9997024},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018450337,0.00016160191,0.9929718,0.0024002986,0.0013582483,0.0007044588,0.00001596195,0.00047008132,0.0018990918],"genre_scores_gemma":[0.01771362,0.00004334854,0.9795344,0.0019464359,0.00035145154,0.00004595603,0.000028612321,0.000039141978,0.00029707514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963906,0.000024311785,0.0005963006,0.0016496764,0.00070530124,0.0006338099],"domain_scores_gemma":[0.9969907,0.00039367887,0.00041975948,0.0018130179,0.0002825348,0.00010032301],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084493577,0.00047250264,0.00045578636,0.00090117875,0.00029416152,0.00056321715,0.003204187,0.00038064245,0.00001653465],"category_scores_gemma":[0.000084943546,0.00047201876,0.00014027022,0.00044323513,0.00055042084,0.001035952,0.00071731623,0.0006000606,0.000030958356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040641507,0.000009360334,0.000010075347,0.000024919198,0.000005712478,0.0000048740058,0.0001417373,0.0010700143,0.0008387211,0.027908286,0.000082587765,0.96989965],"study_design_scores_gemma":[0.0003048145,0.00010517334,0.000059218422,0.00029477567,0.000009185385,0.0000753167,1.084802e-7,0.6170965,0.007823526,0.3583886,0.015099795,0.000743011],"about_ca_topic_score_codex":0.000004387571,"about_ca_topic_score_gemma":0.00004983678,"teacher_disagreement_score":0.9691566,"about_ca_system_score_codex":0.00053891476,"about_ca_system_score_gemma":0.00033534938,"threshold_uncertainty_score":0.99977314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059517955,0.00042896802,0.9959726,0.00052140554,0.0014323759,0.00045375968,0.0000015476998,0.0004359297,0.00069391174],"genre_scores_gemma":[0.020858772,0.000040882627,0.9774858,0.00088120974,0.00026889087,0.000012483585,0.0000031374625,0.000034425517,0.00041444416],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635434,0.00007402362,0.00042336382,0.0013364166,0.0011377312,0.00067413994],"domain_scores_gemma":[0.9965102,0.0013018434,0.00032697208,0.0014949081,0.0002627444,0.000103308645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011407504,0.0005364682,0.00044129236,0.00046235055,0.00034123327,0.00035878096,0.002871685,0.00018792406,0.0000063260277],"category_scores_gemma":[0.0003912775,0.00036726255,0.0000786537,0.0008095423,0.00069859554,0.00092066376,0.0006835973,0.000822565,0.00001512647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008107484,0.000010524643,0.000028605538,0.000012008066,0.000011764118,0.00007463402,0.00071079336,0.3156414,0.0001394076,0.03137039,0.000008236958,0.6519841],"study_design_scores_gemma":[0.0016243155,0.0015725037,0.0030757308,0.0021560714,0.000053056247,0.0004096358,0.000002506554,0.30935884,0.009434828,0.65798986,0.01094612,0.0033765296],"about_ca_topic_score_codex":0.000005039492,"about_ca_topic_score_gemma":0.00001553669,"teacher_disagreement_score":0.6486076,"about_ca_system_score_codex":0.00040567206,"about_ca_system_score_gemma":0.0002647992,"threshold_uncertainty_score":0.9998779},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101889615,0.0006496477,0.9965322,0.00021780435,0.00079447025,0.00022029325,0.0000098316195,0.0000562358,0.0014176263],"genre_scores_gemma":[0.70514685,0.003029402,0.28268912,0.0028788587,0.0028486685,0.000022673312,0.00017725729,0.00013466687,0.003072525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977414,0.000028633282,0.000499671,0.0007512999,0.00067834905,0.00030062755],"domain_scores_gemma":[0.9987258,0.00012966138,0.00031639382,0.0005506156,0.00017382826,0.00010373124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005293493,0.00027149875,0.0003859128,0.00056360627,0.000106055646,0.00045855655,0.0011314448,0.00012752085,0.000017466024],"category_scores_gemma":[0.000021615677,0.000249126,0.00004463484,0.0004544193,0.00035581898,0.00054762175,0.0005984405,0.00018098537,0.000008064143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033211404,0.000047966143,0.0009357452,0.00014749805,0.000025335128,0.000042502554,0.0010257596,0.0073267967,0.00010580635,0.34797615,0.00027230257,0.6420908],"study_design_scores_gemma":[0.0003661129,0.0003033369,0.00025811023,0.00035676896,0.000015062258,0.00007164529,0.0000020108616,0.9504919,0.0007510699,0.025160436,0.021651557,0.00057195476],"about_ca_topic_score_codex":0.000105414656,"about_ca_topic_score_gemma":0.000052568364,"teacher_disagreement_score":0.9431651,"about_ca_system_score_codex":0.00007256065,"about_ca_system_score_gemma":0.00018441076,"threshold_uncertainty_score":0.9999961},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07255547,0.046029765,0.76821244,0.020248942,0.024951467,0.021504756,0.0030198575,0.0015920892,0.04188524],"genre_scores_gemma":[0.93137544,0.0018964624,0.0227969,0.004698224,0.018274978,0.00043181377,0.0024017957,0.00004429128,0.018080093],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971712,0.000034608383,0.00038488134,0.0010794828,0.00056941004,0.0007604187],"domain_scores_gemma":[0.9985939,0.0006924081,0.00018367001,0.00021071384,0.00014668734,0.00017259078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008027445,0.0003885312,0.0004864501,0.00009576205,0.00029560947,0.00026473418,0.0014927768,0.0005028573,0.000034538],"category_scores_gemma":[0.00002897778,0.00016214178,0.0001458831,0.00024090355,0.0004854193,0.000079751306,0.0003353327,0.0005144055,0.000049391896],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061169174,0.0001771667,0.0009930646,0.00021945465,0.00012218101,0.00033850447,0.00032428358,0.016470352,0.08540525,0.008407178,0.0022938144,0.88463706],"study_design_scores_gemma":[0.0013272671,0.0020102009,0.0007280772,0.0013329815,0.000049152,0.0006163021,0.0000013557309,0.11574541,0.007304466,0.010968387,0.8569667,0.0029497438],"about_ca_topic_score_codex":0.00014283306,"about_ca_topic_score_gemma":0.00061279413,"teacher_disagreement_score":0.8816873,"about_ca_system_score_codex":0.00014371487,"about_ca_system_score_gemma":0.00008814622,"threshold_uncertainty_score":0.661195},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1127241,0.007672845,0.8517787,0.0005553531,0.0015097281,0.0031345491,0.0000621487,0.000021815342,0.022540765],"genre_scores_gemma":[0.94849193,0.00013548808,0.050402403,0.00023045125,0.00022492828,0.000007536965,0.00001063627,0.000030506528,0.00046613356],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998358,0.000020309235,0.00039238876,0.0005036391,0.00043418875,0.00029146264],"domain_scores_gemma":[0.9989654,0.00002300352,0.00023565981,0.0006237559,0.00011489378,0.000037289086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006073967,0.00021656645,0.00026237732,0.00022243055,0.000029508596,0.000011216096,0.0008189405,0.00021414387,0.000011822327],"category_scores_gemma":[0.000016404954,0.00016591573,0.00012451556,0.00022128403,0.0005400715,0.0000030848107,0.00052850123,0.00020403657,0.0000011959858],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059573325,0.00015574064,0.0061027138,0.0002865845,0.0000817727,0.000013547387,0.00074991287,0.016976362,0.46667987,0.00069873786,0.000039068902,0.5081561],"study_design_scores_gemma":[0.0020481823,0.0014763164,0.018309092,0.0015837428,0.00007228156,0.000040509156,0.0000031614666,0.003065412,0.92690283,0.024231622,0.02075013,0.0015166887],"about_ca_topic_score_codex":0.000029070909,"about_ca_topic_score_gemma":0.00023140534,"teacher_disagreement_score":0.8357678,"about_ca_system_score_codex":0.00004764201,"about_ca_system_score_gemma":0.00017848235,"threshold_uncertainty_score":0.6765847},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048234444,0.00038702777,0.9933737,0.0003624819,0.00015152148,0.00044885918,0.0000056400995,0.000030527208,0.00041681802],"genre_scores_gemma":[0.6669034,0.00013934363,0.33265743,0.00019347791,0.000036116806,0.000010639401,0.000010485111,0.00000891671,0.000040221323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978868,0.000034532917,0.00062751106,0.00057537487,0.0005665671,0.00030921766],"domain_scores_gemma":[0.99863356,0.00008466137,0.00039111948,0.00069594884,0.0001308432,0.00006385721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092440797,0.00024536395,0.00032080876,0.0006181791,0.00010559741,0.00013935621,0.0010635979,0.00014028746,0.0000066695416],"category_scores_gemma":[0.000021678237,0.000233717,0.000050198967,0.00026139998,0.00016493569,0.00094699394,0.00077713147,0.0002576682,0.0000020922828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007706584,0.000047620193,0.0002956049,0.00008432496,0.000009528036,0.0000021206183,0.003624305,0.08028242,0.0011171642,0.039338432,0.0000060656994,0.8751847],"study_design_scores_gemma":[0.00043974744,0.000053273205,0.0007296498,0.00026141581,0.0000037132397,0.000005453682,6.760521e-7,0.9836313,0.0023658318,0.012167562,0.00011935781,0.00022200035],"about_ca_topic_score_codex":0.000092609145,"about_ca_topic_score_gemma":0.00032807706,"teacher_disagreement_score":0.9033489,"about_ca_system_score_codex":0.00023565111,"about_ca_system_score_gemma":0.00021086313,"threshold_uncertainty_score":0.9530703},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052178185,0.0005435934,0.9872953,0.0011320587,0.002741857,0.0012943624,0.0000068598547,0.00039446322,0.006069703],"genre_scores_gemma":[0.61359483,0.00013799494,0.37350723,0.008703794,0.0022803354,0.0001208284,0.000034639008,0.00016358029,0.0014567814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99364525,0.00011572145,0.0008180205,0.002727999,0.0015417151,0.0011512743],"domain_scores_gemma":[0.9962885,0.0005010254,0.0005347583,0.0022973719,0.000087474386,0.0002908652],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010976315,0.000869442,0.000722918,0.0008612213,0.00028729075,0.0010118613,0.0059869145,0.00038134595,0.00012280392],"category_scores_gemma":[0.000074803625,0.0008470311,0.00022189446,0.00086954806,0.00040973397,0.000653406,0.0030942205,0.0014610146,0.00015409545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009202781,0.00005018261,0.00011751934,0.00003680883,0.000047906637,0.00086518924,0.0011154357,0.043819923,0.0000453637,0.003572396,0.00056203635,0.94975805],"study_design_scores_gemma":[0.00063147245,0.0003365351,0.0004210662,0.0010480745,0.000029914663,0.0000767928,5.4044847e-7,0.9087761,0.0011395661,0.057925973,0.028103301,0.001510635],"about_ca_topic_score_codex":0.00030031725,"about_ca_topic_score_gemma":0.00027751343,"teacher_disagreement_score":0.9482474,"about_ca_system_score_codex":0.00099889,"about_ca_system_score_gemma":0.00029408425,"threshold_uncertainty_score":0.99939805},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7595605,0.000007908808,0.23655467,0.00017687517,0.0021716477,0.00039783638,0.000004442182,0.00008441042,0.0010416667],"genre_scores_gemma":[0.9911811,0.000063263185,0.003215254,0.0042374306,0.0010197095,0.0000046824143,0.0000018387365,0.00003826757,0.00023846157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583966,0.00005697075,0.0005389745,0.0017161337,0.0010634515,0.0007848278],"domain_scores_gemma":[0.9988191,0.00019403076,0.00022937273,0.00056700094,0.000053940126,0.00013652968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006472534,0.0004585966,0.00041782093,0.0011523872,0.00029970246,0.00028911416,0.0010149265,0.00028280422,0.000083910636],"category_scores_gemma":[0.00018274042,0.00043656834,0.000093980816,0.00076325063,0.0010007784,0.0011966968,0.00049832306,0.0009989733,0.000080633945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002188921,0.00007016246,0.00009127154,0.000022813614,4.6756855e-7,0.00008976372,0.001269619,0.021112856,0.447464,0.00078930514,0.0000021283386,0.5290657],"study_design_scores_gemma":[0.00053924887,0.0003701792,0.0045176013,0.0009404032,0.000008239716,0.00033089338,8.209769e-7,0.95710737,0.032086264,0.0016668948,0.0013802127,0.0010518581],"about_ca_topic_score_codex":0.000012837002,"about_ca_topic_score_gemma":0.000034321944,"teacher_disagreement_score":0.9359945,"about_ca_system_score_codex":0.0005179934,"about_ca_system_score_gemma":0.0003251169,"threshold_uncertainty_score":0.9998086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034470228,0.00057775003,0.997185,0.00029096706,0.001032799,0.000272148,0.000022305176,0.00033671013,0.00024787697],"genre_scores_gemma":[0.087954745,0.00005371912,0.9112117,0.00044065012,0.0002097332,0.000009112816,0.0000054112575,0.00002672615,0.000088189045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582726,0.00007319952,0.00074360234,0.0015394124,0.001107376,0.0007091626],"domain_scores_gemma":[0.9945142,0.0024675594,0.00044540805,0.002058593,0.00035237928,0.00016184081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015045033,0.00059127674,0.001240067,0.0019362734,0.00010977166,0.00017091128,0.004155432,0.00034964667,0.00001824901],"category_scores_gemma":[0.000755853,0.00054461206,0.00035613545,0.002236405,0.0008735505,0.00062049134,0.00085467455,0.0007689887,0.000010734333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002024168,0.0000075162357,0.0000466668,0.000011222005,0.000066832414,0.000022000368,0.00012904212,0.5835305,0.00010239847,0.0045450022,9.4669025e-7,0.41153586],"study_design_scores_gemma":[0.00019820017,0.00009898044,0.00034996233,0.00012437653,0.000106207975,0.000014418346,4.1138563e-8,0.943406,0.0010441499,0.053823974,0.00023784551,0.00059587666],"about_ca_topic_score_codex":0.000015023775,"about_ca_topic_score_gemma":0.00006544457,"teacher_disagreement_score":0.41094,"about_ca_system_score_codex":0.00034406455,"about_ca_system_score_gemma":0.00032184026,"threshold_uncertainty_score":0.99970055},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008492821,0.00061499595,0.98905385,0.0028393774,0.00068387686,0.00048821527,0.0000029175299,0.00014136583,0.0061669373],"genre_scores_gemma":[0.19674778,0.00020582732,0.7961034,0.0048346766,0.00096160575,0.00001406034,0.000008836667,0.000059053426,0.0010647642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966971,0.00006236346,0.000343654,0.0013860787,0.0008567875,0.00065400364],"domain_scores_gemma":[0.99784404,0.00037007596,0.00017924375,0.0009903845,0.00023509556,0.00038115907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009377858,0.00043074216,0.00039628483,0.0004991499,0.00027531738,0.0008270571,0.00173984,0.00023948109,0.000055794026],"category_scores_gemma":[0.00014525847,0.00037679932,0.000068499845,0.0005692861,0.0005890305,0.00049164233,0.0011706472,0.00085726444,0.00004343891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001008073,0.000030077039,0.00006651702,0.00003067828,0.00001059941,0.000024000954,0.0024997795,0.03033859,0.000005418639,0.4165588,0.00010568436,0.5503198],"study_design_scores_gemma":[0.00037884014,0.00021764789,0.000119172924,0.00048454647,0.000008678997,0.000055832657,8.8075194e-7,0.54346186,0.00007417602,0.44899613,0.005423458,0.0007787851],"about_ca_topic_score_codex":0.000075065975,"about_ca_topic_score_gemma":0.00010335628,"teacher_disagreement_score":0.549541,"about_ca_system_score_codex":0.0005203941,"about_ca_system_score_gemma":0.00060758466,"threshold_uncertainty_score":0.9998684},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016193841,0.00010266652,0.99709374,0.00016947452,0.00044579347,0.00012150158,0.000011909624,0.00007222791,0.001820772],"genre_scores_gemma":[0.53542054,0.000072806346,0.46355528,0.00060500327,0.00017297346,0.0000013965034,0.000016156251,0.00002161865,0.00013421894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972188,0.000024266415,0.00044553628,0.00089538586,0.0010807236,0.00033531527],"domain_scores_gemma":[0.99823743,0.00020628501,0.0002761358,0.0007693469,0.00039230255,0.00011851416],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038956187,0.0003184828,0.00042894107,0.00072504755,0.0001706127,0.00016675115,0.0021143577,0.00016965032,0.000014402766],"category_scores_gemma":[0.00006127669,0.00031237592,0.00011471451,0.0005011689,0.00048345554,0.00061676407,0.0008936708,0.00039763836,0.000016075233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028086165,0.000036239166,0.000010076367,0.00003395223,0.0000070647357,0.000023952529,0.0004441293,0.84644747,0.00001581291,0.02025168,0.00002262158,0.13270417],"study_design_scores_gemma":[0.0001418865,0.00006228167,0.000020662694,0.0001409086,0.0000062331355,0.000046017205,8.269976e-8,0.96549267,0.00018953069,0.03344695,0.00015254163,0.00030022283],"about_ca_topic_score_codex":0.000018253339,"about_ca_topic_score_gemma":0.00001024236,"teacher_disagreement_score":0.5352586,"about_ca_system_score_codex":0.0001279934,"about_ca_system_score_gemma":0.0007147556,"threshold_uncertainty_score":0.9999328},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073221495,0.00050265394,0.9950614,0.00031387262,0.0011256486,0.0011742446,0.000019565869,0.00028827557,0.00078211393],"genre_scores_gemma":[0.10538341,0.00028309348,0.8914587,0.0022893292,0.00031092847,0.00003761675,0.000042003827,0.000064498396,0.00013042231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956842,0.000058653914,0.0008720037,0.0014037666,0.0012876285,0.00069373345],"domain_scores_gemma":[0.9967559,0.0010372234,0.0004961033,0.0006957847,0.0007333685,0.00028165165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026102336,0.0005757922,0.0007229261,0.001057137,0.0003705285,0.0009123075,0.001736127,0.0003957285,0.00003111489],"category_scores_gemma":[0.00019062491,0.0005132198,0.00013518003,0.0005570336,0.0006771066,0.00074240746,0.0011409739,0.0005517516,0.000004807535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014958803,0.00021532971,0.000053322587,0.00031024174,0.00009451651,0.00009193345,0.0039408994,0.022456357,0.0005123397,0.06949687,0.000060756607,0.9026179],"study_design_scores_gemma":[0.0010516539,0.00037314315,0.000015486647,0.0004228544,0.000013576527,0.00004106326,0.0000010303631,0.9561335,0.005751999,0.034946535,0.0007008805,0.0005483041],"about_ca_topic_score_codex":0.000043528387,"about_ca_topic_score_gemma":0.00012840857,"teacher_disagreement_score":0.93367714,"about_ca_system_score_codex":0.0002210401,"about_ca_system_score_gemma":0.00054615055,"threshold_uncertainty_score":0.99973196},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009233407,0.0011890563,0.99034065,0.0013312169,0.000306284,0.00025410944,0.0000036890685,0.00019005968,0.0062926225],"genre_scores_gemma":[0.2275529,0.00035959348,0.7648344,0.00387293,0.00072228344,0.000020633299,0.000018792487,0.00005340189,0.0025650575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975377,0.000011809404,0.000313425,0.0012040596,0.0005215569,0.00041150086],"domain_scores_gemma":[0.99823964,0.00019608167,0.00015108986,0.0011737775,0.00008535734,0.00015408314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033140022,0.00035726212,0.000339029,0.00043443646,0.00024727205,0.0004908928,0.0021068652,0.00021002677,0.000012735215],"category_scores_gemma":[0.000021827562,0.00033221047,0.000072257964,0.00035576176,0.00043131117,0.00036476259,0.0008657096,0.00045472189,0.00004840837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.188761e-7,0.0000136641,0.000008588389,0.000011398889,0.0000027005126,0.000025246478,0.00021044041,0.0005882759,0.00022135575,0.049584813,0.00005844551,0.9492745],"study_design_scores_gemma":[0.00026968677,0.0001372827,0.00093597494,0.0002492587,0.000010375654,0.00020226349,8.570026e-8,0.50125325,0.001536795,0.4587021,0.035768624,0.00093432434],"about_ca_topic_score_codex":0.000012113208,"about_ca_topic_score_gemma":0.000024353398,"teacher_disagreement_score":0.9483401,"about_ca_system_score_codex":0.00009862894,"about_ca_system_score_gemma":0.0002278141,"threshold_uncertainty_score":0.999913},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037903612,0.0006842496,0.98725766,0.00040902197,0.0019943933,0.00032680327,0.0000013072146,0.0009098872,0.008037664],"genre_scores_gemma":[0.38091093,0.00006874951,0.6170098,0.0013617456,0.0002738894,0.0000147020355,0.0000035595042,0.000048868624,0.00030771585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957031,0.000056426918,0.00068155635,0.0017591915,0.00082058366,0.0009791113],"domain_scores_gemma":[0.99727476,0.00041863148,0.00031135004,0.0016648164,0.00016419389,0.00016623402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010865027,0.0006187173,0.0007408394,0.0011930204,0.00018124483,0.0004150918,0.0044231606,0.0004996032,0.000027919687],"category_scores_gemma":[0.00017288336,0.0005485569,0.0001359862,0.0008743334,0.00069520914,0.00070802384,0.0017666565,0.0009234001,0.00011830119],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012447359,0.00007770362,0.0010981613,0.00007426852,0.000019258357,0.0009530279,0.0033841606,0.006359931,0.00018182688,0.07460994,0.00006900896,0.91316026],"study_design_scores_gemma":[0.00028817874,0.00013428532,0.00305605,0.0006492797,0.0000057403354,0.00018152397,2.3942206e-7,0.8023473,0.0007653372,0.19129714,0.00048099045,0.00079394085],"about_ca_topic_score_codex":0.00025176807,"about_ca_topic_score_gemma":0.00041591888,"teacher_disagreement_score":0.91236633,"about_ca_system_score_codex":0.00028755039,"about_ca_system_score_gemma":0.00047454078,"threshold_uncertainty_score":0.9996966},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007565728,0.00012090723,0.99543065,0.0012377268,0.0013293254,0.0011838556,0.000015024019,0.00021334729,0.00039348452],"genre_scores_gemma":[0.5859043,0.000013174433,0.41148385,0.0022595802,0.0001844647,0.00006101256,0.000017330745,0.000029282703,0.000047020512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966868,0.000027691949,0.0006332279,0.0011792862,0.00085194,0.0006210639],"domain_scores_gemma":[0.996591,0.00058120646,0.00044875816,0.0011776207,0.0010342492,0.00016719094],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00064038276,0.0006060678,0.0005435174,0.00082914194,0.00032933627,0.0017673096,0.004584177,0.00030889732,0.000010717651],"category_scores_gemma":[0.00006492562,0.00051062775,0.00009968323,0.0007383564,0.0007361561,0.004297901,0.0010093359,0.00060340966,0.00004181492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010899223,0.00005731706,0.000041521547,0.00029366772,0.00004956758,0.000010765078,0.0034221665,0.54361856,0.0000073084766,0.047287587,0.00007950471,0.40502304],"study_design_scores_gemma":[0.0011396462,0.0013363045,0.00009814632,0.0023454495,0.000023766564,0.000051584568,0.0000019603294,0.8186823,0.0054140864,0.16827516,0.0013616154,0.0012699678],"about_ca_topic_score_codex":0.00008098182,"about_ca_topic_score_gemma":0.00021385663,"teacher_disagreement_score":0.5858286,"about_ca_system_score_codex":0.0006228696,"about_ca_system_score_gemma":0.001277578,"threshold_uncertainty_score":0.9997345},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030561564,0.000088188164,0.99064404,0.0005884178,0.00090672204,0.0005004704,0.000031749827,0.00017879301,0.0040054535],"genre_scores_gemma":[0.81983656,0.000036528734,0.17599992,0.0030699968,0.00046319544,0.00002818805,0.00015043851,0.000055789802,0.00035937107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573493,0.000060489027,0.0005514932,0.0017186408,0.0012624966,0.00067192444],"domain_scores_gemma":[0.99746853,0.00023666534,0.00026962676,0.001648023,0.0001701899,0.00020695545],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00064845185,0.00054251775,0.00043198164,0.0008536647,0.00042696696,0.0010508844,0.00319283,0.00028817836,0.00006412042],"category_scores_gemma":[0.000018174846,0.0005157566,0.00014072923,0.00070916774,0.0004329588,0.0009864507,0.0004937818,0.0006650765,0.00007007778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023306826,0.00040842767,0.00022693154,0.00004409772,0.000027926082,0.00011548748,0.003300656,0.1005142,0.0020031268,0.177685,0.0025705462,0.7130803],"study_design_scores_gemma":[0.00072687515,0.0009605867,0.00019626794,0.00019043041,0.000012169391,0.00004435633,8.0883297e-7,0.7843464,0.002331777,0.19958404,0.010313926,0.0012923494],"about_ca_topic_score_codex":0.0004754526,"about_ca_topic_score_gemma":0.0005252103,"teacher_disagreement_score":0.8167804,"about_ca_system_score_codex":0.00024993217,"about_ca_system_score_gemma":0.0003354992,"threshold_uncertainty_score":0.9999861},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047018526,0.0002793957,0.9944923,0.00089036993,0.00197815,0.00048481527,0.000023099146,0.00022260437,0.0015822776],"genre_scores_gemma":[0.8985081,0.00007552009,0.10069197,0.00031455077,0.00026995907,0.000016499254,0.000024796043,0.000023293385,0.00007536368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654293,0.000064759086,0.00075348583,0.0011975333,0.0007560634,0.00068522536],"domain_scores_gemma":[0.9982131,0.00031693414,0.00030287445,0.00076959765,0.00022126328,0.00017619543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008258444,0.00044759968,0.00047203898,0.0010809827,0.00027966325,0.0005757432,0.0009367912,0.0003865401,0.000044820517],"category_scores_gemma":[0.00007596913,0.00046803086,0.000101125064,0.00079477846,0.00081671425,0.0008453999,0.00045573813,0.00089482457,0.000041439627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015499055,0.000008675924,0.00016791685,0.000010982499,0.0000038202506,0.000022886526,0.00012800911,0.4827621,0.000015040819,0.032878883,0.0000076224605,0.48399252],"study_design_scores_gemma":[0.00032705435,0.00004466823,0.002030897,0.00039550973,0.0000052007563,0.00017437019,0.0000014176991,0.98810464,0.00003413181,0.0077487486,0.00061519316,0.00051818055],"about_ca_topic_score_codex":0.00022094224,"about_ca_topic_score_gemma":0.0018406572,"teacher_disagreement_score":0.89846104,"about_ca_system_score_codex":0.001345048,"about_ca_system_score_gemma":0.00078287965,"threshold_uncertainty_score":0.99977714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017699416,0.00008964791,0.98231745,0.0032922379,0.00028985026,0.000299622,0.0000015796895,0.00006120052,0.013471441],"genre_scores_gemma":[0.9125215,0.0001543337,0.07773663,0.007793893,0.00051433477,0.000028520693,0.0000048516767,0.00003188098,0.0012140882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997745,0.00003372102,0.00035858,0.00077198155,0.00072885473,0.00036189894],"domain_scores_gemma":[0.9977896,0.0007990861,0.00029437387,0.0009275626,0.00012111941,0.000068262285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005208537,0.00028129152,0.00028645707,0.00021720293,0.00031280017,0.00021394863,0.0029044768,0.000098261226,0.000059138103],"category_scores_gemma":[0.000031661588,0.00018747585,0.00009437383,0.00054741174,0.00062048016,0.0001436473,0.00070342753,0.00062487257,0.000022553862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013380277,0.000016415404,0.000017248307,0.0000063862753,0.0000051300703,0.000009413974,0.0001458322,0.18174958,0.00027341582,0.51573366,0.000097762386,0.3019438],"study_design_scores_gemma":[0.000057797875,0.00013994705,0.00006356931,0.00015408618,0.0000024386982,0.0000070138485,1.3210547e-7,0.6012672,0.0005769954,0.39406067,0.003448816,0.00022131932],"about_ca_topic_score_codex":0.000024093588,"about_ca_topic_score_gemma":0.000020053589,"teacher_disagreement_score":0.91234446,"about_ca_system_score_codex":0.00008474551,"about_ca_system_score_gemma":0.00013054028,"threshold_uncertainty_score":0.7645043},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020800908,0.00007434853,0.9961915,0.00018188405,0.0016321084,0.00093955355,0.000012671156,0.00014654515,0.00061335665],"genre_scores_gemma":[0.1873505,0.0000033199503,0.80962133,0.00217414,0.00049949146,0.000051372077,0.000037744332,0.000052382013,0.00020972722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961737,0.00006417846,0.00057827757,0.0017112686,0.0008239264,0.0006486675],"domain_scores_gemma":[0.9974698,0.00031208296,0.0004268067,0.0013611849,0.00023969056,0.00019043981],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011901541,0.00050550967,0.0004819919,0.00060811086,0.00034130565,0.000604137,0.0023017342,0.0003058351,0.000008886455],"category_scores_gemma":[0.00007781566,0.00046218536,0.00016126734,0.00033196775,0.000121557605,0.0006500173,0.00026972027,0.00039346464,0.0000072208995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010217762,0.00022242745,0.0010862873,0.0004995336,0.000027148097,0.000027815702,0.0019380096,0.27319017,0.0006402041,0.03106189,0.000074395626,0.6912219],"study_design_scores_gemma":[0.00044145665,0.00016977727,0.00019048223,0.00023475593,0.0000058978308,0.000013109294,2.8771288e-7,0.9898464,0.0012718132,0.006394549,0.00084365334,0.0005877882],"about_ca_topic_score_codex":0.000029814024,"about_ca_topic_score_gemma":0.000028879424,"teacher_disagreement_score":0.71665627,"about_ca_system_score_codex":0.00026335966,"about_ca_system_score_gemma":0.00027242588,"threshold_uncertainty_score":0.999783},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010274115,0.0005931534,0.9266266,0.00032336815,0.0014069434,0.00033139257,0.000008183158,0.0001362539,0.07047135],"genre_scores_gemma":[0.5394505,0.000036147663,0.45559236,0.0015009682,0.0004621614,0.000010188861,0.000011836756,0.000042559135,0.0028932432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99535185,0.000039782248,0.00072313653,0.0016771196,0.0014751179,0.00073302194],"domain_scores_gemma":[0.9971249,0.00043005456,0.0005465587,0.0011179677,0.0005337039,0.00024679178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008953998,0.00055285793,0.00070840394,0.0011121603,0.00029822407,0.00045045113,0.0038468852,0.0003256778,0.00014404014],"category_scores_gemma":[0.00016454118,0.00049106264,0.00024778725,0.0010978233,0.0015365015,0.0005074326,0.0013343574,0.00063488074,0.00017285692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005996036,0.00014978819,0.00015327605,0.00007493301,0.000025550395,0.00029912553,0.0016643135,0.026208898,0.000047938636,0.6032732,0.00016653334,0.36793047],"study_design_scores_gemma":[0.0004124634,0.0003742802,0.00050493097,0.00038996976,0.000012071201,0.00033518835,2.1334293e-7,0.43558893,0.0002508723,0.55827904,0.0030987714,0.0007532971],"about_ca_topic_score_codex":0.000031626667,"about_ca_topic_score_gemma":0.00004795082,"teacher_disagreement_score":0.53934777,"about_ca_system_score_codex":0.00023260272,"about_ca_system_score_gemma":0.00092511065,"threshold_uncertainty_score":0.99975413},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012611807,0.00051480357,0.9972161,0.0003451376,0.00036013013,0.0003008535,0.000004172582,0.00015696435,0.00097570295],"genre_scores_gemma":[0.25696224,0.000117171694,0.73490083,0.0029628263,0.004315079,0.0000810817,0.00006115814,0.00014767778,0.00045192117],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998036,0.0000013957438,0.00046578853,0.00072418066,0.00044725614,0.00032535175],"domain_scores_gemma":[0.99765563,0.00014746068,0.00055854453,0.0004300466,0.0011953117,0.00001302708],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059663784,0.0003552841,0.0005557314,0.00099646,0.000224533,0.00028917368,0.0009989005,0.00026250948,0.000025543686],"category_scores_gemma":[0.0004263146,0.00029793693,0.0001347235,0.0007044449,0.00038781294,0.0006764096,0.0003453544,0.00037349845,0.000005488399],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012254053,0.00003193317,0.00016170164,0.0027192165,0.000016217049,0.0000031634152,0.000079530415,0.004926738,0.00056063395,0.0014277664,0.000019430303,0.99004143],"study_design_scores_gemma":[0.00046108745,0.00005082365,0.000025423937,0.0048452797,0.0003180283,0.000008484266,0.0000011529295,0.2322889,0.018482246,0.6731767,0.06829433,0.002047539],"about_ca_topic_score_codex":0.00005933549,"about_ca_topic_score_gemma":0.00021531017,"teacher_disagreement_score":0.9879939,"about_ca_system_score_codex":0.000025456793,"about_ca_system_score_gemma":0.00021100217,"threshold_uncertainty_score":0.99994725},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000095527066,0.00033126143,0.99578166,0.0015254306,0.0005160653,0.0007770283,0.00014084073,0.00052769337,0.0003044847],"genre_scores_gemma":[0.044716746,0.00014118699,0.95403314,0.0007765161,0.000052383453,0.000046112433,0.00020413223,0.000024261391,0.0000055418873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553555,0.00007063452,0.0009312434,0.0014153143,0.0012248541,0.00082238036],"domain_scores_gemma":[0.99269336,0.0010132659,0.00047047358,0.0054822816,0.00021959562,0.0001209994],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012809112,0.0005883848,0.0005262602,0.0015751562,0.00026658885,0.00046669284,0.018707663,0.0004975676,0.000014494778],"category_scores_gemma":[0.006347862,0.000601084,0.000060983006,0.0010849731,0.00081170484,0.0031227642,0.022983791,0.0015599726,0.000028705186],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029942881,0.00010619885,0.00048428943,0.00043881443,0.0000149998505,0.00038032533,0.00059756404,0.0057264767,0.006014329,0.00608489,0.0068260087,0.97329617],"study_design_scores_gemma":[0.00041215908,0.00013290058,0.00007664845,0.0018461811,0.0000050670087,0.00015637549,7.6353e-7,0.78336275,0.110153176,0.100104704,0.0026671349,0.0010821258],"about_ca_topic_score_codex":0.00014008206,"about_ca_topic_score_gemma":0.00018131787,"teacher_disagreement_score":0.97221404,"about_ca_system_score_codex":0.00075233745,"about_ca_system_score_gemma":0.00094720686,"threshold_uncertainty_score":0.99964404},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041732125,0.00046428147,0.9970541,0.0004678355,0.00014730869,0.0009486667,0.0000037802577,0.000055811368,0.00044090018],"genre_scores_gemma":[0.7004236,0.00000460392,0.2992926,0.000077420234,0.00013686626,0.000041227348,0.0000022383776,0.0000073225074,0.000014155756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757844,0.000050641436,0.00045832075,0.00073596434,0.00083407975,0.00034252755],"domain_scores_gemma":[0.9984698,0.00018119613,0.0003248507,0.00075096154,0.00022443217,0.00004874922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006199106,0.0002634016,0.00029648916,0.00041938605,0.00018515933,0.00016890821,0.0016745724,0.00013493247,7.265357e-7],"category_scores_gemma":[0.000011288984,0.00018845923,0.000063907944,0.0007747173,0.00027457078,0.00025736645,0.00011775806,0.00033236615,0.0000030087413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007743924,0.00006915059,0.00008358797,0.00004267977,0.000005995536,0.000022175127,0.001096541,0.27702975,0.00003775882,0.10927462,0.0000013103172,0.6123287],"study_design_scores_gemma":[0.00034078874,0.00033614077,0.005290859,0.00041202182,0.000012863213,0.00010048231,0.000004143538,0.97350353,0.000018908695,0.019577362,0.00013969623,0.00026322922],"about_ca_topic_score_codex":0.00013339584,"about_ca_topic_score_gemma":0.00027601875,"teacher_disagreement_score":0.70000625,"about_ca_system_score_codex":0.0004967979,"about_ca_system_score_gemma":0.00048175664,"threshold_uncertainty_score":0.76851445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015638444,0.0002331334,0.9894223,0.0011925031,0.0014660713,0.00044916137,0.0000010392965,0.00040554506,0.006673818],"genre_scores_gemma":[0.0848318,0.000044800654,0.9107702,0.00079255947,0.0009497148,0.000018670826,0.0000065095805,0.00006227716,0.0025234625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956036,0.00013913319,0.00052391714,0.0017330436,0.0012299607,0.0007703212],"domain_scores_gemma":[0.99626654,0.0014896845,0.00044724514,0.00127959,0.00028344023,0.00023349859],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025159877,0.0006812806,0.0010966075,0.00075958425,0.0005377264,0.0008967719,0.0031874166,0.00041790362,0.00004673353],"category_scores_gemma":[0.0004231356,0.00049767917,0.00021088307,0.0005719791,0.0015010197,0.00049728755,0.0011001292,0.0036121309,0.00006320978],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033244153,0.000033715198,0.00014122526,0.000048591453,0.00003613338,0.00020238958,0.0012790945,0.03750395,0.000111704,0.025487894,0.0000037947884,0.93481904],"study_design_scores_gemma":[0.011544774,0.0003191749,0.000044601773,0.00038901495,0.000022862134,0.00021811902,1.4128321e-7,0.8724664,0.00077973993,0.10991143,0.0032075893,0.0010961819],"about_ca_topic_score_codex":0.00009492955,"about_ca_topic_score_gemma":0.00008049927,"teacher_disagreement_score":0.9337229,"about_ca_system_score_codex":0.00009810515,"about_ca_system_score_gemma":0.0005049471,"threshold_uncertainty_score":0.99974746},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010780715,0.0005429125,0.99345165,0.00076532504,0.0016337666,0.0007006654,0.000006906829,0.0001597165,0.002631255],"genre_scores_gemma":[0.7070322,0.000023504821,0.2906848,0.00069088174,0.00089242443,0.000046874276,0.0000032700655,0.000045639346,0.0005804106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970261,0.00007260411,0.00053896836,0.0011759303,0.0006214577,0.0005649304],"domain_scores_gemma":[0.99615484,0.002539412,0.00019527743,0.00071155856,0.00021819475,0.0001806923],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012062751,0.0004185054,0.00048474284,0.00046562275,0.00037060314,0.0011430592,0.00045840107,0.0002627037,0.000041901214],"category_scores_gemma":[0.00038810025,0.00036798968,0.00010952971,0.0001627687,0.0005906505,0.00031815364,0.00028712297,0.0006624926,0.000020804764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005991834,0.000016306569,0.000007850041,0.000056704837,0.00001056961,0.00012713404,0.00063861324,0.027650896,0.00012281511,0.94121003,0.000010493312,0.030142618],"study_design_scores_gemma":[0.00023591578,0.00021949619,0.00000715046,0.00073035766,0.000013431011,0.00028150954,0.0000015661277,0.8982994,0.0009839605,0.08877354,0.009899054,0.0005546052],"about_ca_topic_score_codex":0.000018509581,"about_ca_topic_score_gemma":0.000008984655,"teacher_disagreement_score":0.8706485,"about_ca_system_score_codex":0.00021388169,"about_ca_system_score_gemma":0.00065286417,"threshold_uncertainty_score":0.99989384},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01900624,0.09965658,0.8134171,0.012070873,0.005503366,0.011013503,0.00030432825,0.00067432225,0.038353693],"genre_scores_gemma":[0.987816,0.000054713717,0.011040693,0.000445835,0.0003580477,0.00003860752,0.00012287167,0.000048427966,0.00007483439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973601,0.000027382752,0.0003146491,0.00093300635,0.0008148564,0.00054999045],"domain_scores_gemma":[0.99810266,0.00023500717,0.000096171,0.00074960256,0.00022008616,0.00059646793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031505383,0.00039744162,0.00042124168,0.0009919617,0.0001225685,0.00008925704,0.00042451397,0.00023333747,0.00012326814],"category_scores_gemma":[0.000118382035,0.00032433146,0.0001438197,0.00033657707,0.00082372676,0.00015217016,0.00020000097,0.0008613463,0.000114453476],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067167677,0.0015324203,0.015803276,0.0003194902,0.0006103056,0.0028494366,0.0005252133,0.0012334789,0.00012297918,0.0017197819,0.00003581785,0.9745761],"study_design_scores_gemma":[0.018389381,0.0029636296,0.226922,0.012040306,0.0034364522,0.00014287705,0.000001845564,0.49670523,0.012366694,0.21761964,0.004579187,0.0048327595],"about_ca_topic_score_codex":0.000032002343,"about_ca_topic_score_gemma":0.0002734024,"teacher_disagreement_score":0.9697434,"about_ca_system_score_codex":0.0002730447,"about_ca_system_score_gemma":0.002055602,"threshold_uncertainty_score":0.99992085},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000088317,0.0004918701,0.9967305,0.00048797947,0.0007908557,0.0005315068,0.0000096587155,0.0004957312,0.00037355736],"genre_scores_gemma":[0.05181538,0.0000055071455,0.94626063,0.0014304346,0.00036916364,0.00003420263,0.000022948096,0.00002041361,0.00004132433],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974175,0.000012832464,0.0005251387,0.0007752895,0.0007649862,0.0005042632],"domain_scores_gemma":[0.9978337,0.00035989357,0.00041620928,0.00078336446,0.0004982262,0.00010859383],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008234332,0.00038137077,0.0003286705,0.00071500504,0.00039951058,0.0010762392,0.0023491762,0.00042349403,0.0000072534776],"category_scores_gemma":[0.00030449123,0.00035644803,0.0001078058,0.00033426913,0.00026707063,0.0023183143,0.00086735556,0.0010142865,0.000014569793],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009710663,0.000022745531,0.000012133418,0.00019251076,0.00001059747,0.000018649416,0.0017120707,0.002253078,0.009763772,0.100804314,0.000010629159,0.8851898],"study_design_scores_gemma":[0.0001511466,0.00007215295,0.0000023812415,0.0005137176,0.000006478379,0.000079225014,2.0559514e-7,0.37039602,0.033593144,0.59398586,0.00073564315,0.00046403756],"about_ca_topic_score_codex":0.000012348347,"about_ca_topic_score_gemma":0.000013515927,"teacher_disagreement_score":0.88472575,"about_ca_system_score_codex":0.00016935712,"about_ca_system_score_gemma":0.0004105063,"threshold_uncertainty_score":0.9999607},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58569455,0.0006145607,0.41263145,0.0005091754,0.00012964792,0.00040646893,7.29409e-7,0.0000099482895,0.000003475882],"genre_scores_gemma":[0.9675466,0.00013336918,0.03202853,0.00020922424,0.000020196778,0.000053045005,0.0000032314265,0.0000048493343,9.442827e-7],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990703,0.00003146435,0.00026456884,0.00026427765,0.00019708333,0.00017231124],"domain_scores_gemma":[0.9993892,0.0001737688,0.000083108935,0.0002470184,0.00006453181,0.00004240945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024999178,0.000085758875,0.00021490679,0.00025410124,0.000043775577,0.000010803524,0.0001055085,0.000022110491,0.000004428652],"category_scores_gemma":[0.0000877945,0.00006626947,0.000056098015,0.0008609888,0.00022281511,0.00010635528,0.000030854007,0.00008844574,0.0000032904406],"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.00006234566,0.0011863399,0.59970284,0.00077972846,0.000017378508,0.0001360588,0.0038773431,0.014114881,0.007090104,0.00013178676,0.000009036977,0.37289217],"study_design_scores_gemma":[0.0016300767,0.0008711177,0.8261127,0.0018453132,0.000010560291,0.00007388445,0.0000010553614,0.050417285,0.11632853,0.0025961306,0.0000055670125,0.00010780583],"about_ca_topic_score_codex":0.000052763175,"about_ca_topic_score_gemma":0.000051148363,"teacher_disagreement_score":0.38185206,"about_ca_system_score_codex":0.00011986865,"about_ca_system_score_gemma":0.00012195857,"threshold_uncertainty_score":0.27023908},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013793887,0.0005932414,0.9965512,0.00029436284,0.0009141133,0.00091622636,0.000004635213,0.00013270747,0.0004555365],"genre_scores_gemma":[0.023196122,0.000053441574,0.9750131,0.0013381857,0.00021025495,0.00004862264,0.0000068569134,0.00002947622,0.00010398794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699897,0.000048357706,0.00040694157,0.0015892729,0.0005198086,0.00043663627],"domain_scores_gemma":[0.9976214,0.00023281605,0.0002702601,0.001371831,0.00033970084,0.0001639517],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015571741,0.00036610718,0.00033829012,0.0004906729,0.00028045868,0.00031593957,0.0017915228,0.00031497405,0.0000027471185],"category_scores_gemma":[0.00013122015,0.00035073876,0.000056880574,0.00038542965,0.00026663413,0.00096167537,0.00029414476,0.000356467,0.0000112649595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060961574,0.000022016213,0.000004696925,0.000042031534,0.0000025756713,0.0000022947058,0.00036165476,0.0040378855,0.0027968308,0.15894267,0.00000613844,0.8337751],"study_design_scores_gemma":[0.0001615495,0.00020686677,0.0000753992,0.00007556085,0.000005431892,0.00004576219,7.818637e-8,0.83782274,0.007802785,0.15006548,0.0033328058,0.00040557978],"about_ca_topic_score_codex":0.0000034134678,"about_ca_topic_score_gemma":0.00000665447,"teacher_disagreement_score":0.8337848,"about_ca_system_score_codex":0.0002212712,"about_ca_system_score_gemma":0.00025344666,"threshold_uncertainty_score":0.99989444},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034236044,0.00019759263,0.9941047,0.0004939053,0.0026952182,0.00097384065,0.000010947021,0.00011055262,0.0013790438],"genre_scores_gemma":[0.011566813,0.000049966893,0.9823867,0.0023465494,0.0005370275,0.000031069205,0.000014978132,0.00005023008,0.0030166302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640584,0.00002878745,0.00058636756,0.0013900703,0.0008972186,0.0006917058],"domain_scores_gemma":[0.99608475,0.0011728754,0.00050420355,0.0017299756,0.00035334245,0.00015484053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095220166,0.0004699065,0.00049759314,0.0012228385,0.00021727878,0.0004327514,0.002807915,0.00022868275,0.000021574318],"category_scores_gemma":[0.00013597643,0.0004534063,0.00023028208,0.0007247616,0.00034943892,0.0008077985,0.0015240681,0.0006421115,0.000010824548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018187664,0.00004265308,0.000039982246,0.000104009334,0.00003727782,0.000062325205,0.00032756102,0.114395365,0.000080560916,0.028709566,0.0019910163,0.8541915],"study_design_scores_gemma":[0.0002872419,0.00021090632,0.00013660996,0.00082013814,0.000024534416,0.000022341408,1.6203286e-7,0.8447133,0.0011910918,0.018937824,0.13300963,0.0006462799],"about_ca_topic_score_codex":0.00002471114,"about_ca_topic_score_gemma":0.00018539556,"teacher_disagreement_score":0.8535452,"about_ca_system_score_codex":0.00048688918,"about_ca_system_score_gemma":0.0002671304,"threshold_uncertainty_score":0.99979174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021490728,0.00006171389,0.9856761,0.00021500544,0.00026341365,0.00021517156,0.0000068399922,0.00002653182,0.013320333],"genre_scores_gemma":[0.9120623,0.0000032822443,0.08527131,0.000161575,0.0009782295,0.000008095813,0.000009996206,0.00002294587,0.0014823001],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861085,0.000015089045,0.00034793626,0.00044133983,0.00035631735,0.00022847015],"domain_scores_gemma":[0.9987255,0.00013318783,0.000271692,0.00071248057,0.000121271565,0.00003586734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021760564,0.00023313894,0.00029774162,0.00023285748,0.00009402754,0.000082634375,0.0012789586,0.00006912074,0.0003843983],"category_scores_gemma":[0.000005136265,0.00017271617,0.00021049268,0.0003131558,0.000566034,0.00008944502,0.00060771813,0.00043986458,0.000010555246],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010894782,0.0000201291,0.00091095024,0.000004264731,0.000028496608,3.750367e-7,0.00016981823,0.006987277,0.000026046986,0.043083925,0.00008423743,0.9486834],"study_design_scores_gemma":[0.00015601097,0.000052661246,0.0006014321,0.00047374386,0.000059234855,0.000003289516,2.7799337e-7,0.3558066,0.0026849776,0.62049353,0.019144632,0.0005236221],"about_ca_topic_score_codex":0.00009268841,"about_ca_topic_score_gemma":0.00012405706,"teacher_disagreement_score":0.94815975,"about_ca_system_score_codex":0.00009336324,"about_ca_system_score_gemma":0.00016620386,"threshold_uncertainty_score":0.70431614},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000076854645,0.00025291726,0.993852,0.00051698333,0.00348912,0.0008897852,0.000007777783,0.0003592767,0.0005552731],"genre_scores_gemma":[0.26803237,0.000018282415,0.7307464,0.000784067,0.00027975006,0.00001523965,0.000009358661,0.00002065707,0.000093864764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969351,0.00001789977,0.000664899,0.00090728374,0.000822134,0.0006526281],"domain_scores_gemma":[0.99762833,0.00034118243,0.00038632157,0.0011557175,0.00035864036,0.00012982459],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009023564,0.00046517942,0.00054372667,0.0007783648,0.00028762527,0.000736825,0.0028111923,0.00035202276,0.0000030678702],"category_scores_gemma":[0.00018832381,0.00040093626,0.00018053749,0.00043668263,0.0003477585,0.0011570007,0.0008051354,0.0004016996,0.00007061753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006192514,0.00008526422,0.00008146925,0.0016888047,0.00006715353,0.00016728502,0.0054781935,0.094719775,0.00036612575,0.23353721,0.000057642574,0.66368914],"study_design_scores_gemma":[0.0011716131,0.00029931398,0.0002423218,0.0012347914,0.000021919726,0.00015125361,0.0000017746975,0.9472743,0.0030019197,0.044471975,0.0012344015,0.00089440646],"about_ca_topic_score_codex":0.00003130653,"about_ca_topic_score_gemma":0.000031888605,"teacher_disagreement_score":0.85255456,"about_ca_system_score_codex":0.0006986297,"about_ca_system_score_gemma":0.0007845284,"threshold_uncertainty_score":0.99984425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004656867,0.001193806,0.9905487,0.00047402747,0.002153336,0.0010090742,0.000004370217,0.00025453905,0.004315627],"genre_scores_gemma":[0.062213805,0.00009727415,0.93487316,0.0007777818,0.0009706488,0.00005118856,0.0000068505765,0.000060942977,0.0009483528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949896,0.00004005511,0.0006094334,0.0021876495,0.00095546606,0.0012178058],"domain_scores_gemma":[0.996317,0.0009234766,0.00027231898,0.0015539493,0.0006442841,0.00028895613],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001995474,0.0006799836,0.00070493546,0.0009434881,0.00061206176,0.0011055011,0.004762669,0.0006367257,0.000014882643],"category_scores_gemma":[0.00015965124,0.0005764363,0.00025513698,0.0006471104,0.000842258,0.0006187329,0.0017530676,0.0016573478,0.000050957173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009583401,0.00011668197,0.000039173872,0.00033636836,0.000026967784,0.000064033746,0.0037599674,0.26117712,0.0009879372,0.41706514,0.000018521328,0.3163985],"study_design_scores_gemma":[0.00019303501,0.0001600656,0.000002809085,0.0002390495,0.000006263977,0.000043359705,1.685568e-7,0.6259367,0.00077919714,0.37124655,0.0009117125,0.00048112756],"about_ca_topic_score_codex":0.0000342529,"about_ca_topic_score_gemma":0.0001387504,"teacher_disagreement_score":0.36475953,"about_ca_system_score_codex":0.00027640714,"about_ca_system_score_gemma":0.00087632216,"threshold_uncertainty_score":0.99993145},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020784977,0.00026943238,0.99099547,0.00070420996,0.0017832555,0.0010129447,0.000010035082,0.0008779027,0.0043259743],"genre_scores_gemma":[0.05254278,0.00001185218,0.94558454,0.0008238791,0.0005077393,0.000022631146,0.000008027211,0.00004969205,0.00044884623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622345,0.000031414165,0.0006810127,0.0016059603,0.0006626931,0.0007954877],"domain_scores_gemma":[0.9967127,0.0005796848,0.00046773162,0.0015486048,0.00046598937,0.00022527734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011551339,0.0006326555,0.00080645655,0.0009543221,0.0004844154,0.00078376074,0.004067102,0.00054433604,0.0000055573014],"category_scores_gemma":[0.000090369926,0.00058523763,0.0002749077,0.0004517168,0.00050006766,0.00039502737,0.00065215223,0.0009577682,0.000023519213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011472303,0.00021427798,0.00016666173,0.0008358904,0.00016425322,0.00017379806,0.0019029406,0.22722074,0.009994525,0.22944348,0.0010538374,0.5287149],"study_design_scores_gemma":[0.0007161179,0.00018561796,0.000015798598,0.00050773064,0.00000950592,0.00008993426,1.2044826e-7,0.9592917,0.008467445,0.023711126,0.0061741783,0.0008307045],"about_ca_topic_score_codex":0.000018049404,"about_ca_topic_score_gemma":0.000022672504,"teacher_disagreement_score":0.732071,"about_ca_system_score_codex":0.00035331657,"about_ca_system_score_gemma":0.0006274568,"threshold_uncertainty_score":0.9996599},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003964522,0.00026640168,0.9942177,0.0015819025,0.0020080744,0.0005540037,0.000009695918,0.00023174217,0.00073405233],"genre_scores_gemma":[0.028168455,0.000016534124,0.9685874,0.0015479667,0.0013271779,0.000018741677,0.0000058731866,0.00003799174,0.00028988827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960948,0.000023373581,0.0005114926,0.0016942649,0.0008144679,0.00086160353],"domain_scores_gemma":[0.9971027,0.0002809396,0.0002306076,0.0017433321,0.00030814734,0.00033431343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069804816,0.0005143023,0.00046571429,0.00048522526,0.0006712179,0.0004893166,0.0038339982,0.00036765388,0.00002700073],"category_scores_gemma":[0.000036780446,0.0004994784,0.00014437154,0.0011263033,0.0005101418,0.00044291822,0.0013916765,0.0010372215,0.00010218255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025390195,0.000037167527,0.000014652625,0.00001099861,0.00000895367,0.000025145924,0.0003272094,0.75283355,0.00078277144,0.021609925,0.0000769538,0.22427012],"study_design_scores_gemma":[0.0001322061,0.00007008234,0.000107987544,0.00016731523,0.000008659204,0.00007388336,6.135231e-8,0.9069772,0.0002988242,0.08250093,0.009018408,0.0006444793],"about_ca_topic_score_codex":0.000016594848,"about_ca_topic_score_gemma":0.00015135639,"teacher_disagreement_score":0.22362565,"about_ca_system_score_codex":0.00025923538,"about_ca_system_score_gemma":0.0006485583,"threshold_uncertainty_score":0.99974567},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000109388675,0.0027696963,0.98862916,0.0024652686,0.002949104,0.000741441,0.000011422657,0.0006561351,0.0016683833],"genre_scores_gemma":[0.4477611,0.0001631164,0.55084395,0.0005705195,0.000408064,0.000030290892,0.000017254466,0.000069133166,0.0001365772],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99479413,0.00016116699,0.00086547504,0.0019088534,0.0011364823,0.0011338663],"domain_scores_gemma":[0.98713696,0.0012943113,0.0005193052,0.010662172,0.0002226214,0.00016464158],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0027168368,0.00068015343,0.0007296872,0.001655091,0.00015237549,0.000594811,0.036456373,0.0007227034,0.000015562937],"category_scores_gemma":[0.0054149777,0.0006439073,0.00009371628,0.0012494813,0.0011603431,0.0009185169,0.060072336,0.00136097,0.000089733956],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014631323,0.00007719918,0.0005934247,0.00013808643,0.000020934229,0.00021054829,0.0005582622,0.013137442,0.00022879808,0.0672449,0.0005136126,0.91726214],"study_design_scores_gemma":[0.00020003211,0.000049964692,0.00014327237,0.00037576677,0.000004606195,0.000113809685,1.6509887e-7,0.489593,0.0003550582,0.5078016,0.00083384407,0.00052889483],"about_ca_topic_score_codex":0.000041145617,"about_ca_topic_score_gemma":0.000024058638,"teacher_disagreement_score":0.91673326,"about_ca_system_score_codex":0.0007127839,"about_ca_system_score_gemma":0.00047646035,"threshold_uncertainty_score":0.99960124},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019354598,0.0025858292,0.9933142,0.00023414737,0.0017671618,0.000972389,0.000008057749,0.000119997094,0.0009788438],"genre_scores_gemma":[0.04464448,0.00026647898,0.9519656,0.0020153604,0.00037211666,0.00004795252,0.000008471245,0.00007562814,0.0006039448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552554,0.00002900705,0.00090973265,0.0016756965,0.0008320609,0.001027948],"domain_scores_gemma":[0.9960866,0.00071343523,0.00062936754,0.0018465051,0.00050450483,0.00021959287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001428008,0.00064980466,0.00090945966,0.00054412894,0.0002218392,0.00031788528,0.003935192,0.00057305774,0.0000061258775],"category_scores_gemma":[0.00006555193,0.00061889365,0.00029130458,0.0006595184,0.00070243055,0.0005372675,0.0010410091,0.00083323265,0.0000033124038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008954161,0.000017818798,0.0000038495773,0.000035656034,0.000011123335,0.0000075961216,0.0002705078,0.6352916,0.000014284338,0.01608802,0.00009327033,0.34815738],"study_design_scores_gemma":[0.00037484828,0.00013959408,0.0000029848431,0.00039790224,0.000012348619,0.000022506423,7.495898e-8,0.8584001,0.00018463608,0.13861313,0.0013111207,0.0005407459],"about_ca_topic_score_codex":0.0000022213894,"about_ca_topic_score_gemma":0.00008700958,"teacher_disagreement_score":0.3476166,"about_ca_system_score_codex":0.0002543711,"about_ca_system_score_gemma":0.0005186945,"threshold_uncertainty_score":0.9996262},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096773845,0.00058696425,0.9879545,0.00015369365,0.0015691235,0.0007226826,0.0000065206236,0.000036895017,0.008001902],"genre_scores_gemma":[0.92808723,0.000038580256,0.06939074,0.0018165188,0.0003909244,0.000032058302,0.000005140102,0.000036026737,0.00020279452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964706,0.000052276726,0.0006478369,0.001234089,0.0009539848,0.00064122677],"domain_scores_gemma":[0.9961985,0.001004571,0.0008082614,0.0014831914,0.00037514913,0.00013037586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063808507,0.00052077393,0.00054004835,0.00046697643,0.00033512435,0.00030320504,0.0041856766,0.00024834994,0.000054492677],"category_scores_gemma":[0.0002437543,0.00038733473,0.0002442045,0.0006804145,0.0013219989,0.0005916703,0.0015573391,0.0010627563,0.00006123338],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002116539,0.00019649228,0.0001517803,0.00015401498,0.00006637591,0.000102134094,0.019692188,0.24761386,0.023066437,0.08792008,0.0001001942,0.6209153],"study_design_scores_gemma":[0.002587455,0.0029209366,0.0019689184,0.005778227,0.000092004084,0.00030718948,0.000013310014,0.36839017,0.29733098,0.30899373,0.008111294,0.0035058083],"about_ca_topic_score_codex":0.00006180412,"about_ca_topic_score_gemma":0.000011778818,"teacher_disagreement_score":0.9271195,"about_ca_system_score_codex":0.0003372539,"about_ca_system_score_gemma":0.0008851481,"threshold_uncertainty_score":0.99985784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003488064,0.00020815796,0.99710536,0.00008035024,0.0011167332,0.0007117928,0.0000088902525,0.0000891018,0.0003307864],"genre_scores_gemma":[0.13839622,0.000021324995,0.86114776,0.00019982287,0.00013922171,0.00003146294,0.000010557186,0.000020583684,0.00003303043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961008,0.00020361361,0.0005195772,0.0009334741,0.0018879817,0.00035457494],"domain_scores_gemma":[0.99551266,0.0025957825,0.0003437513,0.0010750033,0.00040049394,0.00007233385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033857813,0.00034233494,0.00041548169,0.0004574593,0.0001638242,0.00009902176,0.00156231,0.00020455637,0.000017244445],"category_scores_gemma":[0.0019434318,0.00023997716,0.000096049065,0.00044632234,0.00027187815,0.00020381967,0.0004430189,0.00047638698,0.0000103785915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079621,0.000051425475,0.000034462326,0.00009215337,0.00003315566,0.000012103383,0.0024561696,0.6077673,0.00012282269,0.08129479,0.00013062879,0.30799705],"study_design_scores_gemma":[0.00020573763,0.00009711637,0.0005673725,0.00019707558,0.000012842903,0.000021128302,3.4796793e-7,0.9886066,0.0004808979,0.009402725,0.00014672065,0.00026147603],"about_ca_topic_score_codex":0.000018063822,"about_ca_topic_score_gemma":0.000003496383,"teacher_disagreement_score":0.38083926,"about_ca_system_score_codex":0.00028987342,"about_ca_system_score_gemma":0.00035784044,"threshold_uncertainty_score":0.9785984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101709295,0.00028779032,0.9955821,0.00002891524,0.0021810853,0.000702222,0.00002856036,0.000988076,0.00009951605],"genre_scores_gemma":[0.08576975,0.0000068897816,0.9137931,0.000033136894,0.00015571534,0.00003158878,0.00000951277,0.00004595048,0.00015433875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965186,0.00003929584,0.00077778747,0.0012257694,0.0007526634,0.0006858985],"domain_scores_gemma":[0.9968229,0.0010208514,0.00047947987,0.0011918322,0.00038350988,0.00010140949],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000994268,0.0005207747,0.00081523,0.0008031897,0.0001258446,0.00017857621,0.0029228965,0.00036465353,0.0000010227049],"category_scores_gemma":[0.00011669347,0.0005084174,0.0001860427,0.00044714005,0.00039380544,0.00073237973,0.00088142283,0.00042574588,0.0000015906857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002865904,0.000017186801,0.000005926511,0.00009567557,0.000006727045,0.000019434177,0.0001232782,0.95893043,0.0006012559,0.0119807385,0.000024434323,0.028192017],"study_design_scores_gemma":[0.00020125772,0.00022690164,0.000010565356,0.0003260483,0.000011453247,0.000038070528,9.232546e-8,0.9212696,0.0021158264,0.075193994,0.0001234599,0.00048270886],"about_ca_topic_score_codex":0.000031195043,"about_ca_topic_score_gemma":0.0000059246563,"teacher_disagreement_score":0.08566804,"about_ca_system_score_codex":0.0003313201,"about_ca_system_score_gemma":0.00040352152,"threshold_uncertainty_score":0.9997367},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000311633,0.00069011503,0.9939379,0.00021276006,0.0010522113,0.000461081,0.000001382711,0.0006711337,0.0026617628],"genre_scores_gemma":[0.11697213,0.000039950006,0.88220644,0.00038437452,0.00015811661,0.0000057492393,0.000003925885,0.000041198236,0.00018809119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649215,0.00006320848,0.00061547424,0.0014296202,0.0007643059,0.0006352229],"domain_scores_gemma":[0.9976532,0.00038309937,0.00039754208,0.0011623244,0.00025991222,0.00014390789],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081220357,0.00054078177,0.0004884505,0.0011765338,0.0004276893,0.00060120324,0.0024762074,0.00039178683,0.000020768855],"category_scores_gemma":[0.00005291277,0.0005366844,0.0001433042,0.00076513254,0.00037072,0.0008899655,0.000728359,0.00079813023,0.00003370465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015866287,0.000010859277,0.0000045180936,0.000023376566,0.0000055633263,0.000021064683,0.00036240372,0.38218242,0.0005415782,0.00065510446,0.000004229175,0.6161873],"study_design_scores_gemma":[0.0001425604,0.00008898783,0.00001815126,0.00037071103,0.0000067161673,0.00007094963,1.3706536e-7,0.9619049,0.0012610124,0.035459924,0.00009325376,0.000582712],"about_ca_topic_score_codex":0.000044781526,"about_ca_topic_score_gemma":0.00001889812,"teacher_disagreement_score":0.6156046,"about_ca_system_score_codex":0.00039281766,"about_ca_system_score_gemma":0.00041630666,"threshold_uncertainty_score":0.9997085},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000046976606,0.0003778615,0.98490137,0.0015847648,0.00095702626,0.00023749692,0.0000013246638,0.0002643319,0.011671136],"genre_scores_gemma":[0.033600308,0.000047966903,0.96258324,0.003072516,0.0003532107,0.0000057832813,0.0000042250226,0.000028094099,0.00030463238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996653,0.000022618156,0.00058050145,0.001192587,0.00087190425,0.0006793744],"domain_scores_gemma":[0.99777544,0.00021725525,0.00025651822,0.0012792852,0.0002482281,0.00022326334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005349597,0.00047979903,0.0004130228,0.0010781974,0.00044357698,0.0006376308,0.0031203635,0.00018320783,0.00003212196],"category_scores_gemma":[0.0000675412,0.00043931883,0.00013392935,0.0007606439,0.00082418206,0.0021328223,0.001711683,0.00086931465,0.00024259146],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.958802e-7,0.000010724881,0.0000053981785,0.000016048374,0.0000029892801,0.000027664651,0.0010265895,0.01578044,0.00010514018,0.0064152796,0.000026193777,0.9765827],"study_design_scores_gemma":[0.00018975463,0.00003937769,0.000051170045,0.00030907473,0.0000020301538,0.00009767379,9.190687e-7,0.8715698,0.0009302949,0.11454665,0.011697281,0.0005659403],"about_ca_topic_score_codex":0.000012719455,"about_ca_topic_score_gemma":0.000067594905,"teacher_disagreement_score":0.9760168,"about_ca_system_score_codex":0.00049819984,"about_ca_system_score_gemma":0.00041762623,"threshold_uncertainty_score":0.99980587},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040670744,0.00066944445,0.9781962,0.00070119835,0.0036958235,0.00057775824,0.0000049389955,0.00045224972,0.015661726],"genre_scores_gemma":[0.038728245,0.000039452305,0.9518925,0.004236366,0.0030723538,0.000008652651,0.000016479811,0.00010779025,0.0018981767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934677,0.000059870865,0.0009084251,0.0023224745,0.0020617503,0.0011797964],"domain_scores_gemma":[0.9956587,0.0006672882,0.0005155219,0.002230873,0.0003795185,0.00054809795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018767574,0.0008608862,0.00077368796,0.0016016111,0.00029149116,0.0010344556,0.0050580595,0.00044189687,0.00008344249],"category_scores_gemma":[0.00013579012,0.0008289032,0.00024761632,0.0012525922,0.00059098384,0.0012142574,0.0015418513,0.0013554738,0.00035921126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001880749,0.00003770876,0.00003940454,0.00007736262,0.000021713327,0.00041494126,0.0011022204,0.033358723,0.0016850772,0.10127422,0.00029090894,0.8616789],"study_design_scores_gemma":[0.0012731613,0.0004335014,0.00008094972,0.0011861103,0.000020848764,0.0004501381,3.4626248e-7,0.68346703,0.006772489,0.28615555,0.018066373,0.0020935063],"about_ca_topic_score_codex":0.00027033288,"about_ca_topic_score_gemma":0.00032406914,"teacher_disagreement_score":0.8595854,"about_ca_system_score_codex":0.0008182175,"about_ca_system_score_gemma":0.0015700189,"threshold_uncertainty_score":0.9994162},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023803003,0.000043973843,0.9905319,0.0018697311,0.0039555742,0.0011074485,0.000010566008,0.0004526847,0.0017900501],"genre_scores_gemma":[0.902927,0.0000019422457,0.092690706,0.0009991152,0.0019510422,0.00025909112,0.000024449744,0.00008623325,0.001060429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966274,0.000033258228,0.00058070145,0.0013011125,0.0007663213,0.0006912391],"domain_scores_gemma":[0.9967712,0.000755496,0.00069043407,0.0008405863,0.0008890643,0.000053180982],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000645095,0.0005484301,0.00044105886,0.0010093665,0.0014934612,0.0015898648,0.0020699175,0.00040002045,0.000005122951],"category_scores_gemma":[0.00007387475,0.00041153698,0.00013433394,0.0010201072,0.00081950595,0.0012651414,0.0004133936,0.0010201298,0.00002524137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027279425,0.00009059555,0.000012924269,0.00015199468,0.00008377524,0.000053557585,0.001483732,0.011650494,0.0003517434,0.07634318,0.00091861666,0.9085866],"study_design_scores_gemma":[0.0014755708,0.0013631928,0.00004304357,0.0010031189,0.000036863243,0.0004111418,0.000010805915,0.9346635,0.0057340693,0.018988533,0.034991484,0.0012786831],"about_ca_topic_score_codex":0.000011497736,"about_ca_topic_score_gemma":0.00034233162,"teacher_disagreement_score":0.923013,"about_ca_system_score_codex":0.0018227687,"about_ca_system_score_gemma":0.0007449995,"threshold_uncertainty_score":0.99983364},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016188298,0.000115463336,0.9754801,0.00082769024,0.0011159063,0.0001368897,9.453336e-7,0.00010622568,0.022054914],"genre_scores_gemma":[0.76674443,0.00008817821,0.22931525,0.0013575209,0.0006043468,0.0000079934525,0.000004534235,0.000041507916,0.001836256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978593,0.000040571576,0.00035115023,0.0007552743,0.00064070866,0.00035301727],"domain_scores_gemma":[0.99815094,0.0005194218,0.00033497528,0.00072145544,0.00021210303,0.00006108748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054504076,0.0002879403,0.000304699,0.00050902704,0.00051148015,0.00032258048,0.001963922,0.00015997229,0.000049927992],"category_scores_gemma":[0.000098241784,0.00020746126,0.00010639314,0.0005911458,0.0008941986,0.00032293494,0.00044123712,0.0009663178,0.000029187306],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028171673,0.000012870015,0.000017696757,0.000014845306,0.000005648965,0.000007676093,0.0003021251,0.031229474,0.0001421105,0.01900031,0.000021146841,0.9492433],"study_design_scores_gemma":[0.00014991326,0.00016998612,0.00012398747,0.0003281143,0.0000071109425,0.00020441461,4.7752997e-7,0.8541013,0.000855735,0.13992243,0.0038043023,0.00033223283],"about_ca_topic_score_codex":0.000011463654,"about_ca_topic_score_gemma":0.000013459521,"teacher_disagreement_score":0.9489111,"about_ca_system_score_codex":0.000104874685,"about_ca_system_score_gemma":0.00035627908,"threshold_uncertainty_score":0.84600246},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019714245,0.0012466281,0.9938861,0.001791805,0.000996132,0.0011014026,0.000003485709,0.00010957394,0.00066771836],"genre_scores_gemma":[0.26016027,0.0011037315,0.72921693,0.0055986294,0.0011289255,0.00011402216,0.00005705397,0.00013092412,0.0024894897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99453926,0.000146432,0.00094139564,0.0018265997,0.0012658676,0.0012804593],"domain_scores_gemma":[0.99501425,0.0014624577,0.0003696525,0.0023213762,0.00047119695,0.0003610909],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020231244,0.00063776213,0.00068005413,0.0010207191,0.0005276994,0.0010490996,0.006407064,0.0005295317,0.000071210445],"category_scores_gemma":[0.00027563627,0.000625733,0.0001657515,0.001452521,0.00041948268,0.0010306125,0.0033680187,0.0016773539,0.000021922966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014443628,0.000057137946,0.00046895794,0.000044661025,0.000011748732,0.00007788446,0.0016607137,0.67779386,0.000055983088,0.0016736981,0.0005937186,0.31754717],"study_design_scores_gemma":[0.0005607545,0.0000872424,0.00013240501,0.0010504206,0.000003284724,0.000013089097,6.8860385e-7,0.98804253,0.00016823914,0.0032890595,0.0060076243,0.0006446382],"about_ca_topic_score_codex":0.000062047795,"about_ca_topic_score_gemma":0.00039209478,"teacher_disagreement_score":0.31690255,"about_ca_system_score_codex":0.0006105537,"about_ca_system_score_gemma":0.00078919413,"threshold_uncertainty_score":0.9999879},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008080068,0.00012583329,0.9901189,0.00079082133,0.000033390683,0.00064080086,0.000061765495,0.00014397613,0.00000440572],"genre_scores_gemma":[0.4940564,0.000007047462,0.5056387,0.00017885175,0.00003858277,0.000020667865,0.00005475501,0.0000034227764,0.0000015417718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904364,0.000008542308,0.00019642549,0.00038405848,0.000183669,0.00018366068],"domain_scores_gemma":[0.99854827,0.0002957062,0.00008825861,0.00093099586,0.000117665644,0.000019125537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003512071,0.00008395652,0.00019356707,0.00025670396,0.000103221486,0.000023297212,0.0005480757,0.000034200806,0.0000019026912],"category_scores_gemma":[0.00006986776,0.000052026102,0.000049052855,0.0028437835,0.0002385586,0.00009193789,0.00019324546,0.00007962186,3.7852513e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004346716,0.00045201037,0.012366343,0.00004966402,0.000072916024,0.0000047251247,0.00046601595,0.6780041,0.046539474,0.00026607743,0.0006021429,0.26113307],"study_design_scores_gemma":[0.00020739736,0.00004060686,0.00960935,0.000018298531,0.00012396366,0.0000036238523,5.673588e-7,0.97725976,0.011845772,0.00022477767,0.0006073034,0.00005859555],"about_ca_topic_score_codex":0.0002756299,"about_ca_topic_score_gemma":0.00029871688,"teacher_disagreement_score":0.48597634,"about_ca_system_score_codex":0.000031152096,"about_ca_system_score_gemma":0.0000925568,"threshold_uncertainty_score":0.21215628},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008738783,0.0009826156,0.99230546,0.00059969636,0.003371389,0.0016605956,0.000013275905,0.00030001852,0.0006795687],"genre_scores_gemma":[0.48466286,0.000012751967,0.51250964,0.0014672184,0.00065997714,0.00017345644,0.000013406381,0.00007136513,0.0004292999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950202,0.000021988706,0.00086996023,0.0020177776,0.0011313261,0.0009387656],"domain_scores_gemma":[0.9961799,0.0009261002,0.00048868475,0.0015852236,0.0005456402,0.00027446888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001103984,0.00076905783,0.0008556701,0.0008563732,0.00033275085,0.000811625,0.0037700073,0.00048422717,0.000022667935],"category_scores_gemma":[0.000128047,0.0006318986,0.00030138713,0.0006624744,0.0005643888,0.00081175845,0.00070646947,0.00074320094,0.000109466295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020106238,0.00006929344,0.000021498301,0.00022819635,0.000020597883,0.000052121188,0.00074868905,0.5952761,0.0002201662,0.0077471095,0.00005762765,0.39553845],"study_design_scores_gemma":[0.0014588463,0.0011790348,0.0000675713,0.003083259,0.00001814888,0.0001282074,4.991116e-7,0.81206363,0.0049207592,0.17235024,0.0031833719,0.0015464476],"about_ca_topic_score_codex":0.00001591099,"about_ca_topic_score_gemma":0.000065713764,"teacher_disagreement_score":0.48457548,"about_ca_system_score_codex":0.00071496284,"about_ca_system_score_gemma":0.0012150423,"threshold_uncertainty_score":0.9996132},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46243674,0.000020908023,0.5370014,0.00005185974,0.00026169664,0.00020426286,0.0000019286074,0.000014124305,0.000007152481],"genre_scores_gemma":[0.9638579,0.0000023437053,0.035854023,0.00011779497,0.00015094399,0.0000030627696,0.0000055444043,0.0000060837733,0.0000022991514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988529,0.000021281368,0.00028662436,0.00030736,0.0003171257,0.00021469258],"domain_scores_gemma":[0.99941075,0.000065789194,0.00012009763,0.00020035342,0.00013863738,0.00006434668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032420547,0.000097608485,0.00019817939,0.00014535223,0.00015149635,0.000016823047,0.00007400714,0.000053785203,0.0000047671315],"category_scores_gemma":[0.000091996044,0.000078925834,0.00003997107,0.00042483243,0.00026639237,0.000110463836,0.000040150884,0.00007672874,9.3791914e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011349906,0.0005373848,0.25227076,0.001374849,0.000049724367,0.00023122413,0.00270737,0.47935733,0.039453026,0.00062650413,0.00017762827,0.2220792],"study_design_scores_gemma":[0.000982035,0.00035108227,0.006170125,0.00021852118,0.00001124338,0.0008026508,0.0000030823076,0.970269,0.021031665,0.000025479423,0.000046756857,0.00008835193],"about_ca_topic_score_codex":0.000039343326,"about_ca_topic_score_gemma":0.0000065595873,"teacher_disagreement_score":0.50142115,"about_ca_system_score_codex":0.00013354668,"about_ca_system_score_gemma":0.00023312416,"threshold_uncertainty_score":0.3218502},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006751881,0.00022143575,0.9901709,0.000118345444,0.0011159105,0.000536778,0.000004681535,0.00030370808,0.007460733],"genre_scores_gemma":[0.0075727645,0.000052715084,0.9903408,0.0010567403,0.00028413482,0.000022400463,0.0000050920057,0.0000499486,0.0006153688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99469244,0.00006250937,0.00082111417,0.0019101452,0.0012068192,0.0013069848],"domain_scores_gemma":[0.9967128,0.0000869409,0.0004918167,0.002169263,0.00032285426,0.00021632604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026901416,0.0006482831,0.0005923536,0.000979383,0.00045996867,0.0006303522,0.0047037746,0.0003812819,0.000023548033],"category_scores_gemma":[0.00018274621,0.0006296472,0.00018142453,0.00087894883,0.0005326359,0.0010598947,0.0025529654,0.000982445,0.000072798706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004470248,0.000048329388,0.000049004506,0.000046445777,0.000015241505,0.00003871452,0.0015408655,0.07777192,0.00032196933,0.39785153,0.0000151020995,0.5222964],"study_design_scores_gemma":[0.00027404912,0.00005046916,0.00005873954,0.00016146728,0.000008007692,0.000061165825,1.6931212e-7,0.93070614,0.0015155517,0.06555833,0.00096477376,0.00064114184],"about_ca_topic_score_codex":0.000024839355,"about_ca_topic_score_gemma":0.0000438717,"teacher_disagreement_score":0.85293424,"about_ca_system_score_codex":0.00046130607,"about_ca_system_score_gemma":0.0005791988,"threshold_uncertainty_score":0.9996155},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003027297,0.00022582007,0.95793986,0.00017686759,0.0032738908,0.0010129645,0.000009880747,0.00016255597,0.03417085],"genre_scores_gemma":[0.9710236,0.0000029990254,0.021020748,0.0009295758,0.0005761473,0.000029428085,0.0000055157684,0.000033178898,0.006378786],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969644,0.0001208413,0.00046982005,0.0012814084,0.0006002333,0.0005632835],"domain_scores_gemma":[0.99855316,0.0002312896,0.00018169716,0.0007340345,0.00017139126,0.00012842419],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00062334497,0.00049586204,0.0004827885,0.00027274134,0.00018404883,0.00024827948,0.0011814196,0.00035732432,0.0010499128],"category_scores_gemma":[0.000029769095,0.0004226582,0.00011542549,0.00040824688,0.0006988809,0.00013425901,0.00034750273,0.0006115069,0.0007068036],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005935582,0.0012260353,0.0039049084,0.00003183806,0.00015830793,0.0010497667,0.015276651,0.12595066,0.00023539002,0.004923379,0.023305058,0.82334447],"study_design_scores_gemma":[0.026328286,0.04019725,0.22135551,0.0023392548,0.00093773316,0.0036643744,0.0003205702,0.24558471,0.0009483509,0.31365928,0.1217803,0.02288438],"about_ca_topic_score_codex":0.00017925915,"about_ca_topic_score_gemma":0.000365869,"teacher_disagreement_score":0.9679963,"about_ca_system_score_codex":0.0005423642,"about_ca_system_score_gemma":0.0001739101,"threshold_uncertainty_score":0.99986327},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000066859124,0.00046363924,0.9920456,0.00081514684,0.0004211791,0.0040553696,0.000019624536,0.0006477931,0.0014647958],"genre_scores_gemma":[0.62417054,0.000051044994,0.3739094,0.0006288868,0.00015128752,0.0008906833,0.0000067241267,0.000050661412,0.00014074137],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955023,0.00004461843,0.0004578619,0.0022391027,0.0009354018,0.00082070054],"domain_scores_gemma":[0.9960287,0.0017417545,0.00038760147,0.0010454718,0.00063631526,0.00016014486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093470974,0.0007199925,0.0008865104,0.0011425305,0.000311288,0.0004904864,0.0024910155,0.00039251242,0.0000037247432],"category_scores_gemma":[0.00011627738,0.0006166939,0.00010979419,0.0007396237,0.00036291513,0.00052372814,0.0008445654,0.0005395222,0.000047194477],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062352796,0.00006806047,0.000007294195,0.000039692815,0.000033211374,0.000027335012,0.001750542,0.0026146716,0.00006611191,0.000638346,0.000011905086,0.99468046],"study_design_scores_gemma":[0.013193134,0.038347412,0.003619283,0.014882818,0.0003896955,0.0018237828,0.00023855777,0.36508405,0.07279669,0.46109033,0.010857603,0.017676655],"about_ca_topic_score_codex":0.00000712586,"about_ca_topic_score_gemma":0.0001325867,"teacher_disagreement_score":0.9770038,"about_ca_system_score_codex":0.00041026156,"about_ca_system_score_gemma":0.00056299084,"threshold_uncertainty_score":0.9996284},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004545385,0.0006606951,0.994126,0.00054390484,0.0012025144,0.0004565736,0.0000057845486,0.0005073513,0.002451691],"genre_scores_gemma":[0.035785135,0.0001181592,0.96131957,0.0017758543,0.0006204881,0.0000028659706,0.0000062220984,0.000074904936,0.00029680133],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951908,0.0000625931,0.000679494,0.0018466841,0.0013386388,0.00088176905],"domain_scores_gemma":[0.9968207,0.00031038566,0.0004288511,0.0017524201,0.00044647066,0.0002411926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016844944,0.0006603748,0.00058620155,0.00094401557,0.00039218887,0.00081699365,0.004320007,0.00052726053,0.00010408835],"category_scores_gemma":[0.00014767716,0.0006003334,0.00021944674,0.0011463782,0.0009775603,0.00091870566,0.0015077912,0.0011131978,0.00006570837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026864924,0.000072704315,0.000011730699,0.000079000885,0.000020989122,0.00017430782,0.0005047961,0.003694878,0.0035143255,0.1350311,0.0000046605305,0.85686463],"study_design_scores_gemma":[0.00021929144,0.00014659204,0.000028214183,0.00044758525,0.000012787054,0.00011515554,1.8057308e-7,0.15996364,0.03168627,0.80631477,0.00030719963,0.0007583312],"about_ca_topic_score_codex":0.000010782734,"about_ca_topic_score_gemma":0.0000029016444,"teacher_disagreement_score":0.8561063,"about_ca_system_score_codex":0.0008610695,"about_ca_system_score_gemma":0.0015378722,"threshold_uncertainty_score":0.9996448},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020881875,0.00031622234,0.9842742,0.00042264326,0.0033980063,0.0003209877,0.000008800601,0.0004029909,0.008767979],"genre_scores_gemma":[0.8666685,0.000038411075,0.1306719,0.0012249129,0.0008890541,0.0000024554297,0.000022285762,0.000040156807,0.00044228073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946705,0.000052108087,0.00086565525,0.0019756337,0.0013904474,0.001045651],"domain_scores_gemma":[0.99690247,0.0004677324,0.00038935742,0.0016488894,0.00034016598,0.000251366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010926909,0.000749818,0.00080457656,0.0008121444,0.00048806038,0.00075883867,0.0047912793,0.00040037304,0.000053677646],"category_scores_gemma":[0.000043625747,0.00069549907,0.00016839434,0.0008031991,0.00060751423,0.0005654391,0.0016001948,0.0012096997,0.00031932723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007804967,0.000028963457,0.0000851766,0.000047869537,0.000015225568,0.0001153869,0.00038156274,0.27759486,0.000018755061,0.018158931,0.000088742505,0.7034567],"study_design_scores_gemma":[0.00033985477,0.00020071314,0.0006416994,0.0011155014,0.0000066959965,0.00032310086,7.846661e-8,0.9480168,0.00015620097,0.04318573,0.005039151,0.00097445084],"about_ca_topic_score_codex":0.00003939173,"about_ca_topic_score_gemma":0.00000835154,"teacher_disagreement_score":0.86458033,"about_ca_system_score_codex":0.00031602176,"about_ca_system_score_gemma":0.0006579356,"threshold_uncertainty_score":0.9995496},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025508043,0.004155021,0.9887584,0.00012252435,0.0025471493,0.0004509299,0.000007141955,0.0021219542,0.0015817941],"genre_scores_gemma":[0.45153546,0.0000112831,0.54746974,0.00024434904,0.0005830348,0.000012414573,0.000005837573,0.00004262453,0.000095250165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99509794,0.000045158846,0.0007041887,0.0019881134,0.0013032473,0.00086132775],"domain_scores_gemma":[0.996716,0.00021904755,0.00046537054,0.001810895,0.00057659653,0.00021204399],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001280631,0.0007348261,0.0006534408,0.0010757319,0.00035829755,0.0017259924,0.0047796834,0.00059255795,0.000010950319],"category_scores_gemma":[0.00026406458,0.0006738218,0.00016763559,0.0008566479,0.0006750505,0.0014523825,0.0015912296,0.0013817503,0.000025306845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008315129,0.000044294527,0.00010075418,0.000654234,0.000019682675,0.0011318255,0.0064454596,0.01189669,0.0010795905,0.5118,0.000014915063,0.46680424],"study_design_scores_gemma":[0.000779891,0.00045071947,0.00016139075,0.009021136,0.000026068736,0.00052604434,0.0000018962302,0.44832784,0.0237893,0.51361793,0.0003579499,0.0029398494],"about_ca_topic_score_codex":0.00023578027,"about_ca_topic_score_gemma":0.00006493867,"teacher_disagreement_score":0.4638644,"about_ca_system_score_codex":0.0013444566,"about_ca_system_score_gemma":0.0007607937,"threshold_uncertainty_score":0.9995713},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019050964,0.00021180957,0.9942922,0.0019256595,0.0013199957,0.0010346688,0.000115472736,0.00013188494,0.0009492578],"genre_scores_gemma":[0.7645483,0.000031346022,0.23033485,0.0041015386,0.0007009435,0.00008464985,0.00007431547,0.00004993636,0.00007412403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962799,0.000029592982,0.00056355214,0.0015142807,0.0009011538,0.00071149814],"domain_scores_gemma":[0.99699605,0.0006431628,0.00029740544,0.0016334718,0.00029119206,0.00013872453],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00086297974,0.0005440658,0.0004907686,0.00052304036,0.00069204124,0.0014088044,0.006267527,0.00030592154,0.0000062098366],"category_scores_gemma":[0.000022645301,0.00040512555,0.00025757312,0.0006424525,0.0007151442,0.0010241081,0.00073645584,0.00061224116,0.00000494593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009109727,0.000034746507,0.000028423656,0.00003370288,0.000014645571,0.0000039125866,0.00023689451,0.5982273,0.000023442099,0.3683009,0.00025612177,0.03283078],"study_design_scores_gemma":[0.00030702478,0.000047792604,0.00012640042,0.000071124734,0.000013851819,0.000004794166,7.0146186e-8,0.61602277,0.00010100178,0.38246182,0.0005135374,0.00032981823],"about_ca_topic_score_codex":0.000046725654,"about_ca_topic_score_gemma":0.00029109357,"teacher_disagreement_score":0.7645292,"about_ca_system_score_codex":0.00013306187,"about_ca_system_score_gemma":0.000502171,"threshold_uncertainty_score":0.9998401},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006275059,0.00057237135,0.9953914,0.00006019961,0.001503474,0.00013952253,0.000008400033,0.00014847858,0.0015485975],"genre_scores_gemma":[0.300931,0.000624271,0.6956771,0.00073046284,0.001329254,0.00001109039,0.000011370555,0.00013421435,0.00055120926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988754,0.000003678381,0.00020386248,0.00041361412,0.00020470316,0.00029877503],"domain_scores_gemma":[0.9994825,0.00006113488,0.000038699203,0.00027351198,0.00004869031,0.00009547668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000073491836,0.00026997895,0.00028067807,0.00010979321,0.00006890555,0.000087936525,0.0002563861,0.00018383711,0.00004871124],"category_scores_gemma":[0.00002013287,0.00025544516,0.00003320848,0.000095368894,0.00017126618,0.00015171012,0.0001447064,0.0002739667,0.0000138153455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018756739,0.000010864249,6.1416563e-7,0.000049442966,0.000007671926,0.000030154413,0.00025546039,0.17322478,0.0211725,0.0041623507,0.000017976894,0.80106634],"study_design_scores_gemma":[0.0005751198,0.000296761,0.00003622343,0.0007670999,0.000035562007,0.00018651027,0.0000010840907,0.71752983,0.041388426,0.20621765,0.03126518,0.001700553],"about_ca_topic_score_codex":0.000001593079,"about_ca_topic_score_gemma":0.000026708607,"teacher_disagreement_score":0.79936576,"about_ca_system_score_codex":0.00015241756,"about_ca_system_score_gemma":0.000036933718,"threshold_uncertainty_score":0.99998975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015147093,0.00021107419,0.9627242,0.00065243046,0.0013908624,0.00024260404,0.0000050071208,0.00031026662,0.034312084],"genre_scores_gemma":[0.64026403,0.00018239475,0.3425463,0.013914541,0.0015877384,0.000023190427,0.000015684269,0.00012506032,0.0013410703],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962086,0.000054087242,0.00041362498,0.0016367412,0.0009466957,0.0007402666],"domain_scores_gemma":[0.996668,0.0009770439,0.00020718582,0.0018079896,0.00013523443,0.0002045685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008941498,0.0005811098,0.0004999763,0.0011621603,0.00036431153,0.000530243,0.003946241,0.00030281526,0.00008620698],"category_scores_gemma":[0.00006906734,0.0005211072,0.00022077456,0.0009273033,0.0007783306,0.00042194,0.0011615484,0.00089269225,0.00012112252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102542335,0.00002987386,0.000012369433,0.000012032839,0.000008877723,0.00017234834,0.00023452034,0.00637929,0.000030180336,0.3965189,0.000086829874,0.5965045],"study_design_scores_gemma":[0.00018300257,0.00032684,0.000038129812,0.00028973614,0.0000054200755,0.000095598014,7.579225e-8,0.078710616,0.0003541361,0.90930545,0.010035264,0.0006557302],"about_ca_topic_score_codex":0.0000074847844,"about_ca_topic_score_gemma":0.00002481146,"teacher_disagreement_score":0.6401126,"about_ca_system_score_codex":0.00015484043,"about_ca_system_score_gemma":0.00025913824,"threshold_uncertainty_score":0.99972403},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060161736,0.0005570971,0.9886799,0.00022321587,0.0015633795,0.00030402263,0.000007174432,0.0003617131,0.008243348],"genre_scores_gemma":[0.36509314,0.000023559696,0.6339103,0.0004709172,0.00014372183,0.000010679277,0.000021334696,0.00003652408,0.00028979473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972077,0.00007882406,0.00062262913,0.0009194271,0.0007771467,0.00039428257],"domain_scores_gemma":[0.9977764,0.0003358938,0.00051143277,0.0008760074,0.00040159532,0.00009870444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011483226,0.00037274006,0.00048668994,0.00076123554,0.00014073263,0.0004365861,0.001632336,0.00028115103,0.000008303875],"category_scores_gemma":[0.00013480372,0.00034680215,0.0000948517,0.000557289,0.00034315445,0.0006233196,0.0003149177,0.00044622974,0.00001733318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019052297,0.00004942786,0.000116009156,0.00046220355,0.000042866308,0.000089063506,0.004303456,0.428509,0.0012244647,0.036218323,0.0003179054,0.52864826],"study_design_scores_gemma":[0.00014413382,0.00014449916,0.000053176962,0.0009988582,0.000008614228,0.000043436386,2.3823802e-7,0.9812826,0.0015170898,0.015134505,0.00031833063,0.00035454583],"about_ca_topic_score_codex":0.000072025156,"about_ca_topic_score_gemma":0.0000067311917,"teacher_disagreement_score":0.5527736,"about_ca_system_score_codex":0.00022974503,"about_ca_system_score_gemma":0.00046540107,"threshold_uncertainty_score":0.9998984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000110208086,0.002047327,0.9813081,0.00019914549,0.0033811051,0.0010818678,0.000005632789,0.0003631341,0.011503448],"genre_scores_gemma":[0.20912486,0.000022425047,0.78781843,0.00049813313,0.0015323067,0.000108336055,0.000030979005,0.000085831656,0.00077870063],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949075,0.000044963886,0.0006720764,0.002302985,0.00083116425,0.0012413154],"domain_scores_gemma":[0.9969658,0.00054692006,0.00037096252,0.0013667907,0.00041278233,0.0003367431],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014535001,0.00083584496,0.00077341433,0.0008491157,0.0006504393,0.0010765038,0.0044224947,0.0005492228,0.000014286725],"category_scores_gemma":[0.00012217303,0.0007325901,0.00028616795,0.00067910436,0.0006575949,0.0007096369,0.0017903683,0.00089221983,0.000064093445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001725298,0.00010735009,0.00017434292,0.00022075749,0.000037242313,0.00014827332,0.013702495,0.008281325,0.00009781224,0.15234475,0.00008534418,0.824783],"study_design_scores_gemma":[0.0014053967,0.00078315666,0.000069499874,0.0024150067,0.000025660645,0.0001764399,0.0000034230472,0.12441243,0.0011597704,0.8470055,0.02052643,0.0020173064],"about_ca_topic_score_codex":0.000022170578,"about_ca_topic_score_gemma":0.0001769764,"teacher_disagreement_score":0.82276577,"about_ca_system_score_codex":0.000900304,"about_ca_system_score_gemma":0.0012209987,"threshold_uncertainty_score":0.9999605},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007467939,0.000027357364,0.99756515,0.0003906804,0.00044452414,0.0010415115,0.0000064814576,0.000117339274,0.00033228344],"genre_scores_gemma":[0.42715502,0.0000011253758,0.5722933,0.00028703723,0.00015489387,0.00003168271,0.00001144052,0.000015262245,0.00005024541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969872,0.000036879384,0.00047715133,0.0012636533,0.0007087101,0.00052636716],"domain_scores_gemma":[0.9984928,0.0003587529,0.0001670891,0.00039248448,0.0004766393,0.00011228424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010704461,0.00032763815,0.00033262232,0.00076796464,0.00025780936,0.00035963272,0.00085363234,0.00027227568,0.00002577375],"category_scores_gemma":[0.00009817017,0.00033347704,0.00006330579,0.00082123384,0.0003739456,0.00074451976,0.00018364808,0.00062498305,0.0000041631633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008683042,0.000019442996,0.000049157523,0.000032754422,0.0000016197191,0.0000015030872,0.00014845828,0.5568424,0.00004571799,0.013850363,5.64694e-7,0.42899933],"study_design_scores_gemma":[0.0003172421,0.00017609455,0.00038583457,0.00016582909,0.0000035516316,0.000040490966,2.8612732e-7,0.8918586,0.0003315355,0.10639365,0.0000075789,0.0003193249],"about_ca_topic_score_codex":0.00004161153,"about_ca_topic_score_gemma":0.00016012548,"teacher_disagreement_score":0.42868,"about_ca_system_score_codex":0.0007610273,"about_ca_system_score_gemma":0.0016759275,"threshold_uncertainty_score":0.9999117},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031037274,0.0006105195,0.9915996,0.00027207492,0.001921281,0.0003218443,0.000010756394,0.00010435688,0.0051284987],"genre_scores_gemma":[0.007575976,0.000035809702,0.9913688,0.00041807303,0.00015847918,0.000005374976,0.000013535132,0.000029294133,0.0003946652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962255,0.000078662546,0.00079726154,0.0014415714,0.0008478742,0.00060918217],"domain_scores_gemma":[0.99704105,0.00038128986,0.00053263817,0.0017777072,0.00013101955,0.00013629593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015719443,0.00053086085,0.0008320028,0.0008771623,0.00016160782,0.00056112953,0.004366865,0.000207333,0.000020821371],"category_scores_gemma":[0.0000878539,0.00047888877,0.00016009188,0.000676567,0.00063600176,0.0011355213,0.0022981772,0.00063256174,0.000023317576],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030444235,0.000061655184,0.00018302549,0.00009279518,0.000026200181,0.000026262307,0.0006166864,0.0070519447,0.00013383167,0.05159555,0.00012695469,0.9400821],"study_design_scores_gemma":[0.00043684052,0.00032078597,0.00010929386,0.0006454559,0.000027503162,0.000022597598,0.0000011097067,0.82125217,0.0051150015,0.14873491,0.022099454,0.0012349134],"about_ca_topic_score_codex":0.0000306657,"about_ca_topic_score_gemma":0.000021822709,"teacher_disagreement_score":0.9388471,"about_ca_system_score_codex":0.00014566285,"about_ca_system_score_gemma":0.00021098868,"threshold_uncertainty_score":0.9997663},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010350923,0.00009371943,0.9948298,0.00018865774,0.0023175154,0.00066827034,0.00009466638,0.00010422207,0.0016928157],"genre_scores_gemma":[0.010847041,0.0000027201984,0.986112,0.00016927357,0.0015017455,0.00002123065,0.00015830669,0.00007908186,0.0011085862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974142,0.000011033763,0.000525421,0.00091999833,0.0007474317,0.00038194683],"domain_scores_gemma":[0.99433374,0.003261571,0.00035321413,0.001705479,0.00027935547,0.000066622706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055004365,0.0003827019,0.0004492137,0.0003236074,0.00024014866,0.00014562483,0.0016536698,0.00025935154,0.000042926753],"category_scores_gemma":[0.0012929076,0.0003464673,0.000081070015,0.00018343994,0.0003907134,0.00027324678,0.00079725083,0.000417434,0.000009383819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071213894,0.000031630192,0.0000017585156,0.000131225,0.000015092234,0.0000039455686,0.000065757114,0.0114900395,0.00003131691,0.9447018,0.001396284,0.04212401],"study_design_scores_gemma":[0.0002436965,0.00004252185,0.0000028393893,0.00011724916,0.000028723456,0.000008998075,7.266723e-8,0.122251935,0.00014997348,0.87508523,0.0017510504,0.0003176991],"about_ca_topic_score_codex":0.0000039708934,"about_ca_topic_score_gemma":0.000043212316,"teacher_disagreement_score":0.110761896,"about_ca_system_score_codex":0.00021483249,"about_ca_system_score_gemma":0.0003603938,"threshold_uncertainty_score":0.99989873},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020646346,0.00031667162,0.9912398,0.00008168406,0.0019178899,0.00063489645,0.00001303353,0.00057462975,0.005014924],"genre_scores_gemma":[0.57376677,0.0000051583033,0.42496312,0.0005856789,0.00032099077,0.000039338174,0.0000061687015,0.00005107696,0.00026169143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665755,0.000016019718,0.00047002948,0.0014814846,0.00064793264,0.00072700897],"domain_scores_gemma":[0.9973557,0.00063099636,0.00032813393,0.0011835939,0.0002934459,0.00020815873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044893517,0.00051740004,0.00043467636,0.00076106325,0.00030522683,0.00093005906,0.0026906806,0.00019870973,0.000005441873],"category_scores_gemma":[0.00041892577,0.00049951614,0.0002137814,0.00042613468,0.0004715789,0.0014660333,0.0009583827,0.000340378,0.0000386585],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060265734,0.000042721334,0.00006955413,0.00008022651,0.000012547662,0.000021851463,0.0004627765,0.002108703,0.0002934247,0.0043734773,0.00001005713,0.99251866],"study_design_scores_gemma":[0.0005388046,0.00032757362,0.00033299343,0.00054206833,0.000021721184,0.00007714969,1.950932e-7,0.6638496,0.022102464,0.3103949,0.00074714626,0.001065361],"about_ca_topic_score_codex":0.000026231484,"about_ca_topic_score_gemma":0.00011558381,"teacher_disagreement_score":0.9914533,"about_ca_system_score_codex":0.00020473202,"about_ca_system_score_gemma":0.00040097872,"threshold_uncertainty_score":0.99974567},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028819128,0.00007983001,0.9942021,0.0003313988,0.0008161749,0.00070673245,0.00007095563,0.00009833973,0.0034062841],"genre_scores_gemma":[0.18325824,0.000015248052,0.81536895,0.00018203245,0.0008986299,0.00003870269,0.00010962409,0.000028475257,0.000100086145],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759835,0.000032550073,0.0005155294,0.00087064103,0.0006611207,0.00032179613],"domain_scores_gemma":[0.9978409,0.000768459,0.00037633505,0.0006250601,0.0003228579,0.00006643157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049931847,0.00034835303,0.00039538136,0.00073924154,0.00028166658,0.00024237641,0.0013818906,0.00020277337,0.000015438238],"category_scores_gemma":[0.000032683845,0.00029980985,0.00014006149,0.00074250443,0.0005990923,0.00079390936,0.0001343948,0.0002644601,0.0000019983925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006391992,0.000059725953,0.00019942918,0.000052568128,0.000027605647,0.000010012528,0.0010678526,0.20169714,0.00029218322,0.23339392,0.00008510159,0.5630505],"study_design_scores_gemma":[0.0004518813,0.00034578817,0.00075089454,0.000433993,0.000025793393,0.000008543823,4.3338207e-7,0.33845812,0.0013376147,0.6569648,0.0008123134,0.0004098554],"about_ca_topic_score_codex":0.00008286463,"about_ca_topic_score_gemma":0.000592294,"teacher_disagreement_score":0.56264067,"about_ca_system_score_codex":0.00012570096,"about_ca_system_score_gemma":0.0004789598,"threshold_uncertainty_score":0.9999454},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015842314,0.0010248204,0.98480874,0.0052977484,0.0012263187,0.0003867193,0.0000030687304,0.00011125259,0.0055571143],"genre_scores_gemma":[0.5970022,0.0003210806,0.3741477,0.025507264,0.0013163734,0.00003740766,0.000009716955,0.000073630355,0.0015846203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603677,0.000094665775,0.00042142087,0.0013442623,0.0013451241,0.0007577529],"domain_scores_gemma":[0.9975028,0.00084312673,0.00017300373,0.0013020643,0.00009123591,0.00008776959],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000979399,0.0004973708,0.0004599901,0.0008563532,0.00029585997,0.00040724798,0.005413162,0.00031849524,0.000021927583],"category_scores_gemma":[0.00013726216,0.00033616027,0.00015856966,0.00074543036,0.000928151,0.00031518703,0.0010199947,0.0012429706,0.000050970022],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028903522,0.00009938408,0.0006370297,0.000050515344,0.000020369038,0.0020915999,0.03654171,0.011756956,0.000050948187,0.0084443875,0.00072010944,0.9395581],"study_design_scores_gemma":[0.0021039958,0.00080448,0.040354535,0.0013508073,0.00002816755,0.0040444164,0.000009986052,0.45447797,0.0007896089,0.42169303,0.07049923,0.0038437843],"about_ca_topic_score_codex":0.00004635226,"about_ca_topic_score_gemma":0.00012220023,"teacher_disagreement_score":0.9357143,"about_ca_system_score_codex":0.00017403193,"about_ca_system_score_gemma":0.00051217724,"threshold_uncertainty_score":0.99996805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040749528,0.0011326938,0.99500996,0.001208699,0.00042479057,0.00035149022,0.0000057338725,0.0005302781,0.0012955945],"genre_scores_gemma":[0.057545435,0.000013204617,0.94090253,0.0010595816,0.00024935708,0.000010024984,0.0000031100735,0.000022994134,0.00019378476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665225,0.000036233443,0.0004484788,0.0014064952,0.00086590706,0.00059066736],"domain_scores_gemma":[0.9981154,0.0005641335,0.00014120385,0.0008449282,0.0001444949,0.00018981405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005445276,0.0004494001,0.00045421196,0.0008064468,0.00020466415,0.00076281745,0.0033355118,0.00034371758,0.000042840333],"category_scores_gemma":[0.0001878158,0.0003727994,0.00006740481,0.000554948,0.00037156272,0.0005266057,0.0009469127,0.0008283752,0.000041767686],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004742582,0.000011348835,0.0000074034892,0.000021560587,0.000002940023,0.00016325401,0.0007919051,0.0011824777,0.00026809037,0.017161747,0.000030340401,0.9803542],"study_design_scores_gemma":[0.00024449686,0.0005821868,0.000074998155,0.0008318885,0.000012387674,0.0002437438,1.5711979e-7,0.5352527,0.0051859925,0.44958255,0.006559867,0.0014290512],"about_ca_topic_score_codex":0.000011032554,"about_ca_topic_score_gemma":0.000011801358,"teacher_disagreement_score":0.97892517,"about_ca_system_score_codex":0.00016120863,"about_ca_system_score_gemma":0.00009632483,"threshold_uncertainty_score":0.9998724},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020848498,0.00037758864,0.86416864,0.0024569046,0.0020905896,0.0023597549,0.00014816178,0.00026113784,0.10728873],"genre_scores_gemma":[0.97729164,0.000009798041,0.018312942,0.00043888472,0.00048964244,0.000022985074,0.000014180382,0.000037408867,0.0033825415],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960465,0.00008146686,0.0007297358,0.0012978528,0.0011356304,0.00070882554],"domain_scores_gemma":[0.99501866,0.0027841753,0.00044314587,0.001037555,0.0004996933,0.0002167884],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0029511629,0.00041840848,0.00076252554,0.00040296977,0.0005195747,0.0005301409,0.0026047395,0.00039678707,0.00015459003],"category_scores_gemma":[0.0018809657,0.00037890428,0.00037065186,0.00042982312,0.005876984,0.000808798,0.00059989665,0.00035478623,0.000017180095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009721047,0.0002580005,0.007986759,0.00074343407,0.000038633367,0.0000022561487,0.014305315,0.0010955276,0.000092136725,0.070984475,0.00043677446,0.90395945],"study_design_scores_gemma":[0.00055432407,0.00057505385,0.0036024782,0.0008942627,0.000045204153,0.000001980577,0.000039522383,0.011282562,0.0005819226,0.9649883,0.016263638,0.0011707831],"about_ca_topic_score_codex":0.0003859818,"about_ca_topic_score_gemma":0.002790449,"teacher_disagreement_score":0.95644313,"about_ca_system_score_codex":0.0004694213,"about_ca_system_score_gemma":0.0011155535,"threshold_uncertainty_score":0.9998663},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028307583,0.00040187655,0.96958566,0.0002722332,0.0004265179,0.00059201836,0.00003577824,0.000018418583,0.0003599114],"genre_scores_gemma":[0.69485706,0.000023702141,0.29924244,0.003041873,0.0020296292,0.000032114178,0.00021372557,0.000040449864,0.00051900756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984124,0.000010213575,0.00023973266,0.0008745309,0.00012884158,0.0003342835],"domain_scores_gemma":[0.9992583,0.000083859224,0.00011222185,0.00030472683,0.00015979615,0.00008113425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038520352,0.00026752378,0.000228647,0.000084660904,0.00016083816,0.0001312143,0.00034819188,0.00036257197,0.0000057055777],"category_scores_gemma":[0.00008119611,0.00021656153,0.00008960853,0.00003633508,0.00036649068,0.000007271574,0.00029252164,0.00014091945,0.0000011038227],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092050694,0.000049008417,0.00026502888,0.00008392458,0.000021438856,0.0000014963342,0.000065373984,0.0007186163,0.056915373,0.00055096624,0.00012158035,0.94111514],"study_design_scores_gemma":[0.002986211,0.0061809416,0.0005794596,0.00046924994,0.00006409663,0.00014112334,0.0000015989546,0.73390985,0.06070751,0.055844482,0.13623175,0.0028837104],"about_ca_topic_score_codex":0.0000018399049,"about_ca_topic_score_gemma":0.000023844192,"teacher_disagreement_score":0.9382314,"about_ca_system_score_codex":0.00002559956,"about_ca_system_score_gemma":0.000084605555,"threshold_uncertainty_score":0.88311225},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065434835,0.0011316423,0.9924485,0.0010434055,0.0016673815,0.00043664352,0.000006139404,0.00006366024,0.002548262],"genre_scores_gemma":[0.21610813,0.00008327656,0.77973557,0.0012799404,0.0016353279,0.000011238366,0.0000021735561,0.00005555181,0.001088777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942126,0.00014224998,0.000956043,0.0014226781,0.0024224808,0.0008439161],"domain_scores_gemma":[0.9938053,0.0032472964,0.00053335365,0.0017166473,0.0005682801,0.00012911795],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0054748203,0.00046246775,0.00049910235,0.00052015035,0.0017006893,0.0014522949,0.004137556,0.00026088156,0.00008784919],"category_scores_gemma":[0.00083397335,0.00024716658,0.0002472939,0.0015521839,0.0016762647,0.00022774917,0.0007200135,0.0011909915,0.000076248616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017048399,0.000008736386,0.00001840949,0.000002084448,0.000010274837,0.000011632141,0.0010284495,0.35897496,0.00016512016,0.00057708076,0.00001023522,0.6391913],"study_design_scores_gemma":[0.00010965384,0.000032779826,0.000099028315,0.00018988962,0.000027928761,0.000118127624,0.0000044328494,0.77768135,0.00039790114,0.21948871,0.0015109249,0.0003392605],"about_ca_topic_score_codex":0.00008500624,"about_ca_topic_score_gemma":0.00014507325,"teacher_disagreement_score":0.63885206,"about_ca_system_score_codex":0.00018465234,"about_ca_system_score_gemma":0.0007278982,"threshold_uncertainty_score":0.99999803},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011754794,0.00015180578,0.9864559,0.00016776635,0.00022511966,0.00020082158,0.000006266666,0.00010052243,0.011516324],"genre_scores_gemma":[0.92228395,0.0000069047333,0.07490229,0.0001720564,0.0019093893,0.000008529474,0.000029940917,0.000038230406,0.00064873276],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788237,0.000027780576,0.00040756052,0.0007422998,0.00049574947,0.00044425443],"domain_scores_gemma":[0.99871534,0.00035344184,0.0002807164,0.0004437383,0.00012959268,0.00007715216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026375917,0.000351321,0.00043711293,0.00058479246,0.0004805305,0.00014746083,0.00079993857,0.00015871701,0.00013573351],"category_scores_gemma":[0.000013253096,0.00035767356,0.00021628391,0.0005909359,0.00041027408,0.0001438713,0.0003965848,0.000673425,0.000026405402],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010048532,0.000079287776,0.02696933,0.000017438959,0.000073198564,0.00003654742,0.0021497444,0.01314506,0.0000152246375,0.03719309,0.0019060745,0.91840494],"study_design_scores_gemma":[0.0011111397,0.00021783092,0.012923403,0.00081651134,0.00021066879,0.000038525923,0.0000021178505,0.39504012,0.00039256705,0.53115326,0.054529008,0.00356481],"about_ca_topic_score_codex":0.000027082324,"about_ca_topic_score_gemma":0.000017465287,"teacher_disagreement_score":0.9211084,"about_ca_system_score_codex":0.00014773404,"about_ca_system_score_gemma":0.0002573223,"threshold_uncertainty_score":0.9998875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015948122,0.00035215166,0.9739767,0.0007051756,0.0021001417,0.00032465608,0.0000042967768,0.00024620674,0.022131214],"genre_scores_gemma":[0.34910148,0.00006338673,0.6438534,0.0013438786,0.0018724749,0.000014957623,0.0000076180977,0.000099341305,0.0036434538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99485344,0.000034109045,0.0006903217,0.0018935677,0.001534799,0.0009937814],"domain_scores_gemma":[0.99695593,0.0005299411,0.00021130376,0.0018449433,0.00027456207,0.00018334674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001039859,0.0005717471,0.0005283865,0.000978361,0.0003081835,0.0009887969,0.005221084,0.000351941,0.000038049457],"category_scores_gemma":[0.00009310576,0.0005482167,0.0001665438,0.00076894544,0.0011755816,0.0009607244,0.0024413108,0.001084501,0.00022946647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040041764,0.000027916827,0.00008806608,0.000029969762,0.000007353232,0.00022192215,0.00075038226,0.13900636,0.00033898224,0.038348213,0.00015390867,0.8210229],"study_design_scores_gemma":[0.00007771649,0.00016805412,0.00009744891,0.00040581412,0.0000053045533,0.000079373625,3.0966734e-7,0.7486147,0.016638858,0.2290933,0.0038451992,0.0009739229],"about_ca_topic_score_codex":0.00014007848,"about_ca_topic_score_gemma":0.0001305624,"teacher_disagreement_score":0.820049,"about_ca_system_score_codex":0.00046565657,"about_ca_system_score_gemma":0.0007177327,"threshold_uncertainty_score":0.9996969},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014734578,0.00020046234,0.9943062,0.000011781673,0.0011811074,0.00073426863,0.000005819017,0.0016495921,0.00043727516],"genre_scores_gemma":[0.59680927,0.000035526224,0.40213904,0.00014722202,0.0007020093,0.00001872088,0.000014704033,0.00008520077,0.00004832671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810594,0.000010424466,0.00042215266,0.00063746324,0.00026344907,0.0005605967],"domain_scores_gemma":[0.9992591,0.00013449288,0.000066623434,0.00036613023,0.00006786066,0.000105759325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030804798,0.00043905954,0.00037377878,0.00047757602,0.00014059755,0.00018101001,0.00068361126,0.00027750642,0.00001199915],"category_scores_gemma":[0.000012611325,0.00044879364,0.00013198653,0.00022582269,0.00024665118,0.00018329217,0.00018594452,0.00043973775,0.0000012828674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028001107,0.0000035260514,0.000002525527,0.000016505677,0.000009119976,0.000018301087,0.000035965397,0.532035,0.000022316399,0.000003961044,0.000040749546,0.4678092],"study_design_scores_gemma":[0.00012417532,0.00011392185,0.000014496989,0.00021533592,0.000030155155,0.000096832046,9.126629e-8,0.9983733,0.00006461168,0.0001851985,0.0003506033,0.00043125416],"about_ca_topic_score_codex":0.0000021584112,"about_ca_topic_score_gemma":0.000018442051,"teacher_disagreement_score":0.5953358,"about_ca_system_score_codex":0.00027205813,"about_ca_system_score_gemma":0.00003066668,"threshold_uncertainty_score":0.9997964},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065219286,0.0017812006,0.9762458,0.0007018236,0.0018838116,0.00028362137,9.27456e-7,0.00028263798,0.018167939],"genre_scores_gemma":[0.4379776,0.00013040965,0.55977625,0.0014928392,0.00027490398,0.000009144243,0.0000012720575,0.000029943385,0.00030766177],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957465,0.000037756996,0.0006960808,0.0015205144,0.0010336715,0.0009654587],"domain_scores_gemma":[0.9970106,0.000994768,0.00025423447,0.0014290054,0.0001958947,0.00011551363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017397881,0.0005522767,0.0007307562,0.0016926865,0.00017811057,0.00044793196,0.0041342746,0.0004460059,0.000008808868],"category_scores_gemma":[0.00040700898,0.0004855259,0.00013507859,0.00077639037,0.0010729523,0.000676283,0.001837923,0.0009362365,0.00003948349],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008398592,0.000033154636,0.0021934903,0.000058881265,0.000010788923,0.0007107862,0.0015616334,0.0065930844,0.00008209238,0.0485855,0.000011256463,0.9401509],"study_design_scores_gemma":[0.0010448776,0.00041974708,0.019020911,0.0020709296,0.000017465312,0.00053702266,0.0000070277424,0.20996833,0.0057124277,0.7553802,0.002888402,0.002932644],"about_ca_topic_score_codex":0.00016753306,"about_ca_topic_score_gemma":0.003644703,"teacher_disagreement_score":0.9372183,"about_ca_system_score_codex":0.00046248175,"about_ca_system_score_gemma":0.0005998999,"threshold_uncertainty_score":0.9997596},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014452403,0.0003497292,0.99725986,0.000019922325,0.00057462754,0.00017554812,0.000005763488,0.00010570724,0.0013643017],"genre_scores_gemma":[0.8680302,0.0013453523,0.128293,0.0012354505,0.0006429268,0.000010442872,0.00017903408,0.0001554377,0.000108186636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990383,0.0000073386154,0.00022623209,0.00034902338,0.0001920325,0.00018708361],"domain_scores_gemma":[0.99952585,0.00006892173,0.000046951136,0.00020615189,0.000088161156,0.000063983476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015103971,0.00021144174,0.00018775911,0.00027393797,0.00006706159,0.000074263204,0.00014519958,0.0001905509,0.00002818016],"category_scores_gemma":[0.0000312126,0.00020851291,0.000026852902,0.00012917574,0.00016437237,0.00011703792,0.000054452856,0.00021140248,0.000025734518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001986342,0.000003919554,0.000039411934,0.000062267405,0.0000037601042,0.0000057877196,0.00022505375,0.58214957,0.000083024235,0.00030439202,0.000008424692,0.41711238],"study_design_scores_gemma":[0.000114825,0.000034785146,0.00004709922,0.00023615689,0.000007306325,0.000009801861,5.6933622e-8,0.945516,0.0014313236,0.051798906,0.0005383635,0.00026538322],"about_ca_topic_score_codex":0.00001272273,"about_ca_topic_score_gemma":0.000059717066,"teacher_disagreement_score":0.8689669,"about_ca_system_score_codex":0.00008428772,"about_ca_system_score_gemma":0.00002625414,"threshold_uncertainty_score":0.85029095},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009718847,0.00025867007,0.9934401,0.000013653828,0.002883045,0.0027931738,0.000015964351,0.0002467859,0.00025144644],"genre_scores_gemma":[0.76055217,0.0000028741003,0.23838776,0.00009488104,0.0005373556,0.00011491271,0.000027329941,0.000094228555,0.0001884737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980012,0.000017061458,0.00055220927,0.0006513904,0.00032638485,0.00045173726],"domain_scores_gemma":[0.99811727,0.00077591033,0.00016590492,0.0005496009,0.00026056808,0.00013074222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007710207,0.0004151523,0.00048889173,0.00036475935,0.0001806624,0.00038946077,0.0005200024,0.0004846693,0.0000053285007],"category_scores_gemma":[0.00007982359,0.00038712902,0.00013793421,0.00010137644,0.00010290421,0.0003775825,0.000042310745,0.00032205987,0.0000069753332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027353179,0.0000067365213,0.0000048019483,0.00010016225,0.000013947988,9.876665e-7,0.00033487522,0.9825822,0.00069135136,0.000373655,0.0000046747136,0.01585927],"study_design_scores_gemma":[0.0011468981,0.00015100183,0.0000130935,0.00021534262,0.000013753886,0.0000040331474,7.829958e-7,0.99401164,0.000074364376,0.0018393621,0.002080094,0.0004496158],"about_ca_topic_score_codex":0.0000105548215,"about_ca_topic_score_gemma":0.0000343163,"teacher_disagreement_score":0.760455,"about_ca_system_score_codex":0.00016163263,"about_ca_system_score_gemma":0.00008019621,"threshold_uncertainty_score":0.9998581},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003458357,0.0015418966,0.9854234,0.00046146094,0.0005123686,0.00060557015,7.7950483e-7,0.00005750449,0.011051223],"genre_scores_gemma":[0.9808504,0.00006761762,0.017761806,0.0008927839,0.00035783445,0.000027894794,0.0000016824989,0.0000115861385,0.000028376922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736756,0.000051171366,0.00043861175,0.000968122,0.00075663143,0.00041790892],"domain_scores_gemma":[0.99875796,0.00023906356,0.00013461024,0.0007102337,0.00009726969,0.000060859715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009851033,0.00032892544,0.00036381304,0.00037795524,0.00016297768,0.0004249297,0.0019326904,0.000168369,0.0000015482876],"category_scores_gemma":[0.00005851982,0.00022733519,0.000047967103,0.000382175,0.00019895598,0.00025513725,0.00023457511,0.00049590535,0.000008924446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007691467,0.000039130642,0.000029067667,0.0001371572,0.000006376635,0.00007515276,0.009287027,0.37994176,0.000007560222,0.07050638,0.0000013350503,0.5399614],"study_design_scores_gemma":[0.00014056577,0.00004741641,0.000027692893,0.000241729,0.0000037097311,0.000045769157,5.93378e-7,0.6753525,0.0000030867545,0.32392523,0.000024228884,0.00018745459],"about_ca_topic_score_codex":0.000048633367,"about_ca_topic_score_gemma":0.0000593767,"teacher_disagreement_score":0.9805046,"about_ca_system_score_codex":0.00010502142,"about_ca_system_score_gemma":0.00021758123,"threshold_uncertainty_score":0.92704594},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012928695,0.00012587452,0.9912228,0.00142466,0.002182561,0.0012020505,0.000013661273,0.00025899784,0.00355645],"genre_scores_gemma":[0.010723439,0.000042594398,0.9851084,0.0017280431,0.0005895434,0.00006150133,0.000020347923,0.00006838177,0.0016577886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995383,0.000021326505,0.0007091964,0.0017933926,0.0011091728,0.0009839075],"domain_scores_gemma":[0.9968448,0.00056132115,0.0003695968,0.0014078572,0.0005148316,0.0003015833],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014814761,0.00060622144,0.000566767,0.00081766065,0.0004696457,0.0012800955,0.00375274,0.0005443969,0.00006761834],"category_scores_gemma":[0.00008972427,0.0005403374,0.00019896784,0.0004450678,0.0005484224,0.0010573892,0.0011322467,0.0014681024,0.000047867667],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062306126,0.000073097784,0.0000052297914,0.00016877339,0.000021119398,0.00003071046,0.0023495492,0.11722929,0.0014881783,0.022814536,0.00004179857,0.8557715],"study_design_scores_gemma":[0.00046259697,0.00016570199,0.00002453724,0.0003372062,0.000005461963,0.00005007238,2.2052433e-7,0.68424094,0.0012807561,0.30389178,0.008770638,0.000770096],"about_ca_topic_score_codex":0.00002081768,"about_ca_topic_score_gemma":0.00011040367,"teacher_disagreement_score":0.8550014,"about_ca_system_score_codex":0.00017091469,"about_ca_system_score_gemma":0.0006510854,"threshold_uncertainty_score":0.9997567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010223964,0.00020797533,0.9913067,0.0015048902,0.004296925,0.00083673635,0.000018725403,0.0008578105,0.0008679835],"genre_scores_gemma":[0.050308034,0.000026907883,0.946662,0.0016563993,0.0009495153,0.00005508572,0.00000876952,0.00005721535,0.00027604637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99526525,0.000033573306,0.0007835761,0.0019244916,0.0010865107,0.0009066086],"domain_scores_gemma":[0.99568653,0.0010983534,0.00047537213,0.0018717268,0.0006347545,0.0002332855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010344434,0.0006663094,0.0006474246,0.0008801865,0.00034701024,0.0009867591,0.004645029,0.00091428024,0.000043204018],"category_scores_gemma":[0.00082277064,0.0006228044,0.00023383106,0.00083034165,0.0010623193,0.00073663436,0.0011309966,0.0011921296,0.00009537444],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009060856,0.00003187936,0.000013009029,0.000034870092,0.000013245455,0.00002253036,0.0013466268,0.019303858,0.000983665,0.1205696,0.000037028476,0.8576346],"study_design_scores_gemma":[0.000048586306,0.00011778236,0.00005860824,0.00018859444,0.0000070889237,0.000025083118,1.3818816e-7,0.5372965,0.011840673,0.4476416,0.0023027775,0.0004726142],"about_ca_topic_score_codex":0.0000576929,"about_ca_topic_score_gemma":0.00013215441,"teacher_disagreement_score":0.857162,"about_ca_system_score_codex":0.00034192833,"about_ca_system_score_gemma":0.0010202423,"threshold_uncertainty_score":0.99962234},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022163465,0.00007511094,0.977829,0.00054086006,0.0009145331,0.00047572955,0.0000043438113,0.0003222957,0.01961654],"genre_scores_gemma":[0.33124837,0.0000014584786,0.66117376,0.006466154,0.00090677006,0.000011022215,0.000005331168,0.00003535047,0.00015179683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943406,0.000058670685,0.0005287466,0.0026562524,0.0015024736,0.00091328553],"domain_scores_gemma":[0.9962496,0.00033893707,0.00019908138,0.0026341449,0.00016506817,0.00041313915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088576117,0.0007298431,0.0005975102,0.0012479146,0.0003014056,0.0008317114,0.0052164067,0.00043927017,0.000012771339],"category_scores_gemma":[0.00009037613,0.0006564347,0.00013148302,0.00067482586,0.00025697873,0.0005970078,0.0007916802,0.0009391728,0.00003672854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048504394,0.000047314592,0.000022064347,0.000014486823,0.0000028235922,0.000020617588,0.001449612,0.6115002,0.00004387103,0.0059562777,0.0000138790665,0.380924],"study_design_scores_gemma":[0.00021956216,0.00029722994,0.000073707,0.0002798551,0.000004782458,0.00002493403,9.911312e-7,0.9921208,0.0004342446,0.0049991924,0.0007650392,0.0007796706],"about_ca_topic_score_codex":0.000011527201,"about_ca_topic_score_gemma":0.000042342002,"teacher_disagreement_score":0.38062057,"about_ca_system_score_codex":0.00037516718,"about_ca_system_score_gemma":0.00062835414,"threshold_uncertainty_score":0.99958867},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039322997,0.00042241396,0.99443346,0.00081392436,0.0025124503,0.00054490444,0.000005849959,0.00021904598,0.0010086048],"genre_scores_gemma":[0.015650291,0.00018857405,0.9800091,0.0023092728,0.0006009189,0.000018577366,0.0000068774157,0.000050377796,0.0011660234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633443,0.000020731044,0.0005686457,0.0015462143,0.0008464777,0.0006834819],"domain_scores_gemma":[0.9976295,0.00044331385,0.000363506,0.0011198026,0.0002553714,0.0001884754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005009801,0.0005261933,0.00047431802,0.00067279005,0.00046788485,0.00047111278,0.0020172482,0.00020887701,0.000012020863],"category_scores_gemma":[0.00005807757,0.00048823125,0.00018027668,0.00034493968,0.00029757994,0.0011257174,0.0008714239,0.0007225705,0.00003908332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000812686,0.000024837218,0.0000037175396,0.00003007301,0.0000060568336,0.000055516623,0.000880816,0.039203748,0.0008453791,0.0012721587,0.000075459415,0.9575941],"study_design_scores_gemma":[0.0004983739,0.00020948183,0.000025156669,0.0005700135,0.0000070536767,0.00032364903,7.2536807e-7,0.9232236,0.004423933,0.05716684,0.012693898,0.00085724134],"about_ca_topic_score_codex":0.000009173763,"about_ca_topic_score_gemma":0.000015401607,"teacher_disagreement_score":0.95673686,"about_ca_system_score_codex":0.00035788162,"about_ca_system_score_gemma":0.00030728002,"threshold_uncertainty_score":0.99975693},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008055709,0.00018050305,0.98480844,0.0014233479,0.0017844378,0.00045904604,0.000004739609,0.0006735247,0.0026102324],"genre_scores_gemma":[0.7084641,0.000005366094,0.29072654,0.00048097232,0.00018640282,0.000021998843,0.0000018923133,0.000029063374,0.0000836981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583095,0.000138604,0.00061606406,0.0013708301,0.0010523036,0.0009912346],"domain_scores_gemma":[0.99519944,0.0013695206,0.0002755632,0.0028050477,0.00020256397,0.00014786274],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018117866,0.0006735963,0.00071343355,0.002161482,0.0003164537,0.0006449164,0.0076665273,0.00047537684,0.0000032492821],"category_scores_gemma":[0.00027727656,0.00068383425,0.00013024335,0.0017411989,0.00061678427,0.0007171849,0.003857338,0.0031031459,0.000037310325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010257503,0.00011710865,0.0027091452,0.000037213555,0.00000591494,0.00019379584,0.00044302628,0.18336765,0.00048612413,0.00094909896,0.0001025703,0.8115781],"study_design_scores_gemma":[0.00079405995,0.00042697237,0.007330684,0.0026291397,0.0000072505336,0.00005005625,7.2041655e-7,0.87947154,0.012543626,0.09232782,0.0025692529,0.0018489059],"about_ca_topic_score_codex":0.00035654375,"about_ca_topic_score_gemma":0.0015222188,"teacher_disagreement_score":0.8097292,"about_ca_system_score_codex":0.0010789792,"about_ca_system_score_gemma":0.0005945323,"threshold_uncertainty_score":0.9995613},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078600744,0.0002907376,0.98212576,0.00016685831,0.0020174962,0.00095678115,0.0000064249207,0.00033709142,0.013312872],"genre_scores_gemma":[0.8636355,0.0000071584327,0.13458419,0.0011124155,0.0004581484,0.000058818478,0.0000046140563,0.00006909913,0.000070103284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934982,0.00019302839,0.0011378119,0.0025958514,0.0013024816,0.0012726045],"domain_scores_gemma":[0.9966174,0.0005148078,0.00040160056,0.0016232083,0.00049215724,0.00035084775],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019311438,0.0009063229,0.0011730952,0.002114333,0.00040198793,0.0014383125,0.0030084522,0.0005089918,9.184541e-7],"category_scores_gemma":[0.00014321072,0.0008806582,0.00016721901,0.0015874157,0.0002424763,0.00095918134,0.0015302377,0.0014451382,0.00003719085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075117905,0.000032350286,0.000060443734,0.00015026648,0.000014748846,0.00028784556,0.005121376,0.9323493,0.000025658164,0.010774122,0.000010729365,0.05116561],"study_design_scores_gemma":[0.00032765346,0.00012649005,0.000025100244,0.0032467714,0.000010243846,0.00035225938,0.000025562422,0.9923813,0.0001045861,0.0022964252,0.00013681474,0.00096684817],"about_ca_topic_score_codex":0.00010694866,"about_ca_topic_score_gemma":0.00007335868,"teacher_disagreement_score":0.8628494,"about_ca_system_score_codex":0.001178733,"about_ca_system_score_gemma":0.0007643969,"threshold_uncertainty_score":0.99959826},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000117334035,0.00014143177,0.99815625,0.00013106139,0.00018082833,0.0004808892,0.000027350748,0.00002601421,0.00073885405],"genre_scores_gemma":[0.66024345,0.00001631195,0.33908287,0.00041056142,0.0001239132,0.000033412158,0.000018525825,0.000016351592,0.000054579643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980332,0.000077133096,0.0004115889,0.0006384361,0.0006480772,0.0001915095],"domain_scores_gemma":[0.9960899,0.0023082884,0.00039823705,0.0010143762,0.00014427124,0.000044971213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014862731,0.00023493785,0.00031871308,0.00035537698,0.0001625891,0.00012080846,0.0016771357,0.00014675234,0.000009654586],"category_scores_gemma":[0.00009652781,0.00015765154,0.000055650442,0.00031828004,0.0007110742,0.00023340748,0.00055757834,0.00030609692,0.0000017157591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026441905,0.000035966856,0.000007973391,0.000041139476,0.0000053042745,0.0000025198235,0.00009079735,0.26572508,0.00028475112,0.3512007,0.00001884813,0.38256046],"study_design_scores_gemma":[0.00026745023,0.00006332393,0.000044754088,0.00021695103,0.0000058145315,0.0000047475805,7.244561e-8,0.66504145,0.0023557956,0.33179873,0.00006890348,0.00013200167],"about_ca_topic_score_codex":0.000042934673,"about_ca_topic_score_gemma":0.000005419696,"teacher_disagreement_score":0.66012615,"about_ca_system_score_codex":0.00005723813,"about_ca_system_score_gemma":0.00031733402,"threshold_uncertainty_score":0.64288425},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011760678,0.00023754039,0.9890065,0.00035073032,0.00072648673,0.0003115589,0.0000021774408,0.00020682039,0.0090405885],"genre_scores_gemma":[0.35656723,0.00007397036,0.64137024,0.0007730199,0.00010089308,0.000012719602,0.0000013341458,0.00004198122,0.0010586451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681944,0.000057884004,0.00067424745,0.0011881614,0.00074134866,0.0005189406],"domain_scores_gemma":[0.9977042,0.00021051349,0.00046709555,0.0012454919,0.00024142483,0.00013126594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010109782,0.0004673009,0.00066577166,0.0009082408,0.00013038401,0.00029366344,0.0029992557,0.00032711195,0.00000803313],"category_scores_gemma":[0.00006538918,0.000419579,0.00017616227,0.00043501842,0.00034129558,0.0005047016,0.0011915104,0.00090315664,0.000008433539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068731993,0.00007526368,0.000299517,0.000206992,0.000037674956,0.00006549738,0.002214007,0.08819107,0.0011978447,0.13810241,0.00035086388,0.769252],"study_design_scores_gemma":[0.0001661405,0.00022066376,0.000006544765,0.00060998404,0.0000044069416,0.000053018255,1.5070448e-7,0.88016474,0.002259213,0.11336644,0.002663791,0.00048489362],"about_ca_topic_score_codex":0.000021005164,"about_ca_topic_score_gemma":0.00005763784,"teacher_disagreement_score":0.7919737,"about_ca_system_score_codex":0.00019450855,"about_ca_system_score_gemma":0.00046605003,"threshold_uncertainty_score":0.9998256},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053272204,0.0012052887,0.99167204,0.002160062,0.0013770071,0.0004404295,0.0000041030366,0.00080587534,0.0022819003],"genre_scores_gemma":[0.17573111,0.0002655489,0.821204,0.0009873203,0.0003162793,0.00003985183,0.000014231054,0.000046018955,0.0013956599],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962173,0.00003080668,0.00059374084,0.0014928567,0.0009106702,0.00075460074],"domain_scores_gemma":[0.9966778,0.00026919678,0.00037916718,0.0022418033,0.0002529122,0.00017909241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075034174,0.0005427862,0.0004487654,0.001005178,0.0002964155,0.00059768365,0.0046173315,0.0005427954,0.000044988232],"category_scores_gemma":[0.000116007504,0.0004943804,0.00010556857,0.0007745311,0.0007952281,0.001276826,0.0013602262,0.00082871225,0.0003111232],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016650671,0.00005835531,0.00013136992,0.00001780061,0.0000062709805,0.0000054173966,0.00029533508,0.00012345755,0.0012195413,0.08054773,0.00004445955,0.9175486],"study_design_scores_gemma":[0.0005906204,0.00010033984,0.00094548194,0.00018060599,0.000012058265,0.000029142288,7.7412625e-7,0.90212405,0.004002756,0.08481736,0.006180732,0.0010161126],"about_ca_topic_score_codex":0.000007483461,"about_ca_topic_score_gemma":0.000016634822,"teacher_disagreement_score":0.91653246,"about_ca_system_score_codex":0.00040097733,"about_ca_system_score_gemma":0.00034306452,"threshold_uncertainty_score":0.9997508},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008016668,0.00086552993,0.9928887,0.00015965146,0.00077796885,0.00020694555,0.0000033752315,0.00011860103,0.0041775513],"genre_scores_gemma":[0.49722952,0.00002073631,0.5011348,0.0008164908,0.00040868693,0.000003170258,0.000005750696,0.000032076357,0.0003487828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972935,0.000025548661,0.000469143,0.0008992423,0.0008911983,0.0004213682],"domain_scores_gemma":[0.99788505,0.00033864382,0.00029946445,0.0012055724,0.00017784895,0.00009339481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001304875,0.000323131,0.00039335276,0.00075191044,0.00011148682,0.00016140564,0.0021028998,0.00023350959,0.00002147806],"category_scores_gemma":[0.000062423256,0.00028551035,0.00011250584,0.0004892039,0.00049374904,0.00015275784,0.0007132309,0.00037430064,0.000022168335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037936002,0.000031389547,0.000014388465,0.0000402713,0.000007702281,0.00006733282,0.0008288131,0.046974372,0.0012316647,0.13267192,0.000010300379,0.81811804],"study_design_scores_gemma":[0.00024329218,0.0001560162,0.00022164338,0.00047802483,0.000008213835,0.000067624,5.5754714e-7,0.8839207,0.018783232,0.094898604,0.0006337203,0.0005883458],"about_ca_topic_score_codex":0.00001661048,"about_ca_topic_score_gemma":0.000014646773,"teacher_disagreement_score":0.83694637,"about_ca_system_score_codex":0.00013098517,"about_ca_system_score_gemma":0.00018621769,"threshold_uncertainty_score":0.9999597},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039667295,0.00020953895,0.99570525,0.00033187307,0.0012445473,0.00052079017,0.000010265849,0.0010863924,0.00085165765],"genre_scores_gemma":[0.0059835804,0.00012771384,0.9923043,0.00038460144,0.0009343798,0.000028105174,0.000009350609,0.00008152561,0.00014644474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99477434,0.00002083542,0.0005804485,0.002017432,0.0017589071,0.00084804965],"domain_scores_gemma":[0.9966879,0.00013216327,0.00028701022,0.002244391,0.0003978571,0.00025068456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005087973,0.0008322103,0.00072290754,0.0010449687,0.0003252112,0.00034543715,0.0040491284,0.00045189215,0.0000038465328],"category_scores_gemma":[0.0000026018618,0.00074638467,0.00014741551,0.00059861306,0.0008544311,0.0008375877,0.00119319,0.0011676463,0.000019603687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056279,0.00002092376,0.0000039049946,0.000016802776,0.000006275627,0.000060887163,0.0005968236,0.83602697,0.00006396489,0.09912757,0.00059909857,0.06347113],"study_design_scores_gemma":[0.00019571144,0.00012690207,0.000006471288,0.00029181884,0.0000032801786,0.00012432731,1.4555968e-8,0.90835804,0.00028802728,0.06446529,0.025306167,0.0008339752],"about_ca_topic_score_codex":0.000006433667,"about_ca_topic_score_gemma":0.0000087706585,"teacher_disagreement_score":0.072331026,"about_ca_system_score_codex":0.0006395881,"about_ca_system_score_gemma":0.00062410545,"threshold_uncertainty_score":0.9994987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012099105,0.00042158933,0.99175906,0.0032987741,0.00059925596,0.0005806812,0.000013220565,0.0001599316,0.001957602],"genre_scores_gemma":[0.46720123,0.000010997738,0.5307865,0.0012842772,0.00037573624,0.000011026382,0.000019593152,0.000046317036,0.00026433062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673307,0.000068619585,0.00060373556,0.0010007374,0.0010344461,0.0005594131],"domain_scores_gemma":[0.9969995,0.0010720608,0.0004350211,0.0011211649,0.00019937738,0.00017285832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078535936,0.0004431013,0.0004869723,0.00097433204,0.00044914757,0.00034934882,0.0027079314,0.00016494168,0.00001331095],"category_scores_gemma":[0.000023631466,0.0003051677,0.00017100968,0.0012896792,0.0013331564,0.00028276234,0.0009929121,0.0006094033,0.0000122823185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020806752,0.0000790538,0.000009839432,0.000034507793,0.000029040617,0.000070170936,0.0014727352,0.582121,0.00011383785,0.111575946,0.000038091664,0.30443496],"study_design_scores_gemma":[0.00045830774,0.00027765427,0.0003439121,0.00041074335,0.000020030142,0.00012311748,9.232301e-7,0.9340848,0.0013310647,0.06163714,0.0008347262,0.00047760477],"about_ca_topic_score_codex":0.000016200092,"about_ca_topic_score_gemma":0.00004113043,"teacher_disagreement_score":0.46599132,"about_ca_system_score_codex":0.00013286024,"about_ca_system_score_gemma":0.000847789,"threshold_uncertainty_score":0.99994004},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003358573,0.0003659916,0.9941188,0.00030490835,0.00080352346,0.0007263574,0.0000030462318,0.000027514694,0.00029126983],"genre_scores_gemma":[0.31043047,0.00013804148,0.6889663,0.00016852155,0.000087780965,0.00004821939,0.000003135151,0.000017714792,0.00013985546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769765,0.00013433455,0.00063573144,0.00066357886,0.0005801264,0.0002885738],"domain_scores_gemma":[0.9978958,0.0006039428,0.00036066255,0.00082319864,0.00026444212,0.000052005482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025872763,0.00022446152,0.0002986737,0.0002598064,0.00013152017,0.00033223414,0.0011909789,0.00014238211,0.0000012054529],"category_scores_gemma":[0.00019216703,0.00016854535,0.000032744934,0.00043282413,0.00066479703,0.00067579845,0.00024614896,0.00036449227,0.00000418398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009710032,0.00002361767,0.00007824523,0.00026461817,0.000005380191,0.0000040354325,0.0029205203,0.08770306,0.0003079288,0.22790156,0.0000033746853,0.68077797],"study_design_scores_gemma":[0.00010019434,0.00007447073,0.0023140854,0.00026255084,0.0000020712262,0.000010510625,3.961481e-7,0.8210223,0.00031581655,0.17562737,0.00009543052,0.00017484062],"about_ca_topic_score_codex":0.00011345727,"about_ca_topic_score_gemma":0.00007014416,"teacher_disagreement_score":0.7333192,"about_ca_system_score_codex":0.00018413301,"about_ca_system_score_gemma":0.0001924063,"threshold_uncertainty_score":0.687308},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016343793,0.00055384974,0.99188566,0.0005327451,0.0010202503,0.000534733,0.0000090395215,0.0003277691,0.0051196315],"genre_scores_gemma":[0.0038371917,0.000031206462,0.9908137,0.0028622078,0.0005233888,0.000008343571,0.000004770828,0.000041736428,0.0018774772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563,0.00004703937,0.0005674684,0.0017963096,0.0010708602,0.0008882786],"domain_scores_gemma":[0.9970665,0.00061860675,0.00032742854,0.0014335822,0.00034942286,0.00020446604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018119508,0.0006129808,0.000656278,0.00066065585,0.0003917197,0.00084505393,0.003697723,0.00025304582,0.0000032209941],"category_scores_gemma":[0.00017133652,0.0005820414,0.00027140218,0.00037854977,0.00025042446,0.00080701703,0.00083203963,0.0007519801,0.000024020494],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001694374,0.000029212677,6.990778e-7,0.000049917093,0.000010421659,0.00021202661,0.0005925002,0.10240395,0.0003865501,0.009547937,0.00006572014,0.8866841],"study_design_scores_gemma":[0.00039574664,0.00013339237,0.0000022803004,0.00017472671,0.000012281152,0.00022404038,1.910052e-8,0.7804399,0.0013469269,0.21343389,0.0032889836,0.00054781546],"about_ca_topic_score_codex":0.0000046450327,"about_ca_topic_score_gemma":0.0000048682596,"teacher_disagreement_score":0.8861363,"about_ca_system_score_codex":0.00037239963,"about_ca_system_score_gemma":0.0009152728,"threshold_uncertainty_score":0.9996631},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009230643,0.000055055727,0.9752346,0.018549317,0.0034555863,0.00027415526,0.000003873288,0.00012659589,0.0013777297],"genre_scores_gemma":[0.66030157,0.000025492327,0.32623464,0.0070209573,0.0018169087,0.000016369202,0.000016918919,0.00006378571,0.0045033577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99632305,0.000028576773,0.00051218714,0.0015446953,0.0010294672,0.0005620331],"domain_scores_gemma":[0.9973838,0.00067520543,0.00029075023,0.0011666955,0.00024641564,0.00023717362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005482644,0.0005079503,0.0004956218,0.0012418852,0.00025955445,0.0008642142,0.0027252187,0.00022185079,0.00003348455],"category_scores_gemma":[0.0002635051,0.00044780606,0.000183987,0.0007030743,0.00018107654,0.00045807805,0.00095401285,0.0011452505,0.00020007428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000813314,0.00018000777,0.00080911967,0.00002667458,0.000047176567,0.000039090217,0.0014363943,0.49043036,0.000119766504,0.057339333,0.000026814312,0.44953713],"study_design_scores_gemma":[0.0016035113,0.0014894073,0.019118723,0.004155719,0.000090467736,0.000082980354,0.000005564477,0.47799563,0.00064944575,0.48406723,0.0062888185,0.0044525145],"about_ca_topic_score_codex":0.000020006322,"about_ca_topic_score_gemma":0.00004738925,"teacher_disagreement_score":0.65937847,"about_ca_system_score_codex":0.0008231087,"about_ca_system_score_gemma":0.000735667,"threshold_uncertainty_score":0.99979734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015229576,0.00097389374,0.99561036,0.00023722128,0.001593571,0.0005234514,0.0000036625188,0.0007575805,0.0001479832],"genre_scores_gemma":[0.03531709,0.0001060422,0.9633163,0.00046572735,0.00042260217,0.000019548293,0.0000035990245,0.00007902965,0.00027006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938737,0.00007121054,0.00060780765,0.0020432505,0.0021473703,0.0012566362],"domain_scores_gemma":[0.9892146,0.0076835365,0.00017816063,0.002183899,0.00034473947,0.00039508104],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011644886,0.00072595885,0.00065005705,0.0019117488,0.0004889983,0.0006395108,0.0061440533,0.0003883144,0.00002116968],"category_scores_gemma":[0.0026496549,0.00067023205,0.00020721486,0.001270528,0.00081817363,0.00058461627,0.0026625553,0.0016060077,0.00014717938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005620527,0.000018665904,0.00010292594,0.000016172331,0.000012887233,0.00045132588,0.0008581839,0.18395436,0.000048453545,0.00067191693,0.00012158926,0.81373787],"study_design_scores_gemma":[0.00076146855,0.0006463943,0.0021485987,0.0016955681,0.0000123042255,0.0021864406,1.4775986e-7,0.89500123,0.003237672,0.08759118,0.003923511,0.0027954613],"about_ca_topic_score_codex":0.000019218141,"about_ca_topic_score_gemma":0.000013507165,"teacher_disagreement_score":0.8109424,"about_ca_system_score_codex":0.00054633495,"about_ca_system_score_gemma":0.0011530338,"threshold_uncertainty_score":0.9995749},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016599822,0.0017758351,0.99480826,0.0007792945,0.0006769085,0.00043225742,0.0000032855494,0.00018859231,0.0011695642],"genre_scores_gemma":[0.083557144,0.00034488266,0.9142787,0.0012510523,0.00032886714,0.000013520873,0.000009520993,0.000033392902,0.0001829492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965684,0.000035516776,0.00046513273,0.0015606462,0.0007656994,0.0006046257],"domain_scores_gemma":[0.99773324,0.00042929233,0.00024751888,0.0011727567,0.00019822169,0.00021896524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007204178,0.0004994697,0.0004833533,0.00092707545,0.0004051709,0.0007051582,0.0019061866,0.0003015184,0.0000067225697],"category_scores_gemma":[0.000028641633,0.00045287545,0.00012682658,0.00075692305,0.0007627118,0.00063265295,0.00076631294,0.0007018236,0.000019606507],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003862028,0.00003886117,0.00007531911,0.000022045038,0.000008984524,0.00004038117,0.00038237832,0.0029763612,0.00006789639,0.01602461,0.000007918176,0.9803514],"study_design_scores_gemma":[0.00087870355,0.0003104559,0.0013610903,0.0005356613,0.00002066015,0.00016841882,3.500887e-7,0.82708335,0.0018591683,0.16487157,0.0019567136,0.00095383276],"about_ca_topic_score_codex":0.000038150367,"about_ca_topic_score_gemma":0.000022226699,"teacher_disagreement_score":0.97939754,"about_ca_system_score_codex":0.00009693137,"about_ca_system_score_gemma":0.00020434057,"threshold_uncertainty_score":0.9997923},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010429492,0.00021880372,0.99038744,0.000039046434,0.0009109308,0.00035422237,0.0000039850565,0.00083406235,0.00714719],"genre_scores_gemma":[0.08239432,0.0000047493013,0.91688937,0.00013923222,0.00041532668,0.000011976111,0.000016576018,0.00004148189,0.000086952845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605745,0.000080587044,0.0005424347,0.0017148913,0.0009196796,0.00068496313],"domain_scores_gemma":[0.99685514,0.0011398536,0.00029944244,0.0012966733,0.00027519223,0.00013372819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012442273,0.0006410281,0.0005325919,0.0007609466,0.00025759227,0.0007310783,0.0030397624,0.00032388064,0.000003038261],"category_scores_gemma":[0.0005295359,0.0005939678,0.00007920477,0.0008288189,0.00052443397,0.0015675327,0.00093124714,0.0010366966,0.000008056855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014188577,0.000023382245,0.000017683871,0.000019680416,0.000003604417,0.000031163363,0.00011389694,0.5795698,0.0009757224,0.012404746,0.000005233719,0.40683368],"study_design_scores_gemma":[0.00014834589,0.0003019779,0.00027251357,0.0001839535,0.0000062473755,0.000104123515,5.72704e-7,0.70282346,0.004305228,0.29101613,0.000042591935,0.0007948662],"about_ca_topic_score_codex":0.00005855467,"about_ca_topic_score_gemma":0.000042386575,"teacher_disagreement_score":0.40603882,"about_ca_system_score_codex":0.0005407979,"about_ca_system_score_gemma":0.00049007905,"threshold_uncertainty_score":0.9996512},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01738799,0.0002834877,0.97480917,0.00084699446,0.003852181,0.0018689636,0.000033199747,0.00036337582,0.0005546402],"genre_scores_gemma":[0.40088874,0.00000668245,0.59702915,0.0010352372,0.00048302574,0.000060453207,0.000002775786,0.00006168017,0.00043225335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99323964,0.00002483336,0.000962256,0.002229619,0.002195874,0.0013477951],"domain_scores_gemma":[0.9937225,0.00051286916,0.0006129421,0.002187818,0.00261616,0.00034771732],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020835786,0.00081941445,0.001064527,0.0014291327,0.00035804027,0.0005976058,0.0069087218,0.00047104686,0.000001965834],"category_scores_gemma":[0.000460965,0.00077027484,0.00015600918,0.0014593884,0.0002691413,0.0007039291,0.0044309753,0.0006672437,0.000027135715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007026137,0.000056147543,0.00070220866,0.0010425237,0.00006072349,0.000044219112,0.0088277925,0.45095026,0.01021473,0.0056350925,0.00014678808,0.5222492],"study_design_scores_gemma":[0.00032195527,0.000980224,0.00024322752,0.0030692893,0.000024925741,0.000058314417,0.0000040358464,0.9728179,0.012956087,0.0053245304,0.0028430074,0.001356489],"about_ca_topic_score_codex":0.00028791756,"about_ca_topic_score_gemma":0.000116916846,"teacher_disagreement_score":0.52186763,"about_ca_system_score_codex":0.00080057094,"about_ca_system_score_gemma":0.0006433908,"threshold_uncertainty_score":0.9994748},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023404456,0.00098922,0.9957226,0.0006421158,0.00074082153,0.0007455531,0.000009682739,0.0001211297,0.0007948692],"genre_scores_gemma":[0.0405255,0.00010651342,0.95761895,0.0012081973,0.0004240856,0.000016307526,0.0000043802206,0.00002932815,0.0000667525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964152,0.000020396486,0.00049813994,0.0016344596,0.0006394277,0.0007923708],"domain_scores_gemma":[0.99789864,0.00040400005,0.00029622868,0.00099136,0.00021737025,0.00019239845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000623022,0.0005504476,0.0005520463,0.00046837048,0.00034268122,0.0008486795,0.0021463493,0.00032744912,0.000008107285],"category_scores_gemma":[0.00007621051,0.00047272444,0.000109716275,0.00038090846,0.0005594779,0.00080455426,0.0012935415,0.0005302004,0.0000080533155],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006769886,0.000035951583,0.000109020955,0.00010376074,0.000015403839,0.000025519486,0.00085526775,0.03440195,0.00021735833,0.048226014,0.000017048713,0.91598594],"study_design_scores_gemma":[0.00030925163,0.0001642466,0.000037306505,0.0002778004,0.000006690693,0.00006323911,6.538288e-8,0.84110355,0.00010146465,0.15433267,0.0030671456,0.0005365756],"about_ca_topic_score_codex":0.000022127275,"about_ca_topic_score_gemma":0.000036255107,"teacher_disagreement_score":0.9154494,"about_ca_system_score_codex":0.00021866153,"about_ca_system_score_gemma":0.00045732246,"threshold_uncertainty_score":0.9997724},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000345584,0.0040148897,0.991547,0.0007482704,0.00042991154,0.0003441074,0.0000026613918,0.00013722139,0.0024303512],"genre_scores_gemma":[0.1298683,0.0029564442,0.8634248,0.0030073894,0.00028707687,0.000013323061,0.0000051651496,0.00006295395,0.00037458856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966421,0.000030943324,0.00035374783,0.0014789831,0.00092876615,0.00056543096],"domain_scores_gemma":[0.99768233,0.00066486554,0.00021097482,0.0010873372,0.00017739003,0.00017710624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004051409,0.0005215218,0.00047000538,0.0008377208,0.00036325495,0.00031829224,0.0016695308,0.00019950783,0.0000058975047],"category_scores_gemma":[0.0000662411,0.00038421026,0.000077547884,0.0008036902,0.0011921927,0.0003921786,0.00061079016,0.0007277977,0.000013713151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051458373,0.00013470608,0.0002566248,0.0002869249,0.00007565473,0.00078962074,0.0024844445,0.08799562,0.00005520131,0.031742312,0.00020728228,0.8759202],"study_design_scores_gemma":[0.0017192003,0.0023989137,0.0018974037,0.008862833,0.00005684415,0.001770207,5.509517e-7,0.8953283,0.0015710471,0.080229245,0.00300179,0.0031636867],"about_ca_topic_score_codex":0.000013594408,"about_ca_topic_score_gemma":0.000038311453,"teacher_disagreement_score":0.8727565,"about_ca_system_score_codex":0.000064626496,"about_ca_system_score_gemma":0.0003179268,"threshold_uncertainty_score":0.999861},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06193434,0.000107623026,0.93539286,0.0016094521,0.00030428125,0.0006064939,6.0475935e-7,0.000024392122,0.000019951338],"genre_scores_gemma":[0.7329709,0.0000032895794,0.26598263,0.00096469326,0.000063964784,0.00000841887,0.0000020732887,0.000003580345,4.8545456e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880904,0.00006666881,0.00019014068,0.00029541363,0.00044224085,0.00019649942],"domain_scores_gemma":[0.99905133,0.00017229373,0.000101786114,0.00029664132,0.0003393351,0.000038627702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093208393,0.000093910334,0.00014169792,0.000300793,0.000120463985,0.000032403907,0.00018414488,0.000037108104,0.0000013158601],"category_scores_gemma":[0.0002998,0.00006173598,0.00009432628,0.0022208726,0.00020939771,0.00012145862,0.000020288262,0.00008966659,1.8922424e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008925629,0.00015095016,0.03689272,0.00004752177,0.000009729583,2.5635376e-7,0.0024153402,0.028671123,0.051753975,0.00018722343,0.000033430548,0.87974846],"study_design_scores_gemma":[0.0019072064,0.001138899,0.18455729,0.00044677677,0.00009486359,0.00010200214,0.00000521676,0.6974003,0.07651417,0.037106074,0.00049748726,0.00022976518],"about_ca_topic_score_codex":0.000006658259,"about_ca_topic_score_gemma":0.0000028830098,"teacher_disagreement_score":0.8795187,"about_ca_system_score_codex":0.000032893426,"about_ca_system_score_gemma":0.00014006393,"threshold_uncertainty_score":0.251752},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018170438,0.00025284488,0.9958838,0.00047850647,0.00051559386,0.0006098569,0.000021444162,0.0003852828,0.0016709266],"genre_scores_gemma":[0.071794935,0.00004045067,0.92518723,0.0014838824,0.00034872832,0.000027798696,0.000053291504,0.000065765154,0.0009979202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967503,0.000051634477,0.00051819795,0.0011940578,0.00096472213,0.0005210756],"domain_scores_gemma":[0.99792904,0.00024143708,0.000512081,0.0008484437,0.00035118446,0.00011781382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046614365,0.00049645005,0.00046561487,0.00051128113,0.00030178245,0.0006604146,0.0020167718,0.00034425288,0.000034007047],"category_scores_gemma":[0.000045305467,0.00045730936,0.00012221189,0.00061814423,0.00067948573,0.0011340444,0.00050180266,0.0006007743,0.000024289633],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004840184,0.000051987194,0.000008080674,0.000052199764,0.000013597903,0.000039052822,0.00036984697,0.00038062973,0.037608348,0.0023806868,0.0003319613,0.9587588],"study_design_scores_gemma":[0.00026882006,0.00013329799,0.00005422647,0.00027054772,0.00001682972,0.000053397132,5.4473026e-7,0.8050526,0.16103989,0.03165019,0.0007276295,0.0007320299],"about_ca_topic_score_codex":0.000050070863,"about_ca_topic_score_gemma":0.000010665916,"teacher_disagreement_score":0.95802677,"about_ca_system_score_codex":0.00075379,"about_ca_system_score_gemma":0.00046660972,"threshold_uncertainty_score":0.99978787},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009839664,0.00018120394,0.99619055,0.0002656819,0.0002981874,0.0003568878,0.000019576632,0.00015775822,0.0015461834],"genre_scores_gemma":[0.055715565,0.00040555804,0.9432201,0.00013031307,0.00019782016,0.000006487006,0.000013483737,0.000028825714,0.00028186754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99440664,0.00015840352,0.0010348087,0.0016681707,0.0020869083,0.0006450396],"domain_scores_gemma":[0.99410653,0.001717332,0.0005601969,0.0025467863,0.0008493593,0.00021978296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019969244,0.00044987779,0.00090019713,0.0010522212,0.00039422914,0.0002693383,0.003897607,0.0003120679,0.00006132079],"category_scores_gemma":[0.00036018906,0.00042503423,0.0003190251,0.0013937097,0.0013986668,0.00051316206,0.0014791533,0.0008061813,0.000028352924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013049067,0.00054165703,0.0063150283,0.00038372813,0.00015444521,0.00014765504,0.0015903448,0.25012925,0.0061965976,0.028641794,0.00014334556,0.7057431],"study_design_scores_gemma":[0.0003366496,0.0001695202,0.008638914,0.0004888878,0.000022667045,0.00006621264,3.6985335e-7,0.9354538,0.0013793797,0.05162845,0.0007849898,0.001030194],"about_ca_topic_score_codex":0.00021725727,"about_ca_topic_score_gemma":0.00002959144,"teacher_disagreement_score":0.7047129,"about_ca_system_score_codex":0.0007035017,"about_ca_system_score_gemma":0.0022116236,"threshold_uncertainty_score":0.9998202},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000218891,0.00052741775,0.9944105,0.00020863682,0.0022942014,0.0010107141,0.000008751756,0.0003598046,0.0011580673],"genre_scores_gemma":[0.17099974,0.000018614603,0.8259871,0.000824596,0.0011579035,0.00004957809,0.000018747049,0.000059255093,0.0008844681],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950796,0.000038169583,0.00077694963,0.0020766945,0.0009995766,0.0010290585],"domain_scores_gemma":[0.996087,0.00086465117,0.00046115785,0.0018359425,0.00047406869,0.00027713634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030025328,0.00059410575,0.0007095647,0.0007781678,0.00038267183,0.0005865082,0.0037562628,0.00051087793,0.000008173357],"category_scores_gemma":[0.00039075015,0.00051071733,0.0002920984,0.00066142064,0.0007304579,0.00050964014,0.001141294,0.00070211984,0.000030432844],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008582041,0.00004008265,0.0003152249,0.00017702676,0.00001892514,0.000034096578,0.0006212234,0.0011753511,0.00001892467,0.0443039,0.000026734431,0.95325994],"study_design_scores_gemma":[0.0006784486,0.00050463085,0.0003931788,0.00025763855,0.000027282736,0.000098527526,3.1466618e-7,0.1579003,0.00083219615,0.8250653,0.012776779,0.0014653546],"about_ca_topic_score_codex":0.00006728877,"about_ca_topic_score_gemma":0.00018877407,"teacher_disagreement_score":0.95179456,"about_ca_system_score_codex":0.00039359013,"about_ca_system_score_gemma":0.00062103657,"threshold_uncertainty_score":0.99973446},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000753592,0.0017152653,0.9927649,0.0007370795,0.0034871467,0.0007536066,0.00006426653,0.00015216426,0.00031802597],"genre_scores_gemma":[0.016305268,0.000047378864,0.9810364,0.0008772725,0.0015448963,0.000007711311,0.0000789969,0.000030642983,0.000071400624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962434,0.00003309759,0.0006307506,0.0016643413,0.00078924274,0.0006391536],"domain_scores_gemma":[0.99598414,0.0014943186,0.00038508564,0.0016990507,0.00029298768,0.00014442689],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003156078,0.00045449514,0.00048253473,0.00041456873,0.00057124416,0.0010878288,0.0041240626,0.00024177186,0.0000014218068],"category_scores_gemma":[0.000116032745,0.00034334647,0.00008644644,0.00045417668,0.00051537796,0.00047884035,0.002628731,0.00061274366,0.000008693309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018054113,0.000010183546,0.000004957893,0.000035475878,0.000017662658,0.000015743643,0.0002908009,0.054149974,0.0000050160343,0.0033972845,0.00007323938,0.9419979],"study_design_scores_gemma":[0.00027816067,0.00008852302,0.000046862126,0.00030436192,0.000013208413,0.00012113225,4.3634196e-7,0.9692801,0.000023491495,0.023504497,0.0059306747,0.00040855567],"about_ca_topic_score_codex":0.00002965626,"about_ca_topic_score_gemma":0.00002693506,"teacher_disagreement_score":0.9415893,"about_ca_system_score_codex":0.00012049802,"about_ca_system_score_gemma":0.0003755488,"threshold_uncertainty_score":0.99994916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000122348265,0.0005047804,0.9979681,0.00015597642,0.0001000182,0.00089487527,0.000047013396,0.00001523961,0.00030178134],"genre_scores_gemma":[0.048270322,0.00003416517,0.9514165,0.000053171523,0.00010274267,0.00006215677,0.0000046426494,0.000023361126,0.000032917786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985135,7.131988e-7,0.0005677911,0.00058796327,0.00007195069,0.00025803578],"domain_scores_gemma":[0.9992468,0.00012096116,0.00024271116,0.00024262995,0.000088596134,0.00005829956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045923685,0.00020800238,0.0004459061,0.0002756828,0.00011677293,0.00005722108,0.00029992862,0.00018012772,0.0000072947687],"category_scores_gemma":[0.00005039975,0.00021181574,0.00007347659,0.00014306478,0.0002109075,0.000068638234,0.00006348556,0.00016897387,0.0000055111877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000095182195,0.00002801826,2.1575802e-7,0.00008433933,0.0000055145742,2.653265e-7,0.00030946438,0.39570743,0.000005864089,0.405474,6.924693e-8,0.1983753],"study_design_scores_gemma":[0.00017737459,0.00007864419,9.3934483e-7,0.00006598269,0.000003942724,0.0000025757543,1.717167e-7,0.51738334,0.00002021537,0.48213968,0.000009109072,0.00011803629],"about_ca_topic_score_codex":0.000013249096,"about_ca_topic_score_gemma":0.000001640134,"teacher_disagreement_score":0.19825727,"about_ca_system_score_codex":0.00011800396,"about_ca_system_score_gemma":0.000099808036,"threshold_uncertainty_score":0.8637595},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040114412,0.0003330485,0.9894099,0.0013910574,0.0047726943,0.00041708545,0.0000036257068,0.0003449257,0.0029265215],"genre_scores_gemma":[0.11066755,0.000041727464,0.88547915,0.0014478842,0.0017684634,0.000011525803,0.0000042571423,0.00006565118,0.0005137854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994355,0.000061801176,0.0009091593,0.0024048304,0.0011960996,0.0010730805],"domain_scores_gemma":[0.9957141,0.0006893831,0.0004926201,0.0023086038,0.00047787855,0.00031741074],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011552764,0.0008424167,0.00082431664,0.0013216562,0.00041888023,0.001278458,0.0063011697,0.00063884264,0.000104451945],"category_scores_gemma":[0.000105478946,0.00077455444,0.00026557106,0.00093433895,0.0020186687,0.0012027215,0.0024372826,0.002149753,0.00028541268],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005111146,0.00004233074,0.00012044273,0.000025338086,0.000022475298,0.00016550056,0.0048864414,0.017051205,0.0013537493,0.045713536,0.000027723185,0.93058616],"study_design_scores_gemma":[0.000109754175,0.0002486521,0.0001043002,0.00040873166,0.000008385139,0.0001142139,7.088363e-7,0.49032688,0.011937768,0.48860136,0.006777156,0.0013620938],"about_ca_topic_score_codex":0.00002762195,"about_ca_topic_score_gemma":0.0002204275,"teacher_disagreement_score":0.9292241,"about_ca_system_score_codex":0.00026609877,"about_ca_system_score_gemma":0.00066429185,"threshold_uncertainty_score":0.9997583},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024495619,0.000112043585,0.99481106,0.0017134628,0.00083619787,0.00054527726,0.0000041720336,0.00018278761,0.0017704798],"genre_scores_gemma":[0.052134667,0.000018507744,0.94527197,0.0021251095,0.00033523637,0.000025915866,0.0000103727825,0.000011133916,0.00006706421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979005,0.00001165001,0.0003848062,0.00065691496,0.0006074326,0.00043873204],"domain_scores_gemma":[0.9977899,0.000638204,0.00028577336,0.000861642,0.00034548368,0.00007896719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050392846,0.00035914927,0.00035225486,0.0005613415,0.00019641918,0.0006690995,0.0018869747,0.0003099048,0.000005896058],"category_scores_gemma":[0.00020673107,0.0002630293,0.00008009136,0.00038306921,0.0003664624,0.0014340471,0.00031896785,0.00048222733,0.000020988819],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010556327,0.0000059905583,0.000008101246,0.000016059505,0.0000045743354,0.000002523334,0.00075159577,0.021066245,0.0000025892857,0.2642923,0.000013666489,0.7138258],"study_design_scores_gemma":[0.0002455011,0.00031339875,0.00008253416,0.0004629696,0.000007631841,0.00003391909,8.411759e-7,0.5570177,0.00038883058,0.43618697,0.0048032566,0.00045645123],"about_ca_topic_score_codex":0.000018703342,"about_ca_topic_score_gemma":0.00016663769,"teacher_disagreement_score":0.71336937,"about_ca_system_score_codex":0.0002382361,"about_ca_system_score_gemma":0.00045016676,"threshold_uncertainty_score":0.9999822},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015799013,0.00009208487,0.9939241,0.00041281484,0.0035121639,0.0011501178,0.000004045757,0.00016696846,0.00057970703],"genre_scores_gemma":[0.42283913,0.0000546695,0.5740973,0.0009062845,0.0011995641,0.00011298345,0.00006816705,0.00005851769,0.00066340005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971924,0.00002854347,0.00053447246,0.0011575476,0.00064186176,0.00044520415],"domain_scores_gemma":[0.9983128,0.00024554628,0.00037975752,0.000715012,0.00023461753,0.00011231002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006402831,0.00035832296,0.0003394958,0.0006233921,0.00022860985,0.00043304486,0.0010262927,0.00023370904,0.000027117056],"category_scores_gemma":[0.000048917896,0.0003384215,0.00013937346,0.0003377407,0.00013673218,0.00080610806,0.00021729227,0.0003167341,0.000046020203],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012790897,0.000029692459,0.00003099239,0.000052861516,0.000011571785,0.000007953107,0.0015770415,0.009440886,0.00011771386,0.008958452,0.000027459471,0.9797326],"study_design_scores_gemma":[0.00055832014,0.00024099264,0.00010657481,0.00045523356,0.000012110829,0.0000310296,6.868154e-7,0.94532156,0.001455343,0.013569992,0.037677545,0.0005706105],"about_ca_topic_score_codex":0.000042341766,"about_ca_topic_score_gemma":0.000060477218,"teacher_disagreement_score":0.979162,"about_ca_system_score_codex":0.00045359382,"about_ca_system_score_gemma":0.0002175131,"threshold_uncertainty_score":0.9999068},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042064705,0.00010796663,0.97674966,0.0010528585,0.0016679455,0.00046254817,0.0000071548147,0.00034445504,0.019565372],"genre_scores_gemma":[0.020121194,0.0000056741974,0.97365725,0.0029282318,0.0006353715,0.000017211927,0.0000059247254,0.000050995557,0.0025781651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950219,0.000035258618,0.00050678826,0.0022403563,0.0012373178,0.0009583849],"domain_scores_gemma":[0.9968556,0.00020201743,0.00023103005,0.002032118,0.00025640926,0.00042281646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001068547,0.0006947024,0.00071331323,0.00094187935,0.00036374753,0.0008988165,0.005318376,0.00048801219,0.000011589301],"category_scores_gemma":[0.0001323132,0.00061652693,0.00017739173,0.00066635985,0.00043128277,0.00039480743,0.0021068766,0.0021503714,0.000114200666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031543213,0.00004174446,0.000009487925,0.000020859554,0.000006288636,0.000035135632,0.0010102942,0.3724018,0.00014417626,0.011387986,0.000039500304,0.6148996],"study_design_scores_gemma":[0.00019003284,0.0001100514,0.00001819946,0.0001101483,0.000004977923,0.000106191175,7.025015e-8,0.93104887,0.00022891854,0.06511028,0.0023540503,0.00071823766],"about_ca_topic_score_codex":0.000031236523,"about_ca_topic_score_gemma":0.00001990105,"teacher_disagreement_score":0.61418134,"about_ca_system_score_codex":0.00013901383,"about_ca_system_score_gemma":0.0005342826,"threshold_uncertainty_score":0.9996286},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012006023,0.0013573042,0.9932819,0.0007413755,0.00037707138,0.0016603977,0.000004898016,0.0006707296,0.0017862358],"genre_scores_gemma":[0.57051533,0.00041163413,0.42731935,0.0008905894,0.00022841967,0.00047333096,0.000006820173,0.00004220191,0.0001123211],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617547,0.000022432085,0.00045816728,0.0019767152,0.0007533247,0.00061388646],"domain_scores_gemma":[0.9969127,0.000281019,0.00022350236,0.002320329,0.00014437728,0.000118031174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007506099,0.0004891661,0.0004393298,0.00069083995,0.0002933894,0.0005283128,0.0036053578,0.00031579778,0.000014733245],"category_scores_gemma":[0.000029553808,0.00046249392,0.00008738036,0.0008452239,0.0014193727,0.000426168,0.004098823,0.0007306856,0.00003441775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001131078,0.000033548127,0.000044791115,0.00007820543,0.0000074199834,0.000023565502,0.00020200913,0.02641061,0.000009231443,0.09713565,0.000015040723,0.8760388],"study_design_scores_gemma":[0.00021434609,0.00016480981,0.00004244128,0.0001904583,0.000009793757,0.000025424624,5.635128e-7,0.12447644,0.0005251364,0.86423945,0.0094859125,0.00062520296],"about_ca_topic_score_codex":0.000021243879,"about_ca_topic_score_gemma":0.00005890234,"teacher_disagreement_score":0.8754136,"about_ca_system_score_codex":0.0006051396,"about_ca_system_score_gemma":0.00037192006,"threshold_uncertainty_score":0.9997827},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016873717,0.0003571582,0.9790049,0.0011135067,0.0006507547,0.0017973247,0.00005398515,0.000036653197,0.00011201022],"genre_scores_gemma":[0.87626404,0.000013461628,0.119349554,0.0036678356,0.00031683483,0.00009875225,0.0000034222062,0.000051514773,0.00023458533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971514,0.00011663365,0.00041727876,0.0010187672,0.0006751257,0.00062084827],"domain_scores_gemma":[0.9961752,0.0017368965,0.00028217325,0.0014536494,0.0002472542,0.000104787454],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013043018,0.00047882024,0.00049158104,0.00020347786,0.0017853791,0.00076437835,0.0027887293,0.000110596295,0.000018522955],"category_scores_gemma":[0.000028886689,0.00023897148,0.00013144,0.0003733449,0.0022960044,0.0004243935,0.0007312618,0.0004947283,3.9689456e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003335763,0.00015085387,0.00080515805,0.000060720304,0.00013613528,0.00030469772,0.029522948,0.004214834,0.000006899861,0.0022365197,0.00007975851,0.9624481],"study_design_scores_gemma":[0.0024702542,0.001928025,0.0015873844,0.00015113101,0.00007962699,0.0013326505,0.0001470272,0.9786955,0.00018098448,0.009763612,0.0028711746,0.00079260656],"about_ca_topic_score_codex":0.0000765941,"about_ca_topic_score_gemma":0.0063887206,"teacher_disagreement_score":0.9744807,"about_ca_system_score_codex":0.00009241722,"about_ca_system_score_gemma":0.00021644428,"threshold_uncertainty_score":0.99951416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000038541,0.00014998646,0.9942855,0.0013796738,0.00084064866,0.0010404006,0.000006356768,0.00044279106,0.001850753],"genre_scores_gemma":[0.001304389,0.000027496937,0.9930578,0.0047287256,0.00035522348,0.00006473473,0.000027206775,0.000044531564,0.00038987905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611807,0.00008676111,0.00063192094,0.0014907167,0.0010498503,0.000622665],"domain_scores_gemma":[0.9968877,0.0009912434,0.0004449865,0.001122298,0.00035022697,0.0002035664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016565165,0.00050781184,0.00043857106,0.00092106365,0.00030046844,0.0005783509,0.0024318038,0.00028008543,0.000033283955],"category_scores_gemma":[0.00022257274,0.00048044987,0.00016831521,0.0004638707,0.0006667622,0.0011847595,0.0005029523,0.0005357247,0.000020271515],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010457359,0.000025838423,0.0000027842877,0.0000603963,0.0000069892762,0.000033143726,0.00033042673,0.006579543,0.0009855062,0.008041386,0.00019754839,0.98372597],"study_design_scores_gemma":[0.0006876989,0.0002273311,0.000013728127,0.0005480409,0.000019869447,0.000042257765,5.956404e-7,0.7492743,0.04851317,0.19948752,0.0003485438,0.0008369454],"about_ca_topic_score_codex":0.000005237284,"about_ca_topic_score_gemma":0.000011659965,"teacher_disagreement_score":0.98288906,"about_ca_system_score_codex":0.00049667084,"about_ca_system_score_gemma":0.0004897315,"threshold_uncertainty_score":0.99976474},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016378902,0.00024185218,0.9878382,0.0001975461,0.0014360643,0.00043245972,0.000016307484,0.00044886608,0.009224887],"genre_scores_gemma":[0.054409143,0.000025713145,0.94299716,0.00073084916,0.00071894337,0.000006564588,0.000009680832,0.000078494304,0.0010234645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99488246,0.00006929744,0.00073191314,0.0019656473,0.0012362992,0.0011143605],"domain_scores_gemma":[0.996872,0.0002986482,0.0004559374,0.0018642151,0.00026323678,0.00024596165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010295406,0.0007085071,0.00080826215,0.00084838056,0.0005169303,0.0007835058,0.0032640274,0.0002952901,0.00002262159],"category_scores_gemma":[0.0000422634,0.00064973865,0.0002084413,0.0007603103,0.00042856432,0.0012055726,0.0021211212,0.000803501,0.00010669844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035512632,0.00024107395,0.0007104963,0.00046926987,0.000045725534,0.0013601866,0.0014701039,0.09125518,0.0030925854,0.055003442,0.0004658516,0.8458506],"study_design_scores_gemma":[0.00043184718,0.000056722092,0.00015449472,0.00080253335,0.000009608097,0.00014885773,1.9428641e-7,0.98511964,0.00031452076,0.010394109,0.0018018698,0.00076561334],"about_ca_topic_score_codex":0.00010861492,"about_ca_topic_score_gemma":0.000036604873,"teacher_disagreement_score":0.89386445,"about_ca_system_score_codex":0.00072088774,"about_ca_system_score_gemma":0.0004181663,"threshold_uncertainty_score":0.9995954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000091193324,0.000114268645,0.9969671,0.0003290381,0.00025552965,0.0010258495,0.000012960967,0.00026691143,0.0009371598],"genre_scores_gemma":[0.2234953,0.000012899626,0.77554435,0.00032487515,0.00019768483,0.00010091011,0.000006575587,0.000031477106,0.0002859161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953156,0.000041312684,0.0006888968,0.002320417,0.00085638306,0.00077740074],"domain_scores_gemma":[0.9944331,0.0016751549,0.00031849975,0.0024228857,0.0009211355,0.00022922279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028639808,0.0004809229,0.00058844226,0.0006285865,0.00039150496,0.0004133415,0.004242203,0.00040179916,0.000005132977],"category_scores_gemma":[0.0011316998,0.00043441646,0.00024319725,0.0009305612,0.00074985885,0.0006260121,0.0014572173,0.0007784194,0.000018554254],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000992815,0.00006602824,0.0001352172,0.00012763037,0.000010240784,0.0000027121469,0.00029111624,0.103411704,0.0011065485,0.008230639,0.000007655416,0.88660055],"study_design_scores_gemma":[0.00013082157,0.00008636893,0.000025053925,0.000065259206,0.0000072753733,0.000004130509,2.573425e-8,0.7104441,0.00039173523,0.28835973,0.0001509509,0.0003345356],"about_ca_topic_score_codex":0.00007259817,"about_ca_topic_score_gemma":0.00006188843,"teacher_disagreement_score":0.88626605,"about_ca_system_score_codex":0.00040855812,"about_ca_system_score_gemma":0.0012614462,"threshold_uncertainty_score":0.99981076},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027357114,0.000046532834,0.96976936,0.0006760781,0.0010757352,0.00069137255,0.0000042815896,0.00016720405,0.00021229254],"genre_scores_gemma":[0.88195956,0.00001916049,0.11667873,0.00051204284,0.00042649088,0.00003836677,0.0000016783428,0.000044380853,0.0003195929],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961309,0.00009461374,0.00046120223,0.0009849864,0.0017830022,0.0005452991],"domain_scores_gemma":[0.99378306,0.0033263974,0.00024593214,0.002313073,0.0002626184,0.00006892548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024822627,0.000359789,0.0003220192,0.00044290873,0.00042006944,0.00033367096,0.004940877,0.00023799243,0.00002408153],"category_scores_gemma":[0.001771619,0.00021368774,0.00013620708,0.0006377677,0.00085720315,0.0002997543,0.0015680277,0.0015253668,0.000024476314],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007098588,0.0002273481,0.0066629234,0.0006482895,0.000097603515,0.00007480247,0.010911539,0.03157547,0.015662622,0.035570286,0.00011819272,0.8983799],"study_design_scores_gemma":[0.002469253,0.0019475879,0.35424185,0.004989178,0.000048847993,0.00027837075,0.000008085482,0.17365886,0.039303035,0.4152092,0.0025001564,0.0053455792],"about_ca_topic_score_codex":0.00006312132,"about_ca_topic_score_gemma":0.00002940533,"teacher_disagreement_score":0.89303434,"about_ca_system_score_codex":0.0002588604,"about_ca_system_score_gemma":0.00040498274,"threshold_uncertainty_score":0.91814613},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035998542,0.0000791409,0.99695677,0.00049253023,0.0008898931,0.00073911593,0.000026409463,0.00025590012,0.00020026258],"genre_scores_gemma":[0.29568967,0.0000046371765,0.70311856,0.00085123134,0.00022738513,0.000026963433,0.000010833131,0.000035465382,0.000035236302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582285,0.000037990372,0.00054641825,0.0019626454,0.00077232806,0.0008577759],"domain_scores_gemma":[0.9973276,0.0003677208,0.0002262083,0.0015368769,0.00023926875,0.00030232407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014168672,0.0006175642,0.00056238513,0.0007466593,0.00044800172,0.00071981526,0.004111448,0.00036810484,0.000008170758],"category_scores_gemma":[0.000055597484,0.0005542688,0.00024869357,0.00047491,0.0008512259,0.0010134975,0.00071781414,0.0008413267,0.000007381335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009474412,0.000033313743,6.9118727e-7,0.000035763267,0.000005303717,0.000022859005,0.0011980891,0.6136825,0.00004296307,0.3334084,0.0000011047913,0.051559553],"study_design_scores_gemma":[0.00017464787,0.00016660603,0.0000027485185,0.00012646023,0.000005266393,0.00003626707,1.375085e-7,0.50353044,0.0001014025,0.49549216,0.000006882415,0.00035698456],"about_ca_topic_score_codex":0.0000056963427,"about_ca_topic_score_gemma":0.000016558777,"teacher_disagreement_score":0.2953297,"about_ca_system_score_codex":0.00021237548,"about_ca_system_score_gemma":0.00069035566,"threshold_uncertainty_score":0.9996909},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018383311,0.00084136915,0.9767743,0.0006713826,0.001603081,0.001200917,0.0000068716035,0.00007619852,0.00044259586],"genre_scores_gemma":[0.85667896,0.00008994914,0.14210431,0.00045679917,0.00046697885,0.000042617725,0.000006475947,0.00002431694,0.00012955458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962355,0.00005510965,0.0009117718,0.0014010752,0.00090848864,0.0004880875],"domain_scores_gemma":[0.99749184,0.00042919785,0.0006302626,0.0011004811,0.00020886004,0.00013937408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017858901,0.00042111007,0.0007647929,0.0007700112,0.00010202753,0.00021871098,0.0014690815,0.000530057,0.000012658454],"category_scores_gemma":[0.00018425722,0.00036013854,0.000100798454,0.00041677975,0.0004834364,0.0006472936,0.0011044879,0.00072733336,0.0000056755725],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015669448,0.0004623167,0.020973498,0.0009804239,0.00004664606,0.0043560234,0.012758367,0.0009415849,0.018331837,0.031823613,0.00002879687,0.90914017],"study_design_scores_gemma":[0.0044915657,0.001979823,0.21662316,0.0058756047,0.000053887514,0.004541862,0.0000022316376,0.60514313,0.011558745,0.1416179,0.0040400643,0.0040720254],"about_ca_topic_score_codex":0.00016363576,"about_ca_topic_score_gemma":0.0002501233,"teacher_disagreement_score":0.90506816,"about_ca_system_score_codex":0.00013174316,"about_ca_system_score_gemma":0.00028208905,"threshold_uncertainty_score":0.9998851},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000096558324,0.00033734128,0.9929522,0.0002254364,0.0015671614,0.0009796725,0.0000021414394,0.00037217524,0.0034672953],"genre_scores_gemma":[0.69592214,0.000016270424,0.30243644,0.00055279775,0.00070305093,0.00007053438,0.000009489906,0.000030108467,0.00025919074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634296,0.00003120656,0.00059496594,0.0015091612,0.0007911505,0.00073053327],"domain_scores_gemma":[0.9975587,0.00036648975,0.00037176066,0.0012346815,0.0002996218,0.00016873323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001275113,0.0005011409,0.0005116691,0.00049473136,0.00044709048,0.00069743494,0.002584644,0.0008536832,0.000007646094],"category_scores_gemma":[0.00012251602,0.00042293355,0.00017483621,0.00044397885,0.0005307459,0.00034575353,0.00058677874,0.0009680622,0.000016705313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011838381,0.000041948657,0.00016788453,0.0001309502,0.000009810144,0.000016358159,0.00047202868,0.026083538,0.00011703498,0.16284455,0.00011992284,0.80998415],"study_design_scores_gemma":[0.00022877158,0.00040895387,0.00012275956,0.00018932819,0.000010950709,0.000046704994,2.8408283e-7,0.8539312,0.0032748466,0.118283965,0.022606295,0.00089596823],"about_ca_topic_score_codex":0.000017978113,"about_ca_topic_score_gemma":0.000007879623,"teacher_disagreement_score":0.82784766,"about_ca_system_score_codex":0.0003648964,"about_ca_system_score_gemma":0.0003413084,"threshold_uncertainty_score":0.99982226},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005437103,0.0014879599,0.99251413,0.0010811576,0.0014351064,0.0003098247,0.00002294673,0.00030245876,0.0027920622],"genre_scores_gemma":[0.10987447,0.0003036881,0.88390696,0.003976188,0.001096121,0.000013488902,0.00005359352,0.00006473515,0.00071073195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99470854,0.00004783397,0.0007027849,0.0021326975,0.0014048435,0.0010033164],"domain_scores_gemma":[0.99707496,0.00044466782,0.00045935533,0.0015072778,0.0002360253,0.00027773704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010295673,0.0007031415,0.00065578753,0.00056521205,0.00054727803,0.001012198,0.0050964635,0.00034068435,0.000021044805],"category_scores_gemma":[0.00010569268,0.000621085,0.00013098454,0.0006800159,0.0006722682,0.0016911823,0.0014971258,0.0010532656,0.00003140984],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023346015,0.000017188033,0.0000137574225,0.000016531696,0.0000059655545,0.00013706664,0.0002807279,0.0038299088,0.0012422219,0.010642062,0.00010931118,0.9837029],"study_design_scores_gemma":[0.00028227575,0.00021904278,0.000033299155,0.00088657154,0.000008641036,0.00017439194,3.2172008e-7,0.80964077,0.0019741924,0.17812945,0.0074956296,0.0011554206],"about_ca_topic_score_codex":0.000066866,"about_ca_topic_score_gemma":0.000022031281,"teacher_disagreement_score":0.9825475,"about_ca_system_score_codex":0.00031958797,"about_ca_system_score_gemma":0.00048243642,"threshold_uncertainty_score":0.9996241},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08399125,0.00031645695,0.91420007,0.0003997795,0.00022881561,0.00046591662,0.000008025072,0.000043092485,0.00034660104],"genre_scores_gemma":[0.8293918,0.000021403666,0.1702119,0.00018888742,0.00010323376,7.1467537e-7,0.0000051038855,0.000019707037,0.000057289242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815536,0.000009694833,0.00043434746,0.00066966016,0.0004564958,0.00027443247],"domain_scores_gemma":[0.9985545,0.0002545921,0.00024075604,0.000585743,0.00025237293,0.0001120201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030299975,0.0002716862,0.00052152894,0.00031487466,0.000079985446,0.000042813983,0.00016147531,0.00016480389,0.000023114828],"category_scores_gemma":[0.0005915312,0.0002322502,0.000066568835,0.00021629668,0.0008080095,0.00020248293,0.0003107113,0.00031208104,0.0000023780447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016981443,0.00020176661,0.057607777,0.0012075766,0.00005354778,0.00011725419,0.0027272305,0.46302474,0.005161855,0.0018832068,0.000009732827,0.46783552],"study_design_scores_gemma":[0.00047847722,0.00009868022,0.00512133,0.00091146573,0.000041067062,0.0001455751,6.207643e-7,0.9753038,0.0019239091,0.015725484,0.00002116178,0.0002283771],"about_ca_topic_score_codex":0.0000785829,"about_ca_topic_score_gemma":0.00006712863,"teacher_disagreement_score":0.7454005,"about_ca_system_score_codex":0.0001874071,"about_ca_system_score_gemma":0.00044952988,"threshold_uncertainty_score":0.94708884},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47740373,0.000010576482,0.5207989,0.00085100264,0.00051021436,0.00013787918,5.5619523e-7,0.000042808486,0.00024434138],"genre_scores_gemma":[0.77191734,6.967182e-7,0.22356161,0.0041843005,0.000318147,0.0000030492736,0.0000053254103,0.0000061167816,0.0000033935544],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986819,0.000024514113,0.00019421111,0.00044517627,0.00037526313,0.00027893146],"domain_scores_gemma":[0.99906933,0.00024051405,0.000040927855,0.00038588955,0.00009259291,0.00017073164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033635282,0.000119595235,0.00016045968,0.00010774447,0.00016940889,0.00012859578,0.0002073196,0.0000767577,0.00010230833],"category_scores_gemma":[0.0002801747,0.00009889418,0.000019704205,0.00076188985,0.00026956107,0.00038722885,0.000039602044,0.0003318301,0.000019865014],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005824032,0.00015402834,0.0237785,0.00002124929,0.000005019532,0.000060772985,0.0057018762,0.012676405,0.0667531,0.00037246998,0.0000074656646,0.8904109],"study_design_scores_gemma":[0.0063057328,0.0031320865,0.56059027,0.00041022134,0.000041177875,0.00070883177,0.00002860276,0.18308307,0.18201311,0.013133533,0.04920326,0.0013500988],"about_ca_topic_score_codex":0.00009505994,"about_ca_topic_score_gemma":0.00037953135,"teacher_disagreement_score":0.8890608,"about_ca_system_score_codex":0.00004176483,"about_ca_system_score_gemma":0.00017762388,"threshold_uncertainty_score":0.40327877},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039649913,0.0012085437,0.88723713,0.00022667465,0.0022639832,0.00029826775,0.0001082821,0.00007147561,0.10462065],"genre_scores_gemma":[0.9484591,0.0010242863,0.041862138,0.0018464547,0.0010206385,0.000005804702,0.000014262891,0.00008038837,0.0056869444],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772054,0.0000055349315,0.0006564152,0.0010695335,0.00006847971,0.0004794932],"domain_scores_gemma":[0.99843466,0.00009379265,0.0005632706,0.0007556387,0.000031786356,0.00012084511],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008281682,0.00034487032,0.00059442193,0.00059923594,0.00018416329,0.00019734954,0.00092774304,0.00026619175,0.0002734791],"category_scores_gemma":[0.000065632485,0.00040034347,0.00015801369,0.00013136545,0.00029323928,0.00028183684,0.00031613564,0.00056695193,0.0004516399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013182949,0.000036842335,0.0016010422,0.000027459457,0.00003328886,0.000038165752,0.0009843078,0.077976935,0.000001646296,0.44900805,0.00006485095,0.47021422],"study_design_scores_gemma":[0.00028978247,0.000075651275,0.0008149703,0.00008383407,0.0000041471453,0.000008607901,1.6362092e-7,0.063088365,0.000033662713,0.9065441,0.028499523,0.00055717974],"about_ca_topic_score_codex":0.00009924621,"about_ca_topic_score_gemma":0.0000624006,"teacher_disagreement_score":0.94449407,"about_ca_system_score_codex":0.0003518077,"about_ca_system_score_gemma":0.00006979171,"threshold_uncertainty_score":0.99984485},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009230594,0.00041171664,0.9910365,0.00025044152,0.0021427001,0.0009872315,8.848874e-7,0.00014050865,0.0049377116],"genre_scores_gemma":[0.8396555,0.000011936438,0.15919241,0.0005225134,0.00041928492,0.000013065209,0.0000016787426,0.000018776434,0.00016483368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639237,0.00008524156,0.00086449936,0.0009862856,0.0011340537,0.0005375727],"domain_scores_gemma":[0.995808,0.0012218927,0.0008762857,0.0015910878,0.00042777235,0.00007495926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032062691,0.00039747418,0.0006996854,0.0002641884,0.00028028523,0.00041935573,0.0028795707,0.00032284713,0.000008204122],"category_scores_gemma":[0.00039599955,0.0002558986,0.00021716558,0.0005492968,0.0009264666,0.0006054257,0.0007995122,0.00063317834,0.00001441817],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020678384,0.000054744305,0.00012186752,0.00011317926,0.000027234531,0.000020051928,0.002653593,0.003987262,0.00019045049,0.26938006,0.0000070387455,0.72342384],"study_design_scores_gemma":[0.0011405366,0.0003187339,0.00018381736,0.00006709097,0.000027058246,0.00006413734,0.0000013045162,0.6514826,0.0021311035,0.34220234,0.0018056415,0.000575688],"about_ca_topic_score_codex":0.00017668033,"about_ca_topic_score_gemma":0.00010389527,"teacher_disagreement_score":0.8395632,"about_ca_system_score_codex":0.00023108964,"about_ca_system_score_gemma":0.00043101935,"threshold_uncertainty_score":0.99998933},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007548176,0.000050731036,0.9899422,0.0017482355,0.00016833072,0.0003942658,0.0000034978702,0.00008156878,0.00006300834],"genre_scores_gemma":[0.6610194,0.0000012597579,0.3385609,0.00034981134,0.000037178615,0.00002446545,0.0000025850907,0.0000033032134,0.0000011281722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980323,0.000069126894,0.00043566982,0.0005396061,0.000582203,0.00034110938],"domain_scores_gemma":[0.9988526,0.00021719195,0.0001481216,0.0005999436,0.00012333071,0.000058828653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056122127,0.00014426139,0.0001685164,0.00016571736,0.00011255674,0.00020311831,0.0015235262,0.0000484386,0.0000041218473],"category_scores_gemma":[0.00006141563,0.00010871261,0.00004097123,0.0016728443,0.0006017546,0.0006396254,0.00027006905,0.00022618793,0.0000014802092],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048589627,0.0002509879,0.010588837,0.000026937987,0.0000017765734,0.0000044071026,0.0005560814,0.01807541,0.2328414,0.001469096,0.000127774,0.73605245],"study_design_scores_gemma":[0.00023500303,0.000016189784,0.0129975,0.00005090759,0.0000012785633,0.000020313435,7.264494e-7,0.5169461,0.4602367,0.009359862,0.0000060093735,0.00012946701],"about_ca_topic_score_codex":0.00013673394,"about_ca_topic_score_gemma":0.000076432145,"teacher_disagreement_score":0.735923,"about_ca_system_score_codex":0.00011882924,"about_ca_system_score_gemma":0.00014706558,"threshold_uncertainty_score":0.44331715},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019148492,0.00061040925,0.9955308,0.0004443643,0.0006848651,0.00016733636,0.000011660176,0.00024146821,0.00039424628],"genre_scores_gemma":[0.09248634,0.00007602611,0.9066923,0.00026118255,0.00030358168,0.0000057030006,0.0000021017797,0.000021054282,0.00015167963],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978665,0.000052934556,0.0002621445,0.0010021185,0.00045057645,0.0003657405],"domain_scores_gemma":[0.99740064,0.0018563695,0.0000861105,0.00047343757,0.00006221478,0.00012124755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005434917,0.0003452253,0.00036999024,0.0005039339,0.0003363574,0.0004220714,0.0010609217,0.0002489062,0.000007395171],"category_scores_gemma":[0.00037684612,0.0003369517,0.000038060658,0.00026829212,0.00050707575,0.0005927881,0.0009822757,0.00064660487,0.000007811217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007051169,0.000006731588,0.00023035065,0.000026388278,0.000015836165,0.000051416147,0.011556255,0.042736217,0.00014852075,0.022719163,0.000016721235,0.92248535],"study_design_scores_gemma":[0.00013473476,0.000074984455,0.0031198794,0.00016894481,0.000008364926,0.000038110036,0.0000022466947,0.011624805,0.0004907249,0.9826306,0.0010112812,0.0006953335],"about_ca_topic_score_codex":0.000028978211,"about_ca_topic_score_gemma":0.00004739734,"teacher_disagreement_score":0.9599114,"about_ca_system_score_codex":0.0001098837,"about_ca_system_score_gemma":0.00011162781,"threshold_uncertainty_score":0.99990827},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009239728,0.0022250942,0.68547523,0.0025689376,0.005872604,0.005671416,0.0001519521,0.00031139262,0.2967994],"genre_scores_gemma":[0.8698295,0.00015987706,0.08134461,0.002730479,0.006752509,0.0004403853,0.000048370257,0.00017949824,0.038514808],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99642324,0.000044639783,0.0005352522,0.0012451832,0.0009673056,0.00078438275],"domain_scores_gemma":[0.9974837,0.00092834595,0.0002632536,0.00078663585,0.0003205308,0.00021757367],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019821266,0.00038086443,0.0005826402,0.00029105463,0.00059534435,0.0028506785,0.0044288267,0.0003313159,0.00006932276],"category_scores_gemma":[0.00056391687,0.00034867207,0.00016755966,0.00037964695,0.002468943,0.0014429855,0.0011899926,0.00029764354,0.00004107665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021468819,0.000086867316,0.00035797784,0.00015705117,0.000020735408,0.0000066244684,0.006065657,0.008338502,0.000005986961,0.17532492,0.00036295078,0.80925125],"study_design_scores_gemma":[0.00061138213,0.00031019605,0.00017496862,0.0008491566,0.000035002005,0.000008782084,0.000031969415,0.02212247,0.000071923336,0.6454224,0.32859102,0.0017707205],"about_ca_topic_score_codex":0.00093129626,"about_ca_topic_score_gemma":0.0051185135,"teacher_disagreement_score":0.8689055,"about_ca_system_score_codex":0.0008860741,"about_ca_system_score_gemma":0.0012863859,"threshold_uncertainty_score":0.9998965},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001225882,0.0008746852,0.9964325,0.00046805068,0.0005141724,0.00084383524,0.0000024244825,0.00015034723,0.00059140625],"genre_scores_gemma":[0.41371563,0.00009326731,0.584291,0.0008181402,0.0007592473,0.000053657834,0.000020630341,0.000043501503,0.00020491572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968159,0.000035623012,0.0005624115,0.0014308739,0.00045069537,0.00070447056],"domain_scores_gemma":[0.9976288,0.00087086414,0.00034123345,0.0008315833,0.00020373156,0.00012378494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007154526,0.0004742605,0.00049548823,0.0005777571,0.00028705673,0.0008139358,0.0014326931,0.00039602173,0.0000011778466],"category_scores_gemma":[0.00003101352,0.00046416413,0.000083081584,0.0005259841,0.00038252355,0.00053295394,0.0003843491,0.00061597786,0.0000016884616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026120433,0.000012033984,0.000032820713,0.000013708185,0.0000025951888,0.000006965221,0.00022246894,0.65532804,0.0000126771865,0.05959606,0.0000037509276,0.2847663],"study_design_scores_gemma":[0.00027974544,0.0000838382,0.00015105672,0.00034533162,0.0000051679117,0.000015029292,0.0000013329076,0.9393765,0.00005971702,0.058700815,0.00051188987,0.00046963085],"about_ca_topic_score_codex":0.000024472485,"about_ca_topic_score_gemma":0.00027683415,"teacher_disagreement_score":0.41359305,"about_ca_system_score_codex":0.0002191238,"about_ca_system_score_gemma":0.0002467772,"threshold_uncertainty_score":0.999781},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4136493,0.0000068352483,0.58305407,0.003044043,0.00003497736,0.00012153299,0.0000012113697,0.00007694003,0.000011104545],"genre_scores_gemma":[0.69549173,0.0000014487678,0.3004719,0.003917192,0.0000986289,0.000007701231,0.0000021260296,0.0000052567016,0.0000040353616],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99917024,0.000008316576,0.00011029797,0.00034713873,0.0002040918,0.00015991284],"domain_scores_gemma":[0.99946153,0.000062639505,0.000025321315,0.00032680706,0.000047834466,0.00007588876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009153061,0.00006865319,0.000095943564,0.00017201656,0.00011332528,0.000015878792,0.00020889351,0.000024318155,0.000008609483],"category_scores_gemma":[0.00007829368,0.000064727035,0.000018627696,0.00079713465,0.00014974427,0.00007234817,0.00010139694,0.00013452767,0.000012675001],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015633006,0.00019107648,0.038913112,0.000010253385,0.0000033148824,0.00015033342,0.002935835,0.015070381,0.32122943,0.0005579622,0.0006689275,0.62025374],"study_design_scores_gemma":[0.0006404214,0.0003391557,0.8285021,0.000111023306,0.0000041074304,0.00011270278,8.0368704e-7,0.06620014,0.06838274,0.031065952,0.004327571,0.0003132959],"about_ca_topic_score_codex":0.000046066307,"about_ca_topic_score_gemma":0.000009646919,"teacher_disagreement_score":0.789589,"about_ca_system_score_codex":0.000056233905,"about_ca_system_score_gemma":0.000047529604,"threshold_uncertainty_score":0.2639492},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004189506,0.00032042497,0.99361575,0.0005240615,0.0010637192,0.0005148984,0.000009463611,0.00033432886,0.0036131928],"genre_scores_gemma":[0.054458555,0.000386156,0.93131644,0.008826304,0.0025380037,0.000030145911,0.00012048857,0.00011833895,0.0022055716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587274,0.00005742267,0.0007303319,0.001559998,0.0010753794,0.00070412183],"domain_scores_gemma":[0.9972465,0.00017947223,0.00043011253,0.0015789975,0.00034632455,0.0002185812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009895755,0.00055993476,0.00053112494,0.0008284444,0.0003106891,0.0009335489,0.0034734895,0.000386828,0.00007926834],"category_scores_gemma":[0.00008408976,0.00053622236,0.0001420617,0.0013505818,0.00038872365,0.0009727354,0.0016221938,0.00051003345,0.00008806817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012020545,0.00014927836,0.00025622503,0.00008574092,0.000032416392,0.00015074553,0.0005582845,0.04630256,0.000250059,0.35011023,0.0012046397,0.6008878],"study_design_scores_gemma":[0.00030291264,0.00018546497,0.000098285935,0.00069915043,0.000012153234,0.000082714265,9.424676e-8,0.9233349,0.00077491434,0.03430446,0.039295178,0.0009098035],"about_ca_topic_score_codex":0.0000076603055,"about_ca_topic_score_gemma":0.000052329076,"teacher_disagreement_score":0.87703234,"about_ca_system_score_codex":0.00028859146,"about_ca_system_score_gemma":0.0004872388,"threshold_uncertainty_score":0.99970895},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12031003,0.000012741822,0.8790346,0.00033021098,0.000034931283,0.00019792446,0.000051681574,0.0000134233505,0.000014489168],"genre_scores_gemma":[0.4863246,9.554848e-7,0.5135944,0.00005262782,0.000010325643,0.000010022739,0.0000035097805,0.0000019350216,0.0000016209427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991358,0.000026461814,0.00022258809,0.00025665932,0.00016218126,0.0001963003],"domain_scores_gemma":[0.9982404,0.0012752484,0.00008957162,0.00021489624,0.00012560915,0.00005424828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003556293,0.00008314711,0.00024099473,0.00031431104,0.000091391135,0.000064754655,0.00019730495,0.000050925697,0.00005067686],"category_scores_gemma":[0.00044755143,0.00006205934,0.000042992466,0.0014252376,0.00014832894,0.00010161395,0.00009084315,0.000070380695,7.1317714e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022791422,0.0016509044,0.080110505,0.00026899512,0.00034821502,0.0000037787868,0.0057249772,0.02669178,0.008696267,0.42004842,0.0014458315,0.45498756],"study_design_scores_gemma":[0.00015321404,0.000038711998,0.024248123,0.0000057343414,0.000046175395,6.407396e-7,0.000005047619,0.86819184,0.00071043015,0.10651716,0.000012606562,0.000070309296],"about_ca_topic_score_codex":0.000023289569,"about_ca_topic_score_gemma":0.00019076058,"teacher_disagreement_score":0.84150004,"about_ca_system_score_codex":0.000016557235,"about_ca_system_score_gemma":0.000025659867,"threshold_uncertainty_score":0.25307065},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021733822,0.00019593061,0.87027055,0.00067959545,0.00035119202,0.00034198738,0.0000054369616,0.00005132392,0.12788665],"genre_scores_gemma":[0.97709006,0.00009386517,0.019545482,0.0010532852,0.0012193442,0.0000038102214,0.000006022728,0.00002570829,0.00096243434],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975159,0.00003238095,0.0003289097,0.00050936145,0.0010839497,0.0005294949],"domain_scores_gemma":[0.9985873,0.00030023043,0.00029613878,0.00035116132,0.00033545645,0.00012969975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009788631,0.00024350442,0.00035388133,0.00083597976,0.00036597313,0.00014702525,0.0009833452,0.00027693514,0.00004455328],"category_scores_gemma":[0.00014126714,0.00019439873,0.00007145571,0.00085746427,0.0019215002,0.00043271668,0.00017367052,0.00036310276,0.00000673374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038149512,0.000021314187,0.00095653185,0.000034253426,0.000014997382,0.000021118734,0.0046019037,0.0044239066,0.000012255078,0.26243123,0.000007290829,0.727437],"study_design_scores_gemma":[0.0033931555,0.0017003602,0.0072313296,0.0024176142,0.00013666629,0.000057274276,0.00002876545,0.05361511,0.002209524,0.8114618,0.11403949,0.0037089123],"about_ca_topic_score_codex":0.0012604041,"about_ca_topic_score_gemma":0.0057371166,"teacher_disagreement_score":0.9768727,"about_ca_system_score_codex":0.000279157,"about_ca_system_score_gemma":0.001481606,"threshold_uncertainty_score":0.792735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007444419,0.00067928626,0.9967534,0.0005361895,0.00017277694,0.00035655376,0.0000042575775,0.00016425535,0.00058881904],"genre_scores_gemma":[0.40825433,0.00008008485,0.5906227,0.00032058102,0.00025654043,0.00001488974,0.000005425712,0.00003214481,0.00041328778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753433,0.000015778978,0.00031640852,0.00088194944,0.00088382466,0.000367704],"domain_scores_gemma":[0.99790394,0.0007367931,0.00017418363,0.0007054772,0.0003600543,0.00011956888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042010058,0.00029665598,0.00031661353,0.000617883,0.00009948303,0.00021474386,0.001251152,0.00015326196,0.000006378297],"category_scores_gemma":[0.00022015155,0.00025741887,0.00003059429,0.0005582897,0.00049782946,0.0005883905,0.0004394022,0.0004384656,0.0000060833027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042684795,0.0000832638,0.0029629092,0.000541997,0.000056696645,0.0001196128,0.004770711,0.22314072,0.0005767421,0.03938307,0.00021677748,0.7281048],"study_design_scores_gemma":[0.0011329171,0.0010754709,0.007342362,0.0018805009,0.000021699256,0.00041600838,7.0074685e-7,0.9539937,0.0044299965,0.02482316,0.003370276,0.0015132413],"about_ca_topic_score_codex":0.000021042777,"about_ca_topic_score_gemma":0.00011911168,"teacher_disagreement_score":0.73085296,"about_ca_system_score_codex":0.0001463057,"about_ca_system_score_gemma":0.00079561403,"threshold_uncertainty_score":0.9999878},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022898833,0.0010367901,0.9930001,0.0007408725,0.00094988226,0.0005633219,0.0000028406173,0.00022022282,0.0011961194],"genre_scores_gemma":[0.17892322,0.00018179332,0.8193258,0.0009907776,0.000254993,0.000039785726,0.000006554266,0.000023331564,0.00025372778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965596,0.000038533042,0.0004659274,0.0015049146,0.0006118599,0.00081916945],"domain_scores_gemma":[0.997921,0.0005492955,0.00026882824,0.00095434434,0.00022073406,0.0000857985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062223955,0.0005277234,0.00066844857,0.0007386869,0.0002610625,0.00037939794,0.0024513444,0.00034253177,0.0000030069184],"category_scores_gemma":[0.00020558076,0.00039766947,0.000110300156,0.0004764012,0.0008836942,0.000664411,0.000570285,0.0005286637,0.0000048838747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000882092,0.00007030911,0.0025629967,0.00009652355,0.000025942094,0.000490842,0.0027974916,0.29677436,0.00013480785,0.07741406,0.00014033355,0.61940414],"study_design_scores_gemma":[0.00091437204,0.0007903848,0.003763834,0.00074107444,0.000011361738,0.00038537083,0.0000022325241,0.8171677,0.00057169533,0.17321424,0.001273475,0.0011642321],"about_ca_topic_score_codex":0.00022903933,"about_ca_topic_score_gemma":0.0021012968,"teacher_disagreement_score":0.6182399,"about_ca_system_score_codex":0.00039701027,"about_ca_system_score_gemma":0.0005685348,"threshold_uncertainty_score":0.99984753},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003088851,0.00015579136,0.9891381,0.0007506415,0.00030999657,0.00029206352,0.000006210957,0.000026160547,0.0062321555],"genre_scores_gemma":[0.9855613,0.0000047139843,0.012976051,0.00045237612,0.00014391598,0.000006222129,0.000004166472,0.000011116675,0.00084014906],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723774,0.000041165225,0.00054066913,0.0009054588,0.0009911489,0.00028383924],"domain_scores_gemma":[0.9967226,0.002185628,0.00023290081,0.0005450622,0.0002229177,0.00009092793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033699246,0.00022446924,0.00032875262,0.0012900593,0.00014508885,0.00028948914,0.000869898,0.0001844232,0.000094331765],"category_scores_gemma":[0.0005486541,0.0001886037,0.000042850636,0.00075649424,0.00095384865,0.00025971976,0.0002952102,0.00043284308,0.00007745964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011472738,0.00002272307,0.00012381734,0.000004701027,0.0000015049436,0.00001013723,0.00058480864,0.030330915,0.00012954028,0.20277175,0.000013650603,0.76599497],"study_design_scores_gemma":[0.00018036831,0.00005166198,0.0018317607,0.00014250178,0.0000030980202,0.000026044094,0.0000016998763,0.088568486,0.00009978229,0.90750384,0.0013485415,0.00024220874],"about_ca_topic_score_codex":0.0000112927855,"about_ca_topic_score_gemma":0.00024942053,"teacher_disagreement_score":0.9824724,"about_ca_system_score_codex":0.00011389639,"about_ca_system_score_gemma":0.00011179234,"threshold_uncertainty_score":0.7691036},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047239047,0.00072210934,0.9902219,0.0006550684,0.000613493,0.00067712535,0.00002226371,0.000067621106,0.0022965234],"genre_scores_gemma":[0.932856,0.0001238808,0.06400686,0.0007598881,0.0016741613,0.000020845737,0.0000047584927,0.000030516652,0.0005230883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974487,0.000023090895,0.00041486588,0.0008990297,0.00058986386,0.00062445935],"domain_scores_gemma":[0.99878097,0.000345905,0.00018295596,0.00033657948,0.00022562675,0.00012794729],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014332752,0.00031328105,0.00040507148,0.0003686767,0.0010428758,0.0005503394,0.00066027156,0.00027257384,0.000040976116],"category_scores_gemma":[0.00023220033,0.0002911072,0.00010562556,0.00022954188,0.0006445449,0.0006146743,0.00028194478,0.00034756752,0.0000033100703],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018022,0.000013728982,0.0002645986,0.000029533165,0.000020216026,0.00014360629,0.0020110596,0.019731976,0.0000073309043,0.015693331,0.000007352604,0.96205926],"study_design_scores_gemma":[0.00061797944,0.00007241671,0.0000144514,0.00022721295,0.00005419948,0.000059002603,0.000005027722,0.8848965,0.000010220697,0.10959649,0.0037741384,0.0006723313],"about_ca_topic_score_codex":0.00033286685,"about_ca_topic_score_gemma":0.0023943286,"teacher_disagreement_score":0.9613869,"about_ca_system_score_codex":0.00025301092,"about_ca_system_score_gemma":0.00039454707,"threshold_uncertainty_score":0.9999541},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.1034286e-7,0.0003221935,0.99072534,0.001779776,0.00094546494,0.0014003093,0.000008700486,0.000369073,0.0044482127],"genre_scores_gemma":[0.0043206597,0.000038625574,0.9939638,0.0009200748,0.00031016464,0.00012212772,0.000048107355,0.000026631504,0.00024984826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955674,0.00014888341,0.00066882884,0.0018209714,0.0012625775,0.00053133874],"domain_scores_gemma":[0.9951306,0.00070461276,0.0005513258,0.0021688074,0.0013228314,0.00012184147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0071411626,0.00045261232,0.00045415887,0.0009977365,0.0002734358,0.000566624,0.0036497256,0.0003941795,0.000014693175],"category_scores_gemma":[0.0006903196,0.0004413008,0.00013411703,0.0006702518,0.00037268654,0.0009747361,0.00043228394,0.0005108109,0.000019548768],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030306733,0.000017443672,0.000001531268,0.000011127253,0.000004799239,7.411383e-7,0.00008048201,0.00057346607,0.0012407074,0.0763548,0.000074021475,0.92163783],"study_design_scores_gemma":[0.00014956297,0.00011942466,0.00012351529,0.00008453647,0.0000146656585,0.000012056245,4.4911868e-8,0.57509196,0.0043147826,0.4114662,0.008297127,0.00032608333],"about_ca_topic_score_codex":0.000003462427,"about_ca_topic_score_gemma":0.000007997183,"teacher_disagreement_score":0.9213118,"about_ca_system_score_codex":0.00092743034,"about_ca_system_score_gemma":0.0011157223,"threshold_uncertainty_score":0.9998039},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045233654,0.0017557526,0.98853207,0.000057262256,0.00055313733,0.00026359645,0.0000033947344,0.000049752634,0.008332681],"genre_scores_gemma":[0.8498214,0.0020462116,0.14621578,0.0007044964,0.00033875147,0.000010812675,0.000011670423,0.00009404252,0.00075681385],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885756,0.000039859682,0.0002660471,0.0003669582,0.00028482208,0.00018474594],"domain_scores_gemma":[0.9989511,0.0005125656,0.00009249482,0.00028560535,0.00007936538,0.00007887085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004902287,0.0002209978,0.0002768566,0.00034718768,0.00005885367,0.0000757313,0.0003194427,0.00013983571,0.00014284106],"category_scores_gemma":[0.00008830255,0.00021860111,0.00003743758,0.00021916917,0.00027183976,0.00019243141,0.00007088112,0.00033606516,0.00003753693],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029271201,0.000030289597,0.000018344585,0.00023704994,0.000024094346,0.000022473141,0.0016879987,0.06930843,0.00042652144,0.0022891406,0.0000752109,0.92585117],"study_design_scores_gemma":[0.00088741415,0.00058841764,0.00054979284,0.0048197554,0.00013115798,0.000237458,0.000003254626,0.36690944,0.018354446,0.5737147,0.031913694,0.0018905097],"about_ca_topic_score_codex":0.0000134237325,"about_ca_topic_score_gemma":0.000002863982,"teacher_disagreement_score":0.9239607,"about_ca_system_score_codex":0.00007367972,"about_ca_system_score_gemma":0.0001623001,"threshold_uncertainty_score":0.8914294},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020338334,0.000093810646,0.96552163,0.018178822,0.0042480333,0.0013858106,0.000031833828,0.0019926622,0.008343985],"genre_scores_gemma":[0.40349248,0.0000029391367,0.58618456,0.00800861,0.00073288486,0.000086535285,0.000010339099,0.0001127655,0.0013688873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9884684,0.000062428844,0.0009878757,0.0039126268,0.0046938835,0.0018747979],"domain_scores_gemma":[0.99223924,0.0006844604,0.00038830139,0.0048793526,0.0011444013,0.00066426187],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0023021016,0.0013618182,0.0012202674,0.003311604,0.0004877414,0.0014411873,0.011848974,0.000632869,0.00001986023],"category_scores_gemma":[0.0006778758,0.0012717275,0.00030843762,0.002206687,0.0006215385,0.00052211795,0.003497647,0.0019255932,0.00069663266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025838022,0.000062996514,0.000024862717,0.00008581252,0.0000182715,0.00068815006,0.00032828184,0.5265053,0.00006601825,0.04543622,0.0016280495,0.42513022],"study_design_scores_gemma":[0.0010481979,0.0017186395,0.0002566795,0.0039989357,0.00002873707,0.00025260448,9.1090845e-7,0.85462195,0.004351216,0.08769882,0.042613994,0.003409349],"about_ca_topic_score_codex":0.00007237727,"about_ca_topic_score_gemma":0.00006857713,"teacher_disagreement_score":0.42172086,"about_ca_system_score_codex":0.0024435953,"about_ca_system_score_gemma":0.0013334446,"threshold_uncertainty_score":0.9999133},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013177352,0.00011145414,0.9957276,0.00047056316,0.0013696847,0.00020225708,0.000011343061,0.000041871357,0.0007475042],"genre_scores_gemma":[0.35410368,0.00007052678,0.6428017,0.0022533613,0.0005629448,0.0000074188983,0.0000078108615,0.00004524504,0.00014730533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976733,0.000017274026,0.00034036348,0.00088683376,0.0007277061,0.00035454967],"domain_scores_gemma":[0.9976277,0.00072658004,0.0002881081,0.0011177537,0.00016099517,0.00007888854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084659696,0.00030710507,0.00032140483,0.00028911227,0.00030783156,0.0004313067,0.0024201681,0.0001949598,0.00001375965],"category_scores_gemma":[0.00010827402,0.00020256662,0.00005862977,0.00022303143,0.00060615374,0.00038201103,0.001868596,0.0008975431,0.00000517481],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008799533,0.000042128067,0.00016239205,0.00006545418,0.000011901193,0.000019787687,0.0008953501,0.00172485,0.0014888059,0.14652517,0.000030303489,0.8490251],"study_design_scores_gemma":[0.0005586363,0.00025207386,0.0008005763,0.0021576653,0.000010864052,0.000102012455,5.808747e-7,0.5913342,0.008302174,0.38711104,0.008300084,0.0010700615],"about_ca_topic_score_codex":0.000020840083,"about_ca_topic_score_gemma":0.000013769664,"teacher_disagreement_score":0.847955,"about_ca_system_score_codex":0.000041299412,"about_ca_system_score_gemma":0.000141221,"threshold_uncertainty_score":0.8260427},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011106233,0.003216202,0.9727149,0.00009784371,0.0007275491,0.00019067411,0.000025887515,0.000037029284,0.011883678],"genre_scores_gemma":[0.5520641,0.0043718372,0.43511614,0.0015880063,0.0032449625,0.000009392357,0.0001106873,0.00013370397,0.0033611383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980359,0.0000055875726,0.00061061885,0.0008298245,0.00018317785,0.00033490168],"domain_scores_gemma":[0.9988963,0.0000622452,0.00045568138,0.00043146004,0.00007293095,0.00008138104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011012494,0.00026712188,0.00045816816,0.0012862398,0.0001917411,0.00021154601,0.00045161613,0.00027109229,0.000030730444],"category_scores_gemma":[0.000029627976,0.0002815564,0.00016757108,0.00035976866,0.00030563516,0.0002969447,0.00017947117,0.0003218376,0.00006663169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008012292,0.000019928413,0.00027509156,0.0000163126,0.000020786882,0.0000070001383,0.00096994493,0.68908143,0.000030516605,0.29007936,0.0000069851826,0.019484643],"study_design_scores_gemma":[0.00007244733,0.00002171444,0.000093424715,0.0000345651,0.000008497188,0.0000023518392,1.6779005e-7,0.5673391,0.00002304016,0.43205297,0.00015083716,0.00020087825],"about_ca_topic_score_codex":0.00027985848,"about_ca_topic_score_gemma":0.00017368828,"teacher_disagreement_score":0.54095787,"about_ca_system_score_codex":0.00044150278,"about_ca_system_score_gemma":0.00006768134,"threshold_uncertainty_score":0.99996364},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017786525,0.000053031734,0.9963132,0.0001883017,0.00058179005,0.00042473388,0.000023520248,0.000013362706,0.002224184],"genre_scores_gemma":[0.43762088,0.0000022546583,0.5593593,0.0003867062,0.0022339716,0.000009787083,0.000027882703,0.000053973232,0.00030523806],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859977,0.00000910594,0.0002770518,0.00049056293,0.00027779228,0.0003457427],"domain_scores_gemma":[0.9988508,0.00023235823,0.00026068103,0.00051401375,0.00009126216,0.000050871942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002842169,0.00027249433,0.0003433918,0.00008332421,0.00019858641,0.00006718816,0.0008662605,0.00010554561,0.000019861602],"category_scores_gemma":[0.000004109431,0.00020076842,0.00018760344,0.00011063026,0.00058348686,0.000048783044,0.00032139264,0.000570048,0.000004528835],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028347104,0.000022187829,0.00003955589,0.0000117017,0.000028944083,0.0000012540867,0.00043752659,0.004336096,0.00022823786,0.04671337,0.000010835768,0.94816744],"study_design_scores_gemma":[0.0003887272,0.00007307492,0.000036408088,0.00012273717,0.000028773326,0.0000036105932,0.000001027482,0.4424116,0.0072203954,0.5466479,0.0026627467,0.00040295557],"about_ca_topic_score_codex":0.000036885926,"about_ca_topic_score_gemma":0.000006241299,"teacher_disagreement_score":0.9477645,"about_ca_system_score_codex":0.000026265967,"about_ca_system_score_gemma":0.000271251,"threshold_uncertainty_score":0.81870985},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002776417,0.00042790826,0.9934305,0.00012007715,0.0035992563,0.00094138726,0.000027229104,0.00044651472,0.00072949694],"genre_scores_gemma":[0.35303965,0.000017015402,0.6448232,0.0008690323,0.00088317704,0.0000313539,0.000008829318,0.000062954234,0.0002647895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936523,0.000058210608,0.0009662538,0.0022392357,0.0018531455,0.0012308815],"domain_scores_gemma":[0.99575114,0.0010128461,0.00028932578,0.001879884,0.0005643824,0.0005023896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001900735,0.0007521311,0.000886363,0.0010364813,0.00043320036,0.00078855624,0.0035940649,0.0004713176,0.000011353019],"category_scores_gemma":[0.00013128902,0.0006568456,0.00014208023,0.0007979093,0.0004534433,0.00091644644,0.0017068108,0.00097239076,0.00014437034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019648658,0.000040730964,0.0002647367,0.00021815485,0.000022692617,0.00021651959,0.0020053734,0.44460502,0.000012678132,0.017813446,0.00013805734,0.53464293],"study_design_scores_gemma":[0.00026148584,0.0002633703,0.00038156842,0.0007369977,0.0000101922615,0.00011743967,0.000001612144,0.9271715,0.00012205326,0.068202205,0.0016297385,0.0011018134],"about_ca_topic_score_codex":0.00024509462,"about_ca_topic_score_gemma":0.00003100134,"teacher_disagreement_score":0.53354114,"about_ca_system_score_codex":0.0008552798,"about_ca_system_score_gemma":0.0006534439,"threshold_uncertainty_score":0.99958825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014889279,0.0008915235,0.9926032,0.0014439665,0.0006104757,0.00039839928,0.000011544236,0.00009990823,0.002452062],"genre_scores_gemma":[0.9230202,0.000036462694,0.07577553,0.00073766493,0.00018078467,0.000010158963,0.0000056842596,0.00003418219,0.00019932911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969876,0.00008480654,0.00061765494,0.0009884717,0.00082068687,0.00050081],"domain_scores_gemma":[0.99585795,0.0015228534,0.0005077184,0.0018345445,0.00019541576,0.00008151238],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009640358,0.0004988274,0.00053386926,0.00039624106,0.0005761329,0.00054761546,0.0031685568,0.00018071066,0.00000468144],"category_scores_gemma":[0.00007532439,0.00036006863,0.000110076464,0.00039642054,0.0022328177,0.00017657512,0.0012246295,0.00086603407,0.000004419273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016200604,0.000109023305,0.000042019692,0.00020721498,0.000024733361,0.00004289357,0.0026741342,0.17835905,0.00008751284,0.5383119,0.00016456166,0.27996078],"study_design_scores_gemma":[0.00011860095,0.00024665715,0.00015616181,0.00078407675,0.0000051519028,0.000038561197,3.4242106e-7,0.7162495,0.00008135587,0.28056744,0.0014142226,0.00033789544],"about_ca_topic_score_codex":0.000050280552,"about_ca_topic_score_gemma":0.000075565724,"teacher_disagreement_score":0.92153126,"about_ca_system_score_codex":0.000097326774,"about_ca_system_score_gemma":0.0002266774,"threshold_uncertainty_score":0.99988514},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003822112,0.0011127627,0.8224953,0.005191357,0.0033190723,0.00121379,0.00004251141,0.00026491098,0.16253819],"genre_scores_gemma":[0.9723852,0.00029148234,0.019426642,0.0044802614,0.0011198709,0.000042189113,0.00019079898,0.000037694732,0.002025812],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99817353,0.000023940816,0.00040294352,0.00035444557,0.00068264635,0.00036248774],"domain_scores_gemma":[0.99804693,0.00038189528,0.00023486231,0.0008916269,0.00036579388,0.000078887155],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00070405187,0.00028818412,0.00029275744,0.0009885315,0.0007239359,0.003437264,0.001446119,0.00009207353,0.0002258922],"category_scores_gemma":[0.000022870607,0.00020117621,0.0001642449,0.00045484136,0.0010012736,0.0018292763,0.00039591658,0.0004233319,0.00011120575],"study_design_candidate":"theoretical_or_conceptual","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.00013839598,0.000039252427,0.000026253107,0.0000430431,0.00036702084,0.000025007748,0.12928687,0.027096976,0.000007913408,0.3252546,0.00012470431,0.51759],"study_design_scores_gemma":[0.0061000413,0.0019331551,0.0009748087,0.003426672,0.0036723737,0.00020767252,0.010775768,0.11572211,0.0031286331,0.2716383,0.5731893,0.009231146],"about_ca_topic_score_codex":0.0010662766,"about_ca_topic_score_gemma":0.022080787,"teacher_disagreement_score":0.96856314,"about_ca_system_score_codex":0.00014276936,"about_ca_system_score_gemma":0.00016647634,"threshold_uncertainty_score":0.9975973},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20422284,0.00021164393,0.7711672,0.0006344848,0.00034138872,0.0014019358,0.000018385435,0.00010854806,0.021893522],"genre_scores_gemma":[0.9471297,0.00006781387,0.052132893,0.0004764947,0.00010146305,0.000012676761,0.0000016958654,0.000012518347,0.00006473448],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9976996,0.00005924004,0.00039880915,0.0005723835,0.00078236085,0.0004875635],"domain_scores_gemma":[0.9989924,0.00019190712,0.00017093579,0.0002135631,0.0002974856,0.00013371736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008872814,0.0002847382,0.00035284244,0.0010717984,0.0007212425,0.0003497795,0.00043402181,0.00017813084,0.000017233859],"category_scores_gemma":[0.00006601676,0.00025480578,0.000038373008,0.0009744632,0.0011533166,0.0008074805,0.00014738552,0.00035196476,0.000014888154],"study_design_candidate":"observational","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.00009628707,0.000052254414,0.13693856,0.00010527483,0.000050136783,0.000059936894,0.37396723,0.1653852,0.00013867425,0.060907554,0.0000059963977,0.2622929],"study_design_scores_gemma":[0.0021817381,0.0011403402,0.7549119,0.007703537,0.00010050894,0.00019110307,0.0015038019,0.058074087,0.000021982227,0.16363008,0.0061965226,0.004344387],"about_ca_topic_score_codex":0.0039016542,"about_ca_topic_score_gemma":0.022646822,"teacher_disagreement_score":0.74290687,"about_ca_system_score_codex":0.00041790912,"about_ca_system_score_gemma":0.0005066758,"threshold_uncertainty_score":0.9999904},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020410677,0.000092371614,0.97782373,0.000019562958,0.00053659675,0.0010008864,0.0000013163271,0.00009378084,0.000021080368],"genre_scores_gemma":[0.60245365,0.0000023768255,0.3974777,0.0000120509185,0.000021517111,0.000017941149,0.000001096189,0.000012824991,8.486919e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966101,0.0005317528,0.00040456196,0.00084307586,0.0013738943,0.00023663616],"domain_scores_gemma":[0.99554783,0.0018384561,0.00032685575,0.0015254499,0.0007074201,0.00005397943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029997982,0.00031573107,0.00045169843,0.0004432095,0.00017141044,0.00004769492,0.002034242,0.00013814667,5.5128004e-7],"category_scores_gemma":[0.0005935021,0.00021593425,0.00006153213,0.0007378825,0.00029744307,0.00064577354,0.0003213564,0.00040824537,2.3476295e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021372818,0.00007517623,0.00009985632,0.000038492242,0.000006907641,0.0000027846984,0.0010574368,0.9628046,0.00058624824,0.00013376496,7.089984e-8,0.035173256],"study_design_scores_gemma":[0.0004451559,0.0006487153,0.0006048716,0.0005306983,0.000014738239,0.0000053889653,0.00000141701,0.96850634,0.00988604,0.019118484,5.5041426e-7,0.00023762345],"about_ca_topic_score_codex":0.000019031606,"about_ca_topic_score_gemma":0.000021859689,"teacher_disagreement_score":0.582043,"about_ca_system_score_codex":0.00021114528,"about_ca_system_score_gemma":0.0006904293,"threshold_uncertainty_score":0.8805544},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018048665,0.00005760877,0.9804871,0.000110064364,0.0008054614,0.0003240241,0.000008851637,0.000116985495,0.00004125905],"genre_scores_gemma":[0.43544036,0.000009040263,0.5643345,0.00017046374,0.00003186085,0.0000056978793,0.000003865446,0.000004005932,2.0356329e-7],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977145,0.00013269424,0.0003967958,0.0006566647,0.00070672255,0.0003925912],"domain_scores_gemma":[0.9985609,0.00022563407,0.00017655491,0.00071170885,0.00019435704,0.00013086322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007950651,0.00018372397,0.00025045493,0.00038445395,0.00015950583,0.00012731811,0.0012489858,0.00007222362,0.00004362386],"category_scores_gemma":[0.00008435192,0.0001668147,0.00007245373,0.0019297132,0.0005658393,0.0006917919,0.00033499787,0.00022030108,0.000008877559],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012626685,0.00025095916,0.0030796505,0.000028541925,0.000011447058,0.000024985286,0.004728143,0.0037391623,0.071456954,0.0017668244,0.000072905576,0.9148278],"study_design_scores_gemma":[0.00018607876,0.00017096628,0.0034626366,0.000071744544,0.000003135316,0.000006655038,0.0000028712948,0.264781,0.7264803,0.004638573,0.000008340282,0.00018771752],"about_ca_topic_score_codex":0.00005277484,"about_ca_topic_score_gemma":0.000003652474,"teacher_disagreement_score":0.91464007,"about_ca_system_score_codex":0.00020399726,"about_ca_system_score_gemma":0.00020113177,"threshold_uncertainty_score":0.6802506},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006386987,0.00036026756,0.99545264,0.0017550824,0.0011077526,0.0006327134,0.000010152567,0.000120159886,0.0004973743],"genre_scores_gemma":[0.075755455,0.00005584197,0.920301,0.0020930655,0.0014152376,0.000029414927,0.000023186356,0.000024927986,0.00030184677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743485,0.000017633722,0.00038592258,0.0012431253,0.0004824681,0.00043601415],"domain_scores_gemma":[0.99821347,0.00024073073,0.00021105507,0.0010100693,0.00021293618,0.00011174123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005406695,0.00033643903,0.0003077221,0.00069143076,0.00031912516,0.00043916635,0.0018411363,0.00028422943,0.0000033071249],"category_scores_gemma":[0.00005197598,0.00031031392,0.00016210391,0.00040147014,0.00029067454,0.00040053204,0.0002694814,0.00032865437,0.000010579428],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004574657,0.000024120118,0.0000063730126,0.00001141559,0.0000053697513,0.000004549913,0.00022029396,0.011125527,0.0018927406,0.01499279,0.0001448678,0.9715674],"study_design_scores_gemma":[0.00039682016,0.00022198327,0.00016504891,0.0000846529,0.000009106803,0.000025672796,2.7766989e-8,0.9060181,0.0057430123,0.07929335,0.007528347,0.00051390356],"about_ca_topic_score_codex":0.0000126209425,"about_ca_topic_score_gemma":0.000118008844,"teacher_disagreement_score":0.9710535,"about_ca_system_score_codex":0.00013844945,"about_ca_system_score_gemma":0.0002823813,"threshold_uncertainty_score":0.9999349},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007885042,0.0013197088,0.9814521,0.0016341105,0.0025349807,0.0022253226,0.00009215664,0.0004272121,0.0024293798],"genre_scores_gemma":[0.29629472,0.000054531654,0.6887026,0.013255333,0.0012269925,0.0001412765,0.00006948312,0.00011779526,0.00013727331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99298775,0.000060979175,0.000918708,0.003282838,0.0014130871,0.0013366381],"domain_scores_gemma":[0.9950633,0.00055821147,0.0005086115,0.002521709,0.0006659058,0.0006822345],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010696227,0.001226525,0.0011061494,0.0013769171,0.00068560947,0.0013836018,0.006811977,0.00076577556,0.00001037114],"category_scores_gemma":[0.000010056203,0.001061124,0.00026767454,0.0011170512,0.00038015834,0.00095945195,0.0033934629,0.0013218282,0.000034693887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039321874,0.0010510737,0.0015624849,0.009804898,0.00042183747,0.00019770763,0.06764974,0.041383132,0.039645456,0.06250666,0.00005909761,0.7753247],"study_design_scores_gemma":[0.0018877022,0.0009984863,0.00040442232,0.0018177384,0.00008480164,0.00028246813,0.000015612033,0.88600004,0.0025813805,0.067772165,0.035489112,0.0026660864],"about_ca_topic_score_codex":0.00012545487,"about_ca_topic_score_gemma":0.0022579615,"teacher_disagreement_score":0.8446169,"about_ca_system_score_codex":0.00014050842,"about_ca_system_score_gemma":0.0006033382,"threshold_uncertainty_score":0.99965304},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033107655,0.00035266922,0.9924309,0.001607668,0.0011404706,0.00039409593,0.0000113036585,0.0006304788,0.0033993039],"genre_scores_gemma":[0.04760146,0.000074487434,0.9472478,0.0026134674,0.0010423225,0.000007817529,0.000016436314,0.000066001376,0.0013301728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950539,0.0000403595,0.0007383226,0.0018263597,0.0015286335,0.00081245974],"domain_scores_gemma":[0.99608153,0.00058346504,0.0004103787,0.0020440463,0.0006297418,0.00025082086],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012275616,0.00064073317,0.0005825758,0.00095341017,0.0003171984,0.0013831995,0.004624566,0.00048760325,0.00008189786],"category_scores_gemma":[0.00028700448,0.00058451825,0.00023142165,0.0010131735,0.0015412065,0.0010446298,0.000962598,0.0010569704,0.00022074528],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040772742,0.00012796711,0.00008537025,0.0001224311,0.000015639975,0.00026957714,0.0005227577,0.0008229078,0.008093879,0.029122535,0.00008746077,0.9606887],"study_design_scores_gemma":[0.0008059668,0.00030075348,0.0010066645,0.00064219045,0.000018919818,0.00010881641,1.182703e-7,0.5557288,0.28748885,0.1398376,0.011934098,0.0021272472],"about_ca_topic_score_codex":0.0000073113233,"about_ca_topic_score_gemma":0.000008648649,"teacher_disagreement_score":0.9585615,"about_ca_system_score_codex":0.00043778465,"about_ca_system_score_gemma":0.0011759459,"threshold_uncertainty_score":0.9996606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010440079,0.0006916474,0.9840439,0.0013486698,0.0022139258,0.00027447144,0.0000016136097,0.00015680726,0.011258503],"genre_scores_gemma":[0.0065814634,0.00012375313,0.9901561,0.0009903105,0.00072709523,0.000010695365,0.0000015024004,0.00002630843,0.0013827563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963566,0.00006604697,0.00055127527,0.0012268113,0.0011123666,0.00068691536],"domain_scores_gemma":[0.9963131,0.00059356244,0.00034288512,0.0023599828,0.00024864727,0.00014183938],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021183738,0.0004294483,0.00033250422,0.00046582805,0.00056279916,0.00090855814,0.005991729,0.00026376618,0.000017259938],"category_scores_gemma":[0.00021157748,0.00030835526,0.00013612008,0.00070637657,0.0010067483,0.000735786,0.0013376643,0.00089995365,0.00013492699],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019390825,0.0000064677793,0.000009969367,0.0000042425318,0.000005077837,0.000007422012,0.0001595332,0.0055416585,0.000019520854,0.11727751,0.000031719163,0.87693495],"study_design_scores_gemma":[0.00013067841,0.00009873121,0.00024589966,0.0001207005,0.0000067568476,0.000060946517,1.0373445e-7,0.77847874,0.0012030256,0.15666987,0.06240315,0.00058142154],"about_ca_topic_score_codex":0.0000074946765,"about_ca_topic_score_gemma":0.000054787786,"teacher_disagreement_score":0.8763535,"about_ca_system_score_codex":0.00035278822,"about_ca_system_score_gemma":0.0004357259,"threshold_uncertainty_score":0.9999369},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068220426,0.00056569214,0.9931068,0.0026668422,0.00097182475,0.0010453584,0.000004345685,0.00019343098,0.0013774758],"genre_scores_gemma":[0.059759524,0.00005560749,0.9305791,0.0066221477,0.002240673,0.000061855106,0.000011585104,0.00005279432,0.0006167064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962589,0.000021276886,0.0005193816,0.001653483,0.0006052705,0.0009416693],"domain_scores_gemma":[0.99740565,0.0006986322,0.00029981113,0.0012121984,0.00017553399,0.000208174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058967725,0.0005514966,0.0005160189,0.00030344006,0.00055286806,0.00066840206,0.0028616267,0.0002580771,0.000006040511],"category_scores_gemma":[0.000026995323,0.00048474036,0.00018775817,0.00063661346,0.00030530876,0.00035257518,0.0005355142,0.0007623852,0.00002204257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035134588,0.000013543726,0.0000019549811,0.000011293574,0.0000031251009,0.0000075864114,0.000040062587,0.4734275,0.000011430496,0.0702036,0.000092633236,0.45618373],"study_design_scores_gemma":[0.00016513297,0.00021668973,0.000015379834,0.00024222913,0.0000052350974,0.000025189524,1.2246022e-8,0.635402,0.000039342267,0.36169657,0.0018214161,0.00037075867],"about_ca_topic_score_codex":0.0000031209595,"about_ca_topic_score_gemma":0.000013965672,"teacher_disagreement_score":0.455813,"about_ca_system_score_codex":0.00012881999,"about_ca_system_score_gemma":0.00020011346,"threshold_uncertainty_score":0.99976045},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018349886,0.00010093069,0.9940734,0.000008049618,0.0010825683,0.00013405971,0.000005568932,0.000120148216,0.002640306],"genre_scores_gemma":[0.8644028,0.00007581742,0.12949708,0.00035446277,0.004510163,0.000029754248,0.000077751036,0.00011420182,0.0009379842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988879,0.000024570763,0.00023474771,0.0003848715,0.00026039523,0.00020753639],"domain_scores_gemma":[0.9993984,0.00015878728,0.000056367408,0.0002561174,0.00006939441,0.000060899783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005159317,0.00018959295,0.00033248085,0.0009146159,0.000071271796,0.00018835698,0.00016373426,0.00025907162,0.000016201682],"category_scores_gemma":[0.000040854047,0.00017369144,0.00007369167,0.00093453756,0.00011510918,0.000122897,0.000057482794,0.00036957642,0.00002755056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002339686,0.000002400147,0.000029204448,0.000059114383,0.000039332444,0.0000065271,0.00013458043,0.024536788,0.00048291273,0.0000019052321,0.00017144009,0.97453344],"study_design_scores_gemma":[0.0002007085,0.00007487999,0.000278019,0.00019952036,0.00009432115,0.000021511381,1.1639199e-7,0.98862153,0.0024752729,0.0054241773,0.0021618865,0.00044806523],"about_ca_topic_score_codex":0.00002107137,"about_ca_topic_score_gemma":0.0000760391,"teacher_disagreement_score":0.9740854,"about_ca_system_score_codex":0.00015445727,"about_ca_system_score_gemma":0.00004796134,"threshold_uncertainty_score":0.70829314},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018385418,0.0004214057,0.991661,0.0015260685,0.002281525,0.00046029108,0.000014163946,0.0003101982,0.0014867698],"genre_scores_gemma":[0.20014134,0.000030561783,0.7932307,0.0050382935,0.00037056,0.000018162491,0.0000053533304,0.00003684528,0.0011281801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955821,0.00003837652,0.0005412265,0.0020103068,0.0010222979,0.00080566143],"domain_scores_gemma":[0.9951145,0.0018205015,0.0002046958,0.0022702196,0.00029028457,0.0002997931],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00039817282,0.0006379276,0.0007274016,0.000791406,0.00021993367,0.0017205733,0.00470806,0.00033235626,0.00007609751],"category_scores_gemma":[0.0004459494,0.00053267466,0.00016918781,0.00050788117,0.00045182265,0.001541768,0.0024029918,0.0006092108,0.00049475627],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009217154,0.000046758345,0.00026798845,0.000020671852,0.000044336335,0.00065343705,0.0016146031,0.017783705,0.00035188775,0.053713538,0.00081323966,0.9246806],"study_design_scores_gemma":[0.00043826544,0.0004116357,0.0028177258,0.00062287494,0.00004025188,0.00022450754,5.418483e-7,0.5881976,0.004179303,0.3836761,0.01703642,0.002354791],"about_ca_topic_score_codex":0.0015666388,"about_ca_topic_score_gemma":0.00066568115,"teacher_disagreement_score":0.92232585,"about_ca_system_score_codex":0.00020287652,"about_ca_system_score_gemma":0.00043044286,"threshold_uncertainty_score":0.99971247},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018106095,0.00011223383,0.9927349,0.0009512471,0.0021813738,0.0011024494,0.000006727904,0.00023047702,0.0026624831],"genre_scores_gemma":[0.04803569,0.000035072677,0.94916254,0.0009820781,0.0004397695,0.000031779466,0.000007773537,0.000036798887,0.0012685187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969364,0.000012299475,0.00055685913,0.001279182,0.0006300047,0.00058527174],"domain_scores_gemma":[0.99790853,0.00038055182,0.00036432702,0.00077717484,0.00033790106,0.00023149293],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043626223,0.00045950257,0.0004124636,0.0006055295,0.00032560987,0.0011771249,0.0010369451,0.00033533166,0.00026904343],"category_scores_gemma":[0.000101589445,0.0004464166,0.00015545398,0.00034245237,0.00039755675,0.0011149505,0.00038939426,0.0004928013,0.000071880546],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026930843,0.0000046338637,0.00006522176,0.000028757533,0.000009322354,0.0000029536207,0.00036381034,0.042354513,0.00016873567,0.04112919,0.00014936899,0.9157208],"study_design_scores_gemma":[0.0007225908,0.0001451581,0.0006329459,0.00034716324,0.0000104801475,0.00009267687,2.645577e-7,0.7940536,0.0004633568,0.19991085,0.0028397297,0.0007812017],"about_ca_topic_score_codex":0.00010707724,"about_ca_topic_score_gemma":0.00030532212,"teacher_disagreement_score":0.9149396,"about_ca_system_score_codex":0.00038440165,"about_ca_system_score_gemma":0.0010558487,"threshold_uncertainty_score":0.99985975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052808475,0.00016357569,0.99685436,0.00033642878,0.0009300616,0.00038446212,0.0000065142162,0.00006460161,0.0007319176],"genre_scores_gemma":[0.5494555,0.00003603793,0.44492736,0.0045799674,0.00059108523,0.0000070252045,0.00001250869,0.000052845942,0.0003376477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718845,0.000029389827,0.00037532626,0.00096905814,0.0010098877,0.00042786048],"domain_scores_gemma":[0.9981143,0.0002690294,0.00039277266,0.00089459587,0.00025160424,0.00007771565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057529274,0.00037847803,0.00034472306,0.0005017783,0.00038168996,0.00028530424,0.0020657375,0.0003162718,0.000008850943],"category_scores_gemma":[0.00011599614,0.00026671623,0.00012108776,0.000691337,0.00038496227,0.00037448623,0.0005065183,0.0006324344,0.000008367236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010117836,0.00005003959,0.0000036633915,0.000028810047,0.0000041055537,0.0000068978184,0.0007850801,0.23026355,0.006968494,0.005422685,0.00001771652,0.75643885],"study_design_scores_gemma":[0.00022625648,0.00020466765,0.00001801794,0.0005454037,0.000008244403,0.000026147813,4.873394e-7,0.9561538,0.015172198,0.026983919,0.0002954335,0.0003653947],"about_ca_topic_score_codex":0.000025682837,"about_ca_topic_score_gemma":0.00001558914,"teacher_disagreement_score":0.7560735,"about_ca_system_score_codex":0.00016087464,"about_ca_system_score_gemma":0.00039708996,"threshold_uncertainty_score":0.9999785},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007955312,0.0012646122,0.99326545,0.00002260667,0.0011283527,0.00039276652,0.000004651014,0.00010534793,0.003020657],"genre_scores_gemma":[0.4255114,0.00002861352,0.5740774,0.00004180733,0.00022059628,0.000018151688,0.000012509503,0.000044668304,0.000044841723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980505,0.000016837786,0.00044593887,0.00044698696,0.0006707475,0.00036894897],"domain_scores_gemma":[0.9989566,0.00018143204,0.000098932855,0.00034784258,0.00034490522,0.00007027931],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018576899,0.00025415208,0.00027917378,0.0010009297,0.000084001374,0.000056140376,0.00028607575,0.0002441717,0.000039831775],"category_scores_gemma":[0.0001097292,0.0002620973,0.000056712237,0.0007116999,0.00023572573,0.0001812251,0.00009803914,0.00053075183,0.000008368131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015005771,0.000010581853,0.00001532616,0.000023027076,0.000006831425,0.00001589029,0.00059403403,0.8250437,0.0000130304015,0.0006716342,3.1916346e-7,0.17360413],"study_design_scores_gemma":[0.00027609084,0.00002522189,0.000037470927,0.00041931806,0.000018129793,0.00004588176,0.000002141249,0.9851687,0.0003034913,0.013439377,0.000006580488,0.00025762166],"about_ca_topic_score_codex":0.000025296322,"about_ca_topic_score_gemma":0.00019094457,"teacher_disagreement_score":0.42471588,"about_ca_system_score_codex":0.00042223814,"about_ca_system_score_gemma":0.00020786759,"threshold_uncertainty_score":0.99998313},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015278896,0.0012968401,0.9941589,0.00029769356,0.0006729367,0.0003562988,0.000009728846,0.0000072183643,0.001672466],"genre_scores_gemma":[0.81059855,0.01065844,0.16555378,0.0022189377,0.004431959,0.000032664186,0.0003763897,0.00013554763,0.0059937355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981332,0.000024776036,0.00045399248,0.00040228563,0.00062667025,0.0003591156],"domain_scores_gemma":[0.9989773,0.00009908619,0.00015684181,0.00047721935,0.00020499421,0.00008453115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081985776,0.00019770973,0.00020009221,0.00019949791,0.00009439251,0.000057873767,0.00088658545,0.00030525017,0.000008551366],"category_scores_gemma":[0.00025801695,0.00014284007,0.00006891017,0.0001891502,0.0009394803,0.000006686039,0.00050115737,0.00025991703,0.000007534198],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003067987,0.000051394272,0.00012537876,0.000087075634,0.000017628554,0.000003606948,0.0003057329,0.003573626,0.0046229535,0.00056189235,0.000076404816,0.9905436],"study_design_scores_gemma":[0.0014644569,0.001431213,0.0008041857,0.0006465126,0.000026809432,0.000034246827,0.0000065920226,0.7326725,0.14412674,0.014557175,0.10300028,0.0012292641],"about_ca_topic_score_codex":0.000011333907,"about_ca_topic_score_gemma":0.00015242698,"teacher_disagreement_score":0.9893144,"about_ca_system_score_codex":0.000039009512,"about_ca_system_score_gemma":0.0002950885,"threshold_uncertainty_score":0.5824849},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060024646,0.00027816033,0.9947616,0.00016546746,0.0012645208,0.0027592294,0.000010331096,0.0004622189,0.00023848232],"genre_scores_gemma":[0.0066955606,0.00004174959,0.99197286,0.00016587447,0.00042785582,0.0003944108,0.00003800623,0.00007902758,0.00018465327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99459344,0.0001101104,0.0007199124,0.0022456723,0.0010567689,0.0012740821],"domain_scores_gemma":[0.99623394,0.00074008835,0.00048718092,0.0015988897,0.000640657,0.00029921814],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024903435,0.00070387207,0.00059659005,0.0022747298,0.00079202314,0.0018800593,0.003330747,0.00039388484,0.000006263075],"category_scores_gemma":[0.00012894468,0.0006557543,0.00021065422,0.0014322514,0.0009186157,0.0030001337,0.0007823178,0.0010344019,0.0000128230995],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061882824,0.000042369527,0.000007615879,0.00010359907,0.0000139623835,0.0000043260416,0.000682382,0.009524599,0.0011193971,0.019078536,0.0000016495937,0.96941537],"study_design_scores_gemma":[0.00022154441,0.00038243236,0.000006329472,0.00017387001,0.0000045814927,0.000028225077,5.826246e-7,0.54630905,0.00087288814,0.4512102,0.00034240825,0.00044787826],"about_ca_topic_score_codex":0.000031998734,"about_ca_topic_score_gemma":0.000041127732,"teacher_disagreement_score":0.9689675,"about_ca_system_score_codex":0.00039741013,"about_ca_system_score_gemma":0.00034503097,"threshold_uncertainty_score":0.9995894},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05287953,0.014459998,0.90551966,0.0007694881,0.0042777564,0.00542735,0.0002358997,0.00056972506,0.015860576],"genre_scores_gemma":[0.8418045,0.000114508104,0.15216324,0.0026566023,0.0013783372,0.00012544896,0.000106339554,0.00009684224,0.0015542076],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9969193,0.0000145632675,0.00048383238,0.001216085,0.0007102497,0.00065597513],"domain_scores_gemma":[0.9978769,0.00042722392,0.00019497621,0.00085197197,0.00036763487,0.00028130296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003160119,0.0005278573,0.0008127988,0.00025670097,0.00020425649,0.00012911986,0.0003199325,0.00016580404,0.000104897896],"category_scores_gemma":[0.00031330786,0.00044679476,0.0033496332,0.00019014977,0.00040046504,0.00016042123,0.00015282199,0.00036255104,0.000048348054],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003180496,0.00047092972,0.01811182,0.0012380846,0.0031203532,0.00015275927,0.0011032296,0.0044840854,0.0033198425,0.0013882205,0.0017088384,0.9645838],"study_design_scores_gemma":[0.027481716,0.011920414,0.55508,0.02649863,0.011921354,0.0023305907,0.000014671253,0.06774602,0.06802618,0.16839857,0.0480095,0.012572368],"about_ca_topic_score_codex":0.000069372334,"about_ca_topic_score_gemma":0.000009274179,"teacher_disagreement_score":0.9520114,"about_ca_system_score_codex":0.00039730515,"about_ca_system_score_gemma":0.0005758088,"threshold_uncertainty_score":0.99979836},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001552641,0.00022639257,0.987208,0.00013671356,0.0011360707,0.00042253864,0.0000021493809,0.00017477467,0.010538063],"genre_scores_gemma":[0.061478507,0.000024046078,0.9367174,0.001134185,0.0002725924,0.000009789542,0.000002291043,0.000035989844,0.00032522937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554926,0.000048677033,0.0005632699,0.0016894018,0.0013229985,0.0008263708],"domain_scores_gemma":[0.9964707,0.00042748413,0.0003760995,0.0021405115,0.00037271864,0.00021250888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014228054,0.00060416234,0.00049340486,0.0010215348,0.00021040995,0.0005197667,0.004246696,0.00037028512,0.00002506329],"category_scores_gemma":[0.00011655287,0.00049823144,0.000081108235,0.00093738013,0.0010653952,0.00070700556,0.0011185806,0.0009405087,0.00009800887],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000110219835,0.000022696848,0.00015605208,0.000037292357,0.0000091290085,0.00006840877,0.0005752264,0.012814085,0.00021592349,0.072745994,0.0000019505087,0.91334224],"study_design_scores_gemma":[0.00081754953,0.0013182303,0.0030913535,0.0012214216,0.000027789136,0.0004041148,4.510908e-7,0.72248274,0.014476746,0.2479926,0.0053514177,0.0028155784],"about_ca_topic_score_codex":0.000011897714,"about_ca_topic_score_gemma":0.000059672097,"teacher_disagreement_score":0.91052663,"about_ca_system_score_codex":0.0002946127,"about_ca_system_score_gemma":0.0005642788,"threshold_uncertainty_score":0.9997469},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021576674,0.00012174018,0.98869383,0.00056751433,0.002447403,0.00067857286,0.000008631187,0.0004728027,0.006987907],"genre_scores_gemma":[0.24083321,0.000006595947,0.7563638,0.0017825572,0.0006046659,0.000045582423,0.000020652109,0.000059265025,0.0002836639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99541956,0.000057556746,0.00064334075,0.0019194924,0.0009891063,0.00097096607],"domain_scores_gemma":[0.9968772,0.0007093803,0.00044879992,0.0014349454,0.00029854328,0.00023114964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016655601,0.0006541873,0.00077725056,0.0006769243,0.00048321387,0.00081811316,0.0036929008,0.00043775156,0.000012031647],"category_scores_gemma":[0.000093292925,0.00056301994,0.00027300091,0.00046574668,0.00039186768,0.00031032535,0.00079055707,0.0007990836,0.000080865706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012884631,0.000019355286,0.000056441695,0.00026567114,0.000012775921,0.00008839762,0.00026350032,0.129358,0.000024567744,0.02356294,0.00018095096,0.8461545],"study_design_scores_gemma":[0.000645767,0.0005084721,0.00001971392,0.0003902446,0.000011487564,0.0000665202,1.0722404e-7,0.95926005,0.00015470579,0.011159984,0.027072135,0.0007107992],"about_ca_topic_score_codex":0.000010291622,"about_ca_topic_score_gemma":0.000018591498,"teacher_disagreement_score":0.8454437,"about_ca_system_score_codex":0.00037935752,"about_ca_system_score_gemma":0.0009015548,"threshold_uncertainty_score":0.9996821},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023629975,0.00031506666,0.9683256,0.000042631036,0.0011598343,0.0003660256,0.00002080602,0.000053087788,0.006086939],"genre_scores_gemma":[0.99143106,0.000045374687,0.0073748915,0.0008021904,0.00020755702,0.0000053379176,0.000038029848,0.000021776365,0.0000738067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979849,0.0000035092735,0.0006742409,0.00041219898,0.0005683494,0.00035683395],"domain_scores_gemma":[0.99760276,0.000093947,0.0013033692,0.00063758175,0.00034760401,0.000014748699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034567562,0.0003419759,0.0004074073,0.00073909084,0.00012179223,0.00018053863,0.00139859,0.0001767063,0.00013949985],"category_scores_gemma":[0.00017566394,0.0002989307,0.000072716124,0.00048162547,0.0006164593,0.0034270147,0.0007490808,0.0003184029,0.000055412343],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013070926,0.000114725364,0.0027347766,0.0022793675,0.00001808432,0.000008126052,0.0024778473,0.006282748,0.011509377,0.016634263,0.00015819671,0.9576518],"study_design_scores_gemma":[0.0018162926,0.0004646026,0.0035712535,0.016782142,0.00019519823,0.000054380205,0.00005126165,0.5220963,0.2972167,0.052166257,0.10010738,0.005478245],"about_ca_topic_score_codex":0.00049073604,"about_ca_topic_score_gemma":0.00006324322,"teacher_disagreement_score":0.96780103,"about_ca_system_score_codex":0.00004496869,"about_ca_system_score_gemma":0.000056100736,"threshold_uncertainty_score":0.9999463},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004003519,0.00012051311,0.99301046,0.0003981768,0.0006177548,0.00022014185,0.0000054468737,0.00005730196,0.0015666782],"genre_scores_gemma":[0.78247106,0.00001446633,0.2166407,0.00025717838,0.00039886453,0.0000039371616,0.00002291268,0.00002890947,0.00016199482],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985496,0.000007045616,0.0003150871,0.0004521254,0.000463126,0.0002130516],"domain_scores_gemma":[0.9990637,0.0002976461,0.00018935083,0.00027450692,0.00010505785,0.000069784706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003392231,0.0002213326,0.00024126066,0.0002173622,0.0001560926,0.00011173326,0.00020315273,0.0001672059,0.00008801656],"category_scores_gemma":[0.00016028948,0.00019444432,0.00004834185,0.00011043676,0.0002827846,0.00014371106,0.0001353096,0.00029534407,0.000008007542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009373471,0.000049476956,0.0023318208,0.0002073237,0.000016985789,0.000055259807,0.0013968375,0.025234422,0.000056974306,0.3973094,0.000042538795,0.5732896],"study_design_scores_gemma":[0.00015779569,0.00003147184,0.0021724242,0.00037965455,0.00001101365,0.000037809375,6.60044e-8,0.04786139,0.000059373775,0.94872963,0.00030167864,0.00025769655],"about_ca_topic_score_codex":0.000010459737,"about_ca_topic_score_gemma":0.00004772495,"teacher_disagreement_score":0.77846754,"about_ca_system_score_codex":0.00015814336,"about_ca_system_score_gemma":0.0001485128,"threshold_uncertainty_score":0.79292095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023278304,0.00018593833,0.99236834,0.00007821519,0.0007655361,0.00031281286,0.0000017360845,0.0002764797,0.005778129],"genre_scores_gemma":[0.7736538,0.00013172237,0.22437482,0.0006261211,0.000676847,0.00001550696,0.000037986345,0.00012641301,0.00035675947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998363,0.000010412446,0.00028266376,0.00049398496,0.00042350852,0.0004264277],"domain_scores_gemma":[0.99913824,0.00011727171,0.00010094843,0.0003967052,0.00015611647,0.000090749185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025689113,0.00034865085,0.00028516605,0.00045191142,0.00013922341,0.0002500226,0.00044042926,0.00020974422,0.00005978606],"category_scores_gemma":[0.000016682852,0.0003072926,0.00003875867,0.00043213478,0.00013732011,0.00026621867,0.00006994171,0.00057892245,0.000043412063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013938951,0.0000036749293,0.0000727247,0.00004119755,0.0000093750605,0.0000033682677,0.00020148027,0.8185881,0.00025734317,0.00025221115,0.000021938336,0.18054721],"study_design_scores_gemma":[0.0001488385,0.00006888915,0.00010764888,0.00032195472,0.000009340867,0.000022930753,7.769604e-8,0.9932122,0.0020814142,0.0026320014,0.0009415497,0.0004531486],"about_ca_topic_score_codex":0.00003417506,"about_ca_topic_score_gemma":0.00008442956,"teacher_disagreement_score":0.77342105,"about_ca_system_score_codex":0.0002335471,"about_ca_system_score_gemma":0.00009312776,"threshold_uncertainty_score":0.9999379},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032639073,0.00023309773,0.99345183,0.00034528231,0.0015095699,0.00038657727,0.0000023835926,0.0002928691,0.0034519755],"genre_scores_gemma":[0.5486743,0.000008849957,0.44982433,0.0009809338,0.00026846761,0.000014585606,0.0000026189405,0.000035755296,0.00019013823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961396,0.00005841596,0.00042579786,0.0017408917,0.0009112333,0.0007240908],"domain_scores_gemma":[0.99719125,0.00039286734,0.00034290846,0.0015228132,0.00033262925,0.00021755933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006878206,0.0006007981,0.0005641702,0.00075088814,0.0002374365,0.00049786625,0.003845649,0.00027074257,0.000028532862],"category_scores_gemma":[0.00007069945,0.00046264712,0.00010376887,0.00043743342,0.0004938554,0.0011418262,0.0009005499,0.000863482,0.00004568365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056686247,0.00012528985,0.00025133818,0.00006549881,0.00003567563,0.0004355853,0.0028248369,0.019837562,0.00012053344,0.026642533,0.0000140122675,0.94959044],"study_design_scores_gemma":[0.00079154246,0.0019127502,0.0014084566,0.0015815869,0.000030024652,0.0001709033,0.0000022400293,0.9325618,0.008861686,0.049502663,0.0014459997,0.0017303472],"about_ca_topic_score_codex":0.0000469635,"about_ca_topic_score_gemma":0.00028033587,"teacher_disagreement_score":0.9478601,"about_ca_system_score_codex":0.00026316664,"about_ca_system_score_gemma":0.0007288089,"threshold_uncertainty_score":0.9997825},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024627012,0.00025091477,0.9942378,0.00011929547,0.0011460489,0.00058470207,0.00006130078,0.000099638404,0.0032540672],"genre_scores_gemma":[0.8569948,0.000012218163,0.14258865,0.00015431317,0.00013747285,0.000009921464,0.000008332374,0.000024360259,0.00006991871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963854,0.000048412265,0.001150506,0.00087161467,0.0009722192,0.000571854],"domain_scores_gemma":[0.99638975,0.00046025615,0.0009719602,0.001552066,0.00048180684,0.0001441592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009324652,0.00046221164,0.000904279,0.000823341,0.00013173842,0.00013764786,0.0035732824,0.0002799304,0.000017308388],"category_scores_gemma":[0.00012114944,0.000436383,0.00024043274,0.0005226724,0.00050763314,0.00081441255,0.00072142895,0.00048187363,0.00002075659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088709465,0.00041859347,0.0009762524,0.0011773756,0.00035512718,0.00017690228,0.0068625202,0.12780361,0.017077427,0.14179115,0.00004919862,0.70322317],"study_design_scores_gemma":[0.0013226528,0.00026963628,0.00029093574,0.0011039963,0.000037018443,0.00005467716,5.944684e-7,0.9659315,0.011302243,0.017681913,0.0012881884,0.0007166694],"about_ca_topic_score_codex":0.00007995464,"about_ca_topic_score_gemma":0.00003083619,"teacher_disagreement_score":0.8567485,"about_ca_system_score_codex":0.00016644795,"about_ca_system_score_gemma":0.0003985394,"threshold_uncertainty_score":0.9998088},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009112525,0.000059579634,0.9951699,0.00060729013,0.0027562673,0.0007817541,0.00002243529,0.00016138455,0.0003502887],"genre_scores_gemma":[0.041947905,0.000030298286,0.95525676,0.0019529286,0.00050490315,0.00000647754,0.000008465796,0.000040623843,0.0002516548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631685,0.000029693148,0.00053247344,0.0014736734,0.0008780473,0.0007692712],"domain_scores_gemma":[0.9980421,0.0003347819,0.00015861895,0.00080745324,0.0003419372,0.0003151055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060391356,0.0004761595,0.00049413333,0.001027155,0.0004184923,0.00048300545,0.0016427056,0.00023488414,0.000047568323],"category_scores_gemma":[0.00007175838,0.00049527775,0.00015659606,0.00053865294,0.0010154101,0.00070692087,0.0008223019,0.00052074884,0.00003332464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054865936,0.0000071985664,0.000007638869,0.000018463208,0.000007875482,0.000036559257,0.0004958521,0.31861365,0.00030204726,0.0025077814,0.000026510452,0.67797095],"study_design_scores_gemma":[0.00038878806,0.00012042993,0.000049255912,0.00020840253,0.000005174139,0.00038612742,5.9176034e-7,0.99117744,0.0028317438,0.003491165,0.00073137495,0.0006095215],"about_ca_topic_score_codex":0.000021725744,"about_ca_topic_score_gemma":0.000015967275,"teacher_disagreement_score":0.6773614,"about_ca_system_score_codex":0.0005047068,"about_ca_system_score_gemma":0.00086554245,"threshold_uncertainty_score":0.9997499},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11287301,0.0033067681,0.8802282,0.00006077825,0.0015164455,0.00028995133,0.000022145974,0.0000074137947,0.0016952526],"genre_scores_gemma":[0.94209087,0.00022722215,0.0560029,0.0002918318,0.0012567453,0.0000024734757,0.000010314133,0.000036100242,0.00008154831],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99817914,0.000029157518,0.00029861947,0.00081044785,0.0002321381,0.0004504957],"domain_scores_gemma":[0.99905664,0.000038670616,0.00018426524,0.00045932038,0.00016045106,0.00010065436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032734053,0.00036413624,0.0003176013,0.00016923196,0.00020722723,0.00007327589,0.00036502088,0.00031387014,0.000005702656],"category_scores_gemma":[0.000034245826,0.00035776175,0.00011147869,0.00009674058,0.0007119201,0.0000029034345,0.00047574082,0.00025912345,0.0000055114233],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001543411,0.0000128763195,0.00066906365,0.000020259908,0.00004551167,0.0000071501136,0.00020324987,0.017535863,0.27221286,0.000090651425,0.0000025195668,0.7091845],"study_design_scores_gemma":[0.0022146746,0.0014811142,0.010331684,0.0012690614,0.00038441076,0.00246406,0.000017676546,0.113937706,0.81273854,0.040632986,0.008439427,0.006088667],"about_ca_topic_score_codex":0.000024347852,"about_ca_topic_score_gemma":0.00013845631,"teacher_disagreement_score":0.82921785,"about_ca_system_score_codex":0.00009158257,"about_ca_system_score_gemma":0.00019314278,"threshold_uncertainty_score":0.9998874},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009381609,0.0006970706,0.9872274,0.0010728362,0.0055849967,0.0006136309,0.000043717322,0.000121590325,0.0037006158],"genre_scores_gemma":[0.9304745,0.000115289564,0.06326529,0.0013887705,0.0015969853,0.000045201683,0.000015616064,0.000075332464,0.0030230114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956267,0.00008187797,0.0007395639,0.0011620383,0.001663498,0.00072634465],"domain_scores_gemma":[0.9962159,0.00032381757,0.0005872295,0.0023396676,0.0003928876,0.00014053345],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00092765887,0.0005204658,0.00054886285,0.00024475783,0.00081054156,0.00065631856,0.0075304364,0.00028055036,0.0000027000744],"category_scores_gemma":[0.00011840444,0.00032653476,0.00033974985,0.0007285047,0.0012728057,0.00032327813,0.0026168376,0.00083574984,0.000028747498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016786853,0.0002762345,0.00018106948,0.00009819612,0.000057708396,0.000116693445,0.004264412,0.45143828,0.0010338153,0.019249331,0.0024267472,0.5208407],"study_design_scores_gemma":[0.0003655916,0.0002655287,0.00024071388,0.00063532457,0.000027649561,0.00035080686,5.3743383e-7,0.9438657,0.0018098714,0.027590439,0.024003502,0.00084433064],"about_ca_topic_score_codex":0.00009512511,"about_ca_topic_score_gemma":0.00007867711,"teacher_disagreement_score":0.92953634,"about_ca_system_score_codex":0.0002474524,"about_ca_system_score_gemma":0.0012592224,"threshold_uncertainty_score":0.9999187},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027738238,0.0032833656,0.9922414,0.00050094305,0.0014367315,0.00060254853,0.000082356164,0.00015282992,0.0014224674],"genre_scores_gemma":[0.05232922,0.0013617162,0.94427145,0.0012273008,0.00063041423,0.00002870291,0.0000767598,0.00004102387,0.000033397704],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968116,0.000038587503,0.00046968725,0.0013676774,0.00059893087,0.0007135004],"domain_scores_gemma":[0.9978206,0.00040872328,0.00022476497,0.0010467978,0.00016800244,0.00033110843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007260491,0.00054152036,0.0005369834,0.00070211967,0.00065056013,0.00060670497,0.0017056926,0.0004226304,0.0000185627],"category_scores_gemma":[0.000027633683,0.00049491477,0.00021081224,0.000490107,0.0011433793,0.0012371691,0.0006338056,0.00061940216,0.0000035979715],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015654812,0.00003505186,0.000047747424,0.00009033391,0.000022832097,0.000013795724,0.0010249545,0.00036561038,0.00031247633,0.13501227,0.000078212215,0.8629811],"study_design_scores_gemma":[0.0020561356,0.00031250346,0.00023775714,0.00063342,0.000078696285,0.00027417688,0.0000015964135,0.22930002,0.0013243821,0.59182477,0.17189105,0.0020655023],"about_ca_topic_score_codex":0.0000143481775,"about_ca_topic_score_gemma":0.00003754267,"teacher_disagreement_score":0.86091554,"about_ca_system_score_codex":0.00010614429,"about_ca_system_score_gemma":0.00034095527,"threshold_uncertainty_score":0.99975026},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027750686,0.00045555676,0.9938212,0.00094172667,0.0009030253,0.0005967915,0.000031516687,0.0028981115,0.00032432185],"genre_scores_gemma":[0.02489534,0.0000107901415,0.97225934,0.0021838997,0.00044506375,0.00004886249,0.000019113502,0.00004785462,0.00008971941],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959381,0.000034919034,0.0005981086,0.0017810975,0.00076059066,0.00088718336],"domain_scores_gemma":[0.99532706,0.002384258,0.00040918987,0.0013422942,0.00036005373,0.00017717828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012887118,0.00065890147,0.0006055754,0.0006358571,0.0005516656,0.0008970287,0.0030436448,0.00037985496,0.0000039613537],"category_scores_gemma":[0.0016848474,0.00059058756,0.00018664084,0.00070564955,0.00055404584,0.00032788437,0.00071064394,0.00082184124,0.0000041817116],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033218905,0.000040859974,0.00031761682,0.000117487696,0.000014719572,0.00007623302,0.0006264025,0.055194963,0.0005154709,0.005136663,0.00052671926,0.93742955],"study_design_scores_gemma":[0.0001822323,0.00023726086,0.000015685164,0.00064737874,0.000009314993,0.00018148865,4.1618495e-8,0.44953656,0.0021580437,0.5444542,0.0017796932,0.0007981124],"about_ca_topic_score_codex":0.000020852809,"about_ca_topic_score_gemma":0.000022648228,"teacher_disagreement_score":0.93663144,"about_ca_system_score_codex":0.00031639799,"about_ca_system_score_gemma":0.0005524714,"threshold_uncertainty_score":0.99965453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016559844,0.024548927,0.9730668,0.00048205012,0.00018768563,0.0003716707,0.0000048918364,0.00046881987,0.0007035651],"genre_scores_gemma":[0.18429436,0.000072367766,0.81477106,0.0005038346,0.00011457418,0.000011856511,0.000011646678,0.000023891507,0.00019639859],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654263,0.000032413784,0.0005063456,0.0017192086,0.0006753468,0.0005240449],"domain_scores_gemma":[0.9978309,0.00025003823,0.00037165877,0.00119828,0.000235332,0.000113741335],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00057943026,0.00054733333,0.0006338947,0.0009271118,0.0002566907,0.0010773315,0.002152544,0.00036851986,0.000029075463],"category_scores_gemma":[0.000087892775,0.0004542937,0.0001415499,0.001346787,0.00049368024,0.001732214,0.00077140203,0.00081988145,0.00000506628],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020467808,0.000013670142,0.00004915898,0.00008893192,0.00004349665,0.00002009413,0.002501968,0.0003123437,0.001480461,0.0019903672,0.0000027502447,0.9934947],"study_design_scores_gemma":[0.00018523737,0.000074977026,0.000039714592,0.0002652272,0.00007567512,0.000036147845,3.312175e-7,0.8587435,0.010063373,0.1296319,0.00017733657,0.0007066159],"about_ca_topic_score_codex":0.00023168155,"about_ca_topic_score_gemma":0.00016662708,"teacher_disagreement_score":0.9927881,"about_ca_system_score_codex":0.00013207577,"about_ca_system_score_gemma":0.00020362173,"threshold_uncertainty_score":0.99995965},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006667325,0.0007248048,0.9955546,0.0014272436,0.00019768611,0.0006621315,0.000006132259,0.000098112636,0.0012625873],"genre_scores_gemma":[0.09912833,0.00018524965,0.898438,0.0017311602,0.0000891026,0.00006701849,0.00006415402,0.00002527571,0.000271701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843585,0.00002710442,0.00035549747,0.0006287496,0.00028686828,0.00026593008],"domain_scores_gemma":[0.99805605,0.00040274658,0.00021305842,0.0009956731,0.0002570533,0.000075417694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007047001,0.00023759868,0.00022660806,0.00029249035,0.00048456175,0.00062200543,0.0011272283,0.0001701783,0.0000042457477],"category_scores_gemma":[0.00006718597,0.00023803794,0.00004519071,0.0002790489,0.0002476157,0.000958488,0.00038707416,0.00026531928,0.000009105072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025276747,0.000027114784,0.0000069405432,0.000083085004,0.000006864887,0.0000016196168,0.0011286834,0.005113115,0.00088731013,0.34784842,0.00018191324,0.6447124],"study_design_scores_gemma":[0.00020791373,0.000047058536,0.000020641348,0.000121157056,0.000008371873,0.000035661946,2.1474035e-7,0.8911761,0.0015259284,0.09779057,0.008774473,0.0002918818],"about_ca_topic_score_codex":0.00000722237,"about_ca_topic_score_gemma":0.000049164282,"teacher_disagreement_score":0.88606304,"about_ca_system_score_codex":0.00013972323,"about_ca_system_score_gemma":0.00012427813,"threshold_uncertainty_score":0.97069055},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030001634,0.00012068962,0.9911906,0.0004471324,0.0012832974,0.000835945,0.00000659754,0.00021964165,0.005596089],"genre_scores_gemma":[0.02804548,0.000010752214,0.969732,0.00097124086,0.0004769421,0.000006867948,0.000008275881,0.000039643295,0.0007088412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959231,0.00001862848,0.0009785916,0.0009989353,0.00125964,0.0008211295],"domain_scores_gemma":[0.9963189,0.00078884314,0.00055134523,0.0013132826,0.0008161608,0.00021148472],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015498406,0.0005555228,0.00066106557,0.0006892974,0.0005429169,0.0015607624,0.0036949732,0.0003642267,0.000066523564],"category_scores_gemma":[0.00024510184,0.00048162002,0.0001817271,0.0004793452,0.000517191,0.0014332896,0.0013675384,0.0007670076,0.0000710462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074600925,0.000043604614,0.000014872137,0.0014816647,0.000031791747,0.000011317746,0.010235093,0.028687587,0.00008914406,0.3682138,0.00021580132,0.59096783],"study_design_scores_gemma":[0.00017960713,0.00006789373,0.000008005616,0.0002660715,0.000004729949,0.000038265094,6.08037e-7,0.70778865,0.0013367296,0.28958106,0.00031257246,0.00041582852],"about_ca_topic_score_codex":0.0000050068893,"about_ca_topic_score_gemma":0.0000031644277,"teacher_disagreement_score":0.67910105,"about_ca_system_score_codex":0.00026926698,"about_ca_system_score_gemma":0.0006630904,"threshold_uncertainty_score":0.99976355},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028108566,0.003790728,0.97585887,0.002417686,0.0029884675,0.0009387433,0.0000034328705,0.00008156831,0.011109662],"genre_scores_gemma":[0.92447585,0.0043309825,0.05911967,0.005176989,0.0052858377,0.00007328512,0.00006359948,0.000085673964,0.0013881301],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971203,0.000036928537,0.00076746155,0.00088730577,0.0005917141,0.0005962451],"domain_scores_gemma":[0.9985413,0.00046238888,0.00013149319,0.0005441156,0.00015816369,0.00016256803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066100794,0.00029354315,0.0004669332,0.00091895624,0.00010978789,0.00007972751,0.0004834255,0.00033322576,0.0002010001],"category_scores_gemma":[0.00025297466,0.00027023777,0.00007520898,0.0011897626,0.0006645116,0.0002816089,0.00007916276,0.0009853584,0.0001828185],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044869306,0.000071319635,0.00035104092,0.00008896131,9.935496e-7,0.000049054473,0.0011620239,0.011329283,0.000014185013,0.00027280778,0.000021755664,0.9865937],"study_design_scores_gemma":[0.000036493606,0.0007617018,0.0003390313,0.0031687915,0.000020536625,0.00014186036,0.000011661268,0.13965441,0.012755759,0.8313925,0.010859288,0.00085793686],"about_ca_topic_score_codex":0.00012411589,"about_ca_topic_score_gemma":0.00068131473,"teacher_disagreement_score":0.9857358,"about_ca_system_score_codex":0.0007459622,"about_ca_system_score_gemma":0.0024454936,"threshold_uncertainty_score":0.99997497},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014241048,0.00047580036,0.9922559,0.0010315526,0.0005721929,0.00044322695,0.00004714157,0.000039510407,0.003710568],"genre_scores_gemma":[0.77705914,0.00009695134,0.2212382,0.0012554863,0.00018587493,0.000009760772,0.000076658536,0.000016709571,0.0000612217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958591,0.000101601574,0.0006549442,0.0017620575,0.0011282905,0.00049404247],"domain_scores_gemma":[0.993438,0.0006594198,0.00031581262,0.005384839,0.00012500912,0.00007692036],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0022211256,0.00038336546,0.0007539733,0.0010434214,0.00012653007,0.00036050865,0.011498223,0.00021517464,0.00003282875],"category_scores_gemma":[0.00008083926,0.00024207559,0.00018096522,0.0022416043,0.0008152683,0.00067761366,0.0035710768,0.0006698985,0.000016046613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006130113,0.00014389276,0.0030624326,0.000055624798,0.0001345623,0.000111794434,0.0025894728,0.07079788,0.00002892325,0.009590326,0.00017659781,0.91330236],"study_design_scores_gemma":[0.000100459656,0.000080447964,0.019431496,0.000066717956,0.000067244066,0.000008529586,6.4145524e-7,0.9468611,0.000009803621,0.032343224,0.00067479635,0.0003555729],"about_ca_topic_score_codex":0.0003660645,"about_ca_topic_score_gemma":0.00062760856,"teacher_disagreement_score":0.91294676,"about_ca_system_score_codex":0.000110670924,"about_ca_system_score_gemma":0.00030687512,"threshold_uncertainty_score":0.99385005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005420466,0.0001907186,0.9838644,0.00013092734,0.0004276791,0.0002689696,0.0000057671996,0.00012243121,0.014447017],"genre_scores_gemma":[0.68016636,0.000019418056,0.31850117,0.00073438336,0.00032887032,0.000011452924,0.0000021773228,0.000042132982,0.00019403432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961131,0.000024362676,0.0005591476,0.0013950687,0.0011690918,0.0007391973],"domain_scores_gemma":[0.99663544,0.0011193868,0.00046688347,0.0011286392,0.00044857472,0.00020106244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007186661,0.0005405118,0.0006413066,0.00064071687,0.000174878,0.0002090268,0.0027514428,0.00026559475,0.000023771398],"category_scores_gemma":[0.00010831604,0.00044674825,0.00012513358,0.0010627559,0.00094803725,0.0005126504,0.00078523275,0.0007012208,0.000035624435],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018088676,0.000055441193,0.0048475093,0.000040369046,0.000019272251,0.00025991627,0.00084336393,0.004485328,0.00003903603,0.010751174,0.000010455186,0.97864634],"study_design_scores_gemma":[0.0023786062,0.0028397462,0.009781907,0.010361827,0.00011969488,0.0020595253,0.0000042348756,0.7173319,0.009583952,0.23836596,0.0013179003,0.0058547435],"about_ca_topic_score_codex":0.000058808982,"about_ca_topic_score_gemma":0.00017615943,"teacher_disagreement_score":0.9727916,"about_ca_system_score_codex":0.00017645594,"about_ca_system_score_gemma":0.0005667483,"threshold_uncertainty_score":0.9997984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10372279,0.00007447805,0.89486325,0.000120171,0.00030347132,0.00027859167,0.000009760862,0.00013178929,0.0004957013],"genre_scores_gemma":[0.6799845,7.3361423e-7,0.31878892,0.000111237096,0.000987357,0.000031374464,0.000077947974,0.000017079707,8.756834e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641263,0.00020170723,0.00048440983,0.0015035826,0.0007208594,0.0006767967],"domain_scores_gemma":[0.99755615,0.00010292379,0.00021199722,0.0015777999,0.00025122357,0.00029991174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013323387,0.0004573706,0.00069535116,0.00047700937,0.0001423935,0.00056394504,0.0021637615,0.00016981277,0.000055386838],"category_scores_gemma":[0.000022260447,0.00040625414,0.00020224517,0.001379368,0.000491812,0.0001965757,0.001973065,0.0010512462,0.000005981604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012857955,0.00032158304,0.019269995,0.00001688845,0.000046528028,0.000006181823,0.00068307435,0.7471147,0.00003215939,0.008061521,0.00010510802,0.22432937],"study_design_scores_gemma":[0.00013560995,0.000032670952,0.0005372797,0.000027462582,0.00002515459,0.0000016002771,8.854254e-7,0.77718306,0.0002671501,0.2213572,0.00006017168,0.00037179253],"about_ca_topic_score_codex":0.00045323622,"about_ca_topic_score_gemma":0.000022954551,"teacher_disagreement_score":0.5762617,"about_ca_system_score_codex":0.00017141002,"about_ca_system_score_gemma":0.00051642145,"threshold_uncertainty_score":0.99983895},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023879996,0.00037985187,0.99470013,0.00013246114,0.0010717985,0.00027406611,0.0000016508914,0.00007510301,0.0031261058],"genre_scores_gemma":[0.7881124,0.00009520625,0.2110998,0.0004157545,0.00018972928,0.0000063346097,0.0000037936115,0.000020614094,0.00005637113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971242,0.000044800505,0.00069707754,0.0009339935,0.00077162276,0.0004283239],"domain_scores_gemma":[0.99790853,0.00023413468,0.0004348558,0.0010525079,0.0002866892,0.000083256666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011000056,0.0003152917,0.00041833945,0.0010287232,0.00010801876,0.00015531623,0.0027185844,0.0002615404,0.00001886572],"category_scores_gemma":[0.000114845614,0.0003127799,0.000092922855,0.0007533236,0.00039876203,0.00061450107,0.00070698536,0.00048259433,0.0000140650445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009810963,0.000065457476,0.00062190933,0.00007808512,0.000008502286,0.000021574751,0.004718386,0.020239074,0.00032143015,0.37018734,0.000010991969,0.60371745],"study_design_scores_gemma":[0.0003643595,0.0001673438,0.0009204415,0.00068625243,0.0000058970663,0.000036664198,3.9413888e-7,0.5917637,0.011734746,0.39220744,0.0014371088,0.00067567616],"about_ca_topic_score_codex":0.00005454451,"about_ca_topic_score_gemma":0.000062976906,"teacher_disagreement_score":0.7878736,"about_ca_system_score_codex":0.00017664648,"about_ca_system_score_gemma":0.00038493483,"threshold_uncertainty_score":0.9999324},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074091884,0.00046384847,0.9966389,0.00005319776,0.0014793894,0.0009416879,0.000020381909,0.0001592192,0.0001693111],"genre_scores_gemma":[0.81575966,0.00005331175,0.18339872,0.00008885766,0.0005161661,0.00004855842,0.000031528707,0.00007479281,0.000028423112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986101,0.000012824035,0.00033361904,0.00053318107,0.00017798594,0.0003323102],"domain_scores_gemma":[0.9990734,0.0002728341,0.00014145447,0.00029768248,0.00013782004,0.00007684033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027497153,0.0003535788,0.00030124016,0.00023934054,0.00022596268,0.00012163194,0.00026739758,0.00022158341,0.0000039498077],"category_scores_gemma":[0.000022028584,0.00029475882,0.000057907968,0.0001409116,0.0002811862,0.00028776377,0.000093601564,0.0003180246,0.0000024502967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018090626,0.000010579551,0.000001502107,0.00013798315,0.000024139666,0.0000025407448,0.0009751719,0.6874415,0.002264977,0.0005899142,0.0000057120083,0.3085279],"study_design_scores_gemma":[0.0002772864,0.00010372299,0.00007502452,0.00015117199,0.000018430586,0.00004818764,3.6238694e-7,0.97980976,0.001790913,0.017345479,0.000045316126,0.00033434576],"about_ca_topic_score_codex":0.000017508866,"about_ca_topic_score_gemma":0.0000698842,"teacher_disagreement_score":0.8156856,"about_ca_system_score_codex":0.00018849841,"about_ca_system_score_gemma":0.00003417401,"threshold_uncertainty_score":0.99995047},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009437669,0.0002214239,0.9970036,0.00008672317,0.0010222474,0.00043383247,0.000035749454,0.00010798576,0.0009940686],"genre_scores_gemma":[0.23818983,0.00015786754,0.75856364,0.0021861494,0.00048319378,0.000026279205,0.000052795665,0.00008267151,0.00025758005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968575,0.000032973938,0.00071045035,0.0011578565,0.0006746941,0.00056648883],"domain_scores_gemma":[0.9976246,0.00031741185,0.0004854234,0.0010926614,0.00035397505,0.00012594133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009485948,0.00043066402,0.0006087404,0.0009458294,0.00019344655,0.00035376253,0.0025661106,0.00025051556,0.000019708163],"category_scores_gemma":[0.0001440562,0.0004117711,0.00022999496,0.0006765574,0.0005228437,0.00073894416,0.00096204877,0.00031235444,0.0000074809027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027704302,0.00013758885,0.00010450611,0.00028860147,0.00005989843,0.00003664183,0.007298492,0.010856764,0.0002578782,0.7527564,0.00017340122,0.22800213],"study_design_scores_gemma":[0.00041870493,0.00021227615,0.000011020599,0.00046274168,0.000021540061,0.000017134318,3.3247392e-7,0.7420083,0.0029932926,0.25005352,0.0031845768,0.00061650714],"about_ca_topic_score_codex":0.000020909283,"about_ca_topic_score_gemma":0.000041487358,"teacher_disagreement_score":0.7311516,"about_ca_system_score_codex":0.00008513452,"about_ca_system_score_gemma":0.0004108104,"threshold_uncertainty_score":0.9998334},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016152338,0.00035589378,0.99043095,0.0011662602,0.0047046044,0.0009196362,0.000026963453,0.00028372832,0.0019504657],"genre_scores_gemma":[0.16383553,0.000042349133,0.8268698,0.0015699859,0.003333332,0.00017114653,0.000058692323,0.00013001845,0.0039891624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956026,0.000034576093,0.00061666284,0.0019354059,0.0009345344,0.0008762259],"domain_scores_gemma":[0.99607366,0.00024383036,0.0003968412,0.002428655,0.00059679407,0.00026021188],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006859975,0.0006167719,0.00061104435,0.00055753416,0.0005201413,0.0015564805,0.00419662,0.00048791387,0.000029317836],"category_scores_gemma":[0.000096708296,0.00057780877,0.000180729,0.0006152812,0.0005074433,0.0017296732,0.00046708342,0.0006532178,0.000067493165],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000150955,0.00007743512,0.00003850773,0.00014021683,0.000033695283,0.000022290455,0.00083997566,0.023725174,0.0013054294,0.16387519,0.0018365507,0.80809045],"study_design_scores_gemma":[0.0006585723,0.00046060188,0.00016724649,0.00030620597,0.000012633794,0.0001507446,8.102793e-7,0.681633,0.0019715359,0.28288832,0.030598935,0.0011513797],"about_ca_topic_score_codex":0.0001036725,"about_ca_topic_score_gemma":0.00016284945,"teacher_disagreement_score":0.80693907,"about_ca_system_score_codex":0.00041346613,"about_ca_system_score_gemma":0.00048113684,"threshold_uncertainty_score":0.99966735},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007441508,0.00061469356,0.9940205,0.00019289652,0.002483528,0.00066908327,0.000016088496,0.00025022228,0.0016785763],"genre_scores_gemma":[0.0262587,0.000038300765,0.972202,0.00047389435,0.000624677,0.000029577543,0.000008197858,0.00003809642,0.0003265503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960789,0.000079132566,0.0007464844,0.0015865575,0.0007733843,0.00073554675],"domain_scores_gemma":[0.99629766,0.00078940915,0.00048164584,0.0018617907,0.0004164229,0.00015307116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028466135,0.0005218617,0.0006245985,0.0006523857,0.00029671323,0.00037090434,0.0037414138,0.00039150566,0.000006632006],"category_scores_gemma":[0.00026284502,0.00048405118,0.0001996075,0.0004801492,0.0005249497,0.00046296653,0.0009097105,0.00058435666,0.00003097827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012318279,0.000033065524,0.00003559157,0.00017577526,0.000015998618,0.000010571698,0.0010392239,0.04180137,0.000115595656,0.21367314,0.00001556486,0.7430718],"study_design_scores_gemma":[0.00018172683,0.0001245445,0.000048677768,0.00023160114,0.0000098081355,0.000019164301,2.8430208e-7,0.7760678,0.003491457,0.21817246,0.0010483309,0.0006041298],"about_ca_topic_score_codex":0.00007564439,"about_ca_topic_score_gemma":0.000041632466,"teacher_disagreement_score":0.74246764,"about_ca_system_score_codex":0.00022893636,"about_ca_system_score_gemma":0.00034450056,"threshold_uncertainty_score":0.9997611},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039415908,0.00014092503,0.9962364,0.0002287864,0.0008854458,0.0010329424,0.000028306335,0.00021901804,0.00083403307],"genre_scores_gemma":[0.06971325,0.000018530623,0.9296132,0.00019205906,0.00011892672,0.00004948039,0.0000059311296,0.000033459753,0.00025520046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954962,0.000019118985,0.0009124095,0.0017218852,0.0010435929,0.0008067984],"domain_scores_gemma":[0.9958784,0.0007676977,0.00063694065,0.0022135426,0.00036596638,0.00013745249],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085560844,0.00054333126,0.00072041794,0.00077219785,0.00023245014,0.00029419296,0.005227649,0.00033897482,0.000015913667],"category_scores_gemma":[0.00082519,0.00048783072,0.00015379518,0.0005962065,0.0015614256,0.0012271925,0.002650215,0.00060872466,0.000031473643],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101890255,0.000047035148,0.00007949371,0.0002615927,0.0000243621,0.000035106343,0.0006716692,0.025160082,0.004018012,0.04472528,0.00010069206,0.9248665],"study_design_scores_gemma":[0.00030165003,0.00020493302,0.000057679354,0.00047795463,0.000010573891,0.00001995746,0.0000011359282,0.6975461,0.015477481,0.28486684,0.00039790434,0.0006377609],"about_ca_topic_score_codex":0.000011152065,"about_ca_topic_score_gemma":0.000009522443,"teacher_disagreement_score":0.9242287,"about_ca_system_score_codex":0.00021694085,"about_ca_system_score_gemma":0.00023654857,"threshold_uncertainty_score":0.99975735},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33823538,0.000040156883,0.65888405,0.000986135,0.0014476081,0.00024866586,0.000002994773,0.0000831413,0.000071857474],"genre_scores_gemma":[0.8989546,0.000006504204,0.09986949,0.0010507506,0.00008617015,0.0000176746,0.0000016481291,0.000011580862,0.0000016001158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969224,0.00017329701,0.00042449005,0.0010961022,0.0008476273,0.0005361354],"domain_scores_gemma":[0.99530363,0.0018141993,0.00031261277,0.0023040671,0.00017353083,0.00009198418],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001007846,0.00038653184,0.00041543442,0.0002611286,0.00016886597,0.0005443353,0.006532645,0.00020717895,0.00006128947],"category_scores_gemma":[0.00031901678,0.0002345251,0.00013946717,0.0012826113,0.000652582,0.000287554,0.0039203917,0.0008612964,0.00004520961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009217912,0.00039948424,0.0070684957,0.00017258196,0.000051829207,0.000025972013,0.009941497,0.22125772,0.0014212431,0.22547396,0.00027198868,0.533906],"study_design_scores_gemma":[0.00007988156,0.00003264779,0.0041901064,0.00020003507,0.0000021553835,0.0000056882463,9.623328e-7,0.5510585,0.010456416,0.43368986,0.000011415596,0.00027238452],"about_ca_topic_score_codex":0.00020369582,"about_ca_topic_score_gemma":0.00000804878,"teacher_disagreement_score":0.5607192,"about_ca_system_score_codex":0.00010267407,"about_ca_system_score_gemma":0.00033452624,"threshold_uncertainty_score":0.9988425},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010873637,0.0001674289,0.7273568,0.00079314195,0.008391811,0.0005171852,0.0000053790473,0.000107057676,0.26157385],"genre_scores_gemma":[0.7983978,0.000040026887,0.16971189,0.00710014,0.0032147162,0.000023383798,0.000025955362,0.000041037787,0.021445043],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981907,0.00013336726,0.00023796833,0.00050513976,0.00048770872,0.00044513345],"domain_scores_gemma":[0.9988322,0.0006038786,0.00011026106,0.00026541398,0.00009655573,0.000091690505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024468433,0.0001560389,0.00022014776,0.0004486943,0.00020380697,0.00011272759,0.000982879,0.0003889533,0.0001391286],"category_scores_gemma":[0.0015576023,0.00014692494,0.00003059496,0.00049911666,0.0008204509,0.00007394368,0.0002152742,0.00071250054,0.00005843645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011545616,0.000067640605,0.0015882242,0.000022141725,0.000007004472,0.0002713064,0.097532816,0.0003960278,0.00013534776,0.19723356,0.00018055594,0.7025538],"study_design_scores_gemma":[0.0009958725,0.00006546838,0.005237264,0.00039312465,0.0000127447665,0.000019568151,0.000034688415,0.0015297495,0.00046698077,0.837789,0.15210766,0.0013478943],"about_ca_topic_score_codex":0.0003099624,"about_ca_topic_score_gemma":0.0066468017,"teacher_disagreement_score":0.7973104,"about_ca_system_score_codex":0.0003904438,"about_ca_system_score_gemma":0.0029806136,"threshold_uncertainty_score":0.59914255},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048930557,0.00024520524,0.98990947,0.00025017583,0.00087197387,0.0007094509,0.000008447246,0.00004497539,0.0030672417],"genre_scores_gemma":[0.48075813,0.000030656498,0.5181407,0.0004969163,0.000112985304,0.000012242934,0.000015588515,0.00002385498,0.0004089429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665856,0.00004039387,0.00082127226,0.0011405511,0.00093869114,0.00040051911],"domain_scores_gemma":[0.99684185,0.0004907568,0.0006986308,0.0011149944,0.0007148429,0.00013894642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091854506,0.0003997185,0.0006689083,0.0011679024,0.00015128501,0.00037646404,0.0050931037,0.00026904195,0.000035910936],"category_scores_gemma":[0.00012821243,0.00037491907,0.00013570665,0.0014769051,0.00049973733,0.0011513224,0.001433513,0.0004029982,0.000025023997],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026827707,0.00009109623,0.0001450751,0.00014207256,0.000052538955,0.00003972474,0.0015119095,0.18051305,0.011497695,0.076886624,0.00016018964,0.7289332],"study_design_scores_gemma":[0.0007608393,0.00056375965,0.001998681,0.0010572469,0.000020552723,0.0000675345,3.3121327e-7,0.5417111,0.032088887,0.41998065,0.00080479553,0.00094561867],"about_ca_topic_score_codex":0.0001607966,"about_ca_topic_score_gemma":0.000029413139,"teacher_disagreement_score":0.7279876,"about_ca_system_score_codex":0.000103717655,"about_ca_system_score_gemma":0.000751214,"threshold_uncertainty_score":0.9998703},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018961238,0.000008870707,0.97865236,0.0013517519,0.000409319,0.00019256285,4.3733704e-7,0.00031676024,0.00010671449],"genre_scores_gemma":[0.5143147,0.0000015223079,0.48347852,0.0021297194,0.00006265347,0.000007115084,0.0000010624348,0.000003855393,8.40061e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974865,0.000088859306,0.00029086365,0.00074483687,0.0009974422,0.0003915065],"domain_scores_gemma":[0.99863803,0.00030209747,0.00010932473,0.0007146843,0.00009710601,0.000138741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007233085,0.00017843768,0.00015412996,0.00038593682,0.00029595045,0.00021839786,0.001551915,0.000065184686,0.000020245327],"category_scores_gemma":[0.00019406927,0.00015630467,0.000054921024,0.0015219185,0.00042681987,0.0008517812,0.00022478368,0.00030426652,0.000023257291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003485695,0.00009533806,0.0004191531,0.000013098359,0.0000010067115,0.000089133704,0.0008539981,0.03761257,0.0055176304,0.00029821185,0.000037503847,0.9550589],"study_design_scores_gemma":[0.00020855015,0.00018986662,0.0033965963,0.000052387386,6.5132167e-7,0.000036244102,3.4273796e-7,0.9520255,0.040881436,0.0030089042,0.000007062085,0.00019250884],"about_ca_topic_score_codex":0.000030491026,"about_ca_topic_score_gemma":0.000008499901,"teacher_disagreement_score":0.95486635,"about_ca_system_score_codex":0.00013212905,"about_ca_system_score_gemma":0.00026541096,"threshold_uncertainty_score":0.637392},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011183551,0.00010368187,0.99643123,0.0009016831,0.0005312329,0.00026066366,0.000015147584,0.000050845665,0.0005871395],"genre_scores_gemma":[0.76182866,0.000027395936,0.2363042,0.0005388321,0.0005958662,0.000021216534,0.000032485288,0.000029246698,0.0006220899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665976,0.00004288919,0.0006230241,0.0012561044,0.00091262,0.00050559535],"domain_scores_gemma":[0.9975799,0.0007166877,0.00043232422,0.0008176785,0.00034324735,0.00011017397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082736916,0.0003862102,0.0010170834,0.0015261478,0.00022673231,0.00040480294,0.0019559963,0.0002797164,0.00017620614],"category_scores_gemma":[0.000077400226,0.00034291323,0.00061124703,0.0012092565,0.00036756272,0.000477474,0.00071354717,0.00034746467,0.000013475371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024460745,0.00024927672,0.004988606,0.00014094329,0.0015043312,0.000018849192,0.0032025774,0.010591113,0.00066278887,0.20424826,0.00017060338,0.7741982],"study_design_scores_gemma":[0.00020137042,0.00013201078,0.004905842,0.000070926326,0.00027944334,0.0000019519416,5.8255796e-7,0.9681625,0.001449607,0.023564734,0.0006990328,0.0005320235],"about_ca_topic_score_codex":0.00008064328,"about_ca_topic_score_gemma":0.00009439268,"teacher_disagreement_score":0.9575714,"about_ca_system_score_codex":0.00013235604,"about_ca_system_score_gemma":0.00016670181,"threshold_uncertainty_score":0.9999023},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007711379,0.00004995703,0.9954223,0.0008776368,0.0006020897,0.0002864221,0.00007607105,0.000033883378,0.0018805048],"genre_scores_gemma":[0.7063432,0.00001154418,0.28950864,0.0017318084,0.0007198322,0.000012694453,0.000048254064,0.00003346331,0.001590584],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965733,0.000037053735,0.00089086866,0.0008174799,0.0014167327,0.00026455824],"domain_scores_gemma":[0.99652004,0.001290488,0.0005957993,0.00092094496,0.0005717492,0.0001009675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024566632,0.00022487788,0.00033781645,0.0013095802,0.00023104466,0.000112681315,0.0012846759,0.00016398572,0.00085109734],"category_scores_gemma":[0.00023446647,0.00018463656,0.00014046034,0.0011633463,0.0008878226,0.00022275679,0.0002071339,0.00035235655,0.00006747702],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075380494,0.0000398578,0.00015781437,0.0000049095847,0.0000042479423,0.0000023683479,0.00022831278,0.02329131,0.00022255634,0.024036212,0.000052711865,0.95195216],"study_design_scores_gemma":[0.00044368824,0.00017017894,0.0024926479,0.000103977654,0.000021251926,0.000023249631,0.000013394607,0.058911417,0.0070438315,0.9142475,0.016046254,0.0004826023],"about_ca_topic_score_codex":0.000027851316,"about_ca_topic_score_gemma":0.00044715995,"teacher_disagreement_score":0.95146954,"about_ca_system_score_codex":0.00011541115,"about_ca_system_score_gemma":0.0005164492,"threshold_uncertainty_score":0.9318919},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006499813,0.00011332042,0.9843298,0.00032830067,0.0014095373,0.003250811,0.0000018408841,0.00024558438,0.010255759],"genre_scores_gemma":[0.6292093,0.00001488469,0.35899785,0.0054261,0.0025956975,0.00035423043,0.000010418821,0.00010324447,0.003288312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941322,0.000047628902,0.0008814322,0.002147913,0.0016835299,0.0011072813],"domain_scores_gemma":[0.99715245,0.00039916587,0.00048571403,0.0012211043,0.00044991693,0.0002916246],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022087758,0.0007452849,0.0008272626,0.0011653756,0.00032720895,0.0010931334,0.0051924055,0.00052924594,0.00009897452],"category_scores_gemma":[0.00013765854,0.00065621873,0.00033420755,0.00091423874,0.00062541815,0.0006570087,0.0016220259,0.0013163148,0.00027010296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013637381,0.000076940516,0.000017765422,0.0000629902,0.000038057235,0.0005078033,0.0013757299,0.06291677,0.000031165473,0.32986605,0.00007941951,0.60501367],"study_design_scores_gemma":[0.00029434997,0.00029691786,0.000014873331,0.0006606851,0.0000107892065,0.00013720544,2.3149778e-7,0.974181,0.0008916885,0.014689196,0.007858125,0.00096492795],"about_ca_topic_score_codex":0.000025403164,"about_ca_topic_score_gemma":0.00013809858,"teacher_disagreement_score":0.91126424,"about_ca_system_score_codex":0.00035766306,"about_ca_system_score_gemma":0.0006149456,"threshold_uncertainty_score":0.99994385},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009648363,0.00087732065,0.9636675,0.01215539,0.0018781824,0.0029218642,0.000024897683,0.000085599546,0.008740883],"genre_scores_gemma":[0.99621445,0.000008601031,0.0022420192,0.0009598262,0.00049012044,0.000026935635,0.0000016967894,0.000014792341,0.000041565607],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707335,0.00031961678,0.00054443657,0.0005444009,0.0009875578,0.00053062435],"domain_scores_gemma":[0.9970083,0.0015348314,0.0005483021,0.00054825674,0.00026339598,0.00009687911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033136294,0.00026308186,0.00037775395,0.00017804686,0.00061185914,0.00025937008,0.002445444,0.00031189327,0.000059601956],"category_scores_gemma":[0.0006830373,0.00015905118,0.00012482402,0.00066696026,0.002111176,0.00063694664,0.0003216726,0.00079373084,0.000002177542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004704962,0.00011846118,0.20847419,0.000106946754,0.000020889742,0.0000033810459,0.010852403,0.06119618,0.00015849255,0.07613592,0.0000049679384,0.6428811],"study_design_scores_gemma":[0.002487063,0.00011066846,0.23313515,0.0016867591,0.00013821894,0.0000043984746,0.00003871573,0.15845686,0.0016099393,0.5955378,0.0050979936,0.0016964785],"about_ca_topic_score_codex":0.0015915798,"about_ca_topic_score_gemma":0.0077056773,"teacher_disagreement_score":0.98656607,"about_ca_system_score_codex":0.00034304097,"about_ca_system_score_gemma":0.0012404643,"threshold_uncertainty_score":0.7778716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050841866,0.00021329874,0.87809974,0.00038105177,0.0051931804,0.0004212773,0.000003607303,0.000032592427,0.11514684],"genre_scores_gemma":[0.97362477,0.0000228704,0.01243598,0.0037542344,0.00060153543,0.00002351482,0.000004224463,0.00004787595,0.009484994],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830747,0.00006105042,0.00037197332,0.0005954005,0.00038245865,0.00028162933],"domain_scores_gemma":[0.99820113,0.00058473536,0.00040658895,0.0005657011,0.00019928784,0.000042578416],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021495174,0.00027426457,0.0003484366,0.0001729492,0.0001418453,0.00005002714,0.00083785446,0.00021613721,0.0016880552],"category_scores_gemma":[0.000044662585,0.00018956592,0.00013846412,0.00013214587,0.0007391983,0.00017939195,0.00034321134,0.0007779362,0.00010329134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041609988,0.00046190113,0.0006645875,0.000050761108,0.00027599462,0.00008344721,0.36795798,0.013619072,0.0015755284,0.097960845,0.0016549974,0.51527876],"study_design_scores_gemma":[0.001195195,0.0010851678,0.009901324,0.0023879413,0.00009756536,0.000047369525,0.00015574344,0.002022592,0.021566227,0.9501422,0.010050876,0.0013477725],"about_ca_topic_score_codex":0.0014087396,"about_ca_topic_score_gemma":0.0007000534,"teacher_disagreement_score":0.97311634,"about_ca_system_score_codex":0.00022969965,"about_ca_system_score_gemma":0.00013289622,"threshold_uncertainty_score":0.99922454},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07196229,0.00026235546,0.9237588,0.003168103,0.0003530991,0.00036813703,0.000002110433,0.000084085616,0.00004101641],"genre_scores_gemma":[0.5720572,0.0000032132282,0.4256327,0.001974584,0.00030323703,0.000017569399,0.0000017825738,0.00000805478,0.0000017036194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984698,0.0000124916905,0.00019757912,0.0005115736,0.00030886166,0.00049964816],"domain_scores_gemma":[0.9991297,0.00021469114,0.00004609342,0.00033749675,0.00012880685,0.00014318601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035862776,0.00016571254,0.00021450664,0.0005597793,0.00021677422,0.00013244024,0.00026863854,0.000060281578,0.0000099661065],"category_scores_gemma":[0.0001302836,0.000132078,0.00012956062,0.0015901694,0.0005970396,0.00020522856,0.000053784894,0.00022334838,0.000009103369],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011213375,0.00031222668,0.051322907,0.00008524558,0.000021824217,0.0000027531953,0.0021395981,0.005387445,0.09612207,0.00006530857,0.00012608584,0.8443024],"study_design_scores_gemma":[0.009676721,0.0041465415,0.0965919,0.0012514391,0.00016546158,0.0009978878,0.000011846911,0.5307668,0.2434795,0.01821132,0.09278964,0.0019109456],"about_ca_topic_score_codex":0.00001555999,"about_ca_topic_score_gemma":0.0000293963,"teacher_disagreement_score":0.84239143,"about_ca_system_score_codex":0.000043034248,"about_ca_system_score_gemma":0.000113589995,"threshold_uncertainty_score":0.5385985},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072361587,0.00033973125,0.9969636,0.00031269196,0.0007109742,0.0005278451,0.000003990201,0.00029664775,0.00012091234],"genre_scores_gemma":[0.2296604,0.000004200792,0.770072,0.00005400389,0.00012003875,0.000033903005,9.766047e-7,0.00002182577,0.000032653363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974184,0.000073190204,0.00045304393,0.0009883965,0.0006271069,0.0004398657],"domain_scores_gemma":[0.9948088,0.0029436185,0.00032999378,0.0015563463,0.00026895443,0.000092264745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015005713,0.000356607,0.00041292087,0.00038697314,0.00035727976,0.0001896803,0.0019887974,0.00017065619,4.7812404e-7],"category_scores_gemma":[0.00051270233,0.0002826545,0.00010778252,0.0006545744,0.00028675242,0.00030541525,0.000643422,0.00048737082,0.00000970695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002827522,0.0000063424795,0.000080041435,0.000029216084,0.0000038929297,0.000025517445,0.000039533115,0.57665336,0.000094737385,0.010698487,3.3655536e-7,0.4123657],"study_design_scores_gemma":[0.00015815384,0.000095481504,0.00037615444,0.0003907548,0.000009979659,0.0003126564,0.0000010279464,0.9931742,0.00024796318,0.0040535536,0.00069447485,0.00048562954],"about_ca_topic_score_codex":0.00004242122,"about_ca_topic_score_gemma":0.000113970425,"teacher_disagreement_score":0.41652083,"about_ca_system_score_codex":0.0003864318,"about_ca_system_score_gemma":0.00022377547,"threshold_uncertainty_score":0.99996257},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000789236,0.00043830858,0.9961495,0.0006825613,0.000586602,0.00047047215,0.000009132986,0.00006996848,0.0008042454],"genre_scores_gemma":[0.6856485,0.00010145637,0.31290543,0.0010695069,0.00019308546,0.000009543133,0.000017104145,0.000029441122,0.000025942283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971573,0.00004211112,0.0006022023,0.0010034633,0.0008013765,0.00039355384],"domain_scores_gemma":[0.997936,0.00028531323,0.00046180497,0.000998136,0.00023485211,0.000083875806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006470687,0.00035673537,0.0003816143,0.001146534,0.00016156133,0.0001540845,0.0016017839,0.0001657069,0.00001270993],"category_scores_gemma":[0.00002726185,0.00032077386,0.00016529347,0.0008231812,0.0004917058,0.00041758077,0.000420032,0.00040490762,0.0000051752286],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007426328,0.00007889605,0.00035655865,0.00021054642,0.000022821665,0.000019503956,0.00090813776,0.042265687,0.0013310633,0.017495366,0.00007862568,0.93722534],"study_design_scores_gemma":[0.0015240525,0.0011255192,0.009339509,0.005592702,0.000071738774,0.00010761902,0.000003974539,0.64222455,0.09170859,0.24510847,0.0009017703,0.0022915062],"about_ca_topic_score_codex":0.00028645693,"about_ca_topic_score_gemma":0.00013294496,"teacher_disagreement_score":0.93493384,"about_ca_system_score_codex":0.00018121144,"about_ca_system_score_gemma":0.000294084,"threshold_uncertainty_score":0.9999244},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027726596,0.001247802,0.97871625,0.0041338243,0.0029363434,0.00050051237,0.0000020735392,0.00050548546,0.011680463],"genre_scores_gemma":[0.016430562,0.00021459686,0.9668692,0.015149068,0.0009475171,0.000018003677,0.0000026292744,0.000037846417,0.0003306282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930327,0.00013508477,0.001695346,0.002723408,0.0013048771,0.0011086005],"domain_scores_gemma":[0.99305296,0.001862928,0.0008073191,0.0021952826,0.0016836652,0.00039787387],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.003985637,0.0007861566,0.001117933,0.00063121755,0.00038610716,0.00084554823,0.00657713,0.00064386916,0.000020912717],"category_scores_gemma":[0.0029720515,0.0006400872,0.00026455137,0.00064295065,0.0004926304,0.0014604046,0.0036371115,0.0011547413,0.00014972874],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035152094,0.00006656149,0.00015961957,0.000046281795,0.000037202855,0.00049182837,0.0016887987,0.0049021416,0.000043934695,0.048984997,0.00011772642,0.9434258],"study_design_scores_gemma":[0.0010261184,0.001524321,0.00074971654,0.003513294,0.000110282024,0.0009480931,0.0000142185745,0.66206115,0.00064808346,0.2726788,0.053198513,0.0035274252],"about_ca_topic_score_codex":0.00020718925,"about_ca_topic_score_gemma":0.0003050189,"teacher_disagreement_score":0.9398983,"about_ca_system_score_codex":0.00016531868,"about_ca_system_score_gemma":0.0005837977,"threshold_uncertainty_score":0.99960506},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004228949,0.0013802715,0.99261177,0.00013761778,0.0006616391,0.0006121172,0.00003507217,0.000059674774,0.00027287906],"genre_scores_gemma":[0.8342357,0.000025450692,0.16524468,0.0002883423,0.00013518857,0.00000876646,0.0000053020535,0.00001736004,0.000039195536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971518,0.00005449769,0.00057391747,0.0010629538,0.00066387595,0.0004929724],"domain_scores_gemma":[0.9973121,0.00069361145,0.00044342436,0.0011520538,0.0002926371,0.00010614263],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073243043,0.00043805983,0.0006906614,0.00030151245,0.00029408274,0.0002680059,0.0022615392,0.00022921458,0.000009660749],"category_scores_gemma":[0.000119693366,0.0003146593,0.00010774303,0.00021372395,0.0007736257,0.00025258894,0.0008383569,0.0005777596,8.150985e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025459094,0.00015599892,0.006198498,0.00055200834,0.000069048256,0.000015734102,0.0083365645,0.023098305,0.0014435817,0.031058675,0.00004776357,0.92899835],"study_design_scores_gemma":[0.00028666784,0.00017347734,0.00045400014,0.00035738776,0.000029615261,0.000032885866,0.0000024628748,0.95065606,0.006278711,0.040758654,0.00044650421,0.0005235915],"about_ca_topic_score_codex":0.00005189703,"about_ca_topic_score_gemma":0.00026446255,"teacher_disagreement_score":0.9284748,"about_ca_system_score_codex":0.00008531615,"about_ca_system_score_gemma":0.00025292218,"threshold_uncertainty_score":0.99993056},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5075089,0.000003125652,0.49079302,0.00009283537,0.0010957784,0.0002699777,0.0000013189429,0.000069086454,0.00016598613],"genre_scores_gemma":[0.9619806,0.00000328332,0.035038233,0.0025718794,0.00038502374,0.000005578984,9.1517916e-7,0.000010149092,0.0000043431087],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9966436,0.00008946099,0.0004137434,0.0011260805,0.0008960051,0.00083113415],"domain_scores_gemma":[0.9986205,0.00030741407,0.0001658494,0.00066222175,0.00007432225,0.0001697036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017858619,0.00021840635,0.00019878926,0.00035661756,0.0005688918,0.00021913467,0.00091349875,0.00008608289,0.000013731814],"category_scores_gemma":[0.00046249232,0.00019365524,0.0000616193,0.0022738478,0.0015018565,0.0009536472,0.00027212242,0.00040615612,0.00001710422],"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.000029928638,0.00006881473,0.00026642287,0.000018724088,1.8869385e-7,0.000032414086,0.00035174156,0.022255376,0.8937718,0.000051186867,0.0000052974683,0.08314809],"study_design_scores_gemma":[0.0009399646,0.00035129808,0.078687556,0.00011360705,0.000005826597,0.00055345293,0.000002783284,0.38711202,0.51793206,0.013119301,0.00043423698,0.00074791565],"about_ca_topic_score_codex":0.00004049607,"about_ca_topic_score_gemma":0.00007592494,"teacher_disagreement_score":0.4557548,"about_ca_system_score_codex":0.0005374199,"about_ca_system_score_gemma":0.00064226316,"threshold_uncertainty_score":0.7897032},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008177961,0.00011996453,0.98668724,0.00034845178,0.00035632635,0.0003292189,0.000004064761,0.00008612617,0.003890667],"genre_scores_gemma":[0.7512191,0.000027097138,0.24833018,0.00035927971,0.000033083936,0.000002596531,0.0000012464061,0.00000819166,0.00001921703],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754125,0.000048280905,0.0003711813,0.0010485568,0.000620438,0.00037032357],"domain_scores_gemma":[0.99784297,0.0005856054,0.00026186433,0.0009503385,0.00025921033,0.0001000081],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00070606184,0.0003605498,0.0005299647,0.00036652436,0.00013852464,0.00019442839,0.0014123878,0.00022532862,0.000012377239],"category_scores_gemma":[0.00011678164,0.00027013422,0.000050702238,0.000351149,0.0046568653,0.00031080213,0.00052428356,0.0004115039,0.0000023038406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035657926,0.0000685261,0.0019095412,0.00007914634,0.0000125591805,0.00009850767,0.00046025042,0.0044339043,0.000090696456,0.4037475,0.000004052408,0.58905965],"study_design_scores_gemma":[0.00038877098,0.0006644275,0.009835867,0.00052333897,0.000009156729,0.00019319377,7.110634e-7,0.06487829,0.0014035938,0.92153335,0.0000664492,0.0005028317],"about_ca_topic_score_codex":0.00004880032,"about_ca_topic_score_gemma":0.00026612607,"teacher_disagreement_score":0.74304116,"about_ca_system_score_codex":0.00013789945,"about_ca_system_score_gemma":0.00032693433,"threshold_uncertainty_score":0.9999751},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37518027,0.000016521592,0.62348825,0.00070921547,0.00004263141,0.00048378838,0.0000037024874,0.000060578976,0.000015056834],"genre_scores_gemma":[0.635546,0.0000036778376,0.3637475,0.0005556618,0.00004103687,0.00008308412,0.0000034914574,0.0000074397335,0.000012065325],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868166,0.000009682137,0.0002589663,0.00049912883,0.0002215816,0.00032895873],"domain_scores_gemma":[0.99921495,0.0002190527,0.00007300264,0.00026992132,0.0001478824,0.000075218326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024583578,0.00012657087,0.0001555947,0.00018838602,0.0001465458,0.000112003225,0.00020694567,0.000049421567,0.000012853723],"category_scores_gemma":[0.00013449597,0.00010642119,0.000041625262,0.00048727106,0.0002749005,0.00028332922,0.00012229006,0.00021622043,0.0000040469054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060904997,0.00046303822,0.21082512,0.00009828851,0.0000041496714,0.000014621214,0.0005739042,0.18439142,0.38447252,0.0003315789,0.00007267971,0.21869178],"study_design_scores_gemma":[0.0005529091,0.000046957546,0.07368841,0.0000620824,0.0000018824472,0.000025731531,2.471171e-7,0.89273393,0.020295855,0.012451533,0.000028925433,0.00011155235],"about_ca_topic_score_codex":0.000029936054,"about_ca_topic_score_gemma":0.0000058469127,"teacher_disagreement_score":0.7083425,"about_ca_system_score_codex":0.000100837016,"about_ca_system_score_gemma":0.000101608464,"threshold_uncertainty_score":0.433973},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17791912,0.000027182992,0.81246036,0.009053993,0.00012379554,0.00029340803,8.277245e-7,0.0000927945,0.00002853818],"genre_scores_gemma":[0.6515209,0.000011455956,0.34721544,0.0011891911,0.000026013617,0.000023714376,0.0000052719784,0.000004219481,0.000003778311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913573,0.000014382132,0.00016241269,0.00029842128,0.00020317236,0.00018585956],"domain_scores_gemma":[0.99945056,0.000068100606,0.000045004414,0.00026696204,0.000077862955,0.00009153095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015853172,0.0000800212,0.0001152829,0.00011856742,0.00007513807,0.00005325598,0.00016938464,0.000030009316,0.000096921096],"category_scores_gemma":[0.00010614443,0.00006334441,0.000022010947,0.00064308377,0.00030894336,0.00013820888,0.000044381315,0.00015371539,0.00001539833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019723036,0.000045293506,0.0023905265,0.000011793832,0.0000016265675,0.0000015416647,0.0000603944,0.00022561372,0.039563343,0.00002023486,0.0006155523,0.9570621],"study_design_scores_gemma":[0.00027512637,0.00004713597,0.0028941373,0.00008012511,0.000004696201,0.00012597571,5.0180097e-7,0.9720282,0.019231442,0.004905026,0.00031494832,0.00009270768],"about_ca_topic_score_codex":0.00006956501,"about_ca_topic_score_gemma":0.0000032011733,"teacher_disagreement_score":0.9718026,"about_ca_system_score_codex":0.00007396479,"about_ca_system_score_gemma":0.0000650327,"threshold_uncertainty_score":0.25831097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018084096,0.0001883898,0.98934174,0.0005236647,0.000985715,0.00024727147,0.0000019946178,0.004464032,0.004245387],"genre_scores_gemma":[0.040859595,0.000027339018,0.95656174,0.001702485,0.0004005969,0.00001026585,0.0000039116026,0.00003904803,0.00039500507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966632,0.000025029927,0.00045508696,0.0014691985,0.00081888767,0.0005685668],"domain_scores_gemma":[0.99606127,0.0013802117,0.00032126534,0.0017901269,0.0002996606,0.00014744897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009023633,0.000485532,0.00045228523,0.0007094791,0.00025351028,0.0006526917,0.0037760404,0.00031892664,0.00002020785],"category_scores_gemma":[0.0008246322,0.00045978054,0.00009874375,0.00063782005,0.00048370738,0.0004107244,0.0011628438,0.00063840824,0.000043187978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010631646,0.000016917758,0.00023870319,0.000024605859,0.0000028239836,0.000027390357,0.00014371233,0.13362005,0.000009547646,0.0066314866,0.00035755284,0.8589261],"study_design_scores_gemma":[0.00008998152,0.00012552702,0.000055880017,0.0003466209,0.000003362814,0.00005503009,3.8334536e-9,0.7722825,0.00024581826,0.22549553,0.00080235716,0.0004973916],"about_ca_topic_score_codex":0.000013677026,"about_ca_topic_score_gemma":0.0000076215442,"teacher_disagreement_score":0.8584287,"about_ca_system_score_codex":0.00023435477,"about_ca_system_score_gemma":0.00033459632,"threshold_uncertainty_score":0.99978536},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000102208454,0.0034773033,0.98061657,0.00038552142,0.00450893,0.0009537869,0.000017334198,0.000243126,0.009695245],"genre_scores_gemma":[0.7443689,0.00023468227,0.24888311,0.0018046211,0.002130853,0.00008290124,0.00003574435,0.00010521534,0.0023539627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942469,0.00011097777,0.0010263249,0.0017349453,0.0016853677,0.0011954748],"domain_scores_gemma":[0.9960776,0.0007046012,0.00057024264,0.0019108709,0.000373686,0.00036302494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031183783,0.000755638,0.001395144,0.0006969015,0.00042372264,0.0007123227,0.003766715,0.0004656085,0.0000790389],"category_scores_gemma":[0.00015073658,0.00061358814,0.00034193997,0.0008073269,0.0009414762,0.00060063356,0.0017619625,0.0008785945,0.00025803945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046056445,0.0001735423,0.000022348268,0.00012055433,0.000048425638,0.00013366826,0.0024564152,0.09683209,0.00024100761,0.17415205,0.0002668969,0.7250925],"study_design_scores_gemma":[0.01112141,0.00007181248,0.000027024986,0.00066386553,0.00002227031,0.000115341725,2.8040643e-7,0.9482444,0.00045248054,0.024943648,0.013202817,0.001134673],"about_ca_topic_score_codex":0.00005621534,"about_ca_topic_score_gemma":0.000021792974,"teacher_disagreement_score":0.8514123,"about_ca_system_score_codex":0.00037209678,"about_ca_system_score_gemma":0.0005416475,"threshold_uncertainty_score":0.9996315},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015149584,0.0000623229,0.9934833,0.00044848825,0.0016180212,0.0007818524,0.0000042589163,0.0002525528,0.00319769],"genre_scores_gemma":[0.10538647,0.000023522825,0.8937346,0.0004706734,0.00027189477,0.000009603578,0.000002988058,0.000030341971,0.00006994892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963154,0.000049186587,0.00060267374,0.0014676597,0.00084158586,0.00072346075],"domain_scores_gemma":[0.997772,0.00032889284,0.00043914653,0.00083239534,0.00039439648,0.0002331718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007013801,0.00053753704,0.00048632317,0.000911968,0.0004267521,0.0009613974,0.0015030681,0.00031442958,0.00006873558],"category_scores_gemma":[0.00015129113,0.0005434731,0.00013965352,0.00092161994,0.0009857783,0.00085111574,0.0007057618,0.0008124517,0.000012107556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002525759,0.000012455339,0.00002165595,0.000011334081,0.000009117258,0.00008003063,0.0005805511,0.07848563,0.00038022155,0.022081336,0.0000019904294,0.89833313],"study_design_scores_gemma":[0.0003366586,0.00007433164,0.000041425792,0.0005389192,0.000011617519,0.00039373827,0.0000012559866,0.94324654,0.0013635621,0.052202035,0.0010258141,0.0007641073],"about_ca_topic_score_codex":0.00003658654,"about_ca_topic_score_gemma":0.0000641857,"teacher_disagreement_score":0.89756906,"about_ca_system_score_codex":0.0006719218,"about_ca_system_score_gemma":0.00090744713,"threshold_uncertainty_score":0.9997017},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024773914,0.001277278,0.99371654,0.00095012714,0.0008804784,0.00076499017,0.000026875205,0.0001588349,0.0019771215],"genre_scores_gemma":[0.05132134,0.00023716364,0.9451647,0.0011624735,0.00044475004,0.00008833891,0.000013590298,0.00006137458,0.0015062751],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966294,0.000023862647,0.00050507265,0.0017327318,0.0004514551,0.0006574676],"domain_scores_gemma":[0.9976871,0.00047314927,0.00026606506,0.0011108593,0.00021770585,0.00024514835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062674744,0.0005886054,0.0005817859,0.0008713921,0.0006300845,0.00053294096,0.0018552735,0.00031802998,0.00001581616],"category_scores_gemma":[0.00006428626,0.000521256,0.00015200846,0.0004475739,0.0010668397,0.0006150631,0.0018367618,0.00045489598,0.0000035358769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019178946,0.00005947016,0.000081357866,0.00015424214,0.000041201416,0.000019025989,0.0020076125,0.00016749547,0.0007375258,0.23356232,0.000042885666,0.76310766],"study_design_scores_gemma":[0.00060416176,0.00034715646,0.00028662954,0.00021253439,0.000021845508,0.00011940698,3.128554e-7,0.45849738,0.0010534993,0.53185356,0.006126278,0.00087723555],"about_ca_topic_score_codex":0.00003197091,"about_ca_topic_score_gemma":0.00047701868,"teacher_disagreement_score":0.76223046,"about_ca_system_score_codex":0.00008592079,"about_ca_system_score_gemma":0.00015350759,"threshold_uncertainty_score":0.9997239},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06308362,0.00027832322,0.93476474,0.000028117394,0.00044815923,0.00056972064,0.000002409125,0.000024921052,0.0007999689],"genre_scores_gemma":[0.98958695,0.0000049324826,0.010255741,0.000008173803,0.00010567989,0.0000076046795,7.215647e-7,0.000016948228,0.000013261308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985153,0.000020656431,0.0004123225,0.00022437288,0.0006660243,0.00016133874],"domain_scores_gemma":[0.9989987,0.00019330929,0.00020782309,0.00038962456,0.00018292257,0.000027600845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007288778,0.00017852784,0.00035007385,0.00019122196,0.00007299098,0.0000387818,0.0004947559,0.00012005631,0.000008592882],"category_scores_gemma":[0.000015152959,0.00012403486,0.00007343613,0.00021752584,0.00025182765,0.000045503308,0.000097737706,0.00019478545,0.0000023275636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010288779,0.0000030064793,0.00016287228,0.00023937886,0.000009930068,1.4433651e-7,0.000111043504,0.97872734,0.0003504214,0.00033315213,5.10117e-7,0.020061161],"study_design_scores_gemma":[0.00025779102,0.000014504334,0.00043269392,0.0011024881,0.00005505148,0.000013483757,2.2258898e-7,0.99653757,0.0009881606,0.00046791523,0.0000099953795,0.00012015522],"about_ca_topic_score_codex":0.0000050664016,"about_ca_topic_score_gemma":0.0000065201366,"teacher_disagreement_score":0.9265033,"about_ca_system_score_codex":0.00014807757,"about_ca_system_score_gemma":0.00009265797,"threshold_uncertainty_score":0.5057995},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033211886,0.00028009614,0.99670404,0.00005005342,0.0015848358,0.0007412694,0.000073130475,0.000048435737,0.00018603767],"genre_scores_gemma":[0.3212326,0.0000085394095,0.67819536,0.00003399934,0.00018895487,0.000007663137,0.00003275239,0.000035945188,0.0002641914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958475,0.00010996043,0.0009797901,0.0011839158,0.0014037989,0.0004750205],"domain_scores_gemma":[0.99311817,0.0043937927,0.00068891316,0.0009319039,0.00074845046,0.0001187787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035846217,0.00043297917,0.0008800172,0.0008013425,0.00024326668,0.00024289484,0.0016273257,0.00019001703,0.0000056995423],"category_scores_gemma":[0.0012181067,0.0003092251,0.00013802263,0.0004780926,0.0006649808,0.0001584111,0.00035666025,0.00038569406,0.0000034426619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023863802,0.000018750858,0.000023117434,0.00006957295,0.000018512592,0.000007556655,0.0002778103,0.7680141,0.000039682545,0.00425045,0.000052838535,0.22720374],"study_design_scores_gemma":[0.0003237843,0.0002314471,0.000044687582,0.00036160904,0.000018738943,0.00011170724,8.3992126e-7,0.9626733,0.00023611737,0.03547878,0.00015808115,0.0003608866],"about_ca_topic_score_codex":0.000027421134,"about_ca_topic_score_gemma":0.000013970682,"teacher_disagreement_score":0.32090047,"about_ca_system_score_codex":0.00025860136,"about_ca_system_score_gemma":0.0004988444,"threshold_uncertainty_score":0.999936},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006057354,0.00077714084,0.98950905,0.0017526456,0.0044552987,0.000475583,0.0000061996475,0.0012729559,0.0016905713],"genre_scores_gemma":[0.008004125,0.0000908285,0.9877988,0.0019095761,0.0008535183,0.0000052885707,0.0000064443648,0.000076009645,0.0012553997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936108,0.000097994685,0.0009726009,0.0027615798,0.0011018615,0.0014551822],"domain_scores_gemma":[0.9943146,0.0019727917,0.00053529686,0.0026054003,0.00027432057,0.00029758387],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002078195,0.0011126371,0.0011449844,0.0011869795,0.0004131078,0.0007081467,0.006524401,0.0006019449,0.000016780872],"category_scores_gemma":[0.0005034188,0.0011012255,0.0002751397,0.0008947505,0.0007916708,0.000983594,0.0025748338,0.0018350987,0.00014773029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028197571,0.000012989113,0.000018005328,0.00002220326,0.000009501898,0.00008085592,0.00038868934,0.54118955,0.0000939217,0.0019127355,0.000062686435,0.45620605],"study_design_scores_gemma":[0.0004950852,0.0003379634,0.0004505897,0.0007890848,0.000018064218,0.00025862438,5.058197e-7,0.78169596,0.0016125995,0.19790727,0.014306016,0.0021282092],"about_ca_topic_score_codex":0.0000086042955,"about_ca_topic_score_gemma":0.00003767618,"teacher_disagreement_score":0.45407784,"about_ca_system_score_codex":0.0009158781,"about_ca_system_score_gemma":0.0007003306,"threshold_uncertainty_score":0.9991438},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019394698,0.00042012337,0.9961518,0.00027944244,0.0011216444,0.00061449915,0.000010016919,0.000091903195,0.0012911687],"genre_scores_gemma":[0.2343419,0.00002903682,0.76452196,0.00035066422,0.00036930732,0.000023422555,0.000012081351,0.00003067422,0.0003209612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750775,0.000028510965,0.00046863,0.00074431166,0.00074695045,0.000503817],"domain_scores_gemma":[0.99808544,0.00033137033,0.0003151953,0.000778489,0.0003691026,0.00012039745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010743997,0.00028244389,0.0004063513,0.0005517776,0.00018178465,0.0004139773,0.0015945183,0.00019436644,0.0000032635041],"category_scores_gemma":[0.000049050926,0.00025224724,0.00013099401,0.0003585418,0.00026913334,0.0012035646,0.0005878065,0.00027026059,0.0000069002335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015101836,0.000051850606,0.000034013974,0.0006042272,0.000022540098,0.000010725468,0.0013899351,0.28395563,0.0012124506,0.41196206,0.000028608069,0.30071285],"study_design_scores_gemma":[0.00033966117,0.00020727832,0.000033150904,0.0010639644,0.000010698059,0.000048822487,3.901123e-7,0.9674079,0.0033103202,0.026838869,0.00028319465,0.00045578397],"about_ca_topic_score_codex":0.000012382336,"about_ca_topic_score_gemma":0.0000121274825,"teacher_disagreement_score":0.68345225,"about_ca_system_score_codex":0.0003601268,"about_ca_system_score_gemma":0.00046834713,"threshold_uncertainty_score":0.99999297},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013281194,0.00028652902,0.9895607,0.0023577826,0.0012244469,0.00058315333,0.000007483024,0.000866731,0.0049803103],"genre_scores_gemma":[0.16554098,0.00002650925,0.830097,0.0031244252,0.0007965294,0.000015484826,0.000003285243,0.000050375664,0.0003453888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944264,0.00003264389,0.00057825615,0.0022817496,0.0013740805,0.0013068218],"domain_scores_gemma":[0.9960018,0.00047738617,0.00032159183,0.0025156285,0.0003549068,0.00032873577],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00088929274,0.0008552348,0.0007908456,0.0009827528,0.00029790736,0.0005587883,0.0062791896,0.0006417028,0.000028121623],"category_scores_gemma":[0.0001120287,0.000722473,0.00012568796,0.0013344409,0.0023511327,0.0006378612,0.0023464311,0.0017665633,0.00008680869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006315732,0.00002055129,0.00006490967,0.0000089066225,0.000016310427,0.00013071035,0.00019214163,0.3514388,0.000012181157,0.023897303,0.00014143178,0.62407047],"study_design_scores_gemma":[0.00045572434,0.00053399615,0.00027586057,0.00077391067,0.000015103814,0.00041372897,2.0088692e-7,0.9499899,0.0008105317,0.03329667,0.011702173,0.0017321578],"about_ca_topic_score_codex":0.000018985118,"about_ca_topic_score_gemma":0.00025305588,"teacher_disagreement_score":0.6223383,"about_ca_system_score_codex":0.0005055524,"about_ca_system_score_gemma":0.0005457044,"threshold_uncertainty_score":0.9995226},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012481373,0.00004552228,0.9849853,0.0007867279,0.00028127467,0.0005287562,0.000012244637,0.00009228963,0.000786507],"genre_scores_gemma":[0.10660396,0.000036798756,0.89259446,0.00013504123,0.00054116925,0.000008648742,0.000005320831,0.000023452798,0.000051133393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867016,0.0000065142667,0.0002693122,0.00046437632,0.0004139599,0.00017568616],"domain_scores_gemma":[0.99894726,0.00008691007,0.00024381951,0.00041756057,0.00022157769,0.000082851344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027427764,0.00018410051,0.00031793222,0.00040984133,0.000087963424,0.00003256823,0.00021567804,0.00020087155,0.000045761],"category_scores_gemma":[0.0000287749,0.00013452757,0.000052474094,0.0003223465,0.00080728065,0.00008967871,0.0000774685,0.00055075955,0.0000014604165],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039813673,0.000050886447,0.0006040449,0.00016490599,0.000017170632,0.000014573655,0.000100292855,0.00008895261,0.020736657,0.00031935534,0.00000864387,0.9778547],"study_design_scores_gemma":[0.0017423034,0.0013793899,0.0016389632,0.017670954,0.00083497784,0.04024092,0.0000028619836,0.5589568,0.32798722,0.043875623,0.0035922185,0.0020777665],"about_ca_topic_score_codex":0.00010335056,"about_ca_topic_score_gemma":0.000026413965,"teacher_disagreement_score":0.9757769,"about_ca_system_score_codex":0.00009437632,"about_ca_system_score_gemma":0.00035519153,"threshold_uncertainty_score":0.5485875},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001590473,0.000131135,0.9962011,0.000118400596,0.0006298068,0.00032191648,0.000005338643,0.000059798134,0.00094203884],"genre_scores_gemma":[0.25070322,0.00009887613,0.7482536,0.0005871614,0.00024941482,0.000010313222,0.000026106494,0.000016406657,0.000054937478],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843484,0.0000105476365,0.00041102705,0.00048683304,0.00038865567,0.00026810804],"domain_scores_gemma":[0.99875873,0.0001358498,0.00041481692,0.00025447053,0.00036239132,0.000073758514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005700417,0.00023315972,0.000271762,0.00060639286,0.00015401472,0.00022205783,0.0005869948,0.00020698868,0.0000062592358],"category_scores_gemma":[0.00009286468,0.00021501169,0.000059130205,0.0002538775,0.00024650342,0.0016031127,0.00037774025,0.00020924422,0.000008295981],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008976357,0.00000941314,0.000022312797,0.000096073054,0.0000026643802,8.649542e-7,0.00063889736,0.00010045865,0.00046160773,0.0004287014,0.0000054852344,0.99822456],"study_design_scores_gemma":[0.0009677096,0.0009371769,0.00079754496,0.0016644622,0.00002339552,0.00008895079,0.0000011008091,0.27405572,0.14192107,0.5778446,0.0007468188,0.00095142156],"about_ca_topic_score_codex":0.000007901958,"about_ca_topic_score_gemma":0.0000074108743,"teacher_disagreement_score":0.99727315,"about_ca_system_score_codex":0.00007079984,"about_ca_system_score_gemma":0.00020549264,"threshold_uncertainty_score":0.8767922},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007575723,0.00009833896,0.99317575,0.0009886312,0.0011719684,0.00046983836,0.000040240877,0.00005687188,0.00392262],"genre_scores_gemma":[0.18823387,0.000014954005,0.8099236,0.0013371495,0.0003028779,0.000008589497,0.000006828718,0.000014820861,0.00015730389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778724,0.00003955628,0.00048527727,0.00070483034,0.0006511209,0.0003319816],"domain_scores_gemma":[0.99813217,0.0003290211,0.00028349925,0.000818811,0.00033700693,0.000099479505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000732648,0.00025075182,0.00031026147,0.00022319447,0.0002681819,0.00016762437,0.0015872124,0.0002147734,0.000013870191],"category_scores_gemma":[0.0001533531,0.00019500995,0.00019974374,0.0006018353,0.0013588762,0.00016276467,0.00053523795,0.0002929796,0.0000012667944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061658366,0.00001721531,0.0011561429,0.000031671574,0.000015661824,0.0000032979194,0.00038932613,0.09622564,0.000022298675,0.37020108,0.000019384026,0.5319121],"study_design_scores_gemma":[0.00046775007,0.00010309324,0.0044547864,0.00025332885,0.000023015218,0.000100287674,5.394511e-7,0.67378473,0.00056115474,0.31433684,0.005360858,0.00055363605],"about_ca_topic_score_codex":0.000022757702,"about_ca_topic_score_gemma":0.00021190094,"teacher_disagreement_score":0.57755905,"about_ca_system_score_codex":0.00025300906,"about_ca_system_score_gemma":0.00056279986,"threshold_uncertainty_score":0.7952275},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041221985,0.0003282249,0.9948093,0.000599402,0.0006060379,0.00063728285,0.0000014722383,0.0003550753,0.00262196],"genre_scores_gemma":[0.10598233,0.000024504985,0.8933007,0.00026946512,0.00013668193,0.000014234234,0.000001922443,0.00002698597,0.00024318324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966442,0.000089048204,0.00061821105,0.0011854075,0.0009587541,0.0005043832],"domain_scores_gemma":[0.9970898,0.00054036465,0.000509515,0.001317726,0.0004065427,0.00013604853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009572631,0.0004833807,0.00054049044,0.0011178054,0.00018216699,0.00030994264,0.0027247018,0.0002769906,0.000019235738],"category_scores_gemma":[0.00012650849,0.00042888027,0.0001275298,0.000678921,0.0005420027,0.00022713307,0.0009383129,0.00054668856,0.000034604902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031576608,0.000021837395,0.0000018301024,0.000019715475,0.000005029924,0.000006385143,0.00067422417,0.8373911,0.000119672935,0.014221105,0.000045062057,0.14749089],"study_design_scores_gemma":[0.00011874036,0.00017425082,0.0000125040315,0.00026141308,0.000003915572,0.0000147796745,9.5856144e-8,0.85689527,0.0073742643,0.13462095,0.0001302568,0.00039357046],"about_ca_topic_score_codex":0.000022233871,"about_ca_topic_score_gemma":0.000003825401,"teacher_disagreement_score":0.14709732,"about_ca_system_score_codex":0.00015487238,"about_ca_system_score_gemma":0.00041631024,"threshold_uncertainty_score":0.9998163},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000305063,0.0006363117,0.99311715,0.00045085076,0.0026508141,0.00062422367,0.000037378286,0.000398537,0.001779638],"genre_scores_gemma":[0.4549656,0.00005853937,0.5424459,0.0016506849,0.0007044413,0.00001875915,0.00007302676,0.00005714411,0.000025911399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942856,0.000094330084,0.00080898934,0.002347318,0.0014429768,0.0010207959],"domain_scores_gemma":[0.99615365,0.0006973344,0.00050835503,0.0019312714,0.000364914,0.00034447204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013207888,0.0008242064,0.0008033042,0.0010684235,0.0005435432,0.00088525563,0.0037535017,0.00051779597,0.000029303677],"category_scores_gemma":[0.000098555916,0.00076677615,0.0002735107,0.0009852394,0.0011997111,0.00048301453,0.0018279718,0.0011268482,0.000111905276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016583183,0.00010001429,0.00008073814,0.00012401813,0.000025852994,0.000081318365,0.002959682,0.16451246,0.00007736353,0.18670969,0.00016727268,0.645145],"study_design_scores_gemma":[0.00051370973,0.00028975675,0.00020933479,0.00037272568,0.00001353468,0.00008043339,6.498003e-7,0.8954042,0.00039627324,0.09591518,0.005704556,0.0010996402],"about_ca_topic_score_codex":0.00008717478,"about_ca_topic_score_gemma":0.00027458524,"teacher_disagreement_score":0.73089176,"about_ca_system_score_codex":0.00032944098,"about_ca_system_score_gemma":0.00058266503,"threshold_uncertainty_score":0.99947834},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.2040973e-7,0.0005083954,0.9947286,0.00005748922,0.0005049707,0.00031019136,0.000042199925,0.00032924686,0.0035181744],"genre_scores_gemma":[0.0062091057,0.0001671069,0.99231964,0.00033492435,0.00057251775,0.000032619162,0.00012928253,0.000060673712,0.00017412148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985171,0.0000037913057,0.00026443668,0.0005766311,0.00028231775,0.00035570047],"domain_scores_gemma":[0.99892765,0.00010997908,0.000043661465,0.00079424697,0.000059036338,0.00006541107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037719114,0.000260547,0.00025241438,0.00024168823,0.000090448375,0.00011450822,0.0009945476,0.00018297191,0.000033358305],"category_scores_gemma":[0.0000130607805,0.00025395193,0.00004193458,0.00013350692,0.00020208399,0.00017375048,0.00028837408,0.00030981773,0.000008848694],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.192432e-7,0.000003964254,9.681004e-7,0.000025075731,0.000006531694,0.000013897261,0.00003034102,0.016849631,0.000030323716,0.00040086682,0.00039105935,0.9822467],"study_design_scores_gemma":[0.000096174634,0.000062045474,0.0000014527773,0.00022952112,0.000008674828,0.000020043337,5.541547e-8,0.9369728,0.0012117381,0.028244175,0.03285417,0.00029917323],"about_ca_topic_score_codex":0.000009548564,"about_ca_topic_score_gemma":0.000036374535,"teacher_disagreement_score":0.98194754,"about_ca_system_score_codex":0.00016597871,"about_ca_system_score_gemma":0.00006396738,"threshold_uncertainty_score":0.9999913},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020953934,0.00014921097,0.96127754,0.00025619732,0.002301501,0.0003157311,0.000004116088,0.00041778304,0.035068356],"genre_scores_gemma":[0.12737675,0.00025327288,0.8675867,0.0017592834,0.0011929986,0.000014291775,0.000007150097,0.0001201074,0.0016894693],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99498045,0.000120584846,0.0006363493,0.002134468,0.0011713464,0.0009568138],"domain_scores_gemma":[0.9957997,0.0010514135,0.00039223488,0.0022804749,0.00025346698,0.00022266118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023882063,0.00073385873,0.0008214398,0.0010655841,0.00031994772,0.00057345,0.004132266,0.00044276594,0.00007487392],"category_scores_gemma":[0.00017594684,0.00065896043,0.00023772218,0.0007844539,0.0005642953,0.00066050695,0.0009309902,0.0010845987,0.00040647492],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012914755,0.0000438194,0.000057206336,0.000025953488,0.00001747591,0.00023517176,0.0008797534,0.004717789,0.0007259373,0.013458998,0.000033128603,0.9797919],"study_design_scores_gemma":[0.0010891021,0.0014566352,0.0038501667,0.0021829654,0.000029410256,0.0003593798,1.7748981e-7,0.17135833,0.022154748,0.7897609,0.003962104,0.0037960757],"about_ca_topic_score_codex":0.0000668848,"about_ca_topic_score_gemma":0.00004005706,"teacher_disagreement_score":0.9759958,"about_ca_system_score_codex":0.00028209892,"about_ca_system_score_gemma":0.00053753593,"threshold_uncertainty_score":0.99958616},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050079316,0.00060718297,0.8870584,0.0007265228,0.001218909,0.0004614314,0.000016812495,0.000084639454,0.109325305],"genre_scores_gemma":[0.40017486,0.000046682468,0.42650005,0.006891397,0.0040698084,0.00011706383,0.00014300202,0.00028931454,0.16176781],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980085,0.000030178435,0.0002810504,0.00093014725,0.00037814502,0.00037200117],"domain_scores_gemma":[0.9984775,0.00029987434,0.0002431472,0.0006843173,0.0001929131,0.0001022316],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003865753,0.00032178286,0.00032551223,0.00032812665,0.00009373672,0.00006541773,0.0006854501,0.00024201255,0.0014927989],"category_scores_gemma":[0.000020753158,0.00025906615,0.000057323643,0.00020180811,0.0006848272,0.000108637454,0.00010916201,0.00042850862,0.0011765196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017452311,0.00021251813,0.00018833239,0.000028405673,0.00014834094,0.00019100381,0.023533175,0.0024915307,0.00022264016,0.05461335,0.0011482965,0.91704786],"study_design_scores_gemma":[0.0045705284,0.007820459,0.043834053,0.0067041386,0.0005544922,0.00331839,0.000048483496,0.18948008,0.0017233526,0.59548426,0.13551523,0.01094655],"about_ca_topic_score_codex":0.00004134153,"about_ca_topic_score_gemma":0.000019239587,"teacher_disagreement_score":0.90610135,"about_ca_system_score_codex":0.00013215035,"about_ca_system_score_gemma":0.00032371245,"threshold_uncertainty_score":0.9999862},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000071003386,0.00041661217,0.99148697,0.0012235142,0.0019714818,0.00041954324,0.000031948042,0.00027146187,0.0041074893],"genre_scores_gemma":[0.038110524,0.00018526992,0.9487309,0.009365214,0.0009736663,0.00003418658,0.00034973596,0.00010217286,0.002148358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960773,0.000048469632,0.00043805095,0.0015773672,0.0011758688,0.00068296643],"domain_scores_gemma":[0.9977573,0.00038142913,0.0003684432,0.0009422303,0.0003285779,0.00022197461],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010143605,0.0005566025,0.0004105792,0.0009026738,0.00030673618,0.000559239,0.001684377,0.00070726895,0.00008459414],"category_scores_gemma":[0.000091157606,0.0005251244,0.00015114699,0.0006635671,0.00030445438,0.001105181,0.0003491297,0.0012681929,0.00024058798],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012463994,0.000043175056,0.0000068477925,0.00003069851,0.000003825464,0.000047040918,0.00011365564,0.002119348,0.0013856041,0.00012620006,0.0018200555,0.99429107],"study_design_scores_gemma":[0.0011887185,0.00048717533,0.000103285936,0.0018455444,0.000026346492,0.00016689868,8.2428517e-7,0.78651637,0.06711785,0.07253032,0.06756084,0.0024558585],"about_ca_topic_score_codex":0.000020504445,"about_ca_topic_score_gemma":0.00004176391,"teacher_disagreement_score":0.99183524,"about_ca_system_score_codex":0.00029813292,"about_ca_system_score_gemma":0.00031290916,"threshold_uncertainty_score":0.99972004},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008507548,0.00018677296,0.9940741,0.0011325442,0.00020503713,0.0005961258,0.0000013047326,0.00018456162,0.0036110305],"genre_scores_gemma":[0.061408076,0.00004898797,0.936482,0.001394914,0.0001710491,0.000015053615,0.0000042119636,0.000031296688,0.00044437393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965157,0.000053993434,0.00044376284,0.0017439721,0.000679181,0.00056338275],"domain_scores_gemma":[0.99803394,0.00022660052,0.00023508033,0.0009782665,0.00023824279,0.0002878917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010419106,0.00048427196,0.00048297833,0.0013702171,0.0002855148,0.00069371803,0.0016574536,0.00032211927,0.000002373857],"category_scores_gemma":[0.00012186716,0.000464259,0.00007338394,0.001360351,0.00020584157,0.00064089266,0.0006841466,0.0007645455,0.000016918022],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026505497,0.00001095836,0.0000055414944,0.000014598772,0.0000021118149,0.000007620181,0.00044129207,0.06375334,0.00048249637,0.055054937,0.0000062101944,0.88021827],"study_design_scores_gemma":[0.00009011796,0.00010114083,0.00002652798,0.00005725443,0.00000499578,0.000023509081,2.8403507e-8,0.67411983,0.00038154307,0.32458577,0.00025022088,0.00035902864],"about_ca_topic_score_codex":0.000013399824,"about_ca_topic_score_gemma":0.000012600135,"teacher_disagreement_score":0.8798592,"about_ca_system_score_codex":0.0002062366,"about_ca_system_score_gemma":0.00027682201,"threshold_uncertainty_score":0.9997809},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005136487,0.0015658218,0.99204147,0.00046320845,0.0018028313,0.00018480366,0.0000018987238,0.000080428304,0.0033458683],"genre_scores_gemma":[0.85264003,0.00024009909,0.145669,0.00072372914,0.0005037961,0.0000059535296,0.0000010356116,0.000023407756,0.00019292785],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973929,0.00006749012,0.00041686202,0.0007592945,0.00080195506,0.00056150643],"domain_scores_gemma":[0.99691594,0.0009823274,0.00031054567,0.0014774323,0.00018607487,0.00012766082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018159219,0.0003474836,0.0003512754,0.00036342957,0.0004217606,0.00028167455,0.004302407,0.00018728132,0.000014202358],"category_scores_gemma":[0.00006293353,0.00023838272,0.00018781981,0.0005100565,0.0016778737,0.00048017272,0.0014392296,0.00056596857,0.000019111214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008049019,0.000014851472,0.0008235892,0.000016582952,0.000014745247,0.000017882783,0.0004911908,0.0004273477,0.00020408703,0.20685282,0.00001368278,0.79111516],"study_design_scores_gemma":[0.00012206849,0.00015021824,0.0014945916,0.00027762845,0.0000132689665,0.00009774696,3.029137e-7,0.031610142,0.0035330502,0.95826226,0.0038952366,0.00054347643],"about_ca_topic_score_codex":0.000015242572,"about_ca_topic_score_gemma":0.0000383008,"teacher_disagreement_score":0.8521264,"about_ca_system_score_codex":0.0000705492,"about_ca_system_score_gemma":0.00025111574,"threshold_uncertainty_score":0.97209656},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020831198,0.0003387311,0.9970247,0.0005356879,0.0013215495,0.00030075523,0.0003094749,0.000020766684,0.00012750272],"genre_scores_gemma":[0.4035323,0.000089561414,0.59243405,0.00059235917,0.0025099344,0.00002695945,0.00029382,0.00005897705,0.00046204662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769664,0.000014091845,0.00048237346,0.0008426761,0.0006515683,0.0003126726],"domain_scores_gemma":[0.99628955,0.000758707,0.0004292864,0.002259674,0.00021285418,0.000049909322],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001261087,0.0002452986,0.00042846493,0.00019772668,0.00017341725,0.00025147045,0.0070334626,0.00014846007,8.770263e-7],"category_scores_gemma":[0.00008620865,0.00017783826,0.00012900954,0.00045205868,0.0004634644,0.00045742208,0.0028199651,0.00029551238,6.82215e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029265543,0.000031421598,0.000046567555,0.000030074189,0.000045044206,0.0000025042398,0.0003594389,0.01703608,0.000010342087,0.016679918,0.00039376362,0.9653619],"study_design_scores_gemma":[0.00016016651,0.00006543732,0.00013640469,0.000114170776,0.00003812208,0.0000031652728,6.443801e-7,0.98168015,0.00005380767,0.014489993,0.0030391586,0.00021874855],"about_ca_topic_score_codex":0.00004363969,"about_ca_topic_score_gemma":0.00007868173,"teacher_disagreement_score":0.96514314,"about_ca_system_score_codex":0.00005443887,"about_ca_system_score_gemma":0.00046832184,"threshold_uncertainty_score":0.99833894},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025900104,0.00087124674,0.98706496,0.00031456508,0.004966019,0.00063211186,0.000011008574,0.0001598315,0.0057212682],"genre_scores_gemma":[0.946019,0.000099340825,0.04961176,0.0006695062,0.0010003009,0.0000894133,0.00002284131,0.000060941773,0.0024269142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995849,0.000059043065,0.0007722394,0.0015717965,0.000998478,0.00074940774],"domain_scores_gemma":[0.99750227,0.0002809038,0.0003409032,0.0014509918,0.00025324343,0.0001716889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008522122,0.00054577144,0.0006989241,0.0008497386,0.00015790085,0.000887289,0.0031050092,0.00045431164,0.000020001939],"category_scores_gemma":[0.000046489156,0.0004975581,0.00010855003,0.00083792006,0.00030927564,0.0012293361,0.0007387718,0.00090020907,0.00022988816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006350468,0.0000699801,0.0001941059,0.00025111172,0.000015111355,0.0002879918,0.00074777764,0.14582436,0.000111898196,0.09284527,0.00029785803,0.7593482],"study_design_scores_gemma":[0.00038027755,0.000108826935,0.0006238595,0.0012669952,0.0000035331345,0.00013112185,7.364932e-7,0.9537534,0.000106969834,0.034322727,0.008390631,0.0009108831],"about_ca_topic_score_codex":0.00038896865,"about_ca_topic_score_gemma":0.00017933603,"teacher_disagreement_score":0.94576,"about_ca_system_score_codex":0.00048340205,"about_ca_system_score_gemma":0.0004129005,"threshold_uncertainty_score":0.99974763},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001923605,0.000116062765,0.9757436,0.00050433975,0.0015142532,0.0004021995,0.000005191679,0.00011226385,0.019678466],"genre_scores_gemma":[0.076411396,0.000010674016,0.9201994,0.0005664108,0.00082149863,0.000015294961,0.000005618455,0.000077847486,0.0018918951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997619,0.000044059718,0.0006364279,0.00071636203,0.00059370557,0.00039047573],"domain_scores_gemma":[0.99650115,0.0020648933,0.0002486393,0.0008766502,0.00013818545,0.00017049906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012208972,0.00040428477,0.00057738693,0.0006633865,0.00023444719,0.00009754698,0.0010669968,0.00051944,0.0001350788],"category_scores_gemma":[0.0023529993,0.00038207846,0.000111347006,0.00028804215,0.0017640329,0.00009666272,0.00027042476,0.0016512483,0.000088893314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010309707,0.00017745214,0.00003818466,0.00050805096,0.000016543703,0.00016165175,0.01777888,0.00086324126,0.00051724166,0.91884786,0.000067556284,0.06101303],"study_design_scores_gemma":[0.00014154479,0.00004527491,0.000004236453,0.0006212324,0.000017754286,0.0000212375,3.439627e-7,0.013257509,0.0005371295,0.97542655,0.009527479,0.0003996855],"about_ca_topic_score_codex":0.000008244488,"about_ca_topic_score_gemma":0.0007500267,"teacher_disagreement_score":0.07448779,"about_ca_system_score_codex":0.00028250585,"about_ca_system_score_gemma":0.00044998844,"threshold_uncertainty_score":0.9998631},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026284788,0.00093684124,0.99427265,0.0011447982,0.0012672758,0.00057211856,0.000017492124,0.00014271274,0.0016198435],"genre_scores_gemma":[0.0003579756,0.00004185121,0.99594945,0.0020055575,0.00021634421,0.0000708232,0.000016615675,0.000034145196,0.0013072527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996154,0.000051275234,0.0005613619,0.0019335382,0.0005256402,0.0007741505],"domain_scores_gemma":[0.9959239,0.001618931,0.00035792,0.0016439126,0.00024443885,0.00021093142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001874692,0.00050908525,0.00054745324,0.0005224476,0.0005497836,0.0006608434,0.0038095305,0.00027586095,0.000018418952],"category_scores_gemma":[0.00021941127,0.0004683008,0.00016261992,0.0006298294,0.0007145199,0.00059019035,0.001215184,0.000381388,0.000025145138],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018841876,0.000016023838,0.00004454888,0.00003138049,0.000010991175,0.00001328566,0.00045987885,0.0013275193,0.00007518898,0.0134492535,0.0001980424,0.984372],"study_design_scores_gemma":[0.00036545316,0.00024358401,0.000072909184,0.00039157804,0.000023490327,0.00016324077,5.52398e-7,0.8109776,0.0034186943,0.13745044,0.04566135,0.0012311363],"about_ca_topic_score_codex":0.000012986203,"about_ca_topic_score_gemma":0.00006392775,"teacher_disagreement_score":0.9831409,"about_ca_system_score_codex":0.0003522271,"about_ca_system_score_gemma":0.00044494928,"threshold_uncertainty_score":0.99977684},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06132854,0.00009840408,0.93110776,0.003808488,0.0004964324,0.0009814014,0.0000044725784,0.000024068273,0.0021504513],"genre_scores_gemma":[0.9966789,0.000015200138,0.0021465688,0.0010500232,0.000049549883,0.0000103731545,4.5985234e-7,0.0000078319035,0.000041087947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997885,0.00016432106,0.00038191507,0.0005950638,0.00066801126,0.00030568044],"domain_scores_gemma":[0.9961057,0.002125537,0.00032252644,0.0013310136,0.000060811464,0.000054441833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016224901,0.00026982639,0.00042027875,0.00023784579,0.00009613679,0.00007706863,0.0031908574,0.00022067507,0.000007215661],"category_scores_gemma":[0.0002521445,0.00013075468,0.00013308726,0.00053583924,0.00069990463,0.00007994038,0.0009639468,0.00060141506,0.000007910896],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050211784,0.00012762,0.00030426288,0.00009742073,0.000014339926,0.000007777081,0.0013405994,0.05234818,0.001874613,0.16018417,0.0000950926,0.7835557],"study_design_scores_gemma":[0.0018871475,0.007450322,0.03978042,0.0025493936,0.00003888236,0.000089044166,9.803308e-7,0.66662663,0.09100786,0.18549576,0.0036748464,0.0013987144],"about_ca_topic_score_codex":0.000041101102,"about_ca_topic_score_gemma":0.000043658223,"teacher_disagreement_score":0.93535036,"about_ca_system_score_codex":0.00010624619,"about_ca_system_score_gemma":0.00015949561,"threshold_uncertainty_score":0.592946},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023540426,0.00002955998,0.99666995,0.00007217974,0.00026162784,0.00012397105,0.000028953042,0.00002315862,0.0004365853],"genre_scores_gemma":[0.69762355,0.00005158471,0.3019594,0.00025091346,0.00005171647,9.702841e-7,0.000017703373,0.000011104165,0.00003308356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980329,0.0000337219,0.00045927803,0.00062829175,0.00064802583,0.00019776536],"domain_scores_gemma":[0.99847585,0.00014462501,0.0003171939,0.00070024544,0.00025583463,0.00010626568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008455342,0.00019782153,0.00030688423,0.0007321758,0.000092108334,0.000086396954,0.0013639994,0.00018947363,0.000009548182],"category_scores_gemma":[0.00006138365,0.00017838951,0.000038597176,0.00042207408,0.00067715294,0.00046362527,0.0004928164,0.00030923428,8.297339e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025982085,0.0000675344,0.0003846931,0.0000658311,0.00000893589,0.0000065602703,0.00037444537,0.0002429309,0.0021872874,0.16594592,0.0000017129947,0.83071154],"study_design_scores_gemma":[0.00058479403,0.0006035541,0.0087431995,0.00032225068,0.00001781152,0.000027886517,3.8048168e-7,0.78656334,0.014904254,0.18651296,0.0011184771,0.0006010763],"about_ca_topic_score_codex":0.0000068338863,"about_ca_topic_score_gemma":0.000040107032,"teacher_disagreement_score":0.8301105,"about_ca_system_score_codex":0.000021130687,"about_ca_system_score_gemma":0.00010082736,"threshold_uncertainty_score":0.7274513},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016668735,0.00038924982,0.99688977,0.00073009427,0.0004933835,0.0003387352,7.586436e-7,0.00008365782,0.0010576671],"genre_scores_gemma":[0.11346188,0.000107811364,0.88425416,0.001967291,0.00014205316,0.000001432407,0.000002611368,0.000021497124,0.000041277075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971017,0.000061850646,0.0006130772,0.0008648607,0.00094616314,0.00041233486],"domain_scores_gemma":[0.9977315,0.0006222817,0.00031945473,0.0010398146,0.00022649702,0.000060472652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009452792,0.00033316907,0.00037939538,0.00067879143,0.00015587367,0.00025722745,0.0027333114,0.0001906486,0.000008017622],"category_scores_gemma":[0.000100516176,0.00024837515,0.00008657406,0.000954265,0.00025598725,0.0007492782,0.00077345496,0.0006144405,0.0000084887915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017347692,0.000022948967,0.000016812288,0.000009254703,0.0000016706947,0.00000903283,0.0013397129,0.70955515,0.000025130923,0.0031496002,0.0000039873494,0.28586498],"study_design_scores_gemma":[0.00022643367,0.000061014245,0.00003541292,0.00035631258,0.0000038981743,0.000014747474,4.784221e-7,0.9694186,0.00035576045,0.028412057,0.00084754167,0.00026773883],"about_ca_topic_score_codex":0.000005936588,"about_ca_topic_score_gemma":0.00001497122,"teacher_disagreement_score":0.28559723,"about_ca_system_score_codex":0.00019174188,"about_ca_system_score_gemma":0.00021767286,"threshold_uncertainty_score":0.99999684},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024623158,0.00017767513,0.9934921,0.00043073331,0.0027334064,0.00030142808,0.0000040159985,0.000084680956,0.00031359057],"genre_scores_gemma":[0.8245371,0.00008872435,0.17458741,0.00030605885,0.00035509397,0.000011877703,0.000007204786,0.000021386744,0.00008516796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803805,0.000024095167,0.0003512699,0.0009064775,0.0003719459,0.00030814693],"domain_scores_gemma":[0.9987062,0.00019367517,0.00016483915,0.00061068946,0.00019117465,0.00013340854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035807717,0.00031840208,0.0003145311,0.0005402677,0.0005405615,0.00056148105,0.0006873172,0.00021091869,0.000005805355],"category_scores_gemma":[0.000043412067,0.00029769738,0.00003916281,0.00028220026,0.00023232438,0.00094591174,0.0007276932,0.0006784888,0.000007840286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008246656,0.000072144976,0.00045731734,0.0001603676,0.000038628703,0.000037735776,0.003399762,0.059319012,0.0074156174,0.008041665,0.0000064944443,0.921043],"study_design_scores_gemma":[0.00018900208,0.00002293047,0.0005041747,0.00023892993,0.000008402075,0.000104773164,2.6430047e-7,0.9864651,0.0002393101,0.011326605,0.0005696271,0.00033087563],"about_ca_topic_score_codex":0.00022166599,"about_ca_topic_score_gemma":0.00068267813,"teacher_disagreement_score":0.9271461,"about_ca_system_score_codex":0.00010501482,"about_ca_system_score_gemma":0.000112594294,"threshold_uncertainty_score":0.9999475},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028719562,0.00034633206,0.9942322,0.0003219026,0.00073632586,0.00041049634,0.0000111986365,0.00013728424,0.00093234994],"genre_scores_gemma":[0.16922532,0.000024343415,0.8289457,0.00050667406,0.000550689,0.0000057518905,0.00005355703,0.000044619577,0.0006433428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608505,0.00004410719,0.00060188473,0.0015608023,0.001044345,0.0006638262],"domain_scores_gemma":[0.9975666,0.00028207197,0.0003812978,0.0013947188,0.00025834228,0.00011699237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006920808,0.0005017874,0.00055340095,0.0005883908,0.00026614958,0.00042950746,0.001486871,0.00022513418,0.000006123155],"category_scores_gemma":[0.000117465155,0.00040599832,0.000067155655,0.00088931026,0.0006186171,0.0018978876,0.0008240257,0.0008362222,0.000007209306],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085246735,0.000022201491,0.0022685267,0.00014034353,0.000017591416,0.00088328583,0.0020856592,0.07879551,0.00043234866,0.2183862,0.000013687401,0.6968694],"study_design_scores_gemma":[0.0020755217,0.00092939625,0.007380653,0.0066864244,0.000023482908,0.0010467801,0.000004397664,0.6127799,0.009868228,0.33750975,0.017567648,0.0041277716],"about_ca_topic_score_codex":0.00010916397,"about_ca_topic_score_gemma":0.00040425552,"teacher_disagreement_score":0.69274163,"about_ca_system_score_codex":0.0002709434,"about_ca_system_score_gemma":0.00039434998,"threshold_uncertainty_score":0.9998392},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030426834,0.00093704957,0.996199,0.00029850163,0.00080492295,0.0011038386,0.00009131833,0.00011470089,0.000420202],"genre_scores_gemma":[0.023387952,0.00002991309,0.97549564,0.00046858398,0.00029777372,0.00010172465,0.000018043878,0.000029341812,0.00017101031],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953273,0.000077893084,0.0008319265,0.0020517579,0.00093515136,0.0007759531],"domain_scores_gemma":[0.99615633,0.0016378145,0.00041435668,0.0012150637,0.00043323904,0.00014316446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021167714,0.000545657,0.0007298842,0.0006909222,0.00034962123,0.000281612,0.0018152859,0.00034106994,0.00003503545],"category_scores_gemma":[0.00027616695,0.00051144126,0.00014259625,0.0006135019,0.000582828,0.0012630647,0.0009110783,0.00087388704,0.000012767893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012290836,0.00003579947,0.000058772348,0.000115082505,0.000006703684,0.0000488727,0.00063409476,0.019934312,0.00017194657,0.34376875,0.000019621923,0.63519377],"study_design_scores_gemma":[0.00065139314,0.0001864748,0.00009273667,0.00076063134,0.0000036587053,0.00015927818,0.0000012406663,0.45788658,0.0018334269,0.5096364,0.027851753,0.0009364354],"about_ca_topic_score_codex":0.00008285567,"about_ca_topic_score_gemma":0.00073321303,"teacher_disagreement_score":0.6342573,"about_ca_system_score_codex":0.00045637978,"about_ca_system_score_gemma":0.00047046438,"threshold_uncertainty_score":0.99973375},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073444983,0.0008331811,0.9959163,0.00018492389,0.0014158057,0.00055606704,0.000029654382,0.00008722518,0.00024237233],"genre_scores_gemma":[0.09406872,0.00015988127,0.90496033,0.0004048364,0.00017660494,0.00001978176,0.00002094424,0.000038950962,0.00014992346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644035,0.000028766735,0.0005424911,0.0017454164,0.0005310102,0.0007119493],"domain_scores_gemma":[0.9976775,0.00064486044,0.00025358703,0.0010949513,0.00014331937,0.00018580264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006690188,0.00051669317,0.00057007454,0.00084989646,0.00030204325,0.00038430584,0.0019758241,0.0003218092,0.000008238785],"category_scores_gemma":[0.000065604516,0.00046092633,0.00008054513,0.00037723986,0.00044016013,0.00083083764,0.0020526543,0.00055889663,0.000005219227],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067101723,0.000040858024,0.000042041574,0.000040817828,0.000007187559,0.000067256544,0.000617503,0.0015574138,0.00030954045,0.0106327385,0.000011623042,0.9866663],"study_design_scores_gemma":[0.00044727704,0.00018627087,0.00044752893,0.0007528936,0.000008059021,0.00004832626,3.355817e-7,0.8104583,0.00032930312,0.18627095,0.00044371464,0.0006070294],"about_ca_topic_score_codex":0.00011764344,"about_ca_topic_score_gemma":0.00012307407,"teacher_disagreement_score":0.9860593,"about_ca_system_score_codex":0.00020279814,"about_ca_system_score_gemma":0.00028277305,"threshold_uncertainty_score":0.99978423},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030778057,0.0002543058,0.9848901,0.0011747739,0.00061686174,0.0005775189,0.0000026023697,0.000077201206,0.012098825],"genre_scores_gemma":[0.73807013,0.00008172868,0.2560246,0.0028091734,0.0002602709,0.000055237695,0.0000027155486,0.00008322638,0.002612905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961462,0.00009974521,0.0004798906,0.0011740655,0.0014468775,0.0006532392],"domain_scores_gemma":[0.99452275,0.0023397952,0.00033809224,0.0023221925,0.00035363543,0.00012354791],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015135236,0.00044679394,0.0004679999,0.00091551756,0.00031601803,0.00034672234,0.005828728,0.00019500189,0.00010055426],"category_scores_gemma":[0.00026888365,0.00028899827,0.00018653907,0.0009797493,0.001706824,0.0005168179,0.0014499906,0.001110048,0.000109496614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043779837,0.000014838609,0.000008141114,0.00001170786,0.000012384845,0.000011719281,0.00043681642,0.016907293,0.00040691745,0.8330882,0.000034132463,0.14906347],"study_design_scores_gemma":[0.000095163035,0.00017871583,0.0000485944,0.00022122802,0.0000029738062,0.000012806792,2.1511285e-7,0.14784074,0.0037461428,0.8473645,0.00020476058,0.00028419742],"about_ca_topic_score_codex":0.000010257669,"about_ca_topic_score_gemma":0.0000074127947,"teacher_disagreement_score":0.73776233,"about_ca_system_score_codex":0.000104219485,"about_ca_system_score_gemma":0.00031679453,"threshold_uncertainty_score":0.9999562},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013337863,0.0005631772,0.99222964,0.0012289627,0.0017587993,0.000537157,0.000006521792,0.0005279608,0.0030144104],"genre_scores_gemma":[0.09599603,0.000020005586,0.9009475,0.00083988876,0.001401557,0.000020829177,0.000015044076,0.00008302608,0.000676116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99451214,0.000051409996,0.0006989119,0.0022255788,0.0013979234,0.0011140353],"domain_scores_gemma":[0.9968434,0.0004116838,0.00046484047,0.0017440759,0.00029055096,0.00024545784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095788017,0.0007769122,0.000688707,0.000995509,0.00045519657,0.0009003766,0.0046896744,0.00039811447,0.000010573474],"category_scores_gemma":[0.00006959285,0.00068145385,0.00022278016,0.0009328699,0.0010128136,0.0004398504,0.0020543223,0.0014599197,0.000048460122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024077608,0.0000433104,0.000024728111,0.00003743471,0.00001205126,0.00014653725,0.00059752155,0.075603984,0.000026443768,0.020283416,0.00009860526,0.90312356],"study_design_scores_gemma":[0.00019458625,0.00020252736,0.000087641456,0.00042106578,0.000006833635,0.000108125605,8.449638e-8,0.8414355,0.00025634386,0.15048583,0.0060778456,0.00072361215],"about_ca_topic_score_codex":0.000046860507,"about_ca_topic_score_gemma":0.000028063234,"teacher_disagreement_score":0.90239996,"about_ca_system_score_codex":0.00027008101,"about_ca_system_score_gemma":0.00067679846,"threshold_uncertainty_score":0.9995637},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060449256,0.0005142695,0.9953711,0.0005148935,0.00048832194,0.00062032015,0.000014272587,0.00014530386,0.0022710687],"genre_scores_gemma":[0.17262179,0.000035848923,0.82629555,0.00043122593,0.00044089544,0.0000087616545,0.000014024241,0.00002627725,0.00012563421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961322,0.000055768192,0.00066940964,0.0014390295,0.0011196883,0.0005838818],"domain_scores_gemma":[0.9964279,0.00096655666,0.0006690873,0.0011959305,0.00057131913,0.00016920616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005998346,0.00055269274,0.0006232618,0.00075704284,0.00035324285,0.00018329016,0.0026692776,0.0002638585,0.000018599432],"category_scores_gemma":[0.000051116906,0.00048614657,0.00013324546,0.00086141273,0.0007967227,0.0010764772,0.00078561634,0.0009220071,0.00002543395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033928354,0.00021666849,0.00009410652,0.00002853833,0.00004783689,0.000066879715,0.00080872304,0.37975138,0.00031329773,0.014285463,0.0002076914,0.60414547],"study_design_scores_gemma":[0.00032322627,0.00077806093,0.0011838798,0.00059454306,0.000014926664,0.00021642902,6.3290474e-7,0.9170326,0.0004914907,0.077958174,0.0007276647,0.0006783476],"about_ca_topic_score_codex":0.00003011238,"about_ca_topic_score_gemma":0.0000064389246,"teacher_disagreement_score":0.6034671,"about_ca_system_score_codex":0.00039037832,"about_ca_system_score_gemma":0.0009111917,"threshold_uncertainty_score":0.999759},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000906376,0.0011155,0.9923708,0.0003609345,0.0033884444,0.00080246734,0.0000029652697,0.0002577427,0.001692125],"genre_scores_gemma":[0.04997787,0.000035047608,0.9476092,0.0007520216,0.0012911943,0.000020361224,0.0000051651955,0.00004967163,0.00025947607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995739,0.000033621538,0.0006253472,0.0017279194,0.000817212,0.0010568901],"domain_scores_gemma":[0.99670225,0.00085588946,0.00044649668,0.001420597,0.00036133788,0.0002134511],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011643156,0.0006136425,0.0007227328,0.0006518421,0.000492571,0.0011002828,0.0034027973,0.00058556977,0.00001281546],"category_scores_gemma":[0.00021530151,0.00054581836,0.00025658152,0.0007278882,0.00046831355,0.00058480183,0.0011005212,0.00074027,0.00002416614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059787517,0.000029877097,0.00006751507,0.000083502884,0.0000235295,0.000081702194,0.0006988131,0.029279668,0.000047230904,0.6028411,0.000022912878,0.36681816],"study_design_scores_gemma":[0.00018085854,0.0001525723,0.0000044656217,0.00016761658,0.000011220561,0.00012148175,2.8790836e-7,0.38859126,0.00031307866,0.6023172,0.0075370795,0.0006028616],"about_ca_topic_score_codex":0.000040753235,"about_ca_topic_score_gemma":0.000022099963,"teacher_disagreement_score":0.36621532,"about_ca_system_score_codex":0.0003727655,"about_ca_system_score_gemma":0.00050835003,"threshold_uncertainty_score":0.9999367},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003156936,0.0010469607,0.99558055,0.00040762403,0.00067892735,0.0010272493,0.000052745494,0.000120259785,0.00076998485],"genre_scores_gemma":[0.09659647,0.00015347579,0.90210766,0.0005195447,0.00026762806,0.000060580336,0.000016393924,0.00007074594,0.00020750698],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955604,0.000076356504,0.00065598736,0.001649387,0.0011303355,0.00092753983],"domain_scores_gemma":[0.99535614,0.0017239371,0.00039003286,0.0016780263,0.0005583383,0.00029350913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013625821,0.0006065262,0.00082976616,0.0017954103,0.00034800213,0.00042560408,0.003650435,0.00037513435,0.000015276737],"category_scores_gemma":[0.00017418759,0.00055790774,0.00022633908,0.0009945922,0.0027113184,0.0008551915,0.0012713873,0.00082817895,0.000010047269],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024928693,0.00010324067,0.00013218039,0.00024689457,0.00004076091,0.000025662188,0.0006423093,0.0032588935,0.0010843186,0.10454628,0.000085884225,0.88980865],"study_design_scores_gemma":[0.0004432547,0.00073139137,0.00008937845,0.0003718594,0.000009261033,0.000060112234,4.5727026e-7,0.36436892,0.0030653465,0.62891436,0.0013007494,0.00064490776],"about_ca_topic_score_codex":0.0000086096,"about_ca_topic_score_gemma":0.000025169104,"teacher_disagreement_score":0.88916373,"about_ca_system_score_codex":0.00010195815,"about_ca_system_score_gemma":0.0002600078,"threshold_uncertainty_score":0.99968725},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003276622,0.00008773921,0.9943827,0.0030540908,0.00012787699,0.00044966655,0.00001216234,0.000060090628,0.0014980389],"genre_scores_gemma":[0.5288227,0.00011426726,0.46828565,0.0021202266,0.00024331607,0.000027635202,0.000020168023,0.00003802889,0.0003280068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715316,0.00009199665,0.00028272482,0.000969163,0.0009173087,0.0005856424],"domain_scores_gemma":[0.9983224,0.00051391847,0.00012279447,0.0007879569,0.0001250196,0.0001278637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013701259,0.00032729423,0.00031113907,0.0004233209,0.00024191182,0.000705904,0.00224829,0.00013464817,0.000008685484],"category_scores_gemma":[0.000058828035,0.0001804143,0.000030582512,0.00047888036,0.00082756137,0.00047023018,0.0007211935,0.00073955103,0.000007125113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004635799,0.000047609694,0.0013923893,0.000057678415,0.000017339271,0.00017482856,0.0044835727,0.54281825,0.000038217953,0.06474583,0.00002518634,0.38615277],"study_design_scores_gemma":[0.0007386953,0.00031584222,0.00053861376,0.00058055983,0.0000033969482,0.0001904892,0.0000010819043,0.971096,0.000040456438,0.024874171,0.001105479,0.0005152318],"about_ca_topic_score_codex":0.000026348322,"about_ca_topic_score_gemma":0.00014463076,"teacher_disagreement_score":0.528495,"about_ca_system_score_codex":0.00012613052,"about_ca_system_score_gemma":0.00038608906,"threshold_uncertainty_score":0.7357082},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07095936,0.0024776673,0.836802,0.0067728157,0.0073184487,0.0012787814,0.000064065156,0.0010340028,0.073292844],"genre_scores_gemma":[0.90143985,0.000014120268,0.076908395,0.0043760296,0.0035100684,0.000046172645,0.00006407531,0.000119851255,0.013521435],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975936,0.000023002938,0.0003454039,0.0010395267,0.00042834238,0.00057011616],"domain_scores_gemma":[0.99893886,0.00018224442,0.00024596343,0.00038922005,0.00017160631,0.00007208804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017324813,0.00041750353,0.00044764756,0.0005069029,0.00037018253,0.00014226562,0.0010232028,0.00069355516,0.0003509621],"category_scores_gemma":[0.0001092117,0.00034933505,0.00012237795,0.00039580755,0.0016933278,0.00009091717,0.00041653,0.0009479046,0.00019841871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072296925,0.000038157603,0.003039841,0.00003995697,0.000039647155,0.00012779023,0.0058702426,0.00051449117,0.00021587587,0.06505094,0.0011326714,0.92392313],"study_design_scores_gemma":[0.00062649156,0.00051086384,0.008068258,0.00050854584,0.00004650214,0.00022857611,0.00001823463,0.001802631,0.00034678448,0.9809053,0.005435879,0.0015019575],"about_ca_topic_score_codex":0.0001872434,"about_ca_topic_score_gemma":0.00012258856,"teacher_disagreement_score":0.9224212,"about_ca_system_score_codex":0.00015876467,"about_ca_system_score_gemma":0.00017118725,"threshold_uncertainty_score":0.9998959},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010012885,0.0010547622,0.9888351,0.0027105936,0.0015821304,0.0002984494,0.0000021835808,0.000053679694,0.0044618114],"genre_scores_gemma":[0.3940534,0.000010474622,0.6029672,0.0014367719,0.0008628201,0.000027063457,0.0000046464584,0.00003451611,0.0006031243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976223,0.00038220317,0.00030014393,0.0009802467,0.00031672712,0.00039839128],"domain_scores_gemma":[0.9854786,0.013214018,0.00057949225,0.00040937492,0.00024042225,0.00007808348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0046013156,0.00030069507,0.00032675132,0.0004278227,0.00033715344,0.00015921643,0.00056234334,0.00028069058,0.00073226873],"category_scores_gemma":[0.007830021,0.00026093438,0.00006855769,0.00016737208,0.0016055397,0.00014194276,0.0001285975,0.001993424,0.000024744717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007493127,0.000025552185,0.00074665237,0.000031802316,0.000014120317,0.000005379877,0.0017142021,0.00034605968,0.000015529968,0.6259163,0.000016286516,0.37109318],"study_design_scores_gemma":[0.00018086401,0.00051242264,0.0018892594,0.0013337296,0.000028370287,0.000051427138,0.0000011653194,0.009404147,0.00011001211,0.982354,0.0037025365,0.00043207084],"about_ca_topic_score_codex":0.00001701387,"about_ca_topic_score_gemma":0.0000011311754,"teacher_disagreement_score":0.3930521,"about_ca_system_score_codex":0.00007856975,"about_ca_system_score_gemma":0.0004075586,"threshold_uncertainty_score":0.99998426},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039544582,0.000051622887,0.9973476,0.0001738848,0.000408022,0.00052521663,0.000002166833,0.00094852794,0.00014752476],"genre_scores_gemma":[0.42186302,0.0000051898724,0.577826,0.0000819826,0.0001119636,0.000026230662,0.0000025946802,0.000014051934,0.000068922236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981509,0.000016112874,0.00048349693,0.0007914585,0.000326,0.00023202715],"domain_scores_gemma":[0.99638015,0.001970367,0.0005019572,0.00038145366,0.0007124221,0.000053623946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007535449,0.0002537494,0.0002706246,0.0006664352,0.00017904754,0.0003887609,0.0006957392,0.00018557232,0.000002275381],"category_scores_gemma":[0.0017941482,0.00023928672,0.00004583928,0.0004435019,0.00021845277,0.0007193503,0.0002500207,0.0003175104,0.000003325024],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019058286,0.00001889519,0.00034555528,0.000056152465,0.000002745651,4.7461273e-7,0.00023824029,0.0014908097,0.0056304834,0.0014867845,0.000064742606,0.99066323],"study_design_scores_gemma":[0.000073697716,0.00022256482,0.00047578232,0.00053353445,0.0000061350215,0.00004048941,6.616505e-8,0.79420936,0.009770604,0.1944255,0.00003132815,0.0002109642],"about_ca_topic_score_codex":0.00006346575,"about_ca_topic_score_gemma":0.000019995516,"teacher_disagreement_score":0.99045223,"about_ca_system_score_codex":0.00016775391,"about_ca_system_score_gemma":0.00017041306,"threshold_uncertainty_score":0.97578293},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014852185,0.00024970213,0.99340534,0.0011328935,0.0014745499,0.00068556523,0.000023506602,0.00044981833,0.002563781],"genre_scores_gemma":[0.07227615,0.000055147782,0.9219136,0.004429975,0.000271738,0.000047603637,0.000022580673,0.000053449214,0.00092974363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587476,0.000023519955,0.00055013306,0.0016107344,0.0010691347,0.0008716941],"domain_scores_gemma":[0.99629736,0.00016906425,0.00028993405,0.002676933,0.00025300993,0.0003136899],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000849531,0.00053166534,0.0004426701,0.0010533787,0.00020104034,0.0004915485,0.0056036725,0.00029146,0.00003268947],"category_scores_gemma":[0.000085093394,0.0005091975,0.00008767386,0.00073081505,0.0003322843,0.0010321626,0.0025922684,0.0006499615,0.00032337572],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021263504,0.000023787932,0.000020135752,0.000016749165,0.000004925895,0.000009970009,0.00022628112,0.00023642478,0.0018830524,0.019350875,0.00009413004,0.97813153],"study_design_scores_gemma":[0.0008023399,0.0008777628,0.0024689683,0.0013014999,0.000030191022,0.00014709841,3.61901e-7,0.43960547,0.04728381,0.40098846,0.10170865,0.0047854027],"about_ca_topic_score_codex":0.000015256314,"about_ca_topic_score_gemma":0.000041150237,"teacher_disagreement_score":0.9733461,"about_ca_system_score_codex":0.00066857063,"about_ca_system_score_gemma":0.0003851094,"threshold_uncertainty_score":0.9997765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028388,0.000159427,0.98733884,0.00008974265,0.00038447592,0.011243208,0.000005777313,0.0005159554,0.0002341779],"genre_scores_gemma":[0.0050467835,0.000010516106,0.992101,0.00012971075,0.00012516338,0.0024153902,0.0000025097042,0.000052248553,0.00011666898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958556,0.000054473487,0.00045802406,0.0017906206,0.0011032994,0.00073793536],"domain_scores_gemma":[0.996992,0.0006177459,0.00028598044,0.0013366324,0.00048676252,0.00028087647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011345763,0.00068019534,0.00064692216,0.00045911153,0.00018111707,0.00034567545,0.00213299,0.00031054104,0.0000015814303],"category_scores_gemma":[0.00009105928,0.00055712654,0.000054395277,0.00053308054,0.001030152,0.0013160462,0.0012783849,0.0009703876,0.0000031370787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001062588,0.000009033656,0.000023162087,0.00003573165,0.000005185377,0.00009215915,0.0005889792,0.87667656,0.0000115752555,0.021387229,0.0000016208003,0.10115813],"study_design_scores_gemma":[0.00033159318,0.00024529157,0.000003119202,0.00035457886,0.0000055863234,0.00010715986,2.8568405e-7,0.7304521,0.00021851758,0.26739457,0.00029342336,0.0005937742],"about_ca_topic_score_codex":0.000025810541,"about_ca_topic_score_gemma":0.0000139870435,"teacher_disagreement_score":0.24600734,"about_ca_system_score_codex":0.00038065092,"about_ca_system_score_gemma":0.0006198652,"threshold_uncertainty_score":0.999688},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5551084,0.00046236077,0.007941751,0.0073186355,0.006252282,0.0013372243,0.0006061132,0.00016054793,0.42081267],"genre_scores_gemma":[0.9964347,0.0000281479,0.00038039553,0.0017988342,0.001116347,0.0000033913252,0.000033427015,0.000016557893,0.0001882375],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996862,0.00028109836,0.00043019778,0.0004659188,0.0012787483,0.00068204163],"domain_scores_gemma":[0.99374074,0.0051820665,0.00016634079,0.0006644325,0.00008091286,0.00016552646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000980199,0.00028737492,0.00035179313,0.00017172628,0.00085374527,0.0005744054,0.0022932617,0.00032102206,0.000029121877],"category_scores_gemma":[0.00090283033,0.00024264204,0.000052387273,0.00040973138,0.0014993568,0.00023698428,0.00019026866,0.0012918966,0.000008288719],"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.000044809796,0.00006190542,0.009376967,0.000008068711,0.000018519195,0.00022770338,0.42347023,0.00071148225,0.000004614216,0.0067433724,0.00027941033,0.5590529],"study_design_scores_gemma":[0.0022738285,0.00048670813,0.05653951,0.0015464628,0.000060896637,0.0000119823935,0.0022086068,0.002612155,0.00010298052,0.826086,0.10500372,0.003067146],"about_ca_topic_score_codex":0.82723486,"about_ca_topic_score_gemma":0.898993,"teacher_disagreement_score":0.8193426,"about_ca_system_score_codex":0.000603532,"about_ca_system_score_gemma":0.0034070483,"threshold_uncertainty_score":0.98946553},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052951195,0.00007620165,0.99022526,0.0021580574,0.0020204284,0.0010987753,0.0000029289133,0.0002070396,0.0036817857],"genre_scores_gemma":[0.8279569,0.0000133468275,0.16698812,0.0022194153,0.0010628989,0.00008559839,0.000008241159,0.00007843331,0.0015870349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953793,0.00014656973,0.00093059335,0.0016267742,0.001035567,0.00088114676],"domain_scores_gemma":[0.997855,0.00041056328,0.00037138257,0.0009253119,0.00026196972,0.00017575372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002328851,0.00055862224,0.00058237213,0.0007793276,0.00047768737,0.0007655601,0.002086546,0.0002873362,0.00002690127],"category_scores_gemma":[0.0001128323,0.00042977495,0.00014822354,0.0010588247,0.0002019564,0.0006154352,0.0010129355,0.0012426527,0.00010590795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001579167,0.000036180594,0.00010753328,0.0000885969,0.000011704045,0.00008368041,0.004745325,0.15915298,0.00079757156,0.70889133,0.0000074419495,0.12606186],"study_design_scores_gemma":[0.0016805655,0.0021872234,0.0009156799,0.016770003,0.000047283844,0.00041787152,0.00021703003,0.668629,0.004569797,0.074266486,0.22459202,0.00570706],"about_ca_topic_score_codex":0.00031366557,"about_ca_topic_score_gemma":0.0003065111,"teacher_disagreement_score":0.8274274,"about_ca_system_score_codex":0.0014749931,"about_ca_system_score_gemma":0.00055363856,"threshold_uncertainty_score":0.9998154},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.0224837e-7,0.00013768299,0.99464965,0.00022407288,0.0025236974,0.00052170927,0.000020285017,0.00012980141,0.0017924288],"genre_scores_gemma":[0.008345067,0.000012726407,0.9897804,0.0009825679,0.00067379046,0.000032607622,0.0000046447376,0.000031447133,0.00013670142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968127,0.000053694097,0.00045311023,0.001446883,0.00064441666,0.0005892236],"domain_scores_gemma":[0.9967915,0.0015427333,0.00024481915,0.0009696861,0.00027225196,0.00017903231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001241106,0.00043374219,0.00046190288,0.0005203094,0.0002717474,0.0003525568,0.0018712151,0.00050959573,0.000035751873],"category_scores_gemma":[0.00034444433,0.00039478517,0.00013872179,0.0003413505,0.00035159703,0.0003764638,0.00050889456,0.0007763908,0.00001975097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006271032,0.000010266476,9.855098e-7,0.000014063533,0.0000058198457,0.0000068326244,0.0001977524,0.00019168998,0.000019024834,0.5002854,0.0000045419474,0.49925733],"study_design_scores_gemma":[0.00012144231,0.00016886386,0.00004368178,0.00010036635,0.00000874118,0.000032267653,1.1839944e-8,0.24929892,0.00056676083,0.74877053,0.0005393987,0.00034902958],"about_ca_topic_score_codex":0.000013634837,"about_ca_topic_score_gemma":0.000026420954,"teacher_disagreement_score":0.4989083,"about_ca_system_score_codex":0.0002048508,"about_ca_system_score_gemma":0.00054644275,"threshold_uncertainty_score":0.9998504},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63907087,0.000008682856,0.3572115,0.003262059,0.00014553717,0.00026655712,7.136346e-7,0.000020159465,0.000013953686],"genre_scores_gemma":[0.9836922,0.0000031441239,0.015222378,0.0010206978,0.000027917757,0.000026468872,3.5719134e-7,0.000004757992,0.00000202139],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986388,0.00013147652,0.00023346493,0.00048219005,0.000287387,0.00022666484],"domain_scores_gemma":[0.99902123,0.00060279836,0.00008082947,0.00019011876,0.00004222537,0.000062815234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003732221,0.000095143485,0.00011811148,0.00027290074,0.00008399203,0.00010324661,0.0002699804,0.00003864969,0.00001438402],"category_scores_gemma":[0.00091281865,0.00008344152,0.000014934015,0.0011980069,0.0007188225,0.00032002942,0.000083412866,0.00018188529,0.000006190825],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011247117,0.00010401982,0.012802566,0.000035864243,3.3397816e-7,0.000003781069,0.0019291242,0.007882625,0.65480584,0.00063269335,0.000018459412,0.32177344],"study_design_scores_gemma":[0.00028969842,0.00010811669,0.1684945,0.00003501171,7.5610706e-7,0.000024283601,0.0000051686557,0.5908618,0.22432771,0.015730927,0.0000056263234,0.000116406016],"about_ca_topic_score_codex":0.00005675578,"about_ca_topic_score_gemma":0.00006853628,"teacher_disagreement_score":0.58297914,"about_ca_system_score_codex":0.000064410226,"about_ca_system_score_gemma":0.00007618172,"threshold_uncertainty_score":0.34026465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038636762,0.000113466536,0.98455954,0.00010218374,0.00007963528,0.00033699872,0.000034499983,0.00019480218,0.010715177],"genre_scores_gemma":[0.41478568,0.00001302572,0.5840562,0.00024678098,0.00041641624,0.000030819538,0.000016237167,0.00006485656,0.000369945],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975752,0.000006634394,0.0003554846,0.001017672,0.00040285825,0.00064215256],"domain_scores_gemma":[0.9980911,0.000451736,0.00027693468,0.0008681814,0.0001728802,0.000139175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039381525,0.0004630058,0.00046734547,0.000415962,0.0002935314,0.00018866925,0.0009920109,0.0003192236,0.00019154992],"category_scores_gemma":[0.00007460644,0.00040945123,0.0001460235,0.0003632918,0.00045420846,0.00008994482,0.00019358737,0.00063458463,0.0000040771406],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015824851,0.00017171772,0.0047122794,0.0017330651,0.00022890819,0.00013663659,0.0012669249,0.064764574,0.5298436,0.2146922,0.00012740283,0.18216439],"study_design_scores_gemma":[0.0008597646,0.00027633537,0.000043906635,0.0013831398,0.00012520494,0.0003755138,0.0000016138998,0.38350165,0.35498172,0.24709311,0.009460299,0.0018977483],"about_ca_topic_score_codex":0.000070596514,"about_ca_topic_score_gemma":0.00021329243,"teacher_disagreement_score":0.41092202,"about_ca_system_score_codex":0.0006565227,"about_ca_system_score_gemma":0.00043400627,"threshold_uncertainty_score":0.9998357},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003380223,0.0002091522,0.985947,0.0066121668,0.0020203425,0.0015626567,0.000022754739,0.0009723293,0.0026197617],"genre_scores_gemma":[0.13595662,0.000021807436,0.85328263,0.004899466,0.0004533822,0.00014749113,0.000013107781,0.00009820309,0.005127309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918148,0.000028494718,0.0008866332,0.0032967285,0.0020807877,0.0018925486],"domain_scores_gemma":[0.9932678,0.00058264233,0.0003563267,0.0036738713,0.0016042754,0.00051513157],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021057227,0.0010905251,0.0010657833,0.0017397349,0.0004214121,0.0008574248,0.011293573,0.00090882403,0.0000100334255],"category_scores_gemma":[0.0005972013,0.0010287218,0.00023255893,0.0015125968,0.00060582696,0.00066019804,0.0052034054,0.0014586098,0.00012967139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018075954,0.000028820905,0.000011602968,0.000028412298,0.000016917458,0.000036060603,0.0008415669,0.50173926,0.000029619667,0.05409785,0.0020535844,0.4410982],"study_design_scores_gemma":[0.00017456531,0.0002792952,0.000025059673,0.00031538325,0.0000125420365,0.000032635842,1.3092746e-7,0.73684746,0.00017159621,0.25484687,0.0063293613,0.0009651281],"about_ca_topic_score_codex":0.00003540481,"about_ca_topic_score_gemma":0.0003088113,"teacher_disagreement_score":0.44013306,"about_ca_system_score_codex":0.00047894428,"about_ca_system_score_gemma":0.0006787714,"threshold_uncertainty_score":0.9992163},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022210562,0.00047329682,0.99353015,0.0009502206,0.0014936127,0.00048164555,0.00000591551,0.00027935236,0.0025637185],"genre_scores_gemma":[0.41267723,0.00007382334,0.5851575,0.0009105625,0.00074745633,0.000015037547,0.000012717106,0.000058816084,0.0003468282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950634,0.00021042318,0.00051165634,0.002273099,0.00093046477,0.0010109046],"domain_scores_gemma":[0.9966333,0.00052952056,0.00035538038,0.0017865994,0.00030774693,0.00038746482],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007773907,0.00083844236,0.00077057007,0.00075660343,0.0005914469,0.0015374937,0.0040010265,0.0004070126,0.0001787129],"category_scores_gemma":[0.00010922046,0.0007199876,0.00021604722,0.00054972456,0.000946943,0.0010555028,0.0009397347,0.001366378,0.000047592956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035128458,0.000014423878,0.00023458629,0.000015948324,0.000017529363,0.000049363087,0.0007540501,0.14002027,0.0005408049,0.00062800845,0.000023913903,0.8576976],"study_design_scores_gemma":[0.0003652176,0.0003299437,0.00091127877,0.0003125865,0.000019064159,0.00012397321,0.0000016190025,0.9328416,0.0059099672,0.05639378,0.0013987771,0.0013922127],"about_ca_topic_score_codex":0.00013389805,"about_ca_topic_score_gemma":0.00027895105,"teacher_disagreement_score":0.85630536,"about_ca_system_score_codex":0.0002284365,"about_ca_system_score_gemma":0.000414531,"threshold_uncertainty_score":0.9995251},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052200987,0.0011939497,0.9929005,0.00019611996,0.0007336731,0.0027112695,0.0000062896665,0.00025799783,0.0019480205],"genre_scores_gemma":[0.27833647,0.00061552576,0.7184148,0.00051108794,0.00047074945,0.0008185787,0.000035923695,0.00011457595,0.0006823008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99430966,0.00015941069,0.0009596886,0.002057969,0.0012173885,0.001295869],"domain_scores_gemma":[0.9947972,0.0011047183,0.0003172646,0.0033027898,0.00019873038,0.0002792632],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020056376,0.00066420285,0.00076472946,0.0013847329,0.00034960106,0.00065219076,0.008259857,0.00047351976,0.0000104486035],"category_scores_gemma":[0.000017840362,0.0006561101,0.00019547307,0.001240323,0.0006026838,0.0003944456,0.002973647,0.001280917,0.000038148097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014624137,0.00005795839,0.000009507849,0.00007494258,0.000013429286,0.00006646307,0.00032716358,0.40399116,0.0000052541945,0.0028576963,0.000026826845,0.592555],"study_design_scores_gemma":[0.00090557634,0.00009914394,0.000073181276,0.001032439,0.000006343968,0.000022746348,0.0000013903611,0.9904569,0.00005048886,0.0012802808,0.0054334626,0.00063806056],"about_ca_topic_score_codex":0.00003394897,"about_ca_topic_score_gemma":0.00016253974,"teacher_disagreement_score":0.5919169,"about_ca_system_score_codex":0.0011058343,"about_ca_system_score_gemma":0.0002556827,"threshold_uncertainty_score":0.999589},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001875286,0.000059365648,0.99396515,0.0009016556,0.00095947104,0.00076471054,0.000008034712,0.0001632952,0.0031595405],"genre_scores_gemma":[0.08912737,0.000015689502,0.9094343,0.0009992694,0.00017016346,0.00002143306,0.000011655568,0.000022140905,0.00019794362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976427,0.000023805951,0.00044318242,0.0010734136,0.00039740544,0.00041950698],"domain_scores_gemma":[0.9982726,0.00048909785,0.0002662362,0.00052528345,0.0003021119,0.00014468926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008063754,0.0003616241,0.00038162564,0.00048585862,0.00028367215,0.0005474306,0.00067988323,0.00024647446,0.000028887054],"category_scores_gemma":[0.00018135157,0.000355831,0.000057083427,0.0002741903,0.0007698026,0.00036606946,0.00031335565,0.00032579488,0.000004838557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003506384,0.000005299511,0.0000211811,0.000048711765,0.0000071132627,0.000003396355,0.00017341967,0.02551523,0.0002443205,0.27047473,0.000008826319,0.70349425],"study_design_scores_gemma":[0.00046220314,0.00012369904,0.000047688096,0.00023825729,0.000007847971,0.000109385284,2.3765661e-7,0.89697516,0.00043487627,0.09933507,0.001824705,0.00044089626],"about_ca_topic_score_codex":0.000009155928,"about_ca_topic_score_gemma":0.00003610964,"teacher_disagreement_score":0.8714599,"about_ca_system_score_codex":0.00013699531,"about_ca_system_score_gemma":0.0005628013,"threshold_uncertainty_score":0.9998894},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007627406,0.00040854313,0.9979286,0.000031948253,0.0006415699,0.0007236049,0.000012086992,0.00009222993,0.00008509492],"genre_scores_gemma":[0.053771064,0.00011547721,0.94548273,0.000052926633,0.00036204586,0.000019107312,0.00010757104,0.000054679917,0.000034399578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986946,0.000010502144,0.00033004585,0.00042654265,0.00023559603,0.0003027238],"domain_scores_gemma":[0.99925894,0.00017258932,0.000104888175,0.00024244524,0.00014126475,0.00007985686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003465851,0.00027091862,0.0002473333,0.00024336527,0.00014983834,0.00018625596,0.00015062105,0.00019663744,0.0000051634097],"category_scores_gemma":[0.00009329184,0.00026619987,0.000049009814,0.00011943388,0.00019250622,0.0002452573,0.00004132723,0.0001908598,8.86971e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010647694,0.000009516468,0.000009090526,0.00011919062,0.0000049924142,4.7149834e-7,0.00014063374,0.98057467,0.0002824208,0.000859228,0.0000036042907,0.017985508],"study_design_scores_gemma":[0.0006183464,0.000037929203,0.000051754116,0.0001802167,0.000023098537,0.000006196831,1.509327e-7,0.99662256,0.00007648056,0.0020025615,0.000091472706,0.0002892154],"about_ca_topic_score_codex":0.0000064357932,"about_ca_topic_score_gemma":0.000044781413,"teacher_disagreement_score":0.05369479,"about_ca_system_score_codex":0.00022108281,"about_ca_system_score_gemma":0.000041681178,"threshold_uncertainty_score":0.999979},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017655346,0.00036493508,0.96613216,0.002316505,0.0018001493,0.00044968698,0.000015977876,0.00026107312,0.028641839],"genre_scores_gemma":[0.09255368,0.000050742266,0.9031722,0.0035021997,0.00039188415,0.000015063217,0.000015182283,0.000043624794,0.00025540576],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953937,0.000031879183,0.0006128065,0.0018512738,0.0012192877,0.00089104724],"domain_scores_gemma":[0.99703616,0.0002722031,0.00030511452,0.0019225043,0.0002290065,0.00023500224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065112964,0.0006699823,0.000584827,0.00075514003,0.00045863804,0.0008992411,0.004265464,0.0004500098,0.00003663302],"category_scores_gemma":[0.00004248299,0.000581368,0.00019466892,0.0008597353,0.0007406576,0.00091475237,0.0015770148,0.000964476,0.00018022084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021222058,0.00005056486,0.000007862291,0.00003225622,0.000013783467,0.00007892174,0.0006685587,0.13911818,0.000009763688,0.3302217,0.000051376053,0.5297449],"study_design_scores_gemma":[0.00028857688,0.00010456027,0.00019518941,0.00021218634,0.0000071932677,0.00008940156,1.6754788e-7,0.20954642,0.00006554536,0.78817457,0.0006248042,0.000691369],"about_ca_topic_score_codex":0.00005073539,"about_ca_topic_score_gemma":0.00007282033,"teacher_disagreement_score":0.52905357,"about_ca_system_score_codex":0.0005731093,"about_ca_system_score_gemma":0.0010647628,"threshold_uncertainty_score":0.9996638},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013290852,0.00024109584,0.9918734,0.0028550471,0.0019531967,0.0010768239,0.000014070347,0.00020010646,0.0016533681],"genre_scores_gemma":[0.084096976,0.00013465172,0.8979532,0.012403362,0.0015364193,0.00003816542,0.0000150120895,0.00009568694,0.0037265406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947092,0.000046737543,0.0007758232,0.0013270456,0.002108138,0.001033039],"domain_scores_gemma":[0.9966025,0.0006054603,0.00032040215,0.0015825679,0.0005475982,0.0003415233],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016378423,0.000594608,0.0005145948,0.0007096682,0.0006923314,0.0012737181,0.005241132,0.00028980937,0.000037809998],"category_scores_gemma":[0.00037298005,0.0004271783,0.0001808075,0.0013318204,0.0007208651,0.0012260899,0.001971328,0.0013820009,0.00031699424],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001559827,0.000017194396,0.000004572558,0.000019556986,0.0000061115516,0.00006841036,0.0015022854,0.008132284,0.000107401276,0.027675923,0.000036975034,0.96241367],"study_design_scores_gemma":[0.0020083997,0.0018011879,0.0008704546,0.0021893356,0.000036207464,0.0006269471,0.0000046765076,0.6867006,0.0154431835,0.23101439,0.055624295,0.0036803484],"about_ca_topic_score_codex":0.000030023244,"about_ca_topic_score_gemma":0.000025903842,"teacher_disagreement_score":0.9587333,"about_ca_system_score_codex":0.00080810924,"about_ca_system_score_gemma":0.0013299113,"threshold_uncertainty_score":0.999818},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014258685,0.00090618595,0.9964144,0.00060544733,0.0004557668,0.0007560776,0.000058550024,0.00009389147,0.00056704495],"genre_scores_gemma":[0.4158211,0.000011271381,0.5825198,0.0011550739,0.0003381764,0.000015574376,0.000027875802,0.000022739838,0.000088355126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966822,0.0000326752,0.000627481,0.0011587065,0.0008734974,0.00062541076],"domain_scores_gemma":[0.9936434,0.0039386842,0.00045385424,0.0016967738,0.00018652956,0.000080776714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016516449,0.00047367893,0.00073144713,0.000501148,0.00029742738,0.00045489208,0.0049718437,0.00022826574,0.0000030284098],"category_scores_gemma":[0.00015391012,0.0003139802,0.0002341292,0.00042182434,0.0017936995,0.00048285385,0.0010638129,0.00044717712,0.0000021056028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004643737,0.00009186695,0.00124463,0.0004000648,0.000084796,0.000019780196,0.0012897403,0.02478672,0.00025510302,0.05937383,0.00011482114,0.9122922],"study_design_scores_gemma":[0.0008814876,0.00033515375,0.0017120406,0.00044744796,0.000070467526,0.000021685404,0.0000074856184,0.94565034,0.008201636,0.039288647,0.0023989044,0.0009847349],"about_ca_topic_score_codex":0.00011774486,"about_ca_topic_score_gemma":0.00010819008,"teacher_disagreement_score":0.92086357,"about_ca_system_score_codex":0.00008614485,"about_ca_system_score_gemma":0.00044605762,"threshold_uncertainty_score":0.9999312},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004347678,0.00029019854,0.99035305,0.0022484495,0.0021205312,0.00076277263,0.000009666888,0.0001600347,0.0036205337],"genre_scores_gemma":[0.20464897,0.000038844693,0.7809786,0.009882064,0.0019186141,0.00006943592,0.000041515366,0.000060225335,0.002361724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955219,0.000050617225,0.00061337743,0.0018146622,0.0012750706,0.00072435243],"domain_scores_gemma":[0.99712336,0.00053275714,0.00024924165,0.0011922437,0.00053239556,0.00037000896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069133233,0.00057615014,0.00053175515,0.0012578882,0.00032074613,0.0008536499,0.0029277245,0.00022961649,0.00012634324],"category_scores_gemma":[0.00013624017,0.00054892077,0.00014863994,0.0011235944,0.00021316952,0.0008612912,0.001505186,0.00059076963,0.0005269416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004889067,0.000032591655,0.000009195408,0.000018242627,0.000013604103,0.00003590743,0.00084521883,0.2508575,0.00017214948,0.045668907,0.00063858734,0.7017032],"study_design_scores_gemma":[0.00030493265,0.00034984213,0.00018791418,0.00017906356,0.000005440039,0.00006328672,2.3188363e-7,0.6436988,0.0020490894,0.33026993,0.022027165,0.00086426147],"about_ca_topic_score_codex":0.000092234324,"about_ca_topic_score_gemma":0.000120747594,"teacher_disagreement_score":0.7008389,"about_ca_system_score_codex":0.00037748285,"about_ca_system_score_gemma":0.0006172944,"threshold_uncertainty_score":0.99969625},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.477145e-7,0.00008035069,0.9921285,0.0026182574,0.0013629419,0.0012511987,0.000008709549,0.00023855211,0.002310669],"genre_scores_gemma":[0.0033487114,0.0000048347347,0.99369526,0.0018696826,0.00025291974,0.000032742915,0.000013421224,0.000028926186,0.0007534958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967726,0.00003686749,0.00057862955,0.0013872813,0.00065045845,0.0005741471],"domain_scores_gemma":[0.9974646,0.0006196646,0.00036588998,0.0009149602,0.00035320994,0.0002816977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000801877,0.00049390027,0.00049445406,0.00074614875,0.0002186722,0.00073700503,0.0016477951,0.00032624564,0.00021274094],"category_scores_gemma":[0.00009576955,0.00045657172,0.00018972394,0.00044293771,0.0003587504,0.00052942504,0.00031310113,0.0004835682,0.000044408822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002701245,0.000009399059,0.000018267943,0.00003197975,0.0000072805547,0.0000048850984,0.00016491987,0.10277004,0.000058599348,0.031416215,0.00016086815,0.86535484],"study_design_scores_gemma":[0.00051829807,0.00014763632,0.000028164139,0.00021376686,0.000007453806,0.000037831192,1.0481848e-7,0.88696474,0.00044088517,0.10603688,0.0050858385,0.00051839335],"about_ca_topic_score_codex":0.00008152497,"about_ca_topic_score_gemma":0.00014650558,"teacher_disagreement_score":0.86483645,"about_ca_system_score_codex":0.00025260285,"about_ca_system_score_gemma":0.0019076646,"threshold_uncertainty_score":0.9997886},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011547051,0.00023245328,0.9980452,0.000057303532,0.0003097854,0.00070018234,0.00001564927,0.0002676289,0.0002562914],"genre_scores_gemma":[0.03620191,0.0004422834,0.9624489,0.00030114548,0.0002961112,0.000021635089,0.000068146284,0.000051938805,0.00016793725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997506,0.000025500509,0.0005724848,0.000991393,0.0005734156,0.0003311561],"domain_scores_gemma":[0.9977673,0.00050867285,0.00043044903,0.00071469403,0.00048453233,0.00009429671],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008794367,0.0003794141,0.0005503594,0.0010033057,0.0002167076,0.00044261562,0.0010513035,0.00027265813,0.000002721898],"category_scores_gemma":[0.000083536936,0.000376161,0.00013796176,0.00053109694,0.00033870307,0.0006481667,0.0005150835,0.00015703117,7.9875343e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009172249,0.000024724097,0.00007179885,0.00010535501,0.000012291676,0.0000026879025,0.0005382216,0.0008290236,0.0003749727,0.38493848,0.00004096602,0.6130523],"study_design_scores_gemma":[0.00018538482,0.000372995,0.00039809023,0.00034802605,0.000013189949,0.0000103692355,8.982717e-8,0.6377094,0.004196819,0.35595605,0.0003537257,0.000455881],"about_ca_topic_score_codex":0.00001729007,"about_ca_topic_score_gemma":0.0000053345816,"teacher_disagreement_score":0.63688034,"about_ca_system_score_codex":0.00009514485,"about_ca_system_score_gemma":0.0002251437,"threshold_uncertainty_score":0.99986905},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014976917,0.00058859994,0.9966942,0.00009350747,0.0009586884,0.00036978914,0.000006026653,0.0009868339,0.00015259151],"genre_scores_gemma":[0.028804123,0.000031863652,0.97037935,0.00012510983,0.00030785686,0.00003152319,0.0000037942095,0.000047720143,0.0002686759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970495,0.000018165949,0.00036605785,0.001242874,0.0006952122,0.000628168],"domain_scores_gemma":[0.99790424,0.00022060049,0.00013914477,0.0013990789,0.00014179309,0.00019515115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005838766,0.00050892273,0.00051314564,0.00082157104,0.00010448243,0.00064753834,0.0028189446,0.00047966797,7.6842093e-7],"category_scores_gemma":[0.00003399556,0.00049310306,0.00006590362,0.0005122202,0.00023625171,0.0005623241,0.0015071498,0.0012733104,0.0000046241444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.1839345e-7,0.000009734187,0.00002375491,0.000117406365,0.0000064041296,0.000052113828,0.0005039329,0.8495637,0.0007872957,0.027442778,0.00006949077,0.12142285],"study_design_scores_gemma":[0.00008007743,0.00003863195,0.00002227638,0.00036539824,0.000004147814,0.000087683635,1.8739566e-8,0.99300796,0.00041051314,0.0035848152,0.0018697567,0.00052872516],"about_ca_topic_score_codex":0.000017439479,"about_ca_topic_score_gemma":0.000012763322,"teacher_disagreement_score":0.14344424,"about_ca_system_score_codex":0.00026441325,"about_ca_system_score_gemma":0.00048664786,"threshold_uncertainty_score":0.99975204},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021010459,0.000336455,0.93136054,0.00087948225,0.00091689295,0.00029931284,9.706004e-7,0.00031751744,0.06586783],"genre_scores_gemma":[0.027130378,0.000059717946,0.9652025,0.0054108584,0.00065330445,0.000005864921,0.0000028317825,0.00006136664,0.0014731921],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667776,0.000038739257,0.0008721445,0.0008456706,0.0009174951,0.0006482012],"domain_scores_gemma":[0.9967715,0.0006937609,0.00057626877,0.0016291741,0.0001655059,0.00016375411],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011453349,0.00051006104,0.00051068113,0.0005422549,0.0005311883,0.0014635024,0.004605596,0.00026279202,0.00015334357],"category_scores_gemma":[0.00015072172,0.00035242699,0.00015551095,0.00054572365,0.00075871823,0.0019215365,0.0022000892,0.0008612941,0.00025719896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002085469,0.0000311054,0.000005339565,0.00019581616,0.000012947695,0.000026152376,0.009849163,0.00184962,0.000006198788,0.42445156,0.0002548501,0.56331515],"study_design_scores_gemma":[0.00007603111,0.000029392315,0.0000070016417,0.00048335662,0.000005251708,0.00010830918,4.6907954e-7,0.45450175,0.0004172148,0.5416515,0.0023762141,0.00034348774],"about_ca_topic_score_codex":0.0000024754324,"about_ca_topic_score_gemma":0.0000013301243,"teacher_disagreement_score":0.56297165,"about_ca_system_score_codex":0.00007583072,"about_ca_system_score_gemma":0.00051151076,"threshold_uncertainty_score":0.9998928},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004882506,0.00045434703,0.9912188,0.00019436268,0.0021858108,0.00051708537,0.000004991449,0.00030256878,0.00023954906],"genre_scores_gemma":[0.8551548,0.00007696801,0.14420404,0.00011185528,0.00031740547,0.0000444435,0.0000024056467,0.00003506911,0.00005298964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956442,0.00004037357,0.0005186254,0.0017301367,0.0013225762,0.0007441019],"domain_scores_gemma":[0.9971058,0.00055417966,0.00031709307,0.0015281552,0.00029521054,0.00019955983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034784715,0.0006679383,0.00067798403,0.00068840414,0.00044067996,0.00031161742,0.0025716296,0.00036021834,0.000010420883],"category_scores_gemma":[0.000034611712,0.0005050865,0.00017245515,0.0006341195,0.00083685044,0.0006286328,0.000515754,0.000906125,0.000028643175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047146787,0.00013147155,0.007836801,0.00015466873,0.000040414336,0.00030688534,0.0016476568,0.16396388,0.000023027973,0.00016003539,0.000012553785,0.8256754],"study_design_scores_gemma":[0.0008905846,0.0009690285,0.007854083,0.0023237006,0.000024396826,0.00014800488,4.270412e-7,0.9800868,0.002911181,0.0030995396,0.00017809308,0.0015141546],"about_ca_topic_score_codex":0.000038884373,"about_ca_topic_score_gemma":0.000053506676,"teacher_disagreement_score":0.8502723,"about_ca_system_score_codex":0.00056419877,"about_ca_system_score_gemma":0.00077666395,"threshold_uncertainty_score":0.99974006},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002502114,0.00031332817,0.99511886,0.0012522745,0.0009844701,0.0011553543,0.000021867703,0.00026807518,0.0006355724],"genre_scores_gemma":[0.83120185,0.00003544701,0.1673756,0.0007123613,0.00033933355,0.00021036596,0.000064123895,0.000037452784,0.000023487333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643767,0.000050398274,0.0007452052,0.0015793258,0.00052283495,0.0006645861],"domain_scores_gemma":[0.9966203,0.0015607675,0.00044848936,0.0009679427,0.00020847563,0.00019400522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012144598,0.00049248105,0.00054549397,0.000828994,0.00028410464,0.0004963434,0.002117584,0.0002538274,0.000005652193],"category_scores_gemma":[0.00027481315,0.00048728817,0.000108586784,0.00051844347,0.00018022928,0.0006428153,0.00043685077,0.00050742144,0.000020575439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019958856,0.00005227105,0.00057410356,0.00036841992,0.000011263816,0.000052309297,0.0018131563,0.13560317,0.000052715735,0.02611852,0.00004986133,0.83528423],"study_design_scores_gemma":[0.0007174893,0.00018157084,0.00017444474,0.0017653998,0.000009073557,0.000039710023,0.0000010153009,0.96322054,0.0009914414,0.03174833,0.0004263746,0.0007246375],"about_ca_topic_score_codex":0.0004116145,"about_ca_topic_score_gemma":0.00017467508,"teacher_disagreement_score":0.8345596,"about_ca_system_score_codex":0.0010388802,"about_ca_system_score_gemma":0.00092640053,"threshold_uncertainty_score":0.9997579},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08176666,0.00046200652,0.9147239,0.000034146844,0.0017785658,0.0005900581,0.0000059909967,0.00004729382,0.0005914033],"genre_scores_gemma":[0.99631363,0.00002259181,0.0034180398,0.000037552498,0.00011796547,0.000013329757,0.00000483881,0.000020159394,0.00005188639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988998,0.000017026116,0.0003251889,0.00030519176,0.0002766824,0.00017608913],"domain_scores_gemma":[0.99903154,0.00041511265,0.00009058357,0.00037085733,0.0000620361,0.00002989077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003229466,0.00018329988,0.0002240906,0.00031602773,0.000108356755,0.00010772794,0.00030482694,0.00017799935,0.000014144747],"category_scores_gemma":[0.000053697022,0.00014565181,0.00004925299,0.00010823743,0.00015153526,0.00012512782,0.000053241336,0.0004852819,0.000010308481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020609268,0.000012191397,0.000017677768,0.00010251466,0.0000039382517,0.0000031121083,0.00045647862,0.8643131,0.12345482,0.0009948238,0.0000019916667,0.01063729],"study_design_scores_gemma":[0.00018302326,0.00006090345,0.000237763,0.0011949108,0.000005540292,0.0000044098615,2.1491913e-7,0.98712754,0.008321639,0.002579498,0.00010578898,0.00017875528],"about_ca_topic_score_codex":0.000035223486,"about_ca_topic_score_gemma":0.00008125665,"teacher_disagreement_score":0.91454697,"about_ca_system_score_codex":0.000114849056,"about_ca_system_score_gemma":0.000026583904,"threshold_uncertainty_score":0.59395087},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035712506,0.0001820663,0.99415094,0.00084047747,0.00097376603,0.00049340166,0.00000251046,0.000101762125,0.003219361],"genre_scores_gemma":[0.16531643,0.000045846835,0.82784694,0.0058033997,0.00050161453,0.000013201723,0.0000026051118,0.000060814622,0.00040914494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631995,0.000077827084,0.00053428963,0.0011034964,0.0014139427,0.00055048947],"domain_scores_gemma":[0.9945517,0.003040993,0.00038489458,0.0016325526,0.00028141474,0.00010843301],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024877645,0.000460187,0.0004206293,0.0008553588,0.00019958666,0.0002521091,0.0040755984,0.00024087133,0.000048142007],"category_scores_gemma":[0.00026854585,0.00032336143,0.00013993203,0.00079224695,0.0009861897,0.00036733682,0.00075686054,0.00083098636,0.00007307358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002779088,0.00005520225,0.000004478009,0.00003285156,0.000014768067,0.000083725245,0.00065484137,0.17551212,0.001972982,0.279587,0.00012962453,0.5419246],"study_design_scores_gemma":[0.00019960084,0.00044225043,0.00003732309,0.00046530282,0.000006892012,0.000037111306,1.1249271e-7,0.5557513,0.018545508,0.42369065,0.00033103226,0.0004929188],"about_ca_topic_score_codex":0.000018544912,"about_ca_topic_score_gemma":0.000012070568,"teacher_disagreement_score":0.5414317,"about_ca_system_score_codex":0.00025822295,"about_ca_system_score_gemma":0.00048755656,"threshold_uncertainty_score":0.99992186},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009174928,0.00009324507,0.9883263,0.00015693514,0.0006850708,0.00028535526,0.000007245628,0.00003449934,0.0012364066],"genre_scores_gemma":[0.83027977,0.000005261655,0.16886768,0.00054938026,0.00012748147,0.000002428201,0.000007554207,0.000016525424,0.00014391387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972868,0.000025036741,0.00057261775,0.00082631607,0.0009592094,0.00033003054],"domain_scores_gemma":[0.99778336,0.0005698555,0.0005335024,0.00065756135,0.00036256685,0.00009312995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007221186,0.00034137449,0.00047535455,0.0011908134,0.000079131634,0.00007503575,0.001184324,0.0001599277,0.000014951156],"category_scores_gemma":[0.00006510241,0.00028662506,0.00009229894,0.0008034125,0.0004011507,0.00021446597,0.00038674998,0.0003776909,0.000004117827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014883166,0.0001384288,0.000076812554,0.0001866639,0.000060266782,0.00006950069,0.0034987296,0.35896814,0.0032998258,0.017741986,0.000017771796,0.61579305],"study_design_scores_gemma":[0.0008062934,0.0021600027,0.00007619062,0.001634321,0.000017335731,0.00010259727,0.0000014495945,0.91334766,0.0419076,0.03924874,0.00012149815,0.0005763384],"about_ca_topic_score_codex":0.000011876578,"about_ca_topic_score_gemma":0.000036736,"teacher_disagreement_score":0.8211048,"about_ca_system_score_codex":0.00012133426,"about_ca_system_score_gemma":0.00035256983,"threshold_uncertainty_score":0.9999586},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015776156,0.00036183442,0.9829715,0.000012112268,0.00011898551,0.00038390746,0.000004288763,0.00012447595,0.00024675395],"genre_scores_gemma":[0.8874325,0.000005368049,0.11247145,0.000019367839,0.00003109964,0.0000065600952,7.2313156e-7,0.000028225948,0.0000046977157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979459,0.000024502648,0.00066326134,0.0005198815,0.00050296984,0.0003434689],"domain_scores_gemma":[0.99863243,0.00026665904,0.00017357554,0.00076598255,0.00009213111,0.00006920676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000553853,0.00032915425,0.00071594806,0.00070491375,0.000024296132,0.000015404588,0.00070106774,0.00015386395,0.000024461602],"category_scores_gemma":[0.00008587684,0.00030831917,0.00009892098,0.0005923882,0.00029892786,0.0001750861,0.00021273429,0.00054266205,0.0000014997228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014011781,0.00021443401,0.0041955155,0.00024245489,0.00002584707,0.000016144055,0.0008461686,0.7020473,0.00391458,0.00010412505,4.8562123e-7,0.28837895],"study_design_scores_gemma":[0.0007322133,0.00048728375,0.008468643,0.00083886884,0.00005639782,0.00000558742,0.0000030351061,0.93646455,0.02272268,0.029226713,0.00002327585,0.0009707776],"about_ca_topic_score_codex":0.000036139074,"about_ca_topic_score_gemma":0.00025729588,"teacher_disagreement_score":0.87165636,"about_ca_system_score_codex":0.00030034513,"about_ca_system_score_gemma":0.000056292596,"threshold_uncertainty_score":0.9999369},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010670343,0.00012702747,0.9650831,0.026209861,0.0033754054,0.0016867502,0.000027422038,0.0002174381,0.0032622784],"genre_scores_gemma":[0.25868422,0.0000341269,0.72804844,0.008825908,0.0010042695,0.0010908674,0.0001033999,0.00014940162,0.0020593565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957621,0.00014253198,0.00061942224,0.0017268172,0.00096100115,0.00078814465],"domain_scores_gemma":[0.9943543,0.0021529454,0.00034518386,0.0024569496,0.0004888163,0.00020181865],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0031704914,0.000528757,0.0004304494,0.0011449222,0.00091624603,0.0023824368,0.005152978,0.0002278536,0.00012237605],"category_scores_gemma":[0.0002678711,0.00036215415,0.00025949566,0.000758419,0.00088775286,0.0003755462,0.00070198043,0.0010377328,0.00005421872],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063559382,0.000079164434,0.000010260103,0.000067444176,0.000007312751,0.0000030860238,0.00018685199,0.0012764581,0.000058837973,0.082928754,0.007684589,0.9076909],"study_design_scores_gemma":[0.00024878036,0.0003023457,0.000017002894,0.0009245976,0.0000044869503,0.0000027866192,3.7082185e-7,0.73255813,0.0014461519,0.063402355,0.20060062,0.0004923384],"about_ca_topic_score_codex":0.00002630539,"about_ca_topic_score_gemma":0.00010896705,"teacher_disagreement_score":0.90719855,"about_ca_system_score_codex":0.0004744827,"about_ca_system_score_gemma":0.00096921326,"threshold_uncertainty_score":0.99988306},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044018492,0.0004731469,0.9806703,0.000024595038,0.0018211239,0.00049630937,0.0000031964357,0.000115407645,0.016351946],"genre_scores_gemma":[0.09256293,0.00001590466,0.8979386,0.000058174144,0.0009800242,0.000026113028,0.0000030284723,0.00006305995,0.0083521325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631304,0.00007005173,0.00081147224,0.001515797,0.00053865445,0.0007509598],"domain_scores_gemma":[0.9963117,0.00096862286,0.00064256205,0.0013579774,0.000594108,0.00012498081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025851768,0.00046982395,0.00073998113,0.00068825786,0.0002878364,0.00030890564,0.002823922,0.000279141,0.000014873993],"category_scores_gemma":[0.00019236506,0.00043772737,0.00025011582,0.00047570033,0.00020606339,0.0004718731,0.0012036081,0.0006204386,0.0000148257095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009440978,0.000040079132,0.00010134516,0.0003231081,0.00003723065,0.00002316254,0.0030971288,0.024961838,0.0017886055,0.7383931,0.000010646297,0.23121428],"study_design_scores_gemma":[0.00029040597,0.0003560603,0.000027977287,0.0013744507,0.000019228286,0.00005504217,0.0000024875278,0.5354754,0.017425079,0.42814612,0.01592077,0.000907028],"about_ca_topic_score_codex":0.00014423326,"about_ca_topic_score_gemma":0.00003087408,"teacher_disagreement_score":0.51051354,"about_ca_system_score_codex":0.00020070198,"about_ca_system_score_gemma":0.0005175156,"threshold_uncertainty_score":0.9998075},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004370396,0.00023476886,0.9782386,0.0011515187,0.0019091038,0.0004615636,0.000004891413,0.0004675033,0.017488388],"genre_scores_gemma":[0.29871634,0.00012931065,0.69501567,0.004099609,0.0013322862,0.00003809069,0.000011296645,0.000037639216,0.0006197745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970904,0.000024858902,0.0007352612,0.000752481,0.00087541493,0.000521569],"domain_scores_gemma":[0.99783546,0.00018180016,0.00043844065,0.0011319747,0.00027055762,0.00014176367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010023204,0.0004175381,0.0004332891,0.00084465335,0.00021232759,0.0008689993,0.0026475226,0.0003022754,0.000013944486],"category_scores_gemma":[0.00005427116,0.00036444556,0.00012140716,0.00034479954,0.00020713237,0.0022315045,0.001119464,0.00066399976,0.000058867266],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014035402,0.00000975952,0.00017796294,0.00003060437,0.000007682067,0.000010419329,0.0005898282,0.0011104404,0.000034064982,0.026596703,0.00010675984,0.9713244],"study_design_scores_gemma":[0.00037674827,0.00023120307,0.00021101689,0.00080435455,0.0000065705203,0.0001772318,4.3911868e-7,0.89962405,0.00141288,0.039127763,0.05711024,0.0009175269],"about_ca_topic_score_codex":0.00004876784,"about_ca_topic_score_gemma":0.00008506391,"teacher_disagreement_score":0.97040683,"about_ca_system_score_codex":0.00036301138,"about_ca_system_score_gemma":0.0003962193,"threshold_uncertainty_score":0.99988073},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007381708,0.0006127195,0.9958699,0.0001906053,0.0016489677,0.00071177864,0.000053159692,0.00025066014,0.00058841193],"genre_scores_gemma":[0.0236467,0.00014466672,0.9737024,0.0019062826,0.00043322577,0.000033246484,0.00007567431,0.000042537395,0.000015271624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623054,0.000035082718,0.00056561513,0.0016773229,0.0007879218,0.00070349796],"domain_scores_gemma":[0.9972831,0.00033177718,0.00031934952,0.0014944717,0.0003686288,0.00020269913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054624415,0.00055890705,0.0005170281,0.0012264643,0.00046719774,0.0005446553,0.002828696,0.00040004888,0.000014540564],"category_scores_gemma":[0.00009636604,0.0005421709,0.00032645816,0.0011619135,0.00080665,0.0011604745,0.0008967268,0.00047898703,0.000013399418],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043856373,0.00048135084,0.00030121717,0.00021537254,0.00006137653,0.000121667814,0.0039032258,0.0050067734,0.00033354055,0.26935187,0.00078883924,0.7193909],"study_design_scores_gemma":[0.0018465001,0.0007750822,0.0004111686,0.0005256365,0.00003117995,0.00015911621,3.8629173e-7,0.5780678,0.0044849454,0.36368707,0.047754396,0.0022567133],"about_ca_topic_score_codex":0.000019457308,"about_ca_topic_score_gemma":0.00017538414,"teacher_disagreement_score":0.7171342,"about_ca_system_score_codex":0.00011414111,"about_ca_system_score_gemma":0.00032777071,"threshold_uncertainty_score":0.999703},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030786658,0.00018052342,0.96334976,0.0009413766,0.001513719,0.000569343,0.000015870293,0.00037837954,0.0022643753],"genre_scores_gemma":[0.8304774,0.000011986227,0.16514646,0.0027677459,0.0006330774,0.000024239484,0.00003443154,0.00006459664,0.00084005675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932441,0.00015418747,0.00086835417,0.002968684,0.0017553779,0.0010093087],"domain_scores_gemma":[0.9953241,0.00035643773,0.00043442534,0.003077878,0.00032177637,0.00048543172],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015135126,0.0007918285,0.000888025,0.0011194603,0.00046807397,0.0019249975,0.0069496473,0.0004025204,0.000056903074],"category_scores_gemma":[0.00016885069,0.0006892663,0.00017561454,0.0012034761,0.0004500079,0.0016469766,0.0025947967,0.0013178854,0.0002544732],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052805103,0.00047854887,0.0019494131,0.000018328541,0.00006425338,0.00015093933,0.0032611722,0.0007583495,0.0014693945,0.0009955614,0.0011563038,0.98969245],"study_design_scores_gemma":[0.001080449,0.0020091662,0.0016962924,0.000334003,0.000080808546,0.00007383783,0.000010120265,0.96716934,0.00082056975,0.018902376,0.0051693255,0.002653683],"about_ca_topic_score_codex":0.0001602215,"about_ca_topic_score_gemma":0.0001586058,"teacher_disagreement_score":0.9870388,"about_ca_system_score_codex":0.00026459325,"about_ca_system_score_gemma":0.0006600987,"threshold_uncertainty_score":0.9995558},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008484485,0.000121935416,0.9954938,0.00009737736,0.000679671,0.0018706651,0.000020330663,0.0007777869,0.00008998278],"genre_scores_gemma":[0.33830628,0.0000041537974,0.66111827,0.00010407444,0.00030510646,0.00009713419,0.0000060424272,0.00004057987,0.000018340503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641114,0.000039791194,0.00074143236,0.0012451546,0.00078266225,0.0007798431],"domain_scores_gemma":[0.9973124,0.00024921037,0.0002366284,0.0016137236,0.0003092754,0.00027873297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014287613,0.0006307632,0.00057301443,0.00091022515,0.0004396386,0.00077873457,0.0026992555,0.0004302233,0.0000019113213],"category_scores_gemma":[0.00001710434,0.00061788864,0.00015530911,0.0004371924,0.0001868929,0.004315933,0.0005416014,0.0009493392,0.0000018010724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023696239,0.00006878486,0.000004174618,0.000013834667,0.000007772707,0.000054437005,0.0051688724,0.5196033,0.0000091479815,0.031372886,0.0000056317053,0.44368875],"study_design_scores_gemma":[0.00036752093,0.0003117627,4.103472e-7,0.00010561876,0.000019902225,0.00036847984,0.0000012078752,0.9423376,0.00012677995,0.05549018,0.00022945112,0.00064108416],"about_ca_topic_score_codex":0.000098097065,"about_ca_topic_score_gemma":0.0002614976,"teacher_disagreement_score":0.44304767,"about_ca_system_score_codex":0.00032270036,"about_ca_system_score_gemma":0.0005445728,"threshold_uncertainty_score":0.99962723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074469848,0.000038156526,0.9890657,0.0005668894,0.00071218424,0.0018566386,0.000008297704,0.00013021426,0.00017490803],"genre_scores_gemma":[0.5173873,0.000018428538,0.4791645,0.0030539364,0.00015589687,0.00012525698,0.0000094236775,0.000030200585,0.00005509511],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958727,0.0002439083,0.0007581383,0.0015596552,0.0010398711,0.0005257718],"domain_scores_gemma":[0.9970168,0.001302766,0.00027003008,0.0008775369,0.00022336862,0.0003095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00161118,0.00052420935,0.00047543837,0.0011732416,0.00035169494,0.0009158602,0.0008936353,0.00015551291,0.000018608804],"category_scores_gemma":[0.00027015238,0.00047361787,0.000049452563,0.0008610892,0.0004181733,0.0011743585,0.00036821252,0.000828519,0.0000069482644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043038424,0.0007357648,0.0019746898,0.00007095227,0.000020773565,0.0025934968,0.07097694,0.40052223,0.0009339313,0.0030080788,0.00008079427,0.51903933],"study_design_scores_gemma":[0.0023623027,0.0046466137,0.005960426,0.0021748433,0.00005372552,0.0021420354,0.0002498774,0.9539658,0.012735721,0.012137692,0.00006296122,0.0035080463],"about_ca_topic_score_codex":0.00025183198,"about_ca_topic_score_gemma":0.00089405285,"teacher_disagreement_score":0.55344355,"about_ca_system_score_codex":0.00043082092,"about_ca_system_score_gemma":0.00034666673,"threshold_uncertainty_score":0.99977154},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027364292,0.0005605217,0.99282277,0.00011275691,0.0025428252,0.0005799181,0.000001437562,0.0004974791,0.0001458872],"genre_scores_gemma":[0.3833529,0.0000056931126,0.6162331,0.000066994064,0.0002441075,0.000014004277,2.0560739e-7,0.000027137517,0.00005584586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956489,0.00011940048,0.0006382566,0.0018345551,0.00088028755,0.0008785735],"domain_scores_gemma":[0.99491024,0.0026880724,0.00021567075,0.0019082488,0.00012111328,0.0001566312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012487365,0.00065774034,0.0007055661,0.0014023947,0.00020594831,0.00030689035,0.0028693196,0.00035441332,0.0000089241785],"category_scores_gemma":[0.0009914179,0.0006231488,0.00010974614,0.0012337643,0.00038608606,0.00059182994,0.0017847015,0.0021417064,0.000014900308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032076114,0.000044962922,0.00053452904,0.000026632215,0.000008856443,0.0073417714,0.0044366946,0.62589234,0.000007624776,0.003950158,5.850179e-7,0.35775265],"study_design_scores_gemma":[0.0006492844,0.0007165671,0.0014928936,0.0010737954,0.000012688768,0.007134928,0.0000064914134,0.3180874,0.00012014729,0.6685155,0.00010285958,0.0020874622],"about_ca_topic_score_codex":0.00009325038,"about_ca_topic_score_gemma":0.00014488805,"teacher_disagreement_score":0.6645653,"about_ca_system_score_codex":0.00092001626,"about_ca_system_score_gemma":0.00018923987,"threshold_uncertainty_score":0.999622},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000137321795,0.0001670206,0.99548537,0.00013242781,0.0025510394,0.0005946339,0.0000049722444,0.0008757676,0.00017506217],"genre_scores_gemma":[0.0024359876,0.000018707218,0.9963889,0.00034576136,0.0003956616,0.00007118846,0.000017897944,0.000037313297,0.00028857478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703735,0.000032020365,0.0005212634,0.0011694893,0.00064092316,0.00059897854],"domain_scores_gemma":[0.996685,0.0012467072,0.00033410394,0.001328736,0.0002786846,0.00012671314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017708618,0.00042658322,0.0004192733,0.00057869795,0.0001557928,0.0004924635,0.0030778842,0.00030398535,0.000009498527],"category_scores_gemma":[0.0009781591,0.00042649667,0.00012944792,0.00065139955,0.0001273575,0.0012008471,0.00077825645,0.0004990752,0.00001542517],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011628387,0.00005951153,0.00011411038,0.00032952195,0.000025341533,0.000013981522,0.0006518638,0.020990087,0.000085836284,0.014860845,0.00032756574,0.9625297],"study_design_scores_gemma":[0.0006167369,0.00062424154,0.00071097864,0.00083644234,0.00002684123,0.000046979425,7.6585074e-8,0.62056303,0.0040686796,0.2956398,0.07476712,0.0020990658],"about_ca_topic_score_codex":0.000023426683,"about_ca_topic_score_gemma":0.000009057528,"teacher_disagreement_score":0.9604306,"about_ca_system_score_codex":0.00046919918,"about_ca_system_score_gemma":0.0006833665,"threshold_uncertainty_score":0.9998187},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000094469244,0.0006467318,0.9932308,0.000099273355,0.001609909,0.0008275017,0.000031885913,0.00021896025,0.0032404582],"genre_scores_gemma":[0.9526627,0.000016987888,0.04423914,0.0006349273,0.0015243347,0.00004984501,0.000028458191,0.00006491181,0.0007786745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998445,0.000013705449,0.0003853107,0.00043604433,0.0003002243,0.00041976903],"domain_scores_gemma":[0.9991639,0.0001809359,0.000069303795,0.0003231024,0.00015591255,0.000106818865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038136807,0.00035837118,0.00041097408,0.00029706792,0.00012171904,0.00017993229,0.00036518625,0.00029221986,0.000083112594],"category_scores_gemma":[0.000017961805,0.00030764512,0.000091573005,0.00010677058,0.00014158261,0.00025376258,0.000039871757,0.0002839878,0.00014756162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038425784,0.000018826684,0.000022541231,0.00006551475,0.00006938285,0.000008443619,0.0010505125,0.6235665,0.0033021977,0.011766093,0.00018581226,0.35990575],"study_design_scores_gemma":[0.0004825375,0.00015419148,0.000027365237,0.00008648632,0.000017914488,0.000025306295,1.8693575e-7,0.99185956,0.00046027938,0.0048073353,0.0016356717,0.00044315797],"about_ca_topic_score_codex":0.0000061857745,"about_ca_topic_score_gemma":0.000030690444,"teacher_disagreement_score":0.95256823,"about_ca_system_score_codex":0.00021319515,"about_ca_system_score_gemma":0.000082027385,"threshold_uncertainty_score":0.9999376},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024719622,0.0007547989,0.99292237,0.0020838839,0.000992555,0.0004582785,0.00006422357,0.00012731468,0.00012461504],"genre_scores_gemma":[0.5945928,0.00003429158,0.40397295,0.0010533399,0.00022551071,0.000013137446,0.000085885775,0.000018322708,0.000003745102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964505,0.000067409645,0.00040450686,0.001502085,0.00080807315,0.0007674673],"domain_scores_gemma":[0.99782455,0.00045311952,0.0002137452,0.00096003735,0.00019900262,0.00034957018],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008913164,0.0004840298,0.00049558416,0.0012524525,0.00021598808,0.0015973842,0.0017217619,0.00036339022,0.0000098226365],"category_scores_gemma":[0.00010336265,0.0004869559,0.00008190979,0.0011717725,0.00035574683,0.0019564237,0.0009758844,0.00069943833,0.000018515371],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032464355,0.00013502344,0.002219638,0.00007502569,0.000019956498,0.00006725722,0.001379781,0.0123140365,0.0007914454,0.063383564,0.000087199056,0.9194946],"study_design_scores_gemma":[0.0012605418,0.00037401734,0.008705291,0.00056865363,0.000018766901,0.000021931048,0.0000010174138,0.75928366,0.0022386545,0.21167363,0.014094511,0.0017593026],"about_ca_topic_score_codex":0.00018323079,"about_ca_topic_score_gemma":0.00044692087,"teacher_disagreement_score":0.91773534,"about_ca_system_score_codex":0.00024301998,"about_ca_system_score_gemma":0.0003186471,"threshold_uncertainty_score":0.9997582},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006071562,0.000077478035,0.9909604,0.0010819755,0.0020089955,0.001598294,0.0000074763207,0.00014462048,0.0035135804],"genre_scores_gemma":[0.9283837,0.00003011529,0.05767236,0.0062491233,0.0024416242,0.00034150685,0.0004904055,0.000072491326,0.004318683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768966,0.00000464758,0.0005268867,0.00091520225,0.00046909356,0.0003945327],"domain_scores_gemma":[0.9983936,0.000053513813,0.00020572291,0.0006456446,0.00068280165,0.000018733479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007796086,0.0003719843,0.00031554315,0.00056471175,0.0002827469,0.00062389614,0.00074660615,0.00018485049,0.00027071033],"category_scores_gemma":[0.00018659553,0.00034991032,0.00010981558,0.00040435413,0.00029489625,0.0011562449,0.00029849427,0.00021895728,0.00033571944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049832797,0.0001084344,0.00003640152,0.0014143351,0.000027687802,0.0000010441078,0.0001860581,0.04019257,0.00024462008,0.048747174,0.0005150978,0.90847677],"study_design_scores_gemma":[0.0003137618,0.000028137052,0.00013651431,0.0001083227,0.000021541311,3.6317462e-7,9.700244e-7,0.8902564,0.00007548472,0.09098934,0.017612452,0.00045670653],"about_ca_topic_score_codex":0.00033902525,"about_ca_topic_score_gemma":0.0005386508,"teacher_disagreement_score":0.93328804,"about_ca_system_score_codex":0.00018604462,"about_ca_system_score_gemma":0.000102884806,"threshold_uncertainty_score":0.9998953},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073285247,0.00012387511,0.9902225,0.00050262833,0.0011521837,0.00029731958,9.953661e-7,0.000335801,0.00003617137],"genre_scores_gemma":[0.48619655,0.0000038352323,0.5120589,0.0016097497,0.00011030055,0.000013908243,5.6809154e-7,0.0000049574437,0.0000012156347],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99733883,0.00013352491,0.00028619193,0.0006536965,0.0007380678,0.00084968965],"domain_scores_gemma":[0.9982672,0.00041966268,0.00012322048,0.0007413625,0.00013489308,0.00031369136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012104309,0.00022125797,0.0002266399,0.00038949182,0.00019596731,0.00027257414,0.0020535288,0.00008721731,0.0000221027],"category_scores_gemma":[0.0003839112,0.00018976102,0.000055899036,0.0017398853,0.00051571353,0.0022238132,0.0006773308,0.00034591302,0.00004764782],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030088647,0.0001400042,0.0021653462,0.000007328257,0.0000039222114,0.000011218743,0.002997884,0.00059060735,0.011885638,0.00015407325,0.00003684154,0.9820041],"study_design_scores_gemma":[0.0005586302,0.0001191129,0.022401107,0.000061124265,0.0000036329138,0.000051132974,0.0000032915514,0.4124874,0.56190443,0.0019028885,0.000058586927,0.00044867073],"about_ca_topic_score_codex":0.00006997357,"about_ca_topic_score_gemma":0.000019768979,"teacher_disagreement_score":0.98155546,"about_ca_system_score_codex":0.00023305521,"about_ca_system_score_gemma":0.00020299415,"threshold_uncertainty_score":0.77382296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000024123174,0.0007735874,0.988008,0.001397371,0.001491606,0.00025370935,0.0000039318434,0.0002912478,0.007778108],"genre_scores_gemma":[0.059483144,0.00004255958,0.9306799,0.007885244,0.0004508324,0.000007301529,0.000005870749,0.000055097204,0.0013900078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959227,0.00002828217,0.00044885694,0.0016898427,0.0011377499,0.0007725597],"domain_scores_gemma":[0.9973637,0.00035753578,0.00023664277,0.0015835583,0.00020476487,0.00025382242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040843958,0.0005909486,0.000517179,0.0009112857,0.00029855073,0.000570527,0.0035567577,0.00025678883,0.000080489495],"category_scores_gemma":[0.00006363715,0.00052423426,0.00017117792,0.00066813885,0.000948549,0.00071268954,0.00087119674,0.0010550498,0.00012257107],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003908359,0.00006344777,0.0000019124375,0.000014111644,0.0000031087352,0.00012012815,0.00011478066,0.018921576,0.0000697909,0.0073774764,0.00013364345,0.9731761],"study_design_scores_gemma":[0.0008870515,0.0002685735,0.000009241905,0.0003351658,0.0000041842363,0.00006675406,6.204618e-8,0.9319814,0.002523265,0.050981406,0.012268018,0.00067486404],"about_ca_topic_score_codex":0.000005884797,"about_ca_topic_score_gemma":0.000008224629,"teacher_disagreement_score":0.9725013,"about_ca_system_score_codex":0.0002966637,"about_ca_system_score_gemma":0.00033321083,"threshold_uncertainty_score":0.99972093},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015172131,0.0002931196,0.9913975,0.00051314675,0.00244973,0.00045171077,0.0000063638695,0.00030878015,0.0044279187],"genre_scores_gemma":[0.2405471,0.00006250408,0.75604707,0.0014566336,0.0004661457,0.00001594777,0.000005102372,0.00008746909,0.001312025],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944595,0.0000567996,0.00057741976,0.0021823577,0.0015690752,0.0011548313],"domain_scores_gemma":[0.99459815,0.0016514835,0.00026178468,0.0026857413,0.00044001854,0.00036283914],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012644023,0.0006910628,0.00064271054,0.0016376599,0.0003880867,0.0006788118,0.007988295,0.00054240477,0.00006575079],"category_scores_gemma":[0.00042279213,0.0006286118,0.00024397645,0.001074205,0.0021898553,0.0007680095,0.0031424542,0.0027902722,0.0001697668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013449816,0.00003412575,0.000018440991,0.00002840413,0.000012722973,0.00052459,0.0004762476,0.010723404,0.0013402929,0.15293875,0.0000047210933,0.83388484],"study_design_scores_gemma":[0.00020160154,0.00021174681,0.0000089836585,0.00016631716,0.0000035344012,0.00016970489,7.407571e-8,0.20014001,0.0036318426,0.7918021,0.0029816977,0.0006823682],"about_ca_topic_score_codex":0.000010296316,"about_ca_topic_score_gemma":0.0001203324,"teacher_disagreement_score":0.8332025,"about_ca_system_score_codex":0.00021057356,"about_ca_system_score_gemma":0.00052590464,"threshold_uncertainty_score":0.9996165},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003507826,0.00002358834,0.99531263,0.00009386098,0.00035528105,0.00038477505,7.3831245e-7,0.00022437228,0.00009693941],"genre_scores_gemma":[0.42939785,0.0000047958924,0.5702817,0.00024605772,0.000039730898,0.00002291242,7.5393206e-7,0.0000052135815,9.937413e-7],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984176,0.00005231433,0.00020275643,0.0006688652,0.0002568963,0.00040158126],"domain_scores_gemma":[0.9989123,0.00028448598,0.00013655511,0.00034747843,0.00024999946,0.000069235415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042210222,0.0001683322,0.00016191161,0.00030666072,0.00021962605,0.00018576247,0.0010843592,0.00004874252,0.0000064179044],"category_scores_gemma":[0.000315575,0.00015047393,0.000050407045,0.001122966,0.00021964683,0.0026591287,0.000420232,0.0002733677,0.0000070226674],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022939192,0.00003759288,0.00013306647,0.000006212857,0.0000027872914,0.0000071250256,0.004093905,0.00051611156,0.013325497,0.00016426745,0.000001800095,0.9816887],"study_design_scores_gemma":[0.00021240007,0.00032449406,0.0011690309,0.00003238428,0.0000017776389,0.000012081575,0.000004097944,0.32121098,0.65031356,0.02650688,0.000031014497,0.0001812762],"about_ca_topic_score_codex":0.00002779596,"about_ca_topic_score_gemma":0.000005898689,"teacher_disagreement_score":0.9815074,"about_ca_system_score_codex":0.00015536377,"about_ca_system_score_gemma":0.000098074015,"threshold_uncertainty_score":0.61361486},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018499171,0.00063457264,0.9919587,0.00038906187,0.0009526224,0.00048518906,0.000017750295,0.000101483034,0.0036107092],"genre_scores_gemma":[0.8138351,0.00027222175,0.16423708,0.007845364,0.011205312,0.00010912278,0.0003524592,0.00026265313,0.001880704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978142,0.0000022373868,0.00035523387,0.00093322195,0.00039576102,0.00049934257],"domain_scores_gemma":[0.9986751,0.00012624625,0.00022935985,0.0004939637,0.0004506242,0.000024694566],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004460668,0.00042079276,0.00040541752,0.0005950182,0.00029650042,0.0010893578,0.0008805934,0.00024242884,0.000084734456],"category_scores_gemma":[0.00022681843,0.00036037902,0.000054294625,0.0004169364,0.00031236847,0.0012784216,0.00067531096,0.00033307038,0.00005562585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027625088,0.000022532311,0.0002629833,0.00080167863,0.000015746245,0.000025082274,0.00025118468,0.03514206,0.00015427583,0.02338881,0.00018031152,0.9397277],"study_design_scores_gemma":[0.00018150239,0.000007751074,0.00013408782,0.0011256491,0.000028129414,0.000015291342,0.0000014739832,0.96189994,0.000043721495,0.031183688,0.0048058876,0.00057288515],"about_ca_topic_score_codex":0.0004432632,"about_ca_topic_score_gemma":0.00029193526,"teacher_disagreement_score":0.9391548,"about_ca_system_score_codex":0.000047333793,"about_ca_system_score_gemma":0.00008804183,"threshold_uncertainty_score":0.9999476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012202939,0.0004143614,0.99711215,0.0011136683,0.000113206224,0.00090477517,0.00011031253,0.000120019955,0.0000992812],"genre_scores_gemma":[0.18092796,0.00013159966,0.8182241,0.0003595833,0.00013425299,0.00006784613,0.00009713876,0.000025010202,0.00003251625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967591,0.000020275676,0.00057308323,0.0015416343,0.0006175355,0.0004883439],"domain_scores_gemma":[0.9976105,0.00038156315,0.0002036418,0.0013658735,0.00028589123,0.00015251961],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015113772,0.00033630346,0.00036305166,0.00046696595,0.00015801827,0.00031709272,0.0024843998,0.00028498322,0.0000013255534],"category_scores_gemma":[0.00015888951,0.00031912394,0.00003270239,0.00028272657,0.0003121846,0.0011531801,0.0011365603,0.0005630215,0.0000054794978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014045486,0.00007379361,0.000003225696,0.00008706683,0.0000034837583,0.0000012488916,0.00028390475,0.004956863,0.006378602,0.34254947,0.00000394215,0.64564437],"study_design_scores_gemma":[0.00018186864,0.000028170982,0.000026927515,0.000076210374,0.0000063919842,0.00001390792,9.782509e-8,0.8814914,0.00039896317,0.11733204,0.00012550315,0.00031848653],"about_ca_topic_score_codex":0.000013135732,"about_ca_topic_score_gemma":0.000026953048,"teacher_disagreement_score":0.8765346,"about_ca_system_score_codex":0.0002413576,"about_ca_system_score_gemma":0.00043722763,"threshold_uncertainty_score":0.9999261},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002197376,0.0004413412,0.9935566,0.00017467604,0.004027843,0.0009047875,0.000006840693,0.00053141394,0.0001367692],"genre_scores_gemma":[0.1373979,0.000013419791,0.8618251,0.00008831557,0.000492464,0.00005976257,0.0000023356306,0.000039584716,0.000081109305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966942,0.000041506748,0.00038212107,0.0013454781,0.000679984,0.00085668324],"domain_scores_gemma":[0.9946989,0.003276229,0.00031097926,0.0013076578,0.00023411137,0.00017212977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016614236,0.00054073136,0.0005496318,0.00048727443,0.00022921279,0.00025139048,0.00201361,0.0003526618,0.0000036581544],"category_scores_gemma":[0.0010766919,0.0004961813,0.0001623864,0.00038472388,0.00045516095,0.0003889598,0.00074542884,0.00074291136,0.000018696775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004263302,0.00002189618,0.0000028289044,0.000065749846,0.0000042822085,0.0000041103067,0.00012654561,0.538357,0.00017065018,0.0056309504,0.0000015253618,0.45561022],"study_design_scores_gemma":[0.00025024277,0.00019608466,0.00041214048,0.0002756721,0.000016793343,0.000056277822,8.357302e-8,0.7600975,0.002752498,0.23436922,0.0006160943,0.0009573918],"about_ca_topic_score_codex":0.000005454019,"about_ca_topic_score_gemma":0.000009944945,"teacher_disagreement_score":0.45465282,"about_ca_system_score_codex":0.00063801836,"about_ca_system_score_gemma":0.00026842806,"threshold_uncertainty_score":0.999749},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013041826,0.0018089726,0.9834698,0.00028584164,0.0029563778,0.0007115688,0.0000024675035,0.0002252131,0.01052671],"genre_scores_gemma":[0.41278467,0.000047592563,0.57117474,0.0022137512,0.0016371739,0.000070244874,0.000013883385,0.000093356146,0.011964615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962365,0.000028392089,0.00048951467,0.001550355,0.0008373538,0.000857899],"domain_scores_gemma":[0.9976198,0.00040437406,0.00030836186,0.0012224428,0.00026062856,0.0001843628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009888366,0.00051148084,0.00062147266,0.0005968848,0.00041838232,0.00070116506,0.0029198844,0.00032854677,0.000035395566],"category_scores_gemma":[0.0001371916,0.0004320559,0.00024296057,0.00048001294,0.00034123717,0.0006249664,0.0009410628,0.00046877313,0.00011841191],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005600444,0.000058981772,0.000023860082,0.00016097889,0.000035621295,0.00016975525,0.0015898258,0.0019706544,0.00017857867,0.21037701,0.00032300944,0.7851061],"study_design_scores_gemma":[0.00092067115,0.0005121111,0.000017388968,0.00018154057,0.00003618775,0.00025746963,0.0000011138243,0.58468854,0.001267097,0.32322142,0.087409675,0.0014867922],"about_ca_topic_score_codex":0.000039040242,"about_ca_topic_score_gemma":0.000026458434,"teacher_disagreement_score":0.78361934,"about_ca_system_score_codex":0.00023597396,"about_ca_system_score_gemma":0.0002267867,"threshold_uncertainty_score":0.99981314},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020225967,0.00033744265,0.99545795,0.000106442145,0.0011000116,0.00045877194,0.0000015018381,0.001369602,0.001148062],"genre_scores_gemma":[0.092097774,0.000015699296,0.9065768,0.00036189475,0.00073902967,0.00004019756,0.0000010408464,0.000053820066,0.00011371184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99610746,0.000013839558,0.000502498,0.0015593357,0.0009644904,0.0008524054],"domain_scores_gemma":[0.99730974,0.0002495373,0.00030746235,0.0016751812,0.00026460266,0.00019345299],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004197224,0.0006301175,0.0005549331,0.00055025757,0.00023831554,0.00040561866,0.0027706274,0.00028810912,0.0000042850074],"category_scores_gemma":[0.00003613474,0.0005568553,0.000092500246,0.00090812566,0.00041135063,0.00092187664,0.0010338341,0.00082983356,0.000014826171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006223849,0.000005381296,0.000011635755,0.00004994006,0.00000906778,0.00015411229,0.00050404633,0.43412298,0.00003730783,0.052221555,0.000009638171,0.5128681],"study_design_scores_gemma":[0.00026052562,0.0003811818,0.000033057862,0.001790169,0.000010815478,0.0008006891,4.9838155e-7,0.9656,0.0050962055,0.015865246,0.008682879,0.0014787095],"about_ca_topic_score_codex":0.000007656257,"about_ca_topic_score_gemma":0.00003802622,"teacher_disagreement_score":0.53147703,"about_ca_system_score_codex":0.000698434,"about_ca_system_score_gemma":0.00027224005,"threshold_uncertainty_score":0.99968827},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016182124,0.0001370809,0.9945219,0.00056489615,0.00046118913,0.00076316745,0.000004394591,0.00020175819,0.0031837735],"genre_scores_gemma":[0.04578208,0.000010523868,0.9502526,0.003231281,0.00050049415,0.000085222746,0.000006432502,0.000034695575,0.0000966658],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968581,0.000040134688,0.00039935706,0.0014370123,0.00067070697,0.00059468555],"domain_scores_gemma":[0.9975948,0.00043310144,0.00019269978,0.0012229515,0.0003085822,0.00024789647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086339447,0.00044404782,0.00044134204,0.0013117875,0.00036621824,0.00039754857,0.0023976613,0.00023623924,0.000020394647],"category_scores_gemma":[0.000026558839,0.00037885574,0.00010933432,0.0013466396,0.00055566384,0.00031858886,0.0005490035,0.00051746867,0.00006711829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042095733,0.000027845974,0.00004055697,0.000016052525,0.000013578861,0.0000400167,0.00080553704,0.014266446,0.00026390146,0.2978079,0.000010886425,0.6866652],"study_design_scores_gemma":[0.0020230315,0.0011668768,0.00026286408,0.0004511175,0.000047359477,0.00053735916,0.0000012202654,0.17842388,0.0036919743,0.7959953,0.01508389,0.0023151212],"about_ca_topic_score_codex":0.0000056514073,"about_ca_topic_score_gemma":0.00009300199,"teacher_disagreement_score":0.6843501,"about_ca_system_score_codex":0.00013548392,"about_ca_system_score_gemma":0.00034124753,"threshold_uncertainty_score":0.99986637},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002611729,0.0013917824,0.9733904,0.00086584844,0.0013316289,0.0012031555,0.00002356226,0.0005507767,0.020981658],"genre_scores_gemma":[0.10611263,0.00012944588,0.8871863,0.0013022957,0.001576779,0.00012024161,0.000031949898,0.00014900627,0.003391374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926092,0.000074422445,0.0010392675,0.0029418136,0.0015041559,0.0018311428],"domain_scores_gemma":[0.99439853,0.0013339914,0.00080674846,0.0021732615,0.0007420861,0.0005453616],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0016189622,0.0013229705,0.0012682867,0.0010152133,0.0008678187,0.0010802301,0.004791206,0.0008419654,0.00002904094],"category_scores_gemma":[0.0003845077,0.0010389789,0.0004088237,0.0010280949,0.0010999914,0.0020498247,0.0016061068,0.0015865597,0.00009426051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057027588,0.00010940259,0.00009414577,0.00012763054,0.000060897462,0.00015136895,0.0040251696,0.0039216853,0.000027629787,0.443048,0.00010899736,0.5482681],"study_design_scores_gemma":[0.002027157,0.0012146203,0.00025488363,0.0022563143,0.000075711,0.0006965314,0.0000020192515,0.7548854,0.0009716919,0.19061118,0.04428153,0.0027230077],"about_ca_topic_score_codex":0.000028569384,"about_ca_topic_score_gemma":0.00028284214,"teacher_disagreement_score":0.7509637,"about_ca_system_score_codex":0.00063152413,"about_ca_system_score_gemma":0.0011475969,"threshold_uncertainty_score":0.9999567},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003916622,0.00011026408,0.9923192,0.0020261428,0.0038312003,0.0005986915,0.0000033433882,0.00032619448,0.00039327962],"genre_scores_gemma":[0.07870963,0.00017836106,0.91498065,0.0011443137,0.0021183528,0.000115544484,0.000013430579,0.0000777821,0.0026619008],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996859,0.000022332926,0.0004806516,0.001436529,0.0006673824,0.0005340815],"domain_scores_gemma":[0.9976496,0.00047043938,0.00021133566,0.0011374524,0.00027738133,0.00025377527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004808065,0.00041170995,0.0003535575,0.0009588606,0.0004533479,0.0006395492,0.0018314826,0.00019824803,0.000009189182],"category_scores_gemma":[0.00020825873,0.00040639378,0.00014904002,0.0007344867,0.00013877546,0.0016427655,0.00043052723,0.0004270759,0.00006583876],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002106461,0.000031513737,0.00001999783,0.00003385952,0.000015982969,0.000011581034,0.0032568055,0.0408483,0.0021897163,0.0041054534,0.0008873615,0.94857836],"study_design_scores_gemma":[0.001067108,0.0011816595,0.001432244,0.0013314078,0.000049417384,0.00030005435,0.0000014732502,0.20348544,0.1957613,0.22646523,0.36556324,0.0033614358],"about_ca_topic_score_codex":0.00013855706,"about_ca_topic_score_gemma":0.000067063884,"teacher_disagreement_score":0.94521695,"about_ca_system_score_codex":0.0003046603,"about_ca_system_score_gemma":0.00034309374,"threshold_uncertainty_score":0.99983877},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029768152,0.000014964884,0.9891514,0.00022632263,0.00012440277,0.00027947978,0.000011417993,0.0000059344225,0.0072092465],"genre_scores_gemma":[0.99750876,0.0000015140688,0.0019848528,0.000228777,0.00019435838,0.000016021562,0.000008016578,0.000011003353,0.000046703954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991526,0.000016681222,0.00018498693,0.00029179733,0.00020373224,0.00015021782],"domain_scores_gemma":[0.99900115,0.0003865214,0.00013500077,0.0003998098,0.000055113887,0.000022432021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025706246,0.00015224736,0.0001725349,0.00008098244,0.00007160519,0.00004298476,0.00048134167,0.000046758425,0.00014359891],"category_scores_gemma":[0.0000023657647,0.0001063463,0.000057034667,0.00014271513,0.00019800084,0.00004613368,0.000113413764,0.00032551723,0.00003698162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012425849,0.00002494926,0.00000927385,0.0000026462474,0.0000027776412,1.444924e-7,0.00008923982,0.0021106163,0.00016910146,0.8679468,0.0000074227514,0.1296358],"study_design_scores_gemma":[0.000058600428,0.000026646978,0.000038219645,0.00012616502,0.0000028208808,1.5985142e-7,3.4156187e-7,0.057071306,0.0023601656,0.94015425,0.000055775352,0.000105557185],"about_ca_topic_score_codex":0.000016773394,"about_ca_topic_score_gemma":0.0000015996432,"teacher_disagreement_score":0.9945319,"about_ca_system_score_codex":0.000028591921,"about_ca_system_score_gemma":0.00006487885,"threshold_uncertainty_score":0.4336676},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024244594,0.00069380994,0.99538434,0.00009717175,0.0019819473,0.00039040207,0.0004354154,0.000047630157,0.0007268234],"genre_scores_gemma":[0.5139154,0.000073126364,0.48497742,0.00019799307,0.00025746287,0.0000048138613,0.0005087298,0.000025160281,0.00003987259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956315,0.000048784364,0.0008848209,0.0019994378,0.0009353313,0.0005000915],"domain_scores_gemma":[0.99485874,0.00016402616,0.00054181286,0.004153369,0.00016607033,0.00011597954],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010727375,0.0004409609,0.0006473235,0.00054230663,0.00008366665,0.0002715184,0.01117806,0.00024948214,0.00002503569],"category_scores_gemma":[0.000062580184,0.00039960767,0.000046428297,0.00055843487,0.00056340697,0.001995927,0.005149765,0.0006040443,0.000010157464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006620134,0.000038655824,0.00016975129,0.00007917317,0.000013339859,0.000040694817,0.000657804,0.016669841,0.000034581357,0.016029641,0.000082262064,0.96617764],"study_design_scores_gemma":[0.00053850276,0.00011798435,0.0006914077,0.00056873803,0.000009218176,0.000044868553,5.0434403e-7,0.97788125,0.00035937893,0.01612002,0.0030895818,0.0005785696],"about_ca_topic_score_codex":0.0001414337,"about_ca_topic_score_gemma":0.00025677177,"teacher_disagreement_score":0.96559906,"about_ca_system_score_codex":0.00013224143,"about_ca_system_score_gemma":0.0005974688,"threshold_uncertainty_score":0.99984556},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054673373,0.001156523,0.990843,0.0020029054,0.0017707925,0.0006573275,0.0000048344023,0.000996638,0.0020212433],"genre_scores_gemma":[0.3662122,0.00019715053,0.63265526,0.00040132648,0.00027971252,0.000042366057,0.000021022623,0.000066811095,0.00012415391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99355006,0.00011339069,0.0010493386,0.0026712143,0.0015032553,0.0011127664],"domain_scores_gemma":[0.9890308,0.0013325327,0.00067006436,0.008502689,0.0003181542,0.00014577655],"candidate_categories":["metaresearch","metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015994504,0.00073282426,0.00083800143,0.0018752596,0.00041304555,0.00084827485,0.036084633,0.00067744224,0.000007827931],"category_scores_gemma":[0.012412655,0.0007427129,0.00012969843,0.0019101807,0.0008696415,0.0012149588,0.034971215,0.0023476614,0.000041401767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013218292,0.00005654968,0.0004682453,0.00016109318,0.0000146274315,0.00050490815,0.0007812091,0.46547946,0.00033912432,0.0012583378,0.00034722718,0.530576],"study_design_scores_gemma":[0.00040546758,0.00012535985,0.0001085127,0.0010361443,0.0000033193326,0.000056602814,6.3018945e-7,0.91883135,0.0021811137,0.07520153,0.0012691029,0.00078085874],"about_ca_topic_score_codex":0.00007019102,"about_ca_topic_score_gemma":0.000026614742,"teacher_disagreement_score":0.5297951,"about_ca_system_score_codex":0.00097525417,"about_ca_system_score_gemma":0.0011106337,"threshold_uncertainty_score":0.999954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013468474,0.0004633741,0.9925806,0.000042146665,0.00086385175,0.00010325489,0.000003117591,0.0001138875,0.0044829505],"genre_scores_gemma":[0.6338403,0.000020291754,0.36468154,0.00026479957,0.00091562595,0.0000023267921,0.00002219941,0.00005103043,0.0002018721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983815,0.0000045731367,0.00036974213,0.00050896645,0.0003767801,0.00035845276],"domain_scores_gemma":[0.9993141,0.00011005618,0.000093776296,0.000329734,0.00009349882,0.000058814425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014877795,0.0003465258,0.00035359908,0.0003231677,0.00024537978,0.00067090493,0.0004532998,0.00044740978,0.000046180397],"category_scores_gemma":[0.000021374177,0.0003107595,0.00010126784,0.0003037219,0.00027396713,0.00025043916,0.000110209425,0.00087536924,0.000010673971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.8058265e-7,0.0000010294453,0.00003259372,0.000017221473,0.0000063554858,0.000009083864,0.00011371749,0.83064395,0.0002332517,0.00005669245,0.000022048174,0.16886346],"study_design_scores_gemma":[0.000066524255,0.000014970949,0.00019295388,0.00025769745,0.000012212628,0.000009111985,5.949658e-8,0.99134,0.0009536883,0.00649213,0.00028219438,0.00037850268],"about_ca_topic_score_codex":0.00001858224,"about_ca_topic_score_gemma":0.000053116702,"teacher_disagreement_score":0.6324935,"about_ca_system_score_codex":0.00017108442,"about_ca_system_score_gemma":0.00006937968,"threshold_uncertainty_score":0.99993443},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005210405,0.00020702924,0.9969506,0.0002483844,0.0007842241,0.00028931373,0.000047173027,0.00026369066,0.0006884914],"genre_scores_gemma":[0.03420764,0.000014889115,0.96456546,0.000472507,0.00023716368,0.0000057027814,0.00010497843,0.00004572081,0.00034596265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952925,0.000031715397,0.00066432275,0.0024251875,0.00088837865,0.00069789676],"domain_scores_gemma":[0.9945025,0.0005193002,0.0004381826,0.004137026,0.00019856311,0.00020443935],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011785025,0.00052867195,0.0005289564,0.0006325232,0.00053010276,0.00066231494,0.007406285,0.00031667677,0.0000061666756],"category_scores_gemma":[0.00020769534,0.0005051285,0.00007836073,0.00078435463,0.0006048727,0.0008836917,0.005152666,0.0006960083,0.000027931444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022489903,0.00003081977,0.00008023818,0.000024531631,0.000020421561,0.000021172373,0.0011743857,0.2644558,0.00022353687,0.010995593,0.00007131029,0.7229],"study_design_scores_gemma":[0.00022066849,0.00003740406,0.0000138127225,0.00028340612,0.0000140280845,0.000054521424,3.117447e-7,0.9860438,0.00018661366,0.010691501,0.0018743838,0.0005795255],"about_ca_topic_score_codex":0.000049189257,"about_ca_topic_score_gemma":0.000045966663,"teacher_disagreement_score":0.72232044,"about_ca_system_score_codex":0.00016501576,"about_ca_system_score_gemma":0.00058400095,"threshold_uncertainty_score":0.99974},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009437077,0.00053699716,0.996677,0.00008451145,0.0009768404,0.00036609775,0.00000354575,0.0001984942,0.00021282097],"genre_scores_gemma":[0.5752081,0.000013099629,0.4240073,0.0002406723,0.00035669765,0.000004955702,0.0000034616592,0.00003228411,0.0001333939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963703,0.000012612425,0.00061394443,0.0014674095,0.00062878896,0.00090690656],"domain_scores_gemma":[0.99810356,0.0007324344,0.0002606307,0.00048596505,0.00023413176,0.00018329384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016155492,0.0005349726,0.0006089573,0.0008336511,0.00026623346,0.00071976124,0.0016779754,0.00030899132,0.0000050540307],"category_scores_gemma":[0.00014184324,0.00050156715,0.00017530467,0.0004426668,0.00020463274,0.00043652847,0.0006507037,0.00067518937,0.0000045520997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024199621,0.0000116745405,0.0000050225385,0.000037492806,0.000014688031,0.00002848886,0.0008887288,0.72613555,0.000012498743,0.032496545,0.000004556122,0.24036232],"study_design_scores_gemma":[0.0002465055,0.00010317196,0.000014583033,0.00034553366,0.0000148316885,0.00004902821,5.635829e-7,0.9979259,0.000086596476,0.00023661331,0.0004170064,0.000559679],"about_ca_topic_score_codex":0.000009364392,"about_ca_topic_score_gemma":0.00014048966,"teacher_disagreement_score":0.57426447,"about_ca_system_score_codex":0.00021961199,"about_ca_system_score_gemma":0.00018153578,"threshold_uncertainty_score":0.9997436},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008950396,0.00002717276,0.9952852,0.00009035087,0.00011989434,0.0007217625,0.00006811876,0.000036266472,0.0035616877],"genre_scores_gemma":[0.1249917,0.0003327883,0.85816544,0.00039829742,0.004960103,0.0005075774,0.0013745127,0.00030866763,0.0089609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852043,0.000010254338,0.0002118604,0.0006439284,0.00030467092,0.00030886673],"domain_scores_gemma":[0.9989341,0.0002777351,0.00017563849,0.00046997285,0.000063143205,0.00007942571],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014209969,0.00029764549,0.00028641347,0.00011720097,0.00024648712,0.00008624804,0.0004031665,0.000111909176,0.000040294417],"category_scores_gemma":[0.000003895333,0.00030198513,0.00012388757,0.0001259091,0.00029345075,0.00010952553,0.00014703492,0.00018935233,0.000062969426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026732485,0.00023070577,0.0008933652,0.000061212166,0.00007726125,0.0000033660376,0.001506571,0.32122442,0.0012001011,0.12600029,0.00028054987,0.5484954],"study_design_scores_gemma":[0.00044013074,0.00010985182,0.00007707974,0.00008875057,0.00004154095,0.000004962198,6.863454e-7,0.8703433,0.00093026797,0.10491181,0.022235796,0.0008157853],"about_ca_topic_score_codex":0.000024760784,"about_ca_topic_score_gemma":0.0000041016415,"teacher_disagreement_score":0.54911894,"about_ca_system_score_codex":0.00012532134,"about_ca_system_score_gemma":0.00015267124,"threshold_uncertainty_score":0.9999432},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018454372,0.00045560068,0.9938908,0.00033981586,0.0009226734,0.00044289537,0.0000041105536,0.0001726514,0.0019259873],"genre_scores_gemma":[0.13750474,0.000119414355,0.8602408,0.00096821116,0.0008127576,0.000017728884,0.00000773508,0.000050117058,0.000278452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961927,0.00003366974,0.0005139412,0.0015624022,0.00094974024,0.0007475752],"domain_scores_gemma":[0.9977693,0.00015998678,0.00030911935,0.0012573889,0.00029609498,0.00020810058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053420477,0.000526737,0.00043630347,0.0012097104,0.00043945314,0.00060554245,0.0029984883,0.00034376892,0.000018271341],"category_scores_gemma":[0.000038840968,0.00047919227,0.00018582019,0.0013858511,0.00066094636,0.0008362092,0.0010073106,0.00068177684,0.00002213803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064493834,0.00005763888,0.00042277423,0.000050412207,0.00001471311,0.00008892671,0.0008829344,0.099375084,0.0007810444,0.00882411,0.0000063045595,0.8894896],"study_design_scores_gemma":[0.0003175745,0.000105955194,0.00055365765,0.00026766115,0.000016196615,0.00023805752,2.5427622e-7,0.95273477,0.003553998,0.040263295,0.0011127698,0.0008358113],"about_ca_topic_score_codex":0.00006769467,"about_ca_topic_score_gemma":0.00008260668,"teacher_disagreement_score":0.8886538,"about_ca_system_score_codex":0.00020143998,"about_ca_system_score_gemma":0.00043050584,"threshold_uncertainty_score":0.999766},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010894283,0.00065564684,0.9779341,0.0079530645,0.00089551276,0.0011501978,0.000002392947,0.00021235802,0.00030243208],"genre_scores_gemma":[0.97000396,0.00024903455,0.025614223,0.0031976278,0.000795809,0.000020253185,0.000014760214,0.00005554831,0.00004876708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946056,0.00021859386,0.00091678713,0.0020493898,0.0012191896,0.0009904341],"domain_scores_gemma":[0.99428874,0.0024721583,0.00053296826,0.0022765156,0.00021503172,0.00021458772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014701947,0.0008284291,0.0007791913,0.0007822239,0.0004232839,0.0009151513,0.0039708,0.00072496675,0.0000047294734],"category_scores_gemma":[0.0002332339,0.0006945644,0.000099149984,0.0017226137,0.00080196426,0.000737567,0.00094716204,0.0020656043,0.000012220006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013152174,0.00004973249,0.00037469857,0.000031558655,0.000013253865,0.00003921156,0.0022357986,0.18351753,0.000015801317,0.05049088,0.000052326686,0.76316607],"study_design_scores_gemma":[0.00042943738,0.0002516818,0.0075973724,0.0012100004,0.000013786697,0.000047679918,9.0743015e-7,0.9282985,0.00022960234,0.059950855,0.0010083681,0.0009618109],"about_ca_topic_score_codex":0.000040269497,"about_ca_topic_score_gemma":0.00008515155,"teacher_disagreement_score":0.9591097,"about_ca_system_score_codex":0.00051122776,"about_ca_system_score_gemma":0.000367437,"threshold_uncertainty_score":0.9995505},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036861448,0.0015972166,0.9946021,0.00032853603,0.0020048588,0.00043032656,0.000033837292,0.000108585125,0.0005259494],"genre_scores_gemma":[0.017859157,0.0001791779,0.9802051,0.00076389004,0.00091492815,0.000015545256,0.000016859532,0.000020526586,0.000024800303],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974233,0.00001932558,0.00034363408,0.001154844,0.00046478424,0.000594147],"domain_scores_gemma":[0.99820983,0.00031877885,0.0001975417,0.0009173016,0.00015399457,0.00020255445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006674136,0.00039350922,0.00038470942,0.00057017343,0.00032453437,0.0005828923,0.0014051317,0.0002852298,0.000010522024],"category_scores_gemma":[0.00003999741,0.00036763542,0.00011732009,0.00034708134,0.0009512524,0.0009924026,0.00086470786,0.00042172574,0.000005985849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005587138,0.000013521748,0.000102579404,0.000035046272,0.0000080840955,0.0000045368542,0.0002974659,0.000100226236,0.00007957393,0.37574005,0.000028097966,0.6235852],"study_design_scores_gemma":[0.0005235336,0.00018830101,0.00036600078,0.00015313245,0.0000208822,0.00027784207,2.2649313e-7,0.11037086,0.00067182013,0.8632162,0.023334162,0.0008770406],"about_ca_topic_score_codex":0.000020532709,"about_ca_topic_score_gemma":0.00005674077,"teacher_disagreement_score":0.6227082,"about_ca_system_score_codex":0.00008680317,"about_ca_system_score_gemma":0.00020041206,"threshold_uncertainty_score":0.9998776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038604677,0.00044315937,0.99104977,0.0004974522,0.0012042428,0.00036196745,0.000011447846,0.00007984185,0.0059660547],"genre_scores_gemma":[0.4685057,0.0000135426035,0.52890074,0.00048152177,0.00056357955,0.000010180129,0.000048481383,0.000026801934,0.0014494092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970241,0.00004080068,0.00065194455,0.000961347,0.0009240052,0.00039780463],"domain_scores_gemma":[0.997701,0.00055457343,0.00040197716,0.00084113085,0.00039051706,0.00011080523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072427094,0.00036387623,0.00046716604,0.0011342049,0.00020874446,0.00027839813,0.0015879313,0.0002329077,0.00001858538],"category_scores_gemma":[0.00010259963,0.00035899217,0.00015823814,0.0009451601,0.0004597795,0.00050909637,0.00047353227,0.000359016,0.000014384546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009277452,0.000053199525,0.000074938434,0.000032272856,0.000018001065,0.000030247,0.00029831822,0.34844023,0.00038000717,0.14170444,0.00018249835,0.5087766],"study_design_scores_gemma":[0.0005768182,0.0001818095,0.0013142705,0.00016000119,0.000014531801,0.00003287826,1.3962607e-7,0.6287025,0.0027499187,0.36309615,0.0025751414,0.00059583463],"about_ca_topic_score_codex":0.00005803245,"about_ca_topic_score_gemma":0.0001777156,"teacher_disagreement_score":0.50818074,"about_ca_system_score_codex":0.00022132132,"about_ca_system_score_gemma":0.0007572591,"threshold_uncertainty_score":0.9998862},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003559151,0.00032459266,0.97612417,0.0007862306,0.0017723547,0.0008800301,0.000039412767,0.0004227315,0.019294567],"genre_scores_gemma":[0.96150947,0.000015202837,0.030662088,0.006730043,0.0008343958,0.000047208345,0.000014662361,0.0000454948,0.00014143749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993258,0.00020917327,0.00061011594,0.002593893,0.0018871851,0.0014416319],"domain_scores_gemma":[0.9940489,0.0035075978,0.00041443392,0.0009970983,0.00060636294,0.00042563427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019170445,0.00097305037,0.0008274119,0.0014309247,0.00065437146,0.00074717577,0.0024359918,0.00048233592,0.00005566442],"category_scores_gemma":[0.0006242533,0.0007807403,0.0002893021,0.0011751854,0.0021680233,0.0006851083,0.0014979483,0.001747758,0.00021897646],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008132538,0.000103693405,0.00018889256,0.00009247111,0.000018886227,0.0004868682,0.0011489136,0.003326656,0.000047268208,0.054373566,0.000005388949,0.94012606],"study_design_scores_gemma":[0.0026696562,0.0030331057,0.0025191086,0.0077325013,0.0001235185,0.00081294647,0.000009960272,0.7780887,0.0030301684,0.19616623,0.0015314618,0.004282655],"about_ca_topic_score_codex":0.000006948644,"about_ca_topic_score_gemma":0.000018592093,"teacher_disagreement_score":0.96115357,"about_ca_system_score_codex":0.00018992234,"about_ca_system_score_gemma":0.0007179574,"threshold_uncertainty_score":0.99946433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020873224,0.000579217,0.99191654,0.00032724132,0.00094847014,0.0005805084,0.0000035170015,0.00039451086,0.0050412472],"genre_scores_gemma":[0.42342275,0.00003918429,0.57519853,0.0010305337,0.00015333043,0.000007679685,0.0000040654027,0.00006215022,0.00008175174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931348,0.00008935692,0.0009061618,0.0029656866,0.0013052559,0.0015987414],"domain_scores_gemma":[0.99674666,0.00023924981,0.00033076332,0.0020093087,0.00021254175,0.00046149627],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013717749,0.000980832,0.0009499459,0.001050422,0.00068967434,0.0015239702,0.004952012,0.00057600514,0.000009105656],"category_scores_gemma":[0.000032269512,0.0009833006,0.00024189967,0.0013890046,0.0002798883,0.0012543289,0.0013042851,0.001757562,0.000028167055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005437088,0.000018896839,0.0000012255332,0.000018229723,0.000008295413,0.000022707718,0.0007775402,0.61933476,0.0000730887,0.0083744405,0.000001101996,0.3713643],"study_design_scores_gemma":[0.000114573304,0.00006265281,0.000005189783,0.00055243593,0.000010763708,0.00010929339,2.860853e-7,0.6662525,0.0000116749525,0.33209914,0.000026546246,0.00075493637],"about_ca_topic_score_codex":0.00007116779,"about_ca_topic_score_gemma":0.00007161109,"teacher_disagreement_score":0.42321405,"about_ca_system_score_codex":0.000710877,"about_ca_system_score_gemma":0.0008537571,"threshold_uncertainty_score":0.99951255},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004679129,0.00057611044,0.99298525,0.0026830668,0.0007525701,0.00130641,0.000053361156,0.0002685942,0.0013699487],"genre_scores_gemma":[0.46718243,0.00015051388,0.5267989,0.0031871623,0.0013844047,0.0004114702,0.00013438443,0.00010830357,0.0006424015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960471,0.000020440382,0.00067409646,0.0015087898,0.0008912459,0.00085836026],"domain_scores_gemma":[0.9961275,0.0007130589,0.00036663815,0.0020350604,0.00048004658,0.00027770718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011035592,0.00055237947,0.0005366525,0.0005268543,0.000408976,0.00040847398,0.0038292278,0.00042452122,0.000019326122],"category_scores_gemma":[0.00006463758,0.0005213151,0.00019224719,0.0007480183,0.00073047145,0.00096730195,0.0005950805,0.00060258014,0.000039717026],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054092898,0.00006874164,0.000010515113,0.00011987498,0.000021417705,0.0000026006976,0.0012309214,0.016075853,0.000042462372,0.14838782,0.00012179778,0.8339126],"study_design_scores_gemma":[0.00046960477,0.00013774695,0.00014484958,0.0003628833,0.000032591583,0.000051089402,7.2305266e-7,0.6197905,0.0013235674,0.34781876,0.028838662,0.0010290483],"about_ca_topic_score_codex":0.00006091507,"about_ca_topic_score_gemma":0.00022169297,"teacher_disagreement_score":0.83288354,"about_ca_system_score_codex":0.00049404847,"about_ca_system_score_gemma":0.0007830093,"threshold_uncertainty_score":0.99972385},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032474578,0.00016072938,0.99276555,0.00087335176,0.00028572453,0.0011299695,0.0000018757061,0.0004970888,0.003960993],"genre_scores_gemma":[0.27807683,0.000015099843,0.7202574,0.000860014,0.00017280481,0.00018084412,0.000005298436,0.000049990667,0.00038168643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955787,0.000025596759,0.000575975,0.0023016974,0.0007471334,0.0007708712],"domain_scores_gemma":[0.9958589,0.00035556083,0.00036374482,0.003009859,0.0002753016,0.00013661655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096463977,0.0005276311,0.0005137048,0.0015384841,0.00030141513,0.00040766888,0.0043885806,0.0003584061,0.000005075422],"category_scores_gemma":[0.00008500116,0.0004701735,0.000059285212,0.0024267607,0.00046123052,0.0005573257,0.0016563956,0.0009195983,0.000036666963],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001036094,0.00004497032,0.0008985997,0.000033637505,0.000010526696,0.00003377161,0.0015341977,0.021018311,0.00031672223,0.018537309,0.000028134886,0.9575335],"study_design_scores_gemma":[0.00075264444,0.0008090134,0.0036294085,0.0018651334,0.000022685275,0.00027132608,0.0000023955472,0.55422,0.00880503,0.41798288,0.008702774,0.0029366806],"about_ca_topic_score_codex":0.00006425418,"about_ca_topic_score_gemma":0.0005886698,"teacher_disagreement_score":0.95459676,"about_ca_system_score_codex":0.00058337447,"about_ca_system_score_gemma":0.00037732103,"threshold_uncertainty_score":0.999775},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022688461,0.00053532503,0.9951223,0.00021482758,0.0019976667,0.00075554004,0.000005521599,0.00010141003,0.0010405204],"genre_scores_gemma":[0.4975385,0.000010316431,0.50059855,0.00072171167,0.0008299823,0.00012387788,0.00004398451,0.00003674329,0.00009634456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684453,0.000059660175,0.0005060982,0.0012097234,0.0007967232,0.000583277],"domain_scores_gemma":[0.9981087,0.000574474,0.00029194643,0.0006917118,0.00022515225,0.00010804216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002423441,0.0003671112,0.0003478943,0.0007483902,0.00021870076,0.00025563312,0.0014301763,0.0002968173,0.000022848388],"category_scores_gemma":[0.00016780029,0.00036276007,0.00009072387,0.00029906424,0.00016727808,0.0005729851,0.00035061577,0.00051370106,0.00001480837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020980267,0.0000328876,0.00026527263,0.000050636278,0.000007130624,0.00003733875,0.0053382586,0.25477734,0.00008097147,0.0055713006,0.00008012525,0.73373777],"study_design_scores_gemma":[0.00045492523,0.00017093644,0.0001771954,0.0006532689,0.000007901507,0.000011706129,2.8468233e-7,0.89907897,0.0010281478,0.09726252,0.00072129554,0.00043286744],"about_ca_topic_score_codex":0.000036390193,"about_ca_topic_score_gemma":0.00003281293,"teacher_disagreement_score":0.7333049,"about_ca_system_score_codex":0.00031837303,"about_ca_system_score_gemma":0.0005320998,"threshold_uncertainty_score":0.99988246},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005834673,0.00028746444,0.9927512,0.0008598833,0.0011053092,0.0017442015,0.0000079497095,0.00042914524,0.0027565432],"genre_scores_gemma":[0.18847658,0.0000125525,0.8073033,0.0026621046,0.0009129204,0.00009681235,0.000011228567,0.000058654252,0.00046584324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950196,0.00006641909,0.0006415171,0.002129799,0.0009957084,0.0011469371],"domain_scores_gemma":[0.9962705,0.0013012203,0.00037882256,0.0010144907,0.0006300969,0.00040488713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023367181,0.000774976,0.00085987366,0.00089226913,0.00046487976,0.00079263194,0.0025994282,0.00041451826,0.000009993575],"category_scores_gemma":[0.0000759836,0.00065047457,0.00017244506,0.0007458924,0.00046850747,0.0005770253,0.00049281534,0.00084977644,0.000022005008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103637336,0.000040392373,0.000008407771,0.000031104035,0.000043950167,0.000032188767,0.0003939089,0.29329276,0.000018907003,0.04249731,0.000029064153,0.66350836],"study_design_scores_gemma":[0.0016482746,0.0006151552,0.00003463332,0.00022245984,0.000040896113,0.00009203891,4.8912466e-7,0.9856839,0.00006948455,0.0035069168,0.0072272383,0.0008585059],"about_ca_topic_score_codex":0.000007966951,"about_ca_topic_score_gemma":0.000032515607,"teacher_disagreement_score":0.69239116,"about_ca_system_score_codex":0.00032030503,"about_ca_system_score_gemma":0.0006874597,"threshold_uncertainty_score":0.9995946},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039183037,0.00023697506,0.9968725,0.0001467694,0.0013419377,0.00041919315,0.0000016658701,0.00015173094,0.00043739108],"genre_scores_gemma":[0.58057475,0.000022919268,0.41883764,0.00015864211,0.00016252154,0.00001378886,0.0000044891854,0.000016284457,0.00020898053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731326,0.000053661886,0.000513639,0.0010445213,0.0006961686,0.00037875638],"domain_scores_gemma":[0.9986724,0.00019754887,0.00021631319,0.00058058003,0.00022832259,0.00010483602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069462723,0.00030423934,0.00030354082,0.0008861461,0.00020634105,0.00039017634,0.0009374838,0.00023190606,0.000010523132],"category_scores_gemma":[0.000068846086,0.00030876577,0.00006803678,0.0012957187,0.00011813831,0.00072450953,0.000380719,0.00037048213,0.00003820835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031295253,0.000026454783,0.000014116497,0.000020094098,0.0000018290638,0.000024028735,0.00021579195,0.84942675,0.00014723687,0.00286301,0.0000013803649,0.14725617],"study_design_scores_gemma":[0.00038166743,0.00009241467,0.000120588375,0.00022387443,0.0000030496371,0.00004914266,2.0452484e-7,0.9938707,0.0033527436,0.0014978099,0.0000923063,0.0003155258],"about_ca_topic_score_codex":0.000023446562,"about_ca_topic_score_gemma":0.00009266212,"teacher_disagreement_score":0.5801829,"about_ca_system_score_codex":0.0006298422,"about_ca_system_score_gemma":0.00016252877,"threshold_uncertainty_score":0.99993646},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012797852,0.0004172631,0.9960323,0.00065082725,0.0008008226,0.00081437983,0.000009462049,0.00039539926,0.0008667615],"genre_scores_gemma":[0.014395179,0.00006458041,0.98211044,0.0020028786,0.00080181885,0.000034133598,0.000005654648,0.000056996792,0.0005283157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995833,0.000026070411,0.00062910374,0.001785994,0.0008059025,0.0009199257],"domain_scores_gemma":[0.99746543,0.00048105238,0.00030564284,0.0011124536,0.00039920717,0.00023620359],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009252024,0.0006299329,0.0006660954,0.0007466159,0.00034159544,0.00072378136,0.0031230561,0.00036327518,0.000016019338],"category_scores_gemma":[0.00015038069,0.00052335457,0.0002274031,0.0005503545,0.0009720595,0.0016624568,0.0014513918,0.00074046553,0.000030284033],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014398567,0.000031364536,0.0000028561724,0.000036083467,0.000005915677,0.000043103657,0.00022921119,0.0003841451,0.0017077146,0.003411248,0.000067273344,0.9940667],"study_design_scores_gemma":[0.00069099746,0.00079432694,0.000023841136,0.0007540704,0.000019720592,0.00014388877,5.1655604e-7,0.5753868,0.18385549,0.21864197,0.018115638,0.0015726939],"about_ca_topic_score_codex":0.000011194889,"about_ca_topic_score_gemma":0.000039393057,"teacher_disagreement_score":0.992494,"about_ca_system_score_codex":0.000517379,"about_ca_system_score_gemma":0.00058063277,"threshold_uncertainty_score":0.9997218},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006913591,0.000251428,0.9916404,0.00028419588,0.0006168295,0.000286597,0.000008424909,0.00068946864,0.0062157433],"genre_scores_gemma":[0.06200781,0.000045159366,0.9358927,0.0014310903,0.0001763578,0.0000096505955,0.000032497905,0.00003399288,0.00037076423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554896,0.00006271752,0.00066373014,0.002000255,0.0009877278,0.000736611],"domain_scores_gemma":[0.9958768,0.00034982292,0.00045497395,0.0027512151,0.00032515117,0.00024202636],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009928211,0.0006535664,0.0008081292,0.0023370353,0.00029192274,0.0005972138,0.0058256565,0.00041233926,0.00006425697],"category_scores_gemma":[0.000073902585,0.00060857006,0.00033438145,0.0019516846,0.00056270976,0.0005766294,0.0013634651,0.0007723091,0.000057312034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010360898,0.00007757332,0.00031410568,0.000029700816,0.00011762015,0.00009307425,0.00033568416,0.7096635,0.000013466415,0.02597484,0.00014383397,0.2632262],"study_design_scores_gemma":[0.00018450766,0.00011405527,0.0002069069,0.00010890971,0.00005547502,0.000007923151,1.7658085e-8,0.9364156,0.0004503235,0.060116228,0.0015778979,0.0007621396],"about_ca_topic_score_codex":0.000051908035,"about_ca_topic_score_gemma":0.000074769705,"teacher_disagreement_score":0.26246408,"about_ca_system_score_codex":0.0002241415,"about_ca_system_score_gemma":0.00063331745,"threshold_uncertainty_score":0.9996366},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000073491814,0.00056516204,0.99578965,0.00029609055,0.00027376623,0.00027118824,0.00001837569,0.00023635956,0.0024759478],"genre_scores_gemma":[0.24903908,0.000023276376,0.75032014,0.00032092838,0.00016524077,0.0000019030318,0.000013918879,0.000021513839,0.00009401085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964716,0.000032042546,0.0007103005,0.0011263267,0.0011492035,0.0005105578],"domain_scores_gemma":[0.99744743,0.00075274886,0.0004813039,0.0007481544,0.00043487732,0.00013549693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063073233,0.00047343483,0.0005523364,0.0007874537,0.00023440194,0.00045099776,0.002162733,0.00021404265,0.000007871753],"category_scores_gemma":[0.00016185711,0.00046236182,0.00017450753,0.0005465709,0.00077517587,0.0018276764,0.0009878905,0.00065201137,0.000009434475],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011613884,0.000044547924,0.000044045657,0.00002972881,0.000008565584,0.000055916844,0.0001791411,0.0246904,0.000716208,0.009821525,0.0000099578765,0.9643884],"study_design_scores_gemma":[0.00022075602,0.00019145201,0.00040645272,0.0005596047,0.0000056095305,0.00027127517,9.5296954e-8,0.15339126,0.005048873,0.8390397,0.00029196937,0.00057299674],"about_ca_topic_score_codex":0.0000144406895,"about_ca_topic_score_gemma":0.0000024610902,"teacher_disagreement_score":0.96381533,"about_ca_system_score_codex":0.00027977204,"about_ca_system_score_gemma":0.0004892278,"threshold_uncertainty_score":0.9997828},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006233563,0.0007631031,0.9947235,0.0004488295,0.0018443948,0.0002702931,0.0000020434356,0.000086368455,0.0012381164],"genre_scores_gemma":[0.09704171,0.0003625384,0.89913726,0.0016338489,0.0003667842,0.0000063687917,0.0000028634163,0.00005835712,0.001390257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756134,0.00004093545,0.00036163378,0.0011555216,0.0004486225,0.00043196863],"domain_scores_gemma":[0.99817234,0.0005973069,0.00032097547,0.0006314427,0.0001387284,0.00013917897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046254112,0.00038376762,0.0004480611,0.0005491423,0.00017261205,0.0002389463,0.0010019473,0.0001591344,0.0000051757575],"category_scores_gemma":[0.00015901502,0.00036012495,0.000068786045,0.00040445264,0.00049864734,0.0006339405,0.0006165662,0.00056611275,0.000007201344],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006202748,0.00001224461,0.000055707307,0.00006019363,0.0000046812993,0.000020431466,0.00028994284,0.0038768607,0.004709743,0.0014886645,0.000023453387,0.9894519],"study_design_scores_gemma":[0.00058281305,0.00034861814,0.00026209984,0.0021364933,0.000011844092,0.00018609644,5.7459283e-7,0.9144048,0.014596806,0.063691095,0.002930158,0.00084860297],"about_ca_topic_score_codex":0.000017264725,"about_ca_topic_score_gemma":0.000005369368,"teacher_disagreement_score":0.9886033,"about_ca_system_score_codex":0.00018620676,"about_ca_system_score_gemma":0.00015550296,"threshold_uncertainty_score":0.9998851},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20497997,0.000019111827,0.7944541,0.00014595945,0.000115197254,0.0000944465,0.0000011862201,0.000038485843,0.00015155006],"genre_scores_gemma":[0.6103251,2.9402548e-7,0.38854963,0.0010609777,0.000057252408,3.774275e-7,0.0000014269054,0.000003990621,9.443758e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987144,0.000013061631,0.00021158198,0.00036464276,0.00032703206,0.00036927458],"domain_scores_gemma":[0.99908483,0.00041001613,0.000036909056,0.00020179382,0.00009188181,0.00017458793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005658017,0.000105811814,0.00016971337,0.00015620026,0.00008838782,0.000049153892,0.00014488693,0.00007823288,0.00004317042],"category_scores_gemma":[0.00027634855,0.000082923856,0.000022628257,0.00048088096,0.00024129977,0.000099850724,0.000074210635,0.00029047695,0.0000031272352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097472024,0.00006891485,0.0038284168,0.0000132462965,0.0000036081826,0.000061401275,0.0009961973,0.13520372,0.00624497,0.00057769776,6.3730846e-7,0.8529037],"study_design_scores_gemma":[0.00076358096,0.0000714898,0.0045770747,0.000042864955,0.0000050512535,0.000018978066,0.000001161001,0.9869626,0.0014331753,0.0059947427,0.0000307118,0.000098548844],"about_ca_topic_score_codex":0.00003902567,"about_ca_topic_score_gemma":0.000026851212,"teacher_disagreement_score":0.85280514,"about_ca_system_score_codex":0.00009887649,"about_ca_system_score_gemma":0.00017437809,"threshold_uncertainty_score":0.3381537},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010502967,0.00028634325,0.9953041,0.0006940607,0.0011245275,0.00038091696,0.000005284202,0.00007622184,0.001078228],"genre_scores_gemma":[0.9810622,0.0000103841085,0.017268397,0.0005428507,0.0010335661,0.00001263511,0.000003566681,0.000022862121,0.000043583663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965258,0.00006849075,0.0009716235,0.0010336256,0.00068318367,0.00071725936],"domain_scores_gemma":[0.9976769,0.00052910356,0.0006998408,0.00065509876,0.00034422838,0.00009484643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012722571,0.0004178937,0.00084702,0.0008252376,0.00030956513,0.0007785502,0.0048204064,0.00039713326,0.000007454875],"category_scores_gemma":[0.00007683166,0.00038281223,0.0002034786,0.0009940851,0.0005359863,0.00053721917,0.0012092325,0.000979562,0.00000511909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004445551,0.00004020081,0.00069792126,0.000057861267,0.000032769647,0.000011578688,0.002361218,0.25681588,0.00014895202,0.7028887,0.00003533452,0.036905125],"study_design_scores_gemma":[0.00030504898,0.00005370731,0.0015473492,0.00039298038,0.000017612727,0.000021677151,5.627511e-7,0.982348,0.00008210083,0.014030262,0.0006826968,0.00051795837],"about_ca_topic_score_codex":0.00010672731,"about_ca_topic_score_gemma":0.00037236497,"teacher_disagreement_score":0.9800119,"about_ca_system_score_codex":0.00018206541,"about_ca_system_score_gemma":0.00039030943,"threshold_uncertainty_score":0.9998624},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050131086,0.0027242482,0.9838019,0.00043749466,0.007453844,0.0033129833,0.000041992887,0.0003245644,0.0018528415],"genre_scores_gemma":[0.9350898,0.00006286442,0.05886664,0.0020237043,0.0020946243,0.00029553456,0.00008424012,0.00014006479,0.0013424737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99303657,0.00015378,0.0011201603,0.0023345076,0.0023144002,0.0010406043],"domain_scores_gemma":[0.9930754,0.0020059855,0.00083621853,0.0018603058,0.0019194728,0.00030266616],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003719709,0.0007956008,0.0010059893,0.0014574095,0.00041206935,0.0012125395,0.0032553468,0.0006348375,0.00004107616],"category_scores_gemma":[0.00033209592,0.0007857201,0.00031239196,0.0007480315,0.0004511871,0.0012437988,0.0007707749,0.0007111199,0.000102274],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018371002,0.00004112217,0.000024830797,0.00010576088,0.00003666345,0.000022951921,0.0006635602,0.002754614,0.000047612346,0.0059507987,0.00017424476,0.99015945],"study_design_scores_gemma":[0.0015633377,0.0003177313,0.000057593137,0.001214693,0.000044994027,0.00016851287,0.0000037967868,0.952983,0.0007998974,0.013269562,0.028300418,0.001276467],"about_ca_topic_score_codex":0.00008637755,"about_ca_topic_score_gemma":0.00029959198,"teacher_disagreement_score":0.988883,"about_ca_system_score_codex":0.0011312074,"about_ca_system_score_gemma":0.0013536373,"threshold_uncertainty_score":0.9998243},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010079034,0.00062212226,0.9821519,0.0019715375,0.0017363399,0.0008752601,0.000016625596,0.00016000231,0.0023871518],"genre_scores_gemma":[0.7406381,0.000039797644,0.25024807,0.0018332114,0.00061040436,0.000058488808,0.000015240578,0.000050619878,0.0065060984],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935092,0.00017745105,0.000720776,0.0019798463,0.0031259074,0.00048687318],"domain_scores_gemma":[0.9945932,0.0011621868,0.0004993808,0.0014487226,0.0021434415,0.00015309469],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0028853829,0.00049773813,0.0005863442,0.0012016469,0.0003105618,0.0009014425,0.002751321,0.00065790187,0.0024350334],"category_scores_gemma":[0.0015049366,0.00035704972,0.00018430679,0.0008350991,0.0011751713,0.00091871544,0.00063963,0.001048414,0.0020181185],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003909651,0.00007902302,0.0025008766,0.000002155386,0.000035761008,0.00005477153,0.004078411,0.027584292,0.0009333691,0.011969063,0.0024204436,0.9503027],"study_design_scores_gemma":[0.00058554835,0.00015538705,0.016389823,0.00013876826,0.000048913913,0.000034381133,0.000016738504,0.1815653,0.0006376851,0.7966254,0.0030088837,0.0007932091],"about_ca_topic_score_codex":0.0001273786,"about_ca_topic_score_gemma":0.00015804534,"teacher_disagreement_score":0.9495095,"about_ca_system_score_codex":0.0006975973,"about_ca_system_score_gemma":0.000538791,"threshold_uncertainty_score":0.9998881},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014107903,0.0000340328,0.99084306,0.00007039856,0.00023041344,0.00019983515,0.000012591305,0.0000148659865,0.00718401],"genre_scores_gemma":[0.8901768,4.083704e-7,0.1092834,0.000032999855,0.0004360633,0.000009168453,0.000023895822,0.00001554957,0.000021748852],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840015,0.000013992235,0.000254143,0.00049231393,0.00062172266,0.00021764862],"domain_scores_gemma":[0.9988286,0.00011357066,0.00019431901,0.0004850143,0.00030838462,0.00007011344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021676526,0.00021856907,0.00029232528,0.0000984329,0.00012235,0.00002974076,0.0004374714,0.00008742383,0.000087241715],"category_scores_gemma":[0.000012327909,0.00019729431,0.000077114484,0.00013956902,0.0005044758,0.00016187903,0.00014367815,0.00046912322,0.000006128828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004498183,0.0001004457,0.0007647765,0.000010632495,0.000027346125,5.4485065e-7,0.00049005536,0.41078696,0.0055119866,0.036279824,0.0000022159638,0.54602075],"study_design_scores_gemma":[0.00016701587,0.000028115102,0.00020629683,0.00004799137,0.000027360176,2.879244e-7,3.23218e-7,0.14396445,0.0058294367,0.8494121,0.00008366722,0.00023298967],"about_ca_topic_score_codex":0.000024276458,"about_ca_topic_score_gemma":0.000009077898,"teacher_disagreement_score":0.888766,"about_ca_system_score_codex":0.00006326745,"about_ca_system_score_gemma":0.00019135769,"threshold_uncertainty_score":0.8045429},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032889476,0.0005898894,0.9907775,0.0003744114,0.0045048334,0.0012959623,0.000007651955,0.00036989263,0.0017509778],"genre_scores_gemma":[0.16555469,0.000011722,0.8325004,0.000570771,0.0011678202,0.00007856817,0.000015474921,0.000035080862,0.00006548065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958733,0.000043329583,0.0005922765,0.0016380314,0.0010818528,0.000771258],"domain_scores_gemma":[0.99625206,0.00062118366,0.00031581643,0.0019291337,0.0006947724,0.00018704397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025406524,0.0004599743,0.00048585533,0.0020497446,0.00040355255,0.0003854111,0.003285466,0.0009077537,0.000012284394],"category_scores_gemma":[0.000581172,0.00044538453,0.00013028648,0.0011345035,0.0006558656,0.0006649637,0.0006214576,0.00085480406,0.00003491117],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001503525,0.000054689866,0.00005162834,0.000021970021,0.000012296643,0.000016317037,0.000919457,0.012942018,0.00010254642,0.10947338,0.000008048069,0.8763826],"study_design_scores_gemma":[0.00030071574,0.00031939027,0.000052855805,0.00018023995,0.0000087705,0.00004736858,7.542244e-7,0.5240329,0.0008350938,0.47278342,0.0010361974,0.00040231002],"about_ca_topic_score_codex":0.00006820525,"about_ca_topic_score_gemma":0.00041352486,"teacher_disagreement_score":0.8759803,"about_ca_system_score_codex":0.0005268727,"about_ca_system_score_gemma":0.00080200663,"threshold_uncertainty_score":0.9997998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075110054,0.0016930617,0.99583054,0.00013057592,0.00044340445,0.0003347317,0.0000014071995,0.000044610293,0.00077057414],"genre_scores_gemma":[0.9943898,0.00053206686,0.0046784,0.00012390861,0.00014684466,0.000007556132,0.0000025680763,0.000018421082,0.000100480065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989983,0.000046899502,0.0002767901,0.00027405354,0.00023680314,0.0001671413],"domain_scores_gemma":[0.99937254,0.00027518533,0.00009417511,0.00016616248,0.000054868826,0.000037077567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006619432,0.0001865349,0.0002354687,0.00020231606,0.00009115024,0.00008413196,0.00015527937,0.00008958396,0.00004027228],"category_scores_gemma":[0.000015540809,0.00014053994,0.00003590574,0.00015082168,0.00038853855,0.000137835,0.00006869945,0.00019869451,0.000002347314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016578588,0.000007880225,0.000096198004,0.0000673558,0.000019352445,0.0000016951171,0.00049893046,0.0814848,0.00017111702,0.019315002,0.000006716683,0.89831436],"study_design_scores_gemma":[0.0016755831,0.00008894604,0.0028957338,0.00017513933,0.000039142986,0.000042377087,0.0000030389522,0.951603,0.0006955971,0.042284545,0.00018153228,0.00031534935],"about_ca_topic_score_codex":0.000010021903,"about_ca_topic_score_gemma":0.00002668675,"teacher_disagreement_score":0.99363863,"about_ca_system_score_codex":0.00008720141,"about_ca_system_score_gemma":0.000014216718,"threshold_uncertainty_score":0.5731052},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009936111,0.00026004578,0.98773575,0.0002538002,0.0033502744,0.00029687895,0.0000014592277,0.0002859264,0.007716495],"genre_scores_gemma":[0.06801794,0.000021930568,0.9296036,0.0014336344,0.0006314704,0.00000723317,0.0000026195396,0.00003730288,0.0002442865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958258,0.00008389098,0.0006757864,0.0015914462,0.0011010652,0.00072200125],"domain_scores_gemma":[0.99647504,0.0006741178,0.00044895467,0.0019657565,0.00024995062,0.00018618682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002564209,0.0005403187,0.00055992446,0.0010274262,0.00036356112,0.0008304652,0.00449728,0.00039131017,0.000014096097],"category_scores_gemma":[0.0004427712,0.00051801023,0.0001389399,0.00068694836,0.0005768504,0.00081184774,0.0013891899,0.0011099438,0.00011568817],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029563869,0.000007408823,0.000032976586,0.000038767274,0.000005046209,0.000014245505,0.0006019458,0.02115411,0.00015934584,0.10524929,0.0000058234814,0.8727281],"study_design_scores_gemma":[0.00020565477,0.00012599524,0.00019026366,0.00050515594,0.0000056807803,0.00007331541,5.049393e-8,0.82180935,0.0028705432,0.16914992,0.004326426,0.00073762244],"about_ca_topic_score_codex":0.000014320999,"about_ca_topic_score_gemma":0.000018882733,"teacher_disagreement_score":0.87199044,"about_ca_system_score_codex":0.00027028593,"about_ca_system_score_gemma":0.0003790439,"threshold_uncertainty_score":0.99972713},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023928958,0.0008367676,0.99408036,0.0000110560395,0.000768617,0.0002718851,0.000007930401,0.00009782637,0.0015326398],"genre_scores_gemma":[0.99352604,0.000021574517,0.0061281733,0.00007357321,0.00019046637,0.0000042029783,0.0000019203944,0.00003471349,0.000019360577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985783,0.000013452712,0.000405495,0.0004046078,0.00031592516,0.00028221757],"domain_scores_gemma":[0.9993147,0.00014973686,0.00012598238,0.0002771875,0.000050394367,0.00008198615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039170936,0.00028496896,0.00047407078,0.000301986,0.00005724799,0.000084755484,0.00035672175,0.00018748191,0.000009119847],"category_scores_gemma":[0.000014220801,0.00026568718,0.000077234436,0.00010031022,0.00011231612,0.00017393431,0.000039468017,0.0003350724,0.0000021459766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003421416,0.000017876118,0.00032881577,0.00036859885,0.000104041916,0.000044841563,0.0008483635,0.5043245,0.016816447,0.0407381,0.0000023019513,0.43637192],"study_design_scores_gemma":[0.00051535777,0.00009604675,0.00023750606,0.0004093401,0.000022242873,0.000020096653,2.043965e-7,0.96351403,0.0010969669,0.033705473,0.00004374531,0.00033900523],"about_ca_topic_score_codex":0.00005813395,"about_ca_topic_score_gemma":0.00015206834,"teacher_disagreement_score":0.9911331,"about_ca_system_score_codex":0.00012525728,"about_ca_system_score_gemma":0.00005891341,"threshold_uncertainty_score":0.99997956},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010732775,0.00016635405,0.99288565,0.0005625582,0.0010425261,0.00072128954,0.000035623074,0.00018363447,0.0043916116],"genre_scores_gemma":[0.00563715,0.000014782817,0.99026686,0.0011542403,0.00040371262,0.000021978873,0.00007119529,0.000037946644,0.0023921297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958098,0.00003375327,0.00058754283,0.0017090973,0.0010423184,0.00081749423],"domain_scores_gemma":[0.9972292,0.0006111593,0.00038884382,0.0013046807,0.00029366172,0.00017242778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027126465,0.0005437692,0.0005240192,0.0009682384,0.0003039467,0.0007997855,0.0038481185,0.00024041289,0.000010546553],"category_scores_gemma":[0.00014191697,0.0005161415,0.000168356,0.00054733513,0.0004518536,0.0013205281,0.001701066,0.00050708314,0.000022768112],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014693968,0.000022434815,0.0000072420166,0.00005333239,0.000018616427,0.00003461295,0.004431037,0.005029488,0.0000028203785,0.077828795,0.00025908306,0.91229784],"study_design_scores_gemma":[0.00027204212,0.00009636605,0.000004757312,0.00020557646,0.000008259189,0.000006082916,0.0000011243211,0.821552,0.0000493367,0.17596889,0.0012971415,0.0005384685],"about_ca_topic_score_codex":0.000029706945,"about_ca_topic_score_gemma":0.00018226169,"teacher_disagreement_score":0.9117594,"about_ca_system_score_codex":0.0002617477,"about_ca_system_score_gemma":0.00038911053,"threshold_uncertainty_score":0.99972904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028287184,0.0015311469,0.9906492,0.0005220119,0.0016223444,0.00057113694,0.000006200803,0.00009232887,0.0021768725],"genre_scores_gemma":[0.8542735,0.00039710186,0.14129393,0.0032402228,0.00043153216,0.000030225094,0.0000057348957,0.000060177626,0.00026759077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614316,0.00003624332,0.0006650291,0.0013101861,0.0012147764,0.0006306292],"domain_scores_gemma":[0.9967285,0.0007493819,0.00040416382,0.001713792,0.00022734731,0.00017681654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005542366,0.00055230706,0.00070357363,0.0010608976,0.00015896729,0.00022981147,0.002891073,0.00032567696,0.00010671496],"category_scores_gemma":[0.0000927172,0.0004494551,0.00025770624,0.000777167,0.000868461,0.00014677807,0.000829189,0.0008610562,0.00008532059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016491822,0.00031680943,0.00030330315,0.0008061283,0.000068252426,0.0001565151,0.0006772464,0.051804326,0.0003000847,0.10308429,0.000105486506,0.8423611],"study_design_scores_gemma":[0.00042159634,0.00074143306,0.006637861,0.0039829602,0.000037402246,0.000049502552,9.851018e-8,0.85306287,0.0010111032,0.13258392,0.00038000508,0.0010912463],"about_ca_topic_score_codex":0.000051319494,"about_ca_topic_score_gemma":0.000034559052,"teacher_disagreement_score":0.8514448,"about_ca_system_score_codex":0.000091177164,"about_ca_system_score_gemma":0.00024865882,"threshold_uncertainty_score":0.99979573},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004391178,0.0003550677,0.98439723,0.00044144236,0.0030116122,0.00082796096,0.000003301674,0.0002486648,0.010710308],"genre_scores_gemma":[0.52053964,0.000033891945,0.47479036,0.0016718386,0.0012903912,0.00009452364,0.000007880559,0.000077158984,0.0014942805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99618864,0.000039588173,0.0006088665,0.0014668639,0.0008309726,0.0008650682],"domain_scores_gemma":[0.9959247,0.001748758,0.0003611409,0.0014376801,0.00033807533,0.00018962103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024136875,0.0005518957,0.000679744,0.0007033788,0.00038191222,0.0007938095,0.0036440392,0.00042433047,0.000015670035],"category_scores_gemma":[0.00034098004,0.00044762477,0.0002138349,0.0005015286,0.000743325,0.0004415772,0.00090324786,0.0004601054,0.000046951845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009318494,0.000019440402,0.00001520288,0.000047766032,0.000013014562,0.000034954086,0.00040132398,0.0002910285,0.00001547026,0.6776086,0.000018265362,0.32152557],"study_design_scores_gemma":[0.00028124973,0.0003012647,0.00002283207,0.00008792022,0.000014259672,0.000055122626,4.2438745e-7,0.05949671,0.001761176,0.9278613,0.009407157,0.0007105834],"about_ca_topic_score_codex":0.00003694552,"about_ca_topic_score_gemma":0.00011220519,"teacher_disagreement_score":0.5205353,"about_ca_system_score_codex":0.00021910062,"about_ca_system_score_gemma":0.00047884343,"threshold_uncertainty_score":0.9997975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060121592,0.0008967168,0.9364137,0.00024187776,0.00076948234,0.00024856703,0.0000039215356,0.000019850451,0.0012842842],"genre_scores_gemma":[0.980872,0.00014917123,0.016325274,0.0012316395,0.0012298779,0.0000013600267,0.000022759736,0.00001741747,0.00015050822],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998506,0.0000328946,0.0002361269,0.00066709914,0.0002474621,0.00031041962],"domain_scores_gemma":[0.9992717,0.000056231573,0.0001163069,0.0004091842,0.00009765368,0.000048907805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003665448,0.00025564432,0.00019483769,0.00007251584,0.0003677194,0.000108827895,0.00068462256,0.0003043915,0.000008179697],"category_scores_gemma":[0.000062696796,0.00016525913,0.00009590929,0.00010419021,0.0005197224,0.0000058975434,0.0005004516,0.0003345083,0.000003862267],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007219846,0.000054367738,0.0019464698,0.000049870567,0.00006174347,0.00009969373,0.00046974106,0.12589182,0.44905004,0.0012065341,0.00023471672,0.42086282],"study_design_scores_gemma":[0.0015534448,0.002060446,0.0020599824,0.0009918305,0.00008706596,0.0013043118,0.0000026789294,0.49557534,0.40497106,0.011332403,0.075908124,0.0041533126],"about_ca_topic_score_codex":0.000007309823,"about_ca_topic_score_gemma":0.00002594188,"teacher_disagreement_score":0.9207504,"about_ca_system_score_codex":0.000044117052,"about_ca_system_score_gemma":0.00018460817,"threshold_uncertainty_score":0.67390716},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01979697,0.0011814655,0.97485256,0.00016807822,0.0017464358,0.0015778886,0.000025355099,0.00022705989,0.0004241885],"genre_scores_gemma":[0.8800399,0.000033581502,0.118838176,0.00036907243,0.0005975813,0.000024534185,0.0000057761845,0.000051472824,0.00003992287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951456,0.00006926861,0.00078289467,0.0023176197,0.0008007746,0.0008838168],"domain_scores_gemma":[0.9947105,0.003056891,0.00067010295,0.0006198485,0.0006565184,0.00028613696],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013145353,0.0007661143,0.0009770831,0.0007976454,0.00075525045,0.001149836,0.001258041,0.00038337236,0.000003023595],"category_scores_gemma":[0.00027647073,0.00079432194,0.00014547596,0.00050399697,0.00092391315,0.00091163267,0.001613668,0.0008986941,0.0000057827947],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014388134,0.000029805216,0.0017373196,0.00022535256,0.000041093495,0.00005503403,0.0040595033,0.0022290417,0.00009339516,0.0017228398,0.0000019552012,0.98979026],"study_design_scores_gemma":[0.006104048,0.0018042141,0.010959248,0.015144968,0.00013558727,0.001233064,0.00007399857,0.86692363,0.0057226773,0.08567109,0.0007771105,0.0054503926],"about_ca_topic_score_codex":0.00006322015,"about_ca_topic_score_gemma":0.00007648072,"teacher_disagreement_score":0.9843399,"about_ca_system_score_codex":0.0004481686,"about_ca_system_score_gemma":0.0005499866,"threshold_uncertainty_score":0.99988705},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004999248,0.0015756111,0.9895933,0.0001352678,0.005539333,0.0007716046,0.0000022196593,0.0002372694,0.002095372],"genre_scores_gemma":[0.6883367,0.000023346625,0.3078066,0.00020613827,0.0026477042,0.000051089086,0.000002930916,0.000048734717,0.0008767551],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643844,0.000029758769,0.00052234554,0.001335261,0.00067113206,0.0010030443],"domain_scores_gemma":[0.9972869,0.0004824942,0.0003296957,0.0013658134,0.00027650723,0.0002585761],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013247286,0.00054421835,0.00056574435,0.0005330284,0.00043667885,0.00075686595,0.0024812622,0.00038801745,0.000010581933],"category_scores_gemma":[0.00007655438,0.00047140731,0.00021152275,0.00040149936,0.00036747623,0.00074067817,0.0010261124,0.00054453325,0.000086035885],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040609066,0.00003307452,0.000181566,0.00010115083,0.00001995791,0.00057684444,0.0011009922,0.0008340704,0.000053350686,0.106796734,0.000022077684,0.89027613],"study_design_scores_gemma":[0.0016354495,0.0010536276,0.000102525184,0.0003812971,0.000088883426,0.010980681,0.0000019907652,0.24468228,0.0048541217,0.65421265,0.07793594,0.0040705535],"about_ca_topic_score_codex":0.000040695668,"about_ca_topic_score_gemma":0.000026276784,"teacher_disagreement_score":0.88620555,"about_ca_system_score_codex":0.0002606047,"about_ca_system_score_gemma":0.0002986203,"threshold_uncertainty_score":0.99977374},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055189605,0.0011464055,0.9922011,0.00015827653,0.0008632125,0.0004823141,0.000020530804,0.000104172825,0.004472117],"genre_scores_gemma":[0.8037184,0.00009528789,0.19539359,0.00047640692,0.000115128234,0.0000140509965,0.0000079140655,0.000033140892,0.00014612495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99462646,0.00009579894,0.0009185109,0.0019751776,0.0016679461,0.0007161182],"domain_scores_gemma":[0.99610454,0.00049160694,0.00045983755,0.0023753392,0.0003455766,0.000223131],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011487699,0.0006138505,0.0008871127,0.0009806487,0.00014582026,0.00023853038,0.0050435737,0.00045202562,0.00007664829],"category_scores_gemma":[0.000086354856,0.0005351197,0.0001709768,0.0011261705,0.0014412669,0.000828685,0.0023380318,0.0011704579,0.000037911836],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020258964,0.00017773198,0.00033786902,0.00009710702,0.000011420552,0.00019296882,0.0007135772,0.016957551,0.0003366246,0.023653368,0.000064356274,0.95743716],"study_design_scores_gemma":[0.0006434584,0.00027629535,0.00059727475,0.0014529696,0.0000065579766,0.000072138006,4.347911e-7,0.8241928,0.0016919138,0.16954455,0.0007425441,0.00077902304],"about_ca_topic_score_codex":0.00016044518,"about_ca_topic_score_gemma":0.0002011511,"teacher_disagreement_score":0.9566581,"about_ca_system_score_codex":0.00023959014,"about_ca_system_score_gemma":0.0006397911,"threshold_uncertainty_score":0.99971},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004088786,0.0005540869,0.98985106,0.00036721086,0.0033355353,0.00042189326,0.000006768878,0.00018332727,0.0052392394],"genre_scores_gemma":[0.09244447,0.00007044447,0.89839596,0.008178678,0.00070211734,0.000008785822,0.000014481695,0.00008781176,0.00009726453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948572,0.00011066782,0.00068595767,0.0020188475,0.0010823724,0.0012449515],"domain_scores_gemma":[0.99691373,0.00042298384,0.00031914454,0.001851616,0.00018494639,0.0003075729],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013959518,0.00081330776,0.0007478369,0.00081186264,0.00048193685,0.0009769074,0.0036844045,0.0005583343,0.000037941405],"category_scores_gemma":[0.000047667432,0.00074564625,0.00023098335,0.0010096191,0.00065091957,0.00080328435,0.0013237278,0.0011959488,0.000020676562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006142286,0.000015745805,0.000054486653,0.000028587858,0.000010457327,0.00015994936,0.0001888687,0.82588506,0.00001270034,0.00059055886,0.00007002924,0.17297742],"study_design_scores_gemma":[0.00032132558,0.00008725068,0.000034036042,0.00029648948,0.000011876618,0.00011189901,1.5067849e-7,0.9901747,0.000035349676,0.0053875893,0.0026442437,0.0008950862],"about_ca_topic_score_codex":0.000046910485,"about_ca_topic_score_gemma":0.000042840125,"teacher_disagreement_score":0.17208233,"about_ca_system_score_codex":0.0005266553,"about_ca_system_score_gemma":0.0004898005,"threshold_uncertainty_score":0.99949944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023832145,0.00086330326,0.99567443,0.0006511637,0.0011377059,0.0008706691,0.000045372566,0.00026125697,0.00049371156],"genre_scores_gemma":[0.0021951408,0.00010826092,0.99481535,0.00048443623,0.0015916945,0.000041012834,0.000022200447,0.00008061084,0.00066131976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99323535,0.00003729535,0.0007171436,0.0031581204,0.0014702745,0.0013818422],"domain_scores_gemma":[0.9940215,0.00083507673,0.00025613394,0.0041782428,0.0003624732,0.0003466227],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0010768851,0.00071149983,0.0007115748,0.00091647316,0.00040299323,0.000874803,0.011523158,0.00038949816,0.000012039378],"category_scores_gemma":[0.00016008443,0.00068969146,0.00012905439,0.00064565346,0.0006921638,0.001175692,0.009239799,0.0010257177,0.000043387765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027856825,0.000021457123,0.0000016173171,0.000035799058,0.000011250009,0.00008229632,0.000112305264,0.074408084,0.000036325906,0.0007393114,0.000019185885,0.92452955],"study_design_scores_gemma":[0.00038683714,0.00015314436,0.000018222192,0.00012933357,0.0000075723374,0.0002253043,1.1733442e-7,0.9514332,0.00015333421,0.041727662,0.0050331457,0.0007321634],"about_ca_topic_score_codex":0.000028086339,"about_ca_topic_score_gemma":0.00009133159,"teacher_disagreement_score":0.9237974,"about_ca_system_score_codex":0.0006713099,"about_ca_system_score_gemma":0.0008468619,"threshold_uncertainty_score":0.9995554},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006311308,0.0005843301,0.99416965,0.00024897145,0.0011997736,0.00036014244,0.0000103520715,0.0000732745,0.0027223933],"genre_scores_gemma":[0.6313078,0.00008434932,0.36768973,0.00043190518,0.0002410624,0.000011722552,0.000010212321,0.0000331565,0.00019011323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956163,0.000024051846,0.00074515963,0.0016726858,0.0011779158,0.00076384534],"domain_scores_gemma":[0.99798095,0.00019872683,0.00027921086,0.0013262185,0.00005619158,0.00015869201],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007346016,0.00056544936,0.0006227403,0.00068022456,0.00014947384,0.0007711061,0.0033324151,0.00036434262,0.000025453277],"category_scores_gemma":[0.000034456894,0.0005171613,0.00011656165,0.00061544566,0.00046750891,0.0010963733,0.0010864694,0.0007872398,0.00008923388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009945314,0.00006819666,0.00006305722,0.000028351802,0.0000062213353,0.00038110887,0.00047512335,0.5875461,0.00016191216,0.062147792,0.00001259705,0.3490996],"study_design_scores_gemma":[0.0021273794,0.0004536759,0.0025560826,0.0031777099,0.000008458031,0.00020277027,0.0000012253936,0.71273977,0.0011079161,0.26292354,0.012485786,0.002215716],"about_ca_topic_score_codex":0.000070264236,"about_ca_topic_score_gemma":0.000088367204,"teacher_disagreement_score":0.6306766,"about_ca_system_score_codex":0.0003444044,"about_ca_system_score_gemma":0.0006132371,"threshold_uncertainty_score":0.999728},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022038679,0.00006414013,0.9938687,0.00060717564,0.00046349445,0.0021652896,0.0000064940245,0.00028689596,0.0023174325],"genre_scores_gemma":[0.64694345,0.000036275356,0.3432113,0.005222172,0.0014021386,0.0008076504,0.00041899082,0.00012516922,0.0018328595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973665,0.0000057527486,0.0005338129,0.0010343018,0.00056740665,0.0004922239],"domain_scores_gemma":[0.9982318,0.00004072428,0.00023782035,0.00065311743,0.0008077052,0.000028800892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010142281,0.00043576787,0.00034615028,0.00065454765,0.00027539712,0.00024813277,0.00076640677,0.00018898268,0.000077838806],"category_scores_gemma":[0.000084004256,0.0003569427,0.00009329084,0.0005869579,0.00041883267,0.0006206428,0.0002489624,0.00026928785,0.000058454287],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009181712,0.00022716993,0.0008585435,0.0026300605,0.000030232573,0.000005711811,0.0003890365,0.056497082,0.000035977555,0.006855017,0.00009645591,0.9322829],"study_design_scores_gemma":[0.00071586185,0.00034817093,0.00042068056,0.0013529735,0.00010375232,0.0000016698957,0.0000033553717,0.7916129,0.0004465389,0.029501628,0.17388046,0.0016119665],"about_ca_topic_score_codex":0.000383414,"about_ca_topic_score_gemma":0.00097295834,"teacher_disagreement_score":0.9306709,"about_ca_system_score_codex":0.0001416314,"about_ca_system_score_gemma":0.00017042791,"threshold_uncertainty_score":0.99988824},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004934128,0.000054573135,0.99151117,0.0008359323,0.0012281345,0.00041757416,0.000026025851,0.00007229483,0.0053608892],"genre_scores_gemma":[0.7710382,0.000016728694,0.22630876,0.00224538,0.0003142754,0.000015193029,0.000008133659,0.000024862333,0.000028502365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969047,0.000055207358,0.00048358564,0.0011311718,0.0009914521,0.000433924],"domain_scores_gemma":[0.995174,0.0015561804,0.00033474094,0.0026604,0.00016744083,0.00010723136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016446541,0.00038297434,0.0004101541,0.00040193993,0.00024321796,0.00029047995,0.0050440375,0.0002896331,0.000043145472],"category_scores_gemma":[0.0002769527,0.0002495394,0.00017270495,0.0005848788,0.001735603,0.00029471182,0.0013582503,0.0012574521,0.000019108396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004914153,0.000044613298,0.000018687719,0.00003398035,0.0000053830945,0.000008065128,0.00047295378,0.0004978336,0.00018878566,0.9099829,0.000012979475,0.08872888],"study_design_scores_gemma":[0.00009829006,0.0001547475,0.00017535478,0.0001916157,0.000004719651,0.000013586475,5.249045e-8,0.026665641,0.0019341494,0.9694401,0.0009951397,0.00032658587],"about_ca_topic_score_codex":0.000025124638,"about_ca_topic_score_gemma":0.00012684181,"teacher_disagreement_score":0.77054477,"about_ca_system_score_codex":0.000055683202,"about_ca_system_score_gemma":0.00027586086,"threshold_uncertainty_score":0.9999957},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003263115,0.00043029562,0.9918714,0.00031279694,0.0020602688,0.00082278973,0.0000010951089,0.00013677179,0.0043319454],"genre_scores_gemma":[0.6315156,0.00001823405,0.36681947,0.000286049,0.0008896108,0.000045699282,0.000011767795,0.000036730202,0.00037683715],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969651,0.000031186413,0.0006553628,0.000998188,0.00067605625,0.0006741027],"domain_scores_gemma":[0.99811614,0.0005714065,0.0003459424,0.00063249614,0.00018660886,0.00014739405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013307411,0.00040468707,0.0005119438,0.0006741078,0.00016015615,0.0004374193,0.0013686394,0.00038728505,0.000014101056],"category_scores_gemma":[0.00006805201,0.00034526607,0.00013247137,0.0003768603,0.00024542725,0.0007084904,0.00034973968,0.00048850337,0.000111989364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005447331,0.00007576032,0.00005851318,0.00013992944,0.000007986163,0.000019260477,0.0010386591,0.0041877553,0.000049862425,0.29737198,0.000027403472,0.69701743],"study_design_scores_gemma":[0.00033261674,0.00014174408,0.00016552924,0.00009711591,0.000007540922,0.000073041214,3.0511399e-7,0.31522673,0.00049071584,0.6788874,0.0040703123,0.00050692254],"about_ca_topic_score_codex":0.0000161484,"about_ca_topic_score_gemma":0.00005142366,"teacher_disagreement_score":0.6965105,"about_ca_system_score_codex":0.00031518767,"about_ca_system_score_gemma":0.0002180677,"threshold_uncertainty_score":0.9998999},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000710915,0.0006283005,0.99453545,0.0012197627,0.0005365623,0.00039472128,0.0000051595803,0.000026770525,0.0019423872],"genre_scores_gemma":[0.8436367,0.000033479966,0.15556486,0.0006264142,0.00006372358,0.000006362838,0.000001954641,0.0000107414535,0.00005574125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976413,0.0002005208,0.00048103428,0.0005509192,0.00082437403,0.0003018246],"domain_scores_gemma":[0.9957871,0.0025170885,0.0005138621,0.00090196816,0.00021397266,0.00006604192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029815426,0.00026845396,0.0004262425,0.00023985618,0.00023590485,0.00013182958,0.0017015474,0.00012859207,0.000040181498],"category_scores_gemma":[0.00033976487,0.00015388022,0.00009677774,0.00039617842,0.0018756903,0.00025665425,0.0005200717,0.00047651824,0.000003894965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052246432,0.000029619689,0.00010934064,0.000041853153,0.000019318812,0.0000017356832,0.008258372,0.0060279043,0.00009323148,0.739176,0.000013681198,0.24617672],"study_design_scores_gemma":[0.00053790666,0.000077183584,0.001639386,0.00018108683,0.000008414619,0.000008435659,0.0000060015295,0.5166963,0.00058209256,0.47922173,0.00082299166,0.00021849909],"about_ca_topic_score_codex":0.000032997817,"about_ca_topic_score_gemma":0.00002167838,"teacher_disagreement_score":0.8429258,"about_ca_system_score_codex":0.000033887925,"about_ca_system_score_gemma":0.0002090662,"threshold_uncertainty_score":0.6911059},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03169113,0.000111412104,0.9667596,0.00076817814,0.00017780403,0.00025968376,0.0000025943928,0.00013359544,0.00009598007],"genre_scores_gemma":[0.5074783,0.000002952971,0.4916479,0.0005633849,0.00027850605,0.000013183784,0.00000152697,0.000010210854,0.000004026199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998548,0.00003480874,0.00024165514,0.0004937002,0.00025368223,0.00042819927],"domain_scores_gemma":[0.99924695,0.00008754606,0.00009819508,0.00042348405,0.000072007264,0.00007178614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002582697,0.00019215247,0.00019483255,0.00015728135,0.00015531913,0.00012565748,0.0005256778,0.00003607523,0.00008729297],"category_scores_gemma":[0.0000074895715,0.00016352831,0.000049754144,0.0007951373,0.0002498423,0.00041264313,0.000075304,0.00022028331,0.0000046079895],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005661946,0.00005741877,0.007969219,0.0000015312237,0.000004903325,0.0000015660077,0.0003801666,0.06703469,0.012548923,0.00013852019,0.000014249615,0.9118432],"study_design_scores_gemma":[0.0012682287,0.00023578483,0.015360496,0.000080442995,0.00000496328,0.000024054913,7.842406e-7,0.7067247,0.2529093,0.016370703,0.00623448,0.00078605],"about_ca_topic_score_codex":0.000044123535,"about_ca_topic_score_gemma":0.000009781795,"teacher_disagreement_score":0.9110571,"about_ca_system_score_codex":0.000108885564,"about_ca_system_score_gemma":0.0001021728,"threshold_uncertainty_score":0.6668491},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033884952,0.0003345948,0.99680024,0.0001320935,0.0003166882,0.0006552848,0.000011822725,0.00023127523,0.0011791331],"genre_scores_gemma":[0.1829081,0.000048819453,0.81665003,0.0002116222,0.00007578686,0.000011195107,0.000009578164,0.000023652561,0.000061212995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975194,0.000047769587,0.0006451273,0.0008596517,0.000568934,0.00035911755],"domain_scores_gemma":[0.99747276,0.0003968799,0.0004636457,0.0012024139,0.0003896675,0.00007465779],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010418488,0.00033287736,0.00042396277,0.00073005137,0.0002765835,0.00017329783,0.0022981875,0.00027818314,0.00000534608],"category_scores_gemma":[0.00007003838,0.0003239115,0.00012622678,0.00046855333,0.00042333236,0.00020814574,0.00059249485,0.0003467246,0.000001828255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009106849,0.000028226292,0.00000899483,0.000037808724,0.000005469494,5.017109e-7,0.00047978174,0.89988387,0.000044534816,0.0023607777,0.00000777926,0.09713313],"study_design_scores_gemma":[0.00028829166,0.000090531845,0.00001615287,0.0004933831,0.000009105327,0.0000120053,8.9645056e-8,0.9670106,0.0015574791,0.030045614,0.00019935967,0.00027738733],"about_ca_topic_score_codex":0.000016521808,"about_ca_topic_score_gemma":0.0000045031034,"teacher_disagreement_score":0.18256925,"about_ca_system_score_codex":0.00019664265,"about_ca_system_score_gemma":0.00029119977,"threshold_uncertainty_score":0.9999213},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001277683,0.0011005853,0.9891058,0.002780756,0.0028876916,0.0016656617,0.00004091388,0.00086963165,0.00027128385],"genre_scores_gemma":[0.4105677,0.00005820117,0.58645386,0.0018301194,0.00048487185,0.00011770569,0.000018221042,0.000068104746,0.00040119927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936384,0.00004812797,0.0009105946,0.0021938535,0.0018961086,0.0013129122],"domain_scores_gemma":[0.9948032,0.0007205154,0.00036640817,0.0020613144,0.0017800789,0.00026846322],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010949277,0.00086675066,0.0010357249,0.0017213036,0.00060308113,0.00088065484,0.0060543413,0.00061917026,8.7619463e-7],"category_scores_gemma":[0.00035956572,0.0008182926,0.0002834095,0.0010916643,0.0007603389,0.00058474304,0.0021195707,0.00090481376,0.00001992123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002600029,0.000053770786,0.00003958802,0.00008703726,0.000033076085,0.00008295163,0.000744067,0.81482434,0.00023117289,0.006861081,0.00023365425,0.17678326],"study_design_scores_gemma":[0.0004736151,0.00032182864,0.000041024563,0.000723912,0.000014024144,0.0000553989,0.0000013166502,0.9890088,0.00092098047,0.004703155,0.002790097,0.0009458358],"about_ca_topic_score_codex":0.00026404278,"about_ca_topic_score_gemma":0.00016959509,"teacher_disagreement_score":0.40929005,"about_ca_system_score_codex":0.0011076917,"about_ca_system_score_gemma":0.0011501347,"threshold_uncertainty_score":0.9994268},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000072237594,0.00053985196,0.9959463,0.0010411869,0.0012709956,0.0005550455,0.000018639204,0.00014978799,0.00047098243],"genre_scores_gemma":[0.009924091,0.000050341307,0.9871607,0.0012093632,0.0007356116,0.000007730045,0.000018037706,0.00004029387,0.00085383153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964294,0.00004906116,0.0003293562,0.0021160091,0.00047656044,0.0005996015],"domain_scores_gemma":[0.99670225,0.0010112725,0.00022617463,0.0016890366,0.00019207719,0.00017916795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012696934,0.00051183946,0.0005396964,0.0004832083,0.0003546495,0.00063274766,0.0033217184,0.00043759955,0.0000024331744],"category_scores_gemma":[0.00018313831,0.00045594276,0.00006904124,0.00033001136,0.00032945542,0.00050727493,0.002557394,0.00069903577,0.0000031350214],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009785838,0.0000073188235,0.0000038843436,0.000082169245,0.000008597535,0.000015059679,0.00019410027,0.012742178,0.0002146825,0.007805247,0.00008808155,0.9788289],"study_design_scores_gemma":[0.00023428033,0.0002127433,0.000005472028,0.00022714774,0.000012387046,0.00017266201,3.9116948e-8,0.9242053,0.00014416984,0.06830184,0.005988832,0.000495099],"about_ca_topic_score_codex":0.000009898493,"about_ca_topic_score_gemma":0.000113284004,"teacher_disagreement_score":0.9783338,"about_ca_system_score_codex":0.000114842485,"about_ca_system_score_gemma":0.00024372332,"threshold_uncertainty_score":0.99978924},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021107048,0.00011770765,0.98752713,0.005567063,0.0011048238,0.00040662906,0.000012585606,0.00046326517,0.0045897383],"genre_scores_gemma":[0.74358547,0.000113809605,0.24696556,0.00839959,0.00049344235,0.00001669601,0.00004913013,0.000029257584,0.00034706827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997047,0.00003233365,0.00050545577,0.00082699524,0.0011502017,0.00043798386],"domain_scores_gemma":[0.99651206,0.0010028982,0.00037108408,0.0018489257,0.00018809858,0.00007691594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061374024,0.00041021316,0.00029543438,0.00054878526,0.00032719088,0.00090348156,0.0043203705,0.00035957884,0.00003966941],"category_scores_gemma":[0.00032495658,0.00028931827,0.00010979323,0.0006722798,0.00061780214,0.0009203049,0.0007132718,0.0008562055,0.00017302488],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022773134,0.000024503597,0.000091542606,0.0000055997116,0.0000056792887,0.000013410536,0.00041144164,0.04451856,0.000030145522,0.015679585,0.00021695867,0.9389798],"study_design_scores_gemma":[0.00045800777,0.00014049206,0.00042785372,0.00016365535,0.000004864393,0.000004917421,6.330976e-7,0.8874511,0.0009736514,0.08609017,0.02382891,0.00045574055],"about_ca_topic_score_codex":0.000018034412,"about_ca_topic_score_gemma":0.000025340702,"teacher_disagreement_score":0.93852407,"about_ca_system_score_codex":0.0002338332,"about_ca_system_score_gemma":0.0005273086,"threshold_uncertainty_score":0.9999559},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021280404,0.00015517426,0.994673,0.00007911447,0.00201796,0.0004997073,0.000039631057,0.000080889215,0.0003264573],"genre_scores_gemma":[0.5202145,0.000062076266,0.47855234,0.00020736278,0.0007138665,0.000030311445,0.00011208311,0.000037616235,0.00006986416],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976549,0.000027672235,0.0004906573,0.00078147545,0.0006301335,0.00041515828],"domain_scores_gemma":[0.99814767,0.00046663455,0.00045079162,0.00052248244,0.00029184952,0.000120553705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005186834,0.00032963936,0.00037614186,0.0005815602,0.00019982099,0.00014645867,0.0009739739,0.00032251445,0.00003086142],"category_scores_gemma":[0.00012151188,0.00028522566,0.00015270805,0.00024835856,0.00016220602,0.0009779144,0.0003907334,0.00028792158,0.000013952335],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019836645,0.00005787712,0.00015621273,0.00009931588,0.000007845604,0.0000017930361,0.0020604515,0.0015425654,0.011738343,0.0007985661,0.000020205673,0.98349696],"study_design_scores_gemma":[0.0010906302,0.00041778636,0.0006142852,0.002329691,0.00004798507,0.000012909619,0.000002048303,0.3151087,0.3171873,0.36045587,0.001234301,0.0014984851],"about_ca_topic_score_codex":0.000006989499,"about_ca_topic_score_gemma":0.000006707537,"teacher_disagreement_score":0.9819985,"about_ca_system_score_codex":0.00012695012,"about_ca_system_score_gemma":0.0001522679,"threshold_uncertainty_score":0.99996},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008429357,0.0005496668,0.9860998,0.000077704084,0.0015818753,0.00052506226,0.000017601024,0.00042557856,0.01063843],"genre_scores_gemma":[0.43353102,0.00016292301,0.5583275,0.0010373715,0.0007696292,0.0000765357,0.000013210958,0.0002893386,0.005792492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767745,0.000003697405,0.00037381003,0.0007320396,0.0005100979,0.00070293766],"domain_scores_gemma":[0.99878174,0.00015275925,0.00006585406,0.0007515475,0.00011800849,0.0001300721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030606604,0.00051380455,0.00044391918,0.0006209323,0.00012349588,0.00016970462,0.0010532226,0.00035378078,0.0000752842],"category_scores_gemma":[0.000021994121,0.00049017416,0.00012845376,0.0002675391,0.0002645418,0.00033931824,0.00015975177,0.00055467256,0.00009646149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034557818,0.0000071951486,0.000002456988,0.00007196386,0.0000108341865,0.000007552212,0.00048221674,0.9443843,0.0001603882,0.0013644953,0.00045182317,0.053053327],"study_design_scores_gemma":[0.00023286506,0.00006585963,0.000003263263,0.0002100282,0.0000092986775,0.000014619967,3.321585e-8,0.97051215,0.0022509892,0.023029882,0.0030994925,0.0005715344],"about_ca_topic_score_codex":0.0000013437054,"about_ca_topic_score_gemma":0.0000062944764,"teacher_disagreement_score":0.4334467,"about_ca_system_score_codex":0.00032232897,"about_ca_system_score_gemma":0.00010914119,"threshold_uncertainty_score":0.99975497},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010871337,0.00048674276,0.9899627,0.0013895712,0.0017571062,0.00083468197,0.000004549479,0.00014610779,0.0043313988],"genre_scores_gemma":[0.36082366,0.00004974645,0.6354279,0.0026473512,0.00049042125,0.00008055242,0.0000074903596,0.00006265529,0.00041020598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99465233,0.00011649824,0.0009604194,0.0017835291,0.0014679085,0.0010193099],"domain_scores_gemma":[0.99581355,0.0014927776,0.00050380593,0.0018126087,0.0002188555,0.00015838965],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002307583,0.0006910594,0.0006823339,0.0011999416,0.0005456554,0.0012023952,0.0062941248,0.00035779725,0.00004507455],"category_scores_gemma":[0.00023409045,0.00051722204,0.00022347516,0.0013458346,0.001046508,0.00082342315,0.0029182283,0.0018879606,0.00004497238],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037607783,0.000046663386,0.00012344007,0.00006563273,0.000015837712,0.00009948976,0.0056230817,0.0077448306,0.00009997287,0.09008908,0.000038561146,0.8960497],"study_design_scores_gemma":[0.00026574507,0.0000661064,0.00024441676,0.0003792654,0.0000037856935,0.00007756079,0.0000025212705,0.62646955,0.0001783616,0.37153926,0.00024613575,0.0005272493],"about_ca_topic_score_codex":0.00011961896,"about_ca_topic_score_gemma":0.00020959767,"teacher_disagreement_score":0.8955224,"about_ca_system_score_codex":0.0002711218,"about_ca_system_score_gemma":0.0003540358,"threshold_uncertainty_score":0.9998345},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011175344,0.00022201215,0.99565244,0.0014999025,0.00042115664,0.0004964814,0.0000034873594,0.00009473372,0.00049223483],"genre_scores_gemma":[0.778084,0.00004608127,0.22084853,0.00057554065,0.00009084239,0.000021412536,0.0000025666943,0.000045231263,0.00028583826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647427,0.00015983309,0.0006155204,0.001063856,0.001062776,0.00062376074],"domain_scores_gemma":[0.98939615,0.008538521,0.000197181,0.0016038318,0.00013900388,0.00012529765],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0030459,0.0003906685,0.0004193699,0.0010702852,0.00013752918,0.00019876695,0.0038352718,0.00020022898,0.000025299049],"category_scores_gemma":[0.0017101713,0.0002899531,0.00008768363,0.0012185281,0.00064741273,0.00026254915,0.0010111587,0.0024088724,0.00002244611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060714425,0.00012555056,0.016862148,0.00006618254,0.000024510588,0.00049806235,0.0028043934,0.6308303,0.000060596012,0.09592849,0.00010283654,0.25263622],"study_design_scores_gemma":[0.00022191698,0.00023512551,0.0041165403,0.00053239806,0.0000017287641,0.000045282803,9.350231e-8,0.6634936,0.0003188902,0.33051047,0.00013681885,0.0003871341],"about_ca_topic_score_codex":0.000030652078,"about_ca_topic_score_gemma":0.00018483071,"teacher_disagreement_score":0.77696645,"about_ca_system_score_codex":0.00038906612,"about_ca_system_score_gemma":0.0005247222,"threshold_uncertainty_score":0.99995524},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063379686,0.000911397,0.9852583,0.000574166,0.002138195,0.00081966247,0.000008143635,0.00016720557,0.0037849674],"genre_scores_gemma":[0.6980774,0.00001696443,0.30036232,0.00076206436,0.0004606417,0.000038055172,0.000006828195,0.00002821237,0.00024757412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588764,0.000074335265,0.0006845724,0.0013608575,0.0014619869,0.0005305934],"domain_scores_gemma":[0.99645406,0.00070447766,0.00052310165,0.0011177704,0.0011415139,0.000059097914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026396515,0.0005055419,0.0006990162,0.0009099106,0.00029324758,0.00019674664,0.0025510397,0.00044538296,0.000017348011],"category_scores_gemma":[0.00015886346,0.00044737008,0.00016306374,0.0004886211,0.0010882921,0.0003989881,0.0011831097,0.00047487894,0.000015437692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007989596,0.000050882187,0.000069939044,0.0000932828,0.00006922495,0.0000092404625,0.0017064149,0.06533891,0.0000693471,0.020818314,0.00046143535,0.911305],"study_design_scores_gemma":[0.0005588112,0.00040365203,0.00033922849,0.00041207136,0.000072016635,0.000034759385,8.437496e-7,0.70282054,0.0016864936,0.29029995,0.0027515113,0.0006200878],"about_ca_topic_score_codex":0.000051372277,"about_ca_topic_score_gemma":0.00042728806,"teacher_disagreement_score":0.91068494,"about_ca_system_score_codex":0.00024887754,"about_ca_system_score_gemma":0.0005672654,"threshold_uncertainty_score":0.9997978},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000930688,0.00015482816,0.99663603,0.000686057,0.0008924152,0.00037644396,0.000021766804,0.00006903017,0.001070346],"genre_scores_gemma":[0.112753265,0.000007291884,0.8866325,0.00018304268,0.00021016008,0.000011715349,0.00002058082,0.000019660582,0.00016180411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974847,0.000016467404,0.00053302525,0.00092720304,0.0005505053,0.0004881204],"domain_scores_gemma":[0.99833727,0.00051910005,0.00027224125,0.0005908408,0.00013966173,0.00014088635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006025425,0.00034180962,0.00047508322,0.00070928375,0.00015021267,0.00014924939,0.0017411648,0.00018973685,0.000006578455],"category_scores_gemma":[0.00013841914,0.0003318793,0.00013043113,0.00069259974,0.00026742212,0.0003299089,0.00037982065,0.00057262264,0.000004601443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038024898,0.000016919119,0.000051352323,0.000043012733,0.0000056440726,0.00001571765,0.0016797973,0.18737692,0.000053467782,0.075472414,0.000017491737,0.73526347],"study_design_scores_gemma":[0.0004777075,0.00017057528,0.00082255737,0.00059048116,0.000004481849,0.00001835464,7.921766e-7,0.67697257,0.00012871798,0.32005706,0.00039375783,0.00036293684],"about_ca_topic_score_codex":0.00013660711,"about_ca_topic_score_gemma":0.000046743353,"teacher_disagreement_score":0.73490053,"about_ca_system_score_codex":0.00023066242,"about_ca_system_score_gemma":0.0018529424,"threshold_uncertainty_score":0.99991333},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042395567,0.00052064366,0.9939794,0.0023092786,0.001257079,0.00084120466,0.0000098315795,0.00022352753,0.00043508594],"genre_scores_gemma":[0.07240476,0.000115657574,0.92449164,0.0020369801,0.0006102935,0.00007766294,0.000010967085,0.00002507016,0.00022696263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731964,0.00003272047,0.00046547147,0.0013058514,0.00042207455,0.00045426804],"domain_scores_gemma":[0.9977125,0.00078361627,0.00030699495,0.000738963,0.00037792206,0.000079982434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060854043,0.00045088519,0.0005362623,0.00063424895,0.00047870865,0.0004499239,0.0011358615,0.000381779,0.000004696],"category_scores_gemma":[0.000113005706,0.00041254106,0.000074351396,0.0004926497,0.00078833813,0.0010773017,0.0007606988,0.00041319357,0.000008337874],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009694419,0.000022668273,0.000011501416,0.00003684972,0.000022272849,0.00001035893,0.0036829882,0.0027223888,0.000041417097,0.10474999,0.0002589516,0.8884309],"study_design_scores_gemma":[0.0005212626,0.0004966392,0.0001405528,0.00018093399,0.000014920571,0.000031524563,0.0000013794021,0.59087116,0.0003720331,0.3982311,0.008507647,0.00063082954],"about_ca_topic_score_codex":0.0000037662294,"about_ca_topic_score_gemma":0.00014470294,"teacher_disagreement_score":0.8878001,"about_ca_system_score_codex":0.00016587997,"about_ca_system_score_gemma":0.00019307806,"threshold_uncertainty_score":0.99983263},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006894875,0.0009794716,0.9915571,0.00008627787,0.005121632,0.0003053764,0.000001073017,0.00022181796,0.0010377485],"genre_scores_gemma":[0.23794323,0.000018896055,0.7569866,0.00052465725,0.0033755493,0.000005570791,0.0000040148816,0.000058613092,0.0010828451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961976,0.000071097784,0.00063984294,0.0012179447,0.0010402778,0.00083325105],"domain_scores_gemma":[0.997876,0.00020490665,0.0004996377,0.00096641417,0.0002748287,0.00017824011],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013627372,0.0005272008,0.0004948144,0.0006626376,0.00052730023,0.0010655685,0.0018917641,0.00030723124,0.0000264323],"category_scores_gemma":[0.00009118463,0.0004935571,0.00013827397,0.0003983325,0.00019481202,0.001386413,0.0010343493,0.000819038,0.00009396582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.0013134e-7,0.00001599406,0.00015257033,0.000041284235,0.000014192349,0.000037342958,0.0011354444,0.083633885,0.0035252653,0.05391116,0.000007863027,0.8575241],"study_design_scores_gemma":[0.00009325571,0.000058558293,0.00008966383,0.00057313003,0.000007818208,0.00010918167,2.9007364e-7,0.99029666,0.00183566,0.0021999108,0.0041093514,0.0006265477],"about_ca_topic_score_codex":0.00006676915,"about_ca_topic_score_gemma":0.000020687936,"teacher_disagreement_score":0.90666276,"about_ca_system_score_codex":0.0006171177,"about_ca_system_score_gemma":0.00035025258,"threshold_uncertainty_score":0.99997145},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007838972,0.000015403433,0.99382716,0.000844693,0.0003109918,0.0016535969,0.00012079653,0.00026489244,0.0028840688],"genre_scores_gemma":[0.7790753,0.0000047200765,0.21747206,0.0013725202,0.00093452825,0.0001156997,0.00003736491,0.00005053382,0.0009372287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942311,0.00009175961,0.0012039657,0.001708408,0.0021665865,0.0005981917],"domain_scores_gemma":[0.99473643,0.0021491074,0.0005505798,0.00156911,0.00069994683,0.00029484584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036910675,0.00047006842,0.0007303457,0.000936837,0.00034521433,0.00080974656,0.0026245685,0.000318298,0.00034918875],"category_scores_gemma":[0.0002941246,0.00037583333,0.00017098707,0.0010362203,0.00029759752,0.00026789724,0.00048651712,0.00039789188,0.0005079621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013547445,0.000022285272,0.00023857364,0.000009023889,0.0000075335943,0.00002545151,0.00020053901,0.13571623,0.00022166972,0.001266881,0.00074472016,0.8615335],"study_design_scores_gemma":[0.00032882404,0.00030591653,0.00043288642,0.00031652395,0.00001846338,0.000047319383,6.4202965e-7,0.96648246,0.0005949043,0.020033533,0.010747475,0.00069107336],"about_ca_topic_score_codex":0.000027719585,"about_ca_topic_score_gemma":0.000017275263,"teacher_disagreement_score":0.86084247,"about_ca_system_score_codex":0.00051018404,"about_ca_system_score_gemma":0.0004250752,"threshold_uncertainty_score":0.99986935},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018366743,0.00046695498,0.9773161,0.0007740016,0.0010010125,0.00028414125,0.0000016209406,0.005742859,0.014394947],"genre_scores_gemma":[0.043768533,0.0000107869755,0.95237803,0.0029266546,0.0004492493,0.0000059470676,0.0000023899204,0.000038332557,0.0004200424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99549896,0.00003555194,0.0005971896,0.0018373263,0.0011376496,0.0008933328],"domain_scores_gemma":[0.99534464,0.0017086597,0.0003695844,0.0019585786,0.0003909816,0.00022754134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012223542,0.00065351627,0.0005961014,0.0011428946,0.00036095077,0.0007832756,0.0045391642,0.0003745154,0.000008503565],"category_scores_gemma":[0.0011041767,0.0006176058,0.00012920113,0.0012279832,0.00048236907,0.00054121565,0.0013746355,0.0010777791,0.0000613045],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011851739,0.000016931184,0.00017128458,0.000013023429,0.0000028389707,0.0001403334,0.00013055265,0.0025511493,0.000029690747,0.0030192044,0.00027973278,0.99364406],"study_design_scores_gemma":[0.00013532458,0.00030218204,0.0006518925,0.0008021158,0.0000055621204,0.0002801316,7.670215e-9,0.2640119,0.00037302193,0.7304015,0.0021996521,0.00083668716],"about_ca_topic_score_codex":0.00004593626,"about_ca_topic_score_gemma":0.000008593782,"teacher_disagreement_score":0.9928074,"about_ca_system_score_codex":0.00031773886,"about_ca_system_score_gemma":0.0006655377,"threshold_uncertainty_score":0.99962753},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001731184,0.00069770217,0.99551356,0.00008765794,0.00038801038,0.00017676438,0.00004407656,0.00005374896,0.0013072694],"genre_scores_gemma":[0.9127938,0.000120097735,0.08461259,0.0012789551,0.000674484,0.000009430957,0.0000750875,0.000042608637,0.00039295937],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99798536,0.000016256547,0.0002629865,0.001002156,0.0003543281,0.00037892215],"domain_scores_gemma":[0.9988041,0.00005447658,0.00017756944,0.00059314177,0.0002522084,0.00011851979],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038699148,0.00036936253,0.0003250342,0.0002379665,0.00015146408,0.00008727212,0.0006144497,0.00040689178,0.0000022690772],"category_scores_gemma":[0.00014251324,0.0003024093,0.00016808677,0.00012213162,0.00047616963,0.000008406188,0.00024095149,0.00018582621,0.0000014243691],"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.00007642883,0.000028611954,0.000004297692,0.000029083198,0.000041286174,0.000021952117,0.000049439393,0.0030172241,0.52874494,0.0052922876,0.00035760098,0.46233684],"study_design_scores_gemma":[0.00018799081,0.00069507136,8.3563583e-7,0.00022043432,0.000018023484,0.00001986984,3.091475e-7,0.008851686,0.8523203,0.12954327,0.007566073,0.0005760917],"about_ca_topic_score_codex":0.0000049411087,"about_ca_topic_score_gemma":0.000044811266,"teacher_disagreement_score":0.9110626,"about_ca_system_score_codex":0.000107758715,"about_ca_system_score_gemma":0.0002863204,"threshold_uncertainty_score":0.9999428},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4881794,0.00008448444,0.51145047,0.000014748548,0.00017950716,0.000053076055,0.0000022664922,0.0000119493025,0.000024117076],"genre_scores_gemma":[0.6176582,0.000005537029,0.38225454,0.000011805586,0.000063652806,1.9751143e-7,0.0000018714587,0.0000036983074,5.081816e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999084,0.000014710026,0.0002026476,0.00027164663,0.0002541403,0.00017286511],"domain_scores_gemma":[0.9991065,0.00013070788,0.00009193583,0.0005180515,0.00011022983,0.000042535605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034395215,0.00008526279,0.0001796292,0.00023429924,0.00004912816,0.000014772989,0.0003391133,0.000034257726,0.000012468063],"category_scores_gemma":[0.00018219766,0.00007318525,0.000018705185,0.000889286,0.00043871326,0.00038119275,0.0001020732,0.000100316254,0.000001346958],"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.000025361363,0.00006533838,0.31518668,0.00005302405,0.000009634937,0.0000016421125,0.0020941505,0.0014455809,0.64550066,0.0000030926353,0.0000012451817,0.03561361],"study_design_scores_gemma":[0.0002877501,0.00027492453,0.18797506,0.00045266043,0.00003464644,0.00014747867,0.0000074486757,0.019269267,0.79040134,0.0009697949,0.00003314449,0.00014648364],"about_ca_topic_score_codex":0.00016090677,"about_ca_topic_score_gemma":0.0000022652068,"teacher_disagreement_score":0.1449007,"about_ca_system_score_codex":0.000018332268,"about_ca_system_score_gemma":0.000085485306,"threshold_uncertainty_score":0.29844078},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018598405,0.00036821511,0.9843492,0.0023925335,0.0018273045,0.00061697274,0.000009831445,0.00010085641,0.008475238],"genre_scores_gemma":[0.84057856,0.000058815134,0.15258408,0.0055754944,0.0008716886,0.00004645727,0.000021290296,0.000052339252,0.00021126123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99544114,0.00008765308,0.0006110958,0.0014494617,0.001629763,0.00078091415],"domain_scores_gemma":[0.9969614,0.00055769586,0.00025258266,0.0018275054,0.0002348254,0.00016594738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019757217,0.0005233671,0.00046051154,0.001137361,0.00034148432,0.0008212976,0.004467439,0.00024998692,0.000028325061],"category_scores_gemma":[0.000076463424,0.0004106432,0.0001486152,0.0012854981,0.00060119136,0.0005351318,0.00076427707,0.0008992109,0.000045616332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015144048,0.00017214699,0.000079502424,0.00003951906,0.000017302555,0.0002555244,0.010817066,0.0064919693,0.000041887393,0.6555722,0.0012342294,0.3252635],"study_design_scores_gemma":[0.0008473905,0.00068498583,0.00031759334,0.00042264257,0.000013056274,0.00015119778,0.0000063054486,0.0768572,0.00018308336,0.8948593,0.024458535,0.0011986746],"about_ca_topic_score_codex":0.00007155983,"about_ca_topic_score_gemma":0.0006348989,"teacher_disagreement_score":0.8387187,"about_ca_system_score_codex":0.0003432199,"about_ca_system_score_gemma":0.00054638303,"threshold_uncertainty_score":0.99983454},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000069130665,0.00039758033,0.94726723,0.00037908976,0.0021728731,0.0004073264,0.0000014308814,0.00029898892,0.04906859],"genre_scores_gemma":[0.71900195,0.00019339974,0.26810163,0.0028404207,0.0020248136,0.000035782687,0.000032691023,0.00009929746,0.0076700426],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958877,0.000043885786,0.000573613,0.0016122205,0.0010571169,0.0008254892],"domain_scores_gemma":[0.9975977,0.00015721757,0.0002693958,0.0015877737,0.0001873212,0.00020058535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009313534,0.00050928455,0.00052357983,0.00067164516,0.00030006267,0.0006754159,0.0033062254,0.0004224807,0.00011654192],"category_scores_gemma":[0.000041673782,0.0004466146,0.00015583556,0.00062322215,0.0005549184,0.0005698311,0.0007723822,0.00067170744,0.00040232993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005195501,0.000027338234,0.000028133449,0.000026305466,0.000009266961,0.00014614356,0.0005793098,0.003316969,0.000018851166,0.17735597,0.0001425632,0.81834394],"study_design_scores_gemma":[0.00039926977,0.0004304776,0.00008341864,0.00007107423,0.000010166694,0.00027690348,1.4110907e-7,0.14311035,0.00028204152,0.7391865,0.115097046,0.0010525666],"about_ca_topic_score_codex":0.00007194323,"about_ca_topic_score_gemma":0.00011632534,"teacher_disagreement_score":0.8172914,"about_ca_system_score_codex":0.00026695628,"about_ca_system_score_gemma":0.0006588471,"threshold_uncertainty_score":0.99979854},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018644729,0.00038112284,0.9966232,0.00003894222,0.0005101222,0.00036979263,0.000050466064,0.000091050526,0.0017488137],"genre_scores_gemma":[0.40420425,0.0013456375,0.5932659,0.00018155212,0.00041189478,0.000054686665,0.00019662693,0.00008447119,0.0002550021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988665,0.0000034966858,0.00034346475,0.00029234137,0.00026545633,0.00022876462],"domain_scores_gemma":[0.9994288,0.000070215305,0.000081971106,0.00024416356,0.00012871012,0.000046153713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013993142,0.00022580217,0.0002634344,0.0003341797,0.00013150765,0.000061586325,0.00033366212,0.0001868601,0.00000909056],"category_scores_gemma":[0.000012188536,0.00022487271,0.00007281614,0.0001415321,0.000115168434,0.00026322476,0.000021906804,0.00018238874,0.0000016700484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000281556,0.0000053047384,0.0000010477302,0.00013455458,0.000007247033,4.3452673e-7,0.00032525192,0.97744673,0.00025698025,0.0003341042,0.00012981989,0.021355696],"study_design_scores_gemma":[0.0002011825,0.000052579,0.000006773926,0.00008919657,0.000009432284,0.000004763178,7.254948e-8,0.97944254,0.014344478,0.0027746044,0.0028337145,0.00024064198],"about_ca_topic_score_codex":0.0000050887716,"about_ca_topic_score_gemma":0.000082604056,"teacher_disagreement_score":0.4040178,"about_ca_system_score_codex":0.00007034262,"about_ca_system_score_gemma":0.000087017615,"threshold_uncertainty_score":0.91700435},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035688315,0.0014408875,0.9617733,0.000011175759,0.00083914556,0.000116014446,0.000003199171,0.000007706698,0.000120287514],"genre_scores_gemma":[0.94587445,0.000121782534,0.052817527,0.00014897774,0.0009158603,7.998548e-7,0.000016034091,0.000024066563,0.000080497564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988287,0.000012267067,0.0001817787,0.0005000212,0.00022575248,0.000251463],"domain_scores_gemma":[0.99952054,0.000029243101,0.00010751301,0.00022947782,0.00005205964,0.00006118805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031904673,0.0002078029,0.00016888398,0.00025032143,0.00011867011,0.0001493416,0.00016020334,0.0002310876,0.000014985587],"category_scores_gemma":[0.000027816382,0.00019330386,0.000056200537,0.00012379342,0.00010716188,0.00002856116,0.0002503019,0.00016691515,9.0790655e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004425748,0.000014728505,0.0006214307,0.000052224128,0.000028751163,0.0000037331681,0.00010132564,0.16461253,0.39979511,0.000470729,0.0000017855697,0.43425336],"study_design_scores_gemma":[0.00052746217,0.000527974,0.00054117624,0.0002916223,0.000086124,0.00007575512,0.000001071682,0.7439848,0.23903148,0.01218822,0.0015664056,0.0011778676],"about_ca_topic_score_codex":0.000011478073,"about_ca_topic_score_gemma":0.00001992761,"teacher_disagreement_score":0.9101861,"about_ca_system_score_codex":0.000059047277,"about_ca_system_score_gemma":0.00006456634,"threshold_uncertainty_score":0.78827024},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029126398,0.000030499357,0.96828526,0.0009891666,0.00052264566,0.0004713592,0.000052229985,0.000016639142,0.0005057827],"genre_scores_gemma":[0.90573084,0.00002618097,0.09297871,0.0009429253,0.00010298822,0.000033470355,0.00005296688,0.000011620999,0.00012029282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848735,0.000018925895,0.00028327174,0.00072862755,0.00026502358,0.00021680033],"domain_scores_gemma":[0.9989599,0.00028594967,0.0001113568,0.0005253055,0.000035715533,0.0000817953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003498174,0.00019318248,0.0002282759,0.00015669655,0.0002841706,0.00004977689,0.0005555801,0.00015626592,0.00008528445],"category_scores_gemma":[0.00007006436,0.00017002816,0.000028176039,0.00014965085,0.00043622128,0.00025097348,0.0007265397,0.00023424832,0.0000041453745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011992013,0.000072195326,0.090905674,0.000036682748,0.000027931294,0.0000017552046,0.00031741612,0.8587518,0.0001715543,0.0014592136,0.00015417371,0.048089657],"study_design_scores_gemma":[0.00012469031,0.00024858068,0.043081928,0.000070529706,0.000027768685,0.000004731953,0.0000010153201,0.9189763,0.0000067169,0.03703997,0.00022417835,0.00019358147],"about_ca_topic_score_codex":0.000028132737,"about_ca_topic_score_gemma":0.00061748934,"teacher_disagreement_score":0.87660444,"about_ca_system_score_codex":0.00013264864,"about_ca_system_score_gemma":0.00008808941,"threshold_uncertainty_score":0.6933547},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039708975,0.00023509742,0.99615353,0.0000727546,0.00035980766,0.00012045495,0.0000041747307,0.00006227912,0.0029522122],"genre_scores_gemma":[0.26122433,0.000492891,0.7335972,0.0032306754,0.00049470813,0.0000026830917,0.000065963584,0.00006975022,0.00082176394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784774,0.00001866751,0.00043276788,0.00074701017,0.00066415465,0.0002896919],"domain_scores_gemma":[0.9984755,0.00020828508,0.00030016043,0.0006393265,0.00026813993,0.00010857864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090934744,0.00024975074,0.0003276393,0.0007553316,0.00010876712,0.00022950163,0.001164815,0.00017561919,0.0000110453775],"category_scores_gemma":[0.00013774652,0.00023410471,0.00004536082,0.0006596918,0.00048050372,0.0004120365,0.0007461787,0.00020896306,0.000004213139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029102064,0.000019784235,0.0001936389,0.000059678536,0.00000801258,0.000017819704,0.00062058447,0.016418058,0.000059156828,0.51416653,0.00001695417,0.4684169],"study_design_scores_gemma":[0.00015413556,0.000080462145,0.00010830587,0.00035858498,0.0000061819037,0.000020471945,2.1103087e-7,0.95680946,0.000527601,0.04010574,0.001524856,0.00030399195],"about_ca_topic_score_codex":0.00002013669,"about_ca_topic_score_gemma":0.0000461619,"teacher_disagreement_score":0.9403914,"about_ca_system_score_codex":0.0000838751,"about_ca_system_score_gemma":0.00023425584,"threshold_uncertainty_score":0.9546513},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044110424,0.0009913386,0.99622774,0.00023176115,0.00074793794,0.0002933939,0.0000072001044,0.0006256845,0.00083082926],"genre_scores_gemma":[0.03476198,0.00006427017,0.96426594,0.0004323596,0.00017617768,0.00001710989,0.00000515467,0.00004883456,0.00022820006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954248,0.00004339258,0.0004946098,0.0017614171,0.0012203539,0.0010554324],"domain_scores_gemma":[0.9961724,0.0007313806,0.0003127695,0.002220687,0.00029266256,0.00027008116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010883155,0.0007714606,0.000991303,0.0014918932,0.00019509018,0.00027766023,0.0038867,0.00034197696,0.000009346652],"category_scores_gemma":[0.00022091561,0.00063527137,0.0002285164,0.0018820388,0.0006561814,0.0012305819,0.0014765273,0.0010094007,0.00001623667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005098545,0.000008778658,0.000021567821,0.000013563573,0.000043380944,0.000020883916,0.0003048227,0.6616642,0.00004345901,0.005042729,0.000001115026,0.33283043],"study_design_scores_gemma":[0.00021455917,0.00012584621,0.00013283057,0.00011380918,0.00008284526,0.000035078232,1.3043632e-7,0.8705953,0.0010645299,0.12648945,0.00019589046,0.00094975973],"about_ca_topic_score_codex":0.000006018108,"about_ca_topic_score_gemma":0.0000334528,"teacher_disagreement_score":0.33188066,"about_ca_system_score_codex":0.000440538,"about_ca_system_score_gemma":0.00052373606,"threshold_uncertainty_score":0.9996099},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019823178,0.00022909812,0.99075097,0.0003602725,0.0028110398,0.0005494822,0.000003980317,0.0000793602,0.003233462],"genre_scores_gemma":[0.5710492,0.00009999089,0.42085034,0.006325978,0.00059255405,0.000014226266,0.000011637567,0.00011516844,0.000940904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99454045,0.00006033707,0.00090829516,0.002082336,0.0010480036,0.0013605962],"domain_scores_gemma":[0.99656105,0.0011513283,0.0004423209,0.0012188114,0.0003864171,0.00024009346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012775736,0.000880532,0.00085015246,0.001970792,0.00027323025,0.0007343993,0.00481323,0.00045973042,0.00018326651],"category_scores_gemma":[0.00014308203,0.00074211456,0.00017869807,0.0013066833,0.0005981271,0.0018617574,0.0021101888,0.0015210903,0.00017279132],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032137032,0.00036573483,0.0017844073,0.0002829732,0.00016522975,0.0028653718,0.01683659,0.008916582,0.028366005,0.029193066,0.00050951226,0.9103932],"study_design_scores_gemma":[0.0024749336,0.0020942602,0.005527494,0.0051294426,0.00004361046,0.00078597124,0.000014709568,0.82014906,0.10995814,0.044806704,0.0042275926,0.0047880798],"about_ca_topic_score_codex":0.000060858016,"about_ca_topic_score_gemma":0.00056876836,"teacher_disagreement_score":0.9056051,"about_ca_system_score_codex":0.00090278155,"about_ca_system_score_gemma":0.0005812825,"threshold_uncertainty_score":0.999503},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004969663,0.000013847014,0.9904596,0.00023117929,0.0027519227,0.00055541727,0.000023831246,0.00020103497,0.00079347426],"genre_scores_gemma":[0.8051804,0.00004011493,0.19065294,0.00087682856,0.002453449,0.000080670274,0.00020044553,0.00007015979,0.00044504838],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742615,0.000019445983,0.00042822032,0.0011649857,0.0005193204,0.00044187775],"domain_scores_gemma":[0.9984609,0.00017013896,0.00033434486,0.0006682905,0.00025492787,0.00011140124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052442163,0.00037825358,0.00030687815,0.0007682072,0.00053510483,0.00068569323,0.0010251652,0.00037973418,0.000057946687],"category_scores_gemma":[0.000041322626,0.00038301494,0.0001607001,0.00020242059,0.00017502556,0.0013225538,0.00030099135,0.00077326404,0.00005107319],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000394542,0.000029827772,0.000019347528,0.00006510447,0.000006843744,0.000006616924,0.00023300514,0.0004130609,0.004901467,0.002373875,0.0000039583038,0.99194294],"study_design_scores_gemma":[0.00076244713,0.00038207485,0.00054227177,0.00077308126,0.000028867078,0.00008893948,6.3382925e-7,0.09916324,0.08295365,0.8120937,0.0019204884,0.001290616],"about_ca_topic_score_codex":0.00002998048,"about_ca_topic_score_gemma":0.00043980934,"teacher_disagreement_score":0.9906523,"about_ca_system_score_codex":0.00022246996,"about_ca_system_score_gemma":0.00011316447,"threshold_uncertainty_score":0.9998622},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000071940565,0.00018541343,0.989858,0.00048708587,0.0022839857,0.00043608062,0.000005814459,0.00039588206,0.006275848],"genre_scores_gemma":[0.1203963,0.000005172226,0.87107444,0.0076553607,0.0006389851,0.000005119315,0.000016617741,0.000037016154,0.00017101143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99527836,0.00004287836,0.0009106084,0.0012126846,0.001661826,0.0008936205],"domain_scores_gemma":[0.9968562,0.00046011878,0.0005739513,0.0013913376,0.00043112974,0.00028722035],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017378334,0.00062693685,0.00059978024,0.0014953688,0.0005008967,0.0012208824,0.003468259,0.0005124457,0.000019685553],"category_scores_gemma":[0.00015557365,0.0005627658,0.00017706491,0.0012087609,0.0007334609,0.0017478412,0.0009893583,0.0011899424,0.00011861591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018775349,0.00002972357,0.000027767657,0.0003322918,0.000009105286,0.00010013221,0.001052217,0.011412632,0.000108405,0.010071133,0.00006413935,0.9767737],"study_design_scores_gemma":[0.00063973403,0.00012410559,0.00017843023,0.0012359184,0.000009843135,0.00006381192,4.580443e-7,0.9864142,0.0015841377,0.0038088681,0.0050984323,0.0008420949],"about_ca_topic_score_codex":0.000015141793,"about_ca_topic_score_gemma":0.000036494384,"teacher_disagreement_score":0.9759316,"about_ca_system_score_codex":0.0005195218,"about_ca_system_score_gemma":0.0011026846,"threshold_uncertainty_score":0.99981594},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007457211,0.00021148706,0.98887765,0.0017653079,0.00048146734,0.00038487974,0.0000018830638,0.00009597868,0.00072412455],"genre_scores_gemma":[0.49814922,0.000019222796,0.50098914,0.00052556,0.00007371099,0.0000068681406,0.000005122684,0.00001327376,0.00021787982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971303,0.00008142478,0.00051384163,0.0010921961,0.00083610136,0.00034616608],"domain_scores_gemma":[0.99807614,0.00053775543,0.00028148753,0.0007896301,0.00021437532,0.00010063919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006898507,0.0003235082,0.0004753323,0.0009947538,0.00008140824,0.00026765154,0.0011949518,0.00026644065,0.000015147107],"category_scores_gemma":[0.000111807334,0.0002949863,0.00006319597,0.0006152513,0.00074786035,0.0007620638,0.0010338882,0.0008616725,0.00000782762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030874526,0.00010927383,0.0007523124,0.0000740024,0.0000192635,0.00008807711,0.003199656,0.11238557,0.0018094478,0.43042746,0.00018624526,0.4509178],"study_design_scores_gemma":[0.00033691575,0.0001440488,0.0028577605,0.0002662738,0.0000033917781,0.0000589575,2.2454807e-7,0.69180226,0.003734201,0.30029202,0.00007882952,0.00042512256],"about_ca_topic_score_codex":0.00015140274,"about_ca_topic_score_gemma":0.00014345213,"teacher_disagreement_score":0.5794167,"about_ca_system_score_codex":0.00012058173,"about_ca_system_score_gemma":0.00028356156,"threshold_uncertainty_score":0.99995023},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049344562,0.0007572888,0.91032064,0.00013678244,0.00030763893,0.00032906377,0.0000146182665,0.000028727347,0.038760666],"genre_scores_gemma":[0.94329387,0.000034450448,0.055494092,0.000527588,0.00022524301,6.679153e-7,0.000014614876,0.000012416052,0.00039706894],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99869937,0.000014154466,0.00021754343,0.0005803557,0.00022797508,0.00026062195],"domain_scores_gemma":[0.9992543,0.000044446308,0.00015640046,0.00034785797,0.0001396848,0.00005734721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020006842,0.00023459466,0.00027729574,0.000061449035,0.000052095096,0.000033218854,0.00046704378,0.0002398591,0.000015852504],"category_scores_gemma":[0.000029784838,0.00015955036,0.00006371365,0.00010237409,0.00047413586,0.000003245073,0.00022967045,0.00019657362,0.0000056475],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014637962,0.000080739585,0.001395811,0.000057864974,0.000049342707,0.00006532658,0.00006281632,0.0029020624,0.05698331,0.0028855344,0.00006402192,0.9353068],"study_design_scores_gemma":[0.0058270157,0.018260797,0.0049100406,0.00561826,0.00027268514,0.0019528677,0.0000047989743,0.0534608,0.69226336,0.09881923,0.10990618,0.008703972],"about_ca_topic_score_codex":0.000005650337,"about_ca_topic_score_gemma":0.000025240422,"teacher_disagreement_score":0.92660284,"about_ca_system_score_codex":0.000018835728,"about_ca_system_score_gemma":0.000192516,"threshold_uncertainty_score":0.6506275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005773153,0.0000341262,0.9871069,0.0004942794,0.0011781229,0.00041291563,0.000005285035,0.00014330514,0.010567305],"genre_scores_gemma":[0.14784907,0.000027438848,0.84950465,0.0016357258,0.00038526495,0.000004629453,0.000012110637,0.00003835633,0.00054278213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973788,0.00002002809,0.0003179392,0.0010299787,0.0007319455,0.00052130455],"domain_scores_gemma":[0.99800205,0.0007791478,0.00013177781,0.00068341,0.0002963896,0.00010719937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008428462,0.0003267541,0.00026923203,0.0009842194,0.00028908384,0.00066709745,0.0013295669,0.00025002274,0.00004120925],"category_scores_gemma":[0.00004717333,0.0003226015,0.0001012446,0.0004329564,0.00045722464,0.00070581964,0.00029517134,0.0005679024,0.000023176282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104498995,0.000008564387,0.0000064812343,0.000015065017,0.000004261536,0.000023417673,0.0003768131,0.17092565,0.00002266941,0.36293107,0.00001670991,0.46565887],"study_design_scores_gemma":[0.00037008798,0.0002797564,0.00008920541,0.00025528963,0.000004291103,0.000028015997,0.0000017063185,0.7715255,0.00036414788,0.22537896,0.0011889555,0.0005140854],"about_ca_topic_score_codex":0.000013347851,"about_ca_topic_score_gemma":0.00016659182,"teacher_disagreement_score":0.6005999,"about_ca_system_score_codex":0.0003337608,"about_ca_system_score_gemma":0.0009039913,"threshold_uncertainty_score":0.99992263},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004253819,0.0008427213,0.9927377,0.0007115529,0.0004903308,0.00037679976,0.0000016611745,0.000016996,0.0005684327],"genre_scores_gemma":[0.90001154,0.00020809207,0.09905119,0.0005674545,0.0001347274,0.000007833846,0.0000019814145,0.0000072353714,0.000009915476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981535,0.00005349434,0.000390021,0.0005478652,0.00052056904,0.00033457184],"domain_scores_gemma":[0.9984326,0.0004652163,0.00023271,0.0007415778,0.000070221155,0.00005767006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007917804,0.00025231644,0.00028573637,0.00052283815,0.00010475166,0.00017115113,0.0014115241,0.00019640065,0.000008637707],"category_scores_gemma":[0.000040325736,0.00017330286,0.00007003817,0.00047687348,0.00031240002,0.00032833923,0.00048489045,0.00047536712,9.572201e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012178426,0.00005786845,0.0016940997,0.00013227158,0.000017365175,0.00001986715,0.013721946,0.0015202202,0.0011389826,0.050795604,0.000017504572,0.9308721],"study_design_scores_gemma":[0.0013352782,0.0011636036,0.054493643,0.0010395531,0.000056731533,0.0001632328,0.00001092931,0.45997113,0.005709591,0.47404483,0.00058251293,0.0014289528],"about_ca_topic_score_codex":0.00010529002,"about_ca_topic_score_gemma":0.0002679075,"teacher_disagreement_score":0.9294431,"about_ca_system_score_codex":0.00004265504,"about_ca_system_score_gemma":0.00012383448,"threshold_uncertainty_score":0.70670855},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013851283,0.0008089641,0.99323,0.00047215918,0.0004947655,0.00037452762,0.000001011375,0.00031392532,0.004166147],"genre_scores_gemma":[0.23186131,0.0002933024,0.7659079,0.0012603274,0.0002035445,0.000011829819,0.000003428978,0.000032244934,0.00042612458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966562,0.000046547153,0.00050021405,0.0014571975,0.00061716116,0.00072272855],"domain_scores_gemma":[0.99814624,0.00029319787,0.0002410908,0.000992745,0.00014026421,0.00018646337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082314544,0.00045759074,0.00054022035,0.00096495386,0.00015455115,0.0004820915,0.0017623866,0.00029909733,0.000005318664],"category_scores_gemma":[0.00009433428,0.00043294538,0.000058341397,0.000537997,0.00045732633,0.00032576302,0.0012629775,0.00071918214,0.000011308546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007271731,0.000032780932,0.00083191897,0.000066006025,0.000007000513,0.00009057485,0.0011789656,0.10557184,0.000019688094,0.15197809,0.00007427389,0.7401416],"study_design_scores_gemma":[0.00033829123,0.00015804266,0.0009507952,0.00038039454,0.000002386219,0.00003505097,5.6717003e-8,0.78466105,0.00017540036,0.21041128,0.002247276,0.00063995615],"about_ca_topic_score_codex":0.00004830186,"about_ca_topic_score_gemma":0.00009682934,"teacher_disagreement_score":0.7395016,"about_ca_system_score_codex":0.0002228294,"about_ca_system_score_gemma":0.00034628806,"threshold_uncertainty_score":0.99981225},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014054269,0.00038942986,0.99654245,0.0005141658,0.0013812869,0.0006425731,0.0000035442342,0.0003036662,0.00020885104],"genre_scores_gemma":[0.06121904,0.00002409158,0.935077,0.0027962099,0.00063428946,0.00006324336,0.0000020115858,0.000025593763,0.00015848441],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731725,0.000030529987,0.0004241428,0.00089599134,0.00069649454,0.0006356144],"domain_scores_gemma":[0.9975432,0.00082448847,0.0002380844,0.00094520097,0.00021221275,0.00023679402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000981127,0.00032365843,0.0003335926,0.00027625333,0.0001843043,0.00037509925,0.0017095542,0.00032070713,0.000060179347],"category_scores_gemma":[0.0003465722,0.00029334484,0.000117144664,0.00030887907,0.00040535684,0.0007457728,0.0005335216,0.0005466039,0.0000443942],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043583714,0.00001862511,0.000010630948,0.00002378279,0.0000052939545,0.0000055371506,0.00038548472,0.000091139525,0.0009574784,0.013744876,0.000019828993,0.984733],"study_design_scores_gemma":[0.00032365022,0.00030814306,0.000071935,0.0003555805,0.000014044172,0.00003640902,2.0028016e-7,0.21783914,0.22399998,0.5546952,0.0016553632,0.0007003512],"about_ca_topic_score_codex":0.000007821584,"about_ca_topic_score_gemma":0.000016344276,"teacher_disagreement_score":0.98403263,"about_ca_system_score_codex":0.00021856633,"about_ca_system_score_gemma":0.00015742167,"threshold_uncertainty_score":0.99995184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015056614,0.00062467833,0.99107397,0.00030008092,0.0007456912,0.00043075875,0.0000044547296,0.00013266623,0.0066726343],"genre_scores_gemma":[0.10280149,0.000042168078,0.8953418,0.0012638946,0.00025812062,0.000027447371,0.000027015716,0.000040294035,0.00019772975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952341,0.00010158852,0.00072266697,0.0021077385,0.00096378673,0.00087013864],"domain_scores_gemma":[0.99733406,0.000418905,0.00027879368,0.0015422528,0.00019324657,0.00023273854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017988615,0.00059371116,0.00056609313,0.0008099322,0.00023118063,0.00048556406,0.0025364857,0.0004170588,0.000013351483],"category_scores_gemma":[0.00023593828,0.0005761295,0.00010195252,0.0011047701,0.0005388605,0.00079374824,0.0008391552,0.0015644106,0.000013212021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004720925,0.00005198698,0.000097677046,0.000038119404,0.000005289703,0.00007100257,0.00029393658,0.66772777,0.00000406026,0.25028858,0.000026486021,0.08139038],"study_design_scores_gemma":[0.0001921827,0.000049894996,0.00005709382,0.00054255396,0.000004656763,0.00009218012,1.15638045e-7,0.8592201,0.000007123898,0.13914073,0.00013599487,0.0005573755],"about_ca_topic_score_codex":0.00003078839,"about_ca_topic_score_gemma":0.00005923829,"teacher_disagreement_score":0.19149233,"about_ca_system_score_codex":0.00042151604,"about_ca_system_score_gemma":0.00074327335,"threshold_uncertainty_score":0.999669},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044405537,0.00022408387,0.9943593,0.00029139096,0.0016349973,0.0005535077,0.0000038834482,0.00033628225,0.002552122],"genre_scores_gemma":[0.014970924,0.0000305688,0.98206866,0.0021761416,0.00020980136,0.000022813905,0.000003787837,0.0000749929,0.00044234045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935486,0.000100839185,0.0009775623,0.002546287,0.001648397,0.0011783671],"domain_scores_gemma":[0.99601734,0.00016437873,0.0005831363,0.0025230949,0.0003990305,0.00031305134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024741483,0.0008840915,0.00081688334,0.000961314,0.0004869761,0.00070154737,0.0051543824,0.0007494215,0.0000061787505],"category_scores_gemma":[0.00028852155,0.0008664243,0.0002606025,0.00085077155,0.0009197972,0.0014155811,0.0016544679,0.0017700143,0.000038449572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048073503,0.000046436584,0.0000051545094,0.000037142076,0.00000896816,0.00001688006,0.00090935075,0.7425615,0.0012829991,0.068275966,0.000009760548,0.18684104],"study_design_scores_gemma":[0.0002948041,0.000052370764,0.000010263883,0.00022353002,0.000010863861,0.000052617626,9.093679e-8,0.8702775,0.0040473845,0.124079175,0.000109529494,0.00084185076],"about_ca_topic_score_codex":0.0000066201774,"about_ca_topic_score_gemma":0.000012903624,"teacher_disagreement_score":0.18599918,"about_ca_system_score_codex":0.00082727923,"about_ca_system_score_gemma":0.00067817717,"threshold_uncertainty_score":0.9993786},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019521724,0.00027353424,0.3618655,0.005567907,0.004959207,0.0030302342,0.0003867085,0.00012055611,0.60427463],"genre_scores_gemma":[0.98722637,0.000071779796,0.005889716,0.003669958,0.00009083877,0.000019236011,0.00001304983,0.000033280205,0.0029857664],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965976,0.00002044979,0.0003356733,0.0011089239,0.0014142288,0.00052313745],"domain_scores_gemma":[0.9967486,0.0000813009,0.00020987529,0.0027859886,0.000051539155,0.00012269852],"candidate_categories":["sts","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013711483,0.00028347733,0.0002220991,0.00013083077,0.0004935726,0.00018110508,0.0085022375,0.00008492153,0.005027816],"category_scores_gemma":[0.00009342134,0.00016460495,0.000063402964,0.00093565014,0.0045098597,0.00026492582,0.011026153,0.00030025074,0.0002680164],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105742234,0.00044647834,0.013244302,0.00020713489,0.000083565275,0.00009630384,0.01281917,0.013883812,0.0049721478,0.27086216,0.0060725505,0.67720664],"study_design_scores_gemma":[0.000957669,0.00034032555,0.44514772,0.0012089792,0.00012939496,0.00011481496,0.000069936934,0.00836545,0.01929155,0.060949355,0.46047285,0.0029519699],"about_ca_topic_score_codex":0.000080109516,"about_ca_topic_score_gemma":0.00035516717,"teacher_disagreement_score":0.96770465,"about_ca_system_score_codex":0.0005467327,"about_ca_system_score_gemma":0.00008803349,"threshold_uncertainty_score":0.9981993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022112897,0.0007073152,0.99562514,0.00023253848,0.00020166342,0.0002767813,2.4534185e-7,0.00005787875,0.0006871551],"genre_scores_gemma":[0.46570727,0.000009605548,0.5341434,0.00004911101,0.000051668732,0.000004402684,4.373069e-7,0.000008919976,0.000025220834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760765,0.00007975058,0.0005088136,0.0008069271,0.00059034064,0.00040653293],"domain_scores_gemma":[0.9983767,0.0007113567,0.0002820231,0.000503095,0.00007154905,0.00005524066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002769171,0.00030695766,0.00042644583,0.0006839231,0.00027067374,0.00047133747,0.0015381825,0.00015564064,9.886555e-7],"category_scores_gemma":[0.000056248406,0.00022214663,0.00005232569,0.00040543595,0.0006636984,0.000514961,0.000790189,0.0011956726,0.000001303422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006416661,0.00000997806,0.000025705189,0.000019030816,0.000006462815,0.0000029530413,0.014070289,0.3256519,0.0000023941263,0.019839393,5.2634036e-8,0.6403654],"study_design_scores_gemma":[0.00044854573,0.000041693693,0.00016314385,0.0004731263,0.0000047604926,0.000019495837,0.000010163887,0.9704279,0.00013669762,0.027253855,0.0006471439,0.0003734724],"about_ca_topic_score_codex":0.000055013053,"about_ca_topic_score_gemma":0.00010877438,"teacher_disagreement_score":0.644776,"about_ca_system_score_codex":0.00014646839,"about_ca_system_score_gemma":0.0005616689,"threshold_uncertainty_score":0.90588766},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036476267,0.0014317326,0.99315363,0.0002168064,0.002554761,0.0011715351,0.00007824075,0.0003619432,0.000994891],"genre_scores_gemma":[0.0064445497,0.000085866326,0.99156857,0.0007127245,0.0005210708,0.000039436905,0.00004402554,0.000103816696,0.00047996416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925973,0.000071089096,0.000790991,0.003027978,0.0017439156,0.001768716],"domain_scores_gemma":[0.99438995,0.001096712,0.00035589276,0.0028992807,0.00071144674,0.0005466905],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023416593,0.00093087304,0.0008233348,0.0019600175,0.0006289239,0.0007121364,0.007898924,0.00054018124,0.000029656792],"category_scores_gemma":[0.00009026869,0.00089388806,0.00033189773,0.0014504743,0.002017526,0.0016976532,0.0012229623,0.0014131592,0.00002577678],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002864813,0.000060042552,0.000006410808,0.00003780876,0.000017957085,0.00020650265,0.00023397453,0.010976342,0.000049227947,0.034081146,0.00002084978,0.9542811],"study_design_scores_gemma":[0.0003894164,0.00066816853,0.000034331257,0.00018276418,0.000007854128,0.0001695755,5.516489e-7,0.6521794,0.00036483686,0.34302393,0.0021030575,0.00087606476],"about_ca_topic_score_codex":0.0000073002298,"about_ca_topic_score_gemma":0.0001304866,"teacher_disagreement_score":0.953405,"about_ca_system_score_codex":0.0005381723,"about_ca_system_score_gemma":0.0010102009,"threshold_uncertainty_score":0.9993512},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024221727,0.0007613329,0.9963549,0.00048260763,0.0009966008,0.00046908826,0.000006735953,0.00015861375,0.0005279335],"genre_scores_gemma":[0.017230142,0.000051100953,0.98056835,0.0014275791,0.00031874535,0.000017693812,0.0000048431125,0.000046930985,0.0003346353],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965725,0.00005296691,0.0003995481,0.0015765323,0.0007096393,0.0006887988],"domain_scores_gemma":[0.9977616,0.0006251469,0.0002152454,0.0010897252,0.000117190815,0.00019110889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015114977,0.0004712917,0.00047180697,0.0005428795,0.0004780894,0.0007997576,0.0020206908,0.00025031602,0.000005955805],"category_scores_gemma":[0.00006498423,0.00040807397,0.00011148081,0.000251477,0.0004414216,0.0007213127,0.0012024457,0.0005848061,0.0000041752105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004748687,0.000016927244,0.0000025178301,0.00006899007,0.000006561616,0.00003856972,0.0011507272,0.0031210613,0.0023557302,0.053420648,0.000021521499,0.939792],"study_design_scores_gemma":[0.00028759462,0.000104309016,0.00001950728,0.00058127235,0.0000044800663,0.00011267029,8.2822874e-7,0.31986374,0.005468904,0.67219216,0.00084660493,0.0005179259],"about_ca_topic_score_codex":0.000006615894,"about_ca_topic_score_gemma":0.0000039629886,"teacher_disagreement_score":0.9392741,"about_ca_system_score_codex":0.00012269766,"about_ca_system_score_gemma":0.0001659225,"threshold_uncertainty_score":0.9998371},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004943187,0.0006248724,0.9966818,0.0008833965,0.0004805852,0.0003127783,0.000004124674,0.00014439822,0.00037373474],"genre_scores_gemma":[0.60586005,0.00016921967,0.3928799,0.0007440949,0.00014318066,0.000008328274,0.000010078261,0.000024779345,0.0001603402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661595,0.00004744662,0.00058044784,0.0014203412,0.0008950171,0.00044078418],"domain_scores_gemma":[0.99728984,0.0003803627,0.0004903171,0.0013599758,0.00033387664,0.00014565022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006167262,0.00041783066,0.0006469528,0.0025615278,0.0002655327,0.000200586,0.0014963112,0.0003674964,0.0000055729015],"category_scores_gemma":[0.00007560702,0.00040015279,0.0002120918,0.0023991866,0.0006960592,0.00040837063,0.00046661714,0.00050715567,0.000002119072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008780164,0.000027582182,0.0001969571,0.000020318876,0.000029320545,0.000016260017,0.00014863163,0.08092122,0.00012416617,0.0018092451,0.000008694868,0.9166888],"study_design_scores_gemma":[0.00025976758,0.00029862422,0.0042972486,0.00026828222,0.000113519774,0.000015641226,1.2348117e-7,0.9777788,0.0011634585,0.014511637,0.00084467867,0.0004482107],"about_ca_topic_score_codex":0.000109105335,"about_ca_topic_score_gemma":0.00030612026,"teacher_disagreement_score":0.91624063,"about_ca_system_score_codex":0.0003356908,"about_ca_system_score_gemma":0.00038900579,"threshold_uncertainty_score":0.999845},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002076957,0.00018735586,0.99744993,0.00044359028,0.0006321309,0.0001996982,0.0000064805095,0.00015131022,0.0007217819],"genre_scores_gemma":[0.5959504,0.000046027355,0.40198007,0.0018308628,0.00006323078,0.000005514873,0.00004580252,0.000014330776,0.00006374024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724203,0.00004295773,0.0006562682,0.00084464013,0.0007530585,0.00046103887],"domain_scores_gemma":[0.9975998,0.0006561944,0.00046134903,0.00092895096,0.0002037314,0.00014998943],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011947149,0.00037968828,0.0005138818,0.0012710657,0.00039149792,0.0011282437,0.0017058968,0.00021879497,0.00001051535],"category_scores_gemma":[0.000108996675,0.00038518378,0.0001034559,0.0010870483,0.00035271695,0.001063666,0.0007804648,0.00057285535,0.00002094141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020122322,0.0000067167302,0.000059277896,0.00006063166,0.000047373353,0.0000027894362,0.0027299272,0.1142709,0.000018240415,0.015302851,0.00002408117,0.8674752],"study_design_scores_gemma":[0.00017027954,0.000056203764,0.00007885586,0.00012569044,0.00003192684,0.000012686076,5.836934e-7,0.9744171,0.00008504871,0.023021793,0.0015843258,0.00041550095],"about_ca_topic_score_codex":0.000028780049,"about_ca_topic_score_gemma":0.000024455618,"teacher_disagreement_score":0.8670597,"about_ca_system_score_codex":0.0002100603,"about_ca_system_score_gemma":0.00018161377,"threshold_uncertainty_score":0.9999087},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005508178,0.000093138835,0.99424976,0.0001094166,0.0017776947,0.0004003297,0.0000014863971,0.0001791222,0.0026382369],"genre_scores_gemma":[0.69500977,0.000010443373,0.30177322,0.0009023741,0.0005141818,0.00002067059,0.000004767691,0.000050960705,0.0017135933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960241,0.000038484563,0.0006557268,0.0016776111,0.000801976,0.0008021533],"domain_scores_gemma":[0.9978052,0.000102967526,0.00022564812,0.0013881658,0.00020973779,0.00026829247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081303355,0.0005363517,0.0005407319,0.0011933662,0.00024771222,0.0006060076,0.0033909094,0.00018056153,0.000021010394],"category_scores_gemma":[0.000018031598,0.0005295005,0.00010110635,0.00044277834,0.000103612685,0.0011408745,0.00091479335,0.00069279055,0.00008557916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027531182,0.000038623115,0.00013982785,0.00002863563,0.0000043643777,0.00009987939,0.0048263324,0.8520979,0.00018221457,0.065945275,0.0000018581027,0.07663229],"study_design_scores_gemma":[0.0000951203,0.0002547791,0.0001753417,0.00066207413,0.0000028187553,0.000049375605,9.74626e-7,0.9656274,0.0008813162,0.03050015,0.0010606581,0.0006900232],"about_ca_topic_score_codex":0.00029774537,"about_ca_topic_score_gemma":0.000245334,"teacher_disagreement_score":0.69445896,"about_ca_system_score_codex":0.00042263206,"about_ca_system_score_gemma":0.00033120287,"threshold_uncertainty_score":0.9997156},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095592765,0.00023228646,0.9930693,0.000449438,0.00090134866,0.0004011434,0.000008788245,0.0003990166,0.0035827798],"genre_scores_gemma":[0.19522396,0.000012892202,0.80309343,0.0009797123,0.00042152763,0.0000062555846,0.0000055626588,0.000063414125,0.00019326076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954632,0.000046938425,0.0005744073,0.0019259698,0.0009861861,0.0010032991],"domain_scores_gemma":[0.9967765,0.00048405552,0.00037102817,0.0018003534,0.00027294486,0.00029508883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005865245,0.0007701975,0.0006536376,0.00091045763,0.00063903636,0.0006070103,0.0034677961,0.00028808782,0.000027542563],"category_scores_gemma":[0.00003150963,0.0006301088,0.00015833908,0.00077618606,0.0008081396,0.00046696907,0.0013975711,0.0013046274,0.00005070219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010100023,0.000060061888,0.000060224484,0.000037604645,0.000029457953,0.00038985253,0.0020290792,0.42707527,0.00006493488,0.01721233,0.000008489157,0.5530226],"study_design_scores_gemma":[0.00030571793,0.00040446882,0.00017644429,0.00066033803,0.000013293286,0.00025319392,1.4133755e-7,0.899168,0.0003422958,0.09697495,0.00081383524,0.0008873159],"about_ca_topic_score_codex":0.00006017954,"about_ca_topic_score_gemma":0.00012789186,"teacher_disagreement_score":0.5521353,"about_ca_system_score_codex":0.00020259415,"about_ca_system_score_gemma":0.00063103286,"threshold_uncertainty_score":0.999615},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069185376,0.00026326347,0.9199573,0.0003481612,0.0014290544,0.0004686763,0.0000016916047,0.00023757233,0.008108931],"genre_scores_gemma":[0.6550988,0.0000048881993,0.34177232,0.0022780742,0.0007282976,0.0000047796575,0.000002314936,0.000033246175,0.000077302444],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99852175,0.000007146075,0.00024183889,0.0006488945,0.0003432943,0.00023707646],"domain_scores_gemma":[0.99875426,0.0004870623,0.00013628948,0.000392223,0.00016256217,0.00006758968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004183162,0.00022232757,0.00025878652,0.00033921763,0.00016948557,0.000100113226,0.00018533811,0.00025301104,0.000008860314],"category_scores_gemma":[0.000719866,0.0001983574,0.00003359249,0.00026570517,0.0004423162,0.000093285256,0.00013249902,0.00085950573,0.000014480462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007889344,0.000012175562,0.0010929671,0.00005393786,0.0000041518497,0.000036093745,0.00015569008,0.000016474132,0.22912084,0.00031356578,0.0000011016152,0.7691851],"study_design_scores_gemma":[0.0025651923,0.0015115862,0.016401667,0.0038468214,0.00015247319,0.0043103877,0.0000012022808,0.40813956,0.43464527,0.11522896,0.011072871,0.0021240085],"about_ca_topic_score_codex":0.000036266454,"about_ca_topic_score_gemma":0.000040562463,"teacher_disagreement_score":0.7670611,"about_ca_system_score_codex":0.000075058444,"about_ca_system_score_gemma":0.00013247259,"threshold_uncertainty_score":0.80887806},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007561796,0.00048876484,0.18409027,0.05921905,0.0030827331,0.0035458554,0.00011405089,0.00013289734,0.7485702],"genre_scores_gemma":[0.42722917,0.0007832121,0.43190613,0.05855582,0.0060091424,0.0002779482,0.0003335387,0.00019694648,0.07470811],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955269,0.00008110871,0.0005274886,0.0013337169,0.0016368006,0.0008939959],"domain_scores_gemma":[0.99731606,0.0004357001,0.00021703682,0.0015358962,0.00019356451,0.00030175538],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.004143391,0.00032449517,0.0004088737,0.0005099834,0.00043443582,0.0025594512,0.0121172685,0.00021722974,0.0018400365],"category_scores_gemma":[0.00039001694,0.0002937895,0.00003988415,0.0008296429,0.00054533494,0.0019253123,0.009196096,0.00038080322,0.0001899303],"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.000006218637,0.000045408437,0.0016824947,0.000029362944,0.000018664568,0.000030315745,0.014558996,0.00018176524,0.000019175763,0.16826722,0.008312394,0.806848],"study_design_scores_gemma":[0.00020952315,0.000067204164,0.00047029168,0.00018254833,0.0000050173676,0.0000014588263,0.00006603914,0.002952129,0.000017967828,0.03719715,0.95825905,0.0005716284],"about_ca_topic_score_codex":0.021330286,"about_ca_topic_score_gemma":0.16809829,"teacher_disagreement_score":0.94994664,"about_ca_system_score_codex":0.00089272787,"about_ca_system_score_gemma":0.0019634592,"threshold_uncertainty_score":0.9999514},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000067127075,0.0020029922,0.99326015,0.00045990842,0.0019503466,0.0004202625,0.000005229783,0.0007711902,0.0010628195],"genre_scores_gemma":[0.13677625,0.000040033927,0.86129993,0.0002512193,0.00090616115,0.000012213536,0.000002261516,0.000049886752,0.00066206395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958953,0.00006831851,0.00046751433,0.0016899258,0.0008247602,0.001054167],"domain_scores_gemma":[0.99678487,0.00090081873,0.000272665,0.0014693267,0.00032905905,0.0002432626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000969885,0.000695359,0.00070243905,0.0009925435,0.0003810191,0.0005263006,0.0023797245,0.00045682542,0.0000032468683],"category_scores_gemma":[0.00042216748,0.0006513078,0.00009217034,0.00084248744,0.00066735235,0.00062452524,0.002090568,0.001074279,0.0000046143905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034194036,0.0000049191094,0.000040304043,0.00022779191,0.00001350594,0.00030828378,0.0007626028,0.41236454,0.00003597802,0.18881762,0.00001306468,0.39740798],"study_design_scores_gemma":[0.00057337125,0.00028840487,0.0012043646,0.0010028603,0.000024315976,0.0010972591,0.000008928026,0.27092987,0.00073766144,0.7187488,0.0033405498,0.0020435948],"about_ca_topic_score_codex":0.000034435954,"about_ca_topic_score_gemma":0.000050564675,"teacher_disagreement_score":0.5299312,"about_ca_system_score_codex":0.0016648368,"about_ca_system_score_gemma":0.0007537521,"threshold_uncertainty_score":0.9995938},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23017582,0.0000065935233,0.7686314,0.00037130498,0.00024662644,0.00037912247,0.0000019878917,0.000183045,0.000004075576],"genre_scores_gemma":[0.5096573,4.0568656e-7,0.49007127,0.00015002939,0.00008972731,0.00002028587,0.000002530095,0.0000069533694,0.0000014613297],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977556,0.00005152421,0.0002752906,0.0008726736,0.0004748476,0.00057008833],"domain_scores_gemma":[0.998486,0.0003322981,0.000098784105,0.0006234192,0.00030206764,0.00015747371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030899697,0.00025540328,0.00027561482,0.00023051331,0.0002546136,0.00037467908,0.001076537,0.000072667666,0.0000016539211],"category_scores_gemma":[0.00024690403,0.00019821544,0.000046790014,0.0010879351,0.00028288152,0.0009994484,0.00034959553,0.00021424206,0.0000038123972],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075573545,0.00006465547,0.00043277934,0.000054814896,0.0000056733425,0.0000048904617,0.0006332915,0.026021376,0.4676988,0.0031836785,0.0000045298284,0.5018199],"study_design_scores_gemma":[0.00041645463,0.0005829413,0.0015996232,0.000058461585,0.0000025975644,0.00000814548,5.5425465e-7,0.42782736,0.5633815,0.0059227715,0.0000038301246,0.00019578669],"about_ca_topic_score_codex":0.000017101547,"about_ca_topic_score_gemma":0.000016157424,"teacher_disagreement_score":0.50162417,"about_ca_system_score_codex":0.00017555,"about_ca_system_score_gemma":0.00008841195,"threshold_uncertainty_score":0.80829906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045600053,0.00028832752,0.9832842,0.0014139233,0.00084328424,0.0004640589,0.0000011133744,0.00013497868,0.013524542],"genre_scores_gemma":[0.070235975,0.0001163969,0.9247645,0.0028024402,0.00025726826,0.000024630464,0.000004852482,0.00004697752,0.0017469537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618727,0.00006389076,0.0005695228,0.0014145371,0.0009285678,0.000836221],"domain_scores_gemma":[0.9978526,0.0004268072,0.00019934798,0.0011308765,0.00018510396,0.00020524397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012135302,0.00043730906,0.0004599734,0.0013079996,0.00018456353,0.0009309122,0.0032504878,0.0002727853,0.000102116515],"category_scores_gemma":[0.00010983847,0.00040624882,0.00008873921,0.00091023144,0.00041488852,0.0010588275,0.0015191534,0.0010126451,0.00015100824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016853476,0.000033145414,0.00017853665,0.000044242555,0.0000057654875,0.00011622537,0.0022963414,0.16771282,0.00011698864,0.02077433,0.00006813462,0.8086518],"study_design_scores_gemma":[0.00026542126,0.000056015117,0.00012784857,0.00038926068,0.0000015166148,0.00002608243,3.011141e-7,0.9470141,0.00023031,0.049703132,0.0016533288,0.00053267943],"about_ca_topic_score_codex":0.00006678126,"about_ca_topic_score_gemma":0.00009687583,"teacher_disagreement_score":0.8081191,"about_ca_system_score_codex":0.00032049234,"about_ca_system_score_gemma":0.0004892526,"threshold_uncertainty_score":0.99983895},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00165584,0.00024203073,0.9954305,0.00071379315,0.0012137705,0.00032162984,0.000007901019,0.00010789145,0.0003065957],"genre_scores_gemma":[0.18979368,0.00013650737,0.80640817,0.0019018853,0.001391914,0.000011335516,0.00001187602,0.000040370116,0.0003042729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740165,0.000035549267,0.0003083806,0.0011324977,0.0006697519,0.0004521553],"domain_scores_gemma":[0.9987422,0.00015379518,0.00022927982,0.0005311129,0.00019195041,0.00015166414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003509214,0.0003957438,0.00033229287,0.00060549297,0.00038585166,0.00061692874,0.0008425835,0.00037371795,0.000020948952],"category_scores_gemma":[0.000056531386,0.00035623607,0.00007584878,0.0003707405,0.00027664608,0.0008495973,0.00050058373,0.0006478,0.000023821609],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000960634,0.000014503696,0.000016162254,0.000024029636,0.0000074302047,0.00003685241,0.0005372348,0.00612727,0.0061883684,0.0013898422,0.000014374001,0.9856343],"study_design_scores_gemma":[0.0004015368,0.00011352857,0.00019039311,0.0003104443,0.000013351777,0.00017051103,4.3318585e-7,0.95345694,0.012046223,0.030348714,0.0023205765,0.00062736945],"about_ca_topic_score_codex":0.000021914904,"about_ca_topic_score_gemma":0.00007628522,"teacher_disagreement_score":0.9850069,"about_ca_system_score_codex":0.00020452015,"about_ca_system_score_gemma":0.00025130867,"threshold_uncertainty_score":0.99988896},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021455462,0.0002135632,0.99304414,0.0002739452,0.0018296532,0.0006800508,0.000024472352,0.0007318346,0.0031808938],"genre_scores_gemma":[0.043598685,0.000017247008,0.9539235,0.0014632113,0.00076954847,0.000024261433,0.00009179989,0.000030441674,0.000081309336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99482304,0.00012417258,0.00065099547,0.002303023,0.0012796064,0.0008191832],"domain_scores_gemma":[0.99492013,0.000175258,0.00031137335,0.0039604083,0.00029904902,0.00033376514],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002670142,0.000555665,0.0005169182,0.0006959447,0.00029566203,0.00069787033,0.007996045,0.00044623553,0.000021304351],"category_scores_gemma":[0.00027442886,0.00049095415,0.00006866703,0.0010134241,0.00046632206,0.0018468263,0.003624112,0.0007565373,0.00015314782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050176636,0.00008146241,0.000012979647,0.000049468264,0.000012034381,0.000017660655,0.00089096866,0.043040548,0.0014155742,0.07102634,0.00045304385,0.8829949],"study_design_scores_gemma":[0.00008637374,0.00008112257,0.000060914208,0.00007036508,0.000007826331,0.000109661276,1.335563e-7,0.9907382,0.00091017614,0.0057604094,0.0015759574,0.00059886393],"about_ca_topic_score_codex":0.000016727428,"about_ca_topic_score_gemma":0.000009241829,"teacher_disagreement_score":0.94769764,"about_ca_system_score_codex":0.00031041267,"about_ca_system_score_gemma":0.0004712591,"threshold_uncertainty_score":0.9997542},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3488102,0.0000149558655,0.64829993,0.0025325697,0.000047761347,0.0002601793,2.0268336e-8,0.000021538684,0.000012840333],"genre_scores_gemma":[0.7731183,0.0000010916432,0.21914786,0.0075905547,0.00012823689,0.0000048316074,0.0000020836476,0.0000041956296,0.0000028139668],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990951,0.000010372213,0.00014811284,0.00024907273,0.00022217612,0.00027521237],"domain_scores_gemma":[0.999504,0.00017807487,0.000036346024,0.00016802148,0.00004927893,0.00006422077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010026507,0.00008032455,0.000109664026,0.00018742192,0.00008205137,0.000030550582,0.0001394737,0.000033874447,0.000005853694],"category_scores_gemma":[0.000044439334,0.000065063796,0.00003295503,0.00050174573,0.0001372844,0.0000953568,0.000015973766,0.00006537766,0.000005223415],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008856613,0.00006099653,0.1546167,0.00004950471,0.0000038290264,0.00007856636,0.000780531,0.0020810717,0.0013266916,0.000504828,0.000027828622,0.8403809],"study_design_scores_gemma":[0.0016083426,0.00077220035,0.7726063,0.00012404339,0.00002170007,0.00033428287,0.000008898513,0.1857756,0.028382251,0.007192006,0.0029001061,0.0002742403],"about_ca_topic_score_codex":0.000011071328,"about_ca_topic_score_gemma":0.000011589045,"teacher_disagreement_score":0.84010667,"about_ca_system_score_codex":0.000076591954,"about_ca_system_score_gemma":0.00005087079,"threshold_uncertainty_score":0.26532245},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021387864,0.0005202031,0.9693534,0.00018190971,0.0001765614,0.00017263871,0.0000025454772,0.00004397999,0.008160913],"genre_scores_gemma":[0.9926504,0.000062176965,0.0061370963,0.00051595276,0.0004341811,0.0000018263769,0.00003850381,0.000019351655,0.00014051334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975139,0.0000053360613,0.00045340607,0.0006551254,0.0011111434,0.00026109838],"domain_scores_gemma":[0.99809617,0.00007274409,0.00042753795,0.00038713927,0.0010012864,0.000015139617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025314686,0.00027503553,0.000507136,0.0021290737,0.0001700361,0.00018740827,0.00045224847,0.00016791649,0.0001427268],"category_scores_gemma":[0.00008378342,0.00024186856,0.000111883186,0.0017242635,0.00032373174,0.00060746586,0.00028841515,0.00023171297,0.000020800138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011581141,0.000010438615,0.0022449037,0.00007822627,0.00006376044,0.0000011546898,0.00003199762,0.2424777,0.000018628403,0.00015511354,0.0000016259772,0.75490487],"study_design_scores_gemma":[0.00017018405,0.0000067727847,0.0033132825,0.00018212618,0.0007196422,9.308204e-7,1.2955125e-7,0.9890698,0.000045658486,0.006027942,0.00019366293,0.00026985953],"about_ca_topic_score_codex":0.0001355874,"about_ca_topic_score_gemma":0.00015596536,"teacher_disagreement_score":0.9712625,"about_ca_system_score_codex":0.00007468084,"about_ca_system_score_gemma":0.00011186051,"threshold_uncertainty_score":0.9863114},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022772992,0.00087592815,0.9218788,0.000414434,0.0021053003,0.0003828724,0.0000065145073,0.00016293734,0.051400207],"genre_scores_gemma":[0.9945977,0.000022315662,0.003980465,0.00044218558,0.00083930144,0.0000023994517,0.000065725115,0.000020359263,0.000029570181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987657,0.000005476758,0.0004134226,0.00024125185,0.0003311637,0.00024296902],"domain_scores_gemma":[0.9984932,0.000058584174,0.0005587756,0.00035468553,0.000527336,0.0000074450663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005983595,0.00026348355,0.0003058657,0.0007986308,0.00020853835,0.00050366914,0.000644531,0.0001765067,0.00011556018],"category_scores_gemma":[0.0000076124684,0.00023799107,0.000042643194,0.0006244906,0.0004953072,0.0026663074,0.00030106152,0.00036661193,0.000022649443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026788182,0.000055079883,0.0035948448,0.0017467397,0.000028803484,0.0000055116648,0.0007700788,0.061004467,0.0006711459,0.83511144,0.00000724773,0.09697782],"study_design_scores_gemma":[0.0007789267,0.00007941394,0.01124392,0.005895451,0.00016144404,0.00001797786,0.00011285057,0.2935241,0.0015137661,0.6805433,0.0042017736,0.0019270753],"about_ca_topic_score_codex":0.00066218164,"about_ca_topic_score_gemma":0.00093864644,"teacher_disagreement_score":0.9718247,"about_ca_system_score_codex":0.00003536687,"about_ca_system_score_gemma":0.00009443029,"threshold_uncertainty_score":0.9704994},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44351897,0.000076723045,0.5551109,0.0007045564,0.00009323398,0.0003784428,0.0000032072749,0.00011032304,0.000003646811],"genre_scores_gemma":[0.5307556,0.000005941754,0.4679848,0.0012184476,0.000017978933,0.00000935816,0.0000025063805,0.0000048679553,5.38917e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998119,0.00007707732,0.00020672995,0.0006205085,0.00039817687,0.0005785033],"domain_scores_gemma":[0.9989239,0.00013196003,0.000034363282,0.00032528088,0.00010697474,0.00047754875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006007394,0.00017454417,0.0002577284,0.00019019059,0.00015260595,0.00004709793,0.00018919731,0.00007588247,0.000024624584],"category_scores_gemma":[0.00008976005,0.000121249395,0.000031351246,0.0007227086,0.0003054597,0.00006641528,0.00016206974,0.00021959595,0.000023884835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034633506,0.0013092135,0.3717424,0.00007615829,0.000019209587,0.0015128679,0.0017687522,0.015024998,0.002622758,0.0000050362214,0.000026920141,0.60554534],"study_design_scores_gemma":[0.001562484,0.0020787085,0.28380352,0.000079355326,0.0000053794583,0.00008223755,0.0000012656593,0.704408,0.007761567,0.000080691665,0.0000062858985,0.00013052211],"about_ca_topic_score_codex":0.00013985131,"about_ca_topic_score_gemma":0.000042597105,"teacher_disagreement_score":0.689383,"about_ca_system_score_codex":0.00016639126,"about_ca_system_score_gemma":0.000254041,"threshold_uncertainty_score":0.4944407},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004637432,0.00010613975,0.96183366,0.00034133307,0.0007024255,0.0014753618,0.0000019808151,0.000049995262,0.035025354],"genre_scores_gemma":[0.7706596,0.00012694136,0.22581477,0.00049511675,0.00081266736,0.0001100221,0.000003335093,0.00003745463,0.0019400388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948634,0.00034849433,0.0005712282,0.0007532561,0.0024384956,0.0010251292],"domain_scores_gemma":[0.9959148,0.0019703447,0.00029511462,0.0004613476,0.0011991197,0.00015923142],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.020240806,0.00026742896,0.00033012356,0.0015079196,0.0018140507,0.001450759,0.001723629,0.00019257044,0.00019739941],"category_scores_gemma":[0.00068579195,0.000213829,0.000030621748,0.0019175974,0.006021131,0.0022961325,0.00026252668,0.0006527954,0.00008226687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006596535,0.000018270342,0.00027780407,0.00005365175,0.000008028323,0.000014125728,0.09195797,0.03517353,0.00013240566,0.48887336,0.00004243173,0.38338247],"study_design_scores_gemma":[0.0009354823,0.0009338803,0.00034421968,0.0018441221,0.000009666993,0.000021813505,0.00092616625,0.052973304,0.004642336,0.92462415,0.01120513,0.001539741],"about_ca_topic_score_codex":0.0012741024,"about_ca_topic_score_gemma":0.0013824062,"teacher_disagreement_score":0.7701959,"about_ca_system_score_codex":0.0010824236,"about_ca_system_score_gemma":0.0036802173,"threshold_uncertainty_score":0.9995858},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006908535,0.00013375496,0.99511355,0.00009579801,0.00030026102,0.0005085232,0.000001305362,0.00006290395,0.0037148253],"genre_scores_gemma":[0.9276915,0.00001577717,0.071842216,0.00021192101,0.00016517784,0.00001533641,0.000001751683,0.000016362308,0.000039913684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812156,0.00008022122,0.00018792895,0.00046529734,0.00093826477,0.00020672244],"domain_scores_gemma":[0.99856484,0.00067138404,0.00013610884,0.0003084934,0.00024630598,0.0000728693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002628695,0.0001657821,0.0001893214,0.00032860052,0.00015480898,0.000052504314,0.0003769757,0.00019868932,0.000023279761],"category_scores_gemma":[0.00026518156,0.00015925858,0.000032834265,0.00017875215,0.00054255064,0.000081978855,0.000039919138,0.00021045994,0.0000073396345],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010311046,0.000019621622,0.0002116101,0.000019144261,0.0000053654985,0.0000013441102,0.002417001,0.08009208,0.000054737684,0.0074913884,0.0000048610164,0.90967256],"study_design_scores_gemma":[0.0004644978,0.00040791655,0.0016700384,0.0005744193,0.00005735168,0.0000019011351,0.0000012391424,0.61181337,0.0015381936,0.38242155,0.00041083182,0.0006387169],"about_ca_topic_score_codex":0.00026509064,"about_ca_topic_score_gemma":0.00017564856,"teacher_disagreement_score":0.92762244,"about_ca_system_score_codex":0.00021294154,"about_ca_system_score_gemma":0.0005693301,"threshold_uncertainty_score":0.6494376},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000104792205,0.00035459062,0.9970876,0.00007197989,0.00066981325,0.00016281892,0.0000053421445,0.00009554276,0.0014474976],"genre_scores_gemma":[0.85727835,0.0002663375,0.13898803,0.0017966892,0.0011777944,0.000003747018,0.000055271874,0.00008838227,0.00034537638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965466,0.00007645084,0.0007893277,0.0011690701,0.00075725943,0.00066124176],"domain_scores_gemma":[0.9978615,0.00039645575,0.0006291284,0.00062592817,0.00027229727,0.00021467922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013890882,0.00048969407,0.000729408,0.0008376629,0.00031894055,0.00050588284,0.0019746067,0.00047290753,0.000021038375],"category_scores_gemma":[0.000089165915,0.00050049415,0.00013066297,0.00089981215,0.0009935729,0.00054047955,0.0012433445,0.00054871524,0.0000031801142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001926694,0.000104316496,0.0009210687,0.0001333579,0.00008575411,0.00008462898,0.00452253,0.06413418,0.000026548298,0.18822055,0.00019237041,0.74155545],"study_design_scores_gemma":[0.00019742735,0.00014075538,0.00022555231,0.0002513356,0.000025986574,0.000019502912,9.087759e-7,0.9865514,0.00009051877,0.01145304,0.00050508557,0.00053846516],"about_ca_topic_score_codex":0.000009295837,"about_ca_topic_score_gemma":0.000030939045,"teacher_disagreement_score":0.9224172,"about_ca_system_score_codex":0.000094559546,"about_ca_system_score_gemma":0.00025511865,"threshold_uncertainty_score":0.99974465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020059755,0.00023968641,0.99556595,0.0018484344,0.00067852525,0.00066407956,0.0000065213353,0.00054611906,0.000430634],"genre_scores_gemma":[0.086778335,0.000014277277,0.910976,0.0014040126,0.00016813014,0.0000075879148,0.000004629867,0.000029869896,0.0006171604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961767,0.000016055126,0.00058216945,0.0016588893,0.00081203965,0.0007541274],"domain_scores_gemma":[0.99720013,0.00030233638,0.0003849472,0.001737917,0.000207255,0.00016740982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005706816,0.0005796045,0.0005639284,0.000862448,0.00037275057,0.0008547218,0.0037222668,0.00046175826,0.000008327611],"category_scores_gemma":[0.00011339048,0.00055998244,0.00020455565,0.00056170276,0.00032781676,0.0008405647,0.00092434784,0.0005744966,0.000006911111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008193701,0.000021337524,0.000005740096,0.000038166298,0.0000051063494,0.000008604713,0.00012767939,0.32120597,0.0003472069,0.015554796,0.000047996407,0.6626292],"study_design_scores_gemma":[0.00031419538,0.00008189821,0.000027613027,0.00019038023,0.000009064267,0.000010606972,8.9241595e-8,0.74200547,0.0010465996,0.2555047,0.00033356223,0.00047581276],"about_ca_topic_score_codex":0.000016793047,"about_ca_topic_score_gemma":0.00009145554,"teacher_disagreement_score":0.6621534,"about_ca_system_score_codex":0.0004544244,"about_ca_system_score_gemma":0.0010745456,"threshold_uncertainty_score":0.99968517},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003177907,0.00016815886,0.98663545,0.00514742,0.0012358462,0.00030185934,0.000044303062,0.000023294599,0.0032657457],"genre_scores_gemma":[0.73665833,0.00007783877,0.19759957,0.05465098,0.0044733607,0.000017837348,0.000099124234,0.00009302367,0.006329913],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956901,0.00006520506,0.0008472767,0.0007778176,0.0022023956,0.00041718455],"domain_scores_gemma":[0.99487996,0.0036634193,0.00040465605,0.00081492297,0.00017420687,0.00006280692],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004726104,0.00029701268,0.00045322333,0.000833467,0.00038429422,0.0014124622,0.0033363062,0.0002526756,0.00033029224],"category_scores_gemma":[0.00081425277,0.00019458521,0.00015791666,0.0009932737,0.00041630396,0.0012011252,0.0010593558,0.00077073585,0.00006489894],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032588578,0.000021189773,0.0011480113,0.0000033470665,0.000011064467,0.000056279812,0.0024218843,0.0030086453,0.000025698097,0.008852366,0.0013957911,0.9830231],"study_design_scores_gemma":[0.0019640657,0.00014100404,0.028191892,0.0004894237,0.00013087264,0.00001747881,0.00006113008,0.32874492,0.0005585874,0.5178912,0.11963596,0.0021734321],"about_ca_topic_score_codex":0.0002986554,"about_ca_topic_score_gemma":0.0021121046,"teacher_disagreement_score":0.9808497,"about_ca_system_score_codex":0.00014848482,"about_ca_system_score_gemma":0.00023400078,"threshold_uncertainty_score":0.9996242},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007850622,0.0019122652,0.9746192,0.0062542865,0.001557995,0.0027889959,0.000016814105,0.00017609302,0.0048237448],"genre_scores_gemma":[0.8074585,0.00007888674,0.18206471,0.0029875701,0.0016607579,0.00034274012,0.00006890016,0.00010948266,0.0052283984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974604,0.000120860845,0.00056139164,0.0009222057,0.00040326183,0.0005318581],"domain_scores_gemma":[0.99726236,0.0015942613,0.00047017942,0.00043018427,0.00019415503,0.000048847745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001353549,0.0003751901,0.00041677043,0.00070359703,0.00021638331,0.00020945515,0.00091581995,0.00027223697,0.000021892765],"category_scores_gemma":[0.00014977866,0.00029233372,0.00010870502,0.00041303755,0.00044466427,0.00012637206,0.00007767113,0.0011317714,0.000004591799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024208095,0.00017471533,0.0036055422,0.00019209637,0.000055628967,0.000016085925,0.081005715,0.11011869,0.0009325938,0.020633478,0.00074256695,0.7822808],"study_design_scores_gemma":[0.005981765,0.0018854735,0.023146152,0.010004567,0.0002231282,0.00012974376,0.0006212896,0.68239754,0.0010852187,0.18348216,0.08623588,0.0048070694],"about_ca_topic_score_codex":0.00018737892,"about_ca_topic_score_gemma":0.0012977773,"teacher_disagreement_score":0.79960793,"about_ca_system_score_codex":0.00034378038,"about_ca_system_score_gemma":0.0005000211,"threshold_uncertainty_score":0.99995285},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023571942,0.0005642259,0.9932692,0.00038252203,0.0014375179,0.00057592744,0.0000011396166,0.000028845569,0.0013834281],"genre_scores_gemma":[0.7809976,0.00005788398,0.21805951,0.00048196083,0.00033121838,0.000013325918,0.000001345763,0.000021418185,0.00003574583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597085,0.00017359048,0.0010448025,0.001210895,0.00080302206,0.0007968174],"domain_scores_gemma":[0.9944352,0.0029206104,0.0006379934,0.0017415422,0.00019409519,0.0000705451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026412646,0.00042785433,0.0007665834,0.0007812041,0.000091643844,0.0001176666,0.0052720737,0.0005466762,0.000010240204],"category_scores_gemma":[0.0003074986,0.00034476767,0.00011378033,0.0014008703,0.0014086043,0.00034931712,0.0016065087,0.0021152843,0.000001720777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009700227,0.0000503512,0.0010643477,0.00006135586,0.00000505179,0.00011532557,0.0026507766,0.6129384,0.00042867797,0.021966252,0.0000035764517,0.36070615],"study_design_scores_gemma":[0.00027829048,0.00014639963,0.001225629,0.00086541125,0.000003914524,0.00009350305,0.0000011556162,0.969225,0.0007104379,0.026786922,0.0002751488,0.00038821573],"about_ca_topic_score_codex":0.00018290685,"about_ca_topic_score_gemma":0.0013802785,"teacher_disagreement_score":0.7786404,"about_ca_system_score_codex":0.0001003878,"about_ca_system_score_gemma":0.00035300173,"threshold_uncertainty_score":0.99990046},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032685793,0.00010502431,0.99374974,0.00008477571,0.00032422986,0.0019159405,0.000015289505,0.000011971799,0.00052442896],"genre_scores_gemma":[0.82304394,0.000014395049,0.17493074,0.0004989773,0.00059053674,0.00024239236,0.00016492163,0.00004298185,0.0004710996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983522,0.00010249652,0.00046946417,0.0005062892,0.00017063614,0.0003989107],"domain_scores_gemma":[0.9988394,0.00007573207,0.00032095725,0.00055000104,0.0001486795,0.000065261695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008532855,0.00036621897,0.0003551891,0.00021224009,0.00023804,0.00024366243,0.0005563275,0.00044613323,0.000007935586],"category_scores_gemma":[0.00005439056,0.00033579377,0.00011625589,0.00014244963,0.00026391455,0.00004155635,0.0004389477,0.0009109289,0.0000030494637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014975434,0.00005719513,0.0000042805527,0.00010794145,0.00003434804,0.0000015100743,0.00039811,0.12410805,0.07675644,0.0005217105,0.000030019723,0.79783064],"study_design_scores_gemma":[0.00064285845,0.00080705085,0.00006175126,0.0004838117,0.000009609336,0.000020611566,0.0000053789754,0.9461009,0.025932493,0.02323875,0.0020435909,0.00065320387],"about_ca_topic_score_codex":0.00014298903,"about_ca_topic_score_gemma":0.0016489354,"teacher_disagreement_score":0.8219929,"about_ca_system_score_codex":0.00015796426,"about_ca_system_score_gemma":0.00012598386,"threshold_uncertainty_score":0.9999094},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000089858004,0.00029611273,0.9948977,0.0006957842,0.0014748519,0.0015644564,0.000025148556,0.00030077857,0.0006553162],"genre_scores_gemma":[0.027576871,0.000036080095,0.9695538,0.0011616033,0.00081441057,0.00010625784,0.00005613529,0.000087638226,0.0006071982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940989,0.000060211663,0.0007629348,0.0023303325,0.0016673261,0.0010803202],"domain_scores_gemma":[0.9960483,0.000616061,0.00052770704,0.0018516271,0.0007058771,0.00025046692],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015374032,0.00089866284,0.00092598854,0.00092981814,0.0005983186,0.0008339459,0.0032021403,0.0004314854,0.000018342613],"category_scores_gemma":[0.00010586285,0.0007617335,0.00025788244,0.00077325554,0.0011729309,0.00089816964,0.001058706,0.00090296345,0.000033010503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000439715,0.00012119791,0.00004347642,0.00046097927,0.00008104362,0.00004896105,0.0014846234,0.15251061,0.000117168114,0.11682504,0.00009539066,0.72816753],"study_design_scores_gemma":[0.0007374171,0.0006565426,0.000052501528,0.0004807635,0.000021435451,0.00010792316,2.4313576e-7,0.8195897,0.00093427085,0.17094015,0.0055434504,0.0009356483],"about_ca_topic_score_codex":0.000025305131,"about_ca_topic_score_gemma":0.000038687132,"teacher_disagreement_score":0.7272319,"about_ca_system_score_codex":0.00029329048,"about_ca_system_score_gemma":0.0006075349,"threshold_uncertainty_score":0.99948335},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015473254,0.0007559002,0.98767763,0.00023308345,0.00067402376,0.00026594868,9.369466e-7,0.00013337865,0.01010438],"genre_scores_gemma":[0.021469193,0.00017513694,0.97725743,0.0005906101,0.00017271905,0.000007057666,0.0000012494967,0.000023367145,0.00030325478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997311,0.000026559348,0.00037894593,0.0010785457,0.0006858077,0.0005191646],"domain_scores_gemma":[0.9981789,0.00020687346,0.0002792328,0.0010042947,0.00019696775,0.00013371762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011493732,0.0004015814,0.00039878333,0.00050943036,0.00023826283,0.00048103512,0.0017944685,0.00020964265,0.0000070211204],"category_scores_gemma":[0.000044097196,0.00033868483,0.000037001126,0.00054530404,0.0008168194,0.0012582565,0.0006185707,0.00064089044,0.000012901086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005537561,0.0000070764686,0.000049810358,0.00004104108,0.000007845248,0.000032395277,0.0005770029,0.0543901,0.000063712345,0.19267324,0.0000011902758,0.7521511],"study_design_scores_gemma":[0.00016080565,0.00014550329,0.000075073534,0.0003582059,0.000007639305,0.00024074443,1.3092361e-7,0.9294843,0.0016490712,0.063983604,0.0034138367,0.0004810756],"about_ca_topic_score_codex":0.000014417575,"about_ca_topic_score_gemma":0.000019212106,"teacher_disagreement_score":0.87509423,"about_ca_system_score_codex":0.00016751698,"about_ca_system_score_gemma":0.00024723442,"threshold_uncertainty_score":0.99990654},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000141574565,0.0005013037,0.9938804,0.0010311967,0.0008479991,0.00040377947,0.0000036259123,0.00031245715,0.003005065],"genre_scores_gemma":[0.39077953,0.000032014897,0.60412085,0.0040580635,0.00051357184,0.000018334225,0.000012282598,0.000050096958,0.00041524068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952716,0.00013067258,0.00068929454,0.0019372804,0.0010709551,0.0009001837],"domain_scores_gemma":[0.99624324,0.0010263323,0.00034855847,0.001646931,0.0004558536,0.00027908955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018127796,0.0006885003,0.0006847488,0.00064005546,0.0002784661,0.00072537776,0.0037716008,0.0004645452,0.000015736849],"category_scores_gemma":[0.00017682245,0.0006300112,0.00015085604,0.0007803999,0.00083631696,0.00044970965,0.00039979277,0.001246959,0.00004316182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056814342,0.0000317196,0.0000018195632,0.000020191674,0.0000051337006,0.00004987672,0.00095436565,0.4423104,0.000010034495,0.048665605,0.000022646773,0.50792253],"study_design_scores_gemma":[0.00013827969,0.00021108269,0.000011399985,0.00032359545,0.0000055715864,0.000011422855,1.3004565e-7,0.6571125,0.00005358555,0.34146348,0.00014271337,0.00052626146],"about_ca_topic_score_codex":0.000021699503,"about_ca_topic_score_gemma":0.000047394555,"teacher_disagreement_score":0.5073963,"about_ca_system_score_codex":0.00035706654,"about_ca_system_score_gemma":0.0011009544,"threshold_uncertainty_score":0.99961513},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073059776,0.00014166145,0.9963893,0.0006976386,0.0008291939,0.00091445947,0.000019347302,0.000112477326,0.0001653122],"genre_scores_gemma":[0.9346779,0.000007961368,0.059257288,0.0048732846,0.000976005,0.000040612922,0.000028506634,0.000041848838,0.00009661281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973717,0.000064959764,0.0004825525,0.0010934059,0.0006044678,0.00038291738],"domain_scores_gemma":[0.9986689,0.00024107496,0.00036912374,0.000421407,0.00017331986,0.00012619406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005622082,0.00029803783,0.000344983,0.00032753698,0.000471862,0.00026096552,0.00048690953,0.00015436638,8.1072335e-7],"category_scores_gemma":[0.00019900723,0.00028611088,0.00009805467,0.00014769877,0.00019731434,0.00020121621,0.0000945415,0.00027770456,0.000004707822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063869616,0.0000030389233,0.0000029403707,0.00031802358,0.0000012105971,0.000003340856,0.0012744997,0.7542517,0.01628677,0.027564477,0.000008223327,0.20027934],"study_design_scores_gemma":[0.00024004992,0.00010895144,0.000006189021,0.0002473591,0.000005477133,0.000009620454,3.5911665e-7,0.9935529,0.0023475057,0.00307103,0.00016013082,0.0002503978],"about_ca_topic_score_codex":0.000009234575,"about_ca_topic_score_gemma":0.000055325974,"teacher_disagreement_score":0.937132,"about_ca_system_score_codex":0.00036301956,"about_ca_system_score_gemma":0.00045284675,"threshold_uncertainty_score":0.9999591},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048692827,0.005418247,0.98310983,0.00089263095,0.0006939537,0.0015505189,0.000044673256,0.000012291178,0.0034085854],"genre_scores_gemma":[0.4433755,0.0018654787,0.5391602,0.003494116,0.00599013,0.0002504373,0.00015564395,0.00017367903,0.0055348007],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986175,0.000008494146,0.00023381144,0.0006395594,0.00019433607,0.00030634608],"domain_scores_gemma":[0.99912566,0.00008584192,0.00014024228,0.00046966676,0.00013517187,0.00004344453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000255469,0.0002710697,0.00021805552,0.00007819293,0.0002771127,0.00006091173,0.0006291495,0.00021816266,0.00000443251],"category_scores_gemma":[0.00003974398,0.00020157464,0.00012092525,0.000064229105,0.0004703658,0.0000015396809,0.0003528352,0.00016059238,0.000007893633],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002447537,0.00009494848,0.00017708231,0.0001560228,0.00031849102,0.00000857422,0.0013012086,0.031492267,0.35380694,0.0006043108,0.007484983,0.6043104],"study_design_scores_gemma":[0.002899133,0.0022543003,0.0009320304,0.00034539512,0.00013477357,0.0002723809,0.0000016580461,0.21338022,0.12520155,0.020689014,0.6306735,0.0032160052],"about_ca_topic_score_codex":0.0000059557724,"about_ca_topic_score_gemma":0.000020035717,"teacher_disagreement_score":0.62318856,"about_ca_system_score_codex":0.00003726205,"about_ca_system_score_gemma":0.00023216572,"threshold_uncertainty_score":0.8219976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008557334,0.00012984972,0.9791327,0.00013955797,0.0025203375,0.00033678388,0.0000019848649,0.00023671931,0.01741646],"genre_scores_gemma":[0.04258826,0.000019015739,0.9551476,0.0016399273,0.0003788861,0.0000060567013,0.0000028010918,0.00003454303,0.00018290314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553293,0.000033813,0.0006405436,0.0014810853,0.0013830982,0.00092852436],"domain_scores_gemma":[0.99705046,0.00036075088,0.00026811004,0.0018735869,0.00025487432,0.00019219046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026024752,0.00052957004,0.000432419,0.0012611969,0.00032538272,0.00043871897,0.0040740366,0.0004307872,0.000014821623],"category_scores_gemma":[0.00018969126,0.00049289124,0.00013781928,0.0006617774,0.00038098672,0.0012651545,0.0011874487,0.0011644512,0.0001114902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006482564,0.000012099073,0.0000012230851,0.000012388147,0.0000027965382,0.000020605832,0.00021882865,0.22021157,0.00001936021,0.27144668,0.0000027400852,0.50804526],"study_design_scores_gemma":[0.000119900156,0.00014724668,0.000006931444,0.00017485853,0.0000024905437,0.000034829896,4.9809287e-8,0.76279765,0.0007954363,0.23524755,0.00025481937,0.00041820886],"about_ca_topic_score_codex":0.000012131261,"about_ca_topic_score_gemma":0.000014357425,"teacher_disagreement_score":0.5425861,"about_ca_system_score_codex":0.00045764938,"about_ca_system_score_gemma":0.00033978984,"threshold_uncertainty_score":0.9997523},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001959143,0.000588733,0.99626034,0.00013409865,0.0011309811,0.00026639857,0.000006870434,0.000071129405,0.0013455439],"genre_scores_gemma":[0.020904398,0.00014867811,0.97780746,0.000716044,0.00016607509,0.000002541661,0.0000036159206,0.000018979226,0.0002322243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967152,0.000028030578,0.00066477276,0.0012673258,0.00082299765,0.0005017149],"domain_scores_gemma":[0.99770993,0.0003313971,0.00044315422,0.0012119237,0.00016111064,0.00014248224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012933585,0.0003728689,0.00048176994,0.00066764833,0.00012003419,0.00028897007,0.0026060713,0.00017787516,0.000012604447],"category_scores_gemma":[0.000081227736,0.00035328284,0.0000802201,0.00044182027,0.0008894315,0.00069149793,0.002212442,0.0003926382,0.0000072358403],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042569764,0.000014885576,0.0003328596,0.00011342504,0.000010469231,0.000045540954,0.00017944134,0.0025803004,0.0001635121,0.012237103,0.000008620629,0.9843096],"study_design_scores_gemma":[0.0005619522,0.00023677787,0.0040202793,0.00037883501,0.000021171143,0.000039084232,7.261755e-7,0.93631136,0.002017341,0.054570783,0.0006201618,0.0012215106],"about_ca_topic_score_codex":0.00013872211,"about_ca_topic_score_gemma":0.000044989185,"teacher_disagreement_score":0.9830881,"about_ca_system_score_codex":0.00008577797,"about_ca_system_score_gemma":0.00020229333,"threshold_uncertainty_score":0.99989194},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021562651,0.0006088789,0.9968706,0.0011823995,0.0005834684,0.0002849968,0.00008932544,0.000036379377,0.00012835432],"genre_scores_gemma":[0.5113074,0.000736153,0.48624548,0.00066577696,0.00030107895,0.00001812896,0.00018284108,0.000026501997,0.00051663234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978332,0.000023324557,0.00041073462,0.0010112026,0.00046475875,0.00025677247],"domain_scores_gemma":[0.99662757,0.0009381094,0.00032113693,0.0018705729,0.00019658529,0.000046024314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012701483,0.00025414504,0.0003295179,0.00035906045,0.0002046456,0.00039878406,0.0029908514,0.00011515586,0.0000044949775],"category_scores_gemma":[0.0002229026,0.00017387934,0.0000613028,0.00036310384,0.00042512646,0.0008039667,0.0010985339,0.00032714385,0.0000021077378],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008391171,0.000015560174,0.000018460418,0.000019511857,0.000021919319,0.000004487826,0.00019890122,0.0015598638,0.0010791515,0.0043273224,0.00006445085,0.992682],"study_design_scores_gemma":[0.00018418739,0.00013350093,0.00014506078,0.00018266421,0.000033435615,0.000042089578,0.0000010874205,0.9876803,0.00016574223,0.008879466,0.0023443839,0.000208082],"about_ca_topic_score_codex":0.00007154484,"about_ca_topic_score_gemma":0.00050915545,"teacher_disagreement_score":0.9924739,"about_ca_system_score_codex":0.00007460298,"about_ca_system_score_gemma":0.0002360832,"threshold_uncertainty_score":0.70905936},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011393553,0.00027758235,0.9861775,0.0005419606,0.00022280608,0.0012032035,0.000009618454,0.00012745899,0.000046338904],"genre_scores_gemma":[0.7103912,0.000025046782,0.28915462,0.000128531,0.00009411548,0.00009636363,0.000018131217,0.000018063749,0.00007391943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99538636,0.00006851605,0.00069677463,0.0020362034,0.0011484489,0.00066366745],"domain_scores_gemma":[0.9967306,0.00067514455,0.00019213067,0.0014600211,0.0006896649,0.00025241464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016813226,0.00045853265,0.0007931389,0.0012787007,0.00041226184,0.00077931624,0.0019759876,0.00031737948,0.000026120091],"category_scores_gemma":[0.0002357855,0.00039838368,0.00033184144,0.0010174989,0.00058711227,0.00060100463,0.0010921917,0.0005996985,0.000013437086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009185687,0.00010076858,0.0007408473,0.00010944322,0.00009891416,0.000012516622,0.00042777258,0.4564984,0.00010966073,0.0028586506,0.0000017999616,0.53903204],"study_design_scores_gemma":[0.00016306905,0.000111984904,0.00033356607,0.00005390027,0.00012794489,0.000010292556,2.877557e-7,0.9633332,0.00015300304,0.035255056,0.000032487926,0.00042524136],"about_ca_topic_score_codex":0.00022349124,"about_ca_topic_score_gemma":0.00032436693,"teacher_disagreement_score":0.6989977,"about_ca_system_score_codex":0.00036713568,"about_ca_system_score_gemma":0.0003652183,"threshold_uncertainty_score":0.9998468},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005837077,0.00022665811,0.99699277,0.00042568482,0.00032649175,0.0004758745,0.0000072109437,0.00048169462,0.00047991637],"genre_scores_gemma":[0.59699583,0.000068092595,0.40243435,0.00024172985,0.00011279212,0.000007300646,0.000031304007,0.000019964351,0.00008862308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972612,0.000073270814,0.0007355066,0.00089987123,0.0005798707,0.00045026184],"domain_scores_gemma":[0.9981731,0.00023276245,0.00044323088,0.00074381666,0.00033294098,0.000074128024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039493514,0.00035413494,0.00043878067,0.0012009435,0.00018017371,0.00019251897,0.0011687706,0.00039284982,0.000023591156],"category_scores_gemma":[0.000111796064,0.0003400749,0.00007549855,0.00076307246,0.00020236183,0.00071794237,0.00028361115,0.0006065562,0.0000034565526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039818556,0.000030169469,0.00007785299,0.000011290459,0.0000047342046,0.0000033365666,0.00032590618,0.9399699,0.00066938996,0.009303284,0.000026077985,0.04957407],"study_design_scores_gemma":[0.00028003324,0.00006855788,0.00089144625,0.00024547265,0.000005365473,0.000019475205,1.4761937e-7,0.98323905,0.003321438,0.011307796,0.00029139372,0.00032980138],"about_ca_topic_score_codex":0.000031882315,"about_ca_topic_score_gemma":0.00015112468,"teacher_disagreement_score":0.5964121,"about_ca_system_score_codex":0.0004250048,"about_ca_system_score_gemma":0.0006334125,"threshold_uncertainty_score":0.9999051},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023493705,0.000051945914,0.97565573,0.000004209806,0.00037210408,0.000070213246,9.957589e-7,0.000049849572,0.00030126947],"genre_scores_gemma":[0.9723915,0.000010502212,0.027482972,0.000006616387,0.00006362243,5.49742e-7,0.000014795809,0.000013094287,0.00001635287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990971,0.000012523127,0.0003453328,0.00019683778,0.00023073383,0.00011749098],"domain_scores_gemma":[0.9994362,0.00013647175,0.00018146643,0.00011339869,0.00010050511,0.00003193089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024277493,0.00014253872,0.0002840632,0.0012505953,0.00008341991,0.000041261676,0.00010225186,0.00013167295,0.000032507978],"category_scores_gemma":[0.00004978002,0.00014505473,0.00006878025,0.00047431947,0.00013375308,0.00024802354,0.00005944868,0.0005538895,5.9174744e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015840899,0.0000025452364,0.0013807873,0.000034510565,0.000044012824,2.8332556e-7,0.0006599211,0.94826776,0.0075890245,0.000024654115,5.4007224e-8,0.041994836],"study_design_scores_gemma":[0.000052964147,0.00003101848,0.0036031734,0.000114811046,0.000095327865,0.000005795078,0.000001280177,0.9944433,0.0013742999,0.00014399731,0.000033243115,0.00010077942],"about_ca_topic_score_codex":0.000022058011,"about_ca_topic_score_gemma":0.00006119494,"teacher_disagreement_score":0.9488978,"about_ca_system_score_codex":0.0000684171,"about_ca_system_score_gemma":0.00003174576,"threshold_uncertainty_score":0.591516},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029558067,0.00039517612,0.9769648,0.0018858842,0.00093098707,0.00036669697,0.000007286193,0.0001057939,0.016387573],"genre_scores_gemma":[0.98908,0.00004286605,0.006194867,0.0001459577,0.0013385538,0.0000045061765,0.000017695122,0.000018134528,0.0031574056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724185,0.00021522182,0.0002777458,0.00066851533,0.0010399395,0.0005567458],"domain_scores_gemma":[0.9982077,0.00079702016,0.00015272251,0.00039309284,0.00023017095,0.00021930796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020981363,0.0003006916,0.00027677082,0.00060062733,0.0012482068,0.00035363133,0.0006967027,0.00047928633,0.00010121781],"category_scores_gemma":[0.00048253938,0.00025731628,0.00013849871,0.00044744348,0.0017752053,0.0005340132,0.00014831506,0.0011602645,0.00003154231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039364768,0.00004551362,0.0015948742,0.000009817293,0.000012231209,0.000017303384,0.003289973,0.008036973,0.000067004374,0.821689,0.000026098924,0.16517182],"study_design_scores_gemma":[0.00020411702,0.00018205699,0.008739187,0.00021005058,0.000017602018,0.000014546679,0.000005799399,0.019111149,0.00004140094,0.9681142,0.002750765,0.0006091264],"about_ca_topic_score_codex":0.00008345551,"about_ca_topic_score_gemma":0.002405938,"teacher_disagreement_score":0.9861242,"about_ca_system_score_codex":0.001440704,"about_ca_system_score_gemma":0.000783105,"threshold_uncertainty_score":0.9999879},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024848382,0.00035853576,0.9930947,0.0004961638,0.0020475185,0.00029551185,0.0000025239622,0.00011154486,0.00334504],"genre_scores_gemma":[0.12973763,0.00015802447,0.8677814,0.0012652696,0.00045629442,0.0000026667665,0.0000013963411,0.000044572556,0.0005527524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970386,0.00004636899,0.00039454413,0.0012257784,0.0007199548,0.00057476404],"domain_scores_gemma":[0.99790984,0.00027712996,0.00032230237,0.0011527681,0.0002132215,0.00012472838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004246896,0.00042572097,0.00034578203,0.00032744202,0.00051690073,0.00054709404,0.0022876884,0.00015685009,0.000036090292],"category_scores_gemma":[0.000039433482,0.00031476948,0.000114650335,0.00061522116,0.0008108819,0.0010663862,0.0007977854,0.00090743636,0.000024473085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001781821,0.000008141872,0.000007911886,0.000005080462,0.0000049924006,0.000019780198,0.00038161082,0.11530623,0.00020268581,0.005089151,0.0000049762066,0.87896764],"study_design_scores_gemma":[0.00012487432,0.000058148442,0.000028906294,0.00021015947,0.0000047748713,0.00028413735,8.3936425e-7,0.92092854,0.0013943316,0.07598147,0.0005987898,0.00038503023],"about_ca_topic_score_codex":0.000019688874,"about_ca_topic_score_gemma":0.00001306854,"teacher_disagreement_score":0.8785826,"about_ca_system_score_codex":0.00040046725,"about_ca_system_score_gemma":0.00024302451,"threshold_uncertainty_score":0.99993044},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011183584,0.00007812668,0.9973275,0.00016490753,0.0005504584,0.0004678953,0.000006509037,0.00012277273,0.0011699874],"genre_scores_gemma":[0.46669012,0.000036065885,0.5323636,0.00037825565,0.00022593005,0.000037409816,0.0000038378107,0.000029706962,0.00023507241],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744,0.00002373471,0.0006245463,0.0010253913,0.0005123765,0.00037396612],"domain_scores_gemma":[0.99831456,0.00011834116,0.00035508323,0.0008788914,0.00019373477,0.00013940559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004362578,0.0003351061,0.00041150948,0.00085185945,0.0000956023,0.00007156971,0.001594722,0.00031926628,0.00007439584],"category_scores_gemma":[0.000036069596,0.0003350685,0.00012169263,0.0006653545,0.00021296271,0.00037831423,0.0005676246,0.0006017855,0.00004731011],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047910808,0.000029619538,0.00005153323,0.00001402112,0.0000040701684,0.0000049609257,0.00017108108,0.00020286959,0.00014778327,0.00075778353,0.000006687926,0.9986048],"study_design_scores_gemma":[0.0006662336,0.0006721603,0.0025216462,0.0008207079,0.000018733534,0.00010083525,2.704084e-7,0.15450318,0.019311056,0.8195326,0.0007602387,0.0010923874],"about_ca_topic_score_codex":0.00023991262,"about_ca_topic_score_gemma":0.00032483588,"teacher_disagreement_score":0.9975124,"about_ca_system_score_codex":0.00020380494,"about_ca_system_score_gemma":0.00031259767,"threshold_uncertainty_score":0.9999101},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010840824,0.0008130001,0.99638844,0.00004416095,0.0009016273,0.00025653263,0.000012635824,0.00028905505,0.00021047458],"genre_scores_gemma":[0.7456087,0.00004999039,0.25365257,0.00003977619,0.0005526899,0.0000035809455,0.000030557312,0.000044983528,0.000017162865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987136,0.000012827995,0.00025283842,0.00039900982,0.0003349352,0.00028677058],"domain_scores_gemma":[0.9994267,0.000036110352,0.00006961563,0.00026304348,0.00011469661,0.000089791516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016509417,0.00028610637,0.00025783046,0.00018771125,0.00011292117,0.00012168478,0.00016757843,0.00019661631,0.0000025228474],"category_scores_gemma":[0.000007274372,0.00025241805,0.00002482612,0.00020842644,0.00020037062,0.00019763717,0.000054757234,0.00019752448,0.0000018861432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003585203,0.0000071886516,0.000095812946,0.0004217434,0.000010755559,0.0000040093378,0.00030659154,0.97047067,0.000028188635,0.0053605875,0.0000031480204,0.023287693],"study_design_scores_gemma":[0.00012224188,0.000051765204,0.000042135023,0.0005012265,0.00002233542,0.00009706949,0.00000276141,0.99720716,0.00014336043,0.0012384054,0.00027394047,0.00029758675],"about_ca_topic_score_codex":0.000022309056,"about_ca_topic_score_gemma":0.000058146663,"teacher_disagreement_score":0.7445246,"about_ca_system_score_codex":0.00054406154,"about_ca_system_score_gemma":0.000063417436,"threshold_uncertainty_score":0.9999928},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043739425,0.0005825699,0.99255943,0.00040480174,0.00054390164,0.0009820858,0.000011525527,0.00025300393,0.00028871006],"genre_scores_gemma":[0.09723584,0.00007911214,0.9017695,0.0003174841,0.00019955447,0.00010307945,0.000008523326,0.000066176355,0.00022070513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954034,0.000046973495,0.0006240188,0.0016091155,0.001197501,0.0011189763],"domain_scores_gemma":[0.9926977,0.0054442645,0.00014145228,0.0011711044,0.00027971738,0.00026571765],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021108182,0.00057528476,0.00071283453,0.0014075887,0.0002190666,0.0012365562,0.0032889259,0.00030282093,0.000020182817],"category_scores_gemma":[0.0007847916,0.0005096238,0.00010168194,0.0004507104,0.00073165377,0.0009999577,0.0018230443,0.0008772322,0.000034337256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011734506,0.00005989938,0.00062141434,0.00065980037,0.000036945166,0.000064080945,0.0024996204,0.041042645,0.00027734236,0.08003039,0.00005921542,0.8746369],"study_design_scores_gemma":[0.0003383439,0.00012228916,0.0015926358,0.00062636053,0.000004451303,0.000040814062,4.511588e-7,0.8647324,0.00019921798,0.13102321,0.00075469416,0.0005651415],"about_ca_topic_score_codex":0.0001327637,"about_ca_topic_score_gemma":0.00013177798,"teacher_disagreement_score":0.8740718,"about_ca_system_score_codex":0.0003410876,"about_ca_system_score_gemma":0.0006004466,"threshold_uncertainty_score":0.99980026},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018865314,0.0002480341,0.8833807,0.0011302927,0.0011845891,0.0004380013,0.0000040790956,0.0002151289,0.113380305],"genre_scores_gemma":[0.050843135,0.0000458956,0.94368464,0.0038457813,0.00076186756,0.000013447782,0.0000030919318,0.00004135166,0.0007607716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949059,0.00004640164,0.0004966678,0.00212892,0.0013928782,0.0010292679],"domain_scores_gemma":[0.9970816,0.00026985465,0.00016455917,0.0019447369,0.0001510712,0.00038820435],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010668987,0.0005943126,0.000572759,0.0011025327,0.00036513974,0.0010618919,0.0056597544,0.00030878786,0.00002195933],"category_scores_gemma":[0.00006540355,0.00050404854,0.00015961594,0.0009948201,0.00040505474,0.00052573986,0.0026154402,0.0011135669,0.0002472323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002361818,0.00005437641,0.000017333825,0.00003237947,0.000009204963,0.00008112593,0.0012406323,0.040685307,0.000032881395,0.041768294,0.0003541558,0.91572195],"study_design_scores_gemma":[0.00017493866,0.00016230856,0.000056993154,0.00016100773,0.0000037707582,0.00010447218,1.1490127e-7,0.92360973,0.000053476466,0.064645186,0.010252148,0.0007758204],"about_ca_topic_score_codex":0.000016060167,"about_ca_topic_score_gemma":0.000009835136,"teacher_disagreement_score":0.91494614,"about_ca_system_score_codex":0.00027684213,"about_ca_system_score_gemma":0.00030501842,"threshold_uncertainty_score":0.9999751},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046216173,0.0016598211,0.9935623,0.0016459381,0.0011622043,0.001284746,0.000003882177,0.000087146625,0.00054775795],"genre_scores_gemma":[0.115554176,0.000369681,0.8803029,0.0022729328,0.0007103489,0.00006392692,0.000029554281,0.00003777063,0.00065868953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741596,0.000031459145,0.0005493786,0.0008983767,0.0005738614,0.000530967],"domain_scores_gemma":[0.9977699,0.0002615433,0.0003909507,0.0012488242,0.00012940989,0.00019937767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008652518,0.0003910211,0.0004134396,0.0002721501,0.0004032241,0.0005046484,0.0016934955,0.00021728287,0.000009490118],"category_scores_gemma":[0.000020462716,0.00035515573,0.00010405656,0.00019982041,0.0001786551,0.0005101497,0.0009986679,0.00030972328,0.000009298325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010647389,0.000043265085,0.00006151738,0.00010715951,0.000029927345,0.0000072635094,0.0024689208,0.08001507,0.000031043037,0.25284597,0.00049627555,0.6638829],"study_design_scores_gemma":[0.001422694,0.00030542043,0.00041413735,0.001059658,0.000021007045,0.000039087885,3.7615925e-7,0.5336214,0.00031200016,0.44275573,0.019264527,0.00078400807],"about_ca_topic_score_codex":0.00011419659,"about_ca_topic_score_gemma":0.00019074896,"teacher_disagreement_score":0.66309893,"about_ca_system_score_codex":0.00047757395,"about_ca_system_score_gemma":0.00038010877,"threshold_uncertainty_score":0.99989},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002252283,0.00036704863,0.9927099,0.002563948,0.0016340715,0.0002754858,0.0000033550725,0.00011370758,0.0021072521],"genre_scores_gemma":[0.5226152,0.000046470454,0.46891665,0.0059783566,0.0014755977,0.000013083915,0.000035651068,0.000046848527,0.0008721656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963958,0.000045829427,0.00060975854,0.0014081444,0.0009584296,0.00058202934],"domain_scores_gemma":[0.9981651,0.00048672233,0.00023278115,0.00086104794,0.000090486836,0.00016389156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010543545,0.00045887483,0.0004962537,0.001470532,0.0001784054,0.00040896528,0.0022655318,0.00029375264,0.000016390788],"category_scores_gemma":[0.000086334665,0.00045081085,0.00011145211,0.0009979475,0.00028476556,0.0004474078,0.00044807862,0.0007240671,0.00004627266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067764477,0.00003157728,0.00006681141,0.00003064976,0.00000619208,0.000080868376,0.0006832007,0.11686051,0.00026504055,0.07874476,0.0000871206,0.80313647],"study_design_scores_gemma":[0.00045007045,0.00018721394,0.00090515387,0.00028414757,0.0000045649317,0.00009426076,9.4526655e-8,0.8145706,0.0010536163,0.17301255,0.008696505,0.00074123545],"about_ca_topic_score_codex":0.00002517405,"about_ca_topic_score_gemma":0.000118642085,"teacher_disagreement_score":0.8023953,"about_ca_system_score_codex":0.00025810176,"about_ca_system_score_gemma":0.00048393698,"threshold_uncertainty_score":0.99979436},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06868748,0.00077754114,0.92848104,0.00008137714,0.0014232446,0.00030241543,0.000018111581,0.00020182105,0.000026942565],"genre_scores_gemma":[0.62701714,0.000006850535,0.37215957,0.00015174755,0.00062016107,0.000017675875,0.000007530267,0.00001837478,9.736127e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983377,0.0000664541,0.00027524485,0.00040088134,0.00025250853,0.0006672508],"domain_scores_gemma":[0.9974677,0.0018967746,0.000055488323,0.00035339556,0.00013823537,0.00008843284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046969688,0.00024048664,0.00034682537,0.00019724158,0.00017686847,0.00008162555,0.0003236676,0.000104119405,0.000008388801],"category_scores_gemma":[0.0001838835,0.00021916025,0.00007739338,0.0006317762,0.00013533272,0.00056352257,0.00013542485,0.00020035746,0.000021616399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072297466,0.000013369037,0.0014742058,0.000015146529,0.000022100841,3.086579e-7,0.0008916798,0.85998267,0.016609272,0.00002733508,0.000013083138,0.12094362],"study_design_scores_gemma":[0.0002316441,0.0000379726,0.019826012,0.000013598263,0.000021592185,5.845442e-7,0.0000017902021,0.9590938,0.01784141,0.0022238947,0.0004476674,0.0002600204],"about_ca_topic_score_codex":0.000026093834,"about_ca_topic_score_gemma":0.0000072903044,"teacher_disagreement_score":0.55832964,"about_ca_system_score_codex":0.00014370013,"about_ca_system_score_gemma":0.000026795395,"threshold_uncertainty_score":0.8937096},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4747082,0.000042586023,0.5242593,0.00057540956,0.00014856736,0.00021273893,7.330728e-7,0.00003599023,0.000016439593],"genre_scores_gemma":[0.86490864,0.0000010821802,0.131691,0.0032340898,0.000140573,0.000006739632,0.000009295197,0.000008292621,3.1681014e-7],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986191,0.00005029207,0.00015350447,0.00038366255,0.00034008335,0.0004534052],"domain_scores_gemma":[0.9991337,0.00035452016,0.0000717387,0.00018896742,0.0000799452,0.00017112865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018863975,0.00017073065,0.00023009987,0.00012157274,0.00013799653,0.00004314844,0.0001348588,0.00006379326,0.000012128124],"category_scores_gemma":[0.00016908364,0.0001118625,0.000035858648,0.0006202593,0.00016428049,0.0002614786,0.00009802628,0.00019815785,0.0000062886265],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023687303,0.00057948,0.3117496,0.000017088343,0.000019261288,0.00005874281,0.0013198018,0.0158212,0.002471145,0.000012420303,0.0000065646077,0.6677078],"study_design_scores_gemma":[0.0018308834,0.000818408,0.6865984,0.00004073013,0.000012700373,0.000025198893,0.0000017512804,0.30568564,0.0045657847,0.00027163737,0.000015595797,0.00013325056],"about_ca_topic_score_codex":0.000049904847,"about_ca_topic_score_gemma":0.000037466605,"teacher_disagreement_score":0.6675746,"about_ca_system_score_codex":0.000094408846,"about_ca_system_score_gemma":0.000063094536,"threshold_uncertainty_score":0.45616204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000084604224,0.0009830993,0.9901159,0.0010647491,0.0013278314,0.00048965384,0.000031955376,0.00035689885,0.005545322],"genre_scores_gemma":[0.17627394,0.0003268262,0.8185599,0.003250628,0.0011113351,0.000038254246,0.000039214494,0.000097101394,0.00030283353],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947839,0.000032886943,0.0006429901,0.0023675552,0.0011774447,0.0009952505],"domain_scores_gemma":[0.99612117,0.00025990707,0.00033517374,0.0027310974,0.00026139544,0.0002912867],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00066634885,0.00073455524,0.0006360933,0.0010501683,0.0003941192,0.0010380844,0.00563344,0.00047791848,0.000074155694],"category_scores_gemma":[0.00006532922,0.000667861,0.0002550423,0.001213192,0.0008710997,0.0011222374,0.0020334555,0.0012575038,0.00015194567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006370238,0.00007741107,0.00006421258,0.00008050351,0.000023884913,0.00013705395,0.0008741344,0.0006856885,0.00028393482,0.33428997,0.00031407105,0.66316277],"study_design_scores_gemma":[0.00046199714,0.00027806804,0.00018041012,0.00047537443,0.000020024732,0.00020701601,2.033913e-7,0.23866062,0.0032870923,0.68748724,0.06706401,0.0018779733],"about_ca_topic_score_codex":0.00002068057,"about_ca_topic_score_gemma":0.000038064187,"teacher_disagreement_score":0.6612848,"about_ca_system_score_codex":0.00016465603,"about_ca_system_score_gemma":0.00027674824,"threshold_uncertainty_score":0.9999989},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009982531,0.00036050702,0.9945781,0.0015531076,0.001484834,0.00031690448,0.000043616055,0.00016987845,0.00049479055],"genre_scores_gemma":[0.14023526,0.000083263,0.85379595,0.003602754,0.0004708097,0.000031002917,0.000081856735,0.000075381075,0.0016237481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963346,0.00003909649,0.0005181343,0.0017239758,0.0007166339,0.00066751917],"domain_scores_gemma":[0.9974049,0.00034706848,0.00029067034,0.0014566344,0.00033557898,0.00016519269],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096505776,0.00051973935,0.00056133454,0.0011424272,0.00042059828,0.0007649822,0.002982025,0.00034551878,0.000017802744],"category_scores_gemma":[0.00012979735,0.00047075306,0.00023085307,0.0006978496,0.00040967052,0.00078109547,0.00061632367,0.00056321436,0.000035278765],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009965486,0.00004584889,0.000048677033,0.000079474725,0.000057656194,0.00003540843,0.0009638479,0.014152138,0.0029026535,0.0043734782,0.00012273513,0.97720814],"study_design_scores_gemma":[0.0004043077,0.0002589438,0.00003340554,0.0002513163,0.000034794986,0.00008533399,8.891882e-7,0.9560007,0.00084023125,0.035115212,0.006093338,0.0008815452],"about_ca_topic_score_codex":0.000022581573,"about_ca_topic_score_gemma":0.000105232415,"teacher_disagreement_score":0.9763266,"about_ca_system_score_codex":0.00020189227,"about_ca_system_score_gemma":0.00047849715,"threshold_uncertainty_score":0.9997744},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082401064,0.00046776902,0.99647367,0.00024435495,0.00025261636,0.0003979329,0.0000047628223,0.00003535512,0.0012995506],"genre_scores_gemma":[0.6720004,0.0007445031,0.31160077,0.0010784969,0.00092706585,0.00010200025,0.000011050694,0.00008809002,0.013447608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970544,0.00006498865,0.00053951103,0.0011340918,0.0007186687,0.00048834045],"domain_scores_gemma":[0.9965848,0.0024989983,0.0002991829,0.00038416398,0.00014846887,0.000084437466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036128236,0.0002608383,0.00036438616,0.00082696485,0.0004135717,0.00040906068,0.0009182745,0.0001893088,0.000112758236],"category_scores_gemma":[0.0004215658,0.00022558954,0.000075681244,0.0006281629,0.00041772742,0.00028697992,0.00024157604,0.0006777249,0.000029255752],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004873595,0.000008826134,0.000093485054,0.0000046739565,0.0000031054753,0.0000028526663,0.0004840061,0.02365889,0.000012719943,0.003011777,0.000014130037,0.97270066],"study_design_scores_gemma":[0.00015852507,0.00006249696,0.00004591732,0.00007674901,0.0000037286247,0.000019115618,0.000002466515,0.6539135,0.00008241141,0.33494845,0.01047254,0.00021408086],"about_ca_topic_score_codex":0.0000042945517,"about_ca_topic_score_gemma":0.000022805549,"teacher_disagreement_score":0.97248656,"about_ca_system_score_codex":0.00014487514,"about_ca_system_score_gemma":0.00011140921,"threshold_uncertainty_score":0.9199275},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005041658,0.00010777825,0.9921503,0.0010436581,0.0033271157,0.00029159087,0.0000013445233,0.0002239675,0.0023500654],"genre_scores_gemma":[0.07061162,0.000017656195,0.9208078,0.007795108,0.00046046588,0.000009246579,0.0000032564785,0.000039967443,0.00025488232],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967735,0.00006366312,0.00039078548,0.0013615846,0.00079257163,0.00061790366],"domain_scores_gemma":[0.9974723,0.00020172613,0.00015951948,0.0016674426,0.0002453342,0.00025371197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00121182,0.00044871558,0.000386507,0.00088320655,0.0004268957,0.0008290166,0.003559427,0.0002931057,0.000012341289],"category_scores_gemma":[0.00012445457,0.00044167563,0.00007994896,0.0009477536,0.00021473064,0.00088067685,0.00096368196,0.000795158,0.00008225143],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005505865,0.000024227937,0.00006396481,0.00002366808,0.0000083837685,0.000051751595,0.0016701295,0.015826635,0.00028848634,0.046934783,0.000038785693,0.93506366],"study_design_scores_gemma":[0.00047285104,0.0009635109,0.0010704352,0.0008799594,0.000013603435,0.00034577984,6.4176004e-7,0.24432561,0.0155106755,0.7016294,0.0316883,0.0030992199],"about_ca_topic_score_codex":0.000071704315,"about_ca_topic_score_gemma":0.00016280156,"teacher_disagreement_score":0.93196446,"about_ca_system_score_codex":0.00048847526,"about_ca_system_score_gemma":0.00051630894,"threshold_uncertainty_score":0.9998035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014852619,0.000053291467,0.9811594,0.00056220475,0.0013463501,0.0005817148,0.000001702509,0.0002701146,0.0011725876],"genre_scores_gemma":[0.5672476,0.000019305613,0.4301098,0.0020535185,0.0005003652,0.000004420845,0.000016554486,0.00001680114,0.000031599826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99525183,0.00006876518,0.0009058845,0.0011958085,0.0019320481,0.000645641],"domain_scores_gemma":[0.9974854,0.00025129467,0.0003926829,0.0013233756,0.00035180151,0.00019544011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016453286,0.00047939236,0.00046076873,0.0010057228,0.00041375004,0.0007865827,0.002780159,0.00035108818,0.0000072382063],"category_scores_gemma":[0.0001944253,0.00043883958,0.00008563606,0.0011879945,0.00035061926,0.0043905517,0.0007088577,0.0010075828,0.000023222747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013122204,0.00008747486,0.0005385933,0.000026964051,0.000006988003,0.000026163021,0.008423401,0.023299202,0.000016494418,0.0013063775,0.0000074506843,0.9662478],"study_design_scores_gemma":[0.0004607638,0.0011339147,0.002450386,0.00020018112,0.000009432181,0.00005651694,0.000002747249,0.948435,0.00009209054,0.045807045,0.0007379273,0.0006139723],"about_ca_topic_score_codex":0.000014670384,"about_ca_topic_score_gemma":0.00001225758,"teacher_disagreement_score":0.9656338,"about_ca_system_score_codex":0.00030157703,"about_ca_system_score_gemma":0.00053396187,"threshold_uncertainty_score":0.99980634},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004226183,0.0019295219,0.9892531,0.00009991737,0.0006395649,0.00046169412,0.00000453192,0.000113876755,0.0032715846],"genre_scores_gemma":[0.9944369,0.00003673185,0.0052469797,0.000029997482,0.00013660999,0.000009768053,0.00000258839,0.000032974574,0.00006740407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858415,0.000026606906,0.0004945686,0.00023392511,0.0003372692,0.00032349327],"domain_scores_gemma":[0.9976425,0.0012343235,0.00016256692,0.0008227366,0.0001120324,0.000025831749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060245814,0.00022709092,0.0002474701,0.000099171535,0.00050087104,0.00012483024,0.001029235,0.00011315701,0.0000037862412],"category_scores_gemma":[0.000086893364,0.00014699054,0.00008468243,0.0002493674,0.00058722467,0.00007091021,0.00022469368,0.0004652537,0.0000069218954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016468257,0.0000041285252,0.000042808373,0.000026845843,0.000014021951,0.000001162975,0.000494087,0.88062346,0.0027596427,0.0027207765,0.000024849653,0.11328656],"study_design_scores_gemma":[0.00010310317,0.000016310772,0.00032849287,0.00028687366,0.000019087787,0.0000102122,0.0000020364655,0.9561185,0.011609364,0.023441238,0.007719346,0.00034541733],"about_ca_topic_score_codex":0.00016350408,"about_ca_topic_score_gemma":0.00021804603,"teacher_disagreement_score":0.9902108,"about_ca_system_score_codex":0.00011565572,"about_ca_system_score_gemma":0.00007328957,"threshold_uncertainty_score":0.59941006},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031669415,0.00089448894,0.99585426,0.0009605825,0.0010277777,0.0002448491,0.000059732003,0.000028540138,0.00061304873],"genre_scores_gemma":[0.25821188,0.0003159241,0.7112308,0.018777719,0.00623998,0.000040004517,0.0015934806,0.00011808365,0.003472137],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99837536,0.000010457124,0.00033741994,0.00048790345,0.00044813773,0.0003407286],"domain_scores_gemma":[0.9989622,0.000076005104,0.00016487879,0.00040073757,0.00025463532,0.0001415325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005641274,0.00023814918,0.00026000687,0.00021899848,0.00009222529,0.00008009109,0.0006337007,0.00062564365,0.00001603507],"category_scores_gemma":[0.00048490506,0.00019968572,0.00008964713,0.00014519985,0.0010330101,0.000011338295,0.00034154352,0.00025128367,0.000011834153],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069211426,0.000018412387,0.000039820203,0.00008149365,0.000034460147,0.0000050425906,0.00095514394,0.00024649838,0.0017002998,0.00027272743,0.008974547,0.98760235],"study_design_scores_gemma":[0.0008503477,0.00083387445,0.000042941138,0.00023129753,0.000012939383,0.00003711466,0.0000027331826,0.01157722,0.008058069,0.016073309,0.9617047,0.00057545357],"about_ca_topic_score_codex":0.0000031626346,"about_ca_topic_score_gemma":0.0000025867073,"teacher_disagreement_score":0.9870269,"about_ca_system_score_codex":0.00006428706,"about_ca_system_score_gemma":0.00047320145,"threshold_uncertainty_score":0.8142947},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000978967,0.0011895951,0.99451876,0.0011787001,0.0002814458,0.00019095241,0.0000033216224,0.00005613757,0.001602146],"genre_scores_gemma":[0.8386266,0.000047580637,0.15964448,0.0010164437,0.00039940223,0.0000029313649,0.0000037663326,0.000015037778,0.0002437531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734396,0.000044333137,0.00054231036,0.000943668,0.00071489,0.00041086835],"domain_scores_gemma":[0.9976849,0.00067832984,0.00054601795,0.0008244015,0.00018393023,0.00008240442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014219834,0.00033191327,0.0007583912,0.0009568079,0.0002892833,0.00040409388,0.0018448485,0.00019152908,0.000008884572],"category_scores_gemma":[0.00009383732,0.00023614512,0.00018213772,0.0011555972,0.0015194112,0.00039372616,0.00099444,0.00046892918,0.0000020009452],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043151167,0.000008566434,0.0007730506,0.000025247764,0.00010510831,0.0000050722333,0.0019762216,0.007861483,0.000053075775,0.007926134,0.0000134701795,0.98124826],"study_design_scores_gemma":[0.0005707692,0.00004117383,0.0035719825,0.00033641112,0.0002471963,0.000009380984,2.774619e-7,0.9657717,0.00065728684,0.026654469,0.0016751561,0.00046424137],"about_ca_topic_score_codex":0.000049800536,"about_ca_topic_score_gemma":0.00011670608,"teacher_disagreement_score":0.980784,"about_ca_system_score_codex":0.00008956686,"about_ca_system_score_gemma":0.00017813756,"threshold_uncertainty_score":0.96297187},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005196416,0.0005329198,0.99049985,0.000213081,0.0014921636,0.00032500137,0.000004789441,0.003796797,0.003083414],"genre_scores_gemma":[0.9617137,0.000044815544,0.036063693,0.0015187932,0.00028021508,0.000010579192,0.000008655055,0.000049089074,0.00031047963],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959328,0.000052547588,0.0005695788,0.0017034849,0.0009767008,0.0007648519],"domain_scores_gemma":[0.9967857,0.00068623445,0.00038688284,0.0017099491,0.00023459557,0.00019663775],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011036386,0.00063663203,0.00056542625,0.00072140683,0.00036148875,0.0006347927,0.0031884664,0.00043092744,0.00003432281],"category_scores_gemma":[0.00020711728,0.0006136106,0.00015831164,0.000559889,0.0005858688,0.0008237235,0.0014283252,0.00086011516,0.00006761462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028218803,0.000022540056,0.00017984456,0.000022675054,0.000005228744,0.000021072081,0.00032384763,0.00038337964,0.00013864401,0.0013033035,0.00087307027,0.9967236],"study_design_scores_gemma":[0.00015217232,0.00015862682,0.00012962041,0.0004836846,0.0000063962084,0.00010330836,3.1650055e-10,0.0019162616,0.0016300072,0.9932732,0.0014405794,0.0007061168],"about_ca_topic_score_codex":0.00013465532,"about_ca_topic_score_gemma":0.000014027864,"teacher_disagreement_score":0.99601746,"about_ca_system_score_codex":0.00040554846,"about_ca_system_score_gemma":0.0002672843,"threshold_uncertainty_score":0.9996315},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000986211,0.0011037738,0.9928832,0.0023069389,0.0013735314,0.0010751412,0.00002958914,0.00007286014,0.0010563473],"genre_scores_gemma":[0.09273538,0.00003021122,0.9055617,0.0010883603,0.00047043661,0.00006481118,0.000010263334,0.000023097498,0.000015742819],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996332,0.000055509743,0.00086142204,0.0012773235,0.0009183917,0.00055536604],"domain_scores_gemma":[0.99557084,0.001278559,0.000804994,0.0015002245,0.0006802451,0.00016511093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006546513,0.00048646514,0.00082716055,0.00056059065,0.00014021447,0.00015545226,0.0025658777,0.0004709951,0.00005539514],"category_scores_gemma":[0.000113620816,0.00041927147,0.00026527475,0.0006522475,0.0005246946,0.0006950099,0.0012481108,0.0006718135,0.000017141278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058017955,0.00017785268,0.00006152691,0.0005306705,0.000102689846,0.000016386271,0.0026831063,0.00458913,0.00082088535,0.37679958,0.00007604424,0.6140841],"study_design_scores_gemma":[0.00036623637,0.000454094,0.00019139845,0.0015336837,0.000041944004,0.000031926575,0.0000015401333,0.2561896,0.0042371936,0.7326394,0.0037476171,0.0005653648],"about_ca_topic_score_codex":0.00037775334,"about_ca_topic_score_gemma":0.00017537846,"teacher_disagreement_score":0.6135187,"about_ca_system_score_codex":0.00018154926,"about_ca_system_score_gemma":0.0010176632,"threshold_uncertainty_score":0.9998259},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017079858,0.00009757622,0.98655236,0.0008012524,0.00094049756,0.0006823484,0.000003970468,0.00018702584,0.010564192],"genre_scores_gemma":[0.42189416,0.000011903403,0.57382065,0.0031284748,0.0007313101,0.0000242955,0.000013340583,0.000040412353,0.00033548698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963645,0.00004024322,0.0005265051,0.0014172237,0.0010737132,0.00057783374],"domain_scores_gemma":[0.9979756,0.00019337125,0.0002511014,0.0012048951,0.0001629662,0.000212062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006995823,0.00046435834,0.0004621082,0.0011497689,0.00023815487,0.0006259749,0.0021407162,0.00027106202,0.00002768767],"category_scores_gemma":[0.000042851298,0.00043715525,0.00012627615,0.0007462478,0.00020807522,0.0005255356,0.00039197126,0.00042362028,0.00014369636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016648506,0.00011855632,0.00018151986,0.00016534062,0.000021038535,0.000028257615,0.006980339,0.38879177,0.00082264515,0.05324349,0.00014821581,0.54948217],"study_design_scores_gemma":[0.00039374275,0.00010354373,0.00035970437,0.0003927398,0.000006227318,0.00002262745,5.0060385e-7,0.98086065,0.0026802693,0.009792389,0.004624472,0.0007631438],"about_ca_topic_score_codex":0.000086697066,"about_ca_topic_score_gemma":0.000027259148,"teacher_disagreement_score":0.59206885,"about_ca_system_score_codex":0.00041083494,"about_ca_system_score_gemma":0.00040587972,"threshold_uncertainty_score":0.999808},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050592695,0.00030537034,0.99538904,0.00034138208,0.0018151175,0.0006152489,0.000025641612,0.00010971271,0.0013479159],"genre_scores_gemma":[0.05100997,0.000057848698,0.94478315,0.0008953155,0.0007212675,0.000020225447,0.00020696416,0.00004745141,0.002257805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973446,0.000018084294,0.00034752215,0.0011618913,0.00072133593,0.00040654937],"domain_scores_gemma":[0.99844176,0.00015884201,0.00023802117,0.00072277273,0.00029691085,0.00014166892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094800023,0.00033264133,0.00029319094,0.00057735096,0.00021410396,0.0007417282,0.001503092,0.00014549227,0.000004711882],"category_scores_gemma":[0.00007225974,0.00031883517,0.000051858853,0.00035018192,0.00031123805,0.0009401764,0.00095253566,0.0002498917,0.0000170485],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008507035,0.000029138462,0.000027945218,0.000034141973,0.000009083826,0.00001837033,0.00041904286,0.010257138,0.000050205945,0.020767469,0.00024783745,0.9681311],"study_design_scores_gemma":[0.00046183888,0.00017366803,0.00014000617,0.00008657313,0.0000109885905,0.000015500642,2.4443523e-7,0.92077285,0.00015462853,0.0694892,0.00829725,0.00039723978],"about_ca_topic_score_codex":0.000010475296,"about_ca_topic_score_gemma":0.000016578007,"teacher_disagreement_score":0.96773386,"about_ca_system_score_codex":0.00015209963,"about_ca_system_score_gemma":0.0001603591,"threshold_uncertainty_score":0.9999264},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047324545,0.0017447876,0.98924327,0.00095268653,0.0027805895,0.00024109958,0.000112117865,0.00033425473,0.0045438446],"genre_scores_gemma":[0.041445095,0.000056553996,0.95393366,0.0024091366,0.0012749756,0.000003630542,0.00008726744,0.000059891976,0.0007297813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942075,0.000046824203,0.000680528,0.0027372192,0.0012395222,0.0010884259],"domain_scores_gemma":[0.99145705,0.002166444,0.00040420433,0.0054824837,0.00020105495,0.00028877633],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020107625,0.0006769228,0.0006265735,0.0007193647,0.00045198342,0.0008789589,0.01278698,0.00043711351,0.00004593491],"category_scores_gemma":[0.0005060005,0.00063114887,0.000100026766,0.0006566075,0.00057218637,0.0011763843,0.006493564,0.0014330038,0.000094304196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012174081,0.00002570437,0.00025939388,0.000040624254,0.000025422434,0.0016031185,0.00087724795,0.015016493,0.000058636957,0.010813279,0.0012028791,0.970065],"study_design_scores_gemma":[0.00038639948,0.00015986257,0.00018738957,0.001790723,0.000019300689,0.00024763995,4.3705703e-7,0.82428986,0.00053978164,0.15046594,0.020537185,0.0013754816],"about_ca_topic_score_codex":0.0004149889,"about_ca_topic_score_gemma":0.00043100512,"teacher_disagreement_score":0.96868956,"about_ca_system_score_codex":0.0002723479,"about_ca_system_score_gemma":0.00066727475,"threshold_uncertainty_score":0.999614},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006782558,0.00042362532,0.97946197,0.00013111226,0.0026675034,0.00037458105,0.0000021997057,0.00014321541,0.01611752],"genre_scores_gemma":[0.07177765,0.00010658448,0.92701185,0.000585689,0.00020334266,0.0000133678195,0.00000267677,0.00003158695,0.00026723623],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960874,0.0000811257,0.00071092707,0.0016270559,0.0007176823,0.0007758502],"domain_scores_gemma":[0.9973933,0.00033935579,0.00040055517,0.0015772919,0.0001438934,0.00014562187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019986862,0.00052710547,0.0005394843,0.0013990677,0.00017330245,0.00036084346,0.004804711,0.00040708715,0.000025588282],"category_scores_gemma":[0.00018693645,0.0005038432,0.00010598025,0.0010772467,0.0006855143,0.0012049368,0.0012891623,0.0010483931,0.000093429124],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008019099,0.00002688041,0.00037528388,0.000047572856,0.0000047944645,0.00006543072,0.0026632946,0.0043107644,0.000070907765,0.14325331,0.00000335462,0.8491704],"study_design_scores_gemma":[0.0006841694,0.000335,0.0031578683,0.0014794997,0.000008847503,0.000111876834,0.000001019442,0.3855104,0.0059216213,0.59690404,0.003967061,0.0019185636],"about_ca_topic_score_codex":0.00004801711,"about_ca_topic_score_gemma":0.00030922308,"teacher_disagreement_score":0.84725183,"about_ca_system_score_codex":0.0004860192,"about_ca_system_score_gemma":0.0004509213,"threshold_uncertainty_score":0.9997413},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033358493,0.00070410955,0.9855883,0.0006186862,0.0012562395,0.0006585614,0.000009481915,0.0002004635,0.010630554],"genre_scores_gemma":[0.39014578,0.00050439243,0.60374725,0.002882595,0.00041062085,0.000068854046,0.000015370493,0.00018001217,0.0020450985],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928979,0.00011138428,0.0007602382,0.0025062677,0.002254675,0.0014695307],"domain_scores_gemma":[0.9959549,0.0007431066,0.0002892326,0.002445895,0.00022263937,0.00034425265],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016831822,0.0007731327,0.0007623401,0.0031229896,0.0003033489,0.0006809586,0.0070487307,0.00052700745,0.00006427443],"category_scores_gemma":[0.00013185819,0.0007409165,0.00019544539,0.0018799886,0.0013291701,0.001094394,0.0018637596,0.0022442853,0.00015629738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017232365,0.0000927979,0.0004641472,0.00005489205,0.000018219878,0.0012789627,0.0013290872,0.00863033,0.000079866266,0.30161813,0.000040937906,0.6863754],"study_design_scores_gemma":[0.00049196265,0.00020170967,0.000612835,0.00034848455,0.000002935873,0.00017076309,2.70287e-7,0.09955159,0.00028830717,0.8965457,0.00092800055,0.0008574535],"about_ca_topic_score_codex":0.000040173192,"about_ca_topic_score_gemma":0.00041699337,"teacher_disagreement_score":0.68551797,"about_ca_system_score_codex":0.00062376575,"about_ca_system_score_gemma":0.00046304218,"threshold_uncertainty_score":0.9995042},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017999566,0.00089116255,0.99446625,0.00046771686,0.0025037245,0.00061647693,0.000006108459,0.00079827744,0.00023230635],"genre_scores_gemma":[0.0038944364,0.0002518585,0.9947066,0.000083158324,0.00070915656,0.00004077266,0.0000056189524,0.000051754065,0.0002566813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670994,0.000021628259,0.0005805138,0.0013840939,0.0006460068,0.0006578255],"domain_scores_gemma":[0.99602455,0.0018659987,0.00020272547,0.0015025338,0.00026663084,0.00013756403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008608156,0.0005248581,0.0005634616,0.0007857723,0.0004171878,0.00022049341,0.0033696739,0.00028409983,0.0000028509166],"category_scores_gemma":[0.00045832078,0.0005226962,0.00016577911,0.000561942,0.0004470017,0.00082323485,0.0005827769,0.0006193951,0.000019788944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035622018,0.0000140753955,0.000005030364,0.000047709305,0.000009994769,0.000021156964,0.0011079593,0.2541599,0.0006572686,0.0033641162,0.00001623574,0.740593],"study_design_scores_gemma":[0.000782279,0.00034289694,0.00011104089,0.000903351,0.000021863683,0.00019795912,6.1492443e-7,0.60913885,0.03170309,0.33642566,0.018266162,0.0021062407],"about_ca_topic_score_codex":0.000005225215,"about_ca_topic_score_gemma":0.0000035958644,"teacher_disagreement_score":0.73848677,"about_ca_system_score_codex":0.0003909583,"about_ca_system_score_gemma":0.0003550174,"threshold_uncertainty_score":0.9997225},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082878076,0.00037490367,0.99495304,0.00030657146,0.00053531985,0.00053654454,0.000004157058,0.00008447054,0.0031221197],"genre_scores_gemma":[0.38227797,0.00037598575,0.6135915,0.0013609661,0.00039123415,0.000028146436,0.00002090284,0.00007951549,0.0018737918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967542,0.000094741714,0.0007474991,0.0009104851,0.0008844688,0.00060857227],"domain_scores_gemma":[0.99782604,0.00045762715,0.0003767651,0.0010018647,0.00017645083,0.0001612736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013873242,0.00038338048,0.0006666383,0.0012669669,0.00009428817,0.00018759728,0.002187913,0.00031408205,0.00006935555],"category_scores_gemma":[0.0001306699,0.0003527464,0.00011397172,0.0007890783,0.00057151436,0.00075024617,0.0007455831,0.0004994958,0.00004893966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050749735,0.00009537383,0.00009258899,0.000051972966,0.000009940308,0.000045491342,0.0036287338,0.1668166,0.00026600563,0.0040380443,0.000022082415,0.8248824],"study_design_scores_gemma":[0.0016529969,0.00019611353,0.0001394908,0.00031873194,0.0000056021863,0.00003901102,1.5592333e-7,0.9789563,0.0009118318,0.016855568,0.00043077016,0.0004934576],"about_ca_topic_score_codex":0.000013794151,"about_ca_topic_score_gemma":0.000056983296,"teacher_disagreement_score":0.8243889,"about_ca_system_score_codex":0.00018593577,"about_ca_system_score_gemma":0.00046713708,"threshold_uncertainty_score":0.9998925},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011781564,0.0004801648,0.99582213,0.000103338985,0.0018788574,0.00078195636,0.000003917827,0.00006638184,0.00085146184],"genre_scores_gemma":[0.0022854926,0.00016084235,0.9970926,0.00015629808,0.00018438192,0.000016138174,0.0000023889647,0.000017952676,0.00008390689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971598,0.00003415589,0.0005713839,0.00103687,0.0008368106,0.00036102044],"domain_scores_gemma":[0.9963062,0.0012177966,0.00046838188,0.0015935802,0.0003182028,0.00009585989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012572785,0.00033193897,0.00039719752,0.0005895897,0.00030118146,0.00015148327,0.0034327004,0.00027451263,0.0000053989893],"category_scores_gemma":[0.0003155444,0.00024066129,0.00018715682,0.0007161214,0.0009436855,0.00047200278,0.00057679694,0.00044543602,0.0000042695888],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013128208,0.000010042698,0.00000914726,0.00001921682,0.000007314535,8.8336424e-7,0.0004664367,0.02036486,0.00005807901,0.06616382,0.000052841046,0.9128342],"study_design_scores_gemma":[0.00029311658,0.00010685582,0.00010197042,0.00010660038,0.0000093212,0.00011350815,2.795643e-7,0.8631836,0.0029383986,0.13109426,0.0017598005,0.00029226972],"about_ca_topic_score_codex":0.00002330301,"about_ca_topic_score_gemma":0.0000057417656,"teacher_disagreement_score":0.912542,"about_ca_system_score_codex":0.00012394846,"about_ca_system_score_gemma":0.0005066659,"threshold_uncertainty_score":0.9813883},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033418325,0.00032523085,0.99170095,0.00063387403,0.0020568268,0.0003881589,0.000007306819,0.0001942708,0.004359216],"genre_scores_gemma":[0.24111071,0.00008979018,0.7561163,0.0014561596,0.00038938,0.000014659839,0.000031242904,0.000068615234,0.000723182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957146,0.000030458868,0.0005850948,0.0017850831,0.0009520357,0.0009327251],"domain_scores_gemma":[0.9977553,0.0003651802,0.0002909593,0.0013476625,0.00010365936,0.00013724923],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001157686,0.0005761024,0.000521393,0.0019685077,0.00026201925,0.0013112519,0.0046617785,0.00021720976,0.000017029482],"category_scores_gemma":[0.00014188162,0.00055524043,0.0001208285,0.0013903738,0.00064283365,0.0011886377,0.0032833717,0.0009186849,0.00004832635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005394967,0.000053845706,0.0004927119,0.00009673873,0.000013996809,0.00058635866,0.0016543545,0.071690544,0.00005393973,0.2298761,0.00003416136,0.69544184],"study_design_scores_gemma":[0.0007873423,0.00020895772,0.0007059568,0.0021779842,0.000011595872,0.000045589346,0.0000013295898,0.54815054,0.0007047658,0.44395414,0.0017272393,0.0015245603],"about_ca_topic_score_codex":0.00008275631,"about_ca_topic_score_gemma":0.0003128839,"teacher_disagreement_score":0.6939173,"about_ca_system_score_codex":0.00043240297,"about_ca_system_score_gemma":0.000352401,"threshold_uncertainty_score":0.99972546},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007508126,0.0003621139,0.97431,0.0004920355,0.0014223286,0.00055993424,0.000020139698,0.00018771752,0.02257069],"genre_scores_gemma":[0.21362497,0.00010426023,0.7819817,0.0028085639,0.00048690566,0.000045982957,0.00003418518,0.00004675622,0.0008666672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554706,0.000024750678,0.00077079743,0.001179034,0.0015710567,0.0009073323],"domain_scores_gemma":[0.9968549,0.00008639165,0.0006314335,0.0016173186,0.00063889025,0.000171065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000786978,0.00064569357,0.00065904116,0.0003241037,0.00030366716,0.0007838688,0.0031571547,0.00030076402,0.00004129217],"category_scores_gemma":[0.000035826448,0.00051357114,0.000107026586,0.0007632438,0.00047651105,0.0026922484,0.0009443062,0.0006439188,0.0001665917],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007958294,0.00011441068,0.00021804149,0.00027390503,0.00006778938,0.00012686009,0.00363962,0.023356771,0.0002740518,0.20959243,0.0008637198,0.76139283],"study_design_scores_gemma":[0.0032997944,0.001985789,0.0005382536,0.0045729093,0.000044855093,0.00056181615,0.0000018688344,0.53742874,0.005421574,0.11621613,0.32581156,0.00411667],"about_ca_topic_score_codex":0.00017058733,"about_ca_topic_score_gemma":0.0001247379,"teacher_disagreement_score":0.7572762,"about_ca_system_score_codex":0.0002936685,"about_ca_system_score_gemma":0.0007395343,"threshold_uncertainty_score":0.9997316},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014025688,0.00020428102,0.98421174,0.0007945154,0.0021787186,0.00033432155,0.0000061242195,0.00026597956,0.012002917],"genre_scores_gemma":[0.0027367875,0.0001586894,0.9918127,0.0019283075,0.00066090305,0.000008315756,0.000027803804,0.00004026219,0.0026262542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625564,0.000026469697,0.00047552874,0.0015863288,0.0010219067,0.0006341354],"domain_scores_gemma":[0.99755543,0.00014443547,0.00026843656,0.0017213653,0.00015468556,0.00015561405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059464324,0.00050517806,0.0004232565,0.00093468814,0.00026662566,0.0009949724,0.004063989,0.0002372033,0.000116172196],"category_scores_gemma":[0.000037429552,0.00047547775,0.00011946563,0.0007475346,0.00039420603,0.0016264222,0.0021144284,0.00056971086,0.00016006212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011025202,0.00003258864,0.000012488718,0.00002409733,0.0000108823015,0.000099286255,0.00017845113,0.19342443,0.000007154079,0.012053733,0.00022726347,0.7939285],"study_design_scores_gemma":[0.0001663331,0.00007835323,0.000023820343,0.00013154196,0.000007132369,0.000026303847,3.063642e-8,0.96379775,0.00009938381,0.030501522,0.004598973,0.00056888396],"about_ca_topic_score_codex":0.000015499974,"about_ca_topic_score_gemma":0.000015025669,"teacher_disagreement_score":0.79335964,"about_ca_system_score_codex":0.00021271911,"about_ca_system_score_gemma":0.00012559746,"threshold_uncertainty_score":0.9997697},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007185933,0.0011836799,0.9942203,0.00017427557,0.0012896566,0.00044026933,0.000017050515,0.00015444322,0.0018017303],"genre_scores_gemma":[0.03946394,0.00010154333,0.95907485,0.00062230567,0.0003567264,0.00002052786,0.000021310412,0.000044730612,0.00029407092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99507344,0.00006382317,0.00079938525,0.0021388736,0.0010357809,0.0008886943],"domain_scores_gemma":[0.9968488,0.00047425725,0.00032677074,0.0019060626,0.0002252899,0.00021881396],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011496957,0.0006347754,0.0007377492,0.00069893827,0.00025541676,0.00014325044,0.0015115396,0.00033989176,0.000028749402],"category_scores_gemma":[0.00022449065,0.0005871894,0.00014435568,0.00070542085,0.00074136164,0.00091439136,0.0019280652,0.0009478863,0.000038145092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003063681,0.00011919253,0.0018313978,0.00013390818,0.000019167675,0.0013817484,0.0009396716,0.15314876,0.0005027367,0.22860873,0.000017311571,0.61326677],"study_design_scores_gemma":[0.0009985594,0.00025472688,0.000885282,0.0027845649,0.000008154833,0.00078533776,5.3074734e-7,0.89146537,0.0035201465,0.050117232,0.04688216,0.0022979574],"about_ca_topic_score_codex":0.0001567333,"about_ca_topic_score_gemma":0.00064472284,"teacher_disagreement_score":0.7383166,"about_ca_system_score_codex":0.0004918958,"about_ca_system_score_gemma":0.0005539101,"threshold_uncertainty_score":0.9996579},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039151378,0.00030053148,0.99641967,0.00033395595,0.0011702097,0.0004086412,0.000024542716,0.00016633765,0.0007846258],"genre_scores_gemma":[0.01021607,0.000087652516,0.9881258,0.00114615,0.0002599031,0.000013499696,0.000009161295,0.000033310396,0.00010842676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99548167,0.000020340083,0.00053807965,0.0019768956,0.0012432947,0.0007397085],"domain_scores_gemma":[0.99647504,0.00054569816,0.00021587373,0.0021560034,0.00025035307,0.00035704652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063391303,0.00051178253,0.0004783908,0.0007220242,0.0005265029,0.00071964174,0.005004993,0.0002721851,0.000012692539],"category_scores_gemma":[0.00014406968,0.00048151446,0.00011323597,0.0010838972,0.0003878208,0.0007512605,0.00281074,0.0006364815,0.00015643111],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018440111,0.000022200717,0.00003732529,0.0000055810387,0.0000037886753,0.000079137106,0.00032326442,0.01466629,0.00007392951,0.0013652656,0.0000901563,0.9833312],"study_design_scores_gemma":[0.00017934231,0.00010034926,0.00029454232,0.00046993708,0.000006725926,0.00027211182,1.2889967e-7,0.94560117,0.00054790836,0.044817876,0.0068372516,0.0008726339],"about_ca_topic_score_codex":0.000088654386,"about_ca_topic_score_gemma":0.00009298384,"teacher_disagreement_score":0.9824586,"about_ca_system_score_codex":0.0003260067,"about_ca_system_score_gemma":0.00060224306,"threshold_uncertainty_score":0.99976367},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002986118,0.0008039289,0.9932713,0.00033737186,0.0008785565,0.00036228055,0.000003814742,0.000053863,0.0013027888],"genre_scores_gemma":[0.6227302,0.00008561262,0.37636584,0.0004380436,0.00012673496,0.000009831689,0.0000055680157,0.000013847513,0.00022431662],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973027,0.000038552924,0.0004901532,0.0010478504,0.0007978655,0.00032289192],"domain_scores_gemma":[0.9975689,0.0007466058,0.0002915654,0.00076003553,0.0005017502,0.0001311194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000988995,0.00031310096,0.0004406335,0.0015411993,0.00015198375,0.00025184522,0.0013639713,0.0002293237,0.000029972383],"category_scores_gemma":[0.00016691559,0.00028529912,0.000081920654,0.0016234741,0.000659967,0.00058804976,0.0008902961,0.0003967926,0.000014546502],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035425899,0.000036587146,0.00018537477,0.00008229977,0.000010327737,0.000006730305,0.00026901826,0.023695799,0.00022721587,0.08781087,0.000022537282,0.8876497],"study_design_scores_gemma":[0.00027495474,0.0002664642,0.003945004,0.00014522295,0.000009212123,0.00006209576,1.3235388e-7,0.37161902,0.0020724316,0.6204743,0.00060110295,0.00053005706],"about_ca_topic_score_codex":0.000026607915,"about_ca_topic_score_gemma":0.000017091777,"teacher_disagreement_score":0.88711965,"about_ca_system_score_codex":0.00009076886,"about_ca_system_score_gemma":0.00036967947,"threshold_uncertainty_score":0.99995995},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002029729,0.0014050823,0.995684,0.000015128402,0.00065725995,0.0012703105,0.0000035151315,0.00014822197,0.0007961345],"genre_scores_gemma":[0.20416181,0.00038217896,0.79387903,0.00021985818,0.0008917839,0.00025272754,0.000028195253,0.00011890784,0.00006552295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758387,0.000027697963,0.00041532473,0.0008626724,0.0004691945,0.00064121507],"domain_scores_gemma":[0.9988945,0.00007717198,0.000083617946,0.0007564848,0.00005803314,0.00013015029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028000298,0.00046285908,0.0003708696,0.00032548167,0.00011133586,0.00013772825,0.0010419157,0.00027952137,0.000010481918],"category_scores_gemma":[0.000003421562,0.0003958294,0.000047693695,0.00060986774,0.00015443085,0.0001634699,0.00018099883,0.0007032253,0.000008427078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.809386e-7,0.000014702087,4.6508512e-7,0.000010871965,0.0000028476318,0.0000042963215,0.00041123293,0.6711334,0.000028444607,0.000017939226,0.000005179014,0.32836983],"study_design_scores_gemma":[0.0001204217,0.000086862216,0.0000072974385,0.00015568557,0.0000045564466,0.000005229447,4.61245e-7,0.99687076,0.00042739618,0.0016089057,0.00025715397,0.0004552891],"about_ca_topic_score_codex":0.0000032053235,"about_ca_topic_score_gemma":0.000011703885,"teacher_disagreement_score":0.32791454,"about_ca_system_score_codex":0.00039416505,"about_ca_system_score_gemma":0.000029429424,"threshold_uncertainty_score":0.9998494},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005487686,0.000071565795,0.9925374,0.000030662537,0.00039580325,0.000617893,0.0000029613884,0.000251873,0.0055430643],"genre_scores_gemma":[0.067573704,0.0000025602656,0.9309125,0.0011798858,0.00020211775,0.00001423993,0.000002524713,0.00005034877,0.00006211408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99541926,0.0000608901,0.00053992524,0.0020220743,0.0011895688,0.0007682799],"domain_scores_gemma":[0.99648076,0.0001271308,0.00034422133,0.0021844928,0.00053744914,0.00032593746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009336961,0.0006139961,0.00056913716,0.00082396343,0.0004263767,0.0005178777,0.003995162,0.0003023292,0.0000013541372],"category_scores_gemma":[0.00015697925,0.000533512,0.00006512069,0.0012116376,0.0006548509,0.0013457503,0.00077911676,0.00079105713,0.000011883649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008334563,0.000040107763,0.000016534905,0.00001994698,0.000004917322,0.000015162363,0.0024115823,0.78029376,0.00044748696,0.013258182,0.0000033174995,0.20348068],"study_design_scores_gemma":[0.00017171082,0.00020045134,0.000042603027,0.00021144922,0.000006188824,0.00027708584,5.822242e-7,0.9912729,0.0014879325,0.0055625746,0.00004595371,0.0007205529],"about_ca_topic_score_codex":0.00003056843,"about_ca_topic_score_gemma":0.000008269321,"teacher_disagreement_score":0.21097916,"about_ca_system_score_codex":0.00042266556,"about_ca_system_score_gemma":0.00094590837,"threshold_uncertainty_score":0.99971163},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006156368,0.0001897588,0.9909396,0.0020968497,0.0022519066,0.00087579346,0.0000062301488,0.00028448825,0.0027397037],"genre_scores_gemma":[0.39677638,0.00003593291,0.60055447,0.0016859259,0.0007646299,0.000026517224,0.0000028178495,0.00004706141,0.000106264626],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935124,0.00009485184,0.00094039453,0.0030994895,0.0013819247,0.0009709224],"domain_scores_gemma":[0.9945898,0.0018605237,0.00034065562,0.0024626527,0.00036998707,0.00037635496],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016599522,0.00085320283,0.00083191786,0.0008209953,0.0003447505,0.0011380911,0.0038779988,0.0005071617,0.000086028376],"category_scores_gemma":[0.0003888614,0.0007585981,0.00018215523,0.00075294735,0.0017067541,0.00078427856,0.0023930816,0.0015149663,0.00021139105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062965382,0.00007811707,0.000013215036,0.00003159589,0.0000045180245,0.00004406151,0.00055790663,0.007864443,0.000050893537,0.049541205,0.000004749909,0.941803],"study_design_scores_gemma":[0.000045364384,0.000299259,0.00024818996,0.00010913786,0.0000041134267,0.00004764496,1.7378241e-7,0.4900082,0.00086361374,0.5075512,0.00025631307,0.0005667809],"about_ca_topic_score_codex":0.00006870072,"about_ca_topic_score_gemma":0.000116411364,"teacher_disagreement_score":0.9412362,"about_ca_system_score_codex":0.0005032594,"about_ca_system_score_gemma":0.00053378113,"threshold_uncertainty_score":0.99989885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055270637,0.00009190516,0.99477583,0.0007056095,0.00072107237,0.0009410768,0.000045796118,0.0003286041,0.0023348592],"genre_scores_gemma":[0.30945095,0.000043371412,0.6896888,0.0002267111,0.00012580585,0.000031452586,0.00009562754,0.000046990284,0.000290291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569684,0.000058874168,0.0006334336,0.0015846489,0.0012650319,0.00076118053],"domain_scores_gemma":[0.9978143,0.00024838882,0.00033717524,0.0010042712,0.00039248873,0.00020335698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063351245,0.0006276605,0.0005279169,0.00085256033,0.00044917376,0.000856042,0.001123998,0.00032039176,0.000035224923],"category_scores_gemma":[0.000019311527,0.0005597824,0.000112242364,0.00077724876,0.0009067138,0.0007137214,0.0005034568,0.00094212935,0.000017347957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028947059,0.00001739494,0.0000851537,0.000020040976,0.000013465507,0.000027440008,0.00013237783,0.40664247,0.000037434336,0.0031155415,0.0000072746116,0.5898985],"study_design_scores_gemma":[0.0005559859,0.00017239571,0.0014885286,0.00037054537,0.000012700893,0.00019980417,7.357688e-7,0.9874122,0.00012709288,0.008814697,0.00016863119,0.0006766575],"about_ca_topic_score_codex":0.0002376488,"about_ca_topic_score_gemma":0.0008331379,"teacher_disagreement_score":0.58922184,"about_ca_system_score_codex":0.0010167392,"about_ca_system_score_gemma":0.0008425759,"threshold_uncertainty_score":0.99968535},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13886377,0.0001535261,0.86015356,0.00017994671,0.00019029605,0.00034842134,0.0000025811232,0.00010462944,0.0000032812131],"genre_scores_gemma":[0.8115505,0.000068770474,0.18816395,0.000089525005,0.00006373825,0.000046076817,0.000003605818,0.0000132362375,5.7419334e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990774,0.000005681918,0.00017046901,0.00028254048,0.00013189387,0.0003320538],"domain_scores_gemma":[0.9995637,0.00012187754,0.000014156521,0.00021230617,0.000037552738,0.000050389302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009857074,0.00013173057,0.00013809135,0.00012747411,0.00009491865,0.00004465701,0.00032239754,0.000049193328,0.0000027945534],"category_scores_gemma":[0.000010602812,0.000119445016,0.000031175674,0.00074658456,0.00013743145,0.00011531054,0.00001554138,0.00014811633,0.0000019893798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025530874,0.000020606127,0.0026262468,0.000012076028,0.0000013690596,0.000004066722,0.00060789933,0.8997413,0.0006851523,0.000036726917,0.000005590379,0.0962564],"study_design_scores_gemma":[0.00039913022,0.00007900643,0.019378042,0.000018911302,7.473888e-7,0.000011688333,5.4789433e-7,0.9720222,0.005193846,0.0026627067,0.0000624537,0.00017073023],"about_ca_topic_score_codex":0.000017040888,"about_ca_topic_score_gemma":0.00008520523,"teacher_disagreement_score":0.67268676,"about_ca_system_score_codex":0.000053815347,"about_ca_system_score_gemma":0.00006814535,"threshold_uncertainty_score":0.48708263},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093053404,0.0001323723,0.9971857,0.0001104241,0.0006093178,0.00010867721,0.000023566812,0.0000877293,0.0008116429],"genre_scores_gemma":[0.9486973,0.000116806325,0.050393123,0.00017759345,0.00048779728,0.000003235341,0.00004500843,0.00003542256,0.000043676606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823517,0.00001855113,0.0003497553,0.00049990165,0.0006139549,0.00028269037],"domain_scores_gemma":[0.99898416,0.00017119912,0.00009392001,0.0005248967,0.00013222256,0.00009358536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019447332,0.00031352325,0.00038684547,0.0006680308,0.00010530797,0.000042054595,0.00056995027,0.00021581716,0.000032118023],"category_scores_gemma":[0.00004444875,0.00029894212,0.00012484631,0.00030283295,0.00027391678,0.0000753136,0.00005876889,0.0004628315,0.000012511222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010073517,0.0000076287088,0.000058791324,0.000021848846,0.000007734984,0.000010886574,0.00015033029,0.898621,0.00026113164,0.000014307362,0.000021762542,0.100823574],"study_design_scores_gemma":[0.00011128644,0.000064831394,0.000040711107,0.00023640777,0.000015505906,0.0000027145036,4.5353424e-8,0.99588925,0.0026669612,0.000573522,0.00010988996,0.00028888747],"about_ca_topic_score_codex":0.00005509756,"about_ca_topic_score_gemma":0.00031549192,"teacher_disagreement_score":0.9477668,"about_ca_system_score_codex":0.000113016504,"about_ca_system_score_gemma":0.00017499508,"threshold_uncertainty_score":0.9999463},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019997596,0.000037094775,0.9939427,0.00042082212,0.00017363843,0.0003289828,0.000009195886,0.0000606328,0.0030271998],"genre_scores_gemma":[0.9782054,0.0000021456199,0.02044374,0.0002191091,0.0009967469,0.000032800603,0.00004918224,0.000019724615,0.00003116331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839956,0.00003069486,0.00033612104,0.0006258537,0.00032631046,0.00028148192],"domain_scores_gemma":[0.99910694,0.00031978622,0.00019647578,0.00024157845,0.00007924743,0.000055987042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003652288,0.00026933887,0.00033595337,0.0007673152,0.0001429976,0.00017413058,0.00027527352,0.00011775801,0.00007989605],"category_scores_gemma":[0.0000082904935,0.00026397314,0.00008928426,0.00037732715,0.000240616,0.00017457338,0.00010504152,0.00048181223,0.000005866137],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010212636,0.000028604143,0.0022538374,0.00001140246,0.000011438885,0.0000024524818,0.00072178623,0.01892349,0.000033810575,0.008522291,0.00010828175,0.9693724],"study_design_scores_gemma":[0.00035933751,0.00005965772,0.0025580884,0.00026710556,0.000019149682,3.406457e-7,6.0815637e-7,0.8037166,0.00015570504,0.19161634,0.00091976277,0.0003272938],"about_ca_topic_score_codex":0.000051641142,"about_ca_topic_score_gemma":0.000060769988,"teacher_disagreement_score":0.97620565,"about_ca_system_score_codex":0.000093879455,"about_ca_system_score_gemma":0.00009579692,"threshold_uncertainty_score":0.9999812},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010849256,0.00050182093,0.9953399,0.00078557443,0.0012888085,0.001469204,0.000039997827,0.00020487826,0.00026134707],"genre_scores_gemma":[0.0037223764,0.0001640204,0.99354345,0.0016614598,0.0005169626,0.00007033324,0.00006435835,0.000043935775,0.00021308144],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9964671,0.00005154623,0.0005970181,0.0013869061,0.0008427528,0.00065466965],"domain_scores_gemma":[0.99797964,0.0004056498,0.00046185715,0.0005720366,0.00042167574,0.00015915753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011793239,0.0004927823,0.0004712381,0.0012803356,0.00021644327,0.00046854172,0.001092523,0.000524873,0.00003309986],"category_scores_gemma":[0.00010606666,0.0004792653,0.000093430484,0.000718981,0.0003507084,0.001337419,0.0002807002,0.0009747441,0.0000066306116],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020514415,0.000030844072,0.000009271495,0.000085558255,0.0000051174147,0.00006471849,0.0003518454,0.00085533207,0.011317029,0.00010215084,0.00007588714,0.9870817],"study_design_scores_gemma":[0.0012060874,0.0004743146,0.00031879675,0.002824804,0.000036119214,0.0002909805,0.0000011556009,0.42624027,0.4495724,0.11577112,0.0016070638,0.0016568893],"about_ca_topic_score_codex":0.000099736164,"about_ca_topic_score_gemma":0.00024649128,"teacher_disagreement_score":0.9854248,"about_ca_system_score_codex":0.0008917931,"about_ca_system_score_gemma":0.00041157397,"threshold_uncertainty_score":0.9997659},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002525184,0.0005697751,0.9798074,0.00043271916,0.0010509245,0.00054382376,0.0000021718472,0.00035539287,0.01721258],"genre_scores_gemma":[0.005263864,0.000061825915,0.9923243,0.0013389889,0.00035933757,0.000015324546,0.000004402391,0.00003318095,0.00059880596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953529,0.00006885936,0.0007996593,0.0017583336,0.0012342489,0.00078597653],"domain_scores_gemma":[0.9964358,0.0005078618,0.00059528236,0.0017993639,0.0004890983,0.00017256619],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021708778,0.0006064938,0.0006101286,0.00083887007,0.00036158552,0.0007403721,0.0048055556,0.00038162604,0.000014074562],"category_scores_gemma":[0.0007905404,0.00056220667,0.000101140344,0.0013076507,0.0005359295,0.0011224635,0.0010914626,0.0009345356,0.000050889677],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004069753,0.000026105903,0.000007614195,0.000119354074,0.0000052262253,0.000024906845,0.0006548227,0.0045322417,0.00013398619,0.023922699,0.000012214767,0.97055674],"study_design_scores_gemma":[0.00027721337,0.00022204041,0.000048554262,0.00076134986,0.00000898206,0.000097575044,2.2229767e-7,0.7420078,0.0053208964,0.24785942,0.0023837404,0.0010122285],"about_ca_topic_score_codex":0.000005360215,"about_ca_topic_score_gemma":0.000011808914,"teacher_disagreement_score":0.96954453,"about_ca_system_score_codex":0.0003276401,"about_ca_system_score_gemma":0.00084011105,"threshold_uncertainty_score":0.99968296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014711394,0.00058387086,0.9962111,0.00010426013,0.0008065589,0.00056590774,0.000027705826,0.0001942315,0.000035229765],"genre_scores_gemma":[0.8112017,0.000022801129,0.18830743,0.00011423291,0.00009223649,0.000029164454,0.00001463588,0.000040184535,0.00017763715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962768,0.000043810236,0.0004747792,0.0014264178,0.0008930923,0.00088512857],"domain_scores_gemma":[0.99511856,0.0028040253,0.00020726713,0.0013397353,0.00025538102,0.00027506106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017574513,0.0004817768,0.0008067028,0.0018143676,0.0002173358,0.0009733001,0.00223639,0.00022156163,0.0000043052755],"category_scores_gemma":[0.0003180168,0.00042618354,0.00022440917,0.0010170744,0.00023110383,0.00029726955,0.0010214663,0.0005501481,0.0000072867506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017275883,0.000048128062,0.008026486,0.00044079707,0.00037241448,0.0000546283,0.002812212,0.8478937,0.00007058899,0.0047135176,0.000031871477,0.13551836],"study_design_scores_gemma":[0.00031315707,0.00022194706,0.0017971605,0.0002321452,0.00004181314,0.000024143159,2.7416775e-7,0.9923909,0.000015186916,0.004368002,0.00015779577,0.00043750982],"about_ca_topic_score_codex":0.00003277638,"about_ca_topic_score_gemma":0.000052075884,"teacher_disagreement_score":0.8097305,"about_ca_system_score_codex":0.00040823937,"about_ca_system_score_gemma":0.0002688112,"threshold_uncertainty_score":0.999819},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018946754,0.00033737134,0.99414593,0.00206099,0.0004826146,0.0006798648,0.000021554419,0.00008620668,0.0019959821],"genre_scores_gemma":[0.015481261,0.0000336358,0.9776181,0.001574514,0.0006012329,0.000030647036,0.000002788028,0.00007505472,0.0045827786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952292,0.000102902675,0.0005992829,0.0015459534,0.001590845,0.00093185157],"domain_scores_gemma":[0.9957306,0.0009446366,0.00027739827,0.0024799702,0.00030370016,0.00026370658],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013717203,0.0005260508,0.00064048637,0.001088205,0.00030710752,0.00032086816,0.006760634,0.00025698112,0.00009158018],"category_scores_gemma":[0.000127483,0.0004059112,0.00023244674,0.0014239355,0.0012986946,0.00042808786,0.0027544869,0.00082413945,0.00020385228],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014323872,0.00003659746,0.000003467597,0.000017761304,0.000019086896,0.000059637303,0.0009114219,0.010781471,0.0011827945,0.0024907114,0.0003614457,0.98412126],"study_design_scores_gemma":[0.00042709766,0.0005586248,0.00009816597,0.00034406228,0.000012173783,0.0001449168,3.8638268e-7,0.87088484,0.0073981974,0.114030495,0.005235521,0.00086554216],"about_ca_topic_score_codex":0.000014469091,"about_ca_topic_score_gemma":0.0000063200323,"teacher_disagreement_score":0.98325574,"about_ca_system_score_codex":0.00022152509,"about_ca_system_score_gemma":0.00028201056,"threshold_uncertainty_score":0.99983925},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001156955,0.00013856775,0.990068,0.0016813895,0.0029464911,0.00033778674,0.000009278297,0.00032371318,0.0044831904],"genre_scores_gemma":[0.023620836,0.000015356138,0.97022635,0.0044036917,0.0014551199,0.000009146256,0.00002169214,0.000036480444,0.00021134189],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956443,0.000040759507,0.00050199364,0.0019229339,0.0010591357,0.00083093304],"domain_scores_gemma":[0.99694765,0.00019739903,0.0002594955,0.0022281152,0.00013304537,0.00023432658],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00083414046,0.00060188933,0.00054004067,0.00087798235,0.00027284372,0.0011002657,0.0060640746,0.00041448945,0.000076043136],"category_scores_gemma":[0.00006600381,0.00057174184,0.00012910498,0.0004740298,0.0005449985,0.0012941855,0.002158491,0.0009737512,0.00007699252],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045166703,0.000032470976,0.000015225178,0.000020333857,0.000006798826,0.00009389114,0.00019448536,0.027248051,0.0000069211083,0.01717174,0.00001297818,0.95519257],"study_design_scores_gemma":[0.00022795457,0.0002196091,0.00014319133,0.00025018348,0.000008357203,0.000016265934,7.484141e-8,0.9042612,0.00018140978,0.08849959,0.0055008493,0.00069132494],"about_ca_topic_score_codex":0.00008768997,"about_ca_topic_score_gemma":0.00059231033,"teacher_disagreement_score":0.9545013,"about_ca_system_score_codex":0.00026513566,"about_ca_system_score_gemma":0.0004473669,"threshold_uncertainty_score":0.9999367},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010839967,0.00083143497,0.9935308,0.00003236416,0.0007178042,0.00037813224,0.000005620035,0.000610086,0.0028097616],"genre_scores_gemma":[0.7068985,0.000017758679,0.29192296,0.00013070287,0.00086538726,0.000011285947,0.000010673047,0.00008969759,0.000053004605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827284,0.000003557461,0.0003001908,0.00058820617,0.00033536664,0.0004998358],"domain_scores_gemma":[0.9992438,0.00013243829,0.00007714713,0.00037074153,0.00011830984,0.000057552585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020505345,0.000374633,0.0003475791,0.000402408,0.00014542152,0.00021753651,0.0005299814,0.00021494538,0.0000027012406],"category_scores_gemma":[0.000016226844,0.00036602907,0.00010306472,0.0001771273,0.0002265036,0.00007302022,0.00011149821,0.00040562512,0.0000031328118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028846994,0.0000063609677,0.0000031294364,0.00005135269,0.000004401154,0.000010531315,0.000068874484,0.80101585,0.0029231708,0.00043801265,0.00009017789,0.19538526],"study_design_scores_gemma":[0.00009967392,0.000039177743,0.00002078727,0.00061548117,0.000011154984,0.000020064275,4.7803116e-8,0.92410845,0.04827085,0.025257843,0.0010915608,0.00046488212],"about_ca_topic_score_codex":0.0000051804545,"about_ca_topic_score_gemma":0.000015597692,"teacher_disagreement_score":0.70581454,"about_ca_system_score_codex":0.00021675254,"about_ca_system_score_gemma":0.00009133719,"threshold_uncertainty_score":0.9998792},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046871524,0.0000848705,0.9516152,0.00069721305,0.0003063074,0.00017767557,8.752637e-7,0.00022165915,0.000024632285],"genre_scores_gemma":[0.53394276,0.0000044705052,0.46441934,0.0015191262,0.00010465279,0.0000031019006,6.775696e-7,0.0000045198294,0.0000013387228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773294,0.00006778381,0.00032580993,0.000730463,0.00058809796,0.00055491773],"domain_scores_gemma":[0.99859554,0.000498604,0.000120408375,0.00054157584,0.0001361197,0.00010776954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006826235,0.00020350306,0.0002392714,0.00037092683,0.0005119838,0.0001931945,0.0014359693,0.00007263909,0.000008551755],"category_scores_gemma":[0.00033424282,0.00018528667,0.000075343225,0.0019195919,0.00042279705,0.0015154572,0.0006216843,0.00032735884,0.0000061496658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034938388,0.0002048217,0.008594638,0.00004085359,0.000014048546,0.00084447925,0.0035874422,0.23688264,0.037478745,0.0023054995,0.00015662797,0.70985526],"study_design_scores_gemma":[0.00047629175,0.00008009377,0.0014209137,0.000061532744,0.0000010910126,0.00046434623,3.779016e-7,0.84506756,0.11743927,0.034670062,0.000036880298,0.00028155968],"about_ca_topic_score_codex":0.000026209005,"about_ca_topic_score_gemma":0.0000040026184,"teacher_disagreement_score":0.7095737,"about_ca_system_score_codex":0.00011733847,"about_ca_system_score_gemma":0.00027139185,"threshold_uncertainty_score":0.75557715},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006445351,0.00012412929,0.98872155,0.0009645798,0.0023676371,0.00050199573,0.000033833385,0.00026195997,0.006379758],"genre_scores_gemma":[0.4058569,0.000025696067,0.5919089,0.0013208672,0.00052775803,0.000015073897,0.000012020457,0.00004847611,0.00028435708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946006,0.000045183504,0.0007050544,0.002116092,0.0013813518,0.0011517263],"domain_scores_gemma":[0.99610126,0.00048174028,0.00034948185,0.0023546736,0.0002811791,0.00043165454],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000688615,0.0008269838,0.0007531914,0.0013535,0.00066087535,0.0010418923,0.0052763405,0.0006838696,0.000054570817],"category_scores_gemma":[0.00008551246,0.00071718806,0.00036058144,0.0010468925,0.00239204,0.0008579073,0.0021375215,0.0019994595,0.000073548166],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020841186,0.00016938729,0.00019969016,0.0001133607,0.000035301684,0.00025343063,0.0012761807,0.010160686,0.0007182839,0.0750789,0.000021591728,0.9119524],"study_design_scores_gemma":[0.001305858,0.00029433455,0.0054587335,0.00066129846,0.00003058359,0.00029979402,3.6983937e-7,0.49458277,0.011197917,0.4815366,0.002013859,0.002617884],"about_ca_topic_score_codex":0.00009990776,"about_ca_topic_score_gemma":0.00058841694,"teacher_disagreement_score":0.9093345,"about_ca_system_score_codex":0.00013857735,"about_ca_system_score_gemma":0.00057116157,"threshold_uncertainty_score":0.9999951},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028034305,0.00010390664,0.98864704,0.0017789864,0.002608543,0.00046511495,8.750532e-7,0.00023846008,0.006129063],"genre_scores_gemma":[0.123796165,0.000056134664,0.85482633,0.009852858,0.0015096614,0.000090705915,0.000011190868,0.000066069275,0.009790885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959776,0.00008773843,0.00044279773,0.0015877073,0.0012127347,0.00069146836],"domain_scores_gemma":[0.9972286,0.0004955951,0.00024176725,0.0017047981,0.00014126523,0.00018797029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078786147,0.00046233853,0.00039734918,0.0009399407,0.00033390464,0.00054671994,0.0034342462,0.00029969335,0.0000396454],"category_scores_gemma":[0.000043804135,0.0004447013,0.00012985026,0.0012113017,0.00033057522,0.00045401094,0.000114713366,0.0012382054,0.00012179282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020563216,0.00008747363,0.0000022198415,0.000009432035,0.0000035951302,0.000012580644,0.0009339094,0.21768677,0.000017754008,0.00090016157,0.00025702504,0.78008705],"study_design_scores_gemma":[0.0005874532,0.0010281238,0.00036139466,0.00086989487,0.000016401471,0.000117697426,5.8034135e-7,0.8081896,0.003483446,0.16408049,0.019755045,0.0015099266],"about_ca_topic_score_codex":0.00001124142,"about_ca_topic_score_gemma":0.000013545401,"teacher_disagreement_score":0.7785771,"about_ca_system_score_codex":0.0013347296,"about_ca_system_score_gemma":0.0017821833,"threshold_uncertainty_score":0.9998005},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019865506,0.00089151843,0.9893469,0.0005156162,0.00040161164,0.00035074324,0.00001612662,0.0001935527,0.006297372],"genre_scores_gemma":[0.059753347,0.00016103804,0.9357308,0.0017404823,0.00030121187,0.000024642502,0.0000362863,0.0000928129,0.0021593347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99615437,0.000044000608,0.0005824552,0.0013861884,0.0010717063,0.00076125236],"domain_scores_gemma":[0.9968829,0.0005000908,0.00045087235,0.0017012241,0.0003027287,0.000162169],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073016266,0.0006420746,0.0007915706,0.00037629495,0.00028786427,0.0005477867,0.002943911,0.00034723544,0.00011854251],"category_scores_gemma":[0.000070839924,0.00050742563,0.00012684951,0.0009037671,0.00089421566,0.0006449971,0.0008564376,0.00045086452,0.000019244006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012334016,0.00042293436,0.0006951387,0.00039836759,0.0002468116,0.0005661177,0.003181686,0.017073888,0.0020534731,0.73427033,0.0013699756,0.23959793],"study_design_scores_gemma":[0.0020644653,0.00039803353,0.00006122272,0.0011584101,0.000054046952,0.0006795711,0.0000015349553,0.3213322,0.0058616144,0.64749914,0.019044014,0.0018457766],"about_ca_topic_score_codex":0.0002351093,"about_ca_topic_score_gemma":0.00018986354,"teacher_disagreement_score":0.30425832,"about_ca_system_score_codex":0.0001816549,"about_ca_system_score_gemma":0.00045462674,"threshold_uncertainty_score":0.99973774},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001591861,0.0006035636,0.9924705,0.0005459032,0.0016473767,0.00038681022,0.0000060542666,0.000042779444,0.0041378294],"genre_scores_gemma":[0.7720682,0.00009839496,0.22361764,0.0020400484,0.0005293976,0.000021975568,0.000010387471,0.000043612035,0.0015703291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997817,0.00006684891,0.00049115525,0.0006892634,0.0006310959,0.00030465485],"domain_scores_gemma":[0.9979911,0.00036941995,0.00042705343,0.0009840184,0.00016475678,0.00006365296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088190293,0.0002685276,0.00031713967,0.0002920545,0.00028203742,0.00023350572,0.0013845804,0.00014917113,0.000046295692],"category_scores_gemma":[0.00007402846,0.00019233776,0.00011029423,0.00034188674,0.00027606616,0.00034099515,0.00035518775,0.0003627511,0.000023612645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038065805,0.00011085255,0.00021849718,0.0002260013,0.000087987784,0.000054844164,0.008766872,0.13421491,0.0016826533,0.20690992,0.000589198,0.6471345],"study_design_scores_gemma":[0.0005586828,0.00026899166,0.0010446956,0.0012198461,0.000039826173,0.00015512078,0.0000015874402,0.84924585,0.012110341,0.12326549,0.010813031,0.0012765207],"about_ca_topic_score_codex":0.00002366118,"about_ca_topic_score_gemma":0.00006089825,"teacher_disagreement_score":0.771909,"about_ca_system_score_codex":0.00010682899,"about_ca_system_score_gemma":0.00020560983,"threshold_uncertainty_score":0.7843306},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007761173,0.0005917825,0.99513096,0.0016451166,0.0012905403,0.0007635143,0.000017256256,0.00015841695,0.0003248241],"genre_scores_gemma":[0.5061062,0.000035405505,0.4886045,0.003594425,0.0014131285,0.00002383604,0.000007196885,0.000060488772,0.00015480196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964867,0.00005817761,0.00046870505,0.0016828062,0.0004947733,0.0008087934],"domain_scores_gemma":[0.995196,0.0031445676,0.00033451273,0.00080839137,0.00029207952,0.00022447304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091813493,0.0006348301,0.0007596873,0.000484692,0.0004977304,0.0006672747,0.0018610564,0.0003456735,0.0000026312337],"category_scores_gemma":[0.00016649392,0.00053487753,0.0001591539,0.0003101343,0.00096643454,0.0002191135,0.0008175034,0.00076820527,0.000003981516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013624673,0.000009656859,0.000012600701,0.00002405384,0.000024681367,0.000020037935,0.00047866674,0.18805249,0.000014631184,0.033852473,0.000022790702,0.7774743],"study_design_scores_gemma":[0.0005547856,0.00036865272,0.00010449318,0.00031874585,0.000011845052,0.000075052885,8.289114e-8,0.81882095,0.00011618743,0.17847084,0.0006219546,0.00053640973],"about_ca_topic_score_codex":0.000023007498,"about_ca_topic_score_gemma":0.00002850667,"teacher_disagreement_score":0.7769379,"about_ca_system_score_codex":0.000103738894,"about_ca_system_score_gemma":0.00020531089,"threshold_uncertainty_score":0.99971026},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024288737,0.00029045157,0.996766,0.0002194522,0.001336083,0.0003710704,0.0000024270787,0.00015248156,0.00061916857],"genre_scores_gemma":[0.023961445,0.00009352177,0.9750083,0.0005839949,0.00012977849,0.0000054346924,0.0000026045889,0.000022551865,0.00019237585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973673,0.000032712604,0.00037469142,0.0011563847,0.0006225839,0.0004462976],"domain_scores_gemma":[0.9987058,0.00017299467,0.00027909342,0.00046694023,0.00022484778,0.00015030759],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00036824652,0.00039775562,0.0003513999,0.00079571875,0.00037106933,0.0011422511,0.0007862263,0.00027091402,0.000022064683],"category_scores_gemma":[0.000046585516,0.00039318186,0.00007531726,0.0005642424,0.00043568396,0.0013284566,0.00047038987,0.0006022066,0.000011454696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012342987,0.000004895134,0.000062098756,0.000018430794,0.000009309332,0.000008842703,0.0004439786,0.035119418,0.00012498787,0.004456035,0.000009875078,0.9597409],"study_design_scores_gemma":[0.0001856058,0.00004797155,0.000493135,0.00024075489,0.000009001816,0.00020812923,4.627587e-7,0.95668346,0.0006277029,0.040868092,0.0001608589,0.00047482332],"about_ca_topic_score_codex":0.00007055855,"about_ca_topic_score_gemma":0.00010225744,"teacher_disagreement_score":0.95926607,"about_ca_system_score_codex":0.00031691088,"about_ca_system_score_gemma":0.00027018003,"threshold_uncertainty_score":0.9998947},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011206788,0.00007938945,0.99692523,0.00024479008,0.0005196825,0.0005710046,0.000030051062,0.000021005797,0.00048816777],"genre_scores_gemma":[0.72314304,0.00004516449,0.27343112,0.0014491476,0.0002572256,0.000058196005,0.000013201399,0.00004748701,0.0015554253],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973498,0.000050898612,0.00080756604,0.00090569106,0.00059740926,0.00028864885],"domain_scores_gemma":[0.99675983,0.0016631227,0.00051961496,0.00068401935,0.00029982996,0.000073603245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022099589,0.00024302908,0.0004266572,0.00070907886,0.00017321818,0.00014841337,0.0009159813,0.00023368001,0.00009556578],"category_scores_gemma":[0.00056741905,0.00020810278,0.00012175901,0.0007067386,0.0004197089,0.00027613007,0.0001133498,0.00036253716,0.000014207535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018527726,0.000022498307,0.0004123812,0.00001395673,0.0000044080457,8.504974e-7,0.00027670414,0.09705251,0.00025235157,0.0076239975,0.000051993797,0.8942698],"study_design_scores_gemma":[0.00030988906,0.00010761278,0.0010080332,0.00010711636,0.0000069279627,0.000009317413,0.0000027391357,0.08231046,0.0014109786,0.9115838,0.0028367494,0.00030642372],"about_ca_topic_score_codex":0.000020980053,"about_ca_topic_score_gemma":0.00015625375,"teacher_disagreement_score":0.90395975,"about_ca_system_score_codex":0.00012076223,"about_ca_system_score_gemma":0.00019951194,"threshold_uncertainty_score":0.8486185},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000960681,0.0004173997,0.98930925,0.00014518251,0.00072248053,0.0003216371,0.000012651341,0.00010569409,0.008869644],"genre_scores_gemma":[0.08659688,0.0002592221,0.9121137,0.00024424575,0.00034992426,0.000008774234,0.000036044476,0.000029636909,0.0003615498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962557,0.00003346721,0.0006086713,0.0013742695,0.0012697318,0.0004581637],"domain_scores_gemma":[0.99713826,0.00019966098,0.00042419796,0.001820021,0.00027722024,0.00014062735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044355495,0.00043444254,0.00062497053,0.00078489434,0.00020601967,0.00019398282,0.0033987327,0.0002732553,0.000011755917],"category_scores_gemma":[0.00006179666,0.00035659433,0.00016244028,0.0008317138,0.00060900545,0.0009399891,0.0018493553,0.00051661633,0.000009541469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008982674,0.00006196935,0.00006481979,0.00003766066,0.0000121805615,0.000052245206,0.0010319966,0.023204835,0.00009299714,0.005768479,0.00013301783,0.9695308],"study_design_scores_gemma":[0.00039054936,0.00020950791,0.0010220695,0.00025955026,0.000008122151,0.00017857664,3.9647338e-7,0.966243,0.002866347,0.026541349,0.0016835245,0.0005969816],"about_ca_topic_score_codex":0.00013579387,"about_ca_topic_score_gemma":0.000033446096,"teacher_disagreement_score":0.9689338,"about_ca_system_score_codex":0.00015710268,"about_ca_system_score_gemma":0.00056011515,"threshold_uncertainty_score":0.9998886},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000431288,0.0029110624,0.98934406,0.00020838654,0.0035628253,0.00040526234,0.000044238426,0.00010695458,0.0033740965],"genre_scores_gemma":[0.9196578,0.00040662664,0.07732766,0.0008736628,0.0008332302,0.000018374134,0.000029639685,0.0000661532,0.0007868504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959093,0.0000443578,0.0008912621,0.0013745547,0.0011268423,0.00065372384],"domain_scores_gemma":[0.99717677,0.00017451559,0.0006058389,0.0014918038,0.0003722534,0.00017880676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005583707,0.0005885798,0.0009430917,0.00049100036,0.00016068864,0.0004407935,0.0037769692,0.00035515105,0.00010381716],"category_scores_gemma":[0.00004769493,0.0005078482,0.00017430239,0.00069562293,0.00066985225,0.00055889727,0.0010278092,0.00057584624,0.00003026467],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046800674,0.000052954292,0.00012569354,0.00028777486,0.00003453951,0.00006589849,0.0005476276,0.02637729,0.0001436833,0.18878815,0.00039013132,0.7831816],"study_design_scores_gemma":[0.00094372727,0.000409637,0.00028420752,0.0020097708,0.000021811871,0.00016518089,3.2926073e-7,0.7393379,0.002951547,0.18704492,0.0650549,0.0017760311],"about_ca_topic_score_codex":0.000046297548,"about_ca_topic_score_gemma":0.000024293282,"teacher_disagreement_score":0.9196147,"about_ca_system_score_codex":0.00016376123,"about_ca_system_score_gemma":0.0003177798,"threshold_uncertainty_score":0.9997373},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005322342,0.0006245543,0.99191314,0.00031088322,0.0011826855,0.00040583097,0.000009404655,0.00016226154,0.0048590135],"genre_scores_gemma":[0.47123677,0.00015301758,0.5246095,0.001660514,0.0010719314,0.00002884459,0.0000616606,0.000102065576,0.0010756617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561155,0.000039866045,0.00074696564,0.0016898961,0.0011063087,0.0008054007],"domain_scores_gemma":[0.9972686,0.0005069607,0.00032609742,0.0016189597,0.00012098219,0.00015836202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000983109,0.0005874311,0.00075172586,0.0011422451,0.00020507608,0.0006599508,0.0043245987,0.00037195996,0.000015281747],"category_scores_gemma":[0.000039005383,0.0005291375,0.00013258503,0.000809194,0.00044309645,0.0010109914,0.0023091678,0.0008842919,0.000036146288],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024227207,0.00007991765,0.0007093139,0.000048452104,0.0000066158736,0.00045313535,0.0003707472,0.054018512,0.00011508237,0.01359915,0.00024655377,0.9303283],"study_design_scores_gemma":[0.0020938595,0.00016698074,0.0019573637,0.0011265799,0.0000072932103,0.00009994329,1.21357e-7,0.84944886,0.0016683349,0.1330425,0.009006953,0.0013812195],"about_ca_topic_score_codex":0.0004014858,"about_ca_topic_score_gemma":0.00024496033,"teacher_disagreement_score":0.9289471,"about_ca_system_score_codex":0.00034317293,"about_ca_system_score_gemma":0.0003975129,"threshold_uncertainty_score":0.99971604},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000551798,0.0009966339,0.9837103,0.00082855363,0.0031982977,0.0003001502,0.000001409783,0.00015664792,0.010256216],"genre_scores_gemma":[0.3672992,0.000055603046,0.6260317,0.0009461106,0.0004609566,0.000018199105,0.0000017212285,0.00002921217,0.0051572826],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964761,0.000041079704,0.0006986243,0.0013415042,0.0007999885,0.00064266444],"domain_scores_gemma":[0.99643457,0.0008026111,0.00047921482,0.0018298454,0.00033133104,0.00012244123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040725924,0.00049397146,0.00083621027,0.0008838721,0.00014763758,0.00031598393,0.004186596,0.00030000703,0.00002378156],"category_scores_gemma":[0.00015119361,0.00040469287,0.00014311427,0.0005981705,0.0013640913,0.00029141954,0.0015998686,0.0006090252,0.00002638503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073227743,0.000041864696,0.0011031438,0.00009012441,0.00002361895,0.00012906257,0.0010481963,0.0010897666,0.0004893037,0.21337515,0.00005568601,0.78254676],"study_design_scores_gemma":[0.00051208324,0.00055248133,0.010601108,0.0010958898,0.000028497354,0.00030357653,8.0928396e-7,0.1330044,0.011473522,0.8377856,0.0030698793,0.0015721746],"about_ca_topic_score_codex":0.00018031882,"about_ca_topic_score_gemma":0.0007537935,"teacher_disagreement_score":0.78097457,"about_ca_system_score_codex":0.00013454322,"about_ca_system_score_gemma":0.000451636,"threshold_uncertainty_score":0.9998405},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21446793,0.00054358086,0.78383917,0.000050391693,0.00087744644,0.00015765753,0.000007515923,0.000008243919,0.00004806706],"genre_scores_gemma":[0.890544,0.0001514786,0.10839588,0.00020194707,0.000582623,0.000005393931,0.000012850678,0.000026752767,0.000079097175],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985631,0.000015301723,0.00021733728,0.0007833721,0.00017024786,0.0002506294],"domain_scores_gemma":[0.99935514,0.00001629879,0.00012762229,0.00035732661,0.000077592405,0.00006599898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002792651,0.00023828594,0.00017577596,0.00027619075,0.00012226278,0.00009972993,0.00031034663,0.00036798124,0.000004369021],"category_scores_gemma":[0.00003761951,0.00022754885,0.00004360952,0.00011013844,0.0003469955,0.0000131550705,0.0002484878,0.0003974302,0.0000010282325],"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.000013230025,0.000008473594,0.000107568914,0.0000109679395,0.0000021854773,0.0000030451538,0.00004950798,0.0018166812,0.9104337,0.0000032638911,0.0000022393883,0.08754912],"study_design_scores_gemma":[0.000285012,0.000048700516,0.0013659899,0.00010156437,0.0000044265066,0.000038648537,5.3852773e-7,0.013541453,0.9833491,0.00017665257,0.00080253504,0.00028539426],"about_ca_topic_score_codex":0.000014936861,"about_ca_topic_score_gemma":0.00017267732,"teacher_disagreement_score":0.67607605,"about_ca_system_score_codex":0.000055305587,"about_ca_system_score_gemma":0.00014272584,"threshold_uncertainty_score":0.9279173},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015926144,0.0008383202,0.9885001,0.0014782147,0.0018348017,0.00030727094,0.0000015822186,0.00022367845,0.006656735],"genre_scores_gemma":[0.20634732,0.00009043773,0.7810465,0.002445536,0.004765474,0.000025685558,0.000011088917,0.000101904,0.005166045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995623,0.000059405862,0.0004676562,0.0017739055,0.0011982684,0.0008777981],"domain_scores_gemma":[0.9978118,0.00034483292,0.00031585127,0.0011270009,0.00016372633,0.00023677995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011337064,0.0005958586,0.00052706175,0.00097380497,0.0004102289,0.0006124629,0.0031387855,0.0003163493,0.00008095171],"category_scores_gemma":[0.000106304906,0.00054189545,0.00016475735,0.00064394576,0.00043403145,0.0003400626,0.0015250659,0.0018032829,0.0002894986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012974805,0.000019037332,0.000037916834,0.000012066947,0.0000043586283,0.0000639035,0.0010670321,0.13030726,0.000013083039,0.003271518,0.0000043997848,0.86519814],"study_design_scores_gemma":[0.00020127864,0.00015730137,0.00014017569,0.000282169,0.0000052884457,0.00008614788,1.177121e-7,0.9731951,0.00016231267,0.0035600692,0.02154741,0.0006626455],"about_ca_topic_score_codex":0.00003023319,"about_ca_topic_score_gemma":0.000016934471,"teacher_disagreement_score":0.8645355,"about_ca_system_score_codex":0.000263336,"about_ca_system_score_gemma":0.00026636885,"threshold_uncertainty_score":0.9997032},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047743367,0.004336467,0.98566484,0.000276643,0.0011513167,0.00058636506,0.000005369974,0.0003046039,0.00719696],"genre_scores_gemma":[0.4985087,0.0017574694,0.49233627,0.0054976568,0.0009959167,0.000033689914,0.000019040124,0.000111940775,0.00073932833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956568,0.000037546037,0.0005798071,0.0018682432,0.0010420617,0.00081556465],"domain_scores_gemma":[0.99752545,0.00031031782,0.00030462278,0.0013590745,0.00025209898,0.00024845504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004388411,0.0006904758,0.0006533414,0.00093076244,0.00048783337,0.00062007987,0.003237437,0.00032637664,0.000007875444],"category_scores_gemma":[0.0000057651123,0.000616691,0.0001256295,0.000618786,0.00078183,0.00090785616,0.002560831,0.0008504497,0.00002049905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069284756,0.00006481974,0.000057616693,0.00026863033,0.00003675302,0.00015422936,0.024187619,0.32161918,0.000085678184,0.030814717,0.00005819524,0.6226456],"study_design_scores_gemma":[0.00032180853,0.00031617781,0.000030023804,0.00053839124,0.000009605493,0.00031534192,0.0000012000369,0.8062079,0.00041382428,0.1824365,0.008530879,0.0008783461],"about_ca_topic_score_codex":0.00009414155,"about_ca_topic_score_gemma":0.00014994727,"teacher_disagreement_score":0.6217673,"about_ca_system_score_codex":0.000113023576,"about_ca_system_score_gemma":0.0003570077,"threshold_uncertainty_score":0.9996284},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006216626,0.00037000282,0.9908728,0.0028720312,0.0011577879,0.0012273553,0.000004882239,0.0004806221,0.0023928848],"genre_scores_gemma":[0.5223881,0.00005065656,0.47524658,0.0011935554,0.0002662347,0.000086721906,0.000007901638,0.000058043035,0.0007022247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942947,0.00015123717,0.0007770753,0.0024815856,0.0010733828,0.00122203],"domain_scores_gemma":[0.9939637,0.0004523454,0.00076212734,0.0020816063,0.0026258607,0.000114329465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016319528,0.00087212084,0.00082679995,0.001356551,0.00065219234,0.0009779274,0.003752249,0.0005189199,0.000066023305],"category_scores_gemma":[0.0005389317,0.000741478,0.00009044178,0.0023551283,0.0016619064,0.0030385142,0.002125603,0.002217573,0.00003348762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007032525,0.00040644305,0.0011880026,0.00029565935,0.00019118644,0.00064034585,0.03576714,0.0059612948,0.00066706806,0.60057443,0.000081647166,0.35415643],"study_design_scores_gemma":[0.002576868,0.0025349783,0.0008193446,0.0018599288,0.000060544015,0.00034546416,0.00007841073,0.17984492,0.046374522,0.7044752,0.056403533,0.004626287],"about_ca_topic_score_codex":0.00011391916,"about_ca_topic_score_gemma":0.0003307716,"teacher_disagreement_score":0.5217664,"about_ca_system_score_codex":0.0019266238,"about_ca_system_score_gemma":0.0019910177,"threshold_uncertainty_score":0.9995036},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001661101,0.00051945355,0.99435097,0.0024363862,0.0005167358,0.0011163222,0.0000033444617,0.00021561774,0.00082455756],"genre_scores_gemma":[0.05911243,0.00017117195,0.93422073,0.0051737963,0.0006458505,0.00004798529,0.0000038496705,0.000041297386,0.0005829188],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974754,0.000028471211,0.00040499188,0.0010793882,0.0005241455,0.0004876463],"domain_scores_gemma":[0.9978133,0.00074551906,0.00021465866,0.0008956266,0.00021689717,0.00011399668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010702579,0.00039767486,0.00043879807,0.0004933743,0.00038433247,0.0006799358,0.002092163,0.00017845762,0.0000027343829],"category_scores_gemma":[0.00015619483,0.00028449812,0.000101316014,0.0004952665,0.0004738851,0.0007456091,0.001061665,0.00045051856,0.000007271051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022215265,0.000006527721,0.0000035826854,0.000024697014,0.00000597404,0.0000062010495,0.0010127145,0.0038345675,0.0001708907,0.16058373,0.000024980664,0.8343039],"study_design_scores_gemma":[0.0005672458,0.0001748078,0.000038019647,0.00021200607,0.000011415684,0.000049989285,4.2404645e-7,0.2583313,0.005423547,0.7294556,0.0051745423,0.0005611115],"about_ca_topic_score_codex":0.000017854494,"about_ca_topic_score_gemma":0.000017698367,"teacher_disagreement_score":0.8337428,"about_ca_system_score_codex":0.000157725,"about_ca_system_score_gemma":0.00017081751,"threshold_uncertainty_score":0.9999607},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021065534,0.00032349053,0.9929299,0.00029986625,0.00097067835,0.00026842864,0.0000075696694,0.00010151405,0.0029920326],"genre_scores_gemma":[0.57234967,0.000015097021,0.42675802,0.0002595443,0.00043270105,0.00000308146,0.000010897055,0.000020281715,0.00015069544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970698,0.000044077595,0.0005546318,0.00089111656,0.00088835665,0.000552027],"domain_scores_gemma":[0.9976394,0.0005677187,0.0003991369,0.0007947882,0.00042430972,0.0001746498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076110166,0.00038315522,0.00044656234,0.0005765496,0.0002872799,0.00020748079,0.0012013986,0.00018007797,0.000043792083],"category_scores_gemma":[0.000056539717,0.0003459913,0.00010239634,0.0009892472,0.00043686954,0.0006320897,0.0006046191,0.00050276954,0.00003455864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001664294,0.00012560532,0.0006680364,0.000084203755,0.00004293612,0.000029378814,0.0018434221,0.27471027,0.0006475022,0.049770217,0.000044959303,0.6720168],"study_design_scores_gemma":[0.00064938853,0.00034094902,0.0009602077,0.000893175,0.000042086616,0.00032480137,0.0000012388531,0.92602146,0.0117197,0.05521404,0.0025936242,0.0012393373],"about_ca_topic_score_codex":0.000018180326,"about_ca_topic_score_gemma":0.00004496051,"teacher_disagreement_score":0.6707775,"about_ca_system_score_codex":0.00014628934,"about_ca_system_score_gemma":0.00060657813,"threshold_uncertainty_score":0.9998992},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077156565,0.0045744423,0.47478956,0.005144259,0.0051370193,0.00203417,0.000016574839,0.0002772049,0.5072552],"genre_scores_gemma":[0.9925306,0.00015004983,0.004302854,0.0005811996,0.0009404433,0.000016596206,0.0000023769223,0.00002294136,0.0014529579],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731106,0.00004634145,0.0003650587,0.00090508064,0.00066242844,0.0007100569],"domain_scores_gemma":[0.99877423,0.00032180204,0.00017353125,0.00041593183,0.00017397906,0.00014050545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010776744,0.00031684787,0.0004306213,0.00047420547,0.00036584586,0.00025047365,0.0015394354,0.0003616341,0.00010274219],"category_scores_gemma":[0.00021212023,0.00028550866,0.00009477533,0.000622234,0.0016928688,0.0003621458,0.00030393957,0.00073581195,0.00006711149],"study_design_candidate":"theoretical_or_conceptual","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.0000109809125,0.00004755868,0.00033209368,0.000028730312,0.0000044041867,0.00006614485,0.0063469433,0.022203436,0.0000060205975,0.21041873,0.000009537936,0.7605254],"study_design_scores_gemma":[0.0008333805,0.00009499085,0.0010493144,0.0010756414,0.000009228913,0.000003736185,0.000003470683,0.011767273,0.00003874128,0.95493466,0.029287938,0.0009016342],"about_ca_topic_score_codex":0.0016153179,"about_ca_topic_score_gemma":0.019723553,"teacher_disagreement_score":0.991759,"about_ca_system_score_codex":0.0009949633,"about_ca_system_score_gemma":0.0022734236,"threshold_uncertainty_score":0.9999597},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014637701,0.00012759224,0.9803872,0.0015937455,0.0023050422,0.0004979486,0.0000044297994,0.000269429,0.00017689921],"genre_scores_gemma":[0.5573017,0.000010561731,0.44178268,0.0006150289,0.00023133423,0.00003764198,0.00000658239,0.00001286524,0.0000015860519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953033,0.00030309794,0.00051999546,0.0019375138,0.0010575422,0.0008786073],"domain_scores_gemma":[0.9958817,0.0008422734,0.00024968587,0.0024728444,0.00031644737,0.00023706871],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017578751,0.0004336358,0.00044960628,0.0012098588,0.00038079364,0.0011447582,0.0055329977,0.0002878874,0.00001772558],"category_scores_gemma":[0.00028314395,0.0004149694,0.00015373545,0.0021242634,0.00065814954,0.00086351857,0.003692035,0.0013727424,0.00004565838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005820676,0.00007001211,0.00044260535,0.000040576757,0.000007941993,0.000023070967,0.00070638565,0.3415775,0.002688604,0.007229093,0.00001755129,0.64719087],"study_design_scores_gemma":[0.00016503858,0.000059900085,0.001984615,0.00012432683,0.000002055303,0.00002063683,9.206296e-8,0.6570373,0.007892227,0.33231044,0.000057564474,0.00034579664],"about_ca_topic_score_codex":0.00003844249,"about_ca_topic_score_gemma":0.00011355754,"teacher_disagreement_score":0.64684504,"about_ca_system_score_codex":0.00035803494,"about_ca_system_score_gemma":0.0005158203,"threshold_uncertainty_score":0.9998922},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003077388,0.00047231946,0.99148566,0.00021201343,0.0006658034,0.00048272035,0.000012287,0.004980758,0.0013806758],"genre_scores_gemma":[0.28989258,5.621761e-7,0.7085101,0.001209839,0.00029981448,0.0000070545684,0.000005183056,0.00006217932,0.000012663148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99387515,0.00012117075,0.00085844006,0.001989261,0.0015567237,0.0015992807],"domain_scores_gemma":[0.98886514,0.0076877447,0.0005457011,0.0016961914,0.0007985539,0.00040667193],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034567208,0.0008750442,0.0007370238,0.0011170111,0.000803583,0.0010017644,0.0034453068,0.00045734827,0.000013060794],"category_scores_gemma":[0.0032004395,0.00087627495,0.0001396858,0.0016437151,0.0011535147,0.0006254359,0.0013493373,0.0015776143,0.000015187936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002733893,0.00005024745,0.005926311,0.00011858135,0.000006501562,0.000095501025,0.00014740284,0.054417785,0.0020170265,0.00021370623,0.000052357194,0.9369519],"study_design_scores_gemma":[0.00023094918,0.00016137882,0.00011039737,0.0020697834,0.000013588768,0.00015096318,6.337268e-8,0.97456056,0.003992653,0.017635169,0.00007627061,0.0009982231],"about_ca_topic_score_codex":0.00024635336,"about_ca_topic_score_gemma":0.000004593463,"teacher_disagreement_score":0.9359536,"about_ca_system_score_codex":0.0006687248,"about_ca_system_score_gemma":0.0020755415,"threshold_uncertainty_score":0.9993688},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025960323,0.00062162016,0.9932796,0.00087548327,0.00091848016,0.00030247925,0.0000030928525,0.00021542404,0.003524221],"genre_scores_gemma":[0.37867236,0.00013253841,0.61748374,0.0025018796,0.0005347412,0.000011325637,0.000011490902,0.000047622576,0.0006043002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972483,0.00003188257,0.0003681697,0.0012479692,0.00060038676,0.0005033088],"domain_scores_gemma":[0.99809086,0.0002877946,0.00020895177,0.0010857139,0.00016101125,0.00016563863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055919425,0.00041739095,0.0004109925,0.0004692517,0.0002547732,0.00077627605,0.0020652555,0.00023686817,0.00008818011],"category_scores_gemma":[0.00004634417,0.0003732354,0.00006001419,0.00038394597,0.0010421944,0.00081806397,0.0014653924,0.0004748742,0.00009713991],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010065974,0.000011224322,0.00004038298,0.000026988133,0.0000047055432,0.00001831837,0.00028209173,0.0008780434,0.00004352567,0.21233602,0.00004171688,0.786316],"study_design_scores_gemma":[0.00012281034,0.000059276466,0.00035082857,0.00014338801,0.0000029608775,0.00005373238,6.7172635e-8,0.5367782,0.00017897514,0.46109077,0.0008441552,0.00037480536],"about_ca_topic_score_codex":0.00003984297,"about_ca_topic_score_gemma":0.00003670439,"teacher_disagreement_score":0.7859412,"about_ca_system_score_codex":0.00016365502,"about_ca_system_score_gemma":0.00023489624,"threshold_uncertainty_score":0.99987197},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048563106,0.0008924637,0.9880223,0.0002939768,0.006323914,0.00096084015,0.000033809512,0.00042400145,0.0030000794],"genre_scores_gemma":[0.37682027,0.000009600266,0.62085396,0.0006942718,0.0009910938,0.000029719586,0.000029607967,0.000074481875,0.00049700774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946236,0.000070073125,0.0009290033,0.002227659,0.001045542,0.0011041268],"domain_scores_gemma":[0.9961539,0.00062340236,0.0005879764,0.0019087776,0.00044263626,0.00028331325],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014421978,0.00082572066,0.0009780321,0.0007698511,0.0004985847,0.0011404855,0.0043937815,0.00055724435,0.0000047233793],"category_scores_gemma":[0.00011033454,0.0007605401,0.00032035913,0.00074570585,0.000352138,0.00042415256,0.0006810492,0.00075455173,0.000030653508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001622479,0.000032422628,0.00003344863,0.0005697626,0.000059432496,0.000111306785,0.0008718428,0.61381555,0.00016724622,0.16731234,0.00016264778,0.21684775],"study_design_scores_gemma":[0.00069596997,0.00019797772,0.000010612205,0.001188217,0.000020235566,0.00025418086,6.37045e-7,0.9321332,0.00051183836,0.05174642,0.0121051045,0.0011356067],"about_ca_topic_score_codex":0.000013891907,"about_ca_topic_score_gemma":0.000018174995,"teacher_disagreement_score":0.37677172,"about_ca_system_score_codex":0.00056017906,"about_ca_system_score_gemma":0.0006564604,"threshold_uncertainty_score":0.9998964},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011838017,0.00024941302,0.97784454,0.0008859307,0.000922104,0.00029149483,0.000003969351,0.005789808,0.0140009085],"genre_scores_gemma":[0.098817706,0.0000093363315,0.8991173,0.0013642791,0.00041862766,0.000013816291,0.0000030356548,0.00004288862,0.00021301447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590284,0.00003469675,0.00057045603,0.0016870131,0.0011198767,0.00068512507],"domain_scores_gemma":[0.99541837,0.0014980563,0.0003636146,0.002071171,0.0004599931,0.0001887656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009837671,0.0005675999,0.00048331497,0.0010490617,0.0003192609,0.00071199914,0.0041057193,0.000321585,0.000030394405],"category_scores_gemma":[0.0009146662,0.0005413883,0.00012216577,0.001169023,0.0005853147,0.0003523793,0.0007982066,0.00084578345,0.000087688015],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010777115,0.000030339046,0.00032067052,0.000029944526,0.0000034446673,0.00007264402,0.0001205777,0.006704781,0.00004162867,0.00490174,0.00037061516,0.98740256],"study_design_scores_gemma":[0.00011984208,0.00011648631,0.00019508705,0.00049393816,0.000004233847,0.000050001086,5.8960095e-9,0.74094385,0.00052614295,0.2556261,0.0013397826,0.00058455503],"about_ca_topic_score_codex":0.00003204423,"about_ca_topic_score_gemma":0.000005839128,"teacher_disagreement_score":0.98681796,"about_ca_system_score_codex":0.00037664062,"about_ca_system_score_gemma":0.0008613099,"threshold_uncertainty_score":0.99970376},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011633995,0.00014242715,0.99562716,0.00039524143,0.0010224516,0.0007752578,0.000029263385,0.00041209848,0.0015844854],"genre_scores_gemma":[0.14000611,0.000046363155,0.8580442,0.0006272363,0.00063489215,0.00010865664,0.000020628324,0.000046504243,0.00046539225],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964756,0.000018786115,0.00051227777,0.0019816877,0.00047474395,0.00053692784],"domain_scores_gemma":[0.9942669,0.0004088198,0.00031380527,0.0046156975,0.00023397224,0.00016075141],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007347935,0.0004271327,0.00040710618,0.00058886985,0.00036780818,0.0003804206,0.008154604,0.0003802656,0.000015008912],"category_scores_gemma":[0.0001502781,0.0004031951,0.00012802873,0.00054693635,0.00042939145,0.0007626934,0.0030789354,0.0005514214,0.000025898526],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006465938,0.00003158824,0.000005768053,0.00001942124,0.000008941019,0.0000072339303,0.00007235081,0.00015529137,0.00015072433,0.04051868,0.00013559821,0.95888793],"study_design_scores_gemma":[0.00017620849,0.0002941822,0.000041518306,0.000034669436,0.000013795988,0.00008013435,4.499948e-8,0.3478071,0.005265739,0.62966776,0.016087135,0.00053168595],"about_ca_topic_score_codex":0.00007308959,"about_ca_topic_score_gemma":0.00016440438,"teacher_disagreement_score":0.95835626,"about_ca_system_score_codex":0.00020436151,"about_ca_system_score_gemma":0.00028366724,"threshold_uncertainty_score":0.999842},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011119313,0.0005688382,0.9966798,0.00022664291,0.00046551062,0.00054024754,0.000008054955,0.000112151516,0.0013876426],"genre_scores_gemma":[0.01844343,0.0000363443,0.98034203,0.00074596435,0.00028713112,0.000013178134,0.000006095053,0.000028804836,0.000097032884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967896,0.000038543996,0.00042773705,0.0016146625,0.00048927235,0.0006402221],"domain_scores_gemma":[0.99835587,0.00038272067,0.00012594873,0.00079371233,0.0001269876,0.00021479302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010863412,0.0004793749,0.00056669343,0.0005194606,0.0002591083,0.0004822048,0.0014827682,0.00031031118,0.0000016309511],"category_scores_gemma":[0.00006818336,0.0004281317,0.00008921073,0.00024139787,0.0003000799,0.00038873285,0.0007906717,0.0005724481,9.2855805e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083817,0.000016369957,0.000001305232,0.00006565985,0.000005657068,0.000018644298,0.0003332411,0.07153239,0.000050018618,0.056179043,0.0000056087715,0.8717837],"study_design_scores_gemma":[0.00016769419,0.0001541314,0.00000469774,0.00010083315,0.000007019555,0.0000498599,4.894939e-8,0.7174839,0.000026407044,0.28157705,0.00006871195,0.00035970067],"about_ca_topic_score_codex":0.0000082088,"about_ca_topic_score_gemma":0.0000058222627,"teacher_disagreement_score":0.87142396,"about_ca_system_score_codex":0.00012691854,"about_ca_system_score_gemma":0.00025368814,"threshold_uncertainty_score":0.9998171},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008709418,0.00022544936,0.9898827,0.00013233218,0.0024311359,0.00072247494,0.000005149882,0.0008659657,0.0056477003],"genre_scores_gemma":[0.14324066,0.000014583486,0.85589945,0.0004578732,0.00026707916,0.000014168589,0.0000034963955,0.000042588497,0.00006007755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957696,0.00013750383,0.00075200165,0.0016358353,0.0009905748,0.0007144727],"domain_scores_gemma":[0.9964586,0.00019253537,0.00065106124,0.0020758447,0.00045003332,0.0001719242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023123238,0.00058506354,0.0005671037,0.0009051779,0.00035189936,0.00055283424,0.004042453,0.00046226915,0.000022132828],"category_scores_gemma":[0.00026015277,0.00053456525,0.00013674873,0.0007624196,0.0007627508,0.0012891571,0.0007196003,0.0007301093,0.000051027044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001602506,0.000036479527,0.000026297534,0.000060452017,0.000018980953,0.000027088417,0.001277469,0.013213252,0.001990802,0.3072497,0.0000058012724,0.67607766],"study_design_scores_gemma":[0.00022810578,0.00010026156,0.00024880026,0.00024227801,0.000014090039,0.000068076326,1.01142824e-7,0.88997656,0.0076587475,0.100502305,0.00038917505,0.00057149556],"about_ca_topic_score_codex":0.00004243492,"about_ca_topic_score_gemma":0.0000074367613,"teacher_disagreement_score":0.87676334,"about_ca_system_score_codex":0.0006087371,"about_ca_system_score_gemma":0.00090627314,"threshold_uncertainty_score":0.99971056},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008856103,0.00081317517,0.987171,0.00030759154,0.0016874789,0.0009035059,0.00005316158,0.0001322138,0.00007575495],"genre_scores_gemma":[0.49230257,0.00004149317,0.50689316,0.00030802382,0.00032969355,0.000031686184,0.00005991722,0.000028714487,0.0000047369404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614567,0.00008650958,0.0006199029,0.0016952886,0.00058481767,0.0008678091],"domain_scores_gemma":[0.9969222,0.001094329,0.00028567846,0.0011816055,0.00019305335,0.00032311762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016147596,0.00058607856,0.0006746257,0.00108496,0.00042866362,0.0006876985,0.0024261114,0.00037562888,0.0000063459643],"category_scores_gemma":[0.00010687616,0.0005812454,0.00011231387,0.0008534637,0.00069752266,0.0020532375,0.0009048363,0.0007585366,0.0000016342349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003893614,0.00028894795,0.0035215118,0.0002586399,0.000015593529,0.000046133082,0.0068483218,0.03612656,0.00007413531,0.086798124,0.000029456389,0.8659536],"study_design_scores_gemma":[0.0006994093,0.00013470437,0.0029428347,0.00021467822,0.0000114237055,0.000072689065,0.0000016186981,0.87534565,0.00014502775,0.11914657,0.000510653,0.00077472616],"about_ca_topic_score_codex":0.0000929081,"about_ca_topic_score_gemma":0.0006433701,"teacher_disagreement_score":0.86517894,"about_ca_system_score_codex":0.00016892505,"about_ca_system_score_gemma":0.00028944528,"threshold_uncertainty_score":0.9996639},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017548017,0.0017642106,0.67915034,0.008311282,0.02384236,0.0069526,0.000019723813,0.0005149468,0.2618965],"genre_scores_gemma":[0.9899855,0.000051571755,0.00067037495,0.0056330967,0.0015538665,0.00004732499,0.0000191112,0.00007888451,0.0019602259],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967998,0.000033559412,0.0005663682,0.0008945631,0.0011812954,0.0005243584],"domain_scores_gemma":[0.99708045,0.0010187698,0.00049572135,0.001214989,0.00015552674,0.000034541783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023916853,0.0004963014,0.00051889,0.00078002305,0.00041137298,0.0003981483,0.0016710568,0.00017237921,0.00015405747],"category_scores_gemma":[0.00043704134,0.00032919613,0.00022700771,0.00036027422,0.0007823584,0.00021208874,0.001041441,0.00048771268,0.0001708331],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032639602,0.00007932875,0.0024138396,0.000305069,0.0001120667,0.00007305219,0.00030280932,0.016759401,0.00007004378,0.21236587,0.011532452,0.7556597],"study_design_scores_gemma":[0.0024437306,0.0015272403,0.0014116467,0.003648069,0.00016002126,0.0000063909483,0.0000046044306,0.14063853,0.0011322462,0.12812264,0.7189511,0.001953759],"about_ca_topic_score_codex":0.00004508372,"about_ca_topic_score_gemma":0.000079206875,"teacher_disagreement_score":0.9724375,"about_ca_system_score_codex":0.00019277979,"about_ca_system_score_gemma":0.00005157673,"threshold_uncertainty_score":0.999916},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058950674,0.0003318125,0.98823977,0.00094857253,0.0009216339,0.00021488324,0.0000035350267,0.0002950763,0.008985794],"genre_scores_gemma":[0.18793619,0.00026591658,0.80408496,0.0026476588,0.0009725643,0.000013829562,0.000051287545,0.00006341236,0.003964206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967274,0.000031790838,0.00049203716,0.0013297431,0.00085835374,0.0005606448],"domain_scores_gemma":[0.99698126,0.0006139182,0.0003569618,0.0017121297,0.00017858903,0.00015712794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006641633,0.00042150708,0.00038681543,0.0007097323,0.00043687868,0.00042879322,0.0029343797,0.0002515921,0.00001604638],"category_scores_gemma":[0.00038619337,0.0003872123,0.00010783534,0.00051080197,0.00043091393,0.0007451604,0.0010724828,0.0008584749,0.00009791642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034694824,0.000007333142,0.00006325589,0.000028438746,0.0000057765283,0.00022220246,0.00059560896,0.021232974,0.00008586841,0.03128571,0.00018176979,0.9462876],"study_design_scores_gemma":[0.00021057008,0.00015421434,0.00023063523,0.0002643784,0.000004785943,0.00062525895,1.0792835e-7,0.96711826,0.0005415762,0.0083388295,0.02177348,0.0007378827],"about_ca_topic_score_codex":0.000047997415,"about_ca_topic_score_gemma":0.000025818303,"teacher_disagreement_score":0.9458853,"about_ca_system_score_codex":0.00019483225,"about_ca_system_score_gemma":0.00047825338,"threshold_uncertainty_score":0.99985796},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015781501,0.0005580886,0.97983134,0.0006401967,0.00060511404,0.00076917687,0.0001088043,0.00007392843,0.017255543],"genre_scores_gemma":[0.8740598,0.00020821783,0.113521755,0.0038080108,0.0046826066,0.0026587218,0.000093571725,0.00020651291,0.00076078903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972201,0.0000013411984,0.0006842922,0.0013938905,0.00018703766,0.0005133635],"domain_scores_gemma":[0.9982823,0.00023476676,0.00040410535,0.0009111816,0.00005526933,0.00011234667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025067912,0.00046235538,0.0005500677,0.00077832147,0.00044196364,0.00014562877,0.001008941,0.0002078383,0.000028310618],"category_scores_gemma":[0.00007299317,0.00050219934,0.00015232597,0.00048860325,0.00035010147,0.00011146477,0.00021919199,0.000619941,0.00036143037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011691838,0.00008206979,0.000016389424,0.000029762765,0.000004426091,0.000004545823,0.00023092132,0.025066022,0.0000048297493,0.8988035,0.00003223491,0.07571361],"study_design_scores_gemma":[0.00027307658,0.00022065578,0.0005331758,0.00020038846,0.0000043781747,0.0000062660465,1.7499106e-7,0.0075978474,0.0002456672,0.95184225,0.038375158,0.00070098427],"about_ca_topic_score_codex":0.00007540757,"about_ca_topic_score_gemma":0.000050628085,"teacher_disagreement_score":0.873902,"about_ca_system_score_codex":0.00036384206,"about_ca_system_score_gemma":0.00011913966,"threshold_uncertainty_score":0.999743},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011594799,0.00005634506,0.8927708,0.00028554347,0.00043791824,0.10500519,0.000007865753,0.00011193291,0.0013127904],"genre_scores_gemma":[0.004445123,0.000027773172,0.7065431,0.0036528716,0.0011151235,0.2824089,0.000017905788,0.00011908907,0.0016701563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946444,0.00004792537,0.0007968524,0.0022771817,0.0011683535,0.0010652863],"domain_scores_gemma":[0.99707764,0.0003195974,0.0003960976,0.0019301887,0.00006846276,0.0002080109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010839845,0.0007183789,0.0006007183,0.00088356604,0.00018033774,0.00041408234,0.0040194076,0.00031394407,0.00014727816],"category_scores_gemma":[0.000022624303,0.00068829296,0.00018791837,0.00047699484,0.00034653262,0.0005045493,0.0021063625,0.0006534582,0.00009384472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015611282,0.000103245584,0.00003098385,0.00010354313,0.000009185614,0.00007379914,0.00030659905,0.38860026,0.000009724093,0.0032220555,0.00043929275,0.6070857],"study_design_scores_gemma":[0.0012328329,0.0004951214,0.00007129177,0.00051298225,0.000006456362,0.000010883597,1.4852363e-7,0.7415349,0.00034173307,0.019917117,0.235034,0.00084252417],"about_ca_topic_score_codex":0.000012521264,"about_ca_topic_score_gemma":0.00006638518,"teacher_disagreement_score":0.6062432,"about_ca_system_score_codex":0.0012711084,"about_ca_system_score_gemma":0.00036905086,"threshold_uncertainty_score":0.99955684},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013400582,0.0021975748,0.9933765,0.000009499879,0.0012431596,0.00023447497,0.000005664515,0.00009471671,0.0014983464],"genre_scores_gemma":[0.947358,0.00016660815,0.05194518,0.00004799375,0.00032994634,0.000008290574,0.000012266688,0.000044433717,0.00008727506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857706,0.0000060470866,0.000356759,0.0003535391,0.00038677864,0.00031982682],"domain_scores_gemma":[0.9991801,0.00007165261,0.00008845672,0.00048838044,0.000090107285,0.00008133548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026135132,0.00026811525,0.00032244308,0.00026741755,0.000046344514,0.000041384927,0.00057145045,0.0002215508,0.00006652754],"category_scores_gemma":[0.000009654557,0.00024872064,0.00007169387,0.00019725991,0.0002714919,0.00016320344,0.000121000325,0.0003384135,0.000033794084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.1185127e-7,0.000005257423,0.000026932743,0.00006241928,0.000004968985,0.0000034902755,0.00025263906,0.5457316,0.0012204072,0.0005104175,0.000003604904,0.45217755],"study_design_scores_gemma":[0.00013820834,0.00015017665,0.00019144716,0.0010305947,0.000022874427,0.000039666924,3.0158816e-7,0.87668866,0.100066185,0.018419843,0.002313698,0.0009383267],"about_ca_topic_score_codex":0.000012338604,"about_ca_topic_score_gemma":0.000009806605,"teacher_disagreement_score":0.9460179,"about_ca_system_score_codex":0.0001125671,"about_ca_system_score_gemma":0.000049161183,"threshold_uncertainty_score":0.9999965},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002842769,0.0002709008,0.9908558,0.0009042168,0.002827897,0.00042363818,0.0000057507073,0.00019994764,0.00422758],"genre_scores_gemma":[0.58159524,0.00010393095,0.41152734,0.002402962,0.0011385498,0.000023812578,0.000014006582,0.000085784086,0.0031083487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599034,0.00004053979,0.000602253,0.0016150178,0.0010000103,0.0007518364],"domain_scores_gemma":[0.99733615,0.0006514751,0.00039799584,0.0010874128,0.00032454747,0.00020243497],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00078181265,0.00054639444,0.0004670001,0.00058575784,0.0003373982,0.00092359545,0.0022368704,0.00041759058,0.00007246595],"category_scores_gemma":[0.000094842166,0.0005172273,0.00012536847,0.00036432224,0.0007418988,0.0012572677,0.00091595255,0.00095977396,0.00083644874],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034328343,0.000029661673,0.000026432235,0.000026305845,0.000014546926,0.00010685878,0.0014040577,0.013490479,0.0023336026,0.011291356,0.0006531531,0.9706201],"study_design_scores_gemma":[0.00009573316,0.0001953179,0.00007609311,0.000524895,0.000011252057,0.00011490034,0.0000014963719,0.6662498,0.07417851,0.25137243,0.005877906,0.001301644],"about_ca_topic_score_codex":0.000069190064,"about_ca_topic_score_gemma":0.00004801269,"teacher_disagreement_score":0.96931845,"about_ca_system_score_codex":0.00041240323,"about_ca_system_score_gemma":0.00027104435,"threshold_uncertainty_score":0.9999415},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000066727305,0.0001334663,0.98844814,0.00052364,0.0015506374,0.008776289,0.0000075106036,0.00023388314,0.00025969648],"genre_scores_gemma":[0.041159455,0.00007297919,0.9533831,0.0018414079,0.001430984,0.001038548,0.0001874941,0.000105120605,0.0007808942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942064,0.00012778364,0.0009572478,0.002778283,0.00085421384,0.0010760353],"domain_scores_gemma":[0.9947525,0.001083558,0.00060593267,0.0029857988,0.00040028532,0.00017187564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002066612,0.0007232976,0.0007697882,0.0011373522,0.00036505988,0.0008326937,0.0052149077,0.0007094573,0.000005220772],"category_scores_gemma":[0.00019885348,0.00071506744,0.00010246435,0.0017386392,0.00037888013,0.0010192589,0.0012622632,0.0010304572,0.000007200307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002530845,0.00004649714,0.000014594937,0.000023465265,0.0000050746885,0.000041548443,0.00006595236,0.69395185,0.000022211867,0.0029451682,0.00008812351,0.3027702],"study_design_scores_gemma":[0.0007818924,0.00029769263,0.00013407774,0.0010822956,0.000006560626,0.00004317408,6.7837604e-8,0.98208636,0.00045514514,0.013482579,0.00087262155,0.00075750524],"about_ca_topic_score_codex":0.0000463672,"about_ca_topic_score_gemma":0.0005040918,"teacher_disagreement_score":0.30201268,"about_ca_system_score_codex":0.00063417887,"about_ca_system_score_gemma":0.00058270694,"threshold_uncertainty_score":0.99953},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011455865,0.0003552497,0.9911255,0.0015813962,0.001426691,0.00016015905,0.0000094675925,0.0002468941,0.0039490056],"genre_scores_gemma":[0.24363449,0.00006790642,0.7516869,0.0016617838,0.00106973,0.000009839487,0.000021340546,0.000042396645,0.0018056388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995428,0.000069248505,0.00080574077,0.0016561728,0.0012490872,0.000791739],"domain_scores_gemma":[0.9968049,0.0007337884,0.0006952016,0.0012333528,0.0003422849,0.00019047507],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020106935,0.0005795474,0.00071618496,0.00083538867,0.00043328598,0.0012469647,0.002837484,0.00039615732,0.00002937934],"category_scores_gemma":[0.00047655846,0.00053408096,0.00021845978,0.0007667762,0.00022672996,0.0010371306,0.001993666,0.00094561273,0.0000752594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033275871,0.000029102841,0.00095467834,0.000036582183,0.000054639775,0.000071668015,0.0022782737,0.01808116,0.0014901507,0.0019711554,0.00012731238,0.974902],"study_design_scores_gemma":[0.00026702188,0.000078661236,0.000079303965,0.000646316,0.000023140441,0.000031145908,0.0000024568392,0.99155885,0.00039339083,0.0032051639,0.0030465466,0.0006679733],"about_ca_topic_score_codex":0.00008303384,"about_ca_topic_score_gemma":0.0011635586,"teacher_disagreement_score":0.974234,"about_ca_system_score_codex":0.0012600819,"about_ca_system_score_gemma":0.0006678114,"threshold_uncertainty_score":0.99978983},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27968377,0.00034978293,0.7181104,0.00077448424,0.0006240925,0.00035055965,0.000004041627,0.000050279006,0.000052610318],"genre_scores_gemma":[0.8923049,0.000015495652,0.10667553,0.00086140045,0.00011670065,0.000009315666,0.000002578288,0.000012213828,0.0000018529635],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99826854,0.00003641273,0.00037123452,0.00040729783,0.00046503593,0.00045145705],"domain_scores_gemma":[0.9984092,0.00066160405,0.00008326937,0.00053932663,0.00022492044,0.00008168737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018958803,0.00015834988,0.00038685143,0.0002727325,0.00009646993,0.000029413735,0.00027667286,0.000083181054,0.0000050971025],"category_scores_gemma":[0.00011558187,0.00011132538,0.00069899415,0.0010281962,0.0004937143,0.00017074292,0.00012392373,0.00019164197,6.18437e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020999163,0.00018274384,0.031027824,0.00011681709,0.000037264104,0.000028076176,0.0007160958,0.0028294746,0.035616256,0.00019631584,0.0007704829,0.9282687],"study_design_scores_gemma":[0.0005898746,0.00027814065,0.5579593,0.00042541625,0.00004796294,0.0005295881,0.0000053138347,0.12442476,0.29114923,0.023416711,0.0006951033,0.00047859267],"about_ca_topic_score_codex":0.000056895282,"about_ca_topic_score_gemma":0.00001932269,"teacher_disagreement_score":0.92779005,"about_ca_system_score_codex":0.00014686254,"about_ca_system_score_gemma":0.0003503522,"threshold_uncertainty_score":0.45397174},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004697736,0.00047183127,0.989968,0.00074805116,0.0018610503,0.0011956843,0.000002539282,0.0002787417,0.0050042993],"genre_scores_gemma":[0.7279789,0.000109705215,0.2687012,0.0012229185,0.00053937273,0.00023935657,0.00006772636,0.00006581763,0.0010750381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959223,0.00013837706,0.000719995,0.0015820657,0.0009792782,0.00065796345],"domain_scores_gemma":[0.995482,0.0007443896,0.0007199401,0.002325318,0.00055185775,0.00017647346],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013549365,0.0005384311,0.00047679018,0.0010043915,0.00046888582,0.0010619027,0.0038913044,0.00036408263,0.00025346247],"category_scores_gemma":[0.00011226444,0.00055060314,0.00013970149,0.0006406944,0.00042496563,0.002372636,0.0018217221,0.0013230554,0.00037685386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000632925,0.00009989701,0.000078495475,0.00007774736,0.00002087271,0.000017325006,0.006424783,0.07250624,0.00062707,0.0061682696,0.00024559532,0.9137274],"study_design_scores_gemma":[0.00042670188,0.000611236,0.0003152741,0.0017251002,0.000025207593,0.00019350616,0.000006761969,0.8806944,0.005791665,0.09371384,0.014953553,0.0015427473],"about_ca_topic_score_codex":0.000054120523,"about_ca_topic_score_gemma":0.00001543461,"teacher_disagreement_score":0.91218466,"about_ca_system_score_codex":0.0009394488,"about_ca_system_score_gemma":0.0007502332,"threshold_uncertainty_score":0.9999751},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8365025,0.000039547554,0.16225894,0.00007653149,0.00025168713,0.00071830134,0.000003236012,0.00007145567,0.0000778332],"genre_scores_gemma":[0.99532866,0.0000040075747,0.0044850674,0.000029361629,0.00011143842,0.000011518318,2.7607618e-7,0.000018504348,0.0000111625195],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99668914,0.00016875874,0.00037451196,0.0013048234,0.001003258,0.0004594852],"domain_scores_gemma":[0.99503785,0.0026254663,0.00015426402,0.0019041932,0.00015301563,0.00012520136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023756532,0.00037504837,0.0004546709,0.0007531492,0.0001640244,0.00019066864,0.0016916838,0.00012542075,0.0000018245896],"category_scores_gemma":[0.0009309996,0.00025248175,0.00006830794,0.0007140508,0.0004191816,0.0003775364,0.00079614844,0.0011334319,0.0000019043721],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009086035,0.0016474022,0.15294683,0.00011270881,0.00006391704,0.0050359624,0.043898154,0.26370946,0.0007856099,0.0012818469,0.00002231072,0.5304049],"study_design_scores_gemma":[0.0015321309,0.010899646,0.7100168,0.001061809,0.000008392531,0.002702771,0.000012685104,0.2577058,0.0037870982,0.0099608395,0.000024235413,0.0022877876],"about_ca_topic_score_codex":0.0006409989,"about_ca_topic_score_gemma":0.0001586933,"teacher_disagreement_score":0.55706996,"about_ca_system_score_codex":0.00042761012,"about_ca_system_score_gemma":0.00036286074,"threshold_uncertainty_score":0.9999927},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000026026544,0.00011072312,0.98795867,0.00033041596,0.00090581767,0.0003958022,0.000005699742,0.00036618856,0.00992407],"genre_scores_gemma":[0.012143397,0.0000040991986,0.9844989,0.0027115303,0.00025866186,0.0000033221686,0.0000029883279,0.00004406635,0.00033303173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957675,0.000016511443,0.0006601574,0.0015033511,0.0013447367,0.00070779206],"domain_scores_gemma":[0.9970571,0.00039524568,0.00034761225,0.0015579086,0.00031019695,0.00033194438],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008751422,0.0005794551,0.0005832555,0.0017268239,0.0000947707,0.0006649024,0.004074933,0.0002601326,0.000011666223],"category_scores_gemma":[0.0001359781,0.00055153196,0.00014321486,0.00096696545,0.0002637213,0.0007651278,0.0014215226,0.000629338,0.000022143562],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008756159,0.000037435926,0.0000036401282,0.00003850864,0.0000030082974,0.00009091901,0.00018686563,0.010620602,0.00014677495,0.0003754968,0.000039565057,0.98844844],"study_design_scores_gemma":[0.0002470186,0.000650537,0.000025564847,0.0018622844,0.000004697263,0.000040386512,6.787707e-8,0.9421575,0.02632077,0.026795764,0.0011821293,0.00071327825],"about_ca_topic_score_codex":0.000028749162,"about_ca_topic_score_gemma":0.00004521867,"teacher_disagreement_score":0.98773515,"about_ca_system_score_codex":0.00030534304,"about_ca_system_score_gemma":0.00072933274,"threshold_uncertainty_score":0.99969363},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004885971,0.000083117455,0.99120253,0.0017554334,0.0009403003,0.002589522,0.0000074121313,0.0006481811,0.0022848765],"genre_scores_gemma":[0.21248348,0.00002811209,0.7818342,0.004242223,0.00052143604,0.00023271293,0.000004884833,0.000060666924,0.000592279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553823,0.00007360159,0.00066777784,0.0021753926,0.0007640887,0.0007808903],"domain_scores_gemma":[0.9969306,0.00018679602,0.0002482731,0.0020570375,0.00029560458,0.00028166076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013474809,0.000667239,0.0006173908,0.0012616063,0.00028340227,0.00081014965,0.0036892232,0.00044413243,0.000029878916],"category_scores_gemma":[0.000098085446,0.00064597663,0.0001758748,0.0010378064,0.00035391175,0.0008204429,0.0011317369,0.0010449967,0.0005348456],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016821612,0.0002182518,0.00009292546,0.00014103475,0.000031019357,0.00018252236,0.0022185622,0.05173378,0.012567933,0.022521146,0.00043479103,0.90968984],"study_design_scores_gemma":[0.00081280735,0.003944111,0.00045698683,0.001990262,0.000028793485,0.00044697474,2.6756157e-7,0.5012955,0.07067497,0.36999005,0.046791665,0.0035675964],"about_ca_topic_score_codex":0.000034561148,"about_ca_topic_score_gemma":0.00016418847,"teacher_disagreement_score":0.9061222,"about_ca_system_score_codex":0.00074561586,"about_ca_system_score_gemma":0.0008149805,"threshold_uncertainty_score":0.99959916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023433122,0.00025269878,0.99394995,0.00036825187,0.0032822683,0.00058230764,0.000005303393,0.00013383968,0.0014019348],"genre_scores_gemma":[0.12060488,0.00029602845,0.87152135,0.0034903153,0.0033259648,0.000062403444,0.000029353048,0.000081397455,0.00058830186],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965958,0.000041390293,0.0005103646,0.0015029309,0.00065633445,0.0006931703],"domain_scores_gemma":[0.9981521,0.0005554286,0.00023546666,0.0007716747,0.000100444995,0.00018488156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082768453,0.00045152477,0.0004740846,0.00073649647,0.00031171166,0.0003828982,0.0018068061,0.00046424379,0.000108268636],"category_scores_gemma":[0.000036500725,0.0004492252,0.00015539539,0.00070909184,0.00016270489,0.00077828346,0.0005165329,0.0009410925,0.000015739226],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039015667,0.000013224618,0.000001792565,0.000007421683,0.0000055164705,0.000012745123,0.00018382304,0.11146531,0.000015652227,0.07171416,0.0000410128,0.8165003],"study_design_scores_gemma":[0.00026448324,0.00015748566,0.00007138084,0.00018506568,0.0000034824131,0.0000292076,8.57192e-8,0.47466397,0.0002485903,0.5205369,0.0034882932,0.00035108428],"about_ca_topic_score_codex":0.00007448515,"about_ca_topic_score_gemma":0.00040098213,"teacher_disagreement_score":0.81614923,"about_ca_system_score_codex":0.00043038424,"about_ca_system_score_gemma":0.00041106797,"threshold_uncertainty_score":0.999796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014365937,0.00024263338,0.98409414,0.00058903126,0.0008494072,0.00034796726,0.0000020187206,0.0032232495,0.010507876],"genre_scores_gemma":[0.033243984,0.00007115787,0.96337175,0.0022834586,0.00022111967,0.000014957666,0.000004183077,0.00006367071,0.00072571717],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99589694,0.00006262825,0.00059419696,0.0017309331,0.00088181393,0.0008334738],"domain_scores_gemma":[0.99630916,0.0011355565,0.0002807173,0.001886444,0.00021311369,0.00017502472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014470345,0.0005855997,0.0006227233,0.001280832,0.00015681183,0.00043912622,0.003406274,0.0004217228,0.000020904725],"category_scores_gemma":[0.00053854927,0.0005618057,0.00010597273,0.0011354184,0.00050494197,0.00044393216,0.0009984422,0.000874122,0.0001092782],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009119046,0.00012250438,0.0035888306,0.000080822414,0.0000117616655,0.0007796572,0.001048433,0.0060241693,0.00036100962,0.014697417,0.0029939513,0.9702823],"study_design_scores_gemma":[0.0002696115,0.00026261946,0.001126975,0.0009693689,0.0000052632854,0.00021348752,1.5869325e-8,0.15614133,0.0007531446,0.8375748,0.0014980581,0.0011853679],"about_ca_topic_score_codex":0.00013870871,"about_ca_topic_score_gemma":0.000053521395,"teacher_disagreement_score":0.96909696,"about_ca_system_score_codex":0.00041493942,"about_ca_system_score_gemma":0.00057640305,"threshold_uncertainty_score":0.9996833},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060930796,0.00021676728,0.99052507,0.00026626143,0.00055868324,0.00046404437,0.0000012203978,0.00013241284,0.0072262655],"genre_scores_gemma":[0.3423813,0.000013617741,0.657125,0.00023446576,0.00015359138,0.000005428232,0.000004228301,0.000027683514,0.00005468358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960041,0.00003201082,0.0007247724,0.0014327718,0.0010260596,0.00078027986],"domain_scores_gemma":[0.9973826,0.00033791235,0.00048161985,0.0013487712,0.00031046788,0.00013865496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014148745,0.0004997122,0.00059408514,0.0013669413,0.000121143974,0.00029394662,0.0028135872,0.0002928936,0.000009967408],"category_scores_gemma":[0.000052355517,0.0004176115,0.0000856472,0.001356926,0.0005897423,0.0005416538,0.0007388929,0.00074467895,0.000010898823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001407475,0.0000739669,0.00071540975,0.00007939754,0.000009669021,0.0001311024,0.0015185772,0.080955654,0.00016753307,0.04505648,0.0000026727498,0.8712755],"study_design_scores_gemma":[0.0010638151,0.00089461775,0.003799496,0.0027959368,0.000018986904,0.00022990156,0.0000025079808,0.87746036,0.004259499,0.10598615,0.0016659582,0.0018227772],"about_ca_topic_score_codex":0.00009292913,"about_ca_topic_score_gemma":0.00028724526,"teacher_disagreement_score":0.86945266,"about_ca_system_score_codex":0.0002728483,"about_ca_system_score_gemma":0.00040754495,"threshold_uncertainty_score":0.99982756},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012343395,0.000621693,0.9855575,0.0000125511815,0.00035565675,0.00025894115,0.00002731234,0.0000150189635,0.00080793496],"genre_scores_gemma":[0.9599949,0.000038029833,0.039411012,0.00025738133,0.00013240719,0.0000026073562,0.00009402132,0.000020866592,0.00004876247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846756,0.00001734487,0.00032862532,0.00064227806,0.0002395771,0.0003045859],"domain_scores_gemma":[0.99891627,0.000041647916,0.00023775024,0.0005833816,0.00015541332,0.00006555858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019605772,0.00031497877,0.00030715673,0.00020040579,0.000072863906,0.000025761445,0.00064260035,0.0005269158,0.00002521656],"category_scores_gemma":[0.00005997385,0.00024872355,0.0001207694,0.00010549355,0.0006149751,0.000007373229,0.00028206257,0.00025975052,0.0000017585943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011508295,0.000016327727,0.00020444316,0.00005444598,0.000021617454,0.0000075851112,0.00004199294,0.7551061,0.02759997,0.00081167364,0.0000020594664,0.2160187],"study_design_scores_gemma":[0.00067528896,0.001119642,0.0010932737,0.00014581124,0.000022755368,0.00002839282,1.3129313e-7,0.68063223,0.0844674,0.22966562,0.0012001551,0.0009493005],"about_ca_topic_score_codex":0.000011868487,"about_ca_topic_score_gemma":0.000045570127,"teacher_disagreement_score":0.9476515,"about_ca_system_score_codex":0.000046845536,"about_ca_system_score_gemma":0.0002561337,"threshold_uncertainty_score":0.9999965},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015382927,0.00043645842,0.9959068,0.0005658066,0.0013256924,0.0006056884,0.000012990977,0.00024069542,0.00075204106],"genre_scores_gemma":[0.14300342,0.00003368196,0.8561956,0.00030634232,0.00028276822,0.000028967606,0.000003124613,0.000029092178,0.00011697067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691325,0.000017905937,0.00051529123,0.0012884983,0.0007845253,0.0004804981],"domain_scores_gemma":[0.9965239,0.0011469215,0.00035152113,0.0010735816,0.0008082881,0.000095778356],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010915388,0.00041866823,0.0004535071,0.00045439042,0.00017460434,0.00023769222,0.0020983715,0.00024569564,0.00005917867],"category_scores_gemma":[0.0006696499,0.00039481197,0.00014944517,0.00052528275,0.00036374386,0.0011678225,0.0007755828,0.00050553575,0.00000706294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009409453,0.00024622763,0.0019640184,0.00046671118,0.00012023796,0.000048516235,0.0036751747,0.12180607,0.0007483552,0.47308666,0.00023311062,0.39751083],"study_design_scores_gemma":[0.000958166,0.0005770449,0.010162978,0.0013243712,0.000032983233,0.00007159684,0.000002019689,0.040742684,0.008437406,0.927425,0.0084515335,0.0018141628],"about_ca_topic_score_codex":0.00003450775,"about_ca_topic_score_gemma":0.00004023803,"teacher_disagreement_score":0.4543384,"about_ca_system_score_codex":0.0009403279,"about_ca_system_score_gemma":0.00084819633,"threshold_uncertainty_score":0.9998504},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000265014,0.0000393458,0.9439302,0.0006195005,0.0015365474,0.0002479124,0.0000075659464,0.0001083003,0.053484105],"genre_scores_gemma":[0.5938871,0.00015122893,0.40149286,0.0029064752,0.00037113976,0.000009577176,0.000012940375,0.000042664928,0.0011260195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758476,0.00002450717,0.00047677167,0.0008837342,0.00069027115,0.00033996464],"domain_scores_gemma":[0.99806774,0.00035698153,0.00030136426,0.00088146824,0.0002669228,0.00012554806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038274456,0.00032914974,0.00037900094,0.0009071398,0.00015301809,0.00015871307,0.001154265,0.00022760817,0.00027146746],"category_scores_gemma":[0.00008460129,0.00031651373,0.000116283445,0.0005631824,0.0012320529,0.00031180386,0.0002878289,0.0004978589,0.00005493523],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003839757,0.000024790834,0.00007595112,0.0000108959275,0.000008748543,0.000024360155,0.00016533943,0.04478701,0.000044195633,0.12917611,0.000027322652,0.82565147],"study_design_scores_gemma":[0.0013177788,0.000787787,0.0014240305,0.0011819307,0.00002725425,0.00041957162,9.75652e-7,0.7625931,0.0027763972,0.2207332,0.007042254,0.0016957431],"about_ca_topic_score_codex":0.000008614209,"about_ca_topic_score_gemma":0.00003208806,"teacher_disagreement_score":0.8239557,"about_ca_system_score_codex":0.00017423663,"about_ca_system_score_gemma":0.00050941657,"threshold_uncertainty_score":0.9999287},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010007576,0.00015071649,0.9969403,0.00010026624,0.0004287579,0.0009552372,0.0000766253,0.000021131204,0.00032621156],"genre_scores_gemma":[0.28173396,0.0000064413593,0.71557516,0.0009814859,0.0010883327,0.00003052612,0.00031329875,0.000050215225,0.0002205978],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978603,0.000037513946,0.00029111403,0.0010995124,0.00032039228,0.0003911754],"domain_scores_gemma":[0.99867475,0.000022884067,0.00019206639,0.00083226943,0.00015505735,0.0001229848],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000395963,0.00040113673,0.00031779634,0.0001630201,0.00015887684,0.000110865454,0.0007853264,0.0005337398,0.000012246196],"category_scores_gemma":[0.000027870487,0.0003593783,0.000115356626,0.000066175766,0.00020595673,0.000008296454,0.0002019554,0.00025254197,0.0000011615024],"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.00006668638,0.000011837968,0.0000069389175,0.00006554097,0.000024323268,0.000003359829,0.000057136967,0.02457515,0.56182045,0.0055068745,0.000021623402,0.40784007],"study_design_scores_gemma":[0.00070099806,0.0016425786,0.00003014899,0.00016126026,0.000035162462,0.00007633485,2.1038092e-7,0.14409348,0.566016,0.27445573,0.011658929,0.0011291523],"about_ca_topic_score_codex":0.0000073789806,"about_ca_topic_score_gemma":0.000079871425,"teacher_disagreement_score":0.40671092,"about_ca_system_score_codex":0.000081068225,"about_ca_system_score_gemma":0.0002047742,"threshold_uncertainty_score":0.9998858},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000063826847,0.00022242058,0.996393,0.00064193795,0.0008319595,0.0004946738,0.0006362743,0.00012817438,0.0006451758],"genre_scores_gemma":[0.00387619,0.000026286094,0.9930801,0.001367412,0.0008350905,0.00006683421,0.00047262385,0.000034725974,0.00024077969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968348,0.000028079037,0.00038730446,0.0014074503,0.0006264636,0.0007159106],"domain_scores_gemma":[0.9967812,0.0005951984,0.00030983734,0.0018637911,0.0001990983,0.0002508957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011657652,0.0004091037,0.00040209276,0.00036096503,0.00038005438,0.00062726287,0.0040986184,0.00027920533,0.000014051619],"category_scores_gemma":[0.000083783685,0.00037434182,0.00008992662,0.0004023808,0.0003924951,0.0012665882,0.0008010942,0.00048275178,0.000042488475],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015423442,0.000046519966,0.000016818056,0.000011553597,0.000009827966,0.0000041363405,0.00044788094,0.0006004003,0.00005273523,0.045952816,0.0003417353,0.95251405],"study_design_scores_gemma":[0.00025698086,0.00018423398,0.00017890305,0.000111133,0.000015975244,0.000016371167,3.9432305e-7,0.8189052,0.00040376838,0.13481213,0.04437252,0.0007424294],"about_ca_topic_score_codex":0.00003060553,"about_ca_topic_score_gemma":0.00006785839,"teacher_disagreement_score":0.9517716,"about_ca_system_score_codex":0.0002898992,"about_ca_system_score_gemma":0.00045693546,"threshold_uncertainty_score":0.99987084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014725466,0.0001871245,0.9508805,0.00007373021,0.0053514973,0.00022456024,0.000022932385,0.00011255214,0.041674532],"genre_scores_gemma":[0.8650509,0.00019202475,0.116881974,0.0068552555,0.003664795,0.000033680408,0.00035225798,0.00022531043,0.0067437785],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777436,0.00006857459,0.000422147,0.0009468078,0.0003394357,0.00044865362],"domain_scores_gemma":[0.99873334,0.000116500414,0.00032110102,0.00045306352,0.00025537866,0.00012061537],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038329087,0.00036658265,0.0003583696,0.00076993473,0.00015533694,0.00008985982,0.00039569603,0.0004937592,0.0015392816],"category_scores_gemma":[0.000032854052,0.00036612505,0.00012764624,0.00022793682,0.00043901036,0.00019061741,0.0001180413,0.0004593533,0.00021724444],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024427996,0.000047464287,0.000014133266,0.000013343921,0.00001830227,0.000048461392,0.0008033596,0.00011558388,0.00019644422,0.0014168996,0.000072135175,0.99722946],"study_design_scores_gemma":[0.0049830815,0.0024212275,0.0014739666,0.005104369,0.00039438665,0.0021014197,0.0000150687765,0.047972877,0.011578673,0.8886534,0.029380927,0.0059206346],"about_ca_topic_score_codex":0.00017156405,"about_ca_topic_score_gemma":0.0000951761,"teacher_disagreement_score":0.9913088,"about_ca_system_score_codex":0.00016715833,"about_ca_system_score_gemma":0.00011246527,"threshold_uncertainty_score":0.99987906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032028666,0.0002021227,0.9909366,0.0006726869,0.0047587436,0.0004652789,0.000008866959,0.00022847622,0.0024069843],"genre_scores_gemma":[0.07630321,0.000017172024,0.91914326,0.001864478,0.0018378915,0.00001761805,0.0000052746195,0.00006310125,0.0007479902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954727,0.000083341794,0.00056731363,0.001912632,0.0011571225,0.0008068661],"domain_scores_gemma":[0.9965545,0.00045120908,0.00025163902,0.001861275,0.00048741,0.00039394625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024301677,0.00059062045,0.00061159953,0.0008990331,0.00022971393,0.0008649149,0.0030819778,0.0003876268,0.000017168424],"category_scores_gemma":[0.00018588784,0.0005435785,0.00015401436,0.0008877943,0.0002854376,0.0007258966,0.0013544488,0.00088903715,0.0002163687],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011476116,0.00002079212,0.000032150674,0.000023398166,0.000009416219,0.00006518552,0.00028675748,0.0050261943,0.0005429209,0.00069149275,0.000029771316,0.99326044],"study_design_scores_gemma":[0.0015862174,0.0022575618,0.0008044098,0.00070000766,0.000030189343,0.0002800036,7.9076955e-7,0.6391554,0.019345691,0.28073874,0.051429316,0.0036716906],"about_ca_topic_score_codex":0.00006728104,"about_ca_topic_score_gemma":0.00030875005,"teacher_disagreement_score":0.98958874,"about_ca_system_score_codex":0.00050880713,"about_ca_system_score_gemma":0.0007427685,"threshold_uncertainty_score":0.99970156},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063737546,0.00017171164,0.99547607,0.0012430778,0.00021000455,0.0005158559,0.000003070292,0.000090833615,0.0016520161],"genre_scores_gemma":[0.09166879,0.000087314416,0.905035,0.0014637547,0.00021007101,0.000054248507,0.00000983644,0.000033281558,0.0014377059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970235,0.00003675264,0.00035065768,0.00080341613,0.0012940518,0.00049160287],"domain_scores_gemma":[0.9983799,0.0001834371,0.000116761505,0.0007495521,0.00037737473,0.00019301687],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008924975,0.00037186846,0.00043210722,0.0006860668,0.00028493346,0.0010908165,0.0014034444,0.00018009405,0.00006410839],"category_scores_gemma":[0.000013072978,0.00025005947,0.0000725146,0.0004914949,0.0006494483,0.0023419124,0.0007651861,0.0005964363,0.00008436906],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013911972,0.000028511635,0.000054043107,0.000070206916,0.000073655654,0.00007263737,0.004257463,0.009280546,0.00014287226,0.1583712,0.000027497656,0.82760745],"study_design_scores_gemma":[0.0015289485,0.0019891995,0.0008643293,0.0004721287,0.00015453211,0.00044936838,0.0000049493797,0.61063045,0.008908114,0.36234078,0.009672343,0.0029848479],"about_ca_topic_score_codex":0.000036012698,"about_ca_topic_score_gemma":0.000040646883,"teacher_disagreement_score":0.82462263,"about_ca_system_score_codex":0.00010976109,"about_ca_system_score_gemma":0.0003655853,"threshold_uncertainty_score":0.9999952},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030224994,0.0005409393,0.99467516,0.000330809,0.0014181595,0.00043743663,0.000090519694,0.00013461895,0.0020700847],"genre_scores_gemma":[0.29073313,0.00018643023,0.7067041,0.001234789,0.0006388696,0.000012731227,0.00032654672,0.000051752806,0.00011169004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99551773,0.00007533506,0.0007736254,0.0018297767,0.0012425252,0.00056103244],"domain_scores_gemma":[0.9935004,0.00043202526,0.0005441294,0.0050102053,0.0003380765,0.00017513185],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013917969,0.000462105,0.0006092577,0.00086157484,0.00020412487,0.00058785186,0.01010201,0.0003407789,0.00011570202],"category_scores_gemma":[0.00016098323,0.00044226812,0.00013407563,0.0007336522,0.00083191384,0.001913852,0.007914353,0.00074497785,0.00003401302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003266198,0.00025943274,0.00036810385,0.00053266715,0.00014085423,0.00008964204,0.003748785,0.0068145073,0.003133954,0.3091575,0.0017192868,0.67400265],"study_design_scores_gemma":[0.0005022886,0.00014115921,0.00046604837,0.00085314305,0.000028621997,0.000037825816,0.0000012550069,0.7049876,0.0025930821,0.28423712,0.0051752008,0.0009766824],"about_ca_topic_score_codex":0.00053770625,"about_ca_topic_score_gemma":0.00022224925,"teacher_disagreement_score":0.69817305,"about_ca_system_score_codex":0.00008217207,"about_ca_system_score_gemma":0.00033328423,"threshold_uncertainty_score":0.9998029},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015129856,0.0014500795,0.98704356,0.000052474323,0.00092360104,0.0007728067,0.0000051262077,0.00018408443,0.009416945],"genre_scores_gemma":[0.58158153,0.00015185587,0.41719583,0.0005011235,0.00022967381,0.00003721444,0.0000060857146,0.000041849045,0.00025485453],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957737,0.0000924665,0.00048270755,0.0014233162,0.0017868842,0.0004409757],"domain_scores_gemma":[0.9963894,0.00032274993,0.0005918161,0.0016290464,0.0009425287,0.00012445891],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013806735,0.00054694206,0.00072464824,0.0014572203,0.00015811253,0.000100845595,0.0024269258,0.00033473855,0.00002322202],"category_scores_gemma":[0.00013262294,0.00047247176,0.00022599736,0.0011730029,0.00065837975,0.00058580877,0.0005360736,0.00084205443,0.000010927663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003596588,0.00007441644,0.000029255614,0.00003966036,0.000027525195,0.000023433155,0.0019920557,0.0016336136,0.0012007592,0.006659738,0.00011439995,0.9881692],"study_design_scores_gemma":[0.0007750156,0.0020889766,0.0004569482,0.0013637668,0.000082660816,0.00005597806,5.1548443e-7,0.09563404,0.32082078,0.5726335,0.0044608545,0.001626931],"about_ca_topic_score_codex":0.00002050594,"about_ca_topic_score_gemma":0.00002602,"teacher_disagreement_score":0.9865422,"about_ca_system_score_codex":0.0005436969,"about_ca_system_score_gemma":0.0004727595,"threshold_uncertainty_score":0.9997727},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017100025,0.00037128243,0.9890514,0.00056284945,0.0013283209,0.00072761945,0.00003040034,0.00030862412,0.0076023964],"genre_scores_gemma":[0.20071813,0.0001128008,0.7953717,0.0008447446,0.0010854901,0.00009371126,0.000058638678,0.000071610906,0.00164317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963959,0.000049614377,0.0005699731,0.0014034259,0.0007811055,0.0007999968],"domain_scores_gemma":[0.9976804,0.0003892755,0.0002795281,0.0010970754,0.000380009,0.0001736776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018042559,0.0004787349,0.0005473003,0.00045122526,0.00041437056,0.00054848276,0.0029831675,0.00037181197,0.000023088183],"category_scores_gemma":[0.000043620206,0.00042280217,0.00022827798,0.00038612177,0.0004228985,0.0008307234,0.0011123793,0.0006345943,0.000013283235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014193401,0.000033810447,0.00004726809,0.00012310724,0.000019707999,0.00003161028,0.0013438419,0.0002527646,0.00011193459,0.3917495,0.00035075238,0.6059215],"study_design_scores_gemma":[0.0006618583,0.00045923845,0.0000389981,0.0008202085,0.000014085571,0.000119800374,7.195738e-7,0.56943923,0.0048302733,0.38118246,0.041163012,0.0012700851],"about_ca_topic_score_codex":0.000061249244,"about_ca_topic_score_gemma":0.00005116598,"teacher_disagreement_score":0.60465145,"about_ca_system_score_codex":0.0003479273,"about_ca_system_score_gemma":0.000532987,"threshold_uncertainty_score":0.9998224},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017621217,0.0014685523,0.99529487,0.00020325615,0.0005021835,0.0002755809,0.0000055185114,0.00017958344,0.00030832182],"genre_scores_gemma":[0.3986688,0.000059163012,0.5992312,0.0015142306,0.00043283295,0.0000031818695,0.000007615543,0.00005325166,0.000029750774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995539,0.00006190588,0.0006330132,0.0019638643,0.0010061677,0.00079601665],"domain_scores_gemma":[0.9981108,0.00046003898,0.00029882934,0.000527317,0.00028424943,0.00031876602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009673668,0.0006639069,0.00074164,0.001077592,0.00047845676,0.0007945711,0.0013055394,0.00055561506,0.000013880608],"category_scores_gemma":[0.00011917354,0.0006266873,0.00017461227,0.00095718243,0.0006251982,0.00073380145,0.0009070129,0.0014803564,0.000010829267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052753153,0.000020768957,0.000012185877,0.00006440062,0.000025651363,0.00011246984,0.00044873438,0.13652651,0.00046413616,0.00056687143,8.537777e-7,0.86175215],"study_design_scores_gemma":[0.00022862785,0.00005411021,0.00001060142,0.0011363121,0.00003705541,0.00009534843,0.000001844415,0.94878757,0.000625055,0.048307385,0.000035435936,0.0006806734],"about_ca_topic_score_codex":0.00008374764,"about_ca_topic_score_gemma":0.0002235327,"teacher_disagreement_score":0.86107147,"about_ca_system_score_codex":0.00037450946,"about_ca_system_score_gemma":0.00045791964,"threshold_uncertainty_score":0.9996185},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000090238565,0.0002033176,0.99303806,0.00045721044,0.0015483234,0.00019963346,0.0000010898632,0.00027626753,0.0041858903],"genre_scores_gemma":[0.7715087,0.000003639951,0.22529925,0.002345717,0.00055918965,0.0000019640145,0.0000046702153,0.000032287015,0.00024456266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951698,0.00003917576,0.0007688224,0.0017403414,0.0013336528,0.00094821193],"domain_scores_gemma":[0.9975733,0.00054409256,0.00042789485,0.0008998186,0.00030198233,0.00025289573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022828935,0.0005983039,0.0006113524,0.0011385683,0.00032043588,0.0007073275,0.0034619782,0.00039584655,0.00003653816],"category_scores_gemma":[0.00016498545,0.00054416887,0.0003013824,0.0007575488,0.00042503438,0.00040057854,0.00089447974,0.0011380836,0.000080184254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000391021,0.000028768613,0.000040860326,0.000024680376,0.000015684569,0.00016340907,0.00053579325,0.33585188,0.00001364464,0.15015937,0.000021736212,0.51314026],"study_design_scores_gemma":[0.00018015427,0.00010397195,0.000025750185,0.0004703201,0.000010036976,0.00002606099,1.6227202e-7,0.99511117,0.00036737326,0.0019176746,0.0011738834,0.0006134248],"about_ca_topic_score_codex":0.000019201254,"about_ca_topic_score_gemma":0.00021719135,"teacher_disagreement_score":0.77141845,"about_ca_system_score_codex":0.00042525036,"about_ca_system_score_gemma":0.00060983264,"threshold_uncertainty_score":0.99970096},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008527477,0.00019870485,0.987857,0.00056390575,0.0011610482,0.00038849073,0.0000060080415,0.00006171505,0.0012356902],"genre_scores_gemma":[0.9588589,0.000012082811,0.04013805,0.00045969823,0.00035574767,0.00000132668,0.00000264261,0.000017392349,0.00015417638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967935,0.000050055274,0.0008573409,0.00085980893,0.0009593866,0.00047990013],"domain_scores_gemma":[0.9968675,0.0010193443,0.00077863765,0.0010635373,0.00017805788,0.00009291667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067493756,0.00043826632,0.0007027523,0.00062699453,0.00018277542,0.00017031036,0.0031441564,0.0002045578,0.000010509724],"category_scores_gemma":[0.00007351419,0.00031222255,0.0002500158,0.00053289975,0.00058578403,0.00024041279,0.0009241286,0.0005315898,0.000007679109],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017288263,0.000046769717,0.000007895073,0.000038323607,0.000014055986,0.000008238317,0.0009443116,0.01844434,0.00071481,0.057838343,0.000014924383,0.9219107],"study_design_scores_gemma":[0.00054804,0.00061751093,0.0009442026,0.0008214028,0.000017725457,0.000036504076,2.381499e-7,0.6260976,0.010532262,0.35970622,0.00013390096,0.00054435676],"about_ca_topic_score_codex":0.000031405914,"about_ca_topic_score_gemma":0.000020239708,"teacher_disagreement_score":0.9503314,"about_ca_system_score_codex":0.00013052147,"about_ca_system_score_gemma":0.0003554944,"threshold_uncertainty_score":0.999933},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012053741,0.00028757524,0.991499,0.00023014756,0.0014880258,0.00034869814,0.0000013505938,0.0001006269,0.0048392145],"genre_scores_gemma":[0.12318847,0.00006276933,0.87598175,0.0004548855,0.00019351608,0.000013749254,0.0000011114207,0.000019063265,0.00008469261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968589,0.0000814459,0.00056726765,0.0013306036,0.00059815496,0.0005636222],"domain_scores_gemma":[0.99806947,0.0003441341,0.00025000563,0.001102487,0.0001023509,0.00013158674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019376839,0.0003679194,0.00041977988,0.0005802131,0.00014472462,0.000539526,0.0017923199,0.00028459108,0.000017876817],"category_scores_gemma":[0.00024006073,0.00036036785,0.000053385225,0.00047128263,0.00049929647,0.0012174796,0.0013534268,0.00075420085,0.000030110206],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036088572,0.00001304483,0.00021460018,0.000049848768,0.0000030109043,0.000020566533,0.0008688169,0.004202259,0.00020082438,0.09501448,0.0000038194794,0.8994051],"study_design_scores_gemma":[0.0002047128,0.00008747043,0.0015932461,0.00037744042,0.0000027512222,0.00005097475,3.979714e-7,0.84278846,0.0024000858,0.150754,0.0011519045,0.00058854296],"about_ca_topic_score_codex":0.000086163884,"about_ca_topic_score_gemma":0.000052330128,"teacher_disagreement_score":0.8988166,"about_ca_system_score_codex":0.00025564493,"about_ca_system_score_gemma":0.000206753,"threshold_uncertainty_score":0.99988484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004545952,0.0019805217,0.99213576,0.0013936848,0.0015407035,0.00025988242,0.00000801809,0.000108729364,0.002118116],"genre_scores_gemma":[0.58159745,0.00022458253,0.41262755,0.0031147609,0.0013979969,0.00002002404,0.000027847098,0.000035486883,0.0009542885],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974439,0.00003240459,0.00038876984,0.0009793947,0.0006400121,0.0005154988],"domain_scores_gemma":[0.9983539,0.000358284,0.00017947587,0.00067836995,0.00019315793,0.00023680585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005936228,0.0003695834,0.00035222294,0.00064413936,0.0003296323,0.00046876798,0.001064906,0.00021541657,0.00004880729],"category_scores_gemma":[0.000051317256,0.00035312236,0.00007679948,0.00047285805,0.0004816855,0.000797949,0.0008254144,0.00041488104,0.00006384733],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003918134,0.000040220457,0.00012082836,0.00003179057,0.0000137773495,0.000026073616,0.0006708483,0.008651863,0.00028155601,0.059460793,0.00011022607,0.9305881],"study_design_scores_gemma":[0.00050382945,0.00023866491,0.0018779971,0.00025171143,0.000025818097,0.00030604412,3.7780043e-7,0.33618218,0.0026881986,0.635965,0.02069206,0.0012681063],"about_ca_topic_score_codex":0.00000863993,"about_ca_topic_score_gemma":0.000027023929,"teacher_disagreement_score":0.92932,"about_ca_system_score_codex":0.00010539715,"about_ca_system_score_gemma":0.000322088,"threshold_uncertainty_score":0.99989206},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034553164,0.00018437408,0.9902343,0.000023147106,0.0006636144,0.00036385894,0.000004612725,0.00053525885,0.0045355177],"genre_scores_gemma":[0.9520523,0.00002982518,0.04688255,0.00030815828,0.00031311857,0.0000134745405,0.0000057657517,0.000112463276,0.00028232913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766624,0.0000068896416,0.00035653694,0.00074967643,0.00064023095,0.00058041594],"domain_scores_gemma":[0.99888545,0.00011853966,0.0000934322,0.00067824346,0.00009075488,0.00013355818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003418779,0.0005336001,0.00046305233,0.000505553,0.00012012732,0.00024056796,0.0009283058,0.00035459767,0.000038843707],"category_scores_gemma":[0.00001152478,0.0004550436,0.00007418743,0.00025979793,0.00034614155,0.0001760668,0.00014639243,0.0007858409,0.000034113713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008314434,0.00001721018,0.00028410007,0.00017290133,0.000033333596,0.00004933293,0.0004206955,0.40134168,0.0015831349,0.0006097699,0.00004691146,0.59543264],"study_design_scores_gemma":[0.0005590643,0.0003289978,0.0001682839,0.0014220255,0.000037674818,0.00012504408,3.4202597e-7,0.9555058,0.029425899,0.0050311484,0.0057898904,0.001605848],"about_ca_topic_score_codex":0.000004556646,"about_ca_topic_score_gemma":0.00001857814,"teacher_disagreement_score":0.948597,"about_ca_system_score_codex":0.00022752628,"about_ca_system_score_gemma":0.00008538633,"threshold_uncertainty_score":0.99979013},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024617362,0.0014521402,0.9805274,0.0001681809,0.0037704203,0.0004477314,6.5767136e-7,0.00022593189,0.013382941],"genre_scores_gemma":[0.9529843,0.000041669635,0.04394632,0.0006337467,0.00073197356,0.000018111681,0.0000067522374,0.000038580813,0.0015985873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677974,0.00008601929,0.00043584415,0.0010600627,0.00093116995,0.0007071535],"domain_scores_gemma":[0.9976316,0.00042053947,0.00031288102,0.0012461215,0.00018669525,0.00020212684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015743112,0.0004351587,0.00041960468,0.00056197523,0.00024686588,0.0005486805,0.0028145197,0.00032027654,0.000035107907],"category_scores_gemma":[0.00005921725,0.00036494096,0.0001311121,0.0004488423,0.00056862226,0.0008071149,0.0010037662,0.00057609356,0.00018680873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016838164,0.000020429088,0.00012040239,0.000022591794,0.0000070977476,0.00001655913,0.0007131292,0.0002741733,0.000014959679,0.57562906,0.000015451862,0.4231645],"study_design_scores_gemma":[0.0002282965,0.0001263598,0.00020038213,0.000040164727,0.0000096671765,0.00006346558,3.5001463e-7,0.021477379,0.0006945674,0.9693128,0.0072734775,0.00057311956],"about_ca_topic_score_codex":0.000025964675,"about_ca_topic_score_gemma":0.00001831661,"teacher_disagreement_score":0.95295966,"about_ca_system_score_codex":0.00020826532,"about_ca_system_score_gemma":0.0002678447,"threshold_uncertainty_score":0.99988025},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036372534,0.00161722,0.9889986,0.0007893725,0.0024833558,0.00015948681,0.0000012773162,0.0002627727,0.0056515634],"genre_scores_gemma":[0.09468872,0.000044910244,0.89869636,0.0039163237,0.0017542483,0.000007470579,0.0000026662335,0.00006704718,0.00082227815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655193,0.00001305502,0.00043023218,0.0011759377,0.0009293869,0.0008994612],"domain_scores_gemma":[0.9980572,0.0001985931,0.00024574922,0.0010956615,0.00015852982,0.00024429054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009167792,0.0005182123,0.00048156135,0.0007189238,0.0002646249,0.0006209603,0.0028018851,0.00028871957,0.00004028653],"category_scores_gemma":[0.00008011725,0.00049304945,0.00012374713,0.000607383,0.00030596973,0.0011531652,0.001379761,0.00090789853,0.00007444677],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011525376,0.000010129315,0.000038642494,0.000075692464,0.000008292956,0.00005422409,0.0008192639,0.025744908,0.0003089916,0.012351878,0.0000955549,0.9604913],"study_design_scores_gemma":[0.0003671151,0.000095068266,0.00023838447,0.0021406047,0.000020987593,0.00023927714,2.1525625e-7,0.9046829,0.0036897224,0.03624019,0.050295897,0.0019896668],"about_ca_topic_score_codex":0.000010931598,"about_ca_topic_score_gemma":0.000003717526,"teacher_disagreement_score":0.9585016,"about_ca_system_score_codex":0.00029870632,"about_ca_system_score_gemma":0.00043084714,"threshold_uncertainty_score":0.9997521},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002606246,0.00007550298,0.98083264,0.0005972258,0.0007794061,0.0002775838,0.0000023746568,0.00027159808,0.01690303],"genre_scores_gemma":[0.5389648,0.00018057905,0.45696276,0.0021471758,0.0009547639,0.000012540611,0.00002233786,0.000070127746,0.0006849279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961979,0.0000434193,0.00039195557,0.0015723463,0.0010432435,0.0007511831],"domain_scores_gemma":[0.99797386,0.00022756125,0.0003179936,0.0011079656,0.00018773934,0.00018487095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048244323,0.00056249765,0.00050775934,0.0006242605,0.00044020262,0.00081363786,0.002568723,0.00026610788,0.000072598355],"category_scores_gemma":[0.000020713454,0.00044119413,0.000101885336,0.0005985274,0.000440129,0.0006540671,0.00087278656,0.0011490149,0.0000667761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079149995,0.000024781832,0.0006908125,0.000027301487,0.00001099251,0.00022196892,0.0004267106,0.048417427,0.000026993668,0.003534496,0.000019843123,0.9465908],"study_design_scores_gemma":[0.00057406793,0.0010805744,0.0029212767,0.0005245521,0.000014948563,0.00055894564,0.000001010384,0.93949425,0.00012822333,0.035600852,0.017676331,0.0014249414],"about_ca_topic_score_codex":0.00006560192,"about_ca_topic_score_gemma":0.00020834559,"teacher_disagreement_score":0.9451658,"about_ca_system_score_codex":0.0002684736,"about_ca_system_score_gemma":0.00026192845,"threshold_uncertainty_score":0.99980396},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013399677,0.00024577577,0.99329287,0.0025639983,0.0010885111,0.0007316726,0.000008184389,0.00007580509,0.0018591913],"genre_scores_gemma":[0.16894193,0.000031960375,0.82666034,0.0030266722,0.00080763525,0.000039856808,0.000032412365,0.00004564918,0.00041351822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694103,0.0000666099,0.00045235237,0.00094308436,0.0009959869,0.00060095417],"domain_scores_gemma":[0.9979301,0.00051606953,0.00019541991,0.00090381375,0.00035454557,0.00010001902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024611528,0.00032067267,0.000315617,0.00053918874,0.00020786525,0.00089513353,0.0035071766,0.00017450146,0.0000058762207],"category_scores_gemma":[0.00012352371,0.00023367413,0.000092313676,0.0007343323,0.00036318848,0.00028741104,0.0007145486,0.00061552366,0.000007526458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035583905,0.000039502447,0.0000062832914,0.000030439785,0.000002742807,0.000013637678,0.0024076423,0.85899454,0.0000065753493,0.07939266,0.000066573986,0.05903584],"study_design_scores_gemma":[0.00029673424,0.000113738985,0.000014681071,0.00016002424,0.0000020993104,0.000012234387,0.0000048366287,0.87029845,0.0000083934465,0.12691927,0.0019128657,0.0002566669],"about_ca_topic_score_codex":0.000025721638,"about_ca_topic_score_gemma":0.00023383234,"teacher_disagreement_score":0.16880794,"about_ca_system_score_codex":0.00019886397,"about_ca_system_score_gemma":0.0009349402,"threshold_uncertainty_score":0.9528954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000088021325,0.00020239971,0.9896915,0.00013099183,0.0011158506,0.0009009343,0.000009122096,0.00011741654,0.0078229755],"genre_scores_gemma":[0.0012270464,0.000019990337,0.9977455,0.00017016029,0.00027635696,0.000035542464,0.0000016082176,0.000023700379,0.0005000969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969872,0.00008451683,0.00074780214,0.00089593965,0.0007821918,0.0005023291],"domain_scores_gemma":[0.9946315,0.0024197695,0.00077232637,0.0015345353,0.0005649748,0.00007689463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035615591,0.00036716464,0.0005373602,0.0004133176,0.00025511323,0.0003036034,0.003977226,0.00024284347,0.000003834755],"category_scores_gemma":[0.0004117164,0.00026951986,0.00011325866,0.00071755575,0.00056195067,0.000515235,0.0006734263,0.00043476713,0.000017726703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005951062,0.000014444343,0.000007226615,0.00015615282,0.0000130766175,0.000003371143,0.00079306314,0.056327205,0.0010379154,0.15545928,0.000034178753,0.78614813],"study_design_scores_gemma":[0.00013168102,0.00018575342,0.000034021836,0.00032339973,0.0000088072675,0.000060029848,1.3738457e-7,0.97359025,0.0014594035,0.022363614,0.0015466021,0.00029629708],"about_ca_topic_score_codex":0.00003991951,"about_ca_topic_score_gemma":0.0000017011537,"teacher_disagreement_score":0.91726303,"about_ca_system_score_codex":0.00017294336,"about_ca_system_score_gemma":0.00027637347,"threshold_uncertainty_score":0.9999757},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014486442,0.00023419264,0.99433464,0.00092410436,0.00046636866,0.00037816336,0.000004223625,0.00032431135,0.0033325779],"genre_scores_gemma":[0.0024228909,0.00001222584,0.9948307,0.0023459357,0.00027513423,0.0000046079545,0.0000016721552,0.00004358938,0.00006321408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959888,0.000041767144,0.0006270993,0.0013564937,0.0013153764,0.00067047164],"domain_scores_gemma":[0.9952044,0.0018029396,0.00052547187,0.0019315225,0.00038519283,0.00015048462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002057456,0.00056197436,0.00052190054,0.00085496745,0.0002933293,0.00049038813,0.0050000246,0.00026196375,0.000022288039],"category_scores_gemma":[0.00035051352,0.0004077157,0.00017093016,0.0009801816,0.0009816646,0.00057030155,0.001111329,0.0011009712,0.000009791495],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005052071,0.000014399797,0.0000019253876,0.000022245524,0.0000035184542,0.000023846746,0.00024812433,0.003639312,0.0005850523,0.015283961,0.000014268622,0.98015827],"study_design_scores_gemma":[0.00010449239,0.00009011651,0.000005802124,0.00074326916,0.000004401197,0.0000146214825,1.4653477e-7,0.6361079,0.016079022,0.34615102,0.00034352596,0.00035565582],"about_ca_topic_score_codex":0.000019617848,"about_ca_topic_score_gemma":0.0000051180996,"teacher_disagreement_score":0.9798026,"about_ca_system_score_codex":0.00023569731,"about_ca_system_score_gemma":0.0007798309,"threshold_uncertainty_score":0.99983746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018829809,0.00028706342,0.9949183,0.0001573773,0.0027233504,0.0010832016,0.000018431536,0.00015130658,0.0004726899],"genre_scores_gemma":[0.3520653,0.000011618302,0.64658755,0.00038776707,0.0007522926,0.00002996476,0.000028094884,0.000033171626,0.00010427447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643195,0.000042916217,0.0006534923,0.0014460492,0.0009200294,0.00050557184],"domain_scores_gemma":[0.99718904,0.0005870715,0.0004975985,0.0010792532,0.00053376786,0.000113237016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009867017,0.00046266156,0.00046151987,0.000799197,0.0003505291,0.0007272526,0.0017889059,0.00031245637,0.0000091575075],"category_scores_gemma":[0.00008300015,0.00042616966,0.000114183924,0.00062507764,0.00012746784,0.0010348372,0.00029697118,0.0002857345,0.000016418935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011892293,0.000041738433,0.000051526094,0.00003787986,0.000007521086,0.000012906513,0.0007581226,0.2994004,0.00023524475,0.010094391,0.0001626385,0.68918574],"study_design_scores_gemma":[0.00038114272,0.00023891359,0.0005253179,0.00041908206,0.000007682548,0.000010493496,2.5924246e-7,0.9588111,0.000690537,0.03623578,0.002165754,0.0005139216],"about_ca_topic_score_codex":0.000018089298,"about_ca_topic_score_gemma":0.00014664742,"teacher_disagreement_score":0.6886718,"about_ca_system_score_codex":0.00046854423,"about_ca_system_score_gemma":0.0003756217,"threshold_uncertainty_score":0.99981904},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081501843,0.0028257275,0.9694294,0.015291691,0.0016931571,0.007280601,0.00008622049,0.000075892895,0.0025023213],"genre_scores_gemma":[0.7233358,0.00076299446,0.23910505,0.031711727,0.002703887,0.0016378145,0.0002582632,0.0001475459,0.0003369308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99529165,0.00039785478,0.0014091345,0.0005932785,0.000951052,0.0013570096],"domain_scores_gemma":[0.99537337,0.0027573032,0.00080055493,0.00028037222,0.0005897408,0.00019865025],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0097910315,0.00034959047,0.0006896423,0.0012647572,0.0014409905,0.00026642904,0.00084112026,0.00036620247,0.00000797751],"category_scores_gemma":[0.00048183065,0.00031855458,0.000029056506,0.00039431528,0.00021861838,0.0006895978,0.0006864055,0.0013637217,0.000012547014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00025268306,0.000019426863,0.003887139,0.01357484,0.00004066704,0.0000041671096,0.04327022,0.0059490833,0.000019848289,0.52155507,0.00039491037,0.41103193],"study_design_scores_gemma":[0.0051610973,0.0011234178,0.029540243,0.054125626,0.0000143842835,0.00022305457,0.00015441225,0.10504184,0.00005848822,0.30073076,0.5003647,0.003461936],"about_ca_topic_score_codex":0.001595429,"about_ca_topic_score_gemma":0.0072859763,"teacher_disagreement_score":0.7303243,"about_ca_system_score_codex":0.0050675753,"about_ca_system_score_gemma":0.013129029,"threshold_uncertainty_score":0.9999266},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15852983,0.0016143416,0.83821654,0.00016796807,0.00018520461,0.00069688685,0.00014425666,0.000015585012,0.0004293553],"genre_scores_gemma":[0.9612281,0.000027122378,0.037927657,0.00023175294,0.00042680057,0.0000039235383,0.000056540677,0.000023262062,0.00007488918],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982636,0.000075029435,0.00030780167,0.0007474527,0.0003042475,0.00030188693],"domain_scores_gemma":[0.9989094,0.00007515903,0.00024651064,0.0005468523,0.00015717618,0.000064863205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005997409,0.00030093009,0.0003033355,0.00011085619,0.0001699071,0.00006195725,0.00042541,0.00040756422,0.0000058353367],"category_scores_gemma":[0.00008804508,0.00022622547,0.0000552884,0.00010126554,0.0015037347,0.000011075783,0.00075501227,0.0006708962,1.9699465e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004207024,0.000008474272,0.00016943125,0.00007292296,0.000020881065,0.000013589754,0.00009847921,0.002236858,0.51545787,0.0008855801,0.000006976371,0.48098683],"study_design_scores_gemma":[0.00081827125,0.0009674758,0.0017506051,0.00020695769,0.00003412389,0.0004424651,0.0000026784119,0.0795917,0.8777467,0.036431536,0.0008641407,0.0011433347],"about_ca_topic_score_codex":0.00007252383,"about_ca_topic_score_gemma":0.00029499768,"teacher_disagreement_score":0.8026982,"about_ca_system_score_codex":0.000037892776,"about_ca_system_score_gemma":0.00036261237,"threshold_uncertainty_score":0.9225207},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004009421,0.00011620162,0.99586284,0.00007278173,0.001038129,0.00065769546,0.0000036897843,0.00046596248,0.0017426269],"genre_scores_gemma":[0.13566004,0.00000833416,0.86281544,0.00097559136,0.00024919887,0.000014367623,0.00003824065,0.000028959314,0.00020981533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954295,0.000059116886,0.00069877465,0.0014613988,0.0016707581,0.0006804405],"domain_scores_gemma":[0.9975288,0.00020728911,0.00045968543,0.0011248266,0.0004525424,0.00022686369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022886754,0.00051812653,0.000446015,0.0011446993,0.0003636165,0.0005030409,0.0018045362,0.00047379936,0.000014216873],"category_scores_gemma":[0.00017415496,0.00049521396,0.00013320394,0.00090507895,0.0005643472,0.0014395122,0.00072090287,0.0009225921,0.00004566604],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000137362595,0.000045697077,0.00004634205,0.0000680651,0.000011479598,0.000019049634,0.00048064327,0.021323202,0.00048753325,0.00353385,0.000057334637,0.9739131],"study_design_scores_gemma":[0.00024234985,0.0001884747,0.0007472123,0.00016789377,0.000014305858,0.00015157247,3.667366e-7,0.9090174,0.0072662923,0.08162992,0.00004419444,0.00053005444],"about_ca_topic_score_codex":0.00008744777,"about_ca_topic_score_gemma":0.000052733696,"teacher_disagreement_score":0.973383,"about_ca_system_score_codex":0.0009988436,"about_ca_system_score_gemma":0.0005335504,"threshold_uncertainty_score":0.99974996},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045888094,0.00016016509,0.995796,0.000068316986,0.0009328386,0.00038533524,0.0000110266665,0.0001681002,0.0020192838],"genre_scores_gemma":[0.23111974,0.00019265045,0.76459706,0.00058354216,0.0027120374,0.000025125402,0.00012564435,0.00025649564,0.00038767653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982641,0.000009088456,0.00035508236,0.00047203217,0.00037663017,0.00052307686],"domain_scores_gemma":[0.99910015,0.0002451952,0.00008920638,0.00033172764,0.00011763763,0.0001160903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040251247,0.00034795716,0.00033318193,0.00027677996,0.00011598554,0.00016673277,0.00037625578,0.00014049448,0.000031718242],"category_scores_gemma":[0.00003708085,0.00034607496,0.00009148296,0.00012338668,0.00013709145,0.00017632075,0.000117574375,0.00022361164,0.000042443397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055271657,0.0000173799,0.0000112510725,0.00018943101,0.00002069054,0.000016037297,0.0002309526,0.8247446,0.009512427,0.001025636,0.00013965167,0.16408642],"study_design_scores_gemma":[0.0001744671,0.0000592083,0.0000113660635,0.00020774845,0.000018440764,0.000014887934,1.1170933e-7,0.9838246,0.010439453,0.0035582543,0.0012627293,0.0004287121],"about_ca_topic_score_codex":0.000009313868,"about_ca_topic_score_gemma":0.000005284759,"teacher_disagreement_score":0.23119897,"about_ca_system_score_codex":0.00025487714,"about_ca_system_score_gemma":0.00006556495,"threshold_uncertainty_score":0.99989915},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054843134,0.000592947,0.99444747,0.0017424192,0.00086791953,0.00020039927,0.000004302878,0.0001336224,0.0019560796],"genre_scores_gemma":[0.17640969,0.00028898663,0.80702585,0.010431491,0.0030423068,0.000006295373,0.00015062922,0.000051960986,0.0025927576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965061,0.00003912338,0.0005691651,0.00141951,0.0010104321,0.00045570164],"domain_scores_gemma":[0.9978549,0.00012371122,0.0002907294,0.0012868182,0.00030354058,0.00014033733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006191001,0.0004438217,0.00048167544,0.0009236473,0.00027453792,0.00079179095,0.002344057,0.00031969312,0.00002358294],"category_scores_gemma":[0.000090974594,0.00038818948,0.00016680703,0.0007467465,0.00022083,0.0007345935,0.00052466436,0.00054695207,0.000031379546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.8301e-7,0.000036284433,0.000017399809,0.000005493832,0.000007919301,0.00002866015,0.00013694275,0.060866784,0.00042406574,0.017081857,0.00010149941,0.9212921],"study_design_scores_gemma":[0.00013579044,0.0001137976,0.00023852159,0.00010085448,0.000012086476,0.000020527657,3.104957e-8,0.9082624,0.0008528476,0.08594938,0.0038161157,0.0004976973],"about_ca_topic_score_codex":0.000020514046,"about_ca_topic_score_gemma":0.0003419131,"teacher_disagreement_score":0.9207944,"about_ca_system_score_codex":0.000222194,"about_ca_system_score_gemma":0.0003715764,"threshold_uncertainty_score":0.999857},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043789097,0.000025854608,0.9900129,0.002522686,0.00080979103,0.0016362149,0.000014372673,0.00017839717,0.00042090082],"genre_scores_gemma":[0.8898768,0.000023020346,0.10593243,0.003349997,0.00044035335,0.00004397193,0.00007847394,0.00003131973,0.00022362989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954772,0.00008529648,0.000922371,0.0007602194,0.00204941,0.00070552476],"domain_scores_gemma":[0.99748486,0.00022538636,0.00056906574,0.0011725432,0.00034356612,0.00020459227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018502192,0.000554324,0.0007126162,0.0024180198,0.00023015628,0.0009685663,0.0028812967,0.00024254387,0.000018498979],"category_scores_gemma":[0.000089387286,0.0004392346,0.0000999446,0.0011412799,0.00043033404,0.0016357758,0.0015289063,0.0010053479,0.000022135415],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007057209,0.00020652915,0.003202654,0.00015885518,0.00001856604,0.00014057533,0.0062094647,0.00024946974,0.00014647256,0.0102236485,0.00009623231,0.97927696],"study_design_scores_gemma":[0.015080679,0.014091403,0.07815092,0.005722578,0.00009913016,0.00049290794,0.00014584052,0.6215609,0.011793198,0.17989819,0.06378139,0.009182917],"about_ca_topic_score_codex":0.00003289373,"about_ca_topic_score_gemma":0.00013117745,"teacher_disagreement_score":0.970094,"about_ca_system_score_codex":0.00066870963,"about_ca_system_score_gemma":0.00023292028,"threshold_uncertainty_score":0.9998059},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034116209,0.00011960724,0.99111193,0.00047652933,0.0023804766,0.0005200864,0.000004350745,0.00016197308,0.001813412],"genre_scores_gemma":[0.86932236,0.000010512668,0.12940866,0.00025573286,0.00019524265,0.000007892081,0.000012880875,0.000028273049,0.0007584687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553555,0.000074978314,0.0009632946,0.001370419,0.001441422,0.0006143049],"domain_scores_gemma":[0.99727356,0.00025805982,0.0007379934,0.00095119834,0.00055270776,0.00022645536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005822262,0.0005157805,0.00067748944,0.0009296809,0.00030785223,0.00041909495,0.001995303,0.00031143863,0.00015224027],"category_scores_gemma":[0.00007368238,0.00049348647,0.00018729627,0.0010491465,0.0008159286,0.0010791961,0.0007537265,0.00063947315,0.00022840098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000150287915,0.00044972938,0.0027408055,0.000111079404,0.000031474246,0.000020330499,0.0039639226,0.016229596,0.0023064325,0.03448574,0.00012792245,0.9395179],"study_design_scores_gemma":[0.00040447208,0.0005878292,0.0016714003,0.00027519002,0.000015313888,0.000026709233,0.0000026990183,0.95136243,0.007983441,0.036119726,0.0007541927,0.00079660304],"about_ca_topic_score_codex":0.00014922273,"about_ca_topic_score_gemma":0.00018499,"teacher_disagreement_score":0.93872136,"about_ca_system_score_codex":0.00027033585,"about_ca_system_score_gemma":0.0003640462,"threshold_uncertainty_score":0.9997517},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011210711,0.00006109134,0.99518657,0.0011163169,0.0008225219,0.001045303,0.0000050336866,0.00008253003,0.0015685032],"genre_scores_gemma":[0.6519424,0.000041493844,0.33879316,0.0068615517,0.0016781115,0.00008356712,0.00005932067,0.000093724855,0.00044672715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977302,0.0000047746594,0.00033529487,0.0009250552,0.0006059708,0.00039869497],"domain_scores_gemma":[0.99864346,0.0002703687,0.0002232672,0.00037143828,0.00046857356,0.00002291098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007736314,0.00039203942,0.00034515522,0.0009987328,0.00032077436,0.00044761592,0.0007431062,0.00022482389,0.000032801418],"category_scores_gemma":[0.00027383532,0.00033309005,0.00007762268,0.00074969715,0.00039021924,0.00047400515,0.00021903268,0.00028525083,0.000035975914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013072106,0.000031851127,0.000016012644,0.000048134665,0.000008325091,0.000008157588,0.00021264266,0.48110253,0.000014622618,0.43348932,0.0001675782,0.0847701],"study_design_scores_gemma":[0.00033135,0.000023978193,0.000013464187,0.00024013886,0.000010530967,6.750257e-7,1.5227802e-7,0.47940338,0.00006611399,0.5193956,0.00024548447,0.0002691841],"about_ca_topic_score_codex":0.0000023046903,"about_ca_topic_score_gemma":0.00002307836,"teacher_disagreement_score":0.65639347,"about_ca_system_score_codex":0.00018217562,"about_ca_system_score_gemma":0.00047246873,"threshold_uncertainty_score":0.99991214},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015340107,0.00068298867,0.9950991,0.00023515546,0.0012746848,0.0003356494,0.0000025947102,0.0003902082,0.0004455795],"genre_scores_gemma":[0.25978923,0.00008201822,0.73936754,0.0004624594,0.00018047738,0.0000018019697,0.000005060172,0.000035196234,0.00007623176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631196,0.000047093938,0.000585291,0.0015260351,0.00083006575,0.00069955544],"domain_scores_gemma":[0.99792916,0.0003073323,0.00033758188,0.0010259445,0.00017012411,0.00022985933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010408094,0.00056234753,0.0005406879,0.0011618759,0.00040385342,0.00056055357,0.0018255679,0.0003725738,0.0000053799363],"category_scores_gemma":[0.000060052396,0.0005344814,0.0001083227,0.0005554778,0.0005869491,0.0005052891,0.0014729259,0.00070268655,0.0000059641875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001678527,0.00006225551,0.00024705977,0.000061968014,0.000021083999,0.00013047562,0.001140941,0.14233081,0.00095444283,0.0022994184,0.00008437492,0.8526504],"study_design_scores_gemma":[0.00022591405,0.0001465606,0.0002142374,0.00039574364,0.0000058160085,0.00006860618,1.4830525e-7,0.9875426,0.0011358731,0.009121778,0.0004663112,0.0006763804],"about_ca_topic_score_codex":0.00004289706,"about_ca_topic_score_gemma":0.000029499142,"teacher_disagreement_score":0.851974,"about_ca_system_score_codex":0.0004174816,"about_ca_system_score_gemma":0.000324736,"threshold_uncertainty_score":0.9997107},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009447547,0.00009803878,0.99547106,0.00048501152,0.001209848,0.0006746104,0.000004262361,0.00014257203,0.0018200991],"genre_scores_gemma":[0.122019075,0.0000330426,0.8759417,0.0015035416,0.00015972942,0.000017357135,0.00001195111,0.00003277338,0.00028081922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645644,0.000036286783,0.0006946699,0.0013605196,0.00078005466,0.0006720419],"domain_scores_gemma":[0.99815154,0.00025408642,0.00024893397,0.00094804546,0.00022521942,0.00017214639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011107373,0.0004408088,0.00040193484,0.0013906051,0.00014717694,0.0003534723,0.0015812272,0.00026531678,0.000107719585],"category_scores_gemma":[0.00013879425,0.00042815268,0.0000960744,0.00092032953,0.00042370407,0.00047549774,0.0007958342,0.00072117895,0.000050455827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006282248,0.000067806795,0.00065448903,0.000038833357,0.000008407655,0.000111825124,0.00071141816,0.09831145,0.000040461815,0.030734198,0.00000840148,0.86930645],"study_design_scores_gemma":[0.00067224505,0.00007902477,0.002320808,0.00027294585,0.0000045638044,0.00005388245,3.493356e-7,0.9778574,0.00013145663,0.017075691,0.00092892256,0.0006026852],"about_ca_topic_score_codex":0.000045310186,"about_ca_topic_score_gemma":0.0013948132,"teacher_disagreement_score":0.879546,"about_ca_system_score_codex":0.00062130834,"about_ca_system_score_gemma":0.0005972299,"threshold_uncertainty_score":0.999817},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021691949,0.0002992677,0.99502826,0.0008918371,0.001652702,0.000527878,0.0000060190296,0.00018284489,0.0013894807],"genre_scores_gemma":[0.022240724,0.000022789716,0.9731585,0.0019131087,0.00085562334,0.000015008771,0.000010095593,0.000045423294,0.0017387195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618644,0.000043966244,0.0005637007,0.001727722,0.000689538,0.0007886443],"domain_scores_gemma":[0.9973358,0.00061507727,0.00031205255,0.0012152322,0.0003099396,0.00021192203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001322368,0.0005763402,0.00069895067,0.00056071725,0.0002937837,0.00043150468,0.0029630968,0.00033046887,0.00000550527],"category_scores_gemma":[0.00009108961,0.0005065068,0.00023760805,0.00031507303,0.00030013893,0.00040605993,0.0010627394,0.00096165854,0.0000066134558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029316147,0.000023402426,0.0000023117202,0.000029995159,0.000007498583,0.000005684726,0.00028317675,0.12127965,0.00014102332,0.22029597,0.0000070975666,0.65792125],"study_design_scores_gemma":[0.0003495928,0.00012504988,0.0000059445315,0.0001599943,0.000007267755,0.000024192956,2.1956103e-8,0.63852257,0.00022285772,0.3586637,0.0015231132,0.00039568983],"about_ca_topic_score_codex":0.000018016519,"about_ca_topic_score_gemma":0.000034975343,"teacher_disagreement_score":0.6575256,"about_ca_system_score_codex":0.00018379615,"about_ca_system_score_gemma":0.0003048057,"threshold_uncertainty_score":0.99973863},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011635473,0.00028838043,0.9954822,0.0009286505,0.0013118285,0.0009587214,0.000049328155,0.00013969331,0.00082952913],"genre_scores_gemma":[0.0011514847,0.000034777244,0.99637526,0.0017047238,0.00020318321,0.000041618277,0.00001758053,0.000040025032,0.0004313326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953411,0.00003336095,0.00042986125,0.0020329147,0.0012824853,0.00088023714],"domain_scores_gemma":[0.9968325,0.00040312248,0.00031976955,0.0018006054,0.00032780698,0.00031618107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074081455,0.00064813485,0.00054949,0.0005900034,0.0005117307,0.00051377394,0.0030173108,0.000268547,0.000013761753],"category_scores_gemma":[0.000036772668,0.0005044122,0.00013300382,0.0006220659,0.0006603038,0.00044292878,0.0012386239,0.000546163,0.000022298365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009561794,0.000085739026,0.000005016993,0.000040277504,0.000022248681,0.00013644887,0.00048511842,0.0648747,0.00013725615,0.02563481,0.0003716069,0.9081972],"study_design_scores_gemma":[0.0005792836,0.0003957233,0.0000040862033,0.00051311404,0.000013754004,0.00012298,4.0609e-7,0.9578329,0.0016400884,0.023737513,0.014387323,0.00077285635],"about_ca_topic_score_codex":0.000025395857,"about_ca_topic_score_gemma":0.000013905468,"teacher_disagreement_score":0.90742433,"about_ca_system_score_codex":0.0005340002,"about_ca_system_score_gemma":0.00074694655,"threshold_uncertainty_score":0.9997407},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003308362,0.00015563752,0.9900175,0.0012359079,0.0015762309,0.0003739849,0.0000045122883,0.00022741343,0.006405559],"genre_scores_gemma":[0.004237241,0.000027386892,0.9929421,0.0011472612,0.00043823253,0.0000035095836,0.000007471704,0.00002917075,0.0011676559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708366,0.000017914366,0.00043989485,0.0012897734,0.0006646943,0.00050407165],"domain_scores_gemma":[0.9979874,0.00038841963,0.00028490523,0.0008183585,0.00039930723,0.000121607554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000500331,0.00038413334,0.00034385445,0.0005672256,0.00037358704,0.00059510424,0.0011430888,0.00017257819,0.000017928827],"category_scores_gemma":[0.00016693612,0.0003753716,0.0001330132,0.000430044,0.00038007367,0.0009884876,0.00037482352,0.0004518839,0.000027914637],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044951444,0.000012922307,0.0000020666896,0.000021557766,0.0000049412706,0.000026227297,0.0001622963,0.0030344578,0.0013305629,0.008707101,0.0001672575,0.98652613],"study_design_scores_gemma":[0.00023326676,0.00007443256,0.000014640642,0.00019997549,0.000003590331,0.0000903883,6.334276e-8,0.8719202,0.0018427252,0.119674996,0.005545994,0.00039968736],"about_ca_topic_score_codex":0.0000060162924,"about_ca_topic_score_gemma":0.0000102022195,"teacher_disagreement_score":0.9861264,"about_ca_system_score_codex":0.00027553743,"about_ca_system_score_gemma":0.00020957585,"threshold_uncertainty_score":0.9998698},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0396088,0.00056333304,0.9582423,0.00007069703,0.00022305321,0.00021314665,0.00005303223,0.0000051336756,0.0010205267],"genre_scores_gemma":[0.96854126,0.00007736309,0.029728463,0.000259425,0.00059056364,0.0000080301315,0.00046761855,0.000024757965,0.00030251898],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988955,0.000008376179,0.00013966308,0.0005680808,0.00018599535,0.00020234402],"domain_scores_gemma":[0.99943304,0.000008768456,0.000084058185,0.00032642588,0.00010450193,0.000043191947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011365188,0.0002084362,0.00013969588,0.000049320468,0.00011256944,0.00005727655,0.0002656366,0.00014269455,0.0000031417826],"category_scores_gemma":[0.0000054559373,0.00017458094,0.000033013108,0.00005762692,0.00029537754,0.000001797244,0.00013073234,0.00010898771,0.0000020291075],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018858568,0.00013690228,0.005627871,0.00007670253,0.00010585375,0.000029479654,0.00034597167,0.16178103,0.19026309,0.0012162945,0.0005108995,0.6397173],"study_design_scores_gemma":[0.0058391937,0.016337717,0.055307295,0.0008712124,0.000334546,0.00045218543,0.000007642606,0.06437495,0.6425502,0.10569495,0.09953881,0.008691323],"about_ca_topic_score_codex":0.000018836807,"about_ca_topic_score_gemma":0.00018903529,"teacher_disagreement_score":0.9289325,"about_ca_system_score_codex":0.00004539933,"about_ca_system_score_gemma":0.00011129537,"threshold_uncertainty_score":0.7119204},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007118315,0.00027923318,0.9908833,0.00031571573,0.00053593505,0.0005524296,0.000001619346,0.0002674401,0.007093149],"genre_scores_gemma":[0.014661026,0.00007997779,0.9802807,0.0031964718,0.0008300647,0.000019122599,0.000012216487,0.000053334308,0.0008671089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959129,0.000060977563,0.00042771472,0.0015692736,0.0011658195,0.00086330913],"domain_scores_gemma":[0.99753654,0.00014136522,0.000230906,0.001535012,0.00022841024,0.00032774522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009100437,0.00048441542,0.00043152532,0.00047112425,0.0003905953,0.0008092789,0.0032634232,0.00025603696,0.00007464618],"category_scores_gemma":[0.000013298201,0.00041286636,0.000076756485,0.0007739584,0.0005333567,0.0012821308,0.0009051382,0.0008714247,0.000042556065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047124904,0.000023959079,0.000031366788,0.000010598998,0.0000070338538,0.000064288804,0.00046439772,0.6888167,0.000003763393,0.011724946,0.000040719984,0.2988075],"study_design_scores_gemma":[0.00027701218,0.00047157478,0.00005563147,0.0003262201,0.0000047206345,0.00007271194,1.9716751e-7,0.95506245,0.00007309283,0.03558285,0.0074518872,0.0006216537],"about_ca_topic_score_codex":0.000008044467,"about_ca_topic_score_gemma":0.000058638816,"teacher_disagreement_score":0.29818586,"about_ca_system_score_codex":0.00018978001,"about_ca_system_score_gemma":0.0005422833,"threshold_uncertainty_score":0.99983233},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010910035,0.0007418847,0.9777592,0.0001926144,0.0020091296,0.00057306845,0.00000837664,0.00014280278,0.007662911],"genre_scores_gemma":[0.6147486,0.00017219066,0.3830503,0.0012965418,0.00028712285,0.000009012427,0.0000047100352,0.00004058246,0.00039098752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99471,0.000058094018,0.0008476204,0.0015761079,0.0018360715,0.0009720957],"domain_scores_gemma":[0.99740195,0.00035634727,0.00039193628,0.0013171897,0.00028611007,0.000246467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013335822,0.000678112,0.00065687596,0.00078071014,0.00034926698,0.0007110811,0.0031053268,0.00039127117,0.000033887976],"category_scores_gemma":[0.00031859247,0.0005554575,0.00021507948,0.0014620967,0.00068653916,0.0023004208,0.0020575142,0.0011171199,0.000055833127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105245315,0.00037606375,0.008208535,0.00036833793,0.00011812142,0.00052828767,0.010606028,0.13265072,0.0035983135,0.039751656,0.00022196765,0.80346674],"study_design_scores_gemma":[0.00097602437,0.00043181,0.0065586283,0.0017804161,0.000031127667,0.00025293714,0.0000070367814,0.93586016,0.0038649796,0.04508135,0.0026728255,0.0024827349],"about_ca_topic_score_codex":0.00016688777,"about_ca_topic_score_gemma":0.00020488254,"teacher_disagreement_score":0.8032094,"about_ca_system_score_codex":0.0015482049,"about_ca_system_score_gemma":0.0004325078,"threshold_uncertainty_score":0.9996897},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042917796,0.0005549988,0.99432325,0.00045335473,0.0020215053,0.00043809338,0.0000051951524,0.00027845375,0.0018822041],"genre_scores_gemma":[0.36986065,0.0003509981,0.6270351,0.001780955,0.00061469234,0.000030682568,0.000008850269,0.000059134265,0.00025898064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99423164,0.00008875046,0.00095215876,0.0023362099,0.0011813395,0.0012098927],"domain_scores_gemma":[0.9969235,0.00039902996,0.0003391174,0.001647789,0.0003573951,0.00033318874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008749319,0.0008783421,0.00086722797,0.0013612295,0.00032110294,0.0006654652,0.0038121701,0.0007426857,0.000024016608],"category_scores_gemma":[0.00010047925,0.0008480807,0.00018979219,0.0013407273,0.000749444,0.0009986332,0.0014823397,0.0020184326,0.000041999392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052977907,0.000042762313,0.00007382606,0.000014407721,0.000008104564,0.00021479678,0.0011722858,0.12973295,0.000012216364,0.0016331635,0.000016876107,0.8670733],"study_design_scores_gemma":[0.0003976417,0.00016622637,0.00029411103,0.00048473643,0.0000043112827,0.00015584342,2.373697e-7,0.95298016,0.00011661311,0.04421016,0.00027296646,0.00091701816],"about_ca_topic_score_codex":0.0002061478,"about_ca_topic_score_gemma":0.00033532555,"teacher_disagreement_score":0.8661563,"about_ca_system_score_codex":0.00049682683,"about_ca_system_score_gemma":0.0011008038,"threshold_uncertainty_score":0.999397},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005916821,0.0053716227,0.9868872,0.000024470892,0.0012263699,0.00055988564,0.000039938204,0.00007927948,0.005752073],"genre_scores_gemma":[0.80131257,0.000024639547,0.19780193,0.00003680593,0.00070807926,0.0000074994964,0.0000026875925,0.000061792816,0.00004401811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739915,0.00003543371,0.0008117683,0.0005118128,0.0006864432,0.0005553661],"domain_scores_gemma":[0.99780273,0.0006260399,0.00038923183,0.0007047559,0.00033723222,0.00014001585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006201672,0.0005180921,0.0011116371,0.0005350469,0.000042993364,0.000028737997,0.0010153357,0.00028572427,0.000017758666],"category_scores_gemma":[0.00006142496,0.0004844276,0.00020719806,0.00022830747,0.00068059243,0.00024025753,0.00019788905,0.00060173334,0.000018118571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026676093,0.000014816992,0.00011385287,0.00010013991,0.00009270179,0.000011428641,0.00029805678,0.91751,0.001980654,0.0037309506,0.0000048856477,0.07611583],"study_design_scores_gemma":[0.0014780151,0.00019825432,0.00036203195,0.0010824461,0.00006231832,0.000027419206,7.4690763e-7,0.99057674,0.00037381722,0.005012119,0.00020595576,0.00062015286],"about_ca_topic_score_codex":0.000052305342,"about_ca_topic_score_gemma":0.00014898778,"teacher_disagreement_score":0.8012534,"about_ca_system_score_codex":0.0002114622,"about_ca_system_score_gemma":0.00015636689,"threshold_uncertainty_score":0.99976075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000914453,0.0000904108,0.9874941,0.00029629245,0.0004887313,0.0053658797,0.000005615515,0.0035782056,0.0026716369],"genre_scores_gemma":[0.041977257,0.0000017126946,0.95587045,0.0005936742,0.00039088042,0.0010618403,0.0000058008754,0.000041106832,0.00005729693],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996937,0.000036067515,0.00056076754,0.0012618853,0.0006152462,0.00058905844],"domain_scores_gemma":[0.9924018,0.003636628,0.00046234776,0.002506512,0.0008511237,0.00014160771],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018686034,0.00047154984,0.00047626512,0.00053824554,0.0005653404,0.00076255726,0.0047876486,0.0004293499,0.0000033105325],"category_scores_gemma":[0.0042464933,0.00045281617,0.000109005116,0.0005196741,0.00068019464,0.00028409724,0.0015075199,0.0012724415,0.000010500944],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000709391,0.000065629334,0.00040432796,0.00021774296,0.000007314756,0.0000187653,0.0017255278,0.00057124847,0.00020524228,0.023264209,0.00010985943,0.97340304],"study_design_scores_gemma":[0.0001396907,0.00019637708,0.00004686542,0.0010077974,0.0000044029844,0.00004556056,9.047202e-9,0.23844385,0.0009813533,0.7564603,0.0022174409,0.00045636916],"about_ca_topic_score_codex":0.00004656199,"about_ca_topic_score_gemma":0.000037837293,"teacher_disagreement_score":0.97294664,"about_ca_system_score_codex":0.00017758449,"about_ca_system_score_gemma":0.0006608161,"threshold_uncertainty_score":0.99979234},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045870227,0.0008326328,0.98627174,0.0068164794,0.0011430174,0.0018317103,0.00004097037,0.00010697193,0.0029105865],"genre_scores_gemma":[0.955097,0.0001539663,0.037052877,0.0026819732,0.0037809438,0.00013803285,0.0000044462013,0.00003668336,0.001054048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973575,0.00003270509,0.00036689517,0.0008507318,0.00062798144,0.00076419534],"domain_scores_gemma":[0.9963207,0.0024139162,0.00027035925,0.00053763064,0.000340078,0.0001172631],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015753888,0.00034320095,0.000486732,0.00023305282,0.0014942959,0.0010824624,0.0032385548,0.00031567903,0.000024242318],"category_scores_gemma":[0.00036699668,0.00023938427,0.0001979128,0.00016567264,0.001408038,0.0008813127,0.00022774492,0.00036593477,0.0000031473483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055206267,0.00001621523,0.00008454781,0.000025570796,0.000023733408,0.0000023028617,0.001911958,0.1679755,0.000008899352,0.055375237,0.000042401243,0.77447844],"study_design_scores_gemma":[0.000549517,0.000052373674,0.000055506975,0.000057304474,0.000040933784,0.0000011388192,0.0000032579326,0.84915066,0.000008829016,0.14217852,0.0075932695,0.00030869537],"about_ca_topic_score_codex":0.00016140497,"about_ca_topic_score_gemma":0.016390573,"teacher_disagreement_score":0.9550512,"about_ca_system_score_codex":0.0002180453,"about_ca_system_score_gemma":0.00089175353,"threshold_uncertainty_score":0.9999545},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028823677,0.000023549042,0.96860474,0.00078551506,0.0008780062,0.00061985006,0.000003964287,0.00002689357,0.028769214],"genre_scores_gemma":[0.97559196,0.00007848468,0.02143165,0.0009599203,0.00082922407,0.000016918842,0.000009509777,0.000016759448,0.0010655948],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968532,0.00032883027,0.00047089809,0.00040151252,0.0014557629,0.0004898073],"domain_scores_gemma":[0.99816525,0.0007989335,0.00020536562,0.00030157008,0.00045632734,0.00007256713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011243189,0.00014891975,0.00021904724,0.0008402012,0.00066026556,0.00039267758,0.00068927056,0.00023090027,0.00016738224],"category_scores_gemma":[0.00035939354,0.00014559021,0.000037988826,0.00069168815,0.0007451899,0.00049529993,0.00015248521,0.00044656364,0.00008336439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021530384,0.00001234165,0.00048401768,0.000052600277,0.000004125435,0.0000048477773,0.08373565,0.0039838604,0.000025960479,0.36722243,0.00048426306,0.5439684],"study_design_scores_gemma":[0.0007115215,0.00034659394,0.0005980333,0.0007228817,0.0000058224728,0.0000040995756,0.00012346778,0.052311383,0.0011871485,0.79202825,0.15106052,0.0009002897],"about_ca_topic_score_codex":0.0007288108,"about_ca_topic_score_gemma":0.0014464274,"teacher_disagreement_score":0.9753037,"about_ca_system_score_codex":0.0007025492,"about_ca_system_score_gemma":0.00077909126,"threshold_uncertainty_score":0.59369963},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008826662,0.0021606255,0.99452937,0.0008860944,0.0010126706,0.00027475526,0.000009040052,0.0004575623,0.00066105154],"genre_scores_gemma":[0.014875307,0.000086248896,0.98360544,0.00069274666,0.00055955973,0.0000079987185,0.000004523594,0.00003937027,0.0001288048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971928,0.00005863346,0.00031773694,0.0013567345,0.00049797364,0.00057612185],"domain_scores_gemma":[0.99695694,0.0012742672,0.00017336283,0.0012537359,0.0001962112,0.00014547662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008477464,0.0005654811,0.0005820028,0.00064509845,0.00028238713,0.00042009947,0.0019683465,0.00034414852,0.000003208497],"category_scores_gemma":[0.000233672,0.00049571926,0.00011266855,0.00054128305,0.0005962927,0.00077290327,0.0009430767,0.0008291711,0.0000032775688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010591071,0.000004213891,0.0000035035725,0.00002390225,0.000005382602,0.00001349935,0.00032137102,0.7274577,0.000027040101,0.018657373,0.000006869694,0.25347805],"study_design_scores_gemma":[0.00012284039,0.000041307387,0.00001838189,0.00023731866,0.0000046859013,0.000036745667,1.6194606e-7,0.7098958,0.0005687333,0.28727096,0.001304583,0.00049849047],"about_ca_topic_score_codex":0.000004508813,"about_ca_topic_score_gemma":0.000022358896,"teacher_disagreement_score":0.26861358,"about_ca_system_score_codex":0.00037684874,"about_ca_system_score_gemma":0.000423389,"threshold_uncertainty_score":0.9997494},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010576465,0.000811321,0.98767614,0.0002785598,0.0021723888,0.00030280088,0.000006661204,0.00010435979,0.007590105],"genre_scores_gemma":[0.853611,0.00006103327,0.14393985,0.0014316821,0.000654146,0.000011021069,0.0000015598936,0.00003732222,0.0002524057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967091,0.00009163357,0.00059277157,0.0010675306,0.0009429462,0.000595999],"domain_scores_gemma":[0.99711037,0.00036636268,0.0004977776,0.0017144636,0.00021809795,0.000092905764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013718522,0.00042761778,0.0004904467,0.00046331808,0.00046461762,0.00033233117,0.004946254,0.0002256869,0.00002142772],"category_scores_gemma":[0.000073142706,0.00030728042,0.00026147853,0.0012025376,0.00060346717,0.00042735777,0.0016715374,0.00066499884,0.000008428035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064282726,0.000044268352,0.00063393905,0.00008949,0.00002322666,0.000030397188,0.0013764229,0.014968137,0.00056840334,0.512058,0.00002307961,0.47017822],"study_design_scores_gemma":[0.00052829774,0.00022416624,0.00027706148,0.0017948777,0.000020967203,0.00012363338,0.0000014352308,0.4061997,0.0045026,0.57382447,0.011374901,0.0011278781],"about_ca_topic_score_codex":0.0000074583995,"about_ca_topic_score_gemma":0.00014601438,"teacher_disagreement_score":0.8525533,"about_ca_system_score_codex":0.00010452807,"about_ca_system_score_gemma":0.00033125488,"threshold_uncertainty_score":0.99993795},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006162844,0.0012493338,0.98541486,0.0004362594,0.001272482,0.0010905159,0.0000031025484,0.00025443858,0.010217392],"genre_scores_gemma":[0.1453544,0.0013796409,0.8402997,0.0072180396,0.0016032328,0.00034034997,0.000022602064,0.00016573921,0.003616254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942171,0.000052936197,0.00067248323,0.0024356511,0.0015597368,0.001062112],"domain_scores_gemma":[0.99638516,0.00028273734,0.00028059082,0.0027173515,0.000045475317,0.00028871413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008057924,0.00076655624,0.0006200651,0.0007739019,0.00022888381,0.00062191044,0.0053073117,0.0003025575,0.00047977248],"category_scores_gemma":[0.000009291117,0.0007338639,0.00022006882,0.0007087177,0.0006287893,0.00045376626,0.0024302613,0.00084354583,0.00076358573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052083165,0.000029724724,0.0000086757655,0.000015799185,0.000012147628,0.0001907242,0.00027234352,0.2759221,0.000003713814,0.0037596768,0.00013992972,0.71963996],"study_design_scores_gemma":[0.0008778209,0.0008015899,0.00011873718,0.00096156966,0.00004298653,0.00008246726,2.8241448e-7,0.49708882,0.00063962565,0.19680995,0.2996252,0.002950988],"about_ca_topic_score_codex":0.0000132446185,"about_ca_topic_score_gemma":0.0000056589624,"teacher_disagreement_score":0.716689,"about_ca_system_score_codex":0.0008771671,"about_ca_system_score_gemma":0.00030445843,"threshold_uncertainty_score":0.99951124},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011577156,0.0005002064,0.9958896,0.00031058895,0.00019833812,0.0007249052,0.000007398345,0.000033893048,0.0011773258],"genre_scores_gemma":[0.94886905,0.00010435304,0.04965749,0.00063481374,0.00008542798,0.000058785703,0.000040572457,0.00001368199,0.0005358458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983573,0.0000068510294,0.00043220673,0.00049567065,0.00049432006,0.0002136527],"domain_scores_gemma":[0.9988327,0.00011295767,0.00024040273,0.00044314432,0.0002625818,0.00010823775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041488436,0.00018217154,0.0005162956,0.0006482447,0.00007975149,0.00002924142,0.0002869662,0.000127052,0.000041254894],"category_scores_gemma":[0.00002371619,0.00014845544,0.00009199368,0.00028083345,0.00024783998,0.00011391337,0.000117235795,0.00014971453,0.000010258616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004249345,0.000031372307,0.0011047742,0.0015192989,0.0004580829,0.000007346404,0.00042410303,0.0118159475,0.000036479436,0.009110171,0.000064256776,0.97538567],"study_design_scores_gemma":[0.00038160678,0.000092805385,0.00068109826,0.001152035,0.00045506208,0.000008880323,0.000006201828,0.99556667,0.00008832455,0.0011820243,0.00024427526,0.00014102792],"about_ca_topic_score_codex":0.000023295528,"about_ca_topic_score_gemma":0.000012543343,"teacher_disagreement_score":0.9837507,"about_ca_system_score_codex":0.00010257871,"about_ca_system_score_gemma":0.00011661624,"threshold_uncertainty_score":0.6053837},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001122501,0.00040080425,0.9938777,0.0014239283,0.0002944179,0.0006263947,0.000027967395,0.00035538911,0.0018708771],"genre_scores_gemma":[0.6940613,0.000018949246,0.30482087,0.0007963722,0.00023199597,0.0000140483035,0.000007279831,0.000023363118,0.000025853573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99417585,0.00008582922,0.0010110112,0.0025007504,0.0011583734,0.001068211],"domain_scores_gemma":[0.99590224,0.001111528,0.00050293806,0.0013929578,0.0006111797,0.0004791421],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016378433,0.0009078064,0.00097134244,0.00071935006,0.000427081,0.0014197213,0.0028720978,0.0006212563,0.00002589162],"category_scores_gemma":[0.0003926057,0.00085145805,0.00013278292,0.0006556787,0.0035512478,0.0008976277,0.0011334335,0.0016799287,0.000021769414],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003860528,0.00003286166,0.00104485,0.00012859049,0.0000082887445,0.000027872591,0.0004678381,0.007385044,0.00004377894,0.022226535,0.0000022100555,0.9686283],"study_design_scores_gemma":[0.00048612605,0.000261712,0.0018376044,0.0014544482,0.000022963044,0.000054762222,2.837906e-7,0.7294593,0.00047903322,0.26441294,0.00021373764,0.001317088],"about_ca_topic_score_codex":0.00004503196,"about_ca_topic_score_gemma":0.000087954235,"teacher_disagreement_score":0.9673112,"about_ca_system_score_codex":0.00034481808,"about_ca_system_score_gemma":0.0035547495,"threshold_uncertainty_score":0.9996169},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3725891,0.000009487198,0.6270563,0.00006830823,0.00007176831,0.00016569975,4.6556394e-7,0.000036281566,0.0000025927636],"genre_scores_gemma":[0.55872184,0.0000030682306,0.44106773,0.00019063058,0.000008307635,0.0000052231203,7.9330545e-7,0.0000023037549,6.4820256e-8],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9983126,0.00010510174,0.0002604174,0.0004954296,0.0005836427,0.0002428186],"domain_scores_gemma":[0.9991516,0.00020712598,0.000119881915,0.00035562087,0.0001070724,0.000058701167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068652345,0.00012634156,0.0001831223,0.00033949382,0.000048565842,0.00010354733,0.00067857024,0.000046406458,0.0000032427147],"category_scores_gemma":[0.00019997908,0.000097820484,0.000016653761,0.0007450957,0.00040574578,0.00060483743,0.00034491206,0.00013897003,6.377875e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033866072,0.00005822429,0.16421428,0.000015382715,0.0000012168057,0.0000016273194,0.000897748,0.0008454404,0.0015020188,0.00003125367,3.6940384e-7,0.83242905],"study_design_scores_gemma":[0.0008951997,0.00052861363,0.49791875,0.00009832076,0.0000020499097,0.0000039218367,0.0000020588043,0.40116224,0.097882114,0.0013283374,8.394511e-7,0.0001775653],"about_ca_topic_score_codex":0.00006251504,"about_ca_topic_score_gemma":0.000040229224,"teacher_disagreement_score":0.8322515,"about_ca_system_score_codex":0.00005121128,"about_ca_system_score_gemma":0.00006083699,"threshold_uncertainty_score":0.39890036},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010435822,0.0015764942,0.990999,0.00020930046,0.0018840643,0.00036715702,0.0000023295188,0.0002474097,0.0036706615],"genre_scores_gemma":[0.665372,0.00063506525,0.3283328,0.0034648536,0.0008969008,0.000031712923,0.0000058724822,0.00018941196,0.001071393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952071,0.00008828277,0.0007225439,0.00210968,0.0007402071,0.0011321858],"domain_scores_gemma":[0.997132,0.00046121207,0.00042392238,0.0015815924,0.00014879972,0.00025246962],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084730156,0.00080314244,0.0008244863,0.0010424838,0.00022561682,0.00048052988,0.0026591842,0.0006422559,0.000016749333],"category_scores_gemma":[0.00003440021,0.00075967686,0.00012123139,0.00086685014,0.0016288296,0.00044946204,0.0014919094,0.0012826442,0.000013567222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018218574,0.00005589228,0.00070765265,0.000037349924,0.000014405861,0.0003182801,0.0012928781,0.32943073,0.000035985573,0.06104302,0.000014276104,0.6070313],"study_design_scores_gemma":[0.00038784806,0.00015188124,0.00022474842,0.00087862124,0.000007908131,0.00014375843,2.92335e-7,0.9747237,0.00024244295,0.018863719,0.0032242937,0.0011507767],"about_ca_topic_score_codex":0.00023380722,"about_ca_topic_score_gemma":0.00095857854,"teacher_disagreement_score":0.6643284,"about_ca_system_score_codex":0.00029826365,"about_ca_system_score_gemma":0.00021669228,"threshold_uncertainty_score":0.99948543},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010033581,0.0035090067,0.9927504,0.00033493745,0.0017068135,0.0003387215,0.0000047105746,0.00047072957,0.000784335],"genre_scores_gemma":[0.036566075,0.000013839863,0.96045345,0.0023428292,0.00032987306,0.0000022379838,0.0000032684584,0.00005210069,0.00023630372],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953774,0.000046146608,0.0005843056,0.0018766526,0.0011900649,0.0009254008],"domain_scores_gemma":[0.9972488,0.00020126438,0.00048194116,0.0015830548,0.00030536987,0.0001795507],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00071956764,0.0007177016,0.0005969456,0.0010155938,0.00040285607,0.0010872742,0.0043681106,0.0005172652,0.00003515756],"category_scores_gemma":[0.00014776323,0.00065001636,0.00013320091,0.0010017368,0.00053853414,0.0010416193,0.0016739626,0.0014460591,0.0000074439913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005143735,0.000025574303,0.00006965664,0.0001528542,0.000024776196,0.0003615508,0.00091286015,0.009803772,0.005847107,0.05590472,0.000085717984,0.9268063],"study_design_scores_gemma":[0.00020261311,0.00007524953,0.0000049059104,0.000932033,0.00001592944,0.00038865668,1.3238072e-7,0.28982282,0.02585519,0.68004805,0.0013749141,0.001279493],"about_ca_topic_score_codex":0.000019801859,"about_ca_topic_score_gemma":0.000030135763,"teacher_disagreement_score":0.9255268,"about_ca_system_score_codex":0.00055575336,"about_ca_system_score_gemma":0.00054973416,"threshold_uncertainty_score":0.9999497},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077330925,0.0017214507,0.9153151,0.00016283563,0.0042130896,0.00095013215,0.000043272023,0.000010759731,0.00025241857],"genre_scores_gemma":[0.9635671,0.00015822324,0.034827124,0.0002075455,0.0011348603,0.000014442464,0.00003261451,0.000020348172,0.00003773955],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843675,0.000015245328,0.00028544207,0.00075636024,0.0001913157,0.0003148713],"domain_scores_gemma":[0.9993043,0.00004522959,0.00014794574,0.0003206956,0.00014152647,0.00004029712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002518531,0.00028136792,0.00027941214,0.00015577892,0.00013505295,0.00006485309,0.00037824624,0.00031181646,0.0000017634028],"category_scores_gemma":[0.00003990363,0.0002705451,0.000077044984,0.00010125998,0.00018499231,0.0000033764347,0.00016284556,0.00017497185,7.399312e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087723674,0.000017951004,0.00012314241,0.000029811283,0.000037360114,0.0000054724233,0.00036777102,0.030504694,0.13590758,0.0021900828,0.0000028074612,0.8307256],"study_design_scores_gemma":[0.0027274473,0.002158458,0.009779534,0.000104701954,0.000043417258,0.000040049592,9.102337e-7,0.05063223,0.116124906,0.8134786,0.0034266012,0.0014831579],"about_ca_topic_score_codex":0.000047324687,"about_ca_topic_score_gemma":0.00018494706,"teacher_disagreement_score":0.8862362,"about_ca_system_score_codex":0.00012373118,"about_ca_system_score_gemma":0.00016787072,"threshold_uncertainty_score":0.99997467},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047824645,0.0013146406,0.990847,0.00051887165,0.0013047298,0.000358541,0.0000011492748,0.00022660906,0.004950247],"genre_scores_gemma":[0.6519982,0.00023627668,0.3369445,0.0026050524,0.0016012575,0.000009550047,0.000003193169,0.00009092223,0.006511037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963385,0.000083847895,0.0005378162,0.0015915817,0.00069970515,0.0007485899],"domain_scores_gemma":[0.9976252,0.00080724206,0.00036009637,0.0008998216,0.0001729305,0.00013472258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012899664,0.00061378774,0.0006850499,0.000475432,0.00051682105,0.00090850226,0.00184986,0.0003097995,0.000006526526],"category_scores_gemma":[0.00017376099,0.0005107556,0.00015497254,0.00040967116,0.00044478467,0.00081604504,0.00068908976,0.0010949014,0.000015915826],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010562866,0.000010939642,0.00004053907,0.000038795268,0.000019676369,0.00007341259,0.006766756,0.017190315,0.00076905184,0.037798,0.000004218932,0.93727773],"study_design_scores_gemma":[0.0022534796,0.0011519073,0.00039652173,0.0040079243,0.000030157933,0.0005991332,0.000022761304,0.6015175,0.013843918,0.3139072,0.05855332,0.0037161808],"about_ca_topic_score_codex":0.00004988546,"about_ca_topic_score_gemma":0.00002201472,"teacher_disagreement_score":0.93356156,"about_ca_system_score_codex":0.0001821437,"about_ca_system_score_gemma":0.00022804397,"threshold_uncertainty_score":0.9997344},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038189808,0.00025095392,0.9924586,0.00027418497,0.00043051277,0.00022382083,0.000034129076,0.000019386198,0.0059265364],"genre_scores_gemma":[0.7562213,0.00005659519,0.24296328,0.00028873247,0.00023914863,4.6405867e-7,0.00008234048,0.000007947528,0.00014020293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830765,0.000012671278,0.00032097154,0.00043523527,0.00065191614,0.000271547],"domain_scores_gemma":[0.9992902,0.000109882625,0.0001417946,0.00023486873,0.0001314195,0.00009182345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027388075,0.00021277528,0.00028299406,0.00018092385,0.000116578194,0.00006968809,0.0004899523,0.00012291645,0.00045283575],"category_scores_gemma":[0.0000121519415,0.0001892069,0.000083972285,0.00027532026,0.0003506635,0.00017761518,0.000021475473,0.00027724623,0.000034024535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003064688,0.000007798275,0.0003344042,0.000009879754,0.000003860914,0.000001801727,0.000078122495,0.644602,0.000003869636,0.00005880983,0.0000020469247,0.35489434],"study_design_scores_gemma":[0.00021228247,0.00015580328,0.004693682,0.00012061841,0.000015357578,0.0000064812257,1.8080047e-7,0.9654578,0.0001876047,0.02848786,0.0003691691,0.00029317167],"about_ca_topic_score_codex":0.00017061473,"about_ca_topic_score_gemma":0.0005991649,"teacher_disagreement_score":0.7558394,"about_ca_system_score_codex":0.00002074579,"about_ca_system_score_gemma":0.00022027796,"threshold_uncertainty_score":0.7715633},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036980078,0.004626266,0.9812843,0.00031434174,0.009008721,0.0003685812,0.0000026366665,0.00010546571,0.0039198487],"genre_scores_gemma":[0.7613086,0.00007318289,0.23685074,0.0007046334,0.00022298493,0.000014437999,0.0000063773446,0.00004541091,0.000773641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722356,0.000045047313,0.00065868633,0.00081450096,0.00077393884,0.00048424167],"domain_scores_gemma":[0.9978317,0.0003927965,0.0003444231,0.0010926075,0.00019972154,0.00013874026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001166561,0.00032383433,0.0005209661,0.0012846902,0.000055924527,0.000056216657,0.0017584687,0.00029787034,0.000023245639],"category_scores_gemma":[0.000116473784,0.00031086945,0.00012309181,0.00056888774,0.0005960356,0.000455034,0.0006395413,0.0005801796,0.000016178008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014329617,0.00017902764,0.00025615632,0.00006851272,0.000011981302,0.00003078044,0.0032953003,0.011879607,0.0006805954,0.6662734,0.000180704,0.3171296],"study_design_scores_gemma":[0.0011304991,0.00016554925,0.00031481378,0.0004953883,0.000010701899,0.000022407286,1.0039403e-7,0.1648202,0.00045246366,0.82661647,0.0053248308,0.000646585],"about_ca_topic_score_codex":0.000073182106,"about_ca_topic_score_gemma":0.000041974406,"teacher_disagreement_score":0.76093876,"about_ca_system_score_codex":0.0005518938,"about_ca_system_score_gemma":0.00096031325,"threshold_uncertainty_score":0.9999343},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083212456,0.00036324604,0.9961223,0.000031193216,0.000079522404,0.00015838201,0.0000028646805,0.00024931473,0.0021610742],"genre_scores_gemma":[0.63768435,0.0001689553,0.36188534,0.00008384016,0.00008872233,0.0000044511394,0.0000067042884,0.000047757407,0.000029866225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983855,0.0000072673824,0.00034243372,0.0004771426,0.0004900424,0.0002976044],"domain_scores_gemma":[0.99904746,0.00020835784,0.00012041695,0.00041770533,0.00012899264,0.0000770483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011383384,0.00031709255,0.0004999413,0.00063987816,0.000041589512,0.00002939351,0.0005239854,0.00017594249,0.0000255817],"category_scores_gemma":[0.00003933347,0.0002568963,0.00006973049,0.0013700341,0.00034038993,0.00015045873,0.00007865399,0.00040329667,0.000006454634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003876129,0.000008759571,0.00014800367,0.00002875741,0.000014783561,0.000010166188,0.00003164602,0.81805944,0.00021130523,0.00026411528,0.000002569033,0.18121657],"study_design_scores_gemma":[0.0001192119,0.00022408216,0.00010740532,0.00021294314,0.000027339674,0.000029383908,1.3100968e-7,0.9630955,0.013459507,0.021437403,0.00074550795,0.0005416266],"about_ca_topic_score_codex":0.0000139133645,"about_ca_topic_score_gemma":0.000006041797,"teacher_disagreement_score":0.63685226,"about_ca_system_score_codex":0.00014271158,"about_ca_system_score_gemma":0.000042149077,"threshold_uncertainty_score":0.9999883},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49347815,0.000020716561,0.5061831,0.000025525822,0.00023074524,0.000035132114,8.4368577e-7,0.00002119803,0.000004625211],"genre_scores_gemma":[0.98895997,0.000009703671,0.010875567,0.00007865,0.00006978374,6.811472e-7,0.0000023437149,0.0000033049894,2.5556412e-8],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938565,0.000015193309,0.00015218872,0.00013758983,0.00012327831,0.0001861119],"domain_scores_gemma":[0.9998103,0.00003460674,0.00001694474,0.00008839809,0.000025856585,0.000023906983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021359154,0.00006776496,0.00010811683,0.00015433542,0.000020528263,0.000027588681,0.00012745286,0.000042427248,0.0000042954634],"category_scores_gemma":[0.000020165326,0.0000693974,0.00001841019,0.00028416215,0.000027133226,0.00020226215,0.000016529717,0.0000961957,0.000003558273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017640017,0.000013737061,0.0014654037,0.000015536556,5.353789e-7,0.0000021076503,0.00043550396,0.6336914,0.03074712,0.0000011819743,3.3643647e-7,0.3336254],"study_design_scores_gemma":[0.000109409935,0.000045153047,0.018389253,0.000069962356,0.0000013320739,0.0000024102176,2.9338136e-7,0.8423442,0.13738659,0.001568536,9.5102075e-7,0.00008189359],"about_ca_topic_score_codex":0.000034140023,"about_ca_topic_score_gemma":0.000029244027,"teacher_disagreement_score":0.4954818,"about_ca_system_score_codex":0.00005261272,"about_ca_system_score_gemma":0.000009832563,"threshold_uncertainty_score":0.28299436},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010340165,0.00010987816,0.9946904,0.001593975,0.0013768111,0.0004737203,0.000008823088,0.00022123307,0.0004911492],"genre_scores_gemma":[0.34058523,0.000014758606,0.657496,0.0011220335,0.00029141677,0.000027231546,0.0000055806568,0.00005369096,0.00040411082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99539137,0.00009729669,0.0007428386,0.0010621828,0.0020433532,0.0006629816],"domain_scores_gemma":[0.99193543,0.0043624695,0.00038196283,0.002809148,0.00035269756,0.00015825997],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0032969234,0.00045101336,0.00059344334,0.0005514821,0.00024228629,0.00040285705,0.006462568,0.00029721248,0.000049587325],"category_scores_gemma":[0.00070220744,0.00032509665,0.0001537729,0.00066924875,0.0011469825,0.00031356202,0.002493841,0.0017830459,0.000016984712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024628625,0.00011445852,0.0023161601,0.0002541516,0.0000539086,0.000031737047,0.0015312062,0.033011597,0.0011824609,0.020437842,0.000118656135,0.9409454],"study_design_scores_gemma":[0.00035863658,0.00016037565,0.007833005,0.00042327543,0.000010129526,0.000046085213,3.2907042e-7,0.95609444,0.0018770967,0.027704198,0.0048012123,0.0006912244],"about_ca_topic_score_codex":0.00006276348,"about_ca_topic_score_gemma":0.00006595867,"teacher_disagreement_score":0.94025415,"about_ca_system_score_codex":0.00028205724,"about_ca_system_score_gemma":0.0007198009,"threshold_uncertainty_score":0.9999201},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006370461,0.0001496705,0.994064,0.0006246806,0.00076936884,0.00031956215,0.0000015654612,0.000120045624,0.003314089],"genre_scores_gemma":[0.26747954,0.000036381312,0.72659284,0.0016366165,0.0009369597,0.00002167827,0.000024893245,0.000053915148,0.0032172024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996696,0.00004874874,0.00049237517,0.0013104536,0.0009091932,0.00054326246],"domain_scores_gemma":[0.99817675,0.00045420686,0.0002452721,0.0007674086,0.00022702261,0.00012935007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009808437,0.0004646154,0.00053172366,0.0011784643,0.00022446818,0.0004295477,0.0014676151,0.00020394895,0.000026430722],"category_scores_gemma":[0.000078751444,0.0004193871,0.00007849399,0.00096264726,0.00024847043,0.0005771483,0.0006180651,0.00060316524,0.00013662835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017032251,0.000024724197,0.00009912004,0.000034687713,0.000014481467,0.000093673756,0.0007317827,0.71917194,0.00054202,0.018549351,0.00008243661,0.26063874],"study_design_scores_gemma":[0.00033995963,0.00022249049,0.00016778441,0.00043097488,0.0000051695915,0.0000862736,1.5215971e-7,0.9724603,0.0015339617,0.01902299,0.005076461,0.0006534724],"about_ca_topic_score_codex":0.000010828649,"about_ca_topic_score_gemma":0.000058846763,"teacher_disagreement_score":0.26747113,"about_ca_system_score_codex":0.00024566657,"about_ca_system_score_gemma":0.00045181508,"threshold_uncertainty_score":0.9998258},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008820427,0.00004065674,0.9812625,0.00030242672,0.003478522,0.00045132395,0.000002584395,0.00025230928,0.005389253],"genre_scores_gemma":[0.41897357,0.00006548643,0.5773438,0.0010771531,0.0009990295,0.000012718734,0.000015439067,0.00013279673,0.0013800113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949761,0.000099669625,0.001009777,0.0018963527,0.0010330051,0.0009850695],"domain_scores_gemma":[0.9967908,0.0007748155,0.00064920424,0.0012422567,0.00033371823,0.00020918199],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012480954,0.0007186089,0.00067126675,0.002265281,0.00027204634,0.0007142801,0.0030489767,0.0005069202,0.00016897246],"category_scores_gemma":[0.00012997072,0.00075413246,0.000174991,0.0009954511,0.00031821404,0.0022424215,0.0019664646,0.0023974695,0.00035567724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064654036,0.00019202805,0.0010243214,0.00009068853,0.000046849615,0.0005402116,0.0064552426,0.39715207,0.011550986,0.0012313068,0.000020611367,0.58163106],"study_design_scores_gemma":[0.00028234711,0.00011401702,0.0005601335,0.0010569784,0.000008120593,0.00018898305,0.0000017080567,0.9908954,0.0021720591,0.0027083016,0.001262563,0.0007494266],"about_ca_topic_score_codex":0.00041251656,"about_ca_topic_score_gemma":0.0003026571,"teacher_disagreement_score":0.5937433,"about_ca_system_score_codex":0.0017155741,"about_ca_system_score_gemma":0.000349369,"threshold_uncertainty_score":0.99990404},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000062303166,0.00125849,0.99604607,0.0012180919,0.0004486411,0.0006839692,0.000011118311,0.00012106011,0.00020632352],"genre_scores_gemma":[0.19336614,0.0010169089,0.79983324,0.005213674,0.0002224586,0.00007310887,0.000030348096,0.000041924122,0.00020220046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977082,0.00001664633,0.00062489026,0.0006740735,0.00064875867,0.00032740278],"domain_scores_gemma":[0.9975068,0.00065461616,0.00043370755,0.0008030143,0.00054163305,0.000060249007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079164637,0.00031010873,0.0003904197,0.0006385135,0.00024118477,0.00015784855,0.002509563,0.00018341806,0.00000836711],"category_scores_gemma":[0.000043659766,0.00023964063,0.0001747201,0.0005014928,0.0005677581,0.0004041569,0.00069148734,0.00029228465,0.000002076749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000220565,0.000025185109,0.000011333608,0.000120174554,0.0000136594535,9.402012e-7,0.0006890277,0.1733547,0.0000022093536,0.7002115,0.00022121127,0.12534781],"study_design_scores_gemma":[0.00009063107,0.00007340921,0.000012864908,0.0002185548,0.000005834518,0.000011718485,3.490041e-8,0.6233064,0.00008713628,0.3758637,0.00016853189,0.00016117725],"about_ca_topic_score_codex":0.0000074524637,"about_ca_topic_score_gemma":0.000013581269,"teacher_disagreement_score":0.4499517,"about_ca_system_score_codex":0.0000794641,"about_ca_system_score_gemma":0.00026644857,"threshold_uncertainty_score":0.97722614},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006315018,0.0001587251,0.9946553,0.00020501613,0.0023696655,0.0006945369,0.0000074255818,0.00004348519,0.0012343543],"genre_scores_gemma":[0.63638324,0.000034642828,0.36084032,0.0021235792,0.00039408143,0.000040592175,0.000012177074,0.000048634323,0.00012275361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712867,0.000030453892,0.00044043633,0.0014245581,0.00038766794,0.0005882461],"domain_scores_gemma":[0.99794906,0.00062789733,0.00029707912,0.0006462003,0.0003284503,0.00015132931],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003903091,0.00049545727,0.00048065674,0.00085397717,0.00044150348,0.00045348587,0.0013894362,0.00028024483,0.000015152056],"category_scores_gemma":[0.00007282774,0.0004641933,0.00016572105,0.00027506074,0.00048457235,0.0011271266,0.00084942474,0.0007733794,0.000014571623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022365742,0.0002755913,0.0006411157,0.00031363612,0.00015022441,0.00018811593,0.010211,0.0023287483,0.035038155,0.12885006,0.00016097815,0.82161874],"study_design_scores_gemma":[0.0013268142,0.0008155523,0.0014586406,0.0013810412,0.00004133871,0.0003653023,0.0000027414187,0.90013975,0.017720122,0.07302822,0.002082082,0.0016383937],"about_ca_topic_score_codex":0.00003936476,"about_ca_topic_score_gemma":0.00007002227,"teacher_disagreement_score":0.897811,"about_ca_system_score_codex":0.0001863635,"about_ca_system_score_gemma":0.00016121037,"threshold_uncertainty_score":0.99978095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0285806,0.00027080576,0.96874136,0.000038868522,0.0007659717,0.00043730234,0.000005965506,0.000038309397,0.0011207897],"genre_scores_gemma":[0.09747803,0.000007261069,0.90205115,0.0000701208,0.00021087726,0.0000022576166,9.802189e-7,0.00001886894,0.0001604732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955373,0.00008915842,0.0010032431,0.001209929,0.001764185,0.00039619385],"domain_scores_gemma":[0.9968271,0.0014474946,0.00066876435,0.0004955287,0.00043421343,0.00012684707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003912522,0.00036121812,0.00056411297,0.0012421737,0.00020158514,0.00030455968,0.0012671221,0.00024174512,0.00003262051],"category_scores_gemma":[0.0015716808,0.0002900043,0.00008733816,0.0008030131,0.0008480157,0.0002938681,0.0008223296,0.0004439739,0.0000027414846],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012325744,0.000011236448,0.001975369,0.000014019915,0.0000058933674,0.000009574813,0.0008358187,0.0042320485,0.0003396589,0.000034663262,0.0000023211853,0.99252707],"study_design_scores_gemma":[0.00042076776,0.0006090688,0.019122902,0.0012266276,0.000035300556,0.0005062288,0.0000043269733,0.8764169,0.002076733,0.09688035,0.0019775247,0.00072324876],"about_ca_topic_score_codex":0.000013112862,"about_ca_topic_score_gemma":0.000027899183,"teacher_disagreement_score":0.9918038,"about_ca_system_score_codex":0.00022316238,"about_ca_system_score_gemma":0.0004241615,"threshold_uncertainty_score":0.99995524},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023207972,0.00048523687,0.9931216,0.00031017256,0.002046079,0.0016278306,0.000011992067,0.00017675963,0.0019882019],"genre_scores_gemma":[0.292385,0.000037971273,0.70343965,0.0020461609,0.0014222614,0.00021980115,0.000014964818,0.000091121314,0.00034306743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99462396,0.000051150742,0.0007536589,0.002387975,0.0009514749,0.0012317538],"domain_scores_gemma":[0.99612623,0.0010672803,0.0004214326,0.001781709,0.00034789284,0.00025544842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009469022,0.0007646194,0.0008000056,0.0008059924,0.00022735712,0.0006048225,0.004402283,0.0004978986,0.000043143118],"category_scores_gemma":[0.00009190113,0.00074821,0.00018328553,0.00072296825,0.00052982214,0.0010938447,0.0019408193,0.0012507464,0.00006275816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024431276,0.000100473524,0.00015840966,0.0001555471,0.000031956486,0.00024060365,0.0019049933,0.06541979,0.00006803094,0.06947906,0.0005402304,0.8618765],"study_design_scores_gemma":[0.00041040464,0.00021200173,0.00009773845,0.00065309537,0.0000045068755,0.000036991718,4.773849e-7,0.87076616,0.0002597391,0.124683745,0.002114947,0.0007601717],"about_ca_topic_score_codex":0.00010422335,"about_ca_topic_score_gemma":0.00054150156,"teacher_disagreement_score":0.8611163,"about_ca_system_score_codex":0.00058919186,"about_ca_system_score_gemma":0.0005659276,"threshold_uncertainty_score":0.9994969},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000577792,0.0012918385,0.98351115,0.0068024034,0.0036665613,0.0010420607,0.000018957535,0.00093190925,0.002157355],"genre_scores_gemma":[0.38726816,0.000039057733,0.6057067,0.0050075464,0.00069405814,0.00011596471,0.000025910193,0.00009133802,0.0010512507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933108,0.000077655706,0.0010788669,0.0024408363,0.001640344,0.0014514726],"domain_scores_gemma":[0.9953766,0.00051394757,0.0003904538,0.0028611845,0.00052728323,0.00033055505],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014220952,0.0008773152,0.001015822,0.003376618,0.00027648784,0.002072255,0.0085646175,0.0006762908,0.000009775179],"category_scores_gemma":[0.00019977687,0.0008581578,0.0001850013,0.0024526261,0.00083750294,0.0013658768,0.0022282067,0.0016480773,0.00012760799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020164625,0.00016789822,0.0011820345,0.00008580294,0.000027384982,0.00045503234,0.00059798866,0.45859087,0.0010982055,0.07797431,0.00079786946,0.45900247],"study_design_scores_gemma":[0.0009301399,0.00030850648,0.0014090172,0.0016065298,0.000013927854,0.00013535199,0.0000014212543,0.96091336,0.0013791518,0.016363442,0.014998343,0.0019408357],"about_ca_topic_score_codex":0.0001907271,"about_ca_topic_score_gemma":0.00091539946,"teacher_disagreement_score":0.5023225,"about_ca_system_score_codex":0.0011913896,"about_ca_system_score_gemma":0.000695621,"threshold_uncertainty_score":0.9993869},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027790098,0.0000829575,0.9946569,0.000188328,0.00030379614,0.00025667905,0.00000404927,0.000066144836,0.0016620934],"genre_scores_gemma":[0.60961807,0.000022673343,0.38996264,0.00024041742,0.00006030242,0.0000027477315,0.0000039373376,0.00001818262,0.00007102011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754614,0.00003826751,0.00027329262,0.00093136635,0.0008734932,0.00033745466],"domain_scores_gemma":[0.9984951,0.0001629831,0.00016285392,0.00066620583,0.0003101043,0.00020275917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006835531,0.0002975882,0.0003329251,0.0007206,0.0001178158,0.00034551928,0.000828404,0.00015328456,0.00001896443],"category_scores_gemma":[0.000025927346,0.0002445738,0.000036516034,0.0004573315,0.00078243983,0.00057764695,0.00033030915,0.00044421142,0.0000032606727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041555857,0.000037474652,0.00045243368,0.000034685123,0.000013003451,0.000051760693,0.0023897497,0.30672017,0.00006619876,0.060656983,0.0000071437453,0.6295288],"study_design_scores_gemma":[0.0005906358,0.0011398095,0.0008555174,0.0004442588,0.000008241239,0.00016268817,0.0000015796351,0.97736114,0.00039138063,0.018320508,0.0001793891,0.0005448446],"about_ca_topic_score_codex":0.000020248921,"about_ca_topic_score_gemma":0.000049662962,"teacher_disagreement_score":0.670641,"about_ca_system_score_codex":0.00013030854,"about_ca_system_score_gemma":0.0005490246,"threshold_uncertainty_score":0.99734306},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057209632,0.0003298375,0.9942105,0.00034312738,0.0020407578,0.0013275743,0.00021578246,0.00032969858,0.0011455197],"genre_scores_gemma":[0.7315801,0.000006609996,0.26687187,0.0006714522,0.0003219413,0.00021313525,0.00023094387,0.000044580465,0.000059416237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605983,0.000060982216,0.00073088706,0.0015354912,0.00093528134,0.0006775341],"domain_scores_gemma":[0.9949706,0.0009464686,0.00057452265,0.0028608697,0.00044551882,0.00020199944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014164826,0.0006035165,0.00069563696,0.0004566146,0.0005872343,0.00090020156,0.005050725,0.0005469716,0.000005213672],"category_scores_gemma":[0.000063218395,0.0005345883,0.00021644635,0.00057387975,0.00047364514,0.00047836412,0.0005790241,0.00091260014,0.000029295004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006859415,0.00028122708,0.00013277431,0.00093114766,0.000042785723,0.00006337462,0.0005437675,0.17088272,0.00074515713,0.164117,0.00017796451,0.6620135],"study_design_scores_gemma":[0.0006229563,0.0003528044,0.000098380944,0.0014059272,0.000011422751,0.000022935572,5.466228e-7,0.9650452,0.0009599322,0.0067091854,0.024008851,0.0007618182],"about_ca_topic_score_codex":0.000033372868,"about_ca_topic_score_gemma":0.00015329004,"teacher_disagreement_score":0.7941625,"about_ca_system_score_codex":0.00041528983,"about_ca_system_score_gemma":0.00033283228,"threshold_uncertainty_score":0.99971056},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33426306,0.000012049566,0.6653958,0.000009919502,0.0002116768,0.000060362294,2.5250375e-7,0.000042478394,0.0000043753944],"genre_scores_gemma":[0.63729113,4.3436526e-7,0.36265072,0.000016200804,0.00003492292,7.5205804e-7,0.0000014987918,0.0000043135983,1.6079108e-8],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938893,0.0000041366993,0.00017932411,0.00013732199,0.00014292737,0.00014734697],"domain_scores_gemma":[0.99960905,0.00013408583,0.000025390425,0.00014516248,0.00005806826,0.000028233591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026743428,0.00006954324,0.00007141015,0.00021613298,0.000054794753,0.000037664548,0.00013029718,0.000037380265,0.0000020132668],"category_scores_gemma":[0.000046400422,0.000072714385,0.0000143191155,0.0007169892,0.000043834647,0.00016630765,0.000013194341,0.000094199946,0.0000012533773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.3537456e-7,0.000008851546,0.00023216312,0.0000101277365,5.769104e-7,1.841446e-7,0.00013850436,0.8677769,0.049464546,0.0000208062,6.92796e-8,0.08234657],"study_design_scores_gemma":[0.000055669836,0.000007852298,0.00039261373,0.000034305365,0.000001960631,0.0000036107597,9.1936585e-7,0.8837429,0.11498977,0.0007081033,4.8069717e-7,0.00006179942],"about_ca_topic_score_codex":0.00004988191,"about_ca_topic_score_gemma":0.000019300387,"teacher_disagreement_score":0.30302808,"about_ca_system_score_codex":0.00010967353,"about_ca_system_score_gemma":0.000018568915,"threshold_uncertainty_score":0.29652065},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005200982,0.00082097144,0.9936298,0.0009921778,0.0014380749,0.00078829675,0.000010770945,0.00030899982,0.0020056658],"genre_scores_gemma":[0.065166384,0.00008773054,0.9196346,0.008082788,0.0022758748,0.00008595894,0.00006592423,0.000121135046,0.004479606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600065,0.000027688036,0.00059712515,0.0016801561,0.0008952345,0.0007991664],"domain_scores_gemma":[0.99653274,0.0012771155,0.00034341836,0.001391699,0.0002471169,0.00020788646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007520895,0.0005786572,0.0005556165,0.00058806624,0.0004095029,0.00054664747,0.0027921428,0.0003684601,0.000014199455],"category_scores_gemma":[0.00013676309,0.0005387106,0.00019199554,0.0005556879,0.00030544947,0.00033443683,0.000711252,0.000656704,0.000033810804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016790571,0.00003071153,0.00002632178,0.000038046903,0.000010360377,0.000035841676,0.00041948946,0.26426813,0.000001584312,0.015837077,0.001039245,0.71827644],"study_design_scores_gemma":[0.00046765484,0.00041062053,0.00008170885,0.0004955623,0.0000132440755,0.000043500833,1.8932653e-7,0.8426165,0.00002862856,0.12663612,0.028505795,0.0007004726],"about_ca_topic_score_codex":0.000005712356,"about_ca_topic_score_gemma":0.000016441381,"teacher_disagreement_score":0.71757597,"about_ca_system_score_codex":0.00033144213,"about_ca_system_score_gemma":0.0005272673,"threshold_uncertainty_score":0.99970645},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00110508,0.0078082527,0.98740816,0.0008341218,0.0010857916,0.00030109333,0.000012333396,0.000029372577,0.0014157922],"genre_scores_gemma":[0.88050073,0.00170035,0.10702467,0.0025558812,0.0043266434,0.000056398654,0.00006313377,0.00008368858,0.0036884758],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986943,0.00000839997,0.00018710642,0.00061025744,0.00018083231,0.00031911544],"domain_scores_gemma":[0.9990477,0.0002401925,0.00006978555,0.0004892178,0.00009177424,0.000061317776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025840255,0.00022869305,0.00021285773,0.00007132419,0.00014741134,0.000035924582,0.00087752077,0.00038953463,0.0000057662214],"category_scores_gemma":[0.00020403508,0.00015001344,0.00012137086,0.00007977252,0.0013742078,0.00000156606,0.0003902765,0.00026851913,0.000008726815],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026305044,0.000026980197,0.000021018477,0.00004279723,0.000029887793,0.000008391963,0.00017422132,0.00022108406,0.018730363,0.0001249997,0.0028296493,0.9777643],"study_design_scores_gemma":[0.0010209639,0.00061173685,0.00007876042,0.00033149705,0.000050943407,0.00027914907,8.236963e-7,0.06242075,0.07513034,0.0060933256,0.8528529,0.0011288397],"about_ca_topic_score_codex":0.0000018618102,"about_ca_topic_score_gemma":0.000024377741,"teacher_disagreement_score":0.97663546,"about_ca_system_score_codex":0.000026765681,"about_ca_system_score_gemma":0.00033312952,"threshold_uncertainty_score":0.6117371},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023550228,0.00021502779,0.9921998,0.0024451497,0.0025893191,0.0008564252,0.000036758727,0.0001494758,0.0015057378],"genre_scores_gemma":[0.11517746,0.000049136066,0.88189083,0.0021485365,0.0005459713,0.00003730119,0.000009111269,0.000021261192,0.000120409946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973679,0.000020485364,0.0004340083,0.0011144857,0.0005591478,0.0005039811],"domain_scores_gemma":[0.9978511,0.00041016293,0.00024555557,0.0010195487,0.0003382625,0.00013541013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078611734,0.00039607813,0.00035988365,0.00016277353,0.00041855974,0.0006070637,0.0019521443,0.00024353608,0.000027028138],"category_scores_gemma":[0.00010842518,0.00030159383,0.00021487506,0.00040836146,0.0010536966,0.00034232615,0.0005211864,0.00042060015,0.0000070251367],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036877532,0.000008243756,0.000029496196,0.000014246911,0.000016539056,0.0000070369815,0.00013131146,0.05379692,0.000007668118,0.105566405,0.000006252068,0.8404122],"study_design_scores_gemma":[0.0004359635,0.000094467905,0.00029122955,0.00008760662,0.000015264974,0.00008891683,2.9426195e-7,0.7850464,0.00011951086,0.21229358,0.0011112794,0.0004154888],"about_ca_topic_score_codex":0.00006644734,"about_ca_topic_score_gemma":0.00012333263,"teacher_disagreement_score":0.8399967,"about_ca_system_score_codex":0.00075892155,"about_ca_system_score_gemma":0.0012827863,"threshold_uncertainty_score":0.9999436},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052687456,0.00016242688,0.9894083,0.00021096565,0.0018511763,0.00043809725,0.00004206774,0.00032701532,0.007033077],"genre_scores_gemma":[0.44820082,0.000092630995,0.5470699,0.003642624,0.0008219957,0.0000114278255,0.0001088905,0.00003812699,0.000013578336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99578714,0.000053289274,0.0007379965,0.0011336267,0.0014200967,0.0008678581],"domain_scores_gemma":[0.9960013,0.0003104417,0.00038754282,0.0024825484,0.00040903655,0.00040910978],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020576299,0.0006455296,0.0005661841,0.0013958234,0.00042832253,0.0012055218,0.004832955,0.00051071215,0.000045758345],"category_scores_gemma":[0.00010209267,0.0006102955,0.0001700032,0.0011100218,0.0013809035,0.0041712555,0.0015145924,0.0013061577,0.00009932321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015841279,0.000068728186,0.00039282098,0.00007943159,0.000009934007,0.000044254917,0.004106372,0.00063506444,0.0000061014907,0.6881014,0.000025990887,0.30651405],"study_design_scores_gemma":[0.00037092497,0.00023671679,0.00044683082,0.00018476351,0.0000113652195,0.00013083853,9.2789816e-7,0.13718686,0.00030399975,0.85354,0.0065588662,0.0010278878],"about_ca_topic_score_codex":0.0000855505,"about_ca_topic_score_gemma":0.00034949352,"teacher_disagreement_score":0.44767395,"about_ca_system_score_codex":0.00019032271,"about_ca_system_score_gemma":0.0005025524,"threshold_uncertainty_score":0.9998313},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014179452,0.0003771312,0.99635726,0.00068522285,0.00053607917,0.00061336346,0.00060665427,0.00017031666,0.0006398078],"genre_scores_gemma":[0.0047432627,0.000022997549,0.991785,0.0016131448,0.0005849696,0.00006754476,0.001056319,0.000040983385,0.00008578104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952518,0.000025423677,0.000548336,0.0027254734,0.00080623606,0.00064277084],"domain_scores_gemma":[0.9944163,0.0008182245,0.0003305102,0.004081486,0.00016312349,0.00019036494],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00065146014,0.0005329186,0.0005363923,0.00043470302,0.0003887699,0.000577975,0.009000313,0.00026254653,0.000008164827],"category_scores_gemma":[0.00008298396,0.0004935115,0.00010935209,0.0004534086,0.00050803367,0.0006069536,0.0020321615,0.00045531584,0.0000115268695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021191997,0.000049813796,0.00003018959,0.000018233317,0.000012505414,0.00001941725,0.00032830678,0.008714082,0.000019090674,0.0003100834,0.00054469367,0.9899515],"study_design_scores_gemma":[0.00037798626,0.00008340554,0.000038319406,0.0001655398,0.0000123512555,0.000013501926,3.4405082e-7,0.9888149,0.00015000433,0.0038009216,0.005961888,0.0005808215],"about_ca_topic_score_codex":0.00022708387,"about_ca_topic_score_gemma":0.00010415343,"teacher_disagreement_score":0.98937064,"about_ca_system_score_codex":0.00016185142,"about_ca_system_score_gemma":0.00080234156,"threshold_uncertainty_score":0.9997516},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005370285,0.0003229696,0.9865019,0.0003026627,0.0008450269,0.0002735709,0.0000020712525,0.0004649684,0.011233176],"genre_scores_gemma":[0.39008495,0.000044009237,0.60285187,0.005932963,0.00060275994,0.000012135018,0.0000018491869,0.000063418716,0.0004060648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965696,0.000035535748,0.00042366292,0.0013818216,0.00097390485,0.0006154984],"domain_scores_gemma":[0.9978358,0.0006041807,0.00022212049,0.000984688,0.00020652714,0.00014668946],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016063362,0.0004932217,0.00043959392,0.0012564278,0.0007003845,0.0016448289,0.001496957,0.00028768872,0.000013677372],"category_scores_gemma":[0.0001897156,0.00045742636,0.00010564218,0.0005403037,0.000901651,0.00053225626,0.00063212705,0.0008051506,0.000013849726],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000836245,0.000012742701,0.0000141406035,0.000038736445,0.0000040826512,0.00009753315,0.00027190958,0.0012527929,0.00014508612,0.0009531009,0.000015474985,0.99718606],"study_design_scores_gemma":[0.00031768554,0.000526182,0.00012932101,0.00094692886,0.000010944729,0.00007460819,1.9496545e-7,0.8011459,0.15227728,0.03493776,0.008427876,0.0012052987],"about_ca_topic_score_codex":0.00004321627,"about_ca_topic_score_gemma":0.00008938565,"teacher_disagreement_score":0.99598074,"about_ca_system_score_codex":0.00026985683,"about_ca_system_score_gemma":0.00041689447,"threshold_uncertainty_score":0.99978775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011900429,0.0001649381,0.9909258,0.0046741567,0.00058216637,0.00048710458,0.000037572718,0.00014038986,0.0017978611],"genre_scores_gemma":[0.1974792,0.000009942602,0.79847217,0.003116589,0.00061636255,0.000037059763,0.000010986583,0.000028833758,0.0002288907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967046,0.00004302141,0.0003762343,0.0011810883,0.0009338054,0.00076126866],"domain_scores_gemma":[0.99702877,0.0008234252,0.00025116932,0.0014753377,0.00016430575,0.00025697518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009100443,0.0004915333,0.0004307619,0.00024230927,0.00057274505,0.0010051522,0.0042306026,0.00016739118,0.00002669738],"category_scores_gemma":[0.000039724506,0.00032714457,0.00008004341,0.00053185737,0.0012891797,0.0006390553,0.0014024569,0.00062665436,0.00006168785],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053786734,0.000025694986,0.00007217405,0.000014283363,0.000023641489,0.000046733418,0.0027216573,0.00892701,0.00019909642,0.027310442,0.00011836628,0.9605355],"study_design_scores_gemma":[0.0017260537,0.0017199953,0.0038921605,0.002693016,0.00016784384,0.002653314,0.0000247608,0.80415016,0.006044365,0.102107294,0.06821015,0.006610892],"about_ca_topic_score_codex":0.00008597023,"about_ca_topic_score_gemma":0.00019849301,"teacher_disagreement_score":0.95392466,"about_ca_system_score_codex":0.00017697924,"about_ca_system_score_gemma":0.00055361923,"threshold_uncertainty_score":0.99991804},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046671391,0.00043496245,0.9953737,0.00017132558,0.0004718704,0.00052938546,0.0000012107124,0.001028113,0.001522679],"genre_scores_gemma":[0.4243402,0.000010921063,0.5751515,0.00030691226,0.00014388037,0.000012535283,0.0000023549355,0.000017609713,0.000014067571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626917,0.000096955875,0.00060491223,0.0011717179,0.0014304607,0.00042680764],"domain_scores_gemma":[0.9971487,0.0004938435,0.0003345025,0.0015030687,0.00042747732,0.00009241057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0040418534,0.0003397754,0.00046637858,0.0011341614,0.00009081247,0.00025331267,0.0030564351,0.00025405688,0.000015394862],"category_scores_gemma":[0.0003696223,0.00033389637,0.00006305038,0.00067290646,0.00032574483,0.0007688668,0.0006684368,0.0005030504,0.0000069018306],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015274704,0.000030861826,0.0003086361,0.00002843031,0.0000017537044,0.00000855411,0.00056913524,0.048957597,0.00006846113,0.00196923,0.000008608336,0.9480472],"study_design_scores_gemma":[0.00017321257,0.00011979179,0.0005588728,0.0018015329,0.0000047088624,0.000019029443,2.4157337e-8,0.7617866,0.0009793927,0.23422885,0.00001737506,0.00031060982],"about_ca_topic_score_codex":0.00008676458,"about_ca_topic_score_gemma":0.00013482786,"teacher_disagreement_score":0.9477366,"about_ca_system_score_codex":0.00040076516,"about_ca_system_score_gemma":0.0011292978,"threshold_uncertainty_score":0.9999113},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000095113166,0.0001186374,0.9933583,0.0006074679,0.00070243084,0.0003576623,0.0000013005673,0.00030140157,0.004457668],"genre_scores_gemma":[0.37499657,0.000005715219,0.62338006,0.0008858202,0.000296099,0.0000042743677,0.000007670593,0.00003145787,0.00039232374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552155,0.000051892224,0.0008147476,0.001878019,0.0009916223,0.0007421859],"domain_scores_gemma":[0.9979475,0.00016589566,0.00035599477,0.0008656833,0.00038382516,0.00028111282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011836612,0.0005421269,0.00054318627,0.0010408211,0.00029693928,0.0009651353,0.003434409,0.00035002368,0.000055522272],"category_scores_gemma":[0.000065680884,0.0005075848,0.00014917398,0.0010211563,0.00019576159,0.00092925114,0.00080548966,0.00081031525,0.00007566273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013700152,0.000016500211,0.000003587724,0.000006050456,0.0000074047844,0.000020801206,0.0011014311,0.6631603,0.000012417034,0.031133065,0.0000066161683,0.3045304],"study_design_scores_gemma":[0.00013375323,0.00018819665,0.000007225171,0.00032380392,0.0000103799475,0.000055770546,3.0005583e-7,0.9966059,0.00007081096,0.0015299272,0.00047760754,0.0005963628],"about_ca_topic_score_codex":0.0000093293365,"about_ca_topic_score_gemma":0.00010046259,"teacher_disagreement_score":0.37490144,"about_ca_system_score_codex":0.00033173402,"about_ca_system_score_gemma":0.00030030523,"threshold_uncertainty_score":0.99973756},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021798834,0.00019542106,0.9945199,0.0005412288,0.00039965915,0.00030253467,4.731387e-7,0.000037301896,0.0018235937],"genre_scores_gemma":[0.9721281,0.0000651337,0.026804877,0.0008167383,0.000094784016,0.00000586509,0.0000022763668,0.000010050168,0.00007218029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783164,0.000100120924,0.00043213993,0.0007138746,0.000634365,0.0002878759],"domain_scores_gemma":[0.9989032,0.00024541625,0.00028623128,0.0003544694,0.0001685799,0.000042086984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018459117,0.00022597077,0.00026475568,0.00070698606,0.00017374674,0.00017314861,0.0008356362,0.00017801658,0.0000032154346],"category_scores_gemma":[0.00007055851,0.00017988081,0.000065647495,0.0008438472,0.0003150389,0.00045843737,0.00027331835,0.00074488425,0.0000056283475],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020888612,0.00008163653,0.00082109164,0.000106578365,0.0000102159465,0.000044724824,0.0039775367,0.010255321,0.0031511404,0.105316244,0.0000041942108,0.87621045],"study_design_scores_gemma":[0.0006289707,0.000949181,0.03487318,0.0010491596,0.000012913787,0.00026629068,0.000004537114,0.7559607,0.002561879,0.20271976,0.00027038218,0.00070301647],"about_ca_topic_score_codex":0.000036351652,"about_ca_topic_score_gemma":0.00011081154,"teacher_disagreement_score":0.96994823,"about_ca_system_score_codex":0.00014510729,"about_ca_system_score_gemma":0.00009868842,"threshold_uncertainty_score":0.73353267},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005878314,0.0021953797,0.99294454,0.0006963031,0.0017916118,0.00067918387,0.000022527893,0.00016352275,0.0015010828],"genre_scores_gemma":[0.015684966,0.00020358652,0.97886837,0.004399752,0.00072600215,0.000013670608,0.00002755716,0.000041865253,0.00003421787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959056,0.000030273526,0.0005739066,0.0018197568,0.00067274086,0.0009977252],"domain_scores_gemma":[0.99606735,0.0015116404,0.0003055544,0.0017023658,0.00013189334,0.0002811815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001293551,0.00062482833,0.00068028766,0.0005067301,0.00044300949,0.0006946124,0.0026787196,0.00048646674,0.000008827216],"category_scores_gemma":[0.00008402248,0.000547511,0.00013077226,0.00055377226,0.000700425,0.000579915,0.001652376,0.0011008289,0.000005209108],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103706425,0.000019823268,0.000070821705,0.000036389665,0.000009747306,0.000070384805,0.00018907266,0.009906242,4.633666e-7,0.1837109,0.000069846545,0.80590594],"study_design_scores_gemma":[0.00016996056,0.0001509105,0.00008087921,0.0003162131,0.0000084851545,0.00006956491,9.4182276e-8,0.64462185,0.000009233741,0.34860477,0.0054503465,0.00051770837],"about_ca_topic_score_codex":0.000042580403,"about_ca_topic_score_gemma":0.00016306483,"teacher_disagreement_score":0.8053882,"about_ca_system_score_codex":0.00015428253,"about_ca_system_score_gemma":0.00021056876,"threshold_uncertainty_score":0.9996976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025183705,0.000052391722,0.9942265,0.0008356293,0.0006700212,0.000535375,0.0000040653126,0.00021437094,0.0034364555],"genre_scores_gemma":[0.17975092,0.00003528368,0.8177987,0.001915646,0.00016575055,0.00005166726,0.000022263157,0.000025586567,0.00023423578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997286,0.000036467212,0.0006908861,0.0006131587,0.0010555465,0.00031791415],"domain_scores_gemma":[0.9977235,0.00022374337,0.0005251833,0.00091067865,0.0005029923,0.000113908514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006137789,0.00035022493,0.0004078273,0.0015324085,0.00010901435,0.00034215936,0.0016252171,0.00024812663,0.000058627313],"category_scores_gemma":[0.00012461338,0.00031678798,0.00011049034,0.0005402841,0.00023168504,0.001591144,0.00035512305,0.00041665934,0.000069201844],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006578819,0.00006411465,0.000004743076,0.00005365838,0.0000028986028,0.0000056079234,0.00019908627,0.0030315018,0.00024037733,0.0062578954,0.00018884496,0.9899447],"study_design_scores_gemma":[0.0011855861,0.0018195945,0.00004406015,0.0011020919,0.000013036901,0.000018001716,1.12814234e-7,0.76146984,0.057264943,0.16645809,0.009648231,0.00097640144],"about_ca_topic_score_codex":0.000032467782,"about_ca_topic_score_gemma":0.0000014978378,"teacher_disagreement_score":0.9889683,"about_ca_system_score_codex":0.0008266937,"about_ca_system_score_gemma":0.0003602223,"threshold_uncertainty_score":0.9999284},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009204331,0.00038231397,0.9845662,0.00000948625,0.0011501793,0.00026026397,0.000010788488,0.00010760649,0.004308798],"genre_scores_gemma":[0.98369086,0.000019077985,0.015713623,0.000010180802,0.00023817139,0.000002707098,0.000029485083,0.000033978227,0.00026194632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878883,0.000013610663,0.00044407925,0.00033663723,0.00022778654,0.00018905048],"domain_scores_gemma":[0.9992664,0.00007187937,0.00019623042,0.00029071077,0.0001238389,0.000050973722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038015447,0.00022496059,0.00031514332,0.0003927878,0.0000721606,0.00004982134,0.00041786846,0.00016287666,0.00001490694],"category_scores_gemma":[0.000039907798,0.0002286904,0.00006106017,0.0001820512,0.00017989159,0.00015562517,0.00018462796,0.00045590248,0.000013458509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054582165,0.00004301534,0.00071801594,0.00033657785,0.000029952367,0.000008006628,0.0015871044,0.118951574,0.004620538,0.0034960478,0.00000973765,0.87019396],"study_design_scores_gemma":[0.00017395128,0.0000462615,0.00033456035,0.00042525545,0.000009853055,0.0000060647794,0.0000010738738,0.9948845,0.0005600405,0.0031239926,0.00019054864,0.00024388728],"about_ca_topic_score_codex":0.000075534175,"about_ca_topic_score_gemma":0.0014845446,"teacher_disagreement_score":0.97448653,"about_ca_system_score_codex":0.00031012803,"about_ca_system_score_gemma":0.00009475129,"threshold_uncertainty_score":0.9325724},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016119657,0.00009424398,0.9519368,0.000027706043,0.0010110507,0.0002542847,0.00000415316,0.00006972192,0.03048241],"genre_scores_gemma":[0.9818509,0.00001659395,0.015325288,0.0014310188,0.0005498634,0.00000753948,0.000045177672,0.000024307281,0.00074926676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875396,0.000042378862,0.00030252142,0.00040416015,0.00024083578,0.00025612308],"domain_scores_gemma":[0.9992175,0.00011984378,0.0001884794,0.0002656269,0.00011204151,0.00009648511],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000392144,0.00022395175,0.0002006599,0.0004143275,0.00017521216,0.0001445041,0.00020287708,0.00021493682,0.0011085301],"category_scores_gemma":[0.00003893432,0.00019886406,0.000028553919,0.00010720319,0.00029337552,0.0005508939,0.00008662133,0.00031238497,0.00007554162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011816975,0.00001848488,0.00055044773,0.000013396742,0.000006208936,0.0000023388425,0.0665807,0.00042087896,0.00020310964,0.013477229,0.0000111412855,0.9187043],"study_design_scores_gemma":[0.0016492163,0.0014690232,0.041657336,0.0012681305,0.000058540823,0.00025763523,0.0002462731,0.92937607,0.00054421765,0.014577065,0.0067743403,0.002122159],"about_ca_topic_score_codex":0.000043866283,"about_ca_topic_score_gemma":0.00010365261,"teacher_disagreement_score":0.96573126,"about_ca_system_score_codex":0.00009123903,"about_ca_system_score_gemma":0.00003558248,"threshold_uncertainty_score":0.9998046},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006763472,0.0009864079,0.98955023,0.0001038847,0.00074375886,0.00021317748,0.00002119715,0.00015420387,0.0014636845],"genre_scores_gemma":[0.778319,0.00012844577,0.22071612,0.0003543037,0.0003871713,0.0000037413863,0.000012533945,0.000024855664,0.000053820662],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969462,0.000052766605,0.0005001667,0.0011313872,0.00085559185,0.00051385467],"domain_scores_gemma":[0.99776757,0.0007043104,0.00031094815,0.00084800745,0.0002074622,0.00016171293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015516803,0.00043947969,0.00049527874,0.00057024165,0.00023969142,0.0002408462,0.0016560904,0.00024508894,0.000013554928],"category_scores_gemma":[0.000042728436,0.00039752517,0.00016144349,0.00068492215,0.0010208088,0.0005046865,0.0007970116,0.0005584435,0.0000034469053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002495139,0.00007728668,0.0007364134,0.00007740851,0.000034867106,0.000051418392,0.0009835091,0.001311632,0.00024373605,0.46775246,0.000019601624,0.5286867],"study_design_scores_gemma":[0.00053201657,0.00033977476,0.00351016,0.0004457752,0.000032613603,0.000119654294,2.7686897e-7,0.11817003,0.0032249906,0.8713817,0.0014154685,0.0008275219],"about_ca_topic_score_codex":0.000008944723,"about_ca_topic_score_gemma":0.000023450288,"teacher_disagreement_score":0.77155554,"about_ca_system_score_codex":0.00009654358,"about_ca_system_score_gemma":0.00020150917,"threshold_uncertainty_score":0.99984765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000041650683,0.0045523993,0.9869086,0.000055153472,0.002594952,0.00051382935,0.000003912572,0.00042910827,0.0049378537],"genre_scores_gemma":[0.17001157,0.00023073668,0.8276472,0.00036860272,0.0014627099,0.000030474213,0.000007660597,0.00012759026,0.00011347025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978163,0.00007154554,0.0005154485,0.0006038812,0.00038899225,0.00060380256],"domain_scores_gemma":[0.9985983,0.0005284953,0.00017452087,0.0004521558,0.0001467777,0.00009978456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010346589,0.00046295623,0.00056731404,0.00035077057,0.0001473762,0.00012175808,0.0004888193,0.0003878731,0.00004837502],"category_scores_gemma":[0.00010450933,0.0004613129,0.000105217456,0.00033011194,0.00017219693,0.0006324229,0.000081111364,0.0007170884,0.000026594282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027906694,0.000002494645,0.0000064843894,0.000027352526,0.000015607431,0.0000013996647,0.0001514068,0.58673936,0.0012854732,0.0007265775,0.000003551888,0.4110375],"study_design_scores_gemma":[0.0004039977,0.000042744035,0.000012003296,0.00018363998,0.000027582564,0.000039715964,1.2197016e-7,0.97765607,0.00204248,0.014744883,0.0043276334,0.00051914423],"about_ca_topic_score_codex":0.0000074723744,"about_ca_topic_score_gemma":0.000013680911,"teacher_disagreement_score":0.41051838,"about_ca_system_score_codex":0.00055504194,"about_ca_system_score_gemma":0.00006560626,"threshold_uncertainty_score":0.9997839},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000089217545,0.00030784612,0.98909664,0.000986722,0.0010000153,0.00026063013,0.0000012691719,0.00020602962,0.00805161],"genre_scores_gemma":[0.08594606,0.000058654543,0.9063314,0.0049057314,0.00066399336,0.0000098834225,0.000008759815,0.00004664168,0.0020288692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964848,0.000020656014,0.00038507325,0.0013626497,0.001227626,0.0005191916],"domain_scores_gemma":[0.9981006,0.0003219022,0.00026071924,0.00088195206,0.00027782025,0.00015702358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000590563,0.00046526463,0.0003870819,0.0008067232,0.00033570122,0.0007933328,0.0021158562,0.00021054571,0.000040153132],"category_scores_gemma":[0.00004832091,0.0004012536,0.00008686231,0.00081685354,0.00031676498,0.002014775,0.0007802198,0.0007063122,0.00006919746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069734147,0.000030923944,0.000021277325,0.000041372736,0.000017908165,0.00014211317,0.0016820767,0.24256441,0.00015610558,0.07087822,0.000053407497,0.6844052],"study_design_scores_gemma":[0.00029066476,0.00019136033,0.00006093571,0.00034842055,0.000008015578,0.00020686671,9.9195695e-8,0.9061272,0.001200759,0.0853121,0.0055207084,0.0007328379],"about_ca_topic_score_codex":0.00001394082,"about_ca_topic_score_gemma":0.000008251069,"teacher_disagreement_score":0.68367237,"about_ca_system_score_codex":0.00024932067,"about_ca_system_score_gemma":0.00033427437,"threshold_uncertainty_score":0.99984396},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082618673,0.00019922398,0.99455124,0.0009025597,0.0013872887,0.0013344514,0.00002585458,0.00022208646,0.0005511179],"genre_scores_gemma":[0.51448506,0.00001193851,0.48293978,0.0012302928,0.00078886724,0.00007488635,0.00030801288,0.000053753196,0.0001074183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555767,0.00008037042,0.000949637,0.001704757,0.0009085997,0.00079898105],"domain_scores_gemma":[0.99731636,0.0008526512,0.0005717358,0.0007506889,0.0002599337,0.00024865425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012978249,0.0006302285,0.0006705818,0.0007373083,0.00054434745,0.0008176847,0.0017932873,0.00041853887,0.000015235504],"category_scores_gemma":[0.00007149543,0.00061934197,0.00021901529,0.0005511949,0.0001659725,0.0010131488,0.0006415162,0.0004944437,0.000029256014],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086637185,0.000122038975,0.00001680806,0.00011663553,0.00003585152,0.000012748303,0.00039323507,0.021483159,0.0065056775,0.17495316,0.0002968332,0.79597723],"study_design_scores_gemma":[0.0011905325,0.0005029169,0.00004851267,0.00025066157,0.000021889848,0.00005275499,9.830303e-8,0.7201289,0.0082512265,0.26771185,0.0011700051,0.0006706789],"about_ca_topic_score_codex":0.000038372815,"about_ca_topic_score_gemma":0.000047288675,"teacher_disagreement_score":0.79530656,"about_ca_system_score_codex":0.00069888163,"about_ca_system_score_gemma":0.0003887994,"threshold_uncertainty_score":0.9996258},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002339267,0.0011291985,0.9753943,0.00091077207,0.002015908,0.000539314,0.0000045208512,0.00034334915,0.019428704],"genre_scores_gemma":[0.18679494,0.00013613855,0.80915487,0.0022565178,0.0011517131,0.000020783651,0.0000092387,0.00010405657,0.00037172216],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99411845,0.00006189089,0.0007113123,0.0021765912,0.0016055214,0.0013262372],"domain_scores_gemma":[0.9956582,0.0007439924,0.00040932812,0.0022281648,0.0005187275,0.00044156905],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015973287,0.0008394724,0.0007677347,0.0022224705,0.0004800798,0.0013956191,0.0051039034,0.00055431627,0.000019999019],"category_scores_gemma":[0.00007931334,0.0006593989,0.00024338638,0.001851422,0.0012659101,0.0008345609,0.0013466693,0.0013614566,0.00006429819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024423578,0.00011544427,0.00064831425,0.00016444732,0.00007781684,0.0007635402,0.0015699437,0.0061150715,0.0000701946,0.29390004,0.000033338903,0.6965174],"study_design_scores_gemma":[0.0037078098,0.003114163,0.0023317297,0.004958829,0.00011433622,0.0023258536,0.0000040847876,0.37502873,0.004566407,0.49441808,0.100875355,0.008554594],"about_ca_topic_score_codex":0.000065756205,"about_ca_topic_score_gemma":0.0007227882,"teacher_disagreement_score":0.68796283,"about_ca_system_score_codex":0.00027526822,"about_ca_system_score_gemma":0.00091149367,"threshold_uncertainty_score":0.999641},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007078732,0.00017867186,0.9843301,0.000593745,0.002702124,0.0004173995,0.000004540101,0.00017633478,0.011526273],"genre_scores_gemma":[0.047828127,0.00011113757,0.94296265,0.004032807,0.0010633245,0.000026699314,0.000027982178,0.00006712482,0.0038801776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955295,0.000033978722,0.00050069555,0.0017555322,0.0014695942,0.0007107549],"domain_scores_gemma":[0.99697334,0.00039760242,0.00032144153,0.001870696,0.0001837515,0.0002531945],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00058069115,0.00056776614,0.00046206138,0.0006634785,0.0004276063,0.0010779457,0.004044546,0.0002669833,0.00016739144],"category_scores_gemma":[0.00006603616,0.0004665818,0.000115546885,0.00039056863,0.00030114484,0.0012223236,0.0029732771,0.0007838742,0.0006206388],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005384662,0.000030731855,0.000007928487,0.000019828754,0.000008932389,0.00008249885,0.00023455652,0.0071304855,0.00006624027,0.02508786,0.00050408614,0.9668215],"study_design_scores_gemma":[0.0008493395,0.0006306553,0.00014990651,0.0017221657,0.000011832599,0.000057676207,2.4867373e-7,0.65878195,0.0017823738,0.30574358,0.028679978,0.0015903348],"about_ca_topic_score_codex":0.000068786576,"about_ca_topic_score_gemma":0.0000062957115,"teacher_disagreement_score":0.9652311,"about_ca_system_score_codex":0.00040882465,"about_ca_system_score_gemma":0.00026801563,"threshold_uncertainty_score":0.99995905},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000894667,0.00007346494,0.9953919,0.00039582688,0.0002484974,0.0004588876,0.000009415527,0.00014549239,0.0023818724],"genre_scores_gemma":[0.45483652,0.0000698845,0.5439066,0.00091174035,0.00012801442,0.000009760444,0.00007017714,0.000011445502,0.000055806704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973422,0.00004737652,0.00096130796,0.00059483416,0.00074342586,0.00031084943],"domain_scores_gemma":[0.9979634,0.00030529615,0.00054908067,0.00063083874,0.0004875589,0.00006380579],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008342253,0.00029969105,0.0004452162,0.0016844135,0.00006979696,0.0002769025,0.0012844724,0.00027493518,0.000010112276],"category_scores_gemma":[0.0003028839,0.00029610752,0.000087152715,0.000778504,0.00026845915,0.002278563,0.00032912934,0.0005961901,0.000009328174],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052311602,0.000025755482,0.000022754193,0.0000172276,0.0000017660195,0.0000073854108,0.0009389499,0.0011961472,0.0007505826,0.005780967,0.000006306925,0.99124694],"study_design_scores_gemma":[0.000756672,0.00046239595,0.0012348199,0.0021599105,0.0000068164168,0.00006338682,0.0000044268418,0.6728913,0.05301449,0.26835814,0.00030870203,0.0007388869],"about_ca_topic_score_codex":0.0000783044,"about_ca_topic_score_gemma":0.00024168524,"teacher_disagreement_score":0.990508,"about_ca_system_score_codex":0.00024654515,"about_ca_system_score_gemma":0.00026968637,"threshold_uncertainty_score":0.9999491},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019334736,0.00068954675,0.9912138,0.0005142022,0.0017391146,0.00044053106,0.0000026961416,0.00022786309,0.0032387539],"genre_scores_gemma":[0.6559134,0.0000732614,0.34203887,0.00075781904,0.00086229015,0.000008510083,0.0000047765084,0.000051151233,0.0002898898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957525,0.00007270091,0.00071682956,0.001808095,0.00082665804,0.00082318776],"domain_scores_gemma":[0.996603,0.00061325385,0.0004597582,0.0017233208,0.00033866012,0.00026197665],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018212706,0.00071931817,0.0007951518,0.0009468511,0.00053357176,0.0017456394,0.0028958581,0.00047530376,0.000005288694],"category_scores_gemma":[0.00018876677,0.0006166403,0.00013392416,0.00070894137,0.0008118997,0.0009063396,0.0018681103,0.00083184964,0.00003188663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062530785,0.00002546916,0.0008755331,0.00026100656,0.000032523574,0.000027631995,0.0055261296,0.05048202,0.0016642171,0.06610239,0.000013858135,0.87498295],"study_design_scores_gemma":[0.0002521846,0.00012866751,0.00065356673,0.00073334516,0.000006630733,0.00010165684,0.0000012123162,0.94319826,0.0022364138,0.050681584,0.0011913514,0.0008151125],"about_ca_topic_score_codex":0.000116852236,"about_ca_topic_score_gemma":0.00010183911,"teacher_disagreement_score":0.8927162,"about_ca_system_score_codex":0.0002753642,"about_ca_system_score_gemma":0.00054706034,"threshold_uncertainty_score":0.9996285},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002228368,0.00017252794,0.99334794,0.00015896901,0.00071015354,0.00057095726,0.0000026938533,0.00015868714,0.0026497224],"genre_scores_gemma":[0.19493069,0.000029823974,0.80442435,0.00022373431,0.00013829028,0.00001611962,5.3291825e-7,0.000019170117,0.00021730413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707204,0.000054142,0.00043985713,0.0014286168,0.00059535657,0.0004100124],"domain_scores_gemma":[0.99786377,0.00014386361,0.00016769633,0.0015368956,0.00013269942,0.00015507927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010241142,0.00038125532,0.00035076137,0.00074106094,0.0003988678,0.00047747674,0.0015944748,0.00019657117,0.000008575991],"category_scores_gemma":[0.000054457054,0.00036356744,0.000054802713,0.0005247222,0.0006030349,0.00081807596,0.00079196354,0.00067596964,0.000013581603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033381177,0.00006639933,0.000013721908,0.000011162613,0.000008193475,0.00063261617,0.0038814764,0.07920432,0.00002296681,0.02296144,0.000005177757,0.8931892],"study_design_scores_gemma":[0.0001433123,0.00016845154,0.00001574169,0.00004962139,0.000009113938,0.0031177998,0.0000012569408,0.8698247,0.00006476131,0.12613308,0.00010911922,0.0003630161],"about_ca_topic_score_codex":0.000060853446,"about_ca_topic_score_gemma":0.00007460294,"teacher_disagreement_score":0.8928262,"about_ca_system_score_codex":0.0001707386,"about_ca_system_score_gemma":0.00033617672,"threshold_uncertainty_score":0.9998816},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000114067116,0.00014334336,0.9944807,0.00067322934,0.0005687448,0.00031893986,0.00004838941,0.00016329357,0.0034892627],"genre_scores_gemma":[0.15093422,0.000075667536,0.84349316,0.002142507,0.00070797233,0.000010947054,0.00003745219,0.00006255882,0.0025354896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956883,0.000013605613,0.0005805109,0.0019855327,0.0009297935,0.00080226036],"domain_scores_gemma":[0.99697316,0.0003411381,0.0002524313,0.0019950606,0.00021063907,0.00022755231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010125933,0.000561006,0.00067828194,0.0010076982,0.00033967663,0.00075153954,0.0047586737,0.00035009132,0.000021438458],"category_scores_gemma":[0.00007615388,0.00051757065,0.00029825626,0.00076382403,0.0004440393,0.0006732495,0.00095720007,0.0006147702,0.00006220412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029524714,0.00004871706,0.00001715253,0.000053703625,0.000041791573,0.000062421655,0.0010122522,0.24933155,0.00034466747,0.011159998,0.00043100247,0.7374672],"study_design_scores_gemma":[0.00026995342,0.000102754784,0.0000057745197,0.00018930022,0.00001973121,0.000019592198,5.4128087e-8,0.8976532,0.0002538188,0.09916707,0.0017582024,0.0005605418],"about_ca_topic_score_codex":0.0000104286655,"about_ca_topic_score_gemma":0.00004005703,"teacher_disagreement_score":0.7369067,"about_ca_system_score_codex":0.0001936291,"about_ca_system_score_gemma":0.0010188583,"threshold_uncertainty_score":0.9997276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015698226,0.00030995128,0.9961428,0.0013044698,0.0005942527,0.00028932022,0.000022667193,0.00006126416,0.0011183019],"genre_scores_gemma":[0.35848063,0.000054992608,0.63956213,0.0012797867,0.000567116,0.0000023588404,0.00003969854,0.000010911242,0.0000023802859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717516,0.000068675625,0.0006893969,0.0004781666,0.0011868126,0.00040178755],"domain_scores_gemma":[0.99657935,0.0011823189,0.00067750283,0.0010843806,0.00037079322,0.00010563129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025301175,0.0002801051,0.0003317317,0.00039104966,0.00026995258,0.00039849343,0.002345142,0.00018637728,0.000018249346],"category_scores_gemma":[0.000380507,0.00020926239,0.00012832526,0.00077576196,0.00077511446,0.0024394207,0.0013092571,0.00075304543,0.000021698648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010548025,0.000012547925,0.00014303367,0.00006747281,0.000010370125,0.000002370814,0.0009836268,0.0055867075,0.000012119959,0.5675813,0.000007786882,0.4255821],"study_design_scores_gemma":[0.00026611038,0.00007134051,0.0031941694,0.00034073973,0.000018993922,0.000077406796,5.496325e-7,0.31427053,0.00046397364,0.6715335,0.009228351,0.0005342984],"about_ca_topic_score_codex":0.000009564857,"about_ca_topic_score_gemma":0.0000016131306,"teacher_disagreement_score":0.4250478,"about_ca_system_score_codex":0.000091216236,"about_ca_system_score_gemma":0.00030345187,"threshold_uncertainty_score":0.8533473},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035760816,0.000070338756,0.9913605,0.0004954741,0.00042545193,0.001443167,0.0000043179225,0.0003501799,0.005846979],"genre_scores_gemma":[0.0012874765,0.000008406224,0.99320704,0.00070039014,0.00049428275,0.000045914905,0.000034304416,0.00008347569,0.0041387235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945735,0.000035421475,0.0007516339,0.0018727615,0.001650336,0.0011163563],"domain_scores_gemma":[0.99593216,0.00092198513,0.0006317957,0.0016937768,0.00055993855,0.0002603132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016759349,0.00074275304,0.00065379526,0.0011145092,0.0004790421,0.0009219185,0.0034234675,0.0004239415,0.00001387208],"category_scores_gemma":[0.00008885818,0.0006446521,0.00013684804,0.00091408606,0.0008008597,0.00063835137,0.00085209863,0.00081471435,0.000052281754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017509456,0.000018185723,0.0000019442903,0.000051097857,0.00002245341,0.000025623845,0.00069963984,0.74312484,0.000049675848,0.008424956,0.00006233403,0.2475017],"study_design_scores_gemma":[0.00054315146,0.00084312784,0.000011296001,0.0006402226,0.00002423996,0.00009676333,2.4903375e-7,0.9802047,0.00015541786,0.0125276735,0.00413013,0.00082302873],"about_ca_topic_score_codex":0.000022935019,"about_ca_topic_score_gemma":0.000022321045,"teacher_disagreement_score":0.24667868,"about_ca_system_score_codex":0.0006210286,"about_ca_system_score_gemma":0.000931589,"threshold_uncertainty_score":0.99960047},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047286344,0.0009636007,0.992384,0.0028144591,0.0016439909,0.00039637307,0.0000012568125,0.00012818167,0.0011952517],"genre_scores_gemma":[0.8880058,0.00022208366,0.107209936,0.0029523883,0.0009740604,0.000036761485,0.0000077152745,0.000043551838,0.00054773997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694496,0.000063173466,0.0006137595,0.0010136246,0.0008429627,0.0005215081],"domain_scores_gemma":[0.996946,0.00066264014,0.0003764194,0.0015366254,0.00030161618,0.00017673412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007531961,0.0004372534,0.00046286985,0.00039628943,0.00041053703,0.00030618787,0.003909474,0.00030574255,0.000029593553],"category_scores_gemma":[0.000048969545,0.00032541377,0.00017697965,0.0008341686,0.0014415653,0.00036352006,0.00087556755,0.0009177558,0.000017023145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023243513,0.000020346915,0.00015187795,0.000006212792,0.000009309354,0.000014284323,0.00080739276,0.20331636,0.000016558139,0.05330632,0.000047227477,0.74230176],"study_design_scores_gemma":[0.00021734186,0.00010998916,0.0002088785,0.00022630699,0.000023003582,0.00003545717,4.7671617e-7,0.92430896,0.000037910944,0.07073675,0.003664238,0.00043071035],"about_ca_topic_score_codex":0.00006093416,"about_ca_topic_score_gemma":0.00026527297,"teacher_disagreement_score":0.8875329,"about_ca_system_score_codex":0.00013334256,"about_ca_system_score_gemma":0.00045856458,"threshold_uncertainty_score":0.9999198},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001705548,0.0004905927,0.99534136,0.0003210485,0.001212426,0.0005826323,0.0000077815275,0.00078160316,0.0012454849],"genre_scores_gemma":[0.03313572,0.000034053683,0.96474695,0.0011548195,0.0005120868,0.000022631188,0.000024586578,0.000047099133,0.00032203886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653554,0.00004562046,0.0005410205,0.0014312473,0.00063154637,0.00081502704],"domain_scores_gemma":[0.9969662,0.00031494955,0.00031646586,0.0016275943,0.0005115199,0.00026327797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013100791,0.000571408,0.00054546836,0.0009026185,0.00033540736,0.0006894627,0.0040366556,0.00043862092,0.00002530626],"category_scores_gemma":[0.00008611707,0.0005159623,0.00015210485,0.00058508816,0.00042976352,0.0010055271,0.0006860904,0.0006480227,0.000037146896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008309073,0.00007078144,0.000035203528,0.000029352743,0.0000133321255,0.0000073877914,0.0004539249,0.07147172,0.000114318056,0.0428441,0.00013326068,0.8848183],"study_design_scores_gemma":[0.0002207815,0.00023987022,0.000031404597,0.00019368996,0.0000083580435,0.000026773172,7.9000124e-8,0.9231653,0.0020583025,0.06501795,0.008313333,0.0007241578],"about_ca_topic_score_codex":0.000013756494,"about_ca_topic_score_gemma":0.00001077284,"teacher_disagreement_score":0.8840941,"about_ca_system_score_codex":0.00023622806,"about_ca_system_score_gemma":0.00050685584,"threshold_uncertainty_score":0.9997292},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000038133933,0.00053612783,0.9687822,0.0014487676,0.0017247202,0.00021721564,0.0000012815244,0.0002579137,0.027027966],"genre_scores_gemma":[0.024870371,0.00012427148,0.9699559,0.0036608211,0.0004963771,0.0000037771097,0.0000016110558,0.00004149419,0.00084538077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575186,0.00002092568,0.0005284872,0.0017431031,0.0011152651,0.000840375],"domain_scores_gemma":[0.9973868,0.00052284944,0.00020809555,0.0014857167,0.00020660256,0.00018993788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004328784,0.00055057707,0.00053184375,0.00046715324,0.0003141046,0.00076586445,0.0035077338,0.00025261016,0.00008022834],"category_scores_gemma":[0.00017666159,0.0004974197,0.00016158485,0.00061095925,0.00074276794,0.0016519296,0.0014583173,0.0011178275,0.00018667606],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011546642,0.000019593108,0.0000067109117,0.000010690086,0.0000035419725,0.00012696597,0.0004803421,0.0048368736,0.00006863172,0.047827132,0.000035208854,0.94658315],"study_design_scores_gemma":[0.00026568025,0.00010821181,0.000037719317,0.000593034,0.000005018535,0.00018330583,1.3654525e-7,0.71198493,0.0024544627,0.27197406,0.011575049,0.0008183691],"about_ca_topic_score_codex":0.0000035309847,"about_ca_topic_score_gemma":0.000004533327,"teacher_disagreement_score":0.9457648,"about_ca_system_score_codex":0.0002500574,"about_ca_system_score_gemma":0.00018527881,"threshold_uncertainty_score":0.99974775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00097479415,0.00020738332,0.99308187,0.0024285673,0.0014966531,0.0005902959,0.000009366084,0.0003910004,0.000820093],"genre_scores_gemma":[0.43047607,0.00004709057,0.566258,0.002236505,0.00034633846,0.000031502103,0.000041433228,0.000040806488,0.0005222598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956779,0.000038066668,0.0006786641,0.0016860722,0.0009625023,0.00095681206],"domain_scores_gemma":[0.99737793,0.00037700095,0.00025786433,0.0015013961,0.00032075058,0.00016504066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002013744,0.0005387789,0.00052405853,0.0010887085,0.00014823055,0.0004522,0.0039501926,0.0004912438,0.000005236605],"category_scores_gemma":[0.00027961613,0.00052296516,0.000096822405,0.0014798538,0.00051629974,0.0006396036,0.0019159018,0.0010081071,0.00007262413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015783533,0.000040337905,0.00016000406,0.000016227543,0.000007540581,0.00013432957,0.0002999709,0.177929,0.0003493573,0.05662611,0.00010974977,0.7643116],"study_design_scores_gemma":[0.0006524537,0.00056494685,0.005753375,0.0008547188,0.0000085005495,0.000090177884,6.71681e-7,0.90946317,0.006987206,0.06730265,0.006703004,0.0016191113],"about_ca_topic_score_codex":0.000055463894,"about_ca_topic_score_gemma":0.0003013832,"teacher_disagreement_score":0.76269245,"about_ca_system_score_codex":0.0010012538,"about_ca_system_score_gemma":0.00035706474,"threshold_uncertainty_score":0.9997222},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011330068,0.0026833527,0.97424775,0.0005378051,0.00060656865,0.0010546807,0.00003303029,0.000060119797,0.00944663],"genre_scores_gemma":[0.6888515,0.0012345286,0.29072207,0.0022761798,0.005137501,0.000075218864,0.00045488743,0.0003021274,0.010946008],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997486,0.000016344458,0.00028697177,0.001108387,0.00056182995,0.00054046174],"domain_scores_gemma":[0.99869186,0.000014490635,0.00016368428,0.00083765446,0.000163303,0.00012900075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002745019,0.0004395279,0.00032558668,0.00023349911,0.00011988224,0.0001186645,0.00088865496,0.00026915615,0.000114897375],"category_scores_gemma":[0.000017001843,0.00037812686,0.000078437464,0.0001616451,0.00047975173,0.000010961766,0.0004458711,0.00026844774,0.000047417543],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019327411,0.0001947462,0.0010381043,0.00016160616,0.0003772373,0.00022270124,0.00060564507,0.06429526,0.21303481,0.0002050614,0.0000873711,0.71958417],"study_design_scores_gemma":[0.010780507,0.009809269,0.013685383,0.0016388063,0.0004248549,0.00075577985,0.000003765587,0.021156384,0.14548305,0.013392786,0.7715594,0.011310026],"about_ca_topic_score_codex":0.0000061439086,"about_ca_topic_score_gemma":0.00021672658,"teacher_disagreement_score":0.77147204,"about_ca_system_score_codex":0.00009526909,"about_ca_system_score_gemma":0.00032541336,"threshold_uncertainty_score":0.9998671},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032154454,0.000977022,0.9928362,0.0001921231,0.0013288041,0.0010413707,0.000031113235,0.00008161669,0.00029631628],"genre_scores_gemma":[0.7144436,0.000046024426,0.28481108,0.00020457064,0.00014639217,0.000023270633,0.0000031931581,0.000022324179,0.00029949818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99516255,0.00008269375,0.0010270058,0.0023551297,0.0008797871,0.0004928322],"domain_scores_gemma":[0.9952844,0.00022591789,0.00055269146,0.003152048,0.00054175284,0.00024318413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002000079,0.0004450417,0.0007217758,0.0003256658,0.00018205425,0.00030876393,0.0019243825,0.00026794864,0.0000055413966],"category_scores_gemma":[0.00025992445,0.00041177185,0.00010003416,0.0006270923,0.00047123883,0.00039806045,0.0010068978,0.0003967245,0.00001667978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017981401,0.00028831052,0.0010570385,0.0010116609,0.000029484121,0.00003948634,0.0028574814,0.3762043,0.0042548743,0.0077782823,0.00008206091,0.60637903],"study_design_scores_gemma":[0.00013369012,0.00011926612,0.0006026111,0.0007548666,0.0000072370644,0.000035059704,3.1822265e-7,0.99209267,0.0018283048,0.0015717172,0.0023493122,0.00050492235],"about_ca_topic_score_codex":0.00018617215,"about_ca_topic_score_gemma":0.000022401822,"teacher_disagreement_score":0.7112282,"about_ca_system_score_codex":0.0005014686,"about_ca_system_score_gemma":0.00019518346,"threshold_uncertainty_score":0.9998334},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019904213,0.00029690142,0.9964243,0.00020296246,0.0005842394,0.00021222439,0.00034415227,0.0000983327,0.0016378262],"genre_scores_gemma":[0.03772532,0.000046831035,0.9607994,0.0004446903,0.00042511022,0.000008463475,0.00029596034,0.000040000385,0.00021424433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962821,0.000026119298,0.0006123461,0.0018782895,0.0007227168,0.00047845233],"domain_scores_gemma":[0.99479103,0.00050305645,0.00046607084,0.0039443937,0.0001445385,0.00015089157],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00069555035,0.00042754514,0.00052758964,0.00040906767,0.00016019745,0.00028861617,0.008830017,0.0002133528,0.00007656631],"category_scores_gemma":[0.000061857536,0.00039755157,0.000069924834,0.00041683973,0.00049132144,0.00077424356,0.004168669,0.00043248662,0.000065629916],"study_design_candidate":"design_other","study_design_consensus":null,"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.3775814e-7,0.000025487147,0.00006203579,0.0000100999705,0.00001639971,0.000022761675,0.0007178531,0.0007083215,0.00012439865,0.0011443283,0.000084385036,0.99708307],"study_design_scores_gemma":[0.0001771289,0.00008415549,0.00011207245,0.0006001397,0.000018330327,0.000015692593,4.0142126e-7,0.9505338,0.0009893161,0.045558672,0.0013644886,0.00054576754],"about_ca_topic_score_codex":0.0006792919,"about_ca_topic_score_gemma":0.00010719827,"teacher_disagreement_score":0.9965373,"about_ca_system_score_codex":0.000123332,"about_ca_system_score_gemma":0.00043589302,"threshold_uncertainty_score":0.99984765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014859613,0.00010904503,0.9831155,0.0004703584,0.0023544743,0.0007176329,0.0000135399805,0.00021869339,0.012999288],"genre_scores_gemma":[0.007385597,0.00003174037,0.9871194,0.0010122855,0.0008189143,0.00006449223,0.000022027114,0.000046535068,0.003499004],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970835,0.000011808057,0.00035895425,0.0013648495,0.0005191458,0.00066174415],"domain_scores_gemma":[0.9980474,0.00020427929,0.00020850524,0.0012534416,0.00016852199,0.000117832235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007316057,0.00039248404,0.0003421071,0.0008698087,0.00032512652,0.0006485938,0.0035443453,0.00018439667,0.000022604781],"category_scores_gemma":[0.00006391009,0.00036138075,0.00012926916,0.0005178232,0.00032726114,0.0010707655,0.001505744,0.0004204165,0.000043062297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029521043,0.000025712681,0.0000078495295,0.000040668412,0.000014627808,0.000017232313,0.00035005153,0.00053111796,0.00001836488,0.25682685,0.00014390257,0.74202067],"study_design_scores_gemma":[0.00046482874,0.00037254803,0.0001058425,0.0003566981,0.000021785017,0.000032221407,1.7294236e-7,0.3720549,0.0008510108,0.5560962,0.06845441,0.0011894221],"about_ca_topic_score_codex":0.000021491971,"about_ca_topic_score_gemma":0.00006390157,"teacher_disagreement_score":0.74083126,"about_ca_system_score_codex":0.00017094487,"about_ca_system_score_gemma":0.0003283595,"threshold_uncertainty_score":0.99988383},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021902079,0.0003542788,0.99600047,0.00037826,0.0017279341,0.0011162773,0.0000047971375,0.000062281484,0.00013666444],"genre_scores_gemma":[0.95971,0.0000037560637,0.03965215,0.00008279287,0.0003024146,0.000032250235,0.000012774545,0.000014272645,0.00018961498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743515,0.00005701758,0.0006431329,0.0007311919,0.0007918211,0.00034170813],"domain_scores_gemma":[0.9967585,0.0014237898,0.0005833582,0.00083311205,0.0003502329,0.000050974522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006464337,0.0003179545,0.00048473777,0.00036678536,0.0002745983,0.00044954306,0.0019300308,0.00021371835,0.0000033811089],"category_scores_gemma":[0.000088394576,0.00021760438,0.0001365974,0.00048806763,0.00025144854,0.0006179126,0.00032598633,0.00029168307,0.000001778997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004205537,0.00004741652,0.000098410135,0.000102722326,0.000008997937,3.6146523e-7,0.0019548284,0.90412,0.00016291611,0.0101413075,0.000027788046,0.08333102],"study_design_scores_gemma":[0.00032795043,0.00014754801,0.0009817891,0.00026719726,0.000011297474,0.000001260011,0.000001365555,0.9595806,0.0013862365,0.03680794,0.00026062442,0.00022617714],"about_ca_topic_score_codex":0.00003853997,"about_ca_topic_score_gemma":0.00015657379,"teacher_disagreement_score":0.95949095,"about_ca_system_score_codex":0.0005949523,"about_ca_system_score_gemma":0.0011818195,"threshold_uncertainty_score":0.88736486},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020110063,0.0006693332,0.9957952,0.00014808722,0.00061598903,0.00029810905,0.0000049066803,0.0005645549,0.0018837214],"genre_scores_gemma":[0.082889855,0.000023433367,0.9152378,0.0013197596,0.00041901067,0.000005024594,0.0000056452786,0.000053567765,0.000045921497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572587,0.000054581356,0.0006307086,0.0017005884,0.00086203974,0.0010262023],"domain_scores_gemma":[0.9971377,0.00059246056,0.00039251617,0.0014516464,0.00020611008,0.00021954728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013611026,0.00070518063,0.0006262025,0.000906941,0.00059575326,0.0008615081,0.0033176905,0.0005996489,0.000010501901],"category_scores_gemma":[0.000084525745,0.00070352585,0.00015924136,0.00071415293,0.0005789675,0.00049322913,0.00073544186,0.0014729575,0.000004915819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039847714,0.0000075234807,0.000019231267,0.000016460392,0.000003914384,0.00006536802,0.00006954434,0.7400506,0.000046307818,0.009341832,0.000006478649,0.2503687],"study_design_scores_gemma":[0.00009671669,0.00007986475,0.0000017057371,0.001433575,0.000012206484,0.00004740975,2.0220911e-8,0.902596,0.00094345515,0.09374272,0.000312215,0.000734131],"about_ca_topic_score_codex":0.00004583901,"about_ca_topic_score_gemma":0.000010197168,"teacher_disagreement_score":0.2496346,"about_ca_system_score_codex":0.00045580257,"about_ca_system_score_gemma":0.0010070045,"threshold_uncertainty_score":0.9995416},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004717738,0.6074088,0.3840966,0.00047708195,0.00079753995,0.0009865996,0.0000071574636,0.00041353033,0.0010949522],"genre_scores_gemma":[0.96843433,0.021253508,0.009569091,0.00021279664,0.0003215829,0.00003143325,0.000030261686,0.000116622134,0.000030383466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722433,0.00006967975,0.00056136324,0.00079652324,0.00047130254,0.0008768071],"domain_scores_gemma":[0.9981913,0.00036625323,0.00014237332,0.0009921052,0.00011153324,0.0001964447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009802713,0.0006247214,0.00067674933,0.000403993,0.0001682065,0.00020092027,0.0009347349,0.00059000624,0.00001802671],"category_scores_gemma":[0.000026887355,0.0006349312,0.00006959029,0.00025697539,0.0007260395,0.0004783494,0.00042845675,0.0014485198,0.000007566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003300352,0.000007308939,0.00003328797,0.00013350934,0.0000071446816,0.000012367888,0.0010536126,0.54169714,0.000006253173,0.00015910847,0.000004942456,0.45688203],"study_design_scores_gemma":[0.0002919888,0.000046459456,0.00028416503,0.0016584023,0.000016079637,0.00007826807,0.000005956388,0.9856051,0.000037208567,0.0042418726,0.0070220185,0.0007124768],"about_ca_topic_score_codex":0.000014502945,"about_ca_topic_score_gemma":0.001437814,"teacher_disagreement_score":0.96371657,"about_ca_system_score_codex":0.00046646333,"about_ca_system_score_gemma":0.000112804555,"threshold_uncertainty_score":0.9996102},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022253438,0.0002688953,0.99442166,0.0004935445,0.0030460602,0.00080234243,0.00028856276,0.00031309974,0.00014327893],"genre_scores_gemma":[0.011020989,0.000020011663,0.98673517,0.0014365457,0.00053703657,0.00004055834,0.00016884,0.000040356157,4.7225268e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99512607,0.000035473542,0.0006719545,0.0020475665,0.0011658747,0.00095305085],"domain_scores_gemma":[0.9959195,0.0005509512,0.00040562765,0.0023510165,0.00042952856,0.00034337532],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011793174,0.00073438673,0.00065185496,0.0014688374,0.00063770835,0.0014322472,0.0056247944,0.0006496898,0.000023813096],"category_scores_gemma":[0.0001433982,0.00070223486,0.00046685187,0.001649811,0.0011833278,0.0013819932,0.0011634032,0.0011940803,0.000016002406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012255488,0.00006675381,0.000153934,0.00007027156,0.00001817456,0.00002593785,0.00012827413,0.001652794,0.0006228006,0.9435955,0.000046878635,0.053606376],"study_design_scores_gemma":[0.0005418551,0.00018809142,0.00012368646,0.0001474037,0.00001860322,0.000012569037,5.2115563e-8,0.07253417,0.009117499,0.90242517,0.013959534,0.0009313627],"about_ca_topic_score_codex":0.000012943286,"about_ca_topic_score_gemma":0.0002421503,"teacher_disagreement_score":0.070881374,"about_ca_system_score_codex":0.00011062983,"about_ca_system_score_gemma":0.00055544736,"threshold_uncertainty_score":0.99975526},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036666517,0.0018900267,0.83561033,0.0012359234,0.0055007315,0.00056268554,0.000021095146,0.00010139001,0.15141116],"genre_scores_gemma":[0.7631602,0.00013371478,0.10233048,0.012285877,0.0028103017,0.0000445428,0.000044145534,0.00017868832,0.119012006],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780726,0.000052521442,0.00032927445,0.00096986425,0.00039416732,0.00044693335],"domain_scores_gemma":[0.9984413,0.000624631,0.0002136338,0.0004977531,0.0000868241,0.00013587748],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007173269,0.00035093472,0.00043961772,0.00037158822,0.000132514,0.00013904259,0.00054700987,0.00029616218,0.00022517281],"category_scores_gemma":[0.00006599242,0.00030506952,0.00006000218,0.00013207496,0.00053763844,0.0000653797,0.00022671577,0.0005726666,0.0002613594],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019324361,0.000024460714,0.0011067505,0.000030609604,0.00005480195,0.000103456274,0.015044425,0.00018530535,0.0000124164535,0.010306754,0.00097177364,0.9721399],"study_design_scores_gemma":[0.005392511,0.0017147094,0.08654705,0.004609691,0.00022226041,0.00085146085,0.00001534417,0.033631753,0.0009971383,0.4931841,0.364624,0.00821001],"about_ca_topic_score_codex":0.000028584003,"about_ca_topic_score_gemma":0.000023358996,"teacher_disagreement_score":0.9639299,"about_ca_system_score_codex":0.00020775021,"about_ca_system_score_gemma":0.00012368988,"threshold_uncertainty_score":0.99994016},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001369175,0.0003129889,0.994052,0.0013060239,0.0013784508,0.0011325292,0.0000040459204,0.0002483938,0.0015518821],"genre_scores_gemma":[0.7866579,0.0000065920462,0.2101388,0.0013468765,0.001180751,0.000061081155,0.00001109901,0.000048087575,0.0005487555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961547,0.00004479572,0.0005455665,0.0015191002,0.0009393351,0.00079650636],"domain_scores_gemma":[0.9975659,0.0006135675,0.0003840554,0.00080916187,0.00041130005,0.00021596688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008395207,0.0005518052,0.0006941329,0.00046045845,0.0003041367,0.00070635206,0.001916843,0.00035390846,0.0000044149233],"category_scores_gemma":[0.00005515899,0.00041619362,0.00016848855,0.00040270755,0.00062072603,0.00046950165,0.0003063135,0.00054603984,0.000035724155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003046612,0.000051124818,0.000032819447,0.000057499037,0.000027148126,0.000056678502,0.00043645847,0.02448437,0.000020110274,0.4191875,0.00007198791,0.55554384],"study_design_scores_gemma":[0.0010747499,0.0007065128,0.000038337726,0.000066899185,0.00001737941,0.000111128524,2.1867945e-7,0.86682904,0.00007004677,0.118272275,0.012207457,0.000605942],"about_ca_topic_score_codex":0.00002575983,"about_ca_topic_score_gemma":0.00019092856,"teacher_disagreement_score":0.8423447,"about_ca_system_score_codex":0.00030209005,"about_ca_system_score_gemma":0.00061200303,"threshold_uncertainty_score":0.999829},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007901525,0.00046245664,0.99628586,0.00033289203,0.0013592705,0.0009329664,0.000016645105,0.00016500916,0.00036589475],"genre_scores_gemma":[0.7459184,0.00007426039,0.25028166,0.0024466258,0.00092392875,0.0000592579,0.00008855847,0.0000650431,0.00014225197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961308,0.00005078629,0.00067237247,0.0016756175,0.0006677052,0.0008026958],"domain_scores_gemma":[0.997591,0.00049393927,0.0005472019,0.000673362,0.00049788196,0.00019656791],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088272954,0.0005973581,0.0006360849,0.00059036934,0.00057603564,0.00055430975,0.001315007,0.0005611734,0.000012527057],"category_scores_gemma":[0.000013509583,0.00057611434,0.00017088822,0.000513377,0.0005494876,0.0006674202,0.0006075132,0.00063845917,0.000005068895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059017995,0.00006255846,0.000083272535,0.00008703019,0.000024000896,0.00008792147,0.00084991194,0.012730941,0.0000044751314,0.018558491,0.00009084605,0.9673615],"study_design_scores_gemma":[0.0006369044,0.00019376559,0.00008042413,0.00025709832,0.000025273372,0.00003277167,5.235484e-7,0.958095,0.000015553249,0.03914859,0.0008886821,0.0006254119],"about_ca_topic_score_codex":0.000015969088,"about_ca_topic_score_gemma":0.00001994649,"teacher_disagreement_score":0.96673614,"about_ca_system_score_codex":0.00026524405,"about_ca_system_score_gemma":0.0005297309,"threshold_uncertainty_score":0.999669},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012524221,0.000236443,0.9968311,0.00014060267,0.00076477806,0.0011385219,0.00009893757,0.00016776148,0.00049660867],"genre_scores_gemma":[0.026831953,0.0000090408885,0.97167915,0.00050753856,0.00050264347,0.000053435742,0.000057776746,0.000041829426,0.00031661004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956621,0.00004898286,0.00054033165,0.0019087829,0.0012518918,0.00058793585],"domain_scores_gemma":[0.99618787,0.000938743,0.00031529207,0.0019297206,0.000410878,0.00021747134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084006204,0.0005486944,0.00059062854,0.0009506818,0.0004368123,0.00025540762,0.0017237217,0.00013379786,0.000017326398],"category_scores_gemma":[0.00013778305,0.00042415268,0.00008048523,0.0009923414,0.0004529973,0.0017822672,0.00067636993,0.00051117997,0.000014476759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098770535,0.00092981476,0.006410483,0.00015748374,0.000106336774,0.0004190325,0.0035657103,0.10671686,0.000031614512,0.23991984,0.000262054,0.641382],"study_design_scores_gemma":[0.0013967311,0.0033841669,0.0011204461,0.00038546053,0.000039780563,0.00018976588,0.0000030310712,0.93763006,0.00019201545,0.011755552,0.042121507,0.0017814906],"about_ca_topic_score_codex":0.000029641966,"about_ca_topic_score_gemma":0.00019190977,"teacher_disagreement_score":0.8309132,"about_ca_system_score_codex":0.0001973534,"about_ca_system_score_gemma":0.00042345075,"threshold_uncertainty_score":0.999821},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004958598,0.0005616814,0.9948082,0.00039480135,0.0014197852,0.0014827306,0.00019018995,0.00029128615,0.0008017313],"genre_scores_gemma":[0.007577422,0.00012456329,0.9897533,0.00083845877,0.0008956719,0.00007964715,0.00044072498,0.00007890418,0.00021130318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925164,0.00018952353,0.0010006828,0.0028074756,0.002342865,0.0011430427],"domain_scores_gemma":[0.99490356,0.0012157797,0.0004166772,0.0016969423,0.0012731176,0.0004938997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033223247,0.00075516547,0.0008149204,0.0016301002,0.00069547497,0.0009278415,0.0036260837,0.00025998935,0.000040764164],"category_scores_gemma":[0.000343798,0.00074506743,0.00017888061,0.0010331689,0.00093131664,0.001868172,0.0014645974,0.0008479487,0.000012616759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033206037,0.00014297571,0.000025833353,0.00013613135,0.000028029828,0.00003128739,0.0005284896,0.4824291,0.0000408515,0.023206418,0.00012126473,0.49327645],"study_design_scores_gemma":[0.0006310903,0.00025614773,0.00006163182,0.00019887641,0.000017622291,0.00004766804,0.0000017215834,0.9833901,0.00023194702,0.013193277,0.0011545668,0.0008153801],"about_ca_topic_score_codex":0.0002293176,"about_ca_topic_score_gemma":0.00005265928,"teacher_disagreement_score":0.500961,"about_ca_system_score_codex":0.0007375144,"about_ca_system_score_gemma":0.001683467,"threshold_uncertainty_score":0.99950004},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008537296,0.00021786807,0.97734404,0.00031014637,0.0029387171,0.00066058134,0.0000052231067,0.0002578626,0.018180195],"genre_scores_gemma":[0.79587096,0.0000035422054,0.19242299,0.0021178941,0.0017122683,0.000029835575,0.0000068277222,0.00010690443,0.007728809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944963,0.00008790436,0.000726224,0.0022044554,0.0015349062,0.0009502411],"domain_scores_gemma":[0.9965024,0.0008540593,0.00030510148,0.0016720018,0.00036984094,0.00029657292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092374854,0.00083252304,0.000727572,0.001496808,0.00041885438,0.0010239372,0.0040384014,0.00035154133,0.000014910607],"category_scores_gemma":[0.000074305746,0.00072929746,0.0002238854,0.00072128896,0.00019134731,0.00040694408,0.0010646406,0.0010464275,0.00007992749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049151304,0.000036231806,0.00005239427,0.00003358057,0.0000075656917,0.00006834353,0.0007886868,0.80066305,0.00002921178,0.100302555,0.000080044854,0.09793339],"study_design_scores_gemma":[0.0001861463,0.0003556218,0.00026990837,0.0009324308,0.0000058418673,0.000014658971,3.9884517e-7,0.95901483,0.0006301446,0.027509471,0.010183152,0.0008973943],"about_ca_topic_score_codex":0.000058732505,"about_ca_topic_score_gemma":0.000064928245,"teacher_disagreement_score":0.79578555,"about_ca_system_score_codex":0.00074957387,"about_ca_system_score_gemma":0.0004986645,"threshold_uncertainty_score":0.99951583},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053239448,0.0011095115,0.99663734,0.00014114655,0.00067213626,0.00022657188,0.0000015243869,0.00032975772,0.0008287792],"genre_scores_gemma":[0.01605545,0.000026991695,0.9833003,0.00025339075,0.00019381431,0.0000035393793,9.5337657e-7,0.000027863865,0.00013764428],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971138,0.000025878968,0.0002969035,0.001255018,0.0007051177,0.00060323044],"domain_scores_gemma":[0.99742925,0.0011977876,0.00016579017,0.0009053688,0.00016181705,0.00013995665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010964458,0.00045004877,0.00041703327,0.0006986446,0.00019069362,0.00023528594,0.001508963,0.000264456,0.0000029777073],"category_scores_gemma":[0.00016036694,0.0003811251,0.000042844353,0.0004938215,0.0008678181,0.0006238879,0.0008652167,0.0007190025,0.000009025104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008629583,0.000007246968,0.000102930324,0.000037429167,0.000008572132,0.000117813775,0.00033356147,0.19869657,0.000037787773,0.050554153,0.0000021901712,0.7500931],"study_design_scores_gemma":[0.00030780444,0.00034850254,0.00084858143,0.00032661707,0.000008572049,0.00040385275,2.4786522e-7,0.10722942,0.00034835024,0.88829476,0.00091752846,0.0009657865],"about_ca_topic_score_codex":0.000007778538,"about_ca_topic_score_gemma":0.000044262702,"teacher_disagreement_score":0.8377406,"about_ca_system_score_codex":0.00035198985,"about_ca_system_score_gemma":0.00020882595,"threshold_uncertainty_score":0.99986404},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054576663,0.0021512422,0.9904633,0.00022632928,0.00050869514,0.00035435928,0.0000017039282,0.00087397674,0.0053658234],"genre_scores_gemma":[0.17094192,0.000016015165,0.82786995,0.0004117266,0.00028981423,0.000009525497,0.000008944832,0.00003796275,0.0004141379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957077,0.000051669067,0.0005666237,0.0017916142,0.0010492397,0.0008331794],"domain_scores_gemma":[0.9978258,0.0003192265,0.00040302874,0.0010548326,0.00025530017,0.00014181137],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011378533,0.0006300001,0.0006306729,0.00092545274,0.00039996262,0.0011409678,0.0035175546,0.00044828467,0.0000075391113],"category_scores_gemma":[0.00014335591,0.0005647884,0.00015736128,0.00069111475,0.0009052891,0.0006938278,0.0014573911,0.0017801356,0.000017836734],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044250064,0.000048329355,0.000082237195,0.00018047316,0.000016238353,0.00027328767,0.001027191,0.035938963,0.0006487743,0.026916927,0.000045354107,0.9348178],"study_design_scores_gemma":[0.00021215728,0.00012624702,0.000009885875,0.0008191015,0.000012208588,0.0002789782,4.6470302e-7,0.7294925,0.0036882563,0.26396734,0.00042596765,0.0009669487],"about_ca_topic_score_codex":0.000055013566,"about_ca_topic_score_gemma":0.0000126739105,"teacher_disagreement_score":0.9338508,"about_ca_system_score_codex":0.0003134821,"about_ca_system_score_gemma":0.00052223343,"threshold_uncertainty_score":0.99989593},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021762356,0.0001950631,0.99303013,0.0002493975,0.0023270461,0.0005346161,0.0000041040175,0.0002239091,0.00341397],"genre_scores_gemma":[0.008298361,0.00001422875,0.98999107,0.0009722707,0.00044594394,0.000021183869,0.000006635934,0.000032861302,0.00021742273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641985,0.000021706834,0.0006287268,0.0013581957,0.00080073794,0.0007707797],"domain_scores_gemma":[0.9971031,0.0007418873,0.00035851094,0.0012610154,0.00037669856,0.0001587955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002617202,0.0004096604,0.00040284058,0.0007493975,0.00037484607,0.00055711926,0.002998203,0.00035838288,0.00001071795],"category_scores_gemma":[0.00040062563,0.00041020705,0.00014865883,0.00050530926,0.0005333618,0.0008298622,0.0007774298,0.0006325285,0.000026857011],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006325195,0.000014007711,0.000014549521,0.000049036225,0.0000058728706,0.000011188686,0.00030255324,0.01600147,0.00021074951,0.17987497,0.000007432257,0.80350184],"study_design_scores_gemma":[0.00011615881,0.00011804913,0.00007741931,0.0002557839,0.000005188427,0.00003082776,7.537952e-8,0.7830429,0.0020572194,0.21208456,0.0017704387,0.00044139355],"about_ca_topic_score_codex":0.0000060169664,"about_ca_topic_score_gemma":0.000037642458,"teacher_disagreement_score":0.8030605,"about_ca_system_score_codex":0.00043245452,"about_ca_system_score_gemma":0.00037087259,"threshold_uncertainty_score":0.99983495},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063079904,0.0004395589,0.993696,0.0008192426,0.002543481,0.0014096443,0.000029984038,0.00036746438,0.00063155085],"genre_scores_gemma":[0.004991981,0.00003369428,0.9904444,0.0011074437,0.0020976097,0.000037450598,0.00008096463,0.0001233792,0.0010830482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928021,0.000058985475,0.00069270964,0.0035863824,0.0013609304,0.0014989349],"domain_scores_gemma":[0.99171674,0.0019273789,0.00042477777,0.0050386563,0.00030143067,0.00059104065],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00088996993,0.0010301688,0.0009801459,0.0009134845,0.0005653141,0.0009745287,0.009883784,0.00091822154,0.00002320162],"category_scores_gemma":[0.00011003004,0.0008291492,0.00017140253,0.0012776483,0.0011235627,0.00043410785,0.0032047464,0.0028180256,0.000008037587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035965397,0.000025101714,0.000009584155,0.000017766402,0.000021210231,0.00006225842,0.00018506096,0.71448404,0.00006384982,0.0018006748,0.00010829481,0.2831862],"study_design_scores_gemma":[0.000724908,0.0005734046,0.000010689159,0.00036319412,0.000025905108,0.00023862213,1.1365351e-7,0.9655063,0.00039638538,0.008011583,0.022999132,0.0011497679],"about_ca_topic_score_codex":0.00004606322,"about_ca_topic_score_gemma":0.00095680426,"teacher_disagreement_score":0.28203642,"about_ca_system_score_codex":0.00020344167,"about_ca_system_score_gemma":0.001646541,"threshold_uncertainty_score":0.9994825},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002950654,0.0011580484,0.99531907,0.00022589898,0.0004272173,0.00025296523,0.0000034860518,0.00012909248,0.002189161],"genre_scores_gemma":[0.3832152,0.00012530472,0.61565274,0.00041608507,0.00021907195,0.0000066302146,0.000015568608,0.000028160955,0.0003212296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951431,0.00005190151,0.0011517883,0.0015378927,0.001525069,0.00059025],"domain_scores_gemma":[0.9966631,0.00030485942,0.000893561,0.001664495,0.00031382567,0.00016016969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089726003,0.000542216,0.0013582965,0.003074932,0.0002677396,0.0002821891,0.003065847,0.00030988452,0.000048389265],"category_scores_gemma":[0.000036282563,0.0005053032,0.0005926481,0.0026324668,0.0005554023,0.00042127806,0.0013841536,0.00062653155,0.000016591606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011434437,0.0003374128,0.017633539,0.00008727038,0.0010622641,0.00011709623,0.006218469,0.058170382,0.0018979833,0.008689914,0.000191939,0.9055823],"study_design_scores_gemma":[0.00021197145,0.00021237011,0.00061152334,0.00035620332,0.00026924995,0.000019973644,0.0000011279709,0.9646428,0.026596596,0.0040307543,0.0021078964,0.00093949353],"about_ca_topic_score_codex":0.00005398672,"about_ca_topic_score_gemma":0.000037718168,"teacher_disagreement_score":0.90647244,"about_ca_system_score_codex":0.00022699594,"about_ca_system_score_gemma":0.0003073727,"threshold_uncertainty_score":0.9997399},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033253473,0.00032515358,0.990223,0.00013377858,0.0031063226,0.00061241107,0.000008673629,0.00031888497,0.0019464091],"genre_scores_gemma":[0.9377545,0.000005716839,0.060942214,0.0003053187,0.00064639514,0.000013304243,0.0000029035632,0.00003723799,0.00029242574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518937,0.000106838605,0.00074314943,0.0020200699,0.0012447039,0.0006958776],"domain_scores_gemma":[0.99667585,0.0006838875,0.00051244174,0.0015427279,0.0004228496,0.00016222666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014210813,0.0006206423,0.00068455475,0.001006939,0.00039766548,0.000849982,0.0023388143,0.00046773974,0.00001897473],"category_scores_gemma":[0.00009825964,0.0006160452,0.00022959596,0.0008503401,0.0005800809,0.0015355936,0.00088459044,0.0008934756,0.000054075943],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005984849,0.00006190059,0.00012335384,0.000057646994,0.000013903307,0.00005545664,0.00032314355,0.021082355,0.0017679966,0.0002710112,0.000010321907,0.9762269],"study_design_scores_gemma":[0.00036748787,0.00016492823,0.00077148783,0.0005024136,0.000017581959,0.0003530699,2.8055595e-7,0.93859214,0.011507626,0.04443671,0.002068575,0.001217683],"about_ca_topic_score_codex":0.0003784362,"about_ca_topic_score_gemma":0.00073747284,"teacher_disagreement_score":0.97500926,"about_ca_system_score_codex":0.00084118365,"about_ca_system_score_gemma":0.0005605272,"threshold_uncertainty_score":0.9996291},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004576766,0.00035354064,0.9965431,0.000815466,0.00087787304,0.0006567512,0.00004474035,0.00018960155,0.00047314132],"genre_scores_gemma":[0.010123966,0.0000047278318,0.9853146,0.0034161874,0.00073322066,0.000014430169,0.000041994408,0.000046442678,0.00030441803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995758,0.000021710217,0.00073159084,0.0016882085,0.00094722846,0.00085325364],"domain_scores_gemma":[0.99698806,0.00068850757,0.0003571252,0.0012940336,0.00044306368,0.00022919923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010772207,0.00058351754,0.00067305384,0.0007866181,0.00033384352,0.00033636854,0.0017039096,0.00032211948,0.000008868013],"category_scores_gemma":[0.00017311881,0.0005033201,0.0001881359,0.00062919426,0.000607886,0.00089139416,0.00077587704,0.0006137712,0.000010325334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028747965,0.000068018206,0.000022244987,0.00028878063,0.00001029451,0.000088216766,0.0001935672,0.046605542,0.000023469744,0.04560329,0.000030140853,0.9070377],"study_design_scores_gemma":[0.0005308897,0.00019674968,0.000034294997,0.0007915127,0.000010610906,0.000048622464,2.1824263e-7,0.9583018,0.00035143917,0.018952692,0.020091482,0.00068968884],"about_ca_topic_score_codex":0.00001585792,"about_ca_topic_score_gemma":0.00031349473,"teacher_disagreement_score":0.91169626,"about_ca_system_score_codex":0.00029054904,"about_ca_system_score_gemma":0.0009576917,"threshold_uncertainty_score":0.99974185},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000075949625,0.00032708238,0.9866129,0.00077283906,0.0013399386,0.0003311028,0.000002732919,0.0002888372,0.010248592],"genre_scores_gemma":[0.035716973,0.00004805887,0.9580792,0.0018246343,0.00077908504,0.00002101132,0.0000073069873,0.000070104135,0.0034536188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626285,0.00005322686,0.00037780782,0.0016068361,0.0009286047,0.00077066425],"domain_scores_gemma":[0.9975592,0.00024444328,0.00033664383,0.0014304359,0.00021690823,0.00021238276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006900195,0.0006274856,0.0005998348,0.00066378224,0.00036350783,0.0006506639,0.0032290872,0.00025827636,0.000049172777],"category_scores_gemma":[0.000051858166,0.00048868865,0.00011118004,0.0005392026,0.0008023228,0.0005517154,0.0010996611,0.0010234861,0.0000550602],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014634974,0.000026428412,0.0001544848,0.000035936715,0.000022054219,0.0002593527,0.0015753403,0.011855546,0.00005128251,0.038554598,0.0000562224,0.94739413],"study_design_scores_gemma":[0.0010059233,0.0007140964,0.00026959946,0.0010019784,0.000024529489,0.000482602,3.1238622e-7,0.83780676,0.0018198037,0.12260217,0.03208912,0.0021830788],"about_ca_topic_score_codex":0.00009707312,"about_ca_topic_score_gemma":0.00010314567,"teacher_disagreement_score":0.94521105,"about_ca_system_score_codex":0.00014393484,"about_ca_system_score_gemma":0.00052266306,"threshold_uncertainty_score":0.99975646},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004777213,0.0009857471,0.9713053,0.015820106,0.0013749212,0.00075805926,0.0001277354,0.000026018895,0.0091243675],"genre_scores_gemma":[0.9791765,0.00004728658,0.016506713,0.0025055222,0.00022857892,0.000017001974,0.0000020164773,0.000019218758,0.0014971462],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842364,0.000007364089,0.00054405874,0.0005486521,0.000068833644,0.00040747572],"domain_scores_gemma":[0.99870944,0.00020863826,0.00039322465,0.00055783964,0.0000720587,0.000058771333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010126925,0.00019328472,0.000380057,0.0005065158,0.00022231287,0.000055169792,0.0006633803,0.00016934086,0.000034500976],"category_scores_gemma":[0.00019709326,0.00017498423,0.00007619576,0.00026388693,0.00024246296,0.000052070616,0.00024611238,0.0002891568,0.0000015467309],"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.000008721453,0.00003370025,0.000043713164,0.00015747783,0.00003561307,0.0002571577,0.00021314133,0.005246658,0.0000025799586,0.26263472,0.00090152293,0.730465],"study_design_scores_gemma":[0.0003900247,0.00034254926,0.0013209913,0.0005157399,0.000020104815,0.0004553418,0.0000036756546,0.25011206,0.0000965298,0.6419267,0.10393278,0.0008834837],"about_ca_topic_score_codex":0.056904837,"about_ca_topic_score_gemma":0.21774346,"teacher_disagreement_score":0.9786988,"about_ca_system_score_codex":0.00036088974,"about_ca_system_score_gemma":0.00036311086,"threshold_uncertainty_score":0.94937533},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002498348,0.000013959955,0.9953845,0.0013911879,0.00015634608,0.0003062667,0.000006466906,0.00020267039,0.000040246847],"genre_scores_gemma":[0.3923655,0.0000021295093,0.60487974,0.0027051144,0.000034131233,0.0000059972294,0.0000037658795,0.0000031578595,4.958448e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975415,0.00008315095,0.00029033507,0.0007374768,0.00088462717,0.00046290533],"domain_scores_gemma":[0.99879,0.00024846636,0.000097705764,0.00052007136,0.00015380378,0.00018989832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006688273,0.00019563793,0.00018347426,0.00022222885,0.00014197482,0.0004907503,0.0011089497,0.00005095743,0.000019048814],"category_scores_gemma":[0.00016823979,0.00015621263,0.000022271644,0.0010217383,0.00065814867,0.0008489216,0.00017602573,0.00024874762,0.000012719372],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007865738,0.00007061916,0.00031705265,0.0000070511796,0.0000023265197,0.00009100601,0.00092929,0.00089948333,0.02279077,0.0014044779,0.000073748226,0.9734063],"study_design_scores_gemma":[0.0011632981,0.0012920585,0.018258592,0.00013059801,0.000005693266,0.00028333286,0.0000058222695,0.585141,0.3589823,0.034090936,0.000014178303,0.0006322151],"about_ca_topic_score_codex":0.000025895977,"about_ca_topic_score_gemma":0.000013885981,"teacher_disagreement_score":0.9727741,"about_ca_system_score_codex":0.000144835,"about_ca_system_score_gemma":0.00033066573,"threshold_uncertainty_score":0.6370166},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022193855,0.0004505619,0.99146324,0.0011494976,0.0031160205,0.00077211,0.000040104973,0.00025370702,0.002732574],"genre_scores_gemma":[0.23804182,0.000013014202,0.75688803,0.0031429895,0.00083698647,0.000064701984,0.00015433466,0.00006962371,0.0007884758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953625,0.00006421946,0.00092599017,0.0016990141,0.0010902277,0.00085805095],"domain_scores_gemma":[0.9968361,0.00085884216,0.00051731407,0.0010383291,0.0005028229,0.00024654967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012358747,0.0006255739,0.0008102586,0.00062997395,0.00045395704,0.0008266713,0.002736157,0.00034708914,0.0000140153015],"category_scores_gemma":[0.00010381462,0.0006164371,0.00025982686,0.0006195667,0.0004907887,0.00043269343,0.0004769428,0.0005859227,0.000056693098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008830843,0.000069767564,0.00008116127,0.00009503133,0.000034744702,0.000022315739,0.0005396182,0.77444017,0.000008713282,0.14719783,0.0025614582,0.07494034],"study_design_scores_gemma":[0.00047232877,0.00018543197,0.000030283347,0.000293242,0.000010376806,0.000056046298,2.4357686e-7,0.7639837,0.00006127616,0.20999788,0.024226164,0.00068298867],"about_ca_topic_score_codex":0.00000879526,"about_ca_topic_score_gemma":0.000015709382,"teacher_disagreement_score":0.23801962,"about_ca_system_score_codex":0.00034166724,"about_ca_system_score_gemma":0.0006315843,"threshold_uncertainty_score":0.9996287},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006939545,0.0014804901,0.23591806,0.017817214,0.0063192844,0.0008941936,0.000038805796,0.00038397853,0.736454],"genre_scores_gemma":[0.9373004,0.0010056007,0.033458006,0.010023828,0.01168872,0.000012401613,0.000007458806,0.00007298397,0.006430648],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671316,0.00008164351,0.00030290836,0.00071079005,0.0013608199,0.00083066477],"domain_scores_gemma":[0.9981251,0.00046904155,0.00018131701,0.0003719305,0.000492737,0.00035988155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067091937,0.0003398256,0.00041813092,0.00026066983,0.000840226,0.00031491523,0.0011841098,0.00042225854,0.00009006909],"category_scores_gemma":[0.00064818654,0.00035319655,0.00014656119,0.0003747533,0.002221461,0.00028437265,0.00017799485,0.00058102293,0.000038927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005698165,0.000022095106,0.00018262901,0.000010021538,0.000013025791,0.0001312974,0.028460229,0.00020093855,0.0000024990231,0.44689527,0.00006713847,0.52400917],"study_design_scores_gemma":[0.00014380056,0.00007949438,0.00009304423,0.0002655402,0.00002018588,0.000009671342,0.00019601404,0.00040310665,0.000026798782,0.9758905,0.022336658,0.00053517893],"about_ca_topic_score_codex":0.0015969925,"about_ca_topic_score_gemma":0.0017538688,"teacher_disagreement_score":0.9366064,"about_ca_system_score_codex":0.0024230692,"about_ca_system_score_gemma":0.0029080864,"threshold_uncertainty_score":0.999892},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034696952,0.00018810814,0.9940185,0.00046679442,0.0014852624,0.00051579793,0.0000014694161,0.00050372974,0.0024733443],"genre_scores_gemma":[0.30635047,0.000035098703,0.6924301,0.00069526583,0.00021608191,0.000016920629,0.000008058,0.000030109863,0.00021793919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595785,0.00008642015,0.0008460135,0.001674305,0.00074669,0.0006887461],"domain_scores_gemma":[0.9975005,0.0002141787,0.00041280317,0.0013980678,0.00029778463,0.00017670152],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093166775,0.0005885919,0.00063679024,0.0012786018,0.00018359133,0.0006172224,0.0030864947,0.00048493998,0.000029352279],"category_scores_gemma":[0.00010162875,0.00055986614,0.00012851831,0.00090557337,0.00062103826,0.00092491746,0.001411256,0.0011022112,0.00006800157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006993933,0.00005306033,0.0006737225,0.000040214432,0.0000076064894,0.000049117436,0.0007125577,0.0969273,0.000022494976,0.0077205645,0.00005231939,0.89373404],"study_design_scores_gemma":[0.00036954717,0.00011698861,0.00031707858,0.00035430098,0.0000025127588,0.00005815085,2.5083193e-7,0.9002389,0.00081481604,0.096499115,0.0005993831,0.0006289719],"about_ca_topic_score_codex":0.0002747607,"about_ca_topic_score_gemma":0.00026867288,"teacher_disagreement_score":0.8931051,"about_ca_system_score_codex":0.00055072847,"about_ca_system_score_gemma":0.00036707104,"threshold_uncertainty_score":0.9996853},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022893507,0.00067739526,0.99353147,0.00068535557,0.0004323096,0.0006642581,0.000007962123,0.000054159755,0.003718183],"genre_scores_gemma":[0.09979263,0.00021805889,0.8984443,0.0005033858,0.00030541173,0.00001100828,0.000007646806,0.00006846897,0.00064908405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935732,0.0002450879,0.0009335005,0.0014613107,0.0026469084,0.0011399968],"domain_scores_gemma":[0.9950092,0.0016460762,0.00023365671,0.0020551425,0.0007904069,0.00026555968],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00714499,0.00046004675,0.0006542939,0.0024951354,0.00024585056,0.00048813532,0.0058089434,0.00028281467,0.000103275976],"category_scores_gemma":[0.00036546256,0.0003627269,0.0001428211,0.0026479624,0.0015920646,0.00051036273,0.002858888,0.0017608476,0.00005897208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020234256,0.00006808228,0.0007349916,0.000046053476,0.000019474166,0.00012493921,0.0017954593,0.12953931,0.00010545732,0.016279707,0.000008061755,0.8512582],"study_design_scores_gemma":[0.0002765836,0.00015029985,0.0002497095,0.00021603025,0.0000038998355,0.000027590044,0.0000020112245,0.9725279,0.0023370206,0.023437442,0.00042039124,0.00035110774],"about_ca_topic_score_codex":0.00024032543,"about_ca_topic_score_gemma":0.0003000205,"teacher_disagreement_score":0.8509071,"about_ca_system_score_codex":0.00038569627,"about_ca_system_score_gemma":0.0012468896,"threshold_uncertainty_score":0.99988246},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007121435,0.00044654112,0.99411243,0.0025871946,0.0009490693,0.000966026,0.0000082603565,0.00007831202,0.00078092923],"genre_scores_gemma":[0.2227501,0.00002382127,0.770998,0.004433919,0.00080045214,0.000074777534,0.000022440541,0.000039768598,0.00085669314],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975841,0.0000434078,0.00039776115,0.0010484442,0.00052795926,0.00039829567],"domain_scores_gemma":[0.99716294,0.00135097,0.00024952518,0.0006663038,0.0004599209,0.0001103278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013182814,0.00035881347,0.0003578082,0.00042446025,0.00040206758,0.00042662612,0.0016038272,0.00016397258,0.000007575597],"category_scores_gemma":[0.00018505193,0.0002569174,0.000106059415,0.00036340556,0.0007216919,0.0004314933,0.0007391086,0.0003650827,0.000016519389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069709306,0.000030019442,0.0000034082743,0.00005477473,0.00001645016,0.000006423394,0.0012823681,0.051933337,0.000024108695,0.35558537,0.000051781346,0.59094226],"study_design_scores_gemma":[0.000781866,0.00022155952,0.00009273834,0.00014103725,0.00001472869,0.00008129569,1.3152118e-7,0.49796915,0.000117890886,0.49886984,0.0013196231,0.00039011787],"about_ca_topic_score_codex":0.000019404308,"about_ca_topic_score_gemma":0.0000431096,"teacher_disagreement_score":0.59055215,"about_ca_system_score_codex":0.00007585693,"about_ca_system_score_gemma":0.00042433833,"threshold_uncertainty_score":0.9999883},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002962083,0.00031523203,0.99336207,0.00035603702,0.0016710996,0.0003576624,0.000009198364,0.00006661083,0.0009000129],"genre_scores_gemma":[0.6470848,0.000020024037,0.35209262,0.00037830943,0.000273421,0.000006276552,0.000006952282,0.000017068709,0.000120573655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967692,0.000039006358,0.00062703615,0.0009453867,0.0012035209,0.0004158732],"domain_scores_gemma":[0.99687606,0.0010037058,0.00050898653,0.0011227304,0.0003872752,0.000101234036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009924009,0.0003745078,0.00040669,0.0014161724,0.0003239397,0.00036635343,0.0029642428,0.0002623129,0.00004707024],"category_scores_gemma":[0.00023424099,0.00027793425,0.00016106656,0.002015596,0.0005009176,0.00044925255,0.0009434931,0.0009733671,0.000012676432],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002282658,0.00002908024,0.00006411683,0.000043005362,0.000013696988,0.000009396865,0.00075588893,0.041267052,0.0011387905,0.03664571,0.0000050260664,0.92002594],"study_design_scores_gemma":[0.00022692236,0.00014865823,0.0006883654,0.0001402265,0.000007931617,0.000052404754,2.1110426e-7,0.70939875,0.015882926,0.27223098,0.0006771248,0.00054550165],"about_ca_topic_score_codex":0.0000135765185,"about_ca_topic_score_gemma":0.000026970727,"teacher_disagreement_score":0.91948044,"about_ca_system_score_codex":0.00007953676,"about_ca_system_score_gemma":0.00043536842,"threshold_uncertainty_score":0.9999673},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011708019,0.00037236995,0.8112129,0.004403301,0.0019060505,0.0008760714,0.000017342609,0.00017510685,0.1809198],"genre_scores_gemma":[0.90633696,0.00015129271,0.052132417,0.0029437442,0.0066511207,0.0001489805,0.00007470624,0.0001181184,0.03144268],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982703,0.000010658741,0.00023343648,0.00066388963,0.0003375284,0.00048419886],"domain_scores_gemma":[0.99784875,0.0013109165,0.00013540765,0.00053686317,0.00006732567,0.00010076762],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006651515,0.00022385742,0.00019193372,0.00024349647,0.0012470322,0.0017539985,0.0021517759,0.00022994535,0.00011646973],"category_scores_gemma":[0.00022324042,0.0001740771,0.000094267714,0.00042020011,0.0011034766,0.0006362108,0.0008524798,0.0005313157,0.00005512253],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004316673,0.00001186004,0.0014975581,0.000010234867,0.000010427293,0.0000017832938,0.0022004442,0.000096146025,0.000008130625,0.1301142,0.00016898634,0.8658759],"study_design_scores_gemma":[0.00018286798,0.00006778407,0.0031892832,0.00021002158,0.000029112145,0.0000020872606,0.000008666959,0.0022901478,0.000029051187,0.46225378,0.5310781,0.0006591269],"about_ca_topic_score_codex":0.000013882189,"about_ca_topic_score_gemma":0.00017739566,"teacher_disagreement_score":0.90621984,"about_ca_system_score_codex":0.00006289905,"about_ca_system_score_gemma":0.00023611535,"threshold_uncertainty_score":0.9992823},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038399263,0.00037520277,0.98622775,0.00089873374,0.00040369038,0.000523383,0.0000045589786,0.00025808773,0.0074686618],"genre_scores_gemma":[0.97926044,0.000028140008,0.012899507,0.0047589834,0.0018101165,0.000083825114,0.00007015585,0.00012588904,0.00096296304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953725,0.000004142182,0.0008940538,0.0016468863,0.001173415,0.0009090312],"domain_scores_gemma":[0.99723214,0.0000545575,0.0009414138,0.0007026375,0.0010297776,0.000039446153],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004594339,0.00082226045,0.00094527344,0.0007879442,0.000449079,0.0014756708,0.0018288066,0.0003378665,0.00023882287],"category_scores_gemma":[0.00014007733,0.0006450428,0.00021408734,0.0008792588,0.0003667714,0.0025870888,0.0006030474,0.0007632487,0.00014076731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001650594,0.00011342268,0.00034882635,0.0022883338,0.000041220443,0.00002491091,0.0010450422,0.7835399,0.00006514604,0.0025015147,0.000102358215,0.2099128],"study_design_scores_gemma":[0.00016695069,0.0000058934243,0.000010886094,0.00074809295,0.00006297424,0.0000030735666,0.0000015509321,0.7544413,0.00006791294,0.24362649,0.00022551377,0.0006393177],"about_ca_topic_score_codex":0.00008043598,"about_ca_topic_score_gemma":0.00009685992,"teacher_disagreement_score":0.9754205,"about_ca_system_score_codex":0.00010004095,"about_ca_system_score_gemma":0.0002484744,"threshold_uncertainty_score":0.9996001},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024511546,0.0003633435,0.9963493,0.00026606218,0.00057332986,0.00027192725,0.00004600981,0.000080532154,0.0018044077],"genre_scores_gemma":[0.10991962,0.00006728333,0.88704973,0.0020902862,0.0004149913,0.000004993011,0.00008322854,0.000021638196,0.00034823953],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691784,0.00008632116,0.00042624367,0.001298173,0.0008591537,0.00041227532],"domain_scores_gemma":[0.9983174,0.00028932292,0.00025225256,0.00069349847,0.00028581556,0.0001617153],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001644905,0.0003531697,0.0003418734,0.001246639,0.0002628489,0.0007029491,0.0013119922,0.0003230304,0.000015492622],"category_scores_gemma":[0.00009284048,0.00034607205,0.00008551535,0.0009137959,0.00065708614,0.0004767447,0.0005324001,0.00055452547,0.000017336104],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005923492,0.000035557066,0.000013214644,0.000028231465,0.000008267561,0.000012225046,0.00058677455,0.00058375095,0.00006206206,0.02219324,0.000025774867,0.97644496],"study_design_scores_gemma":[0.0003270447,0.000084667794,0.0012869497,0.00015364276,0.000013354119,0.0003322471,5.550528e-7,0.47188434,0.00017620738,0.52357066,0.0014620511,0.0007082687],"about_ca_topic_score_codex":0.0000217151,"about_ca_topic_score_gemma":0.0000084424755,"teacher_disagreement_score":0.97573674,"about_ca_system_score_codex":0.00020546118,"about_ca_system_score_gemma":0.0004096884,"threshold_uncertainty_score":0.99989915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026734621,0.0014570117,0.9939752,0.00034662863,0.0010351257,0.000256286,0.0000044487415,0.00012947308,0.0025284674],"genre_scores_gemma":[0.018769296,0.000056405013,0.978893,0.001197664,0.00068010687,0.0000015869846,0.000001227846,0.000045517347,0.0003552171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958036,0.00008092881,0.0005755396,0.0017201906,0.0009962937,0.0008234293],"domain_scores_gemma":[0.997476,0.00052867056,0.00028956786,0.001196311,0.00027610597,0.00023336985],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014873805,0.00062239246,0.0006166495,0.0009488859,0.00046493436,0.001390436,0.0024582131,0.00034703122,0.000023541374],"category_scores_gemma":[0.00014656511,0.0005889747,0.00012513228,0.0005408255,0.0007403356,0.0015496514,0.0017011418,0.0009217458,0.000023146555],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006149928,0.000015811456,0.000021557818,0.00003597028,0.000009431141,0.00026755675,0.0005341487,0.0025512213,0.006509149,0.0048446055,0.0000051148977,0.9851993],"study_design_scores_gemma":[0.00057628396,0.00011374588,0.00019604212,0.0005656103,0.000024002473,0.00076553115,1.9111579e-7,0.81833106,0.006722609,0.17104554,0.00050042744,0.001158987],"about_ca_topic_score_codex":0.000051994983,"about_ca_topic_score_gemma":0.000039520204,"teacher_disagreement_score":0.9840403,"about_ca_system_score_codex":0.00031289854,"about_ca_system_score_gemma":0.00061704364,"threshold_uncertainty_score":0.99965614},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054176524,0.0008267762,0.9890181,0.0035544808,0.0031944157,0.0008168813,0.000030186053,0.00036148902,0.0016559451],"genre_scores_gemma":[0.366608,0.00020695415,0.61076933,0.02002018,0.0018507623,0.000092588205,0.000086655906,0.00014105008,0.00022446943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552715,0.000041285202,0.0007029796,0.0019059947,0.0009269987,0.0008956157],"domain_scores_gemma":[0.9962903,0.00081189064,0.00040649614,0.0016208736,0.00062316743,0.0002472551],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046145575,0.00078693364,0.00073192455,0.0010277042,0.00049098564,0.00058552675,0.0051515917,0.00042736524,0.000015885766],"category_scores_gemma":[0.000018483925,0.0007226249,0.00021109174,0.000874493,0.0006844583,0.0008824837,0.0019531128,0.00085934356,0.000070487964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016248897,0.00020565119,0.000070569804,0.0008443079,0.00013260194,0.00018682294,0.022737168,0.05026944,0.0054748743,0.03114983,0.00047792957,0.8882883],"study_design_scores_gemma":[0.0013802549,0.000660672,0.000104032035,0.0016761876,0.00003947023,0.00046552345,0.000002237523,0.853716,0.015122699,0.08494278,0.039812434,0.0020776892],"about_ca_topic_score_codex":0.000039943992,"about_ca_topic_score_gemma":0.00053029,"teacher_disagreement_score":0.8862106,"about_ca_system_score_codex":0.0002532231,"about_ca_system_score_gemma":0.0006697034,"threshold_uncertainty_score":0.9995225},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017312431,0.00029070972,0.97960013,0.0049434504,0.00058508234,0.00074384577,0.000003284419,0.00014354078,0.013516825],"genre_scores_gemma":[0.66285515,0.000059547645,0.325898,0.005260327,0.00060338917,0.00006668663,0.000072368195,0.000063752064,0.0051207826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654347,0.00009351937,0.00038135517,0.0014214752,0.0010276212,0.00053255237],"domain_scores_gemma":[0.99802315,0.00039106148,0.0004304955,0.0006788426,0.00031361255,0.00016284094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005265616,0.0005148594,0.00042015652,0.0006555142,0.00056398526,0.0009169419,0.0020557656,0.00020120935,0.00009117173],"category_scores_gemma":[0.000026596283,0.0004436075,0.00006318797,0.0007039976,0.0004300225,0.0007170313,0.00035062447,0.0010228882,0.000105908584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037865066,0.00021277528,0.0011456623,0.00010534613,0.00003463754,0.000041997624,0.009765448,0.26903436,0.000053133357,0.025462698,0.000117472795,0.6939886],"study_design_scores_gemma":[0.0017435183,0.0024473446,0.003154974,0.0023351812,0.000042501197,0.000115674025,0.000115889095,0.85186213,0.0012856234,0.014468782,0.119203046,0.0032253223],"about_ca_topic_score_codex":0.00004234717,"about_ca_topic_score_gemma":0.00009205553,"teacher_disagreement_score":0.6907633,"about_ca_system_score_codex":0.00044376776,"about_ca_system_score_gemma":0.0025813854,"threshold_uncertainty_score":0.9998016},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006107426,0.0020602606,0.9487997,0.009569471,0.010465612,0.0045320704,0.000053804422,0.0011172604,0.017294377],"genre_scores_gemma":[0.9099573,0.00024026787,0.07813379,0.006454069,0.0038412223,0.00004725827,0.000006741212,0.00014109655,0.001178266],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962436,0.000078471465,0.0003980693,0.00092317787,0.0011541997,0.0012025143],"domain_scores_gemma":[0.9986086,0.00004676187,0.00046742262,0.000463869,0.0001755309,0.00023785266],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0015015751,0.0004315983,0.00058712735,0.0007061675,0.0015944589,0.0002290652,0.0017367307,0.0007658873,0.000113258015],"category_scores_gemma":[0.00010560551,0.0004544103,0.00014186166,0.00049628253,0.0027486088,0.00041514362,0.00062662247,0.0010685442,0.000025448266],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051260267,0.000049482856,0.00057244004,0.00003343951,0.0000063737566,0.000045780398,0.014795212,0.0000065655613,0.0000279897,0.002812595,0.000030589625,0.9816144],"study_design_scores_gemma":[0.008817764,0.004600523,0.11659795,0.018997004,0.0007972273,0.0006921039,0.0003786392,0.021777011,0.0060016126,0.65339506,0.14121869,0.026726397],"about_ca_topic_score_codex":0.004991481,"about_ca_topic_score_gemma":0.0022664734,"teacher_disagreement_score":0.954888,"about_ca_system_score_codex":0.0015158739,"about_ca_system_score_gemma":0.0015715027,"threshold_uncertainty_score":0.9999653},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.564443e-7,0.00022294304,0.99318665,0.0009774601,0.0021929077,0.000641971,0.000015620524,0.00021850895,0.0025433803],"genre_scores_gemma":[0.00087293907,0.000026302567,0.9965534,0.00086587144,0.0008916131,0.000036969814,0.000013504666,0.000035327623,0.0007040558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693644,0.000026870555,0.0003580444,0.0012883883,0.0006545727,0.00073571206],"domain_scores_gemma":[0.99775726,0.00044882196,0.00022631053,0.0012375701,0.00016762946,0.00016239182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011883018,0.00045317577,0.0004288605,0.0007398144,0.00033565203,0.00070782687,0.0027084863,0.00016702471,0.00002279615],"category_scores_gemma":[0.00004687075,0.00038306575,0.00012097633,0.00045032785,0.00023308759,0.0010951145,0.0016215212,0.00041833144,0.00003054027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055188852,0.000018763141,0.000007515549,0.000033866483,0.000016498267,0.000010856401,0.00020066086,0.0020945482,0.00001735004,0.009060311,0.000037213034,0.9884969],"study_design_scores_gemma":[0.00037272432,0.0001919371,0.000046156867,0.00019540613,0.000024389752,0.000056301233,1.3468906e-7,0.9244872,0.00043703578,0.037883457,0.035645887,0.00065940124],"about_ca_topic_score_codex":0.000072876144,"about_ca_topic_score_gemma":0.0003627292,"teacher_disagreement_score":0.9878375,"about_ca_system_score_codex":0.00018036262,"about_ca_system_score_gemma":0.00018010978,"threshold_uncertainty_score":0.99986213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025423705,0.0037084685,0.9898947,0.0005437144,0.00049402186,0.00029537603,0.000009942266,0.00014273218,0.0023686904],"genre_scores_gemma":[0.5718895,0.0005324941,0.42607376,0.00080815336,0.00033729427,0.000004406772,0.0000055243427,0.000030718908,0.00031812437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741113,0.000035922676,0.00038754108,0.0011444648,0.0006358601,0.00038504976],"domain_scores_gemma":[0.9979219,0.0003255293,0.00026587877,0.0012144723,0.0001780733,0.000094170835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007597581,0.00034651885,0.0005035759,0.000378427,0.00012937545,0.00013361537,0.0018733614,0.0001808329,0.0000054484976],"category_scores_gemma":[0.000113705195,0.0002953491,0.00005691279,0.00036373618,0.0010775828,0.000398717,0.0011649155,0.00040758733,0.0000053376134],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064864616,0.000050385755,0.00016607565,0.00017624463,0.000017150769,0.0001264051,0.0021844865,0.00068125175,0.0010400639,0.044411905,0.000090411624,0.95104915],"study_design_scores_gemma":[0.0021173826,0.0014995446,0.011533082,0.0032003385,0.00006538142,0.0022351982,0.0000032511339,0.44161803,0.11632422,0.4000572,0.016107598,0.005238796],"about_ca_topic_score_codex":0.000033295004,"about_ca_topic_score_gemma":0.000014362186,"teacher_disagreement_score":0.9458103,"about_ca_system_score_codex":0.00007234893,"about_ca_system_score_gemma":0.00035098733,"threshold_uncertainty_score":0.9999499},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012184982,0.0003991799,0.992866,0.00032575146,0.0005954786,0.00040670368,0.000032953856,0.00009969029,0.0040557384],"genre_scores_gemma":[0.25818378,0.000039592895,0.7400543,0.00066037616,0.0007651354,0.000065571585,0.000034610803,0.00003445458,0.0001622039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967074,0.000067149245,0.00056436204,0.0012960719,0.0009676404,0.00039740754],"domain_scores_gemma":[0.99681044,0.0002724488,0.00037762185,0.0022480343,0.00016516597,0.00012629954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011577833,0.00037141988,0.00039652167,0.00023392892,0.0003984232,0.00048471885,0.004414597,0.00020130575,0.000020136631],"category_scores_gemma":[0.000051254636,0.00027393817,0.00010990186,0.0004829011,0.0009432979,0.00093550683,0.00086585066,0.0006080099,0.000013865458],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004929115,0.000121216974,0.0000050671247,0.000010503337,0.000008691704,0.0000016459214,0.0015761878,0.0019447595,0.00151061,0.019184269,0.000013806189,0.9756183],"study_design_scores_gemma":[0.00089626707,0.0007746072,0.00088676007,0.00026126727,0.00003139049,0.00018752614,0.000018769193,0.6770244,0.06495643,0.24410172,0.008621839,0.002239014],"about_ca_topic_score_codex":0.0001498487,"about_ca_topic_score_gemma":0.000010080624,"teacher_disagreement_score":0.9733793,"about_ca_system_score_codex":0.00011902817,"about_ca_system_score_gemma":0.0004030847,"threshold_uncertainty_score":0.9999713},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006146127,0.00094160053,0.99208283,0.0017080454,0.0011128141,0.00044442952,0.0000033536958,0.00025500893,0.003390462],"genre_scores_gemma":[0.23955859,0.0006061098,0.7547471,0.0031720235,0.0014062393,0.000013365809,0.000009347903,0.00005475025,0.00043250123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583924,0.0000780319,0.00059312163,0.0016055754,0.0009664857,0.0009175753],"domain_scores_gemma":[0.99610484,0.00057706214,0.00038439975,0.002315681,0.0003839271,0.00023407457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007199832,0.00072844647,0.0007038579,0.00044227354,0.00066036964,0.0008562521,0.0043091862,0.0003247185,0.00009328408],"category_scores_gemma":[0.0000580617,0.0006024777,0.00010937872,0.0010843646,0.0008162391,0.0008576455,0.0024518466,0.0014687267,0.00004371684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009308617,0.000016196502,0.000054521886,0.000012274619,0.000020207088,0.000044049644,0.00062370894,0.2848517,0.000035495894,0.09496602,0.00019252548,0.619174],"study_design_scores_gemma":[0.00089984643,0.00030299218,0.00077049504,0.0012923437,0.000020349908,0.00019137908,2.9902301e-7,0.93200314,0.00025961106,0.033980798,0.028713753,0.0015649898],"about_ca_topic_score_codex":0.0000070853553,"about_ca_topic_score_gemma":0.00025956758,"teacher_disagreement_score":0.64715147,"about_ca_system_score_codex":0.00049217464,"about_ca_system_score_gemma":0.0005852347,"threshold_uncertainty_score":0.99964267},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042015272,0.00029539983,0.984715,0.0008528508,0.0010915854,0.0007096975,0.000033456665,0.000179233,0.012080769],"genre_scores_gemma":[0.8333452,0.0002860397,0.15276468,0.0045512845,0.0016869159,0.00011877192,0.00032375884,0.00008130194,0.006842072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99657774,0.00001276558,0.00040781582,0.0013145934,0.00074994407,0.0009371179],"domain_scores_gemma":[0.99835336,0.0001408645,0.00020540912,0.00091150875,0.00024664725,0.00014221345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055839925,0.00044499084,0.00041381555,0.00019780814,0.0002146967,0.000902148,0.0028090081,0.00019999285,0.0000079841875],"category_scores_gemma":[0.000057801935,0.00037736297,0.00020100504,0.0005313003,0.00036411866,0.00084872154,0.0008540169,0.00028323982,0.000029987701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007668088,0.00002647805,0.000015968468,0.000015393603,0.000010299686,0.000013363196,0.000031982752,0.0008400229,0.0000017915813,0.57814556,0.00011594274,0.42077556],"study_design_scores_gemma":[0.00033462036,0.0002782301,0.00009696976,0.00009726986,0.00000976063,0.000021461597,4.0681762e-8,0.13492946,0.000041393996,0.74224615,0.12146177,0.00048288648],"about_ca_topic_score_codex":0.000017848583,"about_ca_topic_score_gemma":0.000218042,"teacher_disagreement_score":0.83330315,"about_ca_system_score_codex":0.0008024544,"about_ca_system_score_gemma":0.00039930257,"threshold_uncertainty_score":0.99986786},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088975416,0.00009724068,0.9832696,0.00062746863,0.0017279449,0.00042829185,0.0000014626386,0.000035459125,0.01292282],"genre_scores_gemma":[0.9840466,0.000016401891,0.014070313,0.0012667897,0.00018453036,0.000011591568,0.0000017465755,0.000015417383,0.00038662177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794334,0.000105073574,0.00037764976,0.0006340645,0.0006201983,0.00031966297],"domain_scores_gemma":[0.9972179,0.0009644567,0.00031526084,0.0012715671,0.00018998359,0.0000408323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017083463,0.00029629227,0.00026447934,0.0003502046,0.00023706576,0.00021753479,0.0035205395,0.00027993423,0.000019939722],"category_scores_gemma":[0.00045672516,0.00015436258,0.000113740134,0.00064237416,0.0007413752,0.00034250034,0.00078449026,0.001005339,0.000013315316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044021363,0.000022450367,0.00005339805,0.000008715941,0.000002303529,0.0000023156167,0.0021823798,0.0025324838,0.00036544746,0.83514065,0.000009847372,0.1596756],"study_design_scores_gemma":[0.000128895,0.0000994233,0.0006084453,0.0003706591,0.0000037289187,0.000013482865,6.580873e-7,0.16838276,0.014219641,0.8155906,0.00032800628,0.00025370982],"about_ca_topic_score_codex":0.000018078506,"about_ca_topic_score_gemma":0.00046457493,"teacher_disagreement_score":0.98315686,"about_ca_system_score_codex":0.00011980443,"about_ca_system_score_gemma":0.0003254257,"threshold_uncertainty_score":0.6542097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022607694,0.00027559538,0.9933297,0.00014538477,0.0018012945,0.00030846414,0.000003881997,0.000230898,0.0036787018],"genre_scores_gemma":[0.03612697,0.000024149667,0.9622974,0.0010286005,0.00039245244,0.000003297581,0.0000032428052,0.00002688014,0.00009705273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957323,0.000085981024,0.00068734394,0.001624375,0.0011332997,0.00073666597],"domain_scores_gemma":[0.99681336,0.00035136926,0.00046635824,0.0019296594,0.00028471457,0.0001545686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022701523,0.0005485179,0.00055813836,0.0007725433,0.00035620175,0.0007023368,0.0037526398,0.00036115418,0.000012814583],"category_scores_gemma":[0.0002091465,0.00053903105,0.00011914466,0.0006477861,0.0006291388,0.0012265487,0.000999096,0.0008464418,0.00002444781],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048293814,0.000019580682,0.000039131497,0.000029900342,0.000007220538,0.000049703587,0.00088065997,0.02101876,0.0004910159,0.10260431,0.00000551085,0.8748494],"study_design_scores_gemma":[0.00014859444,0.0001214988,0.00022428508,0.00040497258,0.0000074809786,0.00013370556,2.3589799e-7,0.84314835,0.0025446552,0.15126944,0.0012839764,0.0007128261],"about_ca_topic_score_codex":0.000043176547,"about_ca_topic_score_gemma":0.000027648979,"teacher_disagreement_score":0.87413657,"about_ca_system_score_codex":0.0006487844,"about_ca_system_score_gemma":0.00059274083,"threshold_uncertainty_score":0.99970615},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01841644,0.0001399915,0.98062336,0.000055949433,0.0004991154,0.00013890797,0.00006996995,0.00003115631,0.000025077847],"genre_scores_gemma":[0.99490124,0.000045284778,0.004511579,0.000040111187,0.00016640003,0.000008891265,0.00030810345,0.000015369795,0.0000030474823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986942,0.000014382094,0.0003371781,0.00030034856,0.00029111578,0.00036276752],"domain_scores_gemma":[0.9992315,0.00018735538,0.00007457623,0.00026366758,0.00017685993,0.00006602974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042460675,0.00020076738,0.00022516871,0.000098597295,0.0001571501,0.00007438314,0.00035679934,0.0001817047,9.059258e-7],"category_scores_gemma":[0.00003970709,0.00016989732,0.000030176947,0.00015387959,0.000110316774,0.00017239872,0.00010634292,0.0004215448,3.8525005e-8],"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.0000049632677,0.0000038612275,0.000021745776,0.000049627834,0.000003351142,0.0000014226691,0.00012368294,0.87360895,0.0004280237,0.0059503703,0.0000017790543,0.11980221],"study_design_scores_gemma":[0.00015602964,0.000030491263,0.000038126364,0.00015373815,0.000003863397,0.0000061004325,0.0000011295859,0.9914776,0.0034401286,0.004351137,0.00017302668,0.00016860565],"about_ca_topic_score_codex":0.010400204,"about_ca_topic_score_gemma":0.09222057,"teacher_disagreement_score":0.9764848,"about_ca_system_score_codex":0.00047284795,"about_ca_system_score_gemma":0.00025734302,"threshold_uncertainty_score":0.99618965},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020575428,0.00013303611,0.9958908,0.0018012563,0.0002664712,0.0007152875,0.000014337883,0.000084088046,0.001074136],"genre_scores_gemma":[0.13356553,0.00026474954,0.8618515,0.003248154,0.0005135899,0.000052374733,0.000053661937,0.000037789487,0.0004126566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805164,0.000026289286,0.00037799907,0.00064394,0.0005002997,0.000399858],"domain_scores_gemma":[0.998453,0.00046730103,0.00018967489,0.00048509834,0.00020172884,0.0002031629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094416115,0.00029205182,0.00035652024,0.000539611,0.0002583072,0.00079638936,0.0008793473,0.00023731559,0.0000028150055],"category_scores_gemma":[0.00010599245,0.00025797385,0.000044444907,0.00022850106,0.0003884801,0.001109777,0.00043885293,0.00034757104,0.0000044194812],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028724714,0.0000031392187,0.00008358852,0.00006021857,0.0000054194456,9.317545e-7,0.0006992514,0.0036795854,0.000003721035,0.02831461,0.000030982494,0.9671157],"study_design_scores_gemma":[0.00076641154,0.0003588737,0.0007096655,0.00022157318,0.000010870074,0.000035674893,2.5696087e-7,0.90942395,0.00011834796,0.056653507,0.03112059,0.00058025296],"about_ca_topic_score_codex":0.000008427773,"about_ca_topic_score_gemma":0.000018425584,"teacher_disagreement_score":0.96653545,"about_ca_system_score_codex":0.000081777005,"about_ca_system_score_gemma":0.00019272593,"threshold_uncertainty_score":0.99998724},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029247865,0.00018558536,0.9971485,0.000049414335,0.0006453718,0.0010602417,0.0000024069698,0.000511424,0.00010458436],"genre_scores_gemma":[0.6260536,0.000028073611,0.37350985,0.000043762433,0.00025063512,0.000058386577,0.000008568073,0.000042769665,0.0000043767436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848473,0.000003612558,0.000314586,0.00055529753,0.0001729063,0.000468896],"domain_scores_gemma":[0.9992875,0.00009673023,0.00006728966,0.00043629066,0.00006403199,0.000048198155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022237342,0.00031150706,0.00028375877,0.00035498405,0.00007377393,0.000079834455,0.0004790374,0.0004946107,0.000002431201],"category_scores_gemma":[0.000047310932,0.00030364215,0.0000490753,0.00031269898,0.00013247608,0.00035191473,0.00008696218,0.00070277776,0.0000011306724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050438352,0.0000037392201,0.0000031577192,0.0000220038,0.000001282864,0.0000017119745,0.000024887877,0.63700056,0.00017156897,0.00202273,2.1253283e-7,0.36074308],"study_design_scores_gemma":[0.00018490264,0.0001502932,0.000052621956,0.00018509374,0.0000022711793,0.0000028035097,8.9286594e-8,0.7809609,0.0002651199,0.21787032,0.000056183017,0.00026938444],"about_ca_topic_score_codex":0.000006257849,"about_ca_topic_score_gemma":0.00013966035,"teacher_disagreement_score":0.6257611,"about_ca_system_score_codex":0.000551565,"about_ca_system_score_gemma":0.00004605554,"threshold_uncertainty_score":0.9999416},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002060414,0.000494228,0.99347275,0.000409865,0.0016445562,0.0004939461,0.000002728086,0.00019675217,0.003079129],"genre_scores_gemma":[0.39031,0.00009939258,0.605789,0.0007091149,0.0016877267,0.000050983832,0.000017621725,0.0000885935,0.0012475861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99545735,0.00003196373,0.00062119024,0.0019043266,0.0010934876,0.0008916986],"domain_scores_gemma":[0.99775183,0.00019632657,0.00028940788,0.0014706183,0.00014278751,0.000149046],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013277762,0.0005968294,0.00057031045,0.0010268523,0.00021439076,0.0013144371,0.0044972734,0.00024247525,0.0000055999008],"category_scores_gemma":[0.0000889205,0.00054553605,0.000087548964,0.0009253746,0.0004754801,0.0011358074,0.0020701154,0.00085896923,0.00002659735],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024680407,0.000026570295,0.0005387427,0.00012677374,0.0000031358115,0.00011047757,0.00029412538,0.030340502,0.00001905886,0.009752079,0.000009223703,0.95877683],"study_design_scores_gemma":[0.00028343278,0.00010259833,0.00036636821,0.0016392493,0.0000071124573,0.000015336587,4.377904e-7,0.88262224,0.00021554517,0.11317493,0.00076863886,0.000804133],"about_ca_topic_score_codex":0.000055861266,"about_ca_topic_score_gemma":0.00009898989,"teacher_disagreement_score":0.9579727,"about_ca_system_score_codex":0.00041408985,"about_ca_system_score_gemma":0.00039015902,"threshold_uncertainty_score":0.9997223},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016867649,0.00018160118,0.99325347,0.00040298107,0.0012064145,0.00042402666,0.000003678544,0.00026726033,0.004091889],"genre_scores_gemma":[0.44636175,0.0000633475,0.54937387,0.0015181066,0.0008025973,0.000026618853,0.0000052137725,0.00010702797,0.0017414973],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994957,0.000060907158,0.00050176453,0.0019497586,0.0014353273,0.0010952656],"domain_scores_gemma":[0.9962565,0.0005613099,0.000252917,0.0023666127,0.0002802587,0.00028243364],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013578013,0.00061131915,0.000626681,0.0011595886,0.00031920036,0.00063675526,0.0060820724,0.00029885682,0.000037907786],"category_scores_gemma":[0.00014296167,0.0005611012,0.00015629314,0.00063414144,0.0007464638,0.000616819,0.0029283126,0.0011992233,0.00011788909],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069292464,0.00001289085,0.0005253354,0.00006347372,0.0000124414755,0.00008351789,0.00039098685,0.012726669,0.0001451121,0.10015478,0.000008105316,0.88586974],"study_design_scores_gemma":[0.00039253102,0.00025039716,0.00020863953,0.0006024304,0.0000055509513,0.00012190837,1.4199497e-7,0.397426,0.0016676821,0.59455556,0.0036712827,0.0010978736],"about_ca_topic_score_codex":0.000017301796,"about_ca_topic_score_gemma":0.00010831522,"teacher_disagreement_score":0.8847719,"about_ca_system_score_codex":0.0002674454,"about_ca_system_score_gemma":0.0003595966,"threshold_uncertainty_score":0.99968404},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002006781,0.0009817037,0.9946303,0.0006921367,0.0005913656,0.0003669432,0.000021631413,0.00017238405,0.00053678517],"genre_scores_gemma":[0.66922194,0.00030458553,0.3286065,0.0013305389,0.00023585971,0.0000070145475,0.0000044984386,0.000033691016,0.0002554174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99612856,0.00006059347,0.0005736099,0.0017876177,0.000810968,0.0006386308],"domain_scores_gemma":[0.9956832,0.0020231183,0.00021404913,0.0015410513,0.00027678328,0.00026182574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005544773,0.0005693934,0.0006734497,0.00057744636,0.0003747948,0.00074927055,0.0023241686,0.00037349627,0.0000072372277],"category_scores_gemma":[0.00021475455,0.00052639365,0.00012232554,0.00037861092,0.001584089,0.0017102341,0.0014370559,0.0007843774,0.000027914146],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020319121,0.000096075804,0.002712724,0.00014594384,0.00007360653,0.001202453,0.005107796,0.027828043,0.00007722276,0.04777109,0.00037083976,0.9145939],"study_design_scores_gemma":[0.0005643047,0.0006554115,0.0013800076,0.0007500421,0.000039697254,0.0012849058,3.375204e-7,0.5541869,0.001137899,0.4328961,0.0049447673,0.002159673],"about_ca_topic_score_codex":0.00011256964,"about_ca_topic_score_gemma":0.0001085001,"teacher_disagreement_score":0.9124342,"about_ca_system_score_codex":0.00017826607,"about_ca_system_score_gemma":0.00056258775,"threshold_uncertainty_score":0.9997188},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016817972,0.0002026762,0.99560815,0.00009881686,0.0005971696,0.0013896903,0.000003807269,0.00013002352,0.00028788665],"genre_scores_gemma":[0.63549554,0.000008721202,0.36431503,0.000029406747,0.00006438885,0.00004358059,7.45856e-7,0.000024700737,0.000017857079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652404,0.000039032126,0.00057155377,0.0008494201,0.001450403,0.0005655479],"domain_scores_gemma":[0.9966425,0.0011141027,0.00030759297,0.0013812876,0.00044637255,0.000108166554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090318103,0.00037110192,0.0005088885,0.0006847875,0.00012641486,0.00028621702,0.0036131167,0.00023151883,0.000008359074],"category_scores_gemma":[0.00030536467,0.00027313436,0.00012850015,0.00091698143,0.0013044588,0.00054279587,0.0015276019,0.0006664526,0.0000019764873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041276217,0.000117197174,0.00020127505,0.00034041004,0.00002668913,0.0000265973,0.0014068711,0.55854917,0.0005223637,0.072205216,0.0000050598624,0.36659503],"study_design_scores_gemma":[0.00010339154,0.00019275956,0.0001389435,0.00048156135,0.000012868029,0.000031503052,3.6120414e-7,0.852687,0.0011517159,0.14490871,0.0000116495485,0.00027950516],"about_ca_topic_score_codex":0.000058528403,"about_ca_topic_score_gemma":0.000012773578,"teacher_disagreement_score":0.6338138,"about_ca_system_score_codex":0.0005364361,"about_ca_system_score_gemma":0.0009663888,"threshold_uncertainty_score":0.9999721},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009636416,0.0003942537,0.98456883,0.00086659926,0.00056598225,0.00030281008,0.0000012423482,0.00039026793,0.012900351],"genre_scores_gemma":[0.6829408,0.00059918134,0.30947235,0.0015209112,0.0005675049,0.000055960652,0.000024373869,0.00007781387,0.00474112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694216,0.00005369663,0.0005295696,0.001310992,0.0007068075,0.00045674967],"domain_scores_gemma":[0.9981754,0.00019880389,0.0003203325,0.0009720027,0.00022648348,0.000106967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085520966,0.0003884795,0.00035669838,0.0010886978,0.00020081362,0.000266,0.002339585,0.00042121293,0.00003938181],"category_scores_gemma":[0.00009398055,0.00036167775,0.00009775227,0.00089007086,0.00047604347,0.0007556218,0.00063066534,0.0013065056,0.000077097946],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004611633,0.00003323312,0.00027379894,0.00001905691,0.0000030877934,0.000030252737,0.00048525239,0.00022387646,0.00057767483,0.059134882,0.0000125785555,0.9392017],"study_design_scores_gemma":[0.00030819848,0.0002844768,0.007986836,0.000607721,0.0000076049737,0.00010296101,6.341966e-7,0.51240075,0.005927233,0.45706126,0.01410654,0.0012058099],"about_ca_topic_score_codex":0.000019580331,"about_ca_topic_score_gemma":0.00001927633,"teacher_disagreement_score":0.9379959,"about_ca_system_score_codex":0.00037967804,"about_ca_system_score_gemma":0.00044887088,"threshold_uncertainty_score":0.99988353},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005872578,0.00034089427,0.98535484,0.0007747821,0.0019129086,0.00032982853,0.0000029540686,0.00016893912,0.010527598],"genre_scores_gemma":[0.4012726,0.00006970911,0.5869072,0.005727497,0.0010447789,0.000032905904,0.000047553698,0.000073090574,0.00482464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961055,0.000044241286,0.0005020232,0.0016168877,0.0011654049,0.00056593464],"domain_scores_gemma":[0.99747455,0.00071425806,0.0002824052,0.0011175132,0.00023801824,0.00017325593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007355268,0.00045946662,0.00037437433,0.0009673292,0.00039382032,0.00092881557,0.0022664978,0.00023817056,0.00005976609],"category_scores_gemma":[0.00015627916,0.00043364803,0.00013784895,0.00079438416,0.00024274207,0.00080558175,0.0008935376,0.000751348,0.00015049608],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025748857,0.000032023938,0.000017301276,0.000016946722,0.000010498557,0.000022072913,0.00025013852,0.10679887,0.0004964595,0.1456284,0.0010495776,0.74567515],"study_design_scores_gemma":[0.0001649808,0.00012548572,0.000043426397,0.00017993775,0.0000034647076,0.000027045893,5.177204e-8,0.54044473,0.0021561503,0.45412,0.0022202556,0.00051444664],"about_ca_topic_score_codex":0.000025154362,"about_ca_topic_score_gemma":0.000008132285,"teacher_disagreement_score":0.7451607,"about_ca_system_score_codex":0.00017446687,"about_ca_system_score_gemma":0.00024071008,"threshold_uncertainty_score":0.99981153},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013965592,0.0021230783,0.98482347,0.0004668475,0.00092258357,0.00042894698,0.0000047629683,0.00012866566,0.010961988],"genre_scores_gemma":[0.9270572,0.00021972983,0.07102422,0.0010171087,0.00028398447,0.000024950203,0.000020085183,0.000038917824,0.00031379124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963689,0.00007415418,0.00073999166,0.001314982,0.000779429,0.00072255585],"domain_scores_gemma":[0.9969162,0.0003126141,0.00027193746,0.0022074152,0.00014414013,0.00014770114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011316831,0.00047868415,0.00057776395,0.0006241987,0.00021745363,0.00053282926,0.0043869633,0.0003869199,0.000022748241],"category_scores_gemma":[0.000026870215,0.00045387167,0.000113828995,0.0010323514,0.00049206294,0.00024367803,0.0009127773,0.0010589383,0.00005467488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029535845,0.000029363553,0.000019144763,0.000009041966,0.0000024365931,0.000033234777,0.00025463675,0.63203853,0.0000024900567,0.02504842,0.000016776397,0.34254298],"study_design_scores_gemma":[0.00027343543,0.00004589546,0.00022949679,0.00073522935,0.0000021411695,0.00003461719,8.044679e-8,0.96498984,0.000014211736,0.02729792,0.0058845556,0.0004925601],"about_ca_topic_score_codex":0.000078383055,"about_ca_topic_score_gemma":0.00024082599,"teacher_disagreement_score":0.92691755,"about_ca_system_score_codex":0.00038281377,"about_ca_system_score_gemma":0.00030732056,"threshold_uncertainty_score":0.9997913},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017496296,0.00006933541,0.9686724,0.000544756,0.014478555,0.0006951404,0.000020289795,0.0000869413,0.015257598],"genre_scores_gemma":[0.46935552,0.00004499199,0.4673904,0.022779955,0.032146156,0.00022611642,0.00028723545,0.00035947943,0.0074101556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555826,0.000059659877,0.00061611383,0.0018860475,0.0011013733,0.00077853515],"domain_scores_gemma":[0.99644613,0.0008452758,0.00048593254,0.0012052865,0.00080191094,0.00021548284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009132379,0.0007338652,0.0006870094,0.00096476515,0.00045244946,0.0008304087,0.003118186,0.00040724006,0.000019386769],"category_scores_gemma":[0.00009406612,0.0006521893,0.00028816372,0.00032075073,0.00041445217,0.0012906019,0.0009953254,0.0010163612,0.00013895023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062290573,0.0005494078,0.00005833653,0.0002426175,0.00026091762,0.00025652073,0.006799402,0.075526655,0.0071794693,0.50214237,0.028053682,0.3783077],"study_design_scores_gemma":[0.0031036213,0.004569766,0.00022016809,0.0019413416,0.00006006492,0.0001431539,0.0000033077704,0.60013944,0.017236393,0.28472248,0.084621586,0.0032386684],"about_ca_topic_score_codex":0.000027211483,"about_ca_topic_score_gemma":0.000030330793,"teacher_disagreement_score":0.5246128,"about_ca_system_score_codex":0.0007657543,"about_ca_system_score_gemma":0.0004510711,"threshold_uncertainty_score":0.99959296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012492844,0.0011461518,0.9779093,0.0003232924,0.00526555,0.0010832625,0.00000973317,0.00038337577,0.0137543995],"genre_scores_gemma":[0.35393646,0.000056971458,0.6046502,0.0025241727,0.0042881873,0.00022034378,0.000021373013,0.00028115927,0.03402116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99493986,0.000039818275,0.00072326313,0.0022195065,0.00095938426,0.0011181711],"domain_scores_gemma":[0.996403,0.00057647575,0.00043271674,0.002027702,0.0003005644,0.00025954223],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011712156,0.0007302246,0.0007385117,0.00090529246,0.0004595273,0.0009197714,0.005387042,0.0003522036,0.000029047394],"category_scores_gemma":[0.00008349971,0.00065767614,0.000253962,0.00049422646,0.00044551402,0.0001359354,0.0024931182,0.00067125616,0.00008725006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019060863,0.00008595005,0.00000936289,0.00041845313,0.00006029259,0.00012351916,0.0017955373,0.4312902,0.00006084725,0.037598725,0.00084005395,0.527698],"study_design_scores_gemma":[0.00047733358,0.00033128524,0.000028634879,0.0010156474,0.000026137475,0.0001008463,6.813445e-7,0.94030714,0.00022021227,0.042249452,0.01420562,0.0010370263],"about_ca_topic_score_codex":0.00005811058,"about_ca_topic_score_gemma":0.00001341189,"teacher_disagreement_score":0.526661,"about_ca_system_score_codex":0.00036653315,"about_ca_system_score_gemma":0.00039024607,"threshold_uncertainty_score":0.9999943},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003910473,0.0005010411,0.9913752,0.001549889,0.00068693043,0.00048030325,0.000008721151,0.00040583493,0.0049881334],"genre_scores_gemma":[0.016561653,0.00034652598,0.98097104,0.0012930182,0.00031576704,0.000020716716,0.0000075149956,0.000032635304,0.00045113254],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647385,0.00005035135,0.0005211354,0.0013958333,0.0010425011,0.00051630393],"domain_scores_gemma":[0.9969617,0.00043211476,0.00038655926,0.0013088098,0.000749559,0.00016125674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049496867,0.00048580614,0.00046059492,0.00077363144,0.00036443584,0.00060900085,0.0026247643,0.00042195342,0.00002722169],"category_scores_gemma":[0.00021569351,0.00044984234,0.00011434826,0.001520433,0.000990446,0.0010133598,0.0006151342,0.0008897655,0.0000754877],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010650168,0.000054756198,0.000016212438,0.000039328374,0.000013969176,0.0001928746,0.0029988368,0.00020341286,0.001042778,0.065713935,0.00020481333,0.92950845],"study_design_scores_gemma":[0.00031988625,0.0004417037,0.00026652822,0.000828822,0.000012319471,0.00018142271,8.7763794e-7,0.27274516,0.057813246,0.6536302,0.011983286,0.0017765381],"about_ca_topic_score_codex":0.000006392193,"about_ca_topic_score_gemma":0.0000058669307,"teacher_disagreement_score":0.9277319,"about_ca_system_score_codex":0.00033553827,"about_ca_system_score_gemma":0.00089786306,"threshold_uncertainty_score":0.9997953},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000043985333,0.00020763607,0.98447824,0.0009712522,0.00072998094,0.0005349498,0.0000018490865,0.0005610397,0.012510653],"genre_scores_gemma":[0.0264186,0.00004367261,0.9705667,0.0020924748,0.00043773436,0.000020302663,0.000008437053,0.000034934175,0.00037713425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961272,0.000057430512,0.00053965853,0.0014659677,0.0009930739,0.00081670494],"domain_scores_gemma":[0.9973718,0.00026986082,0.00026857157,0.001420019,0.00032435762,0.00034537265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012345802,0.0005067012,0.00048408433,0.0008041695,0.00030304282,0.00076095015,0.002496429,0.00037703957,0.000009141817],"category_scores_gemma":[0.0001711946,0.0004754352,0.00010870464,0.0008826806,0.00030863358,0.0008057523,0.0016425131,0.0007045834,0.000092065544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009852092,0.00015520956,0.00004831546,0.00004686061,0.000014450019,0.000022925966,0.0016139451,0.32188317,0.000031728057,0.19998662,0.0007732887,0.47541362],"study_design_scores_gemma":[0.00016622087,0.000117261174,0.00005993195,0.00014585155,0.000007039905,0.0001318482,1.0620932e-7,0.94805354,0.00048033652,0.041421533,0.008592715,0.0008236143],"about_ca_topic_score_codex":0.000011487979,"about_ca_topic_score_gemma":0.000004798055,"teacher_disagreement_score":0.6261704,"about_ca_system_score_codex":0.00028054867,"about_ca_system_score_gemma":0.0004613608,"threshold_uncertainty_score":0.99976975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082078396,0.0013025069,0.9965741,0.00019396363,0.0003700585,0.00029686515,7.926754e-7,0.00021789706,0.00022301901],"genre_scores_gemma":[0.35264283,0.000040379953,0.6465277,0.0002934988,0.00018448394,0.00001398462,0.0000022223685,0.00004360109,0.0002512852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970572,0.000015585092,0.00027041713,0.0010498028,0.0008825359,0.0007244394],"domain_scores_gemma":[0.9977349,0.0008922418,0.0001042138,0.00081991183,0.0001980654,0.0002506727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061118515,0.00042654944,0.00036928052,0.0006611798,0.00018454158,0.00039317814,0.0017525104,0.00021053021,0.000009571653],"category_scores_gemma":[0.000102560596,0.00034785387,0.000028481489,0.0004985178,0.0005037988,0.0005255194,0.0011296052,0.00068584917,0.000034674635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007807799,0.000017071266,0.001333327,0.000066201894,0.000023482993,0.000088148605,0.0019983805,0.0028351145,0.0000712062,0.0017337154,0.000008488376,0.99181706],"study_design_scores_gemma":[0.004003235,0.002476686,0.06391044,0.0066719227,0.0000701113,0.0029711411,0.0000014265433,0.77176875,0.03153694,0.058690187,0.04692031,0.010978845],"about_ca_topic_score_codex":0.0000068394743,"about_ca_topic_score_gemma":0.000014755639,"teacher_disagreement_score":0.98083824,"about_ca_system_score_codex":0.00024188019,"about_ca_system_score_gemma":0.00069838145,"threshold_uncertainty_score":0.99989736},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002143292,0.00010582171,0.98269504,0.0014003032,0.0013666432,0.00033911204,0.0000020368564,0.00024330597,0.013826294],"genre_scores_gemma":[0.10778681,0.00006592448,0.88871896,0.0015465785,0.00040721768,0.000009043472,0.000009866968,0.000035929756,0.0014196539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963545,0.000052507425,0.0004864411,0.0014341426,0.0010452418,0.00062715355],"domain_scores_gemma":[0.9976809,0.00032654856,0.00019497194,0.0013357096,0.00024113148,0.00022071118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075662945,0.00044962982,0.00043825962,0.0007603503,0.00032673066,0.0007921764,0.0022786688,0.00029133703,0.00008556173],"category_scores_gemma":[0.00007074387,0.0004184984,0.00014094818,0.00052853016,0.00069233397,0.00048675956,0.0009127095,0.00073918974,0.00014015635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033107071,0.000009616096,0.0001477009,0.000017388054,0.0000070617125,0.000023756429,0.0002990884,0.043286696,0.000012856962,0.16349357,0.00001618136,0.79268277],"study_design_scores_gemma":[0.00035521184,0.00010583992,0.00079373165,0.00018636926,0.000005740571,0.00009118284,1.259248e-7,0.87134576,0.000160656,0.12357056,0.002701791,0.00068303564],"about_ca_topic_score_codex":0.000029655403,"about_ca_topic_score_gemma":0.00027638863,"teacher_disagreement_score":0.8280591,"about_ca_system_score_codex":0.00026842387,"about_ca_system_score_gemma":0.00060110004,"threshold_uncertainty_score":0.99982667},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009621798,0.0017219764,0.9797105,0.00024563074,0.001512679,0.00031948238,0.0000308213,0.0001296339,0.016233029],"genre_scores_gemma":[0.16761918,0.00015877205,0.83101577,0.0004984398,0.00053362525,0.000011770548,0.00001534291,0.00003939122,0.00010772544],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961395,0.00003178258,0.0005905739,0.0013600664,0.0013192239,0.0005588201],"domain_scores_gemma":[0.9969015,0.00023719622,0.00041614368,0.0018152802,0.00042656917,0.00020328074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011814492,0.00046088552,0.00060533965,0.0009118214,0.00014298326,0.00030172852,0.004563793,0.000281816,0.000013784227],"category_scores_gemma":[0.00010013496,0.00040727717,0.00015218132,0.0010406729,0.0011053826,0.0010061909,0.0017482704,0.00068578916,0.00001826492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012300886,0.000063803636,0.00014173321,0.00010018713,0.000016434404,0.00003955438,0.0008999436,0.0026527152,0.000097933465,0.47149286,0.00015959344,0.5243229],"study_design_scores_gemma":[0.00046116175,0.00037777162,0.00018150899,0.00063775165,0.000011501779,0.000056736644,5.3793514e-7,0.07645628,0.0015503833,0.8925651,0.026790183,0.00091109896],"about_ca_topic_score_codex":0.000036475358,"about_ca_topic_score_gemma":0.00021306431,"teacher_disagreement_score":0.5234118,"about_ca_system_score_codex":0.00012659193,"about_ca_system_score_gemma":0.00079265167,"threshold_uncertainty_score":0.99983793},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027164611,0.00016599653,0.99562865,0.0006330764,0.0012564262,0.00064251036,0.000048375932,0.00019126391,0.0014065276],"genre_scores_gemma":[0.36971834,0.000039660787,0.62100303,0.004331842,0.0031092397,0.000029064839,0.00008970365,0.000074171985,0.0016049581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99548227,0.000030778247,0.00062788115,0.0018938398,0.0010000931,0.0009651304],"domain_scores_gemma":[0.99705714,0.00019669649,0.0003649407,0.001979118,0.000111451176,0.0002906547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092894887,0.00065590214,0.00062052376,0.00075660174,0.00035852863,0.0008618091,0.005298018,0.00039167888,0.0000025936336],"category_scores_gemma":[0.00004387398,0.0006221168,0.00019293792,0.00040884607,0.00031193154,0.0007741834,0.0006210306,0.00051665446,0.000031913944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045962424,0.00004339254,0.0000054718985,0.000017418564,0.0000066416414,0.000011323962,0.0004237966,0.65823895,0.00007026187,0.014352833,0.000063412495,0.3267619],"study_design_scores_gemma":[0.00026140097,0.0002157476,0.000034590383,0.00013999587,0.0000050319445,0.000030474677,4.197758e-8,0.84952,0.000101442994,0.14425942,0.004838858,0.0005929848],"about_ca_topic_score_codex":0.000022812957,"about_ca_topic_score_gemma":0.000017048917,"teacher_disagreement_score":0.37462562,"about_ca_system_score_codex":0.00050790067,"about_ca_system_score_gemma":0.00084733556,"threshold_uncertainty_score":0.999623},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000147686405,0.0006551059,0.9897724,0.00019945322,0.0024112524,0.00024967195,0.000013016197,0.000277783,0.0064065782],"genre_scores_gemma":[0.10084419,0.00019601783,0.8954721,0.0011931898,0.0010831663,0.000016910282,0.000028916156,0.00006937623,0.0010961028],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963645,0.000026110081,0.00049114315,0.0015299126,0.00096547237,0.00062289863],"domain_scores_gemma":[0.99723554,0.00028614263,0.0002800973,0.0017793031,0.00021777491,0.00020117189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046742157,0.0005182689,0.00048767217,0.0006758034,0.00042728396,0.0006065412,0.004191908,0.00028943788,0.00006752349],"category_scores_gemma":[0.000039995753,0.00045549532,0.00011620477,0.0004088165,0.0006513016,0.0011739245,0.0029673055,0.00080691883,0.000076467564],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067281926,0.000037616814,0.000049627466,0.00002703017,0.000012988408,0.00009758287,0.00055798056,0.006805926,0.00007675556,0.14339523,0.00010905611,0.8488235],"study_design_scores_gemma":[0.00036431555,0.00017605264,0.0004021846,0.0005770869,0.000009918965,0.00009160941,1.17225724e-7,0.48742443,0.0016867293,0.48992327,0.018324198,0.0010200865],"about_ca_topic_score_codex":0.00006164599,"about_ca_topic_score_gemma":0.000024477273,"teacher_disagreement_score":0.8478034,"about_ca_system_score_codex":0.00016705002,"about_ca_system_score_gemma":0.00039132914,"threshold_uncertainty_score":0.99978966},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001567595,0.00029194017,0.93372065,0.00052026956,0.001734893,0.00019803573,0.000002189914,0.00020782462,0.063167416],"genre_scores_gemma":[0.045039948,0.000106863896,0.95019764,0.0034781683,0.000699734,0.000007856549,0.0000045529227,0.000049141752,0.0004160889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962516,0.00002241172,0.00042510178,0.001597612,0.0009399613,0.00076332974],"domain_scores_gemma":[0.99758303,0.00049582205,0.00021443324,0.0014282697,0.0001081881,0.00017027314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005729277,0.0005433295,0.0004839582,0.0007692965,0.00031606684,0.0007119029,0.0035248986,0.0002901697,0.00004006139],"category_scores_gemma":[0.000069726986,0.00046173233,0.00012559434,0.00050413667,0.0004023692,0.000414759,0.0012288085,0.00068569166,0.00013735473],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033118333,0.000019644915,0.000014036074,0.000013148006,0.0000057069774,0.0002284325,0.00037400154,0.02480845,0.000012422379,0.05466859,0.000049568014,0.91980267],"study_design_scores_gemma":[0.0002821543,0.000354139,0.000080351696,0.0005733724,0.0000050760723,0.00014107839,1.5813872e-7,0.58020437,0.00014921269,0.4099436,0.0072785453,0.0009879249],"about_ca_topic_score_codex":0.000013852402,"about_ca_topic_score_gemma":0.00002754979,"teacher_disagreement_score":0.9188148,"about_ca_system_score_codex":0.00021394667,"about_ca_system_score_gemma":0.00026060676,"threshold_uncertainty_score":0.99978346},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100381255,0.13642864,0.27849013,0.24976629,0.05201959,0.01963967,0.0003152259,0.0019282587,0.16103095],"genre_scores_gemma":[0.9705814,0.010966963,0.008241814,0.0028655746,0.0062253606,0.000014828525,0.000012251826,0.00008108715,0.0010107224],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99376005,0.0008202423,0.00050660025,0.0010340319,0.0025484755,0.001330624],"domain_scores_gemma":[0.99547535,0.0025570155,0.00018662773,0.000528603,0.0008190604,0.00043334297],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["sts"],"category_scores_codex":[0.016911637,0.00039792634,0.0005813189,0.0008283436,0.0021567007,0.0011200294,0.0015733582,0.0011281795,0.0001108969],"category_scores_gemma":[0.0015826975,0.0003533105,0.000072118564,0.0007505821,0.0053187236,0.00073923625,0.00115608,0.0066169854,0.000020743457],"study_design_candidate":"theoretical_or_conceptual","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.000026192442,0.00025158576,0.0019346108,0.0003732983,0.000022552073,0.000116624906,0.33782843,0.00015125917,0.00001551224,0.31112814,0.0010193987,0.3471324],"study_design_scores_gemma":[0.0005164176,0.0004373496,0.0027132737,0.0022149505,0.000015483125,0.0000060610846,0.00006930304,0.002364447,0.000042243282,0.86737,0.12302162,0.0012288315],"about_ca_topic_score_codex":0.004356049,"about_ca_topic_score_gemma":0.039924446,"teacher_disagreement_score":0.87020016,"about_ca_system_score_codex":0.00064846675,"about_ca_system_score_gemma":0.0017251722,"threshold_uncertainty_score":0.9999169},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000120901605,0.00063293445,0.99520564,0.00066375505,0.0024806676,0.0006453581,0.00006341317,0.00011141098,0.00007589759],"genre_scores_gemma":[0.28932613,0.00007691864,0.7089954,0.0006053995,0.0007802805,0.000026184975,0.0000823101,0.000042072126,0.00006531735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964285,0.000085848726,0.0006243762,0.001257565,0.0009024415,0.00070128083],"domain_scores_gemma":[0.9958323,0.001374856,0.00055113947,0.0016527993,0.00044393694,0.00014495423],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014681941,0.0004814522,0.00041409303,0.00068177877,0.00061024306,0.001069587,0.0028873004,0.00028799483,0.000023637811],"category_scores_gemma":[0.00030636883,0.00037925655,0.000098280056,0.000780914,0.0004823108,0.0006637209,0.0006792065,0.0006982977,0.000026501491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070353544,0.000042166692,0.00017469563,0.00005233352,0.000017945425,0.000004442227,0.0003514783,0.04295522,0.000514498,0.010049785,0.00009396696,0.9457364],"study_design_scores_gemma":[0.00021701002,0.00007141986,0.0024591375,0.00007640285,0.00003431325,0.000025742727,6.1051077e-7,0.9889943,0.00009083706,0.004441158,0.0031193953,0.00046964813],"about_ca_topic_score_codex":0.000070532165,"about_ca_topic_score_gemma":0.000013730416,"teacher_disagreement_score":0.9460391,"about_ca_system_score_codex":0.00021829896,"about_ca_system_score_gemma":0.00044062504,"threshold_uncertainty_score":0.9999674},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009043399,0.00033455767,0.9890953,0.0009112396,0.0026293271,0.00066216715,0.00001106591,0.00020555618,0.006141767],"genre_scores_gemma":[0.027146956,0.00004444657,0.9707449,0.0009257255,0.0003291683,0.00003351375,0.000023506773,0.0000503002,0.00070146885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951682,0.00006389367,0.00078805716,0.001840572,0.0012586121,0.0008806367],"domain_scores_gemma":[0.9972841,0.00028620102,0.00043024143,0.001430477,0.00031643393,0.00025251423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015646861,0.0006133504,0.0006782558,0.0012875368,0.00015330248,0.00067184906,0.0044541387,0.00044338583,0.000029331104],"category_scores_gemma":[0.0001839549,0.00059852697,0.00008049649,0.0012197504,0.0005324472,0.0008839752,0.0011980666,0.00095256756,0.00008987632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014171715,0.00017567944,0.00057292054,0.00023365777,0.000028789907,0.0018702474,0.011396968,0.30432782,0.00020250477,0.09175504,0.00020376257,0.58921844],"study_design_scores_gemma":[0.00030707024,0.00024001813,0.00021257508,0.00061346556,0.0000057281063,0.000103854916,3.2464558e-7,0.7234214,0.00017567135,0.2726195,0.0014752717,0.0008251451],"about_ca_topic_score_codex":0.00005665683,"about_ca_topic_score_gemma":0.000043205622,"teacher_disagreement_score":0.58839333,"about_ca_system_score_codex":0.0005136359,"about_ca_system_score_gemma":0.0015042626,"threshold_uncertainty_score":0.9996466},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002618761,0.0043586055,0.9924825,0.00016205176,0.0019668073,0.00041099946,0.00003005436,0.00013390173,0.00019323],"genre_scores_gemma":[0.7494445,0.000092443486,0.24949178,0.0000864333,0.0005772898,0.000023350796,0.000022260014,0.00006129838,0.00020062906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953989,0.00006174704,0.000638049,0.0014559075,0.0016600564,0.0007853666],"domain_scores_gemma":[0.99219316,0.0033511913,0.0002299397,0.003763545,0.00036091378,0.00010122397],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0022195764,0.0004013635,0.0005021462,0.00035151604,0.00019363669,0.0007172496,0.011765909,0.00025070753,0.0000016661197],"category_scores_gemma":[0.0013907516,0.00031712465,0.00006743832,0.0012095309,0.00066482596,0.00067839527,0.0050378754,0.0007207651,0.000008769111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083600125,0.000052450825,0.034477547,0.0003894939,0.000025960533,0.00031056153,0.00024528475,0.5509317,0.000024065695,0.01251495,0.00024527646,0.40077433],"study_design_scores_gemma":[0.00026798816,0.00008127444,0.019165235,0.00134345,0.000004712759,0.000095496805,2.8078352e-7,0.9628698,0.000051278337,0.014566248,0.00094428647,0.000609906],"about_ca_topic_score_codex":0.0004491243,"about_ca_topic_score_gemma":0.0003696456,"teacher_disagreement_score":0.74918264,"about_ca_system_score_codex":0.00068077067,"about_ca_system_score_gemma":0.0011000641,"threshold_uncertainty_score":0.99992806},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048405622,0.00047144436,0.99409956,0.0008346011,0.001926762,0.0011659223,0.00005992644,0.00015222069,0.0008055028],"genre_scores_gemma":[0.9279051,0.00004381034,0.061877105,0.00825065,0.00051944255,0.00012786855,0.000028026492,0.000070707276,0.0011773171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956419,0.000065521774,0.0006157427,0.0021041804,0.00087338814,0.0006992908],"domain_scores_gemma":[0.9969546,0.0008632064,0.00038613938,0.0009968058,0.0005173929,0.00028185337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013879034,0.0006252504,0.0007655487,0.0005144029,0.00036097938,0.00076461636,0.0017771188,0.00037540947,0.000042079166],"category_scores_gemma":[0.000053459124,0.0005992796,0.0002049347,0.00030603356,0.000598665,0.00090617273,0.0008184826,0.0005359008,0.000028364544],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001634953,0.000070861235,0.00034400608,0.00037479014,0.000037681006,0.000045949524,0.002415962,0.00011757201,0.00006710707,0.00246611,0.00009155349,0.99395204],"study_design_scores_gemma":[0.003049275,0.0015328308,0.0011476885,0.001879469,0.00007991076,0.001177522,0.000014378462,0.77220035,0.0025717046,0.11952446,0.09270959,0.004112841],"about_ca_topic_score_codex":0.00005165012,"about_ca_topic_score_gemma":0.0003928853,"teacher_disagreement_score":0.9898392,"about_ca_system_score_codex":0.00031901966,"about_ca_system_score_gemma":0.0004889257,"threshold_uncertainty_score":0.9996458},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011245983,0.0013224423,0.9939601,0.00026250322,0.0006324463,0.00032460983,0.0000042952993,0.00016070243,0.0022083267],"genre_scores_gemma":[0.18716002,0.00010336526,0.8113878,0.00066972093,0.00041748644,0.0000038199623,0.00000832004,0.00004745026,0.00020204877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599814,0.00003427729,0.00042670907,0.0018204985,0.000976617,0.0007437406],"domain_scores_gemma":[0.9976116,0.00030024894,0.00029680552,0.0013576505,0.00018162388,0.00025207596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005004059,0.0006166442,0.00056200405,0.00059727835,0.0004836996,0.00085155695,0.0025591026,0.0002574806,0.00001057767],"category_scores_gemma":[0.00002626355,0.0004812349,0.00006033073,0.000560166,0.00090492103,0.000559926,0.002208939,0.00068776356,0.000012958009],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008628892,0.0000260224,0.0005078826,0.000033229633,0.000013880995,0.00024290141,0.00037477823,0.022265732,0.00007007787,0.0056314482,0.00001722658,0.9708082],"study_design_scores_gemma":[0.00050639606,0.00038065622,0.0022733037,0.0007852334,0.000013029295,0.00055363594,3.418145e-7,0.9465689,0.00020424266,0.044975113,0.0027557209,0.0009834005],"about_ca_topic_score_codex":0.00005511793,"about_ca_topic_score_gemma":0.00015368595,"teacher_disagreement_score":0.9698248,"about_ca_system_score_codex":0.00014842424,"about_ca_system_score_gemma":0.00039245104,"threshold_uncertainty_score":0.9997639},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01342689,0.001821525,0.982242,0.000024245403,0.0006553224,0.00023785986,0.000004903793,0.00018963088,0.0013976378],"genre_scores_gemma":[0.9405228,0.00014386067,0.058954053,0.00008532855,0.0002143939,0.000004702356,0.0000022432694,0.000048677146,0.000023959072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998528,0.0000034878808,0.00024938255,0.0005163796,0.00029698788,0.00040575568],"domain_scores_gemma":[0.9993894,0.00012929842,0.000055237837,0.00029364292,0.00004184879,0.000090554466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008774133,0.000338321,0.00026221148,0.0002560809,0.0001631228,0.00017081849,0.00026241425,0.0001321061,0.000015232008],"category_scores_gemma":[0.000030719417,0.00033273114,0.000040529703,0.00013425252,0.00030672608,0.00031535575,0.000120191144,0.00055096194,0.0000043333434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036886374,0.000007774596,0.00014446492,0.00023773462,0.000011422388,0.00009245896,0.0018617848,0.70632386,0.0062174615,0.00066351733,5.6222666e-7,0.28443527],"study_design_scores_gemma":[0.0025774343,0.00044124958,0.004598182,0.0106465975,0.00008933577,0.0015540255,0.000007041148,0.1386994,0.18773466,0.64623713,0.0015345721,0.0058803516],"about_ca_topic_score_codex":0.0000037730201,"about_ca_topic_score_gemma":0.000028757866,"teacher_disagreement_score":0.9270959,"about_ca_system_score_codex":0.00022799657,"about_ca_system_score_gemma":0.000060482795,"threshold_uncertainty_score":0.9999125},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010106451,0.00039399075,0.9874606,0.0021862173,0.00088793365,0.00047025192,0.0000011877637,0.00011990517,0.008378834],"genre_scores_gemma":[0.11775276,0.00016062152,0.87807727,0.0036916777,0.00018195844,0.000013753861,0.000004767059,0.00001311883,0.000104047256],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978754,0.000025676083,0.0003850244,0.0006274586,0.000614249,0.0004721855],"domain_scores_gemma":[0.9984852,0.0001601752,0.00026578235,0.00092885335,0.00006770184,0.0000922931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011421421,0.00031394933,0.0002979303,0.0004201052,0.0004651313,0.0010057127,0.0022365386,0.00016534427,0.000001965357],"category_scores_gemma":[0.000013956184,0.00020524117,0.00005219304,0.00029997874,0.0005277938,0.0008261633,0.0012036512,0.00075296947,0.000009684867],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014698552,0.000007072213,0.000023283383,0.00007868684,0.000007004617,0.000004574929,0.0016823955,0.0020583577,0.0000018170056,0.19329773,0.000008673731,0.8028289],"study_design_scores_gemma":[0.00020474468,0.000107551714,0.0005384982,0.00014671881,0.0000052058144,0.00013746668,0.000004915832,0.47234994,0.000036434747,0.5235911,0.0024818103,0.00039558994],"about_ca_topic_score_codex":0.00005136374,"about_ca_topic_score_gemma":0.000084954474,"teacher_disagreement_score":0.8024334,"about_ca_system_score_codex":0.00008163559,"about_ca_system_score_gemma":0.0002134364,"threshold_uncertainty_score":0.969811},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014515672,0.00011175388,0.983059,0.000010432309,0.00017231386,0.0015890162,0.0000074974573,0.00019623594,0.00033808697],"genre_scores_gemma":[0.82525766,6.816487e-7,0.1744868,0.00001945605,0.00012114502,0.000036617697,0.0000019689057,0.0000540203,0.000021631615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983118,0.000042104948,0.0003933261,0.0004920148,0.0004285609,0.00033215518],"domain_scores_gemma":[0.9986274,0.0004653853,0.00016311012,0.00056376087,0.00012064958,0.0000596781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007729281,0.00029761353,0.00039167213,0.00016772942,0.00020690553,0.00012566912,0.00072204974,0.00011448043,0.0000090079375],"category_scores_gemma":[0.000016104374,0.00021604044,0.000042039024,0.00026246105,0.00016330197,0.00014028928,0.00011466232,0.00027071554,0.0000018309931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010456315,0.00005238331,0.00010049779,0.000050423067,0.000020426762,0.000004805153,0.002794635,0.98435956,0.0012457155,0.00006636233,0.0000020363182,0.011292678],"study_design_scores_gemma":[0.0005349315,0.0008139667,0.000031758256,0.00018378858,0.000021106827,0.000015891897,0.000014251233,0.9931345,0.0049288855,0.00004525932,0.000019908457,0.0002557751],"about_ca_topic_score_codex":0.000016327627,"about_ca_topic_score_gemma":0.000013551514,"teacher_disagreement_score":0.810742,"about_ca_system_score_codex":0.00023355619,"about_ca_system_score_gemma":0.000050758157,"threshold_uncertainty_score":0.88098735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034023393,0.00027735773,0.9912761,0.00045264032,0.0015353442,0.00024434557,0.000021513786,0.00010654674,0.006052159],"genre_scores_gemma":[0.13574654,0.000070465714,0.8621599,0.00047487445,0.00050023425,0.000011895818,0.000035741985,0.000036842284,0.0009635121],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708486,0.000019850686,0.0005154855,0.0011467753,0.00085010007,0.0003829557],"domain_scores_gemma":[0.99718153,0.00028500694,0.00030864862,0.0018132717,0.00027816725,0.00013335877],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039444177,0.0003281754,0.00039874393,0.00074265496,0.00024441248,0.00021313084,0.002564015,0.0002007398,0.00007104102],"category_scores_gemma":[0.00006643375,0.00029028064,0.00013089414,0.0006678026,0.00051290507,0.0007540695,0.0015215932,0.00050348724,0.000044814515],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006160227,0.00008902403,0.00009704979,0.000052940883,0.00002016245,0.00007630991,0.0006493546,0.1118219,0.00034967507,0.13193654,0.00014475797,0.75475615],"study_design_scores_gemma":[0.0006735881,0.00031711438,0.0011195734,0.00087471085,0.00002118876,0.00010948731,4.487126e-7,0.3702938,0.003159683,0.6197808,0.0027040665,0.000945525],"about_ca_topic_score_codex":0.00011492785,"about_ca_topic_score_gemma":0.00004943153,"teacher_disagreement_score":0.7538106,"about_ca_system_score_codex":0.0001876096,"about_ca_system_score_gemma":0.0007510533,"threshold_uncertainty_score":0.99995494},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007368383,0.0006531321,0.98791194,0.00048355988,0.0012273248,0.0005484639,0.0000045114075,0.0003275056,0.008106749],"genre_scores_gemma":[0.15747978,0.00017372858,0.83535576,0.0046349037,0.0009109885,0.00005664841,0.000008211486,0.00008715275,0.0012928395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955139,0.000054568205,0.0005183131,0.0021377413,0.0009392029,0.000836267],"domain_scores_gemma":[0.9974505,0.0002967288,0.00021010567,0.001473313,0.000180767,0.0003886195],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008435678,0.0007384461,0.0006833507,0.0010679911,0.000442654,0.0010425226,0.0024687506,0.00025921708,0.000005533773],"category_scores_gemma":[0.00013930934,0.0006495774,0.00013050553,0.00052575424,0.00051595725,0.00035952643,0.001483622,0.00060428114,0.00005139652],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008080202,0.00001276685,0.000007954802,0.000049109603,0.000011810942,0.00004026201,0.00078641693,0.010375006,0.00036642092,0.0031804766,0.00010155704,0.98506016],"study_design_scores_gemma":[0.0007223298,0.00079648907,0.00009342363,0.0008813563,0.000021359012,0.0007925224,0.0000011009297,0.85189337,0.010231994,0.08732578,0.044313937,0.0029263494],"about_ca_topic_score_codex":0.00004219396,"about_ca_topic_score_gemma":0.000043984124,"teacher_disagreement_score":0.9821338,"about_ca_system_score_codex":0.00018326308,"about_ca_system_score_gemma":0.00022102767,"threshold_uncertainty_score":0.9999945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055586654,0.00012706095,0.9705759,0.00016504568,0.0019256298,0.0005159293,0.000006110807,0.00025627782,0.026372435],"genre_scores_gemma":[0.021955254,0.000015614023,0.9750874,0.002011679,0.00053732673,0.000016388956,0.000009480655,0.000043111304,0.00032376574],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956494,0.000044644767,0.0005450627,0.0018992069,0.0009703546,0.000891346],"domain_scores_gemma":[0.9976203,0.00027684093,0.00020647616,0.0013278592,0.00023152446,0.00033703793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017735575,0.0005898226,0.0005040637,0.0019582831,0.0003332572,0.00059819163,0.003435782,0.0003499294,0.0000114690365],"category_scores_gemma":[0.000062017,0.000563118,0.00019262616,0.0014630463,0.00044463028,0.0006388396,0.0014733108,0.00088364247,0.00010623122],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000738607,0.0000423314,0.000004602378,0.00003569405,0.000009518776,0.000035543435,0.00084111065,0.01574951,0.000066081826,0.013908321,0.0000094805355,0.96929044],"study_design_scores_gemma":[0.00031508956,0.0002560046,0.00008125796,0.00052101235,0.000010672324,0.00023375308,7.608387e-7,0.46419442,0.00096959656,0.5313061,0.0008711706,0.001240203],"about_ca_topic_score_codex":0.000012104369,"about_ca_topic_score_gemma":0.000027007982,"teacher_disagreement_score":0.96805024,"about_ca_system_score_codex":0.00016995562,"about_ca_system_score_gemma":0.00016226589,"threshold_uncertainty_score":0.999682},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003764138,0.0013775823,0.9925472,0.00144144,0.0024190133,0.00081413897,0.00002872429,0.00011151602,0.0012566078],"genre_scores_gemma":[0.017098023,0.00017313339,0.9769825,0.0021211193,0.0011653741,0.00011616297,0.000008299067,0.00004497251,0.0022904307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692124,0.00001792608,0.0004604166,0.0012508838,0.0007223716,0.00062716805],"domain_scores_gemma":[0.99662334,0.0013363595,0.00025320204,0.0013507963,0.00031059523,0.00012571063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078248756,0.0004538789,0.0003981701,0.0002896449,0.0004912826,0.0004095812,0.0029297303,0.00017885685,0.000053552423],"category_scores_gemma":[0.0001320409,0.00029977868,0.00016055908,0.0003464747,0.0009101608,0.00082992786,0.0012023428,0.00054260646,0.00010708268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002739952,0.0000070426977,0.0000027819697,0.000033733744,0.000009140902,0.000008403221,0.00053845363,0.00414912,0.000046887075,0.25446093,0.00015768009,0.74058306],"study_design_scores_gemma":[0.00008941019,0.00011163755,0.000009334719,0.00023673825,0.000005820522,0.00006302843,8.0237686e-7,0.8267978,0.00044406773,0.074069135,0.097670645,0.0005015878],"about_ca_topic_score_codex":0.00002796954,"about_ca_topic_score_gemma":0.000085378946,"teacher_disagreement_score":0.82264864,"about_ca_system_score_codex":0.00015460292,"about_ca_system_score_gemma":0.0005325813,"threshold_uncertainty_score":0.99994546},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002874748,0.00013680827,0.98675543,0.00088932377,0.0025810571,0.00040700444,0.000010743963,0.00025090852,0.008681219],"genre_scores_gemma":[0.2348767,0.000046089364,0.75098574,0.012922597,0.0006445762,0.000024610872,0.000010434178,0.00009035342,0.0003989129],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952839,0.00009997597,0.000548052,0.002057922,0.0010632061,0.00094693014],"domain_scores_gemma":[0.99641144,0.0007949995,0.00030084094,0.002033224,0.00014664575,0.00031282817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010669099,0.0007643595,0.0006660426,0.0012455055,0.0005433265,0.0006143563,0.0042144493,0.00039917202,0.00007707744],"category_scores_gemma":[0.000107839034,0.0007153618,0.000343042,0.0009113739,0.0015783274,0.00042881054,0.00093659485,0.0011393274,0.000111193185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066841734,0.00014557595,0.00005190647,0.000054337634,0.000032543823,0.00013563035,0.00082332385,0.038525254,0.00007500579,0.45509553,0.0005094566,0.5044846],"study_design_scores_gemma":[0.0008034506,0.0004594826,0.00014715217,0.00041375787,0.000012798248,0.00005683649,2.2984263e-7,0.17438716,0.00079407083,0.8181264,0.0034001449,0.0013985238],"about_ca_topic_score_codex":0.0000150548785,"about_ca_topic_score_gemma":0.000036890076,"teacher_disagreement_score":0.5030861,"about_ca_system_score_codex":0.0002719626,"about_ca_system_score_gemma":0.00029786504,"threshold_uncertainty_score":0.9995297},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013749628,0.00233133,0.9918994,0.00056827534,0.00042338925,0.00047064846,0.000003998965,0.000677685,0.0036115756],"genre_scores_gemma":[0.12148276,0.000017696591,0.8772913,0.0008002083,0.00022352792,0.000009854732,0.000011996391,0.000028182989,0.00013446112],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996296,0.00003128758,0.0005155133,0.0015963223,0.0009697739,0.00059112645],"domain_scores_gemma":[0.9977426,0.0001947043,0.00037319315,0.0011522351,0.00039467376,0.00014262085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010633036,0.00052723015,0.0005395514,0.0010073005,0.0002819373,0.00090957526,0.003293552,0.0004234355,0.000012836831],"category_scores_gemma":[0.00018276213,0.000471637,0.00012567188,0.0008560797,0.0007211423,0.0007855377,0.0011360081,0.001076931,0.0000144975365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003438854,0.00003319683,0.00001096666,0.00013540107,0.000009786184,0.000098540164,0.00063223497,0.0031904934,0.00064055354,0.26226273,0.000013695815,0.732969],"study_design_scores_gemma":[0.00025470712,0.00007850599,0.0000052767286,0.0009989301,0.000008147378,0.00016829604,1.2333723e-7,0.26069987,0.0049862657,0.73196775,0.00015238584,0.00067970814],"about_ca_topic_score_codex":0.000023282613,"about_ca_topic_score_gemma":0.0000049113387,"teacher_disagreement_score":0.73228925,"about_ca_system_score_codex":0.0006282586,"about_ca_system_score_gemma":0.00076078845,"threshold_uncertainty_score":0.99977356},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006847027,0.00007210206,0.9912761,0.00096050027,0.0038908687,0.0012151084,0.000016373178,0.0002587637,0.0022417328],"genre_scores_gemma":[0.076829284,0.000026291238,0.91812575,0.0026625937,0.0014304284,0.00009951556,0.000056573295,0.000084870604,0.00068468176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99478877,0.000036420384,0.0007782906,0.002275608,0.0011494486,0.0009714575],"domain_scores_gemma":[0.99596816,0.00087891426,0.00044314584,0.002015677,0.00043729605,0.00025678572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012164791,0.00082393474,0.0008436553,0.0012873611,0.00062142935,0.0009742377,0.0038838338,0.00049320393,0.00001663318],"category_scores_gemma":[0.00010715681,0.000794125,0.00032556284,0.00084442616,0.000964076,0.00046318094,0.00084863394,0.0007927875,0.000033527238],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003440398,0.00005841379,0.000012725709,0.000074619325,0.000029092382,0.000031625706,0.00038007056,0.045642152,0.00006719932,0.1344805,0.00005834683,0.81913084],"study_design_scores_gemma":[0.0011848079,0.0004331961,0.000042613792,0.00039057955,0.000012423673,0.000035256457,1.2727493e-7,0.71941674,0.0016868875,0.2740667,0.001935775,0.0007949335],"about_ca_topic_score_codex":0.00002301255,"about_ca_topic_score_gemma":0.00004724936,"teacher_disagreement_score":0.8183359,"about_ca_system_score_codex":0.00033286144,"about_ca_system_score_gemma":0.00057781645,"threshold_uncertainty_score":0.999451},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012842246,0.00009042859,0.99274147,0.00036976044,0.00025933894,0.00043833052,0.000005569584,0.0001557421,0.0058109416],"genre_scores_gemma":[0.5409053,0.0000014561869,0.45810738,0.00091689435,0.00002974237,0.000006603906,0.000010405445,0.000013392036,0.000008807185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967712,0.00007479129,0.00061335694,0.0012016192,0.0008667539,0.00047226145],"domain_scores_gemma":[0.99783003,0.00034856697,0.00051246415,0.0007591795,0.00038656653,0.0001631963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051790045,0.00049363385,0.00065995957,0.0006218391,0.00033651627,0.0004504744,0.0012215191,0.00028776174,0.000058875612],"category_scores_gemma":[0.000034851797,0.00041965806,0.00011684833,0.00070693396,0.0021401348,0.00038799344,0.00015998736,0.0006519929,0.000002068894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024282082,0.000103817554,0.0017931318,0.000118321754,0.00001130177,0.000023048582,0.00015751662,0.83881676,0.00007386762,0.015176692,0.00000286558,0.1436984],"study_design_scores_gemma":[0.00072979584,0.0001884551,0.00052294304,0.0005346045,0.000014276945,0.000064728774,5.9083646e-7,0.99276036,0.0008768741,0.0037659297,0.000019904448,0.00052154146],"about_ca_topic_score_codex":0.000012739855,"about_ca_topic_score_gemma":0.000020797253,"teacher_disagreement_score":0.5407769,"about_ca_system_score_codex":0.00022777745,"about_ca_system_score_gemma":0.0010921697,"threshold_uncertainty_score":0.99982554},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000093416034,0.00037450943,0.99730104,0.00040606078,0.0010768098,0.00020550867,0.000004772994,0.000041397903,0.00049649837],"genre_scores_gemma":[0.55773365,0.001073581,0.43614206,0.003341781,0.0005648566,0.000012584791,0.000012354515,0.00006531808,0.001053803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965135,0.000034426295,0.00057203276,0.00087218574,0.0013098769,0.0006979821],"domain_scores_gemma":[0.9968122,0.0007452323,0.00032576054,0.0016381289,0.00031562918,0.00016300025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018947755,0.00029872646,0.00033391902,0.0008714497,0.00030612032,0.00094783946,0.005031556,0.00013162148,0.000006465553],"category_scores_gemma":[0.00041238143,0.0002140576,0.00007223185,0.0019227474,0.0026359223,0.001621309,0.0020236871,0.00044812355,0.000019848892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018755263,0.000037163572,0.00058464415,0.000015417862,0.0000030915737,0.000010296558,0.00058509107,0.009218726,0.000096129654,0.2090916,0.000031429787,0.7803245],"study_design_scores_gemma":[0.00018964014,0.000077794095,0.0010880631,0.0003135385,0.000005310765,0.000019683328,2.9072277e-7,0.9316124,0.0014240887,0.045535833,0.019197678,0.0005357255],"about_ca_topic_score_codex":0.000033758646,"about_ca_topic_score_gemma":0.00018476768,"teacher_disagreement_score":0.9223936,"about_ca_system_score_codex":0.00020165829,"about_ca_system_score_gemma":0.000744418,"threshold_uncertainty_score":0.97121656},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009725214,0.0011774801,0.994613,0.00025600573,0.0009908687,0.00030312015,0.000008701141,0.00021383964,0.0023397265],"genre_scores_gemma":[0.04217165,0.0004197386,0.95548254,0.0008081904,0.0006507144,0.000011638591,0.000013232975,0.00004698905,0.00039530915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959195,0.00002728335,0.0004080725,0.0017270048,0.0012048149,0.00071328593],"domain_scores_gemma":[0.99713373,0.00043884292,0.0002501073,0.001733857,0.00021605386,0.0002274301],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036834713,0.00056526135,0.0005085237,0.0007265244,0.0005087147,0.00046662378,0.0037957383,0.00024644873,0.000014810531],"category_scores_gemma":[0.000039306746,0.00042951686,0.00009426775,0.0005711843,0.0007509536,0.0010343883,0.0020215134,0.00075071416,0.000041450887],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009622722,0.00002895896,0.00021589462,0.000022498689,0.000010401025,0.00041961682,0.0006372534,0.018183328,0.00017592726,0.0022332494,0.00008782492,0.9779754],"study_design_scores_gemma":[0.00059586926,0.00034225849,0.00028792978,0.0006774713,0.0000068442855,0.0005831992,1.551819e-7,0.9567533,0.0027500214,0.012821769,0.023954842,0.0012263226],"about_ca_topic_score_codex":0.000044284356,"about_ca_topic_score_gemma":0.00005698389,"teacher_disagreement_score":0.9767491,"about_ca_system_score_codex":0.00019017259,"about_ca_system_score_gemma":0.00057028193,"threshold_uncertainty_score":0.99981564},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005469511,0.16571714,0.8235682,0.00025264174,0.002210126,0.0009576058,0.000029306599,0.00039098808,0.0014044872],"genre_scores_gemma":[0.8750985,0.06508374,0.056986608,0.0004882167,0.0016696859,0.00003403,0.00039268413,0.00021352967,0.000032976084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749076,0.000028992547,0.0005315105,0.00066902034,0.000514946,0.00076479506],"domain_scores_gemma":[0.99811023,0.0002335078,0.00010876572,0.0013268185,0.000053274918,0.00016737575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011599208,0.0005114303,0.0004906995,0.0004428826,0.00009257129,0.00018744566,0.0011277723,0.00046553885,0.000021068434],"category_scores_gemma":[0.0000401557,0.00051197456,0.000040744602,0.00021869979,0.0002862737,0.001299178,0.0010142887,0.0010241249,0.000014706644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025471675,0.00000298411,0.000017166281,0.00009201032,0.0000053570593,0.000008387481,0.00052853615,0.56695145,0.0000063859147,0.00009723952,0.000008417577,0.4322795],"study_design_scores_gemma":[0.00020719641,0.000035983045,0.0002814313,0.00063595735,0.0000103757375,0.00006111366,0.0000017333081,0.9718529,0.000012870284,0.0015658326,0.024800407,0.00053418474],"about_ca_topic_score_codex":0.000011486346,"about_ca_topic_score_gemma":0.00044791837,"teacher_disagreement_score":0.869629,"about_ca_system_score_codex":0.0003110495,"about_ca_system_score_gemma":0.000069532085,"threshold_uncertainty_score":0.9997332},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004554852,0.0001122903,0.9918874,0.00011745563,0.000052990123,0.0001691347,0.000015972522,0.000044302968,0.0030455892],"genre_scores_gemma":[0.9837368,0.000005085513,0.015270212,0.00013094759,0.0005538958,0.000009217036,0.00014516023,0.00002104877,0.00012764503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974522,0.00019477135,0.0006014506,0.00077206705,0.00044763004,0.0005319079],"domain_scores_gemma":[0.9981701,0.00037664987,0.00038237587,0.00085890153,0.00011626812,0.00009574932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015188315,0.00044748874,0.0012287177,0.0017344512,0.00048355965,0.00023363098,0.0010618258,0.00017644666,0.0001059986],"category_scores_gemma":[0.000006573054,0.00044878916,0.0005410785,0.0032022146,0.00049164094,0.00008346281,0.0009218596,0.001177352,0.00000256217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072864063,0.000051105,0.1181882,0.000009413635,0.0013924048,0.0000027433537,0.0005694133,0.45758376,0.0000021109313,0.023329802,0.000021663498,0.3988421],"study_design_scores_gemma":[0.00008717515,0.000025674784,0.0134037165,0.000035675163,0.0009861708,2.2402608e-7,0.0000012757716,0.7627664,0.0000037500063,0.22214246,0.00016141558,0.00038604706],"about_ca_topic_score_codex":0.001447078,"about_ca_topic_score_gemma":0.011646186,"teacher_disagreement_score":0.97918195,"about_ca_system_score_codex":0.00025302087,"about_ca_system_score_gemma":0.000078546094,"threshold_uncertainty_score":0.9997964},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016372518,0.0011945148,0.9933276,0.0018661439,0.0002662605,0.0003024864,0.000010199182,0.0001851208,0.0026839445],"genre_scores_gemma":[0.47472623,0.000101796286,0.52068317,0.0036009827,0.00027857308,0.000012381555,0.0000088556235,0.000043435717,0.0005445678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953753,0.000023539784,0.0006055328,0.0021176878,0.001007767,0.00087016827],"domain_scores_gemma":[0.9979808,0.00014575545,0.0003242218,0.0010080404,0.00021102998,0.00033020368],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00046162895,0.000730735,0.0006296964,0.00048592148,0.00044172019,0.0013952598,0.0030396674,0.00046030307,0.000008044568],"category_scores_gemma":[0.000070228285,0.00062355644,0.00010932635,0.00051998836,0.0006720505,0.0009754482,0.0008125759,0.001030942,0.000008576079],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050461854,0.0000389219,0.000020108415,0.00010913509,0.000010082847,0.000059827133,0.0007554161,0.053617816,0.00045656448,0.035644237,0.000068769994,0.9092141],"study_design_scores_gemma":[0.00014003289,0.00011066525,0.000014155833,0.00027544601,0.000006652318,0.00008697642,1.4187289e-7,0.72998667,0.0003994453,0.26829767,0.000094978284,0.0005871816],"about_ca_topic_score_codex":0.00000889667,"about_ca_topic_score_gemma":0.000038704224,"teacher_disagreement_score":0.9086269,"about_ca_system_score_codex":0.00015450407,"about_ca_system_score_gemma":0.0007097517,"threshold_uncertainty_score":0.99964136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007221951,0.0017121662,0.99151206,0.00069874496,0.0044460986,0.00079674117,0.000006409805,0.00024905356,0.00050650985],"genre_scores_gemma":[0.37351176,0.0006891452,0.61796504,0.0027863204,0.002752976,0.000053668024,0.00002772686,0.00013497738,0.0020784035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948722,0.00012015212,0.0008797287,0.00181042,0.0014386439,0.000878857],"domain_scores_gemma":[0.9970989,0.00035336916,0.0007548801,0.0012148839,0.00026383175,0.0003141149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012685362,0.0006066414,0.00079426356,0.00084926153,0.0006282738,0.0006157726,0.002770018,0.00032957463,0.000012051194],"category_scores_gemma":[0.000053308042,0.00055931736,0.00016875798,0.0005472821,0.00027556292,0.0007456809,0.0008395222,0.00077690906,0.00008095837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010850965,0.00007662609,0.0005599979,0.0004701139,0.000042196734,0.0002724164,0.013227669,0.023625514,0.00016497343,0.0033684403,0.0016466759,0.9565345],"study_design_scores_gemma":[0.00036889868,0.00028177726,0.0002409392,0.0014949634,0.0000038976523,0.0003369283,9.2002415e-7,0.98560566,0.00013912139,0.0011736908,0.009462323,0.0008908554],"about_ca_topic_score_codex":0.00027343517,"about_ca_topic_score_gemma":0.000056971803,"teacher_disagreement_score":0.96198016,"about_ca_system_score_codex":0.0008252023,"about_ca_system_score_gemma":0.0012707906,"threshold_uncertainty_score":0.9996858},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40986335,0.000020099655,0.5885399,0.0010841445,0.000050542963,0.00037935656,4.5098847e-7,0.000057198504,0.000004963604],"genre_scores_gemma":[0.5601325,0.0000030284443,0.43910947,0.0006787875,0.000029009138,0.000040680512,0.0000017634394,0.0000046415425,9.6962935e-8],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885327,0.000017202345,0.00018727493,0.00041021936,0.0003144879,0.0002175697],"domain_scores_gemma":[0.99932086,0.00010858001,0.000056004414,0.00037173711,0.00006652947,0.000076257485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013600235,0.00010934772,0.00014004567,0.00024046714,0.00006238453,0.000053878855,0.00021352702,0.000054308617,0.000015962452],"category_scores_gemma":[0.00017309176,0.0000888129,0.000025994701,0.0011362133,0.00014834716,0.00020542582,0.00007506833,0.0002852561,0.000010151581],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012692908,0.00027276383,0.22839803,0.000015450447,0.0000018733406,0.0000064184164,0.0005863791,0.0060742437,0.0733356,0.0000486772,0.0000130047165,0.6912349],"study_design_scores_gemma":[0.0003426883,0.000085246116,0.35829183,0.00036850857,0.0000046082755,0.000008290737,6.4120593e-7,0.5163373,0.0346535,0.089738294,0.000020645457,0.00014846606],"about_ca_topic_score_codex":0.00014297114,"about_ca_topic_score_gemma":0.0000101939095,"teacher_disagreement_score":0.6910864,"about_ca_system_score_codex":0.00006601056,"about_ca_system_score_gemma":0.00004767057,"threshold_uncertainty_score":0.36216852},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000132503,0.00014685965,0.99522805,0.0010931762,0.00040080058,0.0010920701,0.000010125255,0.00035928248,0.001656356],"genre_scores_gemma":[0.4133708,0.000020258705,0.5855733,0.00028226935,0.000367278,0.00016283758,0.000019877489,0.000027844497,0.00017551934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730766,0.000020746109,0.00048228394,0.0011892699,0.00049140654,0.00050864153],"domain_scores_gemma":[0.99773836,0.000382974,0.0003854198,0.0011208156,0.00021635811,0.00015605072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007019013,0.00036532813,0.00033010056,0.00056917476,0.00038354888,0.00036420563,0.001735302,0.00036276237,0.000007662462],"category_scores_gemma":[0.00005430298,0.00036921934,0.00014851996,0.0004691994,0.00032569683,0.00066932314,0.0003925766,0.0004042971,0.000023887513],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029917112,0.00003947109,0.000031417305,0.000027963586,0.000006114392,3.3232064e-7,0.0001983835,0.0027238415,0.0002527311,0.110920936,0.000017682249,0.8857781],"study_design_scores_gemma":[0.00014088688,0.00008323602,0.0002463946,0.00005377285,0.000009416467,0.000010607122,2.4732662e-7,0.8216946,0.002591425,0.17086643,0.0039015138,0.00040147663],"about_ca_topic_score_codex":0.00000916311,"about_ca_topic_score_gemma":0.000028722363,"teacher_disagreement_score":0.88537663,"about_ca_system_score_codex":0.000321193,"about_ca_system_score_gemma":0.00023275717,"threshold_uncertainty_score":0.99987596},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021090484,0.00010628814,0.98596627,0.00042019496,0.00096687424,0.00073283474,0.0000017520163,0.0010386084,0.010765085],"genre_scores_gemma":[0.010189711,0.0000148630725,0.9850063,0.0021150475,0.0005205471,0.000019956702,0.0000017012403,0.000041688763,0.0020901887],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99546003,0.00002819793,0.0005141518,0.0022213862,0.0010434039,0.00073281425],"domain_scores_gemma":[0.99702364,0.00014157096,0.00024684146,0.0019382219,0.00025334553,0.00039636486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005515589,0.0006295186,0.0005367773,0.0016117208,0.00025791855,0.00053859275,0.0036705045,0.0004220927,0.000014778467],"category_scores_gemma":[0.000115296534,0.0006333149,0.00015235959,0.0013659336,0.0001609603,0.00084610266,0.0011569966,0.0009682324,0.00011698924],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056690747,0.0000135983855,6.0021995e-7,0.000011004758,0.0000030811643,0.000017554888,0.00021389559,0.013195948,0.00029591742,0.004580142,0.000054029384,0.98160857],"study_design_scores_gemma":[0.0004904865,0.0010388992,0.000119244534,0.0005344373,0.000015821917,0.0006139756,2.7276067e-7,0.20907553,0.056960624,0.6733767,0.055090386,0.002683631],"about_ca_topic_score_codex":0.000031336334,"about_ca_topic_score_gemma":0.000054580618,"teacher_disagreement_score":0.97892493,"about_ca_system_score_codex":0.00066340464,"about_ca_system_score_gemma":0.00045087357,"threshold_uncertainty_score":0.9996118},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003519179,0.0006877884,0.9934662,0.00015466151,0.00090800365,0.00030005816,0.0000035004864,0.00022324594,0.0039046414],"genre_scores_gemma":[0.8743635,0.00011637112,0.12351891,0.00044140432,0.00075082807,0.000009240371,0.0000054402567,0.00005796537,0.0007363578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621636,0.000050008155,0.0005746336,0.0015437264,0.0009241341,0.0006911268],"domain_scores_gemma":[0.99830556,0.00029375998,0.00027221025,0.0007922061,0.0001510458,0.00018521489],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008719184,0.00050503056,0.0005434196,0.0005891494,0.00048572698,0.0010544837,0.0018198009,0.00023864707,0.000009906865],"category_scores_gemma":[0.000032163778,0.00049217313,0.00009918331,0.00040624768,0.0002680723,0.00077404006,0.0010658676,0.0008857141,0.000015054839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035327967,0.000024872725,0.00013955247,0.000039103368,0.000021161597,0.00015602635,0.0038090588,0.18860598,0.00005653696,0.33146158,0.0000023327525,0.47568026],"study_design_scores_gemma":[0.00019485765,0.00015738473,0.00016340383,0.0010827554,0.000008004938,0.00011962175,0.0000022107927,0.86333156,0.00028797588,0.13092443,0.0028851512,0.0008426545],"about_ca_topic_score_codex":0.00006877785,"about_ca_topic_score_gemma":0.000023382954,"teacher_disagreement_score":0.8740116,"about_ca_system_score_codex":0.00034211646,"about_ca_system_score_gemma":0.00020288161,"threshold_uncertainty_score":0.99998254},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004722268,0.002375113,0.9925144,0.00040977175,0.0021678435,0.00032681436,0.000008238673,0.0009078956,0.0012427395],"genre_scores_gemma":[0.009210922,0.00021594453,0.9883711,0.0009898848,0.0006320906,0.000014929728,0.0000057492334,0.00006737544,0.0004920523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99519444,0.00005291976,0.00062341144,0.0020737604,0.0010250352,0.0010304446],"domain_scores_gemma":[0.9961932,0.00087374554,0.00029313337,0.0022019432,0.00026571026,0.00017226997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007259033,0.0008304216,0.0007591581,0.0005783644,0.0002445965,0.0004048051,0.0049381093,0.0004804784,0.000016760296],"category_scores_gemma":[0.0002416832,0.00078776124,0.00018883051,0.00081017206,0.0006456306,0.0013784361,0.0016681646,0.0011634757,0.00006287677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018056821,0.000008193695,0.0000046006603,0.000025769683,0.000006777677,0.00007420193,0.00045340304,0.69126815,0.00004876524,0.008417742,0.000008452725,0.29968214],"study_design_scores_gemma":[0.00023016233,0.000121728415,0.000041398354,0.0003266951,0.000008909926,0.00013587093,2.2338286e-7,0.44994876,0.0025056768,0.54308915,0.002294804,0.0012966583],"about_ca_topic_score_codex":0.000009982814,"about_ca_topic_score_gemma":0.000030529227,"teacher_disagreement_score":0.53467137,"about_ca_system_score_codex":0.00050007383,"about_ca_system_score_gemma":0.00050376495,"threshold_uncertainty_score":0.99945736},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000056295294,0.0008497122,0.9952754,0.000088335044,0.0008530464,0.000311005,0.000025064719,0.00025685047,0.0023349565],"genre_scores_gemma":[0.25069767,0.000054940065,0.7475501,0.00045202498,0.0008893387,0.000024813173,0.00006352843,0.00005834278,0.00020926679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982452,0.000014060976,0.00031585415,0.0005099899,0.00039556628,0.0005193612],"domain_scores_gemma":[0.99907595,0.0002315148,0.00004342615,0.00042123834,0.00007367244,0.00015418077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040174177,0.00039105676,0.00039803336,0.00020983607,0.00010427039,0.0001323388,0.0006827993,0.0003891441,0.00008014542],"category_scores_gemma":[0.000047165136,0.00030347062,0.000088871755,0.00023551456,0.0003093456,0.00020741415,0.00013272942,0.0005676915,0.000039309107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008442017,0.000024776791,0.000012192115,0.00003880069,0.00002385017,0.0000067674046,0.00011657511,0.9047497,0.0087521775,0.006094114,0.000050960458,0.080121666],"study_design_scores_gemma":[0.00027856164,0.00004443364,0.000082682534,0.000053600856,0.00001287679,0.000022209948,6.238164e-8,0.9860558,0.0010570643,0.010954705,0.0009573274,0.00048068943],"about_ca_topic_score_codex":0.0000019566958,"about_ca_topic_score_gemma":0.0000013532699,"teacher_disagreement_score":0.25069207,"about_ca_system_score_codex":0.00014541027,"about_ca_system_score_gemma":0.00006689227,"threshold_uncertainty_score":0.99994177},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013670561,0.00026393746,0.9897991,0.0037956263,0.0013576492,0.0011335592,0.000012822731,0.0003177718,0.0033058973],"genre_scores_gemma":[0.035814684,0.00008871408,0.95531845,0.006660437,0.00028830455,0.00012004255,0.000003018813,0.000059661103,0.0016466719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99615115,0.000028362436,0.0005784788,0.0017469585,0.00071849,0.00077653176],"domain_scores_gemma":[0.99720883,0.000352054,0.00025501035,0.0016026831,0.0003367426,0.00024470495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009862641,0.00059770263,0.000658534,0.00092252175,0.00025803706,0.0010170117,0.0040752636,0.00035363148,0.000004906045],"category_scores_gemma":[0.00008852811,0.0005203572,0.00018429522,0.000535681,0.00015365194,0.0007464021,0.001109239,0.00042673716,0.000013390213],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001136797,0.000073096475,0.00004809556,0.00020557072,0.00003165448,0.00003815067,0.001349658,0.036424708,0.00046383726,0.11913295,0.008040601,0.8341803],"study_design_scores_gemma":[0.00020673558,0.000211406,0.0000075112484,0.00039722788,0.000006758719,0.000036189405,1.0298541e-7,0.7653608,0.0029573007,0.1890216,0.040952202,0.0008421902],"about_ca_topic_score_codex":0.000013171169,"about_ca_topic_score_gemma":0.00014999878,"teacher_disagreement_score":0.83333814,"about_ca_system_score_codex":0.00025260155,"about_ca_system_score_gemma":0.00046116425,"threshold_uncertainty_score":0.9997248},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026415856,0.00012761856,0.9969277,0.000741463,0.0007362686,0.00037875888,0.0000049163245,0.00013066301,0.0006884589],"genre_scores_gemma":[0.56647265,0.000012886748,0.43021473,0.0003428528,0.00088793156,0.000013932485,0.000005470113,0.000038737002,0.0020107953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730957,0.000034254186,0.00043511062,0.0011666148,0.00050414406,0.00055032363],"domain_scores_gemma":[0.9975901,0.0012536149,0.00022441742,0.0005568455,0.00021416496,0.00016084309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012299799,0.00040103126,0.0004652279,0.0005124501,0.000526725,0.0006629417,0.0014407886,0.0003581991,0.000007594615],"category_scores_gemma":[0.00030904083,0.00035636852,0.0001193517,0.00014141743,0.00078685407,0.00054117513,0.0008795104,0.001361777,0.000010088388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019757165,0.0000046273526,0.000035301386,0.000024165993,0.000008998656,0.0000036741405,0.0015602859,0.02887069,0.00024876988,0.82834953,9.565903e-7,0.14089103],"study_design_scores_gemma":[0.00007734822,0.0000858056,0.000018946337,0.00018421066,0.0000055881223,0.000010445906,2.5323595e-7,0.60342795,0.00041409052,0.39470232,0.0007931293,0.0002798905],"about_ca_topic_score_codex":0.0000043623327,"about_ca_topic_score_gemma":0.00000798132,"teacher_disagreement_score":0.57455724,"about_ca_system_score_codex":0.00009757754,"about_ca_system_score_gemma":0.0002571963,"threshold_uncertainty_score":0.99988884},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035919086,0.0010126121,0.9819313,0.0004414398,0.0004261774,0.00038863375,0.0000376194,0.000069841444,0.0121004665],"genre_scores_gemma":[0.94036585,0.00012230358,0.0566321,0.0011522551,0.00030337358,0.0000028908814,0.000015660942,0.000027045742,0.0013784915],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981056,0.000036483343,0.00035026544,0.00080441573,0.00039826726,0.00030500698],"domain_scores_gemma":[0.9984894,0.000028210217,0.00029176843,0.0009120172,0.0002191783,0.000059440223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028984374,0.0003445647,0.00040215152,0.00015866202,0.00012869679,0.000040683753,0.00090593664,0.00031963407,0.00000163545],"category_scores_gemma":[0.00004644704,0.00022851798,0.00020723065,0.00021867747,0.0008055128,0.0000057390916,0.00040383596,0.00021568158,3.5221802e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039580293,0.000042344658,0.00028304802,0.000031588224,0.000052367526,0.0000074876803,0.00004348144,0.00266155,0.45754355,0.0005575251,0.000083976964,0.5386535],"study_design_scores_gemma":[0.0001478155,0.0002328682,0.00010947636,0.00027014173,0.00003521715,0.000045465964,9.721673e-8,0.001925527,0.9641416,0.017199194,0.015379879,0.00051270844],"about_ca_topic_score_codex":0.000019772866,"about_ca_topic_score_gemma":0.00015284716,"teacher_disagreement_score":0.93677396,"about_ca_system_score_codex":0.000041560208,"about_ca_system_score_gemma":0.00019841302,"threshold_uncertainty_score":0.93186927},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011545242,0.0004051457,0.992319,0.001490403,0.0015400294,0.00051043957,0.0000051075363,0.00018195051,0.003536391],"genre_scores_gemma":[0.03506151,0.000109575645,0.95374507,0.008316097,0.00067554926,0.000044383767,0.000010621413,0.00004977955,0.0019874412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971849,0.000016208729,0.00032087948,0.0012585247,0.0007290017,0.0004904947],"domain_scores_gemma":[0.998103,0.00032907748,0.00018227566,0.0010331897,0.00024387313,0.0001085879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004296164,0.00038082484,0.00032288823,0.00054543576,0.0002713134,0.0005288982,0.0024582807,0.00024699658,0.000019916579],"category_scores_gemma":[0.00003295424,0.00037223662,0.00014005658,0.0005369717,0.0001235116,0.00036940785,0.00075173425,0.0004204998,0.000049805283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000597514,0.000029043844,0.000009766985,0.00015364314,0.000022861552,0.000052360567,0.00086041656,0.010423601,0.000012512783,0.4480907,0.00006706775,0.54027206],"study_design_scores_gemma":[0.0001752687,0.000067298504,0.00001825183,0.000572263,0.000012000748,0.000020810397,2.2159126e-7,0.6497643,0.00002508628,0.34675413,0.0021769207,0.00041343117],"about_ca_topic_score_codex":0.000011151022,"about_ca_topic_score_gemma":0.000015364554,"teacher_disagreement_score":0.6393407,"about_ca_system_score_codex":0.00022150225,"about_ca_system_score_gemma":0.00007958798,"threshold_uncertainty_score":0.999873},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010981713,0.00019415017,0.9928715,0.0034848803,0.000664954,0.00047298055,0.000029025012,0.0003124251,0.0018602305],"genre_scores_gemma":[0.17773081,0.00009418711,0.80695117,0.01345085,0.0011259471,0.000015533657,0.00018230377,0.000070597416,0.0003785967],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99558985,0.00010559707,0.0004912693,0.0019799212,0.001349438,0.00048391375],"domain_scores_gemma":[0.9943651,0.0008932176,0.00032891147,0.0041339793,0.0001520683,0.00012670137],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00092285324,0.0005321095,0.00041715908,0.00028369416,0.00033420647,0.0011497529,0.0077225,0.00031163433,0.000019374782],"category_scores_gemma":[0.00008778279,0.00039718117,0.00010206074,0.00047872806,0.0006192939,0.0009568276,0.0025121998,0.0012221009,0.00021385106],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011675747,0.000055257893,0.0000160377,0.000006142842,0.000016476979,0.000021279819,0.0016302688,0.041238423,0.00017090782,0.112867005,0.00014691343,0.8438196],"study_design_scores_gemma":[0.0003293673,0.00033089906,0.0004756923,0.00048394536,0.000014795727,0.000018982808,2.926923e-7,0.48290518,0.002834546,0.49195606,0.019767985,0.000882238],"about_ca_topic_score_codex":0.00007374528,"about_ca_topic_score_gemma":0.00009942324,"teacher_disagreement_score":0.84293735,"about_ca_system_score_codex":0.00026939117,"about_ca_system_score_gemma":0.0006593669,"threshold_uncertainty_score":0.99988717},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071308826,0.0020949559,0.9944603,0.000097232085,0.000973958,0.00024292788,0.0000013846308,0.00018959967,0.0012265779],"genre_scores_gemma":[0.5441044,0.00001584444,0.45540795,0.00019424649,0.000076174525,0.000004110625,9.802834e-7,0.000020085929,0.00017621313],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973097,0.00003223438,0.00053309446,0.0010317203,0.00061784574,0.00047543927],"domain_scores_gemma":[0.99811774,0.0002875,0.00039172889,0.000951093,0.00017136363,0.000080583384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005754313,0.0004122687,0.0005633229,0.0010890187,0.00007296546,0.00016872106,0.0032425623,0.00030279256,0.000013919001],"category_scores_gemma":[0.00015004922,0.00033754628,0.00009008754,0.0005886994,0.00043556048,0.0005706236,0.0013762809,0.0008810235,0.000005145537],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000567783,0.000034609602,0.00035899418,0.00007337505,0.0000046293767,0.00006316549,0.001550318,0.0004567156,0.00035984322,0.01834221,0.0000039881056,0.9787465],"study_design_scores_gemma":[0.00023599036,0.00025709887,0.0003969258,0.0021947736,0.000008182415,0.0001221748,2.6716717e-7,0.06470095,0.06423044,0.8668599,0.00006450259,0.00092879415],"about_ca_topic_score_codex":0.000085731765,"about_ca_topic_score_gemma":0.00023207844,"teacher_disagreement_score":0.97781765,"about_ca_system_score_codex":0.00020901655,"about_ca_system_score_gemma":0.00024032558,"threshold_uncertainty_score":0.9999077},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011775433,0.00011048543,0.99590117,0.0002457197,0.0012398366,0.00032413474,0.000005302014,0.00018979018,0.0008060368],"genre_scores_gemma":[0.6687554,0.0000034832237,0.3304121,0.00042869803,0.00020715361,0.000002689208,0.00000380025,0.000025070276,0.00016160333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664706,0.00003830741,0.00059503777,0.0014212257,0.0007788724,0.0005195058],"domain_scores_gemma":[0.9976601,0.00047082437,0.0003145313,0.0011452463,0.00030681738,0.00010250658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006547913,0.00048688057,0.0004267909,0.00074305607,0.0002635594,0.00070313975,0.0020083701,0.00035224872,0.000011109898],"category_scores_gemma":[0.000064838394,0.0004744781,0.0001376025,0.0004316351,0.0003478422,0.0014770147,0.0007299973,0.0007309116,0.000040569823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053309627,0.000022780345,0.000021631617,0.0000187322,0.0000047873177,0.000010234105,0.00027700202,0.94261473,0.00035194485,0.0012996134,0.000014419753,0.05535879],"study_design_scores_gemma":[0.000111103,0.000059248883,0.000011102749,0.00021103754,0.0000074776854,0.000021601403,5.880579e-8,0.904033,0.0010283905,0.0937743,0.0002911247,0.00045152416],"about_ca_topic_score_codex":0.000055056902,"about_ca_topic_score_gemma":0.000053721367,"teacher_disagreement_score":0.66757786,"about_ca_system_score_codex":0.00059249485,"about_ca_system_score_gemma":0.00037029272,"threshold_uncertainty_score":0.9997707},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030487118,0.00017652391,0.9923792,0.00015177325,0.0013831115,0.00022660843,0.000010566465,0.00007272729,0.005294603],"genre_scores_gemma":[0.081165925,0.000025754733,0.9180214,0.00055846554,0.00013627662,0.0000048367074,0.0000066876223,0.000021148151,0.000059510414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685097,0.000043372005,0.00062690687,0.0010111461,0.0010330533,0.00043458393],"domain_scores_gemma":[0.99753237,0.00030565265,0.00051325746,0.0012431093,0.00028941178,0.00011620425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012885942,0.00037054878,0.00043799562,0.0006230397,0.0001469174,0.00019418498,0.0025667066,0.00026354354,0.000039878378],"category_scores_gemma":[0.000107204585,0.00036632523,0.00012505209,0.0003656074,0.00040934133,0.0006238501,0.000524948,0.00065509544,0.00001843344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000087282,0.00007110557,0.0004160311,0.0001494743,0.000020067115,0.00005045859,0.00060847827,0.022362491,0.001455604,0.43477947,0.000018513441,0.54005957],"study_design_scores_gemma":[0.00080906047,0.0004683236,0.012727804,0.00306194,0.000023905513,0.00037819266,4.8543586e-7,0.57826203,0.052722458,0.34669578,0.002594871,0.0022551448],"about_ca_topic_score_codex":0.000016985765,"about_ca_topic_score_gemma":0.0000073037627,"teacher_disagreement_score":0.55589956,"about_ca_system_score_codex":0.00022436559,"about_ca_system_score_gemma":0.00029024712,"threshold_uncertainty_score":0.9998789},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000101801925,0.0011031806,0.99664086,0.00007796654,0.0011581251,0.00060826,0.000020157737,0.00025690932,0.00012436348],"genre_scores_gemma":[0.12685332,0.00006699856,0.87266237,0.00010977791,0.00007538582,0.0000439882,0.000004960868,0.00003099564,0.00015221651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973263,0.000020090174,0.0005558132,0.0010064042,0.0006615915,0.0004298162],"domain_scores_gemma":[0.99625427,0.00081204064,0.00037108478,0.0021506988,0.00033484917,0.000077052406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011078685,0.0003957794,0.00071553246,0.00157002,0.0001253754,0.0001842154,0.004684403,0.00026825612,0.0000036639133],"category_scores_gemma":[0.000027139049,0.00029273416,0.00031949766,0.0013628312,0.0004222629,0.00023876052,0.0008888183,0.00041119225,0.0000021361798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027099723,0.0000138443065,0.000023033008,0.00007295546,0.00021244066,0.0000054954553,0.00038280647,0.1269596,0.000030071655,0.32387805,0.000010903786,0.5484081],"study_design_scores_gemma":[0.000055818487,0.000072987146,0.0001310725,0.00016468414,0.00013529888,0.000007666861,2.5424074e-8,0.96663594,0.00014645573,0.030825166,0.001505913,0.00031896398],"about_ca_topic_score_codex":0.00006310724,"about_ca_topic_score_gemma":0.00003617283,"teacher_disagreement_score":0.8396763,"about_ca_system_score_codex":0.00020892525,"about_ca_system_score_gemma":0.00019823965,"threshold_uncertainty_score":0.9999525},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065219654,0.00007362833,0.9850387,0.0016062089,0.0002414538,0.0004579568,0.0000042261413,0.000047739544,0.0060080956],"genre_scores_gemma":[0.9975941,0.000016888353,0.0015843253,0.00032403864,0.00018282126,0.000013463619,0.000035950998,0.000009539829,0.00023884812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831146,0.00010749592,0.00032422267,0.00052577263,0.00052384485,0.00020720047],"domain_scores_gemma":[0.9983125,0.00046758458,0.0002912093,0.00031995788,0.00053696375,0.000071807866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011476014,0.00019581972,0.00027919776,0.00052671006,0.000731951,0.0002124809,0.0003296642,0.0002067898,0.00025386753],"category_scores_gemma":[0.00023634377,0.00019482628,0.000039893246,0.00050987734,0.0018955927,0.00031748024,0.000047985883,0.00026811668,0.0000074559543],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016754004,0.00011802182,0.0013585753,0.00027704847,0.000017630156,6.67783e-7,0.017178373,0.050570387,0.00016556628,0.035604797,0.000026470168,0.8946657],"study_design_scores_gemma":[0.00086012715,0.001024665,0.010140898,0.0018565627,0.00014336724,0.0000010935913,0.00023410047,0.768899,0.0045034057,0.20766994,0.0028231465,0.0018436552],"about_ca_topic_score_codex":0.0041649756,"about_ca_topic_score_gemma":0.010597726,"teacher_disagreement_score":0.9910722,"about_ca_system_score_codex":0.00034628008,"about_ca_system_score_gemma":0.0007617734,"threshold_uncertainty_score":0.7944785},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004992095,0.0003482076,0.99507743,0.00051350705,0.0008566462,0.00078641745,0.000013452366,0.0005944267,0.0017599919],"genre_scores_gemma":[0.05313357,0.00004617764,0.94530666,0.00089971453,0.00030204587,0.00006005098,0.0000074344866,0.00004403535,0.00020029276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619085,0.000010809103,0.0005074487,0.0018413428,0.0006188056,0.00083075924],"domain_scores_gemma":[0.9975085,0.00028766322,0.00029870038,0.0014835123,0.0002633918,0.00015819274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007482258,0.00058779074,0.0005600169,0.0009266757,0.00038998653,0.0006409779,0.004564217,0.0003553011,0.000006637594],"category_scores_gemma":[0.000070877526,0.0005445791,0.00025051806,0.0005370942,0.00067718147,0.0009197246,0.0016748537,0.0006589467,0.0000067681176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040465995,0.000072088194,0.00017336784,0.00029329452,0.00004261153,0.00017991019,0.0010727771,0.014306687,0.001956794,0.5013092,0.00006324042,0.48048958],"study_design_scores_gemma":[0.00034594268,0.00026367817,0.000031125564,0.00068610336,0.000006546067,0.00004362657,5.8405604e-8,0.099275656,0.0133236,0.88356483,0.001692799,0.0007660254],"about_ca_topic_score_codex":0.000009951702,"about_ca_topic_score_gemma":0.00001057871,"teacher_disagreement_score":0.47972354,"about_ca_system_score_codex":0.0003091218,"about_ca_system_score_gemma":0.0003625146,"threshold_uncertainty_score":0.99970055},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001729769,0.0018003632,0.9925386,0.0007906531,0.00093030266,0.0005891237,0.0000070026085,0.00060475717,0.0027219355],"genre_scores_gemma":[0.022847632,0.0000098505625,0.9747964,0.0011780612,0.00043348933,0.00002016163,0.000007699407,0.00004413031,0.0006625452],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964748,0.000018337774,0.000555727,0.0013913151,0.00084042666,0.0007194151],"domain_scores_gemma":[0.9969011,0.001021263,0.00036252238,0.001216501,0.0003586788,0.00013995974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001393831,0.0004861629,0.00044069954,0.00085530226,0.00043436085,0.00060357864,0.0035146726,0.0004298076,0.000010990935],"category_scores_gemma":[0.00041567575,0.0004287429,0.00016789624,0.00062939187,0.00046020022,0.00075914187,0.0010405763,0.0008727081,0.000019155656],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036353238,0.000014250416,0.00002327394,0.000032474836,0.0000063672906,0.000027323236,0.000517874,0.00096065336,0.00020580569,0.11230358,0.000027059772,0.8858777],"study_design_scores_gemma":[0.00016147528,0.0001165245,0.00001378592,0.00043162712,0.000009540865,0.000060526312,1.5081847e-7,0.27823928,0.0041835564,0.7145911,0.0015545923,0.00063782977],"about_ca_topic_score_codex":0.000021582973,"about_ca_topic_score_gemma":0.00007249138,"teacher_disagreement_score":0.8852399,"about_ca_system_score_codex":0.00039369334,"about_ca_system_score_gemma":0.00045062532,"threshold_uncertainty_score":0.9998164},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026753385,0.00037753282,0.9956863,0.00059796945,0.001993367,0.000705938,0.000037928512,0.00019112034,0.00014229256],"genre_scores_gemma":[0.16787733,0.000022117618,0.82997656,0.0003641956,0.001073537,0.00002675757,0.00003508263,0.00008652959,0.00053789746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956946,0.00003307933,0.0010872715,0.0016842985,0.00079232914,0.00070844416],"domain_scores_gemma":[0.99641836,0.0005563958,0.000873129,0.0015333503,0.0004918564,0.00012691923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013026687,0.0005792603,0.0007059537,0.00091273617,0.0003009499,0.00042631596,0.0034189299,0.00033496832,0.0000024103435],"category_scores_gemma":[0.000108233726,0.00052974856,0.00027969148,0.0005962362,0.0006523044,0.00035252326,0.0008587568,0.0005821298,0.000004998249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008341833,0.00006225059,0.0000071756585,0.00013559987,0.00001782989,0.000011578802,0.00035180026,0.10066947,0.0026954075,0.016969875,0.00007063725,0.879],"study_design_scores_gemma":[0.00027286817,0.00018618692,0.00007842276,0.0002093742,0.000010616744,0.00002417818,1.0626213e-7,0.8502632,0.006817883,0.14095578,0.00068122434,0.0005002196],"about_ca_topic_score_codex":0.000047206828,"about_ca_topic_score_gemma":0.00002298611,"teacher_disagreement_score":0.8784998,"about_ca_system_score_codex":0.00014717586,"about_ca_system_score_gemma":0.0004604564,"threshold_uncertainty_score":0.9997154},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15308659,0.00017923223,0.84036845,0.0014554388,0.002842752,0.001367274,0.000011404145,0.00021377193,0.00047507125],"genre_scores_gemma":[0.8819164,0.000010268587,0.117637895,0.00016166366,0.00014690198,0.00005277481,0.0000030925937,0.0000256273,0.000045365043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99543536,0.0000764509,0.00079352205,0.0018266592,0.0010145874,0.00085340295],"domain_scores_gemma":[0.99237543,0.00076268375,0.0003197158,0.006231623,0.00018322626,0.00012729387],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0004023474,0.0006233404,0.00072844676,0.0013165615,0.00014182056,0.00060660194,0.019082924,0.00020097378,0.000038412807],"category_scores_gemma":[0.0019906145,0.0005444827,0.000042383403,0.0010375769,0.00040738928,0.00077188027,0.03333289,0.0016228624,0.0000085812035],"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.00012121169,0.000848062,0.037856203,0.00036640378,0.00010876753,0.099775985,0.011320842,0.012022888,0.000036078673,0.0024475052,0.0013032439,0.8337928],"study_design_scores_gemma":[0.001688772,0.0007147215,0.0021804704,0.0013702991,0.000016975631,0.002477189,0.00003253521,0.89534837,0.00026114396,0.09384629,0.0004192474,0.0016439748],"about_ca_topic_score_codex":0.50205535,"about_ca_topic_score_gemma":0.894313,"teacher_disagreement_score":0.8833255,"about_ca_system_score_codex":0.0019817664,"about_ca_system_score_gemma":0.0022766003,"threshold_uncertainty_score":0.99970067},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013919784,0.00006243449,0.9783895,0.0014857877,0.002568769,0.0006236341,0.000022839495,0.00029666896,0.0026305814],"genre_scores_gemma":[0.58559424,0.000094983654,0.39367384,0.017285788,0.0009843056,0.000084424835,0.00012186245,0.00010928462,0.0020512508],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99519557,0.000037192614,0.0009095136,0.0009606253,0.0019773883,0.00091970095],"domain_scores_gemma":[0.995716,0.00026164216,0.0012545703,0.0017673651,0.0007106526,0.00028981743],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011605793,0.00059804565,0.0005425105,0.001718178,0.00082624756,0.0013961451,0.003575211,0.0005623112,0.00005832526],"category_scores_gemma":[0.00021086741,0.0005205574,0.00027646698,0.0010735577,0.00076945464,0.0036601345,0.0024698833,0.0016482763,0.00026618104],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054101973,0.000111725625,0.03621734,0.00042072524,0.000059238264,0.0002675377,0.006698625,0.0032859384,0.0015623721,0.033273697,0.00056830765,0.9174804],"study_design_scores_gemma":[0.0028595256,0.0005599245,0.14278115,0.0027557698,0.00008192798,0.00088174635,0.000009376901,0.3112295,0.023807762,0.44332427,0.06461832,0.0070907245],"about_ca_topic_score_codex":0.000024759065,"about_ca_topic_score_gemma":0.00014175309,"teacher_disagreement_score":0.91038966,"about_ca_system_score_codex":0.00022889137,"about_ca_system_score_gemma":0.00021068065,"threshold_uncertainty_score":0.9997246},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084166555,0.00031315492,0.99147516,0.00026095528,0.0009966329,0.00040840133,0.0000016387391,0.00006806954,0.0056342985],"genre_scores_gemma":[0.50354534,0.000015163995,0.49528953,0.000777085,0.00019605157,0.000011145575,0.0000015754921,0.000031500273,0.00013258457],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963456,0.00004534847,0.00070983364,0.0010198927,0.0013017523,0.00057760446],"domain_scores_gemma":[0.9966511,0.0012495364,0.00036986725,0.0013879518,0.00022112182,0.000120397526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017568897,0.00046246115,0.0004673483,0.0010109803,0.00033114047,0.00022881012,0.0036556488,0.00024054167,0.000018415027],"category_scores_gemma":[0.000063154956,0.0002929289,0.00017662557,0.0009885594,0.00071989483,0.00016242437,0.0008612921,0.0007140142,0.00004591549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009036977,0.00006447687,0.000045445136,0.00009275549,0.00003514913,0.000043320728,0.00398638,0.005117063,0.00013782168,0.3622556,0.000012339727,0.6282006],"study_design_scores_gemma":[0.0009917974,0.00092367997,0.0017688858,0.005571176,0.00003882459,0.00017575518,0.000005569176,0.29586688,0.03486583,0.65195864,0.0048723863,0.0029605879],"about_ca_topic_score_codex":0.0000051499433,"about_ca_topic_score_gemma":0.00007894167,"teacher_disagreement_score":0.62524,"about_ca_system_score_codex":0.00014712721,"about_ca_system_score_gemma":0.000556153,"threshold_uncertainty_score":0.99995226},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016057833,0.0008478208,0.9870034,0.00016003534,0.0012353742,0.0003618056,0.00000707415,0.00047404188,0.009749879],"genre_scores_gemma":[0.70843434,0.00003272339,0.28963733,0.00059721543,0.0006097016,0.000018903238,0.000008417907,0.00006014917,0.0006012114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958488,0.000046647347,0.00045602207,0.0016999376,0.0011289625,0.0008196541],"domain_scores_gemma":[0.99715745,0.00086545624,0.00035472904,0.0010202779,0.00037595443,0.00022610064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069138897,0.00063404534,0.000625502,0.0007570412,0.00060569175,0.00052707247,0.0024074612,0.00030667547,0.000005094145],"category_scores_gemma":[0.00005124897,0.0005308255,0.000098678865,0.00067955774,0.00072110025,0.000621849,0.000744176,0.0010351075,0.00006300912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055196437,0.00005539132,0.0016541505,0.00046546562,0.000101432306,0.004267997,0.009222078,0.14161424,0.00004770182,0.026552001,0.000106353415,0.815858],"study_design_scores_gemma":[0.00128554,0.00086288754,0.00034905548,0.011929522,0.000043258373,0.0029539,0.0000030496872,0.97059697,0.0014708085,0.0052667786,0.002321617,0.0029166148],"about_ca_topic_score_codex":0.00006555659,"about_ca_topic_score_gemma":0.000046686822,"teacher_disagreement_score":0.8289827,"about_ca_system_score_codex":0.00037171872,"about_ca_system_score_gemma":0.0010611961,"threshold_uncertainty_score":0.9997143},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010052248,0.00072573987,0.99065536,0.0006673649,0.0010829853,0.0003510999,0.00000818776,0.000283146,0.0062160627],"genre_scores_gemma":[0.016159615,0.00011956512,0.97941774,0.0028384684,0.0007836272,0.00000437168,0.000052430212,0.00003763854,0.00058656547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958187,0.000040569077,0.00059588964,0.0017343089,0.001187123,0.00062340824],"domain_scores_gemma":[0.9973586,0.00028727145,0.00035750063,0.0014871088,0.0002977089,0.00021181953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073486724,0.0005527159,0.00057213684,0.00086831534,0.00031592618,0.0008044738,0.0033478998,0.00032998694,0.000021582855],"category_scores_gemma":[0.00005829536,0.0004921009,0.00013226445,0.00074277754,0.00032412185,0.0010453882,0.001409796,0.00079577375,0.00010613015],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002808134,0.000020152731,0.000005356428,0.000015463429,0.0000039189113,0.000078467565,0.00012880452,0.01137211,0.000047275375,0.011053433,0.00016216486,0.97711],"study_design_scores_gemma":[0.00024866348,0.00017406346,0.0001937581,0.0005297078,0.000005951622,0.00007603388,3.2236446e-8,0.76850593,0.00023456193,0.2225571,0.0068339566,0.0006402683],"about_ca_topic_score_codex":0.000012962587,"about_ca_topic_score_gemma":0.00000721977,"teacher_disagreement_score":0.97646976,"about_ca_system_score_codex":0.0002564809,"about_ca_system_score_gemma":0.0003619376,"threshold_uncertainty_score":0.99975306},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016171021,0.0068925386,0.9704803,0.0007959898,0.0025993763,0.00035754836,0.0000025750287,0.00027172294,0.018438205],"genre_scores_gemma":[0.786612,0.0004069973,0.20748958,0.0030241734,0.0010580376,0.000018667815,0.000007767354,0.00006331916,0.0013194814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955721,0.00007600252,0.00058493385,0.0018292388,0.0007813415,0.0011563988],"domain_scores_gemma":[0.9968837,0.00071530574,0.00038838087,0.0014027068,0.00023776117,0.0003721576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013714297,0.00077025266,0.00082198106,0.00066710205,0.0004663546,0.000662643,0.00319332,0.0005319356,0.00003928073],"category_scores_gemma":[0.00014029517,0.00062092626,0.00015536151,0.000545146,0.0012086022,0.00080138934,0.0025466324,0.0010851909,0.00013885193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005336357,0.000054603537,0.00056647527,0.00009254128,0.00001738866,0.00012376295,0.0018189774,0.0008262832,0.00017275322,0.53408104,0.000037948885,0.46220288],"study_design_scores_gemma":[0.00060432043,0.00032822785,0.0007365955,0.0005582629,0.000026227232,0.0006402898,7.7684956e-7,0.095334776,0.0004307063,0.89642686,0.003317461,0.0015955319],"about_ca_topic_score_codex":0.0000200865,"about_ca_topic_score_gemma":0.00004278688,"teacher_disagreement_score":0.78645027,"about_ca_system_score_codex":0.00025666022,"about_ca_system_score_gemma":0.00032024446,"threshold_uncertainty_score":0.9996242},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018792065,0.000052985182,0.97508067,0.00009759735,0.00049777,0.00031033222,0.000020284917,0.00003992214,0.0051083555],"genre_scores_gemma":[0.9720302,0.0000020381942,0.025038408,0.0020444465,0.00013684116,0.000004693053,0.000025311403,0.000013933237,0.00070411427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980709,0.00022425468,0.00049607386,0.0004592994,0.00048737213,0.00026207912],"domain_scores_gemma":[0.9975752,0.0011711877,0.00041199627,0.00044295483,0.00033273717,0.00006588177],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019022523,0.00026128042,0.0005136795,0.0020491446,0.00012035621,0.00008649225,0.00037563778,0.0002907566,0.0010193981],"category_scores_gemma":[0.00024651515,0.00024107624,0.00019350018,0.0009869229,0.0005068423,0.00026671778,0.00008814051,0.00037599137,0.00003100546],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001131159,0.00009203751,0.00030916824,0.000017000117,0.00027978173,0.000026972317,0.017385026,0.06807753,0.001011381,0.012232561,0.00005362036,0.8993838],"study_design_scores_gemma":[0.0036749954,0.0026681677,0.23044011,0.00085762,0.001575933,0.00025907316,0.000058474765,0.5923745,0.00072283385,0.16233204,0.0022606216,0.002775651],"about_ca_topic_score_codex":0.000033974276,"about_ca_topic_score_gemma":0.000028699218,"teacher_disagreement_score":0.9532381,"about_ca_system_score_codex":0.0002204679,"about_ca_system_score_gemma":0.00023500828,"threshold_uncertainty_score":0.9998938},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008102777,0.0017583843,0.97981715,0.00061120157,0.0052405605,0.001982044,0.000055484696,0.0002635333,0.009461334],"genre_scores_gemma":[0.4430591,0.00031240538,0.48603725,0.027569104,0.02320424,0.00017761225,0.00048299338,0.0009683802,0.018188912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9912447,0.0003352046,0.001806651,0.0024219104,0.0019179186,0.0022736213],"domain_scores_gemma":[0.98961365,0.0045428085,0.0011336236,0.0037029453,0.0005937816,0.00041316432],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.016488317,0.00068070635,0.0010517673,0.0008231649,0.0012087538,0.000076727854,0.0038716749,0.001006128,0.00014239791],"category_scores_gemma":[0.0017661005,0.00063889223,0.0000865714,0.00060949835,0.0005816179,0.00032970865,0.0027879623,0.004333697,0.00024998636],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075842785,0.00006254326,0.0076449057,0.0014578211,0.000045275294,0.000042189153,0.0036460212,0.008517827,0.0006110067,0.0021763956,0.00068044686,0.9750397],"study_design_scores_gemma":[0.0017224449,0.00043967486,0.0022296484,0.0059603606,0.000026553227,0.00007681528,0.000005926322,0.87305,0.000030861007,0.0061453744,0.10849773,0.0018146571],"about_ca_topic_score_codex":0.0007494736,"about_ca_topic_score_gemma":0.0045233676,"teacher_disagreement_score":0.97322506,"about_ca_system_score_codex":0.0019343059,"about_ca_system_score_gemma":0.006475551,"threshold_uncertainty_score":0.99960625},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017687163,0.0001494514,0.99154234,0.0015021584,0.0015664787,0.00036086235,0.000008483978,0.00005689764,0.003044633],"genre_scores_gemma":[0.8263395,0.000038984264,0.16997845,0.0026291606,0.0003458613,0.000018756147,0.000023845962,0.000025434192,0.0006000311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973326,0.00005497689,0.0004269361,0.00084159925,0.0010025979,0.0003413416],"domain_scores_gemma":[0.9970326,0.001335702,0.00029082195,0.0010010146,0.0002460256,0.00009383405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000801137,0.00033609662,0.00034831002,0.00063906127,0.00021724842,0.0002449847,0.0023804633,0.00018780779,0.0000656241],"category_scores_gemma":[0.000120567965,0.00023786245,0.00011685295,0.0006351212,0.0004382893,0.00027350683,0.00053850864,0.0005447582,0.00007409478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068787053,0.00003697641,0.000015227299,0.000022204365,0.00001592146,0.000014721284,0.00025698807,0.07518229,0.00014046453,0.6503633,0.0005898597,0.27335513],"study_design_scores_gemma":[0.00015657976,0.0002379798,0.00043399926,0.0001657791,0.000005293485,0.000030815398,9.349196e-8,0.25392702,0.003335879,0.74039274,0.00095988525,0.00035392272],"about_ca_topic_score_codex":0.00002422054,"about_ca_topic_score_gemma":0.000030024226,"teacher_disagreement_score":0.8245708,"about_ca_system_score_codex":0.000081436316,"about_ca_system_score_gemma":0.0003019312,"threshold_uncertainty_score":0.96997494},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049210724,0.0011630447,0.9968443,0.00037822998,0.0005925677,0.0001597585,0.000066015986,0.00010426274,0.00019972933],"genre_scores_gemma":[0.27936906,0.000057765345,0.7199259,0.00025516062,0.00016227634,0.0000028323784,0.00015516122,0.000018367095,0.00005349643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996762,0.000044132426,0.00068823685,0.0010272139,0.0010214626,0.00045695173],"domain_scores_gemma":[0.99654573,0.00036721068,0.0003504147,0.0024095078,0.00018324004,0.0001438664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014636953,0.00038520942,0.0005664713,0.0008705385,0.00019411033,0.00024467,0.005190746,0.00021172741,0.000046749446],"category_scores_gemma":[0.00009717942,0.0003268776,0.00009670055,0.0006442887,0.0005132468,0.0020304963,0.0018498194,0.00040481417,0.000040725165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013564704,0.00005578151,0.000048753947,0.00011184159,0.000028796363,0.000006638022,0.0013354041,0.011097926,0.0005828503,0.0031402747,0.000039882605,0.9835505],"study_design_scores_gemma":[0.00019113252,0.000040693143,0.00005832079,0.00040162247,0.000029114917,0.000022576694,3.7248668e-7,0.9918262,0.0009791077,0.0050975583,0.000994074,0.00035925975],"about_ca_topic_score_codex":0.00008798782,"about_ca_topic_score_gemma":0.00018369495,"teacher_disagreement_score":0.98319125,"about_ca_system_score_codex":0.00009569943,"about_ca_system_score_gemma":0.0005521409,"threshold_uncertainty_score":0.99991834},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038537814,0.0001261656,0.98716044,0.0011105926,0.003641487,0.0002743994,0.000006579433,0.00021678227,0.0070782006],"genre_scores_gemma":[0.4423233,0.000031007618,0.5521997,0.0016948013,0.0013886967,0.000012731716,0.000054211527,0.00006088839,0.0022346394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967385,0.000052573156,0.00046025123,0.0013417151,0.0009272313,0.00047971905],"domain_scores_gemma":[0.9972471,0.0006437019,0.00028541582,0.0013951816,0.00025057743,0.00017800959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088041235,0.00041714724,0.00034938313,0.0010327372,0.0005846906,0.0004508878,0.0020580336,0.00036361304,0.000095282834],"category_scores_gemma":[0.00009931253,0.0003887469,0.00015609013,0.00084333756,0.0008411598,0.0010186633,0.00058546255,0.0013794723,0.00012906412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021590666,0.00015010845,0.0006816902,0.00003697284,0.00004564994,0.00021680028,0.0018609659,0.14965945,0.003930511,0.55170745,0.0001544985,0.2915343],"study_design_scores_gemma":[0.00024653893,0.00010935935,0.004400619,0.00011367485,0.000009235258,0.00012293585,1.808714e-7,0.2679859,0.001366891,0.7240794,0.0010088636,0.0005564493],"about_ca_topic_score_codex":0.000010679984,"about_ca_topic_score_gemma":0.000017957407,"teacher_disagreement_score":0.44193792,"about_ca_system_score_codex":0.00012530119,"about_ca_system_score_gemma":0.0003832912,"threshold_uncertainty_score":0.9998565},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018206538,0.000583497,0.9927627,0.00044809515,0.0001321194,0.0006792861,0.000011754369,0.00005221585,0.0053285146],"genre_scores_gemma":[0.008597149,0.000282047,0.98740834,0.00074715697,0.0005718683,0.00010130383,0.0000055880523,0.000057934434,0.0022286149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836034,0.00000895334,0.00031731252,0.0005360985,0.000451598,0.00032569407],"domain_scores_gemma":[0.99709797,0.0020330409,0.00015963305,0.00042501633,0.00018721067,0.000097155986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004072276,0.00025492298,0.00028372748,0.00011513605,0.00044440225,0.00021621861,0.000589465,0.00016524844,0.0000100612215],"category_scores_gemma":[0.00018980922,0.00017133444,0.000032912227,0.00023670915,0.00039266524,0.000041994324,0.00018430874,0.00040253586,0.0000066326716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042854754,0.00000954821,2.1875576e-7,0.000036926656,0.0000041366725,0.00000328072,0.00005827803,0.000027767426,0.000007021844,0.59654695,0.000040946696,0.40326062],"study_design_scores_gemma":[0.00010171155,0.00009968605,0.0000016764268,0.00013448273,0.000016242922,0.00002383035,1.2605179e-7,0.06849957,0.000037984075,0.9261371,0.0047508692,0.00019675535],"about_ca_topic_score_codex":0.0000020800505,"about_ca_topic_score_gemma":0.000055791123,"teacher_disagreement_score":0.40306386,"about_ca_system_score_codex":0.00009841264,"about_ca_system_score_gemma":0.00023332512,"threshold_uncertainty_score":0.69868153},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013494779,0.0010590956,0.9956901,0.000051581344,0.00083192886,0.0007010705,0.000037773145,0.0000850766,0.00019390673],"genre_scores_gemma":[0.48223534,0.000016255217,0.5172953,0.00021945957,0.00017773127,0.000008580534,0.000009922952,0.00002354816,0.000013837727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996329,0.00004634638,0.0008012642,0.0015449299,0.00055069925,0.0007277778],"domain_scores_gemma":[0.996796,0.0014542838,0.00038287017,0.0009193049,0.000274873,0.00017264749],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017854698,0.0004950582,0.00070435455,0.001026719,0.00024224349,0.00034025605,0.0013593702,0.00044009855,0.0000033895167],"category_scores_gemma":[0.00020667241,0.00047372316,0.0001438373,0.000496378,0.000582893,0.0004342395,0.00056664535,0.0007467454,4.949966e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062416046,0.0000887942,0.00051923597,0.00022526787,0.000014660983,0.0007414808,0.0016346172,0.5349113,0.000249923,0.0016642245,0.000012798643,0.45987532],"study_design_scores_gemma":[0.0009881074,0.00012798305,0.000053371557,0.00037563493,0.0000097676475,0.00034497288,0.000001093622,0.9945294,0.0013362184,0.0013025661,0.00043355286,0.0004973185],"about_ca_topic_score_codex":0.00020312388,"about_ca_topic_score_gemma":0.00036842856,"teacher_disagreement_score":0.48088586,"about_ca_system_score_codex":0.00012061256,"about_ca_system_score_gemma":0.00024088516,"threshold_uncertainty_score":0.9997715},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022556807,0.00006124121,0.96372426,0.00045448428,0.00042746507,0.00030954304,0.000006678938,0.00009118647,0.03266944],"genre_scores_gemma":[0.8800173,0.000006521359,0.114544414,0.0021189824,0.00045871912,0.0000064534647,0.0000031233565,0.000039874405,0.0028046316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950341,0.000040816147,0.00066724775,0.0014794586,0.0021814771,0.0005968996],"domain_scores_gemma":[0.99487215,0.002577487,0.00043149476,0.0014602522,0.00045686477,0.00020173503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004531265,0.00039149035,0.00047375596,0.00095196854,0.00040198083,0.0006905642,0.0028774315,0.00024709507,0.00020637826],"category_scores_gemma":[0.00040843396,0.00027492075,0.00010417184,0.0011732657,0.0013388343,0.00032832855,0.00053005747,0.0007591331,0.00034997193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022974024,0.00002939763,0.0007864234,0.0000047493504,0.00000979333,0.00007353698,0.0012439106,0.025730554,0.000056523364,0.046166588,0.000068182024,0.92580736],"study_design_scores_gemma":[0.0004010467,0.00025388724,0.0013018014,0.00031126128,0.00002263442,0.00020720536,0.000005192777,0.041756433,0.0009675587,0.93796045,0.01571265,0.0010998695],"about_ca_topic_score_codex":0.000013345175,"about_ca_topic_score_gemma":0.00024534675,"teacher_disagreement_score":0.9247075,"about_ca_system_score_codex":0.00014839855,"about_ca_system_score_gemma":0.0003571943,"threshold_uncertainty_score":0.9999703},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116343245,0.000133713,0.8824466,0.00003274562,0.00047412724,0.000435308,0.0000055164655,0.000012140237,0.00011659845],"genre_scores_gemma":[0.91883624,0.000002682477,0.08077788,0.00007630197,0.00019905709,0.000011994311,0.00005925271,0.00002156945,0.000014997671],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981254,0.00003801214,0.000337693,0.0006855396,0.0006237712,0.00018962072],"domain_scores_gemma":[0.99803394,0.00001632376,0.00030231476,0.00070995156,0.00087427103,0.00006322529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009710299,0.00018893924,0.00015632261,0.00025485666,0.00012509058,0.000094275056,0.00059767696,0.00027683747,0.000024860186],"category_scores_gemma":[0.000109855806,0.00019137189,0.000055783796,0.00015913961,0.0004814346,0.0000098242235,0.000053604446,0.00019450425,0.0000020856744],"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.000011122622,0.000065361855,0.00020523141,0.00007353504,0.000008953808,5.5062014e-7,0.00013878997,0.09777979,0.6916949,0.00012287252,6.9844367e-7,0.2098982],"study_design_scores_gemma":[0.00022714441,0.00011496255,0.00024694708,0.00008877715,0.000032312673,0.000007545156,4.861318e-7,0.31524915,0.6820014,0.0014620556,0.00029714179,0.0002720422],"about_ca_topic_score_codex":0.0000036516328,"about_ca_topic_score_gemma":0.000032772637,"teacher_disagreement_score":0.80249304,"about_ca_system_score_codex":0.000036247096,"about_ca_system_score_gemma":0.0007672025,"threshold_uncertainty_score":0.7803919},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34130153,0.00073667517,0.65304923,0.0003508771,0.0012233481,0.0023748637,0.000018259416,0.000089300556,0.0008559074],"genre_scores_gemma":[0.9632098,0.000015403704,0.034473695,0.0011944037,0.0009047493,0.000045122546,0.000008934731,0.000041179657,0.00010669732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974412,0.000053365435,0.00038259695,0.0011920824,0.00045751102,0.00047325945],"domain_scores_gemma":[0.9988635,0.00016139995,0.000108143526,0.0005505997,0.00012288554,0.00019345451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003900731,0.0004609514,0.0008067455,0.0006607718,0.00012556362,0.000049444174,0.00022459173,0.00026650308,0.000029628729],"category_scores_gemma":[0.000024808058,0.00041997884,0.0001269852,0.00025899554,0.00021646477,0.00012037487,0.00032033253,0.00061494106,0.00001660692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011389335,0.0005439786,0.001333894,0.0001684776,0.00020588207,0.0021313226,0.010926467,0.7874823,0.021588556,0.0010348681,0.00007795693,0.17336734],"study_design_scores_gemma":[0.0032889165,0.004485539,0.0021952852,0.0007721236,0.0001445578,0.00026375975,0.0000022965075,0.8913034,0.09187871,0.0039175036,0.000173655,0.0015742547],"about_ca_topic_score_codex":0.0000138114365,"about_ca_topic_score_gemma":0.0000071120326,"teacher_disagreement_score":0.6219083,"about_ca_system_score_codex":0.00022620898,"about_ca_system_score_gemma":0.00031347515,"threshold_uncertainty_score":0.9998252},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006507555,0.00010810246,0.99303687,0.0007632407,0.0007094984,0.00035146222,0.0000028656013,0.00031183884,0.0046510287],"genre_scores_gemma":[0.17052385,0.00010234324,0.8236011,0.0011744746,0.0012066325,0.00005053802,0.00009509787,0.00007866877,0.0031672688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683607,0.00005742835,0.00041440545,0.0015288378,0.00058954756,0.00057369523],"domain_scores_gemma":[0.9980836,0.0005952316,0.00024020184,0.00076971756,0.00016034293,0.00015092317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090810924,0.00038451434,0.00036690608,0.0006390386,0.00048372598,0.00056356826,0.0018087308,0.00034836205,0.0000507083],"category_scores_gemma":[0.0001734452,0.00036924888,0.0001200727,0.0005010386,0.00029674638,0.0005048576,0.000312777,0.0010897905,0.000072020935],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018178976,0.000015637223,0.000199577,0.000020373805,0.0000061369446,0.0000025101842,0.0002234607,0.019976046,0.00009236763,0.043893002,0.00006021309,0.9354925],"study_design_scores_gemma":[0.00023346645,0.00023639464,0.0004899762,0.00009433827,0.000007211197,0.000032423606,1.09287164e-7,0.8389398,0.00015225688,0.08056507,0.07879814,0.0004508003],"about_ca_topic_score_codex":0.000048120804,"about_ca_topic_score_gemma":0.000072068884,"teacher_disagreement_score":0.9350417,"about_ca_system_score_codex":0.000257075,"about_ca_system_score_gemma":0.00041243478,"threshold_uncertainty_score":0.99987596},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021618546,0.00013998577,0.9942768,0.000030329928,0.0005833033,0.0001634769,0.000029846911,0.00010536091,0.004454685],"genre_scores_gemma":[0.87114185,0.000024234569,0.12766294,0.00030600512,0.00034591559,0.0000013102504,0.0003316259,0.00005210812,0.00013403033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863124,0.000006082395,0.00031188145,0.00038229983,0.00046187677,0.00020664383],"domain_scores_gemma":[0.9990186,0.00006656912,0.00009880323,0.0006760926,0.00007981843,0.000060123493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036994982,0.00022036285,0.0002264621,0.00044226943,0.000057176647,0.000050223556,0.0007573335,0.00021072663,0.00009000897],"category_scores_gemma":[0.0000144133655,0.00020406413,0.00003687248,0.00015452383,0.00016713513,0.00020892713,0.00016115914,0.00037881956,0.000015625601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045416095,0.000017987948,0.000033294793,0.00020929224,0.0000058896053,0.000008482284,0.00021130247,0.5574719,0.0017702025,0.0005402979,0.00007328244,0.43965352],"study_design_scores_gemma":[0.00019010517,0.000020441246,0.00019891285,0.00047589492,0.000006186165,0.0000033542742,1.770483e-7,0.99365777,0.003100549,0.0012186883,0.00091063435,0.00021729145],"about_ca_topic_score_codex":0.000006418106,"about_ca_topic_score_gemma":0.000059915692,"teacher_disagreement_score":0.87092566,"about_ca_system_score_codex":0.00012412817,"about_ca_system_score_gemma":0.0000494746,"threshold_uncertainty_score":0.8321493},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007039127,0.0006684501,0.989992,0.0007605245,0.0032557326,0.00052883883,0.000007434164,0.000092497365,0.0046241083],"genre_scores_gemma":[0.14533408,0.00005806321,0.851519,0.00065503485,0.0008457894,0.000011166706,0.000001602497,0.0000495225,0.0015257467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518585,0.000078479316,0.0008831095,0.0015001805,0.001646692,0.00070570107],"domain_scores_gemma":[0.99564844,0.00042460606,0.00070566725,0.002731532,0.00032414205,0.00016558431],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001265362,0.0005609898,0.00068081776,0.0004481898,0.00024572658,0.00035269235,0.007484824,0.00032810695,0.000032734417],"category_scores_gemma":[0.00010250887,0.00040230015,0.000274201,0.00089788187,0.0011252841,0.00081848627,0.002559134,0.000847334,0.000059492653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020493915,0.000020679787,0.00017962289,0.00006627916,0.00002290456,0.000030891355,0.0010465387,0.039831035,0.00043459667,0.023484958,0.000025161753,0.9348553],"study_design_scores_gemma":[0.00025585716,0.00010205693,0.000539466,0.001012447,0.000012705157,0.00012379745,3.728975e-7,0.94297093,0.008331734,0.043584485,0.002245203,0.0008209688],"about_ca_topic_score_codex":0.0000639131,"about_ca_topic_score_gemma":0.000042787375,"teacher_disagreement_score":0.9340343,"about_ca_system_score_codex":0.00026681816,"about_ca_system_score_gemma":0.0007843324,"threshold_uncertainty_score":0.9998429},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010509413,0.0006640252,0.9885565,0.0008733841,0.0009424248,0.00034082518,0.000012110392,0.00016989844,0.008335722],"genre_scores_gemma":[0.59609157,0.00022674663,0.39937168,0.0025588528,0.00094660994,0.000024647818,0.000042635536,0.00007467696,0.00066256284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967669,0.00002929448,0.00046041698,0.0013857036,0.00073221745,0.00062541984],"domain_scores_gemma":[0.998001,0.00041238285,0.00023439016,0.000999447,0.0001776064,0.00017519582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005529026,0.0004995362,0.00044518217,0.0010475434,0.00035347894,0.00057024014,0.0015938671,0.0003494503,0.000009585678],"category_scores_gemma":[0.000036184774,0.00044003566,0.00014468814,0.00062680914,0.0007843862,0.0006848045,0.0009845678,0.00067657925,0.000017239587],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012631863,0.00007393285,0.000033385644,0.000115681905,0.000028167555,0.00028223472,0.0009362714,0.022347461,0.00018525381,0.08421392,0.00044279866,0.8913283],"study_design_scores_gemma":[0.00048553656,0.00027379772,0.00084598566,0.00047205715,0.00001578096,0.00021740656,3.1010617e-7,0.2831665,0.0010637747,0.7106393,0.0018645779,0.0009549717],"about_ca_topic_score_codex":0.000060206254,"about_ca_topic_score_gemma":0.00014287191,"teacher_disagreement_score":0.8903733,"about_ca_system_score_codex":0.00010851644,"about_ca_system_score_gemma":0.00020009982,"threshold_uncertainty_score":0.99980515},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010073771,0.00054408284,0.9863424,0.0011133032,0.0015440071,0.0011510543,0.00001718161,0.000292204,0.008895085],"genre_scores_gemma":[0.10826345,0.00037321492,0.8811434,0.0061926525,0.0008212911,0.00011151958,0.000013717467,0.00015410181,0.0029266598],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99296933,0.0000792277,0.00067455723,0.0027394535,0.0020445418,0.0014928678],"domain_scores_gemma":[0.9946123,0.0009097276,0.00026325765,0.0030084944,0.0005355754,0.00067068177],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010361287,0.0008187953,0.0008084145,0.0024634649,0.0005586406,0.00049775286,0.007799342,0.00039477873,0.00003356254],"category_scores_gemma":[0.00021832527,0.0007736694,0.00024816528,0.0022695942,0.0018972703,0.0008481074,0.0032888118,0.0014232065,0.00034792727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044414246,0.00006817067,0.000034663233,0.000030941384,0.00002534792,0.0009814424,0.0018822987,0.019823989,0.0004523748,0.09516388,0.00037977457,0.8811127],"study_design_scores_gemma":[0.0008901515,0.0011902043,0.00020329551,0.0008237929,0.000011159435,0.0006896956,6.0022126e-7,0.08537768,0.006494615,0.86464673,0.03682959,0.002842467],"about_ca_topic_score_codex":0.000012361424,"about_ca_topic_score_gemma":0.000049690723,"teacher_disagreement_score":0.8782702,"about_ca_system_score_codex":0.00048414594,"about_ca_system_score_gemma":0.00076130946,"threshold_uncertainty_score":0.9994714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007188957,0.0005506617,0.994981,0.00085745467,0.0010798529,0.00027870145,0.00002416222,0.00009848657,0.0014107792],"genre_scores_gemma":[0.21882154,0.000068125846,0.7786127,0.0015894964,0.0007507007,0.00000738118,0.000069796035,0.000024786748,0.000055500837],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967931,0.00003070785,0.0004922636,0.0013976184,0.00077361346,0.0005127259],"domain_scores_gemma":[0.9984442,0.0003438114,0.00020421794,0.00067541306,0.0001126187,0.00021971737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056802266,0.00044618794,0.0004262821,0.0010334308,0.00019805547,0.00069429,0.0014289233,0.00023298198,0.000037597245],"category_scores_gemma":[0.000028702005,0.0004403183,0.00009314685,0.0007323568,0.00052917824,0.0012925115,0.00089714665,0.00068338733,0.000020231259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015313706,0.000058277703,0.00049352215,0.00002312558,0.00000998192,0.00009281291,0.00086636713,0.026807513,0.000030815543,0.19725221,0.00019292002,0.77415717],"study_design_scores_gemma":[0.0007210445,0.00012658215,0.002393303,0.00021804961,0.0000054651737,0.00008835763,1.7504748e-7,0.29154962,0.000101410384,0.70049846,0.0036434901,0.0006540091],"about_ca_topic_score_codex":0.000115153154,"about_ca_topic_score_gemma":0.00092525565,"teacher_disagreement_score":0.7735031,"about_ca_system_score_codex":0.00016455511,"about_ca_system_score_gemma":0.0005457021,"threshold_uncertainty_score":0.99980485},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040585521,0.006061679,0.9775199,0.00026606274,0.0035210305,0.0002798163,0.000011945042,0.0003686987,0.011565007],"genre_scores_gemma":[0.56634486,0.00065024203,0.42874935,0.0008924145,0.0019572224,0.000027501967,0.000022194,0.00010121153,0.0012550113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99489206,0.000079576435,0.0007709951,0.0024305654,0.00079321075,0.0010336005],"domain_scores_gemma":[0.994062,0.0029325506,0.00029495734,0.0018963899,0.00041414317,0.00039995974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061254465,0.0008675596,0.0008434206,0.0008561455,0.00046899737,0.0005930442,0.004835341,0.00058799883,0.00003747166],"category_scores_gemma":[0.0003631928,0.00083619135,0.00019971037,0.0007954128,0.00097177544,0.00066011056,0.0021950023,0.0012358739,0.0004323079],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042451597,0.00010310609,0.000105311046,0.00003430351,0.000025461075,0.0003153199,0.0061286613,0.0066897953,0.000077044264,0.008234502,0.0005665668,0.9777157],"study_design_scores_gemma":[0.0004892134,0.00027039376,0.00033440784,0.0015593771,0.000025046109,0.00016346009,4.309843e-7,0.9035534,0.0010686864,0.083595276,0.0070958696,0.0018444177],"about_ca_topic_score_codex":0.00007706371,"about_ca_topic_score_gemma":0.00026571838,"teacher_disagreement_score":0.97587126,"about_ca_system_score_codex":0.0003849858,"about_ca_system_score_gemma":0.001606245,"threshold_uncertainty_score":0.9994089},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011209865,0.0016068659,0.9930674,0.0015457215,0.0021060056,0.00058424467,0.00006759824,0.00017749467,0.0008334779],"genre_scores_gemma":[0.04709173,0.00031885636,0.9458477,0.00552254,0.00071051053,0.0000127314615,0.00019344158,0.00003904338,0.00026344394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99462205,0.000030261157,0.0006582839,0.002554909,0.001047749,0.0010867433],"domain_scores_gemma":[0.994374,0.0004939085,0.0004008164,0.0042135688,0.00026565915,0.00025206027],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011361799,0.0006397903,0.00089550385,0.0010859396,0.00044762992,0.0026794223,0.009980151,0.00036615774,0.000017680633],"category_scores_gemma":[0.00006996587,0.00053378457,0.0002874356,0.0013464814,0.00058212294,0.003022366,0.002939891,0.00058375765,0.000009826858],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004570331,0.000021619588,0.000014773199,0.000011861163,0.000060064336,0.000036815705,0.00073900394,0.028219678,0.0000011459495,0.008432432,0.00008709369,0.96237093],"study_design_scores_gemma":[0.00032495573,0.0002837209,0.00008568035,0.00014501892,0.000100963196,0.000028211129,6.442321e-7,0.92076963,0.000038785183,0.06977238,0.007634985,0.00081502437],"about_ca_topic_score_codex":0.000032525124,"about_ca_topic_score_gemma":0.00025237686,"teacher_disagreement_score":0.9615559,"about_ca_system_score_codex":0.00022692546,"about_ca_system_score_gemma":0.0005926933,"threshold_uncertainty_score":0.9997114},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19733924,0.00029144573,0.80168915,0.000011191157,0.00020029348,0.00021853087,0.000015118091,0.0000080466825,0.0002269855],"genre_scores_gemma":[0.99487954,0.000060386294,0.004683063,0.000059293387,0.00014289752,0.0000015782738,0.000041479863,0.000012255274,0.00011952847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998769,0.00002681404,0.0002265873,0.00059300824,0.00019244559,0.00019216703],"domain_scores_gemma":[0.9993701,0.00004183311,0.0001213781,0.00031828313,0.000082604856,0.00006580608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022430993,0.00019345172,0.00018577457,0.00017779907,0.00015436308,0.000025714986,0.00026488482,0.0003356202,0.0000063577754],"category_scores_gemma":[0.00003556475,0.00020193256,0.000034726232,0.000083307714,0.00016981368,0.000008132407,0.0009202548,0.00017614722,0.0000032297323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026176573,0.00001621988,0.17789498,0.00006362017,0.000015710304,0.000008739814,0.0006338607,0.7482287,0.00020006207,0.00012483215,0.0000028863776,0.07278419],"study_design_scores_gemma":[0.0005189632,0.00022310861,0.18377906,0.0001630795,0.000022285749,0.000013476813,3.6373947e-7,0.8033988,0.00021755288,0.01090862,0.00024831688,0.00050636363],"about_ca_topic_score_codex":0.000019552026,"about_ca_topic_score_gemma":0.0006795735,"teacher_disagreement_score":0.7975403,"about_ca_system_score_codex":0.000060187205,"about_ca_system_score_gemma":0.00008374508,"threshold_uncertainty_score":0.82345706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010575386,0.00030927823,0.9787261,0.00038022466,0.0025224863,0.0005580816,0.000014481779,0.00044287677,0.015988927],"genre_scores_gemma":[0.87688917,0.00001293988,0.12018423,0.0018690922,0.00077243464,0.000005729919,0.00001063092,0.000052280066,0.00020348065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937085,0.00012239409,0.0009336773,0.0023325651,0.001739251,0.0011636217],"domain_scores_gemma":[0.9958283,0.0010318039,0.00063110306,0.0017709514,0.00040722778,0.00033066835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015269368,0.0008897141,0.0008931739,0.0010784068,0.0005558496,0.0009310794,0.0044327234,0.00038611217,0.00001788014],"category_scores_gemma":[0.000090617614,0.0008175347,0.00028982127,0.0008879471,0.00053699873,0.00029299798,0.0014246769,0.0012055006,0.00011969826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002500926,0.00006655828,0.00015677571,0.00003730818,0.000019563151,0.00030656444,0.0006607626,0.7559217,0.000041661468,0.009120116,0.00003734431,0.23360659],"study_design_scores_gemma":[0.00056362065,0.0005206723,0.00021537469,0.0017026834,0.0000086006485,0.00007050643,6.631886e-7,0.98762167,0.00010563015,0.0029763605,0.005304648,0.0009095897],"about_ca_topic_score_codex":0.00009206575,"about_ca_topic_score_gemma":0.000053818785,"teacher_disagreement_score":0.87583166,"about_ca_system_score_codex":0.0006377603,"about_ca_system_score_gemma":0.0005359633,"threshold_uncertainty_score":0.99942756},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30116078,0.0003121242,0.69534403,0.00059643266,0.00205996,0.00032000575,0.0000020665946,0.00018461043,0.00001997698],"genre_scores_gemma":[0.8079208,0.000026054842,0.19118015,0.0006624047,0.00015630158,0.000033580814,0.000005555759,0.000014202275,9.06007e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956012,0.00018912405,0.0005745889,0.001981333,0.00082328287,0.0008305103],"domain_scores_gemma":[0.9968878,0.0004108546,0.00027162093,0.0021450496,0.00013541573,0.0001492335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013635949,0.0004736088,0.00051166036,0.000905959,0.00014868329,0.0010113326,0.004868519,0.00033321505,0.000016303973],"category_scores_gemma":[0.00023865505,0.00042633596,0.00012511325,0.0019095642,0.00040315912,0.00095250044,0.0037382771,0.001236946,0.000036103575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039643182,0.0002700077,0.018036122,0.00027674393,0.000012617165,0.0002025629,0.007636767,0.48770118,0.0044411896,0.0074531427,0.000031871503,0.47393382],"study_design_scores_gemma":[0.00015220797,0.00003276934,0.024294158,0.00041860828,0.0000014822887,0.000016122976,9.786586e-7,0.77478373,0.006760699,0.19300829,0.000026418293,0.00050451065],"about_ca_topic_score_codex":0.0004174273,"about_ca_topic_score_gemma":0.00006243255,"teacher_disagreement_score":0.50676006,"about_ca_system_score_codex":0.00042615892,"about_ca_system_score_gemma":0.0004347758,"threshold_uncertainty_score":0.99981886},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020801708,0.00020207121,0.99321985,0.0014275527,0.001460699,0.00029538662,7.2722634e-7,0.00028699116,0.003085912],"genre_scores_gemma":[0.09421074,0.00003833362,0.8989282,0.00636784,0.00027715607,0.0000044072053,0.000012493267,0.00002048624,0.00014032106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700713,0.00002742308,0.00064046803,0.0008750785,0.0008935809,0.00055631547],"domain_scores_gemma":[0.9979696,0.00015619727,0.00042698983,0.00096693943,0.00031155016,0.00016868168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000592936,0.00044609993,0.00038992718,0.0008654998,0.00034906607,0.00069280254,0.002153171,0.00020988547,0.00001361979],"category_scores_gemma":[0.00012502537,0.00042189105,0.00010569643,0.00047711152,0.00031486576,0.0035615764,0.0008622194,0.0007024826,0.00016034125],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023637233,0.0000070728565,0.00001308457,0.000022478669,0.0000022025029,0.000010857505,0.0009262302,0.0077035227,0.00026736924,0.0041453103,0.000012579037,0.9868869],"study_design_scores_gemma":[0.00028666467,0.000093459916,0.00019800596,0.00036720597,0.0000032773576,0.000032655542,5.0165335e-7,0.83953464,0.003279371,0.15080099,0.0048458115,0.0005574406],"about_ca_topic_score_codex":0.0000134031,"about_ca_topic_score_gemma":0.00001692186,"teacher_disagreement_score":0.9863295,"about_ca_system_score_codex":0.00035626508,"about_ca_system_score_gemma":0.00025427196,"threshold_uncertainty_score":0.9998233},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032465372,0.0016185241,0.99059933,0.00027566953,0.00157416,0.00043873882,0.0000070406113,0.00025935692,0.0049025156],"genre_scores_gemma":[0.66952413,0.000029930568,0.32866335,0.0010106323,0.00044838703,0.000023796176,0.000012519347,0.000064518856,0.00022270874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951606,0.000116343595,0.00086477795,0.0018421562,0.0009297357,0.0010863803],"domain_scores_gemma":[0.99685705,0.0010931634,0.00034254754,0.0013335735,0.00012281114,0.00025086233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002160327,0.0006859788,0.00076126045,0.0015071256,0.00035889048,0.0009539613,0.002593956,0.00045666075,0.000028317469],"category_scores_gemma":[0.00009830703,0.000670996,0.00014158973,0.0009830015,0.00037317525,0.00048822028,0.00041606184,0.0014951077,0.000044543936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006484421,0.000014774186,0.00009329846,0.000050986222,0.0000059249933,0.0033672312,0.0024238972,0.59942174,0.0000068227228,0.0053107915,0.000010952889,0.3892871],"study_design_scores_gemma":[0.00025567983,0.00015587965,0.00001376946,0.0027391086,0.0000063278567,0.0012916394,0.0000015768438,0.9812557,0.00012160999,0.011396176,0.0019545413,0.000807984],"about_ca_topic_score_codex":0.00038463296,"about_ca_topic_score_gemma":0.00020107263,"teacher_disagreement_score":0.6691995,"about_ca_system_score_codex":0.0005185097,"about_ca_system_score_gemma":0.0011489711,"threshold_uncertainty_score":0.9995741},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011172461,0.00022233238,0.9900759,0.0017893113,0.0013461467,0.0005617202,0.0000061472656,0.0046448126,0.0013424814],"genre_scores_gemma":[0.11494794,0.000023042468,0.8830245,0.0012389071,0.0004378218,0.000029931887,0.000009737347,0.000055040757,0.00023306976],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960044,0.000026559326,0.00050612696,0.0018859276,0.00077634375,0.0008006209],"domain_scores_gemma":[0.9966216,0.0007337895,0.00028655707,0.0017874661,0.00033228754,0.00023828713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009834395,0.0006071738,0.00056958786,0.00077799335,0.0003176346,0.00074458437,0.0042132083,0.00037622964,0.000005789749],"category_scores_gemma":[0.00028238213,0.00056718173,0.00017893995,0.00047828682,0.0005583648,0.0007276112,0.0009216255,0.0006465557,0.0000166955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062043105,0.000045437144,0.000035684607,0.00007532803,0.000009631028,0.000043944485,0.0005417739,0.023168888,0.000023615286,0.11503991,0.00021609488,0.8607935],"study_design_scores_gemma":[0.00022210008,0.00046501486,0.000023511257,0.00039881995,0.0000065598906,0.00005312559,1.8977289e-8,0.16990116,0.0006356702,0.827165,0.00051729014,0.00061175274],"about_ca_topic_score_codex":0.00007652028,"about_ca_topic_score_gemma":0.00003823719,"teacher_disagreement_score":0.86018175,"about_ca_system_score_codex":0.0004427721,"about_ca_system_score_gemma":0.00096984336,"threshold_uncertainty_score":0.99967796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022460587,0.0007005685,0.9959391,0.00016951497,0.0020867817,0.0006133663,0.000022926006,0.00015885233,0.00008429155],"genre_scores_gemma":[0.010024218,0.00010875263,0.9883496,0.00061326247,0.0006446577,0.000016195658,0.000029046341,0.000031790223,0.00018248244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670607,0.000035999692,0.0004902299,0.0014599517,0.0007552092,0.000552538],"domain_scores_gemma":[0.9979472,0.00026924475,0.00039626806,0.0006639828,0.0005849357,0.00013837783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062098046,0.000398482,0.00036800504,0.0017314608,0.00055715,0.0006428058,0.0015415641,0.00041450578,0.000009329281],"category_scores_gemma":[0.00014748958,0.00040465832,0.00015962715,0.0014946059,0.00032216733,0.000563868,0.0003663576,0.00053427264,0.00001388528],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041530857,0.000023025606,0.00001312144,0.00004182958,0.00000791009,0.000010038771,0.0003342401,0.0021039513,0.00058113,0.00015196651,0.00011805353,0.9966106],"study_design_scores_gemma":[0.00029880015,0.00013032228,0.0003559295,0.0001015658,0.000014995232,0.00032013172,1.5118664e-7,0.97613305,0.0038192738,0.015880939,0.0022965334,0.0006483346],"about_ca_topic_score_codex":0.00011562768,"about_ca_topic_score_gemma":0.00004902383,"teacher_disagreement_score":0.99596226,"about_ca_system_score_codex":0.00045314262,"about_ca_system_score_gemma":0.00055853144,"threshold_uncertainty_score":0.99984056},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000701085,0.00008066684,0.9417371,0.001342183,0.0006668522,0.000548029,0.000017403578,0.00083616417,0.054701503],"genre_scores_gemma":[0.10762391,0.0002982294,0.86920923,0.018986441,0.0017443926,0.00006665621,0.000112815505,0.00014440832,0.0018139048],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949979,0.000055509747,0.0007069298,0.0019957991,0.001354438,0.00088937656],"domain_scores_gemma":[0.99704826,0.0005544617,0.00038522278,0.0013909239,0.0003487908,0.00027232434],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009631893,0.0007321899,0.00071611884,0.0016392722,0.0003478035,0.0011055787,0.0030389524,0.00073842204,0.00007022512],"category_scores_gemma":[0.0001640973,0.00071062986,0.00021434094,0.0006575644,0.00056091975,0.0010138095,0.0003392789,0.0016790262,0.00040814333],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057797906,0.00003216072,0.0000023299071,0.000012878432,0.0000068841023,0.00011069028,0.00038501693,0.00013351577,0.00017848946,0.0027543546,0.00010780074,0.9962701],"study_design_scores_gemma":[0.00063571386,0.0011391639,0.00010168036,0.0023876692,0.00001610594,0.00030779527,4.504978e-7,0.02705475,0.04959639,0.903133,0.013544184,0.0020831407],"about_ca_topic_score_codex":0.0000070792657,"about_ca_topic_score_gemma":0.000017467595,"teacher_disagreement_score":0.99418694,"about_ca_system_score_codex":0.00040356893,"about_ca_system_score_gemma":0.0004963947,"threshold_uncertainty_score":0.9999314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022639087,0.00029788425,0.9937743,0.00019818156,0.0007511532,0.0005541898,0.0000014333214,0.0001731167,0.0019858459],"genre_scores_gemma":[0.6082324,0.000092263464,0.39093012,0.000475142,0.0001775706,0.000011508944,0.0000015700418,0.000027788701,0.000051650386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961136,0.00004249085,0.0008161425,0.0013231931,0.0010939102,0.0006106555],"domain_scores_gemma":[0.99718314,0.00029789805,0.00030728334,0.0016586774,0.00042381557,0.00012921038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014924573,0.0004874329,0.00064498663,0.0006724079,0.00025814265,0.00019007675,0.0033421079,0.00034511168,0.00001878231],"category_scores_gemma":[0.00004004944,0.00040519194,0.00011754859,0.00090399315,0.00027112445,0.000958722,0.00079821696,0.00065336114,0.000050398252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010252731,0.00001433742,0.00006945493,0.00013407406,0.0000047452345,0.0000055172013,0.0007002415,0.6710215,0.000023905483,0.00023781031,0.000001018011,0.3277771],"study_design_scores_gemma":[0.0001875971,0.00018050514,0.00004016256,0.0011837231,0.000005980179,0.000043941225,1.3026889e-7,0.98052955,0.0006648414,0.016669039,0.0000516947,0.00044283646],"about_ca_topic_score_codex":0.000057690322,"about_ca_topic_score_gemma":0.000013535729,"teacher_disagreement_score":0.6059685,"about_ca_system_score_codex":0.00020432119,"about_ca_system_score_gemma":0.0010426452,"threshold_uncertainty_score":0.99984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003604592,0.0007210053,0.97901136,0.00090084894,0.0023198647,0.0003583063,0.0000033158806,0.00029652726,0.016352726],"genre_scores_gemma":[0.20408927,0.000110328285,0.78738725,0.0053846156,0.0012919042,0.000013478442,0.00001070924,0.00007846572,0.0016339708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99482906,0.000048247875,0.0007846132,0.0019167073,0.0014140464,0.0010072978],"domain_scores_gemma":[0.99660146,0.0006954271,0.00033877205,0.0016934857,0.00035627626,0.00031456535],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002150183,0.00069019385,0.00071190076,0.0009907917,0.00038470002,0.0012536303,0.004555348,0.0005235671,0.000032767348],"category_scores_gemma":[0.00013095177,0.00063293584,0.00019648,0.00073679135,0.00063078175,0.0010223482,0.0013624447,0.0013976615,0.00012352342],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013198463,0.00002459843,0.000017096576,0.000030592637,0.000014713538,0.00017350804,0.00095511286,0.023858959,0.0002384573,0.088336155,0.000064891916,0.8862727],"study_design_scores_gemma":[0.0005799711,0.00012386999,0.000029933695,0.00037658715,0.000010976503,0.000113684,1.5230742e-7,0.67974454,0.0015481691,0.31501433,0.0015356571,0.00092209084],"about_ca_topic_score_codex":0.000047623977,"about_ca_topic_score_gemma":0.00013159044,"teacher_disagreement_score":0.88535064,"about_ca_system_score_codex":0.0003130358,"about_ca_system_score_gemma":0.0007264939,"threshold_uncertainty_score":0.99978316},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069978714,0.00024944727,0.9117723,0.0015530909,0.0006839287,0.00049943663,0.0000075601265,0.000033436154,0.015222054],"genre_scores_gemma":[0.94108456,0.000022183043,0.05787726,0.00038743994,0.00013987122,0.0000033244942,8.987516e-7,0.000019425132,0.0004650226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984951,0.00003766831,0.0003940213,0.00041214054,0.00044306598,0.00021798055],"domain_scores_gemma":[0.9979307,0.00088894105,0.000375793,0.0006348698,0.000120434015,0.0000492612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037754868,0.00026426173,0.00043972017,0.00017771086,0.00009170975,0.000027225045,0.000551153,0.0002707366,0.00006068971],"category_scores_gemma":[0.00009412567,0.00017852717,0.000079131714,0.0002440787,0.0013340322,0.00013666587,0.0002613676,0.0004990537,8.9856957e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001589959,0.00016810777,0.005345278,0.0016157662,0.00015250583,0.00003169738,0.007982856,0.0036584386,0.00022971892,0.8038725,0.0002601801,0.17652395],"study_design_scores_gemma":[0.00040190906,0.00021195842,0.00017074835,0.001071558,0.00006824839,0.0002804171,0.0000105524605,0.0057281866,0.004120324,0.9872986,0.00025625198,0.00038121938],"about_ca_topic_score_codex":0.00003634876,"about_ca_topic_score_gemma":0.00024487014,"teacher_disagreement_score":0.87110585,"about_ca_system_score_codex":0.00004545777,"about_ca_system_score_gemma":0.00015523548,"threshold_uncertainty_score":0.7280127},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061013285,0.000022853652,0.9362784,0.00010313008,0.0012862212,0.0010013883,0.000009071948,0.00013690114,0.0001487235],"genre_scores_gemma":[0.9021596,0.0000017160058,0.09740553,0.00015992414,0.00021716894,0.000023195797,0.000010852227,0.00001743666,0.000004618965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99527895,0.000048989208,0.00055921834,0.00087715953,0.00270164,0.0005340432],"domain_scores_gemma":[0.9952162,0.0020992646,0.00018842662,0.0013236271,0.0009212029,0.00025129644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025486217,0.00036983978,0.0003782056,0.0013074658,0.00017082132,0.0004901424,0.0029094021,0.00028036896,0.000025337544],"category_scores_gemma":[0.0022109696,0.0003564173,0.000058571786,0.0010217888,0.00019024553,0.0017089696,0.0011748713,0.0008674037,0.000052426993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002049286,0.00016026715,0.0017248314,0.00001271631,0.000008198411,0.0000050111566,0.0024114724,0.12939446,0.00013305091,0.00026104247,0.0000031171944,0.86586535],"study_design_scores_gemma":[0.0017128132,0.0056494735,0.06244536,0.00014474822,0.000019884958,0.000019411746,0.0000016920502,0.9230199,0.0033376587,0.0025819272,0.00017138028,0.0008957588],"about_ca_topic_score_codex":0.000023594119,"about_ca_topic_score_gemma":0.000073283496,"teacher_disagreement_score":0.8649696,"about_ca_system_score_codex":0.00031433103,"about_ca_system_score_gemma":0.00075475103,"threshold_uncertainty_score":0.9998888},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021954442,0.0019901793,0.9814664,0.01238626,0.00024044607,0.0011861726,0.0000024457586,0.000068720125,0.0024398195],"genre_scores_gemma":[0.8660037,0.0002330274,0.12664077,0.0062542967,0.00016794259,0.000084712236,0.000003351029,0.000030068308,0.0005821558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978795,0.000113676484,0.000451413,0.00067344407,0.0005337577,0.00034819703],"domain_scores_gemma":[0.9957939,0.0018259432,0.00036874277,0.0017642124,0.00019980191,0.000047413985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002439129,0.00034246678,0.0004137002,0.00019237112,0.00048415034,0.00047179314,0.0039469628,0.00012437251,0.0000031709699],"category_scores_gemma":[0.00012315996,0.00017333796,0.000102776794,0.00030663423,0.001990243,0.0002956594,0.0008782686,0.00049469166,0.0000019940937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002219438,0.0000139621925,7.788631e-7,0.000025012241,0.000008232519,6.014907e-7,0.0019223345,0.0020841544,0.000068672736,0.65987134,0.000040701252,0.33594203],"study_design_scores_gemma":[0.00044386246,0.000115310606,0.000008323093,0.0005322581,0.000009211967,0.00001439323,0.0000014477171,0.21334502,0.0017467712,0.78233093,0.0012193281,0.00023313267],"about_ca_topic_score_codex":0.000026669868,"about_ca_topic_score_gemma":0.000047451562,"teacher_disagreement_score":0.8657841,"about_ca_system_score_codex":0.00006610129,"about_ca_system_score_gemma":0.0001891067,"threshold_uncertainty_score":0.7334505},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013795549,0.0006283478,0.9966909,0.00048779696,0.0010459564,0.00016912111,9.581822e-7,0.0005323978,0.00030656328],"genre_scores_gemma":[0.1940605,0.0000054620477,0.80508965,0.00019623779,0.00026194207,0.000008317746,0.000005628652,0.000040068182,0.000332211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996998,0.00003757605,0.0004422613,0.0011738971,0.00061883475,0.0007294245],"domain_scores_gemma":[0.9982666,0.00055675546,0.00017568226,0.0008197976,0.00006760282,0.000113563496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008822352,0.0004445463,0.00039964696,0.0012303573,0.00022100631,0.0006161801,0.001971847,0.00026182242,0.0000015897198],"category_scores_gemma":[0.00024456007,0.00045756885,0.00009346261,0.0006740285,0.00018328261,0.00044755577,0.00068608247,0.0016399897,0.000016774533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.4081127e-7,0.0000119636825,0.0006934109,0.000022050768,0.0000027626395,0.00012602388,0.00043067278,0.65581435,0.0000056657263,0.0054881284,0.000010871198,0.33739346],"study_design_scores_gemma":[0.00034357424,0.00013175329,0.002989563,0.00233893,0.0000071493714,0.00013254967,1.9174823e-7,0.9489319,0.0000515142,0.027902113,0.01590891,0.0012618798],"about_ca_topic_score_codex":0.00014325306,"about_ca_topic_score_gemma":0.00006348926,"teacher_disagreement_score":0.3361316,"about_ca_system_score_codex":0.00036473002,"about_ca_system_score_gemma":0.00028509414,"threshold_uncertainty_score":0.9997876},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024912917,0.00003220585,0.9949113,0.00096253166,0.0006138156,0.0002501782,0.000002356541,0.00006466505,0.0029138306],"genre_scores_gemma":[0.9488824,0.000012768899,0.049415532,0.0015588377,0.00008540636,0.0000029477599,0.0000039897127,0.000010599818,0.000027539709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833244,0.00007958111,0.00031163217,0.00064819795,0.000401784,0.00022636905],"domain_scores_gemma":[0.9976052,0.0011747021,0.00025416448,0.0007181128,0.00016875498,0.000079035904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016074606,0.00022121258,0.00021708412,0.00056883984,0.0002122717,0.00012524781,0.00066310697,0.0002202484,0.00003988032],"category_scores_gemma":[0.00013933743,0.00016771653,0.000054683565,0.00029171954,0.0007435778,0.00026937126,0.00008991283,0.00041688205,0.00000313891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014083216,0.000021847982,0.00005252534,0.000008211115,0.0000033545468,0.000007401872,0.00025247483,0.06815648,0.000081452075,0.37365925,0.0000023879234,0.5577405],"study_design_scores_gemma":[0.00018358244,0.0002070103,0.0031018723,0.00011203157,0.0000060607517,0.000038843496,9.1485754e-7,0.90634155,0.0007195534,0.08898807,0.000075187134,0.00022532241],"about_ca_topic_score_codex":0.000024104258,"about_ca_topic_score_gemma":0.00021317665,"teacher_disagreement_score":0.94863325,"about_ca_system_score_codex":0.00010496426,"about_ca_system_score_gemma":0.00018276277,"threshold_uncertainty_score":0.68392813},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010451462,0.00004317888,0.9779929,0.0011322761,0.000982473,0.00044936631,0.000012981245,0.000100250865,0.01918208],"genre_scores_gemma":[0.2363572,0.00005328993,0.7464185,0.0062928423,0.00079217507,0.000038700036,0.00005501562,0.0000729539,0.009919349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979366,0.000038809707,0.00028161658,0.0006206376,0.00071846537,0.0004038675],"domain_scores_gemma":[0.99891746,0.00019920547,0.00014628115,0.00026417014,0.0002874512,0.00018543744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008464384,0.00020373566,0.00020469935,0.00049172784,0.000621378,0.00024297222,0.000491268,0.00020578071,0.00010024067],"category_scores_gemma":[0.0002187463,0.00020761626,0.000051054085,0.00056982465,0.00044151593,0.00035108905,0.00003280639,0.0003387814,0.00005441871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012300345,0.000039671973,0.0007353771,0.00003946736,0.00001065294,0.000025710686,0.030126287,0.46167144,0.000067685585,0.05067652,0.0002970796,0.4562978],"study_design_scores_gemma":[0.0026825017,0.0007716707,0.004950448,0.0023899665,0.00023076711,0.000025539064,0.00010666814,0.15321526,0.0020693396,0.21842803,0.60658234,0.008547484],"about_ca_topic_score_codex":0.00029561773,"about_ca_topic_score_gemma":0.0021505686,"teacher_disagreement_score":0.6062852,"about_ca_system_score_codex":0.00024714548,"about_ca_system_score_gemma":0.0006792074,"threshold_uncertainty_score":0.84663457},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030573604,0.0013716713,0.9918469,0.0007659986,0.00096902606,0.0005628657,0.00003838692,0.00024322444,0.0011445256],"genre_scores_gemma":[0.7192334,0.00010117211,0.27704582,0.0030579742,0.00037972987,0.000010112397,0.000026226848,0.000056612727,0.00008896372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943105,0.00003911149,0.0008595524,0.0023658085,0.0015681289,0.00085692084],"domain_scores_gemma":[0.9951821,0.00012956861,0.00048870826,0.0035188904,0.00040281643,0.00027790427],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007236827,0.0007514637,0.00086282217,0.0013147673,0.0003701112,0.0003943551,0.0110164555,0.0003053807,0.0000071285262],"category_scores_gemma":[0.000013644509,0.00062390836,0.00013211025,0.0011139489,0.00035900273,0.0013899346,0.0070236023,0.0007377353,0.0000236684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006511803,0.00016084526,0.00036213858,0.0015947175,0.000105597515,0.00022808417,0.026937764,0.4782287,0.009321457,0.0033421132,0.00006955382,0.47958392],"study_design_scores_gemma":[0.0002024949,0.00010589004,0.000023655939,0.0016308918,0.000013956163,0.000074563315,0.0000021911972,0.9866092,0.005043343,0.0042174994,0.0013306701,0.00074562343],"about_ca_topic_score_codex":0.00021484477,"about_ca_topic_score_gemma":0.00093048695,"teacher_disagreement_score":0.71617603,"about_ca_system_score_codex":0.00013433723,"about_ca_system_score_gemma":0.0008799433,"threshold_uncertainty_score":0.9996212},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003354697,0.00017047819,0.99368256,0.0015897694,0.0018509858,0.0006219491,0.000013746816,0.0001423395,0.0019247915],"genre_scores_gemma":[0.013481247,0.000113598064,0.98410016,0.0014794683,0.00049009535,0.0000307253,0.0000066543034,0.000026624064,0.00027140108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764,0.000015747932,0.0003911097,0.00094633043,0.00053088967,0.00047590866],"domain_scores_gemma":[0.9977756,0.0008033626,0.00020907228,0.00087921886,0.00022670423,0.000106037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057436345,0.00035730255,0.0002959742,0.00036640142,0.00037356655,0.0006340851,0.0018235267,0.00019292244,0.00012708092],"category_scores_gemma":[0.000059314523,0.0002775393,0.00014055333,0.00037097192,0.0007168132,0.00036181888,0.00050698034,0.00045999698,0.000012910508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.4934336e-7,0.00000508906,0.000005277232,0.0000059909025,0.000008559454,0.000012565357,0.00019969244,0.019660955,0.000009791079,0.011335228,0.00001588935,0.96874],"study_design_scores_gemma":[0.00022437812,0.00006250171,0.00003827596,0.00010664062,0.0000072627595,0.00012872143,4.2027824e-7,0.9604666,0.00014001557,0.033766758,0.0047239102,0.0003345084],"about_ca_topic_score_codex":0.000012968198,"about_ca_topic_score_gemma":0.00006152897,"teacher_disagreement_score":0.9684055,"about_ca_system_score_codex":0.00019397843,"about_ca_system_score_gemma":0.00042368512,"threshold_uncertainty_score":0.9999677},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09685619,0.0001468544,0.9019568,0.00012605419,0.00034532053,0.00018961434,7.944825e-7,0.00037563065,0.000002726321],"genre_scores_gemma":[0.51695406,0.0000026566383,0.4829143,0.000076547076,0.000026844857,0.0000193278,2.8610214e-7,0.000005871328,8.497909e-8],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997999,0.000068824884,0.00028275925,0.0006854371,0.000522765,0.00044122763],"domain_scores_gemma":[0.9981897,0.00029012602,0.00012026724,0.0010353713,0.0002498284,0.000114707116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048561234,0.0002025038,0.00029762235,0.00040935678,0.00014366029,0.00010106108,0.0020201264,0.000085917774,0.0000018359937],"category_scores_gemma":[0.000036377816,0.00016963681,0.000033639062,0.0017220216,0.00047975103,0.0007743794,0.00027910332,0.00020310207,9.541013e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042177144,0.00008474335,0.051072884,0.00003209411,0.0000033791355,0.00007100528,0.00076104933,0.89895743,0.00031013542,0.0029574549,0.0000061552037,0.04573942],"study_design_scores_gemma":[0.00016039865,0.00045475314,0.0041836556,0.00012106736,0.000001488275,0.00009215427,1.10791134e-7,0.9724568,0.021809157,0.00046689235,0.000037085694,0.00021643033],"about_ca_topic_score_codex":0.00018482876,"about_ca_topic_score_gemma":0.000025386622,"teacher_disagreement_score":0.4200979,"about_ca_system_score_codex":0.000121703124,"about_ca_system_score_gemma":0.0002812864,"threshold_uncertainty_score":0.6917588},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007646043,0.00079867535,0.99306464,0.0005684716,0.0044903588,0.00035264587,0.000043365777,0.0004919972,0.00011336625],"genre_scores_gemma":[0.0091005685,0.000012058277,0.9884506,0.0011015526,0.0009925996,0.000028762317,0.000034392542,0.00004368053,0.00023578621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957803,0.00004573039,0.00050415064,0.002034896,0.00091363094,0.0007213037],"domain_scores_gemma":[0.98830676,0.009074253,0.0003645624,0.0017356047,0.00032995586,0.00018886311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080625154,0.00065236137,0.00089678465,0.0010634479,0.00035198577,0.00075409195,0.0032589848,0.00078601204,0.000042136624],"category_scores_gemma":[0.0024141977,0.00061510754,0.00037780099,0.0011072456,0.0007635979,0.00078626204,0.001039719,0.0015776509,0.000010500049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017710034,0.000015279917,0.000035684294,0.000013805546,0.00017308322,0.000037109457,0.00130891,0.6468548,0.0002488179,0.05904779,0.000022125543,0.29222488],"study_design_scores_gemma":[0.00023410622,0.00012722219,0.00048540323,0.00017019994,0.000097113516,0.000022217586,7.961933e-7,0.08571954,0.0034186265,0.9074306,0.0014063293,0.0008878528],"about_ca_topic_score_codex":0.000025791405,"about_ca_topic_score_gemma":0.00008606017,"teacher_disagreement_score":0.84838283,"about_ca_system_score_codex":0.0002020335,"about_ca_system_score_gemma":0.00044903776,"threshold_uncertainty_score":0.99963003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047021047,0.0010197667,0.9957779,0.0010569154,0.0006745096,0.00067871466,0.000057065903,0.0005945207,0.00009359644],"genre_scores_gemma":[0.108760074,0.0000020351363,0.8894902,0.0013558606,0.00024559253,0.000017662918,0.000046982233,0.00003451268,0.000047060505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968714,0.000033113374,0.00042887244,0.0013284935,0.000776066,0.00056202145],"domain_scores_gemma":[0.9974595,0.00082429464,0.00023715605,0.0010761976,0.00024214893,0.00016071687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095206883,0.0004875333,0.00048272146,0.00045534564,0.0002554425,0.0004585999,0.0023216018,0.00047349377,0.000020513966],"category_scores_gemma":[0.00021804182,0.00042529398,0.00013024003,0.0003434028,0.00054966635,0.00040055244,0.0003191289,0.0011332793,0.000008507533],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002324872,0.000037303813,0.000011360291,0.00014415913,0.000005166696,0.00009557446,0.0004734224,0.00031889076,0.004132928,0.012949305,0.000015062045,0.9817936],"study_design_scores_gemma":[0.00038345423,0.00015913392,0.000011184363,0.00027033107,0.0000114674685,0.000029346436,5.227475e-8,0.75219494,0.037439525,0.20855294,0.000346353,0.00060129166],"about_ca_topic_score_codex":0.000041092157,"about_ca_topic_score_gemma":0.00024005953,"teacher_disagreement_score":0.9811923,"about_ca_system_score_codex":0.00015717537,"about_ca_system_score_gemma":0.000504816,"threshold_uncertainty_score":0.9998199},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021580177,0.00007239934,0.98514926,0.006569572,0.0019602426,0.0012086962,0.0000053522062,0.00013136325,0.004881527],"genre_scores_gemma":[0.48756215,0.000021144135,0.4404962,0.07045914,0.00052446796,0.0004229353,0.000029493436,0.000048049384,0.0004364139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788123,0.00004155949,0.0005706961,0.00057124085,0.00054398866,0.00039128467],"domain_scores_gemma":[0.9975654,0.00056081964,0.0005266932,0.000987388,0.00029201282,0.000067705216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015528906,0.0003261663,0.00028554743,0.00052008854,0.00030427438,0.0007275547,0.0017509289,0.00018320115,0.000008548552],"category_scores_gemma":[0.00014736802,0.00023056846,0.00013393693,0.00028054276,0.00014356324,0.00057442195,0.00018197636,0.00036456744,0.00001572668],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025127285,0.000020139174,0.000006273929,0.000044555047,0.0000041716426,8.4195085e-7,0.00033980818,0.0006172042,0.000010640983,0.13135129,0.0021175223,0.865485],"study_design_scores_gemma":[0.00032304585,0.000418656,0.0000150488995,0.0008821363,0.0000076189917,0.000025803825,0.0000018069334,0.5954414,0.004102484,0.14562897,0.25243452,0.0007185003],"about_ca_topic_score_codex":0.0000170684,"about_ca_topic_score_gemma":0.00002614911,"teacher_disagreement_score":0.86476654,"about_ca_system_score_codex":0.00029647804,"about_ca_system_score_gemma":0.0010239291,"threshold_uncertainty_score":0.9402309},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022865432,0.0003842143,0.9958851,0.0018117784,0.00011402261,0.0005884008,0.000017739589,0.00018400674,0.0007861013],"genre_scores_gemma":[0.13593367,0.00033173864,0.8618228,0.0014387608,0.000099503915,0.000018787186,0.000008929918,0.000028834598,0.00031701307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745035,0.000024962546,0.00040720328,0.0012539678,0.000394589,0.00046893995],"domain_scores_gemma":[0.9984251,0.0004561061,0.00023965204,0.0005129594,0.00019550597,0.00017067265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006608903,0.0004342981,0.00049846026,0.0004642929,0.00045259032,0.0009507936,0.0010228878,0.00020194403,0.000006104002],"category_scores_gemma":[0.000041421456,0.00039962912,0.000054036293,0.00024526747,0.00087579276,0.0006202515,0.0010567256,0.00036271114,8.6844665e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029153452,0.000034897355,0.000057404144,0.0002918835,0.00002186523,0.00003369131,0.0030876382,0.0005302251,0.0167742,0.08515093,0.00009434057,0.8938938],"study_design_scores_gemma":[0.00024034061,0.00010137988,0.00016774319,0.00016170903,0.000006770172,0.000101371705,0.0000012514633,0.7676859,0.0006432807,0.22986175,0.0006300067,0.0003985043],"about_ca_topic_score_codex":0.000012073382,"about_ca_topic_score_gemma":0.000014600138,"teacher_disagreement_score":0.89349526,"about_ca_system_score_codex":0.0000878698,"about_ca_system_score_gemma":0.00013776621,"threshold_uncertainty_score":0.99984556},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028833067,0.000034428544,0.96890503,0.001137052,0.00028184554,0.0004738417,3.5333804e-7,0.00033048991,0.00000386355],"genre_scores_gemma":[0.5437076,0.0000036203496,0.45542482,0.0007852347,0.00006280099,0.000009872541,8.575577e-7,0.000004279863,9.326226e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845666,0.000035824203,0.00019837498,0.00062247546,0.0003280156,0.0003586282],"domain_scores_gemma":[0.9991946,0.00005151239,0.00010007491,0.0003971595,0.00020140552,0.000055211607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051829097,0.00016280737,0.00014416141,0.0003320001,0.00033997992,0.00039365608,0.0005344582,0.00005601639,5.052866e-7],"category_scores_gemma":[0.000019694015,0.0001296449,0.000031867403,0.001497788,0.00010696514,0.0012454147,0.00006570653,0.00014503565,0.0000011680017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004010306,0.000044329558,0.000032881562,0.0000066699304,0.0000015051517,0.0000053682247,0.0017499665,0.22728676,0.023616662,0.00014953701,0.00000630736,0.7470599],"study_design_scores_gemma":[0.0002516952,0.0006854472,0.00045833352,0.000043217282,0.0000011616779,0.00007583865,8.2164235e-7,0.5573409,0.42838883,0.012571702,0.000024341813,0.0001576729],"about_ca_topic_score_codex":0.000029649982,"about_ca_topic_score_gemma":0.0000073443034,"teacher_disagreement_score":0.7469022,"about_ca_system_score_codex":0.0001146148,"about_ca_system_score_gemma":0.00010836318,"threshold_uncertainty_score":0.52867657},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034152437,0.00019291243,0.9930619,0.00006810947,0.0005064602,0.00021513189,0.000002306132,0.000046137287,0.0024917806],"genre_scores_gemma":[0.78627205,0.000006187966,0.21336158,0.00008491453,0.00012656623,0.0000022879055,0.000005353665,0.000013375059,0.00012770422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970452,0.0000438048,0.00073094515,0.0009598275,0.0008728893,0.00034731938],"domain_scores_gemma":[0.9979053,0.00021279651,0.00067463715,0.00078452943,0.00032355866,0.00009918451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008335852,0.0003427534,0.00062538084,0.00064774416,0.00007055654,0.00016280774,0.0026546007,0.00025251356,0.00003564057],"category_scores_gemma":[0.00004679312,0.00029225776,0.00016982754,0.000437965,0.00059389835,0.0005820341,0.0005444664,0.0003870161,0.00001072586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032556352,0.00005686419,0.000021310261,0.000058907688,0.000022756629,0.000007201467,0.0018765521,0.11588461,0.00019243646,0.26139852,0.000004802734,0.6204728],"study_design_scores_gemma":[0.000115975876,0.00020741636,0.00006659514,0.00019055292,0.000011392782,0.000015409845,7.2305244e-7,0.9890256,0.0029388007,0.0070855212,0.000052457184,0.00028957403],"about_ca_topic_score_codex":0.000032139236,"about_ca_topic_score_gemma":0.00007212734,"teacher_disagreement_score":0.873141,"about_ca_system_score_codex":0.000082343286,"about_ca_system_score_gemma":0.00025171658,"threshold_uncertainty_score":0.999953},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041228635,0.00066991406,0.9958903,0.00022824144,0.0019214082,0.0005899223,0.000028336053,0.00014991952,0.000109624394],"genre_scores_gemma":[0.0076742503,0.00015063018,0.99071634,0.0005666442,0.0005968509,0.00001563736,0.000035345263,0.000029014875,0.00021526728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967037,0.000037543447,0.00047921002,0.0014355056,0.00079499226,0.00054907514],"domain_scores_gemma":[0.9980317,0.00025936353,0.0003277075,0.00065024407,0.0005846116,0.00014637521],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056262413,0.00040517276,0.00038038043,0.0016963745,0.0005172989,0.000589816,0.0016024319,0.00042552137,0.000014245861],"category_scores_gemma":[0.000104319246,0.00041093244,0.00016829705,0.0015332003,0.0003798044,0.00051390956,0.000342089,0.0005272654,0.000019694391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008462464,0.000043075102,0.00001698366,0.00004051051,0.000015089793,0.000018705454,0.0005832276,0.016798625,0.00029083056,0.0002500369,0.00038538428,0.9815491],"study_design_scores_gemma":[0.0003283078,0.0001627058,0.00045268703,0.00010503405,0.000015571155,0.0004272016,1.5874396e-7,0.97885257,0.0028976856,0.01099836,0.005078103,0.0006816413],"about_ca_topic_score_codex":0.000050894974,"about_ca_topic_score_gemma":0.000024836336,"teacher_disagreement_score":0.98086745,"about_ca_system_score_codex":0.0003994267,"about_ca_system_score_gemma":0.00051752676,"threshold_uncertainty_score":0.99983424},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005269756,0.0003928688,0.9890621,0.0011134276,0.0011891698,0.00035981543,0.00000199272,0.00013022262,0.0024806536],"genre_scores_gemma":[0.6028154,0.000119811455,0.39607704,0.00072071725,0.00016667409,0.00001161569,0.0000031621998,0.00002014385,0.00006546402],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744385,0.000027099064,0.0005219579,0.00090340263,0.00057824503,0.0005254667],"domain_scores_gemma":[0.99849194,0.00041987383,0.00019374452,0.000680792,0.000118508775,0.00009514923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008826348,0.0003877181,0.00047051974,0.0008659347,0.00021755963,0.00064962625,0.0016379409,0.00037953316,0.0000065402555],"category_scores_gemma":[0.00010701957,0.00034223002,0.00006406643,0.00056606776,0.0007524993,0.0009354049,0.00048219878,0.0008119252,0.0000082825845],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071240693,0.000021755814,0.0011473923,0.00012140616,0.0000063075413,0.000071890754,0.008208581,0.0021223375,0.0007178272,0.06673214,0.0000036518882,0.9208396],"study_design_scores_gemma":[0.00073007453,0.0002170724,0.005581796,0.0007039638,0.000010317186,0.00021723827,0.000004860087,0.33709165,0.0058165016,0.6475994,0.0008273113,0.0011998102],"about_ca_topic_score_codex":0.00005238686,"about_ca_topic_score_gemma":0.00084886205,"teacher_disagreement_score":0.91963977,"about_ca_system_score_codex":0.00007735012,"about_ca_system_score_gemma":0.00023782291,"threshold_uncertainty_score":0.99990296},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55912924,0.00057060044,0.43601912,0.00007491157,0.0009128082,0.0007350059,0.0000023935222,0.00001719557,0.002538701],"genre_scores_gemma":[0.9982659,0.000008739298,0.00121257,0.00007714063,0.000043604174,0.000012203931,0.0000011288363,0.000017031929,0.00036162962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974013,0.0006625567,0.00054510974,0.0005600124,0.00054561254,0.00028543052],"domain_scores_gemma":[0.9982386,0.00054341264,0.00058199,0.0004760604,0.00013448406,0.000025458537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026143072,0.0002393482,0.00040013666,0.00012349464,0.00029810765,0.000028245635,0.00050658017,0.000094971445,0.0000067190354],"category_scores_gemma":[0.00011578187,0.00015078152,0.000039322087,0.00022985629,0.0003743344,0.00005131979,0.0003083638,0.0008759132,2.5748432e-7],"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.00004790638,0.00008854121,0.016334826,0.000069396396,0.000042754105,0.000014377686,0.06480191,0.4493186,0.0001401918,0.0011464722,0.0000069151756,0.46798813],"study_design_scores_gemma":[0.00170913,0.0010505768,0.1433881,0.0013862319,0.00005332436,0.00008046947,0.0005059904,0.8495846,0.00019316141,0.0007921015,0.00049128995,0.0007650461],"about_ca_topic_score_codex":0.15623695,"about_ca_topic_score_gemma":0.5109161,"teacher_disagreement_score":0.46722308,"about_ca_system_score_codex":0.0013496417,"about_ca_system_score_gemma":0.000379789,"threshold_uncertainty_score":0.84938174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005630693,0.0008093384,0.9303023,0.0010029073,0.0027120202,0.00089964445,0.000037609887,0.00008070659,0.058524776],"genre_scores_gemma":[0.99562615,0.00009430002,0.0012362049,0.00026059552,0.00034894605,0.000015943064,0.0000016774544,0.000024421772,0.0023917775],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99752134,0.00003613952,0.00032231348,0.00078881136,0.0008015286,0.00052988424],"domain_scores_gemma":[0.9953294,0.0037124522,0.00013823346,0.00036666755,0.00035848434,0.00009475794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087046006,0.00024210416,0.00023156474,0.00055326446,0.0003596357,0.00019303283,0.0012341589,0.00010606971,0.00004268444],"category_scores_gemma":[0.0015705209,0.00017641223,0.00008979678,0.00087035354,0.0018923214,0.00017623333,0.0004453422,0.00054709247,0.00006485199],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000133475505,0.00006118218,0.00011722294,0.000047723235,0.0000036901624,0.000017912289,0.00075258495,0.0026140683,0.0097731585,0.004934765,0.00010469485,0.98155963],"study_design_scores_gemma":[0.0005961482,0.00039986442,0.0027651368,0.0016153614,0.000025008003,0.00006998757,0.0000047015055,0.24884869,0.69483995,0.039462928,0.010073867,0.0012983606],"about_ca_topic_score_codex":0.00001719905,"about_ca_topic_score_gemma":0.00004124905,"teacher_disagreement_score":0.9899954,"about_ca_system_score_codex":0.000116800526,"about_ca_system_score_gemma":0.0006728784,"threshold_uncertainty_score":0.7193882},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009798154,0.00032835142,0.9915367,0.0007302314,0.0011419941,0.000316603,0.0000019055956,0.0005404637,0.0044239727],"genre_scores_gemma":[0.26803046,0.000015341135,0.7297863,0.0011477467,0.0005063474,0.000009755899,0.000003616025,0.0000558851,0.00044458624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949079,0.00003998307,0.00059233385,0.0020208652,0.001393769,0.001045156],"domain_scores_gemma":[0.9968097,0.00052474195,0.00043937302,0.0016475482,0.0004137427,0.00016488727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020698104,0.0006481504,0.000626894,0.0011180841,0.000413572,0.00054774416,0.0036057027,0.00045439173,0.000022954377],"category_scores_gemma":[0.0001523256,0.00053886493,0.00011501429,0.00096619496,0.0011601313,0.00053748407,0.00094667106,0.001463105,0.000055758974],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000686604,0.000027604994,0.00035938623,0.000024125176,0.000014206986,0.00020191408,0.00036384654,0.010412621,0.00014544567,0.015903896,0.000008210762,0.97253186],"study_design_scores_gemma":[0.0014708841,0.0022545476,0.0034037437,0.0033259036,0.00006216285,0.00055611716,0.0000014105389,0.77254105,0.008681337,0.19675623,0.007448033,0.0034986024],"about_ca_topic_score_codex":0.000016928103,"about_ca_topic_score_gemma":0.00010611169,"teacher_disagreement_score":0.9690333,"about_ca_system_score_codex":0.00031234007,"about_ca_system_score_gemma":0.0005452407,"threshold_uncertainty_score":0.99970627},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012618076,0.0007305261,0.9937143,0.0019324714,0.0022807554,0.000664879,0.000004028292,0.00009939791,0.0004475146],"genre_scores_gemma":[0.041342765,0.000057742964,0.9542892,0.003921862,0.00023428939,0.000020851532,0.0000028908544,0.000032496646,0.000097900316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579465,0.00005246294,0.00079528516,0.0016221429,0.00075542356,0.0009800226],"domain_scores_gemma":[0.9974584,0.0006195602,0.00026433,0.0011824715,0.0001785588,0.00029669935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001067624,0.0005523004,0.000614918,0.0015181471,0.00014065045,0.00037314923,0.0020236182,0.0003422216,0.000028909188],"category_scores_gemma":[0.00031805979,0.00053919194,0.000094597664,0.0011539789,0.0003072124,0.00059056166,0.00092211465,0.0013887022,0.000115959396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064758888,0.000054712382,0.00016191443,0.000014930003,0.000002680084,0.00011042024,0.0031972278,0.022085657,0.00021490434,0.0036980226,0.000011738133,0.97044134],"study_design_scores_gemma":[0.00052800187,0.000120127566,0.0013161233,0.0012779579,0.0000028301095,0.00006976093,0.0000024378762,0.94985664,0.001061109,0.042350546,0.002432163,0.0009822805],"about_ca_topic_score_codex":0.00008960223,"about_ca_topic_score_gemma":0.0003073547,"teacher_disagreement_score":0.96945906,"about_ca_system_score_codex":0.0006280654,"about_ca_system_score_gemma":0.00037613884,"threshold_uncertainty_score":0.999706},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007500632,0.0004313949,0.9568595,0.0007482104,0.002730782,0.00022098937,0.0000033248755,0.00029867148,0.038632073],"genre_scores_gemma":[0.38125935,0.0003293777,0.6008119,0.008171309,0.003136281,0.000053418305,0.000020260886,0.00015177147,0.00606633],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666226,0.00003438706,0.00039892824,0.001450617,0.0007983556,0.0006554444],"domain_scores_gemma":[0.99741507,0.00035113894,0.0001759887,0.0016845793,0.00017059167,0.00020262982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007250961,0.00047999778,0.00040079563,0.0010800827,0.00041900633,0.00054428296,0.0032963336,0.00026222513,0.000116879004],"category_scores_gemma":[0.000040454586,0.00044391668,0.0002278003,0.0010599832,0.0006507702,0.00052176166,0.001189247,0.0007858786,0.00018640462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000414733,0.000031555046,0.00004476721,0.000009910434,0.000009651489,0.000055111792,0.0002420626,0.0043559405,0.000055769073,0.15582368,0.000076992415,0.83929044],"study_design_scores_gemma":[0.00026626282,0.00029371624,0.000117221796,0.00028041212,0.000015045812,0.00021722703,2.2240184e-7,0.079077736,0.00031340416,0.858536,0.05990822,0.000974536],"about_ca_topic_score_codex":0.000009908721,"about_ca_topic_score_gemma":0.00004034585,"teacher_disagreement_score":0.8383159,"about_ca_system_score_codex":0.00016694714,"about_ca_system_score_gemma":0.00029660593,"threshold_uncertainty_score":0.9998013},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022249043,0.00067405554,0.99061257,0.00005690512,0.000901076,0.00034845519,0.0000013206526,0.00018482521,0.004995865],"genre_scores_gemma":[0.9396977,0.000060002356,0.052008454,0.00018199052,0.00052134827,0.00001984367,0.0000019748734,0.00005696242,0.0074517615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965209,0.000072047034,0.0004176568,0.0015169553,0.0007658201,0.0007066385],"domain_scores_gemma":[0.9980998,0.0005643416,0.00031115924,0.0005177465,0.0003198747,0.00018706289],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000892688,0.000563278,0.0005633909,0.0005973006,0.00046227226,0.0005642738,0.0010242169,0.00021075332,0.00001748579],"category_scores_gemma":[0.00012618613,0.0004672379,0.00007438274,0.00027892675,0.0007641161,0.00058418384,0.000875164,0.0012176553,0.00002862205],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003135854,0.000035306854,0.0027686555,0.00021791333,0.000076041426,0.0005325118,0.022661569,0.015747149,0.00007071483,0.2441082,0.0000018616541,0.7137487],"study_design_scores_gemma":[0.0048712445,0.012391337,0.011225342,0.039775845,0.00031357555,0.004950373,0.000121629106,0.47977364,0.0137505075,0.3507059,0.066060126,0.016060501],"about_ca_topic_score_codex":0.00023742348,"about_ca_topic_score_gemma":0.000072326875,"teacher_disagreement_score":0.9386041,"about_ca_system_score_codex":0.00023900821,"about_ca_system_score_gemma":0.00033952974,"threshold_uncertainty_score":0.9997779},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000075737466,0.00068192085,0.99711424,0.0007571846,0.0006518196,0.0004152269,0.0000033958063,0.00016992309,0.00013057246],"genre_scores_gemma":[0.02952053,0.00019322471,0.9695185,0.00045734455,0.00024493478,0.000016125809,0.0000018720928,0.000021329452,0.000026138405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969246,0.000062194886,0.0005469861,0.0009821708,0.0010449062,0.0004391775],"domain_scores_gemma":[0.99657995,0.0008098326,0.00061058655,0.0017660612,0.00017124921,0.000062302155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011678948,0.00039073126,0.0004088552,0.0008052078,0.000066253706,0.0003565464,0.004515391,0.00019755012,0.0000050405197],"category_scores_gemma":[0.000108376706,0.0002962982,0.00010014931,0.0006800936,0.00037432168,0.001114894,0.0010274429,0.0010656199,0.0000066315283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017093755,0.000037492642,0.000102903825,0.00003234705,0.0000028231848,0.000022169535,0.00073581137,0.060937263,0.000014431795,0.06289912,0.00004214689,0.8751718],"study_design_scores_gemma":[0.00012342984,0.00012066607,0.0004473983,0.00073431444,0.0000066867224,0.00005954589,2.5421238e-8,0.8543489,0.00037968444,0.021313008,0.121936254,0.0005300773],"about_ca_topic_score_codex":0.000043741435,"about_ca_topic_score_gemma":0.0000948793,"teacher_disagreement_score":0.8746417,"about_ca_system_score_codex":0.00018146174,"about_ca_system_score_gemma":0.0003031944,"threshold_uncertainty_score":0.9999489},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014499794,0.0009361721,0.9912331,0.000112788184,0.000048633323,0.00022260734,0.00000349723,0.000044024095,0.005949179],"genre_scores_gemma":[0.8562292,0.000093346825,0.13747352,0.0022656273,0.00038848512,0.000013831153,0.000040615967,0.0000700937,0.0034252806],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977955,0.00001607975,0.00033797632,0.0010727042,0.00040012033,0.00037760136],"domain_scores_gemma":[0.99846697,0.00002706819,0.00016760151,0.0010888324,0.00014943207,0.000100114376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031732637,0.0003965957,0.00034433661,0.00029047966,0.00008063113,0.000105937674,0.0009342927,0.00040159645,0.000025113968],"category_scores_gemma":[0.000007918829,0.00037740803,0.00019319584,0.00013930644,0.0004290767,0.000008182861,0.00031760026,0.00035167838,0.000018258223],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003874394,0.00017197215,0.0000451052,0.00015226702,0.00003637634,0.000075080316,0.00023450782,0.3634729,0.19693305,0.00018275582,0.0008438782,0.43781334],"study_design_scores_gemma":[0.00023784138,0.00015651972,0.0000022580778,0.00011038101,0.000036300768,0.00001813419,1.0724668e-7,0.38957688,0.6013427,0.003229516,0.0045920303,0.00069737324],"about_ca_topic_score_codex":0.0000029145697,"about_ca_topic_score_gemma":0.000049776438,"teacher_disagreement_score":0.8547792,"about_ca_system_score_codex":0.00008112671,"about_ca_system_score_gemma":0.00035487214,"threshold_uncertainty_score":0.9998678},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008019463,0.0019235983,0.99436885,0.00024147339,0.00038865686,0.00059894094,0.000010006743,0.0006164041,0.0010501115],"genre_scores_gemma":[0.14929381,0.000013228815,0.8485688,0.00067124935,0.0004462157,0.000024979072,0.00000963585,0.0000531995,0.0009188639],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996442,0.000028248283,0.0004277194,0.0015818944,0.0008554585,0.00066464266],"domain_scores_gemma":[0.9972528,0.0004604352,0.0004000851,0.001265835,0.00048375822,0.00013705037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089870987,0.0005599857,0.00047469075,0.00069206173,0.00034563377,0.0009939834,0.0025912581,0.00035957995,0.000011355042],"category_scores_gemma":[0.00019514596,0.00043548815,0.000112865535,0.0005153497,0.00090195984,0.00080236275,0.0008738941,0.0006774952,0.000007725547],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049706807,0.00002491064,0.00007958594,0.000106343745,0.000014249794,0.00013635047,0.003306253,0.000597522,0.0003517553,0.013314335,0.000011589672,0.9820074],"study_design_scores_gemma":[0.0012662231,0.0012727736,0.00034404863,0.003090214,0.000056634795,0.00061035884,0.0000020928917,0.08622865,0.09072008,0.80978847,0.0033278689,0.0032925734],"about_ca_topic_score_codex":0.00006202691,"about_ca_topic_score_gemma":0.00012411443,"teacher_disagreement_score":0.9787148,"about_ca_system_score_codex":0.00020187904,"about_ca_system_score_gemma":0.0003464062,"threshold_uncertainty_score":0.9998097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006563443,0.0002961154,0.99475545,0.00023880904,0.0006837413,0.0002601405,0.000009088162,0.00007655936,0.0030237446],"genre_scores_gemma":[0.5054192,0.00004595165,0.49350014,0.0004425648,0.00028142848,0.0000046343303,0.000013326626,0.000019905505,0.00027287327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711156,0.000029034398,0.0004821571,0.0010252981,0.00095241424,0.0003995462],"domain_scores_gemma":[0.9979667,0.00042923403,0.00034766222,0.0007505391,0.00037551209,0.00013034616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004650762,0.00038765112,0.00046899944,0.00091321784,0.00019487669,0.00016500814,0.0015970279,0.00017616639,0.000027068578],"category_scores_gemma":[0.000058601458,0.00033319957,0.000098151635,0.00074837514,0.001108082,0.0005689893,0.0004882443,0.0004052805,0.000014366551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013359767,0.000040504317,0.0000772337,0.000040240455,0.000025522495,0.00012844641,0.0013937813,0.3027556,0.00032162826,0.021092389,0.000107467065,0.67400384],"study_design_scores_gemma":[0.0008391633,0.00069417007,0.00064138905,0.0007934664,0.00001656259,0.0008814417,7.430977e-7,0.94291437,0.008146697,0.042070884,0.0018725106,0.001128582],"about_ca_topic_score_codex":0.0000065481318,"about_ca_topic_score_gemma":0.000045253357,"teacher_disagreement_score":0.6728752,"about_ca_system_score_codex":0.0001248397,"about_ca_system_score_gemma":0.00081335,"threshold_uncertainty_score":0.999912},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.808393e-7,0.00023084648,0.9963242,0.00003272683,0.00065979024,0.00064584607,0.000012055346,0.00016805566,0.0019262215],"genre_scores_gemma":[0.011719069,0.000044139753,0.98766553,0.00009650972,0.00020623342,0.00003973334,0.00004297868,0.00005125394,0.00013454145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988564,0.000007818534,0.00029779362,0.00034388583,0.00020164582,0.00029240426],"domain_scores_gemma":[0.9990852,0.00030995996,0.00013295072,0.00032460532,0.000104445666,0.00004285577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038290583,0.00027710205,0.0002072757,0.00022312568,0.00020047976,0.00011017039,0.00042058108,0.00015725297,0.000013635389],"category_scores_gemma":[0.000044165994,0.00021799628,0.000053988977,0.00010480363,0.00009922583,0.00023560708,0.00008904953,0.00032650694,0.0000032383832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032728387,0.000003108823,6.984408e-8,0.000081116596,0.0000031369304,3.851586e-7,0.00035036466,0.9391845,0.00000791653,0.0007653755,0.000011666377,0.05958913],"study_design_scores_gemma":[0.00011991991,0.00003677257,2.8458618e-7,0.000106403524,0.000017089513,0.000006397651,1.5669485e-7,0.9497194,0.0007614942,0.0487225,0.00026544934,0.000244102],"about_ca_topic_score_codex":0.00000428892,"about_ca_topic_score_gemma":0.000016070479,"teacher_disagreement_score":0.059345026,"about_ca_system_score_codex":0.0001463918,"about_ca_system_score_gemma":0.00004000097,"threshold_uncertainty_score":0.88896304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035587265,0.00048611016,0.9921808,0.0006314025,0.0033217059,0.00076495257,0.0000052530017,0.00024828516,0.0023258794],"genre_scores_gemma":[0.8216167,0.00001882522,0.17271256,0.0019344086,0.0018671855,0.000045261604,0.000026129284,0.00008938001,0.0016895076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958969,0.00003207275,0.0006313514,0.001617081,0.000890769,0.0009318211],"domain_scores_gemma":[0.9974672,0.00042342738,0.0003807377,0.0013110404,0.00024225544,0.00017529597],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009823871,0.0006000377,0.0006379545,0.0006320598,0.00038071885,0.0009176246,0.003187341,0.0003920902,0.0000063440125],"category_scores_gemma":[0.000035089397,0.0005190835,0.00024113596,0.00041781148,0.00040807706,0.00043124077,0.00085652625,0.0005777135,0.00005302592],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026065613,0.000042435062,0.00019469632,0.00021811934,0.000020214993,0.00013262295,0.000746954,0.010653896,0.000049494807,0.11540478,0.0002656193,0.87226856],"study_design_scores_gemma":[0.00048802135,0.00027508836,0.000112262176,0.00017511442,0.000020537429,0.00013330039,3.2694302e-7,0.37781674,0.00043045942,0.5944528,0.024886506,0.0012088395],"about_ca_topic_score_codex":0.00026862015,"about_ca_topic_score_gemma":0.00038049847,"teacher_disagreement_score":0.8710597,"about_ca_system_score_codex":0.0002560584,"about_ca_system_score_gemma":0.00038678574,"threshold_uncertainty_score":0.99972606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009569827,0.00025069836,0.99420494,0.00014390978,0.00404606,0.00034210534,0.0000056372314,0.0006693985,0.00024153023],"genre_scores_gemma":[0.023058178,0.000032887172,0.97548574,0.00055491086,0.00036536565,0.0000041773046,0.0000024043088,0.00005439771,0.00044194685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569637,0.000050025345,0.0006015294,0.0017270746,0.00092026254,0.001004746],"domain_scores_gemma":[0.9942206,0.0030854708,0.00027240743,0.0019039469,0.0002835404,0.00023401812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014095845,0.000711899,0.00067138043,0.0010582195,0.000232013,0.00050914026,0.0027542808,0.00049862993,0.000009152998],"category_scores_gemma":[0.00068476354,0.0006952322,0.00016090016,0.00065421447,0.0007537369,0.0010832599,0.0014342181,0.0012630852,0.000042840522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073895203,0.000018864805,0.0000049685523,0.00006770721,0.000016793341,0.0058876863,0.0010432558,0.38629916,0.0003124248,0.016506935,0.00001066921,0.58982414],"study_design_scores_gemma":[0.0010061014,0.0006215814,0.00007858502,0.0011140059,0.00004285907,0.0064181597,0.0000013254589,0.55306745,0.030313443,0.3991681,0.0039751064,0.004193311],"about_ca_topic_score_codex":0.000019160098,"about_ca_topic_score_gemma":0.00007281159,"teacher_disagreement_score":0.58563083,"about_ca_system_score_codex":0.0004107075,"about_ca_system_score_gemma":0.00031338382,"threshold_uncertainty_score":0.99954987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014133198,0.00052972545,0.99117535,0.00028198888,0.00086345075,0.0003139066,0.000008672826,0.00068417104,0.0061285854],"genre_scores_gemma":[0.015208079,0.000005281652,0.9828775,0.0010216822,0.00033078942,0.0000082839615,0.000009494595,0.000053328342,0.00048555082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563074,0.000028589535,0.00065274397,0.0017503513,0.0011454893,0.0007921098],"domain_scores_gemma":[0.99762964,0.00016245864,0.00021321984,0.0013798372,0.00044328487,0.00017158358],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00068508624,0.0006483132,0.00055727083,0.0009691417,0.0004893486,0.0025419563,0.003953918,0.00036112795,0.0000072595094],"category_scores_gemma":[0.000041912903,0.0006224618,0.00014751658,0.00090778334,0.0013428193,0.0024019799,0.0020865954,0.0008732799,0.000022591286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.804233e-7,0.000031223037,0.000005245489,0.000020011516,0.0000044104254,0.00009120717,0.0002276363,0.056959465,0.0001412098,0.0014882181,0.00007132862,0.9409593],"study_design_scores_gemma":[0.000096546755,0.000070528506,0.0000059749323,0.00046767047,0.0000075846,0.00017566024,1.2768096e-7,0.9040256,0.010076204,0.08365212,0.0007374257,0.0006845299],"about_ca_topic_score_codex":0.00012543525,"about_ca_topic_score_gemma":0.00007613131,"teacher_disagreement_score":0.9402747,"about_ca_system_score_codex":0.00049879187,"about_ca_system_score_gemma":0.00083681464,"threshold_uncertainty_score":0.99962264},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1628764,0.00034733198,0.8303385,0.002670447,0.0009798522,0.0025434906,0.000033880355,0.0000592088,0.00015093411],"genre_scores_gemma":[0.7589431,0.000038482594,0.23887843,0.0013213684,0.0006505689,0.000038945942,0.000033990487,0.000039020226,0.00005609837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764454,0.000057664027,0.00058926904,0.0006561616,0.000686066,0.00036627674],"domain_scores_gemma":[0.99770635,0.0008409067,0.0002829151,0.0005135096,0.00044960398,0.00020670496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000543651,0.00031031398,0.0005520102,0.00083072385,0.00008503968,0.000044139735,0.00025151516,0.00021206173,0.00007403206],"category_scores_gemma":[0.00020957246,0.0002515304,0.00019097631,0.00024795873,0.00021396924,0.00032195786,0.000058961243,0.00031934783,0.000009724158],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022957726,0.00012010712,0.0038925847,0.00013214488,0.000032058702,0.0000029359296,0.003406916,0.0072866706,0.019864129,0.0003908976,0.000009991008,0.964632],"study_design_scores_gemma":[0.027652433,0.061814044,0.23557958,0.0073595997,0.0006024619,0.0002571514,0.00030765103,0.38145718,0.21947601,0.03651661,0.023302047,0.00567525],"about_ca_topic_score_codex":0.00007982123,"about_ca_topic_score_gemma":0.000076089156,"teacher_disagreement_score":0.9589567,"about_ca_system_score_codex":0.00034740125,"about_ca_system_score_gemma":0.00044679063,"threshold_uncertainty_score":0.9999937},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05126651,0.0007372993,0.9410695,0.0007439713,0.0033617674,0.0008721962,0.0000023031819,0.00011801299,0.0018284817],"genre_scores_gemma":[0.9890946,0.000016149143,0.0078069707,0.00083202205,0.0005391913,0.00001872447,0.0000023270807,0.000021046906,0.0016689338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688786,0.000077248886,0.00049076555,0.0011087536,0.001027892,0.0004074761],"domain_scores_gemma":[0.9975187,0.00032791696,0.00032052255,0.0015120289,0.00023479109,0.00008602746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007217502,0.00038728255,0.00040826286,0.00038394606,0.00039793178,0.0006423224,0.0027542284,0.000165632,0.00006341969],"category_scores_gemma":[0.000032116433,0.00027011032,0.00012264907,0.00041043322,0.00029974905,0.00064672896,0.0016523239,0.00053277024,0.00006396451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016961329,0.00029567123,0.00037853676,0.00005121739,0.00010550392,0.00009402403,0.008733998,0.10991296,0.015188329,0.013862167,0.00081177586,0.85054886],"study_design_scores_gemma":[0.0007094652,0.0006747462,0.00033276452,0.00026530438,0.000034816014,0.000043886397,0.0000033358058,0.98633784,0.0017203634,0.008141516,0.0009193153,0.000816642],"about_ca_topic_score_codex":0.0002527905,"about_ca_topic_score_gemma":0.00036332678,"teacher_disagreement_score":0.9378281,"about_ca_system_score_codex":0.0002232268,"about_ca_system_score_gemma":0.00015201853,"threshold_uncertainty_score":0.9999751},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008260711,0.00008095447,0.9910838,0.0005517024,0.0005382907,0.0001258142,0.0000059037875,0.00007785247,0.007453093],"genre_scores_gemma":[0.7412418,0.0000054722327,0.2576858,0.0005903779,0.00015344516,0.0000022503448,0.000010578728,0.00002269425,0.0002875636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642885,0.00003702448,0.00055868266,0.0012717806,0.0011963228,0.00050734426],"domain_scores_gemma":[0.9972369,0.000701935,0.00039588194,0.001466065,0.00009567199,0.000103522245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009376959,0.00042604955,0.0005722745,0.0014077123,0.00020178924,0.00039481206,0.0025285028,0.00018599519,0.000018891482],"category_scores_gemma":[0.000060225328,0.0003799716,0.00017510321,0.00082986633,0.00046868357,0.00032773204,0.0006142022,0.00039661198,0.000014677296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010554348,0.00008449428,0.0003279346,0.00013716202,0.000038908816,0.00017565154,0.00063227786,0.6898197,0.00016150043,0.041669514,0.00032698768,0.26661533],"study_design_scores_gemma":[0.000245075,0.00019973546,0.00005320424,0.0010038458,0.000019965155,0.000008205256,5.1277397e-7,0.9636049,0.00078490464,0.03335608,0.00024545944,0.0004780771],"about_ca_topic_score_codex":0.00004837723,"about_ca_topic_score_gemma":0.00004620421,"teacher_disagreement_score":0.7411592,"about_ca_system_score_codex":0.00040996989,"about_ca_system_score_gemma":0.00038828206,"threshold_uncertainty_score":0.99986523},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059236307,0.00055703294,0.85622007,0.002960297,0.012306708,0.0006578803,0.000017475995,0.00010157164,0.1265866],"genre_scores_gemma":[0.9664893,0.000019670862,0.022873016,0.0006518598,0.003115867,0.000014801854,0.000012283642,0.00007579852,0.006747412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973199,0.00011737593,0.0004660581,0.00060948695,0.0008705737,0.0006166452],"domain_scores_gemma":[0.99775124,0.00097048917,0.0002686443,0.0004898332,0.00041113666,0.00010863517],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001495062,0.000252949,0.00047909294,0.00059952115,0.00029251093,0.000094504205,0.0008502087,0.00043708013,0.0009813159],"category_scores_gemma":[0.00015373593,0.00024110786,0.00013843527,0.00049322384,0.0012316605,0.00015125464,0.00037560693,0.0013893504,0.00030068948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021573814,0.0004532207,0.0020627698,0.00015005654,0.00013392167,0.000059156708,0.06519263,0.0065962705,0.00078694936,0.5123103,0.0031607312,0.40887824],"study_design_scores_gemma":[0.0028300213,0.0011365161,0.015286212,0.0012880696,0.00016920843,0.00022864205,0.00011429401,0.016943434,0.0024592017,0.93978316,0.016074,0.0036872728],"about_ca_topic_score_codex":0.00014563523,"about_ca_topic_score_gemma":0.00026834072,"teacher_disagreement_score":0.9658969,"about_ca_system_score_codex":0.00022861938,"about_ca_system_score_gemma":0.00025044527,"threshold_uncertainty_score":0.99993193},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045266913,0.001046825,0.9937312,0.00007932727,0.0025226632,0.0009016084,0.00017913058,0.00013166787,0.0009548921],"genre_scores_gemma":[0.15643711,0.00000846587,0.84266233,0.00020850415,0.000559093,0.0000047284075,0.000026036992,0.00004292318,0.00005076743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936716,0.000036871643,0.0011374285,0.002428692,0.0017286978,0.0009967277],"domain_scores_gemma":[0.9939219,0.0014501293,0.000848342,0.003191128,0.00042144026,0.00016708544],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0030632967,0.0006915694,0.00085342734,0.0011924652,0.0004213883,0.00053277053,0.009282521,0.00033692215,0.0000046164546],"category_scores_gemma":[0.00013067771,0.00061112514,0.00018560054,0.001285818,0.0005018037,0.00018783755,0.0047862353,0.00060800224,0.000005158996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023341101,0.000035949863,0.0000075729927,0.00031173386,0.000032986776,0.00005586797,0.00040069927,0.61645347,0.000011243757,0.002852333,0.00002669653,0.3797881],"study_design_scores_gemma":[0.00039196754,0.00010946603,0.00003551273,0.0050533977,0.000030334233,0.000113795824,9.2439865e-7,0.9602812,0.000045886667,0.029448206,0.003810622,0.0006786799],"about_ca_topic_score_codex":0.000022885433,"about_ca_topic_score_gemma":0.000030254876,"teacher_disagreement_score":0.3791094,"about_ca_system_score_codex":0.00023243476,"about_ca_system_score_gemma":0.00036547915,"threshold_uncertainty_score":0.999634},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000083702376,0.001130336,0.9934767,0.00023760577,0.0014802357,0.00031735224,0.0000021829776,0.00077774125,0.002494171],"genre_scores_gemma":[0.08450213,0.000099102544,0.9142515,0.00041688824,0.0003465251,0.000021084588,0.0000036048314,0.000056990866,0.00030216083],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966105,0.000017534694,0.0005003771,0.0015900277,0.0005773486,0.00070420123],"domain_scores_gemma":[0.997329,0.00063905487,0.00020417634,0.0015480518,0.00012983066,0.00014988614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001034953,0.00052922,0.0004966183,0.0011568385,0.00014026379,0.0005762635,0.0044862716,0.0003883865,0.000030846582],"category_scores_gemma":[0.00026289036,0.00052238925,0.000112995265,0.0009122611,0.00024956575,0.0010263472,0.0021991285,0.0012859997,0.00005743153],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038474286,0.00006169359,0.00057167816,0.000120866054,0.000008753208,0.00026961294,0.0014553384,0.07865042,0.000027638223,0.039210107,0.000025095818,0.8795949],"study_design_scores_gemma":[0.00049998576,0.00026735084,0.0006802545,0.0025461635,0.0000090091235,0.00017104895,1.7205674e-7,0.25332832,0.0013761589,0.73051405,0.008847387,0.0017600913],"about_ca_topic_score_codex":0.00009227952,"about_ca_topic_score_gemma":0.00012260725,"teacher_disagreement_score":0.87783486,"about_ca_system_score_codex":0.00074675685,"about_ca_system_score_gemma":0.00062709494,"threshold_uncertainty_score":0.9997228},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019926638,0.00028874585,0.99123514,0.00008855297,0.0004693179,0.00043281764,0.000005178057,0.000010584459,0.005477005],"genre_scores_gemma":[0.99495596,0.000017728842,0.004681199,0.00027140608,0.000045025667,0.000011518877,0.000005120918,0.0000045100933,0.0000075184407],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984492,0.0003973997,0.00049526605,0.00013577196,0.000351603,0.00017072582],"domain_scores_gemma":[0.99544615,0.0034778193,0.0005974662,0.00022383033,0.0002444836,0.0000102663935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057178545,0.00015466085,0.00022383024,0.00042508246,0.00017539827,0.00021776622,0.0006016346,0.00013872642,0.0000032626665],"category_scores_gemma":[0.0007014201,0.00008958692,0.000022634476,0.000337391,0.00077598315,0.00081895315,0.000119256154,0.000580183,0.0000014783781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007915468,0.000008055146,0.0005019998,0.000076854325,0.000017183123,9.006466e-7,0.077154785,0.044493686,0.0000065955114,0.34235469,0.0000020634425,0.53530407],"study_design_scores_gemma":[0.003710963,0.0017794826,0.089431375,0.009649386,0.00009904943,0.00017631555,0.0017979433,0.100436844,0.0008248956,0.7885122,0.0019852319,0.0015963714],"about_ca_topic_score_codex":0.000107762324,"about_ca_topic_score_gemma":0.000006204855,"teacher_disagreement_score":0.9929633,"about_ca_system_score_codex":0.000047166057,"about_ca_system_score_gemma":0.00013359963,"threshold_uncertainty_score":0.36532488},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000116635754,0.00016817328,0.99794847,0.0001682672,0.0004910239,0.0006778903,0.000030511093,0.0001860902,0.00021293714],"genre_scores_gemma":[0.0041815485,0.000019158813,0.99474305,0.00024291818,0.00061191875,0.000016469698,0.00004849406,0.000039561084,0.00009688276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99615735,0.000018348746,0.0005262699,0.0020426214,0.00059140514,0.00066403067],"domain_scores_gemma":[0.9977468,0.00039881532,0.00037608962,0.0010207256,0.00030354096,0.00015403306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017170071,0.000436268,0.00039184635,0.00092847063,0.00069882645,0.00088886614,0.002386792,0.00031452972,0.0000024576316],"category_scores_gemma":[0.000073673255,0.0004444369,0.000038592207,0.0010426552,0.00027442805,0.0013809007,0.0016725375,0.0005490329,0.000001944648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029772032,0.000017409939,0.00008876964,0.000040688778,0.000012743006,0.0000029127814,0.00028022518,0.0074050613,0.00024851426,0.0022193384,0.000022734697,0.98965865],"study_design_scores_gemma":[0.00021858753,0.00013310825,0.00006218752,0.0002823174,0.000016497923,0.00016062202,5.0874206e-7,0.98485744,0.0003320236,0.010518981,0.0029224665,0.0004952873],"about_ca_topic_score_codex":0.00008292932,"about_ca_topic_score_gemma":0.00019573624,"teacher_disagreement_score":0.98916334,"about_ca_system_score_codex":0.00025640687,"about_ca_system_score_gemma":0.0005405019,"threshold_uncertainty_score":0.99980074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009116018,0.000113889524,0.9947665,0.00071914867,0.0005418458,0.0011010697,0.0000996868,0.0004601702,0.002188616],"genre_scores_gemma":[0.096449636,0.000060232407,0.9011416,0.0014556631,0.00051053683,0.000069682304,0.000049683535,0.000044178378,0.0002187722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600166,0.000020972191,0.0006329744,0.0017818586,0.0008634334,0.0006991283],"domain_scores_gemma":[0.9945609,0.0024219695,0.00039539777,0.0019006444,0.0005652913,0.00015579766],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008339095,0.0005673156,0.00055187877,0.0008234441,0.00032088882,0.0010893275,0.0036486764,0.00037125996,0.000011671884],"category_scores_gemma":[0.00035520643,0.00052318437,0.00014458301,0.0005254352,0.0006876861,0.0015225247,0.0010032556,0.00054160366,0.000038969556],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007240351,0.000031858544,0.000011508716,0.000012709123,0.000004563434,0.00001405687,0.00021313166,0.0040389765,0.00061812974,0.07600817,0.0003230508,0.9187166],"study_design_scores_gemma":[0.0003426129,0.00030361334,0.00028172147,0.00027326302,0.00000793338,0.000045484914,7.092405e-7,0.48508096,0.0098471055,0.4739092,0.029061696,0.0008456893],"about_ca_topic_score_codex":0.000014407163,"about_ca_topic_score_gemma":0.0002773586,"teacher_disagreement_score":0.91787094,"about_ca_system_score_codex":0.00043640262,"about_ca_system_score_gemma":0.0008623176,"threshold_uncertainty_score":0.99994767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002214806,0.00019396901,0.9953751,0.00034034607,0.001539086,0.00025180524,0.000018617939,0.000096429045,0.0019631537],"genre_scores_gemma":[0.119982585,0.000054652715,0.8790746,0.00024248274,0.00019162823,0.000005426302,0.000018243694,0.000027100128,0.00040332339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968873,0.000019410207,0.000531763,0.0012460947,0.00089615356,0.00041926609],"domain_scores_gemma":[0.9967703,0.0003806867,0.00038522598,0.002055694,0.00026794017,0.00014012463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052957534,0.0003561163,0.00044083793,0.000719594,0.00021181331,0.00025740138,0.0037106676,0.0002979095,0.00003884776],"category_scores_gemma":[0.000085842155,0.00031352628,0.00011934276,0.0005147524,0.0006125438,0.0007262826,0.0021521675,0.0009015543,0.000020991087],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042178403,0.000042714844,0.000065300126,0.000039008515,0.000010191221,0.00005392762,0.00045411036,0.0033516432,0.0029134252,0.020796265,0.000018693692,0.9722505],"study_design_scores_gemma":[0.000365405,0.00016535909,0.0012626172,0.00042634562,0.000011205809,0.00008809092,1.8766674e-7,0.7535131,0.0066977874,0.23470448,0.0020407245,0.0007246982],"about_ca_topic_score_codex":0.000074209165,"about_ca_topic_score_gemma":0.00010677212,"teacher_disagreement_score":0.9715258,"about_ca_system_score_codex":0.00009749607,"about_ca_system_score_gemma":0.00043379233,"threshold_uncertainty_score":0.9999317},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015584126,0.0023489438,0.99267864,0.00042552743,0.0017960162,0.0005129829,0.00003377277,0.00024897288,0.0017992816],"genre_scores_gemma":[0.28898284,0.00019843793,0.7086861,0.0013160775,0.00061675574,0.000021317244,0.000028003187,0.000064155814,0.00008631301],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956448,0.00003631385,0.0004185083,0.0017511236,0.0011562675,0.0009929717],"domain_scores_gemma":[0.9966235,0.00022825904,0.00035235408,0.002304624,0.0002027271,0.00028851387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075960666,0.00068712333,0.0005718669,0.0006700889,0.00031699432,0.0005520156,0.004156682,0.00036032117,0.000024981542],"category_scores_gemma":[0.000026635287,0.000554599,0.00014060386,0.0009821154,0.00097322965,0.0013739046,0.0014095149,0.0012359029,0.00004855489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002909949,0.00012706137,0.00014805805,0.00015130077,0.000033442957,0.00024066628,0.0023972176,0.0051442506,0.00009213749,0.3570938,0.0000949765,0.634448],"study_design_scores_gemma":[0.0011376953,0.0008950859,0.00092619174,0.0015608657,0.000047412945,0.00060132175,7.2767835e-7,0.38493648,0.0006028919,0.56724805,0.038592346,0.0034509478],"about_ca_topic_score_codex":0.00001728182,"about_ca_topic_score_gemma":0.0001759086,"teacher_disagreement_score":0.630997,"about_ca_system_score_codex":0.00023474407,"about_ca_system_score_gemma":0.00050360133,"threshold_uncertainty_score":0.99969053},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006093804,0.00019388218,0.991504,0.000062620325,0.00057757477,0.00034365183,0.000007721006,0.000072404015,0.0011443048],"genre_scores_gemma":[0.98977333,0.000004070551,0.009114615,0.00008446153,0.00025323845,0.000027207147,0.000017393379,0.000025579311,0.00070010865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981681,0.000099860335,0.0004228963,0.0007266814,0.00031576378,0.00026671143],"domain_scores_gemma":[0.99821174,0.00048450445,0.00051691616,0.00036958384,0.0003617787,0.0000554909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000800011,0.00024598505,0.000356438,0.00036568823,0.00017470785,0.00009032816,0.0005930636,0.00022405371,0.00006631556],"category_scores_gemma":[0.00016825121,0.00022083272,0.00008851838,0.00012925129,0.00057644787,0.000093207,0.00006235587,0.00038329186,0.000024017509],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021803826,0.000030177305,0.0006538566,0.000059937196,0.000021700316,0.0000019008119,0.0022728273,0.0041665104,0.00018807831,0.052387897,0.0000033313963,0.940192],"study_design_scores_gemma":[0.0008645234,0.003393914,0.040875275,0.0020809572,0.000112670656,0.000024003599,0.00004178041,0.7575063,0.0012312396,0.19228005,0.00041690934,0.0011723399],"about_ca_topic_score_codex":0.000027766118,"about_ca_topic_score_gemma":0.0000362309,"teacher_disagreement_score":0.98367953,"about_ca_system_score_codex":0.000057034737,"about_ca_system_score_gemma":0.00010200149,"threshold_uncertainty_score":0.9005297},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20195319,0.0003395843,0.7914919,0.0013550404,0.003305882,0.0014050758,0.000010622884,0.000053423882,0.00008525432],"genre_scores_gemma":[0.87865293,0.0000059588283,0.118667744,0.0019317316,0.00065054535,0.000022689752,0.000013751022,0.000041159914,0.00001350665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968766,0.000048589685,0.0009138693,0.0008963246,0.00081541983,0.00044918846],"domain_scores_gemma":[0.99632037,0.0014797851,0.00031056567,0.0009198819,0.0007574323,0.00021198062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005124983,0.00034216858,0.00034559224,0.0006794333,0.00037563185,0.00010090335,0.00046172674,0.00030987753,0.0000804193],"category_scores_gemma":[0.00073068,0.00026597705,0.000068491056,0.0005398783,0.00017679142,0.00024340468,0.0002040559,0.00087861676,0.00001240716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104599305,0.00003313961,0.003358707,0.000013771658,0.0000021930825,0.000011133199,0.007220898,0.20353252,0.000098802026,0.000020830745,0.0000015489212,0.78560185],"study_design_scores_gemma":[0.0002725874,0.00069108844,0.010540913,0.0016642653,0.000009002889,0.000013013587,0.00002328705,0.9721373,0.00013567683,0.013946853,0.00016167306,0.00040437584],"about_ca_topic_score_codex":0.0000392287,"about_ca_topic_score_gemma":0.0015332364,"teacher_disagreement_score":0.7851975,"about_ca_system_score_codex":0.00057518814,"about_ca_system_score_gemma":0.00063117937,"threshold_uncertainty_score":0.99997926},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013972358,0.00005203744,0.9723123,0.0009497756,0.0006238966,0.0006888455,0.0000042380525,0.00059210684,0.024637124],"genre_scores_gemma":[0.06649829,0.000032726653,0.9270382,0.0046249805,0.0004769535,0.00007623034,0.0000054972093,0.00008338292,0.0011637757],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99509925,0.000056493267,0.00077705126,0.0018271314,0.0013570988,0.0008829649],"domain_scores_gemma":[0.9963132,0.00089205726,0.00034168828,0.0018359723,0.00031235692,0.00030471344],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010058775,0.00073121017,0.000785982,0.0012165518,0.0002648038,0.0011217787,0.003964803,0.0005069374,0.0002856409],"category_scores_gemma":[0.00022439736,0.0006389561,0.00020396363,0.00046948198,0.00066214206,0.00083718984,0.0014270736,0.00113446,0.0015194924],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001998321,0.000043223834,0.000007691434,0.000047699683,0.000009959711,0.00012317103,0.000349655,0.00008774545,0.00015435327,0.040407706,0.00012779552,0.958639],"study_design_scores_gemma":[0.0002921684,0.00044590826,0.000048468733,0.0018530275,0.000009784492,0.00023627002,1.8468162e-7,0.16627282,0.013056275,0.81588894,0.0008118892,0.0010842915],"about_ca_topic_score_codex":0.0000037503555,"about_ca_topic_score_gemma":0.000004522229,"teacher_disagreement_score":0.9575547,"about_ca_system_score_codex":0.00029812168,"about_ca_system_score_gemma":0.00031273277,"threshold_uncertainty_score":0.9999151},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042277676,0.0010760364,0.98340845,0.003764782,0.0016598882,0.00042175726,0.000001805287,0.00015755289,0.009467435],"genre_scores_gemma":[0.08028948,0.00021021372,0.90684605,0.0049410863,0.0021663404,0.000023746054,0.000017502256,0.000047379377,0.0054582227],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962906,0.000050802148,0.00053988205,0.0012585999,0.0012050533,0.000655047],"domain_scores_gemma":[0.9974565,0.0005971297,0.0002838886,0.0011824577,0.00032334487,0.0001566997],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012396248,0.0004552108,0.00033339148,0.00055129104,0.00075647235,0.0011500969,0.0032641452,0.00018460776,0.000009986068],"category_scores_gemma":[0.00005702237,0.00034008638,0.00014231642,0.00074426224,0.00039769593,0.00056789146,0.0007881329,0.0006966017,0.00008753804],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033662252,0.000012362047,0.0000027197457,0.0000051481647,0.0000053312774,0.000018683197,0.00016159512,0.055447765,0.00007681705,0.09466545,0.00006114863,0.84953964],"study_design_scores_gemma":[0.00024231637,0.00018412624,0.0000872837,0.000111651556,0.000005717615,0.00009197325,6.91605e-8,0.4059976,0.0011172554,0.56918895,0.022466576,0.0005064979],"about_ca_topic_score_codex":0.000012052241,"about_ca_topic_score_gemma":0.00008976457,"teacher_disagreement_score":0.8490331,"about_ca_system_score_codex":0.00025675696,"about_ca_system_score_gemma":0.0006795415,"threshold_uncertainty_score":0.9999051},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002695229,0.00016643055,0.9951374,0.003017242,0.00046010702,0.00042950394,0.000014380953,0.000099613884,0.0004058321],"genre_scores_gemma":[0.12790327,0.00000936364,0.86968094,0.000869719,0.0007968767,0.000018685338,0.00020498033,0.000028968218,0.00048719568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963873,0.00011381441,0.0004837422,0.001645391,0.0009758597,0.00039388082],"domain_scores_gemma":[0.9947912,0.00046615087,0.00050174334,0.0038555935,0.0002859456,0.00009934274],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0020166642,0.00031031657,0.00030643216,0.00039559617,0.0004049556,0.00071524427,0.00627789,0.00013652892,0.000002779395],"category_scores_gemma":[0.0005456816,0.00021264979,0.00003158504,0.0012395583,0.00040648135,0.0008311318,0.0017702363,0.00065975095,0.00001130403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047385747,0.00002550329,0.00025372615,0.000058871665,0.000007292982,0.000004550896,0.0012999605,0.10239333,0.0030709072,0.0048292065,0.00015149289,0.8879004],"study_design_scores_gemma":[0.00016039347,0.00016785336,0.0046648444,0.00027117695,0.000011190784,0.00003321721,9.65747e-7,0.98720336,0.00063840445,0.0015123874,0.0049836193,0.000352584],"about_ca_topic_score_codex":0.00013818144,"about_ca_topic_score_gemma":0.0002622593,"teacher_disagreement_score":0.88754785,"about_ca_system_score_codex":0.00038400156,"about_ca_system_score_gemma":0.00304898,"threshold_uncertainty_score":0.9990986},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016266093,0.00009453737,0.9966219,0.00095255155,0.00063191465,0.0012456428,0.000018020699,0.00022203852,0.00019711065],"genre_scores_gemma":[0.0013237661,0.0000033271685,0.9959627,0.0019535348,0.00034028,0.000027880464,0.000008434013,0.00004289663,0.00033722213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962481,0.000026896198,0.00043979738,0.0017143633,0.00086050667,0.0007103155],"domain_scores_gemma":[0.99729383,0.00043655562,0.00027089074,0.00129975,0.00034416624,0.00035482485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075839274,0.0005654534,0.00051923835,0.0009296633,0.00033594752,0.0006433914,0.0028808631,0.0002198475,0.000009901286],"category_scores_gemma":[0.000030329615,0.0004812455,0.0001752248,0.0010600945,0.0003184125,0.00054454914,0.0003828879,0.00050351926,0.000030091365],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025666159,0.000029332796,0.0000019330098,0.00002707504,0.000013788291,0.00002967777,0.00042143403,0.0068155294,0.0009723866,0.021201337,0.000014068158,0.9704478],"study_design_scores_gemma":[0.0011133512,0.00080997474,0.000019775338,0.0004567246,0.000021581598,0.00006492327,5.3994876e-7,0.5856315,0.014627278,0.3953218,0.0007813873,0.0011511649],"about_ca_topic_score_codex":0.00002386526,"about_ca_topic_score_gemma":0.000015381796,"teacher_disagreement_score":0.96929663,"about_ca_system_score_codex":0.00015064084,"about_ca_system_score_gemma":0.00032824487,"threshold_uncertainty_score":0.9997639},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006042324,0.0035785008,0.9919531,0.00033524266,0.0010148248,0.0007174187,0.00000484201,0.00057710166,0.001812929],"genre_scores_gemma":[0.028882848,0.000026842728,0.9677709,0.0025714566,0.0004151628,0.000020779426,0.0000043144787,0.00004227701,0.00026542126],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957543,0.000019016643,0.0006033346,0.0016957289,0.0010928514,0.0008347815],"domain_scores_gemma":[0.99706215,0.00068194675,0.0003264703,0.0012781923,0.00046768575,0.00018357244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001457266,0.0005523807,0.0005683082,0.00077515986,0.00025544545,0.0006949488,0.0051291063,0.00045293264,0.000005909987],"category_scores_gemma":[0.00010216089,0.0004873009,0.00017194432,0.00046957232,0.0006380383,0.00087509974,0.0017271598,0.0008270553,0.0000074158693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056322715,0.000023186678,0.0000030335395,0.000047211248,0.0000089270225,0.000056496006,0.0011823023,0.0063052545,0.00012465318,0.38133937,0.000031475796,0.61087245],"study_design_scores_gemma":[0.0001726851,0.0001293096,0.0000012481175,0.000331591,0.000005737928,0.000030398738,1.7720681e-7,0.34805146,0.0027009104,0.6473379,0.00071390765,0.0005246394],"about_ca_topic_score_codex":0.000011171448,"about_ca_topic_score_gemma":0.000032449418,"teacher_disagreement_score":0.6103478,"about_ca_system_score_codex":0.0004288348,"about_ca_system_score_gemma":0.00040638473,"threshold_uncertainty_score":0.9997579},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007898387,0.0001901512,0.99571216,0.0006655801,0.0011541259,0.00077526143,0.000003450812,0.000097180564,0.00061224744],"genre_scores_gemma":[0.46393076,0.000011404899,0.533653,0.0016958687,0.00053801195,0.0000279554,0.000009202432,0.000035647787,0.000098167526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733406,0.000029380179,0.000546449,0.0008817227,0.00073200563,0.0004763948],"domain_scores_gemma":[0.99693584,0.0016863586,0.0004164605,0.0006147913,0.00026011735,0.000086409236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011415117,0.00036635323,0.00040008812,0.00064221735,0.0002560384,0.00025843017,0.0018938878,0.00017408228,0.0000027009964],"category_scores_gemma":[0.00011798531,0.0002683669,0.000166006,0.0006195104,0.00047729525,0.00023060973,0.00044980657,0.00035466804,0.000008307778],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007463144,0.000022984053,0.0000025658796,0.000028922253,0.000008207154,0.0000035169817,0.00038983198,0.038933706,0.0000874885,0.117557,0.000013577336,0.84294474],"study_design_scores_gemma":[0.00019174599,0.00033392626,0.000069021415,0.00023892395,0.000006749232,0.000011619206,2.0541123e-7,0.6164479,0.0020807642,0.37973738,0.0005673319,0.0003143973],"about_ca_topic_score_codex":0.000013750054,"about_ca_topic_score_gemma":0.000023975013,"teacher_disagreement_score":0.8426303,"about_ca_system_score_codex":0.000157062,"about_ca_system_score_gemma":0.00030226554,"threshold_uncertainty_score":0.9999769},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010576743,0.0005598714,0.988049,0.0010762634,0.0012287421,0.0004970964,0.00003217834,0.000078558216,0.007420647],"genre_scores_gemma":[0.8787549,0.00000998585,0.11961543,0.0010070819,0.00026193805,0.000012925209,0.0000048397346,0.00003187039,0.000301017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963578,0.000041809904,0.000551502,0.0011945668,0.0012582137,0.00059609575],"domain_scores_gemma":[0.9963416,0.00053649215,0.000590479,0.0018733528,0.00053502625,0.00012304532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011526408,0.00047976113,0.0005733015,0.00026463834,0.0003169433,0.0004925695,0.0035380714,0.00020245062,0.000017802407],"category_scores_gemma":[0.000044762637,0.00030388846,0.0001054008,0.00063529034,0.001727669,0.00030606662,0.00073688914,0.00095354544,0.000008769884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094171555,0.00029943718,0.0012707857,0.00040139956,0.00020411995,0.00046462344,0.012357386,0.063850276,0.010107207,0.39108917,0.00027404484,0.5195874],"study_design_scores_gemma":[0.0070097093,0.0033308452,0.0019086604,0.0063597728,0.00013086802,0.0014663069,0.00001601242,0.51884615,0.024561998,0.18770473,0.24137118,0.0072937417],"about_ca_topic_score_codex":0.00009904461,"about_ca_topic_score_gemma":0.0005015472,"teacher_disagreement_score":0.8776972,"about_ca_system_score_codex":0.00009369812,"about_ca_system_score_gemma":0.00059962634,"threshold_uncertainty_score":0.99994135},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014886357,0.000024820685,0.9791826,0.0052768923,0.00006402623,0.00042476025,0.0000014706415,0.00011767157,0.00002142471],"genre_scores_gemma":[0.5097185,0.000009011204,0.4890883,0.0010497192,0.00010337049,0.000019615592,0.0000037341752,0.0000044106946,0.0000034000548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999141,0.000006949159,0.00013748455,0.000356429,0.0001640283,0.00019410411],"domain_scores_gemma":[0.9993332,0.00013215079,0.00004650912,0.00032861574,0.000106445405,0.000053089192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015234311,0.0000851533,0.0001051755,0.00012723885,0.00011989042,0.000032695578,0.00019180807,0.000036465437,0.0000039020324],"category_scores_gemma":[0.00015070285,0.00007176193,0.00002282035,0.0005893746,0.00015161856,0.00014479591,0.00009228085,0.00011650975,0.0000023796813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015572208,0.0000946519,0.0059899734,0.000020347725,8.9281787e-7,0.0000014500482,0.00025861285,0.024959883,0.028300442,0.0015017246,0.000030615345,0.93882585],"study_design_scores_gemma":[0.0003084308,0.00010785145,0.0048757386,0.00006664165,0.0000041618805,0.000017248287,1.34391e-7,0.9297436,0.04437613,0.018053314,0.002343217,0.00010354861],"about_ca_topic_score_codex":0.0000028808993,"about_ca_topic_score_gemma":0.0000050653357,"teacher_disagreement_score":0.9387223,"about_ca_system_score_codex":0.00006684451,"about_ca_system_score_gemma":0.00006732312,"threshold_uncertainty_score":0.2926367},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046148605,0.0019000544,0.9948286,0.00006838631,0.0012337671,0.000821364,0.000004865909,0.00030943492,0.00078736927],"genre_scores_gemma":[0.08387413,0.00007580165,0.91463035,0.00012896057,0.00084493763,0.000047320314,0.000008280264,0.00010767127,0.00028256446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769765,0.000013263417,0.0005330217,0.00062740437,0.00056669035,0.00056196004],"domain_scores_gemma":[0.9987278,0.00041823517,0.000075031996,0.00045925644,0.0001846167,0.00013504468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009184643,0.00039645348,0.00053495495,0.00062277773,0.0001752724,0.00028942846,0.0007366367,0.00029740582,0.000019628704],"category_scores_gemma":[0.000059276605,0.00037016306,0.000115262126,0.000306271,0.00023469931,0.00018757573,0.00012908816,0.00059897057,0.000029218769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011376832,0.0000035214148,0.0000028898241,0.0026647658,0.000013578438,0.000003960397,0.00027484813,0.9408791,0.000021362544,0.00075231417,8.9584285e-7,0.055381604],"study_design_scores_gemma":[0.00018279564,0.00003376437,0.000001228554,0.005096717,0.000017051418,0.000030099472,0.0000011137694,0.9924737,0.00037617542,0.0013503178,0.000023780867,0.00041322503],"about_ca_topic_score_codex":0.0000017982368,"about_ca_topic_score_gemma":0.000010137724,"teacher_disagreement_score":0.08382798,"about_ca_system_score_codex":0.00038542468,"about_ca_system_score_gemma":0.00012749304,"threshold_uncertainty_score":0.999875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4265673,0.000039843206,0.57307494,0.00004720979,0.0001355475,0.00011525841,9.888669e-7,0.000003859608,0.0000150337955],"genre_scores_gemma":[0.9105352,0.000002370155,0.089200504,0.00016084537,0.000075221076,0.000012808401,0.0000059581566,0.0000038614194,0.0000032324886],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994047,0.000017654032,0.00014737288,0.00019590033,0.000077553195,0.00015677602],"domain_scores_gemma":[0.99959934,0.000051262625,0.0000715572,0.00019303593,0.000060516628,0.000024272267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021024451,0.00007502823,0.00009957666,0.00006657658,0.00004868348,0.000048014743,0.00017285593,0.000064042964,6.9198245e-7],"category_scores_gemma":[0.000106089065,0.00006100272,0.00002232872,0.00011693053,0.00021021525,0.000014763772,0.00013954868,0.000057303012,9.1221847e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087778506,0.00006192962,0.036184713,0.00058462645,0.000028988246,0.0000017582274,0.0007702818,0.04997209,0.6150695,0.00074194936,0.00012237036,0.29637396],"study_design_scores_gemma":[0.0012256424,0.0020493441,0.059466884,0.00013651571,0.00001760337,0.00013801575,0.000015499581,0.65876466,0.27411005,0.003066455,0.0005452134,0.00046411925],"about_ca_topic_score_codex":0.000035871723,"about_ca_topic_score_gemma":0.000019922278,"teacher_disagreement_score":0.60879254,"about_ca_system_score_codex":0.000011128509,"about_ca_system_score_gemma":0.000043120817,"threshold_uncertainty_score":0.24876188},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020332018,0.0021674063,0.97467256,0.00002966211,0.0004968404,0.00029862596,0.000010848581,0.0000087631315,0.0019833],"genre_scores_gemma":[0.931106,0.00023568457,0.06736698,0.00008345104,0.0005596502,0.0000038830294,0.000032123855,0.00002883285,0.00058344495],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983966,0.000013308397,0.00032309964,0.00060429994,0.00034719627,0.0003154961],"domain_scores_gemma":[0.9992016,0.00003933088,0.00015142707,0.00043289727,0.00012564707,0.000049111695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044076346,0.0002376208,0.0002590324,0.00040190955,0.00004139409,0.000022376815,0.00051500293,0.00028196647,0.000019927136],"category_scores_gemma":[0.000056035136,0.00023076126,0.00007768679,0.0001912493,0.00046171664,0.000005798411,0.00026637243,0.00019286647,0.00000549661],"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.000090488895,0.00010468779,0.019585919,0.00012759259,0.000042942203,0.000038420527,0.0003471523,0.047177065,0.631661,0.0006352712,0.00002405495,0.3001654],"study_design_scores_gemma":[0.0043936144,0.0020218685,0.058063805,0.0011025368,0.000060181872,0.000106089334,0.000008470718,0.077682346,0.776188,0.031762026,0.045135263,0.0034757748],"about_ca_topic_score_codex":0.000030160443,"about_ca_topic_score_gemma":0.00056120695,"teacher_disagreement_score":0.91077393,"about_ca_system_score_codex":0.00013478765,"about_ca_system_score_gemma":0.00018753417,"threshold_uncertainty_score":0.9410171},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.346464,0.00019531064,0.6528144,0.00037405244,0.000019204923,0.00011727787,3.0672115e-7,0.00001101974,0.0000044420312],"genre_scores_gemma":[0.60382205,0.000067172,0.39580286,0.00026807596,0.0000339359,0.0000032503012,2.9377543e-7,0.000002190795,1.5378559e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994139,0.000007939095,0.000099699726,0.00020332544,0.0001202929,0.00015486455],"domain_scores_gemma":[0.9996203,0.000057466445,0.000029495732,0.00020734823,0.000052293697,0.00003305864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008475602,0.000061416395,0.00012478036,0.0000530213,0.00011126308,0.0000034032487,0.00009945429,0.000020704912,5.012128e-7],"category_scores_gemma":[0.000017421953,0.000039121194,0.000021940195,0.00029213092,0.000499512,0.00004096562,0.00011757329,0.00011762708,1.0233766e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010641994,0.000033444165,0.0007411603,0.0000057894167,0.0000010078578,0.0000026422565,0.0002539558,0.13714188,0.7604828,0.00050714443,0.0000027373287,0.100816794],"study_design_scores_gemma":[0.00007842438,0.00005117877,0.0026886913,0.000018115015,0.0000052319024,0.000059669343,5.8186714e-7,0.9011398,0.09199434,0.0039187386,0.000005145765,0.00004006371],"about_ca_topic_score_codex":0.000011164138,"about_ca_topic_score_gemma":4.3151022e-7,"teacher_disagreement_score":0.7639979,"about_ca_system_score_codex":0.000039850314,"about_ca_system_score_gemma":0.00008103692,"threshold_uncertainty_score":0.18404728},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002106884,0.00050873077,0.98654723,0.00029151537,0.0021325184,0.00031265203,0.0000062295458,0.00020472256,0.009785692],"genre_scores_gemma":[0.37181023,0.00008820425,0.6234388,0.0021945967,0.00094903563,0.000016446307,0.000027043934,0.000054109874,0.0014216008],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961592,0.00003918352,0.0005358429,0.0015905013,0.0010527422,0.00062251015],"domain_scores_gemma":[0.99762267,0.00027671998,0.00029884765,0.0012462863,0.00033555686,0.00021994756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007634351,0.00055928575,0.00049618486,0.0013087585,0.00031641906,0.00046642858,0.0029735717,0.00031433106,0.00004688592],"category_scores_gemma":[0.000060585877,0.0005206837,0.00016285914,0.0008497815,0.0005054362,0.0007639456,0.00065798924,0.00065357756,0.00013369873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012986703,0.000054811066,0.00020490131,0.000047362817,0.000023025423,0.000091351794,0.0007967381,0.015933461,0.00027754274,0.14137115,0.00007589511,0.84111077],"study_design_scores_gemma":[0.000443704,0.00024106137,0.0012960819,0.00041328114,0.00001533635,0.00016154465,1.1074864e-7,0.25627074,0.0030224745,0.734442,0.0024440663,0.0012495957],"about_ca_topic_score_codex":0.00003067563,"about_ca_topic_score_gemma":0.00009046465,"teacher_disagreement_score":0.83986115,"about_ca_system_score_codex":0.00016036876,"about_ca_system_score_gemma":0.000606161,"threshold_uncertainty_score":0.99972445},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000077413875,0.000314479,0.98151153,0.00035193973,0.0013935528,0.0002583258,0.000002785025,0.00012906261,0.015960896],"genre_scores_gemma":[0.7071864,0.000047380934,0.29112893,0.00049320806,0.00029821415,0.000005159948,0.000011584552,0.000033642253,0.00079549354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706924,0.00005665143,0.00058566843,0.0010784462,0.000755298,0.00045467776],"domain_scores_gemma":[0.99787307,0.00029926535,0.0004370945,0.00089813373,0.00034886177,0.00014356765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086253317,0.0003735383,0.00046273947,0.00085570524,0.0001861352,0.0003007012,0.0020928711,0.00027516801,0.00007363091],"category_scores_gemma":[0.0001283914,0.00037176162,0.0001379354,0.0006394796,0.0007690123,0.0005472432,0.0007730187,0.0006611075,0.00010281375],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008869087,0.00004852032,0.000017964085,0.00006688912,0.000016115035,0.000035886253,0.0032982754,0.07899151,0.001423486,0.24378398,0.000011648491,0.6722969],"study_design_scores_gemma":[0.0012873666,0.00039240957,0.00017944648,0.00094705244,0.000020584153,0.00008751724,0.0000012445073,0.5634543,0.007586054,0.41713125,0.0077138543,0.0011989663],"about_ca_topic_score_codex":0.000020298017,"about_ca_topic_score_gemma":0.000032005813,"teacher_disagreement_score":0.707109,"about_ca_system_score_codex":0.0003019091,"about_ca_system_score_gemma":0.0012595431,"threshold_uncertainty_score":0.99987346},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030363937,0.00017589328,0.99059284,0.00029463688,0.0014068088,0.0005205919,0.0000059966446,0.00011167966,0.0068612196],"genre_scores_gemma":[0.7177403,0.000028744846,0.2565452,0.002384845,0.0028972772,0.000025198815,0.000051435774,0.00018456184,0.020142449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9864222,0.000095405834,0.001332682,0.0022264149,0.008619256,0.0013040553],"domain_scores_gemma":[0.99280536,0.0030699703,0.0006962092,0.0014854375,0.0015954296,0.00034760492],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008893516,0.0006129182,0.0007510446,0.0019227169,0.00061899325,0.0012062483,0.0038769569,0.00045010578,0.00109439],"category_scores_gemma":[0.0043698004,0.0005005265,0.00026340084,0.0015301034,0.0014370228,0.0006003957,0.0015259035,0.0020518566,0.0005287231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027007794,0.000008202525,0.00004656745,0.0000058820365,0.0000045886527,0.00012582663,0.00020303355,0.67945164,0.00003641733,0.00013471452,0.000025178886,0.31993094],"study_design_scores_gemma":[0.00054379494,0.00026742992,0.000065113745,0.00024550426,0.000005514471,0.000022585687,9.0554494e-7,0.9532664,0.0016814752,0.031395502,0.011866118,0.0006396563],"about_ca_topic_score_codex":0.000050953633,"about_ca_topic_score_gemma":0.00018095,"teacher_disagreement_score":0.73404765,"about_ca_system_score_codex":0.0014640396,"about_ca_system_score_gemma":0.0020486934,"threshold_uncertainty_score":0.9998306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006744324,0.019160122,0.97262496,0.0003374342,0.0033425016,0.0021266257,0.0000029209184,0.00035531644,0.0019826635],"genre_scores_gemma":[0.14001204,0.008139718,0.8416787,0.0042091636,0.003919031,0.00046404175,0.000027782466,0.00024743218,0.0013021376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915491,0.0002618567,0.001651682,0.0031013605,0.0015758098,0.0018602414],"domain_scores_gemma":[0.9935966,0.0024311482,0.00079343753,0.002561185,0.00025285114,0.0003647496],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004471061,0.001183624,0.002063159,0.0011272067,0.00032498335,0.0010362761,0.0062836227,0.00092462037,0.00006033088],"category_scores_gemma":[0.00016042068,0.0010875145,0.00045653278,0.0015570775,0.0012660733,0.0010833048,0.0029125423,0.0026532765,0.00007145688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014568664,0.000026250438,0.0000063134235,0.000008959095,0.000011821762,0.00009888417,0.00041425248,0.42736116,0.0000018494392,0.001819828,0.000023514107,0.5700815],"study_design_scores_gemma":[0.015078699,0.0001269092,0.000015776897,0.00069609005,0.000014839875,0.00008843272,3.9336038e-7,0.96530783,0.000037692134,0.013289038,0.0042238003,0.0011204812],"about_ca_topic_score_codex":0.000019526555,"about_ca_topic_score_gemma":0.00023100624,"teacher_disagreement_score":0.568961,"about_ca_system_score_codex":0.0008152043,"about_ca_system_score_gemma":0.0006222296,"threshold_uncertainty_score":0.9996476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038342338,0.0006380942,0.99548423,0.0008189137,0.0014172484,0.00069129077,0.000008224659,0.000094760995,0.00046380353],"genre_scores_gemma":[0.46407372,0.000020142192,0.53436047,0.0009051048,0.00045207178,0.000021561005,0.0000130059,0.000025600395,0.00012833827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970196,0.000024931305,0.0006224792,0.0011006654,0.0007966571,0.00043567826],"domain_scores_gemma":[0.9978531,0.00050271046,0.0003970721,0.00055265334,0.0005799956,0.00011444599],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008418239,0.00038671624,0.0005043906,0.0009089323,0.00021653884,0.00019477996,0.0012774654,0.00021838336,0.000021413915],"category_scores_gemma":[0.00011229565,0.00037000937,0.00018540268,0.0008382407,0.00031234277,0.00021536787,0.0003789672,0.00031378012,0.000010867285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007506779,0.000042983807,0.000007185629,0.000087942055,0.000010874734,0.0000022821994,0.00028343656,0.6472347,0.00088344485,0.10109027,0.000010363583,0.25033906],"study_design_scores_gemma":[0.00038550043,0.0003186975,0.00006850835,0.00031769357,0.000011365991,0.000034387493,9.730479e-8,0.79962933,0.013349198,0.1850277,0.00046132316,0.00039620392],"about_ca_topic_score_codex":0.000016706428,"about_ca_topic_score_gemma":0.000020548976,"teacher_disagreement_score":0.4636903,"about_ca_system_score_codex":0.0003359458,"about_ca_system_score_gemma":0.0009746689,"threshold_uncertainty_score":0.9998752},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062396266,0.000113630405,0.9756955,0.000023126551,0.0059065414,0.0002882157,0.000008611042,0.00013744984,0.011587279],"genre_scores_gemma":[0.9722414,0.0000168825,0.022514565,0.00027983353,0.0036504588,0.000011882473,0.00005803325,0.000055280518,0.0011716688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979431,0.000026432266,0.00034137326,0.00090838195,0.00041532298,0.00036538046],"domain_scores_gemma":[0.99869376,0.00012991727,0.00017140467,0.0006693075,0.00023831055,0.000097286844],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003330896,0.00031312474,0.00026528593,0.00045218915,0.00021969939,0.00016255108,0.0005474571,0.00054908806,0.0011277554],"category_scores_gemma":[0.000029477262,0.00030518006,0.00009406791,0.00017675316,0.00040124427,0.00015443786,0.0001080486,0.0007954147,0.00007175016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007124199,0.0001118123,0.00046650978,0.00006244098,0.000039740306,0.00010067485,0.06138422,0.24529324,0.0019802868,0.008220173,0.000024865247,0.6822448],"study_design_scores_gemma":[0.001838402,0.00074523385,0.0020842778,0.00055242557,0.00014864508,0.0002956453,0.000011913712,0.8327444,0.0051647094,0.13969193,0.0131508615,0.0035714968],"about_ca_topic_score_codex":0.00052385486,"about_ca_topic_score_gemma":0.0007841598,"teacher_disagreement_score":0.96600175,"about_ca_system_score_codex":0.00012119926,"about_ca_system_score_gemma":0.00012829083,"threshold_uncertainty_score":0.99994004},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000108161374,0.0005052806,0.9913718,0.0016335549,0.0010674399,0.0003618735,0.0000022077104,0.0005553152,0.0043943347],"genre_scores_gemma":[0.37186825,0.00026836165,0.6251376,0.00083073135,0.00032120544,0.000021499054,0.0000063708612,0.00004379329,0.0015021794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963338,0.000024959032,0.0005786484,0.0015088498,0.0009856835,0.0005680876],"domain_scores_gemma":[0.9971371,0.00023685151,0.00043586126,0.0019030564,0.00017248346,0.00011463467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047363056,0.00047918694,0.0004054573,0.0011160651,0.00029866004,0.0008326078,0.0035984616,0.0003568641,0.00008039853],"category_scores_gemma":[0.000084301464,0.000443213,0.00011835795,0.0007463154,0.0007339805,0.0010506852,0.0010887757,0.00058282854,0.0001298837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015345548,0.000029668145,0.000054459535,0.000018969742,0.000008185415,0.000021618802,0.00024448973,0.003035423,0.0005633286,0.18559803,0.000054975702,0.8103693],"study_design_scores_gemma":[0.0002442487,0.000110481,0.00015358765,0.0002500393,0.000011229324,0.000048693913,5.682325e-7,0.623833,0.004045157,0.364692,0.0057681627,0.00084280374],"about_ca_topic_score_codex":0.000011109089,"about_ca_topic_score_gemma":0.000007180289,"teacher_disagreement_score":0.8095265,"about_ca_system_score_codex":0.0006046181,"about_ca_system_score_gemma":0.00025435403,"threshold_uncertainty_score":0.999802},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046519286,0.0004512773,0.9815389,0.0024535805,0.0017652026,0.00033748514,0.0000012364357,0.00032200923,0.01308378],"genre_scores_gemma":[0.174251,0.00015132736,0.8208018,0.0013409065,0.0005739277,0.000013746041,0.000005141655,0.000042000214,0.002820172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666345,0.000033007567,0.00045362173,0.0014105919,0.00086806563,0.0005712524],"domain_scores_gemma":[0.9974502,0.00030932637,0.00025702082,0.0016590073,0.00020501667,0.000119485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006153562,0.00042371178,0.00041659997,0.0006365659,0.00022400994,0.0004912718,0.0036207906,0.00034201276,0.000032548793],"category_scores_gemma":[0.00012379102,0.00036335163,0.000104211766,0.0005410481,0.0006959949,0.000580788,0.0008923635,0.00064796745,0.00019024315],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027977155,0.000034923443,0.000106543535,0.000031586653,0.0000089179075,0.00011710753,0.00070035696,0.0028387536,0.00014653684,0.2337283,0.00011580297,0.76216835],"study_design_scores_gemma":[0.0003203396,0.00023859186,0.001040859,0.00032087514,0.000011174879,0.00016376255,2.0819449e-7,0.5386183,0.0018312337,0.4519634,0.0044826237,0.0010086141],"about_ca_topic_score_codex":0.000016140513,"about_ca_topic_score_gemma":0.000035379115,"teacher_disagreement_score":0.7611598,"about_ca_system_score_codex":0.00022229918,"about_ca_system_score_gemma":0.000392297,"threshold_uncertainty_score":0.99988186},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019660393,0.00015370394,0.99440664,0.00039536727,0.0005263344,0.0010554909,0.000055712364,0.0027142887,0.0004958314],"genre_scores_gemma":[0.5562126,0.0000012659176,0.44317338,0.00027577573,0.00016762705,0.00008501871,0.000031483833,0.000025860045,0.000027018808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634624,0.000057999863,0.00074849004,0.001525182,0.0005427564,0.0007793246],"domain_scores_gemma":[0.99263704,0.005318275,0.00036394421,0.001100499,0.00047086054,0.00010936715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021689208,0.00048784816,0.0006250362,0.0007463936,0.00041292654,0.0005110108,0.0020947272,0.00030923053,0.0000017138319],"category_scores_gemma":[0.002441773,0.00047673643,0.00012049675,0.0009971828,0.0005297707,0.00042012727,0.00064025144,0.00081415277,0.0000035550197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014494494,0.00029653145,0.025906134,0.00051272154,0.000024607032,0.00011181063,0.0008526353,0.49419776,0.00059293146,0.023207285,0.0014149641,0.45286813],"study_design_scores_gemma":[0.00026976917,0.00010431167,0.00097219774,0.0005580682,0.000003928236,0.000023648005,1.9828152e-8,0.4654063,0.00013054954,0.5320332,0.00012130509,0.0003767028],"about_ca_topic_score_codex":0.00019287837,"about_ca_topic_score_gemma":0.00012995854,"teacher_disagreement_score":0.55601597,"about_ca_system_score_codex":0.00054463965,"about_ca_system_score_gemma":0.00054422446,"threshold_uncertainty_score":0.99976844},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030140849,0.00023153816,0.96718097,0.00008820145,0.001577332,0.00039441904,0.0000038234334,0.00019747422,0.00018536586],"genre_scores_gemma":[0.18218371,0.000004506225,0.8171406,0.00022412665,0.00028977208,0.000021767502,0.000006783506,0.000044837107,0.00008391059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948254,0.000029081113,0.00075702334,0.0016906087,0.0018103428,0.0008875345],"domain_scores_gemma":[0.99612796,0.0021152168,0.00027375558,0.0009169508,0.00038681924,0.00017928262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012760885,0.0005553571,0.00052084174,0.00088503986,0.00028928477,0.0006938255,0.0027811236,0.00035962719,0.000052146577],"category_scores_gemma":[0.0018343147,0.0005520894,0.00005731655,0.0011300159,0.00033624272,0.0008638449,0.001982757,0.0012419343,0.000022460377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024160043,0.00015313907,0.0112338,0.0004831258,0.00006225286,0.00028225585,0.0078108967,0.14146082,0.008922446,0.00048666715,0.00001824742,0.82906216],"study_design_scores_gemma":[0.0014966719,0.0001539804,0.018867128,0.0049042646,0.000014932113,0.00012461627,0.0000028522215,0.90001947,0.03891744,0.030533371,0.0019340054,0.0030312743],"about_ca_topic_score_codex":0.00007416312,"about_ca_topic_score_gemma":0.00014170729,"teacher_disagreement_score":0.8260309,"about_ca_system_score_codex":0.0008149805,"about_ca_system_score_gemma":0.0027275658,"threshold_uncertainty_score":0.99969304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060523994,0.00031729988,0.995756,0.0003289346,0.0014224167,0.0004238654,0.00006324663,0.0005685233,0.00051447575],"genre_scores_gemma":[0.0920005,0.000012947246,0.90569997,0.001482561,0.00063494546,0.0000061350192,0.00011794347,0.000031055002,0.000013974778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961087,0.00007984259,0.00060806185,0.0017331663,0.0009055162,0.0005646892],"domain_scores_gemma":[0.9972606,0.00031528116,0.00039182237,0.0016620663,0.00021398615,0.00015629729],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005495213,0.00057134853,0.0004991746,0.00057981745,0.00051085366,0.0008821942,0.0015983848,0.0003048109,0.000038391365],"category_scores_gemma":[0.00006478998,0.00052514224,0.000115380884,0.0006464476,0.0003496326,0.0011434415,0.0006915138,0.0005779053,0.000025969448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041744906,0.000090317284,0.00003275626,0.0000336918,0.000016957061,0.0021948225,0.00044831898,0.71324056,0.0003508008,0.007529221,0.00013438734,0.275924],"study_design_scores_gemma":[0.00026921224,0.00005907787,0.000012700648,0.00015407668,0.00001590982,0.00028868645,7.016667e-8,0.98855656,0.000729306,0.008889531,0.0004235157,0.000601351],"about_ca_topic_score_codex":0.0003300551,"about_ca_topic_score_gemma":0.00013744677,"teacher_disagreement_score":0.27532265,"about_ca_system_score_codex":0.00036025222,"about_ca_system_score_gemma":0.00033715743,"threshold_uncertainty_score":0.99972004},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035393266,0.0016101004,0.9926805,0.0007920464,0.00044134623,0.0004179144,0.000007137104,0.000060319057,0.00045134148],"genre_scores_gemma":[0.5306269,0.00034926969,0.46864417,0.00020066398,0.00008394195,0.000011119281,0.0000024354292,0.000009608963,0.00007190367],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796027,0.000025907824,0.0004036181,0.00094177615,0.00029560155,0.00037284807],"domain_scores_gemma":[0.99791056,0.0009866727,0.00027772976,0.0005721754,0.000170805,0.000082029546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072238705,0.00034127245,0.0004900812,0.00034618564,0.0001495053,0.00026704662,0.0014061615,0.00017058056,0.0000018429381],"category_scores_gemma":[0.00010407719,0.00024581054,0.000053880885,0.00014625462,0.0011487777,0.0006188424,0.00065244903,0.00018897987,4.5499618e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010046173,0.000021301144,0.00021019472,0.000059019872,0.000009339221,0.0000033063639,0.0024931557,0.00030370642,0.0002635328,0.10064379,0.000008610861,0.895974],"study_design_scores_gemma":[0.00032064642,0.0009575797,0.0028344078,0.0010306138,0.000010753573,0.00010078278,0.000025635838,0.19133216,0.0059989095,0.79495203,0.0016773219,0.00075916894],"about_ca_topic_score_codex":0.000024432471,"about_ca_topic_score_gemma":0.00033503745,"teacher_disagreement_score":0.89521486,"about_ca_system_score_codex":0.00006584006,"about_ca_system_score_gemma":0.00009968993,"threshold_uncertainty_score":0.9999994},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000022451607,0.00014423746,0.98134875,0.008021199,0.0058455514,0.0006291712,0.0000015797285,0.00018995136,0.003817334],"genre_scores_gemma":[0.03579746,0.000015314485,0.95582706,0.0051404247,0.0017797104,0.000029576298,0.0000026179328,0.000037004294,0.001370821],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99599165,0.000058255977,0.00045836988,0.0015046229,0.0012001543,0.000786928],"domain_scores_gemma":[0.9962038,0.0006670316,0.00022381406,0.0022241464,0.00036430085,0.00031694767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001604963,0.0004717005,0.00044510196,0.00042187987,0.0005743948,0.0010227317,0.0038377428,0.00042179454,0.000025206056],"category_scores_gemma":[0.00029272196,0.000304025,0.0001517993,0.0006827436,0.00063460076,0.00040760305,0.0020732486,0.0015816143,0.00041126707],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013419295,0.000026978747,0.0000053489284,0.000007043163,0.000008063387,0.00014290989,0.00068279955,0.00040027435,0.000056781457,0.16892995,0.00025038002,0.8294881],"study_design_scores_gemma":[0.00023861731,0.000429331,0.00009788527,0.00007109624,0.000019245239,0.0009526685,6.852462e-7,0.26058513,0.0008751789,0.39097983,0.34459653,0.0011537843],"about_ca_topic_score_codex":0.000054967415,"about_ca_topic_score_gemma":0.0002068585,"teacher_disagreement_score":0.82833433,"about_ca_system_score_codex":0.000121654906,"about_ca_system_score_gemma":0.0006718153,"threshold_uncertainty_score":0.9999412},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033504466,0.00044385562,0.99551964,0.0013174174,0.00025381424,0.0005898613,0.0000043004493,0.00023251883,0.0013035723],"genre_scores_gemma":[0.10918392,0.00022163299,0.8884274,0.0015457172,0.00013068882,0.000012756778,0.000010683561,0.00004947519,0.00041774008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99610066,0.000044861317,0.000619857,0.0016016137,0.0010288068,0.00060419785],"domain_scores_gemma":[0.99724644,0.00049890135,0.00042025052,0.0011795326,0.0004845363,0.00017034858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012663365,0.00050271844,0.00049242045,0.0012049561,0.00017051533,0.00049706973,0.0017442885,0.0003476639,0.000005831502],"category_scores_gemma":[0.00014784241,0.00042413242,0.0000717005,0.0014092441,0.0013831897,0.0008193435,0.00031872775,0.0008874817,0.000012406399],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000264206,0.00017425942,0.0012659547,0.00023243153,0.000016916763,0.0003208869,0.0006185536,0.00016922483,0.030628946,0.053087305,0.000016003474,0.9132053],"study_design_scores_gemma":[0.0037679155,0.0018922926,0.023446297,0.0038666306,0.000040375773,0.0003264655,0.0000046132045,0.45670834,0.36228225,0.13984089,0.0035546448,0.0042692902],"about_ca_topic_score_codex":0.000020267773,"about_ca_topic_score_gemma":0.000075308635,"teacher_disagreement_score":0.908936,"about_ca_system_score_codex":0.0003314227,"about_ca_system_score_gemma":0.00047886866,"threshold_uncertainty_score":0.99982107},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008662835,0.00030595998,0.9953161,0.00022842025,0.0017348059,0.0008214073,0.000046924288,0.0001750959,0.0012846476],"genre_scores_gemma":[0.05701082,0.000022070235,0.9414991,0.0009590876,0.00034171107,0.000040671755,0.000041031028,0.000037541213,0.0000479658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99489594,0.000051457424,0.00073506753,0.0022428364,0.0009861146,0.0010885824],"domain_scores_gemma":[0.9968291,0.0006861286,0.0002846827,0.0017405392,0.0002519032,0.00020764887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011517326,0.0007060003,0.0007142958,0.0011534046,0.00027811158,0.0008111147,0.0043799067,0.00045290962,0.000007227787],"category_scores_gemma":[0.000054441134,0.00062183617,0.00018673201,0.0010439872,0.0005674003,0.0005736584,0.0007916941,0.0007634354,0.000015310534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002311004,0.000053388652,0.000024975376,0.000014469378,0.0000025568083,0.000047438545,0.00030943498,0.3914411,0.0000042584697,0.0054857642,0.000022772161,0.6025915],"study_design_scores_gemma":[0.00038385342,0.00030530547,0.00015824688,0.00016081343,0.000004149336,0.00001740529,1.3620333e-7,0.8573259,0.000066544286,0.14025529,0.0006498509,0.0006724984],"about_ca_topic_score_codex":0.0001164346,"about_ca_topic_score_gemma":0.00018940901,"teacher_disagreement_score":0.60191905,"about_ca_system_score_codex":0.0002985936,"about_ca_system_score_gemma":0.0005114671,"threshold_uncertainty_score":0.9996233},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006884998,0.0012419628,0.99090326,0.000028504901,0.00047026612,0.0002960329,0.0000014110652,0.00002785598,0.00014573462],"genre_scores_gemma":[0.81371856,0.00012376526,0.18604401,0.000015533798,0.00006432733,0.0000053799504,0.0000013065799,0.000016351973,0.000010767757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999087,0.0000128132215,0.00018947292,0.00018172238,0.00037045413,0.00015857104],"domain_scores_gemma":[0.9994014,0.00016127912,0.000049566108,0.00019723701,0.00014616203,0.000044362005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070021616,0.00015492346,0.00017000076,0.00018609612,0.000042499134,0.000025484962,0.00016134721,0.00010906765,0.000013184271],"category_scores_gemma":[0.00003537844,0.00013450194,0.000018727862,0.00008511271,0.0002954554,0.00016019051,0.0000617523,0.00017103988,0.0000030235651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002278151,0.0000027573608,0.00003326229,0.00006643606,0.0000039042097,1.7056483e-7,0.00043644742,0.6723533,0.0002315218,0.00011531277,7.2322933e-7,0.32675382],"study_design_scores_gemma":[0.00009379395,0.000104293664,0.0006682884,0.00018894325,0.000019730038,0.00000935335,1.2526596e-7,0.98957765,0.0016050785,0.00753703,0.000034768294,0.00016093643],"about_ca_topic_score_codex":3.7609516e-7,"about_ca_topic_score_gemma":0.0000011407119,"teacher_disagreement_score":0.80683357,"about_ca_system_score_codex":0.00007861387,"about_ca_system_score_gemma":0.000094753,"threshold_uncertainty_score":0.548483},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001633421,0.00047848918,0.9966685,0.0005867439,0.00050739513,0.00058656035,0.0000019380095,0.0009077086,0.00009930593],"genre_scores_gemma":[0.059867796,0.00004174711,0.93938595,0.0003494287,0.00018566131,0.00003626971,0.0000018638088,0.000023641267,0.00010762822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973805,0.000030543124,0.0006039146,0.0008788633,0.00056528894,0.00054090057],"domain_scores_gemma":[0.9949966,0.0032595175,0.00036123366,0.0010760456,0.00024035198,0.0000662607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013905468,0.00033002332,0.00040074732,0.00048521702,0.0002044495,0.0005537438,0.0027318427,0.00022337727,5.231505e-7],"category_scores_gemma":[0.0006661929,0.00024297764,0.0001129723,0.0005297698,0.0006717907,0.00046385566,0.0006530734,0.00049879594,0.0000012973728],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004445475,0.000020259435,0.00041010947,0.000019285928,0.0000029811138,0.000005398543,0.00045245775,0.0052232537,0.0000052189753,0.004132674,0.000046173012,0.9896777],"study_design_scores_gemma":[0.00019220111,0.0003046843,0.00021808145,0.00096854917,0.000004418381,0.000027165868,6.8354865e-8,0.69999087,0.0003595545,0.28989846,0.0076013943,0.0004345801],"about_ca_topic_score_codex":0.000047655743,"about_ca_topic_score_gemma":0.00016086253,"teacher_disagreement_score":0.98924315,"about_ca_system_score_codex":0.00012687304,"about_ca_system_score_gemma":0.00033911882,"threshold_uncertainty_score":0.99083406},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43715066,0.00050509,0.48019332,0.005809008,0.004636888,0.0049412567,0.000030399831,0.00031931346,0.06641404],"genre_scores_gemma":[0.99102056,0.000034104538,0.0044063106,0.0027295658,0.000095143994,0.000022081573,0.000004713744,0.000027871854,0.0016596583],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9967748,0.000088855486,0.00052973925,0.0010903393,0.0007996232,0.000716628],"domain_scores_gemma":[0.998136,0.00055819686,0.00023216859,0.00092912046,0.000012663391,0.00013185244],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019135326,0.00040821653,0.00035252603,0.00020330613,0.00029018315,0.00015660783,0.0016796468,0.00021199057,0.004673125],"category_scores_gemma":[0.00021553671,0.00027821894,0.000097963675,0.00041249333,0.0014915593,0.0003724313,0.00092824467,0.00074369303,0.00019240049],"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.00002271286,0.00022575098,0.59208924,0.0000741852,0.0000061597543,0.00013372654,0.016690861,0.0024555887,0.000026632857,0.00021771668,0.00017042119,0.38788697],"study_design_scores_gemma":[0.00026189967,0.00026939876,0.9495328,0.00036117685,0.000017536504,0.000120597695,0.000093184164,0.0069352295,0.00012525298,0.033637885,0.007398343,0.0012466836],"about_ca_topic_score_codex":0.000443275,"about_ca_topic_score_gemma":0.0017323965,"teacher_disagreement_score":0.5538699,"about_ca_system_score_codex":0.0007973508,"about_ca_system_score_gemma":0.00017540828,"threshold_uncertainty_score":0.999967},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045569755,0.0002709969,0.95908093,0.000748768,0.0019484011,0.00031908602,0.000012599776,0.00016240781,0.037411258],"genre_scores_gemma":[0.051841475,0.00010762533,0.94598037,0.0008187655,0.00061530294,0.0000060985294,0.000010918925,0.000054950113,0.00056448224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582285,0.00004463213,0.00068857387,0.0015164886,0.0011571622,0.00077030354],"domain_scores_gemma":[0.99683833,0.00041857208,0.0004256511,0.0018995875,0.00022146135,0.00019637021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005929275,0.0006025,0.00079811196,0.0005788627,0.00022052527,0.00030235152,0.0044939336,0.0003442501,0.00013846734],"category_scores_gemma":[0.00005803595,0.00054024014,0.0002240915,0.0006541181,0.0019751824,0.0005097566,0.0020963524,0.00071256247,0.00017285788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000468072,0.00013036332,0.000014526787,0.0001076655,0.00004624411,0.00019295554,0.0016841096,0.10091458,0.00006162835,0.039099,0.00024611564,0.85745597],"study_design_scores_gemma":[0.0005166899,0.00040998592,0.000037818587,0.0001931615,0.000009544897,0.000044392098,8.829966e-8,0.92758256,0.00012218721,0.06837256,0.0021196217,0.00059140613],"about_ca_topic_score_codex":0.000032865875,"about_ca_topic_score_gemma":0.000044380587,"teacher_disagreement_score":0.8568646,"about_ca_system_score_codex":0.00024791996,"about_ca_system_score_gemma":0.00021471012,"threshold_uncertainty_score":0.9997049},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034699761,0.00079283176,0.9811948,0.0036341974,0.001710013,0.0011844548,0.000056569676,0.000116514784,0.007840638],"genre_scores_gemma":[0.963238,0.00095160736,0.025572855,0.0069752675,0.0023909977,0.000044300952,0.00017768548,0.00007973959,0.0005695196],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99677056,0.00003284657,0.00051899016,0.00084712286,0.0014070091,0.00042344176],"domain_scores_gemma":[0.9962843,0.0026490388,0.00015275655,0.00042979518,0.0001011602,0.0003829256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011379,0.000328414,0.0008307949,0.00029442224,0.00013111818,0.000032755528,0.00028539533,0.0004285307,0.00025190096],"category_scores_gemma":[0.0009180205,0.00027162454,0.00036088095,0.00012476645,0.0008953442,0.00006413607,0.00020795401,0.0005200775,0.000019744646],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012405345,0.000047003985,0.00037834537,0.000049478444,0.000045652523,0.00028060493,0.0004168649,0.0016294086,0.000009426201,0.00025179368,0.00015371358,0.9966137],"study_design_scores_gemma":[0.009565834,0.0034653486,0.025749894,0.0061363187,0.00045231712,0.00085774384,0.000006002624,0.18731922,0.0036740461,0.018988108,0.7390205,0.004764638],"about_ca_topic_score_codex":0.000016022568,"about_ca_topic_score_gemma":0.00001280132,"teacher_disagreement_score":0.991849,"about_ca_system_score_codex":0.00026718155,"about_ca_system_score_gemma":0.001465693,"threshold_uncertainty_score":0.9999736},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000331166,0.0001350215,0.9966157,0.0006566258,0.0005076558,0.00064970646,0.0000038906637,0.0002282029,0.0011700804],"genre_scores_gemma":[0.021155039,0.000056983947,0.9751283,0.0027832882,0.00050514203,0.000021391343,0.0000230842,0.000036355155,0.00029043952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556506,0.00005121174,0.0005341018,0.0012341145,0.0018969671,0.00071856665],"domain_scores_gemma":[0.9975818,0.00035436495,0.0002836409,0.0010052901,0.00041577136,0.00035913824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010715909,0.00048774428,0.000429001,0.0007535108,0.00021303853,0.0002833701,0.0022624906,0.0002790362,0.0001292032],"category_scores_gemma":[0.000034207438,0.0004049643,0.000081833976,0.0005854123,0.0019098916,0.0010144078,0.0007075036,0.00091185904,0.000107429856],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008544584,0.000044490116,0.000050202074,0.000040989198,0.0000137951265,0.00007291199,0.00079469563,0.0014878485,0.0016773107,0.0010202255,0.000056956243,0.994732],"study_design_scores_gemma":[0.0018990242,0.0013606873,0.00032414155,0.0017121148,0.000044730343,0.00091053307,0.0000021246694,0.7781501,0.1784828,0.03387399,0.00068856945,0.0025511812],"about_ca_topic_score_codex":0.000023117802,"about_ca_topic_score_gemma":0.000015245729,"teacher_disagreement_score":0.9921808,"about_ca_system_score_codex":0.0003216501,"about_ca_system_score_gemma":0.00071826647,"threshold_uncertainty_score":0.9998402},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011686289,0.0006742777,0.9959448,0.000035550493,0.0014924443,0.00027954174,0.000029295015,0.0001618397,0.00021365237],"genre_scores_gemma":[0.62256277,0.00013686373,0.37606686,0.00016438375,0.00089360797,0.000005630834,0.00009960288,0.00004343248,0.000026823123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958894,0.00009281644,0.0008457653,0.0014515847,0.0011992272,0.00052115426],"domain_scores_gemma":[0.99725896,0.00029964946,0.00077424536,0.0012707518,0.0002493777,0.00014702277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014463371,0.00049751916,0.0008383356,0.0026375859,0.00050778274,0.0003097445,0.001994865,0.00041510645,0.00003910613],"category_scores_gemma":[0.000059450475,0.0004736348,0.0002676771,0.0031644872,0.0003412608,0.00083313265,0.0014910629,0.001075532,0.000007947962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008779041,0.000015348842,0.0000732254,0.00003578304,0.0000733986,0.000017185335,0.00015021973,0.31390482,0.00059391715,0.0006374599,5.095389e-7,0.68448937],"study_design_scores_gemma":[0.0001536935,0.00016684279,0.000113913164,0.00031658495,0.00015683152,0.00006101653,2.055285e-7,0.9929842,0.0033559168,0.0014699051,0.0007707498,0.00045017918],"about_ca_topic_score_codex":0.00037208913,"about_ca_topic_score_gemma":0.0018193831,"teacher_disagreement_score":0.6840392,"about_ca_system_score_codex":0.0005914117,"about_ca_system_score_gemma":0.00017065989,"threshold_uncertainty_score":0.99977154},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011585447,0.00020636508,0.9871952,0.00046224514,0.0016504546,0.00024262955,0.000016693888,0.000025476222,0.009042415],"genre_scores_gemma":[0.9940025,0.000011428976,0.003310516,0.0004854582,0.001970088,0.000007600001,0.000021883492,0.00002940637,0.0001610953],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998067,0.000024096935,0.00033245428,0.00055279804,0.0004157544,0.00060784956],"domain_scores_gemma":[0.999251,0.0001775167,0.0001308415,0.00026647397,0.00006134627,0.00011282114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040736896,0.00030571426,0.00039385998,0.0002171876,0.00020561107,0.00017498931,0.00082380185,0.00024348243,0.0001453266],"category_scores_gemma":[0.0000059555414,0.00030353977,0.00012619857,0.00024199401,0.00059996796,0.00016421094,0.00041076972,0.0010920507,0.000022976155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000572355,0.000041324285,0.0031943992,0.0000070668843,0.0000101177875,0.000005377158,0.0007755941,0.01469366,0.000006120555,0.20787075,0.000020111931,0.7733697],"study_design_scores_gemma":[0.00049204915,0.00006035018,0.006841859,0.00024424135,0.000011814967,0.0000019814993,9.2107643e-7,0.30420664,0.000010844106,0.68384147,0.0032981636,0.0009896578],"about_ca_topic_score_codex":0.00009290111,"about_ca_topic_score_gemma":0.000046418656,"teacher_disagreement_score":0.992844,"about_ca_system_score_codex":0.00014060592,"about_ca_system_score_gemma":0.00021996425,"threshold_uncertainty_score":0.99994165},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020801884,0.00082733703,0.992573,0.00092100573,0.0021764042,0.0012144849,0.0000024507274,0.0010367158,0.0010405503],"genre_scores_gemma":[0.7194332,0.00028446384,0.27716577,0.0005417604,0.0005196192,0.0003001977,0.000014739668,0.000080883634,0.0016593533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582,0.000049871076,0.0005882932,0.0018622783,0.0008219792,0.00085759314],"domain_scores_gemma":[0.99649817,0.0010983578,0.0005538659,0.0012477795,0.0005107346,0.00009111214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007265533,0.00059591385,0.0006751422,0.00087053044,0.0007546425,0.00044011773,0.003753136,0.00061565975,0.000012413112],"category_scores_gemma":[0.00044315227,0.0005950326,0.00020499631,0.00065821665,0.0010617469,0.0005695713,0.0010856272,0.0014065747,0.000059168662],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042272845,0.000029390714,0.00003886382,0.0000634052,0.000012710858,0.000013148838,0.002447282,0.045718703,0.00016941188,0.004055353,0.000104730076,0.94734275],"study_design_scores_gemma":[0.0009754482,0.0013492693,0.00012371001,0.0013409337,0.000029071683,0.00016448747,0.000019901703,0.7909497,0.011147431,0.14829798,0.042996094,0.0026059838],"about_ca_topic_score_codex":0.000014396343,"about_ca_topic_score_gemma":0.000050217135,"teacher_disagreement_score":0.9447368,"about_ca_system_score_codex":0.0005065463,"about_ca_system_score_gemma":0.0012689186,"threshold_uncertainty_score":0.9996501},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12568305,0.000006806837,0.8723743,0.0012301276,0.00009597266,0.0004918748,0.0000011583003,0.000086698055,0.000030031671],"genre_scores_gemma":[0.5950284,0.0000028793268,0.4041688,0.00072085107,0.00004335849,0.000029303823,0.0000025182967,0.0000035321318,3.7034434e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923897,0.000012147944,0.00013133863,0.0003262499,0.00012232471,0.00016899798],"domain_scores_gemma":[0.9994241,0.00013982423,0.00005491928,0.0002471684,0.00008985296,0.000044136097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023029798,0.00007785676,0.00011675118,0.00013013436,0.00014016613,0.000018230563,0.00013719968,0.000037877726,0.0000057531342],"category_scores_gemma":[0.00011211525,0.00006765648,0.000027758337,0.00042390855,0.000116783725,0.00010947512,0.00007361698,0.00012456148,0.0000012207382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015685042,0.000543218,0.075133175,0.00016447739,0.000007688306,0.000021340087,0.0060490933,0.0048747123,0.13216917,0.008901144,0.00007706147,0.7719021],"study_design_scores_gemma":[0.00054265786,0.0002651047,0.109307624,0.00011349156,0.0000063927737,0.000047769674,0.0000020706705,0.7593282,0.05501559,0.07504603,0.00017377679,0.00015129226],"about_ca_topic_score_codex":0.00003689684,"about_ca_topic_score_gemma":0.000011715455,"teacher_disagreement_score":0.77175075,"about_ca_system_score_codex":0.000049733782,"about_ca_system_score_gemma":0.000039952924,"threshold_uncertainty_score":0.27589512},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003899311,0.0005784352,0.9927656,0.0012401703,0.002439644,0.0005815488,0.000007301894,0.00010838375,0.0018889668],"genre_scores_gemma":[0.17910497,0.00009874183,0.8146812,0.0040001413,0.0018919788,0.000029403942,0.00001644711,0.00003931926,0.00013783426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957359,0.00011960429,0.0005612477,0.0012104571,0.0016113454,0.00076146267],"domain_scores_gemma":[0.9967071,0.0008906558,0.00053997675,0.0014433621,0.00029518007,0.00012373885],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017756871,0.00045219096,0.00042288983,0.00021141852,0.00072883774,0.0012378003,0.00317748,0.00031619237,0.00004651805],"category_scores_gemma":[0.00011446173,0.00033194013,0.00014168736,0.00060966494,0.00028617948,0.0007167397,0.0013226584,0.00074841746,0.000090415466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011994613,0.00001652931,0.0007019196,0.00000702371,0.000029173732,0.000019574894,0.001017677,0.629987,0.000121683195,0.017389597,0.00010307437,0.35060555],"study_design_scores_gemma":[0.000101860074,0.00003270538,0.0005481168,0.00016274299,0.000017858285,0.0000072318867,1.5233856e-7,0.74046606,0.000055324683,0.25718763,0.0010782405,0.00034208555],"about_ca_topic_score_codex":0.0003421965,"about_ca_topic_score_gemma":0.00010244876,"teacher_disagreement_score":0.35026348,"about_ca_system_score_codex":0.001177463,"about_ca_system_score_gemma":0.0004928877,"threshold_uncertainty_score":0.9999133},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000120229226,0.00054424984,0.98962617,0.0006596143,0.0032100172,0.00054709765,0.000004502724,0.00022477786,0.0050633247],"genre_scores_gemma":[0.019053841,0.00002218582,0.97884077,0.0016242742,0.0003062716,0.000012408742,0.0000033328292,0.000020299585,0.00011661201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972801,0.00002957041,0.0005833984,0.0008727352,0.0005231526,0.0007110391],"domain_scores_gemma":[0.9976322,0.0005597955,0.00032846822,0.0010473263,0.00031685652,0.00011532728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001245811,0.00045175693,0.00049225864,0.0010059824,0.0003987356,0.0007927476,0.0024679624,0.00034147408,0.0000062917675],"category_scores_gemma":[0.00018625268,0.00041246257,0.00015192118,0.0006056256,0.00038821856,0.0015796613,0.00076357607,0.00040942788,0.000019970837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013917729,0.000036758964,0.0000490227,0.0002436403,0.00002481379,0.000018046758,0.00292462,0.029603044,0.00055569893,0.25990522,0.00040026766,0.706225],"study_design_scores_gemma":[0.00044567542,0.00012937225,0.000011438155,0.00040418273,0.0000094940315,0.00004602063,0.0000014765602,0.62893665,0.0027563374,0.3338033,0.03276092,0.0006951072],"about_ca_topic_score_codex":0.00000908616,"about_ca_topic_score_gemma":0.000043803375,"teacher_disagreement_score":0.70552987,"about_ca_system_score_codex":0.000365428,"about_ca_system_score_gemma":0.00071013503,"threshold_uncertainty_score":0.99983275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016128327,0.00024392713,0.99395037,0.0000597745,0.0016407359,0.0008105326,0.0000045489032,0.00008061118,0.0015966718],"genre_scores_gemma":[0.9640412,0.000008646337,0.03566763,0.00006163454,0.000131631,0.000028724166,0.000010603286,0.00001427268,0.00003568638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710053,0.00006739681,0.0011914124,0.00060659717,0.0006474965,0.00038658993],"domain_scores_gemma":[0.9983996,0.00026054392,0.00044245634,0.00056505925,0.0002684601,0.00006386142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009998727,0.00039735343,0.00057293265,0.0010628776,0.00011336681,0.0006410004,0.0010445304,0.00025523137,0.00000571445],"category_scores_gemma":[0.000033374454,0.0003594294,0.00010382163,0.00041737026,0.00013174699,0.0031939421,0.00015209061,0.0005214552,0.000008854803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009233756,0.0000294953,0.00019758886,0.00031339077,0.00001137737,0.00000720749,0.0062604155,0.8538922,0.0010170998,0.016008858,0.000003963233,0.122249186],"study_design_scores_gemma":[0.0005519233,0.00008778207,0.00035695147,0.0011764303,0.0000055966707,0.000011594989,0.000013994842,0.9943953,0.0008727693,0.0016257088,0.00054959714,0.00035233644],"about_ca_topic_score_codex":0.0022483796,"about_ca_topic_score_gemma":0.00071214983,"teacher_disagreement_score":0.96242833,"about_ca_system_score_codex":0.0007335868,"about_ca_system_score_gemma":0.0005448189,"threshold_uncertainty_score":0.9998858},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034807422,0.00026136628,0.9940585,0.00082093093,0.0022008542,0.0010282623,0.0000027499739,0.000175277,0.0011040147],"genre_scores_gemma":[0.13189386,0.000016588285,0.86616904,0.0008503381,0.00049737265,0.00004823357,0.000006580341,0.000033933393,0.00048404973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570525,0.00005041089,0.0006510162,0.0017577109,0.0011618828,0.0006737248],"domain_scores_gemma":[0.99619955,0.0011820195,0.00045971113,0.001509109,0.00049132615,0.00015830754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013480245,0.00047969722,0.00048105788,0.0005564908,0.0003881606,0.0007260622,0.002854037,0.00030862313,0.00003163936],"category_scores_gemma":[0.0003424359,0.0004351535,0.0001349979,0.00030607037,0.00025884507,0.0010571781,0.0012085893,0.0006223249,0.00006343411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035916817,0.000013932497,0.000028217475,0.000063801184,0.000005892907,0.00000492266,0.00044007195,0.07716212,0.0007868601,0.012016663,0.000022996097,0.90945095],"study_design_scores_gemma":[0.00022635369,0.00012182818,0.000050874693,0.00052190793,0.000007996014,0.000021831947,2.2255837e-7,0.87398136,0.00085975946,0.12345134,0.00032826088,0.00042828772],"about_ca_topic_score_codex":0.00005833556,"about_ca_topic_score_gemma":0.000023183085,"teacher_disagreement_score":0.9090226,"about_ca_system_score_codex":0.00038663595,"about_ca_system_score_gemma":0.00048461565,"threshold_uncertainty_score":0.99981004},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021246676,0.000001113833,0.9948668,0.0016444757,0.0006867747,0.00029159815,0.0000019294944,0.00026944632,0.00011318837],"genre_scores_gemma":[0.49754864,1.625197e-7,0.5002507,0.002125238,0.000058475824,0.000010964806,0.0000031770408,0.0000024760618,1.6581355e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759895,0.00008623178,0.0003658024,0.0005258501,0.0010274005,0.00039575816],"domain_scores_gemma":[0.99831647,0.0004573842,0.0001334298,0.0006960415,0.0002076964,0.0001889831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010522158,0.0001875865,0.000148195,0.00047990764,0.00018601266,0.00046440738,0.0014660698,0.000121720164,0.000019414663],"category_scores_gemma":[0.00055250106,0.00016196721,0.000044069056,0.0012231015,0.00093298225,0.0023627335,0.0002460797,0.0007541918,0.000047153368],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016215115,0.00006999749,0.000065419954,0.0000054849133,8.840146e-7,0.000012589695,0.00055361504,0.009556384,0.007214235,0.0014601815,0.000037454152,0.9810075],"study_design_scores_gemma":[0.0003244991,0.00025390254,0.0015427216,0.000022202003,8.257809e-7,0.000011575888,5.538886e-7,0.89391696,0.09881071,0.004928233,0.00001958657,0.00016819984],"about_ca_topic_score_codex":0.000043847078,"about_ca_topic_score_gemma":0.000036990725,"teacher_disagreement_score":0.9808393,"about_ca_system_score_codex":0.000111830464,"about_ca_system_score_gemma":0.0003966969,"threshold_uncertainty_score":0.6604831},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024799604,0.0010917425,0.9912906,0.0005213716,0.0024597559,0.0004468143,0.000025681631,0.00030170893,0.0013823354],"genre_scores_gemma":[0.10963913,0.000054299784,0.8769168,0.012382922,0.0007289118,0.000025634958,0.000028901264,0.000101293255,0.00012207596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99449,0.0001205635,0.0006779387,0.002627641,0.0011286689,0.0009551737],"domain_scores_gemma":[0.9952028,0.0008502245,0.00035096123,0.0029318484,0.00022760883,0.0004365997],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00058181694,0.0008790968,0.000698707,0.0008479956,0.0004949752,0.0015105869,0.0039158124,0.0004213934,0.000049831884],"category_scores_gemma":[0.000029886018,0.00078953744,0.00017442642,0.00065810705,0.00037061205,0.001693693,0.0014161426,0.00090960826,0.00005350633],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028941306,0.00023409563,0.00011889823,0.00008221763,0.000090650145,0.01019775,0.01800163,0.03754274,0.001585266,0.032592755,0.000038644426,0.8994864],"study_design_scores_gemma":[0.0013751205,0.00094083487,0.000084010506,0.0019541292,0.00009399923,0.0048618875,0.000018328275,0.624687,0.038739447,0.28443643,0.037484147,0.005324663],"about_ca_topic_score_codex":0.00092561723,"about_ca_topic_score_gemma":0.0012618173,"teacher_disagreement_score":0.89416176,"about_ca_system_score_codex":0.00027700036,"about_ca_system_score_gemma":0.00031759805,"threshold_uncertainty_score":0.99952596},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012879164,0.0011244003,0.9837121,0.00004455071,0.00040641558,0.00037125289,0.00004924172,0.0000032124103,0.0014096771],"genre_scores_gemma":[0.85167223,0.000097294134,0.14757869,0.00026300063,0.00027560498,0.0000055681194,0.00001485917,0.000021205642,0.000071528564],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984121,0.000008143077,0.00033310003,0.0007224733,0.0002185099,0.0003056788],"domain_scores_gemma":[0.99883944,0.00010485516,0.00016861472,0.00052464276,0.0003039375,0.00005852434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056528667,0.00025226286,0.00032404767,0.00011671794,0.00007569507,0.00002090814,0.0005859562,0.00024748335,0.0000013285497],"category_scores_gemma":[0.000046245943,0.00023749942,0.00012806764,0.00007135409,0.0005931365,0.000001485789,0.00038149254,0.00012958834,5.0215306e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010757627,0.0000702723,0.00035107828,0.00022786189,0.0000849576,0.000005083845,0.00030825642,0.33927667,0.20366035,0.005928944,0.000029156265,0.44994977],"study_design_scores_gemma":[0.0011308515,0.0018590969,0.0006725287,0.00030355877,0.00006112406,0.000044551893,9.732915e-7,0.31884357,0.26021564,0.4080414,0.0071240193,0.0017027318],"about_ca_topic_score_codex":0.000012827968,"about_ca_topic_score_gemma":0.00007521306,"teacher_disagreement_score":0.8387931,"about_ca_system_score_codex":0.000039801333,"about_ca_system_score_gemma":0.00024759807,"threshold_uncertainty_score":0.96849453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025893666,0.00036348499,0.99387056,0.0010818725,0.0009686672,0.0008181829,0.000055630928,0.000043468623,0.00020879749],"genre_scores_gemma":[0.8466766,0.000024705612,0.15199658,0.0005124324,0.00063808856,0.000048524063,0.00007192242,0.00001686157,0.000014319237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738055,0.00006812382,0.00060809706,0.00069734873,0.00073114765,0.00051475555],"domain_scores_gemma":[0.99700236,0.0010263264,0.0004028054,0.001287055,0.00022520001,0.000056267298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023490984,0.00029139422,0.00031677957,0.00041597924,0.00025190576,0.00022233372,0.003345992,0.00021793004,0.000003542236],"category_scores_gemma":[0.0003307437,0.00023706745,0.000105869374,0.0006343014,0.00036880793,0.0016301754,0.00078588084,0.00052478845,0.0000033482265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018544553,0.00013896711,0.00042743149,0.00012817852,0.000009863039,0.000002603645,0.02087239,0.00883581,0.00034568188,0.5814043,0.00008859136,0.38772762],"study_design_scores_gemma":[0.0002732813,0.00015533023,0.0008252024,0.00016163957,0.000008524429,0.000016825634,0.0000020873226,0.837863,0.0005249395,0.15788108,0.0019639675,0.00032407255],"about_ca_topic_score_codex":0.000117624746,"about_ca_topic_score_gemma":0.0008634301,"teacher_disagreement_score":0.8440872,"about_ca_system_score_codex":0.00014195351,"about_ca_system_score_gemma":0.00024100815,"threshold_uncertainty_score":0.96673304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011751158,0.00032023533,0.9880562,0.0034791853,0.001458417,0.00021933051,0.000002596857,0.00016233248,0.0062899385],"genre_scores_gemma":[0.5846612,0.00018702622,0.40856233,0.0049624336,0.00082372257,0.00001727573,0.0000052629352,0.000046071324,0.00073466654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968665,0.000057233985,0.00047097792,0.0011423982,0.0008264047,0.0006364683],"domain_scores_gemma":[0.9974072,0.00066138513,0.00019451525,0.0013404409,0.00023202552,0.00016444168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014643234,0.00042254635,0.0003520185,0.00026769788,0.00054312206,0.00092706917,0.0033199848,0.0002781361,0.000010846003],"category_scores_gemma":[0.000060881343,0.00030743534,0.00013379625,0.00030346116,0.0012264398,0.00023602201,0.00046088223,0.00087024894,0.0000591391],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002460718,0.0000047791345,7.6677054e-7,0.000009669093,0.000004703495,0.00001565347,0.00026257386,0.006792037,0.000041256404,0.14296459,0.000031019004,0.8498705],"study_design_scores_gemma":[0.000113587885,0.00009472321,0.000009828403,0.00020060875,0.0000045838715,0.00007346938,1.0643437e-7,0.68770635,0.0002384662,0.3090104,0.0021604782,0.00038739757],"about_ca_topic_score_codex":0.000012589334,"about_ca_topic_score_gemma":0.000047207443,"teacher_disagreement_score":0.8494831,"about_ca_system_score_codex":0.00015087205,"about_ca_system_score_gemma":0.0004986794,"threshold_uncertainty_score":0.9999378},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003551062,0.000049692913,0.9954633,0.00007763861,0.0007539716,0.0004307291,0.000016405655,0.00007938344,0.0030933388],"genre_scores_gemma":[0.829557,0.000003517575,0.16598739,0.0002353043,0.003774611,0.00003351739,0.00005863928,0.000053880533,0.00029616637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978732,0.000010486977,0.0003781688,0.00088595203,0.0003545647,0.0004976345],"domain_scores_gemma":[0.9984286,0.00032273546,0.00022759882,0.0007322185,0.00018359614,0.00010529455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038815534,0.00041019486,0.00049956253,0.00029957746,0.00023025565,0.00021034983,0.0010862066,0.00023128864,0.00013552966],"category_scores_gemma":[0.0000051232414,0.0003861093,0.00025781084,0.0001679829,0.00044275014,0.00015630151,0.00045841915,0.0008641741,0.000004420322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070917195,0.00001626787,0.000040831837,0.0000028009322,0.000020393642,0.0000011418251,0.000054201206,0.2558128,0.000031947973,0.05074815,0.00003888379,0.6932255],"study_design_scores_gemma":[0.000087725835,0.000052133673,0.000004250539,0.00004707956,0.000016376309,6.126958e-7,3.018049e-8,0.5995749,0.0002094542,0.39848286,0.0012579638,0.00026656318],"about_ca_topic_score_codex":0.00010386458,"about_ca_topic_score_gemma":0.00018903712,"teacher_disagreement_score":0.8295215,"about_ca_system_score_codex":0.000061338425,"about_ca_system_score_gemma":0.00017718172,"threshold_uncertainty_score":0.9998591},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001258313,0.000532369,0.98841417,0.00027454615,0.00037514354,0.00018542778,0.00005015694,0.00011808369,0.008791788],"genre_scores_gemma":[0.823624,0.00011849082,0.1666314,0.0005845693,0.00063825405,0.00004353953,0.00006889997,0.00007138104,0.008219424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997631,0.000013240939,0.00040938132,0.0009704452,0.0004893425,0.00048659134],"domain_scores_gemma":[0.99695796,0.0019889278,0.0002280924,0.0006030434,0.0001360652,0.00008593758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000300456,0.0004580741,0.0006411149,0.0005298655,0.00020189704,0.00016558536,0.0009700804,0.00047605915,0.00044957706],"category_scores_gemma":[0.000396861,0.00038060383,0.00021531215,0.0002484687,0.0005091462,0.00012014965,0.00021139724,0.0005529,0.0000110812025],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081471415,0.00012690519,0.00058276026,0.00027416428,0.00013227953,0.00001474996,0.00041805912,0.004970399,0.010089167,0.0037000864,0.00012838478,0.9794816],"study_design_scores_gemma":[0.0015149852,0.00022319065,0.0006625305,0.00030127657,0.00021892368,0.000021446065,0.000002426868,0.08257046,0.42280158,0.48503628,0.005146941,0.0014999302],"about_ca_topic_score_codex":0.000010676161,"about_ca_topic_score_gemma":0.000026354957,"teacher_disagreement_score":0.9779816,"about_ca_system_score_codex":0.0003429708,"about_ca_system_score_gemma":0.00012448124,"threshold_uncertainty_score":0.9998646},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071779575,0.000507134,0.985878,0.0039286367,0.0026867297,0.00062047655,0.000007732601,0.0003182621,0.0053352336],"genre_scores_gemma":[0.37040386,0.00020890552,0.5685231,0.052836403,0.0040146313,0.00007275624,0.0000286658,0.00043173376,0.0034799266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941171,0.00015968319,0.0006967701,0.0021979962,0.0016350158,0.001193465],"domain_scores_gemma":[0.994395,0.0021794513,0.00044722017,0.0025190727,0.00020996113,0.0002492837],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017178307,0.0009192044,0.0008140448,0.0012826569,0.0007302893,0.001022777,0.006101293,0.00036767832,0.000038290797],"category_scores_gemma":[0.0002821587,0.0006226687,0.0003043263,0.0017615055,0.00086697546,0.0002531015,0.00142406,0.002030397,0.0002741012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008859942,0.00008727373,0.000017345414,0.000025586018,0.000031580137,0.00020177753,0.00047320966,0.0321669,0.00005325841,0.2121194,0.00052229204,0.7542925],"study_design_scores_gemma":[0.00023313367,0.0005862112,0.00012259267,0.00032791356,0.000009032306,0.00013465346,1.0642666e-7,0.8344774,0.00015755331,0.15438469,0.008703749,0.0008629356],"about_ca_topic_score_codex":0.000014037135,"about_ca_topic_score_gemma":0.000011632779,"teacher_disagreement_score":0.8023105,"about_ca_system_score_codex":0.00025740877,"about_ca_system_score_gemma":0.00027181822,"threshold_uncertainty_score":0.99962246},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022453374,0.00025302768,0.9955893,0.0012256396,0.00083722186,0.00015762972,0.000021935899,0.00010355746,0.0015871434],"genre_scores_gemma":[0.76397675,0.00010907108,0.23270935,0.0017618991,0.0004151175,0.000007903198,0.00003708944,0.00004994009,0.0009328834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969812,0.00002410259,0.00057935296,0.0010621472,0.0008949273,0.0004582396],"domain_scores_gemma":[0.99843824,0.00015790397,0.00033637727,0.0007241507,0.00020258149,0.0001407573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051054877,0.00039969652,0.00056080765,0.00075551664,0.00015803163,0.0003121843,0.0020679692,0.00019657207,0.0001587233],"category_scores_gemma":[0.00005027799,0.00035776827,0.00020180763,0.0006784808,0.00054240634,0.00044106916,0.0005823443,0.00045050393,0.000058438087],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030549697,0.00006205638,0.00007245372,0.00007137959,0.00003160521,0.000046912723,0.00071396324,0.011743527,0.0029819226,0.012775317,0.000071305,0.9714265],"study_design_scores_gemma":[0.0004586625,0.00040732295,0.0001101359,0.0008165889,0.00005829219,0.00007381427,7.625217e-7,0.50784504,0.08853897,0.3979749,0.001795808,0.0019197031],"about_ca_topic_score_codex":0.000059209975,"about_ca_topic_score_gemma":0.000075724754,"teacher_disagreement_score":0.9695068,"about_ca_system_score_codex":0.00014557921,"about_ca_system_score_gemma":0.00046601804,"threshold_uncertainty_score":0.9998874},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006285293,0.00011574784,0.9933923,0.0005050479,0.0006591108,0.0005103434,0.0000026526698,0.00040435913,0.0043475917],"genre_scores_gemma":[0.0789526,0.000036505775,0.91916883,0.0014774249,0.00020743553,0.00001165312,0.000013667503,0.000024971094,0.00010693835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969935,0.000060517974,0.00080514327,0.00088674854,0.00065430265,0.0005997772],"domain_scores_gemma":[0.9979647,0.00030312125,0.00039206145,0.00094198517,0.000271403,0.00012672284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009562663,0.0005166432,0.0005167393,0.0019388006,0.00023404048,0.00078177004,0.002436567,0.00035258124,0.000014105937],"category_scores_gemma":[0.00018320976,0.0005026492,0.00011578436,0.0010762949,0.00029759438,0.0022610489,0.0011327047,0.000789626,0.00003304809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003113706,0.000010175896,0.000038331393,0.000021891748,0.0000031424413,0.000008190498,0.0004184754,0.78766006,0.000008687477,0.0027127864,0.000022263765,0.20909289],"study_design_scores_gemma":[0.00025940454,0.00010687418,0.000029476265,0.0004739208,0.0000043610153,0.000063137086,1.1517729e-7,0.98755366,0.0005090995,0.009802564,0.00067149947,0.0005259083],"about_ca_topic_score_codex":0.00003785496,"about_ca_topic_score_gemma":0.000041152838,"teacher_disagreement_score":0.20856698,"about_ca_system_score_codex":0.00061143294,"about_ca_system_score_gemma":0.0005166696,"threshold_uncertainty_score":0.9997425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024415905,0.00013788488,0.9710226,0.00014657782,0.0035135192,0.00049723947,0.0000022425295,0.00014014798,0.00012385196],"genre_scores_gemma":[0.70267344,0.000017459975,0.29645815,0.00011228134,0.0006973387,0.000007802325,0.000001946276,0.000026465234,0.0000051572733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963715,0.00007450727,0.0008318214,0.0013983682,0.0007346261,0.000589183],"domain_scores_gemma":[0.9976554,0.0004376069,0.00062200736,0.00093790353,0.00022649828,0.00012058436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009195552,0.00046243053,0.0005999278,0.0008633621,0.00023282353,0.0004981669,0.0012569021,0.0004986651,0.0000041601966],"category_scores_gemma":[0.00005042238,0.00047728553,0.00010141634,0.0010831151,0.00083505217,0.0008248375,0.00072960556,0.0010854164,0.0000022867523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024959303,0.000023856433,0.0002867819,0.00004649262,0.0000065820063,0.000015337033,0.00020302569,0.07439079,0.011235814,0.002774913,4.7486395e-7,0.91099095],"study_design_scores_gemma":[0.00022999685,0.00019211271,0.0021417271,0.00024383898,0.00000844034,0.000080675505,2.0774111e-7,0.89447266,0.005127006,0.097004846,0.0000778849,0.000420622],"about_ca_topic_score_codex":0.00008621232,"about_ca_topic_score_gemma":0.0009203485,"teacher_disagreement_score":0.9105704,"about_ca_system_score_codex":0.0003367624,"about_ca_system_score_gemma":0.00027748145,"threshold_uncertainty_score":0.9997679},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044771973,0.00009061063,0.9916135,0.0004495069,0.001273594,0.0002979603,0.0000032317457,0.00012909407,0.0016652959],"genre_scores_gemma":[0.9323026,0.000045472803,0.06631651,0.0002400816,0.00036025172,0.000008223934,0.00001527045,0.000024055713,0.0006875168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964618,0.00008906388,0.00069751986,0.0012062899,0.001068297,0.00047699313],"domain_scores_gemma":[0.998044,0.00018852619,0.00055151567,0.0007553664,0.00035246855,0.00010809865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010633,0.0003513011,0.00041305885,0.0006181893,0.0003723606,0.00037974832,0.0012777959,0.00027812325,0.000035281504],"category_scores_gemma":[0.00010270402,0.00034806668,0.00020524538,0.00080571097,0.00036845624,0.0009880111,0.00062286644,0.000665252,0.00006127665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014694327,0.000066076485,0.0003794408,0.000042668635,0.00001834238,0.00003299006,0.002052277,0.052339062,0.005477405,0.015842997,0.000004327989,0.9237297],"study_design_scores_gemma":[0.00069452217,0.0007194286,0.009010079,0.00067255547,0.000018831483,0.00013899067,0.0000034386628,0.9341482,0.0085914675,0.044797834,0.00030937593,0.00089526095],"about_ca_topic_score_codex":0.00004617548,"about_ca_topic_score_gemma":0.00006907451,"teacher_disagreement_score":0.9278254,"about_ca_system_score_codex":0.0002630551,"about_ca_system_score_gemma":0.00019145955,"threshold_uncertainty_score":0.9998971},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014334273,0.0009775661,0.9905463,0.0003581505,0.004554638,0.00028442754,0.0000034233021,0.00021113193,0.0016309639],"genre_scores_gemma":[0.5714449,0.000030009178,0.42468154,0.0011944361,0.0023817578,0.000003780612,0.0000045196625,0.00005614385,0.00020290758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962104,0.000033848803,0.0005849407,0.0013217429,0.0008507392,0.0009983083],"domain_scores_gemma":[0.99789333,0.00025014277,0.0003185334,0.0010991788,0.00012232049,0.00031648393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074976066,0.00058993214,0.0005570011,0.00087421987,0.000331726,0.0005764886,0.0026333274,0.00030474988,0.000032035023],"category_scores_gemma":[0.000043325832,0.0005761252,0.00017458003,0.00056055706,0.00044952723,0.001134933,0.0018564957,0.00074392423,0.00008790305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066612142,0.000030480018,0.00004850428,0.00002628485,0.000011886636,0.000055858687,0.00072819786,0.036660794,0.00114745,0.0073684636,0.000023545983,0.9538919],"study_design_scores_gemma":[0.0004209132,0.00012541389,0.00026394337,0.00043973653,0.000016368616,0.00027755805,1.4525621e-7,0.94183606,0.003264134,0.047755495,0.0043025054,0.0012977445],"about_ca_topic_score_codex":0.00007535842,"about_ca_topic_score_gemma":0.000036052083,"teacher_disagreement_score":0.9525941,"about_ca_system_score_codex":0.0005247148,"about_ca_system_score_gemma":0.0006463452,"threshold_uncertainty_score":0.999669},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003559503,0.0005946112,0.99172604,0.00019646226,0.0015101105,0.0002523394,0.000011769257,0.00009172137,0.0055813445],"genre_scores_gemma":[0.0918949,0.00007103499,0.9070027,0.0003584759,0.00026778362,0.0000066975495,0.0000068303416,0.000030987732,0.0003605949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681073,0.000017588558,0.00059414684,0.0011319416,0.00093925704,0.0005063197],"domain_scores_gemma":[0.9976294,0.0001729823,0.00041458049,0.0014634043,0.00019446078,0.00012518885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051460974,0.00041461102,0.00055893627,0.0006160675,0.00015569071,0.000111240864,0.002019938,0.00016751087,0.000022022494],"category_scores_gemma":[0.00005624663,0.00036705344,0.00011609424,0.00048915966,0.00060808694,0.0010167877,0.0014242586,0.00043014734,0.000030944717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038356848,0.00002127617,0.000029844821,0.000111643836,0.000013915381,0.00009017922,0.0007012382,0.036839005,0.000520503,0.6743603,0.000007960369,0.28730032],"study_design_scores_gemma":[0.0011430394,0.00046168326,0.0001265458,0.0043459483,0.00001980264,0.00018469029,7.3885286e-7,0.080002815,0.025403189,0.85884124,0.027313532,0.0021567952],"about_ca_topic_score_codex":0.00007219968,"about_ca_topic_score_gemma":0.00003718873,"teacher_disagreement_score":0.28514352,"about_ca_system_score_codex":0.0002553967,"about_ca_system_score_gemma":0.000568075,"threshold_uncertainty_score":0.99987817},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010492679,0.00022827936,0.99714726,0.00013802266,0.0006894705,0.00046317687,0.0000020403047,0.00035161045,0.00087521673],"genre_scores_gemma":[0.1290606,0.00002199758,0.87053794,0.0002158945,0.00008024812,0.000018599563,0.0000032931537,0.000030035775,0.000031385807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964061,0.000067619025,0.0006497468,0.0012464236,0.0009339129,0.0006962327],"domain_scores_gemma":[0.99817425,0.00039134952,0.0001379193,0.0010672465,0.0001249248,0.000104307976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012445385,0.0005087731,0.000534135,0.0012945804,0.00011956337,0.0002785588,0.0025376724,0.00031831363,0.0000039021998],"category_scores_gemma":[0.00018397497,0.000499427,0.00010972191,0.00079465844,0.00021727738,0.0012739298,0.0003402937,0.0008935924,0.000009841418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031858924,0.000016749325,0.000006073708,0.0000401135,0.0000024201845,0.00001539153,0.00086264435,0.84676194,0.00002839533,0.0029915303,2.587333e-7,0.14927126],"study_design_scores_gemma":[0.00032487907,0.00008744459,0.00001662335,0.00026235654,0.0000027804228,0.000009920826,1.615475e-7,0.93056035,0.00021384575,0.0680256,0.000020885705,0.0004751502],"about_ca_topic_score_codex":0.000019302754,"about_ca_topic_score_gemma":0.000008543968,"teacher_disagreement_score":0.14879611,"about_ca_system_score_codex":0.00053073146,"about_ca_system_score_gemma":0.0001739752,"threshold_uncertainty_score":0.9997457},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011759997,0.00071886904,0.9904244,0.00023544252,0.006386975,0.0013718792,0.000018376235,0.0001956798,0.00053080614],"genre_scores_gemma":[0.13030279,0.00056263787,0.8626959,0.0015577978,0.0038758758,0.00011608421,0.0002641604,0.00015132863,0.00047344802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504924,0.00007814712,0.0008271469,0.0022884225,0.000977218,0.00077982194],"domain_scores_gemma":[0.99590874,0.0007463259,0.00041743612,0.0025039492,0.00025630268,0.00016726444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030206437,0.0005463572,0.00056586636,0.002213917,0.00047060646,0.00060339156,0.003636382,0.0005951247,0.000007791191],"category_scores_gemma":[0.00024410304,0.00053173554,0.00009090437,0.0016483505,0.00030786556,0.0011928092,0.0021957215,0.0013219464,0.000012987912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006805141,0.000039650942,0.0000074652958,0.000108991495,0.0000073493025,0.000032989366,0.0002951766,0.026779404,0.00049739284,0.0028634337,0.00006057717,0.96923953],"study_design_scores_gemma":[0.00048593216,0.0003048207,0.00001893725,0.00060467416,0.000008599823,0.00015094767,2.8307713e-7,0.9574387,0.0014257663,0.023393853,0.015583032,0.0005844503],"about_ca_topic_score_codex":0.00031028892,"about_ca_topic_score_gemma":0.0042187735,"teacher_disagreement_score":0.96865505,"about_ca_system_score_codex":0.0006373052,"about_ca_system_score_gemma":0.00039235313,"threshold_uncertainty_score":0.9997134},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010794077,0.0029247496,0.96769214,0.00005044615,0.0021128699,0.0004843934,0.0000096930335,0.00008647841,0.015845176],"genre_scores_gemma":[0.97747636,0.00011362798,0.019140497,0.0005783096,0.0016088029,0.0000072278826,0.000036220667,0.000037940743,0.0010010133],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979554,0.000034143275,0.00032581005,0.0009758458,0.0002681774,0.0004406512],"domain_scores_gemma":[0.9989301,0.00004721707,0.00017597587,0.0006027781,0.00013065293,0.00011327867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051421806,0.0003531464,0.00034650596,0.0001407661,0.00012305244,0.00010874759,0.000936154,0.0005157238,0.000011947386],"category_scores_gemma":[0.00005239008,0.00027544991,0.00012965855,0.00011042169,0.000232045,0.0000051157945,0.0006078343,0.00031307232,0.000031027375],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017922028,0.000296656,0.00089001004,0.00033782973,0.00024253098,0.00035363453,0.00050165656,0.01098649,0.15646668,0.009522044,0.0006133804,0.8196099],"study_design_scores_gemma":[0.004609504,0.009798421,0.001594734,0.002505111,0.00027196828,0.001122558,0.0000027091596,0.12302496,0.28443885,0.07283832,0.48953846,0.010254405],"about_ca_topic_score_codex":0.000014592805,"about_ca_topic_score_gemma":0.00000962469,"teacher_disagreement_score":0.96668226,"about_ca_system_score_codex":0.00004932436,"about_ca_system_score_gemma":0.00018691804,"threshold_uncertainty_score":0.9999698},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059152037,0.00015293321,0.99586105,0.00016971197,0.000453013,0.00048315088,0.0000048639904,0.00041380673,0.0024023254],"genre_scores_gemma":[0.224238,0.000030422992,0.7753908,0.00018011489,0.00006472658,0.000016516062,0.0000042333236,0.000023562676,0.000051605817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721724,0.000021097663,0.00063424825,0.00082503795,0.00084248837,0.00045987827],"domain_scores_gemma":[0.99792176,0.00019113606,0.0002809984,0.0011362536,0.0003545609,0.00011529829],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006818079,0.00042483385,0.0005463993,0.00076116575,0.0000859744,0.00018162798,0.0026409263,0.00031279065,0.000013045682],"category_scores_gemma":[0.000009903721,0.0004003686,0.00012820587,0.00037882768,0.00033439862,0.0012379347,0.00049784145,0.0005842546,0.000009896445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013724083,0.0000053439767,0.0000011406564,0.000030254476,0.0000040704917,0.0000033147612,0.0008350957,0.35270938,0.000049235914,0.2583429,0.0000036606655,0.38801426],"study_design_scores_gemma":[0.00010666922,0.00012168014,0.000004893804,0.00034808693,0.0000033556653,0.000014661292,4.11217e-8,0.7937805,0.0011636869,0.20339859,0.00073061505,0.0003271902],"about_ca_topic_score_codex":0.00006537568,"about_ca_topic_score_gemma":0.000013882716,"teacher_disagreement_score":0.44107115,"about_ca_system_score_codex":0.00026677843,"about_ca_system_score_gemma":0.00031110327,"threshold_uncertainty_score":0.9998448},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010792778,0.0002244007,0.98108613,0.0014460874,0.0007670012,0.0007205393,0.00000758663,0.00014490908,0.004810589],"genre_scores_gemma":[0.8901416,0.00007335745,0.107660286,0.00014165214,0.000731243,0.00001717664,0.00003182312,0.000027419697,0.0011754165],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998104,0.000015277099,0.00030572497,0.00044135939,0.0008194854,0.00031419928],"domain_scores_gemma":[0.9983081,0.0007257217,0.00025137808,0.00017001276,0.00049093115,0.00005385695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018372368,0.00014153591,0.00021567775,0.0005709099,0.00049142016,0.00009537353,0.0007378528,0.00033454024,0.000010376117],"category_scores_gemma":[0.00085512834,0.00014569168,0.000051927374,0.0004216366,0.0006933512,0.00015867513,0.00013175502,0.00037394842,0.000004045299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006562788,0.0002834123,0.034925018,0.00036680466,0.000040967025,0.0000067092333,0.025734806,0.08271521,0.00017089775,0.22593985,0.00013560163,0.62961507],"study_design_scores_gemma":[0.0013670773,0.00063104444,0.002700806,0.004017169,0.00004564194,0.000004075415,0.00018150208,0.15202239,0.00056739117,0.81650347,0.020632043,0.001327391],"about_ca_topic_score_codex":0.00005731583,"about_ca_topic_score_gemma":0.0004672736,"teacher_disagreement_score":0.8793489,"about_ca_system_score_codex":0.00020265942,"about_ca_system_score_gemma":0.00052780425,"threshold_uncertainty_score":0.5941134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028858407,0.001027768,0.9952641,0.00036181443,0.00059914123,0.0007462404,0.000044046625,0.000040961342,0.0016273453],"genre_scores_gemma":[0.9792904,0.0000054106,0.02031872,0.000107771164,0.00016353771,0.0000111409,0.000024342275,0.000013783272,0.00006484911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669176,0.000105839834,0.0007884366,0.0010170075,0.001097225,0.00029973753],"domain_scores_gemma":[0.9951526,0.00057833066,0.0010949291,0.0026497233,0.00047707907,0.000047339207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012491036,0.0003130266,0.0005545159,0.0003649019,0.00013618598,0.00022100854,0.0042637386,0.0001702354,5.8069315e-7],"category_scores_gemma":[0.00003892909,0.0002049222,0.0000623609,0.00055884884,0.0009885757,0.00030355595,0.00046948314,0.00026233753,0.0000030474841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050456267,0.000074241005,0.0010349246,0.00034882085,0.000051498748,0.000029718567,0.0005834365,0.88412994,0.0011828846,0.044973373,0.00018653988,0.06735414],"study_design_scores_gemma":[0.00052070105,0.00020523202,0.0026768176,0.00043246546,0.00003239795,0.000029046436,8.4154794e-7,0.9789158,0.0004633784,0.016186833,0.00019857567,0.0003378715],"about_ca_topic_score_codex":0.00024949014,"about_ca_topic_score_gemma":0.0001003802,"teacher_disagreement_score":0.9790019,"about_ca_system_score_codex":0.000084475236,"about_ca_system_score_gemma":0.0005400536,"threshold_uncertainty_score":0.8356485},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034115327,0.00014604972,0.98554724,0.0019504144,0.00071585696,0.00047874945,0.0000047163726,0.00009152957,0.010724311],"genre_scores_gemma":[0.8603352,0.000030459249,0.13598213,0.0022902102,0.0002319583,0.000020511994,0.0000028877532,0.000051521474,0.0010551858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995726,0.00014824409,0.0005655656,0.0013042267,0.0015142806,0.00074170285],"domain_scores_gemma":[0.9942788,0.0025243945,0.0003862491,0.0023072085,0.00035994747,0.00014343833],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0024555086,0.0005159687,0.00058620406,0.0010028753,0.00042443335,0.00039860466,0.005290764,0.00023475682,0.000047784102],"category_scores_gemma":[0.00033353185,0.00034772084,0.00024229677,0.00093652,0.0032355993,0.0003014103,0.0011638465,0.00116426,0.000036612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100018615,0.0000142746485,0.000033650304,0.000016511132,0.000018690927,0.000013813165,0.0005226218,0.01096192,0.0006830127,0.8712774,0.000018942472,0.11642918],"study_design_scores_gemma":[0.00021156669,0.00032430363,0.000073349525,0.00034753632,0.0000063217394,0.00003356182,4.9137446e-7,0.20080966,0.004819701,0.7920001,0.00093150354,0.00044187088],"about_ca_topic_score_codex":0.000005695451,"about_ca_topic_score_gemma":0.000009644154,"teacher_disagreement_score":0.859994,"about_ca_system_score_codex":0.0001107158,"about_ca_system_score_gemma":0.0004738152,"threshold_uncertainty_score":0.9998975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036685586,0.00074590615,0.9917808,0.00450437,0.00050721335,0.00060842896,0.0000059649533,0.00021857115,0.0015920592],"genre_scores_gemma":[0.36951014,0.000008469417,0.6296122,0.00068490166,0.00008793026,0.000011608266,0.0000020165203,0.000021275031,0.00006146934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970537,0.00004977894,0.00043804137,0.0010519327,0.00094602176,0.00046056896],"domain_scores_gemma":[0.9973982,0.00041484527,0.00030869752,0.0015281504,0.0002466503,0.00010347167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010160629,0.0004225991,0.00043382647,0.0006245036,0.0002635737,0.0003478034,0.004971703,0.00019850495,0.000009488409],"category_scores_gemma":[0.00017973017,0.00030540684,0.0001150559,0.0011492914,0.0009766859,0.0003617504,0.0021135143,0.00080367445,0.000018518629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024356373,0.000032521213,0.000010980701,0.00004473116,0.000007995424,0.000015722595,0.0022983586,0.011659083,0.000052120744,0.8301607,0.000013897493,0.15570144],"study_design_scores_gemma":[0.00016576402,0.00014613573,0.000017623088,0.00042051967,0.000011122988,0.00004766255,4.0743936e-7,0.07568076,0.006587679,0.9164093,0.000121378216,0.00039161916],"about_ca_topic_score_codex":0.000043554428,"about_ca_topic_score_gemma":0.00006824006,"teacher_disagreement_score":0.36947346,"about_ca_system_score_codex":0.00032407805,"about_ca_system_score_gemma":0.00050695834,"threshold_uncertainty_score":0.9999398},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011985357,0.0008602409,0.9817392,0.000064741565,0.0014841997,0.0007126322,0.0000016185968,0.00010878772,0.0030431896],"genre_scores_gemma":[0.9862698,0.00008927681,0.009876058,0.00006897132,0.0004216202,0.000031946012,0.0000026674657,0.000058885144,0.0031808175],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9952745,0.00047911657,0.00054731034,0.0012646855,0.0015036738,0.0009307228],"domain_scores_gemma":[0.99535173,0.0027001866,0.00061176514,0.00078698364,0.0003626459,0.00018666295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033337136,0.0006407439,0.0007652229,0.00048575387,0.00056898093,0.0004012675,0.0019657817,0.00022142945,0.0000146112825],"category_scores_gemma":[0.00027293555,0.00040453806,0.00021932392,0.00048382278,0.0006511678,0.00048710877,0.000842604,0.0016101332,0.000061027913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095822447,0.00026974993,0.0030178118,0.0007781012,0.00075134606,0.0004384421,0.012523003,0.2749806,0.0056258375,0.21435064,0.0000016078264,0.48630464],"study_design_scores_gemma":[0.01726437,0.021470202,0.103672996,0.057024926,0.0012377391,0.001647073,0.00024971747,0.20902614,0.44322443,0.074066885,0.050708365,0.020407146],"about_ca_topic_score_codex":0.000027947985,"about_ca_topic_score_gemma":0.000007726632,"teacher_disagreement_score":0.9742844,"about_ca_system_score_codex":0.0003336349,"about_ca_system_score_gemma":0.00026214647,"threshold_uncertainty_score":0.9998407},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004210963,0.0018644339,0.9939431,0.00091529085,0.0010737511,0.0007795151,0.00036945962,0.00017265693,0.0008775802],"genre_scores_gemma":[0.009413441,0.000024991858,0.9867638,0.0021885755,0.00063884794,0.000046750163,0.00013814286,0.000047732014,0.00073776674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632615,0.000021847763,0.0005067362,0.0017063936,0.00080325693,0.000635615],"domain_scores_gemma":[0.993976,0.0009732127,0.00032145492,0.0044522374,0.00018465947,0.00009242338],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001068829,0.00049577263,0.0004694991,0.0003169346,0.00043932785,0.00033780606,0.0056309,0.00019297653,0.0000031247812],"category_scores_gemma":[0.00012276675,0.00034779593,0.000111198926,0.00038281456,0.00066291186,0.0010601054,0.0019987368,0.0005112725,0.000007856956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012712939,0.000023077397,0.000004891243,0.0000911504,0.000010968093,0.000038637096,0.00032377712,0.5855952,0.000082644125,0.09115557,0.0008351842,0.3218262],"study_design_scores_gemma":[0.00026636143,0.000041072,0.0000039369884,0.00025486803,0.0000084235035,0.000013218469,3.1940328e-7,0.9603383,0.00025679334,0.015599632,0.022770258,0.00044681213],"about_ca_topic_score_codex":0.00010212486,"about_ca_topic_score_gemma":0.0007465589,"teacher_disagreement_score":0.3747431,"about_ca_system_score_codex":0.00016959154,"about_ca_system_score_gemma":0.0009606698,"threshold_uncertainty_score":0.9998974},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009958024,0.00019458303,0.98268104,0.001468298,0.0004158635,0.0011672805,0.0000060412226,0.000029342815,0.004079516],"genre_scores_gemma":[0.97495824,0.000009351307,0.023408705,0.0010284394,0.0002124283,0.000043550917,7.772042e-7,0.00001680578,0.0003216842],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959542,0.0004105009,0.00079843163,0.0010215954,0.0013588391,0.0004564085],"domain_scores_gemma":[0.9783801,0.018740237,0.00057815865,0.0018815896,0.00035431053,0.000065635875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010444404,0.00030809426,0.0004339115,0.0002700225,0.00037567134,0.0004619643,0.0038623444,0.00017461344,0.00039898613],"category_scores_gemma":[0.0024045862,0.00015206359,0.00010753801,0.0014831905,0.0019393446,0.0001879623,0.0006326369,0.0007988401,0.000085346226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005251429,0.00007758754,0.00027544628,0.0000115317935,0.000012111932,0.0000034213294,0.0028558236,0.23724502,0.00083854614,0.1790135,0.0002566784,0.5793578],"study_design_scores_gemma":[0.00008040623,0.000085705426,0.0016567389,0.000117888056,0.000005146722,0.0000035646158,0.0000043163536,0.15769723,0.0013256884,0.83807206,0.00072951656,0.00022173303],"about_ca_topic_score_codex":0.00006777932,"about_ca_topic_score_gemma":0.00015667327,"teacher_disagreement_score":0.9650002,"about_ca_system_score_codex":0.00012671483,"about_ca_system_score_gemma":0.00038560748,"threshold_uncertainty_score":0.7177261},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008726271,0.00029539742,0.9955363,0.00023007447,0.0008189632,0.00028127778,4.7119832e-7,0.0002145159,0.0026142227],"genre_scores_gemma":[0.0054001105,0.000058334997,0.9923125,0.0019705917,0.000119682634,0.0000064364626,0.0000036345066,0.00002053393,0.00010817693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972384,0.000109211906,0.00048627047,0.001053704,0.00070127397,0.00041116722],"domain_scores_gemma":[0.99833983,0.00032387863,0.00026788295,0.00071237993,0.00016972727,0.00018629903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015858868,0.00035173443,0.000428837,0.0006623076,0.00021483056,0.00054344843,0.0013896102,0.00021091981,0.000023461374],"category_scores_gemma":[0.00019617722,0.00034003457,0.000049243175,0.00040258092,0.0005825475,0.00069967756,0.00095501833,0.00056204695,0.0000057546454],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001079833,0.000007960811,0.00011671031,0.000030174264,0.0000044277776,0.000019750283,0.00047726216,0.00096902327,0.00050150463,0.004909817,0.000017658387,0.99294466],"study_design_scores_gemma":[0.0002171438,0.00009113253,0.00008970916,0.00030323962,0.0000075335192,0.00007770255,1.4715913e-7,0.9210583,0.016626475,0.060440067,0.00056952273,0.0005190439],"about_ca_topic_score_codex":0.000039684193,"about_ca_topic_score_gemma":0.000028351984,"teacher_disagreement_score":0.99242556,"about_ca_system_score_codex":0.00016805717,"about_ca_system_score_gemma":0.00017309752,"threshold_uncertainty_score":0.99990517},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003613131,0.0006966423,0.99342084,0.00065822096,0.00034781775,0.00057565764,0.000024888259,0.000050242354,0.00061254454],"genre_scores_gemma":[0.6082142,0.000057074867,0.38990882,0.0015969716,0.00004888963,0.000033506938,0.000013915993,0.000028633756,0.00009799226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580437,0.00008714016,0.00083081186,0.0016126009,0.0010169857,0.00064807315],"domain_scores_gemma":[0.9972366,0.00035474196,0.00036772608,0.0014655137,0.0003647552,0.00021066846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011041041,0.00045763914,0.000768384,0.003951085,0.00015929276,0.00030303263,0.0027703631,0.0002209733,0.000031201416],"category_scores_gemma":[0.00008989683,0.0004282583,0.00021710346,0.0062426827,0.0003925523,0.0005726093,0.0004251182,0.0005022651,0.0000048490847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011197671,0.000962262,0.017005764,0.0006243087,0.00074467144,0.00047665866,0.04719664,0.50720847,0.0010909418,0.24603969,0.00016403188,0.17837457],"study_design_scores_gemma":[0.0024931184,0.0025297003,0.039878424,0.0028398896,0.0006688282,0.00006049344,0.00003825254,0.48107576,0.0073850458,0.45265627,0.004673045,0.005701191],"about_ca_topic_score_codex":0.00004416951,"about_ca_topic_score_gemma":0.0037845098,"teacher_disagreement_score":0.6046011,"about_ca_system_score_codex":0.00018713725,"about_ca_system_score_gemma":0.0003793664,"threshold_uncertainty_score":0.9998169},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076628556,0.004423267,0.97882193,0.00007624178,0.0010189575,0.00020311071,0.000021500067,0.00005079262,0.0077213286],"genre_scores_gemma":[0.84742856,0.0000831469,0.14872961,0.00053398195,0.0018465895,0.0000034465882,0.000012058279,0.00008896462,0.0012736532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970662,0.0000068673153,0.001054286,0.0011347353,0.00016170743,0.0005762184],"domain_scores_gemma":[0.9984682,0.00012021206,0.0006432841,0.0005829406,0.00007116351,0.00011419435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011227989,0.00040081097,0.00083430135,0.0011969553,0.00036842396,0.00041850036,0.00071103324,0.0002667811,0.0002914621],"category_scores_gemma":[0.000041862917,0.00044794302,0.00025037734,0.00052450004,0.0003308214,0.0002639666,0.00019995605,0.00047225822,0.000058723635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041899934,0.000020068223,0.00028266467,0.00007165411,0.00006172106,0.000048702794,0.00064864464,0.76185703,0.00007222484,0.019429145,0.000009453035,0.21749452],"study_design_scores_gemma":[0.00012931385,0.000043503464,0.00005742097,0.000170476,0.000009435997,0.00003229129,9.155643e-7,0.9812995,0.00002799894,0.012174825,0.005471326,0.00058300124],"about_ca_topic_score_codex":0.00022435586,"about_ca_topic_score_gemma":0.00040299483,"teacher_disagreement_score":0.83976567,"about_ca_system_score_codex":0.00031216786,"about_ca_system_score_gemma":0.000090732945,"threshold_uncertainty_score":0.9997972},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063360593,0.00012940481,0.9962558,0.00066146883,0.00094157347,0.0005775041,0.0000058200917,0.0007233156,0.00007148869],"genre_scores_gemma":[0.20971239,0.000008306312,0.78893965,0.0008105947,0.0003102472,0.000010707038,0.000015942544,0.000044381206,0.00014777039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946573,0.0000488643,0.00090209907,0.0015400425,0.0016796164,0.0011721083],"domain_scores_gemma":[0.9934206,0.004035384,0.0003726879,0.001496122,0.00038219974,0.00029303206],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011786696,0.00058202195,0.0005554628,0.00094850676,0.00025541277,0.0014366595,0.0031554757,0.00044705567,0.00009621342],"category_scores_gemma":[0.0012805703,0.0005698824,0.00012921347,0.0009450355,0.00041786706,0.001359621,0.0009189257,0.0014233121,0.00005913827],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024868611,0.00002472163,0.00064516545,0.000029898642,0.000015031531,0.00019410609,0.0011837058,0.013899055,0.00021555339,0.006376273,0.00004184351,0.97737217],"study_design_scores_gemma":[0.00041723312,0.00045758643,0.012978646,0.000895674,0.000015130688,0.00021093508,4.7463365e-7,0.7521886,0.0036374298,0.2265566,0.0010842854,0.001557384],"about_ca_topic_score_codex":0.000032865108,"about_ca_topic_score_gemma":0.000018353496,"teacher_disagreement_score":0.97581476,"about_ca_system_score_codex":0.00044191862,"about_ca_system_score_gemma":0.00057903235,"threshold_uncertainty_score":0.9996753},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41738933,0.000021953707,0.5820369,0.00026627185,0.000050661445,0.00014588723,6.847612e-7,0.00006661188,0.000021676342],"genre_scores_gemma":[0.65069664,0.0000047947215,0.34873027,0.0005165527,0.00003988303,0.0000047696894,3.9711824e-7,0.0000061130013,6.178511e-7],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989951,0.000012493557,0.00015483928,0.00041472146,0.00016328075,0.0002595466],"domain_scores_gemma":[0.9994244,0.00006790361,0.000045644847,0.0003566787,0.000049027556,0.000056337045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012183591,0.0001086911,0.00013814392,0.00023333411,0.0000832532,0.000019631862,0.00024960178,0.00004279317,0.000012261022],"category_scores_gemma":[0.00012467986,0.00008574638,0.000021372072,0.000911167,0.00020191162,0.00011250294,0.00015888261,0.00031549434,0.0000015200765],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024232764,0.00008491995,0.17693174,0.000025711675,9.971185e-7,0.00007465974,0.0013557218,0.00086527935,0.24501179,0.00007021385,0.0000041272197,0.5755506],"study_design_scores_gemma":[0.00051572913,0.00018561388,0.35822815,0.00019088766,0.0000054209495,0.00022385652,0.0000028805628,0.09389675,0.5158971,0.030551514,0.000058600912,0.00024353963],"about_ca_topic_score_codex":0.00004736367,"about_ca_topic_score_gemma":0.000023109706,"teacher_disagreement_score":0.5753071,"about_ca_system_score_codex":0.000056890196,"about_ca_system_score_gemma":0.000040166567,"threshold_uncertainty_score":0.34966362},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011284423,0.00082473125,0.9948627,0.0010123819,0.0014499159,0.00019438351,0.000027964274,0.00022286375,0.0012922412],"genre_scores_gemma":[0.72074693,0.000046849378,0.27622715,0.0014515978,0.0008671844,0.000014458503,0.000067138055,0.00004140909,0.0005372551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956343,0.0000366865,0.00056211447,0.0015434496,0.0013438766,0.0008795516],"domain_scores_gemma":[0.9968991,0.00033622223,0.0003320697,0.0019413212,0.00020656084,0.0002846853],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00088967144,0.0005867429,0.0005963236,0.00094028004,0.00029073464,0.0013729453,0.00353769,0.0002797551,0.00005919276],"category_scores_gemma":[0.0000962343,0.0005049217,0.00022384868,0.00078833976,0.0005414478,0.001583067,0.001572439,0.0006380738,0.00027513562],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048663806,0.00006233923,0.00014119846,0.000033066106,0.000028205934,0.000052617153,0.00018184286,0.022856396,0.0000654514,0.012661753,0.00019777054,0.9637145],"study_design_scores_gemma":[0.00083787506,0.00028046363,0.00030538742,0.0007769071,0.000057704987,0.00004767222,1.7033608e-7,0.9041166,0.0007450986,0.055932507,0.03509467,0.0018049445],"about_ca_topic_score_codex":0.00003418599,"about_ca_topic_score_gemma":0.000028127299,"teacher_disagreement_score":0.96190953,"about_ca_system_score_codex":0.00037414907,"about_ca_system_score_gemma":0.00057011266,"threshold_uncertainty_score":0.99974024},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029332796,0.000050532253,0.969016,0.00084879174,0.00036173372,0.0003312037,0.000010717101,0.000043563512,0.000004670971],"genre_scores_gemma":[0.90855277,0.0000016460888,0.09115372,0.000045733417,0.00009487303,0.000014261995,0.00012940179,0.0000070935002,4.887307e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989921,0.000024589139,0.00031943887,0.00021875401,0.00023123757,0.0002138901],"domain_scores_gemma":[0.99935853,0.00018277876,0.00008210001,0.00022355212,0.0001359382,0.00001709671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048048986,0.00011051781,0.00011530505,0.00011167547,0.0000935545,0.00006535997,0.00017363373,0.00007457478,0.0000014840945],"category_scores_gemma":[0.000111818445,0.00009197342,0.00002923712,0.0008818142,0.0001348887,0.0001799888,0.000009781566,0.00009614997,3.9719274e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008800748,0.000027099988,0.00039179352,0.00002700126,9.589935e-7,5.1030895e-7,0.000030498848,0.9870133,0.0075723114,0.0014310556,0.00004222025,0.0034544403],"study_design_scores_gemma":[0.00032627507,0.000052571842,0.00693044,0.000035377016,0.000003467251,9.42286e-7,4.8605585e-7,0.9556703,0.032160006,0.0046921717,0.000029296247,0.00009868435],"about_ca_topic_score_codex":0.00037595295,"about_ca_topic_score_gemma":0.0006511519,"teacher_disagreement_score":0.87922,"about_ca_system_score_codex":0.00016090256,"about_ca_system_score_gemma":0.000081204635,"threshold_uncertainty_score":0.3750567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000052576747,0.00022874922,0.9861289,0.00040995434,0.0007739985,0.00067395496,0.000004771044,0.0006773496,0.011097049],"genre_scores_gemma":[0.0067294603,0.00005347552,0.9904204,0.0016233834,0.00034199812,0.000036348447,0.000003956874,0.00005453446,0.00073642016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951465,0.00005657387,0.0005189019,0.0021132946,0.0011430135,0.0010217305],"domain_scores_gemma":[0.9964136,0.0006597838,0.00018205329,0.0022723142,0.00016865433,0.00030358994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077899185,0.0007566462,0.0006632634,0.0025878544,0.00022997225,0.00035821763,0.0051493947,0.0002964085,0.0000032088415],"category_scores_gemma":[0.00022585753,0.0007189632,0.00015823879,0.002103351,0.0004905194,0.0004680107,0.0018547436,0.0007711918,0.000055492466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030461226,0.000020623098,0.0000016510355,0.000037898568,0.000007501138,0.000049126607,0.00022103346,0.6638171,0.000010247849,0.0132308705,0.000037180198,0.3225637],"study_design_scores_gemma":[0.0008731629,0.00054103386,0.00045320363,0.00079646613,0.000016293792,0.00017180479,8.6883824e-7,0.76418215,0.001105767,0.21913557,0.009717122,0.0030065572],"about_ca_topic_score_codex":0.000012803494,"about_ca_topic_score_gemma":0.0000057489906,"teacher_disagreement_score":0.31955716,"about_ca_system_score_codex":0.00065049663,"about_ca_system_score_gemma":0.00059258286,"threshold_uncertainty_score":0.99952614},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060989973,0.00017062682,0.9957653,0.0003964139,0.000978534,0.00034199833,0.000021017544,0.00014584248,0.0021192457],"genre_scores_gemma":[0.35138312,0.0000089649175,0.64705664,0.0007517033,0.0004477594,0.000010080662,0.000033798,0.000019146393,0.00028882068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970192,0.00005738826,0.00043257422,0.0014232666,0.0005145796,0.00055303203],"domain_scores_gemma":[0.99750334,0.0006755873,0.00030935605,0.0010476853,0.00031392794,0.00015009611],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018660646,0.0004201603,0.0005541165,0.0009899505,0.00035835363,0.00043868023,0.0011352196,0.00030885928,0.00001811583],"category_scores_gemma":[0.00009695742,0.0003972363,0.00025733584,0.00069541356,0.00041183826,0.00038593033,0.00041085342,0.0004733622,0.000014745685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007117159,0.000027458758,0.00044138049,0.000039377144,0.00014580229,0.0000611752,0.0012173923,0.24954315,0.0004970358,0.06540929,0.000082827595,0.682528],"study_design_scores_gemma":[0.00013627496,0.000114385155,0.0001300371,0.00008941534,0.00006344108,0.000030205692,7.4150456e-8,0.952155,0.0013866635,0.044570584,0.00079858646,0.00052536133],"about_ca_topic_score_codex":0.00006855036,"about_ca_topic_score_gemma":0.00028728996,"teacher_disagreement_score":0.7026118,"about_ca_system_score_codex":0.00016388622,"about_ca_system_score_gemma":0.0004924237,"threshold_uncertainty_score":0.99984795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037984776,0.0016137837,0.9924045,0.00013541162,0.00040035817,0.00025474693,0.0000013497731,0.00012787242,0.0012634975],"genre_scores_gemma":[0.7988576,0.00007631896,0.20049092,0.00029161156,0.00007967922,0.000007289735,6.9043415e-7,0.000014314431,0.00018151001],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979957,0.000029784158,0.0004161926,0.0007528182,0.00049400976,0.0003115402],"domain_scores_gemma":[0.99864846,0.00014168373,0.00027086987,0.0007249176,0.00013558847,0.000078463214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007002226,0.0002943659,0.00039455763,0.00043178696,0.00014088866,0.00025684963,0.0015392778,0.00016426417,0.000018187658],"category_scores_gemma":[0.0000560265,0.0002290454,0.000051883384,0.0002626605,0.0008005091,0.0007389735,0.00068918284,0.00024478463,0.000009939876],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034029438,0.000026785106,0.00010578781,0.00019672886,0.000014541789,0.000021176731,0.003351837,0.0011982985,0.0038793802,0.086029105,0.0000068333884,0.90516615],"study_design_scores_gemma":[0.00015150018,0.00019302631,0.0002266504,0.0011538576,0.000008694817,0.000084249215,4.3130737e-7,0.5004805,0.037410665,0.45966533,0.00013283077,0.0004923008],"about_ca_topic_score_codex":0.000051537143,"about_ca_topic_score_gemma":0.000028221242,"teacher_disagreement_score":0.9046738,"about_ca_system_score_codex":0.0000629116,"about_ca_system_score_gemma":0.00030685426,"threshold_uncertainty_score":0.93402},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062065903,0.0026537431,0.98405325,0.00017006297,0.0040444434,0.0005388774,0.0000028176655,0.00023282619,0.007683307],"genre_scores_gemma":[0.8650953,0.00015262976,0.095340684,0.0005239006,0.0056906324,0.000062226085,0.0000093277695,0.00018579086,0.03293948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99410594,0.00011267156,0.0011112385,0.0020545663,0.0015261449,0.0010894476],"domain_scores_gemma":[0.99730325,0.00052175793,0.00045683802,0.0012635121,0.0002643042,0.00019033847],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018125089,0.00075893255,0.00088206097,0.0013674903,0.00027413492,0.0012675561,0.0034654876,0.0005166142,0.000010858406],"category_scores_gemma":[0.00010784128,0.00068057707,0.00018964129,0.00079149514,0.00033111428,0.00056739367,0.0013905612,0.001758056,0.00008003773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007192721,0.00006511455,0.0011085096,0.00019572597,0.00001721608,0.0007665159,0.0049040653,0.6202763,0.00008424581,0.25076213,0.000039730898,0.12177326],"study_design_scores_gemma":[0.00045010613,0.00045109808,0.0006304905,0.0065469258,0.000013160363,0.00032457165,0.000010335624,0.66421247,0.0007859246,0.021532718,0.3024112,0.0026310373],"about_ca_topic_score_codex":0.00053116254,"about_ca_topic_score_gemma":0.00012696466,"teacher_disagreement_score":0.8887126,"about_ca_system_score_codex":0.00089177955,"about_ca_system_score_gemma":0.00032702668,"threshold_uncertainty_score":0.9997692},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002837965,0.0014850274,0.9891714,0.0000123430955,0.00030346838,0.00006863986,0.000001876706,0.00007893502,0.0060403547],"genre_scores_gemma":[0.9725953,0.00029578977,0.026857335,0.00004040622,0.00008351708,0.0000016178492,0.0000022543586,0.000027652735,0.00009613799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985856,0.000004572255,0.00036365935,0.0003622042,0.0003478899,0.00033607346],"domain_scores_gemma":[0.99939835,0.00007252431,0.000059114707,0.00037072657,0.000046662903,0.000052617455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020593968,0.000247778,0.00040686203,0.00074270385,0.00004441374,0.000031106578,0.0004674479,0.00016592894,0.000011651295],"category_scores_gemma":[0.000019174542,0.00024015985,0.00008675317,0.0003575228,0.0001550851,0.00012449545,0.00011740314,0.0004493237,0.000008393687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.9358446e-7,0.0000032593462,0.00003286951,0.000053364744,0.000007234127,0.000024014915,0.00052075303,0.93374467,0.00018248137,0.000015604697,0.000002888859,0.06541195],"study_design_scores_gemma":[0.00009832847,0.000018547627,0.000020643982,0.00048595923,0.0000061922406,0.00002253236,2.2781394e-7,0.99543273,0.0010626989,0.0025749889,0.000033367975,0.00024376398],"about_ca_topic_score_codex":0.000041795935,"about_ca_topic_score_gemma":0.00017998555,"teacher_disagreement_score":0.9697573,"about_ca_system_score_codex":0.00016970522,"about_ca_system_score_gemma":0.000085438165,"threshold_uncertainty_score":0.9793434},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065755344,0.00027567038,0.99302965,0.00016940976,0.0030044739,0.00082618656,0.0000019249112,0.0002528401,0.001782279],"genre_scores_gemma":[0.8294866,0.00014887197,0.16865829,0.00082488346,0.0005458979,0.000026563019,0.000010862413,0.00008134005,0.00021668953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99391663,0.00016809162,0.0013300057,0.0021854157,0.0010659556,0.0013339268],"domain_scores_gemma":[0.9959345,0.0011896585,0.0007258859,0.0015803855,0.0003105462,0.00025901123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019913753,0.0008673958,0.0011857592,0.0013570695,0.0002648996,0.0006071757,0.0030908969,0.0005802361,0.000021540276],"category_scores_gemma":[0.000115660536,0.0008287989,0.00022816846,0.0010510875,0.00050144835,0.00058473897,0.0016018873,0.0015440361,0.00002230219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003952335,0.000037659018,0.00007077554,0.000016122218,0.0000108996,0.00017497627,0.00070358574,0.7601929,0.000035587218,0.009361102,0.0000020059888,0.22935489],"study_design_scores_gemma":[0.0011124488,0.00011762464,0.00006371477,0.0008801603,0.000009805637,0.000044548487,6.724781e-7,0.9922439,0.00035688689,0.00429368,0.000036215624,0.0008403405],"about_ca_topic_score_codex":0.00014752863,"about_ca_topic_score_gemma":0.0008549839,"teacher_disagreement_score":0.82882905,"about_ca_system_score_codex":0.0006963777,"about_ca_system_score_gemma":0.00032931558,"threshold_uncertainty_score":0.9994163},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019541617,0.00012399118,0.9975396,0.00018360396,0.00037271096,0.00024503746,0.0000047869535,0.000111529014,0.0012233505],"genre_scores_gemma":[0.15845437,0.000041939893,0.8371579,0.0035933214,0.00047536023,0.000007553777,0.000029870815,0.00003588164,0.00020378435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971842,0.000061980194,0.0005559731,0.0008383484,0.0009215617,0.00043793107],"domain_scores_gemma":[0.9983236,0.0004866451,0.00025368278,0.00073111546,0.00014315186,0.000061759216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018249546,0.00033229857,0.0003130862,0.0008610632,0.00024403339,0.0005938782,0.0021282965,0.00019415274,0.000006851015],"category_scores_gemma":[0.00018116852,0.00025742583,0.000077549565,0.00095058605,0.000540288,0.0007489623,0.00058905367,0.0005204238,0.0000067825795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037028478,0.000053531272,0.00019578724,0.000053336655,0.000004832395,0.000089193825,0.004918477,0.004386647,0.00020729643,0.047589134,0.000014042223,0.942484],"study_design_scores_gemma":[0.00013138344,0.00015536744,0.00012904374,0.0005023732,0.0000071141167,0.000058577843,0.0000069840403,0.95024854,0.0017184102,0.04286655,0.003510523,0.0006651468],"about_ca_topic_score_codex":0.00006520741,"about_ca_topic_score_gemma":0.0003279721,"teacher_disagreement_score":0.9458619,"about_ca_system_score_codex":0.00028765792,"about_ca_system_score_gemma":0.00026100804,"threshold_uncertainty_score":0.9999878},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000729941,0.00030190975,0.98616004,0.00019412441,0.001333991,0.00023716669,0.000011035492,0.00010599794,0.010925812],"genre_scores_gemma":[0.060925484,0.00004302509,0.9375241,0.00088739593,0.00053079455,0.0000028669133,0.000017525977,0.000022266648,0.000046553887],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99650806,0.00003477197,0.00059121504,0.0012740552,0.0009698296,0.0006220725],"domain_scores_gemma":[0.9975932,0.00017694877,0.00035109965,0.0014258703,0.00026514177,0.0001876954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011425529,0.00042006897,0.0005162272,0.00080837065,0.00016433619,0.00025245064,0.0028884215,0.00034388047,0.000016378777],"category_scores_gemma":[0.00003845312,0.00036920115,0.00013745468,0.0006622909,0.0006513133,0.00063165446,0.00079523685,0.0005730314,0.000019370089],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008436459,0.00006004377,0.000024030083,0.00003048456,0.000009052145,0.00014292648,0.0004158744,0.006422942,0.00020980548,0.10679537,0.000017475328,0.88586354],"study_design_scores_gemma":[0.00040815736,0.00073014805,0.0004597543,0.0002682981,0.000012275911,0.0002465331,1.6934361e-7,0.36125872,0.002543394,0.6322694,0.00087497535,0.00092820975],"about_ca_topic_score_codex":0.000041907533,"about_ca_topic_score_gemma":0.00004811019,"teacher_disagreement_score":0.8849354,"about_ca_system_score_codex":0.00017408942,"about_ca_system_score_gemma":0.00039186547,"threshold_uncertainty_score":0.999876},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013014974,0.0005365187,0.98352,0.000032479034,0.00016152604,0.00019872785,0.000038359387,0.00004302104,0.0024544206],"genre_scores_gemma":[0.9776457,0.00007221247,0.020581601,0.0004933972,0.00019855627,0.0000030023834,0.00008547889,0.000056677865,0.00086335896],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99738294,0.000026862075,0.0003874754,0.0012156542,0.00048912986,0.0004979155],"domain_scores_gemma":[0.99852675,0.00003128802,0.00023202549,0.0008226575,0.00024127914,0.00014599433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026069616,0.0005021632,0.0004017739,0.0003467376,0.00016883583,0.00016815396,0.00062978984,0.00039053924,0.000009325218],"category_scores_gemma":[0.00005415524,0.00044379258,0.00019218322,0.00023147227,0.0007749309,0.000011647864,0.00048945093,0.0002285435,0.000005082085],"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.00007221357,0.00010635398,0.000017225926,0.000026718559,0.00009355277,0.00010170146,0.000037645772,0.019415518,0.77374905,0.0003533854,0.000034522847,0.2059921],"study_design_scores_gemma":[0.00030206234,0.0004097417,0.0000079213505,0.00033954863,0.000066922454,0.00008923983,2.283852e-7,0.0358631,0.95228106,0.006039106,0.0035405692,0.0010605045],"about_ca_topic_score_codex":0.000007550588,"about_ca_topic_score_gemma":0.00000783608,"teacher_disagreement_score":0.9646307,"about_ca_system_score_codex":0.000107301516,"about_ca_system_score_gemma":0.00025798316,"threshold_uncertainty_score":0.9998014},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018443515,0.0011475027,0.9569627,0.00039766144,0.003034734,0.00052104105,0.000008426976,0.000090484566,0.035993077],"genre_scores_gemma":[0.8954818,0.00034854596,0.07633501,0.0069939084,0.0043436117,0.00013039859,0.000042892727,0.0002625345,0.016061297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996695,0.000054244036,0.0004435905,0.001088643,0.00086915,0.0008493977],"domain_scores_gemma":[0.9983487,0.00015116515,0.000096062075,0.0009839718,0.00014242904,0.00027765206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009310202,0.0003410639,0.0003565295,0.00064853963,0.00019925417,0.00009552173,0.001192477,0.00039127012,0.0009124745],"category_scores_gemma":[0.000032238982,0.00033016372,0.00007604635,0.00026109366,0.00044564303,0.00015102573,0.00048002484,0.0013145992,0.00041333566],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003241122,0.00008394747,0.00046352658,0.0000646835,0.000011212084,0.00067495846,0.0023845993,0.01982222,0.000013337386,0.01033039,0.00011676874,0.9660019],"study_design_scores_gemma":[0.0016571851,0.0011226643,0.00039469334,0.0015200457,0.00003202065,0.0004186462,0.0000092758555,0.7398637,0.00018313213,0.23845537,0.013928528,0.0024147474],"about_ca_topic_score_codex":0.00012870358,"about_ca_topic_score_gemma":0.00021130504,"teacher_disagreement_score":0.9635872,"about_ca_system_score_codex":0.00046113104,"about_ca_system_score_gemma":0.00037987455,"threshold_uncertainty_score":0.99991506},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006288857,0.00077466416,0.99610215,0.00019342192,0.0010224245,0.0003318977,0.0000026826158,0.000849133,0.00066073],"genre_scores_gemma":[0.08793488,0.00007344663,0.91107583,0.00030706098,0.00044296976,0.000020337558,0.0000022534891,0.000047161724,0.00009604755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962993,0.000022543063,0.00040875713,0.0013207752,0.0010839996,0.000864628],"domain_scores_gemma":[0.99769515,0.00017152238,0.00023675564,0.0015143043,0.00015489798,0.00022740115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007234717,0.0005962307,0.00051635207,0.00067752367,0.00018785965,0.00040953374,0.0032952542,0.00028220614,0.000015765068],"category_scores_gemma":[0.000010428524,0.00049894257,0.000089814974,0.000513886,0.0005321254,0.001134844,0.0010991894,0.00081778725,0.000023526258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043665473,0.000018440911,0.00013522693,0.000030575782,0.000011149621,0.00007785276,0.00051343965,0.025092252,0.00008387697,0.14901069,0.000012288967,0.8250098],"study_design_scores_gemma":[0.00048696203,0.0005689486,0.0002511015,0.0018691109,0.00002810999,0.00038820435,8.207047e-8,0.8256875,0.007812655,0.057690654,0.10241199,0.0028046328],"about_ca_topic_score_codex":0.000011850094,"about_ca_topic_score_gemma":0.00002356995,"teacher_disagreement_score":0.8222052,"about_ca_system_score_codex":0.00031149594,"about_ca_system_score_gemma":0.00030953524,"threshold_uncertainty_score":0.9997462},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029799528,0.0004413945,0.9955083,0.000048277983,0.0010854418,0.0005773409,0.00003587272,0.00027624558,0.0017291124],"genre_scores_gemma":[0.19910638,0.00012936989,0.80031425,0.0002164818,0.00012462103,0.000005263477,0.000026556138,0.000047379963,0.000029703424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952463,0.00008567,0.0009840433,0.0017151972,0.0013255965,0.00064322207],"domain_scores_gemma":[0.99537057,0.00041156597,0.0010652193,0.0024149213,0.0005421137,0.00019563492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066776125,0.0006991135,0.00088863587,0.001042074,0.00024156155,0.00025580017,0.004238919,0.00041244063,0.000045844903],"category_scores_gemma":[0.000073137395,0.00064055447,0.0001674851,0.0005195343,0.0010959395,0.0015237733,0.00328023,0.0008239847,0.000014367105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003437495,0.00009069644,0.00018325861,0.00012804878,0.000014393166,0.000094229945,0.00065758306,0.0048993514,0.020008242,0.011200577,0.000014263616,0.962675],"study_design_scores_gemma":[0.0004444405,0.0002171098,0.0005438029,0.002327847,0.00001783095,0.00009745166,2.5309674e-7,0.6118909,0.122084446,0.2604279,0.0008002571,0.0011477346],"about_ca_topic_score_codex":0.00013178874,"about_ca_topic_score_gemma":0.000036030036,"teacher_disagreement_score":0.9615272,"about_ca_system_score_codex":0.00028834995,"about_ca_system_score_gemma":0.00038502258,"threshold_uncertainty_score":0.9996046},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3057962,0.000007955285,0.6934025,0.0003468263,0.00015677857,0.00023567061,0.0000027436631,0.000032797238,0.000018460656],"genre_scores_gemma":[0.6120746,7.776012e-7,0.38758388,0.00024890355,0.0000639142,0.000016383738,0.0000045480515,0.0000056804665,0.0000012865145],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904495,0.000017309794,0.00016873646,0.0003561522,0.00017270177,0.00024012511],"domain_scores_gemma":[0.99946713,0.00010894232,0.000063352214,0.00026875394,0.000040652583,0.000051178577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028079783,0.000117449505,0.000103332844,0.00013507769,0.00007336344,0.00012820381,0.000284148,0.000027440867,0.00002358457],"category_scores_gemma":[0.000023419598,0.00010869851,0.000016137456,0.000692867,0.00012096784,0.0003859216,0.000022706108,0.00024797165,0.000001471222],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000087214485,0.000090048896,0.029699396,0.0000021760072,0.00000134692,0.0000010220689,0.0010038636,0.034023248,0.29344058,0.00053190195,0.000027348933,0.6411703],"study_design_scores_gemma":[0.0005950243,0.0002878195,0.0116544645,0.00005363232,0.0000013296255,0.000010241894,0.0000015394887,0.2993084,0.59355694,0.09332091,0.0007005603,0.0005091379],"about_ca_topic_score_codex":0.00013178482,"about_ca_topic_score_gemma":0.0000614372,"teacher_disagreement_score":0.64066124,"about_ca_system_score_codex":0.00004694548,"about_ca_system_score_gemma":0.00006312418,"threshold_uncertainty_score":0.44325966},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074566883,0.00023991009,0.9943787,0.0006414467,0.0008887664,0.0003003212,0.000008168512,0.00007861359,0.0027183965],"genre_scores_gemma":[0.74937034,0.00011900189,0.24977583,0.0003713587,0.0001976224,0.000008665606,0.000015715035,0.000022179533,0.00011928488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693286,0.00004269417,0.0006158466,0.0009507218,0.0009763816,0.00048147954],"domain_scores_gemma":[0.9976449,0.0003097213,0.0003846308,0.0011732822,0.0003627654,0.00012468093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008175501,0.0003353328,0.0003932037,0.001247151,0.00019348047,0.0004186048,0.002332757,0.000184746,0.00013488275],"category_scores_gemma":[0.00006418849,0.0003208321,0.00014845926,0.0010889362,0.00052529573,0.0007353223,0.00070573704,0.00042452436,0.000026502124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017866759,0.00010055324,0.0006231249,0.000072614625,0.000024658148,0.00002409632,0.0021455688,0.0035414898,0.0001745087,0.38868698,0.000063292755,0.6045413],"study_design_scores_gemma":[0.0006230977,0.0003930544,0.00055936555,0.00028438363,0.000020662706,0.000066396606,7.4760766e-7,0.5105755,0.0052317334,0.476024,0.0050719753,0.0011491505],"about_ca_topic_score_codex":0.000026216183,"about_ca_topic_score_gemma":0.000032733144,"teacher_disagreement_score":0.7486247,"about_ca_system_score_codex":0.0001250584,"about_ca_system_score_gemma":0.00024298656,"threshold_uncertainty_score":0.99992436},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053541422,0.000023279894,0.9412076,0.0034307316,0.0008987178,0.0007045718,0.000005618963,0.00016560144,0.00002249102],"genre_scores_gemma":[0.9044767,0.0000043674904,0.093987815,0.001198913,0.00014067629,0.00017072042,0.0000071817462,0.000009760738,0.0000038395306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970076,0.00015983368,0.0005146052,0.0011077577,0.00048819496,0.00072199426],"domain_scores_gemma":[0.997121,0.0012661365,0.0001727499,0.0011792893,0.00013307751,0.00012778549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020710086,0.00023622002,0.00038221083,0.0005327371,0.00019273092,0.0002993707,0.0019421012,0.00010330832,0.0000020992647],"category_scores_gemma":[0.000456099,0.00021530803,0.00008169175,0.0024055818,0.00029202574,0.0005313924,0.00055253494,0.0002527328,0.000010028705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047828486,0.0006828756,0.044222966,0.0002515356,0.000018600154,0.000012296059,0.0040564155,0.045958508,0.004745277,0.01230317,0.000541351,0.88715917],"study_design_scores_gemma":[0.00057686947,0.00007734192,0.020188462,0.00012248274,0.0000023753544,0.000011994729,8.614073e-7,0.95540863,0.008886994,0.013900621,0.00053268904,0.00029068562],"about_ca_topic_score_codex":0.0003355106,"about_ca_topic_score_gemma":0.0007344699,"teacher_disagreement_score":0.9094501,"about_ca_system_score_codex":0.00025222116,"about_ca_system_score_gemma":0.00034995607,"threshold_uncertainty_score":0.8780007},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005520642,0.001459268,0.9963613,0.00012862202,0.00060024805,0.00043261025,9.717209e-7,0.00020718806,0.00025768875],"genre_scores_gemma":[0.2652719,0.000018176781,0.73277384,0.00053387234,0.00046570075,0.000039741437,0.0000071852132,0.0000702585,0.0008192967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616426,0.00001850218,0.00040311317,0.0012302299,0.0013755624,0.00080832327],"domain_scores_gemma":[0.9974804,0.0008887648,0.00021803167,0.001156772,0.00010557431,0.00015049042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009095014,0.00057766784,0.0003620161,0.0005072768,0.00042015687,0.0006142324,0.00412634,0.0001817535,0.000024613877],"category_scores_gemma":[0.00026240767,0.00035978373,0.00006575822,0.0005170013,0.0006212201,0.0006655791,0.0017483396,0.0015412753,0.00005234707],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054179236,0.000015176832,0.000097097254,0.00003935467,0.000014146527,0.000089140514,0.009285938,0.0030864058,0.000021910446,0.00037056126,0.000009357151,0.9869655],"study_design_scores_gemma":[0.0020652812,0.0016013525,0.004460227,0.010869015,0.00007905418,0.0016444076,0.000059407852,0.85082495,0.046037033,0.025802165,0.046696316,0.0098608155],"about_ca_topic_score_codex":0.000014230523,"about_ca_topic_score_gemma":0.000090253656,"teacher_disagreement_score":0.97710466,"about_ca_system_score_codex":0.00063469756,"about_ca_system_score_gemma":0.0006886363,"threshold_uncertainty_score":0.99988544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007696333,0.00019300025,0.9949437,0.0018854138,0.000558958,0.0005269197,0.000008880427,0.00025252235,0.0016229353],"genre_scores_gemma":[0.0016286259,0.000022025259,0.99524194,0.0017748871,0.00070847286,0.00002523405,0.000031670366,0.000024564066,0.0005425755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964264,0.000019626548,0.0005171888,0.0016293013,0.0009162549,0.0004912337],"domain_scores_gemma":[0.99710596,0.00027097325,0.00025491702,0.0019520862,0.00018209378,0.0002339481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007067271,0.00046867557,0.00039451697,0.0008113188,0.00029728233,0.0008416186,0.0035335135,0.0003373877,0.00001651342],"category_scores_gemma":[0.00007387471,0.00043172718,0.00012056632,0.000810128,0.00022833719,0.00058268267,0.0005837963,0.00059191365,0.000060796425],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001535716,0.000022941533,0.0000016140141,0.0000033421027,0.0000018191903,0.000016960166,0.00004963164,0.008416855,0.0005874035,0.006260356,0.00043026224,0.9842073],"study_design_scores_gemma":[0.00023873536,0.00015777709,0.000048078535,0.00026398446,0.000006008742,0.000040073348,1.6433907e-8,0.8438459,0.0052028345,0.1383422,0.011306963,0.0005474266],"about_ca_topic_score_codex":0.00003531372,"about_ca_topic_score_gemma":0.00008616665,"teacher_disagreement_score":0.98365986,"about_ca_system_score_codex":0.00026693312,"about_ca_system_score_gemma":0.0010678004,"threshold_uncertainty_score":0.99981344},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045346163,0.00035372487,0.98834145,0.0016192395,0.0039596474,0.00043117904,0.000003214103,0.000144957,0.0046931216],"genre_scores_gemma":[0.7158471,0.00005130762,0.27325174,0.004542656,0.002829236,0.000023019533,0.000010811109,0.000067710294,0.0033764674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701744,0.000046391826,0.00042855932,0.0011236687,0.0008565227,0.00052740215],"domain_scores_gemma":[0.9971832,0.00040798172,0.00031569184,0.0018443783,0.00013164381,0.000117081654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00112751,0.0004029157,0.0003599794,0.0003648185,0.00038329762,0.0005643507,0.0039952085,0.0003654905,0.000042649663],"category_scores_gemma":[0.00008406179,0.00026991873,0.00013143678,0.00036366135,0.0005543027,0.00039620005,0.0010731482,0.0011170665,0.00017452441],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004460843,0.000041746378,0.0002264209,0.000056121087,0.000021637703,0.00016759924,0.0070812004,0.0035283922,0.0033949353,0.05921892,0.00013942865,0.92611915],"study_design_scores_gemma":[0.0009216885,0.0003153557,0.0035111322,0.00070434355,0.00002973826,0.00047625834,0.0000019044105,0.79763794,0.015584257,0.14415443,0.03425312,0.0024098621],"about_ca_topic_score_codex":0.0000900669,"about_ca_topic_score_gemma":0.00038259476,"teacher_disagreement_score":0.9237093,"about_ca_system_score_codex":0.00012365448,"about_ca_system_score_gemma":0.00025900544,"threshold_uncertainty_score":0.9999753},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03688449,0.000094028044,0.961718,0.00090407033,0.000031485382,0.00018933495,0.0000040283967,0.000090376394,0.00008415159],"genre_scores_gemma":[0.627116,0.000009767765,0.37245896,0.00032483067,0.00007557003,0.0000020836953,0.000007630948,0.0000034081977,0.0000017591741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992696,0.0000053611616,0.000113729235,0.00030987244,0.00012961435,0.00017180361],"domain_scores_gemma":[0.99948364,0.00011708599,0.000027859343,0.00028630416,0.00003872923,0.000046361176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010416158,0.000077708515,0.00010898663,0.000099557416,0.00008111851,0.000022993425,0.000096726944,0.000017345546,0.0000053155923],"category_scores_gemma":[0.000045110854,0.00006225592,0.000011635099,0.000584893,0.00025367865,0.00007604378,0.000085715954,0.00010347532,0.0000016666767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003988613,0.00029882457,0.023830967,0.0000633568,0.0000027355857,0.00016897883,0.00013678195,0.40794268,0.025323838,0.01047163,0.00023267009,0.53148764],"study_design_scores_gemma":[0.00040531388,0.000118587195,0.020779055,0.00012113172,0.000010651596,0.00016777041,3.2667847e-7,0.8975537,0.0458862,0.033470962,0.0013032671,0.00018305406],"about_ca_topic_score_codex":0.00020250752,"about_ca_topic_score_gemma":0.00004327475,"teacher_disagreement_score":0.59023154,"about_ca_system_score_codex":0.000036736892,"about_ca_system_score_gemma":0.000039067865,"threshold_uncertainty_score":0.25387225},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027891247,0.00029396854,0.96851575,0.00025233236,0.0012818847,0.0014897926,0.0000035916387,0.00010032623,0.00017107966],"genre_scores_gemma":[0.8578066,0.0000032443165,0.14134796,0.00046147555,0.00026299866,0.000023613979,0.00000273865,0.00002732816,0.00006400066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961915,0.00006977665,0.0007082509,0.0015122065,0.00095261086,0.00056562934],"domain_scores_gemma":[0.99783,0.00022767107,0.00029237804,0.0013063365,0.00014342295,0.000200216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009066882,0.00046776969,0.00050701795,0.001522001,0.00019144909,0.00046884688,0.00233561,0.00017468457,0.000015714475],"category_scores_gemma":[0.00011291512,0.00044929326,0.000082066625,0.0010224395,0.000101645564,0.0007804246,0.001128525,0.00045626808,0.000030386052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027074448,0.00033128852,0.0064276536,0.0001234567,0.000015328109,0.0008799517,0.02045442,0.7259919,0.0004470539,0.0026556784,0.0000031768236,0.242643],"study_design_scores_gemma":[0.0009179818,0.00054840406,0.017847931,0.0014389358,0.000014131105,0.000053592274,0.0000035514124,0.96932083,0.0005100331,0.008295706,0.000038941216,0.0010099405],"about_ca_topic_score_codex":0.0005711373,"about_ca_topic_score_gemma":0.0010360401,"teacher_disagreement_score":0.8299154,"about_ca_system_score_codex":0.0007035568,"about_ca_system_score_gemma":0.00055438845,"threshold_uncertainty_score":0.99979585},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021386814,0.0010909082,0.9813323,0.00020056454,0.0021766913,0.00018705668,0.0000053158783,0.0001275354,0.01466578],"genre_scores_gemma":[0.77933896,0.00006578487,0.21918586,0.0003562532,0.0007015899,0.000005926113,0.0000034820632,0.000029944924,0.00031217554],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727666,0.000030272939,0.0004463422,0.0008808965,0.00075186853,0.0006139656],"domain_scores_gemma":[0.99755585,0.00047941506,0.00027840718,0.0013351545,0.00017552126,0.00017565553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077617576,0.00038493596,0.0004479332,0.0019279228,0.00019708865,0.00017143112,0.002750974,0.00022675515,0.00006640654],"category_scores_gemma":[0.000055304743,0.00035252812,0.0002425085,0.0018733528,0.0006958567,0.0005674761,0.00090493594,0.0006330948,0.00005952664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004343049,0.00004073406,0.00013434756,0.000024116825,0.000013015795,0.000011430289,0.00028488747,0.00090414035,0.00012525868,0.3659526,0.000012717575,0.6324924],"study_design_scores_gemma":[0.00033577657,0.00046837586,0.0010816831,0.0003280904,0.000036004178,0.00016649526,2.6925542e-7,0.043034244,0.0032248045,0.9463336,0.003943751,0.0010469184],"about_ca_topic_score_codex":0.000011139662,"about_ca_topic_score_gemma":0.000019546487,"teacher_disagreement_score":0.7791251,"about_ca_system_score_codex":0.00012043063,"about_ca_system_score_gemma":0.0002472592,"threshold_uncertainty_score":0.99989265},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007801495,0.003514407,0.98948073,0.00008092248,0.0048826546,0.00040988758,0.000014798479,0.000036092893,0.00080035103],"genre_scores_gemma":[0.25891617,0.00093928917,0.73091346,0.0013766817,0.006017351,0.000025878242,0.00008373131,0.00009341929,0.0016340312],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99725986,0.000028681634,0.0006617771,0.0011246594,0.00036961475,0.00055543124],"domain_scores_gemma":[0.99751335,0.0011378556,0.00022539191,0.0007066866,0.00022666964,0.00019001582],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0017654811,0.0003430579,0.0005076831,0.00027950792,0.00013647793,0.00009722698,0.0009781742,0.0013191084,0.000011578844],"category_scores_gemma":[0.0013315064,0.00027986252,0.00021813504,0.00019985122,0.0008951806,0.0000033457943,0.00048665635,0.0005584575,0.000028684635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068679015,0.000059130398,0.000273961,0.000080690705,0.000025333087,0.000024658708,0.00003864008,0.0002802794,0.00011590591,0.0009203361,0.00079058355,0.9973218],"study_design_scores_gemma":[0.0025391157,0.0048128744,0.0005763126,0.0028018989,0.00012842598,0.00029179148,0.0000029098164,0.09906091,0.002057129,0.06874808,0.8165601,0.0024204883],"about_ca_topic_score_codex":0.0000017760375,"about_ca_topic_score_gemma":0.000028552702,"teacher_disagreement_score":0.9949013,"about_ca_system_score_codex":0.000056609864,"about_ca_system_score_gemma":0.0006074812,"threshold_uncertainty_score":0.9999774},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039206832,0.00017895605,0.994161,0.0016843941,0.0008222504,0.0003621755,0.00006440316,0.00004533789,0.0026422406],"genre_scores_gemma":[0.0054550096,0.00002557863,0.99288934,0.0008030962,0.0002580361,0.00003455657,0.00003099383,0.00002323685,0.0004801369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768263,0.000011482712,0.00043730915,0.0010037433,0.00047312997,0.00039168567],"domain_scores_gemma":[0.9977165,0.00057094323,0.00027331957,0.0010671732,0.0002626104,0.00010949386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052127056,0.0003022524,0.00034167807,0.00047200837,0.00019963236,0.00024868993,0.0023811192,0.00015323923,0.000010862596],"category_scores_gemma":[0.00009087898,0.00029580042,0.00011113683,0.00043867202,0.00039436354,0.00040445896,0.00053995807,0.00025924286,0.000010599343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004648399,0.00010888619,0.000115018775,0.00016321482,0.00003076029,0.0000034726131,0.0009317317,0.038407635,0.0010622176,0.1878378,0.001014002,0.7703206],"study_design_scores_gemma":[0.0002284538,0.00010432033,0.00005864642,0.00022097482,0.000009556924,0.000027224145,2.977013e-7,0.82894516,0.00064132374,0.16167781,0.0076228227,0.0004634137],"about_ca_topic_score_codex":0.000008354119,"about_ca_topic_score_gemma":0.00005246535,"teacher_disagreement_score":0.79053754,"about_ca_system_score_codex":0.00012621704,"about_ca_system_score_gemma":0.0005982508,"threshold_uncertainty_score":0.9999494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5971141,0.0010579186,0.40099147,0.0000057778443,0.00028563762,0.00026011342,0.0000056099466,0.00019517084,0.0000842275],"genre_scores_gemma":[0.9787377,0.000027421675,0.020653939,0.0000801858,0.00031875644,0.0000027154588,0.000009971082,0.00014537481,0.000023928234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968812,0.000035994242,0.000639319,0.0009363387,0.0006137994,0.0008933513],"domain_scores_gemma":[0.99854934,0.0002516927,0.00027064566,0.0005356893,0.00017343818,0.00021920433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036313126,0.00079837156,0.00088192924,0.00063041685,0.0002525487,0.00009630743,0.00070530345,0.0002832288,0.000016666529],"category_scores_gemma":[0.000038690345,0.0006841978,0.00012661362,0.0004954283,0.0004584559,0.00065499695,0.00012384262,0.0016691734,0.0000015925561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001809369,0.0000071948216,0.0002736576,0.00018972135,0.00002720896,0.000050965085,0.00080988253,0.88763887,0.10277056,0.000019947827,1.7441639e-7,0.008193752],"study_design_scores_gemma":[0.00032078067,0.00013886412,0.000023910115,0.0012208512,0.00006139598,0.00028403872,0.000004968364,0.9261079,0.07070604,0.00029175682,0.000016018694,0.0008235033],"about_ca_topic_score_codex":0.000059942377,"about_ca_topic_score_gemma":0.000100156765,"teacher_disagreement_score":0.38162363,"about_ca_system_score_codex":0.0003160034,"about_ca_system_score_gemma":0.0001581605,"threshold_uncertainty_score":0.9995609},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028129485,0.00013430532,0.98745114,0.0009033963,0.0021788434,0.0005277936,0.0000034614325,0.00038205564,0.0056060767],"genre_scores_gemma":[0.7583003,0.000018249762,0.23977394,0.0012726627,0.00028681077,0.000027493234,0.000002760852,0.00003698444,0.00028076363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962975,0.000076983284,0.0004667137,0.001887388,0.00059054536,0.00068086904],"domain_scores_gemma":[0.9969581,0.0006790517,0.00032049476,0.0015309328,0.0003019879,0.00020944478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057601254,0.0006591475,0.00062775495,0.0018240296,0.00039905982,0.0003773384,0.0031472633,0.00042674347,0.000042968193],"category_scores_gemma":[0.00030683802,0.00058659044,0.00012971164,0.00079196703,0.0007025316,0.0010253891,0.0028169388,0.0013492969,0.000070780996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032347736,0.000081669816,0.00011111292,0.00002590281,0.000056124933,0.000090674504,0.069198824,0.0032325317,0.00025806084,0.022264227,0.00003242621,0.9046161],"study_design_scores_gemma":[0.0004884225,0.0021854674,0.002368463,0.0026347365,0.00004375732,0.00028899038,0.00003388909,0.07582079,0.0027706393,0.9044005,0.006051575,0.0029127686],"about_ca_topic_score_codex":0.000069478105,"about_ca_topic_score_gemma":0.0004975034,"teacher_disagreement_score":0.9017033,"about_ca_system_score_codex":0.00039683556,"about_ca_system_score_gemma":0.00026027035,"threshold_uncertainty_score":0.9996585},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000538836,0.00057307223,0.9922862,0.0030374927,0.00079240574,0.00044225823,0.000025125073,0.0001630513,0.0026264933],"genre_scores_gemma":[0.04835368,0.00010804791,0.9494824,0.0011523122,0.0005106196,0.000044555025,0.00002445434,0.00002403976,0.000299914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99715865,0.00004379304,0.00047020908,0.0012087601,0.000515689,0.000602884],"domain_scores_gemma":[0.9970849,0.00077021355,0.00028664473,0.0013358506,0.00023748216,0.00028490744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006013392,0.00039275934,0.00044916215,0.00032580577,0.00053058536,0.0003285418,0.00081167434,0.0002799349,0.00003064314],"category_scores_gemma":[0.00021651809,0.00034211247,0.000072908646,0.00038099813,0.0010214514,0.0014565558,0.001320698,0.00066225,0.000047808284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000330345,0.000037590635,0.00021459592,0.00002677231,0.000009746483,0.000026008605,0.00045458914,0.00020094735,0.00012490255,0.7668258,0.000063478576,0.23201227],"study_design_scores_gemma":[0.000861864,0.000551352,0.008811673,0.00051857345,0.00005347295,0.002691215,0.000002173119,0.089429446,0.00030556467,0.42425323,0.46967632,0.0028451276],"about_ca_topic_score_codex":0.000031168947,"about_ca_topic_score_gemma":0.00020912607,"teacher_disagreement_score":0.46961284,"about_ca_system_score_codex":0.00021265539,"about_ca_system_score_gemma":0.0004629711,"threshold_uncertainty_score":0.9999031},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019372973,0.0008010426,0.993588,0.00021477717,0.0007504277,0.00045718392,0.0000028852787,0.00039023953,0.0036017555],"genre_scores_gemma":[0.04508514,0.000053418495,0.95329994,0.0009158291,0.0003680707,0.00000831516,0.0000020177831,0.000041871263,0.00022541784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965859,0.000041577467,0.00050932437,0.001261658,0.0007604327,0.0008410882],"domain_scores_gemma":[0.9978475,0.00026924413,0.00034561948,0.001148562,0.000202568,0.00018650272],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010372465,0.00055182417,0.0005119075,0.00079082086,0.00033607357,0.0009314961,0.002230173,0.00027926752,0.00002643025],"category_scores_gemma":[0.00008342466,0.00053497165,0.00007662723,0.00044640485,0.00084681803,0.0018766229,0.0024113748,0.0006546673,0.00001663188],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054468314,0.000038462316,0.00021125017,0.00013990137,0.000017368135,0.00012407504,0.0017786676,0.00046342873,0.012350301,0.0117536625,0.000057796613,0.97305965],"study_design_scores_gemma":[0.00026959658,0.00016375919,0.0001509697,0.00090219063,0.000019857494,0.0002257849,3.971459e-7,0.8271947,0.042819563,0.1254446,0.0014587643,0.001349792],"about_ca_topic_score_codex":0.000020107329,"about_ca_topic_score_gemma":0.00001143877,"teacher_disagreement_score":0.97170985,"about_ca_system_score_codex":0.00030863433,"about_ca_system_score_gemma":0.00027269265,"threshold_uncertainty_score":0.9997102},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008576272,0.00013924147,0.9959886,0.00028689732,0.0009782321,0.00034799366,0.000056097815,0.00006436331,0.0020528277],"genre_scores_gemma":[0.30917168,0.000038700633,0.68959045,0.0004856134,0.0002724812,0.000017842476,0.000018114848,0.00002219082,0.00038296077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715185,0.000015087276,0.00055267714,0.0010122675,0.00082716893,0.00044095746],"domain_scores_gemma":[0.99790394,0.000368862,0.0003789119,0.0007229851,0.0005087529,0.00011653493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050513976,0.00037391603,0.0004951587,0.0005787893,0.00018643796,0.0002334361,0.0017399675,0.0003198943,0.00004684587],"category_scores_gemma":[0.000068170506,0.00035519537,0.00015846072,0.00031245092,0.0010229925,0.00049399084,0.00042664228,0.00046610774,0.000023069952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001863798,0.00007524365,0.00006646824,0.00017758271,0.000043342647,0.000026153393,0.0009794516,0.06314741,0.00091771537,0.4067936,0.00020205992,0.52755237],"study_design_scores_gemma":[0.0002558199,0.00018072389,0.00004727874,0.00021034271,0.000008155141,0.0000806303,1.4305182e-7,0.6278618,0.002328035,0.3682872,0.00038894548,0.0003509421],"about_ca_topic_score_codex":0.000008975085,"about_ca_topic_score_gemma":0.000005755897,"teacher_disagreement_score":0.5647144,"about_ca_system_score_codex":0.00015477739,"about_ca_system_score_gemma":0.00057886547,"threshold_uncertainty_score":0.99989},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000045052234,0.00026383126,0.9956523,0.0015691413,0.00037928196,0.0005679298,0.0000029142395,0.00010042159,0.0014596281],"genre_scores_gemma":[0.10081918,0.00023422722,0.89543504,0.0019474782,0.0003903742,0.000042249594,0.0000038435805,0.000046965113,0.0010806458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996929,0.000058674712,0.00059852644,0.00095248147,0.00095628545,0.0005050411],"domain_scores_gemma":[0.9962774,0.0013075577,0.00038481655,0.0017341373,0.00020908895,0.000087007706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014965707,0.000349886,0.00036364383,0.00033895418,0.0004257971,0.00036344145,0.0047827577,0.0002123573,0.0000037738632],"category_scores_gemma":[0.000114327166,0.0002603394,0.00011593849,0.0006427014,0.0009843544,0.0003395119,0.0007468759,0.0006083663,0.000019181174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026832531,0.0000147358905,4.975639e-7,0.0000038075145,0.0000065556087,0.0000055018827,0.00030719425,0.081751235,0.00024053185,0.12145009,0.000019878513,0.7961973],"study_design_scores_gemma":[0.0001434128,0.00020697506,0.000030354657,0.00015882101,0.000007363828,0.000034972672,1.9989459e-7,0.7246428,0.0016764803,0.2706708,0.0020732826,0.0003545224],"about_ca_topic_score_codex":0.0000073703654,"about_ca_topic_score_gemma":0.000014957763,"teacher_disagreement_score":0.79584277,"about_ca_system_score_codex":0.00019936023,"about_ca_system_score_gemma":0.0006479301,"threshold_uncertainty_score":0.99998486},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008983784,0.0032273831,0.9901368,0.00036789294,0.00305965,0.00061242684,0.000076588694,0.00022293677,0.0022064948],"genre_scores_gemma":[0.77104163,0.00035750025,0.22321475,0.0011828865,0.0019932445,0.000037751783,0.000168191,0.00011723015,0.0018868273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941462,0.00006852001,0.0010441482,0.0025594975,0.0011927525,0.0009888449],"domain_scores_gemma":[0.99478316,0.0005473898,0.00042495385,0.003831426,0.00020212137,0.00021096793],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015797262,0.0007174257,0.0009526917,0.00083798094,0.00021859679,0.0014022082,0.00823581,0.00042134649,0.0000033364402],"category_scores_gemma":[0.00020229029,0.00067818974,0.00008978576,0.0009968479,0.00057217706,0.0017518406,0.0023706171,0.0009961753,0.00003502405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008464041,0.000052825784,0.00040513946,0.00014612677,0.000012010221,0.0004865273,0.00075219286,0.06671708,0.000100563266,0.01957662,0.00009335424,0.9116491],"study_design_scores_gemma":[0.00042146308,0.0000833501,0.00036874483,0.0017649273,0.0000037994698,0.00017246466,9.0027646e-7,0.95328176,0.00005912878,0.0034077556,0.039527565,0.00090814347],"about_ca_topic_score_codex":0.00021793904,"about_ca_topic_score_gemma":0.00039723658,"teacher_disagreement_score":0.910741,"about_ca_system_score_codex":0.00037042974,"about_ca_system_score_gemma":0.0004942578,"threshold_uncertainty_score":0.99963444},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026689484,0.00014657904,0.9744124,0.0008808131,0.0019063154,0.002058193,0.0000132019095,0.00018207022,0.020133575],"genre_scores_gemma":[0.9235873,8.737433e-7,0.06708826,0.0018374977,0.0049578333,0.00025514208,0.00013624506,0.00012998647,0.002006838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961635,0.00002351225,0.0005425321,0.0013538429,0.0013106107,0.00060598814],"domain_scores_gemma":[0.9966137,0.0005737997,0.00034901072,0.0006477969,0.0017899002,0.000025813622],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015704684,0.00048005284,0.00043748898,0.0022673747,0.00046162636,0.0011243967,0.0011938921,0.00018326486,0.000024842331],"category_scores_gemma":[0.00020809109,0.00041795836,0.00007034895,0.001534576,0.00049720367,0.0002853321,0.00045197626,0.00066939124,0.00010186718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037645976,0.00015991037,0.00024312949,0.0018492138,0.000044241366,0.000073892,0.00054319145,0.60965633,0.00009263501,0.046154078,0.009031323,0.33177558],"study_design_scores_gemma":[0.0018720286,0.00028260786,0.00021451454,0.0067952373,0.000040104183,0.000006344479,0.000013859587,0.24955563,0.0070173037,0.015350162,0.71662056,0.0022316568],"about_ca_topic_score_codex":0.00005116194,"about_ca_topic_score_gemma":0.00060269027,"teacher_disagreement_score":0.9233204,"about_ca_system_score_codex":0.00078615994,"about_ca_system_score_gemma":0.0009057324,"threshold_uncertainty_score":0.99991256},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011551478,0.00036358373,0.9927686,0.0009855042,0.00059838657,0.00051189,0.00001170867,0.000044698245,0.0035605123],"genre_scores_gemma":[0.83166933,0.00042336,0.16482775,0.0023624806,0.00029939128,0.000033842603,0.000019991325,0.00003369313,0.00033017114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703085,0.00008534194,0.00031352602,0.0009032519,0.0013656687,0.000301361],"domain_scores_gemma":[0.9975877,0.00049784797,0.0002208171,0.0013983069,0.00024310136,0.00005224219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031809143,0.00027156324,0.00027907567,0.00037818783,0.00023552093,0.0001908003,0.0018753624,0.00010200699,0.000016767388],"category_scores_gemma":[0.00021764704,0.00018765745,0.00006532385,0.00040269177,0.0008693115,0.0005002423,0.001172658,0.0003384921,0.0000063895727],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046062487,0.000048735634,0.000059896258,0.000028357466,0.0000133446365,0.000009092995,0.0010422888,0.0020057024,0.000013257708,0.19329937,0.00018950613,0.80328584],"study_design_scores_gemma":[0.00032410453,0.00019700757,0.0012611679,0.00022244155,0.000017941038,0.0000130199605,5.2507664e-7,0.5133452,0.00044503663,0.48195276,0.0018312713,0.00038952846],"about_ca_topic_score_codex":0.000020186159,"about_ca_topic_score_gemma":0.000060181374,"teacher_disagreement_score":0.8305142,"about_ca_system_score_codex":0.00007314931,"about_ca_system_score_gemma":0.00017858182,"threshold_uncertainty_score":0.7652449},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008859847,0.0010219725,0.9954419,0.00005221719,0.0006196003,0.0009481363,0.0000064630035,0.00007454887,0.0009491733],"genre_scores_gemma":[0.5774435,0.000041382766,0.42206568,0.0000926927,0.000103022365,0.000020803815,0.0000031508935,0.000026270414,0.0002035433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964224,0.000041408046,0.0006245524,0.0014556474,0.0006590262,0.0007969724],"domain_scores_gemma":[0.99768037,0.00034740733,0.0002650587,0.0012001195,0.00037769886,0.00012937479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017076333,0.0004671991,0.000698155,0.00091450615,0.00013686287,0.00020853773,0.0032927557,0.00037145903,0.000006975371],"category_scores_gemma":[0.00007519453,0.00040823914,0.00017824813,0.00056954805,0.00048794193,0.00049122074,0.0011811882,0.00072151254,0.000009942302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024399838,0.00033945014,0.0005726094,0.00083388516,0.000029803849,0.00008653377,0.028309148,0.5853718,0.0005088913,0.061896976,0.0000040022364,0.3220225],"study_design_scores_gemma":[0.00043841384,0.00014180892,0.000081791906,0.0005170476,0.0000056239874,0.000016333219,5.726726e-7,0.92257077,0.0013295888,0.07443617,0.00003469648,0.00042720177],"about_ca_topic_score_codex":0.0003478657,"about_ca_topic_score_gemma":0.0005319889,"teacher_disagreement_score":0.57655746,"about_ca_system_score_codex":0.00021839113,"about_ca_system_score_gemma":0.000543523,"threshold_uncertainty_score":0.9998369},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022146967,0.00014001463,0.99343246,0.0019379529,0.0032565661,0.00037080614,0.0000073112856,0.00020370547,0.0004297153],"genre_scores_gemma":[0.34115368,0.000034716893,0.65560615,0.0019956287,0.00073834794,0.000020847083,0.0000102056365,0.00003186515,0.0004085783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634147,0.000022805829,0.00063691364,0.0015249767,0.0007261117,0.0007477175],"domain_scores_gemma":[0.9975141,0.0006799779,0.00032748218,0.00068415864,0.00067769946,0.000116566494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011061076,0.0005382256,0.00063700904,0.00072644366,0.00065015844,0.0010153838,0.0030252354,0.00052496017,0.000026296117],"category_scores_gemma":[0.00017968452,0.00047650878,0.00023756131,0.0005114054,0.0006163406,0.0005246456,0.0007325095,0.0015038579,0.000031669828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055270248,0.000014319184,0.000009026918,0.00004011078,0.000030282697,0.000013703655,0.0007085458,0.0053483164,0.000060217044,0.90309423,0.00003398854,0.090641744],"study_design_scores_gemma":[0.00023794534,0.00017021675,0.000033138665,0.0003447958,0.000023742992,0.00006906652,3.3329468e-7,0.93061227,0.0018342943,0.040664442,0.025056694,0.000953064],"about_ca_topic_score_codex":0.000039112463,"about_ca_topic_score_gemma":0.0012927005,"teacher_disagreement_score":0.92526394,"about_ca_system_score_codex":0.0003544043,"about_ca_system_score_gemma":0.001050056,"threshold_uncertainty_score":0.9997687},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005336029,0.0005271812,0.9929756,0.00033062443,0.0013163881,0.00063146016,0.0000036100894,0.00013543227,0.0035461267],"genre_scores_gemma":[0.36050677,0.000047957106,0.637426,0.00126858,0.0005075137,0.000044889806,0.0000141491255,0.000032268013,0.00015186823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588245,0.000023296969,0.00069484336,0.0015452984,0.0011693443,0.0006847445],"domain_scores_gemma":[0.9980271,0.00023960829,0.00022359006,0.0011144289,0.00023426987,0.00016101419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092013646,0.00051981385,0.00046633903,0.0014998345,0.0002708591,0.00056325085,0.0031479523,0.00032311716,0.00003020605],"category_scores_gemma":[0.000069846814,0.0005283251,0.000117494754,0.001168216,0.0001706472,0.00096843095,0.0014596888,0.00088108686,0.000042461994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023454481,0.00002023192,0.000008142608,0.000025739375,0.0000019447818,0.000035662266,0.00038512034,0.6762911,0.000077571145,0.010421185,0.000002632533,0.31272832],"study_design_scores_gemma":[0.00035564753,0.000057188216,0.0000146645825,0.0002313691,0.0000027231788,0.000023613464,1.7051077e-7,0.76987714,0.0003825528,0.22839779,0.00019945009,0.00045766737],"about_ca_topic_score_codex":0.000056719717,"about_ca_topic_score_gemma":0.00012358263,"teacher_disagreement_score":0.35997316,"about_ca_system_score_codex":0.0006279099,"about_ca_system_score_gemma":0.0010353435,"threshold_uncertainty_score":0.9997168},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010154568,0.0003001808,0.9955159,0.0008632062,0.00090274465,0.00022851047,0.000010489755,0.00010777258,0.0019696448],"genre_scores_gemma":[0.039242867,0.000007535016,0.95913917,0.0010031618,0.0002703448,0.0000063836915,0.000015298558,0.000023785635,0.00029147763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995181,0.00008330961,0.000785842,0.001858208,0.0013224243,0.0007691673],"domain_scores_gemma":[0.99727654,0.0009327089,0.00032095265,0.0010665357,0.00021378804,0.00018945869],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012779682,0.000549061,0.0009315367,0.0031563074,0.00015569992,0.00048618874,0.0030107894,0.00030982622,0.00004369454],"category_scores_gemma":[0.00008427485,0.00050302077,0.00031284624,0.004649461,0.0005564621,0.00048157945,0.001119882,0.0009153433,0.000043775683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018889336,0.00004146564,0.0005478259,0.000012152074,0.000028600885,0.00010599588,0.000074005016,0.54759,0.0000054896154,0.007609889,0.000017568043,0.4439651],"study_design_scores_gemma":[0.00018527186,0.00006496407,0.00413363,0.00007015995,0.000020438205,0.000014316082,5.627071e-8,0.7882169,0.000034435136,0.20619951,0.0005384465,0.00052185735],"about_ca_topic_score_codex":0.000115444935,"about_ca_topic_score_gemma":0.00008645163,"teacher_disagreement_score":0.44344324,"about_ca_system_score_codex":0.0003623601,"about_ca_system_score_gemma":0.00036780155,"threshold_uncertainty_score":0.99974215},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048569782,0.000018020864,0.98950416,0.0009410851,0.00045823312,0.00038778264,0.0000014986039,0.000104891034,0.008535781],"genre_scores_gemma":[0.16870047,0.0001385584,0.818014,0.012243327,0.00036703894,0.00004700741,0.000027034479,0.000033684828,0.00042882803],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755025,0.000044509197,0.0005192421,0.00043898943,0.0012103522,0.00023664196],"domain_scores_gemma":[0.9976121,0.000827677,0.0004115338,0.0008282542,0.00025338816,0.00006701334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075831724,0.00021934147,0.00024292246,0.00058701716,0.00011179085,0.0002463681,0.0018777943,0.00014243486,0.000071031485],"category_scores_gemma":[0.00036560954,0.00015553362,0.000073544754,0.0006571823,0.00052899134,0.0009899337,0.000500627,0.00043006917,0.00004286432],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003832356,0.000016961261,0.000008683258,0.000013163412,0.0000041425524,0.0000062184786,0.0005620221,0.0016836183,0.00013800865,0.045146104,0.00018084965,0.9522364],"study_design_scores_gemma":[0.00031241184,0.00054250995,0.000121597644,0.0005512539,0.0000075814028,0.000035523695,0.0000010769046,0.4415913,0.080035284,0.47564554,0.0006362285,0.000519695],"about_ca_topic_score_codex":0.000016907454,"about_ca_topic_score_gemma":0.000004413381,"teacher_disagreement_score":0.9517167,"about_ca_system_score_codex":0.00012868272,"about_ca_system_score_gemma":0.00020238076,"threshold_uncertainty_score":0.63424766},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011429391,0.00031814116,0.99446034,0.0018290037,0.00096986885,0.00031118136,0.00003507882,0.00011968109,0.000813735],"genre_scores_gemma":[0.38555524,0.000056060297,0.6118749,0.00053522154,0.0014885535,0.000012980317,0.000011731685,0.000038719816,0.00042663986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950269,0.000115660485,0.00064141664,0.0015743679,0.0018209481,0.0008206978],"domain_scores_gemma":[0.9938773,0.0017578948,0.00014215027,0.0027418048,0.0011970112,0.00028382192],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0034639002,0.0004957304,0.0006142585,0.000884579,0.00039635046,0.0006214554,0.0063228123,0.0002122466,0.000021542444],"category_scores_gemma":[0.00063721015,0.00033888454,0.00022825402,0.0018697546,0.0008407501,0.0004288611,0.0020739369,0.00089910306,0.000024235744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000089313535,0.00004660785,0.00038174354,0.00003788703,0.000020381009,0.0000103947095,0.0012278687,0.16150258,0.00011866125,0.0010591527,0.00004801037,0.8355378],"study_design_scores_gemma":[0.00017471111,0.00014365067,0.0004710419,0.00015241536,0.0000068672416,0.0000032440507,8.329969e-7,0.9919933,0.0010270348,0.0011716686,0.004440046,0.00041516483],"about_ca_topic_score_codex":0.00008408995,"about_ca_topic_score_gemma":0.00022235328,"teacher_disagreement_score":0.8351226,"about_ca_system_score_codex":0.00020559318,"about_ca_system_score_gemma":0.0011932418,"threshold_uncertainty_score":0.9999063},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001959599,0.00012111773,0.9959203,0.0010804965,0.00021505776,0.0009821065,0.000035798337,0.00006792328,0.0013812388],"genre_scores_gemma":[0.69329923,0.00001244129,0.3013869,0.004129526,0.000235678,0.000042490865,0.000012881458,0.000055639128,0.00082522724],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859554,0.000005689454,0.00027112899,0.000573051,0.00031578724,0.00023878069],"domain_scores_gemma":[0.9984185,0.00016861696,0.00023487856,0.0009413827,0.00017440393,0.00006221821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001613208,0.00023737352,0.0003377474,0.0002448994,0.00009714655,0.000016715718,0.0006863071,0.00015848326,0.000028113482],"category_scores_gemma":[0.000061405,0.00016175924,0.00016796078,0.0002892293,0.0004914817,0.000039977025,0.00019604525,0.0004638209,0.0000018658786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034774124,0.00054454186,0.011581253,0.0015803849,0.00008274161,0.00006693524,0.0006247457,0.0027243772,0.017720357,0.1792677,0.002200274,0.783259],"study_design_scores_gemma":[0.0025394172,0.0013837214,0.017815983,0.0036428054,0.000271237,0.00031096936,3.7640132e-7,0.121520035,0.07939004,0.7284815,0.043185305,0.0014586515],"about_ca_topic_score_codex":0.000008621957,"about_ca_topic_score_gemma":0.0000073326364,"teacher_disagreement_score":0.78180027,"about_ca_system_score_codex":0.0000736644,"about_ca_system_score_gemma":0.00025468445,"threshold_uncertainty_score":0.659635},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011604585,0.0006767808,0.99489766,0.00044206931,0.0018504898,0.0004721993,0.000038005506,0.00017046958,0.00029186162],"genre_scores_gemma":[0.05533297,0.000037084497,0.94180876,0.0013735682,0.0011545066,0.00000854205,0.000024414167,0.000063433596,0.00019674521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563986,0.00012169876,0.0006833277,0.0016654845,0.0011101734,0.00077944365],"domain_scores_gemma":[0.99394417,0.0026424397,0.00050198735,0.0024331408,0.00027615228,0.00020213277],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000908865,0.0006300791,0.00069192564,0.0003632554,0.00034615773,0.00061995036,0.0068618148,0.00029295764,0.00005278309],"category_scores_gemma":[0.00014870326,0.00043746523,0.0001171424,0.00071483495,0.0007566748,0.00062620314,0.001644058,0.0011283219,0.000026013704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036342833,0.000072920164,0.000017178987,0.000013320665,0.000016734488,0.000046107856,0.00079341675,0.35168996,0.00037234326,0.0022750455,0.000036247686,0.6446631],"study_design_scores_gemma":[0.00019933142,0.0002742562,0.00020843816,0.0003247175,0.000009272291,0.000050837087,3.364507e-7,0.83632314,0.000719046,0.16107842,0.00035449627,0.0004576895],"about_ca_topic_score_codex":0.00038665143,"about_ca_topic_score_gemma":0.000026349453,"teacher_disagreement_score":0.6442054,"about_ca_system_score_codex":0.000112207956,"about_ca_system_score_gemma":0.0007037222,"threshold_uncertainty_score":0.9998077},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16440013,0.0003656962,0.83090836,0.00030030002,0.0008115879,0.00093305396,0.000051024126,0.00015663232,0.0020731941],"genre_scores_gemma":[0.98117745,0.00003841864,0.017184488,0.00059845287,0.0004734514,0.0000018181444,0.000012412055,0.000057432928,0.0004560524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972723,0.000020430805,0.0005912897,0.00081110216,0.0007980624,0.0005068011],"domain_scores_gemma":[0.99828804,0.00023126986,0.0003723692,0.00070507254,0.00023412786,0.00016910722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039659205,0.00046158175,0.0008192603,0.00096493826,0.00019359801,0.000034597688,0.00047325567,0.00036858712,0.00012837128],"category_scores_gemma":[0.00012812938,0.00039382448,0.0002705781,0.00032471598,0.00046166562,0.00013187891,0.00037561677,0.0007726296,0.000016251957],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009703184,0.0004564935,0.0007786476,0.0015016089,0.00040120524,0.0016255769,0.009853881,0.009886786,0.19824281,0.012539577,0.00015136263,0.7635917],"study_design_scores_gemma":[0.0062312405,0.010046599,0.006682629,0.009946149,0.00024047619,0.0013505687,0.0000025846568,0.42319125,0.32261497,0.21515086,0.000819878,0.0037228023],"about_ca_topic_score_codex":0.00002400589,"about_ca_topic_score_gemma":0.000013332674,"teacher_disagreement_score":0.81677735,"about_ca_system_score_codex":0.0003859932,"about_ca_system_score_gemma":0.00051425403,"threshold_uncertainty_score":0.99985135},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005671492,0.0005802839,0.9894395,0.00005928467,0.002352238,0.00042145848,0.000008892756,0.000060491286,0.0014063593],"genre_scores_gemma":[0.8843529,0.00023231481,0.11503392,0.00012924176,0.00013097795,0.000012972199,0.000003518786,0.000041664305,0.00006245007],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962373,0.0000980848,0.0008264584,0.00127294,0.00092151435,0.00064374827],"domain_scores_gemma":[0.9969842,0.00075299636,0.00051304576,0.0012669486,0.00035986758,0.00012294095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013804004,0.0004304221,0.00072788727,0.0027858082,0.00008023717,0.00007677946,0.0031950024,0.00028494906,0.000018173074],"category_scores_gemma":[0.0002182178,0.00040937364,0.00019141131,0.0014456832,0.0012333408,0.0011126762,0.0013611038,0.0009255453,0.000007095801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084617874,0.00015218556,0.0009070302,0.00027983144,0.000032899254,0.00011170008,0.0035134305,0.0034074213,0.0066793645,0.24465266,0.000009692126,0.74016917],"study_design_scores_gemma":[0.00037552678,0.0005021148,0.0005178208,0.0011072822,0.0000054874317,0.000037918126,0.0000012825888,0.026090644,0.0271517,0.943667,0.000062638275,0.00048058492],"about_ca_topic_score_codex":0.00009101263,"about_ca_topic_score_gemma":0.00021484902,"teacher_disagreement_score":0.8786814,"about_ca_system_score_codex":0.00020373985,"about_ca_system_score_gemma":0.00041149295,"threshold_uncertainty_score":0.9998358},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009491374,0.0012547863,0.9897019,0.000050759594,0.005470709,0.00042470326,0.0000030624813,0.00019701208,0.0019479309],"genre_scores_gemma":[0.121893875,0.0000451556,0.8740408,0.0006052574,0.00217731,0.000006397783,0.0000035725554,0.00009063362,0.0011369865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942781,0.00009944348,0.0008870002,0.002201019,0.00146607,0.0010683709],"domain_scores_gemma":[0.9969526,0.0001885929,0.0006639614,0.0015850728,0.00036256487,0.00024722324],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011956127,0.000837514,0.0007543993,0.0009111891,0.00073315145,0.0014483116,0.0037090783,0.0004598068,0.00006545922],"category_scores_gemma":[0.00004049692,0.0007525725,0.00023435603,0.0004477182,0.00040598828,0.0009302806,0.0017330332,0.0014124361,0.000068328176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007996503,0.000025730718,0.000085344735,0.000063489766,0.000041156083,0.00041454585,0.003524896,0.13080773,0.00537526,0.41328722,0.000023465318,0.44634318],"study_design_scores_gemma":[0.0005788378,0.0003560572,0.00016620896,0.0017818826,0.000020694213,0.0008066762,0.000004326396,0.7448455,0.0052783783,0.19098222,0.05200734,0.0031718516],"about_ca_topic_score_codex":0.00011120534,"about_ca_topic_score_gemma":0.000036740552,"teacher_disagreement_score":0.6140378,"about_ca_system_score_codex":0.00069034053,"about_ca_system_score_gemma":0.00045030532,"threshold_uncertainty_score":0.99958825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019766447,0.0002733611,0.9838078,0.01270135,0.0006396327,0.00081886456,0.000024700465,0.000051325955,0.0016631924],"genre_scores_gemma":[0.70681334,0.000028127697,0.26690507,0.007980001,0.001840346,0.00012697258,0.000029254868,0.00006114461,0.01621576],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99673057,0.0000568664,0.0006290915,0.0011227577,0.0011207596,0.00033995078],"domain_scores_gemma":[0.99527335,0.0024827656,0.00038325108,0.0014038407,0.00035603667,0.00010075389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033117323,0.00028181332,0.0003016606,0.00041588413,0.0011173801,0.00046076582,0.002473247,0.00021118943,0.0001485065],"category_scores_gemma":[0.0010121875,0.00017781313,0.00019597966,0.0006097406,0.0007037744,0.0002095339,0.0002776784,0.00042034476,0.00008658179],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012411744,0.000018595038,0.000007662853,0.0000021049218,0.00000424043,0.0000011115831,0.0005837874,0.03266243,0.000015957634,0.034054816,0.00019439297,0.9324425],"study_design_scores_gemma":[0.0002091443,0.000072122384,0.0006720078,0.00003503656,0.000013286218,0.000013365288,0.0000063623406,0.24342376,0.0000948456,0.39906123,0.35613456,0.00026428822],"about_ca_topic_score_codex":0.0000076831975,"about_ca_topic_score_gemma":0.00008152049,"teacher_disagreement_score":0.9321782,"about_ca_system_score_codex":0.00013288538,"about_ca_system_score_gemma":0.00015202502,"threshold_uncertainty_score":0.8594097},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016664865,0.0007861187,0.98878765,0.0002817813,0.002579636,0.00051370537,0.000022216624,0.00022278914,0.005139643],"genre_scores_gemma":[0.9197701,0.0000058265787,0.079500906,0.0003266105,0.00013202058,0.000014875998,0.00000773291,0.00003702388,0.00020485661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947655,0.00008237596,0.000818535,0.0020575374,0.0012846948,0.0009913534],"domain_scores_gemma":[0.99663544,0.0006444925,0.0004183856,0.0015414291,0.00049711304,0.00026311487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022494067,0.00066635164,0.00087764807,0.0010697164,0.00018533763,0.0006448889,0.0038085603,0.0003781033,0.000005816081],"category_scores_gemma":[0.0003738013,0.000630216,0.00014890826,0.0017332974,0.0005915819,0.00069823756,0.0013881782,0.0011408053,0.00005206076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013743083,0.00013952158,0.0007971564,0.00010772119,0.000014825665,0.00056141714,0.001067099,0.13652802,0.00020977958,0.028015269,0.00006559807,0.83247983],"study_design_scores_gemma":[0.00051061605,0.00020591295,0.0008097463,0.0009836768,0.0000039189495,0.00013728341,3.9736085e-7,0.90710163,0.00006073519,0.08852886,0.00087075564,0.0007864406],"about_ca_topic_score_codex":0.00014336349,"about_ca_topic_score_gemma":0.0005868502,"teacher_disagreement_score":0.91810364,"about_ca_system_score_codex":0.0007569184,"about_ca_system_score_gemma":0.0008109829,"threshold_uncertainty_score":0.9996149},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014884377,0.00048092767,0.57778853,0.0010387779,0.0026805615,0.00040881045,0.000010027125,0.00010254517,0.417341],"genre_scores_gemma":[0.6712268,0.0011713455,0.20784289,0.012553819,0.008462928,0.00006223587,0.000032893244,0.00018469978,0.098462395],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974787,0.000028392074,0.0002793588,0.0007780874,0.0008379385,0.0005974847],"domain_scores_gemma":[0.99877393,0.00020403149,0.0001473967,0.00043470578,0.00017217404,0.00026775894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007151141,0.00029532454,0.00033930296,0.00029465262,0.00018627146,0.0002852742,0.0010133596,0.00025245544,0.00025283336],"category_scores_gemma":[0.00019229263,0.00026247653,0.00011247884,0.00029980871,0.0014901333,0.00032944532,0.0003245215,0.00041778528,0.00009607852],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047112044,0.00002348296,0.0000150033175,0.000007706498,0.0000074605828,0.000041625866,0.014291353,0.0008398762,0.0000157854,0.025244374,0.0001021182,0.9594065],"study_design_scores_gemma":[0.00034582772,0.00032668977,0.00009375849,0.00052911224,0.000023458097,0.000006132593,0.000011747477,0.0047329725,0.0013418691,0.32362577,0.6677706,0.0011920017],"about_ca_topic_score_codex":0.00019536329,"about_ca_topic_score_gemma":0.0029757335,"teacher_disagreement_score":0.9582145,"about_ca_system_score_codex":0.0002753772,"about_ca_system_score_gemma":0.0006185388,"threshold_uncertainty_score":0.9999828},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002527936,0.000475857,0.9958681,0.0008387273,0.0010010931,0.0005613981,0.000060098086,0.0000854123,0.000856559],"genre_scores_gemma":[0.06589626,0.000031568772,0.92966425,0.0013520614,0.001121523,0.000023804723,0.000028375265,0.000056189365,0.001825947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722713,0.00001565227,0.00045925254,0.0011769015,0.00052375486,0.000597278],"domain_scores_gemma":[0.9982912,0.00026540653,0.00025651723,0.00079299,0.00023445062,0.00015946617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006009924,0.0004050771,0.0004436054,0.00036305955,0.00040644465,0.00079038733,0.0013137596,0.00019843529,0.000017905697],"category_scores_gemma":[0.000032611304,0.0003878965,0.0001063554,0.00033912965,0.000464731,0.00066739897,0.00057431904,0.00028483247,0.000015288317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001695035,0.00007920063,0.00005118572,0.0001196287,0.00005410861,0.00006912933,0.0019939905,0.06236921,0.0013032053,0.09311393,0.00041173506,0.84041774],"study_design_scores_gemma":[0.00041542592,0.0001416372,0.000043338623,0.0002492871,0.000012550303,0.00010283551,2.3839867e-7,0.9493725,0.00023264671,0.0212195,0.027606156,0.00060389016],"about_ca_topic_score_codex":0.00002354918,"about_ca_topic_score_gemma":0.00008656922,"teacher_disagreement_score":0.8870033,"about_ca_system_score_codex":0.00027063658,"about_ca_system_score_gemma":0.00038193434,"threshold_uncertainty_score":0.9998573},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006478875,0.00007958299,0.9937754,0.00032166808,0.00307833,0.0011343884,0.000012735244,0.00019918925,0.0013338799],"genre_scores_gemma":[0.062303387,0.0000066756274,0.9364847,0.0005581602,0.0004258523,0.000042878524,0.0000055820187,0.00003591039,0.00013683464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552155,0.0000648627,0.0006492799,0.0019880673,0.00091468194,0.0008615405],"domain_scores_gemma":[0.99548054,0.0009042693,0.00026234967,0.002551825,0.00056771305,0.00023333257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00369887,0.00050658465,0.0005386068,0.00059965625,0.00037108696,0.00051884685,0.004770482,0.00065020326,0.000021163238],"category_scores_gemma":[0.00032176476,0.00048060127,0.00018463992,0.00053488836,0.0017067465,0.00074746524,0.0012280623,0.0014764783,0.000023491775],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068119457,0.000020334817,0.00001862522,0.00006783915,0.000004972439,0.0000033339145,0.00039165103,0.0022764916,0.0020523567,0.09920121,0.0000019928252,0.8959544],"study_design_scores_gemma":[0.00023291304,0.00022768919,0.00014951179,0.00007417142,0.0000050619306,0.000029947209,1.1438522e-7,0.7387679,0.024786295,0.23402157,0.0011667288,0.00053807825],"about_ca_topic_score_codex":0.00003548067,"about_ca_topic_score_gemma":0.000070145215,"teacher_disagreement_score":0.8954163,"about_ca_system_score_codex":0.00045271488,"about_ca_system_score_gemma":0.0009771165,"threshold_uncertainty_score":0.99976456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029035192,0.0005566391,0.9962461,0.0002821927,0.00043295877,0.00037022,0.000010929605,0.00015412744,0.0016564925],"genre_scores_gemma":[0.08868075,0.000032889282,0.91030663,0.00073980255,0.00014893227,0.0000028314837,0.0000082777005,0.000023725484,0.000056180306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996814,0.00013087937,0.00059972703,0.0012255216,0.00077045505,0.00045942308],"domain_scores_gemma":[0.99730974,0.0005068238,0.000440314,0.001164743,0.00044272444,0.00013566752],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016085401,0.00049428665,0.0006864954,0.0007774944,0.00021750543,0.00035726174,0.0019002181,0.0003262878,0.000021517457],"category_scores_gemma":[0.00016624932,0.00043727734,0.00012311226,0.00057464925,0.0006684246,0.0007167071,0.00083157234,0.00068953633,0.000002663545],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046938985,0.000083995474,0.00028110488,0.00061936356,0.000037148282,0.000115508556,0.0016955289,0.004143648,0.0027256282,0.021690825,0.000036768117,0.96852356],"study_design_scores_gemma":[0.00081224274,0.0003144354,0.001414104,0.00053346006,0.000038884653,0.000068911315,8.461927e-8,0.70453054,0.029268216,0.26189327,0.00026421883,0.0008616331],"about_ca_topic_score_codex":0.000027461363,"about_ca_topic_score_gemma":0.000006979969,"teacher_disagreement_score":0.9676619,"about_ca_system_score_codex":0.00010625643,"about_ca_system_score_gemma":0.0003376011,"threshold_uncertainty_score":0.9998079},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047522626,0.00038721663,0.9929176,0.00054927246,0.00044075443,0.0004693978,0.000008981053,0.00014896334,0.0046025766],"genre_scores_gemma":[0.93874997,0.00005056305,0.060402945,0.00015650492,0.00015046781,0.000015177607,0.0000070684887,0.000035758694,0.00043154176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99493265,0.00023623083,0.00086860236,0.0013251114,0.0018866021,0.0007507807],"domain_scores_gemma":[0.9927793,0.0014496433,0.00068517897,0.0044448795,0.00048045855,0.00016051771],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001805007,0.00050063006,0.0009831291,0.0015009169,0.00048246083,0.00051814865,0.011143677,0.00031426203,0.00001815963],"category_scores_gemma":[0.00010331105,0.00036300803,0.00046059905,0.004857279,0.0011187975,0.00047201058,0.005304693,0.0011285756,0.000016274882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057639804,0.000025490062,0.0004903637,0.00006499485,0.00020445805,0.000023998506,0.0010008008,0.7566655,0.00036509245,0.028187182,0.000009591708,0.21295674],"study_design_scores_gemma":[0.00013044299,0.000026465057,0.000489486,0.0007840613,0.000047897513,0.000017582432,5.7471834e-7,0.99582374,0.0003969709,0.0016808755,0.00022747774,0.00037443652],"about_ca_topic_score_codex":0.00014157702,"about_ca_topic_score_gemma":0.00028050403,"teacher_disagreement_score":0.93827474,"about_ca_system_score_codex":0.0006500765,"about_ca_system_score_gemma":0.0005195973,"threshold_uncertainty_score":0.99988216},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050940484,0.00009577141,0.9891157,0.00011965923,0.0006105308,0.009176387,0.000002047021,0.00033721462,0.0005375918],"genre_scores_gemma":[0.030580984,0.00002128188,0.9631455,0.0009370756,0.0008237931,0.0041933875,0.0000047463764,0.0000413744,0.00025186402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690217,0.000046709112,0.00049123727,0.0013395865,0.0006173205,0.00060299144],"domain_scores_gemma":[0.9976844,0.00035480017,0.00046049594,0.0011637765,0.0001804848,0.00015599772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065548474,0.0004869485,0.00055620086,0.0010433885,0.0002562646,0.00062766095,0.0014273151,0.00028149495,0.000020675372],"category_scores_gemma":[0.00004155518,0.0004426503,0.00015185623,0.0011807147,0.00043619814,0.0024329796,0.0015037371,0.0008009562,0.000016785685],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015235828,0.000023718412,0.00022947867,0.000036443413,0.000051410392,0.000017288738,0.00032260045,0.022500424,0.000072192546,0.0055974694,0.000011298502,0.97112244],"study_design_scores_gemma":[0.0004157425,0.0006510003,0.0012271926,0.00058128283,0.00015480674,0.00024220119,4.133583e-7,0.4935435,0.003771996,0.48361385,0.01364955,0.0021484694],"about_ca_topic_score_codex":0.000026060183,"about_ca_topic_score_gemma":0.00008257958,"teacher_disagreement_score":0.968974,"about_ca_system_score_codex":0.00032915376,"about_ca_system_score_gemma":0.00011703927,"threshold_uncertainty_score":0.99980253},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000115148,0.00012870641,0.9932669,0.00008816981,0.001120918,0.0005328335,0.000013388842,0.00012357159,0.004610393],"genre_scores_gemma":[0.052610766,0.000014489847,0.94703627,0.00012427136,0.000114126626,0.0000073316346,0.000014146751,0.000013724084,0.000064883556],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688184,0.0000467625,0.0007857241,0.00094981014,0.00085791276,0.00047792916],"domain_scores_gemma":[0.9969131,0.00028639016,0.00054534007,0.0015276247,0.00061736116,0.0001101888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025040482,0.0003252762,0.00044083968,0.00057380804,0.00016722702,0.00014914162,0.0024139816,0.00031807707,0.000011753095],"category_scores_gemma":[0.00041347323,0.0003094259,0.00011561739,0.0008833002,0.0009306515,0.0007844419,0.000763479,0.0004745921,0.000010580897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005233698,0.00003721904,0.00012642471,0.00006015099,0.0000046181012,0.000004402377,0.00030226776,0.0042991666,0.000119167744,0.45930126,0.0000038241214,0.53573626],"study_design_scores_gemma":[0.00023332097,0.00025177884,0.0011101606,0.00030039417,0.000010796628,0.000047275986,1.3232389e-7,0.46097177,0.015807813,0.5191295,0.0015511718,0.0005858782],"about_ca_topic_score_codex":0.000015772617,"about_ca_topic_score_gemma":0.000027327924,"teacher_disagreement_score":0.53515035,"about_ca_system_score_codex":0.00036367637,"about_ca_system_score_gemma":0.00040612574,"threshold_uncertainty_score":0.9999358},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000038613307,0.0001766566,0.994561,0.0009647799,0.0012437976,0.0004339632,0.0000020605546,0.00022022105,0.00239365],"genre_scores_gemma":[0.06109742,0.000040488816,0.93704516,0.0010024764,0.0003513505,0.0000062513263,0.0000033530384,0.0000281527,0.000425377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962504,0.000058494843,0.00045762424,0.0013825758,0.0012051638,0.00064572325],"domain_scores_gemma":[0.9979669,0.00038834626,0.0001474218,0.0009961503,0.00028014978,0.00022106734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010640168,0.00043683904,0.0003683788,0.0009194152,0.00028068136,0.0005217016,0.0020160328,0.00029506264,0.000115212635],"category_scores_gemma":[0.000030652292,0.0004142541,0.00010212629,0.0006704688,0.0008339416,0.00034426802,0.0007865609,0.00077251956,0.00015855193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014404169,0.0000091722795,0.0000017556519,0.0000034218747,0.0000024381743,0.000019214564,0.00019589547,0.50355506,0.000009190662,0.0030799585,0.0000051412962,0.49311727],"study_design_scores_gemma":[0.00021904078,0.00008891215,0.00004490854,0.00010741885,0.0000036427248,0.00009525915,1.6471856e-7,0.9926246,0.00061284733,0.0052272175,0.0005187296,0.00045727234],"about_ca_topic_score_codex":0.000011795739,"about_ca_topic_score_gemma":0.000018977751,"teacher_disagreement_score":0.49266002,"about_ca_system_score_codex":0.00054192607,"about_ca_system_score_gemma":0.00087508844,"threshold_uncertainty_score":0.9998309},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011195463,0.00062433165,0.8549523,0.0007352941,0.0014492992,0.00033189444,0.0000055645864,0.00011131467,0.14177881],"genre_scores_gemma":[0.4124872,0.0013698939,0.5324798,0.01131395,0.01679421,0.000034766323,0.000054245178,0.0001959078,0.025270011],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968952,0.000047555004,0.00035839286,0.00079898606,0.0011742417,0.0007256219],"domain_scores_gemma":[0.99830043,0.0005486091,0.00021469581,0.00043828835,0.00029025174,0.00020774866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001866587,0.00030021011,0.00036537,0.0005712758,0.0007033048,0.00033087342,0.0012582478,0.00048198836,0.00012722757],"category_scores_gemma":[0.00020173524,0.0002815916,0.000106877604,0.00048822112,0.0019703181,0.0003269769,0.0002570681,0.0006884476,0.00007160078],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069237303,0.000010431663,0.000019230034,0.0000049011487,0.0000063325697,0.000052648855,0.0014766651,0.000522076,0.000004039511,0.0441592,0.000020463904,0.9537171],"study_design_scores_gemma":[0.0011934447,0.00025250026,0.00079545076,0.0005729752,0.00005482643,0.000026038226,0.000008227972,0.1239377,0.00015620938,0.29617578,0.5748837,0.0019431585],"about_ca_topic_score_codex":0.0010082308,"about_ca_topic_score_gemma":0.0032541296,"teacher_disagreement_score":0.95177394,"about_ca_system_score_codex":0.00040929925,"about_ca_system_score_gemma":0.00076676527,"threshold_uncertainty_score":0.99996364},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101974976,0.00022703526,0.9929664,0.0002083306,0.0010305231,0.00042024953,0.0000047936282,0.00042671172,0.0046139564],"genre_scores_gemma":[0.14428742,0.0000033168506,0.85446185,0.0008313805,0.0002891854,0.00001613453,0.0000046863256,0.00003878507,0.00006723332],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99618644,0.00002374699,0.00042558915,0.0018916309,0.0008935647,0.00057900796],"domain_scores_gemma":[0.9976143,0.00014939006,0.00018455328,0.0013816028,0.0003222056,0.00034795227],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007156822,0.0005636849,0.0005203857,0.0007705759,0.00022034183,0.0014080876,0.0035577363,0.0002800498,0.0000023024588],"category_scores_gemma":[0.00008630121,0.0004909339,0.00006767282,0.00051891216,0.00088498986,0.0015378708,0.0023029656,0.00057908165,0.000011926955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017512595,0.00015675327,0.00006551301,0.000071557864,0.0000121719895,0.0000578151,0.0006572765,0.0013203683,0.00020926824,0.16395855,0.000053593885,0.8334196],"study_design_scores_gemma":[0.00015139798,0.00037438868,0.00009130042,0.00023951373,0.0000064442174,0.000094055074,2.8468595e-8,0.2760037,0.0013855563,0.7207277,0.00024490748,0.0006810555],"about_ca_topic_score_codex":0.000034900422,"about_ca_topic_score_gemma":0.000017847755,"teacher_disagreement_score":0.8327386,"about_ca_system_score_codex":0.00009926731,"about_ca_system_score_gemma":0.00033979194,"threshold_uncertainty_score":0.99975425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022929956,0.00013263641,0.9897814,0.001045858,0.0014009405,0.0006472688,0.0000068956706,0.00018938421,0.0065663215],"genre_scores_gemma":[0.44433865,0.000011108484,0.55174154,0.003256082,0.0003710344,0.000042018513,0.00003227032,0.000019199108,0.0001881085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967207,0.000046837507,0.0008495148,0.001047215,0.0006957448,0.0006400071],"domain_scores_gemma":[0.99759334,0.00038816978,0.0002797874,0.00095278496,0.00064336555,0.0001425666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011889937,0.00047159326,0.0005214828,0.00058774307,0.00067225413,0.0006493137,0.0023610108,0.00033174685,0.000018668092],"category_scores_gemma":[0.00029222554,0.00045022406,0.00017256629,0.00032529776,0.0006791571,0.0015751441,0.00048591822,0.00073863636,0.000015093308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006371374,0.00002455336,0.0000037674204,0.000034226476,0.000009866587,0.000003373269,0.01910008,0.02572124,0.000011949411,0.64451367,0.000013992122,0.31055692],"study_design_scores_gemma":[0.00020711697,0.00012731344,0.0000010166324,0.000107791806,0.0000039268093,0.00001112971,0.000005302821,0.6062062,0.00008431949,0.3918106,0.0011286101,0.0003066646],"about_ca_topic_score_codex":0.00010150408,"about_ca_topic_score_gemma":0.0009796697,"teacher_disagreement_score":0.580485,"about_ca_system_score_codex":0.00052606204,"about_ca_system_score_gemma":0.0007910739,"threshold_uncertainty_score":0.99979496},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026810525,0.0006327963,0.9865697,0.0002966608,0.0011156054,0.00036290355,0.000028745884,0.00017879378,0.010787958],"genre_scores_gemma":[0.29066157,0.00018190297,0.70800316,0.000393976,0.00035826917,0.000018304745,0.000011104742,0.000042208412,0.00032949614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967458,0.000026439271,0.0007966185,0.0009343076,0.0009678481,0.0005289821],"domain_scores_gemma":[0.99777305,0.00022310497,0.00034318,0.0012025038,0.0003157214,0.00014241494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064552034,0.00041021447,0.0005919444,0.00056640233,0.00018810638,0.00026784753,0.0026928561,0.00026921733,0.00002352516],"category_scores_gemma":[0.000025509851,0.00037821897,0.00017550198,0.0007607989,0.00033863497,0.00080471917,0.00034628247,0.0005305385,0.000032625558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018654242,0.00010582232,0.000035522,0.00022039347,0.000029720228,0.000058097412,0.003751702,0.02709546,0.00009728001,0.06216335,0.00006179919,0.906379],"study_design_scores_gemma":[0.00030119112,0.0001282436,0.00005590659,0.0005227307,0.000009305151,0.000073214105,3.223941e-7,0.96375155,0.0007455835,0.027404021,0.006422464,0.00058548426],"about_ca_topic_score_codex":0.000016219441,"about_ca_topic_score_gemma":0.000013727664,"teacher_disagreement_score":0.93665606,"about_ca_system_score_codex":0.0001992499,"about_ca_system_score_gemma":0.000268029,"threshold_uncertainty_score":0.99986696},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008964516,0.00073122006,0.9922651,0.0005576345,0.00074894953,0.0002648604,0.000009988596,0.00009980191,0.005313496],"genre_scores_gemma":[0.396727,0.00008667626,0.6018348,0.00042427625,0.0004827556,0.0000065206405,0.0000148203335,0.000030029618,0.0003931477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669224,0.00005095606,0.0006050868,0.0012754386,0.0009307894,0.00044547967],"domain_scores_gemma":[0.9973125,0.00043834644,0.0004118284,0.0011819262,0.0005065728,0.00014885276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078513246,0.00040484485,0.00047516846,0.000737339,0.00017030034,0.00018227665,0.0018010598,0.00031104757,0.000056806868],"category_scores_gemma":[0.00013437647,0.00039196466,0.00013788971,0.0007233074,0.0005190073,0.00072990323,0.00061413075,0.0007464654,0.00001636545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000975038,0.000044698878,0.00003758959,0.0000198338,0.000016907645,0.000033027507,0.0008497593,0.3037988,0.000038464605,0.5121693,0.00003641303,0.18294543],"study_design_scores_gemma":[0.00019645657,0.00008697051,0.00006628457,0.00028944795,0.000007950902,0.000025954316,1.8901407e-7,0.8126608,0.00008067999,0.18619186,0.00006288121,0.00033051267],"about_ca_topic_score_codex":0.00003762573,"about_ca_topic_score_gemma":0.00002304263,"teacher_disagreement_score":0.508862,"about_ca_system_score_codex":0.00031387236,"about_ca_system_score_gemma":0.0003944935,"threshold_uncertainty_score":0.99985325},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010820945,0.0023741038,0.9900146,0.0008518696,0.0019979684,0.0006517669,0.0000072080966,0.00043405723,0.0025862958],"genre_scores_gemma":[0.4250722,0.00095245114,0.56847274,0.0040872497,0.00068792613,0.000022779788,0.000022942848,0.00013635289,0.0005453414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945722,0.00005638403,0.00064250396,0.001994776,0.0017068175,0.0010273132],"domain_scores_gemma":[0.9966745,0.0009240786,0.0003815196,0.0013646203,0.0003471785,0.00030812743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006293338,0.00080546504,0.0007985882,0.001582178,0.0008503329,0.00054680556,0.00297705,0.00026567842,0.000016427326],"category_scores_gemma":[0.00004707283,0.00067232345,0.00022105113,0.0017235798,0.0013052541,0.00048366789,0.0008381109,0.0012126162,0.000086794455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014698868,0.00013137939,0.000118654345,0.00019129518,0.000052031137,0.0005713552,0.0012583183,0.77712744,0.00003614768,0.009219559,0.00031520633,0.2109639],"study_design_scores_gemma":[0.0007906124,0.0008272447,0.0005231859,0.0041173096,0.000036018846,0.00088347716,5.64734e-7,0.97952175,0.00060832064,0.008852338,0.0024099532,0.0014291977],"about_ca_topic_score_codex":0.000031367996,"about_ca_topic_score_gemma":0.000025275081,"teacher_disagreement_score":0.4239901,"about_ca_system_score_codex":0.00025687928,"about_ca_system_score_gemma":0.0005828948,"threshold_uncertainty_score":0.9995728},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033733775,0.00022083079,0.9904099,0.000051646646,0.0035550834,0.0005075871,0.0000012083586,0.00029903062,0.0015813258],"genre_scores_gemma":[0.9006866,0.0000026643702,0.09613256,0.00023006614,0.0016033245,0.000014589004,0.0000039871575,0.000074858675,0.001251325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99427545,0.00012523234,0.001096601,0.0021447309,0.0012455854,0.0011123979],"domain_scores_gemma":[0.9972767,0.00050548033,0.00047535272,0.0012967238,0.0002268717,0.00021885829],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017060753,0.0007909657,0.0009016129,0.0013558342,0.0003858026,0.0011566554,0.002597491,0.0003766635,0.0000053406357],"category_scores_gemma":[0.00008196828,0.00075476593,0.00017175233,0.0006788734,0.00018117507,0.0007167566,0.00063246454,0.0014174312,0.000057093865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032045737,0.00002125738,0.000102097256,0.00006337032,0.0000054350194,0.00019275113,0.0019357556,0.83269626,0.00017021074,0.046333723,0.0000010508614,0.1184749],"study_design_scores_gemma":[0.00017836408,0.00027671334,0.00009762951,0.002982311,0.0000044858616,0.000052285635,0.0000055709397,0.9930821,0.00060556363,0.0013359281,0.00057700666,0.0008020388],"about_ca_topic_score_codex":0.00011255324,"about_ca_topic_score_gemma":0.00010957387,"teacher_disagreement_score":0.89731324,"about_ca_system_score_codex":0.0014508354,"about_ca_system_score_gemma":0.0004347743,"threshold_uncertainty_score":0.99988025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009405013,0.00043796745,0.98699814,0.0011184574,0.0014959336,0.00031302465,0.0000013722122,0.00016716428,0.00006290824],"genre_scores_gemma":[0.5523499,0.0000150610385,0.44717193,0.00026522708,0.00018010821,0.0000063253397,9.1349017e-7,0.000009835613,6.9824034e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643344,0.00014328367,0.00032391475,0.0016809788,0.0007228128,0.00069558347],"domain_scores_gemma":[0.9978885,0.00024717892,0.00021162083,0.001074824,0.00032679655,0.00025109889],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012173896,0.00044282805,0.0004667885,0.00045750252,0.0002836047,0.001445569,0.0021341213,0.00019221564,0.0000021722317],"category_scores_gemma":[0.00014941717,0.00034941864,0.000047318208,0.0013968772,0.00064739276,0.00081478135,0.003492508,0.00084334076,0.0000031756979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005621966,0.000018778534,0.0011145439,0.000028307984,0.000010757368,0.00004311305,0.0011709799,0.7277103,0.00026168462,0.000060091417,0.000017179444,0.26955867],"study_design_scores_gemma":[0.00025470468,0.000097878605,0.0009795344,0.00036303417,0.0000072532807,0.000033724536,0.0000015840944,0.9873117,0.002900779,0.007540146,0.000040253606,0.0004694007],"about_ca_topic_score_codex":0.00012168756,"about_ca_topic_score_gemma":0.00010000409,"teacher_disagreement_score":0.5429449,"about_ca_system_score_codex":0.00023226127,"about_ca_system_score_gemma":0.000918381,"threshold_uncertainty_score":0.99989575},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034774028,0.00009278211,0.99682194,0.00015638805,0.0007308338,0.00047237315,0.000011709328,0.000070133,0.0012961264],"genre_scores_gemma":[0.68691885,0.000018085999,0.31231096,0.00023983339,0.00009612553,0.000012009208,0.0000058059045,0.000028068456,0.00037026603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699646,0.000043639247,0.00073302054,0.001035952,0.00075083843,0.00044009366],"domain_scores_gemma":[0.9981746,0.000077505916,0.0004613047,0.0007572068,0.0004321301,0.00009724608],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064412825,0.00038303385,0.0005355957,0.0007907928,0.00015298801,0.00013077511,0.0022989882,0.00032454616,0.0000335444],"category_scores_gemma":[0.00008269101,0.00036493543,0.000090571906,0.0009020735,0.00032300263,0.0004783017,0.0008534381,0.0004318212,0.000024551091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001691597,0.00056567334,0.0013022217,0.0003829416,0.000047449143,0.00006709245,0.049434025,0.32013917,0.005290105,0.20997776,0.000071721064,0.4127049],"study_design_scores_gemma":[0.00036873223,0.000050708823,0.0011718062,0.00021313655,0.0000054916436,0.000006406242,3.6312198e-7,0.974917,0.0020231293,0.020761413,0.00005485794,0.0004269346],"about_ca_topic_score_codex":0.00017281443,"about_ca_topic_score_gemma":0.0003702809,"teacher_disagreement_score":0.6865711,"about_ca_system_score_codex":0.00028366817,"about_ca_system_score_gemma":0.0008649468,"threshold_uncertainty_score":0.99988025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010852231,0.00044530767,0.99668676,0.000070564965,0.0019030264,0.0005153667,0.000026081609,0.00017125925,0.00017076086],"genre_scores_gemma":[0.03376274,0.00002019417,0.9648882,0.0009192901,0.00025262157,0.000005525918,0.00007141573,0.000042366763,0.000037599057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618125,0.000044717704,0.00085037126,0.0010896582,0.0013506099,0.00048340813],"domain_scores_gemma":[0.99553365,0.0014007253,0.00076367415,0.0010914425,0.0010583575,0.00015217233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014548424,0.00042657516,0.0006683075,0.0019613572,0.00022504697,0.0008182812,0.002136939,0.0004582943,0.000005837499],"category_scores_gemma":[0.0007611445,0.00040271005,0.00016138647,0.0019192873,0.00035585288,0.0006142861,0.0005488366,0.00035641473,0.0000037668087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008193753,0.00008673242,0.0001284377,0.00053413416,0.000018536246,0.000015155716,0.00023352716,0.13109963,0.00004631251,0.41411948,0.00003329128,0.45367655],"study_design_scores_gemma":[0.00024291947,0.00012436,0.000037891823,0.0012495822,0.000017076945,0.000006299519,3.8132205e-7,0.9465381,0.0009132648,0.048766896,0.0016754535,0.00042776807],"about_ca_topic_score_codex":0.00001863077,"about_ca_topic_score_gemma":0.0000072525495,"teacher_disagreement_score":0.8154385,"about_ca_system_score_codex":0.0002614729,"about_ca_system_score_gemma":0.00080797385,"threshold_uncertainty_score":0.99984246},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027161968,0.00063158746,0.98760456,0.00024802575,0.00453346,0.00043745516,0.000032703978,0.00037881808,0.0058617806],"genre_scores_gemma":[0.09446939,0.00013187867,0.901814,0.0023160593,0.0009984489,0.0000047815106,0.000060639384,0.00004781984,0.00015702244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99539423,0.000029857238,0.0012457344,0.0010114403,0.0012931824,0.0010255346],"domain_scores_gemma":[0.9965555,0.00058016425,0.0007731835,0.0014672957,0.00030787595,0.0003159543],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017089479,0.0007772939,0.0008549758,0.0010545602,0.0004659165,0.0015644932,0.0034462174,0.00049142237,0.0000060118396],"category_scores_gemma":[0.000035946443,0.00069855934,0.00012260527,0.00089518307,0.0006413279,0.0012701773,0.0023451014,0.0009429528,0.00008376818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014744659,0.00007160127,0.00032418285,0.0015486918,0.00008545634,0.00020186705,0.010251211,0.043535918,0.000024014582,0.0630849,0.0002449203,0.8806125],"study_design_scores_gemma":[0.0004975816,0.00020294193,0.00006577467,0.0012309476,0.000012400694,0.00025350665,0.0000021753262,0.97795033,0.00005633189,0.013763207,0.005087789,0.00087699504],"about_ca_topic_score_codex":0.000056166227,"about_ca_topic_score_gemma":0.00007007035,"teacher_disagreement_score":0.93441445,"about_ca_system_score_codex":0.00021003034,"about_ca_system_score_gemma":0.00048414618,"threshold_uncertainty_score":0.9995465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027850454,0.0003014823,0.9871981,0.0002827328,0.0012089472,0.00034456962,0.000004711594,0.00015709247,0.010223844],"genre_scores_gemma":[0.43690568,0.000037614933,0.5594131,0.0014258468,0.0005555065,0.000016922975,0.000027920947,0.000044315235,0.0015730732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963578,0.00003300329,0.0003980749,0.0015144899,0.0011086401,0.000587995],"domain_scores_gemma":[0.9979761,0.0002105221,0.0002482928,0.0009688577,0.00036949664,0.00022669716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005299162,0.00052730925,0.00042138458,0.0007280629,0.00028730673,0.0004629424,0.002081941,0.00023966604,0.00005191479],"category_scores_gemma":[0.000023220502,0.00043844216,0.00011589821,0.00074547133,0.00057480595,0.0006523545,0.00067381316,0.00063816406,0.00009792928],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015095353,0.000039704475,0.00010793967,0.000023865501,0.000022552531,0.000067075125,0.0010497418,0.10631209,0.000064856926,0.07421684,0.000026091126,0.81805414],"study_design_scores_gemma":[0.0013984843,0.0017737318,0.0024792708,0.00083022425,0.00006173424,0.0010151428,0.0000011599938,0.67100596,0.0024486284,0.2856655,0.029488398,0.003831766],"about_ca_topic_score_codex":0.000021164517,"about_ca_topic_score_gemma":0.00015908178,"teacher_disagreement_score":0.8142224,"about_ca_system_score_codex":0.00017063043,"about_ca_system_score_gemma":0.00084587117,"threshold_uncertainty_score":0.99980676},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005195907,0.0041728625,0.9701079,0.00007895785,0.0027064914,0.00047982403,0.000029075041,0.0000850388,0.01714396],"genre_scores_gemma":[0.92846256,0.00002061248,0.06961376,0.00063336367,0.00097123143,0.000006646067,0.0000037158832,0.00006055327,0.00022753784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969055,0.000024761324,0.00085269933,0.0010878629,0.0001535595,0.00097558624],"domain_scores_gemma":[0.9981448,0.0002695563,0.0005914177,0.0007340551,0.0000668058,0.00019333062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030383917,0.00043946618,0.00084101135,0.0005395079,0.00033643964,0.0003156048,0.00096605107,0.0002741108,0.00009953627],"category_scores_gemma":[0.000118965036,0.00047866473,0.0001029073,0.0005422077,0.0002858264,0.0003530846,0.00045932762,0.000515156,0.00009245877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002687097,0.00003845957,0.006140079,0.0001613513,0.000038868915,0.00001814306,0.004150604,0.54077166,0.000057173405,0.41162634,0.000022171955,0.03694829],"study_design_scores_gemma":[0.00030737877,0.00011867744,0.00010134223,0.0011510387,0.00001130979,0.000039581428,0.000003022689,0.22231893,0.00014528462,0.7663086,0.0081585925,0.0013362599],"about_ca_topic_score_codex":0.00005019721,"about_ca_topic_score_gemma":0.000032644322,"teacher_disagreement_score":0.92326665,"about_ca_system_score_codex":0.00036460397,"about_ca_system_score_gemma":0.00010157318,"threshold_uncertainty_score":0.9997665},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03016636,0.00043136568,0.96577716,0.000009714837,0.001332136,0.0002458898,0.000007620792,0.0006743004,0.0013554421],"genre_scores_gemma":[0.8995533,0.000031725733,0.10009745,0.000079821206,0.00013860415,0.0000012367652,0.0000033135161,0.000076398916,0.000018178389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981463,0.000006964011,0.0004779176,0.0004807408,0.0004943736,0.00039369924],"domain_scores_gemma":[0.99913555,0.000119288015,0.00014620472,0.00040876315,0.00010813895,0.000082051214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053107797,0.0003387259,0.00037126482,0.00065973453,0.000077978075,0.00007925714,0.00036207872,0.00029564576,0.0000060614752],"category_scores_gemma":[0.000021911585,0.0003375676,0.000045030865,0.00034721452,0.00044165814,0.00032259742,0.00012619662,0.00045537268,0.000001882386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008644319,0.000007137456,0.0004625437,0.0002585227,0.00002479234,0.000019318397,0.0013512408,0.9394119,0.0099166185,0.00015948748,0.00002542234,0.048354384],"study_design_scores_gemma":[0.00021070288,0.000060178983,0.00042153418,0.000789043,0.000011862992,0.000049970866,2.7523615e-7,0.99247116,0.0048905704,0.00068537955,0.00010185885,0.00030748677],"about_ca_topic_score_codex":0.000011665404,"about_ca_topic_score_gemma":0.000010659564,"teacher_disagreement_score":0.8693869,"about_ca_system_score_codex":0.00023862845,"about_ca_system_score_gemma":0.00008485279,"threshold_uncertainty_score":0.9999076},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015667171,0.00032250505,0.99374574,0.0011747681,0.0025300272,0.00063081656,0.000010215957,0.00048041507,0.0009488524],"genre_scores_gemma":[0.059463028,0.000057380596,0.9352287,0.004172264,0.000675178,0.000022586646,0.000030465188,0.00007980298,0.0002705931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941532,0.000057228277,0.0007846306,0.0024024562,0.0016231292,0.0009793804],"domain_scores_gemma":[0.9961992,0.0002889078,0.00048057042,0.0019868468,0.0007200262,0.00032445233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009554289,0.00084043393,0.0006337565,0.0013139538,0.00037188843,0.0006552441,0.0038638161,0.00048929575,0.00008626974],"category_scores_gemma":[0.00012783166,0.0008325568,0.00019664368,0.0016502775,0.0005730103,0.0015287244,0.0015794435,0.0012559036,0.00042973302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030147454,0.00021625205,0.000039265793,0.00017656088,0.000027266582,0.00035457403,0.0023603227,0.16103888,0.011856572,0.040342852,0.000025623858,0.78353167],"study_design_scores_gemma":[0.0014510994,0.0003212016,0.0003285155,0.0010860155,0.00001949998,0.00017969935,3.7736635e-7,0.90552515,0.005943824,0.081447445,0.002168632,0.0015285384],"about_ca_topic_score_codex":0.00018871139,"about_ca_topic_score_gemma":0.00019575752,"teacher_disagreement_score":0.78200316,"about_ca_system_score_codex":0.0013170022,"about_ca_system_score_gemma":0.0012885196,"threshold_uncertainty_score":0.99941254},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15985116,0.000005142949,0.8388222,0.0001267561,0.00093023403,0.000120358025,6.7928187e-7,0.00012891927,0.000014539684],"genre_scores_gemma":[0.4951605,2.7077513e-7,0.50455576,0.00019967018,0.000076543765,6.1557523e-7,7.901732e-7,0.000005038548,8.3983355e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811405,0.000044992375,0.00027841178,0.00069075456,0.00045729175,0.0004144918],"domain_scores_gemma":[0.9984619,0.0005214483,0.000118881064,0.0005730311,0.00020528171,0.0001194561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005704527,0.00018443586,0.00015732255,0.0003755484,0.0003058848,0.0004360342,0.00096567074,0.0000678844,0.000023929862],"category_scores_gemma":[0.00031411694,0.00016782747,0.00004522986,0.0012992331,0.00029588808,0.002134066,0.0004470829,0.00037075728,0.00003772017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027697545,0.000037568003,0.0006547327,0.000001989724,8.8371695e-7,0.000005099651,0.00047996923,0.29770887,0.6055545,0.00006430413,9.77324e-7,0.095488325],"study_design_scores_gemma":[0.00025076664,0.000025820502,0.0035211416,0.000026007767,0.000001098406,0.00003934975,3.555904e-7,0.97742045,0.016485656,0.0020174067,0.0000082792585,0.00020365715],"about_ca_topic_score_codex":0.00004622613,"about_ca_topic_score_gemma":0.000013417987,"teacher_disagreement_score":0.6797116,"about_ca_system_score_codex":0.00007861245,"about_ca_system_score_gemma":0.00015312321,"threshold_uncertainty_score":0.68438053},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038015618,0.00046624948,0.99017644,0.0015031756,0.001815732,0.00074728,0.0000031021364,0.0006469609,0.0042609186],"genre_scores_gemma":[0.04269759,0.000037431568,0.9515741,0.0018708006,0.0015617824,0.000030401305,0.00001578946,0.000120097066,0.0020920162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938926,0.000058260728,0.0007534085,0.0024212894,0.0015535329,0.0013209053],"domain_scores_gemma":[0.9961754,0.00039897993,0.0004214405,0.0022872256,0.00033435828,0.0003825661],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00091469265,0.00089055515,0.000888641,0.00094534433,0.00042631078,0.001470702,0.0058650672,0.00048619564,0.00008685541],"category_scores_gemma":[0.00006632331,0.0007858254,0.0002667931,0.0008989288,0.0009277073,0.0006086703,0.0026183506,0.0015343601,0.0008886925],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019572246,0.000061766565,0.000007565955,0.000036320453,0.000017519142,0.00007035727,0.00042207807,0.013799821,0.0001217356,0.022086704,0.00005168611,0.96332246],"study_design_scores_gemma":[0.0001867743,0.0002895447,0.0000453895,0.0005076622,0.000006806049,0.00009607388,4.0514088e-8,0.77946645,0.0002086867,0.21565592,0.00270966,0.00082698493],"about_ca_topic_score_codex":0.00004498239,"about_ca_topic_score_gemma":0.000011210505,"teacher_disagreement_score":0.9624955,"about_ca_system_score_codex":0.00023628646,"about_ca_system_score_gemma":0.0006012253,"threshold_uncertainty_score":0.99988925},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001356185,0.00031648276,0.988551,0.00011913567,0.0011784028,0.00020591596,0.0000021168978,0.00007025473,0.009421064],"genre_scores_gemma":[0.10845086,0.000113326605,0.8907236,0.00051476224,0.00013502281,0.0000012985348,0.000001948314,0.000012699924,0.000046494948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978114,0.000016811045,0.0005241223,0.00074230164,0.00054695486,0.0003584135],"domain_scores_gemma":[0.9984561,0.00023278808,0.00037817046,0.00057657046,0.00023741045,0.00011893711],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006815539,0.00029606573,0.0003586998,0.000832583,0.00014652923,0.0001579997,0.00080132904,0.00017431875,0.0000133202675],"category_scores_gemma":[0.000061211824,0.00026394316,0.000057784724,0.00038053046,0.0009258279,0.0010154932,0.00048174415,0.00045252795,0.0000074564214],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028403842,0.000005897325,0.000040094077,0.000028085924,0.0000030814617,0.000010038145,0.00042011167,0.00079442037,0.00031480362,0.0090668015,0.0000011099551,0.9893127],"study_design_scores_gemma":[0.00042002086,0.00015968308,0.00016609293,0.0008486322,0.0000067084397,0.0007105055,0.0000011239296,0.87393624,0.009833457,0.11263383,0.000697286,0.0005864463],"about_ca_topic_score_codex":0.0000063263533,"about_ca_topic_score_gemma":0.000017427352,"teacher_disagreement_score":0.98872626,"about_ca_system_score_codex":0.00013863064,"about_ca_system_score_gemma":0.00024610056,"threshold_uncertainty_score":0.9999813},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005542247,0.0003281872,0.9914007,0.00066024397,0.0008599896,0.00017496629,0.0000080292975,0.0003128108,0.005700812],"genre_scores_gemma":[0.26945382,0.000023479328,0.72739947,0.0012754862,0.0005368557,0.00000859528,0.000046245616,0.00004699277,0.001209037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957564,0.000047179594,0.00069345045,0.0016690129,0.0011412083,0.00069274835],"domain_scores_gemma":[0.9970496,0.00054600876,0.0004433478,0.0016620297,0.00019361294,0.00010536655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007634613,0.0005578172,0.00064172834,0.00083040993,0.00035020028,0.00095104123,0.0031566594,0.00028167994,0.000023494602],"category_scores_gemma":[0.00010738572,0.0005152645,0.00017396608,0.0011726596,0.00046548524,0.0011902471,0.0010058706,0.0005345498,0.00010408459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013081824,0.000045372435,0.00016659385,0.0001076725,0.000035591493,0.00019055627,0.0021311527,0.077178515,0.00017029088,0.005783079,0.00085730565,0.9133326],"study_design_scores_gemma":[0.00016412907,0.00007529391,0.00020902621,0.000616482,0.000026960966,0.000063935186,4.874441e-7,0.9655421,0.000362475,0.031052608,0.0012369326,0.0006495703],"about_ca_topic_score_codex":0.00009331155,"about_ca_topic_score_gemma":0.000076129865,"teacher_disagreement_score":0.912683,"about_ca_system_score_codex":0.00022145698,"about_ca_system_score_gemma":0.0004135201,"threshold_uncertainty_score":0.9997299},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96733785,0.00011193388,0.028138038,0.0001937906,0.0016187107,0.00061055616,0.000015178615,0.00004266749,0.0019313036],"genre_scores_gemma":[0.9981676,0.000030615087,0.0004417198,0.0011485043,0.00010277652,0.0000065460354,0.0000012604512,0.000012398737,0.00008858842],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9975738,0.000050709874,0.00034984938,0.00096084236,0.0006479747,0.00041681936],"domain_scores_gemma":[0.9975466,0.001980887,0.00021807104,0.00015708467,0.000044811637,0.000052513584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033052292,0.0003233979,0.0004776546,0.00077524676,0.00011040304,0.000040668547,0.000593055,0.00027370825,0.0000075643693],"category_scores_gemma":[0.00029511066,0.00025283734,0.00007798039,0.00040094592,0.0014578104,0.00011578717,0.00023177138,0.0009131101,0.000010299799],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009243158,0.00021907406,0.004495405,0.00007010839,0.0000066865705,0.0004732262,0.0028568208,0.000048786485,0.033946868,0.0007578757,0.0000024119117,0.9570303],"study_design_scores_gemma":[0.003745812,0.0045843683,0.50675565,0.009909591,0.00012239991,0.00012813053,0.000011290967,0.0011304084,0.40829968,0.062957056,0.000037723374,0.0023178523],"about_ca_topic_score_codex":0.0000072147395,"about_ca_topic_score_gemma":0.00004596861,"teacher_disagreement_score":0.95471245,"about_ca_system_score_codex":0.000044990556,"about_ca_system_score_gemma":0.0000469276,"threshold_uncertainty_score":0.9999924},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039270666,0.00015898535,0.9937707,0.0002058402,0.0025031136,0.0006307127,0.000021131336,0.00009093678,0.0022258498],"genre_scores_gemma":[0.49668312,0.000011595158,0.50263083,0.00027183228,0.00032253854,0.0000101353435,0.0000051099473,0.000018810479,0.000046008525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997014,0.000028592978,0.00068669394,0.0010477591,0.00070991076,0.0005130652],"domain_scores_gemma":[0.99636555,0.0010676062,0.0006440036,0.0011553981,0.00065117114,0.00011626652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010526965,0.00037441638,0.0004655434,0.0007180021,0.00046770353,0.00023189347,0.0025226707,0.00035351666,0.000027669403],"category_scores_gemma":[0.00026302523,0.00038574706,0.00017467058,0.0005821479,0.00087336154,0.00052014424,0.0009582041,0.0007539595,0.000004686621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014686109,0.000080615566,0.00012616989,0.00015694795,0.000030824056,0.000004538096,0.012674657,0.08170871,0.0019856964,0.7928109,0.000013883329,0.11039234],"study_design_scores_gemma":[0.00015883471,0.00009878359,0.000024097975,0.00025636866,0.00000968482,0.00002014628,0.0000011168325,0.65282845,0.0073977206,0.33814982,0.00071645365,0.0003385085],"about_ca_topic_score_codex":0.0001047615,"about_ca_topic_score_gemma":0.00006067335,"teacher_disagreement_score":0.5711198,"about_ca_system_score_codex":0.00029454014,"about_ca_system_score_gemma":0.00080886704,"threshold_uncertainty_score":0.99985945},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077907543,0.0024937144,0.9927911,0.00028597302,0.0011365819,0.0014499367,0.0000010410704,0.00067063345,0.00039194405],"genre_scores_gemma":[0.5974246,0.00031799203,0.397795,0.002376565,0.0010946108,0.00017650478,0.000005873331,0.00012464254,0.0006842121],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930142,0.00010173586,0.0006237378,0.0026498293,0.0026757156,0.00093474064],"domain_scores_gemma":[0.994443,0.0012621458,0.00020973278,0.0030675721,0.000635016,0.00038253222],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015494431,0.00077108975,0.000622992,0.0020135806,0.0003243713,0.0012968727,0.0075130514,0.00026066462,0.000021141972],"category_scores_gemma":[0.00041587418,0.0007071797,0.00008640867,0.00201983,0.0004004461,0.0022189443,0.0014510339,0.0010330975,0.00011276272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014424252,0.0003176454,0.00027447817,0.0003082246,0.000024265477,0.0009289413,0.0047537964,0.09268073,0.00001767958,0.00096345524,0.000040486662,0.89967585],"study_design_scores_gemma":[0.003281225,0.009623083,0.009360113,0.016455205,0.00010408506,0.00009322351,0.000016489355,0.8498998,0.0043736547,0.08512383,0.0139011815,0.0077680806],"about_ca_topic_score_codex":0.000009219698,"about_ca_topic_score_gemma":0.00009995695,"teacher_disagreement_score":0.8919078,"about_ca_system_score_codex":0.0005807966,"about_ca_system_score_gemma":0.0012318491,"threshold_uncertainty_score":0.9997399},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012992097,0.00021111488,0.9951864,0.00010554996,0.0011070803,0.00078182033,0.000007921023,0.0001690061,0.0023011756],"genre_scores_gemma":[0.058943853,0.0000031428224,0.9398838,0.00052956847,0.00047296524,0.000012678604,0.0000070944643,0.000025993331,0.00012089624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962373,0.000021272997,0.0007388799,0.0014330854,0.0009285382,0.0006409696],"domain_scores_gemma":[0.9959194,0.0012653377,0.0005799819,0.0014487926,0.0005996453,0.00018681579],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013807584,0.00047932676,0.00066866854,0.0007195898,0.00020372441,0.00021113052,0.0033087155,0.00041195785,0.000005956595],"category_scores_gemma":[0.00012645232,0.00039372875,0.00018930766,0.0008986551,0.0003679915,0.00042490882,0.000593575,0.00045572798,0.000008392798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016394508,0.000042554155,0.0009822433,0.000989424,0.000014745834,0.0000083750965,0.0004918751,0.07219553,0.00017813836,0.0016354399,0.000026222571,0.92341906],"study_design_scores_gemma":[0.0005086734,0.00023004424,0.00017068513,0.0007087033,0.000011861727,0.000018849652,3.0953618e-7,0.98135734,0.0027468177,0.013017063,0.0007091628,0.0005204831],"about_ca_topic_score_codex":0.00007073848,"about_ca_topic_score_gemma":0.000034844204,"teacher_disagreement_score":0.9228986,"about_ca_system_score_codex":0.000201793,"about_ca_system_score_gemma":0.0015465411,"threshold_uncertainty_score":0.99985147},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017194864,0.0002162802,0.99610424,0.00003788987,0.0009198892,0.000553231,0.000009150674,0.00033399466,0.00010584861],"genre_scores_gemma":[0.96114844,0.000022558785,0.038432177,0.000044111148,0.00010077696,0.000035608242,0.00011178816,0.000071216484,0.00003334678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979146,0.00002668253,0.00048986496,0.0007541136,0.00042240735,0.00039229373],"domain_scores_gemma":[0.9990378,0.00016644382,0.00014682452,0.000471835,0.00012028105,0.000056838857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025447796,0.0004549204,0.00038116195,0.0009030638,0.000072412084,0.000091801856,0.0005256538,0.00033805586,0.0000042696533],"category_scores_gemma":[0.000016487866,0.0004905238,0.000058464888,0.0005191316,0.00012332087,0.00021298722,0.000057590492,0.00056807674,0.000011151689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006555199,0.00001934444,0.000009550526,0.00014014087,0.000002300234,0.000015084917,0.00011301317,0.93893474,0.00020123436,0.000041779716,0.0000016514865,0.06051459],"study_design_scores_gemma":[0.00037492518,0.000048421924,0.00006923372,0.0019347753,0.0000064755495,0.0000023193686,4.4590553e-7,0.99649566,0.00049640506,0.00012520011,0.000004255772,0.0004418646],"about_ca_topic_score_codex":0.000011723037,"about_ca_topic_score_gemma":0.00040302548,"teacher_disagreement_score":0.9594289,"about_ca_system_score_codex":0.0012480438,"about_ca_system_score_gemma":0.000095707735,"threshold_uncertainty_score":0.99975467},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001603773,0.00007627669,0.9957709,0.0011006925,0.000762386,0.0005401632,0.000005507219,0.00019106067,0.0013926438],"genre_scores_gemma":[0.96262735,0.0000140562315,0.033855207,0.0029140252,0.00015792043,0.000024326455,0.00003172907,0.00002364479,0.00035171694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674255,0.000041281204,0.00055711344,0.0008439844,0.001424754,0.00039032014],"domain_scores_gemma":[0.9973462,0.00024860998,0.00040638782,0.0014628893,0.0003965696,0.00013931927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005508264,0.00040858783,0.00034357706,0.0011526131,0.0003061838,0.0009000766,0.0022271613,0.00027233662,0.000012084727],"category_scores_gemma":[0.00005975175,0.00033258667,0.00008556499,0.0006048639,0.0003806452,0.0013342893,0.00020732821,0.00057625707,0.0001665464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012049483,0.0002825737,0.00049507816,0.00044241408,0.0000804016,0.00017996636,0.050869998,0.17796168,0.00042302388,0.060282562,0.0013011578,0.70756066],"study_design_scores_gemma":[0.00037680182,0.00017800291,0.0007719918,0.00034920638,0.000006659628,0.000029334275,2.866746e-7,0.98838377,0.00049952394,0.003716953,0.0051873643,0.00050010456],"about_ca_topic_score_codex":0.000014136861,"about_ca_topic_score_gemma":0.00003735098,"teacher_disagreement_score":0.962467,"about_ca_system_score_codex":0.00021770822,"about_ca_system_score_gemma":0.000457848,"threshold_uncertainty_score":0.9999126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013582842,0.000096931486,0.99030703,0.002774013,0.00030869956,0.0005557748,0.000009524316,0.00016307252,0.005649113],"genre_scores_gemma":[0.7900198,0.000010188368,0.20731847,0.002202415,0.0001767301,0.00001729078,0.00002123026,0.000027769694,0.00020611068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715334,0.00005655941,0.00047695218,0.00095079595,0.0009942931,0.0003680403],"domain_scores_gemma":[0.99655753,0.00054815057,0.00036682285,0.0022659355,0.00017082515,0.0000907025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008332356,0.00036159917,0.000400597,0.00051785435,0.00028598518,0.00026438985,0.0035101483,0.00019533573,0.000019725121],"category_scores_gemma":[0.00002181641,0.0002745495,0.00016466477,0.00072773045,0.00037538784,0.00021448502,0.000435507,0.00046788395,0.000051705363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015166771,0.00027353532,0.000015366017,0.00017399342,0.00002165157,0.00007224286,0.000591621,0.10319081,0.014650026,0.44431403,0.00034186683,0.4363397],"study_design_scores_gemma":[0.00018891806,0.00015263114,0.00004602386,0.0005396313,0.00000915092,0.000011429808,1.0054239e-7,0.93743014,0.019838057,0.039988294,0.0014773028,0.00031832076],"about_ca_topic_score_codex":0.000010102472,"about_ca_topic_score_gemma":0.0000044932226,"teacher_disagreement_score":0.8342393,"about_ca_system_score_codex":0.00017897347,"about_ca_system_score_gemma":0.00035882814,"threshold_uncertainty_score":0.9999707},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001584734,0.00062126067,0.97509205,0.0021839917,0.002399572,0.00038263836,0.0000044306016,0.0006597187,0.01864048],"genre_scores_gemma":[0.016826248,0.00024985024,0.968754,0.0045414986,0.0022209254,0.000023416445,0.000005039668,0.000091092465,0.00728792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99545217,0.00005179054,0.00043888832,0.0018057709,0.0014003387,0.00085104787],"domain_scores_gemma":[0.9966845,0.00034752494,0.0002919765,0.0021246842,0.00032231168,0.00022900672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087495416,0.00065359543,0.0005975392,0.0012931159,0.00038437123,0.0008562756,0.0050455593,0.00056638796,0.00008937844],"category_scores_gemma":[0.00019774155,0.0006085064,0.00023267572,0.0009245816,0.0005715588,0.001113989,0.0022242984,0.0014281512,0.000110810164],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061777846,0.000023434282,0.0000051917727,0.000037610374,0.000010124662,0.0006206564,0.0005271888,0.0006270984,0.00058181485,0.0023194477,0.0014175065,0.99382377],"study_design_scores_gemma":[0.00080733513,0.00069597183,0.00010382265,0.001064836,0.000028442671,0.0016543342,2.2900598e-7,0.49696836,0.12874663,0.26172817,0.1051521,0.003049773],"about_ca_topic_score_codex":0.000048622842,"about_ca_topic_score_gemma":0.00006532282,"teacher_disagreement_score":0.990774,"about_ca_system_score_codex":0.0004084048,"about_ca_system_score_gemma":0.00028643996,"threshold_uncertainty_score":0.99963665},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008159155,0.0002550594,0.9797724,0.002109433,0.0024514974,0.0002754685,0.00000244475,0.00016931632,0.014956233],"genre_scores_gemma":[0.29724118,0.0004587675,0.6906968,0.008253807,0.0009636501,0.000023203114,0.00000777321,0.00006176635,0.0022930566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971983,0.000042327363,0.00045480707,0.001006318,0.0007765769,0.00052167854],"domain_scores_gemma":[0.99735415,0.00075505767,0.000270419,0.0012434965,0.000236703,0.00014016978],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009816724,0.00037245374,0.00031415297,0.00029997044,0.00053528516,0.0008633723,0.0024833386,0.00021019344,0.000018864073],"category_scores_gemma":[0.00011759054,0.0002792519,0.00010834228,0.00036695442,0.0013287693,0.00025609558,0.0006173167,0.0006446427,0.0000795314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013497637,0.000002704808,0.000029386709,0.0000049369046,0.000004358232,0.000009607549,0.00009620848,0.013992247,0.00003091358,0.14039195,0.00005186085,0.8453845],"study_design_scores_gemma":[0.00023084754,0.00007287123,0.0004274498,0.00015471099,0.000004175823,0.00008181322,2.1957736e-7,0.87930846,0.000122102,0.09862799,0.020440312,0.0005290376],"about_ca_topic_score_codex":0.0000075973253,"about_ca_topic_score_gemma":0.000059734182,"teacher_disagreement_score":0.8653162,"about_ca_system_score_codex":0.000196508,"about_ca_system_score_gemma":0.00054986466,"threshold_uncertainty_score":0.99996597},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029766537,0.00035526496,0.98416686,0.0005399853,0.0020479537,0.00045117887,0.000007663984,0.00033150567,0.012069839],"genre_scores_gemma":[0.0066890526,0.00012802792,0.99101144,0.0010699064,0.0002897618,0.000015061487,0.0000050177473,0.00004478635,0.0007469341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562997,0.000055458895,0.00066430063,0.0016765796,0.0011711787,0.00080253347],"domain_scores_gemma":[0.99702793,0.00022602768,0.00031060464,0.0019668825,0.00024716413,0.000221374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015270746,0.00056805805,0.00052350626,0.0009102955,0.00024091339,0.00054119347,0.004283817,0.00036515106,0.00005316946],"category_scores_gemma":[0.000082504404,0.00054247794,0.00014484713,0.0009257799,0.00070630945,0.0010408927,0.00062928966,0.0009605677,0.00014410766],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007372592,0.000022859072,0.000009136323,0.000033696255,0.000007420075,0.0000877739,0.0008468958,0.0058697197,0.00018191029,0.09254782,0.000029742107,0.90035564],"study_design_scores_gemma":[0.00037579064,0.00027797217,0.000082081875,0.00032830966,0.000009950076,0.00021048471,1.7800711e-7,0.56811994,0.0040484793,0.387592,0.037771314,0.0011834906],"about_ca_topic_score_codex":0.000017736555,"about_ca_topic_score_gemma":0.000026111997,"teacher_disagreement_score":0.8991722,"about_ca_system_score_codex":0.00036260116,"about_ca_system_score_gemma":0.0005586644,"threshold_uncertainty_score":0.9997027},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013727268,0.00085055793,0.9953283,0.00060128677,0.0004728702,0.0007516453,0.000013454349,0.00016108897,0.001683532],"genre_scores_gemma":[0.24461539,0.0005213957,0.7536207,0.00059000624,0.00026457084,0.000038177215,0.00002383905,0.00002914616,0.0002967766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969493,0.00013028126,0.0007181114,0.0011675388,0.0005619875,0.00047275086],"domain_scores_gemma":[0.9950456,0.002437483,0.00037711687,0.001736139,0.00021828157,0.00018535368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011680061,0.00048678747,0.00094065536,0.00066951563,0.0007036556,0.00050697604,0.0026794148,0.00027911476,0.00000833738],"category_scores_gemma":[0.0002066156,0.00044308332,0.00018471238,0.00043451253,0.0025670922,0.00058757997,0.0016731796,0.00082727446,0.000011737745],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017605197,0.00005942453,0.00007449722,0.00006048094,0.000055523768,0.000046250283,0.004038288,0.0019484309,0.00005187173,0.033238314,0.00005479665,0.9601961],"study_design_scores_gemma":[0.006635737,0.00008305447,0.00012734921,0.00018183912,0.000022757657,0.00007682525,1.239202e-7,0.8472908,0.00015363347,0.14396039,0.0008674001,0.0006000622],"about_ca_topic_score_codex":0.000045516983,"about_ca_topic_score_gemma":0.00007187148,"teacher_disagreement_score":0.95959604,"about_ca_system_score_codex":0.00010921777,"about_ca_system_score_gemma":0.00033967398,"threshold_uncertainty_score":0.9998021},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002673326,0.001175095,0.9920993,0.0009305871,0.002777666,0.0010021343,0.000017591712,0.00009348309,0.0018774047],"genre_scores_gemma":[0.91709524,0.00007873529,0.0801555,0.0011949022,0.00082598976,0.0001280074,0.000033264223,0.00004088683,0.00044747134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960757,0.000035993173,0.0010851043,0.00089656736,0.0009861399,0.00092052453],"domain_scores_gemma":[0.9970312,0.0007230119,0.0005936022,0.0011542962,0.00036228626,0.00013556542],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019605693,0.00052128616,0.00061161607,0.00054199103,0.000657509,0.0028072293,0.003317423,0.0003935585,8.029719e-7],"category_scores_gemma":[0.00011602396,0.00039810198,0.00015067446,0.00060730684,0.0004680696,0.0017343432,0.00047945307,0.00069408794,0.0000133889525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009108301,0.000011757691,0.000010174322,0.00010064914,0.000007820556,0.000016680506,0.0009903635,0.10554593,0.000027565653,0.021345237,0.00021498872,0.8717197],"study_design_scores_gemma":[0.0004170708,0.000106673644,0.00014891737,0.0012929944,0.0000042514694,0.000038805778,0.0000030270178,0.954176,0.00009298858,0.010559465,0.03263801,0.000521794],"about_ca_topic_score_codex":0.00010711624,"about_ca_topic_score_gemma":0.00019466881,"teacher_disagreement_score":0.9170685,"about_ca_system_score_codex":0.00045479252,"about_ca_system_score_gemma":0.0005803915,"threshold_uncertainty_score":0.9998471},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043512176,0.0004035051,0.9926799,0.00032511546,0.0011711556,0.00030149618,0.000005723109,0.00010639384,0.00457158],"genre_scores_gemma":[0.63553226,0.00008672292,0.36175305,0.0012707156,0.00060575356,0.000007296067,0.000045033146,0.00003590679,0.00066322467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695766,0.00004212668,0.000627253,0.0010202411,0.0009711025,0.00038161498],"domain_scores_gemma":[0.9980448,0.00031347523,0.000327916,0.00085115473,0.00033867994,0.00012398828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005139197,0.0003770168,0.00045675703,0.0011379371,0.0001554167,0.00024233204,0.0017310509,0.00020198249,0.00008527984],"category_scores_gemma":[0.00004772044,0.00037306544,0.00011607679,0.0011699111,0.00039169856,0.000654404,0.00037089968,0.0003456296,0.00003566549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060539674,0.000033427248,0.000051722393,0.000026222784,0.0000094881825,0.000019346475,0.00037521526,0.2658192,0.0004915125,0.09518754,0.000015097984,0.6379652],"study_design_scores_gemma":[0.00042927198,0.0001621433,0.00027211572,0.00021480345,0.000009624873,0.00006519984,6.1228754e-8,0.7129387,0.0059949025,0.2779539,0.0014502765,0.0005090087],"about_ca_topic_score_codex":0.000026528549,"about_ca_topic_score_gemma":0.00003266544,"teacher_disagreement_score":0.6374562,"about_ca_system_score_codex":0.0001342526,"about_ca_system_score_gemma":0.0006276822,"threshold_uncertainty_score":0.99987215},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7656411,0.00001633402,0.23249686,0.0011090179,0.00032988342,0.00037572643,0.0000022258396,0.000022285001,0.0000065776867],"genre_scores_gemma":[0.9596292,0.0000057654984,0.040064134,0.0001956205,0.000058717036,0.000033016277,0.000007633092,0.000005380104,5.812957e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904275,0.000010372516,0.00024685173,0.00026771825,0.00024242881,0.00018988093],"domain_scores_gemma":[0.9993368,0.00003463288,0.00008741842,0.000294882,0.00016322547,0.00008307571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026183453,0.00009211248,0.00014816885,0.00027051105,0.000075268705,0.000037409493,0.00011659483,0.000039635463,0.0000059857794],"category_scores_gemma":[0.000103836326,0.00007198235,0.000026359437,0.00087785244,0.00009700886,0.00021405861,0.000049551265,0.000111315545,0.00000805511],"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.00007436365,0.00018272662,0.08581631,0.00010099293,0.0000057417305,0.000012226023,0.0027035642,0.009268108,0.6891287,0.00006741662,0.0000033973608,0.21263646],"study_design_scores_gemma":[0.00039813563,0.00013098073,0.38957384,0.000084668805,0.000004635434,0.00005986849,0.0000013704012,0.021036308,0.5883408,0.0003028057,0.000007006166,0.00005956824],"about_ca_topic_score_codex":0.000097266355,"about_ca_topic_score_gemma":0.000051678177,"teacher_disagreement_score":0.30375752,"about_ca_system_score_codex":0.000104436105,"about_ca_system_score_gemma":0.00011222337,"threshold_uncertainty_score":0.29353553},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39584193,0.000017433882,0.6031288,0.00020981343,0.00017045827,0.00054804777,0.0000014550435,0.000080989565,0.0000010898709],"genre_scores_gemma":[0.52299005,0.0000023160178,0.4766405,0.0003308906,0.000012908259,0.00001752387,8.408162e-7,0.0000047949484,2.0234725e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973342,0.0003042914,0.00052492187,0.00065287267,0.00074067194,0.00044307558],"domain_scores_gemma":[0.99845594,0.0003952943,0.00020155359,0.0006629611,0.00016712055,0.00011711987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009649785,0.00021286577,0.00023531745,0.00030867447,0.00015853271,0.0003880786,0.0018768532,0.00007565373,0.00002934373],"category_scores_gemma":[0.00023940427,0.00015663108,0.000055715453,0.0020738041,0.0006640936,0.0021593317,0.00024140149,0.0003119346,0.000003120041],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018598146,0.00024471906,0.019293629,0.000055128337,0.0000029807472,0.0000063571933,0.005949305,0.013981867,0.53313226,0.000008025113,0.0000055252217,0.42731836],"study_design_scores_gemma":[0.0002409043,0.000058037655,0.04067826,0.00007410334,0.0000017028799,0.00001223468,0.0000040559535,0.6021766,0.35535648,0.001279246,7.0580036e-8,0.00011829883],"about_ca_topic_score_codex":0.0004278571,"about_ca_topic_score_gemma":0.000115778705,"teacher_disagreement_score":0.5881947,"about_ca_system_score_codex":0.00017736072,"about_ca_system_score_gemma":0.00024266432,"threshold_uncertainty_score":0.638723},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006786344,0.00043527182,0.9847578,0.000019538875,0.000965828,0.00018620693,0.000007637656,0.00028006412,0.012669027],"genre_scores_gemma":[0.919932,0.00040722973,0.078528315,0.00013305618,0.00036534993,0.000014096821,0.000014814511,0.000070770875,0.0005343761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999107,0.0000036124811,0.0002397938,0.00036100196,0.00008459088,0.00020397828],"domain_scores_gemma":[0.99933183,0.000043628006,0.00006715831,0.00042562254,0.000029422854,0.00010232661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003163202,0.00020769757,0.00023162339,0.00022787102,0.00006053136,0.00011956198,0.00036621606,0.0002162812,0.000021335232],"category_scores_gemma":[0.000011630361,0.00021431722,0.000023927769,0.000044597156,0.00017714988,0.000113658294,0.00012836934,0.00029627603,0.000009965975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028585769,0.000008828548,0.000045364548,0.00032877745,0.00001673448,0.00003552974,0.0010293024,0.10654453,0.00016905749,0.025072895,0.00022061888,0.86652553],"study_design_scores_gemma":[0.00005120226,0.000042713553,0.00006882647,0.0002099629,0.000009861487,0.00005767293,1.6811913e-7,0.9686861,0.00037770972,0.022205072,0.0078506945,0.00044003685],"about_ca_topic_score_codex":0.000024918258,"about_ca_topic_score_gemma":0.000015683281,"teacher_disagreement_score":0.91925335,"about_ca_system_score_codex":0.00013948661,"about_ca_system_score_gemma":0.0000635585,"threshold_uncertainty_score":0.87396026},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028436832,0.0003417753,0.9952471,0.0000771954,0.0024688905,0.00018798075,0.000004971101,0.00029026228,0.0010974484],"genre_scores_gemma":[0.6320128,0.00003274352,0.3670548,0.00008370299,0.000642439,0.000012351772,0.000010804664,0.000088530374,0.000061840045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813414,0.000005878341,0.0004801208,0.000415996,0.0006875386,0.00027635775],"domain_scores_gemma":[0.99873495,0.000313894,0.000101239166,0.00063817226,0.000098095836,0.00011363018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003658069,0.00028777646,0.0003775699,0.00042020905,0.00003648192,0.000038391903,0.0010689946,0.00049572176,0.00007445617],"category_scores_gemma":[0.00012256291,0.0002825324,0.000068993184,0.00019450988,0.00034282083,0.00011196199,0.00014566853,0.00078147894,0.000031448075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001624455,0.000009421363,0.00027061906,0.0004260796,0.000028514856,0.000017751452,0.0004277249,0.5321593,0.0018817264,0.0009813111,0.000012099047,0.46378383],"study_design_scores_gemma":[0.00016041448,0.00003410791,0.0009179528,0.0010970497,0.000013113386,0.00005747579,8.141079e-8,0.9723659,0.0088738995,0.0034037654,0.01244002,0.00063622184],"about_ca_topic_score_codex":0.000009377235,"about_ca_topic_score_gemma":0.00006349272,"teacher_disagreement_score":0.6317284,"about_ca_system_score_codex":0.00014157362,"about_ca_system_score_gemma":0.00018943124,"threshold_uncertainty_score":0.9999627},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029792793,0.00034104945,0.96534663,0.00012850012,0.0019098418,0.00035016768,0.000010086039,0.000028052715,0.002092848],"genre_scores_gemma":[0.924954,0.00015466585,0.07093965,0.00038890104,0.0018824291,0.000013656436,0.00003889836,0.00006514177,0.0015626408],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984782,0.00002151994,0.00021040648,0.0007616389,0.00026820996,0.000260044],"domain_scores_gemma":[0.9991673,0.000046564423,0.00015722236,0.00042953668,0.00010656549,0.00009278383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004195312,0.00027464295,0.0002037164,0.0001727444,0.00015102977,0.00009787857,0.0003147108,0.00041241277,0.00004193716],"category_scores_gemma":[0.00007833034,0.00025281575,0.00006481463,0.000059954255,0.00028487763,0.0000095349205,0.00029566724,0.00034824474,0.000034462253],"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.000027017484,0.000009577703,0.0000027839303,0.000011557101,0.000008136394,0.000004544452,0.00004393016,0.0026263455,0.87205344,0.0000379145,0.000010308607,0.12516442],"study_design_scores_gemma":[0.00017946637,0.0003825755,0.000016410764,0.00021241266,0.000016478754,0.00007434415,1.4855264e-7,0.065459184,0.9242535,0.0019844472,0.0070392,0.00038182482],"about_ca_topic_score_codex":0.000007729649,"about_ca_topic_score_gemma":0.000012642482,"teacher_disagreement_score":0.8951612,"about_ca_system_score_codex":0.000040397317,"about_ca_system_score_gemma":0.000074229814,"threshold_uncertainty_score":0.99999243},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023719313,0.000072293195,0.99233216,0.0012187802,0.00085950614,0.0002951119,0.00000778982,0.00008884517,0.004888329],"genre_scores_gemma":[0.46649516,0.000023275446,0.5323481,0.0003148329,0.00022188398,0.0000051208885,0.000012436443,0.000019297133,0.000559879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736476,0.000053044165,0.00057745026,0.00089761405,0.00078729796,0.00031982522],"domain_scores_gemma":[0.9979439,0.0003811827,0.00053940987,0.00072630116,0.00029940004,0.00010981806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007152098,0.0003447296,0.0004001372,0.0007334474,0.00011234097,0.000202261,0.00092353765,0.00022680558,0.00012332974],"category_scores_gemma":[0.00007780824,0.00033244587,0.0001205021,0.00045019886,0.00055911,0.00088148244,0.0003161531,0.00046547438,0.000036217752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001610581,0.00004315024,0.00010815921,0.00004325684,0.00001714127,0.000014099844,0.01357503,0.07716665,0.000077378914,0.043398205,0.000028502762,0.8655123],"study_design_scores_gemma":[0.0007761893,0.0003214675,0.0008772208,0.00062925485,0.000019397596,0.00009229822,0.000012025993,0.89218354,0.0017140718,0.0986451,0.0035287691,0.0012006743],"about_ca_topic_score_codex":0.000044591958,"about_ca_topic_score_gemma":0.00043923964,"teacher_disagreement_score":0.86431164,"about_ca_system_score_codex":0.00025123605,"about_ca_system_score_gemma":0.0004338758,"threshold_uncertainty_score":0.99991274},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008905779,0.0011983524,0.98719954,0.00036004977,0.00015118561,0.00044706668,0.00002655398,0.00016792689,0.0015435594],"genre_scores_gemma":[0.78856844,0.0002579246,0.20961861,0.0013791411,0.00007067774,0.0000064361084,0.000009088929,0.000032956134,0.000056696543],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974406,0.000025010724,0.00054318295,0.0010578153,0.0005539141,0.00037947122],"domain_scores_gemma":[0.9986692,0.00035658025,0.00020138756,0.00053439743,0.00008995775,0.00014846738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003740431,0.00036885566,0.00051617797,0.0014720787,0.00007216269,0.0006033146,0.0010613706,0.00027233065,0.000011883083],"category_scores_gemma":[0.00005886259,0.00034322182,0.000074566655,0.0006931433,0.00090545934,0.0013346386,0.000612099,0.0005661773,0.0000019126114],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003715459,0.00005192144,0.002689073,0.00012293237,0.000008353468,0.00013625258,0.0003881487,0.000102252336,0.00029853472,0.003250968,0.000009136199,0.99290526],"study_design_scores_gemma":[0.00195145,0.0012357774,0.005906485,0.005563522,0.000017178889,0.0002730457,0.0000010394905,0.25484625,0.045104682,0.68165946,0.0012666313,0.002174454],"about_ca_topic_score_codex":0.000014510544,"about_ca_topic_score_gemma":0.000011814974,"teacher_disagreement_score":0.9907308,"about_ca_system_score_codex":0.00004683455,"about_ca_system_score_gemma":0.00027815052,"threshold_uncertainty_score":0.99990195},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044974976,0.0004207897,0.99119145,0.00020066691,0.0012191256,0.00041621295,0.0000012733632,0.00024167077,0.0058590523],"genre_scores_gemma":[0.10959609,0.000041263036,0.8896051,0.00026770344,0.00018714157,0.000009757584,0.0000010673589,0.000026032063,0.00026584108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653107,0.00005444907,0.0006837105,0.0011490344,0.0010532639,0.00052850146],"domain_scores_gemma":[0.99730843,0.0001148672,0.0005054091,0.0015948048,0.0003546123,0.00012185821],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001384192,0.00043600125,0.0005434218,0.0007793425,0.00014984694,0.00023110793,0.0038776572,0.00030084891,0.000011468908],"category_scores_gemma":[0.00013827937,0.00037542722,0.00012215803,0.00073420565,0.00073239056,0.00085876347,0.0011857146,0.0005918797,0.000028606708],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019181123,0.00010892997,0.00030496513,0.00027505652,0.000031423282,0.00004863618,0.003352557,0.0071526854,0.0024805528,0.10333892,0.000021688405,0.8828654],"study_design_scores_gemma":[0.00036935278,0.0003714046,0.00026006612,0.0009633499,0.000015383002,0.0001471146,3.239649e-7,0.8416859,0.05604604,0.09424655,0.004822412,0.0010721146],"about_ca_topic_score_codex":0.000036391964,"about_ca_topic_score_gemma":0.00001184359,"teacher_disagreement_score":0.8817933,"about_ca_system_score_codex":0.00025827583,"about_ca_system_score_gemma":0.0005178169,"threshold_uncertainty_score":0.99986976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017022307,0.00019925827,0.9962664,0.0008301536,0.0004842608,0.0012174082,0.0000072883086,0.00050458434,0.0004736242],"genre_scores_gemma":[0.0014349781,0.000029697363,0.992857,0.004563491,0.00015597294,0.000038121834,0.000011996847,0.000036862482,0.00087188795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959578,0.000032013355,0.0005809688,0.0016367395,0.0010904738,0.0007020232],"domain_scores_gemma":[0.9972167,0.00046766584,0.00038974057,0.0012031113,0.00045388748,0.00026887254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000772556,0.00058494916,0.00062007393,0.00071727444,0.00022593672,0.0005367282,0.0032131425,0.00032584797,0.000017068962],"category_scores_gemma":[0.00015821033,0.00046767254,0.000092398666,0.00058676506,0.0009494958,0.0007467085,0.00047490266,0.0006315774,0.000015759464],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011533025,0.00006078485,0.000007230541,0.000038732443,0.00001217969,0.000042821724,0.00047862408,0.0003120423,0.0012224503,0.0017917444,0.00007123913,0.99595064],"study_design_scores_gemma":[0.0017144517,0.0011421917,0.00010710895,0.0007010227,0.000020257787,0.00007481021,3.805749e-7,0.9135554,0.037925083,0.042692278,0.000857356,0.0012096927],"about_ca_topic_score_codex":0.000012138201,"about_ca_topic_score_gemma":0.000027905997,"teacher_disagreement_score":0.9947409,"about_ca_system_score_codex":0.00026215985,"about_ca_system_score_gemma":0.0006675517,"threshold_uncertainty_score":0.9997775},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017857674,0.00041638553,0.9090477,0.08157274,0.0015981559,0.0011264271,0.000024714274,0.00042619568,0.0056090676],"genre_scores_gemma":[0.03283392,0.00036938526,0.9369076,0.023983516,0.0023568983,0.00009361318,0.000029433893,0.0001895979,0.003236068],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98778945,0.00023465145,0.0009876128,0.004095538,0.0048690666,0.0020236904],"domain_scores_gemma":[0.9859998,0.0063035516,0.00021134526,0.0048226025,0.0019112262,0.0007514779],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.005748256,0.00084798754,0.00074790185,0.002930619,0.00085509935,0.0025365634,0.009366859,0.0006614031,0.00011311721],"category_scores_gemma":[0.008863188,0.00079651584,0.00015526674,0.0044526397,0.0012135551,0.0012785596,0.0045677754,0.0036322693,0.00070957106],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015500461,0.0001603315,0.000016663738,0.00011292955,0.000046091307,0.00090650655,0.019305842,0.04780955,0.00020328807,0.0032381641,0.078497514,0.8495481],"study_design_scores_gemma":[0.0009301695,0.0013096735,0.00012703189,0.0017985215,0.000013055937,0.00022704196,0.0000081947255,0.09622818,0.0033932833,0.033889417,0.85994744,0.0021279673],"about_ca_topic_score_codex":0.00046330516,"about_ca_topic_score_gemma":0.0004527962,"teacher_disagreement_score":0.84742016,"about_ca_system_score_codex":0.0014007712,"about_ca_system_score_gemma":0.0017445614,"threshold_uncertainty_score":0.99948555},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023958525,0.00032200347,0.99192315,0.0025369343,0.0003558596,0.00040737007,0.00001332722,0.00012054924,0.0019249468],"genre_scores_gemma":[0.8517668,0.00007417834,0.14721295,0.00054665323,0.00021549377,0.000018606634,0.0000051028182,0.00002107207,0.000139102],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974343,0.000036141166,0.0004798274,0.0011317068,0.0005431428,0.00037486132],"domain_scores_gemma":[0.997158,0.00014999215,0.0003633767,0.0020524056,0.00017018952,0.00010602856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005512385,0.00036621996,0.0003770927,0.00032154543,0.0003667179,0.00020756901,0.0033004114,0.00040002313,0.000008044211],"category_scores_gemma":[0.000051653464,0.00028623085,0.000077695906,0.0005919614,0.0016511611,0.0008318453,0.0012556431,0.0007113549,0.000003284367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031083114,0.000041274474,0.00012121856,0.000023834576,0.000006703418,0.0000045348816,0.0006462636,0.0027872603,0.00018212433,0.2624255,0.000011382214,0.73374677],"study_design_scores_gemma":[0.00029055937,0.00013774249,0.0008696765,0.00015875202,0.00001638765,0.0000749789,0.0000017967236,0.33634785,0.0043762457,0.6540174,0.0031068653,0.00060173345],"about_ca_topic_score_codex":0.000029154558,"about_ca_topic_score_gemma":0.00021048986,"teacher_disagreement_score":0.849371,"about_ca_system_score_codex":0.000118416225,"about_ca_system_score_gemma":0.00027815127,"threshold_uncertainty_score":0.999959},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043031396,0.00015862609,0.9912171,0.00082628353,0.0006348094,0.0008149433,0.000010226573,0.0003214604,0.0055862432],"genre_scores_gemma":[0.23404568,0.00003307494,0.7627905,0.0023479352,0.00035479755,0.000017021548,0.000013758602,0.00006316512,0.0003340683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540365,0.00013887096,0.0004778262,0.0022487077,0.00096760754,0.0007633334],"domain_scores_gemma":[0.9956865,0.001796434,0.00031503156,0.0015309582,0.00033317687,0.00033795464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087478384,0.0007789401,0.0007875618,0.0007411055,0.00036622013,0.00046328962,0.0024885389,0.00033781497,0.00003569472],"category_scores_gemma":[0.000089604844,0.0006550909,0.000108980246,0.0007163618,0.002519859,0.000516334,0.0013051877,0.00094386056,0.000069373564],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021452848,0.00008765053,0.000078899946,0.00008921675,0.00003955196,0.00045350706,0.0012482231,0.024494156,0.000017467368,0.07309901,0.000021764197,0.9003491],"study_design_scores_gemma":[0.0011402,0.0014759632,0.0014128138,0.00083850586,0.00003264474,0.00031484762,4.815877e-7,0.56062925,0.00028864294,0.4317546,0.0005791209,0.0015329757],"about_ca_topic_score_codex":0.000057891713,"about_ca_topic_score_gemma":0.00004417523,"teacher_disagreement_score":0.8988161,"about_ca_system_score_codex":0.0003868859,"about_ca_system_score_gemma":0.00066962023,"threshold_uncertainty_score":0.99959004},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000113937065,0.0002667166,0.9966826,0.0004925199,0.00069616665,0.0005058247,0.0000053260096,0.00094055705,0.00029635668],"genre_scores_gemma":[0.0051171114,0.000034761448,0.99336666,0.0007702988,0.00030916676,0.000003505218,0.0000087428725,0.000056235847,0.0003335158],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99569595,0.00007094714,0.0007566619,0.0015783106,0.0011620882,0.0007360565],"domain_scores_gemma":[0.99676394,0.0004066309,0.0006023992,0.0013595634,0.000668083,0.0001993968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017326702,0.0006478251,0.00063899753,0.0010838173,0.0005389947,0.00089433155,0.0030773494,0.00059377926,0.000039156937],"category_scores_gemma":[0.00037251748,0.00059431803,0.00021447409,0.0008288306,0.0010158567,0.0008572232,0.0009951805,0.0022996897,0.000022173597],"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.000011219728,0.000024224611,0.000026759466,0.000045947854,0.000005220859,0.00005793097,0.00009906213,0.00001498833,0.9554844,0.0020341303,1.106516e-7,0.042196028],"study_design_scores_gemma":[0.00013757023,0.00015556447,0.000007998782,0.0003739769,0.000008944377,0.000057468005,1.3536159e-7,0.07177546,0.9165166,0.009304132,0.0010259204,0.00063623895],"about_ca_topic_score_codex":0.000060554034,"about_ca_topic_score_gemma":0.000033058343,"teacher_disagreement_score":0.071760476,"about_ca_system_score_codex":0.00040546758,"about_ca_system_score_gemma":0.00081077626,"threshold_uncertainty_score":0.99965084},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03388349,0.005079207,0.9480466,0.00047892577,0.00078640645,0.0003557397,0.000018338767,0.000055739663,0.0112955095],"genre_scores_gemma":[0.96583277,0.00048883935,0.03035083,0.0015653924,0.0007370909,0.0000026727944,0.000030830313,0.000019818102,0.00097177015],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985265,0.000015065647,0.0002049938,0.0007686951,0.00017847473,0.00030623065],"domain_scores_gemma":[0.99939615,0.00004880047,0.000091797825,0.00030665123,0.00006843737,0.00008817276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026705026,0.00024864514,0.00021540072,0.00010964648,0.00015154392,0.00008147669,0.00043436215,0.00032546942,0.000015611357],"category_scores_gemma":[0.00007881568,0.00020312959,0.000056816727,0.00008439679,0.0006176945,0.0000045237107,0.0005952103,0.00026512984,0.000007267051],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031157855,0.00006933322,0.0018768808,0.00008783174,0.00004421112,0.00006435415,0.00018205927,0.0018266819,0.12364122,0.0055021998,0.0005296604,0.8661444],"study_design_scores_gemma":[0.003095262,0.0058229812,0.0057386206,0.002167,0.00014024145,0.0011972705,0.0000021660903,0.1697756,0.17297928,0.23375213,0.39695048,0.00837896],"about_ca_topic_score_codex":0.0000055180167,"about_ca_topic_score_gemma":0.000017594975,"teacher_disagreement_score":0.93194926,"about_ca_system_score_codex":0.000031201787,"about_ca_system_score_gemma":0.00005734069,"threshold_uncertainty_score":0.82833844},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088448613,0.000097703596,0.99001896,0.0049820896,0.0012281141,0.0015832965,0.000021763966,0.00008929111,0.0010943118],"genre_scores_gemma":[0.3902333,0.00008963144,0.58981353,0.016772298,0.0021488296,0.00033037414,0.000030333553,0.00011090859,0.00047081689],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649256,0.00006757719,0.0005216072,0.0013277018,0.0008674243,0.00072310993],"domain_scores_gemma":[0.99576086,0.0015763629,0.00028847612,0.0019952662,0.00028344203,0.00009559319],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022735712,0.00046394797,0.00033124382,0.00031470074,0.0012429167,0.00096063147,0.0037822567,0.0001859641,0.000044076136],"category_scores_gemma":[0.00018485452,0.00027053215,0.00026084273,0.00064031273,0.00093359355,0.0003324021,0.0009931638,0.0008451291,0.000013757764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017978684,0.000081931095,0.00012062431,0.000051432722,0.00002329069,0.000012914268,0.0021185917,0.006333174,0.000059274622,0.41136608,0.00012598408,0.5796887],"study_design_scores_gemma":[0.0002492555,0.00022998599,0.00012298331,0.00007337293,0.000008861501,0.000025214185,9.619088e-7,0.36066207,0.00025232078,0.6258361,0.0121351825,0.00040375214],"about_ca_topic_score_codex":0.0000763438,"about_ca_topic_score_gemma":0.00026799313,"teacher_disagreement_score":0.57928497,"about_ca_system_score_codex":0.00019831811,"about_ca_system_score_gemma":0.00042009808,"threshold_uncertainty_score":0.99997467},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37348074,0.00010774321,0.62415284,0.0018142015,0.0001687551,0.00020925053,0.0000017371973,0.00002523205,0.00003948523],"genre_scores_gemma":[0.96613586,0.000011643894,0.031077094,0.0026883592,0.000065253334,0.000004007446,0.0000037158782,0.000005653562,0.000008417955],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99886906,0.000020655061,0.00020803319,0.0003447877,0.0003010628,0.00025638408],"domain_scores_gemma":[0.99944717,0.00008136772,0.000049124454,0.00026189064,0.00009206467,0.000068385154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019551405,0.000110617024,0.00015122164,0.00026191148,0.000065216096,0.00006176839,0.00016153674,0.000024807876,0.000066078115],"category_scores_gemma":[0.00007634388,0.00009261285,0.00003106429,0.00087089214,0.00013475846,0.00021649618,0.000050243263,0.00013709154,0.0000027205522],"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.0001742368,0.0005997922,0.628562,0.000033773515,0.0000049889627,0.00087424484,0.0005574611,0.03301163,0.0050275316,0.00011098516,0.000116208714,0.33092713],"study_design_scores_gemma":[0.0024244161,0.0013078105,0.5992553,0.001215558,0.000016986387,0.00058680185,0.0000050100407,0.38545722,0.007316114,0.0020389066,0.00013181676,0.0002440106],"about_ca_topic_score_codex":0.00011422113,"about_ca_topic_score_gemma":0.0002986397,"teacher_disagreement_score":0.59307575,"about_ca_system_score_codex":0.00016119078,"about_ca_system_score_gemma":0.00012562567,"threshold_uncertainty_score":0.37766424},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021129362,0.00015316652,0.99683654,0.0001400959,0.0010165357,0.0006472736,0.0000068838576,0.00028210925,0.00070610916],"genre_scores_gemma":[0.22813024,0.00004317679,0.7689994,0.0023878545,0.00029078338,0.000033922326,0.000015522242,0.000034245684,0.000064839296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668896,0.00007528176,0.0004721221,0.0011340732,0.0011307601,0.0004988084],"domain_scores_gemma":[0.99809533,0.0004159979,0.0003019914,0.0007567429,0.00016328055,0.00026664286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093729707,0.00045133522,0.00035033847,0.0008937637,0.00024445163,0.0005307944,0.0011003853,0.00023369146,0.00007102885],"category_scores_gemma":[0.000121300516,0.00041961894,0.00007855586,0.0004112953,0.00069289084,0.0011659615,0.0003727894,0.0006174895,0.000038177313],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010919382,0.00007141339,0.000022203785,0.000033161206,0.0000044685594,0.00003546217,0.00024021107,0.00024414228,0.018851021,0.00020891863,0.000011031624,0.98026705],"study_design_scores_gemma":[0.001639524,0.001089687,0.00019034072,0.00041083418,0.00002367733,0.00006647695,8.3067494e-7,0.618244,0.36807707,0.009160856,0.00012710033,0.0009695872],"about_ca_topic_score_codex":0.000022430162,"about_ca_topic_score_gemma":0.00003084228,"teacher_disagreement_score":0.97929746,"about_ca_system_score_codex":0.0003903134,"about_ca_system_score_gemma":0.00021816646,"threshold_uncertainty_score":0.99982554},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019906145,0.00036960546,0.9793144,0.00045846307,0.0024510685,0.00035049397,7.0131927e-7,0.00016676311,0.016868588],"genre_scores_gemma":[0.90473676,0.000037936978,0.089908496,0.0015355907,0.0007357399,0.000009138322,0.000004841304,0.000044370678,0.0029871461],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99639034,0.00006057352,0.0004969177,0.0014689777,0.0008231657,0.00076003995],"domain_scores_gemma":[0.9976941,0.0002740032,0.00028229615,0.0014285333,0.0001345009,0.00018657571],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010679292,0.0004886228,0.0005865875,0.0010290835,0.00015913731,0.00043107368,0.003587424,0.0003902424,0.000023184408],"category_scores_gemma":[0.00005477772,0.00043680193,0.00012731676,0.00070178695,0.00059532694,0.00037812005,0.0015392936,0.0007395867,0.00017194048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028696984,0.00001893,0.00012491406,0.000027668742,0.000005138442,0.00021918197,0.00069123623,0.00239165,0.000023523186,0.4750207,0.000036526268,0.52143764],"study_design_scores_gemma":[0.00079750404,0.00033778194,0.0002433785,0.00018714707,0.000008095774,0.00018833613,5.335233e-7,0.2475541,0.00030863553,0.7121387,0.036880497,0.0013552879],"about_ca_topic_score_codex":0.0001768449,"about_ca_topic_score_gemma":0.00032387028,"teacher_disagreement_score":0.90471685,"about_ca_system_score_codex":0.00034775678,"about_ca_system_score_gemma":0.00045408128,"threshold_uncertainty_score":0.9998084},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021551906,0.000034441513,0.9902569,0.00018828649,0.0011037036,0.0009285872,0.000017215702,0.00015257846,0.005163098],"genre_scores_gemma":[0.9073381,0.000053787866,0.090960704,0.0010199861,0.0002921402,0.000044460947,0.000054335454,0.00004523243,0.00019129233],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961336,0.000142311,0.0007416958,0.0012608077,0.0010902233,0.0006313384],"domain_scores_gemma":[0.9974984,0.00028623737,0.0006165342,0.0012315647,0.00016311847,0.00020413102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017179586,0.00054277555,0.0005613353,0.0014477759,0.00017519221,0.00059272593,0.0019791066,0.0004889372,0.00005222851],"category_scores_gemma":[0.000096047006,0.0005651457,0.000108529464,0.0006933097,0.0003611508,0.007317702,0.0008393489,0.0010229674,0.00031128115],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028897484,0.000076773526,0.000109935485,0.00003493739,0.000006878804,0.000019912977,0.001437953,0.0002365125,0.00024287196,0.00035006032,0.000003818134,0.9974514],"study_design_scores_gemma":[0.0040502455,0.0025597406,0.01117123,0.0035971808,0.00004959112,0.0006431527,0.0000037176917,0.3930636,0.027973348,0.5357556,0.0149296895,0.0062029334],"about_ca_topic_score_codex":0.00018819049,"about_ca_topic_score_gemma":0.00037966337,"teacher_disagreement_score":0.9912485,"about_ca_system_score_codex":0.0007425489,"about_ca_system_score_gemma":0.00041815804,"threshold_uncertainty_score":0.99968},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037593086,0.00028758642,0.9924081,0.0013134964,0.0011034218,0.00048361174,0.000018694196,0.00014783881,0.004233516],"genre_scores_gemma":[0.014579318,0.000012710747,0.9829345,0.00089988316,0.00076461583,0.00001715844,0.000045787678,0.000024265111,0.0007218109],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968857,0.000010684729,0.00041718927,0.0013493918,0.00083734916,0.0004996792],"domain_scores_gemma":[0.99832433,0.00017452598,0.00024274546,0.0008958811,0.00025866684,0.00010387324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000990411,0.00036978663,0.00036534053,0.00048870017,0.0003199993,0.00064414926,0.0024898245,0.00017406739,0.000011482455],"category_scores_gemma":[0.00006740363,0.0003428007,0.0001304507,0.00043935524,0.00036752017,0.0012173556,0.001089718,0.00039631015,0.000018419154],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031591592,0.000018180039,0.000014005717,0.00007369548,0.000008028291,0.000019274597,0.00013469135,0.019789374,0.00000890502,0.18880463,0.00002770207,0.79109836],"study_design_scores_gemma":[0.00032575813,0.00007711728,0.00009268715,0.00027291206,0.000009788178,0.000012091677,4.5980446e-8,0.48484975,0.00014557254,0.5071308,0.0066321176,0.00045134051],"about_ca_topic_score_codex":0.000009014041,"about_ca_topic_score_gemma":0.000012330739,"teacher_disagreement_score":0.79064703,"about_ca_system_score_codex":0.00030791186,"about_ca_system_score_gemma":0.00061527285,"threshold_uncertainty_score":0.9999024},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025329502,0.00082630647,0.9709737,0.00009146576,0.00029016327,0.002202849,0.00004082036,0.00006181533,0.00018339259],"genre_scores_gemma":[0.97881824,0.000046180907,0.020624958,0.00022948786,0.00009943783,0.00011386331,0.0000051674915,0.000024418747,0.00003823326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636,0.00012803775,0.00077107555,0.0016085686,0.0006411331,0.0004911535],"domain_scores_gemma":[0.9909507,0.006407608,0.0007310057,0.00084856024,0.00092350174,0.00013864003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028439471,0.00054925255,0.0009569931,0.00048735464,0.0003445462,0.00029553127,0.0008649839,0.00023446415,0.0000025288812],"category_scores_gemma":[0.0007727729,0.00037581503,0.00022384088,0.0003942002,0.0015035634,0.00046845537,0.0008291241,0.0004975926,8.671272e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010993682,0.00015278303,0.0046376213,0.00025277468,0.00027660365,0.000054490723,0.005216394,0.0004897898,0.000102606864,0.00085987436,0.000022783619,0.9878243],"study_design_scores_gemma":[0.009839294,0.014706479,0.033874597,0.018299017,0.0005173471,0.005418505,0.00049097626,0.7866303,0.018155245,0.10311061,0.00074950873,0.008208175],"about_ca_topic_score_codex":0.000086840984,"about_ca_topic_score_gemma":0.00008343644,"teacher_disagreement_score":0.97961617,"about_ca_system_score_codex":0.00025606126,"about_ca_system_score_gemma":0.00034204533,"threshold_uncertainty_score":0.9998694},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018325502,0.0001581584,0.9925212,0.0011051457,0.003739069,0.0005343402,0.000010306826,0.00022121314,0.001527311],"genre_scores_gemma":[0.119283184,0.000014733978,0.87601894,0.002056899,0.0019500798,0.000029309287,0.000015356503,0.000045356082,0.00058614876],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682736,0.000015318972,0.0004969692,0.0012381397,0.00062751264,0.0007947197],"domain_scores_gemma":[0.99758935,0.0006937249,0.00026565054,0.0010088057,0.00026151683,0.0001809592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091984787,0.00049248774,0.0004691249,0.0005643429,0.00046311773,0.00049877184,0.0030605157,0.00038225573,0.000015800477],"category_scores_gemma":[0.00012804243,0.00042865073,0.00019911294,0.0003527805,0.000670855,0.0010513935,0.0012432709,0.0007945334,0.000038865805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008471675,0.000014137018,0.0000038650837,0.000028340915,0.0000067083797,0.00000935516,0.00045767945,0.0023607493,0.0002793332,0.3095599,0.000008656826,0.6872628],"study_design_scores_gemma":[0.00026717194,0.00016925375,0.000027980286,0.00009123051,0.000005394335,0.00003437055,5.989062e-8,0.31680873,0.004502771,0.67259705,0.005023376,0.00047260337],"about_ca_topic_score_codex":0.000010058989,"about_ca_topic_score_gemma":0.00006760228,"teacher_disagreement_score":0.68679017,"about_ca_system_score_codex":0.00011384252,"about_ca_system_score_gemma":0.00061184913,"threshold_uncertainty_score":0.99981654},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014616616,0.0010422076,0.9763146,0.005763396,0.0029597557,0.0005397646,0.000008591972,0.0003428989,0.0130141415],"genre_scores_gemma":[0.008438632,0.00017960799,0.9826998,0.0037592277,0.0013220491,0.000018614965,0.0000046651303,0.000058280137,0.0035191313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939942,0.00009332,0.00066013256,0.0024417404,0.0017406325,0.0010699916],"domain_scores_gemma":[0.99524677,0.00037658282,0.0005405839,0.0031967862,0.00039152484,0.0002477703],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016859709,0.00083747,0.00072638126,0.0008298978,0.00039808665,0.0016495717,0.0068441825,0.000645573,0.000042533913],"category_scores_gemma":[0.00022001484,0.00077782234,0.00023402231,0.0010116842,0.0009446256,0.002434728,0.0019427204,0.0013586022,0.0001419744],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041075327,0.000024280564,0.0000069352795,0.000028469824,0.000009877086,0.000029032852,0.0012585014,0.0017223652,0.00011151819,0.12680337,0.000106094456,0.86989546],"study_design_scores_gemma":[0.0003919651,0.00034112707,0.00012860238,0.00046756686,0.000021459706,0.00025429492,6.08442e-7,0.5488135,0.015585293,0.26442254,0.16757643,0.0019966206],"about_ca_topic_score_codex":0.00001330337,"about_ca_topic_score_gemma":0.00001973156,"teacher_disagreement_score":0.8678988,"about_ca_system_score_codex":0.000594455,"about_ca_system_score_gemma":0.00056871277,"threshold_uncertainty_score":0.99946725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007487446,0.000066090826,0.9335466,0.00036797998,0.0028843014,0.00041944193,0.000034080276,0.00013441064,0.055059653],"genre_scores_gemma":[0.9240675,0.00005716911,0.06501285,0.0016103759,0.00075709174,0.00006197758,0.000033151686,0.000053407806,0.008346466],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957413,0.000032922697,0.0008631533,0.0009058821,0.00199437,0.00046236187],"domain_scores_gemma":[0.9972412,0.00081518065,0.0004702242,0.00090094924,0.00041357556,0.00015887347],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0021871205,0.00035553187,0.0004125206,0.0016831588,0.0003996545,0.0007683348,0.0022525107,0.000129929,0.0010216228],"category_scores_gemma":[0.0004103978,0.0002942524,0.00015803454,0.0006966664,0.0005234143,0.0022782255,0.00082309055,0.0005389862,0.00083596533],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008312404,0.000025315994,0.0008545799,0.000014776262,0.000011798581,0.000033929242,0.005664846,0.005697172,0.00003765613,0.03259317,0.00029109567,0.95476735],"study_design_scores_gemma":[0.0006019263,0.0002726684,0.019950526,0.0006776584,0.000056177465,0.000040757717,0.0000206891,0.053996693,0.000820459,0.8926353,0.029030336,0.0018968494],"about_ca_topic_score_codex":0.000019835705,"about_ca_topic_score_gemma":0.000089003326,"teacher_disagreement_score":0.9528705,"about_ca_system_score_codex":0.00014500499,"about_ca_system_score_gemma":0.00017617186,"threshold_uncertainty_score":0.99995095},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057951357,0.0047612963,0.92474765,0.00046569938,0.000791026,0.0004349116,0.000019097177,0.000048768245,0.010780189],"genre_scores_gemma":[0.96949404,0.00058225356,0.026974734,0.0018024581,0.0005019294,0.0000026506755,0.000036225414,0.000021986394,0.00058373576],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984019,0.000028806779,0.00023048912,0.0007911096,0.00020105334,0.00034668398],"domain_scores_gemma":[0.9992565,0.00009387356,0.000114075745,0.00034276338,0.00009436952,0.00009842425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024934098,0.00030970637,0.00029236596,0.0001006872,0.00018774651,0.000067384404,0.0005105164,0.00030388968,0.000007927758],"category_scores_gemma":[0.00006863508,0.00023982908,0.000068483714,0.00009930879,0.0010968369,0.0000049730957,0.00078320835,0.00036558748,0.0000068753893],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082153594,0.00005159713,0.0010719722,0.000051538074,0.000056774876,0.00016059831,0.0007788771,0.003017661,0.025114356,0.0005643967,0.0002788569,0.9687712],"study_design_scores_gemma":[0.006983797,0.013318763,0.010086172,0.002673028,0.00017567156,0.0033822907,0.000011758033,0.13505471,0.28811267,0.15226267,0.37485975,0.013078746],"about_ca_topic_score_codex":0.00000871416,"about_ca_topic_score_gemma":0.00002076272,"teacher_disagreement_score":0.95569247,"about_ca_system_score_codex":0.000027455011,"about_ca_system_score_gemma":0.000103316466,"threshold_uncertainty_score":0.9779946},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016367703,0.00021984267,0.99699897,0.0016285431,0.00012042734,0.00048956956,0.0000062133995,0.00013254341,0.00024022587],"genre_scores_gemma":[0.02514333,0.000086364904,0.97134745,0.002936189,0.00023921723,0.000041082538,0.000012275238,0.00004108166,0.00015299022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971686,0.000026333471,0.00038348374,0.0013161795,0.0005375189,0.0005678656],"domain_scores_gemma":[0.9983977,0.00024644795,0.00024066234,0.00081650604,0.00012821429,0.00017049098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001792786,0.00046496777,0.00037111476,0.0002759415,0.0003826152,0.00057149655,0.0012495839,0.00016501766,0.000011392352],"category_scores_gemma":[0.00000522707,0.0004070674,0.000056247263,0.00045968863,0.0005679265,0.0004697702,0.00050246454,0.00045297568,0.000004290244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033760625,0.000009994425,0.0000314198,0.000008515106,0.000004485702,0.00003429473,0.00010958265,0.81455976,0.000009166963,0.0012338198,0.000056967292,0.18393862],"study_design_scores_gemma":[0.00028527266,0.00019584523,0.00009883601,0.0000913643,0.0000125307615,0.00007544279,1.1564408e-7,0.9859554,0.000020766272,0.012587832,0.00021317524,0.00046342827],"about_ca_topic_score_codex":0.0000079236925,"about_ca_topic_score_gemma":0.0000437887,"teacher_disagreement_score":0.1834752,"about_ca_system_score_codex":0.000067868736,"about_ca_system_score_gemma":0.00016963034,"threshold_uncertainty_score":0.9998381},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004877833,0.0000468834,0.982925,0.00015833043,0.00040747738,0.00022332832,0.000010882003,0.00010606261,0.01563427],"genre_scores_gemma":[0.9657688,0.000068855494,0.03132851,0.0023148856,0.00017062723,0.000021179036,0.00015726186,0.00002826097,0.00014161333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884295,0.000004332813,0.00042260494,0.0001024308,0.0004007868,0.00022686302],"domain_scores_gemma":[0.9994271,0.000066309076,0.00008317245,0.00030620556,0.00008772568,0.000029512055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032383323,0.00020782504,0.0001485634,0.0005016502,0.00007104949,0.00026479494,0.00049067684,0.00018864995,0.0000058191495],"category_scores_gemma":[0.000023951727,0.00016899811,0.00003833216,0.0002544615,0.00013171708,0.0013526069,0.000089730325,0.0004710273,0.000047140667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.104314e-7,0.0000011828604,0.000006544376,0.00002276813,0.0000010716371,2.807597e-7,0.00079807616,0.9095447,0.000002045091,0.0022660473,0.000073293755,0.087283075],"study_design_scores_gemma":[0.000116061325,0.00000727402,0.00009102302,0.0000673505,0.0000020311006,0.0000034912598,5.577869e-7,0.979795,0.000051914754,0.017809363,0.0018636179,0.0001923212],"about_ca_topic_score_codex":0.00001736385,"about_ca_topic_score_gemma":0.00013752242,"teacher_disagreement_score":0.965281,"about_ca_system_score_codex":0.00027773346,"about_ca_system_score_gemma":0.00011058553,"threshold_uncertainty_score":0.6891543},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007261224,0.0015807,0.9917548,0.0004894929,0.0012408552,0.0007712208,0.0000858348,0.00017795837,0.0031730433],"genre_scores_gemma":[0.99016386,0.000061532424,0.00726682,0.0014223203,0.00041422056,0.00002163007,0.00001567696,0.00003500691,0.00059895625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583733,0.00004810572,0.0006165684,0.0017769616,0.0009893834,0.00073163165],"domain_scores_gemma":[0.99753386,0.00036279287,0.00041293373,0.0009791488,0.000437937,0.0002733111],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074187765,0.00069386064,0.00081623223,0.0004486979,0.0002811396,0.00079189724,0.0020462053,0.00039660887,0.000016611077],"category_scores_gemma":[0.00010387702,0.0005464025,0.00018787172,0.00045402825,0.00029993587,0.00090834586,0.000411785,0.0007319841,0.000056723988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015704517,0.00022075394,0.00027793244,0.00028460883,0.00013140295,0.000752854,0.0020178289,0.090883724,0.00096193963,0.025841463,0.0003286289,0.8781418],"study_design_scores_gemma":[0.0017062428,0.00049048825,0.0008661093,0.0010449432,0.000014378334,0.00019701407,3.4880776e-7,0.98451805,0.00031371604,0.008782875,0.0011226028,0.00094325806],"about_ca_topic_score_codex":0.000057388548,"about_ca_topic_score_gemma":0.00004895801,"teacher_disagreement_score":0.9894377,"about_ca_system_score_codex":0.00031997636,"about_ca_system_score_gemma":0.00030721334,"threshold_uncertainty_score":0.99969876},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011298628,0.00008495679,0.98598766,0.00021542981,0.0011261305,0.0003282772,0.000017575974,0.000058759295,0.00088257977],"genre_scores_gemma":[0.8171192,0.00014497679,0.18105744,0.0012258437,0.0002145766,0.000010526294,0.00003398925,0.00003486428,0.00015861979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973519,0.000027883838,0.0005519438,0.00087338616,0.00077431515,0.00042058123],"domain_scores_gemma":[0.99815357,0.00008150112,0.00038221024,0.0009816797,0.0003082602,0.000092799164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041280268,0.00036608096,0.00040183857,0.000724655,0.00021081745,0.00022632016,0.0016748059,0.00019425493,0.000059753245],"category_scores_gemma":[0.000020634743,0.00033875203,0.000109626286,0.0007253763,0.00041098983,0.0005520181,0.000448518,0.00039833173,0.0000046658274],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011400145,0.000073890034,0.0014954298,0.00024267404,0.000043106233,0.000025223528,0.003067895,0.0062180837,0.005219009,0.11003752,0.000037675876,0.87352806],"study_design_scores_gemma":[0.0022553138,0.0013377613,0.030920796,0.0013818071,0.00007943011,0.00035578667,0.0000018325346,0.5484049,0.06454558,0.31777444,0.02858229,0.0043600495],"about_ca_topic_score_codex":0.000008433921,"about_ca_topic_score_gemma":0.000020977646,"teacher_disagreement_score":0.86916804,"about_ca_system_score_codex":0.00008973701,"about_ca_system_score_gemma":0.00025137534,"threshold_uncertainty_score":0.9999064},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4967126,0.000013834579,0.5026704,0.0002837073,0.00023356377,0.00006670668,7.2769694e-7,0.000013133517,0.0000053045123],"genre_scores_gemma":[0.7475384,0.0000053718527,0.25232846,0.000050613948,0.0000687525,0.0000018261535,0.0000016006355,0.000004839537,1.5008959e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99894565,0.000021524314,0.00021191122,0.00033880034,0.0002516186,0.00023049269],"domain_scores_gemma":[0.9992464,0.00022141839,0.000078639445,0.00028086724,0.00010687106,0.00006578223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039875804,0.00009747059,0.0001541038,0.00055132824,0.000097880955,0.00004167242,0.00015167744,0.00006249447,0.0000070230517],"category_scores_gemma":[0.00025246444,0.00008539868,0.000044098495,0.0014291545,0.00042925208,0.0002479442,0.00003230413,0.00037723273,0.0000011242425],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009711048,0.00007832716,0.43672225,0.000009670376,0.0000011509208,7.3152995e-7,0.00016824961,0.0031171832,0.51927537,0.0000025130053,7.737729e-7,0.040614054],"study_design_scores_gemma":[0.0002673284,0.000040669267,0.72213495,0.00010906771,0.0000060884686,0.00003496472,0.000002735939,0.22818643,0.048981868,0.000162124,0.000006335466,0.0000674644],"about_ca_topic_score_codex":0.00035553705,"about_ca_topic_score_gemma":0.0003514512,"teacher_disagreement_score":0.47029352,"about_ca_system_score_codex":0.000046118537,"about_ca_system_score_gemma":0.00011323322,"threshold_uncertainty_score":0.3482457},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000072300218,0.001245161,0.9961606,0.00033300053,0.0006233477,0.0002501715,0.0000051018906,0.00015392397,0.0012214398],"genre_scores_gemma":[0.0111644985,0.00008933692,0.98777336,0.0005502973,0.00025328912,0.0000062888676,0.0000069816188,0.000024259405,0.00013169626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974797,0.000014191556,0.00037162632,0.0011797138,0.00054832216,0.00040646543],"domain_scores_gemma":[0.9986166,0.00009587627,0.00024445323,0.0007451419,0.00017224559,0.00012570001],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039193625,0.0003742161,0.00036719887,0.0004465544,0.00029481467,0.00036675317,0.00085847743,0.00018521975,0.00000765903],"category_scores_gemma":[0.00004883713,0.00033253158,0.000041866682,0.0003707265,0.00055607216,0.001440367,0.0008818099,0.00039597598,0.000005916563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019954728,0.0000077864825,0.000009221379,0.00008623578,0.0000025274883,0.000048390615,0.00047423228,0.4224242,0.000025848085,0.09790101,0.0000020451466,0.4790165],"study_design_scores_gemma":[0.00027217378,0.00009881747,0.000022394097,0.0012808781,0.0000050781528,0.00016057967,3.08095e-7,0.91241133,0.00038450462,0.082564816,0.0020701506,0.00072899467],"about_ca_topic_score_codex":0.00002356129,"about_ca_topic_score_gemma":0.000031721145,"teacher_disagreement_score":0.4899871,"about_ca_system_score_codex":0.00019920881,"about_ca_system_score_gemma":0.00058530964,"threshold_uncertainty_score":0.9999127},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004987831,0.00067954796,0.9956955,0.00010225909,0.0018752251,0.0011625701,0.0000124105645,0.00028122053,0.00018633608],"genre_scores_gemma":[0.0007989989,0.000031135685,0.9980282,0.00027908155,0.0005541667,0.00013473028,0.000027531532,0.00009719643,0.00004896033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981077,0.000007604964,0.00041924862,0.0006550028,0.00031576806,0.0004946918],"domain_scores_gemma":[0.99857455,0.00061647984,0.00012379904,0.0003513556,0.0002377833,0.00009603118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006997999,0.00038870078,0.00037703107,0.00042926447,0.00021228768,0.0002636337,0.0004532942,0.00044616262,0.0000067077312],"category_scores_gemma":[0.00025444853,0.00040049123,0.000119402,0.00028393077,0.00013183051,0.00018149316,0.000041667507,0.00046560963,0.0000036699103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021725311,0.0000048253223,0.0000010161308,0.0001524231,0.0000111436575,5.0869284e-7,0.00026450484,0.84458363,0.00003287601,0.0031414446,0.000003369041,0.15180206],"study_design_scores_gemma":[0.00023465908,0.000055609176,2.7834056e-7,0.00051469944,0.0000137891,0.000006095416,4.6670385e-7,0.8382081,0.0016612795,0.15867157,0.00023348091,0.00039999597],"about_ca_topic_score_codex":5.900095e-7,"about_ca_topic_score_gemma":0.0000013835415,"teacher_disagreement_score":0.15553012,"about_ca_system_score_codex":0.00020253714,"about_ca_system_score_gemma":0.00010034422,"threshold_uncertainty_score":0.9998447},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010731362,0.00010855728,0.99742645,0.00033609505,0.0003086232,0.00038270612,0.0000024443314,0.00006324279,0.00029877113],"genre_scores_gemma":[0.5496694,0.000010886999,0.4500287,0.00020772363,0.00003246188,0.0000103498,0.000027782231,0.000005277323,0.0000074223276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767053,0.000039716124,0.0007201781,0.0006674692,0.0006090784,0.00029300337],"domain_scores_gemma":[0.9979046,0.0003059406,0.0004972807,0.0009000838,0.00031452443,0.00007754963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009981518,0.00025642014,0.00041529883,0.0019563984,0.000100442805,0.00046649855,0.0013466553,0.00022133261,0.000009273207],"category_scores_gemma":[0.00008065029,0.00025102604,0.00009099822,0.0019360165,0.00038353275,0.0009834777,0.00031427474,0.00035694393,0.000015862464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025122913,0.0000254777,0.0010793689,0.00006450499,0.000013324289,0.0000010743697,0.0009706878,0.08632438,0.000025285644,0.012939807,0.0000015255503,0.89855206],"study_design_scores_gemma":[0.00015650233,0.00005330153,0.0041289083,0.00015758866,0.000013743744,0.0000022813404,3.8897312e-7,0.9791892,0.00060636736,0.015224379,0.00021452861,0.00025276715],"about_ca_topic_score_codex":0.000109226334,"about_ca_topic_score_gemma":0.000114891904,"teacher_disagreement_score":0.8982993,"about_ca_system_score_codex":0.00012256115,"about_ca_system_score_gemma":0.00025980643,"threshold_uncertainty_score":0.9999942},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029574718,0.00010434043,0.99748594,0.00030354166,0.00069085456,0.0007843495,0.000003922405,0.00039969845,0.00019780993],"genre_scores_gemma":[0.056615777,0.000020049067,0.9417713,0.001081571,0.00027894034,0.000057871584,0.000003531192,0.000028907321,0.00014200386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975157,0.000044877816,0.00040391905,0.0012219502,0.00040603254,0.00040753002],"domain_scores_gemma":[0.99798566,0.0003727211,0.00027400683,0.0009026703,0.0003293367,0.00013558984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097417185,0.0003944449,0.00036830766,0.00078313967,0.00032380776,0.000985231,0.0012099989,0.0003619087,0.000010096212],"category_scores_gemma":[0.00009899115,0.00036302218,0.00007677833,0.00034974923,0.00021599856,0.0016231621,0.0003297096,0.0004907218,0.0000120701625],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041393387,0.000009224599,2.8312408e-7,0.000028692062,0.0000036876434,0.000003485456,0.00017991527,0.003759461,0.0018134527,0.0011347334,0.0000051400616,0.9930578],"study_design_scores_gemma":[0.000109852204,0.0004894361,0.000019380755,0.000070505615,0.000005922511,0.000053917527,8.924488e-8,0.70740145,0.10483956,0.18632011,0.00037464054,0.00031510432],"about_ca_topic_score_codex":0.000071704904,"about_ca_topic_score_gemma":0.00007177267,"teacher_disagreement_score":0.99274266,"about_ca_system_score_codex":0.00016813884,"about_ca_system_score_gemma":0.00012637798,"threshold_uncertainty_score":0.99988216},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083381106,0.00030765284,0.99438655,0.0006559962,0.00081947935,0.00041225908,0.000003379656,0.00011458065,0.0024662595],"genre_scores_gemma":[0.25714386,0.000048916714,0.74056965,0.00094818894,0.00052135973,0.000020277983,0.00002905555,0.000021172016,0.00069753046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973399,0.000033069264,0.00040539805,0.0011862353,0.00068989536,0.00034550996],"domain_scores_gemma":[0.9982865,0.00038854865,0.00019790122,0.0007474443,0.00023467228,0.00014491903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006720043,0.00034461732,0.00032384062,0.00057503534,0.00020978774,0.0005816069,0.0010552222,0.00021604281,0.000039059476],"category_scores_gemma":[0.0000879224,0.0003162715,0.000054636075,0.00041854187,0.00035709824,0.00084401964,0.00067994,0.00039415553,0.00006288153],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024101532,0.000021552392,0.000039294082,0.000037764006,0.0000058266473,0.000005553308,0.0004224113,0.03475545,0.00016650303,0.044847697,0.00003954219,0.919656],"study_design_scores_gemma":[0.00014841386,0.00009217917,0.0007146112,0.000081668826,0.0000036318618,0.000039278926,9.340789e-8,0.7072947,0.00065913633,0.2895958,0.0010080383,0.0003624126],"about_ca_topic_score_codex":0.000015722786,"about_ca_topic_score_gemma":0.000027526316,"teacher_disagreement_score":0.9192936,"about_ca_system_score_codex":0.00014718494,"about_ca_system_score_gemma":0.0002675351,"threshold_uncertainty_score":0.99992895},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000853588,0.00085729617,0.99013036,0.00036173416,0.00045707522,0.0006861426,0.000025020177,0.00035617015,0.0071176337],"genre_scores_gemma":[0.09246264,0.000045481942,0.90615064,0.000468344,0.0005998515,0.00007519246,0.000007693016,0.00008510564,0.000105077255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997989,0.000016341226,0.00031526922,0.0007714758,0.00048762042,0.000420322],"domain_scores_gemma":[0.99830776,0.0003691059,0.00008555269,0.00066690135,0.00045936726,0.00011131639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002871178,0.00044282977,0.00036206143,0.00047629466,0.00014852422,0.00014511067,0.0008236936,0.0002831341,0.000050017934],"category_scores_gemma":[0.000057832804,0.00045266183,0.000063402345,0.0005354087,0.00045013978,0.0001383186,0.00010594696,0.0006503048,0.00008111949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003348003,0.000010317598,0.0000011175568,0.000010955013,0.000010861769,0.000005751696,0.0007304737,0.94987977,0.000104821745,0.0016913057,0.000038133105,0.04751317],"study_design_scores_gemma":[0.00016343729,0.00006425926,0.000005467792,0.00016198955,0.000014209072,0.0000040690875,5.399965e-7,0.971628,0.0015139173,0.024692005,0.0012704736,0.00048163498],"about_ca_topic_score_codex":0.000020844982,"about_ca_topic_score_gemma":0.0001330287,"teacher_disagreement_score":0.0924541,"about_ca_system_score_codex":0.0009369118,"about_ca_system_score_gemma":0.00053501356,"threshold_uncertainty_score":0.9997925},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5530156,0.000007819873,0.4404145,0.0061431117,0.000111772424,0.00022357746,0.0000051300494,0.000032268905,0.000046218844],"genre_scores_gemma":[0.9739685,0.0000023248717,0.024545781,0.0013965539,0.000049547976,0.000030717758,4.6073148e-7,0.0000056595804,4.265791e-7],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985064,0.0000883784,0.00020537712,0.0006326257,0.00031413452,0.00025307763],"domain_scores_gemma":[0.9894176,0.009964057,0.000105398896,0.00032935492,0.000121502555,0.00006209219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035060904,0.00014421296,0.00020723703,0.0002700952,0.0003071672,0.00008746698,0.00030605035,0.000048465918,0.0000059883437],"category_scores_gemma":[0.0067015486,0.00012442657,0.000028832359,0.00092282123,0.0010079043,0.00045968738,0.00026474512,0.00017147751,0.000011013034],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000117927975,0.00015806447,0.13476694,0.00004113868,0.0000064098062,0.0000013532187,0.0013742266,0.05739678,0.1420198,0.002543175,0.000045032495,0.6616353],"study_design_scores_gemma":[0.00021063432,0.00018528038,0.62639743,0.000032348387,0.000003149193,0.000009576617,0.0000018926252,0.17545624,0.1604619,0.03707992,0.000006145585,0.00015547291],"about_ca_topic_score_codex":0.00013680106,"about_ca_topic_score_gemma":0.000045021177,"teacher_disagreement_score":0.66147983,"about_ca_system_score_codex":0.00008284334,"about_ca_system_score_gemma":0.00007754523,"threshold_uncertainty_score":0.8022864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013958957,0.00026567737,0.99495596,0.00032914605,0.0029809892,0.00081462483,0.000015613174,0.00025041966,0.000373639],"genre_scores_gemma":[0.013954034,0.000010248592,0.9840256,0.0010803271,0.00067419454,0.000071313756,0.000048135782,0.000045640732,0.00009051585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647766,0.00006827807,0.0006719848,0.0014194838,0.0006882074,0.00067437807],"domain_scores_gemma":[0.99658275,0.00040100137,0.0005068474,0.0017521667,0.0005293102,0.00022791441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018051275,0.0005160367,0.00042550536,0.0008612399,0.00028340795,0.0005793126,0.003440332,0.00039427934,0.000022245082],"category_scores_gemma":[0.00016599834,0.00050913816,0.00014217943,0.0005170211,0.0005128375,0.002085531,0.00039109445,0.0005721219,0.0000330971],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006676427,0.000036411275,0.00001010369,0.000035710233,0.00000476069,0.000001050044,0.00047904564,0.0007979592,0.0002749952,0.019729692,0.000010078307,0.9786135],"study_design_scores_gemma":[0.00023876366,0.00026075152,0.00011855408,0.00018434583,0.000009766432,0.000018708073,3.6652773e-7,0.96383506,0.00407636,0.028990105,0.0016980072,0.0005692266],"about_ca_topic_score_codex":0.000011842704,"about_ca_topic_score_gemma":0.000014273758,"teacher_disagreement_score":0.9780443,"about_ca_system_score_codex":0.00042788778,"about_ca_system_score_gemma":0.0005435971,"threshold_uncertainty_score":0.999736},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44372478,0.000016002497,0.5558073,0.00007635371,0.000270364,0.000062721905,0.0000013158759,0.000034333505,0.000006860007],"genre_scores_gemma":[0.639028,0.0000017123224,0.3607787,0.000084372856,0.000095643176,3.7355798e-7,0.000004319925,0.0000055609858,0.0000012942153],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99788374,0.000034205677,0.00046354329,0.0006059463,0.000534621,0.000477958],"domain_scores_gemma":[0.9986547,0.00021591368,0.00027830005,0.0005417286,0.00021651384,0.00009284251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096919347,0.00019338407,0.00029109162,0.0003933436,0.00024565854,0.00022008436,0.0009437456,0.000085553474,0.000019574976],"category_scores_gemma":[0.00013335524,0.00017213913,0.000048816448,0.0024723122,0.00030715924,0.0016078408,0.0003536045,0.00016152755,0.000007957644],"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.0000052472546,0.00003714495,0.0021122165,0.0000091834745,0.0000046394634,0.000017317472,0.00079035276,0.009639521,0.74003506,0.00051400857,1.9099144e-7,0.24683513],"study_design_scores_gemma":[0.00013588325,0.00016382075,0.021283504,0.000078692436,0.000006492315,0.000138785,0.0000011101907,0.3185529,0.65563214,0.003706017,0.0000102146305,0.00029043749],"about_ca_topic_score_codex":0.00017408446,"about_ca_topic_score_gemma":0.000031487743,"teacher_disagreement_score":0.30891338,"about_ca_system_score_codex":0.00009561012,"about_ca_system_score_gemma":0.000109049826,"threshold_uncertainty_score":0.701963},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04997508,0.00015640094,0.94752246,0.0011718812,0.00049771817,0.0002722602,0.0000048458837,0.00008380675,0.00031553753],"genre_scores_gemma":[0.7646996,0.000027155638,0.23216817,0.00017575722,0.0005689759,0.0000150494725,0.000016503336,0.000042568332,0.002286265],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981158,0.000013384456,0.00023288223,0.0009112656,0.0004449517,0.00028174155],"domain_scores_gemma":[0.99916816,0.00004556733,0.00013309107,0.00038384213,0.00012806461,0.0001412773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024805308,0.00030736136,0.00039007424,0.00036442815,0.00022446402,0.00015573313,0.00014809589,0.00016541405,0.000025542682],"category_scores_gemma":[0.000041384046,0.00022822354,0.000064637235,0.00025446943,0.0006863857,0.00019230717,0.00009765182,0.0007543641,0.0000054759266],"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.00018565303,0.00018599571,0.006007618,0.00038276095,0.00009502041,0.00008006873,0.0015106016,0.0019434179,0.5720433,0.0000039073234,0.000017062306,0.41754457],"study_design_scores_gemma":[0.002071174,0.0012576868,0.022609757,0.0049984637,0.0006682353,0.0043620253,0.0000082180695,0.3936644,0.56461877,0.0016542542,0.0017794502,0.0023075514],"about_ca_topic_score_codex":0.000049009595,"about_ca_topic_score_gemma":0.00022370079,"teacher_disagreement_score":0.7153543,"about_ca_system_score_codex":0.00009786337,"about_ca_system_score_gemma":0.00006483363,"threshold_uncertainty_score":0.9306686},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009442994,0.000058034384,0.9868234,0.0031490424,0.00017545854,0.00024977096,0.0000015494409,0.00006923301,0.000030538158],"genre_scores_gemma":[0.48387274,0.0000030956592,0.5153179,0.000617742,0.00016268967,0.000019873247,0.0000013237402,0.0000036410731,9.367317e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824816,0.000026794149,0.00022615067,0.0006992259,0.00025383945,0.0005458316],"domain_scores_gemma":[0.9987734,0.0003817825,0.00005027043,0.00065163645,0.000052480435,0.00009040948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009390131,0.00012881894,0.00014391988,0.0002810104,0.00015805192,0.0004188009,0.0020121972,0.00004854771,0.0000010939934],"category_scores_gemma":[0.0000766445,0.00011799734,0.000034369412,0.0018253281,0.00020808076,0.0007385749,0.0005257335,0.00023396869,0.00000903698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.878e-7,0.000027051798,0.00009202599,0.0000018551021,4.1032928e-7,0.0000011116889,0.00047154631,0.39546573,0.00006854608,0.0011495397,0.000012070106,0.6027094],"study_design_scores_gemma":[0.00025530267,0.000044576373,0.0016617015,0.000034335862,5.23903e-7,0.0000036431707,5.423099e-7,0.9913114,0.0006723685,0.005266343,0.0006012577,0.0001480288],"about_ca_topic_score_codex":0.00004120092,"about_ca_topic_score_gemma":0.00029749554,"teacher_disagreement_score":0.6025614,"about_ca_system_score_codex":0.00009873834,"about_ca_system_score_gemma":0.00012526872,"threshold_uncertainty_score":0.48117918},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007045348,0.00081434974,0.9831056,0.00054259587,0.0009953824,0.00017443845,0.000003937126,0.00027704798,0.014016224],"genre_scores_gemma":[0.44390336,0.00020681512,0.548317,0.0043276455,0.0010369387,0.000012066185,0.000017179304,0.000065726825,0.0021132154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955044,0.000045176927,0.0005637165,0.0018502797,0.0012536851,0.0007827787],"domain_scores_gemma":[0.99660885,0.000658389,0.00026923406,0.0020461138,0.00017042912,0.0002469839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011774447,0.00054982654,0.00080168294,0.0034770004,0.00023708084,0.00071029016,0.0048848097,0.00036077134,0.00013170739],"category_scores_gemma":[0.00009602646,0.000476067,0.00039214085,0.0050935354,0.00059608265,0.00058364164,0.0016170597,0.0007802922,0.00012465134],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027598796,0.000037091515,0.00015583212,0.000011442287,0.00009640253,0.00023998166,0.00020671307,0.027099885,0.00002216335,0.1058492,0.000035497553,0.866243],"study_design_scores_gemma":[0.00015580804,0.00009631777,0.00042473502,0.00007124893,0.00007589892,0.00006976071,7.412014e-8,0.7063438,0.0002572023,0.2882593,0.003530207,0.00071561884],"about_ca_topic_score_codex":0.000034776403,"about_ca_topic_score_gemma":0.00004839496,"teacher_disagreement_score":0.8655274,"about_ca_system_score_codex":0.0002790031,"about_ca_system_score_gemma":0.0003009293,"threshold_uncertainty_score":0.9997691},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008295847,0.0004745151,0.98706806,0.00042786385,0.0073859654,0.00068964623,0.0000047300227,0.00039114553,0.0034751277],"genre_scores_gemma":[0.10887644,0.00001001084,0.8876006,0.0005956027,0.0010998234,0.00003678145,0.000010889329,0.00006358592,0.0017062755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935223,0.00005097573,0.00083207514,0.0023718148,0.0022763691,0.0009464987],"domain_scores_gemma":[0.99539644,0.00038975428,0.00042761222,0.002721438,0.0007470387,0.00031769267],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018588668,0.0007306413,0.00072707667,0.0010860227,0.0003431056,0.0009721105,0.0047597224,0.00059023435,0.000008424867],"category_scores_gemma":[0.00022681362,0.00067642884,0.00018939676,0.00070067804,0.0005646092,0.00040240245,0.0014974262,0.0018812822,0.00004012211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007862905,0.00007215254,0.000092704504,0.00019167342,0.000020020505,0.00012099929,0.0014709258,0.44571143,0.0004462179,0.1231144,0.000011933045,0.42873967],"study_design_scores_gemma":[0.00021539001,0.00008667363,0.000007968497,0.0003701832,0.000008222278,0.00007801898,3.8940007e-7,0.97812366,0.0015550066,0.0073034,0.011517424,0.0007336438],"about_ca_topic_score_codex":0.000085669046,"about_ca_topic_score_gemma":0.000025251162,"teacher_disagreement_score":0.53241223,"about_ca_system_score_codex":0.00050865836,"about_ca_system_score_gemma":0.00095941126,"threshold_uncertainty_score":0.9995687},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063015014,0.0012435643,0.9955416,0.000014893082,0.0002363197,0.0007957571,0.000008595455,0.00031612362,0.0012129981],"genre_scores_gemma":[0.49534008,0.00014666944,0.5041826,0.000076251104,0.00007295218,0.00005945085,0.000050383274,0.000044518012,0.000027122893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880844,0.00001297409,0.0002875988,0.00042484092,0.00018834403,0.00027782016],"domain_scores_gemma":[0.99907017,0.000122033285,0.000115154064,0.0005223717,0.00012975189,0.000040536754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035172966,0.00029412803,0.00034874465,0.00037765293,0.00018455408,0.000112869435,0.00060027593,0.00039840926,0.000003464359],"category_scores_gemma":[0.00003577147,0.00027486513,0.00005572377,0.0002169638,0.0004769608,0.00019779055,0.00022518683,0.0003945293,0.0000017162718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018691846,0.000015028804,0.000038486247,0.00024388214,0.000019359379,0.0000017835978,0.00093810825,0.7507401,0.00078640255,0.009414993,0.000009039981,0.23777412],"study_design_scores_gemma":[0.0004742176,0.00005704115,0.000009877369,0.00019109956,0.000020992607,0.000022752598,0.0000020386747,0.89714664,0.004628039,0.0968344,0.00020045022,0.00041245756],"about_ca_topic_score_codex":0.000010886975,"about_ca_topic_score_gemma":0.0000051684824,"teacher_disagreement_score":0.49470994,"about_ca_system_score_codex":0.00017563684,"about_ca_system_score_gemma":0.0000519086,"threshold_uncertainty_score":0.9999704},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023326102,0.0018491758,0.98318624,0.0011930894,0.009312193,0.0005456786,0.000003372486,0.000049852988,0.0036271103],"genre_scores_gemma":[0.9833641,0.00014657516,0.013352123,0.0008803541,0.0007311904,0.000011803466,0.0000010234852,0.000030509065,0.0014823398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698347,0.00009351193,0.0006073572,0.0007275016,0.00097369903,0.000614476],"domain_scores_gemma":[0.9967151,0.0005208086,0.00048891595,0.0018866822,0.00029002625,0.000098435004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015376903,0.00037376196,0.0003850735,0.00015510875,0.00053952594,0.00039257793,0.0046392046,0.0001890657,0.0000134507945],"category_scores_gemma":[0.000038222097,0.00020743103,0.00025932927,0.0005468581,0.0007483843,0.00027939634,0.0013705149,0.0005905412,0.000013961877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023271441,0.0001076408,0.0009190491,0.00009814634,0.00011150011,0.000012314788,0.0038778854,0.083696075,0.00054879824,0.14368464,0.0016097709,0.7653109],"study_design_scores_gemma":[0.0009855618,0.0004017702,0.0013780646,0.002388564,0.00004739627,0.00019083961,0.0000040013488,0.73603153,0.0055214604,0.15533991,0.095888436,0.0018224664],"about_ca_topic_score_codex":0.000027931364,"about_ca_topic_score_gemma":0.00019517251,"teacher_disagreement_score":0.9831308,"about_ca_system_score_codex":0.00017400252,"about_ca_system_score_gemma":0.0001964943,"threshold_uncertainty_score":0.8620873},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027676247,0.00056550844,0.9955121,0.0014966889,0.00021689804,0.00046134845,0.000028033968,0.00015818521,0.0012844333],"genre_scores_gemma":[0.28330618,0.000049454797,0.7122605,0.0038040895,0.0004495469,0.000014787249,0.000034819648,0.00003589117,0.000044757002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519134,0.00029485408,0.0009820736,0.0022699342,0.00053108233,0.0007306934],"domain_scores_gemma":[0.98236835,0.015150117,0.0004213439,0.0017466358,0.00015504984,0.00015848527],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007889964,0.00069585536,0.0015413866,0.00024277031,0.0003269317,0.00013118937,0.0022280947,0.00049555505,0.000018700446],"category_scores_gemma":[0.01775342,0.00045831956,0.0001215501,0.00021765172,0.0010917954,0.00012096746,0.0030110625,0.0012555853,0.0000050884064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009123106,0.00015873737,0.009792665,0.0014767018,0.00012373627,0.000063487016,0.00078854256,0.37961087,0.000049629434,0.102707095,0.0008895802,0.5042477],"study_design_scores_gemma":[0.0001320277,0.00006539192,0.000077436096,0.00024007913,0.000009075362,0.000008780456,3.1074225e-7,0.72922605,0.000001514073,0.26949447,0.00034611908,0.00039874038],"about_ca_topic_score_codex":0.00005928507,"about_ca_topic_score_gemma":0.00015471647,"teacher_disagreement_score":0.50384897,"about_ca_system_score_codex":0.00017764395,"about_ca_system_score_gemma":0.00012232272,"threshold_uncertainty_score":0.99978685},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008910793,0.00023365428,0.96286863,0.00037770186,0.0060978183,0.001583291,0.00002159592,0.00015089678,0.027775303],"genre_scores_gemma":[0.7456221,0.00012466071,0.21667613,0.0014200938,0.014458507,0.00013659925,0.00006470109,0.00014325684,0.021353979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966825,0.000059458038,0.0006528901,0.00068465277,0.001319339,0.0006011271],"domain_scores_gemma":[0.99827045,0.00015356007,0.00038067027,0.00046837458,0.0005787133,0.00014824352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017510907,0.00033726954,0.00043915832,0.0007917535,0.0010049981,0.00058779016,0.0007089139,0.00030419248,0.00001971429],"category_scores_gemma":[0.00007571143,0.00032187122,0.00009857981,0.00047133872,0.0005663844,0.00037340334,0.00030203752,0.00024021884,0.00013757485],"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.000011091283,0.00004595632,0.0004589836,0.00025348284,0.00007279559,0.000046084573,0.040138602,0.8486431,0.0048855892,0.028515281,0.0020982292,0.07483081],"study_design_scores_gemma":[0.0005815531,0.00021758211,0.00022726206,0.0012705401,0.000058470087,0.000017362381,0.000046783916,0.9259878,0.00052023376,0.0052928263,0.063395694,0.0023838824],"about_ca_topic_score_codex":0.0069777304,"about_ca_topic_score_gemma":0.0016289686,"teacher_disagreement_score":0.7461925,"about_ca_system_score_codex":0.0007271375,"about_ca_system_score_gemma":0.00040815014,"threshold_uncertainty_score":0.99992335},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000103512764,0.0011759119,0.98877645,0.0028007147,0.0017045044,0.00027371984,0.0000010606365,0.00056704687,0.0045971125],"genre_scores_gemma":[0.53021765,0.00016862317,0.4668486,0.00085805776,0.00058347324,0.000025552965,0.000006159328,0.000036305282,0.001255604],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649465,0.000020121352,0.00053378445,0.0013055269,0.00087977736,0.0007661548],"domain_scores_gemma":[0.9972473,0.00036947257,0.00029963625,0.0017277017,0.00018168082,0.00017425182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054670975,0.0005342366,0.0005049454,0.000921961,0.0003822251,0.0008083961,0.00426693,0.0005125146,0.000058919395],"category_scores_gemma":[0.00010860257,0.00046402108,0.00013140276,0.00066877704,0.0011972139,0.0012826284,0.0021694726,0.00093198055,0.00030928472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000201508,0.000023847646,0.00051894784,0.00003564189,0.000008350339,0.000017379525,0.0006905124,0.00022666754,0.00039822693,0.16253419,0.00009103889,0.83545315],"study_design_scores_gemma":[0.00035723488,0.0002139269,0.0013762964,0.0002861633,0.000016481776,0.00006118992,0.0000017393978,0.08748128,0.01265317,0.861358,0.03468055,0.0015139992],"about_ca_topic_score_codex":0.00002002822,"about_ca_topic_score_gemma":0.000042412034,"teacher_disagreement_score":0.8339392,"about_ca_system_score_codex":0.00036143398,"about_ca_system_score_gemma":0.00038648577,"threshold_uncertainty_score":0.99978113},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010343221,0.0010545077,0.98990107,0.0006564787,0.0030868554,0.00049585523,0.000017371685,0.00018549176,0.0044989535],"genre_scores_gemma":[0.66028214,0.00018472706,0.33325332,0.0019427474,0.002717781,0.000017472827,0.00019092839,0.000075449745,0.0013354407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948811,0.000089494475,0.00087934284,0.0021963476,0.0010121214,0.0009415713],"domain_scores_gemma":[0.99565065,0.00045744053,0.00042860792,0.0031458016,0.00015507283,0.00016240953],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018101644,0.000553369,0.00071854226,0.0005534252,0.00019402054,0.00084771885,0.0071789157,0.00035711075,0.000015441045],"category_scores_gemma":[0.00009152168,0.0005265255,0.00009039106,0.0010428056,0.00030074964,0.0006715866,0.002844338,0.0008771128,0.000098121694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007230612,0.00009002765,0.0012410275,0.000060742874,0.000018334384,0.000368513,0.0010617492,0.4604383,0.000007229913,0.021360304,0.0019639083,0.5133826],"study_design_scores_gemma":[0.00028667317,0.00010659162,0.00031773455,0.0007082438,0.0000046575387,0.00008002125,9.636081e-8,0.95079166,0.000006240277,0.024046425,0.02304227,0.0006094012],"about_ca_topic_score_codex":0.00009938703,"about_ca_topic_score_gemma":0.0004757661,"teacher_disagreement_score":0.66017866,"about_ca_system_score_codex":0.0002589215,"about_ca_system_score_gemma":0.00032747144,"threshold_uncertainty_score":0.9997186},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034578876,0.0003935638,0.99267536,0.00029486968,0.0010625031,0.0003045448,0.000041991658,0.00014547538,0.0050471346],"genre_scores_gemma":[0.07969434,0.00005939813,0.9188405,0.0009788367,0.00023018284,0.000007414659,0.000021522203,0.000031912376,0.00013589162],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963748,0.00010183957,0.00067046,0.0014576813,0.0007518684,0.0006433522],"domain_scores_gemma":[0.99621195,0.0002887881,0.00043154001,0.0023376718,0.000430044,0.00030000988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010274634,0.0005746335,0.0007230513,0.0007862368,0.00020001046,0.00022119739,0.004292091,0.0005367891,0.000037895516],"category_scores_gemma":[0.000092642935,0.0004999167,0.00018659803,0.00092884636,0.00093188713,0.0007603229,0.00093567645,0.00092765834,0.000014815854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006309073,0.00007297523,0.000053595006,0.000039922474,0.00001661772,0.000040915013,0.00094050064,0.0004060016,0.0005706622,0.28626186,0.000050352653,0.7115403],"study_design_scores_gemma":[0.00024820902,0.00027134203,0.00027665513,0.00029904448,0.000020174963,0.00005394954,5.0446953e-8,0.14283061,0.004376724,0.8491664,0.0017016365,0.00075519463],"about_ca_topic_score_codex":0.000045518755,"about_ca_topic_score_gemma":0.000048849477,"teacher_disagreement_score":0.7107851,"about_ca_system_score_codex":0.00012449642,"about_ca_system_score_gemma":0.000589813,"threshold_uncertainty_score":0.99974525},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0380234,0.0004473425,0.9603041,0.00004724679,0.00027232963,0.0007348832,0.0000357702,0.00008771564,0.00004724881],"genre_scores_gemma":[0.52552617,0.0001350312,0.47391808,0.00011818499,0.00007679765,0.000018453218,0.000028435574,0.0000394662,0.00013936858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985817,0.000004653622,0.00035151388,0.0005567013,0.0002579724,0.0002474474],"domain_scores_gemma":[0.9990758,0.0001472749,0.00014970214,0.00022877895,0.00033095226,0.00006754673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001964366,0.00038294535,0.0004153391,0.00029274734,0.00016700686,0.000104696745,0.00026287604,0.00030801195,0.0000011429994],"category_scores_gemma":[0.000068970774,0.00032493137,0.00004344784,0.00013812668,0.0002443858,0.00037452087,0.00014576242,0.0003739322,0.000002741895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026527387,0.00002571498,0.00006011024,0.0004581156,0.00002966355,9.786544e-7,0.0023328916,0.9342504,0.015496872,0.0005301059,0.000009591932,0.046779018],"study_design_scores_gemma":[0.0006837291,0.00008977512,0.0002445254,0.00045061746,0.000017127653,0.000005019953,8.5286445e-7,0.9920766,0.0056388155,0.00040060128,0.000049455983,0.0003429316],"about_ca_topic_score_codex":0.0000011199464,"about_ca_topic_score_gemma":0.000031453397,"teacher_disagreement_score":0.48750278,"about_ca_system_score_codex":0.000057133966,"about_ca_system_score_gemma":0.00004614643,"threshold_uncertainty_score":0.99992025},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005342598,0.001553886,0.99107766,0.00064100424,0.002772464,0.00021861689,0.000002177057,0.000054187854,0.0036266006],"genre_scores_gemma":[0.29223874,0.00023994637,0.7053649,0.00057742326,0.0014247239,0.000004100872,0.0000029187236,0.000027638947,0.00011960836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967651,0.000037054197,0.0007052685,0.00094090664,0.0010567659,0.0004949056],"domain_scores_gemma":[0.99719334,0.0009408812,0.00034818167,0.0010058354,0.00042764383,0.00008411052],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080565806,0.00034715573,0.00041121308,0.0005102014,0.00028722925,0.00019962882,0.003199835,0.00023738528,0.0000027732092],"category_scores_gemma":[0.00022838218,0.00027664995,0.0000985014,0.0005454718,0.0006213722,0.00014053714,0.0010101837,0.0008776452,0.0000070633832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002690417,0.000011850947,0.00010817585,0.000016829188,0.0000043901573,0.000049481318,0.0009853477,0.42993748,0.0000031053662,0.14908907,0.000021783588,0.4197698],"study_design_scores_gemma":[0.00015924127,0.000041276107,0.00015600087,0.00020367908,0.0000017541747,0.00003544974,3.541915e-7,0.7938994,0.00003713709,0.20045851,0.0047366302,0.0002705515],"about_ca_topic_score_codex":0.000018505796,"about_ca_topic_score_gemma":0.00014139297,"teacher_disagreement_score":0.41949925,"about_ca_system_score_codex":0.00021055747,"about_ca_system_score_gemma":0.0007473465,"threshold_uncertainty_score":0.9999686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011403047,0.00083959877,0.9857698,0.0030602836,0.0010501648,0.00062341825,0.0000018806459,0.00024543016,0.0084082885],"genre_scores_gemma":[0.0029840714,0.00012965957,0.98280334,0.0014721752,0.0003039925,0.00002488672,0.0000061257115,0.00005577396,0.012219977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957476,0.000080830665,0.0005374433,0.0013034507,0.0014728846,0.0008577905],"domain_scores_gemma":[0.9966152,0.0005077671,0.00027588388,0.0016996474,0.00057379855,0.0003277077],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023624469,0.00047401444,0.00037803064,0.00043751654,0.00065913534,0.0013838916,0.005495356,0.00027227344,0.0000136430235],"category_scores_gemma":[0.00015078626,0.0003341761,0.00011615273,0.0006904512,0.0010360029,0.0005992999,0.0021907974,0.0010614219,0.00012524813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034739953,0.00003233177,0.000022298223,0.000016521686,0.000011941153,0.000023234796,0.0015595054,0.17832871,0.000010376491,0.0473404,0.00046240346,0.7721888],"study_design_scores_gemma":[0.0003288001,0.00010921371,0.000007629073,0.00012192218,0.0000030360106,0.000038427144,2.8715635e-7,0.83000827,0.000043345713,0.08357436,0.08530887,0.00045585068],"about_ca_topic_score_codex":0.000025141804,"about_ca_topic_score_gemma":0.00012542831,"teacher_disagreement_score":0.7717329,"about_ca_system_score_codex":0.00034582173,"about_ca_system_score_gemma":0.0009429556,"threshold_uncertainty_score":0.999911},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006459866,0.00032007165,0.9634912,0.0074585234,0.002577039,0.0008453409,0.000012255496,0.00018339104,0.02504756],"genre_scores_gemma":[0.34337658,0.00054687285,0.6454423,0.0031859323,0.0019052166,0.00013971036,0.00004562605,0.00008364798,0.0052741086],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793345,0.000031248182,0.0003079533,0.0006326615,0.00058189494,0.0005127795],"domain_scores_gemma":[0.99793375,0.00067873404,0.0001983458,0.0008409998,0.00019302516,0.00015512541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010741887,0.00024413306,0.00030452898,0.00035271118,0.000626246,0.00015348554,0.002157948,0.0005261257,0.00012738201],"category_scores_gemma":[0.00036983122,0.00022398419,0.00010379713,0.00022452607,0.0025458124,0.000110120105,0.00041812367,0.0007585298,0.000021008234],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010159802,0.000031157273,0.000049588092,0.000012611561,0.000010195739,0.0000042105416,0.003298664,0.00013580096,0.0004051106,0.20978516,0.00004435782,0.786213],"study_design_scores_gemma":[0.00036010382,0.00009325255,0.000029374489,0.000099483324,0.0000149187135,0.0000028643437,0.0000031459178,0.013094294,0.00094661355,0.282145,0.7026747,0.0005362736],"about_ca_topic_score_codex":0.00024023691,"about_ca_topic_score_gemma":0.0050613005,"teacher_disagreement_score":0.7856767,"about_ca_system_score_codex":0.00026623294,"about_ca_system_score_gemma":0.0005919685,"threshold_uncertainty_score":0.93801516},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027447517,0.00027652088,0.98551106,0.00021934549,0.0002328554,0.00037564608,0.000004563733,0.00021563395,0.013136947],"genre_scores_gemma":[0.21432135,0.000031364336,0.7850636,0.00013660446,0.00016989221,0.00006613199,0.0000059960803,0.000035475743,0.0001695621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892926,0.0000017668889,0.0002867041,0.00034202737,0.00018451334,0.00025572773],"domain_scores_gemma":[0.999108,0.00023415693,0.000059292608,0.00039862192,0.00014612546,0.000053781372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013839403,0.00020596653,0.00023047694,0.00020569943,0.00009788844,0.00011984709,0.00052519277,0.00020554676,0.00002594144],"category_scores_gemma":[0.000048651247,0.00019807265,0.0000696762,0.00014625608,0.00020757088,0.00013968321,0.00010818312,0.00032049773,0.000008125896],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010359986,0.000010902947,0.0000018291663,0.00011492546,0.000005989487,8.950072e-7,0.00009912683,0.009359206,0.0024073657,0.032671962,0.00021403925,0.9551127],"study_design_scores_gemma":[0.000086410146,0.00009676788,0.000013029972,0.00032528146,0.000015880023,0.000010184888,2.8172587e-7,0.71402866,0.042039897,0.23838419,0.0046095657,0.0003898389],"about_ca_topic_score_codex":0.0000037701052,"about_ca_topic_score_gemma":0.000010113269,"teacher_disagreement_score":0.9547229,"about_ca_system_score_codex":0.00005538715,"about_ca_system_score_gemma":0.000082391154,"threshold_uncertainty_score":0.80771685},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015004455,0.0011307059,0.9925085,0.00022505477,0.0041623767,0.0004554181,0.0000043048094,0.0006446544,0.00085402845],"genre_scores_gemma":[0.009260989,0.000020327456,0.9891881,0.00008161563,0.00091405277,0.000025411926,0.000001607061,0.000049569146,0.00045836682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966284,0.000022803028,0.0004361116,0.001479522,0.00065519294,0.00077795994],"domain_scores_gemma":[0.99580914,0.0023620643,0.00021836667,0.0012841753,0.00021474762,0.000111536916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009541929,0.00054102077,0.00055350736,0.0006517016,0.00020946216,0.00033984813,0.0031228864,0.00031927344,0.0000014614002],"category_scores_gemma":[0.00049787236,0.00053249137,0.00015600302,0.0004431342,0.00033603836,0.0006078363,0.0007777955,0.0006606374,0.000008843786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022607985,0.000007956552,0.000009947532,0.000041041018,0.0000049242267,0.0000337045,0.000122004436,0.5623332,0.00021129983,0.011507397,0.000016916383,0.42570934],"study_design_scores_gemma":[0.0003281381,0.00020175839,0.00016393136,0.00042434965,0.000008737057,0.000056773486,8.5158966e-8,0.15227601,0.013366555,0.82921195,0.002879431,0.0010822741],"about_ca_topic_score_codex":0.0000061241967,"about_ca_topic_score_gemma":0.0000054727025,"teacher_disagreement_score":0.81770456,"about_ca_system_score_codex":0.0004031562,"about_ca_system_score_gemma":0.00028688958,"threshold_uncertainty_score":0.99971265},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022162816,0.0017248457,0.9924817,0.0003459412,0.0002076062,0.00028142743,0.0000015568846,0.00005051181,0.0026901215],"genre_scores_gemma":[0.6499692,0.00009485598,0.34887803,0.00086134294,0.00013592078,0.000004925261,0.0000013200317,0.000012700743,0.00004166772],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973345,0.00003146646,0.00041605256,0.0009073835,0.0008347647,0.00047587958],"domain_scores_gemma":[0.99775046,0.00071956223,0.00035515262,0.0010060385,0.00010774462,0.00006103914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006704999,0.0003756289,0.00043535762,0.00061247393,0.00013093706,0.00023359834,0.0030216868,0.00014417821,0.0000054188754],"category_scores_gemma":[0.000064391796,0.00023339626,0.00007177925,0.0010596429,0.00047958558,0.00045926447,0.00029579268,0.00062092446,0.0000048118395],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007864092,0.000047145695,0.00015486822,0.000035375917,0.000004929753,0.00077337015,0.000882337,0.07256772,0.0000448888,0.022468599,0.0000035302808,0.90300936],"study_design_scores_gemma":[0.0012112096,0.0025964119,0.024752691,0.0032239517,0.00004960872,0.0036928074,0.0000059832487,0.303643,0.0022040901,0.65379256,0.0019465312,0.002881171],"about_ca_topic_score_codex":0.00003665095,"about_ca_topic_score_gemma":0.00012514328,"teacher_disagreement_score":0.9001282,"about_ca_system_score_codex":0.00009218775,"about_ca_system_score_gemma":0.00027873373,"threshold_uncertainty_score":0.9517624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071982207,0.00034683413,0.8090367,0.0008528665,0.00070726173,0.0012377247,0.000009285693,0.00015640992,0.18693314],"genre_scores_gemma":[0.9845891,0.00003138436,0.011738571,0.001070988,0.0010291324,0.00004349243,0.0000053673543,0.00002591012,0.0014660698],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644727,0.00006478151,0.0005479878,0.0009847579,0.0010949561,0.00086026924],"domain_scores_gemma":[0.9987243,0.00019622833,0.0002189148,0.0005421041,0.00011735808,0.0002011115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010070577,0.0003888013,0.0005348785,0.001269334,0.0003424667,0.0004794459,0.0020141096,0.0002825138,0.000023678764],"category_scores_gemma":[0.00015926507,0.0003500728,0.00010518799,0.0008297114,0.0005904916,0.00031697532,0.0006270161,0.0004150897,0.000041727493],"study_design_candidate":"design_other","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.000040198207,0.0001813137,0.0029446422,0.00021105267,0.000027974429,0.000094856936,0.027737994,0.14776708,0.000047868445,0.18401705,0.00018008654,0.63674986],"study_design_scores_gemma":[0.005965348,0.0009301803,0.01104497,0.009670581,0.000135871,0.00016618363,0.00007395833,0.39604932,0.00038080272,0.408457,0.15781802,0.009307775],"about_ca_topic_score_codex":0.0071291393,"about_ca_topic_score_gemma":0.0012617264,"teacher_disagreement_score":0.98386925,"about_ca_system_score_codex":0.0011240315,"about_ca_system_score_gemma":0.0011437124,"threshold_uncertainty_score":0.99989516},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047294925,0.00081229425,0.96838975,0.0052955407,0.0045352965,0.00039503627,0.0000019425356,0.0002566981,0.020266155],"genre_scores_gemma":[0.065694176,0.000112814414,0.9086091,0.0053824675,0.012681045,0.000029013807,0.0000056063077,0.000063679756,0.007422125],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99562913,0.00003510306,0.00054641237,0.00214783,0.0008586878,0.0007828338],"domain_scores_gemma":[0.9970596,0.0002018231,0.00023027412,0.0018361879,0.00037612126,0.00029599923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008344516,0.0005712203,0.00057679595,0.000865152,0.00030683263,0.00057186576,0.0035299538,0.00031425938,0.00007681143],"category_scores_gemma":[0.00018806307,0.0005182306,0.00014951987,0.000916967,0.00042084837,0.00072364265,0.0014415084,0.0007615947,0.0005359328],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052920905,0.000027938597,0.00002437107,0.000020630387,0.000006554835,0.000036634872,0.0009002994,0.015898207,0.00012184417,0.057999678,0.00080967334,0.92414886],"study_design_scores_gemma":[0.00074360415,0.00080499635,0.0007433648,0.0006751857,0.000024408777,0.00049697584,3.677793e-7,0.30940315,0.0038849097,0.296475,0.38362116,0.0031269018],"about_ca_topic_score_codex":0.000013337866,"about_ca_topic_score_gemma":0.00015961533,"teacher_disagreement_score":0.921022,"about_ca_system_score_codex":0.0004806928,"about_ca_system_score_gemma":0.0005351038,"threshold_uncertainty_score":0.99972695},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004759824,0.00094544527,0.99128324,0.0007533595,0.0016316077,0.00038318633,0.000010515926,0.00023723117,0.0042794393],"genre_scores_gemma":[0.6098331,0.0001409032,0.38500124,0.0016164035,0.0007481043,0.0000121179855,0.000009593642,0.00007853157,0.0025599569],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960083,0.000046884437,0.0007024186,0.0016262492,0.00095686276,0.00065929804],"domain_scores_gemma":[0.9965019,0.0004852325,0.00043873055,0.002020939,0.00040990784,0.00014326374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007845542,0.000574478,0.000673535,0.00092322304,0.00015561104,0.0003654076,0.003954803,0.00031558718,0.000037936486],"category_scores_gemma":[0.00015944651,0.00050902856,0.00013133138,0.0011694154,0.0007116317,0.00061250216,0.0012977765,0.00069241406,0.000069889546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013352629,0.0001719176,0.000059412756,0.00024320342,0.00004785985,0.0002582132,0.0027533455,0.052021272,0.0041312184,0.06379042,0.00027204494,0.87623775],"study_design_scores_gemma":[0.00031412998,0.00031646734,0.00010094878,0.0007646073,0.000012764079,0.000101589874,1.2923573e-7,0.8701005,0.019840492,0.10439326,0.003085092,0.00097003294],"about_ca_topic_score_codex":0.000012094853,"about_ca_topic_score_gemma":0.000004153747,"teacher_disagreement_score":0.8752677,"about_ca_system_score_codex":0.00012707699,"about_ca_system_score_gemma":0.00031171629,"threshold_uncertainty_score":0.99973613},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014130775,0.000491419,0.993551,0.000020561838,0.00070210925,0.00015742965,0.000013620845,0.00007995041,0.0035708041],"genre_scores_gemma":[0.6539778,0.00019255302,0.34448847,0.00018875135,0.0007651665,0.0000074180875,0.000081703525,0.000087896886,0.00021020211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986232,0.000006339955,0.00026276335,0.0004752565,0.0003365044,0.00029596142],"domain_scores_gemma":[0.9994643,0.00011103883,0.000061749495,0.00025530567,0.00005634653,0.00005130563],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016543799,0.0002719772,0.00023428931,0.0005844217,0.00008280964,0.00007497598,0.00030487968,0.000120672164,0.000066736815],"category_scores_gemma":[0.000028556053,0.00027689815,0.000032435415,0.00026416048,0.0001658662,0.0003453258,0.00012304423,0.00047606695,0.00000606981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019135,0.0000043097493,0.000139133,0.000033727098,0.0000035503513,0.000015600848,0.00021069644,0.9665132,0.000015840928,0.00083109253,0.0000016767166,0.032229252],"study_design_scores_gemma":[0.00013624731,0.000009472813,0.0004123595,0.0003696259,0.000005956362,0.000028078517,1.9115734e-7,0.9884389,0.0010175447,0.008406726,0.00079215347,0.0003827562],"about_ca_topic_score_codex":0.00010876033,"about_ca_topic_score_gemma":0.00032618007,"teacher_disagreement_score":0.65256476,"about_ca_system_score_codex":0.00031093173,"about_ca_system_score_gemma":0.00013523092,"threshold_uncertainty_score":0.9999683},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029099392,0.0006700486,0.9844339,0.010456564,0.0028642889,0.0003490595,0.000006708681,0.00012131526,0.000807153],"genre_scores_gemma":[0.27363887,0.00013259065,0.7217283,0.0035278476,0.00074986817,0.000014132256,0.0000049753894,0.000031936226,0.00017149227],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966248,0.000052194784,0.0006318309,0.0010393868,0.0009899365,0.0006618243],"domain_scores_gemma":[0.99618304,0.0008349657,0.000328737,0.002130377,0.00037144506,0.0001514388],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010199274,0.000447383,0.0006297201,0.00051273766,0.00030747923,0.00048238775,0.0073521007,0.00038401142,0.000015040671],"category_scores_gemma":[0.0006630009,0.00028581603,0.00017386711,0.0006702268,0.0010044776,0.00034743728,0.0021806513,0.0011577762,0.000026512287],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017339122,0.000041165367,0.00030894091,0.000041303894,0.000033445707,0.0001482574,0.002934954,0.040482588,0.00060447457,0.05947234,0.00017571259,0.8957395],"study_design_scores_gemma":[0.0007277569,0.0008004444,0.0068506133,0.00094532996,0.00005042417,0.00061652827,0.0000077807945,0.29224393,0.0138744125,0.6556913,0.02613542,0.0020560583],"about_ca_topic_score_codex":0.00019578652,"about_ca_topic_score_gemma":0.003618239,"teacher_disagreement_score":0.89368343,"about_ca_system_score_codex":0.0001127746,"about_ca_system_score_gemma":0.00044010204,"threshold_uncertainty_score":0.9999594},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010124699,0.00040440957,0.99074847,0.0010325571,0.0008411405,0.004796396,0.00000958248,0.00027944843,0.0018778841],"genre_scores_gemma":[0.034275126,0.000044302033,0.9598909,0.00278289,0.0010785558,0.0013221089,0.000013749191,0.00006753331,0.00052485097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960485,0.00003365858,0.0007247434,0.0018242334,0.0005838776,0.0007849711],"domain_scores_gemma":[0.9967977,0.00064360775,0.00045278226,0.001486413,0.00038779364,0.0002317294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011046567,0.00055067684,0.00052648806,0.0007849322,0.00045009915,0.0009860967,0.0047593713,0.0003765059,0.000033919718],"category_scores_gemma":[0.00016365989,0.0005507862,0.00019079742,0.0007430705,0.00047669242,0.0007296804,0.0009679867,0.00078266114,0.000028956983],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014450988,0.000064338856,0.000031940785,0.00015297596,0.000015167271,0.0000041201442,0.00072903204,0.0037155312,0.00043037286,0.084835105,0.0003703917,0.90963656],"study_design_scores_gemma":[0.0005269335,0.00035482753,0.000021755124,0.001513006,0.000007324246,0.00003896077,2.633997e-7,0.74660873,0.004030116,0.18805994,0.05772131,0.0011168562],"about_ca_topic_score_codex":0.0000070818446,"about_ca_topic_score_gemma":0.000016372342,"teacher_disagreement_score":0.90851974,"about_ca_system_score_codex":0.00024407817,"about_ca_system_score_gemma":0.00065367785,"threshold_uncertainty_score":0.99969435},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008072059,0.0008889368,0.99478716,0.00031073016,0.0014021258,0.0002774109,0.000019866202,0.00020211512,0.0013044497],"genre_scores_gemma":[0.4050078,0.00013161675,0.5936939,0.0005758347,0.00020459268,0.0000021653377,0.000006616007,0.00005727564,0.000320195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532014,0.000056209632,0.0007904803,0.0017519038,0.001177517,0.0009037456],"domain_scores_gemma":[0.9964217,0.0006138606,0.0005264268,0.0018421308,0.00035588816,0.00024002032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010620941,0.00067685987,0.0008129221,0.0005623349,0.00020794861,0.00020691685,0.0052584736,0.00033030298,0.000026848067],"category_scores_gemma":[0.00004961104,0.00059142086,0.00020534758,0.0007110467,0.0018068707,0.00036070228,0.002464224,0.001049421,0.00004418134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000783784,0.000044625816,0.000034134573,0.00009116168,0.000016477486,0.00009512756,0.0014709134,0.3814417,0.00014439366,0.017514102,0.000019842444,0.59911966],"study_design_scores_gemma":[0.00017603431,0.00028827804,0.00006901048,0.00054917985,0.0000069643106,0.000074699754,1.8443077e-7,0.78102833,0.0037628496,0.21282126,0.0006239565,0.0005992487],"about_ca_topic_score_codex":0.000075225944,"about_ca_topic_score_gemma":0.000045224304,"teacher_disagreement_score":0.5985204,"about_ca_system_score_codex":0.0001485376,"about_ca_system_score_gemma":0.0006303357,"threshold_uncertainty_score":0.9996537},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015693718,0.00053547014,0.99641037,0.00011631885,0.00041538276,0.00031258888,0.000004594948,0.0002467638,0.0018015833],"genre_scores_gemma":[0.2523368,0.00006565926,0.7468271,0.00038539825,0.00017968845,0.0000057566267,0.000019900628,0.000030204701,0.00014945354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966616,0.000055304707,0.00087033166,0.0010854352,0.00064705906,0.0006802723],"domain_scores_gemma":[0.99729407,0.00080564,0.00053306663,0.0009732678,0.00027155425,0.00012238004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013551122,0.0004283888,0.00058217766,0.0010503985,0.00017456939,0.00025974197,0.0025914947,0.00037269713,0.000013479877],"category_scores_gemma":[0.000115373725,0.00043223237,0.00012706679,0.0012293368,0.0004271114,0.00032104072,0.0009775993,0.0007243876,0.000008956172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038675475,0.000025003932,0.000107735505,0.000013392478,0.000005471586,0.000037170175,0.00023646317,0.79783475,0.00001768512,0.0021934565,0.000010433077,0.19951458],"study_design_scores_gemma":[0.00015730369,0.000083667146,0.00013790093,0.00048644605,0.0000037491236,0.000028664608,8.181468e-8,0.98483086,0.00072443316,0.012960788,0.0001617844,0.00042434025],"about_ca_topic_score_codex":0.00003102967,"about_ca_topic_score_gemma":0.000064416774,"teacher_disagreement_score":0.25217986,"about_ca_system_score_codex":0.00026356394,"about_ca_system_score_gemma":0.00028878293,"threshold_uncertainty_score":0.99981296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037003646,0.001315348,0.99380124,0.00025265093,0.0018704535,0.0019663984,0.00002969602,0.00011035927,0.00028380542],"genre_scores_gemma":[0.29478866,0.00008848718,0.701754,0.0008126494,0.0010296634,0.00017308233,0.00002046661,0.00005979019,0.0012732235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621946,0.0000930029,0.0007116591,0.0015798658,0.0008325118,0.00056351],"domain_scores_gemma":[0.9971526,0.0008937497,0.0004653754,0.00074533967,0.00060121325,0.0001417033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015595452,0.00054165313,0.0006538802,0.00048962276,0.0004441504,0.00090181944,0.0012255278,0.00026282037,0.0000074087084],"category_scores_gemma":[0.00021026735,0.00047174015,0.00010699946,0.00024965007,0.00032360712,0.0006499542,0.0006399527,0.00038579077,0.000017686732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031218882,0.00012772197,0.0002679637,0.00047582088,0.000096245,0.00004304406,0.00802989,0.220079,0.0014823303,0.18112908,0.00006339819,0.5881743],"study_design_scores_gemma":[0.0007881793,0.0002826087,0.00026418737,0.00084658555,0.000013207379,0.000043814176,0.000001695869,0.9938772,0.00038764006,0.001325726,0.0015570426,0.0006121228],"about_ca_topic_score_codex":0.00003740886,"about_ca_topic_score_gemma":0.00009993293,"teacher_disagreement_score":0.77379817,"about_ca_system_score_codex":0.0003728315,"about_ca_system_score_gemma":0.00038167264,"threshold_uncertainty_score":0.99977344},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007519268,0.00043165655,0.9877635,0.0025613795,0.00035900413,0.0007082747,0.00022670592,0.000058586797,0.00037159608],"genre_scores_gemma":[0.96940345,0.000021687576,0.027849836,0.0007697359,0.0010430852,0.00008778745,0.0002519187,0.0000027674987,0.00056972186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987308,0.000007001863,0.00021621036,0.00049642083,0.00028525185,0.0002643227],"domain_scores_gemma":[0.99930096,0.00020988396,0.00012753038,0.000114640825,0.00016619854,0.000080763486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022530608,0.0001853835,0.00015621023,0.000054764598,0.00020085787,0.00009866203,0.00032545824,0.00019530233,0.00015278936],"category_scores_gemma":[0.000029346393,0.0000879586,0.00008718369,0.00016802122,0.0001061363,0.00016908368,0.00009806051,0.00014830807,0.000039211172],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026714486,0.00008235894,0.00021278174,0.000017310513,0.000009472108,8.5739543e-7,0.0003784183,0.039982673,0.07394831,0.0017396816,0.000011854671,0.88358957],"study_design_scores_gemma":[0.00017893204,0.00014491401,0.01898659,0.0000639041,0.000025658286,0.00000913674,2.8889318e-7,0.8153536,0.0004982456,0.14623502,0.017928667,0.0005750608],"about_ca_topic_score_codex":0.000013012206,"about_ca_topic_score_gemma":0.00036723044,"teacher_disagreement_score":0.9618842,"about_ca_system_score_codex":0.00010875588,"about_ca_system_score_gemma":0.000046674704,"threshold_uncertainty_score":0.35868475},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000098879755,0.000106440064,0.97991806,0.0020988632,0.0003902093,0.00040516394,0.0000024457822,0.00006737444,0.016912585],"genre_scores_gemma":[0.43208975,0.0005667572,0.56037563,0.004937373,0.00028702465,0.000021787875,0.0000040538143,0.00006358815,0.0016540556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969962,0.00007598473,0.00038880794,0.0008472682,0.0012237971,0.0004679402],"domain_scores_gemma":[0.99695957,0.0011551948,0.00021342859,0.001326358,0.00023178622,0.00011369387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011329466,0.0002954868,0.00033199432,0.0005378734,0.0003312744,0.00022511516,0.0036987206,0.00015392315,0.000034308516],"category_scores_gemma":[0.0001815942,0.00020302755,0.00011457634,0.0005726392,0.00088478776,0.00028870284,0.0011752896,0.00094388664,0.00003488457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069975786,0.000049030758,0.000020372594,0.000026894433,0.000012603675,0.000026628226,0.0019074255,0.3942575,0.000081664155,0.31186187,0.00020158272,0.29154745],"study_design_scores_gemma":[0.00013262528,0.00016744895,0.000049942333,0.00022524167,0.0000012356073,0.000021541226,1.1442839e-7,0.89617205,0.0010966641,0.100760564,0.0011070027,0.00026558572],"about_ca_topic_score_codex":0.000020597832,"about_ca_topic_score_gemma":0.000015215002,"teacher_disagreement_score":0.50191456,"about_ca_system_score_codex":0.00013224722,"about_ca_system_score_gemma":0.000558257,"threshold_uncertainty_score":0.8279223},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006316741,0.0006175054,0.9823175,0.00021914524,0.010006959,0.00079691195,0.000005421947,0.00044045737,0.005532914],"genre_scores_gemma":[0.19134928,0.000024468654,0.770659,0.00062666455,0.003528867,0.00009369156,0.000028359565,0.00019615887,0.03349347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927629,0.000090356356,0.001015866,0.002404498,0.002567316,0.0011590492],"domain_scores_gemma":[0.99515814,0.00051644386,0.00066944654,0.0021512771,0.0011585861,0.0003461003],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0026017176,0.0009228318,0.000930689,0.0013460217,0.0005600709,0.0013435214,0.00409644,0.00066123845,0.000012338854],"category_scores_gemma":[0.00030549077,0.00083799165,0.00027792796,0.00081594015,0.00055370346,0.0004522073,0.0011842401,0.0025293536,0.00010228035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013075571,0.00009217244,0.00018082403,0.00027634797,0.00004091838,0.00020569452,0.0020581305,0.32499954,0.0008997939,0.48447058,0.000016964748,0.18674596],"study_design_scores_gemma":[0.0002726656,0.00025030752,0.000023874223,0.0012186413,0.000014026719,0.00014466773,0.0000018314231,0.828273,0.004085507,0.0030063486,0.16137244,0.0013366736],"about_ca_topic_score_codex":0.00015101345,"about_ca_topic_score_gemma":0.000017957122,"teacher_disagreement_score":0.5032735,"about_ca_system_score_codex":0.00068942364,"about_ca_system_score_gemma":0.0008967066,"threshold_uncertainty_score":0.99977183},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3439063,0.00040787342,0.64986944,0.0012805994,0.0019884545,0.000657516,0.000034814395,0.000020655412,0.0018343217],"genre_scores_gemma":[0.9844047,0.000004410751,0.014258586,0.00043503303,0.00037203202,0.000027429847,0.00010949705,0.0000143213365,0.00037399563],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99796164,0.00006732022,0.00042909052,0.00077112584,0.0005032974,0.00026751417],"domain_scores_gemma":[0.998463,0.00019112452,0.00024879718,0.00070772384,0.00024386433,0.00014549521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064927415,0.00020630707,0.0003335565,0.0016147756,0.00003529362,0.000049486458,0.00073913235,0.00016717042,0.0004986779],"category_scores_gemma":[0.000017603845,0.00020418626,0.0000825321,0.0007956549,0.0001990612,0.00021694587,0.000075482414,0.00024103934,0.000044600005],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007138103,0.0018583245,0.18856284,0.000016807937,0.00024735503,0.000003061958,0.045568425,0.090537086,0.00060440286,0.14074118,0.000022231743,0.5317669],"study_design_scores_gemma":[0.00009453399,0.00019029561,0.9829586,0.00005509867,0.00007876664,0.0000019696386,0.000015239706,0.0075605065,0.000014259305,0.008656471,0.00013563735,0.00023859316],"about_ca_topic_score_codex":0.00015983808,"about_ca_topic_score_gemma":0.00087739987,"teacher_disagreement_score":0.7943958,"about_ca_system_score_codex":0.0003010983,"about_ca_system_score_gemma":0.00017772868,"threshold_uncertainty_score":0.83264744},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018096367,0.0004311891,0.99503636,0.00031207394,0.0014642477,0.00023085621,0.0000066011667,0.000058136535,0.0022795468],"genre_scores_gemma":[0.23603743,0.00023524622,0.7607235,0.0017498853,0.0005437948,0.000007732491,0.00001071175,0.000052049814,0.0006396585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975891,0.000019430867,0.00034938147,0.00092733157,0.00062938075,0.00048533978],"domain_scores_gemma":[0.9981507,0.00036899507,0.00022429063,0.0010691684,0.000052836596,0.00013401365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065817015,0.0003571432,0.00040376154,0.0007242557,0.000101548605,0.0002931749,0.0021967075,0.0001318731,0.000010524187],"category_scores_gemma":[0.000039665363,0.00031741435,0.0000695284,0.0003002824,0.0005117766,0.0007607497,0.0020195527,0.00033715792,0.000014203285],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004004865,0.000021754871,0.000028180817,0.000062674015,0.000011716645,0.00002738194,0.00037228156,0.0014284778,0.0000821241,0.018991316,0.0000362262,0.9789339],"study_design_scores_gemma":[0.0007157032,0.00056610256,0.00052129896,0.000922464,0.000027208114,0.000041304724,3.986691e-7,0.8924145,0.0015743508,0.098150976,0.003759884,0.0013058067],"about_ca_topic_score_codex":0.000010579514,"about_ca_topic_score_gemma":0.00001355824,"teacher_disagreement_score":0.97762805,"about_ca_system_score_codex":0.000071452356,"about_ca_system_score_gemma":0.00006155738,"threshold_uncertainty_score":0.9999278},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006155923,0.0003012911,0.9862323,0.0028164056,0.0017605512,0.0003962731,0.0000031213392,0.00024164977,0.0081868945],"genre_scores_gemma":[0.71723586,0.00007770588,0.27648628,0.0041620014,0.0014251233,0.000019074027,0.000010591152,0.00004777453,0.0005356118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958377,0.00007487145,0.0006564386,0.0016459607,0.001163231,0.00062180124],"domain_scores_gemma":[0.99594694,0.0007365862,0.00046895596,0.002342959,0.00035486213,0.00014967094],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020415834,0.0004947309,0.00042027855,0.00045790154,0.00069122453,0.0009619279,0.005682825,0.00033756054,0.000016826085],"category_scores_gemma":[0.00012973575,0.00039565994,0.00016277345,0.0006637176,0.00082116656,0.0004347436,0.0013490099,0.001188843,0.00011747032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003606178,0.000025211175,0.000013602463,0.000032506992,0.000008745451,0.0000064282526,0.0027524058,0.104846224,0.000057266454,0.48573193,0.0002067629,0.40631533],"study_design_scores_gemma":[0.00008577934,0.000027433529,0.00002402776,0.00008442692,0.0000038543794,0.000025182106,1.7508484e-7,0.69233793,0.0004119518,0.303438,0.003224557,0.00033665966],"about_ca_topic_score_codex":0.000010315926,"about_ca_topic_score_gemma":0.000027729258,"teacher_disagreement_score":0.7171743,"about_ca_system_score_codex":0.0002978964,"about_ca_system_score_gemma":0.00050167635,"threshold_uncertainty_score":0.99984956},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008459434,0.0004712558,0.9935022,0.00091414276,0.00025086058,0.001172038,0.0000087781655,0.00012997864,0.0027048031],"genre_scores_gemma":[0.36593294,0.0001462975,0.62968785,0.00084392854,0.0030818162,0.00011874897,0.000023935278,0.000032066797,0.00013241149],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804145,0.00007818164,0.00025487118,0.0008133794,0.0003635746,0.00044854754],"domain_scores_gemma":[0.9983462,0.00089231617,0.00018222678,0.0002888189,0.00013485881,0.00015559266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012992764,0.00022004422,0.00039012698,0.00025670815,0.0006702917,0.00019018374,0.00074388896,0.0003144869,0.0000040366467],"category_scores_gemma":[0.0001356571,0.00020678241,0.00006280541,0.00020221974,0.0015191053,0.00034951622,0.00014756079,0.00034121447,0.0000020341674],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057090456,0.000010121989,0.000728772,0.00001264412,0.0000063274615,0.000002841407,0.0015613601,0.000049208375,0.000007349443,0.009731611,0.000004200859,0.9878799],"study_design_scores_gemma":[0.0010656856,0.00076939445,0.008771034,0.00020792779,0.00009939059,0.000027931555,0.000005829356,0.06968364,0.00025084818,0.8400745,0.07743553,0.001608294],"about_ca_topic_score_codex":0.00034384962,"about_ca_topic_score_gemma":0.000701276,"teacher_disagreement_score":0.98627156,"about_ca_system_score_codex":0.000086169595,"about_ca_system_score_gemma":0.00036120138,"threshold_uncertainty_score":0.8432342},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003584746,0.00013166918,0.98913443,0.0026574405,0.000563161,0.0003624796,0.000030009332,0.0001411351,0.006621192],"genre_scores_gemma":[0.8252206,0.00003610281,0.16898918,0.0022947674,0.00073329615,0.000044398428,0.00012558738,0.00007578122,0.0024802724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695647,0.00003019761,0.0004977733,0.0010069956,0.001094081,0.00041449183],"domain_scores_gemma":[0.9967904,0.0006597513,0.0003309521,0.001999337,0.00014225715,0.00007731021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062307116,0.0003853121,0.00035616438,0.00044776674,0.00027424065,0.0002622683,0.00409557,0.00021751905,0.00002886051],"category_scores_gemma":[0.000031535958,0.00029095015,0.00016660805,0.0005113,0.00082723424,0.0002911323,0.0010226514,0.0005674652,0.00008103071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011096154,0.000048917922,0.000004189893,0.000015891295,0.000005859557,0.000011791378,0.00006547216,0.019527221,0.00033169106,0.91086125,0.00020851495,0.06891807],"study_design_scores_gemma":[0.0000800566,0.00004544844,0.00006818674,0.00008668022,0.0000041067988,0.0000103645925,4.4035794e-8,0.5493874,0.00092445593,0.44872808,0.0004376204,0.00022755393],"about_ca_topic_score_codex":0.000025203872,"about_ca_topic_score_gemma":0.000029216591,"teacher_disagreement_score":0.8248621,"about_ca_system_score_codex":0.00023304268,"about_ca_system_score_gemma":0.00034859122,"threshold_uncertainty_score":0.9999543},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029774348,0.00096312736,0.9885467,0.0003012497,0.0037266251,0.00042901374,0.00012991663,0.00029107064,0.005314544],"genre_scores_gemma":[0.6603533,0.00052412425,0.3326747,0.0047863424,0.0013660985,0.000026404865,0.00007982036,0.00009631191,0.00009291635],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99517095,0.00006961854,0.00065326283,0.0023107901,0.0008725912,0.00092281005],"domain_scores_gemma":[0.9964107,0.00056681107,0.00016466924,0.0022920484,0.00023241692,0.00033331866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086835056,0.00077182136,0.0007514952,0.00096121,0.00032041865,0.00080764474,0.0052158246,0.0005141247,0.00015960506],"category_scores_gemma":[0.00004225549,0.0007098547,0.0002719384,0.0008336744,0.0012934674,0.0011078282,0.0011838936,0.0011151264,0.00013155748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003137352,0.00011986184,0.00008575338,0.000042409723,0.000057885758,0.00046508294,0.004901445,0.0009337938,0.0003747463,0.46605444,0.000107407046,0.5268258],"study_design_scores_gemma":[0.0004973414,0.00022534282,0.00013693435,0.00039989885,0.000021952426,0.00004934834,2.3133988e-7,0.03739433,0.0026494842,0.9522655,0.005082663,0.0012769633],"about_ca_topic_score_codex":0.00022971578,"about_ca_topic_score_gemma":0.00030333086,"teacher_disagreement_score":0.6600555,"about_ca_system_score_codex":0.000111045105,"about_ca_system_score_gemma":0.0004852046,"threshold_uncertainty_score":0.99953526},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025175948,0.0024028497,0.9898764,0.0005518988,0.0031036786,0.00044322305,0.0000069447733,0.00015466777,0.0032085585],"genre_scores_gemma":[0.82829887,0.00036180665,0.16742066,0.0007265021,0.0008953158,0.000035698544,0.000018093102,0.000041012423,0.00220203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957178,0.00007785117,0.0007983829,0.00152514,0.00126526,0.0006155428],"domain_scores_gemma":[0.9973143,0.0005464897,0.00030849726,0.0013951638,0.00028272814,0.00015283981],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020622795,0.00042336056,0.0005212828,0.008252016,0.00017156418,0.0010033464,0.0030646785,0.00042180115,0.000032267784],"category_scores_gemma":[0.00022275723,0.00040458757,0.00010876785,0.00585195,0.0005220797,0.000868017,0.0007292127,0.000775805,0.00012443338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000280358,0.00007701079,0.0001979076,0.00008700022,0.000006141429,0.000033387878,0.00093374396,0.008921971,0.000073224364,0.10540815,0.000046719288,0.88421196],"study_design_scores_gemma":[0.00048375665,0.00015643776,0.0016641729,0.0003786475,0.0000057079915,0.000087023785,0.0000010036631,0.9108372,0.00033416145,0.060647253,0.024250902,0.0011537832],"about_ca_topic_score_codex":0.00014832932,"about_ca_topic_score_gemma":0.00011517798,"teacher_disagreement_score":0.9019152,"about_ca_system_score_codex":0.00086325686,"about_ca_system_score_gemma":0.00044762855,"threshold_uncertainty_score":0.9998406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012389637,0.0005142098,0.99561703,0.001294177,0.00062741607,0.0003877942,0.0000039939505,0.00012110395,0.00019531242],"genre_scores_gemma":[0.7404931,0.000291713,0.2562579,0.0009871271,0.0018159582,0.000017600762,0.000028253915,0.00003354362,0.00007478147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729496,0.00003638796,0.00059933227,0.0010135629,0.0005678595,0.00048791154],"domain_scores_gemma":[0.9983657,0.00011737638,0.00028200174,0.00080976833,0.00032228781,0.000102890284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039360023,0.00037672863,0.0004010807,0.00029734665,0.0002468096,0.00028335355,0.0015059508,0.0002158032,0.000039000202],"category_scores_gemma":[0.000015333171,0.0003609669,0.000106640764,0.0006518269,0.00024099018,0.0006930066,0.0005623397,0.0004894398,0.000030229727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.729846e-7,0.000008467293,0.000010511062,0.000011916436,0.000002142418,0.000002681646,0.0001227475,0.48499176,0.000020343974,0.00034908135,0.000007844977,0.51447153],"study_design_scores_gemma":[0.00011773664,0.00008158342,0.000046134854,0.0003485286,0.000008753437,0.000029800614,1.4558275e-7,0.9612558,0.000042374082,0.037617188,0.00009377469,0.00035818943],"about_ca_topic_score_codex":0.00003607134,"about_ca_topic_score_gemma":0.0001033191,"teacher_disagreement_score":0.73935914,"about_ca_system_score_codex":0.0001649912,"about_ca_system_score_gemma":0.00013254872,"threshold_uncertainty_score":0.99988425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021115155,0.000040031875,0.97864884,0.016958937,0.00068269897,0.0007030154,0.0000027192752,0.00029989702,0.002642741],"genre_scores_gemma":[0.021447651,0.000017919097,0.9154711,0.062204324,0.00032007435,0.000025260511,0.000017390037,0.00003423848,0.00046207994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957667,0.00011564368,0.00050939864,0.0012806216,0.0018290472,0.00049858564],"domain_scores_gemma":[0.99639106,0.0014906339,0.00033950488,0.001428592,0.00018099538,0.00016920062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015263798,0.0004758462,0.00034298006,0.0006541854,0.00032787293,0.0005725815,0.0027182226,0.0002559182,0.0000867612],"category_scores_gemma":[0.00024983962,0.00033913908,0.0001246787,0.0005749449,0.00057055184,0.0005472041,0.00046570785,0.00092571933,0.00007422696],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006223852,0.000042245167,0.0000043088003,0.000009819491,0.0000035184896,0.000055993027,0.00030730423,0.006469717,0.0013003151,0.0039619636,0.0008974448,0.98694116],"study_design_scores_gemma":[0.0003383675,0.0005323752,0.0000836934,0.00049520493,0.0000064312826,0.000020166535,2.8810524e-7,0.8551886,0.06378038,0.0781516,0.0007888951,0.00061398064],"about_ca_topic_score_codex":0.000010305428,"about_ca_topic_score_gemma":0.000009283416,"teacher_disagreement_score":0.9863272,"about_ca_system_score_codex":0.00036754334,"about_ca_system_score_gemma":0.00039468473,"threshold_uncertainty_score":0.99990606},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009642652,0.00014911094,0.9867315,0.00001649978,0.0012975147,0.0004744932,0.000016870588,0.000024517927,0.0016468342],"genre_scores_gemma":[0.9832237,0.000004773234,0.01616998,0.000012468444,0.000112058086,0.0000051970137,0.0000028316033,0.000024699051,0.00044429395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793756,0.000048950085,0.00073587365,0.00041941885,0.00062093016,0.00023724211],"domain_scores_gemma":[0.99788445,0.00045232492,0.00063048373,0.00077055494,0.00020730119,0.000054869975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039580138,0.00025134513,0.00055758894,0.00019913896,0.00006243475,0.000034026674,0.0008597306,0.0002593421,0.000020346732],"category_scores_gemma":[0.00020840665,0.00016562849,0.00016009802,0.00023588887,0.0006788636,0.00011421638,0.00038622392,0.0003198741,0.000002704779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000228448,0.00011154685,0.00025171335,0.0008567117,0.000039697185,0.0000027028898,0.00073962414,0.009558613,0.006710975,0.9535622,0.000008019488,0.028135335],"study_design_scores_gemma":[0.0001242876,0.00006123715,0.000114994495,0.0010199476,0.000024131068,0.000009641811,3.4176094e-7,0.26643217,0.000318053,0.73170286,0.000016688755,0.00017564211],"about_ca_topic_score_codex":0.000060304432,"about_ca_topic_score_gemma":0.000072881994,"teacher_disagreement_score":0.9735811,"about_ca_system_score_codex":0.00013840472,"about_ca_system_score_gemma":0.00013378005,"threshold_uncertainty_score":0.67541337},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016866936,0.00025864854,0.99240816,0.0031565866,0.0006846512,0.00040496854,0.0000016717047,0.0007806205,0.002136052],"genre_scores_gemma":[0.5670185,0.000054800123,0.42822355,0.004347459,0.00013303851,0.000015635134,0.000009676352,0.000016910697,0.00018044445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968918,0.000028147067,0.00071811216,0.00075046567,0.0009799814,0.00063152326],"domain_scores_gemma":[0.99797356,0.00022307492,0.0006898054,0.000828648,0.00015672263,0.00012818356],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010237618,0.00040192713,0.00043794498,0.0011393502,0.00044352192,0.0010907501,0.0023647596,0.00023714782,0.000022689035],"category_scores_gemma":[0.00014829186,0.00037740328,0.000093482995,0.0005946736,0.00028814125,0.0023884638,0.0006855178,0.00070157414,0.000076135024],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012341723,0.0000065798677,0.000023508528,0.00002348933,0.000003979188,0.0000037981783,0.0013069607,0.00039712948,0.000006875664,0.0124420235,0.000018282242,0.9857661],"study_design_scores_gemma":[0.0004345794,0.0005221139,0.0004939598,0.0006048508,0.0000040129103,0.00006266958,0.000003904412,0.8331494,0.00040077223,0.15961343,0.003988742,0.00072159286],"about_ca_topic_score_codex":0.00002308288,"about_ca_topic_score_gemma":0.00001942988,"teacher_disagreement_score":0.98504454,"about_ca_system_score_codex":0.00069620257,"about_ca_system_score_gemma":0.00067381916,"threshold_uncertainty_score":0.99994624},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027036401,0.0010445623,0.9891258,0.00072960404,0.0009151128,0.00079729623,0.000008239567,0.000052466858,0.0046232855],"genre_scores_gemma":[0.98274475,0.000042073178,0.016472438,0.0003395133,0.0001717522,0.000008252212,0.0000029507958,0.000017707038,0.00020054671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691945,0.00008309518,0.00045179098,0.0009715042,0.0010624331,0.0005117344],"domain_scores_gemma":[0.9987658,0.0002752166,0.00025987538,0.0003167457,0.00020383448,0.00017848493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028304085,0.00030729602,0.0005084692,0.00040190062,0.00036057323,0.00035252052,0.0006157865,0.00035617533,0.00004334027],"category_scores_gemma":[0.00023502955,0.00027611814,0.000061641316,0.00029818536,0.0010270805,0.00047739194,0.00026976145,0.0005015631,0.000003678706],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015735604,0.00012039996,0.002075832,0.000059947884,0.000038640464,0.00013296005,0.01051491,0.13793229,0.00047623523,0.09170748,0.000009196219,0.7567748],"study_design_scores_gemma":[0.0006804139,0.00006704227,0.0004869998,0.0001314594,0.000015415755,0.0000036657946,0.0000071430477,0.50865597,0.000014469121,0.489397,0.00021029398,0.00033014794],"about_ca_topic_score_codex":0.0006283396,"about_ca_topic_score_gemma":0.003167218,"teacher_disagreement_score":0.98004115,"about_ca_system_score_codex":0.00092713686,"about_ca_system_score_gemma":0.00067750056,"threshold_uncertainty_score":0.9999691},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009313149,0.00059796043,0.98031414,0.0012195068,0.002246271,0.00037588304,0.0000053416666,0.0002655921,0.00566215],"genre_scores_gemma":[0.8794521,0.000083812534,0.11469806,0.0040088687,0.00074885937,0.000011494243,0.000002405402,0.000053928416,0.0009404514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957326,0.00004630097,0.00052247127,0.0020082626,0.00085314986,0.00083723455],"domain_scores_gemma":[0.99753195,0.00049780344,0.00022689204,0.0012623341,0.00014354725,0.00033749634],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011306556,0.0006054173,0.00057906203,0.001042762,0.00044640814,0.0011098362,0.0026057588,0.00027766253,0.0000075928756],"category_scores_gemma":[0.00012864624,0.00057216786,0.00012271857,0.0004997242,0.0002621636,0.00074502,0.0024558988,0.0009963814,0.000025517333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090332505,0.0000179971,0.0001873165,0.000037391514,0.00001618355,0.00019344117,0.0016681013,0.017043998,0.0037152697,0.004329857,0.000050779232,0.97273064],"study_design_scores_gemma":[0.00045365692,0.000312046,0.000074011696,0.0009140673,0.000016012675,0.0002752631,0.00000120285,0.9748373,0.00028871992,0.017922414,0.0037089807,0.0011963459],"about_ca_topic_score_codex":0.000087814486,"about_ca_topic_score_gemma":0.0002796469,"teacher_disagreement_score":0.9715343,"about_ca_system_score_codex":0.0002594976,"about_ca_system_score_gemma":0.00047586416,"threshold_uncertainty_score":0.9999271},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023673833,0.0011554526,0.9956183,0.000036363304,0.0011444486,0.000779597,0.000013001051,0.00017599814,0.0008400906],"genre_scores_gemma":[0.8472853,0.000024387446,0.1503562,0.00006402945,0.00071539794,0.00009843541,0.000013590116,0.00008226243,0.0013604024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982777,0.00000987283,0.0003308117,0.000601523,0.00036058342,0.00041946323],"domain_scores_gemma":[0.99913037,0.00009710183,0.00008661144,0.0004999419,0.00011030333,0.000075686905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004435719,0.0002986135,0.00036740652,0.0003264446,0.00011312234,0.00031675014,0.00063441653,0.00017445454,5.44306e-7],"category_scores_gemma":[0.000020450927,0.0002873397,0.00009630645,0.00026517542,0.00006146305,0.00033133288,0.00008032477,0.0003623687,0.0000018344595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020249845,0.0000054720895,0.000001133533,0.00017468687,0.000008321347,0.0000011958665,0.0011681577,0.9440174,0.0002247846,0.00010570997,0.000057085246,0.05423399],"study_design_scores_gemma":[0.00023534338,0.000018931501,0.0000072521316,0.00018028716,0.0000073053898,0.000005135667,3.5082513e-7,0.9826368,0.00017568997,0.015880883,0.00054653216,0.00030547116],"about_ca_topic_score_codex":0.00008905125,"about_ca_topic_score_gemma":0.00010752004,"teacher_disagreement_score":0.8470486,"about_ca_system_score_codex":0.001047941,"about_ca_system_score_gemma":0.00045672726,"threshold_uncertainty_score":0.99995786},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003048737,0.0002705592,0.7741016,0.00045636526,0.009893044,0.00040994748,0.0000044161357,0.0002066137,0.2116087],"genre_scores_gemma":[0.97853994,0.00006705513,0.010937312,0.0015128008,0.0006997307,0.000053687647,0.0000061207734,0.00006441492,0.008118931],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978247,0.000038823262,0.00051865674,0.000843475,0.00034490225,0.00042941642],"domain_scores_gemma":[0.9987071,0.00025307326,0.00019091932,0.0006631634,0.00008973142,0.00009600693],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00042910187,0.0003257717,0.00037248133,0.0009961375,0.00009182538,0.00009515579,0.00075892394,0.00021610806,0.0038525956],"category_scores_gemma":[0.000043468375,0.00031314406,0.00009240378,0.000249508,0.00035713514,0.00035921842,0.00019954363,0.000800065,0.0012389371],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004330095,0.00007482552,0.00032896103,0.000031663283,0.000021543527,0.00015576265,0.017596029,0.0017338688,0.000049414357,0.040946554,0.00012451927,0.93889356],"study_design_scores_gemma":[0.006373256,0.0015628127,0.11990383,0.007233342,0.000095123265,0.00095132936,0.00006617206,0.08887982,0.0019960443,0.5608526,0.20368913,0.008396531],"about_ca_topic_score_codex":0.000095266114,"about_ca_topic_score_gemma":0.0002338948,"teacher_disagreement_score":0.9754912,"about_ca_system_score_codex":0.00021972375,"about_ca_system_score_gemma":0.0000953025,"threshold_uncertainty_score":0.99993205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043473497,0.00049806794,0.96856034,0.010431051,0.0018436618,0.00040342216,0.000018995308,0.0002158836,0.017593872],"genre_scores_gemma":[0.37925348,0.00013055086,0.607084,0.010915866,0.0017050364,0.000030849187,0.00004718535,0.00008723211,0.000745796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617153,0.000046939414,0.0006202717,0.0014815507,0.0011020966,0.00057759875],"domain_scores_gemma":[0.9963355,0.00031367797,0.00056771236,0.0019050657,0.0006849407,0.00019309578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004788151,0.00059141486,0.00059995387,0.0012423029,0.0002129838,0.00031145234,0.004441942,0.00036801933,0.000047093316],"category_scores_gemma":[0.000019602949,0.000526149,0.00018245698,0.0015959718,0.00026284382,0.00086711365,0.0013141771,0.0011418596,0.000061002596],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018120909,0.000090759546,0.00005016546,0.00018501427,0.000039790837,0.00002179396,0.0036563652,0.011474737,0.0034798814,0.03993407,0.00006251534,0.9409868],"study_design_scores_gemma":[0.00063944276,0.00022684426,0.0013899046,0.0013009256,0.00004669241,0.00019596548,0.000003271765,0.8675127,0.005632968,0.063438155,0.05830751,0.0013056342],"about_ca_topic_score_codex":0.0000884854,"about_ca_topic_score_gemma":0.0024931727,"teacher_disagreement_score":0.9396812,"about_ca_system_score_codex":0.00024346307,"about_ca_system_score_gemma":0.0009003085,"threshold_uncertainty_score":0.999719},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065570296,0.00031030655,0.9859463,0.0011998825,0.0009483694,0.0003713838,0.0000015393293,0.000011142564,0.010555365],"genre_scores_gemma":[0.9083292,0.000028517075,0.08690821,0.0037126623,0.00024451013,0.00002335582,0.0000036583976,0.000025044352,0.0007248712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977788,0.00004266679,0.000449971,0.0007681165,0.0005645187,0.00039593244],"domain_scores_gemma":[0.9979522,0.00056076323,0.00028380845,0.0008561632,0.00029543403,0.000051625695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004845403,0.00029878825,0.00036490487,0.00064355467,0.00011410028,0.00019194926,0.0025618118,0.00014685864,0.000054948385],"category_scores_gemma":[0.00007510707,0.00021549486,0.00011146072,0.0006010244,0.00048367112,0.0006308051,0.0007252216,0.00059380376,0.00009582935],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014012823,0.00010415522,0.00021759653,0.000119312484,0.00004666616,0.0002455872,0.021325724,0.017805655,0.005864098,0.08997673,0.00029756266,0.8639829],"study_design_scores_gemma":[0.00067752076,0.0003382175,0.0060137445,0.0015851014,0.000010871431,0.00026098615,0.000012933005,0.7954746,0.012358268,0.17814761,0.003967787,0.001152362],"about_ca_topic_score_codex":0.00007853828,"about_ca_topic_score_gemma":0.00004620544,"teacher_disagreement_score":0.9076735,"about_ca_system_score_codex":0.00015210811,"about_ca_system_score_gemma":0.00025095374,"threshold_uncertainty_score":0.87876254},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040750205,0.0009619724,0.97832084,0.00018157343,0.003758387,0.00034090324,0.000050109607,0.0003267937,0.016018685],"genre_scores_gemma":[0.380484,0.00018123895,0.6135878,0.0015654606,0.00275858,0.000014049326,0.00031742072,0.000111522895,0.0009799215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944856,0.000083230174,0.0006549495,0.0027766738,0.0011310452,0.00086846825],"domain_scores_gemma":[0.99427533,0.0005895279,0.00040172582,0.0042285807,0.00019728996,0.00030753485],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011934548,0.0006494266,0.00073366775,0.0006748048,0.00029954303,0.00074007234,0.010957473,0.0004899391,0.000036871388],"category_scores_gemma":[0.00016886872,0.0005952669,0.00011951423,0.00048280545,0.00053501077,0.0018102529,0.0056961724,0.0012068735,0.00026460117],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015269583,0.000043415137,0.00012202703,0.00002855306,0.000038018108,0.00028688533,0.0024832643,0.028193973,0.000117956544,0.033705354,0.00019703602,0.93476826],"study_design_scores_gemma":[0.00022486212,0.00011702667,0.00004963252,0.0002453913,0.000009072872,0.000031650667,1.5948828e-7,0.5413654,0.00024368946,0.4548135,0.0022148886,0.00068471214],"about_ca_topic_score_codex":0.0010063783,"about_ca_topic_score_gemma":0.00045930155,"teacher_disagreement_score":0.9340835,"about_ca_system_score_codex":0.00017819069,"about_ca_system_score_gemma":0.00073998724,"threshold_uncertainty_score":0.9996499},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008969552,0.00021203457,0.9954236,0.0012509377,0.0004845821,0.00031250986,0.000014989957,0.00009548845,0.002116152],"genre_scores_gemma":[0.39356205,0.00005630335,0.60489464,0.00079655135,0.00016310856,0.000021973417,0.000020859277,0.00002985777,0.00045465294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972618,0.000019901601,0.00048235402,0.0011407972,0.0007340329,0.00036111224],"domain_scores_gemma":[0.99780095,0.0003197957,0.0003546539,0.0012207057,0.00019143752,0.00011248322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004372671,0.0003349994,0.00032715223,0.00043771093,0.00023910054,0.00013969539,0.0024140913,0.0002374108,0.000012321736],"category_scores_gemma":[0.000046362406,0.00031197479,0.00010340457,0.00051174714,0.0004959577,0.00036136873,0.0004531954,0.0005791159,0.000038101738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002619101,0.00017321878,0.0000116128695,0.000028669518,0.000009394776,0.0000055288465,0.0003740946,0.0636203,0.0018896618,0.6025292,0.00009078629,0.3312649],"study_design_scores_gemma":[0.0002960857,0.0001263788,0.00024049167,0.00027129505,0.0000041630183,0.000010404273,1.3353694e-7,0.7464512,0.0017992809,0.24959537,0.000815642,0.00038957584],"about_ca_topic_score_codex":0.000025134737,"about_ca_topic_score_gemma":0.000012646088,"teacher_disagreement_score":0.68283087,"about_ca_system_score_codex":0.0003668494,"about_ca_system_score_gemma":0.00038818814,"threshold_uncertainty_score":0.99993324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057514093,0.00012963003,0.989988,0.00052380766,0.0018958116,0.0005956396,0.0000059955332,0.00025075083,0.006035172],"genre_scores_gemma":[0.9221404,0.000008909246,0.07582959,0.0010013096,0.00040699093,0.0000118158105,0.000014904551,0.000056093144,0.0005299597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949706,0.000073405456,0.0007142314,0.0020283635,0.001431269,0.0007821151],"domain_scores_gemma":[0.99670756,0.00091771135,0.0006812009,0.0013455587,0.00015569101,0.00019229004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000689025,0.00074578705,0.0007412083,0.00092544244,0.00029760867,0.00087882724,0.0024632462,0.0003250888,0.000021746873],"category_scores_gemma":[0.000051847786,0.0006753407,0.0001534512,0.0005221734,0.0005285168,0.0012679104,0.0012488929,0.0010519518,0.00011269963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023751436,0.00010906144,0.0005899749,0.000070494185,0.000049622962,0.0004333461,0.0012345187,0.057781197,0.00029522568,0.0005675884,0.00018108684,0.93866414],"study_design_scores_gemma":[0.0015150321,0.0008958324,0.0013891277,0.0031320693,0.00004835315,0.0015684405,0.000002915956,0.9454982,0.0062087746,0.019135488,0.017457984,0.003147726],"about_ca_topic_score_codex":0.00012189692,"about_ca_topic_score_gemma":0.00017571224,"teacher_disagreement_score":0.9355164,"about_ca_system_score_codex":0.00082527695,"about_ca_system_score_gemma":0.00033845814,"threshold_uncertainty_score":0.9995698},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012550275,0.0000660062,0.9952793,0.0007112503,0.0011846537,0.00017798707,0.0000037577472,0.000052611314,0.0012694092],"genre_scores_gemma":[0.3482438,0.000012725407,0.650636,0.00072510727,0.0002451155,0.0000036673111,0.000002980692,0.000013829023,0.00011673165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975633,0.000024280265,0.0004991306,0.0009183784,0.0006159811,0.00037893953],"domain_scores_gemma":[0.9982399,0.000381902,0.00031366202,0.0007936921,0.00019199251,0.0000788665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067464,0.0003039693,0.00039942237,0.0007589203,0.00012835827,0.00022302274,0.0017430299,0.00033750193,0.000052274903],"category_scores_gemma":[0.0001494087,0.00027563696,0.00009276621,0.00051329634,0.00054403796,0.00074508076,0.0006339284,0.0009840543,0.00001979083],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034847135,0.000054465978,0.00044476104,0.000054339314,0.0000048003144,0.000028114973,0.0017411697,0.0044333674,0.0066777016,0.0031230927,0.0000107763635,0.98342395],"study_design_scores_gemma":[0.0004264853,0.00015971088,0.005239722,0.00071314105,0.000010819114,0.000061523824,5.575205e-7,0.73776716,0.006115035,0.24791919,0.0006880949,0.0008985499],"about_ca_topic_score_codex":0.00003944644,"about_ca_topic_score_gemma":0.000037287642,"teacher_disagreement_score":0.98252535,"about_ca_system_score_codex":0.00009662602,"about_ca_system_score_gemma":0.00040706224,"threshold_uncertainty_score":0.9999696},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007974688,0.000651273,0.986369,0.0017794515,0.0014206048,0.00080182514,0.0000031244922,0.00016054304,0.00083945756],"genre_scores_gemma":[0.49290472,0.000026039881,0.5046575,0.0011931575,0.000932266,0.000014550006,0.000002556299,0.00007936019,0.00018982883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944747,0.00013201857,0.0007847295,0.0019141937,0.0013650501,0.0013292857],"domain_scores_gemma":[0.9965257,0.0010605323,0.0003039824,0.0016666376,0.00024654335,0.00019661791],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017643188,0.00074212294,0.00067529024,0.0009591835,0.00055585394,0.0016467992,0.00524942,0.00033648152,0.000029644692],"category_scores_gemma":[0.00006272434,0.00052169355,0.00016914756,0.0011432866,0.0008791963,0.00070631993,0.002847621,0.002084793,0.000057293953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035517835,0.00004756541,0.00021443758,0.00007497004,0.00001686052,0.00018115102,0.003707724,0.54993516,0.00034466063,0.011646252,0.000013063806,0.4338146],"study_design_scores_gemma":[0.0001688964,0.000116793126,0.00042201224,0.0007970025,0.0000058200217,0.00015959518,9.023839e-7,0.9578241,0.00019837214,0.03938589,0.00027733447,0.00064327323],"about_ca_topic_score_codex":0.0002726659,"about_ca_topic_score_gemma":0.00015204269,"teacher_disagreement_score":0.48493004,"about_ca_system_score_codex":0.00030513466,"about_ca_system_score_gemma":0.00070403196,"threshold_uncertainty_score":0.99972343},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034014546,0.0010380567,0.99678266,0.000096399715,0.00016468472,0.00017677418,0.000008310087,0.00026917737,0.0011237728],"genre_scores_gemma":[0.17255047,0.00003740487,0.82695353,0.00020665755,0.0001744686,0.0000034060379,0.0000123836135,0.000032301352,0.000029391982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989017,0.000004186194,0.00020979888,0.00044054308,0.00020839224,0.00023538049],"domain_scores_gemma":[0.999523,0.00007805464,0.000060788214,0.00022642968,0.00005565525,0.000056062356],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010837431,0.0002456863,0.00022052198,0.00021155161,0.00013142482,0.00024863525,0.00030980122,0.00015499446,0.000010219585],"category_scores_gemma":[0.000005029996,0.00025254377,0.000027669199,0.00013192196,0.00016425613,0.00018448768,0.00010003921,0.0003359744,0.0000040178656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.9273036e-7,0.0000031818827,0.000005945075,0.000022499544,0.000003328529,0.000005035716,0.000107390304,0.12272383,0.0007073516,0.000078002726,0.00001792562,0.8763247],"study_design_scores_gemma":[0.000068633984,0.000017563036,0.000035671994,0.00026080103,0.0000092627715,0.000009099558,7.151224e-8,0.9309634,0.0017212258,0.0661349,0.0005114966,0.00026790256],"about_ca_topic_score_codex":0.000030505345,"about_ca_topic_score_gemma":0.000021231448,"teacher_disagreement_score":0.8760568,"about_ca_system_score_codex":0.00012560355,"about_ca_system_score_gemma":0.000048134978,"threshold_uncertainty_score":0.99999267},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036681112,0.000519366,0.9941137,0.00006213724,0.00078707526,0.000842816,0.0000030358995,0.0002169862,0.0030880822],"genre_scores_gemma":[0.25783908,0.0000016780222,0.7398653,0.00017644098,0.0009923038,0.00001731543,0.0000022322993,0.00005569659,0.0010499423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942687,0.00036337183,0.0010405296,0.0019503741,0.0013939681,0.0009830128],"domain_scores_gemma":[0.99244046,0.004096481,0.0010028955,0.001499463,0.0007568142,0.0002039021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034040303,0.00081868516,0.001204789,0.0006681078,0.00036776796,0.00038506574,0.0031034881,0.00035474592,0.000006739241],"category_scores_gemma":[0.0002429855,0.0006530651,0.00016252935,0.0010933067,0.0010026427,0.0004458942,0.0011645777,0.001373601,0.000017412647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016156276,0.00007452,0.00030294608,0.00006452853,0.000033593325,0.00003289694,0.0016948421,0.66170835,0.000021759914,0.14504325,0.000009915308,0.19085182],"study_design_scores_gemma":[0.0003079091,0.0015264276,0.00048983155,0.0019068624,0.000022588589,0.00012576916,0.0000019921645,0.9757698,0.00014820039,0.017153684,0.0016529143,0.0008939978],"about_ca_topic_score_codex":0.000017667426,"about_ca_topic_score_gemma":0.000012952128,"teacher_disagreement_score":0.31406146,"about_ca_system_score_codex":0.00043813538,"about_ca_system_score_gemma":0.0008722908,"threshold_uncertainty_score":0.99959207},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039049583,0.00008537949,0.9883814,0.00041115624,0.0010271909,0.00027618583,0.000006058914,0.00008183344,0.0058258665],"genre_scores_gemma":[0.9378737,0.00003233317,0.0535765,0.00708251,0.0008516216,0.0000033363904,0.0000056720323,0.000060589085,0.000513694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729043,0.000017190874,0.00030753238,0.0011658382,0.0008119466,0.00040704073],"domain_scores_gemma":[0.999016,0.00035561528,0.00017479852,0.00023521308,0.00010122669,0.00011718767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038733188,0.00032872628,0.00025580885,0.0005335217,0.00030941845,0.0004266755,0.00049388676,0.0001741045,0.000018183397],"category_scores_gemma":[0.00015625528,0.0002930161,0.00005055967,0.00036646755,0.0007975007,0.00030064,0.00036285838,0.00061577046,0.0000123497],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010850281,0.000012311754,0.000023996281,0.000036901387,7.3413287e-7,0.00012279837,0.0000928039,0.008727023,0.0027059072,0.004176911,0.0000023854052,0.98408735],"study_design_scores_gemma":[0.00023427897,0.00017035655,0.00038905197,0.00014507424,0.0000067230985,0.0005705769,9.7002996e-8,0.638931,0.004506065,0.35365131,0.0008506925,0.0005448126],"about_ca_topic_score_codex":0.0000054241377,"about_ca_topic_score_gemma":0.00002251393,"teacher_disagreement_score":0.98354256,"about_ca_system_score_codex":0.00010906144,"about_ca_system_score_gemma":0.00018683518,"threshold_uncertainty_score":0.9999522},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007679317,0.00015626157,0.9965968,0.0005485945,0.00046173847,0.00035170183,0.000026120597,0.00014809852,0.001633891],"genre_scores_gemma":[0.22811839,0.000117848256,0.7705205,0.00054336095,0.00026447282,0.000008942415,0.000038095295,0.000043191674,0.00034517827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947337,0.00006789001,0.00052394456,0.0026346566,0.0013651268,0.0006746691],"domain_scores_gemma":[0.99480677,0.0009426485,0.0002187642,0.0035980006,0.00019921159,0.00023459044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014737195,0.00047917996,0.0005944345,0.0014763157,0.0002767109,0.0008942328,0.004985479,0.00024835125,0.000046632274],"category_scores_gemma":[0.00030039222,0.0004573952,0.00007914552,0.0012803732,0.0013660111,0.0009869543,0.0063682543,0.0009094601,0.00003076098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035645617,0.000024104851,0.000048506754,0.000038652295,0.00004830076,0.00006142483,0.00019135287,0.12992072,0.000017153801,0.0032582702,0.000005178348,0.8663828],"study_design_scores_gemma":[0.00018848025,0.00011050555,0.00015260656,0.00017030982,0.000024704706,0.000047020643,1.0369042e-7,0.9595024,0.00011907911,0.039124846,0.00011646137,0.0004434672],"about_ca_topic_score_codex":0.000015132019,"about_ca_topic_score_gemma":0.000043427633,"teacher_disagreement_score":0.8659393,"about_ca_system_score_codex":0.0003089427,"about_ca_system_score_gemma":0.00018075321,"threshold_uncertainty_score":0.9997878},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008279407,0.0029688403,0.9873502,0.0018817924,0.0030214698,0.00047523834,0.000006463464,0.00022683947,0.0039863647],"genre_scores_gemma":[0.40158054,0.0001092829,0.5913774,0.0026186493,0.0011846737,0.000047347123,0.000035822864,0.000079954065,0.0029663926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99518114,0.0000873578,0.0006675095,0.0016879791,0.0016707974,0.0007052124],"domain_scores_gemma":[0.99696815,0.00026686405,0.00027003736,0.0012406943,0.0009401141,0.0003141582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013204262,0.0006221205,0.00058804225,0.0010953087,0.00034410445,0.0006847602,0.0026856,0.00036658748,0.00006918818],"category_scores_gemma":[0.00016778309,0.00053096033,0.00017757012,0.0016605079,0.0015714247,0.00076515344,0.0008601844,0.0007372316,0.00006530291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020602869,0.000042902113,0.0000067372307,0.00002950399,0.00001743717,0.000056563862,0.00029594815,0.053228103,0.00011551102,0.75255024,0.000242634,0.19339383],"study_design_scores_gemma":[0.00042383838,0.00019668162,0.00002272851,0.00020055233,0.000011955428,0.00005353544,1.3559493e-7,0.2137337,0.0007022833,0.77601075,0.007949119,0.0006947197],"about_ca_topic_score_codex":0.000007071414,"about_ca_topic_score_gemma":0.000022823438,"teacher_disagreement_score":0.40149772,"about_ca_system_score_codex":0.00027058434,"about_ca_system_score_gemma":0.0009923361,"threshold_uncertainty_score":0.9997142},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007161703,0.0014575957,0.9905624,0.00006696624,0.00014204961,0.000117572985,0.000007688956,0.000022202314,0.00046184802],"genre_scores_gemma":[0.9737782,0.00015919734,0.025444988,0.000104326515,0.00023722734,0.0000028196546,0.000040762185,0.000019394429,0.00021307536],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998596,0.000018382183,0.00018606377,0.0006289869,0.00030163923,0.0002689403],"domain_scores_gemma":[0.9993325,0.00002617893,0.00015195034,0.00029073897,0.00010916476,0.00008946334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022281,0.0002798502,0.00024345581,0.00014936794,0.00010542624,0.00008715176,0.00016443244,0.00018920524,4.1055796e-7],"category_scores_gemma":[0.000006982319,0.00020694315,0.000037495465,0.00009255232,0.00044121782,0.000004772164,0.00015593217,0.00012501034,3.519494e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024655226,0.00015444768,0.0003770336,0.00020874757,0.00018397847,0.000044647186,0.00022804659,0.27465677,0.16516288,0.0037542474,0.000061437546,0.5549212],"study_design_scores_gemma":[0.001808721,0.0028397131,0.0003724827,0.0018034123,0.0002840486,0.00055572385,0.0000050528984,0.4504973,0.5153077,0.0030044431,0.02010377,0.0034176034],"about_ca_topic_score_codex":0.000015347594,"about_ca_topic_score_gemma":0.000044176108,"teacher_disagreement_score":0.9666165,"about_ca_system_score_codex":0.000048787795,"about_ca_system_score_gemma":0.00006873651,"threshold_uncertainty_score":0.84388965},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015394267,0.00071160414,0.99553156,0.00018727718,0.00086393184,0.0003454766,0.0000039742686,0.00015232085,0.0006644302],"genre_scores_gemma":[0.03874188,0.000070324044,0.960422,0.00040852473,0.00025002073,0.0000029638438,0.0000041485505,0.000030171057,0.000069976864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635756,0.000063667576,0.00060071616,0.0015543455,0.00080044754,0.00062323693],"domain_scores_gemma":[0.99736476,0.0001946662,0.00040035706,0.0015754403,0.00022305647,0.00024171069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013819986,0.0004903686,0.00045783032,0.0010885851,0.00047951489,0.0008583616,0.0022912791,0.00031349424,0.000012712832],"category_scores_gemma":[0.0001614525,0.00050629943,0.00010418796,0.0008580579,0.00062834326,0.0012482152,0.0007857701,0.00078772154,0.0000057861785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003045281,0.000028751756,0.00035537468,0.000013754219,0.000009239676,0.000038624356,0.0006169091,0.030107915,0.0021088587,0.07138519,0.0000042495244,0.8953281],"study_design_scores_gemma":[0.00017941343,0.00009282265,0.0017751431,0.0004937486,0.000027706203,0.00010002443,3.3230523e-7,0.95231605,0.0021077667,0.041625135,0.00045123848,0.0008306499],"about_ca_topic_score_codex":0.000038002174,"about_ca_topic_score_gemma":0.000026733418,"teacher_disagreement_score":0.92220813,"about_ca_system_score_codex":0.00046144845,"about_ca_system_score_gemma":0.00036190165,"threshold_uncertainty_score":0.9997389},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008965838,0.004422442,0.99170554,0.000918854,0.0016476632,0.000752346,0.000016325339,0.0002450356,0.00020211175],"genre_scores_gemma":[0.040910926,0.00020972574,0.95570755,0.001635384,0.0013391324,0.000011645736,0.000021794613,0.000067494184,0.00009634041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995295,0.00006382857,0.00072853075,0.0018579188,0.0010110212,0.0010437309],"domain_scores_gemma":[0.9961386,0.0015263341,0.0003334832,0.0014001814,0.00035409565,0.0002473454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001539517,0.000702544,0.00093959214,0.0011080629,0.0006067456,0.0005814959,0.003726234,0.00037862247,0.0000056052186],"category_scores_gemma":[0.000103362014,0.00064244325,0.0004214858,0.0008076387,0.0010593075,0.00033097342,0.0010711732,0.00074387394,0.000018414632],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001750517,0.000020213249,0.00008241208,0.0002553932,0.000044212145,0.000023353328,0.0005470939,0.0022177899,0.000032905697,0.019912397,0.000062964384,0.9767995],"study_design_scores_gemma":[0.00039800594,0.00038609566,0.00015475164,0.0018144889,0.000051288927,0.000060580453,3.369055e-7,0.8490806,0.0006954744,0.14331193,0.003021956,0.0010244765],"about_ca_topic_score_codex":0.000021680007,"about_ca_topic_score_gemma":0.000011380628,"teacher_disagreement_score":0.97577506,"about_ca_system_score_codex":0.00013447001,"about_ca_system_score_gemma":0.00035594136,"threshold_uncertainty_score":0.9996027},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000516561,0.00021073812,0.9872915,0.0004549174,0.0012386811,0.0007977001,0.000005326955,0.00010753893,0.009377032],"genre_scores_gemma":[0.14964001,0.000016574006,0.8481882,0.00033991566,0.00089644507,0.000037510734,0.0000025603324,0.00009977137,0.00077900337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695325,0.000024241977,0.00068819185,0.0009615201,0.0007815492,0.000591263],"domain_scores_gemma":[0.9973864,0.0011223227,0.0002566635,0.0009957594,0.00008513902,0.00015373713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006864371,0.0005245225,0.0007470681,0.00073649926,0.000076895296,0.000112261754,0.0014392517,0.00030898917,0.000036731795],"category_scores_gemma":[0.0006213052,0.0004863534,0.00009355583,0.00048038637,0.00034747628,0.00020103811,0.00069275295,0.00078836904,0.000059159946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008342946,0.000111132096,0.000030841693,0.00014284778,0.000007914423,0.000038833914,0.002298277,0.010446294,0.000025903219,0.6863336,0.000034643097,0.30052137],"study_design_scores_gemma":[0.00026371676,0.000091186586,0.000010959768,0.00069397053,0.0000081313965,0.000015043312,5.317577e-7,0.0152496,0.00040529796,0.98174894,0.00097064266,0.0005419948],"about_ca_topic_score_codex":0.0000034601246,"about_ca_topic_score_gemma":0.0001975707,"teacher_disagreement_score":0.2999794,"about_ca_system_score_codex":0.00047032605,"about_ca_system_score_gemma":0.00024307054,"threshold_uncertainty_score":0.99975884},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5969901,0.032931,0.13433889,0.0036309597,0.0059523284,0.01627557,0.00012062303,0.0005315339,0.20922898],"genre_scores_gemma":[0.9971661,0.00008150052,0.0014252925,0.0004134038,0.00046125025,0.000006647946,0.000003576847,0.000020606978,0.0004216216],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9975598,0.000032261516,0.00030372708,0.00060098356,0.0012103842,0.00029287112],"domain_scores_gemma":[0.9984237,0.00009487282,0.00009448324,0.0009797578,0.0002811551,0.00012600677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000254872,0.00021147836,0.0003989368,0.00029937626,0.00026859264,0.000023576727,0.0008818378,0.00013574919,0.00035079475],"category_scores_gemma":[0.000024828765,0.00013716269,0.00009560873,0.00031774756,0.00095959636,0.00006714192,0.00042245668,0.00069537194,0.0000061800542],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011670776,0.00093003176,0.032724,0.00017022059,0.00006307417,0.00021234536,0.004722888,0.0039877417,0.000952796,0.0005044428,0.00012737517,0.9554884],"study_design_scores_gemma":[0.0031798335,0.005846416,0.95282614,0.00032147317,0.00009591936,0.0002419537,0.00000672324,0.012313255,0.0011491943,0.01845977,0.0047441665,0.00081514975],"about_ca_topic_score_codex":0.0001455366,"about_ca_topic_score_gemma":0.00021307511,"teacher_disagreement_score":0.95467323,"about_ca_system_score_codex":0.0002402556,"about_ca_system_score_gemma":0.000488795,"threshold_uncertainty_score":0.5593332},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015481566,0.0038757038,0.99062175,0.0006862079,0.0015081097,0.0006167148,0.000004114564,0.00024612743,0.002286463],"genre_scores_gemma":[0.828231,0.00006182764,0.16784008,0.002663992,0.0008921029,0.00002699725,0.0000016020937,0.00006861841,0.0002138136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99475145,0.0001646469,0.00067255396,0.0015930786,0.001672892,0.0011453651],"domain_scores_gemma":[0.9952502,0.0011131951,0.0002515919,0.002787614,0.0003685401,0.00022883546],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0038486843,0.0007449561,0.00069649355,0.00062052684,0.0005369569,0.0007418424,0.0067673624,0.00035219657,0.000017867516],"category_scores_gemma":[0.00008198171,0.0004692345,0.00016439549,0.00062792323,0.00078310125,0.0010250455,0.0013252343,0.0013010945,0.000060993323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013797005,0.000015546831,0.000026384734,0.000024261588,0.000027579406,0.000032131367,0.0013177302,0.7181084,0.000050258775,0.055114202,0.0000030873416,0.22526658],"study_design_scores_gemma":[0.0003485604,0.00007855029,0.0000065309787,0.00038706293,0.000021137097,0.00018711772,6.5419766e-7,0.93407285,0.00005848848,0.06380868,0.00039836694,0.0006320215],"about_ca_topic_score_codex":0.000025897612,"about_ca_topic_score_gemma":0.00005645859,"teacher_disagreement_score":0.8280762,"about_ca_system_score_codex":0.00032607693,"about_ca_system_score_gemma":0.0006618108,"threshold_uncertainty_score":0.99977595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009908844,0.00031720003,0.99417216,0.0002155996,0.0012987532,0.00074078044,0.0000056459135,0.00066748296,0.0024832864],"genre_scores_gemma":[0.079886526,0.000011861013,0.91812235,0.0009071576,0.0005420392,0.000037151804,0.000011650536,0.00007311046,0.00040814205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940077,0.000035940142,0.0005412253,0.0023332266,0.0019380817,0.001143805],"domain_scores_gemma":[0.99491847,0.0016330907,0.00015665153,0.0024570895,0.00039925711,0.00043547354],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019864012,0.0006213443,0.00053317373,0.0019517222,0.00023917975,0.00073973706,0.0054043424,0.00032057482,0.00000875067],"category_scores_gemma":[0.0010528519,0.0006096407,0.0001995483,0.0015549811,0.00036426654,0.00054160826,0.0018313515,0.0012698513,0.00019585152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008034806,0.000058997404,0.0003170609,0.0000907068,0.000018795807,0.00009263771,0.0005483323,0.10359969,0.000059875318,0.011201435,0.00016533077,0.88383913],"study_design_scores_gemma":[0.0005367799,0.00046308385,0.0044802506,0.0007030541,0.000017207996,0.00044468435,2.522923e-7,0.93354636,0.0017353009,0.04497443,0.010527982,0.0025705898],"about_ca_topic_score_codex":0.0000202438,"about_ca_topic_score_gemma":0.000010157334,"teacher_disagreement_score":0.8812685,"about_ca_system_score_codex":0.00081654126,"about_ca_system_score_gemma":0.00064672186,"threshold_uncertainty_score":0.9999769},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006658439,0.0006990022,0.9931928,0.0003053009,0.0014154273,0.0002288742,0.000006875356,0.00014824279,0.0033376338],"genre_scores_gemma":[0.4876402,0.000032149015,0.51074785,0.0010183126,0.0003424017,0.000007026325,0.000008827554,0.000033146374,0.00017009593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707264,0.00003631973,0.00055329385,0.00080575916,0.0010063866,0.00052561634],"domain_scores_gemma":[0.99756545,0.00055277406,0.00038396328,0.0011891987,0.00015871938,0.00014988641],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009969263,0.00038726127,0.00048778666,0.0005480977,0.00012746501,0.00018478479,0.002774145,0.00023353704,0.00014353111],"category_scores_gemma":[0.00006093979,0.00034521913,0.00013867248,0.0004367418,0.0006418852,0.00075054925,0.00096164725,0.0004198941,0.00007758334],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013773135,0.000032751243,0.00006664552,0.00005826276,0.000012516614,0.000015865557,0.0007879031,0.002129524,0.00019864347,0.11496258,0.000040064573,0.88169384],"study_design_scores_gemma":[0.00022994225,0.0000810523,0.0005113403,0.00043148862,0.000010688699,0.00010893619,2.0146125e-7,0.62874985,0.0023100215,0.36624396,0.0007169949,0.00060553214],"about_ca_topic_score_codex":0.000011715357,"about_ca_topic_score_gemma":0.000010889184,"teacher_disagreement_score":0.8810883,"about_ca_system_score_codex":0.00014885211,"about_ca_system_score_gemma":0.00041407818,"threshold_uncertainty_score":0.9999},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049789005,0.0004093715,0.99502933,0.00013932995,0.002407725,0.00060085085,0.000031337637,0.00065226975,0.0002318809],"genre_scores_gemma":[0.09822762,0.000016459768,0.8999682,0.00020018085,0.0011527329,0.000027081105,0.00003843072,0.000104139544,0.00026512207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958639,0.00001958994,0.000529141,0.0016175323,0.0011696003,0.00080020353],"domain_scores_gemma":[0.9951466,0.0023945747,0.00022228483,0.0014033036,0.00065436756,0.00017890133],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010819625,0.00050645333,0.00052238145,0.0010208654,0.00027328377,0.0011464484,0.0034357808,0.00038393913,0.0000044201206],"category_scores_gemma":[0.00059389614,0.0005127128,0.00010576784,0.00074674824,0.00023458806,0.0009946186,0.0011280436,0.00058181636,0.000034917193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100924535,0.000011983932,0.00010650355,0.00018231342,0.000015372976,0.000034645673,0.00041052196,0.50507313,0.000098715056,0.004798339,0.000013023781,0.48924536],"study_design_scores_gemma":[0.00027094712,0.000045580982,0.00042341405,0.00088095386,0.0000065585955,0.000029886744,2.3455944e-7,0.9849038,0.00077481946,0.009880955,0.0021860113,0.0005968478],"about_ca_topic_score_codex":0.00008975963,"about_ca_topic_score_gemma":0.00007056295,"teacher_disagreement_score":0.4886485,"about_ca_system_score_codex":0.0007978929,"about_ca_system_score_gemma":0.0004909217,"threshold_uncertainty_score":0.99989045},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007228514,0.0014738281,0.9904053,0.00006076918,0.0002881054,0.0003682977,0.000012560017,0.000022802129,0.0001398197],"genre_scores_gemma":[0.97797346,0.0002450993,0.02067173,0.000093892064,0.0007721974,0.000010263162,0.00008879971,0.000017997007,0.00012658059],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99862313,0.0000129545815,0.00023899395,0.0006711105,0.00017008724,0.0002837195],"domain_scores_gemma":[0.99923164,0.000048721806,0.00013613762,0.00039547452,0.00010611966,0.00008190516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051436224,0.00024297644,0.00025532118,0.00007324118,0.000096796466,0.00007009762,0.00017836405,0.0003656408,2.3695036e-7],"category_scores_gemma":[0.000036671172,0.00020224122,0.00007594068,0.000051618023,0.00044717066,0.000007728011,0.00014934801,0.00019204564,1.2056194e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020691322,0.00007369446,0.00023666456,0.00016574451,0.000075635224,0.000002293795,0.00005293299,0.0020874578,0.39898518,0.00048572087,0.000063850224,0.5975639],"study_design_scores_gemma":[0.0022390897,0.002428432,0.00038082726,0.0013553083,0.0004680187,0.000355478,0.0000035189037,0.2809703,0.61533105,0.018569827,0.073682316,0.004215821],"about_ca_topic_score_codex":0.000009358472,"about_ca_topic_score_gemma":0.0000211276,"teacher_disagreement_score":0.9707449,"about_ca_system_score_codex":0.00007305918,"about_ca_system_score_gemma":0.00004683984,"threshold_uncertainty_score":0.82471573},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101402424,0.0004802179,0.9958339,0.000117812226,0.0009773697,0.0009903029,0.0000011099904,0.00005985137,0.0014380409],"genre_scores_gemma":[0.8582815,0.000017911954,0.14118978,0.00008129401,0.00020115371,0.00004728013,0.000006632839,0.000016699265,0.00015775817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976036,0.000035149726,0.0006022755,0.0008358704,0.00053793663,0.00038515773],"domain_scores_gemma":[0.9983276,0.00030980533,0.0003748966,0.0006759504,0.00025570346,0.000056048382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014177656,0.00027826303,0.0004473642,0.00065557455,0.00010149875,0.0001955555,0.0013761511,0.00022931451,0.0000023413204],"category_scores_gemma":[0.0001388764,0.0002213972,0.000096529584,0.00043682454,0.00032158662,0.00044408502,0.0002161786,0.00022677361,0.0000030703015],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013133117,0.00008390324,0.00044076284,0.00047354103,0.0000242736,0.000016923914,0.008082647,0.021463064,0.002842121,0.2783172,0.000012053718,0.68811214],"study_design_scores_gemma":[0.001965646,0.0005420362,0.00046721438,0.00043181787,0.000016196107,0.000027360395,0.0000039131223,0.65353084,0.020921266,0.31877655,0.0023356555,0.0009814858],"about_ca_topic_score_codex":0.000064079395,"about_ca_topic_score_gemma":0.00010762056,"teacher_disagreement_score":0.8581801,"about_ca_system_score_codex":0.00014695097,"about_ca_system_score_gemma":0.00025755662,"threshold_uncertainty_score":0.9028316},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010807673,0.00022726531,0.9917895,0.00061225396,0.0010704915,0.0018259109,0.000021773552,0.000093990464,0.0043480084],"genre_scores_gemma":[0.011687762,0.000025485584,0.97930306,0.0009543839,0.0004928992,0.00009709096,0.000014944327,0.00007169077,0.007352695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9889425,0.00013900273,0.0012338253,0.002695267,0.005914768,0.0010746596],"domain_scores_gemma":[0.99264765,0.0024658826,0.0005551588,0.0021989779,0.0015960073,0.000536328],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0044970047,0.00067823485,0.000942084,0.0024088386,0.0004242995,0.0020203446,0.0061793504,0.00042704627,0.00060966634],"category_scores_gemma":[0.0045446903,0.00051918306,0.00016497383,0.0021137642,0.0013692887,0.0011540923,0.0018561471,0.0011244746,0.0012154847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007267389,0.000041195886,0.000009456893,0.000015247055,0.0000056694544,0.000017524577,0.0006268963,0.79373527,0.000023856881,0.0006542605,0.00015005605,0.20471333],"study_design_scores_gemma":[0.0003440282,0.00015601564,0.000078435914,0.00019222684,0.0000057258344,0.000058429807,0.0000024672079,0.9379899,0.00014252907,0.05918803,0.001226376,0.00061584415],"about_ca_topic_score_codex":0.00004616289,"about_ca_topic_score_gemma":0.000048405014,"teacher_disagreement_score":0.20409748,"about_ca_system_score_codex":0.00049061613,"about_ca_system_score_gemma":0.0007180935,"threshold_uncertainty_score":0.999726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003971526,0.00015752949,0.9979859,0.00007972022,0.0006666427,0.00044317788,0.00000973405,0.00022433208,0.00003579403],"genre_scores_gemma":[0.19259548,0.000024386747,0.80715626,0.00005731145,0.000115017334,0.0000039346833,0.0000027519447,0.000025188949,0.000019667606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997431,0.000020663876,0.00045625475,0.0010516068,0.0006875896,0.0003528808],"domain_scores_gemma":[0.9977333,0.00023210676,0.00029660505,0.0013683451,0.00024565315,0.00012402449],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068197434,0.00039906503,0.00040693843,0.0007304249,0.000079933,0.00017809538,0.0021953406,0.0004659498,0.000010502622],"category_scores_gemma":[0.00001756022,0.00037735625,0.00005767159,0.00029073193,0.00047344793,0.0003637969,0.0007984931,0.0009009919,0.0000017219454],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023894806,0.000011859649,0.00024117537,0.00003697742,0.000004111793,0.000017397064,0.0004999185,0.0039308877,0.0035043473,0.008099862,0.0000037220827,0.98364735],"study_design_scores_gemma":[0.00037101627,0.00042613797,0.0038155862,0.00092298567,0.000025428742,0.00021809817,4.6452946e-8,0.56341106,0.24601635,0.18165842,0.0015335546,0.0016013045],"about_ca_topic_score_codex":0.000015240018,"about_ca_topic_score_gemma":0.000022329574,"teacher_disagreement_score":0.98204607,"about_ca_system_score_codex":0.000094606556,"about_ca_system_score_gemma":0.00016034453,"threshold_uncertainty_score":0.99986786},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024850618,0.000032734053,0.9721067,0.0016665381,0.00010123654,0.0010649619,0.000001172342,0.00014992298,0.000026107062],"genre_scores_gemma":[0.47590512,0.0000021269768,0.52331626,0.0007061441,0.000019846024,0.00004445481,0.000001265086,0.0000035673963,0.0000012069996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979599,0.00006872045,0.00027732394,0.00063409883,0.00060979335,0.00045012284],"domain_scores_gemma":[0.9984303,0.00045120312,0.000076820186,0.00045935914,0.0004164363,0.00016588783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012379212,0.00016326961,0.00019861027,0.00020985244,0.00024720613,0.0007280677,0.0008645608,0.000058907433,0.00000788286],"category_scores_gemma":[0.00022942816,0.00011937137,0.000025141439,0.0008061001,0.00058436085,0.0010401497,0.0002748893,0.00020392121,0.0000036958586],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053714306,0.00011734416,0.0002632194,0.000067484485,0.0000070372635,0.00001193835,0.0023754085,0.024066811,0.027508894,0.00062184816,0.00007954758,0.9448268],"study_design_scores_gemma":[0.0010648355,0.00026420483,0.0010099565,0.0000464076,0.000001755381,0.000024507008,0.000002666151,0.9060102,0.0896959,0.0017196336,0.0000048865495,0.00015500968],"about_ca_topic_score_codex":0.00016004388,"about_ca_topic_score_gemma":0.000051681374,"teacher_disagreement_score":0.94467175,"about_ca_system_score_codex":0.000083191146,"about_ca_system_score_gemma":0.00022175607,"threshold_uncertainty_score":0.7020774},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009543767,0.0005015799,0.9916508,0.0010235582,0.0012306212,0.00017810629,0.000015674343,0.00017244434,0.005131752],"genre_scores_gemma":[0.009782519,0.00006569112,0.98685026,0.0009497806,0.0009848678,0.000016928783,0.00002434115,0.00002835966,0.0012972305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970938,0.00001941831,0.00038801992,0.0010071109,0.0008463765,0.00064526347],"domain_scores_gemma":[0.9976457,0.00048361006,0.0003544528,0.0011752772,0.00017818269,0.00016278401],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010828228,0.00034013294,0.00034070993,0.00044066433,0.00028036922,0.000637003,0.0026841166,0.00028456157,0.000027548931],"category_scores_gemma":[0.000109168584,0.00032753748,0.000086880194,0.000406183,0.00016696849,0.0008276812,0.0011443864,0.0004922853,0.00019652909],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.3804835e-7,0.00001648145,0.0001650929,0.000007784806,0.0000070589567,0.0000050687313,0.00049285183,0.0003646659,0.000030712166,0.021592502,0.0001393617,0.9771781],"study_design_scores_gemma":[0.00040298427,0.0001404656,0.0015061271,0.0005175424,0.000033761236,0.00007432685,5.8352856e-7,0.7616234,0.0015411015,0.1449481,0.08741847,0.0017931678],"about_ca_topic_score_codex":0.000018410181,"about_ca_topic_score_gemma":0.000017378106,"teacher_disagreement_score":0.9753849,"about_ca_system_score_codex":0.0004543098,"about_ca_system_score_gemma":0.00027947885,"threshold_uncertainty_score":0.9999177},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019468071,0.00007959059,0.9785073,0.00052583596,0.00083058595,0.00035470419,0.0000057598454,0.00008439331,0.00014379648],"genre_scores_gemma":[0.8581547,0.0000053410704,0.14122558,0.000250781,0.00030238737,0.0000059907475,0.000009042136,0.000018465667,0.000027715949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963684,0.00029469092,0.000522803,0.0014221885,0.0009332215,0.00045871292],"domain_scores_gemma":[0.9972103,0.0005751424,0.00036651548,0.0010858395,0.0004948017,0.0002673557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013308913,0.00046823447,0.0006415753,0.00033033272,0.00018214367,0.0002802509,0.0016721064,0.00029222612,0.000017951123],"category_scores_gemma":[0.00018008432,0.00038761625,0.00012340354,0.00034152507,0.00070872693,0.00072144,0.0007436172,0.00071184564,0.0000041586154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013179622,0.000080731064,0.010767033,0.00005362262,0.000020442207,0.000010183206,0.0018392717,0.7902129,0.00095407845,0.001148812,0.000020986738,0.1948787],"study_design_scores_gemma":[0.00019014705,0.00037711518,0.0062013287,0.0001491949,0.000009472268,0.0000064769815,5.270334e-7,0.86207086,0.0034687845,0.12709042,0.000032347518,0.00040333634],"about_ca_topic_score_codex":0.000030789663,"about_ca_topic_score_gemma":0.00019316527,"teacher_disagreement_score":0.83868665,"about_ca_system_score_codex":0.0003157256,"about_ca_system_score_gemma":0.00051028933,"threshold_uncertainty_score":0.99985754},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00798253,0.000087291985,0.99052614,0.000061983854,0.0010635722,0.00019067644,0.000005777191,0.000057908077,0.000024119148],"genre_scores_gemma":[0.44507903,0.0000036056897,0.5546815,0.0001852787,0.000044659624,0.000002859689,9.3066393e-7,0.0000020630434,6.501869e-8],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800485,0.00013228145,0.00034710503,0.00037630426,0.00069980737,0.00043963178],"domain_scores_gemma":[0.99898666,0.00019038451,0.00013217669,0.00043912782,0.00013150493,0.00012012276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013665243,0.0001309228,0.0002076099,0.0002464484,0.000064088395,0.00011772494,0.000782489,0.000052759726,0.0000069028915],"category_scores_gemma":[0.000117106145,0.00012175323,0.000029034261,0.0019844358,0.00032975644,0.0011727024,0.0004456639,0.00015560303,0.0000016081294],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031728448,0.00020138062,0.10535359,0.000044898497,0.0000061141473,0.0000061618107,0.0007696731,0.010599123,0.02222089,0.0033461768,0.000044582368,0.85740423],"study_design_scores_gemma":[0.0001460538,0.00008531507,0.13725817,0.00005217324,0.0000043535897,0.0000069189773,0.0000014380565,0.8307086,0.023639262,0.007916525,0.000006296375,0.00017488567],"about_ca_topic_score_codex":0.00012379495,"about_ca_topic_score_gemma":0.00001348065,"teacher_disagreement_score":0.85722935,"about_ca_system_score_codex":0.0003278697,"about_ca_system_score_gemma":0.00027303142,"threshold_uncertainty_score":0.49649528},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008385063,0.000102132224,0.9898699,0.00007470372,0.0002325568,0.00092739245,0.000054615368,0.0000101311525,0.00034351027],"genre_scores_gemma":[0.9783196,0.00000559901,0.021351175,0.00000733246,0.00012778086,0.000040099472,0.0000086562295,0.00001365923,0.00012609382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984643,0.000032253374,0.0006729956,0.00030023363,0.00039122865,0.00013902801],"domain_scores_gemma":[0.99803215,0.00059248705,0.0005035865,0.0005227045,0.0002965264,0.000052565178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019937869,0.00016848222,0.0004452063,0.0002876123,0.0000946402,0.000043900123,0.00040289786,0.00014385127,0.000010414971],"category_scores_gemma":[0.0001171526,0.0001211136,0.000059266553,0.00021849421,0.00048051853,0.00006779526,0.00018009184,0.00014339735,0.0000012888355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010814189,0.00010305619,0.00013958658,0.0006077699,0.000043697368,1.676307e-7,0.0013271043,0.008135007,0.008206573,0.89317644,0.000011687654,0.08823812],"study_design_scores_gemma":[0.00042883036,0.00016679408,0.0046620686,0.0013299744,0.000121515615,0.000010119737,0.000013031579,0.6307094,0.0009210864,0.36091942,0.00023878882,0.0004789668],"about_ca_topic_score_codex":0.000175466,"about_ca_topic_score_gemma":0.00010782818,"teacher_disagreement_score":0.9699345,"about_ca_system_score_codex":0.000049147046,"about_ca_system_score_gemma":0.00009131178,"threshold_uncertainty_score":0.49388692},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033783574,0.000612985,0.99069995,0.0005220687,0.0035136978,0.0010940807,0.000026425476,0.0001941658,0.0033028433],"genre_scores_gemma":[0.47281206,0.0000952986,0.50777125,0.0076353247,0.008839529,0.00037545897,0.00016024151,0.00017267496,0.002138142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655586,0.000036754125,0.00065033825,0.0013475909,0.00068030966,0.00072912907],"domain_scores_gemma":[0.9967996,0.0004889876,0.00048136825,0.0016771228,0.0004060409,0.0001469091],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014448566,0.00051876775,0.00047531628,0.00029643674,0.0005616166,0.0006421298,0.004274518,0.00030113073,0.0000074616355],"category_scores_gemma":[0.00005639546,0.00037367226,0.0002020906,0.00044403353,0.0004285724,0.00037811368,0.00082465244,0.00055141776,0.000074691205],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013775818,0.000035848097,0.00007235321,0.00013145478,0.00004323941,0.0000115607745,0.0019033215,0.021327622,0.0002631924,0.18317457,0.0008105183,0.79221255],"study_design_scores_gemma":[0.00040472363,0.00016524091,0.000096703785,0.00028232433,0.00001916091,0.000085765874,2.6625492e-7,0.71095973,0.0008714134,0.11196507,0.17419057,0.0009590479],"about_ca_topic_score_codex":0.000035285262,"about_ca_topic_score_gemma":0.00002490577,"teacher_disagreement_score":0.7912535,"about_ca_system_score_codex":0.00016176495,"about_ca_system_score_gemma":0.0004901694,"threshold_uncertainty_score":0.9998715},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016100745,0.00074405246,0.9963259,0.00029202175,0.00041610267,0.0009435122,0.000002469747,0.00010192797,0.0010130054],"genre_scores_gemma":[0.10870618,0.000018021727,0.89076734,0.0002009409,0.00018119921,0.000012836341,0.0000028761278,0.000017773038,0.000092867274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997287,0.000039138926,0.00046548212,0.0010711431,0.00059702876,0.0005402208],"domain_scores_gemma":[0.99771005,0.00040112,0.0004676841,0.0010489498,0.0002854316,0.00008674916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078145345,0.0003910709,0.0005254327,0.00035207107,0.000270216,0.00022176027,0.0015563027,0.0002061749,0.0000015885408],"category_scores_gemma":[0.000027478409,0.00030978493,0.000094385825,0.00046606976,0.0005834473,0.00030067773,0.00045185175,0.00041342978,8.985076e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003739189,0.000051652278,0.00020944978,0.00016074546,0.000063336345,0.00016356124,0.0005753065,0.3736987,0.0000063755674,0.055682838,0.000005271185,0.56934536],"study_design_scores_gemma":[0.0004710964,0.00033715853,0.0007031622,0.0009968262,0.00004857804,0.000088843335,0.0000016476185,0.9075109,0.0001443511,0.08900841,0.00015071947,0.00053834595],"about_ca_topic_score_codex":0.000008687555,"about_ca_topic_score_gemma":0.000025446903,"teacher_disagreement_score":0.568807,"about_ca_system_score_codex":0.00018779899,"about_ca_system_score_gemma":0.00022257802,"threshold_uncertainty_score":0.99993545},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012356842,0.00024008103,0.9766951,0.0004831727,0.0036430913,0.00038533387,0.0000025855936,0.00043501944,0.01799204],"genre_scores_gemma":[0.38066015,0.00011439566,0.61304367,0.0023711382,0.00076977455,0.000046430116,0.000009579174,0.00010305152,0.0028818476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960623,0.000023483404,0.0005999932,0.0017815247,0.00077770656,0.0007550379],"domain_scores_gemma":[0.9968565,0.00017211963,0.00042458897,0.001980351,0.0004613044,0.00010510403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006534722,0.00062191306,0.000568701,0.0017014429,0.00029501782,0.00034356,0.0049046283,0.000589422,0.00011590253],"category_scores_gemma":[0.00006981473,0.000586941,0.00013300232,0.0008181858,0.0011330023,0.001030574,0.0019621567,0.0015910417,0.00040281002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000087585,0.000037059664,0.000025987254,0.00002022024,0.000012185643,0.00014130179,0.00086770067,0.00042717924,0.00028337797,0.20030558,0.0000820922,0.79778856],"study_design_scores_gemma":[0.00035134138,0.00032755727,0.00023507359,0.00092934165,0.000014097979,0.0002054793,2.1281086e-7,0.060773637,0.017346688,0.9134443,0.005075072,0.0012972315],"about_ca_topic_score_codex":0.000026862936,"about_ca_topic_score_gemma":0.000053866155,"teacher_disagreement_score":0.7964913,"about_ca_system_score_codex":0.00036517088,"about_ca_system_score_gemma":0.000378923,"threshold_uncertainty_score":0.9996582},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019272754,0.00020482649,0.9935889,0.00022048478,0.0016572066,0.0005141775,0.000015223923,0.0001437171,0.0034627267],"genre_scores_gemma":[0.0393692,0.000033346343,0.95973194,0.00045027025,0.00016871568,0.000028782842,0.0000035648336,0.000033043307,0.00018115445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576944,0.00013574465,0.0008634363,0.0014059355,0.0012277884,0.00059766043],"domain_scores_gemma":[0.99463147,0.001684435,0.0007499566,0.0022969556,0.00046267375,0.00017453067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019676255,0.0005339921,0.0007349279,0.0012852739,0.00015650898,0.00033764224,0.0044263867,0.00042398446,0.00006724736],"category_scores_gemma":[0.0007948126,0.0004912948,0.00021023625,0.0009564503,0.0007701873,0.00096555304,0.0007415021,0.0006559761,0.00008525401],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000147051705,0.000065665816,0.000005112058,0.00007078653,0.000009817034,0.000013105882,0.000094971874,0.02412468,0.00047342147,0.013090523,0.000027386128,0.96200985],"study_design_scores_gemma":[0.00035034874,0.00041931344,0.00006526306,0.0005431447,0.000015727732,0.000020172725,1.1926646e-7,0.91484,0.05152432,0.03039116,0.0011404058,0.0006900552],"about_ca_topic_score_codex":0.000045006967,"about_ca_topic_score_gemma":0.000008025371,"teacher_disagreement_score":0.96131974,"about_ca_system_score_codex":0.0003339091,"about_ca_system_score_gemma":0.00075608667,"threshold_uncertainty_score":0.9997539},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049298187,0.00012402897,0.9955454,0.00072581286,0.0008864368,0.0004400888,0.000009119166,0.000108554465,0.0016675687],"genre_scores_gemma":[0.83302784,0.0000074058266,0.16503152,0.0008024904,0.0008704796,0.000018546662,0.000032556894,0.000022113476,0.00018707674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971862,0.00002369702,0.0004889775,0.0011170948,0.0007439926,0.00044004433],"domain_scores_gemma":[0.998121,0.00039954585,0.00029955356,0.0008644543,0.00020410962,0.00011129329],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038741485,0.0003491531,0.0003462222,0.0003743248,0.00038277276,0.00039051403,0.0016014999,0.0002586024,0.000029937297],"category_scores_gemma":[0.00002064596,0.0003229246,0.00012891287,0.00042828478,0.00041258725,0.00014376266,0.00045280773,0.0005185083,0.000025211915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004598533,0.000031727363,0.000016706019,0.000008481583,0.0000042391625,0.0000131605775,0.000036449273,0.8747199,0.0002730388,0.024581635,0.000090871275,0.10021918],"study_design_scores_gemma":[0.0003625526,0.00003072543,0.00025038427,0.00008295679,0.0000071954487,0.000032636428,2.0555644e-8,0.9529774,0.00020661006,0.045089807,0.00061559485,0.0003440707],"about_ca_topic_score_codex":0.00007414882,"about_ca_topic_score_gemma":0.000098234756,"teacher_disagreement_score":0.83253485,"about_ca_system_score_codex":0.0001632815,"about_ca_system_score_gemma":0.00033793962,"threshold_uncertainty_score":0.9999223},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3817677,0.000019431178,0.6171984,0.0006215366,0.000050462295,0.00022972986,3.003626e-7,0.00007312072,0.00003928636],"genre_scores_gemma":[0.63282835,0.000001630411,0.36638796,0.00068820897,0.00007428168,0.0000110595965,5.5273875e-7,0.0000063462335,0.0000016280658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990563,0.000008663685,0.00013812548,0.00032966593,0.000184731,0.000282535],"domain_scores_gemma":[0.9993443,0.00009568973,0.0000403172,0.000357446,0.00008779984,0.00007443858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015745865,0.00009500613,0.00014085717,0.00012496828,0.00012518358,0.000058311103,0.0001774974,0.000031057527,0.00001590969],"category_scores_gemma":[0.000082870334,0.00007499496,0.000037221813,0.0007155576,0.00018645496,0.0002029676,0.00014089583,0.00018670231,0.000013035188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028917182,0.00004669469,0.04829767,0.000033662145,0.000004171046,0.00000995482,0.0004949656,0.010685552,0.15630999,0.000289324,0.000039509774,0.78378564],"study_design_scores_gemma":[0.00029497425,0.00011432412,0.032424036,0.00020975801,0.000014038322,0.0001071155,0.0000026031928,0.7972505,0.14247255,0.025804833,0.000949331,0.0003559488],"about_ca_topic_score_codex":0.000060287224,"about_ca_topic_score_gemma":0.0000010655723,"teacher_disagreement_score":0.78656495,"about_ca_system_score_codex":0.000081529375,"about_ca_system_score_gemma":0.00006234812,"threshold_uncertainty_score":0.30582058},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09179178,0.000036410464,0.9051254,0.0018318739,0.00015985558,0.0008744703,4.940307e-7,0.0001508599,0.000028866041],"genre_scores_gemma":[0.54385924,0.000001055259,0.45573157,0.00029438568,0.00004503102,0.000064221866,6.0934804e-7,0.0000034290185,4.8271016e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784964,0.00005021129,0.00023100003,0.00094691524,0.0004463267,0.00047588858],"domain_scores_gemma":[0.99852943,0.00018554978,0.00011048797,0.0008491012,0.00020396282,0.00012147687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028356636,0.00017341893,0.0001419034,0.00013769256,0.00023559139,0.00030104877,0.001297301,0.000028870374,0.000019684863],"category_scores_gemma":[0.000050880863,0.00013068902,0.000021935337,0.0024229088,0.00069470203,0.0013451908,0.00031503648,0.00019806692,0.000050355666],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021514882,0.000100073055,0.006532921,0.000008134539,0.0000023375576,0.00000543338,0.00036006648,0.08236832,0.0069232956,0.0020349128,0.00001039724,0.901652],"study_design_scores_gemma":[0.00041240544,0.00014315615,0.026938764,0.000037797363,0.0000023780838,0.00009400303,7.748969e-7,0.7243256,0.11028337,0.1373134,0.00005618641,0.00039220808],"about_ca_topic_score_codex":0.000021947495,"about_ca_topic_score_gemma":0.000017782539,"teacher_disagreement_score":0.9012597,"about_ca_system_score_codex":0.00014995968,"about_ca_system_score_gemma":0.00015812465,"threshold_uncertainty_score":0.5329343},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009847906,0.0000688058,0.99366105,0.0020301205,0.0014275903,0.00034574678,0.0000060571515,0.00021407985,0.0022366764],"genre_scores_gemma":[0.096243486,0.0000035572434,0.89776134,0.0053734197,0.00039402422,0.000006119298,0.000022742986,0.000028912349,0.00016641211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609774,0.000083016486,0.0005954859,0.0014522936,0.0011247798,0.0006466762],"domain_scores_gemma":[0.99715704,0.0004919612,0.00034697205,0.0014834898,0.00033586918,0.0001846951],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010326961,0.000547954,0.00054419396,0.00068297045,0.0003247836,0.0008886163,0.0029218735,0.00033160992,0.000058355057],"category_scores_gemma":[0.00010742151,0.0005062735,0.00015753495,0.0004983277,0.0006936919,0.00054626743,0.00072344457,0.0007408731,0.000020980411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003700138,0.000009630411,0.000021564698,0.000044896373,0.000007145369,0.000037822047,0.00017084494,0.7076714,0.000023528459,0.031457283,0.000018976916,0.2605332],"study_design_scores_gemma":[0.00034693943,0.0001333356,0.000024249086,0.00017803024,0.000007714672,0.00002141084,7.251977e-8,0.94457406,0.0007397135,0.052882224,0.00050597975,0.00058628607],"about_ca_topic_score_codex":0.000020899426,"about_ca_topic_score_gemma":0.000038943424,"teacher_disagreement_score":0.2599469,"about_ca_system_score_codex":0.00031995674,"about_ca_system_score_gemma":0.0010160384,"threshold_uncertainty_score":0.9997389},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019102463,0.00015490437,0.9904848,0.00035078733,0.0007084226,0.00030367178,0.000016227747,0.0005343802,0.0074277245],"genre_scores_gemma":[0.07662877,0.000008613478,0.9195804,0.0003938693,0.0011116004,0.000036878704,0.00007978932,0.00008513515,0.0020749208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960619,0.00005232169,0.00041642692,0.0017595115,0.0009731406,0.00073669443],"domain_scores_gemma":[0.99749833,0.0006490397,0.00034621087,0.0010073829,0.0002889718,0.00021005078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007078921,0.00059656956,0.0004855214,0.00069469627,0.000523475,0.00073176104,0.0026526693,0.00024355401,0.00021964633],"category_scores_gemma":[0.00025403316,0.0004908918,0.00010343425,0.0006630927,0.0007004407,0.0005580311,0.0012017589,0.0017644844,0.000120357305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040746054,0.000043980424,0.00001354234,0.000090597525,0.000010004737,0.00011967868,0.0005304496,0.2034419,0.000010361519,0.029648999,0.000022687518,0.7660637],"study_design_scores_gemma":[0.00041256577,0.00044000737,0.000094507894,0.0009580852,0.000008564813,0.0002163187,1.3041114e-7,0.93067294,0.000040745053,0.063452594,0.0029453381,0.0007582291],"about_ca_topic_score_codex":0.00003726053,"about_ca_topic_score_gemma":0.00004951868,"teacher_disagreement_score":0.76530546,"about_ca_system_score_codex":0.0004738474,"about_ca_system_score_gemma":0.0017864025,"threshold_uncertainty_score":0.99975425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049819034,0.00021180003,0.9474768,0.0014165452,0.0006239636,0.00019314705,1.3694314e-7,0.00018394497,0.000074622425],"genre_scores_gemma":[0.81332076,0.000010061536,0.1860501,0.00050301844,0.000082530554,0.000014105562,4.860349e-7,0.000010363626,0.000008586605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974061,0.00015515376,0.00035541746,0.00082567194,0.00067401375,0.00058359565],"domain_scores_gemma":[0.9983576,0.0005726852,0.00021677486,0.000546454,0.00019015408,0.000116324554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008759295,0.00021020943,0.00024212022,0.0003655388,0.00027150882,0.00035563356,0.0018508745,0.000102162354,0.000032956836],"category_scores_gemma":[0.0003097733,0.00020017294,0.000058863203,0.002291211,0.00024368326,0.0012546272,0.0007144341,0.00061961665,0.000046681776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016041122,0.000023869685,0.0049172104,0.000015273714,0.000003473541,0.000003075514,0.0014523829,0.14886665,0.023111995,0.00020813556,0.000057462876,0.82133883],"study_design_scores_gemma":[0.00018729619,0.0002477826,0.0034937095,0.000041599298,0.0000011897048,0.000022565931,0.0000026497735,0.941963,0.04940085,0.004048855,0.00035565512,0.000234853],"about_ca_topic_score_codex":0.00032096132,"about_ca_topic_score_gemma":0.00002445993,"teacher_disagreement_score":0.821104,"about_ca_system_score_codex":0.00018396381,"about_ca_system_score_gemma":0.00009812455,"threshold_uncertainty_score":0.81628156},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016114818,0.009329921,0.9713729,0.0003702876,0.00080597977,0.00023851662,0.0005203332,0.000051424544,0.0011958352],"genre_scores_gemma":[0.74963284,0.0007999465,0.24405067,0.000532527,0.0025702845,0.0000049305518,0.0015369547,0.000047410314,0.00082446117],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99823475,0.000032063333,0.00031397262,0.001025278,0.00017661502,0.00021734695],"domain_scores_gemma":[0.9983397,0.00040577375,0.00015547319,0.00092146697,0.000036182963,0.00014139479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030830118,0.00021592551,0.00027203554,0.00006856396,0.00011517032,0.000052548843,0.0007685267,0.00042993322,0.000016736572],"category_scores_gemma":[0.0004866991,0.00017733601,0.000045651155,0.00004935752,0.0008923215,0.000008999904,0.0010192737,0.00033029375,0.000008340544],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075186904,0.000022430502,0.05585171,0.0000040075056,0.000043002547,0.000013555135,0.000028124927,0.000005365359,0.00007875569,0.00001756809,0.00011946248,0.9438085],"study_design_scores_gemma":[0.0023515588,0.0018667325,0.7627526,0.0010815178,0.0006882942,0.000057478188,0.0000017332344,0.0062193926,0.0009842247,0.10289215,0.118636765,0.0024675494],"about_ca_topic_score_codex":0.000046992373,"about_ca_topic_score_gemma":0.000068028894,"teacher_disagreement_score":0.9413409,"about_ca_system_score_codex":0.000016517286,"about_ca_system_score_gemma":0.00019609199,"threshold_uncertainty_score":0.72315526},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091034546,0.00096826686,0.9938379,0.000120966135,0.00040191723,0.00054324063,0.0000017901638,0.0004577258,0.002757839],"genre_scores_gemma":[0.50734437,0.00003340046,0.49214292,0.00026489675,0.00013530886,0.000013107226,0.0000048327433,0.000020630192,0.000040519448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99477535,0.000114453935,0.0006669583,0.0012529161,0.0027295705,0.0004607698],"domain_scores_gemma":[0.996021,0.0001809148,0.0006642395,0.001599903,0.0014367346,0.00009726467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004375518,0.00048395252,0.0005668793,0.0009729612,0.00025875348,0.0002369476,0.0040071495,0.00037013463,0.000008859987],"category_scores_gemma":[0.00014719415,0.00041578466,0.00010469402,0.00054512004,0.00072379806,0.0006438316,0.0014929782,0.0008008218,0.000005528024],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019154024,0.000014921209,0.000024295961,0.00006121526,0.00000439719,0.000003523952,0.00019997732,0.0013103316,0.005952771,0.005836512,0.000008377213,0.98658174],"study_design_scores_gemma":[0.00017646918,0.00027004266,0.000042467607,0.002644215,0.000016962758,0.000026315884,8.118268e-8,0.63300693,0.18381856,0.17916586,0.00020732339,0.0006247694],"about_ca_topic_score_codex":0.00001395896,"about_ca_topic_score_gemma":0.000012946977,"teacher_disagreement_score":0.98595697,"about_ca_system_score_codex":0.00041693554,"about_ca_system_score_gemma":0.00049038284,"threshold_uncertainty_score":0.9998294},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007483533,0.00014863213,0.99346167,0.00084110757,0.0011644445,0.0013159837,0.000030839645,0.00054938346,0.0024131245],"genre_scores_gemma":[0.031204266,0.000087893415,0.96360224,0.0033266332,0.0008460836,0.00020918572,0.00012287367,0.00007459924,0.00052621256],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564594,0.00006269021,0.00076064485,0.001844357,0.0009408209,0.00074555475],"domain_scores_gemma":[0.9966893,0.000880736,0.0004994045,0.0010736791,0.00065588555,0.00020100363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014695138,0.0006338834,0.00062873104,0.0012595858,0.00036594048,0.0008056617,0.0023534764,0.00048230262,0.00011876323],"category_scores_gemma":[0.00018642799,0.00062329683,0.00023732365,0.0005197115,0.00049899716,0.00084710796,0.0005884409,0.00061549933,0.00017519397],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007512229,0.00002027109,0.0000073622855,0.00006451846,0.000009996338,0.000008435571,0.0001907225,0.00009897629,0.00067175087,0.0029752702,0.000117950214,0.99582726],"study_design_scores_gemma":[0.00082904514,0.00066075637,0.000053446005,0.00090082927,0.000030109939,0.000118417476,3.087996e-7,0.39373475,0.04490785,0.5531445,0.0042523607,0.0013676208],"about_ca_topic_score_codex":0.000012345885,"about_ca_topic_score_gemma":0.00004700745,"teacher_disagreement_score":0.9944596,"about_ca_system_score_codex":0.00030434757,"about_ca_system_score_gemma":0.00036492434,"threshold_uncertainty_score":0.9996218},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002813482,0.0013223303,0.9895605,0.002278391,0.0034256394,0.00060954044,0.0000027578842,0.00014543188,0.0023740695],"genre_scores_gemma":[0.5417091,0.00054279034,0.45113707,0.004439677,0.000935961,0.000049071492,0.000007383483,0.000094442636,0.0010844669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597377,0.000118437245,0.00063812506,0.0014157537,0.0011711173,0.00068280834],"domain_scores_gemma":[0.9976669,0.00023937234,0.00035582806,0.001395464,0.00020937057,0.00013304067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013329333,0.0005032287,0.00043312646,0.0006694771,0.00034346522,0.0003337586,0.003119564,0.0002912411,0.000048853588],"category_scores_gemma":[0.0001043945,0.00039218823,0.00013023785,0.0010594113,0.0002593858,0.0007205488,0.0009525761,0.000801259,0.00006515167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026781254,0.0005295856,0.0073825233,0.0004160612,0.0001319972,0.00068355084,0.044366017,0.09984779,0.0014510453,0.09722687,0.004331691,0.7436061],"study_design_scores_gemma":[0.00065026636,0.00016111377,0.004618027,0.00089452637,0.000016982973,0.00021263846,0.0000042635497,0.9435435,0.0009224862,0.036604658,0.010851441,0.0015200998],"about_ca_topic_score_codex":0.00012122584,"about_ca_topic_score_gemma":0.00016140107,"teacher_disagreement_score":0.8436957,"about_ca_system_score_codex":0.00048420267,"about_ca_system_score_gemma":0.00054252276,"threshold_uncertainty_score":0.999853},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001995033,0.0012138662,0.9930977,0.00008170242,0.00088709063,0.00049587,0.00019393524,0.000027202152,0.002007567],"genre_scores_gemma":[0.8888296,0.000047695663,0.1105367,0.000021563636,0.00016386094,0.0000015015839,0.0001988547,0.000011207712,0.00018900847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976951,0.000030879157,0.00045132794,0.00067588966,0.00074671203,0.00040012557],"domain_scores_gemma":[0.9974136,0.0013866262,0.00029382174,0.000500039,0.00029478816,0.00011116279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039734266,0.000289897,0.00055775716,0.0005052399,0.000088771056,0.000076309465,0.0010500152,0.00027832642,0.00018430666],"category_scores_gemma":[0.000108888715,0.00024807025,0.000103509694,0.00023089198,0.0007644713,0.00016347345,0.000085793596,0.00042448318,0.000010622088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009155601,0.0000932638,0.0062375385,0.0003506771,0.00011236607,0.000012407326,0.0038984516,0.41246828,0.014432189,0.00014024501,0.00023486941,0.5611042],"study_design_scores_gemma":[0.0011411711,0.0012383912,0.023148613,0.00029433126,0.000059243557,0.0000036266645,0.000005078296,0.9017913,0.042748198,0.028723834,0.00027231823,0.00057391566],"about_ca_topic_score_codex":0.0008715406,"about_ca_topic_score_gemma":0.0033607765,"teacher_disagreement_score":0.88683456,"about_ca_system_score_codex":0.000025475994,"about_ca_system_score_gemma":0.00028891925,"threshold_uncertainty_score":0.99999714},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028638575,0.0027631593,0.90622973,0.0046083205,0.0062374244,0.0023842675,0.000043264678,0.00012583063,0.04896942],"genre_scores_gemma":[0.98792225,0.00004241063,0.0044889017,0.0022687064,0.00078059133,0.00009038598,0.00005235643,0.00003567734,0.004318694],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858123,0.000061614635,0.00020749021,0.00074739696,0.0001913072,0.00021098249],"domain_scores_gemma":[0.99848735,0.0007212761,0.00013701803,0.00041386648,0.00017269283,0.000067781635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035640807,0.0002832151,0.00025673423,0.00026847556,0.00011642873,0.0001916733,0.00029146048,0.00021450217,0.00023486243],"category_scores_gemma":[0.000051790154,0.00020562108,0.000031126954,0.00020261444,0.00043802013,0.000121273515,0.00006320606,0.00033877397,0.00016012277],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027253109,0.000044596607,0.00013280948,0.000018518285,0.00002119758,0.0000026305177,0.0059629725,0.0006451964,0.00037338756,0.091360904,0.00039457102,0.90101594],"study_design_scores_gemma":[0.006045659,0.019141551,0.086159594,0.003925106,0.00015687123,0.0003224143,0.00012467531,0.085369304,0.011528514,0.56345284,0.2161071,0.007666396],"about_ca_topic_score_codex":0.000019508383,"about_ca_topic_score_gemma":0.000041674215,"teacher_disagreement_score":0.9592837,"about_ca_system_score_codex":0.00010774266,"about_ca_system_score_gemma":0.00008676968,"threshold_uncertainty_score":0.8384984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23100199,0.000100347475,0.7682644,0.00015593378,0.00015189637,0.00019448681,6.1651923e-7,0.00011885533,0.000011476224],"genre_scores_gemma":[0.5349962,0.0000068334807,0.46472558,0.00021087292,0.000049779846,0.000004579208,4.1763155e-7,0.000004692448,0.0000010011771],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99818504,0.000072879964,0.00031610046,0.00066452124,0.00031116538,0.00045030337],"domain_scores_gemma":[0.9992066,0.00023737598,0.000112384376,0.00031150345,0.00008982506,0.00004232894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082654494,0.0001771557,0.00016182195,0.00055253267,0.00024406561,0.0007800282,0.0005231696,0.000050903313,0.0000011728416],"category_scores_gemma":[0.00008582742,0.00017003092,0.00002537468,0.0017313983,0.00025045234,0.0017987983,0.0002808556,0.00022715908,0.0000015719489],"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.000003312138,0.000047726466,0.006945831,0.000034845485,0.0000012425927,0.0000663973,0.001897109,0.014053191,0.61550444,0.000030218222,0.0000062702625,0.36140943],"study_design_scores_gemma":[0.00018174891,0.000040794166,0.005260717,0.00006881447,0.000001052807,0.000079124446,0.0000020157192,0.25472257,0.73087704,0.008572495,0.0000033317951,0.00019029064],"about_ca_topic_score_codex":0.0007857611,"about_ca_topic_score_gemma":0.00009724252,"teacher_disagreement_score":0.36121914,"about_ca_system_score_codex":0.00015235924,"about_ca_system_score_gemma":0.00008381017,"threshold_uncertainty_score":0.75218296},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001137434,0.00054184475,0.963578,0.0030747303,0.00082363724,0.001111633,0.0000057604766,0.0005577854,0.029169183],"genre_scores_gemma":[0.6802726,0.00054903986,0.30701938,0.008849638,0.0013699861,0.000081471306,0.000052936237,0.00023290343,0.0015720654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495023,0.00030911932,0.00063957396,0.001455235,0.0012856781,0.0013601418],"domain_scores_gemma":[0.99437106,0.0014002126,0.0004030498,0.0031742933,0.0005267575,0.00012461035],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018288681,0.0008153699,0.0006224768,0.00096306263,0.0014023212,0.0026220626,0.015539165,0.00037249897,0.0000344142],"category_scores_gemma":[0.00015422555,0.0006433447,0.000115097275,0.0019520335,0.001017989,0.0024260466,0.0037435258,0.0023025747,0.000029417593],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026503252,0.00012011554,0.000253522,0.0001220754,0.00007827685,0.000072837196,0.022575714,0.019528788,0.00003708296,0.11371811,0.00007803472,0.8433889],"study_design_scores_gemma":[0.0005858616,0.00087300694,0.0007037329,0.0016769924,0.00004618047,0.00044446174,0.000012031504,0.71376896,0.0009852955,0.25801456,0.020309286,0.0025796217],"about_ca_topic_score_codex":0.0004575058,"about_ca_topic_score_gemma":0.0020152163,"teacher_disagreement_score":0.84080935,"about_ca_system_score_codex":0.00073362706,"about_ca_system_score_gemma":0.0034125822,"threshold_uncertainty_score":0.99999917},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045103434,0.0022049397,0.033504404,0.000723142,0.008878735,0.0012223064,0.0014785689,0.00038810787,0.90649635],"genre_scores_gemma":[0.94696176,0.000026369666,0.004130869,0.0006597405,0.0044420576,0.000008873406,0.0004553429,0.00006780606,0.043247186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966351,0.00004373335,0.00074370287,0.001050103,0.0009093276,0.0006180729],"domain_scores_gemma":[0.9982676,0.00052983325,0.00020420096,0.00064698386,0.00026218046,0.000089201654],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00070167886,0.00046752288,0.0005557314,0.0004890633,0.0005398212,0.0053956877,0.0011115868,0.00017739451,0.00009535973],"category_scores_gemma":[0.00008699679,0.00037802948,0.00012983583,0.00010343705,0.0013201698,0.0021833808,0.0005278294,0.00088759966,0.000023989163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028337262,0.00018902154,0.00018959741,0.00013445213,0.00010037825,0.0012623115,0.09172825,0.009006734,0.00012749099,0.83327967,0.0018958985,0.061802827],"study_design_scores_gemma":[0.0028076423,0.00062739174,0.00053333474,0.002952624,0.000083633124,0.00004543807,0.00020496864,0.009968313,0.0015441559,0.45394102,0.52364874,0.0036427341],"about_ca_topic_score_codex":0.0028874774,"about_ca_topic_score_gemma":0.016557151,"teacher_disagreement_score":0.9018583,"about_ca_system_score_codex":0.0003011084,"about_ca_system_score_gemma":0.0001791024,"threshold_uncertainty_score":0.99986714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009683151,0.00027809184,0.96145886,0.00043905145,0.0017062864,0.00054104294,3.9979162e-7,0.00018318836,0.035383377],"genre_scores_gemma":[0.060940832,0.000060699113,0.9323333,0.0011182005,0.00059534784,0.000018059192,0.000012785867,0.000045593806,0.004875184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963677,0.000042717016,0.00048552678,0.0015339395,0.0007864516,0.0007836559],"domain_scores_gemma":[0.99766856,0.0005879649,0.00032750305,0.0008344903,0.00036572263,0.00021573158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017550618,0.00044886797,0.000437921,0.0006812717,0.00049455627,0.0008143941,0.0026033279,0.0002838498,0.000030829462],"category_scores_gemma":[0.00032551883,0.00043088218,0.00012225183,0.0007640749,0.00029720078,0.0006285405,0.0007398395,0.0011824161,0.000047591966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015800042,0.000039395272,0.0000660011,0.000079335114,0.000013521707,0.000012710021,0.001925567,0.14536466,0.00004860819,0.065575264,0.00007699071,0.78678215],"study_design_scores_gemma":[0.0003829692,0.00046303854,0.00004921381,0.0002628739,0.000010391085,0.00006287152,0.000004817263,0.9001964,0.0003809452,0.046071842,0.05111874,0.0009959026],"about_ca_topic_score_codex":0.0000133403455,"about_ca_topic_score_gemma":0.000011759412,"teacher_disagreement_score":0.7857862,"about_ca_system_score_codex":0.00036966868,"about_ca_system_score_gemma":0.0006188637,"threshold_uncertainty_score":0.9998143},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003415466,0.000049053488,0.9956615,0.00026092876,0.00015762793,0.00021833242,0.00000557301,0.00018133217,0.000050165632],"genre_scores_gemma":[0.5194529,8.729646e-7,0.48029295,0.00021927628,0.000023812729,0.000005632222,5.262767e-7,0.0000037623593,2.7077905e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976448,0.00009981687,0.00043772825,0.00083096925,0.0004993759,0.00048731806],"domain_scores_gemma":[0.99817616,0.00047366926,0.00013326979,0.0009291555,0.0002125458,0.00007521039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012237194,0.00020428195,0.00029741964,0.00023525528,0.000100127065,0.00013392117,0.0016110493,0.00007072682,0.0000024539097],"category_scores_gemma":[0.00034662784,0.00017814353,0.00005915375,0.0015931018,0.0006864777,0.0006444034,0.00040996852,0.0002603563,0.000002421469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024645795,0.00026187717,0.004072644,0.000062047715,0.0000018657398,0.000016614566,0.00015626189,0.4442832,0.00946974,0.014167263,0.000012731591,0.5274711],"study_design_scores_gemma":[0.0001404211,0.000095610325,0.0008523673,0.000049031987,0.0000011044687,0.0000033280928,3.7718088e-8,0.7066274,0.122767195,0.16931246,0.0000075033936,0.00014350106],"about_ca_topic_score_codex":0.00005995454,"about_ca_topic_score_gemma":0.000018019531,"teacher_disagreement_score":0.5273276,"about_ca_system_score_codex":0.00011546712,"about_ca_system_score_gemma":0.00034670814,"threshold_uncertainty_score":0.72644824},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034810408,0.0006176091,0.9953819,0.00033723176,0.00066539604,0.0005269673,0.000043072516,0.0022886745,0.00010434142],"genre_scores_gemma":[0.13085504,0.000012347008,0.86798793,0.0008488823,0.00015739126,0.000020747637,0.00006214508,0.00003551037,0.00001998185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966542,0.00004412883,0.00049864914,0.0015378853,0.00059191993,0.0006732005],"domain_scores_gemma":[0.99422085,0.0030812162,0.00037564326,0.0018124961,0.00032192573,0.0001878763],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022707665,0.00051504275,0.0004761693,0.00051456736,0.00037706655,0.0007448095,0.002992476,0.0001974631,0.0000015971904],"category_scores_gemma":[0.001503831,0.00045763998,0.000049624097,0.00048622926,0.00052489934,0.00097382604,0.0015757609,0.0006430937,0.0000030252004],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032687572,0.000015053223,0.0006385924,0.000045906057,0.0000035474213,0.000010046289,0.00022294742,0.0022291758,0.000067927154,0.0007343821,0.000032249154,0.9959969],"study_design_scores_gemma":[0.00016608775,0.00016300216,0.00008782559,0.0006041823,0.000008819519,0.000045766763,1.579045e-8,0.82708466,0.00038114097,0.17086467,0.0001449801,0.0004488625],"about_ca_topic_score_codex":0.00011574014,"about_ca_topic_score_gemma":0.00005676622,"teacher_disagreement_score":0.99554807,"about_ca_system_score_codex":0.00015874128,"about_ca_system_score_gemma":0.00040047994,"threshold_uncertainty_score":0.9997875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031321368,0.000050533166,0.9941137,0.0006321524,0.0012687299,0.0004478061,0.0000010905968,0.0003294633,0.000024421583],"genre_scores_gemma":[0.42282733,0.000017028173,0.5755753,0.0013823515,0.00016572907,0.000017977942,0.000005054833,0.000008863314,3.4575672e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697655,0.0001982507,0.00056877197,0.0009779808,0.0007192671,0.00055917824],"domain_scores_gemma":[0.9967246,0.0016366999,0.00023625084,0.0006454334,0.00057538913,0.00018164686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057717278,0.00022352181,0.00027407127,0.0010347876,0.0002526149,0.00035312193,0.002004249,0.00016214659,0.000008386851],"category_scores_gemma":[0.0010703172,0.0002073324,0.00008194413,0.002828125,0.0003770459,0.0009654164,0.0005912455,0.00025321127,0.0000032307682],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014299302,0.00010010626,0.00022359825,0.00001575401,0.0000048437555,0.00000679431,0.0013156425,0.00008569749,0.0018434934,0.086775854,0.000024620174,0.9095893],"study_design_scores_gemma":[0.00028891844,0.00021555611,0.00328311,0.000044957007,0.0000022804754,0.000030252673,0.0000012878685,0.90006393,0.047088306,0.048415612,0.00033538905,0.00023038445],"about_ca_topic_score_codex":0.000027146922,"about_ca_topic_score_gemma":0.00005143738,"teacher_disagreement_score":0.9093589,"about_ca_system_score_codex":0.00014456526,"about_ca_system_score_gemma":0.00028542188,"threshold_uncertainty_score":0.845477},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017147277,0.0003966211,0.99070036,0.00048914086,0.0040431693,0.00043878498,0.0000010397549,0.00022385901,0.0019923071],"genre_scores_gemma":[0.15623488,0.00020455393,0.8391141,0.0019612627,0.0020152056,0.000006343157,0.0000037292773,0.0000743911,0.00038549243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956837,0.00005439793,0.0006815096,0.0015634565,0.0012131229,0.0008037742],"domain_scores_gemma":[0.9971983,0.00038876975,0.00050871086,0.0013663092,0.00032443213,0.00021347642],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000984369,0.0005795948,0.00053910405,0.0008609379,0.00063394674,0.0012000953,0.0028382845,0.0005351415,0.00012265213],"category_scores_gemma":[0.00008501086,0.0005490301,0.00015360524,0.0007869349,0.0004533288,0.0015137133,0.002245736,0.001442643,0.0001727565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000358789,0.000024434452,0.000014455713,0.000039830207,0.000007744705,0.000057270172,0.0004616687,0.0900655,0.0007874832,0.0036439837,0.000049916143,0.9048441],"study_design_scores_gemma":[0.00015048131,0.00010783496,0.000016068127,0.0006277413,0.0000081882945,0.00019310805,1.6055083e-7,0.95822746,0.0013545529,0.03242785,0.006241417,0.0006451188],"about_ca_topic_score_codex":0.00006577168,"about_ca_topic_score_gemma":0.000063763866,"teacher_disagreement_score":0.904199,"about_ca_system_score_codex":0.0004275456,"about_ca_system_score_gemma":0.00038437985,"threshold_uncertainty_score":0.99983674},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012269177,0.000053891352,0.9932496,0.0005718725,0.0004718661,0.00040152264,8.2856883e-7,0.00006517885,0.005172972],"genre_scores_gemma":[0.6627947,0.00006120461,0.31254172,0.00091644784,0.0014950901,0.00003962478,0.000021639951,0.000113666334,0.02201591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99225897,0.00008657784,0.0007205807,0.0015695652,0.0047005326,0.000663777],"domain_scores_gemma":[0.9956976,0.0016295312,0.0004653451,0.0011997967,0.0007927124,0.00021501064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003527156,0.00042443935,0.0005493574,0.0014340951,0.0004400422,0.00085039175,0.0021769954,0.00021683142,0.0002632183],"category_scores_gemma":[0.0011987496,0.0002913814,0.00008569844,0.0009793263,0.0010099929,0.00077640975,0.00071084726,0.0011332699,0.00026691507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012920384,0.0000024716273,0.000025734398,0.0000034130294,0.0000024670373,0.00002013568,0.00024522407,0.5817076,0.000009550692,0.00047237225,0.000013081928,0.41748506],"study_design_scores_gemma":[0.00027759158,0.0005022202,0.000024111598,0.00017758945,0.000003459296,0.000023445993,0.0000014282897,0.85762954,0.0004938569,0.12905262,0.011382062,0.0004320537],"about_ca_topic_score_codex":0.000010431379,"about_ca_topic_score_gemma":0.00010801865,"teacher_disagreement_score":0.6807079,"about_ca_system_score_codex":0.0003236222,"about_ca_system_score_gemma":0.00045902046,"threshold_uncertainty_score":0.9999538},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057880556,0.00067424355,0.99716717,0.000054131735,0.0006346914,0.00040391352,0.000004191538,0.0001954851,0.00080829125],"genre_scores_gemma":[0.8279565,0.00003704458,0.17089799,0.00020628441,0.0005449329,0.000026712101,0.000010791004,0.000088471585,0.00023128436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984874,0.000009858211,0.00037800104,0.00045690237,0.0002204965,0.0004473356],"domain_scores_gemma":[0.998855,0.00019819086,0.00007687505,0.0006694082,0.00010700068,0.00009351432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032120012,0.00034205348,0.00035102482,0.00026697392,0.00013766917,0.0001652681,0.0008794025,0.0002801711,0.000019075756],"category_scores_gemma":[0.0000033364163,0.00031033112,0.000099500285,0.00011145928,0.00020385183,0.00011716374,0.00020691202,0.00046225786,0.00002370051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003564519,0.0000038273965,0.000002661777,0.000044353805,0.000016438396,0.000001799523,0.0003052141,0.90698075,0.00016288896,0.00043718706,0.0000027470096,0.09203855],"study_design_scores_gemma":[0.00017293314,0.000041645137,0.000004340496,0.0003170853,0.000011825509,0.000018820618,3.423899e-7,0.9668498,0.0005989075,0.02998782,0.0015671283,0.0004293687],"about_ca_topic_score_codex":0.00000767337,"about_ca_topic_score_gemma":0.000033671207,"teacher_disagreement_score":0.8278986,"about_ca_system_score_codex":0.0001511981,"about_ca_system_score_gemma":0.000048366823,"threshold_uncertainty_score":0.99993485},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010716419,0.0007340819,0.9853732,0.00068152783,0.00050641876,0.0002539025,0.000011359,0.0006848321,0.011647508],"genre_scores_gemma":[0.69508,0.000832158,0.30122244,0.0011777483,0.00053032115,0.0000307694,0.00019810567,0.00019206708,0.0007364059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814826,0.000017988734,0.00041400516,0.0004800958,0.0005573336,0.0003823333],"domain_scores_gemma":[0.9984748,0.00017093777,0.000110605266,0.0009877848,0.00013930097,0.00011661877],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007381297,0.00032998805,0.00029384717,0.00058733963,0.00011677023,0.00020762316,0.0012974152,0.0004154897,0.000060764232],"category_scores_gemma":[0.000058900434,0.0002724825,0.00006429134,0.00033664194,0.00029258127,0.00039570348,0.0003249447,0.00086747983,0.000027289412],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016031302,0.000010363209,0.000036876307,0.00004565063,0.000007097855,0.000003890558,0.0005526283,0.0040838714,0.00073623116,0.0033516777,0.000498594,0.9906715],"study_design_scores_gemma":[0.00026360547,0.00009328279,0.00008039453,0.0007514355,0.000009543284,0.000025491432,5.932175e-7,0.72164524,0.0151269995,0.07499565,0.18554983,0.0014579209],"about_ca_topic_score_codex":0.0000079485335,"about_ca_topic_score_gemma":0.00012327851,"teacher_disagreement_score":0.9892136,"about_ca_system_score_codex":0.00052130426,"about_ca_system_score_gemma":0.0000894152,"threshold_uncertainty_score":0.99997276},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72790664,0.03501769,0.19232032,0.0046958625,0.018749392,0.01111546,0.00063433335,0.0018088667,0.0077514322],"genre_scores_gemma":[0.9853295,0.00028876038,0.013172587,0.00064895937,0.0003815662,0.000015091147,0.000057829184,0.00005909684,0.000046586403],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9962223,0.00003292053,0.00058695895,0.0011552341,0.0010105496,0.0009919936],"domain_scores_gemma":[0.9979458,0.00017861895,0.00037807194,0.0009187609,0.00021133233,0.00036745655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000597812,0.0004904796,0.0008172486,0.005276774,0.0001261966,0.000070702314,0.0008344706,0.0003447462,0.000022140126],"category_scores_gemma":[0.00039387183,0.0004735702,0.00011051335,0.002278691,0.0005247371,0.00023897219,0.0007788909,0.0010568221,0.00007992112],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038871767,0.0001343902,0.367916,0.00017458531,0.000025365665,0.0001292689,0.00054950744,0.0001057294,0.00005325746,0.000060968072,0.000008890255,0.63080317],"study_design_scores_gemma":[0.0049859514,0.0017998707,0.971007,0.008982132,0.000059785085,0.00017296254,0.000010086095,0.0019922857,0.001834835,0.0031301584,0.0039881943,0.0020367312],"about_ca_topic_score_codex":0.000083321276,"about_ca_topic_score_gemma":0.000014930344,"teacher_disagreement_score":0.6287664,"about_ca_system_score_codex":0.0015086526,"about_ca_system_score_gemma":0.00061743864,"threshold_uncertainty_score":0.9997716},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25682834,0.00010054635,0.7426056,0.00012087647,0.00009928938,0.000190731,5.067916e-7,0.000037386868,0.000016695687],"genre_scores_gemma":[0.4950554,0.0000023145308,0.504854,0.00006048542,0.000022906092,6.400266e-7,5.427539e-7,0.0000034605237,1.8335865e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988405,0.000036013258,0.0003186236,0.00030597823,0.0002505742,0.00024827747],"domain_scores_gemma":[0.9986945,0.00068651955,0.00012885558,0.0002460556,0.00016522163,0.000078878766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001036835,0.00009773365,0.00024276851,0.00013708812,0.00009831657,0.000013257862,0.00014651242,0.000049775514,0.000005331678],"category_scores_gemma":[0.00014022722,0.00008292055,0.000036301637,0.0011213467,0.0004166649,0.00012937291,0.00006386291,0.0002737247,8.737111e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004176426,0.00015192396,0.0057251034,0.000010885567,0.0000019882461,0.000004056945,0.00048723482,0.12583101,0.6864837,0.0009887769,9.3438337e-7,0.18027262],"study_design_scores_gemma":[0.00014090945,0.00013130202,0.0022298922,0.000041607647,0.0000073484225,0.000023035613,0.0000053378967,0.55086476,0.44424117,0.0022450762,0.000014632873,0.000054923432],"about_ca_topic_score_codex":0.000051751944,"about_ca_topic_score_gemma":0.000021286549,"teacher_disagreement_score":0.42503378,"about_ca_system_score_codex":0.00010918886,"about_ca_system_score_gemma":0.00007967225,"threshold_uncertainty_score":0.3381402},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008050173,0.00010454068,0.9958184,0.00009285203,0.00011674587,0.00060541317,0.00016487144,0.00022041384,0.0020717944],"genre_scores_gemma":[0.022789272,0.000018835994,0.97463375,0.0005052934,0.0015186537,0.00016512381,0.00009328673,0.000071590315,0.00020418267],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770147,0.000009460871,0.00030384774,0.001191711,0.00028588818,0.0005076022],"domain_scores_gemma":[0.99799514,0.0005093028,0.0002408488,0.00095224415,0.0001471546,0.00015530294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029153583,0.0004482752,0.00042511406,0.0001365251,0.00025018858,0.00015216827,0.0011600148,0.00048506985,0.000059088285],"category_scores_gemma":[0.0000432528,0.0004369727,0.00013575505,0.000113622154,0.00036220253,0.00012272094,0.00017870047,0.00085315434,0.0000054902375],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010711825,0.000019029534,0.000021166996,0.000060781455,0.000018043764,0.00001721213,0.00036842778,0.0064747552,0.10471753,0.0029480513,0.000014864717,0.8853294],"study_design_scores_gemma":[0.0002297994,0.00008979226,0.0000070087226,0.0003594428,0.000021903548,0.0000377214,3.092041e-7,0.25956765,0.3579483,0.37826142,0.0028820245,0.000594637],"about_ca_topic_score_codex":0.00008964836,"about_ca_topic_score_gemma":0.00008348927,"teacher_disagreement_score":0.8847348,"about_ca_system_score_codex":0.0007307321,"about_ca_system_score_gemma":0.00021032563,"threshold_uncertainty_score":0.9998082},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020387151,0.00008793999,0.9874043,0.0041492674,0.0005436399,0.00031104955,0.0000035967157,0.00014407838,0.0073357783],"genre_scores_gemma":[0.15121517,0.000019641473,0.82953364,0.015363118,0.0007043457,0.000013453933,0.000007121239,0.000053830365,0.0030896987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956304,0.000028077977,0.0006508278,0.0018466612,0.0011193594,0.0007247011],"domain_scores_gemma":[0.99733675,0.00012336357,0.00021649638,0.0017507455,0.00026769313,0.00030493803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007103335,0.0005658031,0.0006003232,0.0013667248,0.00022080398,0.0008832451,0.0034755114,0.0002967825,0.000057517143],"category_scores_gemma":[0.00005858632,0.00050032785,0.00022798215,0.0008413813,0.00021566165,0.000775394,0.001468642,0.0006014201,0.00014671093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032156013,0.0000213742,0.000036286994,0.000009226574,0.0000106163825,0.0000289935,0.00071436825,0.41042334,0.0000954542,0.009733604,0.00019157586,0.57873195],"study_design_scores_gemma":[0.00012379342,0.0000724223,0.00003122076,0.00015986334,0.000009612746,0.000014477239,5.3264245e-8,0.9377879,0.00028387265,0.05782632,0.003106283,0.0005842154],"about_ca_topic_score_codex":0.00001617474,"about_ca_topic_score_gemma":0.0002466884,"teacher_disagreement_score":0.5781477,"about_ca_system_score_codex":0.00035257338,"about_ca_system_score_gemma":0.00041693714,"threshold_uncertainty_score":0.99974483},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071934966,0.00033743196,0.9889866,0.000728949,0.003464537,0.000977966,0.00001185363,0.00019501628,0.004578257],"genre_scores_gemma":[0.5698069,0.000018786812,0.42863616,0.00094115693,0.00037594902,0.0000135108385,0.0000021808637,0.000050206374,0.00015513635],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935951,0.00019413474,0.0011665113,0.0024377645,0.0016849503,0.0009215425],"domain_scores_gemma":[0.9926835,0.001268461,0.0008344979,0.0042186705,0.00077097595,0.00022389698],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019226186,0.0008601422,0.0010954367,0.0005775406,0.00036179984,0.0002646491,0.0102230795,0.0004637723,0.000054751832],"category_scores_gemma":[0.0003374639,0.00062634447,0.0004478965,0.0014747586,0.0034332583,0.0006016875,0.0071466393,0.0014005977,0.000026306472],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014329552,0.00023292223,0.0013973012,0.0001515397,0.000042950905,0.000038688777,0.0033115789,0.02049169,0.00014456263,0.064470194,0.000028154556,0.9096761],"study_design_scores_gemma":[0.00035896362,0.0002771527,0.0069486313,0.00034477696,0.000016124244,0.000078222474,3.1261993e-7,0.26121536,0.004092541,0.725107,0.00062796654,0.0009329066],"about_ca_topic_score_codex":0.00012363108,"about_ca_topic_score_gemma":0.00011628623,"teacher_disagreement_score":0.9087432,"about_ca_system_score_codex":0.0005348135,"about_ca_system_score_gemma":0.0011923759,"threshold_uncertainty_score":0.99961877},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073202193,0.0036719972,0.99037653,0.00020142908,0.0005742646,0.00042579413,0.0000017120299,0.000118291086,0.0038979687],"genre_scores_gemma":[0.5948467,0.002569917,0.40088603,0.00036369188,0.0004926173,0.000010686931,0.0000142429135,0.00004390135,0.00077222456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971638,0.00003818148,0.0004954954,0.0011887493,0.00068375835,0.0004300601],"domain_scores_gemma":[0.9977164,0.00031001813,0.00043842936,0.0010526562,0.00034430178,0.0001381464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042225048,0.00038340938,0.0005816532,0.0004988328,0.00019264643,0.00026824707,0.0015993064,0.00025082735,0.0000043687814],"category_scores_gemma":[0.00014401803,0.0003260081,0.00011248793,0.0007013021,0.0010134337,0.00047210947,0.0010297509,0.00041163218,0.000010918785],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050519325,0.000048257356,0.0016622121,0.000114729184,0.000016334105,0.00011059808,0.002380102,0.0007351272,0.000071805174,0.019691225,0.00004217877,0.9751224],"study_design_scores_gemma":[0.0011032092,0.0010506407,0.0023246612,0.0030346874,0.000054900276,0.001042053,0.0000014681241,0.7605139,0.0074485643,0.21490583,0.006466635,0.002053436],"about_ca_topic_score_codex":0.000022609238,"about_ca_topic_score_gemma":0.000021024718,"teacher_disagreement_score":0.97306895,"about_ca_system_score_codex":0.00007128733,"about_ca_system_score_gemma":0.00020441439,"threshold_uncertainty_score":0.9999192},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036693216,0.0009906103,0.9931827,0.00027915247,0.00084953464,0.0002664277,0.000005219102,0.000110212844,0.0039492203],"genre_scores_gemma":[0.7735946,0.00006235723,0.2255111,0.00036758426,0.00024117432,0.0000060543075,0.000012792497,0.000025573267,0.00017876049],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724716,0.000030291934,0.0004966299,0.0010420016,0.0007779904,0.0004059015],"domain_scores_gemma":[0.997853,0.00027058634,0.00033585794,0.0011613322,0.0002964606,0.00008280011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045003908,0.00036510208,0.00041524996,0.001043315,0.00015392374,0.00024756006,0.0026678056,0.00034910417,0.000012161902],"category_scores_gemma":[0.000032575357,0.00031993058,0.00014998646,0.0010363854,0.00068928936,0.0003741948,0.0005027451,0.0005824957,0.000009297363],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011798752,0.000114078575,0.00016529197,0.000109769724,0.000028885444,0.00007066971,0.00064919627,0.08909379,0.004607207,0.08003943,0.00017569591,0.8249342],"study_design_scores_gemma":[0.00068594824,0.0004119822,0.0058136247,0.0007435012,0.00002955791,0.000049711027,1.9077775e-7,0.51190764,0.046334766,0.42912835,0.003368802,0.0015259064],"about_ca_topic_score_codex":0.00004771481,"about_ca_topic_score_gemma":0.000029944244,"teacher_disagreement_score":0.8234083,"about_ca_system_score_codex":0.00007823771,"about_ca_system_score_gemma":0.00031912563,"threshold_uncertainty_score":0.99992526},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005692881,0.0005841286,0.9900478,0.00018346304,0.0012056156,0.0003824386,0.000001277169,0.0001433537,0.0073949834],"genre_scores_gemma":[0.92759305,0.0000166894,0.07104223,0.00033354096,0.00029567242,0.00001070171,0.000004426518,0.000031794258,0.0006718715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99652797,0.00004060592,0.0005293589,0.0012215498,0.0010711851,0.0006093583],"domain_scores_gemma":[0.9971735,0.00029282228,0.00049655314,0.0015058367,0.00035442167,0.00017685555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008046037,0.00050827174,0.00073806505,0.00059879525,0.00018667529,0.00034386347,0.003148463,0.00028921344,0.000010725698],"category_scores_gemma":[0.00003961058,0.0003772963,0.000111062676,0.0005841702,0.0014261752,0.0003009277,0.0006982163,0.0005085899,0.000039005114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005647173,0.00001899616,0.00021173438,0.000083599996,0.000017745271,0.00006956135,0.0006676948,0.002103343,0.000023902689,0.7428233,0.000018375618,0.2539561],"study_design_scores_gemma":[0.0006193552,0.0012488608,0.00023945687,0.00019951134,0.00002680231,0.00034408498,6.3960925e-7,0.06231941,0.0032247773,0.9213012,0.009189025,0.0012869153],"about_ca_topic_score_codex":0.00013182106,"about_ca_topic_score_gemma":0.00019007358,"teacher_disagreement_score":0.92753613,"about_ca_system_score_codex":0.00012624201,"about_ca_system_score_gemma":0.00057661295,"threshold_uncertainty_score":0.9998679},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003177097,0.00012201565,0.9979132,0.00023611251,0.00043400304,0.00043821428,0.000008665744,0.000025253255,0.00050481944],"genre_scores_gemma":[0.73740935,0.000087800945,0.2603939,0.0019903376,0.00008758939,0.0000054364423,0.00001422171,0.000010006618,0.0000013671747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793494,0.00007659952,0.00062256586,0.00038937945,0.00070069963,0.00027584445],"domain_scores_gemma":[0.99682134,0.0013540114,0.0004639293,0.001061646,0.00023761013,0.00006145658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018551064,0.00024429616,0.00030994954,0.0005113796,0.00013052269,0.00015951245,0.002048372,0.00014000367,0.000046546727],"category_scores_gemma":[0.000059644986,0.00016810224,0.00008945815,0.0006010014,0.0006412763,0.00056251045,0.00036245392,0.00037992888,0.000002963036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009353764,0.00002224589,0.000012496401,0.000012358811,0.0000082497945,0.000001863341,0.00194254,0.061495524,0.000009185704,0.59136736,0.000008575508,0.34511027],"study_design_scores_gemma":[0.000108124856,0.00023105559,0.00015273174,0.00016890407,0.0000056669633,0.0000030346446,9.374007e-7,0.5588484,0.00039133697,0.4398741,0.000062444306,0.00015328944],"about_ca_topic_score_codex":0.000062261155,"about_ca_topic_score_gemma":0.000040416086,"teacher_disagreement_score":0.7375193,"about_ca_system_score_codex":0.00005010149,"about_ca_system_score_gemma":0.00016326625,"threshold_uncertainty_score":0.68550104},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061823665,0.00037258616,0.9925586,0.0000049153496,0.0004323295,0.00018660103,0.000002099113,0.000058205384,0.00020230642],"genre_scores_gemma":[0.9820284,0.00007355141,0.017713401,0.000050166116,0.00009212747,0.000001915789,0.0000070442634,0.000026058337,0.0000073196525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989517,0.000012287167,0.0003226275,0.00024987818,0.00026077213,0.0002027701],"domain_scores_gemma":[0.99944633,0.00016246631,0.00007237672,0.00022334972,0.000055926655,0.00003956106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025167037,0.00019421586,0.00023306161,0.00040820736,0.000040437404,0.00006268011,0.00014766112,0.00019727756,0.000015916832],"category_scores_gemma":[0.000052045845,0.00019454748,0.000021775762,0.00025533457,0.00016103036,0.00016098579,0.000038957893,0.00020477701,0.0000028825423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.433956e-7,0.000004569947,0.00023974523,0.00011869821,0.000002535044,0.0000013711852,0.00018051396,0.7677571,0.0007219969,0.00016104469,8.579861e-7,0.23081061],"study_design_scores_gemma":[0.00010780625,0.000029777557,0.0005547724,0.00024093581,0.000007371339,0.00001647814,1.4982386e-7,0.99257964,0.0026674955,0.003518284,0.00007559575,0.00020170135],"about_ca_topic_score_codex":0.000012225204,"about_ca_topic_score_gemma":0.00008699694,"teacher_disagreement_score":0.97584605,"about_ca_system_score_codex":0.00016414127,"about_ca_system_score_gemma":0.000032908723,"threshold_uncertainty_score":0.7933416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018289572,0.00019851072,0.99315447,0.0002870208,0.0034007847,0.00031577735,0.000011203873,0.00032772345,0.00047557545],"genre_scores_gemma":[0.32711893,0.000038915143,0.66858906,0.0013432571,0.0022550428,0.000003523429,0.000015487834,0.000071319184,0.00056445727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961444,0.000031456017,0.00060992345,0.0016365357,0.00079346355,0.00078422145],"domain_scores_gemma":[0.997729,0.0002051489,0.00037725654,0.0012949228,0.0001849179,0.00020874685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006598069,0.00064162054,0.00058515085,0.00086119585,0.00027980094,0.0008976924,0.002809557,0.00035383817,0.000021575052],"category_scores_gemma":[0.000087669396,0.00061927876,0.00018011242,0.0006449878,0.00023751445,0.0009795023,0.001078667,0.001008957,0.000011531968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000893533,0.00003685622,0.0000528616,0.00004166519,0.000013373814,0.00009110245,0.00042608773,0.0341011,0.0076647494,0.0010348109,0.0000070494707,0.9565214],"study_design_scores_gemma":[0.00025682664,0.00028850624,0.0002585849,0.0003545226,0.000012442244,0.00017046777,9.298571e-8,0.97161007,0.0046880064,0.020906564,0.0006621393,0.0007917684],"about_ca_topic_score_codex":0.00012983821,"about_ca_topic_score_gemma":0.00012596637,"teacher_disagreement_score":0.95572966,"about_ca_system_score_codex":0.0004261515,"about_ca_system_score_gemma":0.000428501,"threshold_uncertainty_score":0.99962586},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002315552,0.00017897665,0.9966192,0.00038256912,0.0010143106,0.0011297584,0.00021208462,0.00013846916,0.00030148035],"genre_scores_gemma":[0.012828006,0.000040685212,0.9853198,0.0006685383,0.00035497188,0.000077054916,0.00035507997,0.00003761186,0.00031827533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959444,0.000032390584,0.00061621965,0.0018717996,0.00064646313,0.0008887542],"domain_scores_gemma":[0.9974826,0.00033684797,0.00028842813,0.0015496762,0.00017007104,0.00017236121],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008955978,0.000571954,0.0005639429,0.00093099964,0.00018126125,0.0012754966,0.0036218676,0.00021773549,0.000022350887],"category_scores_gemma":[0.00009470434,0.000536057,0.00012294429,0.00062585087,0.00032104185,0.0018930922,0.002385864,0.00062108575,0.0000442036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013037441,0.00011414558,0.000046859746,0.00012919308,0.000018424727,0.00020052402,0.00034853892,0.058548175,0.00013969687,0.012325292,0.00018861517,0.9279275],"study_design_scores_gemma":[0.0007980084,0.00012474964,0.00011163822,0.00038213193,0.0000076141673,0.000011533919,3.0233414e-7,0.98648155,0.00016735874,0.009598281,0.0016592199,0.0006576392],"about_ca_topic_score_codex":0.000409347,"about_ca_topic_score_gemma":0.00087093184,"teacher_disagreement_score":0.92793334,"about_ca_system_score_codex":0.00024297084,"about_ca_system_score_gemma":0.00033831925,"threshold_uncertainty_score":0.9997613},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014167494,0.0002030735,0.9960099,0.0013997093,0.0010262068,0.00045129622,0.000002381764,0.0004153931,0.0003503737],"genre_scores_gemma":[0.23998398,0.000068842935,0.75811404,0.00059601763,0.000182164,0.00001664054,0.00001188711,0.000029896039,0.0009965071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966296,0.0000380509,0.0005700994,0.0014316567,0.00082431675,0.0005062632],"domain_scores_gemma":[0.99727976,0.00026592152,0.00045668858,0.001644547,0.00025050182,0.0001025789],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067611464,0.00040608205,0.0003893128,0.00092878815,0.00026746967,0.0006149736,0.0027072383,0.00033861934,0.000016384929],"category_scores_gemma":[0.00016276068,0.0003769343,0.00010182649,0.00059188856,0.0005157802,0.0006655033,0.001078273,0.0004682446,0.00007286762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027922601,0.00003116419,0.00027594037,0.000034439898,0.000009323596,0.000010035631,0.00029841665,0.02092676,0.0014013848,0.04304122,0.000027005968,0.93394154],"study_design_scores_gemma":[0.00031241597,0.000052243933,0.0013107519,0.0004092167,0.000009090442,0.000025854679,3.0108671e-7,0.9393402,0.00612346,0.051284455,0.0005153555,0.00061668665],"about_ca_topic_score_codex":0.000029619621,"about_ca_topic_score_gemma":0.000051098486,"teacher_disagreement_score":0.9333248,"about_ca_system_score_codex":0.00037220135,"about_ca_system_score_gemma":0.00031384395,"threshold_uncertainty_score":0.9998683},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021132492,0.000008240908,0.9881893,0.00023789667,0.00029680046,0.00050393894,0.00006981831,0.00004293419,0.008537869],"genre_scores_gemma":[0.96432394,9.415494e-7,0.033603333,0.0008228016,0.0007255222,0.000100163736,0.000086336884,0.000036509275,0.00030048224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982183,0.00001321525,0.00026100173,0.0008546813,0.0003189306,0.00033384986],"domain_scores_gemma":[0.9987655,0.00008467799,0.000118117416,0.00066303276,0.0001542563,0.00021436946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021199064,0.00027928507,0.00025116213,0.00016818653,0.00017879908,0.00014584954,0.00079312286,0.00010564593,0.00081194803],"category_scores_gemma":[0.000011901118,0.00025699078,0.00006403392,0.00020841535,0.00017281457,0.00013212471,0.00024088316,0.00036886916,0.00030806672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007471758,0.00012621672,0.00007284737,0.000011085818,0.000008321215,0.0000041205913,0.00054115005,0.000836944,0.00014495467,0.5662056,0.0001532164,0.43188807],"study_design_scores_gemma":[0.00006878267,0.00016468746,0.00011225646,0.00009526834,0.000008899536,0.000002617018,2.8939604e-7,0.0149234235,0.0004919602,0.9801504,0.003647164,0.00033422353],"about_ca_topic_score_codex":0.00008371857,"about_ca_topic_score_gemma":0.000023500153,"teacher_disagreement_score":0.96221066,"about_ca_system_score_codex":0.000074146425,"about_ca_system_score_gemma":0.0003238083,"threshold_uncertainty_score":0.99998826},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009553091,0.00053285225,0.9824981,0.0015359262,0.008809596,0.00037871645,2.7405352e-7,0.00011361936,0.0051755947],"genre_scores_gemma":[0.7387271,0.0004658697,0.23337238,0.01241566,0.012858438,0.000044193108,0.000006085952,0.00018354131,0.0019267481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961279,0.000060181388,0.0005707807,0.0015075727,0.0008173881,0.0009161901],"domain_scores_gemma":[0.99639326,0.0016582138,0.0002570912,0.0014070249,0.00011753304,0.00016686814],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020121275,0.00054390467,0.0005086389,0.00070349564,0.0005859146,0.0010591822,0.003467489,0.00029400436,0.0000012843606],"category_scores_gemma":[0.0001673201,0.0004009024,0.0000941615,0.00063386234,0.00080613117,0.0002795836,0.0017355706,0.0011365506,0.000043010037],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007160293,0.00001281883,0.00025976205,0.000020611184,0.0000051103184,0.000053544332,0.0008422561,0.005200981,0.00001781055,0.016393973,0.00009433963,0.9770916],"study_design_scores_gemma":[0.00067166146,0.00045204203,0.0027626003,0.00093518634,0.0000063890175,0.00012969573,3.1273908e-7,0.76478815,0.0004465204,0.18907514,0.039461292,0.001271005],"about_ca_topic_score_codex":0.00003189561,"about_ca_topic_score_gemma":0.000074633164,"teacher_disagreement_score":0.9758206,"about_ca_system_score_codex":0.00023363154,"about_ca_system_score_gemma":0.00029255426,"threshold_uncertainty_score":0.9999778},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041197836,0.0005907216,0.9917412,0.00038214828,0.00096510735,0.00036452495,0.0000031517566,0.004002237,0.0019097367],"genre_scores_gemma":[0.07771048,0.00007112316,0.9195482,0.0018581821,0.0003681332,0.000015268337,0.0000039997917,0.000043227603,0.00038138725],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99517787,0.000035573852,0.0007051977,0.0019291571,0.001293438,0.00085875846],"domain_scores_gemma":[0.99476147,0.0021144198,0.0003787969,0.002005952,0.0005026248,0.00023673738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011611744,0.000677921,0.00067934167,0.0007493699,0.0003678025,0.0010338308,0.004748776,0.00039554958,0.00001224004],"category_scores_gemma":[0.0014941394,0.0006103259,0.00012412391,0.00097524363,0.00047282455,0.0006705331,0.0012053628,0.0007438942,0.000048488586],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007364449,0.000061163126,0.0001066383,0.000059145863,0.0000033552985,0.00016822793,0.00017990693,0.0017727074,0.0000070020965,0.0010523278,0.00025312952,0.996329],"study_design_scores_gemma":[0.00016612063,0.00069883687,0.00019404682,0.0015773007,0.0000100424795,0.0001777898,1.5432763e-8,0.2130864,0.00038362996,0.78061604,0.0022291353,0.0008606567],"about_ca_topic_score_codex":0.000024024615,"about_ca_topic_score_gemma":0.00005550406,"teacher_disagreement_score":0.9954684,"about_ca_system_score_codex":0.00024773396,"about_ca_system_score_gemma":0.0013758283,"threshold_uncertainty_score":0.9996348},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023350429,0.0010162279,0.96684736,0.00009312443,0.0011176318,0.00041764043,0.000018289855,0.00005100782,0.007088262],"genre_scores_gemma":[0.9899598,0.000012574597,0.008586247,0.00023489256,0.00030335938,0.000022404265,0.000015431271,0.000030011746,0.00083527796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978319,0.000113889735,0.00040316404,0.0008822117,0.00025728162,0.000511586],"domain_scores_gemma":[0.9983136,0.0004889743,0.0002852945,0.00044046534,0.00037225438,0.00009939593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007939837,0.0003164426,0.0005430793,0.00028403458,0.0001291784,0.000048484693,0.00081077975,0.00034848138,0.00035267032],"category_scores_gemma":[0.00010926865,0.0002657553,0.00012193765,0.00010364767,0.0007037215,0.00021690679,0.00021670126,0.00072142936,0.000019401317],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104731116,0.00012460734,0.0013631398,0.000073773976,0.000040976007,0.000003977939,0.012446505,0.004050665,0.00015753429,0.034557983,0.0000032884482,0.9470728],"study_design_scores_gemma":[0.0039910884,0.010524649,0.0125496825,0.0017697066,0.0002827219,0.00015020938,0.00018783765,0.47959155,0.0023223418,0.4757672,0.00874911,0.0041139047],"about_ca_topic_score_codex":0.00004858684,"about_ca_topic_score_gemma":0.00009159239,"teacher_disagreement_score":0.96660936,"about_ca_system_score_codex":0.000072613904,"about_ca_system_score_gemma":0.000106286294,"threshold_uncertainty_score":0.99997944},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015740382,0.00085000484,0.99339104,0.0005917217,0.0012941221,0.00044561992,0.000006274263,0.00007294911,0.0017742375],"genre_scores_gemma":[0.86278087,0.000061042396,0.13564278,0.0012467969,0.00021236918,0.000006223838,0.0000029737266,0.000024043113,0.000022926459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552506,0.00020786237,0.0008993308,0.0013029757,0.0012739773,0.0007907776],"domain_scores_gemma":[0.9926666,0.004692151,0.0004790522,0.0017641799,0.0003118321,0.00008618996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007063047,0.00049882336,0.00082759926,0.0008940599,0.00016909614,0.00031601635,0.00464323,0.0003174839,0.000007090059],"category_scores_gemma":[0.00061447936,0.00038422464,0.00019355956,0.0014571352,0.0005859415,0.00050058134,0.0006253361,0.0010564124,0.000011390328],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014007252,0.00005537915,0.0159403,0.00006190475,0.000009134424,0.000100142795,0.0048185205,0.0059871133,0.00012221032,0.008116455,0.000009031004,0.9647658],"study_design_scores_gemma":[0.0031915135,0.00088849384,0.2074256,0.0021564327,0.000017541017,0.000514606,0.000017093507,0.58489805,0.008427382,0.1819781,0.00682518,0.0036600074],"about_ca_topic_score_codex":0.00026003656,"about_ca_topic_score_gemma":0.0074739186,"teacher_disagreement_score":0.9611058,"about_ca_system_score_codex":0.00016323371,"about_ca_system_score_gemma":0.00036196082,"threshold_uncertainty_score":0.99986094},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10228222,0.0017859115,0.86501306,0.0073268213,0.0054229787,0.004798979,0.00005791297,0.00015130897,0.013160823],"genre_scores_gemma":[0.97776556,0.00015842063,0.01853372,0.0010285736,0.0011025888,0.000068254485,0.0000071250056,0.000031341926,0.0013044174],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978241,0.00007763115,0.0004435008,0.0006704326,0.0004955636,0.00048880884],"domain_scores_gemma":[0.9988257,0.0004593765,0.00019021695,0.0003135928,0.000097178505,0.00011388818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027649954,0.00024985257,0.0003323307,0.00025182293,0.0006443562,0.00023812053,0.0008457247,0.00020013159,0.000017517556],"category_scores_gemma":[0.0007529269,0.00018727251,0.000049677754,0.00024857157,0.00065732497,0.00019534885,0.00039740003,0.00024905818,0.00000920208],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001266679,0.00006186347,0.035176907,0.00021454791,0.000024077606,0.00004042464,0.053559143,0.003392273,0.00073779444,0.018502086,0.00027490946,0.8878893],"study_design_scores_gemma":[0.0038105892,0.0026525913,0.1518713,0.019982329,0.0002427799,0.0002291969,0.0011155398,0.09469326,0.003551166,0.2561764,0.4545677,0.011107155],"about_ca_topic_score_codex":0.0026059672,"about_ca_topic_score_gemma":0.0041571707,"teacher_disagreement_score":0.8767821,"about_ca_system_score_codex":0.00022923497,"about_ca_system_score_gemma":0.0002008623,"threshold_uncertainty_score":0.76367515},"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":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035925154,0.00033685114,0.97417754,0.0026392154,0.0025090796,0.0012712484,0.0007927013,0.00004208029,0.018227695],"genre_scores_gemma":[0.010146649,0.000063582454,0.95799196,0.009153862,0.0013884671,0.00003753314,0.0007690584,0.00006863129,0.020380262],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912403,0.00016353975,0.0013912134,0.0028762545,0.003762404,0.0005662731],"domain_scores_gemma":[0.9859997,0.0055693127,0.0007937733,0.0063679884,0.0010071163,0.00026212673],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["metaresearch","open_science"],"category_scores_codex":[0.041879978,0.0004068017,0.00092416134,0.0011564812,0.00029311536,0.0032071252,0.028361501,0.00028551288,0.00013248215],"category_scores_gemma":[0.01394007,0.00031031988,0.00010483585,0.0013691812,0.00077680603,0.0022784679,0.023964936,0.00048670886,0.00020246778],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002608148,0.00003377781,0.000014528239,0.000018800574,0.00001228765,0.000007485213,0.00018278926,0.0014377098,0.0000018479807,0.057943087,0.014264075,0.9260575],"study_design_scores_gemma":[0.0002982383,0.00007327861,0.00003513769,0.00004023535,0.000008877632,0.0000019073586,0.0000011457291,0.03994881,0.000006244927,0.53899777,0.42027405,0.00031428598],"about_ca_topic_score_codex":0.00015327914,"about_ca_topic_score_gemma":0.0009203215,"teacher_disagreement_score":0.9257432,"about_ca_system_score_codex":0.00023301234,"about_ca_system_score_gemma":0.000958945,"threshold_uncertainty_score":0.9999349},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010888801,0.000057697,0.9901326,0.00080870965,0.0035939892,0.0024505008,0.00007027939,0.00033234656,0.0014650391],"genre_scores_gemma":[0.6513196,0.000011550936,0.34346938,0.0023402409,0.0012980357,0.00021820211,0.000035612335,0.000141699,0.0011656611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945631,0.00009551651,0.0006902445,0.0026190856,0.0010806463,0.00095141743],"domain_scores_gemma":[0.9936447,0.0024263854,0.0007524093,0.0020401867,0.0007910663,0.0003452447],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021581226,0.0008124204,0.0010626086,0.0009805657,0.0006193581,0.0024020341,0.0058552506,0.0007595515,0.000057849775],"category_scores_gemma":[0.00038026116,0.00081531215,0.00028943454,0.000665027,0.0005779139,0.0025839212,0.003190102,0.0014650464,0.00018809862],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003495161,0.0000750789,0.000030712483,0.00006469948,0.00002307936,0.000016725064,0.00037378675,0.00067350356,0.0011529858,0.00019880828,0.000020685635,0.99733496],"study_design_scores_gemma":[0.00232514,0.0007235757,0.00023954334,0.0011349195,0.00005003077,0.00024495577,4.7448745e-7,0.79898816,0.013563501,0.13583985,0.043949407,0.0029404282],"about_ca_topic_score_codex":0.00013969583,"about_ca_topic_score_gemma":0.0006310834,"teacher_disagreement_score":0.99439454,"about_ca_system_score_codex":0.00042600426,"about_ca_system_score_gemma":0.0010456286,"threshold_uncertainty_score":0.9995235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015128494,0.000121356155,0.9963591,0.0003975612,0.00038544514,0.00041441235,0.000008565918,0.00006760173,0.0007331187],"genre_scores_gemma":[0.8696683,0.0000125555225,0.12645395,0.0026421135,0.000667452,0.000021604543,0.000020498312,0.00005499178,0.00045851184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974693,0.000002749782,0.00041882184,0.0009695673,0.0005322998,0.00060726143],"domain_scores_gemma":[0.9986251,0.00014465199,0.00035977078,0.00044641717,0.00039900612,0.000025036292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010219371,0.00045212545,0.00057026284,0.0014623919,0.00021530347,0.00041676525,0.000895172,0.00031131651,0.000007960738],"category_scores_gemma":[0.00014752563,0.00041975774,0.00014698533,0.0005938768,0.00022188664,0.0009875747,0.0003818955,0.0005155259,0.00001654783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040059575,0.00011436672,0.00034021176,0.00018050444,0.000013981072,0.000015022363,0.00006583571,0.4404849,0.000088140456,0.00068780844,0.0000062305417,0.55796295],"study_design_scores_gemma":[0.0006792475,0.000005106924,0.00045391746,0.000347617,0.00003288116,9.903187e-7,1.3523744e-7,0.97058755,0.0000343405,0.02715612,0.00023970629,0.0004623812],"about_ca_topic_score_codex":0.00033711962,"about_ca_topic_score_gemma":0.0027376038,"teacher_disagreement_score":0.8699051,"about_ca_system_score_codex":0.00016667257,"about_ca_system_score_gemma":0.00015640202,"threshold_uncertainty_score":0.9998254},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018787144,0.0003385398,0.9586626,0.0029324223,0.0018065295,0.00045276224,0.000014534035,0.00009736762,0.03550737],"genre_scores_gemma":[0.96874803,0.00007798908,0.027544826,0.0017395408,0.0009356511,0.00001580607,0.0000023218554,0.000026265652,0.0009095433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710685,0.0000420927,0.00031219676,0.00073545513,0.0011345559,0.00066887186],"domain_scores_gemma":[0.99776113,0.00087139005,0.00022358663,0.0006637237,0.0003073587,0.00017281741],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0014371232,0.0003126485,0.00030262693,0.00018369043,0.0019419129,0.0006017386,0.0023373899,0.0004596345,0.000036517977],"category_scores_gemma":[0.00031970735,0.0002222792,0.0001242305,0.000218484,0.0034691922,0.00028779646,0.00027187535,0.0012710881,0.000023056447],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022288377,0.000027381342,0.00009282634,0.000011915167,0.000007955605,0.000017459646,0.0036803042,0.020224402,0.000032731976,0.12771517,0.000019512201,0.84814805],"study_design_scores_gemma":[0.00024810355,0.00001789311,0.000045757803,0.00007481167,0.0000073145156,6.7704053e-7,8.31727e-7,0.5247791,0.00010841637,0.45642766,0.017932467,0.00035700446],"about_ca_topic_score_codex":0.0002977475,"about_ca_topic_score_gemma":0.013760793,"teacher_disagreement_score":0.96856016,"about_ca_system_score_codex":0.0002148221,"about_ca_system_score_gemma":0.0017411557,"threshold_uncertainty_score":0.9993574},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022706969,0.0010240958,0.9957735,0.00012430438,0.0007992507,0.00046025738,0.00010561826,0.000020460911,0.0014654702],"genre_scores_gemma":[0.00647375,0.000081862694,0.9825939,0.0017313262,0.0048250486,0.000013066512,0.00016250562,0.000089577516,0.0040289517],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981227,0.0000171569,0.00027327126,0.0009060414,0.0002699631,0.00041084905],"domain_scores_gemma":[0.99895763,0.000059259633,0.00015339795,0.0005618692,0.00016963675,0.00009823102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029840998,0.0003717055,0.00031890403,0.00014123488,0.00016066592,0.00008163591,0.0006971571,0.00053385267,0.00013930771],"category_scores_gemma":[0.000052469513,0.0003410574,0.00014080956,0.0000589818,0.00024428658,0.000009726117,0.00025031943,0.00028767087,0.000026830674],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011687457,0.000005233417,2.7361153e-7,0.000015532456,0.000013314016,0.0000036537044,0.000017951385,0.0007591961,0.15582485,0.0000331966,0.00006791457,0.8432472],"study_design_scores_gemma":[0.00049342617,0.0005976065,0.0000030805788,0.0002375593,0.000025225962,0.000065631226,8.46616e-8,0.07405591,0.803727,0.02336278,0.09645743,0.0009743115],"about_ca_topic_score_codex":0.0000017221505,"about_ca_topic_score_gemma":0.0000066739226,"teacher_disagreement_score":0.8422729,"about_ca_system_score_codex":0.0000481386,"about_ca_system_score_gemma":0.00031471468,"threshold_uncertainty_score":0.99990416},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014205148,0.00095243746,0.9957475,0.00011812694,0.0007218563,0.0002505111,0.0000043137384,0.00019371179,0.0005910429],"genre_scores_gemma":[0.67265236,0.000018678487,0.32669446,0.00021242164,0.0003370916,0.0000029045382,0.0000017064791,0.00005029321,0.00003007979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801856,0.00008613542,0.0003578369,0.00052924064,0.00049490586,0.00051331596],"domain_scores_gemma":[0.99792624,0.0012287906,0.00008294909,0.00049071916,0.00013734479,0.00013393727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014260006,0.00036434218,0.00032734318,0.00022212893,0.00026956532,0.00025822004,0.00061387505,0.0003325301,0.00002030929],"category_scores_gemma":[0.00018213356,0.0002883949,0.000041544572,0.0004213003,0.00074500864,0.00017421992,0.0003501996,0.001505108,0.000016527481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037948641,0.000003042885,0.00015051184,0.000020162186,0.000009076029,0.0000061349438,0.0015487362,0.8037772,0.000060806957,0.0021483835,0.0000012668684,0.19227083],"study_design_scores_gemma":[0.00008908401,0.000036088797,0.00023480848,0.00034654266,0.000012639848,0.000034744782,0.000001903338,0.99152225,0.0006008961,0.0067510204,0.000038688344,0.00033132834],"about_ca_topic_score_codex":0.000012384701,"about_ca_topic_score_gemma":0.000006941444,"teacher_disagreement_score":0.67123187,"about_ca_system_score_codex":0.00019763637,"about_ca_system_score_gemma":0.00010137191,"threshold_uncertainty_score":0.99995685},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011643207,0.0008958208,0.9800011,0.012043963,0.0025761828,0.00048041213,0.0000079674455,0.0005390626,0.0033390615],"genre_scores_gemma":[0.10423637,0.0002699216,0.89382565,0.0010766817,0.00044519323,0.000017815037,0.000009236557,0.00004845244,0.00007067224],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99436903,0.000081942606,0.00074391544,0.0020884655,0.0014336157,0.0012830269],"domain_scores_gemma":[0.9853639,0.0012836162,0.0004718308,0.012494886,0.00020014933,0.00018561394],"candidate_categories":["metaresearch","metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012605995,0.00069700036,0.0006658225,0.0015098872,0.00018024746,0.00069331675,0.056649983,0.0006736187,0.000047609323],"category_scores_gemma":[0.01182043,0.0006609952,0.00011382757,0.0011040434,0.00089660636,0.0027729517,0.13298467,0.002117638,0.00013060901],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112530915,0.00012190715,0.00021917323,0.000042914744,0.000018108456,0.00021779937,0.00041641932,0.000385617,0.00018342288,0.02100791,0.000698505,0.97667694],"study_design_scores_gemma":[0.0004899989,0.00013743459,0.00046075537,0.00052929006,0.000017001325,0.00020056633,2.628517e-7,0.2799351,0.001985744,0.70374274,0.011260072,0.0012410597],"about_ca_topic_score_codex":0.00005488133,"about_ca_topic_score_gemma":0.000046720743,"teacher_disagreement_score":0.9754359,"about_ca_system_score_codex":0.0006787697,"about_ca_system_score_gemma":0.0005010177,"threshold_uncertainty_score":0.99958414},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019655062,0.00022770884,0.9961093,0.00016108672,0.0004533937,0.00032809368,0.000011109857,0.0001949625,0.0023177993],"genre_scores_gemma":[0.39153063,0.00010635163,0.6072696,0.00033490657,0.00021280581,0.000022300706,0.00009413494,0.000045524237,0.000383801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698794,0.0000451423,0.00044721854,0.0010041333,0.0012272263,0.00028833034],"domain_scores_gemma":[0.9973699,0.00017071527,0.0004455241,0.0007224053,0.0011752223,0.00011622978],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005391649,0.00034652808,0.00041042312,0.0007334293,0.00013074507,0.00033256534,0.001363601,0.00018281693,0.000007893517],"category_scores_gemma":[0.000057273726,0.0002915491,0.00008351443,0.0011501539,0.0005946576,0.0010253242,0.00053909054,0.0003139125,0.0000030568601],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041405612,0.00023448592,0.00035255373,0.00016104497,0.00007381125,0.0000655166,0.007094638,0.0060310434,0.0027576606,0.19909981,0.002866577,0.78122145],"study_design_scores_gemma":[0.00064027327,0.0007716144,0.00023300319,0.00057289447,0.000017931927,0.00012496283,0.0000017054464,0.7615393,0.043775585,0.18976098,0.001509541,0.0010522179],"about_ca_topic_score_codex":0.000047594935,"about_ca_topic_score_gemma":0.0000377348,"teacher_disagreement_score":0.78016925,"about_ca_system_score_codex":0.00018403163,"about_ca_system_score_gemma":0.00033721275,"threshold_uncertainty_score":0.9999537},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023595423,0.000011401881,0.97236973,0.0015804303,0.0015791281,0.00056668924,0.0000021207923,0.0002892049,0.000005895178],"genre_scores_gemma":[0.36085695,8.7459017e-7,0.63620824,0.0027716004,0.000104967075,0.000046646986,0.0000041177423,0.0000062187432,3.9576227e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976753,0.00005345374,0.0003277396,0.00078246876,0.00068285,0.00047818114],"domain_scores_gemma":[0.9982602,0.000541161,0.00012550721,0.0006650004,0.00023081244,0.00017734138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011752719,0.00019110195,0.00017318595,0.0003602915,0.00024473906,0.00036639496,0.0016323905,0.00011445868,0.000015919042],"category_scores_gemma":[0.0003434021,0.00016763163,0.000047145146,0.001309827,0.00041475217,0.0007698219,0.00030122296,0.00034476578,0.00001029587],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005440696,0.000074524854,0.00030168376,0.000013406221,8.0462974e-7,0.0000045523902,0.00022450533,0.0005569311,0.13978799,0.00013802105,0.000026145426,0.858866],"study_design_scores_gemma":[0.00044588858,0.00016278846,0.00021868211,0.000020168069,0.0000012232273,0.0000060024468,2.8207648e-7,0.6409053,0.34907323,0.009012374,0.000013113729,0.00014093552],"about_ca_topic_score_codex":0.000037506663,"about_ca_topic_score_gemma":0.00008988372,"teacher_disagreement_score":0.8587251,"about_ca_system_score_codex":0.000089359586,"about_ca_system_score_gemma":0.00035973004,"threshold_uncertainty_score":0.68358195},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069042765,0.0003776801,0.92586446,0.0001420094,0.0020658714,0.0016604254,0.000014754262,0.000049327555,0.00078272546],"genre_scores_gemma":[0.98361725,0.00000784214,0.015723197,0.00029607688,0.00020786155,0.000029599842,0.000008876156,0.000043861783,0.00006542564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997379,0.000054479413,0.0006389492,0.0010024917,0.0003639449,0.00056112016],"domain_scores_gemma":[0.9981351,0.00050833775,0.00034446854,0.00079319056,0.00013252035,0.00008639867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078415836,0.00042200604,0.00060892897,0.0005761293,0.00016204872,0.00010717917,0.0011348408,0.00035136213,0.000016809243],"category_scores_gemma":[0.000021478496,0.00034179253,0.00028503928,0.00026525243,0.000480556,0.00012554352,0.00028024765,0.0005012668,0.0000075652083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048434198,0.00013005175,0.0011007836,0.00012913914,0.000037981765,0.00006510669,0.0029527934,0.09496616,0.00037325817,0.009953247,0.000017685765,0.89022535],"study_design_scores_gemma":[0.005071095,0.0025746797,0.033152673,0.005668845,0.00023635596,0.00010852471,0.00004588436,0.9391566,0.00038412574,0.007846486,0.0032366114,0.0025181228],"about_ca_topic_score_codex":0.00008763051,"about_ca_topic_score_gemma":0.00026102475,"teacher_disagreement_score":0.9145745,"about_ca_system_score_codex":0.00028358735,"about_ca_system_score_gemma":0.00013389064,"threshold_uncertainty_score":0.9999034},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015545018,0.001917261,0.98924476,0.00014778817,0.0003361442,0.00095148216,5.903008e-7,0.0002229977,0.0071634585],"genre_scores_gemma":[0.66671216,0.00012821413,0.33175284,0.00044501445,0.0005306333,0.00015200124,0.00000287868,0.000032223797,0.00024404904],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975709,0.000029920247,0.00038703828,0.0010333136,0.00043095,0.00054792786],"domain_scores_gemma":[0.9984198,0.0002001754,0.00022353511,0.0009274865,0.00010473342,0.00012422612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009820636,0.00034837986,0.00037733954,0.0005474893,0.00016603827,0.00035481484,0.0017094287,0.0002491705,0.0000033548115],"category_scores_gemma":[0.000029661676,0.0002929787,0.000051799118,0.0004578572,0.0004755644,0.000600324,0.0009317121,0.00051563437,0.000013588822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010164397,0.000012810913,0.000108005144,0.000031428157,0.0000015221786,0.000005824854,0.00035152448,0.000068727815,0.0000925043,0.280255,8.458818e-7,0.7190708],"study_design_scores_gemma":[0.0002263383,0.0001890824,0.00016695974,0.00016387572,0.0000061714973,0.000115370254,7.630122e-7,0.023059245,0.0024985212,0.94341755,0.029248785,0.0009073162],"about_ca_topic_score_codex":0.0000219746,"about_ca_topic_score_gemma":0.000080873346,"teacher_disagreement_score":0.7181635,"about_ca_system_score_codex":0.00016469453,"about_ca_system_score_gemma":0.0001872639,"threshold_uncertainty_score":0.99995226},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006313667,0.00031634342,0.9973217,0.00045515975,0.00056871155,0.00015504767,0.0000023907673,0.000096799886,0.00045245778],"genre_scores_gemma":[0.5941098,0.00011939671,0.4027539,0.0010382298,0.0017431498,0.0000031021111,0.0000052192886,0.000040074647,0.00018717098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977488,0.000027261854,0.00026225776,0.0009250304,0.0006007007,0.0004359691],"domain_scores_gemma":[0.99832535,0.00060793676,0.00017696488,0.0006792385,0.000086711036,0.00012382164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035967477,0.000338075,0.0003136405,0.00032981913,0.0007043276,0.000689704,0.0013926604,0.00009794523,6.7878483e-7],"category_scores_gemma":[0.000041229025,0.00023984164,0.00008119613,0.00041879434,0.000848961,0.00056876783,0.000679548,0.0005770803,0.000003824245],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017879967,0.0000055558203,0.00009085009,0.000002907501,0.000003344596,0.000009269952,0.00021143092,0.0017901749,0.000053878488,0.0055389907,0.0000023366547,0.9922895],"study_design_scores_gemma":[0.00016101936,0.00018315871,0.0011130002,0.00018899307,0.000009382455,0.00005548518,4.3443544e-7,0.7888681,0.00025853375,0.20615406,0.0025395923,0.00046820912],"about_ca_topic_score_codex":0.000005534851,"about_ca_topic_score_gemma":0.000006248413,"teacher_disagreement_score":0.9918213,"about_ca_system_score_codex":0.000073111085,"about_ca_system_score_gemma":0.000102534126,"threshold_uncertainty_score":0.9780458},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004209296,0.000622614,0.98076296,0.0014491328,0.001366721,0.0002862516,0.0000032320524,0.00028069137,0.015224179],"genre_scores_gemma":[0.00659383,0.000116163654,0.9874455,0.003939301,0.0004236415,0.0000061123637,0.000004098822,0.000045174125,0.0014261858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597484,0.000030058342,0.00048883085,0.0017106363,0.0010498659,0.0007457613],"domain_scores_gemma":[0.9973338,0.00023774839,0.00018923516,0.0018581399,0.00015111142,0.00022993739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053413864,0.0005458463,0.0005304924,0.0008177297,0.00029036487,0.00057121523,0.0037402124,0.0002501025,0.0001433271],"category_scores_gemma":[0.00005232628,0.0004982941,0.00016509523,0.0006478663,0.0005930187,0.0009683431,0.0010051372,0.0008765725,0.00017768286],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004356932,0.000012766922,0.0000062026866,0.000008948134,0.0000033881784,0.00009748147,0.00025584176,0.01257826,0.000041211573,0.0068111774,0.00004829968,0.98013204],"study_design_scores_gemma":[0.0003178723,0.00006501303,0.000040978164,0.00023363023,0.000003458629,0.000071082475,3.6111327e-8,0.752759,0.00039368036,0.22657117,0.018956725,0.0005873678],"about_ca_topic_score_codex":0.0000051304532,"about_ca_topic_score_gemma":0.000010131931,"teacher_disagreement_score":0.9795447,"about_ca_system_score_codex":0.00022130685,"about_ca_system_score_gemma":0.00036893596,"threshold_uncertainty_score":0.99974686},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012958081,0.0006435379,0.97870433,0.00019366319,0.0014329669,0.0011286238,0.0000033388178,0.00012249991,0.004812972],"genre_scores_gemma":[0.6988134,0.00003088012,0.3006459,0.00032140873,0.00010184523,0.000016785276,0.0000011687391,0.000023531065,0.000045082266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994506,0.00005144821,0.00087685755,0.0018361398,0.001899595,0.0008299634],"domain_scores_gemma":[0.99659854,0.00057377823,0.0004472786,0.0018661057,0.00033304264,0.00018123684],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015476821,0.0005581773,0.00081537577,0.003707178,0.00016204276,0.00059959095,0.0057059615,0.00032019397,0.000023121336],"category_scores_gemma":[0.00015530147,0.00045949692,0.00011039941,0.0045893965,0.0006123828,0.00086325634,0.0025087849,0.0008553825,0.000043878536],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054864354,0.00038907063,0.003708558,0.000046814566,0.0000138735,0.0001415304,0.0037728774,0.0343545,0.0000118201215,0.008073358,0.000026272388,0.94945586],"study_design_scores_gemma":[0.00085570564,0.0010708865,0.013211712,0.00031286108,0.000008839898,0.000036263875,0.0000015845102,0.8136265,0.00006856325,0.16977288,0.00017405397,0.0008601059],"about_ca_topic_score_codex":0.00027179127,"about_ca_topic_score_gemma":0.000672912,"teacher_disagreement_score":0.9485957,"about_ca_system_score_codex":0.00028819568,"about_ca_system_score_gemma":0.00042170347,"threshold_uncertainty_score":0.99978566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000065431996,0.00030383997,0.9910065,0.0017315227,0.0036262954,0.0006042571,0.000022701623,0.00025991444,0.0023795248],"genre_scores_gemma":[0.028772589,0.000049679333,0.9676598,0.0012592599,0.001108275,0.000050337017,0.0000147598375,0.000049134764,0.0010361896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996168,0.000023171231,0.00056006265,0.0016632837,0.00084445806,0.00074100716],"domain_scores_gemma":[0.99629605,0.00090789085,0.00031756837,0.0018907096,0.0003825076,0.00020525946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007368932,0.0005667622,0.0005452117,0.0013119739,0.0006668719,0.0006374224,0.004312954,0.0004783809,0.00002688228],"category_scores_gemma":[0.00016625445,0.00051828416,0.0003185805,0.0008967588,0.0011555587,0.0006425605,0.0010550665,0.0011820622,0.000025177203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005511624,0.0000564786,0.000038415936,0.00003500045,0.000021143132,0.000023229311,0.00046140287,0.0036019578,0.00056819763,0.35931465,0.000064557295,0.6358094],"study_design_scores_gemma":[0.00033526617,0.00020431154,0.00011586637,0.00016875724,0.000012540844,0.000047885627,1.0398013e-7,0.2521334,0.0010330655,0.7260822,0.019135168,0.00073143636],"about_ca_topic_score_codex":0.000021961532,"about_ca_topic_score_gemma":0.0005564457,"teacher_disagreement_score":0.635078,"about_ca_system_score_codex":0.000100329955,"about_ca_system_score_gemma":0.0004697436,"threshold_uncertainty_score":0.9997269},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010323445,0.0001409718,0.9848953,0.00061985105,0.0018948606,0.0014789529,0.000011814363,0.00004244003,0.00059238216],"genre_scores_gemma":[0.9466587,0.0000066519756,0.051547043,0.0012302374,0.00011896586,0.00005623684,0.0000031799427,0.000033975943,0.0003450544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957849,0.00013241716,0.00091320294,0.001651166,0.0007970502,0.00072130037],"domain_scores_gemma":[0.99680865,0.000697098,0.0004969292,0.0012858706,0.00055117486,0.00016030279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004503777,0.0006637669,0.00089127384,0.0013773398,0.00017175703,0.00016703842,0.0030514714,0.00020411622,0.0001006398],"category_scores_gemma":[0.00012340458,0.0005907364,0.00021263376,0.00048776384,0.0004130949,0.0016539976,0.0008232964,0.0011920126,0.00010066302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002280805,0.0076845647,0.0025240183,0.00019858303,0.00047381892,0.00076075236,0.08342745,0.4553519,0.024409132,0.0054514227,0.00027446827,0.41921583],"study_design_scores_gemma":[0.0036923192,0.0007972094,0.0086993165,0.0005626356,0.000029520772,0.00005306725,0.000024266565,0.9822078,0.0012009154,0.0011733853,0.00056359003,0.0009959702],"about_ca_topic_score_codex":0.00042258116,"about_ca_topic_score_gemma":0.0024554979,"teacher_disagreement_score":0.9363352,"about_ca_system_score_codex":0.0003704785,"about_ca_system_score_gemma":0.00031809637,"threshold_uncertainty_score":0.9996544},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006939746,0.00092719926,0.9943528,0.0015723286,0.0005285991,0.00043993798,0.00001928921,0.000052989115,0.0020374435],"genre_scores_gemma":[0.006762617,0.00082911225,0.99035686,0.001060545,0.00033523145,0.000037983016,0.000015372934,0.000029271005,0.00057300366],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997786,0.000016747052,0.00037726684,0.0010130092,0.0005135072,0.0002935013],"domain_scores_gemma":[0.9977388,0.00037025154,0.00031702092,0.0011651835,0.00030969546,0.00009907081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003826776,0.00031748443,0.0004338401,0.00038623257,0.00013287498,0.00025498754,0.0018861565,0.00014136457,0.000016014103],"category_scores_gemma":[0.00011402934,0.0002593331,0.000051773422,0.0004762615,0.0006861383,0.0004159727,0.00080443214,0.00033517653,0.000044384808],"study_design_candidate":"design_other","study_design_consensus":null,"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.2069644e-7,0.000019625659,0.000009509188,0.00007222547,0.000005291318,0.000004895216,0.00019464197,0.0002952355,0.000040039035,0.049934052,0.00027575283,0.9491478],"study_design_scores_gemma":[0.0006592646,0.00096706575,0.0011087683,0.007301636,0.00004715529,0.00014865858,0.0000015739342,0.3840822,0.0049989563,0.5454272,0.05289176,0.002365783],"about_ca_topic_score_codex":0.000023854796,"about_ca_topic_score_gemma":0.0000035878527,"teacher_disagreement_score":0.94678205,"about_ca_system_score_codex":0.0000555405,"about_ca_system_score_gemma":0.00022220307,"threshold_uncertainty_score":0.9999859},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004465963,0.00034862637,0.99263775,0.00082565914,0.0019621442,0.0021940556,0.000049210972,0.00038443113,0.001553432],"genre_scores_gemma":[0.8231722,0.000039698094,0.1715037,0.0024903563,0.0010317205,0.0008071872,0.000030348157,0.00008341246,0.0008413728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951815,0.000020558542,0.0008678331,0.002026182,0.0010734386,0.0008304929],"domain_scores_gemma":[0.9952692,0.0013902414,0.00056047994,0.0016710956,0.00079282967,0.000316201],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008587121,0.0006284508,0.00066359964,0.00094319973,0.0005412149,0.0006198511,0.0031170992,0.00041615806,0.000041721112],"category_scores_gemma":[0.0000777805,0.0006415539,0.00027126173,0.00060050515,0.0006653572,0.000933716,0.0007623229,0.00071928947,0.0001340199],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008740228,0.000066907836,0.000058271627,0.00006172442,0.000019820594,0.000020267273,0.0013377432,0.0007766696,0.00013262898,0.014772643,0.000079546546,0.98266506],"study_design_scores_gemma":[0.00278459,0.000965044,0.00058354996,0.001892028,0.000087829816,0.0010103129,0.00003471797,0.41201812,0.012081095,0.23728663,0.32554466,0.0057114316],"about_ca_topic_score_codex":0.00008884947,"about_ca_topic_score_gemma":0.00045657047,"teacher_disagreement_score":0.9769536,"about_ca_system_score_codex":0.0006850838,"about_ca_system_score_gemma":0.00070507126,"threshold_uncertainty_score":0.99960357},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060273573,0.0002267876,0.99784774,0.000044459925,0.00009461774,0.0002972213,0.000008823938,0.00014626386,0.0007313394],"genre_scores_gemma":[0.6379733,0.00023544751,0.36155424,0.00008075442,0.000055018703,0.000024926516,0.000034584282,0.000031483003,0.000010246895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810094,0.000012055205,0.0006078761,0.0006237327,0.00028896393,0.00036646464],"domain_scores_gemma":[0.9992247,0.00025726124,0.00008731819,0.0003129864,0.00006763207,0.00005005869],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000255866,0.00033367448,0.0006244021,0.0023923414,0.000045914407,0.000040162628,0.0004028703,0.00025468026,0.000011361746],"category_scores_gemma":[0.000018937897,0.00034678535,0.00020227287,0.0013693968,0.0001496986,0.00026087655,0.00004334999,0.00053616473,0.0000033766298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007827796,0.000010316933,0.000057627367,0.000025537436,0.000019966568,0.000008455849,0.00039362453,0.9694855,0.00012032792,0.00011737546,9.961776e-7,0.029752405],"study_design_scores_gemma":[0.00013217994,0.000035319492,0.000033871915,0.00017790715,0.00003443302,0.0000021042508,2.350553e-7,0.96066153,0.0006185265,0.037868652,0.00009260442,0.00034261448],"about_ca_topic_score_codex":0.000030710133,"about_ca_topic_score_gemma":0.0005486296,"teacher_disagreement_score":0.6373706,"about_ca_system_score_codex":0.0003199812,"about_ca_system_score_gemma":0.000031374366,"threshold_uncertainty_score":0.99989843},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030232285,0.00024413587,0.98948115,0.005566589,0.0013671322,0.00054165814,0.000010892226,0.00015314051,0.002332986],"genre_scores_gemma":[0.8793476,0.00014720479,0.111572124,0.00793273,0.00061999296,0.000088505985,0.00007864547,0.00004091955,0.00017225243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962373,0.00009733163,0.0006848933,0.00093344436,0.001290343,0.0007566819],"domain_scores_gemma":[0.99716103,0.00066254736,0.00031531026,0.0014977058,0.00020794461,0.00015545171],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012321683,0.00048758654,0.0004222093,0.0006591711,0.00029146904,0.0011305376,0.0043574427,0.0004895064,0.00008581164],"category_scores_gemma":[0.00015281612,0.00034643858,0.00017813628,0.0015305523,0.0008331512,0.0009353965,0.0007591644,0.0014557516,0.0003185347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004153599,0.000054523764,0.00003297637,0.000033891938,0.0000062646413,0.000024070589,0.0044901925,0.00044220587,0.0000062068048,0.80444705,0.000535572,0.1899229],"study_design_scores_gemma":[0.00016120276,0.000109250315,0.0007427401,0.000261205,0.0000046972596,0.000031066324,0.0000013140276,0.54388934,0.000042307674,0.43974495,0.01457366,0.00043828995],"about_ca_topic_score_codex":0.00002052297,"about_ca_topic_score_gemma":0.000027977161,"teacher_disagreement_score":0.8790453,"about_ca_system_score_codex":0.00018261117,"about_ca_system_score_gemma":0.00022634264,"threshold_uncertainty_score":0.99990636},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.390379e-7,0.000104801264,0.99485004,0.00038929537,0.00028782483,0.00094014726,0.000009070678,0.00029361295,0.0031242832],"genre_scores_gemma":[0.024911495,0.000019502177,0.9736412,0.0008471619,0.00021214288,0.00008404237,0.000033644435,0.000017249386,0.00023352413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978412,0.000018450342,0.00045818114,0.0006618106,0.0006133592,0.00040703808],"domain_scores_gemma":[0.99792093,0.00023662596,0.0003031227,0.0011811485,0.00028983568,0.0000683645],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009603865,0.0003237373,0.0002484095,0.00036519807,0.00039624944,0.0011355889,0.0032433167,0.00020670035,0.0000026252922],"category_scores_gemma":[0.0000286295,0.00022784075,0.00010119526,0.0004037049,0.00035484353,0.0017596857,0.00042828047,0.0003970843,0.0000060536777],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004176771,0.000022628215,0.0000034840837,0.00007002929,0.0000046842997,0.0000011678225,0.00038526853,0.009900615,0.00049555005,0.03280568,0.00010941613,0.9561973],"study_design_scores_gemma":[0.00011434465,0.00012634648,0.000031277206,0.000059015038,0.0000053594385,0.000017683524,1.7235644e-7,0.9142042,0.0070231385,0.0711328,0.0069257137,0.00035995737],"about_ca_topic_score_codex":0.000017773016,"about_ca_topic_score_gemma":0.0000026745167,"teacher_disagreement_score":0.95583737,"about_ca_system_score_codex":0.0001537111,"about_ca_system_score_gemma":0.00021888848,"threshold_uncertainty_score":0.99990135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003742152,0.0010468729,0.99360055,0.0011318186,0.0017198569,0.0003882261,0.0000014847403,0.00024716373,0.001826629],"genre_scores_gemma":[0.6729185,0.00011239375,0.32183927,0.0025050137,0.0023280117,0.000035436806,0.000011833118,0.00005299207,0.00019657587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966343,0.000028387383,0.0005103928,0.0013526517,0.0006094192,0.00086484203],"domain_scores_gemma":[0.9974326,0.00034742916,0.00041607243,0.0014783065,0.00015079627,0.00017479705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048824874,0.00047661708,0.00039051613,0.00024802584,0.00045537966,0.00059423625,0.0028541812,0.00031493013,0.000013451921],"category_scores_gemma":[0.000023799046,0.00043582867,0.00012578475,0.0006673253,0.00043391428,0.0011211629,0.0011726475,0.0010189104,0.000023648981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011090417,0.000011996302,0.000023233031,0.000008090712,0.0000030473402,0.000005715565,0.00019410644,0.07465784,0.00009868207,0.059177946,0.00001399822,0.86580426],"study_design_scores_gemma":[0.000095279975,0.00004257384,0.00012814194,0.0000751357,0.0000066661732,0.000038955903,1.0086445e-7,0.9711985,0.0000725381,0.026541432,0.0013306414,0.00047002945],"about_ca_topic_score_codex":0.000022504313,"about_ca_topic_score_gemma":0.000019077414,"teacher_disagreement_score":0.89654064,"about_ca_system_score_codex":0.00019154692,"about_ca_system_score_gemma":0.00013396335,"threshold_uncertainty_score":0.9998093},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018108238,0.0005041786,0.9943815,0.0003679929,0.00023671228,0.00018053674,0.000002001304,0.00013135103,0.0023849078],"genre_scores_gemma":[0.5838028,0.000041571828,0.4156506,0.00036383874,0.0000384694,0.000006906367,0.0000014925282,0.000008697241,0.00008562856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974051,0.00002890027,0.00048890087,0.0011742401,0.00044193582,0.0004609043],"domain_scores_gemma":[0.9983189,0.0006266135,0.00017133557,0.00071454747,0.0001011264,0.000067482455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007042447,0.00036744433,0.00068154914,0.00159675,0.00020437562,0.00015914078,0.0015252584,0.00034348754,0.000028326835],"category_scores_gemma":[0.00005988207,0.00032292044,0.00010822306,0.0010025724,0.0012474072,0.00028535913,0.0013136383,0.0006680445,0.000012188976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035324824,0.00004640708,0.00064611644,0.000041850803,0.000093557326,0.00009497267,0.0057247174,0.36577547,8.1883195e-7,0.5095629,0.0000048438856,0.11800483],"study_design_scores_gemma":[0.00006798295,0.000028065559,0.0002772804,0.00004735248,0.000014572979,0.000012246167,4.651219e-7,0.49489257,0.0000033517158,0.5044554,0.000018916206,0.00018182042],"about_ca_topic_score_codex":0.000029678024,"about_ca_topic_score_gemma":0.00016071998,"teacher_disagreement_score":0.581992,"about_ca_system_score_codex":0.00011134004,"about_ca_system_score_gemma":0.00013496228,"threshold_uncertainty_score":0.9999223},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006781646,0.0013425786,0.9796795,0.00057521986,0.0003028879,0.0008406432,0.00005559862,0.000051630985,0.010370283],"genre_scores_gemma":[0.99560183,0.000033492437,0.0032901617,0.0008670578,0.00016661291,0.0000044533654,0.000006041775,0.000011348545,0.000018998126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677175,0.00012310503,0.00046632183,0.0008534278,0.0012627874,0.000522599],"domain_scores_gemma":[0.99775326,0.0006640594,0.00045458734,0.0004337928,0.00050312025,0.00019120054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001590791,0.00032659995,0.000904425,0.0012085025,0.00044587324,0.00053416967,0.001373716,0.00035636142,0.00006343843],"category_scores_gemma":[0.00015946687,0.00030234648,0.00020335782,0.0013609381,0.0013177313,0.000759291,0.00020548297,0.0003891419,3.6836843e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005150777,0.00004650731,0.002011745,0.000015461124,0.00016479827,0.000017463864,0.001630662,0.70825267,0.00003079818,0.006804501,0.000001917206,0.28097194],"study_design_scores_gemma":[0.00048492893,0.000038258142,0.0010044478,0.00006904347,0.0003996499,5.5884226e-7,0.0000014767677,0.90374154,0.00003142279,0.09381874,0.000112950045,0.00029696885],"about_ca_topic_score_codex":0.001843199,"about_ca_topic_score_gemma":0.004648566,"teacher_disagreement_score":0.9888202,"about_ca_system_score_codex":0.00024762418,"about_ca_system_score_gemma":0.0009090242,"threshold_uncertainty_score":0.99994284},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018312295,0.0009462597,0.9963032,0.0000920818,0.00034714842,0.00026904888,0.000022321123,0.000014419096,0.00017428017],"genre_scores_gemma":[0.2784349,0.00020856081,0.7173115,0.0006931474,0.0020529756,0.0000643355,0.00030325406,0.000055711902,0.00087560026],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99874616,0.00001182634,0.00016543818,0.00061962457,0.00020892633,0.0002480415],"domain_scores_gemma":[0.99912137,0.000016631031,0.00013926903,0.00047482923,0.00015803301,0.00008988851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022167419,0.0002154299,0.00015834463,0.00013442448,0.000104914,0.00006911255,0.0003850012,0.00022764732,0.000012690433],"category_scores_gemma":[0.000010320714,0.00017652083,0.000047498874,0.000065845794,0.00020764266,0.000015720785,0.00006574735,0.00010863333,0.0000019723223],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039318493,0.000016722406,0.000033167024,0.000006094293,0.0000082332035,4.4919855e-7,0.00008788343,0.003718113,0.07627434,0.000035412268,0.00003034518,0.9197499],"study_design_scores_gemma":[0.00092810957,0.0014446783,0.00062938826,0.00011467509,0.000035224522,0.00004088044,0.0000021110848,0.1038983,0.8589063,0.001288152,0.031773165,0.0009389524],"about_ca_topic_score_codex":0.0000031037978,"about_ca_topic_score_gemma":0.000032659595,"teacher_disagreement_score":0.91881096,"about_ca_system_score_codex":0.000052173706,"about_ca_system_score_gemma":0.00023385782,"threshold_uncertainty_score":0.71983105},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018721804,0.00019501527,0.98450375,0.0008066178,0.00067099015,0.00025409204,0.0000061144133,0.00004130612,0.011649939],"genre_scores_gemma":[0.92190915,0.000017479344,0.07369943,0.0022399146,0.000878825,0.000004990712,0.000007944287,0.000020255116,0.001222017],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971764,0.000034387776,0.0006699967,0.0007650748,0.0009279393,0.00042618567],"domain_scores_gemma":[0.9961498,0.0024081504,0.0003881873,0.0006845689,0.00024489258,0.00012442569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003620569,0.00025719462,0.00035812805,0.00043156973,0.00041313368,0.00061703374,0.0011115834,0.00021972238,0.00006748977],"category_scores_gemma":[0.00029666384,0.00020000723,0.00006061928,0.00056310627,0.00071158085,0.00049049116,0.00042358635,0.00055152876,0.00006670926],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008317218,0.000006027573,0.00027808404,0.000005229158,0.0000025546356,0.000012677615,0.00036111128,0.018858606,0.000009790693,0.08567559,0.000026407173,0.8947556],"study_design_scores_gemma":[0.000103833656,0.00003532677,0.00049221504,0.0000839835,0.000004697995,0.00007384248,0.0000010345581,0.23543769,0.00003542288,0.76072145,0.002781983,0.00022853866],"about_ca_topic_score_codex":0.0000049556515,"about_ca_topic_score_gemma":0.00018273084,"teacher_disagreement_score":0.920037,"about_ca_system_score_codex":0.00012022448,"about_ca_system_score_gemma":0.00009549733,"threshold_uncertainty_score":0.8156058},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022859338,0.00043420223,0.9901737,0.00010786807,0.0036778643,0.0009348685,0.0000060253547,0.0002070464,0.00443554],"genre_scores_gemma":[0.01702868,0.000072779716,0.9819899,0.00023213592,0.0004750699,0.000022051103,0.00000333791,0.00004153651,0.00013450705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947785,0.0002196723,0.0010330888,0.001730768,0.0015076663,0.0007302965],"domain_scores_gemma":[0.9951876,0.0007076959,0.0009358959,0.0022997889,0.000671084,0.00019797044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028028905,0.00066114095,0.0009651341,0.0012193867,0.00017963615,0.0004236155,0.004902985,0.0004922417,0.00000832026],"category_scores_gemma":[0.00019139379,0.00061709335,0.00016477414,0.0011611746,0.00090264145,0.0009990495,0.0013282149,0.0008628571,0.000030758103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021171158,0.000058073616,0.000010257648,0.00010467801,0.00002935232,0.00007531752,0.001045377,0.2072906,0.0004945027,0.12255954,0.000025064146,0.6682861],"study_design_scores_gemma":[0.00025273254,0.00045688776,0.000081960316,0.0006359034,0.000012196155,0.00019632155,2.8284745e-7,0.937256,0.0032933047,0.05645072,0.0007296406,0.00063409],"about_ca_topic_score_codex":0.00009060365,"about_ca_topic_score_gemma":0.0000038235175,"teacher_disagreement_score":0.7299653,"about_ca_system_score_codex":0.0005742609,"about_ca_system_score_gemma":0.00091144367,"threshold_uncertainty_score":0.99962807},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008785222,0.00016138892,0.96039945,0.00585632,0.0012789589,0.0012013557,0.0000031496618,0.00021815658,0.022095991],"genre_scores_gemma":[0.94675654,0.000005714823,0.050491527,0.0015110577,0.0008100662,0.00008148299,0.000031500847,0.000035326928,0.0002767922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984237,0.0000033676736,0.00035244902,0.00064120913,0.00029553153,0.00028373592],"domain_scores_gemma":[0.99840146,0.000062017076,0.00029908094,0.0002477163,0.0009863197,0.0000034231373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011392473,0.00024334539,0.00027873833,0.00337586,0.00020161025,0.0001420014,0.0005272051,0.0004719088,0.0000065627314],"category_scores_gemma":[0.00062168937,0.00024211795,0.000019766561,0.0030554577,0.0005907681,0.00040368974,0.00030006608,0.00052034296,0.000013939467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016783653,0.00002291817,0.00019930748,0.000029534234,0.000004977714,0.000008615183,0.00047807978,0.0009831777,0.000060707487,0.86368877,0.000047915102,0.13445918],"study_design_scores_gemma":[0.00036346202,0.000042583917,0.0001223686,0.00018934577,0.0000038114308,7.9715477e-7,0.000041094696,0.00916455,0.00032992984,0.9834775,0.0059198374,0.0003447723],"about_ca_topic_score_codex":0.000006627204,"about_ca_topic_score_gemma":0.00007983497,"teacher_disagreement_score":0.9379713,"about_ca_system_score_codex":0.000518603,"about_ca_system_score_gemma":0.00022932501,"threshold_uncertainty_score":0.9873284},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043142578,0.00008124711,0.9977299,0.00058863626,0.00030333592,0.00027237038,0.0000022094518,0.00011956913,0.00047130333],"genre_scores_gemma":[0.855343,0.000016167523,0.14278404,0.0011638172,0.00016577957,0.000005001181,0.000014377169,0.000037036047,0.0004707947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996958,0.00004805192,0.0005913269,0.0011456147,0.00079693197,0.00046008494],"domain_scores_gemma":[0.99854416,0.00015237457,0.00032458646,0.00058387563,0.00025274447,0.00014223914],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007396774,0.00037848073,0.00044825725,0.001303548,0.00024521112,0.0013802267,0.0017675196,0.0001516094,0.000011623065],"category_scores_gemma":[0.00009738088,0.00031553028,0.00006826134,0.0013387947,0.00024003015,0.0007844182,0.000586431,0.00032499357,0.000010920092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016557777,0.0001631705,0.005534849,0.00064531504,0.00002673411,0.000083802006,0.011121583,0.07206054,0.00010322649,0.33310893,0.0000388183,0.57709646],"study_design_scores_gemma":[0.00035701672,0.00025131472,0.0011999541,0.00504483,0.000013272747,0.000011673701,0.0000050961894,0.9776573,0.00027611226,0.013915515,0.0004904574,0.00077743223],"about_ca_topic_score_codex":0.000016176036,"about_ca_topic_score_gemma":0.00056983414,"teacher_disagreement_score":0.9055968,"about_ca_system_score_codex":0.00024412043,"about_ca_system_score_gemma":0.00025901233,"threshold_uncertainty_score":0.99992967},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008307414,0.00021010482,0.9927414,0.0020468787,0.0014986859,0.00044544192,0.0000054372317,0.00020116559,0.0020201392],"genre_scores_gemma":[0.16303739,0.000035359753,0.8335765,0.0012582178,0.0011083083,0.000013720663,0.0000040679474,0.000050375857,0.00091607607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957175,0.000063457184,0.0004744855,0.0018603085,0.000982563,0.0009016569],"domain_scores_gemma":[0.9975045,0.00022612858,0.00030558478,0.0013919526,0.0003432498,0.0002286373],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005137195,0.0007309941,0.00062060193,0.00062929647,0.00059404253,0.0011976918,0.0022688468,0.00052983226,0.00005054632],"category_scores_gemma":[0.000061631305,0.00066121155,0.00022509601,0.0004635475,0.0004839363,0.0022892586,0.0009643081,0.0012775293,0.000057304984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005083651,0.000025922558,0.00002207614,0.000042932566,0.000022553231,0.000041978936,0.0008781062,0.82829875,0.0064119846,0.000812517,0.00021754377,0.16322057],"study_design_scores_gemma":[0.00022118556,0.000037961396,0.000093436705,0.00028225707,0.000012573255,0.0000531991,2.1626906e-7,0.9570409,0.008613462,0.032694772,0.00022868664,0.00072133983],"about_ca_topic_score_codex":0.000045723613,"about_ca_topic_score_gemma":0.00006387235,"teacher_disagreement_score":0.16249923,"about_ca_system_score_codex":0.00046535087,"about_ca_system_score_gemma":0.0003144812,"threshold_uncertainty_score":0.9998392},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19828022,0.000048465474,0.7995264,0.0005173249,0.000024044755,0.0011706019,0.000007647745,0.00003632612,0.00038899895],"genre_scores_gemma":[0.9425619,0.000016690688,0.056840956,0.00045549744,0.000030430687,0.000017896053,0.000020084162,0.000015157881,0.000041385134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873185,0.000007747789,0.00032142346,0.00048081114,0.00028680725,0.0001713519],"domain_scores_gemma":[0.9993309,0.000040866267,0.00011219919,0.00034906255,0.000098858945,0.000068138565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017807419,0.00020324838,0.00039526186,0.00034125586,0.000037217294,0.000016247528,0.00017920249,0.00011299952,0.00000997785],"category_scores_gemma":[0.000013911373,0.0001729082,0.000033479908,0.0001789705,0.00049462577,0.00007319531,0.00014752979,0.000272145,3.7431346e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056457287,0.0018413037,0.0013336455,0.00008210048,0.000014493783,0.00010832751,0.004678641,0.0056935987,0.38792092,0.12624998,0.0000012650563,0.47151116],"study_design_scores_gemma":[0.0031245654,0.0048395037,0.007266061,0.0010727635,0.000051442425,0.00015119587,0.0000060724697,0.7959238,0.055146378,0.13171624,0.000017219734,0.0006847243],"about_ca_topic_score_codex":0.0000043753134,"about_ca_topic_score_gemma":0.0000037346738,"teacher_disagreement_score":0.7902302,"about_ca_system_score_codex":0.00008587133,"about_ca_system_score_gemma":0.00010454323,"threshold_uncertainty_score":0.70509917},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005163698,0.00017056109,0.9688868,0.0006777457,0.0005684486,0.00048655737,0.0000024828594,0.0005315884,0.028670637],"genre_scores_gemma":[0.0070395996,0.000024231376,0.98894066,0.0023529371,0.0006341502,0.000013117163,0.0000028011234,0.000038882143,0.0009536424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957941,0.000027691438,0.0004955945,0.0019259934,0.00091284217,0.00084378535],"domain_scores_gemma":[0.9973178,0.0001598164,0.00021108105,0.0017946208,0.00015427904,0.0003623875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006526678,0.00062030985,0.0005525968,0.0014433945,0.00027048384,0.0007475331,0.0048880666,0.000317849,0.000011261011],"category_scores_gemma":[0.000041872096,0.0005763401,0.00017685696,0.0010555583,0.00032849354,0.0010285798,0.00197562,0.0009657575,0.000048997714],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005202502,0.000020753525,0.000011038079,0.00001912126,0.000007539218,0.00003520371,0.0011029592,0.006885652,0.00019662897,0.033088293,0.00018626096,0.9584414],"study_design_scores_gemma":[0.0005380747,0.00032995472,0.000105717554,0.0010418438,0.000017172151,0.00031060333,3.2524835e-7,0.22873414,0.010425383,0.70277125,0.052757867,0.0029676538],"about_ca_topic_score_codex":0.0000276247,"about_ca_topic_score_gemma":0.00001601964,"teacher_disagreement_score":0.9554737,"about_ca_system_score_codex":0.00026141715,"about_ca_system_score_gemma":0.0004225172,"threshold_uncertainty_score":0.9996688},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028792562,0.00012962661,0.9918724,0.00010304292,0.0024906108,0.00043742362,0.0000028172851,0.00020202143,0.004474163],"genre_scores_gemma":[0.9708829,0.000010746847,0.028229672,0.00017496428,0.00038787065,0.000008803756,0.00001028454,0.000021837568,0.00027293293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696374,0.00006064915,0.0006693787,0.0010660712,0.0007815352,0.00045864942],"domain_scores_gemma":[0.9975796,0.00018538884,0.00063463557,0.00117338,0.00030020182,0.00012684116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010156521,0.00040806195,0.00065799465,0.00061571854,0.00013225552,0.0002910097,0.002258462,0.00031362328,0.0000074350673],"category_scores_gemma":[0.000036337155,0.0003438668,0.00013708397,0.00040828565,0.0007037196,0.00027560486,0.00068062363,0.0003595156,0.000039274935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030075364,0.000017579348,0.00007041957,0.0002967893,0.000013636198,0.0000456128,0.00060201663,0.0007006031,0.0042787264,0.61458915,0.0000034126745,0.37937903],"study_design_scores_gemma":[0.0010107517,0.0012618318,0.0010573606,0.0014993001,0.000045104898,0.00066060165,0.0000021654262,0.872855,0.018208202,0.08491782,0.015959175,0.0025226562],"about_ca_topic_score_codex":0.000022246093,"about_ca_topic_score_gemma":0.000008932735,"teacher_disagreement_score":0.97059494,"about_ca_system_score_codex":0.00018071692,"about_ca_system_score_gemma":0.0003561154,"threshold_uncertainty_score":0.99990135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011828393,0.00042836793,0.988022,0.0002993447,0.00062004325,0.00019541863,0.0000070140595,0.00018561688,0.009059298],"genre_scores_gemma":[0.65015805,0.000054210683,0.34480292,0.004241034,0.00028819605,0.000009606064,0.0000068392596,0.00003906918,0.00040008003],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775535,0.000031126303,0.00027464214,0.0010978266,0.0004366866,0.0004043671],"domain_scores_gemma":[0.9980858,0.0004174551,0.00014268562,0.0011456759,0.00006132023,0.0001470932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005733319,0.00035174598,0.00032777232,0.00044427617,0.00021244927,0.0003222367,0.0017935073,0.00018731675,0.00003804054],"category_scores_gemma":[0.000036090973,0.0003049156,0.00007248927,0.00022529048,0.0005421909,0.00035660889,0.0009867218,0.00050076685,0.000050917613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004462147,0.00003452298,0.000016584747,0.000020629224,0.00000713805,0.00009659588,0.0013078961,0.00029222702,0.00020018099,0.42524123,0.00002006725,0.57275844],"study_design_scores_gemma":[0.00022548367,0.00023669438,0.0005889433,0.00035448853,0.000007420676,0.00012568063,1.5934587e-7,0.054731134,0.0024154175,0.9403587,0.00030278382,0.0006530814],"about_ca_topic_score_codex":0.000024877741,"about_ca_topic_score_gemma":0.0000225544,"teacher_disagreement_score":0.6489752,"about_ca_system_score_codex":0.000105371095,"about_ca_system_score_gemma":0.00014342339,"threshold_uncertainty_score":0.9999403},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004888596,0.00010928181,0.9860181,0.00007600559,0.0043784953,0.00076831714,0.00010090262,0.00019922967,0.0034610375],"genre_scores_gemma":[0.18888634,3.5095022e-7,0.8078331,0.0001927416,0.0019498199,0.000027437327,0.000013604596,0.000078793724,0.001017828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99288553,0.00021202286,0.0012414387,0.002419093,0.002419728,0.00082218106],"domain_scores_gemma":[0.98901725,0.0075279875,0.0008428984,0.0016836047,0.0007165712,0.00021168556],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008857706,0.0006298188,0.0010065971,0.0011866295,0.00070955,0.0010776944,0.0033406161,0.0005011907,0.00004555349],"category_scores_gemma":[0.0056542624,0.00051588065,0.00028194647,0.00085222936,0.00084836327,0.00032901642,0.00061127567,0.000610048,0.00006367595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007998416,0.000016421202,0.00010596923,0.000019147084,0.0000054909515,0.000028452347,0.0004964269,0.25539187,0.00037888493,0.00042711102,0.00009623477,0.742954],"study_design_scores_gemma":[0.00039453956,0.00037300133,0.0005866052,0.00046911545,0.000026099733,0.000047538495,0.0000023504297,0.9013197,0.0029540567,0.09089533,0.0020375638,0.0008940867],"about_ca_topic_score_codex":0.00007781271,"about_ca_topic_score_gemma":0.00012433477,"teacher_disagreement_score":0.74205995,"about_ca_system_score_codex":0.0005673845,"about_ca_system_score_gemma":0.00066334277,"threshold_uncertainty_score":0.9999593},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039508278,0.005079903,0.98890334,0.00008480464,0.0012244253,0.00028560543,0.0000020758532,0.00009073965,0.00037828955],"genre_scores_gemma":[0.93172675,0.000407634,0.06718006,0.00017785472,0.00043512427,0.0000059891786,0.0000024146625,0.00003636535,0.000027804357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961689,0.00008424523,0.0007460482,0.0014632574,0.00079876155,0.00073877705],"domain_scores_gemma":[0.9973852,0.00056928897,0.00039794695,0.0013128532,0.0001749369,0.00015975808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092354504,0.000534815,0.0008280727,0.0008038431,0.00011457278,0.00029151028,0.002462139,0.00043794644,0.0000016085626],"category_scores_gemma":[0.000016054673,0.000523937,0.00008866793,0.00079488964,0.00064891204,0.0005370186,0.00058848073,0.0008370832,9.805326e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004363509,0.00003167614,0.0014856777,0.00002926655,0.0000039147135,0.00005239239,0.000101885795,0.77865905,0.00008896834,0.007226167,0.0000014430377,0.21231517],"study_design_scores_gemma":[0.00045167748,0.00012835712,0.0026691263,0.0009823587,0.0000059884314,0.00002345666,1.0249677e-7,0.99041045,0.00030777586,0.0044757905,0.000044307617,0.00050063373],"about_ca_topic_score_codex":0.000138991,"about_ca_topic_score_gemma":0.0001668119,"teacher_disagreement_score":0.9277759,"about_ca_system_score_codex":0.00018952785,"about_ca_system_score_gemma":0.00016667834,"threshold_uncertainty_score":0.9997212},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009306754,0.0005707831,0.9826619,0.00018231702,0.0017580647,0.0020713564,0.0005171241,0.00003993466,0.0028917836],"genre_scores_gemma":[0.8424272,0.000095689626,0.13498113,0.0029535065,0.003557037,0.0005196548,0.00011445222,0.00010990763,0.015241453],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960146,0.00001298569,0.00076578895,0.0009434746,0.0016517579,0.00061138923],"domain_scores_gemma":[0.9968704,0.0010636754,0.00043807784,0.00070082187,0.00072412513,0.0002029032],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0043408596,0.0004326174,0.00060562143,0.0007900525,0.00048888655,0.0010925478,0.0014359108,0.0002957978,0.0002145438],"category_scores_gemma":[0.0002027663,0.00032849915,0.00022658228,0.0003265855,0.0006011876,0.0013557359,0.0004783384,0.00030008593,0.000014195076],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011726611,0.000041327457,0.000893074,0.00016891738,0.000021335194,0.0000035851535,0.004653334,0.0005573103,0.000023663622,0.008986181,0.0037462488,0.98078775],"study_design_scores_gemma":[0.001207169,0.0004318244,0.000841631,0.0001283358,0.000051318533,0.0000174352,0.000013535451,0.14653623,0.0005600791,0.33398342,0.5153476,0.0008814215],"about_ca_topic_score_codex":0.0000026383734,"about_ca_topic_score_gemma":0.00012673014,"teacher_disagreement_score":0.9799063,"about_ca_system_score_codex":0.00020093852,"about_ca_system_score_gemma":0.00027561796,"threshold_uncertainty_score":0.9999444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011245452,0.00038065607,0.9695226,0.0012029393,0.0018889523,0.0007126464,0.0000041379512,0.00019671564,0.014845892],"genre_scores_gemma":[0.98411524,0.000016726097,0.012190185,0.0007558804,0.0009931496,0.000005051677,0.00002871723,0.00003354546,0.0018615264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978419,0.000012434434,0.00037587987,0.0007384921,0.00067554496,0.00035576712],"domain_scores_gemma":[0.9987973,0.00018295467,0.0001535239,0.00048604855,0.00019710952,0.00018305771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026364304,0.0003094469,0.00042697723,0.0004465753,0.00014843652,0.00012543194,0.00024517372,0.0003337089,0.00088779023],"category_scores_gemma":[0.000100019286,0.00024393713,0.00010699309,0.00023420951,0.00031308082,0.00013756877,0.00012320044,0.0006357445,0.00019288475],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040927658,0.00003128888,0.00021001404,0.00008834422,0.000018337136,0.00022729865,0.00022287673,0.023359274,0.0018134165,0.0008048931,0.000013267323,0.97317004],"study_design_scores_gemma":[0.010765073,0.0008096986,0.117547914,0.0057069543,0.00038382979,0.0020112353,0.0000030274703,0.6260182,0.045999575,0.106548846,0.078910924,0.0052947137],"about_ca_topic_score_codex":0.000008511684,"about_ca_topic_score_gemma":0.000003888691,"teacher_disagreement_score":0.97286975,"about_ca_system_score_codex":0.00015039473,"about_ca_system_score_gemma":0.00016881061,"threshold_uncertainty_score":0.99474674},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93012494,0.00040424723,0.06408639,0.00421619,0.0005809881,0.00049395795,0.0000071871477,0.000047655274,0.000038469334],"genre_scores_gemma":[0.9821143,8.73618e-7,0.015094277,0.0025852602,0.00016099295,0.000025054838,0.000005388957,0.000009248504,0.0000045719726],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9984146,0.000054225082,0.00021519985,0.0004770856,0.00048881356,0.00035010214],"domain_scores_gemma":[0.99900264,0.00017259919,0.000023509014,0.00026868738,0.00018877414,0.00034381173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003060788,0.00015553545,0.000230219,0.0003359473,0.00006169695,0.00006382594,0.0001279608,0.000031283715,0.000010414502],"category_scores_gemma":[0.00043989133,0.00013776809,0.000046025023,0.0009529192,0.00035944895,0.00038299122,0.00020627261,0.00022181749,0.000066002256],"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.0008689442,0.000612363,0.85384345,0.00007029937,0.00002045955,0.0003616784,0.0076282676,0.0028989776,0.008693614,0.000007043242,0.00035348284,0.12464142],"study_design_scores_gemma":[0.0030924687,0.00058688293,0.8226122,0.00028096436,0.00003519034,0.000098638724,0.00007424329,0.16405338,0.005493291,0.0029874847,0.00026996262,0.00041529417],"about_ca_topic_score_codex":0.0000721994,"about_ca_topic_score_gemma":0.00012297624,"teacher_disagreement_score":0.1611544,"about_ca_system_score_codex":0.00033016983,"about_ca_system_score_gemma":0.00047185773,"threshold_uncertainty_score":0.5618019},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017417498,0.0008273408,0.99137,0.0014027626,0.0011449079,0.00042558447,0.0000129407,0.00010745398,0.004691584],"genre_scores_gemma":[0.039735224,0.00012337668,0.95350695,0.0051548746,0.00071834575,0.000031266678,0.000024377407,0.000054980697,0.00065063144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951284,0.0000693277,0.00058813696,0.0016376099,0.0017739722,0.00080258935],"domain_scores_gemma":[0.99632645,0.00064945564,0.00024668514,0.0023604769,0.00022773238,0.00018922017],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020865733,0.00058003917,0.0005280163,0.00069262553,0.00023788809,0.00078149687,0.007749975,0.00033421422,0.000008742977],"category_scores_gemma":[0.00012867647,0.00039885545,0.00011619338,0.00085259683,0.0006816493,0.0010523184,0.0014316243,0.0013044243,0.000049563976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050941653,0.0000510818,0.000021982783,0.000014814586,0.00000440777,0.00017537686,0.0018837096,0.18363649,0.000020368578,0.016924815,0.0006631678,0.7965987],"study_design_scores_gemma":[0.00021668174,0.00005894977,0.000031422303,0.0001945687,0.000003059948,0.000052863197,3.8427734e-7,0.76197815,0.00006050343,0.23370093,0.0032707804,0.0004317224],"about_ca_topic_score_codex":0.000048191832,"about_ca_topic_score_gemma":0.00007441211,"teacher_disagreement_score":0.79616696,"about_ca_system_score_codex":0.0002855075,"about_ca_system_score_gemma":0.00079398864,"threshold_uncertainty_score":0.99984634},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046453388,0.00005458473,0.9973133,0.0005760007,0.00096952554,0.0003408031,0.0000034006753,0.00014078237,0.00055515626],"genre_scores_gemma":[0.41868803,0.000016973789,0.57980365,0.0008508544,0.00046641118,0.000007186923,0.000028059756,0.00009054951,0.000048270285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985649,0.0000071849577,0.00028437283,0.00047229516,0.00035548973,0.00031578247],"domain_scores_gemma":[0.9989855,0.00038057516,0.00006951266,0.0003771216,0.00010297687,0.00008428328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021234751,0.00028052033,0.00025874184,0.00031600788,0.00011057163,0.00018700557,0.0002829915,0.00025378627,0.0000095529485],"category_scores_gemma":[0.000046633806,0.000265935,0.00008141603,0.000138878,0.00014919581,0.00014179011,0.000047411137,0.00036520633,0.000007870781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059500567,0.000007648501,0.0000028232826,0.00009295539,0.0000035171802,0.00002287095,0.00006036527,0.9591483,0.00006814065,0.0063758753,0.00002752889,0.034184024],"study_design_scores_gemma":[0.0002600137,0.00009236104,0.0000073768865,0.00047228578,0.000008883351,0.000012346585,7.280396e-8,0.946571,0.0007669536,0.050943118,0.00055435963,0.00031122955],"about_ca_topic_score_codex":0.0000051843153,"about_ca_topic_score_gemma":0.000016889504,"teacher_disagreement_score":0.4186416,"about_ca_system_score_codex":0.0003072764,"about_ca_system_score_gemma":0.00020754818,"threshold_uncertainty_score":0.99997926},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013439761,0.00023196999,0.9830902,0.000031689255,0.0020930904,0.0006043774,0.000020700669,0.00014183506,0.00034632656],"genre_scores_gemma":[0.98165417,0.00001466251,0.017097501,0.000055163535,0.0009837645,0.000013373967,0.000016874521,0.000053543004,0.0001109569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832714,0.000012331903,0.0003963742,0.00046850098,0.00029704752,0.00049859704],"domain_scores_gemma":[0.999394,0.000098255594,0.000097754266,0.0002466214,0.00009233203,0.00007103585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048169759,0.00031602746,0.00037209538,0.000407992,0.00011698597,0.000114080845,0.00033549516,0.00034696612,0.00000476174],"category_scores_gemma":[0.000018362998,0.0003247518,0.00007295618,0.00026706947,0.000093061884,0.0002934815,0.00006981291,0.00043332786,0.0000020039301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072659413,0.000007905014,0.00020017978,0.000073425406,0.000012315023,0.0000011060594,0.00026429095,0.8574506,0.001954257,0.0014535779,0.0000022656202,0.13857283],"study_design_scores_gemma":[0.000363727,0.000052624277,0.00040472782,0.00022465146,0.000012019261,0.000016980299,1.233938e-7,0.9916814,0.00027862552,0.0063530295,0.0003104887,0.00030158338],"about_ca_topic_score_codex":0.000113470436,"about_ca_topic_score_gemma":0.00054475915,"teacher_disagreement_score":0.9682144,"about_ca_system_score_codex":0.00081550435,"about_ca_system_score_gemma":0.000085136366,"threshold_uncertainty_score":0.9999204},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013693954,0.00075224775,0.9961672,0.00014881293,0.00020224634,0.000412218,0.000003467739,0.00026599257,0.00067841774],"genre_scores_gemma":[0.5133864,0.000030192195,0.48618552,0.0001628903,0.00013809778,0.00000974813,0.000004915952,0.000035466466,0.000046731275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580014,0.000046468176,0.00073529343,0.0014588811,0.0012459493,0.0007132819],"domain_scores_gemma":[0.9960128,0.00045698596,0.00078184163,0.0020564923,0.00049509335,0.00019676857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008414372,0.0006104237,0.0007396308,0.0013680795,0.00021868432,0.00028995515,0.0030464258,0.00033097356,0.000021331243],"category_scores_gemma":[0.00010738892,0.0005120454,0.00015020902,0.001131269,0.00093908305,0.0016163674,0.0010148559,0.00071843393,0.000012549412],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013256894,0.000060462142,0.0007392203,0.00007374192,0.000020934649,0.000023133895,0.00055859785,0.0041462975,0.00942197,0.014132647,0.000003148178,0.9708066],"study_design_scores_gemma":[0.0010594134,0.00062970794,0.0020914108,0.0017229391,0.0001331025,0.00015636334,0.0000025087488,0.7863518,0.119976394,0.0846947,0.00050129066,0.0026803976],"about_ca_topic_score_codex":0.000053688953,"about_ca_topic_score_gemma":0.00011067152,"teacher_disagreement_score":0.9681262,"about_ca_system_score_codex":0.00037269297,"about_ca_system_score_gemma":0.00050650333,"threshold_uncertainty_score":0.9997331},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043600397,0.00016310369,0.9924707,0.00021523674,0.0013852464,0.0007260585,0.000021886908,0.00008416098,0.00057359977],"genre_scores_gemma":[0.927837,0.000024026234,0.06913596,0.00047805888,0.0020497362,0.000015828986,0.00020155273,0.000043383126,0.00021444393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806917,0.000007302686,0.00035529793,0.0005663602,0.0005266845,0.00047516896],"domain_scores_gemma":[0.9987539,0.0003689441,0.00017282892,0.00039349144,0.00015509545,0.00015576062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000233885,0.00033976434,0.0003941036,0.00053801684,0.0001987718,0.00013894912,0.00022318051,0.000270751,0.00006782443],"category_scores_gemma":[0.00009662329,0.0002855591,0.00019960888,0.00016504785,0.000233733,0.00028831014,0.000056632096,0.00040979375,0.0000070774213],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027989273,0.00015838195,0.006044616,0.00031826182,0.000077830635,0.0000030333028,0.0018833878,0.0007737159,0.018236391,0.0039668544,0.00006243385,0.9681952],"study_design_scores_gemma":[0.010818302,0.004336313,0.058299206,0.0036514164,0.0012842123,0.0008896535,0.000002871698,0.5157996,0.029296994,0.32741985,0.043341145,0.004860453],"about_ca_topic_score_codex":0.000043387405,"about_ca_topic_score_gemma":0.00007159817,"teacher_disagreement_score":0.96333474,"about_ca_system_score_codex":0.00015589024,"about_ca_system_score_gemma":0.00019851098,"threshold_uncertainty_score":0.99995965},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015936873,0.0014107636,0.9898128,0.0017882837,0.0015876896,0.0006121775,0.000049622755,0.0001905296,0.0029544784],"genre_scores_gemma":[0.92302644,0.0002534744,0.07298324,0.0014800665,0.0017405321,0.000010945149,0.000038260212,0.000058044894,0.0004089773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99467003,0.00012266751,0.00081717264,0.001889972,0.0016047345,0.0008954481],"domain_scores_gemma":[0.9966286,0.0006761348,0.00047207985,0.0016801133,0.00026883328,0.0002742269],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012893531,0.000732992,0.00083225925,0.0004329246,0.001500639,0.00079542235,0.0037426057,0.00044762468,0.000011372396],"category_scores_gemma":[0.00008226944,0.00054020516,0.00016947283,0.00072713924,0.0025217643,0.0007349553,0.0031697247,0.0012263304,0.000046554575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019920266,0.000058236037,0.00043537098,0.00010782889,0.00003346197,0.00027091097,0.006006296,0.0031099634,0.00036191725,0.02522432,0.0008770273,0.9634947],"study_design_scores_gemma":[0.0015843033,0.0006986142,0.0051874947,0.0023087086,0.00004380071,0.0012083185,0.0000031414227,0.7791775,0.0012094826,0.14657597,0.05895581,0.0030468737],"about_ca_topic_score_codex":0.00009262564,"about_ca_topic_score_gemma":0.00008295745,"teacher_disagreement_score":0.96044785,"about_ca_system_score_codex":0.00029344633,"about_ca_system_score_gemma":0.00039353213,"threshold_uncertainty_score":0.99979925},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001346683,0.00011221865,0.99334717,0.00022376177,0.0009283109,0.00017860149,0.000014578972,0.00006833892,0.004992331],"genre_scores_gemma":[0.024474151,0.00007867543,0.9749599,0.00015591188,0.0001882703,0.0000062890986,0.0000075303024,0.00001442656,0.00011485579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769974,0.000012347681,0.00044946105,0.00096674997,0.0005901905,0.00028149848],"domain_scores_gemma":[0.99767274,0.00051748095,0.00033969022,0.0011375146,0.00024401207,0.0000885759],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036072088,0.00027772438,0.00036147286,0.00064259267,0.00012824954,0.00021769127,0.002253252,0.00016415514,0.000024229357],"category_scores_gemma":[0.00007274964,0.0002507164,0.00008675856,0.0006087125,0.00063184346,0.0006255719,0.00089885655,0.00040567218,0.000024652274],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027787737,0.000017564318,0.000018597082,0.000004387355,0.000004984608,0.0000124544595,0.00020651746,0.0015653658,0.000059476486,0.026315868,0.000018350185,0.9717737],"study_design_scores_gemma":[0.00026602185,0.00018779852,0.00023873281,0.0006378049,0.000009579818,0.0002447653,6.4094644e-7,0.6055972,0.0022162641,0.3841335,0.005960843,0.0005068797],"about_ca_topic_score_codex":0.00002995806,"about_ca_topic_score_gemma":0.000047982157,"teacher_disagreement_score":0.97126675,"about_ca_system_score_codex":0.0001372111,"about_ca_system_score_gemma":0.00025359783,"threshold_uncertainty_score":0.9999945},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006018714,0.000026977554,0.97162753,0.01887207,0.004355111,0.00045032005,4.9051613e-7,0.00014935392,0.0044579655],"genre_scores_gemma":[0.32515323,0.000019253595,0.6464104,0.01177812,0.012083552,0.000051212577,0.000014648041,0.00007120744,0.0044183447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970185,0.00009285649,0.00031341217,0.0013840377,0.0007201946,0.00047100644],"domain_scores_gemma":[0.9975905,0.00016168361,0.00016226545,0.001699427,0.00024022271,0.00014589824],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016477018,0.00032323832,0.00027057697,0.0006111331,0.00046850214,0.0012433768,0.0041008485,0.00014578455,0.000033524328],"category_scores_gemma":[0.00015739615,0.00023503206,0.00006276338,0.0007928233,0.00022925521,0.00052864064,0.00073793554,0.00078444474,0.00021756721],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034286297,0.000019568059,0.000018332252,0.0000104564615,0.0000042026973,0.000003282371,0.0035323473,0.0645559,0.000099767385,0.08537443,0.0012372272,0.84514105],"study_design_scores_gemma":[0.00015532898,0.00059670367,0.0002859551,0.00010780405,0.0000078869325,0.00010439862,0.0000047802096,0.5466655,0.00067721726,0.018310195,0.43217662,0.00090765517],"about_ca_topic_score_codex":0.00003565077,"about_ca_topic_score_gemma":0.00009748021,"teacher_disagreement_score":0.8442334,"about_ca_system_score_codex":0.00019264418,"about_ca_system_score_gemma":0.0005233023,"threshold_uncertainty_score":0.9997934},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011298308,0.0013567376,0.98524004,0.00014229178,0.00073497614,0.00034622863,0.000006058772,0.000117277355,0.0007581002],"genre_scores_gemma":[0.8668235,0.000116654,0.1326534,0.0001969751,0.000118037686,0.000006823181,0.000002905996,0.000019900523,0.000061819155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968355,0.00008450414,0.0004610412,0.0011639636,0.0008564979,0.0005985018],"domain_scores_gemma":[0.9975574,0.00077502587,0.0004455974,0.0008377772,0.00019240519,0.00019180814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012239176,0.0005287918,0.00060205127,0.0008238862,0.00038936033,0.0004230132,0.0017186948,0.00026228375,0.00003565338],"category_scores_gemma":[0.00005710021,0.0003810023,0.000099995894,0.00088137627,0.001960903,0.001163532,0.0005906627,0.00058790325,0.000007227061],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008639638,0.000049737348,0.0029623336,0.0002513226,0.000046261346,0.00009893794,0.0064474274,0.010110258,0.0009293556,0.04951605,0.000005246932,0.92949665],"study_design_scores_gemma":[0.0017594199,0.004548928,0.00417512,0.008549935,0.00019258626,0.0023242026,0.0000113434535,0.5866137,0.011385689,0.3751355,0.0010024019,0.004301122],"about_ca_topic_score_codex":0.000039886392,"about_ca_topic_score_gemma":0.00009223717,"teacher_disagreement_score":0.9251956,"about_ca_system_score_codex":0.00009962981,"about_ca_system_score_gemma":0.00044656981,"threshold_uncertainty_score":0.99986416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006093517,0.00030859667,0.99578536,0.0012364316,0.0011923659,0.00045064322,0.0000061015458,0.00012630197,0.00028487458],"genre_scores_gemma":[0.21895999,0.000033060292,0.7797361,0.0008020718,0.00032982658,0.000019254685,0.000006118657,0.000018413042,0.000095172705],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720395,0.0000710641,0.00042236058,0.0013226579,0.0005303015,0.00044965488],"domain_scores_gemma":[0.996126,0.002311478,0.00036342503,0.000883497,0.00021196414,0.000103660626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011536623,0.00035801803,0.00048977137,0.00039620113,0.00023985561,0.00055125984,0.0013482091,0.0003049289,0.0000038439584],"category_scores_gemma":[0.0007217805,0.00032051056,0.0000950934,0.00022312207,0.0004513812,0.00036838328,0.0006158125,0.00042369412,0.0000048230736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094806655,0.000008194976,0.00054468587,0.00008245515,0.000013628893,0.000016010701,0.011224478,0.0009179522,0.000009217064,0.39270228,0.000016097782,0.5944555],"study_design_scores_gemma":[0.00022676132,0.0001919498,0.0012783224,0.00077174295,0.000008631378,0.000027349317,0.000005300868,0.25911358,0.00038390883,0.7372964,0.00023094162,0.00046511638],"about_ca_topic_score_codex":0.0000815405,"about_ca_topic_score_gemma":0.000116479154,"teacher_disagreement_score":0.5939904,"about_ca_system_score_codex":0.00009043915,"about_ca_system_score_gemma":0.00016573608,"threshold_uncertainty_score":0.9999247},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006720466,0.0027368485,0.9915312,0.0016668387,0.00094841875,0.0005610072,0.000002146098,0.0005759335,0.0013055814],"genre_scores_gemma":[0.06459028,0.00009776505,0.9327928,0.0017744501,0.00044851078,0.000012388978,0.0000024231765,0.000046667432,0.0002347146],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948423,0.00004932401,0.00056951307,0.0020813574,0.0013467687,0.001110745],"domain_scores_gemma":[0.99700147,0.00035631153,0.00017598727,0.0018401277,0.0003362888,0.00028978597],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010233968,0.0006360467,0.0006949191,0.0016879113,0.0004729201,0.000593517,0.005743379,0.00043917864,0.000028741908],"category_scores_gemma":[0.000055204157,0.0005688259,0.00014173298,0.0011342916,0.0007154501,0.0006234027,0.002728036,0.0014798262,0.00012061955],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001216437,0.000029448835,0.00007371646,0.000064863154,0.000009549333,0.0008982378,0.0046388516,0.00096925686,0.00091148505,0.027327796,0.00019493625,0.9648697],"study_design_scores_gemma":[0.0009785563,0.0016235511,0.0003385497,0.003312438,0.000015854,0.0045989235,0.0000017485049,0.14136383,0.02990592,0.7804732,0.0322082,0.0051792506],"about_ca_topic_score_codex":0.00004746344,"about_ca_topic_score_gemma":0.00009682565,"teacher_disagreement_score":0.95969045,"about_ca_system_score_codex":0.00062020845,"about_ca_system_score_gemma":0.00062370935,"threshold_uncertainty_score":0.99967635},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016108168,0.0004255886,0.99226344,0.0008709874,0.0013691107,0.0011468531,0.000012878654,0.0001823334,0.0021180024],"genre_scores_gemma":[0.40861326,0.000017311266,0.59073925,0.00014096953,0.00037845524,0.000018548235,0.000002940613,0.000038353428,0.00005093172],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944192,0.00014636945,0.0011146968,0.0017229436,0.0012554367,0.0013413272],"domain_scores_gemma":[0.9937011,0.0018269363,0.0006080128,0.0029333995,0.000503642,0.00042689862],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002730048,0.0008200913,0.0010264602,0.00070782175,0.0006268901,0.000736241,0.007471321,0.0002909153,0.000026072192],"category_scores_gemma":[0.00017332127,0.000555778,0.00050996634,0.0010933587,0.0018137023,0.0006808209,0.0118726045,0.0010281231,0.00004266231],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028988958,0.000096948206,0.00015743867,0.000044377546,0.00004096691,0.000020000722,0.0025365753,0.027301123,0.00040916944,0.005871398,0.00003656977,0.96345645],"study_design_scores_gemma":[0.000306191,0.000876643,0.004010714,0.00037229416,0.000012341308,0.000119272336,7.567397e-7,0.49581268,0.00058081927,0.49679053,0.00017039222,0.0009473794],"about_ca_topic_score_codex":0.000102566555,"about_ca_topic_score_gemma":0.00011249709,"teacher_disagreement_score":0.96250904,"about_ca_system_score_codex":0.0008541155,"about_ca_system_score_gemma":0.00072772155,"threshold_uncertainty_score":0.9996894},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008401214,0.00030113113,0.99213874,0.0021464808,0.00023045157,0.0010197791,0.000004410039,0.0000843044,0.004066273],"genre_scores_gemma":[0.009560509,0.000054236345,0.9883998,0.00091846095,0.00018862246,0.00008548086,0.0000032715207,0.00002478358,0.0007648592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753785,0.000054403234,0.0003480173,0.0009479615,0.00063218724,0.00047956017],"domain_scores_gemma":[0.99768513,0.0006636166,0.00014734689,0.0010611576,0.00024262969,0.00020010326],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008404039,0.0003585503,0.00029551575,0.00029476586,0.00087547186,0.0012307554,0.002011949,0.00012773926,0.000008117488],"category_scores_gemma":[0.000023046714,0.00022250693,0.00005192945,0.00046693193,0.00054709543,0.00073571835,0.0006123355,0.00051846483,0.000034648314],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010585478,0.000008707912,0.0000057456173,0.000016617149,0.000007100187,0.000008118195,0.0005077971,0.0022680864,0.0003485765,0.027947115,0.000034168064,0.9688374],"study_design_scores_gemma":[0.0008304167,0.00055994117,0.00059195905,0.00048514185,0.000032599866,0.00019114703,7.7411676e-7,0.65064186,0.0032188108,0.30630213,0.03578447,0.0013607709],"about_ca_topic_score_codex":0.00003184552,"about_ca_topic_score_gemma":0.000048990667,"teacher_disagreement_score":0.9674766,"about_ca_system_score_codex":0.00008101471,"about_ca_system_score_gemma":0.000245584,"threshold_uncertainty_score":0.99980605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024189614,0.00026708457,0.9956625,0.00004398185,0.00020187348,0.00083112804,0.000040464256,0.00009081499,0.00044319272],"genre_scores_gemma":[0.026765823,0.00007407318,0.9720296,0.0001943309,0.0006131537,0.000021328658,0.000014292102,0.00008690868,0.0002004439],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826735,0.000009365851,0.00028218157,0.0007982722,0.00023045405,0.00041237296],"domain_scores_gemma":[0.9990609,0.00015956612,0.00021353136,0.00041391968,0.000068628004,0.00008341008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021206953,0.00039779884,0.0004362456,0.00026834436,0.00020122383,0.00015193937,0.00038121213,0.00013294147,0.000056567107],"category_scores_gemma":[0.000003437827,0.00036566413,0.00008750435,0.00015023882,0.00049662846,0.00023618249,0.000099782555,0.00029801836,8.2611905e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045957306,0.000030509815,0.00040734338,0.000043358377,0.00003612512,0.000005155055,0.0004890541,0.009540555,0.03927327,0.008356091,0.000004675057,0.94176793],"study_design_scores_gemma":[0.001248766,0.00058633316,0.000053697673,0.0007458752,0.000028075528,0.000015386693,2.3689526e-7,0.1265206,0.13048822,0.73796874,0.0010653776,0.0012786777],"about_ca_topic_score_codex":0.0000602164,"about_ca_topic_score_gemma":0.0000011303273,"teacher_disagreement_score":0.94048923,"about_ca_system_score_codex":0.0001961678,"about_ca_system_score_gemma":0.00026469197,"threshold_uncertainty_score":0.99987954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007232995,0.00027766707,0.9933879,0.0008541809,0.0031562564,0.001539378,0.0000062568906,0.00020536782,0.0005006718],"genre_scores_gemma":[0.027055323,0.000030489608,0.967332,0.001534719,0.001100572,0.0001288011,0.000034015913,0.00007076811,0.002713305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960174,0.00004630327,0.0006873398,0.0014278803,0.0010780203,0.0007430685],"domain_scores_gemma":[0.997435,0.00038184776,0.00044061392,0.001224488,0.0003681978,0.00014986304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010546928,0.00053591956,0.00044808528,0.0004626993,0.0007445373,0.00052074494,0.002988432,0.00028080976,0.00002002798],"category_scores_gemma":[0.00012901974,0.0003768072,0.00016256711,0.0005272707,0.00033595302,0.0005018598,0.0007898769,0.0004691103,0.000059254922],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012135081,0.000049786016,0.00017171731,0.000097373544,0.000030489393,0.000033203156,0.0025507517,0.0045209685,0.00007881903,0.026340902,0.00023273322,0.9658811],"study_design_scores_gemma":[0.0015951161,0.00041962793,0.00090600736,0.0010918733,0.000032856206,0.00019657737,0.0000012154503,0.7610486,0.0036407225,0.054091837,0.17484593,0.0021296463],"about_ca_topic_score_codex":0.000019193796,"about_ca_topic_score_gemma":0.00013118837,"teacher_disagreement_score":0.9637515,"about_ca_system_score_codex":0.00039983357,"about_ca_system_score_gemma":0.0009674706,"threshold_uncertainty_score":0.9998684},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063658906,0.0003802765,0.98588455,0.0009853067,0.0023666134,0.00038807822,0.000012401832,0.000097517404,0.0035193625],"genre_scores_gemma":[0.872206,0.00007498872,0.12562606,0.00092520687,0.0006983843,0.000025626952,0.000013676616,0.00003439656,0.00039570616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532264,0.000057369274,0.0007340544,0.0017904947,0.0014455452,0.00064989756],"domain_scores_gemma":[0.9967194,0.0016781343,0.00019424323,0.00089286076,0.0003383755,0.00017698522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005352826,0.0005131344,0.00048401207,0.0010469237,0.00022102363,0.00077259267,0.0039714617,0.00031200887,0.00020595973],"category_scores_gemma":[0.00049267587,0.0005291849,0.00012646231,0.000712818,0.0006562755,0.00087167154,0.0014417317,0.0009989053,0.00039884305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009585925,0.0003104138,0.0017345833,0.00001535901,0.000032023945,0.000107344145,0.010305602,0.38214427,0.000041389656,0.04629474,0.00002209718,0.5589826],"study_design_scores_gemma":[0.000091870614,0.000054395845,0.0003520976,0.00050320855,0.0000057732586,0.000015478561,0.0000023360383,0.7409476,0.00016754425,0.257338,0.00005907107,0.00046263618],"about_ca_topic_score_codex":0.0004352175,"about_ca_topic_score_gemma":0.0004386513,"teacher_disagreement_score":0.8658401,"about_ca_system_score_codex":0.00033764687,"about_ca_system_score_gemma":0.0005917663,"threshold_uncertainty_score":0.999716},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007857663,0.00013909601,0.99827105,0.00025768243,0.00035205594,0.00061846926,0.000014400381,0.00012786475,0.00021154169],"genre_scores_gemma":[0.038185216,0.000027344482,0.9612965,0.00015694753,0.00015583925,0.000024410976,0.000005795352,0.000019372657,0.00012855309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978079,0.00002126144,0.00042328754,0.0011734172,0.00032606596,0.0002480546],"domain_scores_gemma":[0.9974357,0.00030795424,0.00040879502,0.0015519338,0.00018406915,0.000111561705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007980289,0.00026963837,0.00032035715,0.0005036229,0.00016807835,0.0001318206,0.0017264882,0.00021358693,0.000010559141],"category_scores_gemma":[0.000046996593,0.00025969913,0.00007817933,0.00037778442,0.0001928007,0.00052037253,0.0006630724,0.0003041151,0.0000029725252],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010314326,0.000018053428,0.0000011726548,0.000032958564,0.000005305787,0.0000012582583,0.000060678474,0.0006755858,0.011762233,0.0019711037,0.000017604605,0.9854437],"study_design_scores_gemma":[0.00019678811,0.00024535356,0.00003879245,0.00007722608,0.000015955386,0.00003806774,6.2278524e-8,0.7821313,0.09963347,0.11468734,0.002656867,0.0002787323],"about_ca_topic_score_codex":0.00017899284,"about_ca_topic_score_gemma":0.00010268866,"teacher_disagreement_score":0.985165,"about_ca_system_score_codex":0.00009366638,"about_ca_system_score_gemma":0.0003272569,"threshold_uncertainty_score":0.9999855},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037003567,0.00025287506,0.9895411,0.00024990662,0.0010456602,0.0002535793,0.000016498576,0.000495883,0.008107503],"genre_scores_gemma":[0.32517335,0.000044891272,0.6730278,0.00034671224,0.0007559139,0.00002912535,0.000043735294,0.00009616921,0.00048227786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985862,0.000004621694,0.0002826974,0.00042566465,0.00030111952,0.00039969318],"domain_scores_gemma":[0.9991755,0.00026647764,0.00005829096,0.0003383458,0.00011889568,0.000042513573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018663939,0.00028177624,0.00028813782,0.00047128877,0.00015502944,0.00014769241,0.00038533795,0.00033666426,0.000017029257],"category_scores_gemma":[0.00006333765,0.00027063212,0.00008698406,0.00023112123,0.0003865569,0.00018164219,0.00010638526,0.0003881287,0.000014300487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018920546,0.00004450916,0.000112278256,0.00039035414,0.000054202195,0.00007635103,0.00032322793,0.6684782,0.0014412155,0.1197693,0.004030547,0.20526089],"study_design_scores_gemma":[0.0003296665,0.00012592037,0.000032761618,0.0002455723,0.000030486231,0.00008014552,0.0000013413429,0.7921824,0.046120305,0.15340915,0.0066013513,0.0008408792],"about_ca_topic_score_codex":0.000010500587,"about_ca_topic_score_gemma":0.000038863014,"teacher_disagreement_score":0.32513633,"about_ca_system_score_codex":0.000423262,"about_ca_system_score_gemma":0.000072391376,"threshold_uncertainty_score":0.9999746},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006707482,0.0004035457,0.99654394,0.0002709994,0.00055413647,0.00021692613,7.019995e-7,0.0002395533,0.0010994595],"genre_scores_gemma":[0.18483274,0.0001420754,0.8140714,0.00065171096,0.0001788191,0.000005096012,0.000002332155,0.00002318235,0.000092619535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980319,0.000016183878,0.00030866102,0.0008187666,0.00047705634,0.00034740067],"domain_scores_gemma":[0.9981595,0.00092949177,0.00014852766,0.0006062404,0.00007557534,0.000080651706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011500645,0.0002762181,0.0002611162,0.0008568551,0.00008035012,0.00027234634,0.0011029469,0.0002592097,0.0000058148325],"category_scores_gemma":[0.00021190438,0.00026018443,0.000032314187,0.000491656,0.00017760012,0.0006990189,0.0006461385,0.00063187745,0.0000051737466],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003404323,0.000014393834,0.0008894146,0.000030383539,0.0000020831535,0.0000692621,0.00040160518,0.0060405475,0.000079162346,0.012706361,0.000011672836,0.9797517],"study_design_scores_gemma":[0.00041851526,0.00038353272,0.008120245,0.0012178301,0.0000063472826,0.00017359192,2.2166708e-7,0.6714224,0.0033890707,0.3033844,0.010190345,0.0012935085],"about_ca_topic_score_codex":0.000051038285,"about_ca_topic_score_gemma":0.000041059422,"teacher_disagreement_score":0.9784582,"about_ca_system_score_codex":0.00018427931,"about_ca_system_score_gemma":0.00011680854,"threshold_uncertainty_score":0.99998504},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03191798,0.000033996927,0.9660329,0.00038750787,0.00037249294,0.0010662763,0.000013059037,0.00017025869,0.000005475903],"genre_scores_gemma":[0.3930768,4.757424e-7,0.60557306,0.0011678911,0.00007778228,0.000084819,0.000009844363,0.000008947109,3.88607e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973727,0.00008630616,0.00041616333,0.00065711804,0.00080770545,0.0006600149],"domain_scores_gemma":[0.99840325,0.00042985042,0.00023863667,0.00042308684,0.00029806764,0.0002071006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013705549,0.00024407882,0.00020473177,0.00041141507,0.00028964705,0.00037545728,0.00085250975,0.000062820975,0.00001677444],"category_scores_gemma":[0.00019300586,0.00020701719,0.00004245654,0.0013299148,0.000503784,0.0012403626,0.00018729111,0.00016046026,0.0000028706722],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016521099,0.00008824835,0.004615573,0.000051216884,0.000008223581,0.000007131086,0.0022025343,0.032067884,0.04783611,0.00020977348,0.000010390822,0.9128864],"study_design_scores_gemma":[0.00066695386,0.00011515072,0.002349029,0.000093596886,0.000005078334,0.00006858132,0.0000031350098,0.7924107,0.20337331,0.000654521,0.0000072834464,0.00025267206],"about_ca_topic_score_codex":0.000034057914,"about_ca_topic_score_gemma":0.000009755748,"teacher_disagreement_score":0.9126337,"about_ca_system_score_codex":0.00027071327,"about_ca_system_score_gemma":0.0005616721,"threshold_uncertainty_score":0.8441916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005486,0.00019718343,0.9927414,0.00037244454,0.00043785022,0.0003503753,0.00001886891,0.00004164561,0.0052916007],"genre_scores_gemma":[0.5452214,0.00010679275,0.4533639,0.00091695896,0.000100617835,0.000022620956,0.0000042044658,0.000054896187,0.00020863193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969144,0.00007193842,0.00051958516,0.00090941833,0.0010641366,0.0005205172],"domain_scores_gemma":[0.99632156,0.001349334,0.00030989666,0.0016292401,0.00028217954,0.00010781352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092781376,0.00036955587,0.0005123205,0.0007073046,0.00021341811,0.000060298284,0.0039007992,0.00019554915,0.000025115894],"category_scores_gemma":[0.00008882083,0.00027194436,0.0001803094,0.0010121557,0.0020016658,0.0003367137,0.00040755997,0.0007867331,0.000017025945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043322772,0.0000991384,0.000029235916,0.000058811704,0.00003424189,0.00003420171,0.0024761197,0.0023402243,0.00043175908,0.87429124,0.000017071983,0.120144606],"study_design_scores_gemma":[0.0003011572,0.00022981763,0.000057188034,0.00047666757,0.000009513759,0.000053191066,8.977729e-7,0.02080176,0.0018157067,0.97589296,0.00007093271,0.0002902013],"about_ca_topic_score_codex":0.000022672055,"about_ca_topic_score_gemma":0.000033001208,"teacher_disagreement_score":0.5446728,"about_ca_system_score_codex":0.00006916152,"about_ca_system_score_gemma":0.00031850606,"threshold_uncertainty_score":0.9999733},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026046048,0.00033942825,0.9889513,0.00052896683,0.003299914,0.0009799625,0.0000045870356,0.00018323101,0.0054521426],"genre_scores_gemma":[0.34382993,0.000265791,0.6449988,0.0015099216,0.0038604753,0.00022072872,0.000009850742,0.0005010632,0.0048034247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965788,0.000024146677,0.0007646292,0.0008250332,0.0010788863,0.0007284707],"domain_scores_gemma":[0.991814,0.0054723485,0.00057686906,0.0016845419,0.0003056879,0.00014651028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094541244,0.0005710806,0.0006273119,0.00042233182,0.00059557776,0.000441161,0.0023066325,0.00033781922,0.00004125274],"category_scores_gemma":[0.0020564438,0.0003931097,0.00016894493,0.0006960097,0.0007872182,0.00021522368,0.0009775003,0.00081130804,0.0001457263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002447142,0.000044324574,0.000013591032,0.00012782517,0.000015880176,0.000019226822,0.00036972828,0.0012216844,0.0000034332018,0.857151,0.00041418723,0.1406167],"study_design_scores_gemma":[0.00016906332,0.00008010852,0.000006103424,0.00020713692,0.00001840275,0.000019752928,3.3339734e-7,0.03883728,0.00021040118,0.950051,0.0099541275,0.00044629007],"about_ca_topic_score_codex":0.000011771944,"about_ca_topic_score_gemma":0.00017490104,"teacher_disagreement_score":0.3439525,"about_ca_system_score_codex":0.00039219647,"about_ca_system_score_gemma":0.00020554899,"threshold_uncertainty_score":0.99985206},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023320727,0.0010259735,0.9923014,0.0005507331,0.00089303125,0.0006201345,0.00001683439,0.00017614558,0.0020836936],"genre_scores_gemma":[0.5583382,0.00012589192,0.43939415,0.0011414293,0.0008297019,0.000017707127,0.00009395469,0.000038255625,0.00002068152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99528325,0.00006447801,0.0005635992,0.0019947917,0.0014908131,0.00060308],"domain_scores_gemma":[0.99764085,0.00027201872,0.0003548382,0.0011294754,0.00038155494,0.0002212443],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021042735,0.0005298711,0.00048546848,0.00084545166,0.00041890203,0.0012535304,0.0019614412,0.00028754008,0.000034721652],"category_scores_gemma":[0.00006499545,0.00053915207,0.000108992135,0.00070260256,0.0005663401,0.0016504051,0.0015803084,0.00083693146,0.00002027269],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010652438,0.000049173716,0.00026727072,0.00006516411,0.00002445371,0.000021049167,0.0017694428,0.05694831,0.0000761896,0.10734416,0.00002249007,0.8334016],"study_design_scores_gemma":[0.00039913665,0.00007217915,0.00034204448,0.00021030712,0.000017999982,0.00004146537,2.1849358e-7,0.66458,0.00008701949,0.33335865,0.0004460247,0.0004449889],"about_ca_topic_score_codex":0.000045450546,"about_ca_topic_score_gemma":0.00042659664,"teacher_disagreement_score":0.8329567,"about_ca_system_score_codex":0.00025976045,"about_ca_system_score_gemma":0.00034392302,"threshold_uncertainty_score":0.9997833},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029287979,0.00024609754,0.98857754,0.0037638796,0.0011447904,0.00058350374,0.000004015357,0.0009422218,0.0018091276],"genre_scores_gemma":[0.5373463,0.000067171226,0.45981523,0.0017496906,0.00039819427,0.000017744065,0.000002229787,0.000057256697,0.00054617546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944025,0.000025984107,0.0005169703,0.0022225739,0.0015642601,0.0012676899],"domain_scores_gemma":[0.996577,0.00017019831,0.00033229665,0.002375475,0.00031858092,0.00022644197],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005894111,0.00084796915,0.00073342124,0.001101101,0.0004864979,0.0005602973,0.006775195,0.0005030209,0.000004777887],"category_scores_gemma":[0.00006936483,0.00070753804,0.00009774571,0.0015407718,0.0005701788,0.0008783813,0.0023631686,0.0014666067,0.00010009733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019494626,0.000034528814,0.0004852013,0.000045130677,0.000034598295,0.00040447697,0.002686879,0.17486681,0.00008455143,0.005564488,0.0005348821,0.81523895],"study_design_scores_gemma":[0.0016795791,0.0029334773,0.0025555287,0.0043825624,0.000038097933,0.002114561,0.000005840878,0.92505527,0.009851143,0.029442435,0.015898142,0.0060433773],"about_ca_topic_score_codex":0.00004081215,"about_ca_topic_score_gemma":0.00008819924,"teacher_disagreement_score":0.8091956,"about_ca_system_score_codex":0.0005058921,"about_ca_system_score_gemma":0.00061771617,"threshold_uncertainty_score":0.9995376},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004947454,0.00038627902,0.99339485,0.00020530788,0.0011130571,0.00050337036,0.0000035035803,0.000302523,0.0040416066],"genre_scores_gemma":[0.081835695,0.000064655826,0.91640496,0.0009706265,0.00041053913,0.000017055225,0.000022662574,0.000061203325,0.00021258192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953788,0.00009492159,0.00063549407,0.0020610392,0.00094858825,0.00088115694],"domain_scores_gemma":[0.9969265,0.000508611,0.00047310183,0.0015739079,0.00025631022,0.00026159314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008586896,0.00073627464,0.00069810275,0.0005918427,0.00042696283,0.00072435045,0.0021462578,0.00052981864,0.000019586905],"category_scores_gemma":[0.000042517237,0.000716095,0.000120244615,0.0009041865,0.00079115696,0.0006190235,0.0009794057,0.00079277135,0.000009226712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074416603,0.000030095545,0.000017612345,0.000033642005,0.000008313513,0.000031662494,0.00022481689,0.8134657,0.0000023174769,0.012920867,0.000009047824,0.17324844],"study_design_scores_gemma":[0.00035480654,0.00011384416,0.000028564196,0.00034532417,0.000014475933,0.00006619094,8.178228e-8,0.99159557,0.0000559072,0.0065296725,0.00013515401,0.00076039566],"about_ca_topic_score_codex":0.00003462344,"about_ca_topic_score_gemma":0.000018412567,"teacher_disagreement_score":0.17812984,"about_ca_system_score_codex":0.00030196604,"about_ca_system_score_gemma":0.00041961184,"threshold_uncertainty_score":0.999529},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000105948115,0.00019083286,0.9978486,0.00017984082,0.0006537418,0.00065385795,0.000007058899,0.00021364348,0.00014648068],"genre_scores_gemma":[0.089595,0.00004429468,0.9094802,0.00023221703,0.00014127744,0.000015523876,0.00007478675,0.00004803504,0.00036863866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514824,0.00011916735,0.00062235317,0.001799557,0.0015742057,0.00073647354],"domain_scores_gemma":[0.9971673,0.00025962124,0.00038885695,0.0012771324,0.00063028577,0.0002767872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072959263,0.000628641,0.00059720495,0.00090647984,0.000386998,0.00095911446,0.0020148284,0.00032313258,0.000030050143],"category_scores_gemma":[0.000051166637,0.0005051394,0.00010792397,0.00069196115,0.0004889052,0.00062398193,0.00075481227,0.00075207156,0.000061652776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052955224,0.000024807501,0.000007807858,0.000018923685,0.000010980891,0.000073052346,0.00009009146,0.43462464,0.00004750793,0.00053032814,0.0000018915874,0.56456465],"study_design_scores_gemma":[0.0004995451,0.0003631585,0.00017177641,0.00022857035,0.000010690915,0.00026326784,9.818648e-8,0.9931109,0.00028582418,0.0043900143,0.000053389667,0.00062276784],"about_ca_topic_score_codex":0.00005242681,"about_ca_topic_score_gemma":0.000099633595,"teacher_disagreement_score":0.5639419,"about_ca_system_score_codex":0.0005227737,"about_ca_system_score_gemma":0.00028839006,"threshold_uncertainty_score":0.99974},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027383107,0.00026050652,0.99094385,0.0021041199,0.0004816227,0.0008167347,0.000003890925,0.00018305043,0.002467896],"genre_scores_gemma":[0.75790876,0.000046242974,0.23563653,0.0058780275,0.00035490922,0.000025852196,0.0000444289,0.00003866762,0.00006656382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649316,0.000083161845,0.00054355344,0.0011919688,0.0011449005,0.000543227],"domain_scores_gemma":[0.9970103,0.00025513978,0.00056902826,0.0014237363,0.0006267969,0.00011502675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005309916,0.0005498637,0.00052301824,0.0005104362,0.00029667973,0.0003837134,0.004089957,0.0002786388,0.000007307695],"category_scores_gemma":[0.0000037531995,0.00034252479,0.00008992109,0.001516072,0.00046521603,0.0006305046,0.0006982514,0.00068021327,0.000013950866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005508993,0.00012119357,0.0004174621,0.000158854,0.0000429473,0.000022349905,0.0035673964,0.06756586,0.0004656054,0.008420492,0.00000698973,0.9191558],"study_design_scores_gemma":[0.0012296108,0.0016651188,0.001781932,0.0021914751,0.00009730641,0.0002714672,0.000003444574,0.9065343,0.006195798,0.07357132,0.004859288,0.0015989408],"about_ca_topic_score_codex":0.00012288535,"about_ca_topic_score_gemma":0.0016199995,"teacher_disagreement_score":0.9175568,"about_ca_system_score_codex":0.00008965135,"about_ca_system_score_gemma":0.00043138055,"threshold_uncertainty_score":0.99990267},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001706764,0.00045859267,0.9887011,0.00053644105,0.0002500584,0.0006620557,0.000022814605,0.00006738034,0.0091309],"genre_scores_gemma":[0.45955706,0.00027734923,0.53949773,0.00027446105,0.00013058387,0.00005566844,0.000033229146,0.000023039202,0.00015086899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685496,0.00005650675,0.00068434863,0.0011709643,0.00078811526,0.00044512303],"domain_scores_gemma":[0.9979511,0.00028770257,0.00033943742,0.00074847805,0.00056407606,0.000109205204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042704996,0.00039260928,0.0005169738,0.00073643867,0.0002398825,0.00008907126,0.0015188834,0.00030188993,0.0000068372015],"category_scores_gemma":[0.000013931069,0.00038681904,0.00010045755,0.00089934055,0.00090382935,0.0009133962,0.0005899739,0.00068369025,0.000013449456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011488412,0.00019013199,0.000073211355,0.000036942896,0.000013945424,0.000039559003,0.002091733,0.49244714,0.00033243175,0.43916687,0.000083688756,0.065512836],"study_design_scores_gemma":[0.00030332236,0.00015431787,0.00045403247,0.00039416205,0.0000036538866,0.000060444912,8.022824e-7,0.8164641,0.000422977,0.18106288,0.00028279994,0.00039647357],"about_ca_topic_score_codex":0.00006944139,"about_ca_topic_score_gemma":0.0002082159,"teacher_disagreement_score":0.45938638,"about_ca_system_score_codex":0.00051455485,"about_ca_system_score_gemma":0.00075714674,"threshold_uncertainty_score":0.9998584},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021460304,0.0003846052,0.9947651,0.00012438088,0.0008314894,0.00069569435,0.0000234497,0.0001193255,0.0030344664],"genre_scores_gemma":[0.033069856,0.000020668103,0.96579933,0.00037579588,0.00034467323,0.00004875228,0.000029530287,0.00003693052,0.00027443303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621993,0.000025928164,0.0004942306,0.0018343376,0.0006851183,0.0007404817],"domain_scores_gemma":[0.99755085,0.00036060959,0.00027515236,0.0014907115,0.0001583554,0.00016434374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084196916,0.00052738393,0.0005735634,0.00078617415,0.00020525236,0.00042921034,0.004223601,0.00031950904,0.000009700848],"category_scores_gemma":[0.00008074515,0.00044706924,0.00013554348,0.00048511062,0.0004020336,0.0007565327,0.0020501057,0.0006449029,0.00000943825],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017730206,0.00008173447,0.00011839302,0.00009778254,0.00000661436,0.000040795538,0.0006017423,0.003644278,0.000018582974,0.05778606,0.000113715585,0.9374726],"study_design_scores_gemma":[0.00047614236,0.00021625422,0.0003078066,0.00031122743,0.000005096956,0.000032155724,1.7652232e-7,0.86191314,0.00021222251,0.13114671,0.0046651955,0.0007138458],"about_ca_topic_score_codex":0.00009530116,"about_ca_topic_score_gemma":0.000066975546,"teacher_disagreement_score":0.9367587,"about_ca_system_score_codex":0.00020204409,"about_ca_system_score_gemma":0.0003406506,"threshold_uncertainty_score":0.9997981},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007955349,0.00022387372,0.9948467,0.000095967116,0.00030214753,0.00062246,0.0000075630956,0.00030580352,0.0027999748],"genre_scores_gemma":[0.49542794,0.00017785041,0.5038349,0.00017844196,0.00023547148,0.000038377766,0.000009011974,0.00006438938,0.000033645105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986191,0.000003450615,0.00031731257,0.0004037903,0.0003370131,0.0003193537],"domain_scores_gemma":[0.9992724,0.00011724327,0.00006029521,0.00045806373,0.000053205647,0.000038805985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011352803,0.000272638,0.00029237973,0.0003398353,0.0000360545,0.00002692062,0.0005461038,0.00021251,0.00009804761],"category_scores_gemma":[0.000017760914,0.00024739394,0.000047974267,0.00027409586,0.00036546777,0.00010435142,0.00011504752,0.0005169783,0.000023469458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045557335,0.0000034322843,0.0000046767796,0.000021173057,0.000004382202,0.000004190978,0.000023950532,0.45308292,0.00004975412,0.0018756241,0.000002457243,0.5449229],"study_design_scores_gemma":[0.00059031777,0.0010926356,0.00013313032,0.0008923961,0.000017944789,0.000015862406,6.5705564e-7,0.54091865,0.037741218,0.41465458,0.00290616,0.0010364513],"about_ca_topic_score_codex":0.0000023040054,"about_ca_topic_score_gemma":0.000023214021,"teacher_disagreement_score":0.5438864,"about_ca_system_score_codex":0.00012977092,"about_ca_system_score_gemma":0.0000508934,"threshold_uncertainty_score":0.99999785},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036985584,0.00036225948,0.9855194,0.0004930842,0.00106964,0.00048612588,0.00002069189,0.00026591512,0.011745904],"genre_scores_gemma":[0.19514018,0.00006562882,0.79321104,0.010121719,0.0011149757,0.000021555392,0.000023634548,0.00008478444,0.00021649312],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952896,0.000030602096,0.00050873955,0.0018793226,0.0013352302,0.0009564689],"domain_scores_gemma":[0.9965459,0.00046592555,0.00030636415,0.002095697,0.00029528758,0.00029082317],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010586082,0.0006517187,0.00061451475,0.0013201456,0.00029814485,0.0014857518,0.0060826372,0.0003532011,0.00006263396],"category_scores_gemma":[0.000028157117,0.00051841955,0.00015042248,0.001206854,0.0010184891,0.0018005269,0.0015484515,0.0010275437,0.00005066003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079883954,0.00009275807,0.0010572838,0.00008587052,0.00004836583,0.0004683862,0.0006139762,0.0086956285,0.000035633046,0.20555013,0.00011628969,0.7831558],"study_design_scores_gemma":[0.0035148286,0.001273591,0.0025529466,0.0014380153,0.00006560871,0.0005287447,4.332966e-7,0.24145503,0.003977525,0.70822084,0.032975197,0.003997251],"about_ca_topic_score_codex":0.000041252653,"about_ca_topic_score_gemma":0.00024156549,"teacher_disagreement_score":0.77915853,"about_ca_system_score_codex":0.00013794935,"about_ca_system_score_gemma":0.00046230186,"threshold_uncertainty_score":0.9997267},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010779248,0.00027396446,0.9711935,0.0014856694,0.0013552272,0.00041152645,0.0000038041703,0.00010857432,0.014388488],"genre_scores_gemma":[0.98123235,0.000012146421,0.0134259835,0.0007029364,0.00019741869,0.00004528119,0.000009265753,0.00004197359,0.004332672],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9972428,0.00018433823,0.0003855042,0.0011811949,0.00045714766,0.000549026],"domain_scores_gemma":[0.9987074,0.00032988985,0.00019057667,0.00046632098,0.00017544173,0.00013036876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080087804,0.00039194728,0.00042973645,0.0007848867,0.00018290675,0.00017786682,0.0007170068,0.0002980834,0.00028220782],"category_scores_gemma":[0.00015486695,0.00036390798,0.00008212934,0.00038360365,0.00037133438,0.000070506394,0.00026560065,0.0013907378,0.00022373364],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001796696,0.00005819737,0.0046284474,0.000022673097,0.00001799953,0.00006255257,0.0052278065,0.017375248,0.00009434495,0.013720524,0.000010060411,0.9587642],"study_design_scores_gemma":[0.0027824342,0.004042398,0.55495507,0.012085047,0.00011490348,0.00025820485,0.000095597374,0.24635078,0.00007206791,0.15909524,0.014857575,0.005290683],"about_ca_topic_score_codex":0.00018668921,"about_ca_topic_score_gemma":0.0007628903,"teacher_disagreement_score":0.9704531,"about_ca_system_score_codex":0.00034172146,"about_ca_system_score_gemma":0.00023565447,"threshold_uncertainty_score":0.99988127},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000497037,0.00076060416,0.9945641,0.00015883555,0.0025283373,0.0007155572,0.000004651345,0.00018291689,0.0010352775],"genre_scores_gemma":[0.14890558,0.000099310484,0.8489239,0.00061788637,0.00037831307,0.000032237727,0.0000061227793,0.00006298266,0.0009736353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953099,0.00007259008,0.0007795888,0.0018676317,0.0012530813,0.0007172443],"domain_scores_gemma":[0.9973882,0.00015042315,0.00046117333,0.0016622596,0.00009964881,0.00023829834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001101194,0.00062686176,0.0006038867,0.00065363536,0.00033034102,0.00046315457,0.0022347874,0.00035946872,0.000015775384],"category_scores_gemma":[0.0000129229,0.0005737086,0.00018637702,0.0002750579,0.0002151681,0.0004930422,0.0006950408,0.0005695529,0.00020824591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016597409,0.000039772312,0.000018197385,0.00010629767,0.000014322738,0.0000757932,0.00069738185,0.93475235,0.00009993099,0.015222663,0.000014585244,0.048957076],"study_design_scores_gemma":[0.0003193026,0.000057224832,0.000008459618,0.00046041494,0.00000854708,0.00006475276,3.1401217e-7,0.9930928,0.00049977034,0.0017874565,0.0030921437,0.000608851],"about_ca_topic_score_codex":0.000051565105,"about_ca_topic_score_gemma":0.000008414162,"teacher_disagreement_score":0.14885587,"about_ca_system_score_codex":0.0009898258,"about_ca_system_score_gemma":0.00019365043,"threshold_uncertainty_score":0.99967146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48954657,0.000011891444,0.51011544,0.000011093298,0.00014526332,0.000093649454,2.2015942e-7,0.00007321104,0.0000026524103],"genre_scores_gemma":[0.92911756,0.000001120066,0.07071311,0.00006711936,0.00008489688,0.000005669378,0.0000010606195,0.000009387033,5.3236757e-8],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922425,0.00001172374,0.00014117981,0.00022191653,0.00019987318,0.00020108298],"domain_scores_gemma":[0.99956757,0.00010816842,0.00001960577,0.00021963054,0.0000454487,0.000039582406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014872443,0.000097000084,0.00008693081,0.0001677439,0.00020638072,0.00006773542,0.00021540916,0.00003311666,0.000002663009],"category_scores_gemma":[0.000033748893,0.00009686994,0.000019818359,0.0010524532,0.00008187482,0.00016736217,0.00002025719,0.00012901548,0.0000035367098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.398119e-7,0.000055515644,0.023299184,0.0000032148653,0.0000010513864,0.0000021735552,0.0006233944,0.93439764,0.021525748,0.0000025634956,5.158497e-7,0.020088539],"study_design_scores_gemma":[0.00013222112,0.000021601405,0.10030109,0.000011007119,0.0000021967016,0.000012764637,0.0000018398637,0.8807672,0.01844979,0.00019742755,0.0000016451105,0.00010118292],"about_ca_topic_score_codex":0.000047987523,"about_ca_topic_score_gemma":0.000027205933,"teacher_disagreement_score":0.43957102,"about_ca_system_score_codex":0.00012098358,"about_ca_system_score_gemma":0.000034536424,"threshold_uncertainty_score":0.39502415},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023200431,0.00039873188,0.9978076,0.00015276487,0.00048649055,0.0004587285,0.000054717806,0.00022207796,0.00018684664],"genre_scores_gemma":[0.8990231,0.000030271494,0.10007459,0.0004169726,0.00032683954,0.000003212247,0.0000368136,0.00004511151,0.000043050368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864966,0.000009361703,0.00025885037,0.0004911267,0.00024878499,0.00034222557],"domain_scores_gemma":[0.99920404,0.00024708323,0.0000675404,0.00027337298,0.00012200589,0.00008595986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020490283,0.00033554036,0.0003500275,0.00026075437,0.00011387992,0.00014013925,0.00025146536,0.0002341883,0.000004951789],"category_scores_gemma":[0.0000561234,0.0003037122,0.000064320964,0.00009939849,0.00021318861,0.000092110575,0.000041665993,0.00040823393,0.0000020431405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026163339,0.0000016110553,0.0000020137177,0.000033458386,0.000007788483,0.000005849977,0.0002134897,0.4236646,0.00024612714,0.00011167729,0.000006176478,0.5757046],"study_design_scores_gemma":[0.00017090375,0.0000736541,0.0001891074,0.00022064219,0.0000134146,0.000028714614,1.3485777e-7,0.96250564,0.0020616162,0.03364594,0.0007283498,0.00036188742],"about_ca_topic_score_codex":0.000004926965,"about_ca_topic_score_gemma":0.00003543495,"teacher_disagreement_score":0.89879113,"about_ca_system_score_codex":0.00015570757,"about_ca_system_score_gemma":0.000053657433,"threshold_uncertainty_score":0.9999415},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047858027,0.000041744468,0.9952706,0.00020249521,0.00047069075,0.00023465508,0.00008081322,0.000042019667,0.0031783897],"genre_scores_gemma":[0.9939269,0.0000032342236,0.004968206,0.000116169904,0.00052601815,0.000008832372,0.0002078731,0.000025068035,0.0002177028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983219,0.000006185577,0.0003062674,0.0006246715,0.00035466332,0.00038633056],"domain_scores_gemma":[0.9989896,0.000090998874,0.00015753228,0.0005227335,0.0001315098,0.000107619264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035682766,0.0002670462,0.00024004113,0.00015594513,0.00020116665,0.00013049539,0.0006053968,0.00012126106,0.00019098533],"category_scores_gemma":[0.000005940149,0.0002482321,0.00009631496,0.00026747785,0.00023899449,0.000077570556,0.00020621046,0.0004477972,0.00013522968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018883302,0.000028351307,0.000028398923,0.000004511871,0.000007335342,0.0000015687066,0.00006394296,0.00018642216,0.00009520907,0.8346376,0.00003071616,0.16491406],"study_design_scores_gemma":[0.00009505786,0.000028125673,0.000045871933,0.000074714895,0.000011272713,0.0000015751997,1.7107956e-7,0.1776352,0.0008510351,0.81431234,0.0066670063,0.00027761684],"about_ca_topic_score_codex":0.000036531525,"about_ca_topic_score_gemma":0.000006861415,"teacher_disagreement_score":0.9934483,"about_ca_system_score_codex":0.00009035309,"about_ca_system_score_gemma":0.00016036339,"threshold_uncertainty_score":0.999997},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018814912,0.000119710596,0.9896891,0.0010977674,0.005815816,0.00033701953,0.0000012038693,0.00031041953,0.0024408144],"genre_scores_gemma":[0.6830214,0.000020823307,0.31019697,0.0039121713,0.0016141313,0.000013206538,0.000035952115,0.00006832495,0.0011170163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638015,0.00007137373,0.0005171068,0.0014696181,0.0010908679,0.0004708686],"domain_scores_gemma":[0.9973148,0.00056873995,0.0004326474,0.0012145727,0.00032155638,0.00014766591],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001138375,0.00045948694,0.00038198906,0.00087384606,0.0003884501,0.00069168047,0.0016360391,0.00047239615,0.00002492454],"category_scores_gemma":[0.00012001733,0.0004397163,0.00013580434,0.0007443153,0.00032844988,0.00059180445,0.0004149819,0.00075442856,0.00012609034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009512991,0.000014345232,0.0000347321,0.000023968716,0.0000039778297,0.000008491178,0.00021157718,0.4412064,0.00016509161,0.021538608,0.00004946493,0.5367338],"study_design_scores_gemma":[0.00031866223,0.00020908217,0.0004703032,0.00030118492,0.000008796548,0.000024126506,5.9554647e-8,0.8916597,0.0010181323,0.10274385,0.0027426956,0.0005034188],"about_ca_topic_score_codex":0.000037167512,"about_ca_topic_score_gemma":0.00009721327,"teacher_disagreement_score":0.68283325,"about_ca_system_score_codex":0.00044414116,"about_ca_system_score_gemma":0.00042153144,"threshold_uncertainty_score":0.99980545},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035705554,0.0003964075,0.99420947,0.00080064463,0.0014703914,0.0005217465,0.0000033585602,0.00011270347,0.002128229],"genre_scores_gemma":[0.05347684,0.00009380739,0.94306564,0.0030783857,0.0000869178,0.000008679774,0.0000036556592,0.0000475384,0.00013852165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99515563,0.00012861435,0.0007940802,0.001673495,0.0013297629,0.00091843156],"domain_scores_gemma":[0.99714863,0.00026622956,0.00030667346,0.0017523406,0.00028371654,0.00024241797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021035688,0.00054757553,0.00059738423,0.0019172323,0.00022525397,0.00085350237,0.0046035443,0.00042255112,0.000038931605],"category_scores_gemma":[0.00020646855,0.0005362929,0.00015112259,0.0013173393,0.00048983993,0.0009794008,0.0022176784,0.001356733,0.00001965303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057915267,0.00007123399,0.0003627204,0.00007038224,0.0000150341775,0.0002028267,0.0015061777,0.8100151,0.00015530831,0.050296806,0.000019614783,0.13727902],"study_design_scores_gemma":[0.00044612674,0.00007386457,0.000047161197,0.00054127787,0.0000028289974,0.0000660413,3.228882e-7,0.77594674,0.0002819375,0.22185962,0.00020198243,0.0005321364],"about_ca_topic_score_codex":0.000044921824,"about_ca_topic_score_gemma":0.0001842695,"teacher_disagreement_score":0.1715628,"about_ca_system_score_codex":0.0004933009,"about_ca_system_score_gemma":0.000625162,"threshold_uncertainty_score":0.99970883},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032238083,0.00015747662,0.9925504,0.0008582145,0.0010835447,0.0026551136,0.0000074967866,0.00033401678,0.0020313703],"genre_scores_gemma":[0.49132648,0.000032237316,0.50635874,0.0011887723,0.000321475,0.0003259872,0.00003661169,0.000042423457,0.0003672581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614626,0.00016047106,0.0007342717,0.0014292585,0.00097253517,0.00055719045],"domain_scores_gemma":[0.9973572,0.00066137523,0.00032722935,0.001021766,0.0004836483,0.00014878542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015952613,0.000461645,0.000528345,0.0014879096,0.00046411168,0.00083383074,0.0017263594,0.00032443603,0.000009632804],"category_scores_gemma":[0.00018730584,0.0004612118,0.00009400488,0.0009377015,0.00019846788,0.0008859045,0.0006676637,0.0008274663,0.000035926245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009065311,0.000049764403,0.00008480894,0.000011518057,0.0000040342275,0.00001859908,0.000519686,0.7741084,0.0010196976,0.002822671,0.00021479586,0.22113693],"study_design_scores_gemma":[0.00037183362,0.0001475542,0.0016568692,0.00073497894,0.000008377756,0.000031183965,3.7232198e-7,0.96766263,0.006691723,0.021155996,0.0009349817,0.00060349365],"about_ca_topic_score_codex":0.00020880096,"about_ca_topic_score_gemma":0.0003991825,"teacher_disagreement_score":0.49100408,"about_ca_system_score_codex":0.0009898352,"about_ca_system_score_gemma":0.0004208652,"threshold_uncertainty_score":0.99978393},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020313125,0.00004443875,0.99203575,0.0022486628,0.0002818599,0.00037739836,0.0000014625219,0.000030306488,0.004777008],"genre_scores_gemma":[0.968166,0.000042239823,0.028955199,0.0024739804,0.00015366422,0.000020512593,0.0000028179693,0.00001616644,0.00016942706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832445,0.00001829542,0.00035153585,0.00054728513,0.00047419636,0.00028420502],"domain_scores_gemma":[0.99834025,0.0005131605,0.00017138688,0.0008514395,0.000079890786,0.00004386006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005599791,0.00021396637,0.0002363282,0.0003006616,0.00011220694,0.00011970034,0.0021014507,0.00012409009,0.000009329411],"category_scores_gemma":[0.000023428098,0.00014534255,0.000065482425,0.00056251086,0.00029495303,0.00017261795,0.00026368108,0.00039519454,0.000010421388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016180755,0.000010653755,0.0000094898805,0.000010288254,0.000001241238,0.0000017849133,0.00018412786,0.058164716,0.00004226509,0.5512414,0.00002998974,0.39030242],"study_design_scores_gemma":[0.00007898036,0.0000829493,0.00007545984,0.00020265361,0.0000013823076,0.00000494015,3.2134675e-8,0.64100045,0.0011998969,0.35618585,0.000995108,0.00017228609],"about_ca_topic_score_codex":0.0000123100635,"about_ca_topic_score_gemma":0.00008561743,"teacher_disagreement_score":0.96796286,"about_ca_system_score_codex":0.00006368102,"about_ca_system_score_gemma":0.000098003344,"threshold_uncertainty_score":0.5926897},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008685006,0.00032389135,0.9771139,0.0021724864,0.0014982854,0.0006125701,0.0000015216003,0.00007421911,0.01733464],"genre_scores_gemma":[0.9472492,0.000043718017,0.05074049,0.0009668019,0.0002123829,0.000032818596,0.000007436186,0.000015331956,0.0007318648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977365,0.00008104915,0.00035751102,0.00082187174,0.0006755134,0.00032755095],"domain_scores_gemma":[0.99873203,0.00022900396,0.00019674837,0.0006218289,0.00016567427,0.00005470591],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011018149,0.00027153332,0.0002734241,0.0004863935,0.0003182615,0.0012102794,0.0017013525,0.00011597506,0.0000025316144],"category_scores_gemma":[0.000018810237,0.00020530574,0.000031882068,0.0006521064,0.0002446172,0.00045840343,0.00046030973,0.0003763968,0.000013622324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000966083,0.000105464766,0.0036261969,0.00033248143,0.000018685072,0.00022830146,0.007635177,0.06840646,0.000028880791,0.6359769,0.0003599372,0.28327182],"study_design_scores_gemma":[0.0013620537,0.00035206962,0.02043594,0.00264376,0.000039077397,0.00027345066,0.0004108287,0.92674446,0.0002442246,0.020678742,0.024969967,0.0018454331],"about_ca_topic_score_codex":0.00010451825,"about_ca_topic_score_gemma":0.00023491317,"teacher_disagreement_score":0.9463807,"about_ca_system_score_codex":0.00026473668,"about_ca_system_score_gemma":0.0002590726,"threshold_uncertainty_score":0.99982655},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008713414,0.00021090862,0.97015965,0.00082654844,0.00046628897,0.0003367056,0.0000048417182,0.00026497146,0.027642943],"genre_scores_gemma":[0.7156423,0.000078929996,0.2791982,0.00307031,0.0007469944,0.00002260339,0.000015036288,0.00007532462,0.0011503211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966014,0.000024078763,0.0004952448,0.0012143862,0.00091878616,0.0007461266],"domain_scores_gemma":[0.9976049,0.00042917926,0.00024570656,0.0012909446,0.00022341443,0.00020586881],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004986686,0.00050801225,0.00045580292,0.0006909047,0.00045297286,0.0006135495,0.0026987563,0.00023172278,0.000014830542],"category_scores_gemma":[0.00005444113,0.0004139653,0.000121408724,0.0008261543,0.0005696293,0.00096196594,0.00033521611,0.00077374635,0.000049817183],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012313559,0.000035034667,0.0005088454,0.000042061925,0.000014675139,0.00024926712,0.0013894055,0.027878003,0.00005784778,0.023663452,0.00003118972,0.94612896],"study_design_scores_gemma":[0.0011905652,0.00047019628,0.0005687108,0.0013599207,0.00002722154,0.0011921752,7.8823865e-7,0.87303376,0.0004774381,0.10098073,0.018800732,0.0018977606],"about_ca_topic_score_codex":0.00003405731,"about_ca_topic_score_gemma":0.00036166006,"teacher_disagreement_score":0.9442312,"about_ca_system_score_codex":0.00022001912,"about_ca_system_score_gemma":0.0004565353,"threshold_uncertainty_score":0.9998312},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001969008,0.00013553802,0.96939373,0.0135135865,0.0025572141,0.00084549893,0.0000418408,0.001335442,0.011980259],"genre_scores_gemma":[0.055606093,0.00003376142,0.9310307,0.006127527,0.0007681756,0.00007061175,0.000022441009,0.000100968355,0.006239741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9894634,0.000029681501,0.0009672896,0.0037612189,0.0038788025,0.0018996343],"domain_scores_gemma":[0.99314946,0.00055806036,0.00030172948,0.0039666677,0.0014149,0.00060918386],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013691217,0.0011406353,0.0011377938,0.0021287657,0.00048447563,0.0011073896,0.013336426,0.0007768264,0.00012446844],"category_scores_gemma":[0.0014775897,0.0010975656,0.00026341158,0.0024287498,0.0008311726,0.00074952136,0.009543957,0.0017970758,0.0006979061],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012559756,0.000046514877,0.000016401862,0.000035082565,0.00002828699,0.00044206285,0.0018412205,0.043450635,0.00047758024,0.008406131,0.010539259,0.93470424],"study_design_scores_gemma":[0.0010218068,0.0016855443,0.0013141995,0.0030722348,0.000038980226,0.00079397927,0.0000014828316,0.52545327,0.030822441,0.23300825,0.19568218,0.007105643],"about_ca_topic_score_codex":0.000043035496,"about_ca_topic_score_gemma":0.00011957486,"teacher_disagreement_score":0.9275986,"about_ca_system_score_codex":0.0007107769,"about_ca_system_score_gemma":0.0008390393,"threshold_uncertainty_score":0.99992955},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001350909,0.0004790876,0.99328524,0.00030570128,0.002865003,0.0010488478,0.000021456173,0.0003089441,0.0015506588],"genre_scores_gemma":[0.3746844,0.000009094017,0.62251496,0.00084095035,0.0010413612,0.000032950917,0.000020650952,0.00006624824,0.0007893912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942079,0.00004150431,0.0009986947,0.0022398052,0.0015026679,0.0010094042],"domain_scores_gemma":[0.9950349,0.0016693057,0.0005811794,0.0019664809,0.0005949851,0.00015318992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013279076,0.0007204609,0.0007899107,0.0018400525,0.00040367106,0.0009855578,0.0042267605,0.0005325389,0.000009024159],"category_scores_gemma":[0.0002787569,0.0007128377,0.0002765811,0.0012521049,0.00035177,0.0009179952,0.0012879184,0.00065853604,0.000041013227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049353885,0.000015902078,0.000034981025,0.00004774734,0.000007737473,0.00002284725,0.00011571613,0.8143278,0.00003554024,0.0041732476,0.00008435836,0.18112923],"study_design_scores_gemma":[0.00042870734,0.00014033691,0.000055471894,0.0003494897,0.000009959401,0.00003623699,3.5315715e-8,0.9533453,0.00013816773,0.037310194,0.007398504,0.00078757195],"about_ca_topic_score_codex":0.000024737566,"about_ca_topic_score_gemma":0.000030935218,"teacher_disagreement_score":0.3745493,"about_ca_system_score_codex":0.0007478194,"about_ca_system_score_gemma":0.0005962911,"threshold_uncertainty_score":0.9995323},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010572391,0.00048247984,0.9882135,0.00031189254,0.00005341288,0.00029735485,0.000024786968,0.0000053625054,0.00003882632],"genre_scores_gemma":[0.87235135,0.00009328005,0.12610343,0.0008567228,0.00028941358,0.00004084835,0.00016160046,0.00001620532,0.000087179615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872833,0.000009751008,0.00020133883,0.00069204223,0.00013992738,0.0002285763],"domain_scores_gemma":[0.9995452,0.00003195079,0.000063442094,0.00022272697,0.00007932438,0.00005736678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029670875,0.00017663793,0.00018734888,0.00014841362,0.0000731212,0.000045163626,0.00024267634,0.00019902151,0.000001725443],"category_scores_gemma":[0.00005338514,0.00016637026,0.00005339404,0.00013917184,0.000040725037,0.000010191841,0.00016154838,0.00013003555,0.0000020388134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023384282,0.000017773422,0.00008240576,0.000038947084,0.000015513278,0.0000034601385,0.00013873582,0.25692979,0.18528,0.00022627322,0.0000071542045,0.5572366],"study_design_scores_gemma":[0.00011463359,0.00008100692,0.0000178838,0.000045694494,0.0000105335275,0.0000066923985,1.2061544e-7,0.95164305,0.04267607,0.004500842,0.00067455735,0.00022891913],"about_ca_topic_score_codex":0.000018099983,"about_ca_topic_score_gemma":0.000048434358,"teacher_disagreement_score":0.8621101,"about_ca_system_score_codex":0.000059038284,"about_ca_system_score_gemma":0.000032721116,"threshold_uncertainty_score":0.67843825},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025293108,0.00017633461,0.9878194,0.0010796078,0.00075981906,0.00018347136,0.000004171536,0.00013091606,0.009821012],"genre_scores_gemma":[0.13607682,0.00011886949,0.859158,0.0038632476,0.0003227471,0.000003371569,0.000021551226,0.00002645578,0.0004089612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978093,0.000014983183,0.0003252891,0.0008971609,0.0005989965,0.00035428198],"domain_scores_gemma":[0.9988151,0.00027227652,0.00016172198,0.0004637499,0.00014204276,0.00014509443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000491217,0.00029585575,0.00025950634,0.0008352393,0.00025896527,0.00045042599,0.000786335,0.00017330697,0.000046082092],"category_scores_gemma":[0.000018615663,0.0003013151,0.00005328682,0.00032501173,0.0006232822,0.0005308077,0.0005533559,0.0004604782,0.000023358642],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025535019,0.0000069194384,0.00019711282,0.000015929229,0.000006715215,0.000059880756,0.0002072777,0.024450451,0.000040226034,0.08983792,0.00001020144,0.8851648],"study_design_scores_gemma":[0.0002850068,0.000053450767,0.0017074512,0.00017495066,0.000005979145,0.00026567176,1.3868085e-7,0.7362208,0.00028282808,0.2591516,0.0013280251,0.00052409497],"about_ca_topic_score_codex":0.0000075743637,"about_ca_topic_score_gemma":0.00004266962,"teacher_disagreement_score":0.8846407,"about_ca_system_score_codex":0.00015240427,"about_ca_system_score_gemma":0.00016853207,"threshold_uncertainty_score":0.9999439},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011272608,0.00071560126,0.99342525,0.00074053777,0.0010875409,0.00036930596,0.000006624901,0.002259171,0.0012832384],"genre_scores_gemma":[0.06991727,0.00019605263,0.9248983,0.004309698,0.00015840428,0.00006545737,0.0000049387922,0.0000648493,0.0003850161],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957508,0.00007682295,0.0006592483,0.0017740618,0.00090365653,0.0008354127],"domain_scores_gemma":[0.99577427,0.0019086301,0.00029732857,0.0016491706,0.00019914295,0.00017146919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001246385,0.00064972666,0.00063943746,0.0014363694,0.00018270656,0.000563489,0.003303803,0.00029693646,0.000014792163],"category_scores_gemma":[0.0007709268,0.00059803866,0.00012941688,0.0010856864,0.00049212977,0.0005154662,0.0010907801,0.0010399413,0.000028959532],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031968561,0.000053443735,0.0017623882,0.000034627436,0.0000052106557,0.0004137159,0.0005558921,0.015309648,0.0000038929006,0.001763738,0.0003459201,0.9797483],"study_design_scores_gemma":[0.00020413577,0.00014253915,0.0005421765,0.00063889165,0.0000033708297,0.00008735077,1.3904143e-8,0.2801848,0.00032452104,0.7158982,0.00122933,0.0007446249],"about_ca_topic_score_codex":0.000136009,"about_ca_topic_score_gemma":0.00013664123,"teacher_disagreement_score":0.9790037,"about_ca_system_score_codex":0.00029947187,"about_ca_system_score_gemma":0.00033041672,"threshold_uncertainty_score":0.9996471},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029295308,0.0010379388,0.9934807,0.0001256883,0.00059515866,0.00035276293,0.0000038950393,0.00031470848,0.0011596464],"genre_scores_gemma":[0.5425023,0.0003071047,0.4565338,0.00011347161,0.00021758021,0.000009203555,0.0000070202464,0.000024909115,0.000284665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973471,0.00007628862,0.00059977925,0.0009509694,0.00066244847,0.00036339188],"domain_scores_gemma":[0.9980072,0.000810422,0.00040876877,0.0005102162,0.00016088635,0.0001025052],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001751091,0.0003706401,0.00084360514,0.0011377212,0.00020107965,0.00029201305,0.0007839818,0.00021806314,0.0000025841036],"category_scores_gemma":[0.00016618113,0.00030834787,0.00007912937,0.00056317716,0.0009509299,0.00044643471,0.0006324704,0.00057546515,0.0000014576491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081342405,0.000020060574,0.0006939908,0.0001300885,0.00002298879,0.000017094664,0.00047594344,0.08411152,0.000034874385,0.0011605337,0.00001251772,0.91323906],"study_design_scores_gemma":[0.004732406,0.00013390189,0.0009538894,0.00033494784,0.000016310536,0.000085722524,5.4851576e-8,0.989036,0.00010292883,0.00425984,0.00006288395,0.0002810752],"about_ca_topic_score_codex":0.000071569804,"about_ca_topic_score_gemma":0.000002440061,"teacher_disagreement_score":0.91295797,"about_ca_system_score_codex":0.000055382494,"about_ca_system_score_gemma":0.00013353021,"threshold_uncertainty_score":0.9999369},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003761436,0.0003679811,0.99316865,0.00040023893,0.0011107329,0.0003865985,0.000005090094,0.00023755406,0.004285523],"genre_scores_gemma":[0.24587373,0.000092445356,0.75240064,0.0006048445,0.0005497557,0.000033035878,0.000028444849,0.000039572646,0.00037753454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971184,0.000029018527,0.00042809607,0.0013970955,0.00054483407,0.00048256962],"domain_scores_gemma":[0.99824977,0.00018131989,0.00025833963,0.0009125881,0.00028814582,0.000109819375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096257316,0.0003779568,0.00035292603,0.00066192937,0.00037793667,0.00040659218,0.0022375444,0.0002629599,0.0000069067996],"category_scores_gemma":[0.00011000605,0.00035009472,0.000110149245,0.0004374937,0.00019786097,0.0007667454,0.0003861935,0.0005887459,0.000022181255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009540995,0.000018751889,0.0000819659,0.000046867164,0.0000047664525,0.0000023510622,0.0004476005,0.07204303,0.00008443253,0.14791422,0.000015252687,0.7793312],"study_design_scores_gemma":[0.00012613929,0.000097619006,0.000020403546,0.000106148116,0.000005317133,0.000013151562,5.5218425e-8,0.71328264,0.000153965,0.28355202,0.0023343647,0.00030817653],"about_ca_topic_score_codex":0.00006046322,"about_ca_topic_score_gemma":0.0001463108,"teacher_disagreement_score":0.77902305,"about_ca_system_score_codex":0.00016774783,"about_ca_system_score_gemma":0.0003476467,"threshold_uncertainty_score":0.9998951},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008003886,0.000008455831,0.9950711,0.0030116395,0.00032678584,0.0006065247,7.7597167e-7,0.00015242885,0.0000219051],"genre_scores_gemma":[0.42886975,5.7487927e-7,0.5699542,0.0010317867,0.000067780944,0.000068448695,0.00000366711,0.0000024452895,0.0000012970644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984567,0.000031202202,0.00027378756,0.00047188316,0.0004856641,0.000280746],"domain_scores_gemma":[0.9988498,0.00033665943,0.000114098526,0.00037896482,0.00023634703,0.00008412309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006431828,0.00010631547,0.00009976533,0.00021742689,0.00015744797,0.00048949715,0.00086288655,0.000051330513,0.00001635323],"category_scores_gemma":[0.00033847225,0.000091594135,0.000032878335,0.0008429939,0.000087162945,0.0020485776,0.0001549929,0.000094712545,0.000011432029],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020525256,0.000032700198,0.00043188626,0.000013313466,0.000001967906,8.258706e-7,0.00062058476,0.0056958133,0.011883368,0.012718963,0.00012508366,0.96847343],"study_design_scores_gemma":[0.0001700028,0.00007076797,0.0040871613,0.000013190903,6.7560933e-7,0.0000045252277,1.95575e-7,0.8412072,0.031060606,0.12327061,0.000011155717,0.00010391566],"about_ca_topic_score_codex":0.000047045207,"about_ca_topic_score_gemma":0.000010419894,"teacher_disagreement_score":0.96836954,"about_ca_system_score_codex":0.00010559139,"about_ca_system_score_gemma":0.00015449672,"threshold_uncertainty_score":0.47202325},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007482539,0.0013292234,0.9894006,0.000043076652,0.0006013549,0.00020824789,0.000009292689,0.00014055926,0.00078511],"genre_scores_gemma":[0.71711576,0.0001781768,0.2812541,0.0001947007,0.00067941827,0.0000057001103,0.0000107014475,0.00007083135,0.00049060374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983478,0.0000036485833,0.00030512086,0.00051910256,0.00033206027,0.000492235],"domain_scores_gemma":[0.9992923,0.00015464933,0.000058231082,0.00029119413,0.00008650682,0.00011712943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035505556,0.00033141504,0.00039854375,0.0008852866,0.00015347106,0.0003104884,0.0004397641,0.00020739008,0.000053494245],"category_scores_gemma":[0.00003708357,0.00029840335,0.0000986676,0.00039357608,0.00013107034,0.0002634262,0.00012631727,0.0004363071,0.000019677384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042925376,0.0000040735636,0.0000151613895,0.00013303236,0.000029079145,0.0000050625363,0.00023042841,0.73602647,0.0003280616,0.00017398864,0.00002353771,0.26302683],"study_design_scores_gemma":[0.00013116321,0.000044772416,0.000015976051,0.00013821098,0.000024628933,0.000014618786,1.9340129e-7,0.9797526,0.00039964306,0.018893994,0.00022729326,0.00035688584],"about_ca_topic_score_codex":0.000016263984,"about_ca_topic_score_gemma":0.00001176238,"teacher_disagreement_score":0.70963323,"about_ca_system_score_codex":0.00017626511,"about_ca_system_score_gemma":0.00005330159,"threshold_uncertainty_score":0.99994683},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17841451,0.00008087929,0.8197645,0.0011356686,0.00022542205,0.00027408797,0.0000016899289,0.00009397223,0.000009257493],"genre_scores_gemma":[0.45732877,0.000009818554,0.541786,0.000836598,0.000022993016,0.000009824652,0.0000015166153,0.0000033564174,0.0000011341822],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99801195,0.00009088442,0.00037622626,0.0006225638,0.00058462925,0.0003137748],"domain_scores_gemma":[0.9988547,0.0002310152,0.00016132335,0.00046615457,0.00016321405,0.00012359099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048838696,0.00016882627,0.0002304797,0.00023855551,0.000085005166,0.00041969257,0.0009297053,0.00005785862,0.000051303396],"category_scores_gemma":[0.00009088643,0.00013908345,0.000025988806,0.0006494194,0.000503262,0.0016150627,0.00059191097,0.00016054914,0.0000139404965],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012811023,0.000044360302,0.006083642,0.00001677623,0.0000046281125,0.000006567917,0.0021967946,0.0007096664,0.15439533,0.000016919797,0.00008065445,0.83644336],"study_design_scores_gemma":[0.00025040787,0.00009944629,0.029589446,0.000053534455,0.000002248137,0.000006015274,0.000002754855,0.38510832,0.5768514,0.0078624375,0.0000017606549,0.00017221605],"about_ca_topic_score_codex":0.0008037904,"about_ca_topic_score_gemma":0.000019328112,"teacher_disagreement_score":0.83627117,"about_ca_system_score_codex":0.00006186267,"about_ca_system_score_gemma":0.00007713448,"threshold_uncertainty_score":0.56716585},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005595914,0.00019554526,0.9949786,0.00021295338,0.0026568107,0.0003745407,0.00001185118,0.00012044651,0.00088966935],"genre_scores_gemma":[0.010876636,0.000021664644,0.9876785,0.001004433,0.00030356104,0.0000046526748,0.000015879756,0.000017414182,0.0000772092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965122,0.000079921236,0.0006476542,0.0012097115,0.0009771573,0.00057335966],"domain_scores_gemma":[0.9971119,0.00041277712,0.00029013015,0.0018309169,0.00019108366,0.00016315273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026095014,0.00038050784,0.00042655948,0.0016204392,0.0002879351,0.0009728844,0.004501799,0.00027684553,0.000008344771],"category_scores_gemma":[0.00038563556,0.0003892104,0.000059629005,0.001253357,0.00019244068,0.0041538146,0.0025391045,0.00061553344,0.000025335585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000085169995,0.000013156855,0.00013005699,0.000043582826,0.000008742688,0.000041134343,0.006092625,0.13362995,0.0002645139,0.000250683,0.00015688888,0.85936016],"study_design_scores_gemma":[0.00016368873,0.00007505878,0.00023832911,0.00044941096,0.0000053359704,0.00014300614,8.158352e-7,0.99082327,0.0005585671,0.0032319517,0.003857669,0.00045290758],"about_ca_topic_score_codex":0.00020336646,"about_ca_topic_score_gemma":0.00015135953,"teacher_disagreement_score":0.8589072,"about_ca_system_score_codex":0.00041549667,"about_ca_system_score_gemma":0.00067703344,"threshold_uncertainty_score":0.999856},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015362797,0.00020867198,0.9963831,0.00014427186,0.0017264883,0.0007293665,0.00002462416,0.00018146168,0.00044844078],"genre_scores_gemma":[0.06685667,0.00002884491,0.93069184,0.00082699844,0.0010733211,0.000023708337,0.0000667281,0.000041065763,0.0003908395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634683,0.000040456027,0.000497259,0.0017163283,0.00080169056,0.0005974247],"domain_scores_gemma":[0.99790245,0.00029630717,0.00022538567,0.0010312862,0.00029963526,0.0002449452],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008801362,0.00051319896,0.00045701562,0.0008306137,0.00038280405,0.00072465034,0.0022490195,0.00031860836,0.000032499644],"category_scores_gemma":[0.000025043117,0.00049837644,0.00015755199,0.0005102323,0.0002697097,0.0010827341,0.0002517938,0.00046722736,0.000017474953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008918367,0.000040097573,0.0000018750718,0.000010248881,0.0000064287733,0.000011157216,0.00029919005,0.049290247,0.0003582232,0.00378577,0.000009845456,0.946178],"study_design_scores_gemma":[0.00044887944,0.0005061606,0.000060578204,0.000070611786,0.000008529627,0.00003840743,1.0118253e-7,0.92369115,0.0011760634,0.07134885,0.0020910983,0.0005595852],"about_ca_topic_score_codex":0.000013948794,"about_ca_topic_score_gemma":0.000030070805,"teacher_disagreement_score":0.9456184,"about_ca_system_score_codex":0.00022679387,"about_ca_system_score_gemma":0.0006400991,"threshold_uncertainty_score":0.9997468},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002055991,0.00039473062,0.9919916,0.00003110805,0.0020450144,0.00039602266,0.0000104356395,0.00033952604,0.002735599],"genre_scores_gemma":[0.9301208,0.000010470431,0.06884988,0.00008717569,0.00069670303,0.000013710715,0.0000036744455,0.00014768101,0.00006987553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975981,0.000011944611,0.00053208915,0.0007648888,0.00046342428,0.0006295456],"domain_scores_gemma":[0.9988011,0.00013694714,0.0000860914,0.00075142615,0.000089814894,0.00013462594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038898172,0.0005176623,0.00054137176,0.00082365,0.00005941012,0.00013000223,0.0011253849,0.00031438092,0.000024150613],"category_scores_gemma":[0.000020576426,0.0004740205,0.00005872575,0.00033600023,0.00023642452,0.00039186375,0.00015222412,0.00060446747,0.000030528474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001955222,0.0000063523526,0.00017243574,0.00017323482,0.0000064911314,0.000047044665,0.000427024,0.9494021,0.0007453601,0.0005492319,0.0000010681154,0.04846771],"study_design_scores_gemma":[0.00022763899,0.00003625936,0.0002729689,0.0017256334,0.000004546636,0.00006396606,2.8495774e-7,0.98993677,0.00079803594,0.005687162,0.0005183634,0.0007283762],"about_ca_topic_score_codex":0.000009822308,"about_ca_topic_score_gemma":0.000056301695,"teacher_disagreement_score":0.9280648,"about_ca_system_score_codex":0.0007476397,"about_ca_system_score_gemma":0.00018955443,"threshold_uncertainty_score":0.9997712},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025112664,0.00037451202,0.9772208,0.0005177513,0.0018124334,0.0006143263,0.000006418308,0.00048420395,0.018944455],"genre_scores_gemma":[0.016814342,0.00005411391,0.9813751,0.00081080274,0.00048701483,0.00003131371,0.000004758299,0.000048718914,0.0003738126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953891,0.00014245641,0.00066750695,0.002045121,0.0009779658,0.000777819],"domain_scores_gemma":[0.9965071,0.00042291524,0.00040292332,0.0020273535,0.00037963185,0.0002600942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019013851,0.00065802835,0.00073842495,0.0010141652,0.0003313259,0.0009500234,0.0038638776,0.00038471012,0.000028423001],"category_scores_gemma":[0.000051580366,0.0005856849,0.00012961379,0.0011599193,0.00027635845,0.00062531163,0.0013547174,0.000790167,0.000020891377],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004895907,0.000046465997,0.000012033583,0.000026504116,0.000014434378,0.0001622654,0.0015043804,0.019364484,0.0003080309,0.037875373,0.00006947018,0.94061166],"study_design_scores_gemma":[0.00028822524,0.00058283494,0.000037963746,0.00060578604,0.000009144373,0.0003112827,8.967642e-7,0.8722478,0.0094321845,0.09600011,0.019180985,0.0013027964],"about_ca_topic_score_codex":0.0000777605,"about_ca_topic_score_gemma":0.00012450438,"teacher_disagreement_score":0.9393089,"about_ca_system_score_codex":0.00044442003,"about_ca_system_score_gemma":0.00051386276,"threshold_uncertainty_score":0.9996595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013164164,0.00060034276,0.9916472,0.0003577781,0.0011242578,0.00032787514,0.0000029212413,0.0038056544,0.0021208264],"genre_scores_gemma":[0.07829445,0.000038619655,0.9201715,0.0008731374,0.00047748993,0.000018500996,0.000005464871,0.00003069966,0.000090147805],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698305,0.000025509864,0.0004331319,0.0012085874,0.0007501396,0.0005995514],"domain_scores_gemma":[0.99708813,0.00053717114,0.00031047477,0.001617839,0.00025652352,0.00018983192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007889556,0.00044024247,0.00038745612,0.0008011725,0.00026396126,0.0003333879,0.0026205047,0.0003384859,0.0000070423052],"category_scores_gemma":[0.00012037266,0.000418575,0.000112883274,0.0006548959,0.00080437993,0.00051512604,0.00085616176,0.00068553514,0.00005968016],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001036344,0.000013588202,0.00095394993,0.000016558964,0.0000046141317,0.0000070384085,0.00015159491,0.00048987806,0.000022443865,0.03367247,0.00013119767,0.96453565],"study_design_scores_gemma":[0.00011142208,0.00007607608,0.0004831036,0.00022342133,0.0000102996355,0.00039735637,1.4923176e-8,0.076600134,0.00044806438,0.9179512,0.0030001195,0.00069876097],"about_ca_topic_score_codex":0.000055760167,"about_ca_topic_score_gemma":0.000015004016,"teacher_disagreement_score":0.96383685,"about_ca_system_score_codex":0.00021296034,"about_ca_system_score_gemma":0.00042179634,"threshold_uncertainty_score":0.9998266},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016829383,0.0021208944,0.9888212,0.0015677958,0.0007767211,0.00018960495,0.000001907242,0.00019356655,0.006159996],"genre_scores_gemma":[0.43443206,0.00058360584,0.5583092,0.0038557693,0.00056350057,0.000004745241,0.0000039316656,0.000034913242,0.0022122953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975349,0.000021288435,0.00026554987,0.0011511976,0.00059017376,0.00043693715],"domain_scores_gemma":[0.9986564,0.00026665913,0.00013203235,0.0006833861,0.00013286222,0.00012868794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038104638,0.0003658225,0.00039976827,0.0006128561,0.00021161961,0.00028874344,0.00189725,0.00024069322,0.0000074190693],"category_scores_gemma":[0.000045354293,0.00032007662,0.00007755132,0.0003271519,0.00036183244,0.00071387494,0.00094079453,0.00047313786,0.000018513645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049767186,0.000018976209,0.000024276358,0.000017082324,0.0000126137675,0.00019431979,0.0004972417,0.006737065,0.00008043926,0.1446238,0.000026282412,0.84776294],"study_design_scores_gemma":[0.00021622896,0.00016785061,0.00047832873,0.00014147397,0.000011400097,0.000185037,1.985979e-7,0.7252674,0.0003253914,0.2711251,0.0015977285,0.00048384213],"about_ca_topic_score_codex":0.000010969304,"about_ca_topic_score_gemma":0.000024859773,"teacher_disagreement_score":0.8472791,"about_ca_system_score_codex":0.00012371597,"about_ca_system_score_gemma":0.0003195476,"threshold_uncertainty_score":0.99992514},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012199646,0.0002444796,0.99271506,0.0006707349,0.0041994527,0.00025299244,0.00000836222,0.00021188956,0.0015750186],"genre_scores_gemma":[0.076677464,0.000009069165,0.91917264,0.0022687952,0.0011025756,0.000015229687,0.000015013972,0.000034945337,0.0007042643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954208,0.00004686649,0.00061002513,0.0017231874,0.0013688534,0.0008302574],"domain_scores_gemma":[0.99714714,0.0008364549,0.0001765858,0.0010958548,0.00046832627,0.0002756544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070035167,0.00052284444,0.0005225833,0.00058703736,0.00032578534,0.00065712054,0.0039445343,0.00044900624,0.000030793588],"category_scores_gemma":[0.00020133718,0.00047485673,0.00013111281,0.00080048246,0.00083204516,0.0006416639,0.0014963977,0.0017724765,0.00012189301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003131115,0.000029765311,0.0000052324835,0.000012557835,0.0000063740877,0.000054778597,0.0005540034,0.6332378,0.00005995202,0.08201981,0.00011735789,0.28389925],"study_design_scores_gemma":[0.00013235706,0.000044143213,0.0000069192606,0.00008358608,0.000003453147,0.000033838223,9.773744e-8,0.64918876,0.000056018464,0.34974974,0.0003149624,0.00038611912],"about_ca_topic_score_codex":0.000033096814,"about_ca_topic_score_gemma":0.000042316464,"teacher_disagreement_score":0.28351313,"about_ca_system_score_codex":0.00024375573,"about_ca_system_score_gemma":0.001932507,"threshold_uncertainty_score":0.9997703},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016830569,0.00062476256,0.9965055,0.00006811995,0.0016569451,0.00066458376,0.00002093107,0.0001396431,0.00015119709],"genre_scores_gemma":[0.015508511,0.000016232194,0.98361397,0.00034304775,0.0003407867,0.0000150248425,0.0000101305795,0.000046037178,0.00010624536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954847,0.00006920922,0.00075348996,0.0017242086,0.0011536999,0.00081466185],"domain_scores_gemma":[0.9962876,0.0008104538,0.0004471352,0.0016189605,0.00061155984,0.00022432234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016607563,0.0005938368,0.00082454033,0.00094719825,0.0003945672,0.0003691037,0.0038590285,0.00035391128,0.000006310421],"category_scores_gemma":[0.000107547145,0.00055329216,0.00029577003,0.0004895278,0.0009630565,0.0005156092,0.000672924,0.0005550106,0.0000035580563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011299291,0.0000688458,0.0000019646993,0.000026901229,0.000010463047,0.000045098273,0.0011919148,0.102825634,0.0011268579,0.0014135294,0.000011640728,0.89326584],"study_design_scores_gemma":[0.0007125924,0.0004511313,0.00003969515,0.00022938849,0.0000125438455,0.00010145697,1.9866204e-7,0.98129773,0.0071459636,0.00869047,0.00069770357,0.0006211247],"about_ca_topic_score_codex":0.000044533623,"about_ca_topic_score_gemma":0.0000047644185,"teacher_disagreement_score":0.8926447,"about_ca_system_score_codex":0.00026822116,"about_ca_system_score_gemma":0.0005861495,"threshold_uncertainty_score":0.99969184},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02066504,0.0004988613,0.96944654,0.0035909642,0.003974117,0.000600592,0.00003205867,0.0010045035,0.0001873381],"genre_scores_gemma":[0.62364304,0.000041819872,0.37383568,0.0020031026,0.00033888945,0.00007416887,0.000029738154,0.000027732762,0.0000057928655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99381304,0.00018410565,0.0007728143,0.0026933723,0.0013849448,0.0011517295],"domain_scores_gemma":[0.992787,0.0006413925,0.00039095883,0.0056036147,0.00026202225,0.00031502062],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015572973,0.0007125015,0.00067224907,0.0007135857,0.00033728586,0.0025822383,0.014159046,0.00046661778,0.00011486397],"category_scores_gemma":[0.00044992377,0.0006454864,0.00017869103,0.002247863,0.0007638433,0.0013348818,0.01369022,0.0013795419,0.00009833783],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004120414,0.00026642266,0.00054439716,0.00008540411,0.000022936523,0.000075533935,0.0015047067,0.033493344,0.0017490537,0.0029387276,0.0033688361,0.9559465],"study_design_scores_gemma":[0.0003018566,0.00007191214,0.0016069002,0.0003234013,0.0000057311236,0.000049449834,6.887777e-7,0.84282345,0.004733683,0.14908491,0.00022365795,0.0007743727],"about_ca_topic_score_codex":0.0002493674,"about_ca_topic_score_gemma":0.00003412887,"teacher_disagreement_score":0.9551721,"about_ca_system_score_codex":0.0003443689,"about_ca_system_score_gemma":0.0006323516,"threshold_uncertainty_score":0.99959964},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040927352,0.0002928558,0.9913504,0.0001128269,0.0010145928,0.00059848005,0.000006142742,0.00010230145,0.0024296355],"genre_scores_gemma":[0.50028527,0.000012691524,0.49936172,0.00018495608,0.00007944631,0.000015522557,0.0000048937754,0.000019279703,0.00003625163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591887,0.000065321925,0.00093788025,0.0012933253,0.001113246,0.0006713765],"domain_scores_gemma":[0.9970282,0.00031839072,0.00055847876,0.0015553035,0.0004249605,0.00011467147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031856247,0.00038934866,0.00050067995,0.0019276128,0.00015255576,0.00014044104,0.0029798117,0.00035488754,0.00000932662],"category_scores_gemma":[0.0002854162,0.0003854346,0.00010117488,0.0019815185,0.00058130437,0.00031661525,0.00054762675,0.0007191633,0.000023454564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013702162,0.00023662315,0.00023716198,0.00018863683,0.0000075019793,0.000021016942,0.0058674617,0.08469157,0.00070456,0.62869817,0.0000025347085,0.2793311],"study_design_scores_gemma":[0.00025236572,0.00009079164,0.0022979584,0.0005198366,0.000005375543,0.000025440524,0.0000014287815,0.934211,0.0079081915,0.054066714,0.00015447068,0.0004663967],"about_ca_topic_score_codex":0.00002682403,"about_ca_topic_score_gemma":0.00007802446,"teacher_disagreement_score":0.84951943,"about_ca_system_score_codex":0.000337563,"about_ca_system_score_gemma":0.00054865325,"threshold_uncertainty_score":0.99985975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010220316,0.00029106706,0.99141425,0.0036839806,0.0012158728,0.00059553946,0.000003350098,0.00049828197,0.0022874472],"genre_scores_gemma":[0.09378729,0.00010033387,0.9001791,0.0016510511,0.00037126942,0.00009519058,0.000027178194,0.000056561494,0.0037320133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997418,0.000017878012,0.00029534777,0.0012476244,0.00053378346,0.0004873807],"domain_scores_gemma":[0.9982501,0.00020749439,0.00030193035,0.0008295058,0.00034160915,0.000069345464],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004275457,0.00041671548,0.00033421416,0.000810865,0.00033884804,0.0010793868,0.0019822,0.0004907637,0.000009686974],"category_scores_gemma":[0.000082898645,0.00038096806,0.000102251746,0.00078910484,0.0003640897,0.0011655552,0.00027843125,0.0005086085,0.000017300279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034384443,0.000016465996,0.00002315113,0.00003387323,0.000006850931,0.0000022931688,0.00020791499,0.0068446198,0.00044427358,0.61062187,0.0007038043,0.38109145],"study_design_scores_gemma":[0.00025896713,0.00021088659,0.000050628973,0.000077815705,0.000008246497,0.000026463047,0.0000010991589,0.17311838,0.00481138,0.79129636,0.029524788,0.0006149675],"about_ca_topic_score_codex":0.0000041198737,"about_ca_topic_score_gemma":0.00003847121,"teacher_disagreement_score":0.38047647,"about_ca_system_score_codex":0.00031220488,"about_ca_system_score_gemma":0.0005656017,"threshold_uncertainty_score":0.99995756},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002447936,0.00086157146,0.9922104,0.0023517932,0.00047899838,0.000617611,9.010945e-7,0.00012860353,0.00090220897],"genre_scores_gemma":[0.6414124,0.0003267766,0.35757956,0.0003244834,0.0002485269,0.000023463645,0.0000057803636,0.000037759124,0.000041243406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958142,0.00010179769,0.00060892105,0.0015687582,0.0010225099,0.0008838043],"domain_scores_gemma":[0.9963294,0.00055473036,0.0003168266,0.0023250328,0.00023085116,0.00024315165],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016665981,0.00052690564,0.0005945643,0.0010749828,0.00033554237,0.00082233635,0.003770855,0.00049417774,0.000012522434],"category_scores_gemma":[0.000055707063,0.00047305055,0.00005653518,0.0011621257,0.0012359496,0.00081630383,0.0017935679,0.0029097802,0.000008810545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015895794,0.00007101393,0.0009978045,0.000063287545,0.000019748248,0.00014466717,0.001006663,0.39702186,0.0012260273,0.07370486,0.0000031472698,0.525725],"study_design_scores_gemma":[0.0003587493,0.00011917627,0.0008745107,0.0006300768,0.000003047495,0.000107019405,2.738937e-7,0.9619028,0.0008896664,0.034489393,0.000056858986,0.0005684595],"about_ca_topic_score_codex":0.00011886003,"about_ca_topic_score_gemma":0.0017185459,"teacher_disagreement_score":0.6389645,"about_ca_system_score_codex":0.00036330734,"about_ca_system_score_gemma":0.0007139747,"threshold_uncertainty_score":0.99977213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012880311,0.000014703936,0.9848982,0.001304598,0.0002773706,0.00035603458,0.0000011961033,0.00024749624,0.000020060277],"genre_scores_gemma":[0.07199199,0.000013259378,0.9260988,0.0017873794,0.00007581883,0.000021226566,0.0000020956732,0.0000070857463,0.0000023183889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998143,0.000090691,0.0002667904,0.00068956485,0.00041182342,0.00039813505],"domain_scores_gemma":[0.99837744,0.00071868324,0.0001025062,0.00050939765,0.00013624082,0.00015574429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013938226,0.00016171517,0.00021866795,0.00014983841,0.00024870018,0.000557329,0.0011638086,0.00007310831,0.0000072825655],"category_scores_gemma":[0.00034326097,0.0001336475,0.000026784486,0.0007653081,0.00038263694,0.0007065408,0.00060910196,0.00013838575,0.0000097406555],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010176048,0.000034580564,0.000054393582,0.000014226084,0.0000014907764,0.0000025618588,0.00062735594,0.0025364622,0.020168401,0.00016679353,0.00005985292,0.9763237],"study_design_scores_gemma":[0.0006044268,0.00021811399,0.00029339228,0.000035967823,0.000001531128,0.000008792337,1.3091025e-7,0.94880193,0.041946087,0.007905726,0.000022137692,0.0001617613],"about_ca_topic_score_codex":0.00004770736,"about_ca_topic_score_gemma":0.0000034466186,"teacher_disagreement_score":0.97616196,"about_ca_system_score_codex":0.00004574275,"about_ca_system_score_gemma":0.00010778335,"threshold_uncertainty_score":0.5449987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022223475,0.00022567576,0.9927355,0.00029552143,0.0048682215,0.00060051505,0.000009813022,0.00026853287,0.0007740066],"genre_scores_gemma":[0.28087237,0.000011557885,0.71507174,0.0016207963,0.0020385585,0.000019940864,0.000016993838,0.00005202802,0.0002960142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967369,0.000029368552,0.0005372101,0.0012691161,0.00064746547,0.0007799627],"domain_scores_gemma":[0.9974541,0.0010814253,0.00033670457,0.0007327266,0.00021278474,0.00018225829],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007700024,0.0005485039,0.00049712515,0.00086067105,0.00039592257,0.00046261086,0.0017979494,0.00027726515,0.000008620139],"category_scores_gemma":[0.000070072434,0.0005135448,0.00020612332,0.0003376412,0.00032694996,0.00060244213,0.00080226595,0.00059621566,0.000045086013],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054680195,0.00002799735,0.000002577254,0.000022215476,0.000009888743,0.000004566675,0.00095012365,0.013947843,0.00004880619,0.0235234,0.000028468336,0.96142864],"study_design_scores_gemma":[0.00037277222,0.00027007586,0.000048569003,0.00030347295,0.000006769371,0.000032690717,3.8896732e-7,0.86045396,0.0011859656,0.13603677,0.00074576726,0.00054282654],"about_ca_topic_score_codex":0.000026358286,"about_ca_topic_score_gemma":0.00002733062,"teacher_disagreement_score":0.9608858,"about_ca_system_score_codex":0.000534902,"about_ca_system_score_gemma":0.00023393404,"threshold_uncertainty_score":0.9997316},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037006658,0.00021597471,0.993908,0.0010726579,0.0013180767,0.00031618026,0.000005641052,0.00017094331,0.0026224437],"genre_scores_gemma":[0.27858466,0.000018586741,0.71829563,0.0013112966,0.000845188,0.000011885987,0.000027242624,0.00003974621,0.00086576224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965505,0.00002568007,0.00037502518,0.0013959185,0.0011198494,0.00053301465],"domain_scores_gemma":[0.9980093,0.00038039533,0.00024432287,0.000888033,0.00028161472,0.0001962879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052930054,0.00049057987,0.0004087595,0.00088463596,0.0004055544,0.0006984221,0.0021482904,0.00029979373,0.000024843923],"category_scores_gemma":[0.00005067283,0.0004136351,0.00009014514,0.0007052909,0.00047312203,0.00074811396,0.0005225867,0.00093440944,0.000053816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016838878,0.000048189457,0.00018778337,0.000034644672,0.000030033347,0.0002107928,0.0011486342,0.16792507,0.0013900927,0.02769676,0.000043974207,0.80126715],"study_design_scores_gemma":[0.0008265868,0.0006584,0.0017422182,0.000646475,0.000026060814,0.0005223429,6.015448e-7,0.7480433,0.009497494,0.21830443,0.017721644,0.002010476],"about_ca_topic_score_codex":0.000018290988,"about_ca_topic_score_gemma":0.0003510532,"teacher_disagreement_score":0.7992567,"about_ca_system_score_codex":0.00014275886,"about_ca_system_score_gemma":0.0006695177,"threshold_uncertainty_score":0.99983156},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004878031,0.001022825,0.9901007,0.00077607203,0.00073982857,0.00038127974,0.000011811421,0.0001758552,0.0019136191],"genre_scores_gemma":[0.67367536,0.00006371833,0.324882,0.0006625253,0.00040190772,0.000008348925,0.000006034076,0.000041670453,0.00025843247],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965589,0.0000652752,0.0005892716,0.0012871809,0.0009061753,0.0005931931],"domain_scores_gemma":[0.9972562,0.0005986898,0.00037336367,0.0013947902,0.0001701209,0.00020684312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083740306,0.0005208197,0.0007655868,0.0005773811,0.00017969614,0.00039827463,0.0025239016,0.00034650357,0.0000619412],"category_scores_gemma":[0.000114139606,0.00044794165,0.00013478966,0.0003665121,0.002116049,0.0007042228,0.0017678039,0.0006495967,0.000038590417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008807646,0.000058028912,0.000071916016,0.00016184934,0.000027292203,0.00012710338,0.00093119225,0.00034574803,0.0013463696,0.43851212,0.000048045462,0.55836153],"study_design_scores_gemma":[0.00042421522,0.00027264678,0.0011969866,0.0006652078,0.000019927182,0.00035254238,0.0000013480246,0.35933578,0.004232568,0.6321529,0.00044911224,0.00089673937],"about_ca_topic_score_codex":0.00009606558,"about_ca_topic_score_gemma":0.00003046147,"teacher_disagreement_score":0.6687973,"about_ca_system_score_codex":0.000115255134,"about_ca_system_score_gemma":0.00023888258,"threshold_uncertainty_score":0.9997972},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033309194,0.00011320271,0.98385566,0.00014797256,0.0031192726,0.00030414658,0.0000025733855,0.000258141,0.008868124],"genre_scores_gemma":[0.77112967,0.000021293636,0.18127885,0.00086081884,0.0020400349,0.000019844847,0.000003811314,0.000084707855,0.044560958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99507755,0.0001142535,0.0006630107,0.0018860206,0.0013576465,0.0009014935],"domain_scores_gemma":[0.99746656,0.0005985408,0.0002906207,0.0010533518,0.00028805935,0.00030288112],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015529658,0.0006455513,0.00058882247,0.0010931882,0.00046507327,0.0011464857,0.0030412711,0.00032696978,0.00008801905],"category_scores_gemma":[0.00024095448,0.0005958342,0.00014617063,0.000498387,0.00034222146,0.0009412372,0.0017074209,0.0011507295,0.00024751457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002450906,0.000032014697,0.0003721642,0.000028686287,0.000024468722,0.00031379546,0.011691232,0.070438296,0.00040725767,0.68930817,0.00001689209,0.22734252],"study_design_scores_gemma":[0.0025609818,0.010960397,0.02416936,0.016929382,0.00010325197,0.001950589,0.00028750073,0.2486773,0.0077102478,0.27787954,0.39222118,0.016550269],"about_ca_topic_score_codex":0.0000571407,"about_ca_topic_score_gemma":0.000015925236,"teacher_disagreement_score":0.8025768,"about_ca_system_score_codex":0.00038967765,"about_ca_system_score_gemma":0.00079482276,"threshold_uncertainty_score":0.99989045},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008305521,0.0003531618,0.99586034,0.0003546847,0.001619102,0.0006835849,0.000011271432,0.0007147991,0.0003947286],"genre_scores_gemma":[0.008140364,0.000017044553,0.9908466,0.00023039513,0.00023806804,0.000048944872,0.000005888318,0.00004421755,0.00042848763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683523,0.000031876505,0.0005367526,0.0014271914,0.00054038706,0.0006285881],"domain_scores_gemma":[0.99691635,0.0011641239,0.00028406645,0.0012958009,0.000227905,0.00011176793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013300793,0.00050644204,0.00055912224,0.0006676951,0.00020473503,0.00028663402,0.0025784057,0.00035585868,0.0000012827752],"category_scores_gemma":[0.00018029391,0.00048916606,0.00014642035,0.00031151754,0.00025763662,0.0006907747,0.00049031456,0.0005148364,0.0000114533395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030171477,0.0000032277421,1.6307138e-7,0.0000527887,0.000003780389,0.0000058092187,0.00028904394,0.6566432,0.000111222835,0.04228616,0.0000027013864,0.3005989],"study_design_scores_gemma":[0.00014866218,0.00005497192,0.000002023932,0.00023280988,0.0000035132614,0.000039639344,1.4168504e-7,0.75715864,0.00019623069,0.2414728,0.00028654534,0.0004040213],"about_ca_topic_score_codex":0.0000012747925,"about_ca_topic_score_gemma":0.000024315757,"teacher_disagreement_score":0.30019486,"about_ca_system_score_codex":0.0009224623,"about_ca_system_score_gemma":0.00040536415,"threshold_uncertainty_score":0.999756},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032409845,0.00017234682,0.9952286,0.00031291414,0.0006265486,0.0005190997,0.0000060563434,0.00030702347,0.0025032999],"genre_scores_gemma":[0.043237925,0.000022691798,0.9555178,0.000503861,0.00026852966,0.00001722846,0.000005474507,0.000049133483,0.000377326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566764,0.000028293036,0.0005931187,0.0016370177,0.0012419809,0.0008319739],"domain_scores_gemma":[0.99728656,0.00014431759,0.00047734397,0.0015892513,0.00031571963,0.00018680606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014820988,0.00064204144,0.0004976565,0.0007070761,0.00029196183,0.0009263966,0.0033804087,0.00025206874,0.000011025724],"category_scores_gemma":[0.00005451601,0.0005272053,0.00009883712,0.0006287582,0.00063745026,0.0016101409,0.00079885736,0.0010651977,0.000023563998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070101755,0.000015567066,0.000023661067,0.000031346834,0.000007009364,0.000024366967,0.0010663243,0.26267064,0.00007035245,0.005422944,0.000002753311,0.73065805],"study_design_scores_gemma":[0.00017427643,0.00011092783,0.00012610987,0.0003208639,0.000006454536,0.00007983535,1.2957966e-7,0.96390396,0.0009101603,0.032757718,0.0009266074,0.00068295834],"about_ca_topic_score_codex":0.000019279998,"about_ca_topic_score_gemma":0.00011305159,"teacher_disagreement_score":0.72997504,"about_ca_system_score_codex":0.000342307,"about_ca_system_score_gemma":0.0005458948,"threshold_uncertainty_score":0.99971795},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042491556,0.00031678827,0.9926068,0.0003255546,0.002672327,0.0006720504,0.000011444377,0.00020855287,0.0031439748],"genre_scores_gemma":[0.01380892,0.00007371831,0.98359174,0.0014553381,0.0005258265,0.00002359273,0.000009826035,0.000037936596,0.00047311516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591285,0.00003783528,0.0006122073,0.001626848,0.00107859,0.00073167676],"domain_scores_gemma":[0.99660015,0.0005537884,0.00037679286,0.0017479749,0.00051881874,0.00020244536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014152348,0.00051239505,0.00051679066,0.0007415849,0.0004634988,0.00026654277,0.003832005,0.00039475274,0.000009971948],"category_scores_gemma":[0.00033423174,0.00048669105,0.00019608214,0.00052547874,0.00083234615,0.00092077156,0.0009412052,0.00069402764,0.000043748823],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053227477,0.000026558107,0.0000144360165,0.000038474784,0.0000072759276,0.000027948423,0.0003786648,0.0063642524,0.00010264336,0.09338101,0.00012629035,0.89952713],"study_design_scores_gemma":[0.00038878046,0.00028081448,0.0005229156,0.00026339793,0.000007880635,0.00033963274,8.464189e-8,0.77388656,0.002990351,0.20683344,0.013526612,0.0009595342],"about_ca_topic_score_codex":0.0000065181102,"about_ca_topic_score_gemma":0.00001112965,"teacher_disagreement_score":0.8985676,"about_ca_system_score_codex":0.00038483692,"about_ca_system_score_gemma":0.00081252644,"threshold_uncertainty_score":0.9997585},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54617095,0.00051405473,0.4521738,0.00063674373,0.00015767063,0.00030848235,0.0000050735107,0.000019156954,0.0000140497805],"genre_scores_gemma":[0.79581577,0.0000042519328,0.20360832,0.00022490222,0.00031490746,0.000015610396,0.0000036762951,0.000010900458,0.0000016483178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803966,0.000040105813,0.0002489653,0.0004107348,0.00056454877,0.0006960091],"domain_scores_gemma":[0.9986092,0.00050384324,0.000048019763,0.00037716186,0.00016257007,0.00029923266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069404766,0.00014281656,0.0002885334,0.00032331113,0.00008960354,0.000022177812,0.00035413096,0.00007945414,0.000030612096],"category_scores_gemma":[0.0004892517,0.00011669127,0.00009343827,0.0009096919,0.0007999912,0.00019715118,0.00023103582,0.000306394,0.000004799708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037688995,0.0007546619,0.2285688,0.0004746872,0.000032316642,0.000020184116,0.0010882395,0.0021603694,0.09118046,0.0010701594,0.000025304984,0.6742479],"study_design_scores_gemma":[0.002096365,0.0002831869,0.20132016,0.0002540099,0.000023717355,0.00006989347,0.0000042846323,0.7190382,0.07263041,0.003865135,0.00013984463,0.00027479482],"about_ca_topic_score_codex":0.000019185152,"about_ca_topic_score_gemma":0.000008365007,"teacher_disagreement_score":0.7168778,"about_ca_system_score_codex":0.00023725725,"about_ca_system_score_gemma":0.00045579765,"threshold_uncertainty_score":0.47585317},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3029516,0.07961398,0.4673991,0.12669407,0.007806581,0.01055721,0.00019188153,0.00014596799,0.004639621],"genre_scores_gemma":[0.9970476,0.0006574131,0.0020489849,0.00008490092,0.00007958912,0.000009266715,0.0000012617971,0.0000030573547,0.000067937115],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989679,0.000095573676,0.0002021021,0.00020642964,0.0003105692,0.00021741117],"domain_scores_gemma":[0.99779564,0.0015181579,0.00016000809,0.00030476047,0.00018695013,0.000034452463],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.00094620767,0.00012748851,0.00016057116,0.0000139370495,0.0022707274,0.00003986934,0.00080958335,0.00015048993,0.0000034285968],"category_scores_gemma":[0.0002933259,0.00005719341,0.0000646431,0.00016490118,0.009993729,0.00018172647,0.00054277014,0.00036738554,1.3523348e-7],"study_design_candidate":"theoretical_or_conceptual","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.000042093085,0.000034981174,0.003861474,0.00009710698,0.000028270773,3.4048568e-7,0.05011539,0.0003332383,0.000048502905,0.18633236,0.000013904588,0.75909233],"study_design_scores_gemma":[0.0019365825,0.0010346887,0.15968117,0.0027298112,0.0002987287,0.00010440592,0.002799096,0.06356028,0.0010136982,0.72586805,0.039244954,0.0017285619],"about_ca_topic_score_codex":0.00028635102,"about_ca_topic_score_gemma":0.03484986,"teacher_disagreement_score":0.7573638,"about_ca_system_score_codex":0.00007496373,"about_ca_system_score_gemma":0.00011058161,"threshold_uncertainty_score":0.9990282},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001197303,0.0006130483,0.99220574,0.0017452141,0.0012814503,0.00045164174,0.0000019000045,0.000111017805,0.002392706],"genre_scores_gemma":[0.52292734,0.00008106916,0.46877337,0.0048637507,0.001452998,0.000013586229,0.000025161178,0.00006573001,0.0017970211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619776,0.000088224544,0.0006622843,0.0012919588,0.0011195691,0.0006401767],"domain_scores_gemma":[0.9974091,0.0008825856,0.00028759366,0.0010738919,0.00022536905,0.00012147699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011746583,0.00048331975,0.0004746627,0.000706838,0.0005744818,0.00068255776,0.0028625452,0.0002337312,0.00002676332],"category_scores_gemma":[0.0001165985,0.00038111323,0.0001306769,0.0014025852,0.00069424335,0.0005563475,0.001163108,0.000906336,0.00019165596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035843673,0.00003142455,0.0000484508,0.000013916597,0.000007431908,0.000113361995,0.0016175001,0.5834046,0.00006533977,0.003887232,0.0001378862,0.41066927],"study_design_scores_gemma":[0.00022798633,0.00008849673,0.00076100655,0.00017445907,0.0000035745663,0.0001849764,1.1978197e-7,0.970917,0.00016727841,0.02461321,0.0023997938,0.00046213478],"about_ca_topic_score_codex":0.000034575132,"about_ca_topic_score_gemma":0.0000763054,"teacher_disagreement_score":0.5234324,"about_ca_system_score_codex":0.0002714762,"about_ca_system_score_gemma":0.0008542317,"threshold_uncertainty_score":0.9998641},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012564538,0.00056840724,0.9831254,0.001832999,0.0013085353,0.0003277314,0.0000043406285,0.00016851148,0.012538469],"genre_scores_gemma":[0.6919632,0.000031119936,0.30641842,0.0013650976,0.00007078143,0.0000078420535,0.0000023512803,0.000012665558,0.00012853602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658585,0.000068168556,0.00066562655,0.0012358242,0.0008359866,0.00060856587],"domain_scores_gemma":[0.996985,0.00062490447,0.0004549074,0.0014765443,0.00031658483,0.00014206445],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00076776097,0.00049841753,0.0008020768,0.0006206221,0.00013845855,0.0001538596,0.004370965,0.00039653148,0.000056035566],"category_scores_gemma":[0.0001593001,0.00038143297,0.00019009315,0.00038177613,0.005446458,0.00025605754,0.00091791555,0.00060143706,0.000024036452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002901911,0.0001240114,0.0005271904,0.00007373277,0.000031712963,0.0003032628,0.00063602853,0.003097247,0.0004160003,0.6061566,0.000041047504,0.38856414],"study_design_scores_gemma":[0.00058275723,0.00096803624,0.0009684593,0.0006004506,0.000022329636,0.00010501369,7.613669e-7,0.09124691,0.023280775,0.87956864,0.0017145353,0.0009413061],"about_ca_topic_score_codex":0.0001156791,"about_ca_topic_score_gemma":0.00019830182,"teacher_disagreement_score":0.69183755,"about_ca_system_score_codex":0.0001736758,"about_ca_system_score_gemma":0.0008609268,"threshold_uncertainty_score":0.99986374},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13267913,0.0000586109,0.86509466,0.0006415506,0.0009922533,0.00011756298,3.3713206e-7,0.0002933154,0.00012256586],"genre_scores_gemma":[0.59047925,0.0000014480961,0.40845045,0.00089875486,0.00016245591,0.00000219625,6.5620964e-7,0.000004606058,1.8244916e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997119,0.00009208289,0.00031083636,0.0009713934,0.00066568697,0.00084098725],"domain_scores_gemma":[0.9979516,0.00030359777,0.00009801802,0.0011884704,0.00018056446,0.00027770008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034418073,0.00022075011,0.00017685661,0.0008506585,0.00039593247,0.0008183669,0.0031890618,0.00010598882,0.000013519812],"category_scores_gemma":[0.00013189025,0.00020159732,0.00007298676,0.0043894765,0.00045383137,0.0021451984,0.00050063763,0.00034193316,0.000024668108],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073690453,0.00012234351,0.0054885987,0.000005334369,0.0000025999766,0.000025288638,0.0014980171,0.001285349,0.012339324,0.086129494,0.0000032813232,0.893093],"study_design_scores_gemma":[0.00043436306,0.0005524907,0.0205902,0.000047604994,0.0000020745035,0.0000841688,0.0000032960552,0.680543,0.0319341,0.26443005,0.0007244377,0.00065420964],"about_ca_topic_score_codex":0.000015118058,"about_ca_topic_score_gemma":0.000068504516,"teacher_disagreement_score":0.89243877,"about_ca_system_score_codex":0.00009520774,"about_ca_system_score_gemma":0.00016158598,"threshold_uncertainty_score":0.82208997},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036423207,0.00019448926,0.9956446,0.00048300708,0.0016582842,0.001072378,0.000009118928,0.0005891945,0.0003124874],"genre_scores_gemma":[0.17147973,0.0009074081,0.8120193,0.009765462,0.0024581535,0.0004485393,0.00036095697,0.00037641922,0.0021840276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555236,0.00007506713,0.0008778195,0.0018272785,0.0009937297,0.0006737504],"domain_scores_gemma":[0.99615043,0.00059944455,0.0005054756,0.0017115712,0.00083266036,0.00020043847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016045552,0.000593753,0.0007250168,0.0014721727,0.00033658528,0.0010266379,0.002466018,0.000371567,0.00002926013],"category_scores_gemma":[0.00016209391,0.0005914811,0.00037560877,0.0010407682,0.0003686655,0.00086739956,0.0010786855,0.00036103412,0.000020542566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005325114,0.00008488174,0.00017489784,0.00017587318,0.000029248906,0.000017580609,0.00027432502,0.0019869257,0.00004682256,0.39606854,0.0020634446,0.5990721],"study_design_scores_gemma":[0.00013390725,0.00011807285,0.00021483022,0.0002209838,0.000009183659,0.000015712772,2.8619281e-8,0.8097562,0.0007175102,0.1758266,0.012387774,0.0005991688],"about_ca_topic_score_codex":0.000050801442,"about_ca_topic_score_gemma":0.000020341427,"teacher_disagreement_score":0.8077693,"about_ca_system_score_codex":0.00020371248,"about_ca_system_score_gemma":0.00048224235,"threshold_uncertainty_score":0.99965364},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020439818,0.00014247984,0.9935521,0.0006784147,0.0020278974,0.00047676038,0.000009372206,0.00031097812,0.0007580562],"genre_scores_gemma":[0.93998,0.000022192215,0.05783555,0.00096668664,0.00047250444,0.000014783997,0.000036274472,0.00002679417,0.0006452216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962304,0.00008967207,0.0005733241,0.0014948194,0.00091599044,0.0006957424],"domain_scores_gemma":[0.9978234,0.00031983794,0.0003549274,0.00082790584,0.0004319173,0.0002420107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006825855,0.00053733226,0.00047452646,0.0007306735,0.00040963996,0.0004530643,0.0015824632,0.0005866299,0.00004168727],"category_scores_gemma":[0.00016103609,0.00045320357,0.00019387109,0.0008075293,0.0007842184,0.0010571291,0.0008391264,0.0008932825,0.00011130122],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014869187,0.00009349758,0.00013660592,0.00002080163,0.000016938093,0.000016703485,0.00041268294,0.008758279,0.005460553,0.010628044,0.000032870124,0.97440815],"study_design_scores_gemma":[0.00054436846,0.00041112214,0.014334604,0.00019956024,0.000013185646,0.000086050386,0.0000016485359,0.93814313,0.003789281,0.041079294,0.0004658085,0.00093192584],"about_ca_topic_score_codex":0.000033594115,"about_ca_topic_score_gemma":0.000046764562,"teacher_disagreement_score":0.97347623,"about_ca_system_score_codex":0.00030096545,"about_ca_system_score_gemma":0.0002418835,"threshold_uncertainty_score":0.999792},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035403133,0.00066968234,0.99516916,0.00018229689,0.0017795502,0.0002800588,0.0000025537495,0.0012325979,0.0006486778],"genre_scores_gemma":[0.02940372,0.000096790456,0.9692081,0.00039382494,0.0006678545,0.000019024985,0.0000030852138,0.00006267093,0.00014492213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964641,0.000012459173,0.00045564253,0.0013999813,0.0009424484,0.00072539423],"domain_scores_gemma":[0.9972112,0.00086275855,0.00025169816,0.0013038019,0.00019085029,0.00017967055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006926888,0.00060170365,0.00047920755,0.0008903553,0.00018024165,0.00068634463,0.0034780751,0.00037086822,0.00004878628],"category_scores_gemma":[0.00035520692,0.0005977972,0.00012451617,0.00073809596,0.00015580283,0.0011108934,0.0009405549,0.0011519165,0.00002949509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020167654,0.000024275681,0.00016979309,0.00018154897,0.000018111858,0.00022631466,0.00066667347,0.19508338,0.000015755659,0.0069868118,0.000047231486,0.7965781],"study_design_scores_gemma":[0.00013249583,0.00016964202,0.00012797205,0.00092773355,0.0000107593405,0.00020683624,3.3702893e-8,0.96219146,0.00072211405,0.026544623,0.007795646,0.0011706762],"about_ca_topic_score_codex":0.0000081396765,"about_ca_topic_score_gemma":0.0000030658798,"teacher_disagreement_score":0.7954074,"about_ca_system_score_codex":0.00024211955,"about_ca_system_score_gemma":0.00018845485,"threshold_uncertainty_score":0.9996473},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057228596,0.000028059152,0.9777688,0.0009625524,0.009507696,0.00040152532,0.000045230096,0.0001225819,0.010591269],"genre_scores_gemma":[0.5835154,0.0000049149858,0.39456493,0.004489884,0.0012244411,0.000021975873,0.000034315934,0.00006400179,0.016080128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98636174,0.00009383632,0.0010586221,0.0036724044,0.007831354,0.0009820183],"domain_scores_gemma":[0.99162626,0.003437634,0.00047312543,0.0030668455,0.0010179481,0.0003782126],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.013216066,0.00050546485,0.00057049654,0.004341737,0.0014891243,0.0034374485,0.008406118,0.00024960915,0.00040333418],"category_scores_gemma":[0.0017181237,0.00040028882,0.00019638526,0.0065086368,0.0047751535,0.0008385515,0.0007178129,0.0015272233,0.0008234526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057245757,0.000061953106,0.000012525573,0.0000039742636,0.0000026580753,0.000016158074,0.00027750584,0.36684936,0.000040616393,0.00067432283,0.000925728,0.63112944],"study_design_scores_gemma":[0.00025646217,0.00013621703,0.00058358413,0.00013262397,0.000008276104,0.000032307657,0.0000013866756,0.7289923,0.00037296582,0.2501298,0.018794056,0.00056005],"about_ca_topic_score_codex":0.00001974105,"about_ca_topic_score_gemma":0.00011518553,"teacher_disagreement_score":0.6305694,"about_ca_system_score_codex":0.0005841682,"about_ca_system_score_gemma":0.0034781497,"threshold_uncertainty_score":0.9999545},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29775757,0.00010135219,0.6988886,0.000061531224,0.00016437669,0.0020496089,0.000019487317,0.00013616172,0.0008212862],"genre_scores_gemma":[0.9847951,0.000031009604,0.014279858,0.0005200595,0.00009330677,0.00015553155,0.000054408665,0.000037327478,0.000033392447],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9981597,0.000025130255,0.00033609237,0.00066443905,0.0005245266,0.00029013082],"domain_scores_gemma":[0.99900335,0.000080281374,0.00018342255,0.00046801736,0.00015362963,0.00011127671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021714001,0.0003286481,0.0003819513,0.0006166006,0.00015481336,0.00006507814,0.00034303116,0.00016362368,0.000014083153],"category_scores_gemma":[0.0000357831,0.00023075486,0.00008107741,0.00066359923,0.00024485675,0.00033618428,0.00015437222,0.00036473374,0.0000044579974],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002309616,0.00087627966,0.12430591,0.000442711,0.00037901392,0.00028428892,0.019117353,0.008801021,0.017686516,0.00043084653,0.000060642426,0.8253058],"study_design_scores_gemma":[0.010412999,0.0037895616,0.5871565,0.0061010304,0.00041987156,0.00012066661,0.0000050363633,0.016414149,0.36514536,0.006724061,0.00073706644,0.0029737148],"about_ca_topic_score_codex":0.00002154435,"about_ca_topic_score_gemma":0.000027197175,"teacher_disagreement_score":0.8223321,"about_ca_system_score_codex":0.00015732268,"about_ca_system_score_gemma":0.00013524147,"threshold_uncertainty_score":0.94099104},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03306851,0.010851803,0.9540122,0.00014900843,0.0007703408,0.0010351385,0.0000064176706,0.000046490786,0.000060069844],"genre_scores_gemma":[0.96812075,0.00095726585,0.030271059,0.00015028541,0.0004318776,0.000021004109,0.000009610674,0.000026218351,0.000011921181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778426,0.00005759325,0.00045770797,0.00063066965,0.0005235309,0.0005462297],"domain_scores_gemma":[0.9983688,0.00078097853,0.00024460547,0.00025423916,0.00025440438,0.00009697224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010934143,0.00029368082,0.00052265596,0.0002345739,0.0003297655,0.00014900554,0.0006182401,0.00061689527,0.000016888658],"category_scores_gemma":[0.00019032824,0.0002710663,0.000097779404,0.00048359754,0.00038748494,0.0006240732,0.00013686299,0.0005361705,8.0744496e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002293578,0.000015215224,0.000047163572,0.000026777074,0.000007485613,0.0000018715305,0.003743794,0.77734643,0.0000014432167,0.0022976864,1.6818599e-7,0.21648902],"study_design_scores_gemma":[0.0003291785,0.000052056068,0.000016736192,0.0003803033,0.000023464434,6.727012e-7,0.000005774653,0.9624346,0.000012270305,0.036212556,0.000243817,0.00028860752],"about_ca_topic_score_codex":0.00004421908,"about_ca_topic_score_gemma":0.00035466146,"teacher_disagreement_score":0.9350523,"about_ca_system_score_codex":0.00012793519,"about_ca_system_score_gemma":0.00021936138,"threshold_uncertainty_score":0.99997413},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004669947,0.0011842495,0.9933457,0.0006272122,0.0011835165,0.00061454275,0.000007589335,0.00026415547,0.0027263502],"genre_scores_gemma":[0.041050795,0.00007771016,0.9530948,0.0038440712,0.0007087401,0.000023230055,0.000010960761,0.000047001566,0.0011427185],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996742,0.000017302598,0.0004603335,0.0014166274,0.00072515913,0.00063859415],"domain_scores_gemma":[0.99715245,0.00092188636,0.00024052583,0.0013490163,0.00018950074,0.0001466249],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010359351,0.00046650585,0.00052305026,0.0005980495,0.00022285839,0.0005838198,0.0035232296,0.00030645274,0.000017332017],"category_scores_gemma":[0.0001139466,0.0003915961,0.00016835326,0.0003633957,0.00034368367,0.00051553454,0.0007141571,0.0004276025,0.00003818263],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039740103,0.000016908527,0.0000034681616,0.000024276238,0.0000042862093,0.000024762816,0.00028232302,0.0038953198,0.00013640577,0.04974829,0.000080121994,0.94577986],"study_design_scores_gemma":[0.00032951933,0.0002514177,0.000048158126,0.00051653525,0.000005628626,0.000056035136,1.3978575e-7,0.3226076,0.0011147254,0.66567785,0.008827044,0.00056537316],"about_ca_topic_score_codex":0.000006613474,"about_ca_topic_score_gemma":0.000023227176,"teacher_disagreement_score":0.9452145,"about_ca_system_score_codex":0.00015457305,"about_ca_system_score_gemma":0.00027330607,"threshold_uncertainty_score":0.9998536},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033166274,0.00008999516,0.9935175,0.00030776815,0.002197994,0.00046102438,0.000019104828,0.00017925179,0.0031941629],"genre_scores_gemma":[0.10991564,0.000018304805,0.88785726,0.00079118746,0.0012547219,0.000020789492,0.000045784327,0.000027657718,0.0000686444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970091,0.000034397734,0.00041740545,0.0014586039,0.0005483379,0.0005321709],"domain_scores_gemma":[0.9978244,0.00023774763,0.00028697634,0.0012294104,0.0002540159,0.00016749774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000702993,0.00040788532,0.00040900946,0.0004905846,0.00031573526,0.0007137809,0.0022158877,0.00033069158,0.000024147072],"category_scores_gemma":[0.000034809676,0.00036260035,0.00011668834,0.00029374607,0.0006273258,0.0006410821,0.0002430307,0.00041457632,0.000019716226],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045799975,0.000011586346,0.0000024197109,0.000018534374,0.0000037412349,0.000006030464,0.0000778801,0.020357143,0.00004457373,0.08754347,0.000060250026,0.8918698],"study_design_scores_gemma":[0.00019899476,0.00051422144,0.000029316227,0.00009237393,0.0000055352184,0.00008152889,1.282582e-7,0.622289,0.00027301937,0.37353328,0.002549297,0.000433295],"about_ca_topic_score_codex":0.000011631725,"about_ca_topic_score_gemma":0.000027270462,"teacher_disagreement_score":0.8914365,"about_ca_system_score_codex":0.00016221942,"about_ca_system_score_gemma":0.00037032057,"threshold_uncertainty_score":0.9998826},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006651427,0.0010380573,0.9888933,0.0002616485,0.000297114,0.00042992065,0.000088341956,0.000014156439,0.0023260687],"genre_scores_gemma":[0.75514185,0.00016498668,0.24390273,0.00026273436,0.0002522112,0.000007823691,0.000092556125,0.000024983514,0.00015009475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982019,0.000022193824,0.00037895775,0.0007423028,0.00037614268,0.0002785134],"domain_scores_gemma":[0.9991077,0.000046172496,0.00021011643,0.00043704704,0.00010873902,0.00009021306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026230712,0.0002828136,0.00035328895,0.0002048156,0.00008035293,0.00005592662,0.00035780834,0.00016151923,0.000017888866],"category_scores_gemma":[0.000030828898,0.0002633249,0.000060064333,0.000095689276,0.0006823205,0.000005949047,0.000105909116,0.00021450555,0.000002112571],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101976955,0.00010056842,0.00085168553,0.00011122846,0.00003273055,0.000012420896,0.0001234111,0.020368932,0.017290607,0.00052828516,0.000022248088,0.9604559],"study_design_scores_gemma":[0.011707558,0.03472513,0.08703459,0.0051855957,0.0005259986,0.0003270212,0.00002950115,0.4888382,0.11302395,0.16794808,0.07988798,0.010766385],"about_ca_topic_score_codex":0.000006704273,"about_ca_topic_score_gemma":0.00007111762,"teacher_disagreement_score":0.9496895,"about_ca_system_score_codex":0.000059572936,"about_ca_system_score_gemma":0.00016860304,"threshold_uncertainty_score":0.9999819},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005931524,0.0012566147,0.99157983,0.00036304927,0.0013542597,0.00064597256,0.0000038970197,0.00018658632,0.004016623],"genre_scores_gemma":[0.47349647,0.00005505534,0.5247823,0.0008164496,0.0004555137,0.000018352719,0.000013312518,0.0000647721,0.00029778204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947759,0.000057127876,0.0008333033,0.0018375322,0.0010571056,0.0014390372],"domain_scores_gemma":[0.99743277,0.00040981767,0.00034356324,0.0013143431,0.00023094127,0.00026856226],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011731059,0.00070000073,0.0008768598,0.00047674731,0.0003124854,0.0010605049,0.0031339254,0.00037516636,0.000039073057],"category_scores_gemma":[0.00003146056,0.00059209164,0.000116563024,0.0011549369,0.00040173344,0.0008535585,0.00084478565,0.0010654734,0.000064400265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012711604,0.000025772255,0.0030556882,0.000052528674,0.000021793563,0.00024538665,0.00040986933,0.69588035,0.0000125332135,0.028520383,0.000065008644,0.271698],"study_design_scores_gemma":[0.00093629037,0.00014233912,0.0008924236,0.003082456,0.0000098105,0.00015168932,0.0000013100058,0.95506984,0.000063234766,0.034371976,0.0040030372,0.0012756066],"about_ca_topic_score_codex":0.000552404,"about_ca_topic_score_gemma":0.001007666,"teacher_disagreement_score":0.4729033,"about_ca_system_score_codex":0.00037975542,"about_ca_system_score_gemma":0.0005928006,"threshold_uncertainty_score":0.9999765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010604287,0.00088144856,0.9958289,0.0004031757,0.0005571748,0.0004886357,0.000008956039,0.00018200814,0.0005892654],"genre_scores_gemma":[0.6230999,0.000093807765,0.37617567,0.00041663664,0.00011740548,0.000008622464,0.000063873034,0.000020591788,0.0000034624134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971299,0.000065891865,0.0005006945,0.0010882847,0.00073785824,0.00047738053],"domain_scores_gemma":[0.99746156,0.00051955803,0.00044524367,0.0010201612,0.00035334966,0.00020011471],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007995254,0.00048541956,0.00042805972,0.000726583,0.00046115,0.00067909865,0.0013676337,0.00025121702,0.000007892635],"category_scores_gemma":[0.000021080743,0.00042695494,0.000071004906,0.0006282575,0.0008483222,0.0020989869,0.0009574237,0.00084503985,0.000017434886],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032448377,0.00011819826,0.0007128031,0.00009227944,0.000029424593,0.0000138488085,0.00277218,0.04828728,0.000082627506,0.021141255,0.00004127438,0.9266764],"study_design_scores_gemma":[0.0005237772,0.00017399751,0.0014717204,0.00045293456,0.000019089452,0.00015101246,0.0000010759808,0.87906545,0.00036732847,0.11672209,0.0003729731,0.00067852344],"about_ca_topic_score_codex":0.000057675035,"about_ca_topic_score_gemma":0.00024415465,"teacher_disagreement_score":0.92599785,"about_ca_system_score_codex":0.00015549696,"about_ca_system_score_gemma":0.00014278405,"threshold_uncertainty_score":0.9998182},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000665652,0.0000734651,0.9822914,0.0013903684,0.005637534,0.0008633704,0.000081237464,0.0001790963,0.00941698],"genre_scores_gemma":[0.3790945,0.0000014330255,0.6095863,0.005316576,0.0016697438,0.000025676458,0.00011417267,0.00006560608,0.0041259956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99055713,0.0000944124,0.0012441954,0.0030488106,0.0042757858,0.0007796793],"domain_scores_gemma":[0.99058557,0.0052713617,0.00064045726,0.0024814452,0.00076827896,0.00025288723],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008811326,0.0006005883,0.0007931059,0.0019010619,0.0006477071,0.0019697552,0.0043708174,0.00027024015,0.000060568942],"category_scores_gemma":[0.001209667,0.0004776644,0.0003408823,0.001433746,0.0006299556,0.00022354338,0.0006708717,0.00052185304,0.00024417482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027986223,0.000027122223,0.000012282493,0.000014106134,0.0000037109014,0.000017579716,0.000049563718,0.5016407,0.0000010871493,0.0057788566,0.0011097479,0.49131727],"study_design_scores_gemma":[0.0004551076,0.0002446904,0.00013057403,0.0005194291,0.00001130837,0.000009198082,7.06809e-7,0.815019,0.00002156491,0.1648269,0.018316334,0.0004451779],"about_ca_topic_score_codex":0.000006937607,"about_ca_topic_score_gemma":0.000020753216,"teacher_disagreement_score":0.49087209,"about_ca_system_score_codex":0.0005038175,"about_ca_system_score_gemma":0.00059701107,"threshold_uncertainty_score":0.9997675},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057505857,0.00016513518,0.99359506,0.0005393397,0.0012781386,0.00048041748,0.000015536996,0.00033631705,0.0030149766],"genre_scores_gemma":[0.44318128,0.000044529017,0.5493173,0.005479563,0.0007750927,0.000042197033,0.00002591686,0.000100916564,0.0010332275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955833,0.00004694627,0.00056253816,0.0017868149,0.0010865153,0.000933867],"domain_scores_gemma":[0.9959618,0.0013470481,0.00036335987,0.0018078183,0.0002542555,0.00026575834],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005923054,0.0007516346,0.0006791179,0.0007457056,0.0003079656,0.0010874162,0.0040683523,0.00033166213,0.00009918623],"category_scores_gemma":[0.00007651901,0.0005851663,0.00012817576,0.00049530284,0.001080931,0.0011457832,0.0015659861,0.00088423956,0.00027172823],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028289325,0.00006890271,0.000115118455,0.000073346026,0.000031967105,0.0005378359,0.0021908546,0.029700262,0.000102259226,0.013975404,0.00013928555,0.9530365],"study_design_scores_gemma":[0.00059318205,0.000543511,0.0001676945,0.0004927139,0.0000095089645,0.00015198291,4.145925e-7,0.8607174,0.0019298502,0.13118449,0.0031509583,0.0010582837],"about_ca_topic_score_codex":0.00005757495,"about_ca_topic_score_gemma":0.00006614028,"teacher_disagreement_score":0.9519782,"about_ca_system_score_codex":0.00015738135,"about_ca_system_score_gemma":0.00050503435,"threshold_uncertainty_score":0.9999496},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016107313,0.0009199909,0.9922137,0.0009677133,0.002008944,0.0016880399,0.000025458165,0.0001585621,0.0020014558],"genre_scores_gemma":[0.011665034,0.0002224068,0.9819972,0.0020593684,0.00093977543,0.00018709115,0.000019618892,0.00008370186,0.0028257954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584216,0.000042013304,0.0006570943,0.0018042906,0.00082098425,0.00083346316],"domain_scores_gemma":[0.9962047,0.0011996188,0.0004564859,0.0016271713,0.0003319661,0.00018011272],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012885409,0.00070973526,0.00063144666,0.0005345825,0.0007565801,0.0011567654,0.0035279815,0.00038015787,0.000027092392],"category_scores_gemma":[0.00010585148,0.00048325583,0.000241194,0.0005692173,0.0015049366,0.0009195873,0.0014244821,0.0007456223,0.000020342457],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001581486,0.00004175444,0.0000074414997,0.000079999816,0.00003745539,0.0000063406346,0.0012171555,0.0008387163,0.00007890411,0.03428132,0.00007732823,0.96331775],"study_design_scores_gemma":[0.00052295055,0.0002682554,0.00008078056,0.00013535433,0.000022396967,0.000045421857,2.425997e-7,0.6563643,0.00043515337,0.3334266,0.008167784,0.00053075806],"about_ca_topic_score_codex":0.000064667125,"about_ca_topic_score_gemma":0.00013404961,"teacher_disagreement_score":0.96278703,"about_ca_system_score_codex":0.00017998971,"about_ca_system_score_gemma":0.0004314887,"threshold_uncertainty_score":0.99988014},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031111678,0.00085258036,0.99418503,0.00013436447,0.00032946523,0.00021996775,0.000005339193,0.000022177752,0.0011398942],"genre_scores_gemma":[0.68510765,0.00027935603,0.30961525,0.0014616072,0.0018054531,0.000024041568,0.00014165428,0.00007485383,0.0014901434],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99833643,0.000026749569,0.00021614369,0.00092536054,0.00025410642,0.00024122465],"domain_scores_gemma":[0.9992142,0.000019935063,0.00015310035,0.0004221654,0.00007227968,0.00011836991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023340742,0.0002901617,0.00018894077,0.00020597494,0.00014063207,0.00006350314,0.00033059446,0.00032325395,0.000018087321],"category_scores_gemma":[0.000021578377,0.00026258477,0.00006061517,0.00012738883,0.00015638863,0.0000073216743,0.00012705282,0.00021634222,0.0000044093385],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010435431,0.000034890785,0.00063270016,0.000039444683,0.000019722424,0.0000036870927,0.00017817119,0.058273338,0.33716458,0.00019776245,0.0002561409,0.60309523],"study_design_scores_gemma":[0.00039318393,0.00045547812,0.00036111404,0.000090918445,0.000016028866,0.0000243011,3.5448895e-7,0.1424958,0.8458207,0.0016208142,0.008155083,0.0005662123],"about_ca_topic_score_codex":0.0000124512735,"about_ca_topic_score_gemma":0.000037055124,"teacher_disagreement_score":0.6845698,"about_ca_system_score_codex":0.000041617153,"about_ca_system_score_gemma":0.00036314697,"threshold_uncertainty_score":0.99998266},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002815053,0.00024103273,0.9953506,0.00038576158,0.0016183592,0.00038724745,0.000006412681,0.00048551103,0.0012435945],"genre_scores_gemma":[0.5702719,0.000022272674,0.42681247,0.0002938566,0.0007199268,0.000025192336,0.000015751784,0.00008384517,0.0017548066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572104,0.000034782843,0.0005183724,0.0014727316,0.0014204216,0.00083267613],"domain_scores_gemma":[0.99619585,0.0014315008,0.00018271462,0.0017034584,0.00029633648,0.00019011731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009797587,0.0005184868,0.00047397023,0.0013504288,0.00026885667,0.0008342124,0.0037741656,0.00027793986,0.000021016482],"category_scores_gemma":[0.0003844703,0.0004857204,0.00012473541,0.0010479714,0.00053704623,0.00073863636,0.0014473633,0.000992094,0.00008057097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029602545,0.00007558552,0.006688781,0.00019835038,0.000037470974,0.00042364988,0.0008060508,0.5834218,0.00009931229,0.023968508,0.00040161228,0.38387588],"study_design_scores_gemma":[0.00017833935,0.00007496681,0.010395175,0.00031691985,0.000006290757,0.000041863208,1.7321954e-8,0.92062795,0.0002148982,0.067058556,0.00041181862,0.0006731883],"about_ca_topic_score_codex":0.00019218399,"about_ca_topic_score_gemma":0.00014727574,"teacher_disagreement_score":0.5699904,"about_ca_system_score_codex":0.00035013398,"about_ca_system_score_gemma":0.00049977866,"threshold_uncertainty_score":0.99975944},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015879756,0.000014109245,0.99656373,0.0000881738,0.0011918844,0.0010440163,0.00010611234,0.000058860755,0.0007742911],"genre_scores_gemma":[0.4987644,0.000016674256,0.50017405,0.00032886898,0.00015233115,0.00007228288,0.00010399033,0.00002126032,0.0003661247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978854,0.000011625045,0.00067714293,0.000437755,0.00056630006,0.00042179337],"domain_scores_gemma":[0.99767655,0.00026478712,0.00045884858,0.00080435694,0.00067512074,0.000120342156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092646736,0.0002896333,0.00038858087,0.00065710343,0.00017614894,0.00050517975,0.0022859545,0.00019570134,0.000006971573],"category_scores_gemma":[0.00012405602,0.00025307972,0.00013770993,0.00027446664,0.0002609805,0.004269447,0.0003917895,0.00023001549,0.0000066400744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008367664,0.000062272644,0.000072237155,0.00040046938,0.000013001548,0.0000011879864,0.007422934,0.0032806909,0.00033796715,0.30108532,0.000051269584,0.687189],"study_design_scores_gemma":[0.0006057331,0.001306217,0.00034382174,0.00025726468,0.000019168754,0.000026164804,0.0000021556957,0.8733714,0.0066870614,0.115377,0.0013239936,0.0006800008],"about_ca_topic_score_codex":0.000028051403,"about_ca_topic_score_gemma":0.000054481196,"teacher_disagreement_score":0.8700907,"about_ca_system_score_codex":0.00013097236,"about_ca_system_score_gemma":0.0006245058,"threshold_uncertainty_score":0.99999213},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36982456,0.016934283,0.6078714,0.00021029996,0.00076259533,0.0013937143,0.000074258685,0.000028746286,0.0029001264],"genre_scores_gemma":[0.96631604,0.0004327615,0.032835357,0.00008476422,0.00015860554,0.000006842006,0.000035657442,0.000027780537,0.00010221546],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984255,0.000020424915,0.00033528035,0.0006736844,0.0002554492,0.00028966035],"domain_scores_gemma":[0.99930537,0.00004771975,0.00014132872,0.0003805911,0.00007261605,0.000052374377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030140814,0.0002743356,0.00035023625,0.0003186628,0.000038815157,0.00003557896,0.00038659645,0.00023294623,0.000006219049],"category_scores_gemma":[0.000022436208,0.000252324,0.000078354096,0.000113794595,0.0005772101,0.000005750608,0.00035625772,0.0001780332,0.0000011439591],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015559797,0.00017057334,0.013292155,0.00030812004,0.00008333044,0.00012816486,0.000677894,0.02657542,0.21373244,0.00036875258,0.000028252718,0.7444793],"study_design_scores_gemma":[0.030372243,0.00480276,0.10318421,0.0031704234,0.0002693534,0.00071752205,0.0000092050595,0.15524122,0.5139689,0.16771331,0.011733975,0.008816889],"about_ca_topic_score_codex":0.000046380308,"about_ca_topic_score_gemma":0.0002033786,"teacher_disagreement_score":0.7356624,"about_ca_system_score_codex":0.00002848609,"about_ca_system_score_gemma":0.00009978915,"threshold_uncertainty_score":0.9999929},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036742058,0.00017269976,0.99676263,0.00046260905,0.0007956136,0.00048923376,0.0000076821125,0.0010918275,0.00018096945],"genre_scores_gemma":[0.05533367,0.000020114056,0.9435085,0.00066757295,0.0003185801,0.000029421284,0.000004264369,0.000061835206,0.000056016957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965226,0.000011561626,0.0004568245,0.001264573,0.00089848076,0.0008459681],"domain_scores_gemma":[0.9977611,0.00010498679,0.00010644558,0.0014910607,0.00018199412,0.000354417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054031314,0.00061248767,0.00051257643,0.0011688836,0.00010749443,0.00027365543,0.0029650377,0.00036978087,0.00000777914],"category_scores_gemma":[0.0000122933925,0.0006426312,0.00014117452,0.00056671596,0.00011303877,0.0008195696,0.00090867584,0.0007897238,0.000047711255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010927502,0.000009059837,0.0000014558027,0.00002337376,0.0000041665517,0.000012690634,0.0007555268,0.69519573,0.0003921806,0.04464723,0.000011348016,0.25894612],"study_design_scores_gemma":[0.00008019709,0.0000731866,0.000011224011,0.0003568844,0.000006241572,0.000037528775,6.8019466e-9,0.9829753,0.0019204833,0.0103476485,0.003474464,0.00071684114],"about_ca_topic_score_codex":0.0000075978905,"about_ca_topic_score_gemma":0.000006455263,"teacher_disagreement_score":0.28777954,"about_ca_system_score_codex":0.00049030205,"about_ca_system_score_gemma":0.00020980249,"threshold_uncertainty_score":0.9996025},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018259166,0.0007952062,0.9923798,0.0010577819,0.00237383,0.00065708655,0.000007130908,0.00024649355,0.0023001167],"genre_scores_gemma":[0.1387588,0.000024793602,0.85520035,0.0048143235,0.0007367024,0.00004554548,0.000018724188,0.000057402453,0.0003433558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587584,0.000046532085,0.0005797361,0.001506323,0.00087255175,0.0011190434],"domain_scores_gemma":[0.99685705,0.00074582687,0.00039580316,0.0015973898,0.00019770344,0.00020623242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000987255,0.00057717564,0.00065474986,0.000682614,0.00039704196,0.00038454527,0.0041618235,0.00045956025,0.00001850425],"category_scores_gemma":[0.00018352566,0.0005289381,0.00021290348,0.00032276713,0.0006659046,0.000542834,0.0011042228,0.0005360292,0.00004078236],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031758012,0.00008149483,0.001049817,0.00015806136,0.000038181046,0.00006982712,0.00093633024,0.012612191,0.00021306996,0.019741142,0.00027495474,0.96479315],"study_design_scores_gemma":[0.001762195,0.0005096862,0.0016763469,0.0010059635,0.000057874757,0.000065431566,8.139295e-7,0.8287875,0.0033306715,0.116441585,0.044437185,0.0019247218],"about_ca_topic_score_codex":0.00001821728,"about_ca_topic_score_gemma":0.00005547157,"teacher_disagreement_score":0.96286845,"about_ca_system_score_codex":0.0003628898,"about_ca_system_score_gemma":0.0004528459,"threshold_uncertainty_score":0.9997162},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47266352,0.00007983705,0.526601,0.00030992756,0.00013160286,0.00018117117,0.0000011334463,0.000025212665,0.0000065575787],"genre_scores_gemma":[0.7696536,0.0000019136662,0.22989921,0.00016933349,0.00022479791,0.0000033270433,0.00003920263,0.0000075340836,0.0000010712832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983456,0.0000697701,0.00030963068,0.00044042547,0.00047978424,0.00035476167],"domain_scores_gemma":[0.99877936,0.00024797744,0.00014049477,0.0006460931,0.0000872218,0.00009884997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001067064,0.00014390291,0.00019292001,0.00016014319,0.00014014081,0.00009425789,0.00019727329,0.000047134134,0.000012957817],"category_scores_gemma":[0.0004747143,0.00011683341,0.000021299624,0.0010925329,0.00035233915,0.0009984286,0.000033190634,0.0002028319,0.0000016735725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018457335,0.00016323458,0.064039364,0.000027523427,0.000004361044,0.000010958119,0.0004838432,0.9039159,0.008221309,0.000019112638,0.0000026597133,0.022927148],"study_design_scores_gemma":[0.0012344733,0.00010841576,0.023302589,0.00014461,0.000023326389,0.000100011544,0.0000068578665,0.95735496,0.017491302,0.0000751164,0.000014277102,0.00014408182],"about_ca_topic_score_codex":0.00013216074,"about_ca_topic_score_gemma":0.00011089736,"teacher_disagreement_score":0.2969901,"about_ca_system_score_codex":0.0001470601,"about_ca_system_score_gemma":0.0003808525,"threshold_uncertainty_score":0.47643283},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006292451,0.00030177747,0.9959833,0.000064638225,0.0002750472,0.0004461756,0.0000011742461,0.00018147158,0.002117143],"genre_scores_gemma":[0.2338721,0.000038119284,0.7655926,0.0000585609,0.00017804191,0.000026371483,0.000014933717,0.000060790982,0.00015850732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980539,0.000009114383,0.0002684044,0.0005622236,0.00049014844,0.0006162033],"domain_scores_gemma":[0.9992509,0.000086019376,0.00005730484,0.0002515473,0.00016075913,0.00019349389],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030048162,0.00037217088,0.00030336186,0.00039193523,0.00014172563,0.0005674106,0.00033398907,0.00018913209,0.00003221748],"category_scores_gemma":[0.000023965924,0.0002994802,0.00003031751,0.0002239778,0.0005595823,0.00021751127,0.00020813888,0.00055515807,0.0000056576646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022202496,0.0000040013474,0.000036412537,0.00005168789,0.000014537055,0.000021417723,0.0003653625,0.4858686,0.00001464901,0.00016509808,0.000002287272,0.5134537],"study_design_scores_gemma":[0.00029913877,0.00013810738,0.000051549516,0.000830544,0.000008665485,0.0000999475,0.000004503143,0.99482304,0.00037006615,0.00071695785,0.0020118433,0.00064564514],"about_ca_topic_score_codex":0.00001916384,"about_ca_topic_score_gemma":0.00008506114,"teacher_disagreement_score":0.5128081,"about_ca_system_score_codex":0.0001896272,"about_ca_system_score_gemma":0.00018668658,"threshold_uncertainty_score":0.99994576},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009956378,0.00043559435,0.98913395,0.000100106125,0.0013885071,0.00027715685,0.00000499685,0.00009406673,0.00757],"genre_scores_gemma":[0.85236603,0.000017815988,0.1467388,0.00049181306,0.00024031344,0.0000026275036,0.0000087627295,0.000019920266,0.00011389696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958462,0.000035509645,0.0006011363,0.0012514801,0.0016366194,0.000629049],"domain_scores_gemma":[0.99721134,0.0010176951,0.00044718705,0.0008209412,0.00033711383,0.00016572609],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012766116,0.0004875221,0.0005152263,0.0027335312,0.00022241687,0.00041594857,0.0020245067,0.00029268625,0.000012999142],"category_scores_gemma":[0.0000983962,0.00046109155,0.00016242795,0.0019670015,0.0005101283,0.00072520156,0.0006529747,0.0007038962,0.000020213154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073049505,0.000021774085,0.000009858899,0.000018697694,0.000008807548,0.00002591542,0.0001573874,0.43869534,0.00004116052,0.104967415,0.0000078105095,0.45603853],"study_design_scores_gemma":[0.00041366386,0.00059031806,0.0006263365,0.00045710243,0.000012006807,0.00003911361,0.000003913249,0.8827401,0.0033968608,0.1106248,0.00032190414,0.00077387557],"about_ca_topic_score_codex":0.000036339654,"about_ca_topic_score_gemma":0.000037696158,"teacher_disagreement_score":0.8513704,"about_ca_system_score_codex":0.00031792166,"about_ca_system_score_gemma":0.0009329476,"threshold_uncertainty_score":0.99978405},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008579625,0.0012893487,0.9954286,0.00020265121,0.0018556447,0.0005156971,0.0000044910616,0.00013402019,0.00048372944],"genre_scores_gemma":[0.36513323,0.00020963667,0.63262546,0.000566277,0.0005087494,0.0000140790735,0.000017886487,0.000051708008,0.000872947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665534,0.000047610476,0.00064077415,0.0012003963,0.0007895178,0.0006663274],"domain_scores_gemma":[0.99802756,0.00011822603,0.00030893384,0.0010557378,0.00030123268,0.00018833033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007334121,0.00047826796,0.00045694946,0.00081770023,0.00023483776,0.00037691364,0.0020578655,0.00039794735,0.000028751896],"category_scores_gemma":[0.00005226706,0.00042954026,0.00008383961,0.0010706937,0.00015721556,0.0009101637,0.0007405642,0.00068351894,0.000121674246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013579512,0.000088040215,0.0004922272,0.000053743155,0.000008582939,0.000029395884,0.0061797774,0.9151253,0.00022440396,0.014657541,0.000023983042,0.063115634],"study_design_scores_gemma":[0.00028137566,0.000026775522,0.00014023852,0.00029737694,0.0000049755995,0.000023139592,3.5833065e-7,0.9922976,0.0003784391,0.0044015436,0.0016361017,0.0005120629],"about_ca_topic_score_codex":0.000099371915,"about_ca_topic_score_gemma":0.000156669,"teacher_disagreement_score":0.36504743,"about_ca_system_score_codex":0.0004570583,"about_ca_system_score_gemma":0.00030765956,"threshold_uncertainty_score":0.99981564},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038821356,0.00027993025,0.9947267,0.00009248739,0.0004937136,0.0010784487,0.0000015275853,0.0002911751,0.0029971648],"genre_scores_gemma":[0.38578397,0.0000011614823,0.61372054,0.00015160252,0.00022751113,0.000013591532,0.000001188443,0.000028947423,0.00007150795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99539506,0.00009448684,0.0006629564,0.002007618,0.0011287043,0.0007111805],"domain_scores_gemma":[0.99685395,0.00091236347,0.00029278782,0.0013679796,0.00026365873,0.00030924584],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020434237,0.000576401,0.00063962763,0.0010629888,0.00031905487,0.0011541722,0.002185799,0.00034895015,0.0000015378287],"category_scores_gemma":[0.000055764875,0.00054267404,0.000087434375,0.0006816055,0.00015132508,0.0008899639,0.0006946131,0.0005195727,0.000034868437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054822444,0.000010912565,0.0000032057078,0.00008928995,0.0000046625705,0.000015249034,0.0003607418,0.9516798,0.000028815943,0.0039062067,8.043725e-7,0.043894827],"study_design_scores_gemma":[0.00020298967,0.000076927,0.0000015456151,0.0006285852,0.000007498377,0.000039266513,3.694517e-7,0.99571913,0.00031029969,0.002333004,0.00010748117,0.0005729264],"about_ca_topic_score_codex":0.00005640459,"about_ca_topic_score_gemma":0.000004284715,"teacher_disagreement_score":0.38574514,"about_ca_system_score_codex":0.0005450017,"about_ca_system_score_gemma":0.0005273091,"threshold_uncertainty_score":0.9998827},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000089151645,0.0006397468,0.99227166,0.0014034364,0.0020703487,0.00029810742,0.0000047219614,0.00032793387,0.00297512],"genre_scores_gemma":[0.032444336,0.000048243546,0.96233267,0.003975487,0.00089735794,0.000008729491,0.000007867494,0.000041179745,0.00024411516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616265,0.00003196887,0.00051185547,0.001417373,0.00094825553,0.00092787866],"domain_scores_gemma":[0.99749154,0.0001979699,0.00036333074,0.0014091644,0.0002767014,0.0002613204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007619674,0.00052779156,0.00044787716,0.00071324845,0.00043842904,0.0006910539,0.0025430154,0.00023857909,0.000058711204],"category_scores_gemma":[0.000074563955,0.0005048592,0.00015475875,0.00055329915,0.00057526305,0.002580314,0.0018371667,0.00076498615,0.00012723003],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031018678,0.000021268273,0.000008489355,0.00002704635,0.0000033565477,0.000037833568,0.00029047191,0.00040844356,0.0026156523,0.005188508,0.0000382234,0.9913576],"study_design_scores_gemma":[0.00038822446,0.00010855301,0.00015540216,0.0003903874,0.000009305299,0.0001497479,1.7463051e-7,0.92260283,0.0040165177,0.06815605,0.0030765615,0.00094626757],"about_ca_topic_score_codex":0.000014650372,"about_ca_topic_score_gemma":0.000010709287,"teacher_disagreement_score":0.99041134,"about_ca_system_score_codex":0.0004188615,"about_ca_system_score_gemma":0.0003260893,"threshold_uncertainty_score":0.9997403},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016156645,0.00010140935,0.9929903,0.00066794985,0.001994995,0.00064635946,0.000005700987,0.00019727809,0.0032344498],"genre_scores_gemma":[0.22666728,0.00001873456,0.7725899,0.00043184814,0.00020361444,0.000005827342,0.0000024422836,0.000025800624,0.000054528733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950388,0.00021895242,0.0009747794,0.0014332933,0.0016267091,0.0007074586],"domain_scores_gemma":[0.99286205,0.0025737737,0.0008985556,0.0030449687,0.00047475006,0.00014588439],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0051478017,0.00052794954,0.0006846806,0.0010469512,0.00062325574,0.0004839753,0.0066054836,0.00029654102,0.0000037301563],"category_scores_gemma":[0.0016874721,0.00039167295,0.00017184069,0.0017910574,0.003485982,0.00025165183,0.0019233578,0.001069715,0.00002479953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007156013,0.000030270576,0.000014295602,0.00006607034,0.000007248838,0.000003577747,0.00020821867,0.015225582,0.000017705326,0.5054809,0.000012056578,0.47892693],"study_design_scores_gemma":[0.0001666695,0.0002809354,0.00085496774,0.00026133872,0.0000057403277,0.000024670051,7.9142815e-8,0.7416297,0.00053198304,0.25542003,0.00048871746,0.00033513206],"about_ca_topic_score_codex":0.000020408315,"about_ca_topic_score_gemma":0.00002241767,"teacher_disagreement_score":0.72640413,"about_ca_system_score_codex":0.00038290446,"about_ca_system_score_gemma":0.00042106418,"threshold_uncertainty_score":0.9998535},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015054243,0.00015802453,0.9493829,0.0016011349,0.0034003763,0.00063074165,0.0000031117122,0.00011105243,0.0445621],"genre_scores_gemma":[0.9798661,0.00008245362,0.017734125,0.00064845145,0.0010368016,0.00000817887,0.000006215317,0.00002315312,0.00059455825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970374,0.000051623007,0.00067817525,0.00063506805,0.001018428,0.0005792932],"domain_scores_gemma":[0.99861485,0.0003448286,0.0003413454,0.000399203,0.00019707005,0.0001027205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016772471,0.00032262408,0.0004422763,0.0015595465,0.0010658974,0.00041684072,0.0008495945,0.0002107565,0.00011781473],"category_scores_gemma":[0.000058082685,0.00031385574,0.00012833299,0.0007217868,0.0011723079,0.00069869997,0.00039493642,0.00073757226,0.00007671402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009129696,0.000054081676,0.00221718,0.00021838867,0.000037262977,0.000082981416,0.08947507,0.055161424,0.000010334818,0.786105,0.00027600373,0.06635317],"study_design_scores_gemma":[0.000987575,0.00016879122,0.0009185398,0.0075163012,0.000022834165,0.000017848128,0.0002540415,0.010493124,0.000020891364,0.9446184,0.033263747,0.0017178821],"about_ca_topic_score_codex":0.0009037465,"about_ca_topic_score_gemma":0.0091753565,"teacher_disagreement_score":0.9797155,"about_ca_system_score_codex":0.001972228,"about_ca_system_score_gemma":0.00036899568,"threshold_uncertainty_score":0.99993134},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088687293,0.00006976422,0.9975816,0.00023088354,0.0006402446,0.00024682438,0.00000554271,0.00020284788,0.00013541844],"genre_scores_gemma":[0.490032,0.000013376615,0.50880647,0.00016432765,0.0007624878,0.0000070126616,0.000038921527,0.00004351486,0.00013186941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968322,0.000050122882,0.00037128036,0.0014868004,0.0006244461,0.0006351319],"domain_scores_gemma":[0.99637854,0.0011135917,0.00037302414,0.0016789881,0.000273269,0.00018257441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010747896,0.00043725505,0.00042463205,0.0005771565,0.0003588259,0.00067603943,0.0031097564,0.00014449644,0.0000043791506],"category_scores_gemma":[0.00025040153,0.0003781066,0.0000570435,0.00035190527,0.00021115932,0.0041650604,0.0013781717,0.0009776845,0.000010018874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009836105,0.000014999573,0.00017653701,0.000018524996,0.000009508416,0.000009604936,0.00086803373,0.4794078,0.00001233933,0.0007029404,3.9107317e-7,0.5187695],"study_design_scores_gemma":[0.00024085077,0.00040834513,0.00013906563,0.00048580064,0.000020177888,0.000021942475,0.0000016567903,0.99209446,0.00006694208,0.0032870183,0.0027090278,0.00052468874],"about_ca_topic_score_codex":0.000008623342,"about_ca_topic_score_gemma":0.000034091354,"teacher_disagreement_score":0.5182448,"about_ca_system_score_codex":0.00014784448,"about_ca_system_score_gemma":0.00027527235,"threshold_uncertainty_score":0.9998671},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014687158,0.00006213841,0.99683666,0.0005215717,0.0011572532,0.0007487001,0.000008330696,0.00017149659,0.0003469567],"genre_scores_gemma":[0.19695203,0.0000013567618,0.79897153,0.0033790853,0.00039283666,0.000043263386,0.0000033338267,0.00003488625,0.00022165109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630344,0.000021385285,0.0005283891,0.001789327,0.00067346747,0.00068396336],"domain_scores_gemma":[0.99751866,0.00022856539,0.00022339939,0.0015361784,0.00028356377,0.00020960942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000719432,0.00047925778,0.00042986547,0.0006540287,0.00026305104,0.0004529467,0.0030615274,0.00026861505,0.000008494854],"category_scores_gemma":[0.00007681171,0.00046409474,0.00014433154,0.0002420323,0.00012767187,0.00040295522,0.0008710371,0.00040224832,0.000017070675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018673009,0.000008965553,0.0000060358348,0.000024163604,0.0000019562017,0.000004123655,0.00079397176,0.5586279,0.00026033536,0.0023430875,0.000009121898,0.43791845],"study_design_scores_gemma":[0.00020250722,0.000095859155,0.0000045141983,0.00029462206,0.0000043387604,0.000005888259,5.459888e-8,0.95451903,0.001405815,0.04283943,0.000118311094,0.0005096111],"about_ca_topic_score_codex":0.00002790559,"about_ca_topic_score_gemma":0.000083048486,"teacher_disagreement_score":0.43740883,"about_ca_system_score_codex":0.00023229622,"about_ca_system_score_gemma":0.000481642,"threshold_uncertainty_score":0.9997811},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009911183,0.0024619976,0.99214214,0.00005786785,0.00067924254,0.00051222247,0.000021836478,0.000009283025,0.0031242957],"genre_scores_gemma":[0.042274855,0.0000815872,0.9551469,0.0004832196,0.0015114768,0.000015065188,0.00003321546,0.00005873971,0.00039492256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972891,0.00002614903,0.00048552366,0.001319698,0.00026078196,0.0006187271],"domain_scores_gemma":[0.99859565,0.00017662073,0.00026803632,0.00065262744,0.00015569667,0.00015135133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008616728,0.0004851824,0.0005025602,0.0002736234,0.00022322696,0.00009825383,0.0007115338,0.00040862217,0.000006121527],"category_scores_gemma":[0.00008859679,0.00046925334,0.00020955085,0.00014316768,0.00027439496,0.0000020157524,0.00030699503,0.00028122496,0.0000016885298],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043645203,0.00001596984,0.00026516075,0.000052617426,0.00008415381,0.000003495525,0.00046626784,0.023845118,0.05160956,0.00041082423,0.00007671539,0.92312646],"study_design_scores_gemma":[0.008297308,0.008675685,0.0012390997,0.0010773683,0.00057846936,0.0013074334,0.00006683721,0.39771914,0.2985297,0.17833179,0.09376784,0.010409319],"about_ca_topic_score_codex":0.000023604645,"about_ca_topic_score_gemma":0.00011516601,"teacher_disagreement_score":0.91271716,"about_ca_system_score_codex":0.000051869192,"about_ca_system_score_gemma":0.00040582241,"threshold_uncertainty_score":0.99977595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076054165,0.00052296795,0.95637995,0.00006609197,0.00138658,0.0001940346,0.0000058914857,0.00028568943,0.040398274],"genre_scores_gemma":[0.7021155,0.00046159013,0.29268223,0.0026410075,0.0009365598,0.000008021215,0.000028423863,0.00023226233,0.00089442625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883175,0.0000069619487,0.00021689781,0.00041151114,0.00025061998,0.00028227927],"domain_scores_gemma":[0.99932384,0.000242818,0.000068513844,0.00025238673,0.000046254474,0.00006618189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003139344,0.00026844922,0.00022327567,0.00030230335,0.000110818335,0.00014961412,0.00029311716,0.00017798568,0.000054574637],"category_scores_gemma":[0.000041248837,0.000259444,0.000025982143,0.00011237813,0.00018030519,0.00013322984,0.00010822658,0.00045496225,0.00003208423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070701367,0.000011245749,0.00025538236,0.00032761288,0.000023708293,0.00005170626,0.0024228578,0.6182761,0.000051955125,0.013982412,0.00004979535,0.36454016],"study_design_scores_gemma":[0.00027921895,0.00008363058,0.0001608452,0.0013925681,0.000014408683,0.00007803861,2.8964442e-7,0.9309366,0.00062731584,0.06301739,0.002585245,0.0008244943],"about_ca_topic_score_codex":0.00000679837,"about_ca_topic_score_gemma":0.000013116506,"teacher_disagreement_score":0.7013549,"about_ca_system_score_codex":0.00005372949,"about_ca_system_score_gemma":0.000030246165,"threshold_uncertainty_score":0.99998575},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023276283,0.0006012019,0.9939123,0.0017392336,0.0010195575,0.00050853123,0.000030485686,0.00010994948,0.0018459734],"genre_scores_gemma":[0.1701635,0.00011486955,0.8266372,0.001692311,0.0005128335,0.00003527433,0.000044755998,0.000040109044,0.0007591294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970161,0.000019392792,0.0005401162,0.0010451504,0.0005682364,0.00081105484],"domain_scores_gemma":[0.99826175,0.00054308464,0.0002696864,0.00065221445,0.00019132209,0.00008193313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010372541,0.00040630146,0.00057174935,0.0007548038,0.0002597549,0.00057198986,0.0017153559,0.0003636088,0.0000020780433],"category_scores_gemma":[0.00017824612,0.0003766304,0.00009801943,0.0004522416,0.00039554213,0.00076632097,0.00097514276,0.0004423375,0.0000036357308],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009789931,0.00009154383,0.003296137,0.00025974543,0.00003004252,0.00010431003,0.0021396785,0.019803073,0.00009857699,0.17734948,0.0008228543,0.79599476],"study_design_scores_gemma":[0.0007528673,0.00018829091,0.0058757258,0.0004220061,0.000015523021,0.000053785086,0.0000013919752,0.5614087,0.00038796797,0.42491964,0.005051054,0.00092307007],"about_ca_topic_score_codex":0.00022233195,"about_ca_topic_score_gemma":0.0010947743,"teacher_disagreement_score":0.7950717,"about_ca_system_score_codex":0.00025188588,"about_ca_system_score_gemma":0.0004427894,"threshold_uncertainty_score":0.9998686},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022857771,0.00020204374,0.9956057,0.00036569987,0.0004131255,0.00052865647,0.0000048622824,0.00017894269,0.00041517205],"genre_scores_gemma":[0.2947594,0.000045214503,0.7047552,0.00014185076,0.00013444938,0.00001644674,0.0000018513027,0.000029651916,0.000115950905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655735,0.000030653424,0.00042567862,0.001287628,0.0011495142,0.0005491817],"domain_scores_gemma":[0.99503434,0.0018405281,0.00019107363,0.0023264384,0.00035713697,0.00025045674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073050405,0.00039860132,0.00049227953,0.00077275134,0.00010785941,0.000492034,0.004689912,0.00023648748,0.000023073217],"category_scores_gemma":[0.0006115345,0.00035599648,0.00005600722,0.00046030365,0.00066558487,0.00078899285,0.0020812266,0.0006993989,0.000010143139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003848904,0.0002445866,0.014779929,0.00046749233,0.000043658783,0.00015635973,0.0017771417,0.06507642,0.007435711,0.024042359,0.00016136083,0.88581115],"study_design_scores_gemma":[0.00032007488,0.00082916446,0.022457216,0.0005597115,0.000006752177,0.00006363463,1.1692339e-7,0.935175,0.0019596368,0.03753439,0.00035216345,0.00074213493],"about_ca_topic_score_codex":0.000028041475,"about_ca_topic_score_gemma":0.000007672707,"teacher_disagreement_score":0.885069,"about_ca_system_score_codex":0.00019115991,"about_ca_system_score_gemma":0.00066290074,"threshold_uncertainty_score":0.9998892},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025477773,0.00005598853,0.9719697,0.00012432289,0.0013172531,0.0005104371,0.00003263067,0.000058262674,0.00045358055],"genre_scores_gemma":[0.9950066,0.00008769628,0.003572874,0.0007126168,0.00032135408,0.00001451803,0.000008364015,0.000033716922,0.00024222705],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976978,0.000032150656,0.00040986922,0.0007499925,0.000707453,0.0004027488],"domain_scores_gemma":[0.99792534,0.0012986376,0.00030327882,0.0002859065,0.00011544593,0.00007136667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046394052,0.00035792444,0.00035023445,0.00045048888,0.00035823157,0.000321922,0.000746063,0.00020330727,0.00009056331],"category_scores_gemma":[0.00014356607,0.00022598876,0.00012655063,0.00020333883,0.000686938,0.00019832622,0.00020381768,0.00044390777,0.000008894734],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056768098,0.00007955654,0.000011395578,0.00017066913,0.000005076423,0.0000046972655,0.0009944026,0.00093200145,0.14729127,0.004763853,0.0000048599027,0.8456854],"study_design_scores_gemma":[0.0006904295,0.0013002377,0.0001907957,0.0010933705,0.000046852318,0.000028306496,0.00001393421,0.09364633,0.6392479,0.2625718,0.00025598155,0.0009140849],"about_ca_topic_score_codex":0.0000035880466,"about_ca_topic_score_gemma":0.00004088105,"teacher_disagreement_score":0.96952885,"about_ca_system_score_codex":0.00010456578,"about_ca_system_score_gemma":0.00013113103,"threshold_uncertainty_score":0.9215554},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015541491,0.00020392402,0.9828411,0.00001289014,0.00034367538,0.0005626722,0.0000031068403,0.00044156145,0.000049592858],"genre_scores_gemma":[0.44162053,0.000009705065,0.5582315,0.000029909137,0.00005701907,0.00002009763,0.0000012964182,0.00002200642,0.000007989785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709517,0.000041638934,0.00050048664,0.0010902493,0.0007313408,0.0005410986],"domain_scores_gemma":[0.99804074,0.00013214306,0.00025685006,0.0011647023,0.000208368,0.00019721678],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000923506,0.00045094808,0.00050051016,0.0007729969,0.0002989676,0.00017215397,0.0018027156,0.00021983312,0.0000020752677],"category_scores_gemma":[0.0000074119666,0.00043704058,0.00004893968,0.00037098659,0.00016695468,0.00107156,0.0013174752,0.00053714134,0.000001771474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033614353,0.00031637706,0.0011119574,0.00007940025,0.000026031586,0.000011621672,0.0678331,0.4461148,0.00035544107,0.008370203,0.0000033936528,0.4757743],"study_design_scores_gemma":[0.00020014196,0.00027966066,0.00023251936,0.00020939438,0.000010728629,0.000012834845,0.0000037442828,0.9934743,0.0013587819,0.003430337,0.00025611246,0.00053144485],"about_ca_topic_score_codex":0.000006563009,"about_ca_topic_score_gemma":0.00018845823,"teacher_disagreement_score":0.54735947,"about_ca_system_score_codex":0.000188286,"about_ca_system_score_gemma":0.00023258274,"threshold_uncertainty_score":0.99980813},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021032822,0.0008140361,0.99472505,0.0002580297,0.0010358061,0.00022940063,0.000010645667,0.00016622001,0.0025505023],"genre_scores_gemma":[0.06667232,0.00012396771,0.93130225,0.00097563176,0.00061951234,0.0000028676614,0.0000121871235,0.000033741337,0.00025751928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644053,0.000022131198,0.0004517618,0.0015183584,0.0009123547,0.0006548607],"domain_scores_gemma":[0.9976934,0.0003874654,0.00022162696,0.0013055142,0.00014704166,0.00024495143],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008947858,0.00048212815,0.00048816763,0.0007159045,0.0003600869,0.0006618197,0.002627468,0.00027127957,0.000019167293],"category_scores_gemma":[0.000044685392,0.0004200535,0.00007532642,0.00042045332,0.0009557696,0.0008058288,0.002973107,0.0007647756,0.000018600216],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004011956,0.000018726923,0.00008319807,0.000019977408,0.000005459427,0.000093732495,0.00026405463,0.0011311063,0.000045864403,0.08787189,0.000021691074,0.91044027],"study_design_scores_gemma":[0.0004276138,0.00020900178,0.0019299588,0.0005333535,0.000007659384,0.00016739295,2.4209945e-7,0.6916273,0.00068086025,0.29694477,0.006459644,0.0010121489],"about_ca_topic_score_codex":0.00006957588,"about_ca_topic_score_gemma":0.00019787288,"teacher_disagreement_score":0.9094281,"about_ca_system_score_codex":0.00015136732,"about_ca_system_score_gemma":0.0002212381,"threshold_uncertainty_score":0.9998251},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048222183,0.00008349654,0.9959632,0.00067614374,0.0016916848,0.0006192312,0.000027427091,0.00014672785,0.00030987858],"genre_scores_gemma":[0.010222082,0.0000043454565,0.9875529,0.0009522843,0.0008385597,0.000013779031,0.00001952618,0.000037006415,0.00035955358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960757,0.00003928788,0.00082475354,0.0015684034,0.00080485054,0.0006869881],"domain_scores_gemma":[0.9955834,0.0017620673,0.0007866432,0.0012026642,0.00049097755,0.0001742235],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025048559,0.00039882414,0.0005429791,0.00042964594,0.00044838796,0.0010411747,0.002068641,0.0004528435,0.0000118496355],"category_scores_gemma":[0.00065683597,0.00038905753,0.00019729705,0.0005085155,0.00025214444,0.00066958746,0.0007772448,0.00059030316,0.00003504007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045061465,0.000045735167,0.00016300808,0.000052278716,0.000015131617,0.0000070921137,0.00014688402,0.0069583044,0.00027389967,0.0026645246,0.0001117467,0.9895569],"study_design_scores_gemma":[0.00033931644,0.000114619164,0.0001587961,0.00018174748,0.000020707756,0.000008174978,1.9057438e-7,0.9863002,0.00046196423,0.010774789,0.001173284,0.00046626138],"about_ca_topic_score_codex":0.000034051656,"about_ca_topic_score_gemma":0.000010053048,"teacher_disagreement_score":0.9890906,"about_ca_system_score_codex":0.0004936973,"about_ca_system_score_gemma":0.00092785904,"threshold_uncertainty_score":0.9999958},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000084083775,0.00016579781,0.9961761,0.00076773413,0.00059575174,0.00087192847,0.000005263171,0.00007989422,0.0012534454],"genre_scores_gemma":[0.22427358,0.0000032528103,0.772792,0.0019710448,0.0004719414,0.000073717005,0.000050864724,0.000026478987,0.00033714756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972995,0.000026253228,0.0003040398,0.0011385217,0.00081451976,0.00041714948],"domain_scores_gemma":[0.99823153,0.00039706248,0.00022732123,0.00078746927,0.00026677013,0.00008982874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005170249,0.0003903232,0.0002886839,0.00042715637,0.00041169053,0.0005909666,0.0017265694,0.00014726605,0.0000074586355],"category_scores_gemma":[0.00003347286,0.00026552766,0.00008755394,0.00056355726,0.00030412799,0.0005051616,0.00035161333,0.00033091716,0.000006630397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016094327,0.00003734933,0.0000062448185,0.000019582687,0.000017780709,0.0000061158858,0.0006852754,0.831861,0.00021669336,0.058221646,0.00004171417,0.10887048],"study_design_scores_gemma":[0.0006897562,0.0002746574,0.00002860102,0.000080021295,0.000012553737,0.000050732833,3.6333958e-7,0.9312911,0.0054860474,0.06073637,0.00085380016,0.00049600593],"about_ca_topic_score_codex":0.000008959405,"about_ca_topic_score_gemma":0.000011618411,"teacher_disagreement_score":0.22418949,"about_ca_system_score_codex":0.00023056038,"about_ca_system_score_gemma":0.00052925985,"threshold_uncertainty_score":0.9999797},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007651486,0.00019163708,0.9956025,0.00046218061,0.0019635265,0.00072918297,0.000010925429,0.00019660308,0.0007669286],"genre_scores_gemma":[0.06841906,0.0000066547677,0.9298554,0.00078340125,0.0007155701,0.000022540467,0.000015832495,0.00003810461,0.00014339706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964359,0.000036341,0.00059307844,0.0014698049,0.0008020084,0.0006628601],"domain_scores_gemma":[0.99698037,0.0007127201,0.00036517554,0.0014099412,0.00038002105,0.0001517908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010592367,0.00048923184,0.00052954484,0.0010705835,0.0006098611,0.000695966,0.0026817168,0.00030936804,0.0000132628165],"category_scores_gemma":[0.00013363741,0.0004972179,0.00024734298,0.00076005445,0.0005679118,0.0005754724,0.00078789674,0.00052025577,0.000015194254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036792553,0.0000260646,0.00001821418,0.00008276691,0.000014757372,0.000007313758,0.0004997074,0.06420109,0.0001934364,0.2926229,0.000014617244,0.64231545],"study_design_scores_gemma":[0.00017073932,0.000064599386,0.000030832853,0.0001651712,0.000008786669,0.00003609671,5.9012887e-8,0.6346477,0.00017983315,0.36320853,0.0011049976,0.00038261036],"about_ca_topic_score_codex":0.00002191183,"about_ca_topic_score_gemma":0.000044670476,"teacher_disagreement_score":0.64193285,"about_ca_system_score_codex":0.00030096807,"about_ca_system_score_gemma":0.00047490004,"threshold_uncertainty_score":0.99974793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064320356,0.00053530716,0.9321824,0.00061241264,0.0014086411,0.0003238254,0.0000025276322,0.00013076433,0.00048381998],"genre_scores_gemma":[0.96923137,0.000020796982,0.029148558,0.0009443074,0.00041677282,0.0000016057888,0.0000018358631,0.000029094494,0.0002056656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996494,0.000094727475,0.00069588167,0.0012265078,0.00089552515,0.0005933567],"domain_scores_gemma":[0.99596524,0.0019241392,0.0006276896,0.0011705755,0.00016845069,0.00014387739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014398547,0.0005573195,0.0006157038,0.00033444565,0.00040529296,0.00043156635,0.0031470687,0.00022459752,0.000003315543],"category_scores_gemma":[0.00017486706,0.00038366008,0.00014455261,0.00041998256,0.0008703787,0.000050727678,0.002954433,0.0007244674,0.0000033027832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013777447,0.0000760262,0.004258322,0.00046608844,0.000107912856,0.000024256784,0.015156741,0.15049806,0.000759836,0.008269576,0.00021056758,0.82015884],"study_design_scores_gemma":[0.00075484207,0.0005639262,0.008487019,0.0021216676,0.000058272042,0.00004867389,0.0000141764485,0.9568162,0.00207698,0.021033771,0.0063832705,0.0016411961],"about_ca_topic_score_codex":0.000063376916,"about_ca_topic_score_gemma":0.000025501613,"teacher_disagreement_score":0.904911,"about_ca_system_score_codex":0.00014115225,"about_ca_system_score_gemma":0.0001360583,"threshold_uncertainty_score":0.99986154},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003004889,0.000026980477,0.9968729,0.00040270045,0.00049516134,0.00026346318,0.000030027957,0.00006088329,0.0015473855],"genre_scores_gemma":[0.9423098,0.00015587246,0.048609424,0.008271339,0.00036573794,0.000010431096,0.0000640726,0.000030005594,0.00018329755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975184,0.000042375443,0.0006221007,0.0004134659,0.0010659641,0.00033765298],"domain_scores_gemma":[0.99734694,0.0002963798,0.00060854584,0.0010474802,0.00059829024,0.000102382575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081623864,0.00032741082,0.00033723676,0.0005346599,0.00017293474,0.00036988937,0.0024172342,0.00018281068,0.000032311455],"category_scores_gemma":[0.00025069955,0.00023802136,0.000073089206,0.00073324994,0.0004937151,0.0016323013,0.00081307936,0.00035566033,0.00008080012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052312516,0.00002840279,0.00006594159,0.000031358923,0.000011081884,0.0000022048084,0.0012043874,0.012869258,0.000016254886,0.80916417,0.00005362157,0.1765481],"study_design_scores_gemma":[0.00034610665,0.00042692234,0.006071249,0.0010576049,0.00003008672,0.000024386352,0.0000015865927,0.91559845,0.0017390014,0.050826218,0.022753622,0.0011247476],"about_ca_topic_score_codex":0.000008531225,"about_ca_topic_score_gemma":0.000003651659,"teacher_disagreement_score":0.94826347,"about_ca_system_score_codex":0.0001300907,"about_ca_system_score_gemma":0.00040230787,"threshold_uncertainty_score":0.9706229},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004381551,0.00017088193,0.9886375,0.00091010024,0.0019059816,0.0007028535,0.000019688181,0.00019974625,0.007409434],"genre_scores_gemma":[0.065419436,0.00007256127,0.9285024,0.0028461432,0.0013425674,0.000042638956,0.000016332437,0.00008342882,0.0016745182],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995043,0.000048057194,0.000604138,0.0023118183,0.0011698629,0.00082314666],"domain_scores_gemma":[0.99626976,0.00035279265,0.00031195045,0.002326411,0.0003341824,0.00040492372],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006952221,0.00068790297,0.000644541,0.000881635,0.00024842855,0.0006110881,0.006040474,0.0002852985,0.00005908801],"category_scores_gemma":[0.00017032225,0.00057234295,0.00014295829,0.00069428835,0.0009082168,0.0008525088,0.0039490964,0.0007719024,0.00024201139],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019567768,0.00008574064,0.000020697025,0.000042013686,0.00001893562,0.00021640878,0.0032249242,0.025287997,0.000063365515,0.076703206,0.00046152304,0.89385563],"study_design_scores_gemma":[0.00030463212,0.000538042,0.00024608138,0.00089301623,0.000010893535,0.000058875463,2.1176233e-7,0.46475783,0.0008143085,0.52093506,0.010303178,0.0011378799],"about_ca_topic_score_codex":0.00012879363,"about_ca_topic_score_gemma":0.00018234806,"teacher_disagreement_score":0.8927177,"about_ca_system_score_codex":0.0003031483,"about_ca_system_score_gemma":0.00046302922,"threshold_uncertainty_score":0.99967283},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081009135,0.00015716323,0.89680725,0.00012329093,0.00078222924,0.00025633213,0.0000017823094,0.00016337546,0.02069946],"genre_scores_gemma":[0.8392946,0.000003465741,0.15764807,0.00022058272,0.00033673734,0.000010411389,0.000015839023,0.000054053777,0.0024162154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969532,0.00025120765,0.00033562005,0.0014772421,0.0004454816,0.0005372392],"domain_scores_gemma":[0.99787474,0.0005682426,0.00028835327,0.0010634607,0.0001076282,0.00009759475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016534183,0.00042159128,0.0005078569,0.0006441336,0.0006646469,0.00029121718,0.001048414,0.00019281653,0.00014807339],"category_scores_gemma":[0.00022091354,0.00034321286,0.000028743989,0.00032952713,0.00080869993,0.00026304304,0.0006490567,0.0020061487,0.000046818564],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013201313,0.000104179235,0.008968089,0.00011712053,0.00021148933,0.00023945194,0.05298377,0.070019744,0.0019397455,0.02285067,0.000046827216,0.8423869],"study_design_scores_gemma":[0.007676048,0.004586646,0.1961362,0.01100158,0.00032371003,0.0019516075,0.00028343053,0.72211134,0.0023949232,0.017646028,0.026019359,0.009869084],"about_ca_topic_score_codex":0.00008289693,"about_ca_topic_score_gemma":0.000012661332,"teacher_disagreement_score":0.8325178,"about_ca_system_score_codex":0.0000968809,"about_ca_system_score_gemma":0.00008126865,"threshold_uncertainty_score":0.999902},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081666276,0.00011186925,0.91704494,0.00012615419,0.00070912443,0.00019499542,0.0000029139262,0.0001395138,0.0000041826597],"genre_scores_gemma":[0.5485681,0.0000015389843,0.45115378,0.00019949007,0.000062213825,0.000005474108,0.0000063149605,0.0000029396679,1.0659387e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998256,0.0000834286,0.00032288508,0.00038959555,0.00058420765,0.00036385588],"domain_scores_gemma":[0.9987591,0.00034343693,0.00015780481,0.0005058911,0.000101596626,0.00013219424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005642423,0.00014637971,0.00020306084,0.00027870218,0.000085371,0.00010866203,0.0009317458,0.00006316063,0.000020810374],"category_scores_gemma":[0.00010920807,0.000132351,0.000036315978,0.0010167683,0.00041166716,0.0013061523,0.00032486932,0.00014313785,0.000011037692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043712203,0.00010219323,0.007989874,0.0000080067275,0.0000035521869,0.000002812057,0.0025698654,0.006022118,0.011166249,0.00012732108,0.000004386657,0.9719992],"study_design_scores_gemma":[0.0002841408,0.00015218678,0.09341892,0.000080996906,0.0000053654476,0.000018062621,0.0000037985894,0.79505867,0.105461225,0.0052691326,0.000002783924,0.00024474648],"about_ca_topic_score_codex":0.000109664965,"about_ca_topic_score_gemma":0.000013471746,"teacher_disagreement_score":0.9717545,"about_ca_system_score_codex":0.00007698066,"about_ca_system_score_gemma":0.000056943147,"threshold_uncertainty_score":0.5397117},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047875375,0.00029262537,0.9969483,0.00028686106,0.0010758882,0.00066093786,0.000007430522,0.00011120171,0.00056888396],"genre_scores_gemma":[0.38313153,0.000018458068,0.6134506,0.001485557,0.0010907003,0.00011422606,0.000057762176,0.00011353886,0.0005376336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889684,0.000005640704,0.00022597656,0.0003394621,0.0002806401,0.00025146996],"domain_scores_gemma":[0.9990944,0.000376047,0.000058908947,0.00028855875,0.00013283956,0.00004924694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027526057,0.00021175861,0.00016481156,0.00013939699,0.0002234054,0.0002478018,0.0003593847,0.00013690698,0.000080669764],"category_scores_gemma":[0.000025055379,0.000166123,0.00005220556,0.00013280664,0.0001466127,0.00010345247,0.000056039855,0.00025678976,0.00002372196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.972917e-7,0.0000026850792,0.000008909088,0.000034572982,0.000005226398,6.02526e-7,0.000044077162,0.95330614,0.0002228664,0.000666614,0.00023814404,0.04546915],"study_design_scores_gemma":[0.00015326781,0.000032019503,0.00001789163,0.00011632865,0.000008327864,0.000002375299,1.5855857e-8,0.99130887,0.0004488742,0.0062583545,0.0014425137,0.00021116588],"about_ca_topic_score_codex":0.000008716315,"about_ca_topic_score_gemma":0.000104269435,"teacher_disagreement_score":0.38349771,"about_ca_system_score_codex":0.00010705036,"about_ca_system_score_gemma":0.000091499176,"threshold_uncertainty_score":0.67743},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003652613,0.005431819,0.9919372,0.0008601329,0.0005336286,0.00043539013,0.0000047716003,0.00015093069,0.00060958316],"genre_scores_gemma":[0.09317434,0.00009119114,0.90573454,0.0006219253,0.00007988095,0.000013038032,0.0000011234818,0.000024337714,0.0002596466],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974652,0.000048287697,0.0004540097,0.0009731112,0.00063415227,0.0004252629],"domain_scores_gemma":[0.9968594,0.00062089565,0.00038412755,0.0016084862,0.00042859072,0.00009852399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008289724,0.00039714013,0.00041620058,0.0003159956,0.0002844108,0.00036205773,0.004437685,0.00024379599,0.0000054169514],"category_scores_gemma":[0.00030486472,0.00023013464,0.00007320218,0.0003673567,0.0019437621,0.0003759673,0.0022591755,0.00064536976,0.0000020326163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007836177,0.000011668877,0.000010698751,0.000026666423,0.000010014261,0.000023750603,0.0013423293,0.0000135071905,0.000108935266,0.4174053,0.000037858244,0.58100146],"study_design_scores_gemma":[0.00013017445,0.00016503684,0.0000143697835,0.00024187815,0.000006244398,0.00004643455,2.1354748e-7,0.017855242,0.004493664,0.9762629,0.00045482226,0.00032896994],"about_ca_topic_score_codex":0.000035610698,"about_ca_topic_score_gemma":0.00013586816,"teacher_disagreement_score":0.58067244,"about_ca_system_score_codex":0.00010780629,"about_ca_system_score_gemma":0.00034418682,"threshold_uncertainty_score":0.9384618},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038026585,0.0003398007,0.9925687,0.00015296582,0.00041612858,0.00040541717,0.000019823416,0.000049142975,0.002245375],"genre_scores_gemma":[0.6816191,0.0000056514577,0.31780797,0.00011474867,0.00011710623,0.0000111595555,0.00002987486,0.000019885565,0.0002745078],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818444,0.000031471904,0.0005046572,0.00054240343,0.00050303806,0.00023398179],"domain_scores_gemma":[0.9983874,0.0006432585,0.00039243678,0.00029120554,0.0002209464,0.00006476095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002803345,0.0002801209,0.000390984,0.00036025053,0.0001239307,0.00006639428,0.00043487534,0.00025819492,0.00016277238],"category_scores_gemma":[0.00012768104,0.00024569372,0.00008513585,0.00023858272,0.0004550307,0.00021202944,0.00027156065,0.00030112718,0.000022068714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034049488,0.0009105917,0.00016845172,0.00036625905,0.000048138838,0.00003863551,0.00086906,0.0023822181,0.034375142,0.22328565,0.004236108,0.7332857],"study_design_scores_gemma":[0.00050076173,0.00040005383,0.00043898833,0.00036541923,0.000022426313,0.00004316676,0.000001324351,0.18443348,0.0170919,0.7958761,0.0002023872,0.00062401086],"about_ca_topic_score_codex":0.000014117578,"about_ca_topic_score_gemma":0.0000011057701,"teacher_disagreement_score":0.73266166,"about_ca_system_score_codex":0.00020491867,"about_ca_system_score_gemma":0.00008214018,"threshold_uncertainty_score":0.9999995},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029602816,0.0014352042,0.9942912,0.0004096696,0.0013965286,0.00039886707,0.000004667956,0.000057600882,0.0017102363],"genre_scores_gemma":[0.8749629,0.00019759212,0.12373284,0.00026159085,0.0005476452,0.000020683648,0.0000073324586,0.000038657643,0.00023072111],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711585,0.00005007211,0.00063287525,0.000785686,0.00092485244,0.0004906705],"domain_scores_gemma":[0.99750465,0.00061319413,0.0004307151,0.0011479786,0.00023275983,0.00007072743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009774948,0.0003243581,0.00034486805,0.00052794314,0.00035809516,0.00039562903,0.0027176593,0.00015810295,0.0000060756183],"category_scores_gemma":[0.000016563898,0.00022624509,0.00017082875,0.00070857676,0.0007529682,0.00028276752,0.0005987918,0.0003917208,0.000010197614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035710218,0.000025519203,0.00059360825,0.00007747268,0.000027737775,0.000026508831,0.0007228763,0.010575378,0.00026420143,0.17514373,0.00011765127,0.81242174],"study_design_scores_gemma":[0.001034949,0.0006907731,0.0055322787,0.00083864335,0.000047627273,0.00013722666,0.0000039177226,0.25458997,0.013688238,0.70938283,0.012373222,0.001680318],"about_ca_topic_score_codex":0.00016102976,"about_ca_topic_score_gemma":0.0003956234,"teacher_disagreement_score":0.8746669,"about_ca_system_score_codex":0.000097141696,"about_ca_system_score_gemma":0.00034277808,"threshold_uncertainty_score":0.9226007},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007587465,0.0025772857,0.9947797,0.00023127839,0.0012780987,0.00039729773,0.0000053176886,0.00019630813,0.0004588272],"genre_scores_gemma":[0.13929139,0.0020334285,0.85607314,0.0018400134,0.0005288148,0.0000073278584,0.00005176733,0.000066499735,0.00010765045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964206,0.000081391045,0.00067077955,0.0013058591,0.00077504397,0.00074629864],"domain_scores_gemma":[0.9965593,0.0005762934,0.00036702838,0.0017812828,0.00049166556,0.00022437816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010570615,0.0005611101,0.0005241316,0.00064338394,0.0005739353,0.000746467,0.0032826774,0.00039287366,0.000046892837],"category_scores_gemma":[0.000079260375,0.0005522946,0.00013184626,0.0013058282,0.000613289,0.0007497859,0.0022003644,0.0010430741,0.0000086548125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045666998,0.000016763513,0.000018428898,0.000005955464,0.000006799382,0.00001898639,0.0001611005,0.612601,0.000025594822,0.0026209962,0.000007958858,0.3845119],"study_design_scores_gemma":[0.0003047273,0.00005322194,0.000077027595,0.00041709616,0.000008710912,0.000032180225,1.3359022e-7,0.9958311,0.00008124266,0.0010859221,0.0014933309,0.000615334],"about_ca_topic_score_codex":0.0000036969243,"about_ca_topic_score_gemma":0.000090225156,"teacher_disagreement_score":0.38389656,"about_ca_system_score_codex":0.00059301354,"about_ca_system_score_gemma":0.0003309534,"threshold_uncertainty_score":0.99969286},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008990759,0.000057835652,0.9813471,0.00018204535,0.00012066062,0.00041099897,0.00000612487,0.000073399104,0.00881108],"genre_scores_gemma":[0.98850954,0.0000041079074,0.009725667,0.00041433724,0.0009214226,0.000014151219,0.000027066659,0.000033244818,0.00035043934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975431,0.000039295694,0.00049067853,0.0008796965,0.00046041337,0.0005868337],"domain_scores_gemma":[0.99878293,0.00024696044,0.00026981602,0.00047269912,0.00013528508,0.00009227781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035520073,0.00045290968,0.0005926334,0.0004545311,0.00021422331,0.00023031454,0.0009861605,0.00023316294,0.00079748785],"category_scores_gemma":[0.000005222872,0.0004313699,0.00015587783,0.00045308098,0.0010710054,0.00021574527,0.00065249094,0.0009333693,0.000074498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064218875,0.000066272376,0.003159051,0.000008498902,0.000034038567,0.000012280466,0.00024164152,0.2466437,0.00026862574,0.022153426,0.0002255728,0.7271805],"study_design_scores_gemma":[0.00038349075,0.00005352895,0.0057549262,0.00045108638,0.000025411327,0.000003844747,4.4020473e-7,0.54503506,0.00013152025,0.44674996,0.00043877552,0.0009719779],"about_ca_topic_score_codex":0.00009999191,"about_ca_topic_score_gemma":0.000033544482,"teacher_disagreement_score":0.97951883,"about_ca_system_score_codex":0.00018332415,"about_ca_system_score_gemma":0.0001804998,"threshold_uncertainty_score":0.9998138},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049586752,0.0015334556,0.9860168,0.00020587693,0.00082515035,0.0004446479,0.000015578036,0.00003439472,0.0059654186],"genre_scores_gemma":[0.44899556,0.00064723374,0.534722,0.0028643894,0.006635548,0.000023183647,0.00043414734,0.000246626,0.005431332],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99796844,0.000013285439,0.0002770596,0.00096390385,0.0003571151,0.0004202061],"domain_scores_gemma":[0.9987492,0.000023850263,0.0001571914,0.00081222825,0.00015185139,0.00010567037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047524695,0.00033502345,0.0002674251,0.00024385109,0.0001245946,0.00010879044,0.0009144927,0.00042707697,0.00006329901],"category_scores_gemma":[0.000050567764,0.00032239276,0.00010259893,0.00013431498,0.00039038612,0.0000053528843,0.0006398972,0.00051623216,0.00003910745],"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.000011515466,0.00002078013,0.00016816506,0.00006361023,0.000044619384,0.000040718744,0.00013647568,0.0018371969,0.84915394,0.00018912682,0.0000079113215,0.14832592],"study_design_scores_gemma":[0.002891227,0.0022522034,0.0043396824,0.001147855,0.00021068333,0.00064176146,0.000001045949,0.019381994,0.45378947,0.06090039,0.44676572,0.007677959],"about_ca_topic_score_codex":0.0000036511237,"about_ca_topic_score_gemma":0.00002448967,"teacher_disagreement_score":0.4512948,"about_ca_system_score_codex":0.000046585505,"about_ca_system_score_gemma":0.00017268071,"threshold_uncertainty_score":0.9999228},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14367764,0.000113652604,0.8553055,0.00018268969,0.00047888968,0.00021019709,0.000002877791,0.000013661461,0.00001492293],"genre_scores_gemma":[0.6229315,0.0000043903474,0.37610158,0.00051812246,0.00040350354,0.00001703332,0.000009931755,0.0000099731515,0.000003972336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862623,0.00002648917,0.00015857197,0.000585799,0.00018977973,0.00041310352],"domain_scores_gemma":[0.9992867,0.000093028066,0.00004944768,0.00040605912,0.000092495844,0.0000722488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056934013,0.00014807336,0.00013194227,0.00010730171,0.000113903705,0.00008887975,0.0005121104,0.00009028924,0.000004052257],"category_scores_gemma":[0.00021432443,0.00013287798,0.00006404384,0.00029195967,0.00016869066,0.000008207477,0.00019396059,0.00006895433,0.0000055215983],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012300958,0.000040984327,0.0017499501,0.0000207793,0.000009945923,8.749961e-7,0.00011090217,0.03477317,0.16101623,0.000018809445,0.000043511314,0.8022025],"study_design_scores_gemma":[0.0006054736,0.0005549631,0.0011036753,0.000022982995,0.000005905409,0.000011150249,5.5151713e-7,0.655275,0.33557722,0.0025001979,0.0040086717,0.00033423718],"about_ca_topic_score_codex":0.0000064502237,"about_ca_topic_score_gemma":0.000012822876,"teacher_disagreement_score":0.8018683,"about_ca_system_score_codex":0.0000221531,"about_ca_system_score_gemma":0.00005004015,"threshold_uncertainty_score":0.54186064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006130032,0.000248413,0.9966204,0.000017841629,0.00038547654,0.00022190879,0.0000029513667,0.000018878192,0.0018710931],"genre_scores_gemma":[0.32969072,0.00008019273,0.6682388,0.000321544,0.0007090713,0.000017846549,0.000030504003,0.00009130931,0.0008199881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875987,0.000008381371,0.00015283842,0.00059644674,0.00023572346,0.00024674428],"domain_scores_gemma":[0.99926865,0.000018053881,0.00009126779,0.00043696782,0.00011935817,0.00006567511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021325593,0.000252007,0.00017367306,0.0001341935,0.000060070484,0.000046890575,0.00041133282,0.00022786418,0.000036036454],"category_scores_gemma":[0.0000375751,0.00020852665,0.000043741544,0.00007108918,0.00012882422,0.0000025589438,0.00016707167,0.00014125883,0.0000117119025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002148495,0.000009924328,0.0000050307262,0.00001897417,0.000009127664,0.000007985227,0.000034180335,0.951424,0.021623615,0.00026341932,0.0000021180963,0.026580138],"study_design_scores_gemma":[0.00039660122,0.0009921301,0.000022157776,0.00057062967,0.000024842027,0.00007435838,8.953112e-8,0.6302586,0.36273623,0.0010601992,0.0027816033,0.0010825625],"about_ca_topic_score_codex":0.0000041401336,"about_ca_topic_score_gemma":0.0000036865686,"teacher_disagreement_score":0.3411126,"about_ca_system_score_codex":0.000029546147,"about_ca_system_score_gemma":0.00010646141,"threshold_uncertainty_score":0.850347},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017044641,0.0025321837,0.9850511,0.0070078387,0.002429937,0.00042045728,0.000002020959,0.00014080145,0.0022452234],"genre_scores_gemma":[0.7353433,0.0012737004,0.23910733,0.017997647,0.0030225497,0.000057734727,0.00000608813,0.00013925336,0.003052416],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702436,0.00008178972,0.00040254174,0.0010916102,0.00078262575,0.0006170592],"domain_scores_gemma":[0.99477214,0.0029597536,0.00028213018,0.0017583184,0.00010961196,0.00011801991],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002504603,0.00046408083,0.00042912798,0.00023849076,0.0011777412,0.0017077508,0.004687987,0.000286619,0.000008312414],"category_scores_gemma":[0.00018514409,0.0002363548,0.00013249471,0.00038967727,0.002954116,0.00034009205,0.0019753368,0.0016578771,0.000024034185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008889745,0.000004532661,0.000009461252,0.000009091184,0.000011126711,0.000030073164,0.0011670032,0.0004982986,0.00005607141,0.30318266,0.000022494301,0.6950003],"study_design_scores_gemma":[0.00060226733,0.000042913383,0.000065788365,0.00010966625,0.0000095886335,0.00024159744,4.4486384e-7,0.25944677,0.00044177592,0.7228123,0.015803296,0.0004235724],"about_ca_topic_score_codex":0.000022072021,"about_ca_topic_score_gemma":0.00006597314,"teacher_disagreement_score":0.7459438,"about_ca_system_score_codex":0.000068694506,"about_ca_system_score_gemma":0.00027496082,"threshold_uncertainty_score":0.99975926},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080601237,0.00024325622,0.99288684,0.00015763067,0.0008342288,0.0004695391,0.0000064302762,0.00006789461,0.004528183],"genre_scores_gemma":[0.7883567,0.000024251576,0.21106973,0.00044314237,0.00007011953,0.000009598222,0.000012392063,0.000010897318,0.0000031540046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972911,0.00005269136,0.0007591949,0.0006433231,0.0007433003,0.00051041064],"domain_scores_gemma":[0.99778235,0.00027879362,0.00039769904,0.0011996293,0.00021320017,0.00012832532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011118274,0.0003746755,0.00046352268,0.0008502743,0.00008016516,0.00031611428,0.0025919206,0.0002808777,0.000018521327],"category_scores_gemma":[0.00008703231,0.00031932388,0.00007987134,0.000614986,0.00061756035,0.002530662,0.0005556234,0.00051446655,0.000025839234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009869508,0.00004745843,0.00025702806,0.000092379516,0.000003494674,0.000007279902,0.004772926,0.0960513,0.0000062340137,0.08277801,0.000002911118,0.81597114],"study_design_scores_gemma":[0.00015115511,0.00017782376,0.0005498338,0.00023721097,0.000003972112,0.000022773907,3.5507142e-7,0.7207973,0.0000453038,0.27764815,0.00006508478,0.00030101734],"about_ca_topic_score_codex":0.00002845819,"about_ca_topic_score_gemma":0.000057560654,"teacher_disagreement_score":0.8156701,"about_ca_system_score_codex":0.00022014408,"about_ca_system_score_gemma":0.00032274376,"threshold_uncertainty_score":0.9999259},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012524614,0.00037280025,0.97390556,0.00057822687,0.0023931246,0.0004677121,0.0000045109205,0.0003277494,0.021937797],"genre_scores_gemma":[0.016184192,0.00001551782,0.9785078,0.0042263456,0.00050230493,0.000012619221,0.000006771335,0.00003973309,0.00050471677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99478734,0.000078362136,0.0007083885,0.0019999368,0.0015137275,0.0009122446],"domain_scores_gemma":[0.9959344,0.00041313228,0.00044463665,0.0026155633,0.00033570713,0.00025653906],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018095819,0.0006797721,0.0006197993,0.0011339677,0.0003228488,0.000704436,0.005551145,0.00051937095,0.000039554423],"category_scores_gemma":[0.00019863056,0.00065482495,0.00021199122,0.0009825835,0.0008152305,0.0009576813,0.00072171737,0.0011256767,0.00012709257],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040961268,0.00003303937,0.000013291634,0.000025391677,0.0000050156077,0.000036548812,0.00024986852,0.01581437,0.00019957793,0.1073663,0.000031749893,0.87622076],"study_design_scores_gemma":[0.0002875059,0.00024454482,0.0002377492,0.0002293874,0.000008925521,0.000045809007,4.452473e-8,0.58924514,0.0035821015,0.40101427,0.004261038,0.0008434908],"about_ca_topic_score_codex":0.000010339301,"about_ca_topic_score_gemma":0.000018200071,"teacher_disagreement_score":0.87537724,"about_ca_system_score_codex":0.0005124652,"about_ca_system_score_gemma":0.00090556766,"threshold_uncertainty_score":0.9998293},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010556503,0.000097458564,0.9937517,0.000544101,0.002309692,0.00064382557,0.000021974769,0.0001857344,0.002434945],"genre_scores_gemma":[0.03623941,0.000039130282,0.961995,0.0009275382,0.0005038334,0.0000070668625,0.000026700918,0.000031462874,0.00022982268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966012,0.000023309505,0.00059187185,0.0011855945,0.0008669935,0.00073099945],"domain_scores_gemma":[0.99766356,0.00059903914,0.00026296388,0.0006843491,0.0006181114,0.0001719878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001494325,0.00040003535,0.00038104522,0.0008613082,0.0004014954,0.0005829333,0.0013196658,0.0003292097,0.000028959115],"category_scores_gemma":[0.00014502018,0.0004183466,0.0001350581,0.00044735792,0.00078693056,0.00045778838,0.00047451156,0.0006008985,0.000018808332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060129955,0.000018084032,0.000056848832,0.000038670565,0.000009309801,0.000020248654,0.0002637316,0.018611431,0.00005970829,0.02498015,0.000021036272,0.9559148],"study_design_scores_gemma":[0.00043057877,0.00012282777,0.00008126961,0.00020291013,0.000007245401,0.00008612329,4.0938707e-7,0.9809648,0.00043154877,0.015956193,0.0012469443,0.0004691776],"about_ca_topic_score_codex":0.000016140628,"about_ca_topic_score_gemma":0.000079605656,"teacher_disagreement_score":0.96235335,"about_ca_system_score_codex":0.00042928502,"about_ca_system_score_gemma":0.00070193683,"threshold_uncertainty_score":0.99982685},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010624648,0.0003811768,0.9921875,0.0010794117,0.0011122756,0.0002467908,0.000005652065,0.00019702264,0.0046838955],"genre_scores_gemma":[0.3031137,0.00006698651,0.69107056,0.0032232746,0.0008177691,0.000022311102,0.000117649644,0.00005523446,0.0015125066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639326,0.00009563969,0.00051554124,0.0014912377,0.0010630185,0.00044127976],"domain_scores_gemma":[0.99735075,0.00035478975,0.0004499721,0.0014546362,0.00025395598,0.00013589146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001688484,0.00040350595,0.0003631933,0.00041098357,0.0003367311,0.0007186673,0.002403392,0.00025532977,0.000024498217],"category_scores_gemma":[0.00028015336,0.0003791172,0.00006483372,0.0004308331,0.0003157593,0.00049549236,0.00045142343,0.0007269916,0.000094789946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018461556,0.0000074514496,0.00002929817,0.000017084152,0.000003277053,0.0000029477108,0.00017814731,0.012957349,0.0014471675,0.046022154,0.00014951719,0.9391838],"study_design_scores_gemma":[0.00020795004,0.00015549092,0.00007095592,0.00015661247,0.000004908538,0.000013801036,5.530328e-8,0.9576136,0.0025104403,0.025734799,0.013009472,0.0005219212],"about_ca_topic_score_codex":0.000019961688,"about_ca_topic_score_gemma":0.00002705653,"teacher_disagreement_score":0.94465625,"about_ca_system_score_codex":0.00022809414,"about_ca_system_score_gemma":0.00039153663,"threshold_uncertainty_score":0.99986607},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017967507,0.00012410655,0.9907919,0.0004271035,0.0011957551,0.0005919838,0.000005982714,0.00006145985,0.006622002],"genre_scores_gemma":[0.5595247,0.00013541312,0.43236533,0.004030229,0.0013425297,0.00009633442,0.00014158998,0.00009376282,0.0022701144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985445,0.00004339884,0.00029562748,0.0007056837,0.00019167319,0.00021912737],"domain_scores_gemma":[0.9987173,0.0005100772,0.00023911793,0.00024430463,0.00023429662,0.000054901302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043493547,0.0002455242,0.0002619816,0.00022720442,0.00021524889,0.00017893683,0.00014796697,0.0002685455,0.00017924502],"category_scores_gemma":[0.0001187959,0.00023727135,0.000034431425,0.00010399021,0.00036020947,0.00033386744,0.00007475616,0.00028205203,0.000031957185],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004418516,0.00014225372,0.00030877316,0.0003373008,0.00013337214,0.00002052441,0.006052818,0.0012371747,0.0035465106,0.13763383,0.0024502655,0.84769535],"study_design_scores_gemma":[0.003961975,0.001394354,0.0017570475,0.0007646809,0.00016573198,0.0002923427,0.000011630428,0.51049066,0.0042788996,0.43683213,0.038340695,0.001709863],"about_ca_topic_score_codex":0.0000064974115,"about_ca_topic_score_gemma":0.00000939767,"teacher_disagreement_score":0.8459855,"about_ca_system_score_codex":0.00007987009,"about_ca_system_score_gemma":0.00005215938,"threshold_uncertainty_score":0.96756446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010702174,0.0019878475,0.993904,0.0016177938,0.00059774634,0.0006971565,0.0000014712576,0.00013953511,0.000947446],"genre_scores_gemma":[0.5170505,0.0053253327,0.45679694,0.00962554,0.0066439807,0.00020060093,0.0000048896236,0.00019040833,0.0041617625],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974952,0.000071601105,0.00028142735,0.0008061829,0.00079537067,0.0005502415],"domain_scores_gemma":[0.9977919,0.0013755079,0.00014661165,0.0004755435,0.00009522575,0.00011520911],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019769527,0.00028933102,0.00025988527,0.00023383841,0.00069090934,0.0011860214,0.0009348408,0.00022760034,0.000047036756],"category_scores_gemma":[0.00010131871,0.00022604219,0.00006521003,0.0002298707,0.00070672017,0.000550555,0.00030901819,0.0005699668,0.000013530758],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018401984,0.0000048620973,0.0005812591,0.000023931701,0.000008505726,0.000015372962,0.011825761,0.010142252,0.0000103830225,0.00081100257,0.000031878848,0.97654295],"study_design_scores_gemma":[0.0016591245,0.00048030706,0.0019287133,0.015080793,0.00021081539,0.00023817405,0.00026221247,0.28421745,0.0026215028,0.5294248,0.15668817,0.0071879514],"about_ca_topic_score_codex":0.00022271654,"about_ca_topic_score_gemma":0.00012275942,"teacher_disagreement_score":0.969355,"about_ca_system_score_codex":0.00014327157,"about_ca_system_score_gemma":0.00020236062,"threshold_uncertainty_score":0.99985087},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051432685,0.00005676902,0.99686253,0.0011915701,0.00045526293,0.00029296556,0.000005061824,0.00017718176,0.00044432355],"genre_scores_gemma":[0.3304888,0.000006000418,0.66818845,0.0010138021,0.00017171036,0.000005414706,0.000010905039,0.000022981692,0.00009192525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960878,0.00006791763,0.0006069142,0.0015389728,0.001101243,0.00059714844],"domain_scores_gemma":[0.99785733,0.00029870754,0.00025529822,0.0010477126,0.00026086657,0.00028005586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090291275,0.0004933766,0.0006057595,0.0011618749,0.0003058986,0.0006529896,0.0018972151,0.0003531801,0.0000142592835],"category_scores_gemma":[0.00017361068,0.00044140464,0.00024420716,0.0008475648,0.0008131573,0.0004598527,0.0007455632,0.0009823809,0.000031963333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004147011,0.000032716285,0.000015643658,0.000041622498,0.000009554033,0.00002358544,0.00015452286,0.6538939,0.000064056425,0.033535603,0.0000055048877,0.31221917],"study_design_scores_gemma":[0.00013494986,0.000057378835,0.000008452596,0.00021269158,0.000012701846,0.00004559163,2.0085738e-8,0.6805713,0.000040860807,0.31853172,0.00003012884,0.00035420727],"about_ca_topic_score_codex":0.00002785918,"about_ca_topic_score_gemma":0.00008243412,"teacher_disagreement_score":0.32997447,"about_ca_system_score_codex":0.00024121611,"about_ca_system_score_gemma":0.0006870573,"threshold_uncertainty_score":0.9998038},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030328345,0.0003711582,0.9939664,0.00019898043,0.0017147659,0.00022038809,0.000010161471,0.0001944872,0.0030203892],"genre_scores_gemma":[0.31094715,0.00004700944,0.6858016,0.0019602603,0.0007084172,0.000005841519,0.000021760181,0.00005092029,0.00045700834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956592,0.00006497001,0.0007259808,0.0018432571,0.0009671653,0.00073947693],"domain_scores_gemma":[0.9964914,0.00041059937,0.0004931699,0.0020497758,0.00035638027,0.00019871953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010968414,0.0005789224,0.0007276963,0.0018523154,0.00046565986,0.000929685,0.0041878973,0.00038792414,0.000090966154],"category_scores_gemma":[0.000071227965,0.0005660293,0.00031265084,0.0019723477,0.00079369004,0.0008281559,0.0018279259,0.0007646382,0.00005538458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018625447,0.000098198005,0.002388747,0.00014157673,0.0005127401,0.000213861,0.015253005,0.16510129,0.00014438905,0.19651611,0.00007790667,0.61953354],"study_design_scores_gemma":[0.00013574505,0.00005743036,0.0002881146,0.00014652305,0.000101127676,0.000043165634,4.610528e-7,0.883737,0.0006496666,0.11202145,0.0019858878,0.0008333736],"about_ca_topic_score_codex":0.00013132252,"about_ca_topic_score_gemma":0.00012650271,"teacher_disagreement_score":0.71863574,"about_ca_system_score_codex":0.00027683456,"about_ca_system_score_gemma":0.0004881018,"threshold_uncertainty_score":0.9996791},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008127046,0.0002131986,0.96952385,0.0010819463,0.00085339125,0.00049133785,0.000022763963,0.0002515643,0.027553812],"genre_scores_gemma":[0.016019998,0.000070501344,0.9767974,0.0017496641,0.0005481828,0.00003260199,0.00010369252,0.00006303678,0.0046149334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958789,0.000022693059,0.0004543071,0.0017343818,0.0011290691,0.00078066974],"domain_scores_gemma":[0.9969109,0.00022536208,0.00029246707,0.0020985012,0.00025798028,0.00021475327],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00046064047,0.0006107432,0.0005379769,0.0006226047,0.00027490256,0.0013285059,0.0048349574,0.0001978705,0.00007541069],"category_scores_gemma":[0.000038801754,0.00047393932,0.00009705273,0.0007755839,0.0009247239,0.001463785,0.0021887384,0.0006328763,0.00030201953],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034282834,0.000035726414,0.00005904956,0.000036507183,0.000027656319,0.00015236916,0.00009657358,0.0019179905,0.000014177165,0.13105732,0.00065774104,0.86594146],"study_design_scores_gemma":[0.0012199067,0.0007345562,0.0006580887,0.0010176388,0.000049531685,0.00019208189,7.09769e-7,0.62916833,0.00046296898,0.29190105,0.071833156,0.002761981],"about_ca_topic_score_codex":0.000034127603,"about_ca_topic_score_gemma":0.0000918043,"teacher_disagreement_score":0.8631795,"about_ca_system_score_codex":0.00018249013,"about_ca_system_score_gemma":0.00035464295,"threshold_uncertainty_score":0.99977124},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015368301,0.00007919063,0.9906483,0.00027230993,0.0009686055,0.0007812873,0.0000021415653,0.0012834102,0.0058110305],"genre_scores_gemma":[0.054818947,0.00001310877,0.9439743,0.00087236316,0.00012722649,0.000019298544,0.000004280933,0.000033770124,0.00013666223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667835,0.00004215491,0.0006685486,0.0011460067,0.0007987529,0.0006661971],"domain_scores_gemma":[0.9980097,0.000098458564,0.00026500705,0.0011247939,0.00026647348,0.00023557367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007725259,0.0005200037,0.00050077937,0.0015298718,0.00030313848,0.00060290773,0.0028973704,0.00029959815,0.00004324288],"category_scores_gemma":[0.00003158747,0.00049638754,0.00014341902,0.001136364,0.00026156052,0.0007460616,0.0005129885,0.00052612706,0.000046480163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020877699,0.000036022357,0.0000030092908,0.000033609325,0.000006149477,0.000016127065,0.0019278256,0.043829124,0.000037139816,0.003806812,0.00002145011,0.95028067],"study_design_scores_gemma":[0.00013379307,0.00025206347,0.0000380313,0.00042819313,0.000007714741,0.0000540031,7.777984e-8,0.95546794,0.0013484431,0.04055434,0.0011021564,0.0006132213],"about_ca_topic_score_codex":0.00003772181,"about_ca_topic_score_gemma":0.000021349637,"teacher_disagreement_score":0.9496674,"about_ca_system_score_codex":0.00028631397,"about_ca_system_score_gemma":0.00035762566,"threshold_uncertainty_score":0.99974877},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033096923,0.00063272926,0.9933747,0.00047794307,0.0010808902,0.00037420893,0.000008507868,0.00011127593,0.003906631],"genre_scores_gemma":[0.24054298,0.00009966973,0.7493831,0.0024611447,0.0010567596,0.000023209734,0.0000760732,0.00008170668,0.0062753847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601406,0.000029282031,0.0006088593,0.0017217429,0.0009259776,0.0007001036],"domain_scores_gemma":[0.9971415,0.000373986,0.0004498564,0.0015517796,0.00027720587,0.00020571286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096644234,0.0005639256,0.0009049974,0.0021704426,0.0003174478,0.00069223205,0.0030905458,0.00025538777,0.000107050866],"category_scores_gemma":[0.00003276408,0.00048944977,0.00070840283,0.0014129917,0.0003220378,0.00043586607,0.000657518,0.00040940748,0.000034902645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031713727,0.00018115803,0.0016921452,0.000077139164,0.0017533598,0.000070993425,0.0031949996,0.083312914,0.00018649592,0.123612896,0.0010448687,0.7848413],"study_design_scores_gemma":[0.00066706643,0.00032392843,0.0022141533,0.00025618714,0.00063563825,0.00002164262,5.0771945e-7,0.8453014,0.004398264,0.13666305,0.007765986,0.0017521697],"about_ca_topic_score_codex":0.00004243849,"about_ca_topic_score_gemma":0.00008122092,"teacher_disagreement_score":0.78308916,"about_ca_system_score_codex":0.000199714,"about_ca_system_score_gemma":0.000225217,"threshold_uncertainty_score":0.99975574},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001873371,0.0006757241,0.9884616,0.0008687099,0.0030794365,0.00049786095,0.0000033928295,0.0004266179,0.005799333],"genre_scores_gemma":[0.1396745,0.000023503746,0.8567704,0.0029643031,0.00030495846,0.00001548019,0.000004131305,0.00004325201,0.00019948048],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939571,0.00014895151,0.0009663404,0.0023906308,0.0007819162,0.0017550722],"domain_scores_gemma":[0.99561423,0.0010994562,0.0006802704,0.002167519,0.00025264674,0.0001858996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015011247,0.000805888,0.0010829252,0.0007127077,0.0004580461,0.00032331757,0.0051892838,0.00078675215,0.000078710036],"category_scores_gemma":[0.00024364889,0.0007211354,0.0002219762,0.00046956024,0.0011869571,0.00071622286,0.0015148835,0.0011529052,0.000060471946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012161632,0.00021956318,0.002437939,0.00028746188,0.000096861346,0.0026579439,0.013159693,0.03702957,0.00046342498,0.20637298,0.00023592368,0.736917],"study_design_scores_gemma":[0.0008644482,0.0005821019,0.0009460438,0.000386518,0.000031788542,0.00045569427,0.0000016068817,0.3070082,0.00900595,0.67579985,0.0033899932,0.0015278317],"about_ca_topic_score_codex":0.00014989231,"about_ca_topic_score_gemma":0.0009859569,"teacher_disagreement_score":0.7353892,"about_ca_system_score_codex":0.00027607678,"about_ca_system_score_gemma":0.0010758068,"threshold_uncertainty_score":0.999524},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019818493,0.0024330926,0.98854756,0.0006976684,0.0008273313,0.00041365402,0.0000037971918,0.000117790776,0.004977247],"genre_scores_gemma":[0.6908848,0.0007255637,0.30564508,0.002005039,0.00036982162,0.000020500553,0.0000038478533,0.000054289656,0.0002910363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965237,0.000037207403,0.00048056568,0.0015762594,0.0006933155,0.0006889813],"domain_scores_gemma":[0.9981169,0.00040458702,0.00013019393,0.0010952512,0.00006966491,0.000183406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005631359,0.0004974753,0.00051437353,0.0015465408,0.000187069,0.00043931906,0.001965288,0.00036051928,0.000029550316],"category_scores_gemma":[0.00002797676,0.00043872913,0.00011852788,0.0009117031,0.0008529156,0.00052291126,0.0008714222,0.00088096515,0.00002871486],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008706473,0.000045784618,0.0008044776,0.000032682856,0.000008628459,0.00023841564,0.0013151594,0.009204279,0.000049752354,0.010490349,0.000011225601,0.97779053],"study_design_scores_gemma":[0.0012267857,0.00030679937,0.013452361,0.0010168091,0.000014517341,0.00024120939,6.4882056e-7,0.43293735,0.00058596814,0.54354686,0.004783204,0.0018874871],"about_ca_topic_score_codex":0.000080711594,"about_ca_topic_score_gemma":0.0002645443,"teacher_disagreement_score":0.97590303,"about_ca_system_score_codex":0.00009886623,"about_ca_system_score_gemma":0.0002135014,"threshold_uncertainty_score":0.99980646},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014368637,0.0004720037,0.9919544,0.0008227549,0.0011337297,0.00049446686,0.000006161083,0.00075440825,0.0043476988],"genre_scores_gemma":[0.04334736,0.000058170914,0.9543985,0.0013732732,0.00028535034,0.000025891948,0.0000062474205,0.000066790555,0.00043840203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952289,0.00010718616,0.0007179588,0.0018525971,0.0012042905,0.0008890526],"domain_scores_gemma":[0.99617726,0.0008127252,0.00034362453,0.002253452,0.0002579814,0.0001549628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020612432,0.0007134007,0.0006755895,0.0013272527,0.00013047662,0.000459653,0.0044623706,0.00048320685,0.000016083022],"category_scores_gemma":[0.00014132519,0.00069670123,0.00014473876,0.00097603083,0.00047139823,0.0012794732,0.0017058393,0.001447666,0.000044705666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009669171,0.00005577734,0.000042198328,0.00003848115,0.000008746017,0.00042073568,0.00050491275,0.049483567,0.00006593618,0.31529474,0.0001902775,0.63388497],"study_design_scores_gemma":[0.00039919783,0.0002702347,0.0002523239,0.0008891199,0.000015345478,0.00021890785,5.6722804e-8,0.66121763,0.002460221,0.2877091,0.04483974,0.0017281441],"about_ca_topic_score_codex":0.00008274275,"about_ca_topic_score_gemma":0.000063461375,"teacher_disagreement_score":0.6321568,"about_ca_system_score_codex":0.000568564,"about_ca_system_score_gemma":0.00033945055,"threshold_uncertainty_score":0.99954844},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047642997,0.00020651623,0.9985799,0.000058661124,0.00019361223,0.00027604453,0.0000022027955,0.00007973525,0.0001268937],"genre_scores_gemma":[0.22699915,0.00003639965,0.77270186,0.0000745438,0.00007779724,0.000009537373,0.000004630084,0.000017920454,0.000078130484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971791,0.000020426596,0.00040447936,0.0011462511,0.00086882286,0.0003809001],"domain_scores_gemma":[0.99758935,0.0005375635,0.00019715393,0.001255808,0.00027145533,0.00014866807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007013442,0.00030563175,0.0004995037,0.0016087918,0.00007652521,0.00021657639,0.0017127347,0.00017675126,0.0000051781353],"category_scores_gemma":[0.00023199737,0.00028280995,0.00009298506,0.0014509838,0.00037524264,0.00015622785,0.0009762587,0.0003337367,0.0000011195363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001668019,0.00001042049,0.00052675983,0.00006498463,0.00003129759,0.000005531026,0.000119298,0.75398636,0.000045316716,0.0004922133,7.7228486e-7,0.2447154],"study_design_scores_gemma":[0.00013154009,0.00011843514,0.0011463568,0.000063080755,0.00003372926,0.000010259791,3.5130878e-8,0.99638593,0.00046084687,0.0013614845,0.000012109175,0.0002762159],"about_ca_topic_score_codex":0.000040534534,"about_ca_topic_score_gemma":0.0000071254544,"teacher_disagreement_score":0.24443918,"about_ca_system_score_codex":0.00012806935,"about_ca_system_score_gemma":0.00018954714,"threshold_uncertainty_score":0.9999624},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052725384,0.00032268997,0.9969517,0.00007620466,0.00084582774,0.00023793662,0.00000852459,0.0000785145,0.0009513318],"genre_scores_gemma":[0.2805972,0.000013553366,0.71902347,0.00024312378,0.000095932664,0.0000018866892,0.000010308114,0.000008922476,0.000005628582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731153,0.00005489083,0.0007515481,0.00059825444,0.0008498245,0.0004339666],"domain_scores_gemma":[0.9969591,0.0006566932,0.0007902848,0.0010106337,0.00048180795,0.00010150985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015718068,0.0003237104,0.0005625592,0.0022449505,0.00023247619,0.00034970377,0.0021018211,0.00021994872,0.00001917032],"category_scores_gemma":[0.00016894519,0.00030899374,0.00020063887,0.002189701,0.00046686106,0.001893263,0.00080004305,0.00044361473,0.00001153789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048454867,0.00001748697,0.00010971625,0.00004670553,0.00008954668,0.0000015210046,0.005531127,0.3520897,0.000083867315,0.19641812,9.647218e-7,0.44560638],"study_design_scores_gemma":[0.00007642171,0.000046910664,0.00019333063,0.00015240436,0.000075701515,0.0000060993843,0.0000011301189,0.9711329,0.000569439,0.027265549,0.00015989825,0.00032026277],"about_ca_topic_score_codex":0.00003772186,"about_ca_topic_score_gemma":0.000017535052,"teacher_disagreement_score":0.6190432,"about_ca_system_score_codex":0.00024926945,"about_ca_system_score_gemma":0.00040801245,"threshold_uncertainty_score":0.9999362},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006703938,0.000648787,0.99688774,0.00016770702,0.00070004154,0.00032806778,0.0000038395806,0.000059088117,0.00053432235],"genre_scores_gemma":[0.2243599,0.00009000352,0.7748561,0.00048441085,0.00014416999,0.000006159695,0.0000045065863,0.000023869643,0.00003089961],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697405,0.000026650056,0.00065300177,0.00096349686,0.00084609527,0.0005366753],"domain_scores_gemma":[0.99816394,0.00042187268,0.00028385184,0.00086741196,0.00016599851,0.000096928095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010582,0.00033351092,0.00043616717,0.002149403,0.00008411569,0.00013224978,0.0019945616,0.00023321256,0.000025634035],"category_scores_gemma":[0.000039134015,0.00031204944,0.00013108997,0.0014609069,0.0005347408,0.0003552199,0.0006752631,0.0005459449,0.0000072300822],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026577354,0.000026136042,0.0014621662,0.00004823961,0.000006181924,0.00007062447,0.00078054785,0.0033430594,0.000038701888,0.01373481,0.0000024758858,0.9804844],"study_design_scores_gemma":[0.0019640673,0.0008614701,0.041504454,0.0015337103,0.0000299803,0.00018451773,0.000003689196,0.0983572,0.013516075,0.8386599,0.001279891,0.002105051],"about_ca_topic_score_codex":0.0001460371,"about_ca_topic_score_gemma":0.00096227264,"teacher_disagreement_score":0.97837937,"about_ca_system_score_codex":0.00014388277,"about_ca_system_score_gemma":0.0003794126,"threshold_uncertainty_score":0.9999332},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025028308,0.00035292818,0.9932557,0.00014998276,0.00034356347,0.00046003706,0.000002110073,0.00030902203,0.0048763836],"genre_scores_gemma":[0.21139348,0.000026113185,0.7877966,0.00030248615,0.00033911914,0.000010232759,0.000006173364,0.000019917037,0.0001058546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967676,0.00003274266,0.0005356543,0.0014355868,0.0007184706,0.0005099548],"domain_scores_gemma":[0.9971821,0.00017968866,0.0004231869,0.0016115747,0.000421297,0.00018217976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079968426,0.0004685073,0.0005480517,0.00065099244,0.00017413702,0.000258869,0.0037746301,0.00042056493,0.000005283194],"category_scores_gemma":[0.00007949579,0.00041516277,0.00013359284,0.00053241843,0.0006084418,0.000645744,0.00074123126,0.0006219314,0.000016478944],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004364333,0.000070611204,0.000052530635,0.000024389852,0.0000044408853,0.000012839305,0.00061290356,0.007802389,0.0010967479,0.04616319,0.000002069327,0.94415355],"study_design_scores_gemma":[0.00019026846,0.00056015997,0.00024383992,0.0002385077,0.000010398346,0.000054305867,2.4855015e-7,0.8710258,0.026130682,0.09941891,0.0014197084,0.000707151],"about_ca_topic_score_codex":0.000022084763,"about_ca_topic_score_gemma":0.000030281566,"teacher_disagreement_score":0.9434464,"about_ca_system_score_codex":0.00017072936,"about_ca_system_score_gemma":0.00038945358,"threshold_uncertainty_score":0.99983},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015514657,0.0041934066,0.87638813,0.0011961127,0.008733331,0.0003299984,0.000010408334,0.00008922353,0.10890424],"genre_scores_gemma":[0.9433379,0.0004421358,0.017689664,0.008164142,0.0045974804,0.000034078177,0.00004783059,0.000116389376,0.02557035],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985402,0.000035967798,0.00023444375,0.00046492738,0.00031785187,0.00040660275],"domain_scores_gemma":[0.9988367,0.00030756078,0.00013218615,0.00055106846,0.0000797733,0.00009274408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064497534,0.00022486753,0.00017564722,0.00019956204,0.00026269577,0.0000968141,0.0006300955,0.00023088249,0.0005730408],"category_scores_gemma":[0.0000294629,0.00014939652,0.000080558224,0.00012494056,0.0005369511,0.000072031435,0.00017444466,0.00060844026,0.00065341796],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068067434,0.000017451799,0.000037498772,0.0000038278504,0.000008343781,0.000009413602,0.0010167179,0.000035923247,0.000010066262,0.01061625,0.00014303812,0.9880947],"study_design_scores_gemma":[0.0018574636,0.00072933256,0.0064364113,0.00063438725,0.0001012251,0.00075378246,0.000005499893,0.011467931,0.0007571217,0.5315616,0.44327345,0.0024217947],"about_ca_topic_score_codex":0.000017386832,"about_ca_topic_score_gemma":0.00012370344,"teacher_disagreement_score":0.9856729,"about_ca_system_score_codex":0.0000664929,"about_ca_system_score_gemma":0.000058139773,"threshold_uncertainty_score":0.8398584},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011648432,0.00057819765,0.97875035,0.0007174576,0.0015021046,0.0003344588,0.0000030294123,0.00017730151,0.01677226],"genre_scores_gemma":[0.3904155,0.000054659642,0.60098714,0.0071034613,0.0009586792,0.00002076299,0.000019211533,0.00008013453,0.0003604769],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99559516,0.000050182574,0.0007200539,0.0017917011,0.0010285326,0.0008143682],"domain_scores_gemma":[0.9973614,0.0005249051,0.00034355684,0.0013969188,0.00018366432,0.00018955309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095609087,0.00058269437,0.0005273975,0.0013804578,0.0002173507,0.00028033895,0.0038156856,0.00039794954,0.000058593858],"category_scores_gemma":[0.00002859529,0.0005370177,0.00013657493,0.0011295705,0.00035197096,0.0008025344,0.0018064186,0.0012098423,0.00012080349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001126183,0.000063325424,0.0016932389,0.0000741956,0.000016565527,0.0002054168,0.00587616,0.009208939,0.00006015149,0.4275062,0.0000062033437,0.55527836],"study_design_scores_gemma":[0.00043657256,0.00015908697,0.00356529,0.0008200413,0.000008133844,0.00011149915,5.5014027e-7,0.1532692,0.00074921094,0.83606803,0.0037666017,0.0010457656],"about_ca_topic_score_codex":0.00016359916,"about_ca_topic_score_gemma":0.00070826226,"teacher_disagreement_score":0.5542326,"about_ca_system_score_codex":0.0002153751,"about_ca_system_score_gemma":0.0005114647,"threshold_uncertainty_score":0.9997081},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006070931,0.00039490522,0.9916975,0.00007885723,0.00016464593,0.0007462334,0.000066863264,0.000004465842,0.0007755902],"genre_scores_gemma":[0.9451899,0.00005214526,0.053342294,0.0007882802,0.00016221346,0.000043110005,0.00001537476,0.000030765805,0.00037592516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983847,0.000008106597,0.00020999637,0.0008699033,0.00018888613,0.00033839556],"domain_scores_gemma":[0.99904436,0.000043480733,0.00013569623,0.0004453451,0.0002579714,0.00007315901],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020753867,0.0003257797,0.00028412102,0.00007712184,0.00011378882,0.00003649626,0.00040104895,0.00018743823,0.0000012619639],"category_scores_gemma":[0.000030624175,0.00026250855,0.00007048778,0.00004179036,0.0006751844,0.0000015011277,0.00028494425,0.00012748806,0.0000013007748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006782731,0.00015491137,0.00017626383,0.0002692245,0.00039283434,0.00005082527,0.004864894,0.44936502,0.1288618,0.023202367,0.000091093825,0.3918925],"study_design_scores_gemma":[0.0021524252,0.0041219047,0.0001801291,0.0006828174,0.00016760053,0.00016782685,0.0000036889896,0.51376414,0.107500836,0.36487243,0.0034980145,0.0028881682],"about_ca_topic_score_codex":0.000014482202,"about_ca_topic_score_gemma":0.0002283121,"teacher_disagreement_score":0.939119,"about_ca_system_score_codex":0.000061812214,"about_ca_system_score_gemma":0.00038906385,"threshold_uncertainty_score":0.9999827},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007354643,0.004638978,0.9898519,0.0012121114,0.0019339191,0.0011912717,0.000019029485,0.0003607547,0.00071849115],"genre_scores_gemma":[0.3611012,0.0015759729,0.63281375,0.0019270331,0.0010805659,0.00021298154,0.00005321057,0.0001425973,0.0010926937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944454,0.00011305576,0.0008496175,0.0020284662,0.0013860469,0.0011774437],"domain_scores_gemma":[0.9933868,0.001615591,0.00042311056,0.0034227355,0.00083950243,0.0003122601],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014562748,0.00069275755,0.00065380184,0.0009869221,0.0007561554,0.0011428097,0.007900329,0.00065343647,0.000023125342],"category_scores_gemma":[0.0001514629,0.0006750587,0.00027948222,0.0010920208,0.0013752729,0.00091600587,0.0025465025,0.0016892073,0.00003208048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035971243,0.000041146744,0.00005214458,0.000031554708,0.000014153629,0.000015314448,0.00024269841,0.5662906,0.00003790482,0.0006468367,0.00052382407,0.43206784],"study_design_scores_gemma":[0.0006379622,0.00031201486,0.00024424307,0.00038788523,0.000005054332,0.000042355,6.957155e-8,0.96982247,0.00040663013,0.0053335372,0.022219531,0.0005882538],"about_ca_topic_score_codex":0.000006379335,"about_ca_topic_score_gemma":0.000043520144,"teacher_disagreement_score":0.43147957,"about_ca_system_score_codex":0.0006277965,"about_ca_system_score_gemma":0.0011049194,"threshold_uncertainty_score":0.9998941},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006473219,0.00018708041,0.9902932,0.002824016,0.0020145904,0.00068687723,0.000027772021,0.0005710574,0.0033306975],"genre_scores_gemma":[0.045740884,0.0001165979,0.9465042,0.0060325,0.00073935883,0.000032831485,0.000019204179,0.000080853184,0.0007335671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924922,0.00015985307,0.0011324825,0.0027083454,0.0020731483,0.0014339795],"domain_scores_gemma":[0.9949672,0.0005326434,0.0007722287,0.0027474298,0.00052014383,0.00046032533],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002274925,0.0009774538,0.0010165455,0.0011444928,0.0003405628,0.0009420101,0.006182545,0.000801401,0.00004775623],"category_scores_gemma":[0.0002559608,0.00091713504,0.00024032216,0.000864604,0.0011482002,0.002132163,0.0021285967,0.001805225,0.00015729677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007616187,0.00013263896,0.000015510264,0.00007681688,0.00003824603,0.00015660026,0.0014178307,0.14666247,0.0004003748,0.20503874,0.00034442107,0.6456402],"study_design_scores_gemma":[0.00035959802,0.0003607968,0.000061364146,0.0003102878,0.000015160343,0.00008181364,2.0314019e-7,0.8946671,0.003129304,0.0937733,0.006248888,0.0009921713],"about_ca_topic_score_codex":0.000027842132,"about_ca_topic_score_gemma":0.00005724479,"teacher_disagreement_score":0.7480046,"about_ca_system_score_codex":0.000882116,"about_ca_system_score_gemma":0.0006712993,"threshold_uncertainty_score":0.9993279},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070751533,0.0006953347,0.9896395,0.000100208556,0.001046221,0.00033605393,0.0000010098707,0.0001092108,0.0009972749],"genre_scores_gemma":[0.8945651,0.000015391563,0.104687355,0.000087700806,0.00021900615,0.0000069816215,7.886757e-7,0.00003460775,0.0003830549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962249,0.00007371325,0.000883256,0.00097125955,0.0010343265,0.0008125635],"domain_scores_gemma":[0.9978634,0.00034873476,0.0004809066,0.0010292411,0.0001748277,0.000102907514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002178724,0.00047718204,0.0005827876,0.00075190753,0.0002852514,0.00026622417,0.002633965,0.00028152348,0.0000053777753],"category_scores_gemma":[0.00009314958,0.00037472392,0.00016482995,0.000500354,0.00028814003,0.00063188485,0.0009950681,0.0013541323,0.000010994482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013024655,0.000014070126,0.00019852948,0.00003401628,0.000004293446,0.000015397867,0.0054562013,0.8685724,0.0002085195,0.022708755,2.1966893e-7,0.102786265],"study_design_scores_gemma":[0.0000794789,0.000045828183,0.000034143442,0.0009743497,0.0000071666655,0.000039198592,0.0000037506477,0.9919006,0.00036528474,0.006118335,0.000027249183,0.00040459004],"about_ca_topic_score_codex":0.00023080954,"about_ca_topic_score_gemma":0.00007813529,"teacher_disagreement_score":0.88749,"about_ca_system_score_codex":0.0003651348,"about_ca_system_score_gemma":0.0003700386,"threshold_uncertainty_score":0.9998705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000707244,0.000026228747,0.94319767,0.00006294206,0.0014923671,0.054325316,0.0000073787164,0.0005588907,0.0002584663],"genre_scores_gemma":[0.30964398,0.0000057135035,0.6380627,0.000564611,0.0010044597,0.050126627,0.00003867258,0.00015698459,0.00039625805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948266,0.00014081226,0.0011919272,0.0019319627,0.0010768108,0.0008318939],"domain_scores_gemma":[0.99695086,0.00033587264,0.0008643953,0.0012892085,0.00034121162,0.00021847268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016744933,0.0006599349,0.0006952289,0.0012593226,0.00029860917,0.0010005404,0.002488187,0.0004240499,0.000009897797],"category_scores_gemma":[0.00012484383,0.00061848835,0.00013477058,0.0005743931,0.00014377547,0.0012376932,0.00035290426,0.0005051828,0.000022183358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026559064,0.00032581974,0.0006858678,0.00050316384,0.000028357974,0.00008829866,0.0041588484,0.8497541,0.0011418544,0.011570954,0.000050185925,0.131666],"study_design_scores_gemma":[0.0015890801,0.0002897904,0.0008896991,0.0010110914,0.000004206775,0.000024811203,7.551956e-7,0.9934731,0.00038910535,0.0013165082,0.00034465472,0.000667195],"about_ca_topic_score_codex":0.000157656,"about_ca_topic_score_gemma":0.00010387758,"teacher_disagreement_score":0.30957326,"about_ca_system_score_codex":0.00078680564,"about_ca_system_score_gemma":0.00028186766,"threshold_uncertainty_score":0.99962664},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035557575,0.000594265,0.97942317,0.0018745798,0.0077275992,0.00050714926,0.00001928723,0.000095157884,0.006203057],"genre_scores_gemma":[0.6677398,0.00007290333,0.31769395,0.006101203,0.0017991905,0.000009854152,0.0000145600125,0.00007735345,0.006491195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99242955,0.00012567444,0.0010298723,0.0023656103,0.0032658319,0.00078344793],"domain_scores_gemma":[0.99382865,0.0016641654,0.0005330672,0.0032168324,0.0005722709,0.00018503814],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0065325946,0.00053951534,0.0006173858,0.001171595,0.0008195621,0.0047327704,0.007532422,0.0002713594,0.0009373028],"category_scores_gemma":[0.0006942267,0.0003132784,0.00020152626,0.0017419559,0.0012080767,0.00062802964,0.004561105,0.0009399711,0.0007999167],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007721563,0.00003856525,0.00027054772,0.000047582485,0.000028624978,0.00004139431,0.0017323706,0.03807049,0.00015004969,0.0059734983,0.0010694003,0.9525698],"study_design_scores_gemma":[0.00008709003,0.00004753245,0.000075065866,0.00067673763,0.000016668362,0.00002960307,0.000009010642,0.7591772,0.00009016461,0.2045776,0.034782916,0.00043039388],"about_ca_topic_score_codex":0.00027676017,"about_ca_topic_score_gemma":0.00022080414,"teacher_disagreement_score":0.9521394,"about_ca_system_score_codex":0.00020812632,"about_ca_system_score_gemma":0.00039139276,"threshold_uncertainty_score":0.99997807},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002669416,0.00043826312,0.9966054,0.00006913553,0.0009727991,0.00070420426,0.0000034959353,0.00014201488,0.0010379726],"genre_scores_gemma":[0.3820783,0.00003909463,0.61673516,0.00035858658,0.00040311934,0.000034864413,0.0000062555237,0.00009148614,0.00025314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982841,0.000010820197,0.0004359194,0.0005148663,0.00031500778,0.0004392699],"domain_scores_gemma":[0.9989267,0.00028832027,0.000119393175,0.0004435414,0.00013534243,0.000086697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038419297,0.0003754325,0.0004905292,0.0004111158,0.00009120256,0.000088504945,0.0007770672,0.00025087997,0.000032516684],"category_scores_gemma":[0.00003860581,0.00036033342,0.00012620982,0.0001712304,0.00020501814,0.00009967898,0.000097386364,0.0003587993,0.000008928527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050195117,0.000009007352,0.0000019316349,0.000096580254,0.000015312336,0.0000065198205,0.00025774556,0.8641494,0.00153562,0.0015951468,0.000005894439,0.13232182],"study_design_scores_gemma":[0.00082172034,0.00017225133,0.000055227607,0.0007025062,0.000026699536,0.000016671636,1.7932953e-7,0.93966633,0.0048211766,0.05300092,0.00016138902,0.0005549145],"about_ca_topic_score_codex":0.0000057988395,"about_ca_topic_score_gemma":0.000018516297,"teacher_disagreement_score":0.3820516,"about_ca_system_score_codex":0.0002285649,"about_ca_system_score_gemma":0.00020144609,"threshold_uncertainty_score":0.99988484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009117984,0.000116421674,0.9964964,0.00007335825,0.0010686187,0.0004816453,0.000014902531,0.000118882075,0.0007179799],"genre_scores_gemma":[0.6455689,0.0000040719347,0.35378173,0.0004165249,0.00014656033,0.00001121579,0.000008203658,0.000026432646,0.000036346577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965804,0.000039846655,0.0006529743,0.0013289282,0.00074078195,0.0006570655],"domain_scores_gemma":[0.9964524,0.001424388,0.0004974711,0.0012064286,0.0002722533,0.00014706902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010711772,0.00044068063,0.00049625634,0.0006590665,0.0003046184,0.00035004455,0.0018138572,0.00032232606,0.000017351427],"category_scores_gemma":[0.00030175518,0.00041743394,0.00016350887,0.00086077326,0.00023019128,0.0005362748,0.000331834,0.0005788041,0.000009722676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000704651,0.00012927387,0.00030807545,0.0001486846,0.00001729712,0.000020324112,0.0011049391,0.20603247,0.0035558224,0.0020516766,0.00015146227,0.7864095],"study_design_scores_gemma":[0.00033867636,0.00034151104,0.000055114055,0.00045439522,0.0000075971643,0.0000059422387,2.343387e-7,0.9376591,0.053453177,0.007107212,0.00014175207,0.0004353017],"about_ca_topic_score_codex":0.000022338318,"about_ca_topic_score_gemma":0.000017810691,"teacher_disagreement_score":0.7859742,"about_ca_system_score_codex":0.00012991147,"about_ca_system_score_gemma":0.00020870444,"threshold_uncertainty_score":0.99982774},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004148241,0.00018785425,0.9949199,0.00087391015,0.0016315711,0.0012612266,0.000029474097,0.00020171702,0.00089021964],"genre_scores_gemma":[0.00039021068,0.00007572239,0.9980191,0.00043107278,0.0005683475,0.00005976504,0.000038446513,0.00004944115,0.00036787745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951067,0.000042555534,0.000730287,0.001879027,0.0013851051,0.00085631845],"domain_scores_gemma":[0.9963921,0.0006717208,0.0003567338,0.0014069357,0.000893238,0.00027932643],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018276718,0.0005624992,0.00055465504,0.0015285601,0.0004768046,0.0010617021,0.0035952502,0.0005158284,0.00002830946],"category_scores_gemma":[0.00014732516,0.00052777433,0.00023071902,0.0011317858,0.00074447814,0.0006043694,0.00072991924,0.0010879585,0.000028913517],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002062341,0.00003033466,0.000011984899,0.00003643427,0.000013294329,0.000014265257,0.00025369844,0.006194521,0.000208558,0.0078763515,0.000013118748,0.98534536],"study_design_scores_gemma":[0.0003021779,0.00015384375,0.000018519326,0.00011898519,0.000008419641,0.00003187568,7.510515e-8,0.873276,0.0019545418,0.11973297,0.0038708001,0.000531817],"about_ca_topic_score_codex":0.000024135095,"about_ca_topic_score_gemma":0.00009796575,"teacher_disagreement_score":0.9848136,"about_ca_system_score_codex":0.0001337419,"about_ca_system_score_gemma":0.0007248776,"threshold_uncertainty_score":0.99997526},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049269736,0.0003842924,0.9889086,0.0016410245,0.000671412,0.0014437884,0.0000042923093,0.0017293941,0.00516791],"genre_scores_gemma":[0.050123725,0.00004321408,0.9457577,0.0015292559,0.00036359756,0.00015100202,0.000022989416,0.00004686139,0.0019616531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994815,0.00010900873,0.00078173267,0.0019793601,0.0013507076,0.0009641695],"domain_scores_gemma":[0.9955276,0.0003485657,0.00056838954,0.0027833194,0.00053468265,0.00023738864],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012134276,0.0007557176,0.0008343361,0.0012707403,0.00062574894,0.0018212409,0.0066216285,0.00041254555,0.000029850948],"category_scores_gemma":[0.000083564446,0.00053608214,0.00041600247,0.0026590256,0.0011475561,0.00066246744,0.001967289,0.0011436315,0.00015953102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000204004,0.00008678451,0.00017544586,0.000016753937,0.000094611445,0.000016988566,0.00052238745,0.12751777,0.000007782371,0.003129008,0.00031191108,0.8681185],"study_design_scores_gemma":[0.00014217389,0.00027488905,0.0002715523,0.00013736585,0.00006700085,0.000021888152,2.6096478e-7,0.95264375,0.00011513648,0.024865681,0.020773271,0.0006870255],"about_ca_topic_score_codex":0.00006090125,"about_ca_topic_score_gemma":0.00007116176,"teacher_disagreement_score":0.86743146,"about_ca_system_score_codex":0.00021927005,"about_ca_system_score_gemma":0.0003943668,"threshold_uncertainty_score":0.99970907},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003081223,0.0005987956,0.98447305,0.0006294004,0.007031303,0.0003928293,0.000022599077,0.00023997402,0.006581252],"genre_scores_gemma":[0.39607644,0.00008014057,0.5887445,0.0025225533,0.0088482825,0.00001666577,0.0003755022,0.00008547673,0.0032504036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953287,0.000052657695,0.0006284015,0.0022560447,0.0010594663,0.0006746762],"domain_scores_gemma":[0.9946806,0.00024040055,0.00034958633,0.00426007,0.00027296232,0.00019637405],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001183763,0.00052817044,0.00051527226,0.0005506674,0.00028753167,0.0014789472,0.008934531,0.0003334312,0.000025046416],"category_scores_gemma":[0.00008755794,0.00047472795,0.000080255646,0.0005680807,0.00033301595,0.0008658963,0.0038115112,0.0006528713,0.00041346802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.7319417e-7,0.000018575829,0.000014479161,0.00002527136,0.000011892573,0.000040930965,0.00019833117,0.0281563,0.00010620928,0.013883122,0.0015840656,0.95596015],"study_design_scores_gemma":[0.00015141576,0.00006676489,0.00003008851,0.00019259728,0.0000050485874,0.000072823466,3.1284355e-8,0.9469733,0.00010803818,0.024302805,0.027503323,0.00059374317],"about_ca_topic_score_codex":0.0000678456,"about_ca_topic_score_gemma":0.00006260939,"teacher_disagreement_score":0.95536643,"about_ca_system_score_codex":0.00018606083,"about_ca_system_score_gemma":0.00065583433,"threshold_uncertainty_score":0.99977046},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024579067,0.00028581286,0.96697676,0.0010862484,0.00026279135,0.0046483283,0.0000011140099,0.00013989543,0.0020199665],"genre_scores_gemma":[0.9379777,0.000016124677,0.05534585,0.0041703484,0.0005792932,0.00005291559,0.000012083063,0.00006184221,0.0017838533],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971265,0.000046274177,0.0004964208,0.0011884944,0.0006105624,0.00053173327],"domain_scores_gemma":[0.9977228,0.00065351516,0.0002073449,0.0010287745,0.00022295651,0.00016459139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018268131,0.00046424824,0.0007194534,0.0003820519,0.00021373662,0.000109983484,0.0006647221,0.00022591815,0.000074237425],"category_scores_gemma":[0.00019214046,0.0003751855,0.00019733155,0.0002122431,0.0004855013,0.00011062629,0.00011057015,0.0003153284,0.000024356044],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001416886,0.0026809864,0.43118405,0.0017680242,0.0004666793,0.0038060346,0.016768944,0.002020319,0.0004157237,0.016814139,0.00083175336,0.52182645],"study_design_scores_gemma":[0.012907668,0.023195975,0.35157734,0.0048693456,0.0020611407,0.004067053,0.000054386262,0.028648883,0.0016122259,0.50785136,0.056318466,0.0068361606],"about_ca_topic_score_codex":0.000034172834,"about_ca_topic_score_gemma":0.000035082783,"teacher_disagreement_score":0.9133986,"about_ca_system_score_codex":0.00027426088,"about_ca_system_score_gemma":0.00025007175,"threshold_uncertainty_score":0.99987},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012624748,0.00075051584,0.99636173,0.0001931779,0.00028290454,0.0003490134,0.0000023895518,0.0001762989,0.0017577341],"genre_scores_gemma":[0.16784306,0.000053018357,0.8315151,0.00028949647,0.00017593148,0.000019639256,0.000014079956,0.00002632887,0.00006338949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695796,0.00007475212,0.0004907885,0.001053602,0.0007482823,0.0006746381],"domain_scores_gemma":[0.9977481,0.00074106746,0.0003240032,0.0008388571,0.00014970345,0.00019828588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015488524,0.0004394913,0.00068793964,0.0024060204,0.00027927122,0.0005484865,0.0019815553,0.00023327487,0.000036933096],"category_scores_gemma":[0.00006406369,0.00037150268,0.000119229335,0.002774892,0.00033866853,0.0004825782,0.0007237001,0.0006844847,0.000044586177],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012796193,0.000035735204,0.0029576793,0.000043507327,0.000015842956,0.000009603219,0.0006364759,0.0051006977,0.000032787622,0.0009651457,0.0000019329825,0.9901993],"study_design_scores_gemma":[0.00035063908,0.000044230357,0.0012955193,0.00036016566,0.000027557053,0.00003655874,0.0000011552877,0.97761637,0.00020197494,0.015834881,0.003529154,0.0007017905],"about_ca_topic_score_codex":0.00005603459,"about_ca_topic_score_gemma":0.00030896222,"teacher_disagreement_score":0.98949754,"about_ca_system_score_codex":0.0002481652,"about_ca_system_score_gemma":0.0002534385,"threshold_uncertainty_score":0.9998737},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008912767,0.0003258895,0.9881451,0.00006114051,0.00058682257,0.00040014635,0.0000064956503,0.00026368306,0.001297928],"genre_scores_gemma":[0.60378534,0.00008315383,0.3957656,0.000114387316,0.00019000197,0.0000052752234,0.0000038458725,0.000020126268,0.000032283642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531597,0.0000350804,0.0010888684,0.0015648414,0.0013291144,0.00066614855],"domain_scores_gemma":[0.9964917,0.00014806334,0.0005201691,0.002052925,0.0006466311,0.00014053703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014237007,0.0005756798,0.0011086662,0.0025724857,0.0002585881,0.0001574559,0.002735207,0.00043155227,0.000011640283],"category_scores_gemma":[0.000033045824,0.00049947586,0.00036185226,0.0026543604,0.0004921038,0.0014099814,0.0011066762,0.0006637548,0.0000036347785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004792814,0.000023584327,0.00034117684,0.000057930258,0.000065054504,0.0000040796062,0.00044279525,0.81929433,0.000078225945,0.0016393188,3.3784008e-7,0.17804834],"study_design_scores_gemma":[0.00009712993,0.00009237757,0.000041478525,0.00043685624,0.000103720595,0.000016606476,1.7892206e-7,0.9915446,0.001885294,0.0052258554,0.000028605991,0.0005272662],"about_ca_topic_score_codex":0.00009329692,"about_ca_topic_score_gemma":0.00004963227,"teacher_disagreement_score":0.59487253,"about_ca_system_score_codex":0.00054861844,"about_ca_system_score_gemma":0.000600571,"threshold_uncertainty_score":0.99974567},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053277923,0.002160084,0.9949161,0.00013748504,0.0011156605,0.00026147845,0.0000027563608,0.0009693195,0.00038388005],"genre_scores_gemma":[0.02792985,0.00005760619,0.9711507,0.00014600616,0.0005123932,0.000011297021,0.0000034480468,0.000073102405,0.00011558102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961405,0.000025087338,0.0004587852,0.0015842333,0.00093738746,0.0008540048],"domain_scores_gemma":[0.99642706,0.001418272,0.00016979019,0.0016613181,0.00019115927,0.0001323972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007369274,0.00070885237,0.00064637465,0.0009136882,0.00015890104,0.00053603604,0.0029908295,0.0004122818,0.0000043057657],"category_scores_gemma":[0.00023656602,0.000624144,0.00010661825,0.0007808572,0.00025303874,0.00073313917,0.00088440906,0.0014412674,0.0000130602675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025366774,0.0000065625954,0.0000059532385,0.0000271018,0.0000069420344,0.00012809198,0.00017587897,0.89762735,0.00005271586,0.014956428,0.000003915199,0.08700654],"study_design_scores_gemma":[0.00014118654,0.000097312164,0.000016436179,0.00068099,0.0000053469325,0.00009625274,2.1011222e-7,0.90390927,0.00052995863,0.09313708,0.00047494602,0.0009109975],"about_ca_topic_score_codex":0.000013674297,"about_ca_topic_score_gemma":0.000007364714,"teacher_disagreement_score":0.08609554,"about_ca_system_score_codex":0.00041015656,"about_ca_system_score_gemma":0.00019555422,"threshold_uncertainty_score":0.999621},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006581694,0.0004253168,0.9974208,0.00030748727,0.0008389518,0.00018542974,0.0000044188646,0.00004097199,0.00011845953],"genre_scores_gemma":[0.17156184,0.00008981969,0.8280646,0.00019998365,0.000035447585,0.0000017465537,1.2306053e-7,0.000011466993,0.00003498593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979017,0.00008463838,0.000377446,0.0006784118,0.0006927149,0.00026510126],"domain_scores_gemma":[0.9949617,0.0026796644,0.00042361752,0.001726037,0.00017141544,0.0000375675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058649125,0.0002811108,0.00058970274,0.00041593565,0.00015322451,0.000038076614,0.0030961032,0.0002334547,0.0000018356252],"category_scores_gemma":[0.0012315317,0.00017081622,0.00020970569,0.002243271,0.0015264868,0.00014764971,0.0024335405,0.0007152067,3.065198e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025224697,0.000009897895,0.00097591983,0.00003299705,0.00011199306,0.000004653921,0.0022316345,0.90914303,0.00015437706,0.01091148,0.0000042441884,0.076417245],"study_design_scores_gemma":[0.00013297293,0.0001285043,0.028365992,0.0009292404,0.0002458764,0.00005818157,6.843095e-7,0.33523506,0.015276226,0.6187125,0.00017120184,0.0007435791],"about_ca_topic_score_codex":0.000010689698,"about_ca_topic_score_gemma":0.000024861369,"teacher_disagreement_score":0.607801,"about_ca_system_score_codex":0.0001025628,"about_ca_system_score_gemma":0.00016657542,"threshold_uncertainty_score":0.6965683},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011578813,0.00025290967,0.98306745,0.0057131764,0.0027987254,0.0010804669,0.000011115133,0.0013835982,0.0045346916],"genre_scores_gemma":[0.3809916,0.000010894832,0.61311007,0.003947593,0.00056841574,0.000045681834,0.00000469851,0.00008731564,0.0012337501],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98985654,0.000083384046,0.0010885617,0.0038292347,0.0031230906,0.0020192137],"domain_scores_gemma":[0.9937142,0.0006830205,0.000427815,0.0031393047,0.00161019,0.00042545886],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0026347945,0.0012590312,0.0012315856,0.0014775887,0.0005682157,0.0009331243,0.009015541,0.00091293635,0.000029018829],"category_scores_gemma":[0.0008222705,0.0012124524,0.00026403286,0.0029262737,0.0009059741,0.0011209545,0.004083854,0.0023031784,0.00030974805],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002440577,0.000118445096,0.000038839684,0.000052561954,0.00005742001,0.00025522284,0.011032025,0.1003321,0.00037161724,0.016098816,0.0012892961,0.87032926],"study_design_scores_gemma":[0.0014204863,0.002276067,0.00075686903,0.0030785194,0.000103996725,0.000667075,0.000008181256,0.22815669,0.08444577,0.60947025,0.061266147,0.008349981],"about_ca_topic_score_codex":0.00010753774,"about_ca_topic_score_gemma":0.0007244791,"teacher_disagreement_score":0.86197925,"about_ca_system_score_codex":0.001067134,"about_ca_system_score_gemma":0.00088676024,"threshold_uncertainty_score":0.99999857},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028651226,0.00027798003,0.99588186,0.00024172252,0.0021492117,0.0005064191,0.000019288387,0.00058764423,0.00030722033],"genre_scores_gemma":[0.012756488,0.000021161388,0.9854698,0.00057112414,0.00077610556,0.000011957891,0.000009400817,0.0000630986,0.00032082814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593216,0.00001861811,0.0006377576,0.0016743272,0.00073912204,0.0009980352],"domain_scores_gemma":[0.9965797,0.0011942802,0.0002647178,0.0014584383,0.00034178607,0.00016105491],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011545065,0.0006692652,0.00066631415,0.0007155468,0.000340108,0.0004895091,0.003730335,0.0004602216,0.00001084966],"category_scores_gemma":[0.000614239,0.0006301903,0.00018017767,0.00042685636,0.00034552653,0.0009794775,0.0012982562,0.00094584137,0.000006742502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024533124,0.0000027091874,0.0000015545945,0.000031945507,0.0000049305786,0.000009591564,0.00024409113,0.65252656,0.00008038217,0.0071714595,0.0000023872562,0.33992192],"study_design_scores_gemma":[0.00016914721,0.000083887215,0.0000019859888,0.0001223226,0.0000049197656,0.000053003616,1.08683366e-7,0.7083716,0.0009450908,0.28881922,0.0008875058,0.00054124225],"about_ca_topic_score_codex":0.000003315341,"about_ca_topic_score_gemma":0.000020308518,"teacher_disagreement_score":0.33938068,"about_ca_system_score_codex":0.00046495214,"about_ca_system_score_gemma":0.00054719084,"threshold_uncertainty_score":0.99961495},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030543345,0.0006318737,0.9920489,0.00054693304,0.0016663526,0.00066269236,0.000029331426,0.00020775791,0.0042031077],"genre_scores_gemma":[0.0105957035,0.000067317655,0.9861576,0.0018317626,0.0005509696,0.000014529308,0.000046387107,0.00006035864,0.00067538366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99525833,0.00009992693,0.000556309,0.0024784373,0.0006492542,0.0009577193],"domain_scores_gemma":[0.99581873,0.000768151,0.00037637877,0.002509653,0.00029805914,0.0002290183],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002003851,0.00066467095,0.0007108958,0.0006960565,0.00046090275,0.0005722473,0.006991436,0.0004567101,0.00001230368],"category_scores_gemma":[0.00026115202,0.00059449824,0.00014579165,0.0004477001,0.00060699676,0.0010161598,0.005015346,0.0010959146,0.000013051636],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014690432,0.000018986288,0.000008447308,0.00005147229,0.000026328073,0.000042672797,0.0011857501,0.0013969104,0.00017654101,0.02594396,0.000078174,0.97105604],"study_design_scores_gemma":[0.00026421048,0.00022083159,0.000025527816,0.00033278283,0.000018708015,0.000057915015,7.465492e-8,0.6684594,0.00086653326,0.32714826,0.0019363621,0.0006693626],"about_ca_topic_score_codex":0.00004604113,"about_ca_topic_score_gemma":0.00008035868,"teacher_disagreement_score":0.9703867,"about_ca_system_score_codex":0.00015919755,"about_ca_system_score_gemma":0.0004440512,"threshold_uncertainty_score":0.99965066},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060326786,0.00020376817,0.9968009,0.00027025543,0.0006713515,0.00038174234,0.000036723843,0.00009296444,0.00093900436],"genre_scores_gemma":[0.5957907,0.00003462257,0.40229648,0.00034298564,0.00056405325,0.000010490684,0.00004948751,0.000041834817,0.00086933206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967989,0.000035954865,0.0005735274,0.0013179898,0.000795228,0.00047844264],"domain_scores_gemma":[0.99704623,0.0005180264,0.000544159,0.0011416227,0.00063135533,0.000118630844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006759462,0.00041119786,0.0006203813,0.0009313869,0.00020774118,0.00036479905,0.0027559763,0.00033393348,0.000017093751],"category_scores_gemma":[0.00025921222,0.00035944014,0.00017134337,0.0010765385,0.00046486917,0.0005702095,0.00065965846,0.00042156712,0.000010201654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007741618,0.00009196469,0.00037007788,0.00041817068,0.00023925927,0.000022139688,0.007095149,0.07991251,0.018835638,0.052006252,0.0009821071,0.8399493],"study_design_scores_gemma":[0.0003600387,0.00028174635,0.00013760703,0.00024495737,0.000034935107,0.000016039588,5.787142e-7,0.88113946,0.015064196,0.1002555,0.001841024,0.0006239034],"about_ca_topic_score_codex":0.000032618947,"about_ca_topic_score_gemma":0.00003917676,"teacher_disagreement_score":0.8393254,"about_ca_system_score_codex":0.00016751011,"about_ca_system_score_gemma":0.00053156324,"threshold_uncertainty_score":0.99988574},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24576272,0.014324232,0.7285269,0.0008444995,0.00066628575,0.0021451104,0.000077334415,0.000016661545,0.007636286],"genre_scores_gemma":[0.98502916,0.00014709576,0.014515171,0.00008865523,0.00016192211,0.000006812985,0.000017329881,0.000011436223,0.0000223927],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979844,0.000060428254,0.0005060619,0.0005569117,0.0006340198,0.00025816067],"domain_scores_gemma":[0.9987648,0.000058202102,0.00026965069,0.00071407127,0.00016129256,0.00003196569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001235685,0.00023047786,0.0003715367,0.00017961455,0.000038086022,0.000022683227,0.0011056758,0.00017692825,0.000022584894],"category_scores_gemma":[0.000053137544,0.00017224034,0.00009307216,0.00017622949,0.00075007975,0.0000057847938,0.00026206518,0.00023621405,0.0000013627391],"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.00008201086,0.0003276189,0.0107703805,0.0002846812,0.000080842925,0.00000818853,0.0046846527,0.04742687,0.58073825,0.00036865403,0.000016492597,0.35521138],"study_design_scores_gemma":[0.002962486,0.004968384,0.04356297,0.001090747,0.00017392992,0.00005018431,0.000084431085,0.023701062,0.86948717,0.021667548,0.02909423,0.0031568434],"about_ca_topic_score_codex":0.00004045139,"about_ca_topic_score_gemma":0.00049212127,"teacher_disagreement_score":0.73926646,"about_ca_system_score_codex":0.000061523824,"about_ca_system_score_gemma":0.00019298626,"threshold_uncertainty_score":0.7023757},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045906307,0.0030198267,0.99242634,0.00042670342,0.00084224757,0.0002753114,0.000001786217,0.00010667338,0.0024420773],"genre_scores_gemma":[0.23675567,0.00011501109,0.7449889,0.0047204276,0.011957456,0.000070417664,0.00014240705,0.00017327127,0.0010764094],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99766827,0.0000025657105,0.00041143867,0.0007938819,0.00053551974,0.0005882983],"domain_scores_gemma":[0.9988758,0.00008950177,0.00028706322,0.00045144538,0.0002687746,0.000027430975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085332786,0.00042340514,0.00045251937,0.0009130651,0.0003297736,0.0005606969,0.0008653595,0.00020267125,0.00014149616],"category_scores_gemma":[0.000019951369,0.00036661176,0.00013589658,0.0005434796,0.0002115327,0.0005965496,0.00038480296,0.00030008145,0.00011992622],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011778627,0.00002358591,0.000051528503,0.00017199473,0.0000153538,0.000007657313,0.0002494761,0.003996006,0.00005694964,0.0039631906,0.000055831526,0.99139667],"study_design_scores_gemma":[0.0009566155,0.000015577149,0.0001501499,0.0014555654,0.00010307857,0.000009417736,0.00000385914,0.08917162,0.00037763183,0.13158052,0.77402943,0.0021465167],"about_ca_topic_score_codex":0.000015545706,"about_ca_topic_score_gemma":0.00004976491,"teacher_disagreement_score":0.9892501,"about_ca_system_score_codex":0.00010916332,"about_ca_system_score_gemma":0.00011905094,"threshold_uncertainty_score":0.9998786},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019558673,0.00045477576,0.9923913,0.00072102936,0.00075772527,0.00036178355,0.0000030744795,0.00009571287,0.0032587338],"genre_scores_gemma":[0.49183822,0.000011217306,0.50645095,0.0007853961,0.00048189805,0.000011772325,0.000016984135,0.000028643113,0.0003749154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656004,0.000027347343,0.00046293862,0.0013663141,0.0010251951,0.000558175],"domain_scores_gemma":[0.9982392,0.0003704391,0.00018892233,0.0008472696,0.00023265419,0.000121483434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005860646,0.00043131833,0.00042847544,0.001236767,0.0002737553,0.0004342644,0.0014636297,0.00021267364,0.000017352537],"category_scores_gemma":[0.000029040919,0.0003893276,0.00007574698,0.0010150332,0.00033619252,0.00067685416,0.000715235,0.00067168236,0.00003350709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008707954,0.00008627654,0.00033941332,0.000025991576,0.000010817331,0.00010413616,0.00040508615,0.700726,0.0003567393,0.04754366,0.000028134482,0.25036505],"study_design_scores_gemma":[0.00058447383,0.0002660876,0.004613131,0.0005679515,0.000011384153,0.000089989,1.2906305e-7,0.7768767,0.0009329481,0.21395703,0.0011554427,0.0009447328],"about_ca_topic_score_codex":0.00006499873,"about_ca_topic_score_gemma":0.001084256,"teacher_disagreement_score":0.48988235,"about_ca_system_score_codex":0.00027953062,"about_ca_system_score_gemma":0.0006182344,"threshold_uncertainty_score":0.9998559},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016361241,0.00084083417,0.9860671,0.00043892075,0.0029632617,0.0004419532,0.0000024195583,0.00034664164,0.0072627575],"genre_scores_gemma":[0.9211064,0.000046757286,0.076348856,0.0018234676,0.00038497883,0.00001600967,0.0000032806854,0.000059410148,0.00021085163],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957533,0.0000851469,0.0006331262,0.001369625,0.0011448862,0.0010139121],"domain_scores_gemma":[0.9964769,0.0010481384,0.00032458766,0.0018588108,0.00008524586,0.00020633922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002109795,0.000641082,0.00065822434,0.001293522,0.00019717848,0.0005200974,0.0042743073,0.0003808712,0.000051337673],"category_scores_gemma":[0.00014142797,0.0005586326,0.00013459875,0.00097261864,0.0005305105,0.00077816274,0.001504726,0.001171679,0.00012897297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019978443,0.00005451053,0.00008246871,0.000035761394,0.0000039483707,0.00006329798,0.0009195184,0.0016292345,0.000025042262,0.35105076,0.000007630353,0.64612585],"study_design_scores_gemma":[0.00025565995,0.0001243481,0.00035720711,0.0006907714,0.0000039925603,0.000037624643,3.4358416e-7,0.44743586,0.00040545096,0.5497663,0.0003160461,0.0006064064],"about_ca_topic_score_codex":0.000017928634,"about_ca_topic_score_gemma":0.0000217697,"teacher_disagreement_score":0.91947025,"about_ca_system_score_codex":0.0005805534,"about_ca_system_score_gemma":0.00035959927,"threshold_uncertainty_score":0.99968654},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087542896,0.0017819932,0.98671114,0.0005926968,0.00035971584,0.00025685402,0.0000019195877,0.000120937715,0.009299337],"genre_scores_gemma":[0.7395798,0.00018403529,0.25654328,0.0029306808,0.0003373192,0.0000061600877,0.0000030061913,0.000024418116,0.00039130147],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726707,0.000032514537,0.0003747642,0.0011181546,0.0005250172,0.0006824712],"domain_scores_gemma":[0.99855256,0.00032115306,0.00015751277,0.00077778933,0.000065888664,0.00012508433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006378972,0.00042929404,0.00044370754,0.0006516161,0.00015432858,0.00032873888,0.0018549063,0.0002505098,0.000011101231],"category_scores_gemma":[0.0000638288,0.00035119918,0.000066069486,0.00042814415,0.0005207909,0.0009245869,0.00087213743,0.0006935212,0.000010927128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000384785,0.000011468964,0.00007378218,0.000011247647,0.0000019195434,0.00015671006,0.0005447878,0.0027890785,0.000055915836,0.17952046,0.0000031006655,0.81682765],"study_design_scores_gemma":[0.00041327937,0.00030865826,0.0017638957,0.00029359412,0.0000035917112,0.00017426812,7.4403374e-7,0.06892578,0.00077700237,0.9253886,0.0011957868,0.0007547919],"about_ca_topic_score_codex":0.000009508599,"about_ca_topic_score_gemma":0.00010910155,"teacher_disagreement_score":0.8160729,"about_ca_system_score_codex":0.00010750369,"about_ca_system_score_gemma":0.00017133506,"threshold_uncertainty_score":0.999894},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046148017,0.00004646377,0.9908904,0.0000974741,0.00006412118,0.0002560685,0.000009030075,0.00010346894,0.008071508],"genre_scores_gemma":[0.86472523,0.000004187193,0.13437921,0.0003084494,0.00035117994,0.000009416135,0.000012457289,0.000034492718,0.00017540321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974626,0.0000123555055,0.00037180513,0.0009533671,0.00065945974,0.0005404578],"domain_scores_gemma":[0.99837637,0.00014300738,0.00023577458,0.0008663032,0.00023398889,0.00014455996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003148225,0.0004615919,0.0004720972,0.000659765,0.0002071025,0.00014766383,0.001048626,0.00014088211,0.000046091864],"category_scores_gemma":[0.0000029948028,0.00038887293,0.00015753873,0.00054289575,0.001318364,0.00017298052,0.0003983997,0.0008021467,0.000009101679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015260019,0.000031422594,0.0009291241,0.000007330672,0.00003331285,0.000019263083,0.000125431,0.633003,0.000021967535,0.041769736,0.00003691525,0.32400724],"study_design_scores_gemma":[0.00013146843,0.000073317904,0.000057473655,0.00023235365,0.000028954482,0.0000055655796,1.518117e-7,0.71477133,0.00014998045,0.28369296,0.00040621666,0.00045021533],"about_ca_topic_score_codex":0.0002817508,"about_ca_topic_score_gemma":0.00084709865,"teacher_disagreement_score":0.8642637,"about_ca_system_score_codex":0.00011719584,"about_ca_system_score_gemma":0.00046399803,"threshold_uncertainty_score":0.9998563},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000049314826,0.00040447962,0.9840421,0.0018964448,0.0012388447,0.00026218678,0.0000041272906,0.0007695121,0.011377351],"genre_scores_gemma":[0.023290198,0.00011932255,0.97211945,0.0010567288,0.00034285977,0.00001965704,0.00000406917,0.000036798803,0.003010887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962858,0.000017740027,0.00049770094,0.0015473362,0.00094601745,0.00070541294],"domain_scores_gemma":[0.99751145,0.00025443386,0.00029683634,0.0016525848,0.00014982399,0.00013486618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048205745,0.0005017904,0.00047709577,0.0010834292,0.00027509482,0.0007730615,0.004580664,0.00039218887,0.00007473031],"category_scores_gemma":[0.00007220813,0.0004606687,0.00013362405,0.0007861009,0.0008357815,0.00078227837,0.0013051506,0.00085156725,0.0001758835],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.6716284e-7,0.000012436798,0.000004443231,0.0000063166335,0.000004949359,0.000037836064,0.0007020609,0.0006458902,0.000024439754,0.040206578,0.00005446551,0.95830023],"study_design_scores_gemma":[0.000268339,0.00015567473,0.000052739426,0.00022038736,0.0000058462097,0.000092675706,9.861972e-7,0.6674568,0.0008960349,0.31577125,0.014203246,0.0008760072],"about_ca_topic_score_codex":0.0000053326166,"about_ca_topic_score_gemma":0.000006815241,"teacher_disagreement_score":0.9574242,"about_ca_system_score_codex":0.0002573947,"about_ca_system_score_gemma":0.0002546137,"threshold_uncertainty_score":0.9997845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000039577135,0.0008224646,0.9925476,0.00019953545,0.0022480683,0.0012838573,0.0000013467327,0.0002649128,0.0026283045],"genre_scores_gemma":[0.030708782,0.000010326967,0.96749175,0.0005534636,0.0006606315,0.000060956325,0.000006331202,0.000040789593,0.00046699576],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995762,0.00005976413,0.0005834345,0.0017525929,0.0007692019,0.0010730384],"domain_scores_gemma":[0.9965188,0.0011961367,0.000448925,0.0011669492,0.00045765346,0.00021152904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002845892,0.00058113877,0.000755631,0.00076746714,0.00028935427,0.00052069576,0.0028682197,0.00043325836,0.0000061751907],"category_scores_gemma":[0.00015394556,0.00044004526,0.00016392392,0.00064051384,0.0008690218,0.00038310682,0.00061986805,0.000648375,0.000017834767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009152672,0.00001780166,0.000036207457,0.00006500414,0.000014228792,0.00005129306,0.0005681446,0.00028539216,0.000009473209,0.26649904,0.0000064945657,0.7324378],"study_design_scores_gemma":[0.0017164298,0.0031973084,0.000051382533,0.00029512975,0.00005638252,0.00079721864,0.0000016912177,0.07588976,0.001505282,0.7188558,0.19513062,0.00250301],"about_ca_topic_score_codex":0.000038942282,"about_ca_topic_score_gemma":0.00021609274,"teacher_disagreement_score":0.72993475,"about_ca_system_score_codex":0.00020163825,"about_ca_system_score_gemma":0.0006414342,"threshold_uncertainty_score":0.99980515},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017776301,0.0009083649,0.99313164,0.0020263575,0.0013210315,0.000996581,0.000019334468,0.00028168596,0.001137246],"genre_scores_gemma":[0.6405521,0.00034352427,0.34654245,0.01069531,0.001059411,0.00008649407,0.0000912555,0.000119063065,0.0005103982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99515116,0.0000726629,0.00065121666,0.0019788714,0.00084440754,0.0013016936],"domain_scores_gemma":[0.9961499,0.0008944849,0.00040183382,0.0019232924,0.00041517336,0.00021529708],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010806827,0.00072483986,0.00065389986,0.00070965267,0.00047637243,0.0005060885,0.0045802617,0.00042002348,0.00004270556],"category_scores_gemma":[0.00004849076,0.0006529898,0.00025365857,0.000907798,0.00044841997,0.0006045554,0.0011011418,0.0009969076,0.000042807274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035370875,0.00021707991,0.00062749215,0.00029010943,0.00007063245,0.0000366539,0.004094421,0.020697974,0.00019425363,0.15459685,0.000054799653,0.81908435],"study_design_scores_gemma":[0.0007136506,0.00029895952,0.00046065013,0.00022007426,0.00002638949,0.000057624937,6.8467045e-7,0.8219541,0.00055433507,0.16338071,0.01150012,0.0008327418],"about_ca_topic_score_codex":0.000055349334,"about_ca_topic_score_gemma":0.0005286793,"teacher_disagreement_score":0.8182516,"about_ca_system_score_codex":0.00031910246,"about_ca_system_score_gemma":0.00040497512,"threshold_uncertainty_score":0.9995921},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013286518,0.00006771418,0.9900273,0.0006810355,0.002500816,0.00036545575,0.000014738086,0.00024898985,0.0060806572],"genre_scores_gemma":[0.02517452,0.00005637732,0.96794474,0.0033145521,0.00048728622,0.000022153654,0.000022875009,0.000037430385,0.0029400426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940713,0.000036264606,0.0004622497,0.0020952758,0.0024228122,0.00091208494],"domain_scores_gemma":[0.9973103,0.00039166052,0.00021060675,0.0015475808,0.00029617967,0.00024370605],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010177211,0.000500313,0.00041047228,0.0021461726,0.00094992097,0.0011314511,0.0071235658,0.00015278428,0.000016806058],"category_scores_gemma":[0.000047810285,0.0004707902,0.00012444596,0.0034808698,0.002314894,0.0020399464,0.00057124544,0.00083880423,0.00018897899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002423867,0.000086083084,0.000003044165,0.000015580126,0.000006640309,0.000098905024,0.00036234758,0.25911468,0.000009986132,0.0077204364,0.00030246287,0.7322774],"study_design_scores_gemma":[0.00029377762,0.00019066798,0.00012972474,0.00016775476,0.0000048352617,0.00007432882,1.1987332e-7,0.93327206,0.0004223031,0.06130841,0.003492937,0.000643084],"about_ca_topic_score_codex":0.000009510269,"about_ca_topic_score_gemma":0.000009527896,"teacher_disagreement_score":0.7316343,"about_ca_system_score_codex":0.0007418317,"about_ca_system_score_gemma":0.0027261013,"threshold_uncertainty_score":0.99990547},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010045578,0.00021609792,0.9714993,0.0026819014,0.0011011504,0.00082452525,0.000014269293,0.0003619499,0.023200303],"genre_scores_gemma":[0.11311867,0.000010640936,0.8527334,0.032909214,0.0008688435,0.000036760648,0.00002007337,0.0000825416,0.00021988513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935968,0.00006821222,0.0006589309,0.0028179944,0.0016820357,0.0011760368],"domain_scores_gemma":[0.9960553,0.00041634752,0.00024105902,0.0025202003,0.000312353,0.00045471475],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000860823,0.0009784739,0.0007865119,0.0021961045,0.00044023703,0.00092151226,0.0060124816,0.00047810064,0.000017171624],"category_scores_gemma":[0.000024755602,0.00084709935,0.00021554818,0.0016215169,0.00020830256,0.00070537144,0.0014782315,0.0012543644,0.00006229354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025772828,0.00007390766,0.000004047851,0.00006659968,0.000015215631,0.00006784109,0.0034936967,0.7294151,0.00017215197,0.010426237,0.000030686708,0.25620872],"study_design_scores_gemma":[0.00045719644,0.00026517274,0.000116945506,0.00061493705,0.0000071989994,0.00006884499,0.0000012321939,0.96078926,0.00050576084,0.0331308,0.0029848078,0.0010578657],"about_ca_topic_score_codex":0.00008383522,"about_ca_topic_score_gemma":0.00012953085,"teacher_disagreement_score":0.25515085,"about_ca_system_score_codex":0.0002977108,"about_ca_system_score_gemma":0.00060855167,"threshold_uncertainty_score":0.999398},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011623747,0.000014069742,0.924529,0.00025490252,0.0021316386,0.07112436,0.0000050018866,0.00039431042,0.001535055],"genre_scores_gemma":[0.13638458,0.00000974763,0.7356339,0.0032895613,0.0059199687,0.11801555,0.000019746256,0.00025755863,0.00046937887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929992,0.00006963397,0.0010372683,0.0029788301,0.0012383454,0.0016767452],"domain_scores_gemma":[0.99430877,0.0011836118,0.00081526156,0.0026963498,0.000609042,0.00038695903],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0020429878,0.0010340721,0.0010291922,0.00048470567,0.0006706086,0.001194888,0.006495552,0.0011307105,0.000034153785],"category_scores_gemma":[0.00011859128,0.0009695458,0.00033659182,0.0008343305,0.000908528,0.0008726033,0.002576182,0.002673533,0.000018015357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005206591,0.00009640202,0.000018465431,0.00018445405,0.00003127656,0.000059047085,0.0013789689,0.0343475,0.000462614,0.08867813,0.00010116227,0.8745899],"study_design_scores_gemma":[0.00078254985,0.00024526252,0.000009414957,0.0006584197,0.000008332158,0.000039042156,1.0121026e-7,0.87539023,0.0032826043,0.11590962,0.002655474,0.0010189282],"about_ca_topic_score_codex":0.00001908176,"about_ca_topic_score_gemma":0.00030424778,"teacher_disagreement_score":0.873571,"about_ca_system_score_codex":0.00036719424,"about_ca_system_score_gemma":0.00091355445,"threshold_uncertainty_score":0.999842},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002728671,0.0011518248,0.9914157,0.000055737146,0.0025963925,0.0003775442,7.5450714e-7,0.00011452287,0.001558895],"genre_scores_gemma":[0.9054836,0.00007636487,0.093704596,0.0001459055,0.0005422038,0.000004121725,0.0000012699962,0.000019489189,0.00002241655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966114,0.000068042296,0.00087921735,0.001095619,0.00078558875,0.0005601352],"domain_scores_gemma":[0.9980444,0.00041189778,0.0004952762,0.00075215247,0.00017108516,0.0001252069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017115802,0.00039048577,0.0006947216,0.0010448785,0.00022878844,0.00018919182,0.0011752871,0.00049865793,0.000005999281],"category_scores_gemma":[0.0000410358,0.0003792636,0.00007962747,0.0011684663,0.0004350085,0.00046406375,0.001024917,0.0009838465,0.000008020761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024599538,0.000023101607,0.00034197836,0.00010427531,0.000004485463,0.000021425134,0.0006795702,0.044694774,0.00023437061,0.00979581,0.0000047858866,0.9440708],"study_design_scores_gemma":[0.000306067,0.00038382885,0.00066491344,0.0012898203,0.00000674579,0.00008134609,9.845305e-7,0.96926343,0.0049651284,0.021541048,0.0010234141,0.00047324915],"about_ca_topic_score_codex":0.00007716799,"about_ca_topic_score_gemma":0.000984427,"teacher_disagreement_score":0.94359756,"about_ca_system_score_codex":0.00035886886,"about_ca_system_score_gemma":0.0001224329,"threshold_uncertainty_score":0.99986595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016694113,0.00012937273,0.99183583,0.0008655538,0.0022984585,0.0008424932,0.00025405418,0.0002136019,0.0033936743],"genre_scores_gemma":[0.108074754,0.000017333872,0.88358325,0.0070593967,0.00084933033,0.000046371297,0.0001975605,0.00005825723,0.00011376256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953425,0.000062105006,0.00057150936,0.0020174212,0.0009937944,0.0010126684],"domain_scores_gemma":[0.9961707,0.00091637915,0.00027085716,0.001972634,0.00032891563,0.00034050515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015056925,0.00071052054,0.0006193171,0.0014238493,0.0007192077,0.0006102944,0.0036143053,0.00039734322,0.000031927833],"category_scores_gemma":[0.00009322172,0.0006753037,0.00036682648,0.000829661,0.0010151487,0.00038984357,0.00085245125,0.000893261,0.000019814923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006985396,0.0005562676,0.00041917866,0.00019213298,0.00005075292,0.00006871174,0.0011796082,0.02305845,0.0001746115,0.57505375,0.001280444,0.39789623],"study_design_scores_gemma":[0.00086659304,0.0005815419,0.00046872403,0.00024291147,0.000020425636,0.000021697639,8.694585e-8,0.74349385,0.0008412353,0.23552845,0.016873207,0.0010612904],"about_ca_topic_score_codex":0.00005876875,"about_ca_topic_score_gemma":0.00081896666,"teacher_disagreement_score":0.7204354,"about_ca_system_score_codex":0.00039008213,"about_ca_system_score_gemma":0.00058329524,"threshold_uncertainty_score":0.99956983},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020034153,0.0017750112,0.99506336,0.00059546105,0.0008716464,0.00080547057,0.000052974254,0.00021047132,0.0004252785],"genre_scores_gemma":[0.88666385,0.00003705563,0.10980876,0.0027204491,0.0006422704,0.00003111832,0.000048319314,0.000028681414,0.000019517476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645525,0.00003144849,0.00043496085,0.0017559883,0.0007311044,0.0005912209],"domain_scores_gemma":[0.99741995,0.00027743343,0.0002122022,0.0015978877,0.00021266128,0.00027983525],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00072668464,0.0005522279,0.00052066764,0.00091281085,0.00033127263,0.0011350898,0.0029125996,0.00038868247,0.0000035621945],"category_scores_gemma":[0.00002858446,0.00046829722,0.00011865389,0.0008335265,0.00037671078,0.00047340777,0.00083977584,0.0006638376,0.000010543927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030678897,0.00010273846,0.000104448736,0.00010520184,0.000020337242,0.000059762388,0.00082357315,0.083198406,0.0014810257,0.13821205,0.00025199316,0.7756098],"study_design_scores_gemma":[0.0004928123,0.0005054105,0.0005842551,0.0004437541,0.00001343277,0.000059464983,4.6558756e-7,0.8612887,0.0025234849,0.12250888,0.010250001,0.001329301],"about_ca_topic_score_codex":0.00004319624,"about_ca_topic_score_gemma":0.00009317219,"teacher_disagreement_score":0.88646346,"about_ca_system_score_codex":0.000117303636,"about_ca_system_score_gemma":0.00025794256,"threshold_uncertainty_score":0.99990183},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003915634,0.0003565274,0.9953899,0.000005495844,0.0017459198,0.0007548851,0.000095931246,0.00021952616,0.0010402431],"genre_scores_gemma":[0.72659177,0.000007255644,0.27275658,0.0000091888705,0.00022775185,0.000043381846,0.000019251816,0.00008369865,0.0002611347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980499,0.0000063131656,0.00058640173,0.0005124279,0.00042707945,0.00041785956],"domain_scores_gemma":[0.9983401,0.0006568237,0.00013500502,0.00063887524,0.00016018131,0.00006906126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024227545,0.00040802633,0.000603538,0.00048227716,0.00005143317,0.00012846122,0.0006220711,0.00026708408,0.000002401348],"category_scores_gemma":[0.00003035334,0.00041201894,0.00011538778,0.00015143593,0.00012783626,0.00022671476,0.000113783026,0.0003141171,0.0000016952882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.413395e-7,0.0000051703305,0.00009572651,0.0004015549,0.000018368397,0.000013970969,0.000027398231,0.9951874,0.00033700874,0.0017870055,0.0000689325,0.0020565402],"study_design_scores_gemma":[0.00015930933,0.00004265378,0.00004881401,0.000628612,0.000015345351,0.000045480494,7.78465e-8,0.9965502,0.00032915716,0.00038099624,0.0014032916,0.00039605208],"about_ca_topic_score_codex":0.00008333956,"about_ca_topic_score_gemma":0.00004895128,"teacher_disagreement_score":0.7262002,"about_ca_system_score_codex":0.0005449156,"about_ca_system_score_gemma":0.0002122151,"threshold_uncertainty_score":0.99983317},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01808193,0.0001211855,0.022524742,0.035424706,0.016123708,0.0015478098,0.000039060033,0.00031533654,0.9058215],"genre_scores_gemma":[0.98724455,0.0000667174,0.0011402523,0.004391438,0.0014222765,0.00000984627,0.0000023738053,0.000029426214,0.0056931134],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684584,0.000095511015,0.00018555533,0.0007044952,0.0015701676,0.0005984587],"domain_scores_gemma":[0.99703133,0.001975051,0.00016892518,0.00051637564,0.00013303057,0.00017528536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017994042,0.00030388855,0.0002744125,0.0002350164,0.0009253234,0.0006593967,0.0016175446,0.00038157668,0.00009907393],"category_scores_gemma":[0.0019523323,0.0002162823,0.000109946595,0.00029589163,0.0019831308,0.00016724171,0.00022856791,0.0010891875,0.00009934726],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022696486,0.000063339896,0.00013956582,0.000012067174,0.000014124796,0.000044136417,0.0054712156,0.000107943626,0.00006958579,0.089264266,0.00061854627,0.9041725],"study_design_scores_gemma":[0.0006188138,0.0006471127,0.00088398316,0.00208387,0.000025628413,0.0000033571553,0.000019842912,0.0024788878,0.00062990666,0.78437716,0.20644888,0.0017825403],"about_ca_topic_score_codex":0.00005012354,"about_ca_topic_score_gemma":0.0009439035,"teacher_disagreement_score":0.96916264,"about_ca_system_score_codex":0.00022555319,"about_ca_system_score_gemma":0.0005919575,"threshold_uncertainty_score":0.88197356},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040050023,0.00035231092,0.9858372,0.0023621619,0.002042084,0.0005381953,0.000010236284,0.000049823277,0.004802971],"genre_scores_gemma":[0.9407628,0.00001847293,0.05609761,0.00231542,0.0003229396,0.000007735319,0.0000022229383,0.000012842636,0.00045993368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683523,0.00009156138,0.0005208393,0.001004649,0.0012435614,0.00030415112],"domain_scores_gemma":[0.9956862,0.0020606865,0.00034673922,0.0016295416,0.00021271501,0.000064169304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009343507,0.00032273884,0.00028296438,0.00018030954,0.00042092375,0.00014894942,0.0029986647,0.0001498585,0.000018219711],"category_scores_gemma":[0.00042953002,0.00019201267,0.0001645192,0.00071644195,0.0007911577,0.00021912772,0.0010629093,0.0005319907,0.000014483947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008324148,0.00028110703,0.000022110873,0.000031232732,0.00003194243,0.000033984434,0.0049114996,0.40001544,0.00220169,0.10712267,0.0011632799,0.4841018],"study_design_scores_gemma":[0.0009859304,0.0008133692,0.0016981962,0.0005053274,0.000009649956,0.00013314853,7.098478e-7,0.752128,0.086583905,0.14958104,0.0065318705,0.0010288445],"about_ca_topic_score_codex":0.000011597991,"about_ca_topic_score_gemma":0.000010710292,"teacher_disagreement_score":0.9367578,"about_ca_system_score_codex":0.00019324812,"about_ca_system_score_gemma":0.00050304533,"threshold_uncertainty_score":0.78300494},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31840804,0.000046836507,0.6807008,0.000516218,0.00007700472,0.00022472724,0.0000028072811,0.000020143842,0.0000034139814],"genre_scores_gemma":[0.5377574,0.000006909792,0.46213424,0.000065407075,0.000029645453,0.0000018240389,8.930543e-7,0.0000032945989,3.6956254e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892056,0.000032922293,0.00023978495,0.00032109785,0.0003093558,0.00017630064],"domain_scores_gemma":[0.99898106,0.00047353885,0.0001075047,0.00022288687,0.00017541787,0.000039619183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031455533,0.00010238465,0.00017447333,0.0001451171,0.00016663589,0.00002909247,0.00012989731,0.00006470788,0.000002552351],"category_scores_gemma":[0.0002478989,0.00007094298,0.000027906617,0.0016303236,0.0008337237,0.00014154459,0.000083619256,0.00026798598,4.5463443e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060348673,0.00041596097,0.007319329,0.00003831522,0.0000054568973,0.0000039328256,0.0003216557,0.2967342,0.2193298,0.0031007049,0.000004255046,0.47266603],"study_design_scores_gemma":[0.00024342445,0.00013112102,0.013440489,0.00011628549,0.00001252065,0.0001427946,0.000005346817,0.73943686,0.24346788,0.0029221138,0.0000059958475,0.0000751332],"about_ca_topic_score_codex":0.00014552182,"about_ca_topic_score_gemma":0.0000071957033,"teacher_disagreement_score":0.4725909,"about_ca_system_score_codex":0.00009544822,"about_ca_system_score_gemma":0.00009110124,"threshold_uncertainty_score":0.307189},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052338134,0.00048245245,0.99415123,0.0002597337,0.002993316,0.000868543,0.000005109713,0.00030901696,0.00040722013],"genre_scores_gemma":[0.3166377,0.00021800894,0.6806602,0.0010639994,0.000933172,0.000034898123,0.000014035425,0.000107047425,0.00033094027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99333507,0.00008058643,0.0010651043,0.0027678604,0.001026095,0.0017252687],"domain_scores_gemma":[0.9956259,0.0013479496,0.00055947946,0.0018603341,0.0003375662,0.0002687306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012038568,0.0009528802,0.0010483183,0.0010974434,0.00045554093,0.0004879789,0.004295957,0.000807098,0.0000035617393],"category_scores_gemma":[0.0001138738,0.00094908517,0.00028233294,0.0012061998,0.0007740233,0.0005194005,0.0015107731,0.0015275162,0.000011871691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009212433,0.000054215325,0.0001298106,0.000021606158,0.000008031346,0.00019625184,0.0005144684,0.831152,0.000048614707,0.0034528645,0.00002220641,0.16439068],"study_design_scores_gemma":[0.0007810353,0.000116091585,0.00018410195,0.0007177974,0.000005669145,0.00011485827,2.893359e-7,0.9956408,0.00020521328,0.00077651243,0.00041718944,0.0010404343],"about_ca_topic_score_codex":0.000049651033,"about_ca_topic_score_gemma":0.00026199906,"teacher_disagreement_score":0.3161143,"about_ca_system_score_codex":0.0006312763,"about_ca_system_score_gemma":0.0004576604,"threshold_uncertainty_score":0.99929595},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037505516,0.00041251737,0.9934653,0.0015494769,0.0011679407,0.0005325186,0.00001376619,0.00017457677,0.0023088336],"genre_scores_gemma":[0.5040102,0.000037356855,0.49242726,0.0017636005,0.00050884153,0.000020161131,0.000012292176,0.0000813448,0.0011389678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949446,0.00010168444,0.0007873177,0.0019202778,0.0014469327,0.00079922134],"domain_scores_gemma":[0.99625593,0.000559077,0.0005908557,0.0019064663,0.00042057037,0.00026711042],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016204354,0.00067888387,0.0008763646,0.00051256997,0.00028449082,0.00037193258,0.004105008,0.0006080722,0.00003845883],"category_scores_gemma":[0.0001412959,0.00058798783,0.00024066014,0.00061197544,0.0016776823,0.00042919055,0.0012634508,0.0024439574,0.00002451219],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014417236,0.00014212947,0.00018589797,0.00012732828,0.000043464246,0.0000303813,0.0024894632,0.028755855,0.003672459,0.010173857,0.0001715787,0.9541932],"study_design_scores_gemma":[0.0011309527,0.0007156905,0.00019136051,0.0008970592,0.000028046414,0.000113605245,0.0000011131372,0.7199679,0.016592324,0.24408893,0.014441708,0.0018312882],"about_ca_topic_score_codex":0.00014903767,"about_ca_topic_score_gemma":0.0000942619,"teacher_disagreement_score":0.9523619,"about_ca_system_score_codex":0.00022878875,"about_ca_system_score_gemma":0.0010061752,"threshold_uncertainty_score":0.9998574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016923961,0.0015766895,0.98515505,0.00023467376,0.0007527688,0.0001749872,0.000019911304,0.000029920331,0.010363601],"genre_scores_gemma":[0.9488725,0.0021206983,0.03694328,0.0070558754,0.0019873993,0.0000039274046,0.00010942436,0.00006159004,0.0028453064],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816734,0.000012995551,0.00024452314,0.0008278426,0.00031629324,0.00043101553],"domain_scores_gemma":[0.9990801,0.000032469718,0.00012723508,0.00052385917,0.00011363854,0.0001227015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017462479,0.00034276798,0.00030151982,0.00015949809,0.00023996276,0.00008289952,0.00073890615,0.00035462974,0.00004895647],"category_scores_gemma":[0.00002161264,0.00032404627,0.00012754668,0.00009023183,0.0003802426,0.0000053446406,0.00079739874,0.00031397998,0.000029518293],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015287597,0.00012241784,0.003687627,0.00013047499,0.00022764393,0.0003328169,0.00089833327,0.1451605,0.029589906,0.00029191392,0.013078273,0.8063272],"study_design_scores_gemma":[0.003030302,0.0028753306,0.00501463,0.001276107,0.0001631297,0.0010987617,0.0000017681654,0.34944332,0.019893691,0.026409255,0.58420706,0.006586666],"about_ca_topic_score_codex":0.000025546695,"about_ca_topic_score_gemma":0.000050155315,"teacher_disagreement_score":0.9482118,"about_ca_system_score_codex":0.00002520558,"about_ca_system_score_gemma":0.000121484794,"threshold_uncertainty_score":0.99992114},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016804729,0.00016645371,0.98639405,0.00018024872,0.00088598934,0.00057644676,0.000040255625,0.00026170345,0.011326796],"genre_scores_gemma":[0.050899647,0.000022785696,0.945926,0.0017375873,0.00027252824,0.00006838146,0.000043602795,0.000046323818,0.0009831215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556327,0.00003099186,0.00058681803,0.002205163,0.00078124827,0.00083252817],"domain_scores_gemma":[0.99686354,0.00029588607,0.00027498495,0.0019793555,0.00020286352,0.0003833842],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006710158,0.00061834167,0.00059857545,0.0008357196,0.00034953855,0.0006704769,0.0053874324,0.00032383765,0.000019160427],"category_scores_gemma":[0.00007122941,0.0005629013,0.00010701482,0.0010017741,0.0004997169,0.00035629648,0.0020163255,0.0007452026,0.0001288612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004697824,0.00008156611,0.000040440184,0.000022640603,0.000017663551,0.000027161452,0.0032971774,0.0013880278,0.00008563613,0.06171502,0.0001786982,0.9331413],"study_design_scores_gemma":[0.0003467142,0.00028553393,0.0007084993,0.0004483853,0.000019247338,0.00015741396,0.0000011532785,0.9546876,0.00015628463,0.03846909,0.003415831,0.0013042316],"about_ca_topic_score_codex":0.000065513545,"about_ca_topic_score_gemma":0.000026628017,"teacher_disagreement_score":0.9532996,"about_ca_system_score_codex":0.00017779977,"about_ca_system_score_gemma":0.00028876777,"threshold_uncertainty_score":0.9999939},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051815016,0.000592053,0.994603,0.00013504442,0.0020017612,0.00048314175,0.000009708015,0.00017718441,0.0014799893],"genre_scores_gemma":[0.035084616,0.00003540135,0.9611168,0.0014782114,0.0015147801,0.00001613998,0.000016848386,0.00006692772,0.00067030964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558866,0.000053447915,0.00063520775,0.0018385268,0.0011047992,0.0007793759],"domain_scores_gemma":[0.99675846,0.00024557236,0.00036527775,0.002087917,0.00026344534,0.00027932084],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000691133,0.00064924365,0.00070671155,0.00074448885,0.00056447485,0.0012192971,0.004191456,0.00037632647,0.00012340685],"category_scores_gemma":[0.00004344325,0.0005388106,0.00016691719,0.0004767185,0.00053776556,0.0012247949,0.002484961,0.00081763987,0.00010283999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010837055,0.00007239312,0.000031340176,0.000061094106,0.000030379153,0.00023719661,0.0007383925,0.038674485,0.0070999335,0.030129319,0.00044394776,0.9224707],"study_design_scores_gemma":[0.0007184934,0.000106257714,0.000027329019,0.00037756737,0.000009188688,0.00008787314,6.481479e-8,0.9303397,0.002209442,0.061383367,0.003929821,0.00081088394],"about_ca_topic_score_codex":0.000102630154,"about_ca_topic_score_gemma":0.000023204755,"teacher_disagreement_score":0.9216598,"about_ca_system_score_codex":0.00027104572,"about_ca_system_score_gemma":0.0004706586,"threshold_uncertainty_score":0.99981755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111812465,0.00009956974,0.9845141,0.0007948901,0.0022384117,0.0006483662,0.00002292236,0.00025218097,0.0002483042],"genre_scores_gemma":[0.5462733,0.0000028421703,0.4492859,0.0030770057,0.0011591389,0.000007326566,0.00003657598,0.000051477702,0.0001064603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946652,0.00010525811,0.0008353829,0.002096639,0.0015027014,0.0007948068],"domain_scores_gemma":[0.9964443,0.00042681117,0.00039034677,0.0017453281,0.00047611154,0.0005171359],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011351266,0.00063476403,0.0006167482,0.0012308259,0.00034961032,0.0011432742,0.0036643199,0.00041546221,0.000064632986],"category_scores_gemma":[0.00004213716,0.00062661397,0.00014549795,0.0008631416,0.00031163523,0.0008593486,0.0010539825,0.00067193195,0.0001716914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028672655,0.0002191818,0.00047234242,0.000069060814,0.000072547555,0.00010136088,0.09580723,0.0058032833,0.0007037281,0.018007576,0.00003463672,0.87868035],"study_design_scores_gemma":[0.0002647093,0.00012542015,0.0007963477,0.00033387836,0.000019105011,0.000032347038,0.0000017011623,0.98402876,0.00020218462,0.011705075,0.0017482466,0.0007422473],"about_ca_topic_score_codex":0.00027513574,"about_ca_topic_score_gemma":0.000620599,"teacher_disagreement_score":0.97822547,"about_ca_system_score_codex":0.00050356734,"about_ca_system_score_gemma":0.0005029388,"threshold_uncertainty_score":0.9998936},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009327419,0.0003842208,0.9907405,0.00074564747,0.0011003291,0.0009359524,0.000016838394,0.00024446184,0.0057387687],"genre_scores_gemma":[0.1364612,0.0003361146,0.85127515,0.0065376344,0.0009102434,0.00016474468,0.000041091218,0.00024125243,0.00403254],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945447,0.000056064695,0.0005237908,0.0022835361,0.0013735837,0.0012183568],"domain_scores_gemma":[0.99523854,0.0018230666,0.00021494993,0.002180303,0.00025716616,0.00028598125],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010915917,0.00070494704,0.0006623931,0.001877582,0.00045171616,0.00050333946,0.005589997,0.00036424884,0.000057480862],"category_scores_gemma":[0.00017907372,0.00063305313,0.00029753952,0.0010987578,0.0012590908,0.0006154671,0.00071514776,0.001022579,0.00008965441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007585116,0.00005285589,0.000004158994,0.000023339633,0.000018939567,0.000060181083,0.00030689177,0.04759992,0.00021087597,0.30902895,0.000058029083,0.64256],"study_design_scores_gemma":[0.0005679879,0.00071258016,0.000013030121,0.00024626852,0.0000049005102,0.000025533513,9.317737e-8,0.08352718,0.0013156907,0.9091807,0.0037033118,0.0007027356],"about_ca_topic_score_codex":0.000005706325,"about_ca_topic_score_gemma":0.000050718638,"teacher_disagreement_score":0.64185727,"about_ca_system_score_codex":0.00027206223,"about_ca_system_score_gemma":0.0004546997,"threshold_uncertainty_score":0.99979025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012266869,0.00266847,0.9938739,0.000031560816,0.0013342577,0.0004924431,0.000006280075,0.00014743989,0.00021899072],"genre_scores_gemma":[0.615593,0.000021017757,0.38403752,0.00011643267,0.00017923993,0.0000077410905,0.0000015148288,0.000022231066,0.000021285436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966009,0.000037615955,0.0006460078,0.0012042376,0.00075923407,0.00075200544],"domain_scores_gemma":[0.99760383,0.0005783729,0.00031670663,0.001062567,0.00020045742,0.00023806482],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010075718,0.0005165652,0.00075548835,0.00068810786,0.00021342952,0.00023843828,0.0018113113,0.00033024116,0.000003056629],"category_scores_gemma":[0.00009949786,0.00048432057,0.00010698755,0.00030723962,0.00042547056,0.00059860357,0.0008149011,0.0006452309,0.000009139967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034956724,0.000018574065,0.00031930246,0.000044591972,0.000013783442,0.000027379414,0.0011489693,0.83869046,0.00015974745,0.0009223832,3.4551982e-7,0.15865096],"study_design_scores_gemma":[0.00044998628,0.00012481592,0.000059897844,0.00037533825,0.0000151050535,0.000088508416,3.7925565e-7,0.9908291,0.000596876,0.0069474634,0.000023275492,0.0004892193],"about_ca_topic_score_codex":0.00007025304,"about_ca_topic_score_gemma":0.0000121579615,"teacher_disagreement_score":0.6143663,"about_ca_system_score_codex":0.00017859641,"about_ca_system_score_gemma":0.00034729563,"threshold_uncertainty_score":0.99976087},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06136375,0.00018711355,0.91079783,0.00028033406,0.0020666884,0.00037616547,0.000011632466,0.00004508706,0.024871383],"genre_scores_gemma":[0.97365296,0.000011592725,0.023909304,0.0004950207,0.0003661691,0.000011096594,0.000005698253,0.000012754698,0.0015354214],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99811864,0.00005303689,0.0003927682,0.00078084506,0.00041278225,0.00024192943],"domain_scores_gemma":[0.9987173,0.00037174206,0.00019533269,0.00039646882,0.0002425535,0.00007660111],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00071219046,0.00021768149,0.0003210608,0.0004972835,0.00010733237,0.00004581256,0.00035313502,0.00019872234,0.0018658477],"category_scores_gemma":[0.00009007414,0.00019563116,0.00005546716,0.0002282528,0.0014739662,0.000130645,0.0001596283,0.00040214302,0.000045351797],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001785354,0.00022363091,0.0017889827,0.00007820101,0.000035182442,0.000025237883,0.13463329,0.00031215377,0.0017947257,0.025091536,0.0001481225,0.8356904],"study_design_scores_gemma":[0.004121328,0.004165288,0.8242374,0.0025551512,0.00011385384,0.0009546239,0.0021019117,0.010058208,0.0034089715,0.1321037,0.010470455,0.00570909],"about_ca_topic_score_codex":0.000053183525,"about_ca_topic_score_gemma":0.00009248314,"teacher_disagreement_score":0.9122892,"about_ca_system_score_codex":0.00009271843,"about_ca_system_score_gemma":0.00013248531,"threshold_uncertainty_score":0.99904656},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023430772,0.00026578942,0.9921741,0.00059737737,0.00089574035,0.00056019274,0.00001911594,0.000081637765,0.003063008],"genre_scores_gemma":[0.9273768,0.000052653515,0.07110368,0.0012698951,0.00014165483,0.000010915169,0.000003675437,0.000019642159,0.00002105858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966543,0.000064245985,0.00049383915,0.0012717549,0.0010108637,0.0005050285],"domain_scores_gemma":[0.9959473,0.0013039414,0.00014174545,0.0022983835,0.00018664918,0.00012196821],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012398858,0.00042614437,0.00045309227,0.0005452625,0.00024923135,0.00034905854,0.0043568313,0.00023114523,0.00011577774],"category_scores_gemma":[0.000116939336,0.0002869521,0.00022997744,0.0007339705,0.0011177724,0.0005122132,0.0007419682,0.00085422606,0.000037809248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000624394,0.00005913097,0.00005277376,0.000031972977,0.000009150998,0.000012260049,0.0007050857,0.00091184693,0.00015966156,0.81782174,0.0000508149,0.18017933],"study_design_scores_gemma":[0.0001955412,0.00031043633,0.0006373861,0.00033800874,0.000007460786,0.000021570535,2.2237617e-7,0.055830393,0.0014768674,0.9403982,0.0002997699,0.00048410092],"about_ca_topic_score_codex":0.000037690206,"about_ca_topic_score_gemma":0.00004952341,"teacher_disagreement_score":0.92503375,"about_ca_system_score_codex":0.00010270018,"about_ca_system_score_gemma":0.00022392397,"threshold_uncertainty_score":0.9999583},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018349165,0.00041487927,0.9720086,0.0005523885,0.0017570421,0.00093932194,0.000006739812,0.000019586492,0.005952313],"genre_scores_gemma":[0.98030186,0.000017410244,0.017919185,0.0010687544,0.00023239326,0.000027074244,0.0000054509055,0.000025741252,0.00040214107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967452,0.00017861175,0.0005215351,0.0010428883,0.00094074407,0.00057099585],"domain_scores_gemma":[0.99647754,0.0016645632,0.00040114895,0.0011754775,0.00020439163,0.0000768856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017025438,0.00045341987,0.00053800136,0.00058242265,0.00015671381,0.00024812593,0.003319139,0.00020048396,0.00008372389],"category_scores_gemma":[0.0003001371,0.00030036535,0.00016702637,0.00053562294,0.00053162256,0.00065785093,0.0012320805,0.00094539387,0.00012588208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007398182,0.000052636446,0.0012633508,0.00018756029,0.000051605115,0.00011022427,0.006284299,0.03494447,0.015046422,0.009014689,0.00023816794,0.9327326],"study_design_scores_gemma":[0.001123788,0.0022183398,0.0026509487,0.0015466547,0.00002644186,0.00008887239,0.0000016247942,0.9087248,0.05886152,0.02350579,0.000290816,0.0009604359],"about_ca_topic_score_codex":0.00009793139,"about_ca_topic_score_gemma":0.000027509843,"teacher_disagreement_score":0.9619527,"about_ca_system_score_codex":0.00023892378,"about_ca_system_score_gemma":0.00027335505,"threshold_uncertainty_score":0.99994487},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017721234,0.00060089264,0.9797548,0.00082927785,0.0016369544,0.0011471298,0.00001563312,0.00014927985,0.014093903],"genre_scores_gemma":[0.49462345,0.00034290113,0.5001765,0.0039591426,0.00022326616,0.00008882235,0.000018090757,0.00006869518,0.00049912074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611956,0.000028253975,0.0006903307,0.001517761,0.0009496796,0.00069438777],"domain_scores_gemma":[0.99744934,0.00043658385,0.00040003273,0.0014630666,0.00015820086,0.00009278979],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056613534,0.0005432173,0.0006188379,0.0011823545,0.0001231468,0.00018344389,0.0044370126,0.00025190052,0.000016981534],"category_scores_gemma":[0.0000052530067,0.00047364796,0.00014414937,0.0007493296,0.00022079868,0.00041064477,0.001285794,0.00040103187,0.000018023487],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007677348,0.00025588728,0.00025383598,0.0023123862,0.00009008561,0.00017731672,0.003828536,0.049000997,0.00017909693,0.22114663,0.000019914158,0.7226586],"study_design_scores_gemma":[0.0018151967,0.000955948,0.0006140843,0.0053652436,0.000030958556,0.000017815131,0.000004389054,0.49856648,0.0022105554,0.4864106,0.0027536133,0.0012551296],"about_ca_topic_score_codex":0.00004972357,"about_ca_topic_score_gemma":0.00047349234,"teacher_disagreement_score":0.7214034,"about_ca_system_score_codex":0.00017436646,"about_ca_system_score_gemma":0.00008921068,"threshold_uncertainty_score":0.99977154},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006035429,0.00055497047,0.99292785,0.00041588,0.0015237588,0.000716409,0.000012563567,0.0001443709,0.0036438445],"genre_scores_gemma":[0.05430977,0.000020649632,0.94463336,0.0005075257,0.00034768216,0.000036043766,0.000011510441,0.000032868167,0.00010059121],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963724,0.000034348002,0.0006369463,0.0013967166,0.0008498828,0.0007097036],"domain_scores_gemma":[0.9975724,0.0006432705,0.0003032683,0.0009812999,0.00033696322,0.00016277158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017393872,0.00045274344,0.0005434323,0.0012891024,0.00022708256,0.00046653827,0.0025845706,0.00026294816,0.000006540227],"category_scores_gemma":[0.00019623515,0.00044796185,0.00014370932,0.0009771506,0.0006782246,0.0006809439,0.00094547373,0.0006369286,0.0000086614145],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008106721,0.00003753803,0.000028697721,0.000059342157,0.000005848732,0.00003137863,0.00080131344,0.03298127,0.000034695495,0.183653,0.000025868769,0.78233296],"study_design_scores_gemma":[0.0002949993,0.00008513071,0.000014294274,0.00023661362,0.000002225303,0.000027983611,2.8063184e-7,0.4981445,0.00009818765,0.5001819,0.0005928231,0.00032103295],"about_ca_topic_score_codex":0.00003107437,"about_ca_topic_score_gemma":0.00014076258,"teacher_disagreement_score":0.7820119,"about_ca_system_score_codex":0.00030252634,"about_ca_system_score_gemma":0.0005641413,"threshold_uncertainty_score":0.9997972},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008860918,0.0006584825,0.9935303,0.0022061274,0.0008669881,0.0010702033,0.0000398907,0.0002621857,0.0012772531],"genre_scores_gemma":[0.0041606715,0.0008055661,0.9855615,0.00309163,0.0009229945,0.00006486518,0.00004632578,0.00007336858,0.0052731116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957127,0.000054603373,0.0006671408,0.0014020585,0.0014634148,0.0007000673],"domain_scores_gemma":[0.99626493,0.0012305491,0.0003790807,0.0011615675,0.00070498505,0.00025889566],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0024762487,0.0005019164,0.00043775074,0.00095507427,0.0013381996,0.0009483647,0.002203804,0.00046596857,0.00007135325],"category_scores_gemma":[0.0004702945,0.000383414,0.00020594666,0.001673537,0.002142799,0.0006191224,0.0009572504,0.00085929653,0.000015599353],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026620363,0.00024056496,0.00014242176,0.00027654943,0.0001313802,0.00015433546,0.0021174203,0.00010262809,0.044701334,0.026777402,0.0041709123,0.9209188],"study_design_scores_gemma":[0.0021272216,0.0007658754,0.0014925107,0.0005440426,0.00011976134,0.0010306373,0.0000017458593,0.62151444,0.13228971,0.16902553,0.068345785,0.0027427257],"about_ca_topic_score_codex":0.000051458734,"about_ca_topic_score_gemma":0.00021349569,"teacher_disagreement_score":0.9181761,"about_ca_system_score_codex":0.0003261348,"about_ca_system_score_gemma":0.00054834766,"threshold_uncertainty_score":0.9999619},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045805887,0.0006732378,0.8669123,0.11281748,0.0021819547,0.0007893223,0.000011485253,0.00019209064,0.015964044],"genre_scores_gemma":[0.99231654,0.00042474933,0.00484541,0.0009099946,0.00048703974,0.00001935249,0.000041656607,0.000013099213,0.00094214786],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997848,0.0001626519,0.00025695382,0.00053005567,0.00075259025,0.0004497679],"domain_scores_gemma":[0.99794465,0.0008769376,0.00017405073,0.0008340078,0.0000908257,0.00007950665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014918114,0.0002301754,0.0002616271,0.00026711274,0.0002923388,0.00025177092,0.0030663572,0.00044149935,0.000112739304],"category_scores_gemma":[0.00060797425,0.00013709495,0.000071665134,0.00085275125,0.0023547332,0.00022377002,0.00048482968,0.0010524199,0.000024486328],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007689627,0.000036038753,0.0009045364,0.000003977714,0.0000031244053,0.000028910159,0.0168973,0.00007477546,0.0000017542137,0.05446925,0.00033170165,0.92724097],"study_design_scores_gemma":[0.00048379044,0.000073749085,0.004294167,0.0007534475,0.000014997321,0.000021424474,0.00009763577,0.00733139,0.00003313267,0.24772887,0.7382802,0.0008872152],"about_ca_topic_score_codex":0.000188033,"about_ca_topic_score_gemma":0.0054210667,"teacher_disagreement_score":0.9918585,"about_ca_system_score_codex":0.00031961992,"about_ca_system_score_gemma":0.00023676397,"threshold_uncertainty_score":0.8676112},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33916628,0.00003243613,0.65994096,0.00019726153,0.0003902885,0.00023308568,9.068065e-7,0.000028579647,0.00001018471],"genre_scores_gemma":[0.97794455,0.0000034141244,0.021279356,0.00056918996,0.00016736571,0.000023141398,0.000003228739,0.0000061225483,0.000003653846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989236,0.00002205313,0.00017734144,0.00030700685,0.000216876,0.00035310187],"domain_scores_gemma":[0.9994651,0.00009987022,0.0000468286,0.00023948541,0.00005811822,0.000090567206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035988694,0.00010642196,0.00018741746,0.0007283123,0.00006941358,0.000035294146,0.00010150834,0.00004358088,0.000018680936],"category_scores_gemma":[0.00009188252,0.00009086379,0.000064507425,0.0020171106,0.00007438915,0.00012166957,0.00006266118,0.000114194634,0.0000043369537],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043272128,0.00013394626,0.15959671,0.000028533817,0.000031091135,0.000012391343,0.0004911795,0.005301321,0.008718195,0.0000024603921,0.0000029981754,0.8256379],"study_design_scores_gemma":[0.001107657,0.0003589507,0.3555864,0.000045935,0.0001339342,0.000076882076,0.000010104067,0.44513008,0.1968219,0.00013412046,0.00035945402,0.00023457092],"about_ca_topic_score_codex":0.00016356114,"about_ca_topic_score_gemma":0.0007184209,"teacher_disagreement_score":0.82540333,"about_ca_system_score_codex":0.00017519473,"about_ca_system_score_gemma":0.000026219463,"threshold_uncertainty_score":0.37053177},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059201233,0.00023425795,0.9978125,0.000044656874,0.00079974363,0.00043099158,0.000013855454,0.00013936129,0.0004654387],"genre_scores_gemma":[0.48654938,0.000018051085,0.5122509,0.00006607963,0.00069112965,0.0000062170634,0.000013176374,0.000036225247,0.0003688341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968017,0.00003468456,0.00054623827,0.0011067077,0.0010031258,0.0005075491],"domain_scores_gemma":[0.9969506,0.0003817088,0.00059688406,0.0015452113,0.00041752483,0.000108025735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010405286,0.00040023235,0.00046058794,0.00041243382,0.00016186651,0.00033456195,0.0032399916,0.00020433412,0.000016504975],"category_scores_gemma":[0.000098481345,0.00031824454,0.000041153027,0.00040077724,0.0005183629,0.00090025,0.0017243753,0.00055669405,0.000008994226],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052946466,0.00007736911,0.0064233667,0.00013014018,0.00002938564,0.000038250902,0.0012889471,0.0042666495,0.0020139853,0.060016245,0.0000029639314,0.9257074],"study_design_scores_gemma":[0.0017083869,0.0039355145,0.003943175,0.009904405,0.0002079766,0.0006950934,0.000012371069,0.82855505,0.08911265,0.010598595,0.04405122,0.007275551],"about_ca_topic_score_codex":0.000053326738,"about_ca_topic_score_gemma":0.000016551656,"teacher_disagreement_score":0.9184319,"about_ca_system_score_codex":0.00016279976,"about_ca_system_score_gemma":0.00048438617,"threshold_uncertainty_score":0.999927},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020578675,0.00085490354,0.9758027,0.00010939553,0.00048229718,0.0012680896,0.00003078582,0.000030660616,0.0008424739],"genre_scores_gemma":[0.9068519,0.00003692478,0.09130258,0.00063968496,0.0006835816,0.000026980122,0.00015920296,0.000060360926,0.00023878539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969378,0.00002955199,0.00039039872,0.0015930933,0.0004266931,0.00062242744],"domain_scores_gemma":[0.9982505,0.000057623904,0.00013914167,0.0013486405,0.00008066888,0.00012341162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007550848,0.0003956488,0.00034326952,0.0005134438,0.00014427272,0.00014984848,0.0017176729,0.00029950452,0.000007634158],"category_scores_gemma":[0.00026214775,0.00039153732,0.00005085579,0.00036595788,0.000114713075,0.000017346383,0.0017102145,0.00045061755,0.000014870297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022171322,0.00006785606,0.00049704645,0.00012908371,0.000026611138,0.00010940573,0.0011607836,0.06658615,0.032210413,0.00010270407,0.000016109978,0.8990717],"study_design_scores_gemma":[0.003660602,0.002209528,0.00430121,0.003699306,0.00010735649,0.00026164987,0.000013127322,0.84626997,0.03980794,0.045565475,0.047724515,0.006379302],"about_ca_topic_score_codex":0.000014734419,"about_ca_topic_score_gemma":0.0005529145,"teacher_disagreement_score":0.8926924,"about_ca_system_score_codex":0.00015427318,"about_ca_system_score_gemma":0.00020979972,"threshold_uncertainty_score":0.9998537},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009278089,0.00073190336,0.98120505,0.0002511996,0.002431078,0.00038252465,9.960072e-7,0.00056723907,0.014337209],"genre_scores_gemma":[0.39865935,0.000089721885,0.5989788,0.0007378953,0.0004867992,0.00001778829,0.0000051914094,0.000067479574,0.00095693977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958142,0.00009123038,0.00079737947,0.0015956663,0.00088659755,0.00081494305],"domain_scores_gemma":[0.99747396,0.0005005185,0.00046069917,0.0012125483,0.00020302084,0.00014925083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016264849,0.0005546703,0.00066678924,0.0015663757,0.00029342438,0.0009138363,0.0031130265,0.00039871025,0.0000076882525],"category_scores_gemma":[0.00013964334,0.00055124774,0.00010832323,0.0012751512,0.00033572598,0.0006273218,0.0011675302,0.0010961063,0.000017176137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002417382,0.00002246872,0.00025322946,0.00003375907,0.000004501205,0.00019652053,0.0006631273,0.6139554,0.000013072925,0.00505081,0.000040375107,0.37976435],"study_design_scores_gemma":[0.00018389543,0.00006856222,0.00006326767,0.0011328106,0.0000028965017,0.00023638345,4.76933e-7,0.9790432,0.00023785316,0.01753241,0.0008367608,0.000661482],"about_ca_topic_score_codex":0.00012901473,"about_ca_topic_score_gemma":0.00007355832,"teacher_disagreement_score":0.39856657,"about_ca_system_score_codex":0.0005447517,"about_ca_system_score_gemma":0.00044332765,"threshold_uncertainty_score":0.99969393},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016825782,0.0004393586,0.9942375,0.00052743417,0.0010567943,0.00028769937,0.000031429376,0.00013992486,0.0015973207],"genre_scores_gemma":[0.6531889,0.0000663399,0.34474024,0.0013405951,0.0003169319,0.000007097797,0.000011780629,0.00003514266,0.0002930056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969483,0.000053878273,0.0005494703,0.0009847556,0.00087237486,0.00059124833],"domain_scores_gemma":[0.99747336,0.00037397916,0.00021691715,0.0015759214,0.0001855305,0.00017429743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008577609,0.00045516773,0.00055284903,0.0006374713,0.00023139818,0.00025375953,0.0030451962,0.00017140823,0.00005449467],"category_scores_gemma":[0.000046693895,0.00038780316,0.00014053896,0.0004366417,0.0012621443,0.000616916,0.0010093228,0.00053735764,0.00005901516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009077325,0.00010749552,0.000034579494,0.00003594091,0.00001978756,0.000023601599,0.0015313315,0.050469667,0.0011567252,0.37347004,0.000024357334,0.5731174],"study_design_scores_gemma":[0.00031367215,0.0003329407,0.0010412049,0.00042775503,0.000009997239,0.000030866522,3.025468e-7,0.5768172,0.011443514,0.407793,0.0009914135,0.0007981334],"about_ca_topic_score_codex":0.00005946179,"about_ca_topic_score_gemma":0.00015899795,"teacher_disagreement_score":0.6515063,"about_ca_system_score_codex":0.00015758132,"about_ca_system_score_gemma":0.0002971461,"threshold_uncertainty_score":0.99985737},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010754686,0.000021112359,0.98730546,0.000037716658,0.00069546135,0.0008452649,0.000007857048,0.00008821584,0.00024420672],"genre_scores_gemma":[0.2751128,0.000005852063,0.7247168,0.00004271748,0.000057805522,0.000026749189,0.000008744623,0.000016469943,0.000012066811],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981319,0.00014764135,0.00035265906,0.00063992845,0.0005257531,0.00020217153],"domain_scores_gemma":[0.99638635,0.0015711209,0.00049502426,0.001033138,0.00045770445,0.00005665071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024610385,0.00024871985,0.00035323788,0.00030282003,0.00012281009,0.00012509579,0.0019518347,0.00021889956,0.0000041060616],"category_scores_gemma":[0.0005489935,0.00019088155,0.00009405632,0.00031945336,0.00029367892,0.0010938188,0.0003165009,0.00030836114,4.5892008e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005790561,0.00029475844,0.0002631468,0.0006798744,0.0000927193,0.000007314335,0.00378834,0.2976833,0.054549873,0.08476189,0.0000014563345,0.5572983],"study_design_scores_gemma":[0.00047929978,0.00084459234,0.00050281966,0.0005274189,0.000023582352,0.000010546343,2.1828077e-7,0.23449469,0.4991886,0.2635551,0.00007479218,0.00029832264],"about_ca_topic_score_codex":0.00007303118,"about_ca_topic_score_gemma":0.0000059057643,"teacher_disagreement_score":0.557,"about_ca_system_score_codex":0.00007528287,"about_ca_system_score_gemma":0.00022560114,"threshold_uncertainty_score":0.7783924},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010806697,0.00022927554,0.99321836,0.0004117137,0.002745719,0.00086277246,0.00003324537,0.00061084004,0.00080739654],"genre_scores_gemma":[0.08655857,0.000015824287,0.9084151,0.003707767,0.0007850232,0.000023051824,0.00002311068,0.00006532352,0.0004062487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936467,0.000040019742,0.0010007645,0.0023696125,0.001668653,0.0012742461],"domain_scores_gemma":[0.9953545,0.00057878933,0.00034100175,0.002639722,0.0005772653,0.0005087721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016832603,0.00085440575,0.000877494,0.0011316761,0.0004136139,0.0006164766,0.0048935027,0.0006820069,0.000026181338],"category_scores_gemma":[0.00017870328,0.0007392636,0.00023933084,0.0011715401,0.00049276446,0.0012132255,0.0018493899,0.001014818,0.00024679874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027076963,0.000049840717,0.00027776192,0.00006568331,0.000022867784,0.00011425106,0.0038285858,0.2771075,0.0001293375,0.0011424173,0.00020467947,0.71703],"study_design_scores_gemma":[0.00037511412,0.0002476933,0.00023028426,0.0006092464,0.0000130738335,0.000044085176,4.096253e-7,0.9119083,0.0019879045,0.08218341,0.00114667,0.0012537785],"about_ca_topic_score_codex":0.00014915866,"about_ca_topic_score_gemma":0.00016261029,"teacher_disagreement_score":0.7157762,"about_ca_system_score_codex":0.00059609226,"about_ca_system_score_gemma":0.0009456098,"threshold_uncertainty_score":0.9995058},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027064356,0.00020706152,0.99757284,0.00015348155,0.000706493,0.00041622535,0.0000013929342,0.00041144073,0.00026043926],"genre_scores_gemma":[0.095822416,0.000013763505,0.9037827,0.00020414626,0.00010806169,0.000010683693,0.0000013567567,0.000031905896,0.000024914985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600077,0.00007510198,0.00059953594,0.0016586374,0.00083601254,0.0008299639],"domain_scores_gemma":[0.9969693,0.001106516,0.00013852226,0.0014923014,0.00015657675,0.0001368115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030181662,0.0006171043,0.0006958809,0.0008509338,0.00009012795,0.0002254144,0.0026182581,0.00029288384,0.0000022623742],"category_scores_gemma":[0.000614734,0.0005603425,0.00007239303,0.0007378452,0.00021527769,0.0008458441,0.00076078053,0.0010593083,0.000003934132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000519073,0.000011182641,0.000019386489,0.000023896415,0.000003798657,0.00007972064,0.00028340798,0.78028685,0.00007469156,0.0063475734,1.3476802e-7,0.21286418],"study_design_scores_gemma":[0.00026819186,0.00009656241,0.000065799766,0.0005291859,0.0000022764852,0.000032357602,7.716273e-8,0.7552514,0.00021296501,0.24294318,0.000035826106,0.0005621342],"about_ca_topic_score_codex":0.000011479253,"about_ca_topic_score_gemma":0.000030449157,"teacher_disagreement_score":0.23659562,"about_ca_system_score_codex":0.0007106801,"about_ca_system_score_gemma":0.0003138617,"threshold_uncertainty_score":0.9996848},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010801014,0.0055632056,0.9924248,0.0005129211,0.00028403633,0.00026646868,0.0000064402407,0.00037848504,0.00055283477],"genre_scores_gemma":[0.09448734,0.0000174839,0.904637,0.00068512216,0.00010176832,0.000008007908,0.000008883482,0.000024580875,0.000029832689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969989,0.000054276923,0.0003703117,0.0013488152,0.0007814896,0.00044617604],"domain_scores_gemma":[0.99820316,0.00046957188,0.00014047419,0.0008896808,0.000104116654,0.0001930227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006537986,0.00043186353,0.0003782115,0.0005369462,0.00022489755,0.0006085881,0.0016466695,0.00021562102,0.00004644273],"category_scores_gemma":[0.00003631802,0.00038205303,0.000041722014,0.00029792933,0.00052668207,0.0006251287,0.00035896612,0.00060104387,0.0000037858676],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060736775,0.000025199797,0.00001010925,0.000035429533,0.0000033046092,0.000100898076,0.0006438652,0.0009429385,0.00030950407,0.06318626,0.000004647155,0.9347318],"study_design_scores_gemma":[0.0002098855,0.00019113994,0.0000093692715,0.00018155298,0.0000051998422,0.00005006435,5.5914455e-8,0.8532207,0.0041014296,0.14100355,0.000528252,0.00049879414],"about_ca_topic_score_codex":0.000054610326,"about_ca_topic_score_gemma":0.000025581981,"teacher_disagreement_score":0.93423295,"about_ca_system_score_codex":0.00014427408,"about_ca_system_score_gemma":0.00015631065,"threshold_uncertainty_score":0.99986315},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030943942,0.0016716333,0.9377768,0.00088461017,0.0013237344,0.0010173807,0.0000031534485,0.00017538464,0.057116352],"genre_scores_gemma":[0.035015065,0.00045037645,0.960146,0.0015067974,0.00077194296,0.00004949526,0.0000111583195,0.00006949792,0.0019796563],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99503016,0.00007478034,0.00092862255,0.0016155118,0.0013776952,0.0009732447],"domain_scores_gemma":[0.99624527,0.0006103022,0.0007581179,0.0015397033,0.00066127867,0.00018534553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002547892,0.00067782664,0.0006756368,0.0007478791,0.00040923024,0.0009720688,0.004851084,0.0004681464,0.000023369394],"category_scores_gemma":[0.000043621887,0.0004676626,0.00024644073,0.0010861777,0.0012263758,0.0013455356,0.00169027,0.0011182434,0.00006936384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008522296,0.00008096346,0.000056716835,0.00016246623,0.000021679563,0.000041287673,0.0052143107,0.0027431191,0.00010410608,0.4059148,0.00007954859,0.5855725],"study_design_scores_gemma":[0.00041280428,0.0004502251,0.00009819492,0.0015003069,0.000024099409,0.00018706723,0.000002831612,0.024902117,0.0015897001,0.9608651,0.009069636,0.0008979576],"about_ca_topic_score_codex":0.000038694125,"about_ca_topic_score_gemma":0.00019783781,"teacher_disagreement_score":0.58467454,"about_ca_system_score_codex":0.0002638329,"about_ca_system_score_gemma":0.0008289774,"threshold_uncertainty_score":0.9997775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01580326,0.00093062996,0.9815395,0.00017335518,0.0005580577,0.00081506826,0.000032889508,0.00004750912,0.00009976126],"genre_scores_gemma":[0.9395486,0.00020205704,0.05987531,0.0002458329,0.0000691673,0.000013060524,0.000006099528,0.0000226856,0.000017169017],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9973244,0.00006424516,0.0005865562,0.0008467394,0.0008133568,0.00036470775],"domain_scores_gemma":[0.99698323,0.00037912428,0.0006249461,0.0016057326,0.00032136645,0.000085575375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053953426,0.00037374377,0.00043396195,0.000626011,0.00015902857,0.000051224317,0.0026819783,0.0001935995,0.000017813269],"category_scores_gemma":[0.000050808576,0.00025108276,0.0003709535,0.00093106006,0.00076182827,0.0002718593,0.00071586156,0.0004367752,0.0000041132307],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022049395,0.00018055766,0.009260311,0.00041805708,0.0000817215,0.000008256156,0.0030035535,0.024625693,0.0022137882,0.0061469176,0.000044021326,0.95399505],"study_design_scores_gemma":[0.00264088,0.0031149767,0.5730837,0.009595236,0.00018755904,0.00009257784,0.0000054582597,0.19818023,0.078082055,0.13213946,0.00016964987,0.0027081908],"about_ca_topic_score_codex":0.00032526237,"about_ca_topic_score_gemma":0.00009342563,"teacher_disagreement_score":0.9512869,"about_ca_system_score_codex":0.00013807819,"about_ca_system_score_gemma":0.0004318207,"threshold_uncertainty_score":0.99999416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007280965,0.0011947226,0.9924247,0.00065512623,0.00043027542,0.0006208409,0.0000067226433,0.00016514833,0.0037743475],"genre_scores_gemma":[0.73750407,0.0001918449,0.25866997,0.0018506122,0.0007584727,0.00008277146,0.00006866439,0.000042458363,0.0008311626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719304,0.000035275167,0.00043618458,0.0012815568,0.000659364,0.0003945922],"domain_scores_gemma":[0.99849886,0.00031146893,0.00017962515,0.00059091375,0.00024136668,0.00017777116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045445902,0.00037874177,0.00030764073,0.0008000282,0.00040168763,0.0004201924,0.0010784727,0.00021516038,0.000046100755],"category_scores_gemma":[0.000014635274,0.00038074114,0.000072136776,0.00083909696,0.0002001979,0.00024873804,0.00041855124,0.00039100306,0.00015383081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004329507,0.00003618785,0.0000027408184,0.000016526752,0.0000062766535,0.000011119356,0.00013736494,0.5660305,0.00023786914,0.03732121,0.00001816271,0.3961777],"study_design_scores_gemma":[0.00018328542,0.00008307872,0.00007730565,0.000086437314,0.00000714015,0.00008284442,3.885992e-8,0.92939425,0.001195038,0.062303517,0.0061753257,0.00041171812],"about_ca_topic_score_codex":0.0000037392863,"about_ca_topic_score_gemma":0.0000071785103,"teacher_disagreement_score":0.73677593,"about_ca_system_score_codex":0.00016862284,"about_ca_system_score_gemma":0.0003202823,"threshold_uncertainty_score":0.99986446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017360489,0.00013643151,0.9971232,0.0003466486,0.0005689287,0.00019282776,0.000015351616,0.00007436148,0.0013686892],"genre_scores_gemma":[0.13199633,0.00015787907,0.86639917,0.0008861804,0.00032123012,0.000019824574,0.000020155674,0.000035724508,0.00016351805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975984,0.000016077332,0.0004726375,0.0009743013,0.00057183334,0.00036677014],"domain_scores_gemma":[0.99799806,0.00015628406,0.00015593984,0.0013998813,0.00016376532,0.0001260623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004971847,0.00028862932,0.0003671644,0.00038851285,0.000096743206,0.00013576094,0.0026825967,0.00018586061,0.000041490217],"category_scores_gemma":[0.00003291471,0.00025869242,0.000097063814,0.0003043167,0.00041958157,0.00038558937,0.0010579221,0.0004162188,0.00006190866],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014008389,0.000037047947,0.000056277895,0.000029976105,0.0000056722943,0.000010783772,0.0003697851,0.00019492758,0.00011679734,0.07671561,0.000012424654,0.9224493],"study_design_scores_gemma":[0.0004230726,0.0004317678,0.0034418874,0.0011480955,0.00002871201,0.000109004766,2.0702625e-7,0.55158734,0.011792284,0.42557007,0.0042047603,0.0012628047],"about_ca_topic_score_codex":0.000044653843,"about_ca_topic_score_gemma":0.0000325666,"teacher_disagreement_score":0.9211865,"about_ca_system_score_codex":0.000090644244,"about_ca_system_score_gemma":0.00021059622,"threshold_uncertainty_score":0.9999865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040704434,0.00018008128,0.99541,0.0003659483,0.0009923637,0.00020364854,0.0000070028,0.00014246139,0.0022914198],"genre_scores_gemma":[0.53011787,0.000035496185,0.46800688,0.0012375466,0.0002562846,0.000003893135,0.000007334379,0.00003286173,0.00030184028],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705654,0.00004885247,0.00054540933,0.0010453606,0.00082915777,0.0004746827],"domain_scores_gemma":[0.9974786,0.00034940397,0.00041420342,0.00141761,0.00022005616,0.00012011934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011667979,0.00038160544,0.0005557589,0.0005754874,0.00012886804,0.00019852226,0.0031296106,0.00017574806,0.00002539525],"category_scores_gemma":[0.0000537479,0.00034263884,0.00013052644,0.00039464902,0.0013556493,0.00029768187,0.0011590276,0.00045826135,0.00003914148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000420526,0.000017836137,0.000022056549,0.00005322695,0.0000073921237,0.0000159257,0.0003678365,0.007545054,0.00037648494,0.24187966,0.00002131272,0.74968904],"study_design_scores_gemma":[0.00014366987,0.00011675758,0.00018114538,0.00022602701,0.000003110192,0.00002554526,3.373434e-8,0.4027389,0.0029145714,0.5925473,0.00076447707,0.00033845508],"about_ca_topic_score_codex":0.000032248452,"about_ca_topic_score_gemma":0.00003940785,"teacher_disagreement_score":0.74935055,"about_ca_system_score_codex":0.00012962114,"about_ca_system_score_gemma":0.00023911108,"threshold_uncertainty_score":0.99990255},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00465833,0.0002990323,0.99331087,0.000115704046,0.0007896809,0.0003278135,0.000022506441,0.000029148123,0.0004469317],"genre_scores_gemma":[0.6830065,0.000010015744,0.31644857,0.000107587286,0.00017544687,0.000009201244,0.000004598049,0.000018873461,0.00021918754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970021,0.0000176648,0.00066486123,0.0008880488,0.0011087422,0.00031858153],"domain_scores_gemma":[0.997286,0.0012994847,0.00033962427,0.00058118836,0.00036122164,0.00013248099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017544053,0.00031671865,0.0004932248,0.00072223134,0.00017802272,0.0001630686,0.0010723409,0.00030790156,0.00007424806],"category_scores_gemma":[0.00035870925,0.00024048558,0.00007302382,0.0003420549,0.00073180237,0.00033727044,0.00031083572,0.0005842818,0.000024965253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056898607,0.0001105369,0.000035560173,0.00012929994,0.000023115372,0.00001121509,0.0013644951,0.82296395,0.0073502776,0.035919305,0.000018595863,0.13201678],"study_design_scores_gemma":[0.00054778956,0.00024320801,0.0006664879,0.0005051168,0.000015711867,0.00013272594,5.049262e-7,0.71540135,0.00090303126,0.28084403,0.00020833182,0.0005316925],"about_ca_topic_score_codex":0.0000019274983,"about_ca_topic_score_gemma":0.000010990394,"teacher_disagreement_score":0.6783482,"about_ca_system_score_codex":0.00006480027,"about_ca_system_score_gemma":0.00023264113,"threshold_uncertainty_score":0.9806717},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004321416,0.00046048788,0.9932103,0.00068746874,0.0024516322,0.00033707728,0.000003353217,0.00017907695,0.0022384222],"genre_scores_gemma":[0.2875366,0.000025167288,0.70973223,0.00086956756,0.0011570649,0.000008349687,0.000028773538,0.000030244308,0.0006120053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965736,0.000027901691,0.0005269136,0.0012991214,0.0010745142,0.0004979264],"domain_scores_gemma":[0.99825895,0.00024877206,0.0002661946,0.0007944286,0.00027886432,0.0001527868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083384017,0.0004259976,0.0003808057,0.0011245427,0.00041496605,0.00088386197,0.001660382,0.0002691781,0.000050148334],"category_scores_gemma":[0.00008896274,0.0004321879,0.00014093303,0.0008702652,0.00030489574,0.0009799782,0.0006459587,0.0005442957,0.0000764425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041439084,0.000015314785,0.0000044071485,0.000013515325,0.0000061770957,0.000028683584,0.00033315114,0.5344601,0.00017929882,0.06275261,0.000008494723,0.40219408],"study_design_scores_gemma":[0.00047260674,0.00014979701,0.00018194153,0.00020687946,0.0000069512926,0.000069802365,7.070303e-8,0.6626308,0.0018875985,0.33205712,0.0017573884,0.0005790309],"about_ca_topic_score_codex":0.000009877027,"about_ca_topic_score_gemma":0.000016996844,"teacher_disagreement_score":0.40161505,"about_ca_system_score_codex":0.00056686235,"about_ca_system_score_gemma":0.0012689752,"threshold_uncertainty_score":0.999813},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085522677,0.0009501179,0.98899865,0.0012396027,0.0011472366,0.0004298137,0.000020103547,0.00004777663,0.006311493],"genre_scores_gemma":[0.9390868,0.0003150682,0.05185746,0.0029025425,0.0018537354,0.000035852365,0.0000123162035,0.000033727178,0.0039024982],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983289,0.000013908584,0.00019546425,0.00059131824,0.00051421236,0.00035617905],"domain_scores_gemma":[0.9992395,0.00024285556,0.00009459079,0.00016328155,0.00015104354,0.00010870932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045781102,0.0001876442,0.00023247047,0.00019791338,0.0006314724,0.00011869592,0.00037518112,0.00014508319,0.000016529491],"category_scores_gemma":[0.00009244269,0.0001646644,0.00005755427,0.0001349137,0.0007119618,0.00020211832,0.0001416206,0.0001842473,0.0000031281625],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008254924,0.000023982435,0.0003192853,0.00005858507,0.000007986494,0.000015626838,0.03947538,0.0015622494,0.000013936754,0.055486165,0.000035607067,0.90299296],"study_design_scores_gemma":[0.00048231287,0.00024918647,0.00066767586,0.00043443465,0.000019723922,0.0000052803916,0.000004166601,0.01502955,0.000029035831,0.8249857,0.15732253,0.0007704161],"about_ca_topic_score_codex":0.0002263078,"about_ca_topic_score_gemma":0.001113561,"teacher_disagreement_score":0.9382316,"about_ca_system_score_codex":0.00045124543,"about_ca_system_score_gemma":0.00027761786,"threshold_uncertainty_score":0.6714819},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010359399,0.00021886727,0.99145174,0.00024968325,0.0013682769,0.000372377,0.00001783639,0.0011353351,0.00517551],"genre_scores_gemma":[0.032067474,0.000012733695,0.96689075,0.00049743225,0.00029482073,0.000010871176,0.0000076458755,0.000032237735,0.00018603475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958601,0.000022591053,0.00054735725,0.0016631609,0.0010914203,0.00081536424],"domain_scores_gemma":[0.99743664,0.00014088466,0.00022221573,0.0017727421,0.0002313607,0.00019614534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006023415,0.000656284,0.00056555757,0.0005348185,0.00015037526,0.0004942946,0.0043321983,0.00045373596,0.000015979196],"category_scores_gemma":[0.000017220478,0.000655662,0.00016755362,0.0006788608,0.0011092697,0.00048914406,0.0015241446,0.00064424024,0.000036445123],"study_design_candidate":"design_other","study_design_consensus":null,"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.3089966e-7,0.000014708581,0.00008478211,0.000019342966,0.000005887859,0.0001432627,0.000040092687,0.040008787,0.000008811534,0.2219258,0.0001903824,0.73755723],"study_design_scores_gemma":[0.00026562996,0.00016099852,0.00033293196,0.00049433537,0.0000095758705,0.00030353345,7.768015e-9,0.577437,0.0003878485,0.39390567,0.025309727,0.0013927715],"about_ca_topic_score_codex":0.000049188395,"about_ca_topic_score_gemma":0.000045908248,"teacher_disagreement_score":0.73616445,"about_ca_system_score_codex":0.00067639333,"about_ca_system_score_gemma":0.00053628086,"threshold_uncertainty_score":0.99958944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2992155,0.00004336079,0.69965243,0.0008957659,0.000024834597,0.00013257771,2.8711096e-7,0.000022337086,0.0000128851125],"genre_scores_gemma":[0.59338456,0.000007843399,0.40640557,0.00017437436,0.000019822808,0.0000041278668,8.365616e-7,0.0000026388846,2.4256116e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929345,0.000009200005,0.00016110568,0.00024050065,0.0001291667,0.00016660437],"domain_scores_gemma":[0.9996059,0.00007079973,0.000052214677,0.00020327004,0.000029484601,0.00003832231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019980395,0.0000734672,0.00014515365,0.00017294998,0.000031815893,0.000015331,0.000101234604,0.000020772783,0.0000030489623],"category_scores_gemma":[0.00007304867,0.0000625798,0.000011166062,0.0004981192,0.00020592162,0.00009509931,0.00006977963,0.00010279006,8.19642e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011945463,0.00006870836,0.02964741,0.000050912946,5.535673e-7,0.0000044440294,0.0002733303,0.03324649,0.10754016,0.0014504609,0.0000014543147,0.82770413],"study_design_scores_gemma":[0.00031444398,0.00007204662,0.030899338,0.00011261758,0.000002418771,0.000020023155,3.9985284e-7,0.82276314,0.109449595,0.036291562,0.00001752382,0.00005690481],"about_ca_topic_score_codex":0.000022655597,"about_ca_topic_score_gemma":0.000006724789,"teacher_disagreement_score":0.8276472,"about_ca_system_score_codex":0.000049571325,"about_ca_system_score_gemma":0.000027992299,"threshold_uncertainty_score":0.25519302},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092857744,0.0003412278,0.9912631,0.0019426587,0.0009767904,0.0010048419,0.0000023780467,0.00013103214,0.0034093785],"genre_scores_gemma":[0.50679606,0.000056871115,0.49070013,0.0016974857,0.0004113461,0.00004439188,0.0000026098874,0.000042551525,0.0002485776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946772,0.000102193975,0.00089371915,0.0019061401,0.0015447114,0.00087604334],"domain_scores_gemma":[0.99495393,0.0017366525,0.00044529026,0.0024340164,0.00028365522,0.00014647799],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018836921,0.00066145463,0.00073536567,0.0007600762,0.00016757521,0.00034746944,0.0068451874,0.00034871313,0.000033022974],"category_scores_gemma":[0.00022325138,0.00047855088,0.00020191293,0.0012335158,0.0014431118,0.00037068976,0.002236755,0.0013381479,0.000044735327],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007383222,0.00013941989,0.00018491363,0.000026864152,0.0000067445644,0.000060005896,0.0010123989,0.0667784,0.000011892817,0.06967152,0.000010665585,0.8620898],"study_design_scores_gemma":[0.00025739922,0.0004073555,0.0010540764,0.0005314047,0.0000025285742,0.00003994716,4.0000543e-7,0.6749938,0.0001503411,0.32149938,0.00044738076,0.0006159511],"about_ca_topic_score_codex":0.00007323089,"about_ca_topic_score_gemma":0.00031656882,"teacher_disagreement_score":0.86147386,"about_ca_system_score_codex":0.00041616792,"about_ca_system_score_gemma":0.00060056004,"threshold_uncertainty_score":0.9997666},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26158616,0.004690754,0.72775024,0.00018615962,0.0009895577,0.0009936775,0.00003731802,0.00006188889,0.0037042138],"genre_scores_gemma":[0.99488395,0.00057843566,0.0036369793,0.00016160839,0.0002467862,0.0000049280316,0.0000189172,0.000024386323,0.0004439748],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99805397,0.00003167836,0.0003442367,0.00096297974,0.00027700767,0.00033013007],"domain_scores_gemma":[0.9991835,0.00004380747,0.0001754116,0.0004228545,0.00009419372,0.00008025454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041284665,0.00035349527,0.00036990986,0.00028024908,0.00009081331,0.000085875865,0.0003674967,0.00036167784,5.6260325e-7],"category_scores_gemma":[0.000034054297,0.00029294626,0.00005973125,0.00012181037,0.00024389001,0.000008881888,0.0002048155,0.0003359276,7.2187595e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030559074,0.00015656007,0.00044411162,0.0003242863,0.00008514984,0.00012370238,0.00032307976,0.01936226,0.15778697,0.0012440215,0.00002494643,0.81981933],"study_design_scores_gemma":[0.0015138452,0.002069972,0.00025534778,0.0050608753,0.00008379122,0.00013983874,0.000017362892,0.050559342,0.9323893,0.0037159289,0.0016330088,0.002561342],"about_ca_topic_score_codex":0.00001720613,"about_ca_topic_score_gemma":0.00023746857,"teacher_disagreement_score":0.817258,"about_ca_system_score_codex":0.00005604055,"about_ca_system_score_gemma":0.00007422763,"threshold_uncertainty_score":0.99995226},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008712804,0.0011841785,0.5415184,0.0016744166,0.0018243967,0.0006445442,0.000015239983,0.00020406907,0.44422197],"genre_scores_gemma":[0.974127,0.00006954523,0.012925541,0.00043734757,0.00097532326,0.0000051350817,0.00004081406,0.000027940821,0.01139135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982286,0.000064136446,0.00030508608,0.00036267602,0.0006033706,0.0004360961],"domain_scores_gemma":[0.99905765,0.00043168038,0.00011366614,0.000241601,0.00009952889,0.000055882825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010241074,0.0002138202,0.00025759274,0.0008255814,0.0006618031,0.0002686108,0.0009093811,0.00019979487,0.00014560194],"category_scores_gemma":[0.000063872874,0.00022718398,0.00006955165,0.00046898355,0.0012975724,0.00030668083,0.00043099347,0.0006738357,0.00002824919],"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.000012537736,0.00023398892,0.027935311,0.00010439045,0.000025633482,0.00011641343,0.18838318,0.03177458,0.000012388564,0.16845173,0.0005244149,0.5824254],"study_design_scores_gemma":[0.0010134679,0.00015196124,0.010891571,0.0031674802,0.000046369496,0.0000056291883,0.00060716266,0.59041214,0.000016404108,0.27758998,0.11362433,0.002473509],"about_ca_topic_score_codex":0.0023114837,"about_ca_topic_score_gemma":0.07325933,"teacher_disagreement_score":0.9654142,"about_ca_system_score_codex":0.0004397906,"about_ca_system_score_gemma":0.00028553832,"threshold_uncertainty_score":0.94365126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001026559,0.00010837722,0.9968,0.00074042316,0.00034090204,0.00032355616,0.000049821807,0.00011538299,0.0004949891],"genre_scores_gemma":[0.20806713,0.000106431595,0.789721,0.0012293042,0.00043474,0.0000446102,0.00012362802,0.00004564317,0.00022748916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967581,0.000023217306,0.00044253247,0.0014835973,0.0007458964,0.00054665946],"domain_scores_gemma":[0.99801654,0.00022008595,0.00020354093,0.0013457831,0.00007226447,0.00014176735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003363924,0.0004838995,0.00044693923,0.00065384933,0.00016724244,0.00039561998,0.0020617617,0.00012385006,0.000015575066],"category_scores_gemma":[0.000011371968,0.00037898688,0.000055552115,0.00046030688,0.0002150108,0.0007122986,0.00029762712,0.00058865023,0.000009809083],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034895036,0.00006608089,0.00020687754,0.000020094918,0.0000055675364,0.00007082086,0.00048667495,0.004559022,0.000055230834,0.0022640226,0.000012003917,0.9922501],"study_design_scores_gemma":[0.000934408,0.0006259112,0.0070771426,0.0024003503,0.000025711986,0.00021797618,0.000001909797,0.9690218,0.0022439782,0.0117501,0.00393091,0.0017698201],"about_ca_topic_score_codex":0.00012266527,"about_ca_topic_score_gemma":0.0007501058,"teacher_disagreement_score":0.9904803,"about_ca_system_score_codex":0.00025314197,"about_ca_system_score_gemma":0.00021575896,"threshold_uncertainty_score":0.9998662},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017276074,0.00014090205,0.9927886,0.0011863445,0.0011273683,0.0005952908,0.0000073339984,0.00027566598,0.0038612066],"genre_scores_gemma":[0.044043902,0.000035611214,0.9515912,0.0023143776,0.0009718925,0.000020457752,0.00007445359,0.00005625324,0.0008918742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632514,0.000044836754,0.0004987202,0.001638223,0.00075116777,0.00074189657],"domain_scores_gemma":[0.9965326,0.001491468,0.00040496883,0.0010413656,0.00036193308,0.00016763422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021915643,0.00045983927,0.00044772506,0.0008585204,0.00050947693,0.0006238346,0.0020032274,0.00033258606,0.000006154215],"category_scores_gemma":[0.00049033144,0.00044766458,0.0001380918,0.00047943374,0.00036177397,0.0005157169,0.0007401371,0.0013039331,0.000047438127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008352076,0.000009768413,0.000044743723,0.000026040727,0.0000070400506,0.000015504087,0.0003851201,0.037542485,0.00016645607,0.038460396,0.000013330796,0.9233208],"study_design_scores_gemma":[0.0003265039,0.0001859397,0.0003580311,0.00028889385,0.000010379231,0.000057493635,3.66515e-7,0.9162138,0.00066276354,0.030128011,0.051025122,0.0007426686],"about_ca_topic_score_codex":0.000021696278,"about_ca_topic_score_gemma":0.000046960613,"teacher_disagreement_score":0.9225781,"about_ca_system_score_codex":0.00029653538,"about_ca_system_score_gemma":0.00031630497,"threshold_uncertainty_score":0.9997975},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018933312,0.00082160404,0.9897588,0.0020859656,0.0020915281,0.00034714665,0.000004050715,0.00025443637,0.0044471165],"genre_scores_gemma":[0.10708516,0.00022028037,0.8880016,0.0034932278,0.00064020697,0.000013290773,0.0000083098685,0.00006508149,0.00047279944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579763,0.0000289968,0.0005052236,0.0017072543,0.0011200581,0.0008408298],"domain_scores_gemma":[0.9974317,0.00020686517,0.00024255968,0.0016679427,0.00018163555,0.00026928927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054164365,0.0006144419,0.00058368704,0.001083841,0.00032541653,0.0005121065,0.003640715,0.0003901348,0.00005602191],"category_scores_gemma":[0.000037160335,0.00053863943,0.0002932964,0.0010809287,0.0012269067,0.00050441234,0.0011317241,0.00085433794,0.00006212667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010807575,0.00007666055,0.0000752563,0.00007773924,0.00005500162,0.0006546742,0.0027466808,0.07765207,0.0003142177,0.33820054,0.000064537075,0.5800718],"study_design_scores_gemma":[0.001115684,0.00020925116,0.000293557,0.00064288446,0.000028175325,0.00027011332,4.761348e-7,0.11287934,0.0023295423,0.8768964,0.0036469474,0.0016876279],"about_ca_topic_score_codex":0.000112936905,"about_ca_topic_score_gemma":0.00009768311,"teacher_disagreement_score":0.5783842,"about_ca_system_score_codex":0.00027846792,"about_ca_system_score_gemma":0.00067573524,"threshold_uncertainty_score":0.9997065},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000075973,0.00095428206,0.97632104,0.0012687232,0.010544207,0.0002943913,0.0000011099416,0.00016373931,0.010444895],"genre_scores_gemma":[0.75307935,0.0020738882,0.19390427,0.009017793,0.008342589,0.000068149544,0.000007519616,0.00019874309,0.03330767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645716,0.00005602561,0.0005867941,0.001213163,0.0009546951,0.0007321725],"domain_scores_gemma":[0.9968627,0.0007105004,0.00028789777,0.0017129034,0.0002795082,0.00014646209],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009979405,0.00044708134,0.0004150192,0.00034032413,0.0009925637,0.0008922415,0.004411725,0.00029041836,0.000011265298],"category_scores_gemma":[0.000059045746,0.0003082607,0.00019723008,0.00049412024,0.00078554486,0.00042015465,0.0010352533,0.00090634404,0.00012111944],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005733261,0.000011031857,0.000013649264,0.000010919693,0.000017382023,0.00009160926,0.0013225946,0.048788656,0.000015740643,0.05486147,0.0018026254,0.8930586],"study_design_scores_gemma":[0.0002344818,0.00018488613,0.0000591511,0.00030561324,0.0000041363796,0.000531738,4.013558e-7,0.82801276,0.00022329335,0.051122982,0.118559904,0.0007606726],"about_ca_topic_score_codex":0.000032134154,"about_ca_topic_score_gemma":0.0002218983,"teacher_disagreement_score":0.8922979,"about_ca_system_score_codex":0.00026029858,"about_ca_system_score_gemma":0.0003903977,"threshold_uncertainty_score":0.99993694},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048448876,0.0016717169,0.9875384,0.000106548636,0.0009993877,0.0003597224,0.000007882417,0.00038652538,0.004084912],"genre_scores_gemma":[0.9211274,0.00037116325,0.07779398,0.0001979677,0.00029780567,0.000030984942,0.000017420762,0.000066322114,0.000096987795],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981302,0.000013021328,0.00030463934,0.00052234234,0.0004553702,0.00057440065],"domain_scores_gemma":[0.9984707,0.00014376978,0.00012578076,0.0011178186,0.00008046506,0.000061428706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001459296,0.00042474936,0.00038007245,0.00023629377,0.00015459159,0.00006104182,0.0012956596,0.0002885612,0.000057753383],"category_scores_gemma":[0.000023554257,0.0004349981,0.00006236475,0.0002538089,0.00049745844,0.00054855936,0.0006228828,0.0009928667,0.000107448264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062278714,0.00007077309,0.0001706836,0.00012653362,0.00008491736,0.00001828171,0.0021282092,0.1263872,0.005539874,0.015389288,0.000043219658,0.8500348],"study_design_scores_gemma":[0.0012041158,0.0001987243,0.0004901996,0.001787252,0.00008560528,0.00005164044,0.0000017281963,0.3502952,0.17679293,0.42906213,0.037207946,0.0028225386],"about_ca_topic_score_codex":0.00000682192,"about_ca_topic_score_gemma":0.00002011851,"teacher_disagreement_score":0.9162825,"about_ca_system_score_codex":0.0005220523,"about_ca_system_score_gemma":0.000037010846,"threshold_uncertainty_score":0.99981016},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046135642,0.00083254714,0.96716195,0.0005048257,0.0016324527,0.00045046935,0.000003017069,0.00008108563,0.02887232],"genre_scores_gemma":[0.9064844,0.000082321894,0.090723716,0.0011708309,0.00052042364,0.000014623625,0.0000047079093,0.000033996956,0.0009649726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958908,0.00013976768,0.0006660858,0.0013371718,0.0012322876,0.00073387864],"domain_scores_gemma":[0.9959724,0.0017311429,0.00033527744,0.0016054219,0.00026324645,0.00009251343],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019380663,0.0005056068,0.0006347883,0.0006530524,0.00017177667,0.00037338812,0.005890614,0.0003164694,0.0000102872555],"category_scores_gemma":[0.00029994856,0.00035217643,0.00018522843,0.0009754241,0.0013435959,0.00047681772,0.0010394683,0.0008944726,0.000022723458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003618594,0.0004952717,0.00485703,0.00036354462,0.00004013212,0.00083476934,0.016295852,0.07773813,0.00047639117,0.24914712,0.0023028143,0.6474128],"study_design_scores_gemma":[0.00053793937,0.00054165535,0.0043325145,0.0012125749,0.000020940992,0.000178708,0.0000024731935,0.6122341,0.0017859956,0.37556034,0.0023225045,0.0012702122],"about_ca_topic_score_codex":0.00014756345,"about_ca_topic_score_gemma":0.0003290957,"teacher_disagreement_score":0.906023,"about_ca_system_score_codex":0.000142,"about_ca_system_score_gemma":0.0005892723,"threshold_uncertainty_score":0.999893},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001213653,0.00006700871,0.992488,0.0014150542,0.0019516725,0.0005886238,0.0000076675105,0.000265502,0.0030950746],"genre_scores_gemma":[0.014991584,0.000014915112,0.97763985,0.0038488032,0.0012083148,0.000007968432,0.000026930522,0.000045717097,0.0022159303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562323,0.000024445546,0.00052933226,0.0018371374,0.0012417991,0.0007440688],"domain_scores_gemma":[0.99746907,0.0001857317,0.00026203375,0.0016440906,0.00021485548,0.00022419532],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010653673,0.0005074333,0.00043222372,0.0008288978,0.00026143226,0.0013575396,0.0042061894,0.00021049885,0.000011127604],"category_scores_gemma":[0.00010031973,0.0004876271,0.0001119579,0.0009885756,0.00017935097,0.0016545224,0.0019682848,0.0006224623,0.00013571995],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047714043,0.00001378395,0.0000035226178,0.000015497537,0.00000524835,0.00006981157,0.00025594735,0.0018790052,0.00034850667,0.012200998,0.000056708082,0.9851462],"study_design_scores_gemma":[0.0010414519,0.0010700353,0.00026720538,0.0014369907,0.000027988985,0.00004344388,5.6344e-7,0.6496733,0.015938587,0.30046067,0.027313033,0.0027267197],"about_ca_topic_score_codex":0.000015020369,"about_ca_topic_score_gemma":0.0000101931955,"teacher_disagreement_score":0.9824195,"about_ca_system_score_codex":0.00028369846,"about_ca_system_score_gemma":0.0002016825,"threshold_uncertainty_score":0.9997575},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011288905,0.00034548342,0.9923903,0.0004501237,0.0032595904,0.0012483882,0.000008131572,0.00023609676,0.0019490466],"genre_scores_gemma":[0.15690629,0.00059628097,0.83716846,0.00304958,0.0013673684,0.00017584988,0.000017370592,0.000082557104,0.000636228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963918,0.000044380216,0.0005241601,0.00155779,0.00088461355,0.00059726665],"domain_scores_gemma":[0.99767214,0.00032263805,0.0003570319,0.001052447,0.00044629633,0.00014945737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064321194,0.0005195552,0.00045761792,0.0011050212,0.0007446592,0.0003921495,0.001798307,0.00039300878,0.000017147231],"category_scores_gemma":[0.00004783637,0.0005025988,0.00016540554,0.0011859807,0.00046905235,0.0005851533,0.0006715463,0.00057994144,0.000028224487],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005191848,0.00003758287,0.0000021186343,0.000056941233,0.000013484747,0.000040061725,0.00039399054,0.019829301,0.00018979289,0.0044708904,0.000097877644,0.974816],"study_design_scores_gemma":[0.0008339523,0.00077660364,0.000048068443,0.0003519675,0.000015116353,0.00004041489,3.5473823e-7,0.9079259,0.0148953805,0.02758077,0.04671561,0.0008158468],"about_ca_topic_score_codex":0.000009430556,"about_ca_topic_score_gemma":0.00010515642,"teacher_disagreement_score":0.9740002,"about_ca_system_score_codex":0.00051223475,"about_ca_system_score_gemma":0.0003140221,"threshold_uncertainty_score":0.99974257},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008846473,0.00039554635,0.99179786,0.0002059705,0.0023789569,0.0014707529,0.0000059444174,0.00026806595,0.0033884295],"genre_scores_gemma":[0.37802273,0.000025424786,0.61896104,0.001647867,0.00014355802,0.00011906039,0.0000073389638,0.000080652484,0.000992368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939002,0.00014064534,0.0011034587,0.0023916415,0.0014894395,0.0009746461],"domain_scores_gemma":[0.99665326,0.00032480335,0.00053118396,0.0019538228,0.0002849198,0.0002520354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018195091,0.0007962321,0.00090444833,0.0022542104,0.00021138703,0.0008080378,0.0030484898,0.00039515324,0.000016206011],"category_scores_gemma":[0.000020410356,0.0008026302,0.00023748653,0.0011907155,0.00026137673,0.00075152854,0.00087594584,0.00086997024,0.000121897705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014888934,0.00021931707,0.00024985004,0.00054225954,0.000045856206,0.0015407301,0.0006166548,0.53464746,0.00003116268,0.011837695,0.000047722744,0.45020643],"study_design_scores_gemma":[0.0008541935,0.00006832959,0.000036651683,0.0018432018,0.000012616615,0.00009960378,0.0000010052117,0.9896067,0.0003412485,0.0021148063,0.004119912,0.00090178044],"about_ca_topic_score_codex":0.00008944074,"about_ca_topic_score_gemma":0.0001326836,"teacher_disagreement_score":0.4549592,"about_ca_system_score_codex":0.0013848803,"about_ca_system_score_gemma":0.00040856662,"threshold_uncertainty_score":0.99944246},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004821344,0.0011770001,0.9880216,0.0020850408,0.00075236126,0.0003060735,0.00000871521,0.00030253778,0.0072984514],"genre_scores_gemma":[0.12001615,0.0000956175,0.87231636,0.0038623267,0.0016188907,0.000008118708,0.000024686002,0.00006991492,0.001987927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99496806,0.00009640264,0.00061517337,0.0018876327,0.0014003725,0.0010323494],"domain_scores_gemma":[0.9963658,0.0011579334,0.00019524174,0.0016947387,0.0002453519,0.00034096223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016947807,0.00059505727,0.00061926595,0.0010341496,0.0004351789,0.00080322963,0.004264054,0.00041530747,0.00006983366],"category_scores_gemma":[0.00015855354,0.0005478348,0.0001578104,0.0008483289,0.0006760287,0.0004638259,0.001548192,0.0020065587,0.00021246466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009116437,0.00002751954,0.00013185649,0.00007920182,0.000013215045,0.00030081806,0.0008507008,0.05179304,0.00005174849,0.032731257,0.00019396143,0.9138176],"study_design_scores_gemma":[0.00029109028,0.00024477387,0.00016549145,0.0011020338,0.000009923241,0.00019240228,6.113196e-8,0.9079548,0.0002658668,0.07848591,0.010297167,0.0009904444],"about_ca_topic_score_codex":0.000019944931,"about_ca_topic_score_gemma":0.00001227114,"teacher_disagreement_score":0.91282713,"about_ca_system_score_codex":0.00030509062,"about_ca_system_score_gemma":0.0008208828,"threshold_uncertainty_score":0.9996973},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045565576,0.0002289532,0.9890228,0.000025394218,0.0012450864,0.00019974564,0.0000023353211,0.0014573778,0.0032617433],"genre_scores_gemma":[0.7526062,0.00006117732,0.24677783,0.00021611218,0.00026526983,0.0000032738164,0.000004257756,0.000039857423,0.000026009222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998351,0.000009847881,0.0003126946,0.0005130667,0.00048701462,0.00032640758],"domain_scores_gemma":[0.9991954,0.00011535688,0.00006511035,0.0004906851,0.000047504407,0.000085949716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004021878,0.0003130423,0.00030215387,0.0005188905,0.00012302853,0.0001746583,0.0006857477,0.00021532869,0.000009336277],"category_scores_gemma":[0.000024815214,0.00031202077,0.0000841406,0.00015853473,0.00016055646,0.00017673979,0.00030746846,0.00035835162,0.000013217524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026576597,0.000003821354,0.00007256286,0.00002652121,0.000006036296,0.000015912878,0.00010302443,0.1402244,0.00017090507,0.00048578254,0.00019020152,0.8586982],"study_design_scores_gemma":[0.00015311771,0.00003226184,0.00078646647,0.00045708465,0.000014777373,0.000014683503,1.636831e-7,0.98393756,0.0007520658,0.01012349,0.0033415048,0.00038681034],"about_ca_topic_score_codex":0.000008546352,"about_ca_topic_score_gemma":0.00006262753,"teacher_disagreement_score":0.85831136,"about_ca_system_score_codex":0.00022530739,"about_ca_system_score_gemma":0.000031082684,"threshold_uncertainty_score":0.9999332},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05567679,0.00052794174,0.941363,0.0000075754065,0.0002854898,0.0004319122,0.000021945036,0.00001227761,0.0016730943],"genre_scores_gemma":[0.8651132,0.000010918428,0.13450183,0.000082164624,0.00019553631,0.000004381962,0.000012952477,0.000033670934,0.00004537161],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800074,0.000019965291,0.00037048315,0.00082386425,0.00038233018,0.00040259128],"domain_scores_gemma":[0.99880403,0.000016345928,0.00026159955,0.0006676053,0.00016096047,0.000089461595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003253645,0.00036641577,0.00037798024,0.00022116075,0.000098912984,0.000035642894,0.0007030343,0.0004346243,0.000007323807],"category_scores_gemma":[0.000021554459,0.0003353297,0.00015091745,0.0001186994,0.00045715706,0.000006605543,0.00048486562,0.00028697576,9.86773e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004716682,0.000025419902,0.0000083063605,0.00007843928,0.000029502258,0.000018254665,0.00035082916,0.45541522,0.4772149,0.008004069,0.000001148483,0.058806736],"study_design_scores_gemma":[0.00032960452,0.00039748257,0.0000059957993,0.00032641116,0.000028526372,0.000045900048,4.5256084e-7,0.48071486,0.421822,0.095653646,0.000052219155,0.0006228959],"about_ca_topic_score_codex":0.000027417727,"about_ca_topic_score_gemma":0.00002208432,"teacher_disagreement_score":0.8094364,"about_ca_system_score_codex":0.00006337857,"about_ca_system_score_gemma":0.00038843363,"threshold_uncertainty_score":0.9999099},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39650396,0.0011090748,0.5998612,0.0009877821,0.0009912312,0.00040759676,0.0000023237594,0.00012375313,0.000013068622],"genre_scores_gemma":[0.7215967,0.0001442557,0.27762303,0.0004616871,0.00011604093,0.000045163175,0.000001762372,0.00001040452,9.657242e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601173,0.00022864697,0.0005732523,0.0018002602,0.0006520484,0.00073403586],"domain_scores_gemma":[0.9976708,0.0007694998,0.00027226674,0.0009893104,0.00009750441,0.00020056035],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016175094,0.0005016444,0.00060650124,0.00081808347,0.00015828792,0.0016108435,0.002341794,0.00027416536,0.0000064771075],"category_scores_gemma":[0.00022908341,0.00038307824,0.00005428893,0.001395519,0.0009100753,0.000921573,0.004581937,0.0010518999,0.0000055154906],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002553947,0.00005277682,0.0021231677,0.00013290333,0.0000058044957,0.00004064589,0.008603122,0.0042908317,0.00014605942,0.00068250595,0.0000038026947,0.9839158],"study_design_scores_gemma":[0.00023574363,0.00011556705,0.019080516,0.0010024776,0.000003729142,0.000051807096,0.000005235683,0.89679897,0.00062134233,0.0816107,0.0000076478755,0.00046626673],"about_ca_topic_score_codex":0.00030692705,"about_ca_topic_score_gemma":0.000123639,"teacher_disagreement_score":0.9834496,"about_ca_system_score_codex":0.00020919387,"about_ca_system_score_gemma":0.00044052323,"threshold_uncertainty_score":0.99986213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010202341,0.0012282729,0.9890595,0.00030460747,0.0041616163,0.00029942006,0.0000022628335,0.00028097053,0.004561327],"genre_scores_gemma":[0.81728196,0.000055413788,0.17761534,0.002880368,0.0013018145,0.000011368779,0.000007763357,0.00006419587,0.00078176387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958875,0.00003251668,0.0006122206,0.0015335752,0.001217105,0.00071709324],"domain_scores_gemma":[0.9978626,0.00025874816,0.00043190373,0.00097196765,0.0002752522,0.00019953462],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011928028,0.0005221578,0.00050970487,0.00083161675,0.00041329718,0.0011824502,0.0024469935,0.00047585665,0.000011585544],"category_scores_gemma":[0.000061955834,0.00046853474,0.00011049609,0.0008025823,0.0004695321,0.0007408711,0.0009979,0.0008668656,0.000049102455],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004455204,0.000015742018,0.000008256314,0.000079078694,0.000006252176,0.0000539391,0.0003855841,0.002644433,0.000868993,0.0026126117,0.00004957184,0.9932711],"study_design_scores_gemma":[0.00058693875,0.00031886433,0.00009848454,0.0013932651,0.000019961439,0.0006226481,7.319752e-7,0.87651634,0.009263032,0.09596761,0.013344388,0.0018677366],"about_ca_topic_score_codex":0.00004431767,"about_ca_topic_score_gemma":0.000036276997,"teacher_disagreement_score":0.99140334,"about_ca_system_score_codex":0.00051932613,"about_ca_system_score_gemma":0.00031497463,"threshold_uncertainty_score":0.99985445},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007364261,0.0011740478,0.983613,0.008306205,0.00305113,0.0012929378,0.000043563265,0.0007774422,0.0010052096],"genre_scores_gemma":[0.55841476,0.00008770584,0.4303621,0.009461595,0.0009816943,0.00003567096,0.000016250882,0.000099802324,0.00054042233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99104404,0.00008078049,0.0010036285,0.0030838065,0.0029502988,0.0018374285],"domain_scores_gemma":[0.9940258,0.0008678404,0.0004559078,0.0029629539,0.00094173907,0.00074570917],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0012439964,0.0013665985,0.0014357468,0.0017684303,0.0006634001,0.0012992112,0.0070136497,0.0010216454,0.000019096535],"category_scores_gemma":[0.00058497605,0.0012520452,0.00018971456,0.0015642549,0.001378103,0.0007260232,0.0043400656,0.0021693215,0.00003150233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054052227,0.000020868772,0.00052977103,0.000029135383,0.000067097615,0.00043042263,0.0013901241,0.36699986,0.0001398895,0.0061138743,0.011037118,0.6131878],"study_design_scores_gemma":[0.0024226157,0.0012535376,0.017638661,0.0007685911,0.000055144727,0.0014406585,0.0000010730797,0.7327255,0.0006138342,0.14589128,0.09289508,0.0042940034],"about_ca_topic_score_codex":0.00007094977,"about_ca_topic_score_gemma":0.00034984187,"teacher_disagreement_score":0.60889375,"about_ca_system_score_codex":0.000488917,"about_ca_system_score_gemma":0.00048310176,"threshold_uncertainty_score":0.9999085},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012238368,0.0033403733,0.9808724,0.000018216702,0.001858804,0.00048584305,0.000009840596,0.00005031131,0.0011258714],"genre_scores_gemma":[0.997509,0.000033719403,0.0021713614,0.000019047251,0.00016840025,0.0000072812045,0.0000010283277,0.000019871595,0.00007027747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986047,0.000023066517,0.00043974406,0.00035742964,0.0002743899,0.0003006401],"domain_scores_gemma":[0.9986419,0.0004474863,0.000120368066,0.0004960915,0.0002126292,0.000081506856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004877078,0.00023796357,0.00043363415,0.0001584042,0.00009475841,0.000050420018,0.0005955153,0.00013932769,0.0000026631594],"category_scores_gemma":[0.000043709977,0.00018090074,0.00005301468,0.00019638316,0.0007111994,0.000049149236,0.00028902906,0.00021510325,4.8598224e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014981106,0.00001124261,0.0001630094,0.00026653486,0.000026513306,0.000007427598,0.004504691,0.4196505,0.00033805208,0.009128981,0.000048100155,0.56583995],"study_design_scores_gemma":[0.0007025912,0.00082246534,0.0010517564,0.002074457,0.00004888553,0.00008626655,0.000042569216,0.9184198,0.029786408,0.027698176,0.017725283,0.001541353],"about_ca_topic_score_codex":0.00022678987,"about_ca_topic_score_gemma":0.00007996457,"teacher_disagreement_score":0.9852706,"about_ca_system_score_codex":0.000094637784,"about_ca_system_score_gemma":0.000095303,"threshold_uncertainty_score":0.7376918},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000112337795,0.0005837368,0.99471265,0.0005743423,0.002243794,0.00094348786,0.000014632284,0.0004067726,0.00040827267],"genre_scores_gemma":[0.92340165,0.000059012604,0.07262296,0.0026958396,0.0008214741,0.000081047976,0.000098215336,0.00006341509,0.00015639472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588615,0.000054425193,0.0007073222,0.0016709819,0.0007631298,0.0009180011],"domain_scores_gemma":[0.9972155,0.0008552771,0.00035441437,0.001036841,0.00028037588,0.00025760356],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067431235,0.000692415,0.00073859654,0.00069590786,0.00043310912,0.00080984866,0.0028058467,0.00046671706,0.000065066844],"category_scores_gemma":[0.000015372654,0.0006477825,0.00031667293,0.00056563265,0.00036305617,0.00043702914,0.0002448118,0.0006605627,0.000021666481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015697162,0.000019105068,0.000002982769,0.000021962498,0.00002032914,0.000009483555,0.00006640273,0.519168,0.000002747018,0.0032488892,0.000020128398,0.47740424],"study_design_scores_gemma":[0.00069731136,0.00017217839,0.00001729197,0.00045727956,0.000037640293,0.0000114342165,1.6300271e-7,0.98115504,0.000055593897,0.013239256,0.0034628748,0.00069394085],"about_ca_topic_score_codex":0.0000053614385,"about_ca_topic_score_gemma":0.00006569536,"teacher_disagreement_score":0.9232893,"about_ca_system_score_codex":0.00023195599,"about_ca_system_score_gemma":0.0003469805,"threshold_uncertainty_score":0.9995974},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4014992,0.0017268015,0.5946248,0.00010278069,0.0017064399,0.00024223998,0.000024057634,0.0000073519486,0.00006633564],"genre_scores_gemma":[0.91186714,0.00011448339,0.0866707,0.00051902776,0.0007518228,0.000029324086,0.000020358395,0.000023802224,0.0000033429428],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99745077,0.000058223537,0.0003341459,0.0013106802,0.00026825658,0.000577939],"domain_scores_gemma":[0.9985132,0.000025227684,0.00015651657,0.0010223609,0.00016676917,0.000115927505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040964002,0.00041085144,0.00036846095,0.00015665793,0.00016124919,0.000102674494,0.0012951833,0.00032445235,0.0000064343253],"category_scores_gemma":[0.0000448491,0.0003731854,0.00014606072,0.00024185191,0.00055072614,0.0000012562009,0.0021841475,0.0003953343,0.000007968707],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054574954,0.00024183563,0.007544281,0.00011522313,0.00013198837,0.00003752558,0.0030806307,0.24867891,0.31931615,0.00003555091,0.00008519652,0.42067814],"study_design_scores_gemma":[0.0018468332,0.0017796581,0.08475352,0.00039487088,0.00009889461,0.000164341,0.00001805794,0.2591809,0.6016811,0.04353329,0.0024345026,0.004114016],"about_ca_topic_score_codex":0.00013650356,"about_ca_topic_score_gemma":0.00017125778,"teacher_disagreement_score":0.51036793,"about_ca_system_score_codex":0.000039211336,"about_ca_system_score_gemma":0.00034153849,"threshold_uncertainty_score":0.999872},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000839492,0.0012165712,0.97371715,0.00059443474,0.001039195,0.000404125,0.0000073194465,0.00018107172,0.022756174],"genre_scores_gemma":[0.43400854,0.00009381709,0.5593504,0.004307638,0.0011129628,0.0000071068994,0.000022404098,0.00005973358,0.0010374453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99616325,0.000040928186,0.000481494,0.0015624939,0.00092940434,0.00082240696],"domain_scores_gemma":[0.9976746,0.0005483724,0.00026070382,0.0009217509,0.00029315084,0.0003014626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009912195,0.00058729254,0.00061612966,0.00078170316,0.0004104411,0.00065987743,0.0023234768,0.0003209435,0.000032716514],"category_scores_gemma":[0.00007636627,0.00048537014,0.0001319174,0.00051029195,0.0012870607,0.00047981014,0.0009988372,0.000821087,0.00008514262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017899567,0.00009895541,0.0004234769,0.000113218,0.000033557368,0.0006200865,0.0011904724,0.002295379,0.00026392462,0.59666884,0.00010854858,0.39816564],"study_design_scores_gemma":[0.00063025684,0.00051305676,0.0022615297,0.00051807915,0.000019402918,0.0011109107,2.2534331e-7,0.38352054,0.00023640312,0.6051318,0.004758966,0.0012988147],"about_ca_topic_score_codex":0.000025265184,"about_ca_topic_score_gemma":0.00010614563,"teacher_disagreement_score":0.4339246,"about_ca_system_score_codex":0.00028257346,"about_ca_system_score_gemma":0.00044342538,"threshold_uncertainty_score":0.9997598},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003091456,0.0016124974,0.98249847,0.0031700612,0.0018011491,0.00038464504,0.0000019047382,0.0009378433,0.009562503],"genre_scores_gemma":[0.5790547,0.000602032,0.41349414,0.0010000055,0.0009319317,0.000057305493,0.0000258048,0.00007549259,0.0047585517],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99614084,0.00004642074,0.0005589192,0.0015398695,0.0009023547,0.000811617],"domain_scores_gemma":[0.9970066,0.00025315868,0.0005215238,0.0017821378,0.00026096334,0.00017564514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009420179,0.0005792047,0.00048308674,0.0010785507,0.0003914402,0.000755812,0.0040070247,0.00065301993,0.00004119075],"category_scores_gemma":[0.00018257405,0.0005107291,0.00015674878,0.0007588633,0.0007298153,0.0012642454,0.0014426827,0.0015546898,0.00011812434],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029554412,0.000020806188,0.00007185318,0.000017540051,0.0000076240103,0.0000050377926,0.0003010078,0.00016063801,0.0011528276,0.089100696,0.000057977624,0.909101],"study_design_scores_gemma":[0.0010680621,0.0005614403,0.010692816,0.0006316233,0.000051736526,0.00018574856,0.0000039238553,0.4014447,0.027187696,0.43870088,0.11560558,0.0038658006],"about_ca_topic_score_codex":0.000018227927,"about_ca_topic_score_gemma":0.000019565947,"teacher_disagreement_score":0.90523523,"about_ca_system_score_codex":0.0004812475,"about_ca_system_score_gemma":0.0004920245,"threshold_uncertainty_score":0.9997344},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056640096,0.0005090868,0.98572206,0.0042866454,0.0020510885,0.00040435878,0.000011056126,0.0010719821,0.005887069],"genre_scores_gemma":[0.09804868,0.00012055543,0.9008622,0.00059350114,0.00020120277,0.000012596818,0.000008781566,0.00004531074,0.000107149004],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99509287,0.000036812773,0.00067919877,0.0022357425,0.0010151404,0.0009402607],"domain_scores_gemma":[0.98372173,0.00056541763,0.00041767373,0.014883219,0.00024968886,0.0001622437],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0010775848,0.0006438386,0.000575962,0.0014309674,0.00041408057,0.00066654687,0.06481971,0.0005702685,0.000053558688],"category_scores_gemma":[0.005426999,0.0006161003,0.00014785425,0.0010591083,0.0010322662,0.0015197411,0.12067981,0.0014508213,0.00018973534],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031103418,0.000037656373,0.00031925403,0.000041568466,0.00001850791,0.000112514776,0.00036349214,0.00037912815,0.00013687738,0.06187825,0.0010401696,0.9356695],"study_design_scores_gemma":[0.0001226273,0.00007260567,0.00029588543,0.00033586426,0.000006204211,0.000057879653,5.0975473e-8,0.2215109,0.0011151372,0.7730552,0.0027780456,0.0006495758],"about_ca_topic_score_codex":0.000041886986,"about_ca_topic_score_gemma":0.000061420316,"teacher_disagreement_score":0.9350199,"about_ca_system_score_codex":0.00036807804,"about_ca_system_score_gemma":0.0005770627,"threshold_uncertainty_score":0.999629},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003464587,0.00021575362,0.99449575,0.00033013753,0.0033435822,0.00058375765,0.000010711682,0.00014087577,0.0008448062],"genre_scores_gemma":[0.03888672,0.00002022233,0.957866,0.0010486138,0.00139714,0.000040490537,0.00002477636,0.000035035806,0.00068099145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699026,0.000024612471,0.00049919373,0.0013673631,0.0005504841,0.000568074],"domain_scores_gemma":[0.9980431,0.00038259217,0.0002847306,0.00078965677,0.00034108013,0.00015883935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095410703,0.00042591683,0.00039630392,0.0006227555,0.0003247219,0.00045984675,0.0019883486,0.00025132947,0.000018261308],"category_scores_gemma":[0.0000680984,0.00040851027,0.00016811186,0.00040932203,0.00022588237,0.00067315146,0.00072005857,0.00042185746,0.000020633033],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009131659,0.000027378135,0.0000026862397,0.000028880197,0.000012792216,0.00001038804,0.00066839205,0.026792036,0.00031318268,0.06254546,0.000023595363,0.90956604],"study_design_scores_gemma":[0.00024047386,0.00017459874,0.000018586663,0.000071700175,0.0000064662386,0.000025582412,4.3858268e-8,0.64446723,0.0029449519,0.34925124,0.0023723624,0.00042676574],"about_ca_topic_score_codex":0.000023772303,"about_ca_topic_score_gemma":0.000026194915,"teacher_disagreement_score":0.90913934,"about_ca_system_score_codex":0.00016125194,"about_ca_system_score_gemma":0.0005536172,"threshold_uncertainty_score":0.9998367},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021907917,0.00018912107,0.99541855,0.00027851138,0.0012571296,0.00049058074,0.0000043456034,0.00012361075,0.0022162623],"genre_scores_gemma":[0.013139169,0.000026008996,0.9855034,0.000701624,0.00036610736,0.000014505635,0.0000046523264,0.000033536526,0.00021104015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965658,0.000047648857,0.00048625795,0.0012291468,0.001037543,0.00063359697],"domain_scores_gemma":[0.9968506,0.0006379689,0.00037531398,0.0016470836,0.0003371007,0.0001519037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008393694,0.0005000408,0.0005242057,0.0006582404,0.00042870487,0.00038419524,0.0034226563,0.00030990882,0.000025493831],"category_scores_gemma":[0.000044881413,0.00040631893,0.00011091925,0.0011531336,0.0013189274,0.00034884168,0.0007293565,0.00097483094,0.000009348316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007707898,0.00004523413,0.000021494017,0.000026870546,0.000016600308,0.000024211708,0.00032242096,0.5901599,0.00007191351,0.24691017,0.000032282715,0.16236117],"study_design_scores_gemma":[0.00020807133,0.00050874363,0.00005043828,0.00045060477,0.00000818107,0.000048397094,2.5808758e-8,0.42421973,0.00073614897,0.5724913,0.00080052525,0.0004778815],"about_ca_topic_score_codex":0.000020994827,"about_ca_topic_score_gemma":0.00021873033,"teacher_disagreement_score":0.32558107,"about_ca_system_score_codex":0.000086606546,"about_ca_system_score_gemma":0.0006358525,"threshold_uncertainty_score":0.9998389},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005428479,0.000889769,0.98065996,0.0002558727,0.0003765345,0.000985958,0.000010360421,0.000024223247,0.016254496],"genre_scores_gemma":[0.20759311,0.000009003475,0.7911558,0.001093801,0.00005535796,0.000052570664,0.0000037261243,0.000016769238,0.000019830444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968558,0.000053259377,0.0007130999,0.0011350771,0.0007618556,0.00048092942],"domain_scores_gemma":[0.997972,0.00026161622,0.00018169776,0.0010587473,0.00038751707,0.00013840338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081249845,0.00043959505,0.000750357,0.00065821,0.00015866106,0.0001219055,0.0028285985,0.000156954,0.000004165373],"category_scores_gemma":[0.000059708418,0.00029947114,0.000071619346,0.0012971063,0.00028845025,0.0001084278,0.0012839572,0.00033915276,0.0000072907596],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000727423,0.00012496281,0.000046533693,0.00011433425,0.000015686841,0.000008521478,0.06912343,0.025848271,0.00013428985,0.029011253,0.0001261059,0.87537384],"study_design_scores_gemma":[0.0098344395,0.013745903,0.004946599,0.010720363,0.000084398846,0.00024421417,0.0004783839,0.4154816,0.19019875,0.056565274,0.28269255,0.015007531],"about_ca_topic_score_codex":0.000011692218,"about_ca_topic_score_gemma":0.0005084972,"teacher_disagreement_score":0.86036634,"about_ca_system_score_codex":0.00033421133,"about_ca_system_score_gemma":0.000981405,"threshold_uncertainty_score":0.99994576},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004074334,0.000059932187,0.99343604,0.00022122244,0.0011752732,0.00020871902,0.00002825032,0.00006156465,0.00073468173],"genre_scores_gemma":[0.7580864,0.000029036848,0.24134131,0.0002865774,0.00016087604,0.0000053667486,0.000026863298,0.000014590862,0.000048974383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678904,0.000024744813,0.0006285519,0.0010967175,0.0009999605,0.0004609661],"domain_scores_gemma":[0.9974108,0.00030956164,0.00037803873,0.0014683391,0.0003002044,0.00013309068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041899388,0.0003731128,0.0006756866,0.002601819,0.000214153,0.00031523977,0.0028313156,0.00027914456,0.00020640668],"category_scores_gemma":[0.000035903875,0.00033381797,0.00037051114,0.0021529645,0.0007314592,0.0003150429,0.0010211841,0.00071805046,0.000005333057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000086804675,0.00015916451,0.0011509294,0.000050044076,0.00041785013,0.000040340143,0.0032367534,0.0068654157,0.003114135,0.19564947,0.000013137351,0.78929406],"study_design_scores_gemma":[0.00053539686,0.00021733998,0.004983193,0.00009984154,0.0003280751,0.000016120071,5.083845e-7,0.80733055,0.005612831,0.17806001,0.001765116,0.0010510528],"about_ca_topic_score_codex":0.000094113464,"about_ca_topic_score_gemma":0.0010295685,"teacher_disagreement_score":0.8004651,"about_ca_system_score_codex":0.00006137871,"about_ca_system_score_gemma":0.00025154062,"threshold_uncertainty_score":0.99991137},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018130282,0.0002800256,0.9914012,0.00032483018,0.004481525,0.00027469918,0.0000013220092,0.00017986161,0.0012435383],"genre_scores_gemma":[0.42930144,0.00002754133,0.5690021,0.0007676353,0.00074652716,0.0000038973576,9.8915e-7,0.000029127588,0.00012076845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967691,0.000087834065,0.0004700116,0.0012968584,0.0007604809,0.00061574386],"domain_scores_gemma":[0.99730456,0.0007088061,0.0002598895,0.0013526671,0.00021922118,0.00015486524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017581198,0.00044730143,0.0005382801,0.0006424424,0.00043014376,0.0005553828,0.0021299345,0.0005792738,0.000018976532],"category_scores_gemma":[0.00013844286,0.0003991987,0.00017141063,0.0005515765,0.00041191393,0.0006057634,0.0006803277,0.0014215619,0.000023168901],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017242251,0.000016574775,0.00009081389,0.000030268064,0.000010749226,0.00007944707,0.00030807938,0.0069947545,0.00437046,0.0008515141,0.0000012489087,0.9872289],"study_design_scores_gemma":[0.000842033,0.00015896492,0.00045061554,0.00031784546,0.000011886381,0.00020672509,5.978399e-8,0.78919166,0.041884772,0.16430078,0.0016984624,0.0009361866],"about_ca_topic_score_codex":0.000057629706,"about_ca_topic_score_gemma":0.00047679927,"teacher_disagreement_score":0.98629266,"about_ca_system_score_codex":0.00015608486,"about_ca_system_score_gemma":0.00034095798,"threshold_uncertainty_score":0.999846},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006138464,0.0004221575,0.9916424,0.00012231483,0.0018738604,0.0012511056,0.0000031138513,0.00032196278,0.0037492218],"genre_scores_gemma":[0.8057274,0.000033168853,0.19206712,0.00084549724,0.0007763706,0.000033281012,0.0000018225184,0.00005961432,0.00045573115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939407,0.00009996954,0.0007724853,0.002679953,0.0014414629,0.0010654224],"domain_scores_gemma":[0.9955574,0.0006920345,0.00043793893,0.0027048353,0.00029267746,0.0003150802],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010159191,0.00084400637,0.00081929425,0.00076430634,0.0005533462,0.0005466819,0.004510174,0.0003841611,0.00002362053],"category_scores_gemma":[0.00005045659,0.00079218287,0.00016912735,0.0009656495,0.0007750476,0.0006959062,0.0030736998,0.001547259,0.00008609187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001079286,0.00020303708,0.00016765622,0.0000124043345,0.000045124827,0.056989484,0.008008187,0.088761345,0.0000028443576,0.004999238,0.00018797033,0.84061193],"study_design_scores_gemma":[0.0005924132,0.0010005598,0.00007215604,0.00020832261,0.000017766793,0.015155884,0.0000032263893,0.9704505,0.000033412423,0.0103068985,0.00093926105,0.001219571],"about_ca_topic_score_codex":0.00022714603,"about_ca_topic_score_gemma":0.0005860821,"teacher_disagreement_score":0.8816892,"about_ca_system_score_codex":0.0004586806,"about_ca_system_score_gemma":0.0007141567,"threshold_uncertainty_score":0.9994529},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007491222,0.0009673341,0.92892975,0.00019969024,0.0009003871,0.00018423928,0.000016550734,0.000049687875,0.06867748],"genre_scores_gemma":[0.8386852,0.0014440615,0.1539052,0.0018514065,0.001373277,0.000017429991,0.000050724517,0.00005252823,0.0026201461],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997987,0.000049995528,0.00030246092,0.0004513919,0.0008125896,0.0003966117],"domain_scores_gemma":[0.9986715,0.00027041548,0.00019247456,0.00042245016,0.0002523561,0.00019086005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007779661,0.0001887569,0.00041425318,0.0020721352,0.00037898344,0.000056868368,0.00077430054,0.0002764533,0.00050750695],"category_scores_gemma":[0.00007890104,0.00018273194,0.00038207028,0.0039315363,0.0020776438,0.00020336354,0.00012045011,0.00029205225,0.000009906784],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012415203,0.00018978732,0.016115515,0.00003917122,0.0006779177,0.0000141633045,0.038159214,0.23178124,0.000026708889,0.13976099,0.00022892482,0.57299393],"study_design_scores_gemma":[0.0010288756,0.0004568396,0.009444064,0.0006397632,0.0061021415,0.000004050673,0.000048530797,0.12590776,0.00020290319,0.18701659,0.6639125,0.0052360003],"about_ca_topic_score_codex":0.00039123336,"about_ca_topic_score_gemma":0.0024065003,"teacher_disagreement_score":0.8386103,"about_ca_system_score_codex":0.00011908923,"about_ca_system_score_gemma":0.00027017272,"threshold_uncertainty_score":0.76551646},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013332115,0.0012230494,0.9955624,0.0008311948,0.00037511913,0.0003118093,0.000007542731,0.000605611,0.0010699403],"genre_scores_gemma":[0.049030878,0.000012681192,0.94882184,0.0017385263,0.00021277434,0.000004979695,0.000005105239,0.00003349521,0.0001397187],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960632,0.000032127537,0.0004474332,0.0015505507,0.0011244327,0.0007822939],"domain_scores_gemma":[0.99703246,0.00042009016,0.0002649206,0.0018384726,0.00024307558,0.00020098907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060798554,0.0005925628,0.0005746338,0.0006238296,0.000263872,0.0009847244,0.0049729166,0.000291201,0.00001272632],"category_scores_gemma":[0.00017468196,0.00047513892,0.0000666551,0.0004968153,0.0007727218,0.0007755638,0.0014559311,0.0011290725,0.00000976293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009501164,0.000013369597,0.000009366625,0.000031491498,0.000005327737,0.00039842565,0.00025039105,0.0003672332,0.00010857991,0.06941097,0.000033555672,0.92936176],"study_design_scores_gemma":[0.00035478044,0.0004992706,0.00003534478,0.0013098315,0.0000119989145,0.00040390063,1.595278e-7,0.08316195,0.004818612,0.9072814,0.0010743804,0.0010483706],"about_ca_topic_score_codex":0.00002750467,"about_ca_topic_score_gemma":0.0000925504,"teacher_disagreement_score":0.92831343,"about_ca_system_score_codex":0.0003251898,"about_ca_system_score_gemma":0.00045270906,"threshold_uncertainty_score":0.99977005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037113514,0.0008929455,0.9904652,0.000809534,0.0004879231,0.00037489898,0.0000027706244,0.00031076238,0.006618819],"genre_scores_gemma":[0.23644015,0.00022397173,0.7591749,0.0013593278,0.00047204085,0.000025050726,0.0000068981863,0.00007875132,0.0022189396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949847,0.000038810034,0.0005482124,0.0020119718,0.0012600231,0.0011562867],"domain_scores_gemma":[0.99756783,0.000270709,0.00042590033,0.0011757269,0.0002990826,0.0002607746],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000673744,0.00073903025,0.0006572204,0.00067855016,0.0005616981,0.0013248366,0.00360085,0.0003699191,0.00007018474],"category_scores_gemma":[0.00007514079,0.0005748877,0.00012440658,0.0008219719,0.000522913,0.0008976571,0.0010882057,0.0015803374,0.00009133724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015804831,0.00012399207,0.0008039773,0.00039181032,0.00005124748,0.00049284723,0.0035243933,0.17560779,0.00009538002,0.10322412,0.00008003683,0.7155886],"study_design_scores_gemma":[0.0007399603,0.00053695316,0.00026320934,0.0019838442,0.000019493567,0.00032502558,4.5094467e-7,0.8438029,0.00037101787,0.14111942,0.009106302,0.001731421],"about_ca_topic_score_codex":0.00001259372,"about_ca_topic_score_gemma":0.000032260272,"teacher_disagreement_score":0.7138572,"about_ca_system_score_codex":0.00016156225,"about_ca_system_score_gemma":0.00040180757,"threshold_uncertainty_score":0.9997119},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007287165,0.00012401056,0.99459654,0.00045960103,0.002445914,0.0010088442,0.000022548807,0.00027416483,0.00033967476],"genre_scores_gemma":[0.6728586,0.000012428355,0.32645753,0.00013595224,0.0003973912,0.00004863248,0.000007824816,0.000039137663,0.00004252496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957348,0.00009512693,0.0010777591,0.0015651614,0.00089420134,0.0006329107],"domain_scores_gemma":[0.99527174,0.0016687404,0.00083040976,0.0016410958,0.0004538338,0.00013420389],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014710043,0.00054372725,0.00084476,0.0012996789,0.00022172013,0.00032963374,0.0028905729,0.00039646367,0.0000038138119],"category_scores_gemma":[0.00008150794,0.0005283399,0.00018756055,0.0008378211,0.0006224368,0.00046361503,0.0005187995,0.0005482732,0.0000127219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014152654,0.000055514716,0.00023741211,0.00077286415,0.0000204027,0.000013914216,0.0006562762,0.036959022,0.0042382875,0.02446283,0.00006619128,0.9325031],"study_design_scores_gemma":[0.0005857265,0.00029479223,0.0044301595,0.0017099797,0.000017206004,0.0002896637,9.744732e-7,0.9693387,0.0037605583,0.018843412,0.000091474314,0.00063736486],"about_ca_topic_score_codex":0.0000614654,"about_ca_topic_score_gemma":0.00012836233,"teacher_disagreement_score":0.93237966,"about_ca_system_score_codex":0.001054583,"about_ca_system_score_gemma":0.0005570474,"threshold_uncertainty_score":0.9997168},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0105342,0.0007097124,0.984439,0.00080445205,0.00015102174,0.0008543721,0.000004608706,0.00001738707,0.0024852112],"genre_scores_gemma":[0.97394586,0.0000571091,0.025204107,0.00031137117,0.00012781541,0.00013575997,0.000014495344,0.00001393181,0.00018953183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865144,0.0000852619,0.0002782944,0.0004969717,0.00032178723,0.0001662614],"domain_scores_gemma":[0.9984947,0.0006836496,0.00026127967,0.00034788324,0.00016151101,0.00005098692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013354907,0.00016161615,0.00016933154,0.0001586209,0.00019027053,0.00006854918,0.00022989488,0.0000983165,0.00005744191],"category_scores_gemma":[0.000040992778,0.000119089775,0.0000270797,0.000120417375,0.00036743906,0.00003760652,0.00008083592,0.0004208169,0.000004849644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010305401,0.000038792405,0.00012445988,0.00004351962,0.000013693755,1.8115415e-7,0.003007594,0.22787753,0.00014207387,0.013412296,0.000005995228,0.7553236],"study_design_scores_gemma":[0.000344231,0.00045874543,0.0032152922,0.00032993924,0.000036487003,0.000004830285,0.000023339557,0.95743567,0.00026326513,0.03442544,0.0031606364,0.00030211086],"about_ca_topic_score_codex":0.00014178472,"about_ca_topic_score_gemma":0.0000060876814,"teacher_disagreement_score":0.9634117,"about_ca_system_score_codex":0.000071595234,"about_ca_system_score_gemma":0.0001328771,"threshold_uncertainty_score":0.485634},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038052796,0.000028540699,0.980041,0.000297903,0.00041318024,0.0001194757,0.000014350778,0.00003209054,0.018672917],"genre_scores_gemma":[0.92641735,6.4016217e-7,0.07162753,0.00036903395,0.0014062845,0.0000031682891,0.00002178971,0.0000239911,0.00013021169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983772,0.000008224154,0.00023954251,0.0006068937,0.0004296081,0.00033854335],"domain_scores_gemma":[0.9991487,0.00027583426,0.00008234725,0.00029528758,0.00008260375,0.00011522668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013554143,0.00027762176,0.0002709968,0.0001345421,0.00014652639,0.00013302654,0.00059345417,0.00008141095,0.00025963134],"category_scores_gemma":[0.000005558789,0.00024393723,0.00012215973,0.00014933107,0.00068399246,0.00008899298,0.00030891644,0.00064116763,0.00007889463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027830442,0.00001641803,0.00002474859,0.0000047160584,0.000005697558,0.000002297748,0.00006624711,0.062049348,0.000014200599,0.6630627,8.8359315e-7,0.27474996],"study_design_scores_gemma":[0.00014661098,0.000038572438,0.00006387076,0.00014348097,0.0000060311036,0.0000015440585,6.7172486e-8,0.014382511,0.00021566807,0.9844358,0.0002823131,0.00028355644],"about_ca_topic_score_codex":0.000012757912,"about_ca_topic_score_gemma":8.910812e-7,"teacher_disagreement_score":0.92603683,"about_ca_system_score_codex":0.00007995297,"about_ca_system_score_gemma":0.00034238788,"threshold_uncertainty_score":0.99474716},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007967508,0.0020060625,0.986774,0.00038479967,0.0021273037,0.00028786613,0.000018715948,0.00021048772,0.008111077],"genre_scores_gemma":[0.13609333,0.00036475115,0.85273707,0.007019451,0.0025960624,0.000027339322,0.000046995043,0.00013078791,0.0009842071],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605876,0.00003515596,0.00043592238,0.0015450589,0.0010241577,0.0009009286],"domain_scores_gemma":[0.99680525,0.00030889022,0.0002501272,0.0022574996,0.00014417493,0.00023406146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007897515,0.0005779849,0.00050246116,0.00076708716,0.00034945138,0.00043231243,0.004221224,0.00039324348,0.00021626824],"category_scores_gemma":[0.000026364318,0.00050727243,0.00019370948,0.00066783564,0.0009408823,0.0010623978,0.0028416314,0.00068999594,0.00029538205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010807664,0.000076201664,0.0004423386,0.000058291716,0.000020446532,0.000089309506,0.0013439009,0.00063913997,0.00023786571,0.22639656,0.00034598334,0.77033913],"study_design_scores_gemma":[0.00093633874,0.0002860739,0.0013042565,0.00065880653,0.000037323574,0.00038798054,1.9111538e-7,0.07754978,0.007606354,0.70147604,0.20640098,0.0033559168],"about_ca_topic_score_codex":0.00001930286,"about_ca_topic_score_gemma":0.00012983994,"teacher_disagreement_score":0.7669832,"about_ca_system_score_codex":0.00025489277,"about_ca_system_score_gemma":0.0002466418,"threshold_uncertainty_score":0.9997379},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000117267475,0.0012381737,0.9957887,0.00042604617,0.00086171343,0.0002339909,0.000036877598,0.00013763864,0.0011595726],"genre_scores_gemma":[0.018006394,0.00021872089,0.97955656,0.00072325347,0.000606293,0.000007584349,0.000020064936,0.000033064,0.0008280941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675226,0.000029061659,0.00047149617,0.0015242911,0.00062324136,0.0005996244],"domain_scores_gemma":[0.9974983,0.00040610062,0.00026123095,0.0014882684,0.00011759155,0.00022853339],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068599504,0.00047292383,0.00048828195,0.00074896804,0.00046440243,0.0003492435,0.0013677616,0.00017887026,0.000023230088],"category_scores_gemma":[0.000101952435,0.000407727,0.00007073443,0.0004959751,0.0005209184,0.0018181172,0.0023863525,0.0006839493,0.000024191397],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037118743,0.000019214329,0.00026067538,0.00007705264,0.000014693577,0.00018234242,0.0006560084,0.007993342,0.00038736765,0.21583466,0.00006914425,0.7745018],"study_design_scores_gemma":[0.0011545963,0.00026756784,0.0006388814,0.0055843787,0.000047430727,0.0008175069,0.000002278827,0.7390332,0.0035300532,0.04895608,0.19590057,0.0040674275],"about_ca_topic_score_codex":0.000026453305,"about_ca_topic_score_gemma":0.00011400042,"teacher_disagreement_score":0.7704344,"about_ca_system_score_codex":0.00015822276,"about_ca_system_score_gemma":0.0003015017,"threshold_uncertainty_score":0.99983746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023975836,0.0006262579,0.99435747,0.0007632546,0.001538283,0.0014425309,0.00002418548,0.000520703,0.00072492094],"genre_scores_gemma":[0.001465068,0.0001418216,0.99495465,0.0011899578,0.0007746661,0.00011780317,0.000015070206,0.0000541136,0.0012868287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958287,0.000044543634,0.0005545743,0.0019509455,0.00086768804,0.0007535837],"domain_scores_gemma":[0.99692726,0.0006186591,0.00040508606,0.0011369883,0.000703496,0.00020849524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010197813,0.0006803155,0.00061846146,0.0013129192,0.00031354913,0.0006190948,0.0025544695,0.0006121773,0.000031382315],"category_scores_gemma":[0.00013577759,0.0006441951,0.00028796963,0.00061448116,0.00045519756,0.00091058254,0.0007196504,0.001112069,0.000057876376],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033585086,0.000054464315,0.0000011337723,0.000021065553,0.00001493262,0.000021920237,0.00038804952,0.00041785708,0.00022670778,0.00086367753,0.00007008906,0.99791676],"study_design_scores_gemma":[0.00043454306,0.00040857444,0.000027512835,0.0005131472,0.000023946754,0.00020834064,5.620548e-7,0.8799417,0.0340794,0.070715964,0.012562711,0.0010835673],"about_ca_topic_score_codex":0.000014250044,"about_ca_topic_score_gemma":0.00008835125,"teacher_disagreement_score":0.9968332,"about_ca_system_score_codex":0.00076827634,"about_ca_system_score_gemma":0.0004906889,"threshold_uncertainty_score":0.99960095},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001443051,0.000493898,0.9956399,0.0006563409,0.00092461397,0.00022541436,0.000011975201,0.00013142744,0.0017720907],"genre_scores_gemma":[0.04842379,0.00049188465,0.9474212,0.0018736845,0.0012685613,0.00000350368,0.000031768188,0.000028674554,0.0004569282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746406,0.000018430837,0.00038502255,0.00074206555,0.0009404954,0.00044994248],"domain_scores_gemma":[0.998331,0.0002210015,0.0001365781,0.00092868676,0.0002149145,0.00016782996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000714988,0.00033991825,0.00030550227,0.00075274595,0.00023258796,0.00084555044,0.001904396,0.00024568557,0.0000174248],"category_scores_gemma":[0.000055279696,0.00028902257,0.000048909213,0.00042793693,0.00035762857,0.0024761667,0.0019716267,0.0006356716,0.000053208423],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050404783,0.0000069681673,0.000015374228,0.000025271805,0.0000032678124,0.0000125026845,0.00039057646,0.0059311986,0.00007104122,0.010191232,0.000043811568,0.9833037],"study_design_scores_gemma":[0.00023912586,0.00009583475,0.00012394364,0.00019922243,0.0000028116492,0.00007671352,1.1667269e-7,0.9679631,0.0006988926,0.010973821,0.019210815,0.0004155762],"about_ca_topic_score_codex":0.000010043802,"about_ca_topic_score_gemma":0.000006948427,"teacher_disagreement_score":0.98288816,"about_ca_system_score_codex":0.00013011698,"about_ca_system_score_gemma":0.00039916346,"threshold_uncertainty_score":0.9999562},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001511076,0.00012658075,0.98961663,0.0006054269,0.0014369052,0.00035653554,0.000008764662,0.0003046176,0.0060334853],"genre_scores_gemma":[0.5640087,0.00001940512,0.43384796,0.001125223,0.0005556296,0.000016768166,0.0000045103,0.00005384476,0.00036796025],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957156,0.000046988953,0.00040972192,0.0018830539,0.0011134276,0.00083119137],"domain_scores_gemma":[0.9970671,0.00029764732,0.00028946373,0.0018800681,0.00020857275,0.00025717693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060640246,0.0007205669,0.0005932134,0.0009527805,0.0004320361,0.0009216666,0.0048714536,0.00041549976,0.00010633968],"category_scores_gemma":[0.000028114944,0.00053378876,0.00018723811,0.00078693195,0.001695416,0.00081045757,0.0010146641,0.0013481368,0.00006315108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059206686,0.00006326908,0.001160334,0.000077825025,0.000071498005,0.000470563,0.0031483793,0.0006080776,0.0023029267,0.2071845,0.000009266798,0.78484416],"study_design_scores_gemma":[0.00067054137,0.0010510376,0.0009283781,0.00079765084,0.000029283692,0.00049719063,7.5496575e-7,0.020125132,0.023305384,0.9446612,0.0054422114,0.0024912495],"about_ca_topic_score_codex":0.000027134458,"about_ca_topic_score_gemma":0.00020858066,"teacher_disagreement_score":0.7823529,"about_ca_system_score_codex":0.00009898623,"about_ca_system_score_gemma":0.00042018126,"threshold_uncertainty_score":0.9997114},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060591527,0.00014480214,0.99248445,0.0004009589,0.002885133,0.00060573954,0.0000012065029,0.00022111187,0.002650655],"genre_scores_gemma":[0.4382925,0.000045677098,0.55808175,0.0009705405,0.00077984267,0.000044925684,0.000014987366,0.000045092132,0.0017246588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970055,0.000039359024,0.0005623882,0.0010502483,0.00093109417,0.00041139778],"domain_scores_gemma":[0.99807185,0.00023375773,0.00046157435,0.0009284612,0.00018075395,0.00012362747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061517255,0.0003720797,0.00034366664,0.00068906764,0.00021750593,0.00069289946,0.0013951752,0.00025263018,0.00018320688],"category_scores_gemma":[0.000041319407,0.00033850825,0.00009496294,0.0003527302,0.00014558212,0.0014386717,0.0003336215,0.00040220938,0.0005256389],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.550149e-7,0.000022623357,0.0000357968,0.000053360593,0.000007744441,0.000014256972,0.0006308646,0.005071753,0.0007141618,0.011118002,0.00008461464,0.98224616],"study_design_scores_gemma":[0.00019847711,0.00007164904,0.00094182283,0.00028682748,0.0000057551138,0.000045933542,1.5353801e-7,0.9607783,0.0013966147,0.03497539,0.0008746892,0.00042440268],"about_ca_topic_score_codex":0.00006551811,"about_ca_topic_score_gemma":0.000036155157,"teacher_disagreement_score":0.9818218,"about_ca_system_score_codex":0.0004034928,"about_ca_system_score_gemma":0.00021533175,"threshold_uncertainty_score":0.9999067},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012796928,0.00092240906,0.9956711,0.0011833276,0.0006374148,0.00060065615,0.000019245876,0.00012763838,0.00071027357],"genre_scores_gemma":[0.48340753,0.0002520305,0.5110157,0.0026051258,0.0019142787,0.000093565905,0.00006321945,0.00006048378,0.0005880779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972201,0.000015245267,0.0005081157,0.0012565007,0.0004876033,0.0005124612],"domain_scores_gemma":[0.9983897,0.00024052453,0.00030146595,0.00062075164,0.00031030766,0.00013725388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068575214,0.00040072942,0.00046618975,0.00028687948,0.00029600208,0.0007201648,0.0011702871,0.0002423622,0.000001600632],"category_scores_gemma":[0.000116128096,0.00036008318,0.00007714176,0.00035617364,0.0002892999,0.000713531,0.00022201183,0.0003054703,0.000004902601],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010535434,0.00002891622,0.000059305625,0.00023086106,0.00000866731,0.000016382288,0.00096192135,0.0045369007,0.000241378,0.024901627,0.00006104814,0.96894246],"study_design_scores_gemma":[0.0008292421,0.00062968297,0.0003796014,0.0014603254,0.000015996873,0.0001487574,4.7534286e-7,0.81680197,0.0048940675,0.12745489,0.045991216,0.0013937935],"about_ca_topic_score_codex":0.000013001327,"about_ca_topic_score_gemma":0.00008818033,"teacher_disagreement_score":0.96754867,"about_ca_system_score_codex":0.000119412325,"about_ca_system_score_gemma":0.0004048817,"threshold_uncertainty_score":0.99988514},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002172124,0.00018981121,0.9952457,0.0002599773,0.0013215293,0.00051966764,0.000004365183,0.0012827747,0.0009589723],"genre_scores_gemma":[0.019993909,0.000037758648,0.9781612,0.00079400255,0.00027945312,0.000031540912,0.000009175155,0.00006855902,0.0006243796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537516,0.000035589783,0.0005790765,0.0019989223,0.0011295633,0.0008817166],"domain_scores_gemma":[0.9962626,0.00018311513,0.00026885196,0.0026144157,0.00034117087,0.00032986182],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00071182795,0.00073927577,0.0006188797,0.0008573421,0.00025416852,0.0006429127,0.005766699,0.00050205964,0.0000651031],"category_scores_gemma":[0.00001963768,0.0006971155,0.0001192743,0.0006274743,0.0004395308,0.0011550507,0.0023384583,0.00084451423,0.00019490835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024572732,0.000024625922,0.000062821586,0.00003203308,0.000008835047,0.00007724707,0.0006502646,0.025188815,0.00048170643,0.056058656,0.00013950012,0.91727304],"study_design_scores_gemma":[0.00016416034,0.0002479893,0.00029065166,0.00030994194,0.000005794347,0.00012467611,1.8316102e-8,0.9019759,0.0044872,0.06336408,0.027671967,0.0013575581],"about_ca_topic_score_codex":0.000040820756,"about_ca_topic_score_gemma":0.00004489518,"teacher_disagreement_score":0.9159155,"about_ca_system_score_codex":0.0008145846,"about_ca_system_score_gemma":0.00046466143,"threshold_uncertainty_score":0.99961257},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013631197,0.0030430856,0.99171,0.0001731098,0.0028973112,0.00036516794,0.000011950945,0.0002287912,0.0014342364],"genre_scores_gemma":[0.014739504,0.000112686095,0.98160845,0.0020684674,0.0007120331,0.000007744632,0.000015377069,0.00006478965,0.0006709397],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9946017,0.00015334507,0.00085087115,0.002289821,0.0011813297,0.000922889],"domain_scores_gemma":[0.99592334,0.0012309185,0.0004649473,0.0018386969,0.000267604,0.00027447846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018728777,0.000764851,0.0008414746,0.00067059905,0.0004928412,0.00088966393,0.0041680317,0.0004863025,0.00006549929],"category_scores_gemma":[0.00022551687,0.00069542043,0.00022194983,0.00059642113,0.0004970818,0.0010987034,0.0019875467,0.0011195041,0.00013029005],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008592855,0.000030035591,0.000017081391,0.00001850122,0.0000117490135,0.00012521124,0.0015944026,0.0004611751,0.032940507,0.0003888687,0.00008486249,0.964319],"study_design_scores_gemma":[0.0012034229,0.00033152133,0.000100130965,0.0017792633,0.000038020382,0.000105172796,4.5281848e-7,0.34663665,0.35138193,0.28335017,0.012655324,0.0024179544],"about_ca_topic_score_codex":0.00040970172,"about_ca_topic_score_gemma":0.00016909691,"teacher_disagreement_score":0.96190107,"about_ca_system_score_codex":0.0003087524,"about_ca_system_score_gemma":0.00038233266,"threshold_uncertainty_score":0.9995497},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010462253,0.000043928532,0.97758377,0.0020322108,0.00096869003,0.0004136465,0.000010546056,0.00020572061,0.01873101],"genre_scores_gemma":[0.16161849,0.000036562164,0.82931316,0.005873586,0.0007923079,0.000010552934,0.000049570106,0.000056957397,0.0022488432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964947,0.00007897305,0.00053335325,0.0012886936,0.0010078852,0.0005964115],"domain_scores_gemma":[0.99713784,0.0008682363,0.00027953341,0.0011420087,0.0003616891,0.00021066681],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094025343,0.00042924768,0.00046045362,0.000887321,0.00037024074,0.0005429669,0.0023997868,0.0002484171,0.00005267894],"category_scores_gemma":[0.0002256996,0.00038921373,0.00012996266,0.000649485,0.00044515895,0.0003079065,0.00082096655,0.000870096,0.00010544569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031844688,0.000030740004,0.000010684397,0.000008634688,0.000006452387,0.000015752601,0.00037880786,0.20614791,0.000015174235,0.50430393,0.000018365963,0.28906035],"study_design_scores_gemma":[0.0003872223,0.00022537838,0.00008194453,0.00036697116,0.0000038379485,0.000016740705,1.9080541e-7,0.94262457,0.00012893473,0.05032235,0.005360794,0.00048103783],"about_ca_topic_score_codex":0.000011266653,"about_ca_topic_score_gemma":0.00009385951,"teacher_disagreement_score":0.73647666,"about_ca_system_score_codex":0.00026314403,"about_ca_system_score_gemma":0.000428867,"threshold_uncertainty_score":0.999856},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013645533,0.00034832244,0.9901491,0.0007777958,0.0021325608,0.00075645733,0.00001682059,0.00016057197,0.005644728],"genre_scores_gemma":[0.008453857,0.000024639234,0.9857721,0.0035894203,0.00068888755,0.000026902142,0.0000075407393,0.0000609259,0.0013757314],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951479,0.00011646176,0.00072603015,0.0020041785,0.0009443631,0.0010611025],"domain_scores_gemma":[0.9961493,0.0010564871,0.00040440934,0.0017647496,0.00035785054,0.0002671926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028468375,0.00071738503,0.0008194633,0.00086423283,0.0004165359,0.0008248377,0.0049275956,0.00044659732,0.00005228845],"category_scores_gemma":[0.0001958979,0.00062306353,0.00028577168,0.00055684557,0.0007081737,0.00090981706,0.0014623243,0.0007447369,0.00006183659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048236216,0.00004086616,0.0000047289623,0.00008809759,0.000036494843,0.00023422464,0.0020013887,0.0013411121,0.0021218956,0.10309305,0.000257106,0.8907328],"study_design_scores_gemma":[0.0006911538,0.00035642568,0.000026650046,0.00038872502,0.0000152848,0.00009725925,1.2684735e-7,0.085860044,0.007909216,0.89789337,0.005798499,0.0009632646],"about_ca_topic_score_codex":0.000027437845,"about_ca_topic_score_gemma":0.000022388665,"teacher_disagreement_score":0.88976955,"about_ca_system_score_codex":0.00018843562,"about_ca_system_score_gemma":0.0006570834,"threshold_uncertainty_score":0.99962205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000115556155,0.0003650647,0.99618345,0.0002461456,0.0011927865,0.00055641227,0.0000035842909,0.00006951179,0.0012674732],"genre_scores_gemma":[0.035327457,0.000020722562,0.96343863,0.00062168075,0.00023808164,0.0000035046185,0.0000014953097,0.000018754125,0.00032967704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965807,0.00013495644,0.00061965076,0.0010236009,0.0011537964,0.0004872725],"domain_scores_gemma":[0.9973447,0.00026713946,0.00064285204,0.0012826303,0.00037829357,0.000084431565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00163598,0.00040063375,0.0004530625,0.0005708177,0.0003728646,0.00033276188,0.0026477166,0.00030300888,0.0000034333789],"category_scores_gemma":[0.00014052563,0.00030584654,0.00022215,0.0010924019,0.00076196494,0.0005100554,0.00059494225,0.00065262726,0.000001956957],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070898427,0.000034431854,0.0000108425465,0.000025636697,0.000007793621,0.000025537714,0.0005631848,0.010625758,0.00442764,0.00201604,0.000009603804,0.98224646],"study_design_scores_gemma":[0.00032653366,0.00015519581,0.00017960378,0.0005540524,0.000014634181,0.000096694515,1.7786265e-7,0.89266205,0.015188983,0.09013374,0.00030021401,0.00038809725],"about_ca_topic_score_codex":0.000102497135,"about_ca_topic_score_gemma":0.00003521531,"teacher_disagreement_score":0.9818584,"about_ca_system_score_codex":0.00023348466,"about_ca_system_score_gemma":0.00070806954,"threshold_uncertainty_score":0.9999394},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007206529,0.00017988184,0.9938423,0.0004284888,0.0019369076,0.0013191787,0.000011753545,0.00013292594,0.0014278856],"genre_scores_gemma":[0.44565323,0.000046217985,0.5529074,0.00061435346,0.0004986033,0.00014095228,0.000018972283,0.000037822756,0.00008247458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995383,0.000041434396,0.000802147,0.001886155,0.0010185677,0.00086865935],"domain_scores_gemma":[0.99650526,0.0005531653,0.00024917978,0.002087251,0.00043178347,0.00017334179],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027352523,0.000536354,0.00059610396,0.0006812215,0.00029571008,0.00040659873,0.0038039975,0.00052490825,0.000019828223],"category_scores_gemma":[0.00021562896,0.00052288926,0.00012996737,0.0006444777,0.00046869976,0.0006839866,0.0010994831,0.0013767208,0.000014260666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056857198,0.000024636862,0.000021764174,0.00004831271,0.000002839458,0.0000061548567,0.0002870779,0.63797283,0.0000272118,0.00886228,0.0000038204425,0.35273737],"study_design_scores_gemma":[0.00024868015,0.00011612642,0.00011617071,0.00023451512,0.0000066509656,0.000019768595,6.0050276e-8,0.82271016,0.00012581995,0.17574711,0.00022444481,0.00045047284],"about_ca_topic_score_codex":0.000078031815,"about_ca_topic_score_gemma":0.0007364047,"teacher_disagreement_score":0.44493258,"about_ca_system_score_codex":0.00047083895,"about_ca_system_score_gemma":0.0010854315,"threshold_uncertainty_score":0.99972224},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007194186,0.0002530465,0.993728,0.00028920185,0.0017354133,0.00057253754,0.000011113665,0.00028900997,0.003049765],"genre_scores_gemma":[0.16445123,0.000063209365,0.8317308,0.0015022692,0.00077531533,0.00006980541,0.000028078302,0.000090914495,0.0012883708],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691474,0.000023437171,0.000456065,0.0014574382,0.00052416534,0.0006241519],"domain_scores_gemma":[0.997404,0.00036045926,0.00032531327,0.001556231,0.00020988357,0.00014412857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094604905,0.00046942814,0.00043144275,0.000682576,0.0002569433,0.00042102166,0.0036467488,0.00028841966,0.00002113547],"category_scores_gemma":[0.00005837561,0.00041674997,0.00015244908,0.00044645098,0.0005091096,0.0005983316,0.000777385,0.00039310087,0.00004519123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005568899,0.000026552545,0.000009902774,0.0000520488,0.000008895804,0.000008807004,0.00079689553,0.0010824201,0.00047099823,0.29430977,0.000030816,0.70319736],"study_design_scores_gemma":[0.00022453719,0.00016147636,0.00011040318,0.0002248736,0.000009116317,0.000031670894,1.8288965e-7,0.3999041,0.0043185595,0.5916918,0.0026517268,0.0006715856],"about_ca_topic_score_codex":0.000014044179,"about_ca_topic_score_gemma":0.0000111838835,"teacher_disagreement_score":0.70252573,"about_ca_system_score_codex":0.00017446109,"about_ca_system_score_gemma":0.00029156086,"threshold_uncertainty_score":0.99982846},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007755328,0.0003926436,0.99513674,0.0001944284,0.002739773,0.00024646788,0.000013046257,0.000089998255,0.00041139143],"genre_scores_gemma":[0.03132161,0.000006076104,0.9674706,0.0005596686,0.00054070924,6.898299e-7,0.000010652899,0.000043689695,0.00004631278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948764,0.000078776204,0.0008056997,0.001984859,0.0015039082,0.0007503456],"domain_scores_gemma":[0.99440867,0.00091090944,0.0005728009,0.0035486855,0.0003946234,0.00016431483],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0031434093,0.00057858863,0.00077383337,0.0009939471,0.00041392905,0.00058438897,0.007457454,0.00044656466,0.000022723689],"category_scores_gemma":[0.00026529783,0.0005274022,0.00013107069,0.0007430302,0.00086985185,0.0012825736,0.006409635,0.0014207372,0.000010267744],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020911128,0.00005196754,0.000069740774,0.00009293773,0.000040649265,0.0003238578,0.0005269973,0.027309196,0.051879793,0.010464242,0.0000069831035,0.9092127],"study_design_scores_gemma":[0.00030158507,0.000060850776,0.00008985038,0.0006385881,0.000022095483,0.00020747921,3.4627934e-8,0.804068,0.0127445785,0.18102944,0.00025159068,0.0005859139],"about_ca_topic_score_codex":0.00012285123,"about_ca_topic_score_gemma":0.00012481384,"teacher_disagreement_score":0.9086268,"about_ca_system_score_codex":0.00013467866,"about_ca_system_score_gemma":0.0009997033,"threshold_uncertainty_score":0.9997178},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033650078,0.00016816579,0.9951344,0.0009841558,0.0021052854,0.00073756283,0.0000140207085,0.00021548013,0.00060724234],"genre_scores_gemma":[0.018868022,0.000025719297,0.9784518,0.0008344781,0.0010752152,0.000045462963,0.00003817636,0.000034637887,0.0006264807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683714,0.00001077139,0.0004098316,0.0014020184,0.00073560723,0.00060465187],"domain_scores_gemma":[0.99809086,0.00018946368,0.00022724351,0.0011920619,0.00018023056,0.00012012451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006631572,0.00043854312,0.00036707573,0.0006076405,0.00023549012,0.000914465,0.003170054,0.00020044741,0.000013562914],"category_scores_gemma":[0.000086517175,0.0004084363,0.00013394248,0.00045659285,0.00030017796,0.0013726864,0.0011537415,0.00035602148,0.000029994872],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068345844,0.000031292468,0.000012568019,0.00007812384,0.000015455496,0.000025764499,0.00027872095,0.016247107,0.00007077685,0.1987727,0.000062145504,0.7843985],"study_design_scores_gemma":[0.0005073235,0.00018804571,0.00003670471,0.00032848632,0.000010206903,0.000011200311,4.5187008e-8,0.74022436,0.0019236831,0.24677123,0.009371963,0.00062672206],"about_ca_topic_score_codex":0.000013208587,"about_ca_topic_score_gemma":0.000016067692,"teacher_disagreement_score":0.7837718,"about_ca_system_score_codex":0.00020144999,"about_ca_system_score_gemma":0.00034706836,"threshold_uncertainty_score":0.99983674},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062303315,0.00072264543,0.9957883,0.0005610686,0.0010951235,0.00063929113,0.00012581762,0.000089495225,0.00035525783],"genre_scores_gemma":[0.18499476,0.00003573684,0.81222767,0.00077930494,0.0010394652,0.00001994532,0.0005853099,0.000027275795,0.00029051318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704087,0.000024834657,0.00040482808,0.0015004111,0.000620746,0.0004083172],"domain_scores_gemma":[0.99797314,0.00042360814,0.0002207659,0.0011087232,0.00016495535,0.00010881836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070767413,0.00039358292,0.0003583676,0.0004005211,0.00034824797,0.0006891056,0.002206464,0.0001919772,0.000005672216],"category_scores_gemma":[0.00009056872,0.00036068115,0.000047268346,0.00026490717,0.0004508392,0.0011008929,0.0017662505,0.00030413616,0.0000022806305],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015209275,0.000031949447,0.00015630756,0.000099526325,0.000019002806,0.000016433543,0.00017954687,0.03470423,0.00019843206,0.07969175,0.0004803735,0.8844072],"study_design_scores_gemma":[0.00038961825,0.00019334248,0.0010094183,0.00008177397,0.000014032869,0.000074270756,1.3882183e-7,0.7193668,0.0010768886,0.26853666,0.008635345,0.0006217574],"about_ca_topic_score_codex":0.0000506647,"about_ca_topic_score_gemma":0.00045021795,"teacher_disagreement_score":0.8837855,"about_ca_system_score_codex":0.0001141971,"about_ca_system_score_gemma":0.000357238,"threshold_uncertainty_score":0.9998845},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008130847,0.002560095,0.9934684,0.00025175716,0.0022190479,0.0007075033,0.000015759244,0.00017888022,0.0005172214],"genre_scores_gemma":[0.7239325,0.0010961222,0.26818106,0.005867684,0.00070940773,0.000068813555,0.000028631168,0.00008935105,0.000026430333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532074,0.0000740009,0.00069395744,0.002127271,0.00074148533,0.0010425389],"domain_scores_gemma":[0.9966352,0.00035948743,0.0003711429,0.002168991,0.00020215286,0.0002630558],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013352251,0.0007070408,0.00078172825,0.0011847805,0.00022367625,0.00092095084,0.0072948993,0.0006270649,0.000034416025],"category_scores_gemma":[0.000056828114,0.00065562164,0.00023367612,0.001101456,0.000565014,0.0015292437,0.0024185493,0.00149648,0.000012735871],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045101337,0.00011233237,0.000092570124,0.0000509739,0.0000318764,0.00034615208,0.00083907304,0.010419559,0.00011506649,0.22354952,0.000021246597,0.7643765],"study_design_scores_gemma":[0.0006290141,0.00016656403,0.00020349276,0.00021681043,0.000009297805,0.000030777996,6.8576284e-8,0.5441257,0.00021524212,0.4528553,0.00085112604,0.0006966545],"about_ca_topic_score_codex":0.00006260838,"about_ca_topic_score_gemma":0.00057599915,"teacher_disagreement_score":0.76367986,"about_ca_system_score_codex":0.00017212203,"about_ca_system_score_gemma":0.00036897295,"threshold_uncertainty_score":0.9995895},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008943109,0.0012240998,0.9924937,0.00044853854,0.001292265,0.00045422427,0.000029503075,0.0001460236,0.0038222098],"genre_scores_gemma":[0.021983434,0.0003996314,0.9749226,0.001314329,0.0006138582,0.000030616386,0.00006553352,0.0000517733,0.0006182314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958066,0.000051779167,0.0007334697,0.0017689687,0.0009419213,0.0006972692],"domain_scores_gemma":[0.9969935,0.00038748697,0.00034629635,0.001920842,0.00018362874,0.0001682851],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009113148,0.0005411204,0.0006108397,0.001030962,0.00020631724,0.00021566248,0.0017248066,0.00018366489,0.00002244317],"category_scores_gemma":[0.00012795851,0.0004957685,0.00010587325,0.00086355914,0.0005726799,0.0016254144,0.0015319678,0.00066809176,0.000057532805],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006271017,0.00003565631,0.00030543483,0.00006313493,0.000006096291,0.00043094027,0.00030074973,0.012078339,0.00005310863,0.16724998,0.000029138935,0.81944114],"study_design_scores_gemma":[0.0013659234,0.00034553997,0.0008742577,0.005989862,0.000018444382,0.0008593975,0.0000019209713,0.6142112,0.0031897866,0.118554205,0.25138524,0.0032042079],"about_ca_topic_score_codex":0.00018770523,"about_ca_topic_score_gemma":0.0010823187,"teacher_disagreement_score":0.8162369,"about_ca_system_score_codex":0.0003970114,"about_ca_system_score_gemma":0.00046656316,"threshold_uncertainty_score":0.9997494},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026550688,0.00055642746,0.99357873,0.0007115085,0.0033897578,0.00097470003,0.000050808765,0.0002937023,0.00041779166],"genre_scores_gemma":[0.015072346,0.000065041786,0.98214716,0.0011927545,0.0011205213,0.00003213103,0.00018209327,0.000047138707,0.00014081986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961887,0.00004582979,0.0006887782,0.0013773341,0.00092346355,0.0007759013],"domain_scores_gemma":[0.99736595,0.00045717636,0.00044718376,0.0010624952,0.00047105653,0.00019612281],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009366471,0.0005914379,0.0005493391,0.0010061784,0.0004351459,0.00049205514,0.0018607699,0.000357814,0.00005809529],"category_scores_gemma":[0.00004734509,0.00057199603,0.00021662374,0.0007415003,0.0008801202,0.0010996934,0.00059480895,0.00062287203,0.00002397388],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012631197,0.00007386937,0.0000069125654,0.000053045784,0.000020940675,0.0000027705335,0.00015816108,0.0067197816,0.00006824018,0.10846478,0.00001702123,0.88440186],"study_design_scores_gemma":[0.0004781167,0.00011721873,0.00011653563,0.00013912693,0.000019992687,0.00004351202,3.0986115e-7,0.6124345,0.0002508396,0.3849531,0.00096587837,0.00048084572],"about_ca_topic_score_codex":0.000008744444,"about_ca_topic_score_gemma":0.00002978328,"teacher_disagreement_score":0.883921,"about_ca_system_score_codex":0.00030135503,"about_ca_system_score_gemma":0.00033670128,"threshold_uncertainty_score":0.9996731},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008535238,0.000053630385,0.99546546,0.00081495714,0.00044982866,0.00034202376,0.0000033097294,0.00009494692,0.002690481],"genre_scores_gemma":[0.056040157,0.000033070242,0.94311315,0.00033935384,0.00012083351,0.000008391478,0.0000064573587,0.000023298653,0.0003152933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974043,0.000024036945,0.00038885305,0.0008751907,0.00091609336,0.00039156427],"domain_scores_gemma":[0.99802125,0.00017777369,0.0002731613,0.0009977587,0.000395473,0.00013457719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005363522,0.0003152006,0.00035033197,0.0006690718,0.00015875896,0.0003221816,0.0020663925,0.00023258266,0.000028658362],"category_scores_gemma":[0.000047443627,0.00025202625,0.0000616507,0.00051158044,0.0008885846,0.0013105433,0.00059703947,0.0006833309,0.000012223875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001544902,0.0000712986,0.000045073757,0.00006737627,0.000016455951,0.00004604792,0.004837013,0.5266239,0.0014625821,0.060273815,0.00000990364,0.40653107],"study_design_scores_gemma":[0.00047280555,0.00057319144,0.00005038755,0.00037541564,0.000006068509,0.00004028079,7.08485e-7,0.93200874,0.009324643,0.054738447,0.0017257794,0.0006835468],"about_ca_topic_score_codex":0.000010403264,"about_ca_topic_score_gemma":0.00009347769,"teacher_disagreement_score":0.40584752,"about_ca_system_score_codex":0.000070076734,"about_ca_system_score_gemma":0.0005677156,"threshold_uncertainty_score":0.9999932},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91703796,0.00021076655,0.082350045,0.00009441896,0.0002009141,0.00006144296,0.00003076855,0.000003226043,0.000010452676],"genre_scores_gemma":[0.9968515,0.000017118411,0.002867061,0.00020523238,0.000031904856,0.0000035645305,0.000020012307,0.0000029792577,6.0557875e-7],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992815,0.000023966018,0.000093438284,0.00029958037,0.00016011304,0.00014138999],"domain_scores_gemma":[0.99962103,0.0000170551,0.000053189327,0.00023610747,0.00004201045,0.00003061444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051734387,0.000090757756,0.0001200461,0.000074558026,0.00008916245,0.00001968212,0.00036652663,0.000046269633,0.000037885522],"category_scores_gemma":[0.000023430655,0.00006166202,0.00007702111,0.0005553666,0.0002466049,0.0000048007696,0.0001682346,0.00004056138,7.8130057e-7],"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.00001895918,0.0001134776,0.8829573,0.0000021073556,0.00011682695,0.0000015909362,0.0006676427,0.00057601306,0.016621899,0.000008353284,0.00000164828,0.09891421],"study_design_scores_gemma":[0.00016938912,0.000085447435,0.9262218,0.000014705817,0.00008283197,5.5993354e-7,0.000003983089,0.05500877,0.014825263,0.0034834067,0.0000027953809,0.000101045436],"about_ca_topic_score_codex":0.0002022669,"about_ca_topic_score_gemma":0.00089885085,"teacher_disagreement_score":0.09881317,"about_ca_system_score_codex":0.000010451268,"about_ca_system_score_gemma":0.000036844882,"threshold_uncertainty_score":0.2514504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003523739,0.00025299526,0.9959728,0.0014077296,0.00014302465,0.0006223961,0.0000049454165,0.00012267564,0.0014381594],"genre_scores_gemma":[0.20752281,0.000030393381,0.7896505,0.0021991634,0.00027530408,0.000053928055,0.0000011476009,0.000023633565,0.00024312864],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99803895,0.000023977174,0.00035323665,0.00080725545,0.00049110374,0.0002854852],"domain_scores_gemma":[0.9984624,0.00010496219,0.00022950847,0.00088859466,0.00022685625,0.00008771882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042807581,0.00026641486,0.0002645581,0.00048419365,0.0003126375,0.00038360295,0.0017470148,0.00013493595,0.000003889888],"category_scores_gemma":[0.000026182837,0.00020407108,0.000075590884,0.0006980052,0.00049542927,0.00059187907,0.001088831,0.00037788038,0.000005927902],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018806214,0.000008593216,0.0000046599994,0.000032430333,0.0000018608816,0.0000017123205,0.00037549358,0.0002266513,0.0028270835,0.0009921934,0.000015015523,0.9955124],"study_design_scores_gemma":[0.00034583197,0.0003651333,0.0007377023,0.001400973,0.000030256084,0.0002542013,7.974383e-7,0.13883938,0.6557388,0.18694031,0.013991378,0.0013552812],"about_ca_topic_score_codex":0.000020823414,"about_ca_topic_score_gemma":0.000049891496,"teacher_disagreement_score":0.99415714,"about_ca_system_score_codex":0.0001368244,"about_ca_system_score_gemma":0.00018780537,"threshold_uncertainty_score":0.83217776},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062402466,0.0007719388,0.99187666,0.0005197566,0.002443649,0.00065628224,0.000003738749,0.0003475017,0.0027564566],"genre_scores_gemma":[0.5856731,0.00024476342,0.410165,0.0015072211,0.0015913331,0.000028865938,0.000008773029,0.00013457691,0.0006463566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99223715,0.000151065,0.0011587787,0.0030265057,0.0015479712,0.0018785234],"domain_scores_gemma":[0.9954753,0.0010247987,0.0005298327,0.0022969416,0.0002816767,0.00039143555],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012727453,0.0011477453,0.0011667782,0.0017710917,0.00030751777,0.0007133393,0.0051075104,0.0008491809,0.000021172104],"category_scores_gemma":[0.000044335902,0.0011503248,0.00025080028,0.0017621407,0.0010078463,0.00085869577,0.0029912249,0.002488975,0.000041370797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016863098,0.000038990358,0.000043140644,0.000012250988,0.000009027965,0.00030775985,0.0004672883,0.6846035,0.000019556463,0.004380386,0.000006385795,0.3100948],"study_design_scores_gemma":[0.00056731387,0.00016835234,0.00012518623,0.0010059995,0.000007370615,0.000118030446,5.4902887e-7,0.99312866,0.00012773291,0.003074647,0.0004627899,0.0012133747],"about_ca_topic_score_codex":0.00007638427,"about_ca_topic_score_gemma":0.0014082108,"teacher_disagreement_score":0.5850491,"about_ca_system_score_codex":0.0010403723,"about_ca_system_score_gemma":0.0004781757,"threshold_uncertainty_score":0.9998123},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000330873,0.0013668346,0.9910894,0.0009448749,0.0014715944,0.0004504491,0.00000195751,0.00010153714,0.0042424616],"genre_scores_gemma":[0.69122446,0.00031242313,0.30369127,0.0032398896,0.0007915476,0.000025872556,0.0000026347213,0.00006184024,0.00065009005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996451,0.000039712297,0.00055419246,0.0013433712,0.0007480564,0.00086363894],"domain_scores_gemma":[0.99769115,0.00061389734,0.00019814886,0.0011387054,0.00013069085,0.00022739777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010292908,0.00048061492,0.00048525896,0.0008482868,0.00015449518,0.0005176058,0.0025868635,0.0003494941,0.000039218998],"category_scores_gemma":[0.00010394476,0.0004497995,0.00006899608,0.00058869505,0.0010847247,0.00095114054,0.001713587,0.00088244985,0.00014055055],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026552423,0.000023921271,0.00074034574,0.000017611412,0.0000034729762,0.00004190927,0.0017344577,0.0032674014,0.00007225037,0.025004491,0.000014291716,0.96907717],"study_design_scores_gemma":[0.00017852585,0.00014333999,0.0012332646,0.0005665621,0.000007910236,0.00013347546,0.0000012203817,0.5302684,0.004059944,0.4547884,0.007232928,0.0013860745],"about_ca_topic_score_codex":0.00006500156,"about_ca_topic_score_gemma":0.00042189236,"teacher_disagreement_score":0.9676911,"about_ca_system_score_codex":0.00030786125,"about_ca_system_score_gemma":0.00030042732,"threshold_uncertainty_score":0.9997954},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001132945,0.00014778505,0.98419976,0.0016225484,0.0022361814,0.00034591844,0.000006936818,0.000118673976,0.011208885],"genre_scores_gemma":[0.22045718,0.000025994932,0.7670193,0.008784227,0.00078688754,0.000019539902,0.000036857877,0.00004892334,0.0028211204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968648,0.00004389528,0.00047416348,0.0012463534,0.0009181018,0.0004526949],"domain_scores_gemma":[0.9976498,0.0007529708,0.0002227727,0.00093781034,0.00026855036,0.00016811039],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000642165,0.00042060704,0.00036012888,0.0011334695,0.0003065229,0.00042540272,0.0014128437,0.00024748454,0.000067261535],"category_scores_gemma":[0.00015031784,0.0004111754,0.00013063865,0.0008565943,0.0003727649,0.00037879377,0.00028468508,0.0005008861,0.000099764075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046257737,0.000040989642,0.0000034811144,0.000011062152,0.0000107600345,0.00004541904,0.00018938236,0.2389326,0.00013658957,0.44315234,0.00022356596,0.3172492],"study_design_scores_gemma":[0.00034063525,0.00018288403,0.00004013488,0.00011865458,0.0000056861536,0.000070899914,4.9097224e-8,0.45140293,0.00071294256,0.5441435,0.0024736405,0.000508035],"about_ca_topic_score_codex":0.0000019872002,"about_ca_topic_score_gemma":0.000010813342,"teacher_disagreement_score":0.31674117,"about_ca_system_score_codex":0.00022731218,"about_ca_system_score_gemma":0.00060203276,"threshold_uncertainty_score":0.999834},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028011278,0.000048376387,0.9956683,0.0006316256,0.000680518,0.00027606773,0.000064408196,0.00013832044,0.0024643613],"genre_scores_gemma":[0.15389252,0.000015981997,0.84208137,0.0018453326,0.00049051415,0.000014261881,0.00013252076,0.000028589378,0.001498926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973795,0.0000135633,0.0005389548,0.00087378913,0.0007173135,0.00047692453],"domain_scores_gemma":[0.9977031,0.0003694941,0.0003800517,0.0010587247,0.00038863323,0.00010000322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007302448,0.00038421995,0.00042836103,0.0010739333,0.00022025913,0.0008491616,0.002556967,0.00024063417,0.0000037843683],"category_scores_gemma":[0.00015489856,0.00035227143,0.00018155493,0.0005564455,0.00025285987,0.0023170302,0.0008462979,0.00048674276,0.000031802592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029684707,0.00003148107,0.000011129051,0.000060261857,0.000031477168,0.000010623948,0.0013209409,0.5016505,0.00011808508,0.013546544,0.0015695051,0.48161975],"study_design_scores_gemma":[0.00023581601,0.00007366631,0.0000051931397,0.00014513162,0.000012954163,0.000011170492,1.2309171e-7,0.9508705,0.00022676945,0.0452213,0.0028092337,0.00038814382],"about_ca_topic_score_codex":0.0000153199,"about_ca_topic_score_gemma":0.000039456103,"teacher_disagreement_score":0.4812316,"about_ca_system_score_codex":0.00028144772,"about_ca_system_score_gemma":0.0007068006,"threshold_uncertainty_score":0.99989295},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013117175,0.0008768267,0.9933781,0.00032603092,0.00082671334,0.0004918188,0.000013976518,0.0003012093,0.0036541661],"genre_scores_gemma":[0.098440334,0.000074597556,0.8984266,0.0011191772,0.00067393144,0.000029298022,0.000012319339,0.000084819505,0.0011389086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952508,0.000042956763,0.00063699356,0.0019021801,0.0012809976,0.00088607206],"domain_scores_gemma":[0.9965961,0.0004220073,0.0005291156,0.0019004504,0.00031086532,0.00024144707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005615116,0.00075071584,0.000772634,0.0007699924,0.00043420534,0.0004107319,0.002140204,0.00029590173,0.00003401738],"category_scores_gemma":[0.00008629491,0.00058396143,0.00012069391,0.00093398365,0.00083041936,0.0013550028,0.0011959882,0.0008777842,0.0000501717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025127782,0.00005343101,0.000989651,0.00018666161,0.0000490649,0.00072717184,0.0022594337,0.10154665,0.0001689307,0.092182085,0.000035624922,0.8017762],"study_design_scores_gemma":[0.00094042317,0.00035493792,0.0001979523,0.0022961546,0.000015269756,0.00051118835,9.4460523e-7,0.963019,0.0011015516,0.01851459,0.011167328,0.0018806559],"about_ca_topic_score_codex":0.000098165554,"about_ca_topic_score_gemma":0.0002453852,"teacher_disagreement_score":0.86147237,"about_ca_system_score_codex":0.00024358052,"about_ca_system_score_gemma":0.00031542388,"threshold_uncertainty_score":0.9996612},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023706406,0.00011607052,0.9725691,0.0015626508,0.00069808593,0.0008728402,0.000027589347,0.00022011365,0.00022715637],"genre_scores_gemma":[0.6403005,0.000002826366,0.358611,0.0008259846,0.00018252133,0.000005256821,0.0000073615106,0.00002740228,0.000037132013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956902,0.000085268344,0.00055396796,0.002159916,0.0007992873,0.0007113328],"domain_scores_gemma":[0.99597245,0.0009104782,0.00029382866,0.0018836155,0.00045751742,0.00048209503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021058721,0.00062670273,0.0006141053,0.00049169525,0.00074916845,0.0008027445,0.0014254326,0.00055209064,0.000012614248],"category_scores_gemma":[0.00024408638,0.0005554573,0.00006689913,0.0008537056,0.0007471998,0.0005627629,0.001155607,0.001637002,0.000008832894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015484325,0.00041596653,0.002349942,0.0008059283,0.000118213626,0.09822051,0.014875104,0.036786012,0.0063407915,0.01565974,0.0001505646,0.8227288],"study_design_scores_gemma":[0.0010616488,0.001722712,0.00028600454,0.00043258822,0.000046762354,0.04761553,0.0000014761043,0.89955133,0.0043079704,0.04153095,0.0015273292,0.0019157004],"about_ca_topic_score_codex":0.00019929686,"about_ca_topic_score_gemma":0.000507905,"teacher_disagreement_score":0.8627653,"about_ca_system_score_codex":0.00019591319,"about_ca_system_score_gemma":0.00054387504,"threshold_uncertainty_score":0.9996897},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008827095,0.0005572452,0.9858311,0.0012912448,0.0008650189,0.0011525956,0.0000050834265,0.0000986476,0.0013719805],"genre_scores_gemma":[0.9921213,0.000060544557,0.006210171,0.0012871277,0.00019632441,0.000042144587,6.764748e-7,0.000017410934,0.000064311476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687153,0.00025230358,0.0004455878,0.000972858,0.0010488287,0.0004089076],"domain_scores_gemma":[0.99678755,0.00092784985,0.00031902545,0.0014869036,0.00042108586,0.00005757645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013714863,0.00045088344,0.0004464467,0.00039989458,0.00069434865,0.00028869958,0.0043608216,0.00012723215,0.0000150841115],"category_scores_gemma":[0.00012897419,0.00021926085,0.00014923881,0.0012804357,0.0021146217,0.0002504933,0.0008164922,0.0007384335,0.000013814869],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002541969,0.0006140605,0.00015240362,0.000048979236,0.00032069828,0.00030957794,0.06089141,0.032031238,0.002277596,0.06938781,0.00028101762,0.833431],"study_design_scores_gemma":[0.003381264,0.006822483,0.00097542803,0.0026290417,0.00013713153,0.0006722316,0.000068982736,0.47278187,0.05709432,0.44766378,0.0037268528,0.004046594],"about_ca_topic_score_codex":0.000030441717,"about_ca_topic_score_gemma":0.00005058054,"teacher_disagreement_score":0.9832942,"about_ca_system_score_codex":0.000055960656,"about_ca_system_score_gemma":0.00039557624,"threshold_uncertainty_score":0.89411986},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014148305,0.00044289822,0.9904579,0.00023443103,0.0023927775,0.0008910766,0.00006768303,0.00023684248,0.0051349453],"genre_scores_gemma":[0.26636106,0.000041775496,0.7302884,0.0015637594,0.00072659337,0.000064144086,0.0000654549,0.000076085504,0.00081275165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955034,0.000053644333,0.0007806178,0.0020268108,0.0007822762,0.0008532459],"domain_scores_gemma":[0.9964338,0.0007736129,0.00061985897,0.001544104,0.0004103245,0.00021829116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010875422,0.0006754889,0.0007764956,0.0006503821,0.0004198884,0.0004518929,0.0037526377,0.00042338143,0.000007265726],"category_scores_gemma":[0.00012944454,0.0005770266,0.00023121583,0.00040415843,0.0005785592,0.00086545694,0.001624892,0.0006044929,0.000027550917],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014891404,0.00013209318,0.00001444278,0.00007726561,0.000029658895,0.00006441492,0.005959451,0.0034827618,0.0022837385,0.07671693,0.00047474366,0.91061556],"study_design_scores_gemma":[0.0014465146,0.0008210384,0.00036094387,0.00148714,0.00002744912,0.000073511124,0.0000012744281,0.5377485,0.08714848,0.36525208,0.0039202566,0.0017128132],"about_ca_topic_score_codex":0.000017093884,"about_ca_topic_score_gemma":0.000015357347,"teacher_disagreement_score":0.90890276,"about_ca_system_score_codex":0.00028587776,"about_ca_system_score_gemma":0.00039570557,"threshold_uncertainty_score":0.9996681},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001597951,0.000264157,0.99428695,0.00081441604,0.001340123,0.00043829466,0.000004354895,0.00022608049,0.0026096138],"genre_scores_gemma":[0.04365973,0.0000626628,0.95372796,0.00080661033,0.0009318292,0.000028455886,0.000011707745,0.000039448725,0.00073159987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969421,0.00002500024,0.0003904582,0.0014679601,0.0006193801,0.0005550825],"domain_scores_gemma":[0.9976751,0.0006752942,0.0002869774,0.00091030565,0.00032894468,0.00012338645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006444544,0.0003988088,0.00039946949,0.0006316112,0.00047195167,0.0003269762,0.002194236,0.0002616772,0.000004222409],"category_scores_gemma":[0.0001757804,0.00037328256,0.00014188419,0.0004944359,0.0003401912,0.0003652441,0.00044124256,0.00076973805,0.000024348836],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042252727,0.000018121764,0.000031443775,0.000026698961,0.000008761932,0.0000072192943,0.0007818831,0.021103406,0.00014670029,0.0125850625,0.00007822453,0.96520823],"study_design_scores_gemma":[0.00021377066,0.00016598347,0.00030234415,0.00014170876,0.000003935675,0.000053718537,7.2828925e-8,0.9297732,0.00034314548,0.060425162,0.008084892,0.0004920604],"about_ca_topic_score_codex":0.000013276839,"about_ca_topic_score_gemma":0.0000119436145,"teacher_disagreement_score":0.9647162,"about_ca_system_score_codex":0.00026697977,"about_ca_system_score_gemma":0.0005242587,"threshold_uncertainty_score":0.9998719},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2866675,0.00006205882,0.69702137,0.000031674637,0.0004038935,0.0004587669,0.0000023355522,0.00017228049,0.015180155],"genre_scores_gemma":[0.9372915,0.0000012166417,0.060422767,0.000049962768,0.00022334614,0.000012170688,0.000007934559,0.00005627311,0.0019348194],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9966034,0.0005483952,0.00048027988,0.0010795295,0.00067016185,0.0006182026],"domain_scores_gemma":[0.9974994,0.00090928696,0.0006415852,0.0005295232,0.00032208246,0.000098110126],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012803735,0.00062595506,0.0008091621,0.00067132903,0.00023004405,0.00016259668,0.0006641598,0.0003536378,0.0005484883],"category_scores_gemma":[0.0001037585,0.0003926537,0.00016866287,0.00036645564,0.0006542711,0.00013675191,0.00016765512,0.0025191198,0.00003676469],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005583247,0.00053821545,0.006008099,0.00009722319,0.0010469739,0.00015530728,0.051922206,0.23104116,0.0010730296,0.051243436,0.0000300916,0.65628594],"study_design_scores_gemma":[0.0048609725,0.03732215,0.6993916,0.005059304,0.00041437463,0.00035145396,0.00013750172,0.20010144,0.00086839346,0.04481675,0.0013079833,0.005368101],"about_ca_topic_score_codex":0.00011572073,"about_ca_topic_score_gemma":0.0000060682582,"teacher_disagreement_score":0.69338346,"about_ca_system_score_codex":0.00027782944,"about_ca_system_score_gemma":0.00029532757,"threshold_uncertainty_score":0.99985254},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029544955,0.00073193124,0.9884439,0.00041089926,0.0006417535,0.00039313413,0.000018212208,0.00023785909,0.00909273],"genre_scores_gemma":[0.034108963,0.0003572561,0.96278876,0.001144491,0.00031695297,0.000012677754,0.000027504135,0.000049306516,0.0011940903],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965896,0.00003845663,0.0006248592,0.001160605,0.0010578465,0.0005286163],"domain_scores_gemma":[0.9973307,0.00038175093,0.0005229087,0.0010680414,0.0005474939,0.00014908961],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012218127,0.0004289338,0.0005182628,0.0007302196,0.00014550559,0.0002217731,0.0023126625,0.0004090931,0.000032701388],"category_scores_gemma":[0.0000817741,0.00039803647,0.00014581082,0.000788897,0.0008327997,0.0005356458,0.0005072881,0.0006350084,0.00003474291],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008372107,0.000038006274,0.000015707607,0.00003739319,0.000007309383,0.000012703627,0.0002980347,0.000022883583,0.004635166,0.00247266,0.00007785281,0.9923739],"study_design_scores_gemma":[0.00054028357,0.0006791414,0.000119545206,0.0009835665,0.000025400308,0.000098112214,8.4288445e-7,0.06563418,0.7796141,0.14013906,0.010537013,0.0016287661],"about_ca_topic_score_codex":0.000037387286,"about_ca_topic_score_gemma":0.000028951303,"teacher_disagreement_score":0.9907451,"about_ca_system_score_codex":0.00024788026,"about_ca_system_score_gemma":0.00036734217,"threshold_uncertainty_score":0.9998472},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006932547,0.00030209916,0.96864945,0.023151191,0.0031271635,0.0011738819,0.000008227295,0.0008131273,0.0020815895],"genre_scores_gemma":[0.3408403,0.0000124420285,0.6492606,0.007893633,0.0007947058,0.00003654998,0.000011430392,0.00008208329,0.0010682887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9892659,0.00008834215,0.0011697543,0.0036420717,0.0035078332,0.002326056],"domain_scores_gemma":[0.99430066,0.00065532565,0.000303211,0.003416688,0.0006868866,0.0006372286],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024435513,0.0012413121,0.001274979,0.0033507114,0.0003209477,0.0010298254,0.010534058,0.0010979614,0.000014432218],"category_scores_gemma":[0.00069166225,0.0011580173,0.00024105361,0.00399522,0.00087722763,0.00031480496,0.004745736,0.0031134712,0.000104176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011193332,0.000026939633,0.00003030225,0.000005505464,0.000004995971,0.00018303854,0.00038537217,0.5236127,0.000025776326,0.01215746,0.0002866407,0.46327007],"study_design_scores_gemma":[0.00043358761,0.0004466219,0.0012919831,0.0005508928,0.000007148926,0.00013819581,3.7567068e-7,0.85623133,0.00021341791,0.12833233,0.01083115,0.0015229748],"about_ca_topic_score_codex":0.000039788192,"about_ca_topic_score_gemma":0.0003467505,"teacher_disagreement_score":0.4617471,"about_ca_system_score_codex":0.0010549992,"about_ca_system_score_gemma":0.00063504704,"threshold_uncertainty_score":0.9991864},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035608048,0.0077651227,0.97987,0.0004991281,0.00298464,0.0006365982,0.0000037816517,0.00023941582,0.004440508],"genre_scores_gemma":[0.9705483,0.000014205444,0.028436262,0.00030928763,0.0004571859,0.000010501274,0.000004516035,0.000021464346,0.0001982872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966394,0.00008350471,0.0005785675,0.0012834871,0.000770409,0.0006446637],"domain_scores_gemma":[0.9976643,0.0006192734,0.00029348943,0.0012228794,0.000109925786,0.00009016484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015139728,0.0004174814,0.00048098652,0.00091510953,0.000270334,0.0007454478,0.002220046,0.00022407959,9.0693754e-7],"category_scores_gemma":[0.000102389036,0.0002978449,0.000115807336,0.0009668647,0.00047050396,0.00042121127,0.0010435032,0.0008852486,0.0000072899293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026183427,0.00005258589,0.0047046985,0.00059295044,0.000042150776,0.0017033425,0.0071268124,0.029254327,0.0012067471,0.077968165,0.0002273571,0.8770947],"study_design_scores_gemma":[0.0007384096,0.000099046236,0.0027484684,0.0021110869,0.000012781859,0.00066799176,0.0000091692145,0.9598402,0.0012604755,0.03098491,0.00035179965,0.001175657],"about_ca_topic_score_codex":0.0009815325,"about_ca_topic_score_gemma":0.0010653874,"teacher_disagreement_score":0.9669875,"about_ca_system_score_codex":0.00014664188,"about_ca_system_score_gemma":0.00016779704,"threshold_uncertainty_score":0.99994737},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019875872,0.0013697853,0.9920204,0.000074077136,0.00047448286,0.0054512257,0.0000050966546,0.00008888568,0.00031724892],"genre_scores_gemma":[0.45013765,0.00030900553,0.54648095,0.0006427304,0.00074738386,0.0014489554,0.000014601634,0.00006985026,0.00014885473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961029,0.0000366152,0.0008040537,0.001405708,0.00072562724,0.00092507905],"domain_scores_gemma":[0.9963954,0.00082580437,0.00069644366,0.0015499908,0.00032165265,0.0002106702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017841726,0.0005419209,0.001010943,0.00092383625,0.00026388277,0.00031839235,0.0026777857,0.00040204226,0.000011555857],"category_scores_gemma":[0.00005249453,0.0004925912,0.0002397567,0.0014995108,0.00061167864,0.0007400587,0.0014415596,0.0006255651,0.000001962582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001189639,0.000018402208,0.000797434,0.00006581444,0.00007761893,0.000002289995,0.00037371958,0.19746473,0.000013833052,0.0035164352,0.0000059540844,0.7976519],"study_design_scores_gemma":[0.00024888743,0.00025000345,0.001263534,0.00042281026,0.00010423355,0.000010574425,9.614643e-8,0.99304336,0.00011309052,0.002739295,0.0012882797,0.0005158614],"about_ca_topic_score_codex":0.000003406708,"about_ca_topic_score_gemma":0.00004266364,"teacher_disagreement_score":0.797136,"about_ca_system_score_codex":0.00016070924,"about_ca_system_score_gemma":0.00022618743,"threshold_uncertainty_score":0.9997526},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038121137,0.00038766945,0.9914629,0.0056054145,0.00085354695,0.00028403246,0.00009248239,0.00014700854,0.00078576506],"genre_scores_gemma":[0.061649013,0.00009972451,0.92472017,0.010758099,0.0022856386,0.000029906161,0.00007441646,0.000052724536,0.00033029047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965734,0.00003141734,0.0005051002,0.001420367,0.0008526213,0.00061710883],"domain_scores_gemma":[0.99670917,0.0007808671,0.0003227069,0.0019424692,0.00010807613,0.00013673275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080631254,0.00042547385,0.0003325776,0.00019730347,0.00041677285,0.0010298437,0.0051365085,0.00019908638,0.00004516138],"category_scores_gemma":[0.000059485435,0.00031736135,0.00011608523,0.00026802902,0.0002975991,0.0005426779,0.0017364322,0.0009000446,0.000082189545],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.555982e-7,0.00001735688,0.00033072048,0.000005198506,0.00001577319,0.000023933113,0.0015670508,0.004101165,0.00005449646,0.0075929845,0.00021342738,0.98607725],"study_design_scores_gemma":[0.000285978,0.000086518055,0.0012889301,0.00065018766,0.000024546713,0.000020437457,0.0000012056393,0.8130358,0.00074895244,0.15475877,0.028050508,0.0010482088],"about_ca_topic_score_codex":0.0002303369,"about_ca_topic_score_gemma":0.00041674936,"teacher_disagreement_score":0.98502904,"about_ca_system_score_codex":0.00022268138,"about_ca_system_score_gemma":0.00025829475,"threshold_uncertainty_score":0.9999278},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010805446,0.00036982048,0.9927388,0.0012572247,0.00087035215,0.0008615615,0.000013030577,0.00044352046,0.0034349114],"genre_scores_gemma":[0.004259827,0.00014399487,0.987385,0.0029482255,0.00054610235,0.000017122637,0.000013477504,0.00005179842,0.0046344614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959647,0.00002545387,0.0006276655,0.0016771938,0.0009308557,0.00077411975],"domain_scores_gemma":[0.99712205,0.00035210667,0.00037565865,0.0015036457,0.00044686205,0.0001996779],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097889,0.000559037,0.0005574012,0.00064226176,0.00042571148,0.0006113249,0.00338085,0.00039310977,0.000032953223],"category_scores_gemma":[0.00014461849,0.0005219913,0.00023839298,0.0006170039,0.0005755944,0.000902088,0.0012479511,0.0005559088,0.000051845036],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000501907,0.000039144346,0.000003207667,0.00008047612,0.0000097779175,0.00007452299,0.00027914238,0.00020690786,0.01286346,0.004577195,0.00024271633,0.9815733],"study_design_scores_gemma":[0.0006492917,0.0006093546,0.00012710712,0.00050374144,0.00001722542,0.00019913318,1.444282e-7,0.6149678,0.22148022,0.13192521,0.027933637,0.0015871002],"about_ca_topic_score_codex":0.0000053483705,"about_ca_topic_score_gemma":0.000012246728,"teacher_disagreement_score":0.97998613,"about_ca_system_score_codex":0.0006662232,"about_ca_system_score_gemma":0.00038505488,"threshold_uncertainty_score":0.99972314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014898756,0.00014213342,0.99359727,0.00089706655,0.0009876712,0.0003094962,0.000024784831,0.00007947189,0.0024722337],"genre_scores_gemma":[0.58689904,0.00012861376,0.41090894,0.0007025244,0.0006849082,0.000004242535,0.000035842357,0.000032624022,0.0006032631],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954227,0.000045302942,0.0009815741,0.0015502269,0.0013692797,0.00063087186],"domain_scores_gemma":[0.99673456,0.00036949027,0.00058295403,0.0018181301,0.0002527521,0.00024211776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059146323,0.00053586846,0.0007043184,0.0016126424,0.0002680684,0.00052766065,0.0029173195,0.00026687034,0.00006064342],"category_scores_gemma":[0.000060843115,0.00047901506,0.00032907026,0.001413261,0.00036320693,0.0003987366,0.00057365745,0.00065652735,0.0000125201395],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003768892,0.000082025734,0.000016656417,0.000019087774,0.000042497726,0.000032635897,0.0013644436,0.004056903,0.00063675107,0.07542301,0.00021205025,0.9180763],"study_design_scores_gemma":[0.00224488,0.0018514938,0.001737954,0.0007942716,0.000109756686,0.00005245266,0.0000012389438,0.19632122,0.013612462,0.77693415,0.004397838,0.0019423113],"about_ca_topic_score_codex":0.00025807426,"about_ca_topic_score_gemma":0.0003166171,"teacher_disagreement_score":0.91613394,"about_ca_system_score_codex":0.00019577713,"about_ca_system_score_gemma":0.0006817646,"threshold_uncertainty_score":0.9997662},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061817286,0.00028328574,0.9904306,0.000041695366,0.00084186374,0.0002791309,0.000001037445,0.00008501401,0.0018556241],"genre_scores_gemma":[0.9106268,0.000043877728,0.085966125,0.00014658998,0.00039851788,0.000019478639,0.0000116410765,0.0000624016,0.0027245248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663836,0.00011619221,0.00076360133,0.0010606997,0.00089756283,0.00052356796],"domain_scores_gemma":[0.998404,0.00032007584,0.0005339557,0.0005969251,0.00007190029,0.000073110925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012582192,0.00041276184,0.00055263523,0.0010173513,0.00013422423,0.00016926428,0.0013074367,0.00026941265,0.00002504529],"category_scores_gemma":[0.000083975065,0.0004080252,0.000115866475,0.00042863563,0.00028621397,0.00062451296,0.00058853923,0.0010611574,0.00008322692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034023942,0.000059927585,0.000640488,0.00011598688,0.000011168523,0.000107494685,0.0023594978,0.21475632,0.00080666563,0.006416817,0.000006395549,0.77471584],"study_design_scores_gemma":[0.0006085196,0.00050308503,0.0020198869,0.0038824158,0.0000128046195,0.000051565847,0.0000053998997,0.93813163,0.004775752,0.042251494,0.006264074,0.0014933692],"about_ca_topic_score_codex":0.000058015656,"about_ca_topic_score_gemma":0.000024747367,"teacher_disagreement_score":0.9044645,"about_ca_system_score_codex":0.00038695053,"about_ca_system_score_gemma":0.00016466976,"threshold_uncertainty_score":0.99983716},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057436344,0.00008668845,0.9914263,0.000250576,0.0011713996,0.00034125903,0.0000021878147,0.00007302954,0.00090492197],"genre_scores_gemma":[0.7324814,0.000008775162,0.26684728,0.0004295958,0.00018555929,0.0000062643876,0.00000804581,0.000013699074,0.0000193654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729234,0.0000755945,0.0005444675,0.0011365723,0.00057934696,0.0003716869],"domain_scores_gemma":[0.9984871,0.00039835356,0.00034855778,0.00047922254,0.00015305547,0.00013368977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011326671,0.00034637906,0.0003421554,0.00085181015,0.00017773343,0.00058723416,0.0007804179,0.00020485425,0.000026267615],"category_scores_gemma":[0.000098912264,0.0003336046,0.00005526216,0.00033842807,0.0002360746,0.001011583,0.00027495666,0.00059394154,0.000004836989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015489843,0.00006917654,0.0052248156,0.000088243934,0.000010876944,0.00015178083,0.0035628846,0.116005346,0.0025056407,0.06734034,0.000006017555,0.8050194],"study_design_scores_gemma":[0.0003326857,0.00009210534,0.0010949656,0.0008825657,0.0000029427954,0.000058159203,0.000002618747,0.9913272,0.00053598,0.0050985953,0.00021631323,0.00035584223],"about_ca_topic_score_codex":0.00015830275,"about_ca_topic_score_gemma":0.00038915055,"teacher_disagreement_score":0.87532187,"about_ca_system_score_codex":0.0004895807,"about_ca_system_score_gemma":0.0002993402,"threshold_uncertainty_score":0.9999116},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031677997,0.000022862923,0.99344116,0.003360741,0.00022902274,0.001073072,0.0000080137315,0.000124562,0.0014237524],"genre_scores_gemma":[0.8476213,0.00009149456,0.15036309,0.0014089303,0.00013085174,0.00022466113,0.000046001147,0.000032867774,0.00008080095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734277,0.000092510294,0.0005513294,0.0010967727,0.0006031476,0.00031345876],"domain_scores_gemma":[0.9963943,0.0008827365,0.0005940455,0.001816139,0.00026161212,0.000051171883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009369107,0.00034921992,0.00036137886,0.0006383021,0.0001134103,0.0001890728,0.002868907,0.00022057483,0.000014881773],"category_scores_gemma":[0.00012096771,0.00025455712,0.00007751383,0.0007587006,0.00048166647,0.00056218886,0.00034960068,0.0006648194,0.000067264176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003851856,0.00010067792,0.000020018439,0.0000076233728,0.0000027579574,3.275512e-7,0.00028401974,0.00078896125,0.0031075187,0.21561696,0.000047543523,0.78001976],"study_design_scores_gemma":[0.0001894988,0.00009742373,0.0010750043,0.00008738788,0.0000011524392,0.0000017809929,2.8451691e-7,0.8501178,0.010377266,0.13656293,0.0012354578,0.00025401957],"about_ca_topic_score_codex":0.0000315768,"about_ca_topic_score_gemma":0.000024429426,"teacher_disagreement_score":0.8493288,"about_ca_system_score_codex":0.00033756407,"about_ca_system_score_gemma":0.00019608715,"threshold_uncertainty_score":0.99999064},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022368868,0.00019675151,0.99621826,0.00016849444,0.0003529335,0.00088634685,0.000013278515,0.00092569605,0.0010145465],"genre_scores_gemma":[0.020153558,0.000026477857,0.97898513,0.0004045661,0.00019639597,0.00007931692,0.000016407548,0.00005454565,0.00008358365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960408,0.000025427767,0.0005971523,0.00158084,0.0010292853,0.000726483],"domain_scores_gemma":[0.99763334,0.00013978817,0.0001661716,0.0015751446,0.00022108437,0.00026449343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042949838,0.00063433923,0.0005459399,0.00081756775,0.00018826069,0.0008109859,0.0038498663,0.000393018,0.0000076811075],"category_scores_gemma":[0.000013640238,0.0006125461,0.00013484908,0.00039391225,0.00023188622,0.00085785135,0.00091615785,0.0007154146,0.0000672636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.415404e-7,0.000012259482,0.000002625375,0.000017747274,0.000004809195,0.0000023865325,0.0013088271,0.39521733,0.00006832707,0.030542871,0.000010933413,0.57281107],"study_design_scores_gemma":[0.00008739323,0.000061292325,0.000045871002,0.00018411294,0.000006046558,0.000011994252,6.97437e-8,0.9173913,0.00048381565,0.07648492,0.004590876,0.00065231137],"about_ca_topic_score_codex":0.00014461043,"about_ca_topic_score_gemma":0.000018264382,"teacher_disagreement_score":0.57215875,"about_ca_system_score_codex":0.00028961408,"about_ca_system_score_gemma":0.0002340971,"threshold_uncertainty_score":0.9996326},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010666184,0.0015856927,0.99530643,0.00014746039,0.0005922461,0.00061833323,0.0000024993417,0.000339421,0.0003413107],"genre_scores_gemma":[0.027852945,0.000030646657,0.9704267,0.0013412767,0.00025438142,0.000008296415,0.0000048449683,0.000036775255,0.00004413218],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636054,0.000057708134,0.000505005,0.0016033022,0.00074580265,0.00072764716],"domain_scores_gemma":[0.99830884,0.0001696158,0.00029853097,0.0007917947,0.00020533241,0.00022590574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001327304,0.00054671953,0.00047764112,0.0013179528,0.00032443178,0.0009301606,0.0019807895,0.00030063567,0.0000040060418],"category_scores_gemma":[0.00008775787,0.0004976941,0.000072236006,0.00090460904,0.00031978104,0.00087304105,0.0011401888,0.0006964801,0.0000036340002],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015196508,0.000032655385,0.00007942718,0.00010987346,0.000016189488,0.00010884331,0.0019241499,0.003713365,0.023413809,0.050231993,0.000007038247,0.92034745],"study_design_scores_gemma":[0.00044174775,0.00013188238,0.000034531473,0.00070968375,0.000021192815,0.00025810066,7.08957e-7,0.42811632,0.02812231,0.5407789,0.00008584222,0.0012987825],"about_ca_topic_score_codex":0.00006448134,"about_ca_topic_score_gemma":0.000016889153,"teacher_disagreement_score":0.91904867,"about_ca_system_score_codex":0.00057535013,"about_ca_system_score_gemma":0.00026310908,"threshold_uncertainty_score":0.99974746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009502725,0.0003505618,0.99593514,0.00024639847,0.0004856333,0.0010186342,0.0000042447878,0.00028618454,0.00072294305],"genre_scores_gemma":[0.028973192,0.00016484708,0.9698581,0.00039310372,0.00017851724,0.00004436706,0.0000043536797,0.000051432893,0.00033206763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965791,0.000030858748,0.00059111795,0.0015856733,0.00038745173,0.0008258124],"domain_scores_gemma":[0.9978992,0.0006461171,0.0002826826,0.00082172954,0.00018886285,0.0001614277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010484922,0.00054716953,0.0006703502,0.0009594094,0.0002494871,0.00053670775,0.002037578,0.00031449427,0.0000074548666],"category_scores_gemma":[0.000134704,0.0004998458,0.00009938268,0.0006215709,0.0005205729,0.0013658776,0.0010138482,0.0006139252,0.0000041463495],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009792288,0.000023116998,0.0000049199894,0.000065054155,0.000004075587,0.000028338849,0.0013169822,0.0070062624,0.0065932544,0.0035319848,0.0000099478075,0.9814063],"study_design_scores_gemma":[0.00035023614,0.0003835836,0.000050911152,0.0006353976,0.0000052727987,0.00004963908,0.0000010574537,0.8532684,0.0032146643,0.14100038,0.00025969488,0.00078080036],"about_ca_topic_score_codex":0.00004381352,"about_ca_topic_score_gemma":0.000014331391,"teacher_disagreement_score":0.98062545,"about_ca_system_score_codex":0.00024914683,"about_ca_system_score_gemma":0.0003413226,"threshold_uncertainty_score":0.9997453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31033465,0.0000036689798,0.68791336,0.0009955248,0.00003891086,0.00068646227,0.0000029784985,0.000021919805,0.0000025096424],"genre_scores_gemma":[0.6137997,0.0000031495197,0.3858455,0.00019139441,0.000057940462,0.000081569706,0.000017803248,0.000002672909,2.3096638e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938875,0.000004624772,0.00018700292,0.00020289476,0.00012254501,0.000094203926],"domain_scores_gemma":[0.99941754,0.000064170046,0.00008333167,0.00017400953,0.00021687463,0.00004404655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021722453,0.000061618855,0.00009789265,0.00012122639,0.000063221596,0.000019172956,0.00007154088,0.00006115504,6.395379e-7],"category_scores_gemma":[0.00019329827,0.000055290315,0.000017244485,0.00039709432,0.00005823412,0.00016804448,0.00002532011,0.00008187753,4.4124135e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002601017,0.000027473248,0.0003330523,0.00003067625,6.0908764e-7,7.182355e-8,0.00018393823,0.00683897,0.673222,0.0010371847,0.0000018739707,0.31829813],"study_design_scores_gemma":[0.00019295301,0.00014748452,0.004107071,0.00001905306,0.000005869437,0.00000970185,4.7761927e-7,0.73973984,0.2512959,0.0043806923,0.000045854285,0.000055100492],"about_ca_topic_score_codex":0.000007808448,"about_ca_topic_score_gemma":0.000021344342,"teacher_disagreement_score":0.73290086,"about_ca_system_score_codex":0.000019713985,"about_ca_system_score_gemma":0.000039551473,"threshold_uncertainty_score":0.22546737},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014426372,0.0016037973,0.91070163,0.03102968,0.0023486814,0.000548871,0.000028352833,0.00012764912,0.053609915],"genre_scores_gemma":[0.43778655,0.0064436183,0.49878705,0.023132449,0.016457723,0.000089017245,0.0013722691,0.00018501448,0.015746301],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99625766,0.00017662875,0.0006495472,0.0012725638,0.0012291197,0.00041450505],"domain_scores_gemma":[0.9975815,0.00017284138,0.0004593053,0.0013040773,0.0003931162,0.00008916454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029647485,0.00042112317,0.00037537672,0.00032135475,0.00036459393,0.0010304865,0.0042416104,0.00010690472,0.000014387312],"category_scores_gemma":[0.00011816171,0.00032315633,0.000091945076,0.0005729977,0.00035790654,0.0006832014,0.0023017118,0.000618148,0.000057979723],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023881669,0.000025900117,0.00001497365,0.00018770588,0.00003663867,0.000022253747,0.0006084386,0.0022683984,0.0000038955095,0.11572466,0.005818699,0.87528604],"study_design_scores_gemma":[0.0002437152,0.00006528592,0.00061853323,0.0020107878,0.00003855331,0.0001500065,5.8785e-7,0.0919813,0.000007392996,0.032211557,0.8720623,0.00060992833],"about_ca_topic_score_codex":0.00005953507,"about_ca_topic_score_gemma":0.000027495304,"teacher_disagreement_score":0.8746761,"about_ca_system_score_codex":0.00033335693,"about_ca_system_score_gemma":0.000084452346,"threshold_uncertainty_score":0.99992204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045059095,0.0017644195,0.9444992,0.00051045953,0.004370785,0.0006180372,0.000011268583,0.00009117242,0.04362876],"genre_scores_gemma":[0.99807024,0.000013711542,0.00071031327,0.00072958076,0.00007577526,0.0000032084931,2.3559106e-7,0.000023759863,0.0003732034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987604,0.00004134069,0.00022497795,0.00028038598,0.00045999087,0.00023291672],"domain_scores_gemma":[0.9983998,0.0006795424,0.00007970599,0.0007688796,0.000039895214,0.000032164167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000646522,0.00023261557,0.0002286243,0.00024165768,0.000111081616,0.000058640137,0.0012934393,0.00014045408,0.000027626342],"category_scores_gemma":[0.000085223335,0.0001272937,0.000104099316,0.00064749666,0.00035290228,0.000046493024,0.000114874645,0.00053204794,0.000016362335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005969319,0.00001841756,0.00005372601,0.0001395875,0.000055549524,0.00000890879,0.0013752247,0.6305332,0.0005504001,0.29847494,0.000276979,0.06850707],"study_design_scores_gemma":[0.00046919184,0.00025625134,0.00056764414,0.0020198636,0.00007636196,0.000104823026,0.0000046391992,0.23191848,0.04222663,0.70457757,0.016161008,0.0016175513],"about_ca_topic_score_codex":0.0000035463152,"about_ca_topic_score_gemma":0.000007832019,"teacher_disagreement_score":0.9935643,"about_ca_system_score_codex":0.00005987429,"about_ca_system_score_gemma":0.00003259798,"threshold_uncertainty_score":0.5190886},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059483606,0.00013159626,0.9924421,0.00056795863,0.00083133637,0.00051536557,0.000002821044,0.00019530463,0.005254068],"genre_scores_gemma":[0.1771506,0.0002775517,0.8216033,0.0006916975,0.00014999024,0.000018070856,0.000022446895,0.000030210462,0.000056133238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968939,0.00004605751,0.00069069955,0.0011919555,0.00067894266,0.000498486],"domain_scores_gemma":[0.99844843,0.00024043249,0.00033583838,0.0006249963,0.00022152474,0.00012879731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005415296,0.00041203896,0.00039992738,0.0012873651,0.00023673031,0.00036621085,0.0010416874,0.0002919029,0.00004558537],"category_scores_gemma":[0.00006526951,0.0004412878,0.00008852251,0.00074740715,0.0005193086,0.0009970495,0.0003944342,0.0006409905,0.000017653741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014731515,0.000014286868,0.0000885317,0.000012407232,0.0000022977508,0.000038195285,0.00055677537,0.72299,0.000028748054,0.0024914662,0.000004106465,0.27377176],"study_design_scores_gemma":[0.00036310742,0.000063695,0.00016815343,0.00045068515,0.0000024771603,0.00022217866,4.0084058e-7,0.9882269,0.00016987274,0.0097495485,0.00009221045,0.0004907574],"about_ca_topic_score_codex":0.000021600155,"about_ca_topic_score_gemma":0.00011301695,"teacher_disagreement_score":0.273281,"about_ca_system_score_codex":0.00051042956,"about_ca_system_score_gemma":0.0005343039,"threshold_uncertainty_score":0.9998039},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004937867,0.0003351692,0.9972647,0.00003744615,0.00066325924,0.00044266856,0.0000042713746,0.00005784369,0.00070085],"genre_scores_gemma":[0.9883112,0.000029428287,0.011234414,0.000059889564,0.00022774673,0.000007370486,0.0000024405197,0.00002165565,0.00010589096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999168,0.000004526984,0.00025816367,0.00021962482,0.00021393347,0.0001357689],"domain_scores_gemma":[0.99910456,0.00046727425,0.00006758631,0.00019724517,0.0001409657,0.000022363818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001349237,0.00016177901,0.00018040082,0.0001790261,0.00007689484,0.00007241143,0.0002476095,0.00011217541,0.00001376892],"category_scores_gemma":[0.000032681648,0.000121814475,0.00005316379,0.00008826713,0.00008634554,0.00011563144,0.000026171856,0.00017649034,0.0000036532622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042619868,0.0000031064462,0.0000010561905,0.00005923667,0.000007755296,7.3703956e-7,0.0016215949,0.95296234,0.00023079634,0.00019430903,0.000003148069,0.044911653],"study_design_scores_gemma":[0.000058850404,0.00003879726,0.0000028840886,0.00020033591,0.000007788679,0.000019907488,0.0000012273264,0.99716175,0.000300331,0.0017989611,0.00027839286,0.00013077789],"about_ca_topic_score_codex":0.000007942997,"about_ca_topic_score_gemma":0.000026520418,"teacher_disagreement_score":0.9878174,"about_ca_system_score_codex":0.00010291596,"about_ca_system_score_gemma":0.0000366057,"threshold_uncertainty_score":0.49674502},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004283881,0.00085485424,0.9868064,0.00019984711,0.0021654416,0.00030454263,6.0252745e-7,0.00029394918,0.009331549],"genre_scores_gemma":[0.77601886,0.000028995606,0.21888705,0.00040619305,0.001390284,0.0000104339715,0.0000025142558,0.00006203563,0.0031936732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959895,0.00006853123,0.00057973596,0.0017216639,0.0007061019,0.00093444064],"domain_scores_gemma":[0.9974254,0.00046532875,0.00031039573,0.0012674467,0.00034686943,0.00018455577],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011589178,0.00068406324,0.0007194468,0.0006747742,0.00048248752,0.00076359615,0.0028810638,0.00039491212,0.000009024907],"category_scores_gemma":[0.00006065336,0.0005416141,0.0001450683,0.00046976266,0.00042134768,0.0004404242,0.0009126118,0.0012798224,0.000028373712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035947212,0.000009059797,0.000029920397,0.000026513957,0.000010766319,0.00003621089,0.0010456088,0.68538165,0.000003935886,0.14429381,0.0000038367643,0.16915509],"study_design_scores_gemma":[0.00013676344,0.00024587687,0.000008573607,0.00085997424,0.00000779302,0.0000841977,0.0000012467085,0.96344167,0.0000959889,0.033017244,0.0013880918,0.0007125818],"about_ca_topic_score_codex":0.000042210595,"about_ca_topic_score_gemma":0.00010677163,"teacher_disagreement_score":0.775976,"about_ca_system_score_codex":0.00029399747,"about_ca_system_score_gemma":0.000364955,"threshold_uncertainty_score":0.9997035},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009851739,0.00044762116,0.99301165,0.0012728145,0.0010323714,0.001363624,0.00000971124,0.00018053842,0.0025831615],"genre_scores_gemma":[0.2054453,0.00014848486,0.78937477,0.0016235816,0.00092399714,0.0001522268,0.0000109080365,0.0001261978,0.0021945448],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950543,0.00010329543,0.00065993966,0.0019320583,0.00102087,0.0012295198],"domain_scores_gemma":[0.99473214,0.0022786492,0.00034943843,0.002076795,0.00035914363,0.0002038454],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0031595957,0.000646467,0.0005850794,0.00064571435,0.00078683085,0.0008492443,0.0070516476,0.00032266488,0.00001931454],"category_scores_gemma":[0.00033154956,0.00046424582,0.00028943658,0.0008988336,0.0013200045,0.0005389837,0.0014839303,0.0015597605,0.000027426995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112886155,0.00003596188,0.000049191276,0.00011643247,0.000023346978,0.000028944767,0.0019839953,0.035225615,0.00020000254,0.22215748,0.000019759978,0.740148],"study_design_scores_gemma":[0.0002289066,0.0001617755,0.000035261906,0.00037093653,0.0000062071763,0.000047555834,3.8809623e-7,0.39609373,0.00065601943,0.6000949,0.0017908844,0.00051343633],"about_ca_topic_score_codex":0.000014253227,"about_ca_topic_score_gemma":0.000103175465,"teacher_disagreement_score":0.7396346,"about_ca_system_score_codex":0.00036973823,"about_ca_system_score_gemma":0.00030263522,"threshold_uncertainty_score":0.99978095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007873575,0.00039452798,0.996095,0.00014663058,0.0011216354,0.00047282295,0.00047765978,0.00013609628,0.0003682659],"genre_scores_gemma":[0.10422744,0.000049368857,0.8941252,0.00020403073,0.0006330207,0.000011812774,0.0004496523,0.00005797622,0.00024145374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99481905,0.00006905876,0.0008979181,0.0021769733,0.0013984169,0.00063859817],"domain_scores_gemma":[0.99444425,0.00023962233,0.0006884001,0.0041356036,0.00034005017,0.00015205191],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006713198,0.0006841275,0.0009287027,0.000569909,0.00022552667,0.00022784564,0.0048270635,0.00027823026,0.00003584599],"category_scores_gemma":[0.000043433687,0.0004954159,0.00010825019,0.00048959214,0.0009988178,0.000659686,0.0039865556,0.0009367104,0.000012470098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015465207,0.00043391986,0.00011897569,0.0006834491,0.00012074873,0.00032499537,0.0010216862,0.3115765,0.0017118648,0.17495075,0.0011688533,0.50773364],"study_design_scores_gemma":[0.0010742223,0.00033699235,0.000209294,0.0016615065,0.000047302434,0.00010060571,4.6708723e-7,0.96503574,0.004183978,0.0071992967,0.018519288,0.0016313288],"about_ca_topic_score_codex":0.00025150867,"about_ca_topic_score_gemma":0.0010812049,"teacher_disagreement_score":0.65345925,"about_ca_system_score_codex":0.00013871402,"about_ca_system_score_gemma":0.000586446,"threshold_uncertainty_score":0.9997497},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035263987,0.0005641614,0.98568344,0.0013016496,0.0017377028,0.00036452507,0.00005231497,0.00033253504,0.009928424],"genre_scores_gemma":[0.019282872,0.00019858095,0.9785141,0.000830696,0.0008899904,0.000024400706,0.000027977756,0.00003888512,0.0001925029],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576324,0.0000778531,0.0007538042,0.0017344367,0.000999578,0.00067106925],"domain_scores_gemma":[0.9953839,0.0010760651,0.00044097836,0.002582441,0.00030934732,0.00020726223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010670845,0.00053226517,0.0005030079,0.00087513134,0.00050389185,0.00070064334,0.004491274,0.00038727684,0.00009261598],"category_scores_gemma":[0.00034082052,0.0005469444,0.00016831268,0.0008326867,0.00073008327,0.0011326916,0.0010264046,0.0009608105,0.00041672905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023654027,0.00004169868,0.0000314034,0.000010359151,0.000014151708,0.000019110497,0.000578095,0.0088736,0.00035669937,0.34423184,0.00004139801,0.6457993],"study_design_scores_gemma":[0.00026332325,0.0000934641,0.0012090165,0.0005932332,0.00003018791,0.00007236811,6.01637e-7,0.4684635,0.0078079044,0.500711,0.019300666,0.0014546717],"about_ca_topic_score_codex":0.000028855393,"about_ca_topic_score_gemma":0.000059298436,"teacher_disagreement_score":0.64434457,"about_ca_system_score_codex":0.0005913369,"about_ca_system_score_gemma":0.00050427445,"threshold_uncertainty_score":0.9996982},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6911369,0.000094544564,0.30500904,0.00003282959,0.00077935716,0.0003930486,0.000004432817,0.00007105721,0.002478818],"genre_scores_gemma":[0.9980731,0.000021667123,0.0015622998,0.000050087827,0.00018003753,0.000006559331,0.000002829991,0.000015721327,0.00008772346],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974039,0.0000806268,0.00038511876,0.0008738525,0.0009302512,0.0003262135],"domain_scores_gemma":[0.99895805,0.00010253418,0.00035840317,0.00037494593,0.00015585586,0.000050196944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007813072,0.00026683442,0.00029533933,0.0003134859,0.00015978266,0.00011415992,0.00053069595,0.00019694293,0.000081873295],"category_scores_gemma":[0.00018150442,0.00022753343,0.00010037049,0.00019017758,0.000522949,0.00031828062,0.00023921551,0.0004005917,0.000015780655],"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.000021241212,0.00005133277,0.00006778247,0.000112843416,0.0000052599366,0.000019933479,0.00078974984,0.060012396,0.7307423,0.0023003554,0.0000011454766,0.20587566],"study_design_scores_gemma":[0.0014150494,0.0005741549,0.029504541,0.0018974382,0.00009037133,0.00015858933,0.000004056678,0.26036838,0.38175857,0.32276767,0.000030531195,0.0014306282],"about_ca_topic_score_codex":0.00000996544,"about_ca_topic_score_gemma":0.000008798362,"teacher_disagreement_score":0.34898373,"about_ca_system_score_codex":0.000115424584,"about_ca_system_score_gemma":0.0001795526,"threshold_uncertainty_score":0.9278544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033218574,0.0029979711,0.99067944,0.000457647,0.0018337524,0.0010896518,0.00006383642,0.0001783063,0.002666171],"genre_scores_gemma":[0.32134193,0.0020657417,0.6630203,0.0032782499,0.0015868364,0.0002793159,0.00029610711,0.0002464004,0.007885123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952875,0.000028557648,0.0008417545,0.0019831872,0.0009877984,0.00087122497],"domain_scores_gemma":[0.99755913,0.00022231035,0.00042806973,0.0011240282,0.0004232706,0.00024321783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009090442,0.0006216849,0.00072312646,0.00043424527,0.0006122489,0.00052434846,0.0020073336,0.00045924954,0.0000092797245],"category_scores_gemma":[0.00004378079,0.0005682357,0.00013130918,0.00068232813,0.000923072,0.00077388063,0.00079287303,0.0005959111,0.00001618394],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010956667,0.00007751586,0.000024961477,0.00021182669,0.00003307567,0.000117971285,0.0020749292,0.0397787,0.00020385177,0.015883313,0.00091750495,0.9406654],"study_design_scores_gemma":[0.0009329442,0.00041591638,0.00006430937,0.00085341145,0.000009055478,0.000332387,4.4677319e-7,0.9010259,0.00023690886,0.024660848,0.07057597,0.0008919065],"about_ca_topic_score_codex":0.00007086776,"about_ca_topic_score_gemma":0.00004205543,"teacher_disagreement_score":0.9397735,"about_ca_system_score_codex":0.00030188466,"about_ca_system_score_gemma":0.0005070607,"threshold_uncertainty_score":0.9996769},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074150297,0.0003212165,0.99622446,0.00009782257,0.00074460247,0.0006808548,0.000121244666,0.00060457876,0.0004637348],"genre_scores_gemma":[0.41980404,0.000036260342,0.5796379,0.000106484,0.0002666408,0.000026042471,0.000034199344,0.00008110341,0.0000073306815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997847,0.000017730144,0.0004928665,0.00066343346,0.00043172078,0.0005472554],"domain_scores_gemma":[0.9977811,0.0006201568,0.00017067828,0.0010961174,0.00021228766,0.00011966866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006264348,0.00052257796,0.0005379829,0.0004999125,0.00029043437,0.0002388629,0.0016020307,0.0005241623,0.000011123974],"category_scores_gemma":[0.00008317977,0.0005320275,0.00013871028,0.0002570128,0.00054162537,0.00028960302,0.0005436007,0.0013354662,0.0000031572347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006596945,0.00006315286,0.000042621563,0.0006082265,0.00014625925,0.000043870856,0.0037383558,0.45900798,0.11839368,0.038059294,0.0000774118,0.37975317],"study_design_scores_gemma":[0.00026773653,0.000051190116,0.00001498486,0.0007770506,0.000019281468,0.000036947462,7.189759e-7,0.8082593,0.05916902,0.12404729,0.006468876,0.00088757864],"about_ca_topic_score_codex":0.000010990483,"about_ca_topic_score_gemma":0.00015102119,"teacher_disagreement_score":0.41906255,"about_ca_system_score_codex":0.00054691656,"about_ca_system_score_gemma":0.00013315897,"threshold_uncertainty_score":0.9997131},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000071878436,0.0019247474,0.99036485,0.0016358756,0.0021850725,0.00026415524,0.000030868767,0.0002592591,0.0032633224],"genre_scores_gemma":[0.024408814,0.00046939924,0.97137094,0.0026964964,0.0005530877,0.0000016664002,0.0000464516,0.000041178104,0.00041195506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99478287,0.000046402114,0.0005430122,0.0026465748,0.0012749557,0.00070616556],"domain_scores_gemma":[0.9947329,0.00059910154,0.00030566848,0.00395314,0.00018308836,0.00022610705],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007753758,0.0005744211,0.0005707315,0.00038893145,0.00031196992,0.000730543,0.009139701,0.000239249,0.00008328225],"category_scores_gemma":[0.00011725836,0.0005026864,0.000081957645,0.00067241915,0.0009431586,0.0023562615,0.0047807083,0.00085835083,0.00013555736],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004249893,0.000017543887,0.00009935458,0.000008697099,0.0000061310493,0.0002000181,0.0003010033,0.0103496015,0.00028982127,0.0031430286,0.00008250502,0.9854981],"study_design_scores_gemma":[0.00025832804,0.000053267577,0.00006653452,0.00047194256,0.0000059534404,0.000048570793,4.4019254e-7,0.8352434,0.00060374575,0.15240802,0.010140928,0.00069888326],"about_ca_topic_score_codex":0.00019915252,"about_ca_topic_score_gemma":0.00014184188,"teacher_disagreement_score":0.98479915,"about_ca_system_score_codex":0.00019652926,"about_ca_system_score_gemma":0.0004904167,"threshold_uncertainty_score":0.99974245},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014822038,0.001922859,0.9955651,0.000024633233,0.0006159709,0.00018574334,0.000017252692,0.000009647615,0.00017659448],"genre_scores_gemma":[0.3909608,0.0001509701,0.60736144,0.00021203869,0.0010835177,0.000008816204,0.00005169808,0.00003085425,0.00013987407],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986326,0.00002613144,0.00023635679,0.0005650495,0.00030132354,0.00023854687],"domain_scores_gemma":[0.9990847,0.000026052503,0.00022263816,0.00035840474,0.00024039912,0.00006780197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019702563,0.000210363,0.0001887623,0.0002323459,0.000099225435,0.000018787174,0.00030600748,0.0003995643,0.00002778933],"category_scores_gemma":[0.000042210508,0.00020576996,0.00007910003,0.00020193528,0.00028068016,0.00001033798,0.0001409374,0.00025928073,0.0000024700269],"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.000038690865,0.00006071871,0.00054258504,0.000028216717,0.00003059933,0.0000012322905,0.00025803776,0.01915392,0.49195677,0.00023528341,0.000039002414,0.48765492],"study_design_scores_gemma":[0.00047055722,0.00037694265,0.0028612076,0.00043451504,0.00004906135,0.00010615754,0.0000018503858,0.1748751,0.79858357,0.015971452,0.0053264145,0.00094319996],"about_ca_topic_score_codex":0.000013670678,"about_ca_topic_score_gemma":0.0000061984706,"teacher_disagreement_score":0.48671174,"about_ca_system_score_codex":0.00012908381,"about_ca_system_score_gemma":0.00033904673,"threshold_uncertainty_score":0.83910555},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47984162,0.000322496,0.5196546,0.000034181227,0.000016162181,0.000116216914,0.000009677533,0.0000025652691,0.000002491586],"genre_scores_gemma":[0.877175,0.000016228587,0.1227437,0.000048139005,0.000012891172,0.0000014425266,7.2554394e-7,0.0000017991293,1.149965e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993598,0.000009400173,0.0002012312,0.00016044803,0.00014559932,0.00012355574],"domain_scores_gemma":[0.99958575,0.00019798629,0.000026206344,0.000085112835,0.00007611684,0.000028835722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016972139,0.000053176802,0.00019172223,0.00017000549,0.000018343406,0.0000023462244,0.000052290554,0.000024762296,5.365241e-7],"category_scores_gemma":[0.00007540118,0.000043287528,0.000016701557,0.00027967078,0.00018432864,0.00004505577,0.000018334858,0.00005467925,1.2885982e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066549965,0.00037891677,0.15903191,0.00021656645,0.000013039057,0.000010116661,0.004286314,0.22530344,0.06920549,0.00030314628,0.000002658734,0.5405829],"study_design_scores_gemma":[0.0007076944,0.00050448166,0.0609409,0.000121615456,0.000004508321,0.0000036541294,0.0000012555365,0.9139251,0.013688293,0.010074457,3.1795764e-7,0.00002769424],"about_ca_topic_score_codex":0.0000091465945,"about_ca_topic_score_gemma":0.000003675913,"teacher_disagreement_score":0.6886217,"about_ca_system_score_codex":0.000017201559,"about_ca_system_score_gemma":0.00007040972,"threshold_uncertainty_score":0.17652142},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035626823,0.00017135774,0.9947372,0.00050861755,0.00049456593,0.00029579125,0.000017862885,0.000053225252,0.0001587054],"genre_scores_gemma":[0.2830337,0.0000040316054,0.7159968,0.0007858352,0.0001416868,0.0000021651824,0.000006950447,0.000014635967,0.000014192211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970903,0.00006349224,0.0005551315,0.0009811741,0.0009126031,0.0003973272],"domain_scores_gemma":[0.9978201,0.0004791609,0.00043998455,0.00080420147,0.00034128092,0.000115317394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096788735,0.00039639822,0.0005047362,0.0005952614,0.00024260595,0.0004389175,0.0013213232,0.0002595787,0.000021227648],"category_scores_gemma":[0.000096374395,0.00035525492,0.00010268356,0.00032203502,0.0009419216,0.000808484,0.00069447205,0.0006772807,0.0000011250611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003414523,0.00010464429,0.00086245284,0.0008118999,0.000044924524,0.0001335915,0.0014336098,0.07642194,0.0655797,0.041903228,0.000009828752,0.81266004],"study_design_scores_gemma":[0.00025348092,0.00011315898,0.00037381882,0.0002868323,0.000013795451,0.000036978974,1.9665428e-7,0.83957255,0.060032897,0.09880434,0.000048206202,0.00046374043],"about_ca_topic_score_codex":0.000035529247,"about_ca_topic_score_gemma":0.000029798392,"teacher_disagreement_score":0.8121963,"about_ca_system_score_codex":0.000081821825,"about_ca_system_score_gemma":0.0007036123,"threshold_uncertainty_score":0.99988997},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007505047,0.000116670395,0.98954207,0.00022086091,0.00018946771,0.0002328631,0.0000040821647,0.000013752425,0.0089297015],"genre_scores_gemma":[0.9549797,0.000010202954,0.043179046,0.0003223209,0.00033314223,0.000007685046,0.00000752711,0.000022995162,0.0011373889],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866533,0.000023539653,0.0002826676,0.0004336901,0.00040411527,0.00019063418],"domain_scores_gemma":[0.99888664,0.00010767793,0.00023836024,0.0006917576,0.000044138334,0.00003144275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023323318,0.00021582459,0.00026991148,0.00012969614,0.0001042022,0.000039081217,0.00070884574,0.000071533614,0.0002218949],"category_scores_gemma":[0.000004489268,0.0001551815,0.00016337326,0.00015311406,0.0004013502,0.000051489253,0.00028789815,0.00031900854,0.0000054540087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036651693,0.000070500006,0.003377204,0.000014481998,0.000047821068,6.7022376e-7,0.00037251928,0.05892716,0.0008336578,0.05396824,0.00013081514,0.8822533],"study_design_scores_gemma":[0.00019467024,0.00007227476,0.0007757495,0.00025548466,0.00006583618,0.0000024029882,3.2950754e-7,0.102771185,0.0073933266,0.8699026,0.017980969,0.00058518065],"about_ca_topic_score_codex":0.00001648169,"about_ca_topic_score_gemma":0.0000032810137,"teacher_disagreement_score":0.9542292,"about_ca_system_score_codex":0.00008943216,"about_ca_system_score_gemma":0.000069751346,"threshold_uncertainty_score":0.6328118},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015291143,0.0023279309,0.98180443,0.000026683641,0.00008265993,0.00026516567,0.000012649622,0.0000074250834,0.0001819208],"genre_scores_gemma":[0.96065825,0.00023836337,0.038401406,0.000051553274,0.00024291247,0.0000043206082,0.00029364167,0.000024010988,0.00008555752],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988898,0.00001351583,0.00017846774,0.00049864245,0.0002449896,0.00017460847],"domain_scores_gemma":[0.99926543,0.000005262652,0.00014016542,0.0003797717,0.000145414,0.00006396554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026381938,0.0001667659,0.00013908111,0.00010968338,0.000052556083,0.000027002554,0.0002865143,0.00021150982,0.00000694168],"category_scores_gemma":[0.000012297829,0.00016410768,0.000017686943,0.00011048704,0.00024654722,0.0000119941315,0.00020090937,0.00008578001,0.0000017563603],"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.000012755234,0.00016098734,0.0043870956,0.00013577646,0.00003829108,6.2177236e-7,0.00054925826,0.009257595,0.88117796,0.0011015758,0.00001679806,0.10316131],"study_design_scores_gemma":[0.0053059226,0.005315805,0.07401519,0.00049946207,0.00048324626,0.00047108417,0.000017981472,0.16206776,0.67397183,0.040725872,0.029082246,0.008043629],"about_ca_topic_score_codex":0.0000080429045,"about_ca_topic_score_gemma":0.000002505811,"teacher_disagreement_score":0.9453671,"about_ca_system_score_codex":0.000087755034,"about_ca_system_score_gemma":0.00007389413,"threshold_uncertainty_score":0.6692117},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114569254,0.00009279165,0.8697343,0.0002930219,0.0065907543,0.0010053637,0.000009870367,0.00007673161,0.0076279407],"genre_scores_gemma":[0.99776536,0.0002697085,0.0004386385,0.00016881351,0.0001509577,0.000004831145,8.1816415e-7,0.000015723865,0.0011851622],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983426,0.000051687734,0.0003141168,0.00052218366,0.00055672403,0.0002127075],"domain_scores_gemma":[0.9971812,0.001908225,0.00030887595,0.00045382392,0.00010799613,0.000039909213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009569943,0.0002088802,0.00024150222,0.00034846825,0.00039453973,0.000059493435,0.00041422,0.00014064283,0.000008471958],"category_scores_gemma":[0.00060417806,0.00015222636,0.00011579763,0.00022688476,0.0009813104,0.00018010063,0.00007485058,0.00042038097,0.0000137919915],"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.000048354443,0.00005402844,0.000015152709,0.0000692914,0.000004360481,0.000012119848,0.0010837404,0.007597216,0.60399485,0.0007148232,0.000018941006,0.38638714],"study_design_scores_gemma":[0.0003061234,0.00094560115,0.0009861944,0.00076953374,0.000020365555,0.00012199172,0.0000010236525,0.06436185,0.9236319,0.007826048,0.00070650544,0.0003228624],"about_ca_topic_score_codex":0.000018131408,"about_ca_topic_score_gemma":0.000028150453,"teacher_disagreement_score":0.8831961,"about_ca_system_score_codex":0.00013309762,"about_ca_system_score_gemma":0.000065718414,"threshold_uncertainty_score":0.6207611},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003186312,0.00016955828,0.99176127,0.0006565354,0.004000912,0.0011003902,0.00002629346,0.00039492466,0.0018582682],"genre_scores_gemma":[0.027626969,0.000016300766,0.9665762,0.002496422,0.002295001,0.000034752633,0.000030147843,0.000090198635,0.0008339851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940101,0.00004808644,0.0010641656,0.0026767622,0.0009547325,0.0012461686],"domain_scores_gemma":[0.9952601,0.00085926295,0.00047351056,0.0025117735,0.00059914525,0.0002961617],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012904034,0.0008663357,0.00082556915,0.00081007427,0.00051461504,0.0011481678,0.0062054074,0.00058924686,0.000028177634],"category_scores_gemma":[0.00006060963,0.0008143006,0.0003098234,0.00055129256,0.0011163946,0.0013243146,0.0012516933,0.00083173974,0.00008126504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020250267,0.00007322644,0.000028079487,0.00003545999,0.000013678253,0.000029514023,0.00049243815,0.110087365,0.0003944468,0.019789625,0.00033713135,0.8686988],"study_design_scores_gemma":[0.0001661783,0.00046620352,0.000048710637,0.00014375823,0.00000984554,0.000027283999,1.2038353e-7,0.86433285,0.0031953666,0.12193394,0.00876708,0.0009086656],"about_ca_topic_score_codex":0.000081355734,"about_ca_topic_score_gemma":0.00029728588,"teacher_disagreement_score":0.8677901,"about_ca_system_score_codex":0.00048334457,"about_ca_system_score_gemma":0.0006895979,"threshold_uncertainty_score":0.9998887},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011900474,0.00132887,0.9931933,0.0034086097,0.00040104555,0.0004543176,8.2297566e-7,0.0001469474,0.0009470617],"genre_scores_gemma":[0.7104984,0.00007073934,0.28580698,0.0029117013,0.0005152865,0.0000216577,0.0000012016636,0.000036460897,0.00013757468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555314,0.00011202277,0.0006115097,0.0017755564,0.0010449562,0.00090279273],"domain_scores_gemma":[0.9967752,0.00082064344,0.00034181032,0.0015771112,0.00029458746,0.0001906143],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019634382,0.0006662907,0.00057588,0.0005323945,0.00039463255,0.0011478316,0.0048845178,0.00034668884,0.000010754488],"category_scores_gemma":[0.00008943707,0.00045038896,0.0000820179,0.0014920993,0.0007934758,0.0011127819,0.0010586531,0.0018969205,0.000017120015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008849323,0.000015846967,0.00020354573,0.000013936039,0.0000061617898,0.000089300906,0.0005255521,0.61131424,0.000028818928,0.012838421,0.00002023028,0.37493506],"study_design_scores_gemma":[0.00015890629,0.00021037698,0.00011763272,0.0012625773,0.0000059862714,0.000093952054,3.066137e-7,0.9839822,0.0001362987,0.013267598,0.0001148738,0.0006492699],"about_ca_topic_score_codex":0.00006740375,"about_ca_topic_score_gemma":0.0011666974,"teacher_disagreement_score":0.71037936,"about_ca_system_score_codex":0.00037477523,"about_ca_system_score_gemma":0.0012559191,"threshold_uncertainty_score":0.9998891},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003008031,0.00043943763,0.9869996,0.0010249689,0.0015081093,0.00063609786,0.0000034120064,0.0003315357,0.006048827],"genre_scores_gemma":[0.6642749,0.000034596083,0.33506784,0.000341228,0.00014976268,0.00001601921,0.0000023802502,0.00002240786,0.00009086625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945564,0.00003379833,0.0006212467,0.0014908724,0.0026216542,0.00067601446],"domain_scores_gemma":[0.9961894,0.00019001661,0.0003810253,0.0023137757,0.0008019894,0.00012380243],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002403606,0.0004914241,0.0005540346,0.0013267484,0.00015783802,0.00019338846,0.005549238,0.00038921318,0.000019004894],"category_scores_gemma":[0.0002462642,0.00046480226,0.00010442146,0.0013290573,0.0006681068,0.00057425426,0.0022334782,0.0007025828,0.000050370214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025185539,0.000014288762,0.00004145398,0.000018303863,0.0000061315363,0.000008318721,0.00029158476,0.24372531,0.00009619556,0.008635857,0.00002010945,0.74713993],"study_design_scores_gemma":[0.0003979876,0.0003962529,0.0010103807,0.00082279684,0.000016993508,0.000050727784,1.4272928e-7,0.7734966,0.006757988,0.21583681,0.00047470353,0.0007386007],"about_ca_topic_score_codex":0.000019824158,"about_ca_topic_score_gemma":0.000051548097,"teacher_disagreement_score":0.7464013,"about_ca_system_score_codex":0.00086392363,"about_ca_system_score_gemma":0.0013558159,"threshold_uncertainty_score":0.9998312},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30791193,0.000012366269,0.6890461,0.0025413278,0.00004891247,0.00038727417,0.000003138834,0.00004178094,0.0000071890813],"genre_scores_gemma":[0.58545774,0.000008972764,0.4131348,0.0012858828,0.00005651695,0.000036371413,0.000009136652,0.000006210987,0.0000043554355],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907947,0.000008876395,0.00017239313,0.00037271596,0.00015814051,0.00020838284],"domain_scores_gemma":[0.9995077,0.00008403571,0.00004195989,0.00026956722,0.000050527146,0.000046179313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000099406905,0.000098865545,0.00012902814,0.00017334522,0.000099170225,0.000014592022,0.00014885746,0.00003404157,0.000009336292],"category_scores_gemma":[0.00002390762,0.00008235634,0.000027225735,0.00057761214,0.00010580745,0.000118377175,0.00007465565,0.00012790484,0.0000036356892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012278058,0.00040612853,0.44088474,0.000101255704,0.0000023814716,0.00006406986,0.0022310845,0.049302656,0.14668047,0.00004268504,0.00029443772,0.3598673],"study_design_scores_gemma":[0.0012544934,0.00026511916,0.17388192,0.00016946232,0.0000040428613,0.00016080981,0.0000016969997,0.729243,0.08926692,0.0051089386,0.00041464975,0.00022898254],"about_ca_topic_score_codex":0.000008252296,"about_ca_topic_score_gemma":0.000013823445,"teacher_disagreement_score":0.6799403,"about_ca_system_score_codex":0.00007099114,"about_ca_system_score_gemma":0.00005552548,"threshold_uncertainty_score":0.3358394},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41747445,0.000016898688,0.5823077,0.00007333414,0.00004288286,0.000061138286,7.936426e-7,0.000006986377,0.000015782181],"genre_scores_gemma":[0.75104415,0.0000032479736,0.24883376,0.000095229465,0.00001912943,0.0000019309184,3.1114473e-7,0.000002073975,1.5106191e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911535,0.000039574697,0.00022645346,0.00022707073,0.00020833478,0.00018322402],"domain_scores_gemma":[0.99928814,0.00041408135,0.00006522864,0.00014120301,0.00005194112,0.00003938836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043764064,0.00007835467,0.00016433987,0.00017711436,0.000055721914,0.000014841391,0.00017128864,0.00006233162,0.000007237147],"category_scores_gemma":[0.00013783548,0.00006291016,0.000015954252,0.00069391547,0.00026314874,0.00019505722,0.00009013816,0.00012902942,4.5913018e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007480541,0.0010254452,0.09078182,0.00013510215,0.000016026073,0.0001699835,0.011670446,0.4537477,0.0044939592,0.09547893,0.00002699877,0.34237877],"study_design_scores_gemma":[0.00033052068,0.00004881431,0.058980618,0.000020876892,0.0000013232827,0.000028510778,8.735579e-7,0.79690117,0.0012197568,0.14239311,6.1502544e-7,0.00007378692],"about_ca_topic_score_codex":0.00007386327,"about_ca_topic_score_gemma":0.000028982238,"teacher_disagreement_score":0.34315348,"about_ca_system_score_codex":0.00003433207,"about_ca_system_score_gemma":0.0000615941,"threshold_uncertainty_score":0.2565402},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005889969,0.006578903,0.98606807,0.000044128075,0.00027031562,0.00038762912,0.00003951528,0.00006829819,0.00065318204],"genre_scores_gemma":[0.87215227,0.0035922397,0.12282576,0.00025101076,0.00047061092,0.00006866755,0.00019086008,0.00013268826,0.0003159097],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99881244,0.0000036171896,0.00033629403,0.00039383786,0.0001966385,0.00025716994],"domain_scores_gemma":[0.9992447,0.00013571554,0.00011307502,0.00036258504,0.000097242664,0.00004666365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017207325,0.00025673196,0.0002846944,0.00020527598,0.0000922441,0.00005602376,0.00049135153,0.0002559124,0.000020469639],"category_scores_gemma":[0.000013862314,0.00024405836,0.0000770743,0.00014875642,0.00018459119,0.000081013306,0.00005707606,0.00035441332,0.0000031142433],"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.0000023087593,0.000007036071,0.0000082686265,0.00007216108,0.000010460852,3.6946832e-7,0.0001866219,0.00065100996,0.8981861,0.00067918724,0.00033543076,0.09986108],"study_design_scores_gemma":[0.00014891624,0.00007798149,0.000015063425,0.00021656879,0.000021519445,0.000008405255,4.7859805e-7,0.05925858,0.91519105,0.012571598,0.012090642,0.00039917298],"about_ca_topic_score_codex":0.00001681935,"about_ca_topic_score_gemma":0.00004262649,"teacher_disagreement_score":0.8662623,"about_ca_system_score_codex":0.00008609422,"about_ca_system_score_gemma":0.00006374419,"threshold_uncertainty_score":0.9952411},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9296908,0.00011942571,0.059875056,0.0006514418,0.0050219027,0.00092147454,0.000035740995,0.00010774404,0.0035764566],"genre_scores_gemma":[0.99486095,0.00046226836,0.0021166417,0.0023407568,0.00017557785,0.0000030243502,0.0000040753735,0.0000113493725,0.000025384723],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976391,0.000021344493,0.00041190552,0.00067314506,0.0009014826,0.0003530024],"domain_scores_gemma":[0.9989511,0.00015812198,0.00029987888,0.00038919435,0.000115975214,0.00008574587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028801314,0.00031673876,0.00029146453,0.00054668257,0.00026557225,0.00044784255,0.00070408144,0.00017911602,0.000038408918],"category_scores_gemma":[0.00013004728,0.000262448,0.000056911318,0.0002505288,0.0014423631,0.0032277429,0.0003191106,0.00044716249,0.000013020142],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029347719,0.000015392647,0.00016193345,0.00017018647,0.0000017646091,0.000011041173,0.005307766,0.02629537,0.04436516,0.012936959,0.000004353596,0.91070074],"study_design_scores_gemma":[0.0036035173,0.0025322165,0.083224885,0.009641729,0.00006621677,0.0014605097,0.000029222529,0.20895448,0.13072884,0.5536106,0.0019636462,0.0041840966],"about_ca_topic_score_codex":0.000013331721,"about_ca_topic_score_gemma":0.00001257956,"teacher_disagreement_score":0.9065166,"about_ca_system_score_codex":0.00012027065,"about_ca_system_score_gemma":0.00030106338,"threshold_uncertainty_score":0.9999828},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000073295356,0.003207552,0.99480665,0.00007542572,0.00073960196,0.0004027574,0.0000011789379,0.0003987038,0.00029483164],"genre_scores_gemma":[0.053389583,0.00023712151,0.94548047,0.00020210694,0.000583092,0.000015077768,0.0000018513313,0.00006277044,0.000027914371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984869,0.0000036539348,0.00025560177,0.00048358244,0.00020838047,0.0005618956],"domain_scores_gemma":[0.9982834,0.0012076397,0.000049772698,0.000359379,0.000045365086,0.000054455722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004859908,0.00032445893,0.00028792926,0.00021001365,0.00019274514,0.000117734104,0.0006509003,0.00033540957,0.0000014665553],"category_scores_gemma":[0.00006449061,0.00024679475,0.00005207079,0.0002320837,0.0007853742,0.00011413025,0.00020901448,0.0007802003,9.560239e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011291108,5.775524e-7,7.676174e-7,0.00000932006,0.000003344935,0.0000042318316,0.000028651708,0.5191623,0.000006068069,0.0006142023,0.0000033691547,0.48016602],"study_design_scores_gemma":[0.00009259929,0.000046357847,0.000007636735,0.0001736451,0.000008337485,0.000021579819,3.996846e-7,0.9749807,0.00010091845,0.023533514,0.0007366023,0.00029771656],"about_ca_topic_score_codex":3.993366e-7,"about_ca_topic_score_gemma":0.000015381349,"teacher_disagreement_score":0.47986832,"about_ca_system_score_codex":0.00011654785,"about_ca_system_score_gemma":0.000019123681,"threshold_uncertainty_score":0.99999845},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47742376,0.000046700872,0.52208143,0.000103836726,0.0002058044,0.00008788474,3.6925172e-7,0.000043909666,0.000006299467],"genre_scores_gemma":[0.9147447,0.0000034784478,0.08468085,0.00045661745,0.00009602453,0.00000244199,9.793961e-7,0.000014761444,1.979928e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984809,0.000067395515,0.00024083261,0.00051634945,0.0002914498,0.00040307295],"domain_scores_gemma":[0.9992583,0.0002950888,0.000065730695,0.00019968032,0.00007487628,0.000106333646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008379868,0.00017529452,0.0002212797,0.0006679057,0.00018806517,0.0001470725,0.00010668488,0.000057778354,0.00000492322],"category_scores_gemma":[0.0002393411,0.00016144448,0.00003654307,0.0013857605,0.00041047792,0.00029256174,0.000046555164,0.0003745809,0.000001333564],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046691985,0.0000588744,0.06626735,0.000021127478,0.0000036086117,0.0000059563295,0.0007712984,0.016115313,0.64229524,0.0000026926339,2.1991112e-7,0.27441162],"study_design_scores_gemma":[0.0016310406,0.00038124277,0.26708478,0.00024080386,0.000017681923,0.00092270767,0.000015575777,0.659219,0.06814634,0.0019478321,0.00003625182,0.00035670528],"about_ca_topic_score_codex":0.00018062755,"about_ca_topic_score_gemma":0.00021039124,"teacher_disagreement_score":0.6431037,"about_ca_system_score_codex":0.000120855715,"about_ca_system_score_gemma":0.0000626106,"threshold_uncertainty_score":0.6583515},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085910084,0.0018262422,0.9943735,0.000209508,0.001690803,0.0005263455,0.000011586452,0.00022609331,0.00027681064],"genre_scores_gemma":[0.67485183,0.000028381079,0.32395518,0.00033934333,0.0003381443,0.000015704596,0.000014344109,0.00003160433,0.00042549404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964296,0.00006362132,0.0008038218,0.0012118948,0.00093068555,0.00056034536],"domain_scores_gemma":[0.99736667,0.0004330783,0.000586781,0.0010733721,0.00039110644,0.00014899677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006941211,0.0005029373,0.0006520711,0.00044169318,0.00020448654,0.00045321,0.0022100366,0.00032088716,0.000005736489],"category_scores_gemma":[0.000090655354,0.00046499557,0.00009930996,0.0005853976,0.00028500627,0.00044420437,0.0003211476,0.0005277508,0.000012225831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.2237216e-7,0.000033725693,0.000021337735,0.000039927072,0.000009509882,0.000013202179,0.00010625786,0.1679123,0.0005022756,0.0011601401,0.000030470495,0.83017004],"study_design_scores_gemma":[0.0003255485,0.00014989014,0.000052040778,0.00063011906,0.000013124972,0.000031043608,1.3854344e-7,0.99678296,0.00024931523,0.0011528471,0.00015465834,0.00045828606],"about_ca_topic_score_codex":0.000029974077,"about_ca_topic_score_gemma":0.000047757043,"teacher_disagreement_score":0.82971174,"about_ca_system_score_codex":0.00024434456,"about_ca_system_score_gemma":0.0004376276,"threshold_uncertainty_score":0.9997802},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007230222,0.00037263517,0.98447806,0.00050859037,0.00043111408,0.00046690382,0.000005495443,0.00007343717,0.012940775],"genre_scores_gemma":[0.98025435,0.00004373332,0.01885129,0.000577978,0.00007315308,0.00001849035,9.214166e-7,0.000019918412,0.00016014518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957469,0.00009179141,0.0007480571,0.0013955426,0.0013563847,0.0006613288],"domain_scores_gemma":[0.9955776,0.0019268539,0.00037389106,0.0016687444,0.00032417767,0.00012876635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012811971,0.0005334713,0.0005960539,0.00065433426,0.00014681225,0.00030024975,0.0048357085,0.0003940006,0.00005191431],"category_scores_gemma":[0.00057563826,0.00039493796,0.000109320434,0.0007899498,0.0010656535,0.00037998715,0.0010372371,0.0016086528,0.000058726146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006640689,0.000060897833,0.00009699162,0.000020488069,0.0000048372794,0.000019737992,0.000880374,0.039407264,0.0000889049,0.66085726,0.000005452737,0.29855117],"study_design_scores_gemma":[0.00010712531,0.00017478905,0.00008227558,0.0005696609,0.0000023744356,0.000012583161,4.7209528e-7,0.49910444,0.00047151098,0.4991013,0.000060865645,0.00031258163],"about_ca_topic_score_codex":0.00008440207,"about_ca_topic_score_gemma":0.00015293817,"teacher_disagreement_score":0.97953135,"about_ca_system_score_codex":0.0002200306,"about_ca_system_score_gemma":0.00059764105,"threshold_uncertainty_score":0.9998503},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072929286,0.002611732,0.99171245,0.0004905964,0.0013603151,0.00021976419,0.000007253282,0.000013916667,0.002854705],"genre_scores_gemma":[0.63219255,0.0007847634,0.3515763,0.0034355095,0.0053540636,0.00008913948,0.00030972305,0.0001164736,0.0061414707],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985089,0.00006292766,0.00022445567,0.0006772581,0.00032506872,0.00020141834],"domain_scores_gemma":[0.99873817,0.000098364915,0.00017840495,0.0007522185,0.00015495236,0.000077903074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007395347,0.00022179504,0.0001875202,0.000095680945,0.00012791774,0.000097971904,0.0006901409,0.0002935553,0.000034322828],"category_scores_gemma":[0.00011756704,0.00015314555,0.000086503176,0.00009749284,0.0003032264,0.000008226738,0.0002476426,0.00029939655,0.00001190632],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009208362,0.000015603506,0.000064270826,0.0000060302855,0.000018284021,0.0000024988858,0.00014234868,0.009593692,0.1827845,0.00021421823,0.0011150478,0.8059514],"study_design_scores_gemma":[0.0017914796,0.00025692483,0.0011078243,0.00019468556,0.0000556368,0.000038737602,0.0000028020231,0.034125566,0.27170125,0.17158239,0.5181621,0.0009806529],"about_ca_topic_score_codex":0.000024676101,"about_ca_topic_score_gemma":0.000068420464,"teacher_disagreement_score":0.8049708,"about_ca_system_score_codex":0.000059510257,"about_ca_system_score_gemma":0.00029324094,"threshold_uncertainty_score":0.62450945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006172488,0.0017943678,0.9929781,0.0013517835,0.0011091235,0.00035802243,0.000025479145,0.00020270623,0.0021186713],"genre_scores_gemma":[0.019701563,0.0005888104,0.9761098,0.0018181377,0.0011720369,0.000020403484,0.000017247838,0.000053683347,0.00051831134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996261,0.000032966553,0.00045486217,0.0016171047,0.00095412857,0.00067995104],"domain_scores_gemma":[0.9976316,0.00027471696,0.00022808988,0.0014500502,0.00014142487,0.0002741347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059478014,0.00057444186,0.0005844688,0.0005982049,0.00033727946,0.0007215359,0.0027144747,0.00033072112,0.000026476708],"category_scores_gemma":[0.000045466513,0.00047983188,0.00008716176,0.00033755534,0.00086014345,0.0013164472,0.0023376977,0.00069584546,0.00002645868],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007247043,0.000019524949,0.000053922417,0.000044164583,0.0000070495194,0.00007760124,0.0010666858,0.0017708893,0.00003714996,0.016532142,0.00007214615,0.98031145],"study_design_scores_gemma":[0.00043903693,0.00010037131,0.0001398579,0.0003717732,0.000008100615,0.00012086247,2.2778087e-7,0.8887021,0.00024417814,0.10070543,0.008372816,0.0007952343],"about_ca_topic_score_codex":0.00006500171,"about_ca_topic_score_gemma":0.0001593435,"teacher_disagreement_score":0.97951627,"about_ca_system_score_codex":0.00014003013,"about_ca_system_score_gemma":0.00026399727,"threshold_uncertainty_score":0.99976534},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010808893,0.00022718997,0.993011,0.0019869462,0.00044121375,0.00039461168,0.0000048128463,0.00006160103,0.00376452],"genre_scores_gemma":[0.30360553,0.00019277539,0.6920963,0.00082994753,0.0004819618,0.000015708732,0.00003805451,0.000048493628,0.002691221],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702466,0.00003928351,0.00039814872,0.0008057535,0.001256831,0.00047535193],"domain_scores_gemma":[0.9976863,0.0004010881,0.0002563933,0.0013655213,0.00020813517,0.000082516024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010359837,0.00031922586,0.00034306818,0.0004066323,0.00034033306,0.0005481455,0.0044932733,0.00010336435,0.000005421785],"category_scores_gemma":[0.000013542294,0.00021119865,0.00006230515,0.000515614,0.0008875633,0.0007173518,0.0016093082,0.00048191604,0.000020719823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010397842,0.000031915657,0.00010023329,0.000021133643,0.000017833547,0.000021639458,0.00019852987,0.018907135,0.000026285947,0.062687375,0.000054911638,0.9179226],"study_design_scores_gemma":[0.0005296227,0.00028912062,0.0009803822,0.00030673124,0.000010565142,0.000022988086,3.6712893e-7,0.95462894,0.00041948433,0.033527493,0.008773344,0.0005109653],"about_ca_topic_score_codex":0.000036146717,"about_ca_topic_score_gemma":0.00012800777,"teacher_disagreement_score":0.9357218,"about_ca_system_score_codex":0.00012453533,"about_ca_system_score_gemma":0.00015157925,"threshold_uncertainty_score":0.8612431},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021396144,0.0002450123,0.99476784,0.00022600776,0.0004549594,0.00048020764,0.0000012431261,0.0001476077,0.0034631672],"genre_scores_gemma":[0.53446954,0.0001884632,0.4637314,0.0010782839,0.00009359867,0.000022197339,0.000005535723,0.00006860595,0.0003423328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961782,0.00005992223,0.00048559083,0.0014731309,0.0010133238,0.0007898234],"domain_scores_gemma":[0.9979982,0.00011997962,0.00021264554,0.0012437913,0.00019283556,0.00023255494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008708708,0.00048048605,0.00045946543,0.0012498654,0.00018743737,0.00045651183,0.0025496662,0.00026564387,0.000056115805],"category_scores_gemma":[0.000021583171,0.00040097913,0.00008208028,0.0010963845,0.0008375786,0.00080856244,0.0010351693,0.00075254636,0.000048899783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017005957,0.00009209944,0.00029225094,0.000052381863,0.000012218319,0.00035054638,0.002113481,0.28709084,0.000040745825,0.018811945,0.000017414191,0.69110906],"study_design_scores_gemma":[0.0005162102,0.00053783506,0.00046623693,0.0008410181,0.0000037933642,0.000076291275,2.8506165e-7,0.9171524,0.00034722366,0.078724176,0.00065499515,0.00067953835],"about_ca_topic_score_codex":0.000070495415,"about_ca_topic_score_gemma":0.00031300826,"teacher_disagreement_score":0.69042957,"about_ca_system_score_codex":0.0002794923,"about_ca_system_score_gemma":0.00042921517,"threshold_uncertainty_score":0.9998442},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033126032,0.0005346187,0.9948971,0.00007691554,0.00083746505,0.00040289943,0.000007759013,0.00010192688,0.0028100428],"genre_scores_gemma":[0.90289986,0.0001420073,0.09496125,0.00069964654,0.0005758691,0.000021336793,0.00006953257,0.000088561115,0.00054194673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863625,0.000006348261,0.0003375009,0.0004034138,0.0002853007,0.00033118468],"domain_scores_gemma":[0.99936634,0.00015944793,0.000060351453,0.00029248366,0.00006213428,0.00005925273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032572183,0.00026099535,0.0003163484,0.00048671602,0.000057832556,0.0001200699,0.0004526449,0.00020414911,0.000008634681],"category_scores_gemma":[0.000016543998,0.00026307322,0.000060270588,0.00019351777,0.00009248655,0.00011694629,0.000056723446,0.00032044397,0.000010770049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021616088,0.0000038668213,0.000010980088,0.000080378835,0.0000024935507,0.000005821249,0.00018457015,0.81586397,0.00020729189,0.0013465392,0.000033000204,0.18225895],"study_design_scores_gemma":[0.0002000864,0.000037970054,0.00007948945,0.00034123613,0.0000034541586,0.000009816481,7.095361e-7,0.99141455,0.00007158294,0.0046954285,0.0028521947,0.00029347968],"about_ca_topic_score_codex":0.0000070087567,"about_ca_topic_score_gemma":0.000044101118,"teacher_disagreement_score":0.9025686,"about_ca_system_score_codex":0.00032777668,"about_ca_system_score_gemma":0.00006006414,"threshold_uncertainty_score":0.9999821},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007668281,0.00018620832,0.99296117,0.000412369,0.001229884,0.00033999182,0.0000072651665,0.00012372535,0.0046627154],"genre_scores_gemma":[0.19816795,0.000034121178,0.800441,0.0005471026,0.00038376692,0.000008394693,0.000013343763,0.000038791903,0.00036547473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663806,0.00003297782,0.000719097,0.0011363273,0.0010032137,0.00047032273],"domain_scores_gemma":[0.9975784,0.00037141968,0.00045844598,0.0011005265,0.0003984444,0.000092805094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005765204,0.00041084725,0.00046326334,0.0009133171,0.00015095253,0.0002789229,0.0024398824,0.0003451102,0.000034873094],"category_scores_gemma":[0.00007223944,0.00038199103,0.00013541183,0.0006795433,0.00071104214,0.00069792155,0.0007112811,0.00045076438,0.000032829063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038067167,0.00002455194,0.00003123445,0.000015174383,0.000004870621,0.00002251768,0.00030994083,0.86711395,0.00022050185,0.011788468,0.000048662263,0.12041632],"study_design_scores_gemma":[0.000061156294,0.00014346954,0.000036490143,0.00028480103,0.0000067586907,0.000029895322,9.744645e-8,0.90562135,0.0154593205,0.07766702,0.00026785917,0.00042178118],"about_ca_topic_score_codex":0.00007026176,"about_ca_topic_score_gemma":0.000050575916,"teacher_disagreement_score":0.19809127,"about_ca_system_score_codex":0.00025635585,"about_ca_system_score_gemma":0.00037494922,"threshold_uncertainty_score":0.9998632},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007685245,0.00031946864,0.9885906,0.00015821161,0.000549136,0.0008453944,0.00000853232,0.00014463926,0.009307191],"genre_scores_gemma":[0.50168735,0.00024385464,0.48230177,0.008721587,0.0009326671,0.0002214103,0.00007406988,0.00026776324,0.0055495426],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960432,0.000019817147,0.0004391768,0.0016518459,0.00063385436,0.0012121008],"domain_scores_gemma":[0.9974554,0.0004322509,0.00039865554,0.0011294116,0.00043099525,0.00015326073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048107645,0.00071997975,0.00060547964,0.0009822431,0.0003480848,0.00034179082,0.0029164818,0.0003334395,0.00003301139],"category_scores_gemma":[0.000048719332,0.0005768129,0.00016074852,0.00040235708,0.0005690162,0.0017286034,0.00064253405,0.00090289616,0.000014077388],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000277844,0.00022290116,0.00052427134,0.00032094843,0.0003176489,0.00010517628,0.021023054,0.001099678,0.0069436366,0.26247996,0.0008934104,0.7057915],"study_design_scores_gemma":[0.0013083832,0.009195106,0.000679172,0.002542431,0.00011065401,0.00025465692,0.000013311715,0.043556873,0.5779443,0.3034578,0.056092747,0.0048445896],"about_ca_topic_score_codex":0.000041646425,"about_ca_topic_score_gemma":0.00005045145,"teacher_disagreement_score":0.70094687,"about_ca_system_score_codex":0.00056609453,"about_ca_system_score_gemma":0.0008239907,"threshold_uncertainty_score":0.99966836},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027606171,0.0011658008,0.9881634,0.0021883934,0.0013561081,0.00037174433,0.000012620159,0.00024222095,0.00647212],"genre_scores_gemma":[0.007883485,0.00036829239,0.98853296,0.0019139868,0.0006343077,0.000013922636,0.000008554573,0.000037702444,0.0006067889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962124,0.000033077024,0.00059412903,0.0014011618,0.0010060669,0.0007531159],"domain_scores_gemma":[0.9975208,0.00040782982,0.00019293798,0.0013493658,0.00027738718,0.00025166213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076681474,0.0005758493,0.00052526157,0.0010571005,0.0005994911,0.0008752065,0.0035762973,0.0003094902,0.000053892752],"category_scores_gemma":[0.000044987588,0.0005576965,0.00012883503,0.0009930789,0.0009172258,0.001479194,0.0016168368,0.0010035825,0.00002962575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015774863,0.000021982743,0.000010688103,0.000036059635,0.00001158665,0.000029515984,0.0011631132,0.0063766264,0.000013724814,0.032863297,0.00003453312,0.9594373],"study_design_scores_gemma":[0.00026953738,0.00009674393,0.0000931173,0.00024117978,0.000008350963,0.00015410405,3.389173e-7,0.7684569,0.00009711829,0.21909736,0.010834078,0.00065118325],"about_ca_topic_score_codex":0.00004867678,"about_ca_topic_score_gemma":0.00028278623,"teacher_disagreement_score":0.95878613,"about_ca_system_score_codex":0.00015245144,"about_ca_system_score_gemma":0.00036702395,"threshold_uncertainty_score":0.99968743},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016138503,0.00012372137,0.9954591,0.00022451213,0.0013374927,0.0010235261,0.000022924209,0.00062687055,0.0011657343],"genre_scores_gemma":[0.0013428286,0.00006829191,0.99599165,0.0018135067,0.0004100983,0.000046634414,0.000029674056,0.000072032926,0.00022527047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99492943,0.0000751042,0.0007723519,0.0023081466,0.001021219,0.00089372776],"domain_scores_gemma":[0.9962719,0.00037328512,0.0004029347,0.0021388505,0.00052993617,0.00028308414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015770844,0.0007455091,0.0007220521,0.0012263543,0.0004504491,0.0009813114,0.004016181,0.00045308136,0.000020602063],"category_scores_gemma":[0.000034542467,0.0007182911,0.00023690268,0.00090805325,0.00055149815,0.00052026426,0.00078415894,0.00047782494,0.000014568724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024543988,0.00011176109,0.0000026853797,0.000028774986,0.000013186829,0.00002448783,0.0008388208,0.0056746295,0.00011100451,0.10665816,0.00014740898,0.88638663],"study_design_scores_gemma":[0.00026104273,0.0004887782,0.0000073064684,0.00017087697,0.000007962598,0.00003787506,8.4614804e-8,0.8896762,0.0012013715,0.10293664,0.0044207335,0.00079111813],"about_ca_topic_score_codex":0.000028253204,"about_ca_topic_score_gemma":0.000011437858,"teacher_disagreement_score":0.8855955,"about_ca_system_score_codex":0.00028520566,"about_ca_system_score_gemma":0.00043198882,"threshold_uncertainty_score":0.9995268},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001153176,0.0010825989,0.9926945,0.00007943794,0.004283938,0.0010499569,0.00003742594,0.00025899205,0.00039784436],"genre_scores_gemma":[0.06026245,0.000030926956,0.93880445,0.00022085852,0.00024602286,0.00008862945,0.00003452411,0.000054464555,0.0002576566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99425113,0.00026346656,0.0010800632,0.0024209286,0.0010011861,0.0009832227],"domain_scores_gemma":[0.994578,0.0011304847,0.0010235709,0.0025542718,0.0004443085,0.000269332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037880964,0.000831157,0.0012744393,0.0014690479,0.00044842548,0.0009016358,0.005086417,0.0004062998,0.000007977172],"category_scores_gemma":[0.00035486868,0.00073661737,0.0004370768,0.00094792986,0.0005253685,0.0008485981,0.0014419877,0.000868046,0.000007816553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000138085,0.00007875029,0.00009707014,0.00021500305,0.00021490746,0.000010140286,0.0010499553,0.0218991,0.0015024594,0.05014977,0.000040761846,0.9247283],"study_design_scores_gemma":[0.0002340758,0.00027474592,0.00005259785,0.00015683986,0.00014854538,0.00001723907,3.6958397e-7,0.945382,0.009474576,0.042742632,0.00066219,0.0008541825],"about_ca_topic_score_codex":0.00009431848,"about_ca_topic_score_gemma":0.000012880302,"teacher_disagreement_score":0.9238741,"about_ca_system_score_codex":0.0005305392,"about_ca_system_score_gemma":0.0002461328,"threshold_uncertainty_score":0.9995085},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004635906,0.00083294447,0.9882907,0.0013471091,0.00089205516,0.00065021584,0.000006888915,0.00009571233,0.0032484676],"genre_scores_gemma":[0.90092164,0.000034883447,0.0967811,0.0017825954,0.00026667432,0.000032285683,0.0000026722444,0.000026779633,0.0001513697],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586374,0.00011543908,0.000705995,0.0013173507,0.0012820772,0.000715411],"domain_scores_gemma":[0.9963454,0.0009189973,0.00039532926,0.0021105339,0.00012911738,0.00010060078],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001953088,0.00053716305,0.0006222842,0.00074334315,0.00014034685,0.00045299172,0.007165935,0.0003391394,0.00007667213],"category_scores_gemma":[0.00009474458,0.0003759933,0.00016912253,0.0011135634,0.0011105295,0.00075425685,0.0012418175,0.0010777031,0.000054546028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011247297,0.00012151209,0.0008752762,0.00015723122,0.00002009706,0.00047347986,0.008673324,0.014690912,0.00056640495,0.33359233,0.000083890765,0.6407343],"study_design_scores_gemma":[0.00032980726,0.00022107162,0.002029906,0.0009400191,0.000008980963,0.00019016609,0.0000015818669,0.3465902,0.00059649674,0.6476688,0.0006262303,0.00079676404],"about_ca_topic_score_codex":0.00012178452,"about_ca_topic_score_gemma":0.00011826729,"teacher_disagreement_score":0.8962857,"about_ca_system_score_codex":0.00014060257,"about_ca_system_score_gemma":0.00048141202,"threshold_uncertainty_score":0.9998692},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022075502,0.0017648874,0.9667163,0.00026384954,0.0006766903,0.0004257334,0.000004853607,0.0000434994,0.008028698],"genre_scores_gemma":[0.983274,0.00017719057,0.01612041,0.00025114111,0.00010533345,0.000005846734,7.51166e-7,0.000010286726,0.000055066605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981057,0.00005131729,0.00035099828,0.0006548896,0.000572634,0.0002644744],"domain_scores_gemma":[0.9981152,0.0005903979,0.00034331577,0.00058000855,0.00032018652,0.000050899256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046700815,0.00027694498,0.0003934293,0.0002947378,0.00019701714,0.00008607476,0.0011421698,0.00013378503,0.0000058473956],"category_scores_gemma":[0.00023464802,0.00017434859,0.00009222711,0.0002531465,0.0013967666,0.00018087785,0.000612398,0.00031312587,0.0000033992453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080633,0.00028328746,0.00037746943,0.00027757965,0.00007517182,0.00005264945,0.016564248,0.0018399073,0.005892997,0.78541285,0.00008630117,0.18905689],"study_design_scores_gemma":[0.0013508727,0.0025617804,0.0029975246,0.004476763,0.00006159273,0.0002820357,0.000005503064,0.14230135,0.31918722,0.524579,0.0004273926,0.0017689624],"about_ca_topic_score_codex":0.000040197203,"about_ca_topic_score_gemma":0.000039654464,"teacher_disagreement_score":0.96119845,"about_ca_system_score_codex":0.000053459677,"about_ca_system_score_gemma":0.00028667596,"threshold_uncertainty_score":0.71097296},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011158354,0.00043345802,0.98313606,0.0003025985,0.0016564192,0.00020677668,0.0000032403266,0.00022340221,0.013926482],"genre_scores_gemma":[0.2099303,0.000032336287,0.78590435,0.0027602979,0.0008721511,0.000009441154,0.000007667267,0.000045690464,0.0004377817],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677944,0.000036556172,0.00047667438,0.0012860427,0.00076805404,0.00065323396],"domain_scores_gemma":[0.9977199,0.00049414695,0.00022353581,0.0011546494,0.00023192604,0.00017583132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013696877,0.0004479674,0.0003637946,0.0011939364,0.0005301418,0.0006918598,0.002626519,0.0002525759,0.00004270219],"category_scores_gemma":[0.000064561114,0.0004336139,0.00017072474,0.0009769097,0.0005535093,0.0005541267,0.0008313466,0.0007860453,0.00006338088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022226634,0.000013984712,0.000017553544,0.000011450107,0.000007902431,0.000070414775,0.00076942856,0.009848164,0.00022970092,0.31865853,0.000007929447,0.6703627],"study_design_scores_gemma":[0.00020521978,0.0001556428,0.000056492518,0.00025208807,0.000009647375,0.00010248677,2.4681842e-7,0.29743487,0.0027901174,0.6958156,0.0023133613,0.0008642202],"about_ca_topic_score_codex":0.00000715678,"about_ca_topic_score_gemma":0.00006136268,"teacher_disagreement_score":0.6694985,"about_ca_system_score_codex":0.00013845517,"about_ca_system_score_gemma":0.00036460315,"threshold_uncertainty_score":0.9998116},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39563265,0.000014147477,0.6037543,0.0003007432,0.00013087032,0.000060170936,0.0000012670038,0.000021205937,0.00008466142],"genre_scores_gemma":[0.6883863,0.000001220527,0.3111969,0.00038188565,0.000029729565,5.616338e-7,3.72964e-7,0.0000019891029,0.0000010313137],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988985,0.0000318876,0.00021892005,0.00028939854,0.00034162035,0.00021966315],"domain_scores_gemma":[0.99889785,0.0005700688,0.00008896873,0.0003261753,0.00007094623,0.00004599386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049969275,0.0001019516,0.00018403925,0.00024363518,0.00006594691,0.00002867023,0.00036688696,0.0000599845,0.0000315775],"category_scores_gemma":[0.00053179206,0.00007272872,0.000037860646,0.0017509736,0.00012522624,0.00007959283,0.00006231351,0.0001376559,0.000004357974],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066177534,0.002298219,0.02140446,0.00007021362,0.000019168287,0.00006766708,0.0011652667,0.058521345,0.047323182,0.15510106,0.0004607914,0.71350247],"study_design_scores_gemma":[0.00092540495,0.0014988198,0.11475514,0.00021685779,0.0000118423395,0.000021431379,0.0000029635503,0.25747865,0.16795227,0.45650882,0.00011506446,0.0005127633],"about_ca_topic_score_codex":0.0000074121403,"about_ca_topic_score_gemma":0.0000022002193,"teacher_disagreement_score":0.7129897,"about_ca_system_score_codex":0.000033705022,"about_ca_system_score_gemma":0.000033880307,"threshold_uncertainty_score":0.2965791},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014720863,0.00076020387,0.9937213,0.00025818133,0.0021124785,0.00056300254,0.0000060974767,0.00020860064,0.0008980543],"genre_scores_gemma":[0.80592835,0.00014274579,0.19132765,0.0008227857,0.0014181037,0.000030656578,0.000009413958,0.00007858932,0.00024169397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99487215,0.000071728435,0.00062088197,0.0018821387,0.0012341888,0.0013189133],"domain_scores_gemma":[0.99687696,0.00067279354,0.000360097,0.0015305944,0.00024535842,0.00031419194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006606056,0.0007815028,0.0007650676,0.0007545032,0.00020209338,0.0004910982,0.0029375046,0.00053304754,0.00007421548],"category_scores_gemma":[0.000021309032,0.0006587766,0.0001197756,0.0011619314,0.0007167725,0.00090961554,0.001131208,0.0017302582,0.00002913267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002084029,0.0000717197,0.004536688,0.000026067584,0.000021508373,0.00022663546,0.0004908846,0.17493205,0.000037928545,0.0053736884,0.000016044689,0.81424594],"study_design_scores_gemma":[0.00041989385,0.00017495398,0.0040294253,0.00062301476,0.0000070830038,0.00019736422,2.0176593e-7,0.98921883,0.00017074124,0.0035188862,0.00059619534,0.0010434313],"about_ca_topic_score_codex":0.00005794026,"about_ca_topic_score_gemma":0.0005726413,"teacher_disagreement_score":0.81428677,"about_ca_system_score_codex":0.0005307362,"about_ca_system_score_gemma":0.0004695414,"threshold_uncertainty_score":0.99958634},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18035522,0.000016404945,0.8174415,0.0012164153,0.0006584894,0.00022161032,0.000021988537,0.000028287914,0.000040045612],"genre_scores_gemma":[0.886376,0.000003197374,0.11111257,0.0023349728,0.0001617083,0.0000025161892,0.0000024509736,0.0000055101336,0.0000010225971],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975742,0.00009672589,0.0002546679,0.0010009514,0.0007484806,0.00032494753],"domain_scores_gemma":[0.9959593,0.0031142656,0.00016595336,0.00055797776,0.00014779838,0.00005470015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005315803,0.00018454141,0.0002137082,0.00029503554,0.00031180956,0.00006643464,0.0007419461,0.000046699442,0.000011666948],"category_scores_gemma":[0.0028387026,0.00016857471,0.000034075278,0.0017223787,0.00065849716,0.0010293982,0.00041646507,0.00021613203,0.0000070907895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012967699,0.00020415988,0.0012494368,0.00001046665,0.0000072126095,0.000020442492,0.0012717542,0.4236025,0.48683664,0.00035134345,0.00008824039,0.086228125],"study_design_scores_gemma":[0.00032754228,0.00023404189,0.013608772,0.000045563975,0.0000056205745,0.000026291875,0.000005313842,0.6141264,0.3636659,0.0077936705,0.000004273695,0.00015664018],"about_ca_topic_score_codex":0.000055083794,"about_ca_topic_score_gemma":0.000051293027,"teacher_disagreement_score":0.706329,"about_ca_system_score_codex":0.00016962174,"about_ca_system_score_gemma":0.0002448604,"threshold_uncertainty_score":0.68742776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000501938,0.00006696089,0.9833882,0.014556026,0.00054478436,0.00035457473,0.000044331795,0.000064609594,0.00047858097],"genre_scores_gemma":[0.09743992,0.000024121613,0.8971149,0.004374601,0.0005046907,0.000005143689,0.00013575805,0.000021723241,0.00037916968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972346,0.000034636992,0.00040702778,0.0009821777,0.0009261896,0.00041539178],"domain_scores_gemma":[0.99675506,0.00064139406,0.0002918763,0.0018835798,0.0002795788,0.00014852047],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00067697815,0.00036932615,0.00032122142,0.00040559156,0.0003381903,0.0015108678,0.0039710486,0.00014761246,0.000053973],"category_scores_gemma":[0.00021099344,0.00025342312,0.000031938805,0.00054611097,0.00032356003,0.0017432027,0.0025505512,0.0006483661,0.00011856843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020575853,0.000045180543,0.0003134052,0.00004644945,0.000057339545,0.000015315994,0.0029569394,0.012157771,0.00009749235,0.26671892,0.0022016196,0.715369],"study_design_scores_gemma":[0.00022482358,0.00023321291,0.0012205477,0.00032454624,0.000016940863,0.00006749379,0.000002304307,0.82769865,0.000047137124,0.1529303,0.016640129,0.00059388194],"about_ca_topic_score_codex":0.00012078788,"about_ca_topic_score_gemma":0.00007266525,"teacher_disagreement_score":0.8155409,"about_ca_system_score_codex":0.00011645786,"about_ca_system_score_gemma":0.0005357723,"threshold_uncertainty_score":0.9999918},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3852223,0.0042643077,0.57456946,0.016622636,0.003929512,0.0070295595,0.0002493279,0.0015229271,0.006589968],"genre_scores_gemma":[0.9914593,0.000093979696,0.005912374,0.0013313269,0.00038569505,0.000078748926,0.000024935041,0.0000042668867,0.00070936384],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804133,0.000012034107,0.00029669635,0.0008201445,0.00029245683,0.0005373221],"domain_scores_gemma":[0.9991003,0.00034573727,0.0001594954,0.00019695745,0.00011033732,0.00008711771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025691016,0.00034915344,0.00039348888,0.00006728743,0.0001819248,0.00014045718,0.0010583418,0.0004408634,0.00026600502],"category_scores_gemma":[0.00004286603,0.00014451584,0.00014625055,0.0001225005,0.0004865958,0.000113663635,0.0002938385,0.00035739242,0.00007423707],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011706619,0.000023879753,0.00009529574,0.000012595562,0.000010292074,0.0000070033734,0.000058715872,0.00024166929,0.0056006196,0.0024890497,0.00004819988,0.99140096],"study_design_scores_gemma":[0.0014262497,0.0032738883,0.011110761,0.00087233644,0.000092422,0.00012188695,0.000006383429,0.090192445,0.012653957,0.77466124,0.10248914,0.003099269],"about_ca_topic_score_codex":0.000035589823,"about_ca_topic_score_gemma":0.000403599,"teacher_disagreement_score":0.9883017,"about_ca_system_score_codex":0.00009233263,"about_ca_system_score_gemma":0.000020044039,"threshold_uncertainty_score":0.5893185},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006685667,0.00023653853,0.9944816,0.0004735959,0.0023686315,0.0005121642,0.0000023308617,0.00043190786,0.0014263666],"genre_scores_gemma":[0.2397923,0.00013418082,0.75050366,0.0054079983,0.0031254978,0.000058818343,0.000029756138,0.00017186241,0.00077593216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938889,0.00009177266,0.0007429557,0.0026680473,0.0014453254,0.0011629952],"domain_scores_gemma":[0.99524367,0.00080691505,0.00049328525,0.002834972,0.00030169796,0.00031944897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009394681,0.0008730016,0.00078767183,0.00087766873,0.0003832472,0.00058632024,0.00426959,0.0006837301,0.000007295052],"category_scores_gemma":[0.00003350278,0.00081950775,0.00020719168,0.0009798298,0.0006995656,0.00022014634,0.0011069347,0.0013255237,0.00011091926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022657052,0.000017297445,0.0000037709008,0.0000064142628,0.0000056001154,0.000023633913,0.000043254673,0.5039258,0.00002647376,0.013442134,0.000012598783,0.48249078],"study_design_scores_gemma":[0.00025447825,0.00018274275,0.00002608756,0.00030142238,0.00000951866,0.00005543783,3.6931706e-8,0.9893598,0.00048253743,0.0065867947,0.0018622953,0.0008788344],"about_ca_topic_score_codex":0.000022088907,"about_ca_topic_score_gemma":0.000037221675,"teacher_disagreement_score":0.48543403,"about_ca_system_score_codex":0.00047258488,"about_ca_system_score_gemma":0.00022157775,"threshold_uncertainty_score":0.9994256},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44858524,0.00015560348,0.5507966,0.00006386188,0.00026435123,0.000076670374,0.0000032908608,0.000017713315,0.000036627378],"genre_scores_gemma":[0.6457432,0.0000033624842,0.35403448,0.000091974674,0.00011520859,9.645714e-7,0.000003149774,0.0000071405543,5.3514407e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99846953,0.000050228726,0.00026100027,0.0003129684,0.00044292977,0.00046334488],"domain_scores_gemma":[0.99849,0.00075519254,0.0001127077,0.00029492818,0.00019800644,0.00014919203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058317976,0.00015610487,0.00026695928,0.00036587683,0.00016820707,0.00005671677,0.00023971226,0.000038406142,0.000056931636],"category_scores_gemma":[0.0005532843,0.00013558529,0.00006394997,0.0010511286,0.0011695742,0.00036388362,0.00008623928,0.00019080074,0.000008409378],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003741635,0.00018795262,0.25618854,0.000046873036,0.000018026243,0.000003083742,0.0020358013,0.0042559025,0.7308696,0.000101468526,0.000006239486,0.0062490692],"study_design_scores_gemma":[0.002056389,0.0004331249,0.4123524,0.00061316526,0.00013657275,0.00092575885,0.000027655184,0.32884264,0.24884363,0.005075195,0.00008027795,0.0006131967],"about_ca_topic_score_codex":0.00018658709,"about_ca_topic_score_gemma":0.000007945331,"teacher_disagreement_score":0.48202598,"about_ca_system_score_codex":0.00007583131,"about_ca_system_score_gemma":0.00011265267,"threshold_uncertainty_score":0.5529008},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011532477,0.00001676848,0.99723184,0.000095897245,0.00067563466,0.00017863976,0.000108878674,0.0000640784,0.00047499264],"genre_scores_gemma":[0.24347216,0.00001270267,0.75555,0.00052576425,0.0002831317,0.00000753749,0.000120514764,0.000014989064,0.000013138068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751925,0.000021593376,0.0006125033,0.0006620088,0.0007749876,0.0004096382],"domain_scores_gemma":[0.99812824,0.00022727338,0.0002798763,0.001016759,0.00021902357,0.00012883246],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056969153,0.0003062715,0.0003736692,0.00052141544,0.00017568958,0.00047287837,0.0023157515,0.00018336141,0.000012557505],"category_scores_gemma":[0.00006558043,0.00029632772,0.000080803315,0.0003548167,0.00044734063,0.0011118345,0.0008541852,0.00037337205,0.000021385922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020990947,0.000016098078,0.00015848596,0.00006601148,0.0000080991085,0.000004984587,0.00090541254,0.0137268305,0.00015197293,0.0149059,0.000021467384,0.97003263],"study_design_scores_gemma":[0.00015682897,0.00008082535,0.00009530047,0.00036584266,0.000008715081,0.00003944223,4.1405866e-7,0.9940398,0.0015042957,0.0021623052,0.0011812649,0.00036499684],"about_ca_topic_score_codex":0.000031021136,"about_ca_topic_score_gemma":0.0000070026995,"teacher_disagreement_score":0.98031294,"about_ca_system_score_codex":0.00012699373,"about_ca_system_score_gemma":0.00039587865,"threshold_uncertainty_score":0.99994886},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.1641435e-7,0.0013100026,0.99042106,0.0015997214,0.003943378,0.0007259141,0.00001254353,0.0001681086,0.0018186835],"genre_scores_gemma":[0.000514956,0.0000765534,0.9935132,0.001858883,0.0018616628,0.000010830796,0.000009424435,0.000040043247,0.002114445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602455,0.000015443402,0.0004850247,0.001499116,0.0011324448,0.0008434443],"domain_scores_gemma":[0.9957283,0.0013609837,0.0002858677,0.002107409,0.00025352725,0.0002639267],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013348768,0.00055609894,0.0004626374,0.0005436346,0.00054261816,0.0008262185,0.0056546866,0.00034898144,0.000027594786],"category_scores_gemma":[0.00008106658,0.0003761214,0.00019797627,0.00062147964,0.0004033557,0.0006470863,0.0020838177,0.00076508103,0.00003770554],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058510395,0.000008389033,0.0000026494408,0.000010734326,0.000010135173,0.00002337192,0.00024341593,0.004717106,0.000022274566,0.01908928,0.0004871859,0.9753796],"study_design_scores_gemma":[0.00040247227,0.00016889384,0.00005241374,0.00020089075,0.0000127381345,0.000085934225,1.8567205e-7,0.8273931,0.00062798697,0.10806943,0.062381364,0.00060459855],"about_ca_topic_score_codex":0.00008853794,"about_ca_topic_score_gemma":0.000065764056,"teacher_disagreement_score":0.974775,"about_ca_system_score_codex":0.00019851138,"about_ca_system_score_gemma":0.00076361094,"threshold_uncertainty_score":0.99986905},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03161725,0.000052112457,0.96619016,0.0012596805,0.00017266697,0.0006463568,0.0000031062364,0.000056989807,0.0000016945387],"genre_scores_gemma":[0.5947875,0.0000030726023,0.40445024,0.00066933496,0.00002794204,0.000057225785,0.000001430918,0.000002805612,4.8510094e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846375,0.00008369062,0.00034198456,0.0004940168,0.00033989953,0.00027665254],"domain_scores_gemma":[0.9979187,0.0014522964,0.00012431378,0.00024506362,0.00016974042,0.000089848574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072386686,0.00013317635,0.00020950423,0.0003546103,0.00013212311,0.00013454976,0.00053479825,0.000098020384,0.000007690265],"category_scores_gemma":[0.0005745542,0.00011594961,0.00003870009,0.00085255626,0.00033320708,0.0008702844,0.00022982384,0.00021036345,0.0000012196901],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021011978,0.00007549703,0.0016345545,0.000032939657,0.000003944894,0.0000021919952,0.001735611,0.004462683,0.12783465,0.00009612435,0.00006820863,0.86403257],"study_design_scores_gemma":[0.00086130167,0.00016773041,0.0094893975,0.00010113538,0.000001012849,0.000005445885,0.000005025047,0.6995321,0.2785641,0.011153792,0.0000018431317,0.000117158845],"about_ca_topic_score_codex":0.0002699314,"about_ca_topic_score_gemma":0.00042775538,"teacher_disagreement_score":0.86391544,"about_ca_system_score_codex":0.000065131506,"about_ca_system_score_gemma":0.00010527167,"threshold_uncertainty_score":0.4728288},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000083358296,0.002652873,0.99305934,0.00069804036,0.0013068015,0.0018926556,0.00001286223,0.00022683149,0.000067243156],"genre_scores_gemma":[0.28001678,0.00017308063,0.7165201,0.0023885914,0.00055982056,0.0001383692,0.000019599984,0.00011438122,0.00006934039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950832,0.00005387991,0.000636839,0.0023260699,0.0007648578,0.0011351572],"domain_scores_gemma":[0.99677634,0.0009140417,0.00041784116,0.0011844279,0.00034368777,0.00036368147],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010601796,0.0007976274,0.00084567425,0.0003942496,0.0004907516,0.0011145294,0.0018197164,0.00059447926,0.0000069176185],"category_scores_gemma":[0.000041064384,0.0007355852,0.00013177501,0.0005203949,0.0014164011,0.00048969424,0.001241142,0.00090646814,0.0000017834591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025505748,0.000026583062,0.00008152312,0.00007045426,0.000016298536,0.00009581415,0.0002944661,0.08586302,0.0000032566143,0.004782326,0.000012636224,0.9087281],"study_design_scores_gemma":[0.0012727481,0.00032398934,0.00006883455,0.0009869201,0.000016087224,0.00008631503,4.1426532e-7,0.9845978,0.00006313805,0.010661966,0.0010718411,0.00084996026],"about_ca_topic_score_codex":0.000008086024,"about_ca_topic_score_gemma":0.00004155835,"teacher_disagreement_score":0.90787816,"about_ca_system_score_codex":0.00030023206,"about_ca_system_score_gemma":0.0005294197,"threshold_uncertainty_score":0.9999224},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04204903,0.000028686449,0.95528513,0.00008723309,0.00069759437,0.0013259498,9.258621e-7,0.0003023276,0.00022310567],"genre_scores_gemma":[0.74501956,0.0000015824908,0.25469938,0.00008564512,0.00009341435,0.000038070157,4.1702233e-7,0.000022825507,0.00003912123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643457,0.00012497019,0.0006882328,0.0013420202,0.0009450037,0.00046521242],"domain_scores_gemma":[0.9968304,0.00075199315,0.00038085593,0.0013361711,0.00052465615,0.00017592938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014447668,0.00045887163,0.00068544026,0.0008085745,0.00028780047,0.00049009646,0.0021633473,0.0002052439,0.000006488304],"category_scores_gemma":[0.00037182806,0.0004243723,0.00010596455,0.0008266614,0.00030397897,0.00027460477,0.0011167793,0.0007921187,0.000022955663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018373792,0.0015283739,0.00066476007,0.00048077008,0.00006221015,0.0016368688,0.04035874,0.18567635,0.00016816863,0.007659596,0.000008887885,0.76173687],"study_design_scores_gemma":[0.00049271336,0.0047450764,0.00008082401,0.0007025058,0.000037765523,0.0014742799,0.00005563239,0.97642803,0.0005940152,0.014280989,0.00027319984,0.00083499675],"about_ca_topic_score_codex":0.0001401574,"about_ca_topic_score_gemma":0.00039314732,"teacher_disagreement_score":0.79075164,"about_ca_system_score_codex":0.0002566228,"about_ca_system_score_gemma":0.00026903793,"threshold_uncertainty_score":0.9998208},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000385217,0.0009114771,0.99257046,0.0005664549,0.0012402281,0.0005023618,0.000021920134,0.00038870302,0.0034131694],"genre_scores_gemma":[0.9142931,0.0002263614,0.08153857,0.002947111,0.0008014389,0.000011730406,0.000027460896,0.0000872265,0.00006698992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944269,0.00009915339,0.0007612716,0.0023737717,0.0013387271,0.0010001841],"domain_scores_gemma":[0.995782,0.00074654905,0.0004365084,0.0022240714,0.00035112575,0.00045974567],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015919735,0.0008319169,0.00091896066,0.0013284286,0.0005178566,0.0013050365,0.003779342,0.0004912694,0.000052889016],"category_scores_gemma":[0.00014071711,0.00080121943,0.00020570993,0.0008540499,0.0014761484,0.00077979814,0.0011101449,0.00123697,0.00008464386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007864104,0.00008146986,0.00049718656,0.00019239291,0.00004397971,0.00016705252,0.001742781,0.0015725839,0.0005188463,0.49895257,0.00016078123,0.4960625],"study_design_scores_gemma":[0.00096698717,0.0004863787,0.0037087074,0.0008983632,0.000038427355,0.0005601907,3.8421763e-7,0.1557481,0.00046138233,0.82667536,0.008546595,0.0019091357],"about_ca_topic_score_codex":0.000049562583,"about_ca_topic_score_gemma":0.00010611469,"teacher_disagreement_score":0.9139079,"about_ca_system_score_codex":0.00017100215,"about_ca_system_score_gemma":0.00045073617,"threshold_uncertainty_score":0.9997317},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031737186,0.0005729442,0.9903979,0.00019815048,0.002474411,0.00038269584,0.000020411058,0.0002443801,0.0053917626],"genre_scores_gemma":[0.49658698,0.000058598707,0.50116247,0.0013145418,0.0007194744,0.000017986968,0.000036556048,0.00004841117,0.000054959903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957532,0.000046596906,0.00054718397,0.0018251891,0.0010910319,0.00073678093],"domain_scores_gemma":[0.9969295,0.00021449623,0.00034635348,0.0020314339,0.00024036439,0.00023784637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097029976,0.0005686662,0.00047268107,0.0010049916,0.00033974135,0.00050333055,0.0036798827,0.00031077056,0.00008163166],"category_scores_gemma":[0.00004712309,0.0005234679,0.00021580768,0.00085240876,0.0006294578,0.0004741137,0.0017195585,0.0008603076,0.000114507355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012841754,0.00012296056,0.00007789587,0.000048778704,0.000020058607,0.000102340535,0.0028783216,0.018751163,0.0001650802,0.5750846,0.00008251361,0.40265346],"study_design_scores_gemma":[0.00048826545,0.00016603687,0.00027322996,0.00028516105,0.000016288413,0.00007434645,1.8526933e-7,0.44757703,0.0015459687,0.5445023,0.004003063,0.0010680929],"about_ca_topic_score_codex":0.00004479421,"about_ca_topic_score_gemma":0.00010671665,"teacher_disagreement_score":0.4962696,"about_ca_system_score_codex":0.00015621008,"about_ca_system_score_gemma":0.00034063854,"threshold_uncertainty_score":0.9997217},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008705808,0.00008478261,0.99338084,0.0020536182,0.000864046,0.0012158833,0.00005079967,0.0000944263,0.0013850266],"genre_scores_gemma":[0.97787565,0.0000024103567,0.019990554,0.0004972364,0.0013865129,0.00008720597,0.00009431899,0.000029196304,0.000036922404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996557,0.00017546021,0.00079990533,0.00096382847,0.00067364844,0.0008301333],"domain_scores_gemma":[0.9965751,0.0017557583,0.000824736,0.00031412707,0.00039835263,0.0001319082],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021309445,0.00037938764,0.00082970544,0.0008645951,0.00053577364,0.0004238459,0.0012012236,0.00067811256,0.00001024392],"category_scores_gemma":[0.002422069,0.00037987478,0.000078912635,0.0010631777,0.00095465325,0.00024246474,0.00013768378,0.0007290107,0.0000038557255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007195119,0.000076665645,0.021576736,0.000388849,0.000013803563,0.00004877241,0.004600285,0.3162536,0.000040325634,0.4886257,0.000015791376,0.1682875],"study_design_scores_gemma":[0.0009991559,0.0001228887,0.0031905305,0.001535177,0.0000109648445,0.0000032355526,0.000023327957,0.6585299,0.000019097939,0.33368105,0.0011056722,0.00077903894],"about_ca_topic_score_codex":0.0022911136,"about_ca_topic_score_gemma":0.010442644,"teacher_disagreement_score":0.97700506,"about_ca_system_score_codex":0.0007683167,"about_ca_system_score_gemma":0.00173465,"threshold_uncertainty_score":0.9998653},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007415333,0.0005579459,0.99339014,0.00056027144,0.001210022,0.0008712569,0.000054614367,0.0002518539,0.0030297174],"genre_scores_gemma":[0.14689171,0.000082454644,0.84694433,0.0022733295,0.0009391778,0.000059038146,0.00007805628,0.000089958536,0.0026419323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944458,0.000026614945,0.0008558014,0.0022415926,0.0013054676,0.0011247498],"domain_scores_gemma":[0.9963825,0.0008662218,0.00045886062,0.0011912382,0.00070956204,0.000391628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008006641,0.00086586317,0.0008852596,0.00057691644,0.0006151194,0.00034282779,0.0036517174,0.00060597056,0.000009211171],"category_scores_gemma":[0.00018844499,0.00078210735,0.0003761477,0.000518017,0.0008945516,0.0006104382,0.0010687108,0.0010124162,0.00007017376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022119993,0.00013152372,0.0000068058043,0.00007194293,0.000031187017,0.00008511911,0.0015802885,0.8955169,0.00005343475,0.017913923,0.001483344,0.083103426],"study_design_scores_gemma":[0.0007386437,0.00020122946,0.00003455797,0.00016808954,0.000012609674,0.00012472973,1.0690696e-7,0.9387012,0.0002397507,0.056938656,0.0019742013,0.00086623],"about_ca_topic_score_codex":0.00004368496,"about_ca_topic_score_gemma":0.00005826435,"teacher_disagreement_score":0.14681755,"about_ca_system_score_codex":0.00043423867,"about_ca_system_score_gemma":0.0018542614,"threshold_uncertainty_score":0.99946296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004331657,0.0007654684,0.991983,0.0006896799,0.0031809774,0.001057612,0.0000050459184,0.00016005074,0.002153846],"genre_scores_gemma":[0.45500314,0.000046835845,0.5386981,0.0023271716,0.0027105703,0.00014516292,0.000023876295,0.000047114267,0.0009980649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996518,0.000021680686,0.0005024264,0.0012006718,0.0011680513,0.0005891616],"domain_scores_gemma":[0.9968883,0.001465981,0.00027479167,0.00072389183,0.00052801357,0.00011902371],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013935887,0.00041065062,0.00033637122,0.0004876463,0.0008641258,0.0008126732,0.0023067077,0.000304798,0.000022054404],"category_scores_gemma":[0.00025330024,0.00027160608,0.00018386115,0.00048739134,0.0007612001,0.00033361054,0.00055730186,0.0005073616,0.000042657637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017423428,0.000036560963,0.000015394155,0.000046461955,0.000014342186,0.000017256662,0.00015734947,0.008402565,0.000017018894,0.5922157,0.00010760701,0.39895234],"study_design_scores_gemma":[0.00021163396,0.00024040551,0.00010627429,0.00007158733,0.000010029727,0.00020982424,2.0122869e-7,0.19677858,0.00013710794,0.79653573,0.00533944,0.00035920736],"about_ca_topic_score_codex":0.000021212383,"about_ca_topic_score_gemma":0.00014607108,"teacher_disagreement_score":0.4549988,"about_ca_system_score_codex":0.00031129702,"about_ca_system_score_gemma":0.00086672354,"threshold_uncertainty_score":0.9999736},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53685904,0.00010578624,0.46205503,0.00019296104,0.00027885256,0.00020529052,0.00005557446,0.000010919067,0.0002365409],"genre_scores_gemma":[0.99191666,0.000013125899,0.0076416773,0.000093183924,0.00011345869,0.0000085291,0.000038774408,0.000012004313,0.00016261463],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907565,0.000017944725,0.00024260991,0.00039255904,0.00014562256,0.00012563633],"domain_scores_gemma":[0.9992565,0.0001879077,0.00014526595,0.00017229583,0.0001982051,0.000039817187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019167768,0.00016491137,0.0002163623,0.0001677764,0.00010813241,0.00005956797,0.0000895008,0.00007449558,0.00007067265],"category_scores_gemma":[0.000016950597,0.00014621302,0.000028517612,0.00009451138,0.00052099,0.00015479719,0.00015281599,0.00031295064,0.000004520933],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018917938,0.00050878135,0.03892973,0.00019080551,0.00039177298,0.000022071647,0.00259747,0.010255195,0.16270968,0.016948953,0.00016432861,0.76709205],"study_design_scores_gemma":[0.0017533123,0.00032033713,0.0033441766,0.0011045672,0.00016958092,0.00022874707,0.00006466064,0.060443334,0.3743829,0.55588675,0.00068967376,0.0016119395],"about_ca_topic_score_codex":0.000044987006,"about_ca_topic_score_gemma":0.00003654111,"teacher_disagreement_score":0.7654801,"about_ca_system_score_codex":0.00003483571,"about_ca_system_score_gemma":0.00005578306,"threshold_uncertainty_score":0.5962394},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017220144,0.00013245737,0.99809337,0.000060867216,0.00053109624,0.0005508839,0.0000059111017,0.0004101264,0.000043119537],"genre_scores_gemma":[0.23621082,0.000020301943,0.7635693,0.00006680059,0.00009099131,0.00000726223,0.00000116608,0.000025009776,0.00000835564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970487,0.000048510577,0.00059848407,0.0009845204,0.0007682412,0.00055157626],"domain_scores_gemma":[0.99791545,0.0002823796,0.00039996454,0.0009550315,0.00034075158,0.000106426916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084993173,0.00041881064,0.00046129426,0.00088007905,0.00024295106,0.0001301271,0.0018611809,0.00028145095,0.0000042710053],"category_scores_gemma":[0.000045902387,0.00042459025,0.00011846611,0.0004317415,0.00045500952,0.00048022074,0.0008586103,0.000619223,0.0000023732962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002002462,0.000019568544,0.000037511767,0.000057966245,0.000010998116,0.000050787414,0.00068276,0.412688,0.002614795,0.011154855,0.0000026894647,0.5726781],"study_design_scores_gemma":[0.000100584904,0.00011891609,0.000030312567,0.00067585,0.0000067975475,0.00023578833,4.722957e-8,0.97184247,0.019255547,0.007194026,0.00009990067,0.0004397658],"about_ca_topic_score_codex":0.000045107405,"about_ca_topic_score_gemma":0.000010429485,"teacher_disagreement_score":0.5722383,"about_ca_system_score_codex":0.0004129829,"about_ca_system_score_gemma":0.0006508728,"threshold_uncertainty_score":0.9998206},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010286198,0.00023197163,0.98961854,0.00036256286,0.0038107065,0.000753553,0.000009392782,0.00022283183,0.004980177],"genre_scores_gemma":[0.0050129467,0.000019160576,0.9925345,0.001358867,0.0005630999,0.000026568048,0.000008502393,0.00004131045,0.00043505378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556243,0.000042095726,0.00066631346,0.0017401319,0.0011118142,0.00087718666],"domain_scores_gemma":[0.99661225,0.00065597263,0.00030015217,0.0018107693,0.00038786847,0.00023297362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027924452,0.0005251133,0.00054675585,0.0010102462,0.00030719832,0.00047891287,0.00459212,0.00050509046,0.000006978848],"category_scores_gemma":[0.00021054834,0.0004929572,0.00019381847,0.0006091795,0.0008378753,0.0010721876,0.0011288611,0.0008844698,0.000028485367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010791682,0.000015777381,0.0000022935053,0.000037171743,0.0000048275383,0.000010721787,0.00034094148,0.022025693,0.000038029513,0.36494124,0.000015262143,0.6125573],"study_design_scores_gemma":[0.00014547772,0.00009822566,0.000015541851,0.00010682373,0.000003670342,0.00003014404,3.643119e-8,0.5816592,0.0008397974,0.41468635,0.0020499944,0.00036475435],"about_ca_topic_score_codex":0.0000061919595,"about_ca_topic_score_gemma":0.000016103304,"teacher_disagreement_score":0.6121925,"about_ca_system_score_codex":0.0003948134,"about_ca_system_score_gemma":0.0005391894,"threshold_uncertainty_score":0.9997522},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006383167,0.00044069107,0.9466089,0.00044373056,0.0019000494,0.0004448806,0.000002337384,0.000060217684,0.049460866],"genre_scores_gemma":[0.9067416,0.00042262554,0.0863758,0.00047676844,0.0013627441,0.000010438669,0.0000019260126,0.00005216351,0.004555939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965275,0.00011101291,0.00058990036,0.0007605994,0.0014355638,0.00057544134],"domain_scores_gemma":[0.9965319,0.001631696,0.00030517616,0.0005717852,0.0007933871,0.00016603436],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0031249833,0.00029839706,0.00043911827,0.00041251993,0.00056931,0.0002698417,0.0026580151,0.00068108435,0.00031613576],"category_scores_gemma":[0.00041150412,0.00028995876,0.00012351389,0.00044017885,0.004124088,0.0003364063,0.0005986015,0.001287779,0.00023930715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005549009,0.00006590414,0.00012684989,0.00006192148,0.000016802738,0.0000075248186,0.072984695,0.31176895,0.00003053456,0.36140072,0.00002743886,0.25350308],"study_design_scores_gemma":[0.000057087535,0.00009791052,0.000005773944,0.0008002362,0.000017444117,0.0000015050387,0.000019732286,0.18548967,0.0010086403,0.7965566,0.015284772,0.0006606405],"about_ca_topic_score_codex":0.0019059384,"about_ca_topic_score_gemma":0.0023926436,"teacher_disagreement_score":0.90610325,"about_ca_system_score_codex":0.00034189352,"about_ca_system_score_gemma":0.0012984588,"threshold_uncertainty_score":0.99995524},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32655394,0.000070114416,0.6722714,0.00035003354,0.00036266888,0.0003109411,0.0000018350094,0.00006681085,0.000012292007],"genre_scores_gemma":[0.76507396,0.0000010366816,0.23446742,0.00024382542,0.00017354787,0.00002554668,0.00000648057,0.000007397498,8.093644e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9990185,0.00001164729,0.00022700251,0.00032476312,0.0001811097,0.00023700591],"domain_scores_gemma":[0.9990821,0.00023434569,0.00010458105,0.00025477057,0.0002627874,0.00006142527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005501546,0.00010925806,0.000224788,0.00019077792,0.00008710414,0.000027084854,0.00016693615,0.00008487913,0.0000022624806],"category_scores_gemma":[0.0005388624,0.00009236287,0.000055773653,0.00060591486,0.00018732566,0.00014379185,0.00006340274,0.00021389805,1.4438862e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010585971,0.00008750063,0.11534875,0.00019988065,0.000009502156,0.0000035973985,0.0006796892,0.0051345844,0.49131858,0.000022868475,0.000027891912,0.3870613],"study_design_scores_gemma":[0.00042594335,0.00029329036,0.3457201,0.00029311917,0.000015341822,0.00008352535,0.0000031797279,0.33109096,0.3207087,0.0011237896,0.00008686939,0.00015520035],"about_ca_topic_score_codex":0.000039858314,"about_ca_topic_score_gemma":0.000017585164,"teacher_disagreement_score":0.43852,"about_ca_system_score_codex":0.000032836477,"about_ca_system_score_gemma":0.00039356033,"threshold_uncertainty_score":0.37664485},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034562934,0.00052717474,0.94721276,0.00651228,0.00073509413,0.008966498,0.0000044340004,0.000079716345,0.0013991286],"genre_scores_gemma":[0.9757111,0.000010640465,0.021970684,0.0021427106,0.000066273955,0.000080447535,5.5262467e-7,0.000011668036,0.000005909875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816847,0.000072664814,0.0002611469,0.00066286,0.0005456683,0.00028919388],"domain_scores_gemma":[0.9973648,0.0014266699,0.00016487774,0.0008497715,0.0001468081,0.00004708222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016457873,0.00024847643,0.00024711376,0.00035519086,0.00021343748,0.00025051585,0.0017501218,0.00017953092,0.000004254977],"category_scores_gemma":[0.00023685084,0.00013704822,0.000039733426,0.0009392296,0.0012060903,0.000099487865,0.0004127994,0.00091127265,0.0000015012597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017068029,0.00065349054,0.00587503,0.0008675368,0.00003814045,0.00026674647,0.027853543,0.01062709,0.0024176105,0.55752057,0.00013109873,0.39357847],"study_design_scores_gemma":[0.0007550785,0.0018061841,0.0051905173,0.0017117097,0.000013664417,0.00010113143,0.0000021861815,0.35826623,0.0047480245,0.6246269,0.0019077767,0.0008706606],"about_ca_topic_score_codex":0.00001718886,"about_ca_topic_score_gemma":0.00006794924,"teacher_disagreement_score":0.94114816,"about_ca_system_score_codex":0.000015446103,"about_ca_system_score_gemma":0.00022512545,"threshold_uncertainty_score":0.55886644},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011660857,0.0002094114,0.9871312,0.0019848493,0.0017090685,0.0005371407,0.000006606819,0.0005625636,0.0066930773],"genre_scores_gemma":[0.8044584,0.000025887097,0.18177179,0.012707449,0.0008508817,0.00001504223,0.00006978712,0.000060717917,0.00004009269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606705,0.000058929054,0.00073625165,0.0013410206,0.0011964208,0.0006003307],"domain_scores_gemma":[0.99678284,0.0004518993,0.00068168767,0.0013799533,0.00055974943,0.00014384491],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006454342,0.0005760638,0.00058545975,0.00072838087,0.0002467347,0.0003364913,0.0030777345,0.00036979,0.000031688367],"category_scores_gemma":[0.000015152175,0.0005136443,0.00011442668,0.0014934208,0.00019008515,0.0006356116,0.000621703,0.000585055,0.00006570364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019321405,0.000047371093,0.000045327226,0.00019762744,0.000026912778,0.000024216606,0.0017789385,0.83767515,0.00034755486,0.086309314,0.000009882574,0.07351841],"study_design_scores_gemma":[0.0008839058,0.0006615457,0.0009414534,0.0031245633,0.000039509756,0.00004513253,0.0000010040774,0.6896334,0.034203194,0.267873,0.0012540853,0.0013391778],"about_ca_topic_score_codex":0.00019317129,"about_ca_topic_score_gemma":0.00051007286,"teacher_disagreement_score":0.8053594,"about_ca_system_score_codex":0.00020269094,"about_ca_system_score_gemma":0.000797255,"threshold_uncertainty_score":0.99973154},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037932394,0.0003588673,0.99603754,0.00042346632,0.00077894365,0.0010560238,0.000013738,0.0000928921,0.0012005781],"genre_scores_gemma":[0.018493358,0.000028053491,0.97977716,0.0008386999,0.00039976614,0.00004184899,0.00001067113,0.00002422671,0.00038621653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717236,0.000017976168,0.0004679165,0.0013597452,0.0005148668,0.00046714055],"domain_scores_gemma":[0.9984248,0.0002382093,0.00034046834,0.00058822945,0.0002967764,0.00011146478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007001174,0.0004166352,0.00045579224,0.00050232606,0.00031019494,0.00053344504,0.0013000149,0.00025919772,0.00000204871],"category_scores_gemma":[0.00005576962,0.000380618,0.00006483291,0.00040845346,0.0002264564,0.0005775007,0.0006019538,0.00026249912,0.0000043715404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008775477,0.000055064495,0.000042912176,0.00017403807,0.000034752105,0.000007683909,0.0038956453,0.02946218,0.00043744507,0.076239616,0.000062406274,0.8895795],"study_design_scores_gemma":[0.0005519069,0.00008448308,0.00022259391,0.00020235867,0.000006782704,0.000041867926,4.4820953e-7,0.98687977,0.0005688028,0.0047769537,0.0060706786,0.000593381],"about_ca_topic_score_codex":0.000013964296,"about_ca_topic_score_gemma":0.000036945556,"teacher_disagreement_score":0.95741755,"about_ca_system_score_codex":0.0003644118,"about_ca_system_score_gemma":0.00064102083,"threshold_uncertainty_score":0.9998646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005716008,0.00036321694,0.9758145,0.0012955277,0.0018808509,0.0005467814,0.000007183314,0.00007903245,0.014296859],"genre_scores_gemma":[0.9871123,0.0003954786,0.010573247,0.00093411584,0.00024756504,0.000007756849,0.0000040996483,0.000033324548,0.0006921015],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771774,0.000037463225,0.00032507195,0.001077325,0.00041510028,0.0004273073],"domain_scores_gemma":[0.9978047,0.0008369029,0.00033118288,0.0006435909,0.0002782096,0.00010542007],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00033524094,0.00046320338,0.0003451783,0.00032196855,0.00043551764,0.001440336,0.0009758478,0.00023165555,0.0000047589765],"category_scores_gemma":[0.00009534686,0.0003393085,0.00007697754,0.00020172384,0.0005484279,0.0016013805,0.00068506086,0.0011029984,0.000014574551],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014865086,0.00006349551,0.00036681216,0.00004614582,0.000060278802,0.00010412473,0.005307599,0.00026947324,0.0040060533,0.037604436,0.00016273883,0.9518602],"study_design_scores_gemma":[0.0022636843,0.008308399,0.0067397803,0.009952194,0.00014510196,0.0037016443,0.0001435125,0.2153258,0.28356963,0.34158447,0.120556206,0.0077095493],"about_ca_topic_score_codex":0.000035533794,"about_ca_topic_score_gemma":0.00004104837,"teacher_disagreement_score":0.9813963,"about_ca_system_score_codex":0.00020823786,"about_ca_system_score_gemma":0.00008803544,"threshold_uncertainty_score":0.9999059},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014150594,0.0002265295,0.99348754,0.0009140753,0.001452988,0.0005261107,0.0000011793255,0.0003156711,0.002934418],"genre_scores_gemma":[0.84237427,0.00010100458,0.14619431,0.0012669245,0.0015131441,0.000020691332,0.000019405437,0.00008553213,0.008424706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946228,0.00014622869,0.0008253494,0.0015223915,0.0018043113,0.0010788921],"domain_scores_gemma":[0.9957723,0.0013237508,0.00054820854,0.0018735129,0.000261457,0.00022076404],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015442092,0.00067783793,0.00073717016,0.0004261674,0.0006857551,0.0018057395,0.0066374615,0.0004276863,0.0000079946585],"category_scores_gemma":[0.00025739,0.00049913954,0.00016625208,0.00070923095,0.00075079245,0.0004879945,0.0017675812,0.0023191255,0.00008773235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014584929,0.000005022452,0.0006869675,0.00002012132,0.000011245604,0.000026708314,0.00029295354,0.7779467,0.000023109358,0.009256474,0.000004698606,0.21172452],"study_design_scores_gemma":[0.00014976619,0.00033325967,0.0023875276,0.00042227717,0.000016038844,0.000029461497,2.5182618e-7,0.982404,0.00006466273,0.011425955,0.0021464652,0.0006203508],"about_ca_topic_score_codex":0.000047726237,"about_ca_topic_score_gemma":0.000020156313,"teacher_disagreement_score":0.8472932,"about_ca_system_score_codex":0.00041109047,"about_ca_system_score_gemma":0.0005561899,"threshold_uncertainty_score":0.99998254},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011728981,0.0011041682,0.9963953,0.0002171619,0.0002248597,0.00084658485,0.000007703314,0.000020914822,0.001066029],"genre_scores_gemma":[0.57860285,0.00007391505,0.42102805,0.00017008423,0.00006431174,0.000035155743,0.0000023755288,0.000007341041,0.000015925027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997789,0.00011073266,0.0006336673,0.00062286056,0.00062766584,0.00021601906],"domain_scores_gemma":[0.9974323,0.0005184863,0.0005181692,0.0012670448,0.00022625453,0.000037780617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023178076,0.000212112,0.0003965917,0.00057011365,0.00006839315,0.00010287831,0.002286463,0.00012086711,7.050456e-7],"category_scores_gemma":[0.000097278644,0.00016686543,0.00005004031,0.0005843424,0.0005647288,0.00031915808,0.00014774254,0.00033081905,0.0000016700253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056475183,0.000038234208,0.000054274864,0.00008795813,0.0000052396886,0.0000021855253,0.00067408575,0.009368379,0.00050585286,0.27476752,0.0000028121874,0.7144878],"study_design_scores_gemma":[0.00045070442,0.00028441948,0.0025151153,0.0003978276,0.000019696892,0.00007936634,0.0000017060277,0.8504971,0.0024919244,0.14103812,0.0018081088,0.00041590966],"about_ca_topic_score_codex":0.000036639623,"about_ca_topic_score_gemma":0.0000075785633,"teacher_disagreement_score":0.8411287,"about_ca_system_score_codex":0.00007867465,"about_ca_system_score_gemma":0.00016297927,"threshold_uncertainty_score":0.6804575},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000244187,0.00068293273,0.98397946,0.0011538543,0.0018088847,0.00042594227,0.0000054612547,0.00016318199,0.011755855],"genre_scores_gemma":[0.057511576,0.000044704466,0.93571955,0.0020628478,0.0013035733,0.000018416362,0.00003123056,0.000045945442,0.0032621413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961759,0.00004133131,0.00050958566,0.0014171426,0.0013083153,0.00054774625],"domain_scores_gemma":[0.9975404,0.0002608441,0.00026288713,0.0010804252,0.00058672857,0.00026868063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009719775,0.0004656278,0.000416328,0.00089409295,0.00020523774,0.00055546715,0.0023825287,0.0002620335,0.000036291305],"category_scores_gemma":[0.00010792483,0.0004402696,0.00010574859,0.00097156985,0.00034390212,0.0006890011,0.001092359,0.0006064624,0.00017940174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006604688,0.00003868827,0.00001460631,0.000040152652,0.000010287959,0.00010025535,0.00043037784,0.23809946,0.0001245709,0.087137185,0.00107724,0.6729206],"study_design_scores_gemma":[0.0003876178,0.0002666364,0.00008136051,0.00025726075,0.000009774037,0.00012505369,8.996514e-8,0.5648204,0.00041688795,0.3908714,0.0419901,0.00077338115],"about_ca_topic_score_codex":0.000022737453,"about_ca_topic_score_gemma":0.000051668867,"teacher_disagreement_score":0.6721472,"about_ca_system_score_codex":0.0003507056,"about_ca_system_score_gemma":0.0011082534,"threshold_uncertainty_score":0.9998049},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017622096,0.00045196805,0.99341625,0.00040478518,0.0040051555,0.0005127442,0.0000089502055,0.00070574624,0.0003181548],"genre_scores_gemma":[0.012992119,0.000020933701,0.9850715,0.0011524279,0.0003992845,0.000010624026,0.0000025591814,0.000077042976,0.0002735558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99494517,0.00004539613,0.0005006513,0.0021970458,0.0011058039,0.0012059108],"domain_scores_gemma":[0.99514616,0.0015100423,0.00030107837,0.002332881,0.00037247164,0.00033736022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012198807,0.000816472,0.0008097116,0.0009790553,0.000383263,0.00074974867,0.005036843,0.00071378966,0.00000563609],"category_scores_gemma":[0.00060699665,0.00079573056,0.00013825367,0.001106613,0.00041901306,0.0015629746,0.0026584356,0.002238755,0.000023327237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030155302,0.000007174897,0.0000073512088,0.000026624104,0.0000044881326,0.00006515103,0.00055358117,0.80052745,0.0040856753,0.0032073918,0.0000043632135,0.19150771],"study_design_scores_gemma":[0.00011238841,0.000071276285,0.000023354867,0.0006486078,0.000006443783,0.00011268866,1.3669457e-7,0.57474273,0.011391466,0.41097787,0.00097315875,0.00093987945],"about_ca_topic_score_codex":0.0000088181805,"about_ca_topic_score_gemma":0.0000720446,"teacher_disagreement_score":0.40777048,"about_ca_system_score_codex":0.0004682161,"about_ca_system_score_gemma":0.00056974625,"threshold_uncertainty_score":0.9994494},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050363295,0.00083194004,0.9756521,0.01637769,0.0029172977,0.0010396952,0.000019438216,0.0011388368,0.0019726213],"genre_scores_gemma":[0.009844455,0.00015136464,0.9877251,0.00106116,0.0008978059,0.000033438188,0.000011952509,0.00006307092,0.00021165052],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99331087,0.000038650578,0.0008943222,0.0028366104,0.0013475006,0.0015720539],"domain_scores_gemma":[0.9815392,0.0012192859,0.0005499372,0.016070321,0.0003690872,0.00025217165],"candidate_categories":["metaresearch","metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0019642133,0.00083048723,0.00085616374,0.0014084624,0.00056437077,0.0009915547,0.08277401,0.00069655303,0.0000092609735],"category_scores_gemma":[0.010742339,0.0008197928,0.0002076973,0.0009931417,0.00059455313,0.0015077543,0.10446283,0.0014953786,0.00002591782],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067978713,0.000027898705,0.000054810345,0.00010373924,0.0000117185555,0.000045937915,0.00012250905,0.0012715558,0.00012581112,0.005851339,0.0023009244,0.99007696],"study_design_scores_gemma":[0.00024307315,0.0002023652,0.000075004384,0.0005041237,0.000005684328,0.000037142134,9.257541e-8,0.3414465,0.0018349492,0.6475378,0.007454298,0.0006589334],"about_ca_topic_score_codex":0.000029226414,"about_ca_topic_score_gemma":0.000030606658,"teacher_disagreement_score":0.989418,"about_ca_system_score_codex":0.0008623249,"about_ca_system_score_gemma":0.00087768404,"threshold_uncertainty_score":0.9994253},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030686625,0.0010337206,0.98650664,0.005156976,0.0023270908,0.0004882658,0.0000036617175,0.00042260534,0.0037541434],"genre_scores_gemma":[0.31401756,0.0002628959,0.6812665,0.0025893925,0.0006563284,0.000028480232,0.0000025778957,0.00007128629,0.0011050137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950817,0.00004441349,0.00072985096,0.0016496397,0.001535298,0.0009590637],"domain_scores_gemma":[0.9953229,0.0007427738,0.00045066685,0.0029327543,0.00040676777,0.00014414644],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011269281,0.0006197021,0.0007468807,0.0010940694,0.0004965075,0.0004179683,0.010041799,0.0004350436,0.000010110812],"category_scores_gemma":[0.00023633661,0.00046894574,0.0001717448,0.0018704345,0.0014971093,0.00059911923,0.004101266,0.0012354152,0.00006273274],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008329379,0.000043900433,0.00007544683,0.000051433177,0.000027915547,0.00020069847,0.002149438,0.09397329,0.00041539775,0.03355897,0.0012228404,0.86827236],"study_design_scores_gemma":[0.0007013881,0.00079056795,0.00085312687,0.0027113322,0.000031713647,0.000602944,0.0000013488292,0.54113704,0.03478814,0.3357119,0.079543345,0.0031271437],"about_ca_topic_score_codex":0.000054677235,"about_ca_topic_score_gemma":0.00008563281,"teacher_disagreement_score":0.8651452,"about_ca_system_score_codex":0.0002872174,"about_ca_system_score_gemma":0.0005711098,"threshold_uncertainty_score":0.99977624},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003022213,0.001163359,0.9890319,0.0004193305,0.0026807785,0.0010899308,0.000012729104,0.00020489245,0.005394021],"genre_scores_gemma":[0.0017240671,0.000016893031,0.99581575,0.00095229107,0.00062951347,0.000025921276,0.000011571566,0.00004780006,0.0007761601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955728,0.000103564,0.0008517465,0.0015822705,0.0010143975,0.0008752019],"domain_scores_gemma":[0.996276,0.0014077822,0.0003311486,0.0011489275,0.00063534116,0.00020076745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0046234676,0.0006084204,0.0006986789,0.0013280087,0.00036422518,0.0010248694,0.0023797513,0.0004411005,0.000010651353],"category_scores_gemma":[0.0001439493,0.0005485903,0.00023996686,0.000879641,0.00027282588,0.0010272053,0.00020251876,0.00070891203,0.000011980413],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020110452,0.000017268821,0.000003402196,0.00009526153,0.00001748078,0.00006510673,0.0007720199,0.0069303084,0.0008951173,0.041238986,0.000017090735,0.94992787],"study_design_scores_gemma":[0.0005675609,0.00018064247,0.000007156322,0.000362165,0.000016760812,0.00011816687,1.2651498e-7,0.7831987,0.0021810762,0.20919901,0.003572091,0.0005965044],"about_ca_topic_score_codex":0.00008652843,"about_ca_topic_score_gemma":0.00004735452,"teacher_disagreement_score":0.94933134,"about_ca_system_score_codex":0.00035810252,"about_ca_system_score_gemma":0.00064667145,"threshold_uncertainty_score":0.99969655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042062657,0.00007371259,0.9906207,0.0015182367,0.00029906657,0.0005738582,0.000016705935,0.00022721193,0.0066284933],"genre_scores_gemma":[0.48942715,0.000036897814,0.5093106,0.00070378324,0.00013514743,0.000032286473,0.000019409721,0.00003273162,0.0003019625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620503,0.000051431536,0.00065331033,0.0013778323,0.0012170564,0.0004953092],"domain_scores_gemma":[0.99640673,0.00034921017,0.00060328795,0.0021011266,0.00039488738,0.00014473803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073200447,0.0004330386,0.0005535995,0.0008527032,0.00013165842,0.00023963337,0.0037190553,0.00029085923,0.000021418236],"category_scores_gemma":[0.00007416086,0.0003575171,0.00008007512,0.0007376735,0.0011235952,0.00078715076,0.0004808494,0.00069011265,0.000021227595],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044136174,0.00010579155,0.0005294267,0.000058388046,0.000028820343,0.000051401115,0.00029814965,0.0020067822,0.002047241,0.28820157,0.00009810101,0.70653015],"study_design_scores_gemma":[0.0016416904,0.0009920038,0.006706903,0.0010468177,0.000033884426,0.00020489792,3.2963672e-7,0.6562989,0.0077845724,0.31382895,0.009864169,0.0015969194],"about_ca_topic_score_codex":0.0000127325875,"about_ca_topic_score_gemma":0.000025276377,"teacher_disagreement_score":0.7049333,"about_ca_system_score_codex":0.000294689,"about_ca_system_score_gemma":0.0005776441,"threshold_uncertainty_score":0.9998877},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042037605,0.0000464201,0.99352366,0.00010504766,0.0005361617,0.00039625983,0.00001992768,0.0001377642,0.0010310047],"genre_scores_gemma":[0.78386325,0.000003169592,0.21465391,0.00024244626,0.0006524228,0.0000069466796,0.000015531301,0.000051255312,0.00051105296],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981944,0.000022468306,0.00039931122,0.0006088605,0.00050867756,0.000266309],"domain_scores_gemma":[0.9984146,0.00025703447,0.0002774746,0.00049745024,0.00043808497,0.00011537235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032538318,0.0002940048,0.00033552642,0.00037205644,0.00019946395,0.000110031426,0.00042277892,0.00027091766,0.00004183304],"category_scores_gemma":[0.00013811975,0.0002736144,0.0000776347,0.00026302104,0.0003031295,0.00017322125,0.00014116174,0.0003975479,0.000036928723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011745173,0.00045505492,0.00050617196,0.00032097736,0.0001283156,0.000092763345,0.0037289236,0.08836818,0.04971934,0.1653184,0.00026767913,0.69097674],"study_design_scores_gemma":[0.000494407,0.0001465642,0.00009875423,0.00022502686,0.00004974504,0.00012299317,0.0000012022344,0.4186444,0.0060926853,0.5707205,0.0026607804,0.0007429324],"about_ca_topic_score_codex":0.000016625841,"about_ca_topic_score_gemma":0.000058168855,"teacher_disagreement_score":0.7796595,"about_ca_system_score_codex":0.00034717275,"about_ca_system_score_gemma":0.00018418083,"threshold_uncertainty_score":0.9999716},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055931265,0.00006113973,0.99763703,0.00024728052,0.00061784225,0.0009743324,0.000016445918,0.00027686302,0.00011310758],"genre_scores_gemma":[0.018288001,0.000024519733,0.9807729,0.0006187742,0.00018448533,0.000034616412,0.000024606728,0.000046010802,0.0000060737416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700797,0.000041392585,0.00046701118,0.0014170296,0.00048390558,0.0005826928],"domain_scores_gemma":[0.9982519,0.00041145293,0.00026280756,0.00069571356,0.0002525375,0.00012554703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006938712,0.0005459542,0.0004433329,0.0009338783,0.0006202246,0.00057613314,0.0011340386,0.00038948195,0.0000017242927],"category_scores_gemma":[0.00003810474,0.00050592143,0.00015233099,0.00030941336,0.00049481814,0.00061726006,0.00024901854,0.0007035187,5.283987e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016082076,0.000039191622,0.000005599003,0.000059835424,0.000008591675,0.000038580518,0.0006144313,0.095079795,0.0017087474,0.00029966977,3.6629822e-7,0.9021291],"study_design_scores_gemma":[0.00046514109,0.00029910935,0.00004070171,0.0004836678,0.000012989562,0.00004028049,1.06979414e-7,0.9280359,0.034307756,0.03567581,0.00006682604,0.0005717143],"about_ca_topic_score_codex":0.000008167141,"about_ca_topic_score_gemma":0.0000053718104,"teacher_disagreement_score":0.9015574,"about_ca_system_score_codex":0.00014888971,"about_ca_system_score_gemma":0.00013477942,"threshold_uncertainty_score":0.9997392},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020560757,0.00040792392,0.9966556,0.00008794761,0.00030722335,0.00028472114,0.0000015130493,0.00014087681,0.000058137837],"genre_scores_gemma":[0.10419793,0.00006223082,0.8954962,0.000110857836,0.00006532572,0.000014879523,0.0000031628815,0.000015981355,0.000033468103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669546,0.00005731114,0.0007394695,0.0011131744,0.0009022696,0.0004923351],"domain_scores_gemma":[0.9968479,0.0011514401,0.00034597635,0.0013495927,0.00025791363,0.000047133166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015137974,0.00045444918,0.0006850056,0.001335894,0.00019610251,0.00009484703,0.0040099295,0.00015398765,8.942188e-7],"category_scores_gemma":[0.0007200751,0.00032742557,0.00013001925,0.0020090481,0.00045290234,0.0004930208,0.00095324294,0.00082625396,0.000001825952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013346701,0.000009582099,0.00029643145,0.00003031744,0.000014015511,0.000008015064,0.0043947375,0.7199329,0.000028387138,0.00014834398,0.0000010206082,0.2751349],"study_design_scores_gemma":[0.000080941914,0.000041120722,0.0010485905,0.00025920113,0.0000133418425,0.000019827077,6.5020123e-7,0.98985,0.001812888,0.006394246,0.00004552833,0.00043368942],"about_ca_topic_score_codex":0.0000045361644,"about_ca_topic_score_gemma":0.000068920264,"teacher_disagreement_score":0.2747012,"about_ca_system_score_codex":0.000218857,"about_ca_system_score_gemma":0.00066135515,"threshold_uncertainty_score":0.9999178},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014339606,0.00044288012,0.9928592,0.00015694315,0.003341451,0.0006660541,0.000041802625,0.00008732568,0.0022609502],"genre_scores_gemma":[0.39464512,0.00014763871,0.59137523,0.00043927037,0.008314978,0.00007823203,0.000023211978,0.00018227992,0.004794011],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99313074,0.000036342928,0.00081793225,0.0016958668,0.0034435631,0.0008755301],"domain_scores_gemma":[0.9931648,0.004237153,0.00030098064,0.0010988353,0.0009994314,0.00019879825],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004861481,0.00043897456,0.00053827814,0.0017834706,0.00044462248,0.0011581592,0.002335814,0.00040670534,0.0000633829],"category_scores_gemma":[0.00080199115,0.00034152847,0.00019100375,0.00093956356,0.0010276957,0.0010247359,0.000589614,0.0008793776,0.000057035588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030951855,0.000012674536,0.00011218887,0.0000129517875,0.000008674696,0.000018963085,0.00024890417,0.25374734,0.00020560433,0.0021125088,0.00003544068,0.7434538],"study_design_scores_gemma":[0.00036487955,0.00033638882,0.0006276586,0.00017168272,0.0000065249324,0.000031249925,0.000008196867,0.19129139,0.0022099558,0.8012924,0.003218982,0.00044067885],"about_ca_topic_score_codex":0.000010512664,"about_ca_topic_score_gemma":0.000057024405,"teacher_disagreement_score":0.7991799,"about_ca_system_score_codex":0.0005393423,"about_ca_system_score_gemma":0.0008725174,"threshold_uncertainty_score":0.9999037},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001360304,0.00045676506,0.9959345,0.00008858552,0.0014825684,0.00031949717,0.000001292262,0.00008882334,0.00026767314],"genre_scores_gemma":[0.49180225,0.00008161295,0.50628704,0.0012550165,0.00025917107,0.000013970023,0.0000034725708,0.00004781022,0.00024964628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974362,0.00002472225,0.00041023426,0.0010708938,0.0005757064,0.00048221037],"domain_scores_gemma":[0.9987622,0.00025567802,0.00017158587,0.0006236515,0.00006622201,0.00012069466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006487775,0.0003691645,0.00037969352,0.00081647007,0.000107070904,0.00033527383,0.000987328,0.00023162391,0.000005532573],"category_scores_gemma":[0.00013226015,0.00036378918,0.00005114986,0.00043398613,0.00009328546,0.0005284603,0.0004998901,0.00045460885,0.0000097373495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047270673,0.000067235414,0.0063274587,0.0005085886,0.0000257211,0.00040865922,0.010077501,0.1591261,0.00039166826,0.012139223,0.000060849317,0.8108623],"study_design_scores_gemma":[0.00052155345,0.00007746379,0.004990914,0.001247887,0.0000044446315,0.000080816484,3.8939058e-7,0.98475957,0.0006037746,0.0054449127,0.0013702651,0.0008980176],"about_ca_topic_score_codex":0.00003298391,"about_ca_topic_score_gemma":0.000052725085,"teacher_disagreement_score":0.82563347,"about_ca_system_score_codex":0.00024376312,"about_ca_system_score_gemma":0.00011980089,"threshold_uncertainty_score":0.9998814},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023396857,0.0004371742,0.9938803,0.00087398756,0.0006946469,0.00033564883,0.000002120109,0.00018293931,0.0035698367],"genre_scores_gemma":[0.0155338915,0.00014230455,0.98153615,0.0013274495,0.00070539064,0.000010622472,0.0000067628503,0.00003873513,0.00069871184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963898,0.000016958033,0.00038384984,0.0016228679,0.0008894163,0.0006971139],"domain_scores_gemma":[0.99831176,0.00015050507,0.00022650477,0.0010593006,0.000081029466,0.00017092575],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00082036736,0.0005277054,0.000440234,0.000731676,0.0003034762,0.0013719262,0.0023467008,0.00013612174,0.000011366881],"category_scores_gemma":[0.00001327633,0.00044551745,0.0000489301,0.00042399345,0.0004419752,0.0016315569,0.0029470255,0.0005501746,0.000014830172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024628855,0.0000071839686,0.000015833051,0.000029600295,0.0000131619245,0.00010674267,0.00047302546,0.010813717,0.000006568534,0.007780329,0.000004682396,0.9807467],"study_design_scores_gemma":[0.00046075057,0.0002358714,0.00009308775,0.0006970664,0.000012214043,0.00012943229,5.469434e-7,0.9762155,0.00009581735,0.016816292,0.004375483,0.00086794846],"about_ca_topic_score_codex":0.00001991405,"about_ca_topic_score_gemma":0.000079202786,"teacher_disagreement_score":0.9798787,"about_ca_system_score_codex":0.00018881756,"about_ca_system_score_gemma":0.000118721466,"threshold_uncertainty_score":0.99979967},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000052233986,0.00005288672,0.8670595,0.0001648797,0.00048897165,0.13099636,0.0000030496747,0.00026417302,0.00096493645],"genre_scores_gemma":[0.00069548277,0.0000028462005,0.92344105,0.00092230015,0.0011941177,0.072891384,0.0000027932856,0.00007061478,0.00077938836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99394274,0.000069488764,0.00092796824,0.0025569608,0.0012782381,0.0012246256],"domain_scores_gemma":[0.9961237,0.00041565066,0.00072040246,0.0021224031,0.00028223623,0.00033562837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016606809,0.0008290248,0.0007064591,0.0008851095,0.00052718015,0.00091361505,0.0042629223,0.00034230968,0.0000636107],"category_scores_gemma":[0.000078950805,0.00077946007,0.00021671184,0.0008740038,0.0002441495,0.00069285824,0.0023438968,0.001026861,0.00003345471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021243259,0.00003265642,0.000002710582,0.0001458722,0.000014235084,0.00003516815,0.00026293565,0.21153471,0.0001098248,0.004516043,0.00009575841,0.7832288],"study_design_scores_gemma":[0.0010763914,0.0006205446,0.0000042260685,0.0011909904,0.000015396843,0.00004783247,2.293538e-7,0.89959633,0.0010123075,0.030814655,0.06458383,0.0010372627],"about_ca_topic_score_codex":0.00007834594,"about_ca_topic_score_gemma":0.00015457867,"teacher_disagreement_score":0.7821916,"about_ca_system_score_codex":0.0013069827,"about_ca_system_score_gemma":0.0015797281,"threshold_uncertainty_score":0.99946564},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014701554,0.0011365367,0.96827143,0.0005224536,0.0011824645,0.00045153458,0.000008573058,0.00009486499,0.028185146],"genre_scores_gemma":[0.7052555,0.00005064556,0.24723323,0.017955985,0.0051828492,0.00020062384,0.000044868175,0.0002073287,0.023868993],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763733,0.000031066997,0.00028961617,0.0011181051,0.00035726035,0.0005666484],"domain_scores_gemma":[0.99860466,0.0005192501,0.00018919904,0.00034917795,0.00024179737,0.00009590282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040312536,0.00039131823,0.0004033658,0.00038627253,0.00024196904,0.000115940325,0.0007022815,0.00032180978,0.000157094],"category_scores_gemma":[0.00007173001,0.00034832733,0.00011785909,0.0002029981,0.0004733194,0.00011531511,0.00015004745,0.00046953405,0.0000750566],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007215079,0.000033972145,0.000012023567,0.00001896077,0.000017079474,0.00004539826,0.002745903,0.00028858086,0.000037298538,0.011419148,0.000119253215,0.9851902],"study_design_scores_gemma":[0.0015453208,0.0028920316,0.00034486112,0.0017468394,0.000041325435,0.00023530179,0.00002212607,0.0057333773,0.00089556875,0.9010682,0.083475724,0.0019992937],"about_ca_topic_score_codex":0.0000086669925,"about_ca_topic_score_gemma":0.000025744812,"teacher_disagreement_score":0.98319095,"about_ca_system_score_codex":0.000100017285,"about_ca_system_score_gemma":0.00015872275,"threshold_uncertainty_score":0.9998969},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000077939614,0.000035476874,0.99581623,0.00048061158,0.001900579,0.0011976028,0.000014950401,0.00030564432,0.0001709503],"genre_scores_gemma":[0.03162435,0.00000596543,0.9655433,0.0017432225,0.0003775964,0.000074341144,0.0000057217103,0.000076493656,0.0005489615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951683,0.000034499102,0.0005275,0.0018277661,0.0012570982,0.0011848226],"domain_scores_gemma":[0.99510145,0.0022979977,0.00012653151,0.0017875803,0.00036449195,0.00032194037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016359871,0.0005836775,0.0005675871,0.0010952272,0.00022931052,0.0006852845,0.004218911,0.00027025517,0.000041598683],"category_scores_gemma":[0.00076471374,0.00058016065,0.00014615472,0.00064149086,0.00015812305,0.00032099048,0.00115675,0.0006479155,0.00006404267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000208711,0.000053191707,0.000728652,0.00022377231,0.00003778154,0.00019115105,0.0011668893,0.25611204,0.0011820858,0.008229875,0.0008362406,0.73121744],"study_design_scores_gemma":[0.0014032748,0.002306793,0.0039508804,0.0011720087,0.000022670387,0.00028618265,2.9742228e-7,0.85340166,0.015711673,0.066489875,0.05076564,0.0044890568],"about_ca_topic_score_codex":0.000009011904,"about_ca_topic_score_gemma":0.000008145262,"teacher_disagreement_score":0.7267284,"about_ca_system_score_codex":0.0006311414,"about_ca_system_score_gemma":0.0005439159,"threshold_uncertainty_score":0.99966496},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009464759,0.00053092156,0.99078965,0.00026016874,0.0043525426,0.0002798913,0.0000041282483,0.00025339663,0.0025828027],"genre_scores_gemma":[0.06882911,0.000015580117,0.928849,0.0012936082,0.0008230323,0.000003586528,0.0000021054332,0.00005091495,0.00013305471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955379,0.00008831515,0.0005837,0.0018316685,0.0010468757,0.00091159256],"domain_scores_gemma":[0.9965832,0.0006752564,0.00034259484,0.0019051098,0.00026700902,0.0002267817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001687792,0.0006414662,0.00072051655,0.0009190547,0.00038279602,0.0007205881,0.0033881771,0.00054312916,0.000029342937],"category_scores_gemma":[0.00015303007,0.00060655706,0.00019784113,0.00073522597,0.0008994081,0.0007041874,0.0009734487,0.0016514121,0.000034744335],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004840226,0.000049392336,0.0001533869,0.00003727777,0.000013536012,0.00017422308,0.00069888507,0.012079029,0.008996192,0.0018506523,0.0000029343737,0.97593963],"study_design_scores_gemma":[0.00092495244,0.00060664606,0.0008865684,0.0012079871,0.00003103148,0.0008750223,2.5247544e-7,0.7859333,0.02309621,0.17023312,0.012924893,0.0032800264],"about_ca_topic_score_codex":0.00008517078,"about_ca_topic_score_gemma":0.0004006715,"teacher_disagreement_score":0.97265965,"about_ca_system_score_codex":0.00030808087,"about_ca_system_score_gemma":0.0008328204,"threshold_uncertainty_score":0.99963856},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027167358,0.00021810934,0.9841619,0.00041702305,0.0012776202,0.0005865791,0.000007738129,0.00046749515,0.012836366],"genre_scores_gemma":[0.2993086,0.0000101579035,0.69702667,0.0022763307,0.0009501136,0.000026452106,0.000016381597,0.00005547892,0.00032982873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934256,0.0000825756,0.00084779813,0.003004649,0.0011470538,0.0014923068],"domain_scores_gemma":[0.99544513,0.00028199554,0.00032519284,0.002915049,0.0004109628,0.0006216621],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013109545,0.000956631,0.000858395,0.00077172613,0.00043961994,0.0014828992,0.0069456967,0.0006188643,0.000010337956],"category_scores_gemma":[0.00006448257,0.0009044334,0.0001653977,0.0012929497,0.00052508764,0.000983605,0.0014438564,0.0013476028,0.000054720025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074965046,0.00008932406,0.000052458476,0.000033782264,0.000009478102,0.000027417911,0.00044689362,0.56436586,0.00014499458,0.047819648,0.00020304919,0.38679957],"study_design_scores_gemma":[0.00015321061,0.00028812344,0.000088343426,0.00021386653,0.000007764075,0.000030016698,1.2304908e-7,0.8514156,0.000144964,0.14608766,0.000559738,0.001010628],"about_ca_topic_score_codex":0.00019457303,"about_ca_topic_score_gemma":0.00017172846,"teacher_disagreement_score":0.38578895,"about_ca_system_score_codex":0.0002967528,"about_ca_system_score_gemma":0.0010036196,"threshold_uncertainty_score":0.9995537},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021034047,0.00024957245,0.9934534,0.00022969407,0.0024465895,0.00080920535,7.3291034e-7,0.00025305778,0.0023474004],"genre_scores_gemma":[0.047398254,0.000046851583,0.94944745,0.0020328783,0.00081417366,0.00003907024,0.0000019650636,0.00004426121,0.00017512235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957892,0.000065739485,0.00055759284,0.0018316,0.0010103066,0.0007455817],"domain_scores_gemma":[0.9978535,0.00011885541,0.0002348936,0.0012580586,0.00025056803,0.00028410353],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083884253,0.00052907853,0.00044848176,0.0011044516,0.00046661551,0.0005555836,0.0020767355,0.00044365524,0.00000995295],"category_scores_gemma":[0.00008972551,0.00050649856,0.00013875739,0.0014540656,0.00026503502,0.00046543937,0.0010867913,0.0009866974,0.000069721835],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064317956,0.00003587542,0.0000028708666,0.000025029864,0.0000045283136,0.000013076458,0.00045145178,0.039059564,0.00021034462,0.0019905982,0.000010480477,0.9581897],"study_design_scores_gemma":[0.00026009147,0.0005844172,0.000038013364,0.0002668237,0.000010517352,0.0002721789,2.278015e-7,0.9149386,0.004594951,0.045901675,0.03213436,0.0009981052],"about_ca_topic_score_codex":0.00002507222,"about_ca_topic_score_gemma":0.00006350152,"teacher_disagreement_score":0.95719165,"about_ca_system_score_codex":0.00038435252,"about_ca_system_score_gemma":0.00018823608,"threshold_uncertainty_score":0.99973863},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002835613,0.00088443235,0.9925413,0.0002291109,0.0005135236,0.0005873021,7.154005e-7,0.00061316666,0.004346876],"genre_scores_gemma":[0.8121907,0.0001328612,0.1868227,0.00027988848,0.00039609286,0.000035291534,0.0000074162535,0.00008794993,0.000047067588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973988,0.0000099438885,0.0005864233,0.0007954249,0.00046136475,0.000748058],"domain_scores_gemma":[0.9984454,0.0005711066,0.000081568214,0.00073976803,0.00006162686,0.0001005376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041813529,0.00049964554,0.00073351373,0.00056314707,0.00006438983,0.00011495717,0.001086548,0.000727318,0.000014589737],"category_scores_gemma":[0.00018881027,0.00047684606,0.000098904435,0.0005717107,0.00059537764,0.00018497006,0.00029315698,0.0015881769,0.000014357423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012553896,0.000007900147,0.000011664488,0.000015332205,0.0000069731495,0.000040494164,0.00003999686,0.8094532,0.0000503688,0.020149076,0.0000023812834,0.17021005],"study_design_scores_gemma":[0.0010331807,0.000057670863,0.0000780072,0.00043932375,0.000009397618,0.00001284629,2.7984385e-7,0.8417068,0.00013077774,0.15579201,0.00021679916,0.0005228998],"about_ca_topic_score_codex":0.0000023999191,"about_ca_topic_score_gemma":0.00006557768,"teacher_disagreement_score":0.8119072,"about_ca_system_score_codex":0.0008198152,"about_ca_system_score_gemma":0.0001008311,"threshold_uncertainty_score":0.9997683},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033318825,0.0006401751,0.9721748,0.000087950844,0.00076271535,0.00011730498,0.000017663191,0.00025569362,0.02561047],"genre_scores_gemma":[0.7606159,0.0014604894,0.23021893,0.0019897018,0.0032694149,0.000020330917,0.00020355989,0.00019462426,0.0020270722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985371,0.0000059154886,0.00028761412,0.00046006346,0.00039432384,0.00031497746],"domain_scores_gemma":[0.9993474,0.00010878656,0.000056677134,0.0002803214,0.00010512786,0.00010166988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021387402,0.00028704962,0.00029032302,0.0022230032,0.00006665532,0.00014512749,0.0003914075,0.00022160348,0.0005175068],"category_scores_gemma":[0.00003185052,0.00028284025,0.000119213,0.0010823878,0.00016089177,0.00016297998,0.00007323965,0.00042641847,0.0005150081],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.163172e-7,0.000005586248,0.000005725681,0.000021353158,0.000011627614,0.000009818157,0.000033139422,0.021427508,0.000112905705,0.000020292586,0.000035782115,0.9783158],"study_design_scores_gemma":[0.00043743223,0.000085044296,0.00019237606,0.0006362149,0.00007889349,0.00007298401,2.2927786e-7,0.92399544,0.005180042,0.047186576,0.020573525,0.0015612207],"about_ca_topic_score_codex":0.0000037880006,"about_ca_topic_score_gemma":0.00003469646,"teacher_disagreement_score":0.97675455,"about_ca_system_score_codex":0.0001957175,"about_ca_system_score_gemma":0.000041399922,"threshold_uncertainty_score":0.9999624},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005128997,0.00067587045,0.99630314,0.00009549189,0.00016219496,0.00017075108,0.000022233786,0.000026188747,0.0024928183],"genre_scores_gemma":[0.59165007,0.00009430322,0.40010637,0.00074659,0.00021940928,0.000009523699,0.000013015938,0.00003483971,0.007125891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875885,0.0000028570469,0.00025157956,0.00043959144,0.00026127367,0.00028583626],"domain_scores_gemma":[0.9986569,0.0007074333,0.00013160829,0.00032845567,0.0001195899,0.00005597166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025433986,0.0002431583,0.00046040618,0.0004249875,0.000116402625,0.000019752526,0.00062170246,0.00016300203,0.0000143901225],"category_scores_gemma":[0.0000432354,0.00015929328,0.00015457472,0.0003992604,0.0010581709,0.000059323967,0.00023851408,0.00039279673,5.851557e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067472414,0.000005731131,0.00014523596,0.000013182211,0.0005163227,0.000003108702,0.0005532378,0.94258946,0.00019471666,0.033577368,0.0000031754794,0.02233096],"study_design_scores_gemma":[0.00018016915,0.000038095714,0.00004308966,0.00009951193,0.00031566736,0.0000045182005,4.4542423e-7,0.9949717,0.0008022322,0.0033496148,0.0000126954865,0.0001822758],"about_ca_topic_score_codex":0.00010038082,"about_ca_topic_score_gemma":0.00046634275,"teacher_disagreement_score":0.5961968,"about_ca_system_score_codex":0.00010248323,"about_ca_system_score_gemma":0.00020425109,"threshold_uncertainty_score":0.6495791},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20272315,0.000049015318,0.79303265,0.0009236658,0.0007308145,0.00093254016,0.00001070898,0.000035048775,0.0015624104],"genre_scores_gemma":[0.9838949,0.000039951065,0.013375029,0.0019212672,0.00028548224,0.000021464848,0.0000018953135,0.000021949214,0.00043807266],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99601805,0.00016468012,0.00043218757,0.001304436,0.001333705,0.0007469579],"domain_scores_gemma":[0.9948084,0.003447525,0.00028027096,0.00065851,0.0005841294,0.00022116778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019867541,0.00032521048,0.000342543,0.0005618997,0.0006173319,0.0005914839,0.00113873,0.0001577889,0.000130761],"category_scores_gemma":[0.0053514354,0.00024488382,0.000106577245,0.0009796224,0.0025912558,0.0009999367,0.0007117737,0.00092103204,0.00009116768],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014019477,0.000058802834,0.00089173514,0.00002975101,0.0000019768913,0.000004705473,0.0053122374,0.0014234391,0.0792982,0.0000941988,0.000015714819,0.9128552],"study_design_scores_gemma":[0.0006349085,0.0010657273,0.117302716,0.007356019,0.00010872484,0.00023553624,0.00015322042,0.18273737,0.67095053,0.011914366,0.0041651153,0.003375799],"about_ca_topic_score_codex":0.00008249207,"about_ca_topic_score_gemma":0.00004284159,"teacher_disagreement_score":0.90947944,"about_ca_system_score_codex":0.00027450695,"about_ca_system_score_gemma":0.0008788305,"threshold_uncertainty_score":0.9986072},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008041735,0.0008933081,0.994852,0.00027275612,0.0018241268,0.0006830137,0.000030094508,0.00021949109,0.0012171634],"genre_scores_gemma":[0.0055298368,0.000038032245,0.9918786,0.00058171496,0.00037905117,0.000044324282,0.000041898107,0.000043143467,0.0014633622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676424,0.000019859744,0.0005264895,0.001470753,0.00059262535,0.0006260503],"domain_scores_gemma":[0.9980213,0.00030490846,0.00031114358,0.0009815483,0.00027779106,0.00010328259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000595612,0.00048565576,0.00053004065,0.00054543104,0.000347356,0.00024955568,0.0014274505,0.00023954238,0.000007041125],"category_scores_gemma":[0.000050467344,0.00044047684,0.00014768173,0.00049674325,0.00033462263,0.0008885184,0.0005806605,0.00042362174,0.000023285285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065701383,0.000024516583,0.000018341767,0.00018014201,0.000010855829,0.000015595073,0.0001326311,0.0427177,0.00026086866,0.14562753,0.00019727986,0.81080794],"study_design_scores_gemma":[0.00027075646,0.00019424601,0.000036043282,0.0004930826,0.000007922015,0.00009507971,5.567524e-8,0.80765617,0.000562458,0.09225435,0.097667485,0.00076235837],"about_ca_topic_score_codex":0.00004482336,"about_ca_topic_score_gemma":0.0004115697,"teacher_disagreement_score":0.8100456,"about_ca_system_score_codex":0.00036776645,"about_ca_system_score_gemma":0.00041138614,"threshold_uncertainty_score":0.9998047},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057421687,0.0010664017,0.99357474,0.00064775464,0.0016384353,0.0003449645,0.000032965156,0.0002521842,0.0023851586],"genre_scores_gemma":[0.46788105,0.000036657584,0.526299,0.0048046787,0.00073086395,0.000016714845,0.00004389461,0.000070934526,0.00011620015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99487597,0.00006441087,0.00059989904,0.0021035,0.0014262054,0.0009300237],"domain_scores_gemma":[0.9957148,0.00076747953,0.00034939687,0.0025960414,0.00027791935,0.00029437355],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011881109,0.0007214213,0.00068301463,0.0011914192,0.0005377856,0.0012481359,0.005527488,0.000521493,0.00005166982],"category_scores_gemma":[0.00010940722,0.0006506508,0.00028456305,0.0010092922,0.001285465,0.00047367776,0.0012212062,0.0011340843,0.00006603917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033464035,0.00007016922,0.000026203374,0.00012415889,0.00002262591,0.0001463628,0.000305418,0.031600807,0.0013636707,0.8151607,0.0003009181,0.15084551],"study_design_scores_gemma":[0.00037528225,0.0002780222,0.00006462272,0.00035191924,0.0000128512065,0.000013986364,7.520706e-8,0.4725991,0.0028712726,0.5013871,0.021072555,0.00097318646],"about_ca_topic_score_codex":0.00005915753,"about_ca_topic_score_gemma":0.00020531887,"teacher_disagreement_score":0.46782362,"about_ca_system_score_codex":0.00018913252,"about_ca_system_score_gemma":0.0008021455,"threshold_uncertainty_score":0.9998531},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005892478,0.00013626681,0.98559904,0.0055142804,0.0006011592,0.0019241147,0.000016671978,0.000040829098,0.00027513324],"genre_scores_gemma":[0.33263597,0.00003615265,0.6638406,0.0028571778,0.0005528935,0.000022085911,0.000023347846,0.00002328129,0.000008518084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952721,0.00008712913,0.0023770654,0.00096143177,0.0009285607,0.00037371597],"domain_scores_gemma":[0.9939006,0.0021871524,0.0010755404,0.00041273521,0.002144562,0.00027940067],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024751578,0.00035948775,0.0007479868,0.00036745737,0.00017052054,0.00013876233,0.00020812111,0.00021894477,0.00006167622],"category_scores_gemma":[0.008427171,0.00031339042,0.00011747286,0.00029823743,0.00056291156,0.00033394495,0.00035121883,0.0007490737,0.0000073335605],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015003605,0.00011899672,0.00047012354,0.000110151675,0.00009410712,0.000021797487,0.0005191086,0.002657651,0.0029855836,0.0020319545,0.00004012335,0.9908004],"study_design_scores_gemma":[0.03623469,0.016451588,0.023132352,0.017891124,0.007133696,0.0072397706,0.0011406321,0.6464156,0.040561408,0.07037515,0.12286578,0.010558217],"about_ca_topic_score_codex":0.00008657004,"about_ca_topic_score_gemma":0.000029643188,"teacher_disagreement_score":0.98024213,"about_ca_system_score_codex":0.00027449644,"about_ca_system_score_gemma":0.0007377917,"threshold_uncertainty_score":0.9999318},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002033721,0.00010372745,0.99476737,0.001186942,0.0010226304,0.0007279177,0.000013258879,0.00026319758,0.0018946134],"genre_scores_gemma":[0.01778194,0.00001372635,0.9805179,0.00044070918,0.00028060493,0.00005149188,0.00007609468,0.00003329227,0.00080422836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967947,0.000049630235,0.00045055762,0.0013901095,0.0008256588,0.00048936],"domain_scores_gemma":[0.9972795,0.00020281914,0.00036266333,0.0015027631,0.0005081622,0.00014408257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006360414,0.00042649693,0.0003457097,0.0006166718,0.000276988,0.00076030265,0.0020797756,0.00024648634,0.00012905446],"category_scores_gemma":[0.00020608911,0.00037961922,0.000050213162,0.0005701922,0.0004649434,0.0006349592,0.00043199744,0.00079360325,0.00036449087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072362627,0.000030114164,0.000026866694,0.000068743786,0.0000059021527,0.000009755944,0.00013161449,0.014914878,0.00025452062,0.047833294,0.00012675917,0.9365903],"study_design_scores_gemma":[0.00021360411,0.00018249024,0.00019978,0.00019209404,0.000005884451,0.000030045265,5.858198e-8,0.9412204,0.0007012957,0.04746756,0.0092755575,0.00051123364],"about_ca_topic_score_codex":0.000053965017,"about_ca_topic_score_gemma":0.000013131353,"teacher_disagreement_score":0.9360791,"about_ca_system_score_codex":0.00019538675,"about_ca_system_score_gemma":0.0006950058,"threshold_uncertainty_score":0.9998656},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007682907,0.000307684,0.9919283,0.001177829,0.0008191582,0.00049262925,0.000010788415,0.003522832,0.0017331305],"genre_scores_gemma":[0.04408666,0.000033878303,0.9538403,0.0009776205,0.0005312129,0.000045722267,0.0000058757255,0.000046865312,0.00043184825],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643284,0.000020739657,0.0005443495,0.0016125853,0.0007207372,0.00066873885],"domain_scores_gemma":[0.9944667,0.0028581338,0.00029608537,0.001854602,0.00034146674,0.00018300212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072146195,0.00049786584,0.0004665952,0.0009707789,0.0004775957,0.00082365575,0.0035604788,0.00036133657,0.000012708514],"category_scores_gemma":[0.0008677719,0.0004742085,0.00017770611,0.0006975045,0.0007094735,0.00047952298,0.00085454085,0.000699826,0.00002075638],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003047813,0.00012500286,0.0006611654,0.00007057041,0.000010435947,0.00004762133,0.0006220745,0.0017541989,0.00016546006,0.046702642,0.0037766686,0.94606113],"study_design_scores_gemma":[0.00018306935,0.00018484006,0.00021075754,0.0006008763,0.000008570576,0.00008510889,1.8466553e-8,0.30305076,0.0008452667,0.6859322,0.00815917,0.000739369],"about_ca_topic_score_codex":0.000008985944,"about_ca_topic_score_gemma":0.000005468846,"teacher_disagreement_score":0.94532174,"about_ca_system_score_codex":0.00019178154,"about_ca_system_score_gemma":0.00023898279,"threshold_uncertainty_score":0.99977094},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000325321,0.0010969217,0.9939433,0.0012015058,0.0017335471,0.0010823769,0.000055455665,0.00014928087,0.0007343943],"genre_scores_gemma":[0.003120794,0.00013089698,0.9943737,0.0005847344,0.00082348456,0.0002725357,0.000015608326,0.00003550037,0.0006427459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710006,0.00002110916,0.0004922009,0.0011953375,0.0005967695,0.0005945299],"domain_scores_gemma":[0.99474156,0.0021880295,0.00036772527,0.0019251623,0.00066420174,0.00011333433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008048763,0.0004450319,0.0003916859,0.0002699394,0.0010533828,0.00048602076,0.0030562025,0.00030407583,0.000006216271],"category_scores_gemma":[0.0004545718,0.00031518098,0.00010167174,0.00070876494,0.0016123218,0.00067816756,0.0011893575,0.00091465336,0.000019976555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032435025,0.0000069805005,0.0000016684477,0.00003002405,0.000005129219,0.0000043505866,0.00074402214,0.0009805498,0.000083894156,0.5742414,0.000004276912,0.42389446],"study_design_scores_gemma":[0.00009419825,0.00008455177,0.00002500468,0.00046533396,0.000008631636,0.000055894765,0.000006039532,0.04569618,0.006263664,0.73331857,0.21307658,0.0009053686],"about_ca_topic_score_codex":0.00003337653,"about_ca_topic_score_gemma":0.0004756824,"teacher_disagreement_score":0.4229891,"about_ca_system_score_codex":0.00011871905,"about_ca_system_score_gemma":0.0005207302,"threshold_uncertainty_score":0.99993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008684338,0.00007737831,0.99526393,0.001604307,0.00043981193,0.00043449725,0.000042385236,0.000037017988,0.0012322469],"genre_scores_gemma":[0.8794483,0.000058449805,0.1167543,0.0005447656,0.00019531824,0.00003521861,0.000013576726,0.000018334738,0.0029317376],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996487,0.00020848663,0.00082768797,0.0013272469,0.00084841595,0.0003011232],"domain_scores_gemma":[0.995388,0.0026917858,0.00047634784,0.0008943504,0.0004118531,0.00013771655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004582929,0.0002890505,0.00043082095,0.000893027,0.0003002384,0.00028544338,0.001041677,0.000232297,0.00016210429],"category_scores_gemma":[0.0013496662,0.00024372675,0.0000678054,0.00081077963,0.0021714242,0.00029224265,0.00029985848,0.0006247423,0.00016766357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019281015,0.000078339275,0.00042309295,0.000017052524,0.0000101481855,0.0000077267705,0.014117244,0.016007897,0.00037361277,0.3825517,0.00017314318,0.58622074],"study_design_scores_gemma":[0.00049318234,0.00008771415,0.0027126358,0.00022345262,0.000009844282,0.000050320195,0.00009150689,0.036175903,0.0004590051,0.94759583,0.011468081,0.00063254917],"about_ca_topic_score_codex":0.000020122661,"about_ca_topic_score_gemma":0.00021349486,"teacher_disagreement_score":0.87857985,"about_ca_system_score_codex":0.00016531635,"about_ca_system_score_gemma":0.00021973277,"threshold_uncertainty_score":0.99388885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018178367,0.00012463536,0.9848951,0.0009104295,0.0020102728,0.0006632082,0.0000025309555,0.00026270517,0.011112948],"genre_scores_gemma":[0.1257305,0.000028014256,0.8702475,0.0029543752,0.00044431063,0.000022936754,0.000019509382,0.000051151233,0.0005017096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99522054,0.00003804792,0.00063633913,0.0018079936,0.0014829434,0.0008141252],"domain_scores_gemma":[0.99741024,0.0001394356,0.00027071915,0.0016065412,0.00024902655,0.00032403838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053961115,0.00059218425,0.0004630359,0.0011282647,0.00035318942,0.00046247148,0.0038622431,0.00025992963,0.000018638357],"category_scores_gemma":[0.00006739463,0.00059450784,0.00016122866,0.0009270606,0.00033205788,0.00059258,0.0020190687,0.00087967014,0.00018565955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035813032,0.000030444413,0.000011868687,0.000027080101,0.00000761441,0.000030220384,0.0003973612,0.92113465,0.000110938076,0.04339438,0.000049823208,0.034802053],"study_design_scores_gemma":[0.00022918716,0.00028334497,0.00020999576,0.00024934445,0.000008299182,0.00010170738,8.743978e-8,0.9530215,0.00016687185,0.043356635,0.0016454477,0.0007275522],"about_ca_topic_score_codex":0.000018442657,"about_ca_topic_score_gemma":0.000003948244,"teacher_disagreement_score":0.12571232,"about_ca_system_score_codex":0.0008545126,"about_ca_system_score_gemma":0.000676734,"threshold_uncertainty_score":0.99965066},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028060463,0.020668978,0.8643043,0.030957544,0.024409667,0.0033920428,0.0000494588,0.00011754581,0.053294413],"genre_scores_gemma":[0.4494685,0.0011214571,0.11445273,0.03585657,0.0147361625,0.0024931042,0.0010102707,0.00035944648,0.38050178],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845064,0.000033384273,0.00033519775,0.0005770977,0.00032331762,0.00028034172],"domain_scores_gemma":[0.99832916,0.0004677763,0.00021498061,0.00059866486,0.0003204913,0.000068932226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007544974,0.00023346163,0.0002307213,0.0003618053,0.00009029785,0.00013154876,0.00075144286,0.00021502387,0.000072708375],"category_scores_gemma":[0.000068857305,0.00017759473,0.00006224994,0.00017360116,0.0004571051,0.00014530821,0.00009484074,0.00035682623,0.00001980702],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000770435,0.000077988174,0.00014510151,0.00002477753,0.000007185886,0.0000016986502,0.0031105154,0.00068069145,0.0000030893013,0.042000428,0.0032038307,0.950737],"study_design_scores_gemma":[0.0005147258,0.00021308575,0.016746968,0.00051974255,0.000042651543,0.00006509743,0.00022299429,0.0058920397,0.000012358341,0.17573814,0.7991234,0.0009087872],"about_ca_topic_score_codex":0.0020403506,"about_ca_topic_score_gemma":0.003971073,"teacher_disagreement_score":0.9498282,"about_ca_system_score_codex":0.00042871587,"about_ca_system_score_gemma":0.0018564102,"threshold_uncertainty_score":0.7242103},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029894374,0.00009400012,0.98770803,0.00042036202,0.0030834477,0.00032810186,0.000014833366,0.000034975346,0.005326837],"genre_scores_gemma":[0.9796691,0.000014862305,0.019235794,0.0002112612,0.0003445113,0.000011216733,0.000002181018,0.000014147514,0.0004969163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966615,0.000083377745,0.0009553776,0.0009238112,0.0010954132,0.00028053657],"domain_scores_gemma":[0.99494225,0.003113297,0.00057374773,0.0009386369,0.00034033722,0.00009172771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027350981,0.00024935298,0.00054002437,0.0010075789,0.00021772098,0.00014445926,0.0013534476,0.00022573807,0.000096490556],"category_scores_gemma":[0.0016496957,0.00021464992,0.00011370257,0.0009934043,0.0014592967,0.0002672254,0.0003452058,0.00051725836,0.00005760606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049354017,0.00009017387,0.002887009,0.000027139313,0.000010988799,0.000014046132,0.0019682713,0.13971917,0.0007850145,0.46279827,0.0002632307,0.3913873],"study_design_scores_gemma":[0.00039456773,0.000053990134,0.00025265102,0.00019160559,0.0000042521583,0.000015304873,0.000004979909,0.026368562,0.0011124833,0.9551114,0.016205974,0.0002842363],"about_ca_topic_score_codex":0.00003628082,"about_ca_topic_score_gemma":0.00035785334,"teacher_disagreement_score":0.9766797,"about_ca_system_score_codex":0.0001233441,"about_ca_system_score_gemma":0.00025943044,"threshold_uncertainty_score":0.875317},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08081985,0.0017767599,0.91395277,0.00021015127,0.00043803136,0.00067756564,0.00011787292,0.00002110965,0.0019859145],"genre_scores_gemma":[0.9808774,0.00008685247,0.016632909,0.0004443818,0.0009042676,0.00002298308,0.00019407955,0.000035119134,0.0008019822],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977169,0.000037404818,0.00027421777,0.0008643686,0.0006137221,0.00049337134],"domain_scores_gemma":[0.99891084,0.00003435529,0.00013448225,0.000653037,0.00012026954,0.00014700895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035082086,0.00032366064,0.00024767057,0.00018729315,0.00013522795,0.00017247109,0.0008351866,0.0003390384,0.0000845451],"category_scores_gemma":[0.00006428426,0.00028226015,0.00009324056,0.00009273134,0.0003762924,0.000019451156,0.0005681949,0.00038023616,0.000039040322],"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.000049850954,0.00003791947,0.0012521077,0.000048168007,0.000039713585,0.00003906226,0.0002258998,0.002020499,0.5927242,0.0003908596,0.00003190221,0.4031398],"study_design_scores_gemma":[0.0011713102,0.0007803638,0.0036133844,0.0012568336,0.000026884067,0.00003519838,0.0000027111466,0.009944976,0.91723216,0.033673014,0.02995733,0.002305836],"about_ca_topic_score_codex":0.00022660485,"about_ca_topic_score_gemma":0.00019302449,"teacher_disagreement_score":0.90005755,"about_ca_system_score_codex":0.00006837241,"about_ca_system_score_gemma":0.0003147636,"threshold_uncertainty_score":0.999963},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036889847,0.0004698636,0.99273926,0.0024760566,0.00095763407,0.0004529045,0.0000046914997,0.00007674381,0.0024539728],"genre_scores_gemma":[0.7259888,0.0002915761,0.27109295,0.0013570844,0.0006024111,0.000015275511,0.0000068778236,0.000048880735,0.0005961142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701095,0.00006630965,0.0006317366,0.000960953,0.00083638506,0.000493656],"domain_scores_gemma":[0.9966506,0.0011536113,0.0004801284,0.001260202,0.00035040814,0.00010505162],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014511339,0.00037314437,0.0005331132,0.0006634096,0.0002386511,0.00031127039,0.0024535733,0.00023566792,0.000009187518],"category_scores_gemma":[0.0002107734,0.00027652073,0.00011069004,0.00074522634,0.0030726155,0.00047854666,0.0011336061,0.00053879165,0.000014009756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029875402,0.00002350509,0.000099053825,0.000038753566,0.000013436857,0.00002057335,0.003331987,0.009651495,0.0005051035,0.42419958,0.0000071686813,0.5620795],"study_design_scores_gemma":[0.00023398579,0.00010431136,0.00069082074,0.00038787213,0.000013948555,0.000066913744,0.0000011638342,0.74113524,0.0048530926,0.25020975,0.0018312939,0.0004716481],"about_ca_topic_score_codex":0.00007808962,"about_ca_topic_score_gemma":0.0002596496,"teacher_disagreement_score":0.7314837,"about_ca_system_score_codex":0.00011919925,"about_ca_system_score_gemma":0.00026519585,"threshold_uncertainty_score":0.9999687},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013072867,0.00011443721,0.99680954,0.00015510041,0.0002980237,0.0003822763,0.000016330918,0.00008797847,0.0020056101],"genre_scores_gemma":[0.4227777,0.000047906215,0.5762698,0.0003684747,0.000079983925,0.0000066082944,0.0000034920515,0.000050830666,0.0003951727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979975,0.000022188138,0.0005258484,0.0005406726,0.00058740884,0.0003263738],"domain_scores_gemma":[0.99640226,0.0018611451,0.00045474072,0.0008810745,0.00034772308,0.000053071664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045655385,0.00036495875,0.00042007875,0.00023268357,0.00016036129,0.00009627562,0.001138591,0.00028513046,0.000014004213],"category_scores_gemma":[0.00070943247,0.00024303247,0.00008092596,0.00020969077,0.0009570304,0.00020943154,0.00025727993,0.0006704907,0.0000013549685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001808536,0.000038136994,0.00002838908,0.00018268041,0.000019414076,0.000010772623,0.0015337412,0.06554011,0.0024589866,0.5344979,0.00012473589,0.395547],"study_design_scores_gemma":[0.000043878998,0.000055472265,0.0000013328103,0.00021739729,0.000008858514,0.000010186727,2.4278464e-7,0.26742068,0.006969268,0.72501785,0.000059413152,0.00019544155],"about_ca_topic_score_codex":0.0000017716799,"about_ca_topic_score_gemma":0.000087551605,"teacher_disagreement_score":0.422647,"about_ca_system_score_codex":0.0001927548,"about_ca_system_score_gemma":0.00021918488,"threshold_uncertainty_score":0.99105763},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023308417,0.001479911,0.97239184,0.0002701235,0.001014095,0.000298635,0.0000053700824,0.000076760196,0.0011548178],"genre_scores_gemma":[0.7644119,0.00003346129,0.23529683,0.0001362584,0.000033414828,0.0000024653343,0.0000023078846,0.000014605261,0.00006874054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746805,0.000026845837,0.0005804855,0.0008340362,0.0007854153,0.00030517683],"domain_scores_gemma":[0.99783313,0.00021767411,0.00054163253,0.0006654884,0.00060720346,0.00013487446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001344304,0.00028638358,0.0004979306,0.00067244633,0.000118056305,0.00014453573,0.0011726512,0.00020236964,0.000002232126],"category_scores_gemma":[0.00021143247,0.00026232222,0.00006997818,0.0004709421,0.0008081585,0.00029371795,0.0008878787,0.00033467045,0.0000010044236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017022303,0.000100403864,0.0012260918,0.00036017312,0.000041702137,0.00005157839,0.004530514,0.038872972,0.013753606,0.6608103,0.00018555486,0.2800501],"study_design_scores_gemma":[0.00041695745,0.00038104475,0.00014534537,0.0006571233,0.000015719663,0.00004524888,3.083059e-7,0.31512323,0.012401519,0.67012924,0.00021233177,0.0004719357],"about_ca_topic_score_codex":0.000081991726,"about_ca_topic_score_gemma":0.00004130294,"teacher_disagreement_score":0.74110353,"about_ca_system_score_codex":0.00005551396,"about_ca_system_score_gemma":0.00025842927,"threshold_uncertainty_score":0.9999829},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006212986,0.00038635207,0.9936419,0.0006727952,0.0006149155,0.00032493082,0.000018753351,0.00006370473,0.004214512],"genre_scores_gemma":[0.052327175,0.00005816834,0.9453865,0.0019299055,0.00011787872,0.000008749071,0.000070237824,0.000020733947,0.000080653146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954666,0.0001633489,0.0006661867,0.0021922037,0.00094179943,0.0005698435],"domain_scores_gemma":[0.99602926,0.0004572588,0.0002802868,0.002957933,0.0001493835,0.00012590887],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0027944634,0.00045771207,0.0006999377,0.0017819105,0.00016049022,0.00064613397,0.005563523,0.00027692868,0.000019698888],"category_scores_gemma":[0.00014654321,0.00039095397,0.00010762869,0.0029157712,0.00043323278,0.0011834536,0.0017765255,0.00066830846,0.000026454505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070371625,0.000120722965,0.0002827528,0.000055082368,0.00013291846,0.0001616494,0.015134755,0.13998376,0.000013690529,0.087965794,0.000111126705,0.75603074],"study_design_scores_gemma":[0.00017688888,0.00006039309,0.00011439967,0.0000711448,0.000024793224,0.000007995267,0.0000018717184,0.8870218,0.000032814645,0.111363746,0.00059562695,0.00052855705],"about_ca_topic_score_codex":0.00007475476,"about_ca_topic_score_gemma":0.00036758767,"teacher_disagreement_score":0.75550216,"about_ca_system_score_codex":0.00027027025,"about_ca_system_score_gemma":0.0003386471,"threshold_uncertainty_score":0.9998542},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021844618,0.000046933397,0.97525954,0.0017653942,0.000437772,0.0004470494,0.0000017183881,0.000038733593,0.00015823558],"genre_scores_gemma":[0.9082148,0.0000017785916,0.08979642,0.001897752,0.000059371596,0.000024952129,2.4991087e-7,0.0000043232003,3.718883e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977666,0.00030474862,0.00039426028,0.00056538737,0.00055748236,0.0004115371],"domain_scores_gemma":[0.9976937,0.00069516216,0.00015719698,0.001304925,0.00010563707,0.00004338793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019398179,0.00016274092,0.0002152488,0.00016796387,0.0002542195,0.00016023006,0.0043051797,0.000058368867,0.0000032883931],"category_scores_gemma":[0.00009656253,0.00009323164,0.00007035736,0.0026273641,0.00040295313,0.0003732687,0.0006627069,0.0003131668,0.0000039669435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008708719,0.0006334017,0.058628052,0.00003352318,0.000018763285,0.000022972155,0.033515602,0.35905153,0.0035229237,0.020009592,0.000059564438,0.52449536],"study_design_scores_gemma":[0.00025521143,0.000049902053,0.06796738,0.00005178402,0.0000024744575,0.00001985785,0.0000022076063,0.91872436,0.009144036,0.003614583,0.000033684868,0.00013449392],"about_ca_topic_score_codex":0.00038670743,"about_ca_topic_score_gemma":0.000311562,"teacher_disagreement_score":0.8863702,"about_ca_system_score_codex":0.00006622678,"about_ca_system_score_gemma":0.0001774633,"threshold_uncertainty_score":0.80001664},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017801399,0.0007222403,0.9793215,0.003290903,0.00093159097,0.00027159767,0.0000018572226,0.0002657084,0.015016618],"genre_scores_gemma":[0.23908062,0.00007674991,0.7558868,0.0021705541,0.0004895655,0.000012352125,0.0000029193889,0.000032860375,0.002247591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964564,0.000034043653,0.00043085997,0.0015325132,0.0008094539,0.0007367662],"domain_scores_gemma":[0.997086,0.0006563035,0.00026300925,0.0016372665,0.00021488909,0.00014253783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053729734,0.0004908474,0.00051725935,0.000729857,0.00028345507,0.00029337843,0.0036181342,0.0003270843,0.000073535804],"category_scores_gemma":[0.00009254973,0.00038624034,0.0000913081,0.0006056443,0.001335487,0.00072380726,0.0011083612,0.00079007604,0.0001671503],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000938775,0.00003622122,0.00062983396,0.000025105874,0.000022270151,0.00023967825,0.0010556087,0.032209735,0.000051440617,0.19948848,0.00008231964,0.76614994],"study_design_scores_gemma":[0.0009866267,0.0009411787,0.0033059453,0.0009865805,0.000049454608,0.0010393491,0.0000010838414,0.50026065,0.0012295616,0.47715765,0.011597332,0.0024445932],"about_ca_topic_score_codex":0.00002523824,"about_ca_topic_score_gemma":0.0003244044,"teacher_disagreement_score":0.7637053,"about_ca_system_score_codex":0.00022255672,"about_ca_system_score_gemma":0.00071011233,"threshold_uncertainty_score":0.999859},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046808895,0.0072318125,0.98304516,0.00014685033,0.0010965012,0.00025909275,0.000012348774,0.00033797882,0.0074021393],"genre_scores_gemma":[0.44313714,0.000071847055,0.55571014,0.00026840702,0.00029276207,0.000011748573,0.00000783672,0.00003109627,0.0004690348],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965633,0.000047252553,0.000565714,0.001410592,0.000924643,0.0004884932],"domain_scores_gemma":[0.99719006,0.00084339257,0.0004807383,0.0011566239,0.0002055979,0.0001236113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043080177,0.0005424689,0.00060255884,0.0007866908,0.0002330918,0.00029052905,0.0034589327,0.0003374648,0.00006707348],"category_scores_gemma":[0.00009646737,0.00044934437,0.00012555503,0.0004867015,0.0004436527,0.0006474454,0.0012189168,0.00092633447,0.00002068834],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019207835,0.00015343254,0.0002655244,0.000045399815,0.00002352036,0.00015002296,0.0014958687,0.00032256698,0.0021862874,0.012324111,0.00002775149,0.98298633],"study_design_scores_gemma":[0.00050828524,0.00069766183,0.00025549266,0.003975695,0.000024642128,0.00013164106,0.0000012335954,0.34192154,0.08807083,0.5614737,0.0012038868,0.0017353467],"about_ca_topic_score_codex":0.0002020307,"about_ca_topic_score_gemma":0.000047782145,"teacher_disagreement_score":0.98125094,"about_ca_system_score_codex":0.00026974324,"about_ca_system_score_gemma":0.00032158618,"threshold_uncertainty_score":0.99979585},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001774345,0.0003554578,0.98800224,0.0007483198,0.0022498372,0.0005163515,0.000021277501,0.00025211132,0.007676952],"genre_scores_gemma":[0.38101757,0.000043443513,0.61279446,0.0016236749,0.0010776318,0.00003263979,0.000037621376,0.0001098874,0.0032631028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99453753,0.00003391825,0.000619463,0.0021433218,0.0016212033,0.0010445412],"domain_scores_gemma":[0.99632764,0.00019464173,0.0004505303,0.0022268014,0.00045566814,0.0003447205],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008262535,0.00078590977,0.00079791714,0.0005415616,0.00058491615,0.0011862484,0.004028065,0.00058386254,0.000047483478],"category_scores_gemma":[0.000034438155,0.00063274725,0.00012871655,0.00096997345,0.001409708,0.00090261584,0.0013170483,0.0015636301,0.000117949596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051884632,0.0001528401,0.000118479606,0.00017968933,0.000042421863,0.0007449643,0.0020046085,0.04255864,0.0016357542,0.1260888,0.0003028179,0.8261191],"study_design_scores_gemma":[0.001502574,0.0008601372,0.0002990306,0.0020326418,0.00002393899,0.00071453024,0.0000018577225,0.8226475,0.005569163,0.066442356,0.096986406,0.002919829],"about_ca_topic_score_codex":0.00014423965,"about_ca_topic_score_gemma":0.00093436934,"teacher_disagreement_score":0.8231993,"about_ca_system_score_codex":0.00033641417,"about_ca_system_score_gemma":0.0010739076,"threshold_uncertainty_score":0.99985063},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010745686,0.0025017473,0.9882081,0.0026298042,0.002852711,0.00071266893,0.000003062132,0.0002006208,0.0027838286],"genre_scores_gemma":[0.4494046,0.0013896675,0.53458744,0.0065910546,0.0036926093,0.00011144173,0.000044809494,0.00017900085,0.0039993552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99419576,0.000076708224,0.0008340957,0.0021163186,0.0017105351,0.0010666051],"domain_scores_gemma":[0.9963718,0.00049325946,0.00039997295,0.0019051442,0.0005976663,0.00023212818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016411657,0.00070631603,0.0007251584,0.00091769756,0.00020623577,0.0009873129,0.0042344825,0.0007127901,0.00003692303],"category_scores_gemma":[0.00007064889,0.00070917665,0.00011590543,0.0018983397,0.0005464881,0.0011973035,0.001470251,0.0015609498,0.00005696411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061562696,0.000023959989,0.000038844013,0.000008322795,0.000004144338,0.000084131,0.00045726832,0.31623897,0.000008983639,0.012055957,0.00015715271,0.6709161],"study_design_scores_gemma":[0.00037678017,0.00012664705,0.0001351251,0.0003532422,0.0000044820217,0.000038025726,2.260076e-7,0.95924747,0.000068500594,0.02291351,0.01595303,0.00078294444],"about_ca_topic_score_codex":0.0000092757855,"about_ca_topic_score_gemma":0.001417533,"teacher_disagreement_score":0.6701332,"about_ca_system_score_codex":0.00083635654,"about_ca_system_score_gemma":0.0008032466,"threshold_uncertainty_score":0.9995359},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004403067,0.00014022744,0.96280134,0.01870763,0.0021297357,0.0015901735,0.000014018521,0.00020620062,0.013970349],"genre_scores_gemma":[0.9570194,0.00004677426,0.034580693,0.0039221984,0.0017788484,0.00005088241,0.000004267935,0.000047894362,0.0025490352],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960001,0.00010525651,0.00033491998,0.0012428035,0.0014110202,0.00090588507],"domain_scores_gemma":[0.9982988,0.00018078004,0.0002571585,0.0005033911,0.00041608608,0.00034375952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013024879,0.0005154442,0.00051432505,0.00048842916,0.00078903243,0.000781873,0.0017906248,0.00056260015,0.000120658566],"category_scores_gemma":[0.00033331808,0.00045090023,0.00014840343,0.00043659713,0.0005502238,0.0010004512,0.00048463643,0.00087568973,0.00008387124],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006522964,0.00006089634,0.00007735363,0.0000347097,0.00006587273,0.00006668034,0.035967566,0.0051005436,0.0002723188,0.074231975,0.00009143865,0.88396543],"study_design_scores_gemma":[0.0012399799,0.0005002893,0.00039311184,0.00066963484,0.00008763315,0.000036271806,0.00014541787,0.018548861,0.0009873501,0.7416423,0.23254699,0.003202163],"about_ca_topic_score_codex":0.0017362152,"about_ca_topic_score_gemma":0.012241506,"teacher_disagreement_score":0.9565791,"about_ca_system_score_codex":0.0007724488,"about_ca_system_score_gemma":0.000855095,"threshold_uncertainty_score":0.9997943},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028403778,0.00039083694,0.9671589,0.00009729918,0.0020807846,0.00070340093,6.708424e-7,0.000043657674,0.001120666],"genre_scores_gemma":[0.9884826,0.000011825206,0.011014851,0.000031428473,0.00022717917,0.000012190913,5.1660544e-7,0.000013671438,0.0002057458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622685,0.0002411043,0.0006061065,0.0009551434,0.0016671192,0.0003036514],"domain_scores_gemma":[0.99810195,0.00024640444,0.00033678996,0.00090700673,0.0003371183,0.000070750495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026184516,0.00026014054,0.0003503276,0.00049357227,0.00015062712,0.00028128194,0.0015381335,0.00014774683,0.0000035466694],"category_scores_gemma":[0.0000880148,0.00019897147,0.00006975696,0.0004364952,0.00022798618,0.00039659382,0.0008095426,0.0005861959,0.0000031459633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034850764,0.00004293083,0.0050776843,0.00008602605,0.000010869209,0.00001955168,0.008971909,0.29927444,0.00023132365,0.18325108,4.968461e-7,0.5030302],"study_design_scores_gemma":[0.00018640867,0.000115569805,0.009333542,0.0014592626,0.000011285273,0.000041814546,0.0000063629714,0.97969097,0.0013478512,0.0073957406,0.00012676076,0.0002844284],"about_ca_topic_score_codex":0.00006390583,"about_ca_topic_score_gemma":0.000055619865,"teacher_disagreement_score":0.96007884,"about_ca_system_score_codex":0.0005857556,"about_ca_system_score_gemma":0.00017385696,"threshold_uncertainty_score":0.8113821},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000081263504,0.00018355127,0.99819165,0.00051280303,0.00036983326,0.0003055176,0.00000871827,0.000088486384,0.0002581885],"genre_scores_gemma":[0.13324249,0.000026553666,0.8661403,0.0003188263,0.00018337203,0.0000028393174,0.000016175161,0.000028116707,0.000041357307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957656,0.000043765318,0.00056305673,0.0017626712,0.0012366539,0.0006282444],"domain_scores_gemma":[0.99561757,0.0010060628,0.00023703648,0.0026284482,0.0002732165,0.00023764434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016141763,0.00036757943,0.0004881524,0.00096369296,0.00017647137,0.00024232583,0.004508063,0.00028105694,0.0000032817716],"category_scores_gemma":[0.00024887815,0.00035215684,0.00004692233,0.0006679747,0.0011091814,0.00050046196,0.005065698,0.00097009505,0.000005550558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014859384,0.000028465307,0.000052537293,0.0001040887,0.0000067552137,0.000104724786,0.00020837545,0.031105468,0.0003313581,0.004207722,0.0000023849916,0.9638333],"study_design_scores_gemma":[0.00022884122,0.000122113,0.0002145267,0.00013322504,0.0000039730157,0.00008918608,9.898193e-8,0.96800274,0.00080469955,0.029782988,0.00028590218,0.00033173105],"about_ca_topic_score_codex":0.00002834072,"about_ca_topic_score_gemma":0.00007622712,"teacher_disagreement_score":0.9635015,"about_ca_system_score_codex":0.000226753,"about_ca_system_score_gemma":0.00054589583,"threshold_uncertainty_score":0.99989307},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024227474,0.0011889668,0.9646214,0.00036203238,0.0034447499,0.0011045244,0.00021793574,0.00034541302,0.0262922],"genre_scores_gemma":[0.544355,0.00054731686,0.35598364,0.008012996,0.020693827,0.0002489163,0.00034188112,0.0004677236,0.06934871],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845606,0.0000063152224,0.00029128557,0.0005437623,0.0003247754,0.00037779333],"domain_scores_gemma":[0.99875176,0.0005264559,0.00014646057,0.0002952178,0.00021543255,0.00006465135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015599857,0.00029024796,0.0003260909,0.0002738604,0.00061813835,0.00029916418,0.0004331712,0.00012433721,0.00060038676],"category_scores_gemma":[0.00016638574,0.00024241746,0.0001267445,0.000050521252,0.0007002913,0.00018173213,0.00013585521,0.0002917203,0.00006631029],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025314579,0.000070091664,0.000052436782,0.00018708255,0.000042848507,0.000064490094,0.039406113,0.0020245658,0.000113337555,0.04158406,0.0019778702,0.9144518],"study_design_scores_gemma":[0.0016142891,0.0012019688,0.00014209317,0.0029174138,0.000120025135,0.00016341054,0.000030582647,0.073349506,0.0009426825,0.083028,0.83317345,0.003316571],"about_ca_topic_score_codex":0.000053367414,"about_ca_topic_score_gemma":0.0003974689,"teacher_disagreement_score":0.9111352,"about_ca_system_score_codex":0.00011099485,"about_ca_system_score_gemma":0.00019759123,"threshold_uncertainty_score":0.9885497},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014883891,0.00010527071,0.97285616,0.0011506014,0.00066358794,0.0002536314,0.000009181258,0.00017451667,0.024772191],"genre_scores_gemma":[0.58735484,0.0000069202856,0.40822896,0.003730106,0.00039280337,0.000009651842,0.000045323803,0.000020300608,0.0002110692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574274,0.000056852274,0.00052723003,0.0018685487,0.0012213469,0.000583283],"domain_scores_gemma":[0.9970308,0.0005233774,0.00031934908,0.0017937835,0.00017946874,0.000153237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006222526,0.00050732197,0.00062236853,0.0013235242,0.00025327184,0.00061509316,0.0030544123,0.0004000713,0.000047036945],"category_scores_gemma":[0.000042296433,0.0004017352,0.0003038384,0.0016912129,0.0006935751,0.00025593286,0.00041758656,0.00069143943,0.00005808646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005248307,0.00007011731,0.0001895206,0.000006937869,0.000021301583,0.00007477239,0.00007435552,0.57910067,0.000009761801,0.030724308,0.00015497954,0.38956803],"study_design_scores_gemma":[0.00017246403,0.00019311643,0.0024905596,0.000047399026,0.000031376385,0.000004104277,3.2268588e-8,0.96031475,0.00004528654,0.03498852,0.0012319583,0.00048044667],"about_ca_topic_score_codex":0.000024775627,"about_ca_topic_score_gemma":0.00003094955,"teacher_disagreement_score":0.58734,"about_ca_system_score_codex":0.0003042021,"about_ca_system_score_gemma":0.00029507777,"threshold_uncertainty_score":0.9998435},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020662831,0.0009379617,0.97567624,0.000017034869,0.0020775883,0.0003093262,0.0000021290496,0.00013928137,0.00017761078],"genre_scores_gemma":[0.997003,0.000039944756,0.0026005253,0.000060897022,0.00023082098,0.000005341232,0.0000029686867,0.000038826638,0.00001768521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833983,0.00002627863,0.00050877844,0.00044926172,0.00034114043,0.0003347294],"domain_scores_gemma":[0.99927145,0.00010364605,0.00014937816,0.00035048387,0.00006747278,0.00005758692],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003099913,0.00031478296,0.0003939357,0.00066328375,0.000053399897,0.000067009634,0.00029016274,0.000352943,0.0000040866944],"category_scores_gemma":[0.000016043772,0.00032830308,0.000105344545,0.00043418846,0.000117512565,0.00020183441,0.00003555797,0.00065592036,0.0000021314954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009000022,0.000003626336,0.000019288738,0.000029821038,0.0000032038606,0.000004316597,0.00003183167,0.63631964,0.006050285,0.000002711274,4.236486e-8,0.35752627],"study_design_scores_gemma":[0.00031604184,0.000050818762,0.00046115086,0.00030207055,0.000007825738,0.000023021066,2.6600756e-7,0.99705213,0.001146042,0.00017113527,0.00018336663,0.00028610282],"about_ca_topic_score_codex":0.000117481344,"about_ca_topic_score_gemma":0.002555348,"teacher_disagreement_score":0.9763402,"about_ca_system_score_codex":0.0006508474,"about_ca_system_score_gemma":0.00004621322,"threshold_uncertainty_score":0.9999169},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000123423615,0.00020951877,0.9960763,0.0016408912,0.0007052732,0.00050606125,0.0000073275114,0.00029078027,0.00055149035],"genre_scores_gemma":[0.00028559854,0.00013069627,0.9945924,0.0041034915,0.0003172474,0.000022574419,0.000014497365,0.000026994612,0.0005064839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955276,0.00013121641,0.0007243636,0.0015102356,0.0015929677,0.0005136012],"domain_scores_gemma":[0.9970866,0.001077308,0.00037112832,0.00085949927,0.00025117004,0.00035429432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028069678,0.00045957614,0.000523618,0.00076733454,0.00019413223,0.0004553424,0.0021429562,0.00045558612,0.00027194442],"category_scores_gemma":[0.00068070693,0.00042545272,0.0000739989,0.00042007095,0.0013019902,0.0010767813,0.0014234197,0.0008727128,0.000030193043],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030572412,0.000044238503,0.000011113811,0.000041253348,0.0000098142145,0.00006700873,0.00074853795,0.00025317192,0.005352761,0.0025787472,0.00002383312,0.9908665],"study_design_scores_gemma":[0.0016356918,0.000293344,0.00013440578,0.00049522094,0.000023874733,0.0004930323,0.0000013335435,0.8885167,0.093101144,0.012996436,0.0010387264,0.0012700361],"about_ca_topic_score_codex":0.000033837372,"about_ca_topic_score_gemma":0.000055260432,"teacher_disagreement_score":0.9895964,"about_ca_system_score_codex":0.00025249683,"about_ca_system_score_gemma":0.0005594021,"threshold_uncertainty_score":0.99981976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043977216,0.000085134765,0.9931407,0.0018522395,0.00084327924,0.0002459179,0.00004708641,0.00022698008,0.0035146808],"genre_scores_gemma":[0.016541325,0.000016924758,0.976223,0.0035255083,0.0007938036,0.00003146108,0.00006159783,0.000045371922,0.0027610227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620706,0.00003567248,0.00046811486,0.0015747313,0.0011046776,0.00060974015],"domain_scores_gemma":[0.9966024,0.00047194946,0.00036738155,0.0020187388,0.00030969706,0.00022979637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010390498,0.00042237103,0.00040567157,0.00045608275,0.00031436072,0.0008293489,0.0035477711,0.00032855547,0.00006362748],"category_scores_gemma":[0.000121787125,0.00040341532,0.00010106451,0.00065341755,0.00026688402,0.00071345904,0.0005827069,0.00063996605,0.0001274462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010904096,0.00012100727,0.00030635652,0.000019933885,0.000013175763,0.000035788966,0.00040212867,0.011842114,0.00004852576,0.018331828,0.00049884676,0.9683792],"study_design_scores_gemma":[0.00018898201,0.000093611365,0.00040186645,0.00008567616,0.00000874244,0.000008558856,5.443886e-8,0.9603374,0.0002494542,0.02446074,0.013580775,0.00058416114],"about_ca_topic_score_codex":0.00006876425,"about_ca_topic_score_gemma":0.00007548465,"teacher_disagreement_score":0.967795,"about_ca_system_score_codex":0.00053675455,"about_ca_system_score_gemma":0.0004034381,"threshold_uncertainty_score":0.99984175},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004860426,0.0004904151,0.99200094,0.00016266428,0.0018153002,0.0002216315,0.0000016894893,0.000044597746,0.00040233307],"genre_scores_gemma":[0.8554774,0.000006503515,0.14343716,0.000559853,0.000405323,0.0000014745909,9.219474e-7,0.00002312749,0.00008822921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614847,0.00005559592,0.00079741527,0.0010077542,0.0012579613,0.0007327794],"domain_scores_gemma":[0.9978141,0.00024141293,0.00077871495,0.000839836,0.00022139208,0.000104501276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012918597,0.00048137005,0.00058044173,0.00036492333,0.00030187002,0.00031629248,0.0037073672,0.00021855888,0.00003887151],"category_scores_gemma":[0.00004495559,0.00035567864,0.00030376395,0.00047249522,0.0003726974,0.0004979043,0.0023296748,0.00083831436,0.00001329918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038290973,0.000100549376,0.0005763776,0.00018756503,0.00011010838,0.000024658792,0.006995078,0.17845541,0.003882773,0.1262966,0.00001026781,0.68335676],"study_design_scores_gemma":[0.00010302399,0.000030084359,0.000045918616,0.0008390056,0.000019487059,0.000025651292,6.3381515e-7,0.9942673,0.0031280282,0.0010133163,0.00011777647,0.00040976185],"about_ca_topic_score_codex":0.000057250883,"about_ca_topic_score_gemma":0.00010358581,"teacher_disagreement_score":0.850617,"about_ca_system_score_codex":0.00031081436,"about_ca_system_score_gemma":0.00027590792,"threshold_uncertainty_score":0.9998895},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29238337,0.0017905199,0.55545735,0.038801953,0.0068773064,0.0031542939,0.000050358478,0.0003293131,0.10115553],"genre_scores_gemma":[0.95832205,0.00031834966,0.03705563,0.00014668128,0.0015755029,0.0000025755362,0.0000026898042,0.000028610406,0.002547935],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980871,0.00013047986,0.00027277722,0.0003192155,0.00086533243,0.00032510763],"domain_scores_gemma":[0.9966062,0.0023851537,0.00040587634,0.00031592557,0.00023163813,0.000055251654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001179143,0.00018337162,0.00022823588,0.00019216952,0.0005893531,0.00013932657,0.0008130618,0.00016405658,0.00014158407],"category_scores_gemma":[0.0008194428,0.0001000381,0.00016298807,0.00036159274,0.0019722385,0.00017256179,0.00016102772,0.00090356864,0.0000051115308],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000150607375,0.000012959203,0.0008297611,0.0000034681973,0.00001854591,0.0000019274537,0.001419722,0.27373257,0.00003478572,0.043197464,0.000040722232,0.680693],"study_design_scores_gemma":[0.00077293604,0.001764337,0.0063967956,0.0018279537,0.000067668865,0.00004212601,0.00008752021,0.22669438,0.0010278802,0.12125436,0.6383923,0.0016716962],"about_ca_topic_score_codex":0.00039335605,"about_ca_topic_score_gemma":0.00056453445,"teacher_disagreement_score":0.6790213,"about_ca_system_score_codex":0.0001957185,"about_ca_system_score_gemma":0.0012257285,"threshold_uncertainty_score":0.7266795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000070555175,0.0006251794,0.9935446,0.00026000777,0.0020385103,0.0004774479,0.0000041139406,0.00021131514,0.0028317706],"genre_scores_gemma":[0.333395,0.00013863143,0.66294175,0.0009902985,0.0011168706,0.000067994835,0.0000118690095,0.00010599558,0.0012315919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959593,0.00002245095,0.00070690026,0.0017123428,0.000496024,0.0011030036],"domain_scores_gemma":[0.9976337,0.00053270947,0.00018959056,0.001183008,0.00020783025,0.00025318796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009933311,0.00065433624,0.00067675585,0.0010128119,0.00015281605,0.00050313456,0.0032243722,0.0005284798,0.000022612301],"category_scores_gemma":[0.00008249247,0.0006634271,0.00017358249,0.00076846074,0.00023218282,0.0005260037,0.0008000463,0.0010548217,0.000029824101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004067925,0.000047358364,0.000029543955,0.000074565665,0.000008531672,0.000066714034,0.0006415144,0.37429658,0.000024883062,0.038593616,0.00009156153,0.5861211],"study_design_scores_gemma":[0.0002736672,0.00015487701,0.000037455702,0.00046782006,0.0000050416756,0.000042548065,4.8032227e-8,0.96043074,0.000093258815,0.03609962,0.0016804138,0.0007145047],"about_ca_topic_score_codex":0.000010409411,"about_ca_topic_score_gemma":0.00006130666,"teacher_disagreement_score":0.5861342,"about_ca_system_score_codex":0.0003367973,"about_ca_system_score_gemma":0.0003915427,"threshold_uncertainty_score":0.9995817},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010675727,0.0001428156,0.9932329,0.0015577839,0.00032518336,0.0017343272,0.000078367986,0.000096726566,0.0028212266],"genre_scores_gemma":[0.02408916,0.00014802974,0.97135866,0.0020702642,0.0008097182,0.00044388542,0.0007071811,0.000045733454,0.00032735913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963959,0.000024818253,0.00053320185,0.0020368043,0.00049624755,0.00051304686],"domain_scores_gemma":[0.9954918,0.00031124108,0.00027557975,0.0036656286,0.00015070937,0.00010501819],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009879837,0.00038086204,0.00036561894,0.0007496761,0.00033444993,0.00053480535,0.0058576996,0.00019102689,0.000009329556],"category_scores_gemma":[0.000033183005,0.0003862825,0.00005950209,0.00082452217,0.0002307351,0.0012848768,0.0027362548,0.00042500737,0.000032970493],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002760577,0.000052733816,0.00001051521,0.000021407064,0.000007648196,0.0000045852503,0.00015789847,0.006845039,0.00024105622,0.06544965,0.00021735526,0.9269894],"study_design_scores_gemma":[0.0002684432,0.000034770663,0.000045975765,0.0000557277,0.000010252101,0.000009670028,3.3994075e-7,0.8875269,0.00021773113,0.046011236,0.06538766,0.00043124708],"about_ca_topic_score_codex":0.000085838044,"about_ca_topic_score_gemma":0.00060991436,"teacher_disagreement_score":0.9265581,"about_ca_system_score_codex":0.00035267277,"about_ca_system_score_gemma":0.00024363505,"threshold_uncertainty_score":0.9998589},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004624277,0.00025692946,0.99120486,0.001047766,0.0008333447,0.0004008112,0.000010001735,0.00013793733,0.005645898],"genre_scores_gemma":[0.25548515,0.00012643036,0.73806214,0.0043180045,0.001320324,0.00006686317,0.000033751236,0.000052164185,0.0005351707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965786,0.00010081882,0.0005111235,0.0014514008,0.0007770066,0.0005810822],"domain_scores_gemma":[0.99584943,0.0024594078,0.00038825822,0.0010474332,0.00015028218,0.00010520987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009514897,0.00042821106,0.0004903405,0.00042245977,0.00030441585,0.00035885116,0.0022148078,0.0001744536,0.000023149956],"category_scores_gemma":[0.00028640663,0.00040069188,0.0001049862,0.00080431416,0.0003859577,0.00086976314,0.0013008429,0.00082991156,0.000033527525],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011045213,0.00007206294,0.0002318346,0.000024820672,0.000015846497,0.0000604249,0.0013199506,0.018682845,0.00030826335,0.0986606,0.00021305057,0.8803992],"study_design_scores_gemma":[0.00062754547,0.000100543395,0.0009279301,0.0008927996,0.00001082473,0.00015496381,8.791365e-7,0.74366,0.0016323593,0.2412578,0.009401669,0.0013326983],"about_ca_topic_score_codex":0.0003568886,"about_ca_topic_score_gemma":0.00038069874,"teacher_disagreement_score":0.8790666,"about_ca_system_score_codex":0.00036251947,"about_ca_system_score_gemma":0.00037872104,"threshold_uncertainty_score":0.9998445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006359151,0.0001465744,0.9907213,0.00066868035,0.0026039844,0.0011587624,0.000027947917,0.00013101792,0.0045353654],"genre_scores_gemma":[0.010309841,0.000029430721,0.9862833,0.0017921748,0.00073321804,0.000055765086,0.000017117287,0.000052649993,0.0007265108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960658,0.000051663694,0.0005994379,0.0018093468,0.0006738531,0.0007999025],"domain_scores_gemma":[0.99712455,0.0005530943,0.00042388227,0.0013246455,0.00033020912,0.0002435992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010725376,0.0006750393,0.0006622756,0.00068324816,0.00033543794,0.00055546296,0.0029241133,0.0005286374,0.000034523928],"category_scores_gemma":[0.000092882285,0.0005925288,0.0002447573,0.0003873993,0.0005138184,0.00076542964,0.00079346396,0.0006993196,0.00003309866],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023669963,0.000033117693,0.000003756873,0.00007369736,0.000016215963,0.00005304472,0.0013411483,0.00044905054,0.0010540049,0.027047997,0.0000991577,0.9698051],"study_design_scores_gemma":[0.00060192804,0.00039328804,0.000033811837,0.0002450495,0.000022966771,0.00004171391,9.273654e-8,0.49939376,0.008955447,0.48829013,0.0011931241,0.00082869205],"about_ca_topic_score_codex":0.00004422144,"about_ca_topic_score_gemma":0.00008922633,"teacher_disagreement_score":0.96897644,"about_ca_system_score_codex":0.00021251726,"about_ca_system_score_gemma":0.00056466245,"threshold_uncertainty_score":0.9996526},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015211948,0.00017680331,0.9819984,0.00026129556,0.00035731492,0.00045951808,0.000013891413,0.00006126208,0.0014596117],"genre_scores_gemma":[0.8587632,0.000039999835,0.13868307,0.0016904154,0.00052215223,0.000021452826,0.000039888622,0.000030673866,0.00020912025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785966,0.000018921888,0.0003047517,0.0010555245,0.00024835274,0.00051278406],"domain_scores_gemma":[0.99895185,0.000106584615,0.00012036436,0.0005375775,0.00016409036,0.0001195573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037990249,0.00037843428,0.0003295659,0.000118357486,0.0001350575,0.00013155495,0.00090175046,0.00050430757,0.000009983307],"category_scores_gemma":[0.000069896465,0.00028233614,0.00018633496,0.00007573386,0.0004925058,0.0000067852243,0.0005985985,0.00026013597,0.00001147038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001461494,0.00026637228,0.00025622718,0.00023210143,0.00014501617,0.00002935173,0.0002623818,0.03780364,0.113507375,0.072428614,0.0005126078,0.7744102],"study_design_scores_gemma":[0.0003527605,0.0004907748,0.000036231537,0.00007910514,0.000015902979,0.000021145208,7.856712e-8,0.89765704,0.008939612,0.0909161,0.00095234544,0.00053889834],"about_ca_topic_score_codex":0.0000017768749,"about_ca_topic_score_gemma":0.000005212845,"teacher_disagreement_score":0.8598534,"about_ca_system_score_codex":0.000035573088,"about_ca_system_score_gemma":0.0001696029,"threshold_uncertainty_score":0.99996287},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009933721,0.000041311716,0.9876968,0.00056936726,0.0013691664,0.00026888214,7.545834e-7,0.00009762028,0.00002236632],"genre_scores_gemma":[0.42820242,7.951932e-7,0.5711387,0.00053719664,0.00011029228,0.000005971084,5.8007674e-7,0.0000034904917,5.758109e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981096,0.000029449127,0.0002959713,0.00056884426,0.0004893715,0.0005068104],"domain_scores_gemma":[0.99836975,0.0006435649,0.00010061928,0.0005444187,0.00024866994,0.00009295448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029787691,0.0001312466,0.00012882393,0.00037289833,0.0002330439,0.0002505429,0.0015586099,0.000067609544,0.0000013716971],"category_scores_gemma":[0.00049446855,0.000121546684,0.000043299082,0.0016971815,0.00024315526,0.00073984766,0.00026435696,0.0001453751,0.000007235836],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001071932,0.00005056813,0.0010924157,0.000017339647,0.0000023900648,0.000005583306,0.0012383044,0.027941495,0.0037776008,0.05426506,0.000006948256,0.9115916],"study_design_scores_gemma":[0.00022234567,0.00008530432,0.007012318,0.000017856977,0.0000011196778,0.000026540594,4.2070766e-7,0.88279164,0.05421753,0.0553203,0.00014515243,0.00015949162],"about_ca_topic_score_codex":0.000006235035,"about_ca_topic_score_gemma":0.000024451983,"teacher_disagreement_score":0.9114321,"about_ca_system_score_codex":0.00012662055,"about_ca_system_score_gemma":0.00018505997,"threshold_uncertainty_score":0.495653},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000071527225,0.00040664797,0.99276775,0.00019244001,0.0007141735,0.0008240913,0.000011136676,0.00009806872,0.004914148],"genre_scores_gemma":[0.13185565,0.000048857553,0.86519235,0.0021070244,0.00021212,0.00005478956,0.000004745288,0.000039201488,0.0004852443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594146,0.000101991456,0.0007744774,0.0015813926,0.0009398945,0.0006607727],"domain_scores_gemma":[0.99691725,0.0005150013,0.00039606262,0.0014523083,0.00043539668,0.0002839725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001433305,0.0005658365,0.0007311281,0.0007284273,0.00018156132,0.00025886568,0.00360748,0.00029537472,0.00007393951],"category_scores_gemma":[0.0000303763,0.00048780304,0.00015082896,0.0008242423,0.00038203748,0.0008635637,0.001089436,0.00057100883,0.00004240523],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027846052,0.00008175708,0.000009680159,0.00008710192,0.000022009417,0.000046935624,0.002398504,0.016416188,0.0007528954,0.028393436,0.000026229158,0.9517374],"study_design_scores_gemma":[0.0010507633,0.0042070663,0.0002577909,0.004110997,0.00007368358,0.00008218621,0.0000042366696,0.4636461,0.05055,0.45465377,0.018486014,0.0028773744],"about_ca_topic_score_codex":0.00022306373,"about_ca_topic_score_gemma":0.000052356405,"teacher_disagreement_score":0.94886005,"about_ca_system_score_codex":0.00019175674,"about_ca_system_score_gemma":0.00084017706,"threshold_uncertainty_score":0.99975735},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078298297,0.00010293444,0.98676,0.00056132005,0.0017991159,0.00027465445,0.0000016551289,0.00017423261,0.009543082],"genre_scores_gemma":[0.8931897,0.000039605246,0.10106777,0.0046422253,0.0005224728,0.000016224772,0.000011588388,0.000037308255,0.00047307336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969748,0.000043689728,0.0006692462,0.0007610411,0.0008837935,0.00066738913],"domain_scores_gemma":[0.9976488,0.00038750048,0.00032141258,0.0013015999,0.0002075524,0.00013318134],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001266991,0.00045924654,0.0005059671,0.0014818092,0.00021935716,0.0019105893,0.0034507369,0.00031706537,0.000013041376],"category_scores_gemma":[0.00013064101,0.00043861364,0.00010123744,0.00070579234,0.00046981568,0.0018860411,0.0015664641,0.00080778287,0.000070389644],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041174358,0.000008757313,0.00041177453,0.00008240727,0.0000044666813,0.000024651785,0.0021998878,0.05363648,0.00001655012,0.022466743,0.00007563655,0.92106855],"study_design_scores_gemma":[0.0005088225,0.00013688882,0.0014868221,0.0012635184,0.000005908027,0.00010851794,9.652452e-7,0.86543673,0.0011040585,0.116637155,0.012106224,0.001204405],"about_ca_topic_score_codex":0.00011708238,"about_ca_topic_score_gemma":0.00020384415,"teacher_disagreement_score":0.9198641,"about_ca_system_score_codex":0.00030465383,"about_ca_system_score_gemma":0.0004279993,"threshold_uncertainty_score":0.9998066},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016136741,0.000120385725,0.99314636,0.00013645286,0.0015249703,0.0004923139,0.00005623357,0.00008976272,0.0028198236],"genre_scores_gemma":[0.58919275,0.00021407865,0.40852174,0.0013621111,0.0004765438,0.000016643633,0.0000923297,0.000049539016,0.00007425381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963381,0.00003120819,0.00070490735,0.0012930208,0.0010845568,0.00054819416],"domain_scores_gemma":[0.99705976,0.00029068295,0.0006326853,0.0015117006,0.00034972714,0.00015546902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086336,0.00049907085,0.0006057159,0.0011306425,0.00016787284,0.0002764223,0.0029697097,0.00030124382,0.000029158082],"category_scores_gemma":[0.000038756072,0.00047700258,0.00017953663,0.00080144586,0.0006041915,0.0013162617,0.0013722478,0.00076414156,0.000017714101],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006378693,0.00023335201,0.0002917174,0.00013418014,0.00006025411,0.000116202194,0.003134736,0.00040092279,0.012176981,0.077633,0.000012112324,0.90574276],"study_design_scores_gemma":[0.0033988792,0.0017620132,0.005984933,0.0041363994,0.00008939347,0.00024276375,0.0000037960497,0.41957182,0.25877428,0.2794417,0.021845715,0.004748289],"about_ca_topic_score_codex":0.00002496313,"about_ca_topic_score_gemma":0.00011248391,"teacher_disagreement_score":0.9009945,"about_ca_system_score_codex":0.00020759382,"about_ca_system_score_gemma":0.00032203423,"threshold_uncertainty_score":0.99976814},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000074382574,0.00035351494,0.9950753,0.00040652795,0.0013399189,0.0006034739,0.0000101209,0.00007299035,0.0021307352],"genre_scores_gemma":[0.056183133,0.0000314813,0.94282085,0.00050049735,0.00024948348,0.000007961337,0.000010629688,0.000022909702,0.00017308534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964394,0.000013702081,0.0007784632,0.0011599681,0.0010732773,0.0005351912],"domain_scores_gemma":[0.996878,0.0005285739,0.0006616179,0.0011099908,0.00067360036,0.00014817526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015801821,0.00041590378,0.0005222433,0.0006772506,0.00020171884,0.00022515385,0.0023183115,0.00021243568,0.000006643912],"category_scores_gemma":[0.00025189796,0.00037799397,0.00016092049,0.00047307514,0.00062327785,0.0008027256,0.0004672301,0.0004840099,0.000004819174],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018860717,0.000022769003,0.00002205912,0.00008062328,0.000005413884,0.000009045143,0.00038814207,0.0027453294,0.0003350538,0.059089117,0.000041975527,0.9372416],"study_design_scores_gemma":[0.000462997,0.00042472663,0.000078798876,0.0012725804,0.000008233586,0.000041541836,7.438855e-7,0.6951776,0.006605698,0.2909503,0.0042992,0.00067754055],"about_ca_topic_score_codex":0.000028323473,"about_ca_topic_score_gemma":0.00016730612,"teacher_disagreement_score":0.9365641,"about_ca_system_score_codex":0.0002023167,"about_ca_system_score_gemma":0.0006277113,"threshold_uncertainty_score":0.9998672},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005386297,0.00026498007,0.9963615,0.000076571734,0.0008965455,0.0008463272,0.00001113757,0.00014465993,0.0008596263],"genre_scores_gemma":[0.9374792,0.000014475999,0.062054496,0.00006187859,0.0001975364,0.000017944452,0.000003373905,0.00004973655,0.00012134799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981863,0.000036599893,0.0003883975,0.0004985486,0.00050034246,0.00038984715],"domain_scores_gemma":[0.9983018,0.000641393,0.00015159918,0.00064634974,0.00016515542,0.00009370592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006839246,0.0003396026,0.00041744896,0.00030942398,0.00019609863,0.00019993121,0.0003720683,0.00007966267,5.342974e-7],"category_scores_gemma":[0.00006872762,0.000254007,0.000056719648,0.00027645926,0.00010357548,0.00018606364,0.0000778071,0.00043135558,0.00000565586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001731799,0.0000023870086,0.0000057447023,0.000020195135,0.000016716105,0.00003222208,0.000066483466,0.9293619,0.0003656029,0.00033308554,0.0000057933266,0.069772586],"study_design_scores_gemma":[0.00014939626,0.00011766672,0.000027770571,0.00050753896,0.000015187904,0.00014271212,8.7115467e-7,0.997454,0.0005245381,0.0002892093,0.0004585731,0.00031257086],"about_ca_topic_score_codex":0.000033350985,"about_ca_topic_score_gemma":0.0001533441,"teacher_disagreement_score":0.93694055,"about_ca_system_score_codex":0.00036029352,"about_ca_system_score_gemma":0.00007586495,"threshold_uncertainty_score":0.99999124},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001228254,0.000070642476,0.98784834,0.00074524083,0.009545337,0.00021491831,0.0000023436971,0.00019451266,0.0012558342],"genre_scores_gemma":[0.04004788,0.000014127118,0.9589212,0.0002732972,0.00039584987,0.000005267032,0.0000017685359,0.000026323927,0.00031429782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968024,0.000031891952,0.0005458056,0.0011042916,0.0011403359,0.00037528013],"domain_scores_gemma":[0.9961394,0.0010780119,0.00038015036,0.002002925,0.00033027044,0.00006924308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011242974,0.00037547192,0.00038914528,0.000490458,0.0001416938,0.000119427976,0.004368296,0.00030135908,0.0000062393333],"category_scores_gemma":[0.0018044751,0.00027899133,0.00015385292,0.00050630653,0.0004930425,0.00031142068,0.0018325117,0.0014651393,0.0000039470347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003519376,0.000011817538,0.0000135885175,0.000007457983,0.000008566864,0.00006210254,0.00022405013,0.8682259,0.0002951478,0.016067782,0.000002220201,0.11507786],"study_design_scores_gemma":[0.00014089006,0.000042054333,0.0000478557,0.0005015648,0.000004757124,0.00019323266,1.7885431e-7,0.73223925,0.005574069,0.25991696,0.0009064006,0.00043277605],"about_ca_topic_score_codex":0.00000516305,"about_ca_topic_score_gemma":0.000012248355,"teacher_disagreement_score":0.24384919,"about_ca_system_score_codex":0.00020242388,"about_ca_system_score_gemma":0.00030876137,"threshold_uncertainty_score":0.9999662},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050987145,0.00023718267,0.98957807,0.0003550919,0.0029989004,0.00031651798,0.000002134687,0.00013453877,0.0012788345],"genre_scores_gemma":[0.9072447,0.000044783825,0.08944199,0.0028176622,0.00028831162,0.000012739187,0.0000022457116,0.000035730092,0.00011183803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996665,0.00008828158,0.00046507284,0.0015258733,0.00062117813,0.0006345816],"domain_scores_gemma":[0.99793965,0.00042190094,0.00019961043,0.0012071604,0.00008402434,0.00014764607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010330875,0.0004853343,0.00044200988,0.0015695355,0.00026563372,0.00027334233,0.0017733307,0.0005317506,0.00003261726],"category_scores_gemma":[0.00008662614,0.00047085254,0.00018261085,0.001037133,0.00045130952,0.00056434196,0.0006962369,0.0010953892,0.000017084163],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050101728,0.00006561348,0.00014853563,0.000028663886,0.000010201058,0.00016570257,0.00085887325,0.01680582,0.0014401913,0.0036915839,0.00006308667,0.97667164],"study_design_scores_gemma":[0.001400482,0.00081843004,0.0027413769,0.0007342003,0.000019856896,0.00015296851,0.0000011580681,0.79464597,0.008243824,0.18414523,0.0050343587,0.0020621794],"about_ca_topic_score_codex":0.00004175148,"about_ca_topic_score_gemma":0.00023449755,"teacher_disagreement_score":0.97460943,"about_ca_system_score_codex":0.00024249736,"about_ca_system_score_gemma":0.00016847401,"threshold_uncertainty_score":0.99977434},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016166843,0.0005767996,0.99355656,0.0007776427,0.001916157,0.00039668652,0.00001429317,0.0002377514,0.002362428],"genre_scores_gemma":[0.3498697,0.00019732538,0.6466973,0.0018022726,0.0010299826,0.000016751283,0.000030872532,0.00005450138,0.00030132395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951473,0.00003731364,0.0007812245,0.0020098728,0.0012166051,0.00080768316],"domain_scores_gemma":[0.9971077,0.000142333,0.00042337016,0.0019597316,0.00022352302,0.0001433545],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006836099,0.00062714756,0.0005368748,0.00043802516,0.0003655536,0.0011143015,0.0040894425,0.00042188852,0.00003086021],"category_scores_gemma":[0.00000921397,0.0005774991,0.00018726102,0.0005304922,0.0004584387,0.001561917,0.001189335,0.0008960789,0.00016008422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014182643,0.00003603008,0.000015917256,0.0000141334185,0.0000048486595,0.000050935443,0.0016747802,0.24387228,0.000012273818,0.004389119,0.000031262014,0.749897],"study_design_scores_gemma":[0.00016821499,0.000095573276,0.000024784793,0.00014135642,0.000010917223,0.000055936216,2.517181e-7,0.89133495,0.00021167847,0.10453557,0.0027428896,0.0006778498],"about_ca_topic_score_codex":0.000109390494,"about_ca_topic_score_gemma":0.000068898655,"teacher_disagreement_score":0.7492192,"about_ca_system_score_codex":0.0003517013,"about_ca_system_score_gemma":0.00028451363,"threshold_uncertainty_score":0.99992263},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012548389,0.0023480228,0.99279547,0.00060681475,0.001515552,0.00025032493,0.000010865938,0.000120515804,0.0022269576],"genre_scores_gemma":[0.06523813,0.000048599017,0.93226624,0.0012993488,0.0009481198,0.0000014418066,0.000005404373,0.000039284565,0.00015344458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613136,0.000054407068,0.00066425104,0.0015040069,0.0008920212,0.00075393566],"domain_scores_gemma":[0.9972665,0.0005408092,0.00058414106,0.0011779893,0.00024740485,0.00018319768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004628988,0.000588787,0.0006953021,0.0005242872,0.00030225556,0.00035909397,0.0027832252,0.0002775365,0.000039870654],"category_scores_gemma":[0.00009749426,0.000532646,0.00017944367,0.00078141555,0.0007017965,0.0018190574,0.0016496852,0.0012992659,0.000011211958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077433415,0.000018364271,0.00023914337,0.00001699421,0.000019211975,0.00008034316,0.000715648,0.2555415,0.0007097825,0.0077623483,0.000028042585,0.7348609],"study_design_scores_gemma":[0.00021815715,0.000056095818,0.0003701171,0.00080657774,0.000014255396,0.000032331413,2.1234288e-7,0.86706275,0.0009174461,0.1292784,0.0006836582,0.00055996375],"about_ca_topic_score_codex":0.000031898493,"about_ca_topic_score_gemma":0.000022790904,"teacher_disagreement_score":0.7343009,"about_ca_system_score_codex":0.00024244464,"about_ca_system_score_gemma":0.00027108827,"threshold_uncertainty_score":0.9997125},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042108592,0.0010721225,0.9219166,0.0037257606,0.0024449083,0.0013022588,0.000018369608,0.0001714052,0.068927474],"genre_scores_gemma":[0.90367544,0.00110375,0.08590448,0.003176447,0.003630087,0.000047680125,0.0000324602,0.000060326915,0.0023693268],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965077,0.000069702175,0.00048721422,0.0010367298,0.0011368983,0.0007617227],"domain_scores_gemma":[0.9983239,0.00022518997,0.00023360159,0.0009072042,0.00013737276,0.00017271507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016637528,0.0003509571,0.000403378,0.0005857475,0.00051678944,0.00033911323,0.0025827081,0.0003601806,0.00030326267],"category_scores_gemma":[0.00041755542,0.00036014538,0.000084045045,0.0005468457,0.001202363,0.0006527142,0.0011466715,0.0008478611,0.0001224948],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022219407,0.00007821098,0.00039874855,0.000063740066,0.0000075928647,0.00004572005,0.011564585,0.00372719,0.000035712386,0.05758146,0.0001707434,0.9263041],"study_design_scores_gemma":[0.0009638888,0.00022073799,0.00095428695,0.001504972,0.000014801896,0.000016458482,0.0000096685,0.035179388,0.0003960181,0.5837414,0.37530833,0.001690007],"about_ca_topic_score_codex":0.0018212001,"about_ca_topic_score_gemma":0.009731042,"teacher_disagreement_score":0.9246141,"about_ca_system_score_codex":0.001014307,"about_ca_system_score_gemma":0.000734709,"threshold_uncertainty_score":0.999885},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00828713,0.000061706975,0.9895026,0.00017630772,0.000877296,0.0005645643,0.000015800311,0.000040875024,0.0004736915],"genre_scores_gemma":[0.50712013,0.000029407496,0.49037006,0.00074136,0.0012180265,0.000050892228,0.000079292244,0.000044308563,0.00034650334],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99812543,0.00001285914,0.00034826636,0.00083610823,0.00032836737,0.00034897536],"domain_scores_gemma":[0.99896497,0.00008570501,0.00020245777,0.00037439488,0.00025863052,0.00011386656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006198553,0.00026378792,0.00025064521,0.00032520763,0.00022623103,0.0000860996,0.00048767784,0.00080314855,0.000004097632],"category_scores_gemma":[0.00035372062,0.00023394662,0.00006817432,0.00020470569,0.000680071,0.000008924807,0.00021261368,0.00033764497,0.000001802932],"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.000050588496,0.00002275821,0.000031797317,0.0000428156,0.000009887813,0.0000011673469,0.00011603791,0.00012072978,0.50063723,0.00008102089,0.00002960324,0.49885637],"study_design_scores_gemma":[0.00063198427,0.0019392994,0.0006296258,0.0005966405,0.000039923805,0.000043564018,0.000001927929,0.1291033,0.80629474,0.007137178,0.052456044,0.0011257451],"about_ca_topic_score_codex":0.0000045409997,"about_ca_topic_score_gemma":0.000022663357,"teacher_disagreement_score":0.49913254,"about_ca_system_score_codex":0.00013244845,"about_ca_system_score_gemma":0.00061404234,"threshold_uncertainty_score":0.9540066},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010917068,0.0028522322,0.9945948,0.0003051124,0.00023331703,0.00064153195,0.0000027859512,0.00010817913,0.00017034182],"genre_scores_gemma":[0.16790216,0.00009947169,0.831624,0.000067568915,0.00020289501,0.000028129292,0.0000030339095,0.00002102376,0.000051745512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688727,0.000024399169,0.0006498196,0.0011898503,0.0007105724,0.00053809606],"domain_scores_gemma":[0.9980835,0.00016618523,0.00035712065,0.00094574474,0.00026060894,0.00018684457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022177401,0.00039816025,0.0005389819,0.00045917943,0.0003486315,0.00017767311,0.0016387578,0.00022261881,0.0000031142613],"category_scores_gemma":[0.000019539342,0.00038690245,0.00009810592,0.00063499185,0.001031514,0.0002240296,0.0008121061,0.00049467804,0.0000061595265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011490304,0.00006757076,0.0009798927,0.00004872626,0.0000087079925,0.000025224637,0.0014381314,0.010060743,0.00005476417,0.0015538913,0.0000069548814,0.98575425],"study_design_scores_gemma":[0.00023156863,0.00036186358,0.0035257176,0.00027553193,0.000015935555,0.00026383315,0.0000010398718,0.98064977,0.00035732935,0.008710541,0.0049903207,0.0006165214],"about_ca_topic_score_codex":0.000034373777,"about_ca_topic_score_gemma":0.000037851358,"teacher_disagreement_score":0.9851377,"about_ca_system_score_codex":0.00009795799,"about_ca_system_score_gemma":0.00037706268,"threshold_uncertainty_score":0.99985826},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000093930075,0.0004576513,0.9904407,0.00041845583,0.0007100321,0.0006901062,0.0000075345747,0.00023796519,0.007028157],"genre_scores_gemma":[0.03865285,0.000086726075,0.95817316,0.0021930772,0.0006515987,0.000041327352,0.000014711098,0.00002620862,0.00016035841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969293,0.000018691051,0.0006174345,0.00095777534,0.0009045422,0.0005722653],"domain_scores_gemma":[0.9971978,0.0005036334,0.0003004987,0.0014565425,0.00033277666,0.00020876274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010636149,0.00044399797,0.00040199494,0.0007933228,0.00029721012,0.00075044046,0.0025047655,0.00027879432,0.000008762612],"category_scores_gemma":[0.00006372834,0.00042522728,0.00007671168,0.0007950102,0.00085798895,0.0014332313,0.0016510052,0.00066148787,0.00005349645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015355633,0.000012361506,0.00004631092,0.000034834185,0.0000029498972,0.0000063006655,0.00034155307,0.004547281,0.0000024542803,0.090059735,0.0000056946715,0.904939],"study_design_scores_gemma":[0.00022969044,0.000105145285,0.00052302185,0.00011432286,0.000005772556,0.000094407245,3.1905955e-7,0.53397524,0.000113455026,0.43043205,0.033654995,0.0007516007],"about_ca_topic_score_codex":0.000016610273,"about_ca_topic_score_gemma":0.00006376875,"teacher_disagreement_score":0.9041874,"about_ca_system_score_codex":0.0003353861,"about_ca_system_score_gemma":0.00031394392,"threshold_uncertainty_score":0.99981993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000070951915,0.00024094024,0.9942684,0.00014417364,0.0006408893,0.00045808032,0.0000026907499,0.0006108415,0.0035630078],"genre_scores_gemma":[0.16200954,0.00008322135,0.8343265,0.0026928624,0.00050983747,0.000010603833,0.000011452353,0.00009049091,0.00026551893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99526614,0.000031440886,0.0006745402,0.0017812381,0.0014285657,0.00081807043],"domain_scores_gemma":[0.99670345,0.00043227972,0.00045308738,0.0016548678,0.0005125926,0.00024373832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001078422,0.00069175643,0.0005858678,0.0019610494,0.00037463728,0.0008723373,0.003388217,0.00040050846,0.000008937385],"category_scores_gemma":[0.00003191103,0.00059797213,0.00015487707,0.0018532599,0.0007159854,0.0006911249,0.0013754799,0.0009380095,0.000009176581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060234956,0.00004487787,0.0005382802,0.000043591805,0.00002241744,0.00011731127,0.00054316496,0.014903836,0.000018532777,0.4156192,0.000028756001,0.56811404],"study_design_scores_gemma":[0.00023890185,0.0003280518,0.000094748546,0.0004574439,0.000008245277,0.00008189824,9.003785e-8,0.7664653,0.00083232176,0.22807603,0.002574049,0.00084293674],"about_ca_topic_score_codex":0.0000189229,"about_ca_topic_score_gemma":0.00007285472,"teacher_disagreement_score":0.75156146,"about_ca_system_score_codex":0.00019642107,"about_ca_system_score_gemma":0.00047132728,"threshold_uncertainty_score":0.99964714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053436885,0.0008352214,0.996547,0.00040541118,0.00049872726,0.00035357242,0.000001312206,0.00014565248,0.0006787455],"genre_scores_gemma":[0.14950661,0.00033901355,0.8493316,0.00036632278,0.00009582277,0.000004216258,0.0000011729767,0.000021711452,0.0003335297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977769,0.000034481673,0.0003725372,0.00089038204,0.00064433255,0.00028135334],"domain_scores_gemma":[0.9982065,0.00022379286,0.00040149578,0.00084453746,0.00026454963,0.000059147205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000421305,0.00033192674,0.00036434998,0.00037221212,0.00025998426,0.00023961891,0.0012066909,0.00023043827,0.0000018903503],"category_scores_gemma":[0.00005977074,0.00021700763,0.000060570383,0.0004876067,0.000726317,0.00055171945,0.00048125413,0.00069374754,8.050883e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023291677,0.0000232152,0.00008357042,0.00006146851,0.000013643243,0.000028012231,0.0034543993,0.054330394,0.0009035903,0.0050181434,0.000101830505,0.93595845],"study_design_scores_gemma":[0.00012442512,0.00009040907,0.000027362317,0.0005892214,0.000009326648,0.0002478084,2.3552633e-7,0.91044176,0.011587012,0.07651205,0.00004643119,0.00032398495],"about_ca_topic_score_codex":0.0001167884,"about_ca_topic_score_gemma":0.00024254821,"teacher_disagreement_score":0.93563443,"about_ca_system_score_codex":0.00015480722,"about_ca_system_score_gemma":0.0005057833,"threshold_uncertainty_score":0.88493145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011498856,0.00018898962,0.9049725,0.0001885634,0.0046160524,0.00030677952,0.000010031822,0.00015792364,0.08840927],"genre_scores_gemma":[0.9798116,0.000024167239,0.01411812,0.0013947167,0.0008447991,0.0000091495485,0.000030772768,0.00006041515,0.0037062708],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979439,0.000051787127,0.00030412286,0.0009922632,0.0003080636,0.00039986565],"domain_scores_gemma":[0.99878734,0.0001069205,0.00019727163,0.0006081171,0.00014586301,0.00015448625],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032607056,0.00033627104,0.00029049706,0.0004849742,0.00011838108,0.00008352372,0.00065959216,0.0004003853,0.0014447127],"category_scores_gemma":[0.000022096861,0.00031354098,0.00008783618,0.00015120448,0.00053773343,0.0002466693,0.00013890323,0.0007452952,0.0005930139],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032033142,0.00016074859,0.000037358634,0.000014213983,0.000030099516,0.000046954003,0.00809632,0.00018194596,0.00022096981,0.0111278435,0.00014775693,0.97990376],"study_design_scores_gemma":[0.0036538492,0.003970787,0.008794587,0.0022363677,0.00019111714,0.00129105,0.000031892418,0.017319245,0.013810448,0.91274315,0.031108776,0.0048487578],"about_ca_topic_score_codex":0.00006015677,"about_ca_topic_score_gemma":0.00009250439,"teacher_disagreement_score":0.9786617,"about_ca_system_score_codex":0.00012909343,"about_ca_system_score_gemma":0.00009931564,"threshold_uncertainty_score":0.9999317},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022025021,0.00082225684,0.9925351,0.0010496723,0.0008276392,0.00025094932,9.869789e-7,0.0021007545,0.0021923962],"genre_scores_gemma":[0.27461472,0.000062855695,0.72381926,0.00086309464,0.00041913486,0.000011974306,0.0000027513147,0.000026908394,0.0001792984],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99638104,0.000043240776,0.00059804274,0.0014495902,0.00086880993,0.00065926666],"domain_scores_gemma":[0.99783045,0.0004932886,0.0003188382,0.0010694221,0.00018547183,0.00010250819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014414228,0.0004628759,0.0004482501,0.0013958084,0.00020930012,0.0007708662,0.0027827579,0.0003189348,0.0000060826887],"category_scores_gemma":[0.00031050286,0.0004566474,0.00008978274,0.0008674359,0.00039194393,0.0011590885,0.0008813953,0.0007933189,0.000011912163],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012869934,0.000016011752,0.00035930387,0.000024015799,0.0000022878278,0.00007837194,0.0007946421,0.013621355,0.00010223563,0.014381818,0.000029547988,0.9705891],"study_design_scores_gemma":[0.0001517403,0.00009963126,0.0006528342,0.0013561257,0.0000036165613,0.00011479926,5.950296e-8,0.46077323,0.0018352962,0.5336479,0.0006064525,0.0007583329],"about_ca_topic_score_codex":0.000113774,"about_ca_topic_score_gemma":0.00011775456,"teacher_disagreement_score":0.9698308,"about_ca_system_score_codex":0.0006007292,"about_ca_system_score_gemma":0.00047195452,"threshold_uncertainty_score":0.9997885},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005348083,0.0009781809,0.99337703,0.0007750251,0.0015245457,0.0005262303,0.000020664414,0.00022321907,0.002040306],"genre_scores_gemma":[0.6949743,0.000022733964,0.30346143,0.000541123,0.000728361,0.0000057266893,0.000026046137,0.000046291963,0.00019399419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99428433,0.00016334697,0.0011399519,0.0016171515,0.0018543197,0.00094092294],"domain_scores_gemma":[0.99432176,0.0015948846,0.0011139995,0.0020861267,0.00071786635,0.00016538515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026386725,0.0006738289,0.00084704027,0.00046186708,0.0005606111,0.00085592474,0.004877483,0.00044441898,0.000011478277],"category_scores_gemma":[0.00059586414,0.0005041823,0.0002482555,0.0015924635,0.0009896236,0.00044254464,0.0015487885,0.0013858842,0.000018217406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015876501,0.000043967448,0.0001097862,0.00015646077,0.000023243007,0.000114885275,0.0014515679,0.18562086,0.00024479398,0.007762614,0.000046861103,0.8044091],"study_design_scores_gemma":[0.00020662545,0.00020048433,0.00025760694,0.001890659,0.000018813764,0.00020668416,6.9442376e-7,0.8854549,0.00025951737,0.11005445,0.00083929993,0.0006102957],"about_ca_topic_score_codex":0.000036538164,"about_ca_topic_score_gemma":0.000007805956,"teacher_disagreement_score":0.8037988,"about_ca_system_score_codex":0.00025162197,"about_ca_system_score_gemma":0.0010411761,"threshold_uncertainty_score":0.99974096},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000116562725,0.00006844683,0.994936,0.00093635934,0.0008997772,0.0010887623,0.000011368812,0.00018898092,0.0017537475],"genre_scores_gemma":[0.04021906,0.000010651432,0.953667,0.0044761966,0.00065641274,0.0000809435,0.000044761084,0.000033679324,0.00081129186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964401,0.000042718624,0.00036042204,0.0018100224,0.00068910373,0.0006575988],"domain_scores_gemma":[0.99828994,0.00013057179,0.00018206183,0.00081614044,0.0003206381,0.00026065632],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000562289,0.0005387699,0.00044866683,0.0007839491,0.00039500828,0.0011172297,0.0018928985,0.00025441297,0.0000084529065],"category_scores_gemma":[0.00002939687,0.00047504506,0.00013546743,0.00043821754,0.000106167405,0.0012106224,0.000421019,0.0005631502,0.000019909125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002779404,0.00006448431,0.000004025344,0.000042340478,0.000009586608,0.0000062277145,0.0012440071,0.096906185,0.0015256025,0.0011965984,0.00057641394,0.89839673],"study_design_scores_gemma":[0.0003782302,0.0008258328,0.000031949476,0.00044076552,0.00000905073,0.00009231941,5.530677e-7,0.9363404,0.012105782,0.04290232,0.0060247877,0.0008479943],"about_ca_topic_score_codex":0.000008396266,"about_ca_topic_score_gemma":0.000023909608,"teacher_disagreement_score":0.89754874,"about_ca_system_score_codex":0.00028848927,"about_ca_system_score_gemma":0.00019781145,"threshold_uncertainty_score":0.9999197},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05650681,0.00007644383,0.9416225,0.0011915357,0.00013163293,0.0003824933,6.9497355e-7,0.00008434121,0.000003576681],"genre_scores_gemma":[0.5265465,0.0000065612644,0.47256243,0.0008201634,0.00004087159,0.000018593115,0.0000017584002,0.0000027652845,3.7211234e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981454,0.000048401256,0.000441477,0.0005492258,0.0005603518,0.0002551561],"domain_scores_gemma":[0.9987995,0.0003851171,0.00015500608,0.0004153407,0.0001272146,0.00011782142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008827323,0.00013200488,0.00019436772,0.00045107334,0.00008422941,0.00010652441,0.0003965017,0.000042027976,0.0000069722064],"category_scores_gemma":[0.00013991246,0.00012935273,0.000025293812,0.0011587904,0.00014816853,0.0008429146,0.00032203784,0.00008807292,0.000005622095],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034348434,0.000045113466,0.00016697311,0.000015707134,0.0000010090512,0.000002064156,0.000659152,0.09199947,0.1073143,0.000015700078,0.000008461857,0.7997686],"study_design_scores_gemma":[0.00008053198,0.00005599821,0.0011038947,0.000036356432,0.0000011067973,0.00000630166,5.2887435e-7,0.59394115,0.40398023,0.0006804315,0.000014028786,0.00009948301],"about_ca_topic_score_codex":0.000024127572,"about_ca_topic_score_gemma":0.0000126876575,"teacher_disagreement_score":0.79966915,"about_ca_system_score_codex":0.00012978408,"about_ca_system_score_gemma":0.0000770103,"threshold_uncertainty_score":0.52748513},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021003264,0.00057778566,0.9942784,0.00071439135,0.0006850729,0.00033247433,0.00000778695,0.00006420553,0.0012395836],"genre_scores_gemma":[0.16704232,0.00026713486,0.8315131,0.00064298674,0.00025693505,0.000004730181,0.00004769992,0.000027331524,0.00019774721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623007,0.000036391782,0.0005458019,0.0018699644,0.0007192491,0.000598513],"domain_scores_gemma":[0.9975082,0.0002636132,0.00021578134,0.0018592937,0.000046324276,0.00010678295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011017125,0.00041534984,0.00046502473,0.001104019,0.00012737793,0.0004283881,0.0035715424,0.00017138963,0.00000359889],"category_scores_gemma":[0.00010083696,0.0004129825,0.000033453656,0.0006912701,0.00037911718,0.0018040402,0.0059170537,0.0005754386,0.000009310117],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034417913,0.00003962251,0.0021624116,0.000058276688,0.000007255481,0.0007630501,0.0010925194,0.0034556233,0.000053879656,0.0013488488,0.00007923817,0.99093586],"study_design_scores_gemma":[0.0005962928,0.000083330706,0.0057609896,0.0010179493,0.000004701113,0.00010176702,0.0000011534565,0.9824833,0.0002553083,0.0038806791,0.00488066,0.0009338146],"about_ca_topic_score_codex":0.00006182138,"about_ca_topic_score_gemma":0.0008486178,"teacher_disagreement_score":0.99000204,"about_ca_system_score_codex":0.00015134137,"about_ca_system_score_gemma":0.00023520204,"threshold_uncertainty_score":0.9998322},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019894009,0.0013187453,0.98610497,0.0036759537,0.004828752,0.0005857881,0.000016845097,0.00024222517,0.0030277676],"genre_scores_gemma":[0.4056278,0.00012408037,0.5866876,0.0034822791,0.0016527672,0.000038556493,0.000044639015,0.000098546676,0.0022437202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939412,0.000043839293,0.0006688564,0.0024272294,0.0019308262,0.0009880313],"domain_scores_gemma":[0.99512124,0.00042866665,0.00021458528,0.0036719278,0.00034954984,0.00021401001],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002395778,0.0006052149,0.0007595252,0.0013588865,0.00016243504,0.0010308824,0.0095755765,0.0003900191,0.000011647019],"category_scores_gemma":[0.0004182147,0.00055032596,0.000071993665,0.00095442537,0.00037534474,0.0011010886,0.005364297,0.0008555834,0.00008586689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014941361,0.000093042254,0.0007388299,0.0004045518,0.000028264536,0.0016025353,0.005699901,0.18102908,0.00013353734,0.054272257,0.0006094545,0.7553736],"study_design_scores_gemma":[0.0009953893,0.00038091774,0.0021581184,0.0038168116,0.000017800896,0.0003809184,0.0000049020723,0.87299365,0.00046055717,0.085592344,0.030437019,0.0027616005],"about_ca_topic_score_codex":0.00067379215,"about_ca_topic_score_gemma":0.0010576361,"teacher_disagreement_score":0.752612,"about_ca_system_score_codex":0.0005218714,"about_ca_system_score_gemma":0.0007501893,"threshold_uncertainty_score":0.9996948},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003214303,0.00012066643,0.98814815,0.0009616935,0.00053208886,0.0016095795,0.000024548128,0.00023004896,0.008341102],"genre_scores_gemma":[0.030254444,0.00006185222,0.96632624,0.0014361533,0.0003979139,0.00021758873,0.000022228223,0.00011029115,0.0011732953],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99404234,0.00010264218,0.00060209626,0.002306785,0.0015973687,0.0013487666],"domain_scores_gemma":[0.99449414,0.0023801923,0.00024705636,0.002152292,0.00044833077,0.00027801195],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0029959432,0.00069431844,0.0006846897,0.002438071,0.00056647457,0.0004529551,0.0057020625,0.00045608892,0.000014537085],"category_scores_gemma":[0.0003040557,0.0006285592,0.0002503544,0.0015177854,0.0010403267,0.0005465619,0.0010592808,0.0015225699,0.000026843585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070751434,0.00003948148,0.000015107096,0.00007386987,0.000014871714,0.00016505536,0.00035080957,0.0067920256,0.0019476269,0.33481565,0.0000588684,0.65565586],"study_design_scores_gemma":[0.0005794136,0.00095040584,0.000021419106,0.0005956457,0.0000047258686,0.00012396218,3.8349896e-7,0.095970675,0.015981779,0.8824457,0.0024664192,0.0008594767],"about_ca_topic_score_codex":0.000010728281,"about_ca_topic_score_gemma":0.000060434955,"teacher_disagreement_score":0.6547964,"about_ca_system_score_codex":0.00043012472,"about_ca_system_score_gemma":0.00049205724,"threshold_uncertainty_score":0.99967754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019303523,0.00011673635,0.98962694,0.0008569973,0.0015675583,0.00043304768,0.0000039641354,0.0002018783,0.005262539],"genre_scores_gemma":[0.8564709,0.000054415897,0.14177017,0.00073041144,0.00038592643,0.000008815514,0.0000149451025,0.00003062554,0.00053383247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949013,0.000102303355,0.001008901,0.0016249968,0.0017655067,0.0005969896],"domain_scores_gemma":[0.9975806,0.00016823092,0.0005724715,0.0010817441,0.00038705164,0.00020992398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088109495,0.00051058846,0.0006884226,0.001328432,0.00022384488,0.00030505972,0.0021956614,0.00039088362,0.00003777224],"category_scores_gemma":[0.00016059287,0.00047992883,0.00027298098,0.0013955922,0.0007022505,0.0008930741,0.00070231536,0.0007672694,0.000030956257],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014937986,0.000112089656,0.00010388713,0.000029455245,0.000007935563,0.000033477012,0.00069343916,0.002512492,0.00073050265,0.019636242,0.000011918747,0.9761136],"study_design_scores_gemma":[0.0007658112,0.0019013933,0.005083451,0.0005029101,0.00002141676,0.00013032407,8.493197e-7,0.5984872,0.015788564,0.37544873,0.0006817349,0.0011876286],"about_ca_topic_score_codex":0.00008563886,"about_ca_topic_score_gemma":0.000060991344,"teacher_disagreement_score":0.974926,"about_ca_system_score_codex":0.0002498431,"about_ca_system_score_gemma":0.0006931505,"threshold_uncertainty_score":0.9997652},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22937496,0.0012771792,0.7552329,0.0009636638,0.003208292,0.0012292278,0.000008727838,0.000042880987,0.0086621875],"genre_scores_gemma":[0.9495376,0.000011900133,0.04738726,0.000431378,0.00018259694,0.00004959172,0.000019559893,0.000021563776,0.0023585986],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99807733,0.000026365566,0.0005157747,0.0006113004,0.00050394447,0.00026531078],"domain_scores_gemma":[0.9988929,0.0002517876,0.00018728839,0.0004376963,0.00017074501,0.000059596518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046748185,0.00021586903,0.00028390507,0.00046608518,0.00007431595,0.00007277494,0.00085073547,0.00010683973,0.00042701644],"category_scores_gemma":[0.000030570005,0.00020521805,0.000041757205,0.0001828777,0.00033848087,0.00007678433,0.00014542812,0.00030571045,0.0001053866],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017259199,0.0007265539,0.012820784,0.00007005952,0.00007320804,0.00001699898,0.041157413,0.004058113,0.0006629582,0.010171374,0.00031345364,0.92991185],"study_design_scores_gemma":[0.003927428,0.00070211943,0.8435113,0.004505778,0.000098888275,0.00011240204,0.00031279653,0.00727755,0.0048172534,0.07221883,0.058579296,0.003936393],"about_ca_topic_score_codex":0.00004534622,"about_ca_topic_score_gemma":0.0000639053,"teacher_disagreement_score":0.92597544,"about_ca_system_score_codex":0.00018532056,"about_ca_system_score_gemma":0.00037328183,"threshold_uncertainty_score":0.83685493},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014374968,0.00035341486,0.9976896,0.000083157414,0.0005166218,0.0002904797,0.000011304842,0.00037003285,0.0005416297],"genre_scores_gemma":[0.5346726,0.00006764379,0.46492484,0.0001710584,0.00010155237,0.000008715984,0.0000046747678,0.000020013107,0.00002887288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963109,0.00005526385,0.0007024527,0.0014000516,0.00094421173,0.00058711285],"domain_scores_gemma":[0.99674994,0.00049392687,0.00054432993,0.0017849506,0.000290677,0.0001361597],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006683627,0.0005388981,0.0007894201,0.0038793932,0.00024509267,0.00020053702,0.0028489577,0.00036597444,0.000013562972],"category_scores_gemma":[0.00004033732,0.0004976569,0.0005796127,0.0037930175,0.00077788054,0.00068366324,0.0007587996,0.0006487624,0.0000031786724],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008973044,0.000057368106,0.00097278826,0.000057688085,0.00016482132,0.000028296165,0.00065403746,0.0130334655,0.0008528751,0.004485666,0.0000035384153,0.9796805],"study_design_scores_gemma":[0.00022310992,0.00046495584,0.00068115466,0.00024135865,0.00014060405,0.000028813616,1.3901443e-7,0.51791185,0.039936166,0.43766862,0.0015870583,0.0011161753],"about_ca_topic_score_codex":0.00005600679,"about_ca_topic_score_gemma":0.00008832282,"teacher_disagreement_score":0.9785643,"about_ca_system_score_codex":0.00011106133,"about_ca_system_score_gemma":0.00006128213,"threshold_uncertainty_score":0.9997475},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12557644,0.00085584185,0.76062894,0.001199526,0.0014262145,0.0017066576,0.00010182294,0.00035621037,0.10814836],"genre_scores_gemma":[0.9908626,0.000051557512,0.008204832,0.00015395583,0.00020590263,0.0000068630175,0.000020213762,0.000016830263,0.00047724583],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973177,0.00003656326,0.00057774794,0.0005998257,0.0009933561,0.00047483007],"domain_scores_gemma":[0.99800193,0.00043219177,0.00038128236,0.0005484863,0.00044290684,0.0001931701],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010841719,0.00031263355,0.00045430736,0.0005278514,0.00041825723,0.0010710498,0.0011676109,0.00026613148,0.00013357807],"category_scores_gemma":[0.0003669548,0.00028323068,0.00008813548,0.0006185726,0.0028565754,0.006051269,0.00037008038,0.00029209678,0.000008364969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028695902,0.0000976261,0.092994854,0.00029443027,0.000025630088,0.000003292027,0.13493434,0.012705215,0.0000061353044,0.04163273,0.00007877636,0.71719825],"study_design_scores_gemma":[0.00090868736,0.00057048403,0.03187124,0.0016805066,0.000056845613,0.000017831635,0.00029085952,0.044124383,0.00023782106,0.90518177,0.012595018,0.0024645803],"about_ca_topic_score_codex":0.0042964923,"about_ca_topic_score_gemma":0.0022140485,"teacher_disagreement_score":0.8652862,"about_ca_system_score_codex":0.00034538956,"about_ca_system_score_gemma":0.0007964368,"threshold_uncertainty_score":0.9999659},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002189255,0.0006042495,0.9973619,0.0001881763,0.00050464616,0.0007085079,0.000007719658,0.00022447493,0.0003784547],"genre_scores_gemma":[0.0153667815,0.000013997918,0.9838823,0.00021572574,0.00033144708,0.00009129283,0.000001845671,0.000032079617,0.000064531],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972842,0.000020009402,0.00060897425,0.0010997226,0.00044361022,0.0005435121],"domain_scores_gemma":[0.9933093,0.0048679113,0.0003515087,0.0011326974,0.0002557709,0.00008281818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001002839,0.00039230488,0.00057372026,0.00074763905,0.000088708,0.00008940504,0.0024118326,0.00032357778,0.0000033911167],"category_scores_gemma":[0.0013127144,0.0003837564,0.000100395875,0.00089834124,0.00040817316,0.00044892295,0.00067792804,0.0007152306,0.0000028990087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026820994,0.000015596877,0.00006641063,0.00005680504,0.0000045190745,0.000009331788,0.00018529914,0.33713368,0.00014092975,0.085373506,0.0000017019938,0.57700956],"study_design_scores_gemma":[0.00021883247,0.00012818647,0.00014644834,0.00052331726,0.000005571638,0.00003400021,2.1768155e-7,0.1889327,0.00090885605,0.80749434,0.0010661475,0.0005413944],"about_ca_topic_score_codex":0.0000034071284,"about_ca_topic_score_gemma":0.000030349902,"teacher_disagreement_score":0.7221208,"about_ca_system_score_codex":0.00017535979,"about_ca_system_score_gemma":0.00044429553,"threshold_uncertainty_score":0.9998614},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022342449,0.000019271774,0.9760874,0.00014771821,0.00028334447,0.0008373648,0.000032818905,0.000019200206,0.00023044372],"genre_scores_gemma":[0.9661981,0.0000025009124,0.033149663,0.00015428665,0.00041123695,0.000021885133,0.00001330485,0.000020997502,0.000028029528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998364,0.000017562843,0.00043416914,0.00061297044,0.00029599288,0.0002753222],"domain_scores_gemma":[0.99893284,0.0003871974,0.00020232586,0.00028229452,0.00014568328,0.000049662387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003325464,0.00023554679,0.00030004483,0.00016730872,0.0004110713,0.00012339631,0.00024909218,0.0001650158,0.0000065819095],"category_scores_gemma":[0.000026522051,0.0002464929,0.00010892227,0.00021575282,0.00019971165,0.00017542638,0.00011070278,0.00050510705,0.0000016828709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001166342,0.00006679938,0.00029505076,0.0000064045844,0.0000064370734,0.000019930969,0.006407235,0.91358614,6.877653e-7,0.008275133,8.198854e-7,0.07132371],"study_design_scores_gemma":[0.00016051944,0.00006072033,0.000047144178,0.000079177255,0.0000043089167,0.0000031902819,0.000014814307,0.7471137,0.000002483145,0.25230935,0.000012925523,0.00019165695],"about_ca_topic_score_codex":0.00012296377,"about_ca_topic_score_gemma":0.00007229271,"teacher_disagreement_score":0.94385564,"about_ca_system_score_codex":0.00015447446,"about_ca_system_score_gemma":0.00024083526,"threshold_uncertainty_score":0.99999875},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029453522,0.0012753244,0.9898887,0.001214722,0.0014941738,0.00032082232,0.000003779485,0.00038010426,0.0051277964],"genre_scores_gemma":[0.46158397,0.000070027345,0.5303116,0.0022157354,0.0015049542,0.000016921125,0.00002625381,0.00015530571,0.0041152486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948175,0.00008539984,0.00079351495,0.0020630334,0.0011151683,0.0011253859],"domain_scores_gemma":[0.9974547,0.000642215,0.00036488523,0.0012352808,0.00012298621,0.00017990061],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012425826,0.0007688115,0.0007925756,0.0024907656,0.0003210283,0.00064802705,0.0036850024,0.0002846058,0.00001662485],"category_scores_gemma":[0.00008039361,0.0007023579,0.00019074025,0.0017729872,0.00050850486,0.00035819458,0.0018831496,0.0025717353,0.000043303055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034237216,0.000032534583,0.00030555847,0.000026556701,0.0000042307065,0.00029577693,0.00027554942,0.5739992,0.000022735097,0.010642395,0.000024190314,0.41436782],"study_design_scores_gemma":[0.00030785444,0.0001242348,0.00038183344,0.00050148985,0.0000030302338,0.00007874658,3.7887887e-8,0.8954051,0.00008384297,0.09659222,0.005794359,0.0007272252],"about_ca_topic_score_codex":0.00026898432,"about_ca_topic_score_gemma":0.0008204061,"teacher_disagreement_score":0.46128944,"about_ca_system_score_codex":0.0003290743,"about_ca_system_score_gemma":0.00048405043,"threshold_uncertainty_score":0.9997294},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1326686,0.0047791265,0.85561067,0.00028784183,0.0004891509,0.00032551348,0.000013942609,0.000044092885,0.00578105],"genre_scores_gemma":[0.99324507,0.000058703023,0.005091453,0.0006204957,0.00050482235,0.0000018718347,0.000019068993,0.0000131163315,0.00044542563],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987599,0.000015085868,0.00017785042,0.0006645127,0.000115311246,0.00026734133],"domain_scores_gemma":[0.9995109,0.000030525192,0.00007406498,0.00027067185,0.00006516524,0.000048668153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002226846,0.0002616076,0.00021824685,0.00007357122,0.00011741094,0.000093760624,0.00039304944,0.00025540948,0.0000030217511],"category_scores_gemma":[0.00003505512,0.00016489645,0.000053734628,0.000050674527,0.0006821839,0.0000033487784,0.0005383934,0.0001916568,0.000002441774],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034499095,0.000033137007,0.00064542505,0.00006512247,0.000023289602,0.00001621108,0.00010598884,0.00406549,0.3894809,0.00034863557,0.00013146941,0.60504985],"study_design_scores_gemma":[0.0009494637,0.0022962466,0.002249219,0.0009888445,0.000027319598,0.00027486248,0.0000015053373,0.0544859,0.8212472,0.055373214,0.059043393,0.0030628291],"about_ca_topic_score_codex":0.0000083710565,"about_ca_topic_score_gemma":0.000035266272,"teacher_disagreement_score":0.86057645,"about_ca_system_score_codex":0.000015853604,"about_ca_system_score_gemma":0.0000726075,"threshold_uncertainty_score":0.67242825},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005918966,0.0020819867,0.68614304,0.0014090278,0.001810827,0.0006061882,0.0000064812803,0.0003361959,0.30168727],"genre_scores_gemma":[0.9676823,0.000029748211,0.028180484,0.0008763714,0.00042790337,0.000010283229,0.000009704548,0.000034320277,0.0027488756],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984154,0.000040392482,0.0002695817,0.000569181,0.0003269111,0.00037852922],"domain_scores_gemma":[0.99842966,0.00031739127,0.00013425358,0.0009956898,0.000048720784,0.00007426744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005599479,0.00025062708,0.0002479541,0.00032220504,0.00016854268,0.00012819548,0.0010222916,0.00024994064,0.00045922073],"category_scores_gemma":[0.000047727866,0.0002332452,0.000067009496,0.0001790385,0.0003386262,0.00009466687,0.00032609166,0.0006455965,0.00021416425],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010202181,0.0000558756,0.00035359166,0.000025466088,0.000017864588,0.00008966402,0.00968149,0.00199284,0.00050358643,0.017224899,0.00005595759,0.9699886],"study_design_scores_gemma":[0.008980514,0.0047429204,0.046503685,0.011139558,0.00027704565,0.0008129727,0.00008901945,0.08829899,0.0067085517,0.7837994,0.03801606,0.010631291],"about_ca_topic_score_codex":0.00008219938,"about_ca_topic_score_gemma":0.00007718851,"teacher_disagreement_score":0.9617633,"about_ca_system_score_codex":0.00019510949,"about_ca_system_score_gemma":0.00021804629,"threshold_uncertainty_score":0.9511463},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032823794,0.0001874399,0.99494165,0.0003346124,0.00046676092,0.00028506646,0.00001209959,0.000076526674,0.0004134755],"genre_scores_gemma":[0.043912742,0.00007112008,0.9552894,0.00030566962,0.0001058842,0.000012194192,0.000048096445,0.000033605236,0.0002212795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713093,0.000063767184,0.0005663706,0.0009779079,0.00087005127,0.0003909783],"domain_scores_gemma":[0.9978092,0.00053239684,0.00051834114,0.0005594265,0.0004724737,0.00010817078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012144637,0.00032835014,0.00043447077,0.0007316306,0.000325857,0.0002948447,0.00089218206,0.00025591187,0.000007295265],"category_scores_gemma":[0.0002466047,0.00034885237,0.000062604515,0.00081923226,0.00019659259,0.00071864075,0.0004348624,0.00044348446,0.0000022799154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036499728,0.0000906402,0.0014840979,0.00007725296,0.00004198861,0.000012350086,0.0036018535,0.012310986,0.0010091501,0.019942775,0.000023338145,0.96140194],"study_design_scores_gemma":[0.00045559017,0.000101701626,0.0002608635,0.00023559673,0.000015539441,0.0000175332,0.0000027992166,0.991035,0.00077811215,0.0062160394,0.0005183995,0.00036285052],"about_ca_topic_score_codex":0.00004014938,"about_ca_topic_score_gemma":0.00001102915,"teacher_disagreement_score":0.978724,"about_ca_system_score_codex":0.0003550381,"about_ca_system_score_gemma":0.0002498723,"threshold_uncertainty_score":0.99989635},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041140138,0.00041940907,0.9760595,0.00037439942,0.0024945887,0.0005962656,0.000006992193,0.00042916802,0.019578516],"genre_scores_gemma":[0.44742498,0.000027317128,0.55088586,0.00060176855,0.0005064207,0.000014125338,0.0000053734793,0.00006516201,0.00046897496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99456847,0.00006668507,0.001519411,0.0016366661,0.0012184042,0.0009903718],"domain_scores_gemma":[0.9956774,0.00049211184,0.0011833236,0.0020328546,0.00037812762,0.00023616268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003329273,0.00067784684,0.0010603366,0.0015175152,0.00021425077,0.0003853814,0.004113475,0.00052724464,0.000018480054],"category_scores_gemma":[0.000061213876,0.000604505,0.00026649592,0.000837618,0.00039428566,0.00062208244,0.0016700244,0.00092441065,0.000018814766],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004432249,0.000027790926,0.00007690554,0.00025551664,0.000022905031,0.00009688816,0.00086562475,0.00041430682,0.000065250395,0.032047804,0.00012810952,0.9659945],"study_design_scores_gemma":[0.0022462858,0.0010545345,0.00087018847,0.012957146,0.00010685445,0.001896149,0.000018948505,0.61770266,0.036286976,0.29069918,0.028850606,0.0073104664],"about_ca_topic_score_codex":0.00015426327,"about_ca_topic_score_gemma":0.000092009795,"teacher_disagreement_score":0.958684,"about_ca_system_score_codex":0.000505082,"about_ca_system_score_gemma":0.00045390835,"threshold_uncertainty_score":0.99964064},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003497281,0.001180059,0.97786313,0.000099281075,0.0016596653,0.00022738121,0.000002482257,0.00014289428,0.01879012],"genre_scores_gemma":[0.91898006,0.00079649984,0.07574354,0.00096470467,0.0012593489,0.000021445676,0.000004622342,0.00014338027,0.0020864212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981984,0.000010037218,0.00029478592,0.00057037926,0.00046336278,0.0004630374],"domain_scores_gemma":[0.9986414,0.00017099085,0.000055443692,0.0009647671,0.00007849874,0.00008894389],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003501444,0.00036572383,0.0002824367,0.00020888359,0.00014439544,0.00014389049,0.0017736586,0.00020869644,0.0001883148],"category_scores_gemma":[0.000031099742,0.00025389524,0.0000838013,0.00021136546,0.0006004034,0.00013850235,0.00030849501,0.00079075794,0.00015335447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001336936,0.0000038827066,0.000017714052,0.000022319855,0.000008719875,0.000028357847,0.00045199486,0.43231788,0.0001182594,0.003817194,0.000059869624,0.56315243],"study_design_scores_gemma":[0.00010129339,0.0001011261,0.00025802205,0.00047269562,0.000019197556,0.00012523116,2.7245e-7,0.77302366,0.012242453,0.19743359,0.014976934,0.0012455194],"about_ca_topic_score_codex":0.000031440573,"about_ca_topic_score_gemma":0.00007458867,"teacher_disagreement_score":0.9189451,"about_ca_system_score_codex":0.00009454966,"about_ca_system_score_gemma":0.00007465525,"threshold_uncertainty_score":0.99999136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17936002,0.000021058984,0.81926686,0.00027990987,0.00033948472,0.00031898383,6.4163294e-7,0.0004104039,0.0000026469538],"genre_scores_gemma":[0.49386954,0.000003474437,0.5049005,0.0011839754,0.000032890995,0.000004008283,0.0000016286914,0.00000390068,9.357848e-8],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971771,0.00015491813,0.00041207374,0.000856382,0.0008904686,0.0005090185],"domain_scores_gemma":[0.9985633,0.00019705508,0.00015978348,0.0007187668,0.0001404463,0.00022064637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008848362,0.00022890346,0.00021393034,0.0005985921,0.00032178833,0.00054057926,0.0015993284,0.00008719096,0.0000074456325],"category_scores_gemma":[0.00017626848,0.00020815892,0.00005129362,0.0021929503,0.00025823642,0.0025198346,0.00024763012,0.00022650717,0.0000062400486],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015187078,0.00012290837,0.0005126922,0.000005508145,9.146464e-7,0.00000772641,0.0010219848,0.016667424,0.17827198,0.00001630427,0.000002801458,0.8033682],"study_design_scores_gemma":[0.0003039722,0.0001710807,0.010855609,0.0000799372,0.000001900747,0.000014655365,0.0000012780849,0.75364846,0.23092568,0.0038067633,2.6125772e-7,0.00019040187],"about_ca_topic_score_codex":0.00008630644,"about_ca_topic_score_gemma":0.000020451282,"teacher_disagreement_score":0.80317783,"about_ca_system_score_codex":0.00020928778,"about_ca_system_score_gemma":0.00015702967,"threshold_uncertainty_score":0.84884745},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010033159,0.00054810435,0.99073607,0.0007124348,0.0020540815,0.0008112399,0.000015162178,0.0007710868,0.0043417998],"genre_scores_gemma":[0.017750986,0.00006537856,0.9796535,0.0016451969,0.0005027098,0.0000361756,0.000010027657,0.00005641387,0.00027963036],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948895,0.00010065843,0.00083182217,0.002073713,0.0013647435,0.00073958316],"domain_scores_gemma":[0.9955576,0.00080961746,0.00046118168,0.0025807996,0.00037682534,0.00021398652],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001344351,0.00071273075,0.00074240123,0.0009684613,0.00027169788,0.00090862554,0.005879817,0.00062086456,0.000037543832],"category_scores_gemma":[0.00015288434,0.0006892706,0.00020493181,0.0008691087,0.0004975143,0.0013140434,0.0013948937,0.0009713162,0.00008981034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011933027,0.000067559435,0.0000239139,0.000053128955,0.000053971813,0.00033392585,0.0019963041,0.08065003,0.0016647984,0.18077001,0.00031367966,0.73406076],"study_design_scores_gemma":[0.00017454781,0.00020672276,0.00008296995,0.0007379043,0.000009170839,0.00003065651,8.67568e-8,0.08794532,0.0077623064,0.9017593,0.0005054055,0.00078555685],"about_ca_topic_score_codex":0.00035575705,"about_ca_topic_score_gemma":0.00007974784,"teacher_disagreement_score":0.7332752,"about_ca_system_score_codex":0.0011433493,"about_ca_system_score_gemma":0.0021718664,"threshold_uncertainty_score":0.9995558},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005860974,0.0002614765,0.99106985,0.0015749893,0.0012389984,0.00065945426,0.0000050856547,0.00041061765,0.004193442],"genre_scores_gemma":[0.23846383,0.000016587812,0.7580307,0.0016766983,0.0012987821,0.000016506629,0.000006688224,0.0000955632,0.00039465324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945751,0.00005903616,0.00062538235,0.0023032017,0.0013512091,0.0010860852],"domain_scores_gemma":[0.99662113,0.0006757811,0.0005584961,0.0015405868,0.0003373914,0.0002665858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008119574,0.0008895217,0.0007759804,0.00096270494,0.0004551697,0.0008953162,0.0038662592,0.00028503212,0.000016985932],"category_scores_gemma":[0.000075650925,0.00069747405,0.0001648955,0.00080328964,0.00085888384,0.0007394579,0.0017288614,0.0018990729,0.000046446512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001927073,0.000051173232,0.00003232197,0.000045252476,0.000027698758,0.00020252039,0.001902843,0.16150577,0.000051403997,0.011855327,0.000011680911,0.82429475],"study_design_scores_gemma":[0.00042650083,0.00051668606,0.00007041184,0.0011306677,0.000010370406,0.00033463654,6.720541e-7,0.96585023,0.0005612382,0.027076408,0.0030113456,0.0010108004],"about_ca_topic_score_codex":0.000025367408,"about_ca_topic_score_gemma":0.00007478565,"teacher_disagreement_score":0.8232839,"about_ca_system_score_codex":0.00042457163,"about_ca_system_score_gemma":0.00086951366,"threshold_uncertainty_score":0.99954766},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011834078,0.00023505272,0.99604917,0.0006293357,0.00024996026,0.0006334459,0.000011896997,0.001673988,0.00039882847],"genre_scores_gemma":[0.45195484,0.0000056667122,0.54714084,0.0007233339,0.00009205829,0.000029826635,0.0000032255482,0.00002063251,0.000029598097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758464,0.000014881827,0.000306478,0.0010287099,0.00052617845,0.00053909817],"domain_scores_gemma":[0.9979024,0.0007053176,0.00020266767,0.00077916065,0.00026699394,0.00014348184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061989407,0.0003983715,0.00038568585,0.0003877619,0.00040577096,0.00043034228,0.0012654752,0.00020696888,0.0000012230101],"category_scores_gemma":[0.00007511592,0.00030973,0.000065224,0.00028392018,0.00047966972,0.0009563129,0.0004416137,0.00045017633,0.0000013508163],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031352356,0.000045404013,0.00022107206,0.00013073659,0.000021443851,0.000051677856,0.0010373965,0.12603861,0.00009647371,0.08729708,0.00009427871,0.78493446],"study_design_scores_gemma":[0.0004146428,0.00020793515,0.0000347744,0.00054617197,0.000007855561,0.000086719665,2.4520581e-8,0.5209059,0.00012464098,0.47731918,0.00006198025,0.0002901836],"about_ca_topic_score_codex":0.00003064285,"about_ca_topic_score_gemma":0.00002261269,"teacher_disagreement_score":0.7846443,"about_ca_system_score_codex":0.00017338138,"about_ca_system_score_gemma":0.0007164904,"threshold_uncertainty_score":0.9999355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025832254,0.0007108614,0.9849409,0.0015818272,0.00066062325,0.00032482835,0.00002425774,0.0003332583,0.011397597],"genre_scores_gemma":[0.39016205,0.00019335498,0.60552794,0.0021993904,0.000876832,0.000009796767,0.00011542766,0.00007197621,0.0008432243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933527,0.0000485766,0.0007343078,0.003333843,0.0015051258,0.0010254378],"domain_scores_gemma":[0.9951341,0.00032729772,0.00050815346,0.003418733,0.0002881493,0.00032356477],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00082026754,0.0008210186,0.00077664136,0.0006902864,0.0004511406,0.0015247959,0.01262484,0.00047872527,0.00004187184],"category_scores_gemma":[0.00012109233,0.00073070347,0.00009732123,0.00094739953,0.0005447703,0.0027448565,0.002762982,0.0016983296,0.000062604726],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005456526,0.000030167217,0.000024618063,0.00004337663,0.000011634353,0.00015931422,0.0009635458,0.08586347,0.000014843685,0.018735375,0.000021350399,0.89412683],"study_design_scores_gemma":[0.00013340997,0.00010694945,0.000027366686,0.00043721587,0.0000075933785,0.000027582471,3.5646775e-7,0.55704343,0.00009495638,0.44104573,0.0005135297,0.0005618869],"about_ca_topic_score_codex":0.00008476761,"about_ca_topic_score_gemma":0.00010811036,"teacher_disagreement_score":0.89356494,"about_ca_system_score_codex":0.0002110257,"about_ca_system_score_gemma":0.0014861677,"threshold_uncertainty_score":0.9995144},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007248433,0.00021034731,0.9957781,0.000552206,0.0014536732,0.0007896455,0.000027707909,0.00012026278,0.0003432573],"genre_scores_gemma":[0.55214864,0.0000025067168,0.44658256,0.00028580957,0.0008658731,0.000011074776,0.00003170602,0.000028216004,0.000043647287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996399,0.00006953734,0.0008412303,0.001286501,0.00080563425,0.0005981337],"domain_scores_gemma":[0.996257,0.0013100645,0.0007233672,0.0012313791,0.00035801635,0.000120180644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012301361,0.00046120948,0.0005754247,0.0008809489,0.00047021097,0.00047299537,0.003575514,0.00023905188,0.000002249981],"category_scores_gemma":[0.00006143207,0.00036601844,0.00020721956,0.0010170103,0.00070106337,0.00046705804,0.0005522306,0.0004815542,0.0000057818647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004549403,0.000043519794,0.000023676672,0.000019756566,0.000008704553,0.000002626312,0.00020144659,0.047931354,0.00027508475,0.006874492,0.00006315183,0.94455165],"study_design_scores_gemma":[0.00035623705,0.0002764213,0.002023204,0.000101111444,0.000012285317,0.000021426995,2.1881678e-7,0.95565987,0.0004910987,0.039831012,0.00082329294,0.0004038108],"about_ca_topic_score_codex":0.00010901021,"about_ca_topic_score_gemma":0.00008038379,"teacher_disagreement_score":0.9441478,"about_ca_system_score_codex":0.00023901086,"about_ca_system_score_gemma":0.0005011061,"threshold_uncertainty_score":0.9998792},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038861034,0.0012882077,0.9742691,0.0040096166,0.0019161178,0.0006857999,0.000009693307,0.0004683593,0.013467025],"genre_scores_gemma":[0.5680114,0.0002853503,0.3977824,0.03167486,0.0015449151,0.000043447635,0.000031066655,0.00013578261,0.00049080077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994192,0.00009522682,0.0008147592,0.0022498558,0.001362195,0.0012859564],"domain_scores_gemma":[0.99652827,0.00052376767,0.00044173404,0.0019703545,0.0002676643,0.0002682299],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00092139846,0.0009112916,0.0008955125,0.0015202275,0.0003302266,0.0009107796,0.005445289,0.00051436527,0.0000303039],"category_scores_gemma":[0.00003070874,0.0008568596,0.00015813974,0.0020180657,0.00027633162,0.0012034349,0.0016260651,0.0014872618,0.00004877948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003702161,0.000095620104,0.00030275655,0.00015771671,0.00002435511,0.00032354656,0.0070210393,0.06963742,0.0005265784,0.018048419,0.000013179112,0.90381235],"study_design_scores_gemma":[0.0013175297,0.0004224765,0.001962739,0.0031890632,0.000025471623,0.00021046266,0.000004804049,0.8383647,0.0027855823,0.1378359,0.011422871,0.0024583659],"about_ca_topic_score_codex":0.00031484317,"about_ca_topic_score_gemma":0.011167846,"teacher_disagreement_score":0.90135396,"about_ca_system_score_codex":0.00029470012,"about_ca_system_score_gemma":0.0011679615,"threshold_uncertainty_score":0.99993575},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000093800605,0.0002986687,0.99121267,0.0024403941,0.002453161,0.0013374412,0.00004861357,0.001505219,0.000610014],"genre_scores_gemma":[0.014987342,0.00010080364,0.9812638,0.0025170865,0.0008008434,0.000033953238,0.000081031736,0.000047834932,0.00016728666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949626,0.000028650753,0.0008815048,0.0014021809,0.0013459728,0.0013790963],"domain_scores_gemma":[0.995784,0.0007124444,0.0004971438,0.0020085005,0.000738939,0.00025901216],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010966623,0.00074040506,0.000827007,0.0008367199,0.0006107024,0.0008726779,0.005414178,0.0007115426,0.000007888938],"category_scores_gemma":[0.0004731067,0.0007130607,0.0001918701,0.0024827705,0.00044556553,0.0016428417,0.0025603415,0.0009073585,0.00009967851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014240075,0.00009330539,0.00015871497,0.00016634152,0.000106084895,0.00011184742,0.0018298908,0.31940937,0.00008687385,0.025386998,0.039890654,0.6126175],"study_design_scores_gemma":[0.001141683,0.0006228868,0.0002680187,0.00046309995,0.000024145325,0.00022046678,2.826338e-7,0.7507533,0.001620903,0.087765574,0.1553947,0.0017249659],"about_ca_topic_score_codex":0.000009624389,"about_ca_topic_score_gemma":0.000020862732,"teacher_disagreement_score":0.61089253,"about_ca_system_score_codex":0.00080810237,"about_ca_system_score_gemma":0.0008920828,"threshold_uncertainty_score":0.999967},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019086008,0.0006257169,0.9975492,0.00043240844,0.00031457676,0.0004726218,0.0000010518479,0.00012020835,0.0002934094],"genre_scores_gemma":[0.35822615,0.000023340697,0.640553,0.00074045267,0.00020384132,0.0000044437356,0.0000013393906,0.000018369567,0.0002290494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976363,0.000085860396,0.0002546703,0.0011831528,0.00037857858,0.00046139603],"domain_scores_gemma":[0.9977972,0.001365691,0.00020277139,0.00036033103,0.00011942601,0.00015456903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007837507,0.00040866918,0.0004410683,0.00035945815,0.00046085173,0.0005703298,0.00066962617,0.0001936909,0.0000023228192],"category_scores_gemma":[0.00019442101,0.00037178388,0.00005210551,0.00014910066,0.000439706,0.00036898282,0.00037267388,0.0008319057,0.0000019027435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013673133,0.000008817177,0.000010669755,0.000010483592,0.0000071439467,0.00001806369,0.0011190866,0.024394067,0.00042275432,0.0018206179,0.0000019636002,0.9721727],"study_design_scores_gemma":[0.0005787879,0.00066011207,0.00008850755,0.00016603697,0.0000066711013,0.00007697081,5.243035e-7,0.96983445,0.0018790792,0.025702091,0.00056325196,0.00044349412],"about_ca_topic_score_codex":0.000016089396,"about_ca_topic_score_gemma":0.0000028988072,"teacher_disagreement_score":0.97172916,"about_ca_system_score_codex":0.00008348827,"about_ca_system_score_gemma":0.00017758699,"threshold_uncertainty_score":0.9998734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024098906,0.0003735317,0.99619776,0.00033538864,0.0014652939,0.0005244349,0.0000043387445,0.00024793344,0.00061035366],"genre_scores_gemma":[0.18126497,0.00004271703,0.81687325,0.0007255647,0.00040171485,0.000047121623,0.0000037809698,0.00006092372,0.00057993614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957266,0.000037462767,0.00047884282,0.0016804709,0.0011332638,0.0009433603],"domain_scores_gemma":[0.9973935,0.000671037,0.0001117283,0.0013028119,0.00023040023,0.00029050422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010936421,0.00049771025,0.000495441,0.0016908274,0.000107926935,0.0003965127,0.0040429956,0.00031011392,0.000023817118],"category_scores_gemma":[0.00025880832,0.0004891013,0.00008424646,0.0013509499,0.00043767144,0.0006041542,0.0014818211,0.0009865529,0.00015900095],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033567915,0.000023895278,0.00010248954,0.000022581522,0.0000043805535,0.0001688725,0.0020399727,0.02576046,0.000063497864,0.0021575463,0.000021165022,0.9696318],"study_design_scores_gemma":[0.0008085719,0.00078618183,0.004922623,0.001680629,0.0000067130636,0.00020454855,8.0277175e-7,0.89539564,0.0060447236,0.08445067,0.003395981,0.0023029398],"about_ca_topic_score_codex":0.0001176847,"about_ca_topic_score_gemma":0.000110319634,"teacher_disagreement_score":0.96732885,"about_ca_system_score_codex":0.00052025,"about_ca_system_score_gemma":0.0005083324,"threshold_uncertainty_score":0.99975604},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007479087,0.0010094012,0.9831151,0.00009247947,0.00029697266,0.00020782712,0.0000030618442,0.000539391,0.014660987],"genre_scores_gemma":[0.43270913,0.000466869,0.56547254,0.00052821345,0.00047621506,0.000051017345,0.0000071013515,0.00010990882,0.00017897614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874884,0.0000019406589,0.00021283899,0.0004401893,0.0002975966,0.0002985707],"domain_scores_gemma":[0.999304,0.000036073397,0.000044049495,0.00048011658,0.00007102017,0.0000647218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010564353,0.000264415,0.00020791247,0.00045091638,0.00014063719,0.0000957009,0.00066799705,0.00016562625,0.000015324476],"category_scores_gemma":[0.000005149718,0.00025010813,0.00007624802,0.00035953778,0.00021905244,0.00005278189,0.0001289385,0.00044036043,0.000023521245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015718488,0.000030233638,0.000007705424,0.000104770304,0.000011145573,0.00004302519,0.0006530002,0.24858177,0.0033446194,0.001108836,0.00077157107,0.7453418],"study_design_scores_gemma":[0.00009543847,0.000035247405,0.000016407661,0.00035386957,0.000008364117,0.000077066405,4.8251103e-8,0.90141255,0.03362003,0.01769597,0.045942526,0.00074247795],"about_ca_topic_score_codex":0.0000028388754,"about_ca_topic_score_gemma":0.0000031806992,"teacher_disagreement_score":0.7445993,"about_ca_system_score_codex":0.000091385584,"about_ca_system_score_gemma":0.000060954644,"threshold_uncertainty_score":0.9999951},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006355897,0.00049295503,0.9815168,0.0015641254,0.0013720127,0.00021625221,0.000011460802,0.00013708818,0.014625755],"genre_scores_gemma":[0.06151944,0.00012883561,0.93449116,0.0018361957,0.00089864613,0.0000044716135,0.000016656972,0.000032769665,0.0010718132],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688107,0.000035133533,0.00043396073,0.0011992377,0.00088377704,0.0005667937],"domain_scores_gemma":[0.99808127,0.00036945177,0.00035975242,0.0008451821,0.00021836004,0.000125999],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000821839,0.00039730663,0.00045258433,0.0003797434,0.00028882173,0.0007231691,0.0016336394,0.00032754012,0.000008817396],"category_scores_gemma":[0.00010180171,0.00036082143,0.00006922193,0.00038589927,0.00054244744,0.00036119815,0.0010354094,0.00064576947,0.000021920616],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000531247,0.000072526935,0.00083748717,0.00008054746,0.000027861817,0.00014862849,0.00050495483,0.009361213,0.00003099859,0.088485666,0.0021157165,0.8983291],"study_design_scores_gemma":[0.00023227259,0.000110862275,0.0016293798,0.00012524752,0.000011314275,0.000048519087,5.6078303e-8,0.44139254,0.000058736867,0.5497062,0.006055296,0.00062953983],"about_ca_topic_score_codex":0.000065208675,"about_ca_topic_score_gemma":0.000055991557,"teacher_disagreement_score":0.89769953,"about_ca_system_score_codex":0.0004317307,"about_ca_system_score_gemma":0.00022759831,"threshold_uncertainty_score":0.99988437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011964263,0.00028371785,0.9957755,0.001323415,0.0005220751,0.000668312,0.00007855699,0.00046643542,0.00076229527],"genre_scores_gemma":[0.12822944,0.0008906479,0.868889,0.001125953,0.00025364614,0.000036686026,0.0004591471,0.000054010114,0.000061523075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99528545,0.000059229926,0.0006440048,0.0024804776,0.0009756855,0.000555154],"domain_scores_gemma":[0.99469995,0.00051219034,0.00062147394,0.0036884693,0.00032334242,0.0001545677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086210726,0.0005398377,0.00050207373,0.00078537804,0.00040695997,0.00058639306,0.004754582,0.00041669564,0.0000038925587],"category_scores_gemma":[0.00018381728,0.0005330083,0.00004832722,0.0006792275,0.00090766134,0.0024671871,0.0024167947,0.0008302116,0.000022128756],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010201729,0.000039925882,0.000044492157,0.00004948821,0.000015716561,0.00000953705,0.0005400014,0.0010001922,0.0032249826,0.026159868,0.00016367523,0.9687419],"study_design_scores_gemma":[0.00030560675,0.00008081693,0.003589903,0.0003205515,0.000011432227,0.00012251032,9.0634484e-7,0.8934623,0.00651915,0.092403494,0.0022725086,0.0009108405],"about_ca_topic_score_codex":0.0000142413655,"about_ca_topic_score_gemma":0.000027086351,"teacher_disagreement_score":0.9678311,"about_ca_system_score_codex":0.0004732983,"about_ca_system_score_gemma":0.00055808335,"threshold_uncertainty_score":0.99971217},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016537888,0.0007707072,0.99596184,0.0008070217,0.00036337282,0.00065755297,0.000013428192,0.00015737263,0.0012521736],"genre_scores_gemma":[0.023945663,0.000066823326,0.97393936,0.0014136235,0.00045183353,0.000032402306,0.000009207241,0.000026658738,0.00011445088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967017,0.000020543812,0.0004865536,0.0015293745,0.00068547874,0.000576355],"domain_scores_gemma":[0.997711,0.00026004575,0.00019798508,0.0013320608,0.0001663915,0.00033249834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004979926,0.0004291652,0.00047350558,0.00055395043,0.00043493463,0.00077764364,0.002108495,0.00018345391,0.0000064563574],"category_scores_gemma":[0.000021374257,0.00039731717,0.00006312971,0.00044667505,0.00041419064,0.0004936881,0.002551191,0.0005509685,0.000028871294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025754953,0.000024798645,0.000025853822,0.000023461544,0.0000057425495,0.000012337532,0.00018202828,0.023908237,0.000053185537,0.033301234,0.000056362445,0.9424042],"study_design_scores_gemma":[0.00026447125,0.00010975049,0.00012152081,0.0005750946,0.000011068698,0.000104471845,4.603364e-7,0.93003595,0.00039118147,0.026718022,0.040877458,0.0007905598],"about_ca_topic_score_codex":0.000018121751,"about_ca_topic_score_gemma":0.00004131056,"teacher_disagreement_score":0.9416136,"about_ca_system_score_codex":0.00019843328,"about_ca_system_score_gemma":0.0002776079,"threshold_uncertainty_score":0.9998479},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012783745,0.000046684,0.9972293,0.00045788824,0.00076584955,0.00025462708,0.0000061085457,0.00015407949,0.00095763494],"genre_scores_gemma":[0.33542946,0.000015289117,0.66207194,0.002084594,0.00018804842,0.000008134829,0.0000353733,0.000024279463,0.00014286255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654794,0.000056984434,0.00054728,0.0015071539,0.0008493445,0.00049131725],"domain_scores_gemma":[0.9976203,0.0003542287,0.00027860492,0.0013338476,0.00021656533,0.00019646213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008915026,0.00043755662,0.0005898063,0.0025517584,0.00015829965,0.0004984572,0.0019983856,0.00030272678,0.000107572116],"category_scores_gemma":[0.00006959821,0.00042317354,0.00016467198,0.0017446707,0.0004927776,0.0004815287,0.0003607771,0.0005633354,0.000020758955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029170262,0.000015379848,0.0020074663,0.000008367873,0.000011033522,0.00003247781,0.00020161702,0.4908485,0.000009070126,0.0077062696,0.000002970377,0.4991539],"study_design_scores_gemma":[0.00026581725,0.000095871954,0.00476263,0.000082935374,0.00002220946,0.000011012273,1.7684214e-7,0.9816076,0.00007070604,0.012346528,0.00025730015,0.0004772181],"about_ca_topic_score_codex":0.0000916561,"about_ca_topic_score_gemma":0.0017095995,"teacher_disagreement_score":0.4986767,"about_ca_system_score_codex":0.0003176088,"about_ca_system_score_gemma":0.00045026132,"threshold_uncertainty_score":0.999822},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012837218,0.00064855453,0.99634826,0.00032759339,0.00036661187,0.00032608546,0.0000038969365,0.000043963482,0.0018066784],"genre_scores_gemma":[0.13523386,0.000250123,0.86289746,0.0011467936,0.00025951516,0.0000071773284,0.000013468923,0.000021400103,0.0001701984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750376,0.00002393132,0.00041101553,0.00094219024,0.00080273283,0.0003163645],"domain_scores_gemma":[0.9983041,0.00019175893,0.00030163096,0.0009762429,0.00012433396,0.000101891615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000574022,0.0003234472,0.0003928725,0.0005055829,0.00014568349,0.00021965883,0.0014697952,0.00015866634,0.0000057429957],"category_scores_gemma":[0.000032437594,0.00026389913,0.000056036562,0.00030568885,0.0002507439,0.0004794853,0.00088197616,0.00035073064,0.0000063976254],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032841135,0.000021560292,0.000012662325,0.000046275254,0.0000029311066,0.000012356875,0.00022143964,0.0039636944,0.00004572813,0.022678923,0.000009430919,0.9729817],"study_design_scores_gemma":[0.00030584043,0.00046930322,0.000823594,0.0016078193,0.0000064026062,0.000031468957,1.06171456e-7,0.7949361,0.0012088092,0.19862165,0.0015375676,0.00045132235],"about_ca_topic_score_codex":0.000012305146,"about_ca_topic_score_gemma":0.000021122973,"teacher_disagreement_score":0.97253036,"about_ca_system_score_codex":0.00009833648,"about_ca_system_score_gemma":0.00014709184,"threshold_uncertainty_score":0.99998134},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016881032,0.00026234004,0.9939816,0.00020106524,0.0010606322,0.0006604362,0.0000043966343,0.00017376512,0.001967679],"genre_scores_gemma":[0.78924793,0.000041470616,0.2098833,0.00048588272,0.00025382906,0.0000069043244,0.0000023675832,0.00003736853,0.000040956053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536204,0.00006601225,0.0006356089,0.0018782371,0.0011809669,0.00087715575],"domain_scores_gemma":[0.99565053,0.0008647159,0.0006314554,0.0020856499,0.00052220706,0.0002454486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095862953,0.00070144865,0.0010303006,0.00044485048,0.0002245019,0.0002695128,0.0028635925,0.0004723889,0.000017111804],"category_scores_gemma":[0.000038006365,0.00059268007,0.00014897167,0.0008837792,0.0020354416,0.00046997648,0.0013219167,0.0012419209,0.0000075795465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032135948,0.000059617785,0.00042916756,0.000059403952,0.00003431614,0.00037843568,0.00030540072,0.67958283,0.00007365886,0.10233964,0.0000057059974,0.21669967],"study_design_scores_gemma":[0.0007387721,0.0004929628,0.00038416393,0.0013247861,0.000022433158,0.00032106834,2.2828642e-7,0.9326859,0.0020885882,0.06084444,0.000062468454,0.0010341859],"about_ca_topic_score_codex":0.00008330223,"about_ca_topic_score_gemma":0.00040913452,"teacher_disagreement_score":0.7875598,"about_ca_system_score_codex":0.00046384393,"about_ca_system_score_gemma":0.001200459,"threshold_uncertainty_score":0.99965245},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007620941,0.0007856752,0.9906737,0.0026973095,0.0023263777,0.00094604766,0.00001805654,0.00030747574,0.0021691057],"genre_scores_gemma":[0.030359996,0.00004765095,0.9556779,0.012498238,0.0011567742,0.000054284475,0.00002130344,0.00006452972,0.00011928583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99510807,0.00003463637,0.00060147763,0.0022654599,0.0010088977,0.0009814356],"domain_scores_gemma":[0.996317,0.0007408974,0.0004144357,0.0019189252,0.00035731294,0.00025137464],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005892941,0.00081940065,0.0007166834,0.0009599874,0.0005283093,0.00090082915,0.0057629803,0.0005430747,0.000025314946],"category_scores_gemma":[0.000017926412,0.00072075863,0.00025254555,0.0009036065,0.00034875955,0.00071052904,0.0016230069,0.0009981451,0.000046746416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019744137,0.00004583435,0.00001608306,0.0003557812,0.000048347567,0.00007344386,0.0060190167,0.045948382,0.000096175645,0.6678655,0.0000037622626,0.27950794],"study_design_scores_gemma":[0.00038322195,0.00023071056,0.000036742636,0.00096952723,0.0000183722,0.000027528158,0.0000011081484,0.10890859,0.0020023838,0.884341,0.0022786136,0.0008022167],"about_ca_topic_score_codex":0.00007649306,"about_ca_topic_score_gemma":0.00050095853,"teacher_disagreement_score":0.27870572,"about_ca_system_score_codex":0.0002862129,"about_ca_system_score_gemma":0.00055594096,"threshold_uncertainty_score":0.9996163},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034298635,0.000047537542,0.9923826,0.0004938528,0.0013164951,0.00051608036,4.3980066e-7,0.00023590017,0.0049728104],"genre_scores_gemma":[0.3473456,0.000011772472,0.650213,0.0013711911,0.00021672419,0.000014728171,0.000010496958,0.000058603127,0.0007578643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99448234,0.000046772795,0.0009898845,0.0017751429,0.0015228656,0.001183013],"domain_scores_gemma":[0.9967131,0.0005229942,0.0005077651,0.0017808495,0.00022836245,0.0002469418],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015962399,0.00076419435,0.0006829386,0.0017028496,0.00037199218,0.0008467562,0.0039786873,0.00061715726,0.00004512102],"category_scores_gemma":[0.00020551318,0.00076775573,0.00017790808,0.0007412648,0.00057637854,0.0007211351,0.0013756398,0.003283526,0.000052896346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004929658,0.00000959629,0.00015789234,0.000035889174,0.0000045313527,0.00003427021,0.00049203873,0.938483,0.00019075563,0.0043004416,0.0000014030261,0.056285277],"study_design_scores_gemma":[0.0004266744,0.0001690756,0.000041959924,0.00047422774,0.0000056995946,0.000012080403,1.3621082e-7,0.98244566,0.0006365157,0.014246306,0.00072947965,0.0008121651],"about_ca_topic_score_codex":0.00002459677,"about_ca_topic_score_gemma":0.00007887761,"teacher_disagreement_score":0.3473113,"about_ca_system_score_codex":0.00056319265,"about_ca_system_score_gemma":0.0010054327,"threshold_uncertainty_score":0.9994773},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00278675,0.00025004492,0.99342096,0.0006478655,0.00042305895,0.0007235294,0.000015236043,0.00024223687,0.0014902964],"genre_scores_gemma":[0.45240578,0.000046051962,0.54272145,0.0024866178,0.00043176513,0.000019197218,0.000015896116,0.000068030145,0.0018052129],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965772,0.000343903,0.0005513056,0.0009080474,0.0006363704,0.0009831546],"domain_scores_gemma":[0.99415296,0.0021046475,0.00033038124,0.0023017519,0.00086755847,0.00024272357],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0034894445,0.0006475304,0.0007262476,0.00072326936,0.002584318,0.0009233757,0.0034287046,0.00043436463,0.0000032127236],"category_scores_gemma":[0.00041644112,0.00063528627,0.00014603535,0.00045504112,0.00090809556,0.00076589227,0.0030936224,0.0032765493,0.0000034939126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033010932,0.0002654676,0.0000139370495,0.00029386816,0.000043133583,0.00007730963,0.008867932,0.008677971,0.00020139004,0.3834467,0.00008260426,0.59799665],"study_design_scores_gemma":[0.00072764244,0.0010359696,0.00006914339,0.0006587032,0.000028186469,0.00017306932,0.000044278248,0.410472,0.0016395282,0.58113194,0.0029053288,0.0011142069],"about_ca_topic_score_codex":0.0005653141,"about_ca_topic_score_gemma":0.0008858828,"teacher_disagreement_score":0.59688246,"about_ca_system_score_codex":0.00046941868,"about_ca_system_score_gemma":0.0005293917,"threshold_uncertainty_score":0.9996098},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003093311,0.0009668669,0.99287564,0.000026033931,0.0043463325,0.0007475789,0.0000357816,0.00041077734,0.00028168826],"genre_scores_gemma":[0.30689976,0.000020517935,0.69094306,0.00002842006,0.001953272,0.000021917767,0.00002910834,0.00008501445,0.00001894448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818534,0.000009726237,0.00051380624,0.0004057226,0.0004246753,0.00046072612],"domain_scores_gemma":[0.9984941,0.00040377982,0.00017267255,0.0005720932,0.0002518307,0.00010550923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037255438,0.00035666535,0.00044756016,0.0004899965,0.00007425464,0.00006679179,0.0006581681,0.00039876,0.0000036483427],"category_scores_gemma":[0.00007748818,0.00033912924,0.00008104603,0.00022082799,0.00023857824,0.00013299985,0.00008904121,0.00038381497,0.0000027046774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010840091,0.00001027239,0.000039104078,0.0010921877,0.000009341289,0.0000026754012,0.000117870324,0.31517193,0.001291272,0.00059345114,0.000015423553,0.68164563],"study_design_scores_gemma":[0.00016072359,0.00014089078,0.000055729466,0.0007950016,0.000012108435,0.000007421864,5.680964e-8,0.9850064,0.010903921,0.0011772201,0.0013698046,0.00037071249],"about_ca_topic_score_codex":0.00002425876,"about_ca_topic_score_gemma":0.0000068300415,"teacher_disagreement_score":0.6812749,"about_ca_system_score_codex":0.00038369492,"about_ca_system_score_gemma":0.0001255136,"threshold_uncertainty_score":0.99990606},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013994961,0.00015651008,0.9908804,0.0004792646,0.0029214504,0.00025592544,0.000019806947,0.00028720204,0.0035999417],"genre_scores_gemma":[0.46293736,0.000033230725,0.5284149,0.003705432,0.003865565,0.000015328678,0.0000785882,0.00008225122,0.000867352],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647224,0.000030340168,0.0005256302,0.0015268662,0.00085586915,0.0005890777],"domain_scores_gemma":[0.9976567,0.00030456035,0.00033296307,0.0012352803,0.00028025566,0.00019022996],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00050956366,0.00050533103,0.00047444564,0.00072646636,0.00058304885,0.0010887994,0.0027287193,0.0005012688,0.00026397826],"category_scores_gemma":[0.000055283548,0.00048594843,0.0001559914,0.00034747247,0.00050436426,0.0010394334,0.00082573254,0.0015149306,0.00022329966],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022964894,0.00005518054,0.00006638848,0.000020269645,0.00001855748,0.00014178707,0.00069906644,0.0007027655,0.0073313834,0.007103037,0.00004388621,0.9838154],"study_design_scores_gemma":[0.00077145983,0.0002939705,0.0017187194,0.0010352554,0.000034685992,0.000114391485,2.7952376e-7,0.08289925,0.04466062,0.8542242,0.012094245,0.0021529424],"about_ca_topic_score_codex":0.000059423754,"about_ca_topic_score_gemma":0.0002510568,"teacher_disagreement_score":0.98166245,"about_ca_system_score_codex":0.00015490733,"about_ca_system_score_gemma":0.0002448839,"threshold_uncertainty_score":0.99994814},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048470862,0.0009335808,0.9489008,0.0011658769,0.000086176995,0.00026251702,4.942457e-7,0.000086869084,0.00009279935],"genre_scores_gemma":[0.54118097,0.0000065923086,0.45791245,0.00084313133,0.000043900945,0.0000065630284,4.211875e-7,0.000005504716,5.0292493e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868745,0.0000058719193,0.0002194945,0.0004146265,0.00023080071,0.00044174577],"domain_scores_gemma":[0.9993494,0.000110672154,0.000034411667,0.00035592317,0.000053725522,0.00009587151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004748582,0.0001124011,0.00014351084,0.0002900405,0.00006480328,0.000024965795,0.00024997792,0.000038130664,0.0000072189046],"category_scores_gemma":[0.00007916224,0.000100426514,0.000022768643,0.0015102809,0.00025691753,0.00011230413,0.0001126043,0.00025190285,0.0000055902815],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000082429215,0.000042723095,0.041195218,0.0000051593315,6.322851e-8,0.00005919656,0.00013828899,0.001268076,0.0022628414,0.00009753532,0.0000044447656,0.9549182],"study_design_scores_gemma":[0.0009877699,0.00021244441,0.361995,0.00043384932,0.0000051532643,0.00022911624,0.0000033592655,0.49009827,0.049787138,0.094122,0.0017370882,0.00038879973],"about_ca_topic_score_codex":0.00003665945,"about_ca_topic_score_gemma":0.000060281018,"teacher_disagreement_score":0.9545294,"about_ca_system_score_codex":0.00013726197,"about_ca_system_score_gemma":0.00009253845,"threshold_uncertainty_score":0.40952745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008154777,0.00020678311,0.99706537,0.000109121895,0.0013161079,0.00037500277,0.000009591943,0.00047968797,0.0003568192],"genre_scores_gemma":[0.3982187,0.00010750405,0.599897,0.0004991481,0.0007164221,0.000040451698,0.00004778409,0.000112536974,0.00036046244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982397,0.000006412012,0.00034056656,0.00062811637,0.00040009638,0.00038514056],"domain_scores_gemma":[0.99914473,0.00017626214,0.00010217459,0.0003763854,0.000114996794,0.000085452964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021473801,0.00035402877,0.0003630231,0.00049050356,0.0001336107,0.00005442049,0.00042745934,0.00027216895,0.000021038926],"category_scores_gemma":[0.00007584895,0.00034363742,0.0001556172,0.00030922864,0.00025093852,0.00023622646,0.000112843525,0.00049207907,0.000013138923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009795035,0.000009571139,0.0000064576825,0.000035662073,0.00000861585,0.0000052999785,0.00006083915,0.57597834,0.0012057459,0.00039084142,0.00008831399,0.4222005],"study_design_scores_gemma":[0.0001719664,0.00010220726,0.000045490204,0.00031933544,0.000018936937,0.0000102052845,7.876504e-8,0.9325477,0.007313987,0.05681423,0.0022125174,0.00044336257],"about_ca_topic_score_codex":0.000021421545,"about_ca_topic_score_gemma":0.000052840274,"teacher_disagreement_score":0.42175713,"about_ca_system_score_codex":0.0007698384,"about_ca_system_score_gemma":0.0000638128,"threshold_uncertainty_score":0.9999016},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016639765,0.00024018214,0.99455506,0.00007712793,0.0007164141,0.0004948162,0.00010864198,0.0001062601,0.002037515],"genre_scores_gemma":[0.91020817,0.000033119246,0.08844136,0.0003511176,0.00040170024,0.000019752079,0.0000119165215,0.00008855468,0.00044434037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981106,0.000014505535,0.0003799972,0.000709774,0.000256736,0.00052839314],"domain_scores_gemma":[0.99840134,0.0009498539,0.00008835268,0.000416167,0.00005619313,0.00008810885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092072773,0.0003792436,0.00039299708,0.0004237107,0.000091904425,0.00020639935,0.00044261545,0.00017476815,0.000020867303],"category_scores_gemma":[0.00015513558,0.00035354635,0.000057126923,0.00015706063,0.00037250944,0.00012129012,0.00007764928,0.00042010003,0.0000025418199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020684295,0.0000276298,0.00011576436,0.000706317,0.00002607518,0.00010865099,0.0020452936,0.6055054,0.023963584,0.0010104151,0.00019640334,0.36608765],"study_design_scores_gemma":[0.0010451193,0.00005791886,0.000055647757,0.00096778874,0.000014246814,0.00003195542,6.1325187e-7,0.9520847,0.022813091,0.020065729,0.0022975318,0.00056561845],"about_ca_topic_score_codex":0.000011286329,"about_ca_topic_score_gemma":0.00004793941,"teacher_disagreement_score":0.9085442,"about_ca_system_score_codex":0.00014837686,"about_ca_system_score_gemma":0.00009888612,"threshold_uncertainty_score":0.99989164},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002537538,0.0004981699,0.99506295,0.00014239091,0.000389299,0.00042625482,0.000008373655,0.000088064495,0.0008469872],"genre_scores_gemma":[0.9226795,0.00003601269,0.0748931,0.00045608537,0.00015400995,0.000013626184,0.000017335891,0.00004125793,0.0017090952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555546,0.00010832572,0.00097447314,0.0014685739,0.0010569617,0.00083619676],"domain_scores_gemma":[0.9980217,0.0003322249,0.0006940761,0.00053524296,0.00027575807,0.00014095713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013192417,0.00058623403,0.0007857774,0.001024637,0.00019291962,0.00023830925,0.0017222617,0.0002453165,0.000013100698],"category_scores_gemma":[0.00010015475,0.0005728664,0.00016901753,0.00064423546,0.00024001875,0.00040248086,0.0007407881,0.0010192909,0.000007560063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007553327,0.000048917733,0.0015582052,0.000049444734,0.000019305238,0.00010021428,0.004388972,0.26013944,0.00043279192,0.0014239127,0.000010601907,0.73182064],"study_design_scores_gemma":[0.00041072065,0.0003755705,0.00011424128,0.0016371917,0.000008902254,0.000025220475,0.000005292819,0.99215204,0.0010974939,0.0026310368,0.00088876183,0.0006535534],"about_ca_topic_score_codex":0.00023913887,"about_ca_topic_score_gemma":0.00015754624,"teacher_disagreement_score":0.92016983,"about_ca_system_score_codex":0.00036837926,"about_ca_system_score_gemma":0.0004029249,"threshold_uncertainty_score":0.9996723},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83438843,0.00035587823,0.16462876,0.000026208712,0.00020775221,0.00028170034,0.000019572026,0.000021421456,0.00007025844],"genre_scores_gemma":[0.9987421,0.00007652673,0.00097075885,0.000014810191,0.00005719662,0.0000021864516,0.000118444,0.000016649243,0.000001303719],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882466,0.00002748674,0.000386902,0.0003320886,0.0003180032,0.00011087804],"domain_scores_gemma":[0.9991324,0.0001822555,0.00026970424,0.00027951418,0.00010877806,0.000027324024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002552939,0.00018976754,0.00026717683,0.00020397901,0.000016454993,0.000011536172,0.00014616112,0.00022964133,0.0000013891827],"category_scores_gemma":[0.000048566817,0.00016962863,0.000043120363,0.00022934016,0.00016420067,0.00029601247,0.00004013828,0.0002900419,2.8583585e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055692766,0.000018433975,0.000079745114,0.00009183138,0.000009967036,7.902485e-7,0.00026241847,0.15107669,0.8412666,0.00007152244,5.3105316e-7,0.007065786],"study_design_scores_gemma":[0.0003862734,0.000060298502,0.0011742823,0.00064688304,0.0000325765,0.0000045476822,9.855622e-7,0.61914843,0.37003884,0.00832043,0.000018389082,0.00016805575],"about_ca_topic_score_codex":0.0002648276,"about_ca_topic_score_gemma":0.00007075135,"teacher_disagreement_score":0.47122777,"about_ca_system_score_codex":0.00022818301,"about_ca_system_score_gemma":0.00006862735,"threshold_uncertainty_score":0.6917255},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022338434,0.00006905731,0.9919831,0.00028231443,0.0030096525,0.0004901416,0.0000061122446,0.00022701795,0.0037091803],"genre_scores_gemma":[0.10981362,0.000015183442,0.8865111,0.002191371,0.0012148839,0.000010172023,0.000018709201,0.00003141223,0.00019356489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641275,0.000045517074,0.00043612896,0.0016604009,0.00091636006,0.0005288299],"domain_scores_gemma":[0.99752903,0.00016593636,0.00022125985,0.0014777264,0.00030003264,0.00030603423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070339197,0.00045161872,0.00039939588,0.00084575894,0.00036374782,0.00046102,0.002934054,0.0005409988,0.000019845296],"category_scores_gemma":[0.000046444897,0.0004259932,0.00009505643,0.0008206669,0.0003555363,0.0009840771,0.00081126514,0.0015306815,0.000059598744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013751691,0.000102450795,0.000008209278,0.0000072658813,0.000003945944,0.000009908255,0.001120093,0.113279894,0.00035240594,0.024416756,0.0000186406,0.8606667],"study_design_scores_gemma":[0.0001332619,0.00042919294,0.00017066942,0.00010204726,0.0000045215943,0.000058768328,1.9883981e-7,0.93335867,0.00060438697,0.060995277,0.0036028682,0.0005401449],"about_ca_topic_score_codex":0.000038748844,"about_ca_topic_score_gemma":0.00023427224,"teacher_disagreement_score":0.86012655,"about_ca_system_score_codex":0.00019169057,"about_ca_system_score_gemma":0.0002885868,"threshold_uncertainty_score":0.99981916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015759029,0.00023222792,0.99512017,0.00023181533,0.0007528903,0.00023884162,0.000043370568,0.000072837625,0.001731975],"genre_scores_gemma":[0.033700544,0.00000836507,0.9655724,0.00039127743,0.00014441751,0.0000062196555,0.000012425164,0.000025501093,0.00013881919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703676,0.000030145178,0.000585861,0.0010541838,0.0008149831,0.00047805294],"domain_scores_gemma":[0.99746335,0.00043646555,0.00053685304,0.0011744169,0.00027101513,0.00011792617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009422233,0.00034442943,0.00050478993,0.000737371,0.00027974733,0.0002387253,0.0021244301,0.00021138796,0.000009480644],"category_scores_gemma":[0.00014469324,0.00033989997,0.000110811976,0.0010552992,0.00038955818,0.00017354693,0.00076034176,0.00038839944,0.000008064231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013552875,0.00014065497,0.00025689727,0.000041141626,0.000040597428,0.000026472891,0.002139923,0.2818695,0.00070623506,0.020347252,0.00007321577,0.69435674],"study_design_scores_gemma":[0.00014761915,0.000055544868,0.00019212152,0.00023605012,0.000014884812,0.00002775256,3.2257543e-7,0.9902566,0.0012193939,0.006854836,0.00058231014,0.00041254776],"about_ca_topic_score_codex":0.000030475228,"about_ca_topic_score_gemma":0.000017803077,"teacher_disagreement_score":0.70838714,"about_ca_system_score_codex":0.00030416317,"about_ca_system_score_gemma":0.00049316866,"threshold_uncertainty_score":0.9999053},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05696627,0.000023779667,0.94208753,0.00022821681,0.00045820605,0.00015356258,0.0000048240945,0.000074171774,0.0000034137413],"genre_scores_gemma":[0.6082106,0.0000021372891,0.39158395,0.00012930231,0.0000627172,0.000002079608,0.000004852731,0.000004246134,7.485927e-8],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978057,0.000085340296,0.000309264,0.0008538997,0.0006626229,0.000283141],"domain_scores_gemma":[0.9971171,0.001284143,0.00015848594,0.0011187745,0.00024091727,0.00008055765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058177114,0.0001539722,0.00019626024,0.00024465346,0.0001979559,0.00011262532,0.0014603781,0.000057972986,0.0000022751915],"category_scores_gemma":[0.00041470787,0.0001447464,0.0000173061,0.0017506405,0.00054076046,0.0012385007,0.0006347696,0.00016736577,0.0000029386492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071528366,0.000043939934,0.0007449205,0.000016388145,0.0000020558743,0.000004885026,0.00033402833,0.70117337,0.0017325465,0.00020868746,0.0000010534843,0.29573098],"study_design_scores_gemma":[0.0002612899,0.00013917995,0.008464587,0.000025848653,0.0000029622374,0.00001060884,1.2983129e-7,0.96705705,0.012982329,0.010895018,0.0000074865093,0.00015352193],"about_ca_topic_score_codex":0.00007755128,"about_ca_topic_score_gemma":0.000011582689,"teacher_disagreement_score":0.5512444,"about_ca_system_score_codex":0.000101786034,"about_ca_system_score_gemma":0.0002676614,"threshold_uncertainty_score":0.5902587},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000084472895,0.0002171638,0.99329084,0.000012103336,0.0021392796,0.0009551716,0.00007930283,0.0016228025,0.0016748982],"genre_scores_gemma":[0.778207,0.0007315825,0.21638615,0.00023784443,0.0016949684,0.00039987345,0.00041684927,0.00025223684,0.001673452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871576,0.0000038325115,0.00036723656,0.00043787816,0.000221299,0.00025401133],"domain_scores_gemma":[0.99947494,0.000040684314,0.00006960827,0.00027141406,0.0000773948,0.000065962726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026725492,0.0002734628,0.0002536226,0.00041330364,0.000059477148,0.00007273786,0.0003599098,0.00023701746,0.000009675283],"category_scores_gemma":[0.0000045730067,0.00027166746,0.000081247425,0.000105488725,0.00010852663,0.00016378968,0.000016832346,0.00024505786,0.0000071524555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011345163,0.000019523779,0.0000021301973,0.0002869563,0.000045468212,0.000004407432,0.00071803347,0.11100505,0.0008134861,0.0028354558,0.00060888485,0.88364923],"study_design_scores_gemma":[0.00013177833,0.00013145636,0.00003722227,0.00020033983,0.000024896566,0.000003323012,2.8262326e-7,0.991938,0.0018278698,0.0021712335,0.0032773323,0.0002562769],"about_ca_topic_score_codex":0.000010937262,"about_ca_topic_score_gemma":0.0000144378255,"teacher_disagreement_score":0.883393,"about_ca_system_score_codex":0.00016957971,"about_ca_system_score_gemma":0.000032957003,"threshold_uncertainty_score":0.99997354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047861086,0.00020860726,0.98919284,0.0006852971,0.0010984595,0.00029845917,0.0000059155273,0.00013621729,0.007895565],"genre_scores_gemma":[0.49177468,0.000037417794,0.50722855,0.00070632267,0.00020530015,0.0000018983905,0.0000069186217,0.000022975453,0.000015905125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621594,0.000040629242,0.0006787826,0.001410651,0.0011009119,0.000553063],"domain_scores_gemma":[0.9972984,0.00043607125,0.00053771475,0.0013877607,0.00022220003,0.00011785259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086210435,0.00048809827,0.0006033264,0.00084980665,0.00027257635,0.0003097797,0.0028693741,0.00031358708,0.000009311958],"category_scores_gemma":[0.00005712258,0.00042945732,0.00017720967,0.0005613809,0.0006727413,0.0003239129,0.00074351294,0.0006914252,0.000036922404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054418724,0.000043715405,0.000064528,0.000048959904,0.000007782797,0.000043099328,0.0006202097,0.04633128,0.00015056676,0.17291912,0.0000081285525,0.77975714],"study_design_scores_gemma":[0.00034795006,0.00030370732,0.0008654592,0.00084160734,0.000009619121,0.00003091818,3.648943e-7,0.73485446,0.0016007577,0.260287,0.00023509406,0.00062310655],"about_ca_topic_score_codex":0.000029917768,"about_ca_topic_score_gemma":0.000009854555,"teacher_disagreement_score":0.77913404,"about_ca_system_score_codex":0.00030461786,"about_ca_system_score_gemma":0.00041797917,"threshold_uncertainty_score":0.9998157},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005766123,0.00012926805,0.98587114,0.00031817157,0.0007775887,0.00054299686,4.169292e-7,0.00034104256,0.011961722],"genre_scores_gemma":[0.38506132,0.0001074161,0.60779387,0.0017528741,0.00032593694,0.000013671009,0.000014587543,0.000112114125,0.00481819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939482,0.000025809344,0.0008582748,0.0017651628,0.0021741556,0.0012283571],"domain_scores_gemma":[0.9965327,0.00032219614,0.00074993115,0.0017255169,0.00038420572,0.00028544798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013401614,0.00079653965,0.00064138544,0.0009480439,0.00040712,0.00078858493,0.0036373322,0.00027491577,0.00006062409],"category_scores_gemma":[0.0000909408,0.00068681303,0.00011929984,0.0009145606,0.0007949428,0.00091556716,0.0014388798,0.0018702453,0.00009383797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010045333,0.0000066507173,0.00032597355,0.000040815157,0.000017587749,0.00022289492,0.00075287063,0.92624664,0.000018041266,0.0138167525,0.0000034559903,0.058538288],"study_design_scores_gemma":[0.0007391184,0.0009466191,0.00018650081,0.0009189286,0.000012852641,0.00010609002,4.0768919e-7,0.9636414,0.0008875637,0.029268,0.0019521518,0.0013403333],"about_ca_topic_score_codex":0.0000339424,"about_ca_topic_score_gemma":0.000052381798,"teacher_disagreement_score":0.38500366,"about_ca_system_score_codex":0.001017343,"about_ca_system_score_gemma":0.0012791196,"threshold_uncertainty_score":0.9995583},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021387838,0.0034513522,0.9734299,0.000015271848,0.0006635118,0.0002461718,0.000015573713,0.000095781776,0.00069456414],"genre_scores_gemma":[0.9881449,0.000056404686,0.011598057,0.00002097671,0.00008757869,0.0000017933926,0.000008300608,0.000046441004,0.000035579815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984056,0.000004294938,0.00041234068,0.0003721505,0.00051486574,0.0002907698],"domain_scores_gemma":[0.9993178,0.000027779684,0.00007491046,0.00030619142,0.00021591537,0.000057380148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000213106,0.00034217292,0.00047171398,0.00039074206,0.000058339552,0.000015785672,0.00036376502,0.00020665707,0.000004267425],"category_scores_gemma":[0.000008444837,0.00030548265,0.00009401133,0.00022149853,0.00035645725,0.00014974174,0.000044172844,0.00024985222,0.0000012842829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006072653,0.0000059520826,0.00003911048,0.00016810927,0.000022337705,0.000023343444,0.00059361913,0.9764453,0.0049016336,0.00015372882,1.969116e-7,0.017640587],"study_design_scores_gemma":[0.0001458016,0.00004796135,0.000013093818,0.0006401704,0.000036530175,0.0000044689955,4.808213e-7,0.9594781,0.033649225,0.0055229794,0.00006989057,0.00039133205],"about_ca_topic_score_codex":0.00002213738,"about_ca_topic_score_gemma":0.000074404896,"teacher_disagreement_score":0.96675706,"about_ca_system_score_codex":0.00026286472,"about_ca_system_score_gemma":0.00017907715,"threshold_uncertainty_score":0.99993974},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020918478,0.0016984039,0.9964896,0.00015410356,0.0002975426,0.0007214142,0.00015274873,0.0001395199,0.0003446025],"genre_scores_gemma":[0.00300278,0.000040602856,0.9956915,0.0008077164,0.00016401181,0.000031673837,0.00015036849,0.000039634877,0.00007172724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961946,0.00005844508,0.00046957546,0.0017813991,0.0008232656,0.0006727154],"domain_scores_gemma":[0.9948205,0.00026380166,0.00046020723,0.0037330813,0.0005613628,0.00016105614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001543899,0.00049823144,0.0005203749,0.00024868277,0.00065257517,0.00040979488,0.004062607,0.00019225513,0.0000026622192],"category_scores_gemma":[0.00004740255,0.00040847022,0.00004219628,0.00040223257,0.00037435177,0.0031430623,0.0012856623,0.0005316603,0.0000039893052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015526239,0.000048580565,0.000009270024,0.00005504703,0.000014118489,0.00003137673,0.0008774805,0.011272908,0.00001527972,0.03752738,0.000045669138,0.95008737],"study_design_scores_gemma":[0.00045242778,0.000283963,0.00000598969,0.00066208973,0.000010260785,0.000103434475,0.000002182327,0.97084427,0.00007739945,0.011143562,0.015800415,0.00061397895],"about_ca_topic_score_codex":0.000036850917,"about_ca_topic_score_gemma":0.00049743336,"teacher_disagreement_score":0.95957136,"about_ca_system_score_codex":0.00028077656,"about_ca_system_score_gemma":0.0009689199,"threshold_uncertainty_score":0.99983674},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007513185,0.00007564553,0.97605157,0.0006801589,0.00043869403,0.000225323,0.0000019325187,0.00020689434,0.022244655],"genre_scores_gemma":[0.3431901,0.00007981633,0.6521561,0.0016885925,0.000407945,0.00000928004,0.00002358425,0.000046145975,0.0023983968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729127,0.000035490124,0.00037301795,0.0010572497,0.0008475623,0.00039542755],"domain_scores_gemma":[0.9985561,0.0003425053,0.00021991532,0.00055129844,0.00019568484,0.00013450395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039019834,0.000361655,0.00031321903,0.0006032433,0.00033399346,0.00038030968,0.00095607823,0.00023248799,0.00025450438],"category_scores_gemma":[0.000044413824,0.000320115,0.00007117138,0.00047614862,0.00057564693,0.0006936518,0.00025049195,0.0009106615,0.00009568206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007733709,0.0000072812504,0.0002489546,0.0000039147435,0.000006811699,0.000029512585,0.0004030879,0.2831841,0.0000054411794,0.035627417,0.0000060671036,0.6804697],"study_design_scores_gemma":[0.0005912598,0.00034817657,0.0015134274,0.00030504423,0.00000913399,0.00026122146,3.8410724e-7,0.95329314,0.00007261259,0.03498615,0.0078119254,0.00080750854],"about_ca_topic_score_codex":0.000010875395,"about_ca_topic_score_gemma":0.000081120874,"teacher_disagreement_score":0.67966217,"about_ca_system_score_codex":0.00019235908,"about_ca_system_score_gemma":0.0006009889,"threshold_uncertainty_score":0.9999251},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007929626,0.0005457341,0.9887831,0.00026600083,0.00068603514,0.00017729476,0.0000039753595,0.00007453922,0.0015337018],"genre_scores_gemma":[0.286534,0.000017656821,0.7122207,0.000826817,0.00018948456,0.0000014983501,0.0000074443146,0.000016341126,0.00018601716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724805,0.000030567902,0.00053403294,0.0010264721,0.00075708464,0.00040380054],"domain_scores_gemma":[0.99834734,0.0003008234,0.00032881435,0.0005968257,0.0002919644,0.00013425032],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006243209,0.00036604976,0.0004308327,0.00048155547,0.0007659027,0.0020366625,0.0010361623,0.00022861345,0.00001178122],"category_scores_gemma":[0.00004103551,0.00035062875,0.000095424046,0.0008038353,0.0013980311,0.00067636656,0.00032981674,0.00041813348,0.000008302642],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065949266,0.000022976457,0.0002111955,0.000034462937,0.000008773004,0.000033143475,0.0009295182,0.009887417,0.00061284436,0.03005323,0.000009603402,0.95819026],"study_design_scores_gemma":[0.0003266176,0.00010861949,0.0018754012,0.00037230522,0.000009263101,0.00021221738,1.0323297e-7,0.5207849,0.0023441054,0.47136888,0.0020523984,0.00054518034],"about_ca_topic_score_codex":0.000021892767,"about_ca_topic_score_gemma":0.000018237426,"teacher_disagreement_score":0.95764506,"about_ca_system_score_codex":0.00008573458,"about_ca_system_score_gemma":0.0007503911,"threshold_uncertainty_score":0.99989456},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008084123,0.00012067965,0.9907904,0.00049003743,0.0019221859,0.004435111,0.000013581313,0.00044942248,0.0009701318],"genre_scores_gemma":[0.07420594,0.000005056607,0.92392683,0.0007411828,0.00053413236,0.0002036107,0.000007411961,0.00007710077,0.00029872038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99286133,0.00004842788,0.0009831936,0.002037975,0.0029411071,0.0011279408],"domain_scores_gemma":[0.9947041,0.00096992997,0.00068301975,0.0025544793,0.0008104815,0.0002779576],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019887122,0.0008213972,0.0009984976,0.0025130147,0.00025102048,0.00040774493,0.0063018664,0.00065034896,0.000009903891],"category_scores_gemma":[0.00051826576,0.00075452536,0.00019085077,0.0019141356,0.0009969793,0.00046155328,0.0026752052,0.0011719923,0.000017271692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002595473,0.000090906426,0.00015531106,0.00008094215,0.00002485699,0.00016472858,0.0010186537,0.03828393,0.000892806,0.005167742,0.0001180274,0.95397615],"study_design_scores_gemma":[0.0019581493,0.0021270094,0.0026626014,0.009185129,0.000055742767,0.00030769582,0.0000040014843,0.8639805,0.030319216,0.071600005,0.013441115,0.0043588644],"about_ca_topic_score_codex":0.000035044253,"about_ca_topic_score_gemma":0.00014211048,"teacher_disagreement_score":0.94961727,"about_ca_system_score_codex":0.00069824397,"about_ca_system_score_gemma":0.0007045534,"threshold_uncertainty_score":0.99949056},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011915987,0.00027787476,0.9951738,0.00024207978,0.0012808455,0.0004843973,0.000002277247,0.00049194065,0.00085515465],"genre_scores_gemma":[0.24565707,0.000016780708,0.75359434,0.00029034997,0.00019993154,0.000010754782,4.6940184e-7,0.000026331527,0.00020394205],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672174,0.00007198152,0.00041240756,0.0016033578,0.00066218124,0.00052833144],"domain_scores_gemma":[0.9959667,0.002170073,0.00018706953,0.0013848157,0.00014414865,0.00014721465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008886139,0.00057776336,0.0005667508,0.0010148018,0.00030657728,0.00047470094,0.0015687735,0.00015754308,0.0000049946275],"category_scores_gemma":[0.0005042573,0.0005204519,0.000083642626,0.00050116156,0.00034896506,0.0006471325,0.0010098437,0.0011839978,0.000012812382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005764861,0.000084155276,0.000034459215,0.000012291813,0.000020092235,0.008053523,0.0026275367,0.15644625,0.000042235642,0.005562488,0.0000052786277,0.82710594],"study_design_scores_gemma":[0.0014141415,0.00462756,0.0013997131,0.0008883016,0.00006514753,0.030044368,0.000029986953,0.23658508,0.0015433528,0.7190249,0.00075129897,0.0036261366],"about_ca_topic_score_codex":0.000026722804,"about_ca_topic_score_gemma":0.00014931611,"teacher_disagreement_score":0.8234798,"about_ca_system_score_codex":0.00034176873,"about_ca_system_score_gemma":0.00018561882,"threshold_uncertainty_score":0.9997247},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007523194,0.00074275734,0.98836404,0.006641143,0.0013453307,0.00048021873,0.000053925534,0.00063063455,0.0009896515],"genre_scores_gemma":[0.118377075,0.00006939919,0.88015175,0.0008956859,0.0002845063,0.000014868734,0.000045896166,0.000060690734,0.000100125595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99344,0.00009031342,0.0009319068,0.002755072,0.0014051887,0.0013775621],"domain_scores_gemma":[0.98940575,0.00090462837,0.00038386974,0.009021211,0.000117417876,0.00016713112],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0014132143,0.0008458557,0.0008769887,0.0014080692,0.00030657204,0.0008910344,0.046717882,0.00082463294,0.000015399659],"category_scores_gemma":[0.003503168,0.0008190458,0.0001471522,0.0012174917,0.0012626594,0.001128855,0.103786476,0.0027579626,0.0000162928],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019049516,0.000092141134,0.0023213734,0.0001680676,0.00002667895,0.00066358526,0.00017882964,0.03153523,0.0012298615,0.0048383363,0.012727725,0.9461991],"study_design_scores_gemma":[0.00038604555,0.000099921264,0.0012122688,0.00043879685,0.000004958927,0.00009320777,8.72584e-8,0.5136291,0.0012503045,0.4798904,0.0019511135,0.0010438439],"about_ca_topic_score_codex":0.00015634063,"about_ca_topic_score_gemma":0.00034144527,"teacher_disagreement_score":0.94515526,"about_ca_system_score_codex":0.0008294545,"about_ca_system_score_gemma":0.00040718922,"threshold_uncertainty_score":0.9995427},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000025494637,0.0002794053,0.9929532,0.0013794262,0.0010672904,0.0037444038,0.000016396047,0.00016319561,0.0003941533],"genre_scores_gemma":[0.0005669024,0.000038894323,0.99704343,0.00083335704,0.00039210104,0.0002659793,0.00001276222,0.000058481444,0.00078807946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99483484,0.0001312755,0.00074756873,0.0019207371,0.0013902063,0.00097539736],"domain_scores_gemma":[0.99544066,0.00094209204,0.00046393494,0.0019505322,0.00093128084,0.00027147247],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0034017484,0.0005904577,0.0005373484,0.0007116738,0.00079356285,0.0016393737,0.00462044,0.00035116365,0.000030475658],"category_scores_gemma":[0.00030924095,0.00045062185,0.0001516404,0.000923689,0.0006458826,0.000918385,0.0007196891,0.0008325287,0.000010585019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050132658,0.00004477747,8.96961e-7,0.000035753597,0.000017639948,0.000011294671,0.00033088762,0.07917631,0.0003531589,0.007124268,0.000031586922,0.91286844],"study_design_scores_gemma":[0.00043603164,0.0004711905,0.0000033096776,0.000118773285,0.000011639989,0.000032442607,4.0631855e-7,0.9599411,0.0018032393,0.034629226,0.0020233935,0.0005292523],"about_ca_topic_score_codex":0.000030897216,"about_ca_topic_score_gemma":0.000021865739,"teacher_disagreement_score":0.91233915,"about_ca_system_score_codex":0.00045889232,"about_ca_system_score_gemma":0.0010386367,"threshold_uncertainty_score":0.99979454},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058914527,0.00033379014,0.99497813,0.0005619904,0.001707725,0.0007885664,0.00008050837,0.00022147568,0.0012688705],"genre_scores_gemma":[0.050532047,0.00012524512,0.9457829,0.0029572318,0.00041542255,0.000054411226,0.000035811303,0.000042404496,0.000054555898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99581814,0.000038283986,0.0005039728,0.0018897126,0.00096235913,0.000787557],"domain_scores_gemma":[0.9965741,0.00090034166,0.00033071727,0.0015634992,0.00041861692,0.00021272167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075569964,0.00060946157,0.00058913475,0.001038602,0.00050199166,0.00046461556,0.0039807754,0.0003921207,0.000017052445],"category_scores_gemma":[0.00014892666,0.00057067844,0.00030638502,0.00073758024,0.000807664,0.00073669263,0.0009204917,0.000612359,0.000015408108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007749289,0.00013900296,0.00004816163,0.00014052223,0.00003826526,0.00014392292,0.001289339,0.002705898,0.000113947855,0.6015465,0.000489436,0.39326748],"study_design_scores_gemma":[0.0006692977,0.0003076419,0.00003260218,0.0002604656,0.000011738509,0.000031219493,1.7461866e-7,0.50894046,0.0028801053,0.4796434,0.006378449,0.00084442215],"about_ca_topic_score_codex":0.000019807689,"about_ca_topic_score_gemma":0.00008496931,"teacher_disagreement_score":0.5062346,"about_ca_system_score_codex":0.00019555181,"about_ca_system_score_gemma":0.00078785524,"threshold_uncertainty_score":0.99967444},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008332789,0.000860728,0.993952,0.0015321154,0.0009004171,0.0003578893,0.0000211504,0.0002118795,0.002080529],"genre_scores_gemma":[0.021904709,0.00004339125,0.97479326,0.0017026366,0.0006629676,0.000023245026,0.000013397181,0.000040698284,0.0008156973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598455,0.00003980602,0.00052417116,0.0017686228,0.00092015014,0.0007627178],"domain_scores_gemma":[0.9961626,0.0013633313,0.0003666647,0.0016138238,0.0002795623,0.00021399722],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008918902,0.00054995593,0.00072296604,0.0008784219,0.00046923454,0.0014840229,0.004363043,0.00038974677,0.000047257898],"category_scores_gemma":[0.00017567148,0.00048521906,0.00028765,0.00066357583,0.00079129846,0.00077454554,0.0012113273,0.00075046346,0.00006500196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000108438235,0.000040374554,0.000023367296,0.00008879379,0.00006341239,0.000035832167,0.0028484259,0.008823447,0.0001960532,0.2876589,0.00036954042,0.699841],"study_design_scores_gemma":[0.00020143384,0.00009340097,0.000006221809,0.00059656135,0.000019283543,0.000022518387,5.4348305e-7,0.6521455,0.00010349566,0.33467934,0.011597227,0.00053445983],"about_ca_topic_score_codex":0.000026950509,"about_ca_topic_score_gemma":0.000018220491,"teacher_disagreement_score":0.69930655,"about_ca_system_score_codex":0.0001753566,"about_ca_system_score_gemma":0.00037711515,"threshold_uncertainty_score":0.99976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000734894,0.0034832016,0.9926398,0.00018865241,0.0018774417,0.0014703586,0.000017740866,0.00011986458,0.00012946983],"genre_scores_gemma":[0.2593067,0.0004991988,0.73515785,0.0035119075,0.00071148394,0.00036521693,0.00018427745,0.000104581246,0.00015878383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962557,0.000043826454,0.0007938923,0.0013217746,0.00072215736,0.0008626356],"domain_scores_gemma":[0.99629366,0.00043514138,0.00061683846,0.0014886912,0.0009981658,0.00016748332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011343875,0.0005308871,0.000619001,0.00040558516,0.0002421925,0.00031717523,0.0026639022,0.00050336716,0.0000083146915],"category_scores_gemma":[0.000054762615,0.0005247051,0.00015361619,0.0013258994,0.00032528015,0.0011681103,0.00073579984,0.0005867636,0.0000058178584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016449854,0.000032130145,0.000009326504,0.00008962097,0.0000106091775,0.0000036564636,0.00021754025,0.5586039,0.000031268846,0.004755704,0.00007825714,0.43615156],"study_design_scores_gemma":[0.00043668866,0.00037762208,0.00005555364,0.0004136372,0.000016797982,0.00003219233,2.9282592e-7,0.959705,0.00024571817,0.032392737,0.005801964,0.0005217748],"about_ca_topic_score_codex":0.000006176605,"about_ca_topic_score_gemma":0.00014694678,"teacher_disagreement_score":0.43562979,"about_ca_system_score_codex":0.00037931782,"about_ca_system_score_gemma":0.00041513643,"threshold_uncertainty_score":0.99972045},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044444395,0.0000655211,0.9922139,0.0008829022,0.0007347126,0.00068261276,0.0000026386153,0.00025725944,0.0047160247],"genre_scores_gemma":[0.16854048,0.0000059445597,0.8234161,0.0018501199,0.00042519634,0.00008514349,0.000027192236,0.000050307062,0.005599484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952103,0.00012064527,0.0005146234,0.0020558524,0.0012361483,0.00086243195],"domain_scores_gemma":[0.9969167,0.00066055777,0.00035011646,0.0013606111,0.0003859036,0.0003260939],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001460818,0.0005320127,0.000516482,0.0008051041,0.000698208,0.0024501183,0.004167728,0.00020741585,0.000013209556],"category_scores_gemma":[0.00034288072,0.0004761003,0.00007932323,0.0023731245,0.00038927005,0.0016641591,0.0010750975,0.0014435695,0.00015729482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008900773,0.00004319967,0.00013053528,0.0000689487,0.000012202434,0.000018624241,0.008143528,0.6074489,0.00023260742,0.0024781073,0.00005313332,0.38136134],"study_design_scores_gemma":[0.0014296697,0.0013657125,0.0011338263,0.0018212887,0.000037545193,0.00026958017,0.00006141071,0.9009842,0.0027377335,0.019939033,0.06687729,0.0033426993],"about_ca_topic_score_codex":0.00012304026,"about_ca_topic_score_gemma":0.00014671074,"teacher_disagreement_score":0.37801862,"about_ca_system_score_codex":0.0012472149,"about_ca_system_score_gemma":0.0039953045,"threshold_uncertainty_score":0.9997691},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022808209,0.00010956868,0.9975448,0.00013806552,0.0006728725,0.00020091767,0.000015888483,0.000072136565,0.0010176144],"genre_scores_gemma":[0.13270655,0.000004311372,0.86687624,0.00022343497,0.00012198906,0.0000014870127,0.0000035198425,0.00002038903,0.000042061252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966568,0.000033808818,0.0005901718,0.0012605465,0.0009193286,0.0005393568],"domain_scores_gemma":[0.9975711,0.0005009761,0.0004439046,0.0011467604,0.00017997649,0.00015727736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007013913,0.00042878633,0.0008286185,0.0014596639,0.00014034279,0.00050548295,0.002688491,0.0002065087,0.000019974665],"category_scores_gemma":[0.00012662122,0.00035561842,0.0003179316,0.0021617173,0.00079598767,0.0007215547,0.0011650372,0.0005137466,0.0000035560176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002932055,0.000031412477,0.00008588082,0.000026463033,0.000102930666,0.00004794067,0.0004765979,0.19241896,0.00022894423,0.023834947,2.82591e-7,0.7827427],"study_design_scores_gemma":[0.00010477397,0.000100241574,0.000075225165,0.00017906558,0.00007354444,0.000012381971,2.2797944e-7,0.81190914,0.00066801195,0.18642047,0.000039343162,0.00041759695],"about_ca_topic_score_codex":0.00003432315,"about_ca_topic_score_gemma":0.0000060041248,"teacher_disagreement_score":0.7823251,"about_ca_system_score_codex":0.0002771871,"about_ca_system_score_gemma":0.00047764071,"threshold_uncertainty_score":0.99988955},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5038301,0.00014351835,0.49587092,0.000005729555,0.000087729524,0.000047156274,4.0307552e-7,0.0000035640671,0.000010901229],"genre_scores_gemma":[0.939966,0.00007169216,0.059894197,0.000034541226,0.000021266598,0.000002304698,0.0000022644429,0.0000064655533,0.0000012432558],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989364,0.00007604474,0.00020657528,0.00040639818,0.00015464473,0.00021993843],"domain_scores_gemma":[0.9994861,0.000017731054,0.00011721656,0.0002764594,0.000053017935,0.00004946772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026029872,0.000108793225,0.00011258304,0.0001165825,0.000051959018,0.000013315329,0.00034343335,0.000084715415,0.00000632648],"category_scores_gemma":[0.00004964634,0.00009709783,0.00003232076,0.00045414042,0.00014850368,0.000009999514,0.00014004987,0.00014603944,8.7761197e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000127684125,0.00003375133,0.1227343,0.000006576278,0.0000022526062,8.568854e-7,0.0017824614,0.4106049,0.41738862,0.0000014503953,0.0000012225555,0.04743085],"study_design_scores_gemma":[0.00022726208,0.000122053105,0.12607671,0.00003216029,0.0000019703712,0.0000024396397,0.000015568015,0.37289125,0.49896848,0.0014684966,0.000028055065,0.00016553918],"about_ca_topic_score_codex":0.00011569223,"about_ca_topic_score_gemma":0.000045577013,"teacher_disagreement_score":0.43613595,"about_ca_system_score_codex":0.000021869893,"about_ca_system_score_gemma":0.00008395973,"threshold_uncertainty_score":0.39595345},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.8570555e-7,0.0002755652,0.9965668,0.000076940036,0.0006199683,0.00087771536,0.0000024867145,0.00033397623,0.0012459995],"genre_scores_gemma":[0.00037592556,0.00002149685,0.99853206,0.0001924087,0.00066164165,0.000023986755,0.000009333338,0.00005427488,0.0001289027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983416,0.000024059224,0.00036020682,0.0005147479,0.0003118838,0.00044750381],"domain_scores_gemma":[0.998922,0.00042276864,0.00010110219,0.0003552958,0.00012946966,0.00006939345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012663273,0.00031603227,0.00032252725,0.000258886,0.00012470051,0.0001640146,0.0005128971,0.00027391556,0.0000063633115],"category_scores_gemma":[0.000054524076,0.0003206728,0.00006622598,0.0003216407,0.00010707829,0.0001562625,0.00006190401,0.00035421178,0.0000046143605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013686097,0.0000016873178,4.5669853e-7,0.000024657678,0.0000029894406,8.8976014e-7,0.00007055225,0.56844103,0.000013766715,0.00040910576,0.000023714558,0.4310098],"study_design_scores_gemma":[0.00013718707,0.00006263868,0.0000032791042,0.00020699254,0.000007888527,0.00000854532,1.9700806e-8,0.89253104,0.0003709136,0.10577521,0.0005882797,0.00030799164],"about_ca_topic_score_codex":5.9863424e-7,"about_ca_topic_score_gemma":0.0000014954727,"teacher_disagreement_score":0.43070182,"about_ca_system_score_codex":0.00021495174,"about_ca_system_score_gemma":0.00009866854,"threshold_uncertainty_score":0.99992454},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007775364,0.00009292012,0.9888474,0.0022369337,0.00033590925,0.00032145297,0.000020447997,0.00018312322,0.007884077],"genre_scores_gemma":[0.6568934,0.000052580985,0.30950412,0.032684363,0.00053034694,0.000021606185,0.000029224915,0.000052467058,0.00023193288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971043,0.000077377204,0.0005220317,0.0009394214,0.0006437249,0.00071317726],"domain_scores_gemma":[0.9971842,0.0010890216,0.00028223524,0.0010931463,0.00013100989,0.00022034413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013525368,0.00052884,0.00040115704,0.0012790776,0.00047348262,0.00083809474,0.0013843649,0.0002843247,0.000027610287],"category_scores_gemma":[0.00018391851,0.0004773754,0.000084733365,0.00061140454,0.0004201524,0.0012702472,0.00049774785,0.0009001081,0.000037922688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025207988,0.000008119203,0.000012304486,0.000056515208,0.0000041624144,0.00041567377,0.00093172974,0.2777888,0.0000028071065,0.017247178,0.00003594042,0.70347154],"study_design_scores_gemma":[0.00036374666,0.00022470887,0.000018034398,0.0007074349,0.000005081854,0.00067720504,4.7166233e-7,0.91089123,0.000059606075,0.082691796,0.0038123622,0.0005483421],"about_ca_topic_score_codex":0.0001116474,"about_ca_topic_score_gemma":0.00006103402,"teacher_disagreement_score":0.70292324,"about_ca_system_score_codex":0.00028102827,"about_ca_system_score_gemma":0.0007722305,"threshold_uncertainty_score":0.9997678},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029465851,0.0003474557,0.9910804,0.0006185317,0.002414884,0.00023890872,0.0000022510615,0.00018018164,0.0050879046],"genre_scores_gemma":[0.020914087,0.000055292843,0.97010267,0.0074787904,0.00035933722,0.000005185364,0.000002527163,0.000052481224,0.001029655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582,0.000032556152,0.00052779075,0.0017414183,0.0010418837,0.0008363676],"domain_scores_gemma":[0.9977201,0.00032086077,0.0002695265,0.0012249197,0.0002214364,0.0002431291],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006710961,0.0005806975,0.00053080276,0.0008593684,0.00034228674,0.000639873,0.0029094531,0.0002322975,0.00003631982],"category_scores_gemma":[0.00012795274,0.0005420428,0.0001498932,0.0006697685,0.0005535693,0.001055364,0.0013401693,0.0009235465,0.00011369314],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017765211,0.000022813878,0.000013929645,0.00001782055,0.0000040369105,0.000085845,0.0002298346,0.003799209,0.00031976556,0.007532572,0.000040760442,0.9879316],"study_design_scores_gemma":[0.0004473232,0.00015038768,0.000070854694,0.0007065788,0.0000053689405,0.00013785974,2.340472e-7,0.80350655,0.007542148,0.17835197,0.007826754,0.0012539752],"about_ca_topic_score_codex":0.0000037833925,"about_ca_topic_score_gemma":0.000008536237,"teacher_disagreement_score":0.98667765,"about_ca_system_score_codex":0.00029724996,"about_ca_system_score_gemma":0.00039992706,"threshold_uncertainty_score":0.9997031},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022621902,0.0005122187,0.9899967,0.0036552749,0.0011228072,0.0020075825,0.000029814992,0.00036798144,0.002081443],"genre_scores_gemma":[0.033159062,0.000024587265,0.9501729,0.014740237,0.0012387049,0.0004192611,0.000017039834,0.00006280374,0.00016542048],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952255,0.000027605553,0.0006701628,0.0021806553,0.0009066511,0.0009894358],"domain_scores_gemma":[0.9954559,0.0010965226,0.00037645825,0.0021708093,0.00050580315,0.00039447646],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00052185584,0.0007291402,0.00063228735,0.0010488417,0.00054878305,0.0011367116,0.0062754303,0.00045724402,0.000032033415],"category_scores_gemma":[0.000021474043,0.0006498572,0.00020252672,0.0013617154,0.00018489025,0.0006100107,0.0018453606,0.0007979258,0.00023731141],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010009878,0.000059806393,0.00006144288,0.00046027947,0.000036798127,0.000009902787,0.004472921,0.014341561,0.0012116301,0.24502805,0.000048819475,0.7342588],"study_design_scores_gemma":[0.0002384881,0.00022185473,0.000029478082,0.0009813341,0.000018120134,0.000026407432,0.0000025006734,0.4598978,0.0010157735,0.48605376,0.050487116,0.0010274005],"about_ca_topic_score_codex":0.000067428184,"about_ca_topic_score_gemma":0.0009303691,"teacher_disagreement_score":0.73323137,"about_ca_system_score_codex":0.0001501676,"about_ca_system_score_gemma":0.00052479433,"threshold_uncertainty_score":0.9999002},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014648563,0.00010071408,0.9746799,0.00005167452,0.0037686105,0.0002566118,0.0000082117895,0.000055927176,0.0064297975],"genre_scores_gemma":[0.98469627,0.000009237302,0.014047907,0.0002874052,0.00031856744,0.0000027489298,0.000006767227,0.000026259502,0.00060483185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982007,0.00008824755,0.00045728777,0.0006400409,0.0003310006,0.00028273184],"domain_scores_gemma":[0.998513,0.00032423084,0.0003618103,0.00051094923,0.00022150367,0.000068533656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048483515,0.00024450608,0.00033882383,0.00045487809,0.00017730743,0.000037333386,0.0004750378,0.00030105293,0.0009056658],"category_scores_gemma":[0.00013648544,0.00024165343,0.00015149414,0.00023484649,0.00073291315,0.00014714595,0.00020124689,0.0005860253,0.00004105338],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097178505,0.00016731574,0.0003615244,0.00003917983,0.000062332496,0.0000356775,0.012983383,0.009460964,0.0015505832,0.0054555885,0.00004280732,0.9697435],"study_design_scores_gemma":[0.004098253,0.0017450282,0.05897761,0.0032617978,0.00035886595,0.0010046805,0.00013873541,0.70317495,0.0036663492,0.21479525,0.0040126634,0.004765824],"about_ca_topic_score_codex":0.00021364744,"about_ca_topic_score_gemma":0.00008757372,"teacher_disagreement_score":0.9700477,"about_ca_system_score_codex":0.00030931598,"about_ca_system_score_gemma":0.00017648589,"threshold_uncertainty_score":0.99164057},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045826077,0.00012699282,0.9914242,0.00013907078,0.0014090945,0.00021587749,0.000011880186,0.000102366364,0.0061122775],"genre_scores_gemma":[0.15938948,0.000026466842,0.840146,0.00020320655,0.00012126049,0.000005938002,0.000007116817,0.000015031785,0.00008550179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967569,0.00002785896,0.00069876236,0.0011281504,0.00094314775,0.00044515723],"domain_scores_gemma":[0.99629074,0.00039751205,0.00055280165,0.002257114,0.0003637695,0.00013808731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00141526,0.00036864242,0.00066979084,0.00256698,0.00018097226,0.00021764163,0.0038913877,0.00042422063,0.000055715787],"category_scores_gemma":[0.00019722238,0.00034888776,0.00028004375,0.0023918885,0.0009607082,0.00057330134,0.0007683526,0.0009788993,0.00002347462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004372197,0.00006948686,0.00015672324,0.00005140325,0.00015945076,0.000018530374,0.0012688164,0.04016384,0.005774603,0.27634606,0.000004313936,0.6759824],"study_design_scores_gemma":[0.00015556887,0.00010078269,0.012034074,0.00018399615,0.00017917936,0.000020742847,1.8125407e-7,0.82153934,0.018623643,0.14506008,0.0012322364,0.0008702016],"about_ca_topic_score_codex":0.00004236177,"about_ca_topic_score_gemma":0.0000959304,"teacher_disagreement_score":0.78137547,"about_ca_system_score_codex":0.00014618132,"about_ca_system_score_gemma":0.00040685185,"threshold_uncertainty_score":0.9998963},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059305097,0.00003420476,0.99380356,0.004354112,0.0004024553,0.0004785445,0.0000011313947,0.0003115332,0.00002138384],"genre_scores_gemma":[0.3467569,0.0000014830646,0.6515597,0.0015461446,0.00009321163,0.000033021643,0.0000032204675,0.000004949276,0.0000013393054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979721,0.000044092794,0.00036816727,0.00066632294,0.00055003876,0.00039928523],"domain_scores_gemma":[0.99875176,0.00021554052,0.00013917199,0.00057727576,0.00019231664,0.00012391043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009065663,0.00016408619,0.00015776203,0.00029864293,0.0001760747,0.0004583919,0.0012398282,0.00007336654,0.000006995713],"category_scores_gemma":[0.0002540333,0.0001535913,0.00004940722,0.0009812447,0.00044847003,0.0017248804,0.00022589536,0.00015800768,0.000013721861],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038300664,0.0000410128,0.00000899975,0.000012917351,8.292375e-7,0.0000040599234,0.00045350977,0.0058401,0.0063829613,0.00037769182,0.00007057364,0.98680353],"study_design_scores_gemma":[0.0002536466,0.00015817973,0.00014777739,0.0000322603,0.0000015714212,0.0000344453,4.4740742e-7,0.8689256,0.11381116,0.016352335,0.00011939755,0.00016318215],"about_ca_topic_score_codex":0.00002542447,"about_ca_topic_score_gemma":0.000034764373,"teacher_disagreement_score":0.98664033,"about_ca_system_score_codex":0.00032257612,"about_ca_system_score_gemma":0.00021208273,"threshold_uncertainty_score":0.62632716},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012976421,0.00058877736,0.9840988,0.00018363683,0.002058824,0.00085389306,0.0000062852673,0.0002447957,0.011952016],"genre_scores_gemma":[0.59361947,0.000011056307,0.40259218,0.0006059402,0.0015504153,0.00004570457,0.000012572616,0.00006377008,0.0014988508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962835,0.000063589214,0.00070129527,0.0014937292,0.0006244358,0.0008334545],"domain_scores_gemma":[0.9960949,0.0014032987,0.0004369458,0.0014560454,0.0004135229,0.00019529913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014291311,0.00061364507,0.0008269003,0.000437347,0.0004235251,0.0009624599,0.0032090277,0.0004728529,0.000022774004],"category_scores_gemma":[0.00037634646,0.00047334455,0.00019831283,0.0003577366,0.0009437397,0.0002917987,0.0010026325,0.000606449,0.00004941554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027319727,0.00001009673,0.000008021606,0.0001758802,0.000010808506,0.0000068460095,0.0013542606,0.00025694023,0.000027019807,0.722683,0.00002766811,0.27543673],"study_design_scores_gemma":[0.00024645054,0.00018153063,0.0000052483406,0.00016822341,0.000011247872,0.00009450744,5.417724e-7,0.13797013,0.00050097203,0.85090566,0.009376307,0.00053915696],"about_ca_topic_score_codex":0.0000070386423,"about_ca_topic_score_gemma":0.000054913045,"teacher_disagreement_score":0.59360653,"about_ca_system_score_codex":0.00016771286,"about_ca_system_score_gemma":0.00049394404,"threshold_uncertainty_score":0.99977183},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014889694,0.0003316876,0.9954649,0.002006119,0.00047510178,0.0004361443,0.000014067575,0.00011625289,0.0010067978],"genre_scores_gemma":[0.25994945,0.00019746395,0.7366576,0.0015487861,0.0006223417,0.000020503172,0.000019393985,0.000040365197,0.0009440906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976012,0.000029597897,0.00029277863,0.0011771251,0.000501904,0.00039738306],"domain_scores_gemma":[0.99839026,0.00032663537,0.00023620696,0.00048752583,0.00042807966,0.00013130982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005442371,0.00037932384,0.00037507864,0.000760859,0.00029549125,0.0005008174,0.0006904523,0.00030499249,0.000007582706],"category_scores_gemma":[0.00012688876,0.0003605972,0.00012951062,0.0005059062,0.00041440982,0.0007721292,0.0003687591,0.00045869275,0.000019885121],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050080394,0.000013204444,0.000002577456,0.000030326019,0.000016015423,0.000009569984,0.00084885693,0.0014139365,0.0019567735,0.0025293103,0.000012136008,0.9931623],"study_design_scores_gemma":[0.00032725377,0.00013912661,0.00008360453,0.0001716878,0.000027336257,0.000057859404,0.0000015300456,0.9490959,0.013306634,0.033299193,0.0028847135,0.0006051324],"about_ca_topic_score_codex":0.000011303883,"about_ca_topic_score_gemma":0.00016878326,"teacher_disagreement_score":0.99255717,"about_ca_system_score_codex":0.0002167624,"about_ca_system_score_gemma":0.00014917336,"threshold_uncertainty_score":0.9998846},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028341968,0.00007094185,0.9922821,0.00008550163,0.00041869364,0.0003216752,0.000028191407,0.00022613542,0.0062833414],"genre_scores_gemma":[0.76763016,0.000015523347,0.23160376,0.00057926757,0.0000897434,0.000006288575,0.0000035693683,0.000045527944,0.000026141126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804175,0.00003404989,0.0004371746,0.0004885499,0.0006797073,0.00031878025],"domain_scores_gemma":[0.9977313,0.00081346824,0.00017953053,0.0010151593,0.00019729281,0.00006320169],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068582693,0.0003744764,0.00041951193,0.0005647792,0.00008664974,0.000057734087,0.0012413956,0.00025493946,0.000102730046],"category_scores_gemma":[0.00032990635,0.00027055835,0.00011368779,0.0005004114,0.0007616056,0.00015647702,0.000280971,0.0010201146,0.0000035863015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004790089,0.000034940273,0.0003505342,0.00037428306,0.000027883174,0.000042652417,0.0005203873,0.18563879,0.0050948374,0.011737645,0.00014989419,0.7959803],"study_design_scores_gemma":[0.00013656926,0.00009370619,0.00076171674,0.00020940967,0.000007197357,0.0000035181504,1.5622034e-7,0.7948029,0.05204972,0.15103325,0.00040559724,0.0004962465],"about_ca_topic_score_codex":0.000023869437,"about_ca_topic_score_gemma":0.000029513523,"teacher_disagreement_score":0.795484,"about_ca_system_score_codex":0.00020194892,"about_ca_system_score_gemma":0.000095601245,"threshold_uncertainty_score":0.99997467},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021273713,0.00016863302,0.9938919,0.000034603418,0.00045732554,0.00022492594,0.000001633945,0.00011033993,0.002983245],"genre_scores_gemma":[0.60747445,0.00005106689,0.38984513,0.0010007151,0.00039590235,0.000012723532,0.000007893013,0.00010202399,0.0011100848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985825,0.000040375086,0.00027871472,0.00040346294,0.0003970939,0.00029784848],"domain_scores_gemma":[0.99725705,0.0021736263,0.00007629578,0.0003619354,0.000045223842,0.00008589079],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024608927,0.00030229142,0.00042492748,0.00033174132,0.000037442867,0.000030767907,0.00046268952,0.00018679493,0.000049639726],"category_scores_gemma":[0.00012367925,0.00026519244,0.000070372356,0.00023776316,0.00022720582,0.000021600461,0.000081225546,0.00040826184,0.00003609992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136354965,0.000017759576,0.000009817978,0.0001825586,0.000014674826,0.000011260176,0.00015931926,0.2204469,0.027013166,0.0012263195,0.000011454951,0.7508931],"study_design_scores_gemma":[0.0003970454,0.00060470554,0.0005165546,0.0006149642,0.000011434771,0.0000033784186,1.0918835e-8,0.92933404,0.032156967,0.03546487,0.00045365046,0.00044238064],"about_ca_topic_score_codex":0.0000013093289,"about_ca_topic_score_gemma":7.428563e-7,"teacher_disagreement_score":0.75045073,"about_ca_system_score_codex":0.00008467094,"about_ca_system_score_gemma":0.000027897722,"threshold_uncertainty_score":0.99998003},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4614885,0.00024630208,0.5378401,0.00013762535,0.00006314555,0.0002090861,0.0000011268173,0.0000034088673,0.000010695683],"genre_scores_gemma":[0.90194505,3.7272392e-7,0.09792471,0.000056212586,0.00005026273,0.000008797308,0.000012313319,0.0000015391652,7.4324345e-7],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988663,0.00005206194,0.00021367155,0.0003372403,0.0004086192,0.00012206768],"domain_scores_gemma":[0.99885625,0.00009167712,0.000091002395,0.00028764806,0.0006555163,0.000017908946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023008191,0.0000699185,0.00024454552,0.00029471298,0.000043170054,0.000004278966,0.00012312447,0.000068699155,0.0000063747666],"category_scores_gemma":[0.00040950187,0.000049735474,0.00007026684,0.0013131868,0.00022198321,0.00003570167,0.000031248943,0.00006235936,1.058434e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003831285,0.00033937412,0.18487981,0.00006240152,0.0003237516,0.0000011387436,0.001143238,0.124460116,0.07560579,0.000105935556,0.00000994788,0.6126854],"study_design_scores_gemma":[0.0002939527,0.000058461712,0.7823158,0.000014350242,0.00024211951,0.0000015221553,4.3034092e-7,0.077976406,0.13689665,0.0021487037,0.000012741788,0.000038852784],"about_ca_topic_score_codex":0.000040217692,"about_ca_topic_score_gemma":0.00010237949,"teacher_disagreement_score":0.6126465,"about_ca_system_score_codex":0.00007358766,"about_ca_system_score_gemma":0.00028945346,"threshold_uncertainty_score":0.20281538},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024081622,0.0005162296,0.994665,0.00027698398,0.00073118694,0.00040961968,0.0000047801695,0.0001667339,0.000821296],"genre_scores_gemma":[0.32608077,0.00013726352,0.6697442,0.003497922,0.00037653034,0.000012338535,0.0000058279,0.000067373585,0.0000777829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609035,0.00004180009,0.0005883731,0.0017519965,0.0007307345,0.00079676765],"domain_scores_gemma":[0.99739784,0.000865457,0.00024236528,0.0010982585,0.00017199927,0.00022409616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013277492,0.00063225,0.00055262813,0.0024139776,0.00016197542,0.00080312835,0.0020985326,0.00035331407,0.000011470682],"category_scores_gemma":[0.000080545586,0.00055746915,0.00014126602,0.0013217537,0.00096464047,0.0014380874,0.00092486467,0.0010708357,0.000013277867],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002179734,0.00006077065,0.0008517901,0.000058736056,0.000011886426,0.0001894459,0.0021682386,0.0052082962,0.0015276986,0.02496037,0.000014226022,0.9649267],"study_design_scores_gemma":[0.0013831841,0.0005424264,0.008257883,0.001394489,0.000010850539,0.0002884951,0.0000011018191,0.6266275,0.007934254,0.3481003,0.0031493318,0.0023101696],"about_ca_topic_score_codex":0.00012895738,"about_ca_topic_score_gemma":0.00045848938,"teacher_disagreement_score":0.96261656,"about_ca_system_score_codex":0.00023793292,"about_ca_system_score_gemma":0.0002475845,"threshold_uncertainty_score":0.9996877},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000337232,0.0006581991,0.98269296,0.0015653233,0.0008151215,0.0004233484,0.0000025187862,0.00084819697,0.012657111],"genre_scores_gemma":[0.21986374,0.000054437576,0.7767585,0.001927626,0.0002653953,0.000026690524,0.0000029327198,0.000058663125,0.0010420087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593836,0.00003545549,0.00047917236,0.0012667535,0.0012493695,0.0010308733],"domain_scores_gemma":[0.9959853,0.00046775062,0.0002597453,0.0028552224,0.00025306767,0.00017890029],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00060546456,0.00071060896,0.00063910644,0.001267745,0.00045327606,0.00097595283,0.00765384,0.00034171264,0.000029959117],"category_scores_gemma":[0.00003780614,0.0006137456,0.00009192776,0.0010833135,0.0011278647,0.00060304085,0.0040731058,0.001168998,0.00009585015],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007282776,0.000050225357,0.00017529259,0.000036521677,0.000031614603,0.00026516026,0.004922167,0.049879413,0.00009863731,0.03616658,0.00031159143,0.90805554],"study_design_scores_gemma":[0.00088672753,0.0015018729,0.00016309158,0.002908243,0.000026066104,0.00064931216,0.000009013697,0.81664944,0.011701457,0.1277461,0.033498853,0.0042598066],"about_ca_topic_score_codex":0.00004980198,"about_ca_topic_score_gemma":0.00013781305,"teacher_disagreement_score":0.9037957,"about_ca_system_score_codex":0.0003361851,"about_ca_system_score_gemma":0.00019542666,"threshold_uncertainty_score":0.9996314},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49026015,0.00002638282,0.5093664,0.000045334564,0.00015678273,0.0001305877,0.0000048702873,0.0000046875907,0.000004795906],"genre_scores_gemma":[0.6008867,0.0000017590941,0.39885995,0.00021385601,0.000029146153,0.0000032643977,0.0000020044838,0.0000032496414,8.769424e-8],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903774,0.000020039037,0.00019617357,0.00022816604,0.0002693968,0.00024849997],"domain_scores_gemma":[0.99945307,0.000066876164,0.00005941586,0.00015569324,0.00016162741,0.000103315986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014085925,0.000105206214,0.00019543084,0.00015402302,0.00006051206,0.000015091431,0.00006933088,0.00004045971,0.000010934748],"category_scores_gemma":[0.00013165077,0.00007815879,0.000023790964,0.00030721264,0.00022264796,0.00018911237,0.0000629254,0.00009068366,0.0000017091825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022814107,0.00065880443,0.42913467,0.00001548716,0.000010306509,0.0000020929174,0.0012983994,0.04120224,0.0023853364,0.00007452058,0.0000013763071,0.5251939],"study_design_scores_gemma":[0.00065021316,0.0001829116,0.2440725,0.00012171733,0.000013782368,0.000020073929,9.936866e-7,0.7406261,0.014141895,0.00010478106,3.9898563e-7,0.00006461788],"about_ca_topic_score_codex":0.000041146963,"about_ca_topic_score_gemma":0.000006117953,"teacher_disagreement_score":0.69942385,"about_ca_system_score_codex":0.00016530347,"about_ca_system_score_gemma":0.00011175675,"threshold_uncertainty_score":0.3187223},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082958,0.00036787306,0.99122196,0.00038936365,0.004561565,0.00019285054,0.0000015993727,0.0003084194,0.0028734275],"genre_scores_gemma":[0.5285516,0.000030697734,0.4653836,0.0016595084,0.001988114,0.000018494338,0.000010485871,0.00009447868,0.0022630543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665016,0.00003583202,0.00047898223,0.001331375,0.0009133219,0.00059033715],"domain_scores_gemma":[0.99803823,0.00014177125,0.0003516702,0.00092457165,0.00036241455,0.0001813563],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095662347,0.00048230359,0.00043663313,0.00084118947,0.0003460223,0.0008246712,0.0017145234,0.0003753027,0.000013047454],"category_scores_gemma":[0.000044902048,0.0004466083,0.00012310644,0.00048505142,0.0004116504,0.0012239047,0.0007033992,0.0009790972,0.0001376332],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002001849,0.000008791689,0.000019331796,0.000038655216,0.000005385582,0.000036332192,0.00031125522,0.0033484546,0.00030805866,0.00019444023,0.000027452586,0.9956998],"study_design_scores_gemma":[0.0002729894,0.00013373792,0.000045690827,0.00057474244,0.000012155154,0.0010148927,3.1607348e-7,0.5704049,0.0043785563,0.4191553,0.0030412287,0.00096552144],"about_ca_topic_score_codex":0.000023818327,"about_ca_topic_score_gemma":0.00009962851,"teacher_disagreement_score":0.99473435,"about_ca_system_score_codex":0.00034650232,"about_ca_system_score_gemma":0.00057953666,"threshold_uncertainty_score":0.9997986},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040394338,0.0000986297,0.99484366,0.000103127066,0.0002511398,0.00018598868,0.000004085478,0.000079781945,0.0040296135],"genre_scores_gemma":[0.8920757,0.0000033614715,0.10284148,0.00027166444,0.0044666603,0.000005562834,0.00004737449,0.0000636112,0.00022456532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792904,0.000024063222,0.00039332994,0.00072756514,0.00047753064,0.0004484684],"domain_scores_gemma":[0.9988843,0.00013691219,0.00029566782,0.0003548003,0.00025509993,0.00007320084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002450462,0.00038491623,0.00044812774,0.00033324634,0.0004474147,0.0003701559,0.00079039176,0.00017694781,0.0008640524],"category_scores_gemma":[0.000004921509,0.00037620656,0.00014882124,0.00046301805,0.00041644706,0.00019470816,0.0005863367,0.0006206957,0.000019468625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034176799,0.00004343943,0.003809133,0.000013855185,0.00009890915,0.0000071850077,0.0003624202,0.34609106,0.00016904846,0.08699955,0.0003355564,0.56206644],"study_design_scores_gemma":[0.00007402329,0.0000110615465,0.000120040946,0.00010985634,0.000027792443,0.000002430087,2.717252e-7,0.8022999,0.00007979797,0.19639796,0.0004638356,0.00041298987],"about_ca_topic_score_codex":0.00005513964,"about_ca_topic_score_gemma":0.000026127942,"teacher_disagreement_score":0.8920022,"about_ca_system_score_codex":0.00017820548,"about_ca_system_score_gemma":0.00023010447,"threshold_uncertainty_score":0.999869},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032907033,0.00071517477,0.9930411,0.0005889991,0.0029086194,0.0012053464,0.000082581086,0.0003926854,0.0010622019],"genre_scores_gemma":[0.0006884719,0.000047738955,0.996563,0.0012516407,0.00089634804,0.000059516125,0.00009191031,0.00006559091,0.0003357623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99419457,0.000046155466,0.00081567804,0.0023314804,0.0014843618,0.0011277804],"domain_scores_gemma":[0.9959135,0.00088497973,0.0005381913,0.001854697,0.00052904343,0.00027958603],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010337044,0.0008623864,0.00089288654,0.00092447805,0.00066415465,0.00075742503,0.0041625854,0.00060768705,0.0000052353857],"category_scores_gemma":[0.000147816,0.00082821137,0.00025123457,0.0007729843,0.0008209654,0.0008937049,0.0010058398,0.0011312594,0.00004410382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032013488,0.000046083234,0.000010255097,0.000038542275,0.000024172994,0.00015547319,0.0010072956,0.021407446,0.000046776935,0.0036525563,0.00026309383,0.9733451],"study_design_scores_gemma":[0.00041544953,0.00026152193,0.000059380756,0.00033847068,0.000013654,0.00037558164,1.4199105e-7,0.94111276,0.000121563746,0.049809825,0.006587891,0.00090379326],"about_ca_topic_score_codex":0.000015512764,"about_ca_topic_score_gemma":0.000007720382,"teacher_disagreement_score":0.9724413,"about_ca_system_score_codex":0.00051301916,"about_ca_system_score_gemma":0.0008855327,"threshold_uncertainty_score":0.9994169},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031437245,0.001325453,0.9877238,0.004790974,0.0034534715,0.0015693796,0.000015164234,0.0003278359,0.0007624615],"genre_scores_gemma":[0.012188106,0.00008856483,0.98166776,0.0026611993,0.0020228894,0.00011837913,0.000010339316,0.000104897605,0.0011378762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945288,0.000047016107,0.00076342985,0.0021484138,0.0012054921,0.0013068487],"domain_scores_gemma":[0.9946604,0.0019441366,0.0004603414,0.0022463286,0.00044351228,0.0002453244],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015067238,0.0008666953,0.0007220367,0.0005960922,0.00093008915,0.0014033534,0.00697921,0.0004037537,0.000025696043],"category_scores_gemma":[0.000096941294,0.0005798707,0.0003429504,0.00072372635,0.00096988113,0.00046476262,0.0019687165,0.0013442287,0.00009167104],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032362316,0.000024640896,0.000003677549,0.000049416267,0.000024687493,0.000019280771,0.00058219535,0.06267,0.000029395816,0.046615582,0.00030190992,0.889676],"study_design_scores_gemma":[0.00023723976,0.00020343195,0.000034272467,0.00021502847,0.000011137882,0.000080458194,1.828228e-7,0.7442448,0.00015178775,0.24221276,0.0120017985,0.0006071057],"about_ca_topic_score_codex":0.00006490992,"about_ca_topic_score_gemma":0.000033314864,"teacher_disagreement_score":0.8890689,"about_ca_system_score_codex":0.00019560412,"about_ca_system_score_gemma":0.00064734294,"threshold_uncertainty_score":0.99966526},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024234292,0.00054116134,0.9918359,0.00085998315,0.0022919136,0.0006102436,0.0000071836903,0.00023873306,0.0035906606],"genre_scores_gemma":[0.013578796,0.000022151919,0.983123,0.001954376,0.0007789222,0.000014751819,0.00000544047,0.00006225947,0.00046032682],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954252,0.00004968268,0.00062687765,0.001918636,0.0009677845,0.0010117695],"domain_scores_gemma":[0.9965592,0.000860314,0.00031587665,0.0015855364,0.0004596072,0.00021946372],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018146924,0.00066558307,0.0007054413,0.00094084203,0.00047573345,0.0012936213,0.004041568,0.00037596366,0.00001990672],"category_scores_gemma":[0.00024664545,0.0006301907,0.00027683805,0.0005820824,0.0007031874,0.0010640303,0.0011688455,0.0007968439,0.000049800696],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016145774,0.00003260856,0.0000028285267,0.00010933345,0.000015613306,0.00029694068,0.0005823478,0.009926087,0.0033908663,0.055449106,0.00005105766,0.9301271],"study_design_scores_gemma":[0.001071446,0.00027422424,0.000032134412,0.000742404,0.000018642617,0.00019532262,7.7997136e-8,0.14137362,0.02582054,0.82708716,0.0022388312,0.0011456015],"about_ca_topic_score_codex":0.000020545485,"about_ca_topic_score_gemma":0.00001355645,"teacher_disagreement_score":0.9289815,"about_ca_system_score_codex":0.0005047872,"about_ca_system_score_gemma":0.0010434929,"threshold_uncertainty_score":0.9997431},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02212161,0.0010652872,0.96906626,0.0014266281,0.005136171,0.00065895653,0.000004128516,0.0004049555,0.000115988194],"genre_scores_gemma":[0.5483904,0.000025095247,0.45081154,0.00048120148,0.00022437458,0.00003821377,0.0000030378174,0.000023146522,0.0000029952735],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927012,0.00052212604,0.00061616173,0.00270059,0.0018288895,0.001631074],"domain_scores_gemma":[0.9945816,0.0009217585,0.00028772757,0.0030375754,0.00064742734,0.0005239026],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.005211608,0.00066716823,0.0006954538,0.0017530152,0.00046112586,0.0014335503,0.0091138035,0.00040911022,0.000009670886],"category_scores_gemma":[0.00068483816,0.0006242596,0.00022819146,0.0045344955,0.0016743125,0.0012217587,0.010237468,0.002456915,0.00005340529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015367224,0.00010692792,0.0028565004,0.000108719214,0.000015712461,0.00017473543,0.0021498834,0.28728274,0.0009802466,0.01432638,0.00002624705,0.6919565],"study_design_scores_gemma":[0.000158186,0.00010994885,0.00038504755,0.00015351242,0.0000024554531,0.000064719155,2.4418603e-7,0.4655015,0.0028958367,0.5302262,0.00007191301,0.00043049047],"about_ca_topic_score_codex":0.000099473866,"about_ca_topic_score_gemma":0.00009153499,"teacher_disagreement_score":0.69152606,"about_ca_system_score_codex":0.00084267627,"about_ca_system_score_gemma":0.0016202015,"threshold_uncertainty_score":0.99984443},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059524225,0.001134306,0.9817042,0.0002827332,0.0049409224,0.000985541,0.000012300363,0.0002821643,0.010062612],"genre_scores_gemma":[0.98726165,0.000026009153,0.010821817,0.0007994681,0.00059308513,0.000026252867,0.0000055146224,0.000048750906,0.00041747608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99433595,0.00011700737,0.0011469615,0.0021846357,0.0011845555,0.0010308921],"domain_scores_gemma":[0.99585074,0.0011772591,0.0005730047,0.0017874482,0.00033917543,0.0002723737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028641894,0.0007288602,0.0010672754,0.0021220353,0.00017620545,0.0009526586,0.003729494,0.00061732077,0.000020374428],"category_scores_gemma":[0.000124094,0.00074729533,0.00018746991,0.00092719746,0.00057040487,0.0011885789,0.0013668652,0.0014057294,0.00021573421],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017527751,0.00010460571,0.00059753784,0.0001457387,0.000028660968,0.00062107225,0.0023864654,0.011362301,0.000099506055,0.031607885,0.000058035053,0.9529707],"study_design_scores_gemma":[0.0014295966,0.0002866706,0.0009871201,0.0027094893,0.000011865483,0.0006608732,0.0000016288814,0.8997069,0.00069308036,0.07793322,0.013136994,0.0024425695],"about_ca_topic_score_codex":0.00038350408,"about_ca_topic_score_gemma":0.0014694892,"teacher_disagreement_score":0.9866664,"about_ca_system_score_codex":0.0013057728,"about_ca_system_score_gemma":0.00096741616,"threshold_uncertainty_score":0.99949783},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015351117,0.000907516,0.9845142,0.00039574178,0.004423564,0.0003628944,0.0000027566996,0.0003056893,0.009072321],"genre_scores_gemma":[0.68126214,0.0001616205,0.31211942,0.0014241523,0.0014761223,0.000018719613,0.0000082200595,0.00005533064,0.0034742742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958574,0.000045387158,0.00054755516,0.0015979534,0.0011500508,0.0008016308],"domain_scores_gemma":[0.9971348,0.0003570951,0.00032367665,0.0017137197,0.00027607192,0.00019463843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007868912,0.00059866876,0.0006493901,0.0006099451,0.00042119363,0.0006292923,0.0042167655,0.00039957787,0.000023073366],"category_scores_gemma":[0.00008409316,0.00048381524,0.00016876194,0.0005809772,0.0011258723,0.00059860083,0.0013894135,0.00073351717,0.00019679373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002312377,0.000017787863,0.00003062114,0.000021638501,0.000010381563,0.00015789963,0.00091333967,0.0012843831,0.000012247518,0.58874303,0.00008773505,0.40871865],"study_design_scores_gemma":[0.00031841072,0.0002544348,0.00014045654,0.00006765007,0.000006897852,0.00034172746,2.1296516e-7,0.019827954,0.00087217067,0.95540005,0.021755114,0.001014919],"about_ca_topic_score_codex":0.00009660563,"about_ca_topic_score_gemma":0.00008909374,"teacher_disagreement_score":0.6812468,"about_ca_system_score_codex":0.00022021624,"about_ca_system_score_gemma":0.0005951026,"threshold_uncertainty_score":0.99976134},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016496965,0.00032095937,0.9926606,0.00074318703,0.002364864,0.00027521045,0.0000035094415,0.00022051812,0.003246197],"genre_scores_gemma":[0.30040547,0.0000581244,0.69349957,0.0034957114,0.0012707487,0.000014186721,0.000046729765,0.000052197105,0.0011572497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623543,0.00004878816,0.0005363439,0.0014573183,0.0011382508,0.0005838407],"domain_scores_gemma":[0.99757016,0.00058358203,0.00028580517,0.0010678489,0.00028873028,0.00020390475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006422015,0.00048620996,0.00045207227,0.001514197,0.00037660712,0.0006526958,0.0025815393,0.0002925733,0.00001819145],"category_scores_gemma":[0.00011511825,0.00047074404,0.00014748517,0.0012238354,0.00034723818,0.000468869,0.0005845112,0.0006514697,0.000080711216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004261085,0.000017872339,0.000031001724,0.000024872343,0.000012774054,0.000055779357,0.00025502735,0.10195756,0.00031496907,0.19075169,0.00013105934,0.70644313],"study_design_scores_gemma":[0.00028999068,0.00017131476,0.000377444,0.00019977486,0.000008598309,0.00008292346,4.6526985e-8,0.6203088,0.0008751455,0.36939064,0.00757212,0.00072317413],"about_ca_topic_score_codex":0.00001529522,"about_ca_topic_score_gemma":0.000031898027,"teacher_disagreement_score":0.70571995,"about_ca_system_score_codex":0.00018391642,"about_ca_system_score_gemma":0.00051937014,"threshold_uncertainty_score":0.9997744},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005551556,0.00084271363,0.99207956,0.00015796014,0.0009809879,0.00024204749,0.000005201267,0.000095375806,0.0050409813],"genre_scores_gemma":[0.38007692,0.00013901954,0.61873245,0.00057823356,0.00029742735,0.00000431735,0.0000065876425,0.000035182125,0.0001298885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99551946,0.000034151795,0.0007787237,0.0014264636,0.0015489304,0.00069226697],"domain_scores_gemma":[0.9969544,0.00043238592,0.00028544123,0.0017851308,0.0003235323,0.00021913517],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012530237,0.0005123554,0.00073988317,0.0022513894,0.00018319678,0.00018915451,0.0035548168,0.0003874655,0.000038610757],"category_scores_gemma":[0.000054737375,0.000450585,0.0003787144,0.0017282822,0.0010142649,0.00040649454,0.0012340811,0.0007159357,0.000015485504],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010951483,0.00008344867,0.0008602381,0.000076869204,0.000088708475,0.0002263554,0.00088149094,0.0100556025,0.0006792887,0.042323194,0.000016127107,0.94469774],"study_design_scores_gemma":[0.0008671699,0.000765409,0.0059493417,0.0015651323,0.00016938035,0.00024736894,0.000001298699,0.5507469,0.022249024,0.41039968,0.0039421655,0.0030971186],"about_ca_topic_score_codex":0.000041556956,"about_ca_topic_score_gemma":0.000113389804,"teacher_disagreement_score":0.9416006,"about_ca_system_score_codex":0.00012903991,"about_ca_system_score_gemma":0.00030295743,"threshold_uncertainty_score":0.9997946},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024074537,0.00008076611,0.9973426,0.0005426935,0.0006794193,0.0006820272,0.000016588585,0.00036332526,0.000051842693],"genre_scores_gemma":[0.02942359,0.000006742436,0.96943367,0.000695916,0.00022557891,0.00006112221,0.0000074267205,0.000043235657,0.000102710765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968925,0.000027508308,0.00065328396,0.0011893611,0.000726834,0.00051050656],"domain_scores_gemma":[0.9963853,0.00071449386,0.00033745694,0.0020361543,0.00041625721,0.000110355526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008968408,0.00047691556,0.00064359256,0.0009316965,0.000120895405,0.00020725069,0.003738216,0.00030465884,0.0000064294563],"category_scores_gemma":[0.00013004307,0.00045655353,0.0002275815,0.00043222608,0.00037036574,0.00037956913,0.001299045,0.00046070994,0.000007214054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008189485,0.00004210844,0.000025244282,0.00015262661,0.000028507486,0.000022111788,0.0007721231,0.025006797,0.00084169774,0.092260666,0.00013102798,0.8807089],"study_design_scores_gemma":[0.0003486721,0.0004383287,0.000035894627,0.00044934804,0.000026498235,0.000043452474,1.4941977e-8,0.8585482,0.012138215,0.11156214,0.01560142,0.0008077912],"about_ca_topic_score_codex":0.000009626584,"about_ca_topic_score_gemma":0.000009875802,"teacher_disagreement_score":0.8799011,"about_ca_system_score_codex":0.0001526721,"about_ca_system_score_gemma":0.0002821128,"threshold_uncertainty_score":0.99978864},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001802981,0.00017793333,0.97893816,0.0010961789,0.00029831138,0.0005951427,0.0000018576765,0.00028829143,0.018423827],"genre_scores_gemma":[0.37040588,0.000056626952,0.6259857,0.0024486976,0.00059343525,0.000037246704,0.0000078734,0.000052161777,0.0004124192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631405,0.000056266133,0.00049260847,0.0016974114,0.00067260594,0.00076704076],"domain_scores_gemma":[0.9981272,0.00037999864,0.00019260445,0.0009351113,0.00014343672,0.00022164089],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006882524,0.0004894542,0.000502173,0.0007709302,0.0002178675,0.00051921734,0.0029742692,0.00022516266,0.0000091137135],"category_scores_gemma":[0.000035569916,0.00047100865,0.00008935189,0.0013966237,0.00030541478,0.00035518807,0.0014768797,0.001286829,0.00008959421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003294036,0.00009008639,0.00008578934,0.000036669942,0.0000071816107,0.000035470297,0.003489462,0.26177704,0.000086325446,0.3789369,0.00002030728,0.35543147],"study_design_scores_gemma":[0.0002945137,0.0001435936,0.00023665339,0.0004955205,0.000007170086,0.00010070317,0.0000010931145,0.89957887,0.00033799867,0.089555405,0.00826075,0.0009877546],"about_ca_topic_score_codex":0.000010432882,"about_ca_topic_score_gemma":0.00004258103,"teacher_disagreement_score":0.6378018,"about_ca_system_score_codex":0.00037878228,"about_ca_system_score_gemma":0.0002664197,"threshold_uncertainty_score":0.99977416},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001058777,0.00020638264,0.9927843,0.0005861392,0.0033683432,0.00044218788,0.000007831082,0.00020206672,0.0013439383],"genre_scores_gemma":[0.19455425,0.000059367077,0.8029797,0.0017944354,0.0004883877,0.0000062502913,0.000008462745,0.00003616759,0.0000729385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962161,0.00005401179,0.0006313474,0.0014738203,0.0010057546,0.0006189669],"domain_scores_gemma":[0.99724585,0.0007756181,0.00044686758,0.0010835822,0.00026499218,0.00018307197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081416446,0.0006055515,0.00059558335,0.0010637821,0.0007002069,0.0009430183,0.0015546709,0.00043254657,0.0000864474],"category_scores_gemma":[0.00018874303,0.0005473668,0.00016276311,0.00072127656,0.0007615613,0.0008130697,0.00046184633,0.0011518628,0.000028939623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001394117,0.000022186245,0.00034485233,0.000023454199,0.000014871459,0.000047657566,0.0006069505,0.3951462,0.004243504,0.013998867,0.0000052466407,0.5855323],"study_design_scores_gemma":[0.00071223325,0.00009816496,0.00011648152,0.00034940042,0.000010396447,0.00008461687,2.2089202e-7,0.9631619,0.0049086744,0.029343544,0.0004600903,0.0007542943],"about_ca_topic_score_codex":0.000067442284,"about_ca_topic_score_gemma":0.00047524917,"teacher_disagreement_score":0.584778,"about_ca_system_score_codex":0.00022672438,"about_ca_system_score_gemma":0.0006103067,"threshold_uncertainty_score":0.9996978},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000062269314,0.00021666192,0.99580693,0.00041286624,0.0005136362,0.0016910221,0.000019421239,0.00013028526,0.0012029696],"genre_scores_gemma":[0.003600881,0.000022099677,0.9938355,0.00009764468,0.0007178791,0.00004950072,0.000022725686,0.000082526385,0.0015712561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974082,0.000019934458,0.00047704548,0.0006631651,0.0007089127,0.0007227093],"domain_scores_gemma":[0.99723315,0.0012477136,0.00033000982,0.0006149035,0.0003913788,0.00018286044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007417373,0.00035186336,0.00042355215,0.00056407583,0.00032031804,0.00019888878,0.00080128195,0.0002640297,0.000058314872],"category_scores_gemma":[0.0006378214,0.00031883002,0.00011965766,0.00033322859,0.00055295613,0.00033531192,0.00023830541,0.0006215578,0.000017815642],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016444661,0.00010540421,0.00003756496,0.00024701247,0.000027052994,0.000004175573,0.0011453277,0.08987256,0.000049428447,0.017984672,0.00020830426,0.89030206],"study_design_scores_gemma":[0.0009086241,0.00027770235,0.000014115863,0.00064738456,0.00003810237,0.000048252863,7.711235e-7,0.5408062,0.0006124621,0.41969568,0.035904214,0.0010465293],"about_ca_topic_score_codex":0.000005341906,"about_ca_topic_score_gemma":0.000038970436,"teacher_disagreement_score":0.8892555,"about_ca_system_score_codex":0.00041159044,"about_ca_system_score_gemma":0.00036465217,"threshold_uncertainty_score":0.9999264},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066839484,0.0009988266,0.99601156,0.00045861947,0.0008629631,0.00055479247,0.000014400782,0.00013871561,0.00029174113],"genre_scores_gemma":[0.07318371,0.00019753257,0.92493695,0.0011013125,0.00031702974,0.00002208138,0.0000066722023,0.000045131477,0.00018959654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533665,0.00003224713,0.00084918435,0.0018536249,0.00093265803,0.0009956548],"domain_scores_gemma":[0.9970079,0.0007480091,0.00033004387,0.0011296977,0.00058769877,0.00019661964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001473387,0.00060626824,0.0006647852,0.0007543457,0.00027300924,0.00086431333,0.0032711297,0.0003342045,0.000010493141],"category_scores_gemma":[0.0002857036,0.00056324096,0.00010952308,0.0009335928,0.00033775033,0.001151969,0.0010146855,0.00064481166,0.000012372175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025314068,0.000044105444,0.0001010474,0.00010136937,0.0000060023945,0.00003055169,0.00047170746,0.30769953,0.00012426551,0.0024405788,0.000021771959,0.6889338],"study_design_scores_gemma":[0.0002929409,0.00013588107,0.00004477022,0.0009920711,0.0000058593237,0.000024804775,1.1837477e-7,0.7717099,0.0013817456,0.22376454,0.0010439757,0.00060338946],"about_ca_topic_score_codex":0.00005926765,"about_ca_topic_score_gemma":0.0009986133,"teacher_disagreement_score":0.68833035,"about_ca_system_score_codex":0.00037379964,"about_ca_system_score_gemma":0.0019565914,"threshold_uncertainty_score":0.9996819},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049759407,0.00042194428,0.99677044,0.00010287244,0.0008436937,0.00033612887,0.0000039583097,0.00009843054,0.00092493044],"genre_scores_gemma":[0.2885666,0.000014713186,0.71106195,0.00017751426,0.00012942863,0.000006368285,0.0000024786816,0.000023205985,0.000017725974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968932,0.00008757671,0.00060537056,0.00091158866,0.00093318976,0.0005690642],"domain_scores_gemma":[0.99727494,0.00023137164,0.0003735421,0.0014125321,0.0005644572,0.00014318468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011404557,0.00048016378,0.00056855683,0.0005754504,0.00016266298,0.00021577901,0.003190307,0.00026178546,0.000014808681],"category_scores_gemma":[0.0001086429,0.00038196912,0.00008105949,0.0006260835,0.000839832,0.0010233735,0.0010635037,0.0008211825,0.000007901329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019622898,0.000019512978,0.000039281837,0.000041673105,0.000018768416,0.000006869319,0.0027047603,0.45445624,0.000110499335,0.098140724,7.2454213e-7,0.44444132],"study_design_scores_gemma":[0.00016683662,0.0002278191,0.00005353387,0.00022326797,0.000011679888,0.000040129093,6.192347e-7,0.89554495,0.0037331155,0.09951485,0.000052361713,0.00043084688],"about_ca_topic_score_codex":0.000040563387,"about_ca_topic_score_gemma":0.000055973163,"teacher_disagreement_score":0.44401047,"about_ca_system_score_codex":0.00018557,"about_ca_system_score_gemma":0.0004719241,"threshold_uncertainty_score":0.9998632},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014664526,0.00009806401,0.99446565,0.0003684083,0.0003799505,0.0006613238,0.0000018364693,0.00018852504,0.0023697638],"genre_scores_gemma":[0.31345853,0.00012267452,0.6844915,0.0012836508,0.00019794442,0.000025298677,0.000015976153,0.00006223172,0.0003421738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962108,0.00007358069,0.0005321296,0.0014231914,0.0010329237,0.00072734064],"domain_scores_gemma":[0.9976352,0.0002177956,0.00024488737,0.001296776,0.00033254386,0.00027278424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053429184,0.0004764568,0.00044470935,0.001359485,0.00018645052,0.0010206096,0.0026899388,0.0002833973,0.000076111275],"category_scores_gemma":[0.000051865678,0.00039398661,0.000048614114,0.001299179,0.0003887504,0.0014240466,0.00097494264,0.0009027967,0.000067070796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009640391,0.000090291556,0.00024040036,0.000029874815,0.0000054195193,0.00015802264,0.001312369,0.50086796,0.00009682397,0.0021682298,0.000011074487,0.49500987],"study_design_scores_gemma":[0.0004940337,0.0007966341,0.001149687,0.0004979817,0.0000020278783,0.00003355464,1.995749e-7,0.9869409,0.00008943893,0.00917609,0.0002936174,0.00052582653],"about_ca_topic_score_codex":0.00007968872,"about_ca_topic_score_gemma":0.0003114822,"teacher_disagreement_score":0.49448404,"about_ca_system_score_codex":0.00029695494,"about_ca_system_score_gemma":0.0005330085,"threshold_uncertainty_score":0.9998512},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000080852136,0.00010909624,0.9914627,0.00058757875,0.002714407,0.001156687,0.000015542479,0.00040958842,0.0034635416],"genre_scores_gemma":[0.034860738,0.0000023134062,0.9610433,0.002777999,0.0009556287,0.000043606837,0.000017288563,0.0000775618,0.00022156484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99340916,0.000024297457,0.00084829476,0.002622635,0.0014729958,0.0016226376],"domain_scores_gemma":[0.9956748,0.0015390563,0.00031347421,0.0016582927,0.0002351247,0.0005792687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022472625,0.00084743527,0.0008867544,0.0018714493,0.0005119963,0.0007691459,0.0048517976,0.00055824564,0.0000042571223],"category_scores_gemma":[0.0002295816,0.00083807315,0.00019122669,0.0010458924,0.00044376575,0.00041174775,0.0015772906,0.0012894145,0.000049372782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020585296,0.0000302691,0.0001849108,0.000041063773,0.000020368458,0.0002471717,0.0025051392,0.4087162,0.00024796673,0.022760535,0.00007460441,0.56515115],"study_design_scores_gemma":[0.00055803586,0.00043033875,0.0005151537,0.00092107215,0.000017191049,0.00014241193,9.769526e-7,0.9434274,0.0010222676,0.04820241,0.0030597472,0.0017029956],"about_ca_topic_score_codex":0.000011164433,"about_ca_topic_score_gemma":0.000010873988,"teacher_disagreement_score":0.5634482,"about_ca_system_score_codex":0.00061677996,"about_ca_system_score_gemma":0.0006480898,"threshold_uncertainty_score":0.999407},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026997305,0.000040736046,0.9906284,0.000047980375,0.0018271528,0.00037013367,0.0000047270337,0.0003176741,0.0040634456],"genre_scores_gemma":[0.969482,0.0000041805015,0.029503228,0.00033401194,0.0003598607,0.00002099128,0.0000074177206,0.00005821588,0.00023009455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984096,0.0000082112065,0.00030644634,0.00047678957,0.0004584858,0.00034045512],"domain_scores_gemma":[0.999277,0.000033964967,0.000052242347,0.0004079686,0.00007500908,0.00015384764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027158743,0.00030648275,0.00027381282,0.00048834604,0.00014824576,0.0002086603,0.00059348275,0.00023633857,0.000046773213],"category_scores_gemma":[0.000010001329,0.00030593516,0.000060093847,0.00017382324,0.00011776732,0.00014291481,0.00013216455,0.0005715252,0.00033164764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018379558,0.0000068029894,0.0000070748456,0.00010133122,0.00000491551,0.000033182285,0.00089016574,0.41311187,0.0013751467,0.0058813915,0.00003485897,0.5785514],"study_design_scores_gemma":[0.00021054067,0.00008320449,0.0000737882,0.0008859852,0.0000101249,0.0000936013,9.946699e-7,0.98267156,0.0013564944,0.0028033017,0.011067363,0.00074302894],"about_ca_topic_score_codex":0.0000025169097,"about_ca_topic_score_gemma":0.000042864744,"teacher_disagreement_score":0.9667823,"about_ca_system_score_codex":0.00022616262,"about_ca_system_score_gemma":0.000047071848,"threshold_uncertainty_score":0.99993926},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035954366,0.00023113308,0.9798513,0.008745198,0.000980217,0.000639614,0.000017853776,0.00010629785,0.009068858],"genre_scores_gemma":[0.40837902,0.000030299758,0.5757771,0.013084567,0.0005857272,0.00003693296,0.000010574053,0.00007041714,0.0020253446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556273,0.00012053555,0.0006842594,0.0016223212,0.0013404397,0.000669733],"domain_scores_gemma":[0.99404234,0.0022152949,0.00052166026,0.0027310636,0.00034227734,0.00014733948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022774106,0.0005700393,0.0006146808,0.00037173173,0.0003467877,0.00039573343,0.0050795428,0.0003955773,0.0001558031],"category_scores_gemma":[0.00026708527,0.00039565575,0.00019711263,0.00043698886,0.0009060867,0.00039338964,0.0013020283,0.0013097374,0.00010010888],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003702909,0.000108601336,0.00030700653,0.00021866578,0.000052350435,0.000040833547,0.007829466,0.010692661,0.00034745372,0.08344627,0.0039942362,0.89292544],"study_design_scores_gemma":[0.00030092275,0.000492777,0.00037596334,0.001356543,0.000015225038,0.00003948355,6.2604107e-7,0.52435213,0.0062696165,0.45925125,0.006535805,0.0010096633],"about_ca_topic_score_codex":0.00010353538,"about_ca_topic_score_gemma":0.000013659602,"teacher_disagreement_score":0.89191574,"about_ca_system_score_codex":0.00019252775,"about_ca_system_score_gemma":0.0005379725,"threshold_uncertainty_score":0.99984956},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000057574803,0.00031966274,0.9921681,0.00086059293,0.00079374353,0.00035763453,0.0000065589934,0.00016026589,0.005327681],"genre_scores_gemma":[0.055207625,0.00007687527,0.9371431,0.0041425326,0.000199668,0.000008307548,0.0000158818,0.000055365967,0.0031506668],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99649626,0.000048637485,0.0006454249,0.0011292043,0.0012169507,0.00046352824],"domain_scores_gemma":[0.9972182,0.00028458526,0.00048497468,0.0014341872,0.00044094125,0.00013713758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080903375,0.0004174241,0.00052640954,0.000650787,0.00012194248,0.00024071717,0.0027910469,0.00031229167,0.000063606596],"category_scores_gemma":[0.00012709857,0.00037891002,0.00016550282,0.0008488324,0.0010122127,0.00045005194,0.0004176972,0.000545846,0.000040163068],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000561821,0.0002664352,0.00010234971,0.0002377304,0.000048854,0.00014191658,0.00067733246,0.0024186396,0.009620938,0.16240215,0.0009234449,0.823104],"study_design_scores_gemma":[0.0007990243,0.0006646273,0.00007212803,0.00078091683,0.000019802992,0.000045091954,1.4001758e-7,0.120083004,0.6465387,0.2041557,0.02546626,0.0013746101],"about_ca_topic_score_codex":0.0000035310059,"about_ca_topic_score_gemma":0.0000015271684,"teacher_disagreement_score":0.8217294,"about_ca_system_score_codex":0.00024272173,"about_ca_system_score_gemma":0.0006301501,"threshold_uncertainty_score":0.9998663},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005633726,0.0005088438,0.9972793,0.000082899496,0.0006515499,0.00024059374,0.0000036559688,0.00013397752,0.00053583604],"genre_scores_gemma":[0.114498265,0.00007050322,0.88489693,0.00015767835,0.00019490365,0.000003591282,0.0000031527834,0.000024386687,0.00015059648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967445,0.000078543686,0.0007005264,0.0012930303,0.00076606387,0.00041731758],"domain_scores_gemma":[0.9969846,0.00060608075,0.0006005712,0.0015652173,0.00015743279,0.00008611187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042537102,0.00048486807,0.00076570566,0.00083990267,0.00013396244,0.00034318867,0.0025537333,0.00026306545,0.000020275482],"category_scores_gemma":[0.000086664426,0.00042649612,0.00021294653,0.0005386478,0.00042387322,0.0011370428,0.0017500048,0.00052338827,0.0000026567698],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018966433,0.000022638958,0.0000892818,0.000024046207,0.000019546493,0.0000136060935,0.00036157214,0.020896247,0.0037690157,0.0042142724,8.5066836e-7,0.970587],"study_design_scores_gemma":[0.00009476092,0.000053300773,0.000107358945,0.00047484413,0.000018563243,0.000008121784,9.316832e-8,0.7711266,0.03163757,0.19602147,0.000062840285,0.00039446098],"about_ca_topic_score_codex":0.000067129986,"about_ca_topic_score_gemma":0.000059083064,"teacher_disagreement_score":0.97019255,"about_ca_system_score_codex":0.00040861688,"about_ca_system_score_gemma":0.00009531182,"threshold_uncertainty_score":0.9998187},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007184148,0.00029866342,0.99044514,0.0008892911,0.00095016,0.00041829154,0.0000024466242,0.00013137708,0.0067927875],"genre_scores_gemma":[0.561012,0.000015641488,0.4347427,0.0028577694,0.00043459077,0.00002862842,0.0000040466994,0.000053973614,0.0008506338],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964296,0.000044160606,0.00043020674,0.0012956959,0.0012019105,0.0005984212],"domain_scores_gemma":[0.9972364,0.000659118,0.00030181368,0.0013216459,0.00033942028,0.00014161912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057906174,0.0005008444,0.0003783677,0.00039337634,0.00040316128,0.000535609,0.004415895,0.00017780405,0.00006633921],"category_scores_gemma":[0.000046841542,0.0003301889,0.00009094375,0.00046754922,0.0017538037,0.0004465069,0.0011432455,0.00069792947,0.00018264136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002181945,0.00006531742,0.0000830615,0.000019093255,0.000036711244,0.0002038588,0.007182381,0.17202236,0.000032914446,0.2007433,0.00016436477,0.6194248],"study_design_scores_gemma":[0.00011793907,0.0003160583,0.00011522293,0.00024204385,0.00001088253,0.00012851201,0.0000010447695,0.45775023,0.0024964188,0.5359174,0.0021179079,0.0007863518],"about_ca_topic_score_codex":0.000040171704,"about_ca_topic_score_gemma":0.00005215515,"teacher_disagreement_score":0.61863846,"about_ca_system_score_codex":0.00019629327,"about_ca_system_score_gemma":0.0005547405,"threshold_uncertainty_score":0.999915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006711829,0.0007623618,0.98601985,0.0003252294,0.0025848043,0.00040695406,5.652339e-7,0.00018697443,0.009646129],"genre_scores_gemma":[0.9155948,0.000023924202,0.08301249,0.0006988879,0.00040242856,0.000010625684,0.0000037350235,0.00003516134,0.00021793683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959974,0.000034612272,0.000679624,0.0014328279,0.0009150411,0.0009404537],"domain_scores_gemma":[0.99802583,0.00019312622,0.0003060401,0.0011604872,0.0001489556,0.00016554214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011626709,0.0005376407,0.00062131445,0.0010080435,0.00023109849,0.0007883476,0.0028847156,0.00039927947,0.00000958507],"category_scores_gemma":[0.00006643789,0.0004747676,0.00013810772,0.00093175145,0.00042785538,0.0007958683,0.0012036206,0.00086400047,0.00005047233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031733891,0.00003261376,0.00022492827,0.00008150751,0.000006440672,0.0003088339,0.0015908129,0.026521832,0.000026984464,0.60329473,0.0000033422637,0.36790478],"study_design_scores_gemma":[0.00066043687,0.00018783084,0.00020244918,0.00035581313,0.0000063020375,0.00019435518,8.3896475e-7,0.17669451,0.00048264404,0.8178251,0.0023349295,0.0010548065],"about_ca_topic_score_codex":0.00038160876,"about_ca_topic_score_gemma":0.0005774851,"teacher_disagreement_score":0.9155277,"about_ca_system_score_codex":0.00075606914,"about_ca_system_score_gemma":0.000799917,"threshold_uncertainty_score":0.9997704},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081965044,0.00007411456,0.9158947,0.0000072500115,0.00046604028,0.0003580937,0.000028478,0.00025131548,0.00095496495],"genre_scores_gemma":[0.99032694,0.000008304836,0.009522906,0.000014855133,0.00006471962,0.0000050313674,0.00003715849,0.000018103525,0.0000020047996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852014,0.000015508575,0.0005728061,0.00021856133,0.00042482626,0.0002481441],"domain_scores_gemma":[0.9986808,0.00009981517,0.0002635461,0.0005682048,0.00033406838,0.000053570286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043250193,0.00026310334,0.00036194638,0.00076705683,0.000063421605,0.000050404706,0.00048788782,0.00036318667,0.000009659328],"category_scores_gemma":[0.00008833822,0.00023102481,0.00008196498,0.00044188343,0.00028117534,0.0007766568,0.000078553545,0.00035521647,0.0000075538396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019290383,0.000017118542,0.0014878863,0.0004098047,0.000014039387,6.212026e-7,0.000915951,0.86007184,0.00020453334,0.0024781257,0.0000024326112,0.13437836],"study_design_scores_gemma":[0.00046912054,0.0005815186,0.014139268,0.0013228474,0.000027494749,0.00001928249,0.000006900406,0.94015974,0.040206823,0.002484019,0.00002578432,0.0005572099],"about_ca_topic_score_codex":0.00004481422,"about_ca_topic_score_gemma":0.0000065753184,"teacher_disagreement_score":0.90836185,"about_ca_system_score_codex":0.00058582827,"about_ca_system_score_gemma":0.00012422679,"threshold_uncertainty_score":0.9420918},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010154806,0.00006867728,0.9959447,0.0007304101,0.0004713379,0.00040774283,0.0000063074885,0.00042096726,0.001939712],"genre_scores_gemma":[0.09344575,0.000040397495,0.8968441,0.007913958,0.0005511807,0.00001779435,0.000048894726,0.00005494419,0.0010830091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964693,0.000049771515,0.0004953381,0.0013997362,0.0010077031,0.00057815877],"domain_scores_gemma":[0.998034,0.00015593569,0.0002676129,0.0010301772,0.000327955,0.00018429011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073500274,0.0005172986,0.00044526538,0.0010014555,0.00028298952,0.00073832524,0.0026547294,0.00035976028,0.00004065563],"category_scores_gemma":[0.0000820571,0.00047357802,0.00014124649,0.0010813464,0.00038729206,0.000647333,0.0004670223,0.00073739485,0.000050527593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056972926,0.00009117987,0.000072753275,0.000043254273,0.00000897111,0.0000725489,0.00042110612,0.024952631,0.0006392559,0.03931618,0.00029478013,0.9340816],"study_design_scores_gemma":[0.00024641576,0.0003380615,0.0002053889,0.00037621506,0.000010578579,0.00008248114,1.3100109e-7,0.9461545,0.0016894048,0.042932715,0.0071216165,0.0008424929],"about_ca_topic_score_codex":0.000014276819,"about_ca_topic_score_gemma":0.000038447124,"teacher_disagreement_score":0.93323916,"about_ca_system_score_codex":0.0003548616,"about_ca_system_score_gemma":0.00074413384,"threshold_uncertainty_score":0.9997716},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038192342,0.00065303344,0.99414235,0.00007124006,0.00024847972,0.0004540342,0.000032510146,0.000048010665,0.0005311034],"genre_scores_gemma":[0.80522627,0.000033524182,0.19441259,0.00008114958,0.000060216425,0.000025536103,0.000026339028,0.000019930632,0.00011446362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969542,0.00006604298,0.00073777145,0.0010510987,0.0008046749,0.00038623594],"domain_scores_gemma":[0.9975777,0.0003600567,0.0006018528,0.00077163306,0.0005883458,0.00010039534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006971341,0.0003603473,0.0005179343,0.0003547841,0.00034124585,0.00008244106,0.0017138273,0.00023049646,0.000019314462],"category_scores_gemma":[0.00006304224,0.0003579715,0.00011144014,0.0006227399,0.0009420969,0.0006373446,0.0008904117,0.00070551934,0.0000033668896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021237634,0.0009782597,0.0044300994,0.0002988716,0.000062859326,0.000021702468,0.0020053638,0.270831,0.06936593,0.09117073,0.000109902845,0.56070405],"study_design_scores_gemma":[0.00050167594,0.00045705892,0.0025942868,0.0003447621,0.000027377944,0.000054847602,0.00000338,0.9633388,0.008858956,0.022490382,0.00045629422,0.0008721864],"about_ca_topic_score_codex":0.000170332,"about_ca_topic_score_gemma":0.000011594386,"teacher_disagreement_score":0.80140704,"about_ca_system_score_codex":0.00032392112,"about_ca_system_score_gemma":0.00048187329,"threshold_uncertainty_score":0.9998872},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017769487,0.0006389498,0.99686176,0.00082140043,0.0004261158,0.0007649756,0.000015188307,0.0001204459,0.00033337838],"genre_scores_gemma":[0.004257345,0.000052795065,0.99378633,0.0015099063,0.00018247879,0.00002398271,0.0000058246956,0.000025468631,0.00015586671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736375,0.000065047934,0.00041314482,0.0013118982,0.00036958794,0.00047656838],"domain_scores_gemma":[0.9976584,0.00077598647,0.00021728918,0.00095253735,0.00022539431,0.0001704015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009120641,0.00041206658,0.0003936418,0.00075981696,0.0003810636,0.00045441723,0.0013834916,0.00028022128,0.0000051381708],"category_scores_gemma":[0.00010486177,0.00036680678,0.0001458444,0.00057539344,0.0005595584,0.0003956934,0.00038415304,0.00038868812,0.0000041927447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056830004,0.000044019092,0.000035344274,0.00003307393,0.000012984037,0.0000043789123,0.0006313007,0.121652626,0.00017915582,0.018702738,0.000014060779,0.85868466],"study_design_scores_gemma":[0.0003690076,0.00012440493,0.00022054647,0.0001400256,0.000015384956,0.0000336425,1.4819821e-7,0.9190271,0.00078999356,0.07648969,0.0023365559,0.00045350508],"about_ca_topic_score_codex":0.000021315269,"about_ca_topic_score_gemma":0.000032483815,"teacher_disagreement_score":0.8582311,"about_ca_system_score_codex":0.000078380916,"about_ca_system_score_gemma":0.00016245115,"threshold_uncertainty_score":0.9998784},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000287899,0.00032560827,0.993588,0.0003027705,0.0020806938,0.00037114305,0.0000017088166,0.00018111411,0.0028610746],"genre_scores_gemma":[0.054482143,0.00013917146,0.94427997,0.00041644782,0.00038486483,0.000014873357,0.0000039445586,0.000026807747,0.00025176594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657524,0.00007915673,0.00065079564,0.0012541267,0.00086081395,0.0005798676],"domain_scores_gemma":[0.9973631,0.0006483767,0.00040358907,0.0012549484,0.0002228269,0.00010719091],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013653004,0.0003981955,0.000435232,0.001243663,0.00028068974,0.00029720968,0.0025696892,0.00035142177,0.000011959437],"category_scores_gemma":[0.00045516223,0.000403152,0.00009574264,0.00095612055,0.0004758011,0.0014602732,0.00072254374,0.00096323964,0.00006671681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048404386,0.00003941397,0.00010695016,0.000034770568,0.000005432946,0.000052051862,0.0019682536,0.051159084,0.0003128169,0.022276623,0.00001037003,0.9240294],"study_design_scores_gemma":[0.00018325359,0.00009670285,0.00047772637,0.0002723339,0.0000038615713,0.000057986283,3.6030463e-7,0.96994007,0.0019955083,0.025066398,0.0013988308,0.00050696137],"about_ca_topic_score_codex":0.00005520115,"about_ca_topic_score_gemma":0.00016205835,"teacher_disagreement_score":0.9235224,"about_ca_system_score_codex":0.00045548496,"about_ca_system_score_gemma":0.00046422763,"threshold_uncertainty_score":0.99984205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001725479,0.0005797571,0.9968075,0.00027204677,0.00044239438,0.00030649506,0.000003076928,0.0002516207,0.0013198366],"genre_scores_gemma":[0.3007189,0.00019673254,0.6975048,0.00046240678,0.00027942666,0.0000109363245,0.0000018015178,0.000028978737,0.00079599506],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99719423,0.00002975117,0.00056343974,0.0010470601,0.0007744406,0.0003910691],"domain_scores_gemma":[0.99810433,0.00020234205,0.00039637892,0.00084021874,0.00035996872,0.00009673827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006927995,0.00037783833,0.0004301897,0.0008152364,0.00014982036,0.00020676391,0.0024885149,0.00030427586,0.000020597337],"category_scores_gemma":[0.00009444177,0.00033781867,0.00014044011,0.0006855391,0.0005716013,0.0005801324,0.00070096226,0.00053896446,0.000034577326],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029677258,0.000026783406,0.0000069502335,0.000024865034,0.000005198531,0.0000065933373,0.00022213235,0.0002720051,0.010984178,0.0030873928,0.0000013127348,0.9853596],"study_design_scores_gemma":[0.00027804397,0.000244554,0.0005517926,0.00032858617,0.000009627511,0.000061093495,1.6121737e-7,0.43746072,0.52830994,0.027366528,0.0046014553,0.0007875214],"about_ca_topic_score_codex":0.00001656002,"about_ca_topic_score_gemma":0.000042210904,"teacher_disagreement_score":0.9845721,"about_ca_system_score_codex":0.00023792069,"about_ca_system_score_gemma":0.00036363953,"threshold_uncertainty_score":0.9999074},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011939843,0.0003871063,0.9914811,0.0009611187,0.0008157597,0.00034006292,0.0000017504781,0.000099216384,0.0047199046],"genre_scores_gemma":[0.5815081,0.000095928066,0.41587326,0.0016876778,0.00033721182,0.000007595139,0.000003306503,0.00003099684,0.0004559531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664843,0.000041359366,0.0006695838,0.0012847463,0.00070880534,0.00064708735],"domain_scores_gemma":[0.9982011,0.00040764644,0.00025311616,0.0008590041,0.00012634647,0.00015282576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007112198,0.00044184524,0.00046834844,0.0009285685,0.00026179117,0.00082943134,0.0020596718,0.00024337383,0.000020991358],"category_scores_gemma":[0.00008576494,0.00044250523,0.000071738345,0.00057391194,0.00053173717,0.00086977717,0.0009869785,0.0008490171,0.000033248998],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025782272,0.000039319777,0.00061383256,0.000015592132,0.0000044036346,0.00016017431,0.0010801951,0.047056172,0.00014710719,0.054092295,0.000006827585,0.8967815],"study_design_scores_gemma":[0.00012072196,0.00015181366,0.0013568128,0.0007917081,0.000004147536,0.00010917097,9.137995e-7,0.6147805,0.0006772668,0.38069567,0.00065750524,0.0006537906],"about_ca_topic_score_codex":0.00009115558,"about_ca_topic_score_gemma":0.0005106678,"teacher_disagreement_score":0.8961277,"about_ca_system_score_codex":0.00040073018,"about_ca_system_score_gemma":0.0002255912,"threshold_uncertainty_score":0.99980265},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031615888,0.000097523174,0.9942275,0.0003367634,0.0037222367,0.0006111275,0.000005866124,0.0008814415,0.00008592477],"genre_scores_gemma":[0.0022412017,0.000011542873,0.9963671,0.0004039112,0.00060477597,0.00006907489,0.000022768263,0.00003737216,0.0002422346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969293,0.000026506797,0.0005122176,0.0011857593,0.0007457639,0.0006004856],"domain_scores_gemma":[0.9960543,0.0017560233,0.00032664582,0.0014279232,0.0003009529,0.00013415588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019729626,0.0004271208,0.00041655332,0.0005738979,0.0001828109,0.0007377754,0.003160026,0.00042657004,0.000007703176],"category_scores_gemma":[0.0014775927,0.00042690997,0.00012894017,0.0006636355,0.00014346914,0.0011575136,0.0007668065,0.00088484626,0.0000120322675],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076175206,0.000046771052,0.00009191404,0.00026787113,0.000017054677,0.000011205745,0.00031997648,0.028021194,0.0003858566,0.008663703,0.00029847625,0.96186835],"study_design_scores_gemma":[0.00048186403,0.00034541992,0.00045615,0.00047031936,0.000017147993,0.000042272408,4.2803585e-8,0.7366503,0.0039905272,0.15565692,0.10033356,0.0015554915],"about_ca_topic_score_codex":0.000015996799,"about_ca_topic_score_gemma":0.000018485622,"teacher_disagreement_score":0.96031284,"about_ca_system_score_codex":0.00038175858,"about_ca_system_score_gemma":0.00079030765,"threshold_uncertainty_score":0.99981827},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4462154,0.00009523573,0.55302554,0.00035166106,0.000088965084,0.00020247519,4.997548e-7,0.000013688695,0.000006534204],"genre_scores_gemma":[0.68634236,5.08134e-7,0.31331107,0.0002967867,0.00003357536,0.0000049097043,0.0000061412734,0.000004258428,4.1840664e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990276,0.00004780572,0.00023978464,0.00030728857,0.00015312276,0.00022439487],"domain_scores_gemma":[0.9990138,0.0006691791,0.000084675245,0.00014366714,0.00005437879,0.00003430536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022414004,0.00010805267,0.000268799,0.0001065291,0.00007158853,0.000018250004,0.00011955416,0.00004838214,0.000005564247],"category_scores_gemma":[0.00019673553,0.00007550839,0.000055969456,0.00032947402,0.00012950017,0.00004383993,0.000053286025,0.00009036315,4.550185e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007628138,0.0006383165,0.38311824,0.000049964263,0.0000064372775,0.0000035197827,0.00024123915,0.06264278,0.05403831,0.0001314475,0.000011969206,0.4990415],"study_design_scores_gemma":[0.0007888976,0.0004866634,0.18580434,0.000018028162,0.000010699768,0.0000012005322,4.6480378e-7,0.7561974,0.034458622,0.022162193,0.000008163322,0.00006333983],"about_ca_topic_score_codex":0.000021372674,"about_ca_topic_score_gemma":0.000015207398,"teacher_disagreement_score":0.6935546,"about_ca_system_score_codex":0.00003816855,"about_ca_system_score_gemma":0.000018209885,"threshold_uncertainty_score":0.3079143},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013597061,0.000060303224,0.98411715,0.0012303743,0.0004147127,0.00018184145,3.085585e-7,0.00033139074,0.00006685995],"genre_scores_gemma":[0.43290177,0.000011113159,0.56586146,0.0011646239,0.000051218718,0.0000032606258,5.210457e-7,0.000003404761,0.0000026087064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976074,0.000086946864,0.0003232678,0.0007207307,0.0008363591,0.00042525784],"domain_scores_gemma":[0.9986628,0.0002519566,0.000104884995,0.00069902156,0.0001149336,0.00016636254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063959876,0.00016190764,0.00017160166,0.00012348633,0.00025349914,0.0002020415,0.0017263239,0.00007300635,0.000014969489],"category_scores_gemma":[0.0002523146,0.00014392253,0.00003914945,0.0020199227,0.00069603615,0.0010833354,0.00039853234,0.00027109124,0.000025451613],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043234945,0.00013800949,0.004641663,0.000011364897,0.0000028474476,0.00019301419,0.002078765,0.018298673,0.026751665,0.00038455523,0.00030705263,0.9471881],"study_design_scores_gemma":[0.00023370313,0.00014625656,0.004531471,0.000035399007,9.555179e-7,0.00021614342,7.36616e-7,0.76981723,0.21910912,0.0055812793,0.00004502692,0.0002827057],"about_ca_topic_score_codex":0.000055830897,"about_ca_topic_score_gemma":0.0000156477,"teacher_disagreement_score":0.9469054,"about_ca_system_score_codex":0.00013254186,"about_ca_system_score_gemma":0.00031135074,"threshold_uncertainty_score":0.58689904},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002776553,0.0004268433,0.9944002,0.0020798335,0.00023940895,0.00020201538,0.000020976648,0.0001686768,0.0021843854],"genre_scores_gemma":[0.3696863,0.0017892477,0.5947721,0.018616041,0.0007467992,0.00007852588,0.0001290252,0.00014764219,0.014034296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953352,0.00011018004,0.0005794333,0.0020162503,0.0012426295,0.0007162677],"domain_scores_gemma":[0.9974604,0.000554355,0.00029557876,0.0009749752,0.00032598525,0.00038867263],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006042456,0.00063058466,0.000927808,0.0018380532,0.0004597889,0.00068164454,0.0026742609,0.0003035864,0.00015097114],"category_scores_gemma":[0.00018767867,0.0005836805,0.00040461056,0.0024922034,0.0006061679,0.0005111566,0.0009101898,0.0007858895,0.00032928726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060455127,0.00007474894,0.000260879,0.000019721956,0.00042401525,0.0000772179,0.0029075812,0.22326858,0.0014706346,0.00027044775,0.006485856,0.76473427],"study_design_scores_gemma":[0.00013111124,0.00012105195,0.000035315585,0.000110879904,0.00012624006,0.000013256179,0.0000010338678,0.96982807,0.010799614,0.0016714898,0.016044123,0.0011178262],"about_ca_topic_score_codex":0.00006560119,"about_ca_topic_score_gemma":0.00011552739,"teacher_disagreement_score":0.76361644,"about_ca_system_score_codex":0.00029060658,"about_ca_system_score_gemma":0.00027035316,"threshold_uncertainty_score":0.99966145},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01079683,0.0011192939,0.97479457,0.0003343944,0.0005544801,0.00029108836,0.0000085619295,0.000060920618,0.012039845],"genre_scores_gemma":[0.8700588,0.00009839558,0.11946062,0.00042370002,0.0006033455,0.000008110575,0.000009979896,0.000049287442,0.0092877885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947435,0.00010067425,0.0005383355,0.0015415255,0.0024759548,0.00060001266],"domain_scores_gemma":[0.9957634,0.002051891,0.0002438155,0.0010601728,0.0006661041,0.00021459236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005185723,0.00039178345,0.0005461943,0.0016389848,0.00047405806,0.0009965026,0.001415683,0.00025743,0.00022968806],"category_scores_gemma":[0.0006163543,0.0002770051,0.00007405121,0.001264525,0.0014899917,0.0005219871,0.00049306185,0.0006900054,0.00010644444],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012652668,0.000029242805,0.000682322,0.000010289531,0.000014985255,0.000071291666,0.0010083297,0.034346797,0.00008872408,0.0013169649,0.000022645736,0.9623957],"study_design_scores_gemma":[0.0018210651,0.0010236304,0.018097024,0.0013548394,0.0001502968,0.001133861,0.000019869063,0.73716277,0.005078076,0.22783214,0.0034348161,0.0028916353],"about_ca_topic_score_codex":0.000026344469,"about_ca_topic_score_gemma":0.00009139616,"teacher_disagreement_score":0.9595041,"about_ca_system_score_codex":0.00011915178,"about_ca_system_score_gemma":0.00045232615,"threshold_uncertainty_score":0.99996823},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000110338015,0.00018908687,0.98508745,0.001661354,0.0011105081,0.0006380625,0.0000018422096,0.00019100704,0.011109643],"genre_scores_gemma":[0.2200319,0.000020859612,0.77082604,0.007254215,0.0004949348,0.000028471572,0.000015297794,0.00007542592,0.0012528233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943141,0.000091597656,0.0006386798,0.0015845979,0.0025217948,0.00084927987],"domain_scores_gemma":[0.996359,0.00033456247,0.0004353857,0.002028227,0.0006291032,0.00021375946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019038559,0.0006310703,0.00049312215,0.0016122299,0.00033148125,0.0007679187,0.0035801984,0.00038749023,0.00003834118],"category_scores_gemma":[0.0004337212,0.00061547616,0.00016851905,0.0009622765,0.0006028542,0.000673201,0.0006955024,0.0009059838,0.00009933289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018977635,0.000009470249,0.000013133174,0.000019432775,0.0000048605707,0.0000072208354,0.00017441862,0.8183084,0.000024876012,0.02077237,0.000027851378,0.16063608],"study_design_scores_gemma":[0.00033366526,0.00013151082,0.000015575866,0.00019789688,0.000011331803,0.000012518207,4.71722e-8,0.91552335,0.00033941906,0.08215408,0.00069786125,0.00058275514],"about_ca_topic_score_codex":0.00001418567,"about_ca_topic_score_gemma":0.000013522307,"teacher_disagreement_score":0.22002088,"about_ca_system_score_codex":0.0010470893,"about_ca_system_score_gemma":0.00297138,"threshold_uncertainty_score":0.9996297},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000129666905,0.0001955938,0.9856036,0.0005958552,0.0015303881,0.0005901037,0.00018846069,0.010577665,0.00070542376],"genre_scores_gemma":[0.015266763,0.000021645561,0.9815502,0.0025137172,0.00027237178,0.000024106026,0.0001423129,0.000068551504,0.00014033011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994873,0.000032624965,0.00067780545,0.0025864292,0.0009426525,0.0008875127],"domain_scores_gemma":[0.9930096,0.0020775541,0.00040338695,0.0039471346,0.0003436309,0.00021869219],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016017541,0.00067181926,0.0006746336,0.0006368287,0.00034532495,0.0009428095,0.007350975,0.00040377676,0.000022433327],"category_scores_gemma":[0.0016458903,0.0006410897,0.00010376407,0.0005386778,0.0004523669,0.00086936995,0.002993515,0.0006256827,0.000027865042],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053835756,0.00008768535,0.00044962156,0.000084300525,0.000028085129,0.00016868892,0.00051764515,0.0013405388,0.00014479959,0.001247177,0.014676909,0.98124915],"study_design_scores_gemma":[0.00018809333,0.0001987154,0.00010830749,0.0004021149,0.000012740557,0.00006227405,2.3337684e-8,0.7226633,0.00095991767,0.27029863,0.004389282,0.0007166048],"about_ca_topic_score_codex":0.00010663139,"about_ca_topic_score_gemma":0.000044901106,"teacher_disagreement_score":0.9805326,"about_ca_system_score_codex":0.00025896507,"about_ca_system_score_gemma":0.0009833673,"threshold_uncertainty_score":0.99960405},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009927542,0.000025750185,0.9730914,0.024806164,0.00020156548,0.0006247946,0.0000010018089,0.00023385655,0.000022687436],"genre_scores_gemma":[0.45260528,0.0000017238835,0.5404938,0.0068033417,0.000045185378,0.00004117241,0.0000022037968,0.0000042166394,0.0000030901115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734634,0.00010476946,0.00045112753,0.0009508254,0.00058982306,0.00055709266],"domain_scores_gemma":[0.99827933,0.00044723862,0.00015146776,0.00082068273,0.0001496046,0.00015169165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013264968,0.00019999966,0.00022604645,0.0005504732,0.00013468825,0.0003231231,0.0018611468,0.00011288452,0.0000019172198],"category_scores_gemma":[0.00046699616,0.0001899236,0.000060665378,0.0018921543,0.00026076994,0.0008258578,0.00013619184,0.00024228249,0.000004211579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010989563,0.00010387325,0.00042057506,0.000011166078,6.8456563e-7,0.000010397086,0.0006918951,0.026737427,0.0034162172,0.0006812778,0.00043336087,0.96748215],"study_design_scores_gemma":[0.00042164593,0.00013955298,0.0020780936,0.00006064873,0.0000010383873,0.0000050272756,4.5569087e-7,0.94442785,0.012691732,0.039951857,0.000011496913,0.0002105927],"about_ca_topic_score_codex":0.000015923917,"about_ca_topic_score_gemma":0.000024777153,"teacher_disagreement_score":0.96727157,"about_ca_system_score_codex":0.00025409806,"about_ca_system_score_gemma":0.00045398422,"threshold_uncertainty_score":0.77448595},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002613555,0.0001652005,0.9968516,0.000109175,0.0009270357,0.0008924651,0.00007535325,0.00041443555,0.000303355],"genre_scores_gemma":[0.3507829,0.000013612707,0.64809614,0.0001763798,0.0005880253,0.0000999902,0.000039034734,0.000052657426,0.00015125332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967172,0.000012616726,0.0004469718,0.001827608,0.0004960879,0.00049947377],"domain_scores_gemma":[0.9967983,0.0006568994,0.0002615772,0.0020438628,0.00012808345,0.00011127458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054251,0.00045328477,0.00043034073,0.0009246281,0.0002765073,0.00060220255,0.0033067188,0.0003003462,0.0000030159129],"category_scores_gemma":[0.00012310273,0.00045127905,0.00013137049,0.0008840976,0.00016370922,0.0008149208,0.0014572416,0.0005490439,0.000011026504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069097864,0.000030490473,0.00003892895,0.000034596662,0.00002150484,0.000006682596,0.00009715256,0.059664644,0.0013623228,0.0021868718,0.000038135124,0.93651175],"study_design_scores_gemma":[0.0002085596,0.00012477962,0.00031546503,0.00011467744,0.000017180306,0.000011194283,8.56197e-8,0.9640335,0.009815433,0.020297665,0.00448598,0.0005755198],"about_ca_topic_score_codex":0.00019219435,"about_ca_topic_score_gemma":0.00008571655,"teacher_disagreement_score":0.9359362,"about_ca_system_score_codex":0.00040217827,"about_ca_system_score_gemma":0.00015345562,"threshold_uncertainty_score":0.9997939},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008189301,0.000048215657,0.98792046,0.00019913964,0.00011418841,0.0007306899,0.000044847846,0.00007093772,0.0026822083],"genre_scores_gemma":[0.9701922,0.000008265345,0.028964221,0.0005868849,0.000055898832,0.000027155593,0.00014979503,0.00000189053,0.000013722728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989816,0.000015949612,0.0002611114,0.00033522636,0.00020496463,0.00020116539],"domain_scores_gemma":[0.9991657,0.00021704902,0.00026174047,0.00010260689,0.00021743216,0.000035487363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036069175,0.00018913615,0.00023794854,0.00009984576,0.00014712011,0.00005251513,0.00034387986,0.00032944506,0.000018329243],"category_scores_gemma":[0.000081248916,0.00008940366,0.000043931843,0.00017521459,0.00025957325,0.00020426385,0.00007155451,0.0001557705,0.000002154377],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003454329,0.00012001542,0.00092644186,0.0001704355,0.000017091053,7.2673026e-7,0.00029916648,0.037660565,0.008036705,0.031260096,0.000015382437,0.92114794],"study_design_scores_gemma":[0.0007751954,0.0023221949,0.0034102285,0.00018674004,0.00005204913,0.0000046154614,0.0000018030153,0.576674,0.0057269386,0.40992105,0.0002988413,0.0006263471],"about_ca_topic_score_codex":0.000027592414,"about_ca_topic_score_gemma":0.00007475845,"teacher_disagreement_score":0.9620029,"about_ca_system_score_codex":0.00003326816,"about_ca_system_score_gemma":0.00003456293,"threshold_uncertainty_score":0.3645775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035243752,0.00016017946,0.99736726,0.00057364255,0.0003122723,0.00035907366,0.000002169457,0.00025879144,0.00061414763],"genre_scores_gemma":[0.5510228,0.00004471003,0.44814527,0.00035657495,0.0003303656,0.000008253452,9.667955e-7,0.00001807722,0.00007294105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758327,0.000021159094,0.00035900687,0.0011935272,0.00046175483,0.0003813082],"domain_scores_gemma":[0.9985336,0.000087926805,0.00023155582,0.0008585285,0.00014021508,0.00014817677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039375992,0.00036409625,0.00030348139,0.00060221914,0.00047829,0.00042407357,0.0011081654,0.00035192815,0.000020093046],"category_scores_gemma":[0.000015587013,0.000357173,0.00008253248,0.00052682025,0.0003673192,0.0005717962,0.00087075506,0.000654329,0.000010162846],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018384704,0.000014689505,0.000014009195,0.000016517497,0.0000035357298,0.000007830953,0.00026698076,0.00389809,0.0023969053,0.0055377455,0.0000030423473,0.9878388],"study_design_scores_gemma":[0.00010473517,0.000094772484,0.00005496056,0.00012110669,0.000007291664,0.0001898139,2.1316161e-7,0.8864354,0.010171041,0.09881891,0.0035220536,0.0004796942],"about_ca_topic_score_codex":0.0000409552,"about_ca_topic_score_gemma":0.00024086685,"teacher_disagreement_score":0.9873591,"about_ca_system_score_codex":0.00026483374,"about_ca_system_score_gemma":0.00015047172,"threshold_uncertainty_score":0.999888},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000111881345,0.00028889326,0.9942758,0.00031343978,0.0021174208,0.00056129927,0.0000040226987,0.0005007378,0.0018264939],"genre_scores_gemma":[0.29592347,0.0000029270875,0.70249283,0.00034463155,0.0008748453,0.000010270817,0.000015770007,0.00004541203,0.00028985264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996032,0.000056756482,0.0005513853,0.001724056,0.00075626996,0.00087953015],"domain_scores_gemma":[0.99726766,0.00095194473,0.0004287647,0.0009509542,0.00027005628,0.000130614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015837266,0.00055165525,0.00056322396,0.00083874486,0.00074967573,0.0009502244,0.0023173038,0.00030377146,0.000002673347],"category_scores_gemma":[0.00014351864,0.00055959134,0.00020978531,0.00047084756,0.00042852695,0.00048088972,0.00088184216,0.0011904497,0.00001647698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035869214,0.000021948897,0.00006094162,0.000051835945,0.000008748789,0.000019548745,0.00084011536,0.11676143,0.000032107695,0.02839929,0.000017177175,0.85378325],"study_design_scores_gemma":[0.0005646833,0.00035742787,0.00035185585,0.0012147997,0.00001655155,0.00008709926,6.4971675e-7,0.93017894,0.0004126872,0.05100409,0.014649035,0.0011621516],"about_ca_topic_score_codex":0.00008945787,"about_ca_topic_score_gemma":0.000050051985,"teacher_disagreement_score":0.85262114,"about_ca_system_score_codex":0.00045513784,"about_ca_system_score_gemma":0.0003532671,"threshold_uncertainty_score":0.9996856},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003861162,0.00010972617,0.99309814,0.00045478274,0.0022099311,0.00071563973,0.000019709738,0.00008196643,0.002923999],"genre_scores_gemma":[0.5063356,0.000015458405,0.4845625,0.005312734,0.0026696224,0.00005931458,0.00005120676,0.00009252217,0.000901047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958401,0.000038561077,0.00059227063,0.0018178085,0.00078433764,0.0009269303],"domain_scores_gemma":[0.9973736,0.00069300266,0.00052011287,0.0007393041,0.00052346825,0.00015052829],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008427948,0.0006572651,0.0005476975,0.0010377393,0.00055609667,0.0006794808,0.0018466479,0.00037481505,0.000044350447],"category_scores_gemma":[0.00016656701,0.0006286171,0.0002696078,0.00051454594,0.00021032058,0.001751789,0.00047623346,0.00093970814,0.000056572477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014913754,0.00025106187,0.00014039644,0.00020818172,0.000075309144,0.000044048582,0.00205877,0.09185664,0.06754163,0.06500005,0.00034893045,0.7723258],"study_design_scores_gemma":[0.0008121663,0.0015558697,0.0004048937,0.0007855194,0.000027988608,0.00009358264,0.0000013267169,0.8585109,0.10096476,0.030565111,0.004811061,0.0014667924],"about_ca_topic_score_codex":0.000021620095,"about_ca_topic_score_gemma":0.000019576766,"teacher_disagreement_score":0.77085906,"about_ca_system_score_codex":0.00078429753,"about_ca_system_score_gemma":0.0003870085,"threshold_uncertainty_score":0.9996165},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037130124,0.00057885825,0.99068546,0.00004251348,0.0002974355,0.00027030156,0.0000051199418,0.000080775426,0.00432652],"genre_scores_gemma":[0.7464035,0.000037178008,0.25339758,0.00008768934,0.000047818965,0.000003572433,0.0000011416743,0.0000095095265,0.0000119796005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976768,0.000016753673,0.0005373183,0.00072999264,0.000680052,0.0003591219],"domain_scores_gemma":[0.99857545,0.0001581122,0.00022447064,0.00066263106,0.00028698434,0.00009237578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040870399,0.00032202373,0.0005240505,0.00050182524,0.00007087976,0.0001426283,0.0014077422,0.00014658435,0.000010839479],"category_scores_gemma":[0.000060681574,0.0002822067,0.00007309907,0.00023369606,0.0003623146,0.0007179052,0.0005672956,0.00040868876,0.0000017297538],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015470556,0.00007158833,0.0004474838,0.0000635653,0.000010077509,0.000021316255,0.0010184243,0.009338475,0.005238054,0.0030755675,0.0000017234333,0.9806982],"study_design_scores_gemma":[0.00017277944,0.00022057781,0.00012612694,0.0008140615,0.000020772004,0.00001225422,3.0523762e-7,0.9326363,0.012684498,0.05299998,0.0000042594897,0.00030806375],"about_ca_topic_score_codex":0.00012754048,"about_ca_topic_score_gemma":0.000041636602,"teacher_disagreement_score":0.9803902,"about_ca_system_score_codex":0.00009102978,"about_ca_system_score_gemma":0.00017495334,"threshold_uncertainty_score":0.999963},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006969108,0.0006729774,0.99392426,0.00072918663,0.0013603674,0.00070100767,0.000016927539,0.00015368077,0.0017447015],"genre_scores_gemma":[0.4682566,0.00006465927,0.5280458,0.002065056,0.0005451298,0.0000561887,0.00001124392,0.000071573835,0.00088380324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966264,0.000029179946,0.00064559054,0.0013105394,0.0007092894,0.0006790018],"domain_scores_gemma":[0.9963825,0.0011293862,0.0004524672,0.0015010822,0.00037556497,0.00015904207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009346888,0.00050994364,0.0007171572,0.00065221725,0.00015457516,0.00035745229,0.003916685,0.00033771532,0.00005253212],"category_scores_gemma":[0.00011735123,0.00043932337,0.00021627922,0.00042333562,0.00090872124,0.0006181207,0.0010067698,0.000436513,0.00004586271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000119043225,0.00006375732,0.000043799628,0.00020092801,0.000032383494,0.00002565894,0.000905374,0.0047400612,0.0015853691,0.51595366,0.00024542448,0.47619167],"study_design_scores_gemma":[0.00034421237,0.0002636572,0.00007780489,0.00039681484,0.000009454143,0.000029865625,2.1036976e-7,0.46903569,0.006900165,0.520663,0.0017172889,0.00056184287],"about_ca_topic_score_codex":0.000027804139,"about_ca_topic_score_gemma":0.000021740447,"teacher_disagreement_score":0.4756298,"about_ca_system_score_codex":0.00011573877,"about_ca_system_score_gemma":0.0004162044,"threshold_uncertainty_score":0.99980587},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39961067,0.000025705518,0.59967595,0.00029536072,0.00009566997,0.00013826553,4.7568477e-7,0.00015397112,0.0000039162533],"genre_scores_gemma":[0.58384395,0.000011282753,0.4160013,0.00011108472,0.000014534737,0.00001349848,2.8097736e-7,0.000003560631,5.5671825e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819344,0.00006866296,0.00020138091,0.0007902279,0.000368481,0.0003777928],"domain_scores_gemma":[0.9990087,0.00015443219,0.00004458073,0.0006540883,0.00004720971,0.00009095175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052107376,0.00016598152,0.0001844637,0.00027221278,0.00008094849,0.0002408414,0.0009020633,0.000072309485,0.0000041746016],"category_scores_gemma":[0.000023652154,0.00016182041,0.000026199104,0.0014135472,0.0002586439,0.000879369,0.0003086146,0.00026813106,0.0000026044052],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023257976,0.000037118098,0.024164885,0.000005037489,6.708049e-7,0.000040836887,0.00070531137,0.028172504,0.0012355886,0.00053756306,9.4208866e-7,0.9450972],"study_design_scores_gemma":[0.00015230184,0.00006184662,0.08743816,0.00005770497,9.224497e-7,0.000058378308,8.6241705e-8,0.8946041,0.013535345,0.0038649985,0.000018363884,0.00020782236],"about_ca_topic_score_codex":0.00034780763,"about_ca_topic_score_gemma":0.00013167018,"teacher_disagreement_score":0.94488937,"about_ca_system_score_codex":0.00015021575,"about_ca_system_score_gemma":0.00008578937,"threshold_uncertainty_score":0.65988445},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013941684,0.00035131877,0.99610734,0.0007250424,0.0009839038,0.00050338905,0.0000031766451,0.0007191424,0.00046729733],"genre_scores_gemma":[0.1178893,0.000016547689,0.88117635,0.00052512944,0.00026574254,0.000016979078,0.0000070415135,0.00004328779,0.000059593374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579805,0.000031497922,0.0005910287,0.0018118744,0.001031317,0.00073625584],"domain_scores_gemma":[0.9969744,0.00033079792,0.0002551286,0.0020607,0.00023010797,0.00014885546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015099725,0.000571416,0.00051298673,0.0017958498,0.000107133535,0.0003920345,0.0034877204,0.00034086418,0.000008689411],"category_scores_gemma":[0.000050226106,0.0005786666,0.00010466256,0.0010848538,0.00039904795,0.0005243675,0.0006558947,0.0009812617,0.000026226526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051601005,0.000033219843,0.00024839866,0.000058022302,0.000003879153,0.000080982456,0.00029083173,0.13494584,0.00036313964,0.06866645,0.000017116374,0.79528695],"study_design_scores_gemma":[0.0002759479,0.00013446121,0.0015366181,0.00069449225,0.000004915756,0.000030996012,2.564772e-8,0.9156028,0.011210327,0.060443368,0.008888369,0.0011776973],"about_ca_topic_score_codex":0.000054262277,"about_ca_topic_score_gemma":0.00008163167,"teacher_disagreement_score":0.7941093,"about_ca_system_score_codex":0.0006434978,"about_ca_system_score_gemma":0.0004879719,"threshold_uncertainty_score":0.99966645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000108308144,0.0006431077,0.9967658,0.0007122483,0.0003502918,0.00045520393,0.000021439764,0.000042178894,0.0009014297],"genre_scores_gemma":[0.5272383,0.0001545328,0.47181442,0.00064551865,0.00006087083,0.000020288311,0.000045372093,0.000012367197,0.000008315918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801725,0.00004918449,0.0005915254,0.0004485338,0.00057277165,0.00032075803],"domain_scores_gemma":[0.995115,0.002900308,0.00048291357,0.0010700197,0.00035058678,0.00008118356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016898126,0.00026413202,0.00030991778,0.0004401036,0.0006899223,0.0005815537,0.002594616,0.00013165218,0.0000016113671],"category_scores_gemma":[0.00017566633,0.00020814301,0.00008855817,0.00042543127,0.0017345577,0.0006151262,0.00093181373,0.00036095237,0.0000032071778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006095188,0.000012142624,0.000043743938,0.000045613524,0.000005491486,1.765545e-7,0.000856728,0.009239504,0.0000013354936,0.76264894,0.000016154867,0.22712405],"study_design_scores_gemma":[0.00024828993,0.00013251977,0.00009050702,0.0001965408,0.000006232588,0.000009150164,9.412988e-7,0.49279785,0.000024092738,0.50426024,0.0020385475,0.00019507295],"about_ca_topic_score_codex":0.000016338743,"about_ca_topic_score_gemma":0.000044439555,"teacher_disagreement_score":0.52713,"about_ca_system_score_codex":0.00004535254,"about_ca_system_score_gemma":0.00020300603,"threshold_uncertainty_score":0.8487826},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048908885,0.00016891636,0.99303204,0.0013078834,0.00083885464,0.0010274628,0.0000011478953,0.00081610057,0.0027586792],"genre_scores_gemma":[0.116707295,0.000049789047,0.88144416,0.00081455876,0.0005220409,0.000057423513,0.0000068714385,0.000037976075,0.0003598904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967284,0.000035394733,0.00062080915,0.0013784504,0.00071384397,0.0005230715],"domain_scores_gemma":[0.9979079,0.00018269278,0.00036757288,0.0011449116,0.0002791888,0.00011777972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014046293,0.00047455737,0.0005004507,0.0009603329,0.00029320145,0.00068396976,0.0019698755,0.00032526228,0.0000057816546],"category_scores_gemma":[0.00003648274,0.000468175,0.00014428605,0.00033944522,0.0002832251,0.0010728117,0.0012007145,0.00059330836,0.00000970933],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011494826,0.000026167023,0.000005170756,0.000043406155,0.00000874602,0.0000053774334,0.0009808968,0.021955565,0.0013721563,0.04282139,0.000082081126,0.9326875],"study_design_scores_gemma":[0.00027776643,0.00035205772,0.000016950711,0.00073452754,0.00001071555,0.00011949298,2.7923966e-7,0.7430423,0.05859136,0.18445705,0.011428796,0.0009687376],"about_ca_topic_score_codex":0.000015223952,"about_ca_topic_score_gemma":0.00005121795,"teacher_disagreement_score":0.9317188,"about_ca_system_score_codex":0.00057393743,"about_ca_system_score_gemma":0.0002539447,"threshold_uncertainty_score":0.999777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020872326,0.00044636105,0.9924694,0.00012427784,0.0014962252,0.0001091733,0.000048806054,0.0001529798,0.0049440777],"genre_scores_gemma":[0.29625615,0.00025306677,0.69907963,0.0011119614,0.0024374253,0.0000013389557,0.00046078442,0.0001420656,0.00025758115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984218,0.000007336541,0.00029682543,0.00065498217,0.0003107589,0.00030828436],"domain_scores_gemma":[0.9986339,0.00014887349,0.00006215522,0.0010203911,0.00005027742,0.000084398285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017692808,0.0002800144,0.00027475128,0.00028065397,0.000095698306,0.00018308384,0.0010205007,0.00021883841,0.000043090167],"category_scores_gemma":[0.000041916595,0.00027827345,0.000034651435,0.00018313521,0.00018400431,0.0002461623,0.00020522223,0.0004500969,0.000019756484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.138865e-7,0.0000016584652,0.00002634536,0.0000059456133,0.0000051930774,0.000011473902,0.000049699956,0.5833725,0.000097919314,0.0002710636,0.000028784043,0.4161288],"study_design_scores_gemma":[0.00008017198,0.00001355814,0.000029972738,0.00022547577,0.0000094809975,0.0000117285235,1.1010925e-7,0.9824666,0.00045215647,0.015045786,0.0013342112,0.0003307739],"about_ca_topic_score_codex":0.000038245093,"about_ca_topic_score_gemma":0.00010053036,"teacher_disagreement_score":0.41579804,"about_ca_system_score_codex":0.00011890324,"about_ca_system_score_gemma":0.00009096772,"threshold_uncertainty_score":0.9999669},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017511318,0.0006645048,0.98428595,0.000041931526,0.00024243406,0.0003461868,0.000005585377,0.00048029897,0.013915608],"genre_scores_gemma":[0.039932746,0.00052663434,0.95638996,0.0006801144,0.0013623283,0.00006411928,0.000011809849,0.00013280276,0.0008994548],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872255,0.000011165079,0.0002224955,0.0005249212,0.00023124542,0.0002876065],"domain_scores_gemma":[0.99895483,0.00026719272,0.00005180228,0.0005773898,0.000059650025,0.0000891248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036582092,0.00029998115,0.00026392195,0.00031535586,0.00011127239,0.000100104604,0.00055183884,0.0001633391,0.00006745641],"category_scores_gemma":[0.000030197058,0.00028302183,0.000042646734,0.00015237904,0.00061196607,0.00013173491,0.00029686853,0.0005139738,0.00002843181],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022554132,0.000003285505,0.0000025537577,0.000057045632,0.0000031110599,0.000009152639,0.00008762334,0.0028702547,0.004488867,0.02289652,0.000059176935,0.96952015],"study_design_scores_gemma":[0.00015424256,0.00006973817,0.00005605111,0.00027306326,0.000012248878,0.000086956185,1.890302e-7,0.07310932,0.025568599,0.87425846,0.025555527,0.00085560116],"about_ca_topic_score_codex":7.3877675e-7,"about_ca_topic_score_gemma":0.000005041611,"teacher_disagreement_score":0.9686645,"about_ca_system_score_codex":0.00009893087,"about_ca_system_score_gemma":0.000033102096,"threshold_uncertainty_score":0.9999622},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025117204,0.0005404591,0.83817106,0.0009414081,0.006321224,0.00061065465,0.000058912683,0.00028498683,0.12795411],"genre_scores_gemma":[0.9796179,0.000037135,0.007378091,0.0065778187,0.0023500465,0.000009167327,0.00008014703,0.00007434361,0.0038753585],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969075,0.000059044905,0.0004028789,0.0011890596,0.0007324129,0.0007091607],"domain_scores_gemma":[0.9983068,0.00035425363,0.0002091047,0.0008312285,0.00014175098,0.00015687171],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088796177,0.00046388255,0.00043493503,0.00075155497,0.00030047732,0.00014036169,0.0009653008,0.0004507684,0.00039563567],"category_scores_gemma":[0.00004045265,0.00041951233,0.00014516783,0.00030520168,0.0008071818,0.000113286595,0.00024248,0.0011735861,0.0000621951],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054277407,0.000085383705,0.00039363987,0.000028906354,0.00006478774,0.00084505556,0.03667384,0.00053558423,0.000254667,0.045105904,0.00013346647,0.9158245],"study_design_scores_gemma":[0.014124436,0.0072579402,0.06440781,0.0063146846,0.0012813885,0.0031241686,0.0011096427,0.02633197,0.011623117,0.7827089,0.05961695,0.022099024],"about_ca_topic_score_codex":0.0006224907,"about_ca_topic_score_gemma":0.0020177353,"teacher_disagreement_score":0.9545007,"about_ca_system_score_codex":0.00018738979,"about_ca_system_score_gemma":0.00016823868,"threshold_uncertainty_score":0.99982566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013844315,0.00054497167,0.9927465,0.00035747772,0.0016042128,0.00081776344,0.0000051475877,0.00015069319,0.002388856],"genre_scores_gemma":[0.3634199,0.000048044236,0.6350095,0.00089442544,0.00026463417,0.000016869571,0.0000018263706,0.000041268442,0.0003035234],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99547166,0.000065586195,0.0010007493,0.0016252076,0.0011146868,0.0007221255],"domain_scores_gemma":[0.99624485,0.0006432426,0.00047150187,0.0019267027,0.0005444182,0.00016931488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025575594,0.00056347623,0.00072649826,0.00085507304,0.00015143747,0.00032318244,0.0047612893,0.000434285,0.000053371612],"category_scores_gemma":[0.0001985545,0.0005136618,0.00018224333,0.0007462531,0.0011399548,0.0008331201,0.0017093933,0.0010037174,0.000049486724],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000336657,0.00009501969,0.00018337354,0.00023310549,0.00002892991,0.000040485804,0.0014348957,0.006763578,0.0005941044,0.041386828,0.000043859527,0.9491621],"study_design_scores_gemma":[0.0008030662,0.0011050961,0.0013083516,0.003062759,0.000032004136,0.00012852515,0.0000014094848,0.33435294,0.17300762,0.4682497,0.015419189,0.0025293473],"about_ca_topic_score_codex":0.00004828386,"about_ca_topic_score_gemma":0.00019387795,"teacher_disagreement_score":0.9466328,"about_ca_system_score_codex":0.000288224,"about_ca_system_score_gemma":0.00050275197,"threshold_uncertainty_score":0.9997315},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009977239,0.00063966267,0.972407,0.00042029872,0.0042035426,0.0004419334,0.000004661262,0.00043378078,0.021349339],"genre_scores_gemma":[0.46550265,0.0001466867,0.5300182,0.0015252795,0.0022895415,0.000026673993,0.000018864772,0.000108162065,0.00036397026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99483126,0.00007336566,0.00083041587,0.0020614562,0.001175692,0.0010277854],"domain_scores_gemma":[0.9968478,0.00049318926,0.00056967326,0.0015755112,0.00026636978,0.00024743562],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010671266,0.00075001636,0.0007886872,0.0007043353,0.00056790706,0.0012383916,0.0026556114,0.00052756036,0.0000124577155],"category_scores_gemma":[0.000059540176,0.0007095617,0.00020271933,0.0010200812,0.00055975677,0.00082878687,0.0007214292,0.0012418934,0.000028753171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008627498,0.00004000664,0.00012876115,0.000052241485,0.000021757403,0.00021813474,0.0005095505,0.123914026,0.00003547802,0.030888624,0.000048444508,0.84413433],"study_design_scores_gemma":[0.0003926405,0.00017123976,0.00009596367,0.0012147786,0.000012282776,0.0002521579,9.3543815e-7,0.96950036,0.00013164434,0.017871568,0.009455019,0.0009013889],"about_ca_topic_score_codex":0.000014799683,"about_ca_topic_score_gemma":0.000034881334,"teacher_disagreement_score":0.84558636,"about_ca_system_score_codex":0.0005974031,"about_ca_system_score_gemma":0.00040280886,"threshold_uncertainty_score":0.9997984},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5164034,0.000082818915,0.48259288,0.000032685795,0.0005095184,0.00017308551,0.0000019005021,0.00015080061,0.000052942403],"genre_scores_gemma":[0.73110116,0.0000012337276,0.2686005,0.00021204074,0.00006734746,0.0000035399269,0.0000054745337,0.000007694662,0.0000010252589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866754,0.000027274085,0.0002591994,0.00039181072,0.0003179507,0.0003362012],"domain_scores_gemma":[0.99930906,0.000071358714,0.00009040841,0.00031614036,0.000101772384,0.00011128421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002055496,0.00016141143,0.00029525676,0.00027288275,0.00007375607,0.000020899968,0.00016651448,0.00008227937,0.000032169562],"category_scores_gemma":[0.000027455806,0.00012931136,0.00005517665,0.0007557008,0.00028087787,0.00013544661,0.00011602262,0.00014637616,0.000011683717],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013051053,0.0004666418,0.055898964,0.00006108086,0.000023040684,0.00044687605,0.0042869058,0.0020216582,0.02225573,0.00007572899,0.00002473723,0.91430813],"study_design_scores_gemma":[0.005174737,0.0056630797,0.16967674,0.0011846964,0.000055572433,0.000729259,0.0000061655737,0.55253226,0.26330587,0.0011370393,0.000055187502,0.00047940767],"about_ca_topic_score_codex":0.000020809857,"about_ca_topic_score_gemma":0.000012815123,"teacher_disagreement_score":0.91382873,"about_ca_system_score_codex":0.00005150572,"about_ca_system_score_gemma":0.0001371635,"threshold_uncertainty_score":0.5273164},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000065779527,0.0010122126,0.99403954,0.00059767865,0.0008395091,0.0002963411,0.000028812412,0.00029028772,0.0028890183],"genre_scores_gemma":[0.021889543,0.000048704904,0.9752419,0.0013862699,0.00068103475,0.000009539791,0.0000460973,0.00003787437,0.00065904536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962207,0.00002201513,0.0005529365,0.0015626723,0.0009227004,0.0007189621],"domain_scores_gemma":[0.9975966,0.0001427746,0.0003494511,0.0014548487,0.0002642876,0.00019203837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054400245,0.00054921705,0.00056887895,0.0004919524,0.00035967,0.00042776632,0.0022235503,0.0002467344,0.000009326997],"category_scores_gemma":[0.000077353856,0.00047827556,0.00010545308,0.0006912736,0.0005319827,0.0013400739,0.0009872479,0.00068116107,0.00003829137],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002537209,0.000013925268,0.0000069870107,0.00003742501,0.0000028648224,0.00011177731,0.00019336354,0.006851936,0.000059992457,0.05419538,0.000026765118,0.93849707],"study_design_scores_gemma":[0.0005712005,0.00036282482,0.00022084071,0.0022719584,0.000013957345,0.0003988043,4.0620188e-7,0.58399224,0.0020161825,0.26862755,0.13919105,0.0023329854],"about_ca_topic_score_codex":0.00001204297,"about_ca_topic_score_gemma":0.00004127206,"teacher_disagreement_score":0.9361641,"about_ca_system_score_codex":0.00027642783,"about_ca_system_score_gemma":0.00059653283,"threshold_uncertainty_score":0.9997669},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027095515,0.0010854641,0.9930444,0.0012694972,0.0021890807,0.0013576723,0.00000848671,0.00019825088,0.0005761947],"genre_scores_gemma":[0.5094495,0.00020684092,0.48324814,0.0045022424,0.0020602315,0.00012900935,0.000044585056,0.00015677793,0.00020269815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929941,0.00016964685,0.0012096821,0.0023894066,0.0016674149,0.0015697419],"domain_scores_gemma":[0.99623704,0.00054273487,0.00054700044,0.0023033482,0.00014511155,0.0002247475],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019080773,0.00086236483,0.0009543841,0.0032183758,0.00021101403,0.001061615,0.004587394,0.00044749273,0.000014325128],"category_scores_gemma":[0.00015324508,0.0009028981,0.00014236123,0.0035652937,0.00042177012,0.0007331635,0.0019917164,0.0012159526,0.00002341164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010198979,0.000056622335,0.000951962,0.00013090446,0.000010866702,0.000713933,0.00024906753,0.90394706,0.000011020718,0.013911309,0.000025936246,0.07998111],"study_design_scores_gemma":[0.0004853109,0.000087529435,0.00017486168,0.0036722024,0.000007626117,0.00001608071,7.517685e-7,0.9484908,0.00003955488,0.04403889,0.0021574115,0.0008289939],"about_ca_topic_score_codex":0.0013051144,"about_ca_topic_score_gemma":0.00041456593,"teacher_disagreement_score":0.50979626,"about_ca_system_score_codex":0.0030963589,"about_ca_system_score_gemma":0.00085779343,"threshold_uncertainty_score":0.9999754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013899326,0.000046262976,0.99182445,0.00027341975,0.0047498955,0.00032656593,0.0000027002577,0.00016822532,0.0012185773],"genre_scores_gemma":[0.59264016,0.0000020297766,0.40563747,0.00080152164,0.0008049162,0.0000020859336,0.0000019568813,0.000026583391,0.00008327763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555814,0.000032562224,0.0007271313,0.0018675261,0.0010146818,0.00079993845],"domain_scores_gemma":[0.9977827,0.0002112887,0.0004471701,0.0008863536,0.00036878797,0.00030366474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012050361,0.00056273607,0.00061584054,0.0009275335,0.0004388248,0.0009926904,0.0027163627,0.00046861652,0.00003069713],"category_scores_gemma":[0.00019348373,0.0005354425,0.00022344427,0.00070015976,0.00043706567,0.0005890004,0.0012400424,0.0014362929,0.000048244518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033296642,0.000018544131,0.000031455686,0.000023544755,0.000023800358,0.000057649202,0.0016015214,0.10382955,0.0037959493,0.26765478,0.0000031380596,0.62295675],"study_design_scores_gemma":[0.00013039527,0.00008638004,0.000008255526,0.00030472458,0.000015911088,0.0001320274,5.6450574e-7,0.9874695,0.002632054,0.0081978515,0.00038037886,0.0006419667],"about_ca_topic_score_codex":0.000044217857,"about_ca_topic_score_gemma":0.0001449407,"teacher_disagreement_score":0.88363993,"about_ca_system_score_codex":0.00040430698,"about_ca_system_score_gemma":0.0005963333,"threshold_uncertainty_score":0.9997097},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073196134,0.000103156824,0.99136394,0.0014204084,0.0040127602,0.0013947356,0.000054309512,0.0004437406,0.00047498863],"genre_scores_gemma":[0.3719106,0.000009331778,0.6247749,0.0019916797,0.0010782465,0.00003511236,0.000057278376,0.00008840634,0.000054455384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931264,0.000094074174,0.0009226887,0.0029680054,0.0016109191,0.0012778967],"domain_scores_gemma":[0.9960231,0.00072792865,0.00061156746,0.0016903183,0.00052060734,0.00042644195],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012262431,0.001121714,0.001004783,0.0011647008,0.00089398434,0.0010658343,0.0036714613,0.0004695075,0.0000123841355],"category_scores_gemma":[0.00006034951,0.0010407115,0.00035766282,0.0006818586,0.0013667839,0.0006085478,0.00072660425,0.0013087554,0.000030015197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048080794,0.00021986596,0.0000023184223,0.00005518103,0.000026972066,0.00008705191,0.00085279474,0.53320205,0.000072357245,0.112210035,0.000020487072,0.3532028],"study_design_scores_gemma":[0.0006758486,0.0014802946,0.00010098472,0.00043835535,0.0000093245335,0.000037573704,3.3364068e-7,0.62844086,0.00019908846,0.367431,0.00039767614,0.000788632],"about_ca_topic_score_codex":0.00009227874,"about_ca_topic_score_gemma":0.000069190755,"teacher_disagreement_score":0.37117863,"about_ca_system_score_codex":0.0010798709,"about_ca_system_score_gemma":0.0014576225,"threshold_uncertainty_score":0.99997115},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014778026,0.00076325116,0.99464506,0.000331737,0.0005560506,0.00035693025,0.0000381496,0.000053098862,0.0017779253],"genre_scores_gemma":[0.2741136,0.00006574848,0.7248764,0.000565892,0.00017163681,0.000010727628,0.000010011427,0.000029244213,0.00015673229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665153,0.000040110684,0.00067046797,0.0011782816,0.0009974082,0.0004622205],"domain_scores_gemma":[0.99787253,0.0007776662,0.00039026976,0.0005756096,0.0002647967,0.0001191457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000788186,0.00040442028,0.00060668716,0.000920321,0.0001200144,0.00015482551,0.0011786948,0.00018534159,0.000012851736],"category_scores_gemma":[0.00010772201,0.00038366648,0.0000637131,0.00060902745,0.0008769874,0.00040010834,0.001193688,0.00043806527,0.000008054293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001527289,0.000103041784,0.00041804346,0.00023144981,0.00002007017,0.00025812,0.00326255,0.15859994,0.00031141602,0.14129776,0.000032761975,0.6954496],"study_design_scores_gemma":[0.0005991322,0.00017825884,0.0009473251,0.0014477352,0.000005338108,0.000108961445,0.0000015021386,0.9825912,0.00028881137,0.01107672,0.0021301508,0.00062483316],"about_ca_topic_score_codex":0.000015962894,"about_ca_topic_score_gemma":0.00005337087,"teacher_disagreement_score":0.8239913,"about_ca_system_score_codex":0.00012505981,"about_ca_system_score_gemma":0.00032633345,"threshold_uncertainty_score":0.99986154},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017167387,0.00047924154,0.99271685,0.0009199358,0.0008504805,0.0006406934,0.000012293735,0.00010428676,0.0025594973],"genre_scores_gemma":[0.8117125,0.000034027416,0.18470871,0.0021360104,0.00036900747,0.000014232875,0.000025879557,0.00003365499,0.00096597744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99541694,0.000041706928,0.0006986805,0.001563192,0.0016333987,0.00064610044],"domain_scores_gemma":[0.99715483,0.00050353626,0.00061385747,0.0011786167,0.00034146418,0.00020767175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070982415,0.0006428529,0.0007560115,0.0009679133,0.0003227473,0.00038792216,0.0019307255,0.00025548294,0.00002083288],"category_scores_gemma":[0.00006095966,0.00055524684,0.00014380607,0.0009847374,0.0006070806,0.00047839177,0.00038526361,0.00064992195,0.000014484925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017588623,0.0001577923,0.000097098266,0.00007719862,0.000046158733,0.00018242933,0.0011136947,0.105982855,0.0009449216,0.23094237,0.000051719693,0.6602279],"study_design_scores_gemma":[0.002865761,0.004388036,0.0015850345,0.002744329,0.000051018313,0.00029462224,0.0000018239125,0.7135517,0.0226217,0.24309717,0.0064336346,0.0023651824],"about_ca_topic_score_codex":0.000018581644,"about_ca_topic_score_gemma":0.00007758142,"teacher_disagreement_score":0.8099958,"about_ca_system_score_codex":0.0004907496,"about_ca_system_score_gemma":0.00084290555,"threshold_uncertainty_score":0.9996899},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003008566,0.00040386905,0.9970069,0.00006530187,0.0008875981,0.0010299006,0.000006013791,0.00007939174,0.0004909594],"genre_scores_gemma":[0.06910066,0.000014666304,0.93024457,0.00014640465,0.00040596156,0.000029613655,0.0000047545104,0.000025001904,0.000028379163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970658,0.00009426633,0.0006234793,0.001069189,0.000744176,0.00040312583],"domain_scores_gemma":[0.99623555,0.00051070395,0.0006014674,0.0021722207,0.00039770684,0.000082349434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029184367,0.00034070428,0.0003980379,0.0004442868,0.0003160464,0.00030379306,0.004313224,0.00027271215,0.0000022324318],"category_scores_gemma":[0.00012965468,0.00026181038,0.00011713682,0.0005361408,0.0006024686,0.00083582225,0.00029719714,0.0003643183,0.000002000707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010073394,0.00004035143,0.000008713707,0.00011315483,0.000011500156,5.5207784e-7,0.00080052763,0.36041594,0.002655531,0.12055629,0.0000020244363,0.5153853],"study_design_scores_gemma":[0.000115271105,0.000116438714,0.000046627007,0.000109910216,0.00001614504,0.000027316637,7.2169695e-7,0.9829586,0.0068408297,0.00930696,0.00017186215,0.0002893048],"about_ca_topic_score_codex":0.000013658643,"about_ca_topic_score_gemma":0.0000032213156,"teacher_disagreement_score":0.6225427,"about_ca_system_score_codex":0.00030012816,"about_ca_system_score_gemma":0.00043270303,"threshold_uncertainty_score":0.99998343},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060904847,0.00040288296,0.9940494,0.0002724064,0.001646206,0.0013380481,0.000008112286,0.0002082361,0.0020138104],"genre_scores_gemma":[0.12985112,0.000054807555,0.86778486,0.0013385923,0.00052342,0.000044418663,0.000012502869,0.000041140447,0.00034914614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960963,0.000050409337,0.0006023369,0.0013988423,0.0008905339,0.0009615514],"domain_scores_gemma":[0.99664557,0.0010010033,0.00028814244,0.0012862881,0.00047907577,0.0002999128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017465164,0.00046130185,0.00050890277,0.0005514857,0.0004144613,0.00064854266,0.003073681,0.00030741727,0.0000491686],"category_scores_gemma":[0.00016841273,0.00042579172,0.00017800034,0.00051978766,0.0005335018,0.00076790043,0.001500022,0.000566222,0.00004438388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004487038,0.00006839994,0.00020033287,0.000084509134,0.000010829387,0.000005304065,0.0008021794,0.12601171,0.000029660767,0.018084781,0.000076474054,0.85462135],"study_design_scores_gemma":[0.0003262744,0.00018971458,0.0001860472,0.00016347122,0.000005843319,0.000016278871,1.9544727e-7,0.9323878,0.0003655538,0.055357076,0.010428825,0.0005728921],"about_ca_topic_score_codex":0.000007677719,"about_ca_topic_score_gemma":0.000020852227,"teacher_disagreement_score":0.85404843,"about_ca_system_score_codex":0.00034886916,"about_ca_system_score_gemma":0.00053340796,"threshold_uncertainty_score":0.9998194},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013730637,0.00047834864,0.9911787,0.0004933352,0.0008500094,0.00022508112,0.0000040260134,0.00017119931,0.0064619766],"genre_scores_gemma":[0.42420903,0.00003068931,0.575045,0.00023028783,0.00026920758,0.0000047407707,0.0000055373375,0.0000198788,0.00018567016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709105,0.00005385283,0.00058858853,0.00093228905,0.0007483327,0.0005859051],"domain_scores_gemma":[0.9975921,0.00043318307,0.00034519282,0.0011830007,0.0002643288,0.00018218165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000718939,0.00037435224,0.0004867957,0.0007417387,0.00030542153,0.00019326033,0.0024765795,0.00023730195,0.000046314795],"category_scores_gemma":[0.00006486656,0.00037653602,0.0001425379,0.00045870652,0.00049046095,0.0005675778,0.0012251573,0.000860957,0.000040265066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015048378,0.000048801478,0.00025780709,0.00004347816,0.00001450687,0.000013245027,0.0010598251,0.15203613,0.0011197083,0.17695837,0.0000062407303,0.6684404],"study_design_scores_gemma":[0.000216161,0.00016160487,0.00063027645,0.00046424958,0.000017932052,0.000106328225,3.0052541e-7,0.9003332,0.00089439267,0.093793325,0.0027125804,0.00066963164],"about_ca_topic_score_codex":0.000039830804,"about_ca_topic_score_gemma":0.000037738584,"teacher_disagreement_score":0.7482971,"about_ca_system_score_codex":0.0002041512,"about_ca_system_score_gemma":0.00034106543,"threshold_uncertainty_score":0.99986863},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033289227,0.0008192843,0.98831534,0.00042738943,0.0011167589,0.00021608181,0.0000011644789,0.00049864396,0.008572058],"genre_scores_gemma":[0.1266009,0.0004099651,0.87048,0.0012551066,0.0005592521,0.000014728724,0.000005348378,0.000047273064,0.0006274458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975918,0.000021673235,0.00035031117,0.0011906159,0.00045610813,0.00038947046],"domain_scores_gemma":[0.9986595,0.00012767795,0.00025079102,0.0006469889,0.00020072536,0.000114354385],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00036738394,0.00037465565,0.00031868837,0.0006660465,0.00024093765,0.0012006796,0.0010094999,0.0002898199,0.000007076775],"category_scores_gemma":[0.000035622168,0.00036594513,0.000058761332,0.00047232726,0.0006423769,0.0018725668,0.0006282602,0.00057918474,0.000007331394],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014510526,0.000009513649,0.000021759,0.000014632575,0.0000035121352,0.000021180498,0.00008761845,0.00096601533,0.00005567164,0.0038935011,0.000028691782,0.9948965],"study_design_scores_gemma":[0.00009562348,0.00012931053,0.0000988429,0.00055996655,0.0000066432517,0.0006734392,2.7638167e-8,0.7954069,0.0012275565,0.20070148,0.00057963043,0.0005205991],"about_ca_topic_score_codex":0.000014166506,"about_ca_topic_score_gemma":0.000011806328,"teacher_disagreement_score":0.9943758,"about_ca_system_score_codex":0.00025099042,"about_ca_system_score_gemma":0.00009679083,"threshold_uncertainty_score":0.99987924},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027885864,0.00049350073,0.9952553,0.00030012007,0.0016564176,0.0003903042,0.000003896461,0.000099129495,0.0015224835],"genre_scores_gemma":[0.08532162,0.000006919074,0.9129091,0.0012283733,0.00032377575,0.000010883771,0.0000074391173,0.00003996176,0.00015194745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695784,0.00003182196,0.0005193055,0.0012422589,0.00052671187,0.00072204653],"domain_scores_gemma":[0.9980931,0.00064647314,0.00031655445,0.0007013596,0.00012760643,0.00011486667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013578812,0.00042405602,0.0004309269,0.00096324197,0.00029720113,0.0004682977,0.0014711715,0.000358903,0.000005478476],"category_scores_gemma":[0.000098020726,0.00043449743,0.00010124496,0.000482284,0.00018231822,0.0006462158,0.0002577514,0.0008103652,0.000006039572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009860258,0.000021412634,0.0004981935,0.000081197686,0.000007720306,0.00009545095,0.0010556476,0.8127994,0.00028093354,0.0060243323,0.000043428332,0.17908242],"study_design_scores_gemma":[0.00030814274,0.00010472936,0.000099634206,0.0009495014,0.000005646627,0.00007918023,3.182708e-7,0.8990635,0.00076891825,0.09621828,0.0017892416,0.00061286887],"about_ca_topic_score_codex":0.000039612565,"about_ca_topic_score_gemma":0.000031014744,"teacher_disagreement_score":0.17846955,"about_ca_system_score_codex":0.00040015622,"about_ca_system_score_gemma":0.00046326563,"threshold_uncertainty_score":0.9998107},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058581785,0.0013614875,0.99124837,0.0006589409,0.0024209043,0.00056282344,0.000012910588,0.0002524619,0.00289628],"genre_scores_gemma":[0.2859267,0.000054571894,0.71165556,0.0007871976,0.0010592121,0.0000066022644,0.000006643963,0.000048153834,0.0004554024],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936172,0.000083715335,0.0010745698,0.002566527,0.001693209,0.00096478144],"domain_scores_gemma":[0.99464506,0.00080293836,0.0005698475,0.003287572,0.00045810762,0.0002364759],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013302227,0.00082015654,0.0011226091,0.0011772858,0.0002155191,0.00044254062,0.0061099613,0.0004554566,0.000038767375],"category_scores_gemma":[0.00022802125,0.0007432644,0.0003091393,0.0007099926,0.0016947059,0.0010017246,0.0022812556,0.001071956,0.000011674071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057198076,0.00004513654,0.000030010939,0.00006803824,0.000013637372,0.000044362154,0.0006994686,0.040491227,0.00011958302,0.148324,0.000015452257,0.81014335],"study_design_scores_gemma":[0.00022745584,0.00039895385,0.00060535123,0.00021027954,0.000009281314,0.00006505715,4.2253615e-7,0.17314872,0.002638596,0.8216123,0.0003534888,0.00073006685],"about_ca_topic_score_codex":0.00005284736,"about_ca_topic_score_gemma":0.0000376782,"teacher_disagreement_score":0.8094133,"about_ca_system_score_codex":0.0004677497,"about_ca_system_score_gemma":0.000990715,"threshold_uncertainty_score":0.9995018},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019777555,0.000062979554,0.9917908,0.001995761,0.0016008999,0.0016879338,0.00006302222,0.00009539479,0.0007254941],"genre_scores_gemma":[0.74279547,0.0000049781524,0.2537194,0.0014118602,0.0008020202,0.00010612853,0.000024018984,0.0000714413,0.0010646774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923112,0.000053236145,0.0010393207,0.0030556354,0.0028483178,0.00069233327],"domain_scores_gemma":[0.99203587,0.0033534903,0.00062903133,0.002422641,0.0013500837,0.00020891616],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0040475563,0.00049839716,0.0005846338,0.001804105,0.0007500763,0.001440651,0.0019768325,0.00027504985,0.00014877554],"category_scores_gemma":[0.00690914,0.00036198186,0.00015733142,0.0014044839,0.00066802616,0.0005732023,0.0004791266,0.00045573676,0.00018032927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001394687,0.000061277824,0.000026423346,0.000012012946,0.0000070029832,0.000006983772,0.0006423058,0.5957802,0.00084452215,0.01409827,0.00062192226,0.3877596],"study_design_scores_gemma":[0.00087144703,0.0008855922,0.0011211212,0.0009032211,0.000016181728,0.000048066508,0.000002506038,0.11862082,0.0015229596,0.86123085,0.013882159,0.0008950702],"about_ca_topic_score_codex":0.00003166213,"about_ca_topic_score_gemma":0.0002756901,"teacher_disagreement_score":0.84713256,"about_ca_system_score_codex":0.0006450838,"about_ca_system_score_gemma":0.00071797735,"threshold_uncertainty_score":0.99988323},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005442386,0.000055751738,0.9803487,0.00034583008,0.0011252551,0.00026755937,0.0000046193263,0.00014058384,0.017167429],"genre_scores_gemma":[0.43891832,0.000027725097,0.5562095,0.0022487838,0.0006947515,0.000024822233,0.000020394498,0.000048110927,0.0018075603],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971266,0.00003285426,0.00035417255,0.0012119198,0.0008231756,0.00045130248],"domain_scores_gemma":[0.99801886,0.0004269529,0.00020385208,0.000892134,0.00030088145,0.00015729932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004722655,0.0003964173,0.00031592566,0.0005491479,0.00031558485,0.00034169422,0.0012613955,0.00017801343,0.000108273016],"category_scores_gemma":[0.000057853893,0.00033826992,0.00008004135,0.00072845106,0.0003108743,0.0005145219,0.00036888203,0.0005604983,0.00019236472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038225106,0.00012458612,0.000057659825,0.00003202089,0.000029526931,0.00013820372,0.001137807,0.20578617,0.00008173659,0.2542497,0.00020974826,0.53811467],"study_design_scores_gemma":[0.0005247898,0.0006826694,0.0001973518,0.0005722021,0.000016749435,0.00019529392,1.9482279e-7,0.32055467,0.0035316776,0.6679805,0.0046289903,0.0011149058],"about_ca_topic_score_codex":0.000011031732,"about_ca_topic_score_gemma":0.000058267946,"teacher_disagreement_score":0.53699976,"about_ca_system_score_codex":0.00016778581,"about_ca_system_score_gemma":0.0005198323,"threshold_uncertainty_score":0.99990696},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08691119,0.000031899963,0.9119953,0.00038744952,0.00020599029,0.00021471514,0.0000039522783,0.00013438005,0.00011514905],"genre_scores_gemma":[0.40404248,0.000007447863,0.59571564,0.00016692345,0.000052463278,0.0000066709504,0.0000010099149,0.000005653393,0.0000016762019],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99712694,0.00009786882,0.0006215801,0.0007843109,0.00077990047,0.0005893744],"domain_scores_gemma":[0.9974485,0.0012790228,0.00022276297,0.0007405579,0.00014890468,0.00016023009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020743778,0.000216473,0.00036147123,0.0006998565,0.00007672972,0.00020069249,0.0023772393,0.00009864189,0.00005976998],"category_scores_gemma":[0.00063064776,0.00019260135,0.00004581369,0.0020340697,0.00071975274,0.0012768882,0.00060779374,0.00023715186,0.00003436599],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007242044,0.00006816724,0.0017438793,0.00001345067,0.0000019525773,0.00006179415,0.0008043471,0.0001361492,0.33225444,0.000012998754,0.000022626564,0.66487294],"study_design_scores_gemma":[0.00016312412,0.00008177454,0.033297412,0.00011331639,0.000002301748,0.000010350459,0.0000022037545,0.09320382,0.87059784,0.0023214447,0.0000051406396,0.00020128756],"about_ca_topic_score_codex":0.00147429,"about_ca_topic_score_gemma":0.00014787556,"teacher_disagreement_score":0.66467166,"about_ca_system_score_codex":0.00019842468,"about_ca_system_score_gemma":0.00021070756,"threshold_uncertainty_score":0.7854055},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021447286,0.00060849416,0.97497815,0.00041841477,0.00028215977,0.00035302824,0.00032131813,0.0001043484,0.0014868238],"genre_scores_gemma":[0.73092455,0.00009324414,0.26444128,0.0018894824,0.00015043498,0.000002025204,0.0021489938,0.000055392306,0.00029459357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976365,0.00001466311,0.00031689118,0.0012124691,0.00047898394,0.0003404688],"domain_scores_gemma":[0.9981595,0.00011415773,0.00011103013,0.0013390989,0.00011901688,0.00015718787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020693969,0.00037487264,0.00051995163,0.00035053282,0.000101914295,0.00013443602,0.00086471724,0.0002075104,0.000037916594],"category_scores_gemma":[0.000043011107,0.00031241754,0.000037331065,0.0001913664,0.00094697694,0.0003088057,0.0003816507,0.0007513372,0.0000064309966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000779058,0.00010371072,0.0035938567,0.000078880694,0.000060822465,0.0005050319,0.00028702506,0.017263746,0.0015585044,0.00023722266,0.000366417,0.97586685],"study_design_scores_gemma":[0.00062795426,0.00011651787,0.000829211,0.0003149762,0.000057798956,0.00010215706,0.0000011186614,0.9829468,0.00006417419,0.014190187,0.00041528261,0.00033383595],"about_ca_topic_score_codex":0.00078558683,"about_ca_topic_score_gemma":0.0022522002,"teacher_disagreement_score":0.97553307,"about_ca_system_score_codex":0.00009875947,"about_ca_system_score_gemma":0.0006299464,"threshold_uncertainty_score":0.99993277},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27811316,0.00035229608,0.7197411,0.00077071344,0.00084873894,0.000116724616,3.341663e-7,0.000044660235,0.000012229715],"genre_scores_gemma":[0.95930016,0.000008213761,0.03816734,0.0018949104,0.00061677257,0.0000041422963,0.0000026634514,0.000005343838,4.471018e-7],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988902,0.000046129433,0.0001411763,0.00024553124,0.00035702725,0.00031992755],"domain_scores_gemma":[0.99926496,0.0002141707,0.00003563603,0.00025052976,0.00010077138,0.00013394112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007543625,0.0000996884,0.00015147158,0.00015012409,0.00012317729,0.000030002993,0.00007231121,0.000053849606,0.0000066968837],"category_scores_gemma":[0.0002691663,0.00008385172,0.00006084148,0.0006106539,0.00017713982,0.00024480745,0.000075180644,0.00020475125,0.000024991079],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018821507,0.00014784465,0.31439573,0.000035661054,0.0000023960342,0.0000054572215,0.00044262738,0.0018835409,0.011516814,0.0000049197606,0.000018099292,0.6715281],"study_design_scores_gemma":[0.0003759909,0.00006797874,0.8857439,0.000097387674,0.000012521537,0.00044182458,4.8803787e-7,0.077248566,0.03530376,0.00025174607,0.00033347524,0.00012237197],"about_ca_topic_score_codex":0.000107538464,"about_ca_topic_score_gemma":0.000012006559,"teacher_disagreement_score":0.6815738,"about_ca_system_score_codex":0.00013104506,"about_ca_system_score_gemma":0.000049344904,"threshold_uncertainty_score":0.3419374},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046671138,0.000041798685,0.994198,0.00026412477,0.0038106765,0.0007297759,0.000014945892,0.00009202839,0.0003819229],"genre_scores_gemma":[0.35538968,0.000005033507,0.64242387,0.00061524316,0.0006801675,0.000027917598,0.000012652814,0.000039998118,0.000805449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973241,0.00002149339,0.0004953178,0.001025045,0.00061573816,0.0005182985],"domain_scores_gemma":[0.9983568,0.00017102086,0.00036556143,0.00075762445,0.00023816772,0.00011078984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055732176,0.00038652038,0.0004272177,0.0005061277,0.00071463693,0.00051419955,0.0016264751,0.00023096237,0.000012395337],"category_scores_gemma":[0.000031831438,0.00037404464,0.00017639624,0.00023357036,0.00019864824,0.00068392465,0.00059851585,0.0005759045,0.000019987901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029876333,0.00030345304,0.00012515411,0.00042295837,0.00011457724,0.000046912173,0.010839336,0.60300994,0.02060442,0.041828375,0.00025303618,0.32242197],"study_design_scores_gemma":[0.00026674717,0.00003134094,0.000025213354,0.00015193912,0.000012746021,0.000019812358,1.5006184e-7,0.9735223,0.0010880362,0.023525305,0.0009804891,0.00037591343],"about_ca_topic_score_codex":0.000064934946,"about_ca_topic_score_gemma":0.0001888146,"teacher_disagreement_score":0.37051237,"about_ca_system_score_codex":0.00035613985,"about_ca_system_score_gemma":0.00035656433,"threshold_uncertainty_score":0.99987113},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003438704,0.000036139863,0.99242425,0.0020296976,0.0018096274,0.00074792193,0.000011155058,0.00025519574,0.002651623],"genre_scores_gemma":[0.50166917,0.0000037610762,0.4935167,0.0036808376,0.00093707495,0.000023302899,0.000034680255,0.000037497073,0.00009697961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947915,0.000049358267,0.00076451,0.0010370777,0.0026760355,0.000681533],"domain_scores_gemma":[0.9966359,0.0010656819,0.00029167545,0.0013879846,0.00038447592,0.00023426097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027539253,0.00043019134,0.0005045169,0.0009813756,0.00028630364,0.0005916508,0.00326717,0.0005304807,0.0000079141355],"category_scores_gemma":[0.00047938185,0.00038354672,0.00016341395,0.00048949465,0.00032150515,0.0006961961,0.0006508546,0.0008828056,0.00002609575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052841384,0.000051274736,0.000031365118,0.000761834,0.000012364712,0.0000996434,0.0004389775,0.4378417,0.000013096726,0.065392435,0.00017393914,0.4951305],"study_design_scores_gemma":[0.00047398236,0.00016407385,0.000020157304,0.00080827816,0.0000055054397,0.000025428371,1.12366635e-7,0.98416585,0.0003371225,0.0125545645,0.0010621997,0.0003827222],"about_ca_topic_score_codex":0.000033669075,"about_ca_topic_score_gemma":0.000030793923,"teacher_disagreement_score":0.54632413,"about_ca_system_score_codex":0.00059310277,"about_ca_system_score_gemma":0.0013956258,"threshold_uncertainty_score":0.99986166},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012105426,0.004319396,0.9801628,0.0025355257,0.0016758324,0.00044292124,0.000004580955,0.0002996346,0.010438242],"genre_scores_gemma":[0.8560405,0.00059954915,0.1401598,0.0012459374,0.001201002,0.000009594682,0.000008376738,0.000082421204,0.0006528648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99541765,0.00007876457,0.00064908504,0.0020874138,0.0010988431,0.00066824746],"domain_scores_gemma":[0.9967666,0.0009932425,0.0004161462,0.0013226276,0.0002954156,0.00020595903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012309757,0.0006546038,0.0007665371,0.0009786454,0.00030789105,0.0007976467,0.0021847722,0.00041014497,0.000008902732],"category_scores_gemma":[0.000066263325,0.0006069686,0.00013226364,0.00038574083,0.00068434095,0.0008743517,0.0019962883,0.0007527257,0.00006053375],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025592783,0.00002882491,0.000028027867,0.000077570876,0.000008457533,0.00006709058,0.00046518404,0.0009707082,0.000055523873,0.00581448,0.000060762257,0.9924208],"study_design_scores_gemma":[0.0011376393,0.0006698197,0.002431371,0.0024464137,0.000022456195,0.0008652941,0.0000010128282,0.8101684,0.0010319292,0.13751264,0.041089192,0.0026238393],"about_ca_topic_score_codex":0.000048904054,"about_ca_topic_score_gemma":0.00016400687,"teacher_disagreement_score":0.989797,"about_ca_system_score_codex":0.00024201446,"about_ca_system_score_gemma":0.00028547365,"threshold_uncertainty_score":0.99963814},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022333255,0.0010800167,0.9873752,0.00039297657,0.0016748594,0.00044885522,0.0000011899509,0.0002219864,0.008581555],"genre_scores_gemma":[0.7815591,0.000016908427,0.21691614,0.00045965213,0.0004189112,0.000012381058,0.0000031926609,0.00003548207,0.00057820743],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99632967,0.000025829257,0.000504387,0.0015632574,0.00087631267,0.00070055644],"domain_scores_gemma":[0.99746263,0.00035906033,0.0004515928,0.0011818518,0.00029844407,0.00024641253],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007985697,0.0005910733,0.00071847165,0.0004127761,0.00036618987,0.001110793,0.0020164214,0.00045245825,0.00002454294],"category_scores_gemma":[0.000052279927,0.00044388958,0.000068273446,0.0004233583,0.0010766468,0.00056871056,0.0007432353,0.0013247209,0.000033485132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017431537,0.000061777006,0.0013650369,0.00011035319,0.000038927712,0.00023648427,0.0016244653,0.00082202355,0.00019291248,0.23365156,0.00002198884,0.76185703],"study_design_scores_gemma":[0.004164338,0.0032440738,0.013803476,0.002136923,0.00013536877,0.0021686226,0.0000053267663,0.21888712,0.004717109,0.5778527,0.16461515,0.008269771],"about_ca_topic_score_codex":0.00015536073,"about_ca_topic_score_gemma":0.00050018245,"teacher_disagreement_score":0.7813358,"about_ca_system_score_codex":0.00010963539,"about_ca_system_score_gemma":0.00037145262,"threshold_uncertainty_score":0.99992615},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013494432,0.0019424368,0.9911369,0.0028455474,0.0021676084,0.0006124055,0.000008639442,0.00016258252,0.0011103675],"genre_scores_gemma":[0.0013503209,0.000029328394,0.9916459,0.006470293,0.0001235525,0.000029831497,0.000007857106,0.000030922896,0.0003120262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958016,0.00018038377,0.00060085405,0.0020709815,0.00047431543,0.00087185326],"domain_scores_gemma":[0.9947643,0.0026862342,0.00032109156,0.001821253,0.00021746734,0.00018962508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002678155,0.00064642646,0.0010197916,0.00080020644,0.00030767,0.0007986447,0.003090321,0.00040403777,0.000011269866],"category_scores_gemma":[0.0005255113,0.0005411225,0.00019655001,0.00037591183,0.0009395051,0.00084816373,0.00088846433,0.00052888657,0.000004882688],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012826753,0.000032337543,0.00003820925,0.00008928836,0.000054202035,0.000039084727,0.00026894774,0.0010990307,0.00027752825,0.1329436,0.00012706692,0.8650179],"study_design_scores_gemma":[0.00065413304,0.00023627526,0.00009206431,0.00011201513,0.00006642059,0.00010909873,3.1139896e-7,0.55261713,0.004418488,0.42332968,0.017551254,0.0008131401],"about_ca_topic_score_codex":0.00002815253,"about_ca_topic_score_gemma":0.00006992424,"teacher_disagreement_score":0.86420476,"about_ca_system_score_codex":0.00011390617,"about_ca_system_score_gemma":0.00045908624,"threshold_uncertainty_score":0.999704},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01152573,0.0015294724,0.98565745,0.000399002,0.00018948723,0.00013184959,0.000002065875,0.00007981858,0.0004851312],"genre_scores_gemma":[0.9053541,0.00008325211,0.09084312,0.002857655,0.0007729449,0.000006133469,0.000008595798,0.000035494308,0.000038738177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980474,0.000012315364,0.00034830184,0.000943857,0.00030258636,0.00034550953],"domain_scores_gemma":[0.99894667,0.00021293742,0.00019747349,0.0003150175,0.00030339442,0.00002452893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072184735,0.00036663297,0.0005161285,0.0007393729,0.00036918622,0.0003633697,0.0002984767,0.00024259005,0.000014499371],"category_scores_gemma":[0.00018408791,0.00032794964,0.00005963871,0.00033712658,0.00077225734,0.00058948254,0.00039631643,0.0004116784,0.0000044112317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027997537,0.00002076758,0.00020470482,0.00022031846,0.00002332417,0.0008580202,0.00043558268,0.41878074,0.0000967416,0.0029470597,0.0000054200596,0.5763793],"study_design_scores_gemma":[0.00024509864,0.000010136914,0.0000036615252,0.0001759999,0.000052977062,0.00023140258,0.000002127953,0.97559994,0.000009033247,0.022931775,0.00034605854,0.00039179757],"about_ca_topic_score_codex":0.00055903144,"about_ca_topic_score_gemma":0.00018439982,"teacher_disagreement_score":0.8948143,"about_ca_system_score_codex":0.000031650572,"about_ca_system_score_gemma":0.00011656325,"threshold_uncertainty_score":0.99991727},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012974364,0.00027199415,0.9802229,0.0014821861,0.0024786857,0.00036827684,0.0000075303446,0.00026835976,0.0148870945],"genre_scores_gemma":[0.054465003,0.00011044416,0.93337584,0.0086168265,0.0010821874,0.000030708103,0.000009056779,0.000052091797,0.0022578526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955667,0.00006099619,0.0005029238,0.0017958244,0.0011677318,0.0009057988],"domain_scores_gemma":[0.9972689,0.00041666874,0.00020732955,0.0017599226,0.00012388575,0.00022330674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062346045,0.00058959523,0.00055255985,0.00076365087,0.00042394816,0.0006986752,0.0043146457,0.00040813175,0.00004369928],"category_scores_gemma":[0.000017300656,0.0005006723,0.000199013,0.0013181836,0.00048562308,0.00070287235,0.00024758544,0.0012186421,0.00016481352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037397144,0.000063393825,9.798024e-7,0.000010504602,0.0000062391473,0.00005695488,0.00056875596,0.12483366,0.0000028988948,0.0008775083,0.00031113558,0.87326425],"study_design_scores_gemma":[0.0004722395,0.0003535828,0.0000504894,0.00026431977,0.000009037538,0.00010592865,1.1506738e-7,0.9257099,0.00028645815,0.057469223,0.014373166,0.0009055416],"about_ca_topic_score_codex":0.00002008591,"about_ca_topic_score_gemma":0.00007266426,"teacher_disagreement_score":0.8723587,"about_ca_system_score_codex":0.0006317012,"about_ca_system_score_gemma":0.0010919402,"threshold_uncertainty_score":0.9997445},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031171134,0.0012035167,0.9921678,0.0003930189,0.0004524392,0.0004835498,0.0000010010931,0.00012337058,0.004863613],"genre_scores_gemma":[0.7936429,0.00010981289,0.20513546,0.00022688914,0.00025300612,0.000025045325,0.000012965518,0.000024340865,0.00056961935],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975819,0.000026929507,0.0003450121,0.0011988162,0.00051100703,0.00033633783],"domain_scores_gemma":[0.9984585,0.00014561771,0.00028055903,0.0008155549,0.00019417131,0.000105591236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048622882,0.00032979704,0.00031037003,0.00036071995,0.00026479908,0.00062395795,0.0007842576,0.0001868129,0.0000022150202],"category_scores_gemma":[0.000024077193,0.00026673233,0.000030008905,0.00036691653,0.000528023,0.00065117824,0.0002547577,0.0003093349,0.0000090586855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008093888,0.000026375083,0.0004033078,0.00004957729,0.0000074524855,0.00001656958,0.0004817384,0.0015503803,0.00030994328,0.234911,0.000019747366,0.76221585],"study_design_scores_gemma":[0.0013742552,0.0010094495,0.011265497,0.0002632601,0.000037041234,0.00039589003,0.000002672503,0.2278748,0.0025511016,0.7332091,0.020026349,0.0019905858],"about_ca_topic_score_codex":0.000033435117,"about_ca_topic_score_gemma":0.00009944765,"teacher_disagreement_score":0.79333115,"about_ca_system_score_codex":0.00011099128,"about_ca_system_score_gemma":0.00015124782,"threshold_uncertainty_score":0.9999785},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032327513,0.0008879822,0.993335,0.00016665677,0.0010398838,0.00016668708,0.0000027508377,0.00016523131,0.0010030414],"genre_scores_gemma":[0.93450505,0.000068806316,0.06397094,0.00056540134,0.0006594532,0.0000026756538,0.0000059865106,0.000027443471,0.00019426059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964602,0.000019292775,0.0006334973,0.0014406872,0.00088355236,0.00056274276],"domain_scores_gemma":[0.9983144,0.00019813611,0.00036530328,0.0006103278,0.00041049768,0.00010138218],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00085219735,0.00049254985,0.00048691832,0.00035832656,0.00035428297,0.0034756758,0.002257075,0.00027857433,0.000011853708],"category_scores_gemma":[0.00009128811,0.00045677848,0.00012656537,0.000461948,0.0006540595,0.003729493,0.0014188044,0.0006718572,0.00002012473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062894883,0.000034923884,0.0004427441,0.00010284961,0.000042664655,0.000054420376,0.005409857,0.41848686,0.000035351855,0.2838578,0.0000069702965,0.29151928],"study_design_scores_gemma":[0.00014615926,0.00004561165,0.00016408252,0.00054031465,0.000009962439,0.000080248945,6.6828864e-7,0.98625857,0.000097444856,0.010633083,0.0014737177,0.00055015285],"about_ca_topic_score_codex":0.000025870982,"about_ca_topic_score_gemma":0.00013599481,"teacher_disagreement_score":0.93127227,"about_ca_system_score_codex":0.00026931684,"about_ca_system_score_gemma":0.0002412555,"threshold_uncertainty_score":0.9997884},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036166846,0.00028313094,0.99421364,0.0001975783,0.0008814068,0.0003293542,0.000011631756,0.00007257486,0.00039398827],"genre_scores_gemma":[0.23474969,0.00005795375,0.7641459,0.00075892435,0.00020885233,0.000004824896,0.000025548836,0.000014568063,0.00003374371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966415,0.00004043469,0.0009343203,0.0008205787,0.0009687167,0.00059441244],"domain_scores_gemma":[0.997117,0.0003889845,0.00076010334,0.0010744305,0.0004889501,0.00017052153],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008357248,0.00043082,0.00069121615,0.0020625168,0.0003504925,0.00073866424,0.001954097,0.00029268774,0.000040570456],"category_scores_gemma":[0.000093999675,0.00041398988,0.00019898066,0.0015721155,0.00054012996,0.0025355325,0.0011945926,0.0004829551,0.00001615254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010109426,0.00004023677,0.00031843537,0.00012001426,0.00018846772,0.0000066293023,0.0043023014,0.22822845,0.00031024363,0.08015254,0.000024340065,0.68629825],"study_design_scores_gemma":[0.00021959281,0.00007554173,0.00053537096,0.00014157502,0.00008792791,0.00002029098,0.0000010178234,0.9848046,0.0007555327,0.012132979,0.00081172556,0.00041388464],"about_ca_topic_score_codex":0.00008325545,"about_ca_topic_score_gemma":0.000017449094,"teacher_disagreement_score":0.7565761,"about_ca_system_score_codex":0.00020705411,"about_ca_system_score_gemma":0.00030105893,"threshold_uncertainty_score":0.9998312},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016027882,0.0006357875,0.9686076,0.0005748894,0.0001583133,0.00039114672,0.000025799312,0.00009060636,0.027913036],"genre_scores_gemma":[0.9115015,0.000080393176,0.08721267,0.00018713532,0.0006876399,0.000007259084,0.00016164906,0.000029261671,0.00013245553],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970792,0.00012875636,0.00045528787,0.00081606244,0.000861965,0.00065874954],"domain_scores_gemma":[0.99625146,0.0010557433,0.00011914647,0.0022975416,0.00018699114,0.000089133464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028135863,0.00031343082,0.00048958004,0.006655862,0.000262764,0.00041553995,0.00402206,0.0001463826,0.00015763885],"category_scores_gemma":[0.0000150951555,0.0003017756,0.000088508285,0.0039589894,0.0011732512,0.00028635442,0.002639206,0.0017432999,0.0000067901287],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005185673,0.000049957904,0.0059381374,0.0000070071906,0.000014769382,0.000014579975,0.00037341003,0.002337917,0.000006724036,0.010716935,0.00044982153,0.98008555],"study_design_scores_gemma":[0.0002191295,0.00013875043,0.0013146725,0.0010360521,0.000015271891,0.0000040093823,0.000005519557,0.33290112,0.00006601226,0.6485105,0.015076228,0.00071271637],"about_ca_topic_score_codex":0.0008287974,"about_ca_topic_score_gemma":0.0015259495,"teacher_disagreement_score":0.97937286,"about_ca_system_score_codex":0.00007081039,"about_ca_system_score_gemma":0.00021575727,"threshold_uncertainty_score":0.99994344},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053506284,0.0053868745,0.9859048,0.00030403383,0.0014794294,0.0008802281,0.000026922764,0.000032679083,0.0006344019],"genre_scores_gemma":[0.08376796,0.00060131744,0.9034378,0.0027879807,0.0028938984,0.000045108096,0.00035408983,0.00010456273,0.0060072695],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99773765,0.000017848439,0.0003066546,0.0010693504,0.00035554773,0.0005129446],"domain_scores_gemma":[0.99883074,0.00004888001,0.00014843326,0.00069005025,0.00018934808,0.000092539114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003269934,0.00041562316,0.00034660476,0.00021681131,0.00012120517,0.00010816614,0.0008437008,0.00032968633,0.000013430858],"category_scores_gemma":[0.00007929885,0.00037312577,0.00020430915,0.000098930235,0.00029742098,0.000008076317,0.00027138076,0.00024085397,0.000007418364],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006399591,0.000039270526,0.000030659754,0.000050755483,0.00006405651,0.000015411166,0.000103769984,0.0050365836,0.1480853,0.00019755636,0.0002598556,0.84605277],"study_design_scores_gemma":[0.0045720567,0.0032477546,0.00066120905,0.0003973332,0.00022250254,0.00020711857,4.7212663e-7,0.09583921,0.6011949,0.20630231,0.082762465,0.0045926156],"about_ca_topic_score_codex":0.0000034956809,"about_ca_topic_score_gemma":0.000014324401,"teacher_disagreement_score":0.84146017,"about_ca_system_score_codex":0.00007038617,"about_ca_system_score_gemma":0.00017893923,"threshold_uncertainty_score":0.9998721},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006385707,0.00015695243,0.98908085,0.0005686564,0.00024036407,0.00028451395,0.0000062716827,0.000021562048,0.0032551368],"genre_scores_gemma":[0.9961361,0.000009775691,0.003243038,0.00024779336,0.00031077833,0.000008140053,0.0000080746595,0.0000084214835,0.00002783392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981275,0.000064264736,0.00033246036,0.0005687697,0.000581301,0.00032568927],"domain_scores_gemma":[0.99878544,0.00045789385,0.00028676863,0.00015742226,0.00023159473,0.000080887046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007794737,0.00020858867,0.00055916316,0.00075538486,0.0003526487,0.00014799839,0.00056227186,0.00044072757,0.000053536805],"category_scores_gemma":[0.0001482898,0.00018725911,0.00010014846,0.0013828783,0.0017275502,0.00022381646,0.00008187732,0.00059542427,5.664054e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011635252,0.00012718083,0.04303623,0.00004137178,0.00015478476,0.00002631579,0.025906147,0.14569703,0.000031733587,0.022756252,0.00000215005,0.76210445],"study_design_scores_gemma":[0.00059642864,0.000084408246,0.036648944,0.00009505855,0.00023820167,4.5256544e-7,0.000011911926,0.9215102,0.00008986335,0.039885864,0.00028781305,0.00055081013],"about_ca_topic_score_codex":0.00041827044,"about_ca_topic_score_gemma":0.0049487995,"teacher_disagreement_score":0.98975044,"about_ca_system_score_codex":0.000109624896,"about_ca_system_score_gemma":0.0005107135,"threshold_uncertainty_score":0.7636205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032522957,0.0008792023,0.99385595,0.0005414788,0.00065502047,0.00036279214,0.0000042133865,0.0001566144,0.0032194902],"genre_scores_gemma":[0.019666418,0.00006392584,0.9777632,0.0017048853,0.00052055257,0.0000019001986,0.0000022916836,0.000052657786,0.00022418585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540573,0.000106287654,0.0006523217,0.001857273,0.0010569697,0.00092139485],"domain_scores_gemma":[0.9972666,0.00054041046,0.00032471167,0.0013007361,0.0003085929,0.0002589778],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016241189,0.00069677265,0.0007550356,0.000960386,0.0005675076,0.0014928409,0.0025187575,0.00033245573,0.000021168844],"category_scores_gemma":[0.000077404264,0.0006659417,0.0001401042,0.0005316147,0.00096753734,0.0017371179,0.0020216936,0.00087216386,0.000012475045],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009496873,0.000018045488,0.00000291913,0.000047969384,0.000010966872,0.00021684839,0.00077769335,0.012625377,0.0066229994,0.003753059,0.000012325196,0.9759023],"study_design_scores_gemma":[0.00038370996,0.00006021739,0.00004277176,0.00033281313,0.0000138841215,0.00040955291,1.4383222e-7,0.8712848,0.001278897,0.1251711,0.00031739613,0.0007047509],"about_ca_topic_score_codex":0.000036468697,"about_ca_topic_score_gemma":0.000015286405,"teacher_disagreement_score":0.97519755,"about_ca_system_score_codex":0.00035677518,"about_ca_system_score_gemma":0.0004917627,"threshold_uncertainty_score":0.9995792},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035611697,0.00015175948,0.99304473,0.00024344565,0.00017408936,0.00050438277,0.0000061962382,0.0000824307,0.0054368563],"genre_scores_gemma":[0.25072768,0.00090137136,0.74527186,0.0013644142,0.00056606415,0.000038320646,0.000036887508,0.00005206847,0.0010412884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988025,0.0000082208235,0.00023445778,0.0005848262,0.0002029848,0.00016704471],"domain_scores_gemma":[0.99916697,0.0001747533,0.00013539875,0.00026473595,0.00018353194,0.000074632255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010434004,0.00021916331,0.00026956928,0.00029162853,0.00012907147,0.00006461594,0.00011259511,0.00017152511,0.00009075703],"category_scores_gemma":[0.0000686502,0.00019250906,0.000029332616,0.00018919818,0.00056029676,0.00020702742,0.0000738593,0.0004148599,0.0000071745644],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015953421,0.000027869877,0.00010230617,0.000023782672,0.000007630147,0.000010026513,0.00071557466,0.00095065683,0.0020624537,0.006898381,0.000018020493,0.98916733],"study_design_scores_gemma":[0.00210909,0.0022072047,0.0014058565,0.005677686,0.00022427102,0.0058000754,0.000010649347,0.50446314,0.077896126,0.3836535,0.01400581,0.002546633],"about_ca_topic_score_codex":0.0000051396546,"about_ca_topic_score_gemma":0.000010191738,"teacher_disagreement_score":0.9866207,"about_ca_system_score_codex":0.00021230057,"about_ca_system_score_gemma":0.0000688617,"threshold_uncertainty_score":0.7850292},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051557807,0.00019512861,0.9908095,0.00055525085,0.00091554876,0.0005204937,0.0000052351324,0.00072820665,0.006219064],"genre_scores_gemma":[0.39597434,0.00004188328,0.6000831,0.0030543695,0.00050123263,0.000011675787,0.000008109011,0.000043571752,0.00028170925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960359,0.00007495277,0.0005739586,0.001571539,0.0011135397,0.0006301353],"domain_scores_gemma":[0.9970757,0.00069088256,0.00034610787,0.0014529679,0.0002591759,0.0001751886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056987687,0.00061508856,0.0006032307,0.0011794227,0.00040806204,0.00037374411,0.0027714712,0.00037309685,0.000012734168],"category_scores_gemma":[0.00013806885,0.00055330916,0.00018245695,0.0005379626,0.0004642372,0.00020458674,0.0005117894,0.0009148108,0.00005284267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009649233,0.000020617465,0.000011913146,0.0000075859684,0.0000070869432,0.00003065506,0.00026676597,0.73327833,0.000013902425,0.0016992661,0.00015332193,0.26450092],"study_design_scores_gemma":[0.0003978115,0.00028958326,0.00010707278,0.0002287007,0.000004397465,0.000057715344,1.1409617e-8,0.9624308,0.00057205197,0.03381157,0.0015134367,0.0005868995],"about_ca_topic_score_codex":0.000011491583,"about_ca_topic_score_gemma":0.000012321782,"teacher_disagreement_score":0.39592278,"about_ca_system_score_codex":0.00024201772,"about_ca_system_score_gemma":0.00037744013,"threshold_uncertainty_score":0.99969184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019447067,0.00047263963,0.99413157,0.0002941491,0.0009736954,0.00030304395,0.000002952026,0.000024447218,0.001852829],"genre_scores_gemma":[0.5799247,0.00005067005,0.41891786,0.0002600282,0.00029099235,0.00001147624,0.0000067917103,0.000016729906,0.0005207619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977006,0.000039366623,0.0005007725,0.00063423795,0.0008463504,0.0002786921],"domain_scores_gemma":[0.9977796,0.00039232615,0.00035036742,0.0009994835,0.00039668774,0.00008153083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007753214,0.00024129098,0.00030089356,0.00039146593,0.00017850235,0.00022162726,0.0021293352,0.00010868658,0.0000257143],"category_scores_gemma":[0.00004582868,0.00017249765,0.00009859487,0.00045376027,0.00047599635,0.0004832234,0.0005975493,0.0002328936,0.0000113971155],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046401224,0.000035087487,0.000011729996,0.00002508609,0.000011970002,0.0000022697436,0.0004433312,0.05004068,0.0014812945,0.046306588,0.000020492986,0.9016168],"study_design_scores_gemma":[0.0002484365,0.00052835466,0.0006788158,0.00016360481,0.000009525782,0.000015046586,4.3469075e-7,0.7714488,0.03247134,0.19158626,0.0024483204,0.00040108396],"about_ca_topic_score_codex":0.000021701133,"about_ca_topic_score_gemma":0.000026349191,"teacher_disagreement_score":0.90121573,"about_ca_system_score_codex":0.00006328709,"about_ca_system_score_gemma":0.00029057064,"threshold_uncertainty_score":0.703425},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036616173,0.0014844036,0.98934907,0.0008684834,0.0062388633,0.0012051312,0.000010413249,0.00038884496,0.0004181915],"genre_scores_gemma":[0.021114355,0.000090223206,0.9745642,0.0015293516,0.001818357,0.00007446665,0.00001824137,0.00010354035,0.0006872766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495727,0.000026570617,0.00073479576,0.0022187752,0.00083624065,0.0012263337],"domain_scores_gemma":[0.9956234,0.0012233411,0.00038930032,0.0020848706,0.0003191994,0.00035986313],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012359915,0.00081357406,0.00086643436,0.0005980113,0.0006177759,0.0014695417,0.0063513326,0.00080475386,0.000037925973],"category_scores_gemma":[0.00014095377,0.000731991,0.0002957747,0.0006908578,0.00065210956,0.00075709197,0.0017342708,0.0015157928,0.000051128274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012893531,0.00003052842,0.000011264006,0.000037105365,0.0000137451625,0.00004892753,0.00011750983,0.3985168,0.0000132857385,0.013749521,0.00028552016,0.58716285],"study_design_scores_gemma":[0.00050180504,0.00021439744,0.000026628522,0.0003295188,0.000015706128,0.00009559742,4.1927045e-8,0.93840265,0.00008276437,0.043924134,0.015518165,0.0008885946],"about_ca_topic_score_codex":0.000008805956,"about_ca_topic_score_gemma":0.000062415005,"teacher_disagreement_score":0.58627427,"about_ca_system_score_codex":0.00018140818,"about_ca_system_score_gemma":0.00078165537,"threshold_uncertainty_score":0.99956703},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014546428,0.000059497717,0.99535996,0.0005251891,0.0010926126,0.0013234912,0.000020109828,0.00007154117,0.001402114],"genre_scores_gemma":[0.045995288,0.000006694658,0.9521313,0.0006606511,0.0008519739,0.000036904927,0.0000042691927,0.00009827028,0.00021469074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966202,0.00004336647,0.0011085671,0.0007720075,0.0009129748,0.00054290623],"domain_scores_gemma":[0.9922813,0.0047046393,0.0011781951,0.0013912967,0.00036034363,0.000084181505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001863074,0.0005018963,0.0010260848,0.00026781973,0.00030189077,0.0001338265,0.0018658689,0.0002717926,0.000017400276],"category_scores_gemma":[0.0013914491,0.00038361858,0.0002096422,0.0002815433,0.000654986,0.0001202147,0.0007461902,0.00064873585,0.0000065984564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014192357,0.00004898951,0.0000025800089,0.0011677317,0.000049492464,0.0000025166162,0.004092409,0.0010463216,0.00070759706,0.9092701,0.00006654206,0.0835315],"study_design_scores_gemma":[0.00033695772,0.0001224349,0.0000018414788,0.0011845795,0.00003440209,0.000011490878,0.0000029465286,0.111769386,0.0017572491,0.8835391,0.00085150206,0.0003881129],"about_ca_topic_score_codex":0.000007908056,"about_ca_topic_score_gemma":0.000016246893,"teacher_disagreement_score":0.11072306,"about_ca_system_score_codex":0.00021003283,"about_ca_system_score_gemma":0.00015534365,"threshold_uncertainty_score":0.9998616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022353932,0.00010644742,0.9887498,0.0007568415,0.0003243798,0.00044685972,0.0000020012585,0.0004329099,0.00915843],"genre_scores_gemma":[0.011917078,0.00003158551,0.9830588,0.003999823,0.00034095175,0.000013472017,0.0000035012922,0.00003199424,0.00060281286],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961238,0.000029759727,0.00043242826,0.0014861469,0.0012709036,0.0006569642],"domain_scores_gemma":[0.99758965,0.00027942169,0.00030744635,0.00133094,0.00023650443,0.0002560601],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054356526,0.00050732837,0.0004950772,0.0007356996,0.0001969479,0.0005329358,0.0032772932,0.00024293062,0.000040171974],"category_scores_gemma":[0.000061754625,0.00041365443,0.000084136045,0.0005364543,0.0006007626,0.0009879248,0.00073085167,0.00088444795,0.000030715],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051465045,0.000016677324,0.000006843938,0.000012612552,0.000006659418,0.00012835089,0.0003120249,0.0004959668,0.00048648924,0.002972382,0.000027055354,0.9955298],"study_design_scores_gemma":[0.0020875335,0.0026020282,0.0014468536,0.0033613567,0.000049176902,0.000878544,9.403595e-7,0.20969868,0.2604312,0.51104075,0.003858147,0.0045448043],"about_ca_topic_score_codex":0.000023308534,"about_ca_topic_score_gemma":0.00003976965,"teacher_disagreement_score":0.990985,"about_ca_system_score_codex":0.0003638275,"about_ca_system_score_gemma":0.00048078594,"threshold_uncertainty_score":0.99983156},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011698091,0.00024440212,0.9961363,0.0010909919,0.0005878098,0.00040441964,0.00025095098,0.000480289,0.00079310185],"genre_scores_gemma":[0.011120887,0.00003271556,0.98729116,0.00063299196,0.0003954714,0.000018004375,0.00043171973,0.00003599103,0.000041077154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951793,0.000018677963,0.0007424841,0.0024193136,0.00091364444,0.00072660146],"domain_scores_gemma":[0.99433815,0.0004202928,0.00042148813,0.004415036,0.00019416565,0.000210852],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010536538,0.0005563009,0.0006458064,0.00056756515,0.00043403226,0.0010915034,0.010333749,0.00031537315,0.000013275904],"category_scores_gemma":[0.00013820024,0.0005412145,0.00007601844,0.0009307874,0.0006043331,0.0010258777,0.005605091,0.000868472,0.000035098124],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018954963,0.000044742388,0.000030163988,0.000025940606,0.000009822097,0.000023328783,0.0003297586,0.0036639364,0.000033616794,0.012941562,0.00015042379,0.9827448],"study_design_scores_gemma":[0.00022521129,0.0001430594,0.00008699696,0.0009909882,0.000017440072,0.00007230489,5.414494e-7,0.9211622,0.00067642704,0.054935433,0.0206984,0.0009909902],"about_ca_topic_score_codex":0.00006253086,"about_ca_topic_score_gemma":0.00005546903,"teacher_disagreement_score":0.9817538,"about_ca_system_score_codex":0.00038441684,"about_ca_system_score_gemma":0.0008590824,"threshold_uncertainty_score":0.99994546},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075272267,0.00007942127,0.9940687,0.0012159753,0.0004122731,0.00075715943,0.0000065315044,0.00012763366,0.0025795968],"genre_scores_gemma":[0.6190527,0.000004694684,0.3794234,0.0009289031,0.0002709344,0.00016548915,0.000033934717,0.00002328532,0.000096650314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647164,0.000056087312,0.00035851373,0.0012858163,0.0013843357,0.0004436134],"domain_scores_gemma":[0.9974592,0.00045896127,0.00025447286,0.0011503267,0.0005320017,0.00014505873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012186893,0.00037647688,0.00034404936,0.00039146416,0.0003919018,0.0003601243,0.0013395016,0.00018561532,0.00009052892],"category_scores_gemma":[0.0000580189,0.00031532586,0.000087053784,0.00056593714,0.00040482392,0.00055148924,0.00018725639,0.0004671724,0.000065049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006074484,0.00004986993,0.000023940582,0.000018049475,0.000009898934,0.000008777723,0.0003011882,0.43575022,0.00003322615,0.056565467,0.000040174167,0.5071931],"study_design_scores_gemma":[0.00031662517,0.00016541615,0.00077651715,0.0002323955,0.000011586927,0.000014525889,1.9904896e-7,0.839809,0.00014364494,0.15793408,0.00023829575,0.0003577338],"about_ca_topic_score_codex":0.000028151242,"about_ca_topic_score_gemma":0.000049378483,"teacher_disagreement_score":0.61829996,"about_ca_system_score_codex":0.0004121429,"about_ca_system_score_gemma":0.0009437741,"threshold_uncertainty_score":0.9999299},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045476936,0.00104233,0.98416233,0.0012479882,0.002405135,0.00038863905,0.000017840764,0.00039249661,0.010297775],"genre_scores_gemma":[0.08787392,0.0002254288,0.9032658,0.0046421867,0.0023982325,0.000021490054,0.000021525071,0.00009420489,0.0014572361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944145,0.00004306442,0.00071623456,0.0022247108,0.0014950893,0.0011063654],"domain_scores_gemma":[0.99623823,0.00057754887,0.0003025314,0.00230893,0.00023458268,0.00033817507],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000949687,0.00081489957,0.00074651605,0.0012763533,0.000463015,0.0008559882,0.0061833616,0.00045843775,0.00006847311],"category_scores_gemma":[0.000074045296,0.00077918003,0.00026202147,0.0009827,0.0010917586,0.0008073878,0.0015922042,0.001442546,0.0001540579],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029982216,0.000059809547,0.000053109663,0.000018186032,0.000015599788,0.00028118596,0.0006099781,0.006807722,0.000038310336,0.06124154,0.000117570555,0.930754],"study_design_scores_gemma":[0.00041220066,0.00034328265,0.00033087548,0.0004982636,0.000017594553,0.0004548414,2.588568e-7,0.55206853,0.000505941,0.42105952,0.022504354,0.00180431],"about_ca_topic_score_codex":0.00005032367,"about_ca_topic_score_gemma":0.0003301305,"teacher_disagreement_score":0.92894965,"about_ca_system_score_codex":0.00036340626,"about_ca_system_score_gemma":0.0006455495,"threshold_uncertainty_score":0.99946594},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002252193,0.000018354613,0.9934872,0.0008161134,0.0020077892,0.00053740444,0.000005272496,0.0001569883,0.00071869267],"genre_scores_gemma":[0.23119724,0.000027150269,0.76684284,0.00041494652,0.00097606686,0.000035379308,0.00010950297,0.000034954588,0.00036193294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754006,0.000028174392,0.00042421656,0.0009960963,0.0006127054,0.0003987524],"domain_scores_gemma":[0.99849135,0.00016497725,0.00022754917,0.0006116393,0.0003619003,0.00014259126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009795344,0.0003306767,0.0003140142,0.00046456102,0.00052124774,0.00026410012,0.00106267,0.00039749252,0.00002367175],"category_scores_gemma":[0.000057033893,0.00029863144,0.00011338375,0.00026599472,0.00024610682,0.0014263083,0.00019849458,0.00089038344,0.00002659401],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023749779,0.000046728346,0.0000029382359,0.000053980857,0.0000051451393,0.0000035298312,0.0014895727,0.03201916,0.0224748,0.0029908807,0.000010823567,0.9408787],"study_design_scores_gemma":[0.00040199858,0.00038842257,0.00003361898,0.00024061014,0.000007994032,0.000047516696,7.728069e-7,0.8706216,0.040569916,0.08426297,0.0029303636,0.000494215],"about_ca_topic_score_codex":0.000013751288,"about_ca_topic_score_gemma":0.000027054126,"teacher_disagreement_score":0.94038445,"about_ca_system_score_codex":0.00009428991,"about_ca_system_score_gemma":0.00024324373,"threshold_uncertainty_score":0.9999466},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000870439,0.00018017588,0.99817395,0.0003189957,0.0004980304,0.00038958015,0.000006342315,0.000071238064,0.0002746567],"genre_scores_gemma":[0.049876697,0.000047724756,0.94898164,0.0006795033,0.00016594947,0.000014308717,0.000003412668,0.000014966526,0.00021576832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978994,0.000009604705,0.0003186227,0.0009947267,0.0004132421,0.0003643704],"domain_scores_gemma":[0.9988772,0.0002869201,0.000105521125,0.00053316756,0.00009326841,0.000103870414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002858885,0.0002594038,0.00027896505,0.00027748017,0.00019223763,0.00023561777,0.00086759246,0.00014820734,0.0000020917978],"category_scores_gemma":[0.000043424472,0.0002523208,0.000039803013,0.00009290557,0.00023294642,0.00035170323,0.000641161,0.00026059075,0.0000020605623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000304587,0.0000060511434,0.000014155325,0.000048733356,0.000003690488,0.000014787319,0.0012954519,0.24239269,0.000052030602,0.014467239,0.000011250371,0.7416909],"study_design_scores_gemma":[0.00020263887,0.000052786832,0.000017757264,0.00007490642,0.0000032059565,0.0000440079,6.8738835e-8,0.9202782,0.00007677695,0.07892034,0.00008327522,0.00024606186],"about_ca_topic_score_codex":0.000008214754,"about_ca_topic_score_gemma":0.00004138003,"teacher_disagreement_score":0.7414448,"about_ca_system_score_codex":0.00014876433,"about_ca_system_score_gemma":0.00024262794,"threshold_uncertainty_score":0.9999929},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013542458,0.0005543169,0.9705491,0.00009522981,0.0030234463,0.00060487766,8.4860085e-7,0.0003279011,0.024830703],"genre_scores_gemma":[0.58568656,0.00009196869,0.40682086,0.0011114192,0.0013124971,0.000053886255,0.000010181466,0.000081948296,0.0048306505],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962834,0.000041091862,0.00052393915,0.0015484336,0.0008679716,0.00073515595],"domain_scores_gemma":[0.99767023,0.00010277407,0.00033834428,0.0014977083,0.000252907,0.00013806259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010336522,0.00053155335,0.00050595315,0.00076924526,0.00023793815,0.00074510975,0.0033506253,0.00040282725,0.000023528988],"category_scores_gemma":[0.000053265714,0.0004437579,0.00015965024,0.00058334984,0.0005128023,0.0008159629,0.0011315665,0.0006739395,0.000192555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004023319,0.00003647103,0.00009854643,0.00006462673,0.000012323203,0.000095250085,0.0015266413,0.00012075052,0.00008791021,0.3887358,0.00009860748,0.60911906],"study_design_scores_gemma":[0.00035425613,0.00042510938,0.00011881762,0.00013293051,0.00001474768,0.00027690723,3.443677e-7,0.055239767,0.0011469352,0.9070822,0.033937853,0.0012701518],"about_ca_topic_score_codex":0.00017618207,"about_ca_topic_score_gemma":0.00012780746,"teacher_disagreement_score":0.6078489,"about_ca_system_score_codex":0.00025151751,"about_ca_system_score_gemma":0.00059280137,"threshold_uncertainty_score":0.9998014},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008647845,0.002822789,0.9922793,0.00022236886,0.00068916194,0.00055647315,0.00020116154,0.000012156418,0.0023518305],"genre_scores_gemma":[0.8679808,0.000050476843,0.13122134,0.0002165122,0.00014974474,0.000008944584,0.00013918256,0.000020698712,0.00021230128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98265225,0.0015328627,0.006795867,0.0026205452,0.0058299806,0.0005685103],"domain_scores_gemma":[0.9520092,0.031297863,0.005231673,0.010345824,0.00094833254,0.00016709865],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.0764276,0.0007040705,0.00599076,0.001601662,0.00026470475,0.0010384436,0.010288496,0.00027587987,0.0024782813],"category_scores_gemma":[0.046795625,0.00037012348,0.0020416237,0.0056688734,0.0010649647,0.00076461904,0.0026099898,0.00056936755,0.00018361174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026645996,0.00015946533,0.07150706,0.00043521324,0.0044335686,0.000036797734,0.0027198372,0.05536212,0.00054834835,0.017921256,0.0015814999,0.8452682],"study_design_scores_gemma":[0.00016152766,0.00012035914,0.0037280256,0.0006763739,0.005374037,0.000021984695,0.0000018357227,0.8914114,0.00048332557,0.091952436,0.005196691,0.00087196036],"about_ca_topic_score_codex":0.000027923523,"about_ca_topic_score_gemma":0.00012439396,"teacher_disagreement_score":0.86711603,"about_ca_system_score_codex":0.00008868685,"about_ca_system_score_gemma":0.00016060586,"threshold_uncertainty_score":0.99999857},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000092198134,0.0012051418,0.9937073,0.00041738918,0.0020922117,0.00033453162,0.0000016774578,0.00010831697,0.0020412346],"genre_scores_gemma":[0.021451712,0.00006468969,0.9766712,0.0008690587,0.00058888097,0.000010771888,0.0000011531818,0.000033584358,0.00030890366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582916,0.00009186818,0.00064614543,0.0014456533,0.00094897125,0.0010381675],"domain_scores_gemma":[0.9974634,0.0007023029,0.00027958988,0.0012151819,0.00009909446,0.00024042149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019843918,0.0005244477,0.00065597706,0.0008105425,0.00014184829,0.00041481134,0.0031408423,0.00030066533,0.000033913835],"category_scores_gemma":[0.00016525868,0.0004689283,0.00015655765,0.0009176383,0.00038215073,0.00076097326,0.0018002257,0.0011124739,0.000055871948],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000124379,0.000039866427,0.00019023176,0.000025088068,0.0000042239176,0.000058961192,0.0002589946,0.0028864427,0.00013266347,0.0096364,0.0000024570622,0.9867634],"study_design_scores_gemma":[0.0003662721,0.00015391898,0.0012695664,0.00067157176,0.0000087332255,0.00008940673,1.11507994e-7,0.69572574,0.0008964481,0.29566792,0.004026202,0.0011240795],"about_ca_topic_score_codex":0.00004238955,"about_ca_topic_score_gemma":0.000028166905,"teacher_disagreement_score":0.98563933,"about_ca_system_score_codex":0.00027348465,"about_ca_system_score_gemma":0.00027117407,"threshold_uncertainty_score":0.99977624},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034733395,0.00046169775,0.9961933,0.00009726058,0.00068439275,0.00024553837,0.00000865988,0.00007689254,0.0021975331],"genre_scores_gemma":[0.94018614,0.00003480119,0.05894059,0.0005289585,0.00022978794,0.000007736791,0.0000070495093,0.000036050005,0.00002891297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839807,0.000016180276,0.00034288282,0.00040564203,0.00040900926,0.0004282426],"domain_scores_gemma":[0.99885064,0.00040549744,0.00010328678,0.0004439298,0.000088795154,0.00010786519],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002880528,0.0003082783,0.00047237735,0.0007602508,0.000053855503,0.00003242239,0.0005532457,0.00031302904,0.00010489341],"category_scores_gemma":[0.00006620207,0.00027491944,0.00009795877,0.00042690986,0.00016248002,0.00006932993,0.00007372601,0.00047986448,0.000014367171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008230034,0.000015901936,0.0000042562547,0.000021360169,0.0000081853605,0.0000045489924,0.000024770441,0.6625395,0.000029262537,0.004975872,0.000009031739,0.3323591],"study_design_scores_gemma":[0.00026371685,0.00016935144,0.0000126166515,0.000095593445,0.000016482989,0.000007830253,4.0253017e-8,0.9936158,0.00028810155,0.0050321086,0.0002327001,0.0002656241],"about_ca_topic_score_codex":0.000009206939,"about_ca_topic_score_gemma":0.0000038302696,"teacher_disagreement_score":0.9401514,"about_ca_system_score_codex":0.00020643619,"about_ca_system_score_gemma":0.000106130195,"threshold_uncertainty_score":0.9999703},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000075214557,0.00021681174,0.9933576,0.0011982297,0.0014804645,0.00090327585,0.00029883164,0.00066274364,0.0018744998],"genre_scores_gemma":[0.012108197,0.0001192025,0.984511,0.0017877397,0.00053011393,0.00004616808,0.0004677377,0.000065822394,0.0003640285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946633,0.00003125759,0.00077994773,0.0026886151,0.0009837692,0.0008531412],"domain_scores_gemma":[0.99311715,0.00077774463,0.0005737692,0.004973676,0.00037311335,0.00018457169],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011595737,0.0006466889,0.00067940593,0.00069251185,0.00042862212,0.0005214452,0.010825471,0.000357547,0.000016183774],"category_scores_gemma":[0.0004703542,0.0006144181,0.00011120238,0.0005488169,0.00066127547,0.0015416088,0.0037272007,0.00069072936,0.00003848597],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000106732,0.000038835013,0.000091556925,0.00008752358,0.000016439537,0.00006636656,0.0003504335,0.00045862593,0.00063753675,0.00819221,0.003867403,0.9861824],"study_design_scores_gemma":[0.00043955093,0.00023916975,0.00040287455,0.0003179424,0.000011833277,0.00025267893,6.7942366e-8,0.9120041,0.0035987687,0.046236873,0.03527132,0.0012248221],"about_ca_topic_score_codex":0.000014969144,"about_ca_topic_score_gemma":0.000033613076,"teacher_disagreement_score":0.9849576,"about_ca_system_score_codex":0.00028417745,"about_ca_system_score_gemma":0.0009403375,"threshold_uncertainty_score":0.9996307},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043566892,0.0002604096,0.99024594,0.00019327748,0.0016527363,0.00070458127,0.000018549898,0.00030781506,0.006181006],"genre_scores_gemma":[0.5184126,0.00002601018,0.4808159,0.00035476746,0.00013297553,0.000014152416,0.0000073560077,0.000024966985,0.0002112978],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952571,0.00007749827,0.00083373877,0.0017490471,0.001347626,0.0007350099],"domain_scores_gemma":[0.9961508,0.00030673156,0.00071129325,0.0019466467,0.00075201225,0.00013251224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010512723,0.00070084777,0.000873345,0.00085868116,0.00021512325,0.00030406428,0.0046471525,0.00035045296,0.00007346855],"category_scores_gemma":[0.00007915403,0.00061531074,0.00017786835,0.0006227769,0.0012338863,0.0012948056,0.002545283,0.0011306348,0.000008545681],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032805117,0.000090298825,0.00044386776,0.00026065472,0.00007522475,0.00016395921,0.0017369451,0.001279184,0.0067379894,0.06696063,0.00014657983,0.9220719],"study_design_scores_gemma":[0.0007423213,0.00096338877,0.014075134,0.0011032814,0.00003848099,0.0001199581,5.9393034e-7,0.17964078,0.23683411,0.5637639,0.00031277625,0.0024052404],"about_ca_topic_score_codex":0.0001399824,"about_ca_topic_score_gemma":0.00004054132,"teacher_disagreement_score":0.9196666,"about_ca_system_score_codex":0.00051677966,"about_ca_system_score_gemma":0.0007348344,"threshold_uncertainty_score":0.9996298},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015579067,0.0013565761,0.9869963,0.0013117254,0.0011433852,0.000274001,0.00001022732,0.00017717469,0.008574844],"genre_scores_gemma":[0.14365907,0.00032506615,0.8513241,0.0035016069,0.00075155526,0.000006447208,0.0000044309877,0.00004028122,0.0003874373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996471,0.000024428355,0.0004134823,0.0016248828,0.00078935537,0.00067686895],"domain_scores_gemma":[0.99797314,0.00031193288,0.0001986054,0.0011844592,0.00011190355,0.00021997301],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036794288,0.00054568227,0.00050821394,0.0004929979,0.00026012323,0.0007877531,0.0025607734,0.00033721523,0.000024625058],"category_scores_gemma":[0.00003774327,0.00044757276,0.00009737444,0.00035093213,0.00060343754,0.0007634913,0.0015824378,0.00068475574,0.000042415577],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016550113,0.000012737913,0.00005099571,0.000015367285,0.000005770097,0.000057674195,0.0005112967,0.00176681,0.000010362602,0.009801117,0.000031574727,0.9877346],"study_design_scores_gemma":[0.0004364423,0.00032086472,0.0012477166,0.00031616024,0.000009153238,0.00024604512,1.3084636e-7,0.72810936,0.00022834154,0.24773069,0.019908732,0.0014463601],"about_ca_topic_score_codex":0.000017529399,"about_ca_topic_score_gemma":0.00006442318,"teacher_disagreement_score":0.98628825,"about_ca_system_score_codex":0.00015164039,"about_ca_system_score_gemma":0.00025529726,"threshold_uncertainty_score":0.9997976},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008355907,0.003362249,0.9925222,0.0007461673,0.0013867782,0.0008050873,0.000042264346,0.00021786778,0.0008338436],"genre_scores_gemma":[0.07737458,0.00014282201,0.92063284,0.00070308166,0.0006360256,0.000037743735,0.00003929818,0.000060531296,0.00037308846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99448013,0.00018095507,0.0008450704,0.0018665559,0.0014598957,0.0011673825],"domain_scores_gemma":[0.9959827,0.000458089,0.0007959966,0.0015432707,0.00082113117,0.00039880918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015152186,0.0009351794,0.0012591103,0.0015095819,0.0003667313,0.00033693362,0.0033139042,0.0009792362,0.000036965645],"category_scores_gemma":[0.0002188055,0.0007936475,0.00035984843,0.003759426,0.00073731894,0.0008534662,0.00083313603,0.001578605,0.000014885575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004300048,0.00022322426,0.00018064039,0.00026581515,0.00007968054,0.00003462132,0.0008507668,0.004564283,0.0014837258,0.06463409,0.00030992887,0.9273302],"study_design_scores_gemma":[0.0011063064,0.0003450808,0.00023011671,0.0005334944,0.000120570316,0.00034665357,1.359646e-7,0.5436729,0.015401032,0.43044537,0.0059714722,0.0018268551],"about_ca_topic_score_codex":0.00003137556,"about_ca_topic_score_gemma":0.00003359341,"teacher_disagreement_score":0.9255034,"about_ca_system_score_codex":0.00039788475,"about_ca_system_score_gemma":0.0007010955,"threshold_uncertainty_score":0.99945146},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9841425,0.00025625093,0.0048931176,0.00021793508,0.0028765781,0.00076000456,0.00003213101,0.000108868575,0.0067126392],"genre_scores_gemma":[0.99901485,0.00006496245,0.00028564135,0.00025043509,0.000090579495,0.0000026787839,9.0835215e-7,0.0000094434,0.00028052283],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99829894,0.000020781768,0.00040422397,0.0004257786,0.0005088149,0.00034144122],"domain_scores_gemma":[0.999057,0.0001360933,0.0002852084,0.00039176858,0.000079803605,0.000050102055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018583033,0.00024893964,0.00025111964,0.00018559476,0.000351019,0.00010920736,0.0010410278,0.00014670202,0.000016783779],"category_scores_gemma":[0.00007683212,0.00016093723,0.00007616916,0.00017368948,0.0013955999,0.00046760903,0.0005988,0.00047946654,0.000030699655],"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.00051487074,0.00008004433,0.007086931,0.000060877213,0.000012678295,0.000057930214,0.0037205622,0.00015532009,0.49780113,0.002239564,0.000007885977,0.4882622],"study_design_scores_gemma":[0.0006881733,0.0006804581,0.07596872,0.00028795382,0.000027227099,0.00018843217,0.0000012539203,0.0009500657,0.84239244,0.075409,0.0025688366,0.0008374067],"about_ca_topic_score_codex":0.000014520837,"about_ca_topic_score_gemma":0.000023150582,"teacher_disagreement_score":0.4874248,"about_ca_system_score_codex":0.000059546197,"about_ca_system_score_gemma":0.000057204506,"threshold_uncertainty_score":0.65628296},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35777554,0.000030474901,0.6402693,0.0017327005,0.00009769941,0.000063406515,0.000001943384,0.00002380205,0.000005162943],"genre_scores_gemma":[0.8343368,0.0000051229636,0.16447227,0.0011268314,0.000052859803,9.904555e-7,0.000003047562,0.0000014008672,6.6639166e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979883,0.00010515531,0.00037860867,0.0006593375,0.00043545966,0.0004331679],"domain_scores_gemma":[0.99893,0.00034264463,0.00013368137,0.00043293045,0.000078287034,0.000082451224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007988878,0.00015658332,0.00030593912,0.0007389226,0.00008386332,0.00017247225,0.001569242,0.000088120345,0.000017361164],"category_scores_gemma":[0.00029676882,0.00011803638,0.00006192097,0.0061768144,0.00032681943,0.00071457576,0.00037835742,0.0001925247,0.0000027115022],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005542704,0.00020955152,0.010675537,0.000004178607,0.0000021511976,0.000048556994,0.0002925151,0.014984371,0.08865682,0.001596029,0.0000012312416,0.8835235],"study_design_scores_gemma":[0.00023284614,0.0002915409,0.20729367,0.000032623222,0.0000026085067,0.000020029904,5.32535e-7,0.72330356,0.038210552,0.030353915,0.000013644782,0.0002445018],"about_ca_topic_score_codex":0.00006146293,"about_ca_topic_score_gemma":0.000013757375,"teacher_disagreement_score":0.883279,"about_ca_system_score_codex":0.00006579184,"about_ca_system_score_gemma":0.00007078189,"threshold_uncertainty_score":0.4813384},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016408584,0.00044814916,0.99727523,0.00009238791,0.0002902114,0.00060429494,0.00002973684,0.00020294181,0.0008929682],"genre_scores_gemma":[0.35670444,0.0003361892,0.6418159,0.0003247225,0.00041657465,0.0000714114,0.00010494108,0.000086822765,0.0001389873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842757,0.000009057695,0.00040792188,0.0005393024,0.00027095436,0.00034521578],"domain_scores_gemma":[0.9994057,0.00011417564,0.00008237547,0.00029071994,0.00005182358,0.000055204902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005436782,0.00031460598,0.0003400143,0.00066417636,0.00006439167,0.00013900555,0.00032375014,0.00021877671,0.0000010941104],"category_scores_gemma":[0.000026773727,0.00029109864,0.000050079314,0.00019349185,0.00011976434,0.0002076218,0.000046990455,0.00031135135,5.7865265e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013065359,0.000009767977,0.000016625654,0.000078507896,0.0000072369394,0.000013911215,0.0005660691,0.01758033,0.00091466564,0.0014489448,0.000071799725,0.9792791],"study_design_scores_gemma":[0.0006960762,0.00023357783,0.00027923417,0.0008215357,0.000010733097,0.000016668368,7.7011316e-7,0.8357116,0.007860064,0.15256912,0.0011419092,0.0006587118],"about_ca_topic_score_codex":0.000009248876,"about_ca_topic_score_gemma":0.00010275251,"teacher_disagreement_score":0.97862035,"about_ca_system_score_codex":0.00012678248,"about_ca_system_score_gemma":0.000029535782,"threshold_uncertainty_score":0.9999541},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000896876,0.0002954308,0.9850618,0.0004855329,0.00063332054,0.00060064544,0.000019374209,0.000035766367,0.012778402],"genre_scores_gemma":[0.6503784,0.0000034984712,0.34696877,0.0008627287,0.0005132986,0.00012697026,0.000010479704,0.000045317058,0.0010905429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812675,0.000022580129,0.00035442074,0.00068702665,0.0004820033,0.0003272072],"domain_scores_gemma":[0.9984766,0.0005420913,0.00017451771,0.00047544017,0.00020549816,0.00012584307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005079366,0.00024619058,0.0003752186,0.0003362654,0.00010527209,0.000039530853,0.00073062483,0.000129636,0.00018170246],"category_scores_gemma":[0.000048763697,0.00023042597,0.00006028516,0.0003221471,0.00042420728,0.000025619049,0.00031915097,0.0002957118,0.00019386545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035637448,0.00009272028,0.00007426538,0.00002887147,0.000053071883,0.000025072864,0.008245339,0.5470243,0.00010516531,0.092719056,0.0021376472,0.34945884],"study_design_scores_gemma":[0.0018915535,0.0013853353,0.0024422284,0.00089237257,0.00009400882,0.00018070673,0.000029798945,0.13748226,0.00031084608,0.74572265,0.10706315,0.0025050882],"about_ca_topic_score_codex":0.000032540454,"about_ca_topic_score_gemma":0.000020481737,"teacher_disagreement_score":0.6530036,"about_ca_system_score_codex":0.00011474085,"about_ca_system_score_gemma":0.00020607353,"threshold_uncertainty_score":0.9396499},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001393886,0.00095025694,0.9887123,0.0018051743,0.00170345,0.00050666375,0.000008332774,0.0002955075,0.005878901],"genre_scores_gemma":[0.23446782,0.00005060382,0.7571605,0.0063153272,0.0014496829,0.000031652668,0.000009114506,0.00006851731,0.00044677895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962831,0.000033752844,0.00057706214,0.0017110938,0.0006043264,0.0007906406],"domain_scores_gemma":[0.99784106,0.00061256386,0.00046562552,0.0006955894,0.00017828058,0.0002068769],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014145708,0.0005653614,0.0006198613,0.00066914817,0.00070655724,0.0010505776,0.0017392037,0.00031460362,0.0000074523837],"category_scores_gemma":[0.00008453521,0.00053041265,0.00012741899,0.00037828824,0.00027228243,0.0007549059,0.00077834126,0.0006590081,0.0000034516736],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060971674,0.0000113200485,0.00005520246,0.00027299544,0.000012780026,0.000029040437,0.001524464,0.00054421957,0.00009507834,0.0068528126,0.00022313673,0.99037284],"study_design_scores_gemma":[0.0007537254,0.00023759,0.000045477278,0.0032597955,0.000023944755,0.0003641857,0.0000029476926,0.9549693,0.00036768505,0.026939364,0.012020553,0.0010154622],"about_ca_topic_score_codex":0.000009242929,"about_ca_topic_score_gemma":0.000029622146,"teacher_disagreement_score":0.9893574,"about_ca_system_score_codex":0.00041693595,"about_ca_system_score_gemma":0.00041300067,"threshold_uncertainty_score":0.9999864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027159813,0.00017869657,0.99507135,0.00086169416,0.0018230861,0.0010457928,0.0000138167925,0.0004335914,0.0005448151],"genre_scores_gemma":[0.014366683,0.000017347103,0.98335654,0.0016588039,0.00024683872,0.000059232407,0.000019483683,0.000038410348,0.00023668348],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99481493,0.000039258233,0.00074017537,0.00213143,0.0014254265,0.0008487705],"domain_scores_gemma":[0.99672925,0.00069547235,0.00030836658,0.0015452089,0.00039225322,0.00032944532],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018114842,0.0005156434,0.0005965175,0.0011294209,0.00047170342,0.0015396717,0.0040571243,0.00035248234,0.0000246491],"category_scores_gemma":[0.00024136262,0.0004759465,0.00021396666,0.00068643765,0.0018220093,0.0011257608,0.0011473204,0.0007594409,0.000015956699],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015926884,0.000040468924,8.410636e-7,0.00009215191,0.000011125742,0.00004990063,0.0010125338,0.029940112,0.0013797272,0.080921605,0.000048095964,0.8864875],"study_design_scores_gemma":[0.0002938034,0.00014159555,8.408578e-7,0.000265348,0.000004384405,0.00001629191,5.7750462e-8,0.4508721,0.009244588,0.53868747,0.00012295258,0.00035058518],"about_ca_topic_score_codex":0.000009416731,"about_ca_topic_score_gemma":0.000006953526,"teacher_disagreement_score":0.88613695,"about_ca_system_score_codex":0.00044653332,"about_ca_system_score_gemma":0.0012196444,"threshold_uncertainty_score":0.9997692},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5120722,0.016997602,0.41662174,0.004588919,0.039944712,0.006465754,0.0007888395,0.0003993122,0.0021208723],"genre_scores_gemma":[0.9796859,0.000048942617,0.013950212,0.0031856152,0.002875891,0.00003368173,0.000045476605,0.00005348766,0.00012079187],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99715227,0.00014429775,0.0008023578,0.0006114966,0.0003921776,0.0008973725],"domain_scores_gemma":[0.9982778,0.000116162926,0.00070950086,0.0006362524,0.00013298137,0.00012734426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001039877,0.000331539,0.00058066007,0.00015101384,0.00050025136,0.00003891534,0.0010463175,0.0003443828,0.00015650407],"category_scores_gemma":[0.000009200011,0.00025534796,0.00016505436,0.0002276225,0.00070627965,0.00030925786,0.00028156675,0.00078809325,0.000016809745],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008039112,0.00015830543,0.033656664,0.000020738029,0.0000029895452,0.0000045282245,0.004507773,0.000007691786,2.6900983e-7,0.0007789038,0.000039023293,0.9608151],"study_design_scores_gemma":[0.00092332857,0.0024675673,0.97773707,0.0013592214,0.00008300168,0.000076148004,0.00001517039,0.0014850212,0.000011361702,0.009735592,0.005076713,0.0010297886],"about_ca_topic_score_codex":0.00046028406,"about_ca_topic_score_gemma":0.0016587736,"teacher_disagreement_score":0.9597853,"about_ca_system_score_codex":0.00013622263,"about_ca_system_score_gemma":0.0001884472,"threshold_uncertainty_score":0.99998987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002794272,0.0024105515,0.99508137,0.00040784758,0.00043448963,0.0006498801,0.000015481648,0.000052304804,0.0006686574],"genre_scores_gemma":[0.06817685,0.00009426067,0.93057,0.00056044187,0.0003180608,0.000005574585,0.000004344735,0.000033502343,0.00023697707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970085,0.000057124485,0.00043656613,0.0012785273,0.00068323856,0.0005360462],"domain_scores_gemma":[0.9966865,0.0016260229,0.00041211388,0.0006100914,0.00053507317,0.00013017876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018310491,0.0004960592,0.00064076926,0.00073258026,0.00031839442,0.00045121758,0.0010933453,0.0004173595,0.0000016938333],"category_scores_gemma":[0.00024619728,0.00043688942,0.00009598004,0.00041451704,0.00078388676,0.0010872566,0.0008376583,0.0006506686,3.5005755e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011823972,0.000018756647,0.000050768365,0.00015577051,0.00003032992,0.000052491192,0.0020435222,0.0016456305,0.003701939,0.020869732,0.00003534041,0.9712775],"study_design_scores_gemma":[0.0014017387,0.0009853145,0.0011104288,0.0016423037,0.00005700063,0.0001640182,0.000002212962,0.55949724,0.04316867,0.3903909,0.00040182212,0.0011783411],"about_ca_topic_score_codex":0.000041258565,"about_ca_topic_score_gemma":0.00007905734,"teacher_disagreement_score":0.97009915,"about_ca_system_score_codex":0.00011176749,"about_ca_system_score_gemma":0.0002886964,"threshold_uncertainty_score":0.9998083},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027151068,0.0018015301,0.9945383,0.00015879427,0.0008871898,0.00029224914,0.0000032282242,0.00045339917,0.0015937894],"genre_scores_gemma":[0.32847136,0.000030806565,0.6709565,0.00023776254,0.00007839459,0.0000057896073,0.0000025190016,0.000020056961,0.00019678983],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972604,0.00003282224,0.0005619378,0.00088322,0.00084894395,0.00041269537],"domain_scores_gemma":[0.997741,0.00024417686,0.0005101196,0.0010807494,0.0003456227,0.00007833099],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006578456,0.0003906198,0.00050702126,0.0010737341,0.00011542125,0.00025304008,0.0031302918,0.0002714172,0.000037074653],"category_scores_gemma":[0.00012973518,0.00034345026,0.00010865986,0.0005752195,0.0006948694,0.0007825072,0.000954831,0.00052293047,0.000016049686],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026531966,0.000028930042,0.000028998233,0.00031174277,0.000012894177,0.000057634097,0.0022384448,0.00015679089,0.0011724505,0.08419876,0.000027587505,0.91176313],"study_design_scores_gemma":[0.000118377466,0.00013440114,0.000034715315,0.0010626444,0.00001085214,0.000051722676,1.5216945e-7,0.2964519,0.017081037,0.6845138,0.00008368377,0.000456719],"about_ca_topic_score_codex":0.00003247524,"about_ca_topic_score_gemma":0.000040007006,"teacher_disagreement_score":0.9113064,"about_ca_system_score_codex":0.00014834387,"about_ca_system_score_gemma":0.00051808247,"threshold_uncertainty_score":0.9999018},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001140402,0.00009829988,0.9942365,0.00247481,0.00045191322,0.0018062121,0.0000069005782,0.00013480068,0.0006764779],"genre_scores_gemma":[0.45196953,0.000008773363,0.541306,0.0053645745,0.000620004,0.0004930993,0.000006369143,0.000036460875,0.00019519318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973359,0.00005143494,0.00035472366,0.0012811685,0.00046949077,0.0005072955],"domain_scores_gemma":[0.99548125,0.0028556376,0.00020185886,0.0010740208,0.0002589308,0.00012830803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009806665,0.000367402,0.00032366355,0.00020909656,0.0005608761,0.0004528207,0.0015991253,0.00018278653,0.000005499687],"category_scores_gemma":[0.00012669328,0.00027158135,0.000096192714,0.00046177843,0.0005466558,0.00018733765,0.00023458619,0.0005494784,0.000008882329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104461715,0.00002787079,0.00006776703,0.00002357894,0.000006857792,0.0000022683955,0.000121802776,0.08271208,0.0000078591465,0.010753565,0.000026132353,0.90623975],"study_design_scores_gemma":[0.00032218976,0.00012829353,0.00007198255,0.00009958802,0.000013043177,0.000012783058,2.4971482e-7,0.9848083,0.00007868972,0.0075761224,0.0065678386,0.00032088338],"about_ca_topic_score_codex":0.000012526479,"about_ca_topic_score_gemma":0.00007675692,"teacher_disagreement_score":0.9059189,"about_ca_system_score_codex":0.00014435098,"about_ca_system_score_gemma":0.0003218003,"threshold_uncertainty_score":0.99997365},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028760824,0.00055343844,0.96985054,0.00016241186,0.00028740804,0.00015832076,5.544367e-7,0.00019248035,0.000034007102],"genre_scores_gemma":[0.52880985,0.000006218477,0.47084346,0.00025136332,0.00008210474,0.0000016438003,2.5010812e-7,0.0000049450887,1.7534795e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781126,0.000049947255,0.00039167466,0.0008010648,0.00042414566,0.0005219005],"domain_scores_gemma":[0.99888724,0.00023165935,0.00009666164,0.00042034677,0.00020704925,0.00015706137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001575307,0.00020142015,0.00021060841,0.00036111128,0.00034376796,0.00043309812,0.0010150055,0.00008882409,0.0000025390502],"category_scores_gemma":[0.00015937403,0.00017965112,0.000026194472,0.0018677174,0.00041271385,0.0008343929,0.0006387825,0.00028516937,0.0000039769743],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050875637,0.00004617786,0.00056521053,0.000017247496,0.0000014839501,0.000018468263,0.00094207283,0.0018618288,0.017791534,0.0043185735,6.7431097e-7,0.97443163],"study_design_scores_gemma":[0.000121770056,0.00004868351,0.00057624123,0.000089500594,9.64705e-7,0.00004569241,0.0000019290135,0.96525574,0.021656165,0.01196521,0.000010167197,0.00022792826],"about_ca_topic_score_codex":0.00003191116,"about_ca_topic_score_gemma":0.000011599193,"teacher_disagreement_score":0.9742037,"about_ca_system_score_codex":0.00012325034,"about_ca_system_score_gemma":0.00020907562,"threshold_uncertainty_score":0.732596},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006939439,0.00010538817,0.9885187,0.0005198012,0.0010304883,0.0006212527,0.000006666665,0.00056361203,0.008564681],"genre_scores_gemma":[0.21600498,0.000054127624,0.77590036,0.005525928,0.0008936019,0.00004030148,0.00001517687,0.000094025556,0.0014715114],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99567795,0.00002090709,0.00060297,0.0018061243,0.0011693963,0.00072262774],"domain_scores_gemma":[0.9968651,0.00023968695,0.00023617009,0.0018484922,0.00044604336,0.00036450324],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004619751,0.0005610268,0.00055384036,0.0015966354,0.00023000893,0.0025895063,0.0044822115,0.00023861359,0.000043366093],"category_scores_gemma":[0.00005189737,0.0005713006,0.0001671561,0.0011457229,0.0003664343,0.0012318017,0.0029350927,0.0006126224,0.0002974526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010791829,0.000029917264,0.000028998807,0.000012896121,0.0000075048406,0.000014134861,0.00026888587,0.0008912528,0.000027269369,0.32704934,0.000065761684,0.67160296],"study_design_scores_gemma":[0.00022101005,0.00033537333,0.0001760426,0.0004250361,0.000004192121,0.000029847797,3.9197165e-8,0.48151112,0.0016120363,0.503433,0.011194913,0.0010574316],"about_ca_topic_score_codex":0.000021372263,"about_ca_topic_score_gemma":0.000024296012,"teacher_disagreement_score":0.6705455,"about_ca_system_score_codex":0.00011873622,"about_ca_system_score_gemma":0.0003567057,"threshold_uncertainty_score":0.99967384},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094973744,0.0008393245,0.9962844,0.000023311302,0.00023336452,0.00016770078,0.0000014946165,0.00020005213,0.001300607],"genre_scores_gemma":[0.7689098,0.00029581253,0.23037902,0.00009019745,0.00020924212,0.0000035571682,0.000007552038,0.00005140877,0.000053385833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987875,0.0000050526223,0.0001821445,0.0004807002,0.00023244105,0.00031212403],"domain_scores_gemma":[0.9993791,0.00015408997,0.00006492604,0.0002706428,0.00004711777,0.00008412603],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008802569,0.0002937096,0.00023609702,0.00018102361,0.00016856958,0.00010609461,0.00019197809,0.0001624691,0.0000029653372],"category_scores_gemma":[0.000023422921,0.00025637407,0.000022213035,0.000110797504,0.00026063863,0.00012448653,0.00007220349,0.00049752154,0.0000024273354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005565844,0.000006375461,0.000008695452,0.000028135535,0.0000045100664,0.000021612334,0.00012329673,0.888451,0.000019559942,0.000058900852,0.0000017612857,0.11127062],"study_design_scores_gemma":[0.00018170447,0.00013258333,0.00001679055,0.00056005875,0.0000063969915,0.000020255015,1.15324816e-7,0.9954643,0.00079185155,0.0023567355,0.00013880679,0.00033036893],"about_ca_topic_score_codex":0.000004920875,"about_ca_topic_score_gemma":0.000020757177,"teacher_disagreement_score":0.7679601,"about_ca_system_score_codex":0.00010384319,"about_ca_system_score_gemma":0.000028929755,"threshold_uncertainty_score":0.99998885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030564303,0.00015682381,0.98894143,0.00024897442,0.00029807567,0.00032137308,0.000016255217,0.00006972758,0.0068909354],"genre_scores_gemma":[0.97757834,0.0000044974545,0.021179331,0.00042205278,0.00013851942,0.00001017865,0.0000018406552,0.000015400934,0.00064981397],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967323,0.00005397278,0.00058331847,0.0012940331,0.000988568,0.0003477932],"domain_scores_gemma":[0.99547184,0.00249421,0.0002803167,0.0013297142,0.00025230553,0.0001716044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002835783,0.00030371762,0.00045011265,0.0004968323,0.00025975937,0.00035259398,0.0017724597,0.00019117541,0.0004426051],"category_scores_gemma":[0.0010362671,0.00022591735,0.000080712925,0.00045529808,0.001938005,0.00025429807,0.0007785324,0.00041289756,0.0001871725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065959052,0.00002024738,0.00010640076,0.0000071101654,0.0000036144852,0.000003865258,0.0010085397,0.0040624416,0.000044934244,0.0696527,0.00004164749,0.9250419],"study_design_scores_gemma":[0.000072871604,0.00005203398,0.0009975446,0.000038202736,0.000005860429,0.000020468837,5.247252e-7,0.037692066,0.00011251451,0.95932436,0.0014348383,0.00024868894],"about_ca_topic_score_codex":0.000014188192,"about_ca_topic_score_gemma":0.000054326632,"teacher_disagreement_score":0.97452193,"about_ca_system_score_codex":0.00006035826,"about_ca_system_score_gemma":0.00020246132,"threshold_uncertainty_score":0.92126423},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008208598,0.000049340062,0.9906106,0.00013710628,0.00009446488,0.0006021344,0.000018858198,0.00001896699,0.0002599067],"genre_scores_gemma":[0.4320498,0.0000010150825,0.5672037,0.00037001586,0.00017451982,0.0000132494215,0.00007781811,0.000020169415,0.000089729925],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864495,0.000013671248,0.00025640073,0.00057127204,0.00022672741,0.00028700917],"domain_scores_gemma":[0.9991099,0.000043598036,0.00020597258,0.00046801704,0.00009859795,0.00007386722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040254573,0.00025558035,0.00020071332,0.00008690619,0.00013947675,0.00012600217,0.0003978636,0.00029102762,0.0000020468422],"category_scores_gemma":[0.00010767687,0.00022391246,0.000046202054,0.00006175959,0.00028705015,0.0000070135134,0.00017356053,0.00028384512,6.0583875e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008647694,0.000046211142,0.00025740924,0.0007441098,0.000029947527,6.804771e-7,0.00041997415,0.33735895,0.34955233,0.0044462224,0.000020843936,0.30703682],"study_design_scores_gemma":[0.00039661818,0.00018685729,0.00009237071,0.000074249874,0.000009376024,0.0000117599375,2.8483421e-7,0.9750815,0.01936516,0.002968744,0.0015028096,0.00031027524],"about_ca_topic_score_codex":0.000005000901,"about_ca_topic_score_gemma":0.000013826448,"teacher_disagreement_score":0.63772255,"about_ca_system_score_codex":0.000033116645,"about_ca_system_score_gemma":0.00013570103,"threshold_uncertainty_score":0.9130885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043704235,0.00041464117,0.99254274,0.000059904825,0.0007333325,0.00030176845,0.0000019906124,0.0001332028,0.0014419893],"genre_scores_gemma":[0.45604062,0.00008485191,0.5433885,0.00015068299,0.00023994756,0.0000045172483,8.709572e-7,0.00003175979,0.00005828476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650556,0.00012965835,0.00048839685,0.0015354797,0.0006588422,0.0006820418],"domain_scores_gemma":[0.99738854,0.0012039603,0.00030431466,0.0007719942,0.0001786269,0.00015256419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019435711,0.00047920374,0.0006565957,0.0018124332,0.0002544609,0.00038003607,0.0013092462,0.00038979566,0.000006877678],"category_scores_gemma":[0.00034056997,0.00045349906,0.000091147434,0.001598327,0.000342611,0.0007105765,0.00105119,0.0009201008,0.000008841934],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018536764,0.000022265902,0.00088861154,0.00002954522,0.000010394426,0.000109441906,0.0013584489,0.0064195986,0.001482555,0.0014715986,0.0000013736087,0.9881876],"study_design_scores_gemma":[0.000535814,0.00043694154,0.032687396,0.00073773524,0.000015660285,0.000577314,5.8771286e-7,0.8247018,0.005270836,0.13365573,0.00004756596,0.0013326051],"about_ca_topic_score_codex":0.000679373,"about_ca_topic_score_gemma":0.00065830507,"teacher_disagreement_score":0.98685503,"about_ca_system_score_codex":0.0003139738,"about_ca_system_score_gemma":0.00027440695,"threshold_uncertainty_score":0.9997917},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000090365356,0.0012025617,0.9614537,0.0011617121,0.0013328643,0.0013645652,0.000046445613,0.000079527905,0.033268273],"genre_scores_gemma":[0.97409767,0.00019708628,0.020414464,0.00050538237,0.0018972406,0.000114458795,0.000035277302,0.0000359977,0.00270245],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99732006,0.000041475043,0.00039771365,0.0007882697,0.00075775816,0.00069472054],"domain_scores_gemma":[0.99884063,0.00034681623,0.0001731095,0.00037636692,0.00013042332,0.0001326549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011346062,0.0002833603,0.0004093126,0.0004958493,0.00039083624,0.00043455226,0.0013945914,0.0002660841,0.000026852502],"category_scores_gemma":[0.00006549672,0.00026246117,0.00009617184,0.00040414085,0.00066258566,0.00030425677,0.0002781896,0.0003534235,0.000017765155],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002378411,0.000039035698,0.00035798192,0.000062966836,0.000018914887,0.000041256604,0.0020578539,0.035989325,0.0000024149747,0.21475352,0.00004046516,0.7466125],"study_design_scores_gemma":[0.0020233255,0.00017614085,0.0018313258,0.0012080644,0.000054685417,0.0000065459362,0.000027658376,0.22334294,0.000020668049,0.33062395,0.43897995,0.0017047352],"about_ca_topic_score_codex":0.00047584987,"about_ca_topic_score_gemma":0.002898068,"teacher_disagreement_score":0.97400725,"about_ca_system_score_codex":0.000566306,"about_ca_system_score_gemma":0.0002579822,"threshold_uncertainty_score":0.9999828},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016576094,0.000107788284,0.9938807,0.0012752198,0.00029067285,0.00074470416,0.000031991603,0.0001991336,0.003453209],"genre_scores_gemma":[0.04527648,0.00009101663,0.951535,0.0024047885,0.00012965855,0.00006740677,0.000053222473,0.000031804604,0.00041065743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676687,0.00002579581,0.00063057203,0.0013023271,0.0007745413,0.00049989944],"domain_scores_gemma":[0.9983579,0.00031282782,0.00024084847,0.0006258278,0.0003566261,0.000105994994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078710215,0.0004085759,0.00044217444,0.0009398979,0.0001637508,0.0003785483,0.0018225693,0.00031916646,0.0000266305],"category_scores_gemma":[0.00007023111,0.00040091336,0.00015082672,0.0006268975,0.0003632939,0.0006308936,0.0003000796,0.0005140768,0.000030286652],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017388706,0.000044873028,0.0000024145927,0.000033506105,0.000004567345,0.000012342591,0.0005195857,0.027292032,0.000072007715,0.009700813,0.00003123622,0.96226925],"study_design_scores_gemma":[0.0001788286,0.000070819944,0.000035086396,0.00015946038,0.0000026561938,0.000016263515,6.479703e-8,0.57938987,0.00054164435,0.41907808,0.00023783099,0.00028936344],"about_ca_topic_score_codex":0.000016175252,"about_ca_topic_score_gemma":0.000044326636,"teacher_disagreement_score":0.96197987,"about_ca_system_score_codex":0.00038109798,"about_ca_system_score_gemma":0.0010420881,"threshold_uncertainty_score":0.99984425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017255216,0.0023744872,0.9901228,0.00031784273,0.0005146444,0.0007772839,0.000007327541,0.00013650446,0.0040236074],"genre_scores_gemma":[0.72383934,0.00015053073,0.2753488,0.00013455273,0.0001229144,0.000016913415,0.0000048917855,0.00004788857,0.0003341439],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953195,0.00010975748,0.00076264434,0.0016515413,0.0012445817,0.0009119746],"domain_scores_gemma":[0.99619275,0.0007398402,0.00043610795,0.0019440007,0.0003946067,0.00029267572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026767354,0.0005227949,0.0007588305,0.0010715115,0.00021401109,0.00020585375,0.003114092,0.00041600305,0.000032624946],"category_scores_gemma":[0.00024276925,0.00047970898,0.00013234389,0.0010795181,0.0025201733,0.0010245597,0.0023555546,0.0012520453,0.000012756185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023072966,0.000160815,0.0011065096,0.0003060116,0.000035720284,0.000022974378,0.003290935,0.006521346,0.0013949503,0.15517953,0.0000021804726,0.83195597],"study_design_scores_gemma":[0.0004980781,0.0003786484,0.00089743466,0.00051910296,0.000013562731,0.000090117486,4.0363693e-7,0.11508023,0.0024088786,0.8790596,0.00030425185,0.00074967014],"about_ca_topic_score_codex":0.000017703605,"about_ca_topic_score_gemma":0.00003265133,"teacher_disagreement_score":0.83120626,"about_ca_system_score_codex":0.00019668606,"about_ca_system_score_gemma":0.0003700777,"threshold_uncertainty_score":0.99976546},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015227316,0.0011849812,0.97878414,0.0008392192,0.013120744,0.000902533,0.00006358172,0.000521218,0.0044312924],"genre_scores_gemma":[0.117722,0.00006455318,0.8653054,0.0023693366,0.013162623,0.00007075773,0.000050535473,0.00011115404,0.0011435999],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933742,0.000104249695,0.0010706509,0.0027485683,0.0013849331,0.0013173872],"domain_scores_gemma":[0.99369925,0.0023081107,0.0006757322,0.0024639408,0.0005126171,0.0003403235],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017461729,0.00091094314,0.0010732766,0.0006414305,0.0007855185,0.00095751486,0.0057050716,0.0007658228,0.000016025419],"category_scores_gemma":[0.0003565033,0.0008365939,0.00035383506,0.0010210734,0.0009298935,0.00050359697,0.001600556,0.0013559749,0.00008335981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013273688,0.00034431176,0.0012366747,0.00090416794,0.00021249204,0.00055532175,0.014240845,0.21539266,0.000057450117,0.18115538,0.013976408,0.5717915],"study_design_scores_gemma":[0.0010278989,0.0008488198,0.00082387135,0.002588087,0.000033471893,0.0003030392,9.61392e-7,0.21427627,0.00015446424,0.4415807,0.33525848,0.0031039116],"about_ca_topic_score_codex":0.000034793706,"about_ca_topic_score_gemma":0.000014516401,"teacher_disagreement_score":0.5686876,"about_ca_system_score_codex":0.0004087163,"about_ca_system_score_gemma":0.00071194716,"threshold_uncertainty_score":0.99967456},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009979379,0.00045238633,0.9938268,0.00048291648,0.0016370497,0.0003596681,0.0000088850165,0.000084490326,0.0021498825],"genre_scores_gemma":[0.35677353,0.00007105783,0.6401928,0.0008818153,0.00026908042,0.000019970474,0.0000484358,0.000033286837,0.0017100135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690765,0.000036351412,0.00060194026,0.0010891119,0.0009289637,0.00043595635],"domain_scores_gemma":[0.9974572,0.0006473546,0.00036983538,0.0009733058,0.00039737634,0.00015491867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048206854,0.00039264018,0.0004383622,0.0011235155,0.0002985213,0.00021501038,0.0019523255,0.00023462449,0.00007142414],"category_scores_gemma":[0.00008719348,0.00038051908,0.00014189754,0.000815641,0.00040584055,0.00059373025,0.0006727274,0.00036218876,0.00009719851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009116781,0.000073524636,0.000056951107,0.00009062724,0.000041579693,0.000022751274,0.0012313541,0.20927484,0.0021524932,0.18086746,0.00075135735,0.6054279],"study_design_scores_gemma":[0.00025795365,0.00015042779,0.00031395745,0.00022690158,0.000010964156,0.000047927173,2.5619926e-7,0.8132453,0.00300614,0.18033275,0.0018957854,0.0005116522],"about_ca_topic_score_codex":0.000021241769,"about_ca_topic_score_gemma":0.000040893105,"teacher_disagreement_score":0.6049163,"about_ca_system_score_codex":0.00023426092,"about_ca_system_score_gemma":0.00044926102,"threshold_uncertainty_score":0.9998647},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013410107,0.0011783981,0.99267304,0.000619669,0.0026976443,0.00030971147,0.000005414619,0.00016175881,0.0010133317],"genre_scores_gemma":[0.8773231,0.00003036728,0.12017894,0.0011784169,0.00097388646,0.0000069092034,0.0000050810195,0.000045928744,0.00025738915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963446,0.000049032253,0.00054078863,0.0011907868,0.0010972233,0.00077751675],"domain_scores_gemma":[0.99791497,0.0002447382,0.00035328855,0.0010303636,0.0002058408,0.000250822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010809877,0.0004904119,0.0005124235,0.0007057731,0.0003330389,0.0007534588,0.0027588105,0.00030342414,0.00004295792],"category_scores_gemma":[0.000041914933,0.0004604024,0.00016700695,0.00053688604,0.00032040052,0.0012077495,0.0010884079,0.0006173203,0.00007731689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007369551,0.00007916583,0.0019346959,0.00024151777,0.00006576164,0.000056818677,0.0437816,0.001189835,0.00059441396,0.023328617,0.000034597222,0.9286856],"study_design_scores_gemma":[0.0001783205,0.000052361014,0.00037795192,0.00048368753,0.000017746459,0.00014163258,9.528993e-7,0.9695934,0.000286756,0.019365408,0.008691186,0.0008105858],"about_ca_topic_score_codex":0.00006177422,"about_ca_topic_score_gemma":0.00012102646,"teacher_disagreement_score":0.9684036,"about_ca_system_score_codex":0.0003949257,"about_ca_system_score_gemma":0.00043041309,"threshold_uncertainty_score":0.99978477},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008554728,0.00018199607,0.9894424,0.00005528114,0.001044978,0.00027827852,0.0000074402315,0.0000394719,0.0003953934],"genre_scores_gemma":[0.9625057,0.0000069770726,0.03726978,0.0000562262,0.0001053309,0.0000019611662,0.000011629194,0.0000131097895,0.000029299448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971887,0.000059641257,0.0008394011,0.0008386133,0.0007140741,0.00035959348],"domain_scores_gemma":[0.99780303,0.00042610377,0.0006417276,0.00078937993,0.00026759593,0.00007216106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007965194,0.0003154933,0.0006009478,0.0006640779,0.000039144645,0.00005539185,0.0012597897,0.00032177294,0.0000020448997],"category_scores_gemma":[0.00013964933,0.0003129333,0.00010586785,0.0006729549,0.00025198943,0.00035779606,0.000296232,0.0004269931,0.0000036061388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000961281,0.0000522927,0.000087305176,0.00007665762,0.000006363824,0.000008158719,0.0003987483,0.9342694,0.0036279326,0.0017481741,0.000004585577,0.059710734],"study_design_scores_gemma":[0.00032007435,0.00010885576,0.00015970325,0.0008789524,0.000004960585,0.000010154857,1.8307259e-7,0.97126555,0.008799956,0.01803892,0.000101380094,0.00031131328],"about_ca_topic_score_codex":0.000040502702,"about_ca_topic_score_gemma":0.000014787569,"teacher_disagreement_score":0.95395094,"about_ca_system_score_codex":0.0002415071,"about_ca_system_score_gemma":0.00021731212,"threshold_uncertainty_score":0.9999323},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004895344,0.00025069035,0.9935549,0.00043229465,0.0020437196,0.0002735875,0.000009836004,0.000121739926,0.0028236962],"genre_scores_gemma":[0.107002206,0.00007204562,0.8904663,0.0013357728,0.0007187131,0.000011714592,0.000016150574,0.000041459316,0.00033567613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962143,0.000026350826,0.0004936686,0.001648948,0.0009443131,0.0006724741],"domain_scores_gemma":[0.99733555,0.00025330175,0.00021381365,0.0018730619,0.00013127025,0.00019299299],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007437552,0.0004912692,0.0005136665,0.0008252085,0.00023478843,0.00062924484,0.004392389,0.00046829585,0.000052958178],"category_scores_gemma":[0.000068978894,0.00042325657,0.000096311385,0.0005526119,0.0006753373,0.0008616469,0.0025277284,0.00166591,0.00005934353],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003263487,0.000038135153,0.00018724467,0.000015480859,0.0000022895827,0.00016334113,0.0004582944,0.00222071,0.00032615892,0.008475335,0.0000122714055,0.9880975],"study_design_scores_gemma":[0.00051192177,0.00018257124,0.0013051188,0.00058464654,0.000003938924,0.000109394416,1.6313929e-7,0.7775092,0.0023084118,0.20718555,0.009156973,0.0011421215],"about_ca_topic_score_codex":0.00013583247,"about_ca_topic_score_gemma":0.00045705243,"teacher_disagreement_score":0.98695534,"about_ca_system_score_codex":0.00019274247,"about_ca_system_score_gemma":0.0005533242,"threshold_uncertainty_score":0.9998219},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42830643,0.00002897845,0.57062507,0.00015726067,0.00072116626,0.000028111559,4.4073445e-7,0.0001163442,0.00001622102],"genre_scores_gemma":[0.6768938,0.0000024637347,0.32264057,0.00021769901,0.00023342516,9.434964e-7,0.0000012972896,0.00000921672,6.17384e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985951,0.000013565097,0.00023396847,0.0003496654,0.00036778234,0.0004399027],"domain_scores_gemma":[0.99932534,0.00006902502,0.000028538378,0.00031794608,0.00010540254,0.00015378078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033538317,0.00017348769,0.00020627736,0.00023307635,0.000103889666,0.00017044932,0.00043322274,0.00008518427,0.00012195685],"category_scores_gemma":[0.00025170352,0.00014561547,0.00004013203,0.0018000094,0.00026934533,0.00022387946,0.00012694097,0.00054424803,0.000012801744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.8955114e-7,0.000017522281,0.0012471026,0.000016263326,0.000006601157,0.000015621312,0.00016513943,0.6689847,0.09522717,0.000008217652,0.0000017799405,0.23430961],"study_design_scores_gemma":[0.00011810051,0.000008358259,0.0015254435,0.000055728848,0.000007819522,0.000008931533,2.1703605e-7,0.9770543,0.020642227,0.00032165658,0.000069644964,0.0001875617],"about_ca_topic_score_codex":0.00006563092,"about_ca_topic_score_gemma":0.000022896833,"teacher_disagreement_score":0.30806962,"about_ca_system_score_codex":0.000042533382,"about_ca_system_score_gemma":0.00007931917,"threshold_uncertainty_score":0.59380263},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040481944,0.0016963495,0.96297586,0.0013277602,0.0021588197,0.00039011365,0.0000030294639,0.00038109024,0.031026524],"genre_scores_gemma":[0.41624385,0.00017841072,0.5718699,0.003861334,0.00066098646,0.000012464572,0.000017771152,0.00006635691,0.0070888815],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99507934,0.00005397905,0.0006588171,0.0021637238,0.0010096064,0.001034556],"domain_scores_gemma":[0.9967802,0.0003332787,0.00040933315,0.0019272601,0.0002665818,0.00028330612],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009912734,0.0007845881,0.00078967825,0.0008784822,0.0003487144,0.00069717295,0.0055010105,0.00053978927,0.000033548833],"category_scores_gemma":[0.00010729715,0.00066301314,0.00025570323,0.0007638831,0.0008003135,0.0006255182,0.0013704373,0.0011314623,0.00026265482],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049298565,0.000051289175,0.00007989291,0.00003952227,0.000010362701,0.0003054555,0.00054302736,0.0034792493,0.00007925823,0.113516755,0.00005775296,0.8818325],"study_design_scores_gemma":[0.0002825489,0.00031710378,0.00026581134,0.0003268519,0.000008452217,0.00025607817,9.8278406e-8,0.33133557,0.00011938587,0.6628287,0.0033108015,0.00094861793],"about_ca_topic_score_codex":0.0000196074,"about_ca_topic_score_gemma":0.00014802103,"teacher_disagreement_score":0.8808839,"about_ca_system_score_codex":0.0005957793,"about_ca_system_score_gemma":0.00077350676,"threshold_uncertainty_score":0.9998797},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057041005,0.0019738267,0.9898942,0.0005235263,0.0018866981,0.0003188883,0.000005790929,0.00038377073,0.004956255],"genre_scores_gemma":[0.3608826,0.000012684033,0.6355772,0.0022469289,0.0007705178,0.000014932115,0.000020815905,0.000061314015,0.00041298018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953814,0.000063193205,0.00058730156,0.0015909974,0.0011785907,0.0011985289],"domain_scores_gemma":[0.99656415,0.00083884,0.0004002804,0.0016528501,0.0001971775,0.00034668023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013585553,0.00072726264,0.000612215,0.0009731645,0.00044497158,0.0006298265,0.003916848,0.0005047378,0.00006095977],"category_scores_gemma":[0.00006415118,0.0006698334,0.00015626894,0.0006071913,0.00047025512,0.0007683065,0.0009732428,0.0013663218,0.00014421387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001135937,0.000033917,0.0010844903,0.00009279425,0.00001498965,0.00012257232,0.0012251714,0.14432985,0.00014210433,0.0052597444,0.000086223146,0.84759676],"study_design_scores_gemma":[0.00041839216,0.0002619472,0.00034655313,0.0015420038,0.000018760094,0.000088865585,1.2168347e-7,0.91090035,0.0021979772,0.07653895,0.0062140636,0.0014720252],"about_ca_topic_score_codex":0.000028286233,"about_ca_topic_score_gemma":0.000011109016,"teacher_disagreement_score":0.84612477,"about_ca_system_score_codex":0.00029965854,"about_ca_system_score_gemma":0.00074874586,"threshold_uncertainty_score":0.9995753},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008534877,0.0006650348,0.9794764,0.00033268932,0.0020417478,0.00058112125,0.000009726232,0.00042633084,0.01638163],"genre_scores_gemma":[0.57073164,0.000014930355,0.42575192,0.0011674808,0.0015705227,0.0000123235095,0.000023343042,0.00006568225,0.0006621404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940658,0.0000977167,0.0009019076,0.0022027632,0.0016687328,0.0010630813],"domain_scores_gemma":[0.9960997,0.00075537,0.00057528564,0.0016949113,0.0005546864,0.00032002872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002301767,0.0007680092,0.0007244529,0.0010785419,0.00048319608,0.000673113,0.0043787183,0.0005950008,0.000008858714],"category_scores_gemma":[0.00011350768,0.0007490975,0.00020758025,0.0011553183,0.00067286775,0.0006530773,0.0014992814,0.0013780612,0.0001032068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030719435,0.000037275662,0.00014789592,0.000052822492,0.00004956442,0.00015175965,0.0018494726,0.53321713,0.00006819099,0.028994763,0.000064763415,0.4353356],"study_design_scores_gemma":[0.00030925788,0.0002918356,0.0003704659,0.0008206337,0.000013488317,0.00013837265,8.1053093e-7,0.9560839,0.0001966716,0.038446076,0.0024707972,0.0008577196],"about_ca_topic_score_codex":0.000063887834,"about_ca_topic_score_gemma":0.00005210563,"teacher_disagreement_score":0.5706463,"about_ca_system_score_codex":0.00064716814,"about_ca_system_score_gemma":0.0006563395,"threshold_uncertainty_score":0.999496},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017701134,0.00020571963,0.9762695,0.0021257577,0.0010535571,0.0008681365,0.0000023025823,0.00008360779,0.001690276],"genre_scores_gemma":[0.8907524,0.000026957889,0.1082235,0.00036491026,0.00008781418,0.000059844486,0.0000010820077,0.000019718424,0.00046377463],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997433,0.000055476525,0.00040030904,0.0011308197,0.0005762686,0.0004041235],"domain_scores_gemma":[0.99608064,0.0011930345,0.00056394044,0.00090443227,0.0012076214,0.000050307946],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003834641,0.0004035901,0.0004056085,0.00055629615,0.00046336683,0.00032619966,0.0016702538,0.00017190631,0.00000849403],"category_scores_gemma":[0.00023462051,0.00022536733,0.000034760815,0.00072154554,0.003458606,0.0012182654,0.0011309494,0.0008664286,0.000011354875],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012275483,0.0001249576,0.00011584157,0.000052970518,0.00020135981,0.00010292577,0.0995306,0.0008399713,0.0034826982,0.24857426,0.00017288505,0.6466788],"study_design_scores_gemma":[0.0014977127,0.0052090837,0.0025699164,0.004312541,0.00006294415,0.001048098,0.00051757536,0.14323851,0.5063503,0.32935572,0.002620943,0.003216672],"about_ca_topic_score_codex":0.00004899368,"about_ca_topic_score_gemma":0.000083020655,"teacher_disagreement_score":0.8730513,"about_ca_system_score_codex":0.00017180396,"about_ca_system_score_gemma":0.000308551,"threshold_uncertainty_score":0.9992534},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023900509,0.0097590145,0.9579581,0.0002383378,0.001964012,0.00084510184,0.000078775265,0.00001832109,0.0052378196],"genre_scores_gemma":[0.9171714,0.0007583528,0.07764218,0.0012626518,0.0016289541,0.000037264188,0.000059758004,0.00008939347,0.0013500374],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998001,0.0000123900645,0.00028374957,0.0010459315,0.0001942667,0.0004627011],"domain_scores_gemma":[0.9987526,0.00003770107,0.00014996545,0.0007581232,0.00018166777,0.00011997291],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030413712,0.00039378894,0.00033784827,0.00017967782,0.0001830631,0.00007841499,0.0008780495,0.00033520808,0.000011559461],"category_scores_gemma":[0.000022214326,0.00036108054,0.00013387785,0.000065002605,0.00036664147,0.0000028650443,0.00043115948,0.00016115274,0.0000066244766],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012760224,0.0001015725,0.00084602257,0.00009155106,0.00017184977,0.000015523985,0.00056888146,0.004126095,0.31476045,0.0053850124,0.00017827503,0.67362714],"study_design_scores_gemma":[0.0027158863,0.0067091975,0.004134691,0.00033026325,0.00022533709,0.00017022804,0.0000019978395,0.010049423,0.37306857,0.32563913,0.27150655,0.0054487507],"about_ca_topic_score_codex":0.000019761068,"about_ca_topic_score_gemma":0.00013974533,"teacher_disagreement_score":0.8932709,"about_ca_system_score_codex":0.000034026165,"about_ca_system_score_gemma":0.00026809628,"threshold_uncertainty_score":0.9998841},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000701307,0.00066223467,0.97661775,0.0005097408,0.0027319894,0.00045643817,0.00003334862,0.00028742285,0.018630967],"genre_scores_gemma":[0.621608,0.00009494928,0.36797148,0.004509334,0.0022972247,0.000018740586,0.00004172473,0.00012034646,0.0033381593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941771,0.00005268953,0.0008284489,0.002205269,0.0015758014,0.0011606623],"domain_scores_gemma":[0.9960968,0.0005710442,0.00044937947,0.0020168442,0.0005282686,0.00033770216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014977518,0.00081971654,0.00086897536,0.0008956503,0.0003567317,0.00077885063,0.0037146634,0.0005819779,0.000016806833],"category_scores_gemma":[0.00010065795,0.0007386432,0.00024492826,0.0010387136,0.0008931743,0.0007704482,0.0013147171,0.0011726245,0.0001808346],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000115533985,0.000060696413,0.00009159977,0.000046412322,0.000037048678,0.00095605536,0.0016192154,0.020592924,0.000218689,0.047661223,0.00022455395,0.92848],"study_design_scores_gemma":[0.0011859849,0.00057313516,0.0016657816,0.0024220294,0.000035167683,0.0008601113,0.0000031228187,0.8488101,0.0040899827,0.07733533,0.05914801,0.0038712758],"about_ca_topic_score_codex":0.00012263287,"about_ca_topic_score_gemma":0.0008645295,"teacher_disagreement_score":0.92460877,"about_ca_system_score_codex":0.0004678957,"about_ca_system_score_gemma":0.00060451846,"threshold_uncertainty_score":0.9995065},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024343022,0.00043034015,0.99523675,0.0003611777,0.0006083516,0.0003393737,0.000005084135,0.00012040676,0.0026550803],"genre_scores_gemma":[0.3986452,0.000055077642,0.6002045,0.00031858985,0.0002618359,0.000038358135,0.000011002311,0.00003050415,0.0004348784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971384,0.00002327939,0.00047374156,0.0010675051,0.00088155386,0.00041554854],"domain_scores_gemma":[0.9981483,0.0002970685,0.00031610887,0.0008997464,0.00021591685,0.00012285133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039067998,0.00034828734,0.00035760592,0.00066141743,0.00034287033,0.000095835705,0.001957243,0.00021383923,0.000033227145],"category_scores_gemma":[0.00004654911,0.00033935855,0.00014667076,0.0005437259,0.0005303222,0.0003247468,0.0007628285,0.000805857,0.00005447418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027413053,0.000099508165,0.000050511127,0.000018462288,0.000006013586,0.000034790388,0.0002467142,0.38291854,0.00011632133,0.3704074,0.000013878826,0.2460851],"study_design_scores_gemma":[0.0004656676,0.0004225113,0.001795336,0.00070337974,0.000017660623,0.00008890073,3.296147e-7,0.5765206,0.0006108467,0.417572,0.0010092274,0.0007935261],"about_ca_topic_score_codex":0.000025284304,"about_ca_topic_score_gemma":0.0000037053849,"teacher_disagreement_score":0.39840177,"about_ca_system_score_codex":0.0005345981,"about_ca_system_score_gemma":0.0006602997,"threshold_uncertainty_score":0.9999058},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012982907,0.00043362976,0.99527395,0.000609171,0.00087989855,0.0007545416,0.000020879668,0.0004621493,0.0014359487],"genre_scores_gemma":[0.123951495,0.000032251683,0.8753253,0.0003294335,0.00011295107,0.000018576868,0.000006273127,0.000032255582,0.00019142992],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953968,0.000034034903,0.00077949266,0.0019225281,0.00115623,0.0007109094],"domain_scores_gemma":[0.99449843,0.0006104751,0.0005925585,0.0037142802,0.00046223775,0.000122006844],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009858541,0.0005763771,0.00076324004,0.00081515877,0.0001513861,0.00021096856,0.0069621564,0.00049729994,0.000037140297],"category_scores_gemma":[0.00051079347,0.0005126499,0.00012858228,0.0010109509,0.0022585376,0.0012778705,0.0039139856,0.0010248421,0.00006903483],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005415837,0.000036363832,0.00007841079,0.000080395504,0.000009056098,0.000036429083,0.00019305272,0.0038408102,0.00064465555,0.049622186,0.00004007896,0.9454132],"study_design_scores_gemma":[0.00020110473,0.00028595066,0.00013785755,0.00023888527,0.0000055912633,0.000049893886,1.524395e-7,0.16994353,0.0136049185,0.81294376,0.0019027519,0.00068561896],"about_ca_topic_score_codex":0.00003100056,"about_ca_topic_score_gemma":0.000066743036,"teacher_disagreement_score":0.94472754,"about_ca_system_score_codex":0.0004904356,"about_ca_system_score_gemma":0.00046017527,"threshold_uncertainty_score":0.9997325},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012620112,0.0023593723,0.98301935,0.0015735355,0.000035070527,0.0002211118,0.000006107399,0.000017864639,0.00014745284],"genre_scores_gemma":[0.7130352,0.00012274136,0.28644517,0.00034571704,0.000017097453,0.000012770802,0.0000022765191,0.0000034213765,0.000015561774],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992213,0.000017167698,0.00016814405,0.00025876626,0.00019514564,0.00013947148],"domain_scores_gemma":[0.9994424,0.00013646897,0.0000697707,0.0002479995,0.00006860357,0.000034766446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025630518,0.00007600271,0.000104323175,0.000041399897,0.00010394129,0.00002291413,0.00012665738,0.000029882132,0.000007871102],"category_scores_gemma":[0.0000859667,0.000054239146,0.000017773142,0.00043149758,0.00056389876,0.0000821289,0.000024304123,0.00011452584,4.5846298e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104064326,0.00040729638,0.031690273,0.00016456743,0.0000052038517,0.000020543192,0.0007957405,0.0041583166,0.14302729,0.036485568,0.002855823,0.7802853],"study_design_scores_gemma":[0.0026230114,0.0009791511,0.05452745,0.00093846716,0.000047528767,0.0004883014,0.000020446383,0.1120594,0.62334937,0.13049178,0.073713124,0.00076199195],"about_ca_topic_score_codex":0.000008229941,"about_ca_topic_score_gemma":0.0000073097276,"teacher_disagreement_score":0.7795233,"about_ca_system_score_codex":0.000026046899,"about_ca_system_score_gemma":0.00005992455,"threshold_uncertainty_score":0.22118083},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001222793,0.00018107748,0.9924702,0.0003398359,0.00094055606,0.00027141592,0.000025733825,0.00006864915,0.0055802343],"genre_scores_gemma":[0.40017906,0.000038931445,0.59865904,0.00054728665,0.0002864301,0.0000074887766,0.000022268552,0.000028385233,0.000231142],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969324,0.000027175613,0.0006128901,0.0010393189,0.0008829954,0.0005052274],"domain_scores_gemma":[0.9978794,0.00025524004,0.00033884693,0.0011990744,0.00022812387,0.00009933231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006561306,0.00036693664,0.00045946048,0.00091324403,0.00018676271,0.000270305,0.00246152,0.00019846899,0.0000384474],"category_scores_gemma":[0.000027476435,0.00033659287,0.00015726025,0.0007789895,0.00067960896,0.00045251037,0.0010200668,0.00044617028,0.000008306258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006151789,0.00009128959,0.00045415817,0.000082122024,0.00003080658,0.00011284468,0.001064611,0.010299351,0.00021795848,0.37024114,0.00024962658,0.61714995],"study_design_scores_gemma":[0.00063842675,0.0002983858,0.0032082878,0.00032373116,0.000019390849,0.00007761447,3.095002e-7,0.3640539,0.00093146047,0.62583095,0.0036369853,0.0009805778],"about_ca_topic_score_codex":0.0001654385,"about_ca_topic_score_gemma":0.00023441465,"teacher_disagreement_score":0.6161694,"about_ca_system_score_codex":0.00009630389,"about_ca_system_score_gemma":0.00035348808,"threshold_uncertainty_score":0.9999086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000066805806,0.00012271616,0.99706566,0.00014707592,0.00013986713,0.00059276726,0.000011785358,0.000119985874,0.001733306],"genre_scores_gemma":[0.3558411,0.0000034303798,0.6413931,0.00015356795,0.0024879356,0.000033159497,0.000018171337,0.000035094734,0.00003440496],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979445,0.000012742456,0.00040273383,0.0008305529,0.00033584607,0.0004736377],"domain_scores_gemma":[0.99834096,0.00063720206,0.00032460288,0.00045445387,0.00017634178,0.00006644657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003111856,0.00034881357,0.00047440003,0.00037372488,0.00080678915,0.00017743254,0.00094657583,0.0001652562,0.000027204893],"category_scores_gemma":[0.000009070067,0.00037043853,0.0002539729,0.0004291368,0.00040197303,0.00008561478,0.00044282913,0.00066465716,0.0000039563424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021756935,0.00001864816,0.00015433875,0.000016473561,0.000029875018,0.0000010635715,0.00036301184,0.009791274,0.000028447492,0.2061407,0.000054282333,0.7833997],"study_design_scores_gemma":[0.000102816884,0.000024031564,0.000031737105,0.00022903201,0.000029909543,0.0000025911438,4.7546962e-7,0.17647411,0.00027930355,0.81263787,0.009676745,0.00051138015],"about_ca_topic_score_codex":0.00001961088,"about_ca_topic_score_gemma":0.000004694972,"teacher_disagreement_score":0.78288835,"about_ca_system_score_codex":0.00014330636,"about_ca_system_score_gemma":0.00017836454,"threshold_uncertainty_score":0.9998748},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009154583,0.0004240237,0.98258406,0.0041255555,0.0010805673,0.0005621882,0.000013369531,0.00020114121,0.010917552],"genre_scores_gemma":[0.20005403,0.0002711017,0.78078043,0.014605971,0.0021075287,0.000064668646,0.000030961066,0.00012164627,0.0019636643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99538183,0.00006709416,0.0005480824,0.0017456741,0.0014662424,0.00079105847],"domain_scores_gemma":[0.9953548,0.0010789401,0.00035439857,0.0028368356,0.00017992758,0.00019510981],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001136836,0.0006499626,0.0005031497,0.0004557385,0.0005872334,0.00096073374,0.007325766,0.0003100723,0.00006552604],"category_scores_gemma":[0.000059256145,0.00042488784,0.00013568359,0.00059422414,0.00091715256,0.0008200011,0.002323249,0.0014092652,0.00022456361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057407233,0.000044589746,0.000015230847,0.000014965014,0.0000069345215,0.00010335654,0.00028088677,0.01813998,0.000046162477,0.26085955,0.00034222685,0.72014034],"study_design_scores_gemma":[0.00022706045,0.00030955582,0.00012872161,0.0008745256,0.000006995175,0.00013285887,1.04006915e-7,0.4872121,0.0009972041,0.4951969,0.013971252,0.00094272936],"about_ca_topic_score_codex":0.000048397756,"about_ca_topic_score_gemma":0.00012344,"teacher_disagreement_score":0.71919763,"about_ca_system_score_codex":0.0003244781,"about_ca_system_score_gemma":0.00042517885,"threshold_uncertainty_score":0.9998203},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024449644,0.0002246582,0.9948858,0.00037416205,0.0011132049,0.000592133,0.00000505577,0.0002607974,0.00009923495],"genre_scores_gemma":[0.24050896,0.0000087025055,0.7576086,0.0015411869,0.0002517458,0.000056815534,0.00001021489,0.000010581732,0.0000032192756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675614,0.00015193947,0.00041608434,0.00090220006,0.0009820809,0.0007915726],"domain_scores_gemma":[0.99832755,0.00020992898,0.00014341414,0.00079611735,0.00017506404,0.00034789418],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001253686,0.0002648484,0.00030202174,0.00034728303,0.00024366214,0.0005444802,0.0016686324,0.000084233034,0.000027692378],"category_scores_gemma":[0.00015129035,0.0002456945,0.000045101726,0.0018313276,0.00022479956,0.0016882615,0.0008456342,0.00024025726,0.000030978837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029608116,0.00018678416,0.0011875757,0.000015607799,0.000012208708,0.000002542839,0.0046007214,0.16172916,0.04881058,0.000049507435,0.00017951432,0.78322285],"study_design_scores_gemma":[0.00012688506,0.00006353661,0.00030997998,0.000037500467,0.000004645213,0.000003278838,0.000003639036,0.6033198,0.39576674,0.00008343465,0.000027035892,0.0002534874],"about_ca_topic_score_codex":0.00012273216,"about_ca_topic_score_gemma":0.0000017200559,"teacher_disagreement_score":0.78296936,"about_ca_system_score_codex":0.00022955875,"about_ca_system_score_gemma":0.00011481183,"threshold_uncertainty_score":0.9999995},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037199152,0.001180196,0.99410766,0.0019484624,0.0008686007,0.0013587236,0.000015870424,0.00012665676,0.00035664847],"genre_scores_gemma":[0.78748417,0.00042012281,0.20982215,0.0011945968,0.0006329088,0.00007647084,0.00011644104,0.00006628642,0.00018687258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949829,0.00012770294,0.00085748243,0.0019981521,0.0010773744,0.0009563672],"domain_scores_gemma":[0.99306357,0.0016683142,0.0003830099,0.004161176,0.0004543493,0.0002696007],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024375839,0.0005644003,0.0007039792,0.0009352533,0.0003204219,0.0008006412,0.010979819,0.00059657043,0.00000940933],"category_scores_gemma":[0.00025306758,0.0005127448,0.000109694935,0.0009629358,0.0005920773,0.0011624456,0.003028955,0.0016660433,0.000011935722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002940911,0.00004523463,0.00004828305,0.00002610982,0.0000068924937,0.000018267838,0.00021469085,0.2900112,0.00004070486,0.012219135,0.000059464503,0.6972806],"study_design_scores_gemma":[0.0010581772,0.000133812,0.00020085397,0.0010379633,0.0000051407806,0.000014720214,1.4361483e-7,0.95254683,0.00008576139,0.04361865,0.00078727433,0.0005106626],"about_ca_topic_score_codex":0.00008329467,"about_ca_topic_score_gemma":0.0008629894,"teacher_disagreement_score":0.787447,"about_ca_system_score_codex":0.0007683907,"about_ca_system_score_gemma":0.0012936882,"threshold_uncertainty_score":0.99973243},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023751764,0.000034350567,0.9950803,0.0011908234,0.0005376769,0.0004779059,0.0000019185563,0.00028461104,0.000017221853],"genre_scores_gemma":[0.16603765,0.000006388708,0.83172196,0.0018751194,0.00030834367,0.000037898822,0.0000028506604,0.000007949803,0.0000018235835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782664,0.00004410277,0.00033690906,0.00072064827,0.0005445132,0.0005272206],"domain_scores_gemma":[0.9987064,0.00044671414,0.00010281984,0.000478661,0.00012806637,0.00013731713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092952285,0.00018073783,0.00016558147,0.00031063013,0.00020044051,0.00057362375,0.001422102,0.00005538646,0.00001640189],"category_scores_gemma":[0.00021230006,0.00016822678,0.00005433757,0.0010280542,0.00028362536,0.0017861222,0.00027526883,0.00017252626,0.000013809512],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025075701,0.00004213015,0.00008774158,0.00001151049,0.0000019754389,0.000004096678,0.0009911068,0.006765484,0.0773877,0.00006558466,0.00003932732,0.91460085],"study_design_scores_gemma":[0.00025035447,0.00007503026,0.00031488194,0.000017730927,0.0000011614023,0.00002844058,8.1274595e-7,0.5902978,0.40634456,0.0025146774,0.000012005208,0.00014253032],"about_ca_topic_score_codex":0.00001607451,"about_ca_topic_score_gemma":0.000031656175,"teacher_disagreement_score":0.91445833,"about_ca_system_score_codex":0.0002605401,"about_ca_system_score_gemma":0.00012808465,"threshold_uncertainty_score":0.6860089},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000679847,0.0005648242,0.9892175,0.0024698484,0.0018318987,0.0007570747,0.0000077157665,0.00031456692,0.0041567185],"genre_scores_gemma":[0.102782354,0.0000697367,0.8948738,0.0013817496,0.00044994586,0.000014971103,0.000004626426,0.000043903303,0.00037892527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945178,0.0000880123,0.0007070735,0.0024163737,0.001259452,0.0010112863],"domain_scores_gemma":[0.9960495,0.0010391879,0.00038129155,0.0018203076,0.00034325512,0.00036642887],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00122308,0.0007923264,0.0008784267,0.00083847414,0.0004572586,0.0017266766,0.003773644,0.00031887362,0.00008549601],"category_scores_gemma":[0.00016813872,0.00071748265,0.0001323767,0.0006697763,0.0021753048,0.001053764,0.0039155246,0.001026775,0.00009800614],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035005366,0.00006083057,0.00023150434,0.00014882337,0.000021744445,0.00010399754,0.0018309139,0.007570703,0.00010457749,0.09269823,0.00008521096,0.89713997],"study_design_scores_gemma":[0.00019023493,0.00015937915,0.00048288083,0.00018932552,0.000005639413,0.00009706949,4.2731583e-7,0.5832035,0.00013739413,0.41396233,0.00090378907,0.0006680437],"about_ca_topic_score_codex":0.00012741504,"about_ca_topic_score_gemma":0.00013562934,"teacher_disagreement_score":0.8964719,"about_ca_system_score_codex":0.00036689985,"about_ca_system_score_gemma":0.00044969723,"threshold_uncertainty_score":0.99952763},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008065669,0.000106353415,0.9897682,0.0017543309,0.0011385676,0.00045145256,0.0000035822231,0.00007422163,0.0066226204],"genre_scores_gemma":[0.2276228,0.000078800666,0.7618314,0.008438364,0.0006999827,0.000025595717,0.000008704053,0.00006264892,0.0012316941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968141,0.000089356996,0.0005112084,0.0009471838,0.0011096604,0.00052852527],"domain_scores_gemma":[0.9973245,0.0006845015,0.0003392104,0.001216173,0.00031254024,0.00012303286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013685462,0.00037924247,0.00043755316,0.00035313843,0.0002928132,0.00031779,0.0033838747,0.000193407,0.00009956375],"category_scores_gemma":[0.00008510791,0.00026269033,0.00012512294,0.0007953707,0.00095616654,0.00024531013,0.00095777947,0.00076512864,0.00002820044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031055022,0.000013281888,0.000011559689,0.000010092071,0.000005185316,0.000010455288,0.00030656176,0.5287145,0.0000105256995,0.46128187,0.0000073388305,0.0096255625],"study_design_scores_gemma":[0.0002180834,0.00019218835,0.00006077823,0.0005560804,0.0000027829349,0.000012997407,1.04844005e-7,0.5749532,0.0005021756,0.42290756,0.00028856,0.00030551406],"about_ca_topic_score_codex":0.00002271578,"about_ca_topic_score_gemma":0.000039339055,"teacher_disagreement_score":0.22793682,"about_ca_system_score_codex":0.00018984464,"about_ca_system_score_gemma":0.00084716245,"threshold_uncertainty_score":0.99998254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020383102,0.0011193282,0.99347633,0.00043364163,0.0010859765,0.00013797145,0.000011717547,0.00033685614,0.0031943324],"genre_scores_gemma":[0.93695474,0.00013708537,0.059921753,0.0006039117,0.0013072289,0.0000035867356,0.000021889571,0.0000881991,0.00096159894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976655,0.000012036347,0.0003723712,0.0007538729,0.00071739417,0.0004787784],"domain_scores_gemma":[0.99887234,0.00009532696,0.00007074775,0.0006915105,0.00013485583,0.00013520147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033761564,0.0004992372,0.0005349191,0.0005211262,0.00017028325,0.00017161471,0.00077025924,0.0003635099,0.00010931825],"category_scores_gemma":[0.000023264296,0.00033477476,0.00017191329,0.00028050714,0.00037015637,0.0001596812,0.00019087891,0.00089840783,0.000069690184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017578773,0.000005879947,0.000012779381,0.000031353346,0.000020820244,0.00001728065,0.00021252153,0.69442,0.00020336283,0.00016746881,0.000048305395,0.3048585],"study_design_scores_gemma":[0.00012630156,0.000019294146,0.000019526851,0.00040375695,0.0000244436,0.000011032879,1.8581072e-7,0.9777408,0.00057793193,0.018417113,0.0021011056,0.00055845507],"about_ca_topic_score_codex":0.000012052551,"about_ca_topic_score_gemma":0.00023582105,"teacher_disagreement_score":0.9367509,"about_ca_system_score_codex":0.00022515476,"about_ca_system_score_gemma":0.00007309775,"threshold_uncertainty_score":0.9999104},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33658674,0.024461046,0.52223146,0.004726531,0.0033520989,0.005655607,0.0000717194,0.00037221503,0.1025426],"genre_scores_gemma":[0.9591482,0.0002933461,0.038858272,0.0007634271,0.00026734592,0.000009225125,0.000018897032,0.000044781456,0.00059650367],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755156,0.000011721993,0.0005165795,0.0007837544,0.00077222957,0.00036417093],"domain_scores_gemma":[0.99825794,0.000387485,0.0002999217,0.00065421284,0.00023041276,0.00017005316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002432056,0.00037743125,0.00078801834,0.0005834948,0.00006787233,0.000033826625,0.0003464348,0.00019116174,0.0001497569],"category_scores_gemma":[0.00014314191,0.00030034911,0.00016993504,0.00029727945,0.0005861938,0.00009312764,0.00026528962,0.00038487196,0.00003947653],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017489183,0.0004719217,0.010213079,0.00026825583,0.00007970095,0.0043704654,0.00074297655,0.0013365168,0.0013664031,0.0012895205,0.000054810633,0.9796315],"study_design_scores_gemma":[0.028228965,0.026237499,0.23384668,0.054504387,0.0019145843,0.011259303,0.000010112241,0.06246689,0.22059873,0.34205467,0.0104309,0.008447292],"about_ca_topic_score_codex":0.0000375102,"about_ca_topic_score_gemma":0.00013092603,"teacher_disagreement_score":0.9711842,"about_ca_system_score_codex":0.00021245376,"about_ca_system_score_gemma":0.0003780141,"threshold_uncertainty_score":0.99994487},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044435514,0.0005353575,0.99084055,0.00010212956,0.0008930498,0.00040738875,0.0000092693,0.000076877,0.0026918412],"genre_scores_gemma":[0.498495,0.000010847303,0.50040686,0.0002685706,0.00013006436,0.000019344609,0.000013881021,0.000044475168,0.0006109279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731755,0.00034385207,0.00050041673,0.0010682744,0.00028999016,0.00047990223],"domain_scores_gemma":[0.99812645,0.0007847159,0.0003265728,0.00040478585,0.00029119203,0.000066300294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029431167,0.00038080406,0.00044957266,0.0010679873,0.00037011382,0.00015280787,0.000468654,0.00036282846,0.00004743104],"category_scores_gemma":[0.00021803408,0.00037386752,0.0000393888,0.0009000445,0.00054988207,0.00018125217,0.00023829564,0.001564325,0.00001761188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007430115,0.00013565208,0.00350157,0.00010961416,0.000081364036,0.00023312123,0.18445174,0.31687912,0.0004382612,0.024220776,0.000016895881,0.46985757],"study_design_scores_gemma":[0.0011546387,0.0001718834,0.0035782869,0.0014155146,0.000028498549,0.000055026187,0.0000446353,0.93552333,0.00014011608,0.056457873,0.00038552482,0.0010446712],"about_ca_topic_score_codex":0.00029723637,"about_ca_topic_score_gemma":0.00021213469,"teacher_disagreement_score":0.6186442,"about_ca_system_score_codex":0.00019345382,"about_ca_system_score_gemma":0.00020833148,"threshold_uncertainty_score":0.9998713},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078634627,0.00033262832,0.9959896,0.0009073664,0.001065778,0.00039835685,0.0000032774497,0.00014673598,0.00036987543],"genre_scores_gemma":[0.087057166,0.000052186188,0.9107184,0.0015198061,0.00042753122,0.000023734743,0.000007739856,0.000026796823,0.00016667682],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978092,0.000013134656,0.0003057363,0.0010691986,0.00039655739,0.00040618549],"domain_scores_gemma":[0.9984123,0.00035176257,0.00018288539,0.0007896919,0.00014717442,0.000116158175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007827272,0.00032679783,0.0003123685,0.00039792416,0.00025689788,0.0004274344,0.0013867922,0.000350916,0.0000067217024],"category_scores_gemma":[0.00007935813,0.00029226742,0.000077662466,0.00019133309,0.00045697993,0.00054276176,0.00061301445,0.0005011892,0.000010442394],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008336943,0.000016276359,0.000017746506,0.000045181096,0.0000052994137,0.000009064614,0.00027356338,0.0006810535,0.0031313421,0.14172259,0.000012000194,0.8540776],"study_design_scores_gemma":[0.0002945509,0.00013263951,0.00016050007,0.00015594861,0.0000050721724,0.000060437545,7.032411e-8,0.41550228,0.0031215395,0.5770029,0.0031377142,0.00042636823],"about_ca_topic_score_codex":0.0000075696944,"about_ca_topic_score_gemma":0.000033759014,"teacher_disagreement_score":0.85365117,"about_ca_system_score_codex":0.000070568814,"about_ca_system_score_gemma":0.00017178456,"threshold_uncertainty_score":0.999953},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062233576,0.00032193388,0.99683183,0.00014442831,0.00062839396,0.000995107,0.0000023957173,0.00010646243,0.00034711394],"genre_scores_gemma":[0.08612388,0.000033062184,0.91340214,0.00014068099,0.00022195047,0.00002949419,0.000004017725,0.000018878107,0.000025922762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971804,0.000016933618,0.00063658785,0.0011002569,0.0006719144,0.00039390297],"domain_scores_gemma":[0.9978953,0.00038347635,0.00057931046,0.0007448516,0.00029501083,0.000102078746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001418237,0.00032917442,0.00039446517,0.00047290613,0.0001774921,0.00023236308,0.0013426706,0.00031758336,0.0000022021052],"category_scores_gemma":[0.00022415684,0.00029126104,0.0000827468,0.00036707302,0.00043169328,0.0007360395,0.0004736204,0.00041023368,0.0000022807992],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001207358,0.000028337368,0.000050583396,0.00009927789,0.000003946741,0.0000014324082,0.00021492243,0.010956972,0.00019306692,0.020855876,0.0000017376252,0.96758175],"study_design_scores_gemma":[0.00020274852,0.00038017487,0.00054376107,0.0005482841,0.00000772272,0.000059562357,1.933351e-7,0.81140494,0.0012788745,0.18498544,0.00029984026,0.0002884311],"about_ca_topic_score_codex":0.000005661339,"about_ca_topic_score_gemma":0.000019623909,"teacher_disagreement_score":0.9672933,"about_ca_system_score_codex":0.00015118744,"about_ca_system_score_gemma":0.00022659688,"threshold_uncertainty_score":0.9999539},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.8381702e-7,0.0006452797,0.9910573,0.0013945211,0.0016383666,0.0016034476,0.000003336098,0.0003237682,0.0033338165],"genre_scores_gemma":[0.0011943949,0.000060567632,0.9943036,0.0033072634,0.00057088764,0.00041126582,0.000008268183,0.000043382857,0.00010036246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994585,0.0002771491,0.0010919059,0.0018860566,0.0010665767,0.0010933083],"domain_scores_gemma":[0.9948076,0.001512849,0.00046947968,0.002483224,0.00033823776,0.00038861026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007004125,0.00059227005,0.00078055845,0.00095361326,0.00093134557,0.0005540487,0.0047938838,0.0003935711,0.000014487599],"category_scores_gemma":[0.00045289894,0.00058112957,0.00017035649,0.000963468,0.0011329718,0.0010106572,0.0019953959,0.0012561058,0.00008318115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021777846,0.000009326763,0.0000017538763,0.00006968799,0.000002866089,0.0000012710559,0.00028865415,0.0019238851,0.0000320869,0.37389407,0.0000047602366,0.62376946],"study_design_scores_gemma":[0.00014145776,0.00017071994,0.000024199118,0.00022153692,0.0000057185093,0.00007098652,2.7304418e-7,0.5597129,0.00076957775,0.37684065,0.061407737,0.00063425256],"about_ca_topic_score_codex":0.000029106572,"about_ca_topic_score_gemma":0.000019611029,"teacher_disagreement_score":0.6231352,"about_ca_system_score_codex":0.0007584998,"about_ca_system_score_gemma":0.0008762677,"threshold_uncertainty_score":0.999664},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001421145,0.00009036612,0.99417686,0.00081892294,0.0008177389,0.00075451826,0.0000359466,0.000052640156,0.0018318504],"genre_scores_gemma":[0.8662822,0.000045375495,0.12904055,0.0015171713,0.00020705415,0.00010011031,0.000012105515,0.000043441938,0.0027519395],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960465,0.00007513226,0.0007722617,0.0014656341,0.0011764747,0.00046403555],"domain_scores_gemma":[0.9947627,0.0034103584,0.00045767086,0.00083285075,0.00042499602,0.00011141735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025586663,0.00037118705,0.0005146563,0.0014783222,0.00044334386,0.00025932826,0.0018758517,0.0003002928,0.00015311988],"category_scores_gemma":[0.0008522947,0.00030693953,0.00017755701,0.0011143391,0.00080461515,0.00031098316,0.00027914997,0.0004873767,0.00007596188],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017430763,0.00013080575,0.00015767904,0.00002968767,0.000018313644,0.00003790728,0.0021266947,0.13593182,0.00046387877,0.090870656,0.00024931962,0.76980895],"study_design_scores_gemma":[0.00030394868,0.000055080036,0.00006385935,0.00010336718,0.00000415184,0.000009128261,0.0000025975348,0.47768596,0.0007786865,0.51813203,0.0025579827,0.00030322213],"about_ca_topic_score_codex":0.0000068529152,"about_ca_topic_score_gemma":0.00014279892,"teacher_disagreement_score":0.8651363,"about_ca_system_score_codex":0.00030699797,"about_ca_system_score_gemma":0.00045792293,"threshold_uncertainty_score":0.99993825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027953572,0.0000946631,0.9687967,0.00053707336,0.0014568829,0.023577841,0.000005041005,0.00041310565,0.005115954],"genre_scores_gemma":[0.14960603,0.00001108076,0.8281051,0.003318326,0.0029407372,0.014858821,0.000009520024,0.00019912636,0.00095126336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99356985,0.0000507284,0.00085092837,0.0026481969,0.0015817644,0.001298553],"domain_scores_gemma":[0.99586684,0.00037171328,0.0005908751,0.0025561226,0.0002973524,0.00031710273],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.000976925,0.0009045121,0.00077804417,0.00046366232,0.00042042724,0.0010562628,0.006031828,0.0005445445,0.00005789108],"category_scores_gemma":[0.00009824117,0.00083273737,0.00022218967,0.0010858983,0.0007976102,0.0009216945,0.0022469102,0.0017250598,0.00009098189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016404614,0.00006637878,0.000049694587,0.00015375746,0.00001801484,0.0004005301,0.0012230692,0.10212692,0.000051444415,0.39758122,0.00006486422,0.4982477],"study_design_scores_gemma":[0.0009011442,0.00033711165,0.00010546045,0.0020793534,0.000008818904,0.00013426106,1.1904529e-7,0.60949147,0.00067405886,0.37343222,0.011222119,0.0016138885],"about_ca_topic_score_codex":0.000026113203,"about_ca_topic_score_gemma":0.00014201693,"teacher_disagreement_score":0.5073645,"about_ca_system_score_codex":0.0010526156,"about_ca_system_score_gemma":0.0014090221,"threshold_uncertainty_score":0.99998075},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022395256,0.0067066443,0.9848705,0.0006679975,0.00047210781,0.00036062676,0.000004998451,0.00033453334,0.006358645],"genre_scores_gemma":[0.10713449,0.029026339,0.86156535,0.0007373972,0.000893119,0.000031666987,0.000014971241,0.00007960063,0.00051703845],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702764,0.00004591088,0.00057297765,0.0012441882,0.00068033044,0.0004289783],"domain_scores_gemma":[0.997991,0.0004742303,0.0003536712,0.0006158014,0.0003528409,0.00021245761],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052473514,0.0004309776,0.00057304965,0.0011918703,0.0002011291,0.00015990295,0.0010509983,0.00035335644,0.000018019984],"category_scores_gemma":[0.0001470261,0.00043190035,0.00011843734,0.00040565289,0.00073261326,0.00070721604,0.00065067055,0.00059030764,0.000018734609],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029076011,0.000028174863,0.000004443514,0.000041311498,0.000008382238,0.000022178867,0.00071683206,0.00001387578,0.00017727837,0.0009766683,0.000027007465,0.99798095],"study_design_scores_gemma":[0.0014405446,0.001985716,0.00112542,0.0049234997,0.000057467307,0.0019054305,0.0000025176378,0.067451075,0.09083554,0.8179207,0.009287656,0.003064455],"about_ca_topic_score_codex":0.00003392069,"about_ca_topic_score_gemma":0.00008101864,"teacher_disagreement_score":0.9949165,"about_ca_system_score_codex":0.000114477705,"about_ca_system_score_gemma":0.00042833903,"threshold_uncertainty_score":0.99981326},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018050257,0.00013078634,0.9887764,0.00031966824,0.0017276388,0.0006776349,0.000005637871,0.0002976041,0.008046591],"genre_scores_gemma":[0.033551656,0.0000037686189,0.9646013,0.0012473703,0.0002982235,0.00004809823,0.000018816621,0.00003118746,0.00019960664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99456185,0.00010036527,0.0007808262,0.0021671867,0.0014079707,0.0009818275],"domain_scores_gemma":[0.99548274,0.0003988283,0.0003966272,0.0029326011,0.0005505155,0.00023870691],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0025459742,0.00069865736,0.0008121651,0.0018201532,0.0004224265,0.00072725717,0.0054451865,0.00069409347,0.000054071264],"category_scores_gemma":[0.00026688527,0.0006016732,0.00029110422,0.0030879325,0.001244341,0.001102874,0.0012178691,0.0016474789,0.000039073722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016218475,0.00014879488,0.000057498135,0.00014212806,0.000080885045,0.00003156028,0.00042024147,0.2742392,0.00023871455,0.48492208,0.000005017503,0.23969765],"study_design_scores_gemma":[0.00019774516,0.00012756577,0.0002956142,0.000049724895,0.00007148555,0.000017564811,5.3091497e-8,0.8673961,0.00048740176,0.12995766,0.0007263112,0.0006727384],"about_ca_topic_score_codex":0.00001776171,"about_ca_topic_score_gemma":0.000033008644,"teacher_disagreement_score":0.59315693,"about_ca_system_score_codex":0.00031282075,"about_ca_system_score_gemma":0.0007671745,"threshold_uncertainty_score":0.9999358},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067592197,0.0007650348,0.9932944,0.00011267717,0.0026608414,0.0006002009,0.0000027420201,0.0003449617,0.0015431839],"genre_scores_gemma":[0.85437727,0.00005985287,0.14440122,0.00008167604,0.0009213797,0.000017302516,0.0000025361587,0.000029306935,0.000109423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961203,0.00006313693,0.000775896,0.0013142851,0.0011346923,0.000591723],"domain_scores_gemma":[0.9974857,0.00015145038,0.00059528847,0.0012026351,0.00041753415,0.00014740939],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011275855,0.00046121777,0.0005517442,0.0012355647,0.0003473179,0.00027945157,0.001871194,0.0003483979,0.000012721396],"category_scores_gemma":[0.00004901393,0.00044268253,0.00018492789,0.0010178123,0.00045521895,0.0008938484,0.000969305,0.00080073136,0.00003932478],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017637374,0.000030121357,0.000005807304,0.00010333535,0.000008031864,0.000016844802,0.00015198355,0.02062787,0.0009932417,0.013738833,0.0000057236266,0.9643006],"study_design_scores_gemma":[0.00029998258,0.00047382424,0.000028483639,0.00089222693,0.000013891398,0.00027576534,3.5333488e-7,0.9390586,0.021930115,0.032656334,0.0038201446,0.0005502863],"about_ca_topic_score_codex":0.00010277848,"about_ca_topic_score_gemma":0.00020447579,"teacher_disagreement_score":0.9637503,"about_ca_system_score_codex":0.0011865865,"about_ca_system_score_gemma":0.00035886266,"threshold_uncertainty_score":0.9998025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030030664,0.00015769471,0.99247193,0.00046804245,0.00097119133,0.00031457396,0.0000581254,0.00014814064,0.0053802896],"genre_scores_gemma":[0.03522275,0.000085862936,0.96351933,0.0005073563,0.00027486964,0.000009954762,0.00007319238,0.00003118692,0.0002755231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996793,0.000028180653,0.000677236,0.0010713364,0.0009545905,0.000475705],"domain_scores_gemma":[0.99726427,0.00038019443,0.0004142111,0.0014864503,0.0003063277,0.00014853757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045973322,0.00038170628,0.0004592392,0.00085256837,0.00028804233,0.00030043678,0.003177579,0.0001659374,0.00006328439],"category_scores_gemma":[0.000034136992,0.0003529928,0.00011629797,0.00077397894,0.00049366406,0.00080257526,0.0018836419,0.00042008192,0.000033987955],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019073673,0.00005285006,0.00005463094,0.000027953083,0.000012056415,0.00003644319,0.00050919707,0.0389681,0.00007217874,0.05195224,0.00014978286,0.90816265],"study_design_scores_gemma":[0.00037361428,0.00014875791,0.00037736894,0.00031539387,0.00001001061,0.00007199722,4.469405e-7,0.85761964,0.000393756,0.13632171,0.0038906308,0.00047664018],"about_ca_topic_score_codex":0.000067825014,"about_ca_topic_score_gemma":0.00006808982,"teacher_disagreement_score":0.907686,"about_ca_system_score_codex":0.00014741007,"about_ca_system_score_gemma":0.0005181348,"threshold_uncertainty_score":0.99989223},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078824304,0.0003977069,0.91410846,0.00022120996,0.0007577758,0.0010012314,0.00004030988,0.000057336467,0.0045916443],"genre_scores_gemma":[0.9989557,0.000119283264,0.0007479034,0.00006964956,0.000040620213,0.000027803233,0.0000020646348,0.000009422477,0.000027514561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992654,0.000005483857,0.00027224515,0.00014367545,0.00019896984,0.000114249604],"domain_scores_gemma":[0.99913436,0.00044019512,0.000122053294,0.00020781191,0.0000741017,0.00002150292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023807796,0.00014155536,0.00020921968,0.000183212,0.00004918552,0.00001542603,0.00022293984,0.00009247437,0.0000049560886],"category_scores_gemma":[0.000037167712,0.00009724208,0.000037209655,0.00011262354,0.00016346468,0.00008154586,0.000027064458,0.00016691939,0.000001175634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004256084,0.00001356263,0.00033649494,0.00045471903,0.00003425358,4.9827446e-7,0.0015434142,0.15488094,0.0006355213,0.005156882,0.000031137562,0.83687],"study_design_scores_gemma":[0.0001719085,0.00015308872,0.0005049652,0.0002843776,0.0000042764054,0.0000037460568,6.0116827e-7,0.9934713,0.003602754,0.0010031246,0.0006962166,0.00010360165],"about_ca_topic_score_codex":0.0000054966276,"about_ca_topic_score_gemma":0.000017351409,"teacher_disagreement_score":0.92013144,"about_ca_system_score_codex":0.000046309735,"about_ca_system_score_gemma":0.000017863591,"threshold_uncertainty_score":0.39654168},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000155055,0.00035739443,0.98986506,0.0015615902,0.0018853149,0.00063116057,0.000009488905,0.00021694311,0.005457558],"genre_scores_gemma":[0.08235935,0.00003239994,0.91509604,0.0015252393,0.0006872421,0.000025306137,0.000022521594,0.000037716633,0.00021419692],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99631006,0.00001957389,0.0005047147,0.0016522047,0.00073313236,0.0007803155],"domain_scores_gemma":[0.9974174,0.00033695446,0.0003301,0.0014712322,0.00024263072,0.00020166277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073400297,0.0005273019,0.0005327649,0.00059497764,0.00045592675,0.00064775394,0.0032878912,0.00035637262,0.000012931168],"category_scores_gemma":[0.00009748982,0.00046522624,0.00021398405,0.0005181737,0.0005182611,0.0005792479,0.0008846608,0.00059717626,0.000027437512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009771414,0.00003717077,0.000073069925,0.000054135726,0.000013644952,0.00009688164,0.0007909446,0.041960996,0.0000051251427,0.46733478,0.00015799761,0.48946548],"study_design_scores_gemma":[0.0003719285,0.00024663287,0.000058093403,0.00041852565,0.000007689405,0.00006140198,1.13479324e-7,0.3452215,0.00009212601,0.64695436,0.005917948,0.00064969214],"about_ca_topic_score_codex":0.00006750327,"about_ca_topic_score_gemma":0.00016912297,"teacher_disagreement_score":0.48881578,"about_ca_system_score_codex":0.00039327596,"about_ca_system_score_gemma":0.0009294413,"threshold_uncertainty_score":0.99977994},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012104867,0.0006767088,0.99526334,0.00033899865,0.0015636872,0.00026386662,0.0000064646356,0.0002850966,0.00039136768],"genre_scores_gemma":[0.8020497,0.00007652283,0.19675238,0.0006835476,0.00032995988,0.000005496165,0.000003995708,0.000028766202,0.00006960167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968296,0.000033173394,0.00045523292,0.0014087576,0.00064968714,0.00062352174],"domain_scores_gemma":[0.9980888,0.00033997995,0.00020230272,0.0010118742,0.0001539331,0.00020311344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005666383,0.00042633602,0.00038490555,0.00036033837,0.00037551424,0.0007257223,0.0013750549,0.00030996374,0.000023247916],"category_scores_gemma":[0.00009158025,0.00039877422,0.00008146391,0.000441714,0.00046089903,0.0007833098,0.0008562932,0.00077126763,0.00002842829],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008237808,0.000025557776,0.000082520964,0.00002815626,0.000007762566,0.000106161664,0.0007641154,0.035300184,0.0010664571,0.0062170764,0.000006866607,0.9563869],"study_design_scores_gemma":[0.00063778495,0.00022068371,0.00078754115,0.000542723,0.000011481597,0.00019683303,3.200296e-7,0.8905289,0.008986418,0.095811576,0.0014245943,0.0008511523],"about_ca_topic_score_codex":0.000045565455,"about_ca_topic_score_gemma":0.00011406071,"teacher_disagreement_score":0.95553577,"about_ca_system_score_codex":0.00018511008,"about_ca_system_score_gemma":0.00016227578,"threshold_uncertainty_score":0.9998464},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006667325,0.0007248048,0.9955546,0.0014272436,0.00019768611,0.0006621315,0.000006132259,0.000098112636,0.0012625873],"genre_scores_gemma":[0.09912833,0.00018524965,0.898438,0.0017311602,0.0000891026,0.00006701849,0.00006415402,0.00002527571,0.000271701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843585,0.00002710442,0.00035549747,0.0006287496,0.00028686828,0.00026593008],"domain_scores_gemma":[0.99805605,0.00040274658,0.00021305842,0.0009956731,0.0002570533,0.000075417694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007047001,0.00023759868,0.00022660806,0.00029249035,0.00048456175,0.00062200543,0.0011272283,0.0001701783,0.0000042457477],"category_scores_gemma":[0.00006718597,0.00023803794,0.00004519071,0.0002790489,0.0002476157,0.000958488,0.00038707416,0.00026531928,0.000009105072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025276747,0.000027114784,0.0000069405432,0.000083085004,0.000006864887,0.0000016196168,0.0011286834,0.005113115,0.00088731013,0.34784842,0.00018191324,0.6447124],"study_design_scores_gemma":[0.00020791373,0.000047058536,0.000020641348,0.000121157056,0.000008371873,0.000035661946,2.1474035e-7,0.8911761,0.0015259284,0.09779057,0.008774473,0.0002918818],"about_ca_topic_score_codex":0.00000722237,"about_ca_topic_score_gemma":0.000049164282,"teacher_disagreement_score":0.88606304,"about_ca_system_score_codex":0.00013972323,"about_ca_system_score_gemma":0.00012427813,"threshold_uncertainty_score":0.97069055},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000126158175,0.0010400988,0.9843455,0.0009053009,0.0019588075,0.0006510235,0.000007992398,0.0008060107,0.010272635],"genre_scores_gemma":[0.05527624,0.0002157073,0.94224614,0.0010211219,0.0008185854,0.00003607492,0.0000056245717,0.000057884863,0.00032263147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945797,0.000080677244,0.00078986667,0.0019978595,0.0015133553,0.0010385806],"domain_scores_gemma":[0.996349,0.00038236575,0.00046514158,0.0021708284,0.0003394325,0.00029326297],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001197432,0.00080710184,0.000793412,0.0018155233,0.00035068914,0.0011115865,0.0037924035,0.0005794027,0.000008717835],"category_scores_gemma":[0.00006349576,0.0007089719,0.0003100148,0.0011566301,0.0009777414,0.0015542785,0.0015713568,0.0014369781,0.000025600571],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014264237,0.00006615746,0.000047282123,0.00007815498,0.000032798165,0.00030861088,0.0003800609,0.0041733496,0.00004617151,0.14840789,0.00012219713,0.8463231],"study_design_scores_gemma":[0.0007482792,0.00089532614,0.00013142345,0.0019193031,0.000046536567,0.0010854277,6.5136896e-7,0.57600945,0.0023046094,0.29580912,0.11777359,0.0032762694],"about_ca_topic_score_codex":0.00002127921,"about_ca_topic_score_gemma":0.000022803471,"teacher_disagreement_score":0.8430468,"about_ca_system_score_codex":0.00026973637,"about_ca_system_score_gemma":0.000599545,"threshold_uncertainty_score":0.9999254},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037440324,0.00030355575,0.9833998,0.0019353161,0.0006304909,0.00030331436,0.0000010898946,0.00013181467,0.013257141],"genre_scores_gemma":[0.009821511,0.000035854322,0.9857392,0.0025738222,0.00043274538,0.000005673282,0.0000035383555,0.000021012951,0.0013666584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996118,0.00008512577,0.00043786882,0.0014517797,0.0011906323,0.000716585],"domain_scores_gemma":[0.9976916,0.00035012604,0.00020152389,0.0013409785,0.00023672295,0.00017905488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011479486,0.00048608793,0.00048522078,0.0006173182,0.00028551888,0.00067717815,0.0026127272,0.0002989805,0.00002960471],"category_scores_gemma":[0.00006521732,0.0003912071,0.00010775482,0.0005285246,0.0006209733,0.00065964623,0.0006955888,0.0010754925,0.000043922446],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027483298,0.00003081051,0.0000017860848,0.00001800336,0.0000074419804,0.0002786365,0.000419725,0.0010160868,0.0006876501,0.0073853135,0.000063011306,0.990064],"study_design_scores_gemma":[0.0010571377,0.0016498517,0.00015209557,0.0009282042,0.00002246639,0.00030577317,1.1912129e-7,0.49211133,0.011555323,0.48664567,0.0041010613,0.0014709629],"about_ca_topic_score_codex":0.000016695676,"about_ca_topic_score_gemma":0.000024080253,"teacher_disagreement_score":0.9885931,"about_ca_system_score_codex":0.00025186126,"about_ca_system_score_gemma":0.00052012375,"threshold_uncertainty_score":0.99985397},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024681873,0.017535526,0.9788189,0.00007720613,0.0017850292,0.0006100656,0.0000017789414,0.00020880836,0.0007158641],"genre_scores_gemma":[0.50692457,0.002004166,0.48736286,0.0015850608,0.0012275755,0.00008212109,0.000015734768,0.00019846589,0.0005994397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933019,0.00015444783,0.0010156345,0.0025338163,0.0012840527,0.0017101286],"domain_scores_gemma":[0.9962956,0.0007826688,0.0004941746,0.0018664633,0.00022413365,0.00033696252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020787015,0.0008927231,0.0010618899,0.0009868529,0.00040986613,0.0006897688,0.003799341,0.0006936408,0.000036931473],"category_scores_gemma":[0.000026823136,0.0008483032,0.0002031665,0.0014903323,0.0004765773,0.00044919195,0.001508884,0.0013377678,0.000007351685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006997795,0.000020308747,0.0000074980107,0.000018539135,0.0000035426133,0.00004061223,0.00025004693,0.5389779,0.00006569386,0.0014429045,0.000006432424,0.45915952],"study_design_scores_gemma":[0.00050359813,0.0001743291,0.000010173437,0.0012587006,0.000010706638,0.00004982463,4.996887e-7,0.98268884,0.0004943398,0.0042347563,0.00966772,0.0009064903],"about_ca_topic_score_codex":0.000064435895,"about_ca_topic_score_gemma":0.00016429773,"teacher_disagreement_score":0.50667775,"about_ca_system_score_codex":0.00080868194,"about_ca_system_score_gemma":0.0005965624,"threshold_uncertainty_score":0.9993968},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019136176,0.0007716591,0.9885034,0.0004370143,0.0042042434,0.00042681498,0.0000015307346,0.00026132818,0.005374873],"genre_scores_gemma":[0.5723635,0.000117871765,0.40971103,0.00062476925,0.0028661655,0.0000416209,0.0000030224485,0.00014485454,0.014127157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561745,0.000057436268,0.0006677605,0.0014643645,0.001294042,0.00089894177],"domain_scores_gemma":[0.9968432,0.00060905324,0.00045823658,0.0015361703,0.00039290191,0.0001604071],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014057332,0.00058009225,0.00050261954,0.00042840387,0.0010447049,0.0014584841,0.0041686012,0.0003034284,0.0000042147535],"category_scores_gemma":[0.000044008335,0.00041240765,0.00020274088,0.00042975965,0.00042624358,0.00051379914,0.001136292,0.0011723528,0.0001346477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014458075,0.0000028396043,0.0000034889101,0.000025392434,0.000008217027,0.00006204331,0.00036546722,0.48620558,0.000008267345,0.47927773,0.0000023940029,0.034037136],"study_design_scores_gemma":[0.00014938432,0.00009820611,0.0000043829996,0.0017437362,0.0000072560074,0.00007774282,0.0000018587417,0.92171484,0.0005038542,0.05693544,0.018096939,0.0006663601],"about_ca_topic_score_codex":0.000088166984,"about_ca_topic_score_gemma":0.00002021898,"teacher_disagreement_score":0.57879233,"about_ca_system_score_codex":0.0010672541,"about_ca_system_score_gemma":0.00071545993,"threshold_uncertainty_score":0.99983275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005373662,0.0006375458,0.99287325,0.0001495017,0.001959848,0.00042118406,0.000006462371,0.00030419583,0.0031106167],"genre_scores_gemma":[0.30458558,0.000008790656,0.6945942,0.0004704757,0.00023221475,0.000003918507,0.0000063794805,0.00002850416,0.00006990932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952843,0.00006248653,0.00069361716,0.0018866303,0.0011268149,0.0009461587],"domain_scores_gemma":[0.99657786,0.00096381124,0.00037155018,0.0016384623,0.00028945753,0.00015887555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011332989,0.00068011903,0.000829204,0.0013472881,0.00041812198,0.0009479404,0.003939062,0.00050136814,0.0000042222264],"category_scores_gemma":[0.00035493713,0.0006279779,0.00019381005,0.0011602099,0.0008077667,0.00071617216,0.0021725981,0.0009403928,0.000009791584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025220346,0.00044569653,0.0042494726,0.00038467126,0.0000769213,0.000627185,0.0027819758,0.40918478,0.0016144613,0.031400874,0.00014089952,0.54906785],"study_design_scores_gemma":[0.00040904584,0.00006748523,0.00033037062,0.00016120788,0.000014407804,0.00009793556,4.0981243e-7,0.9724359,0.00082281634,0.024516268,0.0004112012,0.0007329506],"about_ca_topic_score_codex":0.00032844424,"about_ca_topic_score_gemma":0.000080528735,"teacher_disagreement_score":0.5632511,"about_ca_system_score_codex":0.00037323634,"about_ca_system_score_gemma":0.00044381278,"threshold_uncertainty_score":0.99961716},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000059181225,0.0007896386,0.97472817,0.014919111,0.0014221108,0.0007080575,0.00007110089,0.0010687384,0.0062871645],"genre_scores_gemma":[0.0032850804,0.00014159344,0.99397725,0.0018728413,0.00039919026,0.00001505288,0.00006197748,0.000038824062,0.00020817926],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928194,0.000041122734,0.0007643771,0.0038142558,0.0014100404,0.0011508052],"domain_scores_gemma":[0.95654285,0.0005709699,0.000460364,0.042033035,0.00019130277,0.00020147461],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016455775,0.00080564665,0.00075379165,0.0012679842,0.0003036204,0.0011484141,0.18595973,0.0006167538,0.000029075545],"category_scores_gemma":[0.007446832,0.00076556695,0.000103511484,0.0011221678,0.0011398642,0.0025682782,0.30242077,0.0017529023,0.00014814845],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023908315,0.000029338475,0.00001834305,0.000019564126,0.000011040669,0.00015988253,0.000029579265,0.0002913621,0.00002348769,0.0049640094,0.007924173,0.98652685],"study_design_scores_gemma":[0.00015925485,0.000090598645,0.000036891364,0.00025903885,0.0000061247742,0.00008697351,2.9446834e-8,0.39392743,0.0002608912,0.53243464,0.07207271,0.0006654358],"about_ca_topic_score_codex":0.000019691308,"about_ca_topic_score_gemma":0.00004407116,"teacher_disagreement_score":0.9858614,"about_ca_system_score_codex":0.0004533487,"about_ca_system_score_gemma":0.000992581,"threshold_uncertainty_score":0.9998885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030830156,0.000043939814,0.99451166,0.00028387154,0.0003438617,0.0003320789,0.000009040031,0.000039710474,0.0013528293],"genre_scores_gemma":[0.2506373,0.000011840952,0.74883956,0.00031460187,0.000095998905,0.0000068436575,0.000007018081,0.00001885409,0.000068012494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975996,0.000017819997,0.00039809904,0.0008209369,0.0007815871,0.00038193265],"domain_scores_gemma":[0.99817085,0.00009524273,0.0003457916,0.0010846974,0.00019680707,0.00010662778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005338939,0.00033941542,0.00035236508,0.00028121684,0.0006204113,0.00032455166,0.003169225,0.00019483764,0.0000094823345],"category_scores_gemma":[0.000019055766,0.00023067811,0.0000864712,0.000118126205,0.00055487105,0.0010849456,0.00064446643,0.00045165283,0.0000042168117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011322948,0.000017722734,6.9647217e-7,0.000019884601,0.000008157261,0.000006280668,0.0032897508,0.053545866,0.0024568636,0.00058452756,0.0000011516686,0.94005775],"study_design_scores_gemma":[0.00015177377,0.00004324286,0.000018148896,0.00048737193,0.0000061416295,0.000014614982,7.2378555e-7,0.9171377,0.03656849,0.045160882,0.000110186746,0.00030076355],"about_ca_topic_score_codex":0.000011995312,"about_ca_topic_score_gemma":0.00009494508,"teacher_disagreement_score":0.939757,"about_ca_system_score_codex":0.00013375531,"about_ca_system_score_gemma":0.0008395835,"threshold_uncertainty_score":0.940678},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007019317,0.00048297152,0.9945024,0.000040819144,0.0014082543,0.00017365844,0.000005908052,0.00057439756,0.0021096128],"genre_scores_gemma":[0.10413024,0.000035973764,0.89520663,0.000121476696,0.000401687,0.0000012475791,0.0000076175,0.00006219664,0.000032910095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981171,0.000009314867,0.0003260429,0.0005624301,0.0005070568,0.00047806153],"domain_scores_gemma":[0.9991333,0.00012717508,0.000047239144,0.00038511824,0.0001699553,0.0001372493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034769252,0.0003539699,0.00033093686,0.0006174293,0.00014486576,0.00021485238,0.0005346584,0.00030721503,0.00010264775],"category_scores_gemma":[0.00004806477,0.0003709626,0.000071914495,0.0004338159,0.00047588226,0.000141794,0.00012635105,0.0008370493,0.000026582076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.28042e-7,0.0000033260774,0.000006969156,0.00003088344,0.000008986299,0.000026340113,0.00019064908,0.92285305,0.000157649,0.0004938393,2.2502367e-7,0.076227166],"study_design_scores_gemma":[0.00019631,0.000015703205,0.000005585623,0.00048873655,0.0000075112166,0.00004628699,3.64793e-7,0.99174774,0.0019231013,0.0051502036,0.000013415364,0.00040505538],"about_ca_topic_score_codex":0.000012975655,"about_ca_topic_score_gemma":0.000007668653,"teacher_disagreement_score":0.10342831,"about_ca_system_score_codex":0.00045556654,"about_ca_system_score_gemma":0.00041962744,"threshold_uncertainty_score":0.99987423},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002697066,0.00006978073,0.9947645,0.0007979554,0.0022066832,0.0008485774,0.00045783276,0.00019186926,0.0003930839],"genre_scores_gemma":[0.6646419,0.0000024354397,0.33329085,0.0011140328,0.00035343348,0.000025060916,0.00027563714,0.00005112522,0.00024553208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949553,0.000053393724,0.00069611514,0.0019178609,0.0013200974,0.0010572542],"domain_scores_gemma":[0.9961333,0.0012972296,0.00037734315,0.0017390263,0.0001549623,0.0002981213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010368706,0.0006779876,0.0006657861,0.00045103414,0.00065538567,0.0005877996,0.0031032185,0.0005650108,0.000014958323],"category_scores_gemma":[0.00016194883,0.0006393579,0.00026532606,0.00042578662,0.00043313476,0.000247603,0.00069929595,0.0012808334,0.00004856951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003650366,0.00023869904,0.00016966011,0.00008951185,0.000026624246,0.000050601186,0.00046889484,0.9311197,0.0005517451,0.009716884,0.000049835184,0.057481386],"study_design_scores_gemma":[0.00077378104,0.00023478702,0.00012028228,0.000338491,0.00001011891,0.000014755594,1.227958e-7,0.9514329,0.0002793718,0.026822567,0.019303441,0.0006694079],"about_ca_topic_score_codex":0.000007854751,"about_ca_topic_score_gemma":0.0001427043,"teacher_disagreement_score":0.6643722,"about_ca_system_score_codex":0.0008504009,"about_ca_system_score_gemma":0.0007327234,"threshold_uncertainty_score":0.9996058},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049035973,0.004452965,0.9924316,0.00066776155,0.00082000886,0.00039796476,0.000041828403,0.000045345285,0.00065216626],"genre_scores_gemma":[0.9070723,0.00041210174,0.08846988,0.0018614486,0.0018714694,0.00002950348,0.000011136454,0.000096353535,0.00017582085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820715,0.00003707919,0.0003346526,0.00046934234,0.00059671776,0.00035504825],"domain_scores_gemma":[0.9984288,0.00048738258,0.00006859048,0.00089300855,0.00006738412,0.000054818145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003992236,0.00030088823,0.00024085173,0.000086400236,0.00021261179,0.00014214304,0.0018178395,0.00013874783,0.000060289858],"category_scores_gemma":[0.000031086318,0.00015659558,0.00008657638,0.00030838329,0.00031162114,0.000057395497,0.00023018605,0.00055467023,0.000030519335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.6997517e-7,0.0000022440013,0.000006113877,0.0000031512309,0.000008348411,0.0000021796532,0.00079551805,0.4079827,0.000065166576,0.00007998043,0.0001681299,0.5908856],"study_design_scores_gemma":[0.000052876036,0.00004980776,0.00034458202,0.00029063382,0.000020667734,0.000019152978,0.000002247954,0.9576488,0.0018947655,0.032421127,0.0069087907,0.0003465212],"about_ca_topic_score_codex":0.00048227183,"about_ca_topic_score_gemma":0.00019041303,"teacher_disagreement_score":0.90658194,"about_ca_system_score_codex":0.00017076147,"about_ca_system_score_gemma":0.0000783873,"threshold_uncertainty_score":0.63857824},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031923628,0.00033866792,0.99146837,0.0011859485,0.0011218064,0.00034281306,0.0000045131346,0.000097522076,0.0022479831],"genre_scores_gemma":[0.79823637,0.00008483631,0.19868486,0.001865663,0.0005596082,0.000011101824,0.000014485566,0.000030379728,0.00051270996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967755,0.000037217764,0.00051498006,0.0013774057,0.0008232088,0.00047167088],"domain_scores_gemma":[0.99810284,0.00063438463,0.00018130972,0.000730759,0.0001884897,0.00016222917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045956727,0.0004431028,0.0004088691,0.0015345555,0.00022153548,0.00039257,0.0011676094,0.00018170675,0.000028530514],"category_scores_gemma":[0.0001165198,0.00039929544,0.00006939339,0.0011894396,0.00032448713,0.00048730502,0.0007075885,0.00085388974,0.000026459364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001294189,0.0000929015,0.00013544182,0.00002056375,0.000010567604,0.00017767875,0.0005613398,0.29783422,0.00035569718,0.1362238,0.000053620777,0.56452125],"study_design_scores_gemma":[0.0004877568,0.00025672428,0.0014052927,0.00031548578,0.0000047053345,0.000057672645,6.400745e-8,0.8219533,0.00044947985,0.17396213,0.00061900873,0.00048839214],"about_ca_topic_score_codex":0.00003011516,"about_ca_topic_score_gemma":0.00024445364,"teacher_disagreement_score":0.795044,"about_ca_system_score_codex":0.0002017929,"about_ca_system_score_gemma":0.00023255676,"threshold_uncertainty_score":0.99984586},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005788886,0.00090864743,0.994867,0.00005378608,0.0005855251,0.00012460798,0.0000069102493,0.0000956078,0.0027790237],"genre_scores_gemma":[0.85936826,0.000032815627,0.1391777,0.00006552775,0.0005803626,0.000005024752,0.0000145600025,0.000046390538,0.00070938625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984888,0.0000034356476,0.00032125696,0.00049239205,0.0002883066,0.0004058397],"domain_scores_gemma":[0.9994467,0.00013057563,0.000052528456,0.00027499488,0.00003546318,0.00005974269],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024254674,0.00028472996,0.00035678846,0.00064626033,0.000079203484,0.00018310678,0.00052351493,0.00018421629,0.000010696732],"category_scores_gemma":[0.000016436205,0.0002822605,0.00010026677,0.00028948236,0.00008334173,0.00014933481,0.00006712641,0.0003769643,0.0000038568796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.2138007e-7,0.000001741927,0.00006587357,0.00002763617,0.000005080396,0.0000041830976,0.00010132991,0.82692105,0.000019945783,0.00018485985,0.000046635578,0.17262088],"study_design_scores_gemma":[0.00014930991,0.000018492601,0.000033497385,0.00031329412,0.000008978037,0.0000017206168,1.8287578e-7,0.9795953,0.00017600314,0.018865166,0.0005311118,0.0003069526],"about_ca_topic_score_codex":0.000059238322,"about_ca_topic_score_gemma":0.0007065772,"teacher_disagreement_score":0.8587893,"about_ca_system_score_codex":0.00024734272,"about_ca_system_score_gemma":0.000120686294,"threshold_uncertainty_score":0.999963},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23114398,0.0013157899,0.7517936,0.005113797,0.0020576823,0.0011106902,0.000008384988,0.0002978995,0.0071581346],"genre_scores_gemma":[0.96389085,0.000024179502,0.035411447,0.0005042034,0.0001174592,0.0000030531926,0.0000011856099,0.000011593798,0.000036011104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647874,0.000043464646,0.00077798706,0.0010554527,0.0009128253,0.0007315244],"domain_scores_gemma":[0.9977764,0.0010830214,0.0005254419,0.00047186005,0.000072530864,0.00007076442],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013804705,0.00041521774,0.000627956,0.0005807477,0.0004173666,0.0013104659,0.0024686875,0.00016731156,0.0000045430043],"category_scores_gemma":[0.00024900853,0.00030752431,0.00010759478,0.0005939462,0.0013016948,0.001185829,0.0015825401,0.00052612805,0.0000015289224],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052562004,0.00002835518,0.0034146046,0.00010097892,0.000012310441,0.00006734427,0.014656029,0.0012056427,0.00044258646,0.013665468,0.0000031022971,0.9663983],"study_design_scores_gemma":[0.0005022378,0.00032884948,0.0199937,0.002464137,0.000017905078,0.00016346594,0.0000731657,0.8052537,0.0005556477,0.16922672,0.00023333622,0.0011871415],"about_ca_topic_score_codex":0.000062728686,"about_ca_topic_score_gemma":0.00008407049,"teacher_disagreement_score":0.96521115,"about_ca_system_score_codex":0.00012934364,"about_ca_system_score_gemma":0.00048616127,"threshold_uncertainty_score":0.9999377},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022351988,0.00032443032,0.972023,0.0031067596,0.0011332879,0.0006768075,0.0000021393128,0.000036419035,0.00034516363],"genre_scores_gemma":[0.9350934,0.000016352693,0.06406018,0.0006086668,0.00014465788,0.0000036240876,0.0000013373028,0.000017190767,0.00005460486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654394,0.00014537075,0.0008839168,0.0008731373,0.001083164,0.0004704701],"domain_scores_gemma":[0.9967253,0.0008416931,0.0007445943,0.0014060031,0.00021010955,0.00007230563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014376198,0.00037528062,0.000608526,0.00046456527,0.00017862662,0.00011916687,0.0036184974,0.00018632218,0.0000066886905],"category_scores_gemma":[0.0001107169,0.00024055611,0.00018519715,0.00085872674,0.00084507995,0.00025229843,0.002396972,0.0006638179,0.000008788566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011554325,0.00017240435,0.00015132735,0.00010416874,0.000021232707,0.000008875743,0.0040540705,0.06110185,0.0030416406,0.066095084,0.000023070805,0.8652147],"study_design_scores_gemma":[0.00037030556,0.00016645604,0.006014496,0.001422217,0.000008214189,0.00002167913,8.1335406e-7,0.8464605,0.008109863,0.13696328,0.00011171418,0.00035041632],"about_ca_topic_score_codex":0.00020466695,"about_ca_topic_score_gemma":0.00009565534,"teacher_disagreement_score":0.91274136,"about_ca_system_score_codex":0.00017522895,"about_ca_system_score_gemma":0.00029491994,"threshold_uncertainty_score":0.98095936},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035490313,0.0002627158,0.99400586,0.00014617103,0.0020117087,0.0009767156,0.000008665627,0.00022575537,0.0023269374],"genre_scores_gemma":[0.018167365,0.000026255322,0.98065263,0.00027765185,0.00027344842,0.00007146753,0.000011876658,0.000055643428,0.00046367076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954529,0.000048278103,0.0005694216,0.001889351,0.001037283,0.0010027942],"domain_scores_gemma":[0.99650264,0.0007472216,0.00036395184,0.0016169831,0.0005619854,0.00020719571],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001957578,0.0005297667,0.00051394926,0.0014226069,0.00046125925,0.0004460701,0.004261224,0.00031495898,0.00001263337],"category_scores_gemma":[0.0002331764,0.00049721834,0.00021895584,0.0010099747,0.0008881452,0.001061134,0.0014224064,0.00072695734,0.000027500615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007779948,0.000019531984,0.000010846697,0.00004445543,0.000008798606,0.000011968692,0.000457065,0.0012988338,0.000103831764,0.3554336,0.000007617452,0.64259565],"study_design_scores_gemma":[0.00024038476,0.00014844077,0.000018207831,0.00014318487,0.0000043958844,0.000022303257,1.4853721e-7,0.24518998,0.003043896,0.75000864,0.00072932505,0.0004510997],"about_ca_topic_score_codex":0.000006389283,"about_ca_topic_score_gemma":0.000016900587,"teacher_disagreement_score":0.64214456,"about_ca_system_score_codex":0.00019766278,"about_ca_system_score_gemma":0.00035503967,"threshold_uncertainty_score":0.99974793},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016564364,0.00038823095,0.98016447,0.000528389,0.0003829832,0.00092603493,0.000012713832,0.0002950039,0.0007377964],"genre_scores_gemma":[0.7037474,0.00014257529,0.29562894,0.00023263384,0.000106423686,0.00003645494,0.0000056294157,0.000022423636,0.00007751407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958442,0.00004136227,0.0009783077,0.0015018816,0.0008729653,0.00076126837],"domain_scores_gemma":[0.99740696,0.00043478786,0.00022467272,0.00144641,0.00026132478,0.0002258168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014749889,0.0005924704,0.0007746609,0.0007776876,0.0003058545,0.00038482642,0.0021992577,0.0008356795,0.000007696191],"category_scores_gemma":[0.00005105598,0.0005082329,0.00012027716,0.0006012636,0.0007078769,0.002979295,0.00062879216,0.0016987361,0.000027510006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033802753,0.000024801553,0.0030680883,0.00026979344,0.0000054090424,0.0000025551067,0.002701227,0.3407734,0.0000016155724,0.0008921441,0.000005913946,0.65225166],"study_design_scores_gemma":[0.0002601575,0.00010191004,0.0036315026,0.00037269323,0.0000056652034,0.000014086051,2.6192222e-7,0.8703471,0.000051087543,0.12466579,0.00003384738,0.0005159378],"about_ca_topic_score_codex":0.00004611732,"about_ca_topic_score_gemma":0.000049513386,"teacher_disagreement_score":0.687183,"about_ca_system_score_codex":0.00037549195,"about_ca_system_score_gemma":0.000643148,"threshold_uncertainty_score":0.9997369},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015668022,0.000023768052,0.99082357,0.00033637663,0.00090016983,0.00024172371,0.000033087712,0.00022729997,0.007398325],"genre_scores_gemma":[0.7005479,0.00008378527,0.26231048,0.028821407,0.0020947836,0.000025469373,0.0008633038,0.00023764872,0.005015239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961546,0.000048066977,0.00055191864,0.0014434165,0.0012746546,0.0005273296],"domain_scores_gemma":[0.99750495,0.00029484817,0.00032755348,0.00150423,0.00021256895,0.00015584785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005960468,0.00051086466,0.00041201207,0.0011596181,0.00022363536,0.00086030056,0.002619914,0.0002758164,0.00005528181],"category_scores_gemma":[0.000071777,0.0004772232,0.00012555235,0.0007913817,0.0002728203,0.0005053054,0.00056875986,0.00040634614,0.000083362385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072659664,0.00025161362,0.0011547712,0.000107275584,0.000011894347,0.00016892758,0.00021768881,0.42173845,0.000037258935,0.11272573,0.00095032353,0.4626288],"study_design_scores_gemma":[0.00025786654,0.00016084759,0.00023708494,0.00035176863,0.0000065011773,0.0000062035856,3.892018e-8,0.982888,0.0005356947,0.010337212,0.004672432,0.0005463843],"about_ca_topic_score_codex":0.000029764858,"about_ca_topic_score_gemma":0.00006533443,"teacher_disagreement_score":0.7285131,"about_ca_system_score_codex":0.0002544579,"about_ca_system_score_gemma":0.00038455852,"threshold_uncertainty_score":0.99976796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047465164,0.00038404347,0.99341434,0.0002764911,0.00082176964,0.00031984216,0.000008666796,0.0002407694,0.00405944],"genre_scores_gemma":[0.7875769,0.0000145338645,0.21055065,0.00040659262,0.00026428956,0.0000064144465,0.000015838337,0.00004550745,0.0011192311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963953,0.000033551027,0.00046617154,0.0015763725,0.0008404848,0.00068811973],"domain_scores_gemma":[0.99803793,0.00028350917,0.00027799245,0.0010830758,0.00014936883,0.00016813178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057253585,0.000582174,0.00057018193,0.0005367389,0.00028318737,0.0009240472,0.0022833084,0.00026165167,0.0000031587563],"category_scores_gemma":[0.00001621387,0.00048727306,0.00006926239,0.0004672995,0.00057763996,0.00044051075,0.0013371686,0.00063972024,0.000017922932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011460125,0.000026835129,0.00014817345,0.000080220016,0.000022487475,0.00026882495,0.00058043684,0.6568174,0.000034412515,0.007838852,0.000063126696,0.3341078],"study_design_scores_gemma":[0.00035035706,0.00029408242,0.0003141226,0.0005989683,0.0000070210313,0.000327847,1.4582425e-7,0.9866634,0.000018722898,0.009113888,0.0016130242,0.00069843145],"about_ca_topic_score_codex":0.0000638136,"about_ca_topic_score_gemma":0.00018486145,"teacher_disagreement_score":0.7871023,"about_ca_system_score_codex":0.0002139768,"about_ca_system_score_gemma":0.00031978253,"threshold_uncertainty_score":0.9997579},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.8075948e-7,0.00001183885,0.79282695,0.001019617,0.00018302198,0.19941482,0.000008945571,0.00027307172,0.0062614284],"genre_scores_gemma":[0.006153894,4.3063613e-7,0.6518209,0.0010274618,0.00024188301,0.3401992,0.000008409383,0.00006734347,0.00048048547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99497455,0.000040024963,0.00080936955,0.0020543137,0.0011374295,0.0009843366],"domain_scores_gemma":[0.99631745,0.00040542625,0.0006351314,0.0018861702,0.0005487878,0.00020702058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010810127,0.00066502515,0.0005777227,0.0008732577,0.00044055714,0.0010071672,0.004418502,0.00034186654,0.000018550249],"category_scores_gemma":[0.00014318789,0.00060686254,0.00018880132,0.00079567934,0.000642639,0.0013473765,0.001483181,0.00077706063,0.000019881885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010895027,0.000090966925,0.000023295815,0.00024058438,0.000008699978,0.000024369334,0.0002797765,0.003964662,0.00009897934,0.778203,0.00004795452,0.21700677],"study_design_scores_gemma":[0.000750891,0.00013457958,0.0000140711045,0.00038214703,0.0000029473947,0.000027187061,6.5808884e-8,0.20937261,0.0013553025,0.71796435,0.06933362,0.000662227],"about_ca_topic_score_codex":0.000004730226,"about_ca_topic_score_gemma":0.000039618382,"teacher_disagreement_score":0.21634455,"about_ca_system_score_codex":0.0005189183,"about_ca_system_score_gemma":0.0011033729,"threshold_uncertainty_score":0.99963826},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26302946,0.00006882207,0.7365576,0.000046450077,0.000057313377,0.00021137559,0.0000022539414,0.000022328042,0.0000043673963],"genre_scores_gemma":[0.89537215,0.0000064855803,0.104534775,0.00005515184,0.000016784965,0.0000026061057,0.000008961791,0.00000304399,4.088194e-8],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921715,0.000012164516,0.00024092544,0.00021645443,0.00016439368,0.000148904],"domain_scores_gemma":[0.9995736,0.00010376478,0.00004514529,0.00018425727,0.000054767974,0.00003845989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004228981,0.00008406785,0.00009355552,0.000098130455,0.000038105074,0.000029182782,0.00010587216,0.00006470229,8.32193e-7],"category_scores_gemma":[0.00007791513,0.000078916695,0.000012517903,0.00067294313,0.00009005106,0.000121466066,0.000021486378,0.0000770138,2.0316357e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028958666,0.000032024032,0.087655075,0.000022423763,6.450164e-7,6.244739e-7,0.00022818404,0.8896498,0.0006741667,0.000042801286,6.8309055e-7,0.021690695],"study_design_scores_gemma":[0.00020061608,0.0000142084145,0.24495493,0.00001753781,8.9489123e-7,0.0000014166523,0.0000023633286,0.74985826,0.0039196755,0.0009650913,0.000004944222,0.000060057057],"about_ca_topic_score_codex":0.000099009274,"about_ca_topic_score_gemma":0.0013615661,"teacher_disagreement_score":0.6323427,"about_ca_system_score_codex":0.00020116559,"about_ca_system_score_gemma":0.000023381326,"threshold_uncertainty_score":0.32181293},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27086234,0.000009063299,0.7270844,0.00042722074,0.0013223498,0.00014754916,5.3457575e-7,0.00013146596,0.000015086787],"genre_scores_gemma":[0.7442513,0.0000059222652,0.25542423,0.00010924808,0.00018713246,0.000010443601,0.000002372843,0.000008868594,4.919973e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895525,0.000011704722,0.00027735502,0.0003146933,0.00017552676,0.00026548927],"domain_scores_gemma":[0.9990562,0.00034097105,0.000037445763,0.00041041663,0.0000681095,0.00008685269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004512114,0.000112140304,0.00012464095,0.000116488976,0.00009347451,0.00016193869,0.0004361882,0.0000733849,0.000009034759],"category_scores_gemma":[0.00023506854,0.000100770565,0.000033950993,0.00084925455,0.00018830958,0.00017292368,0.00008655552,0.000361261,0.00003495738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.323753e-7,0.000025247211,0.007842828,0.0000075595826,0.0000021699038,0.0000021056567,0.00016255394,0.8942822,0.012076314,0.00015899836,0.000033599194,0.08540584],"study_design_scores_gemma":[0.00013146404,0.000012660323,0.013992475,0.000012027914,0.0000028369666,0.000018358187,1.7117088e-7,0.9701774,0.010652275,0.004743375,0.000115317045,0.00014163945],"about_ca_topic_score_codex":0.00000801167,"about_ca_topic_score_gemma":0.00001110239,"teacher_disagreement_score":0.47338897,"about_ca_system_score_codex":0.000024117542,"about_ca_system_score_gemma":0.000060428465,"threshold_uncertainty_score":0.41093045},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015415325,0.000096295065,0.9815249,0.0004013942,0.0017585488,0.00045771987,0.0000022405059,0.00022236166,0.013995025],"genre_scores_gemma":[0.66102606,0.000012322746,0.31917486,0.0145825725,0.004362599,0.000043113465,0.00009423226,0.00013450636,0.0005697238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966038,0.000024816136,0.0007998806,0.0011255841,0.0008862941,0.0005596511],"domain_scores_gemma":[0.99767935,0.00021762529,0.0007932187,0.00091851037,0.0003373679,0.000053947573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014543523,0.00046213722,0.00048641526,0.0008917272,0.00046650658,0.0007237243,0.0010044513,0.00017906586,0.0003063908],"category_scores_gemma":[0.00039948078,0.00042477666,0.00011897891,0.00055261765,0.00044898133,0.0017777185,0.0003270639,0.00041115622,0.00005211227],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003993953,0.00010244509,0.0044196635,0.00035951872,0.000025261077,0.001525653,0.0036791544,0.015629848,0.0015428327,0.0034922764,0.0009424096,0.968241],"study_design_scores_gemma":[0.002191872,0.00024474924,0.0032088335,0.0026305546,0.000079043944,0.00073674653,0.00008412092,0.68630975,0.0053808866,0.02283683,0.27153423,0.0047623795],"about_ca_topic_score_codex":0.0002529523,"about_ca_topic_score_gemma":0.00015753617,"teacher_disagreement_score":0.9634786,"about_ca_system_score_codex":0.00017755719,"about_ca_system_score_gemma":0.000257109,"threshold_uncertainty_score":0.9998204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008144914,0.00018843407,0.9931766,0.00015607502,0.00025908314,0.00040375805,0.00000878916,0.00003232185,0.004960469],"genre_scores_gemma":[0.7317557,0.000016878183,0.26187783,0.0027989498,0.0010250694,0.000030163123,0.0005634455,0.000096796226,0.0018352102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982317,0.000022495113,0.00036226283,0.000590546,0.00045759734,0.00033538716],"domain_scores_gemma":[0.99886435,0.0000213226,0.00023626524,0.00064674736,0.00016264328,0.00006866452],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003603285,0.0003266261,0.00021318995,0.00022038445,0.00012205194,0.00011311722,0.00067916815,0.00037677345,0.000022667378],"category_scores_gemma":[0.00009497926,0.00030318485,0.00007956082,0.00014355266,0.00050761446,0.000007971291,0.00020547095,0.0003577175,0.000016556207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019043537,0.000029651912,0.0005733887,0.0001408006,0.00001005611,0.000019140258,0.00004305025,0.925106,0.0117790885,0.0010354596,0.00016262638,0.06108171],"study_design_scores_gemma":[0.0006326899,0.0006339639,0.0001612913,0.000624668,0.00001663363,0.000035585494,8.915704e-8,0.81540006,0.13795125,0.013951744,0.0293164,0.0012755945],"about_ca_topic_score_codex":0.000029233099,"about_ca_topic_score_gemma":0.000082477156,"teacher_disagreement_score":0.73129874,"about_ca_system_score_codex":0.00011149188,"about_ca_system_score_gemma":0.00043763182,"threshold_uncertainty_score":0.999942},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.227289e-7,0.00028588247,0.9951584,0.0004034382,0.00076960196,0.00076309044,0.000014346057,0.00038952203,0.002215133],"genre_scores_gemma":[0.0030549755,0.00007422481,0.99430746,0.0015814091,0.0003843635,0.00002110106,0.00002536558,0.000047576286,0.00050351146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965017,0.000014864976,0.00058668567,0.0014022292,0.0007177088,0.00077680225],"domain_scores_gemma":[0.9977312,0.00045327473,0.00033555776,0.00096581667,0.00033278737,0.0001813622],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010494497,0.00052411837,0.0005529114,0.000809405,0.00026108188,0.000378532,0.0023672779,0.0003232672,0.000031858657],"category_scores_gemma":[0.0001657898,0.0004896868,0.00017581132,0.000583735,0.00039208823,0.0009119102,0.00063656946,0.0005831384,0.000008078733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015186166,0.000016110804,0.0000030788688,0.00003131565,0.0000068900495,0.00004373548,0.0005111095,0.06279641,0.00004149719,0.011473749,0.000024453191,0.9250365],"study_design_scores_gemma":[0.00039292866,0.0005111051,0.000007870616,0.00020801964,0.000008962535,0.00008232351,1.9708098e-7,0.91261935,0.0021651054,0.077214025,0.0060425936,0.0007474899],"about_ca_topic_score_codex":0.0000043199493,"about_ca_topic_score_gemma":0.000018104833,"teacher_disagreement_score":0.924289,"about_ca_system_score_codex":0.00025021573,"about_ca_system_score_gemma":0.0004518067,"threshold_uncertainty_score":0.9997555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012923247,0.00035771052,0.99645257,0.000102953396,0.001375172,0.00040308514,0.00024247583,0.00019938365,0.000853744],"genre_scores_gemma":[0.11115064,0.00009404665,0.88665193,0.0004232394,0.0007856447,0.000017950442,0.00042889593,0.00012553913,0.0003221011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998042,0.0000050220046,0.0003609338,0.0007376711,0.0004044307,0.0004499395],"domain_scores_gemma":[0.9986231,0.0002355946,0.00009888548,0.00083792605,0.00013146798,0.000073042276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003555431,0.00041049972,0.0004170458,0.0003722956,0.00013688221,0.00026317142,0.0012036378,0.00029290144,0.000011678613],"category_scores_gemma":[0.000039633615,0.00038857837,0.000072826086,0.00014656755,0.0001534319,0.00029336804,0.0001871664,0.00036784445,0.000005462934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032866185,0.0000054001894,0.00000594184,0.00015503571,0.000012471032,0.000004810535,0.00002328627,0.89042175,0.000009886053,0.00025696956,0.00034631783,0.10875482],"study_design_scores_gemma":[0.000345256,0.000031144962,0.000032778746,0.00016481295,0.000026608357,0.000006685671,1.8766771e-8,0.981369,0.00045526167,0.012501353,0.0046201777,0.0004469049],"about_ca_topic_score_codex":0.000009075278,"about_ca_topic_score_gemma":0.00007351183,"teacher_disagreement_score":0.11113772,"about_ca_system_score_codex":0.00008427142,"about_ca_system_score_gemma":0.00008786241,"threshold_uncertainty_score":0.9998566},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019287378,0.0012170793,0.97745544,0.0003511787,0.0004163321,0.0005987423,0.000007840233,0.000014758586,0.0006512701],"genre_scores_gemma":[0.22545725,0.00082849304,0.76741904,0.001359308,0.003311699,0.00009516102,0.00006312113,0.000089454305,0.0013765026],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99853617,0.0000098019755,0.00019669594,0.00083349267,0.00018120451,0.00024266279],"domain_scores_gemma":[0.9992003,0.00000890855,0.000084544656,0.00047897224,0.00013150217,0.00009580518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016449412,0.00024402773,0.00017706711,0.00017382519,0.00008223954,0.00007500771,0.00034852975,0.00021309008,0.000024318259],"category_scores_gemma":[0.00001454501,0.00024239086,0.000030727282,0.000128084,0.0002428458,0.0000048158945,0.0003212502,0.000118542746,0.00001892399],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055502856,0.000004340411,0.00012154485,0.000010894816,0.000007473328,8.340507e-7,0.000024973962,0.00201481,0.15612856,0.00002068258,0.0000037875125,0.84165657],"study_design_scores_gemma":[0.0024541123,0.0024906301,0.009729883,0.00062406744,0.00013212403,0.0012157102,0.0000022818926,0.044824284,0.640045,0.023452403,0.26922572,0.0058037825],"about_ca_topic_score_codex":0.0000042681286,"about_ca_topic_score_gemma":0.000053079675,"teacher_disagreement_score":0.8358528,"about_ca_system_score_codex":0.00004239626,"about_ca_system_score_gemma":0.00010685333,"threshold_uncertainty_score":0.9884412},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000089916386,0.00084545487,0.9907029,0.0041677607,0.0013891474,0.00041481634,0.0000137214765,0.00021247048,0.0021637727],"genre_scores_gemma":[0.115387514,0.00025948483,0.87795985,0.0027164326,0.0016671486,0.000016259077,0.000013936041,0.0000627957,0.0019165868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951402,0.00003942006,0.0004987544,0.0020799867,0.0012836378,0.0009580301],"domain_scores_gemma":[0.99727833,0.00034658908,0.00028181987,0.0014800413,0.00026539672,0.00034784185],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007459827,0.000778555,0.0006805797,0.0008797436,0.0005715665,0.0017456426,0.0027737718,0.00040738218,0.000037141854],"category_scores_gemma":[0.00003994551,0.00071994506,0.00015722984,0.000676453,0.0019465331,0.00104857,0.0021209377,0.001247225,0.000020159207],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026961234,0.000025588972,0.000019171164,0.000030842082,0.000012412256,0.00008086767,0.0005607199,0.0029872702,0.00001954018,0.049211603,0.000024880368,0.9470244],"study_design_scores_gemma":[0.00038662148,0.00028197316,0.00013572643,0.00021521118,0.000012048933,0.00031412364,0.0000010120932,0.86715335,0.0011440882,0.117030844,0.012286173,0.0010388301],"about_ca_topic_score_codex":0.00004446621,"about_ca_topic_score_gemma":0.00029073944,"teacher_disagreement_score":0.94598556,"about_ca_system_score_codex":0.00035631092,"about_ca_system_score_gemma":0.0006275115,"threshold_uncertainty_score":0.9995252},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065039834,0.00015310518,0.9892693,0.0005894544,0.0003189712,0.0006169829,0.0000025015634,0.00019628069,0.0023493925],"genre_scores_gemma":[0.57011414,0.000053413507,0.42801797,0.0013762782,0.0001240644,0.000016472437,0.000002720182,0.00002931306,0.00026560135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658775,0.00005156124,0.0005955698,0.0014219203,0.00063450396,0.00070870743],"domain_scores_gemma":[0.9985614,0.00019696106,0.000057254107,0.00082660414,0.000066097804,0.00029169078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007996211,0.0004918265,0.0005565318,0.0016471129,0.00034598514,0.000471621,0.0017825629,0.00023532851,0.000004991122],"category_scores_gemma":[0.00005490922,0.00050181954,0.00006255059,0.00087849353,0.0002495622,0.00040480925,0.0011016901,0.0005968922,0.00002054745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001083232,0.00004174143,0.00070703414,0.000021519298,0.000009049161,0.000035979065,0.005196985,0.9081089,0.00086106226,0.0019412269,0.00000795934,0.08305775],"study_design_scores_gemma":[0.0005461465,0.00027054283,0.011232154,0.0008551556,0.000009055229,0.00006923729,0.000001079158,0.9658693,0.014360329,0.004262445,0.0010250027,0.0014995461],"about_ca_topic_score_codex":0.00014656255,"about_ca_topic_score_gemma":0.00053136516,"teacher_disagreement_score":0.56361014,"about_ca_system_score_codex":0.00038449845,"about_ca_system_score_gemma":0.00010522126,"threshold_uncertainty_score":0.99974334},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022513587,0.00008188918,0.975563,0.00033978937,0.0010298102,0.00019413907,0.000006902146,0.00011145691,0.00015943516],"genre_scores_gemma":[0.9751242,0.000010955976,0.024060093,0.0004777464,0.0001762845,0.0000030056412,0.000011330707,0.000022628277,0.00011377572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971822,0.00004696529,0.00047672,0.0010630704,0.0008488204,0.0003822085],"domain_scores_gemma":[0.9980655,0.00049540115,0.0003837219,0.00080609083,0.00013931168,0.00011002041],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008045127,0.00039992802,0.00047365666,0.00064670126,0.00020478808,0.0004653347,0.0013282842,0.00023981117,0.00000925982],"category_scores_gemma":[0.00009018111,0.00035607864,0.00013887402,0.00021760851,0.00032664335,0.0005465539,0.00057590945,0.0011783818,0.000003043864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027748612,0.00008930865,0.008242906,0.00014580393,0.00001541261,0.00012324323,0.00082716614,0.2514839,0.00079936953,0.0032149802,0.0000026406228,0.73502755],"study_design_scores_gemma":[0.0002910137,0.00041869143,0.0009969558,0.00085444166,0.000007306951,0.000024218865,2.292871e-7,0.9912792,0.0018577882,0.0037472302,0.00010890738,0.00041404576],"about_ca_topic_score_codex":0.000103880266,"about_ca_topic_score_gemma":0.00022603375,"teacher_disagreement_score":0.9526106,"about_ca_system_score_codex":0.00008776648,"about_ca_system_score_gemma":0.00029197126,"threshold_uncertainty_score":0.99988914},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017106293,0.0029204611,0.9868912,0.000044779754,0.006235779,0.001847467,0.0000037280495,0.0001743805,0.00017158223],"genre_scores_gemma":[0.9206539,0.00013916455,0.07525168,0.00013680539,0.0021983513,0.00017162866,0.000004741401,0.000078071425,0.0013656633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608,0.00015372476,0.00068483327,0.0014759841,0.0008552755,0.0007502251],"domain_scores_gemma":[0.99773884,0.0003677006,0.00034322726,0.0010312893,0.00025591737,0.00026300168],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032813626,0.0005690156,0.0005654299,0.0006828215,0.0006877423,0.001076511,0.0016378196,0.00018038446,0.000004883433],"category_scores_gemma":[0.000057081998,0.00052449334,0.00009623091,0.00025955512,0.00018762558,0.001129015,0.0011654416,0.0006826371,0.000017514265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001376604,0.0002914013,0.0009113401,0.00018484819,0.00008570922,0.000039697123,0.044424724,0.031850774,0.00016510875,0.09261629,0.00000878069,0.8294076],"study_design_scores_gemma":[0.0021396736,0.0059487247,0.00097274675,0.007960516,0.0001539129,0.00027260307,0.00069933746,0.8421342,0.0016455348,0.019021457,0.11279791,0.0062534083],"about_ca_topic_score_codex":0.000029515211,"about_ca_topic_score_gemma":0.00003322923,"teacher_disagreement_score":0.9189433,"about_ca_system_score_codex":0.00051059196,"about_ca_system_score_gemma":0.00018538846,"threshold_uncertainty_score":0.9999605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039162856,0.00023223758,0.9883235,0.00019094818,0.0025980843,0.00026404194,0.000006011807,0.0001650412,0.007828494],"genre_scores_gemma":[0.063895516,0.000031848253,0.9325408,0.0022467475,0.0008804853,0.0000038085075,0.000021885528,0.00004018992,0.0003387315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960369,0.000074405296,0.00056402595,0.0012522668,0.0013371771,0.000735253],"domain_scores_gemma":[0.99726754,0.0008418028,0.00058122445,0.0008624367,0.0003177654,0.00012921524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029266137,0.0004421083,0.00042932105,0.00087504985,0.0003586881,0.00051159126,0.0017952119,0.00046575963,0.000019332345],"category_scores_gemma":[0.00020848286,0.0004062708,0.00011473475,0.0008530583,0.00019000728,0.00083815394,0.00074137916,0.0006220936,0.000023957005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012391419,0.00003059736,0.00038876256,0.000025681564,0.000028309501,0.00012972947,0.0030383482,0.04375358,0.0000514553,0.067033485,0.000053198575,0.8854545],"study_design_scores_gemma":[0.00027626823,0.000104080864,0.00017082905,0.00023634812,0.000013698749,0.00004784253,9.62462e-7,0.8844973,0.00020216306,0.11180152,0.0019973246,0.0006516498],"about_ca_topic_score_codex":0.000020769545,"about_ca_topic_score_gemma":0.000037926045,"teacher_disagreement_score":0.8848028,"about_ca_system_score_codex":0.0010977054,"about_ca_system_score_gemma":0.00035504592,"threshold_uncertainty_score":0.9998389},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19274782,0.00003783684,0.8068085,0.000100244586,0.00003253788,0.00018256676,6.8431893e-7,0.000081100094,0.000008773004],"genre_scores_gemma":[0.686484,0.000008964181,0.3132041,0.00021014878,0.0000735382,0.000008399968,0.0000018552057,0.000008469179,5.036182e-7],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917835,0.000022104787,0.000113156384,0.0003242583,0.00015915517,0.00020294687],"domain_scores_gemma":[0.99965656,0.00003443746,0.00006245676,0.00016198338,0.00003850574,0.00004603991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000846554,0.0001223149,0.000110396504,0.00010191442,0.00021737382,0.000070923335,0.00012630472,0.000021076148,0.0000045584216],"category_scores_gemma":[0.0000015178668,0.0000957585,0.0000105987765,0.00055520417,0.00022131299,0.00048079193,0.000028325352,0.00010978832,1.7273025e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025048199,0.0000816214,0.6238125,0.00001095048,0.00001229399,0.000008812598,0.007153196,0.16367203,0.0063632093,0.00048707175,0.0000018883703,0.1983714],"study_design_scores_gemma":[0.0004450931,0.00018340793,0.0125934575,0.00004464873,0.0000019951856,0.000024264531,0.0000017049824,0.92700696,0.05638661,0.0030097992,0.000063190295,0.0002388709],"about_ca_topic_score_codex":0.000038906102,"about_ca_topic_score_gemma":0.000005162658,"teacher_disagreement_score":0.76333493,"about_ca_system_score_codex":0.00003448664,"about_ca_system_score_gemma":0.00007496426,"threshold_uncertainty_score":0.39049184},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000112368354,0.0001247755,0.99787426,0.000084725165,0.00035221796,0.00022135998,0.000010404992,0.000102072285,0.0011178213],"genre_scores_gemma":[0.20958805,0.000027216034,0.7899492,0.00031052693,0.00007300367,0.0000035905532,0.0000049430955,0.000034360946,0.000009143148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982808,0.000009099372,0.00048209002,0.0003279479,0.0006447064,0.00025531513],"domain_scores_gemma":[0.99846756,0.0008722658,0.00016833819,0.00033368322,0.00010309556,0.000055027176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029587114,0.00031758373,0.000374833,0.0003367341,0.000057618145,0.000035966048,0.00047839797,0.00016874383,0.000012343625],"category_scores_gemma":[0.000113735216,0.00029255293,0.000074099145,0.0001917923,0.00015845466,0.00030175477,0.000105220606,0.0005091766,0.0000067331744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027971316,0.000007796572,3.4248035e-7,0.00014950396,0.0000055080873,0.0000018586504,0.0002734926,0.9148756,0.00015227425,0.0059315455,0.0000012363149,0.07859804],"study_design_scores_gemma":[0.000066386085,0.00004440836,0.0000012064526,0.00037127765,0.0000036797915,0.0000011888974,1.12144384e-7,0.58756024,0.0038925558,0.40787694,0.00002136289,0.00016068331],"about_ca_topic_score_codex":6.03895e-7,"about_ca_topic_score_gemma":0.0000010195647,"teacher_disagreement_score":0.40194538,"about_ca_system_score_codex":0.0003484475,"about_ca_system_score_gemma":0.00007181989,"threshold_uncertainty_score":0.9999527},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007766258,0.00043919595,0.99409986,0.00029147678,0.00088760175,0.0003304593,0.000003244951,0.00022612479,0.0036444045],"genre_scores_gemma":[0.16820855,0.00019441439,0.82675296,0.002650984,0.0015000222,0.00004114106,0.000013987251,0.00006752552,0.0005704307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975089,0.000013445701,0.00033551702,0.0011315341,0.0005610949,0.0004495195],"domain_scores_gemma":[0.99820036,0.000425262,0.00017341773,0.0009050932,0.00012472573,0.00017113991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072671205,0.00033320865,0.000289866,0.00074470567,0.00027801198,0.0005140025,0.0014996355,0.0002748127,0.000010172771],"category_scores_gemma":[0.000049615457,0.00032571823,0.000056589717,0.0005981316,0.00040211048,0.00046053264,0.0008133445,0.00060737925,0.000047222853],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030274489,0.000013492388,0.00008020747,0.000037549737,0.0000071408085,0.000027286069,0.00043572404,0.0018122902,0.00044101843,0.012413249,0.000013597314,0.9847154],"study_design_scores_gemma":[0.00052320206,0.00031147298,0.001016324,0.0005181213,0.000017580205,0.00030062924,3.1264528e-7,0.7249407,0.0038643265,0.23064673,0.036157433,0.0017031302],"about_ca_topic_score_codex":0.00003130627,"about_ca_topic_score_gemma":0.00009080983,"teacher_disagreement_score":0.98301226,"about_ca_system_score_codex":0.00014723312,"about_ca_system_score_gemma":0.00014839903,"threshold_uncertainty_score":0.9999195},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007863241,0.000107740976,0.9886905,0.00018702041,0.0013550178,0.00081493537,0.0000069116936,0.00092115067,0.0000534622],"genre_scores_gemma":[0.4268817,0.0000066691023,0.5723964,0.0004928536,0.00006255589,0.00014678508,0.0000011506187,0.000009191659,0.0000027279946],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971262,0.000088484296,0.00045140253,0.0010210945,0.00062583096,0.00068698835],"domain_scores_gemma":[0.9980932,0.00038679596,0.00019514146,0.0008041334,0.0003145369,0.00020620834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010428842,0.00026030804,0.00028279156,0.000382976,0.00024597367,0.00033720332,0.0022270193,0.000021077436,0.000016170938],"category_scores_gemma":[0.00029127573,0.00021530344,0.00006777318,0.0019687025,0.00043701203,0.00086822396,0.00037494898,0.00020389946,0.000010518201],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025091464,0.00023487948,0.00545945,0.0003286923,0.000026111546,0.00054717436,0.006601331,0.001273561,0.040165737,0.0010105124,0.00033650245,0.94399095],"study_design_scores_gemma":[0.0005886821,0.00016517467,0.0014797538,0.0002954661,0.000007732432,0.0014628936,0.0000033059687,0.4461989,0.5460431,0.00322438,0.000029240084,0.0005013626],"about_ca_topic_score_codex":0.00043647576,"about_ca_topic_score_gemma":0.0000427456,"teacher_disagreement_score":0.9434896,"about_ca_system_score_codex":0.00028798444,"about_ca_system_score_gemma":0.00036015938,"threshold_uncertainty_score":0.87798196},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009548567,0.00093939283,0.98144394,0.0003986936,0.003745762,0.00091093127,0.0000048959787,0.00025355368,0.012207314],"genre_scores_gemma":[0.032612722,0.000046282,0.9582755,0.006370013,0.0020653652,0.000025508554,0.0000058197516,0.000083496954,0.00051531347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99465156,0.000023920216,0.00059431104,0.0021724647,0.0012189568,0.0013388202],"domain_scores_gemma":[0.9969043,0.00027192014,0.00029414313,0.001633449,0.00043292978,0.00046326467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014190675,0.00076443603,0.0006902761,0.0013429695,0.00041775507,0.0007045963,0.004145436,0.0005085782,0.000029824958],"category_scores_gemma":[0.000087784996,0.0006747226,0.00018813426,0.0012183831,0.00048279305,0.00082257885,0.002421241,0.0008878542,0.00016919863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070674023,0.0000829286,0.00015019636,0.00009517475,0.000020862992,0.0002525874,0.007872305,0.008864063,0.00025517485,0.045749232,0.000076041746,0.93657434],"study_design_scores_gemma":[0.00075162423,0.00090320926,0.0006047894,0.0020438132,0.00003302593,0.0004725677,7.295209e-7,0.7641626,0.0020872082,0.19309731,0.03240405,0.0034390858],"about_ca_topic_score_codex":0.00009212459,"about_ca_topic_score_gemma":0.00039645945,"teacher_disagreement_score":0.9331353,"about_ca_system_score_codex":0.0005213178,"about_ca_system_score_gemma":0.0004854238,"threshold_uncertainty_score":0.99957037},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002907154,0.004379895,0.9827253,0.00005289383,0.0018500112,0.00047901087,0.000010605288,0.0003113516,0.0072837467],"genre_scores_gemma":[0.98974544,0.00023535569,0.008984888,0.0002556124,0.0004705703,0.00002110688,0.000011269155,0.000080424805,0.00019533615],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827117,0.000013863255,0.00027032816,0.0005488248,0.0004695449,0.00042627822],"domain_scores_gemma":[0.9988391,0.00019947684,0.00007873268,0.000687052,0.00007100464,0.00012462975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043098064,0.00040867305,0.00042982106,0.0005928142,0.00010280477,0.00011257837,0.00086535973,0.00029245397,0.000025423355],"category_scores_gemma":[0.000023816296,0.0003312421,0.00007756334,0.00061695284,0.00042047154,0.00016069648,0.000110984554,0.0009739995,0.000037913844],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029102557,0.000064509135,0.0007401646,0.0018139856,0.00016445924,0.00038474056,0.0015662778,0.17995664,0.0021810303,0.022333274,0.00012240079,0.7906434],"study_design_scores_gemma":[0.0018012722,0.001191809,0.0022001232,0.012353759,0.00020932315,0.0010014353,0.0000017308282,0.379266,0.028009793,0.53012174,0.036425017,0.007417982],"about_ca_topic_score_codex":0.0000094882735,"about_ca_topic_score_gemma":0.000090377434,"teacher_disagreement_score":0.9868383,"about_ca_system_score_codex":0.000072769304,"about_ca_system_score_gemma":0.00006231503,"threshold_uncertainty_score":0.999914},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029433984,0.00029302802,0.9810138,0.0030295542,0.0010695584,0.00023911727,0.0000024202686,0.00020732984,0.014115779],"genre_scores_gemma":[0.14859238,0.000015918135,0.8410719,0.008733926,0.0008988645,0.000008364286,0.00000795109,0.000033940873,0.00063672994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996431,0.00002856898,0.0004948872,0.0014913854,0.0009896284,0.0005645433],"domain_scores_gemma":[0.99775475,0.00034974713,0.0003374631,0.0011700395,0.00022709559,0.00016087868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065387716,0.0004299799,0.00042579186,0.00066441303,0.00027234555,0.00072176935,0.002474827,0.0002583278,0.00007829152],"category_scores_gemma":[0.00008646252,0.00040178013,0.00012243292,0.0005775061,0.00084516755,0.00071135024,0.00056935055,0.0006286163,0.000066746434],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021253202,0.000015020436,0.000024696725,0.000021583633,0.000004116259,0.000052219115,0.00025693257,0.027366292,0.00016309705,0.011527508,0.00006078787,0.9605056],"study_design_scores_gemma":[0.00045268046,0.00009029092,0.00009564445,0.00055476814,0.000009445361,0.000073146875,1.6721584e-7,0.8950734,0.006864149,0.090717115,0.005202179,0.00086699316],"about_ca_topic_score_codex":0.000010566879,"about_ca_topic_score_gemma":0.000026109314,"teacher_disagreement_score":0.95963866,"about_ca_system_score_codex":0.00023230717,"about_ca_system_score_gemma":0.0009827919,"threshold_uncertainty_score":0.9998434},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027727732,0.00012072922,0.9809924,0.0053822207,0.004419715,0.00078013365,0.0000011639733,0.00030046573,0.007725923],"genre_scores_gemma":[0.70431495,0.000042225212,0.27808136,0.010628054,0.003546294,0.00017177901,0.0000035927299,0.00015435922,0.0030574088],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601257,0.00007472531,0.00061450555,0.001463969,0.00093716773,0.00089706626],"domain_scores_gemma":[0.9959499,0.00077452813,0.0005257429,0.0020215807,0.00065482524,0.00007342571],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002215798,0.0005455238,0.00035209022,0.00083835784,0.001491755,0.0011061323,0.007308807,0.0003162296,0.00000907615],"category_scores_gemma":[0.00029619609,0.00033482336,0.00011375339,0.0012589603,0.00095873163,0.00063960504,0.0028558355,0.0018512226,0.00016239929],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009478973,0.00002085441,0.00008777661,0.000010718458,0.000027411194,0.00004227075,0.004173292,0.0011557743,0.00020039729,0.1721485,0.00019423685,0.8219293],"study_design_scores_gemma":[0.0006882441,0.0018004433,0.0014667714,0.0020497735,0.000052110896,0.0011267022,0.00001786188,0.2639118,0.013007245,0.5714681,0.14083481,0.0035761378],"about_ca_topic_score_codex":0.000032471107,"about_ca_topic_score_gemma":0.0003465787,"teacher_disagreement_score":0.8183532,"about_ca_system_score_codex":0.00045315962,"about_ca_system_score_gemma":0.00041824116,"threshold_uncertainty_score":0.9999308},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059897728,0.00035226427,0.9948022,0.0015138662,0.001045853,0.0010362379,0.000018135483,0.00031169903,0.000859845],"genre_scores_gemma":[0.54025406,0.000013068583,0.45483342,0.004120853,0.0005588933,0.00006158208,0.000006851688,0.000035463716,0.00011582239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955128,0.000035555702,0.00076642644,0.001951787,0.0008976659,0.0008357694],"domain_scores_gemma":[0.9958835,0.0011188752,0.00054184644,0.0017498828,0.00049440045,0.00021145272],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008835713,0.0006246802,0.0006520273,0.00080790505,0.00043658828,0.0012934279,0.00704379,0.00036465607,0.000013554207],"category_scores_gemma":[0.0001893678,0.0006222374,0.00027036382,0.00045866857,0.0004283179,0.0010387629,0.0009753786,0.0006397041,0.000016611577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024534516,0.00005272249,0.000012915613,0.000046622263,0.000011851646,0.0000031325574,0.0008129952,0.60500324,0.00021485743,0.012062941,0.000019104415,0.3817351],"study_design_scores_gemma":[0.0008087071,0.00008704094,0.000014931223,0.00027481743,0.000010776922,0.00000604698,6.5667216e-8,0.90014136,0.0032422068,0.09375183,0.0010529879,0.0006092203],"about_ca_topic_score_codex":0.00000672296,"about_ca_topic_score_gemma":0.000021166128,"teacher_disagreement_score":0.54019415,"about_ca_system_score_codex":0.0003811381,"about_ca_system_score_gemma":0.0011894684,"threshold_uncertainty_score":0.99974334},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042581823,0.00033629593,0.9972581,0.0000553772,0.0007124306,0.00043588996,0.000005849856,0.00021287163,0.0005573192],"genre_scores_gemma":[0.38151234,0.00014922004,0.61760277,0.0005410717,0.00006826052,0.0000032246646,0.000025341811,0.000052266278,0.00004552812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963674,0.00008141177,0.00087726174,0.0012165364,0.0010093397,0.00044803956],"domain_scores_gemma":[0.9971101,0.00026456767,0.0007404167,0.0010907251,0.00068366615,0.0001105088],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000937625,0.000504769,0.00061045267,0.0015429495,0.00024042068,0.00037806804,0.001908061,0.00033020086,0.000020077396],"category_scores_gemma":[0.000047569305,0.00051519787,0.00013484115,0.0014835274,0.0004952438,0.0006365278,0.0006986317,0.00030776853,0.0000026956598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008517872,0.0001633837,0.0010286507,0.00029419168,0.000050104474,0.00002577942,0.0015059239,0.17940971,0.00429879,0.5239402,0.000039696046,0.28923506],"study_design_scores_gemma":[0.00013867309,0.00011706239,0.00014293872,0.00029497402,0.0000096051845,0.00002357252,8.513464e-8,0.9058261,0.002694007,0.08981246,0.00045726792,0.00048326256],"about_ca_topic_score_codex":0.000028431768,"about_ca_topic_score_gemma":0.000031658063,"teacher_disagreement_score":0.7264164,"about_ca_system_score_codex":0.00024061147,"about_ca_system_score_gemma":0.00034565385,"threshold_uncertainty_score":0.99973},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009624788,0.00016232856,0.9962733,0.00093893515,0.00055393646,0.0014121347,0.000028477963,0.0002390647,0.00029562015],"genre_scores_gemma":[0.010119238,0.000010225188,0.98490965,0.003692867,0.00018955301,0.00007863892,0.000028489794,0.000047091373,0.00092425715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957809,0.0000962598,0.0006197866,0.0016419595,0.0012107377,0.0006503743],"domain_scores_gemma":[0.99731064,0.00065396127,0.00046736182,0.0009976579,0.00034437305,0.0002260116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013244476,0.0005832266,0.0005251784,0.00063705683,0.00027121275,0.0005660611,0.002334219,0.00029088292,0.00001898128],"category_scores_gemma":[0.000026095939,0.00049045106,0.00012491478,0.0004631549,0.00047518034,0.0008043943,0.00046987628,0.00062043575,0.000009624183],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026171827,0.000028694767,0.0000068005047,0.00009679704,0.000009929763,0.000017548304,0.0012764244,0.0164117,0.001213068,0.00017086948,0.00012485535,0.98061717],"study_design_scores_gemma":[0.0009979822,0.0005903641,0.000036288693,0.00020221478,0.000022390048,0.00009021813,0.0000012238046,0.92662865,0.06364312,0.0067325733,0.00024977778,0.0008052006],"about_ca_topic_score_codex":0.0000122838155,"about_ca_topic_score_gemma":0.00009948643,"teacher_disagreement_score":0.97981197,"about_ca_system_score_codex":0.00049538375,"about_ca_system_score_gemma":0.00048536007,"threshold_uncertainty_score":0.9997547},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007982509,0.001826584,0.9940625,0.0002513874,0.0015363763,0.00043780883,0.0000032050493,0.00089373265,0.00090859784],"genre_scores_gemma":[0.044613972,0.00020023566,0.95310473,0.00019728029,0.0017187144,0.000021957965,0.000006148864,0.0001032484,0.00003372876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973562,0.0000028346003,0.00046269374,0.0008553209,0.00038940692,0.00093355],"domain_scores_gemma":[0.998303,0.0007565918,0.000068727175,0.00064327975,0.00009716941,0.00013123815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003523081,0.0005460217,0.000547241,0.00033626292,0.00016943226,0.00018349,0.0011577269,0.0006649941,0.0000082523275],"category_scores_gemma":[0.0001309418,0.0005295725,0.0001279833,0.0003049853,0.00044281202,0.00025112153,0.0004086541,0.0014818942,0.000010274303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018094742,0.000002594588,0.0000016431958,0.000015786285,0.0000063479415,0.0000076237066,0.000012321012,0.5516755,0.000023093318,0.0034091729,0.0000024828694,0.44484162],"study_design_scores_gemma":[0.00015801947,0.00005795664,0.0000045817847,0.00033419376,0.000011708054,0.000019969644,1.8972622e-7,0.9354239,0.00018267454,0.062058296,0.0011819717,0.00056651334],"about_ca_topic_score_codex":6.55573e-7,"about_ca_topic_score_gemma":0.000014946317,"teacher_disagreement_score":0.4442751,"about_ca_system_score_codex":0.0003690186,"about_ca_system_score_gemma":0.000053652475,"threshold_uncertainty_score":0.99971557},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015525746,0.00032457875,0.99330825,0.00037274402,0.0033587927,0.00053494284,0.000011200582,0.00015620388,0.0003807421],"genre_scores_gemma":[0.698026,0.000058208872,0.29007676,0.009674046,0.0011724347,0.00002782437,0.00001253674,0.00013683536,0.0008153553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960688,0.000051456638,0.00054901885,0.0017021223,0.0007952518,0.00083336857],"domain_scores_gemma":[0.9973289,0.0005203024,0.0003273378,0.0013993593,0.00025103285,0.00017307307],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009862493,0.000591384,0.0006017241,0.0008621826,0.0004737043,0.0014956287,0.0039405804,0.00030003724,0.000008579321],"category_scores_gemma":[0.00009254371,0.0005615897,0.00022347133,0.00037423,0.00022349741,0.0012415966,0.0013295563,0.0007569426,0.0000068286486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025630552,0.00012226013,0.0025123362,0.00049806834,0.00010403765,0.00037665086,0.0011848959,0.44123432,0.0018547596,0.034173038,0.00018831652,0.5177257],"study_design_scores_gemma":[0.00037691245,0.000105774525,0.00008555537,0.0009068061,0.000026308142,0.00015469168,2.1009527e-7,0.9570315,0.0006857519,0.038696557,0.0009108335,0.0010191301],"about_ca_topic_score_codex":0.00020328519,"about_ca_topic_score_gemma":0.00020797065,"teacher_disagreement_score":0.70323145,"about_ca_system_score_codex":0.00036065676,"about_ca_system_score_gemma":0.00041945357,"threshold_uncertainty_score":0.99968356},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063073196,0.0004217118,0.9919589,0.00085273257,0.0025694189,0.0006615536,0.000002032129,0.0002530461,0.0032175225],"genre_scores_gemma":[0.33408618,0.000045790162,0.65751183,0.0064176484,0.0014848682,0.000023301322,0.000007199965,0.000065204826,0.0003580005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948536,0.000038875616,0.00082491024,0.0020171078,0.00096259586,0.0013029182],"domain_scores_gemma":[0.9969398,0.0008821605,0.00028564144,0.0013514891,0.00020016792,0.00034077914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017568077,0.00068389776,0.00077037193,0.0009507045,0.00024699347,0.00057466945,0.0037777745,0.0005161494,0.00002264206],"category_scores_gemma":[0.000088988316,0.0006580004,0.00014419657,0.0013608711,0.00035090075,0.00045193985,0.0013419226,0.0014543636,0.000047223282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102088225,0.0000120975155,0.000057262285,0.000004611085,0.000004245486,0.00014166917,0.0002631515,0.5594041,9.159805e-7,0.014091027,0.000031687527,0.42597908],"study_design_scores_gemma":[0.00047575706,0.00013710158,0.00012719349,0.0006417985,0.000005604303,0.00006817761,3.11139e-7,0.98906547,0.0000062035283,0.007966088,0.0007766814,0.0007296305],"about_ca_topic_score_codex":0.000047255067,"about_ca_topic_score_gemma":0.00045637818,"teacher_disagreement_score":0.4296614,"about_ca_system_score_codex":0.0004474542,"about_ca_system_score_gemma":0.00044730236,"threshold_uncertainty_score":0.9995871},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005639021,0.00049726205,0.9928874,0.0015233881,0.00034449427,0.00051264645,0.000010681914,0.00015332057,0.003506934],"genre_scores_gemma":[0.8523154,0.00020160095,0.14630067,0.00072190305,0.00022082916,0.000023212955,0.000012533039,0.000025605237,0.00017822719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603397,0.00015946131,0.0007832258,0.0013444066,0.0011340261,0.0005449147],"domain_scores_gemma":[0.9959664,0.0015787712,0.0006653437,0.0014911811,0.00020841816,0.00008988541],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019528174,0.00044920368,0.00062282296,0.00065893074,0.0001945907,0.00041040784,0.004842696,0.00030614756,0.000005668793],"category_scores_gemma":[0.0002767608,0.00034533575,0.0000655842,0.0010312021,0.0017837859,0.0008218718,0.0011517002,0.0012928537,0.0000046536325],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012184805,0.00006357348,0.008930239,0.0001352172,0.000021854848,0.00011179909,0.008680022,0.010254674,0.0007009912,0.1925872,0.00014030433,0.778362],"study_design_scores_gemma":[0.0009465923,0.0008693442,0.0113456,0.0021261722,0.000026906599,0.0002369398,0.000012526892,0.5598142,0.012931085,0.39670905,0.012973373,0.0020081995],"about_ca_topic_score_codex":0.000043556327,"about_ca_topic_score_gemma":0.000059061495,"teacher_disagreement_score":0.8517515,"about_ca_system_score_codex":0.00013138664,"about_ca_system_score_gemma":0.0003587101,"threshold_uncertainty_score":0.99989986},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009955224,0.00017434548,0.9939669,0.0009884008,0.002193306,0.0004722162,0.000002974985,0.00021965733,0.0009866981],"genre_scores_gemma":[0.7903652,0.000019697893,0.20694433,0.0017539313,0.000564447,0.0000066374178,0.000009464844,0.00004984081,0.00028642465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532664,0.000070466966,0.00084911287,0.0015922888,0.001419052,0.00074245455],"domain_scores_gemma":[0.99675006,0.00034791144,0.0004235796,0.0018269282,0.0003657212,0.00028579892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017948195,0.0005030138,0.0005275398,0.0014509029,0.00031290995,0.00068216457,0.0032879028,0.00046658964,0.000026637545],"category_scores_gemma":[0.0001053506,0.0004822334,0.00019659042,0.0010958152,0.00065993296,0.00060849544,0.00088433136,0.00080981804,0.00011103809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022280754,0.00026819663,0.0009558336,0.00020009268,0.00007361551,0.00018366372,0.028162522,0.0008134737,0.0014495323,0.4043028,0.00005215112,0.56351584],"study_design_scores_gemma":[0.00025532467,0.00006267791,0.0004777322,0.00031442582,0.000013506312,0.000094654395,3.1023066e-7,0.82460576,0.00047390108,0.17112008,0.0019389294,0.0006427163],"about_ca_topic_score_codex":0.000032908836,"about_ca_topic_score_gemma":0.00009245168,"teacher_disagreement_score":0.8237923,"about_ca_system_score_codex":0.0003222094,"about_ca_system_score_gemma":0.00040096277,"threshold_uncertainty_score":0.99976295},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010178206,0.00034257007,0.9932287,0.0015032038,0.0005811454,0.0002379594,0.0000025526856,0.00004309294,0.0030430031],"genre_scores_gemma":[0.8451791,0.000110063,0.15086389,0.002650054,0.00021471435,0.000010218076,0.00000467426,0.000022772449,0.00094451284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797225,0.000034683217,0.0003365522,0.0007256638,0.00066939846,0.0002614349],"domain_scores_gemma":[0.9978399,0.0010321006,0.00021652842,0.0006649505,0.00017305269,0.000073439944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058015593,0.00026812707,0.00026171474,0.0005833593,0.00026854174,0.00024150184,0.0011497922,0.00012285198,0.000024233397],"category_scores_gemma":[0.00011736349,0.00020122969,0.00007542964,0.0006188717,0.00045965213,0.00026163703,0.0004461648,0.0004088413,0.00000908254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021756348,0.000017737304,0.000012919723,0.000013655065,0.000009941249,0.000008858551,0.0005543005,0.06997497,0.00023238815,0.68813974,0.00009517505,0.24093813],"study_design_scores_gemma":[0.00011251493,0.00015511143,0.00023107558,0.0001617247,0.000005473642,0.00002731382,1.1571088e-7,0.57386875,0.0014574656,0.42331085,0.00042445995,0.0002451297],"about_ca_topic_score_codex":0.0000062139698,"about_ca_topic_score_gemma":0.0000064594856,"teacher_disagreement_score":0.8441613,"about_ca_system_score_codex":0.000046611338,"about_ca_system_score_gemma":0.00014703901,"threshold_uncertainty_score":0.82059085},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007548177,0.0008612782,0.9919651,0.00029347246,0.0021764773,0.00053261407,0.0000026027785,0.00014711107,0.003266527],"genre_scores_gemma":[0.5762305,0.00008017016,0.42040694,0.002292459,0.00041827234,0.00005682906,0.0000052171195,0.00003389759,0.00047567338],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693006,0.000081519276,0.00049785146,0.0012614802,0.00036052777,0.00086854753],"domain_scores_gemma":[0.99716264,0.0016076037,0.00020224758,0.00077928376,0.00015232677,0.000095896656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014347214,0.0004531291,0.00054600183,0.0006911943,0.00024818894,0.00032400253,0.0021318882,0.00040907343,0.000013206726],"category_scores_gemma":[0.00038741148,0.00037450148,0.00014969628,0.00036783036,0.00073267607,0.0008984025,0.0007203475,0.00056965044,0.0000133759895],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016892624,0.000043242555,0.00012804467,0.000042229494,0.000005520848,0.00004934313,0.0007093506,0.0021889217,0.00008889689,0.11328663,0.000039818762,0.8834011],"study_design_scores_gemma":[0.0011680468,0.00064446306,0.0008248476,0.00083275035,0.000016243777,0.00023304018,0.0000042671936,0.3768412,0.0060879793,0.60703456,0.0049595013,0.0013531317],"about_ca_topic_score_codex":0.0000070828723,"about_ca_topic_score_gemma":0.00012728332,"teacher_disagreement_score":0.88204795,"about_ca_system_score_codex":0.00029158246,"about_ca_system_score_gemma":0.00036640352,"threshold_uncertainty_score":0.9998707},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001232484,0.0015900403,0.9941473,0.00015457303,0.00088374823,0.00084318075,0.000010512109,0.00012951491,0.0021178802],"genre_scores_gemma":[0.8291616,0.000026029684,0.1705165,0.00008053067,0.00013125337,0.00003809051,0.0000089678015,0.000018794812,0.000018267147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946642,0.00029853437,0.0008862305,0.0010666657,0.002739914,0.00034447553],"domain_scores_gemma":[0.9963712,0.00036566556,0.0006825601,0.0010724092,0.0014084444,0.000099719124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006977336,0.0003748932,0.000597185,0.001140976,0.00006493386,0.00019109827,0.0019037031,0.00035452945,0.000006436964],"category_scores_gemma":[0.00017122175,0.00033505345,0.000095510055,0.0007460348,0.00019445806,0.0010373022,0.00044958945,0.0003749556,0.000001861866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012321682,0.00008990885,0.00020295836,0.00008326057,0.000014884523,0.000005268946,0.0040676757,0.5029333,0.00014028547,0.022551142,0.000032735752,0.46986625],"study_design_scores_gemma":[0.0002970296,0.00011660437,0.000077745346,0.00031720605,0.000005958447,0.0000020460827,5.6610816e-7,0.74109197,0.0011107381,0.2566681,0.00005508426,0.00025694576],"about_ca_topic_score_codex":0.00036425237,"about_ca_topic_score_gemma":0.00014800357,"teacher_disagreement_score":0.8290383,"about_ca_system_score_codex":0.0012036865,"about_ca_system_score_gemma":0.0020599817,"threshold_uncertainty_score":0.9999102},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01881972,0.00060202036,0.95821685,0.00032206636,0.00040880308,0.00037362557,0.000012218925,0.00004996327,0.021194763],"genre_scores_gemma":[0.9851369,0.000073399184,0.013581383,0.00047057433,0.00013708284,0.000011531936,0.0000024584858,0.000019876334,0.00056677544],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957803,0.00010053849,0.0007258073,0.0015406734,0.0013608455,0.00049182255],"domain_scores_gemma":[0.99521357,0.0031834692,0.00028393505,0.00091197237,0.00026082958,0.0001462258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029746047,0.0003814628,0.0006289708,0.0011468685,0.0003339582,0.00036780257,0.0020610376,0.0002326305,0.00011242382],"category_scores_gemma":[0.0006094573,0.00031092716,0.000081501275,0.0011343533,0.002335498,0.00031062655,0.0008388639,0.0006428772,0.00008063549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015832618,0.000048249432,0.0023582089,0.000010243542,0.0000034148843,0.00009101952,0.0029977444,0.022863576,0.00014968324,0.06297425,0.000009123886,0.9084787],"study_design_scores_gemma":[0.0006665079,0.0001581723,0.011147221,0.0006667826,0.0000075079593,0.0002524942,0.0000153801,0.10679886,0.0012671949,0.8677506,0.010125167,0.0011441027],"about_ca_topic_score_codex":0.000017728536,"about_ca_topic_score_gemma":0.00011107662,"teacher_disagreement_score":0.9663172,"about_ca_system_score_codex":0.00010606731,"about_ca_system_score_gemma":0.00033599997,"threshold_uncertainty_score":0.99993426},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032812243,0.00051067927,0.9973763,0.00020803389,0.00084005523,0.0004284422,0.000121501,0.00007961895,0.0001072253],"genre_scores_gemma":[0.01732436,0.000015938242,0.98189145,0.00023189986,0.00035955763,0.000009878456,0.00011285928,0.000024143037,0.00002990615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963956,0.0000381655,0.00058476423,0.0015980698,0.0008288447,0.0005545488],"domain_scores_gemma":[0.99432003,0.0004146443,0.00048213216,0.0044184737,0.00022264887,0.00014205514],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011312319,0.00039351522,0.000395754,0.00027117014,0.00039710934,0.0005814163,0.00940549,0.00016281521,0.000013735787],"category_scores_gemma":[0.0001080123,0.00028795243,0.000058666737,0.0009566916,0.0007021741,0.0010402813,0.0044841436,0.0004680099,0.000010168086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.074712e-7,0.000045841083,0.000009077717,0.000018755902,0.000007151658,0.0000040714876,0.00044854436,0.029554754,0.00010830114,0.0008834482,0.000037059384,0.9688821],"study_design_scores_gemma":[0.00009871529,0.000067893154,0.00006821056,0.00022466946,0.000015187696,0.000020516905,0.0000010264906,0.99664104,0.00023553355,0.0019475089,0.00034411307,0.00033561446],"about_ca_topic_score_codex":0.00011547983,"about_ca_topic_score_gemma":0.000018823923,"teacher_disagreement_score":0.96854645,"about_ca_system_score_codex":0.00014113063,"about_ca_system_score_gemma":0.00051987753,"threshold_uncertainty_score":0.99995726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000902802,0.00029433193,0.9945552,0.0010063661,0.001388932,0.0007285395,0.000021924294,0.00018989609,0.001805802],"genre_scores_gemma":[0.10070975,0.000028772185,0.89457977,0.0029325313,0.00045217498,0.000052862557,0.00002116602,0.000047383943,0.0011755859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949606,0.000038687445,0.0006980876,0.0021008926,0.001296712,0.0009050081],"domain_scores_gemma":[0.996252,0.00097518245,0.00035316014,0.0013824932,0.0006421632,0.00039499684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010085197,0.0006854682,0.0006312577,0.0006563341,0.00032939302,0.000818042,0.0037728366,0.0005508302,0.00005270548],"category_scores_gemma":[0.00044065434,0.00066069985,0.00017987649,0.0005886091,0.0005755426,0.0007744297,0.00069562095,0.0010250084,0.000057185927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009046208,0.00003344496,0.000016548229,0.000071421804,0.000014312623,0.000031777312,0.00032248604,0.04833454,0.00007559559,0.5832927,0.00021697847,0.36758113],"study_design_scores_gemma":[0.0002614449,0.00018175397,0.00001956878,0.00025711666,0.000008233446,0.000057318885,5.4327774e-8,0.32873747,0.00028131195,0.6685756,0.0010213515,0.0005987855],"about_ca_topic_score_codex":0.000031295014,"about_ca_topic_score_gemma":0.000068476635,"teacher_disagreement_score":0.36698234,"about_ca_system_score_codex":0.00034676868,"about_ca_system_score_gemma":0.002846356,"threshold_uncertainty_score":0.99958444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4889046,0.000017679104,0.5106131,0.00029243872,0.000030817308,0.00008710494,2.3546392e-7,0.000014529868,0.000039508697],"genre_scores_gemma":[0.73206264,0.0000010685029,0.26713505,0.0007100702,0.00008337762,0.0000016340057,0.0000028879845,0.0000030178057,2.5046575e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985574,0.00005711931,0.00020206138,0.0004807844,0.0003836302,0.0003190027],"domain_scores_gemma":[0.99945307,0.00006311149,0.000054718806,0.00021289423,0.00009988075,0.00011633947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042505364,0.00013511752,0.00023156425,0.00041539787,0.00007334707,0.00010049029,0.00020405685,0.00005117443,0.000005149336],"category_scores_gemma":[0.00006987416,0.00011024889,0.000046922483,0.0016758437,0.0002632667,0.00029883967,0.000029641222,0.0003007355,9.075141e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013321408,0.00060648023,0.067776345,0.00002196989,0.000010572229,0.00012410177,0.0030032017,0.079358935,0.18123631,0.000033259814,0.0000012794814,0.66769433],"study_design_scores_gemma":[0.000534985,0.00030822458,0.099419825,0.00011487039,0.00002068469,0.0001192125,0.000022676582,0.82761985,0.07087477,0.0008118618,4.817409e-7,0.00015258738],"about_ca_topic_score_codex":0.000072231785,"about_ca_topic_score_gemma":0.000010484926,"teacher_disagreement_score":0.7482609,"about_ca_system_score_codex":0.000107839405,"about_ca_system_score_gemma":0.00010521936,"threshold_uncertainty_score":0.44958192},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049513816,0.00024801109,0.9944858,0.0008952843,0.0014980416,0.00058840617,0.0000036051133,0.00043182974,0.0017995121],"genre_scores_gemma":[0.037836462,0.00015030548,0.9590201,0.0013190582,0.0007350573,0.00005245453,0.00001645748,0.000045365818,0.00082475354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964787,0.000069317466,0.0005670677,0.0015615762,0.000851463,0.0004718868],"domain_scores_gemma":[0.9975762,0.00035982204,0.00033781317,0.0012297387,0.00033225835,0.00016418847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011609781,0.00044757794,0.0004963838,0.00094071124,0.000283098,0.0008836118,0.0018282416,0.00030890058,0.000017396318],"category_scores_gemma":[0.00015743764,0.00043075377,0.00008969916,0.0005649436,0.0006553494,0.00069462374,0.0010546212,0.000601701,0.00004597063],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016451439,0.000012916504,0.000021067888,0.000058905236,0.0000067869296,0.00002070031,0.00041969123,0.00016648357,0.000064326516,0.01799416,0.00007236674,0.98116094],"study_design_scores_gemma":[0.00025963597,0.0001106774,0.00014667887,0.0006179111,0.000012412228,0.0001687551,3.198657e-7,0.5322589,0.0040533356,0.46013728,0.0015160757,0.0007179762],"about_ca_topic_score_codex":0.00002383257,"about_ca_topic_score_gemma":0.000023123175,"teacher_disagreement_score":0.980443,"about_ca_system_score_codex":0.00014268911,"about_ca_system_score_gemma":0.00019958132,"threshold_uncertainty_score":0.99981445},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016914321,0.0001468375,0.99468696,0.001267275,0.0020667096,0.00032489415,0.0000025997938,0.00006585237,0.0012696987],"genre_scores_gemma":[0.85362154,0.000007490661,0.14564233,0.00036832123,0.00016457599,0.0000039299152,7.817297e-7,0.000022345335,0.00016869586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970626,0.000048986778,0.0005208772,0.00084745535,0.0010690743,0.0004509574],"domain_scores_gemma":[0.9964048,0.0011115575,0.0005468486,0.0016060685,0.00026807332,0.00006263444],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007704958,0.00038740563,0.00033766657,0.00021269824,0.0006363734,0.00039436878,0.0063638566,0.00020199644,0.0000036992558],"category_scores_gemma":[0.0005385769,0.00022830913,0.00015947757,0.0005563485,0.0013448857,0.00051198574,0.0023814072,0.0011116053,0.000003705675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028042784,0.0000028397237,0.000056521636,0.000011393587,0.000003679076,0.0000023351884,0.00084726047,0.7669385,0.00003306325,0.05824994,0.0000011153879,0.17385055],"study_design_scores_gemma":[0.00010361806,0.000028990786,0.00015958305,0.00019392508,0.000004804337,0.000013593997,1.8791688e-7,0.6909234,0.00024368174,0.30813086,0.000014487907,0.00018286708],"about_ca_topic_score_codex":0.00002718605,"about_ca_topic_score_gemma":0.00007572742,"teacher_disagreement_score":0.8534524,"about_ca_system_score_codex":0.00034488874,"about_ca_system_score_gemma":0.0008960749,"threshold_uncertainty_score":0.9990122},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017496284,0.000038851227,0.86315006,0.0005069305,0.00023118402,0.13529657,0.000007991501,0.00033592765,0.00043074615],"genre_scores_gemma":[0.0007254631,0.00000692188,0.9448367,0.0010662538,0.0003292467,0.052787434,0.000013144239,0.000045083216,0.00018975894],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99528235,0.00006298453,0.0006850016,0.002260792,0.0009065622,0.00080232794],"domain_scores_gemma":[0.9960347,0.0006075206,0.00066072657,0.0017264964,0.00067507237,0.0002955181],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009271804,0.00070066476,0.00063790084,0.00039098397,0.00034784086,0.0006223253,0.0027772752,0.00039502044,0.000029194438],"category_scores_gemma":[0.00011825021,0.0006036602,0.00017611917,0.00066299085,0.0003091475,0.0013107366,0.0005484897,0.00085557427,0.00001698725],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007812596,0.00007787434,0.0000076185706,0.00009488491,0.000013270346,0.00001232144,0.0005910744,0.008624976,0.0000075468997,0.005409022,0.0000139891545,0.9850693],"study_design_scores_gemma":[0.0013074904,0.0011008008,0.00006727667,0.0006113513,0.000015157775,0.000045727673,1.3017974e-7,0.27507806,0.00049490697,0.71481836,0.005622939,0.00083782536],"about_ca_topic_score_codex":0.0000035225764,"about_ca_topic_score_gemma":0.00007400886,"teacher_disagreement_score":0.9842315,"about_ca_system_score_codex":0.0005782219,"about_ca_system_score_gemma":0.0012708016,"threshold_uncertainty_score":0.9996415},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010920343,0.0001620767,0.9967847,0.00027914468,0.00015846433,0.0008853627,0.00001675513,0.000076603836,0.0005448836],"genre_scores_gemma":[0.20611666,0.0000074329705,0.79352474,0.00014662003,0.00011420344,0.000047551213,0.000015119838,0.000016281258,0.0000113687765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752223,0.00001598287,0.00055031024,0.0010035913,0.000592875,0.00031498555],"domain_scores_gemma":[0.99839526,0.00024448018,0.0002993655,0.000736859,0.00018963682,0.00013440997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009859793,0.0002821317,0.0003126203,0.0006565006,0.00017268045,0.00021806442,0.0010729725,0.0001756223,0.0000019810739],"category_scores_gemma":[0.00005100776,0.00028283973,0.000042369906,0.0007609495,0.0001959402,0.00048383305,0.00026426863,0.00024211148,0.000003671127],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026674506,0.000014294685,0.0000123044665,0.00003588416,0.000003896808,0.0000027186288,0.0023271588,0.0029950994,0.0065142266,0.03178366,9.3372745e-7,0.9563072],"study_design_scores_gemma":[0.00026325803,0.00022846238,0.00028848997,0.0006471448,0.000011042951,0.000021789938,0.0000030187803,0.9394461,0.016759308,0.041091036,0.0006414617,0.0005988777],"about_ca_topic_score_codex":0.00006632753,"about_ca_topic_score_gemma":0.00009633382,"teacher_disagreement_score":0.95570827,"about_ca_system_score_codex":0.00013469624,"about_ca_system_score_gemma":0.000231389,"threshold_uncertainty_score":0.9999624},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06957772,0.000033081345,0.929243,0.000543696,0.0001055737,0.00040596744,0.0000015901542,0.0000642688,0.000025075504],"genre_scores_gemma":[0.4963589,0.0000022070808,0.50348586,0.00009519522,0.000046973513,0.0000043207688,0.0000028115267,0.000003428234,3.283805e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991914,0.00001224283,0.00016161056,0.0003027696,0.00017485097,0.00015714634],"domain_scores_gemma":[0.99935496,0.00006906567,0.000060895723,0.00026788795,0.00018424084,0.00006293134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022554913,0.00007541342,0.00014462436,0.00014736729,0.00007840124,0.000014366246,0.00011823765,0.00003707922,3.2806875e-7],"category_scores_gemma":[0.000100392455,0.000064310545,0.000029058303,0.00050058495,0.00026888333,0.000097062584,0.00007214881,0.00010479406,1.7969096e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100743404,0.00016383747,0.005081636,0.00008606569,0.000002857502,0.0000017806069,0.0007792068,0.07937158,0.13281253,0.00037311058,0.00005311045,0.7811735],"study_design_scores_gemma":[0.00040906816,0.00012740225,0.00064114085,0.000060574803,0.000005377388,0.00011100563,0.000002323608,0.94146234,0.050093707,0.0069460035,0.000077449884,0.000063601336],"about_ca_topic_score_codex":0.000020106912,"about_ca_topic_score_gemma":0.0000016186482,"teacher_disagreement_score":0.86209077,"about_ca_system_score_codex":0.00006670786,"about_ca_system_score_gemma":0.00007778562,"threshold_uncertainty_score":0.2622508},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5696609,0.000050324124,0.42927822,0.000048117814,0.0006918405,0.00012849257,0.0000040630207,0.00007686399,0.00006118111],"genre_scores_gemma":[0.8767677,0.0000015249803,0.12283699,0.00022921783,0.0001322742,0.000010190954,0.000009029385,0.0000115564935,0.0000014959123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981783,0.00006308266,0.00021888169,0.0007170358,0.0003704695,0.0004522106],"domain_scores_gemma":[0.9986082,0.00029198447,0.00008304164,0.00089095475,0.000035146768,0.00009070637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028399462,0.00017146606,0.00017992417,0.00020665702,0.00033381986,0.0000610311,0.001129308,0.00011340975,0.00010859161],"category_scores_gemma":[0.000058057954,0.00013193324,0.000017260198,0.0008276274,0.0004065308,0.00024110504,0.0003147485,0.00030109202,0.000033963563],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035767553,0.00016391135,0.044311564,0.0000028650445,0.000008815036,0.004444406,0.009379934,0.003309722,0.0011512252,0.000009999014,0.000089246656,0.93709254],"study_design_scores_gemma":[0.008503427,0.0023239045,0.3112461,0.0036460645,0.00018634234,0.027508728,0.00012749148,0.623776,0.018311424,0.00017696807,0.00028836937,0.0039051769],"about_ca_topic_score_codex":0.000040825933,"about_ca_topic_score_gemma":0.00006466882,"teacher_disagreement_score":0.93318737,"about_ca_system_score_codex":0.000048727998,"about_ca_system_score_gemma":0.00008759928,"threshold_uncertainty_score":0.5380081},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021596083,0.00033383258,0.9940969,0.0002469051,0.0025367197,0.0006122494,0.000047356523,0.00014707234,0.0017630572],"genre_scores_gemma":[0.04725106,0.000049950293,0.94901824,0.0016693873,0.0012961134,0.00006894389,0.00023674662,0.0000841562,0.00032538708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588853,0.000036894424,0.0006744577,0.0017428674,0.0008587719,0.0007984982],"domain_scores_gemma":[0.9969018,0.0009864757,0.00034314475,0.001438334,0.00019357268,0.00013666408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074457854,0.00057338295,0.0006142653,0.00082094077,0.0002542869,0.00046331747,0.0034452076,0.0003482358,0.000012155272],"category_scores_gemma":[0.00008908231,0.00053146115,0.00013440264,0.00051994674,0.00032151322,0.00085192523,0.0017164552,0.000717643,0.000012083575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034478406,0.000073736905,0.00013636013,0.00016571642,0.000010335969,0.0000852598,0.00049029855,0.057575636,0.00016577201,0.0021105614,0.00046043837,0.9386914],"study_design_scores_gemma":[0.0012245787,0.00023143181,0.0005861967,0.000886361,0.000007164083,0.00001697501,4.3872805e-7,0.9770101,0.00078698486,0.017011818,0.0013753234,0.0008626295],"about_ca_topic_score_codex":0.00021429165,"about_ca_topic_score_gemma":0.00032554005,"teacher_disagreement_score":0.9378288,"about_ca_system_score_codex":0.00047729406,"about_ca_system_score_gemma":0.0005807054,"threshold_uncertainty_score":0.9997137},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019572437,0.00001780229,0.9961522,0.001725494,0.00060812413,0.0008273039,0.00003168126,0.000015331683,0.00042630854],"genre_scores_gemma":[0.3417678,0.0000010123642,0.6549366,0.0010307417,0.0009163885,0.0004988521,0.000038448357,0.000041211748,0.0007689514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987766,0.000015848842,0.00028927778,0.0005036254,0.00015266043,0.00026198576],"domain_scores_gemma":[0.9977209,0.0015227223,0.00014420257,0.0003963993,0.00017141509,0.00004438492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005489489,0.00020941116,0.00021767699,0.0001620892,0.00022106363,0.00016496365,0.00050440157,0.00011086452,0.00019591897],"category_scores_gemma":[0.00003710242,0.00014973602,0.00013191103,0.00012348813,0.00015517866,0.0000482328,0.00015532167,0.00047493575,0.000019306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026641426,0.0001023981,0.000038016376,0.000018497072,0.00003180795,5.222981e-7,0.0005055286,0.21671829,0.0017596869,0.0077200523,0.00013410948,0.77294445],"study_design_scores_gemma":[0.00021434498,0.000043461667,0.000019728734,0.000050515475,0.000020030027,0.0000014555623,0.0000012179607,0.9347798,0.010432439,0.0495129,0.00471657,0.00020752958],"about_ca_topic_score_codex":0.00005273226,"about_ca_topic_score_gemma":0.0000143923735,"teacher_disagreement_score":0.7727369,"about_ca_system_score_codex":0.00005047434,"about_ca_system_score_gemma":0.00010188735,"threshold_uncertainty_score":0.6106057},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003131607,0.002003223,0.994282,0.00043398965,0.0009930708,0.00040783544,0.0000018312267,0.00028766133,0.0012772192],"genre_scores_gemma":[0.25230312,0.000097150834,0.7461687,0.0005828709,0.0007139313,0.000007544564,0.0000010242898,0.000039633425,0.000086051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957422,0.000085518484,0.0005719233,0.0018219395,0.0009047646,0.0008736406],"domain_scores_gemma":[0.99773407,0.0005119471,0.00033437565,0.001028552,0.00020275555,0.00018827105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021497814,0.00062181643,0.00070129987,0.00068574084,0.00041531766,0.0008256951,0.0020240098,0.00032781693,0.000003926764],"category_scores_gemma":[0.00009373029,0.00057792844,0.00014304454,0.00059924484,0.0006055429,0.0010175977,0.001011389,0.0012091302,0.00001868126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054838697,0.000014119166,0.00009466904,0.00003625088,0.000011971239,0.00007917852,0.0012397831,0.01203504,0.000052598807,0.0077995723,5.519685e-7,0.9786308],"study_design_scores_gemma":[0.0010090383,0.00059397245,0.0019125311,0.0032483197,0.000029054969,0.0006517179,0.0000018513642,0.62177587,0.0021142098,0.35975572,0.0060030306,0.0029046976],"about_ca_topic_score_codex":0.000034633624,"about_ca_topic_score_gemma":0.00012797018,"teacher_disagreement_score":0.97572607,"about_ca_system_score_codex":0.00019079576,"about_ca_system_score_gemma":0.00034021563,"threshold_uncertainty_score":0.9996672},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010852618,0.000776932,0.98921776,0.00021175014,0.0010361188,0.00020523899,0.0000040216046,0.000059962284,0.008379686],"genre_scores_gemma":[0.25053662,0.00004088393,0.74859583,0.00048647248,0.00023064368,0.0000018922317,0.0000040773325,0.000017643635,0.00008591605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971182,0.000019187988,0.0006155814,0.0009810837,0.0008092898,0.0004566896],"domain_scores_gemma":[0.99831486,0.00033591644,0.00033853526,0.0007232772,0.00015821318,0.00012919382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007847137,0.0003522367,0.0005720847,0.00054916623,0.0001595286,0.0002229645,0.0016856454,0.00025302757,0.000015978652],"category_scores_gemma":[0.000027983628,0.00031663867,0.00009905936,0.00034835044,0.0007779231,0.00035024653,0.0012660912,0.00052198354,0.000008243484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008679801,0.000048916994,0.0007559843,0.000086695305,0.000014016156,0.000041016396,0.000989637,0.028694153,0.00003895117,0.040674135,0.000019920257,0.9286279],"study_design_scores_gemma":[0.0002678249,0.00021022762,0.000694445,0.0002839116,0.0000064068763,0.000057652673,3.046755e-7,0.94027406,0.0002445095,0.056112032,0.0014377309,0.0004108881],"about_ca_topic_score_codex":0.000019724903,"about_ca_topic_score_gemma":0.00007554959,"teacher_disagreement_score":0.928217,"about_ca_system_score_codex":0.00009894623,"about_ca_system_score_gemma":0.00017491222,"threshold_uncertainty_score":0.9999286},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009600901,0.00017017427,0.98099864,0.0015485635,0.00066994864,0.0003808536,0.0000028310924,0.000052236748,0.016167147],"genre_scores_gemma":[0.03792384,0.00009911874,0.9571382,0.0032838213,0.00019680084,0.000009334483,0.0000025392046,0.000033839984,0.0013125312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997047,0.000050379,0.00045415462,0.000888545,0.0010836136,0.00047628398],"domain_scores_gemma":[0.9965068,0.0016319668,0.0003236971,0.0011330344,0.00031227374,0.00009220904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018677477,0.00031647118,0.00034099043,0.00059947406,0.00023620708,0.00020052135,0.0028524948,0.00018120006,0.00003598791],"category_scores_gemma":[0.0002054981,0.00021876406,0.000106733525,0.0008020201,0.0008919111,0.00041227735,0.00079778844,0.000870894,0.000030484152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041228236,0.000019409625,0.000005948901,0.000012644562,0.000007516541,0.000023903567,0.0011226373,0.04558287,0.000019238229,0.55748254,0.00002803995,0.3956911],"study_design_scores_gemma":[0.00015564694,0.00014665889,0.000024139223,0.00039190162,0.0000021530939,0.000011315108,1.5332117e-7,0.6511449,0.001017272,0.34605187,0.000783739,0.00027021117],"about_ca_topic_score_codex":0.000011688802,"about_ca_topic_score_gemma":0.000013586622,"teacher_disagreement_score":0.6055621,"about_ca_system_score_codex":0.00015198425,"about_ca_system_score_gemma":0.00031532912,"threshold_uncertainty_score":0.892094},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021738777,0.00015146422,0.99068224,0.00019568553,0.0013903216,0.00117936,0.0000019023769,0.00052961154,0.0058476804],"genre_scores_gemma":[0.008714026,0.000004433212,0.98865175,0.0021987145,0.0002690337,0.000043368458,0.0000052816704,0.00004152818,0.00007187549],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941595,0.0000500102,0.00077044015,0.0022201887,0.0018164087,0.0009834296],"domain_scores_gemma":[0.99620366,0.00052272395,0.00036551664,0.0021731597,0.00040587207,0.0003290557],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0032710638,0.0006495951,0.0005609357,0.0017670381,0.00033118305,0.00083954603,0.005460748,0.00047689117,0.0000045626584],"category_scores_gemma":[0.00073583063,0.0005681606,0.00014564928,0.0017172932,0.00052419904,0.0006564613,0.0012861878,0.0008337501,0.000071143004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013053638,0.0000662315,0.000009641233,0.00007248795,0.0000032111504,0.000017167285,0.0002962111,0.05588372,0.000032225373,0.05245678,0.000014447173,0.8911348],"study_design_scores_gemma":[0.00026561643,0.0003339841,0.00017804553,0.0005274965,0.000006742396,0.00007732405,1.9910654e-7,0.92088044,0.0017592384,0.071361795,0.0037242072,0.00088493177],"about_ca_topic_score_codex":0.000008844737,"about_ca_topic_score_gemma":0.000018945097,"teacher_disagreement_score":0.8902499,"about_ca_system_score_codex":0.00052676414,"about_ca_system_score_gemma":0.00086258806,"threshold_uncertainty_score":0.9999202},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013222924,0.00015633857,0.9947058,0.0012226729,0.0012820639,0.00079598615,0.000022472537,0.000072701034,0.0016097684],"genre_scores_gemma":[0.7727684,0.000033227396,0.22573476,0.0011381807,0.00009228429,0.00002858067,0.000040894494,0.000026829906,0.0001368627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972963,0.000106516934,0.0006685555,0.0009222953,0.0005820193,0.00042432547],"domain_scores_gemma":[0.9971168,0.00043207698,0.00059982995,0.0014600382,0.00026074052,0.00013050299],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011387225,0.00034661524,0.0005235434,0.000661306,0.00039660948,0.00019099507,0.0020224834,0.0003248418,0.000016290422],"category_scores_gemma":[0.0000770102,0.00034135475,0.00014866718,0.0003040095,0.0005317837,0.0006501019,0.00025532642,0.00032845454,0.0000040647287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001679786,0.00013418475,0.0000650529,0.00018864816,0.0000512672,0.000008088025,0.0044494406,0.029471422,0.0011740789,0.9293795,0.00018021566,0.0348813],"study_design_scores_gemma":[0.0007866051,0.00042776985,0.0002620616,0.00041262308,0.000027141765,0.000045380053,0.0000061980268,0.6152068,0.0023140092,0.378853,0.0009764808,0.000681952],"about_ca_topic_score_codex":0.00006318263,"about_ca_topic_score_gemma":0.00049212284,"teacher_disagreement_score":0.7726362,"about_ca_system_score_codex":0.00067336,"about_ca_system_score_gemma":0.0003859785,"threshold_uncertainty_score":0.99990386},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009559722,0.00030595358,0.9458783,0.004761976,0.001269291,0.00070750527,0.000005347388,0.00006819807,0.037443675],"genre_scores_gemma":[0.67201436,0.000099545694,0.28306857,0.030222991,0.0012482065,0.0000047669755,0.0000135421205,0.00007360448,0.013254414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99538124,0.000051188475,0.0008424159,0.00084598304,0.0024427357,0.00043646953],"domain_scores_gemma":[0.9974706,0.00071669806,0.0004385478,0.0010444827,0.00024189842,0.000087765184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042844764,0.0003309446,0.00039011156,0.0012310698,0.00029325412,0.0009666141,0.0033425733,0.00018455765,0.00014122041],"category_scores_gemma":[0.00051316473,0.00021208865,0.00012887656,0.0011281718,0.0005664809,0.00075120846,0.00073422835,0.00065318233,0.00021028033],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011109479,0.0000094481775,0.00023741076,0.0000037598131,0.0000022779425,0.000043916327,0.0012870501,0.023854265,0.000060588576,0.003632499,0.00013238142,0.9707253],"study_design_scores_gemma":[0.0003228918,0.000091542286,0.0020723706,0.00037858816,0.000016253529,0.00005338684,0.000007408358,0.54948765,0.00026054835,0.41101223,0.035581253,0.00071587943],"about_ca_topic_score_codex":0.000105878484,"about_ca_topic_score_gemma":0.00018423612,"teacher_disagreement_score":0.9700094,"about_ca_system_score_codex":0.00020851602,"about_ca_system_score_gemma":0.00022989532,"threshold_uncertainty_score":0.9321082},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013521736,0.0004408383,0.9909768,0.00046110796,0.003218457,0.0011141151,0.0000118469725,0.00048486036,0.0019397861],"genre_scores_gemma":[0.65718204,0.000014880458,0.33950752,0.0011560497,0.0014739612,0.00007315786,0.000023179207,0.00011620569,0.0004530071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936474,0.00010957635,0.0010295669,0.002034641,0.0016675025,0.0015113343],"domain_scores_gemma":[0.99354696,0.0012988357,0.0018387611,0.0024035207,0.00052771566,0.0003842252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019932848,0.00095521234,0.0009314962,0.0009890406,0.00068721833,0.0009563592,0.004430871,0.00059543655,0.000011912736],"category_scores_gemma":[0.00007385838,0.0008986954,0.0003029718,0.0007171695,0.0006168551,0.00077780127,0.0011155485,0.00091179414,0.000037021684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027649316,0.00018114697,0.00008772332,0.0004706969,0.00005524621,0.00008287172,0.0006169023,0.74272895,0.0019855606,0.11907776,0.000057681194,0.13462783],"study_design_scores_gemma":[0.00067908067,0.0002526913,0.000048524016,0.0010200406,0.000035902078,0.000032400454,0.000001108241,0.9847457,0.007293032,0.002684592,0.0020592706,0.0011476652],"about_ca_topic_score_codex":0.00006270339,"about_ca_topic_score_gemma":0.00007318341,"teacher_disagreement_score":0.65582985,"about_ca_system_score_codex":0.00091378245,"about_ca_system_score_gemma":0.0004740118,"threshold_uncertainty_score":0.9993464},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003302434,0.0003352462,0.98621017,0.000095113806,0.00033346275,0.0005207557,0.000018921355,0.00004446015,0.0091394605],"genre_scores_gemma":[0.9677209,0.00001586706,0.031697944,0.00016143802,0.00010879041,0.000017744243,0.000008411629,0.000024702971,0.00024417407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831617,0.0000153173,0.0004743031,0.0008247808,0.00009671083,0.00027272216],"domain_scores_gemma":[0.9988859,0.00020556476,0.000370291,0.00037059828,0.00008450941,0.00008313108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008040136,0.00026948052,0.0004252501,0.00036641792,0.0001209905,0.00015601174,0.0003653414,0.00019971823,0.000010887323],"category_scores_gemma":[0.00013822844,0.0002483633,0.000033417557,0.00016957337,0.0004734712,0.00033968934,0.00008218856,0.0003411721,0.000025830566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053357642,0.00005213885,0.0012921218,0.00024384254,0.000022512446,0.000008202844,0.005876141,0.17119442,0.0000024912397,0.63057995,0.000007836964,0.19066697],"study_design_scores_gemma":[0.00013246661,0.00012095659,0.00040002193,0.00019580236,0.0000039341257,0.0000113024125,1.5860863e-7,0.45785677,0.000007906706,0.5409065,0.00013797269,0.00022620235],"about_ca_topic_score_codex":0.000050368297,"about_ca_topic_score_gemma":0.00008215847,"teacher_disagreement_score":0.9644185,"about_ca_system_score_codex":0.00012790566,"about_ca_system_score_gemma":0.000072079616,"threshold_uncertainty_score":0.99999684},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011226167,0.002105967,0.9936637,0.0009486905,0.0007471804,0.00043491955,0.00001419936,0.0004171236,0.0015559407],"genre_scores_gemma":[0.012141797,0.0018778439,0.9820247,0.0026813503,0.0004451669,0.0000036666609,0.00001280215,0.000058093934,0.0007545228],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99537414,0.000040865805,0.00065056654,0.002075835,0.0010289935,0.0008295878],"domain_scores_gemma":[0.9968809,0.00065036165,0.0003756216,0.0014652673,0.00033429518,0.00029355023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007698463,0.0007480844,0.00071590795,0.00063091057,0.0002709266,0.0007472488,0.0030106343,0.00043444926,0.000017507607],"category_scores_gemma":[0.00037407703,0.0006829544,0.0001297217,0.0007895881,0.0011281668,0.0016675568,0.0017954694,0.0012529613,0.00003629287],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020547972,0.000025029336,0.000006331496,0.000028228787,0.0000039193483,0.00009341523,0.00028831902,0.000011762593,0.007589896,0.0012467438,0.00027018043,0.99041563],"study_design_scores_gemma":[0.0011932295,0.0014812733,0.00021544824,0.0021426063,0.000027284448,0.00047917519,6.798104e-7,0.108652726,0.15761869,0.6934476,0.031455312,0.0032859654],"about_ca_topic_score_codex":0.0000073162087,"about_ca_topic_score_gemma":0.000008802665,"teacher_disagreement_score":0.9871297,"about_ca_system_score_codex":0.00028852496,"about_ca_system_score_gemma":0.00023185204,"threshold_uncertainty_score":0.99956214},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088045123,0.0032220157,0.9924974,0.00013592135,0.001615961,0.00019782272,0.0000047613844,0.00007529553,0.0013703641],"genre_scores_gemma":[0.58686084,0.000058036825,0.4121939,0.00031326403,0.00036539973,0.0000032792705,0.000008239555,0.000018384644,0.00017864165],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705875,0.0000279319,0.00053948036,0.0008605404,0.0010150211,0.0004982629],"domain_scores_gemma":[0.9977925,0.00048644815,0.00038116353,0.0008198585,0.00037078583,0.0001492487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095434434,0.0003543564,0.00042895303,0.0024470272,0.00028466404,0.00045502317,0.0018234903,0.0002220945,0.000025369822],"category_scores_gemma":[0.00010531897,0.00033695306,0.00015037808,0.002229675,0.0006524866,0.0007981191,0.00078761345,0.00039627764,0.000021294769],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002362466,0.00003302408,0.00011202719,0.00003673696,0.000008799855,0.000008302424,0.00034467466,0.036962584,0.00038896772,0.04089516,0.000010294572,0.92119706],"study_design_scores_gemma":[0.00061297225,0.00037371778,0.0048692087,0.00057202816,0.000030210744,0.00017256156,2.3536649e-7,0.39183757,0.019591851,0.57484907,0.005531089,0.0015594675],"about_ca_topic_score_codex":0.000012631776,"about_ca_topic_score_gemma":0.00001218694,"teacher_disagreement_score":0.9196376,"about_ca_system_score_codex":0.00013475804,"about_ca_system_score_gemma":0.0005364733,"threshold_uncertainty_score":0.99990827},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031649723,0.00027009842,0.9928362,0.001823119,0.0026431135,0.00060553657,0.000015780348,0.00017363203,0.0013160548],"genre_scores_gemma":[0.31730014,0.000023126631,0.6728329,0.005440964,0.0033706129,0.000030098634,0.000027211681,0.000049547158,0.0009254111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960747,0.00004095299,0.0005831296,0.0017051065,0.0010412605,0.0005548803],"domain_scores_gemma":[0.9976455,0.0002247839,0.00027850913,0.0014379519,0.00018191863,0.00023131754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046408974,0.0004819334,0.00045896022,0.0006064417,0.00022067223,0.000550037,0.002624019,0.00029293084,0.00006358041],"category_scores_gemma":[0.000027020187,0.00046120217,0.00011667446,0.0004190947,0.0001277721,0.00084108155,0.0008119074,0.00046234785,0.00037739525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007699981,0.00003984246,0.000044080713,0.000022479295,0.000012520121,0.000038174334,0.0024465586,0.037366416,0.0026444474,0.002493439,0.00019771283,0.95468664],"study_design_scores_gemma":[0.0005438918,0.00025275862,0.0015111894,0.0009597625,0.00001253349,0.000043029533,1.0539527e-7,0.92398894,0.009060017,0.046745908,0.015534444,0.0013474288],"about_ca_topic_score_codex":0.00017527374,"about_ca_topic_score_gemma":0.00017303108,"teacher_disagreement_score":0.9533392,"about_ca_system_score_codex":0.00035025275,"about_ca_system_score_gemma":0.0001656641,"threshold_uncertainty_score":0.999784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017374419,0.0009500336,0.995422,0.00037199495,0.0009962169,0.0003559842,0.00001793385,0.00009913481,0.000049244176],"genre_scores_gemma":[0.2741518,0.00001513206,0.72523135,0.0003014899,0.00023841152,0.000011092136,0.0000049566593,0.000015483754,0.00003028279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764633,0.00014214165,0.0004071643,0.0007373953,0.0007385237,0.00032841804],"domain_scores_gemma":[0.9947128,0.0033479345,0.00021470533,0.0014653009,0.0002102583,0.000048982012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019250376,0.00032832005,0.00033202145,0.00031486925,0.00010762733,0.00034722322,0.0024199814,0.00019676035,0.0000015785129],"category_scores_gemma":[0.0014414032,0.00020609835,0.00006323322,0.00047389194,0.00039118587,0.0010088816,0.00068147096,0.00065100857,0.000002840062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016547273,0.000015409261,0.00001947864,0.000009658347,0.000003167087,0.00033565343,0.0068047424,0.8308045,0.0005456614,0.0029176755,0.000025267207,0.15851714],"study_design_scores_gemma":[0.00012825754,0.00008002558,0.00010762965,0.000111817324,0.0000062342788,0.00021519583,0.0000037035877,0.77398175,0.00077941857,0.22425427,0.00005657873,0.00027515567],"about_ca_topic_score_codex":0.00039196108,"about_ca_topic_score_gemma":0.00052466855,"teacher_disagreement_score":0.27241436,"about_ca_system_score_codex":0.00022012714,"about_ca_system_score_gemma":0.0002555544,"threshold_uncertainty_score":0.8404447},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018127781,0.00012243161,0.98648655,0.0009724487,0.0016937411,0.0004766536,0.000005522676,0.00026514966,0.009959365],"genre_scores_gemma":[0.011256617,0.000014993329,0.98661697,0.0013663007,0.00024661995,0.000012513599,0.0000016516788,0.000033036184,0.00045127657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961191,0.000043508855,0.0005725787,0.001519522,0.0010401056,0.00070517877],"domain_scores_gemma":[0.99750865,0.00020135555,0.00021690894,0.0016403152,0.00019436001,0.00023843927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012841906,0.000462058,0.00042554087,0.0009701977,0.0002326075,0.0004895225,0.0036189065,0.00026148005,0.000042410386],"category_scores_gemma":[0.0001352026,0.00045436673,0.00010043255,0.00088292675,0.00028672355,0.0007573678,0.00074373005,0.0007215835,0.00019537531],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015787509,0.000010737541,0.0000064682836,0.000019818846,0.000003108057,0.000025937357,0.001498973,0.015846731,0.00019908542,0.044675168,0.000013160025,0.93769926],"study_design_scores_gemma":[0.00016981448,0.00025121486,0.00006984587,0.0003842669,0.0000048733586,0.000066678775,1.1196585e-7,0.86645,0.0042057033,0.120244674,0.007239333,0.00091344723],"about_ca_topic_score_codex":0.0000065721742,"about_ca_topic_score_gemma":0.000013851228,"teacher_disagreement_score":0.93678576,"about_ca_system_score_codex":0.00031350917,"about_ca_system_score_gemma":0.00019414455,"threshold_uncertainty_score":0.9997908},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012277337,0.00009507886,0.9942976,0.00052172964,0.000515393,0.0009082526,0.0000022224374,0.00032653875,0.0033208618],"genre_scores_gemma":[0.30070332,0.0000032563921,0.6984137,0.00061075576,0.00015262175,0.0000129913815,0.000002316247,0.000028165972,0.00007284738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628663,0.000028205408,0.00056668883,0.0013403946,0.0009798266,0.00079827476],"domain_scores_gemma":[0.9978088,0.0004202896,0.0004018595,0.00072854763,0.00041001465,0.00023044998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010429512,0.0005348966,0.0004951444,0.00097137,0.00034762293,0.00090437225,0.0012658964,0.0002660132,0.000032011983],"category_scores_gemma":[0.000057507776,0.00046712006,0.00009497381,0.0006483712,0.00097464654,0.00070968753,0.00032818702,0.0008678749,0.0000141984965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007771408,0.000013209432,0.000036580568,0.000024350726,0.000014342381,0.000081978294,0.0005731174,0.18431675,0.000024581845,0.02316453,8.7956136e-7,0.7917419],"study_design_scores_gemma":[0.0007829963,0.00024864604,0.00006709607,0.00095339486,0.000017936254,0.00042805262,0.0000010888356,0.981544,0.000054473243,0.014868559,0.00021773005,0.0008160348],"about_ca_topic_score_codex":0.000023680943,"about_ca_topic_score_gemma":0.00036574554,"teacher_disagreement_score":0.79722726,"about_ca_system_score_codex":0.00037517122,"about_ca_system_score_gemma":0.00093151344,"threshold_uncertainty_score":0.99977803},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039225325,0.0003157723,0.99674755,0.00035852063,0.0012962263,0.00036922604,0.000020894327,0.00018676164,0.00031277983],"genre_scores_gemma":[0.26718885,0.000035429526,0.7296284,0.0018925417,0.0011117833,0.000008170642,0.000039299706,0.000059162656,0.000036366222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954247,0.000086641674,0.0006452972,0.0017049874,0.0013144658,0.00082391925],"domain_scores_gemma":[0.9971208,0.0006385713,0.00029644708,0.0013538256,0.0003711687,0.00021921222],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009572686,0.000595633,0.0005489871,0.00095083675,0.00046673926,0.0016346468,0.0024662965,0.000338756,0.0000658972],"category_scores_gemma":[0.0000660633,0.00055177213,0.00013267688,0.00058771943,0.00039810155,0.0018312413,0.0010590805,0.0012003481,0.000070171736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071376408,0.000038088714,0.000011846769,0.000086707754,0.000007257603,0.00013306276,0.00023764017,0.050377525,0.00045314044,0.00027586243,0.0000049918704,0.94836676],"study_design_scores_gemma":[0.00030312515,0.00014981952,0.00003812416,0.0012557337,0.000013575534,0.0000814187,4.730986e-7,0.9737827,0.0038813443,0.01957587,0.00021609887,0.0007017275],"about_ca_topic_score_codex":0.00015146623,"about_ca_topic_score_gemma":0.000120319215,"teacher_disagreement_score":0.94766504,"about_ca_system_score_codex":0.0004823086,"about_ca_system_score_gemma":0.0015765019,"threshold_uncertainty_score":0.9996934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1449568,0.000006399133,0.85355,0.0008432299,0.000317877,0.00017825987,0.0000011629294,0.000063791915,0.000082481594],"genre_scores_gemma":[0.5405425,4.855573e-7,0.45919684,0.00021065045,0.000041742856,0.000003054042,6.736998e-7,0.000003712698,3.6570214e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981161,0.00003042416,0.000268793,0.0006193479,0.00060857437,0.00035678927],"domain_scores_gemma":[0.99838525,0.0003482249,0.00014824138,0.0007933904,0.00022838412,0.00009649831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005882121,0.00015128363,0.00017159511,0.00034266867,0.00019758554,0.0002237336,0.00149531,0.000061908424,0.000009496383],"category_scores_gemma":[0.000086484135,0.0001234107,0.000030876734,0.0022205852,0.00051982136,0.00067635934,0.00044675343,0.00035333043,0.0000070110004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057567904,0.00012866729,0.0020474389,0.00001830894,0.0000082469705,0.0000099855515,0.0019383914,0.049328003,0.31595185,0.0062562916,0.0000057722673,0.62430125],"study_design_scores_gemma":[0.00021094969,0.00008481178,0.0054695974,0.00004240545,0.000002433937,0.00006456336,7.5607943e-7,0.72652733,0.25946453,0.007916148,0.000031091095,0.00018535693],"about_ca_topic_score_codex":0.000047223468,"about_ca_topic_score_gemma":0.00012907351,"teacher_disagreement_score":0.67719936,"about_ca_system_score_codex":0.000050495855,"about_ca_system_score_gemma":0.00028886486,"threshold_uncertainty_score":0.50325423},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010231644,0.0008325017,0.991889,0.002227071,0.0010453468,0.0006155863,0.000012701508,0.00015456536,0.0032129737],"genre_scores_gemma":[0.0047579887,0.00031351057,0.9903913,0.0014112432,0.00050251215,0.00002500605,0.0000045359425,0.000077399294,0.0025165088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938497,0.000074809555,0.0007114494,0.0018876826,0.0023063153,0.0011700725],"domain_scores_gemma":[0.9959327,0.0006843455,0.0003645555,0.002265455,0.00050596864,0.00024698896],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013286301,0.00066522526,0.0005392681,0.0005749704,0.0008377183,0.0016416999,0.0061642583,0.00033256487,0.0000477843],"category_scores_gemma":[0.00026860563,0.0004996156,0.00015480843,0.0009357115,0.0012846715,0.00049667765,0.0019450339,0.0011757914,0.00010661988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002927641,0.000019652267,0.000016261156,0.000018942419,0.000013567513,0.00009622592,0.0006674468,0.60434175,0.000007943517,0.0068294792,0.000037917198,0.38794792],"study_design_scores_gemma":[0.00031321915,0.00007259091,0.000047358044,0.00017861654,0.0000064416545,0.00008065045,3.709984e-7,0.90028155,0.00013335118,0.097973466,0.00038954514,0.0005228214],"about_ca_topic_score_codex":0.000043006934,"about_ca_topic_score_gemma":0.000040579114,"teacher_disagreement_score":0.3874251,"about_ca_system_score_codex":0.00042567114,"about_ca_system_score_gemma":0.0017402046,"threshold_uncertainty_score":0.99974555},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047381916,0.00036921192,0.9904267,0.0006316445,0.00089947134,0.0004682071,0.000003261732,0.00013854858,0.0023247465],"genre_scores_gemma":[0.782643,0.000038614344,0.21593831,0.0009796999,0.00016181708,0.000028220593,0.0000048092056,0.000022945647,0.00018256764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679244,0.00004525345,0.00044027876,0.0014552296,0.0006572198,0.0006095657],"domain_scores_gemma":[0.99832857,0.00044682625,0.00022182775,0.00064637646,0.00021994184,0.00013643412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005655494,0.0005188251,0.0005877631,0.00069643016,0.00018221984,0.00055297336,0.0010083158,0.0002875316,0.00004936019],"category_scores_gemma":[0.00008461514,0.00040208618,0.000058880694,0.00041901114,0.0019519578,0.0010485247,0.0007166938,0.0006788355,0.0000269251],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009087622,0.00011372697,0.0045537213,0.00017246263,0.000054224813,0.0005788474,0.0028599515,0.019221965,0.000638591,0.1666396,0.000036771293,0.8050393],"study_design_scores_gemma":[0.0016036694,0.0008908924,0.043730233,0.0018154843,0.000025108911,0.0010613137,0.000011582697,0.565988,0.00057936244,0.38212484,0.00022429133,0.0019452394],"about_ca_topic_score_codex":0.000100250676,"about_ca_topic_score_gemma":0.0003234744,"teacher_disagreement_score":0.803094,"about_ca_system_score_codex":0.00023654169,"about_ca_system_score_gemma":0.00040314265,"threshold_uncertainty_score":0.9998431},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020451369,0.00052898045,0.98302025,0.000265779,0.0013699254,0.00037128854,0.00000206409,0.00021102354,0.012185572],"genre_scores_gemma":[0.6582655,0.000029534307,0.34010327,0.0011730075,0.00018628433,0.000009337282,0.000004000573,0.000019393598,0.0002097191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955809,0.00009772868,0.0006061525,0.0018293733,0.0010553628,0.0008304614],"domain_scores_gemma":[0.99764675,0.0004256267,0.00030580946,0.001375054,0.00012360641,0.00012316967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011071877,0.00057865033,0.00065310084,0.0008787485,0.00022307268,0.0006811048,0.0030909004,0.00043276665,0.00001854296],"category_scores_gemma":[0.00025090054,0.00048327597,0.00013406549,0.0006851184,0.00060264417,0.00067367847,0.00091393053,0.0010967734,0.000029326075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016533846,0.000056600846,0.00066783844,0.0000817071,0.000010363077,0.0001522977,0.0020458687,0.059483897,0.000048829526,0.5234796,0.000022037313,0.41393447],"study_design_scores_gemma":[0.00026612185,0.00014154804,0.0028781667,0.0003504095,0.0000034779976,0.000072269155,4.8595143e-7,0.65026945,0.00009284194,0.34533367,0.000048917995,0.00054262264],"about_ca_topic_score_codex":0.00010629106,"about_ca_topic_score_gemma":0.00011386409,"teacher_disagreement_score":0.6562203,"about_ca_system_score_codex":0.00047114072,"about_ca_system_score_gemma":0.00017990876,"threshold_uncertainty_score":0.9997619},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032032796,0.00015560904,0.9915794,0.00038591836,0.005943893,0.00058792566,0.000030918276,0.00023815488,0.0010461197],"genre_scores_gemma":[0.009007205,0.0000307752,0.9883266,0.0007318618,0.0012350549,0.000035137666,0.000037442125,0.000041145544,0.0005547438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961137,0.000020890171,0.0005395293,0.0018085234,0.0008338156,0.00068355363],"domain_scores_gemma":[0.9972428,0.0003792598,0.000356724,0.0014504826,0.00037121965,0.00019950444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007966762,0.00055270875,0.00050818437,0.0007637277,0.0004767937,0.00080053805,0.0037197135,0.0005047751,0.000026844436],"category_scores_gemma":[0.000081221144,0.00047099128,0.00017807567,0.0004411542,0.000684036,0.0011374648,0.0014054041,0.0010438878,0.000028396606],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066653756,0.000023874989,0.0000063855073,0.000026865373,0.000009771292,0.000024244287,0.00033567974,0.0022308992,0.0011904982,0.008063027,0.000031121028,0.988051],"study_design_scores_gemma":[0.00033308638,0.00028292948,0.00003616225,0.0002963992,0.000008997121,0.000102256075,2.8711338e-7,0.8101804,0.0050962036,0.17432986,0.00861448,0.00071893807],"about_ca_topic_score_codex":0.000056095996,"about_ca_topic_score_gemma":0.00013851254,"teacher_disagreement_score":0.98733205,"about_ca_system_score_codex":0.00020989192,"about_ca_system_score_gemma":0.00050950673,"threshold_uncertainty_score":0.99977416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003794339,0.00012511862,0.9916355,0.000838649,0.0011959387,0.00063816935,0.000011648018,0.00035758587,0.0048179575],"genre_scores_gemma":[0.4098441,0.00015854595,0.5881671,0.0011858451,0.00049316534,0.000018176126,0.000020769205,0.000036870166,0.000075461554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957528,0.000080353224,0.00076166337,0.0016934782,0.0010375379,0.0006741352],"domain_scores_gemma":[0.99776727,0.00025197904,0.00050820515,0.0008145304,0.0003422136,0.00031582892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076266786,0.00062019634,0.00050030893,0.0010056868,0.00039195988,0.0005336195,0.0014350971,0.00057018775,0.00009546091],"category_scores_gemma":[0.000042977685,0.0006175138,0.00012332568,0.0005598611,0.0006694565,0.0019003527,0.00043359067,0.001601534,0.00008661997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002407917,0.000010983638,0.00013478914,0.00000954929,0.000006903968,0.00001665642,0.0007096453,0.4889161,0.000012980251,0.033534214,0.000005380674,0.4766404],"study_design_scores_gemma":[0.00026867463,0.00015130697,0.00013277592,0.00030259436,0.000010153256,0.00023038074,0.0000019600486,0.9166309,0.00016337621,0.08110072,0.00033299363,0.0006741465],"about_ca_topic_score_codex":0.00009712325,"about_ca_topic_score_gemma":0.00027005418,"teacher_disagreement_score":0.47596624,"about_ca_system_score_codex":0.0005475287,"about_ca_system_score_gemma":0.0009960772,"threshold_uncertainty_score":0.99962765},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011108175,0.00033125628,0.99031913,0.0018436622,0.00087480847,0.00029844427,0.0000071295576,0.00022183098,0.0059926417],"genre_scores_gemma":[0.1518111,0.000101260135,0.83829415,0.004754482,0.0019400055,0.0000328174,0.000024745787,0.00008652036,0.0029549154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965095,0.00002276483,0.0005036448,0.0014979423,0.00076002703,0.0007061024],"domain_scores_gemma":[0.9977742,0.0003726414,0.00021440935,0.0013175654,0.00013500861,0.0001861898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042749435,0.00044403438,0.0004150959,0.00044757547,0.00034473828,0.00063405366,0.0032209049,0.00020887212,0.000011900431],"category_scores_gemma":[0.000015921903,0.0003986233,0.00013758121,0.00064031343,0.00057490653,0.00037504602,0.0011935963,0.0009735319,0.00006083761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000257597,0.000020242944,0.00002347067,0.0000118817225,0.00000451755,0.000079066995,0.000106827094,0.16100365,0.00008933622,0.033662807,0.00038407012,0.80461156],"study_design_scores_gemma":[0.00011236734,0.000060747167,0.0000904505,0.00011940174,0.0000027448189,0.000038234673,7.011777e-9,0.6770295,0.00030484045,0.31417546,0.0076160543,0.00045019464],"about_ca_topic_score_codex":0.000035329642,"about_ca_topic_score_gemma":0.000056676166,"teacher_disagreement_score":0.80416137,"about_ca_system_score_codex":0.0001389472,"about_ca_system_score_gemma":0.00025509362,"threshold_uncertainty_score":0.9998466},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031917596,0.0003118093,0.989921,0.0008829045,0.0013781633,0.001464786,0.000025996582,0.0002721072,0.0057400665],"genre_scores_gemma":[0.0074208314,0.00005399611,0.98983794,0.0007008679,0.00040798896,0.000070428716,0.000020958367,0.000050680937,0.0014362828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542284,0.00004151853,0.00064248056,0.001679736,0.0012945922,0.0009188475],"domain_scores_gemma":[0.99682504,0.00049856276,0.0003279033,0.0010843236,0.000902412,0.00036177863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019805976,0.00054953696,0.00057233084,0.00063126005,0.0002990279,0.0009191557,0.002789613,0.0003402721,0.000027341184],"category_scores_gemma":[0.0002584258,0.0005130053,0.00013237602,0.0005880072,0.0008306286,0.0009973824,0.0012626018,0.0006627464,0.000029415924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009538337,0.00004654566,0.000009596238,0.00013280599,0.000019098408,0.000026825894,0.0012699236,0.41389945,0.00016204626,0.05356215,0.00014224432,0.53071976],"study_design_scores_gemma":[0.00059301924,0.00035818826,0.0000036818,0.00033635873,0.0000051063885,0.00007107959,2.2799591e-7,0.8715338,0.00035065057,0.12035859,0.0057709576,0.0006183329],"about_ca_topic_score_codex":0.000011615236,"about_ca_topic_score_gemma":0.000028602224,"teacher_disagreement_score":0.5301014,"about_ca_system_score_codex":0.00040204314,"about_ca_system_score_gemma":0.0016815828,"threshold_uncertainty_score":0.99973214},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059454096,0.00055672147,0.9685019,0.00055048516,0.004730684,0.00035148114,0.000011324753,0.00017210703,0.024530757],"genre_scores_gemma":[0.063193485,0.00014029395,0.829083,0.005080253,0.0033683525,0.000011825065,0.00007323788,0.0001642567,0.098885246],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98933303,0.00009662649,0.0013626353,0.0028627513,0.00538604,0.00095888984],"domain_scores_gemma":[0.9891051,0.004968831,0.0019371017,0.0028398614,0.0008433086,0.000305776],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.015427143,0.00058329164,0.0006856082,0.002497974,0.00077314273,0.002798497,0.0056279977,0.00034190284,0.00037344085],"category_scores_gemma":[0.0113569135,0.000467704,0.00021248522,0.002059078,0.0013217301,0.0008108624,0.0033560088,0.0015675264,0.0011543174],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009099735,0.000027937998,0.00069724314,0.000012052643,0.000007664823,0.00011870041,0.0007485352,0.05235572,0.000005256184,0.00045572635,0.00043168906,0.94513035],"study_design_scores_gemma":[0.000488234,0.00039862294,0.0011589106,0.0009107615,0.000047040616,0.00014109685,0.0000261815,0.27299836,0.000103327664,0.066083565,0.65598047,0.0016634404],"about_ca_topic_score_codex":0.00010514109,"about_ca_topic_score_gemma":0.0002115779,"teacher_disagreement_score":0.9434669,"about_ca_system_score_codex":0.00028501067,"about_ca_system_score_gemma":0.0004845089,"threshold_uncertainty_score":0.9997775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005969407,0.00021725264,0.9964124,0.00037576273,0.0013414361,0.00092380634,0.00002380061,0.000061601626,0.0005842756],"genre_scores_gemma":[0.161302,0.000014330814,0.8339755,0.0008734506,0.00091588614,0.000108693406,0.0000081067,0.000049198694,0.0027528377],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629205,0.00005446761,0.000672069,0.0011691505,0.0013178701,0.00049441727],"domain_scores_gemma":[0.99437815,0.0036989949,0.00043002068,0.000887736,0.00042383594,0.00018124812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0046483,0.00034464497,0.00042748757,0.0005814891,0.00051455974,0.00021247663,0.0013399798,0.00026843962,0.00024672895],"category_scores_gemma":[0.0006187822,0.00026871063,0.00016357051,0.0004282178,0.0005326815,0.00041387128,0.00040332423,0.0003745111,0.00023327931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022954571,0.000035905443,0.0000051331394,0.000009812388,0.0000088587,0.0000017851228,0.0005339424,0.14197628,0.0018011999,0.4146288,0.00009098,0.44088435],"study_design_scores_gemma":[0.00018087782,0.000069700094,0.000009095904,0.000063643536,0.000008476957,0.000025776872,5.496805e-7,0.1304096,0.005357244,0.8492702,0.014282312,0.00032252088],"about_ca_topic_score_codex":0.0000023293173,"about_ca_topic_score_gemma":0.000005504689,"teacher_disagreement_score":0.44056183,"about_ca_system_score_codex":0.00013449464,"about_ca_system_score_gemma":0.00026881733,"threshold_uncertainty_score":0.9999765},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006218706,0.00011336901,0.9947742,0.0005130601,0.0018580902,0.0005199082,0.00001156736,0.00019913624,0.0019484478],"genre_scores_gemma":[0.037646454,0.000020875459,0.9583858,0.001521832,0.0008523459,0.00002027548,0.000026748989,0.00003669473,0.0014889553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967452,0.000027705099,0.00041877484,0.0015001403,0.0007214926,0.0005866597],"domain_scores_gemma":[0.99725145,0.00087418995,0.00028902476,0.0012886939,0.00017481133,0.0001218369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010957522,0.00044764928,0.00044082632,0.00069961866,0.00041108215,0.00088491675,0.004050365,0.00020181654,0.00000703572],"category_scores_gemma":[0.00022216597,0.00038630352,0.00014999748,0.00034347444,0.00035675362,0.00072141574,0.002299999,0.00043360458,0.000027075072],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006435384,0.000011952652,0.00003265929,0.00004934559,0.0000088687775,0.000014248725,0.00064408005,0.0023742374,0.00009880746,0.020949343,0.00021554934,0.97559446],"study_design_scores_gemma":[0.00042711655,0.0001885061,0.00004870094,0.00040599643,0.000009500247,0.00000606765,8.1487866e-7,0.9233076,0.0005441469,0.049547944,0.02488487,0.0006287592],"about_ca_topic_score_codex":0.000034649318,"about_ca_topic_score_gemma":0.00008829818,"teacher_disagreement_score":0.9749657,"about_ca_system_score_codex":0.0001342925,"about_ca_system_score_gemma":0.00010711484,"threshold_uncertainty_score":0.9998589},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004655107,0.00095127145,0.98071444,0.000008839144,0.0008310464,0.00027977992,0.0000073004508,0.00021027142,0.012341925],"genre_scores_gemma":[0.963073,0.000015456711,0.03646808,0.000025930009,0.00024739592,0.000006168505,0.000006927689,0.00005484373,0.00010220455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843246,0.000015307987,0.00038807146,0.00047716981,0.00034775375,0.0003392318],"domain_scores_gemma":[0.9990658,0.000062094776,0.00008708324,0.0006370452,0.000076321376,0.00007165755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003992639,0.0003276868,0.00040048262,0.0005350458,0.00006933831,0.00006658765,0.0007998173,0.00024044396,0.000011234249],"category_scores_gemma":[0.0000035312632,0.00031322762,0.000093617506,0.00033402987,0.00035963356,0.00017827182,0.000075708835,0.00035619264,0.000004718705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003610528,0.000016284726,0.0001060156,0.0003185628,0.00001735637,0.000022813334,0.000359749,0.8247771,0.0071741706,0.012959648,0.000026241236,0.15421845],"study_design_scores_gemma":[0.00051858346,0.0003680603,0.0003592891,0.002260552,0.000039848168,0.00012266228,0.0000010015236,0.50622797,0.03260686,0.44807994,0.0074957046,0.0019195486],"about_ca_topic_score_codex":0.000015351585,"about_ca_topic_score_gemma":0.000040537874,"teacher_disagreement_score":0.9584179,"about_ca_system_score_codex":0.000055252738,"about_ca_system_score_gemma":0.00004019548,"threshold_uncertainty_score":0.999932},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050167687,0.000252306,0.9933458,0.000591984,0.0017997298,0.00018743108,0.000008318192,0.00017334607,0.0031393876],"genre_scores_gemma":[0.39834377,0.000018033485,0.5986592,0.0010315448,0.0008793528,0.000005182193,0.00002643841,0.000036337304,0.0010001343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995755,0.00003681163,0.0006539968,0.0016243707,0.0012846182,0.000645211],"domain_scores_gemma":[0.9971341,0.00065295707,0.000384127,0.0013790883,0.0002843724,0.00016536693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009946218,0.00053431024,0.0005345412,0.00073024625,0.00039428487,0.0006393371,0.0043957965,0.00030818104,0.00023276855],"category_scores_gemma":[0.00032449217,0.00047444095,0.00020875662,0.00048252137,0.000651369,0.0012598841,0.0035605407,0.0015110562,0.00006128623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054252787,0.000035370475,0.00018431009,0.000040110295,0.00003680332,0.000110268855,0.001450594,0.039829403,0.00016115126,0.86034435,0.00011530226,0.09768693],"study_design_scores_gemma":[0.00014150422,0.000042935866,0.00022051293,0.00032691695,0.00001230107,0.00004928225,1.5228623e-7,0.97298783,0.0003644003,0.011373736,0.01384574,0.00063469453],"about_ca_topic_score_codex":0.000041022045,"about_ca_topic_score_gemma":0.00041946367,"teacher_disagreement_score":0.9331584,"about_ca_system_score_codex":0.0001516884,"about_ca_system_score_gemma":0.0004739629,"threshold_uncertainty_score":0.9997707},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003147952,0.00038110424,0.99692684,0.0006578814,0.0009334324,0.000457062,0.000008111175,0.00008072675,0.0005517121],"genre_scores_gemma":[0.00555575,0.00010435822,0.9920919,0.0018619805,0.00023114822,0.000011475737,0.000013568981,0.000028703073,0.00010113638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728227,0.00008855583,0.0006570808,0.00093346706,0.0006095522,0.00042910615],"domain_scores_gemma":[0.9959893,0.0016200627,0.00057009584,0.0012823046,0.00047801677,0.00006017403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013369794,0.00035926202,0.0004942464,0.00050933886,0.00033966464,0.00059217296,0.0029442261,0.0002625312,0.000023217606],"category_scores_gemma":[0.00049878424,0.0002654011,0.00019976262,0.0012757324,0.0005842266,0.0009486592,0.00081907713,0.00037630295,0.0000054985417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011670184,0.000014622031,0.000010642266,0.000049523183,0.000019182628,7.5442676e-7,0.0013759485,0.012123586,0.000066911416,0.83681494,0.000037297497,0.14948542],"study_design_scores_gemma":[0.00007280976,0.000054855365,0.000008739747,0.00027983138,0.000015720962,0.0000030520916,5.9636244e-7,0.46949297,0.0009738381,0.5264266,0.002435195,0.00023579963],"about_ca_topic_score_codex":0.000018140725,"about_ca_topic_score_gemma":0.000009005927,"teacher_disagreement_score":0.4573694,"about_ca_system_score_codex":0.00007832119,"about_ca_system_score_gemma":0.00026038248,"threshold_uncertainty_score":0.9999798},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005421245,0.00024898857,0.99480367,0.00041034308,0.0022716394,0.0003114641,0.00001373386,0.000038445596,0.0013596204],"genre_scores_gemma":[0.80931336,0.0000661634,0.18838365,0.00006363268,0.0011715894,0.0000145869835,0.0000033423025,0.00003900038,0.0009446908],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931211,0.00006224167,0.0009969694,0.0014512436,0.0037980163,0.0005704429],"domain_scores_gemma":[0.9924676,0.0040491754,0.00062980293,0.0016000025,0.0010665277,0.00018689124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033167645,0.00035662696,0.00063329906,0.0014689156,0.00018525252,0.00039707733,0.0032297454,0.000412925,0.00015523465],"category_scores_gemma":[0.0039631557,0.00027688956,0.00016209099,0.0010726949,0.0018577623,0.00050689495,0.00087351387,0.0013118222,0.00012412414],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016252397,0.000021105012,0.00048889604,0.00001422825,0.0000053690505,0.000024218663,0.00068531936,0.017102905,0.0030754253,0.00065977883,0.000005377852,0.9779011],"study_design_scores_gemma":[0.00048290406,0.00030990303,0.0042009614,0.00047912504,0.000012355923,0.000032264412,0.000004362826,0.31935608,0.076916136,0.582903,0.014384787,0.0009181224],"about_ca_topic_score_codex":0.000012852336,"about_ca_topic_score_gemma":0.000027064096,"teacher_disagreement_score":0.976983,"about_ca_system_score_codex":0.00015635249,"about_ca_system_score_gemma":0.00061131205,"threshold_uncertainty_score":0.99996835},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011257239,0.000024024148,0.975845,0.00094271195,0.00070823403,0.0004648979,0.000033821863,0.0001346835,0.0105893975],"genre_scores_gemma":[0.9520394,0.00009643256,0.038724404,0.006264254,0.00071532105,0.000011731488,0.000007827921,0.000052992124,0.0020876238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964908,0.00004026927,0.0003254378,0.0015652712,0.00092215976,0.00065606413],"domain_scores_gemma":[0.9988459,0.0003715082,0.00013629589,0.00036708772,0.00012106502,0.00015817929],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037518417,0.0004323333,0.00038692178,0.00053233095,0.00028899417,0.0002495376,0.0011216657,0.000346688,0.00009579292],"category_scores_gemma":[0.00019486998,0.00033907275,0.00012491776,0.00043187168,0.00088093395,0.000308972,0.00080629165,0.0010427998,0.00006760956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000596382,0.000053257387,0.000006039542,0.000013401541,0.0000027181432,0.000047334343,0.0001500463,0.2720283,0.05836814,0.012138013,0.0000075184867,0.6571256],"study_design_scores_gemma":[0.0001640948,0.00031913997,0.00004198698,0.00007056203,0.0000038207527,0.000047501588,7.8534306e-8,0.92501533,0.02794096,0.04568975,0.00029690578,0.0004098885],"about_ca_topic_score_codex":0.000011789998,"about_ca_topic_score_gemma":0.000041451865,"teacher_disagreement_score":0.9407822,"about_ca_system_score_codex":0.00033119286,"about_ca_system_score_gemma":0.00051272823,"threshold_uncertainty_score":0.9999061},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004146513,0.0002993734,0.98846596,0.0030876226,0.0013398973,0.0014762473,0.00008346944,0.00050102046,0.004331746],"genre_scores_gemma":[0.29313788,0.000014441988,0.6839121,0.020571731,0.0014566802,0.0001775133,0.00034440434,0.00020619378,0.00017901881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99369687,0.000035131616,0.0008065025,0.0027908117,0.0014714692,0.0011992233],"domain_scores_gemma":[0.99541855,0.0003903756,0.0005135768,0.0025235077,0.00084396143,0.00031000903],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007656366,0.0011209468,0.00079349853,0.0015970002,0.00050775876,0.00093647966,0.007228927,0.00045335008,0.000022532879],"category_scores_gemma":[0.000008375137,0.0009753384,0.00018944172,0.0019464898,0.00025733715,0.00077097915,0.00075436424,0.0008865225,0.000020561536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005629944,0.0001799998,0.000050124654,0.0013196805,0.000032364074,0.000119743934,0.0005923802,0.5765799,0.00033094338,0.0032310328,0.000022088749,0.41748542],"study_design_scores_gemma":[0.001333988,0.0002587389,0.0010444346,0.0010203731,0.00005386895,0.000060037128,7.894908e-7,0.8763135,0.0014561604,0.10728599,0.009439941,0.001732174],"about_ca_topic_score_codex":0.00015807623,"about_ca_topic_score_gemma":0.002260957,"teacher_disagreement_score":0.41575325,"about_ca_system_score_codex":0.0001800606,"about_ca_system_score_gemma":0.0006818201,"threshold_uncertainty_score":0.9992697},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016828332,0.0005647692,0.99497396,0.00073591154,0.0011149854,0.0003296,0.000023773226,0.00008348365,0.0020052344],"genre_scores_gemma":[0.19112912,0.00006260226,0.80782646,0.0006837157,0.00023845836,0.0000031418367,0.000009729497,0.000020076022,0.000026681855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593854,0.00007046031,0.00078766217,0.0011669081,0.0013519176,0.0006844867],"domain_scores_gemma":[0.9964813,0.0010526287,0.0005405,0.0013460653,0.0004351015,0.0001443959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010305975,0.00052013935,0.00058037473,0.00044119876,0.0006521082,0.0005720414,0.004340597,0.00025058648,0.00001554719],"category_scores_gemma":[0.00008018527,0.00038040525,0.0001983443,0.00079260714,0.002664196,0.000560422,0.0015805237,0.0007541253,0.000014037701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004570822,0.00001937067,0.000049537986,0.000015124336,0.000011326702,0.000012906729,0.00043490733,0.50057983,0.0000060422085,0.12170554,0.000013955636,0.37714687],"study_design_scores_gemma":[0.00011817868,0.000060307848,0.00017795975,0.00010902702,0.000004368152,0.000030482337,1.3104956e-7,0.602369,0.000026607819,0.39647424,0.00036210133,0.00026757078],"about_ca_topic_score_codex":0.000048675618,"about_ca_topic_score_gemma":0.00010460507,"teacher_disagreement_score":0.3768793,"about_ca_system_score_codex":0.00022345327,"about_ca_system_score_gemma":0.0007228055,"threshold_uncertainty_score":0.9998648},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003359561,0.0003230573,0.99395746,0.0009136124,0.0026907562,0.00089249515,0.000022548249,0.00018578768,0.0009806729],"genre_scores_gemma":[0.17988452,0.00004883097,0.8156056,0.002216946,0.000913638,0.00008547617,0.000043401706,0.00006704939,0.0011345348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963571,0.000033701832,0.0006459328,0.0014116925,0.00094609417,0.0006055123],"domain_scores_gemma":[0.9971374,0.00058279955,0.00045005948,0.0013021573,0.00034962542,0.0001779448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006504394,0.00047355244,0.000491974,0.0008074459,0.00050419086,0.00039480184,0.00219013,0.00030774638,0.000016832679],"category_scores_gemma":[0.00011273,0.00043839315,0.000241345,0.00046611016,0.00028098185,0.0004799511,0.00032601255,0.00036048706,0.00004783358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002704908,0.00024037903,0.0003006082,0.0003282738,0.00006369599,0.00014346174,0.0025462308,0.19036569,0.0009207806,0.051799823,0.0021857498,0.75107825],"study_design_scores_gemma":[0.00060251774,0.0001598399,0.0003970347,0.00028846523,0.000010108085,0.00002630464,7.997948e-8,0.96908355,0.0012666573,0.0082881,0.019189626,0.00068769173],"about_ca_topic_score_codex":0.0000257802,"about_ca_topic_score_gemma":0.00009747123,"teacher_disagreement_score":0.7787179,"about_ca_system_score_codex":0.00043305114,"about_ca_system_score_gemma":0.0008223998,"threshold_uncertainty_score":0.99980676},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002232236,0.00010097213,0.9953002,0.00007159466,0.00046225495,0.0004027557,0.000008874891,0.0011433143,0.0022868137],"genre_scores_gemma":[0.08078447,0.000002613632,0.9185088,0.00028058636,0.0002052547,0.000013618146,0.0000151552895,0.000048631,0.00014085977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634236,0.00003312922,0.00045152576,0.001555288,0.00094413303,0.00067356473],"domain_scores_gemma":[0.9974867,0.0001699491,0.00024390036,0.0016593362,0.00025863998,0.00018147385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005943066,0.00063337595,0.00052186596,0.0007893987,0.00016950328,0.0004345865,0.0027551197,0.0003024916,0.000012674032],"category_scores_gemma":[0.00001824932,0.0005324695,0.00008080199,0.00061129517,0.000871845,0.0007527917,0.00069501187,0.0010045371,0.000008928865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047441804,0.00003392196,0.00006967191,0.000031663883,0.000010176623,0.0003313458,0.0013277989,0.026410935,0.00022560534,0.10436667,0.000021297972,0.86716616],"study_design_scores_gemma":[0.00037628235,0.0007083853,0.000104097875,0.0011372016,0.000011627402,0.0003492171,4.300979e-7,0.9730427,0.004360409,0.016175691,0.002258518,0.0014753949],"about_ca_topic_score_codex":0.00008858733,"about_ca_topic_score_gemma":0.00016191752,"teacher_disagreement_score":0.9466318,"about_ca_system_score_codex":0.0003237249,"about_ca_system_score_gemma":0.00045660904,"threshold_uncertainty_score":0.9997127},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007660256,0.0004498055,0.9906127,0.00082601083,0.0022769794,0.00035442263,0.0000028690959,0.00031845205,0.005082186],"genre_scores_gemma":[0.09680666,0.000027698909,0.8992875,0.0026359775,0.0006103403,0.0000048193624,0.000006940667,0.0000621243,0.00055793725],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99482673,0.00009702223,0.0007302189,0.0020151052,0.0013608437,0.0009700983],"domain_scores_gemma":[0.99657077,0.00058171246,0.00034933863,0.0018343523,0.0004127459,0.00025111155],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017604992,0.00072145916,0.00074489793,0.0012196213,0.0004741928,0.0012276861,0.0040636985,0.0004369359,0.000060327988],"category_scores_gemma":[0.00019557105,0.0006800584,0.00021916814,0.0010262188,0.00072724716,0.0010287148,0.0013380379,0.0011874607,0.00015412187],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008858356,0.000035023037,0.000009260622,0.00004453134,0.000016268108,0.0005201238,0.000770929,0.029759545,0.0016802718,0.039266426,0.000018154777,0.92787063],"study_design_scores_gemma":[0.0010047246,0.00020223629,0.00019919428,0.0009821247,0.000019329229,0.00036435187,1.231389e-7,0.22975567,0.018084561,0.74696285,0.0009976199,0.0014272198],"about_ca_topic_score_codex":0.00006365845,"about_ca_topic_score_gemma":0.000023949908,"teacher_disagreement_score":0.9264434,"about_ca_system_score_codex":0.00067497225,"about_ca_system_score_gemma":0.0009284399,"threshold_uncertainty_score":0.99980915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002325034,0.0003503589,0.99658406,0.0002880968,0.00015042638,0.000867046,0.000002289105,0.00011001743,0.0014151771],"genre_scores_gemma":[0.668982,0.0000054695292,0.33081993,0.000035213146,0.000055068114,0.000035231344,0.0000053205226,0.000020373678,0.00004135884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995914,0.00016151687,0.00047176424,0.0010924228,0.0019931772,0.00036713356],"domain_scores_gemma":[0.99706656,0.00051976007,0.00039777276,0.00090846367,0.00092695124,0.00018049148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0038707366,0.00034581515,0.00046592334,0.00043316066,0.00019665895,0.00025237346,0.0012605258,0.00021188683,0.0000021988187],"category_scores_gemma":[0.00009867494,0.00027468,0.00003808854,0.00057973067,0.00074416323,0.00034499707,0.0005799869,0.00056020176,0.0000059136446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002049049,0.000032183645,0.000022175172,0.00008079428,0.000025428639,0.000014922957,0.00075172447,0.741206,0.00025770612,0.08762408,0.0000049969703,0.16995947],"study_design_scores_gemma":[0.00041810263,0.0002749733,0.000083224724,0.00063712744,0.0000400812,0.00011776074,0.0000013754716,0.99074465,0.00036802446,0.0069268127,0.000090302616,0.00029753763],"about_ca_topic_score_codex":0.000023669474,"about_ca_topic_score_gemma":0.00004396275,"teacher_disagreement_score":0.6687495,"about_ca_system_score_codex":0.00065750926,"about_ca_system_score_gemma":0.0013126853,"threshold_uncertainty_score":0.99997056},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012503699,0.000233293,0.99502385,0.00007790562,0.0010105947,0.00061266904,0.0000018819666,0.00010303162,0.0016864119],"genre_scores_gemma":[0.62342936,0.0000062620124,0.37536883,0.00011433435,0.00022814539,0.000012747471,8.780973e-7,0.00003009556,0.0008093026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958301,0.000052927062,0.0006883699,0.0013210541,0.0015502825,0.00055722235],"domain_scores_gemma":[0.9974422,0.00039695756,0.0005084456,0.0011254175,0.00041713822,0.00010982719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018891857,0.0004639104,0.00062796625,0.0005850952,0.00018571816,0.00027619718,0.0027348108,0.00020807977,0.00000822387],"category_scores_gemma":[0.00015762939,0.00040806274,0.00017457016,0.00036679092,0.00033951082,0.00032862596,0.0011710852,0.00071614777,0.000017839422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017656946,0.000021853995,0.000026273387,0.000079922516,0.000008383254,0.000012063034,0.0012489293,0.71821177,0.00043804193,0.21248896,2.7139308e-7,0.06746174],"study_design_scores_gemma":[0.00017836175,0.00033921248,0.000053494186,0.001463021,0.00000893977,0.000014511304,2.258617e-7,0.84835553,0.0009776856,0.14818041,0.000019997344,0.00040863227],"about_ca_topic_score_codex":0.0000274345,"about_ca_topic_score_gemma":0.000012435811,"teacher_disagreement_score":0.62217903,"about_ca_system_score_codex":0.00061176525,"about_ca_system_score_gemma":0.0010773744,"threshold_uncertainty_score":0.9998371},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027164712,0.0037490486,0.98009974,0.007110708,0.0058582313,0.0012374672,0.000015632637,0.000498041,0.0011594986],"genre_scores_gemma":[0.34151205,0.0002259393,0.6522076,0.0044634202,0.0012387435,0.000032099844,0.000022318922,0.00006921968,0.00022859074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922229,0.0002178777,0.001961016,0.003009898,0.0010214669,0.0015668531],"domain_scores_gemma":[0.99152994,0.0037999842,0.00075394625,0.0022180506,0.0011229293,0.0005751673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0044542155,0.0010259375,0.0016262392,0.001291767,0.0007165829,0.00085564,0.0047812616,0.0009657131,0.000012506314],"category_scores_gemma":[0.0013907631,0.0008714176,0.0005808478,0.00095402636,0.00070007436,0.0006729562,0.0013296783,0.001783812,0.00007628593],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025626992,0.00009301648,0.00021644589,0.00025062345,0.000009867468,0.000069684604,0.0008747768,0.00052422716,0.000012305274,0.0083951,0.0002404254,0.9892879],"study_design_scores_gemma":[0.0011218042,0.0015355026,0.00096250174,0.0030068182,0.000024540155,0.000087332446,0.0000025102759,0.86848825,0.00039877385,0.11410837,0.009010535,0.0012530362],"about_ca_topic_score_codex":0.00006275285,"about_ca_topic_score_gemma":0.002192422,"teacher_disagreement_score":0.98803484,"about_ca_system_score_codex":0.0006183601,"about_ca_system_score_gemma":0.005282727,"threshold_uncertainty_score":0.9993737},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036325483,0.000019707953,0.99215704,0.0026885583,0.0002824045,0.00096194417,9.231491e-7,0.0002376342,0.00001924791],"genre_scores_gemma":[0.40219295,0.0000025285974,0.59681386,0.0008653801,0.00006765613,0.00004533281,0.0000040483574,0.0000067618153,0.000001489092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974785,0.00007918906,0.00038043942,0.0007849309,0.0008296957,0.0004472582],"domain_scores_gemma":[0.9979444,0.00051995297,0.00023255292,0.0007195606,0.00043975702,0.00014373493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010712352,0.0002009287,0.00020514098,0.00049971015,0.0002465796,0.00095602253,0.00131448,0.00008370623,0.00001575592],"category_scores_gemma":[0.00060823926,0.00015966706,0.000037598842,0.001701911,0.0003696663,0.002152727,0.00023496585,0.00020711143,0.000008460109],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008548944,0.00010209089,0.0007991503,0.000055799203,0.0000069127104,0.000015572003,0.0012171546,0.005245003,0.08481598,0.0011006499,0.00008942916,0.90654373],"study_design_scores_gemma":[0.00034296192,0.0002188316,0.0016915414,0.000050759496,0.0000030821018,0.000027145761,4.6851213e-7,0.77130216,0.21030335,0.015854044,0.0000045064016,0.00020117016],"about_ca_topic_score_codex":0.00017205748,"about_ca_topic_score_gemma":0.000040522245,"teacher_disagreement_score":0.90634257,"about_ca_system_score_codex":0.0001736652,"about_ca_system_score_gemma":0.0002722042,"threshold_uncertainty_score":0.9218947},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008574215,0.0003891334,0.99127775,0.0012601668,0.001020474,0.0002963358,0.00019432754,0.00022776521,0.005325482],"genre_scores_gemma":[0.0019496136,0.00012661042,0.9935424,0.0014260793,0.0007632495,0.0000054343823,0.00019909372,0.000046810816,0.0019407514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99510133,0.000021700933,0.00042046842,0.0024014055,0.0012450487,0.0008100337],"domain_scores_gemma":[0.9949122,0.0003001476,0.00026427166,0.004191811,0.00015238817,0.00017918911],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009981625,0.0005670215,0.00050342863,0.0007207176,0.0002858143,0.000812397,0.01129107,0.0001713939,0.000035371584],"category_scores_gemma":[0.0000557871,0.0004604174,0.000049751274,0.0008954011,0.00066073716,0.0022655118,0.006923625,0.000578329,0.00006321526],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037632715,0.000023519207,0.00009142369,0.000026867847,0.00002178287,0.0004831954,0.00013072058,0.0019237385,0.000004481988,0.0055415267,0.00089483144,0.99085414],"study_design_scores_gemma":[0.0005465569,0.0003118289,0.00014409408,0.00072018546,0.000030215791,0.00019114859,4.098031e-7,0.81922895,0.000118408076,0.022097427,0.1551746,0.001436207],"about_ca_topic_score_codex":0.000021290114,"about_ca_topic_score_gemma":0.00015830535,"teacher_disagreement_score":0.98941797,"about_ca_system_score_codex":0.00013359156,"about_ca_system_score_gemma":0.00037868702,"threshold_uncertainty_score":0.99978477},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007340729,0.002045644,0.99387723,0.00075175206,0.0015586338,0.0010748532,0.000011779063,0.0001951402,0.0004115718],"genre_scores_gemma":[0.9401205,0.00021847896,0.05634455,0.0024148377,0.00054138136,0.000042348787,0.000016998512,0.000047903588,0.00025295446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669546,0.00005059766,0.00052664505,0.0014455138,0.00054068025,0.0007411142],"domain_scores_gemma":[0.9970436,0.0013605679,0.0003522591,0.0006583668,0.00037190257,0.00021326456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010930023,0.0005666195,0.00061314146,0.00048559997,0.00030859563,0.00041498378,0.0010596699,0.00052672543,0.0000076024817],"category_scores_gemma":[0.000021572785,0.0005351748,0.00013139717,0.0003064869,0.00080727955,0.00047274976,0.00021133383,0.00065963395,0.000008474052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043417273,0.000013456267,0.000009715806,0.00001030047,0.000025121242,0.000014633678,0.00007211038,0.124367215,0.000010625819,0.09277844,0.0000050969124,0.7826499],"study_design_scores_gemma":[0.0011037259,0.00027514886,0.00025931935,0.00026444768,0.000031140895,0.000047953672,3.3328226e-7,0.9278884,0.000007756817,0.06898035,0.0005836615,0.00055777706],"about_ca_topic_score_codex":0.0000067257934,"about_ca_topic_score_gemma":0.00016247094,"teacher_disagreement_score":0.94004714,"about_ca_system_score_codex":0.00027896962,"about_ca_system_score_gemma":0.00024291637,"threshold_uncertainty_score":0.99970996},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019565321,0.00023922675,0.9970924,0.00047657095,0.00034583992,0.0010341833,0.00000604803,0.00034468903,0.00044142758],"genre_scores_gemma":[0.1588946,0.000054554097,0.84041214,0.00035660702,0.00013376941,0.00008231107,0.00000635624,0.00003255865,0.000027126915],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997254,0.000020556543,0.0004281225,0.0013079789,0.0004148654,0.00057447],"domain_scores_gemma":[0.9983142,0.00020596899,0.0002508811,0.0009181383,0.00019723772,0.00011359343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081769656,0.00046427042,0.0004037382,0.00083480275,0.000361601,0.0005149308,0.0017309383,0.00033085918,0.0000018115876],"category_scores_gemma":[0.000038647977,0.00041985873,0.00012350215,0.0003459253,0.00068599876,0.00082583155,0.0008819678,0.0005136429,0.0000012842942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023576638,0.000049296515,0.00004040208,0.00053199404,0.000026564281,0.000118513795,0.0030416881,0.0014125318,0.019614115,0.2944666,0.000012008065,0.6806627],"study_design_scores_gemma":[0.00020379198,0.00014170543,0.000016007838,0.000993957,0.0000094670795,0.00011046362,1.2100207e-7,0.0485719,0.05475948,0.89379793,0.0008115593,0.0005836038],"about_ca_topic_score_codex":0.0000069109633,"about_ca_topic_score_gemma":0.0000065536833,"teacher_disagreement_score":0.6800791,"about_ca_system_score_codex":0.00020437998,"about_ca_system_score_gemma":0.00019049205,"threshold_uncertainty_score":0.9998253},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004164807,0.0009721681,0.984225,0.0015386592,0.0028670125,0.00027125617,0.000004870996,0.0003384818,0.009740902],"genre_scores_gemma":[0.031223297,0.00008825071,0.9633927,0.0027177911,0.0015807615,0.0000083680825,0.0000032611877,0.00004579169,0.00093982456],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950795,0.0000319788,0.00061984564,0.001962643,0.001312626,0.0009934003],"domain_scores_gemma":[0.996846,0.00044354185,0.000268036,0.0019687947,0.00021098237,0.00026262493],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010030473,0.0006658649,0.00062555564,0.0012521741,0.00052988355,0.001130663,0.0057135215,0.0003592014,0.00006387063],"category_scores_gemma":[0.00006402631,0.0006542353,0.00024347803,0.00096596207,0.0010752415,0.00094496686,0.0024681205,0.0012398638,0.000080129335],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018274674,0.000023855706,0.000012133875,0.000016951493,0.000008722234,0.00006854819,0.00027538015,0.0077029043,0.000055610006,0.18213649,0.00003898311,0.8096586],"study_design_scores_gemma":[0.00022505001,0.00012980321,0.00006306035,0.00033794195,0.0000061230003,0.00016201995,5.8589638e-8,0.45624155,0.00069911155,0.5125263,0.028718447,0.00089054386],"about_ca_topic_score_codex":0.000024237468,"about_ca_topic_score_gemma":0.000078587604,"teacher_disagreement_score":0.80876803,"about_ca_system_score_codex":0.00039837288,"about_ca_system_score_gemma":0.0005742502,"threshold_uncertainty_score":0.99990624},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001225626,0.0002206376,0.9934254,0.0015104718,0.0014006554,0.00043264462,0.0000015737498,0.00022075807,0.0026652864],"genre_scores_gemma":[0.23488922,0.000080051155,0.7563328,0.004451168,0.0025734107,0.00010370427,0.00000893949,0.00010036329,0.0014603176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968728,0.000018997021,0.0003688101,0.0013174731,0.0006771154,0.0007448075],"domain_scores_gemma":[0.99733025,0.00032294524,0.00012296141,0.0018086703,0.00012317339,0.00029201695],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005349241,0.00042447372,0.0002942437,0.00028284782,0.0005419433,0.0011393859,0.005093843,0.00016651717,0.0000020699179],"category_scores_gemma":[0.000031333257,0.00031483412,0.00009457129,0.0008654994,0.00023457687,0.0004546382,0.0011648773,0.00087292766,0.000019422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015935817,0.000016183514,0.000006737437,0.0000054648754,0.00000374342,0.00000976112,0.00023002956,0.30490366,0.00013270385,0.0823513,0.00008789111,0.6122509],"study_design_scores_gemma":[0.00006746115,0.000062197985,0.000054004835,0.000042060296,0.0000028162451,0.00006839395,9.40232e-8,0.9703699,0.00012084672,0.017476656,0.011324154,0.00041143727],"about_ca_topic_score_codex":0.000017599154,"about_ca_topic_score_gemma":0.000024128969,"teacher_disagreement_score":0.6654662,"about_ca_system_score_codex":0.00011911147,"about_ca_system_score_gemma":0.00012686034,"threshold_uncertainty_score":0.9999304},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038194656,0.00018077846,0.9678227,0.01838949,0.0024594392,0.0007679589,0.000016743123,0.0012685037,0.00871248],"genre_scores_gemma":[0.14807884,0.00002206154,0.82573366,0.010165549,0.0006430364,0.00005139654,0.000014062933,0.00011528683,0.015176117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99174255,0.000065960136,0.0010291891,0.0019526333,0.0032623287,0.0019473366],"domain_scores_gemma":[0.9927864,0.00086177513,0.0004171711,0.00422954,0.001241636,0.00046348583],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0024902374,0.0010504313,0.0010184958,0.0024199772,0.0006224863,0.0016255889,0.013054463,0.000658273,0.0000892986],"category_scores_gemma":[0.00061471487,0.001024013,0.00021909943,0.0019680853,0.0009159609,0.00090633525,0.008475116,0.002069702,0.000576308],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076126034,0.00006425069,0.0004235101,0.000049349455,0.00003578795,0.0003281143,0.0066843247,0.07139975,0.00007921953,0.032036357,0.010409007,0.8784827],"study_design_scores_gemma":[0.0006535248,0.0010546441,0.00059400435,0.001641704,0.000033735927,0.00044212767,0.00000993175,0.42245385,0.003093889,0.1896894,0.37561494,0.0047182487],"about_ca_topic_score_codex":0.00010740241,"about_ca_topic_score_gemma":0.0003521317,"teacher_disagreement_score":0.87376446,"about_ca_system_score_codex":0.0006075003,"about_ca_system_score_gemma":0.00034756717,"threshold_uncertainty_score":0.99954414},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007873828,0.0005362256,0.9838545,0.0011535655,0.0011593318,0.0002767924,0.000008886329,0.00041590608,0.012516101],"genre_scores_gemma":[0.24351902,0.000059603142,0.74006987,0.011373091,0.0020491749,0.00001584443,0.00004875142,0.000119442746,0.0027452207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564403,0.000067098765,0.00056134147,0.0017512849,0.0011258171,0.00085042196],"domain_scores_gemma":[0.9963931,0.00056480424,0.00032635368,0.002260633,0.0002162719,0.00023882574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011750057,0.0006505076,0.0007011768,0.00058417965,0.0003416094,0.0007346688,0.0052277218,0.00035581374,0.000115867006],"category_scores_gemma":[0.00008455982,0.0005561697,0.0001423447,0.00066642964,0.00089753495,0.0004054924,0.0018252566,0.0007362316,0.0001816617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033233216,0.000019328723,0.0000169296,0.000041683765,0.000014194524,0.00020853445,0.00033241123,0.0029502804,0.0005148026,0.30627844,0.0006039049,0.68901616],"study_design_scores_gemma":[0.0004157885,0.00019931982,0.00027086795,0.00044459137,0.000012474549,0.00025531137,3.1186212e-7,0.5505788,0.0021515226,0.407725,0.036646552,0.0012994441],"about_ca_topic_score_codex":0.000046506495,"about_ca_topic_score_gemma":0.00005486145,"teacher_disagreement_score":0.6877167,"about_ca_system_score_codex":0.00020457931,"about_ca_system_score_gemma":0.00033325228,"threshold_uncertainty_score":0.999689},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006925931,0.0003722708,0.99214375,0.00014428364,0.0026833757,0.0034137927,0.0000033875874,0.00021422574,0.00033234194],"genre_scores_gemma":[0.94289815,0.00004196213,0.054236323,0.0008437342,0.0016693239,0.00020390183,0.000010205905,0.0000649499,0.00003144666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99450976,0.00010655426,0.0009936307,0.0021963886,0.000933918,0.001259767],"domain_scores_gemma":[0.99701816,0.00038509245,0.00043502127,0.0017076376,0.00019944551,0.00025465424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015586412,0.0007747017,0.0008348685,0.0006714209,0.00033022065,0.0007566196,0.0032878346,0.00081731164,0.000022717424],"category_scores_gemma":[0.000023611614,0.00074852124,0.00019447382,0.0013681051,0.0007197688,0.0010269252,0.0015268319,0.002086115,0.0000039293877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010670584,0.000034404547,0.0004903703,0.00002223653,0.0000043231707,0.0000748518,0.0000994006,0.77333796,0.00000390787,0.004376897,0.000003098749,0.22154187],"study_design_scores_gemma":[0.00045655895,0.0001510935,0.0007507069,0.00081132364,0.0000055290557,0.000059096754,6.6346196e-8,0.956159,0.00002055001,0.040906094,0.00004422185,0.00063579436],"about_ca_topic_score_codex":0.0001512534,"about_ca_topic_score_gemma":0.0002558167,"teacher_disagreement_score":0.94220555,"about_ca_system_score_codex":0.0010080099,"about_ca_system_score_gemma":0.00056060747,"threshold_uncertainty_score":0.9994966},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5674793,0.0000022345296,0.432124,0.00009370296,0.00016276339,0.00012487508,0.000003976553,0.0000057565503,0.0000033932047],"genre_scores_gemma":[0.8840323,7.487741e-7,0.11585362,0.00007331081,0.000032893036,0.0000024452781,8.078258e-7,0.0000031268535,7.2897683e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992913,0.000011799272,0.00020254662,0.00015994407,0.00025170037,0.00008270644],"domain_scores_gemma":[0.9992694,0.000115229945,0.0002014195,0.00027939564,0.00011861197,0.000015920114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012651375,0.00005516858,0.00008847731,0.00005738833,0.000082982886,0.000007711007,0.00022693147,0.000036812213,0.000004248097],"category_scores_gemma":[0.0000709764,0.000033820957,0.000037987913,0.00044683673,0.0005528453,0.00006856317,0.000086171305,0.00020253906,6.2888326e-8],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009246034,0.000026321004,0.30714113,0.000009965567,9.433641e-7,1.9776205e-7,0.000057511257,0.010155139,0.68035036,0.000036562084,6.6284787e-7,0.0022119621],"study_design_scores_gemma":[0.00010612216,0.000027917662,0.42319465,0.000030249272,0.0000037337807,0.000052145624,3.2164576e-7,0.0659576,0.5096777,0.00092262874,0.0000042868364,0.000022669721],"about_ca_topic_score_codex":0.000046402845,"about_ca_topic_score_gemma":0.000019379753,"teacher_disagreement_score":0.31655303,"about_ca_system_score_codex":0.000025360634,"about_ca_system_score_gemma":0.00009430197,"threshold_uncertainty_score":0.20369816},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009133333,0.00006400019,0.9948146,0.003029119,0.00038878774,0.0001954009,2.6369713e-7,0.0003501255,0.00024441117],"genre_scores_gemma":[0.4112666,0.0000073098677,0.58608544,0.0025694459,0.0000640346,0.0000029840742,6.823577e-7,0.000002281419,0.0000012401174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767137,0.00006740755,0.00033473823,0.00071202806,0.0007817155,0.00043275792],"domain_scores_gemma":[0.9986393,0.00019548103,0.000124773,0.0007376036,0.0001545828,0.00014825643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001071964,0.00016094946,0.00016076831,0.0006459303,0.00017220306,0.00059843546,0.0018688912,0.00006531218,0.00000776378],"category_scores_gemma":[0.00040211147,0.00014372777,0.00003949204,0.003956788,0.00026663247,0.001658835,0.00020653494,0.00025343284,0.00002620729],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001186461,0.000040679664,0.00005810193,0.0000029740695,5.9485706e-7,0.000029843884,0.00018561335,0.00043564677,0.012326854,0.00052307383,0.00011494184,0.9862805],"study_design_scores_gemma":[0.00029988444,0.0003181669,0.0068593966,0.000047282792,0.0000015722344,0.00007259845,2.3247462e-7,0.4790499,0.44399402,0.06898229,0.000053998116,0.0003206888],"about_ca_topic_score_codex":0.00001929508,"about_ca_topic_score_gemma":0.0000045204188,"teacher_disagreement_score":0.9859598,"about_ca_system_score_codex":0.00012495392,"about_ca_system_score_gemma":0.00017050606,"threshold_uncertainty_score":0.5861048},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024677098,0.000764867,0.9891703,0.00071855757,0.0043077925,0.00042921596,0.0000018337756,0.00027358648,0.004309158],"genre_scores_gemma":[0.021928143,0.00013116167,0.9759985,0.00102324,0.00063566887,0.000020249192,0.0000034185189,0.000033482873,0.00022614372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608344,0.0000658098,0.0005515994,0.0013538792,0.0011080357,0.0008372077],"domain_scores_gemma":[0.99695915,0.00024654772,0.00039291126,0.0018256186,0.00036137074,0.00021442612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016627294,0.0005495948,0.00048283872,0.0008261402,0.00033479754,0.0004717272,0.0035343317,0.00047818254,0.000056917084],"category_scores_gemma":[0.00029261678,0.00049865857,0.00013117766,0.0009633332,0.00058898603,0.001459779,0.0012169416,0.00092430407,0.00019188944],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004302468,0.000028348673,0.000027856178,0.000051274237,0.0000072334656,0.000011312508,0.0005834074,0.004979519,0.00007618457,0.08658636,0.000013812803,0.9076304],"study_design_scores_gemma":[0.00026165962,0.00021603898,0.00090548676,0.00029523394,0.000019350482,0.00018273293,2.2724231e-7,0.7098814,0.0023243017,0.27391556,0.010898215,0.0010997634],"about_ca_topic_score_codex":0.000029598468,"about_ca_topic_score_gemma":0.00005651421,"teacher_disagreement_score":0.9065306,"about_ca_system_score_codex":0.00059666554,"about_ca_system_score_gemma":0.00045508533,"threshold_uncertainty_score":0.9997465},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008364613,0.0031652434,0.98866826,0.00030407924,0.002950437,0.0007713538,0.0000054333627,0.00007765696,0.003973905],"genre_scores_gemma":[0.8709195,0.00034145787,0.12635624,0.00054653734,0.0008412696,0.000049150945,0.000003665981,0.000040664145,0.0009014675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622935,0.00011581156,0.0009842803,0.0009017177,0.0009872371,0.0007816289],"domain_scores_gemma":[0.99424124,0.0027828054,0.0006700498,0.0017481667,0.00030111862,0.00025662806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033689255,0.00050497975,0.0010533051,0.0003423669,0.0004993957,0.0004476338,0.0029439244,0.00033625637,0.000026174515],"category_scores_gemma":[0.000054387056,0.0003289426,0.00034546127,0.00042851307,0.002456446,0.00038160142,0.0012452416,0.00082034187,0.000021376323],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001509255,0.000029546509,0.000012259566,0.000013093277,0.000018385377,0.0007357598,0.00046742553,0.00040866403,0.000004912744,0.04163691,0.000026947459,0.95649517],"study_design_scores_gemma":[0.008148959,0.00010068299,0.000009660579,0.0003228165,0.000108061264,0.0028983955,5.142411e-7,0.9170974,0.0001403968,0.068645455,0.0016836378,0.00084400654],"about_ca_topic_score_codex":0.000040297877,"about_ca_topic_score_gemma":0.000053810036,"teacher_disagreement_score":0.95565116,"about_ca_system_score_codex":0.000110766094,"about_ca_system_score_gemma":0.0004895731,"threshold_uncertainty_score":0.99991626},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039198218,0.00032596505,0.9850591,0.009549318,0.0025388894,0.000979376,0.00002058384,0.000848832,0.00028595718],"genre_scores_gemma":[0.081703424,0.000011257421,0.9164835,0.0013410273,0.00030744143,0.00004735499,0.000028585413,0.000050098137,0.000027321768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948887,0.000032440043,0.0006696337,0.0023634576,0.0011084056,0.0009373591],"domain_scores_gemma":[0.9856365,0.0011873698,0.00053283677,0.011972128,0.00051791355,0.00015325537],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0017098051,0.0006739423,0.0005735638,0.001224398,0.0004957715,0.0009293599,0.050512403,0.000748765,0.000009196476],"category_scores_gemma":[0.004189992,0.00063685625,0.00015114076,0.00095989817,0.0008013553,0.00072882,0.049482543,0.0013706256,0.000029427913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024682618,0.00014882078,0.0001801228,0.0008374884,0.00002722947,0.00004540519,0.00044653195,0.060337998,0.0037241767,0.0128453905,0.00029434488,0.9210878],"study_design_scores_gemma":[0.00025443605,0.00010011173,0.00009973062,0.0006170384,0.000008337762,0.000015016166,1.0382221e-7,0.80441815,0.006270229,0.18544254,0.0021628058,0.0006115424],"about_ca_topic_score_codex":0.000027930499,"about_ca_topic_score_gemma":0.000072794915,"teacher_disagreement_score":0.92047626,"about_ca_system_score_codex":0.00038672128,"about_ca_system_score_gemma":0.0008331558,"threshold_uncertainty_score":0.9996083},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013033699,0.00017922526,0.9935431,0.0017766939,0.00067416026,0.00043217468,0.0000018049025,0.00016666728,0.0019228372],"genre_scores_gemma":[0.8201481,0.000017168853,0.17684636,0.0020871542,0.0006951635,0.000013131049,0.0000069550556,0.000031410687,0.00015451995],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970965,0.000061131075,0.00053860655,0.001067401,0.00082012214,0.00041625934],"domain_scores_gemma":[0.99730694,0.00091172056,0.00044901948,0.0010781054,0.0001813577,0.00007284793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001122932,0.00041816666,0.00042262822,0.00057661085,0.00023785768,0.00020261099,0.0027561178,0.00017545691,0.000010197347],"category_scores_gemma":[0.0002809696,0.0002830353,0.00013433392,0.0004924296,0.00054183305,0.00011243778,0.000727653,0.0005745732,0.000010440351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007442473,0.0000145458735,0.000012313356,0.000032858476,0.0000067350584,0.00000554558,0.00048232416,0.029607413,0.0006582445,0.1977502,0.000116288524,0.7713061],"study_design_scores_gemma":[0.000098190365,0.00025454923,0.00015260582,0.00038188172,0.000005454683,0.000014839407,1.00852525e-7,0.37526804,0.017673915,0.6048805,0.000858472,0.0004114359],"about_ca_topic_score_codex":0.000020188088,"about_ca_topic_score_gemma":0.000025737176,"teacher_disagreement_score":0.8188448,"about_ca_system_score_codex":0.00010107497,"about_ca_system_score_gemma":0.00020310527,"threshold_uncertainty_score":0.99996215},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011017207,0.0008213528,0.9802152,0.00007496058,0.001178742,0.0002901927,0.000022385793,0.000028046694,0.006351946],"genre_scores_gemma":[0.9474432,0.00003566593,0.049417004,0.000980237,0.0013048031,0.0000010929733,0.00009569324,0.000051714822,0.00067061826],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788696,0.000011639459,0.00030192905,0.00087456586,0.00041067804,0.0005142196],"domain_scores_gemma":[0.99887985,0.00004063626,0.00016578435,0.0006773785,0.00010832206,0.00012801468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030873928,0.0004091594,0.0003109262,0.00027802025,0.00016118091,0.000107950975,0.00085714203,0.000483847,0.000026694832],"category_scores_gemma":[0.00005610483,0.00036354543,0.00012429705,0.00013883543,0.0005494393,0.0000089614805,0.00036341642,0.00049926376,0.000007861053],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000122999,0.000017384285,0.002129781,0.00011285226,0.00009180829,0.00018146468,0.00031793086,0.07706663,0.04703746,0.005203353,0.00010357121,0.86761475],"study_design_scores_gemma":[0.003411793,0.0026112492,0.011323405,0.0013505082,0.00014058765,0.0017521587,0.0000017131454,0.25555006,0.27672976,0.4011638,0.03777772,0.008187268],"about_ca_topic_score_codex":0.000016543176,"about_ca_topic_score_gemma":0.00012209632,"teacher_disagreement_score":0.936426,"about_ca_system_score_codex":0.00009882459,"about_ca_system_score_gemma":0.00023097666,"threshold_uncertainty_score":0.9998816},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035007432,0.00063760043,0.9942542,0.0001399579,0.0018643631,0.0009624902,0.000024573135,0.00023643758,0.0015303573],"genre_scores_gemma":[0.16609587,0.00018087677,0.828825,0.0033884428,0.0008245957,0.00006395827,0.00023581699,0.00011614508,0.00026928633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932335,0.000064299085,0.0009429852,0.002952522,0.0015184326,0.0012882664],"domain_scores_gemma":[0.9941435,0.00065552426,0.00041522447,0.0044166646,0.000120969875,0.00024813405],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002753732,0.0006909745,0.0006530035,0.0014098923,0.00022562945,0.0006780862,0.010413817,0.00031277767,0.00003902422],"category_scores_gemma":[0.00010310408,0.0007050474,0.0000932567,0.0016575714,0.00041486428,0.0010384036,0.008660657,0.0009243432,0.00005642375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005465278,0.00004307313,0.00042343567,0.000044630233,0.000013671026,0.000696412,0.00025912636,0.17279989,0.000005577163,0.0011495843,0.00027098545,0.82428813],"study_design_scores_gemma":[0.00042232606,0.00010969144,0.00041235343,0.0006407645,0.000010679654,0.000027137894,4.8823404e-7,0.9794716,0.000090312016,0.0047899643,0.013194962,0.00082966906],"about_ca_topic_score_codex":0.00006499847,"about_ca_topic_score_gemma":0.00049500586,"teacher_disagreement_score":0.8234585,"about_ca_system_score_codex":0.0009285371,"about_ca_system_score_gemma":0.00045098338,"threshold_uncertainty_score":0.9995401},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036759692,0.00038359337,0.992767,0.00018769992,0.003061554,0.0016166137,0.0000209948,0.0001938291,0.0014011578],"genre_scores_gemma":[0.29593578,0.00001252794,0.7011924,0.00064114283,0.0014271344,0.00012441803,0.000028216948,0.000066970075,0.00057140435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951118,0.00008850789,0.0008607486,0.0018432661,0.0013401222,0.00075554603],"domain_scores_gemma":[0.99688065,0.00043446105,0.0006692135,0.0012824953,0.0005527993,0.00018039055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017824048,0.00060807297,0.0007301985,0.0006658644,0.00055739447,0.0006324905,0.0023833902,0.00030680487,0.000009431839],"category_scores_gemma":[0.000092212445,0.00055441505,0.00020581775,0.0004582206,0.00019505808,0.00046534406,0.0007023042,0.00040015928,0.000042692063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016542655,0.000082292936,0.00012308141,0.00053812354,0.00010022829,0.00010336468,0.0033790115,0.43400657,0.0046608034,0.056419395,0.00011409836,0.5004565],"study_design_scores_gemma":[0.00058305316,0.00015848225,0.00005516894,0.0007045839,0.000014485059,0.000059836533,4.6374862e-7,0.98478764,0.0007457903,0.011088127,0.0012150554,0.00058731396],"about_ca_topic_score_codex":0.000047098165,"about_ca_topic_score_gemma":0.000050988772,"teacher_disagreement_score":0.5507811,"about_ca_system_score_codex":0.0008078317,"about_ca_system_score_gemma":0.00037507695,"threshold_uncertainty_score":0.9996907},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006610728,0.0011078914,0.98328424,0.00090108305,0.0026126134,0.00032019702,0.000010427937,0.0006279892,0.011069482],"genre_scores_gemma":[0.43447912,0.00013249251,0.5590446,0.0039921505,0.0012549615,0.000012706461,0.000015747208,0.000095126474,0.0009730668],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956946,0.00004461238,0.00058844197,0.0015194579,0.0010733975,0.0010794875],"domain_scores_gemma":[0.99647015,0.000468189,0.00032465495,0.0022633062,0.00015346648,0.00032020497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013395562,0.0006687222,0.00064767344,0.00078626163,0.00027657178,0.0006327726,0.0049139005,0.0004136553,0.00009776044],"category_scores_gemma":[0.00007771972,0.00060180714,0.00017762955,0.00056368543,0.0011526312,0.00093708537,0.0019918953,0.0008339756,0.00027066626],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022259833,0.000032377535,0.000014279187,0.00002645872,0.000010957986,0.000098882,0.0003858946,0.00091175153,0.00016514184,0.14899936,0.000036780308,0.8493159],"study_design_scores_gemma":[0.00052615575,0.00017431301,0.0002065314,0.00047770317,0.000016948878,0.0004901881,1.9700066e-7,0.44840705,0.001535175,0.54127264,0.0054786606,0.001414454],"about_ca_topic_score_codex":0.00001999121,"about_ca_topic_score_gemma":0.000013888472,"teacher_disagreement_score":0.8479014,"about_ca_system_score_codex":0.00026962924,"about_ca_system_score_gemma":0.0005681086,"threshold_uncertainty_score":0.9996433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000048518323,0.000044029166,0.9563362,0.0024130938,0.0003624613,0.00076391525,0.000004093799,0.00042510786,0.03964622],"genre_scores_gemma":[0.0033408394,0.000015001617,0.99087554,0.004245265,0.00026419168,0.000019496463,0.000012566287,0.00002170276,0.0012053702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577016,0.000054677246,0.0005830591,0.0016361849,0.0013518219,0.00060412154],"domain_scores_gemma":[0.99742866,0.00022909389,0.0002888438,0.0013852783,0.00029668582,0.00037142794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012109505,0.00049302314,0.0005044889,0.00079992664,0.00018197164,0.0008371688,0.0029311897,0.00029536855,0.000018980694],"category_scores_gemma":[0.00020152364,0.00040952303,0.00010851257,0.00077375805,0.00075414276,0.0007520953,0.00060041226,0.0007013562,0.00004748854],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005177942,0.00004539958,0.000004155073,0.000028547904,0.000004114407,0.000042370877,0.0006200752,0.00045618703,0.0013879145,0.00522457,0.0004477361,0.99173373],"study_design_scores_gemma":[0.0016167171,0.001505459,0.00036839762,0.0017300544,0.00003878348,0.00067458785,0.0000019749605,0.56747293,0.0816818,0.33507207,0.0058323652,0.0040048514],"about_ca_topic_score_codex":0.000017834745,"about_ca_topic_score_gemma":0.000018653076,"teacher_disagreement_score":0.9877289,"about_ca_system_score_codex":0.00029541113,"about_ca_system_score_gemma":0.00052952196,"threshold_uncertainty_score":0.99983567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000317675,0.0004432066,0.99176514,0.00096180046,0.0010249371,0.0004651976,0.000005479282,0.00010871917,0.0049078343],"genre_scores_gemma":[0.63635606,0.00005100612,0.3597297,0.0018354509,0.0015667265,0.00003069373,0.000010467838,0.00004369891,0.000376201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693435,0.00002613602,0.00060846144,0.0011724454,0.000645581,0.00061304093],"domain_scores_gemma":[0.9972579,0.00048064862,0.0003522778,0.0016037006,0.00018810283,0.00011737236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005304293,0.00038188696,0.0004919125,0.00019493073,0.00019283497,0.00019993623,0.0028778664,0.00023577656,0.000022292279],"category_scores_gemma":[0.000016803462,0.00034251538,0.00016542763,0.00069325493,0.0006284196,0.0003247857,0.0011413731,0.0006631125,0.000008810634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004360515,0.000040862404,0.00019317122,0.000038898925,0.000007182884,0.0000211474,0.00008443862,0.34043056,0.0001254239,0.030775992,0.00067141425,0.6276066],"study_design_scores_gemma":[0.00011962876,0.000100401696,0.00053701585,0.00013077928,0.0000062826325,0.00001805786,1.8528658e-8,0.855235,0.0005126345,0.14074548,0.0021610647,0.00043366099],"about_ca_topic_score_codex":0.000053865973,"about_ca_topic_score_gemma":0.0001392842,"teacher_disagreement_score":0.63603836,"about_ca_system_score_codex":0.00008491584,"about_ca_system_score_gemma":0.00020035647,"threshold_uncertainty_score":0.99990267},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012579974,0.0048068757,0.9449658,0.0008007534,0.008791102,0.00060237665,0.00003537258,0.000015815436,0.027401967],"genre_scores_gemma":[0.96983534,0.0014595836,0.020978877,0.0026370233,0.0006478928,0.000020724172,0.000019952267,0.000053429776,0.0043471656],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985327,0.000014761238,0.0002003286,0.00076755456,0.00019517302,0.00028946094],"domain_scores_gemma":[0.99921197,0.000041884,0.00010607593,0.00048933335,0.00008999631,0.00006074045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019121298,0.0002733931,0.0002168754,0.00010746556,0.00019385999,0.00005433945,0.00042777142,0.00017954112,0.000008645254],"category_scores_gemma":[0.000046229536,0.00023993684,0.000080744045,0.000093082774,0.00046410938,9.346503e-7,0.00015801814,0.00021539116,0.00000935405],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012446812,0.00022639145,0.003129447,0.00009926691,0.00018925894,0.000084859974,0.0006439543,0.08634245,0.06297543,0.01510139,0.0017256845,0.8293574],"study_design_scores_gemma":[0.0013756236,0.004407816,0.0023592426,0.0008919848,0.00007653369,0.00017794267,0.0000031818215,0.0063331253,0.11816808,0.23262893,0.629511,0.0040665143],"about_ca_topic_score_codex":0.0000101920905,"about_ca_topic_score_gemma":0.00014447384,"teacher_disagreement_score":0.95725536,"about_ca_system_score_codex":0.000058973674,"about_ca_system_score_gemma":0.00014479615,"threshold_uncertainty_score":0.978434},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010305922,0.001430297,0.93456876,0.000028565217,0.011934181,0.00047378,0.0000074105205,0.00040470567,0.05012173],"genre_scores_gemma":[0.9900991,0.000037358885,0.006603124,0.00011945355,0.00131566,0.00001812247,0.000005963836,0.0000929339,0.0017083354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983092,0.000029130444,0.00031565412,0.000493102,0.00041426363,0.0004386445],"domain_scores_gemma":[0.998847,0.00027474723,0.00006579675,0.00062670617,0.00007045291,0.00011530241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006405536,0.00038892223,0.00039560065,0.0004108681,0.00011223908,0.00019918708,0.000942879,0.00033630096,0.00021831527],"category_scores_gemma":[0.000023351316,0.0003517918,0.000108865526,0.00022499962,0.0003710104,0.00019780862,0.00015829012,0.00061387866,0.0003245007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011404168,0.000014921009,0.000025859752,0.00019219528,0.000037636863,0.000044108583,0.00053162355,0.07318626,0.00050548685,0.7924857,0.00023173037,0.13273305],"study_design_scores_gemma":[0.00024694038,0.000058287886,0.000019495092,0.00029207373,0.000010173537,0.00003472637,2.5707118e-7,0.03863168,0.0011450982,0.95457286,0.0044360394,0.0005523953],"about_ca_topic_score_codex":0.0000044271133,"about_ca_topic_score_gemma":0.0000039256297,"teacher_disagreement_score":0.98906845,"about_ca_system_score_codex":0.00013392916,"about_ca_system_score_gemma":0.00006729951,"threshold_uncertainty_score":0.9998934},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056996443,0.0034970297,0.98771304,0.0022501505,0.00053394824,0.00061242445,0.000011390857,0.00015566971,0.005169324],"genre_scores_gemma":[0.32191074,0.00075317593,0.66909677,0.006801603,0.0011229811,0.000027132082,0.000023810126,0.00005682328,0.0002069609],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99631745,0.00007136592,0.00046109123,0.0015355513,0.00093942403,0.0006751506],"domain_scores_gemma":[0.99715894,0.0006646418,0.00026854218,0.0016053938,0.00012578757,0.00017670626],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011962745,0.00056399906,0.000567315,0.0005383229,0.0004955802,0.0010886331,0.0038286317,0.00033148233,0.000009318914],"category_scores_gemma":[0.000049928385,0.00037985554,0.00017021853,0.0005810426,0.001771905,0.0006911321,0.0016922086,0.0012518263,0.000007662438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016569247,0.00002288874,0.000017512366,0.000023586856,0.000012241849,0.00003452753,0.000957397,0.0015460475,0.000018222607,0.46761093,0.00007930383,0.52966076],"study_design_scores_gemma":[0.00084923534,0.00017215381,0.0003569007,0.00026285785,0.00001774453,0.00006329048,3.688477e-7,0.100963354,0.00014397052,0.89014095,0.00631429,0.0007148734],"about_ca_topic_score_codex":0.00003333137,"about_ca_topic_score_gemma":0.00014315303,"teacher_disagreement_score":0.5289459,"about_ca_system_score_codex":0.00006612947,"about_ca_system_score_gemma":0.00020416084,"threshold_uncertainty_score":0.9999483},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003830856,0.012820821,0.98129356,0.00022598843,0.0023513185,0.00051428407,0.0000023809146,0.0002352878,0.0021732864],"genre_scores_gemma":[0.30465397,0.008845759,0.6770032,0.0057769036,0.0014314014,0.00037179096,0.000030839095,0.00032762962,0.0015584881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994213,0.00010804154,0.0008619634,0.0024659107,0.0009897545,0.0013613501],"domain_scores_gemma":[0.9963581,0.000640572,0.00037390628,0.0021759197,0.00018340879,0.00026811683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011530216,0.0008609107,0.00089176255,0.0009293076,0.0002409103,0.00070998986,0.0046136808,0.0006102776,0.000049187234],"category_scores_gemma":[0.000064473184,0.0008368118,0.00017766122,0.0014944901,0.0006447949,0.00093357026,0.0019427076,0.0017616458,0.000027217246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040952864,0.000023744984,0.00004071147,0.000017982842,0.0000070669057,0.00018266252,0.00028015845,0.4038056,0.00001387496,0.002424455,0.000023601799,0.59317607],"study_design_scores_gemma":[0.00050327304,0.00021268406,0.00020483871,0.0008949286,0.00000851929,0.00009829295,2.8653085e-7,0.96734875,0.00012655069,0.021866906,0.0074855527,0.0012493854],"about_ca_topic_score_codex":0.000017059541,"about_ca_topic_score_gemma":0.00056509767,"teacher_disagreement_score":0.59192663,"about_ca_system_score_codex":0.00058240787,"about_ca_system_score_gemma":0.00033699622,"threshold_uncertainty_score":0.99940825},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006190324,0.00006847856,0.98637015,0.00016188585,0.004384783,0.00064543705,0.000008724603,0.00019532474,0.0075461725],"genre_scores_gemma":[0.031639148,0.00002010306,0.9647628,0.0004806883,0.0010965472,0.000022429584,0.000005614441,0.00015893026,0.0018137625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672216,0.000016678541,0.00062349386,0.00092778675,0.0010888892,0.0006209685],"domain_scores_gemma":[0.9967729,0.00090612593,0.00044859532,0.0014915841,0.0002276824,0.0001531112],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006275053,0.0005871707,0.0007039688,0.00044614775,0.00022176381,0.00017372264,0.0017155734,0.00047057515,0.00009588095],"category_scores_gemma":[0.0005527109,0.0005313628,0.00012519048,0.00024748777,0.0006931624,0.0002147575,0.0007775409,0.001313182,0.00012285238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002447728,0.00025472793,0.000027530248,0.0007643008,0.00006776941,0.00030754125,0.0026503028,0.00090556446,0.0026805268,0.70324117,0.00016597865,0.2889101],"study_design_scores_gemma":[0.0003092512,0.00008596939,0.0000027360295,0.00041955695,0.000024159497,0.000030183111,1.8085534e-7,0.0029071516,0.0028224026,0.99042994,0.00242255,0.0005459051],"about_ca_topic_score_codex":0.0000033627314,"about_ca_topic_score_gemma":0.000046308603,"teacher_disagreement_score":0.28836417,"about_ca_system_score_codex":0.0002647795,"about_ca_system_score_gemma":0.00019768224,"threshold_uncertainty_score":0.9997138},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46564147,0.00052897213,0.5325122,0.00006708569,0.00045335767,0.0005202946,0.00003201128,0.00007363794,0.00017098176],"genre_scores_gemma":[0.99247575,0.000014009721,0.0073601343,0.000030244231,0.00008871813,0.000005039066,0.000012872812,0.000002763304,0.0000104827],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982098,0.00002253509,0.00045330846,0.0005732347,0.0003735821,0.00036757218],"domain_scores_gemma":[0.99926823,0.00026495516,0.00022536745,0.00011266222,0.00008106237,0.00004773204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018962089,0.0002780461,0.00041067126,0.00014978618,0.00016460285,0.00007430782,0.00075117225,0.00037533412,0.00006344991],"category_scores_gemma":[0.000039065173,0.00013609086,0.0000713705,0.00024141837,0.00039161392,0.00016812015,0.00029521648,0.00038519036,0.0000016460891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028365781,0.00007838315,0.00046110584,0.000057505214,0.000022240361,0.000042519343,0.0007312532,0.38156787,0.50352895,0.016378103,3.462518e-7,0.09710335],"study_design_scores_gemma":[0.000567408,0.00011406281,0.0012072496,0.00075537275,0.000021973703,0.000015821088,0.000008622372,0.84092814,0.013342541,0.14235868,0.000011500488,0.00066864665],"about_ca_topic_score_codex":0.00035524426,"about_ca_topic_score_gemma":0.0008170193,"teacher_disagreement_score":0.52683425,"about_ca_system_score_codex":0.00018523262,"about_ca_system_score_gemma":0.00008981148,"threshold_uncertainty_score":0.55496246},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028985287,0.0014041703,0.97568285,0.00016257232,0.0015338068,0.0005567882,0.000010532708,0.00026637758,0.017484376],"genre_scores_gemma":[0.95424217,0.00005885978,0.043401353,0.00073265744,0.0010337768,0.000014967207,0.000018956822,0.00011498008,0.0003823064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974733,0.000013053898,0.0003883399,0.00082464353,0.00055369525,0.00074693904],"domain_scores_gemma":[0.9988679,0.00015081828,0.000045914614,0.0007254687,0.000054139207,0.00015572106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040049662,0.00048341064,0.00048507444,0.0006298938,0.000054740693,0.00014605642,0.0007532004,0.00037643113,0.000029873174],"category_scores_gemma":[0.00001835417,0.000497327,0.00008565645,0.00050992705,0.00017086709,0.00014779481,0.00032736635,0.0009852368,0.00006570086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018252592,0.0000063118327,0.000049408143,0.000027730106,0.000004152055,0.00017283943,0.00022174929,0.9231054,0.00003190388,0.0003079871,0.00015448114,0.07591619],"study_design_scores_gemma":[0.00015025039,0.000039847757,0.00029979477,0.00040505858,0.000004756346,0.00004394667,4.759306e-8,0.9397842,0.0003637791,0.056258664,0.0020600755,0.0005895735],"about_ca_topic_score_codex":0.00003547518,"about_ca_topic_score_gemma":0.0014267927,"teacher_disagreement_score":0.9513436,"about_ca_system_score_codex":0.0005370963,"about_ca_system_score_gemma":0.000093674345,"threshold_uncertainty_score":0.9997478},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031464395,0.00004371905,0.994565,0.001186248,0.0029694866,0.000489712,0.000013382956,0.0003288972,0.00037209806],"genre_scores_gemma":[0.09078404,0.000025725723,0.9061076,0.00094857556,0.0012318606,0.000079049336,0.000062647676,0.00006677698,0.0006936883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968277,0.000014485705,0.0003497375,0.0012610503,0.0010774377,0.0004695759],"domain_scores_gemma":[0.99617577,0.0018649198,0.00016410208,0.001182937,0.0004906588,0.00012162251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008097302,0.00035999928,0.00030699506,0.0008898496,0.00022875606,0.0005115142,0.0033608687,0.0002419376,0.000025415844],"category_scores_gemma":[0.0010316924,0.00036260363,0.000104930376,0.00037178624,0.00025840788,0.00029252237,0.0005729723,0.000509254,0.000120682256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026469643,0.00006028914,0.00025969688,0.00014806548,0.000029103143,0.000019362775,0.00034387203,0.24807256,0.000059498987,0.20283876,0.0003368294,0.5478055],"study_design_scores_gemma":[0.0004890776,0.0003515934,0.0013090995,0.00065720227,0.00000464381,0.000022169428,3.7602206e-8,0.91389024,0.0007680996,0.05081631,0.030987235,0.00070426334],"about_ca_topic_score_codex":0.0000056252475,"about_ca_topic_score_gemma":0.000012887404,"teacher_disagreement_score":0.6658177,"about_ca_system_score_codex":0.0005030157,"about_ca_system_score_gemma":0.0002388787,"threshold_uncertainty_score":0.9998826},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021859254,0.00015019944,0.9953526,0.0015561852,0.00053396885,0.0011691502,0.000021824306,0.00016628247,0.0010279313],"genre_scores_gemma":[0.010807137,0.00002157473,0.9868465,0.0015248558,0.00023312468,0.000093219984,0.000022348166,0.000041413474,0.00040981077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642056,0.000024447187,0.00037067922,0.0017729014,0.00072295766,0.00068846904],"domain_scores_gemma":[0.9971588,0.0002985965,0.0002491417,0.0017068416,0.0003245584,0.00026202106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055709004,0.0005101575,0.0004846677,0.0006323979,0.00043962544,0.00047759613,0.0027941968,0.00027360593,0.0000030234255],"category_scores_gemma":[0.000030017558,0.00042468298,0.0000911785,0.0006296378,0.00028586277,0.0007126932,0.0010413988,0.00045684417,0.000010261181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041570733,0.000049547107,0.000006336432,0.000049806527,0.000019099483,0.000044106862,0.0006982409,0.26502094,0.00018343584,0.095285706,0.0006362635,0.63796496],"study_design_scores_gemma":[0.00032120055,0.00033111827,0.00001067515,0.0002549002,0.00001116544,0.00012412069,3.649826e-7,0.9368829,0.00042302214,0.05767029,0.0033265788,0.0006436343],"about_ca_topic_score_codex":0.000027139275,"about_ca_topic_score_gemma":0.000039032486,"teacher_disagreement_score":0.671862,"about_ca_system_score_codex":0.00026993523,"about_ca_system_score_gemma":0.00035857156,"threshold_uncertainty_score":0.9998205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006534826,0.00032034208,0.9908242,0.0035763832,0.0007287746,0.0011742101,0.000017707891,0.0002025827,0.0030904026],"genre_scores_gemma":[0.06156789,0.00009057848,0.93591726,0.0013159886,0.0003934598,0.00030810165,0.000013190068,0.00005041264,0.00034312622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974485,0.000058042944,0.00055163226,0.0011161858,0.00032257504,0.0005030627],"domain_scores_gemma":[0.9982236,0.0006371862,0.00029488915,0.0004913384,0.0002616118,0.000091379196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079374196,0.00040948173,0.0005652544,0.00063278736,0.00044859876,0.0008127548,0.0012542554,0.0002972618,0.000026990745],"category_scores_gemma":[0.00006462963,0.00038951787,0.000069476635,0.00047528037,0.0002764395,0.00088921754,0.0009640489,0.00048654916,0.0000076263195],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070032856,0.0000598604,0.00014358736,0.00010678739,0.00001953014,0.000011950164,0.0068831267,0.00009627909,0.0005838644,0.05015094,0.003010552,0.9389265],"study_design_scores_gemma":[0.0014650788,0.00072770374,0.00045649183,0.001836221,0.000009733752,0.000057579535,0.00001640532,0.5546448,0.008631511,0.37018344,0.0596475,0.002323519],"about_ca_topic_score_codex":0.00005953407,"about_ca_topic_score_gemma":0.0001296144,"teacher_disagreement_score":0.936603,"about_ca_system_score_codex":0.00023339015,"about_ca_system_score_gemma":0.00025985646,"threshold_uncertainty_score":0.9998557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041455438,0.00041839757,0.99516445,0.0014273315,0.0008710873,0.00025559505,0.000004522455,0.000109834175,0.0017073494],"genre_scores_gemma":[0.30321056,0.00027340115,0.6924903,0.0035848473,0.000254528,0.0000050393573,0.000006424041,0.000030568946,0.00014437629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974624,0.00003490559,0.00047763524,0.00083326444,0.00081133837,0.00038043963],"domain_scores_gemma":[0.9979082,0.00046423374,0.00032210784,0.0010608027,0.0001484771,0.00009617833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003748121,0.00032965033,0.00035993074,0.00029420838,0.000257363,0.0001927799,0.0021184192,0.00012411832,0.000015868505],"category_scores_gemma":[0.000029486206,0.00022769807,0.000094943265,0.0003972703,0.0010984207,0.0004988128,0.0006916075,0.00055909983,0.000008381187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008133893,0.000061663755,0.00003239967,0.00004090463,0.000023476337,0.00009601381,0.0032509658,0.047940526,0.00064639025,0.10226698,0.00013285958,0.8454997],"study_design_scores_gemma":[0.00025094807,0.00011429688,0.000085116415,0.0002453654,0.00000591325,0.00022103143,0.0000014598581,0.91579044,0.0024691555,0.0771743,0.0031860077,0.00045595036],"about_ca_topic_score_codex":0.000010230163,"about_ca_topic_score_gemma":0.000012312628,"teacher_disagreement_score":0.86784995,"about_ca_system_score_codex":0.00013264675,"about_ca_system_score_gemma":0.00048581586,"threshold_uncertainty_score":0.92852575},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006044398,0.000616563,0.9919057,0.0009396871,0.00089200854,0.0003458022,0.000028079558,0.0001939852,0.0044737463],"genre_scores_gemma":[0.5726194,0.000178039,0.4246039,0.0016852549,0.00044408216,0.000013889962,0.0000610855,0.00003180258,0.00036257473],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965974,0.00003783711,0.00052701816,0.001319099,0.0009547113,0.00056392717],"domain_scores_gemma":[0.99768215,0.00032510186,0.00026905342,0.001362545,0.0001933746,0.00016775912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000619367,0.00041761174,0.0004101205,0.00062376726,0.00035056908,0.00070434413,0.0026034778,0.00023282813,0.000085318716],"category_scores_gemma":[0.000032128744,0.0004033623,0.00013428913,0.000665563,0.0004419452,0.0004888177,0.0006090738,0.0005286356,0.000028931894],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004728343,0.000067141256,0.00016640636,0.000013921989,0.000025677256,0.00004052845,0.002297,0.0038891076,0.00037035724,0.08001727,0.00013852974,0.91296935],"study_design_scores_gemma":[0.0005167594,0.00017946986,0.0010862874,0.0002655746,0.000031711286,0.000021989003,0.000001473802,0.34292576,0.001317336,0.6433689,0.009384047,0.00090067263],"about_ca_topic_score_codex":0.00013287712,"about_ca_topic_score_gemma":0.00030666083,"teacher_disagreement_score":0.91206867,"about_ca_system_score_codex":0.00018845512,"about_ca_system_score_gemma":0.0003369593,"threshold_uncertainty_score":0.9998418},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06580223,0.00006078921,0.9318321,0.00014840745,0.0014775618,0.0003444824,0.000013203656,0.00011881921,0.00020241215],"genre_scores_gemma":[0.62967515,0.000012840233,0.36953673,0.00040024362,0.0002450207,0.0000032446285,0.000018351215,0.000034528075,0.00007391991],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970828,0.000041286665,0.00061914517,0.0010349636,0.00077135325,0.00045041676],"domain_scores_gemma":[0.9975531,0.00023910464,0.00058042735,0.0011717355,0.00034740177,0.00010823111],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005858734,0.00046599854,0.00060310285,0.0006412219,0.00020265942,0.00039863872,0.0025418664,0.00041988198,0.000050307397],"category_scores_gemma":[0.000065703585,0.00040700857,0.0000946094,0.0006692693,0.0006845451,0.0006860033,0.0006096092,0.00071958435,0.0000036989945],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017653396,0.00005341418,0.00003900546,0.00009225066,0.000024114861,0.00003187513,0.0012586432,0.0029413209,0.68109936,0.09098233,6.042612e-7,0.22345941],"study_design_scores_gemma":[0.0005063448,0.00019425407,0.00051593606,0.00031425297,0.000017393371,0.000054990604,3.0116686e-7,0.5389433,0.18408097,0.27450323,0.00009802323,0.0007710258],"about_ca_topic_score_codex":0.000021970262,"about_ca_topic_score_gemma":0.00004294947,"teacher_disagreement_score":0.56387293,"about_ca_system_score_codex":0.00006940809,"about_ca_system_score_gemma":0.00052835396,"threshold_uncertainty_score":0.9998382},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006689987,0.000946995,0.9959379,0.00007794253,0.0008625537,0.00018599922,0.00000431938,0.00010442564,0.0012108984],"genre_scores_gemma":[0.62130886,0.004232642,0.36942878,0.001470189,0.0020866387,0.00001758106,0.00024076001,0.00033942514,0.00087513344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889755,0.0000075228963,0.00018667257,0.00040794324,0.00026453985,0.00023577682],"domain_scores_gemma":[0.99948436,0.000088923654,0.000052010364,0.00022939467,0.00009009988,0.000055191475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011945261,0.00026441822,0.00021090393,0.00024798996,0.00007526616,0.00042256183,0.00016345692,0.00017093944,0.000011706212],"category_scores_gemma":[0.000006838877,0.0002273406,0.000021444417,0.00017035256,0.0001848108,0.00037354403,0.00004294818,0.0002806709,0.000008038396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034629675,0.0000029407258,0.000012467243,0.000049797658,0.0000047413246,0.000022763892,0.000082398896,0.77772534,0.00006609007,0.000038494345,0.00002840717,0.22196308],"study_design_scores_gemma":[0.00020237341,0.00009495068,0.00006399968,0.0007970126,0.000013688632,0.00004039456,2.3743355e-7,0.99094945,0.0007290844,0.006133806,0.00054440746,0.00043059583],"about_ca_topic_score_codex":0.0000139604645,"about_ca_topic_score_gemma":0.00021275715,"teacher_disagreement_score":0.6265091,"about_ca_system_score_codex":0.00008825998,"about_ca_system_score_gemma":0.000046614416,"threshold_uncertainty_score":0.92706805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048152623,0.0005327363,0.9921391,0.000013286966,0.0013199225,0.0000982794,0.0000028811528,0.00024182817,0.0008367023],"genre_scores_gemma":[0.92306143,0.00002811288,0.076335885,0.00009973606,0.000343506,0.0000011651427,0.000007295429,0.000046036726,0.00007682271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982677,0.000008325865,0.0003472678,0.0005418053,0.0004360319,0.00039883485],"domain_scores_gemma":[0.9991288,0.00008425063,0.000087460336,0.00048461423,0.00012229524,0.00009258607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031854134,0.00033635553,0.00037424706,0.00042185,0.00018117951,0.00019050013,0.00036862076,0.00031840248,0.00004075406],"category_scores_gemma":[0.0000475778,0.00032150984,0.000104687526,0.00046475677,0.00018314959,0.00019938924,0.00010051967,0.0008575552,0.000015141182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038117196,0.0000029038915,0.000024568943,0.00003442721,0.000016476937,0.00001432609,0.0001363147,0.9459349,0.006215369,0.000030655578,6.8898464e-7,0.04758557],"study_design_scores_gemma":[0.00010802365,0.000014806823,0.000015407275,0.0002997675,0.000040272895,0.000011195515,8.659118e-8,0.99334157,0.0023529215,0.0032847684,0.00015607735,0.0003751048],"about_ca_topic_score_codex":0.000013805828,"about_ca_topic_score_gemma":0.000090079986,"teacher_disagreement_score":0.91824615,"about_ca_system_score_codex":0.00018412725,"about_ca_system_score_gemma":0.00007700054,"threshold_uncertainty_score":0.9999237},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007063434,0.0003873089,0.993669,0.00035934598,0.0011598425,0.00043621054,0.000080141064,0.0001737609,0.003028057],"genre_scores_gemma":[0.756108,0.000012431475,0.24308631,0.00024382146,0.0002565009,0.000012673114,0.00005378548,0.00004101921,0.00018546586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546456,0.000039867853,0.000911932,0.0015194206,0.0013462403,0.00071798987],"domain_scores_gemma":[0.995913,0.0003988185,0.0007729599,0.0020878587,0.00059424253,0.00023306612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071222614,0.0006675236,0.0011125193,0.0005890014,0.00021986155,0.0003866596,0.0040419986,0.0005024389,0.000014510297],"category_scores_gemma":[0.00007279213,0.0005317654,0.00015860735,0.001025991,0.001260409,0.00053612085,0.0008012218,0.0012478022,0.00001859898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007574263,0.0003147659,0.0012757813,0.00030564543,0.000094314404,0.00024864663,0.0016972602,0.049458306,0.0036753404,0.026360247,0.000120133125,0.9163738],"study_design_scores_gemma":[0.0020547826,0.0010129806,0.00326391,0.0025041068,0.000055882523,0.0002784065,0.0000019224258,0.92489,0.029239489,0.025450645,0.00860113,0.0026467452],"about_ca_topic_score_codex":0.00005980322,"about_ca_topic_score_gemma":0.00033599327,"teacher_disagreement_score":0.91372705,"about_ca_system_score_codex":0.00014925016,"about_ca_system_score_gemma":0.00056613324,"threshold_uncertainty_score":0.99971336},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008467214,0.00022506496,0.9885355,0.00012679829,0.0001594566,0.00015976261,0.0000458067,0.000065660606,0.0022147216],"genre_scores_gemma":[0.93562007,0.000014999638,0.06292863,0.00019912777,0.00097244326,0.000006202115,0.00012295863,0.00003210143,0.000103445265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971097,0.000038333365,0.0006484542,0.0010269657,0.00067652896,0.00050001405],"domain_scores_gemma":[0.9981085,0.00038992753,0.0004970484,0.00073825044,0.00017817515,0.00008808487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002808769,0.00044953576,0.0011862003,0.00080097845,0.00024400691,0.000087017055,0.001237975,0.00019885114,0.00029151587],"category_scores_gemma":[0.000005910671,0.00043687221,0.0006884956,0.0016885947,0.0007299583,0.000093232324,0.0006938182,0.00065147236,0.000006103363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003029949,0.00013933641,0.039641842,0.000012681455,0.0024208631,0.00002930648,0.0020625712,0.1766163,0.00008487459,0.002366509,0.0009999856,0.7755954],"study_design_scores_gemma":[0.00020091445,0.00006412638,0.016703779,0.00014498584,0.0009937396,9.978254e-7,4.0604945e-7,0.81201416,0.0000842614,0.16654503,0.002353663,0.0008939284],"about_ca_topic_score_codex":0.00041494504,"about_ca_topic_score_gemma":0.00035796835,"teacher_disagreement_score":0.9271529,"about_ca_system_score_codex":0.00015847282,"about_ca_system_score_gemma":0.00020894474,"threshold_uncertainty_score":0.9998083},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012143223,0.00009632886,0.98546094,0.0037499848,0.0008432099,0.00042336003,0.0000069955913,0.00012613568,0.009171622],"genre_scores_gemma":[0.6993164,0.0000086603695,0.29618424,0.004184592,0.00020578345,0.000013659838,0.00000560037,0.000024500956,0.000056551562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950479,0.00011672492,0.00079203263,0.0016697642,0.0014892202,0.00088434137],"domain_scores_gemma":[0.99282837,0.0049412446,0.00019479136,0.0013505614,0.00047811068,0.00020689388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024310125,0.00058879156,0.0005498886,0.00076420145,0.00034246978,0.0007118786,0.0038000639,0.0003742234,0.000047525693],"category_scores_gemma":[0.0011192667,0.00045121982,0.00011684041,0.0008696877,0.0022650303,0.00040875783,0.001044749,0.001961316,0.000083213694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008401424,0.000058033507,0.000034153494,0.000027545106,0.0000031061854,0.00007331109,0.0003220725,0.11502775,0.000003496893,0.76931435,0.000014494077,0.11511328],"study_design_scores_gemma":[0.00007975568,0.00009466571,0.00035238397,0.00038299593,0.0000018095891,0.000021166883,1.1505155e-7,0.49750075,0.00001638985,0.5012123,0.000039575974,0.00029809735],"about_ca_topic_score_codex":0.000044422806,"about_ca_topic_score_gemma":0.0002626015,"teacher_disagreement_score":0.69919497,"about_ca_system_score_codex":0.00043121824,"about_ca_system_score_gemma":0.0009019056,"threshold_uncertainty_score":0.99979395},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002817377,0.00036176326,0.9936519,0.000491132,0.0023108097,0.00057957,0.0000069787357,0.00042585548,0.0021438138],"genre_scores_gemma":[0.016781777,0.000136826,0.9782451,0.0014766515,0.002771382,0.000030261408,0.000010231832,0.00004621981,0.000501567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690294,0.000027396552,0.00046705024,0.0014404897,0.0005868592,0.00057529024],"domain_scores_gemma":[0.9981539,0.0004876257,0.00021330183,0.00075043965,0.00021784303,0.00017687162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064313883,0.00048108163,0.00052556046,0.00069673115,0.00033065825,0.0006229621,0.001892032,0.00034724324,0.000015632017],"category_scores_gemma":[0.000050036382,0.00045212518,0.00011049299,0.00035203138,0.0005272709,0.0004102938,0.00077062834,0.00048759748,0.000014701788],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001924696,0.000055179364,0.000019905952,0.00006411513,0.000017129338,0.000020097585,0.00048235967,0.024922447,0.000056205132,0.017212167,0.0010930105,0.9560381],"study_design_scores_gemma":[0.0003096575,0.00032115987,0.00003711125,0.0002388686,0.0000062419285,0.000037926664,4.4485777e-8,0.8545571,0.0004124451,0.12632482,0.017145941,0.0006086829],"about_ca_topic_score_codex":0.0000074780564,"about_ca_topic_score_gemma":0.000005246158,"teacher_disagreement_score":0.95542943,"about_ca_system_score_codex":0.0001209073,"about_ca_system_score_gemma":0.00030545538,"threshold_uncertainty_score":0.99979305},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052713553,0.0001685958,0.9932188,0.0017643505,0.00038132202,0.0003409172,0.0000031069628,0.0001629984,0.0039071883],"genre_scores_gemma":[0.21753809,0.000106516614,0.7806979,0.00034971602,0.00032490827,0.0000072338353,0.000010171935,0.000025726617,0.0009397805],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99720836,0.00003770006,0.00053887867,0.0010012666,0.00089443603,0.00031938448],"domain_scores_gemma":[0.9976531,0.00023808755,0.00047695226,0.0011703321,0.00036947615,0.000092036826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005490955,0.00030364248,0.00038855104,0.0005923532,0.00012148335,0.00020351371,0.0016794488,0.00023130093,0.000028274566],"category_scores_gemma":[0.000068436406,0.0002776178,0.00011995427,0.0008229189,0.00047951483,0.0007768194,0.0005391522,0.00036540494,0.000025870073],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071721265,0.000026964495,0.00018357536,0.000037310216,0.0000062310683,0.000005936067,0.0005604979,0.00095773954,0.0072754575,0.015127351,0.0000151315535,0.97579664],"study_design_scores_gemma":[0.00020707896,0.00015252324,0.0007773584,0.0003194425,0.000010862937,0.00003552121,2.8367234e-7,0.39239115,0.41202188,0.19235922,0.0011449117,0.00057976326],"about_ca_topic_score_codex":0.000021342314,"about_ca_topic_score_gemma":0.0000139110925,"teacher_disagreement_score":0.97521687,"about_ca_system_score_codex":0.00018475964,"about_ca_system_score_gemma":0.00020068625,"threshold_uncertainty_score":0.9999676},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008493134,0.000099651275,0.99719054,0.00010071476,0.0002834751,0.00025812731,0.0000016078881,0.00008093178,0.0011356225],"genre_scores_gemma":[0.95544505,0.000002743966,0.04321117,0.00041858578,0.0007730588,0.000009346494,0.000017830975,0.00004364811,0.00007858353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755776,0.000044478213,0.00043457295,0.0009787905,0.0003924746,0.000591909],"domain_scores_gemma":[0.9984058,0.0002900398,0.00023894895,0.00086259283,0.00009572871,0.00010690201],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053457025,0.0004678412,0.0006293551,0.00057577563,0.00012982641,0.00020640876,0.0009630983,0.00017327747,0.000076492055],"category_scores_gemma":[0.0000056392773,0.00047298986,0.0001956757,0.0003887227,0.00031211492,0.00006087243,0.00052354904,0.00076893065,0.000009682573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005760922,0.0000122506135,0.0021671553,0.000008187676,0.000009821201,0.000016949667,0.000036402424,0.79712135,0.000013626898,0.00096883986,0.000010855284,0.19962883],"study_design_scores_gemma":[0.00016283184,0.000046377045,0.0001130498,0.0003004944,0.000013909411,0.000003391206,4.571641e-8,0.9726176,0.00035933068,0.025278533,0.0006217138,0.00048268418],"about_ca_topic_score_codex":0.00014527574,"about_ca_topic_score_gemma":0.0010707729,"teacher_disagreement_score":0.95459574,"about_ca_system_score_codex":0.00018256552,"about_ca_system_score_gemma":0.00012393507,"threshold_uncertainty_score":0.9997722},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037924193,0.00026944967,0.99441266,0.0002213132,0.0002857697,0.0001720161,0.000029731213,0.00010768053,0.00070897996],"genre_scores_gemma":[0.6808697,0.0002721772,0.31605065,0.0016337476,0.00061440683,0.000003896117,0.00023987185,0.000053448006,0.00026208357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977427,0.00003352608,0.00033002655,0.0011331392,0.00046619854,0.00029437031],"domain_scores_gemma":[0.9972962,0.0001725235,0.0002492816,0.0020947156,0.00008311002,0.00010413964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072930614,0.00027734507,0.00035175763,0.00043036678,0.00008995497,0.00027528807,0.0037999195,0.00016923879,0.000023368693],"category_scores_gemma":[0.000029741544,0.00024643823,0.000026376121,0.00033003927,0.00044345323,0.0013731318,0.0015203672,0.00025345542,0.0000065370355],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002439983,0.00002174548,0.000063897874,0.000026677524,0.0000057074617,0.00003356398,0.0004966757,0.00008530103,0.007786338,0.014021817,0.0000027902825,0.97745305],"study_design_scores_gemma":[0.00023883978,0.00018437806,0.0015048806,0.00033992477,0.000011059573,0.00011767915,4.2072236e-7,0.9220063,0.0040463028,0.06994329,0.0010226746,0.00058422924],"about_ca_topic_score_codex":0.000012776168,"about_ca_topic_score_gemma":0.000013600681,"teacher_disagreement_score":0.9768688,"about_ca_system_score_codex":0.000032629105,"about_ca_system_score_gemma":0.00014869307,"threshold_uncertainty_score":0.9999988},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008174389,0.003183008,0.9749535,0.014615057,0.0019881856,0.0005257281,0.000005904796,0.00029810288,0.0036130876],"genre_scores_gemma":[0.088399254,0.0019066102,0.812874,0.09155953,0.003228698,0.000026268986,0.000036338442,0.00024892154,0.0017203841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941029,0.00006856755,0.0004561426,0.0024219116,0.0016974239,0.0012530729],"domain_scores_gemma":[0.99589384,0.0007213148,0.00026936913,0.0020561898,0.00057068357,0.0004885996],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014198996,0.0008741508,0.00075053086,0.0015601343,0.00044200828,0.0029043471,0.0050256015,0.0005329414,0.000025047568],"category_scores_gemma":[0.000017098459,0.0007769589,0.00012931525,0.0013126028,0.0005692996,0.0024035648,0.003466996,0.0014574871,0.000048423874],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015124796,0.000030273211,0.00008080151,0.00025686118,0.000031330128,0.00022755485,0.0073696137,0.0022246682,0.00024506485,0.023370229,0.000038182436,0.9661103],"study_design_scores_gemma":[0.0013733758,0.0005793951,0.00044945485,0.0033242553,0.000045146746,0.0006572758,0.000015823334,0.73085815,0.0037768162,0.19499137,0.060823895,0.0031050327],"about_ca_topic_score_codex":0.00010552407,"about_ca_topic_score_gemma":0.0025720645,"teacher_disagreement_score":0.96300524,"about_ca_system_score_codex":0.00016605433,"about_ca_system_score_gemma":0.00060746697,"threshold_uncertainty_score":0.99946815},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007996637,0.0009700159,0.9950499,0.00035398864,0.0009470263,0.00082186173,0.000022313734,0.0004893098,0.0013376207],"genre_scores_gemma":[0.027889254,0.00002584383,0.97066367,0.000756002,0.0001597772,0.000026279577,0.00001095601,0.00004023632,0.0004280003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671584,0.000018922156,0.00051727623,0.0013195212,0.00068757986,0.0007408523],"domain_scores_gemma":[0.99769276,0.00032395707,0.00038955905,0.0010352464,0.00037593764,0.00018254454],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000917459,0.00052706234,0.00045204442,0.0003123028,0.00023033383,0.0011355694,0.0027894806,0.00024699993,0.0000063994826],"category_scores_gemma":[0.00011186997,0.000504444,0.00012878931,0.00035354917,0.0009878511,0.0019162162,0.0008767612,0.00042731446,0.000021591626],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004370477,0.000045855995,0.000029018809,0.000084122694,0.0000073986307,0.000010727304,0.0004158433,0.0012265309,0.00087435043,0.02654698,0.000035877805,0.9707189],"study_design_scores_gemma":[0.0005151316,0.00017484878,0.000027481676,0.0006737168,0.000014176985,0.00006781314,3.163697e-7,0.7498704,0.036422685,0.2078841,0.0031421385,0.0012071761],"about_ca_topic_score_codex":0.0000048465354,"about_ca_topic_score_gemma":0.000016911446,"teacher_disagreement_score":0.96951175,"about_ca_system_score_codex":0.0003861783,"about_ca_system_score_gemma":0.00042559922,"threshold_uncertainty_score":0.99990135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001661634,0.0006089106,0.9865453,0.00034416182,0.0016617252,0.0003054649,0.00000409062,0.00029955973,0.010064599],"genre_scores_gemma":[0.015733229,0.00004337993,0.98014903,0.0018730109,0.0007045099,0.000013535675,0.0000111711215,0.000041663072,0.001430448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958126,0.00007324817,0.00052869885,0.0015544397,0.0013898897,0.0006411056],"domain_scores_gemma":[0.9970473,0.00030462784,0.00032679315,0.001941312,0.00019912464,0.00018086005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011074432,0.0004915057,0.00043178236,0.00086435373,0.00039480542,0.00043188248,0.0032420408,0.00037106065,0.00004025314],"category_scores_gemma":[0.00018708267,0.00047177734,0.00014984804,0.0007308424,0.0009346397,0.000771086,0.001162758,0.000972313,0.00013942698],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024142986,0.00006042623,0.000042892163,0.000050047613,0.000021678197,0.00033314613,0.0034246235,0.029744966,0.00039741755,0.055107255,0.00063029927,0.9101631],"study_design_scores_gemma":[0.0006078849,0.0003009228,0.0011326374,0.00035151525,0.000012786214,0.0011728224,7.7158046e-7,0.86805207,0.0041717137,0.07520128,0.0473628,0.0016327865],"about_ca_topic_score_codex":0.000013632475,"about_ca_topic_score_gemma":0.000013270817,"teacher_disagreement_score":0.9085303,"about_ca_system_score_codex":0.0004522273,"about_ca_system_score_gemma":0.00061164214,"threshold_uncertainty_score":0.9997734},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029392426,0.006506679,0.95208204,0.00045757665,0.0069062533,0.00027502247,0.0000021680664,0.00020791317,0.033532977],"genre_scores_gemma":[0.71518916,0.0014577594,0.26894337,0.0024810033,0.0058456534,0.000049333186,0.000008798905,0.00014155626,0.0058833873],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959064,0.00005612937,0.00050142384,0.0013366735,0.0010195385,0.0011798228],"domain_scores_gemma":[0.995261,0.0018420122,0.000328813,0.0020071508,0.0002702985,0.00029070443],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001545196,0.0005914789,0.00046956504,0.00034631466,0.0008362869,0.0010881906,0.006069944,0.00036144894,0.000020547615],"category_scores_gemma":[0.0003244629,0.00038509115,0.00020375752,0.0005434699,0.0011102733,0.0006295191,0.0019908203,0.0009720438,0.0003079475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028701043,0.00001591584,0.00004925177,0.000011038427,0.00000838022,0.000021206648,0.0007373435,0.00038270265,0.000009007128,0.22595678,0.00007103448,0.77273446],"study_design_scores_gemma":[0.00068423175,0.00031889122,0.0015474928,0.00054494943,0.000029598854,0.00031927737,5.2596977e-7,0.21928833,0.0012498833,0.6291398,0.14474176,0.0021352924],"about_ca_topic_score_codex":0.000013188158,"about_ca_topic_score_gemma":0.000084777064,"teacher_disagreement_score":0.7705992,"about_ca_system_score_codex":0.00026768123,"about_ca_system_score_gemma":0.0005370299,"threshold_uncertainty_score":0.9999488},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028298673,0.00045258022,0.9958777,0.00026490775,0.0012599793,0.0010109311,0.000032266955,0.00028951888,0.00052913924],"genre_scores_gemma":[0.8915662,0.000008331346,0.10780193,0.00012436991,0.000300447,0.00002212152,0.00009530926,0.00004227977,0.000038988903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993771,0.00010380486,0.0012538821,0.00214538,0.0014375595,0.0012883819],"domain_scores_gemma":[0.9970021,0.00052434736,0.00054998655,0.0015277301,0.00011529937,0.00028050673],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013508264,0.00081787474,0.0010150662,0.0007605055,0.000285071,0.001068113,0.003606629,0.0004700995,0.000010635714],"category_scores_gemma":[0.00007787261,0.00079539267,0.00018681797,0.00083875307,0.0005473116,0.00041126518,0.001676256,0.001164134,0.00006940839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004001142,0.00006417559,0.00019734344,0.00009967704,0.000011182237,0.00023764538,0.00037560632,0.88788605,0.000029669567,0.018967288,0.000003542976,0.092123844],"study_design_scores_gemma":[0.00060229073,0.00015229045,0.00042833522,0.0012779726,0.000006021011,0.00009864401,4.6037528e-7,0.9723873,0.000007417779,0.021684973,0.0024899987,0.0008642913],"about_ca_topic_score_codex":0.00018316822,"about_ca_topic_score_gemma":0.00003795679,"teacher_disagreement_score":0.8912832,"about_ca_system_score_codex":0.0017065153,"about_ca_system_score_gemma":0.00053591945,"threshold_uncertainty_score":0.9999689},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000644279,0.0005874381,0.98968554,0.0007802779,0.004647947,0.0013701989,0.000026460224,0.0004376888,0.002400039],"genre_scores_gemma":[0.41711187,0.00001281783,0.576515,0.004240413,0.001516392,0.000026745474,0.000012913366,0.00008912022,0.00047471994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938677,0.000060252347,0.0010440971,0.0024739269,0.0012507874,0.0013032535],"domain_scores_gemma":[0.9923754,0.0038432102,0.00074988947,0.0018267304,0.0008595225,0.00034525906],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002395613,0.0008423976,0.0011166586,0.0011785025,0.0005615145,0.0011818655,0.0039577316,0.0008192124,0.00003706868],"category_scores_gemma":[0.0004066043,0.00085890497,0.00036463732,0.0009255586,0.00063443556,0.00094099937,0.0015324703,0.0012664503,0.0001332556],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012968687,0.00004150406,0.0000675308,0.00009927535,0.00002511176,0.000048274807,0.00060138793,0.0011289397,0.000019402165,0.035654936,0.00006999655,0.9622307],"study_design_scores_gemma":[0.0009263042,0.00041407556,0.00009180433,0.002985962,0.000022576862,0.00027983024,0.0000023171362,0.6422073,0.0017734667,0.33329463,0.01609483,0.0019068634],"about_ca_topic_score_codex":0.000079993115,"about_ca_topic_score_gemma":0.00034967397,"teacher_disagreement_score":0.9603238,"about_ca_system_score_codex":0.0007143127,"about_ca_system_score_gemma":0.00083348545,"threshold_uncertainty_score":0.999855},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014991012,0.0010011795,0.9912965,0.0005908363,0.0036472445,0.0011552765,0.000010522775,0.0003386649,0.0018098097],"genre_scores_gemma":[0.59786665,0.00016731753,0.3966028,0.003928278,0.0011301885,0.000040812454,0.00003517868,0.0001266867,0.00010209666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99156094,0.00012661461,0.0013475891,0.0032613631,0.0017332803,0.0019702408],"domain_scores_gemma":[0.99522454,0.00060217,0.0007418272,0.0026484143,0.0003204184,0.00046265245],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016864832,0.0012644355,0.0012539683,0.00096733496,0.00045783835,0.0009328752,0.00523171,0.00072769186,0.00011659571],"category_scores_gemma":[0.00007913841,0.0012605658,0.00031144405,0.001749957,0.0007997305,0.0011294255,0.0033936414,0.0026408979,0.00007801376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003039603,0.000042048152,0.000062358165,0.000036775768,0.00001566189,0.00077721896,0.00035063046,0.6490226,0.000019105915,0.009270558,0.00014467581,0.34022802],"study_design_scores_gemma":[0.0010256281,0.0003308528,0.00043444562,0.0017158887,0.000013305053,0.00028100325,2.6908998e-7,0.7829521,0.00021642046,0.21133026,0.00046503948,0.0012348042],"about_ca_topic_score_codex":0.00004244016,"about_ca_topic_score_gemma":0.00012213626,"teacher_disagreement_score":0.59771675,"about_ca_system_score_codex":0.0015714709,"about_ca_system_score_gemma":0.0015767089,"threshold_uncertainty_score":0.9996601},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020283619,0.0009242279,0.995233,0.00010069224,0.0007257387,0.0007348275,0.000005089957,0.000277075,0.0017965009],"genre_scores_gemma":[0.0148952035,0.00003924857,0.98391044,0.00055491703,0.0003117662,0.000007988682,0.00000343823,0.00009218461,0.00018481837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99272376,0.00010123342,0.0007025173,0.0024492585,0.002416502,0.001606748],"domain_scores_gemma":[0.99535805,0.0010212435,0.00042313288,0.0022084385,0.00057469105,0.00041441582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00270018,0.00091415684,0.00093294727,0.0024864268,0.0006850941,0.0007854342,0.005119807,0.00041788435,0.000017564036],"category_scores_gemma":[0.00009442569,0.0007645771,0.0002375794,0.0023121575,0.0024350667,0.0012810756,0.0018690255,0.001652375,0.000021576912],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005724112,0.000028621373,0.000060854734,0.000032121006,0.000036155896,0.00063997245,0.00046917476,0.029404934,0.00020930504,0.028778391,0.0000018505586,0.9402814],"study_design_scores_gemma":[0.0012702438,0.0003615406,0.00004801745,0.0007698499,0.000017669212,0.00054861634,8.1917835e-7,0.66730666,0.0020603396,0.3261427,0.00035106982,0.0011224762],"about_ca_topic_score_codex":0.00005079074,"about_ca_topic_score_gemma":0.00013046614,"teacher_disagreement_score":0.9391589,"about_ca_system_score_codex":0.00041787158,"about_ca_system_score_gemma":0.0007570944,"threshold_uncertainty_score":0.99948055},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047005014,0.0012349227,0.99357504,0.0006141468,0.0018245766,0.0003726775,0.0000071088316,0.00009990751,0.0018015637],"genre_scores_gemma":[0.7400743,0.00014412617,0.2567259,0.0017795278,0.00079265545,0.000020108886,0.000032792435,0.000034152,0.00039646745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966018,0.000049086066,0.0005705692,0.0011743075,0.000930305,0.0006739071],"domain_scores_gemma":[0.9979255,0.0005294682,0.00022130537,0.000929106,0.00017697745,0.0002176182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010374767,0.00043822327,0.0004721359,0.0013798256,0.000196075,0.0002897834,0.0019833294,0.00029632362,0.00003972518],"category_scores_gemma":[0.00008137464,0.00042755343,0.0001019032,0.0010000352,0.00028371598,0.000813496,0.0006708859,0.0007210361,0.000119844684],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064870856,0.000083342886,0.00040052354,0.000026758109,0.000008709861,0.00009525243,0.0010400447,0.0638823,0.00034981943,0.11279957,0.00005173638,0.82125545],"study_design_scores_gemma":[0.00052925764,0.00016956429,0.0032993292,0.00031773848,0.000008003178,0.00010043365,2.3407846e-7,0.6866929,0.001651449,0.29962507,0.006547164,0.0010589011],"about_ca_topic_score_codex":0.000028185055,"about_ca_topic_score_gemma":0.00009626313,"teacher_disagreement_score":0.82019657,"about_ca_system_score_codex":0.00028074728,"about_ca_system_score_gemma":0.00049393706,"threshold_uncertainty_score":0.9998176},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004902674,0.00026762753,0.737841,0.0002451825,0.0016328637,0.00029376496,0.00007826725,0.0000845214,0.25906646],"genre_scores_gemma":[0.9364181,0.000022250562,0.046531893,0.0036807894,0.008929329,0.000006382977,0.00009704624,0.00006576602,0.004248427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974469,0.000011814356,0.00033145281,0.001051451,0.0006867135,0.00047168828],"domain_scores_gemma":[0.9984232,0.000063722786,0.00013598455,0.00083310326,0.00032425782,0.00021969908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021453765,0.0004184443,0.0004337763,0.0006192611,0.000385018,0.0008718713,0.0012538556,0.00014612325,0.00080870715],"category_scores_gemma":[0.00004498756,0.00033598524,0.000110825444,0.00013555848,0.00071003864,0.00017250946,0.0002312179,0.0004624734,0.000038103517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062867416,0.00011098817,0.0000888273,0.000053498712,0.000054194516,0.00008217714,0.017467212,0.046028946,0.000043339824,0.80536866,0.00037061214,0.13032523],"study_design_scores_gemma":[0.00028535697,0.00036406607,0.000081528124,0.0003142505,0.00013808953,0.000040277522,0.000018049144,0.17014574,0.00010945701,0.706808,0.11972745,0.0019677926],"about_ca_topic_score_codex":0.00041583306,"about_ca_topic_score_gemma":0.0020088686,"teacher_disagreement_score":0.93592787,"about_ca_system_score_codex":0.0000927277,"about_ca_system_score_gemma":0.00018205708,"threshold_uncertainty_score":0.9999092},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009319329,0.0004740209,0.9957503,0.00032742944,0.00053231115,0.0008550828,0.00011817675,0.000044795168,0.0009659231],"genre_scores_gemma":[0.52023745,0.00003879495,0.4772002,0.00056733313,0.0017109518,0.000060679227,0.000029398785,0.000052903975,0.00010229826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767816,7.97555e-7,0.0007358057,0.0009851897,0.00011024957,0.0004898206],"domain_scores_gemma":[0.99876606,0.000106937376,0.0004746637,0.00044852417,0.00012587185,0.00007794037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047618657,0.00033491402,0.0005520847,0.00043988705,0.0004081403,0.00011508931,0.00071554177,0.00029431938,0.000011810672],"category_scores_gemma":[0.000050274102,0.00039195988,0.00011813664,0.00035883422,0.00028111713,0.00022763015,0.0001171021,0.00035384367,0.000039214352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001028283,0.000021784186,0.000046861867,0.00006568473,0.0000044266585,3.7533462e-7,0.00019331541,0.035308108,0.000009993017,0.3567051,0.0000020368893,0.60763204],"study_design_scores_gemma":[0.00024983013,0.000060754584,0.000228098,0.000083180625,0.0000059634767,0.0000068322547,7.949145e-8,0.61094964,0.00007946351,0.3847074,0.003262342,0.00036645264],"about_ca_topic_score_codex":0.000051580115,"about_ca_topic_score_gemma":0.00004400511,"teacher_disagreement_score":0.6072656,"about_ca_system_score_codex":0.00033916152,"about_ca_system_score_gemma":0.00021507313,"threshold_uncertainty_score":0.99985325},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004053823,0.00062537787,0.97081286,0.0005688683,0.0011973996,0.0002640012,0.00012135252,0.00066767563,0.021688621],"genre_scores_gemma":[0.82144934,0.000014407536,0.17495485,0.001899888,0.0008092665,0.0000115559,0.00007159044,0.00009391722,0.0006951674],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9964489,0.000015288144,0.00045729996,0.0013345608,0.0010998758,0.00064409245],"domain_scores_gemma":[0.9979313,0.00009353488,0.00027648814,0.0013940603,0.00012079409,0.00018385072],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027585353,0.0005989157,0.0005114238,0.00019503314,0.00023144689,0.00023738541,0.0015367899,0.0007547992,0.0010811851],"category_scores_gemma":[0.00007107352,0.00054069265,0.0001584139,0.00018878987,0.00083752547,0.0000878823,0.00035079388,0.0016657099,0.000016355772],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011761106,0.00014670307,0.00038152977,0.0005197439,0.000053719556,0.00056391425,0.000465113,0.024913698,0.46299312,0.005935834,0.00007253896,0.50383645],"study_design_scores_gemma":[0.00059980305,0.00008638569,0.00025819193,0.00056002464,0.000026760525,0.000035439112,5.675911e-8,0.14925088,0.78638,0.048418354,0.013271586,0.0011125016],"about_ca_topic_score_codex":0.00003687674,"about_ca_topic_score_gemma":0.00016109982,"teacher_disagreement_score":0.81739557,"about_ca_system_score_codex":0.00038698668,"about_ca_system_score_gemma":0.00077296473,"threshold_uncertainty_score":0.999832},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015054742,0.0015915158,0.9878642,0.000058071364,0.0023051172,0.0004219166,0.000047430778,0.00069433416,0.0068668695],"genre_scores_gemma":[0.87561077,0.00016914697,0.12177021,0.00042503767,0.0009623232,0.000039405877,0.000023840199,0.00025932852,0.0007399149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772143,0.000011148802,0.0005748033,0.000801034,0.00037648375,0.00051511504],"domain_scores_gemma":[0.9979774,0.00037628907,0.00011071575,0.0012514307,0.00012444802,0.00015973764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003165654,0.0005808954,0.0004797206,0.00045221855,0.00014338788,0.00011820394,0.00086863333,0.0004133852,0.00016467122],"category_scores_gemma":[0.000064205735,0.00058430707,0.00013026463,0.00030311212,0.0002615197,0.00020170375,0.00019607208,0.00073025376,0.00018199437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046986056,0.000009274355,0.00004443141,0.00029890222,0.000048789778,0.0029556802,0.0015402209,0.5096827,0.00004037325,0.0005625625,0.00009091008,0.48472142],"study_design_scores_gemma":[0.00057263783,0.0001239911,0.0002567853,0.0023200095,0.000057222813,0.007745142,0.0000014053437,0.88050336,0.0024432198,0.0072025917,0.095525086,0.0032485407],"about_ca_topic_score_codex":0.000032796608,"about_ca_topic_score_gemma":0.000050080074,"teacher_disagreement_score":0.87546027,"about_ca_system_score_codex":0.0005781886,"about_ca_system_score_gemma":0.00015528462,"threshold_uncertainty_score":0.99966085},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004439481,0.0005660832,0.99128467,0.0007620379,0.0014516955,0.00063444854,0.0000053919875,0.00093448244,0.0043167737],"genre_scores_gemma":[0.06992143,0.00037540452,0.92456335,0.0028871915,0.0008119858,0.000031371183,0.000014767987,0.00008324685,0.001311278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99493325,0.00005576631,0.0007820772,0.0021025727,0.0012014266,0.0009248835],"domain_scores_gemma":[0.996368,0.00031003714,0.0004729609,0.0020747127,0.00045625723,0.0003180407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071590964,0.00079024414,0.0007498943,0.0011011746,0.00050462154,0.00074442,0.005297079,0.0005329056,0.000030195386],"category_scores_gemma":[0.00012568806,0.00075162644,0.00023275868,0.000893939,0.0008286368,0.0007481331,0.0018909444,0.0012119758,0.00010350382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015517682,0.00012875236,0.00019119175,0.00008689907,0.000029702363,0.0005288191,0.0018799101,0.16186388,0.000090001,0.005944347,0.0025991136,0.82664186],"study_design_scores_gemma":[0.0005151847,0.00018944422,0.00022055327,0.00075452833,0.00000800066,0.00036327384,9.684573e-8,0.95037645,0.005825421,0.026138661,0.013904916,0.0017034593],"about_ca_topic_score_codex":0.000023722105,"about_ca_topic_score_gemma":0.00002148289,"teacher_disagreement_score":0.8249384,"about_ca_system_score_codex":0.0004734151,"about_ca_system_score_gemma":0.000994356,"threshold_uncertainty_score":0.9994935},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000081126695,0.00023153017,0.99493736,0.00060030655,0.00052058103,0.0004240328,0.000005489284,0.00008568308,0.003113885],"genre_scores_gemma":[0.5832962,0.000047253016,0.4145023,0.0014959705,0.00011197135,0.000023244933,0.0000012001842,0.000029642855,0.0004922833],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972156,0.000055397795,0.0004470927,0.0010364023,0.0007273977,0.00051807746],"domain_scores_gemma":[0.9972224,0.0005799143,0.00030049917,0.001553726,0.00022476802,0.000118651275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010416815,0.00040189826,0.00037331015,0.0003975222,0.00028226114,0.00023678788,0.005051061,0.00020466147,0.000050445644],"category_scores_gemma":[0.000056076442,0.00028863145,0.00012193087,0.00055932364,0.0006807268,0.00035101955,0.0010151847,0.0005568643,0.000045180735],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009728818,0.00009093508,0.00032378372,0.000061895254,0.000050324845,0.00005493979,0.014524871,0.0056212447,0.0015950842,0.12406341,0.00022991897,0.8533739],"study_design_scores_gemma":[0.0010402839,0.0008775291,0.007106588,0.0022354075,0.000063715386,0.00043586016,0.0000074154527,0.37204093,0.032047924,0.5636455,0.015987096,0.0045117647],"about_ca_topic_score_codex":0.0000481618,"about_ca_topic_score_gemma":0.00003552481,"teacher_disagreement_score":0.8488621,"about_ca_system_score_codex":0.00012831493,"about_ca_system_score_gemma":0.0005967274,"threshold_uncertainty_score":0.9999566},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034116465,0.0007279943,0.98882174,0.0018758029,0.001972192,0.00059215666,0.0000013870774,0.00015173863,0.005515821],"genre_scores_gemma":[0.71622866,0.0004253266,0.27577662,0.0047303136,0.0012577362,0.000056865378,0.0000029906296,0.00010141087,0.0014200477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957226,0.00006273738,0.00074856594,0.001560002,0.0010193749,0.00088673],"domain_scores_gemma":[0.9967815,0.00083054625,0.00029472174,0.0017900636,0.00018180856,0.00012132193],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011892838,0.00053772517,0.00049664074,0.000811823,0.00041111634,0.0005406253,0.0060377014,0.00031321702,0.00001886746],"category_scores_gemma":[0.0001517973,0.00040158734,0.00013698693,0.0010722278,0.0014449356,0.0007334813,0.0019036158,0.0013498112,0.00016185366],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004971853,0.000033538337,0.00017303455,0.000020352072,0.000006980134,0.00032637906,0.0069606137,0.062037304,0.00014004068,0.01250562,0.00014908433,0.91764206],"study_design_scores_gemma":[0.0001468364,0.00018366052,0.00028321304,0.00083886046,0.0000051675574,0.00038488355,0.0000013050277,0.7444961,0.008093403,0.2321276,0.01213435,0.0013045977],"about_ca_topic_score_codex":0.00009926189,"about_ca_topic_score_gemma":0.00043277806,"teacher_disagreement_score":0.9163375,"about_ca_system_score_codex":0.00037812477,"about_ca_system_score_gemma":0.0006763241,"threshold_uncertainty_score":0.9998436},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012919637,0.00014817154,0.98032326,0.002311927,0.0016780082,0.00048544205,0.0000027032308,0.00010584692,0.0020249863],"genre_scores_gemma":[0.9478324,0.000036371788,0.050817117,0.0006562368,0.00038637084,0.000021093034,0.0000024567646,0.000016683376,0.00023124149],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996952,0.00008035622,0.00031737072,0.0012143782,0.0008831139,0.00055275834],"domain_scores_gemma":[0.9965181,0.0021988584,0.0001636261,0.0008717358,0.00009897327,0.00014873159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025302162,0.00037004074,0.00029300535,0.00054118055,0.0010724906,0.00080695597,0.002194659,0.000127513,0.0000080256],"category_scores_gemma":[0.0003476073,0.00027046434,0.000085287655,0.0005708687,0.0010612757,0.0012496855,0.002187398,0.0015663507,0.000036249403],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001601045,0.000008942159,0.0054628616,0.000021552049,0.000008967603,0.000018861927,0.0044280947,0.0001974253,0.0003077415,0.02676727,0.000007286867,0.9627694],"study_design_scores_gemma":[0.0011181413,0.0006665488,0.3576149,0.0017691333,0.00007039147,0.00019006136,0.000012773941,0.06861535,0.0049259537,0.5422177,0.01953546,0.0032636195],"about_ca_topic_score_codex":0.000016507576,"about_ca_topic_score_gemma":0.000049357965,"teacher_disagreement_score":0.9595058,"about_ca_system_score_codex":0.0001150895,"about_ca_system_score_gemma":0.00021956583,"threshold_uncertainty_score":0.9999747},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014617426,0.0008687199,0.988806,0.0002253775,0.0016170099,0.00042500912,0.0000141114115,0.00011464717,0.0077829547],"genre_scores_gemma":[0.31691444,0.00009754491,0.6814039,0.0005029111,0.00083318184,0.000027450518,0.000015771997,0.000043125336,0.00016167956],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966718,0.00003808271,0.0005920534,0.0013554518,0.00074368523,0.0005989248],"domain_scores_gemma":[0.99698347,0.00035328683,0.00031152958,0.001828603,0.000330638,0.00019246858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007096091,0.0004562462,0.0005697576,0.0007402542,0.00015321307,0.00031978876,0.0041012163,0.00032205664,0.00008662325],"category_scores_gemma":[0.00006297379,0.0004017763,0.00019139425,0.0008233013,0.0009820606,0.0008196517,0.0019323644,0.00066907215,0.00010711527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043508567,0.00008691515,0.00006970482,0.00008937507,0.000013249359,0.00001768174,0.0013150759,0.00054246566,0.00013454654,0.27282223,0.00017477879,0.72472966],"study_design_scores_gemma":[0.0004933844,0.00041474614,0.00042773294,0.0006345776,0.000016513608,0.000052584826,2.1978039e-7,0.28852326,0.0065396014,0.68347746,0.01821533,0.0012046174],"about_ca_topic_score_codex":0.000036333724,"about_ca_topic_score_gemma":0.00005658634,"teacher_disagreement_score":0.723525,"about_ca_system_score_codex":0.00007961448,"about_ca_system_score_gemma":0.00053243915,"threshold_uncertainty_score":0.9998434},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023647643,0.00060702505,0.993254,0.00020064435,0.0016272166,0.00085365615,0.0000037137168,0.0001959201,0.0032341576],"genre_scores_gemma":[0.058936696,0.00001244808,0.9365771,0.00065687794,0.00087082136,0.00006779514,0.0000048276097,0.000042129246,0.0028313084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957436,0.00002972677,0.0005714337,0.001953478,0.0009299484,0.0007718196],"domain_scores_gemma":[0.9973378,0.00030926298,0.0002788701,0.0016380524,0.00025582092,0.00018018651],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012314628,0.00053170836,0.0006997077,0.00056828634,0.00028635407,0.00073745544,0.003627574,0.00034414683,0.000001760038],"category_scores_gemma":[0.00007917779,0.00049009686,0.0002009383,0.00025310583,0.00031058295,0.00036066884,0.0009677997,0.00056297175,0.0000061182204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027771555,0.000007966523,0.000006143341,0.00014230463,0.0000074526965,0.0000035117064,0.00047772125,0.64873,0.00003059985,0.23163265,0.000008378059,0.118950486],"study_design_scores_gemma":[0.00033381308,0.000056568737,0.0000011046997,0.00025331625,0.000008127914,0.00003298496,1.8620771e-7,0.9468714,0.000054725908,0.05099089,0.0008788282,0.0005180821],"about_ca_topic_score_codex":0.000020174266,"about_ca_topic_score_gemma":0.000004683084,"teacher_disagreement_score":0.29814136,"about_ca_system_score_codex":0.00032876016,"about_ca_system_score_gemma":0.00048161083,"threshold_uncertainty_score":0.9997551},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003234288,0.00048824705,0.98296803,0.0022553517,0.00026426924,0.0003512202,0.0000051170364,0.00030030534,0.013335135],"genre_scores_gemma":[0.4237113,0.00024768655,0.5624597,0.011985678,0.0006067092,0.000027104907,0.000017610326,0.00005989061,0.0008842979],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623084,0.000038275037,0.0005357615,0.0014483556,0.0010844376,0.0006623129],"domain_scores_gemma":[0.9972105,0.00049266225,0.00027623537,0.0018737952,0.00005957112,0.0000872368],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006058257,0.0005276175,0.0004973608,0.0010467133,0.00015025833,0.0013845284,0.007400215,0.00023878993,0.000010160899],"category_scores_gemma":[0.00006213629,0.00039288317,0.00016695666,0.0013901221,0.0005880933,0.0024556322,0.0011214649,0.0010140109,0.000038284565],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024494705,0.00002956148,0.000058261758,0.000007392696,0.0000035351507,0.00017845139,0.0005464824,0.0025225626,0.000014096372,0.021149924,0.00006807919,0.9754192],"study_design_scores_gemma":[0.00018542886,0.00022818866,0.00025992646,0.00049588346,0.000005776389,0.000113110655,4.4750587e-7,0.14279717,0.0008816283,0.83637655,0.01766717,0.0009886889],"about_ca_topic_score_codex":0.0000035508795,"about_ca_topic_score_gemma":0.000022319407,"teacher_disagreement_score":0.9744305,"about_ca_system_score_codex":0.00017713019,"about_ca_system_score_gemma":0.0002750218,"threshold_uncertainty_score":0.9998523},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015174788,0.00009917879,0.9975391,0.00008162467,0.0005070613,0.0005576246,0.0000107070155,0.00025991548,0.0007930101],"genre_scores_gemma":[0.08408344,0.000007527619,0.9151002,0.00027040322,0.0003296972,0.000019049228,0.000044335517,0.000035929414,0.00010941671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963045,0.000025083556,0.00053294643,0.001673393,0.0008670812,0.00059697306],"domain_scores_gemma":[0.99753845,0.0003357899,0.00022261946,0.0014640552,0.00023145707,0.00020763554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005971168,0.0004340773,0.00044935002,0.00026104334,0.00029559954,0.00038339902,0.0027000252,0.0003188293,0.00003106827],"category_scores_gemma":[0.00013151883,0.000416531,0.00007439465,0.0003504112,0.00038996772,0.00026518435,0.0005278545,0.00046424475,0.000007200062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031622503,0.00009682734,0.0000121953735,0.0001872354,0.000009067939,0.000024114253,0.00090038695,0.5309584,0.00051898474,0.008704315,0.00001688885,0.4585684],"study_design_scores_gemma":[0.00021490915,0.000070314396,0.000020421545,0.000074126,0.000006948468,0.000067765846,1.3910577e-7,0.9887212,0.0006072684,0.009655618,0.00010398324,0.00045730724],"about_ca_topic_score_codex":0.000005122071,"about_ca_topic_score_gemma":0.0000025113843,"teacher_disagreement_score":0.45811108,"about_ca_system_score_codex":0.00033794355,"about_ca_system_score_gemma":0.00072178873,"threshold_uncertainty_score":0.99982864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023381272,0.002006461,0.98995554,0.0008887611,0.003254139,0.0014743652,0.000004937374,0.00047741935,0.0017045408],"genre_scores_gemma":[0.13571498,0.0004353079,0.8577072,0.0020542406,0.0029165035,0.00008546642,0.000021677124,0.00015101313,0.0009135975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927097,0.00015437572,0.0012993267,0.00277891,0.0013954267,0.0016622348],"domain_scores_gemma":[0.9915385,0.004298052,0.000820256,0.0023758516,0.00062399707,0.00034330355],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0029571806,0.0011282453,0.0018695376,0.0010228584,0.00063524407,0.00128069,0.005568619,0.0008569586,0.00002404682],"category_scores_gemma":[0.00037493603,0.0010483575,0.0006304241,0.0008763381,0.0011663012,0.00086704886,0.0022560796,0.0014972914,0.000016926582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037746906,0.000024491746,0.0000038152643,0.000035889814,0.00003477425,0.0000282994,0.00013311168,0.7442459,0.000025226129,0.029034127,0.000011699451,0.22604519],"study_design_scores_gemma":[0.015502442,0.000060381844,0.0000012064443,0.00079577084,0.000029678586,0.00004298724,1.3734429e-7,0.96493953,0.00045221488,0.014825129,0.0022285366,0.0011219997],"about_ca_topic_score_codex":0.000016250871,"about_ca_topic_score_gemma":0.0000494982,"teacher_disagreement_score":0.2249232,"about_ca_system_score_codex":0.00046533902,"about_ca_system_score_gemma":0.00048236342,"threshold_uncertainty_score":0.9998117},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010448685,0.00011406507,0.9966053,0.00012447222,0.00023531636,0.00035990975,0.000014444711,0.000057756963,0.0014438757],"genre_scores_gemma":[0.37713462,0.000004420116,0.62260216,0.00014700284,0.00007528163,0.0000044937,0.0000066488847,0.000010204564,0.000015139386],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974596,0.00005048273,0.0005505082,0.0010040682,0.0005617021,0.00037364886],"domain_scores_gemma":[0.99787724,0.000619693,0.00033559382,0.0008445459,0.00023836084,0.00008459149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013912636,0.00029255502,0.00042351324,0.0006408684,0.00019722704,0.00024130433,0.0012472984,0.00015123343,0.000009371208],"category_scores_gemma":[0.00012597542,0.00027379967,0.00008422469,0.0006233922,0.0005789028,0.0002656636,0.0010301048,0.0003810952,5.4061377e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043440355,0.000053009888,0.0027955342,0.00016408609,0.000012339362,0.000020518104,0.001609785,0.002672752,0.0002170785,0.12352098,0.000024037214,0.86890554],"study_design_scores_gemma":[0.00035154657,0.00019209778,0.005515723,0.00014168915,0.000012554049,0.000040506562,6.931569e-7,0.3297795,0.0009740813,0.6614626,0.0009798121,0.0005492219],"about_ca_topic_score_codex":0.00034445294,"about_ca_topic_score_gemma":0.00042227455,"teacher_disagreement_score":0.8683563,"about_ca_system_score_codex":0.000081512924,"about_ca_system_score_gemma":0.00031744342,"threshold_uncertainty_score":0.9999714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001388886,0.00071411964,0.98973763,0.003104902,0.0021112568,0.00035952477,0.0000025887266,0.00013985185,0.0024412558],"genre_scores_gemma":[0.3819602,0.000098088814,0.61126125,0.003991704,0.0013893087,0.000012384051,0.0000017840422,0.0000681449,0.001217138],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99590015,0.00005412496,0.0005142243,0.0015453241,0.0011645234,0.0008216275],"domain_scores_gemma":[0.9962762,0.001252353,0.00019265914,0.0018001671,0.0002809412,0.00019766102],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017983274,0.00048933865,0.00041635233,0.000514466,0.0012052748,0.0033476558,0.0049378606,0.00039628436,0.00003266989],"category_scores_gemma":[0.00022772029,0.0003525064,0.00010616553,0.0005968583,0.004923795,0.0007475961,0.0028368235,0.0019488473,0.00007969264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027163164,0.0000113876295,0.00011164877,0.000014589593,0.000005663021,0.000042628268,0.0023849101,0.0019433693,0.0011621015,0.024028553,0.000009971827,0.97028244],"study_design_scores_gemma":[0.00009158787,0.00014069995,0.00047651172,0.00031017527,0.000008337176,0.00023936134,0.0000011588194,0.35238886,0.030689249,0.6073146,0.0073995297,0.0009399125],"about_ca_topic_score_codex":0.00010226707,"about_ca_topic_score_gemma":0.0002457813,"teacher_disagreement_score":0.9693425,"about_ca_system_score_codex":0.00011466504,"about_ca_system_score_gemma":0.0007264064,"threshold_uncertainty_score":0.9998927},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008003208,0.00012182645,0.99780506,0.00019269346,0.0002408026,0.0002005286,0.0000043609316,0.000084508516,0.0012702147],"genre_scores_gemma":[0.8272668,0.00010200373,0.16961163,0.0019817296,0.0006197978,0.000017914528,0.00019639947,0.000058362595,0.00014531608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991325,0.000004404595,0.00018232367,0.00030198006,0.00022469992,0.00015409912],"domain_scores_gemma":[0.9995928,0.00009545932,0.00004214515,0.00017291904,0.00005401554,0.00004270032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011321478,0.00016239453,0.00012766288,0.0002259265,0.00007801963,0.00007843962,0.00012868796,0.0001214008,0.000012674458],"category_scores_gemma":[0.0000064397127,0.00016839468,0.00002499572,0.00011847738,0.00005665146,0.00007659457,0.000019011877,0.00015943943,0.0000029655903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012006435,0.0000017321901,0.000029640441,0.000015088311,0.0000015787838,8.3220203e-7,0.000022562468,0.57359433,0.00025612745,0.0010387996,0.000015502457,0.42502257],"study_design_scores_gemma":[0.0001444766,0.00005569563,0.00013841985,0.00004877941,0.000005769861,0.0000036941567,1.0688388e-7,0.9695205,0.0049417648,0.023755386,0.0011805653,0.0002048258],"about_ca_topic_score_codex":0.000010321468,"about_ca_topic_score_gemma":0.00007319797,"teacher_disagreement_score":0.8281934,"about_ca_system_score_codex":0.000107524116,"about_ca_system_score_gemma":0.000041770436,"threshold_uncertainty_score":0.68669355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012998212,0.0010442716,0.99506617,0.0013991084,0.00058455573,0.00036623157,0.000008009113,0.00020058324,0.0013180729],"genre_scores_gemma":[0.0034764935,0.00014617438,0.992909,0.0013341625,0.00040704536,0.000010529586,0.000005368695,0.000032728552,0.0016784655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975434,0.000015735519,0.00036399707,0.0011754909,0.00042597487,0.00047541538],"domain_scores_gemma":[0.99809563,0.000454599,0.0001993725,0.000927029,0.00014553044,0.00017785476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048505698,0.00037942128,0.00039176602,0.0004036072,0.0003279984,0.000687747,0.0016768805,0.00022628534,0.00002214639],"category_scores_gemma":[0.00010668713,0.00035429266,0.00008958949,0.0003252689,0.0004087114,0.0006361122,0.0007925896,0.00029676256,0.0000063215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024366727,0.000009584347,0.000007745626,0.000041745745,0.000007536745,0.000019737949,0.00092289667,0.00506377,0.00004286881,0.305526,0.0003687029,0.687987],"study_design_scores_gemma":[0.00024006388,0.00012211365,0.000016687358,0.00032862584,0.000007594465,0.00007594677,3.2017095e-7,0.55386513,0.00033127816,0.438574,0.0059545645,0.00048370715],"about_ca_topic_score_codex":0.000012402308,"about_ca_topic_score_gemma":0.000009411457,"teacher_disagreement_score":0.6875033,"about_ca_system_score_codex":0.00008344332,"about_ca_system_score_gemma":0.00022008721,"threshold_uncertainty_score":0.9998909},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028727378,0.00025944354,0.98882234,0.00046880142,0.0013754029,0.00031955141,0.0000024671813,0.00006393678,0.0058153295],"genre_scores_gemma":[0.89425415,0.000016438244,0.10089444,0.002094444,0.00054549944,0.000027599457,0.0000027159017,0.000046386845,0.0021183451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571973,0.000034167842,0.00047511686,0.0018532296,0.0010794468,0.0008383155],"domain_scores_gemma":[0.9975843,0.00034679766,0.00032666937,0.00120534,0.00034721682,0.00018966413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039343347,0.0006909368,0.00055867585,0.00076351775,0.00031227103,0.0007213454,0.0037303432,0.00024244774,0.000120287776],"category_scores_gemma":[0.000049541064,0.000550536,0.00013958303,0.0005471336,0.0009041021,0.0018625455,0.0013385024,0.0009303503,0.00016178562],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015765092,0.00024091083,0.00015017344,0.000058572143,0.00012536233,0.000655043,0.0922486,0.03817555,0.0053476244,0.047506828,0.00027274084,0.815061],"study_design_scores_gemma":[0.0034663826,0.00884561,0.0006138145,0.006851916,0.000094401774,0.0018339712,0.00036577997,0.5973659,0.3191222,0.0148619125,0.036524344,0.010053734],"about_ca_topic_score_codex":0.000023280443,"about_ca_topic_score_gemma":0.00008620632,"teacher_disagreement_score":0.8913814,"about_ca_system_score_codex":0.00036316327,"about_ca_system_score_gemma":0.0004922827,"threshold_uncertainty_score":0.9996946},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086748315,0.00028577106,0.988501,0.00036427597,0.0009606939,0.00029859666,0.000003201912,0.00029099468,0.008427974],"genre_scores_gemma":[0.78190345,0.000015812875,0.21637723,0.00051433913,0.00024027299,0.000017050163,0.000002966679,0.000036732843,0.00089213613],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968729,0.000057232617,0.00038184712,0.0013314302,0.0007897044,0.00056687486],"domain_scores_gemma":[0.9972999,0.0007162231,0.00027160687,0.0013656345,0.00021521424,0.00013142517],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009158329,0.0004702915,0.00043115433,0.00071106513,0.000410571,0.0005926253,0.0024632479,0.00019805047,0.0000676645],"category_scores_gemma":[0.00007575343,0.00039251443,0.000119978504,0.00065395574,0.0010787825,0.0004882625,0.0005822501,0.00064988376,0.000031238786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001559284,0.00006172615,0.00024700921,0.000087201624,0.000027026274,0.000063780695,0.007120907,0.0065009734,0.000097370335,0.19879064,0.000024457015,0.78696334],"study_design_scores_gemma":[0.00041235206,0.00057055184,0.00024117743,0.0011633814,0.000034619745,0.00028426573,0.0000036410313,0.35274416,0.002170708,0.63935274,0.001539616,0.0014827793],"about_ca_topic_score_codex":0.000014982026,"about_ca_topic_score_gemma":0.000064315245,"teacher_disagreement_score":0.78548056,"about_ca_system_score_codex":0.00015512088,"about_ca_system_score_gemma":0.00017197219,"threshold_uncertainty_score":0.99985266},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033580625,0.00027097602,0.99646175,0.00032616514,0.00063059095,0.00043855977,0.0000018757925,0.00004565295,0.0014886017],"genre_scores_gemma":[0.3414918,0.00092162035,0.6555316,0.00088405964,0.00020487701,0.00001720177,0.000010919084,0.00006252176,0.0008754169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962774,0.00006323242,0.00067498913,0.0011597225,0.0012063999,0.00061826],"domain_scores_gemma":[0.9982817,0.00024266483,0.00027509392,0.00095446454,0.000072839815,0.00017322853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056403707,0.00040530832,0.00053307327,0.0009339886,0.0001169175,0.00010626725,0.0020495583,0.00023541266,0.000037564798],"category_scores_gemma":[0.00004380182,0.0003857793,0.00010640467,0.00056410494,0.0007285219,0.000389159,0.0010216319,0.00062751194,0.00003699348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036692106,0.00008044222,0.0002887032,0.000023782957,0.000007872756,0.000086717846,0.00070689776,0.8805655,0.00007127001,0.0040636626,0.00001047328,0.11409097],"study_design_scores_gemma":[0.0005092304,0.00023823635,0.0008976361,0.00031484096,0.0000035140954,0.00008182794,1.223139e-7,0.9879836,0.0007232171,0.0075809592,0.0011134678,0.00055334397],"about_ca_topic_score_codex":0.00001567245,"about_ca_topic_score_gemma":0.000053868564,"teacher_disagreement_score":0.341156,"about_ca_system_score_codex":0.00038295588,"about_ca_system_score_gemma":0.000523728,"threshold_uncertainty_score":0.9998594},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063749035,0.00062975666,0.98804754,0.000522165,0.0026121235,0.00057778304,0.0000039956863,0.00026095603,0.0009707883],"genre_scores_gemma":[0.3230792,0.000050898,0.67326015,0.001943978,0.0013745514,0.000025089226,0.000005099165,0.000065214976,0.00019580862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931384,0.000087267945,0.0013284886,0.0025779046,0.0015152488,0.0013527154],"domain_scores_gemma":[0.99657667,0.0005505485,0.000496456,0.0018200495,0.0002797969,0.00027650569],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013800521,0.0009023596,0.00086309673,0.0016153394,0.00038985087,0.0011780404,0.0048568468,0.00052678573,0.000055880908],"category_scores_gemma":[0.00008220207,0.0008979689,0.00022440124,0.000983063,0.0008561975,0.0011780586,0.0024298886,0.0015559944,0.00014555902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026448163,0.000046508027,0.0005136395,0.000011343913,0.000004733434,0.00013551307,0.0020178263,0.28512022,0.0007628945,0.0039641694,0.000010297356,0.7074102],"study_design_scores_gemma":[0.00012412507,0.00015548427,0.00024595033,0.0005292741,0.000007162165,0.00008581637,9.665505e-7,0.9744741,0.0054030563,0.017138174,0.0008035593,0.0010323751],"about_ca_topic_score_codex":0.00020367188,"about_ca_topic_score_gemma":0.00088252954,"teacher_disagreement_score":0.70637786,"about_ca_system_score_codex":0.0008540396,"about_ca_system_score_gemma":0.0005590595,"threshold_uncertainty_score":0.99985886},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012590438,0.00058451697,0.9860742,0.0019078364,0.003788751,0.00043244907,0.000021583024,0.00052700914,0.0054045883],"genre_scores_gemma":[0.65164554,0.000149113,0.3256346,0.020326061,0.0018147721,0.00003166232,0.00004323628,0.0001321027,0.00022292211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99454653,0.000052792577,0.00064589316,0.0022734336,0.0014606304,0.0010207058],"domain_scores_gemma":[0.99654156,0.00028405353,0.00044623416,0.002049733,0.0003434117,0.00033502968],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008964829,0.00086279935,0.0006708703,0.0009927726,0.0006376562,0.0010776136,0.005894976,0.000770606,0.000040314586],"category_scores_gemma":[0.000014656218,0.0007843506,0.00020270197,0.001043041,0.000443181,0.0010891572,0.0023115065,0.0022031544,0.0000619381],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001443809,0.00006353981,0.000055137287,0.00025234756,0.000031410724,0.0000742418,0.0024271086,0.002383516,0.027357982,0.0035612034,0.000009352023,0.96376973],"study_design_scores_gemma":[0.00075042754,0.00036101547,0.00013791476,0.0007480673,0.00004056781,0.00021292637,0.0000015839263,0.6631474,0.10039108,0.1637651,0.06809764,0.002346257],"about_ca_topic_score_codex":0.00032546432,"about_ca_topic_score_gemma":0.003516161,"teacher_disagreement_score":0.96142346,"about_ca_system_score_codex":0.00019546061,"about_ca_system_score_gemma":0.0004906382,"threshold_uncertainty_score":0.99995935},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006453953,0.00054943515,0.98800266,0.0012651572,0.00063401106,0.00039840027,0.000012299828,0.00023803036,0.0024460698],"genre_scores_gemma":[0.6214897,0.000056897174,0.36361185,0.014264833,0.00044084643,0.0000066342373,0.00005408986,0.000042399563,0.000032742755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99516934,0.000067932204,0.0007125764,0.0021425565,0.0011450277,0.0007625579],"domain_scores_gemma":[0.99611986,0.0007077668,0.00038946216,0.0019316565,0.00051427743,0.00033699133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012109319,0.00067882665,0.00085555343,0.0020118342,0.00039280416,0.0006082014,0.0027853055,0.00038585928,0.000024814812],"category_scores_gemma":[0.000008829559,0.0006218731,0.00018995447,0.0031157117,0.0004174645,0.0006306367,0.0017695177,0.00090147904,0.000031051302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006419577,0.00018999947,0.0028448764,0.00038168105,0.0003809867,0.00023245264,0.0096458625,0.072343625,0.00060910237,0.02873677,0.0000063205534,0.8845641],"study_design_scores_gemma":[0.00058090064,0.0002008352,0.0076067816,0.0003700004,0.00024416074,0.00011485691,0.0000021779438,0.9313924,0.0014422921,0.055369414,0.0011861628,0.0014900435],"about_ca_topic_score_codex":0.00048767566,"about_ca_topic_score_gemma":0.005029819,"teacher_disagreement_score":0.8830741,"about_ca_system_score_codex":0.00019302218,"about_ca_system_score_gemma":0.00021654453,"threshold_uncertainty_score":0.99962324},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018396473,0.00022404191,0.99437153,0.0000056916806,0.0008018401,0.0001094506,0.000012990563,0.00012266228,0.0041678227],"genre_scores_gemma":[0.813697,0.00002609748,0.18596213,0.000015523214,0.00017197256,0.0000019499246,0.000008552087,0.000028028406,0.00008879052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990601,0.0000037495151,0.00022251476,0.00028963303,0.00020290667,0.00022110535],"domain_scores_gemma":[0.99947846,0.00005918096,0.00006550219,0.00030364105,0.00004931391,0.000043910153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093714574,0.0002135881,0.00022044335,0.00033881338,0.000039338862,0.000016330174,0.0003581904,0.00014626066,0.000020553425],"category_scores_gemma":[0.000025493624,0.00019938189,0.000042097166,0.000090219335,0.00027820191,0.00006944148,0.00007975714,0.00032983697,0.000008527152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028844383,0.0000022302518,0.0000063498705,0.00004183523,0.000003502894,0.0000029334944,0.00014877926,0.90477014,0.000050540824,0.0013876224,0.0000012842406,0.09358189],"study_design_scores_gemma":[0.00014505818,0.00007621344,0.0003230181,0.00024744993,0.0000120109835,0.000024169429,8.94574e-8,0.7778401,0.006246558,0.21450767,0.00015614036,0.00042157888],"about_ca_topic_score_codex":0.000016411337,"about_ca_topic_score_gemma":0.000043003503,"teacher_disagreement_score":0.813513,"about_ca_system_score_codex":0.00015158573,"about_ca_system_score_gemma":0.00004631649,"threshold_uncertainty_score":0.8130557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008367374,0.000276475,0.9866455,0.0016795382,0.0012487383,0.0002757488,0.0000043140612,0.00017399731,0.009612021],"genre_scores_gemma":[0.11217231,0.00035323814,0.87851024,0.0031246988,0.0013888805,0.000031975735,0.000033403434,0.000060421466,0.0043248152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681807,0.000026431315,0.0004529878,0.0013380281,0.0008238255,0.0005406326],"domain_scores_gemma":[0.9979914,0.00018373913,0.0002498095,0.0012110233,0.00020200087,0.00016204413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053949194,0.00040051818,0.00036000175,0.0006058234,0.0002667677,0.00036735254,0.002206608,0.00031331088,0.00005706311],"category_scores_gemma":[0.00004827105,0.00033995346,0.00011393221,0.00040507354,0.00033874784,0.00088671246,0.0007058502,0.0006243737,0.00037776222],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044584813,0.000037580852,0.00001462363,0.000024115343,0.0000043584855,0.000025411087,0.00039513275,0.008458884,0.0009989948,0.010904144,0.00020133062,0.97893095],"study_design_scores_gemma":[0.00021957766,0.000104420105,0.00016124282,0.00049244915,0.000008319878,0.00004554497,2.613979e-7,0.9010822,0.004689847,0.07361306,0.018912263,0.00067078834],"about_ca_topic_score_codex":0.000013399829,"about_ca_topic_score_gemma":0.00003675675,"teacher_disagreement_score":0.97826016,"about_ca_system_score_codex":0.00021801588,"about_ca_system_score_gemma":0.0003477571,"threshold_uncertainty_score":0.9999052},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057405257,0.0005543857,0.9890284,0.00052551995,0.0006066874,0.00025286665,0.0000048023157,0.00008304234,0.0032037601],"genre_scores_gemma":[0.82134986,0.000075391334,0.1776832,0.0007403114,0.00009585776,0.000006677075,0.0000019590836,0.00001613402,0.000030579144],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975099,0.00003879983,0.00033167936,0.0012131376,0.00044302002,0.0004634863],"domain_scores_gemma":[0.99840665,0.00044029768,0.00013484278,0.0007657469,0.00009560447,0.00015688757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009818946,0.0003544167,0.00034119558,0.0009223339,0.00034253867,0.0005382643,0.0013263436,0.00026004028,0.000009119482],"category_scores_gemma":[0.00008625609,0.00033592194,0.000056146135,0.0006588424,0.0012730066,0.0004856886,0.00089686614,0.0009615331,0.000004835413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051367915,0.000035438956,0.00064392574,0.000037483085,0.0000032201037,0.000052311847,0.0030900042,0.00056799303,0.0005357897,0.22320017,0.0000016577826,0.77182686],"study_design_scores_gemma":[0.00029832427,0.00015768774,0.003896589,0.00019212104,0.0000068376316,0.00013373322,8.520982e-7,0.06791926,0.0004252123,0.9259614,0.00039902446,0.0006089732],"about_ca_topic_score_codex":0.000022469509,"about_ca_topic_score_gemma":0.00036809692,"teacher_disagreement_score":0.81560934,"about_ca_system_score_codex":0.000058204892,"about_ca_system_score_gemma":0.0001944704,"threshold_uncertainty_score":0.9999093},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052870754,0.00036185802,0.9916505,0.00030354323,0.00029560554,0.0005042894,0.000019348821,0.000031636322,0.0015461167],"genre_scores_gemma":[0.76459813,0.00012432555,0.23488446,0.00019005501,0.000117898504,0.000012148479,0.000012038178,0.000015546873,0.00004539193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758047,0.000031941756,0.00066986564,0.00076655654,0.0006107073,0.0003404522],"domain_scores_gemma":[0.9981958,0.00018458786,0.00040808256,0.00071908237,0.00041414722,0.00007825084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006238531,0.00029306818,0.000474534,0.00052290614,0.00016518665,0.00026730707,0.0009996686,0.00015092832,0.000046980585],"category_scores_gemma":[0.000041991894,0.00026593206,0.000083918196,0.00039817856,0.00051430304,0.0008420829,0.00073058903,0.00031360128,0.000001985102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013782424,0.00007825588,0.0016171572,0.0007980539,0.000046373603,0.000008981474,0.008601231,0.0036245724,0.0028124338,0.43384045,0.00009659728,0.5484621],"study_design_scores_gemma":[0.0004430105,0.00023946367,0.0004449292,0.0006756307,0.000016514987,0.000036595888,0.000003748389,0.7633431,0.006862785,0.22606713,0.0012719311,0.00059518806],"about_ca_topic_score_codex":0.00027528693,"about_ca_topic_score_gemma":0.0001460057,"teacher_disagreement_score":0.75971854,"about_ca_system_score_codex":0.00006140856,"about_ca_system_score_gemma":0.00024925222,"threshold_uncertainty_score":0.9999793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11082144,0.011972977,0.63852733,0.0003316368,0.011372528,0.0017074627,0.00009271237,0.0009653028,0.22420861],"genre_scores_gemma":[0.95880526,0.000011964242,0.009918919,0.00031925624,0.0028597459,0.000009617884,0.000023007973,0.00006407582,0.027988175],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.998237,0.00004739951,0.00033818354,0.00056602934,0.00045804118,0.00035335947],"domain_scores_gemma":[0.9985166,0.00052939303,0.00027625743,0.00027307367,0.00032186278,0.000082791565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009843422,0.00028833718,0.00044372663,0.000358019,0.00034169597,0.00044820295,0.0005589942,0.00014647043,0.00061392714],"category_scores_gemma":[0.0005561966,0.00024813117,0.0001342835,0.00004085105,0.0006203799,0.00023619246,0.00023156073,0.00090415025,0.000014613493],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003640723,0.000035647692,0.00009391395,0.0003756013,0.00004325481,0.000048983038,0.5580593,0.008363733,0.00013137537,0.05759911,0.00024741495,0.37496525],"study_design_scores_gemma":[0.0010459945,0.0012959774,0.000031029816,0.0020306497,0.00008125159,0.000048641574,0.0011340077,0.01443942,0.00061850256,0.06800276,0.9097166,0.0015551578],"about_ca_topic_score_codex":0.000090591755,"about_ca_topic_score_gemma":0.0005143751,"teacher_disagreement_score":0.9094692,"about_ca_system_score_codex":0.00007254151,"about_ca_system_score_gemma":0.00019276333,"threshold_uncertainty_score":0.9999971},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051500556,0.00008517252,0.9925771,0.0005582008,0.0005911415,0.0006001991,0.00024377424,0.00074484176,0.004548123],"genre_scores_gemma":[0.14083657,0.00006580652,0.854803,0.0022907807,0.00072946766,0.0000626413,0.00078178186,0.000089927256,0.00034000378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99521554,0.000044970246,0.00062746287,0.0020818515,0.0013251518,0.0007050276],"domain_scores_gemma":[0.99551165,0.0007370113,0.00060542225,0.0027788559,0.00022789142,0.00013917676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072309485,0.0006447018,0.0005011036,0.0008650728,0.0003649913,0.00074453634,0.0037663074,0.00031321158,0.00000799809],"category_scores_gemma":[0.00018827833,0.00054419227,0.00006782109,0.00070722547,0.00057693553,0.0013169388,0.0009130203,0.0009192692,0.000042552154],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042533222,0.00012194579,0.00032719522,0.00009605936,0.000023288889,0.00020627455,0.00024996628,0.028344663,0.0020692046,0.034748293,0.003946203,0.92982435],"study_design_scores_gemma":[0.001354552,0.0015066202,0.003971905,0.0034714052,0.000035348898,0.00040813076,3.6394593e-7,0.8018651,0.05131619,0.09681084,0.036262754,0.0029967634],"about_ca_topic_score_codex":0.00003183942,"about_ca_topic_score_gemma":0.000038990205,"teacher_disagreement_score":0.9268276,"about_ca_system_score_codex":0.0004387645,"about_ca_system_score_gemma":0.00046418488,"threshold_uncertainty_score":0.99970096},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005229769,0.0012929706,0.99055195,0.0033718576,0.0020521875,0.000594908,0.000014566656,0.0010013611,0.00059722306],"genre_scores_gemma":[0.3099006,0.00006841496,0.68914545,0.00066516746,0.00012207398,0.000025012578,0.0000116236815,0.00005172896,0.000009948614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99408877,0.00009505253,0.000982769,0.0021256653,0.0011839828,0.0015237805],"domain_scores_gemma":[0.98940355,0.00055710156,0.0004421929,0.009212877,0.00016640351,0.00021788006],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00216774,0.0008011293,0.0008831519,0.0019057867,0.0002630378,0.0008005523,0.042827096,0.00071568653,0.000016706372],"category_scores_gemma":[0.00087264855,0.0007705033,0.00015106874,0.0012974028,0.00027230137,0.0016608795,0.04602295,0.0014580216,0.00004442784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005229577,0.00016904005,0.0026165633,0.0012663399,0.000053395324,0.0004378335,0.0010377202,0.20516616,0.00024670348,0.02901022,0.00023849959,0.75970525],"study_design_scores_gemma":[0.00047947667,0.00003403095,0.000024739229,0.0018695127,0.000008799229,0.000038845745,0.0000010809499,0.9357121,0.0005281297,0.060093403,0.00046433412,0.000745544],"about_ca_topic_score_codex":0.00018519822,"about_ca_topic_score_gemma":0.00021003805,"teacher_disagreement_score":0.75895965,"about_ca_system_score_codex":0.0013954142,"about_ca_system_score_gemma":0.00040829222,"threshold_uncertainty_score":0.9994746},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037313555,0.00029276553,0.99481833,0.00053533626,0.0024435942,0.00049445714,0.0000053457893,0.00073223084,0.0006406143],"genre_scores_gemma":[0.0329654,0.0000076058413,0.95324826,0.0132867,0.00027399012,0.000013112099,0.000002078626,0.00007232613,0.00013050347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949874,0.00006872155,0.00071536563,0.0021013038,0.0011877115,0.0009394947],"domain_scores_gemma":[0.99659216,0.00023206224,0.00046839693,0.0019963463,0.00044738615,0.0002636722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091792527,0.0007596684,0.00062370236,0.0014938824,0.0004519218,0.00074164773,0.003107594,0.00041079635,0.000027935414],"category_scores_gemma":[0.00018245577,0.0007811389,0.0002003608,0.0009457508,0.00066366856,0.0011405306,0.0008824909,0.0013149485,0.000021875507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010460202,0.00006121746,0.00008392391,0.00011807844,0.000013883893,0.00043293953,0.00023770482,0.18028714,0.0026875488,0.01067944,0.00006969565,0.805318],"study_design_scores_gemma":[0.00029411528,0.000172638,0.000011165863,0.000680153,0.000010082278,0.00014375932,9.5817846e-8,0.84975034,0.024194593,0.11807719,0.0055180998,0.0011477759],"about_ca_topic_score_codex":0.000034450633,"about_ca_topic_score_gemma":0.000024398054,"teacher_disagreement_score":0.8041702,"about_ca_system_score_codex":0.00081018504,"about_ca_system_score_gemma":0.0007018916,"threshold_uncertainty_score":0.999464},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009154703,0.001681977,0.9954221,0.00015304417,0.0010948597,0.00026553156,0.0000018690273,0.0002848434,0.001004214],"genre_scores_gemma":[0.06342389,0.000053968204,0.93590593,0.00020002501,0.00026822952,0.0000029001603,0.0000041661133,0.000024970868,0.00011592194],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731106,0.000048496488,0.00049710996,0.0010405919,0.00071257615,0.00039017777],"domain_scores_gemma":[0.99751735,0.00015075991,0.00049258006,0.0011864173,0.00055992405,0.0000929592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090456614,0.0003570265,0.00038782094,0.0008525258,0.00013553322,0.00020736619,0.002613278,0.0003694009,0.000014405277],"category_scores_gemma":[0.00015376239,0.00032212283,0.000075893746,0.0008177695,0.00057533424,0.00070071203,0.0007903273,0.00067169225,0.00001015937],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066435405,0.000015488831,0.000030100806,0.000050940645,0.000005034881,0.000026841974,0.0003845782,0.00017304815,0.00272153,0.105759464,0.000007641016,0.89081866],"study_design_scores_gemma":[0.000089092704,0.00017060083,0.000027295851,0.0009405369,0.000011027583,0.00008992894,6.0547045e-8,0.22063005,0.027382433,0.74941564,0.0007064792,0.00053683907],"about_ca_topic_score_codex":0.00005573672,"about_ca_topic_score_gemma":0.000018768751,"teacher_disagreement_score":0.89028186,"about_ca_system_score_codex":0.00027219107,"about_ca_system_score_gemma":0.0005856947,"threshold_uncertainty_score":0.9999231},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000096714175,0.0010917298,0.9931002,0.0006547749,0.0013385767,0.0010958245,0.000038720063,0.000049997336,0.002533458],"genre_scores_gemma":[0.53705764,0.00020637111,0.44646612,0.0031963054,0.0028163174,0.00021753239,0.000045085122,0.00014344264,0.009851214],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980034,0.0000113735605,0.0006775518,0.0008225719,0.00008080346,0.00040430253],"domain_scores_gemma":[0.9980944,0.0005382837,0.0006261366,0.0006142352,0.0000737176,0.000053243435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002075235,0.00029953304,0.00050706207,0.00030242777,0.00025683103,0.0002995461,0.0009171037,0.00022729856,0.000022756501],"category_scores_gemma":[0.00013624919,0.00024721836,0.00016079574,0.00018538265,0.0002888681,0.00016097157,0.00010810906,0.00033761113,0.000034229604],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026030571,0.000022223647,0.000032212964,0.00006516572,0.00003165214,0.000001992421,0.0006485051,0.005791616,0.000055353965,0.12196105,0.000017951625,0.87134624],"study_design_scores_gemma":[0.00039766045,0.00020923825,0.000041457988,0.00014469854,0.000006851442,0.000008591595,2.3368216e-7,0.35874116,0.00020826948,0.6299261,0.009953153,0.00036256047],"about_ca_topic_score_codex":0.00003130565,"about_ca_topic_score_gemma":0.000018945115,"teacher_disagreement_score":0.87098366,"about_ca_system_score_codex":0.00015636004,"about_ca_system_score_gemma":0.00006153772,"threshold_uncertainty_score":0.99999803},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028427395,0.0016289664,0.9931337,0.00017144401,0.00060059124,0.0003992054,0.000011658973,0.00024243668,0.0009692334],"genre_scores_gemma":[0.51806724,0.0000040303444,0.48147103,0.00025173716,0.00009213884,0.000007884636,0.000013707755,0.00001859564,0.00007363562],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99639505,0.000038490376,0.00065263343,0.0011664237,0.001255915,0.00049149035],"domain_scores_gemma":[0.9979604,0.00015405382,0.0004750195,0.0010306542,0.00029074008,0.00008916142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066921365,0.0004834635,0.00048199866,0.000904308,0.00013188123,0.00041396313,0.002692397,0.00026233683,0.000018173763],"category_scores_gemma":[0.000026971264,0.0004286929,0.00012310054,0.00057824265,0.00054116955,0.00041231388,0.0016971659,0.00053216715,0.000019044746],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013573105,0.0006242767,0.0023791636,0.00081239524,0.00012475647,0.00061693153,0.0029761102,0.13206145,0.04574924,0.03277072,0.00033219182,0.781417],"study_design_scores_gemma":[0.0005917378,0.00030613615,0.00027173123,0.0017413456,0.0000391331,0.00009482847,1.3522202e-7,0.31524712,0.4695668,0.21033287,0.00029077346,0.0015173828],"about_ca_topic_score_codex":0.000070545284,"about_ca_topic_score_gemma":0.000011176164,"teacher_disagreement_score":0.77989966,"about_ca_system_score_codex":0.0003511098,"about_ca_system_score_gemma":0.00019977568,"threshold_uncertainty_score":0.9998165},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3870418,0.00004270809,0.60985667,0.0024308092,0.000112094545,0.00036397425,0.0000014665512,0.000024638373,0.00012587296],"genre_scores_gemma":[0.81510895,0.0000074291584,0.18081978,0.003493411,0.0005254396,0.0000276074,0.000005755062,0.000005700245,0.0000059385375],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980808,0.00006489005,0.00030347027,0.0006197505,0.0005202657,0.0004108231],"domain_scores_gemma":[0.9989231,0.00041452062,0.00003943521,0.00033175523,0.00010811878,0.0001830569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013152381,0.000109138884,0.00019554753,0.0002613427,0.00007293507,0.000076594486,0.0003310679,0.000080498896,0.000037719616],"category_scores_gemma":[0.00041736735,0.00009165296,0.000031172196,0.0012234112,0.00013708328,0.00016436802,0.00022626694,0.00042049808,0.000044540637],"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.000054121712,0.00018947388,0.5096965,0.0000066653324,0.0000037187908,0.000009466668,0.00035913524,0.005100197,0.0024962109,0.000010915856,0.000032610147,0.482041],"study_design_scores_gemma":[0.0010743067,0.00030289486,0.71248907,0.00015453045,0.000007220605,0.000010105632,0.0000032270095,0.27731106,0.0067468975,0.0010746416,0.0007078388,0.000118199314],"about_ca_topic_score_codex":0.00025407787,"about_ca_topic_score_gemma":0.0002967922,"teacher_disagreement_score":0.4819228,"about_ca_system_score_codex":0.0001364712,"about_ca_system_score_gemma":0.00022989146,"threshold_uncertainty_score":0.3737499},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018007508,0.000026590893,0.9920654,0.00035033622,0.0008508098,0.0005876931,0.000059964877,0.000030465417,0.0058486555],"genre_scores_gemma":[0.7798566,0.000007882536,0.20155759,0.0009776718,0.005426942,0.000108055196,0.00042612624,0.00012138246,0.011517704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982123,0.000013378386,0.00035188432,0.0006767965,0.0003012845,0.00044436182],"domain_scores_gemma":[0.9988079,0.00016412014,0.0002098432,0.0005127023,0.00019770126,0.00010770725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000468293,0.0002596223,0.00026500286,0.00022128037,0.00035605446,0.00020636256,0.00053699926,0.00011182029,0.00005407546],"category_scores_gemma":[0.000013787552,0.00024390747,0.00015159759,0.00013270348,0.00036997357,0.00008226128,0.00021180318,0.00028636324,0.000075615186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010856828,0.000102291284,0.000081252576,0.000073548756,0.00003449492,0.0000014823995,0.00077421736,0.08907507,0.00056456804,0.48740646,0.00041235192,0.4214634],"study_design_scores_gemma":[0.0003232807,0.00011509471,0.000027871281,0.00018455372,0.00003134793,0.0000027011836,0.0000011827825,0.49417388,0.0012579138,0.47438583,0.028993845,0.00050249934],"about_ca_topic_score_codex":0.00005596016,"about_ca_topic_score_gemma":0.000030597927,"teacher_disagreement_score":0.7905078,"about_ca_system_score_codex":0.00009609734,"about_ca_system_score_gemma":0.00032242664,"threshold_uncertainty_score":0.99462587},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022923483,0.0003756804,0.9942553,0.0006862917,0.0014379874,0.00091724575,0.000016831875,0.00030877074,0.0019789713],"genre_scores_gemma":[0.055711165,0.000013384168,0.9413667,0.0023547458,0.0003279374,0.000027144992,0.0000110308565,0.000040615636,0.00014730243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945401,0.000044598422,0.0008106713,0.0022797734,0.0012885265,0.0010363647],"domain_scores_gemma":[0.99489754,0.0016120466,0.00037031292,0.0017497354,0.0010489464,0.0003213938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025785083,0.00070558616,0.00071453844,0.0013560981,0.0003432214,0.0006354013,0.00414565,0.0006168698,0.00001603431],"category_scores_gemma":[0.00034463487,0.0006333754,0.0002601528,0.0014108011,0.0008087952,0.00049744564,0.00076185295,0.00094079424,0.00002409528],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022448194,0.000073072224,0.00003920975,0.00011664469,0.000013568933,0.000032979206,0.00019282592,0.01955703,0.00003977288,0.08324026,0.000036153357,0.896636],"study_design_scores_gemma":[0.00024734138,0.0002356232,0.00001876635,0.0002264446,0.000008573005,0.000009966002,3.602864e-8,0.6611582,0.001194185,0.33554783,0.00080903503,0.0005440273],"about_ca_topic_score_codex":0.000022339394,"about_ca_topic_score_gemma":0.00006708511,"teacher_disagreement_score":0.896092,"about_ca_system_score_codex":0.00049564656,"about_ca_system_score_gemma":0.001633013,"threshold_uncertainty_score":0.99961174},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048978804,0.0006296519,0.9942458,0.00033830295,0.0022715426,0.0006059477,0.000008679112,0.00028063156,0.001570455],"genre_scores_gemma":[0.12585849,0.000015399472,0.8718325,0.0007988816,0.0010532778,0.00002391897,0.000016372582,0.00006051589,0.00034063283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99551654,0.000055928624,0.00065792067,0.0019186294,0.0008669955,0.000984016],"domain_scores_gemma":[0.9962715,0.0017198367,0.00036297072,0.0011019906,0.00039018487,0.00015353008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019818638,0.0006312515,0.0007145942,0.00076180743,0.00041311444,0.0007711952,0.0028480687,0.00040484776,0.000006717238],"category_scores_gemma":[0.00029995563,0.0005974433,0.00027275912,0.00053528993,0.00043423343,0.00074548204,0.0007034605,0.0006863765,0.00001749321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008971563,0.000045558365,0.0003958062,0.000062973915,0.000013022422,0.00005638485,0.00019761802,0.1507365,0.00017767919,0.003528029,0.00012353803,0.8446539],"study_design_scores_gemma":[0.0005905078,0.00021989274,0.0009067415,0.00027728485,0.000008695538,0.00004686295,6.9624896e-8,0.9029019,0.0033577164,0.08447652,0.0062255505,0.0009882785],"about_ca_topic_score_codex":0.00003712926,"about_ca_topic_score_gemma":0.0001914313,"teacher_disagreement_score":0.84366566,"about_ca_system_score_codex":0.00024390529,"about_ca_system_score_gemma":0.0004302063,"threshold_uncertainty_score":0.9996477},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013591058,0.0013302345,0.9367594,0.05531703,0.0023123731,0.0018450688,0.00013248243,0.0007266173,0.0015631833],"genre_scores_gemma":[0.0063112304,0.00017583377,0.98998314,0.0025978761,0.00040825363,0.000056575598,0.00018807282,0.00005423756,0.00022476434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99102134,0.00008016657,0.0011991358,0.004312625,0.0017161855,0.0016705573],"domain_scores_gemma":[0.9613916,0.0013889442,0.0008979725,0.035541773,0.00047825254,0.00030145815],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.004833715,0.00079691585,0.0009317979,0.0009330737,0.0006188445,0.004224889,0.16083853,0.000557303,0.00007477096],"category_scores_gemma":[0.02398456,0.00075526093,0.00012124124,0.0008823442,0.0007915627,0.008521917,0.34035146,0.0016432402,0.000040499723],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004207477,0.000048506714,0.000033472978,0.00021988692,0.000021129285,0.000007653067,0.00017121802,0.00012359633,0.000026228312,0.006068366,0.055995587,0.9372802],"study_design_scores_gemma":[0.00018867665,0.000100441175,0.00004021217,0.00042028358,0.000003365791,0.000010251325,1.5022789e-7,0.5477838,0.00037590793,0.42890307,0.021711513,0.0004623333],"about_ca_topic_score_codex":0.00023006843,"about_ca_topic_score_gemma":0.00016262248,"teacher_disagreement_score":0.9368178,"about_ca_system_score_codex":0.0006173142,"about_ca_system_score_gemma":0.0018449668,"threshold_uncertainty_score":0.99948984},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010404426,0.00043848282,0.98305124,0.000700186,0.0021821046,0.00037042343,0.00000685614,0.00018289256,0.013057406],"genre_scores_gemma":[0.011429501,0.000089698915,0.9858244,0.0009569825,0.00060712674,0.000013661421,0.000011642108,0.000038823713,0.001028176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961257,0.00008307788,0.0006584208,0.0012552314,0.0011243523,0.0007532455],"domain_scores_gemma":[0.99596244,0.00087699015,0.00037413885,0.002419208,0.00025140145,0.00011583819],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024871172,0.00045358256,0.00036417326,0.00035651767,0.00079669367,0.0008471367,0.005839733,0.00028736977,0.000009057824],"category_scores_gemma":[0.00020491694,0.00033342134,0.00013266406,0.0006943209,0.0010869206,0.000621792,0.0013917043,0.00084807386,0.000072228686],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052702358,0.000009536655,0.000025867004,0.00001058483,0.0000045707743,0.000014951664,0.00013141519,0.016937364,0.000029587112,0.18756872,0.00024273514,0.7950194],"study_design_scores_gemma":[0.0001436157,0.000087378554,0.00050855137,0.00007379311,0.0000045302822,0.000048547943,6.7079974e-8,0.58449066,0.0010482415,0.3448442,0.06819816,0.00055224536],"about_ca_topic_score_codex":0.000034442844,"about_ca_topic_score_gemma":0.00009825295,"teacher_disagreement_score":0.79446715,"about_ca_system_score_codex":0.0003999972,"about_ca_system_score_gemma":0.00043601196,"threshold_uncertainty_score":0.9999118},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007977569,0.00054264325,0.9927481,0.00028603166,0.003943521,0.0012126353,0.00066331116,0.0002253578,0.0003704397],"genre_scores_gemma":[0.0035835898,0.000047130718,0.9937288,0.0009674468,0.00048608697,0.00013688489,0.00018227696,0.00006675192,0.0008010333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555594,0.00004421042,0.00073916937,0.001911918,0.00084935635,0.0008993992],"domain_scores_gemma":[0.99613893,0.00051041774,0.00045535003,0.002098165,0.00053795124,0.00025915966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009299824,0.0006846981,0.0007801371,0.0005216052,0.00042520498,0.00040596604,0.001977305,0.00030226487,0.0000057401157],"category_scores_gemma":[0.00023613624,0.00061083306,0.00017454816,0.00047303998,0.000380695,0.001037632,0.0009051395,0.0004985216,0.000029535015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007768083,0.00003028787,0.0000033033837,0.00018760595,0.000017581917,0.00008125079,0.00013763011,0.010872482,0.0003181407,0.96103287,0.0002107747,0.02710033],"study_design_scores_gemma":[0.0010009281,0.00026308667,0.000003555204,0.001160794,0.000021012953,0.00024326665,0.0000010273438,0.75812215,0.00449104,0.15690404,0.07602267,0.0017664452],"about_ca_topic_score_codex":0.000061981074,"about_ca_topic_score_gemma":0.00005865717,"teacher_disagreement_score":0.8041288,"about_ca_system_score_codex":0.000349622,"about_ca_system_score_gemma":0.00041166134,"threshold_uncertainty_score":0.9996343},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046983224,0.00039085883,0.99599135,0.00014791152,0.00081953657,0.00046324884,0.0000032729426,0.00018057575,0.0015334169],"genre_scores_gemma":[0.9505549,0.000026670452,0.046750646,0.00034507064,0.0012722901,0.00006914662,0.00005024938,0.000063858985,0.0008671799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986671,0.000006299915,0.00031896328,0.00046411972,0.0003339234,0.00020955394],"domain_scores_gemma":[0.99920404,0.000056922763,0.000064408014,0.00049945427,0.00010223138,0.00007297006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001902245,0.00021435617,0.00024241202,0.0003978834,0.00011355934,0.00016158994,0.00037971555,0.00016196581,0.000007065129],"category_scores_gemma":[0.000018173596,0.00022216141,0.000044304255,0.0002471933,0.00005651654,0.00014592554,0.00005994277,0.00022879824,0.00006015596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051960724,0.000004240357,0.000024519024,0.000045216322,0.000009923729,0.000010134714,0.0010214674,0.628152,0.012270494,0.00037032558,0.00037354836,0.3577129],"study_design_scores_gemma":[0.0001762532,0.000022735683,0.00058191025,0.00028511143,0.000004757048,0.000025578984,7.92588e-8,0.9783294,0.0008515287,0.0017866094,0.01757513,0.00036090694],"about_ca_topic_score_codex":0.000009736809,"about_ca_topic_score_gemma":0.000023725153,"teacher_disagreement_score":0.95008504,"about_ca_system_score_codex":0.00019968134,"about_ca_system_score_gemma":0.000044669396,"threshold_uncertainty_score":0.9059479},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015614182,0.0011290901,0.9922503,0.0003261348,0.004209085,0.0010707376,0.00001476724,0.0002609598,0.0005827614],"genre_scores_gemma":[0.025654448,0.0004666072,0.96906763,0.0013844981,0.0027309337,0.000040448864,0.000034136327,0.0001366263,0.00048469368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99296796,0.00009838066,0.0013411572,0.002380406,0.0015140653,0.0016980513],"domain_scores_gemma":[0.9934317,0.0022784302,0.0009616457,0.0023015698,0.000655491,0.00037116883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014034434,0.0010437926,0.0013607758,0.0006884641,0.0004941315,0.00018945613,0.0043598334,0.00085129344,0.000013550233],"category_scores_gemma":[0.000099860685,0.0010117617,0.00041417527,0.0010489168,0.001321476,0.00032111013,0.0016738998,0.0011516702,0.000018879142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036177895,0.00006082789,0.000035322646,0.00004478891,0.000034353674,0.0000573886,0.00030025165,0.8873631,0.000027240121,0.00067653815,0.00028683068,0.11107719],"study_design_scores_gemma":[0.00075933884,0.0002713322,0.000024501813,0.0007075614,0.000021148877,0.00006318957,1.8062222e-7,0.99294245,0.0005684343,0.00081388117,0.002833084,0.0009948909],"about_ca_topic_score_codex":0.000021350847,"about_ca_topic_score_gemma":0.00003866748,"teacher_disagreement_score":0.1100823,"about_ca_system_score_codex":0.0003753474,"about_ca_system_score_gemma":0.0005883486,"threshold_uncertainty_score":0.9992333},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051567313,0.00006257394,0.99798363,0.00028357492,0.0002561692,0.0009532801,0.000005669314,0.00018896996,0.00021455575],"genre_scores_gemma":[0.048158206,0.0000074266377,0.951581,0.00013234951,0.000072918585,0.000017124923,0.000004304943,0.000018158938,0.000008486473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970871,0.000025790416,0.0005241728,0.0007155552,0.0013073822,0.00033997538],"domain_scores_gemma":[0.9979312,0.00016133276,0.00027634145,0.00079220894,0.000765588,0.000073330586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022012095,0.00031120022,0.00038015793,0.0006495208,0.000088596935,0.00012812202,0.0011200246,0.0002833604,0.0000017106767],"category_scores_gemma":[0.000053648608,0.00031069032,0.00012184836,0.00029689027,0.0001541588,0.0009476926,0.00016481748,0.00034594358,7.112309e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023599014,0.0000105104245,2.5806688e-7,0.000022662549,0.000002562757,5.812259e-7,0.00027472674,0.5040029,0.00015371575,0.07365075,0.0000023752577,0.42187658],"study_design_scores_gemma":[0.00017224376,0.00008317673,0.0000021047606,0.00021329761,0.00002036381,0.000019610561,1.2728596e-8,0.79516095,0.0025680433,0.20136052,0.00015761226,0.00024208642],"about_ca_topic_score_codex":0.000003954597,"about_ca_topic_score_gemma":0.0000046353975,"teacher_disagreement_score":0.4216345,"about_ca_system_score_codex":0.0004403019,"about_ca_system_score_gemma":0.0009886095,"threshold_uncertainty_score":0.9999345},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018477961,0.000100242585,0.9938768,0.0021933476,0.0004519895,0.00054674956,0.0000061123546,0.00013814378,0.002501836],"genre_scores_gemma":[0.21248226,0.000007088974,0.78427756,0.0024062444,0.0003760864,0.000076098535,0.000020720787,0.000034530927,0.00031942295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696916,0.00002143296,0.00036336062,0.0011894829,0.0009523923,0.0005041694],"domain_scores_gemma":[0.99776435,0.000114057104,0.00017873912,0.0011131557,0.00058777735,0.00024192559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056683534,0.00035598155,0.00031163968,0.0006304531,0.00026903208,0.00052269094,0.0016188187,0.00013760859,0.000039926894],"category_scores_gemma":[0.000019070018,0.0003052898,0.000049402122,0.0013974028,0.0002860325,0.0004476091,0.00064855284,0.00037516587,0.000067333625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022606902,0.00009685216,0.00053750374,0.000045640547,0.0000346732,0.000051399686,0.0039069857,0.12598585,0.00008778339,0.29010046,0.0010187963,0.57811147],"study_design_scores_gemma":[0.0013779246,0.0011031742,0.001391708,0.0005382279,0.000036503585,0.00012475431,0.0000017268201,0.4778138,0.00036079573,0.31161642,0.20323016,0.0024047778],"about_ca_topic_score_codex":0.0000596641,"about_ca_topic_score_gemma":0.000518848,"teacher_disagreement_score":0.5757067,"about_ca_system_score_codex":0.00020292048,"about_ca_system_score_gemma":0.00044001013,"threshold_uncertainty_score":0.9999399},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006345891,0.0006637075,0.9974234,0.0001945245,0.00093334494,0.00023488706,0.000012571679,0.000101290694,0.0003728012],"genre_scores_gemma":[0.0045550927,0.0001252448,0.9945399,0.00022704543,0.0003579298,0.000007361123,0.0000030672998,0.000046702116,0.00013764812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985473,0.00000645821,0.0004467225,0.00041369992,0.00026612004,0.00031966268],"domain_scores_gemma":[0.99866384,0.00049905234,0.000102829385,0.0005274828,0.00010944149,0.00009734019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038274354,0.0002982937,0.00038749137,0.00026777768,0.00011823651,0.0002479031,0.0006821924,0.00016577455,0.000023354196],"category_scores_gemma":[0.0000734793,0.00022787157,0.00011544104,0.00014593711,0.00021461994,0.00013061664,0.00017302202,0.00042922894,0.00003148443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015339201,0.000002191216,0.0000012868516,0.000012389102,0.00005027238,0.0000013642403,0.00014255819,0.9176164,0.000007120662,0.0011634905,0.0000125802535,0.0809888],"study_design_scores_gemma":[0.00006208843,0.000026060517,0.0000025524591,0.00007068689,0.000052655912,0.0000056427825,1.3465345e-7,0.9930309,0.00053954683,0.0020272722,0.003925268,0.0002571651],"about_ca_topic_score_codex":0.000007930396,"about_ca_topic_score_gemma":0.00007241858,"teacher_disagreement_score":0.08073164,"about_ca_system_score_codex":0.00016847962,"about_ca_system_score_gemma":0.00012623286,"threshold_uncertainty_score":0.92923325},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007871057,0.0018618123,0.9631112,0.00019778381,0.0025975285,0.00015166902,0.0000038617122,0.00020316683,0.031085871],"genre_scores_gemma":[0.97384727,0.00058407267,0.015725885,0.0020078828,0.0037545124,0.000005938344,0.0000072437674,0.00017596922,0.0038912017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986506,0.000004746193,0.0002309234,0.00016178854,0.00038513544,0.00056677463],"domain_scores_gemma":[0.9989613,0.0004079091,0.000044378496,0.00046585844,0.00003644099,0.00008409114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041818825,0.00029365483,0.0002107481,0.00027057485,0.00016913576,0.0002438355,0.00081874477,0.00019362522,0.000014768408],"category_scores_gemma":[0.00003002264,0.00021150502,0.000068219684,0.00020014404,0.0004241102,0.00011147125,0.00015326678,0.00060825335,0.0000496608],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025959662,0.0000023044383,0.000020848012,0.000030310772,0.000013368067,0.000014031236,0.003387709,0.13254559,0.00012720237,0.0053534396,0.00012334823,0.85837924],"study_design_scores_gemma":[0.00039687604,0.00018875633,0.0008138901,0.00093705225,0.00003219717,0.00020168806,0.000003302199,0.56741786,0.009812867,0.10090032,0.31710118,0.0021939909],"about_ca_topic_score_codex":0.000013769566,"about_ca_topic_score_gemma":0.000105636915,"teacher_disagreement_score":0.9730602,"about_ca_system_score_codex":0.00016497224,"about_ca_system_score_gemma":0.00006776653,"threshold_uncertainty_score":0.8624924},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003393924,0.00041218908,0.9847548,0.0001832276,0.0027928574,0.0008510098,0.000015489532,0.00048435008,0.007112169],"genre_scores_gemma":[0.92995095,0.0000029624582,0.06818624,0.0003361911,0.00091964996,0.000014157972,0.00001137073,0.000044303415,0.00053414376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936877,0.00011264208,0.0012229915,0.0023888652,0.0015132063,0.001074593],"domain_scores_gemma":[0.9960832,0.0004247943,0.0007176997,0.0021175689,0.00040652129,0.00025019454],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022888375,0.0008548947,0.0010035972,0.00087636645,0.0005830895,0.0014548317,0.004030734,0.0003429497,0.000009423246],"category_scores_gemma":[0.0000995655,0.0007751501,0.00022902265,0.001023447,0.00043079795,0.000539957,0.002055635,0.0010503908,0.00004392611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074525287,0.00035970876,0.0013945987,0.00013615315,0.000074916374,0.032564484,0.0047147186,0.23814078,0.000020722593,0.0052175615,0.0004928662,0.71687603],"study_design_scores_gemma":[0.0010095853,0.0008672482,0.0004538638,0.000849697,0.000043494,0.011218303,0.0000073070837,0.9541818,0.00010067907,0.025380334,0.003559438,0.0023282366],"about_ca_topic_score_codex":0.0011809836,"about_ca_topic_score_gemma":0.0004518898,"teacher_disagreement_score":0.92655706,"about_ca_system_score_codex":0.0003661619,"about_ca_system_score_gemma":0.000851089,"threshold_uncertainty_score":0.99958175},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004898654,0.0003016509,0.9728269,0.0007525261,0.001627944,0.00046534333,0.0000051705124,0.00020753226,0.023763923],"genre_scores_gemma":[0.25215337,0.00019640678,0.7362111,0.004226822,0.0012266953,0.00006527118,0.000030466534,0.00018680497,0.0057030236],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951356,0.00007945104,0.0004710033,0.0018063652,0.0017153496,0.00079223496],"domain_scores_gemma":[0.9962507,0.0005612491,0.00025385973,0.0021157777,0.0004965779,0.000321839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017881686,0.0005365106,0.00048142506,0.0016459094,0.00024810963,0.00048766745,0.0041595325,0.0003206911,0.000040305134],"category_scores_gemma":[0.00023274765,0.00048437063,0.00013340042,0.0010359938,0.000887023,0.0008496591,0.00087997917,0.0011801936,0.00027129235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015171449,0.000022490793,0.0000067681217,0.000010680774,0.0000060460375,0.00008661842,0.0002475451,0.0198364,0.00009845409,0.38841313,0.0000865517,0.59117013],"study_design_scores_gemma":[0.00024035825,0.00037697054,0.000020731151,0.00020328663,0.000002378106,0.00004589225,9.3433655e-8,0.09817267,0.0012414559,0.89545244,0.0037092452,0.00053450343],"about_ca_topic_score_codex":0.0000066872685,"about_ca_topic_score_gemma":0.00003898198,"teacher_disagreement_score":0.59063566,"about_ca_system_score_codex":0.00040833492,"about_ca_system_score_gemma":0.0006730001,"threshold_uncertainty_score":0.9997608},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001368984,0.0007044704,0.9938918,0.00037827555,0.0035137844,0.00076679426,0.000028033355,0.00018358763,0.00039636286],"genre_scores_gemma":[0.0100405775,0.000025383264,0.9883424,0.0005795308,0.000775177,0.000038517966,0.000010369847,0.000041004925,0.00014701654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554473,0.000037813224,0.0005664011,0.0017113684,0.0011304579,0.0010092377],"domain_scores_gemma":[0.9969142,0.00074563164,0.00031418007,0.0014019173,0.00042568252,0.00019841002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001789905,0.0005768467,0.0005611947,0.0010480245,0.00070775545,0.00071602914,0.0035338136,0.000516012,0.00002675634],"category_scores_gemma":[0.00013317433,0.00051472516,0.00036302445,0.0006311912,0.00070097076,0.0005062874,0.001365887,0.0010474949,0.000020455262],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046085756,0.00003890745,0.000013429997,0.000030550254,0.000019852821,0.000027805661,0.0005761239,0.00040319952,0.0010204369,0.011255076,0.000007848338,0.9866022],"study_design_scores_gemma":[0.0007200814,0.00037202216,0.00011577376,0.00019492442,0.000026207028,0.0000911428,2.5312852e-7,0.7492003,0.004002994,0.24193802,0.0025261326,0.0008121309],"about_ca_topic_score_codex":0.000017295577,"about_ca_topic_score_gemma":0.00015521795,"teacher_disagreement_score":0.98579,"about_ca_system_score_codex":0.00008761148,"about_ca_system_score_gemma":0.00056664285,"threshold_uncertainty_score":0.9997304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049962406,0.00063025113,0.99366504,0.00091115927,0.0014710991,0.00026439098,0.000009286042,0.00014780968,0.0024013666],"genre_scores_gemma":[0.81978464,0.00012429418,0.178233,0.0010610578,0.0004880036,0.000004909106,0.000003231603,0.000035343823,0.0002655112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585253,0.000070312926,0.0007908401,0.0013222527,0.0012113744,0.0007527123],"domain_scores_gemma":[0.99632037,0.0005917195,0.00046294346,0.0021101485,0.00033431727,0.00018048898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001289834,0.00059107883,0.0006348371,0.0005014414,0.00031033045,0.0003715276,0.0047726138,0.00038036864,0.000016387834],"category_scores_gemma":[0.000083511935,0.00043827778,0.00019479405,0.0006390833,0.0011091586,0.00041420377,0.0015145474,0.0012659603,0.000017893522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007621647,0.0000590146,0.00017475631,0.00009227355,0.00004119442,0.00006294311,0.001807935,0.12942247,0.000287551,0.19485313,0.00005419431,0.6731369],"study_design_scores_gemma":[0.00023344133,0.00018353919,0.00040265452,0.0005087828,0.000027640483,0.00013360928,3.9965974e-7,0.5855493,0.0038208838,0.40756014,0.00069227576,0.0008873254],"about_ca_topic_score_codex":0.00007458912,"about_ca_topic_score_gemma":0.00017347539,"teacher_disagreement_score":0.81928504,"about_ca_system_score_codex":0.00019110831,"about_ca_system_score_gemma":0.0006572864,"threshold_uncertainty_score":0.9998069},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005305765,0.00010470644,0.9840019,0.0014264494,0.0004184952,0.00051908824,0.000011953527,0.0004753548,0.013036746],"genre_scores_gemma":[0.073098905,0.000042577434,0.92334914,0.0017545975,0.00034378114,0.000016236529,0.00006384753,0.00003691393,0.0012939806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571264,0.00005495988,0.0005090635,0.0018575145,0.0012631634,0.00060266786],"domain_scores_gemma":[0.9968759,0.00029795637,0.00033854874,0.0019195419,0.00036921966,0.00019883791],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017810083,0.0004273937,0.00046570314,0.0006440313,0.00028412233,0.00081193034,0.0056273676,0.00037639335,0.000019036002],"category_scores_gemma":[0.0004610015,0.00040625987,0.00008214132,0.0009795666,0.00024087951,0.00083020114,0.0023005442,0.0009896749,0.00006320903],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072997336,0.00009781659,0.00006590051,0.00008212259,0.000029085808,0.000026751994,0.0014485896,0.0079104705,0.0016489975,0.05351244,0.000102935024,0.9350676],"study_design_scores_gemma":[0.00038146725,0.00018260327,0.00008218424,0.00037073425,0.000014694621,0.000040377156,5.80231e-7,0.9186267,0.00536915,0.06892952,0.00498953,0.0010124068],"about_ca_topic_score_codex":0.000020525375,"about_ca_topic_score_gemma":0.0000049633036,"teacher_disagreement_score":0.9340552,"about_ca_system_score_codex":0.0008975352,"about_ca_system_score_gemma":0.0009826903,"threshold_uncertainty_score":0.99983895},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050331437,0.00035549153,0.9959578,0.0003190992,0.0013114576,0.00024411635,0.0000040157906,0.00028082365,0.0010238896],"genre_scores_gemma":[0.2789027,0.000026583632,0.72002417,0.0005486562,0.00035550262,0.000005559963,2.535214e-7,0.00002403347,0.00011255365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726146,0.000034729215,0.00047212493,0.00093815476,0.0008280007,0.00046549732],"domain_scores_gemma":[0.99478775,0.0026779773,0.0004955442,0.001796362,0.00016461602,0.000077750796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000926402,0.00039336685,0.0003836355,0.00030023386,0.00018224366,0.0003294787,0.0050253747,0.00030054298,0.000023792483],"category_scores_gemma":[0.0008599925,0.0003057993,0.00009381655,0.000712728,0.00024720439,0.0006360233,0.0018617831,0.0011973187,0.0000052067157],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011496044,0.000013459572,0.002835344,0.000049941267,0.0000073581346,0.000018527653,0.0005234144,0.03915509,0.000060632534,0.0068333214,0.000006391852,0.95049536],"study_design_scores_gemma":[0.00028568823,0.00045021178,0.02040316,0.0076791625,0.000036331792,0.00025934423,5.9535023e-7,0.7720169,0.007550679,0.18043813,0.008625889,0.0022539108],"about_ca_topic_score_codex":0.00002318527,"about_ca_topic_score_gemma":0.000015016529,"teacher_disagreement_score":0.9482415,"about_ca_system_score_codex":0.00013897575,"about_ca_system_score_gemma":0.00022822143,"threshold_uncertainty_score":0.9999394},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000063871157,0.00011592061,0.9930601,0.0008021148,0.0016399669,0.0010811082,0.000017160448,0.00005210886,0.0032251098],"genre_scores_gemma":[0.004418725,0.000010713245,0.99092513,0.0027317812,0.00030325484,0.0001009181,0.000014099476,0.000035364494,0.0014600379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659747,0.000046684578,0.00048604148,0.0015485836,0.00060400984,0.0007172077],"domain_scores_gemma":[0.9965425,0.0010535879,0.00032250135,0.0010897182,0.00082479377,0.00016689705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005066079,0.0004914041,0.0005477047,0.0007716368,0.00037100608,0.0005850827,0.002708316,0.0002836403,0.00006885551],"category_scores_gemma":[0.00018939344,0.0004760909,0.00023597175,0.0004130233,0.00028994685,0.0010287432,0.00077143585,0.0006161841,0.00018255046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015826501,0.00013633461,0.0000084142075,0.000075028445,0.00007293969,0.000016167609,0.0023660809,0.006401847,0.0071357074,0.082446985,0.00021042264,0.9011142],"study_design_scores_gemma":[0.0005698386,0.00024309232,0.0001566543,0.0002607992,0.000019499948,0.000021879565,5.593157e-7,0.92756575,0.009890479,0.05828409,0.002288987,0.0006983374],"about_ca_topic_score_codex":0.00006430223,"about_ca_topic_score_gemma":0.00008201269,"teacher_disagreement_score":0.9211639,"about_ca_system_score_codex":0.00027651628,"about_ca_system_score_gemma":0.0004570819,"threshold_uncertainty_score":0.9997691},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014785288,0.000053796786,0.9830047,0.0011885106,0.00039387878,0.00024173231,0.0000012069485,0.00032165024,0.000009267627],"genre_scores_gemma":[0.57316786,0.0000056184213,0.4253874,0.0013781362,0.000049837818,0.0000027430995,0.000005745871,0.0000023605292,2.6418465e-7],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99778765,0.00007982952,0.00031613815,0.00063136045,0.0007392251,0.0004457628],"domain_scores_gemma":[0.99901503,0.00013319099,0.000118822,0.00048548132,0.0001059926,0.00014149798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074895564,0.00016504836,0.00014936575,0.0002724482,0.00023606859,0.00040290155,0.0012785365,0.000059768674,0.000010866777],"category_scores_gemma":[0.000083298764,0.00015284104,0.000046596197,0.0017289594,0.0001689347,0.0014240353,0.00021370688,0.00023258502,0.000015257729],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018531937,0.0000619069,0.00030774827,0.0000037254765,0.0000010876329,0.000014317192,0.00078211055,0.0032455956,0.037433192,0.00034212068,0.000019280867,0.95778704],"study_design_scores_gemma":[0.00024793323,0.00016260936,0.006515243,0.000042887277,0.0000020603818,0.00005405788,0.0000010948438,0.32866806,0.5425734,0.12148617,0.000008527279,0.00023798374],"about_ca_topic_score_codex":0.000027563161,"about_ca_topic_score_gemma":0.0000073114948,"teacher_disagreement_score":0.9575491,"about_ca_system_score_codex":0.00020811772,"about_ca_system_score_gemma":0.00008860725,"threshold_uncertainty_score":0.62326765},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22540113,0.00097453984,0.770012,0.00063511933,0.000799597,0.000965076,0.000079952944,0.000019049397,0.0011135156],"genre_scores_gemma":[0.7500913,0.0006042696,0.24533163,0.0004669763,0.0021041245,0.000035225905,0.00024265239,0.00007372271,0.0010500907],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983136,0.000012202769,0.00033355466,0.0007863822,0.0002879727,0.00026625674],"domain_scores_gemma":[0.9988605,0.0000144355445,0.00020779714,0.00056848413,0.0002457652,0.000103038954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038558018,0.00024338803,0.00024513458,0.00027676506,0.00008899229,0.0000579114,0.00044288463,0.00023683191,0.000027119366],"category_scores_gemma":[0.000033614153,0.00024815518,0.00005167265,0.0001628255,0.0004096313,0.000011445085,0.00026200069,0.00020835774,0.000010036242],"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.000018759367,0.000017653061,0.0011059982,0.00004474564,0.000024682453,0.0000026687294,0.0002238972,0.0018461193,0.89908034,0.00007867567,0.0000033215726,0.09755314],"study_design_scores_gemma":[0.0038306625,0.0043873326,0.22527628,0.00071519794,0.0002104912,0.00076856016,0.000008999513,0.0032863815,0.50026995,0.05115557,0.20437104,0.0057195136],"about_ca_topic_score_codex":0.000010861073,"about_ca_topic_score_gemma":0.00011486256,"teacher_disagreement_score":0.52469015,"about_ca_system_score_codex":0.00006218379,"about_ca_system_score_gemma":0.00014560205,"threshold_uncertainty_score":0.9999971},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012076809,0.0006668795,0.98258173,0.000093583316,0.002811079,0.00082306523,0.000030874096,0.0005165978,0.0003993895],"genre_scores_gemma":[0.7759569,0.000101906706,0.2228524,0.00036813034,0.00039159067,0.0000326269,0.0000112001935,0.000055549575,0.00022965253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938584,0.000083928964,0.0011554777,0.002502001,0.001317522,0.0010826697],"domain_scores_gemma":[0.9952642,0.0008016694,0.0004313128,0.0028905729,0.00033463852,0.00027761736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011122696,0.0008745363,0.0010257359,0.0011192925,0.0003969413,0.00082412886,0.0028615969,0.0007257059,0.000015953727],"category_scores_gemma":[0.00009023407,0.0007616803,0.00020024057,0.0009914779,0.00054621324,0.0028868676,0.0015614388,0.0013897634,0.00011983988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018895902,0.00008966654,0.004840023,0.00048212238,0.000025027799,0.005833413,0.0037571297,0.5338054,0.0000050834706,0.001828578,0.000045624547,0.4492691],"study_design_scores_gemma":[0.0004624836,0.00011603041,0.00024987152,0.0020653112,0.000009488245,0.0017098251,8.8802676e-7,0.9884369,0.00007509608,0.0056906664,0.00022947312,0.0009540168],"about_ca_topic_score_codex":0.0006702459,"about_ca_topic_score_gemma":0.00034900993,"teacher_disagreement_score":0.76388013,"about_ca_system_score_codex":0.0012030919,"about_ca_system_score_gemma":0.0004778532,"threshold_uncertainty_score":0.9994834},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001694844,0.00042890734,0.99556655,0.0001698784,0.0011415984,0.00061627396,0.00004821307,0.00013051949,0.00020324707],"genre_scores_gemma":[0.3178098,0.000009078576,0.6811375,0.0005839958,0.00032344816,0.000011009515,0.000026399837,0.000042185497,0.000056575587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679554,0.000024373443,0.00049451843,0.0014105231,0.00055059604,0.00072445604],"domain_scores_gemma":[0.9977986,0.0007302969,0.00022345745,0.0007841033,0.00026213072,0.00020141358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010525296,0.0004817964,0.000510949,0.00048916973,0.00039587144,0.00058932195,0.001746437,0.00036535144,0.0000047567746],"category_scores_gemma":[0.00012726894,0.00046192206,0.000101934995,0.00048334483,0.00065217516,0.0005655979,0.0008337513,0.0005461861,0.000004163818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026859742,0.00025852863,0.0014765061,0.00062453846,0.00015141234,0.0004984571,0.005622698,0.20411886,0.0072479825,0.07441319,0.00025284133,0.7050664],"study_design_scores_gemma":[0.00042162352,0.0003096999,0.00011251671,0.00051573495,0.000015199399,0.00010723547,5.019863e-7,0.9416364,0.004940922,0.04991405,0.0013373621,0.0006887628],"about_ca_topic_score_codex":0.000027879432,"about_ca_topic_score_gemma":0.000047421716,"teacher_disagreement_score":0.73751754,"about_ca_system_score_codex":0.00036412195,"about_ca_system_score_gemma":0.00034390914,"threshold_uncertainty_score":0.9997833},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012862073,0.0005702547,0.9942523,0.0004278544,0.002412896,0.0006429335,0.000037474147,0.00029020917,0.0013531832],"genre_scores_gemma":[0.0008865935,0.000037913676,0.9951976,0.0015091154,0.0013535235,0.000013739183,0.0000675019,0.000059418493,0.0008745913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949394,0.000023554165,0.0007108658,0.0021061287,0.0011376976,0.0010823448],"domain_scores_gemma":[0.99694115,0.00048036664,0.00040491065,0.0016443442,0.0001987516,0.0003304967],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007254051,0.00075167295,0.00067954615,0.00075801194,0.0003452268,0.0011837003,0.0046439436,0.00040431242,0.0000092033215],"category_scores_gemma":[0.000023831655,0.0006855027,0.00023670663,0.00041647244,0.00020330452,0.0011700478,0.0022610978,0.00082821917,0.000027614731],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023692248,0.000016775099,0.000002343122,0.000020802036,0.000012821952,0.0000563547,0.00026636157,0.023862965,0.000105563515,0.0028191158,0.00051783246,0.9723167],"study_design_scores_gemma":[0.0005166701,0.00011413312,0.000025122541,0.0004316219,0.000012462904,0.000052712316,1.5488065e-7,0.88263667,0.0007118782,0.09403626,0.020577013,0.0008852812],"about_ca_topic_score_codex":0.00017493975,"about_ca_topic_score_gemma":0.000058494083,"teacher_disagreement_score":0.97143143,"about_ca_system_score_codex":0.00033725862,"about_ca_system_score_gemma":0.00061719667,"threshold_uncertainty_score":0.9998532},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000070865855,0.0004434439,0.99711347,0.0004096609,0.0011825302,0.0003552523,0.0000035490846,0.0000629436,0.00035827255],"genre_scores_gemma":[0.026180383,0.000009425155,0.9728722,0.00016506441,0.00023626527,0.00001024627,0.000017052282,0.000018414448,0.000490925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966618,0.000060431845,0.0007122822,0.001366552,0.00072748674,0.00047149326],"domain_scores_gemma":[0.9969081,0.00069999613,0.00077014504,0.001015667,0.0004806477,0.00012544535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017614384,0.00043591022,0.0011151783,0.0020758454,0.00026514742,0.0003423421,0.0020498678,0.00042691347,0.000042586897],"category_scores_gemma":[0.00007639263,0.00039227467,0.0005955789,0.0020489749,0.00029751836,0.0003054026,0.0005790307,0.0007014474,0.000003974654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000114296845,0.00009876816,0.0023012413,0.00005454349,0.0005254646,0.0000015449258,0.0011754674,0.052213855,0.0073540504,0.011227935,0.000050833896,0.9249849],"study_design_scores_gemma":[0.00018300983,0.00013804117,0.00025346753,0.00006428022,0.00026431915,0.0000030483868,3.3940807e-7,0.92880666,0.052861862,0.013887417,0.0031233898,0.00041418846],"about_ca_topic_score_codex":0.000011847402,"about_ca_topic_score_gemma":0.00007624924,"teacher_disagreement_score":0.9245707,"about_ca_system_score_codex":0.00013245207,"about_ca_system_score_gemma":0.00022678639,"threshold_uncertainty_score":0.9998529},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42193696,0.000009986421,0.57685,0.00049625646,0.00027314044,0.00034915356,0.0000020862276,0.000080307116,0.0000021389142],"genre_scores_gemma":[0.5444708,0.0000014007633,0.4551268,0.00029683195,0.00007598226,0.000013808714,0.000003904192,0.000010317288,1.7691163e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867624,0.0000070240144,0.00020988638,0.0005341717,0.00024119634,0.00033148786],"domain_scores_gemma":[0.99908644,0.00014660976,0.00008898073,0.00043007906,0.0001518455,0.00009602129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018597375,0.000144659,0.00015352502,0.00028887542,0.00036784474,0.00008248731,0.00030474528,0.000041668714,0.000003869352],"category_scores_gemma":[0.0001537892,0.00012582513,0.000052393738,0.00079855695,0.00027278496,0.00021813133,0.00019736208,0.0002554924,0.0000011350469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011285562,0.00021058226,0.23162177,0.000081960956,0.0000055280925,0.000009119222,0.00022915073,0.0006216406,0.26188117,0.00016369877,0.000028234484,0.50503427],"study_design_scores_gemma":[0.0010932694,0.000040848787,0.028303916,0.00014400338,0.000013206205,0.000032941047,2.988854e-7,0.9100903,0.050281245,0.009576469,0.00023578657,0.00018767352],"about_ca_topic_score_codex":0.00004126435,"about_ca_topic_score_gemma":0.00003295357,"teacher_disagreement_score":0.9094687,"about_ca_system_score_codex":0.000067497924,"about_ca_system_score_gemma":0.000044711775,"threshold_uncertainty_score":0.51309997},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002870943,0.00078567624,0.9934082,0.0015593788,0.0012452692,0.00033756954,0.000024581124,0.00013516017,0.0022170637],"genre_scores_gemma":[0.9464029,0.00052981183,0.045061436,0.007199435,0.00049969135,0.00002442157,0.00006655313,0.000045200188,0.00017056824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665636,0.000079097,0.00075765967,0.00075374,0.0012153832,0.0005377908],"domain_scores_gemma":[0.99681693,0.00047958025,0.00052355387,0.0016703351,0.00037334795,0.00013627346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011856932,0.0004541845,0.00047158528,0.0005179516,0.0004351203,0.00027270446,0.0040734275,0.00026877673,0.00002890677],"category_scores_gemma":[0.000101487254,0.00031827134,0.0002707315,0.0012381815,0.0019015948,0.0007071305,0.000895627,0.0007394104,0.000036869547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015462321,0.000044321187,0.000027434256,0.000040601117,0.000025208234,0.000033192337,0.0026885003,0.00480518,0.00003328256,0.5134139,0.0006993974,0.4781735],"study_design_scores_gemma":[0.00044504256,0.00029267746,0.0011957044,0.00037349906,0.00001450244,0.00027554404,0.0000019988431,0.63808244,0.0015108762,0.32758006,0.02933386,0.00089379086],"about_ca_topic_score_codex":0.000016834889,"about_ca_topic_score_gemma":0.000009061709,"teacher_disagreement_score":0.9483468,"about_ca_system_score_codex":0.00010744845,"about_ca_system_score_gemma":0.00031657072,"threshold_uncertainty_score":0.9999269},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008304273,0.0012177962,0.9916189,0.0003816741,0.0035640597,0.0012421068,0.000008255174,0.00033238382,0.0015517895],"genre_scores_gemma":[0.7789682,0.00025995562,0.20343603,0.008174736,0.005608351,0.0003540243,0.000048374008,0.00017665609,0.002973663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953522,0.00006074333,0.000692158,0.0019822998,0.0008275528,0.0010850467],"domain_scores_gemma":[0.99669033,0.0010419806,0.000297425,0.0014720503,0.00021991407,0.00027828946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009879767,0.0007334939,0.0007881098,0.00059662736,0.00041063759,0.0007079492,0.003664171,0.0005993782,0.0000675672],"category_scores_gemma":[0.000028513328,0.0006834377,0.00030513966,0.00056241703,0.0005715456,0.0005275134,0.0006505921,0.00094221975,0.00006529767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016661597,0.000021414822,0.0000020547816,0.000006243344,0.000013236544,0.0000200565,0.00012741525,0.35562706,0.0000035059686,0.006621891,0.00013773718,0.6374027],"study_design_scores_gemma":[0.00065917236,0.0005005865,0.0000049955793,0.00020201609,0.000019668896,0.00002746749,8.8771195e-8,0.94483185,0.00009168491,0.027956234,0.024916165,0.0007900832],"about_ca_topic_score_codex":0.0000054510083,"about_ca_topic_score_gemma":0.000033893033,"teacher_disagreement_score":0.78818285,"about_ca_system_score_codex":0.00022188509,"about_ca_system_score_gemma":0.0004933982,"threshold_uncertainty_score":0.99956167},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003314385,0.00059590826,0.9952071,0.001362865,0.00032327112,0.0014802441,0.0000051205907,0.00011414602,0.00057995936],"genre_scores_gemma":[0.39582214,0.00023282236,0.6025402,0.000568585,0.00020180641,0.00008260522,0.000012566564,0.00003893474,0.0005003701],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645084,0.000087196764,0.00048867293,0.0014884444,0.00085010333,0.0006347644],"domain_scores_gemma":[0.99372125,0.004133105,0.000262204,0.0012262694,0.00051227614,0.00014490765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016356667,0.00037297464,0.00036717407,0.0004159896,0.0008739565,0.0008012385,0.0021744857,0.00017212494,0.0000013353738],"category_scores_gemma":[0.00044524943,0.0002833375,0.00011013401,0.00062201894,0.0014021384,0.00059486326,0.000533682,0.0005746093,0.000003397649],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003010862,0.000015447726,0.000029216322,0.00002396942,0.000006153614,0.000009529459,0.00045137387,0.040786445,0.0000964773,0.1089577,0.000005304652,0.8495883],"study_design_scores_gemma":[0.00017604679,0.00018500477,0.00007762398,0.000048751066,0.000003063438,0.000024387184,3.2263793e-7,0.3888137,0.00026541844,0.6096304,0.0005661101,0.00020918214],"about_ca_topic_score_codex":0.000007953944,"about_ca_topic_score_gemma":0.000079997175,"teacher_disagreement_score":0.84937906,"about_ca_system_score_codex":0.00017521653,"about_ca_system_score_gemma":0.00023873412,"threshold_uncertainty_score":0.99996185},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005347446,0.00016667876,0.9877219,0.0001878352,0.0005457187,0.0010827107,0.000012303814,0.00010042497,0.010128935],"genre_scores_gemma":[0.13957225,0.000038851664,0.85958314,0.0003025694,0.00017439252,0.00007861241,0.00003802912,0.000021631417,0.00019051446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974706,0.000065283544,0.000414822,0.00083189696,0.00096041925,0.00025696307],"domain_scores_gemma":[0.99689966,0.0002534506,0.0004822877,0.00077459187,0.0015247646,0.00006521314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017474624,0.00030295248,0.00042579512,0.0007025516,0.00012692541,0.00013205037,0.0012464097,0.0002912673,0.00004631543],"category_scores_gemma":[0.00013002947,0.00028010455,0.00011849938,0.00042060035,0.00031090598,0.0005607621,0.00018383376,0.00022659257,0.000011975355],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010584554,0.000034859895,0.000014054876,0.000032921078,0.000012967786,6.6604576e-7,0.0009676297,0.00042702936,0.0005519665,0.016586918,0.000073103016,0.9812873],"study_design_scores_gemma":[0.00034094907,0.00022752964,0.0003568655,0.0004299714,0.000056055178,0.000022826072,6.111506e-7,0.6143386,0.14376737,0.23722036,0.0026451221,0.0005937752],"about_ca_topic_score_codex":0.000009248796,"about_ca_topic_score_gemma":0.000046596302,"teacher_disagreement_score":0.9806935,"about_ca_system_score_codex":0.00021735494,"about_ca_system_score_gemma":0.00044428563,"threshold_uncertainty_score":0.99996513},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010515652,0.0004874837,0.98231524,0.0005880353,0.0016832923,0.00048344515,0.0000020323014,0.00026156276,0.014168397],"genre_scores_gemma":[0.039365645,0.000056480643,0.9534459,0.003202976,0.00068869,0.000014837339,0.000018681469,0.00006622816,0.0031405257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591726,0.000041004558,0.00064219505,0.001447927,0.0011120796,0.0008395471],"domain_scores_gemma":[0.9973778,0.0008041546,0.0004402972,0.00082288973,0.00030605044,0.00024878717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024970628,0.0004961783,0.00049294264,0.0010200974,0.00051986147,0.0006135745,0.0025073362,0.00031612394,0.000031405678],"category_scores_gemma":[0.00031414768,0.00048350284,0.00017488559,0.00056667376,0.00035642472,0.00066529686,0.0008504116,0.001080906,0.00005927204],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000108932,0.00001747471,0.000059332757,0.000030249075,0.000011271132,0.00004343391,0.0008345214,0.031121867,0.000086329914,0.022078495,0.000016953743,0.9456892],"study_design_scores_gemma":[0.00060925365,0.00033034032,0.00007223744,0.00029667842,0.000008132318,0.00004016653,5.0365753e-7,0.878903,0.0003932372,0.041397236,0.07721551,0.0007337557],"about_ca_topic_score_codex":0.00001232446,"about_ca_topic_score_gemma":0.00003989449,"teacher_disagreement_score":0.9449554,"about_ca_system_score_codex":0.00039803496,"about_ca_system_score_gemma":0.0004460298,"threshold_uncertainty_score":0.99976164},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002929804,0.0008587281,0.9905673,0.00006693677,0.0003577253,0.0035497472,0.000026458483,0.00025557278,0.0013876912],"genre_scores_gemma":[0.85992175,0.00026403798,0.13903233,0.00011475375,0.00014068648,0.00040070937,0.00002385253,0.0000684968,0.00003337931],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796176,0.000014550317,0.00056664756,0.0006654216,0.00041349736,0.00037813652],"domain_scores_gemma":[0.9986805,0.00008302218,0.00021724319,0.0008079406,0.0001251693,0.000086176944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027053355,0.00039088677,0.0008644892,0.0009938072,0.00008033835,0.000037114867,0.0008749953,0.00034821546,0.00006847489],"category_scores_gemma":[0.000024781944,0.00037448795,0.00008236536,0.0006566752,0.0010863226,0.00020156831,0.0004155329,0.0007021391,0.000006000758],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068808324,0.00032875623,0.037778877,0.0012448912,0.0011500701,0.000057458226,0.002897575,0.08275684,0.0017587227,0.06294726,0.00006414977,0.8089466],"study_design_scores_gemma":[0.0005784319,0.00030879557,0.003982418,0.00058026833,0.00019323839,0.000010083013,3.0539837e-7,0.2994745,0.06953447,0.61855465,0.0056178756,0.0011649373],"about_ca_topic_score_codex":0.000015532249,"about_ca_topic_score_gemma":0.00017611023,"teacher_disagreement_score":0.85699195,"about_ca_system_score_codex":0.00020471097,"about_ca_system_score_gemma":0.000043937034,"threshold_uncertainty_score":0.9998707},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027491956,0.00024488822,0.9807067,0.0018866423,0.00459479,0.0010928115,0.00002083683,0.00018706908,0.008517048],"genre_scores_gemma":[0.7720948,0.000027908305,0.21896698,0.004638925,0.00077396113,0.00011769758,0.000021918328,0.000058731057,0.0032990868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9905608,0.000050865146,0.0014311762,0.0025207724,0.00444749,0.0009888932],"domain_scores_gemma":[0.99453956,0.0011089187,0.00060701027,0.0029057686,0.00044284342,0.00039589888],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006285177,0.0006385661,0.0007857282,0.0027188566,0.0007724978,0.003567178,0.0069477456,0.0002135395,0.0003265258],"category_scores_gemma":[0.0006496414,0.00048710263,0.0002003138,0.00229986,0.0008148449,0.00083717564,0.0040422003,0.0005713638,0.0012423131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000874108,0.000029833116,0.00005172179,0.0000629697,0.000009934542,0.000051980765,0.011398042,0.15053403,0.000055563658,0.0039021652,0.00025063808,0.8336444],"study_design_scores_gemma":[0.00041635698,0.00021405621,0.00007334976,0.0014470854,0.000019751422,0.000046728874,0.00031297476,0.8185823,0.00028380973,0.13410158,0.043145888,0.0013561302],"about_ca_topic_score_codex":0.000080696416,"about_ca_topic_score_gemma":0.00032324044,"teacher_disagreement_score":0.83228827,"about_ca_system_score_codex":0.00031266717,"about_ca_system_score_gemma":0.0006130626,"threshold_uncertainty_score":0.99975806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005436913,0.00017817748,0.96559256,0.00028671612,0.0021998123,0.00027362187,0.000008435124,0.00011038779,0.030806618],"genre_scores_gemma":[0.61748666,0.00026657362,0.3704326,0.00548325,0.004760981,0.000015999003,0.00001024293,0.00010787163,0.0014358159],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647397,0.0000387729,0.0005093054,0.0012940518,0.0011415958,0.0005423029],"domain_scores_gemma":[0.99717677,0.00078737235,0.00036348775,0.0013691431,0.00017047825,0.00013275712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005286911,0.00047765343,0.00061072444,0.00082133827,0.00016171118,0.00015018949,0.0033544768,0.0002958489,0.00004653652],"category_scores_gemma":[0.00009851009,0.00041879396,0.00018570568,0.0005687037,0.0010953201,0.0003551797,0.0010726877,0.0007202931,0.000056958783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018051896,0.00006735542,0.000008669271,0.000024318704,0.000014680987,0.00019548084,0.0020421466,0.00540786,0.000112898684,0.24057561,0.00028806052,0.75124484],"study_design_scores_gemma":[0.00091704784,0.0011401075,0.0005106448,0.0015616746,0.000013996873,0.00026551666,5.903358e-7,0.27104717,0.008986779,0.70593804,0.007897155,0.0017212421],"about_ca_topic_score_codex":0.00000739341,"about_ca_topic_score_gemma":0.00001358623,"teacher_disagreement_score":0.74952364,"about_ca_system_score_codex":0.00023493404,"about_ca_system_score_gemma":0.0005343544,"threshold_uncertainty_score":0.9998264},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002929713,0.0005267502,0.9846515,0.00041867382,0.0036583804,0.0009811223,0.000051292835,0.0005121349,0.009170855],"genre_scores_gemma":[0.27129146,0.000014922301,0.7224378,0.0012575594,0.004015208,0.00007520051,0.00006854211,0.00011052162,0.00072878186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951414,0.00005931785,0.0008288651,0.0020300802,0.00092579116,0.0010145706],"domain_scores_gemma":[0.9968608,0.00064671814,0.00035034094,0.0016454031,0.00025742807,0.0002393141],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001183626,0.00074424,0.0008519729,0.00068229,0.00055473443,0.0012306508,0.0045737023,0.00042016877,0.00000856544],"category_scores_gemma":[0.00005792121,0.0006581614,0.00028012742,0.0005843419,0.00031396595,0.0003238689,0.0007726474,0.00081651413,0.00005644446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008735827,0.000021472577,0.000009172055,0.00026987813,0.000025546184,0.00009255252,0.0009246264,0.43404558,0.00003757265,0.03975627,0.0001714224,0.52463716],"study_design_scores_gemma":[0.00050254725,0.00026817736,0.00001143652,0.0017718457,0.000012643507,0.00039532347,3.2419138e-7,0.9368677,0.00015181265,0.03421915,0.024732718,0.0010663066],"about_ca_topic_score_codex":0.000028959059,"about_ca_topic_score_gemma":0.000026441377,"teacher_disagreement_score":0.52357084,"about_ca_system_score_codex":0.00036956187,"about_ca_system_score_gemma":0.00066152797,"threshold_uncertainty_score":0.99980617},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056746605,0.000066750494,0.9940183,0.0023958082,0.00050922413,0.0013747092,0.000026702806,0.000043753116,0.0015079795],"genre_scores_gemma":[0.13490988,0.00004665394,0.86156034,0.0020558496,0.00023105508,0.0000924956,0.000005781337,0.00005074673,0.0010471956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966427,0.00008023734,0.00052111177,0.0009010913,0.0013571433,0.0004977231],"domain_scores_gemma":[0.99508053,0.0022745023,0.00036662002,0.0016354887,0.0005513377,0.000091505375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012189703,0.00033791596,0.0003891614,0.0003537742,0.0004407649,0.00023651152,0.004924715,0.0001714899,0.000034816923],"category_scores_gemma":[0.00060372223,0.00019222019,0.00018665273,0.0006909792,0.0015796961,0.00014727663,0.0010996206,0.00060773845,0.000007153283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002004091,0.00014334077,0.00008068296,0.00009870913,0.000042212778,0.000028231952,0.00181505,0.14923653,0.00009771805,0.44986016,0.001469349,0.397108],"study_design_scores_gemma":[0.00032215804,0.0002398617,0.000083459614,0.00018913232,0.0000077780705,0.00004629628,2.4568587e-7,0.8573212,0.0015971513,0.13875744,0.0011093066,0.00032598936],"about_ca_topic_score_codex":0.000011263764,"about_ca_topic_score_gemma":0.000015150201,"teacher_disagreement_score":0.70808464,"about_ca_system_score_codex":0.00011564504,"about_ca_system_score_gemma":0.0009868114,"threshold_uncertainty_score":0.9151427},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016499106,0.00040107942,0.994456,0.00039383917,0.00054425496,0.0008125544,8.776853e-7,0.00003218925,0.0017092898],"genre_scores_gemma":[0.9521592,0.00011645607,0.0472512,0.00028296196,0.00012396644,0.000024407924,6.948645e-7,0.000012587676,0.000028492062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978451,0.00016948218,0.00050568546,0.00055456214,0.00066670094,0.00025846018],"domain_scores_gemma":[0.99603945,0.002896866,0.00027006306,0.00069479947,0.000057550733,0.000041261646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026035442,0.00026498595,0.0004576398,0.00036444212,0.00019922573,0.00033271173,0.0012353273,0.00012906358,0.0000021725568],"category_scores_gemma":[0.00021328553,0.00014487098,0.000076710254,0.0003936227,0.00090720656,0.0002660681,0.0004070207,0.0005627936,0.0000022585168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049037266,0.000019336187,0.0008403906,0.00032028212,0.000022697872,0.00012671655,0.01005898,0.23209324,0.00003972028,0.09310019,0.000009522161,0.6633199],"study_design_scores_gemma":[0.0006934728,0.00011894721,0.00039291164,0.00069739,0.000008061091,0.00043624995,8.698349e-7,0.99022466,0.00006548124,0.007089988,0.00006192774,0.0002100585],"about_ca_topic_score_codex":0.000035023,"about_ca_topic_score_gemma":0.00003276388,"teacher_disagreement_score":0.9505093,"about_ca_system_score_codex":0.00006328957,"about_ca_system_score_gemma":0.00012191783,"threshold_uncertainty_score":0.59076667},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012058315,0.0011154714,0.9595425,0.00010488055,0.00080897287,0.0003068539,0.000024037116,0.000040640698,0.025998292],"genre_scores_gemma":[0.9793579,0.000044904955,0.018056072,0.0009677806,0.0008549682,0.0000036125887,0.000032751217,0.00002005299,0.0006619398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983138,0.000017744816,0.00018599398,0.0008395627,0.0003009586,0.00034193366],"domain_scores_gemma":[0.9992504,0.00004239126,0.00010945204,0.00043395718,0.00008173196,0.000082069346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017271547,0.00030793253,0.00024544293,0.000060439314,0.00010266564,0.000113320304,0.0006127983,0.000305575,0.000009551922],"category_scores_gemma":[0.00003476261,0.00020445918,0.00006117814,0.000087961256,0.00039563567,0.0000026751907,0.0002816406,0.00022772141,0.000025971896],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019229029,0.00014405214,0.001194885,0.00012151223,0.000093195464,0.00028395996,0.00004780499,0.12153541,0.003230612,0.019410156,0.00036650003,0.8533796],"study_design_scores_gemma":[0.00638542,0.034379,0.0047784843,0.00807748,0.00019731748,0.002623218,0.0000019643337,0.57759255,0.02304592,0.18954946,0.13967977,0.013689414],"about_ca_topic_score_codex":0.0000066123475,"about_ca_topic_score_gemma":0.000009715468,"teacher_disagreement_score":0.9672996,"about_ca_system_score_codex":0.000059918606,"about_ca_system_score_gemma":0.000071377945,"threshold_uncertainty_score":0.8337604},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049392365,0.00047825644,0.9979895,0.00012595158,0.00018136164,0.00036059797,0.0000029571954,0.00026173572,0.0005502914],"genre_scores_gemma":[0.35023224,0.00022279556,0.64793605,0.0011343621,0.0001805988,0.0000046405885,0.0000052616256,0.000036359335,0.00024769703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997339,0.000027425102,0.00032187504,0.0011995317,0.0006613371,0.0004508131],"domain_scores_gemma":[0.9979707,0.0006566673,0.00020681188,0.0007777242,0.00025040456,0.00013769043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004469831,0.0004125071,0.0003660412,0.00044503086,0.00024176665,0.0004151925,0.001263848,0.00019377063,0.0000057151165],"category_scores_gemma":[0.00019495124,0.00034284868,0.000038206577,0.00048544595,0.0005056246,0.0008377498,0.0007419013,0.000448099,0.0000071918403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008006525,0.000012967007,0.00031530327,0.000021391386,0.0000047249223,0.00011765616,0.00023710217,0.04782881,0.000034822428,0.0008391368,0.000004395908,0.9505757],"study_design_scores_gemma":[0.00026794532,0.00023989756,0.00010736268,0.00035677355,0.0000052111077,0.000108889115,9.208814e-8,0.9743983,0.0033387637,0.01688899,0.0036977374,0.0005900264],"about_ca_topic_score_codex":0.00001709542,"about_ca_topic_score_gemma":0.00009859523,"teacher_disagreement_score":0.9499857,"about_ca_system_score_codex":0.00017779108,"about_ca_system_score_gemma":0.00016841294,"threshold_uncertainty_score":0.99990237},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060411305,0.00014659704,0.98995084,0.00023383742,0.0014253081,0.0009527089,0.0000016781064,0.00007275192,0.0011751453],"genre_scores_gemma":[0.9633191,0.000072417046,0.03573163,0.0005322565,0.00023989654,0.000034373632,0.0000013986811,0.000034353456,0.00003456591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554265,0.00009638536,0.000874377,0.0016738998,0.00095144636,0.0008612524],"domain_scores_gemma":[0.99496293,0.00206471,0.00047552143,0.0022063602,0.00017025678,0.0001202163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016361494,0.0006059754,0.0007469233,0.0005196556,0.00022298215,0.00020984665,0.0048721684,0.0004086124,0.00001183791],"category_scores_gemma":[0.00012663749,0.0004607886,0.0001818525,0.0009984662,0.0009678116,0.00035898574,0.0019698578,0.0017455075,0.000008639203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013962178,0.000060076498,0.00028205063,0.00003814918,0.000008286751,0.00009044293,0.0012769963,0.6658461,0.00004434039,0.011661031,0.000025411553,0.3206531],"study_design_scores_gemma":[0.00022286606,0.00016942093,0.0004926925,0.0011998689,0.0000023466807,0.000028821396,1.5626476e-7,0.97338384,0.00050061714,0.023504613,0.000041020307,0.00045371254],"about_ca_topic_score_codex":0.00004759392,"about_ca_topic_score_gemma":0.00020641762,"teacher_disagreement_score":0.95727795,"about_ca_system_score_codex":0.00045213904,"about_ca_system_score_gemma":0.0003420966,"threshold_uncertainty_score":0.9997844},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027441953,0.00037026458,0.99358875,0.00036481794,0.0023437229,0.0007972049,0.000023993889,0.00024193396,0.002241889],"genre_scores_gemma":[0.008882095,0.0000698566,0.98968357,0.00055599347,0.00035551784,0.00003372131,0.000010164746,0.000037623962,0.00037145705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996288,0.000045055887,0.00064344745,0.0015508742,0.000802212,0.0006704076],"domain_scores_gemma":[0.99722475,0.00028084574,0.0004282689,0.0015263133,0.00038022568,0.00015960111],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014644496,0.0005011273,0.0004901316,0.0007678024,0.00028268527,0.0004281089,0.0027910662,0.00027733497,0.000010616922],"category_scores_gemma":[0.00009967768,0.00048371576,0.00014955092,0.00045253034,0.0006996614,0.0014787327,0.00066300307,0.00059235294,0.000017379085],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009793703,0.000014174325,0.000001700857,0.000024118468,0.0000056623207,0.0000032111607,0.00026712517,0.08386191,0.00007720108,0.16598557,0.0000053847884,0.7497441],"study_design_scores_gemma":[0.00018528753,0.00008994646,0.000012485499,0.0000625239,0.0000039241713,0.00004779549,4.8023473e-8,0.5960044,0.001970159,0.40045038,0.00084515096,0.0003278486],"about_ca_topic_score_codex":0.000012398012,"about_ca_topic_score_gemma":0.000028776632,"teacher_disagreement_score":0.7494163,"about_ca_system_score_codex":0.0004284667,"about_ca_system_score_gemma":0.00040838416,"threshold_uncertainty_score":0.99976146},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013677427,0.000058771788,0.9946448,0.0014592569,0.0006246313,0.0009123293,0.000009248205,0.00012939685,0.0020247633],"genre_scores_gemma":[0.0043599843,0.000030242223,0.9918269,0.00092119176,0.00033002286,0.000024810979,0.000012381004,0.00004570086,0.0024487781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592507,0.000036039066,0.00051377335,0.001573707,0.0009903787,0.0009610568],"domain_scores_gemma":[0.9976307,0.00049506855,0.00014160802,0.0011034902,0.0003842666,0.00024486778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017801565,0.00044222613,0.0004930494,0.0011609065,0.00021919557,0.00071506994,0.0036544388,0.00044656248,0.00006313241],"category_scores_gemma":[0.00010110114,0.00042270822,0.00012757731,0.00073434087,0.0011270074,0.00070532784,0.0014303527,0.0013406046,0.00014817948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009390536,0.000057543,0.000011396733,0.000057747984,0.000006976599,0.00004445012,0.0019497413,0.7127439,0.000525885,0.007811911,0.000038685237,0.27674237],"study_design_scores_gemma":[0.00045218412,0.00018866533,0.0000190306,0.00015849972,0.0000017383467,0.000010740077,1.6919103e-7,0.9801475,0.0014447728,0.014773489,0.0023179206,0.00048529718],"about_ca_topic_score_codex":0.000018026562,"about_ca_topic_score_gemma":0.000035213743,"teacher_disagreement_score":0.27625707,"about_ca_system_score_codex":0.00021055796,"about_ca_system_score_gemma":0.00072024047,"threshold_uncertainty_score":0.9998225},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009392101,0.00062017655,0.9967021,0.00016964303,0.0005222988,0.00035533335,0.0000018614886,0.0003539928,0.00033543148],"genre_scores_gemma":[0.8757896,0.00030737926,0.1236102,0.00010425135,0.00010918004,0.000010498095,0.0000039843558,0.000052790205,0.000012110351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975881,0.000010839138,0.0004526599,0.00077642093,0.00037450154,0.0007975019],"domain_scores_gemma":[0.998956,0.00038566496,0.00005454734,0.00045860108,0.000027200762,0.000117933436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036690893,0.0004898913,0.00051942706,0.00031177688,0.00007645358,0.00009889947,0.0006079437,0.0004839102,0.000006616522],"category_scores_gemma":[0.000030745265,0.00045746446,0.00005700683,0.000239972,0.0005811234,0.00010480948,0.00032670228,0.001320491,0.0000033387987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023319215,0.0000044384524,0.000023699753,0.000022484028,0.00000411861,0.000023609995,0.000038628994,0.55387396,0.000010176577,0.0010876332,7.252269e-7,0.4449082],"study_design_scores_gemma":[0.00023450704,0.000102507765,0.00023876985,0.00052300986,0.000007082052,0.000020426087,5.049548e-7,0.9859045,0.000048433663,0.012367857,0.000072221,0.0004801787],"about_ca_topic_score_codex":0.0000014605978,"about_ca_topic_score_gemma":0.0000622203,"teacher_disagreement_score":0.8748504,"about_ca_system_score_codex":0.0005361809,"about_ca_system_score_gemma":0.000031686806,"threshold_uncertainty_score":0.9997877},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004845215,0.00012911463,0.9966573,0.0006256672,0.0008511387,0.00075537217,0.000018108309,0.000108538785,0.00037020817],"genre_scores_gemma":[0.71443903,0.000013303961,0.28453317,0.00072838337,0.00016943878,0.000012116156,0.000025037252,0.000023609982,0.0000558998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997068,0.000022726806,0.00040135215,0.0011942434,0.00078033464,0.0005333627],"domain_scores_gemma":[0.9987074,0.00027784638,0.00013543002,0.00051922514,0.00016186944,0.00019823773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060848816,0.0004068349,0.0003528926,0.0006416185,0.00035121237,0.00048159403,0.0010076832,0.0002235337,0.000048860406],"category_scores_gemma":[0.00002799673,0.00040233237,0.00008573892,0.00029932716,0.00095903786,0.00055753504,0.0009338996,0.00046207957,0.000020779755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019862728,0.000026303758,0.00013867178,0.000056795925,0.000016729437,0.00002054976,0.00070573034,0.22718441,0.00024111732,0.031844825,0.0000066774755,0.73973835],"study_design_scores_gemma":[0.001090699,0.0003400336,0.00045925876,0.0003153671,0.000012951949,0.00015252343,0.0000018600925,0.9556105,0.0010315577,0.04023849,0.000062662235,0.00068407995],"about_ca_topic_score_codex":0.000045137607,"about_ca_topic_score_gemma":0.00014311168,"teacher_disagreement_score":0.73905426,"about_ca_system_score_codex":0.00067150244,"about_ca_system_score_gemma":0.0006106798,"threshold_uncertainty_score":0.9998429},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060322083,0.0010369712,0.9940642,0.00053876877,0.0006718378,0.00026362887,0.000006681884,0.00009771842,0.0027169734],"genre_scores_gemma":[0.026770795,0.0001628544,0.97004324,0.001850342,0.00014552887,0.0000014782074,0.0000065694994,0.000039599712,0.0009795781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678344,0.000025391771,0.00046395106,0.0012304166,0.0009203423,0.000576481],"domain_scores_gemma":[0.99788153,0.00041387443,0.00036683728,0.00093827496,0.00020627776,0.00019322241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007597412,0.00047204582,0.0005346176,0.00077255495,0.00024350894,0.00033647552,0.0015933003,0.0002874321,0.000010910871],"category_scores_gemma":[0.000070453854,0.0004168732,0.000091908434,0.00058121415,0.000564329,0.00091653806,0.0014583613,0.0008072429,0.000006181002],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012575241,0.000024937313,0.00007266258,0.000077524404,0.000008759109,0.00006006331,0.0012052291,0.0015830172,0.0023613814,0.0073919343,0.00016537022,0.9870365],"study_design_scores_gemma":[0.0009428841,0.000318881,0.00034635092,0.0017670038,0.000013564962,0.00028800004,0.0000026315413,0.54598075,0.014719884,0.4264694,0.00776352,0.0013871688],"about_ca_topic_score_codex":0.000014627049,"about_ca_topic_score_gemma":0.0000116494175,"teacher_disagreement_score":0.9856494,"about_ca_system_score_codex":0.0001280779,"about_ca_system_score_gemma":0.00014561958,"threshold_uncertainty_score":0.99982834},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059346494,0.0003778371,0.9807423,0.0011638503,0.0032555189,0.00046746843,0.0000107900405,0.00018281041,0.013740103],"genre_scores_gemma":[0.21561356,0.000029581415,0.76215345,0.016964432,0.0011367963,0.000040009712,0.000013368741,0.00010928827,0.0039395397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99517477,0.00003294256,0.00079197425,0.0018873643,0.0011763679,0.00093659584],"domain_scores_gemma":[0.9969597,0.00019326215,0.00038326875,0.0017707974,0.00032655598,0.00036642406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011220332,0.0005843918,0.0006763155,0.0006283811,0.00028224505,0.0007813313,0.0036487067,0.00031030035,0.000021155074],"category_scores_gemma":[0.00014539441,0.00054889097,0.00014808445,0.0010023889,0.00025031925,0.0005083314,0.0009889875,0.0006896272,0.0001843939],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042465676,0.000038929178,0.0001129113,0.00005907614,0.000014740926,0.00034321853,0.0008349427,0.031014534,0.00020654978,0.05811308,0.00095041865,0.9083074],"study_design_scores_gemma":[0.0011232728,0.00077221205,0.0006299874,0.0032493437,0.000022973902,0.00078025495,8.634413e-7,0.52863055,0.0031598955,0.19002382,0.26665226,0.004954544],"about_ca_topic_score_codex":0.000023641156,"about_ca_topic_score_gemma":0.000045343648,"teacher_disagreement_score":0.9033528,"about_ca_system_score_codex":0.0003170357,"about_ca_system_score_gemma":0.00040351925,"threshold_uncertainty_score":0.99969625},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006764403,0.00020439019,0.9235375,0.0002927826,0.00041492752,0.0005651929,0.0000023021405,0.00009360325,0.068124935],"genre_scores_gemma":[0.97206205,0.000011093887,0.026900787,0.00037007162,0.00004352851,0.000008034008,0.0000017107409,0.0000121372095,0.000590611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738693,0.00006191077,0.0005019276,0.00076621573,0.0009848522,0.0002981667],"domain_scores_gemma":[0.99789274,0.0002201929,0.00029155688,0.0014179331,0.00010283644,0.00007475266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000657719,0.00029217158,0.0003931598,0.00035751675,0.00008286143,0.00030706363,0.0027633957,0.00012439079,0.000012753766],"category_scores_gemma":[0.00007182268,0.000249658,0.000067406174,0.0005652362,0.0002205898,0.00044491165,0.0012771634,0.0004637285,0.000019781652],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024024905,0.000546815,0.0011046993,0.000063162144,0.000025791662,0.00008069426,0.014223599,0.02499413,0.00042947358,0.05306271,0.00003677329,0.90540814],"study_design_scores_gemma":[0.00861047,0.010937137,0.023320315,0.0043217675,0.00007271653,0.00038776678,0.00017575882,0.74129623,0.008831122,0.15608023,0.03877812,0.0071883807],"about_ca_topic_score_codex":0.000068483205,"about_ca_topic_score_gemma":0.0012382864,"teacher_disagreement_score":0.96529764,"about_ca_system_score_codex":0.00031612074,"about_ca_system_score_gemma":0.0000980809,"threshold_uncertainty_score":0.9999956},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022543878,0.0018241582,0.98270357,0.000095937015,0.0009801816,0.00027014274,0.0000032077062,0.000180415,0.013716978],"genre_scores_gemma":[0.76090974,0.00041540497,0.23686337,0.0005655291,0.0005574517,0.000010679688,0.000008217283,0.00004744143,0.0006221689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651825,0.000035533598,0.0005205222,0.0014581243,0.0008616771,0.0006058674],"domain_scores_gemma":[0.9968277,0.00032490186,0.00038732018,0.0015523921,0.00070263824,0.00020501029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047760876,0.00050598,0.0006303997,0.0006887817,0.00024025537,0.00022818559,0.0046353647,0.00033682946,0.000020784726],"category_scores_gemma":[0.00016206567,0.00042688518,0.00010467304,0.00090801256,0.0010615328,0.0007880025,0.000789563,0.00054263964,0.000031900076],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017355362,0.00028523649,0.00046444396,0.00043076085,0.000030941603,0.0002862627,0.010096605,0.010861472,0.00048635615,0.040768944,0.00020680824,0.93606484],"study_design_scores_gemma":[0.0015329856,0.0025025292,0.0015208226,0.0014034937,0.000036983405,0.0009529276,0.0000017363187,0.52043355,0.027306514,0.42575437,0.014386168,0.004167946],"about_ca_topic_score_codex":0.000043590902,"about_ca_topic_score_gemma":0.00016019745,"teacher_disagreement_score":0.93189687,"about_ca_system_score_codex":0.00012610391,"about_ca_system_score_gemma":0.0018464195,"threshold_uncertainty_score":0.9998183},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032178152,0.00016865555,0.9892769,0.0026096674,0.0023957477,0.0007800557,0.000010041735,0.00013674995,0.004618978],"genre_scores_gemma":[0.039547954,0.00003768003,0.9553996,0.0021549917,0.0015778985,0.000040390798,0.00001202815,0.000033890377,0.0011956177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965973,0.000044382552,0.0005689905,0.0015112557,0.00065522664,0.0006228743],"domain_scores_gemma":[0.9972624,0.00067380373,0.00030165055,0.0013196875,0.00026167036,0.00018079279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013504128,0.0004741846,0.00058175734,0.00048879965,0.00023008135,0.00042215106,0.0025544644,0.0005023198,0.000041332725],"category_scores_gemma":[0.00011932045,0.00042181523,0.0002307159,0.00025925896,0.00031289482,0.00045716894,0.00046410083,0.0006053379,0.00002404654],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017690809,0.000017593677,0.0000026593611,0.000023262795,0.0000072169696,0.000008372657,0.0002984936,0.0006884002,0.000105609666,0.06612902,0.0001285576,0.93257314],"study_design_scores_gemma":[0.00089766504,0.0002461329,0.00005893476,0.000107439264,0.000014725789,0.00003680339,3.088029e-8,0.67495537,0.0012773762,0.30914047,0.012634027,0.0006310025],"about_ca_topic_score_codex":0.000013379368,"about_ca_topic_score_gemma":0.0000983634,"teacher_disagreement_score":0.9319421,"about_ca_system_score_codex":0.00019932988,"about_ca_system_score_gemma":0.0006334014,"threshold_uncertainty_score":0.9998234},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003487993,0.00019188221,0.9975128,0.00022893916,0.0010693282,0.0002993936,0.000004156485,0.0002194776,0.00012518265],"genre_scores_gemma":[0.23468657,0.0000032020175,0.76496875,0.00019024433,0.0001107201,0.0000069276134,0.0000013851819,0.000022543338,0.0000096831245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653834,0.0000918707,0.0005874582,0.0014303335,0.00075143896,0.0006005857],"domain_scores_gemma":[0.993491,0.0040366445,0.00026695445,0.0018590626,0.0002351283,0.000111203444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028839957,0.00051625,0.00079389225,0.00089359906,0.000075367185,0.00010668438,0.0030925802,0.00083347614,0.000003812621],"category_scores_gemma":[0.0023467352,0.0004872977,0.00011944551,0.0007752961,0.00052302866,0.00030719166,0.0010015289,0.0019925574,0.0000019998404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004850103,0.000011215715,0.00017445615,0.00006117302,0.0000025736915,0.000036666588,0.000068587746,0.83835196,0.000040195588,0.0052270745,0.0000010307076,0.15602018],"study_design_scores_gemma":[0.00015571709,0.00007854557,0.00008974449,0.00037285537,0.0000028733582,0.00001881337,3.582893e-8,0.743195,0.00067741674,0.25502613,0.00001891201,0.00036394902],"about_ca_topic_score_codex":0.00004274499,"about_ca_topic_score_gemma":0.00010092434,"teacher_disagreement_score":0.24979904,"about_ca_system_score_codex":0.00034805483,"about_ca_system_score_gemma":0.00060471904,"threshold_uncertainty_score":0.9997579},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041115316,0.006287262,0.99079263,0.00072990655,0.00019371104,0.0012667646,0.000006454331,0.00030057094,0.00038156746],"genre_scores_gemma":[0.16469319,0.000053352902,0.834732,0.00024311563,0.00015710671,0.00006765431,0.000018472256,0.000022338312,0.000012762982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997634,0.00007208171,0.00045964462,0.0008978514,0.0005246349,0.00041177112],"domain_scores_gemma":[0.9983318,0.00057280983,0.00030123116,0.0004992275,0.00022869757,0.00006624215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033361714,0.00037016618,0.00034402247,0.0012036158,0.00015866269,0.00029432672,0.00094157865,0.0002433308,0.0000023864288],"category_scores_gemma":[0.000065026485,0.0003129528,0.000057927078,0.0005514728,0.00019352483,0.0010076796,0.0002553048,0.00048299422,4.778717e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066807497,0.000009037077,0.00004203581,0.000048546044,0.0000021625926,0.0000014576881,0.002323823,0.00025792583,0.00061232364,0.009847931,9.5061665e-7,0.9868471],"study_design_scores_gemma":[0.00015517048,0.000056635265,0.000057451223,0.00038861833,0.0000047043713,0.000010678028,3.768473e-7,0.575775,0.0040785153,0.41894764,0.0002347301,0.00029047616],"about_ca_topic_score_codex":0.00008387159,"about_ca_topic_score_gemma":0.0010993761,"teacher_disagreement_score":0.98655665,"about_ca_system_score_codex":0.00036638527,"about_ca_system_score_gemma":0.00025253627,"threshold_uncertainty_score":0.9999322},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021913946,0.000050049897,0.980628,0.00035115608,0.00024146301,0.013090832,0.000008939499,0.00027096155,0.0053366562],"genre_scores_gemma":[0.3189972,0.000021958787,0.6588635,0.0022290477,0.0010282455,0.013226567,0.000040002393,0.00021546942,0.00537801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961276,0.00005782352,0.00073054706,0.0013214282,0.0012519675,0.00051064015],"domain_scores_gemma":[0.99599326,0.00031033863,0.00046114397,0.0028243475,0.00034938543,0.00006150059],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007511093,0.0004695109,0.00072816794,0.0011737031,0.00021006652,0.0002699219,0.006400221,0.00039605898,0.00007378483],"category_scores_gemma":[0.000098094664,0.0003395737,0.00032835014,0.0041551283,0.0012213012,0.00045728195,0.0029006484,0.0006653066,0.000017233988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070286583,0.00010677335,0.0007853555,0.000077065226,0.00019100434,0.000022118917,0.00033452702,0.46697888,0.0002195595,0.012177122,0.0006552809,0.5184453],"study_design_scores_gemma":[0.00012969862,0.00007834815,0.0005692056,0.00019539431,0.00007511605,0.000007947198,3.1164898e-8,0.9129592,0.0029780832,0.07963336,0.0028937357,0.00047983605],"about_ca_topic_score_codex":0.000020392728,"about_ca_topic_score_gemma":0.00009350969,"teacher_disagreement_score":0.51796544,"about_ca_system_score_codex":0.00028712835,"about_ca_system_score_gemma":0.0004924764,"threshold_uncertainty_score":0.99990565},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054217177,0.0009624599,0.9782668,0.0002927163,0.0019412183,0.0009871544,0.0000050086333,0.0003813317,0.0171091],"genre_scores_gemma":[0.13347198,0.0011735504,0.8486535,0.009690909,0.002121529,0.00036144507,0.000042726377,0.00019367941,0.004290706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945857,0.000060794868,0.0007184786,0.002199271,0.0013868985,0.00104884],"domain_scores_gemma":[0.99653053,0.000308228,0.0002927885,0.0024510538,0.00013202273,0.00028538247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000868298,0.00069993775,0.000572759,0.0011177415,0.0004430418,0.0008100139,0.0046738707,0.00027443896,0.00023435001],"category_scores_gemma":[0.000017882272,0.0006923498,0.00023007132,0.0010195601,0.00056034664,0.0006175463,0.0020401124,0.00078184827,0.00038095345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026951016,0.00003815144,0.0000052312976,0.000022785984,0.000014973212,0.00017706324,0.00029776228,0.19273242,0.000017437045,0.03495463,0.00023843988,0.7714984],"study_design_scores_gemma":[0.00038419382,0.0003605605,0.000033880882,0.00059912616,0.000025178095,0.00006970057,2.7940126e-7,0.73087704,0.00047978442,0.13545933,0.13030303,0.0014079143],"about_ca_topic_score_codex":0.000034614837,"about_ca_topic_score_gemma":0.000051467083,"teacher_disagreement_score":0.77009046,"about_ca_system_score_codex":0.00084123155,"about_ca_system_score_gemma":0.0005024306,"threshold_uncertainty_score":0.9995528},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000093519346,0.011765321,0.9798309,0.00017038526,0.003332586,0.0011051671,0.0000050219815,0.00031226635,0.0033848304],"genre_scores_gemma":[0.5071835,0.010219785,0.46232784,0.011126365,0.0062305257,0.0005453771,0.00006883375,0.0004558882,0.0018419321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931296,0.0000965566,0.00096462126,0.0029244113,0.001328678,0.0015561279],"domain_scores_gemma":[0.9955858,0.00071500114,0.00051033584,0.0025443323,0.00030362568,0.00034092373],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010933542,0.0010252185,0.0010342472,0.0010555029,0.0002706644,0.00075015146,0.006936221,0.0008402631,0.00007441187],"category_scores_gemma":[0.000012801534,0.0009959581,0.00021521219,0.0018811089,0.0006829865,0.0012006864,0.003080199,0.0020918474,0.00008691448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011555553,0.00003375768,0.000053213585,0.000022185783,0.000008506981,0.00031037914,0.0005367506,0.41037723,0.0000022135202,0.0018025746,0.000030560186,0.58681107],"study_design_scores_gemma":[0.00041438054,0.00038763497,0.00016457083,0.0010339962,0.000007784829,0.000104534396,0.0000010815573,0.95080286,0.000023458657,0.029947663,0.016042471,0.0010695449],"about_ca_topic_score_codex":0.000031807333,"about_ca_topic_score_gemma":0.001532345,"teacher_disagreement_score":0.5857415,"about_ca_system_score_codex":0.00069341366,"about_ca_system_score_gemma":0.00047865714,"threshold_uncertainty_score":0.9992491},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036687557,0.0015744439,0.9464307,0.0007352492,0.001685443,0.0011757568,0.0000139850135,0.00006599207,0.011630863],"genre_scores_gemma":[0.506941,0.00014121452,0.48240435,0.0025939841,0.0026905884,0.000025253055,0.00016936808,0.0001787444,0.0048554367],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997969,0.000020849147,0.00037988654,0.00085666083,0.00032238985,0.00045122858],"domain_scores_gemma":[0.99898905,0.00006177176,0.0002128085,0.0005747147,0.00008314026,0.00007853701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075081654,0.00030516458,0.0002937789,0.00025767885,0.00007166608,0.00009708502,0.00073176797,0.00038985215,0.000042712636],"category_scores_gemma":[0.0002115968,0.00030276412,0.000074732954,0.00012826643,0.00028553512,0.0000081146045,0.00050563103,0.0005501863,0.000040050265],"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.000015228507,0.000043190706,0.0006532806,0.00010622973,0.00003424521,0.00010163836,0.0006011175,0.007650882,0.7484535,0.00010117155,0.00003448096,0.24220502],"study_design_scores_gemma":[0.0047831386,0.002382847,0.0027370276,0.0038334758,0.00018204907,0.00054023386,0.000004267898,0.3190017,0.4780804,0.116837494,0.0618899,0.009727443],"about_ca_topic_score_codex":0.000021200096,"about_ca_topic_score_gemma":0.00018303761,"teacher_disagreement_score":0.4702535,"about_ca_system_score_codex":0.00006275155,"about_ca_system_score_gemma":0.00020245269,"threshold_uncertainty_score":0.9999424},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011771545,0.00016100494,0.9902679,0.000455589,0.00026322438,0.00039086276,0.000024386747,0.00009440537,0.0071654725],"genre_scores_gemma":[0.6454386,0.00004221773,0.35307413,0.0007378359,0.00020319139,0.000011437886,0.00005241772,0.00004363035,0.00039654487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965446,0.00003365619,0.0005163422,0.0013159844,0.00097570353,0.0006137332],"domain_scores_gemma":[0.99700534,0.00033763365,0.00026548887,0.0020152635,0.00024013422,0.00013612631],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011383318,0.00042775957,0.00052763935,0.00047707118,0.0006676067,0.00033399355,0.0049097063,0.00024119983,0.000015747944],"category_scores_gemma":[0.000026883165,0.00028863247,0.00007162701,0.0005039449,0.000636101,0.0010043853,0.0014936246,0.00091588486,0.000009804056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053906246,0.00020031369,0.00015628242,0.00018733156,0.000057647547,0.00007852195,0.0056965277,0.6209055,0.012455366,0.0057704574,0.00051538576,0.35392275],"study_design_scores_gemma":[0.00045242862,0.00013459702,0.000032539134,0.0013413818,0.000021227657,0.000029130837,0.0000017845427,0.97001684,0.0070381784,0.019683084,0.00069216924,0.0005566327],"about_ca_topic_score_codex":0.00010796099,"about_ca_topic_score_gemma":0.000649936,"teacher_disagreement_score":0.6442614,"about_ca_system_score_codex":0.000072814684,"about_ca_system_score_gemma":0.00036577752,"threshold_uncertainty_score":0.9999566},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007156281,0.00023268227,0.9962755,0.00011764948,0.0010468373,0.00042093953,0.0000034147497,0.0004975623,0.0013338918],"genre_scores_gemma":[0.020975227,0.000015111261,0.97631973,0.002278562,0.0003134526,6.920509e-7,0.000006060692,0.00003472143,0.00005645152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957147,0.000034512424,0.0007904108,0.0014127365,0.0012652924,0.0007823368],"domain_scores_gemma":[0.99712855,0.00076815544,0.00038910017,0.0010615907,0.00036862455,0.0002839832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017085806,0.0005049017,0.0005250662,0.0012282245,0.0002796192,0.00056026684,0.0025621976,0.00040382412,0.00005381953],"category_scores_gemma":[0.00024853143,0.0004959127,0.00015178595,0.00084118074,0.0010296755,0.0006731293,0.0009944135,0.0009428334,0.000016823127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003621422,0.000015366611,0.000016423763,0.00003744913,0.000013693608,0.00017481849,0.00043979136,0.090013914,0.002023916,0.0030413948,0.0000036141914,0.904216],"study_design_scores_gemma":[0.00024419205,0.00007642698,0.0000071732647,0.00058422773,0.000009215901,0.000095136726,2.0481993e-7,0.9438301,0.013768111,0.04064942,0.00011572778,0.0006201179],"about_ca_topic_score_codex":0.00003560335,"about_ca_topic_score_gemma":0.000009529021,"teacher_disagreement_score":0.90359586,"about_ca_system_score_codex":0.0004323447,"about_ca_system_score_gemma":0.00062283967,"threshold_uncertainty_score":0.99974924},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002422871,0.00040471443,0.977457,0.0015598004,0.0014447637,0.0006794966,0.000002825878,0.00049982284,0.017949138],"genre_scores_gemma":[0.109518856,0.000025875857,0.8870426,0.002844178,0.00034839116,0.000021368794,0.00000265585,0.000040551342,0.00015551451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955493,0.00024345636,0.00073648395,0.0018984932,0.00081835524,0.0007538823],"domain_scores_gemma":[0.9965961,0.0010108971,0.00034835073,0.0016388999,0.00013885762,0.00026689624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029013054,0.00073953636,0.0010014615,0.001072897,0.00028688615,0.00075160875,0.0023309903,0.00047714048,0.000008601909],"category_scores_gemma":[0.000035044355,0.00060871925,0.00020383825,0.0004653389,0.000402534,0.0003806857,0.00056670123,0.0010496094,0.00000949389],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017169927,0.000024374734,0.000005500606,0.000067248024,0.000009766703,0.00007725425,0.00019605631,0.0023434293,0.000017405602,0.023608632,0.000087845205,0.9735453],"study_design_scores_gemma":[0.0008551179,0.0005526179,0.00003593759,0.0010831208,0.000011100025,0.0002043832,5.1019754e-7,0.93977034,0.0014018142,0.050059687,0.00521159,0.0008137839],"about_ca_topic_score_codex":0.000053241245,"about_ca_topic_score_gemma":0.000030399471,"teacher_disagreement_score":0.97273153,"about_ca_system_score_codex":0.00063450634,"about_ca_system_score_gemma":0.00031055202,"threshold_uncertainty_score":0.9996364},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034962132,0.00021877004,0.9964256,0.00006560262,0.00015867034,0.00017171471,0.0000060611815,0.00023540248,0.0023685368],"genre_scores_gemma":[0.5261676,0.00012131306,0.47324255,0.00016333324,0.00010904187,0.000002342123,0.0000069546477,0.000040895306,0.00014599504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998377,0.000008250848,0.000368609,0.0004972346,0.00048251674,0.0002663373],"domain_scores_gemma":[0.9990288,0.00012123589,0.000054345815,0.000602699,0.00011961559,0.00007331049],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016234674,0.0003220596,0.00044839323,0.00032611287,0.00006950838,0.00004986866,0.00072129373,0.00018234126,0.000014985964],"category_scores_gemma":[0.000018620194,0.0002879557,0.00009784828,0.00035966528,0.0002341995,0.00022628003,0.00011300921,0.0004905572,0.0000036561771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012246824,0.000008971931,4.7197037e-7,0.000010286201,0.000004621005,0.000002946586,0.000036210742,0.83766776,0.00024875542,0.0016875576,0.000007194637,0.16032399],"study_design_scores_gemma":[0.00004387319,0.00007606718,0.0000034921586,0.00022717334,0.0000074013483,0.0000024234816,4.9967845e-8,0.96165293,0.0074062194,0.030213293,0.000081287784,0.00028579135],"about_ca_topic_score_codex":0.000004922787,"about_ca_topic_score_gemma":0.000013243293,"teacher_disagreement_score":0.52581793,"about_ca_system_score_codex":0.0001632195,"about_ca_system_score_gemma":0.000042520318,"threshold_uncertainty_score":0.99995726},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014419486,0.00003759621,0.99726033,0.00032135655,0.00013597394,0.0012140813,0.000016189262,0.0004303003,0.00043996703],"genre_scores_gemma":[0.21703705,0.0000013057316,0.78161794,0.0009244926,0.000103833605,0.00022359919,0.000012494249,0.000057341833,0.000021932448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985589,0.000011985413,0.00023848703,0.0005446083,0.00030826108,0.00033776794],"domain_scores_gemma":[0.9983791,0.0006909237,0.000057285903,0.00061475084,0.00014407458,0.00011385923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004661679,0.00030793028,0.00028495397,0.00023674741,0.00006140405,0.00009151575,0.00061478675,0.00015737668,0.000009043142],"category_scores_gemma":[0.00009012329,0.00026784049,0.000044437897,0.00024157239,0.0001003906,0.00005557555,0.00008794699,0.00026977842,0.000009769914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012481418,0.00001942895,0.0002331405,0.00012058716,0.000008880756,0.0000031545267,0.00011235501,0.55786175,0.0007699901,0.0026146611,0.00014029816,0.4381033],"study_design_scores_gemma":[0.00015033905,0.00029659687,0.00009959179,0.0002255504,0.000012993938,0.0000035369278,3.0964692e-8,0.94536495,0.036292568,0.0063844,0.010779249,0.0003901961],"about_ca_topic_score_codex":0.000007751403,"about_ca_topic_score_gemma":0.00006471735,"teacher_disagreement_score":0.4377131,"about_ca_system_score_codex":0.00009917052,"about_ca_system_score_gemma":0.0000679142,"threshold_uncertainty_score":0.99997735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024935862,0.0010841311,0.99432427,0.00022824887,0.0011497868,0.00040532998,0.0000049801515,0.00010411191,0.00020554817],"genre_scores_gemma":[0.9141003,0.000011422193,0.085515134,0.00009762627,0.00018892162,0.000004797273,0.000003194665,0.000028542641,0.000050071147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617994,0.000046854286,0.00049101474,0.00097428326,0.0016227788,0.00068515533],"domain_scores_gemma":[0.99677557,0.0011467304,0.00020348998,0.0014106095,0.00033296322,0.00013064702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015040624,0.00039509925,0.00044704022,0.0011638362,0.00011458551,0.00022167797,0.0040338165,0.00030852522,0.000008445638],"category_scores_gemma":[0.0005808114,0.00030068654,0.000096791584,0.0012988304,0.0005970861,0.0005237908,0.0015522212,0.0010721397,0.000008247907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022549388,0.00004297748,0.0062950603,0.00020369695,0.000031404838,0.00011085661,0.005627767,0.52379084,0.0011599399,0.07096677,0.00014150355,0.39160663],"study_design_scores_gemma":[0.0005835484,0.00025904566,0.003981356,0.0007693444,0.000007464885,0.0000846571,0.000001973156,0.7495438,0.0011364452,0.24175785,0.0010580686,0.0008164362],"about_ca_topic_score_codex":0.00023264122,"about_ca_topic_score_gemma":0.00043568359,"teacher_disagreement_score":0.9116067,"about_ca_system_score_codex":0.0013099427,"about_ca_system_score_gemma":0.0010844062,"threshold_uncertainty_score":0.9999445},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024069646,0.000046565514,0.97237635,0.00022229068,0.0009148753,0.00028732885,0.00000896829,0.00007368245,0.0020003074],"genre_scores_gemma":[0.98966,0.000036234873,0.008743374,0.0004242436,0.00022835129,0.0000026603382,0.0000040162454,0.000037296122,0.0008638133],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974055,0.00004074499,0.00034372386,0.0008989985,0.0008632481,0.00044774872],"domain_scores_gemma":[0.99891084,0.0002100226,0.00024090563,0.00040930125,0.00016059625,0.00006835368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007018235,0.00033357154,0.00030757787,0.00064878725,0.00053591817,0.00018611673,0.0009550747,0.00030983894,0.00001851277],"category_scores_gemma":[0.00017806963,0.00025262302,0.00012088467,0.00069436483,0.00048661022,0.00024414196,0.00030858492,0.0010489973,0.000014313118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106238185,0.00007030021,0.000048941783,0.00028689243,0.000011929107,0.00006131341,0.0034494791,0.31682032,0.3679784,0.016865492,0.0000032245684,0.2942975],"study_design_scores_gemma":[0.00016630066,0.00008508318,0.000029675339,0.00045449755,0.000010340834,0.00007891475,0.0000024196722,0.9332094,0.044129122,0.021500165,0.0000060254642,0.0003280082],"about_ca_topic_score_codex":0.00000984317,"about_ca_topic_score_gemma":0.00010513647,"teacher_disagreement_score":0.96559036,"about_ca_system_score_codex":0.0003539236,"about_ca_system_score_gemma":0.00017513339,"threshold_uncertainty_score":0.9999926},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016425101,0.0025358319,0.9803171,0.0000719567,0.0027226862,0.0003610941,0.000040720774,0.00017657853,0.012131531],"genre_scores_gemma":[0.9977076,0.0003359065,0.0016067971,0.000038720893,0.00016999558,0.000005927214,0.000009357341,0.000032344044,0.00009335299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842626,0.000025297517,0.00044464695,0.00035591458,0.0003891193,0.0003587841],"domain_scores_gemma":[0.9988332,0.00028931524,0.00009952467,0.0006448151,0.00007004502,0.0000631355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032753448,0.00029039555,0.00033952357,0.00029333687,0.000305849,0.0000921416,0.000872555,0.00018051175,0.000032876884],"category_scores_gemma":[0.000012453628,0.00022548546,0.00012893222,0.00042102375,0.0006923963,0.00010868794,0.00007858085,0.0004124153,0.000018616003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000937378,0.000026632591,0.00043451195,0.00020004794,0.00010663428,0.000017617804,0.0013081508,0.46842653,0.0028054065,0.1638498,0.00009334573,0.36272195],"study_design_scores_gemma":[0.00038595867,0.00012775866,0.0017934144,0.0011348068,0.00004565778,0.00008110991,9.534767e-7,0.27278978,0.0021675415,0.6881715,0.032056622,0.0012448988],"about_ca_topic_score_codex":0.0000091556985,"about_ca_topic_score_gemma":0.000047990678,"teacher_disagreement_score":0.9960651,"about_ca_system_score_codex":0.000052881085,"about_ca_system_score_gemma":0.00005135485,"threshold_uncertainty_score":0.91950303},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0713521,0.021842832,0.8727519,0.00066521694,0.0019393505,0.0029924165,0.00007458388,0.00005105319,0.028330568],"genre_scores_gemma":[0.9365297,0.0011013757,0.05971474,0.00063780247,0.00057074946,0.000013288626,0.00006773145,0.000050079525,0.0013145478],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99810505,0.000013866544,0.0003879989,0.00072989444,0.00037661233,0.00038657754],"domain_scores_gemma":[0.99899507,0.000019465446,0.0001810612,0.0006244325,0.00011625209,0.0000637379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004310013,0.0003031066,0.00036733338,0.00037498857,0.00003542588,0.00003086072,0.0007487896,0.00026137297,0.000023409508],"category_scores_gemma":[0.000022609333,0.0002902478,0.00010521526,0.00016108515,0.00031534728,0.000005813865,0.00032185874,0.00021428402,0.0000058347637],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031018848,0.000060390223,0.0005667295,0.00006152309,0.00003155663,0.00002623042,0.00027664626,0.003886095,0.16874269,0.00018716606,0.000027888229,0.8261021],"study_design_scores_gemma":[0.010164026,0.008842629,0.047541298,0.0025626845,0.00019011549,0.00019598436,0.000008413853,0.029217517,0.5620808,0.15338387,0.17798965,0.007823015],"about_ca_topic_score_codex":0.000012860076,"about_ca_topic_score_gemma":0.00015388844,"teacher_disagreement_score":0.8651776,"about_ca_system_score_codex":0.00008589455,"about_ca_system_score_gemma":0.00017297111,"threshold_uncertainty_score":0.99995494},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017236248,0.000042533644,0.9619888,0.0011686118,0.0013302608,0.034156702,0.0000092531045,0.00009595794,0.0012061457],"genre_scores_gemma":[0.22334035,0.000041313,0.6867738,0.009926764,0.0054486287,0.06856703,0.000032484786,0.00018251379,0.005687157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973714,0.000025848989,0.00051470834,0.0008462598,0.00068251236,0.0005593156],"domain_scores_gemma":[0.99725896,0.0009368704,0.00040051146,0.0010466297,0.00025776913,0.00009927576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096810726,0.0003549654,0.00032648223,0.00029155103,0.0005594226,0.00061018014,0.002302777,0.00022096132,0.00005039254],"category_scores_gemma":[0.00007907722,0.000245915,0.00015752342,0.00026102143,0.00028464163,0.0008771039,0.00040964677,0.00039187266,0.00004129406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015348794,0.00005682733,0.00008004786,0.00012575884,0.00003516483,0.000012904833,0.0019535052,0.02981614,0.00007097099,0.11652336,0.0005741585,0.85073584],"study_design_scores_gemma":[0.0006271397,0.00013043372,0.0002506743,0.00012586985,0.000007642172,0.000023241397,1.1551041e-7,0.95261204,0.0002410462,0.009721244,0.035926264,0.0003342859],"about_ca_topic_score_codex":0.000035879515,"about_ca_topic_score_gemma":0.000060871258,"teacher_disagreement_score":0.9227959,"about_ca_system_score_codex":0.00018227426,"about_ca_system_score_gemma":0.00024544654,"threshold_uncertainty_score":0.9999993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041671625,0.001730016,0.98067397,0.00076623686,0.000519096,0.00027430672,0.0000011649878,0.00030635265,0.015687203],"genre_scores_gemma":[0.12699349,0.0015717507,0.86635154,0.0026051733,0.0006281729,0.000015823782,0.000006943629,0.0000663357,0.0017607824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678504,0.000055668253,0.00043567162,0.0012862812,0.0008335567,0.0006037813],"domain_scores_gemma":[0.99680454,0.00045733116,0.0002798848,0.001890442,0.00038245015,0.00018534482],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005111363,0.00050968357,0.00047605165,0.00059420115,0.00062175654,0.00046134074,0.0041911225,0.0001791069,0.000024282908],"category_scores_gemma":[0.000055531633,0.0004322844,0.00008379034,0.0009647624,0.00074463093,0.00066682696,0.0017163983,0.0010198946,0.00004985827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049282817,0.000018822513,0.000051230578,0.000012069934,0.000010574575,0.00010496244,0.0015719013,0.028881202,0.00004272582,0.0055026943,0.00010220684,0.96369666],"study_design_scores_gemma":[0.0005059104,0.00026247368,0.00023654361,0.0009065155,0.00000733396,0.00062440993,2.7431307e-7,0.9740937,0.0003596962,0.002711397,0.019165725,0.0011260207],"about_ca_topic_score_codex":0.0000071893755,"about_ca_topic_score_gemma":0.000111036104,"teacher_disagreement_score":0.96257067,"about_ca_system_score_codex":0.00027312632,"about_ca_system_score_gemma":0.0006292887,"threshold_uncertainty_score":0.9998129},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008078029,0.0011856987,0.993786,0.00033410895,0.00078822894,0.00042884573,0.0000017379716,0.00020424282,0.0024633533],"genre_scores_gemma":[0.6331234,0.00010615046,0.36543974,0.00052289286,0.00035105835,0.000019915527,0.0000023798325,0.000060033104,0.00037442357],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952505,0.00005788117,0.00038339238,0.0015401569,0.0016021917,0.0011658713],"domain_scores_gemma":[0.99653137,0.0008497704,0.00023544236,0.0018070923,0.0002394433,0.00033690495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001185457,0.00055263325,0.0005102672,0.0009773972,0.0004148914,0.0005671466,0.0046244524,0.00023478126,0.000026673955],"category_scores_gemma":[0.0000887792,0.00043209348,0.000095030155,0.0010336105,0.0011170678,0.0017049022,0.0024339638,0.0010909722,0.00010374429],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020564645,0.0000382665,0.0004868538,0.000048554062,0.000015907171,0.00009683303,0.00082122174,0.014794609,0.0003635963,0.054042123,0.000002867191,0.9292686],"study_design_scores_gemma":[0.0012371874,0.0013548284,0.0025535808,0.0019882082,0.000028980863,0.00025389614,7.629201e-7,0.30983984,0.011977341,0.6595844,0.008264027,0.0029169105],"about_ca_topic_score_codex":0.000010122299,"about_ca_topic_score_gemma":0.000038380276,"teacher_disagreement_score":0.92635167,"about_ca_system_score_codex":0.00029895097,"about_ca_system_score_gemma":0.00030067345,"threshold_uncertainty_score":0.9998131},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075938115,0.00016807494,0.9900017,0.000051186827,0.001324097,0.00022750265,0.000008962743,0.00008285872,0.00054185634],"genre_scores_gemma":[0.54892486,0.00018936294,0.44979665,0.00060170685,0.00029682255,0.0000039505926,0.00001405524,0.000045639394,0.00012695865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733317,0.00003810411,0.0005051422,0.0009582878,0.0007363236,0.0004289929],"domain_scores_gemma":[0.99801505,0.00017314954,0.00043471996,0.0010149586,0.00025358427,0.000108539774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046342527,0.00039155572,0.00048281814,0.0010504365,0.0002309144,0.00013882494,0.0024271288,0.0002366068,0.000010285359],"category_scores_gemma":[0.00003208923,0.0003623404,0.00015657337,0.00084431446,0.0009890264,0.0006435637,0.00070327934,0.00042165635,0.000006347931],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011994469,0.00006750396,0.0002256358,0.000076717624,0.000027315404,0.00015699217,0.002046277,0.008670108,0.026773173,0.07967835,0.000002638756,0.8822633],"study_design_scores_gemma":[0.00037551054,0.00025631598,0.0013815232,0.0007294856,0.000015343103,0.00031950904,1.3185229e-7,0.63880676,0.034522567,0.32224828,0.00028609607,0.0010584595],"about_ca_topic_score_codex":0.000009492126,"about_ca_topic_score_gemma":0.0000059897284,"teacher_disagreement_score":0.88120484,"about_ca_system_score_codex":0.00007271041,"about_ca_system_score_gemma":0.00031754788,"threshold_uncertainty_score":0.9998829},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05598155,0.00004326226,0.9432732,0.00017525487,0.000084529456,0.00033218664,0.00000312536,0.000050623512,0.000056264613],"genre_scores_gemma":[0.49893644,0.000003203626,0.5007696,0.00027038858,0.00000697409,0.000010393532,5.607242e-7,0.0000019247739,5.161118e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827397,0.000091765956,0.00040288852,0.00049378583,0.00048889307,0.00024872314],"domain_scores_gemma":[0.9988419,0.00012396082,0.00017757043,0.0003842758,0.0003699958,0.00010230401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008341552,0.00014787937,0.00021165088,0.0002936206,0.00009910641,0.00008691045,0.000803956,0.000056359855,0.000006356904],"category_scores_gemma":[0.00019709075,0.00012021156,0.0000213973,0.0009804964,0.00075069617,0.0012173027,0.000238749,0.00013252533,8.9957973e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037918875,0.00020551567,0.0010172451,0.00011735972,0.0000067893498,0.000008192056,0.020614373,0.33993107,0.27491853,0.00093603507,0.000019946609,0.36218703],"study_design_scores_gemma":[0.00008126142,0.00020702262,0.00032956808,0.00006812474,0.0000013214171,0.0000021615565,0.0000018783641,0.5152734,0.48281592,0.0011496037,1.0480898e-7,0.000069651185],"about_ca_topic_score_codex":0.00016457628,"about_ca_topic_score_gemma":0.000049710103,"teacher_disagreement_score":0.4429549,"about_ca_system_score_codex":0.00007117131,"about_ca_system_score_gemma":0.0003646724,"threshold_uncertainty_score":0.4902085},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036940843,0.000100894664,0.95761967,0.0006499912,0.0002593261,0.00019748839,0.000008378703,0.004199838,0.000023574385],"genre_scores_gemma":[0.51863426,0.00006447168,0.4803816,0.0008601605,0.000035627014,0.000010669933,0.0000039805177,0.000008857472,3.6520402e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970534,0.000059436115,0.0003997892,0.0011181118,0.00070517,0.00066411553],"domain_scores_gemma":[0.99690014,0.001356894,0.00016316939,0.0010853229,0.00033578888,0.0001586908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052819203,0.00030386823,0.0002593087,0.003580925,0.00029226416,0.0007429894,0.0023534617,0.00010071591,0.000001664846],"category_scores_gemma":[0.0003596458,0.0002789405,0.00007235144,0.01782674,0.00029365954,0.0017047636,0.0006575925,0.0003427606,0.000007950575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033051076,0.00006378464,0.011121063,0.0000026545597,0.0000025673044,0.00003675135,0.0006637115,0.82761467,0.00039540208,0.000028223725,0.00017055594,0.15989733],"study_design_scores_gemma":[0.00014763327,0.00007093228,0.0017320438,0.00006678249,0.0000015664491,0.000015814034,5.539014e-8,0.7019229,0.0012827697,0.29449588,0.000011414877,0.0002522458],"about_ca_topic_score_codex":0.00042485193,"about_ca_topic_score_gemma":0.000047267607,"teacher_disagreement_score":0.48169342,"about_ca_system_score_codex":0.00006124622,"about_ca_system_score_gemma":0.00015582412,"threshold_uncertainty_score":0.99996626},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006539309,0.0000981086,0.97905105,0.0012355373,0.0009047202,0.0001860163,0.000005076418,0.0003005305,0.018153593],"genre_scores_gemma":[0.0784701,0.000022717732,0.9171357,0.0020609014,0.00045171828,0.000013285909,0.000012350401,0.000041490308,0.0017916912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576145,0.000027688953,0.00063330954,0.0015857907,0.0011247691,0.00086701725],"domain_scores_gemma":[0.99691087,0.00049192016,0.0003005472,0.0018059132,0.00019265612,0.00029807768],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009641596,0.0005404875,0.00067657715,0.0009741873,0.0002985024,0.0011776768,0.004660645,0.00034357898,0.00010710979],"category_scores_gemma":[0.00016305366,0.0004633723,0.00020521985,0.0007425151,0.00069831556,0.0011017933,0.0013447688,0.0008448027,0.00031735518],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.171574e-7,0.00001092353,0.000008930372,0.000018837261,0.000019545767,0.00004748951,0.0012413969,0.0019258091,0.000044535467,0.034214605,0.0001426941,0.9623246],"study_design_scores_gemma":[0.00014325212,0.00009221367,0.00006686012,0.0003050644,0.00001430409,0.000051268755,6.5132645e-7,0.85225546,0.00009561328,0.14360048,0.0027574892,0.0006173503],"about_ca_topic_score_codex":0.000022367347,"about_ca_topic_score_gemma":0.000030977553,"teacher_disagreement_score":0.9617073,"about_ca_system_score_codex":0.00023938621,"about_ca_system_score_gemma":0.0007359095,"threshold_uncertainty_score":0.9998592},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002179174,0.000216059,0.9963364,0.0009728235,0.0008365582,0.00065212266,0.000060591887,0.000049753646,0.0006577493],"genre_scores_gemma":[0.60016936,0.00011265575,0.39592737,0.0028707867,0.00028583896,0.000043963166,0.000014576138,0.000034168144,0.0005412516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736184,0.000040807638,0.00041486343,0.0010608333,0.00073899305,0.00038269063],"domain_scores_gemma":[0.99654007,0.0015263981,0.00025744032,0.0012483427,0.00034082832,0.00008692201],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011199393,0.00036155197,0.00040274218,0.00032000383,0.00029868502,0.00024261085,0.001939561,0.00020728633,0.000029553472],"category_scores_gemma":[0.0002111016,0.00026876573,0.00011712408,0.00046697838,0.0011023611,0.0002880412,0.0007029066,0.00050879084,0.000010444974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001659399,0.00008728087,0.00003505561,0.00012484805,0.000027583428,0.00000775485,0.0024752931,0.0060851355,0.000024414967,0.34188735,0.00020761456,0.6490211],"study_design_scores_gemma":[0.0002361372,0.00032633913,0.0002642803,0.00018248097,0.000006099396,0.000015734684,2.9168788e-7,0.54918563,0.0004786343,0.44735324,0.0015896759,0.00036143739],"about_ca_topic_score_codex":0.000013625751,"about_ca_topic_score_gemma":0.000008538748,"teacher_disagreement_score":0.64865965,"about_ca_system_score_codex":0.00010225456,"about_ca_system_score_gemma":0.00017043913,"threshold_uncertainty_score":0.99997646},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014232863,0.005244419,0.9739371,0.00012992325,0.00071465585,0.00030160887,0.000023767525,0.000014841865,0.0054008514],"genre_scores_gemma":[0.9143862,0.00048697696,0.083768405,0.00047501363,0.0006309478,0.0000025808959,0.00013722868,0.000022159002,0.00009045696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851155,0.000011984356,0.0003060258,0.0007508295,0.00009298323,0.00032664777],"domain_scores_gemma":[0.9990864,0.000064554944,0.00011926545,0.0006302725,0.00003203215,0.000067496505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006537317,0.00024333621,0.00023109898,0.00013501775,0.000084445266,0.00008828438,0.00080689765,0.00038455753,0.0000067882347],"category_scores_gemma":[0.000048793787,0.00021108985,0.0000274541,0.000077929435,0.00038562904,0.0000118368625,0.0012998732,0.00042291766,0.0000036490744],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029706378,0.00003662495,0.0005545694,0.00006322181,0.000017851413,0.00003383627,0.0006797456,0.005698906,0.013797361,0.0011749694,0.00003909207,0.9778741],"study_design_scores_gemma":[0.0089721475,0.0033122236,0.0045247613,0.007446927,0.000094995194,0.0017850854,0.00004298134,0.57380325,0.036152557,0.21838766,0.13463956,0.010837822],"about_ca_topic_score_codex":0.00000818754,"about_ca_topic_score_gemma":0.00019677983,"teacher_disagreement_score":0.9670363,"about_ca_system_score_codex":0.000042534717,"about_ca_system_score_gemma":0.0002436173,"threshold_uncertainty_score":0.86079943},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013756276,0.0004352288,0.9967786,0.00043933085,0.0003176055,0.00046538058,0.000017943723,0.00035355895,0.0010547538],"genre_scores_gemma":[0.1381884,0.0002281351,0.8597741,0.0012730908,0.00011731775,0.000010611688,0.000046977093,0.00005027736,0.0003110893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618423,0.0000685845,0.0004676554,0.0018145964,0.0009428592,0.0005220599],"domain_scores_gemma":[0.9974209,0.00031763682,0.00034491243,0.0013410259,0.0003386464,0.0002368468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061229226,0.00054656167,0.00049400446,0.000702019,0.0003664795,0.00063325965,0.0026139473,0.00036092036,0.000012046692],"category_scores_gemma":[0.00007570586,0.00048696753,0.000099757344,0.00066021713,0.0012357375,0.001079412,0.0006064023,0.0009364102,0.000011700003],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009435475,0.00037326163,0.00004130877,0.00013428219,0.000025184163,0.00016138272,0.002343566,0.0002510793,0.05544603,0.0019900273,0.00014065205,0.9389989],"study_design_scores_gemma":[0.0003691791,0.00045365325,0.00014543004,0.00017838177,0.000008451719,0.00014034701,5.98476e-7,0.91873294,0.067957416,0.010149616,0.0009257757,0.0009381826],"about_ca_topic_score_codex":0.000014786297,"about_ca_topic_score_gemma":0.0000032062537,"teacher_disagreement_score":0.9380607,"about_ca_system_score_codex":0.00033876524,"about_ca_system_score_gemma":0.0004986747,"threshold_uncertainty_score":0.9997582},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019234383,0.0013417074,0.9784969,0.00016114846,0.00038149403,0.00015023087,0.000025224836,0.000013519513,0.00019536831],"genre_scores_gemma":[0.5516089,0.000039305523,0.44773313,0.00038630364,0.000197337,0.0000024805142,0.000011163631,0.000008308453,0.000013030939],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985296,0.000034658002,0.00054265145,0.0004903227,0.00018224791,0.00022050891],"domain_scores_gemma":[0.9983058,0.0008408316,0.00037623863,0.00029859392,0.00012223622,0.00005631528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000586637,0.00018611691,0.0005439204,0.000101904516,0.000051018167,0.000010843558,0.00037367124,0.00057915365,0.000003734548],"category_scores_gemma":[0.001041802,0.00015944071,0.00011540432,0.00005108387,0.0024898075,0.0000023850569,0.00015640783,0.00025902223,1.0220554e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006178612,0.000032993885,0.0004151115,0.00009594189,0.000024775347,0.0000044635776,0.0003268848,0.000548605,0.0030495233,0.007863535,0.000018917965,0.9875575],"study_design_scores_gemma":[0.006101851,0.019118536,0.0072129974,0.0065932698,0.00022497351,0.0001156384,0.00006132244,0.27296695,0.18315013,0.48247907,0.018886283,0.0030890012],"about_ca_topic_score_codex":0.0000053490708,"about_ca_topic_score_gemma":0.00001899568,"teacher_disagreement_score":0.98446846,"about_ca_system_score_codex":0.000007923888,"about_ca_system_score_gemma":0.00029499514,"threshold_uncertainty_score":0.9173799},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036415415,0.0023861686,0.9930759,0.00079448137,0.0017052568,0.00088059704,0.00003242175,0.0004553452,0.00063338183],"genre_scores_gemma":[0.020599976,0.0006462105,0.975101,0.0020993322,0.00030834804,0.00007973612,0.0000138007445,0.0000554429,0.0010961809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958586,0.000013147472,0.00048382723,0.0017968871,0.0010107321,0.0008367824],"domain_scores_gemma":[0.99569654,0.0007115206,0.0003353365,0.00294248,0.0002039682,0.000110122506],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00046489597,0.0006004206,0.00046890156,0.00047578994,0.0008736388,0.0002358876,0.0070589297,0.00040048058,0.000008638989],"category_scores_gemma":[0.00015402336,0.00044031974,0.0001608121,0.0004141188,0.0013706732,0.00078635785,0.0053603663,0.0006688686,0.000045361918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022271242,0.00003809186,0.000007202125,0.000023142167,0.000016495305,0.00006646316,0.0010250066,0.23718259,0.0010815369,0.014579091,0.0028810955,0.74307704],"study_design_scores_gemma":[0.0002693374,0.00011966591,0.0000071662835,0.000092859016,0.000005439095,0.00007429159,2.4025195e-7,0.9107997,0.00367027,0.06885762,0.015544524,0.000558909],"about_ca_topic_score_codex":0.0000073338174,"about_ca_topic_score_gemma":0.000025105011,"teacher_disagreement_score":0.7425181,"about_ca_system_score_codex":0.00063940306,"about_ca_system_score_gemma":0.00031437818,"threshold_uncertainty_score":0.99980485},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002147587,0.0001758529,0.98962605,0.0012933421,0.0015053573,0.0005230746,0.0000087966455,0.00008965998,0.0065631024],"genre_scores_gemma":[0.57778674,0.00014286101,0.41830823,0.003205693,0.00041006657,0.000023834125,0.000007353861,0.00003532858,0.00007992108],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555546,0.00008425933,0.0006021329,0.001720161,0.0012751686,0.0007628203],"domain_scores_gemma":[0.99659044,0.0006469457,0.0002688633,0.0022342424,0.0001432038,0.00011630427],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018785339,0.00058449345,0.00050304126,0.00076607784,0.00030586252,0.0005412831,0.00543849,0.00040087124,0.000012694625],"category_scores_gemma":[0.000103161954,0.00039005806,0.0001671319,0.0009043099,0.0007041372,0.000535559,0.00096665975,0.0012724265,0.00008996188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023481423,0.00005930541,0.000006025125,0.0000131134175,0.000003933451,0.000116250616,0.0043112817,0.2413182,0.000005725207,0.12979446,0.0001317053,0.6242165],"study_design_scores_gemma":[0.00015861295,0.00016825285,0.00003683755,0.00019067696,0.0000037721518,0.00007505197,1.9917509e-7,0.48133993,0.000044893877,0.5173732,0.00028153637,0.00032701553],"about_ca_topic_score_codex":0.00002822527,"about_ca_topic_score_gemma":0.0000402057,"teacher_disagreement_score":0.6238895,"about_ca_system_score_codex":0.00029770413,"about_ca_system_score_gemma":0.00038697437,"threshold_uncertainty_score":0.99994254},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009440193,0.00010939786,0.99537796,0.0001272694,0.0021541566,0.0002689719,0.0000071134896,0.00009959121,0.0017611636],"genre_scores_gemma":[0.40470484,0.000031304302,0.59261215,0.0010786746,0.0006676456,0.000010691866,0.00001456002,0.000060427865,0.00081973005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644446,0.000033902827,0.00053744,0.0013057126,0.0011549173,0.0005235685],"domain_scores_gemma":[0.9974045,0.00032048594,0.00040883853,0.0015292238,0.00019625745,0.00014068757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000816351,0.00044452937,0.00055888173,0.00070366164,0.00019658492,0.00031828237,0.0035182603,0.00026507594,0.000013816645],"category_scores_gemma":[0.000068499976,0.0003754022,0.000110422996,0.00041260297,0.0003589895,0.00047548368,0.0019292678,0.00074576674,0.000018494908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000700272,0.00003107545,0.000026292013,0.000096902484,0.000009638137,0.00002616068,0.00045592658,0.17434412,0.00010647203,0.11442549,0.000054443102,0.7104165],"study_design_scores_gemma":[0.00029578255,0.00024007527,0.0000941822,0.0014148213,0.000003782873,0.000023965436,4.711104e-8,0.8445582,0.0010245827,0.15017566,0.0016480532,0.00052086654],"about_ca_topic_score_codex":0.000028083978,"about_ca_topic_score_gemma":0.000011914927,"teacher_disagreement_score":0.7098956,"about_ca_system_score_codex":0.00015101348,"about_ca_system_score_gemma":0.00029558633,"threshold_uncertainty_score":0.99986976},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018143847,0.00087093597,0.99455196,0.00039479355,0.0011362316,0.0005408229,0.0000012710723,0.00010399833,0.0022185596],"genre_scores_gemma":[0.9081573,0.00006795231,0.09075883,0.000615201,0.00022436213,0.000016829445,0.0000062628405,0.000024642046,0.00012865364],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968205,0.000039032075,0.00055618567,0.0013117839,0.0006651492,0.0006073682],"domain_scores_gemma":[0.9985829,0.00015501982,0.0002653392,0.00075944344,0.000101608006,0.00013570188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010460546,0.0004222333,0.00048022435,0.000751629,0.00019045743,0.0006636271,0.0014786433,0.00023926106,0.000020140957],"category_scores_gemma":[0.000020850823,0.0003699989,0.000074371186,0.00052688963,0.00041621964,0.00067836227,0.00077443814,0.0004918679,0.000028214643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030237343,0.00002185902,0.00051016203,0.0000622141,0.000011388666,0.00014249707,0.0016623666,0.0022827177,0.000058290498,0.3171879,0.000009594783,0.67804796],"study_design_scores_gemma":[0.00085593614,0.00031985165,0.0008468858,0.00010675695,0.000010284655,0.0001408014,0.0000012766967,0.026158951,0.00085445517,0.9661411,0.0037301288,0.0008335448],"about_ca_topic_score_codex":0.0003820535,"about_ca_topic_score_gemma":0.0009132977,"teacher_disagreement_score":0.90797585,"about_ca_system_score_codex":0.0002888662,"about_ca_system_score_gemma":0.0004161058,"threshold_uncertainty_score":0.9998752},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018001026,0.000020673711,0.9800841,0.00034599812,0.0001986136,0.00022831057,0.0000014221177,0.0002970854,0.0008227581],"genre_scores_gemma":[0.82938564,0.0000051881316,0.16997778,0.00020519311,0.00011591384,0.000032250282,0.0000025083398,0.000031237712,0.0002442697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974537,0.000019180467,0.00025139342,0.00094906456,0.0008254335,0.0005012172],"domain_scores_gemma":[0.99880624,0.00012394761,0.00016330417,0.0007487949,0.00003280436,0.00012492955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006075537,0.00034573066,0.000248517,0.0002783933,0.00026441683,0.0001007481,0.000984458,0.00027526735,0.00002580273],"category_scores_gemma":[0.000058686153,0.00028948305,0.0000410177,0.000422767,0.0005610074,0.00022350292,0.0007193568,0.0006554513,0.00019946728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068509858,0.000008983811,0.00051210343,0.00000793386,9.4236424e-7,0.0000011564032,0.00012190144,0.53817487,0.004928479,0.000027995722,8.7034044e-7,0.4562079],"study_design_scores_gemma":[0.00018153685,0.00026019503,0.0009497143,0.00021349856,0.000013534763,0.000009606592,5.882301e-7,0.9084058,0.07567661,0.012069705,0.0013975736,0.0008216458],"about_ca_topic_score_codex":0.00013646182,"about_ca_topic_score_gemma":0.00016503305,"teacher_disagreement_score":0.8113846,"about_ca_system_score_codex":0.00073800626,"about_ca_system_score_gemma":0.000047785594,"threshold_uncertainty_score":0.9999557},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021195845,0.0005941147,0.9936719,0.00010757065,0.0022974429,0.0013779732,0.000026246735,0.00015004523,0.0017534933],"genre_scores_gemma":[0.43483487,0.0000037704183,0.56469125,0.00016874945,0.00019513073,0.00004612298,0.00000454328,0.000024893914,0.00003067981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607116,0.00007760127,0.0009003179,0.0013165504,0.0010345234,0.0005998571],"domain_scores_gemma":[0.9951859,0.0012301448,0.0008345011,0.002082572,0.00055644294,0.00011040768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021480399,0.0004954216,0.0008167322,0.0006496035,0.00035110043,0.00024973197,0.0045995107,0.00033729512,0.0000023229086],"category_scores_gemma":[0.00008668512,0.00036686953,0.00024090137,0.00053172914,0.00093226734,0.0003167636,0.0005239183,0.0004851646,0.0000056841136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008809558,0.00007303132,0.0001707728,0.00089972856,0.00009915074,0.000013322317,0.0006344932,0.6772618,0.0004548535,0.14859915,0.000020576495,0.17168503],"study_design_scores_gemma":[0.0007373172,0.000120849756,0.0000169791,0.0005874219,0.00002961246,0.000078661935,5.77186e-7,0.98835474,0.0006868872,0.008790188,0.00022543101,0.00037132067],"about_ca_topic_score_codex":0.000054082135,"about_ca_topic_score_gemma":0.000007150686,"teacher_disagreement_score":0.43481365,"about_ca_system_score_codex":0.0003063214,"about_ca_system_score_gemma":0.0005552439,"threshold_uncertainty_score":0.99987835},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000061212413,0.00009884787,0.98806334,0.0019570682,0.000778663,0.00024562774,0.000013689685,0.0002383484,0.008598273],"genre_scores_gemma":[0.19542533,0.000012997932,0.79586303,0.0067854896,0.00040440072,0.00001438603,0.00010807655,0.00005354094,0.001332733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962615,0.000057884496,0.00039115484,0.0013308037,0.0014592299,0.0004994636],"domain_scores_gemma":[0.9975806,0.0003259929,0.00024680514,0.0012496375,0.00034074808,0.0002562479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007746143,0.00050799304,0.00053790736,0.0012303301,0.00025406992,0.0007399287,0.0023258908,0.00028846678,0.00006418092],"category_scores_gemma":[0.000116604766,0.00044783423,0.00018846829,0.00079886266,0.00059375836,0.00040665455,0.00047933846,0.00076756004,0.00017684804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062307768,0.000047069138,0.000005221779,0.000031537325,0.0000097421425,0.00013957318,0.00018510548,0.30700043,0.000012404681,0.014480762,0.00035809408,0.6777238],"study_design_scores_gemma":[0.0002459474,0.00012973402,0.000046344165,0.00030089307,0.000009391792,0.000015903113,9.762334e-8,0.85589844,0.00020438069,0.14180353,0.0008816196,0.0004637456],"about_ca_topic_score_codex":0.000023072549,"about_ca_topic_score_gemma":0.00010815967,"teacher_disagreement_score":0.6772601,"about_ca_system_score_codex":0.00036140915,"about_ca_system_score_gemma":0.00050680083,"threshold_uncertainty_score":0.99979734},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003659485,0.0071648597,0.801259,0.00027095334,0.0024689941,0.00036728595,0.0000041852277,0.0001874222,0.18824074],"genre_scores_gemma":[0.5413564,0.0005820569,0.425787,0.0006777845,0.0047021946,0.00003834894,0.000020718813,0.0001350796,0.02670041],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563164,0.00008280401,0.0007938111,0.0019184565,0.00078818353,0.00078512926],"domain_scores_gemma":[0.99559253,0.00084507145,0.0004936735,0.002086389,0.0007241089,0.00025822068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009508517,0.0007029725,0.00091108406,0.0011682461,0.00027586415,0.00034501756,0.004870618,0.00050430733,0.00006506169],"category_scores_gemma":[0.00021477438,0.0006161018,0.0003157158,0.0012530576,0.0011224066,0.00071899145,0.0022028922,0.0009388023,0.00018515393],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069434136,0.00012088375,0.00009173086,0.00008043223,0.000022561426,0.000032052052,0.0040783715,0.0013372045,0.00011393303,0.13760717,0.0005002593,0.85600847],"study_design_scores_gemma":[0.0028817942,0.0013306865,0.0057976265,0.0030448043,0.000116643714,0.00076796947,0.0000032238863,0.31003588,0.029542066,0.5374154,0.103793524,0.0052704006],"about_ca_topic_score_codex":0.000018901339,"about_ca_topic_score_gemma":0.00029837037,"teacher_disagreement_score":0.85073805,"about_ca_system_score_codex":0.000335608,"about_ca_system_score_gemma":0.001097641,"threshold_uncertainty_score":0.999629},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014147078,0.0017128946,0.99025226,0.0006237365,0.005464143,0.0011460031,0.00007728654,0.00019896669,0.0005105873],"genre_scores_gemma":[0.32993022,0.00004694521,0.66647387,0.0010325747,0.00070325815,0.00007343197,0.00006581279,0.000060548933,0.0016133696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99469674,0.00006480383,0.0007906611,0.0018964993,0.0018256797,0.00072563067],"domain_scores_gemma":[0.99485457,0.0011310785,0.00051660184,0.0017444583,0.0014065481,0.00034676102],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00307534,0.0005500696,0.0006753382,0.0051014135,0.00034194684,0.0011693313,0.0044142404,0.0005264232,0.000016439899],"category_scores_gemma":[0.00064700324,0.0005031936,0.0001928873,0.004174532,0.0006070278,0.0006009022,0.0007698034,0.00053060043,0.00007243675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003384392,0.00015828239,0.000034458437,0.00032889182,0.000024734834,0.000047915626,0.00053916225,0.020932622,0.0005683992,0.122991495,0.0010481114,0.8532921],"study_design_scores_gemma":[0.00078798423,0.00016509446,0.00008143943,0.00021166442,0.000009718107,0.000026712209,2.279772e-7,0.95591223,0.0005577374,0.026316997,0.015263169,0.0006670359],"about_ca_topic_score_codex":0.00013815248,"about_ca_topic_score_gemma":0.000028191831,"teacher_disagreement_score":0.9349796,"about_ca_system_score_codex":0.0005999331,"about_ca_system_score_gemma":0.0013920637,"threshold_uncertainty_score":0.99986756},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061818055,0.0012209812,0.9940909,0.00074521126,0.001831868,0.0002489234,0.000010650256,0.0001966608,0.0010366197],"genre_scores_gemma":[0.78318727,0.00014535197,0.21529964,0.00070369174,0.00044735163,0.00000747878,0.000008081651,0.000043883185,0.00015725964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964904,0.00008166744,0.0007218699,0.0009564483,0.00090312236,0.000846501],"domain_scores_gemma":[0.9952023,0.0021148373,0.0006054412,0.0017255322,0.00020619047,0.00014566827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00229606,0.00048812307,0.0005370746,0.0004093788,0.00057484716,0.00059149717,0.0049215076,0.00018911739,0.000020412916],"category_scores_gemma":[0.00019138325,0.0003567253,0.00017631607,0.00048458492,0.0024424512,0.00070633786,0.002812053,0.0008323256,0.000025886937],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008015423,0.00003166268,0.00011895512,0.00006099295,0.000019408006,0.000020628986,0.0020042448,0.005243225,0.0001136852,0.10265494,0.000022482001,0.8897018],"study_design_scores_gemma":[0.00017755441,0.00010386629,0.00035449144,0.00054881506,0.0000087091075,0.00005872617,0.000001627086,0.6303831,0.0012323968,0.36582518,0.0008566235,0.00044896637],"about_ca_topic_score_codex":0.00006213517,"about_ca_topic_score_gemma":0.00009730835,"teacher_disagreement_score":0.8892528,"about_ca_system_score_codex":0.00018496852,"about_ca_system_score_gemma":0.00027615792,"threshold_uncertainty_score":0.9998885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006974629,0.00059487927,0.99144495,0.00020480306,0.0019718807,0.002133535,0.000007586335,0.00025132456,0.0033213072],"genre_scores_gemma":[0.021263836,0.000034332887,0.96936005,0.0073195244,0.0011181841,0.00008011004,0.000018526387,0.0000992767,0.00070618367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947214,0.000047055226,0.00082941435,0.0021684477,0.0010557948,0.0011778823],"domain_scores_gemma":[0.99653673,0.00047895886,0.0005571488,0.0020049862,0.00015127349,0.00027089025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021298744,0.0007274901,0.0006550366,0.0014306416,0.00035334172,0.00057685643,0.0047837426,0.0002991131,0.000017305525],"category_scores_gemma":[0.00001085441,0.00074054755,0.00024278295,0.0005344714,0.00043253065,0.0004866112,0.0018561812,0.00051159866,0.000036196117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021595104,0.00003129805,0.000032001506,0.00021235377,0.00006181049,0.000115709496,0.00028675675,0.380755,0.00001766844,0.011504521,0.0000686061,0.60689265],"study_design_scores_gemma":[0.00095395575,0.00010982112,0.000039159302,0.0005052974,0.00004396249,0.0000105687095,5.132805e-7,0.9538158,0.00009597181,0.014010888,0.029696098,0.0007179503],"about_ca_topic_score_codex":0.00003117924,"about_ca_topic_score_gemma":0.00008679648,"teacher_disagreement_score":0.6061747,"about_ca_system_score_codex":0.0012734155,"about_ca_system_score_gemma":0.0002514247,"threshold_uncertainty_score":0.99950457},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011609088,0.0013018408,0.98911786,0.0051123477,0.00093639194,0.00024401204,0.000005460009,0.00027889124,0.0028871014],"genre_scores_gemma":[0.05157803,0.00011617207,0.94734955,0.000719044,0.0000772321,0.0000033211704,0.0000037483555,0.000023740653,0.00012916648],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966733,0.000031415966,0.00052025437,0.0013530691,0.0009065376,0.0005154462],"domain_scores_gemma":[0.99212396,0.00041269028,0.00039953412,0.0066599497,0.0002519942,0.00015185965],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016588754,0.00039465883,0.0005566384,0.0008028772,0.00006847934,0.00023844259,0.03072368,0.00036353755,0.000008110512],"category_scores_gemma":[0.0036650323,0.00035067942,0.00005299339,0.00047101485,0.001340462,0.00092989573,0.09231247,0.00087514735,0.0000118381195],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052880555,0.000018236417,0.00012288478,0.000089498244,0.0000109112625,0.00004178611,0.0006086879,0.00011391719,0.000039638668,0.028582046,0.002214695,0.9681524],"study_design_scores_gemma":[0.00012733616,0.00015047059,0.000030172308,0.00031178127,0.000002764441,0.00005226779,9.792581e-8,0.33439717,0.0005894357,0.66280985,0.0012602423,0.00026842416],"about_ca_topic_score_codex":0.000093650044,"about_ca_topic_score_gemma":0.000027789272,"teacher_disagreement_score":0.967884,"about_ca_system_score_codex":0.00021553038,"about_ca_system_score_gemma":0.00051478564,"threshold_uncertainty_score":0.9998945},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008528892,0.00032473973,0.984296,0.00048241866,0.0005923375,0.00034762977,0.000019739762,0.00012361641,0.013728231],"genre_scores_gemma":[0.3606762,0.00002119606,0.63724583,0.0013060508,0.0003417516,0.000019236406,0.00007031812,0.000025765514,0.0002936413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959203,0.000046114772,0.0007253904,0.0014944247,0.00093386334,0.0008798986],"domain_scores_gemma":[0.99766636,0.00031281303,0.00031085507,0.0014378605,0.00014544243,0.00012665382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080725324,0.0005138463,0.000733041,0.0017984755,0.0002519018,0.0006524469,0.0032481505,0.00034633765,0.000025564561],"category_scores_gemma":[0.000031830703,0.00045263805,0.00025713953,0.0026713845,0.0005536635,0.0011489056,0.0011811574,0.00076013827,0.000027472792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024586725,0.000042770447,0.00024732255,0.000015646989,0.000033715995,0.0001033654,0.0011287641,0.6300698,0.000003017975,0.033831097,0.000100984544,0.33442104],"study_design_scores_gemma":[0.00024377494,0.00008419984,0.00082977413,0.00006124236,0.000026761112,0.000018658777,2.0483414e-7,0.91766787,0.00003408384,0.07936023,0.0011152959,0.0005579274],"about_ca_topic_score_codex":0.00016912953,"about_ca_topic_score_gemma":0.0003936089,"teacher_disagreement_score":0.3605909,"about_ca_system_score_codex":0.00031025562,"about_ca_system_score_gemma":0.00032631506,"threshold_uncertainty_score":0.9997925},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011557005,0.0010474728,0.9882231,0.00018145052,0.0019365726,0.00020727894,0.0000026319115,0.00007359523,0.0071721943],"genre_scores_gemma":[0.9594895,0.00007788415,0.039234024,0.0004464158,0.00026788938,0.0000032904677,8.100494e-7,0.000020763793,0.0004594132],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762744,0.000029872075,0.00056241814,0.00090140937,0.00047562981,0.00040325895],"domain_scores_gemma":[0.99820805,0.0002830834,0.00034964088,0.0008803431,0.0001570222,0.00012187559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006543081,0.00036389122,0.00059999357,0.0006405603,0.00014417371,0.00022634838,0.0017951385,0.00026980776,0.000017293287],"category_scores_gemma":[0.000022878741,0.0003097804,0.000102508464,0.00029595068,0.0006658064,0.00043361948,0.0009562766,0.00041614813,0.000007944201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001209803,0.00002919929,0.0006134754,0.00009342953,0.000026829874,0.00004063762,0.0028652824,0.00090077944,0.00034465766,0.27707353,0.00005624667,0.71794385],"study_design_scores_gemma":[0.0007197705,0.0010567831,0.0011460582,0.0024372854,0.000029394227,0.0006039687,0.0000014650718,0.42981553,0.0135806985,0.54433423,0.0043946663,0.001880135],"about_ca_topic_score_codex":0.00019511912,"about_ca_topic_score_gemma":0.00013138144,"teacher_disagreement_score":0.9583338,"about_ca_system_score_codex":0.000072775816,"about_ca_system_score_gemma":0.00013617567,"threshold_uncertainty_score":0.99993545},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010601302,0.0032821023,0.9846542,0.00007819405,0.000352422,0.00041641344,0.000021626773,0.000011242295,0.00058248447],"genre_scores_gemma":[0.9479965,0.00015369548,0.05028735,0.00051905256,0.0006072954,0.000011412307,0.00006763815,0.000046335586,0.00031071244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983198,0.000021709633,0.00032182605,0.0005827623,0.00037721774,0.00037670162],"domain_scores_gemma":[0.9988208,0.000026787162,0.00018280894,0.000745367,0.00015120626,0.000073062554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036563413,0.00031259927,0.00027419886,0.00009617292,0.00012583162,0.000046329475,0.00087876804,0.000400178,0.000010411842],"category_scores_gemma":[0.00003623684,0.00022336334,0.00010669438,0.00011871774,0.000491614,0.000009756906,0.00045348177,0.00038417935,0.0000026731554],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113485476,0.000051577845,0.00007983881,0.00012742874,0.00009037674,0.0000067530855,0.00035511208,0.06955177,0.34308666,0.0019382151,0.00004915499,0.5845496],"study_design_scores_gemma":[0.00065380015,0.0002949072,0.000013977762,0.00035357816,0.00005928551,0.00006836458,7.9274747e-7,0.5813412,0.37798682,0.034311596,0.0037873038,0.0011283681],"about_ca_topic_score_codex":0.000024772846,"about_ca_topic_score_gemma":0.000020775586,"teacher_disagreement_score":0.9373952,"about_ca_system_score_codex":0.00003592697,"about_ca_system_score_gemma":0.00019277881,"threshold_uncertainty_score":0.9108493},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014352513,0.0006146295,0.99265516,0.00034781278,0.0015399687,0.00028465345,0.000008971579,0.00011671532,0.0029968112],"genre_scores_gemma":[0.50431025,0.00002946332,0.49381,0.0007997213,0.0003972272,0.000009929271,0.000044577173,0.000036411522,0.000562398],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964695,0.000040492076,0.00064028933,0.0012076783,0.0011838258,0.00045820585],"domain_scores_gemma":[0.99705994,0.00046067126,0.00040906094,0.0009137013,0.00094757,0.00020907227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010702347,0.0004408284,0.0005317171,0.0013395319,0.0001592282,0.0002408677,0.0023014366,0.00027457703,0.000030411053],"category_scores_gemma":[0.0001826808,0.00041999784,0.00016169055,0.0013068161,0.0004766931,0.00047169536,0.00090360036,0.00050587865,0.000017438968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000151250315,0.000061933955,0.000084709245,0.00005320249,0.000028943881,0.000057559835,0.00076762115,0.17244238,0.00085786474,0.22650833,0.00010410143,0.5990182],"study_design_scores_gemma":[0.0003863535,0.0002555896,0.00024864203,0.00023993423,0.000011811098,0.00008579806,1.3975766e-7,0.42832878,0.0026243846,0.565743,0.00146833,0.0006072026],"about_ca_topic_score_codex":0.000014262351,"about_ca_topic_score_gemma":0.00006318643,"teacher_disagreement_score":0.598411,"about_ca_system_score_codex":0.00015914108,"about_ca_system_score_gemma":0.0012151574,"threshold_uncertainty_score":0.9998252},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013218676,0.0011169636,0.99365354,0.00020008394,0.0033525561,0.0006069618,0.00008509827,0.00020803788,0.00064459053],"genre_scores_gemma":[0.91296035,0.00005655191,0.085876405,0.00010237599,0.00033234622,0.0000129706505,0.0000947858,0.0000367838,0.0005274547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542236,0.000088592606,0.0010494837,0.0014385093,0.0013138717,0.00068718346],"domain_scores_gemma":[0.9963364,0.0004056081,0.00091723347,0.0014239929,0.000711048,0.00020571766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085959514,0.0006072249,0.0008974038,0.00075712265,0.0002662452,0.0003589455,0.0035974348,0.00040591077,0.000003308081],"category_scores_gemma":[0.00011925216,0.0005654547,0.00020714896,0.0009153108,0.00059840444,0.00041245946,0.0010334331,0.0006081317,0.00004835618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013824388,0.00022274448,0.0004886836,0.00041075968,0.00008977303,0.0003949234,0.0017192677,0.86017996,0.00032376856,0.02442253,0.0010140456,0.11071971],"study_design_scores_gemma":[0.00054751063,0.00017362282,0.0004877275,0.00086158403,0.000009940145,0.00019567205,3.446003e-7,0.98870516,0.0002335083,0.0016787738,0.006389902,0.0007162332],"about_ca_topic_score_codex":0.00007231756,"about_ca_topic_score_gemma":0.000010768526,"teacher_disagreement_score":0.91282815,"about_ca_system_score_codex":0.00043968382,"about_ca_system_score_gemma":0.00064766983,"threshold_uncertainty_score":0.9996797},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029298172,0.0011510422,0.9952487,0.000027807992,0.00023833037,0.00020177287,0.000009826553,0.000055585944,0.00013711407],"genre_scores_gemma":[0.9579198,0.000037486196,0.04174292,0.00014803138,0.00010700595,0.0000035347439,0.0000042402485,0.000023304054,0.000013726714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984975,0.000018317123,0.00028108433,0.00041312366,0.0004028448,0.00038716628],"domain_scores_gemma":[0.9988978,0.0004601699,0.00008877968,0.00038894592,0.00004762977,0.000116700685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002538582,0.00032392947,0.000554677,0.0005735675,0.000053976833,0.000052935946,0.0004151472,0.00020818078,0.000070253234],"category_scores_gemma":[0.00003342023,0.00026710978,0.00013396206,0.0006133239,0.00022586112,0.0000843851,0.00004007779,0.0003848107,0.0000024921137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011967639,0.0000050906388,0.00022373513,0.000016053988,0.000085592845,0.0000032174619,0.000051131698,0.50598335,0.00046283109,0.00012461825,0.0000016264042,0.4930308],"study_design_scores_gemma":[0.0001551364,0.00013058593,0.0011618102,0.00004324391,0.00015172418,0.0000016608659,3.315507e-8,0.99660826,0.00049892475,0.0009383926,0.000035145782,0.00027510084],"about_ca_topic_score_codex":0.0000067274455,"about_ca_topic_score_gemma":0.000004881392,"teacher_disagreement_score":0.9549899,"about_ca_system_score_codex":0.0001707054,"about_ca_system_score_gemma":0.00009144378,"threshold_uncertainty_score":0.9999781},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002977277,0.00027403733,0.99450123,0.0005490089,0.0008043232,0.0005016933,0.000015760068,0.00007411399,0.00030256395],"genre_scores_gemma":[0.8914431,0.00001285961,0.107118286,0.0008888548,0.0003865783,0.000006293565,0.000007989344,0.000022145674,0.0001139056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99523836,0.0002967787,0.00095844077,0.0015058033,0.0014372211,0.0005633668],"domain_scores_gemma":[0.9950196,0.0014477479,0.0009801096,0.0017662883,0.00064277963,0.00014348558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003580705,0.0005472969,0.0009916215,0.0011607943,0.0003035766,0.00037910714,0.0031565672,0.00036733563,0.000008383419],"category_scores_gemma":[0.000257728,0.0003870545,0.00041852257,0.0021549028,0.00092263974,0.0006071793,0.00075743755,0.00091929577,0.000007890041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012414522,0.00006054738,0.00010846688,0.00006340748,0.00021892623,0.000026278642,0.024918277,0.03358088,0.00129613,0.006741685,0.0000021750564,0.9329708],"study_design_scores_gemma":[0.00061075186,0.00061276276,0.0030408937,0.0007694735,0.00041521064,0.00009677818,0.00002637608,0.9279672,0.0039962735,0.06033676,0.00026972147,0.0018577757],"about_ca_topic_score_codex":0.00011689091,"about_ca_topic_score_gemma":0.0001276839,"teacher_disagreement_score":0.931113,"about_ca_system_score_codex":0.00032195987,"about_ca_system_score_gemma":0.00059892854,"threshold_uncertainty_score":0.99985814},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004769366,0.010988979,0.9835997,0.00040862773,0.0015958499,0.0005052224,0.000003537435,0.0005085267,0.0019125926],"genre_scores_gemma":[0.35198206,0.00016698467,0.6451924,0.0016447591,0.00024172073,0.000012374037,0.000008882732,0.000039077004,0.00071178057],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953377,0.000047978523,0.0006339661,0.001716348,0.0013964823,0.00086750917],"domain_scores_gemma":[0.99767107,0.00016450783,0.0003341189,0.0015177062,0.00017301487,0.0001395648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007791619,0.000614248,0.0005876581,0.0012679109,0.00019415065,0.00031796098,0.005050409,0.00036443782,0.000015157531],"category_scores_gemma":[0.0001548978,0.00055428175,0.000120094744,0.00094641454,0.00055340707,0.0013595906,0.0023233364,0.0014735225,0.000033446762],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009626896,0.000050282393,0.00016212018,0.00005968523,0.000009459343,0.0011963885,0.0023484137,0.00027222297,0.0009087746,0.0025337965,0.0001359727,0.99231327],"study_design_scores_gemma":[0.0028731283,0.0007081287,0.001179056,0.0056652287,0.00002596338,0.0011655376,0.0000015145143,0.33971807,0.06113643,0.57692,0.0041347803,0.006472181],"about_ca_topic_score_codex":0.00016643165,"about_ca_topic_score_gemma":0.0002556556,"teacher_disagreement_score":0.9858411,"about_ca_system_score_codex":0.00078276615,"about_ca_system_score_gemma":0.0004623115,"threshold_uncertainty_score":0.9996909},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008646755,0.00016844971,0.9931704,0.00034509454,0.0010389088,0.00042280133,0.000018785999,0.00013525669,0.0038356446],"genre_scores_gemma":[0.34879926,0.000025545252,0.64888316,0.00094064896,0.000260298,0.000011696289,0.000011428511,0.000040755258,0.0010271907],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620306,0.00004177872,0.0008025699,0.0012343692,0.0011479165,0.00057030754],"domain_scores_gemma":[0.9970118,0.00037617097,0.0006127882,0.0014853611,0.00034986576,0.00016402944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009344585,0.0004659643,0.00066241284,0.00059193757,0.00015219713,0.0002918988,0.003350969,0.00018849153,0.0001414524],"category_scores_gemma":[0.00008384261,0.0004004685,0.00015385404,0.0004055018,0.0020505611,0.0005513236,0.0013876554,0.00051620096,0.00010411099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006824664,0.000066860935,0.000038707294,0.00012816211,0.000019497533,0.000118558506,0.0005286319,0.003412406,0.0008705317,0.22021951,0.00006301117,0.7745273],"study_design_scores_gemma":[0.00015018854,0.00013631841,0.0004097869,0.0002884954,0.000004491521,0.00009551097,6.552498e-8,0.2955319,0.0021875696,0.7004307,0.00033905235,0.00042593887],"about_ca_topic_score_codex":0.000030892603,"about_ca_topic_score_gemma":0.000014811063,"teacher_disagreement_score":0.7741014,"about_ca_system_score_codex":0.0001516946,"about_ca_system_score_gemma":0.0006278093,"threshold_uncertainty_score":0.99984473},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039941333,0.00067176175,0.95612043,0.004212639,0.0013798778,0.00046680967,0.0000013722894,0.0002319145,0.03687523],"genre_scores_gemma":[0.83829194,0.0019697044,0.15461771,0.0017435405,0.00077018194,0.000028612863,0.0000055068444,0.000043392287,0.0025294386],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99784297,0.00010825359,0.00034427026,0.0006398683,0.00062027987,0.0004443888],"domain_scores_gemma":[0.9976916,0.0008950849,0.00025445,0.0008206682,0.00021678588,0.000121447825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008774354,0.0002632176,0.00034428563,0.0006346541,0.0006649789,0.00013097122,0.0019289358,0.00049985206,0.00023871349],"category_scores_gemma":[0.000383452,0.00026111235,0.00009228108,0.00037633834,0.002295723,0.00028595698,0.0004060286,0.0009265392,0.00019331613],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001024264,0.000016186632,0.000017836514,0.0000031910997,0.0000071398804,0.000015914396,0.0068020592,0.0009617567,0.000026977043,0.010300456,0.00032738983,0.9815109],"study_design_scores_gemma":[0.0011018328,0.0003155153,0.000107110565,0.000697898,0.000029307967,0.000100436264,0.000031565934,0.11862599,0.0032544432,0.19259773,0.6812232,0.0019149772],"about_ca_topic_score_codex":0.00068307086,"about_ca_topic_score_gemma":0.0039557,"teacher_disagreement_score":0.9795959,"about_ca_system_score_codex":0.00069298106,"about_ca_system_score_gemma":0.0010237177,"threshold_uncertainty_score":0.9999841},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012835216,0.0026352217,0.9861042,0.0019630021,0.0027664367,0.00034862393,0.0000047349395,0.00017995248,0.005869506],"genre_scores_gemma":[0.15135807,0.0001183474,0.83800024,0.0026432062,0.0025817049,0.000017787936,0.000017187103,0.000052829233,0.005210622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962684,0.000047105837,0.0004167952,0.0013297999,0.0012011268,0.0007367672],"domain_scores_gemma":[0.99689174,0.0010168311,0.0002733245,0.0012475449,0.00032057406,0.00024996445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009432514,0.0005348279,0.00045762915,0.0006210531,0.00033287387,0.00065071444,0.0030581376,0.00038371567,0.000078679645],"category_scores_gemma":[0.00022474406,0.0004982828,0.00015631196,0.0008265603,0.00028344206,0.0011947011,0.0016581428,0.00077862944,0.00007999249],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008306579,0.000054289434,0.000073513766,0.00007098103,0.000024753572,0.000049134425,0.0010055952,0.052147824,0.0007839126,0.034082472,0.000694313,0.9110049],"study_design_scores_gemma":[0.00053868565,0.00022941353,0.0012154899,0.0005089455,0.000026509408,0.00020548906,2.5651985e-7,0.68035334,0.004723754,0.27210993,0.03839174,0.0016964645],"about_ca_topic_score_codex":0.000007130476,"about_ca_topic_score_gemma":0.00002923647,"teacher_disagreement_score":0.90930843,"about_ca_system_score_codex":0.0002304353,"about_ca_system_score_gemma":0.0005210587,"threshold_uncertainty_score":0.99974686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014653157,0.001994055,0.98476154,0.00020950902,0.0010880966,0.00027336698,0.000028893111,0.000008039845,0.010171194],"genre_scores_gemma":[0.40299764,0.001249261,0.58929497,0.0025194096,0.002491129,0.000024296683,0.00003617997,0.00010267331,0.001284406],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979739,0.000018370452,0.00027853422,0.0009948579,0.0002873443,0.00044696569],"domain_scores_gemma":[0.9988577,0.000033965414,0.00013988429,0.00067138125,0.00017667803,0.00012044123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032099558,0.00038601583,0.00032763858,0.00014327581,0.00012264344,0.00005894924,0.00062164274,0.00037447605,0.000029412713],"category_scores_gemma":[0.000072029994,0.00034664344,0.00012916073,0.00008484361,0.00067782553,0.0000017242613,0.0008619951,0.00032402115,0.00002424729],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002793313,0.000054115073,0.000114604765,0.000021665077,0.00008552075,0.00006458778,0.00023651692,0.00048669794,0.020230366,0.0013302492,0.00013159138,0.9772161],"study_design_scores_gemma":[0.0025909839,0.005303739,0.006660703,0.00045593243,0.00027670065,0.0012882778,0.000002797914,0.017146284,0.20858955,0.4674026,0.28371173,0.006570683],"about_ca_topic_score_codex":0.000026294536,"about_ca_topic_score_gemma":0.0000554751,"teacher_disagreement_score":0.9706455,"about_ca_system_score_codex":0.00004173836,"about_ca_system_score_gemma":0.0004646666,"threshold_uncertainty_score":0.99989855},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055541424,0.00019531357,0.9953642,0.00047663943,0.0014800921,0.0006974625,0.000056732573,0.00036939466,0.0008047425],"genre_scores_gemma":[0.19556431,0.0000793219,0.80085725,0.0021405406,0.000957093,0.00004214764,0.00010227411,0.00007856472,0.00017850974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99433345,0.0001054545,0.0006267053,0.002493931,0.0015529048,0.00088758086],"domain_scores_gemma":[0.99612933,0.0004689049,0.00045841598,0.0021276826,0.00048459342,0.0003310702],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011281689,0.00084371696,0.0006798835,0.001131919,0.00047123793,0.0013137552,0.0029816611,0.00056282553,0.00006149401],"category_scores_gemma":[0.00009667796,0.0007034454,0.00021425688,0.0011116819,0.0010517124,0.0017494934,0.0013254753,0.0014891197,0.000053597916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029840096,0.0006729395,0.009304882,0.0006958757,0.00022292683,0.0006229453,0.010939714,0.01672077,0.00042296405,0.5459024,0.0010164202,0.41317979],"study_design_scores_gemma":[0.0016668149,0.00095402333,0.0023378918,0.0013766977,0.000047818725,0.00038537933,0.0000011698392,0.7491096,0.0009704236,0.20673494,0.033518374,0.00289682],"about_ca_topic_score_codex":0.000073257506,"about_ca_topic_score_gemma":0.0006996134,"teacher_disagreement_score":0.73238885,"about_ca_system_score_codex":0.00022350541,"about_ca_system_score_gemma":0.00047639065,"threshold_uncertainty_score":0.99972296},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014819426,0.00045834968,0.9923014,0.0012680896,0.00095936086,0.0010292134,0.00024561078,0.000043084267,0.003546695],"genre_scores_gemma":[0.07970971,0.000080182195,0.8826861,0.030504517,0.0047103427,0.00092418364,0.0001169298,0.00019380971,0.0010742453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976897,8.933281e-7,0.0005786584,0.001140022,0.00011428533,0.00047642537],"domain_scores_gemma":[0.99856657,0.00016557454,0.00046323566,0.00061602925,0.00007602987,0.0001125614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027544374,0.00039280028,0.00055600173,0.00048416274,0.0002278182,0.00017991032,0.001015846,0.00030462365,0.000027654312],"category_scores_gemma":[0.00008723526,0.00039539908,0.00014036249,0.00027486542,0.0002700744,0.00010156215,0.0002505466,0.00041668088,0.00018154047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011849392,0.000044654425,0.00000831914,0.00009345505,0.0000067189803,8.4834846e-7,0.00023594667,0.0027065505,0.00001532559,0.9615044,0.000021967458,0.035349976],"study_design_scores_gemma":[0.0003325744,0.00020037054,0.00016415161,0.00018877229,0.000004302896,0.0000054118536,5.728679e-8,0.019960422,0.000059428618,0.92832226,0.050324075,0.00043820066],"about_ca_topic_score_codex":0.000044880944,"about_ca_topic_score_gemma":0.00007343503,"teacher_disagreement_score":0.10961532,"about_ca_system_score_codex":0.0001891337,"about_ca_system_score_gemma":0.00012089414,"threshold_uncertainty_score":0.9998498},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004370614,0.00011552603,0.9869038,0.0015332964,0.0014415957,0.00044799727,0.0000038007217,0.00035020764,0.008766711],"genre_scores_gemma":[0.026966115,0.000018836408,0.9585049,0.0035970183,0.0008947181,0.00003247514,0.00001275621,0.000068460664,0.009904704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964088,0.00008317037,0.00040700953,0.0017369905,0.0006001096,0.0007638801],"domain_scores_gemma":[0.997271,0.00054828514,0.00022086965,0.0012274272,0.0004263314,0.00030606263],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005300447,0.0005649981,0.0005251207,0.000949662,0.00027846155,0.0008577663,0.0024016274,0.00029438297,0.00010303602],"category_scores_gemma":[0.00011672331,0.0004590141,0.00008357096,0.0007411039,0.00041073433,0.00083938136,0.001228947,0.001123161,0.0010505652],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006318553,0.000027045024,0.000049760998,0.000022852788,0.000009305152,0.000047089652,0.001055848,0.0067739175,0.000027327542,0.001985064,0.000108544875,0.98988694],"study_design_scores_gemma":[0.0006638907,0.001883158,0.00062350795,0.0012156018,0.000023487763,0.0005095952,9.1334624e-7,0.90877545,0.0006047033,0.040368505,0.043086227,0.0022449768],"about_ca_topic_score_codex":0.00019443929,"about_ca_topic_score_gemma":0.00029073146,"teacher_disagreement_score":0.98764193,"about_ca_system_score_codex":0.00017587256,"about_ca_system_score_gemma":0.0003558253,"threshold_uncertainty_score":0.99978614},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39742476,0.000009459647,0.6020365,0.0003201323,0.000024194951,0.0001445478,0.0000014316446,0.000025994286,0.000012986851],"genre_scores_gemma":[0.69384557,0.0000060498774,0.3056015,0.00051679416,0.00001674168,0.0000082128945,9.88587e-7,0.0000029817018,0.000001138759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992961,0.0000060343773,0.00013322999,0.0002900579,0.00013357698,0.00014099038],"domain_scores_gemma":[0.9993827,0.00012289826,0.00005575028,0.00032786277,0.00007380897,0.000037007663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008685277,0.000072779396,0.00016937812,0.00021046987,0.000055125314,0.000006989197,0.00019736942,0.000033073742,0.000011449895],"category_scores_gemma":[0.000059183058,0.000054614688,0.00006081941,0.0009095125,0.00013032752,0.00003918065,0.000058094884,0.00008281944,4.9196126e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002234816,0.00081670826,0.33399853,0.00012400525,0.00006309849,0.000016177011,0.0023578021,0.0192854,0.073148526,0.002747114,0.000040224495,0.5671789],"study_design_scores_gemma":[0.00034381283,0.00070449326,0.15852015,0.00005420333,0.00006982157,0.0000045902066,9.885475e-7,0.69888854,0.12892723,0.01231398,0.00005460102,0.0001176079],"about_ca_topic_score_codex":0.000020837842,"about_ca_topic_score_gemma":0.000008300327,"teacher_disagreement_score":0.67960316,"about_ca_system_score_codex":0.000016618676,"about_ca_system_score_gemma":0.000022507045,"threshold_uncertainty_score":0.22271223},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020298662,0.00044046374,0.9903435,0.0012670236,0.0012666992,0.0004943525,0.000018352664,0.00008525483,0.0040544574],"genre_scores_gemma":[0.976714,0.00010619249,0.020323548,0.0024749157,0.0003082003,0.000014077254,0.000006757209,0.000026391841,0.000025929694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663675,0.000063686,0.0005875725,0.0009348361,0.0010953988,0.00068177714],"domain_scores_gemma":[0.9965467,0.0010220639,0.00041101858,0.0016316924,0.00024451458,0.0001440343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014454412,0.0004592698,0.00045515108,0.00069042615,0.00039429858,0.00025777935,0.0032042905,0.00021643109,0.000036569156],"category_scores_gemma":[0.000094277326,0.00033717233,0.00021379601,0.0007777723,0.00083759666,0.00039827422,0.0011467146,0.00082783494,0.00002344733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008633109,0.00014019407,0.00008165501,0.00006731294,0.000036597357,0.000024533163,0.007711027,0.004013061,0.00014005788,0.6415592,0.00020393508,0.3460138],"study_design_scores_gemma":[0.00041331752,0.00030523847,0.00030872438,0.00047111546,0.000018282422,0.000026958014,0.0000031948894,0.17125738,0.0033334908,0.8193954,0.0034914275,0.00097542594],"about_ca_topic_score_codex":0.000034523582,"about_ca_topic_score_gemma":0.00013240169,"teacher_disagreement_score":0.9746841,"about_ca_system_score_codex":0.00012132281,"about_ca_system_score_gemma":0.00024302484,"threshold_uncertainty_score":0.99990803},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006091339,0.00045834194,0.9939894,0.00084656314,0.0030679228,0.00031707215,0.00006746308,0.00036184883,0.00088530517],"genre_scores_gemma":[0.00053290924,0.0002601578,0.9909501,0.0014870762,0.0014098494,0.000008994099,0.00027222722,0.00005835769,0.0050203414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951378,0.000043251814,0.00039837646,0.0026014433,0.0010753752,0.0007437619],"domain_scores_gemma":[0.9952762,0.00041465767,0.00018968133,0.0038631249,0.000084737505,0.00017159035],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013101458,0.00048225286,0.0004604938,0.00092828635,0.00026883942,0.0017797675,0.011321024,0.00020472502,0.000006236535],"category_scores_gemma":[0.00014026543,0.000424645,0.00004097706,0.0014706093,0.00066472666,0.0019285401,0.015378748,0.0006551282,0.0000590917],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.5535905e-7,0.000008874827,0.00001924687,0.000047102752,0.000012784667,0.00013863001,0.00015914053,0.00080365746,0.0000044110884,0.0042018015,0.0028107776,0.9917928],"study_design_scores_gemma":[0.00019937611,0.000059942355,0.000381563,0.00013322971,0.000009770234,0.00003278358,1.7203868e-7,0.76861864,0.000040425643,0.21956445,0.010379547,0.00058008963],"about_ca_topic_score_codex":0.000026549409,"about_ca_topic_score_gemma":0.00006030609,"teacher_disagreement_score":0.9912127,"about_ca_system_score_codex":0.00012847997,"about_ca_system_score_gemma":0.00054818776,"threshold_uncertainty_score":0.99982053},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027014493,0.00021041196,0.99667835,0.000088945184,0.00069479767,0.00042962015,0.000014933937,0.0005493658,0.0010634356],"genre_scores_gemma":[0.07906751,0.000091493326,0.91962415,0.00095518754,0.0001321544,0.000006922335,0.0000031494362,0.000047756388,0.00007167727],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957418,0.000023216144,0.0007736313,0.0016309114,0.0011457196,0.00068476313],"domain_scores_gemma":[0.9959212,0.00042567996,0.0006344261,0.0022436574,0.000557318,0.00021771048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076541153,0.00060801464,0.00060569315,0.0016144002,0.000184679,0.00037983732,0.003178413,0.00046967194,0.00004989221],"category_scores_gemma":[0.0000710315,0.0005697111,0.00022132495,0.00095503376,0.0009458938,0.0019143529,0.0008222368,0.0009056798,0.000013770108],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000139579515,0.00006124756,0.000046973513,0.00004999557,0.000013715037,0.000080549,0.00049173995,0.0031282788,0.0009804958,0.01445256,0.000013908847,0.9806666],"study_design_scores_gemma":[0.0005199184,0.0011207837,0.0036900574,0.0010772998,0.000021961325,0.0001961906,5.613297e-7,0.14771172,0.1831334,0.6508311,0.009351833,0.0023451676],"about_ca_topic_score_codex":0.000060142585,"about_ca_topic_score_gemma":0.000079394056,"teacher_disagreement_score":0.97832143,"about_ca_system_score_codex":0.00016469136,"about_ca_system_score_gemma":0.00024004409,"threshold_uncertainty_score":0.99967545},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077154464,0.00051365566,0.9913925,0.00112943,0.0018726452,0.00037103746,0.000010281426,0.00037483155,0.003564067],"genre_scores_gemma":[0.18202604,0.000008290063,0.81536627,0.0011904076,0.0009317822,0.0000077254845,0.0000136966855,0.000087924265,0.0003678524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946477,0.000056203913,0.00058537786,0.0020956,0.0015302779,0.0010848396],"domain_scores_gemma":[0.9965534,0.00046407417,0.00044326554,0.0017082131,0.0004336178,0.00039740308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010622381,0.00082731305,0.00078725425,0.0009202385,0.00035023718,0.00081156124,0.0036879848,0.0003241359,0.000016844966],"category_scores_gemma":[0.00008581063,0.00064952904,0.00013745477,0.00089175085,0.0012930855,0.00049969775,0.0016548961,0.001426958,0.00005429639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015464479,0.000025404599,0.00016430809,0.000056138117,0.00002486105,0.0004561046,0.0012198454,0.123603046,0.000018130264,0.02753614,0.000084615116,0.8467959],"study_design_scores_gemma":[0.00048363578,0.00040454522,0.000031975596,0.00057633384,0.0000101548885,0.0006985292,9.599078e-7,0.9149971,0.00012139628,0.08019399,0.0015363916,0.0009450024],"about_ca_topic_score_codex":0.000033908873,"about_ca_topic_score_gemma":0.00006772178,"teacher_disagreement_score":0.84585094,"about_ca_system_score_codex":0.0003975479,"about_ca_system_score_gemma":0.0011227627,"threshold_uncertainty_score":0.9995956},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034069566,0.00038699806,0.99547124,0.00070132344,0.001337208,0.00025031745,0.000003839865,0.00020774247,0.001607282],"genre_scores_gemma":[0.02683176,0.000023874489,0.97230417,0.00046577505,0.0001345795,0.0000069925572,7.7163384e-7,0.000028157034,0.00020393335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971266,0.00006656921,0.00039437122,0.0009307471,0.0010386939,0.000443019],"domain_scores_gemma":[0.99212015,0.0042987084,0.00024736955,0.002944461,0.0002924208,0.00009691145],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001927912,0.00040036123,0.0004708214,0.00044277258,0.0000963479,0.00011451647,0.0067454893,0.00022372614,0.000004619102],"category_scores_gemma":[0.0023852855,0.00027600987,0.00010043708,0.00047833586,0.00071729725,0.00042105335,0.0023027242,0.0008103346,0.000012667761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031097563,0.000006278573,3.337678e-7,0.0000077817795,0.000004080615,0.00001271334,0.00048370293,0.7245689,0.000026325728,0.1854637,0.00005561175,0.08936748],"study_design_scores_gemma":[0.00006892709,0.000118012125,0.0000024972398,0.00019228757,0.000002029166,0.000011961806,8.749757e-8,0.26482534,0.00080828223,0.7336059,0.00013569389,0.00022895382],"about_ca_topic_score_codex":0.0000050505114,"about_ca_topic_score_gemma":0.000002802074,"teacher_disagreement_score":0.5481422,"about_ca_system_score_codex":0.0002194915,"about_ca_system_score_gemma":0.00038205023,"threshold_uncertainty_score":0.9999692},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000069326146,0.0011710364,0.9930518,0.0022383307,0.0020064674,0.0007847356,0.00006449499,0.00010136242,0.00051243807],"genre_scores_gemma":[0.039334804,0.000022007504,0.95886445,0.0006600596,0.00087816006,0.000014811606,0.000008540481,0.000038948685,0.00017819818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964697,0.00005707051,0.0006340974,0.0010900402,0.0011603917,0.00058872154],"domain_scores_gemma":[0.99604225,0.0011989711,0.0005546227,0.001322398,0.0007176278,0.0001641305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018721232,0.0004678157,0.0006682083,0.0004347867,0.0002850898,0.00033954167,0.003937031,0.00019514366,0.000005305369],"category_scores_gemma":[0.00021976409,0.00034643157,0.00021227381,0.00057613227,0.00074117107,0.00032016417,0.001947278,0.00043396835,0.000004765763],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009169432,0.000016703147,0.0000066287107,0.000033608478,0.00002123813,0.000008742185,0.0012266175,0.012367093,0.000024023755,0.02269621,0.00031077737,0.9632792],"study_design_scores_gemma":[0.00054355455,0.00031573724,0.000027943743,0.00026843374,0.000014592561,0.000028831524,8.05602e-7,0.75618565,0.0010517067,0.23734221,0.0038337747,0.0003867818],"about_ca_topic_score_codex":0.00005774179,"about_ca_topic_score_gemma":0.00008454041,"teacher_disagreement_score":0.9628924,"about_ca_system_score_codex":0.0003030495,"about_ca_system_score_gemma":0.0009654242,"threshold_uncertainty_score":0.9998988},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002195583,0.0004540978,0.9975282,0.00021019648,0.00036709578,0.0005322918,0.0000014768415,0.00018119843,0.0005058845],"genre_scores_gemma":[0.37638962,0.0001822538,0.6210853,0.001909284,0.00019217165,0.00002127249,0.000007843387,0.000042109037,0.00017015952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971499,0.00005210218,0.00048524194,0.0012093054,0.0006634635,0.00043998883],"domain_scores_gemma":[0.99846,0.0003251227,0.00024595138,0.0006931703,0.00017335037,0.000102380945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008581047,0.00038668592,0.0004146745,0.0008830222,0.00015096515,0.00033375892,0.0010739355,0.00022428729,0.0000051486486],"category_scores_gemma":[0.0001370276,0.00036018848,0.000049218448,0.0007529769,0.00037080605,0.00031095103,0.00069604866,0.00045408768,0.000010033872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007993305,0.000021388143,0.00013331167,0.000054627253,0.0000032181226,0.00003441622,0.00059200474,0.052887656,0.0011011917,0.00977938,0.0000082664465,0.9353765],"study_design_scores_gemma":[0.00032283008,0.00021765796,0.00015895817,0.00046392204,0.0000044399003,0.000031148098,2.2249773e-7,0.9149336,0.01857691,0.0642871,0.00048537465,0.0005178151],"about_ca_topic_score_codex":0.000021214244,"about_ca_topic_score_gemma":0.000049742408,"teacher_disagreement_score":0.93485874,"about_ca_system_score_codex":0.0002958022,"about_ca_system_score_gemma":0.00018528764,"threshold_uncertainty_score":0.999885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046598534,0.0009019047,0.99240375,0.00027740677,0.0009139023,0.0004070968,0.0000035160276,0.00012781502,0.0003047866],"genre_scores_gemma":[0.32716033,0.000017408438,0.6716866,0.0004994489,0.0004306689,0.0000034996133,0.0000013245826,0.000027597795,0.00017310299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969811,0.000025484396,0.0003493769,0.0014736498,0.00058513,0.0005852944],"domain_scores_gemma":[0.99788845,0.0005051249,0.00026852926,0.0010364699,0.00015041848,0.00015099875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078687276,0.00042183336,0.0004909819,0.000453621,0.00036278454,0.0004641676,0.0015802636,0.00026030125,0.000002636895],"category_scores_gemma":[0.000060805425,0.00039799183,0.00009747536,0.00020936033,0.000268426,0.00045481225,0.0017653704,0.0003523266,0.0000034908094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014387086,0.000012998572,0.00013495532,0.0002847628,0.00002187462,0.00006902533,0.0039084023,0.4568029,0.0021410284,0.10835126,0.000012150591,0.42824626],"study_design_scores_gemma":[0.00017949894,0.00004207196,0.000014509025,0.00024459904,0.000010652046,0.00007639172,2.2003515e-7,0.928688,0.0013310958,0.068866655,0.000121360936,0.0004249424],"about_ca_topic_score_codex":0.000066262306,"about_ca_topic_score_gemma":0.00012693983,"teacher_disagreement_score":0.47188511,"about_ca_system_score_codex":0.0003327118,"about_ca_system_score_gemma":0.00018616255,"threshold_uncertainty_score":0.9998472},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002918156,0.00038164074,0.99472016,0.00021512281,0.0014510832,0.00055966823,0.000040242823,0.0001401759,0.0024627286],"genre_scores_gemma":[0.024592048,0.000057460442,0.97285706,0.00034450984,0.0006044169,0.000028867706,0.0000044873786,0.00003964042,0.0014715169],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969997,0.000039173046,0.00056669634,0.001186162,0.00067187496,0.00053643103],"domain_scores_gemma":[0.99657464,0.0013564737,0.00051092164,0.0010930154,0.00034009857,0.00012484616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011484111,0.00043469324,0.0005759919,0.0007971725,0.0001947519,0.00024983086,0.0029827915,0.00027219357,0.000024325063],"category_scores_gemma":[0.00023721781,0.00034493307,0.00020981528,0.00042175665,0.00047420987,0.00074668246,0.0007498691,0.00024546165,0.000019474182],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010731647,0.00002046535,0.000013433749,0.000111407295,0.0000064595724,0.000017325428,0.00025516658,0.00035444763,0.00011723501,0.029809896,0.000010785533,0.9692727],"study_design_scores_gemma":[0.00076903566,0.00058303267,0.00005003409,0.0014890924,0.00003109476,0.00007556714,1.8449478e-7,0.20269406,0.011498732,0.7756332,0.005954952,0.0012209972],"about_ca_topic_score_codex":0.000004227702,"about_ca_topic_score_gemma":0.000015060754,"teacher_disagreement_score":0.9680517,"about_ca_system_score_codex":0.00014497085,"about_ca_system_score_gemma":0.0003540861,"threshold_uncertainty_score":0.9999003},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004992467,0.000056439832,0.9979477,0.00018264621,0.0002360305,0.0003053101,0.0001631802,0.00012172202,0.00048774778],"genre_scores_gemma":[0.663624,0.0000033748104,0.33323243,0.0021349764,0.0005333031,0.00006032549,0.00024603496,0.00009034831,0.00007520506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860895,0.000021188356,0.00024852666,0.0005018974,0.00034198008,0.0002774507],"domain_scores_gemma":[0.9992774,0.0002540756,0.00007198859,0.00010660706,0.00019402937,0.00009588695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004406197,0.0003098097,0.00038396762,0.00052361446,0.000110703906,0.00013384485,0.00020552624,0.00017631214,0.000046037676],"category_scores_gemma":[0.000024135517,0.00030698095,0.00013914195,0.00011100249,0.000155019,0.00007893022,0.000022142882,0.00032695592,0.00000904595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018967205,0.000025639563,9.400023e-7,0.00005856855,0.000008115576,0.000008017261,0.00008250042,0.024471326,0.00017169889,0.000039420313,0.000085160646,0.97502965],"study_design_scores_gemma":[0.0008382303,0.00018012965,0.000014044726,0.00016582577,0.00007170994,0.000004927834,3.9857952e-7,0.9837876,0.0022765368,0.010759495,0.0014642568,0.00043684075],"about_ca_topic_score_codex":0.000006637064,"about_ca_topic_score_gemma":0.000048502403,"teacher_disagreement_score":0.9745928,"about_ca_system_score_codex":0.00014599085,"about_ca_system_score_gemma":0.00011315494,"threshold_uncertainty_score":0.99993825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019841149,0.00005607642,0.9968537,0.000079924415,0.0003758833,0.00084978726,0.000005377768,0.00023225826,0.0015271682],"genre_scores_gemma":[0.03646247,0.000006630243,0.9628671,0.0002409637,0.00025924735,0.000029017017,0.000020122714,0.000043666776,0.00007077888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821895,0.000026404761,0.00044992502,0.0003681668,0.000442571,0.0004939778],"domain_scores_gemma":[0.9985878,0.0005342137,0.000116925934,0.0004785245,0.00021873534,0.00006381554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002522281,0.00030268074,0.00028097178,0.00032863475,0.00031146695,0.00040141973,0.00084430916,0.00022441773,0.000004121156],"category_scores_gemma":[0.00017995926,0.00024149171,0.00007785622,0.00028401279,0.00020727956,0.00032434912,0.00024406506,0.0006559921,0.0000061536543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012090117,0.000001723418,0.000014012409,0.00010772854,0.000005277506,1.3287683e-7,0.0012054461,0.8119091,0.000057720994,0.0005387516,0.000006670975,0.18615228],"study_design_scores_gemma":[0.0001985476,0.00002187969,0.000017422804,0.00013808825,0.0000067906262,0.000007966906,0.0000010655372,0.9977462,0.0003853822,0.0006190406,0.0005754461,0.0002821597],"about_ca_topic_score_codex":0.000006716693,"about_ca_topic_score_gemma":0.000005554661,"teacher_disagreement_score":0.18587011,"about_ca_system_score_codex":0.00021386165,"about_ca_system_score_gemma":0.000111829846,"threshold_uncertainty_score":0.9847746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035564718,0.0006171707,0.995672,0.00004860342,0.0024008239,0.0002693286,0.00006871743,0.00021314363,0.00035456734],"genre_scores_gemma":[0.7011275,0.000098663244,0.2962201,0.00045850663,0.0014206817,0.000055268745,0.00016317137,0.00014516962,0.00031090435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979219,0.000027336264,0.0004273835,0.0007783392,0.0003700737,0.00047497847],"domain_scores_gemma":[0.9981423,0.00073381764,0.00008923253,0.00079145463,0.00010569175,0.00013749178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091839506,0.00037658075,0.00041965363,0.00048427322,0.00014979322,0.00021822928,0.0011640135,0.0002662242,0.0000024557553],"category_scores_gemma":[0.00006501163,0.00036714182,0.000045151442,0.0001426603,0.00012119706,0.00023201841,0.00040670278,0.00023157659,0.0000052722935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023076389,0.0000011190128,0.0000050069675,0.00011375664,0.000014638982,0.0000048517886,0.00016730356,0.9552874,0.00012504717,0.006835113,0.00006056211,0.037362102],"study_design_scores_gemma":[0.00015314299,0.000060524202,0.0000052170603,0.0011560699,0.000011300916,0.000026376245,9.033581e-8,0.9817752,0.00030118987,0.0037502437,0.012320785,0.00043984485],"about_ca_topic_score_codex":0.000016082622,"about_ca_topic_score_gemma":0.00008488701,"teacher_disagreement_score":0.70077187,"about_ca_system_score_codex":0.00025417996,"about_ca_system_score_gemma":0.00015363189,"threshold_uncertainty_score":0.99987805},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009205727,0.000031380834,0.99589926,0.0007115653,0.00050542474,0.0015512249,0.0000216524,0.00010566724,0.00025326732],"genre_scores_gemma":[0.5449688,0.0000030828476,0.45407376,0.0005213076,0.00018660433,0.00015655259,0.0000244726,0.000022243956,0.000043176442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712485,0.000016252805,0.00042025073,0.0012248416,0.0006451136,0.000568662],"domain_scores_gemma":[0.9979664,0.00035978135,0.00022951927,0.00096156914,0.0002961969,0.00018651725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030176152,0.0003956317,0.00040120026,0.0007858982,0.00049885054,0.0009577597,0.0018146911,0.00012808054,0.000035061476],"category_scores_gemma":[0.000025310312,0.00033458867,0.00009259697,0.0006505662,0.0002873249,0.00033939132,0.0005413003,0.00030127025,0.000026627771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018377421,0.00008386526,0.00015243678,0.00010003829,0.00002296073,0.000008397422,0.0028792494,0.008721453,0.00038638484,0.14670601,0.000194434,0.8407264],"study_design_scores_gemma":[0.0006836715,0.0006495836,0.00077798206,0.00025393447,0.000019923236,0.000022239812,0.0000010129648,0.8435241,0.0005154424,0.14829573,0.0043690833,0.0008873164],"about_ca_topic_score_codex":0.00007411787,"about_ca_topic_score_gemma":0.00032804892,"teacher_disagreement_score":0.8398391,"about_ca_system_score_codex":0.00014646747,"about_ca_system_score_gemma":0.00027001175,"threshold_uncertainty_score":0.9999106},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009569203,0.0004392932,0.9895591,0.0006352362,0.0012553979,0.00038851917,0.000006754068,0.00024934547,0.0073706675],"genre_scores_gemma":[0.32409042,0.00002527562,0.67258364,0.0014636681,0.0010292983,0.00001112801,0.000014784984,0.000055129738,0.0007266295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957973,0.00002928011,0.0004948274,0.0015795908,0.0012553118,0.00084373204],"domain_scores_gemma":[0.99714404,0.00024289059,0.00032042488,0.001789041,0.0002524313,0.00025115113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069783616,0.000583914,0.0005176022,0.00068851584,0.00027098632,0.0005879818,0.0032402219,0.0003008216,0.00005698295],"category_scores_gemma":[0.000027142645,0.0004881142,0.0000946926,0.0005115422,0.0004429111,0.0012165427,0.0012614779,0.00086031907,0.00012097476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061554483,0.000026932476,0.00039571375,0.00003930866,0.000012568735,0.000044886485,0.0011737279,0.05949134,0.00006233046,0.04003936,0.000021497726,0.8986862],"study_design_scores_gemma":[0.00039861194,0.0002001954,0.0005444643,0.0005603499,0.00001459465,0.00016784752,2.1320022e-7,0.947913,0.00060047786,0.044971105,0.00354506,0.0010841062],"about_ca_topic_score_codex":0.000018737224,"about_ca_topic_score_gemma":0.00010763895,"teacher_disagreement_score":0.8976021,"about_ca_system_score_codex":0.00033566562,"about_ca_system_score_gemma":0.00040073975,"threshold_uncertainty_score":0.99975705},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004918666,0.000037775517,0.9910693,0.00088780915,0.0014497874,0.0002318504,0.0000034350892,0.000051774998,0.0062190895],"genre_scores_gemma":[0.56733465,0.000029391593,0.4286996,0.002653835,0.00023757954,0.000006536791,0.000008036422,0.000025083968,0.0010052639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980508,0.00003366792,0.0003815482,0.00060876575,0.0006758932,0.00024928627],"domain_scores_gemma":[0.9983034,0.0001419748,0.00034063205,0.00094455446,0.0002126842,0.00005675696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043449126,0.0002290051,0.00026227004,0.00030629366,0.00019329679,0.00015904383,0.0016714241,0.00014482468,0.000044005745],"category_scores_gemma":[0.000032381202,0.00017621664,0.000082677085,0.00047646777,0.0004343777,0.00021782906,0.00067263906,0.00032836228,0.000012448969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033724145,0.000019142502,0.0002853255,0.000037527483,0.000009683741,0.0000028369293,0.00025501827,0.12197031,0.00066441647,0.0820179,0.00008218122,0.7946523],"study_design_scores_gemma":[0.00041692425,0.00010193703,0.0015185009,0.0005558023,0.000012061222,0.0000429124,8.5658876e-8,0.9394698,0.0054717497,0.048538815,0.003377908,0.0004934768],"about_ca_topic_score_codex":0.00001638703,"about_ca_topic_score_gemma":0.000042106698,"teacher_disagreement_score":0.8174995,"about_ca_system_score_codex":0.00013570816,"about_ca_system_score_gemma":0.00027018753,"threshold_uncertainty_score":0.7185906},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040677082,0.0019215903,0.994776,0.0005473041,0.00106257,0.00029656105,0.0000093590415,0.00017189216,0.00080791814],"genre_scores_gemma":[0.40179697,0.000014410964,0.5978532,0.00012315504,0.000121075085,0.000006476674,0.0000072616585,0.000011842262,0.00006560862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997687,0.0000251021,0.00046060613,0.0007477399,0.0006259825,0.00045359228],"domain_scores_gemma":[0.99809635,0.00024388015,0.00032488885,0.0009946227,0.0002617513,0.00007850628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034361886,0.0003462875,0.00045688121,0.000732155,0.00048196162,0.00007228005,0.0014527678,0.00027080064,0.000008846566],"category_scores_gemma":[0.000059216658,0.00029280124,0.00008284413,0.0006027797,0.0010692573,0.00055640034,0.0008058319,0.0005191345,0.000008101534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011892292,0.00013017081,0.018676117,0.000062211606,0.000044746663,0.000028705465,0.0023579316,0.037441142,0.00007016341,0.37178415,0.00006092353,0.5693318],"study_design_scores_gemma":[0.0005438699,0.0002529119,0.026020687,0.0006536151,0.000037468137,0.00018072658,0.0000012123737,0.54035777,0.00021580205,0.42926303,0.0014799878,0.000992924],"about_ca_topic_score_codex":0.00006352259,"about_ca_topic_score_gemma":0.00023123424,"teacher_disagreement_score":0.56833893,"about_ca_system_score_codex":0.00017263654,"about_ca_system_score_gemma":0.00019968851,"threshold_uncertainty_score":0.99995244},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033409528,0.0003316458,0.9945018,0.00024009815,0.0013372375,0.0017582254,0.000012520233,0.00029847983,0.0014865324],"genre_scores_gemma":[0.020967212,0.000013077178,0.97787166,0.0003983107,0.00016683643,0.00020908137,0.000004642077,0.000058818627,0.00031036223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995271,0.000052357955,0.00071716233,0.0020093815,0.0010398579,0.00091022067],"domain_scores_gemma":[0.99625546,0.00024394349,0.00050416996,0.0021071285,0.00065988465,0.00022941417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021744617,0.00066249556,0.0006084465,0.0007001107,0.00029246035,0.00044874306,0.0038316213,0.00037209602,0.0000042319907],"category_scores_gemma":[0.00028442743,0.0006009658,0.00019807692,0.0005524227,0.00089446676,0.00092060905,0.00096041843,0.0006882105,0.000019892568],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027946893,0.00004637351,0.00000858958,0.00015074144,0.0000148332665,0.00001291916,0.0021347788,0.04224406,0.00006526744,0.20544982,0.000017979628,0.74982667],"study_design_scores_gemma":[0.00016234218,0.00015490847,0.0000108980585,0.0002110206,0.00000809805,0.000023607097,4.9002658e-8,0.6062459,0.0011959297,0.39127094,0.00025083957,0.00046551155],"about_ca_topic_score_codex":0.0000066080984,"about_ca_topic_score_gemma":0.000022956654,"teacher_disagreement_score":0.74936116,"about_ca_system_score_codex":0.000423154,"about_ca_system_score_gemma":0.00086023787,"threshold_uncertainty_score":0.99964416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001575627,0.00011484234,0.99091804,0.0050340528,0.00091696787,0.0011107929,0.0000037344564,0.00026216637,0.001623649],"genre_scores_gemma":[0.0024922972,0.000034582656,0.99464476,0.0015173762,0.0002466092,0.00008602432,0.000013746539,0.000030367388,0.0009342429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970196,0.000018368213,0.00044637054,0.0012469467,0.0006600288,0.00060872565],"domain_scores_gemma":[0.9979123,0.00022553529,0.00023165192,0.00104828,0.00045876496,0.00012347013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055907265,0.00037639844,0.00038284672,0.0013025922,0.0002820136,0.00055300357,0.0025403732,0.0004437009,0.0000438329],"category_scores_gemma":[0.0000841706,0.00032778867,0.00009515338,0.00066301774,0.0004750146,0.00068594835,0.0010667092,0.0005347068,0.00008812355],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012514557,0.000021788252,0.000008830825,0.000033468656,0.0000045774595,0.0000038081516,0.00019230413,0.0075115236,0.000186349,0.046292834,0.00008418577,0.9456591],"study_design_scores_gemma":[0.00022620657,0.000116357834,0.0000072356584,0.0001003064,0.0000020360176,0.000013059941,7.129552e-8,0.7164662,0.0006346046,0.27919662,0.0029411528,0.0002961899],"about_ca_topic_score_codex":0.000004756396,"about_ca_topic_score_gemma":0.0000056831523,"teacher_disagreement_score":0.94536287,"about_ca_system_score_codex":0.00018307255,"about_ca_system_score_gemma":0.00024045883,"threshold_uncertainty_score":0.9999174},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006423379,0.000059058868,0.9964328,0.00046511315,0.00061933004,0.0010684392,0.000015147459,0.0011319927,0.00014387992],"genre_scores_gemma":[0.019000748,0.000012451048,0.9795922,0.0009198794,0.00021743144,0.00010055733,0.000024621926,0.000059924456,0.000072182156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966323,0.000026142232,0.00063649594,0.0012937257,0.00072388456,0.0006874625],"domain_scores_gemma":[0.997346,0.0002934828,0.00026409328,0.0014065829,0.00043372563,0.00025614104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008281498,0.0006223507,0.00052921806,0.0007815486,0.0002509124,0.00061717926,0.0033037132,0.0006287458,0.000006242778],"category_scores_gemma":[0.000068052665,0.0005871282,0.00013322906,0.0005193494,0.00036508124,0.0016603278,0.00038243324,0.0010930459,0.0000099468225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.732111e-7,0.000008173484,0.000001065761,0.000035262754,0.0000034958216,0.000001176089,0.0012855848,0.2458457,0.00006419093,0.34053764,0.000007674721,0.41220915],"study_design_scores_gemma":[0.00007176557,0.00011106792,0.0000023016416,0.00041686374,0.0000037231923,0.000008207707,6.359212e-8,0.6459983,0.0009839134,0.3513654,0.00060965796,0.0004287485],"about_ca_topic_score_codex":0.000023254925,"about_ca_topic_score_gemma":0.000018783941,"teacher_disagreement_score":0.41178042,"about_ca_system_score_codex":0.00036286082,"about_ca_system_score_gemma":0.0005101875,"threshold_uncertainty_score":0.999658},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54744387,0.0073246905,0.41508162,0.009761434,0.003258447,0.003842527,0.00048564334,0.0006955221,0.012106215],"genre_scores_gemma":[0.98777246,0.00025147197,0.010207287,0.0008416827,0.00043101056,0.000007984477,0.00006786093,0.0000042745905,0.00041594455],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9975817,0.000037777474,0.00026415024,0.0010112623,0.0005524636,0.0005526377],"domain_scores_gemma":[0.99864644,0.000735952,0.0001330655,0.0001772647,0.00011643789,0.00019085212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063611765,0.0003297525,0.0003938501,0.0001697951,0.00022407908,0.00016972097,0.0010246455,0.0003960443,0.00009540195],"category_scores_gemma":[0.0001427656,0.0001401219,0.00009072463,0.0003962389,0.00075123605,0.000060233888,0.0005798485,0.0004959301,0.000042530417],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012392327,0.000013121795,0.00069489056,0.000011125021,0.000012354671,0.00008484907,0.000016047,0.00020300466,0.049836326,0.0005703893,0.000024413941,0.9485211],"study_design_scores_gemma":[0.0022880035,0.005964738,0.41068324,0.0017941503,0.00021454708,0.0025367797,0.0000028211427,0.10010856,0.055322252,0.31212327,0.09876087,0.010200757],"about_ca_topic_score_codex":0.000089252295,"about_ca_topic_score_gemma":0.0005391509,"teacher_disagreement_score":0.93832034,"about_ca_system_score_codex":0.0000654855,"about_ca_system_score_gemma":0.000047324036,"threshold_uncertainty_score":0.5714005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000432691,0.0000036195088,0.9949888,0.00036905645,0.0004992169,0.00070154684,0.00006830729,0.000030748102,0.00290604],"genre_scores_gemma":[0.92921877,3.252234e-7,0.06916609,0.00045377004,0.00042433356,0.000022686065,0.0002676732,0.000028027462,0.00041832653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982506,0.00002368737,0.0003313329,0.0006815944,0.00044280553,0.0002700049],"domain_scores_gemma":[0.9987634,0.0002576491,0.00029945202,0.00023422511,0.00037421795,0.00007108693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036834148,0.00029816397,0.0003249875,0.00031851564,0.0003068827,0.00015988799,0.0002787212,0.00015456717,0.000027132815],"category_scores_gemma":[0.000012034182,0.00030794335,0.00013681843,0.000162914,0.00021197973,0.00011835311,0.00005463653,0.00026596006,0.0000061507367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024765004,0.00002424625,0.00005924236,0.000013045082,0.0000065224453,1.1506475e-7,0.0004875334,0.8718158,0.000008477813,0.082177825,0.000016683596,0.045365732],"study_design_scores_gemma":[0.0003555104,0.000115379175,0.00015382578,0.00010246143,0.0000059800177,1.3237764e-7,3.4920336e-7,0.6245097,0.000012783341,0.3745195,0.000032363165,0.00019199842],"about_ca_topic_score_codex":0.0000143510615,"about_ca_topic_score_gemma":0.0000047965304,"teacher_disagreement_score":0.9287861,"about_ca_system_score_codex":0.00043945597,"about_ca_system_score_gemma":0.0004982382,"threshold_uncertainty_score":0.9999373},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046408476,0.00041450653,0.584726,0.0051114215,0.0068551316,0.0013140237,0.000008401998,0.00022760226,0.40087885],"genre_scores_gemma":[0.9343409,0.0002057553,0.036462642,0.0073736995,0.0045963745,0.00006960356,0.000022630089,0.00007479514,0.016853629],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99766207,0.000053396034,0.0002240853,0.00060449983,0.000956662,0.0004993175],"domain_scores_gemma":[0.9986512,0.00027841717,0.00019242147,0.0004243319,0.00028079597,0.0001728354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088135805,0.000260724,0.00023965978,0.00038693377,0.0006770787,0.00036560924,0.00076492166,0.00023603339,0.0006597149],"category_scores_gemma":[0.0000822974,0.00022616892,0.00003933389,0.00045538,0.0010935332,0.00039598145,0.000093815754,0.00044236172,0.00019699344],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020904168,0.000041363666,0.0002820812,0.000014094114,0.000013296235,0.0000052386076,0.026438024,0.0024943775,0.000020309226,0.20093815,0.00019093162,0.76954126],"study_design_scores_gemma":[0.0005452201,0.00036314563,0.00046018022,0.0009186667,0.0000447964,0.000009449006,0.00009037846,0.003163703,0.0011922002,0.11167983,0.8797857,0.0017467238],"about_ca_topic_score_codex":0.000074617354,"about_ca_topic_score_gemma":0.001042988,"teacher_disagreement_score":0.9338768,"about_ca_system_score_codex":0.00043779984,"about_ca_system_score_gemma":0.0011682286,"threshold_uncertainty_score":0.9222901},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024064665,0.0001836595,0.9908788,0.00012110104,0.0021991385,0.00040579966,0.000015987802,0.00020458583,0.0035844215],"genre_scores_gemma":[0.61283547,0.00001124115,0.38440505,0.0020581791,0.00044098287,0.0000053334347,0.00001153572,0.000046998077,0.0001852295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958736,0.000059087855,0.000719497,0.0011472375,0.0013939613,0.00080665416],"domain_scores_gemma":[0.9968069,0.000160129,0.00041645375,0.0015343617,0.00064796314,0.00043417467],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014519236,0.0005612066,0.00047716606,0.0008359867,0.0004541214,0.0016873733,0.0023479438,0.00035683665,0.000019634126],"category_scores_gemma":[0.00016110826,0.00055069785,0.00013237922,0.0006605347,0.0004616772,0.003941111,0.001521054,0.00090510456,0.000057336125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029850378,0.0001408234,0.00036591056,0.00013768011,0.00006680657,0.008284983,0.03511233,0.027063258,0.00010987507,0.24306782,0.0003078702,0.6853128],"study_design_scores_gemma":[0.00060633285,0.00015666749,0.000016071259,0.0005748423,0.000017528066,0.0029874314,0.0000015576942,0.8766645,0.00044245485,0.11360466,0.0036195545,0.0013084009],"about_ca_topic_score_codex":0.00031099122,"about_ca_topic_score_gemma":0.00019728392,"teacher_disagreement_score":0.84960127,"about_ca_system_score_codex":0.000746127,"about_ca_system_score_gemma":0.0009213025,"threshold_uncertainty_score":0.99969447},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013281986,0.00019000418,0.997324,0.000101893485,0.00033739064,0.00035612375,0.000014086717,0.00012017861,0.00022812287],"genre_scores_gemma":[0.49444687,0.000014485164,0.5053835,0.00007268781,0.00005107625,0.00000526716,0.00001031312,0.000009356888,0.0000064749506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769676,0.0000705377,0.00066955824,0.0007035285,0.0005413709,0.0003182479],"domain_scores_gemma":[0.9976605,0.00017350727,0.00044609085,0.001136555,0.00048295018,0.00010039347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011640274,0.0002724162,0.00040190143,0.0006222696,0.00013028752,0.00012740573,0.0015813744,0.00018555913,0.00002489351],"category_scores_gemma":[0.00003073129,0.00025139964,0.00009121288,0.0005981378,0.00033705647,0.0007682895,0.00035578877,0.00023284389,0.000001686445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013692189,0.00023236846,0.000208352,0.00012798836,0.000043640717,0.0000021054286,0.0066930796,0.047979712,0.056072023,0.16305359,0.000013271846,0.7255602],"study_design_scores_gemma":[0.00020784869,0.00016024437,0.0004956233,0.000053260967,0.000012302942,0.00000975827,9.666612e-7,0.9561147,0.023654804,0.018919922,0.000102745325,0.0002678003],"about_ca_topic_score_codex":0.00011241604,"about_ca_topic_score_gemma":0.000102216545,"teacher_disagreement_score":0.908135,"about_ca_system_score_codex":0.000065422995,"about_ca_system_score_gemma":0.00032085212,"threshold_uncertainty_score":0.9999938},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015560032,0.00020926842,0.99404407,0.000043216703,0.00090269325,0.0005241124,0.000005121515,0.000097461525,0.002618034],"genre_scores_gemma":[0.42111033,0.000008716319,0.5786069,0.000088170294,0.000050911287,0.000021729535,0.0000050345357,0.000012583906,0.00009559288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633694,0.00007605362,0.000986598,0.0011116947,0.0009498859,0.00053880323],"domain_scores_gemma":[0.9970792,0.0002858532,0.0007326249,0.001339545,0.0004627231,0.00010004059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021162366,0.00037895612,0.0008393863,0.0029879103,0.000098078584,0.00020627031,0.002813923,0.00032524503,0.000012977134],"category_scores_gemma":[0.00014987201,0.00034655406,0.00021539284,0.0023981726,0.0004334663,0.0014888244,0.0007632028,0.0005077465,0.000020528918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014714669,0.00005443417,0.000267698,0.00033012909,0.00009721567,0.000021711694,0.0019408423,0.11443906,0.0005906166,0.09596003,0.0000020211721,0.7862815],"study_design_scores_gemma":[0.00024244687,0.000081264225,0.001922236,0.00038729148,0.00004848772,0.000011582341,0.0000015052872,0.9912723,0.002191784,0.0034734448,0.000022463168,0.00034522943],"about_ca_topic_score_codex":0.00013400547,"about_ca_topic_score_gemma":0.00012474296,"teacher_disagreement_score":0.8768332,"about_ca_system_score_codex":0.00045257778,"about_ca_system_score_gemma":0.00024545577,"threshold_uncertainty_score":0.9998987},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3443404,0.00023762474,0.6547864,0.00012977906,0.00011646504,0.00015522238,8.331394e-7,0.00011663873,0.00011661949],"genre_scores_gemma":[0.88205045,0.000004191336,0.1176766,0.00017295755,0.000072391325,0.000004221701,2.2828267e-7,0.000015993746,0.00000298975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848425,0.000019122397,0.00025782647,0.00040678793,0.00032525486,0.00050678354],"domain_scores_gemma":[0.9992166,0.00026930048,0.000027734259,0.00026513232,0.00006691704,0.00015432955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024833492,0.00022874423,0.0002679419,0.0002610052,0.00007477844,0.00008041658,0.00037003763,0.000061668106,0.000010941086],"category_scores_gemma":[0.0001065746,0.00021213073,0.000024902734,0.001014101,0.00015825285,0.00016714723,0.00012125319,0.00019534209,0.000004618822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001190153,0.000019335941,0.00017248644,0.000042477543,0.0000037392258,0.00000471521,0.0022070592,0.60071707,0.15812844,0.00008410425,0.000002944009,0.23860571],"study_design_scores_gemma":[0.00043214022,0.00044015417,0.012168285,0.00025128093,0.00001182822,0.000039552255,0.0000046468754,0.9690505,0.014018348,0.0031526731,0.000044133718,0.00038645347],"about_ca_topic_score_codex":0.00005861869,"about_ca_topic_score_gemma":0.000052373398,"teacher_disagreement_score":0.53771,"about_ca_system_score_codex":0.00014204276,"about_ca_system_score_gemma":0.000087545275,"threshold_uncertainty_score":0.86504406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000016315262,0.00006353091,0.9958586,0.000076691686,0.0003643519,0.0008002732,0.000009025817,0.0009068163,0.0019190744],"genre_scores_gemma":[0.020127917,0.0000023718733,0.9790414,0.0004351307,0.00015077517,0.000100033874,0.000011224152,0.000052149586,0.00007900232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676377,0.0000157881,0.00047551404,0.0015094791,0.00065248966,0.00058296847],"domain_scores_gemma":[0.99750865,0.00021930708,0.00024153893,0.0014026318,0.0004883857,0.00013947986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009640982,0.00056182727,0.00048561656,0.0008322814,0.00016730749,0.00032332953,0.0032778864,0.0003841639,0.0000018267804],"category_scores_gemma":[0.00008253809,0.0005217131,0.0001485551,0.0004924283,0.00027115984,0.00054690015,0.00069976586,0.00063731236,0.0000022350443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022758954,0.000015825859,0.0000018521316,0.00003722245,0.0000025257925,0.000002629849,0.00019509012,0.33539635,0.000077236306,0.08094084,0.000008738659,0.5833194],"study_design_scores_gemma":[0.00011574685,0.00013067992,0.0000032757694,0.00022361074,0.000005796673,0.000010997762,6.999079e-9,0.8431577,0.0021772946,0.15347834,0.00021190896,0.00048464272],"about_ca_topic_score_codex":0.00002037755,"about_ca_topic_score_gemma":0.0000050630233,"teacher_disagreement_score":0.5828348,"about_ca_system_score_codex":0.00034075684,"about_ca_system_score_gemma":0.00077320583,"threshold_uncertainty_score":0.99972343},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025790448,0.00066816545,0.9857846,0.0009047185,0.0024519041,0.00025812496,0.0000032459604,0.00028554042,0.009617901],"genre_scores_gemma":[0.02727629,0.0001183739,0.9575796,0.011967371,0.00064964895,0.000012676774,0.0000072912567,0.00009265588,0.0022960873],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99593985,0.000044120956,0.00049814256,0.0016992707,0.0009801042,0.00083850493],"domain_scores_gemma":[0.9970285,0.0003500184,0.00025304846,0.0020001186,0.00013908923,0.00022921813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010958633,0.0005911641,0.00053465704,0.00074983964,0.00025962674,0.0006901421,0.0043783262,0.00033609368,0.00005073212],"category_scores_gemma":[0.00007256954,0.000535365,0.00017834116,0.000602137,0.00071556325,0.0006284886,0.0011737088,0.00082556653,0.0001431939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018329799,0.000021975762,0.000015618534,0.000020424977,0.000008912152,0.00015105082,0.00026946602,0.0027454416,0.00009711993,0.2525601,0.0001772866,0.74393076],"study_design_scores_gemma":[0.00023553471,0.0001252884,0.000029542074,0.0002566119,0.0000066060475,0.00021140953,1.1244378e-7,0.14764608,0.0009258822,0.8349147,0.014741179,0.00090703997],"about_ca_topic_score_codex":0.000011798717,"about_ca_topic_score_gemma":0.000020341968,"teacher_disagreement_score":0.74302375,"about_ca_system_score_codex":0.00025189001,"about_ca_system_score_gemma":0.00033980634,"threshold_uncertainty_score":0.9997098},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025110254,0.00012665043,0.99533325,0.002547612,0.0007597301,0.00054119935,0.00006213735,0.000094514486,0.0005097906],"genre_scores_gemma":[0.0028318074,0.0000176174,0.99354666,0.002799057,0.00040742217,0.0000330991,0.00002742265,0.000026118807,0.00031078453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677813,0.000007281202,0.0003447999,0.0019481109,0.00042460376,0.0004971005],"domain_scores_gemma":[0.99640566,0.00040787744,0.00014239957,0.002693548,0.0001536014,0.00019692892],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.000970579,0.00033409678,0.00036738158,0.00042612237,0.00031112196,0.0018199612,0.0076404028,0.0001434162,0.0000040655314],"category_scores_gemma":[0.00010104547,0.00030328808,0.000034193865,0.00038387583,0.00023621698,0.000999124,0.0068843463,0.0002807282,0.000014426176],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016201215,0.0000074473587,0.00002342822,0.00003263549,0.0000049664336,0.000002212176,0.00009689686,0.0015143853,0.00004373809,0.019769292,0.0012160862,0.9772873],"study_design_scores_gemma":[0.00012497877,0.00007956168,0.00006539178,0.00024500367,0.0000069384078,0.000018835013,4.504566e-8,0.8474656,0.00027838108,0.046696298,0.10461681,0.0004021678],"about_ca_topic_score_codex":0.000033059605,"about_ca_topic_score_gemma":0.00005085105,"teacher_disagreement_score":0.97688514,"about_ca_system_score_codex":0.000059230075,"about_ca_system_score_gemma":0.00018432138,"threshold_uncertainty_score":0.99994195},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003955586,0.0003252802,0.9891316,0.0004539316,0.00027423957,0.00062437163,0.000021123124,0.00011625746,0.0050975843],"genre_scores_gemma":[0.53207195,0.00034220677,0.45902032,0.0009286029,0.0009898203,0.000047240013,0.000048142225,0.00009836907,0.006453348],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985756,0.000005164792,0.00026733044,0.0005459361,0.00037930752,0.00022664882],"domain_scores_gemma":[0.99877375,0.00016003204,0.00014578679,0.00068761775,0.00014666651,0.00008613395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000068273315,0.00022773918,0.0004409175,0.00034761356,0.000053115902,0.000024987929,0.0003381667,0.00013236742,0.00023841132],"category_scores_gemma":[0.000036854617,0.000187183,0.0001250285,0.00020549819,0.0005730426,0.00006236,0.0002785726,0.00040988013,0.00003321221],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012678715,0.00005494163,0.0003437288,0.00014750587,0.000021557504,0.000012594378,0.00006688291,0.0003932335,0.006277232,0.003796334,0.00041214423,0.98846114],"study_design_scores_gemma":[0.0017537278,0.0021523496,0.017386466,0.0062052556,0.0005731258,0.00038099368,6.6483705e-7,0.055922322,0.2819414,0.43653974,0.19344774,0.0036961918],"about_ca_topic_score_codex":0.000012248343,"about_ca_topic_score_gemma":5.7319915e-7,"teacher_disagreement_score":0.984765,"about_ca_system_score_codex":0.00006575892,"about_ca_system_score_gemma":0.00010356638,"threshold_uncertainty_score":0.76331013},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029415145,0.0006574137,0.99517864,0.00037913778,0.001803757,0.0009573284,0.0000107630285,0.00016743352,0.0005513722],"genre_scores_gemma":[0.20567974,0.000014801032,0.79169196,0.0013827133,0.0008606167,0.000052794392,0.000021407594,0.00005238701,0.00024356967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962009,0.000059545335,0.0006256026,0.001585702,0.0008825437,0.00064567145],"domain_scores_gemma":[0.9973556,0.0004968765,0.00037520184,0.0013109134,0.00029073854,0.00017068347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012038216,0.0005360568,0.00058680977,0.0007133981,0.00036568363,0.0005716039,0.002270582,0.00034105434,0.000014606106],"category_scores_gemma":[0.00003537887,0.00047830018,0.00022765395,0.00034499075,0.00019482066,0.00032949215,0.0003632369,0.00044640733,0.00004410952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025060572,0.00005232207,0.000017302067,0.00016692783,0.000026414988,0.000051813993,0.0057435594,0.51468194,0.0014708813,0.08669407,0.00013694001,0.3909328],"study_design_scores_gemma":[0.00056171865,0.00013302763,0.00000595024,0.00036503488,0.0000047437265,0.000009667938,8.334774e-7,0.9700753,0.00096168416,0.02188989,0.0054295002,0.00056264043],"about_ca_topic_score_codex":0.000021318356,"about_ca_topic_score_gemma":0.00007730392,"teacher_disagreement_score":0.45539337,"about_ca_system_score_codex":0.00033758723,"about_ca_system_score_gemma":0.00031761438,"threshold_uncertainty_score":0.9997669},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005466269,0.00035544968,0.9933574,0.00032180778,0.0023747839,0.0014433376,0.00008179245,0.00024567614,0.0012731228],"genre_scores_gemma":[0.30467686,0.000031668005,0.69253635,0.002004073,0.000502081,0.000076329336,0.00008659923,0.00005025515,0.0000358058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514717,0.000048981936,0.0007089957,0.0020891782,0.001101193,0.00090449926],"domain_scores_gemma":[0.99638903,0.0009701634,0.00040299454,0.0013995691,0.0005438438,0.00029437002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010675314,0.0006696283,0.0006850018,0.0009577405,0.00047685188,0.00093239016,0.0029035318,0.00041089236,0.000012283875],"category_scores_gemma":[0.00016135092,0.00063449604,0.00029571494,0.00082748075,0.0006984493,0.00047877253,0.0011077747,0.00074201904,0.00006755459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074107365,0.00015288281,0.00003653832,0.00014598844,0.000024610092,0.000027601855,0.0008179181,0.10466192,0.00015920977,0.06470755,0.00018891685,0.82906944],"study_design_scores_gemma":[0.000560128,0.00015016807,0.00020252085,0.00021815777,0.000010984658,0.00002044233,1.6702393e-7,0.85650223,0.0002536756,0.13984571,0.0015397861,0.0006960263],"about_ca_topic_score_codex":0.000036884714,"about_ca_topic_score_gemma":0.00004881748,"teacher_disagreement_score":0.82837343,"about_ca_system_score_codex":0.0002859582,"about_ca_system_score_gemma":0.00046765135,"threshold_uncertainty_score":0.99961066},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016860928,0.0014975251,0.9922593,0.0010780228,0.0006188268,0.00031153177,0.0000057352427,0.00020072008,0.0040114336],"genre_scores_gemma":[0.10895175,0.000066562134,0.88915664,0.00059004256,0.00039741342,0.00002682836,0.000006691933,0.00002978499,0.000774271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969715,0.000017261533,0.00040053081,0.0011351851,0.0008087071,0.0006668195],"domain_scores_gemma":[0.99784285,0.000072738585,0.00020660821,0.0014603112,0.00020762657,0.00020985627],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055623846,0.00040722478,0.0003185623,0.000538066,0.00037508545,0.00021736728,0.00263279,0.00027935687,0.000016047417],"category_scores_gemma":[0.000013971782,0.00038888233,0.000112555485,0.00052771805,0.00054676336,0.0008216181,0.0010019277,0.0006198759,0.00017439909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.3671523e-7,0.000042409407,0.000013553411,0.0000086826785,0.0000019202723,0.0000048620277,0.00020854137,0.16933914,0.00004537194,0.29287577,0.000035969293,0.53742296],"study_design_scores_gemma":[0.0000757471,0.000028200679,0.000050494524,0.00005775346,0.000004356602,0.00007272736,2.4811749e-8,0.69739735,0.00002523951,0.30078205,0.0011796377,0.00032642137],"about_ca_topic_score_codex":0.00001349614,"about_ca_topic_score_gemma":0.000012508768,"teacher_disagreement_score":0.5370965,"about_ca_system_score_codex":0.0004982881,"about_ca_system_score_gemma":0.0005937084,"threshold_uncertainty_score":0.9998563},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16197585,0.003086251,0.8317204,0.000044493,0.0019770416,0.00033570864,0.000028606626,0.000013091159,0.000818565],"genre_scores_gemma":[0.90537006,0.000045893637,0.09226936,0.0011054456,0.0010464413,0.0000052094074,0.00005179978,0.000040692754,0.00006510861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998294,0.000024927676,0.0003344238,0.0007998987,0.00021917744,0.0003275684],"domain_scores_gemma":[0.99905366,0.00018962417,0.00020212108,0.0003716923,0.00010922461,0.00007370953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036372905,0.00029077436,0.00029085838,0.00028336776,0.000079263904,0.000045543486,0.00043449976,0.0002520221,0.000023036975],"category_scores_gemma":[0.00028930852,0.00030960128,0.00009480609,0.000070007074,0.0004553917,0.000004481653,0.00025959357,0.00031061197,0.0000022972006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011504184,0.000049171165,0.007263547,0.00014363292,0.00004993382,0.000116447954,0.00078870356,0.38464153,0.25796378,0.001231034,0.0001416745,0.3474955],"study_design_scores_gemma":[0.004576623,0.0012522561,0.005634518,0.0018944932,0.00009890337,0.001216445,0.0000044029107,0.7984217,0.10640733,0.04127528,0.033781745,0.0054363245],"about_ca_topic_score_codex":0.00012158086,"about_ca_topic_score_gemma":0.00036800207,"teacher_disagreement_score":0.7433942,"about_ca_system_score_codex":0.00038993452,"about_ca_system_score_gemma":0.00078113284,"threshold_uncertainty_score":0.9999356},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030299531,0.00038043386,0.9644614,0.00039738856,0.0004913821,0.00046580684,0.000011142531,0.0001600138,0.003332887],"genre_scores_gemma":[0.7924719,0.00017586982,0.20370753,0.001782381,0.0006433813,0.000009136206,0.000050282233,0.0000466557,0.0011128527],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978105,0.000020605361,0.00031721653,0.0010693872,0.0003581434,0.00042417945],"domain_scores_gemma":[0.99865496,0.000033757635,0.00020301345,0.0007914086,0.00021389399,0.00010295976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026370707,0.00040957532,0.00035097185,0.00022981966,0.00013537252,0.0001572542,0.00071057474,0.0004791061,0.0000070239034],"category_scores_gemma":[0.000037097394,0.00034230438,0.00015351833,0.00014296944,0.00038025258,0.000009988088,0.0004524793,0.00030940384,0.000023058272],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041771393,0.00011691498,0.0001971464,0.00007076862,0.00014241452,0.000068911766,0.00010628877,0.00046981763,0.45254835,0.00061420165,0.0005164004,0.545107],"study_design_scores_gemma":[0.0004140784,0.00077082694,0.00016615793,0.0002506952,0.000063273124,0.0000985457,2.9071865e-7,0.013531254,0.938177,0.022215527,0.022808382,0.001504008],"about_ca_topic_score_codex":0.000013894388,"about_ca_topic_score_gemma":0.0000735542,"teacher_disagreement_score":0.7621724,"about_ca_system_score_codex":0.00009733911,"about_ca_system_score_gemma":0.0002030321,"threshold_uncertainty_score":0.9999029},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005068553,0.00022617579,0.99588615,0.00051386195,0.0007983299,0.0004519961,0.000029204837,0.00017809028,0.0018654927],"genre_scores_gemma":[0.20903789,0.0000208478,0.7844263,0.0031163883,0.0007850601,0.000047491434,0.00010731637,0.00007543811,0.0023832864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587953,0.0000658799,0.0006382952,0.0014938908,0.0013359208,0.0005864712],"domain_scores_gemma":[0.9979505,0.00036509932,0.00029579343,0.0009850044,0.0002556785,0.00014792844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000981835,0.00050965056,0.00057711254,0.00080730283,0.00017014646,0.00042891141,0.0025432622,0.0003926334,0.00004802043],"category_scores_gemma":[0.000048526857,0.00050051394,0.00015046126,0.0008082418,0.00030431108,0.00072947954,0.00015140318,0.00078476296,0.00008360656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017669521,0.000060520473,0.000023775054,0.000021286702,0.0000055083005,0.00010173277,0.00021627425,0.21238184,0.000046982375,0.0012455097,0.0000349003,0.785844],"study_design_scores_gemma":[0.0009339138,0.0003278586,0.00063860096,0.0012696189,0.000008320571,0.00006213683,1.6459371e-7,0.94358736,0.0013061815,0.048721313,0.0020231912,0.0011213624],"about_ca_topic_score_codex":0.00003883865,"about_ca_topic_score_gemma":0.00005049215,"teacher_disagreement_score":0.7847226,"about_ca_system_score_codex":0.00052282796,"about_ca_system_score_gemma":0.00078581093,"threshold_uncertainty_score":0.99974465},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038099283,0.00038098733,0.9936176,0.000667699,0.0011519868,0.00029776603,0.000004142355,0.00011814184,0.0033806849],"genre_scores_gemma":[0.77003723,0.000017531138,0.22866261,0.00047776135,0.00048479676,0.000006783567,0.000012830452,0.00002936167,0.0002711062],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966784,0.000029345618,0.00067245186,0.0010839386,0.0010681353,0.0004676968],"domain_scores_gemma":[0.99751914,0.00035376908,0.00042583284,0.0010892865,0.00040327522,0.00020871458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008236651,0.000387993,0.00051774323,0.00074888766,0.00010910024,0.00018519525,0.0026496013,0.00027497084,0.000010849758],"category_scores_gemma":[0.00012714301,0.00035278342,0.00013302681,0.0006743546,0.00045919136,0.0005866592,0.0010193172,0.00047489884,0.00005264823],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060159687,0.000032986136,0.000016337075,0.000027975504,0.000007628198,0.000012450406,0.00047238395,0.017411292,0.00022119659,0.1076576,0.000051176874,0.874083],"study_design_scores_gemma":[0.00024916552,0.00017570952,0.00018274998,0.00013102734,0.000006075422,0.000032182623,7.295516e-8,0.47612572,0.0015090355,0.5199157,0.0012934207,0.0003791349],"about_ca_topic_score_codex":0.000019182316,"about_ca_topic_score_gemma":0.000022622364,"teacher_disagreement_score":0.87370384,"about_ca_system_score_codex":0.00029446598,"about_ca_system_score_gemma":0.0008429397,"threshold_uncertainty_score":0.9998924},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52490234,0.00006153985,0.45894215,0.0041982657,0.0041313316,0.004121238,0.000053349348,0.00012835604,0.003461413],"genre_scores_gemma":[0.9574933,0.000005715185,0.04117984,0.00059765374,0.0005162876,0.000021652451,0.0000030011104,0.000021289019,0.00016123508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519277,0.00028820673,0.0007852048,0.0009872841,0.0022232663,0.00052326795],"domain_scores_gemma":[0.9936703,0.0007648591,0.00067295105,0.00089362264,0.0036854625,0.00031284115],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.004179625,0.00031999184,0.00047742412,0.00080623705,0.0010548716,0.00069413555,0.001609003,0.00015209704,0.000017540046],"category_scores_gemma":[0.0006837014,0.000265757,0.000047018744,0.0033958843,0.0032040586,0.0011966067,0.00051901944,0.00039068458,0.0000044748103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051535495,0.00068802637,0.0007801909,0.00003794323,0.000035401845,0.00027600862,0.39089066,0.11788935,0.00023457358,0.02768166,0.00041732032,0.46101734],"study_design_scores_gemma":[0.008930325,0.034793094,0.0019533453,0.0041519306,0.00068048574,0.0013308773,0.082993254,0.57954675,0.00868108,0.17334716,0.092401624,0.011190053],"about_ca_topic_score_codex":0.0015517726,"about_ca_topic_score_gemma":0.014602144,"teacher_disagreement_score":0.4616574,"about_ca_system_score_codex":0.0005549429,"about_ca_system_score_gemma":0.0057647885,"threshold_uncertainty_score":0.99997944},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3320608,0.000022997707,0.666955,0.0006005574,0.00022989421,0.00007163949,3.2427175e-7,0.000020199406,0.00003857526],"genre_scores_gemma":[0.9646191,0.0000043943146,0.033378232,0.0013339432,0.00065145,0.0000037495547,0.0000043734635,0.0000044895237,2.7135954e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988819,0.00007158514,0.000176723,0.00034333975,0.00024476426,0.00028173722],"domain_scores_gemma":[0.9993507,0.00020886215,0.000059239046,0.0002197017,0.00010515593,0.000056326957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003398999,0.00010361157,0.00024750078,0.00017605156,0.00008584076,0.000012537724,0.0001165211,0.00005778207,0.000013102026],"category_scores_gemma":[0.00023420416,0.00008243217,0.000085716194,0.0006235954,0.0003460409,0.00008843698,0.000066401844,0.00024871068,0.000004173249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027602405,0.00010364884,0.023527604,0.000022387834,0.000024420724,0.00002149738,0.00018216795,0.076429896,0.5568301,0.001769112,0.000012597666,0.3408005],"study_design_scores_gemma":[0.00061747775,0.00062435074,0.39762554,0.000033425305,0.000015847945,0.00021460536,1.942011e-7,0.54833794,0.02829372,0.024063537,0.00002476084,0.00014859751],"about_ca_topic_score_codex":0.000012688195,"about_ca_topic_score_gemma":9.92962e-7,"teacher_disagreement_score":0.63357675,"about_ca_system_score_codex":0.00006006559,"about_ca_system_score_gemma":0.00014058255,"threshold_uncertainty_score":0.33614862},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033734865,0.0033207175,0.9848145,0.000081753475,0.0076118237,0.0008482254,0.0000050882927,0.00024644236,0.0030377067],"genre_scores_gemma":[0.5995875,0.00019811912,0.37696916,0.00055340066,0.009462617,0.0002082343,0.000013797932,0.00023459007,0.012772567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957502,0.000037892958,0.0007744243,0.0014207637,0.00088067714,0.0011360705],"domain_scores_gemma":[0.99706894,0.00059668114,0.00045571517,0.0012280922,0.0004247458,0.00022581792],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015825769,0.0006586363,0.0007127056,0.00073822954,0.0004025678,0.0016158032,0.0028928113,0.00035287422,0.000007507977],"category_scores_gemma":[0.000061286846,0.00059287885,0.00022462066,0.00032846455,0.0002259289,0.0010767053,0.00087986246,0.0007611107,0.00006572357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003346502,0.000014382629,0.000032520933,0.00014690304,0.000020925234,0.000013891778,0.0013352889,0.08860579,0.00022561045,0.6930006,0.000010225522,0.2165905],"study_design_scores_gemma":[0.00039244542,0.00062419986,0.000064491345,0.0031594813,0.000037088776,0.00025630475,0.000012909158,0.5475591,0.002645507,0.13888697,0.30353424,0.0028272532],"about_ca_topic_score_codex":0.000078761,"about_ca_topic_score_gemma":0.000014376316,"teacher_disagreement_score":0.60784537,"about_ca_system_score_codex":0.00058571826,"about_ca_system_score_gemma":0.0005734719,"threshold_uncertainty_score":0.99965227},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011824509,0.0004330332,0.99033666,0.001411678,0.0015931802,0.00025877496,0.0000011179203,0.00007445439,0.0057728533],"genre_scores_gemma":[0.44541496,0.00016440482,0.5458183,0.002174493,0.0012554158,0.000025212903,0.000006031405,0.000063476786,0.0050776913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747425,0.00002678323,0.0005042984,0.00079487934,0.0007289953,0.00047080443],"domain_scores_gemma":[0.99754333,0.00077564945,0.0003478646,0.0010238817,0.0002063483,0.000102932994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069738063,0.0003136054,0.00033835767,0.00031541096,0.00028127432,0.00046330332,0.0033485987,0.00015418058,0.000017438777],"category_scores_gemma":[0.000084025014,0.00021988577,0.00011979664,0.00039021103,0.0007174741,0.0004528903,0.0013293942,0.0004665978,0.00013520895],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013213833,0.000008158297,0.000007795108,0.000011765067,0.000005512822,0.000006429976,0.00022827277,0.004966579,0.00016389469,0.059867706,0.00015095761,0.9345816],"study_design_scores_gemma":[0.00013406212,0.000109496184,0.00028154018,0.00023456251,0.000004167719,0.000029883171,9.20369e-8,0.54057646,0.0012538866,0.45039967,0.00660199,0.00037419598],"about_ca_topic_score_codex":0.000023263541,"about_ca_topic_score_gemma":0.000044627126,"teacher_disagreement_score":0.93420744,"about_ca_system_score_codex":0.00012246182,"about_ca_system_score_gemma":0.00038322475,"threshold_uncertainty_score":0.8966682},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007907808,0.00018995014,0.9946057,0.0002738524,0.0023336224,0.0016329756,0.000026360494,0.00018414926,0.000674287],"genre_scores_gemma":[0.05909852,0.000002533291,0.93664795,0.00013297766,0.0008976469,0.00031269778,0.000014937447,0.0001301575,0.002762566],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968025,0.00006483571,0.0006873422,0.0010246973,0.00073490164,0.00068572053],"domain_scores_gemma":[0.99381655,0.0042050504,0.00037734545,0.000971136,0.00041463604,0.00021527839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006032904,0.00051229435,0.0007658031,0.0005474274,0.00042308815,0.00040266998,0.0010540925,0.0003287199,0.00013636831],"category_scores_gemma":[0.0021241792,0.00044775134,0.00021457,0.0004177912,0.00040642812,0.00024407674,0.00044570732,0.00066928426,0.000065461056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037469377,0.00028006925,0.000023731767,0.0013467678,0.0002448993,0.000009268916,0.0009151018,0.06307459,0.0007195979,0.283604,0.00041916696,0.6493253],"study_design_scores_gemma":[0.00016397059,0.00013539489,0.000008908611,0.00038566234,0.00006303573,0.000015802809,4.482971e-7,0.38952824,0.000033090266,0.60850656,0.0007705176,0.0003883457],"about_ca_topic_score_codex":0.000045532208,"about_ca_topic_score_gemma":0.000028235017,"teacher_disagreement_score":0.648937,"about_ca_system_score_codex":0.00038079353,"about_ca_system_score_gemma":0.00030653563,"threshold_uncertainty_score":0.9997974},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011355917,0.0014302791,0.9942578,0.00034728,0.0003003055,0.0002716252,0.0000055018454,0.0013744081,0.00087719545],"genre_scores_gemma":[0.46215814,0.00009229292,0.5372976,0.0003292646,0.00007080294,0.0000043551645,0.0000036163879,0.000020455263,0.000023480792],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973336,0.00008647595,0.0005999771,0.0008086888,0.0006471841,0.0005241112],"domain_scores_gemma":[0.996262,0.001306864,0.00044483942,0.0015964421,0.00022302869,0.00016683782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001369277,0.00042518202,0.00058759854,0.00065960735,0.00025496536,0.00023015555,0.0027403599,0.00020157734,0.0000027055307],"category_scores_gemma":[0.00022864284,0.0003840715,0.00008111468,0.0004177474,0.0010848548,0.0003715927,0.0022617136,0.00082576746,0.000003377998],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004395983,0.000030065949,0.001278615,0.00006981,0.000007988121,0.0000074095656,0.0012944019,0.00049072277,0.00035784804,0.006688568,0.000014539601,0.98975563],"study_design_scores_gemma":[0.00021090059,0.00019260978,0.0024648572,0.0009777445,0.0000101142705,0.00012908677,3.541499e-8,0.4096173,0.0011109086,0.5845227,0.00016552594,0.0005981974],"about_ca_topic_score_codex":0.0001422231,"about_ca_topic_score_gemma":0.000023406925,"teacher_disagreement_score":0.98915744,"about_ca_system_score_codex":0.00009455926,"about_ca_system_score_gemma":0.00022597893,"threshold_uncertainty_score":0.9998611},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024366012,0.00042798527,0.9877825,0.0005871407,0.0010487335,0.00042461662,0.0000038196063,0.00017396804,0.009526889],"genre_scores_gemma":[0.1720243,0.00030706654,0.8229571,0.0019119023,0.0003182448,0.000036606456,0.000022094588,0.00008874375,0.002333927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588555,0.00007426171,0.00061774015,0.0014224731,0.0012486227,0.0007513689],"domain_scores_gemma":[0.9974184,0.00035520486,0.00022637496,0.0013469352,0.00036027146,0.00029279426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096532615,0.0004415425,0.00049215154,0.0018562619,0.00013478783,0.00053751725,0.0034326261,0.0003329314,0.000021915379],"category_scores_gemma":[0.00026927033,0.00041533174,0.00008163602,0.0016175885,0.00054341863,0.00054441835,0.0012404463,0.000947405,0.000055025128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109255025,0.00006477519,0.00010417839,0.000040949933,0.0000067995747,0.0005779301,0.001039282,0.1585537,0.000034893124,0.05573885,0.00017396669,0.78365374],"study_design_scores_gemma":[0.00041704823,0.0002044711,0.00011485111,0.00023377994,0.0000023617365,0.000062502404,9.8066806e-8,0.70637,0.000032280077,0.2900402,0.0020059138,0.0005165215],"about_ca_topic_score_codex":0.000034853496,"about_ca_topic_score_gemma":0.00013830699,"teacher_disagreement_score":0.7831372,"about_ca_system_score_codex":0.00033743828,"about_ca_system_score_gemma":0.0011630903,"threshold_uncertainty_score":0.9998298},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020385694,0.0006537873,0.9813549,0.0053601363,0.002271661,0.0004815325,0.0000027777842,0.00041590424,0.00925547],"genre_scores_gemma":[0.12906712,0.00009244718,0.8600625,0.0068008415,0.00081721664,0.000026272119,0.000004423706,0.000067377994,0.00306185],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949722,0.00005071029,0.000671061,0.0020017105,0.0012551083,0.0010491972],"domain_scores_gemma":[0.99595624,0.0007020768,0.000411439,0.002291036,0.00037966052,0.00025956408],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007610292,0.0007273785,0.00086651574,0.00076323684,0.00029320986,0.0010827783,0.0060865707,0.0005374018,0.00012999855],"category_scores_gemma":[0.00024787508,0.0006030212,0.00020287775,0.00041449556,0.0011125644,0.0008366436,0.0024958265,0.0010257264,0.0005096753],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000796616,0.00009670812,0.00059129216,0.00013612826,0.00005207066,0.0006214658,0.0016917,0.0034657388,0.00027275414,0.12982807,0.0017427113,0.8614934],"study_design_scores_gemma":[0.00044933896,0.00022316766,0.0015792003,0.0007238338,0.000020586647,0.00020734467,6.890997e-7,0.27995956,0.001198195,0.7077415,0.0064031254,0.0014934709],"about_ca_topic_score_codex":0.00006432459,"about_ca_topic_score_gemma":0.00012468503,"teacher_disagreement_score":0.85999995,"about_ca_system_score_codex":0.00019503987,"about_ca_system_score_gemma":0.0004506564,"threshold_uncertainty_score":0.99995416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012130442,0.0011943858,0.98424554,0.0117955655,0.0013120167,0.00036453723,0.0000010035251,0.0002265709,0.00073909655],"genre_scores_gemma":[0.07295886,0.000035627425,0.92206854,0.0021669394,0.00040741792,0.000008218868,4.2059472e-7,0.000020753048,0.002333223],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971532,0.000030351432,0.00025054658,0.0014200856,0.00060569,0.00054010394],"domain_scores_gemma":[0.9980068,0.00038076786,0.000115040915,0.0010203962,0.000194972,0.00028198506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007404635,0.00044482478,0.00051733106,0.0006228079,0.00022006685,0.0006963482,0.0026914626,0.00035540966,0.0000055597816],"category_scores_gemma":[0.0002837815,0.00037021708,0.000041275263,0.00049640425,0.00078651676,0.0004192765,0.002832113,0.00067731785,0.000020589832],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007971678,0.00001092806,0.000012039471,0.000011337294,0.000015864349,0.000066485205,0.0026665586,0.0022421556,0.00006590248,0.05127399,0.0026427114,0.9409841],"study_design_scores_gemma":[0.00041426107,0.0007964858,0.000068408124,0.00034336228,0.0000140476795,0.00017039682,0.0000012682409,0.081320286,0.00091257464,0.841298,0.07351984,0.0011410589],"about_ca_topic_score_codex":0.00001566689,"about_ca_topic_score_gemma":0.00007187293,"teacher_disagreement_score":0.939843,"about_ca_system_score_codex":0.00014112603,"about_ca_system_score_gemma":0.00045218488,"threshold_uncertainty_score":0.99987495},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034778684,0.00006665251,0.9964521,0.0008342765,0.00012201487,0.00044447047,0.00006946457,0.000015382888,0.0016478362],"genre_scores_gemma":[0.9586567,0.000015676758,0.040138036,0.0011022522,0.00003784054,0.0000041240787,0.000031417752,0.000007837206,0.0000060921243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997769,0.00006383203,0.000543965,0.0005542249,0.0007322905,0.0003367039],"domain_scores_gemma":[0.9975144,0.0007102033,0.0004390443,0.0011760929,0.00011519316,0.000045026325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013461632,0.00022638487,0.0003672815,0.00049159606,0.00011841143,0.00017556446,0.0018149856,0.00013083132,0.000015605709],"category_scores_gemma":[0.00010558388,0.00017245674,0.00006150788,0.0006390043,0.0004325044,0.00046465095,0.00060075923,0.00033385158,0.000008142558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056835825,0.00008648335,0.00003521014,0.00008147988,0.000010060229,0.000012478899,0.006909578,0.0035532706,0.00082956225,0.8151934,0.00020315667,0.1730796],"study_design_scores_gemma":[0.00047317098,0.00019716827,0.0011741862,0.00064287375,0.000009487246,0.000045052107,0.000024015908,0.72321635,0.00076080405,0.27166247,0.00137118,0.00042322197],"about_ca_topic_score_codex":0.00009348309,"about_ca_topic_score_gemma":0.00033173265,"teacher_disagreement_score":0.95830894,"about_ca_system_score_codex":0.00019660486,"about_ca_system_score_gemma":0.00021177407,"threshold_uncertainty_score":0.7032582},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006880341,0.0007882171,0.9956564,0.0005419718,0.0014277141,0.0005456321,0.000023563436,0.00012246007,0.0008252402],"genre_scores_gemma":[0.1438335,0.000057143425,0.85241646,0.0029959,0.00039561358,0.00001744942,0.000060661616,0.000056461882,0.00016683324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958316,0.000075745935,0.000523811,0.0019970164,0.0010879665,0.0004838696],"domain_scores_gemma":[0.99679655,0.0002729947,0.00042414464,0.0018839354,0.00045198094,0.00017038596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085631077,0.00054784,0.00053482654,0.00060763105,0.00044234475,0.0008521144,0.0025973404,0.00029957618,0.0000067485544],"category_scores_gemma":[0.0002809412,0.0004713509,0.000048403897,0.00068181986,0.00045427663,0.000984526,0.000918468,0.00046556955,0.000010150944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010543774,0.00006639548,0.00049261266,0.0002247565,0.00001262422,0.00009692103,0.0006684471,0.012522934,0.000036749105,0.0014621034,0.00008956601,0.98431635],"study_design_scores_gemma":[0.00055862986,0.000113694456,0.0021932644,0.0013092862,0.000015828688,0.000042680567,4.0439522e-7,0.98509294,0.0002893726,0.007937589,0.0016412379,0.00080505706],"about_ca_topic_score_codex":0.00003572181,"about_ca_topic_score_gemma":0.000027686201,"teacher_disagreement_score":0.98351127,"about_ca_system_score_codex":0.00020444224,"about_ca_system_score_gemma":0.0009171291,"threshold_uncertainty_score":0.9997738},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011556107,0.0003988764,0.992489,0.0005138971,0.0019923334,0.0004514018,0.000009612397,0.00019357372,0.003939748],"genre_scores_gemma":[0.036314316,0.0001507209,0.96086925,0.0008578185,0.00058667944,0.0000049484674,0.0000124173375,0.000050064176,0.0011537817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995737,0.00006536848,0.00040433646,0.0024774086,0.0006353255,0.00068054],"domain_scores_gemma":[0.99682534,0.00028167613,0.00031425254,0.0021452801,0.0001728074,0.0002606681],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011948902,0.0006329823,0.00056954566,0.00073953404,0.00039564492,0.00063902646,0.0034239471,0.0006286459,0.00001009329],"category_scores_gemma":[0.000118814634,0.00056696474,0.0000725285,0.00054942834,0.00040704824,0.0010209557,0.002584547,0.0012612044,0.00001178071],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011986756,0.00001640109,0.000013644553,0.00004736548,0.000015574238,0.000074356474,0.0008433607,0.0024083024,0.000117616844,0.0036628623,0.00007663051,0.9927119],"study_design_scores_gemma":[0.00022103064,0.00021634623,0.00004345009,0.0002523468,0.000019281366,0.00037575647,1.180098e-7,0.90497977,0.00026031802,0.08991767,0.00303836,0.0006755521],"about_ca_topic_score_codex":0.000078263554,"about_ca_topic_score_gemma":0.00045933228,"teacher_disagreement_score":0.99203634,"about_ca_system_score_codex":0.00020641582,"about_ca_system_score_gemma":0.00036547158,"threshold_uncertainty_score":0.9996782},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117004596,0.00006771556,0.8609612,0.001380748,0.010571285,0.0013966103,0.000014175828,0.00061224867,0.00799143],"genre_scores_gemma":[0.99071765,0.0000065234435,0.0037715232,0.0025596262,0.000631601,0.000042709922,0.000009535989,0.000090584785,0.002170262],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963359,0.00011006471,0.0004932842,0.0016824575,0.00053634425,0.00084191974],"domain_scores_gemma":[0.99790674,0.00019915901,0.00030549988,0.0013319027,0.00012126285,0.00013544942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010821513,0.00058229355,0.00060786534,0.001482725,0.00033103797,0.00019921972,0.001392412,0.00078612205,0.000112484406],"category_scores_gemma":[0.000081856684,0.0005379397,0.000120294695,0.000398617,0.0005124258,0.000106863066,0.0004365636,0.0014198935,0.0005078796],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012701497,0.00005114188,0.0009318262,0.000025758087,0.000042054282,0.00011774442,0.008150222,0.0015105025,0.0025381916,0.030097377,0.00004630809,0.95636183],"study_design_scores_gemma":[0.014200282,0.014590813,0.021917878,0.0067860275,0.0007281925,0.0023518954,0.00021305101,0.06967383,0.086502135,0.3006142,0.46068296,0.02173874],"about_ca_topic_score_codex":0.00026186,"about_ca_topic_score_gemma":0.0002287062,"teacher_disagreement_score":0.9346231,"about_ca_system_score_codex":0.0002151386,"about_ca_system_score_gemma":0.000074450494,"threshold_uncertainty_score":0.9997072},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00919049,0.0006745073,0.98787576,0.00013792037,0.0013741363,0.00042248936,0.000028264478,0.00026773967,0.000028665629],"genre_scores_gemma":[0.16224857,0.000023551704,0.83678895,0.00023621798,0.00041624493,0.00002517017,0.00005049065,0.00004526377,0.00016557104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594706,0.00007575919,0.00056715583,0.0015128886,0.0012374148,0.0006597002],"domain_scores_gemma":[0.99626,0.0018815756,0.00019443921,0.001157181,0.0002947874,0.0002120532],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010555038,0.00047058027,0.00042814645,0.0010817966,0.00016316421,0.001345686,0.0018044697,0.00031412506,0.000022051994],"category_scores_gemma":[0.0009789848,0.00047626442,0.00007322877,0.0007584057,0.00024083492,0.0019962417,0.00096615043,0.000901535,0.000032423035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008780922,0.00003205077,0.0010815202,0.000036883455,0.0000119486385,0.0034651987,0.0024368558,0.40276754,0.00034394526,0.00067299197,0.00010535387,0.58903694],"study_design_scores_gemma":[0.00075551774,0.00017450741,0.00068823755,0.0006422857,0.0000077371915,0.00067037216,9.846168e-7,0.94335103,0.0013061927,0.050883144,0.00044224475,0.0010777462],"about_ca_topic_score_codex":0.0007319412,"about_ca_topic_score_gemma":0.0006980488,"teacher_disagreement_score":0.5879592,"about_ca_system_score_codex":0.00084506604,"about_ca_system_score_gemma":0.00049933355,"threshold_uncertainty_score":0.9997689},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08862452,0.000056708435,0.90853226,0.002301958,0.00006996011,0.00031146008,0.000004437188,0.000064904336,0.000033768483],"genre_scores_gemma":[0.8282944,0.000005508017,0.17039475,0.0012267863,0.000043630585,0.0000038981257,0.0000019858007,0.000009460066,0.000019589272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982526,0.00010016261,0.00032144782,0.0005280272,0.00063610676,0.00016169275],"domain_scores_gemma":[0.9965999,0.0016724074,0.0004250506,0.001043915,0.00021310474,0.00004563139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008038277,0.0002218979,0.00019887347,0.00030015758,0.00021437946,0.00023997888,0.001613806,0.00014646674,0.0000032695173],"category_scores_gemma":[0.00043939828,0.00012420212,0.000031198655,0.00034106962,0.0013257633,0.00050565513,0.00031505976,0.0004809106,0.0000020786156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006698464,0.000018059249,0.0002778469,0.000023115086,0.0000063296607,0.0000020407456,0.003646668,0.040235084,0.005764733,0.7999761,0.000028639646,0.15001468],"study_design_scores_gemma":[0.00010450757,0.00066460925,0.0024914525,0.0011411328,0.000015483489,0.000015656802,0.0000026468265,0.3691844,0.05243268,0.5734294,0.00005614571,0.0004618695],"about_ca_topic_score_codex":0.00004483335,"about_ca_topic_score_gemma":0.000034482808,"teacher_disagreement_score":0.73966986,"about_ca_system_score_codex":0.000058191577,"about_ca_system_score_gemma":0.00018405213,"threshold_uncertainty_score":0.5064816},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004591162,0.000874206,0.52526295,0.0020260657,0.0012407985,0.0010681753,0.000006660783,0.00021789469,0.46884415],"genre_scores_gemma":[0.91759145,0.00073014566,0.07565482,0.0014085673,0.0014809311,0.000037101818,0.0000052927603,0.000039883118,0.0030518253],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99735963,0.000034337918,0.00032725657,0.0007655063,0.00095481327,0.0005584823],"domain_scores_gemma":[0.9992094,0.00006879838,0.00012923394,0.0003166451,0.00007129823,0.00020461991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005843534,0.00030360068,0.00034716233,0.0005487244,0.0006925181,0.00040119526,0.0009993974,0.00020517837,0.000044608827],"category_scores_gemma":[0.00001409258,0.0002688435,0.000055412896,0.0003022067,0.0008048263,0.00018238263,0.00043866716,0.00025702667,0.000050651684],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043200175,0.0000072810913,0.000042602067,0.000051494204,0.000017197986,0.000075674616,0.003000669,0.00067105226,3.1840057e-7,0.116618596,0.0000068824015,0.8795039],"study_design_scores_gemma":[0.0018737615,0.00019346757,0.007317688,0.003785942,0.00012541136,0.00006121654,0.000047827158,0.02056149,0.00012751146,0.13215385,0.8302751,0.0034767075],"about_ca_topic_score_codex":0.0006255711,"about_ca_topic_score_gemma":0.0013018406,"teacher_disagreement_score":0.9171323,"about_ca_system_score_codex":0.0007649231,"about_ca_system_score_gemma":0.00074761425,"threshold_uncertainty_score":0.9999764},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005373874,0.0002491464,0.99346894,0.0012356703,0.0028067199,0.00065795606,0.000017331613,0.00014938434,0.0013610852],"genre_scores_gemma":[0.08478808,0.000031190302,0.9066957,0.0021464627,0.0024051394,0.000056703313,0.000045422526,0.000059134858,0.003772161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966891,0.000022969083,0.0005235568,0.0014574612,0.0006656723,0.0006412418],"domain_scores_gemma":[0.9974426,0.0007828448,0.00032778087,0.00086239574,0.00040489063,0.00017948993],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008037253,0.00048090087,0.00043628257,0.00083208794,0.00034748012,0.00051110267,0.00200689,0.00027435555,0.000015984058],"category_scores_gemma":[0.00015779956,0.00040590976,0.00015296784,0.00043376882,0.0002873472,0.0007375301,0.00057955406,0.00034238116,0.000028621782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015500123,0.000017427503,0.0000052746755,0.000042069627,0.000018051203,0.000014865396,0.00024012726,0.04199489,0.0027326958,0.04811193,0.000076101205,0.90673107],"study_design_scores_gemma":[0.0006045205,0.00027588246,0.00005529819,0.0003198775,0.000010412468,0.000047263828,9.427635e-8,0.8728807,0.007685175,0.11456848,0.0028176953,0.0007346177],"about_ca_topic_score_codex":0.000004285589,"about_ca_topic_score_gemma":0.0000297198,"teacher_disagreement_score":0.90599644,"about_ca_system_score_codex":0.00026439413,"about_ca_system_score_gemma":0.0007669868,"threshold_uncertainty_score":0.9998393},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04216602,0.00001853787,0.95624775,0.00065557926,0.00012548182,0.00071830023,0.0000045321617,0.000063059626,7.331164e-7],"genre_scores_gemma":[0.49783683,0.0000017647903,0.5018666,0.00022771007,0.000009432232,0.000053426003,9.986613e-7,0.000003071613,1.7382246e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825376,0.00010393889,0.00036744037,0.0005886281,0.00041927418,0.0002669396],"domain_scores_gemma":[0.99842536,0.00075989054,0.00011942095,0.00027904205,0.00028299223,0.00013327812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011711196,0.00014196572,0.000189969,0.00046136059,0.00008761094,0.00014575971,0.0005188355,0.000070353555,4.1511407e-7],"category_scores_gemma":[0.0013402354,0.00012726577,0.000029157336,0.0010727093,0.00046419018,0.00096188346,0.0002617501,0.000162768,3.177741e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024513476,0.0001507951,0.00072765636,0.000049017264,0.0000022000304,0.000001930434,0.007630998,0.057064764,0.16165257,0.000129314,0.000010933916,0.7725553],"study_design_scores_gemma":[0.00069252844,0.00014509301,0.0019842773,0.00006529524,0.0000013314357,0.0000034505247,0.000003590788,0.8389356,0.14136104,0.016696619,1.3974606e-7,0.00011101603],"about_ca_topic_score_codex":0.000056613506,"about_ca_topic_score_gemma":0.00016514827,"teacher_disagreement_score":0.78187084,"about_ca_system_score_codex":0.000132096,"about_ca_system_score_gemma":0.00017491142,"threshold_uncertainty_score":0.5189747},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013017896,0.00017143958,0.9578697,0.0022726904,0.0013743261,0.0002985504,1.8146436e-7,0.00024283971,0.03764008],"genre_scores_gemma":[0.7050721,0.000072518465,0.2799162,0.0037157654,0.0011287186,0.000033481218,0.000011722145,0.00007195148,0.009977529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720955,0.00009546725,0.00038553626,0.00094922516,0.0008513042,0.00050892006],"domain_scores_gemma":[0.9980223,0.00052902283,0.0003540484,0.00070170336,0.00027392516,0.000118993055],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001105557,0.00035124648,0.00027785078,0.00039098904,0.00085836195,0.0016918342,0.0028375261,0.00018533025,0.00023747473],"category_scores_gemma":[0.00026328542,0.0002638173,0.00009120687,0.00062927225,0.00035039167,0.00087049644,0.00097522547,0.001212443,0.00040950373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.431304e-7,0.000016368858,0.00028532016,0.000040610983,0.00001070198,0.000008485482,0.0078292545,0.074704595,0.00009922725,0.11211517,0.00011819515,0.80477124],"study_design_scores_gemma":[0.0000963331,0.00006836976,0.00064317114,0.00026736018,0.000004864104,0.000046797355,0.0000071003337,0.97643757,0.00009273899,0.015860332,0.006039572,0.0004357741],"about_ca_topic_score_codex":0.000035141442,"about_ca_topic_score_gemma":0.00001252061,"teacher_disagreement_score":0.901733,"about_ca_system_score_codex":0.00022555771,"about_ca_system_score_gemma":0.00047141258,"threshold_uncertainty_score":0.9999814},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010861038,0.00056790706,0.9923044,0.00044685105,0.000119764016,0.0003235985,0.000013269408,0.00012834715,0.0050097774],"genre_scores_gemma":[0.050899234,0.00009220073,0.945953,0.0021760066,0.00020170136,0.0000062038926,0.000048144764,0.000045320543,0.0005781673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633753,0.000041102663,0.0005430248,0.0015800486,0.0008984574,0.00059981964],"domain_scores_gemma":[0.9972696,0.00046718508,0.0004428521,0.0012838657,0.00032778893,0.0002087123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051578716,0.0005850998,0.000980068,0.002040853,0.00018685368,0.0002903462,0.0022726643,0.00027204974,0.000029417264],"category_scores_gemma":[0.0000062847853,0.0004745687,0.00016498799,0.002515,0.00054241857,0.00045082628,0.0005782581,0.0005427923,0.000014152158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021654274,0.000024938212,0.000030064712,0.00002446883,0.00016188103,0.000031799293,0.0016226264,0.7665429,0.00008214331,0.0025894614,0.0000015945795,0.22886643],"study_design_scores_gemma":[0.0002331507,0.00029721737,0.000041950032,0.00043282128,0.00019140333,0.000032243195,3.0525146e-7,0.9556291,0.0007514528,0.04165691,0.00018984808,0.00054359913],"about_ca_topic_score_codex":0.00005832938,"about_ca_topic_score_gemma":0.00007544958,"teacher_disagreement_score":0.22832283,"about_ca_system_score_codex":0.00007475796,"about_ca_system_score_gemma":0.00033172456,"threshold_uncertainty_score":0.9997706},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045557163,0.0000959337,0.99587655,0.0005700463,0.0015750164,0.00077172025,0.0000318144,0.00012209921,0.0005012588],"genre_scores_gemma":[0.9541929,0.0000038854364,0.04280371,0.0023993915,0.00042207388,0.00006933958,0.000042489213,0.000014863525,0.00005136913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699765,0.00006499256,0.0005825465,0.0008834352,0.0010797553,0.00039163057],"domain_scores_gemma":[0.99472153,0.002616102,0.0004420982,0.0015803422,0.0005067777,0.00013314623],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010825334,0.00040288406,0.0005241007,0.0007565198,0.00031897755,0.001276744,0.002850231,0.00025945506,0.000029406448],"category_scores_gemma":[0.00028662273,0.00030966583,0.00021056272,0.00054848584,0.00017107875,0.0020980984,0.00046559973,0.00042976043,0.000032437983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015961175,0.000025525416,0.00017960943,0.000005560281,0.00010367756,0.0000031490379,0.0028847493,0.01729824,0.00003910721,0.002365345,0.000102805614,0.9769763],"study_design_scores_gemma":[0.00044010358,0.00037382,0.00032058166,0.00015856295,0.000055455046,0.000004237787,0.0000047460494,0.98155814,0.0015315375,0.011879238,0.0031166,0.00055699016],"about_ca_topic_score_codex":0.00021587519,"about_ca_topic_score_gemma":0.000357056,"teacher_disagreement_score":0.97641927,"about_ca_system_score_codex":0.0003043129,"about_ca_system_score_gemma":0.00031871753,"threshold_uncertainty_score":0.99993557},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041480956,0.0036167812,0.98680294,0.0006479999,0.0031016967,0.0003004312,0.0000036491156,0.00018799385,0.004923695],"genre_scores_gemma":[0.45723236,0.0004897977,0.53691494,0.0012189,0.0010688936,0.000021817114,0.000015493006,0.000058907503,0.002978892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996795,0.000047395188,0.0004470702,0.0013587866,0.0005969015,0.000754825],"domain_scores_gemma":[0.9975406,0.0003556532,0.00025709945,0.0013356267,0.00021464816,0.00029638348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008802413,0.00049119355,0.00049895316,0.00060963526,0.0004324042,0.00067438243,0.0023269292,0.00032355858,0.000032669748],"category_scores_gemma":[0.00010343915,0.0004199998,0.00012165549,0.0004768173,0.00096681295,0.00070690585,0.0010748898,0.00059207936,0.000101360805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039613915,0.00003553535,0.00024868274,0.00003577876,0.000016804654,0.000022101434,0.002711362,0.0006359116,0.0005405084,0.4755364,0.000128626,0.5200843],"study_design_scores_gemma":[0.0009219724,0.00022311679,0.0015300259,0.00039795093,0.00004987461,0.00033314223,0.0000011540712,0.63613355,0.0033629988,0.32735702,0.027222909,0.0024662619],"about_ca_topic_score_codex":0.00003950785,"about_ca_topic_score_gemma":0.00010093427,"teacher_disagreement_score":0.6354977,"about_ca_system_score_codex":0.00014781444,"about_ca_system_score_gemma":0.00034277063,"threshold_uncertainty_score":0.9998252},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009109721,0.0045688925,0.98837143,0.0001139288,0.0017513774,0.0005311825,0.0000017177869,0.000085089414,0.0036653897],"genre_scores_gemma":[0.16296263,0.00013389665,0.8366166,0.000054328302,0.0001469334,0.000012843401,6.23689e-7,0.000027491522,0.00004470695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613786,0.0001269319,0.00089006056,0.0012830648,0.00096821255,0.0005938487],"domain_scores_gemma":[0.9967057,0.00055094727,0.00069232204,0.0015265403,0.0004186341,0.000105832376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002287415,0.00046156358,0.0006957162,0.0011108661,0.00014800904,0.00036423668,0.0031519122,0.0003854632,0.000004919603],"category_scores_gemma":[0.00043167136,0.00043717594,0.00007770982,0.0009096229,0.00064690784,0.00096020574,0.0010925331,0.0007623371,0.000013915026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022812096,0.0000341338,0.00015045115,0.0003231913,0.0000070618653,0.000027882075,0.0016496523,0.1461201,0.00094823027,0.10616732,0.0000013908339,0.7445683],"study_design_scores_gemma":[0.00013645826,0.00012868116,0.0006946021,0.0015356431,0.000005076575,0.00009414112,0.0000014647738,0.9726574,0.0007854365,0.02342495,0.00007023012,0.00046593242],"about_ca_topic_score_codex":0.00012233369,"about_ca_topic_score_gemma":0.000026635253,"teacher_disagreement_score":0.82653725,"about_ca_system_score_codex":0.0004163884,"about_ca_system_score_gemma":0.000539441,"threshold_uncertainty_score":0.999808},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013834097,0.000932578,0.9924679,0.0002005802,0.0012176103,0.00053225324,0.000006988511,0.0003869577,0.0041168053],"genre_scores_gemma":[0.5627958,0.000084493135,0.43587905,0.00051769277,0.0003930192,0.000042805415,0.000017830964,0.000053665506,0.00021562102],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597716,0.00006996808,0.00066811685,0.0014974636,0.0010805655,0.00070674944],"domain_scores_gemma":[0.99762404,0.00023802834,0.0003283883,0.001346845,0.0002871354,0.00017555518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010915227,0.0005700806,0.00060251704,0.0024436042,0.00015757416,0.0004504841,0.003126004,0.00040661285,0.000004833864],"category_scores_gemma":[0.00004720421,0.0005255205,0.00016643459,0.0014385665,0.0005464635,0.0011433266,0.0008536005,0.0008678649,0.000013254692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020997884,0.00007502972,0.0009785722,0.00013974651,0.000017897875,0.0004083552,0.0033804257,0.028222766,0.00025314715,0.07547752,0.00013358885,0.89089197],"study_design_scores_gemma":[0.00047605808,0.0003114045,0.00021335363,0.0012588741,0.0000064516703,0.00009962818,7.01346e-7,0.16919851,0.0017896635,0.8205502,0.0048398348,0.0012552988],"about_ca_topic_score_codex":0.000031077252,"about_ca_topic_score_gemma":0.00010392401,"teacher_disagreement_score":0.88963664,"about_ca_system_score_codex":0.0003150752,"about_ca_system_score_gemma":0.00026130318,"threshold_uncertainty_score":0.9997196},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015351771,0.004448761,0.97784156,0.00023784478,0.00061020436,0.0013105633,0.000013046253,0.00008994156,0.00009631083],"genre_scores_gemma":[0.95910484,0.00017045812,0.039793562,0.00037129817,0.000370674,0.000050483588,0.000022436438,0.000057046982,0.000059190825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980159,0.000018746134,0.00028419215,0.0006689649,0.0006415646,0.00037068102],"domain_scores_gemma":[0.9985204,0.00013623081,0.00034235782,0.00034052657,0.0005147387,0.00014575772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025379474,0.00038499414,0.0005498763,0.0003713554,0.00011867244,0.000059499824,0.00015240845,0.00024775555,0.000017633602],"category_scores_gemma":[0.000026944945,0.00028250154,0.00007540493,0.0005177173,0.0003736807,0.000117413336,0.000040553317,0.0005065751,8.3068295e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001545,0.000083116945,0.006205515,0.00025068558,0.000081733575,0.00003851857,0.00029286803,0.6649102,0.0008287345,0.000012411154,0.000009895645,0.32713184],"study_design_scores_gemma":[0.0016546786,0.0016900155,0.002621608,0.0034473992,0.00029165382,0.00022349875,5.3316364e-7,0.97409457,0.014394567,0.0009544196,0.00018306762,0.00044396863],"about_ca_topic_score_codex":0.00016338237,"about_ca_topic_score_gemma":0.0008002131,"teacher_disagreement_score":0.94375306,"about_ca_system_score_codex":0.0013385209,"about_ca_system_score_gemma":0.001054468,"threshold_uncertainty_score":0.9999627},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1325191,0.06399432,0.78769404,0.00227203,0.007917827,0.0020927512,0.0007021729,0.000046052857,0.002761703],"genre_scores_gemma":[0.94811094,0.0007512402,0.049215134,0.0010327288,0.00061304175,0.000010400927,0.000064262655,0.000019226656,0.00018300636],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99913406,0.000027827835,0.00029557696,0.0002647987,0.00010862487,0.0001691349],"domain_scores_gemma":[0.9989277,0.0001583546,0.0003105331,0.00037242053,0.00020574384,0.000025225154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048831844,0.00016198854,0.00021568495,0.000074529475,0.00012934321,0.000020541915,0.0006474534,0.00050513016,9.590866e-7],"category_scores_gemma":[0.00034382055,0.000088201195,0.00010064902,0.00012239559,0.0012635823,0.0000061517594,0.00092648395,0.00027903693,1.9034205e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035453115,0.000016071162,0.0010267658,0.000492565,0.00003088724,1.6750693e-7,0.002065151,0.00012112504,0.06637072,0.0017091001,0.000048574126,0.9280834],"study_design_scores_gemma":[0.0013665492,0.001113019,0.0027097673,0.0049786344,0.00007967691,0.000068910056,0.000005385689,0.008789568,0.61844265,0.046554096,0.31491494,0.0009768058],"about_ca_topic_score_codex":0.000004363755,"about_ca_topic_score_gemma":0.000063555126,"teacher_disagreement_score":0.9271066,"about_ca_system_score_codex":0.000012666054,"about_ca_system_score_gemma":0.00016290706,"threshold_uncertainty_score":0.46557212},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3911347,0.00007343693,0.60849196,0.00009773941,0.00015073044,0.000024013041,3.8212104e-7,0.000024691983,0.000002333644],"genre_scores_gemma":[0.9810752,0.000007744783,0.018734965,0.00009296248,0.000073444804,0.0000021057253,0.0000104616565,0.0000029608875,1.2248661e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994066,0.00001811963,0.00011139386,0.0001191548,0.0001500524,0.00019469476],"domain_scores_gemma":[0.9997926,0.000055081568,0.000016298727,0.00007081108,0.000010213476,0.00005501089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034145507,0.00006129575,0.00007532355,0.00008878275,0.000046208774,0.00004546154,0.0000720361,0.000028516786,0.0000043198447],"category_scores_gemma":[0.00003229813,0.000055506625,0.000009201176,0.00045272795,0.00006684638,0.0003513931,0.000027054162,0.00012517889,0.0000033193623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012035829,0.000030286004,0.16369344,0.000047387442,0.0000047789704,0.0000031137972,0.0032647147,0.27829227,0.023363339,0.000052522904,0.000013660865,0.5312333],"study_design_scores_gemma":[0.00010523664,0.0000041100952,0.050279185,0.00003354138,0.0000021821295,0.0000042629736,0.0000017453808,0.9418165,0.0068408265,0.000841815,0.000004168813,0.00006640369],"about_ca_topic_score_codex":0.000043278105,"about_ca_topic_score_gemma":0.000009134187,"teacher_disagreement_score":0.66352427,"about_ca_system_score_codex":0.000082096725,"about_ca_system_score_gemma":0.0000069144407,"threshold_uncertainty_score":0.22634944},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35894397,0.030565012,0.6046258,0.0038053722,0.00042313314,0.0006552199,0.000012160223,0.000029897059,0.00093940756],"genre_scores_gemma":[0.9542459,0.0005344198,0.04445785,0.00048658258,0.00024021666,0.000008432367,0.000008276126,0.000012112782,0.000006171635],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985492,0.00008629669,0.00021184047,0.00060477934,0.0002244651,0.00032336873],"domain_scores_gemma":[0.9994253,0.00029749933,0.00008609509,0.00012518073,0.000031006988,0.00003492595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007656374,0.00021780828,0.00027106024,0.00020727383,0.00012226796,0.00008763355,0.00030831306,0.00046187168,0.000001922822],"category_scores_gemma":[0.00017011212,0.00015383019,0.00002469768,0.00008457133,0.002156004,0.0000078066005,0.00035405983,0.00041265614,3.6165812e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020053229,0.000020255746,0.00032265537,0.00005692435,0.000008606764,0.000059683676,0.0037334058,0.0000153394,0.0032206236,0.00016640604,0.0000054070924,0.99237067],"study_design_scores_gemma":[0.022547422,0.010323629,0.14464568,0.02460218,0.0003322753,0.004800146,0.005593331,0.10656978,0.025003944,0.6191701,0.022277322,0.014134167],"about_ca_topic_score_codex":0.000028524617,"about_ca_topic_score_gemma":0.0002113579,"teacher_disagreement_score":0.9782365,"about_ca_system_score_codex":0.000026102685,"about_ca_system_score_gemma":0.00011432386,"threshold_uncertainty_score":0.7943887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011003141,0.00015867318,0.9966509,0.0003798945,0.0003358655,0.00031030067,0.0000016594876,0.0004180213,0.0016346823],"genre_scores_gemma":[0.12807465,0.000047078018,0.8707602,0.00053907355,0.00015029813,0.000017955903,0.0000030645276,0.00003037624,0.00037730046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972729,0.000018433166,0.0003357629,0.0013227626,0.0006249308,0.00042520463],"domain_scores_gemma":[0.9980055,0.0002690238,0.00023084044,0.0011139892,0.00023650986,0.00014412556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005327425,0.0004005893,0.00042612807,0.00050990825,0.0002233075,0.00041134527,0.0012991554,0.00022836881,0.000007941264],"category_scores_gemma":[0.000057785466,0.00033835127,0.00004014823,0.00039014974,0.00082799356,0.00053998077,0.0005803,0.0004948956,0.000015682748],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001302305,0.000016317112,0.00007909279,0.000043905933,0.000008998472,0.00003946578,0.00018068918,0.0035732526,0.00057965517,0.062021073,0.000018602594,0.9334259],"study_design_scores_gemma":[0.0009875221,0.002033862,0.0018665179,0.0012972925,0.000043651442,0.0011304925,5.41855e-7,0.4484191,0.0871101,0.42571485,0.028051702,0.0033443824],"about_ca_topic_score_codex":0.000013278439,"about_ca_topic_score_gemma":0.000043962395,"teacher_disagreement_score":0.93008155,"about_ca_system_score_codex":0.00012840047,"about_ca_system_score_gemma":0.00019636066,"threshold_uncertainty_score":0.99990684},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014419013,0.00031913538,0.9886512,0.00019133043,0.00031082396,0.00080103165,0.000004733053,0.00013287377,0.008146953],"genre_scores_gemma":[0.22543496,0.000039028386,0.7632332,0.0013218321,0.0009570063,0.000060995037,0.0000074717186,0.00017219625,0.008773353],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971607,0.000007948148,0.0003486592,0.0010031897,0.0008989443,0.00058057235],"domain_scores_gemma":[0.9979138,0.0005844281,0.00029588994,0.00079709187,0.00026303277,0.00014580225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000275815,0.0005022889,0.0005445657,0.0011933777,0.00014304086,0.00017009662,0.0009430769,0.0002849707,0.00016368758],"category_scores_gemma":[0.0003353322,0.00035512456,0.00007589456,0.0012330028,0.00051970023,0.00031989574,0.00034701492,0.00079181296,0.000100492136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032628963,0.00014414334,0.00027201677,0.0008718288,0.000061793085,0.00016170865,0.0006910834,0.003996171,0.0000637498,0.09964898,0.00040794825,0.89364797],"study_design_scores_gemma":[0.00032581887,0.00032725325,0.00008419478,0.00066738547,0.00002318168,0.00012356113,3.2506748e-7,0.004754516,0.0006764462,0.9912481,0.0010426182,0.00072661357],"about_ca_topic_score_codex":0.0000021619549,"about_ca_topic_score_gemma":0.000026111566,"teacher_disagreement_score":0.8929213,"about_ca_system_score_codex":0.00018628531,"about_ca_system_score_gemma":0.00036422827,"threshold_uncertainty_score":0.9998901},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000066699125,0.00046145156,0.9913897,0.00046259828,0.0011492951,0.0005421851,0.0000034128052,0.00007744272,0.0058471938],"genre_scores_gemma":[0.8208001,0.00007409608,0.17807081,0.0007320512,0.00020678819,0.000026826618,0.000007152165,0.000029894878,0.000052253843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965554,0.000080368496,0.00075551315,0.0013200761,0.0007474387,0.0005411934],"domain_scores_gemma":[0.99715495,0.00046822728,0.0004728892,0.0016322794,0.0001632781,0.000108385946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013586063,0.0004290913,0.000672562,0.0007302403,0.000071536495,0.00024247894,0.0030805003,0.00035012575,0.000005376338],"category_scores_gemma":[0.000045176483,0.0003706514,0.0001001448,0.00066683226,0.00050262606,0.00026031604,0.00081753754,0.0005913035,0.000029401472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048377783,0.000033953118,0.00014272016,0.00012409576,0.0000058895384,0.000012677712,0.0006459124,0.08443488,0.00001934173,0.1853122,0.000025327146,0.72923815],"study_design_scores_gemma":[0.0002097246,0.000120045785,0.00015823446,0.0002794626,0.0000035589944,0.000026168776,1.6099533e-7,0.815926,0.000062237246,0.18130791,0.0015297515,0.00037674195],"about_ca_topic_score_codex":0.0000860963,"about_ca_topic_score_gemma":0.000036877685,"teacher_disagreement_score":0.8207334,"about_ca_system_score_codex":0.00023759308,"about_ca_system_score_gemma":0.00019741732,"threshold_uncertainty_score":0.99987453},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035666954,0.00011820622,0.9612683,0.00008645653,0.0009960701,0.0005068858,0.000005064676,0.000045459143,0.0013066069],"genre_scores_gemma":[0.9803983,0.000017141703,0.019008514,0.00024176364,0.00017380767,0.000005707035,0.0000010370399,0.000023582825,0.00013012656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739534,0.00014484156,0.0004281505,0.0007707688,0.00086789625,0.0003930292],"domain_scores_gemma":[0.99785954,0.00091522135,0.00039742942,0.0005034703,0.00020343503,0.00012092094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010156892,0.0002715879,0.00030126914,0.00044469346,0.0001788616,0.00014360658,0.0005103239,0.00015691652,0.00012540024],"category_scores_gemma":[0.00063422037,0.00024896336,0.00005091882,0.00018390961,0.0005804625,0.0007044866,0.00019228924,0.00047369336,0.000019140642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031707696,0.00007101854,0.00003548753,0.000040717565,0.0000075571293,0.000012772738,0.0034101405,0.09133033,0.20246969,0.00076061505,0.0000066533057,0.7018233],"study_design_scores_gemma":[0.00022265351,0.0002472631,0.0000558202,0.00019439093,0.00005181276,0.00020195349,0.000002204005,0.689222,0.27850816,0.03070738,0.00021847921,0.00036791814],"about_ca_topic_score_codex":0.000011621934,"about_ca_topic_score_gemma":0.000020081003,"teacher_disagreement_score":0.94473135,"about_ca_system_score_codex":0.00016277039,"about_ca_system_score_gemma":0.00024497116,"threshold_uncertainty_score":0.99999624},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028858753,0.00078687497,0.9940952,0.00017615591,0.0010209322,0.00050102803,0.0000027278984,0.00032233185,0.002806136],"genre_scores_gemma":[0.013272474,0.000086800406,0.98554116,0.00014845465,0.00034564198,0.000024984352,0.0000025858837,0.000035095018,0.00054281024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655056,0.00007366636,0.0006213396,0.0014277146,0.0007524083,0.0005743147],"domain_scores_gemma":[0.9976248,0.0003809402,0.00042295948,0.0011776175,0.00023152256,0.00016217347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015151342,0.0005082888,0.00048511094,0.00058334443,0.00030422184,0.00085723674,0.0022167917,0.00036693036,0.000014825524],"category_scores_gemma":[0.00026256422,0.00046776613,0.00007453119,0.00047410539,0.00047886476,0.0013742475,0.0011538645,0.0009269518,0.000033585675],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017105807,0.000010313353,0.0000194402,0.00003094623,0.000005372839,0.0000048843335,0.0005014128,0.0001786058,0.012742763,0.0067325816,0.00004658466,0.97972536],"study_design_scores_gemma":[0.00017145165,0.00030169467,0.00007965993,0.0019277476,0.000010432243,0.000111860114,6.799348e-7,0.6961096,0.22106738,0.07714726,0.0018484445,0.0012237949],"about_ca_topic_score_codex":0.0000572632,"about_ca_topic_score_gemma":0.0000011322287,"teacher_disagreement_score":0.9785016,"about_ca_system_score_codex":0.00037941453,"about_ca_system_score_gemma":0.00021442203,"threshold_uncertainty_score":0.9997774},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013562444,0.00081937277,0.98456454,0.000021640537,0.00045473655,0.00035063518,0.000026544058,0.00003542873,0.00016465937],"genre_scores_gemma":[0.6368237,0.0000050126487,0.36297002,0.00009335644,0.00007825499,0.0000024432127,0.000006915845,0.000016992566,0.0000032593223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598736,0.000038380284,0.0011441141,0.0010678095,0.001147013,0.00061534974],"domain_scores_gemma":[0.99606353,0.00057326775,0.0014721012,0.0012384708,0.00050177414,0.00015085527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016908351,0.00049525726,0.0013851336,0.0018829841,0.00016388964,0.00010019944,0.0023473823,0.00031134955,0.000009097474],"category_scores_gemma":[0.00014579641,0.00042876106,0.00053394376,0.0020685892,0.00077512546,0.0004390677,0.00060922414,0.00038691793,9.3130765e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026261847,0.00031469646,0.01769349,0.001726723,0.00051536434,0.0000052671744,0.0060825623,0.6318411,0.0053202054,0.00803915,0.0000018885386,0.3284333],"study_design_scores_gemma":[0.0002025516,0.00007185252,0.0009882614,0.00039933616,0.00032085323,0.000002962561,0.000001056867,0.9733135,0.019380895,0.004832468,0.000021997192,0.00046424405],"about_ca_topic_score_codex":0.00008020057,"about_ca_topic_score_gemma":0.000031412743,"teacher_disagreement_score":0.6232613,"about_ca_system_score_codex":0.00014787177,"about_ca_system_score_gemma":0.000787747,"threshold_uncertainty_score":0.9998164},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30602062,0.00057248643,0.45221162,0.00054802425,0.005423961,0.0043758824,0.000023030816,0.0003263669,0.23049802],"genre_scores_gemma":[0.9809176,0.00001009615,0.015178129,0.0003908816,0.00046919764,0.000036096462,0.00001266528,0.000029205727,0.00295617],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99677503,0.000037490106,0.00036290215,0.0010601211,0.00105928,0.00070515025],"domain_scores_gemma":[0.99881893,0.00011359517,0.00012385503,0.00043727478,0.00008689181,0.00041945293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005033729,0.00036064512,0.0004039791,0.0004759943,0.000115380535,0.0008059387,0.0013638868,0.0002487981,0.000061078055],"category_scores_gemma":[0.000102003934,0.0003048492,0.00009001991,0.00039654618,0.00071364676,0.00072649366,0.00034510964,0.0003946034,0.000041284497],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018664225,0.00051895384,0.0012164939,0.00006754044,0.000013828471,0.000043667227,0.21449544,0.007688009,0.0042894343,0.015396233,0.00010035213,0.7561514],"study_design_scores_gemma":[0.008558482,0.007086218,0.062148593,0.011313965,0.00015601353,0.00010464242,0.0046870066,0.15748043,0.09234131,0.122978635,0.504131,0.029013688],"about_ca_topic_score_codex":0.0004349308,"about_ca_topic_score_gemma":0.0007812141,"teacher_disagreement_score":0.7271377,"about_ca_system_score_codex":0.00057667994,"about_ca_system_score_gemma":0.00030016975,"threshold_uncertainty_score":0.99994034},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007176627,0.0003077539,0.9733505,0.0007238129,0.005655343,0.0002629498,0.0000040407494,0.00028011447,0.019343708],"genre_scores_gemma":[0.54556584,0.00023462808,0.40824,0.014517298,0.0047062184,0.000075687654,0.000036243695,0.00024895708,0.026375122],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957804,0.0000638787,0.00039090985,0.0016866582,0.0012464782,0.00083168666],"domain_scores_gemma":[0.99507457,0.00066381996,0.00039272942,0.0035196522,0.00014329051,0.00020592997],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012907863,0.00056067767,0.0005800112,0.00075386005,0.0005674977,0.0014698128,0.009509434,0.00037747715,0.000010670029],"category_scores_gemma":[0.00021028593,0.00048948365,0.00015012998,0.0006232156,0.0007934297,0.00071165775,0.0021387984,0.0010906475,0.0001600455],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004376244,0.00008671301,0.000032465916,0.000040276733,0.000009288764,0.00024003864,0.00059951574,0.0032340742,0.000021651056,0.11778344,0.0012398618,0.87670827],"study_design_scores_gemma":[0.00032057983,0.0002585667,0.00017659263,0.00058488763,0.000004530978,0.000047738,6.736659e-8,0.24147084,0.0007595736,0.7459011,0.009702802,0.00077271165],"about_ca_topic_score_codex":0.00001035338,"about_ca_topic_score_gemma":0.000009821302,"teacher_disagreement_score":0.8759356,"about_ca_system_score_codex":0.0005698395,"about_ca_system_score_gemma":0.0012516569,"threshold_uncertainty_score":0.9997557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022424427,0.0005304788,0.99629253,0.00021320728,0.0007620331,0.00022902717,0.0000037126458,0.00005610141,0.0018904615],"genre_scores_gemma":[0.041521907,0.0002474953,0.95753086,0.00019986395,0.00022657988,0.0000035418132,0.000024797839,0.00001673591,0.00022820567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807245,0.000023550381,0.00033598937,0.00072286103,0.000579203,0.00026592647],"domain_scores_gemma":[0.9985088,0.00016475571,0.00028695934,0.0008465885,0.00011192007,0.00008099377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004694179,0.00022907989,0.00028322855,0.0005277963,0.00010073617,0.0002268227,0.0013328891,0.00011827095,0.000015953621],"category_scores_gemma":[0.000032003107,0.0002060091,0.000041553652,0.00034990566,0.00032587367,0.0012474373,0.0014476677,0.00020627405,0.0000054608377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025770144,0.0000190877,0.000119783515,0.00003701659,0.000005919821,0.000006530421,0.00029566255,0.07234131,0.000073189265,0.013955421,0.000022194241,0.9131213],"study_design_scores_gemma":[0.00019441816,0.00005752554,0.00028764797,0.00020667756,0.0000088178695,0.000010637727,1.6228265e-7,0.9760132,0.0009414662,0.02161773,0.00038995466,0.00027179607],"about_ca_topic_score_codex":0.000017802306,"about_ca_topic_score_gemma":0.0000065632066,"teacher_disagreement_score":0.9128495,"about_ca_system_score_codex":0.000043223645,"about_ca_system_score_gemma":0.000052530264,"threshold_uncertainty_score":0.84008074},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5942278,0.0004263989,0.40441617,0.0002375866,0.00018775488,0.00048118873,0.0000019846325,0.000015813705,0.000005282982],"genre_scores_gemma":[0.63008,0.000014653651,0.36931285,0.00045057537,0.00007165843,0.0000589152,0.0000053790927,0.000005709589,2.8894098e-7],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988751,0.000012371152,0.00021970614,0.0002711441,0.00024620187,0.00037548624],"domain_scores_gemma":[0.99935323,0.000096938216,0.00006706534,0.00022985708,0.00011381885,0.0001390623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043112578,0.00012247871,0.00020964266,0.00011681245,0.00008760195,0.000021953614,0.00014876053,0.00003192937,0.0000055532732],"category_scores_gemma":[0.000018521554,0.00008671699,0.000030930107,0.00040952806,0.00011738175,0.00020461372,0.000045383,0.000063376254,0.0000017662654],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008916094,0.00055134186,0.050760355,0.000049930255,0.000013569358,0.0000016923764,0.0056180884,0.000824364,0.0054308525,0.00002303167,0.0000045041947,0.9366331],"study_design_scores_gemma":[0.0021103686,0.0010102817,0.123557165,0.00016673667,0.000009903389,0.00001403203,0.0000051020124,0.022631219,0.84812057,0.00036521206,0.0018262296,0.0001831867],"about_ca_topic_score_codex":0.000017628838,"about_ca_topic_score_gemma":0.00003420114,"teacher_disagreement_score":0.93644994,"about_ca_system_score_codex":0.00014264004,"about_ca_system_score_gemma":0.00038369314,"threshold_uncertainty_score":0.3536216},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008049855,0.0007064197,0.98720574,0.0012940239,0.0020264473,0.00047317627,0.0000017764032,0.00028845383,0.007923432],"genre_scores_gemma":[0.21538576,0.000037264825,0.77407444,0.0052305222,0.0020266976,0.000064414584,0.0000071278755,0.000085093154,0.003088697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960768,0.000046286346,0.0004071035,0.001451908,0.0010855339,0.0009323501],"domain_scores_gemma":[0.99737746,0.00025374422,0.00022433075,0.0015955885,0.00014610041,0.0004027703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010723573,0.00054684555,0.0004949248,0.0008828208,0.00040687868,0.0005289192,0.0034963333,0.000293068,0.000044944132],"category_scores_gemma":[0.00010713698,0.0004531486,0.00012463672,0.00071875664,0.00021864638,0.00055464264,0.0022405807,0.00084647647,0.00037858455],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034404154,0.00002032982,0.00010904703,0.000022492806,0.0000037813252,0.000028242275,0.0007595056,0.01061635,0.00013654308,0.005740846,0.00013019209,0.9824292],"study_design_scores_gemma":[0.00071104,0.0005690191,0.001060605,0.0025217016,0.000023108918,0.0003591248,6.326525e-7,0.6269499,0.0023021437,0.07669328,0.28564698,0.0031624928],"about_ca_topic_score_codex":0.00003934722,"about_ca_topic_score_gemma":0.000029471192,"teacher_disagreement_score":0.97926676,"about_ca_system_score_codex":0.00022653103,"about_ca_system_score_gemma":0.00024084884,"threshold_uncertainty_score":0.99979204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007058239,0.00016079113,0.9927899,0.0005774933,0.0005944866,0.0006690798,0.000009157163,0.0002930463,0.004200187],"genre_scores_gemma":[0.7578675,0.000027767246,0.23862983,0.0019894063,0.00030967477,0.000029300081,0.000015236972,0.00012399135,0.0010072844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933336,0.00013079269,0.000539893,0.0026659437,0.00204177,0.0012880513],"domain_scores_gemma":[0.99485755,0.00150947,0.00034967702,0.002446021,0.00043587695,0.00040139694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009539568,0.0009054578,0.0007594568,0.0015006143,0.00050026976,0.00074935466,0.004819961,0.00034964125,0.000012870225],"category_scores_gemma":[0.00010209296,0.0007112888,0.00019118254,0.001205893,0.0019764174,0.0005618804,0.0012094568,0.0014703169,0.00007871276],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008260743,0.00011453084,0.00011679529,0.000027411705,0.000038287017,0.00036577278,0.00081394374,0.057165254,0.00033931053,0.15843931,0.000005469844,0.7824913],"study_design_scores_gemma":[0.00071857177,0.003603169,0.0004650163,0.0016265521,0.00002115992,0.00026239507,3.9056397e-7,0.5290819,0.0037224535,0.4566643,0.0018156853,0.0020184068],"about_ca_topic_score_codex":0.000008762898,"about_ca_topic_score_gemma":0.00021308787,"teacher_disagreement_score":0.78047293,"about_ca_system_score_codex":0.0004143594,"about_ca_system_score_gemma":0.00042385157,"threshold_uncertainty_score":0.99953383},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025341353,0.00016923912,0.9983551,0.00005306514,0.00058143877,0.000241139,0.000005922463,0.00022425185,0.00034449456],"genre_scores_gemma":[0.1868627,0.000063785854,0.81264424,0.00008515483,0.00022454801,0.000013381182,0.000022811346,0.000033231197,0.00005015461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990933,0.0000050551653,0.00019370762,0.00037392633,0.00013875392,0.00019524616],"domain_scores_gemma":[0.99922276,0.00038977037,0.00006425774,0.00018981493,0.00009012197,0.000043298252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026565907,0.0001938592,0.00018107345,0.0002801087,0.00016964294,0.00010840403,0.00013473994,0.00009018656,0.0000018730007],"category_scores_gemma":[0.000105310755,0.0002028173,0.000025822568,0.000054973694,0.00009568686,0.00012306844,0.00004701914,0.00021398529,0.0000011270967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012186289,0.0000010651455,9.4712215e-7,0.000049317045,0.000003520305,3.8135474e-7,0.0001108402,0.79249185,0.000116542986,0.003043974,0.0000041365765,0.20417619],"study_design_scores_gemma":[0.0000990607,0.000027017508,0.000017931581,0.0000887487,0.000010310661,0.0000076003917,1.411999e-7,0.91725594,0.0024388523,0.07939155,0.00045621037,0.00020661953],"about_ca_topic_score_codex":0.000006637508,"about_ca_topic_score_gemma":0.000024522367,"teacher_disagreement_score":0.20396957,"about_ca_system_score_codex":0.00014906867,"about_ca_system_score_gemma":0.000028729804,"threshold_uncertainty_score":0.827065},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000341535,0.00093178445,0.9974779,0.00012383223,0.00026863744,0.00021284366,0.000003645473,0.00013368783,0.00050615217],"genre_scores_gemma":[0.60960376,0.00003821623,0.39016655,0.00012379084,0.000019277351,0.000004657202,0.000004991578,0.000015508316,0.000023253224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969256,0.00006211971,0.00082277553,0.0009462169,0.00086690864,0.00037636637],"domain_scores_gemma":[0.99785256,0.00021683359,0.00045599227,0.0008315128,0.00054915645,0.00009395576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011821513,0.00037072302,0.00065116346,0.0012915398,0.00006364972,0.000088696506,0.0022355223,0.00029640517,0.000003994076],"category_scores_gemma":[0.00009820248,0.00035612812,0.00009516615,0.0006609141,0.00044638038,0.00032548452,0.0005277718,0.0003733079,0.0000012678734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104499,0.000033193206,0.000026582416,0.00007636417,0.0000032982819,0.000005238094,0.0002561512,0.90778935,0.000051365227,0.003912599,0.0000019173037,0.087833464],"study_design_scores_gemma":[0.0003714903,0.00012613,0.0000094054585,0.0008314785,0.000004187518,0.0000068631384,9.785409e-8,0.9576709,0.001461939,0.039172668,0.000016774284,0.00032803632],"about_ca_topic_score_codex":0.00008537958,"about_ca_topic_score_gemma":0.000058289796,"teacher_disagreement_score":0.6092622,"about_ca_system_score_codex":0.0002357782,"about_ca_system_score_gemma":0.00095499936,"threshold_uncertainty_score":0.9998891},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025082198,0.000025715479,0.9919305,0.0037353663,0.00010632079,0.00037458126,0.0000076675105,0.00010454763,0.0012071164],"genre_scores_gemma":[0.91045964,0.0000027588167,0.086602785,0.0025942684,0.00020252944,0.00000830981,0.0000200016,0.000020340514,0.00008937519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985282,0.000015851556,0.00017628903,0.00066757656,0.00042518612,0.00018694282],"domain_scores_gemma":[0.99866796,0.0006235252,0.000068741865,0.00036016168,0.00012627768,0.00015335505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030115276,0.00019863062,0.0002503918,0.00022828112,0.000100596255,0.00003137998,0.0000984862,0.00014697605,0.00002389719],"category_scores_gemma":[0.00022308635,0.00017382379,0.000040237308,0.00011933038,0.00058193225,0.00004767762,0.00009565907,0.0006309025,0.0000056145213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075871794,0.00040923155,0.007514211,0.00014488121,0.000021150418,0.00019963259,0.00017819289,0.086536154,0.006675704,0.058526944,0.0010895643,0.83794564],"study_design_scores_gemma":[0.0005649864,0.00028152144,0.0058380384,0.00013858265,0.000012071514,0.000058093614,4.8334854e-8,0.9348786,0.0006101721,0.055424783,0.0019847644,0.0002083431],"about_ca_topic_score_codex":0.0000037497618,"about_ca_topic_score_gemma":0.0000037010886,"teacher_disagreement_score":0.9079514,"about_ca_system_score_codex":0.00016947745,"about_ca_system_score_gemma":0.00022785534,"threshold_uncertainty_score":0.7088328},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014065517,0.00042508976,0.9932818,0.00052196975,0.001492924,0.00028468468,0.0000035414741,0.000097276024,0.002486153],"genre_scores_gemma":[0.38820836,0.00003630444,0.60908705,0.0012795422,0.0009810987,0.000008553989,0.000038875725,0.000026966309,0.00033326828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996571,0.00003417813,0.0006096947,0.0012121868,0.0010228346,0.0005501068],"domain_scores_gemma":[0.99832946,0.00045901426,0.00022988592,0.00060088723,0.0002421098,0.0001386704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011833904,0.00039662057,0.00034628704,0.0018421088,0.00019919321,0.00036419698,0.0014445113,0.00030366506,0.000029109286],"category_scores_gemma":[0.00007638502,0.0004089078,0.00010275073,0.0011301392,0.00027874138,0.00077268557,0.0005714788,0.00063494686,0.000053754942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007657592,0.000031157953,0.00013435789,0.000011902575,0.000003720483,0.000043917804,0.0002995361,0.33131075,0.00013070312,0.03519669,0.000013078804,0.6328165],"study_design_scores_gemma":[0.00032343992,0.00010959003,0.004047566,0.00017795003,0.0000036324561,0.0000687502,1.3669288e-7,0.9085075,0.0011795089,0.08347128,0.0015203448,0.00059026846],"about_ca_topic_score_codex":0.000021803608,"about_ca_topic_score_gemma":0.00016791665,"teacher_disagreement_score":0.6322262,"about_ca_system_score_codex":0.00038100904,"about_ca_system_score_gemma":0.0005447504,"threshold_uncertainty_score":0.99983627},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001086567,0.0002325526,0.9932393,0.0004444289,0.0013651903,0.000219392,0.0000048360416,0.00009371556,0.004291956],"genre_scores_gemma":[0.13518623,0.000028062197,0.85824996,0.0010386069,0.0016118009,0.000009050011,0.000012843841,0.0000394981,0.003823921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972715,0.000032584878,0.00053318415,0.0009645014,0.0008436773,0.00035457523],"domain_scores_gemma":[0.9978218,0.000543731,0.00038033238,0.0007454752,0.00040858577,0.00010006542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083953526,0.0003166177,0.00037892873,0.0008141443,0.00015393509,0.00012614632,0.0013643462,0.0002120464,0.000050624316],"category_scores_gemma":[0.000114676644,0.00026524015,0.00012554196,0.0006097659,0.00026787334,0.0005531871,0.0006745135,0.00029731222,0.000098954326],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007903875,0.000017486193,0.000012531204,0.000025936739,0.00001077789,0.000008209121,0.000107898806,0.029600117,0.0016518402,0.02960596,0.00002861512,0.9389227],"study_design_scores_gemma":[0.00031991795,0.00028302832,0.00012711946,0.00043736168,0.000009824865,0.000034976285,3.6140396e-8,0.851413,0.00375143,0.14011277,0.0030409228,0.00046959225],"about_ca_topic_score_codex":0.0000032284795,"about_ca_topic_score_gemma":0.000005377532,"teacher_disagreement_score":0.93845314,"about_ca_system_score_codex":0.00013467616,"about_ca_system_score_gemma":0.00046225227,"threshold_uncertainty_score":0.99998},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063370494,0.00025977884,0.99413675,0.00009175609,0.0007978428,0.00030729253,0.00000872742,0.00020574567,0.0035584192],"genre_scores_gemma":[0.26427054,0.00003342691,0.73539543,0.00013569705,0.00009993642,0.0000044367075,0.0000019401573,0.000026204167,0.000032385455],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683374,0.000047737103,0.0005823987,0.0011365431,0.00088010327,0.000519461],"domain_scores_gemma":[0.99658936,0.00050871825,0.00056418317,0.002019674,0.00022465884,0.00009340615],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010818425,0.00046298435,0.0005012068,0.0006433922,0.00022258378,0.0003756652,0.007006203,0.00025298903,0.000015343894],"category_scores_gemma":[0.00013844046,0.00033275218,0.00011855133,0.0006024015,0.0014005604,0.00088114967,0.002080666,0.00066044845,0.0000060690595],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004171789,0.00002744872,0.000380267,0.00004789537,0.00002035572,0.0000213504,0.0017649054,0.0031333356,0.00028161964,0.0407346,0.000037247373,0.9535468],"study_design_scores_gemma":[0.00017609262,0.0003480266,0.0005501338,0.0019375718,0.00003856069,0.00016109282,8.526921e-7,0.38510597,0.025054574,0.5843747,0.0010807696,0.0011716618],"about_ca_topic_score_codex":0.00015861473,"about_ca_topic_score_gemma":0.00006256043,"teacher_disagreement_score":0.9523751,"about_ca_system_score_codex":0.00013494062,"about_ca_system_score_gemma":0.0005625504,"threshold_uncertainty_score":0.99991244},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006110143,0.000438353,0.9839412,0.0026755354,0.0009687254,0.0005000433,0.000009825666,0.00020265598,0.011202557],"genre_scores_gemma":[0.26685187,0.00011321274,0.72779477,0.0039265137,0.00034240517,0.000018603558,0.000014569732,0.000050672064,0.0008873657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964024,0.000066238215,0.00060891634,0.0013565732,0.0009728971,0.0005930216],"domain_scores_gemma":[0.99736255,0.0005111086,0.00036354386,0.0010899962,0.0004169795,0.00025578894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012345535,0.0005835456,0.00049196207,0.0005223551,0.00044166425,0.0009799188,0.0019807017,0.00033033267,0.00003340648],"category_scores_gemma":[0.00022529559,0.0004365284,0.0000986474,0.0005146917,0.0014917912,0.00073719444,0.0010584091,0.0010039143,0.000017199243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049325035,0.0000117095,0.000040263432,0.00001687469,0.000013680095,0.000023427214,0.0018160562,0.20933846,0.000060540737,0.08038165,0.00021873588,0.7080737],"study_design_scores_gemma":[0.00028451052,0.00007220229,0.000037543003,0.00017390434,0.00000964323,0.0001606425,0.0000017509703,0.9008613,0.00006410347,0.09703717,0.0008263273,0.00047087483],"about_ca_topic_score_codex":0.000033222757,"about_ca_topic_score_gemma":0.0002484495,"teacher_disagreement_score":0.7076028,"about_ca_system_score_codex":0.00025303522,"about_ca_system_score_gemma":0.0010663085,"threshold_uncertainty_score":0.99980867},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007784566,0.0004175381,0.9961331,0.00033529778,0.0020673135,0.00039133418,0.000005669717,0.00017995312,0.00039197115],"genre_scores_gemma":[0.80563706,0.000019311263,0.19170259,0.0007196452,0.0013153423,0.000019417606,0.0000125534325,0.00003323048,0.0005408498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967827,0.000028924005,0.000519806,0.0012353644,0.0006974806,0.0007356959],"domain_scores_gemma":[0.99813336,0.00042900658,0.00032846295,0.00047348038,0.00046107973,0.00017459223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009922973,0.00046978958,0.00051331153,0.0005434696,0.00031225051,0.00049243245,0.0019238367,0.00035167515,0.000039858744],"category_scores_gemma":[0.00008072462,0.00042065274,0.00024041934,0.00040900373,0.0002412898,0.00059867377,0.00044914393,0.00057586416,0.000041485637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007394341,0.000041328356,0.000060673134,0.00005553112,0.00003627602,0.0000074373784,0.00095105957,0.0643421,0.000036902158,0.27195802,0.00015148302,0.6623518],"study_design_scores_gemma":[0.00017369042,0.00015090343,0.000034426732,0.00020508103,0.000021721838,0.000038605947,1.9625135e-7,0.99086976,0.0001919354,0.0037929032,0.0039980193,0.00052273885],"about_ca_topic_score_codex":0.000011504573,"about_ca_topic_score_gemma":0.0001366173,"teacher_disagreement_score":0.9265277,"about_ca_system_score_codex":0.00032929945,"about_ca_system_score_gemma":0.0003314879,"threshold_uncertainty_score":0.9998245},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001970094,0.0005906534,0.99100006,0.0005741776,0.0033077747,0.00066246965,0.000007592152,0.0002819657,0.003555611],"genre_scores_gemma":[0.22715269,0.000020610358,0.7689702,0.0017474478,0.0014738146,0.000042944866,0.000013709426,0.000060089264,0.0005185312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956813,0.00004435226,0.00079527235,0.0018931408,0.0008305045,0.0007554156],"domain_scores_gemma":[0.99583286,0.0012051153,0.0005431554,0.001753223,0.00048385622,0.00018180255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016801825,0.00054372475,0.0006711845,0.00065060094,0.00058746396,0.000857778,0.0038959414,0.00041278027,0.000010034689],"category_scores_gemma":[0.00022844989,0.00054515246,0.00022813262,0.00042316227,0.0005037186,0.00036567976,0.00091442734,0.0006306095,0.000029804973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049264163,0.000023909253,0.000025465994,0.00020642372,0.000017682018,0.000011744493,0.0013613513,0.112041585,0.00008003866,0.24266963,0.00010011324,0.6434571],"study_design_scores_gemma":[0.00023893868,0.000100978534,0.000013102345,0.0005062063,0.0000068658455,0.000053153042,1.7876233e-7,0.8649258,0.00032584727,0.1290527,0.004199161,0.0005770517],"about_ca_topic_score_codex":0.000014003525,"about_ca_topic_score_gemma":0.000024675579,"teacher_disagreement_score":0.7528842,"about_ca_system_score_codex":0.00029530036,"about_ca_system_score_gemma":0.00057453266,"threshold_uncertainty_score":0.9997},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011029577,0.00055143004,0.9937871,0.00059747405,0.0018571002,0.0003452178,0.00004518959,0.00016462417,0.0025415428],"genre_scores_gemma":[0.073457904,0.000042836877,0.9215928,0.0031396218,0.0010230014,0.000025982086,0.00002620202,0.000047098238,0.0006445661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590695,0.000026237836,0.0006533218,0.0016345129,0.0010731926,0.0007057796],"domain_scores_gemma":[0.9975862,0.00033806256,0.00026918284,0.0013146133,0.00027066362,0.00022129492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044883523,0.00057147373,0.000583359,0.00048903003,0.00038104138,0.00034473336,0.0020694365,0.00027332173,0.00014862616],"category_scores_gemma":[0.00005335255,0.0005261194,0.00016131898,0.0003194407,0.00076540734,0.0017591362,0.0010376713,0.00078239513,0.00017256249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030797094,0.000025744037,0.000007672399,0.000045270415,0.000019555158,0.000072734016,0.0026937863,0.108890004,0.0001500698,0.584832,0.00017765956,0.3030824],"study_design_scores_gemma":[0.0002058587,0.00007343486,0.0000046424316,0.00039739814,0.000003972524,0.00008115702,0.0000011492506,0.8726951,0.00039633934,0.12087763,0.004602023,0.00066131714],"about_ca_topic_score_codex":0.000046914138,"about_ca_topic_score_gemma":0.000029714356,"teacher_disagreement_score":0.7638051,"about_ca_system_score_codex":0.00025787167,"about_ca_system_score_gemma":0.00049923506,"threshold_uncertainty_score":0.999719},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037239564,0.00010701732,0.98984826,0.00020031957,0.0014256964,0.00090135774,0.000016914295,0.0011053483,0.00267115],"genre_scores_gemma":[0.18030807,0.000031247928,0.81741273,0.0008865059,0.0010676257,0.000049466573,0.000055403507,0.0000849951,0.00010394138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947672,0.00012125287,0.0009207403,0.0021105602,0.0011966582,0.00088357914],"domain_scores_gemma":[0.9962551,0.0003227648,0.0005022449,0.0017573128,0.0007814359,0.0003811584],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008164606,0.00078033505,0.0007767998,0.0016556362,0.0003703466,0.0014920682,0.003229984,0.00068158226,0.0000685647],"category_scores_gemma":[0.000093188566,0.00071288005,0.00017692467,0.0008503724,0.00056383596,0.0023566827,0.00079949695,0.001180365,0.00029919413],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064181227,0.00005554772,0.00002034239,0.00009439977,0.000012790111,0.00013911891,0.00017707782,0.0003033263,0.003369127,0.0036769947,0.00001600816,0.99212885],"study_design_scores_gemma":[0.0003293029,0.00040018398,0.00034958712,0.0016574936,0.000029567113,0.00068037235,3.4763428e-7,0.9163442,0.014779008,0.063768074,0.00021444974,0.0014473941],"about_ca_topic_score_codex":0.000073384464,"about_ca_topic_score_gemma":0.000018141372,"teacher_disagreement_score":0.99068147,"about_ca_system_score_codex":0.00060939667,"about_ca_system_score_gemma":0.00044734837,"threshold_uncertainty_score":0.9995445},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030054047,0.00020458477,0.97537595,0.0014740725,0.0015865075,0.0007872754,0.000004210796,0.00020877986,0.020328555],"genre_scores_gemma":[0.030715108,0.00002130323,0.966973,0.0011642381,0.00043652052,0.000029997365,0.000001146236,0.000030396955,0.00062830036],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99574786,0.00016279526,0.00064353645,0.0016227441,0.0011149158,0.00070814666],"domain_scores_gemma":[0.9956023,0.000900777,0.00046565908,0.0026320766,0.00027141056,0.0001277411],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0044329795,0.0004940764,0.00046133334,0.00033680163,0.0004679907,0.00069976563,0.0059771296,0.00029938403,0.000013656997],"category_scores_gemma":[0.00032999934,0.00030226054,0.00014928127,0.00046806014,0.0013039308,0.000991285,0.0017429284,0.0009881123,0.00006505997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037397951,0.000013078264,0.00003485992,0.000025130199,0.0000057507973,0.00000531323,0.0006144815,0.0017569956,0.00008921016,0.27877137,0.000009647809,0.7186704],"study_design_scores_gemma":[0.00024601835,0.0001410773,0.00023140782,0.00036439896,0.0000076735005,0.00008542667,1.6617825e-7,0.27530885,0.0013990649,0.71537524,0.0061241114,0.0007165633],"about_ca_topic_score_codex":0.0000123150185,"about_ca_topic_score_gemma":0.000015697118,"teacher_disagreement_score":0.71795386,"about_ca_system_score_codex":0.00042929867,"about_ca_system_score_gemma":0.00050890824,"threshold_uncertainty_score":0.99994296},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012665002,0.0002744466,0.9813331,0.0017155216,0.0024724533,0.00035521007,0.000009101833,0.0002677411,0.013559813],"genre_scores_gemma":[0.037532475,0.00010083314,0.9513445,0.008127894,0.0010167194,0.000027403876,0.000008282791,0.000050244675,0.0017916466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955922,0.00006643142,0.00048166368,0.0017933324,0.0011644643,0.00090193393],"domain_scores_gemma":[0.9972573,0.00043367821,0.00019842993,0.0017652119,0.00012330902,0.00022207724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061924587,0.0005854611,0.00052805623,0.0007582367,0.0004005619,0.0007244277,0.004323575,0.00040554735,0.000041514686],"category_scores_gemma":[0.00002247571,0.0004969576,0.00019726831,0.0013134581,0.00047705803,0.00070392375,0.00023747914,0.0012147275,0.00021257113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030002775,0.00006302999,0.0000015385544,0.000012259162,0.0000058542414,0.000058250527,0.00046332894,0.12443862,0.0000029290459,0.00081078423,0.00030634447,0.8738341],"study_design_scores_gemma":[0.00033159804,0.00034324528,0.00006896241,0.00024808568,0.000008093075,0.000099475845,8.676037e-8,0.9202941,0.0002140794,0.06175507,0.015794009,0.0008431759],"about_ca_topic_score_codex":0.000014177813,"about_ca_topic_score_gemma":0.0000617401,"teacher_disagreement_score":0.8729909,"about_ca_system_score_codex":0.00063039415,"about_ca_system_score_gemma":0.0010809522,"threshold_uncertainty_score":0.99974823},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011694153,0.00009458219,0.9923082,0.0019111121,0.0004787562,0.00024669085,0.00012814606,0.000056166136,0.004659399],"genre_scores_gemma":[0.21106938,0.000049595597,0.7757631,0.0023707268,0.0011389478,0.00005445002,0.00015369401,0.00007605192,0.009324072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975912,0.000032478787,0.00037595144,0.0007346778,0.0009572063,0.00030847927],"domain_scores_gemma":[0.9970525,0.0010418387,0.00047570345,0.0011287007,0.00023574957,0.000065501394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012436925,0.00026774162,0.00033108453,0.00018893606,0.00015827052,0.00041981516,0.0025477961,0.00014870295,0.000010753607],"category_scores_gemma":[0.00024954427,0.00018862705,0.00007870524,0.00034751842,0.00050618465,0.00047678323,0.00057224144,0.00040582358,0.000061594714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060835687,0.00007489124,0.00006205506,0.00001897356,0.000027598717,0.000011962164,0.0005605731,0.0040497053,0.00012668222,0.6779073,0.0022845224,0.31486967],"study_design_scores_gemma":[0.00022341659,0.00017498134,0.00009170502,0.00038415275,0.0000101332525,0.0000094346815,3.297062e-7,0.52844054,0.0004540781,0.4649193,0.0047987313,0.00049319584],"about_ca_topic_score_codex":0.000019837802,"about_ca_topic_score_gemma":0.000016155896,"teacher_disagreement_score":0.5243908,"about_ca_system_score_codex":0.00029136962,"about_ca_system_score_gemma":0.0004974025,"threshold_uncertainty_score":0.7691988},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014621307,0.00015921303,0.9892532,0.00090162543,0.0032985203,0.000721493,0.0000028272373,0.00028641842,0.0052304612],"genre_scores_gemma":[0.58367366,0.000033416472,0.40835652,0.0047273897,0.0013972189,0.000039409784,0.0000044826515,0.00008730069,0.0016806005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99429065,0.00009735159,0.00078701245,0.002508369,0.001174311,0.0011423263],"domain_scores_gemma":[0.9950335,0.0012691155,0.0003319484,0.0026170544,0.00027955737,0.00046884225],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016252873,0.00081392255,0.0009330642,0.00092929293,0.00030967616,0.0009531613,0.00599742,0.0003997191,0.00004167888],"category_scores_gemma":[0.00023715093,0.0007388372,0.00019946127,0.0008671286,0.000531098,0.00045852983,0.0031216757,0.0013140391,0.0003415535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027708176,0.0000159226,0.00003182682,0.000054916367,0.000014462943,0.000106895,0.0011738227,0.2363192,0.00016673299,0.028584387,0.00017401132,0.73333013],"study_design_scores_gemma":[0.0006375079,0.00030147226,0.000044147644,0.0013597773,0.000010426048,0.00012355711,1.3361962e-7,0.94316405,0.0012570559,0.047018524,0.004832023,0.0012513517],"about_ca_topic_score_codex":0.00002397327,"about_ca_topic_score_gemma":0.0001302066,"teacher_disagreement_score":0.7320788,"about_ca_system_score_codex":0.00039166887,"about_ca_system_score_gemma":0.0003544169,"threshold_uncertainty_score":0.9995063},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065854425,0.0026629579,0.98368394,0.00015052824,0.0016165143,0.00025714387,0.000038357557,0.000035415076,0.010896572],"genre_scores_gemma":[0.799644,0.0010553765,0.17982121,0.0016217383,0.008294524,0.000060103706,0.00021949915,0.00024472526,0.009038843],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974895,0.000041189807,0.00033988437,0.0010831996,0.0006113241,0.00043487374],"domain_scores_gemma":[0.9981479,0.000043411746,0.00021735192,0.001137657,0.00027963152,0.00017403286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007137934,0.00040245036,0.00033052414,0.00025584697,0.000132035,0.00010953585,0.0010153468,0.0004995419,0.000039474457],"category_scores_gemma":[0.00023366258,0.0003704052,0.00012730322,0.00013910152,0.00025778235,0.000007865399,0.00070724596,0.0002218251,0.000020892388],"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.00014673379,0.00008116288,0.00002482483,0.00008629558,0.000084378415,0.00006452153,0.00015522192,0.04105096,0.590167,0.007694092,0.0028839726,0.35756084],"study_design_scores_gemma":[0.0011335036,0.0016031854,0.000018514602,0.001167919,0.00008079201,0.00014230509,8.014473e-7,0.08361092,0.6722948,0.06283839,0.1752066,0.0019022902],"about_ca_topic_score_codex":0.000013344382,"about_ca_topic_score_gemma":0.000017397231,"teacher_disagreement_score":0.80386275,"about_ca_system_score_codex":0.00010438344,"about_ca_system_score_gemma":0.00027838803,"threshold_uncertainty_score":0.9998748},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018929955,0.00093714637,0.99250704,0.00034630476,0.00071184296,0.00031978014,0.00001720822,0.000099895915,0.0048714555],"genre_scores_gemma":[0.048995093,0.00029882358,0.94835365,0.0011528886,0.00038557214,0.000009167608,0.000010482201,0.000050984534,0.00074331206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996925,0.000040911247,0.00041412018,0.0014386539,0.0006201097,0.0005612117],"domain_scores_gemma":[0.9979881,0.00028882994,0.00019476039,0.0012188961,0.000116557276,0.00019284833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008362688,0.00044975392,0.00053832005,0.0006199886,0.00015676407,0.00026724796,0.0021415628,0.00030806437,0.000048519327],"category_scores_gemma":[0.00005244136,0.000386993,0.000059992897,0.0004067555,0.0007232598,0.0007152156,0.0023739226,0.0007827964,0.00007025985],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032189244,0.000113132795,0.00049653876,0.00007228452,0.0000123756145,0.00093391736,0.0023612143,0.0014212646,0.00030975003,0.07278749,0.00012240728,0.9213374],"study_design_scores_gemma":[0.0008135464,0.00029832553,0.0007880066,0.0008856314,0.000007378598,0.00022781434,1.6096527e-7,0.7766647,0.0005841051,0.21386522,0.00466644,0.001198697],"about_ca_topic_score_codex":0.000116920586,"about_ca_topic_score_gemma":0.000075378885,"teacher_disagreement_score":0.9201387,"about_ca_system_score_codex":0.00012824243,"about_ca_system_score_gemma":0.00030655996,"threshold_uncertainty_score":0.9998582},"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":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006461104,0.0028107096,0.9874953,0.00046024247,0.001613473,0.00033065997,0.000047415455,0.000021259977,0.0007598389],"genre_scores_gemma":[0.7058325,0.0004717466,0.29010817,0.0006690493,0.0021378575,0.0000067018536,0.00042708727,0.00003766287,0.00030926464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974478,0.00017453349,0.001062663,0.0007436148,0.00037343192,0.00019797316],"domain_scores_gemma":[0.9978107,0.00051649567,0.00045295173,0.0010329717,0.000108520464,0.00007836448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00807124,0.00018549687,0.00068159617,0.00016192986,0.000020630649,0.000027328722,0.0012322334,0.00060172006,0.000013314583],"category_scores_gemma":[0.0062970994,0.00014251212,0.00007971381,0.000116476906,0.00078062835,0.0000081026365,0.00079157285,0.00036255873,0.0000041187027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018624338,0.000026461421,0.00025812312,0.000029493853,0.00001133857,0.000006885594,0.00003903242,0.0002558316,0.00046598242,0.00006597502,0.00021288605,0.99860936],"study_design_scores_gemma":[0.0049154595,0.0035871165,0.004145854,0.0026059032,0.00013018027,0.000088499284,0.0000034167024,0.78911614,0.007063571,0.0960106,0.09027129,0.0020619675],"about_ca_topic_score_codex":0.000013890692,"about_ca_topic_score_gemma":0.00011832587,"teacher_disagreement_score":0.9965474,"about_ca_system_score_codex":0.000019263458,"about_ca_system_score_gemma":0.00069813034,"threshold_uncertainty_score":0.7538671},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019868137,0.00027819493,0.98240936,0.0008856705,0.0028075073,0.00035176292,0.000009218658,0.00026776394,0.012970636],"genre_scores_gemma":[0.0561229,0.0002989616,0.9332644,0.0079206005,0.00077715266,0.00003553338,0.000011836555,0.00006549342,0.0015031763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955405,0.000070327886,0.00047164745,0.0018036788,0.0012291374,0.00088468107],"domain_scores_gemma":[0.99720305,0.00045488842,0.00019875224,0.0017852511,0.00013573036,0.0002223546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044641792,0.00058732054,0.0005534421,0.00077228923,0.0005305787,0.00049592217,0.004244069,0.0004049933,0.000017662778],"category_scores_gemma":[0.00002481464,0.0004980237,0.0002078755,0.0014569572,0.0006474828,0.0006185388,0.0002368128,0.0012135892,0.00017504003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040209834,0.000081340164,0.0000036411448,0.00001696545,0.000008051526,0.00021639853,0.0008455698,0.094842635,0.0000034233003,0.0012737646,0.00043246074,0.90227175],"study_design_scores_gemma":[0.00042127192,0.00052980764,0.00012460236,0.0003033472,0.000007946235,0.0003456991,1.03135044e-7,0.89035076,0.00034955406,0.09411474,0.012346152,0.0011060316],"about_ca_topic_score_codex":0.00002191617,"about_ca_topic_score_gemma":0.000032065705,"teacher_disagreement_score":0.9011657,"about_ca_system_score_codex":0.0005313534,"about_ca_system_score_gemma":0.0013129181,"threshold_uncertainty_score":0.99974716},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004910555,0.00019027636,0.99760216,0.000040846524,0.00051762274,0.000168259,0.000021603342,0.000067388995,0.0013427184],"genre_scores_gemma":[0.12329437,0.000033707525,0.876154,0.00020461364,0.0000952294,0.0000052630685,0.000099889985,0.000036848676,0.0000760722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854183,0.000021555337,0.0002724342,0.00047514966,0.00046230564,0.0002267179],"domain_scores_gemma":[0.9990075,0.00019289335,0.00010848267,0.00045174823,0.00012846403,0.00011086863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036604868,0.00029720002,0.00048095206,0.0004892212,0.00005629337,0.00008793581,0.0003351699,0.00023611628,0.000059391547],"category_scores_gemma":[0.000037170026,0.00027060276,0.00007796585,0.00047088967,0.00019188534,0.00009398021,0.00008603013,0.00018765453,0.0000020013592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014342052,0.00000770321,0.000023619594,0.000023352148,0.000050016926,0.0000060905395,0.000074967385,0.97205204,0.0000028877105,0.006527511,0.000006234719,0.021211235],"study_design_scores_gemma":[0.0001837306,0.00003847386,0.00018857766,0.0001506351,0.00013899624,0.0000015452403,4.6561345e-7,0.9741797,0.000007679987,0.02484547,0.0000044812414,0.0002602564],"about_ca_topic_score_codex":0.000008440939,"about_ca_topic_score_gemma":0.00009392137,"teacher_disagreement_score":0.12324526,"about_ca_system_score_codex":0.00025195128,"about_ca_system_score_gemma":0.00008071779,"threshold_uncertainty_score":0.9999746},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025531292,0.0006267509,0.99382687,0.00010953372,0.0023263001,0.00041788165,0.000037153055,0.00013995093,0.0022602228],"genre_scores_gemma":[0.5910219,0.000019195497,0.40413728,0.0010744153,0.0016568374,0.00002748739,0.000069190966,0.00008569959,0.001907961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973771,0.000017003777,0.00034914957,0.0010145352,0.00062024634,0.00062195724],"domain_scores_gemma":[0.9984522,0.0001808469,0.00022777428,0.0006770166,0.00029639812,0.00016577415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015652897,0.0004035846,0.00032620196,0.00035280242,0.00021899279,0.0009895798,0.0016637678,0.00017191435,0.00004071357],"category_scores_gemma":[0.000033065193,0.0003901455,0.00016497534,0.0002344673,0.00056477805,0.0009178211,0.0007407518,0.00032231346,0.000029836805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031565098,0.00044945217,0.00046459478,0.00031214394,0.00007657725,0.00010192676,0.000177626,0.6933426,0.0005285358,0.022731578,0.0027343973,0.279049],"study_design_scores_gemma":[0.00031270302,0.00006647621,0.00013410741,0.00013839421,0.000025452357,0.000032889595,3.0218565e-8,0.98127824,0.0002340524,0.017139891,0.00020329577,0.00043445738],"about_ca_topic_score_codex":0.000007711605,"about_ca_topic_score_gemma":0.0000020606274,"teacher_disagreement_score":0.5907666,"about_ca_system_score_codex":0.00012899436,"about_ca_system_score_gemma":0.0002828136,"threshold_uncertainty_score":0.99985504},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008725255,0.00011660439,0.954511,0.0005741369,0.00045768364,0.0005138923,0.00000863027,0.00012393147,0.04360689],"genre_scores_gemma":[0.1628892,0.00026542024,0.7340989,0.006180983,0.0012677509,0.000148551,0.00004246123,0.00008069706,0.09502604],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950556,0.00004789538,0.00071840914,0.0014056137,0.0023222514,0.0004502364],"domain_scores_gemma":[0.99642557,0.0010765952,0.00028904187,0.001681733,0.00039369162,0.00013338383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00178417,0.00029568136,0.00040535475,0.0010735194,0.0003825913,0.00044968067,0.0031123746,0.00021004089,0.00014474343],"category_scores_gemma":[0.00021363028,0.00022889944,0.0001334021,0.0024043235,0.00076895143,0.00023455074,0.0008698786,0.00041220136,0.00033181708],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002676246,0.000027480499,0.00008849603,0.0000055098762,0.000003256141,0.000019347151,0.00012728965,0.14187936,0.0000048099005,0.0045355116,0.0076026088,0.84570366],"study_design_scores_gemma":[0.0001493471,0.00003913763,0.00046217145,0.000087901986,0.0000046018954,0.000019308307,3.8977896e-7,0.2708924,0.00018237988,0.54156184,0.18623054,0.00036994411],"about_ca_topic_score_codex":0.000015564015,"about_ca_topic_score_gemma":0.000021610376,"teacher_disagreement_score":0.8453337,"about_ca_system_score_codex":0.00041099355,"about_ca_system_score_gemma":0.00045710074,"threshold_uncertainty_score":0.9334249},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0348586,0.0007524699,0.9623394,0.00045002732,0.0011803249,0.0002382582,0.0000011187385,0.00014556274,0.000034244047],"genre_scores_gemma":[0.5630045,0.000021848735,0.4366646,0.0002159629,0.00007499787,0.0000050012472,0.0000014525826,0.000008617242,0.0000030230453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967108,0.00021866843,0.0004988288,0.0012655917,0.00079181005,0.00051434897],"domain_scores_gemma":[0.99777997,0.00040401667,0.0004018791,0.00081946456,0.00036117155,0.00023351937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021717825,0.00033589892,0.00048294608,0.0006279707,0.00017097706,0.00057848566,0.0022582402,0.00022403838,0.000002623106],"category_scores_gemma":[0.0007379656,0.00031856794,0.00007130685,0.0011740905,0.00055755273,0.00047072922,0.0039606034,0.001213695,0.0000071470604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037446478,0.000041329877,0.0049909633,0.0000636413,0.000007272406,0.000020191786,0.007371846,0.60346043,0.0008843357,0.00022806882,0.000003930538,0.38292426],"study_design_scores_gemma":[0.00036356415,0.00007997444,0.007205795,0.00022014808,0.000003549561,0.000022203476,0.0000035752116,0.9853145,0.00093462947,0.0054016183,0.000110424924,0.00034000055],"about_ca_topic_score_codex":0.00009514773,"about_ca_topic_score_gemma":0.00001987969,"teacher_disagreement_score":0.5281459,"about_ca_system_score_codex":0.00012380413,"about_ca_system_score_gemma":0.0006728012,"threshold_uncertainty_score":0.9999266},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005773232,0.00002838368,0.97834283,0.0009906224,0.009557859,0.00039875862,0.00004532306,0.000121718294,0.00993721],"genre_scores_gemma":[0.5410269,0.0000052362816,0.43501955,0.004740585,0.001299233,0.000022948676,0.000036812617,0.0000669281,0.01778182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9863613,0.00009445365,0.0010534435,0.0036593443,0.007849147,0.0009823117],"domain_scores_gemma":[0.99154806,0.0035399604,0.00047068976,0.0030471953,0.001016953,0.00037716693],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.013535674,0.0005022452,0.00056683045,0.004318524,0.0014471116,0.0034742546,0.008418643,0.0002481473,0.00036486037],"category_scores_gemma":[0.0018187108,0.00039744494,0.00019532483,0.0064947135,0.0047725057,0.00083316246,0.0007044189,0.0015289132,0.00082761433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005512183,0.000060821254,0.000013745709,0.000004026162,0.000002653558,0.000016240216,0.00027627053,0.3712758,0.000035163852,0.0007172846,0.0010073871,0.62658507],"study_design_scores_gemma":[0.0002533013,0.00013032794,0.0005523045,0.00013173079,0.000008201036,0.00003211945,0.0000013998532,0.71918774,0.00034698972,0.2598427,0.018957933,0.0005552829],"about_ca_topic_score_codex":0.000020060861,"about_ca_topic_score_gemma":0.00011887576,"teacher_disagreement_score":0.6260298,"about_ca_system_score_codex":0.0005763545,"about_ca_system_score_gemma":0.0035162244,"threshold_uncertainty_score":0.99995035},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016287335,0.0011545571,0.9944475,0.0009869273,0.00057857024,0.0002555212,0.00017046646,0.00015646782,0.0006212478],"genre_scores_gemma":[0.3414396,0.00009890199,0.65824914,0.00005852814,0.000059485847,0.000004075326,0.000057679146,0.0000134155825,0.000019141879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955514,0.000059582406,0.0009225846,0.0013452932,0.0015683608,0.0005527636],"domain_scores_gemma":[0.9874471,0.0011172697,0.00093699247,0.01009473,0.00028650364,0.000117404525],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0014915525,0.00044984638,0.00092668546,0.0026878696,0.00010443305,0.000093941235,0.03472913,0.00039366356,0.00006545375],"category_scores_gemma":[0.0038540922,0.0004069573,0.00022394677,0.0026650364,0.0013765127,0.0013706784,0.050008234,0.0008102487,0.0000064286905],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022383616,0.0003274295,0.0043341722,0.0002806104,0.00069797307,0.00003653639,0.0012512128,0.022054289,0.0015076225,0.07138468,0.0006526995,0.8974504],"study_design_scores_gemma":[0.00022237479,0.00010402007,0.0050025764,0.0003652442,0.00019092612,0.000010551576,2.4974818e-7,0.6771684,0.0044684634,0.3114361,0.0004194229,0.0006116557],"about_ca_topic_score_codex":0.00004161561,"about_ca_topic_score_gemma":0.000037785878,"teacher_disagreement_score":0.8968387,"about_ca_system_score_codex":0.0001786134,"about_ca_system_score_gemma":0.0004975429,"threshold_uncertainty_score":0.99983823},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015639212,0.0002762754,0.9827976,0.0003215182,0.00043084996,0.00035433596,0.000028941076,0.000015127463,0.00013612508],"genre_scores_gemma":[0.86257136,0.00006791678,0.13514346,0.00060421624,0.00021743691,0.00003134543,0.00006531652,0.000036754293,0.0012621973],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99839497,0.00006141102,0.0002090529,0.0007369543,0.00033690518,0.00026071304],"domain_scores_gemma":[0.9987312,0.0003990592,0.00016962002,0.0005158215,0.00012566768,0.00005866387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004091467,0.00024739502,0.0001711726,0.00011443595,0.00021666578,0.000080032805,0.00040778643,0.000296132,0.000028308174],"category_scores_gemma":[0.00044919673,0.00015549076,0.000027531085,0.0002093298,0.00033261918,0.0000097185875,0.00016509196,0.0004538732,0.0000014828618],"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.00037122137,0.000040978117,0.0016223541,0.000017364126,0.0000073127444,0.0000025111501,0.00013865592,0.0032721423,0.9602849,0.00017369137,0.0003744858,0.033694394],"study_design_scores_gemma":[0.0020642523,0.0013132466,0.006246866,0.0009532488,0.000033083285,0.00007818373,0.00000440384,0.05108401,0.84013695,0.03141514,0.06520817,0.001462472],"about_ca_topic_score_codex":0.000099473014,"about_ca_topic_score_gemma":0.0006385696,"teacher_disagreement_score":0.84765416,"about_ca_system_score_codex":0.000060616916,"about_ca_system_score_gemma":0.00032763692,"threshold_uncertainty_score":0.63407296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040748455,0.0004363082,0.9950069,0.00008476028,0.0025884411,0.00047407762,0.000006514005,0.0004150925,0.0009471581],"genre_scores_gemma":[0.15350923,0.000062462255,0.8429458,0.00038844836,0.0023280906,0.000090034664,0.00005278394,0.0002458686,0.00037726155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975747,0.000008530456,0.00057815824,0.0006507838,0.0007364956,0.00045137102],"domain_scores_gemma":[0.9983729,0.0006185482,0.00010772485,0.00064943376,0.00009887166,0.00015251065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090164645,0.00038833194,0.00041543224,0.0004365649,0.000103722625,0.00010865034,0.0009854336,0.00038591455,0.000042682164],"category_scores_gemma":[0.00024936904,0.00039643707,0.00009139817,0.00017077697,0.00014425856,0.000120957484,0.00015586714,0.00047054933,0.000054625096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030090027,0.0000037500547,0.000042358086,0.00033470054,0.000023339868,0.000009069417,0.00019553171,0.4527277,0.00012844053,0.0012188699,0.00009154447,0.5452217],"study_design_scores_gemma":[0.0002889066,0.0000434891,0.00011829309,0.0016005081,0.000010148013,0.00003633541,7.8297596e-8,0.9224791,0.00061335735,0.004133511,0.07008255,0.000593723],"about_ca_topic_score_codex":0.0000026366665,"about_ca_topic_score_gemma":0.000008697528,"teacher_disagreement_score":0.54462796,"about_ca_system_score_codex":0.000431671,"about_ca_system_score_gemma":0.00013219823,"threshold_uncertainty_score":0.9998487},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029096622,0.00052575115,0.9946151,0.00036115892,0.0010093177,0.0009849382,0.000011076761,0.0005718122,0.0018917779],"genre_scores_gemma":[0.09192088,0.00019262916,0.9053829,0.0009949039,0.0002693946,0.00009450094,0.00003859893,0.00006010329,0.0010461381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966725,0.000032872114,0.00053456123,0.0015845022,0.0005986608,0.0005768808],"domain_scores_gemma":[0.99755216,0.0002905481,0.0003869345,0.0009777592,0.0006579642,0.0001346083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008552504,0.000505135,0.00045951383,0.000992603,0.0002796139,0.0003474429,0.0022615772,0.00060578325,0.000031674237],"category_scores_gemma":[0.0001058977,0.000495614,0.0001701443,0.00062285265,0.00030283484,0.00073710893,0.00040032947,0.0007623407,0.000044025044],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010146551,0.000031969987,0.0000029936411,0.00004114942,0.000008782539,0.000004135051,0.00022173641,0.000507131,0.0026945104,0.012022413,0.00006345473,0.98439157],"study_design_scores_gemma":[0.00024775436,0.00044129894,0.000029915911,0.00028613844,0.000013955016,0.00006286783,5.8929157e-8,0.49937597,0.042464353,0.4522118,0.0041707777,0.00069513265],"about_ca_topic_score_codex":0.000011995081,"about_ca_topic_score_gemma":0.00011031682,"teacher_disagreement_score":0.98369646,"about_ca_system_score_codex":0.00038587145,"about_ca_system_score_gemma":0.0004622035,"threshold_uncertainty_score":0.99974954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059059076,0.00025464807,0.9924717,0.00035790118,0.0019249952,0.00031072524,0.0000012270999,0.00018320074,0.003905038],"genre_scores_gemma":[0.36714578,0.00000861122,0.6312205,0.0005183892,0.00045832724,0.0000033932602,0.0000018276013,0.000028480557,0.00061467895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963898,0.00004135455,0.0006077188,0.0014570932,0.0009009041,0.0006031514],"domain_scores_gemma":[0.99746764,0.0002456257,0.00023042489,0.0016185391,0.00027780535,0.00015997341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007703857,0.00043231223,0.000470632,0.0007255917,0.0003720981,0.00043977262,0.0026535857,0.0003755224,0.000028835231],"category_scores_gemma":[0.00011860251,0.00043169982,0.00012430058,0.00048447034,0.00017400912,0.0004515544,0.0010763961,0.0007579945,0.000052218806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011142273,0.0000059564236,0.00003787809,0.000014979007,0.0000055895894,0.000018827212,0.0003134823,0.8124517,0.00007953823,0.039355006,0.0000017779164,0.14771415],"study_design_scores_gemma":[0.00015079473,0.000029353869,0.0000043659147,0.00019146009,0.000007764316,0.00003458195,8.701596e-8,0.84146965,0.00006759453,0.15748501,0.0001643851,0.000394931],"about_ca_topic_score_codex":0.00006131384,"about_ca_topic_score_gemma":0.00008962863,"teacher_disagreement_score":0.36655518,"about_ca_system_score_codex":0.00042375101,"about_ca_system_score_gemma":0.0007826167,"threshold_uncertainty_score":0.9998135},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008143558,0.00022305801,0.9806564,0.001328167,0.0016186648,0.00033318767,0.0000045553447,0.00026029252,0.015567531],"genre_scores_gemma":[0.029190928,0.0000775264,0.9592183,0.009920789,0.0005504866,0.000015754173,0.0000074615978,0.000036160938,0.0009825958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995859,0.00006525488,0.00043904933,0.0016951085,0.0011025533,0.000838999],"domain_scores_gemma":[0.9974256,0.000377613,0.00018345221,0.001691749,0.00011669137,0.00020488948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058852194,0.0005520265,0.00051580527,0.00074524,0.000369397,0.0007101985,0.0040857987,0.00038166903,0.000019648143],"category_scores_gemma":[0.000022847773,0.0004660873,0.00018579137,0.0013763127,0.00037631573,0.0005829932,0.00015264079,0.0011356719,0.00012949604],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027578699,0.000062294006,9.3753084e-7,0.0000097794245,0.0000042053553,0.00008809324,0.00034855228,0.08441584,0.00000208968,0.00076865725,0.00036573576,0.9139311],"study_design_scores_gemma":[0.0003014387,0.0005773608,0.00010331384,0.0002784315,0.0000073643655,0.00009814576,5.9365444e-8,0.79363567,0.000218732,0.1976067,0.0063529,0.0008199042],"about_ca_topic_score_codex":0.0000113882625,"about_ca_topic_score_gemma":0.000028751627,"teacher_disagreement_score":0.91311115,"about_ca_system_score_codex":0.00050716876,"about_ca_system_score_gemma":0.0009931762,"threshold_uncertainty_score":0.9997791},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013454073,0.00075634656,0.99570423,0.0004739038,0.0004334728,0.00043892092,0.0000052792307,0.00014961757,0.0006928185],"genre_scores_gemma":[0.6028166,0.00012760091,0.39649534,0.0002895994,0.00019084717,0.000012286363,0.000027254575,0.000017257964,0.000023239469],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972881,0.0000364354,0.0003631304,0.0011972538,0.00068953435,0.00042552667],"domain_scores_gemma":[0.99772686,0.0002251408,0.00034173718,0.0013005274,0.0002500334,0.00015571299],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074625196,0.00035797345,0.00030015604,0.00059118215,0.00026594102,0.00048560396,0.0012981178,0.00020812116,0.000009584078],"category_scores_gemma":[0.00006818189,0.0003105984,0.000047935773,0.00062786735,0.000538632,0.0015013758,0.0006174213,0.00043649419,0.000014503218],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015007627,0.00004614586,0.00012503855,0.00007146613,0.0000108829045,0.0000074235554,0.004539253,0.00053192663,0.00066541624,0.09297696,0.000008330787,0.90100217],"study_design_scores_gemma":[0.0010458184,0.0007104805,0.00985025,0.0010844683,0.00007355934,0.0002812783,0.0000019562078,0.22875997,0.008678274,0.7446186,0.0027938404,0.0021015012],"about_ca_topic_score_codex":0.0000150886035,"about_ca_topic_score_gemma":0.000041042036,"teacher_disagreement_score":0.8989006,"about_ca_system_score_codex":0.00011632591,"about_ca_system_score_gemma":0.00022504244,"threshold_uncertainty_score":0.9999346},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055119568,0.0035374125,0.98998344,0.00023497337,0.00023914488,0.00043081408,0.000052715288,0.0000016376673,0.000007910231],"genre_scores_gemma":[0.9504329,0.00043877313,0.048368797,0.0001691821,0.00037429994,0.000009979617,0.00016014252,0.000011930497,0.000034001223],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991152,0.00003727678,0.0002987234,0.0003474603,0.00008804409,0.000113243776],"domain_scores_gemma":[0.99909157,0.00011329292,0.00021033997,0.0004342958,0.00014038231,0.00001015305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010818731,0.000118391545,0.00018820548,0.000070274946,0.000023367524,0.00001324927,0.00045645185,0.00012875343,6.741986e-7],"category_scores_gemma":[0.00012302204,0.00007414984,0.000025223124,0.00006362826,0.00021405063,0.0000063402103,0.00014704447,0.00012131068,8.263164e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027527482,0.000013254435,0.000031625746,0.000097096636,0.000019335695,8.0276784e-8,0.0003030862,0.13352743,0.77395076,0.00013392411,0.000035325455,0.09186057],"study_design_scores_gemma":[0.00044476092,0.00032356582,0.00021372129,0.00018739923,0.00004376447,0.000032010328,0.000004119041,0.9324618,0.056424487,0.006365246,0.0032445146,0.00025461984],"about_ca_topic_score_codex":0.000033193213,"about_ca_topic_score_gemma":0.000009834884,"teacher_disagreement_score":0.94492096,"about_ca_system_score_codex":0.0000069486346,"about_ca_system_score_gemma":0.00006808853,"threshold_uncertainty_score":0.30237424},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016020251,0.0015347524,0.9925163,0.000103408245,0.0018030793,0.00036829666,0.000016894568,0.000015824868,0.0020394176],"genre_scores_gemma":[0.3470108,0.000056665736,0.64865804,0.0005043779,0.002599936,0.000023237746,0.000056621393,0.000054821656,0.0010355423],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984141,0.000012012826,0.00027170972,0.0007066619,0.00019468408,0.00040080625],"domain_scores_gemma":[0.99908316,0.00006649371,0.000146256,0.00046610666,0.00013172062,0.00010623921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026837763,0.00029084674,0.00023489479,0.00016681924,0.00014213395,0.000060705544,0.000464596,0.00034303506,0.0000228068],"category_scores_gemma":[0.000071796276,0.0002799326,0.00010478887,0.00007805362,0.00043011346,0.000006938493,0.00019244601,0.0002308975,0.000008460836],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000369621,0.00002163126,0.00012836145,0.00006606868,0.000022961029,6.557461e-7,0.00015193954,0.011375187,0.0040174574,0.0048774695,0.000056317655,0.979245],"study_design_scores_gemma":[0.0037000207,0.004208021,0.0046412046,0.0016384436,0.00028673286,0.0011313425,0.0000057219268,0.024886526,0.08277421,0.7654263,0.10572582,0.005575681],"about_ca_topic_score_codex":0.000004054199,"about_ca_topic_score_gemma":0.000033094304,"teacher_disagreement_score":0.9736693,"about_ca_system_score_codex":0.00003716577,"about_ca_system_score_gemma":0.00021702911,"threshold_uncertainty_score":0.9999653},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006637,0.00010879207,0.98398393,0.0025328307,0.0014621785,0.00042208354,0.000007630332,0.00024083162,0.011175329],"genre_scores_gemma":[0.20575848,0.000018081397,0.7869647,0.0046562077,0.00031397594,0.00006103517,0.000032231554,0.000051737356,0.0021435558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966419,0.00003874514,0.00048190972,0.0014117648,0.00083719357,0.00058851705],"domain_scores_gemma":[0.9970345,0.0006166553,0.00027382877,0.0015069948,0.00034639458,0.00022165626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035882485,0.00044686126,0.0003727068,0.0007808056,0.00031839783,0.00074123626,0.0024722926,0.00039663646,0.00019060753],"category_scores_gemma":[0.0001304574,0.0003955339,0.00014331221,0.0005214497,0.0005187384,0.00083113357,0.0005897242,0.00067234837,0.0007104342],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003610763,0.00010695683,0.000061439896,0.000027749142,0.000007113425,0.000022186256,0.00021554095,0.0062548965,0.005119429,0.0056580077,0.00095441873,0.98156863],"study_design_scores_gemma":[0.0003314292,0.000116551746,0.00016905027,0.00037625065,0.000005735073,0.000013117954,1.9217195e-7,0.91526455,0.009402933,0.05105923,0.022591839,0.00066912826],"about_ca_topic_score_codex":0.00002206943,"about_ca_topic_score_gemma":0.000053517742,"teacher_disagreement_score":0.9808995,"about_ca_system_score_codex":0.00024616774,"about_ca_system_score_gemma":0.00044394363,"threshold_uncertainty_score":0.9998497},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004061092,0.000060840917,0.9738763,0.0017027627,0.006966804,0.00046963867,0.000007927276,0.0001892508,0.012665383],"genre_scores_gemma":[0.98819244,0.000044352993,0.00181422,0.005212959,0.00094155886,0.000009412198,8.7834513e-7,0.000053543794,0.0037306214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969315,0.00009365941,0.00042908697,0.0012351789,0.0007123268,0.000598275],"domain_scores_gemma":[0.99679667,0.0017924365,0.00029303768,0.0009016433,0.00009545417,0.000120782206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027499069,0.00046725667,0.00041166024,0.00041069617,0.00053788355,0.00050574547,0.0016843322,0.0002486202,0.00012355542],"category_scores_gemma":[0.0005937641,0.00033165558,0.00016732253,0.00033774244,0.0009382906,0.00026834387,0.00057817507,0.0015659723,0.00040218022],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006196544,0.000059041886,0.000018515297,0.000051137828,0.000016448073,0.00016542265,0.0035807595,0.06325522,0.064308226,0.0050994325,0.000595998,0.86278784],"study_design_scores_gemma":[0.0006844255,0.0006412007,0.000055443492,0.0010560249,0.000055455053,0.0010895092,0.0000061334677,0.36902386,0.36421692,0.02406397,0.23706612,0.0020409273],"about_ca_topic_score_codex":0.0000211591,"about_ca_topic_score_gemma":0.000089544315,"teacher_disagreement_score":0.98413134,"about_ca_system_score_codex":0.0002372062,"about_ca_system_score_gemma":0.00020173435,"threshold_uncertainty_score":0.9999136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012314036,0.00021685456,0.9923957,0.00081896887,0.0015495229,0.00040965652,0.00001443222,0.0003308507,0.004140859],"genre_scores_gemma":[0.005740442,0.00013662015,0.9917921,0.0006723816,0.0004943461,0.000019785892,0.000016207296,0.00003133422,0.0010968222],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962777,0.000040648625,0.00060990424,0.0015299643,0.0010212405,0.0005205296],"domain_scores_gemma":[0.99736017,0.0002532748,0.0004144044,0.00138509,0.00039583934,0.0001912293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005073856,0.00048892933,0.0004586802,0.00059712195,0.00023678759,0.0008423397,0.0027151357,0.0003635239,0.0002798572],"category_scores_gemma":[0.00006468123,0.00044139204,0.00015227892,0.000498751,0.00075673836,0.0012928087,0.0008046399,0.0007696491,0.00037718503],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027717035,0.00001837173,0.000025388157,0.000010913343,0.000010298644,0.000019569554,0.000118485215,0.000025627909,0.0020740284,0.007042007,0.0000412968,0.99061126],"study_design_scores_gemma":[0.0002279225,0.000111682355,0.000263267,0.00030452572,0.000010251562,0.00006683473,1.6293521e-7,0.42654988,0.026954219,0.54212165,0.0025656691,0.0008239231],"about_ca_topic_score_codex":0.00003777442,"about_ca_topic_score_gemma":0.000009369224,"teacher_disagreement_score":0.98978734,"about_ca_system_score_codex":0.00029137093,"about_ca_system_score_gemma":0.00041440147,"threshold_uncertainty_score":0.9998038},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007473321,0.00062182004,0.9659047,0.000028480685,0.00394019,0.0007917824,0.000013718573,0.00014998154,0.021076022],"genre_scores_gemma":[0.99489117,0.000007185906,0.004586515,0.00005612529,0.0002258043,0.000010143374,0.0000015030058,0.00002967678,0.00019187077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987683,0.000019357489,0.0002653251,0.0003391984,0.00034306245,0.00026472515],"domain_scores_gemma":[0.9991455,0.00016964432,0.00009542764,0.00049941655,0.000051659576,0.00003833503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030834117,0.00025701075,0.00029459246,0.00022594478,0.00007022621,0.000057188267,0.00086160656,0.00018420977,0.000033417553],"category_scores_gemma":[0.000017958148,0.0001775859,0.00009042373,0.00023082798,0.00037208118,0.00011797217,0.00017250617,0.00046738764,0.000017137443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016568467,0.000037196212,0.0003041933,0.00090860674,0.00013883723,0.000029312834,0.007898841,0.5223043,0.011181041,0.1073739,0.00019825611,0.34960893],"study_design_scores_gemma":[0.0004838762,0.00021580687,0.0007566846,0.003334228,0.000040507006,0.00015368138,0.000004377728,0.59395486,0.018634614,0.3777992,0.0031756607,0.0014464909],"about_ca_topic_score_codex":0.000017387481,"about_ca_topic_score_gemma":0.000026481908,"teacher_disagreement_score":0.9874179,"about_ca_system_score_codex":0.00008367414,"about_ca_system_score_gemma":0.0000377603,"threshold_uncertainty_score":0.72417426},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039560095,0.0011893071,0.9927323,0.0009941419,0.0009095464,0.00066206465,0.000007683979,0.00026881768,0.0028405713],"genre_scores_gemma":[0.2523986,0.000056139455,0.7453985,0.0012157282,0.00045578732,0.000044055574,0.000008017169,0.000052413514,0.00037071112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958715,0.000036794514,0.00055775064,0.0016493041,0.0008270214,0.001057648],"domain_scores_gemma":[0.9970334,0.0006239459,0.00030146848,0.0014864303,0.00032152398,0.00023323768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095179473,0.00069134176,0.00073466974,0.00052041747,0.00034544885,0.0006678762,0.0036064934,0.0003694315,0.000014480459],"category_scores_gemma":[0.00010327176,0.0005123284,0.00013633339,0.0004121145,0.00076186925,0.0009419229,0.00061062974,0.0007559891,0.000023195738],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004011496,0.000041514424,0.0002163686,0.00011926007,0.00003618306,0.00004452619,0.002482919,0.0018799428,0.0002764057,0.051732,0.000067841844,0.9430629],"study_design_scores_gemma":[0.0037856698,0.003210497,0.0009770573,0.005189326,0.00017803862,0.0010667748,0.0000109951925,0.7949178,0.0098552,0.1393405,0.035102356,0.006365754],"about_ca_topic_score_codex":0.000044230364,"about_ca_topic_score_gemma":0.00024323874,"teacher_disagreement_score":0.9366972,"about_ca_system_score_codex":0.0001916703,"about_ca_system_score_gemma":0.00059189205,"threshold_uncertainty_score":0.99973285},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028246248,0.0003153985,0.9927143,0.00027867514,0.0012762842,0.0005242548,0.00000802571,0.00018391649,0.001874523],"genre_scores_gemma":[0.97031814,0.0000035167545,0.0276286,0.00035899575,0.00035209168,0.000010499174,0.0000126689465,0.000034052293,0.00128143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963319,0.00007334927,0.0006066277,0.0012982347,0.0011862196,0.0005037274],"domain_scores_gemma":[0.9971975,0.00027208045,0.00034480053,0.001219049,0.0007533509,0.0002132245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012400302,0.00042936756,0.00046163404,0.00078270125,0.00031318358,0.0007378213,0.0023332343,0.00027925803,0.000034095905],"category_scores_gemma":[0.00012879033,0.00041326633,0.0001142886,0.000469217,0.00078218384,0.00078923686,0.0008789238,0.0004923746,0.000093513074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018867337,0.0003588983,0.0011044141,0.00041409337,0.00012616962,0.00011474926,0.18183522,0.0024886033,0.0018794223,0.57464427,0.00015323728,0.23686203],"study_design_scores_gemma":[0.00042173415,0.00013477697,0.0002737823,0.00072023267,0.000026107607,0.00006796259,0.0000037633629,0.6353899,0.00063851924,0.3598137,0.0016133292,0.00089614955],"about_ca_topic_score_codex":0.000056993304,"about_ca_topic_score_gemma":0.00008182352,"teacher_disagreement_score":0.96749353,"about_ca_system_score_codex":0.00043198257,"about_ca_system_score_gemma":0.0006305998,"threshold_uncertainty_score":0.9998319},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013122657,0.0005501653,0.9933709,0.00029701836,0.0014024215,0.0003763131,0.0000017914464,0.00016355365,0.0037066138],"genre_scores_gemma":[0.13958359,0.00003771151,0.85903347,0.000921926,0.00023766309,0.000012250299,0.0000029389048,0.000027849677,0.00014258568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599195,0.00006560652,0.0006814064,0.0013892441,0.0009765524,0.0008952384],"domain_scores_gemma":[0.997474,0.00019735146,0.00036753042,0.0016314215,0.00015568132,0.00017397372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002569822,0.00052263215,0.0005292929,0.0010523552,0.00015208172,0.00034179498,0.004133717,0.00045034543,0.000012052789],"category_scores_gemma":[0.00015353602,0.0004938717,0.000111314264,0.0007653253,0.00052358385,0.0014000874,0.0015364175,0.0011127156,0.00005275145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005075886,0.000042146945,0.00036072228,0.00004175036,0.0000038480034,0.000029065835,0.0012100562,0.18825282,0.00029647484,0.19891155,0.000005605881,0.61084086],"study_design_scores_gemma":[0.00012384162,0.00004381618,0.0002836044,0.00017237653,0.0000024535157,0.000029868392,6.887794e-8,0.81196666,0.0007068758,0.18594606,0.00024379246,0.00048059324],"about_ca_topic_score_codex":0.000027382177,"about_ca_topic_score_gemma":0.000050595896,"teacher_disagreement_score":0.62371385,"about_ca_system_score_codex":0.0005432821,"about_ca_system_score_gemma":0.00045853716,"threshold_uncertainty_score":0.99975127},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031098519,0.0012069712,0.99296886,0.00076311675,0.00056088966,0.00085451244,0.000023180346,0.000051696432,0.00046093165],"genre_scores_gemma":[0.65927863,0.00013755955,0.33453164,0.0030680883,0.0006756787,0.000019013394,0.00016991439,0.00006310165,0.0020563458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764246,0.000022309998,0.00043668106,0.00084770063,0.0005964988,0.00045432374],"domain_scores_gemma":[0.99836385,0.00063412025,0.00019729475,0.00046514292,0.0002047182,0.00013484524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006182548,0.00038697696,0.00063894683,0.00034757215,0.00012239852,0.00011088324,0.00035296744,0.00032277082,0.000049674836],"category_scores_gemma":[0.00014458835,0.0003295615,0.00010348955,0.00023780845,0.00095358724,0.00013819197,0.000089472924,0.0005906404,0.000011055073],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015391636,0.0004798284,0.0009465717,0.0012133593,0.00011909356,0.00046369332,0.003848819,0.077045575,0.031634998,0.027510673,0.0015867415,0.85361147],"study_design_scores_gemma":[0.025084488,0.0052061165,0.001912739,0.00882141,0.00045813332,0.0019309495,0.00002099076,0.5838345,0.17358719,0.18181823,0.013084391,0.004240818],"about_ca_topic_score_codex":0.000043905846,"about_ca_topic_score_gemma":0.00022555655,"teacher_disagreement_score":0.84937066,"about_ca_system_score_codex":0.00025583126,"about_ca_system_score_gemma":0.00044779934,"threshold_uncertainty_score":0.99991566},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014035266,0.0004724979,0.99755496,0.000033264885,0.00006263265,0.00028608824,0.0000057726393,0.000012058109,0.00016917317],"genre_scores_gemma":[0.97628605,0.00013891041,0.022366777,0.0005103262,0.0003474397,0.000012280298,0.00029680776,0.000018719367,0.000022656091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858075,0.00002716389,0.0003739897,0.0005963843,0.00021901404,0.00020270734],"domain_scores_gemma":[0.9989002,0.00005594782,0.00027541193,0.00042299007,0.0002718111,0.000073662224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037505987,0.0002147803,0.00031214717,0.00016652266,0.000044558135,0.000023314315,0.0003456819,0.00026006097,0.000006434744],"category_scores_gemma":[0.000053259362,0.00021197415,0.000080116326,0.00012592234,0.0003472764,0.0000064511732,0.000301748,0.00017523345,4.7216807e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009612078,0.00004276245,0.0010838524,0.00006678661,0.000049290677,0.0000040482396,0.000054883054,0.2042737,0.05487476,0.00011020565,0.00009052439,0.73925304],"study_design_scores_gemma":[0.00018809977,0.00050654844,0.0010191902,0.00007919433,0.000045657387,0.000025586955,7.238777e-8,0.9616647,0.034623813,0.0011416064,0.0003645166,0.0003410186],"about_ca_topic_score_codex":0.000030267578,"about_ca_topic_score_gemma":0.0004443653,"teacher_disagreement_score":0.9751882,"about_ca_system_score_codex":0.000022145774,"about_ca_system_score_gemma":0.000059881408,"threshold_uncertainty_score":0.8644055},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.3312858e-7,0.0007763794,0.9949994,0.00017734371,0.00038316892,0.00065879215,0.000009426186,0.00014184568,0.0028531847],"genre_scores_gemma":[0.018596869,0.00005559163,0.9778103,0.00024146818,0.0016428928,0.00006660945,0.00001383497,0.00010909445,0.0014633132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874073,0.000008522351,0.00023631721,0.00034954943,0.0002840275,0.0003808751],"domain_scores_gemma":[0.99868715,0.0006765959,0.000056317702,0.0003731967,0.0001312211,0.00007554282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005757342,0.00027488844,0.00025404248,0.000115430164,0.0001842687,0.00015812395,0.00047432538,0.00014879931,0.000026018666],"category_scores_gemma":[0.000028656777,0.00017906318,0.000044745884,0.00020843299,0.00025518305,0.00005629492,0.000047978003,0.00041965698,0.0000076292363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000627839,0.0000030259125,0.0000013095411,0.000036530146,0.000013154072,0.000010925294,0.0001021608,0.94635504,0.0000018271643,0.001236468,0.0005110823,0.051722173],"study_design_scores_gemma":[0.00011078947,0.00009741071,0.00000586903,0.00019744142,0.00004626442,0.000034094686,5.7691906e-8,0.94377583,0.000004739436,0.045546956,0.009913456,0.0002670992],"about_ca_topic_score_codex":0.000007805657,"about_ca_topic_score_gemma":0.000030540323,"teacher_disagreement_score":0.051455073,"about_ca_system_score_codex":0.00009500232,"about_ca_system_score_gemma":0.0001716556,"threshold_uncertainty_score":0.73019844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010217784,0.0020114162,0.96858126,0.0012140888,0.0029264102,0.0004970436,0.000005416698,0.00035588865,0.024306277],"genre_scores_gemma":[0.13710597,0.000052394094,0.85249907,0.0035871062,0.0015347427,0.0000384874,0.0000059651543,0.00007725971,0.0050990055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956767,0.000050713224,0.0005264476,0.0018578586,0.0009872193,0.0009010436],"domain_scores_gemma":[0.99667704,0.0005342172,0.00018027212,0.0017149531,0.00053478236,0.00035872412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00121,0.0006332604,0.0006880485,0.001037538,0.00025510136,0.0008000059,0.004771537,0.00029817663,0.000028731014],"category_scores_gemma":[0.00040688648,0.00050037465,0.00013443799,0.00084237126,0.00054451753,0.00072217925,0.0029193643,0.0006057697,0.00037182946],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007777426,0.000040789622,0.00009842738,0.000052112035,0.000013060677,0.00013108383,0.0023319453,0.004922243,0.00012451583,0.0354033,0.0010824522,0.9557923],"study_design_scores_gemma":[0.0010275298,0.0013696939,0.0007321341,0.0034584727,0.000045469067,0.00042364243,0.000003482468,0.41097856,0.005080992,0.25438344,0.31807005,0.004426531],"about_ca_topic_score_codex":0.000039861665,"about_ca_topic_score_gemma":0.00020539855,"teacher_disagreement_score":0.95136577,"about_ca_system_score_codex":0.00035638813,"about_ca_system_score_gemma":0.0010247462,"threshold_uncertainty_score":0.9997448},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072215876,0.0010758898,0.99550533,0.00008083099,0.0015621847,0.0002686335,0.0000038697062,0.00009165891,0.0006894163],"genre_scores_gemma":[0.21775319,0.000023900839,0.7817836,0.0001396686,0.00022137619,0.0000019236397,0.0000050277376,0.00002264953,0.00004871614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967526,0.00010668176,0.0005228209,0.0010090101,0.0011838803,0.00042496106],"domain_scores_gemma":[0.9975926,0.0004423543,0.00042565085,0.0009172856,0.00050136284,0.00012071829],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022790628,0.0003798671,0.0005461209,0.0015138369,0.00014232568,0.00026839026,0.0017418691,0.00026205412,0.0000074816176],"category_scores_gemma":[0.00021903797,0.00035144915,0.00012410693,0.0014089358,0.00028002827,0.0007577681,0.00059819187,0.00047277097,0.0000046543432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047441586,0.000018558696,0.00025618478,0.00005363958,0.000013505626,0.00001992765,0.00065889594,0.22620682,0.0015290295,0.0027395491,0.000005725389,0.7684934],"study_design_scores_gemma":[0.00045420355,0.00015624496,0.0008113614,0.00041297212,0.000018681392,0.0000798762,6.3510043e-7,0.8814238,0.009786395,0.106152184,0.000076971985,0.0006266874],"about_ca_topic_score_codex":0.000049745828,"about_ca_topic_score_gemma":0.000020600224,"teacher_disagreement_score":0.76786673,"about_ca_system_score_codex":0.00035823946,"about_ca_system_score_gemma":0.00043382696,"threshold_uncertainty_score":0.9998937},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025803954,0.0009769406,0.99301374,0.00094814657,0.0026915928,0.00026284083,0.000007544846,0.0002147953,0.0016263586],"genre_scores_gemma":[0.65481067,0.000053322274,0.34268656,0.0009544065,0.0009833999,0.000009477965,0.000021910631,0.000040817584,0.00043943638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960271,0.00003387855,0.0005407198,0.001399131,0.0011413349,0.0008578116],"domain_scores_gemma":[0.9974195,0.00030404385,0.00019357521,0.0016051603,0.00022894696,0.00024882326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009121228,0.0004933846,0.00046796977,0.000496779,0.00027484781,0.00039287846,0.0034530498,0.00039986803,0.000062527026],"category_scores_gemma":[0.0000748055,0.00045948644,0.00014278601,0.0004889309,0.0004567914,0.00082898204,0.0016223976,0.0009389587,0.00014870694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038304875,0.00004744843,0.0003733099,0.000060560054,0.000018163064,0.00009825736,0.00075673737,0.020784123,0.00018589415,0.18553558,0.000024670424,0.7921114],"study_design_scores_gemma":[0.0002711381,0.00004708753,0.0002900137,0.00033637215,0.000011886615,0.0001421656,7.822376e-8,0.8459555,0.0005089717,0.1499266,0.001718349,0.0007918293],"about_ca_topic_score_codex":0.000020261139,"about_ca_topic_score_gemma":0.000014288417,"teacher_disagreement_score":0.8251714,"about_ca_system_score_codex":0.00040084578,"about_ca_system_score_gemma":0.00053396623,"threshold_uncertainty_score":0.99978566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000076659824,0.0012048995,0.9841063,0.0018673479,0.0045884806,0.000662187,0.00009452605,0.0003089574,0.0070906593],"genre_scores_gemma":[0.4935501,0.00006639119,0.49020913,0.003126784,0.0040297937,0.000055468077,0.00008355783,0.00020349472,0.0086752875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924818,0.000085759726,0.0010417822,0.0028401152,0.0022870717,0.0012634647],"domain_scores_gemma":[0.9938306,0.00032144552,0.0005144492,0.0037994054,0.0009969072,0.0005371524],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018647483,0.000989393,0.0011039097,0.00055824936,0.00037026856,0.0012731162,0.006773195,0.0007092499,0.0000844782],"category_scores_gemma":[0.00013231504,0.0008781955,0.0003096988,0.0009443965,0.0013429149,0.0010385839,0.0026575134,0.001416683,0.00025269375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048191687,0.00033612712,0.0006354649,0.00030314812,0.0001511564,0.00028548023,0.002924707,0.4183378,0.0001576339,0.15149818,0.007203858,0.41811824],"study_design_scores_gemma":[0.000810049,0.00024863714,0.00026998608,0.0005604217,0.000017845608,0.00009151736,9.543633e-7,0.8778501,0.00013961871,0.09465954,0.023950608,0.0014006768],"about_ca_topic_score_codex":0.00027694958,"about_ca_topic_score_gemma":0.00028586143,"teacher_disagreement_score":0.49389717,"about_ca_system_score_codex":0.0007094428,"about_ca_system_score_gemma":0.0014274825,"threshold_uncertainty_score":0.99976367},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009392786,0.00034292982,0.99524075,0.00020235188,0.0029468834,0.00061387167,0.000019371657,0.00010996343,0.00042994547],"genre_scores_gemma":[0.58386177,0.000009497439,0.41512007,0.00037332444,0.00045369897,0.000021536596,0.000010632366,0.000034457607,0.00011503082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964982,0.00004920285,0.0006784776,0.001346451,0.0008445078,0.0005831293],"domain_scores_gemma":[0.9969114,0.00097425625,0.0005390119,0.0009881789,0.00043740528,0.00014972476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013513999,0.00048179962,0.0006654782,0.00082029845,0.0002583976,0.0002194595,0.0024937561,0.00022508037,0.000003253099],"category_scores_gemma":[0.00013909896,0.0004420438,0.0002515369,0.00068679295,0.0009977531,0.00016083944,0.0005124592,0.00040331343,0.0000078734465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018830488,0.000051845203,0.000008104214,0.00019517669,0.000015868349,0.000012718576,0.0006537073,0.288893,0.00007867664,0.30683097,0.000028241824,0.40321285],"study_design_scores_gemma":[0.00029783908,0.00020874305,0.00002775609,0.00035624637,0.000009362402,0.000013550685,1.17914276e-7,0.61117256,0.00054667966,0.38669643,0.00031771167,0.00035302422],"about_ca_topic_score_codex":0.000004182849,"about_ca_topic_score_gemma":0.000008424907,"teacher_disagreement_score":0.58376783,"about_ca_system_score_codex":0.00009960325,"about_ca_system_score_gemma":0.00023209068,"threshold_uncertainty_score":0.9998031},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042867876,0.0022393633,0.9930294,0.0006371074,0.002591351,0.00068648753,0.00014254634,0.00011482506,0.00051604584],"genre_scores_gemma":[0.014756852,0.00012663328,0.98218316,0.00074444106,0.0018219113,0.000016930368,0.00013261712,0.00003815751,0.00017931554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953577,0.000047612582,0.00058305106,0.0021314675,0.00092282874,0.00095733633],"domain_scores_gemma":[0.994752,0.0007247175,0.0003247631,0.0037805403,0.00017994747,0.00023806473],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012059001,0.0006169632,0.0006810083,0.00065875705,0.0002543066,0.00042681192,0.007927997,0.0004483411,0.000019066512],"category_scores_gemma":[0.00017363322,0.0005291513,0.000102562095,0.00049135543,0.00044409113,0.0018589563,0.0048414925,0.0009206667,0.000015822987],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002457447,0.00006852217,0.00044038147,0.000142082,0.00001301775,0.000050465114,0.0006161326,0.005926707,0.00013537357,0.028878154,0.0005234705,0.96318114],"study_design_scores_gemma":[0.0006558091,0.00011074711,0.0009961152,0.00032939867,0.00001307267,0.000051179944,2.5351494e-7,0.8528366,0.0004004985,0.1207338,0.02286941,0.0010031183],"about_ca_topic_score_codex":0.00015883827,"about_ca_topic_score_gemma":0.00033137802,"teacher_disagreement_score":0.962178,"about_ca_system_score_codex":0.00020627446,"about_ca_system_score_gemma":0.0005216356,"threshold_uncertainty_score":0.999716},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004009528,0.0000037544785,0.9550248,0.00022258659,0.0004625233,0.00096988544,0.000019799414,0.000027694035,0.03925945],"genre_scores_gemma":[0.93379056,0.0000023601187,0.061805714,0.0001442578,0.00060610287,0.00011574142,0.0000366852,0.000028684903,0.0034698674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835217,0.000009287353,0.00030710618,0.000663527,0.00038697562,0.00028093415],"domain_scores_gemma":[0.9989207,0.00010747943,0.00028686324,0.00041807618,0.00019938944,0.00006751525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022947075,0.0002499333,0.00026886057,0.000312906,0.00019741378,0.00013185819,0.0005433747,0.00009278659,0.00016726257],"category_scores_gemma":[0.0000042411916,0.00021280648,0.00009057832,0.00042626652,0.00043211057,0.00025601886,0.00016599351,0.00036274307,0.00008839654],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022844597,0.00016083517,0.001130511,0.00002665963,0.000018196488,0.0000010712143,0.0006729109,0.02044627,0.004950894,0.009884993,0.00058017694,0.9621046],"study_design_scores_gemma":[0.00073283905,0.0012062686,0.005225527,0.00091488723,0.000050717335,0.0000073945207,0.0000059616127,0.8703458,0.02923717,0.087409735,0.0035885603,0.0012751763],"about_ca_topic_score_codex":0.0002252967,"about_ca_topic_score_gemma":0.000045189314,"teacher_disagreement_score":0.96082944,"about_ca_system_score_codex":0.000088514746,"about_ca_system_score_gemma":0.00023200136,"threshold_uncertainty_score":0.86779964},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026492407,0.00010364046,0.9944959,0.0022789363,0.0010717828,0.0010349781,0.000004745009,0.0004072413,0.0005762789],"genre_scores_gemma":[0.003144662,0.000037380618,0.9925566,0.0026655016,0.00049832155,0.00007245677,0.000046134002,0.000048769736,0.00093022035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99437296,0.00012340222,0.0006502527,0.001639988,0.0024961575,0.0007172233],"domain_scores_gemma":[0.99690884,0.000962652,0.00045829185,0.0008907031,0.00036625098,0.0004132828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025758639,0.0005433268,0.0005861249,0.0006965053,0.00034438996,0.00063471997,0.0030835292,0.00061882625,0.00010312565],"category_scores_gemma":[0.0006010301,0.0004920643,0.0001725533,0.0003815608,0.00080665405,0.0006194704,0.0011252866,0.0014409306,0.00003724448],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009659576,0.000027667293,0.00002032826,0.00008940711,0.0000129361015,0.000061922605,0.0007697482,0.00058833195,0.0021486115,0.0032899482,0.00039475993,0.9925867],"study_design_scores_gemma":[0.0021343771,0.00075175264,0.00008943873,0.0010376633,0.000021548098,0.00015071615,0.0000024022634,0.8393464,0.043741915,0.10693877,0.0042417673,0.0015432229],"about_ca_topic_score_codex":0.000011200729,"about_ca_topic_score_gemma":0.000044923487,"teacher_disagreement_score":0.99104345,"about_ca_system_score_codex":0.00042066682,"about_ca_system_score_gemma":0.0005613948,"threshold_uncertainty_score":0.9997531},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27527937,0.0017464539,0.71875215,0.00022546569,0.0012620906,0.00085272244,0.00005474111,0.000012617439,0.0018143791],"genre_scores_gemma":[0.9979404,0.000008514199,0.0016420782,0.000162103,0.00011698442,0.000001371868,0.00001165988,0.000007003119,0.000109882385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990196,0.000017565955,0.00015661726,0.00037950044,0.00027078827,0.00015589342],"domain_scores_gemma":[0.9992908,0.000033691937,0.0001197025,0.00034545377,0.00017771052,0.000032629683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028698426,0.00014258806,0.00014906104,0.00008543644,0.0000453034,0.000018540892,0.0006807642,0.00021400992,0.000003396685],"category_scores_gemma":[0.00011211826,0.00011278239,0.000047501624,0.00013188466,0.0002709011,0.0000058526152,0.00034976346,0.00016805589,0.0000016384998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027006157,0.000023051474,0.0055178474,0.000043434135,0.000008183064,0.000003841144,0.00024994646,0.9674325,0.01161204,0.00007040383,0.000008988669,0.015002786],"study_design_scores_gemma":[0.00162752,0.00078451366,0.01540981,0.0007060267,0.000043247383,0.000023909763,0.0000018078815,0.3462227,0.5183483,0.11309941,0.0022389707,0.0014938215],"about_ca_topic_score_codex":0.000010548386,"about_ca_topic_score_gemma":0.000078512465,"teacher_disagreement_score":0.722661,"about_ca_system_score_codex":0.000036245987,"about_ca_system_score_gemma":0.00029657877,"threshold_uncertainty_score":0.45991322},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019925763,0.0005043189,0.9941248,0.0009589508,0.00019813665,0.00042970764,8.6669843e-7,0.00026930403,0.0015212889],"genre_scores_gemma":[0.9145082,0.00014778976,0.08450511,0.0001439227,0.00007223192,0.00002319809,0.0000022752836,0.00002044786,0.00057679496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970107,0.00003565717,0.0003592398,0.0011895292,0.0007192636,0.00068558735],"domain_scores_gemma":[0.99808633,0.0006691149,0.00017477834,0.0007924796,0.00014645794,0.00013080859],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008231634,0.00039941937,0.00039566832,0.0009957973,0.00019580153,0.0005018114,0.0017451918,0.0003020753,0.000013792225],"category_scores_gemma":[0.00019832958,0.00032098513,0.000032251628,0.000770321,0.0012208021,0.00074540335,0.0012632272,0.0012728332,0.000018738005],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006108444,0.000034542678,0.005158886,0.000054932967,0.0000049337114,0.000024314955,0.0014261064,0.0071229776,0.00011469092,0.09906332,0.000001374551,0.8869878],"study_design_scores_gemma":[0.0012669783,0.0013698292,0.013360941,0.0015946608,0.000018173585,0.00011872459,0.00001065174,0.7664655,0.002609963,0.20663626,0.003929618,0.0026187121],"about_ca_topic_score_codex":0.000018795865,"about_ca_topic_score_gemma":0.00010652917,"teacher_disagreement_score":0.91251564,"about_ca_system_score_codex":0.00025104702,"about_ca_system_score_gemma":0.00039191707,"threshold_uncertainty_score":0.99992424},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010520223,0.00045625976,0.9970936,0.00013842636,0.0011925126,0.00047336015,0.0000036880585,0.00036740312,0.00016950829],"genre_scores_gemma":[0.020724094,0.00006068262,0.9789586,0.000044373344,0.00012144165,0.000017288334,0.0000027984386,0.000023770517,0.000046924368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973441,0.000085026986,0.0004809368,0.0010210889,0.0007154541,0.0003534249],"domain_scores_gemma":[0.9965266,0.0015557089,0.00041414492,0.0009646454,0.0004367968,0.000102133425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010712097,0.00037318724,0.000514706,0.00047962094,0.000100403224,0.00025633923,0.001116622,0.0003063547,0.000003583108],"category_scores_gemma":[0.00085917144,0.0003444724,0.00005424347,0.00036934123,0.00038734474,0.0010446868,0.0007573116,0.0005133334,0.00001348681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010371311,0.00004846985,0.00003803852,0.0002855828,0.000046868216,0.000030336503,0.0018139236,0.32763028,0.00043075817,0.097571515,0.000022618622,0.57207125],"study_design_scores_gemma":[0.0003646062,0.0005352904,0.0006395189,0.00072765804,0.000036257887,0.00020334791,0.0000013304327,0.7211231,0.01005909,0.26460987,0.00048157622,0.0012183526],"about_ca_topic_score_codex":0.000018384671,"about_ca_topic_score_gemma":6.4844534e-7,"teacher_disagreement_score":0.5708529,"about_ca_system_score_codex":0.00023233733,"about_ca_system_score_gemma":0.00038192305,"threshold_uncertainty_score":0.99990076},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014206531,0.00013444602,0.99553525,0.00012552076,0.00044315358,0.00048935204,0.000004665251,0.0012211513,0.0006258196],"genre_scores_gemma":[0.2484411,0.0000021001351,0.75088185,0.00024182141,0.00026747602,0.00003832513,0.0000062099457,0.00005492346,0.000066215136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942341,0.000037676687,0.00068221614,0.0024120193,0.0017297381,0.00090424],"domain_scores_gemma":[0.99609786,0.00015094363,0.00024723302,0.0024108717,0.0005282798,0.0005647937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013916388,0.000720939,0.0006622685,0.0011153788,0.0002471681,0.0006372901,0.004014451,0.0003356647,0.000005162492],"category_scores_gemma":[0.000118312164,0.0006458548,0.000089009234,0.0010384886,0.00035894456,0.0010872815,0.0017615901,0.0010659433,0.0000074415066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012350624,0.00003075357,0.00004951514,0.00003099885,0.0000100376465,0.0019684797,0.0070762127,0.56030285,0.00023619663,0.04494059,0.000010544584,0.38533145],"study_design_scores_gemma":[0.0001151313,0.00032462782,0.0000055720475,0.00079209794,0.0000064093574,0.0011735553,0.0000015982258,0.9879352,0.00041344462,0.0073016603,0.0009468892,0.0009838502],"about_ca_topic_score_codex":0.00012619344,"about_ca_topic_score_gemma":0.00011226737,"teacher_disagreement_score":0.4276323,"about_ca_system_score_codex":0.00044567403,"about_ca_system_score_gemma":0.0005841627,"threshold_uncertainty_score":0.9995993},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029872958,0.00018661999,0.9632812,0.0004713749,0.0016760726,0.00036865586,0.000005393215,0.00004812157,0.0040895795],"genre_scores_gemma":[0.9974429,0.00003508219,0.0012995111,0.0007237073,0.00012919851,0.0000039422407,0.0000034348657,0.000026530124,0.00033571047],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978648,0.000117644915,0.0003397315,0.00066476787,0.00061912,0.0003939313],"domain_scores_gemma":[0.997207,0.0012548034,0.00046003776,0.0009057943,0.0001119163,0.00006044189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008098293,0.00034332508,0.00034130106,0.00021430283,0.0006685931,0.00014343663,0.0014770256,0.00029125065,0.00019226388],"category_scores_gemma":[0.000101023485,0.00018748411,0.000112589514,0.000261171,0.0014567552,0.00011203236,0.00033038837,0.0007626511,0.000011516323],"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.0001862641,0.00017538582,0.28258076,0.0003616414,0.00033291735,0.000075236036,0.2198912,0.20464851,0.0012299783,0.09988997,0.0005760169,0.1900521],"study_design_scores_gemma":[0.001997918,0.00064155355,0.563788,0.0064283907,0.00026769846,0.0002634855,0.0004087114,0.11600456,0.0011312268,0.29804993,0.007341246,0.0036772876],"about_ca_topic_score_codex":0.00018678942,"about_ca_topic_score_gemma":0.0001652475,"teacher_disagreement_score":0.96756995,"about_ca_system_score_codex":0.00016936612,"about_ca_system_score_gemma":0.0001196534,"threshold_uncertainty_score":0.76453805},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065021925,0.012460398,0.88760656,0.0010850125,0.006293079,0.0007619615,0.000103927516,0.000026577385,0.02664055],"genre_scores_gemma":[0.95426303,0.0005790871,0.04208869,0.00042427654,0.0010071263,0.0000051353254,0.00009051048,0.000029418361,0.001512742],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986234,0.000020455947,0.0002459145,0.0007278353,0.00016979095,0.000212648],"domain_scores_gemma":[0.9991848,0.000039310704,0.00013599748,0.00039705168,0.00016924345,0.00007361846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037641986,0.00022513444,0.00022909431,0.000109780136,0.00012676034,0.000035096517,0.0002411602,0.00025992488,0.0000022988356],"category_scores_gemma":[0.000088100634,0.00021190429,0.000040024286,0.000065521905,0.0007150786,0.0000014542763,0.00042060096,0.00019201827,0.0000034495786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035797208,0.000050225895,0.002456438,0.000031327152,0.00009590206,0.00004326565,0.0009222134,0.02377067,0.045144748,0.0014440083,0.0012437316,0.9244395],"study_design_scores_gemma":[0.008596878,0.007993921,0.10653783,0.00048265362,0.00024272843,0.0022362245,0.000006695686,0.091700785,0.06416,0.36170635,0.35009795,0.006237987],"about_ca_topic_score_codex":0.000017537433,"about_ca_topic_score_gemma":0.00032665193,"teacher_disagreement_score":0.9182015,"about_ca_system_score_codex":0.000038856913,"about_ca_system_score_gemma":0.00015060836,"threshold_uncertainty_score":0.8641206},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003962917,0.06487297,0.4032871,0.02419253,0.030500876,0.007427027,0.000048341313,0.0009298873,0.46477833],"genre_scores_gemma":[0.5141564,0.008675184,0.07347505,0.19210643,0.033480354,0.000864177,0.0004726893,0.001027949,0.17574178],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99710137,0.00013405917,0.0005024956,0.000863499,0.0008326377,0.0005659507],"domain_scores_gemma":[0.9973374,0.0007032197,0.0005032766,0.00057140575,0.00067643414,0.00020825624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002420374,0.00037525024,0.0005116169,0.0002858841,0.0006611557,0.000043948326,0.0007377693,0.00031580706,0.00010964871],"category_scores_gemma":[0.0009012351,0.0003103169,0.00006911759,0.0002835083,0.000325886,0.00025387536,0.00016111741,0.0018971331,0.00051072135],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003731424,0.00009748144,0.0002637646,0.0040689916,0.000024369334,0.000021092976,0.07873726,0.0051230635,0.0000044884596,0.0013197218,0.025164116,0.88513833],"study_design_scores_gemma":[0.0010291545,0.0010785749,0.00039598512,0.15731652,0.00009228603,0.000024415836,0.00024504872,0.0063526845,0.000073016694,0.17501038,0.65512365,0.0032582714],"about_ca_topic_score_codex":0.000012047417,"about_ca_topic_score_gemma":0.000031970067,"teacher_disagreement_score":0.88188004,"about_ca_system_score_codex":0.0008785329,"about_ca_system_score_gemma":0.0021507659,"threshold_uncertainty_score":0.9999349},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014059976,0.000525047,0.99753165,0.0001369137,0.00035716736,0.00073666265,0.000018663264,0.00023247414,0.0004473715],"genre_scores_gemma":[0.04700809,0.000028247423,0.9523862,0.00023295502,0.000101554455,0.000025554138,0.00005292953,0.00003068918,0.00013375227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996866,0.000047577683,0.00059042557,0.0010350698,0.0010272452,0.00043368296],"domain_scores_gemma":[0.9969978,0.0007220284,0.00053061463,0.0006579008,0.0009784807,0.0001131863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013491499,0.00039820018,0.0005192876,0.0009163513,0.00019979816,0.00013576132,0.0013698265,0.00027245778,0.000004654113],"category_scores_gemma":[0.00027683066,0.00037989666,0.00018539291,0.0007928156,0.00039580156,0.0010725589,0.00037540225,0.0005483159,0.0000024742449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003113101,0.00002667314,0.00003545086,0.000059891725,0.000013136633,0.0000073781825,0.00023388988,0.5867329,0.0006569581,0.030949337,0.0000383777,0.38121486],"study_design_scores_gemma":[0.00035047904,0.0003642983,0.000012888087,0.00019782619,0.000008474988,0.00000639158,1.1544506e-7,0.62793046,0.016326476,0.35410726,0.00038673304,0.0003086237],"about_ca_topic_score_codex":0.000009594049,"about_ca_topic_score_gemma":0.0000062033473,"teacher_disagreement_score":0.38090625,"about_ca_system_score_codex":0.00031001997,"about_ca_system_score_gemma":0.0008333721,"threshold_uncertainty_score":0.9998653},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009049935,0.00024000152,0.9967513,0.0007213212,0.000366558,0.00095227006,0.00000969164,0.00010096002,0.00084884785],"genre_scores_gemma":[0.100788444,0.000023937542,0.89734966,0.0003898689,0.00040598153,0.00006235475,0.000048605903,0.000028829318,0.00090229244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779636,0.00005014415,0.00031795705,0.0006577924,0.00074329524,0.00043446032],"domain_scores_gemma":[0.9987671,0.0005726739,0.00019843395,0.00022082835,0.00016233057,0.00007863524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010668528,0.00025775185,0.00023671612,0.00018806278,0.0010429807,0.00028213827,0.0006069492,0.00032178118,0.0000105232275],"category_scores_gemma":[0.000030730247,0.00020315404,0.00013092648,0.00026341336,0.0005234656,0.00009955563,0.000014720756,0.0005727894,0.0000016668711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009085907,0.00002751511,0.00004348002,0.000021455378,0.000006620705,0.0000015099037,0.003906496,0.974219,0.0000011056934,0.008113031,0.000008788579,0.0136418985],"study_design_scores_gemma":[0.00021352868,0.000043003944,0.000016650523,0.00013888135,0.000025361212,3.2681655e-7,0.000003059774,0.98452306,0.000014156568,0.010494274,0.0042638774,0.00026381825],"about_ca_topic_score_codex":0.00024266454,"about_ca_topic_score_gemma":0.00022221835,"teacher_disagreement_score":0.10077939,"about_ca_system_score_codex":0.00019572441,"about_ca_system_score_gemma":0.00048176362,"threshold_uncertainty_score":0.8284381},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022952722,0.00055805955,0.9940785,0.00024171754,0.0001968073,0.0004908829,0.000024296101,0.000052725176,0.0020617298],"genre_scores_gemma":[0.61610335,0.0000314815,0.38357142,0.00015369078,0.000062261395,0.000006886133,0.0000034393643,0.000017129725,0.000050353894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99539256,0.00030502948,0.00080419896,0.0014360759,0.0015551861,0.00050695037],"domain_scores_gemma":[0.9956896,0.0012766004,0.00077533524,0.0010411246,0.001048894,0.00016847638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034641186,0.00053413893,0.0011006183,0.00053175894,0.00012979931,0.00021601976,0.0017118155,0.000166886,0.0000037085583],"category_scores_gemma":[0.00019481813,0.00041063095,0.0001195931,0.00048219596,0.0017999855,0.00095065415,0.0010065575,0.0007000434,0.0000011128805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005949361,0.00092980644,0.003003681,0.00113254,0.0006237588,0.0006660016,0.013490234,0.32633242,0.011551547,0.13038144,0.00010916621,0.51118445],"study_design_scores_gemma":[0.0017976128,0.0026486542,0.0021346326,0.0011031308,0.000060535822,0.00020817657,0.000017672146,0.6406397,0.028278984,0.32143047,0.000070696435,0.0016096975],"about_ca_topic_score_codex":0.00030400016,"about_ca_topic_score_gemma":0.000032135576,"teacher_disagreement_score":0.6138081,"about_ca_system_score_codex":0.0002700874,"about_ca_system_score_gemma":0.0010386168,"threshold_uncertainty_score":0.99983454},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012430863,0.00036430365,0.9960363,0.00042256442,0.0013720681,0.00034653826,0.00000913412,0.0004991688,0.0008256157],"genre_scores_gemma":[0.082534045,0.00020548461,0.9157182,0.000888011,0.00028199557,0.000017159753,0.0000073040337,0.000042267377,0.0003055136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966625,0.000019563184,0.00046140017,0.0015448491,0.0008147062,0.00049697456],"domain_scores_gemma":[0.9980316,0.00031031965,0.00016412891,0.0011585319,0.0001509061,0.00018447608],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036382143,0.00055489165,0.00046889592,0.00075602543,0.00016099877,0.0006318171,0.0029700818,0.00036924568,0.000018806038],"category_scores_gemma":[0.000036786252,0.00054535776,0.00010081538,0.00025079295,0.0004368462,0.0009475664,0.0012367759,0.0009599214,0.000015477577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005058956,0.000027486054,0.000010205001,0.000015080493,0.00001493675,0.000113370144,0.00088644197,0.2639485,0.000027742868,0.046847917,0.000055289114,0.68804795],"study_design_scores_gemma":[0.00023653913,0.00006761642,0.000021979908,0.00037732927,0.0000022209042,0.000115781884,3.338506e-8,0.9776614,0.00025427627,0.010854687,0.009831559,0.000576592],"about_ca_topic_score_codex":0.0000035906262,"about_ca_topic_score_gemma":0.0000124183325,"teacher_disagreement_score":0.7137129,"about_ca_system_score_codex":0.00029189585,"about_ca_system_score_gemma":0.00022397737,"threshold_uncertainty_score":0.9996998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014761662,0.00017054095,0.98449683,0.0025613257,0.0021360675,0.0006363353,0.000048119855,0.00026226314,0.00967375],"genre_scores_gemma":[0.42258564,0.000102237595,0.54653007,0.01780611,0.002599873,0.000057592308,0.000040506606,0.00014719473,0.010130779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940367,0.000072924166,0.00097301975,0.0025236094,0.001465487,0.0009282662],"domain_scores_gemma":[0.9955051,0.00034805623,0.00042160836,0.0029193622,0.0004990276,0.00030687012],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018799367,0.00074169016,0.00094483956,0.00038434775,0.00040064508,0.0008168823,0.004973256,0.00052142184,0.000048644306],"category_scores_gemma":[0.00014950715,0.00052411616,0.0002560292,0.00068247184,0.00082370534,0.000509458,0.0016698367,0.0010767806,0.00021406659],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001721457,0.000043299482,0.00006147462,0.0001158393,0.000016098202,0.00004784273,0.0007072027,0.005807068,0.00011342422,0.020083195,0.00037360756,0.97261375],"study_design_scores_gemma":[0.00045054677,0.00021457748,0.00018060289,0.0005646734,0.000008150069,0.00007927046,7.601392e-8,0.7989511,0.0010496181,0.023975166,0.17342517,0.0011010416],"about_ca_topic_score_codex":0.0000893013,"about_ca_topic_score_gemma":0.000057041634,"teacher_disagreement_score":0.9715127,"about_ca_system_score_codex":0.0003937498,"about_ca_system_score_gemma":0.00072770525,"threshold_uncertainty_score":0.99972105},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045756283,0.00055574044,0.99251527,0.00022932903,0.0021885894,0.00029043012,0.000007796939,0.00016179966,0.0035934765],"genre_scores_gemma":[0.4955071,0.000049862978,0.5015375,0.0010479524,0.0013100752,0.000002679021,0.000005906769,0.000050889525,0.00048806114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996047,0.00007814645,0.0007859857,0.0014049252,0.0009929787,0.0006909264],"domain_scores_gemma":[0.99654263,0.00088013586,0.0006864992,0.0014477049,0.00024386273,0.00019918183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014678126,0.0005862745,0.00082357926,0.0009831171,0.0002697117,0.00028345382,0.0046064346,0.00033922703,0.000035975183],"category_scores_gemma":[0.000115280665,0.00052478886,0.00021703477,0.0007406535,0.00085593126,0.00044198512,0.0020726216,0.00072715455,0.00005003162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014730014,0.000044531025,0.00018993941,0.00020415858,0.000025801713,0.000080936305,0.0010904581,0.02565849,0.00024807506,0.10592029,0.00015458341,0.866368],"study_design_scores_gemma":[0.00075947936,0.00046858593,0.00018198606,0.0010437731,0.00002666617,0.00015571175,7.609117e-7,0.8472039,0.006935938,0.13635585,0.005385586,0.0014817636],"about_ca_topic_score_codex":0.000048044927,"about_ca_topic_score_gemma":0.000019739358,"teacher_disagreement_score":0.8648862,"about_ca_system_score_codex":0.00013446172,"about_ca_system_score_gemma":0.0004583509,"threshold_uncertainty_score":0.9997204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005919275,0.000035397163,0.9937601,0.0010911023,0.00250517,0.00068192056,0.0000034259692,0.00046963937,0.0013940508],"genre_scores_gemma":[0.7639447,0.0000016264596,0.23105308,0.0015708861,0.0032928828,0.00006800555,0.000008962793,0.000026673963,0.000033215736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971098,0.0000131537,0.00062413857,0.0009115492,0.0006521775,0.0006892215],"domain_scores_gemma":[0.9981548,0.00012585707,0.00035514968,0.000985438,0.0002146298,0.00016409907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004504321,0.0004126534,0.0004508798,0.0006497183,0.0004664111,0.0006918231,0.0026713666,0.0003589774,0.000002228204],"category_scores_gemma":[0.00002026034,0.00037301925,0.00006517495,0.0013374288,0.00024588383,0.0004598093,0.0010709255,0.0006603823,0.000093097195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033611652,0.0000026028015,0.00000214626,0.000020200061,0.0000014442926,0.0000018486957,0.00009229306,0.19806854,0.000043076656,0.13660797,0.00005669138,0.6650998],"study_design_scores_gemma":[0.00010613219,0.00008926082,0.000013033428,0.00021535912,0.0000055431833,0.000029463083,2.0978962e-7,0.92068267,0.00028660742,0.06769773,0.010340429,0.00053358596],"about_ca_topic_score_codex":0.0000041960284,"about_ca_topic_score_gemma":0.000018447497,"teacher_disagreement_score":0.7638855,"about_ca_system_score_codex":0.00022141857,"about_ca_system_score_gemma":0.00021793942,"threshold_uncertainty_score":0.99987215},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003995735,0.00013053157,0.9966834,0.00042366653,0.0002869713,0.0011769595,0.000020108624,0.00029669874,0.0005820563],"genre_scores_gemma":[0.16664572,0.000011051458,0.8320923,0.0008219709,0.00009243949,0.00012556848,0.000034444543,0.000029035007,0.00014748317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636084,0.00004789769,0.0008715227,0.0012766897,0.0009303119,0.00051274576],"domain_scores_gemma":[0.9964472,0.0008529737,0.0006780569,0.0011945413,0.00068531506,0.00014193522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093659613,0.0004896149,0.0008573803,0.0024791698,0.00016761555,0.00043181208,0.0024306462,0.0003203699,0.00018085858],"category_scores_gemma":[0.000109889,0.00044802786,0.00040317143,0.0014929668,0.000503255,0.00067494955,0.0003748014,0.00033101393,0.000036582147],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003146188,0.000047194546,0.000095562595,0.0001455492,0.00008351477,0.0000045314123,0.00022571466,0.0048201615,0.0008144559,0.0020958665,0.00003692787,0.9916274],"study_design_scores_gemma":[0.00033138116,0.0002515131,0.00031197348,0.0003053842,0.00009773841,0.0000051409324,1.7553414e-7,0.90842015,0.02508033,0.06462839,0.00008141298,0.0004864355],"about_ca_topic_score_codex":0.0000275446,"about_ca_topic_score_gemma":0.000040811017,"teacher_disagreement_score":0.99114096,"about_ca_system_score_codex":0.00025035898,"about_ca_system_score_gemma":0.00044445935,"threshold_uncertainty_score":0.99979717},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011316496,0.00019899724,0.97747356,0.00057907304,0.003104201,0.00034739423,0.000007765335,0.00025598198,0.0180217],"genre_scores_gemma":[0.047158774,0.000088096436,0.94461423,0.005526853,0.0005382466,0.000033482855,0.0000072025073,0.000057564885,0.0019755233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958557,0.000071114315,0.00045922285,0.0017878589,0.00095533155,0.0008708113],"domain_scores_gemma":[0.99720305,0.0003473241,0.00021041237,0.0018811157,0.00013437225,0.00022369968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062876666,0.00057878514,0.00052416563,0.0007420695,0.00037599946,0.00052769075,0.0046457793,0.000410995,0.000056781184],"category_scores_gemma":[0.000022213364,0.00048269634,0.00019392926,0.001216733,0.00054558174,0.00063715165,0.00026703003,0.0011509847,0.00028440668],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053522785,0.00009402314,0.0000031074203,0.000022360706,0.00000971371,0.000110151734,0.0010898721,0.025205942,0.0000044560834,0.0022998345,0.00030787152,0.9708473],"study_design_scores_gemma":[0.00043613763,0.00056694605,0.00012175704,0.00040608717,0.000014283825,0.00014160192,1.452888e-7,0.6993025,0.0007447258,0.28620484,0.010738885,0.0013221287],"about_ca_topic_score_codex":0.000023287226,"about_ca_topic_score_gemma":0.00005550442,"teacher_disagreement_score":0.96952516,"about_ca_system_score_codex":0.00040100218,"about_ca_system_score_gemma":0.0010231676,"threshold_uncertainty_score":0.9997625},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009703934,0.00035959412,0.9879175,0.0017128569,0.0027761047,0.0005696825,0.000019157314,0.00025213935,0.006295969],"genre_scores_gemma":[0.007115794,0.0000082092,0.9861208,0.0045015877,0.00068061426,0.000011999933,0.000009408429,0.000054643137,0.001496945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939946,0.0001617357,0.0007287884,0.0022822882,0.0017095347,0.0011230883],"domain_scores_gemma":[0.99542487,0.00055544253,0.00028769425,0.0023342625,0.00079617556,0.0006015877],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002153962,0.00086591346,0.00097551587,0.0010583878,0.0003652257,0.0014408217,0.005569457,0.00042373734,0.00009986693],"category_scores_gemma":[0.00042018306,0.00072933186,0.00024809423,0.000975438,0.00061905093,0.0013274077,0.0029329574,0.0011532349,0.00013389805],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011208265,0.00004235075,0.000009304497,0.00006800949,0.00003427467,0.0008868882,0.0024861225,0.104357496,0.0033459116,0.007029819,0.0019906284,0.8796371],"study_design_scores_gemma":[0.0014714238,0.0003985662,0.00009741272,0.00041462737,0.000025357178,0.00023665589,1.858875e-7,0.77548283,0.0075223683,0.20570102,0.0067877183,0.001861818],"about_ca_topic_score_codex":0.000048260987,"about_ca_topic_score_gemma":0.000026760254,"teacher_disagreement_score":0.8777753,"about_ca_system_score_codex":0.0004659111,"about_ca_system_score_gemma":0.0006432399,"threshold_uncertainty_score":0.9998109},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044210468,0.00015589008,0.9909219,0.00044092064,0.00037037965,0.00038517936,0.0000032287749,0.00005907828,0.0072213337],"genre_scores_gemma":[0.66518205,0.0000784666,0.3327282,0.00062157144,0.000136097,0.000012672683,0.000007763953,0.00004720798,0.0011859717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673104,0.000044916087,0.0004676472,0.0009603303,0.0012817325,0.000514313],"domain_scores_gemma":[0.99814427,0.00012756104,0.00024134335,0.0010174738,0.00027638552,0.00019296631],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065118616,0.00036272162,0.00050582894,0.0009551768,0.00006106154,0.00020117665,0.00239821,0.00017977967,0.00003597487],"category_scores_gemma":[0.00003811758,0.0002791704,0.00005825832,0.00071709405,0.00047077192,0.0003758218,0.001017941,0.0005526496,0.000011084165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036911668,0.00022873636,0.00079937506,0.00013012688,0.00002485094,0.00027985455,0.0038505772,0.5068001,0.000058492646,0.039994504,0.00011838569,0.4476781],"study_design_scores_gemma":[0.0006607961,0.00038141056,0.0006078466,0.0004929689,0.0000033889569,0.000035022123,3.094005e-7,0.93452114,0.0002954334,0.06216985,0.00039645398,0.00043535474],"about_ca_topic_score_codex":0.00003770391,"about_ca_topic_score_gemma":0.00016974068,"teacher_disagreement_score":0.66473997,"about_ca_system_score_codex":0.0002683238,"about_ca_system_score_gemma":0.000457194,"threshold_uncertainty_score":0.999966},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029869165,0.00046973815,0.99169284,0.0007940827,0.003627263,0.0011811337,0.00002828068,0.00049941946,0.0014085467],"genre_scores_gemma":[0.34895104,0.00002911179,0.6438924,0.0059600174,0.00082668004,0.00007684755,0.000046363573,0.000097067474,0.00012044391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99524236,0.00005617167,0.0007605428,0.0020884357,0.0008998036,0.0009526824],"domain_scores_gemma":[0.996275,0.00039249106,0.00049489806,0.0019114637,0.0006393984,0.0002867606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007566358,0.000812673,0.0007679888,0.0010017131,0.0004929525,0.00052274583,0.004906354,0.00043460276,0.0000102843915],"category_scores_gemma":[0.000006813072,0.0007293113,0.00023851304,0.000865235,0.00020787235,0.0006077492,0.0015246763,0.0006557054,0.00012287301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018986595,0.0006213986,0.00021048583,0.006937217,0.00033449163,0.0005232219,0.023374267,0.07584886,0.015952613,0.14736027,0.000074543605,0.7285728],"study_design_scores_gemma":[0.0010687904,0.0002791865,0.00010982848,0.0018682032,0.00005673419,0.0002074949,0.0000017804458,0.96950614,0.0060310033,0.016593186,0.0029914994,0.0012861523],"about_ca_topic_score_codex":0.00014622608,"about_ca_topic_score_gemma":0.0007955628,"teacher_disagreement_score":0.89365727,"about_ca_system_score_codex":0.000336748,"about_ca_system_score_gemma":0.0004914044,"threshold_uncertainty_score":0.9995158},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000045601223,0.000634825,0.9869522,0.00039660296,0.0014181416,0.0005513589,0.000032273078,0.0007734965,0.009236555],"genre_scores_gemma":[0.015458841,0.00007752846,0.9827873,0.00075990614,0.0004102395,0.000020245383,0.000016242331,0.000067356385,0.00040233118],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941484,0.000069407135,0.0007305772,0.0023771487,0.0017244635,0.00095002877],"domain_scores_gemma":[0.99498206,0.00055525894,0.00055460446,0.002757874,0.0007491985,0.0004010083],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010497182,0.00084100495,0.00083350856,0.0012051836,0.00031107533,0.0006602597,0.0070793102,0.00044145453,0.0000428198],"category_scores_gemma":[0.00013888576,0.0007535173,0.00014669083,0.0009609957,0.0011802925,0.0022017118,0.0047989315,0.0013681763,0.0001033545],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001827206,0.00004500452,0.0000074680884,0.00003141668,0.000015276775,0.00037339612,0.00045633613,0.0020595547,0.00058717903,0.14058045,0.00077237753,0.8550533],"study_design_scores_gemma":[0.0002916139,0.00019915184,0.000010299546,0.0006479147,0.000007345235,0.000086329106,2.345743e-7,0.4400626,0.0072659976,0.54483473,0.005576374,0.0010174157],"about_ca_topic_score_codex":0.000020090596,"about_ca_topic_score_gemma":0.000019002284,"teacher_disagreement_score":0.85403585,"about_ca_system_score_codex":0.00070398423,"about_ca_system_score_gemma":0.0008316462,"threshold_uncertainty_score":0.9994916},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016994308,0.0014376304,0.99321574,0.0012790825,0.001001488,0.000429147,0.0000044653243,0.00016366676,0.00076934096],"genre_scores_gemma":[0.80647796,0.0003987637,0.17912836,0.007653626,0.0027246391,0.0001100853,0.000023573484,0.00014487709,0.0033381144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958714,0.000070691196,0.00058303756,0.0017970802,0.0008586906,0.0008190911],"domain_scores_gemma":[0.99791056,0.0002621565,0.00039062795,0.0007198089,0.0003983926,0.00031846826],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007263786,0.00061089906,0.0008673662,0.00090961496,0.00084641646,0.0025172848,0.0021224443,0.00039065126,0.00007102954],"category_scores_gemma":[0.000045358458,0.0005771312,0.00021263584,0.0012232106,0.00035243784,0.0012192244,0.0017895639,0.00076106965,0.00010572114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017926569,0.000019701847,0.00043098856,0.00005970141,0.00002598583,0.000021980912,0.0018908664,0.01877885,0.000059452283,0.00040146927,0.000119954086,0.97818923],"study_design_scores_gemma":[0.00021125768,0.000072140625,0.00323541,0.0010726283,0.000037069516,0.00003638283,0.000005327427,0.98398584,0.00015987961,0.0067296643,0.0034181739,0.0010362358],"about_ca_topic_score_codex":0.00007190668,"about_ca_topic_score_gemma":0.00048748072,"teacher_disagreement_score":0.977153,"about_ca_system_score_codex":0.0001828718,"about_ca_system_score_gemma":0.00016298598,"threshold_uncertainty_score":0.999668},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002539664,0.00036226813,0.9950578,0.0004923051,0.00035140626,0.00024372371,0.000030718056,0.000047517173,0.0008745943],"genre_scores_gemma":[0.33588362,0.000058594404,0.66335064,0.00037172117,0.00017966458,0.000015801515,0.0000104442015,0.000024321052,0.000105170046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724597,0.000026210593,0.00054379104,0.0011098173,0.0006349423,0.00043929298],"domain_scores_gemma":[0.99739885,0.0009544895,0.000319891,0.00102043,0.00015685718,0.00014948072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092450087,0.00034248235,0.00047744118,0.0004376375,0.000086816464,0.00026464488,0.0021034365,0.00016594246,0.0000064346227],"category_scores_gemma":[0.00024785672,0.00031700308,0.000046978843,0.0004924745,0.00032789994,0.00052182155,0.0012680221,0.00041763094,0.0000033423762],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016127404,0.000022932394,0.0008365227,0.00003859092,0.000004704119,0.000037025864,0.0018109527,0.003145984,0.00015320373,0.0033637811,0.00001654339,0.99056816],"study_design_scores_gemma":[0.0006506902,0.00021335318,0.0045496523,0.0014858092,0.00000957405,0.000089477646,0.0000054599727,0.94752276,0.0005676712,0.043123122,0.0009312459,0.0008511785],"about_ca_topic_score_codex":0.00021112709,"about_ca_topic_score_gemma":0.00040978342,"teacher_disagreement_score":0.98971695,"about_ca_system_score_codex":0.00018992845,"about_ca_system_score_gemma":0.00042511534,"threshold_uncertainty_score":0.9999282},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006927463,0.000052424675,0.9964764,0.0007278695,0.0008878595,0.0012160353,0.000020784533,0.00031167435,0.0002376797],"genre_scores_gemma":[0.038308624,0.0000059637114,0.959181,0.0014362126,0.0005776454,0.000058138412,0.00022831834,0.000034218312,0.00016986977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959833,0.000058269703,0.00067772355,0.0013775475,0.0013124605,0.0005907034],"domain_scores_gemma":[0.9972943,0.00025715402,0.00045218447,0.0011949191,0.00042585284,0.00037556715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018448354,0.00043449664,0.00039642752,0.0008470029,0.0002827189,0.00076686224,0.0022778807,0.00032712464,0.00003226133],"category_scores_gemma":[0.00022908665,0.00043180285,0.00007954561,0.0005858878,0.00034867044,0.0020511374,0.00050397275,0.00038909368,0.000017295795],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017845596,0.00005729534,0.00020612034,0.00005058683,0.000010694186,0.000014313315,0.0009329354,0.0025106897,0.00039372183,0.012293762,0.00018143629,0.9833306],"study_design_scores_gemma":[0.0017547706,0.0030721335,0.002825365,0.0012674625,0.00009666442,0.00016904892,9.739076e-7,0.6581168,0.08588501,0.23657376,0.0066239918,0.0036140168],"about_ca_topic_score_codex":0.00004021098,"about_ca_topic_score_gemma":0.00016620263,"teacher_disagreement_score":0.9797166,"about_ca_system_score_codex":0.00027396582,"about_ca_system_score_gemma":0.0004797763,"threshold_uncertainty_score":0.9998134},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012686363,0.00048760755,0.978684,0.00026148316,0.0013988501,0.00082746777,0.00001263717,0.00005360074,0.018147478],"genre_scores_gemma":[0.87026405,0.00006329426,0.12415715,0.00088669587,0.0034612312,0.00003805971,0.00001236109,0.000042384494,0.0010747771],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803895,0.000034346434,0.00027992006,0.00045641192,0.0005970458,0.0005933111],"domain_scores_gemma":[0.9986965,0.00044250785,0.00025020633,0.00022983484,0.00024997123,0.00013096615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010820989,0.00024026673,0.0003167816,0.0003784714,0.0010661471,0.00031108793,0.00072475884,0.00030182613,0.000056754478],"category_scores_gemma":[0.00015652306,0.00022240299,0.0001113833,0.0003319507,0.00078952155,0.00094647176,0.00014991601,0.00028228117,0.000009533156],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034180874,0.000029342486,0.00020747242,0.00004063325,0.000015774065,0.000003602143,0.009589266,0.0021301897,0.00006533593,0.08398771,0.000026151278,0.90387034],"study_design_scores_gemma":[0.0012864148,0.00022280453,0.0004437045,0.00043737405,0.000103428225,0.0000152267885,0.000016037977,0.2521215,0.0003410054,0.6964478,0.047107536,0.0014572068],"about_ca_topic_score_codex":0.00020712298,"about_ca_topic_score_gemma":0.0012169791,"teacher_disagreement_score":0.90241313,"about_ca_system_score_codex":0.00083374296,"about_ca_system_score_gemma":0.0005898242,"threshold_uncertainty_score":0.90693307},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000572168,0.0013560512,0.99521613,0.00020350916,0.00016418583,0.00067291316,0.000100022786,0.00001159396,0.0017034338],"genre_scores_gemma":[0.16098045,0.00026933735,0.83424914,0.000914763,0.001375361,0.00009116856,0.00057539786,0.00011353785,0.0014308197],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820435,0.000009798257,0.0001968442,0.0008482255,0.00040095884,0.00033983987],"domain_scores_gemma":[0.9990842,0.000024243893,0.00010438805,0.00035805107,0.0002930319,0.00013611095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042592463,0.000303896,0.00025256161,0.00016405935,0.00009481353,0.00008291935,0.00035602524,0.00019722008,0.000012391402],"category_scores_gemma":[0.000011247045,0.00026369528,0.000047688573,0.000059420363,0.0007723912,0.000010546496,0.00025367184,0.00014570271,0.0000021753717],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031637208,0.00013919374,0.000071574694,0.0002723961,0.00037480937,0.000083211286,0.00074023573,0.12465966,0.049768053,0.0050632576,0.0002255457,0.8182857],"study_design_scores_gemma":[0.013884604,0.012420412,0.0007736962,0.0013073533,0.0004013901,0.0015608309,0.000009557777,0.42653802,0.013797817,0.45296776,0.068734296,0.0076042553],"about_ca_topic_score_codex":0.000003052287,"about_ca_topic_score_gemma":0.000016035168,"teacher_disagreement_score":0.81068146,"about_ca_system_score_codex":0.00007595213,"about_ca_system_score_gemma":0.00031081127,"threshold_uncertainty_score":0.9999815},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019315021,0.00010907418,0.97896725,0.0000569793,0.0005006594,0.00049236737,7.464009e-7,0.00014180939,0.00041607762],"genre_scores_gemma":[0.825657,0.0000057127913,0.17328693,0.000063014,0.00015699488,0.000015689333,0.0000022313645,0.000034513276,0.00077788957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975256,0.00005966259,0.00038635195,0.0012057341,0.00035511155,0.00046756153],"domain_scores_gemma":[0.9978159,0.0009406869,0.00038704398,0.00040182934,0.00030178286,0.00015276561],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005903865,0.00044040987,0.00049536594,0.00050616974,0.0005893677,0.0012212197,0.00064690487,0.00016625995,0.000003976067],"category_scores_gemma":[0.00009810972,0.0003908887,0.000042821146,0.00016946919,0.00027387933,0.0016658799,0.0005843702,0.0008677018,0.000005209998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027131324,0.00001615392,0.0022413433,0.000074926,0.00003134676,0.000008986179,0.006382176,0.7498982,0.00033355656,0.011648092,5.583852e-7,0.22933754],"study_design_scores_gemma":[0.00031810373,0.00065822795,0.0005990891,0.0012106393,0.000011511897,0.00003859037,0.000013454498,0.9927755,0.00035695598,0.0017449021,0.001767834,0.00050516584],"about_ca_topic_score_codex":0.000040746163,"about_ca_topic_score_gemma":0.000040857776,"teacher_disagreement_score":0.806342,"about_ca_system_score_codex":0.0001652644,"about_ca_system_score_gemma":0.00009734082,"threshold_uncertainty_score":0.9998543},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008100465,0.0005598916,0.9914627,0.000024253344,0.0002187507,0.00014595814,0.000012471441,0.00022030843,0.0072746268],"genre_scores_gemma":[0.69386023,0.000045734414,0.3056853,0.000058002162,0.00017546139,0.000005989952,0.000005304742,0.000048226586,0.00011572647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849534,0.000010206768,0.0002915325,0.00046347518,0.00047092786,0.00026849378],"domain_scores_gemma":[0.99891174,0.00022593445,0.00010496076,0.00047846144,0.00018769056,0.00009121019],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026693835,0.0003008601,0.00053265423,0.0003713813,0.000028796221,0.000019873909,0.0006103729,0.00019356435,0.000017766348],"category_scores_gemma":[0.000063176114,0.00027322152,0.000093968396,0.00034901974,0.0005058016,0.0001553983,0.00023304974,0.00049045624,0.000011647037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007830431,0.000013574216,0.000027217284,0.000041133033,0.00002980189,0.000021539918,0.00015072187,0.540638,0.00067815604,0.0035665578,0.0000948088,0.4547306],"study_design_scores_gemma":[0.00012639246,0.00019301572,0.000029431965,0.00026837375,0.000021787466,0.000012360758,1.6874056e-7,0.49231222,0.016120875,0.48796937,0.0023362562,0.0006097566],"about_ca_topic_score_codex":0.000013925634,"about_ca_topic_score_gemma":0.000041374842,"teacher_disagreement_score":0.69377923,"about_ca_system_score_codex":0.00028706947,"about_ca_system_score_gemma":0.000072009716,"threshold_uncertainty_score":0.999972},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047574297,0.0032615676,0.9912513,0.00034091354,0.0033719535,0.0006971147,0.000015045448,0.00004282723,0.00054353615],"genre_scores_gemma":[0.50062394,0.00024846286,0.4971083,0.000603622,0.00091762684,0.000054717584,0.0000032415471,0.000042898708,0.00039716286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700654,0.0000445874,0.0005498238,0.0007604259,0.0010173245,0.000621307],"domain_scores_gemma":[0.9961388,0.00090904976,0.0005358953,0.002007984,0.00032162858,0.00008662823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017747005,0.00039694234,0.00045108513,0.0003208586,0.0005373688,0.00012744164,0.0037058818,0.00016713084,0.000004423832],"category_scores_gemma":[0.00021265895,0.00022393849,0.00019356153,0.0010003481,0.0008093962,0.0007379411,0.0017659842,0.00054611644,0.000004805272],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008699478,0.000020049938,0.0003758801,0.00017642851,0.000020051193,0.0000013967234,0.00077570014,0.015716897,0.00024072302,0.062228903,0.00003706773,0.9203982],"study_design_scores_gemma":[0.0010567197,0.0004869705,0.0038146556,0.0046790545,0.00008378234,0.00018098924,0.0000031394836,0.78033906,0.054918952,0.036504474,0.11540226,0.0025299452],"about_ca_topic_score_codex":0.000013706876,"about_ca_topic_score_gemma":0.00004441993,"teacher_disagreement_score":0.91786826,"about_ca_system_score_codex":0.00015644923,"about_ca_system_score_gemma":0.00033896562,"threshold_uncertainty_score":0.91319466},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022467095,0.0014096906,0.9905636,0.002859746,0.0016787306,0.00079348503,0.000003336181,0.00031583692,0.0023531218],"genre_scores_gemma":[0.08243796,0.00018450763,0.9066115,0.0015357927,0.0014775428,0.00017990096,0.000012027854,0.00019612283,0.007364657],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941768,0.000088129396,0.0005528408,0.0015701061,0.0025071306,0.0011049594],"domain_scores_gemma":[0.99354124,0.0031623156,0.0002254862,0.0023465306,0.00036996507,0.00035443867],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0025412685,0.0006165245,0.0004887885,0.00065077096,0.00042675066,0.001416459,0.006182193,0.0003293585,0.000013024353],"category_scores_gemma":[0.0009897986,0.00043527584,0.00015065218,0.0008357146,0.00067574915,0.00039065554,0.0022945278,0.001624919,0.00020797706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012903946,0.000021810325,0.000011121079,0.00004219952,0.000027344782,0.00014278168,0.000728757,0.3273799,0.00006146947,0.011922918,0.00036296586,0.6592858],"study_design_scores_gemma":[0.00038604287,0.00068298815,0.000054008015,0.00058533286,0.000007652126,0.00026835338,3.4513988e-7,0.100348756,0.00041230448,0.88068044,0.015550142,0.0010236166],"about_ca_topic_score_codex":0.000029749406,"about_ca_topic_score_gemma":0.00007252478,"teacher_disagreement_score":0.86875755,"about_ca_system_score_codex":0.00087802066,"about_ca_system_score_gemma":0.0018874704,"threshold_uncertainty_score":0.9998099},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012325685,0.00079957914,0.99609023,0.00057804165,0.00048433366,0.00023115368,0.000004848755,0.00036214804,0.0013264066],"genre_scores_gemma":[0.090159446,0.000030997217,0.90833795,0.0009903358,0.00021747086,0.000009939419,0.000006391146,0.000019595935,0.00022785763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969046,0.00005448572,0.0005093281,0.0013332878,0.00077947794,0.00041879338],"domain_scores_gemma":[0.99772775,0.00032151293,0.00028925794,0.0012047663,0.00029661556,0.00016009339],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013475744,0.00037515792,0.0005246187,0.0006608307,0.00016992053,0.00024359795,0.0016383509,0.00032289934,0.0000057060543],"category_scores_gemma":[0.0001683717,0.00034918365,0.00007872645,0.00042853854,0.00058889796,0.0005480628,0.0007737239,0.00061548984,0.000006037098],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006502648,0.000029031029,0.0006801331,0.000051663694,0.000014993891,0.000039141,0.0003774437,0.015368528,0.00047254987,0.06340414,0.000027804746,0.91952807],"study_design_scores_gemma":[0.0003425723,0.00020426688,0.00037265656,0.00024337028,0.000015478045,0.000026921834,1.2983483e-7,0.5165421,0.0016256078,0.4778386,0.0021737178,0.0006145755],"about_ca_topic_score_codex":0.00003632082,"about_ca_topic_score_gemma":0.00022518009,"teacher_disagreement_score":0.9189135,"about_ca_system_score_codex":0.0003672192,"about_ca_system_score_gemma":0.00043404067,"threshold_uncertainty_score":0.999896},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007353893,0.002281198,0.98731995,0.00030476865,0.0010686088,0.0013283218,0.0000025133486,0.00011292037,0.000227829],"genre_scores_gemma":[0.2854315,0.00003535814,0.71378565,0.00037244894,0.00026969955,0.000024842171,0.0000011103663,0.000039303304,0.00004008686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995246,0.00041357873,0.0006565913,0.0019408957,0.00089556904,0.0008473986],"domain_scores_gemma":[0.99694943,0.00065172656,0.00035197052,0.0016074269,0.00016262326,0.00027682935],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023053554,0.00072288775,0.00067056774,0.00069296866,0.000950418,0.0017364745,0.0029200672,0.00025487522,0.000022943637],"category_scores_gemma":[0.000037400554,0.0004906402,0.00016666732,0.000678534,0.0012274819,0.0010575481,0.0023641812,0.0008907805,0.0000059153153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023093586,0.0007327042,0.0013317412,0.00010847764,0.00016772085,0.0001747746,0.023918873,0.021050144,0.006214954,0.012801251,0.000017617645,0.9334586],"study_design_scores_gemma":[0.00065238593,0.0010037799,0.0009385216,0.00041005848,0.00007089663,0.00025896882,0.000028450113,0.958327,0.0065498278,0.03017544,0.00020990186,0.0013747779],"about_ca_topic_score_codex":0.00032783285,"about_ca_topic_score_gemma":0.00010238676,"teacher_disagreement_score":0.93727684,"about_ca_system_score_codex":0.00020303312,"about_ca_system_score_gemma":0.00028838078,"threshold_uncertainty_score":0.99975455},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024410834,0.00062684686,0.9712404,0.00046198198,0.0034043451,0.00076324696,0.000012844516,0.00033930136,0.023126643],"genre_scores_gemma":[0.48038796,0.000088571134,0.50081164,0.0025259063,0.0015664807,0.000082024366,0.0000310135,0.00012042131,0.014385967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99463373,0.000074287316,0.0008073702,0.0021680589,0.0013037036,0.0010128311],"domain_scores_gemma":[0.99617875,0.00056557375,0.00045519703,0.0019045112,0.00057046063,0.00032548435],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008993465,0.0007754187,0.00079588697,0.000862971,0.0004121499,0.0013246939,0.005668936,0.0004168087,0.00009478241],"category_scores_gemma":[0.00012482614,0.0007061482,0.00023138721,0.0011590911,0.0006032268,0.0006074905,0.0020484847,0.0010233087,0.00075862306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063449565,0.00006641452,0.000045699286,0.000093815375,0.000046409295,0.00023234871,0.0027270813,0.12083767,0.000031163345,0.05473634,0.00092904986,0.82024765],"study_design_scores_gemma":[0.00018215527,0.0002841978,0.000092575305,0.0008713311,0.000009551189,0.00016814483,4.8431406e-7,0.7567467,0.00043323758,0.22663294,0.01335208,0.0012265802],"about_ca_topic_score_codex":0.00006188786,"about_ca_topic_score_gemma":0.000029742552,"teacher_disagreement_score":0.8190211,"about_ca_system_score_codex":0.00084244146,"about_ca_system_score_gemma":0.0013352606,"threshold_uncertainty_score":0.99971205},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071520515,0.0001459194,0.9876454,0.009410027,0.00042629376,0.000262547,0.000028322422,0.000092956136,0.0012733194],"genre_scores_gemma":[0.48863164,0.00013210071,0.48334238,0.024699477,0.0018153671,0.00003436147,0.000043044343,0.00004748141,0.0012541569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975713,0.000038467544,0.00026662933,0.0010389199,0.00070823514,0.00037645493],"domain_scores_gemma":[0.996841,0.0015988934,0.00015007904,0.0011588264,0.0001159653,0.00013524308],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00040629593,0.00031561765,0.00026212662,0.00020635383,0.0013009295,0.00038495782,0.0029136736,0.00018801753,0.000011184087],"category_scores_gemma":[0.000074080366,0.00023527624,0.00008252188,0.0003689129,0.0010158288,0.00023402972,0.0034668108,0.00071732566,0.000029879004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002069048,0.00003538683,0.00057976384,0.000005470887,0.000015569038,0.0000059780386,0.0017329097,0.0052575343,0.00003410996,0.8238556,0.0005761248,0.1678995],"study_design_scores_gemma":[0.00016803967,0.00008880632,0.012036005,0.000118011274,0.000009427415,0.000011501097,3.337438e-7,0.3363418,0.00001526419,0.6429054,0.00793094,0.00037448536],"about_ca_topic_score_codex":0.00022690413,"about_ca_topic_score_gemma":0.00011727978,"teacher_disagreement_score":0.50430304,"about_ca_system_score_codex":0.000101052974,"about_ca_system_score_gemma":0.00018488047,"threshold_uncertainty_score":0.9999992},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00979509,0.003747146,0.9338617,0.019911677,0.001463591,0.0014246824,0.0000048499355,0.00084861484,0.028942648],"genre_scores_gemma":[0.9835517,0.00015569189,0.01583965,0.00013978705,0.00010902551,0.000008653906,4.6631735e-7,0.00001637391,0.00017866984],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811035,0.000048909413,0.00026001493,0.0005786356,0.00067286537,0.00032923944],"domain_scores_gemma":[0.99807507,0.00075149565,0.0003616012,0.00050645677,0.00026520318,0.000040149916],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012963832,0.00023342935,0.00038020877,0.00049061934,0.0004333973,0.0003878897,0.0021325778,0.00034030623,0.000007167478],"category_scores_gemma":[0.0005325385,0.00014875073,0.00003287261,0.0005760149,0.008943651,0.0006931195,0.0010750492,0.00078229845,0.000001267269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006610546,0.0000099268955,0.00052546454,0.00003632469,0.000020027079,0.00004277131,0.008793309,0.002479572,0.000007012279,0.024263095,0.000030359193,0.96372604],"study_design_scores_gemma":[0.003541473,0.00038540797,0.000808678,0.005300316,0.00012340616,0.00019128672,0.0005890566,0.02206074,0.002603443,0.9417626,0.020805273,0.0018282812],"about_ca_topic_score_codex":0.00043218755,"about_ca_topic_score_gemma":0.0040634386,"teacher_disagreement_score":0.9737566,"about_ca_system_score_codex":0.00018608596,"about_ca_system_score_gemma":0.0005245625,"threshold_uncertainty_score":0.99375343},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004715739,0.00036486084,0.99591947,0.00025783788,0.00041181088,0.0005842594,0.0000021348399,0.0014668595,0.0009456092],"genre_scores_gemma":[0.02170482,0.00007457688,0.9773662,0.00043232407,0.00021406554,0.000036680896,0.0000040598993,0.00006167061,0.00010561948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561554,0.000023020855,0.0004985289,0.0017222465,0.0012475281,0.0008931145],"domain_scores_gemma":[0.99716836,0.00020104564,0.00026558168,0.0018064093,0.00033237136,0.00022625156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005617745,0.0006783116,0.0005875853,0.0010452096,0.0002677187,0.00042444683,0.0037784434,0.0003458561,0.0000039572014],"category_scores_gemma":[0.000019455323,0.00059149036,0.00012650999,0.0009732745,0.0007915302,0.0006562213,0.000840589,0.0010813042,0.000012265312],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039422703,0.000022054823,0.00008664484,0.000044572043,0.000012527943,0.0003665894,0.00054197985,0.018057337,0.000028275243,0.026766976,0.00004034377,0.9540287],"study_design_scores_gemma":[0.0009429215,0.0013564224,0.00032217288,0.0034862398,0.000027094306,0.0023714437,1.0940598e-7,0.8464475,0.006447255,0.078598335,0.05573259,0.0042678886],"about_ca_topic_score_codex":0.00002498851,"about_ca_topic_score_gemma":0.00003802779,"teacher_disagreement_score":0.94976085,"about_ca_system_score_codex":0.00028352768,"about_ca_system_score_gemma":0.00051643624,"threshold_uncertainty_score":0.99965364},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004464066,0.00049977,0.99449086,0.0002599693,0.00288722,0.0010163349,0.000007665605,0.0007856146,0.00004811576],"genre_scores_gemma":[0.0027836936,0.000023599865,0.9955959,0.00045413396,0.00061639637,0.00005865336,0.000011361488,0.00006116546,0.00039513977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960765,0.000061585386,0.0005570488,0.0019736157,0.0005978215,0.0007334336],"domain_scores_gemma":[0.99480164,0.0026471145,0.00037732892,0.001433097,0.00060915464,0.00013164573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016045256,0.00064870965,0.00071501674,0.0006663336,0.0002841219,0.0003487145,0.0026055437,0.0003052139,0.000002843957],"category_scores_gemma":[0.0032959983,0.00061386393,0.00016316626,0.00039862006,0.00045568627,0.0006032653,0.0007847977,0.00074134365,0.0000111126565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005846213,0.000008859439,0.0000018796449,0.000055914566,0.000009477065,0.000007100254,0.0005300383,0.6102022,0.0004076881,0.0037536202,0.0000054853294,0.3850119],"study_design_scores_gemma":[0.0005880087,0.00038116242,0.000029001545,0.0004566337,0.0000145569,0.000042207837,2.5682985e-7,0.8937371,0.017314238,0.08488811,0.0013708926,0.0011778766],"about_ca_topic_score_codex":0.0000044965573,"about_ca_topic_score_gemma":0.000016833554,"teacher_disagreement_score":0.38383403,"about_ca_system_score_codex":0.00039943057,"about_ca_system_score_gemma":0.0004174168,"threshold_uncertainty_score":0.9996313},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013596755,0.00024583453,0.98100877,0.00080145383,0.0010365122,0.00028297762,0.0000019532574,0.00016702304,0.0028587114],"genre_scores_gemma":[0.9796537,0.00004545805,0.01929489,0.000092003436,0.00047200837,0.0000053363447,0.0000018062856,0.000031303844,0.00040346352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966967,0.000100912446,0.00040615274,0.00093478285,0.0013343565,0.0005270833],"domain_scores_gemma":[0.99721044,0.0007822452,0.00035675077,0.0012311218,0.00026587705,0.00015355385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017374185,0.0004529201,0.00054460607,0.00063041394,0.00022025514,0.00035705903,0.0033700026,0.00011474287,0.0000052982987],"category_scores_gemma":[0.00024259328,0.0002863068,0.00027280272,0.000676339,0.00041741904,0.00036812053,0.0012241052,0.0014765416,0.000033360007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048395123,0.000036606347,0.00038946903,0.000010388319,0.000025792058,0.00003119717,0.0016838509,0.7431542,0.000029921512,0.0043593748,0.000016416665,0.2502579],"study_design_scores_gemma":[0.00040022418,0.0020928613,0.002896343,0.00092078914,0.000019955092,0.00004277393,0.0000019829213,0.9617098,0.0002343125,0.03034913,0.00058884604,0.0007429575],"about_ca_topic_score_codex":0.000042603886,"about_ca_topic_score_gemma":0.000010671655,"teacher_disagreement_score":0.966057,"about_ca_system_score_codex":0.00035940384,"about_ca_system_score_gemma":0.00057752413,"threshold_uncertainty_score":0.99995893},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033691706,0.0003746558,0.9914152,0.000712575,0.000871057,0.00055152236,0.00010426502,0.0002736327,0.0053601954],"genre_scores_gemma":[0.10764728,0.000056213023,0.88724256,0.0035217786,0.00095390837,0.000051622454,0.00014990085,0.00008372485,0.00029299795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946024,0.000025815993,0.0005472615,0.0024854206,0.00143617,0.0009029251],"domain_scores_gemma":[0.9960082,0.0006567275,0.0003633947,0.0022026994,0.0004244407,0.00034450143],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005459565,0.00078266236,0.0006300009,0.00068714767,0.0004183212,0.0014336577,0.0056287837,0.00043069242,0.00053687237],"category_scores_gemma":[0.0000807447,0.00065601507,0.00018251242,0.000985941,0.00084319495,0.001806901,0.0023236268,0.0012373022,0.00012429917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005411199,0.0002308626,0.001236572,0.00044271132,0.00016492764,0.0009432933,0.0037920538,0.050607182,0.00018646895,0.7795075,0.0020923575,0.16074193],"study_design_scores_gemma":[0.0009565694,0.0005317203,0.0015937485,0.0016581031,0.00003118259,0.00037131133,0.000001138369,0.3093588,0.00031326033,0.67632926,0.006434974,0.0024199286],"about_ca_topic_score_codex":0.00005491373,"about_ca_topic_score_gemma":0.00032817473,"teacher_disagreement_score":0.25875163,"about_ca_system_score_codex":0.0001900273,"about_ca_system_score_gemma":0.0005486056,"threshold_uncertainty_score":0.99975127},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008349312,0.000075413904,0.99570996,0.0014482257,0.00086510903,0.00032898295,9.300851e-7,0.0005057098,0.00023073431],"genre_scores_gemma":[0.2115028,0.000009332068,0.785815,0.0024177597,0.00023640844,0.000009025996,0.000004166898,0.0000039175666,0.0000015968949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729544,0.00010102338,0.0004818521,0.00041506244,0.0010824034,0.00062419],"domain_scores_gemma":[0.9981605,0.0002839762,0.00021102042,0.0007543848,0.00021913114,0.0003710162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015451418,0.00021118486,0.00019746264,0.00072677043,0.00020058597,0.0007324192,0.0017428459,0.0001083056,0.000030045006],"category_scores_gemma":[0.00042900714,0.0001861521,0.000050385894,0.004300671,0.00022454048,0.008308223,0.0005098735,0.00034730317,0.00008676202],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044212807,0.00014177241,0.0013050537,0.00003366635,0.0000061044016,0.000007851188,0.0049850023,0.00011688134,0.0010232955,0.0017748799,0.0009266227,0.98967445],"study_design_scores_gemma":[0.00069701154,0.00020122614,0.006655152,0.000045766363,0.000007854771,0.00011277134,0.0000024348872,0.804868,0.1761589,0.009130584,0.0015341754,0.0005861227],"about_ca_topic_score_codex":0.00005976118,"about_ca_topic_score_gemma":0.000008779801,"teacher_disagreement_score":0.9890883,"about_ca_system_score_codex":0.00024843935,"about_ca_system_score_gemma":0.00047327633,"threshold_uncertainty_score":0.7591062},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003087017,0.0008180109,0.9870343,0.000109669,0.010305415,0.00093198713,0.000012423477,0.00039291056,0.0003643646],"genre_scores_gemma":[0.20139474,0.00003070899,0.78975886,0.00029631346,0.0042437804,0.00008448311,0.000034869816,0.00015652896,0.003999733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99493164,0.00009897092,0.0008707858,0.0019477316,0.0012267063,0.00092416984],"domain_scores_gemma":[0.99543136,0.00070749136,0.0005253393,0.0017043554,0.0012593244,0.00037213895],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024147695,0.00074256037,0.0008080344,0.0009061087,0.00040819735,0.0015473453,0.003749518,0.00059065217,0.000009656831],"category_scores_gemma":[0.00031837058,0.0006614763,0.00019104157,0.0005998076,0.00025691788,0.0008732639,0.00058629055,0.0012705489,0.00005530134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075821135,0.000030113542,0.000047222813,0.00009797224,0.000021385506,0.000035748828,0.001529303,0.3035536,0.000020908381,0.47253796,0.000020450556,0.22209774],"study_design_scores_gemma":[0.0001571183,0.00060539076,0.000009440302,0.0028597156,0.000012359164,0.00007060465,0.000007907844,0.8389525,0.00044363685,0.10413487,0.051641226,0.0011052669],"about_ca_topic_score_codex":0.00010901393,"about_ca_topic_score_gemma":0.000013293768,"teacher_disagreement_score":0.53539884,"about_ca_system_score_codex":0.0010598678,"about_ca_system_score_gemma":0.00085875695,"threshold_uncertainty_score":0.99958366},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012321376,0.0004166575,0.9832071,0.0008683426,0.0016871339,0.0002921289,0.0000010074274,0.00034836872,0.013056062],"genre_scores_gemma":[0.076808244,0.00008186574,0.9127882,0.0019550093,0.0012081179,0.000018593917,0.000009336423,0.00008365091,0.007046943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956106,0.00007102498,0.00051504245,0.0017785495,0.0011831718,0.00084159436],"domain_scores_gemma":[0.9970851,0.0007194356,0.0002781319,0.0013360052,0.00031539676,0.00026592307],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000862887,0.00061557855,0.00060010684,0.0008785893,0.00042257784,0.001067876,0.004163764,0.0003420842,0.00020153828],"category_scores_gemma":[0.0002508142,0.00054181163,0.00017697875,0.0006261945,0.0004647513,0.0006929941,0.001772781,0.0019475181,0.0006784936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012523788,0.000012125266,0.00007916972,0.000012934019,0.000008047841,0.000075985234,0.0006002913,0.04647607,0.000041658444,0.009927088,0.000041857173,0.9427235],"study_design_scores_gemma":[0.0002439126,0.00018789049,0.00016129593,0.00024729644,0.0000047403373,0.00007838737,1.5044898e-7,0.9074748,0.00020464747,0.0839688,0.0067083333,0.0007197577],"about_ca_topic_score_codex":0.000062640895,"about_ca_topic_score_gemma":0.000013735945,"teacher_disagreement_score":0.9420038,"about_ca_system_score_codex":0.00019730876,"about_ca_system_score_gemma":0.00041220008,"threshold_uncertainty_score":0.9999691},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000330588,0.00049933104,0.9942151,0.000056516492,0.00051293185,0.00015470966,0.000011687228,0.00047440061,0.0037447875],"genre_scores_gemma":[0.2694946,0.00001815794,0.7302343,0.000033713917,0.00009731618,0.0000040421232,0.000003291584,0.00004797024,0.0000666084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831605,0.000006037195,0.00040352877,0.00046913925,0.00044547804,0.00035979607],"domain_scores_gemma":[0.9986417,0.00026241323,0.00011407055,0.0007510051,0.0001631027,0.00006765507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042696748,0.00030249116,0.0004533637,0.00030509813,0.00003260664,0.000053929365,0.0009829007,0.00021606016,0.000008975146],"category_scores_gemma":[0.000414757,0.00027850355,0.000062581836,0.00021110105,0.0010022278,0.0002483915,0.00052958226,0.0006453347,0.000012565135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007391336,0.000013953072,0.000044172557,0.0003446896,0.000014500794,0.00003053801,0.00017467998,0.1937017,0.024169125,0.010828643,0.00004036332,0.77063024],"study_design_scores_gemma":[0.00023600143,0.000057582918,0.0000697444,0.00028663664,0.000009455121,0.00001003306,3.5441684e-7,0.7056368,0.019804548,0.2729795,0.00025691424,0.00065242196],"about_ca_topic_score_codex":0.000008897989,"about_ca_topic_score_gemma":0.000014966717,"teacher_disagreement_score":0.7699778,"about_ca_system_score_codex":0.0002361617,"about_ca_system_score_gemma":0.000076601515,"threshold_uncertainty_score":0.99996674},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023021458,0.0012310413,0.9724476,0.000080801925,0.0006479519,0.00049066235,0.000010555219,0.000040059535,0.0020299216],"genre_scores_gemma":[0.9975051,0.00022483522,0.0021024162,0.0000694311,0.000053366857,0.000004058031,0.000004945746,0.0000150443575,0.00002080219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990419,0.000014605675,0.00022720067,0.00025868556,0.00030127223,0.00015629965],"domain_scores_gemma":[0.9995229,0.00015612782,0.000055423476,0.00020807706,0.00002137379,0.000036077985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038835232,0.00016212741,0.00019685081,0.00017526918,0.000031991854,0.000025930443,0.00024240052,0.000114261245,0.000005393269],"category_scores_gemma":[0.000028874785,0.00012943493,0.000020857444,0.00013918515,0.0002731697,0.00007936917,0.00007637654,0.00031193785,0.000004637948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018625466,0.000020111906,0.0025214697,0.00025026998,0.000017259765,0.000027580625,0.0020464219,0.39500248,0.006747241,0.00076402206,0.000020863072,0.5925636],"study_design_scores_gemma":[0.00045890515,0.000070201546,0.005957627,0.0007225443,0.000014158687,0.000008977497,0.0000023087532,0.96946496,0.0043398724,0.01765266,0.00087800226,0.00042980738],"about_ca_topic_score_codex":0.00004133503,"about_ca_topic_score_gemma":0.00021993926,"teacher_disagreement_score":0.97448367,"about_ca_system_score_codex":0.0000791846,"about_ca_system_score_gemma":0.000031956777,"threshold_uncertainty_score":0.52782035},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005105471,0.00093057076,0.98371226,0.0005393583,0.000613442,0.00028152423,0.0000025073946,0.00025299363,0.013156829],"genre_scores_gemma":[0.37505665,0.000020744585,0.62279576,0.0011061709,0.00057817786,0.0000063525963,0.000006109352,0.000045665915,0.00038440345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965535,0.00004759295,0.00041216306,0.0014578148,0.00083223375,0.00069668656],"domain_scores_gemma":[0.9975605,0.0004458355,0.00029686457,0.0009217599,0.0003850098,0.0003900238],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001036468,0.0005240581,0.00052324875,0.0005501317,0.00047753903,0.0007494931,0.0018450498,0.00023151045,0.0000072713515],"category_scores_gemma":[0.00017690739,0.00041883916,0.000059933638,0.00071054377,0.0013459239,0.00061447395,0.0014202539,0.00076845894,0.000029082368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034496436,0.000050393068,0.001323015,0.000111252564,0.000038129336,0.00014859483,0.008064158,0.028485006,0.0000962123,0.39451513,0.0001777155,0.5669869],"study_design_scores_gemma":[0.00043601403,0.0003336644,0.0003583815,0.0007646589,0.00001698665,0.0003091063,0.0000010347638,0.6707017,0.00020891715,0.32430026,0.0016664864,0.0009028492],"about_ca_topic_score_codex":0.000026973423,"about_ca_topic_score_gemma":0.00020154833,"teacher_disagreement_score":0.6422166,"about_ca_system_score_codex":0.00019728328,"about_ca_system_score_gemma":0.0007949388,"threshold_uncertainty_score":0.9998264},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017193643,0.00017375508,0.9786516,0.000111825866,0.0015544669,0.0006362556,0.000048136055,0.00007582546,0.0015544868],"genre_scores_gemma":[0.98388183,0.000026608992,0.01562511,0.00012511753,0.000114856004,0.000015465197,0.000002652081,0.000023855117,0.00018452678],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99647456,0.000086298416,0.0008323011,0.0011511635,0.0009986989,0.00045698052],"domain_scores_gemma":[0.99712825,0.00071610766,0.0005805641,0.0011394288,0.00030370784,0.00013193721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010362901,0.00042182585,0.00085567345,0.001772432,0.000056350065,0.000107418986,0.0019736309,0.00031977464,0.000020837317],"category_scores_gemma":[0.00013945952,0.0004229038,0.00014739078,0.0008780585,0.0002896815,0.00091250264,0.0008350026,0.00055124715,0.000008048443],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052633884,0.00015340316,0.009638717,0.00033576714,0.000034949375,0.000047800306,0.013073149,0.0013097265,0.0021833505,0.0018142904,0.000013350824,0.97134286],"study_design_scores_gemma":[0.005181367,0.0075570783,0.13481347,0.027031612,0.00011302824,0.000683507,0.000060767852,0.1273964,0.53986585,0.14778824,0.0025870304,0.006921633],"about_ca_topic_score_codex":0.00034003117,"about_ca_topic_score_gemma":0.0010643351,"teacher_disagreement_score":0.96668816,"about_ca_system_score_codex":0.00026142073,"about_ca_system_score_gemma":0.00048526886,"threshold_uncertainty_score":0.99982226},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007405672,0.0001810634,0.98887527,0.0014379352,0.0015315958,0.0010505969,0.000010675866,0.00015602821,0.0067494395],"genre_scores_gemma":[0.053124484,0.000068721456,0.93813366,0.0027002587,0.0006867475,0.00009101485,0.000015500395,0.000061034032,0.0051185656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972369,0.000028205723,0.00046709282,0.0010941053,0.0006044277,0.0005692886],"domain_scores_gemma":[0.9967013,0.0015186457,0.0003287192,0.00092763663,0.00039443813,0.000129237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007789511,0.0004246069,0.0003809972,0.0004426634,0.0005729524,0.0007851826,0.0018932709,0.00023732347,0.0002659003],"category_scores_gemma":[0.00016343442,0.00031962802,0.0001402134,0.0004489927,0.0011309305,0.00070761517,0.0005624743,0.0005239115,0.00012612653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023800644,0.000008628151,0.000003934645,0.000011342271,0.00001601478,0.0000040561185,0.00057482265,0.0873967,0.000057409383,0.048396584,0.00013974129,0.86338836],"study_design_scores_gemma":[0.00024692205,0.0000732268,0.000081286584,0.00013241086,0.000010500848,0.000045114906,7.6253366e-7,0.93312895,0.0003129058,0.06241237,0.003148837,0.00040671937],"about_ca_topic_score_codex":0.000012835773,"about_ca_topic_score_gemma":0.000020613877,"teacher_disagreement_score":0.8629817,"about_ca_system_score_codex":0.00026600892,"about_ca_system_score_gemma":0.0006032797,"threshold_uncertainty_score":0.99992555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035115767,0.00002019374,0.97979337,0.00071531173,0.0044671195,0.0009808844,0.000035157373,0.0001683642,0.010307997],"genre_scores_gemma":[0.9404915,0.000039694238,0.03064817,0.02272498,0.00047429296,0.000052581338,0.00001047086,0.00010393242,0.005454392],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9958179,0.00004857054,0.00052397937,0.001939626,0.00088758586,0.000782352],"domain_scores_gemma":[0.9972419,0.0008183805,0.00027943865,0.0010843911,0.00020058682,0.00037528193],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001515837,0.00055857224,0.00047805192,0.0010580784,0.0004043231,0.0001842732,0.0012766556,0.0002540209,0.0009616782],"category_scores_gemma":[0.00062323094,0.0005214134,0.00016258487,0.0004958602,0.0006923451,0.00057266804,0.00044764657,0.00081153866,0.00049546326],"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.0002473382,0.00019364474,0.000059240367,0.000042450898,0.000011854293,0.0013724184,0.013305889,0.007882378,0.7254759,0.0006527228,0.0007988798,0.24995726],"study_design_scores_gemma":[0.00043968856,0.0006426177,0.00007460607,0.00058603496,0.000021916514,0.0002170886,0.000004364188,0.0601062,0.9157099,0.0013687209,0.019732183,0.0010966612],"about_ca_topic_score_codex":0.0000647538,"about_ca_topic_score_gemma":0.000042597145,"teacher_disagreement_score":0.9491452,"about_ca_system_score_codex":0.00033147444,"about_ca_system_score_gemma":0.00031948503,"threshold_uncertainty_score":0.9999516},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028552734,0.00026640017,0.9891642,0.0022601439,0.0006657614,0.00030432886,0.000024753299,0.000048562946,0.0044105756],"genre_scores_gemma":[0.9673428,0.000021282485,0.029946072,0.0017085916,0.00013166154,0.0000042936017,6.71028e-7,0.000024443209,0.00082020625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976837,0.00008698532,0.00039821386,0.0006304106,0.0008708923,0.0003298158],"domain_scores_gemma":[0.9961424,0.0011001119,0.00044864017,0.002117951,0.00014462596,0.00004626932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010894886,0.0002868577,0.00037856703,0.00019861851,0.00015024599,0.00008349443,0.0050223656,0.0001056205,0.000032607175],"category_scores_gemma":[0.00012119487,0.00013581754,0.00016238813,0.00035247699,0.0024052255,0.00015623446,0.0014983345,0.00036129396,0.000010130524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005467989,0.000022548329,0.000015020648,0.000029225308,0.000012557721,0.000006549737,0.00080835784,0.0013725951,0.0012496215,0.8043849,0.000053439486,0.1920397],"study_design_scores_gemma":[0.000122045574,0.00009425007,0.0003436768,0.00064104405,0.000003958657,0.000011336187,3.7506362e-7,0.026216894,0.028670296,0.9434699,0.00021161973,0.00021461294],"about_ca_topic_score_codex":0.00002257792,"about_ca_topic_score_gemma":0.000026284279,"teacher_disagreement_score":0.9644875,"about_ca_system_score_codex":0.00006966285,"about_ca_system_score_gemma":0.0001903108,"threshold_uncertainty_score":0.9332888},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005643574,0.00012271488,0.9734793,0.016857756,0.0012801959,0.001390163,0.000018555087,0.00006387374,0.0011439108],"genre_scores_gemma":[0.9886787,0.000091307105,0.001186974,0.0013579756,0.00029254289,0.000047092253,0.0000011099261,0.00003943646,0.008304859],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802375,0.000070376016,0.00019014908,0.00077877415,0.0005090672,0.00042789517],"domain_scores_gemma":[0.99521816,0.0035760282,0.0003342267,0.00064626656,0.00015295397,0.000072391245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015456781,0.00033533893,0.0003174054,0.00021263926,0.0005268174,0.00066660135,0.0010118837,0.00018005441,0.000030883228],"category_scores_gemma":[0.0004287553,0.0001967715,0.0001338754,0.00023056494,0.0011799014,0.00038466582,0.00038927057,0.0010117036,0.000007218218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001861409,0.00011924036,0.00009052611,0.0002533439,0.00011550343,0.000037735575,0.0069633205,0.09841431,0.21472892,0.01942228,0.0013783126,0.6582904],"study_design_scores_gemma":[0.0006962992,0.00066931755,0.0005036056,0.0003838024,0.000078151264,0.00041231958,0.00005903807,0.7982709,0.09666558,0.015561823,0.08585742,0.00084177597],"about_ca_topic_score_codex":0.000027459711,"about_ca_topic_score_gemma":0.000042738724,"teacher_disagreement_score":0.98303515,"about_ca_system_score_codex":0.000059903243,"about_ca_system_score_gemma":0.0001023401,"threshold_uncertainty_score":0.8024109},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032478102,0.00028889565,0.97873116,0.00038083768,0.002274929,0.0006811232,0.0000028156906,0.00020046337,0.017115],"genre_scores_gemma":[0.04548237,0.00006291115,0.9521396,0.0010088055,0.00036195392,0.00004339694,0.000004934413,0.000042188563,0.0008538423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99494636,0.000102827275,0.00086144754,0.001741876,0.0011539927,0.0011935133],"domain_scores_gemma":[0.99668103,0.00036879515,0.0004900544,0.0019989093,0.00024184154,0.00021937645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025166771,0.0006367057,0.000642479,0.0013739574,0.00027249937,0.0007579086,0.004704618,0.00055789115,0.000043718814],"category_scores_gemma":[0.00031483217,0.0006052501,0.0001371589,0.0010351967,0.0006946528,0.0022948221,0.0017880308,0.0014672001,0.00012487944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006543107,0.000022353583,0.00008160029,0.000039559756,0.0000046774207,0.00003713349,0.0008697176,0.0046288306,0.0001385227,0.16080132,0.00002393652,0.83334583],"study_design_scores_gemma":[0.0002938934,0.00013316462,0.002376878,0.0006257932,0.0000036480096,0.000071901675,4.0351352e-7,0.95223576,0.0010828134,0.040979713,0.0013967426,0.00079926115],"about_ca_topic_score_codex":0.000057506222,"about_ca_topic_score_gemma":0.00008019334,"teacher_disagreement_score":0.947607,"about_ca_system_score_codex":0.0006402278,"about_ca_system_score_gemma":0.0005416436,"threshold_uncertainty_score":0.99963987},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000064485976,0.0010083681,0.98287404,0.0010184353,0.0020314907,0.0005562816,0.0000037702623,0.00021091789,0.01223219],"genre_scores_gemma":[0.35188958,0.00006675621,0.6451917,0.0015985451,0.0004423425,0.000028583776,0.000017385024,0.00007268801,0.0006923984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99520403,0.00015208656,0.0007096053,0.0018170464,0.0012747966,0.0008424491],"domain_scores_gemma":[0.99676126,0.00055848755,0.00034980426,0.0016508179,0.0004516743,0.00022792663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026916435,0.00068535685,0.00074714347,0.0010856468,0.00024516918,0.0005920147,0.0035390113,0.000518733,0.00004795819],"category_scores_gemma":[0.0003044451,0.00057268125,0.00009794338,0.0013922623,0.00064141833,0.00088895275,0.0013426669,0.000995484,0.00008453192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025513005,0.000052886935,0.00013907552,0.000032855856,0.00001670883,0.00015816363,0.0027952364,0.031238852,0.000027427379,0.581937,0.000057063204,0.3835192],"study_design_scores_gemma":[0.00043109694,0.00012382322,0.00009872243,0.00014236136,0.0000058034366,0.00004089973,6.591548e-7,0.28020057,0.000056598525,0.71703863,0.0012529532,0.0006079082],"about_ca_topic_score_codex":0.00005709849,"about_ca_topic_score_gemma":0.0002929792,"teacher_disagreement_score":0.3829113,"about_ca_system_score_codex":0.00040713444,"about_ca_system_score_gemma":0.0012616797,"threshold_uncertainty_score":0.9996725},"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":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.2867604e-7,0.00079993537,0.9955713,0.00029025445,0.0009223964,0.0018311552,0.000006890246,0.00015925601,0.00041795033],"genre_scores_gemma":[0.0055966363,0.00011922037,0.99300873,0.00077412935,0.00027934895,0.000074035655,0.000007643325,0.000036457146,0.0001038078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950552,0.00013827826,0.0015446111,0.0013348093,0.0013704111,0.0005566835],"domain_scores_gemma":[0.99450547,0.0014546595,0.001244047,0.0022095873,0.00039049375,0.00019577716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0049134484,0.0004948419,0.0014075667,0.00078963576,0.00018500049,0.0002486306,0.0047045196,0.00047098487,0.000008225079],"category_scores_gemma":[0.001438741,0.00041065016,0.00023058183,0.0005391744,0.0005645607,0.00040209512,0.00092482247,0.0005267442,0.000008520288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047246926,0.000043296437,0.000011590936,0.015987976,0.0000265622,0.000018426746,0.00045765837,0.00090606103,0.0013312631,0.12548773,0.00013861893,0.8555861],"study_design_scores_gemma":[0.00015883632,0.00009599465,0.0000016185583,0.012289434,0.000017686745,0.00007214101,9.1484665e-8,0.9301642,0.0034308124,0.052130144,0.0011938682,0.0004451361],"about_ca_topic_score_codex":0.000008312943,"about_ca_topic_score_gemma":0.000013761941,"teacher_disagreement_score":0.92925817,"about_ca_system_score_codex":0.00031244697,"about_ca_system_score_gemma":0.0006700558,"threshold_uncertainty_score":0.99983454},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022270588,0.00008034991,0.9913345,0.0014788936,0.0031559444,0.0019247778,0.00004982191,0.0005917098,0.0013617518],"genre_scores_gemma":[0.03899258,0.000043631397,0.9540308,0.0034447531,0.0016151834,0.00057312933,0.00021903284,0.00017091802,0.00090997014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942267,0.00014012645,0.0011321513,0.0024094048,0.0011558143,0.0009357907],"domain_scores_gemma":[0.99476564,0.0012376837,0.00079288223,0.002280326,0.0006625288,0.0002609183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023620347,0.0007430184,0.0009340526,0.0011081317,0.0006195058,0.00067028217,0.0023644373,0.000562472,0.000006299505],"category_scores_gemma":[0.00007799929,0.00071383244,0.0003704923,0.0012100664,0.0005607051,0.00061356876,0.00073934195,0.0007020756,0.00003304515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018201546,0.0001755731,0.000036991212,0.00043769434,0.00008642608,0.000041235933,0.0002753092,0.021381814,0.00009352837,0.022606742,0.0020166934,0.9528298],"study_design_scores_gemma":[0.0005381471,0.000151371,0.00022469602,0.000845951,0.000043303076,0.00024465504,5.618706e-7,0.9724266,0.0023051018,0.011468248,0.01057802,0.0011733406],"about_ca_topic_score_codex":0.0000651196,"about_ca_topic_score_gemma":0.00011365082,"teacher_disagreement_score":0.95165646,"about_ca_system_score_codex":0.0014153001,"about_ca_system_score_gemma":0.0008564077,"threshold_uncertainty_score":0.99953127},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009768268,0.001985592,0.9926678,0.00057833816,0.0029008666,0.0006741687,0.00029525382,0.0002102227,0.0006780248],"genre_scores_gemma":[0.017902138,0.00006697383,0.98003787,0.0006703634,0.00059647794,0.000014486615,0.00034971384,0.000048723607,0.0003132827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99474335,0.000036657246,0.0005919494,0.0025530152,0.0013138116,0.00076119823],"domain_scores_gemma":[0.9939285,0.00057647034,0.00039915688,0.0043781474,0.00044240127,0.00027531848],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011806892,0.0006392663,0.000683182,0.0005770427,0.00036042882,0.0009507136,0.0129470285,0.00036174507,0.000018033781],"category_scores_gemma":[0.00016048616,0.000523991,0.00009204691,0.0003978884,0.00075183064,0.0016729864,0.0062486213,0.0006515447,0.000017379301],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014463237,0.000025072295,0.00000751045,0.00007183703,0.00002065668,0.00005353903,0.00024423096,0.027914796,0.00013950048,0.027421836,0.0010981387,0.9429884],"study_design_scores_gemma":[0.00026739217,0.00010753254,0.00002183404,0.00016275223,0.000008234731,0.00004030029,1.219859e-7,0.6696839,0.00009470656,0.31517035,0.013954622,0.00048826216],"about_ca_topic_score_codex":0.000046248046,"about_ca_topic_score_gemma":0.000100568854,"teacher_disagreement_score":0.9425002,"about_ca_system_score_codex":0.0002477257,"about_ca_system_score_gemma":0.0011078161,"threshold_uncertainty_score":0.99972117},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062946667,0.000064298045,0.99699944,0.0002592505,0.0003608725,0.0011232675,0.000010004474,0.000058197613,0.0004951968],"genre_scores_gemma":[0.15942298,0.000013166587,0.8367954,0.00048537037,0.00016682164,0.00010257507,0.0000046033033,0.00004346994,0.002965621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997203,0.000032499036,0.00045372188,0.0011474729,0.0008015266,0.00036176335],"domain_scores_gemma":[0.99675053,0.0017884086,0.00035920864,0.000598114,0.00035679695,0.00014695963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017413496,0.00032002595,0.0003764837,0.00032454485,0.0005798774,0.00084858347,0.0009948363,0.00023348731,0.00012266563],"category_scores_gemma":[0.00020078856,0.00022627346,0.00005503401,0.00042738373,0.000931937,0.00042670895,0.00025507298,0.00038791678,0.00006669215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024652312,0.000008542569,0.000005495922,0.000006161539,0.000007779403,0.0000022285788,0.00043795447,0.89073575,0.000107496686,0.029151354,0.0000542896,0.07945831],"study_design_scores_gemma":[0.00022964682,0.00021199309,0.000009666291,0.0000896962,0.000009617391,0.000051642124,0.0000015919854,0.6823917,0.0005089276,0.31505027,0.0011671695,0.0002780498],"about_ca_topic_score_codex":0.000007435134,"about_ca_topic_score_gemma":0.000009906591,"teacher_disagreement_score":0.28589892,"about_ca_system_score_codex":0.00007464283,"about_ca_system_score_gemma":0.00025804693,"threshold_uncertainty_score":0.92271644},"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":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019978385,0.00009548624,0.9840323,0.002283194,0.0013332099,0.0012257234,0.00011976692,0.000019908706,0.008892613],"genre_scores_gemma":[0.95539874,0.00011814123,0.041462384,0.0011429461,0.0008544286,0.00003393189,0.00013758885,0.000028306293,0.00082352426],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664646,0.00023483566,0.00086627423,0.00034951663,0.0014992602,0.00040362653],"domain_scores_gemma":[0.9930214,0.0013822741,0.0004079293,0.00026894273,0.0048494036,0.00007004982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026981048,0.00013597235,0.0002907701,0.0007346135,0.000332764,0.00033045933,0.0006645961,0.00019994672,0.00004493921],"category_scores_gemma":[0.0062511745,0.0001293263,0.000038645147,0.0008722121,0.00051307515,0.0010348972,0.00016559003,0.0002530844,0.0000054461375],"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.00015178323,0.000051366802,0.007049587,0.0003591154,0.000018267689,0.0000026484825,0.1842508,0.010438644,0.00006264237,0.116219595,0.010548978,0.6708466],"study_design_scores_gemma":[0.0019490508,0.0007145517,0.0037607085,0.0024503479,0.000014783259,0.0000030021265,0.0009577223,0.114351094,0.0015233937,0.63995767,0.23290402,0.0014136733],"about_ca_topic_score_codex":0.00916238,"about_ca_topic_score_gemma":0.032350812,"teacher_disagreement_score":0.9534009,"about_ca_system_score_codex":0.00053082936,"about_ca_system_score_gemma":0.0016269798,"threshold_uncertainty_score":0.9974357},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022326123,0.00015180203,0.9855619,0.0012102578,0.0013329539,0.00042086781,0.000004557034,0.00021384367,0.011081503],"genre_scores_gemma":[0.73203677,0.000023590874,0.2626457,0.003202015,0.0012678155,0.000024854164,0.000002910196,0.00004647084,0.0007498747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960879,0.000036577967,0.000529561,0.0015018106,0.0011178713,0.0007262758],"domain_scores_gemma":[0.9971401,0.00051148416,0.00037115216,0.0015130668,0.0002692881,0.00019488944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085488503,0.00049684936,0.0004804818,0.00049927854,0.00034809663,0.0005570686,0.0031493471,0.00023266287,0.00008633905],"category_scores_gemma":[0.000042134398,0.0003635568,0.000104051505,0.00037385183,0.00068263494,0.0005786232,0.0006689266,0.00051699975,0.00014004433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022531529,0.00003251962,0.00009134678,0.000026354282,0.000031631025,0.00006941644,0.00069503894,0.015694106,0.00008778409,0.43595248,0.00002890813,0.54726785],"study_design_scores_gemma":[0.0016679355,0.00056167494,0.00007289561,0.00091829005,0.00002112545,0.00013805971,1.7899757e-7,0.8402685,0.0025016046,0.12532629,0.027077237,0.001446208],"about_ca_topic_score_codex":0.000009775277,"about_ca_topic_score_gemma":0.000011066303,"teacher_disagreement_score":0.8245744,"about_ca_system_score_codex":0.00028570948,"about_ca_system_score_gemma":0.0006220897,"threshold_uncertainty_score":0.9998816},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005280433,0.00021705091,0.988736,0.0015937126,0.0041527012,0.0004361868,0.000003833456,0.00012784422,0.0042046537],"genre_scores_gemma":[0.30532566,0.000037649486,0.67926854,0.0077039767,0.0046151057,0.00013342788,0.0000702161,0.00016842852,0.0026769638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948885,0.00003999968,0.00065683754,0.0018328323,0.0014981173,0.0010837493],"domain_scores_gemma":[0.9972288,0.0005642349,0.00029692415,0.0011897983,0.00031904434,0.00040120157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011554539,0.00060307153,0.00065314653,0.0011597058,0.00028735478,0.00074521266,0.0022846782,0.00025666572,0.000019112349],"category_scores_gemma":[0.0001432005,0.0005550999,0.00026749875,0.00048607492,0.00026683338,0.0007002372,0.0010667754,0.00046687678,0.00009061396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000776982,0.00022478138,0.0005283325,0.00013824356,0.00019149462,0.00013682892,0.0040385807,0.022865348,0.00020181604,0.21535185,0.0020635833,0.75418144],"study_design_scores_gemma":[0.0017453642,0.0012393254,0.00013650882,0.0020086777,0.00004675084,0.00006976724,0.0000053307717,0.8034341,0.0036948775,0.15772985,0.027761856,0.0021276025],"about_ca_topic_score_codex":0.000016430164,"about_ca_topic_score_gemma":0.000004431447,"teacher_disagreement_score":0.7805687,"about_ca_system_score_codex":0.00044590866,"about_ca_system_score_gemma":0.0004201931,"threshold_uncertainty_score":0.99969006},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059175277,0.000027637161,0.9911975,0.0016414218,0.00049898814,0.00027082083,7.6797096e-7,0.00037848286,0.00006680134],"genre_scores_gemma":[0.40729302,0.0000030309934,0.58992624,0.0026878624,0.000065164895,0.000013131264,0.0000029667444,0.0000067903156,0.0000017998492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728435,0.00014415613,0.00039492952,0.00081418117,0.00081981235,0.0005425437],"domain_scores_gemma":[0.9984795,0.00034497943,0.0001471279,0.00071511464,0.00013639906,0.00017691273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014706389,0.000208993,0.0002056276,0.00036309828,0.00022637029,0.0006404992,0.0018739977,0.000065258224,0.000018664326],"category_scores_gemma":[0.00041746907,0.0001894335,0.000042381776,0.0015679144,0.0003815237,0.0015262077,0.0005072506,0.00023025082,0.00003274453],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013525888,0.000049192262,0.0014831455,0.00002380528,0.0000023973296,0.000010066406,0.00089498213,0.001176006,0.07501453,0.00024568517,0.0007300668,0.9203688],"study_design_scores_gemma":[0.00025866335,0.00007632793,0.0007167122,0.000052184096,0.0000015584039,0.000018784363,6.3042387e-7,0.64297664,0.3464141,0.009240453,0.000040052568,0.00020394045],"about_ca_topic_score_codex":0.00006174157,"about_ca_topic_score_gemma":0.000040933865,"teacher_disagreement_score":0.9201648,"about_ca_system_score_codex":0.00016708084,"about_ca_system_score_gemma":0.000102560334,"threshold_uncertainty_score":0.7724874},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026665428,0.00004201626,0.9964352,0.00040206546,0.00030997963,0.00037199788,0.0000051616753,0.00018433093,0.002222581],"genre_scores_gemma":[0.20582688,0.000009187187,0.79333484,0.0005816885,0.000113380476,0.000004509978,0.000014272134,0.000018863715,0.00009635363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970763,0.000032549025,0.00066218205,0.0006586543,0.0012292133,0.00034110187],"domain_scores_gemma":[0.9975762,0.00015292394,0.0006391524,0.0009225652,0.000548187,0.00016097586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092997844,0.00035548976,0.00038026887,0.001060887,0.00013099916,0.00032346204,0.0016646459,0.00030601607,0.000006010827],"category_scores_gemma":[0.000108475986,0.00033239563,0.000100900244,0.0007148354,0.00027019338,0.0014751551,0.00036060688,0.0004757152,0.000013563314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019322193,0.000035759273,0.000008734446,0.0000678426,0.000004160135,0.0000030661017,0.00043884033,0.07996697,0.0028663657,0.054134842,0.000026898297,0.8624272],"study_design_scores_gemma":[0.00019273827,0.00015291577,0.00002371977,0.00029356836,0.000005557191,0.0000059894933,2.5298837e-7,0.94573164,0.007302242,0.04574135,0.00023013481,0.00031987368],"about_ca_topic_score_codex":0.000022289849,"about_ca_topic_score_gemma":0.00000412856,"teacher_disagreement_score":0.8657647,"about_ca_system_score_codex":0.00049239566,"about_ca_system_score_gemma":0.0016566046,"threshold_uncertainty_score":0.9999128},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002905419,0.00017802056,0.99436057,0.0009735299,0.00029744505,0.0010431461,0.000027515654,0.000056767527,0.00015759996],"genre_scores_gemma":[0.8946993,0.00010738072,0.10427175,0.00051619846,0.00012669616,0.0001170605,0.00003930449,0.00003328292,0.00008906266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972121,0.00005295234,0.000772903,0.0010660882,0.00048020808,0.00041572744],"domain_scores_gemma":[0.9968214,0.0016830224,0.00037380392,0.00084641005,0.00017151417,0.00010383792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010192543,0.0003290873,0.00059397763,0.00063369895,0.000118497344,0.00025788453,0.0010045605,0.0002594013,0.00000998921],"category_scores_gemma":[0.00011097164,0.0003183378,0.000095760945,0.00052202493,0.00051620614,0.0007223904,0.00020237219,0.00033880863,0.0000011898352],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003351034,0.000265433,0.0014293358,0.0008769963,0.000056133245,0.000011126185,0.0052288417,0.022388134,0.00700432,0.0603071,0.0001460575,0.90225303],"study_design_scores_gemma":[0.00087221264,0.00015783039,0.004403546,0.0012021667,0.000025396756,0.000041360556,0.0000015148868,0.75802064,0.016065324,0.21785264,0.00042432002,0.00093305396],"about_ca_topic_score_codex":0.00016075498,"about_ca_topic_score_gemma":0.00042996966,"teacher_disagreement_score":0.90132,"about_ca_system_score_codex":0.00017883127,"about_ca_system_score_gemma":0.00036365623,"threshold_uncertainty_score":0.99992687},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006124964,0.00093599374,0.9811155,0.0011763406,0.0035782687,0.0004665141,0.0000011617002,0.00016492963,0.011948776],"genre_scores_gemma":[0.10844446,0.0001701279,0.8880321,0.0021871491,0.00040803413,0.000025559097,0.0000022570205,0.000025707097,0.00070464856],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956348,0.00004095146,0.0006176528,0.0018887955,0.0009937673,0.0008240441],"domain_scores_gemma":[0.9966571,0.00087429857,0.00033734107,0.0017217393,0.00028892452,0.0001206462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047777765,0.0006065194,0.000742921,0.00053225586,0.00025458584,0.00047071002,0.004220745,0.00047614778,0.00012218331],"category_scores_gemma":[0.00015872502,0.00048507552,0.00014629884,0.00044350929,0.0009928746,0.0010701902,0.0019378121,0.000741449,0.00031638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005782748,0.000036350008,0.00004555087,0.000010495318,0.00001556275,0.00006926969,0.0013059595,0.00093876134,0.00015655946,0.06761461,0.00014507647,0.929656],"study_design_scores_gemma":[0.00040143976,0.00046974004,0.00069315574,0.0004104621,0.000011437705,0.00009567159,0.0000010220422,0.059474833,0.0045596226,0.9267158,0.0062346244,0.0009321688],"about_ca_topic_score_codex":0.00016372932,"about_ca_topic_score_gemma":0.00043811402,"teacher_disagreement_score":0.9287239,"about_ca_system_score_codex":0.0003363795,"about_ca_system_score_gemma":0.0004466051,"threshold_uncertainty_score":0.9997601},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019625949,0.0023744737,0.9655593,0.00057076203,0.0021236476,0.00086422963,0.00013043144,0.000016564447,0.00873463],"genre_scores_gemma":[0.9563556,0.00026986265,0.041561004,0.0005068901,0.00047495705,0.000011052187,0.00002649871,0.000029008954,0.0007651643],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980788,0.000013763451,0.00026414281,0.0009600205,0.00028646507,0.00039678928],"domain_scores_gemma":[0.99852043,0.000045167777,0.00020547812,0.0009978644,0.00013144469,0.000099629964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030459842,0.00036587493,0.00033669878,0.000097313285,0.00027027517,0.000117516225,0.0009877229,0.0002761347,0.000008825105],"category_scores_gemma":[0.00010993176,0.00033861987,0.00011782637,0.000024637744,0.0010821662,0.0000018081438,0.00073262845,0.00020313327,0.000008090126],"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.000048735474,0.000036208257,0.00074368203,0.000042047996,0.00010976649,0.00006107555,0.00024557568,0.011642925,0.7279827,0.00085788936,0.000047030127,0.25818238],"study_design_scores_gemma":[0.0064616106,0.0025209677,0.0034000326,0.0010389534,0.00018151078,0.00043299203,0.0000027371061,0.09150345,0.60213304,0.1600821,0.12576307,0.0064795525],"about_ca_topic_score_codex":0.000025749161,"about_ca_topic_score_gemma":0.00011816515,"teacher_disagreement_score":0.9367296,"about_ca_system_score_codex":0.00005501697,"about_ca_system_score_gemma":0.00031029375,"threshold_uncertainty_score":0.9999066},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071341204,0.00017053397,0.98511505,0.00015713628,0.0010125756,0.00027761122,0.0000056394615,0.00013795085,0.0059893704],"genre_scores_gemma":[0.94291705,0.000038803457,0.05337055,0.001300608,0.0011990686,0.000007098308,0.0000038398252,0.00005883581,0.0011041194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972126,0.000033387794,0.0003004935,0.0011083016,0.0007215774,0.000623649],"domain_scores_gemma":[0.9986218,0.0003700631,0.00022755489,0.00057150156,0.000060198854,0.00014883783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003295712,0.000434367,0.00037743585,0.00039817303,0.0002820501,0.0002855249,0.00073845853,0.00018245887,0.00009450085],"category_scores_gemma":[0.000043770928,0.0003300732,0.00008539227,0.0002872612,0.00070550735,0.0003127041,0.00031283204,0.0005928456,0.0000790924],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016376956,0.000043080032,0.0002945513,0.000050351653,0.000004681986,0.00008578401,0.0007817241,0.011239628,0.0042860545,0.0018346849,0.000020869154,0.9813422],"study_design_scores_gemma":[0.0037204525,0.0025550989,0.0026884177,0.0069619603,0.00016945017,0.0025855543,0.0000023752539,0.61206263,0.2943464,0.045593165,0.022465842,0.006848689],"about_ca_topic_score_codex":0.000013266037,"about_ca_topic_score_gemma":0.000018973393,"teacher_disagreement_score":0.9744935,"about_ca_system_score_codex":0.00012544444,"about_ca_system_score_gemma":0.00013125484,"threshold_uncertainty_score":0.9999151},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039033283,0.0001880276,0.9850732,0.0018453243,0.0015052537,0.00022423564,0.0000049418995,0.00020908698,0.010910913],"genre_scores_gemma":[0.27163061,0.00006235637,0.72426707,0.0010286757,0.0011227671,0.000021802469,0.0002485977,0.000039161543,0.0015789736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974007,0.00005097813,0.00045982696,0.00064650184,0.0011089452,0.00033301764],"domain_scores_gemma":[0.99748945,0.00012991414,0.000364574,0.0014087635,0.000457801,0.00014949891],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001651225,0.0002894351,0.00025882426,0.0005963806,0.00024283913,0.000574189,0.0020518368,0.00022319125,0.000019794896],"category_scores_gemma":[0.00027447444,0.0002653746,0.0000549144,0.00045443935,0.00023822152,0.0025672775,0.0011739559,0.00067032845,0.00013135611],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055182127,0.000013839037,0.000030498217,0.00003452805,0.0000045820066,0.0000031496284,0.00071115454,0.034691256,0.00006291739,0.078149974,0.00043120515,0.8858614],"study_design_scores_gemma":[0.00020575807,0.00008977406,0.00049341645,0.00019150652,0.000005336938,0.00007430755,4.0542054e-7,0.73380417,0.00015847493,0.22774647,0.0367414,0.00048900023],"about_ca_topic_score_codex":0.00006195485,"about_ca_topic_score_gemma":0.00001260405,"teacher_disagreement_score":0.8853724,"about_ca_system_score_codex":0.00032973234,"about_ca_system_score_gemma":0.0005491947,"threshold_uncertainty_score":0.99997985},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021997523,0.00028752538,0.99344224,0.0002786323,0.00056506693,0.00077295385,0.0000021991966,0.0004962068,0.003935218],"genre_scores_gemma":[0.16523743,0.000076666045,0.83320576,0.00072028866,0.0003673559,0.0000429956,0.000009695386,0.00010801014,0.00023178881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971427,0.000008791156,0.0004908303,0.0009356481,0.00045001766,0.00097203173],"domain_scores_gemma":[0.99849635,0.00032631852,0.00004984998,0.00081425445,0.0000525359,0.00026069485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020937076,0.0005623895,0.0005926058,0.00057871727,0.00005112575,0.00018390127,0.0013303068,0.00050913735,0.000034435772],"category_scores_gemma":[0.000063968575,0.00051871524,0.00007092256,0.0006356084,0.00037557137,0.00023839896,0.0007261482,0.0013509124,0.00010160209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033218803,0.000010595498,0.000013572354,0.000028335542,0.000005236605,0.000020458052,0.00009799007,0.73969233,0.000004389677,0.0011712499,0.00011563264,0.25883687],"study_design_scores_gemma":[0.00019606802,0.000117943324,0.00013142439,0.0003674259,0.000005767944,0.000025537773,6.11321e-7,0.9630803,0.000028385239,0.03507759,0.00036043086,0.0006085455],"about_ca_topic_score_codex":0.0000088458755,"about_ca_topic_score_gemma":0.000027098653,"teacher_disagreement_score":0.25822833,"about_ca_system_score_codex":0.00048721218,"about_ca_system_score_gemma":0.00008875326,"threshold_uncertainty_score":0.9997264},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023426773,0.0016865114,0.990845,0.0011066697,0.0010782585,0.00044120013,0.000008606467,0.00005667496,0.004542766],"genre_scores_gemma":[0.5876043,0.00015646445,0.41037878,0.0010563862,0.00038819254,0.000023958037,0.000012724574,0.000036033616,0.00034314592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584055,0.00007049586,0.0008322932,0.0014049937,0.0010903762,0.0007612961],"domain_scores_gemma":[0.9960899,0.0008092721,0.0005160867,0.002175872,0.00027733803,0.0001315647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011045135,0.0005007752,0.0008164653,0.0008248754,0.00025176155,0.0005476513,0.0052597155,0.00031572435,0.000029707373],"category_scores_gemma":[0.00008685914,0.00033526245,0.00025777076,0.0022891688,0.0013585452,0.00050130376,0.0014197484,0.00077260775,0.000028684903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005160414,0.000029314157,0.00031887504,0.000015124749,0.000079286045,0.00004996115,0.0013095012,0.0781917,0.0000114361565,0.04656904,0.000134207,0.87328637],"study_design_scores_gemma":[0.00023463515,0.00014027285,0.0015613973,0.00013189907,0.000035003442,0.000015586937,6.952716e-7,0.860486,0.00017452346,0.13506095,0.0016115244,0.00054754404],"about_ca_topic_score_codex":0.00034327127,"about_ca_topic_score_gemma":0.00094253465,"teacher_disagreement_score":0.87273884,"about_ca_system_score_codex":0.00018429021,"about_ca_system_score_gemma":0.000399392,"threshold_uncertainty_score":0.99990994},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007688181,0.00015453187,0.9913719,0.0017886272,0.0027849076,0.0005078265,0.000009121167,0.001433939,0.0018722217],"genre_scores_gemma":[0.6740503,0.000012758533,0.31472817,0.00981776,0.0010038669,0.000043411255,0.000009994755,0.000071540984,0.00026223366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99451256,0.00008555868,0.00083256146,0.0019767939,0.0017580201,0.0008345297],"domain_scores_gemma":[0.99534184,0.0012984426,0.0006474507,0.00204036,0.00041949493,0.00025242436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020594012,0.00067894545,0.00077703985,0.0009560464,0.00035908414,0.00056099147,0.0038041929,0.0005578552,0.00002922715],"category_scores_gemma":[0.00015148739,0.00063736155,0.00023854585,0.0007399961,0.0009325264,0.0005331764,0.00054362346,0.001026527,0.00010123456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006816731,0.000049816015,0.00013608608,0.00013539361,0.00003852358,0.0000651323,0.00028955523,0.17195329,0.00053486007,0.045490988,0.0006164493,0.78062177],"study_design_scores_gemma":[0.0010675641,0.00022639256,0.0002758904,0.0003025681,0.00000845335,0.000046205034,3.427305e-8,0.9451845,0.00049601926,0.045104884,0.006543333,0.00074410916],"about_ca_topic_score_codex":0.00005754324,"about_ca_topic_score_gemma":0.0001808749,"teacher_disagreement_score":0.77987766,"about_ca_system_score_codex":0.00096318097,"about_ca_system_score_gemma":0.0016052347,"threshold_uncertainty_score":0.99960774},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009120004,0.00020498814,0.9855034,0.0011837631,0.0027493597,0.0003599704,0.000008215407,0.00025840238,0.009722792],"genre_scores_gemma":[0.05032149,0.000052867043,0.9421634,0.0059697665,0.0004967091,0.000024836592,0.000007969445,0.000047300542,0.0009156361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583054,0.000050076706,0.00043638685,0.001724228,0.0011175985,0.0008411633],"domain_scores_gemma":[0.9975063,0.00032276165,0.00018142366,0.0016655115,0.00011664781,0.00020731427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000525096,0.0005555759,0.00049836165,0.0007206745,0.0003832411,0.0006815957,0.0040305234,0.00038615425,0.00002415067],"category_scores_gemma":[0.000021662841,0.0004708293,0.00018786617,0.0013663473,0.00053599244,0.0005878356,0.00021473812,0.0011538325,0.0001219002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000267853,0.00006455662,0.0000010943214,0.000018963088,0.000005699281,0.00010574317,0.00069946144,0.26828238,0.0000020508423,0.0012419018,0.00006248137,0.729513],"study_design_scores_gemma":[0.00051442144,0.0005479503,0.00006618185,0.0005083094,0.000009317092,0.00014083387,9.904101e-8,0.67961085,0.00038536236,0.3120066,0.005188988,0.0010210818],"about_ca_topic_score_codex":0.000025125539,"about_ca_topic_score_gemma":0.00004858131,"teacher_disagreement_score":0.7284919,"about_ca_system_score_codex":0.0013431094,"about_ca_system_score_gemma":0.0030630522,"threshold_uncertainty_score":0.99977434},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007214742,0.000053195483,0.989316,0.0023760714,0.00080264936,0.0013070194,0.0000036133395,0.0006388957,0.0054953736],"genre_scores_gemma":[0.0049031046,0.0000034671298,0.9878852,0.0058083925,0.00026830594,0.00009625453,0.0000127098,0.000040126062,0.0009824509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951811,0.000057787143,0.00072830566,0.0018018514,0.0015818297,0.0006491406],"domain_scores_gemma":[0.9966911,0.00042151829,0.00034637493,0.0018331293,0.00031456197,0.00039333076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011992292,0.00053885527,0.00054012745,0.0010129553,0.00019428927,0.00085600925,0.004283694,0.00035015834,0.000081456026],"category_scores_gemma":[0.00036560718,0.0004922221,0.000083623614,0.0009559058,0.0005288965,0.00084240467,0.0011633986,0.00069314067,0.00033921486],"study_design_candidate":"design_other","study_design_consensus":null,"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.261042e-7,0.0000656394,8.415638e-7,0.000060793438,0.000006851932,0.0000056698345,0.00083459937,0.00084323704,0.010166456,0.02436587,0.0008663007,0.9627828],"study_design_scores_gemma":[0.00023608039,0.00022591226,0.00020091314,0.00032524724,0.000006694911,0.00006117183,3.8146027e-7,0.96027523,0.012806169,0.024209343,0.000852427,0.00080045406],"about_ca_topic_score_codex":0.000038027258,"about_ca_topic_score_gemma":0.0000058330334,"teacher_disagreement_score":0.96198237,"about_ca_system_score_codex":0.00048701887,"about_ca_system_score_gemma":0.0004583799,"threshold_uncertainty_score":0.99975294},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1466035,0.000016540724,0.85029805,0.002332528,0.00013761513,0.00045084892,0.000001006213,0.00014775898,0.000012151692],"genre_scores_gemma":[0.6831568,0.0000046418263,0.31531727,0.0013976144,0.000078166064,0.00003155556,0.000004305433,0.000007471589,0.0000021930862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854326,0.000034453034,0.00024305674,0.0005145344,0.00031698827,0.00034772625],"domain_scores_gemma":[0.9989458,0.00027401594,0.000060599785,0.00041978515,0.00014192636,0.0001579159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016828113,0.00014165507,0.00017595041,0.0001709344,0.00013102178,0.00007144868,0.00029779476,0.000056042903,0.00007478728],"category_scores_gemma":[0.00028031913,0.00011915734,0.000036518933,0.0009752707,0.0006340209,0.00024229742,0.0001288845,0.0003044365,0.00003573554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008359068,0.00042857227,0.058015686,0.00004038583,0.000005482137,0.00007590895,0.0005310513,0.0047389255,0.31247285,0.0028974053,0.00017054322,0.6205396],"study_design_scores_gemma":[0.0004898323,0.00023788436,0.052962344,0.000066800814,0.000007933274,0.00021311511,7.907156e-7,0.90965885,0.019814204,0.016231757,0.0001246899,0.00019179659],"about_ca_topic_score_codex":0.000023005252,"about_ca_topic_score_gemma":0.0000029551054,"teacher_disagreement_score":0.9049199,"about_ca_system_score_codex":0.00007606177,"about_ca_system_score_gemma":0.00008921481,"threshold_uncertainty_score":0.48590952},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017395493,0.00081111235,0.9965151,0.000042157873,0.0005660571,0.00036675745,0.00011510087,0.00032855547,0.0010811936],"genre_scores_gemma":[0.22903758,0.000059385748,0.7701421,0.00020785643,0.00031080403,0.0000031996221,0.00004873856,0.0000988222,0.00009152218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998025,0.000017668257,0.0004875763,0.00057184655,0.0004599383,0.00043796844],"domain_scores_gemma":[0.99858445,0.00011450865,0.00019251315,0.00077014783,0.00021716021,0.0001212454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023330374,0.0004756561,0.0005764721,0.00049495586,0.00010850171,0.000053320477,0.000817576,0.00046237817,0.00012655421],"category_scores_gemma":[0.0000830335,0.00044130336,0.00015196965,0.00042485454,0.00065906113,0.0001694786,0.00018144042,0.0007935196,0.0000033308397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015329898,0.00012253292,0.000082888146,0.00083216303,0.00010918424,0.00034068993,0.00089379103,0.3701548,0.28284216,0.012702912,0.00037732985,0.33138826],"study_design_scores_gemma":[0.0006021019,0.00014469158,0.00004357415,0.0013494104,0.0000523854,0.000056135785,1.434839e-7,0.5501294,0.36464414,0.078307785,0.0034553122,0.0012148846],"about_ca_topic_score_codex":0.0000157916,"about_ca_topic_score_gemma":0.000018526564,"teacher_disagreement_score":0.33017337,"about_ca_system_score_codex":0.00031743333,"about_ca_system_score_gemma":0.00021094651,"threshold_uncertainty_score":0.9998039},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007073166,0.00044222694,0.9716647,0.0019987193,0.001719235,0.0002898382,0.0000027772646,0.00018841491,0.023686977],"genre_scores_gemma":[0.015758708,0.00036383345,0.9418332,0.011556331,0.0018495503,0.000028977782,0.000016020229,0.000109286644,0.02848411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964063,0.00004579052,0.00042621448,0.0014742826,0.0009369198,0.0007104592],"domain_scores_gemma":[0.9974156,0.00029200016,0.00028452373,0.0017276512,0.00016208632,0.0001181268],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012840931,0.00048608755,0.0003746997,0.0005236531,0.0005398454,0.0012195114,0.006347112,0.0002078007,0.00012618469],"category_scores_gemma":[0.000064363536,0.000345423,0.0001332451,0.00048227952,0.0006115197,0.0010227786,0.0036483833,0.0012322844,0.00026238573],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016023314,0.000011974671,0.000026119424,0.000015571788,0.000016571246,0.000040798594,0.002384147,0.00081392535,0.0000132929,0.030533575,0.0004001535,0.9657423],"study_design_scores_gemma":[0.00024551447,0.00018729716,0.000050052146,0.00034935965,0.000021108423,0.000029897921,7.340422e-7,0.501103,0.000333843,0.35162878,0.14515366,0.000896784],"about_ca_topic_score_codex":0.00003815799,"about_ca_topic_score_gemma":0.000030794276,"teacher_disagreement_score":0.9648455,"about_ca_system_score_codex":0.00011314957,"about_ca_system_score_gemma":0.00021572575,"threshold_uncertainty_score":0.9998998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004746091,0.000058353824,0.99644446,0.00048632413,0.00080711814,0.0004889535,0.000004246288,0.0005130665,0.0011926993],"genre_scores_gemma":[0.02229345,0.000004524503,0.9766286,0.00067593565,0.00024157787,0.000011419009,0.000007780541,0.00004785711,0.000088825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995848,0.00014327429,0.0006659274,0.0014298481,0.0013121095,0.00060085615],"domain_scores_gemma":[0.99708426,0.0005433376,0.00038843486,0.001353437,0.00039774808,0.00023279047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018139163,0.00055483304,0.0005647945,0.0011310391,0.00028386636,0.00081026636,0.0023372376,0.00031541864,0.000017574974],"category_scores_gemma":[0.00028455097,0.0005103518,0.00012640703,0.00087444833,0.00039045262,0.00057726086,0.0009879734,0.00083372125,0.000023561395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015199429,0.000060343205,0.0000054257803,0.00021941109,0.00000890895,0.00012218162,0.00043463736,0.112529986,0.0025701523,0.0044543226,0.000009529315,0.8795699],"study_design_scores_gemma":[0.00020811353,0.00016643666,0.000014910778,0.0004795503,0.00001012773,0.00006395009,9.748413e-8,0.95680726,0.0021301126,0.039467,0.00012151779,0.00053090375],"about_ca_topic_score_codex":0.00002403151,"about_ca_topic_score_gemma":0.000010776085,"teacher_disagreement_score":0.879039,"about_ca_system_score_codex":0.0008122596,"about_ca_system_score_gemma":0.00085753604,"threshold_uncertainty_score":0.9997348},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022116893,0.00031250628,0.888539,0.0038805723,0.004676378,0.0014191784,0.000007492704,0.00028476116,0.098668404],"genre_scores_gemma":[0.9505903,0.000028391427,0.030102527,0.012255694,0.0054985853,0.000014494512,0.00009276589,0.000093906216,0.0013233339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969658,0.000013941148,0.00041087135,0.0009861983,0.00087790645,0.0007452833],"domain_scores_gemma":[0.9986491,0.0001738301,0.00023290224,0.0006308492,0.00026045242,0.000052846386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065420347,0.000556238,0.00045234556,0.00064927945,0.0004280311,0.00035294777,0.0008824143,0.00017452809,0.0001920425],"category_scores_gemma":[0.000054755263,0.0004453654,0.0000987501,0.0006935608,0.00050133193,0.00065413356,0.0005028485,0.0005471379,0.00038301782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010521639,0.00010029657,0.0010454813,0.00020247989,0.000072837356,0.000054306995,0.00067965256,0.078076474,0.0000034943566,0.06243416,0.000980423,0.85624516],"study_design_scores_gemma":[0.0014820548,0.0002789698,0.01456567,0.0034814894,0.00016609702,0.000011583102,0.0000058305563,0.835164,0.000072075585,0.10622423,0.035883717,0.0026642706],"about_ca_topic_score_codex":0.00028874518,"about_ca_topic_score_gemma":0.0018417765,"teacher_disagreement_score":0.9483786,"about_ca_system_score_codex":0.00020100566,"about_ca_system_score_gemma":0.00008250539,"threshold_uncertainty_score":0.9997998},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013956737,0.0011652285,0.9917503,0.0010176857,0.00041501955,0.000562483,0.000004596252,0.00045303407,0.0046176766],"genre_scores_gemma":[0.06953358,0.00018334134,0.9279948,0.0010590635,0.0003397722,0.000017974899,0.00001353688,0.00005933994,0.0007985943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956791,0.00004501447,0.00050004205,0.0017503131,0.0013435901,0.0006819801],"domain_scores_gemma":[0.9966929,0.00012613182,0.00038934214,0.0019095668,0.0006097933,0.00027225827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074187823,0.0006450024,0.0006320133,0.0007521559,0.00022126996,0.0005442565,0.0030961179,0.00038160634,0.0000084346],"category_scores_gemma":[0.000048898844,0.00049853965,0.00010076513,0.0009130034,0.000653189,0.0015745041,0.00078176905,0.0008488937,0.000021049425],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030324176,0.000044277684,0.000014178908,0.00005633159,0.000018086208,0.00017603827,0.0005748756,0.019108038,0.0006344145,0.092991814,0.00017398724,0.88617766],"study_design_scores_gemma":[0.0002990675,0.00024033705,0.00001621907,0.00037722223,0.000010951819,0.00011023454,1.4846931e-7,0.5606068,0.0035820561,0.43218955,0.0019064784,0.0006609363],"about_ca_topic_score_codex":0.000016029155,"about_ca_topic_score_gemma":0.000027152766,"teacher_disagreement_score":0.8855167,"about_ca_system_score_codex":0.0004059826,"about_ca_system_score_gemma":0.0007727685,"threshold_uncertainty_score":0.9997466},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000932281,0.00008134895,0.99195236,0.00082179933,0.0013018707,0.0003766532,0.000002333359,0.0001845356,0.0043468024],"genre_scores_gemma":[0.27710193,0.000036306254,0.714828,0.001503099,0.0008613644,0.00001930851,0.000009953117,0.00006780524,0.0055722306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996224,0.00004101014,0.000599406,0.0015976471,0.000758016,0.00077992235],"domain_scores_gemma":[0.9978253,0.00013529063,0.00030837295,0.001133706,0.0003473908,0.00024989247],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007423833,0.00049333414,0.00055770425,0.0010070415,0.0005309773,0.001721943,0.0031993797,0.00025206312,0.0001123903],"category_scores_gemma":[0.00013130669,0.000456744,0.00019800334,0.00095887075,0.00031675358,0.00096715405,0.0025476296,0.000965848,0.00052150944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003252446,0.000023448223,0.00005147741,0.000033567452,0.000026160757,0.000041280837,0.0018796667,0.14884195,0.002332358,0.008606866,0.00020114594,0.8379588],"study_design_scores_gemma":[0.00024689385,0.00033384416,0.0006224624,0.00065942475,0.000027032205,0.00009217519,9.469797e-7,0.95006347,0.00162462,0.03195709,0.012958224,0.0014138254],"about_ca_topic_score_codex":0.00009902404,"about_ca_topic_score_gemma":0.00005959891,"teacher_disagreement_score":0.836545,"about_ca_system_score_codex":0.00020583827,"about_ca_system_score_gemma":0.00024236794,"threshold_uncertainty_score":0.9997884},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10014347,0.000017084798,0.8964969,0.0027821728,0.00018017205,0.00026409974,1.8131722e-7,0.000084935295,0.000030967076],"genre_scores_gemma":[0.5625459,0.000002796346,0.43661684,0.00078894605,0.000035697325,0.0000068548597,7.314288e-7,0.000001810395,4.3911928e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981183,0.00023739549,0.0003234426,0.0006708033,0.00036548678,0.00028456078],"domain_scores_gemma":[0.998719,0.0005094649,0.000085868945,0.00050840725,0.00008850954,0.00008877145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00212763,0.000116178286,0.00017837467,0.00024881784,0.00007619579,0.00023049754,0.00078622176,0.00007955204,0.000005919358],"category_scores_gemma":[0.0008554443,0.00010190995,0.000018382343,0.0009137458,0.00055482367,0.0012579425,0.00033437842,0.00022268303,0.0000022077704],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031168383,0.00012676997,0.025649574,0.000035595745,0.0000014606674,0.000013918494,0.0013969837,0.00095815654,0.025881903,0.003938804,0.000041004503,0.94192463],"study_design_scores_gemma":[0.00079447974,0.00009244039,0.03876449,0.000023004572,6.824823e-7,0.00001294879,3.7546818e-7,0.8526508,0.047035486,0.060483743,0.00001206432,0.00012944794],"about_ca_topic_score_codex":0.00010092147,"about_ca_topic_score_gemma":0.000107255044,"teacher_disagreement_score":0.94179523,"about_ca_system_score_codex":0.00010192597,"about_ca_system_score_gemma":0.00010578261,"threshold_uncertainty_score":0.41557673},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018664787,0.00012176474,0.9957535,0.00039222618,0.0004612834,0.00054074795,0.000042189873,0.00013550473,0.00068625825],"genre_scores_gemma":[0.3722545,0.0000075420835,0.62591946,0.0011927553,0.00016564145,0.00001785142,0.000022516535,0.000035218047,0.00038451748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740505,0.00003834065,0.00047753836,0.0010308042,0.0005754701,0.0004728111],"domain_scores_gemma":[0.9974736,0.0005374042,0.00024413674,0.0013605597,0.00026092702,0.00012335696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071366725,0.00041381654,0.0005707322,0.00051528245,0.00021245849,0.00026638267,0.0024714523,0.00015224151,0.000011243074],"category_scores_gemma":[0.000048694663,0.00032917803,0.00011384743,0.00035534933,0.0011677359,0.00033193626,0.0006731173,0.00034171288,0.0000074078084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000460839,0.00009528319,0.000033774948,0.00023676077,0.00005041567,0.00008518256,0.006124018,0.059866212,0.0023731345,0.20721076,0.000042288466,0.72383606],"study_design_scores_gemma":[0.00052042026,0.00062469044,0.00012446713,0.00040846155,0.000012142532,0.00006662063,8.195386e-7,0.89506435,0.0064530345,0.09582577,0.00031512542,0.00058409123],"about_ca_topic_score_codex":0.000032917946,"about_ca_topic_score_gemma":0.00015859168,"teacher_disagreement_score":0.83519816,"about_ca_system_score_codex":0.00008064514,"about_ca_system_score_gemma":0.0003665644,"threshold_uncertainty_score":0.999916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019818162,0.0001866115,0.98497224,0.0006353341,0.0037615274,0.00041850147,0.000010103151,0.00028911902,0.009528365],"genre_scores_gemma":[0.18477988,0.000018497623,0.8094783,0.004334621,0.001174425,0.000012477439,0.000004483832,0.00005554224,0.00014175796],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944504,0.00009379357,0.0006412621,0.0025194362,0.0013030124,0.0009921117],"domain_scores_gemma":[0.99531233,0.001483415,0.00022029983,0.002312102,0.00025345455,0.00041837987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015377637,0.0007508817,0.000834186,0.0009239245,0.00026035027,0.0007562258,0.004478417,0.00045510512,0.000050359395],"category_scores_gemma":[0.00041204755,0.00067649106,0.0002202688,0.00073813484,0.00037001204,0.000581161,0.0013279413,0.0011998762,0.0003590597],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014852309,0.00003647615,0.000034444285,0.000012259858,0.000014886985,0.0002286846,0.0016174754,0.014745096,0.0002153937,0.0068012825,0.00002669486,0.97625244],"study_design_scores_gemma":[0.0007453402,0.0010979753,0.0028807598,0.002049573,0.00002528496,0.000091470385,4.5197643e-7,0.19909844,0.029032314,0.75820965,0.003928576,0.0028401706],"about_ca_topic_score_codex":0.00007129425,"about_ca_topic_score_gemma":0.00014280189,"teacher_disagreement_score":0.9734123,"about_ca_system_score_codex":0.00027242053,"about_ca_system_score_gemma":0.00045860358,"threshold_uncertainty_score":0.99956864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011054125,0.0011516903,0.99368995,0.00036024337,0.0013062061,0.00043031332,0.000032900112,0.000073175375,0.0018500976],"genre_scores_gemma":[0.8594082,0.00003501554,0.13986278,0.0002991878,0.00025732166,0.0000051250845,0.0000069308953,0.00001986919,0.0001055428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672055,0.00003965699,0.0005330542,0.001428356,0.0006722158,0.00060614105],"domain_scores_gemma":[0.99787927,0.00011747759,0.00041293883,0.0012242959,0.0002109581,0.00015507331],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067639304,0.000452894,0.0005831084,0.00032793725,0.00032962882,0.00094685087,0.0019827865,0.00034483214,0.0000033401636],"category_scores_gemma":[0.00010733962,0.00044121037,0.000059034213,0.00035055663,0.00075910747,0.0004540546,0.00104014,0.00039916238,0.000007758766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010683662,0.00003867318,0.0018100636,0.00013217279,0.000014744193,0.0004988804,0.0005462699,0.07835525,0.000065652974,0.023654286,0.000025593941,0.89484775],"study_design_scores_gemma":[0.00045412596,0.000060252623,0.001143189,0.0009075808,0.000005429456,0.00028086515,2.2421945e-7,0.9622025,0.00002880724,0.033712246,0.00066167733,0.0005430934],"about_ca_topic_score_codex":0.00026944754,"about_ca_topic_score_gemma":0.00061555096,"teacher_disagreement_score":0.89430463,"about_ca_system_score_codex":0.0005313448,"about_ca_system_score_gemma":0.000594749,"threshold_uncertainty_score":0.99980396},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011589512,0.0003524534,0.9860357,0.00022378966,0.0017267426,0.0007152504,0.000017674221,0.000060537925,0.009708921],"genre_scores_gemma":[0.054004297,0.0000018157559,0.9421592,0.0014512284,0.0009151344,0.00003345396,0.000004331402,0.000055115095,0.0013754634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933439,0.00010559993,0.00092832313,0.0019278388,0.0029542372,0.0007400972],"domain_scores_gemma":[0.9917267,0.004994312,0.0005318179,0.0011502977,0.0013072361,0.00028965864],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008947207,0.0005581206,0.0008519064,0.0009998343,0.00032942672,0.00048450354,0.0025346044,0.00034747474,0.00005536569],"category_scores_gemma":[0.008650278,0.00039743318,0.00014836682,0.00076562277,0.0014435741,0.00034762546,0.0007787902,0.0005452294,0.000018655715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009613147,0.000012085141,0.00005899196,0.0000063408056,0.00000670793,0.000020516387,0.0018618,0.3596,0.000010790686,0.0119598955,0.00037782305,0.6259889],"study_design_scores_gemma":[0.0004529423,0.00042307022,0.000011648976,0.00024178188,0.000012035109,0.000038048576,0.0000034174916,0.6470779,0.000050980398,0.34486288,0.0063535655,0.0004717126],"about_ca_topic_score_codex":0.000012376657,"about_ca_topic_score_gemma":0.0001119801,"teacher_disagreement_score":0.6255172,"about_ca_system_score_codex":0.00039426726,"about_ca_system_score_gemma":0.002053533,"threshold_uncertainty_score":0.99984777},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012218961,0.00012515546,0.99677724,0.00030456673,0.00063735293,0.0015859128,0.000003856993,0.00023025612,0.00021344319],"genre_scores_gemma":[0.27467668,8.2376516e-7,0.7243219,0.00038692058,0.00043246322,0.0001149406,0.000002829064,0.000030868247,0.000032539894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681085,0.00003910165,0.00035449874,0.0016611465,0.0005820652,0.00055235846],"domain_scores_gemma":[0.99796027,0.0002596375,0.00018010222,0.00090906216,0.0003781712,0.0003127299],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010501433,0.00044112318,0.00041256627,0.00064770953,0.00034870606,0.0007895994,0.0014347447,0.00033149726,8.885454e-7],"category_scores_gemma":[0.0002058919,0.0004007383,0.00007168904,0.00061053433,0.00019601636,0.0005969252,0.00041353496,0.000494235,0.000004281947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022050835,0.000029956735,0.0000057116945,0.000046588146,0.000003845968,0.0000030882295,0.0003848348,0.1576931,0.0003220688,0.0007611252,0.0000073964607,0.84072024],"study_design_scores_gemma":[0.0004708961,0.00065175357,0.000035389476,0.00018758749,0.000008248506,0.00003768411,3.7431212e-7,0.9832333,0.00054114556,0.012575181,0.001758511,0.00049997604],"about_ca_topic_score_codex":0.000028714097,"about_ca_topic_score_gemma":0.00014714894,"teacher_disagreement_score":0.8402203,"about_ca_system_score_codex":0.00022804164,"about_ca_system_score_gemma":0.0002828009,"threshold_uncertainty_score":0.99984443},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013183403,0.0014283259,0.9950814,0.00038853506,0.0002497479,0.0011373347,0.0000053560275,0.00007365201,0.00031729517],"genre_scores_gemma":[0.23510633,0.000008420404,0.76439434,0.00025654424,0.0001380348,0.000049725106,0.000004514954,0.000019449639,0.000022609087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714756,0.000040526676,0.0004460069,0.0010227677,0.0009889773,0.0003541727],"domain_scores_gemma":[0.99758214,0.00050043216,0.0004979211,0.0005566924,0.000782986,0.00007983456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021539244,0.00035135043,0.00040837433,0.0007067383,0.0002266296,0.00031259007,0.0010691944,0.00021885001,0.0000036376643],"category_scores_gemma":[0.00028415216,0.0003155009,0.0000860773,0.0004684009,0.0005692978,0.00063770305,0.00035652693,0.00028566894,0.0000014491003],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000152468065,0.000019202304,0.00004126357,0.000073393865,0.0000124927665,0.0000014185077,0.0007736938,0.01478532,0.011201623,0.0062528574,0.0000034058373,0.96682006],"study_design_scores_gemma":[0.0004294226,0.00022717057,0.000041239964,0.0004041117,0.000022918774,0.000025436175,2.9056844e-7,0.500892,0.10709431,0.39050224,0.00004803484,0.00031283614],"about_ca_topic_score_codex":0.0000152081475,"about_ca_topic_score_gemma":0.00019280199,"teacher_disagreement_score":0.96650726,"about_ca_system_score_codex":0.00019316809,"about_ca_system_score_gemma":0.0005678359,"threshold_uncertainty_score":0.9999297},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032957108,0.0006760003,0.99273694,0.00036155133,0.0007074839,0.00038840136,0.0000054935367,0.000119372555,0.004675174],"genre_scores_gemma":[0.33825415,0.00010511181,0.6596914,0.0005393745,0.00031563162,0.000016546737,0.0000050129606,0.00006239233,0.0010103715],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99594057,0.000057625977,0.0005499867,0.0013743123,0.0013019225,0.00077558926],"domain_scores_gemma":[0.9964178,0.0008492513,0.00033630742,0.0018780959,0.000324293,0.0001942275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090447237,0.00047509323,0.0006106571,0.0014329517,0.0001871637,0.00024400014,0.005105169,0.00027260033,0.000058331803],"category_scores_gemma":[0.000115457515,0.00041652823,0.0001559177,0.00091178407,0.0014145327,0.0008827449,0.0015121672,0.00086160214,0.00008483872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010900937,0.000041329447,0.00011659648,0.00007163254,0.000020191423,0.00013738878,0.0007516359,0.016179463,0.0034237462,0.2390075,0.00004763171,0.740192],"study_design_scores_gemma":[0.00024013645,0.00034738105,0.0003490938,0.0005314344,0.000004266398,0.00005442735,2.8450916e-7,0.1669732,0.0037376008,0.826399,0.00072559476,0.0006375804],"about_ca_topic_score_codex":0.000020586514,"about_ca_topic_score_gemma":0.000028681718,"teacher_disagreement_score":0.7395544,"about_ca_system_score_codex":0.00016722841,"about_ca_system_score_gemma":0.00040286622,"threshold_uncertainty_score":0.99982864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031220674,0.00023847105,0.993006,0.0008535438,0.0012972323,0.00027903312,0.0000021395665,0.00016738947,0.0038439806],"genre_scores_gemma":[0.31490737,0.000023671639,0.68116516,0.0022098303,0.00076211884,0.0000120498225,0.000023613127,0.00004164289,0.00085454027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643713,0.000039479684,0.00041814754,0.0014652408,0.0011036404,0.00053638016],"domain_scores_gemma":[0.9978601,0.0003752326,0.00026218494,0.0010351688,0.000279448,0.00018786812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007016147,0.0004823038,0.0004403375,0.0010871625,0.00036544356,0.0005887242,0.0021003222,0.00021736234,0.000014149478],"category_scores_gemma":[0.00004079507,0.00040426775,0.00009989076,0.0009271182,0.00037526587,0.0004767922,0.0003793223,0.0005712935,0.000041385687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013215313,0.000023016355,0.000028798515,0.000036913265,0.000023120616,0.00009231569,0.00053012854,0.1305858,0.0005134015,0.2119964,0.00008820146,0.6560687],"study_design_scores_gemma":[0.0005896906,0.0005427918,0.00030913175,0.00056973123,0.000017644421,0.00030757207,1.2809352e-7,0.6178504,0.0044709663,0.36613995,0.007866413,0.0013355504],"about_ca_topic_score_codex":0.000008838534,"about_ca_topic_score_gemma":0.00004036313,"teacher_disagreement_score":0.6547331,"about_ca_system_score_codex":0.00015529663,"about_ca_system_score_gemma":0.0005501508,"threshold_uncertainty_score":0.9998409},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024211373,0.0035124994,0.97822493,0.00022809298,0.0017141444,0.00019047214,0.0000023988562,0.00017523703,0.015710082],"genre_scores_gemma":[0.44991815,0.00034308113,0.54445976,0.0018511303,0.0022032037,0.000009272951,0.000005502455,0.00006142024,0.001148484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969287,0.000031896103,0.00037235662,0.0012509043,0.00057270867,0.0008434255],"domain_scores_gemma":[0.9981397,0.00033968847,0.0002223151,0.00092123036,0.00011918575,0.0002579021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009279126,0.00048242815,0.00045839272,0.0004943211,0.0003733594,0.0005917844,0.002089029,0.0003036688,0.000014465472],"category_scores_gemma":[0.00007425623,0.000414994,0.00008794837,0.00032330252,0.0005119894,0.00065066636,0.0017830569,0.00065202883,0.00004339302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017858603,0.000016666223,0.00065719517,0.00004171595,0.000010099465,0.00005855313,0.0025171828,0.0008696936,0.00022981086,0.12115262,0.00003527071,0.87440944],"study_design_scores_gemma":[0.0008164326,0.00032201296,0.0016510725,0.0010688158,0.000039926752,0.00089423097,9.987656e-7,0.64075863,0.0036306072,0.32088724,0.02689149,0.0030385195],"about_ca_topic_score_codex":0.000023922526,"about_ca_topic_score_gemma":0.0000664329,"teacher_disagreement_score":0.8713709,"about_ca_system_score_codex":0.00015383624,"about_ca_system_score_gemma":0.00022662159,"threshold_uncertainty_score":0.9998302},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062813977,0.0003817904,0.9796075,0.0014072023,0.0038742386,0.00049416814,0.000034563167,0.00013610697,0.013436259],"genre_scores_gemma":[0.51043,0.000027456721,0.47955087,0.002482804,0.0017288182,0.000016906075,0.0000038734133,0.000109322544,0.005649943],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98865134,0.00019715645,0.0019748174,0.0029463198,0.0051690643,0.001061327],"domain_scores_gemma":[0.98695016,0.0078065447,0.0010308397,0.0029420357,0.0008671883,0.00040320808],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.007081934,0.0007890937,0.0012853756,0.0020186214,0.0006175207,0.0018225842,0.0058007217,0.00049169466,0.0009927165],"category_scores_gemma":[0.0032489633,0.0005337939,0.00035410968,0.0011004957,0.0016904025,0.0007926221,0.0023747426,0.0009851257,0.0014182872],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022555316,0.000027611162,0.0010480712,0.000008368136,0.0000062423023,0.00008559928,0.0005002216,0.005540093,0.0004210267,0.0022316938,0.0009754702,0.98913306],"study_design_scores_gemma":[0.0010614007,0.00019646056,0.0013662637,0.0015509297,0.000020924472,0.00015951783,0.0000030768235,0.354986,0.0013939737,0.58332855,0.05400528,0.0019276325],"about_ca_topic_score_codex":0.000010413741,"about_ca_topic_score_gemma":0.00017190712,"teacher_disagreement_score":0.9872054,"about_ca_system_score_codex":0.0003469555,"about_ca_system_score_gemma":0.0005919661,"threshold_uncertainty_score":0.9999205},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029874165,0.00075836846,0.9940831,0.0012855459,0.0004774644,0.00017473935,0.00011143435,0.00007884211,0.000043097898],"genre_scores_gemma":[0.23047823,0.000031026855,0.768593,0.00033482804,0.00042556736,0.0000055276823,0.000043008873,0.000019200694,0.00006957748],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997714,0.000037077618,0.00035778433,0.0011222648,0.00040127835,0.00036761],"domain_scores_gemma":[0.9971937,0.0012258313,0.00021163006,0.0010681666,0.00012376941,0.00017693572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000651197,0.00033653714,0.00041275748,0.00033922045,0.00025946874,0.000427144,0.0016220979,0.00022563242,0.0000032413864],"category_scores_gemma":[0.00045812942,0.0002651056,0.000092613904,0.00038005988,0.00023618412,0.0006166603,0.0010157007,0.00059126766,0.0000056647714],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008970474,0.000043475662,0.0015165267,0.00001871947,0.000043176864,0.000008800611,0.0032547372,0.011938591,0.000050212293,0.024924684,0.00003796391,0.95815414],"study_design_scores_gemma":[0.00012680897,0.000049890845,0.0003938831,0.00032092095,0.000011619517,0.0000046286573,0.0000024591916,0.41665348,0.000069624475,0.5814406,0.0006469011,0.00027913458],"about_ca_topic_score_codex":0.000096331256,"about_ca_topic_score_gemma":0.00035507794,"teacher_disagreement_score":0.957875,"about_ca_system_score_codex":0.00010604111,"about_ca_system_score_gemma":0.00022160559,"threshold_uncertainty_score":0.9999801},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013019143,0.000383395,0.98139346,0.000098296485,0.000105017614,0.00042947702,0.000016447015,0.00001166428,0.0045431294],"genre_scores_gemma":[0.97745734,0.0000018444032,0.022351423,0.000021240388,0.00012390957,0.000009549276,0.000017106511,0.0000077505165,0.000009805867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755985,0.00032411568,0.00043228836,0.00023670353,0.0012560239,0.00019104598],"domain_scores_gemma":[0.9971057,0.00092950166,0.0003780435,0.0008048855,0.00075653126,0.000025294321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007359037,0.00018866503,0.00038891434,0.00029934576,0.00007688956,0.000036948426,0.0014307596,0.00006796636,0.000035499117],"category_scores_gemma":[0.00009222225,0.00014466677,0.000085667714,0.00047910216,0.00052108767,0.00010380362,0.0004386442,0.00052792573,5.426804e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002917768,0.000077237186,0.002206635,0.000013987097,0.000025212175,4.418369e-7,0.0035323459,0.07590341,0.00005333524,0.0030864559,0.00007834834,0.9150197],"study_design_scores_gemma":[0.00021993792,0.00011210501,0.0013736802,0.00038227224,0.00007585015,0.00000108536,0.000012969663,0.56158876,0.0010745089,0.43481264,0.00012732446,0.00021885778],"about_ca_topic_score_codex":0.0004418458,"about_ca_topic_score_gemma":0.00019001961,"teacher_disagreement_score":0.9644382,"about_ca_system_score_codex":0.00008769063,"about_ca_system_score_gemma":0.00033934804,"threshold_uncertainty_score":0.58993393},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016318245,0.00014512983,0.99648595,0.00013931264,0.00020650293,0.0009102997,0.000009647087,0.00007239022,0.00039891514],"genre_scores_gemma":[0.47169805,0.0000033469796,0.52784216,0.000117073854,0.00014742838,0.00007870981,0.00004771411,0.000013079372,0.000052410247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970176,0.00004254284,0.00056664844,0.0012828206,0.0006058409,0.0004845127],"domain_scores_gemma":[0.99780864,0.00040180396,0.00034697045,0.0009484395,0.0003690378,0.00012514122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011297937,0.00034777276,0.0005776156,0.0012909406,0.00012389505,0.00029957463,0.002152367,0.0002806949,0.0000159183],"category_scores_gemma":[0.00004617397,0.00031721866,0.00019804113,0.0014471647,0.0003757429,0.00056904793,0.00027463897,0.00029857675,0.000009983665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007073861,0.00011007732,0.00044476657,0.00005087296,0.000038290073,0.000004475863,0.0022731717,0.077855736,0.00010889554,0.04618011,0.0000066156786,0.8729199],"study_design_scores_gemma":[0.00027084805,0.00017320996,0.0011042648,0.00005411546,0.000026278474,0.000006292008,6.3223666e-7,0.91227454,0.00008779613,0.08512136,0.0005122073,0.00036847792],"about_ca_topic_score_codex":0.000046762187,"about_ca_topic_score_gemma":0.00069641933,"teacher_disagreement_score":0.87255144,"about_ca_system_score_codex":0.00019150728,"about_ca_system_score_gemma":0.00032870294,"threshold_uncertainty_score":0.999928},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012900682,0.00082969083,0.97628564,0.0008319699,0.0022641227,0.00033189147,0.000022344448,0.00016466551,0.019256804],"genre_scores_gemma":[0.03304512,0.00021110161,0.95829517,0.0022486725,0.0012727709,0.000029243167,0.0001581413,0.000081552,0.004658235],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995755,0.000034341938,0.0005205268,0.001719928,0.0012064651,0.0007637073],"domain_scores_gemma":[0.9971526,0.00022693601,0.00022013875,0.00203832,0.00017437451,0.0001875812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013668828,0.0005413073,0.00053892855,0.0012638508,0.00013405489,0.00077230716,0.005085244,0.000121540004,0.000015352938],"category_scores_gemma":[0.00011962134,0.0004945453,0.00007153261,0.0009894699,0.0006240106,0.0021455898,0.0035848147,0.00069638423,0.00011442085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052804157,0.0000523117,0.0001813377,0.00005344029,0.000010662868,0.0004967762,0.0005919014,0.008055136,0.000015900312,0.24868394,0.0011795424,0.7406738],"study_design_scores_gemma":[0.0006922349,0.00016098072,0.00019622131,0.0005264678,0.000011970617,0.000057637375,8.86424e-7,0.2250329,0.0003615098,0.7072053,0.064129725,0.0016241769],"about_ca_topic_score_codex":0.00015370957,"about_ca_topic_score_gemma":0.0006354616,"teacher_disagreement_score":0.7390496,"about_ca_system_score_codex":0.000287708,"about_ca_system_score_gemma":0.00053897715,"threshold_uncertainty_score":0.9997506},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023858748,0.00037844855,0.99480814,0.0002513514,0.0026859397,0.0006478858,0.000015445248,0.00014388213,0.000830303],"genre_scores_gemma":[0.035687428,0.0000033199215,0.9623608,0.0009192658,0.0007689195,0.0000047106373,0.0000068057707,0.00006141983,0.00018732541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99492604,0.00008018772,0.00071679155,0.0019046931,0.0012885496,0.0010837303],"domain_scores_gemma":[0.99628687,0.00060289237,0.0003825951,0.0015381342,0.00086644717,0.00032306547],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002493535,0.0007605761,0.00087064895,0.00080072955,0.0005579151,0.0013280766,0.00375264,0.00045370258,0.000009997826],"category_scores_gemma":[0.00018676909,0.00069862796,0.00026290552,0.0005873131,0.0010595727,0.0014335155,0.001609756,0.0009555951,0.000010019348],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005501082,0.000023735509,0.00002063533,0.00015118379,0.000034441946,0.0002573718,0.0017538093,0.08661298,0.004116773,0.0051541487,0.00008682998,0.9017331],"study_design_scores_gemma":[0.0006146267,0.0001595621,0.000019414087,0.00026944984,0.000022372022,0.00015754366,3.820663e-7,0.7950599,0.0045630177,0.1980079,0.00039041156,0.00073541416],"about_ca_topic_score_codex":0.000060578015,"about_ca_topic_score_gemma":0.000045211167,"teacher_disagreement_score":0.90099764,"about_ca_system_score_codex":0.00073889445,"about_ca_system_score_gemma":0.0012044752,"threshold_uncertainty_score":0.99970865},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010623699,0.0012327787,0.9864176,0.004008407,0.0007025392,0.0009148015,0.00000451725,0.0008693553,0.004787661],"genre_scores_gemma":[0.3449491,0.0003944645,0.6526026,0.0012151145,0.00040661485,0.000047505047,0.000008419629,0.000064011634,0.0003121747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918685,0.00046514554,0.0013311598,0.0027065712,0.0017990648,0.0018295469],"domain_scores_gemma":[0.9947085,0.0009272917,0.00091639964,0.0022367747,0.0008206663,0.00039039395],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0037637965,0.0011601727,0.0011582753,0.0015318714,0.0008246238,0.0012770357,0.004864285,0.00077583984,0.00011538129],"category_scores_gemma":[0.00042198037,0.0012148523,0.00039673838,0.0018743172,0.0013206137,0.0024349804,0.001811038,0.0015312631,0.000105315434],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008175248,0.00013375329,0.0004261686,0.000060284514,0.000053496544,0.00020005256,0.001385547,0.0717619,0.0020474237,0.13408351,0.000028452536,0.78981125],"study_design_scores_gemma":[0.00021394888,0.00016226199,0.0005939115,0.000571182,0.000027837452,0.00022717714,3.7414742e-7,0.51800525,0.026273692,0.4527189,0.0005036222,0.00070185453],"about_ca_topic_score_codex":0.0010286684,"about_ca_topic_score_gemma":0.00057022594,"teacher_disagreement_score":0.7891094,"about_ca_system_score_codex":0.0032295713,"about_ca_system_score_gemma":0.0037843576,"threshold_uncertainty_score":0.99975973},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5230292,0.000031996977,0.47597545,0.00046509693,0.00019565287,0.00025225143,3.76212e-7,0.00003369948,0.00001629427],"genre_scores_gemma":[0.97376233,0.000005177268,0.02566824,0.0004908136,0.000036733658,0.000018755474,8.3255145e-7,0.000008424418,0.000008667644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879485,0.00003865569,0.0002725681,0.00032094138,0.00030334137,0.0002696522],"domain_scores_gemma":[0.9994475,0.00009262388,0.00008617145,0.00025009725,0.00005334377,0.000070230475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026796968,0.00012379492,0.0002160849,0.00032550035,0.000061712155,0.00006642874,0.0001782124,0.000050030743,0.00005124479],"category_scores_gemma":[0.000073208714,0.00010380366,0.000033510947,0.0008263619,0.00015448118,0.00016227059,0.00011118292,0.00019043009,0.000014900481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021841353,0.000108920634,0.005177058,0.00015158913,0.000009236963,0.00003657493,0.0019530184,0.008223121,0.4235584,0.0000022162408,0.000040575283,0.56071746],"study_design_scores_gemma":[0.000852266,0.0004648398,0.05035607,0.00026919573,0.000012917882,0.00017558027,0.00003237667,0.6851386,0.26146498,0.0009812083,0.0000368807,0.00021511893],"about_ca_topic_score_codex":0.00032829813,"about_ca_topic_score_gemma":0.000117562704,"teacher_disagreement_score":0.67691547,"about_ca_system_score_codex":0.00013907319,"about_ca_system_score_gemma":0.00004705354,"threshold_uncertainty_score":0.42329904},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017737846,0.0005456211,0.9949243,0.00080476265,0.0008419618,0.00046044413,0.000005058834,0.000440263,0.0019598368],"genre_scores_gemma":[0.11495181,0.000055816316,0.8822061,0.0017343818,0.0002891265,0.00001844539,0.0000061173023,0.000040694962,0.0006975468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701667,0.000031091306,0.00043763043,0.0014436576,0.00050691003,0.00056404324],"domain_scores_gemma":[0.9975898,0.0006217353,0.00027501266,0.001061138,0.0002812067,0.00017105819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009003139,0.000480094,0.00052523287,0.0006291017,0.00033723135,0.0006080045,0.002288667,0.0003321112,0.00000517645],"category_scores_gemma":[0.00011254539,0.00044490336,0.000112538786,0.0002962506,0.00049040205,0.00027072703,0.0010728033,0.00043290382,0.0000073787933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011537711,0.000028116714,0.000066858614,0.0001204909,0.000022869111,0.000023176777,0.0010116061,0.0524578,0.000042432526,0.08945151,0.0005634061,0.8562002],"study_design_scores_gemma":[0.00025353828,0.000300955,0.00004377175,0.00027279533,0.000006737027,0.000054765533,9.013939e-8,0.85902244,0.0006931662,0.1318108,0.006873508,0.00066746084],"about_ca_topic_score_codex":0.000009588565,"about_ca_topic_score_gemma":0.000011301609,"teacher_disagreement_score":0.85553277,"about_ca_system_score_codex":0.000105969135,"about_ca_system_score_gemma":0.00025816454,"threshold_uncertainty_score":0.99980026},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019046126,0.00019261935,0.99406093,0.0020213844,0.00075383665,0.00050416845,0.000016418184,0.00038078145,0.00016527451],"genre_scores_gemma":[0.56321216,0.0000050781377,0.43585053,0.000492179,0.00012429085,0.000042279982,0.0000052703544,0.000020293533,0.00024793754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970539,0.000022720726,0.00044900816,0.0012915815,0.00039060842,0.000792177],"domain_scores_gemma":[0.9977331,0.00041530113,0.00022089135,0.0011316417,0.00035651983,0.00014255862],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047851086,0.0004053585,0.00042457372,0.0003314539,0.00038592666,0.0005082124,0.002295349,0.00033027,0.000020090063],"category_scores_gemma":[0.00021119571,0.0003726401,0.0001545331,0.00043665268,0.000680024,0.0005450043,0.0007375109,0.00062721386,0.00009821045],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050800054,0.00012723649,0.00059080415,0.000046945235,0.000025024612,0.000047278118,0.0005763923,0.0052861418,0.0059303087,0.04961414,0.00012078081,0.9376299],"study_design_scores_gemma":[0.00055518525,0.0001904539,0.003619802,0.00022623225,0.000011718452,0.000023534769,2.7951774e-7,0.88965034,0.015628101,0.08710911,0.0023284554,0.00065679784],"about_ca_topic_score_codex":0.000021979497,"about_ca_topic_score_gemma":0.0000575601,"teacher_disagreement_score":0.9369731,"about_ca_system_score_codex":0.00022129432,"about_ca_system_score_gemma":0.00023864886,"threshold_uncertainty_score":0.99987257},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000117307136,0.002995883,0.99102247,0.000456904,0.0023612322,0.00044310457,0.0000912391,0.000337181,0.0021746943],"genre_scores_gemma":[0.07199304,0.0010088513,0.92010045,0.0027146244,0.0015278669,0.0000079383335,0.00022005408,0.00012228078,0.0023048637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99377483,0.000052166386,0.0007025849,0.0025423989,0.0019539732,0.000974016],"domain_scores_gemma":[0.9963844,0.00046882906,0.00044000958,0.0022048892,0.0002595786,0.00024230454],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006506285,0.00080915354,0.00071332377,0.00058105885,0.00049485365,0.0010476083,0.006499808,0.0003526752,0.000015066691],"category_scores_gemma":[0.00013508984,0.00074492506,0.0001742983,0.0007106204,0.0007424933,0.0029123304,0.0030045283,0.0010692021,0.000025663952],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022088081,0.000016169131,0.000011689189,0.000028250262,0.000031702937,0.00019919629,0.0005823469,0.014295433,0.0005699701,0.003149656,0.0011758168,0.9799177],"study_design_scores_gemma":[0.00039079494,0.00010286379,0.000024110646,0.00019878925,0.000012705776,0.00002221898,2.061088e-7,0.8932749,0.0013259865,0.10002672,0.0036401115,0.0009805736],"about_ca_topic_score_codex":0.00015311629,"about_ca_topic_score_gemma":0.000033106855,"teacher_disagreement_score":0.9789371,"about_ca_system_score_codex":0.00036958832,"about_ca_system_score_gemma":0.0004154865,"threshold_uncertainty_score":0.9999894},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003181025,0.00035875582,0.9925256,0.0005037439,0.0020748472,0.0007466897,0.00000584338,0.00041465586,0.0030517813],"genre_scores_gemma":[0.44807765,0.00023012138,0.5381426,0.002589578,0.0022860763,0.00013954952,0.00006413523,0.00016923432,0.008301018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955944,0.000048628986,0.000717156,0.0017938311,0.0011416872,0.0007042944],"domain_scores_gemma":[0.99612236,0.0003267591,0.0003968461,0.002480731,0.0004693038,0.00020397948],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010199083,0.0005827244,0.00063953095,0.0006034888,0.0003248803,0.00062735844,0.0037029174,0.0005159614,0.00016178258],"category_scores_gemma":[0.00007825945,0.00048385354,0.00018074866,0.0006853194,0.00055699947,0.001096117,0.0009840017,0.00071164925,0.0022689009],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006347224,0.00006189871,0.0001937886,0.00018947912,0.000020769452,0.00003397412,0.0008558484,0.0040511033,0.00031662697,0.0030683149,0.00056195364,0.9906399],"study_design_scores_gemma":[0.00047333588,0.00027265595,0.0012164701,0.0008840556,0.000014686174,0.0000958406,1.9302188e-7,0.92904055,0.0015972694,0.057327017,0.0075703193,0.0015076259],"about_ca_topic_score_codex":0.000038367052,"about_ca_topic_score_gemma":0.0000048576344,"teacher_disagreement_score":0.9891323,"about_ca_system_score_codex":0.00041115718,"about_ca_system_score_gemma":0.0006509258,"threshold_uncertainty_score":0.99976134},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021392856,0.00020511878,0.9969257,0.0005991956,0.00014371253,0.001688423,0.0000071090867,0.00009691812,0.000119869765],"genre_scores_gemma":[0.04449499,0.00003618622,0.9544181,0.00019392873,0.00015735113,0.00008096426,0.000016182667,0.0000915899,0.0005106776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971346,0.00005407869,0.00045282845,0.0009778821,0.0007460404,0.00063457305],"domain_scores_gemma":[0.99660313,0.0022357705,0.0001635456,0.0005165573,0.0002919053,0.00018906928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013669037,0.00039966585,0.00054188736,0.00054902775,0.00038465182,0.00034913118,0.000539933,0.00023016422,0.000008198178],"category_scores_gemma":[0.0004287197,0.00035015398,0.00006528948,0.00027635487,0.0010930556,0.00017024364,0.0004126507,0.00064800866,0.0000023241503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034433844,0.000039337938,0.000054864893,0.0017158248,0.00002176797,0.000011638324,0.0012530235,0.24141487,0.00012409568,0.014616697,0.0000065473573,0.7407069],"study_design_scores_gemma":[0.0005778475,0.0004309105,0.0000037057653,0.00075433555,0.000011621707,0.000013871684,6.954826e-7,0.8596634,0.00029453693,0.13759291,0.00028342547,0.00037273028],"about_ca_topic_score_codex":0.00000606747,"about_ca_topic_score_gemma":0.000041875017,"teacher_disagreement_score":0.74033415,"about_ca_system_score_codex":0.000121911,"about_ca_system_score_gemma":0.00027128027,"threshold_uncertainty_score":0.99989504},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037372855,0.00039155528,0.99341875,0.0001410682,0.0002803852,0.00018298105,0.000004199218,0.00005987877,0.0017838995],"genre_scores_gemma":[0.7964836,0.00008460861,0.20303999,0.0002586112,0.000051038296,0.000005205241,0.0000027702624,0.000014103098,0.00006011506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975443,0.00003641638,0.0005188906,0.0009782059,0.00053979666,0.00038241906],"domain_scores_gemma":[0.9986201,0.0001996474,0.00026525048,0.0006340379,0.00018177053,0.000099188765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075058744,0.000343737,0.00046482432,0.0007892428,0.00008040311,0.0001375558,0.0012338978,0.00029631844,0.000005355658],"category_scores_gemma":[0.000039585088,0.00032857544,0.000058549173,0.00042612405,0.00044909696,0.00055370305,0.0005019592,0.00048156557,0.0000052525193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017372586,0.000054585635,0.00027818646,0.000052427764,0.0000099921,0.000029064884,0.005010279,0.13903008,0.0017084451,0.09047363,0.0000060265616,0.7633299],"study_design_scores_gemma":[0.0001318439,0.000100355996,0.0005060096,0.000285078,0.0000039212346,0.000011915605,1.1922923e-7,0.6621349,0.0018356616,0.33473286,0.000003196883,0.0002541504],"about_ca_topic_score_codex":0.000069312795,"about_ca_topic_score_gemma":0.00019003528,"teacher_disagreement_score":0.7927463,"about_ca_system_score_codex":0.000111376015,"about_ca_system_score_gemma":0.0003539407,"threshold_uncertainty_score":0.9999166},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005952076,0.00011369525,0.9864002,0.0005707748,0.0015639835,0.00050278363,0.000012613636,0.00017516201,0.010654862],"genre_scores_gemma":[0.018040774,0.00011654765,0.97736275,0.001294997,0.00034694234,0.000030606054,0.00009485232,0.000036922596,0.00267558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677086,0.000029554069,0.0004202,0.0014534858,0.0008484474,0.000477449],"domain_scores_gemma":[0.9978554,0.00020173626,0.00034668137,0.0012273836,0.0002519808,0.00011681085],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004703612,0.0004444498,0.0003404351,0.0005827507,0.00018843017,0.0014233727,0.003498967,0.00021908179,0.00014301745],"category_scores_gemma":[0.000053744112,0.00040814755,0.0000651477,0.0005123201,0.00024386623,0.0031322322,0.001767009,0.0005364064,0.0001493732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038909056,0.000052650354,0.000012574126,0.00002717236,0.000023148614,0.00001427373,0.0006541232,0.13478747,0.000081471226,0.026422836,0.00089844916,0.83702195],"study_design_scores_gemma":[0.000173018,0.00009881698,0.00003978912,0.00015072229,0.000006927585,0.000006830005,9.3012474e-8,0.94654006,0.00023887059,0.050792933,0.0014689603,0.0004829739],"about_ca_topic_score_codex":0.00003803487,"about_ca_topic_score_gemma":0.0000105467525,"teacher_disagreement_score":0.836539,"about_ca_system_score_codex":0.00024911165,"about_ca_system_score_gemma":0.00016186404,"threshold_uncertainty_score":0.99983704},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017426899,0.00034314857,0.9945909,0.0004128394,0.002322647,0.0006240525,0.000010097321,0.00024934462,0.0014295466],"genre_scores_gemma":[0.0079572825,0.000005725366,0.98950815,0.00011705898,0.00046200224,0.00003629918,0.000009952377,0.000049647875,0.0018539007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964773,0.000016539021,0.00043298933,0.0010998668,0.0013854068,0.00058790366],"domain_scores_gemma":[0.9934281,0.0042921333,0.00019308241,0.0011199749,0.00076411513,0.00020258578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016304721,0.0003984938,0.00043666194,0.00076453964,0.000168449,0.0002736456,0.0025946388,0.0003270587,0.000012851111],"category_scores_gemma":[0.0018427543,0.0003739364,0.00011303992,0.00058908283,0.0004229254,0.0006640076,0.0009840701,0.0007791737,0.00006155064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009662729,0.00005647741,0.00011250644,0.00014657028,0.000035480556,0.000057324287,0.0024376956,0.17230122,0.000021909682,0.58546746,0.0005729635,0.23878075],"study_design_scores_gemma":[0.00020588799,0.00010710615,0.000047452024,0.00022469582,0.0000039563834,0.000042389172,7.514303e-8,0.550464,0.000078885896,0.4461811,0.0022869108,0.00035758544],"about_ca_topic_score_codex":0.0000032427288,"about_ca_topic_score_gemma":0.0000066887856,"teacher_disagreement_score":0.37816274,"about_ca_system_score_codex":0.0006103299,"about_ca_system_score_gemma":0.0010615385,"threshold_uncertainty_score":0.99987125},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020572101,0.0006801998,0.98646617,0.00023857725,0.0018294653,0.00031863392,0.000008952879,0.00009388798,0.010158421],"genre_scores_gemma":[0.39268234,0.00003215377,0.59429675,0.004857303,0.0035745208,0.00007573586,0.000023309298,0.0001175744,0.004340319],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973679,0.000024324843,0.0003567686,0.000998137,0.00046453997,0.0007883394],"domain_scores_gemma":[0.9969937,0.001843092,0.0002554667,0.00043417266,0.00033567846,0.00013783996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007611502,0.00038439507,0.00047305552,0.0006631497,0.00029158074,0.00020508497,0.0009088091,0.0005914161,0.00016091923],"category_scores_gemma":[0.0010205609,0.0003394352,0.00013946692,0.0004997523,0.00054938364,0.00010472291,0.0003239024,0.0011437526,0.00011793344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004382408,0.000022924414,0.00012339209,0.000059992515,0.000019523557,0.000015185908,0.0006541061,0.00094015355,0.0000014573384,0.19372702,0.000023000497,0.8043694],"study_design_scores_gemma":[0.0011816898,0.0024861658,0.0017621106,0.0025593548,0.00009823835,0.00017930807,0.0000033106605,0.06027053,0.0002115014,0.8924353,0.036846448,0.0019660357],"about_ca_topic_score_codex":0.000005325656,"about_ca_topic_score_gemma":0.000004668508,"teacher_disagreement_score":0.8024034,"about_ca_system_score_codex":0.00007093253,"about_ca_system_score_gemma":0.00014512669,"threshold_uncertainty_score":0.99990577},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041138375,0.000040567273,0.99043864,0.000367893,0.00018319649,0.0010551905,0.000035362256,0.00006234793,0.007405429],"genre_scores_gemma":[0.07356588,0.000005370781,0.92292076,0.00092537474,0.00026523595,0.00013837726,0.00002829513,0.00003162632,0.0021190767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976982,0.000007758881,0.0003951417,0.0009864393,0.00047964763,0.0004328196],"domain_scores_gemma":[0.99863535,0.00013584699,0.00016663504,0.0006894055,0.00024074203,0.00013202199],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047273637,0.00030758503,0.0003577519,0.00019699035,0.00022150311,0.0002931506,0.0010242738,0.00022019901,0.00016395011],"category_scores_gemma":[0.000059131176,0.00025009297,0.00008687775,0.00014044874,0.00072676025,0.00019372714,0.00037251352,0.0002461717,0.00006178189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021863516,0.00013193447,0.0000029971804,0.00015143314,0.000006615054,6.201723e-7,0.00051268155,0.8063212,0.047620047,0.072961755,0.00038896737,0.07187988],"study_design_scores_gemma":[0.00021716114,0.00006633609,0.0000048658317,0.000042943622,0.000015611962,0.000008241524,2.9148387e-7,0.9680704,0.001719277,0.029015318,0.00052942295,0.00031013592],"about_ca_topic_score_codex":0.000042883024,"about_ca_topic_score_gemma":0.000016378437,"teacher_disagreement_score":0.16174918,"about_ca_system_score_codex":0.00014134162,"about_ca_system_score_gemma":0.00029312077,"threshold_uncertainty_score":0.9999951},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009946891,0.00026319223,0.99684334,0.00063462794,0.00097109785,0.0005256293,0.00004364984,0.00013997791,0.00047903747],"genre_scores_gemma":[0.08989208,0.000005724812,0.90873766,0.00044404317,0.000521999,0.00003371401,0.00002442739,0.000028247207,0.00031208427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961829,0.00007495697,0.0007777025,0.0015268232,0.0007520559,0.0006855216],"domain_scores_gemma":[0.9953323,0.0023372686,0.00076336216,0.000917455,0.0004817466,0.0001678519],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018259857,0.00047176995,0.00068016,0.00048348156,0.0005977147,0.00097191986,0.002418428,0.00031076532,0.000046003053],"category_scores_gemma":[0.00068424264,0.00041676077,0.0003026839,0.0006662156,0.00019927825,0.0007613578,0.0009255385,0.0005686903,0.000029148772],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022342042,0.000015499538,0.00027347746,0.0000138433425,0.000047253296,0.0000080862565,0.0008326991,0.038923144,0.0003570687,0.0033834686,0.000024058436,0.9561192],"study_design_scores_gemma":[0.00016426755,0.000086987755,0.00013615694,0.00013482333,0.000019958794,0.0000066940715,9.1978706e-7,0.8934268,0.00081832905,0.103727244,0.0010160541,0.0004617635],"about_ca_topic_score_codex":0.0010662525,"about_ca_topic_score_gemma":0.0011140292,"teacher_disagreement_score":0.9556574,"about_ca_system_score_codex":0.00035845302,"about_ca_system_score_gemma":0.00040740453,"threshold_uncertainty_score":0.9998284},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94092804,0.0016618406,0.049943954,0.0018472467,0.00073869026,0.00061034353,0.0000015584031,0.00011637254,0.0041519557],"genre_scores_gemma":[0.9459709,0.00042559791,0.052673377,0.00041456736,0.00027592803,0.000014637259,0.000006693936,0.000027789132,0.000190526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631363,0.00007018747,0.0010691695,0.0011562569,0.0007847918,0.000605952],"domain_scores_gemma":[0.995075,0.0037495566,0.00033227756,0.0005127352,0.00008027524,0.00025015185],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0028983557,0.00038444082,0.0010287822,0.00087548804,0.00007325243,0.000050355262,0.000551792,0.0007023291,0.000029268327],"category_scores_gemma":[0.02524528,0.0003237494,0.00008022206,0.00056740915,0.0014117165,0.000083885854,0.0006053017,0.0029732413,0.000031764102],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017766799,0.00006250639,0.48736212,0.00002368239,0.00000517952,0.00012685868,0.00030225675,0.005174651,0.0000058431574,0.00018833914,0.0000026782855,0.5067281],"study_design_scores_gemma":[0.0038966544,0.0031630266,0.4486432,0.034962613,0.00006245757,0.0002450489,0.000010166265,0.4699042,0.00019611865,0.036998093,0.00056804146,0.0013503474],"about_ca_topic_score_codex":0.000054944274,"about_ca_topic_score_gemma":0.00004410698,"teacher_disagreement_score":0.50537777,"about_ca_system_score_codex":0.00042713236,"about_ca_system_score_gemma":0.00085663877,"threshold_uncertainty_score":0.99992144},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004190438,0.00019803146,0.9927065,0.0007512629,0.000964543,0.0006462616,0.0000101274945,0.00007052497,0.00046232203],"genre_scores_gemma":[0.8460811,0.000011882191,0.15245463,0.00010627256,0.0007029941,0.000033511467,0.000008233923,0.000023198969,0.0005781867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9971745,0.00007329873,0.0005037949,0.0010134721,0.00071264553,0.00052226236],"domain_scores_gemma":[0.9901769,0.008506839,0.00032733093,0.00057344337,0.00028415755,0.00013130777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002313818,0.000360015,0.00039599944,0.00046660076,0.00043886955,0.00040567206,0.0013033728,0.00030092077,0.0000035537498],"category_scores_gemma":[0.0034087012,0.00029182978,0.00006188711,0.00046192232,0.00040441763,0.0005503739,0.00060970435,0.0011773616,0.000011747004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011268621,0.000024111392,0.21640472,0.00014668627,0.000025667476,0.00002217521,0.010300645,0.091738105,0.0000012665909,0.55689037,0.00003931652,0.12439564],"study_design_scores_gemma":[0.00041791913,0.0008450177,0.44780463,0.0047132405,0.000023960229,0.000086999324,0.000010783306,0.25274858,0.000015518504,0.28970635,0.0027691664,0.00085785805],"about_ca_topic_score_codex":0.00001169258,"about_ca_topic_score_gemma":0.00000832437,"teacher_disagreement_score":0.84189063,"about_ca_system_score_codex":0.00034671646,"about_ca_system_score_gemma":0.00051637087,"threshold_uncertainty_score":0.9999534},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053370395,0.00033949074,0.99526614,0.00069405517,0.0012753775,0.0005988273,0.000004004673,0.00016733274,0.0011210751],"genre_scores_gemma":[0.36296162,0.000025540621,0.634806,0.0010726503,0.0008819213,0.000016193704,0.0000050822505,0.000039363593,0.00019165275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660736,0.000025163119,0.00047934815,0.0015142648,0.00065048056,0.00072336086],"domain_scores_gemma":[0.9981237,0.00039120228,0.00036021194,0.00068553374,0.00024463257,0.00019472861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008979431,0.0005187119,0.0005651285,0.00062604033,0.0004857162,0.00077623245,0.0014295876,0.00027239023,0.0000035841051],"category_scores_gemma":[0.0000745554,0.0004646683,0.0001357309,0.00033177616,0.00047436677,0.0006868458,0.00052839017,0.00040379306,0.0000072048288],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029268007,0.00001799806,0.000032747284,0.000067630484,0.000013396717,0.00002053655,0.0006800124,0.004869257,0.0028637054,0.0078039775,0.000015038529,0.98358643],"study_design_scores_gemma":[0.0010511732,0.0008142126,0.00042430905,0.0009208126,0.000024378047,0.00025908995,7.9696423e-7,0.69619465,0.079925865,0.21778637,0.0013400421,0.0012582846],"about_ca_topic_score_codex":0.000015517155,"about_ca_topic_score_gemma":0.000058388563,"teacher_disagreement_score":0.9823282,"about_ca_system_score_codex":0.0002851566,"about_ca_system_score_gemma":0.00028265378,"threshold_uncertainty_score":0.9997805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006610711,0.00020060175,0.987029,0.0026174441,0.0016520941,0.0012742446,0.000025894953,0.00033527726,0.0002547293],"genre_scores_gemma":[0.64988583,0.000014263984,0.34919798,0.0006018767,0.00018112166,0.00008659507,0.0000034323687,0.000025247184,0.0000036267595],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931441,0.00027272286,0.0005460692,0.0027330325,0.0017196103,0.0015844787],"domain_scores_gemma":[0.9940762,0.0013728373,0.00033422807,0.0031480058,0.00061258214,0.00045612818],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017998075,0.0007058714,0.0007082747,0.0012229546,0.00035947084,0.0009956721,0.008188064,0.0003269711,0.00001657488],"category_scores_gemma":[0.0003173234,0.0005022976,0.00012729137,0.0027627074,0.0034640038,0.000849736,0.006087058,0.0014743773,0.00004786988],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006887311,0.00015007888,0.0012384088,0.00007324545,0.00003058504,0.00057145033,0.00071854185,0.03490188,0.0021745437,0.023644738,0.00001826937,0.9364094],"study_design_scores_gemma":[0.0016412153,0.00050390046,0.0009829564,0.0013543821,0.000008420377,0.0003694127,0.0000012021573,0.4793239,0.024562564,0.48954874,0.000121739766,0.0015815604],"about_ca_topic_score_codex":0.000019426388,"about_ca_topic_score_gemma":0.00005185185,"teacher_disagreement_score":0.9348278,"about_ca_system_score_codex":0.000686279,"about_ca_system_score_gemma":0.001890191,"threshold_uncertainty_score":0.99974287},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009404416,0.00009000793,0.99632674,0.00015236637,0.0002227686,0.0006145567,0.000031077005,0.000059439983,0.0024089662],"genre_scores_gemma":[0.661483,0.0000022642491,0.3345481,0.0003920093,0.0020041927,0.00010983437,0.00060275913,0.000078539975,0.0007793345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982688,0.000019569843,0.00029671704,0.00064558577,0.00048580448,0.00028356924],"domain_scores_gemma":[0.9986096,0.0002161391,0.00026268922,0.0004217005,0.00041356593,0.00007628389],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039231256,0.00028351057,0.00031821473,0.0004347729,0.00013754751,0.00017941643,0.00056613254,0.00010947648,0.00010893865],"category_scores_gemma":[0.000019063787,0.00027412546,0.00013749152,0.00026980444,0.00022863221,0.00015188359,0.00015011772,0.00021901037,0.000004630997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023590828,0.00006571188,0.0025920258,0.000036323978,0.00006601715,0.0000018357118,0.000710531,0.2316603,0.000053574022,0.04919723,0.0011004024,0.71449244],"study_design_scores_gemma":[0.00040422208,0.00011365776,0.000066230576,0.00012634434,0.00005952503,4.684626e-7,7.725402e-7,0.5912152,0.0010168583,0.39992574,0.006637744,0.00043322917],"about_ca_topic_score_codex":0.0000384171,"about_ca_topic_score_gemma":0.00002304641,"teacher_disagreement_score":0.71405923,"about_ca_system_score_codex":0.00014343197,"about_ca_system_score_gemma":0.00035270088,"threshold_uncertainty_score":0.9999711},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000120254284,0.005326544,0.9365302,0.00639749,0.009556402,0.0009316945,0.00004037587,0.0002113578,0.04088569],"genre_scores_gemma":[0.14510311,0.00051333127,0.3825332,0.04067525,0.010193299,0.00022461102,0.0011259167,0.00056017697,0.4190711],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955667,0.0004761974,0.00073368294,0.0012769509,0.001209292,0.00073713635],"domain_scores_gemma":[0.99702024,0.0005863734,0.0005027461,0.0011382633,0.00060040783,0.00015195618],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0066732517,0.00057150656,0.0008633973,0.0005799607,0.00020420524,0.00018101878,0.0014313597,0.00041037676,0.0013248743],"category_scores_gemma":[0.00042794363,0.00047275142,0.00013261355,0.00044566492,0.00057587406,0.000092908456,0.00029783425,0.0021770305,0.00032389583],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008628982,0.00011394457,0.0002906181,0.0006284849,0.00008043421,0.00013753152,0.0032259782,0.0005508138,0.000052740084,0.045286465,0.011106102,0.9385183],"study_design_scores_gemma":[0.0006642633,0.0009690949,0.002467662,0.006971026,0.000100416,0.0004266518,0.0000036233132,0.0047101234,0.000013451467,0.017322231,0.96428823,0.0020632376],"about_ca_topic_score_codex":0.00049212034,"about_ca_topic_score_gemma":0.000059655078,"teacher_disagreement_score":0.9531821,"about_ca_system_score_codex":0.0003136879,"about_ca_system_score_gemma":0.00021558777,"threshold_uncertainty_score":0.9997724},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041014844,0.0045215175,0.9127514,0.0009089464,0.011927927,0.000791314,0.000009909442,0.00028713228,0.06839174],"genre_scores_gemma":[0.99044895,0.000011133877,0.004632851,0.0015318426,0.0018363085,0.000032337288,0.000012126379,0.000095501484,0.0013989689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963811,0.000100844576,0.00054633827,0.0012302023,0.0009800178,0.00076148397],"domain_scores_gemma":[0.9973897,0.00057877466,0.00029631174,0.0012888734,0.00024461633,0.00020173274],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013722873,0.0005621665,0.00054252875,0.00044912216,0.0003062284,0.00024558243,0.0020583426,0.000716724,0.00020517684],"category_scores_gemma":[0.00005816558,0.00038985076,0.00016376484,0.0004493357,0.0010341961,0.000115621435,0.00050094293,0.0014861921,0.001075435],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052711508,0.000079039644,0.0002514054,0.000027121245,0.00022449777,0.0006122545,0.00446629,0.013150008,0.000015571208,0.043708455,0.0015906334,0.935822],"study_design_scores_gemma":[0.015215002,0.0071437582,0.002717733,0.023333361,0.0022591949,0.0052581,0.00016359887,0.6949863,0.0008011099,0.111291766,0.11886904,0.017961066],"about_ca_topic_score_codex":0.000081398866,"about_ca_topic_score_gemma":0.00007821034,"teacher_disagreement_score":0.99003875,"about_ca_system_score_codex":0.00039064305,"about_ca_system_score_gemma":0.00021855716,"threshold_uncertainty_score":0.99985534},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051565163,0.0003253732,0.9948279,0.0005781596,0.0012965867,0.0006662362,0.00001437803,0.00012713838,0.0021126163],"genre_scores_gemma":[0.026189756,0.00003823031,0.9718549,0.0011960425,0.0003138583,0.000011680839,0.0000046491114,0.000030140622,0.00036071124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968735,0.000034341254,0.00050636573,0.0014014199,0.0006725438,0.000511803],"domain_scores_gemma":[0.9974464,0.00061016675,0.00033061294,0.0012020802,0.0002761446,0.00013459066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010181065,0.00042568467,0.00042914366,0.0006533396,0.00034732715,0.0006056269,0.001868464,0.00030252038,0.000017929044],"category_scores_gemma":[0.00014413269,0.00041327605,0.000098778495,0.00041299805,0.000592062,0.00081624364,0.0006824836,0.00041403057,0.00002592859],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007352388,0.000017820996,0.00004774439,0.00007980789,0.000010797363,0.0000035087223,0.0010318811,0.010659771,0.00012038721,0.17499775,0.000042242533,0.81298095],"study_design_scores_gemma":[0.00019599497,0.00012314456,0.0001309412,0.00008106373,0.000005655887,0.000023759647,6.804102e-8,0.72097147,0.00026954795,0.2727389,0.0051015047,0.00035794528],"about_ca_topic_score_codex":0.0000073099573,"about_ca_topic_score_gemma":0.000006855717,"teacher_disagreement_score":0.81262296,"about_ca_system_score_codex":0.00019529532,"about_ca_system_score_gemma":0.00008890265,"threshold_uncertainty_score":0.9998319},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029407647,0.00024297422,0.9904874,0.0010732092,0.00043037158,0.0008341196,0.000021994812,0.00009365137,0.003875507],"genre_scores_gemma":[0.97555685,0.00006923664,0.023514524,0.00031881532,0.000167287,0.000043330492,0.000008339195,0.000037317248,0.00028431482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99539775,0.00011949993,0.0008592897,0.0014574658,0.0013851342,0.00078087155],"domain_scores_gemma":[0.99524236,0.0010202879,0.0005966993,0.0025425996,0.0003689679,0.00022909178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016459484,0.0005663054,0.0006003003,0.00064410275,0.0002630158,0.00032302554,0.0041708285,0.0002726122,0.00000998107],"category_scores_gemma":[0.0002419742,0.00039832373,0.00019594794,0.0011003253,0.0013355481,0.00044611766,0.0012212909,0.0009233442,0.00002541617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008934839,0.0002682437,0.0006806873,0.000044245142,0.000049376245,0.00008998441,0.0072198254,0.54668075,0.0016183602,0.03576526,0.00023747027,0.40725642],"study_design_scores_gemma":[0.0008906458,0.0005337656,0.0054024435,0.000789918,0.000011011075,0.00008485112,0.000006515713,0.8828449,0.0036631506,0.10357371,0.0011166546,0.0010824063],"about_ca_topic_score_codex":0.00050940755,"about_ca_topic_score_gemma":0.00022708967,"teacher_disagreement_score":0.9726161,"about_ca_system_score_codex":0.001055739,"about_ca_system_score_gemma":0.0008989231,"threshold_uncertainty_score":0.9998469},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23147623,0.00017171694,0.7672864,0.00061936263,0.00013875654,0.00020452018,0.0000027264366,0.000058083093,0.00004218792],"genre_scores_gemma":[0.58424187,0.00007315991,0.4149767,0.00054222485,0.00014214756,0.0000151100185,0.0000032833675,0.0000043102273,0.0000012179097],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990587,0.000022324042,0.00016726009,0.00041071515,0.00016309609,0.00017789824],"domain_scores_gemma":[0.99942446,0.00013740576,0.000053849784,0.00025318508,0.00006706957,0.00006403777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017455601,0.00010286019,0.00015197479,0.000099592864,0.00010102744,0.000042051237,0.00010406814,0.00005442188,0.000009300786],"category_scores_gemma":[0.00007371991,0.00009134867,0.000020756537,0.0003861209,0.0003243831,0.00015791574,0.00006859956,0.00015625294,0.0000034034438],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013586008,0.000011004473,0.0024403944,0.000003754559,4.422014e-7,5.731094e-7,0.00014138878,0.0010156484,0.075319715,0.000020153235,0.0000036210938,0.92102975],"study_design_scores_gemma":[0.0010992899,0.00044331155,0.14620167,0.00020600311,0.000019039591,0.00004893251,0.0000030822423,0.17615822,0.638464,0.036656924,0.00041029195,0.00028928017],"about_ca_topic_score_codex":0.00004289585,"about_ca_topic_score_gemma":0.000010449533,"teacher_disagreement_score":0.9207404,"about_ca_system_score_codex":0.00004749692,"about_ca_system_score_gemma":0.000039901046,"threshold_uncertainty_score":0.37250906},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.4741844e-7,0.001150104,0.95240545,0.004715155,0.0007457734,0.00058589847,0.0000034049533,0.000094827556,0.040298928],"genre_scores_gemma":[0.038318373,0.0009720709,0.9379174,0.008214883,0.0011399757,0.00004680345,0.000021146545,0.000104252686,0.013265058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964768,0.000059181366,0.000444427,0.00092507375,0.0009906274,0.00110386],"domain_scores_gemma":[0.99722505,0.0003341454,0.00017802956,0.0013619782,0.00037211363,0.0005286864],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018468116,0.0003881263,0.00029967446,0.00065425545,0.00114837,0.0015042329,0.0039536855,0.00029616948,0.00006364875],"category_scores_gemma":[0.0000669055,0.0002763109,0.00009762486,0.00075423066,0.00070822006,0.0005365153,0.00068992504,0.0009311336,0.00017695523],"study_design_candidate":"design_other","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.0000012916358,0.000007941029,0.00002298184,0.000016194579,0.000008767765,0.000017746564,0.0007534569,0.008492703,0.000005620531,0.18649483,0.0002649227,0.80391353],"study_design_scores_gemma":[0.00026618503,0.00010784381,0.000116211326,0.00030733523,0.0000069125153,0.00007277745,1.5673744e-7,0.5644968,0.00011877317,0.23186268,0.20170121,0.00094309804],"about_ca_topic_score_codex":0.0012924463,"about_ca_topic_score_gemma":0.02570283,"teacher_disagreement_score":0.80297047,"about_ca_system_score_codex":0.0005184055,"about_ca_system_score_gemma":0.0017267397,"threshold_uncertainty_score":0.9999689},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002603966,0.00091731304,0.9947656,0.0006289898,0.0015483244,0.00058697566,0.0000038954777,0.00014455787,0.0011439922],"genre_scores_gemma":[0.007670648,0.00002682694,0.9907793,0.00084194465,0.00036100432,0.000021071442,0.000004379022,0.00003454669,0.00026031712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99180806,0.00040347848,0.0007648628,0.002996226,0.0025445516,0.0014828132],"domain_scores_gemma":[0.99433315,0.0021561594,0.0003009903,0.0019509081,0.00072302966,0.000535775],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0104222335,0.00063952466,0.00075734896,0.0035875433,0.0004600303,0.0009049699,0.006114504,0.00036013193,0.00000943261],"category_scores_gemma":[0.00076525006,0.00059637876,0.00009040094,0.0060555367,0.005190686,0.0023748092,0.005458442,0.0018052267,0.00003065477],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011355857,0.000051812185,0.00033976327,0.0000412039,0.00000598474,0.00010341628,0.0013927611,0.04646746,0.00028315233,0.04940811,0.00006844976,0.9018265],"study_design_scores_gemma":[0.0003212949,0.0001375374,0.00072364527,0.00018150784,0.0000018540309,0.00010383247,1.5566711e-7,0.5155766,0.00037336105,0.4815948,0.0005190527,0.0004663531],"about_ca_topic_score_codex":0.000014666817,"about_ca_topic_score_gemma":0.00004047041,"teacher_disagreement_score":0.90136015,"about_ca_system_score_codex":0.0012959725,"about_ca_system_score_gemma":0.00504839,"threshold_uncertainty_score":0.99964875},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008083768,0.0012576078,0.96538836,0.00060032913,0.006072708,0.00036629703,0.000011124362,0.000340171,0.025882555],"genre_scores_gemma":[0.36063683,0.0005089211,0.6236402,0.00850545,0.003974446,0.000031892123,0.000031549658,0.00017327198,0.0024974437],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944669,0.000037520796,0.00070793973,0.0018216951,0.0015707886,0.0013951355],"domain_scores_gemma":[0.9960351,0.0004272746,0.0003607812,0.0024403997,0.0003106094,0.0004258327],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012316277,0.00083112845,0.00072249526,0.0012459181,0.00058603194,0.0010383271,0.0061506853,0.00049660815,0.000072821655],"category_scores_gemma":[0.00006628433,0.00079207635,0.00030484385,0.0011650926,0.0013519635,0.0014161298,0.0025289797,0.0014367099,0.00021305421],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018651884,0.00005728115,0.000027627937,0.000030002502,0.000015573685,0.0000905594,0.00048271907,0.0019592803,0.000072206734,0.081132405,0.00005100905,0.91607946],"study_design_scores_gemma":[0.00054897345,0.000369777,0.00037967277,0.000839857,0.000022883487,0.00025150945,3.4951665e-7,0.34068462,0.0009945029,0.5893497,0.06389106,0.002667091],"about_ca_topic_score_codex":0.000017384158,"about_ca_topic_score_gemma":0.0000667005,"teacher_disagreement_score":0.9134124,"about_ca_system_score_codex":0.00044481692,"about_ca_system_score_gemma":0.0007051235,"threshold_uncertainty_score":0.9999987},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004956733,0.0007150493,0.9935616,0.0018644698,0.0020868732,0.0012439163,0.0000066709013,0.00009602338,0.00042041508],"genre_scores_gemma":[0.09419462,0.00003345757,0.90240896,0.0014149362,0.0016519736,0.000022807782,0.0000038284397,0.000046859124,0.00022255031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655825,0.000025270348,0.0007199116,0.0009008084,0.00084310316,0.00095262966],"domain_scores_gemma":[0.99082845,0.006154732,0.00076499075,0.0016735432,0.0004483095,0.00012994702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018824564,0.00047766126,0.0005886213,0.000615978,0.00051372644,0.00047183968,0.0046794997,0.00039446654,0.0000044120093],"category_scores_gemma":[0.001152334,0.0003618047,0.00029833996,0.000665191,0.0008485154,0.00035164243,0.0013629169,0.00076602853,0.000004005563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008801038,0.0000100618445,0.000032901684,0.00010962783,0.000026487132,7.823688e-7,0.0016486,0.34897676,0.000020814474,0.3580954,0.000022616543,0.29104716],"study_design_scores_gemma":[0.00020433334,0.00021511907,0.000035216795,0.00039543517,0.000017894188,0.000013925654,3.956111e-7,0.7913996,0.00032149002,0.20310535,0.003945569,0.0003457066],"about_ca_topic_score_codex":0.000019060055,"about_ca_topic_score_gemma":0.00000686421,"teacher_disagreement_score":0.4424228,"about_ca_system_score_codex":0.00029591174,"about_ca_system_score_gemma":0.00084211916,"threshold_uncertainty_score":0.9998834},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008824892,0.00076109974,0.99394125,0.0012321533,0.0013740571,0.00029849375,0.0002500945,0.00026805198,0.0018659881],"genre_scores_gemma":[0.031237496,0.00019030462,0.9627428,0.0027859148,0.0018773378,0.000015747099,0.00036509222,0.000101874146,0.00068344624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99460936,0.000040816212,0.00055597775,0.002629733,0.0013915239,0.00077256636],"domain_scores_gemma":[0.99429125,0.00032969308,0.00039957452,0.004521403,0.00022958596,0.00022850635],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008431176,0.0006480812,0.00057311775,0.00046075313,0.0004807147,0.0010628118,0.008793867,0.0003412719,0.00001700641],"category_scores_gemma":[0.00013529001,0.00046185905,0.0000767493,0.0004875655,0.0007951853,0.0020577267,0.005403867,0.0007711122,0.00005382377],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011250921,0.000030946867,0.000007342049,0.0000358011,0.0000064718283,0.00012980896,0.00011098359,0.0006610673,0.00007093654,0.026664369,0.00026086473,0.97201014],"study_design_scores_gemma":[0.0004912246,0.00028044914,0.00012241224,0.002874945,0.000012112688,0.00009933346,1.7380913e-7,0.700038,0.0008522966,0.2539774,0.039915428,0.0013362403],"about_ca_topic_score_codex":0.000010979994,"about_ca_topic_score_gemma":0.000012739893,"teacher_disagreement_score":0.9706739,"about_ca_system_score_codex":0.00022546032,"about_ca_system_score_gemma":0.00085586245,"threshold_uncertainty_score":0.9999742},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000085243235,0.001010927,0.9888163,0.00012837336,0.00014435158,0.0002544895,0.000015265221,0.00032906156,0.009215979],"genre_scores_gemma":[0.7616405,0.00058439816,0.2360341,0.00070716045,0.0003412824,0.000010918219,0.00004882358,0.0001680274,0.00046478675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976921,0.000010156112,0.00049540104,0.0005688723,0.0008234953,0.0004099958],"domain_scores_gemma":[0.99839765,0.00017619057,0.00019214762,0.0007547966,0.00030839434,0.00017080261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032814778,0.00048113355,0.00085509697,0.00049514126,0.00003566196,0.000035191704,0.00088979374,0.00019257278,0.00007113006],"category_scores_gemma":[0.00004806566,0.00037001647,0.000111212285,0.00056765514,0.0006799898,0.0002411364,0.00014189776,0.0006230399,0.0000113365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003264864,0.00005481861,0.0005315252,0.0006340096,0.00012386913,0.00010120507,0.00029118248,0.83443785,0.0009399201,0.0008125964,0.0018365941,0.16020375],"study_design_scores_gemma":[0.00097211247,0.0018635947,0.0003582398,0.0067341435,0.00024647865,0.0002341192,0.0000013664635,0.83205557,0.028635664,0.09617062,0.029040948,0.003687127],"about_ca_topic_score_codex":0.000015360523,"about_ca_topic_score_gemma":0.0000650707,"teacher_disagreement_score":0.76155525,"about_ca_system_score_codex":0.00021189444,"about_ca_system_score_gemma":0.00018972918,"threshold_uncertainty_score":0.9998752},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025151682,0.000029079165,0.9928064,0.0003289674,0.001141544,0.0008712288,0.00019563279,0.00014911492,0.0019629053],"genre_scores_gemma":[0.86948496,0.000006233658,0.12937088,0.00075342803,0.00024742112,0.000038601873,0.000034234105,0.000036094312,0.00002811814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957477,0.00021930228,0.00071511423,0.0017808577,0.0009922326,0.0005447817],"domain_scores_gemma":[0.9952141,0.0022478644,0.00087948353,0.0009584589,0.0004793743,0.00022073615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011432588,0.00062188954,0.00066002924,0.0011258087,0.000490414,0.00053394516,0.0010285184,0.0003157942,0.000024374413],"category_scores_gemma":[0.00027552666,0.0006173152,0.0001350463,0.0004880947,0.0007290218,0.0012688168,0.00054847385,0.0007499481,0.000038179784],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118413955,0.00009814809,0.0000054533907,0.000038839087,0.00002638787,0.000048271915,0.014951938,0.0009256419,0.0008884689,0.0005103322,0.000008385192,0.98237973],"study_design_scores_gemma":[0.0021254087,0.00092982047,0.00017851332,0.0015991103,0.000028797915,0.00009286801,0.000017634993,0.93717396,0.011266809,0.04476669,0.00028454146,0.0015358375],"about_ca_topic_score_codex":0.0006474336,"about_ca_topic_score_gemma":0.000344343,"teacher_disagreement_score":0.9808439,"about_ca_system_score_codex":0.00054964045,"about_ca_system_score_gemma":0.00058064196,"threshold_uncertainty_score":0.9996278},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032907865,0.00011295186,0.99102885,0.00051355315,0.0011191749,0.0009598145,0.000014824428,0.005887329,0.00033058794],"genre_scores_gemma":[0.069128014,5.3069556e-7,0.9280446,0.0022882444,0.0002996598,0.000081981896,0.000017182136,0.000057529196,0.00008221576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957154,0.000047818554,0.0005705634,0.0017889057,0.0009633266,0.0009139967],"domain_scores_gemma":[0.99190307,0.004974201,0.00032923592,0.001548087,0.001016104,0.0002293226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013967514,0.00064436905,0.00056769716,0.0009989042,0.00050255615,0.00086607574,0.002778652,0.00042352526,0.000021013679],"category_scores_gemma":[0.0015893677,0.00060709985,0.00018204491,0.0007711508,0.0010573408,0.00043150742,0.00051721407,0.0007757376,0.000031786636],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007635892,0.000030423522,0.00032918295,0.0001422527,0.00000613777,0.000018494573,0.000048841666,0.05049022,0.00004932821,0.0021426692,0.0002539246,0.9464809],"study_design_scores_gemma":[0.00033902706,0.00043458742,0.00012919323,0.0008917985,0.0000104011615,0.000020762824,2.5238316e-8,0.77181715,0.0010064133,0.22441003,0.0002879152,0.0006527171],"about_ca_topic_score_codex":0.000064647946,"about_ca_topic_score_gemma":0.000009687006,"teacher_disagreement_score":0.9458282,"about_ca_system_score_codex":0.00032870282,"about_ca_system_score_gemma":0.0017424583,"threshold_uncertainty_score":0.999638},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003958456,0.00013382404,0.98595524,0.0005325183,0.0013707323,0.00028757405,0.000008497201,0.00010559652,0.011210189],"genre_scores_gemma":[0.97301215,0.000025387355,0.02167053,0.0049902867,0.00018599193,0.0000030991966,0.0000042224897,0.000024913712,0.00008344614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99669176,0.000058072885,0.00039983637,0.0010460069,0.0012921076,0.00051223475],"domain_scores_gemma":[0.9969935,0.0006601145,0.0004177978,0.0016384841,0.00017898827,0.00011116056],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007296051,0.00047439194,0.00044097612,0.00084277266,0.0006959148,0.00029736565,0.006157212,0.00022041789,0.00003550942],"category_scores_gemma":[0.0000067939836,0.00033995355,0.00017946215,0.00070185657,0.00065152923,0.00051579997,0.0031345233,0.00063246634,0.000015985384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001565019,0.00026364013,0.0049216854,0.0012950234,0.00018344788,0.0002603445,0.07301709,0.22712871,0.00016432542,0.5682231,0.00003862055,0.12434749],"study_design_scores_gemma":[0.00045294646,0.00039661923,0.0009027906,0.0011938896,0.00003899621,0.000018202145,0.000011392735,0.30094597,0.0015905359,0.6933875,0.00027211398,0.00078901835],"about_ca_topic_score_codex":0.00023209347,"about_ca_topic_score_gemma":0.0007623781,"teacher_disagreement_score":0.97261626,"about_ca_system_score_codex":0.00019610538,"about_ca_system_score_gemma":0.00022400518,"threshold_uncertainty_score":0.9999052},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053737964,0.00034602886,0.9958775,0.000023031585,0.0010190762,0.00022002835,0.000001999075,0.00018398296,0.0017909557],"genre_scores_gemma":[0.8981154,0.00009848193,0.09799245,0.00022215018,0.0020221826,0.000021296435,0.000026544947,0.00009060587,0.0014108822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990678,0.0000045009083,0.0001793486,0.00025753718,0.00020434015,0.00028650925],"domain_scores_gemma":[0.9995964,0.00006917423,0.000046499477,0.0001582306,0.000059854945,0.00006980338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021974985,0.00019723637,0.00017794756,0.00025078564,0.00009962946,0.000092526905,0.00026902725,0.00014554897,0.00008219384],"category_scores_gemma":[0.00003492773,0.00018884377,0.00006635668,0.00007643621,0.00008449778,0.00016011423,0.00005300921,0.00034530225,0.00006690328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.717482e-7,0.000012825693,0.00014130722,0.0001177926,0.000007152798,0.000001703803,0.00052305113,0.24427691,0.0005202085,0.0025221074,0.000049624527,0.75182676],"study_design_scores_gemma":[0.00015202581,0.000057682544,0.00019747602,0.00024194592,0.000007271282,0.0000069554776,1.8525891e-7,0.97048336,0.0004348183,0.0072036423,0.020815877,0.00039875318],"about_ca_topic_score_codex":0.0000010272461,"about_ca_topic_score_gemma":0.000005648024,"teacher_disagreement_score":0.8978851,"about_ca_system_score_codex":0.00012403671,"about_ca_system_score_gemma":0.00002228782,"threshold_uncertainty_score":0.77008253},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024013095,0.00022413649,0.97364223,0.00015020349,0.000811702,0.0006515589,0.000010768814,0.00022670138,0.00026962825],"genre_scores_gemma":[0.48191828,0.000036383783,0.51701933,0.00032307225,0.000298347,0.000013325682,0.0000069691605,0.00004920106,0.0003350886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928066,0.00015369341,0.0010173414,0.0027492687,0.0020783197,0.0011947564],"domain_scores_gemma":[0.9945172,0.0007242993,0.00026096823,0.0029914796,0.001077993,0.0004280327],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020825865,0.0007008133,0.00079831877,0.0012069036,0.0006372559,0.0017543787,0.0030595458,0.0004520203,0.000083316605],"category_scores_gemma":[0.0006348245,0.0006437147,0.0003069972,0.001427628,0.000883612,0.0024816466,0.0027859046,0.0013539679,0.00013796915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019209407,0.00021485894,0.0014497471,0.00017069999,0.00010477013,0.0025649897,0.0016617096,0.55261254,0.00034661862,0.010525099,0.0000152484945,0.43031454],"study_design_scores_gemma":[0.00020531117,0.00010057673,0.000023786664,0.00024294805,0.00001618937,0.0003119408,3.166897e-7,0.95534533,0.0001778914,0.04281355,0.00012956643,0.00063258887],"about_ca_topic_score_codex":0.0018264505,"about_ca_topic_score_gemma":0.00021264881,"teacher_disagreement_score":0.45790517,"about_ca_system_score_codex":0.0010277001,"about_ca_system_score_gemma":0.0008068154,"threshold_uncertainty_score":0.9996014},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022651775,0.00011581502,0.9960999,0.0006088878,0.00085515797,0.00029168857,0.00006117363,0.00006434925,0.001880386],"genre_scores_gemma":[0.14934923,0.00006115323,0.848594,0.00062589225,0.00029980505,0.000014352743,0.000006254364,0.00006404743,0.0009852847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949561,0.00018915081,0.0006062053,0.0015081902,0.00195774,0.00078263826],"domain_scores_gemma":[0.99399716,0.0020753075,0.00032428544,0.0028535519,0.0005726646,0.00017702673],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023057335,0.0004525155,0.0007807244,0.001313883,0.00021685327,0.00022795249,0.0072659478,0.00027853955,0.00007152547],"category_scores_gemma":[0.0004329725,0.00027743133,0.0003432321,0.0030446206,0.0031971529,0.00032003914,0.0040211855,0.0007809637,0.000015955457],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040746345,0.000020837066,0.00012713856,0.000010187776,0.00011108954,0.000020152154,0.0002241561,0.022387773,0.000041417414,0.080964245,0.0000022460638,0.8960867],"study_design_scores_gemma":[0.00013460746,0.000067556284,0.0017315426,0.0001455696,0.00003200969,0.000012555665,4.2305516e-8,0.8422289,0.00051790604,0.15471388,0.00008060535,0.0003348078],"about_ca_topic_score_codex":0.000030868843,"about_ca_topic_score_gemma":0.00013598047,"teacher_disagreement_score":0.8957519,"about_ca_system_score_codex":0.000327894,"about_ca_system_score_gemma":0.0006153568,"threshold_uncertainty_score":0.9999678},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019042364,0.000042913296,0.99673057,0.0006191165,0.0005988943,0.0010314214,0.000041741663,0.00013520259,0.0006097165],"genre_scores_gemma":[0.29077426,0.000008878226,0.7084305,0.00040700246,0.0001410871,0.000075366304,0.00003742846,0.000022609225,0.00010282366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675125,0.0000591876,0.00086383725,0.001236809,0.00068390364,0.00040502416],"domain_scores_gemma":[0.996055,0.0013076642,0.0007797339,0.0011652429,0.00060396804,0.000088357316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013638302,0.00037127643,0.00053069624,0.0005179688,0.00024430273,0.00020330469,0.0017644481,0.00026391927,0.000007254207],"category_scores_gemma":[0.0003815048,0.00037340366,0.00017588274,0.0004226161,0.00092100527,0.0004135577,0.0005986618,0.00040082532,0.00001035604],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015230365,0.000021413634,0.000022616267,0.00016742611,0.000023033077,9.3350707e-7,0.0025857794,0.03405077,0.00047678984,0.08256762,0.000021165275,0.8800472],"study_design_scores_gemma":[0.00026841162,0.00016234785,0.000051036688,0.00040231706,0.000015757938,0.00001692293,0.0000016779605,0.831559,0.0013897179,0.16546331,0.00033754983,0.0003319338],"about_ca_topic_score_codex":0.000056088913,"about_ca_topic_score_gemma":0.000050389823,"teacher_disagreement_score":0.87971526,"about_ca_system_score_codex":0.00035597823,"about_ca_system_score_gemma":0.000370572,"threshold_uncertainty_score":0.9998718},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051347146,0.00039553145,0.9875371,0.00027307516,0.0013315713,0.0003356584,0.000017218375,0.00011457823,0.009943955],"genre_scores_gemma":[0.108095355,0.000061383034,0.8896368,0.00090619817,0.0004997308,0.000010655609,0.000019630546,0.0000433392,0.000726884],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99631,0.000030400184,0.0006194549,0.0013499354,0.001120406,0.00056978874],"domain_scores_gemma":[0.9966892,0.00027076513,0.00041797818,0.002099502,0.0003306163,0.00019195036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005545484,0.00046283664,0.0006479445,0.00059769524,0.00018865467,0.0003328544,0.004828305,0.00028028377,0.00016442672],"category_scores_gemma":[0.00004921447,0.00039741764,0.00014109361,0.0004767329,0.0013662102,0.0008841511,0.0026993065,0.0006476292,0.00012803184],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020293214,0.000045064106,0.000027646527,0.000054744654,0.000009787162,0.00002814829,0.00033743263,0.0022129319,0.0003091537,0.19244263,0.00017067503,0.8043598],"study_design_scores_gemma":[0.00021239047,0.00014190753,0.00033203297,0.00037441417,0.000004941562,0.00004074269,7.786865e-8,0.4235423,0.0016237843,0.5705121,0.002664945,0.00055034197],"about_ca_topic_score_codex":0.000113991075,"about_ca_topic_score_gemma":0.000024723748,"teacher_disagreement_score":0.8038094,"about_ca_system_score_codex":0.00014955619,"about_ca_system_score_gemma":0.00042286894,"threshold_uncertainty_score":0.99984777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0143806385,0.000012556005,0.98329157,0.001457567,0.00024604372,0.0002936997,1.7372686e-7,0.00016873787,0.00014901532],"genre_scores_gemma":[0.4951108,5.393587e-7,0.50283843,0.0019881749,0.0000393146,0.00001333087,8.007274e-7,0.0000053418726,0.0000032671826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980719,0.0000779438,0.0002285739,0.00076377264,0.00045702996,0.00040077342],"domain_scores_gemma":[0.9988132,0.0001230201,0.00010626114,0.00065395806,0.0001423972,0.00016116537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080340425,0.00016239878,0.00014845119,0.00041658885,0.00023807472,0.00028004873,0.0012558047,0.00005179018,0.000008251533],"category_scores_gemma":[0.0001261742,0.00014015408,0.000023882894,0.0027280918,0.00012851204,0.0007093468,0.00028799433,0.00015006092,0.000032415657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018611869,0.00005005072,0.002496951,0.0000061527358,0.0000032839932,0.000012146967,0.0075759594,0.21765801,0.0072960523,0.025971066,0.000012541217,0.7388992],"study_design_scores_gemma":[0.00030861318,0.000115670366,0.007619118,0.000028584005,0.0000013671519,0.000023193787,0.0000016129136,0.9694275,0.012135211,0.009873617,0.00022726884,0.00023821344],"about_ca_topic_score_codex":0.00004544629,"about_ca_topic_score_gemma":0.00006802684,"teacher_disagreement_score":0.7517695,"about_ca_system_score_codex":0.000098952165,"about_ca_system_score_gemma":0.00014069646,"threshold_uncertainty_score":0.5715318},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006310171,0.000661471,0.9959802,0.00019044959,0.00033435517,0.00053541135,6.979876e-7,0.00040359274,0.0012628249],"genre_scores_gemma":[0.24361458,0.0002621574,0.75543034,0.00032345657,0.00017349981,0.000017227398,0.000015674403,0.00003744415,0.00012559544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963115,0.00007457615,0.00067071297,0.0015425304,0.0007857554,0.00061494537],"domain_scores_gemma":[0.99840426,0.0001795488,0.00030178332,0.0008500837,0.00013334527,0.00013096747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009846902,0.000489077,0.00048711733,0.001035263,0.0003269415,0.0009148746,0.0017749495,0.00033602738,0.000010156596],"category_scores_gemma":[0.000048292248,0.00049463497,0.000070174516,0.00085219333,0.00034825175,0.0008313005,0.0013054312,0.0006248996,0.000010913983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003926913,0.0000281774,0.00015689617,0.00003810155,0.0000035302096,0.000049657538,0.0014163926,0.08671247,0.0000299206,0.0050131073,0.0000048185693,0.906543],"study_design_scores_gemma":[0.0002679569,0.000106101346,0.000112303096,0.00091632316,0.0000037131476,0.000061370425,4.2702015e-7,0.9135743,0.00021459044,0.08401884,0.00017564339,0.0005484428],"about_ca_topic_score_codex":0.00004185561,"about_ca_topic_score_gemma":0.000044774984,"teacher_disagreement_score":0.90599453,"about_ca_system_score_codex":0.00026402686,"about_ca_system_score_gemma":0.00023628799,"threshold_uncertainty_score":0.99975055},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07175363,0.00054825435,0.91855586,0.00005717048,0.0023449888,0.00090631965,0.00002942516,0.00006820948,0.0057361457],"genre_scores_gemma":[0.9948026,0.0000021386159,0.0043322626,0.00059114955,0.00013343774,0.000028299835,0.00002259788,0.000022461574,0.00006506348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998339,0.00006228448,0.00031737474,0.00060183846,0.0004439371,0.00023555759],"domain_scores_gemma":[0.99877816,0.00029271856,0.00024343988,0.00047465766,0.00012574598,0.000085246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060222717,0.00029663337,0.00037154186,0.00046257328,0.000050439543,0.000054979624,0.00035677775,0.00021724692,0.00016640038],"category_scores_gemma":[0.00003557398,0.00023216402,0.00008054036,0.00015778656,0.0003549545,0.00008345778,0.00010038334,0.0003090957,0.000019241068],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004839086,0.00013098425,0.00039795734,0.00008716617,0.000022710386,0.000037291626,0.007996396,0.0006338696,0.00014553551,0.00060455216,0.000040444866,0.9898547],"study_design_scores_gemma":[0.0030444528,0.0039101606,0.013520313,0.0026886908,0.00028081812,0.00005998514,0.00003346538,0.9280992,0.004108288,0.042604532,0.00015709003,0.0014929769],"about_ca_topic_score_codex":0.000040758103,"about_ca_topic_score_gemma":0.000055804765,"teacher_disagreement_score":0.9883617,"about_ca_system_score_codex":0.000119767275,"about_ca_system_score_gemma":0.00014330621,"threshold_uncertainty_score":0.9467374},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003597018,0.0003753009,0.9945654,0.00018548535,0.000474013,0.00042471488,0.000051088813,0.000014292082,0.00031268885],"genre_scores_gemma":[0.7875328,0.0002008968,0.20829272,0.0015070088,0.001654072,0.000057976966,0.00028827146,0.00006020523,0.00040605993],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979208,0.000016414027,0.0002283797,0.0013709661,0.00024318096,0.00022026892],"domain_scores_gemma":[0.9985022,0.000017370028,0.00012181108,0.0010921233,0.00009727319,0.00016920357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019511844,0.00024771094,0.00018698523,0.00018126203,0.00009805151,0.000076280965,0.0011438734,0.00018779645,0.000010961321],"category_scores_gemma":[0.00003959868,0.00023516698,0.000021002568,0.00009614666,0.00005842971,0.000017730805,0.0024863158,0.00015106116,0.000012671893],"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.000045831443,0.000009943412,0.000013668403,0.000012347889,0.0000060826114,0.0000016789263,0.00038582738,0.033129472,0.78074884,0.000010676808,0.00007222441,0.1855634],"study_design_scores_gemma":[0.00032381885,0.00021599366,0.0001966396,0.00044221504,0.000012552039,0.000011186518,0.000001706735,0.16585231,0.8169588,0.0015044959,0.013747808,0.00073248823],"about_ca_topic_score_codex":0.00003685513,"about_ca_topic_score_gemma":0.00014200312,"teacher_disagreement_score":0.7862727,"about_ca_system_score_codex":0.000046365963,"about_ca_system_score_gemma":0.00007364291,"threshold_uncertainty_score":0.9589831},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007449199,0.00027562832,0.9930614,0.0013887616,0.0019801622,0.00033645926,0.000008108325,0.000050733084,0.0021538197],"genre_scores_gemma":[0.9038414,0.000018014905,0.0933368,0.0019417426,0.0004988461,0.000011600879,0.000009217708,0.00001925758,0.00032311937],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972452,0.000072458766,0.00045789103,0.00082687323,0.001007783,0.00038978524],"domain_scores_gemma":[0.9967562,0.0012148115,0.00029574588,0.0013179692,0.00030972963,0.00010552731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001774083,0.00032941156,0.00034749426,0.0004453289,0.00020677612,0.00018446414,0.0023573393,0.00017180503,0.000075748736],"category_scores_gemma":[0.00023624607,0.00023262683,0.00013558792,0.0006322645,0.0005303309,0.00042641364,0.00076448184,0.00050974864,0.000049388647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009336968,0.000060899692,0.000034941913,0.000037008693,0.000012607236,0.0000054354696,0.0009386478,0.060811467,0.00016432254,0.41606292,0.00014822735,0.52171415],"study_design_scores_gemma":[0.00017652045,0.00019824524,0.00056149263,0.000198275,0.000008633688,0.000029650686,2.2516357e-7,0.32367787,0.005527099,0.66744965,0.0016893471,0.00048297923],"about_ca_topic_score_codex":0.000007777665,"about_ca_topic_score_gemma":0.000012411968,"teacher_disagreement_score":0.9030965,"about_ca_system_score_codex":0.00014699173,"about_ca_system_score_gemma":0.00037376623,"threshold_uncertainty_score":0.9486247},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003209066,0.0011076082,0.970627,0.0008018824,0.004648643,0.0004977408,0.0000053126873,0.00018893434,0.022090752],"genre_scores_gemma":[0.38281158,0.00008932188,0.60316396,0.004745447,0.004668318,0.000029481695,0.000030249359,0.00012308882,0.004338558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944941,0.000082114144,0.00089731463,0.002027173,0.0010827751,0.0014165135],"domain_scores_gemma":[0.9964402,0.0006270194,0.0004165125,0.0017562177,0.00027745412,0.00048262472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019631046,0.0007968066,0.000954698,0.0010564175,0.00019604739,0.00064336724,0.004335947,0.00047006836,0.000040676103],"category_scores_gemma":[0.000028697625,0.00075435813,0.00017444683,0.0013449622,0.0007156081,0.0004335252,0.0020327237,0.001598037,0.00008568516],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018916337,0.000035258377,0.00028525185,0.000016815153,0.00000853117,0.0006301289,0.00031202353,0.04083173,0.000001107681,0.024686273,0.0005536081,0.93262035],"study_design_scores_gemma":[0.00041017108,0.00014155662,0.00011568858,0.0006149171,0.000008439852,0.000071721544,8.267269e-8,0.76503015,0.000005621103,0.22600195,0.0068276776,0.0007720342],"about_ca_topic_score_codex":0.0002315909,"about_ca_topic_score_gemma":0.0046441974,"teacher_disagreement_score":0.93184835,"about_ca_system_score_codex":0.0004667791,"about_ca_system_score_gemma":0.0014610001,"threshold_uncertainty_score":0.99949074},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011828471,0.00031763042,0.99646103,0.0001827213,0.00053576817,0.0005197827,0.0000017546128,0.00034603567,0.0004524306],"genre_scores_gemma":[0.4855732,0.00003410266,0.51344407,0.00021910502,0.00053554587,0.00001313144,0.000004015066,0.00003351809,0.0001433342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946279,0.00012682793,0.0005859177,0.0018459983,0.0018133416,0.0010000147],"domain_scores_gemma":[0.9961987,0.0012413573,0.00020386676,0.0015544911,0.0005413763,0.0002601761],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024256152,0.0004773577,0.0006005633,0.0012509917,0.000578173,0.001150907,0.0032257596,0.00032242562,0.00002280515],"category_scores_gemma":[0.00059753354,0.000436662,0.00022627081,0.0013823957,0.00096023805,0.000426367,0.0016067876,0.001203182,0.000034447916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036293497,0.000040035713,0.00009213207,0.00006576323,0.000011629736,0.00004312314,0.00017855444,0.049711365,0.00020973025,0.0013692296,0.0000019596998,0.9482728],"study_design_scores_gemma":[0.00016054674,0.00024573316,0.000031277552,0.00037396798,0.00001131493,0.00006928822,1.6995148e-7,0.9709711,0.0018155547,0.025324192,0.000514597,0.0004822779],"about_ca_topic_score_codex":0.00010748181,"about_ca_topic_score_gemma":0.00004115363,"teacher_disagreement_score":0.94779056,"about_ca_system_score_codex":0.00052730134,"about_ca_system_score_gemma":0.00075821957,"threshold_uncertainty_score":0.999886},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003953706,0.00027004673,0.9959797,0.00014195952,0.00039288178,0.00066970487,0.000009009604,0.000043443604,0.0020978446],"genre_scores_gemma":[0.55379826,0.0002556516,0.44526073,0.00017536336,0.000054276297,0.00002722449,0.0000061213127,0.00002913763,0.00039324304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679196,0.00004952589,0.00075423566,0.0009248741,0.00092898525,0.0005504369],"domain_scores_gemma":[0.9972925,0.0006875748,0.00041090135,0.0010930676,0.00037611203,0.00013983763],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007204889,0.00035674835,0.0005836819,0.0009854618,0.000065832035,0.00016793818,0.0030348261,0.00019781939,0.000053995573],"category_scores_gemma":[0.00012982484,0.00031555002,0.00009944842,0.0008587373,0.0012481235,0.00076865,0.0012624766,0.0005427982,0.000019964375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033892018,0.00004828861,0.000102007405,0.000074722906,0.00000452515,0.000017759965,0.00146552,0.79045206,0.00009143664,0.0074557313,0.0000044807966,0.20028009],"study_design_scores_gemma":[0.00026935153,0.000285461,0.0001251878,0.0005014351,0.0000018371721,0.000008530352,5.886692e-7,0.969369,0.00147387,0.027560327,0.00007687456,0.00032753256],"about_ca_topic_score_codex":0.00017104228,"about_ca_topic_score_gemma":0.0002101228,"teacher_disagreement_score":0.5534029,"about_ca_system_score_codex":0.00013979367,"about_ca_system_score_gemma":0.00061490317,"threshold_uncertainty_score":0.99992967},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010811974,0.00030387752,0.9870128,0.000053401625,0.0007120908,0.0006612432,0.000055295783,0.00009095928,0.00029835783],"genre_scores_gemma":[0.97498745,0.00007662899,0.024351785,0.00016990649,0.00023230053,0.0000239319,0.000011539316,0.000057889894,0.00008856447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825025,0.000007741399,0.00046156094,0.00051881466,0.0003027104,0.0004589318],"domain_scores_gemma":[0.9990085,0.0002472,0.0001628915,0.00033384876,0.00013620067,0.00011137403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002492061,0.0004167424,0.00063882966,0.0006881627,0.00007223189,0.00017455082,0.00045139727,0.00032405154,0.000012172908],"category_scores_gemma":[0.000061517305,0.00036586766,0.00009134252,0.00027920387,0.00015372213,0.0002591416,0.0001085033,0.00029301894,0.0000031677932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003439728,0.000007979315,0.000008845942,0.00018079614,0.00003891756,0.000002328042,0.0002361179,0.004286452,0.0025544213,0.00034386196,0.00002768759,0.9922782],"study_design_scores_gemma":[0.0003967908,0.00011055043,0.000026901378,0.00017187749,0.000028736298,0.000008500721,8.989167e-8,0.9896134,0.0036303317,0.0054473784,0.00017917453,0.0003862761],"about_ca_topic_score_codex":0.000009917218,"about_ca_topic_score_gemma":0.000009722995,"teacher_disagreement_score":0.9918919,"about_ca_system_score_codex":0.0001211297,"about_ca_system_score_gemma":0.00011957978,"threshold_uncertainty_score":0.9998793},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058518264,0.0006307567,0.9747719,0.00061238045,0.0015785882,0.00037094433,0.0000057578595,0.00020997033,0.021761173],"genre_scores_gemma":[0.086197406,0.00031296635,0.90941036,0.0021309091,0.00052350323,0.000009920201,0.0000059254367,0.00007287704,0.0013361197],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99531704,0.000050106242,0.00046890718,0.0018803983,0.0012463167,0.0010372038],"domain_scores_gemma":[0.9969757,0.00022540367,0.00018972669,0.002070653,0.00024520245,0.00029329173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011352495,0.0006056196,0.00057497405,0.0008411213,0.00030234316,0.00065386784,0.005130518,0.0002947178,0.000053493954],"category_scores_gemma":[0.00002860692,0.000508491,0.00016827129,0.0006947732,0.0008911505,0.0006252649,0.0021808993,0.001089579,0.00026298722],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064358883,0.000033368065,0.000079608144,0.000033804346,0.000007686716,0.00034776746,0.0015352975,0.0067226524,0.00002901619,0.046454318,0.000054403365,0.94469565],"study_design_scores_gemma":[0.0003412444,0.00038330758,0.00036749407,0.00026705538,0.000007629291,0.00012950614,1.10111905e-7,0.28049964,0.001075878,0.7089681,0.0067418655,0.0012181606],"about_ca_topic_score_codex":0.00010194591,"about_ca_topic_score_gemma":0.00006137957,"teacher_disagreement_score":0.94347745,"about_ca_system_score_codex":0.00020738342,"about_ca_system_score_gemma":0.0005576265,"threshold_uncertainty_score":0.99973667},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060637476,0.0004922583,0.99298376,0.0006880177,0.0002025083,0.00017665059,0.000046861343,0.00006645926,0.00473709],"genre_scores_gemma":[0.14978363,0.000015487514,0.8483476,0.00030782653,0.0001389029,0.0000036843285,0.000060587987,0.000011940434,0.0013303409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699545,0.000027833494,0.0005415665,0.0012491801,0.0007659332,0.0004200535],"domain_scores_gemma":[0.9976807,0.00014655823,0.00026041508,0.0012599257,0.00051049865,0.0001418688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011637989,0.00038051032,0.0005576979,0.00024918056,0.00017438763,0.00021745122,0.0025342577,0.00022485506,0.000012113428],"category_scores_gemma":[0.00014447756,0.00034885592,0.000051017334,0.00023288347,0.0004912789,0.000838607,0.003481454,0.00041332378,0.0000031827808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012153168,0.000015221545,0.000008427972,0.00005530407,0.000012867235,0.000021906491,0.0003431866,0.9753265,0.0009386712,0.013307365,0.000040667997,0.009917732],"study_design_scores_gemma":[0.00020164576,0.00005130269,0.0000013579083,0.00018387026,0.000005461784,0.00010966748,1.9021496e-7,0.8670366,0.0002077286,0.1316824,0.00019176984,0.0003280413],"about_ca_topic_score_codex":0.00001196365,"about_ca_topic_score_gemma":0.000007480459,"teacher_disagreement_score":0.14917725,"about_ca_system_score_codex":0.000069103895,"about_ca_system_score_gemma":0.00044016584,"threshold_uncertainty_score":0.99989635},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027187113,0.00083414954,0.99509495,0.00069398346,0.0012511108,0.00089784816,0.000031185496,0.00016558163,0.00075932377],"genre_scores_gemma":[0.19670705,0.00006013439,0.7984476,0.002002547,0.0017155453,0.00003952508,0.0000639762,0.00010583346,0.0008578077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945024,0.000095404255,0.0005107514,0.0024596842,0.0017666157,0.0006651062],"domain_scores_gemma":[0.99110013,0.00044810105,0.0003422083,0.007471748,0.00036631498,0.0002714704],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0020801437,0.0006374537,0.00054774876,0.00039657202,0.0005822994,0.0011719194,0.011166214,0.00018978922,0.000015236468],"category_scores_gemma":[0.00006967499,0.00036487446,0.00005016226,0.0007051577,0.00076942716,0.0014741169,0.009960744,0.0010608212,0.000041555726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020997813,0.0002173787,0.00011007116,0.000020610747,0.00004909238,0.01626709,0.0047601466,0.016750587,0.0000034648326,0.0031652837,0.0014156639,0.9572196],"study_design_scores_gemma":[0.00075545546,0.00066328875,0.00003926223,0.00022367146,0.000033913304,0.0062535126,0.000008024594,0.9566993,0.0000064206024,0.020205567,0.014204023,0.0009075209],"about_ca_topic_score_codex":0.0004706996,"about_ca_topic_score_gemma":0.0008694937,"teacher_disagreement_score":0.9563121,"about_ca_system_score_codex":0.00014597477,"about_ca_system_score_gemma":0.00093091046,"threshold_uncertainty_score":0.9998803},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034926046,0.0058016786,0.9681542,0.005662864,0.0052123563,0.0078576775,0.0059994105,0.00018596156,0.0007766281],"genre_scores_gemma":[0.6946231,0.0014707283,0.16499774,0.04841487,0.01199383,0.001488645,0.074351385,0.0006038052,0.0020559006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98772085,0.002253158,0.004389738,0.0019405965,0.0016990429,0.0019966431],"domain_scores_gemma":[0.98746115,0.0030485285,0.002671541,0.0054751034,0.0006684115,0.0006752705],"candidate_categories":["metaresearch","metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.04538327,0.0006662575,0.0018911061,0.00058005383,0.00066096545,0.00019211287,0.0058154976,0.00079188735,0.000017446997],"category_scores_gemma":[0.0025105444,0.00057105505,0.000055598415,0.00045289,0.00034633893,0.0021824937,0.0019915996,0.0028831544,0.00004016903],"study_design_candidate":"design_other","study_design_consensus":null,"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.00015824739,0.00006735709,0.00063256087,0.008748685,0.000022117392,0.0000020959399,0.004117342,0.0013602466,0.000005262708,0.0057220156,0.0032804003,0.97588366],"study_design_scores_gemma":[0.002675174,0.00076154916,0.000979401,0.0056419736,0.000013754365,0.00003430005,0.000025343674,0.49655622,0.0000013576299,0.009888722,0.48207393,0.00134828],"about_ca_topic_score_codex":0.038313147,"about_ca_topic_score_gemma":0.040392604,"teacher_disagreement_score":0.9745354,"about_ca_system_score_codex":0.003043283,"about_ca_system_score_gemma":0.015015992,"threshold_uncertainty_score":0.9996741},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000080777914,0.00023095716,0.99613386,0.00087197917,0.00131951,0.0002716048,0.00012439802,0.0002539169,0.00071300013],"genre_scores_gemma":[0.16128942,0.000054968972,0.83403325,0.0013590221,0.00087120925,0.000025563093,0.0001394918,0.00006022153,0.0021668174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611145,0.000040944524,0.00044842213,0.001653666,0.0010408339,0.00070468674],"domain_scores_gemma":[0.9965439,0.0006689273,0.00026133304,0.0016439238,0.00054929074,0.00033262675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011406108,0.00050461065,0.0005993715,0.0011369836,0.0010199385,0.000622279,0.004257634,0.00034011627,0.00002022296],"category_scores_gemma":[0.00016777668,0.00045737263,0.00023728426,0.00084722345,0.00047331324,0.0010025708,0.0045316075,0.00070235634,0.00003521888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015482756,0.0001361865,0.0013548386,0.00010576067,0.00014387058,0.00025050453,0.0025515566,0.08753975,0.00012887569,0.032743465,0.007387923,0.8676418],"study_design_scores_gemma":[0.0004053908,0.00015849901,0.000055325127,0.0006430834,0.00007623237,0.000051574905,0.0000021633125,0.9443375,0.00006950873,0.03520384,0.017987607,0.0010092908],"about_ca_topic_score_codex":0.00005818928,"about_ca_topic_score_gemma":0.00025694654,"teacher_disagreement_score":0.8666325,"about_ca_system_score_codex":0.00031190188,"about_ca_system_score_gemma":0.0010351245,"threshold_uncertainty_score":0.9997878},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007674649,0.001355413,0.9911051,0.000067352776,0.0050558727,0.00024098555,0.0000033452302,0.00043339282,0.0017308984],"genre_scores_gemma":[0.031262975,0.000023893659,0.9676559,0.00022207238,0.00043683362,0.0000045646893,0.000025031813,0.00010752444,0.0002612348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982863,0.00002291334,0.00035449813,0.00053667236,0.0003836497,0.00041593358],"domain_scores_gemma":[0.9989209,0.00020481873,0.00008258172,0.00049456325,0.00017438536,0.00012272938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037382302,0.00039771028,0.00037239442,0.0007103711,0.00005722242,0.0000375664,0.0006476674,0.0004843461,0.00032183027],"category_scores_gemma":[0.00009654317,0.0004319358,0.000047055542,0.00020582463,0.0005584474,0.00019065093,0.0000997916,0.0006213975,0.000012328679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069631174,0.0000012560138,0.000002851043,0.000019877625,0.0000065789013,0.00001610719,0.00011989617,0.9955279,0.000035897843,0.0003637869,0.000104688675,0.0037941504],"study_design_scores_gemma":[0.0002243459,0.000053068958,0.0000032293162,0.0000486851,0.0000096828235,0.000027853011,5.8225396e-8,0.9954454,0.00026677907,0.0027683545,0.0007377522,0.00041484903],"about_ca_topic_score_codex":0.0000023884584,"about_ca_topic_score_gemma":0.0000029530504,"teacher_disagreement_score":0.0312553,"about_ca_system_score_codex":0.0016071824,"about_ca_system_score_gemma":0.0003703948,"threshold_uncertainty_score":0.99981326},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009782009,0.001821173,0.9884497,0.0032885985,0.001697999,0.00043818093,0.000013924153,0.00014360061,0.0031686416],"genre_scores_gemma":[0.81978166,0.00045111708,0.1591108,0.014306787,0.0036942184,0.00006786358,0.000006497922,0.00013224773,0.0024487947],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963815,0.00009221111,0.00035941025,0.0017165547,0.0008795784,0.0005707181],"domain_scores_gemma":[0.996817,0.0010761552,0.00026472777,0.0014278184,0.00024006526,0.00017422305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006425249,0.0005057987,0.00041117592,0.00036204964,0.0006112188,0.00051841803,0.0021312505,0.00035060733,0.0001378411],"category_scores_gemma":[0.00009475918,0.0003269452,0.0001387274,0.00037414843,0.0011771545,0.0004840101,0.0018030643,0.0007438123,0.00009227521],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059943377,0.000030755393,0.0000685662,0.000015187344,0.000033790555,0.00009099485,0.0021216772,0.0019374875,0.0008861973,0.028128574,0.0001567883,0.96647006],"study_design_scores_gemma":[0.0008242823,0.00043033352,0.00043700036,0.00065799983,0.000024496774,0.00008574356,7.697619e-7,0.46276534,0.0054873414,0.51274955,0.015416038,0.0011210974],"about_ca_topic_score_codex":0.00012412756,"about_ca_topic_score_gemma":0.0011774162,"teacher_disagreement_score":0.96534896,"about_ca_system_score_codex":0.00059361744,"about_ca_system_score_gemma":0.0003343596,"threshold_uncertainty_score":0.9999183},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009104973,0.001602123,0.9799484,0.014461454,0.0017274754,0.0007394597,0.000335572,0.00066448515,0.00051194074],"genre_scores_gemma":[0.0032041988,0.00016393619,0.99506545,0.0007848031,0.00042048006,0.000009093054,0.0002636368,0.000055102068,0.000033306453],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99279004,0.000042757212,0.0006554659,0.0043066745,0.0012400355,0.00096500496],"domain_scores_gemma":[0.95181996,0.0013919222,0.00042914745,0.045824874,0.00029716053,0.00023692645],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0037716497,0.0006796884,0.00074300193,0.0007235783,0.00032746617,0.0013493577,0.16664751,0.0007218734,0.0000062412128],"category_scores_gemma":[0.036891133,0.0006355499,0.000043119213,0.0007745842,0.0012186143,0.002814395,0.47098994,0.0014818849,0.000011860102],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010180774,0.000019514173,0.00001807935,0.00007714366,0.000023444547,0.00004414412,0.00015985174,0.00012702255,0.000009393207,0.05476415,0.00880102,0.93594605],"study_design_scores_gemma":[0.00015098123,0.000072892806,0.0000086250875,0.00031246748,0.000009569368,0.00003720391,1.8866459e-7,0.46749613,0.000042079886,0.520001,0.0114659,0.00040296893],"about_ca_topic_score_codex":0.000043604432,"about_ca_topic_score_gemma":0.000041846044,"teacher_disagreement_score":0.93554306,"about_ca_system_score_codex":0.00025022708,"about_ca_system_score_gemma":0.0012365668,"threshold_uncertainty_score":0.9996873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000056723425,0.000110062145,0.99149984,0.0003780575,0.0018758293,0.00017133067,0.0000630181,0.00027318904,0.0056230207],"genre_scores_gemma":[0.2873579,0.000061396444,0.6976957,0.0033315774,0.003769359,0.00005580968,0.0003166331,0.00018456901,0.007227084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644756,0.00004185334,0.0005904252,0.0013082627,0.000994118,0.00061779586],"domain_scores_gemma":[0.99741477,0.00041801442,0.00035499118,0.0011267045,0.00041638425,0.0002691572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021194264,0.00043109912,0.00059386564,0.00061200204,0.00028985008,0.0008107697,0.002866036,0.00026914716,0.000006623827],"category_scores_gemma":[0.000220588,0.00039003853,0.00013500686,0.00055605173,0.0003225765,0.0006301093,0.0008832023,0.0003838175,0.000028999775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000778873,0.000019697574,0.000008094112,0.00015112926,0.000019380905,0.00004125171,0.0021286295,0.018168122,0.0000288074,0.35233423,0.00045567047,0.6266372],"study_design_scores_gemma":[0.00042380719,0.0001420634,0.0000023420214,0.000628563,0.00001297715,0.000055879693,0.0000028792267,0.95623255,0.00008808848,0.023838552,0.01802287,0.000549448],"about_ca_topic_score_codex":0.000015409205,"about_ca_topic_score_gemma":0.00005206702,"teacher_disagreement_score":0.9380644,"about_ca_system_score_codex":0.00047228846,"about_ca_system_score_gemma":0.00084466644,"threshold_uncertainty_score":0.99985516},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011301911,0.00036416322,0.9828592,0.0023337395,0.0017595862,0.0006084553,0.000007812472,0.00009392666,0.01084292],"genre_scores_gemma":[0.8602071,0.000054577886,0.13251294,0.006028192,0.0008210774,0.000047121524,0.000021474923,0.00004946892,0.00025807886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99571544,0.00008665195,0.00057947496,0.0013560405,0.0015287654,0.0007336269],"domain_scores_gemma":[0.99711126,0.0005367029,0.00023609743,0.001738383,0.0002243766,0.00015317739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019375241,0.0004975404,0.00044828732,0.0010494879,0.00030830962,0.0008421449,0.0044118734,0.0002262338,0.000029082927],"category_scores_gemma":[0.000070038346,0.00038639418,0.00014966342,0.0012189545,0.0004935733,0.00051408587,0.0007245714,0.0008070097,0.00004471667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013499883,0.00018566517,0.00009330341,0.000041075076,0.000017886121,0.0002307998,0.011772881,0.010751225,0.000044900036,0.56805307,0.00091832015,0.4078774],"study_design_scores_gemma":[0.0010609482,0.0007888301,0.00039512824,0.0005038413,0.000015742673,0.00015791912,0.000007903383,0.14647765,0.00021746536,0.82217115,0.026763402,0.0014400315],"about_ca_topic_score_codex":0.000077205026,"about_ca_topic_score_gemma":0.0006176342,"teacher_disagreement_score":0.85907686,"about_ca_system_score_codex":0.00029741524,"about_ca_system_score_gemma":0.00054725027,"threshold_uncertainty_score":0.9998588},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005978483,0.000112553294,0.9913767,0.000116937495,0.0013549734,0.00041144362,0.0000011527878,0.00014525562,0.0005024896],"genre_scores_gemma":[0.9617636,0.0000067466567,0.035800222,0.00045752796,0.0004980947,0.000009740885,0.0000025920986,0.00004839723,0.0014130484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960227,0.00017928709,0.00067147805,0.0014567216,0.0011294786,0.0005403199],"domain_scores_gemma":[0.99684983,0.0005193883,0.0004933911,0.0016426117,0.00032895946,0.00016581947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020355314,0.00048090986,0.00066673086,0.00082986,0.00022095758,0.00037931014,0.0032961152,0.0001948202,0.000010956634],"category_scores_gemma":[0.00008437858,0.00043072976,0.00009592583,0.00041776773,0.00030926568,0.00054196495,0.00077268743,0.0007686915,0.00003134167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011474211,0.00022770184,0.00067832536,0.000091451446,0.000040234652,0.00011396094,0.043258436,0.39810356,0.000632876,0.08994764,0.000026856662,0.46686748],"study_design_scores_gemma":[0.0010931294,0.0069402256,0.00038584156,0.001456329,0.000023229592,0.000052281302,0.000097001415,0.92295873,0.0029996615,0.045985863,0.015565056,0.0024426735],"about_ca_topic_score_codex":0.000069566646,"about_ca_topic_score_gemma":0.00016413168,"teacher_disagreement_score":0.95578516,"about_ca_system_score_codex":0.00015580597,"about_ca_system_score_gemma":0.00026238218,"threshold_uncertainty_score":0.99981445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018822415,0.0004668747,0.8997003,0.0006603131,0.0015534037,0.00037094625,0.000013344715,0.00028652,0.096929476],"genre_scores_gemma":[0.08986682,0.00021782515,0.88585967,0.003823242,0.003130089,0.000058920898,0.00015238632,0.00012512562,0.016765932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99562347,0.00006423158,0.0005219827,0.0016365931,0.0013584385,0.0007952996],"domain_scores_gemma":[0.996817,0.00048248528,0.0003280008,0.0014779693,0.0005285426,0.00036603084],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012405822,0.00062985957,0.0006659034,0.00060240296,0.00031133468,0.0005273883,0.003985893,0.0003964162,0.00017108377],"category_scores_gemma":[0.00010969025,0.00052921637,0.00017402384,0.0004766559,0.0009535184,0.00053094444,0.0018516368,0.0007006974,0.00086980686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010976678,0.00014006913,0.00005784518,0.000040832067,0.00003726742,0.00039021665,0.0010905025,0.011408636,0.0002005235,0.8063112,0.0035887528,0.17672317],"study_design_scores_gemma":[0.00042674827,0.0003355495,0.00012467537,0.00015524888,0.000010693836,0.00015943947,1.1273429e-7,0.18179172,0.00021179019,0.80466974,0.011292412,0.00082188094],"about_ca_topic_score_codex":0.000022703154,"about_ca_topic_score_gemma":0.000026956708,"teacher_disagreement_score":0.1759013,"about_ca_system_score_codex":0.00068543095,"about_ca_system_score_gemma":0.0011015581,"threshold_uncertainty_score":0.99990815},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013644378,0.00028347512,0.9896442,0.00015156483,0.0023717685,0.0002907541,0.000004490502,0.00013090234,0.006986361],"genre_scores_gemma":[0.06423101,0.000049733528,0.9348744,0.00009930942,0.000393173,0.0000067361566,7.013152e-7,0.000023549937,0.00032137695],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966449,0.000039938248,0.000640004,0.0011313653,0.0009789905,0.00056475814],"domain_scores_gemma":[0.9968475,0.00040191022,0.00052041165,0.0017831172,0.00032421455,0.00012284586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012063838,0.00042562606,0.00051228,0.0007564254,0.0001422685,0.00017336637,0.00398927,0.0003168178,0.000015171011],"category_scores_gemma":[0.00017980147,0.0003344557,0.0001364746,0.000490888,0.0006349979,0.0009122211,0.0012595705,0.0004580331,0.0000465975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004133278,0.000017922941,0.00017787256,0.000040458595,0.000007750952,0.000011159846,0.00026333323,0.0017297909,0.0009962284,0.16367345,0.0000020403477,0.8330759],"study_design_scores_gemma":[0.0004384822,0.00047064174,0.0011727032,0.0014366192,0.000013958785,0.00006664238,2.3560737e-7,0.1589928,0.075775765,0.7596497,0.0008555858,0.0011268858],"about_ca_topic_score_codex":0.0000060498082,"about_ca_topic_score_gemma":0.0000019346426,"teacher_disagreement_score":0.831949,"about_ca_system_score_codex":0.0002890128,"about_ca_system_score_gemma":0.00031817972,"threshold_uncertainty_score":0.9999108},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015195667,0.0024092125,0.98338896,0.0009270208,0.0023716476,0.0004470208,0.0000055575156,0.00020412156,0.010231238],"genre_scores_gemma":[0.0999923,0.000027108852,0.89758617,0.0015170957,0.00045016996,0.0000049939,0.000005049679,0.00005360448,0.00036351132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99410725,0.00012975563,0.000866645,0.0022561338,0.0014620794,0.0011781354],"domain_scores_gemma":[0.99669904,0.00041337032,0.00034179576,0.0017774394,0.00040910614,0.00035926636],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028051208,0.00084635953,0.0010425055,0.0012169669,0.00035182177,0.001399233,0.0043991264,0.000727967,0.000009041912],"category_scores_gemma":[0.00008958599,0.0007721333,0.00017593589,0.0010290305,0.0018285569,0.0011606053,0.002322424,0.001849556,0.000022601891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064132437,0.000022835244,0.0000055794135,0.000031017003,0.000006188257,0.00017635598,0.0019837918,0.07362176,0.000009220382,0.24272214,0.000088584835,0.68132615],"study_design_scores_gemma":[0.00022207484,0.000063776475,0.0000051138063,0.00027461967,0.0000033545382,0.00006998614,1.9626825e-7,0.5077969,0.00006965334,0.4893831,0.001628909,0.00048231098],"about_ca_topic_score_codex":0.00009499367,"about_ca_topic_score_gemma":0.00025443634,"teacher_disagreement_score":0.68084383,"about_ca_system_score_codex":0.0007086579,"about_ca_system_score_gemma":0.0022217906,"threshold_uncertainty_score":0.9996374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006947478,0.00017435773,0.98652136,0.0013302673,0.0009138915,0.00066132186,0.0000061431674,0.0001676593,0.0102180755],"genre_scores_gemma":[0.0634252,0.00043159528,0.9325056,0.002052107,0.0004662269,0.000037936694,0.00001636827,0.000078540026,0.0009864391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959873,0.0000662709,0.000637259,0.0015217762,0.001024561,0.000762848],"domain_scores_gemma":[0.997783,0.0002386753,0.00027965644,0.0011737478,0.00032140018,0.00020351038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009657171,0.0004992917,0.00048123684,0.0013257191,0.00016395091,0.0005578465,0.002952935,0.00044496462,0.00011685725],"category_scores_gemma":[0.00011140746,0.00040633496,0.00008807872,0.0009829177,0.00051443157,0.0011639481,0.0012773246,0.0008755772,0.000035854988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018586447,0.000016549273,0.00011447658,0.000033136155,0.0000032705607,0.000018823144,0.0007377223,0.83997464,0.000013105405,0.020734686,0.000020117115,0.1383316],"study_design_scores_gemma":[0.0003586365,0.00007462787,0.000046896665,0.0004090533,0.0000013262153,0.000021201231,6.73167e-8,0.7789652,0.000057027464,0.21872202,0.0008843899,0.00045955658],"about_ca_topic_score_codex":0.0000095500745,"about_ca_topic_score_gemma":0.00007292635,"teacher_disagreement_score":0.19798733,"about_ca_system_score_codex":0.00047416645,"about_ca_system_score_gemma":0.0007082731,"threshold_uncertainty_score":0.9998388},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014517725,0.0006297235,0.99486643,0.0003101963,0.0006660773,0.00024258511,0.000019670635,0.00013255973,0.0016809638],"genre_scores_gemma":[0.727823,0.000049491795,0.2710707,0.0007227171,0.00016775685,0.0000039968904,0.0000060169145,0.000041275216,0.000115053284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968781,0.0000494853,0.0005443801,0.001135498,0.0008522967,0.0005402491],"domain_scores_gemma":[0.9977743,0.0002586465,0.00040776122,0.0011629114,0.00019269287,0.00020367598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013724057,0.0004591509,0.000650612,0.0004893222,0.00013539863,0.00036073677,0.0024098272,0.00016535397,0.000016142465],"category_scores_gemma":[0.000030272706,0.00040094924,0.00008096833,0.0003049402,0.0012809766,0.0005709242,0.0021850106,0.0005401801,0.000008946541],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005093413,0.000029429764,0.0000977963,0.00012660504,0.000014834695,0.00005588273,0.002321,0.0060756756,0.00017831624,0.06401879,0.000012178528,0.9270644],"study_design_scores_gemma":[0.00018730361,0.00008463699,0.0001947682,0.00025901163,0.0000038108442,0.00005672253,3.3684043e-7,0.36987728,0.00045891778,0.6284649,0.00006927765,0.00034308128],"about_ca_topic_score_codex":0.00009875585,"about_ca_topic_score_gemma":0.00005102149,"teacher_disagreement_score":0.92672133,"about_ca_system_score_codex":0.00011553654,"about_ca_system_score_gemma":0.00026731179,"threshold_uncertainty_score":0.99984425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003699852,0.00017910646,0.99090594,0.0012517007,0.0009430388,0.0003315874,0.000016297408,0.00016719708,0.0058351173],"genre_scores_gemma":[0.2073586,0.000013478027,0.78880805,0.0013153695,0.00078193896,0.000011271523,0.000018352248,0.00003553556,0.0016573784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609834,0.000037117523,0.00042952338,0.001537738,0.0012867451,0.0006105076],"domain_scores_gemma":[0.9977805,0.00036506675,0.0002721623,0.0009859169,0.00037934302,0.00021703022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006151236,0.0005227139,0.00045100925,0.000697349,0.00033245955,0.00047541494,0.0022625441,0.00021374295,0.000048599515],"category_scores_gemma":[0.000036637804,0.00038716238,0.00010541649,0.00061584817,0.0008393641,0.00077639456,0.00093270454,0.000517686,0.00010147251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021402755,0.000035327055,0.000055166096,0.000021200336,0.000020691572,0.000093132214,0.0003527277,0.19810265,0.000096610835,0.24919938,0.000029318118,0.5519724],"study_design_scores_gemma":[0.00092133175,0.00062532775,0.0008429814,0.00053000427,0.000015395417,0.00040073425,2.1290504e-7,0.7801403,0.0012264078,0.20687021,0.006868959,0.0015581829],"about_ca_topic_score_codex":0.0000040005316,"about_ca_topic_score_gemma":0.00005313856,"teacher_disagreement_score":0.58203757,"about_ca_system_score_codex":0.00023875381,"about_ca_system_score_gemma":0.00089457165,"threshold_uncertainty_score":0.999858},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041701974,0.0003734454,0.9959972,0.00021406122,0.0019012716,0.0007313739,0.0000054810694,0.00012552766,0.0002346586],"genre_scores_gemma":[0.3371461,0.00008597489,0.6621186,0.00018468245,0.0003724388,0.00002420963,0.000014545171,0.00003076682,0.00002266654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743176,0.00009006685,0.0005478589,0.0009280182,0.0005366399,0.0004656492],"domain_scores_gemma":[0.9983891,0.00048952707,0.00025210736,0.00047542626,0.00028893002,0.000104872226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024036933,0.00036300006,0.00045646954,0.0009396356,0.00018018947,0.00049050467,0.0007530523,0.0003014171,0.0000025369563],"category_scores_gemma":[0.00024807116,0.00035782903,0.00007916868,0.00061466516,0.00019302357,0.0012448735,0.00019554609,0.00040528327,0.0000018191494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047013353,0.0000144680125,0.000030701485,0.00009314812,0.0000052901964,0.000009569172,0.0011214323,0.30607265,0.00040713057,0.00077394635,0.000002041483,0.69142264],"study_design_scores_gemma":[0.0009215179,0.00013825775,0.00010518128,0.0002437473,0.0000060316524,0.000037831585,5.3080646e-7,0.96677375,0.002008964,0.029235616,0.0001269153,0.0004016496],"about_ca_topic_score_codex":0.00003403286,"about_ca_topic_score_gemma":0.0002088993,"teacher_disagreement_score":0.69102097,"about_ca_system_score_codex":0.000287102,"about_ca_system_score_gemma":0.0003269654,"threshold_uncertainty_score":0.99988735},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003958889,0.00025976571,0.99166375,0.000024113238,0.0022955015,0.0006449871,0.000090127985,0.0031356507,0.0018464956],"genre_scores_gemma":[0.3131751,0.00026647368,0.6833992,0.00022769907,0.0019946182,0.0001190952,0.0002482857,0.0001635343,0.00040599916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831533,0.0000056230056,0.00031772588,0.0005558391,0.00043532206,0.00037013038],"domain_scores_gemma":[0.9993216,0.00006765869,0.000039606723,0.0003783709,0.00007673402,0.00011604297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038694977,0.00034928304,0.0003006403,0.0005423897,0.00009851649,0.0001393612,0.00052308803,0.00027080346,0.00000954093],"category_scores_gemma":[0.000011155657,0.00035644535,0.00008267792,0.00013824705,0.0001356605,0.00022622001,0.00012142596,0.00041170276,0.00000562143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015550036,0.0000050689073,7.492372e-7,0.000036389058,0.000010316855,0.000007394029,0.000109548026,0.3458509,0.00001743094,0.000052722207,0.0008542884,0.65305364],"study_design_scores_gemma":[0.00018642755,0.00010562714,0.000013541406,0.00020569554,0.000015864889,0.000017631111,1.3497639e-7,0.9881616,0.00014368212,0.0010128546,0.009825898,0.0003109993],"about_ca_topic_score_codex":0.0000010441315,"about_ca_topic_score_gemma":0.000019277813,"teacher_disagreement_score":0.6527426,"about_ca_system_score_codex":0.00031804,"about_ca_system_score_gemma":0.00006144212,"threshold_uncertainty_score":0.9998888},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000108024244,0.000086719716,0.99325025,0.0008958224,0.0005754011,0.0013491182,0.00001627098,0.00014639497,0.0035720218],"genre_scores_gemma":[0.114528485,0.00003855088,0.8719038,0.002989702,0.002437132,0.00022349242,0.0013049331,0.00012519724,0.0064487127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750584,0.000008019027,0.00041711735,0.00089385454,0.0007884756,0.00038666266],"domain_scores_gemma":[0.99800086,0.000039116334,0.0002254183,0.00050850003,0.0011933486,0.000032773678],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010533156,0.00039652642,0.00033639476,0.00064498663,0.00026801025,0.00031316737,0.00064842263,0.00015941904,0.00006281981],"category_scores_gemma":[0.000064145155,0.0003455087,0.00006648481,0.0005733644,0.00036229903,0.0011896547,0.00030217736,0.00026173878,0.000104218176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006439152,0.00007857022,0.00006629008,0.000795662,0.000029619228,0.0000039597453,0.0003616537,0.25939095,0.000006301479,0.012975375,0.00039333387,0.7258339],"study_design_scores_gemma":[0.0005198973,0.00007456163,0.000056414898,0.00019635612,0.000039821214,0.0000013724564,0.00000600329,0.94274354,0.0000185964,0.024540348,0.031322062,0.00048105334],"about_ca_topic_score_codex":0.00046828776,"about_ca_topic_score_gemma":0.00096031744,"teacher_disagreement_score":0.7253528,"about_ca_system_score_codex":0.00030360164,"about_ca_system_score_gemma":0.0002512847,"threshold_uncertainty_score":0.9998997},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028672146,0.0003288585,0.98225677,0.0003715398,0.0052159824,0.00022462511,0.0000031112338,0.00009264771,0.011477776],"genre_scores_gemma":[0.19622202,0.00012477356,0.7974092,0.000703527,0.0018603918,0.0000074434747,0.0000019178613,0.000055476314,0.003615242],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721414,0.000031874617,0.00062122475,0.0010068801,0.0007011916,0.00042467378],"domain_scores_gemma":[0.9978018,0.0002600756,0.0004471786,0.001055458,0.00028007175,0.0001554548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005362626,0.00035898248,0.00051257794,0.0008225449,0.00012048814,0.00021310011,0.0019591718,0.00029044106,0.00005665926],"category_scores_gemma":[0.00003186768,0.00027869953,0.00018089,0.0004934335,0.00049382227,0.0004892922,0.000543065,0.00036969167,0.00003376041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035008788,0.00000408467,0.000028875089,0.000014758091,0.0000088594525,0.000010018154,0.00020695655,0.00090291776,0.00011316153,0.27665994,0.00006263172,0.72198427],"study_design_scores_gemma":[0.0005995411,0.0003691106,0.00004992145,0.0017059444,0.000010181984,0.0005026517,3.0817748e-7,0.10654357,0.00260499,0.8770435,0.009689192,0.0008810807],"about_ca_topic_score_codex":0.000038698967,"about_ca_topic_score_gemma":0.00004052649,"teacher_disagreement_score":0.7211032,"about_ca_system_score_codex":0.00014779544,"about_ca_system_score_gemma":0.00049900473,"threshold_uncertainty_score":0.9999665},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005631601,0.0006389589,0.99325997,0.00020614151,0.0004036739,0.0004340978,0.0000034602674,0.000538509,0.0044588596],"genre_scores_gemma":[0.06203225,0.000012166631,0.93702596,0.0005394437,0.00022195921,0.000010945094,0.0000069923494,0.000038351875,0.000111935486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996221,0.00008812325,0.0005213155,0.00166608,0.0008725297,0.0006309568],"domain_scores_gemma":[0.99752516,0.00039085708,0.00038264907,0.000999186,0.00045750008,0.00024467675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013884886,0.00058902416,0.0006430224,0.0009138235,0.0003459973,0.00061561464,0.001903992,0.00032941884,0.0000032072435],"category_scores_gemma":[0.00019207782,0.00055950443,0.00010179548,0.0006639821,0.0005966137,0.00052163465,0.0012085568,0.00068661076,0.0000030009883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010262234,0.00004442537,0.00003179385,0.00005140644,0.0000143376565,0.000052535772,0.00115076,0.76007533,0.000058064616,0.012033092,0.00006180273,0.22641617],"study_design_scores_gemma":[0.0003284062,0.000093666706,0.000006760802,0.00027068803,0.000007863026,0.00006027971,3.18524e-7,0.9505307,0.00024271235,0.047531232,0.00031345512,0.0006139037],"about_ca_topic_score_codex":0.000044215925,"about_ca_topic_score_gemma":0.000009318873,"teacher_disagreement_score":0.22580226,"about_ca_system_score_codex":0.00031253955,"about_ca_system_score_gemma":0.0006947582,"threshold_uncertainty_score":0.99968565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008073502,0.00044991195,0.9962385,0.0009783569,0.0001526098,0.00057913706,0.000662729,0.00008538738,0.000046002013],"genre_scores_gemma":[0.04049643,0.000053909247,0.9583514,0.000426606,0.00010156928,0.000047979673,0.0004225675,0.000029460785,0.00007008115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965596,0.000014859996,0.00042194338,0.0019284987,0.0006730652,0.00040198924],"domain_scores_gemma":[0.9976721,0.000232425,0.00020451032,0.0014669653,0.00015639196,0.00026761435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007665659,0.0003809045,0.00034888106,0.00040569116,0.00023981972,0.00045594745,0.0022211238,0.000099103025,0.0000025236943],"category_scores_gemma":[0.00005254182,0.00037114436,0.000018224002,0.00038796704,0.00016334679,0.0011469506,0.0017011272,0.0002821389,0.0000048904158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002470275,0.000032162883,0.000041967938,0.00006508477,0.000010956161,0.0000069700022,0.0007983337,0.0028372481,0.00018442591,0.0039473483,0.000022616148,0.9920504],"study_design_scores_gemma":[0.00022007436,0.00008304308,0.000101148325,0.0004122037,0.000016677126,0.00010505882,0.00000326156,0.99341327,0.000027956054,0.0030281818,0.0021408794,0.00044825836],"about_ca_topic_score_codex":0.00007002366,"about_ca_topic_score_gemma":0.00026337392,"teacher_disagreement_score":0.9916022,"about_ca_system_score_codex":0.00010677199,"about_ca_system_score_gemma":0.000290361,"threshold_uncertainty_score":0.99987406},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048228863,0.00021303617,0.99191964,0.0048264237,0.0015403167,0.00089743483,0.000060108407,0.000052520547,0.00044227467],"genre_scores_gemma":[0.0491789,0.0000051598245,0.9479469,0.00242975,0.00030078326,0.000054470493,0.000029141187,0.000018168,0.000036720507],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644077,0.000101760874,0.00064826466,0.0010845814,0.001173459,0.0005511845],"domain_scores_gemma":[0.99576557,0.0016438111,0.00040739265,0.0016547431,0.0003924633,0.0001360303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046643377,0.00033665064,0.0006156128,0.00029224996,0.00020919512,0.00023641974,0.003633352,0.00020897531,0.0000039339116],"category_scores_gemma":[0.0010834708,0.0002356541,0.00009304162,0.00028499067,0.00042591584,0.0003846792,0.001662037,0.00043113498,0.000016345919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009945646,0.000120199984,0.00023177124,0.00025475284,0.00008226064,0.000034487046,0.0036952342,0.021845134,0.0006186827,0.15343553,0.0042108116,0.8153717],"study_design_scores_gemma":[0.0014875416,0.00078538846,0.00090117735,0.00077461184,0.00006943349,0.0002150414,0.000010752815,0.13250554,0.003027841,0.8078625,0.050383594,0.0019765394],"about_ca_topic_score_codex":0.00021880973,"about_ca_topic_score_gemma":0.0011743533,"teacher_disagreement_score":0.81339514,"about_ca_system_score_codex":0.00017048819,"about_ca_system_score_gemma":0.000680016,"threshold_uncertainty_score":0.9609695},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011348969,0.0003316525,0.99713194,0.00008448632,0.00031922932,0.00040710185,0.0001809818,0.00008202191,0.00032768206],"genre_scores_gemma":[0.9351026,0.000020066776,0.063930936,0.00020046122,0.000084925065,0.0000035242006,0.00020050275,0.000026585722,0.0004304351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954934,0.000086760185,0.000803624,0.0019381631,0.0012145013,0.0004635436],"domain_scores_gemma":[0.99499404,0.00024303215,0.0005384987,0.003807878,0.00017825636,0.00023829125],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013691466,0.00050722435,0.0008624325,0.0014381189,0.00019127176,0.00039698603,0.0059311916,0.00019950193,0.00006095701],"category_scores_gemma":[0.00008942142,0.00045774164,0.00010980942,0.0016590918,0.0005353679,0.000770475,0.005263968,0.0004374476,0.000019076415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000317491,0.0024278397,0.0058800913,0.0000998704,0.001758714,0.010416288,0.008212293,0.42832243,0.00004689288,0.007950821,0.00086042035,0.5339926],"study_design_scores_gemma":[0.0005836191,0.0003245742,0.00012075768,0.000040161398,0.00026994228,0.00022176954,0.000010962001,0.99350893,0.00001371836,0.003808716,0.0005531552,0.0005437161],"about_ca_topic_score_codex":0.0003940688,"about_ca_topic_score_gemma":0.00078399864,"teacher_disagreement_score":0.93396765,"about_ca_system_score_codex":0.00018710304,"about_ca_system_score_gemma":0.00029714007,"threshold_uncertainty_score":0.99978745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000572779,0.00008959261,0.99453026,0.0019864694,0.0006544831,0.00038792117,0.000017639088,0.00029109218,0.0014697489],"genre_scores_gemma":[0.9204247,0.0000024864753,0.073539995,0.005122182,0.0005054824,0.000015713362,0.000021050368,0.00004964453,0.0003187691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609125,0.0001161788,0.0004194121,0.0015616141,0.0010534002,0.0007581306],"domain_scores_gemma":[0.996956,0.0012029486,0.0003988895,0.0010155422,0.00021277765,0.00021387884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008906935,0.00063172495,0.0006165457,0.00059694354,0.00049265916,0.00057541486,0.0013765332,0.0003354141,0.000026998086],"category_scores_gemma":[0.00006107386,0.00051373825,0.00009073768,0.00033509528,0.0004764768,0.00029364455,0.0002159586,0.0010617198,0.000025592492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057023903,0.000010267591,0.00057571515,0.00001679465,0.00003736426,0.00005345932,0.001390351,0.9101528,0.00006431114,0.0044476963,0.00009340895,0.08310084],"study_design_scores_gemma":[0.0008697633,0.0008869055,0.001075396,0.0009986847,0.000025181016,0.000059222173,5.723681e-7,0.96717334,0.0002442227,0.026971927,0.0007632616,0.0009315187],"about_ca_topic_score_codex":0.00021679676,"about_ca_topic_score_gemma":0.00017670768,"teacher_disagreement_score":0.9209903,"about_ca_system_score_codex":0.00037618275,"about_ca_system_score_gemma":0.00069545506,"threshold_uncertainty_score":0.9997314},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007783398,0.0014229054,0.99631953,0.000023740104,0.000249048,0.00019946697,0.0000042991883,0.00019598046,0.0015071962],"genre_scores_gemma":[0.095697105,0.000009729515,0.90383375,0.000046100355,0.00018360066,0.0000039760102,0.000008186201,0.000065962515,0.0001515719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998253,0.00000923481,0.00034761798,0.00048669323,0.0005665102,0.00033695388],"domain_scores_gemma":[0.99907404,0.00007694392,0.0001395391,0.00033308018,0.00026199938,0.000114394075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004478382,0.00033480168,0.00037890064,0.00039766092,0.000064192944,0.00012469864,0.0005564372,0.000218888,0.00001537105],"category_scores_gemma":[0.000046676945,0.00028263708,0.00003509934,0.00036586786,0.00031762308,0.00018433765,0.00011560055,0.00048738145,0.0000070232077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030081821,0.000008966178,0.000011675079,0.00009914001,0.000009023628,0.000006272849,0.00070372655,0.8849832,0.00003410487,0.00007043951,0.0000011421233,0.1140693],"study_design_scores_gemma":[0.0003393815,0.00006041551,0.000006254039,0.0009836117,0.000012002591,0.00002204357,8.630352e-7,0.9966925,0.0003705395,0.0010621558,0.00009592696,0.00035435404],"about_ca_topic_score_codex":0.0000043126197,"about_ca_topic_score_gemma":0.00000929627,"teacher_disagreement_score":0.11371495,"about_ca_system_score_codex":0.00011066184,"about_ca_system_score_gemma":0.00027255566,"threshold_uncertainty_score":0.99996257},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047706002,0.00017263967,0.99678886,0.00022636459,0.0009792068,0.0014561991,0.00001210694,0.00022533012,0.00009159793],"genre_scores_gemma":[0.13020848,0.000020094563,0.8689342,0.00035564697,0.00013699092,0.000107558684,0.00001818034,0.000034529494,0.0001842872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961926,0.00008183714,0.0006568881,0.0014773036,0.00094756874,0.00064384064],"domain_scores_gemma":[0.99732214,0.0008789878,0.00032534768,0.0007579578,0.0004778108,0.00023772604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012869765,0.00044753557,0.00052901154,0.0012832455,0.0001439495,0.00037154806,0.0016702857,0.0002987029,0.0000047259646],"category_scores_gemma":[0.00084879453,0.00040296954,0.0000747632,0.0010014895,0.00072932284,0.00064749876,0.0006160253,0.00071349076,0.000010078046],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028386292,0.00005454735,0.00009225971,0.00006754168,0.000004226231,0.00011108982,0.0003570534,0.0027950061,0.00010286669,0.0016366475,0.000025544445,0.9947248],"study_design_scores_gemma":[0.0010701482,0.00060767535,0.00075660844,0.00027842107,0.000009162876,0.00009364281,6.005154e-7,0.8805906,0.0052501047,0.11032354,0.00028112018,0.0007383637],"about_ca_topic_score_codex":0.00006853303,"about_ca_topic_score_gemma":0.00018112236,"teacher_disagreement_score":0.9939865,"about_ca_system_score_codex":0.0009064908,"about_ca_system_score_gemma":0.000490671,"threshold_uncertainty_score":0.9998422},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019608273,0.00046115433,0.9927154,0.0006243758,0.00073797384,0.0004002519,0.000020436426,0.000083972416,0.002995594],"genre_scores_gemma":[0.87589306,0.0000027983015,0.12353443,0.00031736717,0.00013954846,0.0000071983786,0.000004934911,0.000018625358,0.000082053986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968257,0.000041307456,0.0005814516,0.0011563791,0.00099274,0.0004024467],"domain_scores_gemma":[0.9974823,0.00037483333,0.00044222476,0.00092780555,0.00059782603,0.0001750085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010740227,0.00040912075,0.00056816044,0.00053221604,0.0001303524,0.00024109065,0.0011733583,0.0002735545,0.000002443289],"category_scores_gemma":[0.000170279,0.000366757,0.00006970869,0.00051989034,0.0005461221,0.00013282831,0.00023109872,0.00045977012,0.000007457918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044921093,0.00006513454,0.00012553732,0.00023528081,0.000013528522,0.000108223314,0.00080921577,0.77634656,0.00019921733,0.015635734,0.0000485366,0.20636809],"study_design_scores_gemma":[0.00045283747,0.00024318244,0.00005030743,0.00080702495,0.000005770369,0.000052627085,4.179803e-7,0.97138494,0.00083646487,0.02543276,0.00032937474,0.00040430203],"about_ca_topic_score_codex":0.000015566202,"about_ca_topic_score_gemma":0.000022188886,"teacher_disagreement_score":0.87393224,"about_ca_system_score_codex":0.0001326234,"about_ca_system_score_gemma":0.00092681317,"threshold_uncertainty_score":0.99987847},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063467224,0.0016613612,0.99333256,0.00011349829,0.0029275005,0.00042671143,0.0000094545885,0.00015962735,0.0007346342],"genre_scores_gemma":[0.33029693,0.000008010351,0.6685585,0.0006187509,0.00040593115,0.00000414673,0.000007250616,0.0000548381,0.000045664525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99403054,0.00008243893,0.000922186,0.0025210832,0.0014536883,0.0009900784],"domain_scores_gemma":[0.995265,0.00070649426,0.00052818784,0.0029088096,0.00036064794,0.00023086501],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001729123,0.000720973,0.00076151174,0.0014402599,0.00016306176,0.00040635013,0.0074943826,0.0004136379,0.00003444631],"category_scores_gemma":[0.00046253751,0.0007310404,0.000084512016,0.0007123366,0.000906113,0.0015543549,0.0036225005,0.0013285432,0.000020178953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018743534,0.000024155015,0.000102743885,0.000041998097,0.000010997112,0.0002692265,0.002902783,0.7425273,0.0013978826,0.008842007,0.000018513494,0.24384362],"study_design_scores_gemma":[0.00011308701,0.00007204571,0.000028228724,0.00060218084,0.00000678356,0.000029505034,0.000001681791,0.9255974,0.0028848182,0.06924251,0.000667307,0.0007544085],"about_ca_topic_score_codex":0.0005531819,"about_ca_topic_score_gemma":0.0014200194,"teacher_disagreement_score":0.32966226,"about_ca_system_score_codex":0.0026786178,"about_ca_system_score_gemma":0.0029231121,"threshold_uncertainty_score":0.99951404},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057670206,0.0111781405,0.19865705,0.030200677,0.008317464,0.0029267368,0.000048901496,0.00013236333,0.69086844],"genre_scores_gemma":[0.99675244,0.00008595046,0.00074350415,0.0014544021,0.00031264583,0.000004610371,0.000001335957,0.000009692971,0.00063544384],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99657196,0.000072523486,0.00028279691,0.00050977187,0.0021011287,0.00046181478],"domain_scores_gemma":[0.99852353,0.000793222,0.00016465916,0.0002966272,0.00007044084,0.00015150587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001960808,0.00023405974,0.0003633965,0.00007109853,0.0002798927,0.0002881863,0.0011673162,0.00011932374,0.00009973152],"category_scores_gemma":[0.00009510672,0.00017016983,0.000031692696,0.0002487919,0.0018689688,0.00018273001,0.0005697354,0.00045423262,0.00000490166],"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.00019171124,0.000044537304,0.2645401,0.00010758287,0.00006265229,0.00016250403,0.03404207,0.036236383,0.000005239909,0.27322915,0.0012217013,0.39015636],"study_design_scores_gemma":[0.0066557564,0.00020985762,0.02777158,0.0018816399,0.00008893796,0.000032730022,0.0010956171,0.3711735,0.00013090634,0.3999833,0.1872469,0.003729298],"about_ca_topic_score_codex":0.85562956,"about_ca_topic_score_gemma":0.9963637,"teacher_disagreement_score":0.9390822,"about_ca_system_score_codex":0.0023462076,"about_ca_system_score_gemma":0.0023889837,"threshold_uncertainty_score":0.6939324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007435939,0.00044049905,0.99030447,0.00016575366,0.00095191726,0.00022256479,0.0000069577263,0.000015459902,0.00714876],"genre_scores_gemma":[0.5577549,0.0004246074,0.41423312,0.004094759,0.008762698,0.00005077067,0.00006411353,0.00016134762,0.014453741],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984371,0.00002352819,0.00023077724,0.0007535304,0.0002747785,0.00028027597],"domain_scores_gemma":[0.99913085,0.000032615404,0.00010689481,0.00053123006,0.00013100148,0.00006742977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039948878,0.0002624713,0.00018981296,0.00011050668,0.00014683162,0.00010655149,0.00053310825,0.00031608378,0.00007673717],"category_scores_gemma":[0.00009417876,0.00020372518,0.00007158118,0.000037875987,0.00018908973,0.000008542081,0.00026536343,0.0001328378,0.00008453138],"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.00000839103,0.0000042798392,0.000006052016,0.00000862149,0.0000060531374,0.000004979948,0.00001846607,0.0017587463,0.6390176,0.00097386946,0.000024002045,0.35816893],"study_design_scores_gemma":[0.00026205592,0.00037830923,0.0000055951423,0.00028053374,0.000007850863,0.000037620117,5.268967e-8,0.009235341,0.9585023,0.015352536,0.015225798,0.0007120029],"about_ca_topic_score_codex":0.0000020131602,"about_ca_topic_score_gemma":0.000015781741,"teacher_disagreement_score":0.5760714,"about_ca_system_score_codex":0.00003940641,"about_ca_system_score_gemma":0.00021149647,"threshold_uncertainty_score":0.8307672},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005356853,0.00003450541,0.9920335,0.0009020323,0.00043786975,0.00061495055,0.00007321032,0.00002582013,0.0053424714],"genre_scores_gemma":[0.8612329,0.000002943004,0.13032654,0.00023166602,0.0015615148,0.0002170161,0.00013320563,0.000044315362,0.0062499093],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998445,0.000005126522,0.00024097263,0.000680243,0.00033227552,0.00029638223],"domain_scores_gemma":[0.9987605,0.00016380093,0.00018578194,0.00051897456,0.00026911078,0.00010183819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046215442,0.00020676864,0.00020673231,0.00017007164,0.00022363529,0.0002639972,0.00080804067,0.00006975815,0.000050364462],"category_scores_gemma":[0.000016963097,0.00018755285,0.00008250572,0.00023892455,0.0004443001,0.00024438076,0.00018741627,0.00019080742,0.000076477925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012826115,0.00009093258,0.00021017424,0.000028658285,0.000016492411,0.0000020768068,0.0007394707,0.012255142,0.005233812,0.44379866,0.0015692444,0.5360425],"study_design_scores_gemma":[0.0003278374,0.00009586973,0.00017288262,0.000085101725,0.000026564281,0.0000024826627,0.0000017908409,0.21151777,0.0044553,0.7456202,0.037099965,0.00059423776],"about_ca_topic_score_codex":0.000024674498,"about_ca_topic_score_gemma":0.000026614614,"teacher_disagreement_score":0.8617069,"about_ca_system_score_codex":0.00009986348,"about_ca_system_score_gemma":0.00034763516,"threshold_uncertainty_score":0.7648184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000068269705,0.00023318238,0.98684365,0.002977585,0.0015895213,0.0005582929,0.00076386944,0.000052568306,0.0069744964],"genre_scores_gemma":[0.033092454,0.00001926463,0.95402193,0.0038779073,0.0011350516,0.000011447201,0.00046037533,0.000044999848,0.0073365797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99255776,0.00014696099,0.0012721804,0.0021540166,0.0033592156,0.0005098822],"domain_scores_gemma":[0.9832718,0.0096479375,0.0007181931,0.005361851,0.0007691455,0.00023108546],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.022581391,0.0003726396,0.00068165176,0.00096373487,0.000302762,0.0010756181,0.008158239,0.00039701018,0.00013107057],"category_scores_gemma":[0.02060323,0.00029613732,0.00012592087,0.0010699712,0.00093632215,0.00092492515,0.0038404986,0.00077117747,0.00033834836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022213118,0.00003122941,0.00022458646,0.000027904784,0.000015434716,0.0000069457597,0.0003062024,0.00986827,3.528709e-7,0.58642226,0.00987797,0.39319664],"study_design_scores_gemma":[0.00012249305,0.00003566964,0.00024555638,0.000073446136,0.000018082961,0.0000019392144,0.0000017844997,0.047298923,0.0000016531746,0.738375,0.2135164,0.0003090566],"about_ca_topic_score_codex":0.000024281519,"about_ca_topic_score_gemma":0.000523165,"teacher_disagreement_score":0.3928876,"about_ca_system_score_codex":0.00021840369,"about_ca_system_score_gemma":0.0007757735,"threshold_uncertainty_score":0.9999614},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031887457,0.00088304374,0.9616702,0.00019994607,0.0023149285,0.0007463974,0.0000052715063,0.000022481725,0.0022702299],"genre_scores_gemma":[0.97898436,0.000009198165,0.02069611,0.00006380455,0.00010908878,0.0000051865295,0.0000017112641,0.000013424661,0.00011713756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961467,0.00028779168,0.0006916814,0.00067234697,0.0019321293,0.00026938587],"domain_scores_gemma":[0.99563384,0.0013763792,0.00090459303,0.0014502595,0.0005774042,0.000057515477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005299942,0.00028365725,0.00058853894,0.00032907157,0.000118689,0.00006953474,0.003383058,0.00012779332,0.000013590971],"category_scores_gemma":[0.00027308663,0.0001642191,0.00026437404,0.00079478056,0.000870714,0.00018367826,0.0016692287,0.00031593375,0.0000025999288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011413847,0.00025596912,0.012800774,0.00062837667,0.000499704,0.000008382433,0.0072787623,0.5899777,0.018715717,0.053178143,0.00006239132,0.31647995],"study_design_scores_gemma":[0.0008921984,0.0010186661,0.007176831,0.00331495,0.00014801901,0.000018514278,0.0000028614345,0.78539497,0.116987966,0.08431433,0.0001669345,0.00056373805],"about_ca_topic_score_codex":0.000043087955,"about_ca_topic_score_gemma":0.0000062282875,"teacher_disagreement_score":0.9470969,"about_ca_system_score_codex":0.00010526927,"about_ca_system_score_gemma":0.00062830176,"threshold_uncertainty_score":0.66966605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025947206,0.00016971213,0.99220806,0.00019760607,0.00045046263,0.00029804299,0.000023033133,0.00011953727,0.0062740836],"genre_scores_gemma":[0.5990473,0.0000075841267,0.38185468,0.00063092227,0.016371278,0.000021486463,0.00028689034,0.00012408708,0.0016557474],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745655,0.00003096578,0.0004567988,0.000861028,0.00059147703,0.0006031695],"domain_scores_gemma":[0.998585,0.00013887737,0.00032548647,0.00054167403,0.00029683177,0.00011216673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005951069,0.00044913162,0.0005918648,0.0002457108,0.00026188677,0.00022685323,0.0011100173,0.00016378277,0.00014157538],"category_scores_gemma":[0.000007685115,0.00041579682,0.00019419848,0.00046495977,0.0003877292,0.00017137693,0.00077282055,0.0008382301,0.000019962396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017110497,0.000077274155,0.0017150439,0.000018338467,0.00010338375,0.000018075003,0.00028823974,0.18691286,0.000030617553,0.07908366,0.0022009865,0.7295344],"study_design_scores_gemma":[0.00025035677,0.000068335576,0.00011508786,0.00022889026,0.000060036782,0.0000025220502,4.902177e-7,0.2544508,0.00014645208,0.724339,0.019411372,0.00092663086],"about_ca_topic_score_codex":0.00003685485,"about_ca_topic_score_gemma":0.000061380604,"teacher_disagreement_score":0.7286078,"about_ca_system_score_codex":0.00015845451,"about_ca_system_score_gemma":0.00037806222,"threshold_uncertainty_score":0.9998294},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027303087,0.0006985434,0.9938556,0.00034782378,0.0021996698,0.00027356265,0.000007639027,0.00021367826,0.002376196],"genre_scores_gemma":[0.011536276,0.000035969453,0.985484,0.0008269441,0.00092528353,0.000008900489,0.000018527586,0.000038714308,0.0011254065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960748,0.000035316498,0.0004138111,0.0014979383,0.0014127138,0.00056543207],"domain_scores_gemma":[0.9977552,0.00022542287,0.00023000021,0.0010732847,0.00045675697,0.00025933541],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092585006,0.0004682368,0.00043455785,0.0006655047,0.0002711295,0.0003163138,0.0022446634,0.00032409758,0.00004873569],"category_scores_gemma":[0.00007293012,0.00039991876,0.000097477496,0.00053047057,0.00034255796,0.00095093716,0.0018808153,0.00076333,0.00015567453],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010822502,0.000045235294,0.00004656247,0.000017705985,0.000009299868,0.00008555012,0.0002797013,0.024898913,0.00019207693,0.026854793,0.00080179056,0.94675756],"study_design_scores_gemma":[0.00038811984,0.00015647316,0.00010518245,0.00022814657,0.0000051276447,0.00011444137,4.1569074e-8,0.89159584,0.00037118053,0.08690995,0.01952476,0.0006007546],"about_ca_topic_score_codex":0.000040976567,"about_ca_topic_score_gemma":0.00003481809,"teacher_disagreement_score":0.9461568,"about_ca_system_score_codex":0.00036897557,"about_ca_system_score_gemma":0.0007438547,"threshold_uncertainty_score":0.99984527},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005447381,0.00027890544,0.9847227,0.0028057524,0.0020588844,0.0007929836,0.000012920846,0.00011890936,0.0037616093],"genre_scores_gemma":[0.69452155,0.000038297127,0.2982548,0.0059497426,0.0009409038,0.000050187464,0.000038721642,0.00006619396,0.00013960384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99520916,0.00014627271,0.0008177989,0.00159598,0.0013254223,0.0009053408],"domain_scores_gemma":[0.9964412,0.0009599847,0.00043041998,0.0017275499,0.00028440388,0.00015647085],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0026352075,0.000608065,0.00052211934,0.0011193061,0.0004049312,0.001318678,0.0040663825,0.0002940087,0.000017382816],"category_scores_gemma":[0.00020017814,0.00047618293,0.00018769127,0.0013413783,0.0004612391,0.0007750382,0.00093685323,0.0012185556,0.00002159974],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040649407,0.0002478799,0.00006708442,0.0000551617,0.000028817685,0.00016434936,0.0136697395,0.014460523,0.0006965658,0.043195453,0.00067190354,0.9267019],"study_design_scores_gemma":[0.0021333273,0.0023908976,0.00082676456,0.00103673,0.000033681546,0.0003171691,0.000022999679,0.50688446,0.0010154209,0.4650941,0.01743755,0.0028068854],"about_ca_topic_score_codex":0.0001053638,"about_ca_topic_score_gemma":0.0006187476,"teacher_disagreement_score":0.923895,"about_ca_system_score_codex":0.0005370775,"about_ca_system_score_gemma":0.00061196875,"threshold_uncertainty_score":0.999769},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047450204,0.00019936502,0.99554586,0.00034896057,0.0010815862,0.000258954,0.000019879284,0.000045683806,0.0020251938],"genre_scores_gemma":[0.88416344,0.00001776053,0.11475172,0.0006391114,0.000167279,0.000008924693,0.000016490374,0.000017718688,0.00021757041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725705,0.000043412034,0.00047227246,0.0008107844,0.0010843285,0.000332175],"domain_scores_gemma":[0.997494,0.00016896575,0.0003619437,0.0015104696,0.00037636104,0.00008827759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091644307,0.00027246427,0.00042629903,0.0012099002,0.0001964443,0.0002464552,0.0025674207,0.00014014741,0.000049386865],"category_scores_gemma":[0.0000411204,0.00020049427,0.00028784946,0.0027171744,0.0005773089,0.0003651041,0.0011325724,0.00040998214,0.000004087792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012544407,0.00009764758,0.0024008125,0.000044426855,0.0004291607,0.000012522667,0.002541144,0.06571933,0.0002722038,0.25498846,0.0002559051,0.6732258],"study_design_scores_gemma":[0.0003643021,0.0002146573,0.010034526,0.00011104142,0.00036152688,0.000011298992,8.792173e-7,0.6721755,0.00033160055,0.31123725,0.00457679,0.0005805861],"about_ca_topic_score_codex":0.00006332154,"about_ca_topic_score_gemma":0.0005252933,"teacher_disagreement_score":0.8836889,"about_ca_system_score_codex":0.00012957108,"about_ca_system_score_gemma":0.00040267847,"threshold_uncertainty_score":0.8175919},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014895027,0.0007988906,0.9910912,0.0019546147,0.00041577563,0.0005190731,0.0000044486587,0.00025902686,0.0034675044],"genre_scores_gemma":[0.57330674,0.00002613703,0.416288,0.009464122,0.0006432262,0.000017457765,0.00001765014,0.000094654904,0.00014203823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954932,0.000044388882,0.00045563697,0.0019024154,0.0013779962,0.0007264056],"domain_scores_gemma":[0.99702233,0.00030918256,0.00024374515,0.0014312871,0.0006272278,0.0003662537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006020845,0.0007460489,0.0005953693,0.0009418438,0.0002902361,0.0006585444,0.0025215945,0.0003519182,0.00001055723],"category_scores_gemma":[0.000019377612,0.0005834717,0.000062783474,0.0010862094,0.00022997332,0.0006892052,0.0015106057,0.001008555,0.000033816028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028439563,0.000012814855,0.000013507239,0.0000646254,0.000014650551,0.000048540747,0.0035271647,0.84795797,0.00002235848,0.0045455573,7.077703e-7,0.14376366],"study_design_scores_gemma":[0.0004060137,0.00024167098,0.000007559516,0.00049023505,0.000016705595,0.00018017729,0.0000012289519,0.82830024,0.000052435487,0.16831142,0.0013673976,0.00062490214],"about_ca_topic_score_codex":0.00022839873,"about_ca_topic_score_gemma":0.0012921939,"teacher_disagreement_score":0.5748032,"about_ca_system_score_codex":0.00014760568,"about_ca_system_score_gemma":0.00070951076,"threshold_uncertainty_score":0.9996617},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025666724,0.00016539759,0.9936464,0.0013723562,0.0030237709,0.00093919586,0.000017345475,0.00076517765,0.00004470476],"genre_scores_gemma":[0.03047826,0.0000023411844,0.9680996,0.00017477055,0.0007276742,0.000096841206,0.000012749112,0.000074918185,0.00033282398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963357,0.000015199802,0.00035403806,0.0014749237,0.0009763234,0.00084383815],"domain_scores_gemma":[0.99589044,0.0016974766,0.000124888,0.0012497515,0.0006435603,0.0003938808],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014725421,0.0005012094,0.0005012338,0.0013435208,0.00013799546,0.001091664,0.0031598387,0.00028764826,0.0000022674392],"category_scores_gemma":[0.0022887294,0.00050354656,0.00011217948,0.0008244188,0.00007731281,0.0006420742,0.0013186339,0.00058866787,0.000023937338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009984928,0.000015314547,0.00007440101,0.0004184598,0.000023358474,0.00004172458,0.0005179055,0.19887806,0.00014184945,0.009849228,0.0005116812,0.789518],"study_design_scores_gemma":[0.0005344929,0.00047078027,0.00008070482,0.0012339691,0.000009542463,0.0001187567,3.876582e-7,0.9466251,0.0018700352,0.005121568,0.04257213,0.0013625369],"about_ca_topic_score_codex":0.000007547441,"about_ca_topic_score_gemma":0.000008684908,"teacher_disagreement_score":0.7881555,"about_ca_system_score_codex":0.0012842707,"about_ca_system_score_gemma":0.0005130737,"threshold_uncertainty_score":0.9999453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000087355584,0.00047559204,0.9968508,0.000117266834,0.00057003,0.0014073282,0.000097641525,0.000019288538,0.00037470512],"genre_scores_gemma":[0.010269832,0.00016602989,0.98610806,0.0007627331,0.0014068661,0.000126647,0.0006574119,0.00007777774,0.0004246476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805146,0.000020860334,0.0003253197,0.0009027386,0.00027201942,0.00042760544],"domain_scores_gemma":[0.99871886,0.000047878053,0.00021203603,0.0007646446,0.00018001217,0.00007658399],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064002554,0.00034533342,0.00023069019,0.00014638917,0.000213586,0.00012878097,0.0010732833,0.00022875152,0.000027147411],"category_scores_gemma":[0.000011444778,0.000270443,0.00011816198,0.00008814982,0.0003237812,0.000019418123,0.0003334517,0.00022944447,0.000003629808],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023178283,0.000033586635,0.00000779846,0.000025542107,0.000039546514,0.000001150508,0.000085352935,0.00096476864,0.007778725,0.00007087206,0.000036495705,0.990933],"study_design_scores_gemma":[0.0021127053,0.004415232,0.00023020242,0.00015617919,0.00013994788,0.00006245195,0.00000383758,0.833672,0.03911793,0.089289814,0.028967453,0.0018322837],"about_ca_topic_score_codex":0.00003269689,"about_ca_topic_score_gemma":0.00007306455,"teacher_disagreement_score":0.9891007,"about_ca_system_score_codex":0.00007577083,"about_ca_system_score_gemma":0.00021868871,"threshold_uncertainty_score":0.9999748},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70805985,0.00082364574,0.2865598,0.0006487993,0.0016376626,0.001273542,0.00017374664,0.000050151568,0.0007728322],"genre_scores_gemma":[0.99005723,0.000014333298,0.009484175,0.000024543364,0.00018536531,0.0000037591785,0.000030780862,0.0000013415761,0.0001984659],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987916,0.000008976898,0.0002832775,0.00043631598,0.00032558027,0.0001542499],"domain_scores_gemma":[0.9992637,0.00014598355,0.00024992658,0.0000999136,0.000209221,0.000031271706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003956626,0.00014689956,0.00027066306,0.00004803151,0.000046909016,0.00002935644,0.0003464589,0.00014212998,0.000005896103],"category_scores_gemma":[0.000057165886,0.00005835551,0.000103505736,0.00016462056,0.00038498142,0.00018187088,0.00009573975,0.00010761715,9.838305e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000765432,0.00007450306,0.00062249694,0.00006653439,0.000007682632,0.0000011632552,0.00021396339,0.0018321195,0.29903245,0.0016155231,0.00003757647,0.6964194],"study_design_scores_gemma":[0.0011638284,0.0119078355,0.06143938,0.0018173723,0.00022946988,0.000070518094,0.000016245996,0.019629821,0.5845952,0.31095904,0.005435685,0.0027355866],"about_ca_topic_score_codex":0.000061835985,"about_ca_topic_score_gemma":0.000060263897,"teacher_disagreement_score":0.69368386,"about_ca_system_score_codex":0.000045692712,"about_ca_system_score_gemma":0.000032712032,"threshold_uncertainty_score":0.23796685},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016601452,0.0005406668,0.9951211,0.00062013615,0.0017407415,0.00050093874,0.0000073146202,0.00029787258,0.0010051895],"genre_scores_gemma":[0.08381505,0.000018672488,0.9150716,0.000514593,0.00015676809,0.000014277794,0.00002030847,0.000047392496,0.0003413331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99477166,0.00014198864,0.00070628466,0.0017109829,0.0018280265,0.0008410675],"domain_scores_gemma":[0.996323,0.0005149729,0.00041024448,0.0018008373,0.00068258925,0.0002683733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036342747,0.00057177513,0.000504361,0.0010623462,0.00033393397,0.00066817924,0.0039546336,0.0004489359,0.000015861657],"category_scores_gemma":[0.00043863175,0.0005769636,0.0001133648,0.00088477414,0.00073531154,0.0010893294,0.0010053514,0.001091327,0.000064583706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014033518,0.000059310965,0.0000097104175,0.000111151916,0.000011667675,0.000027844271,0.0012644451,0.0570437,0.010579609,0.017214872,0.00006770543,0.913596],"study_design_scores_gemma":[0.00026804555,0.00019025801,0.000038464383,0.0003382745,0.000007756089,0.000021053937,3.3241477e-7,0.9509478,0.022862,0.023835048,0.0008517732,0.0006391767],"about_ca_topic_score_codex":0.000027157217,"about_ca_topic_score_gemma":0.00007050759,"teacher_disagreement_score":0.9129568,"about_ca_system_score_codex":0.0012060595,"about_ca_system_score_gemma":0.0010897941,"threshold_uncertainty_score":0.9996682},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026520628,0.0000694932,0.97097063,0.000055742374,0.00018453205,0.00046015356,0.0000011287415,0.000042441705,0.0016952676],"genre_scores_gemma":[0.9411694,0.00001820088,0.058492173,0.0001419437,0.000055100187,0.0000073980564,0.00000747559,0.000016084841,0.00009221648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985942,0.000038686503,0.00028873992,0.00039627717,0.0004635771,0.00021851005],"domain_scores_gemma":[0.9993594,0.00007652313,0.00020179836,0.00028182325,0.000045737295,0.000034704997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010833933,0.00019117446,0.00018123447,0.00017790361,0.00020347697,0.00003860233,0.0005102657,0.000137529,0.000050263614],"category_scores_gemma":[0.000091306225,0.00014000083,0.000038042373,0.00024193234,0.00061962556,0.00023987865,0.0005588005,0.0004239251,0.000009668232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006928541,0.000009512475,0.00176028,0.000013702261,0.000003069365,0.000003680035,0.00039785178,0.9558021,0.00058991194,0.00083754427,0.000001199278,0.04057422],"study_design_scores_gemma":[0.00006446014,0.00012881283,0.00032538755,0.000080694175,0.0000105199915,0.000011895024,3.5857647e-7,0.9498451,0.00071002636,0.04849297,0.00017422673,0.00015556607],"about_ca_topic_score_codex":0.0006417958,"about_ca_topic_score_gemma":0.002488776,"teacher_disagreement_score":0.9146488,"about_ca_system_score_codex":0.00034497154,"about_ca_system_score_gemma":0.00007193366,"threshold_uncertainty_score":0.5709068},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003479106,0.00045070786,0.88125503,0.0006525951,0.0009875762,0.0005685152,0.000009788005,0.00006138113,0.1156665],"genre_scores_gemma":[0.6381629,0.00008230607,0.22553673,0.000763182,0.0021266742,0.000031928277,0.000008540514,0.0003128577,0.1329749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969953,0.00005774157,0.00051849644,0.00051251205,0.0013825359,0.00053347275],"domain_scores_gemma":[0.99600065,0.0020452864,0.0003013468,0.0011207988,0.00038996706,0.00014193612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026995467,0.00030081728,0.00047261006,0.00035467406,0.00017534844,0.00013460846,0.0019632562,0.00014576565,0.00009124239],"category_scores_gemma":[0.00045244122,0.00020291057,0.00012017059,0.0004039786,0.0019036594,0.0001077075,0.0008742285,0.0007254886,0.000051188315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001340398,0.00007834258,0.0002654422,0.00034174466,0.00013210777,0.00016667003,0.0030826975,0.0026055085,0.000077873614,0.5481245,0.0025413418,0.44244975],"study_design_scores_gemma":[0.00019654242,0.00007343787,0.000007418603,0.0003019012,0.00001704008,0.000041185813,0.0000010113134,0.011685678,0.00024005857,0.98159534,0.005568712,0.00027166546],"about_ca_topic_score_codex":0.000025281897,"about_ca_topic_score_gemma":0.00074748317,"teacher_disagreement_score":0.65571827,"about_ca_system_score_codex":0.00027418652,"about_ca_system_score_gemma":0.0006669801,"threshold_uncertainty_score":0.82744527},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017623368,0.00044931652,0.98490596,0.00032844517,0.001270652,0.0002475477,0.000030331174,0.000075053606,0.012675064],"genre_scores_gemma":[0.14060473,0.000021906548,0.85879326,0.00034891308,0.00013885117,0.0000049669834,0.000008226626,0.000018514353,0.000060628543],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668175,0.00003071493,0.0006244548,0.0010643929,0.0011340332,0.0004646293],"domain_scores_gemma":[0.99647427,0.0012121004,0.00026520967,0.0013822766,0.0004311214,0.0002350216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000840754,0.0003696263,0.0005446206,0.00064603426,0.00013713662,0.00025633074,0.003251347,0.00023627361,0.000042747764],"category_scores_gemma":[0.00034835152,0.00029909672,0.00010532383,0.0005491409,0.0009187265,0.00038115782,0.0014379567,0.0005762967,0.00006206358],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004017914,0.000029644098,0.000038951897,0.0000088102415,0.000008485866,0.000045794943,0.0003991943,0.010711453,0.000007679585,0.1712866,0.00014562771,0.81731373],"study_design_scores_gemma":[0.00012821096,0.00018398155,0.00019663476,0.00017749832,0.0000065554573,0.00002953729,9.9577406e-8,0.43739638,0.000022968728,0.5607247,0.00086000597,0.00027346672],"about_ca_topic_score_codex":0.000028002765,"about_ca_topic_score_gemma":0.00015921672,"teacher_disagreement_score":0.81704026,"about_ca_system_score_codex":0.00016935317,"about_ca_system_score_gemma":0.0006930428,"threshold_uncertainty_score":0.9999461},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002938231,0.000455027,0.9953676,0.00092078844,0.00088443764,0.00039860126,0.0000030174706,0.00013695551,0.0015397418],"genre_scores_gemma":[0.60566336,0.000026936075,0.37288275,0.0003325922,0.0011156162,0.00003311456,0.00003832982,0.000099251585,0.01980806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958901,0.00009339717,0.00042053542,0.0015429804,0.0013936961,0.00065931387],"domain_scores_gemma":[0.9978468,0.00023147532,0.00037045858,0.000999818,0.00023866791,0.00031277785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010401881,0.00058050075,0.0005168805,0.00053674035,0.0003554203,0.0005318043,0.0020555723,0.00022103231,0.0000614261],"category_scores_gemma":[0.00006245166,0.000483391,0.000081361926,0.00026017556,0.00048194084,0.00071384467,0.00073574384,0.0012252387,0.00010796733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036348745,0.0001399296,0.0008245911,0.000039178096,0.000031731957,0.00009136,0.002933159,0.74758595,0.0001684483,0.12709308,0.000010537082,0.12104571],"study_design_scores_gemma":[0.00061967457,0.0015252142,0.00034405765,0.00047459712,0.000011436237,0.00014770946,0.0000014031401,0.9429137,0.00028999068,0.019330906,0.033227354,0.0011139679],"about_ca_topic_score_codex":0.00012862122,"about_ca_topic_score_gemma":0.000062586725,"teacher_disagreement_score":0.62248486,"about_ca_system_score_codex":0.0005937855,"about_ca_system_score_gemma":0.00059575227,"threshold_uncertainty_score":0.99976176},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040292045,0.0006504465,0.9955264,0.0006282322,0.0017739035,0.0004631659,0.00005734672,0.00016743394,0.0006928356],"genre_scores_gemma":[0.1326714,0.00014045408,0.8620013,0.0019135417,0.0020257037,0.000030132664,0.0004981444,0.000055083994,0.0006642151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648875,0.000038362738,0.00053019775,0.0015787574,0.0008973689,0.0004665558],"domain_scores_gemma":[0.9962683,0.00037419153,0.00034395757,0.0024420808,0.00040109162,0.00017037838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018909152,0.00036527409,0.00053656753,0.0011448702,0.0002564943,0.0006267141,0.0047339867,0.00031765128,0.000028511333],"category_scores_gemma":[0.000115850584,0.00034560284,0.00014250414,0.0013407413,0.00030892008,0.0011502506,0.0014179324,0.00046708932,0.000026847914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007946136,0.00001697651,0.0000012616347,0.000017588129,0.00004821585,0.000005664784,0.00027827002,0.279099,0.0000054744637,0.009642949,0.00056225527,0.7103144],"study_design_scores_gemma":[0.00019919571,0.00013424884,0.000007032658,0.000052635027,0.00006322968,0.00001369149,8.401352e-8,0.9147545,0.00003772261,0.034616895,0.04974838,0.00037239914],"about_ca_topic_score_codex":0.000011416726,"about_ca_topic_score_gemma":0.0003885483,"teacher_disagreement_score":0.709942,"about_ca_system_score_codex":0.00020136945,"about_ca_system_score_gemma":0.00043558324,"threshold_uncertainty_score":0.9998996},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024467979,0.0008702483,0.9685262,0.0030918382,0.00038015438,0.0012719671,0.00042377814,0.000056513152,0.00091136666],"genre_scores_gemma":[0.98627216,0.00034819279,0.010462295,0.00055680645,0.00021854122,0.0000019376396,0.00008843544,0.000034359986,0.0020172996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647945,0.00023765177,0.0002679723,0.0014461679,0.0012112906,0.0003574623],"domain_scores_gemma":[0.9939148,0.0009851399,0.00017012523,0.004730681,0.000079424884,0.00011982109],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":["scholarly_communication","open_science"],"category_scores_codex":[0.0019386929,0.00030231115,0.00032588188,0.00023561745,0.0005320072,0.0017584969,0.014512908,0.000104213184,0.000008525759],"category_scores_gemma":[0.000049017748,0.00018630104,0.000047107835,0.0005984385,0.0011293229,0.019385746,0.026437731,0.0006343217,0.000005353133],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000229093,0.00091756857,0.096764386,0.0016039348,0.0012593322,0.016774163,0.04345727,0.0146554485,0.000048883783,0.027155919,0.0031672707,0.7939667],"study_design_scores_gemma":[0.009233124,0.0034917602,0.04922892,0.0033816386,0.0014280869,0.0025180664,0.0009054375,0.461589,0.00057687704,0.07234752,0.38819623,0.0071033235],"about_ca_topic_score_codex":0.0008861873,"about_ca_topic_score_gemma":0.0061093876,"teacher_disagreement_score":0.96180415,"about_ca_system_score_codex":0.00007354343,"about_ca_system_score_gemma":0.0004220815,"threshold_uncertainty_score":0.9992778},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018564422,0.00025547703,0.99443996,0.00045563924,0.0020981517,0.0006335616,0.000004341884,0.0004510149,0.0014762026],"genre_scores_gemma":[0.19037865,0.000021264475,0.80689484,0.001228331,0.0011629775,0.000016490427,0.0000041806984,0.000077359306,0.00021589755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940463,0.00006405987,0.00084689475,0.0025016225,0.0012589145,0.001282216],"domain_scores_gemma":[0.9963794,0.0004049269,0.00043087042,0.0019567925,0.00046316886,0.0003648869],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010588424,0.0008730989,0.00079588266,0.0007573038,0.0004258515,0.0012301317,0.00440825,0.0005093863,0.00001868075],"category_scores_gemma":[0.000060032184,0.00070236577,0.00021711591,0.0006729868,0.0010442494,0.00091041025,0.0021638002,0.000969142,0.00009136824],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036411661,0.000036161946,0.000032228647,0.000065975015,0.000014031188,0.00008328294,0.00030029836,0.01887169,0.00013026297,0.07591987,0.000005776776,0.9045368],"study_design_scores_gemma":[0.00019023936,0.00016668001,0.000011998373,0.0010520859,0.0000101974765,0.00013003616,4.1973596e-8,0.68155235,0.00013717823,0.31570616,0.00026267514,0.0007803792],"about_ca_topic_score_codex":0.000018303435,"about_ca_topic_score_gemma":0.000022094862,"teacher_disagreement_score":0.9037564,"about_ca_system_score_codex":0.00053749495,"about_ca_system_score_gemma":0.0010186473,"threshold_uncertainty_score":0.9998067},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030206903,0.0011944734,0.99299026,0.00005831071,0.00022155048,0.0002354775,0.000024008463,0.00030651447,0.0019487303],"genre_scores_gemma":[0.80558497,0.00040613842,0.19331099,0.00024618526,0.00022995219,0.0000070252513,0.000023442964,0.00008803383,0.00010329588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785066,0.0000112721245,0.0006199542,0.0005910453,0.0005334642,0.0003935821],"domain_scores_gemma":[0.9984392,0.0002799225,0.00021454936,0.0005793636,0.00030954543,0.0001774355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031365303,0.0004985607,0.00083749206,0.00070836267,0.000046457302,0.000070318965,0.0006703077,0.00026259522,0.000014604874],"category_scores_gemma":[0.00009762728,0.0004325533,0.000094531955,0.00058366614,0.00067698053,0.00027242702,0.00027270446,0.0005553937,0.0000059309787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033237262,0.00003937525,0.00033977945,0.00032109706,0.00008697542,0.00007836415,0.00058649154,0.38508233,0.00765905,0.0008809799,0.00022323229,0.6046691],"study_design_scores_gemma":[0.0004909547,0.00034157705,0.000846298,0.0008105732,0.000080937265,0.00004383674,0.0000015611695,0.8695918,0.008620428,0.11008227,0.00765243,0.0014373828],"about_ca_topic_score_codex":0.000024685203,"about_ca_topic_score_gemma":0.000034167428,"teacher_disagreement_score":0.80256426,"about_ca_system_score_codex":0.00012487004,"about_ca_system_score_gemma":0.00011459543,"threshold_uncertainty_score":0.9998126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020152899,0.00007868102,0.9788575,0.00024439782,0.0002760673,0.00021348963,4.508295e-7,0.00015071857,0.000025752985],"genre_scores_gemma":[0.5188387,0.0000026205034,0.48100132,0.00012057233,0.00002552785,0.0000067019896,8.708997e-7,0.0000031809755,4.879233e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795663,0.00012934454,0.0002613014,0.00053759915,0.00082067755,0.0002944427],"domain_scores_gemma":[0.9985807,0.0003338438,0.00016880434,0.000658809,0.0001535338,0.0001043347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010109862,0.00015056111,0.00024399643,0.00034389514,0.00010183758,0.00014106485,0.0011026433,0.000054105123,0.0000029197672],"category_scores_gemma":[0.0003475814,0.00010352937,0.00004166145,0.0017877774,0.00035617754,0.0007014901,0.00030738494,0.00012940036,0.000003183174],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024860674,0.000030231115,0.0032997334,0.000020584723,0.0000023806206,0.000004972118,0.00027682047,0.022226175,0.0014897157,0.000117887335,0.000021978221,0.97250706],"study_design_scores_gemma":[0.000099413046,0.00015106195,0.0048547266,0.00013997656,0.0000022164973,0.0000067261767,1.652753e-7,0.678255,0.3143291,0.0020425322,0.000010432806,0.00010861136],"about_ca_topic_score_codex":0.000040201925,"about_ca_topic_score_gemma":0.000009835306,"teacher_disagreement_score":0.9723984,"about_ca_system_score_codex":0.00006398228,"about_ca_system_score_gemma":0.00011069208,"threshold_uncertainty_score":0.42218053},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008592401,0.00007642583,0.9966221,0.001232204,0.00024963022,0.0013097815,0.000060021575,0.00017225149,0.00019168807],"genre_scores_gemma":[0.0696489,0.000019743587,0.92808396,0.001712565,0.0002703633,0.00005468396,0.00008180146,0.000055352473,0.00007263463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764043,0.000019593026,0.0005812522,0.0009951555,0.00042704854,0.000336523],"domain_scores_gemma":[0.99758756,0.0006527271,0.00032461135,0.0008606633,0.0003739587,0.00020049627],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011543095,0.00030999572,0.0005366919,0.00039391834,0.00015225247,0.000049751387,0.00044050315,0.0002487891,0.000011425542],"category_scores_gemma":[0.00032886263,0.00025808843,0.00021327166,0.0003007796,0.00042275843,0.000105779094,0.00014057927,0.0005672394,0.0000028990378],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023617821,0.00022242367,0.0021851042,0.00018368856,0.00002666001,0.00001516819,0.00008127469,0.0065602544,0.008740041,0.0052334494,0.00028585043,0.9762299],"study_design_scores_gemma":[0.0009552622,0.0004141062,0.0006610492,0.0002929502,0.000069256304,0.00003522207,1.117233e-7,0.94276845,0.0018369195,0.045556396,0.0070872214,0.00032304268],"about_ca_topic_score_codex":0.000010653544,"about_ca_topic_score_gemma":0.0000132602145,"teacher_disagreement_score":0.97590685,"about_ca_system_score_codex":0.00021589524,"about_ca_system_score_gemma":0.0005247511,"threshold_uncertainty_score":0.9999871},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005737555,0.00026567804,0.99363667,0.0005671741,0.0025611215,0.00029377162,0.0000063443003,0.00012651493,0.001968969],"genre_scores_gemma":[0.1806374,0.000030008694,0.8154766,0.0019588294,0.0009251451,0.000011856933,0.00007059091,0.000054244512,0.0008352982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968476,0.00004643845,0.00044954644,0.00114368,0.0010968625,0.00041585605],"domain_scores_gemma":[0.9979665,0.00020068181,0.0003061318,0.0008637544,0.00047836197,0.00018452911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072734314,0.0003661792,0.00032155192,0.00074480835,0.00023017083,0.00033982037,0.0011858289,0.00035780785,0.000047652946],"category_scores_gemma":[0.000075632386,0.0003302469,0.000091017246,0.0004679069,0.0002840316,0.00095924037,0.0006408809,0.00056464586,0.00017531872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027159125,0.00008344693,0.00010893723,0.00003719042,0.000014073091,0.00007110423,0.00091564824,0.107668266,0.006169129,0.0143114915,0.0008598241,0.86973375],"study_design_scores_gemma":[0.00023696687,0.00008037825,0.00012202673,0.00040676465,0.000006488552,0.000070544505,1.7818292e-7,0.9000874,0.00055759784,0.09619578,0.0018336539,0.00040220656],"about_ca_topic_score_codex":0.000020390044,"about_ca_topic_score_gemma":0.000019127212,"teacher_disagreement_score":0.86933154,"about_ca_system_score_codex":0.00037483842,"about_ca_system_score_gemma":0.0006630205,"threshold_uncertainty_score":0.99991494},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031220858,0.00019899236,0.97641844,0.00092364475,0.003301082,0.00037218613,0.000013272593,0.0001972472,0.018543903],"genre_scores_gemma":[0.04309272,0.000023677812,0.9512033,0.004721587,0.00055920554,0.0000065238846,0.000008600824,0.000045327106,0.0003390527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943011,0.00004901638,0.0005729622,0.0020581654,0.0022193089,0.00079944683],"domain_scores_gemma":[0.9956096,0.0009575062,0.00028221932,0.002391544,0.00039309674,0.00036602383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014304441,0.0006907958,0.0006265711,0.001096832,0.0003174878,0.000660397,0.0043309084,0.00047142446,0.00004718082],"category_scores_gemma":[0.00021183967,0.00054139673,0.0001824598,0.000792222,0.00050751405,0.00039270156,0.0013991365,0.00094724464,0.00026917728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015603515,0.00004039599,0.000017176628,0.000009586687,0.0000029223172,0.00018422134,0.0001264761,0.12662843,0.000009814566,0.0057572513,0.00037229183,0.86683583],"study_design_scores_gemma":[0.00041820767,0.00036901806,0.00012574214,0.0003845663,0.000004173752,0.000038847837,7.083073e-8,0.8418908,0.0000675361,0.14909163,0.006936187,0.00067319954],"about_ca_topic_score_codex":0.00001957221,"about_ca_topic_score_gemma":0.00003086976,"teacher_disagreement_score":0.8661626,"about_ca_system_score_codex":0.00043662643,"about_ca_system_score_gemma":0.0008863932,"threshold_uncertainty_score":0.99970376},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010663676,0.0004920454,0.9861366,0.000038242706,0.00045670004,0.0003301048,0.000005139365,0.00002688301,0.0018505942],"genre_scores_gemma":[0.4175786,0.000027827637,0.5810474,0.00029031924,0.0007225807,0.00000387506,0.000021994472,0.000059889397,0.0002475075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980593,0.00002073064,0.00038652658,0.0006175565,0.00054510165,0.00037081024],"domain_scores_gemma":[0.9987988,0.000060674745,0.00020976282,0.0006369328,0.00017811608,0.000115720984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007426832,0.0003494573,0.00028938102,0.00026188503,0.0001531181,0.00011711024,0.0007785085,0.00039872332,0.000015113864],"category_scores_gemma":[0.00027538906,0.00031008184,0.000095034884,0.00015035467,0.00032748617,0.000012764248,0.00037606558,0.0005152993,0.000007882864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053299314,0.00001644498,0.00011990552,0.00007227669,0.000017359936,0.000016788777,0.00034202076,0.29024643,0.033538677,0.00007852064,0.000011354371,0.6754869],"study_design_scores_gemma":[0.000999066,0.00092880393,0.00008698561,0.0009576104,0.00003565215,0.00034482326,8.872402e-7,0.91133565,0.06019782,0.010935586,0.012747234,0.0014298959],"about_ca_topic_score_codex":0.000016392567,"about_ca_topic_score_gemma":0.00015086899,"teacher_disagreement_score":0.67405707,"about_ca_system_score_codex":0.000093091316,"about_ca_system_score_gemma":0.00038088395,"threshold_uncertainty_score":0.99993515},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010836324,0.0033556088,0.9918122,0.0008436909,0.00068414374,0.00032734152,0.0000019849042,0.00070290896,0.002261281],"genre_scores_gemma":[0.035386905,0.000015683894,0.9630003,0.0008117431,0.0003765569,0.000008312491,0.0000038633093,0.00004357541,0.00035304594],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957766,0.000035405672,0.00042346178,0.0015835721,0.001405511,0.0007754453],"domain_scores_gemma":[0.99714357,0.00019789778,0.00031932918,0.0015387554,0.0005412886,0.00025918655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010708363,0.0005927785,0.00054656947,0.00069167535,0.00022704326,0.0009157089,0.004171191,0.00034625607,0.000009654721],"category_scores_gemma":[0.00010382473,0.00045369283,0.000077754696,0.0007664757,0.00080668967,0.00097222696,0.0013967521,0.0010500806,0.000026520827],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011414544,0.000020196314,0.000020898031,0.000037015132,0.000009018443,0.00032184122,0.00054557686,0.00260735,0.00011259827,0.046775773,0.00009306713,0.94944525],"study_design_scores_gemma":[0.00033423907,0.00049814297,0.00000795088,0.0011794711,0.000015916336,0.0003554293,1.2634999e-7,0.14267449,0.004946141,0.8420535,0.0066356636,0.0012989307],"about_ca_topic_score_codex":0.000029709798,"about_ca_topic_score_gemma":0.0001388184,"teacher_disagreement_score":0.94814634,"about_ca_system_score_codex":0.00041400615,"about_ca_system_score_gemma":0.0012189831,"threshold_uncertainty_score":0.9997915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014685729,0.00017940928,0.99724233,0.00019995647,0.0013530813,0.00017754435,0.000015866863,0.00010390544,0.0007132257],"genre_scores_gemma":[0.8605616,0.000049048904,0.13520363,0.002453191,0.0011419121,0.000005216631,0.0003062232,0.000060447943,0.00021869889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702764,0.00006652464,0.0005857588,0.00097549515,0.0009790857,0.00036549405],"domain_scores_gemma":[0.99723804,0.0002056844,0.00047753495,0.0009748717,0.00090141455,0.00020242944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007526006,0.00035583173,0.0004352428,0.0006799005,0.00011733792,0.00034365,0.002451097,0.00024104168,0.0000306613],"category_scores_gemma":[0.000106123465,0.00033930072,0.0000830184,0.0007146246,0.00056367886,0.0012863441,0.000750433,0.00039557752,0.000009580296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010730801,0.00006269456,0.00013508167,0.000020153733,0.000014387589,0.000016681286,0.0005173503,0.6789532,0.00003487518,0.15421839,0.00009814278,0.16591834],"study_design_scores_gemma":[0.00022075888,0.00016782247,0.000069325986,0.00012341408,0.000007790577,0.000019132805,2.5471908e-7,0.96598125,0.00009088288,0.032368243,0.00061124103,0.00033986435],"about_ca_topic_score_codex":0.000015358255,"about_ca_topic_score_gemma":0.000026318077,"teacher_disagreement_score":0.8620387,"about_ca_system_score_codex":0.00021516366,"about_ca_system_score_gemma":0.00047786016,"threshold_uncertainty_score":0.9999059},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038546033,0.00039297147,0.9934622,0.0004614216,0.00085172174,0.0003314942,0.0000017457332,0.000049177183,0.0005946397],"genre_scores_gemma":[0.56530064,0.00000579398,0.43423274,0.00023885947,0.0001910583,0.000003745792,0.0000014313599,0.000013673156,0.0000120215245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972558,0.00018458776,0.00039834387,0.0007835053,0.000991682,0.00038608888],"domain_scores_gemma":[0.99796563,0.0003884518,0.00032047872,0.0010397328,0.0002314224,0.000054298525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039332444,0.00030421867,0.00039969906,0.0006117105,0.00016022511,0.0003279578,0.002130499,0.00029870827,0.0000015675425],"category_scores_gemma":[0.00012628005,0.00022914546,0.00008988283,0.0010860751,0.00062075467,0.00052466546,0.00039699415,0.0007629719,0.0000023026203],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013513376,0.000042074058,0.00030261467,0.00007294924,0.000008184923,0.00004424613,0.003743761,0.09403816,0.0025578307,0.016056404,0.0000040388763,0.88311625],"study_design_scores_gemma":[0.00026937813,0.00011849099,0.0008163889,0.00022876298,0.0000041411704,0.00006995641,0.0000012164942,0.6640086,0.0029643571,0.33091974,0.00028271961,0.00031624566],"about_ca_topic_score_codex":0.00005442233,"about_ca_topic_score_gemma":0.0002038852,"teacher_disagreement_score":0.8828,"about_ca_system_score_codex":0.00024599282,"about_ca_system_score_gemma":0.00037351786,"threshold_uncertainty_score":0.93442804},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000094977106,0.000055052806,0.9657886,0.0034201643,0.002921983,0.00040361175,0.0000010368303,0.0004216549,0.026892917],"genre_scores_gemma":[0.64575297,0.0000046653786,0.34616548,0.0049388935,0.0007317737,0.000029591542,0.000011597303,0.00006842679,0.0022966415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558806,0.00016001253,0.00059557176,0.0018019293,0.0009998202,0.0008545811],"domain_scores_gemma":[0.9968718,0.0007102474,0.00036527193,0.0012898038,0.0003403291,0.0004225261],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001922716,0.000587241,0.00062170153,0.0011474494,0.0006044648,0.0013722972,0.0037001893,0.00031853773,0.00005903089],"category_scores_gemma":[0.00023718255,0.0005655836,0.00014538977,0.0008667675,0.00021530781,0.00034914803,0.0011363485,0.0015104315,0.0006188386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008862657,0.000031415395,0.0002438371,0.000131127,0.000012386915,0.000040868785,0.0017719778,0.3016749,0.000066908244,0.04534205,0.00029769956,0.650378],"study_design_scores_gemma":[0.00040948566,0.00038051434,0.00020347802,0.0012508049,0.000011033377,0.00007783098,0.0000067770147,0.93099296,0.00035843134,0.0020528801,0.062982894,0.0012729191],"about_ca_topic_score_codex":0.00004970759,"about_ca_topic_score_gemma":0.000033105556,"teacher_disagreement_score":0.6491051,"about_ca_system_score_codex":0.0006397282,"about_ca_system_score_gemma":0.0007818807,"threshold_uncertainty_score":0.99967957},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000098739474,0.00016114714,0.9975823,0.000074878204,0.0011770979,0.00035445247,0.000024552777,0.00012908761,0.00039774546],"genre_scores_gemma":[0.40156233,0.000023545012,0.59656864,0.00047629315,0.0010775949,0.000011226669,0.00015091654,0.00008280509,0.000046659352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986872,0.000011708199,0.0002645307,0.00045492526,0.00031906262,0.00026258765],"domain_scores_gemma":[0.9989063,0.0003325739,0.000062470746,0.00039734304,0.00018629138,0.00011502003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025028753,0.00027919727,0.00024998945,0.00023234366,0.00009362389,0.00029630295,0.0003440753,0.0003073584,0.000015277323],"category_scores_gemma":[0.00009702306,0.00026555327,0.000047368278,0.00015752019,0.00015578372,0.00029073158,0.000025627176,0.00032828146,0.0000043137925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038437825,0.0000067615247,0.000008419934,0.00002653848,0.000004981662,0.00000322817,0.0005187298,0.9581802,0.00024154244,0.024080927,0.000037067908,0.016887764],"study_design_scores_gemma":[0.00008367758,0.00011455774,0.000005999676,0.00012862028,0.0000058848836,0.000005613171,2.7291614e-7,0.771933,0.0012053152,0.22592548,0.0003273966,0.00026415777],"about_ca_topic_score_codex":0.0000038802073,"about_ca_topic_score_gemma":0.00003401052,"teacher_disagreement_score":0.40146357,"about_ca_system_score_codex":0.00020351818,"about_ca_system_score_gemma":0.0001105455,"threshold_uncertainty_score":0.9999797},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002122136,0.000057643865,0.9930562,0.001392079,0.0009025811,0.00037483816,0.000010773469,0.000035300964,0.0039583878],"genre_scores_gemma":[0.945496,0.000008321752,0.051854372,0.0016986782,0.00029866412,0.000010481389,0.00001500719,0.00001975654,0.00059869455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976529,0.000040221432,0.00042904055,0.0006148441,0.001000949,0.00026204193],"domain_scores_gemma":[0.9978103,0.00070891215,0.000366741,0.0009327836,0.00013374747,0.000047533336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006442028,0.00027226895,0.0002968612,0.0002685657,0.00017726482,0.0001412443,0.0016987915,0.00014564456,0.00004734995],"category_scores_gemma":[0.000036004945,0.00018792998,0.00010314168,0.00024767773,0.0003751315,0.00015473868,0.00046944516,0.00033678763,0.000048191552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042141314,0.00009831453,0.00014383161,0.00005351752,0.000021320182,0.000028452485,0.0004371803,0.16596763,0.00020848744,0.7862077,0.0028583412,0.043971054],"study_design_scores_gemma":[0.0002659639,0.00018273602,0.0012069098,0.00038513137,0.0000074832715,0.000020737485,7.776229e-8,0.68374765,0.0026097214,0.3086224,0.0025398757,0.0004113294],"about_ca_topic_score_codex":0.000033639237,"about_ca_topic_score_gemma":0.000033056964,"teacher_disagreement_score":0.94528383,"about_ca_system_score_codex":0.00015031981,"about_ca_system_score_gemma":0.00014234391,"threshold_uncertainty_score":0.7663562},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003378612,0.0029132005,0.9627677,0.00043662247,0.003998878,0.00027222087,0.0000035573642,0.00035342277,0.028916543],"genre_scores_gemma":[0.31863567,0.00034586582,0.6685492,0.0027714102,0.0020338146,0.000025404051,0.000015993417,0.00011512373,0.0075075463],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959675,0.00005533468,0.0005767881,0.001521282,0.0010409942,0.0008381065],"domain_scores_gemma":[0.9970183,0.0005029424,0.00028027975,0.0015995944,0.0003759775,0.00022290228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013930084,0.000621767,0.00069217314,0.00092787144,0.00028802478,0.00096881826,0.004899186,0.000354735,0.000014662808],"category_scores_gemma":[0.00012063337,0.0005477154,0.00015765154,0.00055465754,0.00087299664,0.0009480994,0.002491974,0.00078705756,0.00020584626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006167765,0.000051718347,0.00006101093,0.000109190514,0.000027042168,0.00050355104,0.006703113,0.035951026,0.00008953225,0.15410307,0.00056191254,0.8018327],"study_design_scores_gemma":[0.00031826753,0.00011597466,0.000050235572,0.0006062059,0.000010273807,0.00011811255,0.000003146081,0.15335771,0.0003460043,0.8391301,0.0049498137,0.0009941497],"about_ca_topic_score_codex":0.00006973491,"about_ca_topic_score_gemma":0.0003408476,"teacher_disagreement_score":0.80083853,"about_ca_system_score_codex":0.000447624,"about_ca_system_score_gemma":0.0011315652,"threshold_uncertainty_score":0.99969745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003979995,0.00042488927,0.9892385,0.000053564283,0.0019318272,0.0007057635,0.000011748856,0.00012808936,0.0035256224],"genre_scores_gemma":[0.8890955,0.0000043654254,0.10635997,0.00013691079,0.00039307892,0.000062339575,0.000015602793,0.000073445095,0.0038587889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967772,0.00014428578,0.00041960948,0.0013249812,0.0007091492,0.00062476983],"domain_scores_gemma":[0.9973131,0.0010770852,0.00027868748,0.0009307786,0.00024903228,0.00015136097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000944845,0.00052237714,0.0005540825,0.00070074963,0.00030411014,0.00028993358,0.0006516181,0.0003414836,0.00009753666],"category_scores_gemma":[0.00006951669,0.00041546003,0.00009154362,0.00033517927,0.00054587616,0.00011512295,0.00013300995,0.00061818317,0.00017219245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012030235,0.0002815363,0.0037519715,0.00025715382,0.00033572328,0.0022809163,0.04094782,0.31164822,0.0008165094,0.019803656,0.000105091036,0.61856836],"study_design_scores_gemma":[0.038645063,0.038517926,0.014602476,0.030418737,0.0028648681,0.01154889,0.0008939665,0.72268516,0.006217525,0.09993709,0.008036735,0.02563157],"about_ca_topic_score_codex":0.000074049676,"about_ca_topic_score_gemma":0.000026401274,"teacher_disagreement_score":0.8851155,"about_ca_system_score_codex":0.00022141876,"about_ca_system_score_gemma":0.00030631464,"threshold_uncertainty_score":0.9998297},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013112939,0.0002870201,0.99443257,0.0002729981,0.0020505572,0.00049411395,0.000016128117,0.00023094012,0.0020845318],"genre_scores_gemma":[0.6594883,0.000017160299,0.3373786,0.0010189358,0.0014561124,0.00004356312,0.000027007785,0.00006279935,0.00050749356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960834,0.00007599948,0.0004736077,0.0016772461,0.0010862108,0.000603579],"domain_scores_gemma":[0.9964489,0.0013365505,0.00037977562,0.0011110835,0.00053242006,0.00019127336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003145025,0.00046791934,0.00060933497,0.001672659,0.00033439446,0.0006951052,0.0022038177,0.0003457849,0.000010747991],"category_scores_gemma":[0.00060994225,0.00043325106,0.0002914139,0.0015111687,0.00024172886,0.0006110835,0.00043994098,0.0006543388,0.000011803455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008609815,0.00003539993,0.0001058696,0.000042142314,0.00016681528,0.000027786982,0.001225086,0.2688028,0.00011242861,0.0051267087,0.00013124033,0.7241376],"study_design_scores_gemma":[0.00029616273,0.00042054677,0.0005627955,0.00024864034,0.0000923559,0.0000114090535,2.8729573e-7,0.9167791,0.0010045401,0.07870291,0.0012808891,0.00060039025],"about_ca_topic_score_codex":0.00001614029,"about_ca_topic_score_gemma":0.000065706685,"teacher_disagreement_score":0.72353727,"about_ca_system_score_codex":0.0004828805,"about_ca_system_score_gemma":0.0003615805,"threshold_uncertainty_score":0.99981195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030366654,0.0015768002,0.9442484,0.0025900416,0.0031638683,0.00052791374,8.138685e-7,0.00018623614,0.047402307],"genre_scores_gemma":[0.9333986,0.0005778764,0.058908455,0.0019198096,0.0007546569,0.00003099225,0.0000152488465,0.00007486889,0.004319486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559087,0.00015444687,0.00049265544,0.0018741487,0.0011051012,0.0007827913],"domain_scores_gemma":[0.99705034,0.0007081723,0.00035325388,0.0006723439,0.00091920194,0.00029665642],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0017499692,0.00054499746,0.00058481685,0.0012298081,0.00026682552,0.0023975594,0.0026091328,0.00026883752,0.00005934159],"category_scores_gemma":[0.00066814997,0.0005415754,0.00011114911,0.0010061794,0.0006009966,0.0026581914,0.0013838228,0.0025138408,0.00019110632],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036339185,0.00012142057,0.00026753868,0.000023836248,0.000024588724,0.00035470678,0.029099192,0.059270926,0.0000117103355,0.04677033,0.000106404754,0.863913],"study_design_scores_gemma":[0.0020268364,0.0011732617,0.0010031449,0.0069539263,0.000028776749,0.00045694597,0.0007570554,0.62204754,0.00027325933,0.35451528,0.0075985184,0.0031654215],"about_ca_topic_score_codex":0.00009902019,"about_ca_topic_score_gemma":0.00017894397,"teacher_disagreement_score":0.9330949,"about_ca_system_score_codex":0.0010149278,"about_ca_system_score_gemma":0.0017037155,"threshold_uncertainty_score":0.9997874},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010620792,0.0041111773,0.9784539,0.0016086611,0.002970762,0.0002893109,0.0000029980579,0.00036367623,0.0121889],"genre_scores_gemma":[0.17909351,0.00029361836,0.8065104,0.0046267943,0.0039805793,0.000040771327,0.000010000876,0.00012726882,0.005317041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996053,0.000056256606,0.00056239264,0.0013720486,0.0010688462,0.00088749913],"domain_scores_gemma":[0.996168,0.001320398,0.00031040172,0.0018294508,0.00017735368,0.00019436053],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015145624,0.0005491212,0.00043519243,0.00037916712,0.0009655317,0.0011664458,0.005158875,0.0003461204,0.000008664789],"category_scores_gemma":[0.00005982633,0.0003909923,0.00014525515,0.0004355537,0.00053826673,0.0004557202,0.0011411426,0.0010357865,0.00014904291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006590939,0.000008939451,0.000021326008,0.000032670276,0.000013529665,0.00012100126,0.001190442,0.041121487,0.00003264327,0.054108012,0.0003746578,0.9029687],"study_design_scores_gemma":[0.00022522328,0.00013821365,0.00002086768,0.0010381616,0.0000059775407,0.00023401772,6.788981e-7,0.917999,0.0005212802,0.017894287,0.06105964,0.00086261064],"about_ca_topic_score_codex":0.00003402025,"about_ca_topic_score_gemma":0.000051841987,"teacher_disagreement_score":0.9021061,"about_ca_system_score_codex":0.00044465568,"about_ca_system_score_gemma":0.00058267673,"threshold_uncertainty_score":0.9998704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064784597,0.0011447384,0.98441035,0.0003403391,0.0056339847,0.0004707447,0.000023366712,0.00013770122,0.007190923],"genre_scores_gemma":[0.62934256,0.000017007806,0.3600071,0.00047756254,0.0022759542,0.00006114747,0.000017276858,0.000077366145,0.0077240313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951235,0.000035755103,0.0009748912,0.0014814693,0.0017116551,0.0006727255],"domain_scores_gemma":[0.9956099,0.0015491899,0.0005457182,0.0012201868,0.0008787722,0.00019622405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003282236,0.00040454065,0.00061453186,0.0011585166,0.0005816843,0.00069834903,0.0028972316,0.0003236039,0.000189621],"category_scores_gemma":[0.0005111419,0.00030593158,0.00023911927,0.0007608325,0.00028557048,0.00041720143,0.0004650096,0.00044242223,0.00053813815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026210824,0.00004431268,0.0011756667,0.00027742228,0.000059586466,0.00003048776,0.0027021118,0.37743428,0.0002179865,0.034904733,0.00085601385,0.5822712],"study_design_scores_gemma":[0.00023849269,0.000103262224,0.0002524422,0.00069510133,0.000027335145,0.000033749562,0.0000063214575,0.70606834,0.00024744731,0.28141046,0.010269734,0.0006472914],"about_ca_topic_score_codex":0.000043460324,"about_ca_topic_score_gemma":0.000035521258,"teacher_disagreement_score":0.6286947,"about_ca_system_score_codex":0.00015178983,"about_ca_system_score_gemma":0.0002827678,"threshold_uncertainty_score":0.99993926},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003796358,0.00045977609,0.9931208,0.0005432956,0.0030735047,0.00049781514,0.000004755945,0.00019498033,0.0020671142],"genre_scores_gemma":[0.1516111,0.00003440158,0.8428146,0.00091051415,0.0008664023,0.000029420105,0.000029967576,0.00006563061,0.0036379548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956708,0.00005263978,0.00056830887,0.0018171836,0.0012411171,0.0006499846],"domain_scores_gemma":[0.9969673,0.00020529707,0.00032470372,0.0016836233,0.0005538783,0.00026517684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010176668,0.00053667324,0.00046516175,0.00076736807,0.00028890712,0.0005145133,0.0024897803,0.00037116825,0.00003863928],"category_scores_gemma":[0.00009904275,0.0005232024,0.00012318665,0.0005839722,0.00032788422,0.0011902616,0.0013002537,0.00086036517,0.00013458027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005221383,0.00005539854,0.00007330947,0.00002493164,0.00002273469,0.000055704302,0.0009804224,0.3820552,0.00034016103,0.012726793,0.000051860898,0.60360825],"study_design_scores_gemma":[0.00029994315,0.00009084603,0.00004936868,0.00013866786,0.00001139055,0.000048746264,2.5750808e-7,0.92402744,0.0004787665,0.071677424,0.0025937206,0.0005834491],"about_ca_topic_score_codex":0.00007851773,"about_ca_topic_score_gemma":0.00013312511,"teacher_disagreement_score":0.60302484,"about_ca_system_score_codex":0.0008676586,"about_ca_system_score_gemma":0.0007268772,"threshold_uncertainty_score":0.99972194},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004428245,0.0008695138,0.9936092,0.0011281965,0.0019847108,0.00051024905,0.00000890068,0.00020391581,0.0012425015],"genre_scores_gemma":[0.74162203,0.00024256675,0.2516847,0.0015885101,0.0016956755,0.000051158084,0.000109962595,0.000097735756,0.0029076713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646014,0.000053616994,0.00035645333,0.0014595048,0.0011679363,0.0005023747],"domain_scores_gemma":[0.99791974,0.00018545828,0.00034278064,0.0006868532,0.0006401128,0.00022506088],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007895394,0.00055727095,0.00044219758,0.0009963597,0.0004145269,0.00063514424,0.0011417109,0.0008007246,0.0000158137],"category_scores_gemma":[0.00016184384,0.00049790397,0.00009590649,0.0005999846,0.0004674109,0.0012938712,0.0006494902,0.0010061278,0.000030092417],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001321055,0.000018380497,0.000009827806,0.000035460627,0.0000070743686,0.000024817444,0.0008020321,0.0040761754,0.0015271377,0.00045742907,0.00018800065,0.99284047],"study_design_scores_gemma":[0.0010475595,0.00047845818,0.0012759606,0.0006854436,0.00003609199,0.00042931273,0.000003084546,0.8715944,0.009592652,0.105368465,0.007904857,0.0015836743],"about_ca_topic_score_codex":0.00003007322,"about_ca_topic_score_gemma":0.00041077295,"teacher_disagreement_score":0.9912568,"about_ca_system_score_codex":0.000352665,"about_ca_system_score_gemma":0.00024192354,"threshold_uncertainty_score":0.9997473},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009399893,0.00047234457,0.9919002,0.0020784542,0.0027258499,0.0013340709,0.0002522784,0.00025161763,0.0008911624],"genre_scores_gemma":[0.4166419,0.00003439516,0.5734973,0.0048738755,0.0019563036,0.0003041589,0.0013578136,0.000119755925,0.0012145069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534464,0.00009784337,0.0007425164,0.0016940979,0.0013824668,0.000738409],"domain_scores_gemma":[0.9956285,0.0014047116,0.00042351993,0.00096904486,0.0012572386,0.00031700407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016794056,0.00066834455,0.0008194142,0.0008825121,0.00032877843,0.00057760184,0.0021432815,0.00081315933,0.00007406625],"category_scores_gemma":[0.00030492837,0.0006102867,0.00030635824,0.00048244296,0.0005096349,0.00061684067,0.0003753455,0.00088092155,0.00015374653],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012455092,0.00012419955,0.000035900888,0.00023861651,0.00006930875,0.00012145804,0.0012686277,0.014242423,0.00011562462,0.002842782,0.002094487,0.97872204],"study_design_scores_gemma":[0.0055722604,0.0008257191,0.00015379905,0.0011102618,0.000059490943,0.00029095888,0.0000018021792,0.6095577,0.0004259672,0.36695063,0.013089873,0.001961515],"about_ca_topic_score_codex":0.000009789654,"about_ca_topic_score_gemma":0.00012854018,"teacher_disagreement_score":0.9767605,"about_ca_system_score_codex":0.0005261398,"about_ca_system_score_gemma":0.0013501854,"threshold_uncertainty_score":0.99963486},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012984693,0.0004492459,0.99466527,0.00012807861,0.0015426173,0.00058656617,0.000013550023,0.0021460708,0.00033874935],"genre_scores_gemma":[0.28509295,0.0000036960978,0.71382356,0.00025437685,0.0007358387,0.000017380227,0.00000829316,0.000032002306,0.000031884076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961099,0.00004522284,0.0005581391,0.0016554634,0.00093243486,0.00069886405],"domain_scores_gemma":[0.9962951,0.0011128514,0.0005082884,0.0010439383,0.0008612079,0.00017860207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020396588,0.00054515287,0.000528638,0.0005882852,0.0005247388,0.000869039,0.0025763237,0.00031947833,0.0000013817602],"category_scores_gemma":[0.001929168,0.0005239097,0.00012294948,0.0005145759,0.0005402301,0.00088177575,0.00092370354,0.00056827633,0.000002944984],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000091626725,0.000023728118,0.0003417025,0.000063501524,0.000016028616,0.000078013865,0.0017289516,0.124416724,0.0016290515,0.013652663,0.0001599408,0.85788053],"study_design_scores_gemma":[0.00011229932,0.0001118615,0.00000389967,0.00046050266,0.000006923251,0.0000638516,9.0313804e-8,0.7139368,0.0010812198,0.28361455,0.00013844244,0.0004695397],"about_ca_topic_score_codex":0.00019649944,"about_ca_topic_score_gemma":0.00007845159,"teacher_disagreement_score":0.85741097,"about_ca_system_score_codex":0.00083166634,"about_ca_system_score_gemma":0.0011183805,"threshold_uncertainty_score":0.9997212},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007607072,0.0013501148,0.94416004,0.0008359544,0.0026159533,0.0003849103,0.000002456982,0.00033655364,0.05023792],"genre_scores_gemma":[0.17860763,0.00008694201,0.8163295,0.0030368979,0.0008452299,0.000017129063,0.00000910911,0.000077761564,0.0009898127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944403,0.000051429288,0.00070635235,0.00210211,0.0015754196,0.0011243712],"domain_scores_gemma":[0.9965294,0.00034775844,0.00039225383,0.0020132395,0.00035841516,0.0003589209],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012861354,0.0007956164,0.0008322026,0.00067415385,0.00039637953,0.0012253327,0.004880008,0.0004800419,0.000023673678],"category_scores_gemma":[0.00013649727,0.0007129289,0.00018763247,0.0007922478,0.00059109967,0.0011465233,0.0035656649,0.0011512508,0.00022003884],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012584954,0.00004516499,0.000028402203,0.000048851107,0.000022016215,0.00038797435,0.0017536602,0.06505263,0.000049643946,0.044558477,0.0001865952,0.887854],"study_design_scores_gemma":[0.0004813631,0.00035284794,0.000011533159,0.00044205293,0.000009345485,0.00028052853,4.3431595e-7,0.67766225,0.0002407717,0.30280948,0.016719619,0.0009897788],"about_ca_topic_score_codex":0.000065592496,"about_ca_topic_score_gemma":0.00007809583,"teacher_disagreement_score":0.88686424,"about_ca_system_score_codex":0.00044696665,"about_ca_system_score_gemma":0.0009184297,"threshold_uncertainty_score":0.9998115},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002897753,0.002981929,0.98862106,0.0005674279,0.0023400807,0.00045197955,0.000027654702,0.00028965055,0.004430438],"genre_scores_gemma":[0.018513177,0.00012754515,0.97729504,0.0031139082,0.00071262347,0.000002259661,0.00009595699,0.000049763374,0.00008972297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927251,0.00011837592,0.0008637277,0.0033447072,0.0014680398,0.0014801022],"domain_scores_gemma":[0.9941327,0.0010986064,0.00045878536,0.0037706024,0.00018765482,0.000351627],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00336255,0.00083114026,0.0008961012,0.0009391103,0.0006604152,0.0015319525,0.009083957,0.0005342797,0.0000040555597],"category_scores_gemma":[0.00016748374,0.00074673834,0.000095320436,0.0017460616,0.0010880051,0.0013367361,0.0090193655,0.0011002,0.000017831358],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038450985,0.000032738808,0.000262694,0.00007923986,0.000011669616,0.0003149041,0.0011141908,0.0038792512,0.000004183738,0.00079362787,0.0010134269,0.99249023],"study_design_scores_gemma":[0.00041311615,0.00015401447,0.00053616724,0.00051430514,0.00001681832,0.00035789813,9.0299307e-7,0.95465195,0.000023249035,0.03689088,0.005385902,0.0010548155],"about_ca_topic_score_codex":0.0000543246,"about_ca_topic_score_gemma":0.00010117022,"teacher_disagreement_score":0.9914354,"about_ca_system_score_codex":0.00029902285,"about_ca_system_score_gemma":0.00096837454,"threshold_uncertainty_score":0.99950457},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007004846,0.00019013812,0.9954864,0.00044779867,0.0010007889,0.0010611296,0.0000078327275,0.0001528782,0.0015830025],"genre_scores_gemma":[0.05346796,0.000014817867,0.94485915,0.0009819068,0.0004278359,0.00006272534,0.000009490919,0.000042948453,0.00013315519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960857,0.000028721872,0.00048235312,0.001777196,0.00088973047,0.00073629606],"domain_scores_gemma":[0.9972421,0.00049528875,0.00032537937,0.0014231724,0.00034921852,0.0001648594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066391396,0.0005793447,0.00054944406,0.00045670138,0.00030880247,0.0006805724,0.0028410428,0.00031895662,0.0000055761643],"category_scores_gemma":[0.00006210029,0.00044093997,0.00011773664,0.00040864598,0.00059587107,0.00034744726,0.0006006127,0.0004199211,0.000015684704],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068860268,0.000019262452,0.00002952536,0.00007039468,0.0000060497414,0.000036817575,0.00025828285,0.035817884,0.0000042434594,0.008844219,0.000016327589,0.95489013],"study_design_scores_gemma":[0.0003347333,0.0006402894,0.00016712154,0.00020189096,0.0000125562465,0.00013291196,3.808896e-8,0.8095193,0.000049344006,0.18716449,0.0012085463,0.0005688086],"about_ca_topic_score_codex":0.000009732969,"about_ca_topic_score_gemma":0.00006812964,"teacher_disagreement_score":0.9543213,"about_ca_system_score_codex":0.00023461868,"about_ca_system_score_gemma":0.0004082771,"threshold_uncertainty_score":0.99980426},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063834974,0.00035071975,0.9898351,0.00058836996,0.0024089424,0.00036649287,0.00001359657,0.00013681891,0.0056616436],"genre_scores_gemma":[0.6065199,0.000033470416,0.39179766,0.00032171464,0.0006298697,0.0000037930376,0.000010697731,0.000052307652,0.0006306256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960668,0.00004089102,0.00058421853,0.0014722693,0.0011869041,0.00064889726],"domain_scores_gemma":[0.99603605,0.00035683558,0.00077994104,0.0023193157,0.00033169586,0.00017618288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009975069,0.0005298959,0.00071675074,0.00090286793,0.0004920766,0.00042885105,0.004340647,0.00031550837,0.000012421602],"category_scores_gemma":[0.00012223505,0.00049374625,0.00020392856,0.00034853697,0.0008640881,0.00026338166,0.0016151774,0.0008338503,0.000026351603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004043923,0.00004378909,0.00003618527,0.00007934835,0.000015158562,0.000061550956,0.0009581761,0.40777636,0.00047133552,0.020095238,0.000026961608,0.5704318],"study_design_scores_gemma":[0.00031445877,0.00016681376,0.00049963046,0.0007281635,0.000008920622,0.000053892534,1.02674576e-7,0.9513932,0.0024083653,0.04279848,0.0010662177,0.0005617667],"about_ca_topic_score_codex":0.00002877535,"about_ca_topic_score_gemma":0.0000150967235,"teacher_disagreement_score":0.6058815,"about_ca_system_score_codex":0.00018364424,"about_ca_system_score_gemma":0.0006328042,"threshold_uncertainty_score":0.9997514},"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":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007408601,0.00056700804,0.9634353,0.023252156,0.0019874435,0.001235522,0.000012718322,0.00022902123,0.009206723],"genre_scores_gemma":[0.42853945,0.0022905255,0.4772457,0.02837297,0.0092035355,0.0005345094,0.000035173533,0.00034886907,0.053429253],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99261177,0.00011948104,0.0009166752,0.003910317,0.0015875393,0.0008541927],"domain_scores_gemma":[0.98981994,0.00063559995,0.00045408614,0.008087706,0.0007831211,0.00021951755],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00925406,0.00056298636,0.00058725214,0.000468231,0.0006127947,0.0014011158,0.011218536,0.00028771622,0.00011652462],"category_scores_gemma":[0.0009958389,0.00033012027,0.00017970685,0.00083986745,0.0010181583,0.0017513733,0.006752414,0.0009977368,0.00018180556],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013617919,0.000046579662,0.000043175263,0.00004271083,0.000008162523,0.000023004239,0.0017601985,0.0009536639,0.000048331687,0.023678126,0.00013737152,0.9732451],"study_design_scores_gemma":[0.001910315,0.0011371037,0.0009977854,0.0021472853,0.00004826574,0.0003301973,0.0000040148298,0.26362482,0.013195735,0.4446822,0.26794416,0.0039781155],"about_ca_topic_score_codex":0.0000537423,"about_ca_topic_score_gemma":0.000030585074,"teacher_disagreement_score":0.96926695,"about_ca_system_score_codex":0.00031564108,"about_ca_system_score_gemma":0.0010705546,"threshold_uncertainty_score":0.99991506},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007952487,0.0003423982,0.9952626,0.0006472521,0.001972645,0.0009730854,0.000011342056,0.00013344297,0.00057769415],"genre_scores_gemma":[0.24033009,0.000014811013,0.7566069,0.00066017883,0.0013034905,0.00007791651,0.00009737577,0.000030130825,0.00087914715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722433,0.000034469605,0.00045295813,0.0009457898,0.00079305534,0.0005494142],"domain_scores_gemma":[0.99825114,0.00036163544,0.0002950971,0.00068954565,0.0002316658,0.00017093432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008647411,0.00034007968,0.00032687708,0.00042082355,0.0004594738,0.00048386818,0.0013190525,0.00023349316,0.00006233135],"category_scores_gemma":[0.00008911194,0.00029401973,0.00016760369,0.0002927282,0.00020569423,0.00070268253,0.0003763086,0.00030485095,0.00008643203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000903606,0.000100498895,0.000055058066,0.00007102733,0.000020590513,0.00001585226,0.0022393486,0.0033422248,0.0003536494,0.10115426,0.00009683454,0.89254165],"study_design_scores_gemma":[0.001262807,0.00040219168,0.001349435,0.00045968077,0.000038527232,0.00010354064,0.0000022247084,0.89266616,0.0009940343,0.038464002,0.06283109,0.0014263046],"about_ca_topic_score_codex":0.00002097016,"about_ca_topic_score_gemma":0.00009901985,"teacher_disagreement_score":0.8911153,"about_ca_system_score_codex":0.0003277806,"about_ca_system_score_gemma":0.0003804015,"threshold_uncertainty_score":0.9999512},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012257193,0.0000139659005,0.9835882,0.0000407858,0.00020114113,0.00017387168,0.000006990247,0.00004532611,0.0036725106],"genre_scores_gemma":[0.9753985,0.00003675496,0.023038177,0.0014005773,0.000058428694,8.3438925e-7,0.0000028625095,0.000013448088,0.000050450075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806166,0.000028161016,0.00034020026,0.0004893019,0.00078280544,0.0002978778],"domain_scores_gemma":[0.99921846,0.00014551736,0.00014130119,0.00024599224,0.00012824818,0.00012048225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083065865,0.00021823353,0.00021864186,0.0006765937,0.0001525631,0.00019267414,0.00052725256,0.00020090348,0.000039662475],"category_scores_gemma":[0.00009479659,0.0001894222,0.00003157539,0.00027374944,0.0010292224,0.00074354664,0.00019171734,0.00040112628,0.000015799498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033580494,0.00003727886,0.000008203069,0.00012742908,6.7427186e-7,0.000003537961,0.003917071,0.039569817,0.057865717,0.05991181,6.5805654e-7,0.8385242],"study_design_scores_gemma":[0.000114774826,0.00027134747,0.000011821762,0.000102064936,0.000002570968,0.000016712236,9.3929765e-7,0.847848,0.052928627,0.09849061,0.000010819846,0.00020171856],"about_ca_topic_score_codex":0.0000042648967,"about_ca_topic_score_gemma":0.0000041431617,"teacher_disagreement_score":0.96314126,"about_ca_system_score_codex":0.000052572217,"about_ca_system_score_gemma":0.00022328612,"threshold_uncertainty_score":0.77244127},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23806368,0.0011408273,0.75396556,0.0015823272,0.0012264019,0.0018824465,0.00000589314,0.00021439733,0.0019184708],"genre_scores_gemma":[0.9839705,0.000017245333,0.012083834,0.001958155,0.00037853612,0.000015075175,0.00004087787,0.000063030595,0.0014727266],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9972298,0.0000223408,0.0002976453,0.001153697,0.0006635057,0.0006329804],"domain_scores_gemma":[0.99897933,0.00010168353,0.00013334467,0.0004914723,0.000070899085,0.0002232947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014904946,0.0005366734,0.0006244554,0.0005604714,0.00020831324,0.000098916586,0.0004913101,0.00021901121,0.00012890404],"category_scores_gemma":[0.000042897816,0.00037190047,0.0001267116,0.00026863537,0.00046423246,0.00012007513,0.0004045696,0.001476322,0.00017844589],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012958719,0.00009637359,0.011782026,0.000048860133,0.000061152845,0.00029935827,0.0010206285,0.008039853,0.00089131383,0.00032224652,0.0000041250837,0.97730446],"study_design_scores_gemma":[0.007922981,0.013934772,0.8425064,0.006138738,0.0006284235,0.0064984066,0.0000051871725,0.09639063,0.005569816,0.012167472,0.0021479516,0.006089205],"about_ca_topic_score_codex":0.000035480607,"about_ca_topic_score_gemma":0.000069383255,"teacher_disagreement_score":0.97121525,"about_ca_system_score_codex":0.00013625014,"about_ca_system_score_gemma":0.00007135327,"threshold_uncertainty_score":0.9998733},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022876095,0.011481703,0.9568811,0.0010022175,0.0018872613,0.004463975,0.0004995676,0.00006568825,0.000842373],"genre_scores_gemma":[0.996833,0.00008164372,0.002041026,0.00070838316,0.00015003527,0.00003199063,0.000003996964,0.00001788562,0.00013201231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997999,0.000064141816,0.00048841845,0.00048204622,0.00055640587,0.00040999113],"domain_scores_gemma":[0.99652934,0.0018633404,0.00075297226,0.00035212561,0.00038057833,0.000121658224],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011987328,0.0002674849,0.0005558001,0.0001489104,0.00039032914,0.00032739443,0.0013080982,0.000251412,0.000018244475],"category_scores_gemma":[0.00015761885,0.0001867973,0.00009592261,0.00016810074,0.0027848138,0.000810426,0.00026679353,0.0002841796,5.691425e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015499219,0.000055424032,0.013601327,0.00037001146,0.00010066083,0.0000019309625,0.010965587,0.0018758649,0.00053791783,0.013887799,0.000031578806,0.9584169],"study_design_scores_gemma":[0.018044654,0.0025220062,0.009452612,0.004199096,0.0018935495,0.000033742122,0.00063297665,0.7700568,0.012790937,0.07945691,0.09385952,0.007057194],"about_ca_topic_score_codex":0.0050695594,"about_ca_topic_score_gemma":0.004706142,"teacher_disagreement_score":0.97395694,"about_ca_system_score_codex":0.00006230057,"about_ca_system_score_gemma":0.0003475106,"threshold_uncertainty_score":0.999929},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002835069,0.00035370098,0.9920773,0.0007025521,0.0008790592,0.00043566563,0.0000134356915,0.00011097852,0.0025922316],"genre_scores_gemma":[0.9026801,0.0001430892,0.09557531,0.0005248536,0.00037017663,0.000016689359,0.0000014712363,0.000054554388,0.0006337585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995749,0.00007303865,0.00058592897,0.0015898697,0.001166703,0.0008354447],"domain_scores_gemma":[0.99631786,0.0013590141,0.00035781495,0.0014085897,0.00028485907,0.00027185457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013147743,0.0005132424,0.0006496669,0.0011671698,0.0003266575,0.00028300207,0.0030190572,0.00026467617,0.000020346006],"category_scores_gemma":[0.00022658205,0.0004189479,0.00013372659,0.0006614942,0.0021654102,0.0005225049,0.002113623,0.0008082705,0.00001071787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007758417,0.000065434884,0.00027440922,0.000112147114,0.000028448647,0.00018700311,0.00054779573,0.0077234386,0.0020696202,0.5564927,0.000009106243,0.43241233],"study_design_scores_gemma":[0.0009611194,0.0012113067,0.00015320488,0.001631612,0.000010710144,0.00009981552,3.2029246e-7,0.1325102,0.028307961,0.83284914,0.0011998995,0.0010647203],"about_ca_topic_score_codex":0.000011071528,"about_ca_topic_score_gemma":0.000043811124,"teacher_disagreement_score":0.899845,"about_ca_system_score_codex":0.00016860767,"about_ca_system_score_gemma":0.0003063178,"threshold_uncertainty_score":0.99982625},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012925352,0.0004833183,0.98209184,0.001251708,0.014317609,0.0006442067,0.000022807933,0.00027942043,0.0008961305],"genre_scores_gemma":[0.0029330363,0.00002126282,0.99226165,0.0012783479,0.0018634278,0.000178714,0.00010961355,0.00004634984,0.0013076208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950192,0.00007285987,0.000524374,0.002065757,0.0011435961,0.0011742348],"domain_scores_gemma":[0.99657273,0.0005932478,0.0002772451,0.0015565525,0.00056579895,0.0004343945],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002410319,0.0004979222,0.00061712967,0.0015800248,0.0006368515,0.0017767664,0.005739487,0.0003499015,0.0000036884494],"category_scores_gemma":[0.0012250843,0.00047131084,0.000115361865,0.0070773545,0.00022708837,0.0008542234,0.001636235,0.0013013243,0.00007753668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022001286,0.000052199983,0.000023674032,0.000045654222,0.00000797835,0.000007968845,0.00067431864,0.07127923,0.000046512225,0.00017914736,0.29030043,0.63738066],"study_design_scores_gemma":[0.00017206755,0.00020064965,0.000039514493,0.0001732171,0.000006248761,0.000019331723,0.00000101954,0.8228055,0.0003194292,0.0040007727,0.17175,0.00051220454],"about_ca_topic_score_codex":0.00007688664,"about_ca_topic_score_gemma":0.000025065365,"teacher_disagreement_score":0.7515263,"about_ca_system_score_codex":0.0004468164,"about_ca_system_score_gemma":0.0014944527,"threshold_uncertainty_score":0.99977386},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030277919,0.00026886913,0.98410267,0.004810498,0.0012766063,0.0004640219,0.000016179374,0.00021242586,0.008818454],"genre_scores_gemma":[0.02228264,0.00006352248,0.96865517,0.0048834737,0.0006666426,0.000018450608,0.0000060215225,0.000055346325,0.0033687088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956696,0.00006147622,0.0004533573,0.0018374092,0.0011681409,0.0008100334],"domain_scores_gemma":[0.9969215,0.0005872004,0.000166372,0.0015891149,0.0003094889,0.0004263418],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006359543,0.0005181097,0.0004982359,0.00079821184,0.00029846132,0.0009126708,0.0041309935,0.00028410877,0.0001976326],"category_scores_gemma":[0.0001561123,0.00041933957,0.0001441678,0.00042773937,0.00036508983,0.00072026486,0.0022705232,0.00053729495,0.00030576356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000557282,0.000031809057,0.00007336378,0.000016806054,0.000021629528,0.000054784326,0.0030814495,0.032657947,0.0003078969,0.030871864,0.0002380877,0.93263876],"study_design_scores_gemma":[0.0005190184,0.00031423816,0.0001495783,0.0014539416,0.0000109475195,0.000025505336,4.841423e-7,0.692411,0.0011480639,0.281974,0.020591652,0.0014016203],"about_ca_topic_score_codex":0.000063108666,"about_ca_topic_score_gemma":0.000106431806,"teacher_disagreement_score":0.93123716,"about_ca_system_score_codex":0.00039074584,"about_ca_system_score_gemma":0.00060050626,"threshold_uncertainty_score":0.99982584},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009787672,0.000018804425,0.98753417,0.0011792672,0.00007191755,0.00082821806,0.0000012836563,0.000076323704,0.0005023616],"genre_scores_gemma":[0.69176996,0.000017999126,0.307084,0.0008513668,0.00012029055,0.000040858926,0.000022153232,0.000022213444,0.00007117012],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985449,0.000011020274,0.00033637462,0.0006139867,0.00029942696,0.00019429276],"domain_scores_gemma":[0.99913865,0.00016328927,0.00019641565,0.00029845798,0.00013367303,0.00006951995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003322856,0.00022539232,0.00024220899,0.0005919275,0.00012989275,0.000091833324,0.00008916874,0.00020727409,0.000005031913],"category_scores_gemma":[0.00025475043,0.0002210301,0.000027727863,0.00042465125,0.00009973252,0.00034758216,0.000051912186,0.00039086083,0.0000016268497],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003426446,0.00004022514,0.00045430468,0.00007117683,0.0000023241757,0.000003696037,0.00041679313,0.03239187,0.07534005,0.0021306972,0.000005461784,0.88910913],"study_design_scores_gemma":[0.00083799113,0.000708777,0.012035423,0.0029022156,0.000026388641,0.00012428925,0.0000025350826,0.37498888,0.4633281,0.14312267,0.00105744,0.00086527993],"about_ca_topic_score_codex":0.00003796365,"about_ca_topic_score_gemma":0.00005537066,"teacher_disagreement_score":0.88824385,"about_ca_system_score_codex":0.0004310621,"about_ca_system_score_gemma":0.00006130189,"threshold_uncertainty_score":0.9013346},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047953683,0.00047250304,0.98278046,0.00047256763,0.0021752845,0.00019985384,0.0000049833493,0.000117690586,0.013728688],"genre_scores_gemma":[0.035986982,0.00013508597,0.9341008,0.007879612,0.0031257877,0.000015344755,0.00006279476,0.00011143812,0.018582165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954951,0.000037836908,0.00054388586,0.0017275038,0.0015666123,0.00062908867],"domain_scores_gemma":[0.9970491,0.00010752085,0.00030802705,0.0017695341,0.00045178153,0.00031403496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011556438,0.0005151589,0.0005633761,0.0008271724,0.00021460882,0.0008988537,0.0033819189,0.00025002088,0.00027363666],"category_scores_gemma":[0.000027470865,0.00045363227,0.00017584843,0.00054320035,0.00029715357,0.00087555166,0.0013319612,0.00050345744,0.0004921023],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013875879,0.0001618658,0.00030832388,0.000040993804,0.00010021921,0.00018822265,0.004487812,0.021792382,0.0002093004,0.025902757,0.0043056114,0.9424886],"study_design_scores_gemma":[0.00034250482,0.00026144384,0.000025263162,0.00018749335,0.0000174626,0.000027335436,3.2601224e-7,0.91457325,0.00054172863,0.050338354,0.032866985,0.00081783347],"about_ca_topic_score_codex":0.000028775192,"about_ca_topic_score_gemma":0.000042818945,"teacher_disagreement_score":0.9416708,"about_ca_system_score_codex":0.00024773745,"about_ca_system_score_gemma":0.00044846887,"threshold_uncertainty_score":0.99979156},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024394145,0.0003366292,0.9947973,0.00096827344,0.0023232647,0.0009161438,0.0000021774083,0.00018115946,0.0002310956],"genre_scores_gemma":[0.119289204,0.000007861585,0.8794232,0.0005177974,0.00041453788,0.000068007874,0.0000012889774,0.000049095142,0.0002290248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957055,0.0000271315,0.00059411675,0.0013463915,0.0012654703,0.0010614287],"domain_scores_gemma":[0.99272674,0.005081108,0.00023636267,0.0015511776,0.00026696554,0.00013763846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025141116,0.00046890136,0.000482475,0.0010739967,0.00031236274,0.00063361845,0.005331927,0.00022056769,0.00000444222],"category_scores_gemma":[0.0018810557,0.00033778453,0.00011722582,0.0018227957,0.00044387428,0.0005996842,0.0018110787,0.00074008096,0.00001839496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007444932,0.000018729823,0.002214341,0.00011385316,0.0000138749965,0.000036658355,0.000514483,0.07806757,0.00005476581,0.003928965,0.00004980116,0.9149795],"study_design_scores_gemma":[0.00046182182,0.00010276832,0.0016219852,0.0022459459,0.000004203346,0.000021375668,1.7304129e-7,0.95526195,0.0004439336,0.03865958,0.00051287387,0.0006634063],"about_ca_topic_score_codex":0.000011490721,"about_ca_topic_score_gemma":0.000017407852,"teacher_disagreement_score":0.9143161,"about_ca_system_score_codex":0.000680588,"about_ca_system_score_gemma":0.000387334,"threshold_uncertainty_score":0.99990743},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.512265e-8,0.4940689,0.5041813,0.000029649795,0.0002172544,0.00039987432,3.8245767e-7,0.000060464252,0.0010421618],"genre_scores_gemma":[0.000004593528,0.6065212,0.39292186,0.0004693823,0.000057554455,0.00001339106,0.0000014448108,0.00000818779,0.0000023801388],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.99605584,0.0001238369,0.0017162735,0.00080496335,0.0007204937,0.00057856785],"domain_scores_gemma":[0.99669564,0.00045970906,0.0009519301,0.0015115283,0.0002476523,0.00013352715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025620519,0.0005015883,0.00178402,0.0009099181,0.00014175662,0.0003069591,0.0046029906,0.00014805477,0.000012524855],"category_scores_gemma":[0.0002300963,0.0003774551,0.0003311921,0.003975062,0.00025187636,0.0006772205,0.0014123875,0.00043119534,0.00008476772],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.169341e-8,0.0000652894,3.622995e-8,0.1398493,0.0000072084013,0.0000040394534,0.00031516617,0.0000312007,1.5778594e-8,0.00795819,0.00004796492,0.8517215],"study_design_scores_gemma":[0.00015148176,0.000081985185,4.828315e-7,0.53811485,0.0000902196,0.0002254733,4.042942e-7,0.21332334,0.000012069801,0.043792285,0.2034095,0.0007979061],"about_ca_topic_score_codex":3.6917436e-7,"about_ca_topic_score_gemma":2.4165516e-7,"teacher_disagreement_score":0.8509236,"about_ca_system_score_codex":0.00017783465,"about_ca_system_score_gemma":0.00055666605,"threshold_uncertainty_score":0.99986774},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017610977,0.00008948785,0.9546462,0.00034675366,0.00096671324,0.0005511681,0.000003359759,0.00021509526,0.043163564],"genre_scores_gemma":[0.117492504,0.000009258309,0.8792764,0.0022187387,0.00045936918,0.000028299655,0.00003199509,0.000031419277,0.00045200565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973305,0.000027052227,0.0008504894,0.0007201038,0.00065882213,0.0004130217],"domain_scores_gemma":[0.99758863,0.00054395024,0.000535557,0.0007690783,0.0004573205,0.000105438165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011122789,0.00044157857,0.000415423,0.0011394937,0.0004614124,0.0009180191,0.0016159485,0.0002904204,0.0000036120134],"category_scores_gemma":[0.00012189043,0.00039066703,0.00015994984,0.00036817632,0.00019018726,0.0011811329,0.000112215304,0.00048352807,0.000024537783],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068148534,0.000038070444,5.2222947e-7,0.00014115566,0.00000264494,0.000001557556,0.0033796737,0.018748488,0.000019263562,0.079361215,0.000026818874,0.89827377],"study_design_scores_gemma":[0.00029296038,0.00022186244,0.000011362403,0.0009065994,0.0000052523988,0.000012910211,3.9834347e-7,0.8527893,0.0016292689,0.14217268,0.0015825204,0.00037488685],"about_ca_topic_score_codex":0.0000016913507,"about_ca_topic_score_gemma":0.000005377984,"teacher_disagreement_score":0.8978989,"about_ca_system_score_codex":0.00029226916,"about_ca_system_score_gemma":0.0006159292,"threshold_uncertainty_score":0.9998545},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002650925,0.000115403476,0.99529827,0.000373731,0.00003822913,0.0014122177,0.000062965424,0.000014156002,0.000034127886],"genre_scores_gemma":[0.069845796,0.00005713995,0.92982984,0.00007980279,0.00004018895,0.00006525274,0.0000051002953,0.000017412925,0.00005949246],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863684,0.0000118851285,0.00051648635,0.00040369696,0.0001890928,0.00024197352],"domain_scores_gemma":[0.99263763,0.006646696,0.0003003649,0.00024841467,0.00010499049,0.000061926796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009259547,0.00022503144,0.00039304464,0.000063664505,0.00030358846,0.00010742193,0.00028537159,0.00010848245,0.00000235869],"category_scores_gemma":[0.0008763171,0.00016134817,0.0000545635,0.000039811388,0.0015145253,0.00007501065,0.00015792892,0.00011971528,3.1295906e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016040403,0.000104321516,0.00012733346,0.00034096846,0.0000151777385,7.933242e-7,0.0005671858,0.0000034360469,0.0003768011,0.043132603,0.000006272559,0.9553091],"study_design_scores_gemma":[0.00016610135,0.00018867847,0.000607872,0.00036744509,0.00003860491,0.000015803029,0.0000021367891,0.0011909552,0.0011692522,0.99602073,0.000038228667,0.0001941749],"about_ca_topic_score_codex":6.9736404e-7,"about_ca_topic_score_gemma":0.0000040691207,"teacher_disagreement_score":0.9551149,"about_ca_system_score_codex":0.00005981256,"about_ca_system_score_gemma":0.000080246224,"threshold_uncertainty_score":0.65795875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015369478,0.0020659226,0.97726667,0.00091373216,0.0009052085,0.00046541492,0.0000015070682,0.00018834698,0.018039519],"genre_scores_gemma":[0.6675113,0.00031476453,0.3312914,0.00041819568,0.0002904171,0.000016295475,0.0000055649853,0.000041188625,0.00011085581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959638,0.000045099147,0.00048719608,0.0018790973,0.00087869575,0.00074607664],"domain_scores_gemma":[0.99795353,0.000361644,0.00028709345,0.0009785634,0.00023723472,0.00018190476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007495972,0.00060474325,0.0006184547,0.0009608633,0.00016598288,0.00036176285,0.0023036955,0.00033789637,0.000011680723],"category_scores_gemma":[0.00006260194,0.00049143605,0.0000934628,0.00058683765,0.00055712316,0.0006328185,0.00084241753,0.0008401861,0.00007226335],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009842826,0.000077949684,0.000102641265,0.00007465293,0.000008931983,0.00034137853,0.0034593358,0.08725466,0.000012834877,0.07356256,0.0000042174183,0.835091],"study_design_scores_gemma":[0.0017765367,0.00082390476,0.0048649185,0.0021128638,0.000010399029,0.00030724943,0.0000012104294,0.50306606,0.0005261228,0.48428002,0.0005856787,0.0016450636],"about_ca_topic_score_codex":0.00004655859,"about_ca_topic_score_gemma":0.0011268453,"teacher_disagreement_score":0.8334459,"about_ca_system_score_codex":0.0006012936,"about_ca_system_score_gemma":0.00076528743,"threshold_uncertainty_score":0.9997537},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000352989,0.00032999195,0.9895201,0.00065736595,0.0015841448,0.00047328242,0.0000018832143,0.00011355522,0.0069667385],"genre_scores_gemma":[0.53622293,0.000045874942,0.46197352,0.0006627995,0.0005772907,0.000015933127,0.000009554038,0.000044806347,0.00044731755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958814,0.00009870743,0.0007048942,0.0013161256,0.0013481724,0.0006507229],"domain_scores_gemma":[0.997558,0.0004371888,0.00046584153,0.000977547,0.00030534298,0.00025608987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021353555,0.00047435245,0.0005564173,0.0008703193,0.00020632608,0.00047758207,0.0015979075,0.0003749325,0.000019171446],"category_scores_gemma":[0.00041028086,0.00039784366,0.000092466275,0.00066630606,0.00022104802,0.0016350857,0.0010924569,0.0010345946,0.00007783999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004360732,0.00018330233,0.0015946516,0.00022686202,0.000024557892,0.000739685,0.021493908,0.042784967,0.00061555876,0.08665045,0.00034828944,0.8452942],"study_design_scores_gemma":[0.00047105152,0.00012648589,0.00069863565,0.0011936637,0.0000044375665,0.00015449832,0.0000027319054,0.97327006,0.0004185754,0.02091293,0.002098379,0.00064857485],"about_ca_topic_score_codex":0.00009440753,"about_ca_topic_score_gemma":0.00018430068,"teacher_disagreement_score":0.93048507,"about_ca_system_score_codex":0.00068188267,"about_ca_system_score_gemma":0.0008301752,"threshold_uncertainty_score":0.99984735},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008654654,0.00014005577,0.99699885,0.0004182699,0.0006893047,0.000580494,0.000018887333,0.0001148829,0.0009526932],"genre_scores_gemma":[0.08058114,0.000014225958,0.913885,0.00084864174,0.0005039333,0.000037043184,0.000038802114,0.00004082367,0.0040504048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514323,0.00002841059,0.00077294203,0.0021566977,0.0011414267,0.0007572653],"domain_scores_gemma":[0.99661005,0.00039155057,0.00047262583,0.0017865677,0.00053505023,0.00020416548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012847706,0.0005912928,0.00088408537,0.001925218,0.00036052102,0.00080335746,0.0031144726,0.00026393132,0.00008019375],"category_scores_gemma":[0.000082550985,0.00053062325,0.0005712037,0.0017118774,0.0004902372,0.00041105895,0.0010933803,0.0003331038,0.000042236294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017472561,0.00010955469,0.00008740081,0.000064279724,0.00062296214,0.000019345003,0.0025651082,0.8121271,0.00009128987,0.06306815,0.00024720415,0.120980136],"study_design_scores_gemma":[0.00023074684,0.00009561522,0.000032249714,0.00009393614,0.000202674,0.0000033993076,2.0808659e-7,0.8677264,0.00026369197,0.13057962,0.00023222325,0.0005392604],"about_ca_topic_score_codex":0.000010883941,"about_ca_topic_score_gemma":0.00014758423,"teacher_disagreement_score":0.12044088,"about_ca_system_score_codex":0.00034843606,"about_ca_system_score_gemma":0.00055616966,"threshold_uncertainty_score":0.99971455},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013693042,0.00044170654,0.99617606,0.00096755323,0.0004075975,0.00048442886,0.0000030328385,0.00012074355,0.0012619648],"genre_scores_gemma":[0.08848947,0.000041176547,0.91074616,0.00015663567,0.0002712484,0.000039179828,0.000001332397,0.000019378216,0.00023539126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667656,0.000025409241,0.00052010245,0.0015134007,0.00064661127,0.0006178907],"domain_scores_gemma":[0.9979317,0.00026337706,0.00017097751,0.0013134731,0.00018563475,0.0001347904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006382362,0.00035918338,0.00034014313,0.0005422263,0.00019791175,0.00025402816,0.0024943138,0.0002266905,0.000012960088],"category_scores_gemma":[0.000022014443,0.00030575873,0.00009464239,0.00060901506,0.00052090024,0.00050396455,0.0009007098,0.00051183463,0.000041136514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001289313,0.000033775697,0.00006832856,0.000014445225,0.0000020524199,0.000018273293,0.00021735109,0.26715884,0.000017181314,0.02604624,0.0000017760215,0.7064205],"study_design_scores_gemma":[0.00010008946,0.000032918073,0.00011929182,0.00016554842,0.0000013586503,0.00001778349,4.13899e-8,0.69653267,0.000032297583,0.30186966,0.0008427757,0.00028556839],"about_ca_topic_score_codex":0.000030689705,"about_ca_topic_score_gemma":0.0000475093,"teacher_disagreement_score":0.7061349,"about_ca_system_score_codex":0.00042296355,"about_ca_system_score_gemma":0.00046909656,"threshold_uncertainty_score":0.99993944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000971802,0.0011061296,0.991588,0.0005820538,0.0031465725,0.00069267285,0.0000044058847,0.00025095977,0.0026194688],"genre_scores_gemma":[0.0022102245,0.000090354755,0.9944545,0.001293397,0.0005993621,0.000039317816,0.00000504455,0.00003369034,0.0012741117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962085,0.000017942455,0.0005319598,0.001614682,0.000726541,0.0009003925],"domain_scores_gemma":[0.9970449,0.00074756687,0.0002839599,0.001396795,0.00035160393,0.00017514774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081529946,0.00054996443,0.00062191574,0.0006017521,0.00029735523,0.0008468198,0.003952284,0.0003550754,0.00003587437],"category_scores_gemma":[0.00017077457,0.00046806937,0.00018395315,0.00039034762,0.0005380603,0.0006438196,0.0013546034,0.00055334205,0.000110629495],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011040031,0.000013051679,0.00000743556,0.000021702615,0.000010400907,0.000021534264,0.00029230365,0.0023607258,0.000019140754,0.022446923,0.00014398604,0.9746617],"study_design_scores_gemma":[0.00016168146,0.00017231758,0.00002895672,0.0003108178,0.000008088036,0.000060795068,3.8848222e-7,0.79465914,0.002430759,0.19480805,0.0067624706,0.0005965409],"about_ca_topic_score_codex":0.000070154085,"about_ca_topic_score_gemma":0.000035722194,"teacher_disagreement_score":0.9740651,"about_ca_system_score_codex":0.00024994827,"about_ca_system_score_gemma":0.00046204263,"threshold_uncertainty_score":0.9997771},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000025019247,0.00023773705,0.99121845,0.00024258674,0.0029163924,0.0011092512,0.000036380738,0.00048355426,0.0037531666],"genre_scores_gemma":[0.00807009,0.000033575838,0.9901322,0.0006187734,0.0005281282,0.000057283698,0.00006505999,0.00009824911,0.00039661396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933017,0.0003113754,0.000860086,0.0031202484,0.0015312243,0.00087535963],"domain_scores_gemma":[0.9928492,0.0011160268,0.0009081969,0.0018837915,0.0027711764,0.00047163543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011779142,0.0010245836,0.0009078643,0.0019806304,0.00043750482,0.0006086601,0.003507674,0.00052709924,0.0000750925],"category_scores_gemma":[0.00060579216,0.0010271935,0.0001936182,0.0013654667,0.00077853235,0.005487675,0.0016393972,0.0016498396,0.000063068364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041703934,0.00010526585,0.000005987726,0.000007652959,0.000029818168,0.000056358316,0.0025030249,0.78075343,0.00004773421,0.0021200716,0.0000144233645,0.21431454],"study_design_scores_gemma":[0.00075048447,0.0004361275,0.000046215817,0.0002393663,0.000017268147,0.0001624977,0.000006400524,0.94802314,0.0007093848,0.048268203,0.0002883762,0.0010525173],"about_ca_topic_score_codex":0.000062166575,"about_ca_topic_score_gemma":0.00004657823,"teacher_disagreement_score":0.213262,"about_ca_system_score_codex":0.0031026448,"about_ca_system_score_gemma":0.001383465,"threshold_uncertainty_score":0.99921787},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010036687,0.00038919284,0.970725,0.002586384,0.0025378636,0.00039726662,0.000002307939,0.00021948603,0.023132442],"genre_scores_gemma":[0.55591196,0.00046433852,0.40665802,0.010277809,0.002188299,0.00010432016,0.0000075181656,0.00014024173,0.024247479],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963622,0.000033183074,0.0004979242,0.0014448348,0.0010760939,0.0005857387],"domain_scores_gemma":[0.99734074,0.00017760102,0.00021513659,0.001932181,0.000146564,0.00018777192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006361891,0.0004282661,0.00039419718,0.00075922057,0.00018813307,0.0005378408,0.004092379,0.00021213289,0.000050496492],"category_scores_gemma":[0.000016531452,0.00033379663,0.00013014916,0.0003756787,0.00037270883,0.000490858,0.0014304497,0.00031225116,0.00038166784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017980359,0.000022142403,0.000012684011,0.000030059315,0.00001546952,0.000073893985,0.0038110204,0.000027661214,0.000034583565,0.18770316,0.00013304959,0.8081345],"study_design_scores_gemma":[0.00076671725,0.00015239192,0.00016566161,0.0014972301,0.000010859561,0.000104016064,4.9947585e-7,0.1985303,0.0008647745,0.6517946,0.14438869,0.0017242657],"about_ca_topic_score_codex":0.000004896505,"about_ca_topic_score_gemma":0.000021438642,"teacher_disagreement_score":0.8064102,"about_ca_system_score_codex":0.00026853706,"about_ca_system_score_gemma":0.00015142147,"threshold_uncertainty_score":0.9999114},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022934475,0.00025925774,0.98876476,0.0018851958,0.0027716444,0.0012551799,0.000042606527,0.00047501433,0.0043170117],"genre_scores_gemma":[0.034118135,0.000019428919,0.9630043,0.000725755,0.001445314,0.000071047536,0.00002250626,0.000068457,0.0005250401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935329,0.0000791769,0.0010739753,0.0027917288,0.001326538,0.0011956731],"domain_scores_gemma":[0.9960756,0.0006195503,0.0005795027,0.0019350817,0.00036742413,0.00042285208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010965002,0.00091217563,0.00091293803,0.0016064887,0.00061496417,0.0008829991,0.0041813315,0.00044241908,0.00006251097],"category_scores_gemma":[0.00012134404,0.0007718617,0.00024969943,0.0015218614,0.0009082036,0.00088325364,0.0017437052,0.00097185717,0.00008452161],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010387652,0.00004303599,0.000012480217,0.000029426918,0.0000332787,0.000054687265,0.0027418411,0.003312626,0.0014878776,0.028772753,0.000023582552,0.963478],"study_design_scores_gemma":[0.00057051313,0.00021270804,0.00003737367,0.0020199693,0.000014728376,0.00010830808,0.0000013839262,0.6260992,0.00246045,0.36494505,0.0023104448,0.0012198485],"about_ca_topic_score_codex":0.00007442322,"about_ca_topic_score_gemma":0.000093542876,"teacher_disagreement_score":0.96225816,"about_ca_system_score_codex":0.00046970506,"about_ca_system_score_gemma":0.00054647273,"threshold_uncertainty_score":0.9994732},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037235042,0.0004303497,0.99486506,0.0008238982,0.0003886228,0.00038380563,7.85731e-7,0.00033648396,0.0023986273],"genre_scores_gemma":[0.33490658,0.000058747908,0.6611282,0.0029611504,0.0007081255,0.0000064775495,0.0000026995926,0.000038468283,0.00018954133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666595,0.00003575991,0.00048281837,0.001474815,0.00074023736,0.00060043467],"domain_scores_gemma":[0.9983112,0.00017473272,0.00029107276,0.0008194059,0.00023795107,0.00016562811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009177875,0.00052385905,0.00047535883,0.00068530353,0.00033222497,0.0009437764,0.0020260103,0.0003789038,0.000010392718],"category_scores_gemma":[0.000033810127,0.00049029215,0.000084274616,0.0005363223,0.0006325674,0.0011822184,0.0013238734,0.0011834976,0.0000074134473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002544202,0.000012478459,0.00004085225,0.000016549035,0.0000025429392,0.000033828685,0.0010776095,0.054665845,0.000043926102,0.0018454607,0.000009193046,0.9422492],"study_design_scores_gemma":[0.00013444117,0.000116289375,0.00015663552,0.00025907968,0.000004575711,0.0001351387,2.403323e-7,0.9837934,0.0002770289,0.013993051,0.0005950816,0.00053505995],"about_ca_topic_score_codex":0.000011984725,"about_ca_topic_score_gemma":0.000049322305,"teacher_disagreement_score":0.9417141,"about_ca_system_score_codex":0.00016938987,"about_ca_system_score_gemma":0.00025333872,"threshold_uncertainty_score":0.99975485},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010510268,0.0004859182,0.9923605,0.0020020173,0.0010223277,0.00067493605,0.00002229935,0.0001571888,0.0031697103],"genre_scores_gemma":[0.3821524,0.00013084365,0.6161139,0.00044834433,0.00062462274,0.000036815833,0.000024896442,0.000025159361,0.00044299598],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834764,0.000028276061,0.00028402198,0.00046534583,0.00041379832,0.00046094673],"domain_scores_gemma":[0.9977791,0.0009659063,0.00023247823,0.0006091643,0.000287658,0.00012575078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065941643,0.00021373724,0.00026335233,0.00035172483,0.00055311376,0.00035033782,0.0012227974,0.0006021717,0.000053325715],"category_scores_gemma":[0.001126935,0.00021084813,0.00006499636,0.00040428987,0.0013469629,0.0004460311,0.00030395645,0.00052395137,0.00003052423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040539703,0.000032946406,0.00024724536,0.0000088519155,0.0000056176154,7.9817045e-7,0.0057323063,0.00008757906,0.0000118143425,0.19799957,0.000012646021,0.7958566],"study_design_scores_gemma":[0.0007160491,0.00014987595,0.0002363781,0.0005278358,0.000027874688,0.0000041315457,0.000051327494,0.075059205,0.00042946482,0.71109223,0.2104622,0.0012434232],"about_ca_topic_score_codex":0.000042451455,"about_ca_topic_score_gemma":0.0012800146,"teacher_disagreement_score":0.7946132,"about_ca_system_score_codex":0.0002932274,"about_ca_system_score_gemma":0.0005618057,"threshold_uncertainty_score":0.8598137},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062658176,0.000050193357,0.9344959,0.0015407731,0.0004692038,0.0006499391,0.0000027356427,0.000105778934,0.00002726936],"genre_scores_gemma":[0.637167,0.0000019182783,0.36226153,0.00043417033,0.00009150107,0.00003173615,7.8158996e-7,0.00000835127,0.0000030603755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976102,0.00008016014,0.00023930454,0.0011324775,0.00032944942,0.00060840603],"domain_scores_gemma":[0.9978901,0.00092364085,0.000090838,0.0005371759,0.0003417529,0.00021648925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006214854,0.0002910543,0.00031740914,0.00038802408,0.0005281507,0.0005828477,0.0011534244,0.0000850153,5.174227e-7],"category_scores_gemma":[0.00018900269,0.0002545987,0.000068603986,0.0012713004,0.0002597882,0.0009985585,0.0005724428,0.00027883195,0.0000070949973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065597684,0.00013324324,0.0010383826,0.000060047867,0.0000113025235,0.000014925545,0.016824251,0.47657594,0.0070778774,0.0009207566,0.000031978157,0.4972457],"study_design_scores_gemma":[0.00036488698,0.00073745375,0.001536078,0.00009682319,0.0000029035739,0.00005469159,0.0000011433606,0.982575,0.0020300203,0.012201204,0.000070429356,0.000329343],"about_ca_topic_score_codex":0.00001909596,"about_ca_topic_score_gemma":0.000026220183,"teacher_disagreement_score":0.5745088,"about_ca_system_score_codex":0.00012838184,"about_ca_system_score_gemma":0.00023439109,"threshold_uncertainty_score":0.99999064},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069227826,0.0004840597,0.9919973,0.0005003993,0.0018337056,0.0003176168,0.0000025205627,0.00035896362,0.0038131687],"genre_scores_gemma":[0.26528427,0.000016096346,0.7306411,0.0018349316,0.0013480787,0.0000063111697,0.000017178623,0.00005041079,0.0008016035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597204,0.00008561849,0.00069419533,0.0018253346,0.00065483537,0.00076796784],"domain_scores_gemma":[0.9971635,0.0008504615,0.00040728983,0.0012417319,0.00017345151,0.00016361338],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012181451,0.00050828815,0.00056007935,0.0008775475,0.00049548026,0.0011178084,0.0030736984,0.00035255382,0.000004207786],"category_scores_gemma":[0.0000860626,0.0005281714,0.000094696465,0.0011273648,0.000709147,0.0005630526,0.0017951325,0.000915484,0.000024468542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028043453,0.000051947893,0.00029981733,0.00008895725,0.000011960993,0.00005248771,0.0014975165,0.072884254,0.000062940584,0.020845428,0.0007058901,0.90349597],"study_design_scores_gemma":[0.00026762008,0.00005781051,0.001114642,0.00026581655,0.000005028975,0.00009654701,1.4064477e-7,0.94507647,0.0002317978,0.048434503,0.0038490547,0.0006005768],"about_ca_topic_score_codex":0.00004916064,"about_ca_topic_score_gemma":0.000026896414,"teacher_disagreement_score":0.9028954,"about_ca_system_score_codex":0.00057302887,"about_ca_system_score_gemma":0.0011412441,"threshold_uncertainty_score":0.9999191},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007660348,0.0008037058,0.99264663,0.0013492426,0.0029463258,0.0002938545,0.000003766541,0.00021532674,0.0009751009],"genre_scores_gemma":[0.60127395,0.000047230213,0.39168674,0.003941676,0.0015522232,0.000009096666,0.000023033343,0.00006050634,0.0014055489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960577,0.000041806597,0.0004887366,0.0013962922,0.0012043266,0.000811157],"domain_scores_gemma":[0.9977438,0.00027483903,0.00028573757,0.0011838278,0.00018770008,0.00032410014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007707509,0.0005476084,0.0004775814,0.00083275867,0.00034252353,0.00030771914,0.0025365902,0.00034158272,0.00002981831],"category_scores_gemma":[0.000046393474,0.0005018873,0.00017230918,0.0005638517,0.00051027455,0.0009368729,0.0019949805,0.0006965405,0.00017068117],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005964792,0.000038016373,0.000021156646,0.000024402863,0.0000108172535,0.000043649667,0.000501293,0.033182554,0.00053281535,0.054822613,0.0001547395,0.910662],"study_design_scores_gemma":[0.00029490484,0.00011343753,0.00017314697,0.0002607697,0.000008174422,0.00006930884,4.45125e-8,0.7503235,0.0019893367,0.24322286,0.002840512,0.00070399494],"about_ca_topic_score_codex":0.000026463827,"about_ca_topic_score_gemma":0.000016763326,"teacher_disagreement_score":0.909958,"about_ca_system_score_codex":0.00038737842,"about_ca_system_score_gemma":0.00046743144,"threshold_uncertainty_score":0.9997433},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059034955,0.00020464319,0.99189043,0.0006223685,0.0006864013,0.00039439928,7.569295e-7,0.00029574675,0.0000017736319],"genre_scores_gemma":[0.44662791,0.0000041076073,0.5524295,0.0007312515,0.00018425976,0.000008662475,0.000002423542,0.00001136674,5.250603e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977135,0.00009985073,0.00024863073,0.00068202394,0.00048385444,0.00077213673],"domain_scores_gemma":[0.99812543,0.000742645,0.00018290561,0.0005292158,0.00028674983,0.00013303803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010284097,0.00026430748,0.00025210832,0.00037284533,0.00054468366,0.0004092936,0.0011131715,0.00018349315,0.0000032041316],"category_scores_gemma":[0.000580181,0.00023125572,0.00006890078,0.0027150216,0.00015565623,0.0016969478,0.0003894226,0.0005394366,0.0000014159907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006984984,0.000030013434,0.00025816166,0.00001617959,0.0000013871825,0.0000015105885,0.00046160156,0.8105318,0.0013283673,0.0004869603,0.0000017022595,0.18687531],"study_design_scores_gemma":[0.00019842687,0.00010918207,0.00016414313,0.00018505694,0.0000037679085,0.000010775155,0.0000013067416,0.9423176,0.041814316,0.01476988,0.00012591435,0.00029962027],"about_ca_topic_score_codex":0.000035850495,"about_ca_topic_score_gemma":0.000002663553,"teacher_disagreement_score":0.44072443,"about_ca_system_score_codex":0.0002360152,"about_ca_system_score_gemma":0.00020282903,"threshold_uncertainty_score":0.94303346},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002336018,0.00013322334,0.9952167,0.00021559522,0.0008250813,0.00095592724,0.000004334761,0.0001163686,0.0025304216],"genre_scores_gemma":[0.0516455,0.00002603601,0.947151,0.0003522219,0.00016519937,0.000041883697,0.000008463526,0.000031521755,0.00057817827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753064,0.000028035862,0.0005277076,0.0008352786,0.00066891545,0.00040939552],"domain_scores_gemma":[0.99777204,0.00034639103,0.00033731083,0.00074659137,0.0006774185,0.00012026952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007696428,0.00027527034,0.0004213607,0.0006599684,0.0001862378,0.00034164524,0.0018332927,0.00021811549,0.0000118395],"category_scores_gemma":[0.00008279032,0.0002503926,0.00009634686,0.00056940905,0.0002667146,0.0005092365,0.0005233264,0.0002080662,0.000016897999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024765463,0.000012829936,0.000008983755,0.00023686269,0.000007037772,0.0000030101285,0.00039898828,0.7003196,0.00006116979,0.17710543,0.000052263196,0.12179137],"study_design_scores_gemma":[0.00022264766,0.00012393341,0.0000028801594,0.00055804517,0.0000035764792,0.000010776296,2.3519722e-7,0.97632295,0.0009136962,0.020990813,0.00059813645,0.0002523232],"about_ca_topic_score_codex":0.000013535782,"about_ca_topic_score_gemma":0.000008954948,"teacher_disagreement_score":0.27600336,"about_ca_system_score_codex":0.00024429886,"about_ca_system_score_gemma":0.00042684644,"threshold_uncertainty_score":0.9999948},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000469893,0.00032965,0.9954942,0.00041662063,0.0014477273,0.0005339072,0.000045173903,0.00017004817,0.0015156746],"genre_scores_gemma":[0.061709393,0.00011034002,0.93692565,0.00033244878,0.0005240553,0.00001554563,0.000027006672,0.00008161232,0.00027393195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928166,0.00010556718,0.000988429,0.002868698,0.0020084279,0.0012122234],"domain_scores_gemma":[0.9897041,0.0015366061,0.00038516382,0.0075732465,0.00039364124,0.00040727408],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013923887,0.0007270021,0.0010342465,0.001086668,0.00022961857,0.00034844215,0.020106941,0.00045562486,0.000037368893],"category_scores_gemma":[0.0008085124,0.000667838,0.00015649795,0.0009387565,0.0016352725,0.0012217851,0.025887523,0.00181799,0.0000298381],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023634315,0.00006609156,0.000037787995,0.00012673592,0.000030121588,0.00029603843,0.00081909617,0.009335771,0.000115804585,0.0043804506,0.000029474108,0.984739],"study_design_scores_gemma":[0.00040236086,0.0002831987,0.00008378962,0.00027314626,0.000008209276,0.00013543919,1.6559139e-7,0.8173631,0.0005055427,0.17996727,0.00035442482,0.0006233517],"about_ca_topic_score_codex":0.00008863229,"about_ca_topic_score_gemma":0.00007034693,"teacher_disagreement_score":0.98411566,"about_ca_system_score_codex":0.00032335328,"about_ca_system_score_gemma":0.0007865429,"threshold_uncertainty_score":0.9995773},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000057561633,0.0008175067,0.99399924,0.0019824603,0.00010688645,0.0025405788,0.00001758221,0.00013325135,0.00039671728],"genre_scores_gemma":[0.10905987,0.00002247515,0.88916063,0.00025253597,0.0003620683,0.00082690665,0.0000034359703,0.000029818395,0.00028223702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970292,0.000024490246,0.00041210424,0.0013062326,0.0006168132,0.0006112022],"domain_scores_gemma":[0.9973071,0.0007516859,0.00026454113,0.0012112458,0.000334213,0.00013118761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004974686,0.00039889693,0.000312021,0.0002630328,0.0007606016,0.00040956694,0.0029095442,0.00015805161,0.000003891107],"category_scores_gemma":[0.000011574873,0.00023664965,0.000120719786,0.00048105908,0.00091850274,0.00022274474,0.00022892527,0.00033970352,0.000007829475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037910404,0.00004533781,0.0000045272336,0.000017571632,0.000017428742,0.0000014841274,0.0001666428,0.31257826,0.000025245676,0.026470987,0.000006876154,0.6606618],"study_design_scores_gemma":[0.00044119856,0.00020827733,0.00010480823,0.00008727262,0.000026972237,0.00006068914,2.7984098e-7,0.9665823,0.000024167251,0.029858071,0.0022093372,0.00039665087],"about_ca_topic_score_codex":0.000003882759,"about_ca_topic_score_gemma":0.000012990568,"teacher_disagreement_score":0.6602652,"about_ca_system_score_codex":0.0001499159,"about_ca_system_score_gemma":0.0006443514,"threshold_uncertainty_score":0.96502924},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035544464,0.0027062276,0.9853127,0.001001319,0.0037007285,0.0007640428,0.00012714292,0.00071035844,0.0053220475],"genre_scores_gemma":[0.39776513,0.0002553979,0.5981,0.0016726502,0.0018518815,0.000049272818,0.00012380067,0.00011420757,0.00006765218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99253416,0.00014821427,0.00096767925,0.002950216,0.0021774848,0.0012222618],"domain_scores_gemma":[0.9943623,0.0007664821,0.00024506781,0.0033023471,0.00064319454,0.00068058964],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021237766,0.000976155,0.0011509658,0.001466158,0.0004217743,0.0020216976,0.00718189,0.0006918598,0.00008362651],"category_scores_gemma":[0.000116609786,0.0008795719,0.00038196318,0.0015507811,0.0006785072,0.0020602178,0.0015655386,0.0013535352,0.00014951738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010082468,0.00046096437,0.00024684402,0.00019093641,0.00025190637,0.00047861744,0.010295266,0.0036236702,0.0004164677,0.5500344,0.001681713,0.43221837],"study_design_scores_gemma":[0.0033881045,0.00047575153,0.00010430819,0.0007740577,0.00007514208,0.00018102156,0.0000019304691,0.19190718,0.001187636,0.7253141,0.073777184,0.002813626],"about_ca_topic_score_codex":0.00019025593,"about_ca_topic_score_gemma":0.00044017183,"teacher_disagreement_score":0.42940477,"about_ca_system_score_codex":0.00038452444,"about_ca_system_score_gemma":0.0015627814,"threshold_uncertainty_score":0.9993655},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013468425,0.0007824934,0.9939736,0.00021650485,0.0025084345,0.0006875326,0.00000678064,0.00026993288,0.0014200478],"genre_scores_gemma":[0.041924104,0.00009105888,0.95617074,0.00039578974,0.0006500689,0.000028882563,0.000008558767,0.000066592176,0.00066421623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950004,0.00009000287,0.00063941366,0.0016469948,0.0016731035,0.00095007685],"domain_scores_gemma":[0.9967722,0.00027053533,0.00034015434,0.0015011868,0.0006783271,0.00043759443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015696188,0.00060383475,0.0006257731,0.0011511502,0.0004264178,0.0009834869,0.0036611254,0.00037375724,0.000035259174],"category_scores_gemma":[0.0000821879,0.00056712795,0.00015540271,0.00082077377,0.00049157534,0.0011429284,0.0019433277,0.0011684881,0.00004584644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004023394,0.000030009725,0.0001833609,0.000026295267,0.000015581978,0.000057486926,0.0013853299,0.7654031,0.000114018345,0.0015162512,0.000034102897,0.23123047],"study_design_scores_gemma":[0.00040944893,0.00022912287,0.000022516577,0.00036249118,0.000009849231,0.00006101024,9.1838666e-7,0.9315049,0.00026576247,0.06510577,0.0012670847,0.0007611351],"about_ca_topic_score_codex":0.000075072894,"about_ca_topic_score_gemma":0.000021732525,"teacher_disagreement_score":0.23046933,"about_ca_system_score_codex":0.00058328855,"about_ca_system_score_gemma":0.0008744312,"threshold_uncertainty_score":0.999678},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020227856,0.00055982685,0.99598444,0.0000146571,0.00016674957,0.00008509249,3.5785328e-7,0.00015718577,0.0010089395],"genre_scores_gemma":[0.98214865,0.000038447375,0.017588185,0.000075102864,0.00009279203,0.000004794988,0.000006819618,0.000019476918,0.00002576247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987284,0.000029087383,0.0002347131,0.00041323918,0.00035124097,0.00024331575],"domain_scores_gemma":[0.99959296,0.00006893751,0.000042181087,0.00015847282,0.000037070877,0.00010038763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004914911,0.00020703103,0.00029473368,0.0004209538,0.00006523002,0.000101708596,0.00020541495,0.00012223829,0.000009978171],"category_scores_gemma":[0.00012539311,0.00017806569,0.000028611546,0.00038438628,0.00025554144,0.000106663196,0.000089188994,0.00060975144,0.0000046574564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.8663033e-7,0.0000032587416,0.0001836646,0.000036057125,0.0000022762338,0.00001627998,0.00020590346,0.5490294,0.00002178737,0.00001162306,8.537706e-7,0.4504887],"study_design_scores_gemma":[0.00011359187,0.00002169679,0.0001388807,0.00015373163,0.000010125787,0.00004914457,0.0000010180021,0.99683636,0.000031585398,0.0023715277,0.00007765833,0.00019467821],"about_ca_topic_score_codex":0.000015159809,"about_ca_topic_score_gemma":0.000040069932,"teacher_disagreement_score":0.98012584,"about_ca_system_score_codex":0.00015432434,"about_ca_system_score_gemma":0.000030527375,"threshold_uncertainty_score":0.72613084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027364973,0.00017364738,0.9953573,0.0002443027,0.0025316488,0.00031699485,0.00039729,0.00012624834,0.00057892804],"genre_scores_gemma":[0.106473014,0.000041057978,0.89012516,0.000763202,0.0014857621,0.0000071881664,0.0008458116,0.00005209784,0.00020671105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99516845,0.00006221228,0.00077920244,0.0023638972,0.0010254264,0.0006008164],"domain_scores_gemma":[0.99295795,0.0013521187,0.0005927787,0.004801978,0.00015741384,0.00013777037],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013391626,0.0005447683,0.0006649006,0.000728359,0.00015126237,0.00057202304,0.010802563,0.00012294324,0.000021141397],"category_scores_gemma":[0.0005463839,0.00048822275,0.00007090771,0.00046228262,0.0005467918,0.0009572013,0.011770948,0.0004836945,0.000017487924],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029255407,0.000023240897,0.00031254478,0.0001158208,0.000020415802,0.00006161753,0.00022713498,0.0028681145,0.00003364061,0.0045193103,0.0000901896,0.991725],"study_design_scores_gemma":[0.00028259665,0.00011098441,0.00022975336,0.0021007839,0.000029489735,0.00001133808,6.5291164e-7,0.97145927,0.0002664088,0.021592878,0.0031789425,0.00073687464],"about_ca_topic_score_codex":0.0004265238,"about_ca_topic_score_gemma":0.000561407,"teacher_disagreement_score":0.9909882,"about_ca_system_score_codex":0.00009877768,"about_ca_system_score_gemma":0.00030059318,"threshold_uncertainty_score":0.99975693},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005354854,0.00030823934,0.99590206,0.0011357758,0.0009322458,0.000098460485,0.00046168364,0.000078698846,0.0010292911],"genre_scores_gemma":[0.38732803,0.00035124592,0.6059947,0.0008991851,0.0014039984,0.000006611319,0.00029487215,0.00006351516,0.0036578209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640083,0.000030431895,0.0005354487,0.0016267622,0.0009655506,0.0004409986],"domain_scores_gemma":[0.994934,0.0005812284,0.0003943531,0.0038076509,0.00018659669,0.00009612613],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007534345,0.00036706124,0.0005666949,0.0006705684,0.00018267105,0.0004636998,0.008026428,0.00018469762,0.000012415314],"category_scores_gemma":[0.00016790145,0.00027489342,0.00011237919,0.0005385575,0.0010001644,0.0022457535,0.0054901685,0.0003580401,0.000029633298],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008921672,0.00006784962,0.0012433032,0.00007713599,0.0001301127,0.00010369841,0.00046639476,0.0066244947,0.0005080267,0.10700961,0.00049120054,0.88326925],"study_design_scores_gemma":[0.00075677375,0.0003514636,0.001230086,0.0024090477,0.00010958311,0.00011283025,6.1671983e-7,0.78758013,0.0023774698,0.18245508,0.020562334,0.002054612],"about_ca_topic_score_codex":0.00001941827,"about_ca_topic_score_gemma":0.0000668256,"teacher_disagreement_score":0.8812146,"about_ca_system_score_codex":0.00010913587,"about_ca_system_score_gemma":0.0006060858,"threshold_uncertainty_score":0.9999703},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028154843,0.00022794407,0.9948048,0.0001450033,0.0008938765,0.00037840693,0.000007034356,0.00012453875,0.00060293917],"genre_scores_gemma":[0.84672296,0.00003532031,0.15270048,0.00006136589,0.00021795617,0.00002316098,0.000014575485,0.00002531182,0.00019884021],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969869,0.000026613947,0.0006061419,0.0012475896,0.0006760596,0.00045667563],"domain_scores_gemma":[0.997462,0.00033453322,0.0005465607,0.00097625545,0.000573317,0.00010734309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009582885,0.00036713658,0.00060196203,0.001204037,0.00018125567,0.00029924544,0.0018715783,0.00030916897,0.0000033051801],"category_scores_gemma":[0.00013180157,0.0003595267,0.00019799697,0.0011036966,0.0004405972,0.0009882654,0.0007701952,0.0005139484,0.000004842428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020779184,0.000012239657,0.0006944352,0.00007998843,0.000043266475,0.0000030181945,0.0006135145,0.2582245,0.0012981748,0.00032985705,0.0000024676626,0.7386778],"study_design_scores_gemma":[0.0002292887,0.00047595415,0.0005120199,0.00010033806,0.000043320753,0.000019426088,6.4233876e-7,0.9914723,0.0011133787,0.0054071303,0.00026118453,0.00036499382],"about_ca_topic_score_codex":0.000005104793,"about_ca_topic_score_gemma":0.000022680013,"teacher_disagreement_score":0.84390754,"about_ca_system_score_codex":0.00043028835,"about_ca_system_score_gemma":0.00040607355,"threshold_uncertainty_score":0.9998857},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049959132,0.00005855557,0.9860536,0.00007256913,0.00280074,0.00042617432,0.000007477411,0.00006957958,0.00551541],"genre_scores_gemma":[0.5277611,0.0000027377696,0.46800938,0.00028352288,0.00070703827,0.000051138915,0.0001149426,0.00007622873,0.0029938985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974372,0.00024572696,0.00037214832,0.0010730309,0.00045066857,0.00042123205],"domain_scores_gemma":[0.9984823,0.0005783801,0.00031196987,0.00046353138,0.00009534993,0.000068498164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023261344,0.00034603887,0.00037010785,0.0003518861,0.000410328,0.00017666702,0.000904592,0.00025219854,0.0000904453],"category_scores_gemma":[0.000207059,0.0003355108,0.000052788233,0.00018160297,0.0003528983,0.0007118081,0.0003214921,0.0012669248,0.000028442128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063876425,0.000024687752,0.00006911192,0.0000064183405,0.00001744989,0.0000051589413,0.0038943775,0.49206463,0.00009935419,0.0067552384,0.00000409561,0.4969956],"study_design_scores_gemma":[0.0022761852,0.0013715043,0.0044725556,0.00033914746,0.00003513215,0.00006313214,0.000017383203,0.66660184,0.00007976585,0.20615017,0.11711101,0.0014821611],"about_ca_topic_score_codex":0.000030998955,"about_ca_topic_score_gemma":0.000008046787,"teacher_disagreement_score":0.5227652,"about_ca_system_score_codex":0.000370151,"about_ca_system_score_gemma":0.0001193989,"threshold_uncertainty_score":0.9999097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040802476,0.00007911137,0.9923786,0.001092443,0.0039167176,0.00045103012,0.000030168034,0.000060003727,0.0015838842],"genre_scores_gemma":[0.87340176,0.000027659464,0.112072945,0.0010654626,0.0017047564,0.00007847979,0.000042036958,0.00007207576,0.011534809],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995687,0.000117480544,0.0008857752,0.001277166,0.0016375075,0.0003950797],"domain_scores_gemma":[0.9963325,0.0010918415,0.00045879532,0.0011299307,0.0008034742,0.00018342808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004413648,0.00033607558,0.00047553232,0.001372925,0.0003181308,0.00033357405,0.0017831405,0.0003742053,0.00020339272],"category_scores_gemma":[0.0016407822,0.0002895173,0.00011991116,0.0014638001,0.0009640337,0.0006448269,0.00049679645,0.00076517224,0.00038962727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004835401,0.00031613643,0.0010374093,0.000014143274,0.000011603877,0.00008171914,0.0024710288,0.1004928,0.0002494426,0.13011734,0.001838023,0.763322],"study_design_scores_gemma":[0.0007680796,0.00008013769,0.0004827149,0.000099841,0.000009542165,0.00004567357,0.000004132632,0.06703121,0.00028035042,0.8964722,0.034207635,0.0005184754],"about_ca_topic_score_codex":0.000023565275,"about_ca_topic_score_gemma":0.00018584766,"teacher_disagreement_score":0.88030565,"about_ca_system_score_codex":0.00046203885,"about_ca_system_score_gemma":0.0004972433,"threshold_uncertainty_score":0.9999557},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15865988,0.000018811903,0.8328416,0.006303672,0.0015701791,0.0004942905,0.0000044640815,0.000087385444,0.000019774683],"genre_scores_gemma":[0.9816505,0.0000025086624,0.013885971,0.0038756365,0.00039152912,0.00017263554,0.0000028873426,0.000011499478,0.0000068443965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978689,0.000044550055,0.00025207645,0.0009895199,0.0004372853,0.00040765974],"domain_scores_gemma":[0.9943127,0.00491666,0.00008173947,0.00044963634,0.00017623045,0.00006300089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005544009,0.00015179078,0.00014651402,0.00021731072,0.0005258115,0.00026963564,0.0004615949,0.000054116073,0.000014208423],"category_scores_gemma":[0.005462909,0.00014206875,0.00005710958,0.0013207488,0.00041774378,0.0005999426,0.00021048343,0.00016133445,0.00004542716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049855327,0.00019661969,0.015899139,0.000058262412,0.0000092033,0.0000028995748,0.00044877254,0.21368743,0.34705245,0.010716815,0.0015160023,0.41036254],"study_design_scores_gemma":[0.00020175015,0.000058401984,0.042886525,0.000018721612,0.0000021994438,0.000016054164,0.000001139057,0.88167334,0.040994264,0.033783566,0.00016403368,0.00019997753],"about_ca_topic_score_codex":0.000023733539,"about_ca_topic_score_gemma":0.000053702926,"teacher_disagreement_score":0.8229906,"about_ca_system_score_codex":0.00028497123,"about_ca_system_score_gemma":0.000098924385,"threshold_uncertainty_score":0.65400076},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007583503,0.00022487612,0.9887125,0.0007425289,0.0015454568,0.00028893503,0.000031952375,0.00016808543,0.0075273393],"genre_scores_gemma":[0.7833977,0.0001214261,0.21262495,0.0029760082,0.00038814114,0.000016498263,0.000014598771,0.000040967225,0.0004197234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995349,0.000048967584,0.00070324657,0.00182194,0.0012261417,0.00085073954],"domain_scores_gemma":[0.9965617,0.00047170382,0.000365815,0.0020043538,0.00035789903,0.00023852458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093530974,0.00059924216,0.0007036324,0.002472679,0.00042608273,0.0007620959,0.0035938956,0.00029132288,0.00017218053],"category_scores_gemma":[0.00003895992,0.00047915865,0.0004543489,0.0021761167,0.00076995,0.0007353518,0.0009524187,0.00055981486,0.00007163554],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010190834,0.000109425564,0.0015260344,0.000036930815,0.00041568273,0.00019976479,0.0027367421,0.010974616,0.00057787,0.122626506,0.00023391674,0.8605523],"study_design_scores_gemma":[0.0018878955,0.00055906776,0.005248614,0.00072306825,0.00030037906,0.000081990525,0.0000021770231,0.49709898,0.0026560286,0.46240783,0.024013927,0.0050200424],"about_ca_topic_score_codex":0.000016665588,"about_ca_topic_score_gemma":0.0002179323,"teacher_disagreement_score":0.8555323,"about_ca_system_score_codex":0.00023040983,"about_ca_system_score_gemma":0.0003818763,"threshold_uncertainty_score":0.999766},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007048834,0.00050798216,0.9943535,0.00025246214,0.0021824816,0.0005000255,0.000004308388,0.00024401798,0.0012503596],"genre_scores_gemma":[0.35711464,0.000010961814,0.63869095,0.0013178333,0.002191425,0.000019727484,0.000032759785,0.00008713936,0.0005345313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951714,0.0001132921,0.00071426143,0.0017530663,0.0015953496,0.0006526076],"domain_scores_gemma":[0.99689245,0.00020014752,0.00048784455,0.001477367,0.0006937211,0.0002484932],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018490215,0.0006285731,0.0006686491,0.0010936974,0.00042371164,0.0010447622,0.002620754,0.00036959627,0.000031263255],"category_scores_gemma":[0.00014082322,0.00059872144,0.00016883001,0.0007951344,0.00061760494,0.0013484525,0.0010092418,0.0007486776,0.00003900757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021820148,0.00008439791,0.000021634321,0.00007251509,0.00003074543,0.00022221231,0.00090942276,0.27966696,0.056583583,0.020859214,0.00030928143,0.64121825],"study_design_scores_gemma":[0.0011282958,0.00014227502,0.000048779864,0.00031454634,0.000019258383,0.00014690723,1.0752943e-7,0.94369435,0.005345165,0.047465846,0.00087019504,0.00082425354],"about_ca_topic_score_codex":0.00008380499,"about_ca_topic_score_gemma":0.000106785614,"teacher_disagreement_score":0.6640274,"about_ca_system_score_codex":0.0009555808,"about_ca_system_score_gemma":0.00095166604,"threshold_uncertainty_score":0.99999225},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003519788,0.00025448314,0.96404344,0.00021524678,0.0011760229,0.00051133084,0.000011176931,0.0002790068,0.03347409],"genre_scores_gemma":[0.04862629,0.00004103043,0.9491776,0.0011699334,0.00048310807,0.000027812874,0.000015021807,0.000044088523,0.00041511815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994831,0.00009614828,0.0007009992,0.002134556,0.001377255,0.0008599875],"domain_scores_gemma":[0.99626935,0.00023655892,0.0004496152,0.0024891933,0.00025764215,0.00029762049],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024301896,0.00061245513,0.0005197456,0.00059795426,0.0003262656,0.0006129572,0.0054229805,0.00043095992,0.000035872476],"category_scores_gemma":[0.00013958223,0.00051432935,0.000119742705,0.00050793606,0.0008378833,0.0016090979,0.0014214185,0.00079149206,0.000049708764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044499648,0.000045258395,0.0000073749234,0.00003873568,0.000006757847,0.0000073152078,0.0007024356,0.00073742704,0.00028226283,0.4837164,0.00005077283,0.51440084],"study_design_scores_gemma":[0.00032716966,0.00032520763,0.000013969297,0.0002477223,0.000007087339,0.00007360791,4.0564012e-7,0.58919257,0.0056999824,0.39563522,0.0074252933,0.0010517352],"about_ca_topic_score_codex":0.000014039522,"about_ca_topic_score_gemma":0.000004898237,"teacher_disagreement_score":0.58845514,"about_ca_system_score_codex":0.0004906609,"about_ca_system_score_gemma":0.00037568877,"threshold_uncertainty_score":0.99995816},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021949788,0.0013325418,0.99265605,0.0002671843,0.0028218753,0.00056313974,0.0000023148477,0.00011662132,0.000045302382],"genre_scores_gemma":[0.065218665,0.000056597008,0.93393594,0.00041966318,0.00025676878,0.000008513842,0.0000067906935,0.000036213103,0.0000608392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971062,0.000044312997,0.0005407189,0.0012263915,0.0005452635,0.0005371005],"domain_scores_gemma":[0.9978614,0.00053670513,0.00043084266,0.0006370913,0.00034315116,0.00019084243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087756035,0.00041659488,0.0005679387,0.00095802057,0.000363585,0.0005909204,0.00073940214,0.00017827556,0.0000031601746],"category_scores_gemma":[0.00015891012,0.00040022677,0.00010039008,0.00044285957,0.0003977065,0.0013912643,0.0005237566,0.0003548804,0.0000031164611],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065121208,0.000008461836,0.000083470586,0.0000674806,0.000007903609,0.000015585238,0.0003192416,0.035297967,0.0007361906,0.0013157702,0.0000041722037,0.9621372],"study_design_scores_gemma":[0.00031739316,0.000067060966,0.000033222746,0.0010118698,0.000012298423,0.00018565737,6.5354004e-7,0.91055393,0.0014314232,0.085833475,0.00015948506,0.000393555],"about_ca_topic_score_codex":0.000017201563,"about_ca_topic_score_gemma":0.000017841068,"teacher_disagreement_score":0.9617437,"about_ca_system_score_codex":0.0003914969,"about_ca_system_score_gemma":0.00043882037,"threshold_uncertainty_score":0.99984497},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007738292,0.00021223811,0.9959905,0.00094742136,0.000671277,0.00054978667,0.000019570663,0.00037780314,0.0012236759],"genre_scores_gemma":[0.007445466,0.0000045176857,0.99092627,0.0009221793,0.0004323288,0.00004238385,0.000029923138,0.000044763954,0.00015218822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960867,0.000041383315,0.00052616437,0.0018563939,0.0008195875,0.00066974724],"domain_scores_gemma":[0.99633265,0.00027934372,0.00031800172,0.0023264028,0.000378059,0.00036556926],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016842356,0.000536388,0.00048532285,0.0006886822,0.00041815848,0.0011164997,0.004469361,0.000359659,0.000008268803],"category_scores_gemma":[0.00010902829,0.00050407497,0.00009883158,0.0007007198,0.00054725993,0.00084788835,0.00096420664,0.00083179993,0.000020740621],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024729256,0.000045549958,0.000003446213,0.000022588794,0.0000045819606,0.000026293152,0.00022378303,0.0109241465,0.0015641855,0.008956777,0.000037820126,0.97818834],"study_design_scores_gemma":[0.00019200264,0.00017647668,0.000006565429,0.00031358126,0.000007280742,0.000040350085,1.17685246e-7,0.91047585,0.004021845,0.08046393,0.0037003064,0.0006016732],"about_ca_topic_score_codex":0.00006951794,"about_ca_topic_score_gemma":0.000028727527,"teacher_disagreement_score":0.9775867,"about_ca_system_score_codex":0.00033535378,"about_ca_system_score_gemma":0.0015117518,"threshold_uncertainty_score":0.9999204},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014131497,0.001184673,0.9777022,0.0019084155,0.001291806,0.00043448264,0.000022828272,0.00013697862,0.0031871474],"genre_scores_gemma":[0.85192746,0.00004784561,0.14319503,0.0018490261,0.001128378,0.000009892337,0.00035492462,0.000057274643,0.0014301605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799585,0.000023780542,0.0002979322,0.00059300684,0.00086670544,0.0002227099],"domain_scores_gemma":[0.9989352,0.00015482437,0.00017392238,0.0004556048,0.00014051807,0.0001399187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035881138,0.00023452863,0.00043047697,0.00036353202,0.00011699925,0.00009056474,0.000273241,0.00009724823,0.0003704652],"category_scores_gemma":[0.0000947958,0.00019363883,0.00010015652,0.00022779586,0.0002822816,0.00010857267,0.00016445766,0.0004228389,0.000038611182],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021951728,0.000037928137,0.0006735457,0.000033976008,0.0000348519,0.00016331667,0.00078199577,0.004098311,0.0015061876,0.000040656003,0.00039115633,0.9922161],"study_design_scores_gemma":[0.0008612348,0.00029579707,0.0013260659,0.0007535292,0.0002461305,0.00009861738,0.0000022991399,0.9697801,0.0012308018,0.022622282,0.002300865,0.00048230268],"about_ca_topic_score_codex":0.000110760986,"about_ca_topic_score_gemma":0.000010601314,"teacher_disagreement_score":0.99173385,"about_ca_system_score_codex":0.0003332284,"about_ca_system_score_gemma":0.00028858703,"threshold_uncertainty_score":0.78963625},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019393463,0.0003106347,0.9946247,0.00052544154,0.00048572983,0.0004471292,0.000021439522,0.00014097014,0.0015046472],"genre_scores_gemma":[0.98992527,0.0000026433115,0.008545929,0.0008433389,0.00013768309,0.000013173584,0.00002376567,0.000020397842,0.0004877764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996364,0.000071420094,0.00040691945,0.0014974504,0.0012123771,0.000447806],"domain_scores_gemma":[0.99774265,0.0002555813,0.0002608403,0.0010493172,0.00040702758,0.00028460243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083722494,0.00047567885,0.0006311673,0.0016964445,0.0002713959,0.0006945747,0.0016101892,0.0002984338,0.00001747234],"category_scores_gemma":[0.00004274973,0.0004255684,0.00016607158,0.0009854222,0.0005766175,0.00028969365,0.00052826555,0.00062270195,0.000019349956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000899364,0.0010834874,0.0047666463,0.00027191732,0.0006016584,0.00092886656,0.12226893,0.018005388,0.00029190784,0.10661124,0.00038826087,0.7446917],"study_design_scores_gemma":[0.0007730186,0.00054663565,0.0022612633,0.00038915308,0.00019735159,0.000030331099,0.0000022394004,0.9523388,0.00022760456,0.041824594,0.0003595174,0.0010495032],"about_ca_topic_score_codex":0.0001302383,"about_ca_topic_score_gemma":0.0006000209,"teacher_disagreement_score":0.98798597,"about_ca_system_score_codex":0.00018515944,"about_ca_system_score_gemma":0.00029469616,"threshold_uncertainty_score":0.99981964},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000075316852,0.0004116638,0.9960008,0.00017664427,0.0013741942,0.0007189071,0.000005333435,0.0003675106,0.0009373807],"genre_scores_gemma":[0.21961612,0.00002266584,0.7790367,0.0005419985,0.0005020314,0.000027019716,0.0000034581903,0.000044209875,0.00020578736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668956,0.000020632979,0.00046320513,0.0013350263,0.0008797316,0.0006118419],"domain_scores_gemma":[0.9975607,0.00038994214,0.00027845585,0.0009741373,0.00061024906,0.00018656306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001132012,0.00044807786,0.0004586363,0.0006574113,0.00025180803,0.00033614205,0.0020939673,0.00029754365,0.000003864428],"category_scores_gemma":[0.00021915353,0.00041264168,0.00014147043,0.0005061611,0.0005345529,0.00032742138,0.0009003406,0.0005413232,0.000015521615],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001143812,0.000013290983,6.974811e-7,0.000025677404,0.000003560938,0.000018245131,0.00013586572,0.052891154,0.0004209065,0.007844626,0.000011568039,0.93862295],"study_design_scores_gemma":[0.00023587214,0.00039296946,0.0000031649972,0.00020330434,0.0000059727377,0.00004065981,8.8661416e-8,0.7968749,0.03258653,0.16555782,0.0036145428,0.00048420444],"about_ca_topic_score_codex":0.000011055436,"about_ca_topic_score_gemma":0.000036151294,"teacher_disagreement_score":0.9381388,"about_ca_system_score_codex":0.0006280004,"about_ca_system_score_gemma":0.0005026265,"threshold_uncertainty_score":0.9998326},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009520904,0.00037647775,0.98806053,0.0044247955,0.000562754,0.00037790558,0.000019582429,0.00016086355,0.0059219026],"genre_scores_gemma":[0.022837011,0.000032534426,0.9745087,0.0015109115,0.000433258,0.000031541513,0.000029020703,0.000040873285,0.0005761391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671215,0.000031051783,0.00037313838,0.0013113166,0.0010175128,0.0005548138],"domain_scores_gemma":[0.99681085,0.00040162576,0.00030164284,0.0018352788,0.00044406435,0.00020650691],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009769414,0.00044298466,0.00036968218,0.00031818968,0.00039394514,0.0007422114,0.004183245,0.00017762822,0.000018145465],"category_scores_gemma":[0.000047628735,0.0002817979,0.000053238833,0.00083373615,0.0011820967,0.00044406776,0.0010315385,0.0006647907,0.00004532661],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014138818,0.000020525124,0.000018644334,0.000008313284,0.000013723078,0.000055502176,0.0012200836,0.0011473945,0.000021171425,0.034378827,0.00061925803,0.96249515],"study_design_scores_gemma":[0.00079070416,0.000561416,0.00015251448,0.001046541,0.00003950135,0.0007756368,0.000005415185,0.79273397,0.00060101517,0.09666852,0.104658455,0.001966303],"about_ca_topic_score_codex":0.000030627,"about_ca_topic_score_gemma":0.000063229854,"teacher_disagreement_score":0.96052885,"about_ca_system_score_codex":0.00021868544,"about_ca_system_score_gemma":0.0009748189,"threshold_uncertainty_score":0.9999634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032140902,0.00013183881,0.9929975,0.0017260555,0.0026300885,0.0008272739,0.0000127499,0.0001254752,0.0015168533],"genre_scores_gemma":[0.026890498,0.000039456434,0.9653522,0.0033294137,0.0017483297,0.000072039875,0.000021251224,0.000046745863,0.0025000805],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966009,0.000023637152,0.00042644478,0.0014901792,0.00091619586,0.00054260227],"domain_scores_gemma":[0.9977667,0.00057122606,0.00024068763,0.00087946357,0.00038400228,0.00015797369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086045795,0.0004357819,0.00037504284,0.0007013015,0.0003178479,0.0003641263,0.0016643684,0.0002262398,0.000011162659],"category_scores_gemma":[0.00006580598,0.0003496662,0.00014788401,0.00035907168,0.0002264256,0.0003872431,0.0005825571,0.0003057479,0.000061795676],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072139287,0.000030680403,0.0000036006236,0.00002713785,0.000009536811,0.000010706389,0.00013299553,0.046214495,0.00020538912,0.053279035,0.00006376928,0.9000154],"study_design_scores_gemma":[0.00044112618,0.00044364526,0.00004567236,0.0003191677,0.0000058810215,0.000033917375,2.7172476e-8,0.3925713,0.004297241,0.5941083,0.0071598208,0.00057393237],"about_ca_topic_score_codex":0.0000024068056,"about_ca_topic_score_gemma":0.000015184556,"teacher_disagreement_score":0.8994415,"about_ca_system_score_codex":0.00036615744,"about_ca_system_score_gemma":0.00045176462,"threshold_uncertainty_score":0.9998955},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026002207,0.0002284653,0.9912918,0.0013004469,0.0011605353,0.0006939056,0.0000021822777,0.00027121222,0.0024511851],"genre_scores_gemma":[0.5912556,0.00004795255,0.40536317,0.00086356886,0.00030451073,0.000041469113,0.0000029849468,0.000057486737,0.0020632625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947711,0.00010796858,0.0010725058,0.0015520869,0.0016353839,0.0008609111],"domain_scores_gemma":[0.9968056,0.0004999575,0.00097385584,0.0010718434,0.00037524378,0.00027351396],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021019562,0.0005921693,0.00093528087,0.0010351145,0.00031933145,0.0008857668,0.004553907,0.00025212285,0.000035479232],"category_scores_gemma":[0.00017882512,0.0005370405,0.00020971661,0.00069272256,0.0002970916,0.0006435148,0.0021467682,0.00093597,0.000032671032],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010412199,0.00007790372,0.006121036,0.000212752,0.000067906265,0.00011202243,0.0077748303,0.0016977192,0.00038050962,0.0108262915,0.00055852474,0.9721601],"study_design_scores_gemma":[0.0034939905,0.0044121444,0.00922134,0.017978296,0.00012604192,0.0010078389,0.000045244913,0.5375125,0.04246284,0.27912146,0.093289025,0.011329332],"about_ca_topic_score_codex":0.000104721854,"about_ca_topic_score_gemma":0.000030255043,"teacher_disagreement_score":0.96083075,"about_ca_system_score_codex":0.00029391772,"about_ca_system_score_gemma":0.0002193257,"threshold_uncertainty_score":0.9997081},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006765306,0.004672136,0.98509306,0.00031900065,0.004344104,0.0016191131,0.000045592635,0.00020159959,0.003698612],"genre_scores_gemma":[0.046060905,0.00010382873,0.9482283,0.00077892595,0.003001346,0.00017270115,0.00008798628,0.00013617147,0.0014298614],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957083,0.000051435683,0.00065056153,0.0019449048,0.00083900045,0.00080580614],"domain_scores_gemma":[0.99582076,0.00082047546,0.00043675196,0.0017210772,0.0007781321,0.0004227855],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014421237,0.0006559323,0.00072372623,0.0009061547,0.00024653986,0.0010795761,0.004348959,0.00039843048,0.000005766562],"category_scores_gemma":[0.00018970482,0.00058336445,0.0002054046,0.0008209842,0.00046126667,0.0014370427,0.0016733346,0.00084662356,0.000039970757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039196162,0.00015920807,0.000021639695,0.00042985685,0.00006392374,0.000031394346,0.006286728,0.016584026,0.000031033214,0.42096823,0.0035745064,0.55181026],"study_design_scores_gemma":[0.00056099374,0.000402775,0.0000057808325,0.0008359335,0.000018878032,0.000085586435,4.5553412e-7,0.36270565,0.0001632482,0.5702755,0.06416001,0.0007852199],"about_ca_topic_score_codex":0.000083299,"about_ca_topic_score_gemma":0.00015591267,"teacher_disagreement_score":0.55102503,"about_ca_system_score_codex":0.00035829117,"about_ca_system_score_gemma":0.001520475,"threshold_uncertainty_score":0.9999574},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055936835,0.00013875503,0.9955468,0.00015125939,0.00079726893,0.00035336654,0.0000021296837,0.00017977478,0.0027747115],"genre_scores_gemma":[0.2148846,0.000017125134,0.78365093,0.00051650865,0.0003196729,0.000008137829,0.0000033616543,0.000051942094,0.0005477095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965611,0.00004447571,0.00037850853,0.0012267383,0.0011995902,0.0005896017],"domain_scores_gemma":[0.99776775,0.00016130312,0.0002494577,0.0010589549,0.0004984289,0.0002640839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079911907,0.00041559152,0.00038721206,0.0008135339,0.0002815123,0.0006532638,0.0019231874,0.00024015713,0.000013613962],"category_scores_gemma":[0.0000763691,0.00035110582,0.000058266985,0.00073656865,0.0005557923,0.0006519088,0.0007586094,0.0006539665,0.000026710646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010705121,0.00002059282,0.000013078141,0.000028903412,0.000009156587,0.00014739035,0.0005408499,0.42691803,0.00012034147,0.0033111617,0.0000045911397,0.5688752],"study_design_scores_gemma":[0.00027624378,0.0003468177,0.000010101682,0.00020354887,0.0000071900026,0.00027117747,1.2714524e-7,0.96259093,0.00033526367,0.034695704,0.0007810014,0.00048186438],"about_ca_topic_score_codex":0.000024487168,"about_ca_topic_score_gemma":0.00013471465,"teacher_disagreement_score":0.56839335,"about_ca_system_score_codex":0.00046007484,"about_ca_system_score_gemma":0.0009847198,"threshold_uncertainty_score":0.9998941},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022345454,0.00009592219,0.97464526,0.000601805,0.0018225821,0.0003086471,0.000013862128,0.00011825698,0.000048186193],"genre_scores_gemma":[0.56307524,0.0000015702184,0.43598986,0.0007868854,0.00012639834,0.000012285658,0.0000058730407,0.0000018465796,3.1054576e-8],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982551,0.00003241618,0.00027268176,0.00035079615,0.00040894188,0.00068009325],"domain_scores_gemma":[0.9986124,0.00024217599,0.00009901072,0.000753431,0.00012488622,0.0001680804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010239548,0.00016431307,0.00016230169,0.00032850413,0.00034043042,0.0005849807,0.0015084646,0.000060827206,0.0000046726454],"category_scores_gemma":[0.00015376577,0.00014102652,0.000078070494,0.0017138465,0.0003891175,0.005688289,0.0005831882,0.00016200275,0.000015909147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024108032,0.00027033017,0.009299791,0.000051701467,0.0000065742215,0.0000013975999,0.0059275315,0.0009397236,0.000172962,0.3525353,0.00010821485,0.6306623],"study_design_scores_gemma":[0.000735973,0.00022778299,0.03901602,0.00004869878,0.0000046847804,0.000039702416,0.0000020771765,0.635114,0.0033131244,0.31361622,0.0072868443,0.0005948877],"about_ca_topic_score_codex":0.00004403007,"about_ca_topic_score_gemma":0.000043411506,"teacher_disagreement_score":0.6341743,"about_ca_system_score_codex":0.0000649738,"about_ca_system_score_gemma":0.00010586571,"threshold_uncertainty_score":0.57508945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002309372,0.00011923653,0.9834634,0.0036441307,0.0016175038,0.00058620167,0.000009076666,0.00008200026,0.008169086],"genre_scores_gemma":[0.92440516,0.000046493857,0.06896215,0.0056039975,0.0006507037,0.00004248594,0.0000055192886,0.00003395995,0.0002495125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613696,0.00007835056,0.0005502211,0.0013618504,0.0011403748,0.0007322278],"domain_scores_gemma":[0.99702233,0.00084668555,0.00023481103,0.0016514132,0.00013680349,0.00010793413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013658272,0.00045708654,0.00039558086,0.000990444,0.0003601394,0.00067014736,0.0040252744,0.00022168847,0.00003982768],"category_scores_gemma":[0.00005774559,0.0003125064,0.00015121124,0.0008813538,0.0005500681,0.00049014343,0.00064671534,0.0005997842,0.000045106724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010642654,0.000097229495,0.00008655755,0.000023037119,0.000012151636,0.0001396388,0.004673019,0.00075861363,0.000109515255,0.6288939,0.00019336324,0.3650023],"study_design_scores_gemma":[0.0011332313,0.00080837804,0.0009857734,0.0007960445,0.000012956698,0.00012489334,0.0000031854668,0.035975233,0.000697275,0.94408023,0.013971365,0.001411451],"about_ca_topic_score_codex":0.000029083074,"about_ca_topic_score_gemma":0.00047303754,"teacher_disagreement_score":0.9220958,"about_ca_system_score_codex":0.00025781264,"about_ca_system_score_gemma":0.00034998317,"threshold_uncertainty_score":0.9999327},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008164222,0.0010032261,0.99015635,0.00016515148,0.005387834,0.0003249358,0.000002508984,0.00019598879,0.0019476074],"genre_scores_gemma":[0.770359,0.000058092224,0.18697631,0.001155444,0.0029966282,0.00003379396,0.000004485071,0.0001138439,0.038302395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576163,0.000060508886,0.00074561924,0.0013880268,0.0013109428,0.00073328224],"domain_scores_gemma":[0.9969986,0.00054303184,0.00053336436,0.0010558091,0.0006696611,0.00019949811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002029821,0.00052868004,0.00062674616,0.00078158866,0.0004355434,0.0007891312,0.0023269139,0.00016109711,0.000024671417],"category_scores_gemma":[0.00029878935,0.00046401224,0.00015149891,0.00042268072,0.0003272744,0.00087050535,0.0023238277,0.0010741415,0.00009360227],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013007986,0.00013760623,0.0016809324,0.00022362942,0.00028977852,0.021665882,0.022644598,0.09321932,0.00015661106,0.19923967,0.00066532055,0.6600636],"study_design_scores_gemma":[0.0015613361,0.0012715156,0.00019303428,0.0062913764,0.000117985146,0.02406038,0.00006137456,0.49378437,0.0014535013,0.2300526,0.23541284,0.005739695],"about_ca_topic_score_codex":0.000063156345,"about_ca_topic_score_gemma":0.00012139483,"teacher_disagreement_score":0.80318004,"about_ca_system_score_codex":0.00077793957,"about_ca_system_score_gemma":0.0003739665,"threshold_uncertainty_score":0.99978113},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012857473,0.00048212396,0.9780603,0.0019524255,0.0057767634,0.00045756597,0.00003907292,0.00030655868,0.00006769855],"genre_scores_gemma":[0.72712374,0.000058658923,0.27195743,0.0003154711,0.00047776746,0.000026373811,0.000023990242,0.000015954785,6.210109e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99442106,0.00017066493,0.0005267705,0.002715991,0.0011705408,0.000994991],"domain_scores_gemma":[0.9950661,0.00029273034,0.00051124574,0.0036916637,0.00018412442,0.00025411908],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019044939,0.00061472633,0.0005582066,0.000731872,0.00095107727,0.003004637,0.0071985493,0.0003861535,0.0000049026257],"category_scores_gemma":[0.00031242677,0.0005671033,0.00023122682,0.0009510305,0.00087103015,0.0013713602,0.006788014,0.0018935286,0.000015296975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029738643,0.0003057589,0.0017401911,0.0001900007,0.000037950835,0.000110447094,0.0050954535,0.086152345,0.0019085235,0.005258464,0.00056174956,0.8986094],"study_design_scores_gemma":[0.00035596438,0.00021065831,0.002048893,0.00095152436,0.000009780474,0.00006456725,0.0000010799679,0.8493553,0.011045868,0.13444972,0.00042413472,0.0010825032],"about_ca_topic_score_codex":0.00043329375,"about_ca_topic_score_gemma":0.000103047794,"teacher_disagreement_score":0.89752686,"about_ca_system_score_codex":0.0002803726,"about_ca_system_score_gemma":0.000440018,"threshold_uncertainty_score":0.999678},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006965359,0.000052383693,0.99010944,0.0020321272,0.00024553962,0.00045517427,0.000013212707,0.000114181,0.000012560198],"genre_scores_gemma":[0.3844934,0.0000016561585,0.6147105,0.0005355299,0.00019781372,0.000020978485,0.000031745403,0.000007008501,0.0000013554873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998788,0.0000092668,0.00012781726,0.0005800319,0.00026135042,0.00023351065],"domain_scores_gemma":[0.9986854,0.00021082732,0.000038580663,0.0007688206,0.00017721594,0.00011915431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003441288,0.000105032625,0.00014304835,0.00011031142,0.000085302265,0.00004308373,0.00042629705,0.000030919196,9.313554e-7],"category_scores_gemma":[0.0002670164,0.000087155706,0.000023264998,0.00049400533,0.00022888587,0.00032657385,0.00033368418,0.00014981651,0.0000036525514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038140436,0.00082393613,0.0077885343,0.0002923879,0.00002416895,0.000110387846,0.00041007152,0.18287332,0.0345249,0.0035251565,0.0060214982,0.76322424],"study_design_scores_gemma":[0.00056395953,0.00014241668,0.0013927935,0.000039476785,0.000009438396,0.00007070957,1.8718428e-7,0.94981813,0.013882409,0.033675093,0.00031139684,0.00009399661],"about_ca_topic_score_codex":0.0000065854033,"about_ca_topic_score_gemma":0.0000031664674,"teacher_disagreement_score":0.7669448,"about_ca_system_score_codex":0.0000587685,"about_ca_system_score_gemma":0.00016695532,"threshold_uncertainty_score":0.35541067},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008913788,0.00052026793,0.99545413,0.00023591466,0.00060904556,0.0007123731,0.000008796363,0.00007647161,0.0014916436],"genre_scores_gemma":[0.99463683,0.000016709528,0.0041663633,0.00035870005,0.00011986975,0.000024987237,0.0000061545766,0.000053452142,0.00061695214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977304,0.00004185557,0.00063671666,0.0005662218,0.00055531436,0.0004695417],"domain_scores_gemma":[0.99877936,0.00013360726,0.000167871,0.00077138987,0.000041203548,0.000106591826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000499413,0.0004534083,0.0006345303,0.0004170526,0.00009385085,0.00008320809,0.0012514276,0.00027619966,0.000049395876],"category_scores_gemma":[0.000029649786,0.00033125503,0.0001076118,0.00019718196,0.00043340624,0.00011572991,0.00019927019,0.000691947,0.00001673447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012888544,0.000029242701,0.00007052873,0.000033748755,0.000025580468,0.000030161427,0.00035797348,0.94811136,0.001377301,0.0002447289,0.000014503206,0.049692012],"study_design_scores_gemma":[0.0024478512,0.0002574913,0.0018125504,0.0003702707,0.000036259524,0.000012438437,0.0000012051923,0.98762494,0.0002779765,0.0052918196,0.001210997,0.00065621466],"about_ca_topic_score_codex":0.000051305073,"about_ca_topic_score_gemma":0.0008276012,"teacher_disagreement_score":0.99374545,"about_ca_system_score_codex":0.0004167856,"about_ca_system_score_gemma":0.00012985495,"threshold_uncertainty_score":0.99991393},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002581137,0.00043523582,0.9889969,0.0010790321,0.0008862315,0.00032796164,0.000002913983,0.00045922014,0.0077866605],"genre_scores_gemma":[0.08951689,0.00019124609,0.907795,0.0015240144,0.00032815203,0.000022189599,0.0000042726597,0.000041537718,0.0005766922],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960638,0.00006415245,0.00070226437,0.0015826342,0.0007869819,0.00080016087],"domain_scores_gemma":[0.9976537,0.00037697307,0.00033351738,0.0012717741,0.00019597879,0.00016803182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010049943,0.0005240038,0.00055696,0.0013151936,0.00023917094,0.00047195927,0.0030140297,0.00034086136,0.000018109968],"category_scores_gemma":[0.000093164,0.0004485422,0.00013934736,0.0008097184,0.00050070876,0.00066955335,0.0010876349,0.00068002916,0.00005437157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013044045,0.00008469459,0.00062720216,0.00004990284,0.000016136315,0.00024022555,0.00090219,0.26787078,0.000082069804,0.15977757,0.00026221282,0.57007396],"study_design_scores_gemma":[0.00049632957,0.00016201005,0.0003483133,0.0011429735,0.000003836897,0.000060572762,7.578926e-8,0.4667267,0.0006180744,0.5278903,0.0016044792,0.0009463294],"about_ca_topic_score_codex":0.000019910225,"about_ca_topic_score_gemma":0.00007432464,"teacher_disagreement_score":0.5691276,"about_ca_system_score_codex":0.0002828906,"about_ca_system_score_gemma":0.0004058407,"threshold_uncertainty_score":0.9997966},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000091314796,0.00034422838,0.99110496,0.0009031276,0.0014250859,0.00039676556,0.000008279963,0.00013699042,0.0055892365],"genre_scores_gemma":[0.34327555,0.00007867847,0.649766,0.001878781,0.0012718692,0.000016232125,0.00003948194,0.00008921134,0.0035841486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99615806,0.000032750802,0.00035310295,0.0014836944,0.001338058,0.00063435483],"domain_scores_gemma":[0.99791247,0.000191383,0.00012715513,0.0012915997,0.00022106752,0.00025629907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013273177,0.00043114615,0.0004196726,0.0007605583,0.00021034763,0.00092924584,0.0031232035,0.00017051006,0.00002037824],"category_scores_gemma":[0.000047958103,0.00038092755,0.000057736477,0.00048145145,0.00071408093,0.00030588062,0.0040834895,0.00057914614,0.00008925119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005417416,0.000030182906,0.000019994965,0.000026277454,0.000008328455,0.00009285952,0.00034620898,0.016186219,0.000013726758,0.024093,0.00010646969,0.95907134],"study_design_scores_gemma":[0.00043254503,0.00022791434,0.000118059026,0.00012645574,0.0000058864907,0.00002155141,1.6562875e-7,0.9611874,0.000094842566,0.034548823,0.0027432514,0.0004930763],"about_ca_topic_score_codex":0.00008362222,"about_ca_topic_score_gemma":0.00005266923,"teacher_disagreement_score":0.9585782,"about_ca_system_score_codex":0.00017224652,"about_ca_system_score_gemma":0.00032552614,"threshold_uncertainty_score":0.9998643},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009303917,0.000052467636,0.98982453,0.0001491658,0.00013023824,0.00026360925,0.00000726461,0.000012864208,0.00025594496],"genre_scores_gemma":[0.8391503,0.00000133585,0.16072652,0.00002426266,0.00007666501,0.0000017616102,0.0000026165706,0.000008908554,0.000007634062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990499,0.0000073329616,0.000259175,0.00031681225,0.0001838569,0.00018293095],"domain_scores_gemma":[0.9991657,0.00034788722,0.00017296802,0.00021515261,0.00007309939,0.000025167446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023114152,0.00014833693,0.00029031863,0.00008928887,0.000024336268,0.000016547592,0.00016934099,0.00008817668,0.0000018958717],"category_scores_gemma":[0.00004081781,0.00012832572,0.00003438826,0.00010725339,0.00033942526,0.000058927162,0.00013048646,0.00017379648,9.780884e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026306838,0.00002172719,0.00025365612,0.000021138942,0.0000059170957,0.0000012795659,0.00020716044,0.52122664,0.00023246408,0.19066663,0.000007538852,0.28732952],"study_design_scores_gemma":[0.00019241398,0.0001762747,0.000040337993,0.00034610805,0.0000042372462,4.7601486e-7,8.1784066e-7,0.18012697,0.0057357475,0.81321615,0.000034361943,0.0001260809],"about_ca_topic_score_codex":0.000011877715,"about_ca_topic_score_gemma":0.000007868021,"teacher_disagreement_score":0.8298464,"about_ca_system_score_codex":0.000056986428,"about_ca_system_score_gemma":0.00005598102,"threshold_uncertainty_score":0.5232971},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033328234,0.0011321903,0.9914425,0.0004141998,0.0010740567,0.0004588445,0.000006701945,0.00015323094,0.004984964],"genre_scores_gemma":[0.079964876,0.00015577207,0.91493654,0.000592762,0.0014567417,0.000049137143,0.000011794497,0.000050749215,0.0027816074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739355,0.00002426401,0.00028894935,0.0012188455,0.0005707281,0.0005036464],"domain_scores_gemma":[0.99812764,0.0003041009,0.00020092519,0.00074798695,0.00041145887,0.00020786736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000648258,0.00040950676,0.0003931839,0.0005138504,0.00033443508,0.0005354225,0.0013134821,0.00024783416,0.0000032950888],"category_scores_gemma":[0.000082435334,0.0003114884,0.0000703031,0.00039802244,0.0005691079,0.0005480793,0.0005123061,0.00037055643,0.000009608578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024675886,0.000049892064,0.00027469944,0.00006652332,0.000028066625,0.000036629302,0.0015444184,0.022957982,0.00012407068,0.5501744,0.0004334241,0.4242852],"study_design_scores_gemma":[0.0007028319,0.00079712056,0.00057458144,0.00024906374,0.000025502786,0.00019958467,3.6708104e-7,0.5346236,0.0003147898,0.44910064,0.0125743,0.00083761156],"about_ca_topic_score_codex":0.000047094665,"about_ca_topic_score_gemma":0.00015934334,"teacher_disagreement_score":0.51166564,"about_ca_system_score_codex":0.00020465777,"about_ca_system_score_gemma":0.00061193627,"threshold_uncertainty_score":0.9999337},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036060378,0.0008262466,0.9595782,0.0007844548,0.0020436973,0.0005575308,4.1642295e-7,0.000101213576,0.00004784114],"genre_scores_gemma":[0.8590341,0.000022060949,0.14050965,0.00016525747,0.00023644617,0.000018999463,0.0000031575128,0.000009057339,0.0000012194932],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971078,0.00032718884,0.0003517857,0.0011476168,0.00072379445,0.00034178668],"domain_scores_gemma":[0.9979414,0.00046119117,0.0003374546,0.0007175638,0.00043360647,0.0001088197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004108701,0.00028542726,0.000306024,0.0003584867,0.000272472,0.0009539067,0.0010258205,0.00021577145,0.0000016198676],"category_scores_gemma":[0.00047375777,0.00021312319,0.000026094416,0.0006729807,0.0004710434,0.00050042727,0.0021137644,0.0003683279,0.0000052646465],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051625757,0.000019440447,0.0038165082,0.00013233263,0.000009582595,0.000008079709,0.0041505834,0.003310742,0.0009190536,0.051749554,0.0000033483593,0.9358756],"study_design_scores_gemma":[0.00013176289,0.000069330505,0.0017332822,0.00006709474,0.000006665794,0.000021476402,0.0000016007546,0.47410673,0.0005485968,0.5230981,0.000012052158,0.0002033057],"about_ca_topic_score_codex":0.00008684043,"about_ca_topic_score_gemma":0.000071137736,"teacher_disagreement_score":0.9356723,"about_ca_system_score_codex":0.00016038169,"about_ca_system_score_gemma":0.00048806454,"threshold_uncertainty_score":0.9198544},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001617951,0.0014745267,0.9892231,0.00072521396,0.0020504636,0.00091663696,0.00012056479,0.0003728249,0.0051004966],"genre_scores_gemma":[0.0069362014,0.00006932054,0.99030447,0.0010970766,0.00035334655,0.000050706385,0.000046076748,0.0000780977,0.0010647154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99456805,0.00004856484,0.00077349105,0.0021849,0.0013156536,0.001109361],"domain_scores_gemma":[0.9958652,0.000773716,0.00046141987,0.0019816726,0.0005511465,0.00036680268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016883395,0.0008002078,0.0009230449,0.00091891945,0.0004899899,0.0007494688,0.004698549,0.00038596924,0.00002379854],"category_scores_gemma":[0.000133745,0.00074946333,0.00028853392,0.0009193732,0.0015627965,0.00082589814,0.0010140574,0.00080353295,0.000059049642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004442154,0.00009003273,0.000021361411,0.00012494308,0.000036698508,0.0001423198,0.0006143354,0.0037198213,0.00010841113,0.59911466,0.0007613104,0.39522168],"study_design_scores_gemma":[0.00036230398,0.00021567543,0.0000059479707,0.00029666972,0.000009439127,0.00006600181,2.0076992e-7,0.38412127,0.00019211444,0.605218,0.008813007,0.0006994123],"about_ca_topic_score_codex":0.00002092662,"about_ca_topic_score_gemma":0.00007130655,"teacher_disagreement_score":0.39452228,"about_ca_system_score_codex":0.00035206202,"about_ca_system_score_gemma":0.0008560335,"threshold_uncertainty_score":0.9994956},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011954612,0.00013657409,0.98075354,0.0011079472,0.003152254,0.00033236606,0.0000064581636,0.00026109503,0.014237827],"genre_scores_gemma":[0.07455581,0.000046948615,0.91279244,0.009888831,0.0008932111,0.000033147408,0.0000104624205,0.000061891384,0.0017172592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556446,0.00012153475,0.00047281003,0.0018218533,0.0011437879,0.00087556697],"domain_scores_gemma":[0.9967325,0.00075713877,0.00021717665,0.0019359754,0.00013203379,0.00022520038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010609224,0.00058360974,0.0005797487,0.0007198951,0.0004302837,0.0007052226,0.0044521056,0.00041000798,0.000024305673],"category_scores_gemma":[0.00003922459,0.00048729553,0.00019711362,0.001180773,0.00052673416,0.0004999689,0.00024991742,0.0011540412,0.00021115453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044941407,0.000053139338,0.000002334592,0.000023522145,0.0000066943803,0.000048259055,0.00044863386,0.09556148,0.000003766956,0.0015455699,0.00041825735,0.90188384],"study_design_scores_gemma":[0.00030735083,0.00044168663,0.000073867064,0.00027351754,0.000007921671,0.00007717211,6.21682e-8,0.8783888,0.00023703472,0.106001586,0.013389593,0.00080138526],"about_ca_topic_score_codex":0.000014992638,"about_ca_topic_score_gemma":0.00004840972,"teacher_disagreement_score":0.90108246,"about_ca_system_score_codex":0.0004370646,"about_ca_system_score_gemma":0.0008433944,"threshold_uncertainty_score":0.9997579},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007180771,0.00038412202,0.9816536,0.00037806103,0.0002817356,0.00023571127,0.000012645081,0.0004652795,0.016517082],"genre_scores_gemma":[0.82175773,0.00007469003,0.17716847,0.00026738577,0.00016885044,0.000016204005,0.000038836628,0.000070884525,0.00043692804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877286,0.000015620988,0.00022248446,0.0003927733,0.00039620642,0.00020007178],"domain_scores_gemma":[0.99859875,0.00020094853,0.000064476015,0.0009131125,0.00009127767,0.00013144936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003015153,0.00025775822,0.00021960687,0.0004067324,0.00008103343,0.00013109631,0.00064279366,0.0002126259,0.00003745224],"category_scores_gemma":[0.000036932237,0.00026456505,0.000035336438,0.00020076301,0.00022147525,0.00013861383,0.0001476209,0.00050808216,0.000015838159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068571317,0.000020493193,0.000035359582,0.00005497551,0.000013452609,0.00000424856,0.0007172586,0.20581639,0.00023561333,0.006266933,0.0010087531,0.78581965],"study_design_scores_gemma":[0.00020218191,0.00008365889,0.00011670196,0.00035032007,0.000014569188,0.0000047947647,5.806656e-7,0.959577,0.001029293,0.0293899,0.008800411,0.00043058835],"about_ca_topic_score_codex":0.000013817918,"about_ca_topic_score_gemma":0.00008961429,"teacher_disagreement_score":0.82168597,"about_ca_system_score_codex":0.00024391885,"about_ca_system_score_gemma":0.0001553102,"threshold_uncertainty_score":0.9999806},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038171257,0.100323685,0.78031737,0.039798826,0.006749701,0.0011730161,0.0001266963,0.00065181765,0.07047717],"genre_scores_gemma":[0.36640275,0.10899832,0.4583294,0.005509093,0.039816484,0.000040453157,0.00039032052,0.00037776216,0.020135423],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707586,0.000073052775,0.00029786775,0.0010139763,0.0010044865,0.0005347462],"domain_scores_gemma":[0.99825764,0.0001825224,0.00019617425,0.00078374945,0.00016306927,0.00041684168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014119124,0.00033767315,0.00039519154,0.00058080035,0.00038851885,0.00025291927,0.0016789254,0.00045617815,0.00006630961],"category_scores_gemma":[0.00061118096,0.00031998186,0.00005951514,0.00031965884,0.0011188848,0.0005291313,0.0012734693,0.00073489675,0.000018511259],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070695464,0.000024925868,0.000012493713,0.000015783986,0.000005318601,0.0000119951355,0.005884378,0.000046292567,0.0000018390776,0.008715709,0.00035968082,0.98491454],"study_design_scores_gemma":[0.0003696476,0.0001720921,0.0005541535,0.00019802587,0.000017248936,0.00001512529,0.0000054129787,0.0020520017,0.000011206167,0.5716104,0.4244304,0.0005643025],"about_ca_topic_score_codex":0.002043825,"about_ca_topic_score_gemma":0.0106581,"teacher_disagreement_score":0.9843502,"about_ca_system_score_codex":0.00033860246,"about_ca_system_score_gemma":0.0010026686,"threshold_uncertainty_score":0.9999252},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62114835,0.00009470707,0.36412027,0.002408198,0.0051657297,0.0054348772,0.000119375356,0.000046729238,0.001461749],"genre_scores_gemma":[0.99847364,0.0000010059672,0.0012979064,0.000073985146,0.00006876422,0.000016917864,0.0000022786753,0.0000032791527,0.000062188876],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9979681,0.00007926765,0.00047993127,0.00020159726,0.0010476076,0.00022349256],"domain_scores_gemma":[0.9965971,0.00073482736,0.0008047996,0.0004129337,0.0014011243,0.00004921736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020813406,0.0001500571,0.00032088553,0.000292399,0.0004646638,0.00007723617,0.00046696645,0.00014530917,0.000002883009],"category_scores_gemma":[0.0008671511,0.000115481474,0.00006419312,0.00036603352,0.00072982674,0.00061680033,0.00012796909,0.00019892753,1.5489809e-7],"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.00035411792,0.00030985972,0.54402757,0.0011046414,0.00023652996,0.0000967664,0.27387422,0.08186652,0.000007783095,0.009641997,0.0015702966,0.08690973],"study_design_scores_gemma":[0.030204078,0.008397632,0.34858227,0.006024686,0.0016658854,0.0013334501,0.025547087,0.13308454,0.0010439529,0.1264814,0.30801895,0.009616062],"about_ca_topic_score_codex":0.66976404,"about_ca_topic_score_gemma":0.9806974,"teacher_disagreement_score":0.37732533,"about_ca_system_score_codex":0.0003824355,"about_ca_system_score_gemma":0.0024399797,"threshold_uncertainty_score":0.4709198},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007394822,0.00030400552,0.9917991,0.0005769142,0.00068282644,0.0003315566,0.000016135062,0.00009587527,0.006119594],"genre_scores_gemma":[0.35226676,0.000070883245,0.6466416,0.0003576605,0.00023917377,0.00001192517,0.0000014675626,0.000038058766,0.0003724533],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629116,0.00005261226,0.0005439679,0.0012204556,0.0012191738,0.00067260675],"domain_scores_gemma":[0.9962299,0.0014797517,0.0003098888,0.001346059,0.00044137603,0.00019304077],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011589912,0.00037962652,0.00048819007,0.0013274403,0.00017936203,0.00014987294,0.0039355108,0.00022752336,0.000060507133],"category_scores_gemma":[0.00035927896,0.00030968615,0.00013547772,0.00069173734,0.0034422427,0.0006822373,0.0011860166,0.0005757193,0.000034323464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026971097,0.00000966227,0.00002193106,0.000022315207,0.000007888869,0.000044397653,0.0002975391,0.001683028,0.0013472474,0.43200913,0.0000019690099,0.5645522],"study_design_scores_gemma":[0.0002585704,0.00011612913,0.000033365537,0.00061224896,0.0000035522266,0.000076967895,2.3278592e-7,0.029207885,0.0062709157,0.9627428,0.0002589236,0.000418402],"about_ca_topic_score_codex":0.0000021650499,"about_ca_topic_score_gemma":0.000008639031,"teacher_disagreement_score":0.56413376,"about_ca_system_score_codex":0.00021453452,"about_ca_system_score_gemma":0.00077431183,"threshold_uncertainty_score":0.9999355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034086802,0.0007952213,0.9721751,0.0009448065,0.0007982155,0.0008333323,0.000006227162,0.0001426113,0.020895772],"genre_scores_gemma":[0.9375911,0.0000061908204,0.058317255,0.00062022026,0.0010494326,0.000011530666,0.00010876853,0.000033503147,0.0022620487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839836,0.000008965707,0.00030953507,0.000533951,0.00049318705,0.00025597325],"domain_scores_gemma":[0.9987661,0.00031760705,0.00015247366,0.00026947344,0.00037607035,0.00011826555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055649824,0.00020978904,0.00031660657,0.00020010404,0.00015627366,0.00017970306,0.00014792265,0.00020106057,0.000025946554],"category_scores_gemma":[0.00025774454,0.00017779117,0.00008305079,0.00019170324,0.00040134776,0.00009955459,0.000032820844,0.00026221346,0.0000065260756],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015901244,0.000033467328,0.000120620425,0.000104341314,0.000013104444,0.00003594402,0.00038762524,0.01283611,0.0007195521,0.0022914237,0.00004041516,0.98325837],"study_design_scores_gemma":[0.0044889525,0.0019213145,0.0008442193,0.001656655,0.00010416386,0.00015784544,4.4228625e-7,0.7919812,0.0026371148,0.13832676,0.057030257,0.0008510716],"about_ca_topic_score_codex":0.0000075428857,"about_ca_topic_score_gemma":0.000018475894,"teacher_disagreement_score":0.98240733,"about_ca_system_score_codex":0.00017673596,"about_ca_system_score_gemma":0.0005135106,"threshold_uncertainty_score":0.72501135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001262315,0.00023831977,0.99273485,0.0003798261,0.0035277577,0.0018064787,0.000060903232,0.00043193903,0.00069368986],"genre_scores_gemma":[0.86944735,0.0000013463969,0.1284053,0.0005807529,0.0011928478,0.000110868896,0.000014038369,0.000058699457,0.00018878485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503726,0.00014219248,0.00083638605,0.0019901805,0.0012051086,0.0007888858],"domain_scores_gemma":[0.99527794,0.00075885677,0.0005450462,0.0017839686,0.0012264897,0.0004076999],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00220207,0.0006587892,0.0009556109,0.00067827664,0.0003955429,0.0012845098,0.0039215903,0.00041711677,0.0000074948334],"category_scores_gemma":[0.00014255343,0.00062026375,0.0002121936,0.00040705112,0.00026445734,0.0016454787,0.000575727,0.0005798554,0.000060948423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030921212,0.00010278234,0.00014670432,0.0003750401,0.00007650251,0.00013182395,0.0020107902,0.10979837,0.0020978556,0.014457801,0.00012115299,0.87065023],"study_design_scores_gemma":[0.0010546066,0.00046906597,0.000017288417,0.00079685205,0.000016359638,0.00017320318,0.0000014925204,0.9896554,0.0006079589,0.0047336943,0.00168966,0.0007844185],"about_ca_topic_score_codex":0.000046935485,"about_ca_topic_score_gemma":0.00015401808,"teacher_disagreement_score":0.879857,"about_ca_system_score_codex":0.0008731073,"about_ca_system_score_gemma":0.0011983612,"threshold_uncertainty_score":0.9997522},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006884382,0.0005332461,0.99083257,0.0022519485,0.0010507146,0.0005803911,0.000017006816,0.0003867935,0.0042785075],"genre_scores_gemma":[0.0724298,0.0009775248,0.8957755,0.011390547,0.0019060374,0.0002125227,0.00020528771,0.00016308653,0.016939707],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964314,0.0000373054,0.0005082736,0.0014431472,0.0010045585,0.0005753331],"domain_scores_gemma":[0.99766034,0.00018614784,0.00035945672,0.0012243639,0.0003778187,0.00019188969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053796795,0.00057890755,0.00046987733,0.0005922002,0.00022464743,0.00091410364,0.002637667,0.0003912,0.00014361338],"category_scores_gemma":[0.00005219942,0.00045873623,0.00014670844,0.00059160776,0.00043812676,0.0010955655,0.00076251535,0.00085097033,0.0003482614],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032714365,0.000040498144,0.000013613454,0.000026295635,0.000008434992,0.000012353916,0.00021823606,0.0000067275464,0.0033308733,0.0020516037,0.000589501,0.9936986],"study_design_scores_gemma":[0.0009782722,0.00078409293,0.0021897503,0.0012029317,0.000030521758,0.0002956578,3.4306314e-7,0.07595342,0.15608624,0.70034814,0.057936322,0.0041942904],"about_ca_topic_score_codex":0.000024022325,"about_ca_topic_score_gemma":0.0000051190395,"teacher_disagreement_score":0.9895043,"about_ca_system_score_codex":0.00030462586,"about_ca_system_score_gemma":0.00020749905,"threshold_uncertainty_score":0.99978644},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4067181,0.0033679078,0.5846266,0.00034138816,0.0010002753,0.0011977804,0.0003234563,0.000045784003,0.00237868],"genre_scores_gemma":[0.89945495,0.000041832653,0.099463336,0.00011556339,0.0004750424,0.000013474996,0.000059007692,0.000029311908,0.0003474535],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985247,0.0000415819,0.00026454477,0.00063344685,0.00034424878,0.00019143724],"domain_scores_gemma":[0.9990546,0.00006321955,0.00021400998,0.0003830504,0.00020789847,0.00007719225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005097299,0.00022964012,0.00025347556,0.00014979175,0.00006966619,0.00005072361,0.00034952967,0.00032040259,0.000013534318],"category_scores_gemma":[0.00018795076,0.00020105805,0.000045347297,0.0000626785,0.00055782584,0.0000056538142,0.00016170529,0.0001413404,0.000003085428],"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.000045147102,0.0000065043237,0.00005723767,0.000025350404,0.000011691861,0.000006381848,0.000033324504,0.00032332822,0.96426153,0.00009268661,0.00001674305,0.0351201],"study_design_scores_gemma":[0.00020550353,0.0004338522,0.000029159635,0.00046430164,0.000010288352,0.000004706904,3.0242933e-7,0.002012765,0.97985744,0.015763214,0.0009979699,0.00022047524],"about_ca_topic_score_codex":0.000038417224,"about_ca_topic_score_gemma":0.000038498732,"teacher_disagreement_score":0.49273688,"about_ca_system_score_codex":0.000029609357,"about_ca_system_score_gemma":0.00036262418,"threshold_uncertainty_score":0.8198909},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013248678,0.00078434177,0.9958638,0.0005307844,0.0008538702,0.000488124,0.000010573856,0.0004113104,0.0010439268],"genre_scores_gemma":[0.019536193,0.000072772455,0.9741934,0.0014395782,0.00013471227,0.000014152337,0.000021516937,0.000039799026,0.0045478935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961056,0.000055014305,0.0005262566,0.0014581985,0.0013534839,0.0005014227],"domain_scores_gemma":[0.99727243,0.00057773414,0.0003572455,0.00097513327,0.00045297248,0.0003644852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001087087,0.00051726185,0.00051262375,0.00049668556,0.00020196348,0.00053161295,0.0013207021,0.00037332487,0.000022653232],"category_scores_gemma":[0.00077536644,0.00043539956,0.00006160511,0.00035884598,0.0007942371,0.0008048128,0.0011739609,0.0006074802,0.000043331453],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036426009,0.000024302431,0.000006741153,0.000029319956,0.0000050552917,0.00015281812,0.00045583292,0.003179759,0.00026388754,0.00010030931,0.0018788483,0.99389946],"study_design_scores_gemma":[0.00031598413,0.00016770334,0.0000068293316,0.00042365593,0.000007637895,0.00012611074,1.4707719e-7,0.9842598,0.0049556633,0.0070690503,0.0021189423,0.000548482],"about_ca_topic_score_codex":0.000033744538,"about_ca_topic_score_gemma":0.000014787124,"teacher_disagreement_score":0.993351,"about_ca_system_score_codex":0.00031645928,"about_ca_system_score_gemma":0.00029311058,"threshold_uncertainty_score":0.9998098},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016390107,0.0024142365,0.99429834,0.00013355544,0.0008197479,0.0003227383,0.000012928309,0.00016762472,0.00019183978],"genre_scores_gemma":[0.42617837,0.0001246262,0.5728384,0.0003223716,0.00047835705,0.0000031000232,0.0000070116625,0.000028831142,0.000018922043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969083,0.000063459156,0.0006077458,0.0012255341,0.0007675015,0.0004274746],"domain_scores_gemma":[0.9972919,0.00053297955,0.0004978058,0.0010723494,0.00043669585,0.00016823539],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073108386,0.0004374276,0.00055642106,0.00046089996,0.00017407886,0.00048449566,0.002033616,0.00019840567,0.000010744673],"category_scores_gemma":[0.00006423157,0.00042148095,0.00009114925,0.0007059848,0.0005874944,0.00063051464,0.0015867227,0.00040520463,0.0000012072196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015142404,0.00004201387,0.0007327928,0.000049506918,0.00003067918,0.00003031766,0.00085751375,0.050757345,0.0017400463,0.13662963,0.000071262344,0.80904377],"study_design_scores_gemma":[0.00019324324,0.00011133842,0.00024480486,0.00024388128,0.000009005987,0.000014014561,6.993338e-8,0.79513663,0.0012624755,0.20234019,0.00011143106,0.00033292564],"about_ca_topic_score_codex":0.00018765141,"about_ca_topic_score_gemma":0.000023634955,"teacher_disagreement_score":0.8087108,"about_ca_system_score_codex":0.000099240926,"about_ca_system_score_gemma":0.00030797,"threshold_uncertainty_score":0.9998237},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024575089,0.0003999966,0.9953283,0.0000965483,0.0022520488,0.00096734404,0.000066503744,0.0006455022,0.00021916862],"genre_scores_gemma":[0.07142852,0.000026035468,0.9268181,0.0005979696,0.00088574534,0.000026082793,0.000081746104,0.000093582865,0.000042217205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941753,0.00007555188,0.00094930036,0.0025988782,0.0013937629,0.0008071856],"domain_scores_gemma":[0.9945044,0.00062386383,0.00052573165,0.0032621901,0.0007699142,0.00031393763],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0028529083,0.0007042516,0.0008834609,0.0012065434,0.00041841157,0.001822448,0.008220069,0.00049308565,0.0000038045407],"category_scores_gemma":[0.00018496304,0.000683232,0.00016330078,0.0010060419,0.00035808748,0.0016546467,0.0062520904,0.0005805783,0.000005483345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010248195,0.000033815795,0.0000037703578,0.00010782031,0.000025415518,0.000043447195,0.00023670639,0.0021502788,0.0001303149,0.68044376,0.00008514836,0.31672925],"study_design_scores_gemma":[0.00033474833,0.00032748503,8.7838384e-7,0.00072549406,0.000019119796,0.00011011334,6.108265e-7,0.9533468,0.00062805513,0.035766914,0.007958821,0.00078094983],"about_ca_topic_score_codex":0.000028252603,"about_ca_topic_score_gemma":0.000028919721,"teacher_disagreement_score":0.95119655,"about_ca_system_score_codex":0.0005445077,"about_ca_system_score_gemma":0.0012504436,"threshold_uncertainty_score":0.9995619},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014808445,0.0023220242,0.9878485,0.000057662663,0.0011742371,0.00020449702,0.000007843906,0.00019923584,0.006705136],"genre_scores_gemma":[0.9929089,0.00013649534,0.006296603,0.00012808428,0.00028672704,0.0000076044466,0.0000018569299,0.000039819766,0.00019389972],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987091,0.000012271712,0.00022134499,0.0004673501,0.0002568564,0.00033312183],"domain_scores_gemma":[0.99926627,0.00013875049,0.00004309495,0.00042018713,0.00003432724,0.000097353884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032529872,0.0003026125,0.0003239122,0.00029034587,0.00008427804,0.00010478275,0.00046132586,0.00022880815,0.00002328222],"category_scores_gemma":[0.000010965796,0.0002381482,0.00006081629,0.000107721775,0.0005357859,0.00011735149,0.000109265784,0.00028472694,0.000025397168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006592866,0.000009268423,0.00023900722,0.00027633744,0.00006259299,0.00015601641,0.0007104334,0.049884852,0.0025584812,0.05501159,0.00003620225,0.8910486],"study_design_scores_gemma":[0.00049853703,0.00012808184,0.0002963528,0.0013669506,0.000026372447,0.00027834112,3.6966034e-7,0.10847308,0.0021828671,0.87395215,0.0113197295,0.0014771968],"about_ca_topic_score_codex":0.0000019301874,"about_ca_topic_score_gemma":0.000008668837,"teacher_disagreement_score":0.9914281,"about_ca_system_score_codex":0.000056132525,"about_ca_system_score_gemma":0.000026995269,"threshold_uncertainty_score":0.97114015},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021370335,0.0030459382,0.9793194,0.0001775138,0.004386049,0.0006965578,0.0000029598357,0.00033356875,0.012016676],"genre_scores_gemma":[0.45545253,0.00012547614,0.52502614,0.0008617651,0.004546346,0.000125613,0.000029817045,0.00019075641,0.01364156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957137,0.000058091427,0.0005386135,0.0017692585,0.001013148,0.000907187],"domain_scores_gemma":[0.99668854,0.00055012625,0.0003758975,0.0013333999,0.00073727424,0.00031472967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018557417,0.0006057366,0.0007317759,0.00066223106,0.00038253458,0.00096789957,0.003957273,0.00047866776,0.000006553556],"category_scores_gemma":[0.0003403388,0.0005231339,0.00018983845,0.0004845548,0.00043708566,0.0005912315,0.0012954188,0.00087348744,0.000088862354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012583638,0.000047598252,0.00008217132,0.0001938938,0.0000364761,0.0001006137,0.0018988695,0.29377094,0.00010703023,0.3303656,0.0005311884,0.37285304],"study_design_scores_gemma":[0.00035403937,0.00030540588,0.00001393012,0.0002969941,0.000010426096,0.00007412408,3.3623186e-7,0.8401012,0.00009464685,0.113104984,0.04496474,0.0006792069],"about_ca_topic_score_codex":0.00002191319,"about_ca_topic_score_gemma":0.00002215898,"teacher_disagreement_score":0.5463302,"about_ca_system_score_codex":0.00046036005,"about_ca_system_score_gemma":0.00081176934,"threshold_uncertainty_score":0.999722},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013739626,0.00067137566,0.9883506,0.0012978808,0.0017711333,0.00051498413,0.000006041703,0.0001658717,0.007084734],"genre_scores_gemma":[0.14093891,0.00010751104,0.8545823,0.003025187,0.00075002026,0.0000496003,0.000016298463,0.00008268438,0.00044747873],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995488,0.00009322067,0.0007547145,0.0014662731,0.0013602414,0.00083753915],"domain_scores_gemma":[0.99673074,0.00062629656,0.00033909598,0.001878443,0.00025890456,0.00016652967],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001668838,0.0005446798,0.0005433346,0.0012361298,0.0003156789,0.0006912557,0.0059018224,0.00027865573,0.00001235627],"category_scores_gemma":[0.00019645203,0.00040759693,0.00015690587,0.0019720187,0.001026864,0.0005975107,0.0023961747,0.0015220119,0.000026479796],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007202352,0.000081006314,0.00025775388,0.00003484757,0.000012470627,0.00016188702,0.0018833128,0.01110893,0.000018308805,0.18113925,0.0001399472,0.8051551],"study_design_scores_gemma":[0.00034283331,0.0000796564,0.00022563167,0.00030238656,0.0000027669735,0.00007944445,4.3902799e-7,0.4228304,0.00003758879,0.57345307,0.0021891356,0.0004566727],"about_ca_topic_score_codex":0.00006154587,"about_ca_topic_score_gemma":0.00020789223,"teacher_disagreement_score":0.8046984,"about_ca_system_score_codex":0.0002793081,"about_ca_system_score_gemma":0.00050778873,"threshold_uncertainty_score":0.9998376},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000106128275,0.00065500254,0.99458086,0.0008086576,0.0011278944,0.0005857308,0.000056776495,0.00012660016,0.0019523334],"genre_scores_gemma":[0.02039167,0.000055955876,0.97818017,0.0007605185,0.00018718893,0.000012732763,0.00006274757,0.00002218123,0.00032685092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970668,0.000025829248,0.00042325107,0.0013252477,0.0006356076,0.0005232731],"domain_scores_gemma":[0.9979069,0.0006846612,0.00027423108,0.0006707696,0.00029774357,0.00016569172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010390972,0.0004295028,0.0005047409,0.0005893195,0.00021805486,0.0008028949,0.002241531,0.00015597789,0.000004824174],"category_scores_gemma":[0.00017415936,0.00038219732,0.00006141373,0.00033242072,0.0008117269,0.0010161449,0.0015317529,0.00038226234,0.0000049310293],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007667395,0.000028243541,0.000024692832,0.00005854623,0.000024323293,0.000023096813,0.0006577294,0.0018827552,0.000033554108,0.12973924,0.000106514715,0.86741364],"study_design_scores_gemma":[0.00060204713,0.00046922354,0.00005382045,0.0004920025,0.000014564375,0.000018170565,0.0000022847175,0.72927064,0.00005226169,0.26405177,0.0043445616,0.0006286588],"about_ca_topic_score_codex":0.00001103557,"about_ca_topic_score_gemma":0.000082242135,"teacher_disagreement_score":0.866785,"about_ca_system_score_codex":0.000083866646,"about_ca_system_score_gemma":0.00033993198,"threshold_uncertainty_score":0.99986297},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008782285,0.00048317673,0.99680465,0.00010753826,0.0006741906,0.0006690654,0.000011403406,0.00084582664,0.00031634202],"genre_scores_gemma":[0.20512979,0.000025521627,0.7939298,0.00028140706,0.00035111545,0.00004200514,0.000035071567,0.00007635576,0.00012890932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963816,0.00004623384,0.000632623,0.0016956435,0.0006689716,0.00057497504],"domain_scores_gemma":[0.9971161,0.00009711207,0.00038407097,0.0009392491,0.001181364,0.000282101],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013269209,0.00058021554,0.000614055,0.0010707601,0.0003807411,0.0020988907,0.0021953562,0.00033165346,0.0000022575985],"category_scores_gemma":[0.00004858139,0.00054022897,0.0000788844,0.0008870433,0.00044094826,0.0014211023,0.0009805202,0.00047602,0.0000020224236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012791374,0.000037252576,0.000027695403,0.00033357058,0.000012704951,0.000038669343,0.0013342688,0.0010518121,0.00036628894,0.06590209,0.00007526018,0.9308076],"study_design_scores_gemma":[0.00026652278,0.00033674683,0.00001791327,0.00070894306,0.0000082438455,0.00008116314,0.0000011401006,0.9649161,0.0012477369,0.029254748,0.0025140897,0.0006466316],"about_ca_topic_score_codex":0.000030134515,"about_ca_topic_score_gemma":0.000031424315,"teacher_disagreement_score":0.9638643,"about_ca_system_score_codex":0.00031228169,"about_ca_system_score_gemma":0.0006916097,"threshold_uncertainty_score":0.9997049},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025138262,0.0011973792,0.9879766,0.00041910948,0.0019822426,0.0003324765,0.0000111851405,0.0001889308,0.007640675],"genre_scores_gemma":[0.32409063,0.00012061721,0.6737571,0.0011390098,0.0004555537,0.000023547558,0.000015242368,0.00006850249,0.00032981407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596244,0.000037535807,0.0005114724,0.0017984783,0.0009908316,0.000699238],"domain_scores_gemma":[0.9968898,0.00090333546,0.00030720377,0.00127175,0.00029110085,0.00033676342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009660802,0.0005771657,0.0005955634,0.00068028667,0.00061744667,0.00080489396,0.002112229,0.0003720377,0.000008449007],"category_scores_gemma":[0.00015079217,0.000496447,0.00010636614,0.0006642666,0.0008505561,0.00080759,0.0017988526,0.00092274614,0.000033582633],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000672007,0.000024210358,0.0001652741,0.000008696323,0.000012394491,0.00006526285,0.0007888672,0.0042002667,0.000019366835,0.00765673,0.00050633436,0.98654586],"study_design_scores_gemma":[0.0005955677,0.0004788993,0.00030070185,0.0004938309,0.000018146897,0.000259757,0.0000020588927,0.576762,0.000033400225,0.4160296,0.0040571936,0.0009688269],"about_ca_topic_score_codex":0.000034077137,"about_ca_topic_score_gemma":0.00015536282,"teacher_disagreement_score":0.98557705,"about_ca_system_score_codex":0.00027243572,"about_ca_system_score_gemma":0.0004187207,"threshold_uncertainty_score":0.9997487},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016192373,0.0033854307,0.97481376,0.00014292014,0.00048104615,0.00029448755,0.000011369587,0.0000030109554,0.0046756156],"genre_scores_gemma":[0.93946517,0.00014722465,0.05980693,0.00016361312,0.00024109824,0.0000046393093,0.0000030879653,0.000023584817,0.00014467754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998712,0.00001900225,0.00024408309,0.00050572964,0.00027277254,0.00024639626],"domain_scores_gemma":[0.999054,0.000027353843,0.00016964028,0.0005422833,0.00016056382,0.00004613551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048985804,0.000225105,0.00022799736,0.00008811861,0.00009992725,0.00002313127,0.00074006146,0.00017101571,0.0000019883387],"category_scores_gemma":[0.000017057959,0.00016157253,0.00010248365,0.00010386498,0.0007838642,7.47547e-7,0.0006310739,0.00018375186,7.202718e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029062414,0.000022734532,0.00030882136,0.0000765561,0.000061630824,0.0000034047132,0.0012814511,0.90969974,0.030753445,0.0169809,0.000031243064,0.040751018],"study_design_scores_gemma":[0.0004318406,0.00037345005,0.000048199014,0.0003283724,0.000029190403,0.000030030049,0.0000021110147,0.029659811,0.021280708,0.9429801,0.0041806963,0.00065545616],"about_ca_topic_score_codex":0.000007169262,"about_ca_topic_score_gemma":0.000021183174,"teacher_disagreement_score":0.9259992,"about_ca_system_score_codex":0.000023465309,"about_ca_system_score_gemma":0.00021989133,"threshold_uncertainty_score":0.6588737},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004542502,0.00074631406,0.9875241,0.00024838882,0.0019434191,0.0015112157,0.000013099783,0.000083840496,0.003387151],"genre_scores_gemma":[0.9492195,0.000024305644,0.049559787,0.00037817025,0.00051784626,0.000053629297,0.000016103542,0.00004225082,0.00018839474],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950023,0.00021288886,0.0011196639,0.0016190925,0.0014992214,0.0005467975],"domain_scores_gemma":[0.99667174,0.00036110784,0.0006424655,0.0012965121,0.0008256389,0.00020251636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023014117,0.000580736,0.0009864214,0.0016605917,0.00013857913,0.0004027554,0.0021946284,0.0002857434,0.00001844421],"category_scores_gemma":[0.00015756753,0.0005119271,0.00011737069,0.0013609605,0.0003803242,0.0007239397,0.0008028639,0.00093264284,0.00008150782],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017200584,0.00037014548,0.00045643141,0.00007715525,0.000024225365,0.00019283318,0.010905224,0.00824647,0.00014184527,0.0004021467,0.000045949204,0.9791204],"study_design_scores_gemma":[0.022181079,0.007694141,0.0067721712,0.012002575,0.0001968161,0.0018190326,0.00009283183,0.32076454,0.005328428,0.60428727,0.009933652,0.008927472],"about_ca_topic_score_codex":0.00012720613,"about_ca_topic_score_gemma":0.002061758,"teacher_disagreement_score":0.9701929,"about_ca_system_score_codex":0.00032964334,"about_ca_system_score_gemma":0.00051154615,"threshold_uncertainty_score":0.9997332},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002346267,0.0013670055,0.9958363,0.00012883167,0.0007972119,0.00026406752,0.0000022881177,0.00016695568,0.0014138797],"genre_scores_gemma":[0.43351158,0.000026880352,0.56605494,0.0001116566,0.00018949839,0.0000021978444,0.000003928222,0.000027927497,0.00007137056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628663,0.00006889233,0.0007039858,0.0012385423,0.00096036715,0.00074155314],"domain_scores_gemma":[0.9975604,0.00020894995,0.0005083619,0.0009211473,0.0005291361,0.0002720214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016180649,0.0005292604,0.0006881903,0.00061117584,0.00021065136,0.00040749402,0.002434895,0.0003886829,0.0000135053115],"category_scores_gemma":[0.00009859557,0.000497935,0.00013920969,0.0006501888,0.0009491699,0.00043297865,0.0011397704,0.001348962,0.000003872085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002767329,0.00001358476,0.00004331681,0.000022153974,0.00000820595,0.000035182013,0.0003097484,0.43398044,0.000039561535,0.021439072,0.0000011130406,0.5441049],"study_design_scores_gemma":[0.00016456409,0.00017084091,0.000002504165,0.0005469057,0.000010535653,0.000109275614,2.9603746e-7,0.94272995,0.000111239046,0.055391483,0.00027693142,0.00048549916],"about_ca_topic_score_codex":0.00007461142,"about_ca_topic_score_gemma":0.000030660063,"teacher_disagreement_score":0.54361933,"about_ca_system_score_codex":0.00024815483,"about_ca_system_score_gemma":0.0009064872,"threshold_uncertainty_score":0.9997472},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011609036,0.0006687431,0.9872064,0.002073633,0.0019120927,0.00033868928,0.0000031598784,0.00013063279,0.006505719],"genre_scores_gemma":[0.7817643,0.00006788544,0.21283554,0.003959963,0.00049146236,0.000010738971,0.0000037543837,0.00004917122,0.0008171525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963119,0.00005747992,0.00050866517,0.0011724062,0.0013966962,0.0005528695],"domain_scores_gemma":[0.99555594,0.0014908605,0.00034081168,0.0020833518,0.00040202847,0.00012700565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001511599,0.0004576215,0.0005763081,0.0004619187,0.00017577488,0.00023266902,0.0044817305,0.00030645222,0.000015596663],"category_scores_gemma":[0.00055389496,0.00028628673,0.00015313562,0.00045128373,0.0010270342,0.00029179823,0.0015848639,0.0007079168,0.00006880063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013257596,0.00006600173,0.00004755244,0.00004044413,0.00001920257,0.0001398364,0.0013211317,0.012817415,0.000293824,0.6152109,0.0012472158,0.3687832],"study_design_scores_gemma":[0.00022685644,0.00042833536,0.0003235986,0.0004689911,0.000008998211,0.00006403426,7.0387506e-7,0.23125887,0.0018003109,0.76293063,0.0021133455,0.00037532786],"about_ca_topic_score_codex":0.00003471964,"about_ca_topic_score_gemma":0.000043664164,"teacher_disagreement_score":0.7806034,"about_ca_system_score_codex":0.00013762634,"about_ca_system_score_gemma":0.000493436,"threshold_uncertainty_score":0.99995893},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03482127,0.019523216,0.9216653,0.0020633384,0.0057309996,0.010819738,0.00031290384,0.00074133324,0.0043218913],"genre_scores_gemma":[0.91562784,0.00012474174,0.08137567,0.0004051655,0.0009862031,0.0003936768,0.00007520873,0.00010550697,0.0009059631],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99674773,0.000018588904,0.0005588027,0.0012290602,0.0007778526,0.00066793506],"domain_scores_gemma":[0.99793786,0.0003069003,0.00026581393,0.00076257606,0.00038389754,0.0003429409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004442464,0.00052863103,0.0009235769,0.00034563316,0.00019974905,0.00015399785,0.00042472128,0.00028768508,0.0000133753965],"category_scores_gemma":[0.00013210712,0.00042255048,0.000168453,0.00026088287,0.0005743183,0.000124892,0.00017304091,0.00043450546,0.000016990172],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00383192,0.0018920706,0.02363563,0.024411524,0.0015452483,0.005717256,0.0048124813,0.037824426,0.024662625,0.013412595,0.001631841,0.8566224],"study_design_scores_gemma":[0.114788674,0.022068558,0.085419506,0.13843732,0.0032750627,0.012968252,0.000019495932,0.078738,0.40176928,0.059984494,0.06909418,0.013437192],"about_ca_topic_score_codex":0.000020840229,"about_ca_topic_score_gemma":0.00003009847,"teacher_disagreement_score":0.88080657,"about_ca_system_score_codex":0.0020474258,"about_ca_system_score_gemma":0.0010362361,"threshold_uncertainty_score":0.9998226},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000073435276,0.00047359703,0.98885477,0.0006388381,0.0027228883,0.0006152308,0.000024668945,0.00018300992,0.0064796456],"genre_scores_gemma":[0.2250589,0.00002004165,0.7686858,0.001432092,0.0014886844,0.000058539455,0.000017329496,0.00007153949,0.0031670383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958892,0.00003083541,0.0005721991,0.001800392,0.0008571157,0.0008502846],"domain_scores_gemma":[0.99681383,0.0005925978,0.0004195248,0.0015536131,0.00041468375,0.00020575081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012047746,0.00058261177,0.00072075817,0.0004946353,0.0003865529,0.00080255955,0.0034337023,0.00037257624,0.000005035386],"category_scores_gemma":[0.00011153403,0.0005360697,0.00021177091,0.0004815736,0.0005045546,0.0004436594,0.0007982555,0.000568548,0.0000363487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011300462,0.000017048727,0.000008255843,0.00007627879,0.000017988457,0.000030674717,0.0006189634,0.015684457,0.00008886237,0.30202714,0.0002976687,0.68112135],"study_design_scores_gemma":[0.00040327024,0.00032843815,0.00002046972,0.00070589076,0.000008187753,0.000052231153,2.2128003e-7,0.8260751,0.00042091933,0.12548858,0.04566032,0.0008363716],"about_ca_topic_score_codex":0.00002506839,"about_ca_topic_score_gemma":0.00006979184,"teacher_disagreement_score":0.81039065,"about_ca_system_score_codex":0.00033462085,"about_ca_system_score_gemma":0.00048178426,"threshold_uncertainty_score":0.99970907},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015956128,0.0011064833,0.9877119,0.0014713537,0.003649286,0.00083760475,0.000009727481,0.00034711283,0.0047069667],"genre_scores_gemma":[0.443153,0.000030857762,0.5521369,0.0017346521,0.0022450294,0.000038942944,0.000007327203,0.000080971535,0.000572333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504673,0.000057986388,0.0006586244,0.001998775,0.0012545249,0.0009833538],"domain_scores_gemma":[0.9960643,0.00092034065,0.00033714424,0.0020379208,0.0003326536,0.0003076122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019214362,0.0006850016,0.00071430975,0.00061720755,0.00026808932,0.0005833519,0.0051821233,0.0004675559,0.000014229523],"category_scores_gemma":[0.00017724847,0.0005998296,0.00028385338,0.00064542535,0.0007991057,0.00007562841,0.0013692105,0.001040106,0.000035660294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012278989,0.000050679788,0.00000832198,0.00014405928,0.000021378126,0.0000469516,0.0033543562,0.060741436,0.0000015690974,0.6395174,0.00009909083,0.29600248],"study_design_scores_gemma":[0.00021537585,0.00019604979,0.000004173496,0.0004759735,0.000012568608,0.000018570669,3.0668323e-7,0.38421953,0.000033655822,0.6090856,0.005262675,0.00047546226],"about_ca_topic_score_codex":0.000011181585,"about_ca_topic_score_gemma":0.000015137022,"teacher_disagreement_score":0.44299343,"about_ca_system_score_codex":0.00034529378,"about_ca_system_score_gemma":0.00045725188,"threshold_uncertainty_score":0.9996453},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46363476,0.0001984076,0.5359755,0.00008828969,0.00005250709,0.00004078311,0.000002881619,0.0000016013935,0.0000052438604],"genre_scores_gemma":[0.7808548,0.000036156755,0.21888107,0.00013553328,0.00008080751,9.3654904e-7,0.000007649303,0.000002823385,1.8167417e-7],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990693,0.000064119915,0.0001900399,0.00041454055,0.00010870133,0.0001533484],"domain_scores_gemma":[0.9992695,0.000047659934,0.00006422467,0.00042582658,0.00012025313,0.00007254622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008122262,0.00006705331,0.00012914468,0.000039764713,0.000028386,0.000010192297,0.00036948544,0.00007364613,2.6326364e-7],"category_scores_gemma":[0.00036981783,0.0000513929,0.000010213517,0.00016932283,0.00030471373,0.000005331188,0.00042166637,0.00007164301,2.1061452e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030761617,0.000036950954,0.5412781,0.0000035777978,0.000015776885,0.0000015957759,0.00009634876,0.4064323,0.00033582703,0.0000029611292,0.0000184391,0.05174734],"study_design_scores_gemma":[0.00030418904,0.0003854446,0.048254192,0.000007927341,0.0000062865997,0.000011905019,0.0000024834203,0.95006716,0.00021312754,0.00066141936,0.000020125382,0.00006573497],"about_ca_topic_score_codex":0.00004016232,"about_ca_topic_score_gemma":0.00009232917,"teacher_disagreement_score":0.54363483,"about_ca_system_score_codex":0.000007939387,"about_ca_system_score_gemma":0.00021887763,"threshold_uncertainty_score":0.20957418},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032226737,0.00036911728,0.9916195,0.0015485234,0.0012488648,0.0008290576,0.00000556035,0.00011207793,0.0010445714],"genre_scores_gemma":[0.29526067,0.00005167014,0.695994,0.0053126374,0.00081919995,0.000062825755,0.000009287861,0.00012226068,0.0023674371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958151,0.000053921725,0.00068194914,0.0018560172,0.00063835026,0.00095466385],"domain_scores_gemma":[0.9973829,0.00066674023,0.00034781027,0.0012974583,0.0001431074,0.00016202085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001154054,0.0006019206,0.0006791639,0.0009226591,0.00027335488,0.00039392072,0.003043779,0.00029894814,0.000009148394],"category_scores_gemma":[0.00010062658,0.00049451954,0.0001800459,0.00038569662,0.0004889518,0.00012773696,0.002509504,0.00053971785,0.000036557336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005086528,0.0000877318,0.00011406556,0.00013331411,0.00007612544,0.00028749745,0.0051563284,0.25455737,0.00084584265,0.019900497,0.00005222404,0.71873814],"study_design_scores_gemma":[0.00210257,0.00030389376,0.0000971922,0.0022164776,0.000018126742,0.000055873345,0.000004223736,0.8597721,0.0014944737,0.12503953,0.007446697,0.0014488723],"about_ca_topic_score_codex":0.000014356952,"about_ca_topic_score_gemma":0.000037382437,"teacher_disagreement_score":0.71728927,"about_ca_system_score_codex":0.00049250945,"about_ca_system_score_gemma":0.00017231885,"threshold_uncertainty_score":0.9997507},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016989256,0.000994544,0.9918539,0.0020374556,0.0008303212,0.00044549938,0.000007166325,0.00023928098,0.003421919],"genre_scores_gemma":[0.21294938,0.00023523625,0.7823454,0.0029666852,0.0007360299,0.000022177768,0.000005836504,0.000107476466,0.0006317747],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951171,0.000082292245,0.00050999795,0.0021884234,0.0012068879,0.0008952619],"domain_scores_gemma":[0.9969966,0.00076492113,0.00022896752,0.0013794176,0.00022301977,0.00040706666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010938572,0.00058991194,0.00062572595,0.0008339031,0.00038539342,0.0006465865,0.003765536,0.00029203927,0.000021364107],"category_scores_gemma":[0.00024557905,0.0005674874,0.0001299299,0.0009783328,0.0010866647,0.00096788513,0.0032893852,0.0013907559,0.00009595694],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017128259,0.00001781931,0.000060290222,0.00007736927,0.000018028628,0.00023373308,0.00084298686,0.003521745,0.000604634,0.08262558,0.000025403553,0.9119553],"study_design_scores_gemma":[0.00029006577,0.00024357381,0.000074505784,0.00031426156,0.000005815062,0.00014390281,3.378343e-7,0.22300853,0.0012270709,0.77215064,0.0018244341,0.0007168724],"about_ca_topic_score_codex":0.000008667601,"about_ca_topic_score_gemma":0.0000314591,"teacher_disagreement_score":0.91123843,"about_ca_system_score_codex":0.0002173406,"about_ca_system_score_gemma":0.00043612713,"threshold_uncertainty_score":0.99967766},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008046824,0.00044298,0.97748417,0.0020326115,0.0021616602,0.00054435874,0.000003955686,0.00012545638,0.017124353],"genre_scores_gemma":[0.12557817,0.000058292837,0.86455643,0.006330518,0.0013298697,0.00004460949,0.000013182774,0.00007598356,0.0020129452],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99466985,0.00011571949,0.0006351601,0.0018393078,0.0017544114,0.0009855465],"domain_scores_gemma":[0.9947898,0.00091794634,0.00053321756,0.003470347,0.00014328994,0.00014542606],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0029324675,0.00065918115,0.00067211187,0.0009806134,0.0006358003,0.0017404975,0.013172998,0.0004437978,0.000012118841],"category_scores_gemma":[0.00036128933,0.000500414,0.00014507561,0.00039065987,0.0010077913,0.00087365496,0.002071488,0.0016856734,0.00020989195],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041350313,0.000101073834,0.0010611846,0.000056612276,0.000027007214,0.0017994631,0.009704662,0.2192244,0.000043679658,0.04416187,0.00034025862,0.72347564],"study_design_scores_gemma":[0.0008807685,0.00051300455,0.008306148,0.0016872032,0.000021194166,0.00088001613,0.0000011764976,0.43852708,0.00039437535,0.54333687,0.0033434674,0.0021087027],"about_ca_topic_score_codex":0.00011605834,"about_ca_topic_score_gemma":0.00006556743,"teacher_disagreement_score":0.72136694,"about_ca_system_score_codex":0.00022983011,"about_ca_system_score_gemma":0.0008849459,"threshold_uncertainty_score":0.9997448},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072628615,0.00018880921,0.9963734,0.00021209868,0.0009878174,0.00039168532,0.000019905645,0.00006305757,0.0010369418],"genre_scores_gemma":[0.015958043,0.000041442207,0.98268396,0.00040009257,0.00032319766,0.000011738624,0.0000024745395,0.000024036834,0.00055501884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973296,0.000018744877,0.00047711044,0.0010732905,0.0005753466,0.0005258967],"domain_scores_gemma":[0.998111,0.00056085084,0.0003134993,0.00071358366,0.0001588695,0.00014217354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010624179,0.00038424038,0.00045949477,0.00052885903,0.00025180005,0.00013056878,0.0017074511,0.00021225464,0.000012227715],"category_scores_gemma":[0.000042245938,0.00029054118,0.00009426668,0.000237577,0.00030667914,0.0002974363,0.0007958469,0.00025465002,0.000016825294],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033183303,0.0000645681,0.000021714328,0.00014176653,0.000020388488,0.000015324531,0.0022337479,0.0010154159,0.00032120707,0.08486963,0.000018662715,0.9112444],"study_design_scores_gemma":[0.0026643632,0.001059902,0.0001720948,0.00248236,0.00003521653,0.00007080863,0.0000026361301,0.5443557,0.03701105,0.35445353,0.055235077,0.0024572397],"about_ca_topic_score_codex":8.561275e-7,"about_ca_topic_score_gemma":0.000013088211,"teacher_disagreement_score":0.90878713,"about_ca_system_score_codex":0.00009234411,"about_ca_system_score_gemma":0.00035266837,"threshold_uncertainty_score":0.9999547},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021651058,0.0010014527,0.9874645,0.000023063978,0.0021188294,0.00011622815,0.0000019754368,0.00045309504,0.008799203],"genre_scores_gemma":[0.0048927115,0.000095897725,0.98847795,0.00028481972,0.0017680436,0.0000112239195,0.0000351147,0.00011578,0.0043184403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843127,0.000036082187,0.00023161668,0.00044461168,0.0004722222,0.0003842093],"domain_scores_gemma":[0.9991278,0.0002317889,0.000049792776,0.00033331604,0.00013345695,0.00012381266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008658193,0.00028724773,0.00027828573,0.0004322219,0.0000908976,0.00015990467,0.00065163645,0.00024986634,0.000029029487],"category_scores_gemma":[0.0001420487,0.0002774089,0.000049245435,0.0005251797,0.00023238765,0.0001320386,0.00013768302,0.00093921146,0.000077945275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.010771e-7,0.0000022320667,0.0000032990495,0.000013612348,0.0000040242344,0.000009338972,0.00032368998,0.7280973,0.0000029072269,0.000041902684,0.000073013325,0.27142796],"study_design_scores_gemma":[0.00013574962,0.000029309558,0.000004415435,0.00012780265,0.0000054749826,0.00001947354,4.277605e-7,0.9793879,0.00011940342,0.017834552,0.0020032504,0.0003322771],"about_ca_topic_score_codex":0.0000012893155,"about_ca_topic_score_gemma":0.000002325333,"teacher_disagreement_score":0.2710957,"about_ca_system_score_codex":0.00043806506,"about_ca_system_score_gemma":0.0004002446,"threshold_uncertainty_score":0.9999678},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004337235,0.00020043255,0.9880949,0.00012088527,0.0014382172,0.00020764444,0.000048358503,0.00034409773,0.005208177],"genre_scores_gemma":[0.65980893,0.00007448439,0.33537427,0.00028688673,0.0016035656,0.000011129698,0.000024494082,0.0001878342,0.0026283741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979069,0.00002208387,0.00036808485,0.00061455177,0.00056636427,0.0005220215],"domain_scores_gemma":[0.9981045,0.0006829401,0.000052335115,0.00090316765,0.000108249325,0.00014881254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004760108,0.00040569252,0.00036308682,0.0006433095,0.00013971631,0.00011949449,0.00074781216,0.0003332068,0.00009340116],"category_scores_gemma":[0.000100169054,0.00034384945,0.00010391029,0.00028341636,0.00013481514,0.00016561295,0.00016282414,0.0005924396,0.00007253614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029600526,0.000005319455,0.000018660012,0.000025555333,0.000008008406,0.000009050794,0.00021627733,0.98498845,0.00021927543,0.00067856483,0.00002120303,0.01380665],"study_design_scores_gemma":[0.00027401972,0.000040282986,0.000058035464,0.00025215646,0.000004949709,0.000003315855,7.855337e-8,0.9733793,0.0022233825,0.014335981,0.008994811,0.00043365074],"about_ca_topic_score_codex":9.4174345e-7,"about_ca_topic_score_gemma":0.000020905554,"teacher_disagreement_score":0.65547174,"about_ca_system_score_codex":0.00025161452,"about_ca_system_score_gemma":0.00006840606,"threshold_uncertainty_score":0.99990135},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018564652,0.0001784855,0.9757112,0.000489971,0.00065258937,0.00040195364,0.0000037434409,0.000742979,0.021633402],"genre_scores_gemma":[0.31473622,0.00007803077,0.68296325,0.00090264954,0.00029015166,0.0000057111465,0.0000044891617,0.000052559415,0.00096695375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584997,0.000043525593,0.0005735103,0.0016002592,0.0010473662,0.0008853733],"domain_scores_gemma":[0.99672514,0.00034675078,0.0004406181,0.0014710925,0.0007965072,0.00021988923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000855453,0.0006779499,0.00063607114,0.0008306333,0.0004751477,0.0005640815,0.0036387448,0.0003168081,0.000016683074],"category_scores_gemma":[0.00007621417,0.0004959139,0.00006977718,0.0009598137,0.0007790034,0.00070190086,0.0011131547,0.00075455726,0.000043163152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010911146,0.00001884613,0.00011935319,0.00005326489,0.000015067566,0.000058587208,0.0005187723,0.10786912,0.000037039084,0.018614283,0.000033115444,0.87265164],"study_design_scores_gemma":[0.00048741058,0.00037023594,0.0001484825,0.0015916987,0.00000763319,0.00014464633,1.3346558e-7,0.979948,0.003583121,0.011172287,0.0015603558,0.0009859975],"about_ca_topic_score_codex":0.000012865452,"about_ca_topic_score_gemma":0.00000936772,"teacher_disagreement_score":0.8720789,"about_ca_system_score_codex":0.00030140826,"about_ca_system_score_gemma":0.0010760624,"threshold_uncertainty_score":0.99974924},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011219987,0.00022723565,0.9857536,0.00005563317,0.00041874716,0.00056270574,0.00005740553,0.000027170328,0.0016775306],"genre_scores_gemma":[0.8892756,0.000017970939,0.10764342,0.00065393344,0.0016628663,0.000008850403,0.0002350988,0.00006383671,0.0004383998],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978262,0.000015021411,0.00027848597,0.0009870996,0.00046249203,0.0004306553],"domain_scores_gemma":[0.99885756,0.000014231206,0.00018229992,0.00065224234,0.00018438676,0.00010929393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019800769,0.00041048115,0.00028652864,0.0002671996,0.00012769255,0.00007785789,0.0005831382,0.0006325113,0.000021812579],"category_scores_gemma":[0.000029906156,0.00032956252,0.00006476095,0.00017043811,0.0006268773,0.000010923631,0.00027084508,0.0005291823,0.000002039535],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055517873,0.00004167273,0.0010730354,0.00015248146,0.00012749527,0.00019625135,0.00020059376,0.049096365,0.19495194,0.0036878164,0.000050077037,0.7498671],"study_design_scores_gemma":[0.005495296,0.012076519,0.0043251123,0.0017925256,0.00022057162,0.0020406602,0.0000013197449,0.102630265,0.61091083,0.20860705,0.04528393,0.006615951],"about_ca_topic_score_codex":0.000020364387,"about_ca_topic_score_gemma":0.0007437121,"teacher_disagreement_score":0.8781102,"about_ca_system_score_codex":0.00007924542,"about_ca_system_score_gemma":0.00038107022,"threshold_uncertainty_score":0.99991566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023664375,0.00046822778,0.99744785,0.00014589705,0.00041495697,0.00041361482,0.00000708155,0.00038720868,0.00047853222],"genre_scores_gemma":[0.67352027,0.000055219214,0.3259508,0.00026034506,0.000111980335,0.000006838405,0.000012231719,0.000021659289,0.000060667964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968267,0.000035157336,0.00055853813,0.0014173362,0.000651199,0.0005110659],"domain_scores_gemma":[0.9976538,0.00035258735,0.0005368142,0.0011473346,0.00023453655,0.00007494538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004256012,0.00044704514,0.00048000013,0.001156726,0.00027839045,0.0005603962,0.0017151026,0.0003064147,0.00006560743],"category_scores_gemma":[0.000069586684,0.00041958602,0.00011118099,0.0015162331,0.0004633222,0.0012467854,0.0014193701,0.00043763165,0.000014447411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001880757,0.000008382532,0.0007857101,0.000019235196,0.00004862387,0.000008431025,0.0012077185,0.09233511,0.0000267334,0.017938199,0.0000024480764,0.8876175],"study_design_scores_gemma":[0.00018602076,0.00014175152,0.00073741184,0.000045906017,0.000048698475,0.0000064655724,5.7221257e-7,0.8996366,0.0009168384,0.09737756,0.0003748258,0.00052734785],"about_ca_topic_score_codex":0.00012437873,"about_ca_topic_score_gemma":0.00030253542,"teacher_disagreement_score":0.88709015,"about_ca_system_score_codex":0.00027344015,"about_ca_system_score_gemma":0.000250584,"threshold_uncertainty_score":0.9998256},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034797642,0.0062946323,0.95759624,0.00006668186,0.0012916763,0.00040617556,0.000010505745,0.0004368956,0.033862382],"genre_scores_gemma":[0.7091559,0.0032700268,0.28453025,0.0006878571,0.0006980087,0.00014596418,0.00012251515,0.00021740126,0.0011720686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844044,0.000055247732,0.00042879413,0.0003954301,0.0003281139,0.0003519657],"domain_scores_gemma":[0.9951402,0.0007039871,0.00010261003,0.0038167674,0.0001433423,0.000093104085],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00047058595,0.0002970555,0.00033181428,0.0005237516,0.00014598467,0.0002589489,0.0072467453,0.0002461261,0.000022907021],"category_scores_gemma":[0.00007454265,0.00030343275,0.00006517651,0.000704584,0.0005922834,0.0003535276,0.0016068706,0.0007727177,0.000122568],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027976487,0.000046699206,0.0014201896,0.00023626078,0.000035695623,0.000007377655,0.003353891,0.062329385,0.0002382681,0.0005004778,0.0005458544,0.9312831],"study_design_scores_gemma":[0.00026183718,0.000023824128,0.00090111815,0.00072268455,0.000010922789,0.00003104365,4.1662815e-7,0.8383802,0.0017510809,0.014577258,0.14241238,0.00092718663],"about_ca_topic_score_codex":0.00003531679,"about_ca_topic_score_gemma":0.00027837366,"teacher_disagreement_score":0.9303559,"about_ca_system_score_codex":0.00043312914,"about_ca_system_score_gemma":0.00025320557,"threshold_uncertainty_score":0.99994177},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019838745,0.00017077646,0.9789758,0.00003851436,0.00045668855,0.00018174112,0.000002617185,0.00010067792,0.00023447117],"genre_scores_gemma":[0.95384604,0.000026710757,0.04546706,0.00017989655,0.00041645873,0.0000019361814,0.000009808835,0.000041758813,0.000010325556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988656,0.000009936628,0.00017222055,0.00037606238,0.00026324278,0.00031291627],"domain_scores_gemma":[0.99941885,0.0001167492,0.000045603498,0.00026869093,0.000045412,0.00010468994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014665551,0.0002559023,0.00022371311,0.00021933031,0.00011202956,0.00014938011,0.00020047539,0.00015197911,0.0000059441163],"category_scores_gemma":[0.000013966108,0.00022309563,0.000020377742,0.000111858084,0.00016305705,0.00018505583,0.000037807786,0.00029462785,0.0000038325024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010113024,0.000006904898,0.00021977458,0.000025137046,0.000005315778,0.000009195265,0.00067138596,0.89955676,0.00050382206,0.00034137728,0.0000011159484,0.098649085],"study_design_scores_gemma":[0.00032091135,0.00010928185,0.00069332833,0.000209719,0.000005652935,0.000009944124,4.8963074e-7,0.9964127,0.0007792145,0.00090367236,0.00021723862,0.00033787833],"about_ca_topic_score_codex":0.000014641237,"about_ca_topic_score_gemma":0.000089246925,"teacher_disagreement_score":0.9340073,"about_ca_system_score_codex":0.00008024862,"about_ca_system_score_gemma":0.00002830063,"threshold_uncertainty_score":0.9097576},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01946067,0.00009418025,0.9779744,0.000025631234,0.0011703155,0.0003695401,0.000011874072,0.0001448368,0.00074856094],"genre_scores_gemma":[0.9099126,0.00006017092,0.08968571,0.00015921527,0.000080702106,0.0000069846164,0.000017919821,0.000026483074,0.000050215724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968911,0.000036625057,0.0010238705,0.00096722733,0.0007369438,0.00034428062],"domain_scores_gemma":[0.9966767,0.00015156229,0.0013156175,0.0011856846,0.000612545,0.000057923673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088239036,0.00037792212,0.00049760385,0.0015290887,0.00011422373,0.00007879906,0.0019830526,0.00041331272,0.000113060945],"category_scores_gemma":[0.000056804587,0.00038554764,0.00007997082,0.0004165663,0.0011576831,0.0011593972,0.00051892735,0.0005165934,0.000024019553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059526283,0.00042017107,0.013026106,0.0004516003,0.00008680848,0.000043463497,0.0023213273,0.0030606047,0.020352455,0.5200995,0.00002967007,0.44004872],"study_design_scores_gemma":[0.0020877821,0.002562856,0.06579846,0.0033803654,0.00008234409,0.0002536077,0.0000010559605,0.14448506,0.39333928,0.38464564,0.00073353096,0.0026300016],"about_ca_topic_score_codex":0.000020237312,"about_ca_topic_score_gemma":0.0000469606,"teacher_disagreement_score":0.8904519,"about_ca_system_score_codex":0.00020056668,"about_ca_system_score_gemma":0.00021265837,"threshold_uncertainty_score":0.99985963},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001952396,0.0002681227,0.9931011,0.0010264197,0.0006446962,0.00028915182,0.000042512358,0.00018103117,0.0024945335],"genre_scores_gemma":[0.68493307,0.00009901003,0.31119376,0.0017248985,0.0003831078,0.000011601409,0.00001725091,0.000058466037,0.0015788015],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718827,0.00006426236,0.00047729284,0.001041794,0.0007754144,0.00045293968],"domain_scores_gemma":[0.99742764,0.00045262653,0.00020805301,0.0015866846,0.00020198249,0.00012301114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005710726,0.00039928372,0.00047685314,0.00076240033,0.00019184014,0.0001993001,0.0028258322,0.00017070251,0.00003466368],"category_scores_gemma":[0.00008079486,0.0002988788,0.00011293116,0.0005091049,0.0012176386,0.00041643556,0.0009728396,0.000387844,0.00004145685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001548532,0.00009151516,0.000020630012,0.00004929934,0.000025148462,0.00023040512,0.0007530659,0.024294844,0.0061490457,0.45389462,0.00006191421,0.5144141],"study_design_scores_gemma":[0.0006560546,0.0007097123,0.0010093275,0.0014164117,0.000011018453,0.00008183011,5.4089395e-7,0.37209633,0.019216776,0.60300744,0.0006940983,0.0011004779],"about_ca_topic_score_codex":0.000027513177,"about_ca_topic_score_gemma":0.00002762804,"teacher_disagreement_score":0.6829807,"about_ca_system_score_codex":0.00015060385,"about_ca_system_score_gemma":0.0003513693,"threshold_uncertainty_score":0.99994636},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001247717,0.000085311076,0.9903013,0.0015619918,0.0010433164,0.00034515536,0.000009222828,0.00021522901,0.0063137203],"genre_scores_gemma":[0.080580354,0.00003353275,0.9164236,0.0018494241,0.00057230145,0.00000863988,0.0000042524052,0.000054487202,0.00047339546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575025,0.0000626695,0.0006142973,0.001741088,0.0010974562,0.000734222],"domain_scores_gemma":[0.9973336,0.00041413849,0.00025320007,0.001443951,0.00027663726,0.00027848128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071220903,0.00057718105,0.00054351485,0.00090635376,0.00032933243,0.0005409172,0.0027552554,0.00050390937,0.00007449216],"category_scores_gemma":[0.00009030718,0.00046833555,0.00020747991,0.0004478608,0.000599776,0.0007621121,0.001052995,0.00074841967,0.000094659255],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008724505,0.00002473203,0.000008628981,0.000024645653,0.000010410042,0.00004246191,0.00029339764,0.006225091,0.00506172,0.0058733975,0.0000091205,0.98241764],"study_design_scores_gemma":[0.00021319577,0.00003340329,0.000030965293,0.00034295316,0.000008612136,0.00011185773,8.344604e-8,0.8948085,0.0013988737,0.10221669,0.000262568,0.0005723377],"about_ca_topic_score_codex":0.0000047966605,"about_ca_topic_score_gemma":0.000028871758,"teacher_disagreement_score":0.9818453,"about_ca_system_score_codex":0.0004291049,"about_ca_system_score_gemma":0.00051931775,"threshold_uncertainty_score":0.99977684},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000069717506,0.00031866253,0.98040277,0.0010121957,0.00027585478,0.00023078706,0.0000052265646,0.00023908574,0.017445702],"genre_scores_gemma":[0.15011792,0.000052227308,0.8476474,0.0015001273,0.0001734974,0.000004834743,0.0000015750173,0.00003023698,0.0004721687],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693066,0.000016233638,0.00048222768,0.0012952967,0.0008460601,0.00042950746],"domain_scores_gemma":[0.99765354,0.00038610038,0.00032713392,0.0012664874,0.00024122633,0.00012550308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055973895,0.0004358615,0.0004814274,0.00082732836,0.00010275824,0.0006170961,0.002716553,0.0002425682,0.0000027844258],"category_scores_gemma":[0.0001743954,0.00038340964,0.00007419981,0.0004810248,0.0009935946,0.0010027809,0.0015583644,0.00056168006,0.000010206178],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075510134,0.000025882175,0.0000064495557,0.000039360326,0.0000030628369,0.00003658178,0.00034817788,0.0004684886,0.0004365717,0.020983351,0.000036528483,0.97760797],"study_design_scores_gemma":[0.00046679133,0.00084133557,0.00010279025,0.0024610036,0.000010406361,0.00018010223,8.9162825e-8,0.30259424,0.05421184,0.6328221,0.005013787,0.0012954838],"about_ca_topic_score_codex":0.00000787917,"about_ca_topic_score_gemma":0.00001623388,"teacher_disagreement_score":0.9763125,"about_ca_system_score_codex":0.00014781501,"about_ca_system_score_gemma":0.0003308789,"threshold_uncertainty_score":0.9998618},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031399124,0.00033553748,0.9932985,0.0009792395,0.0010723678,0.00028203957,0.00000566989,0.00014249905,0.0035701746],"genre_scores_gemma":[0.23796657,0.00007547115,0.756843,0.0023895656,0.0009576533,0.000017997741,0.000012605719,0.000052907806,0.0016842356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967352,0.000029136318,0.00038370152,0.0012717868,0.0010643112,0.0005158417],"domain_scores_gemma":[0.9980463,0.00045156223,0.00022930333,0.00082763267,0.00027703322,0.00016816928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054364436,0.0004269914,0.00037025023,0.0009216078,0.000342229,0.0005421048,0.0019228541,0.00018515573,0.000019222878],"category_scores_gemma":[0.000037138376,0.00031391394,0.00008504491,0.0007675423,0.0004137938,0.00081996236,0.0003770798,0.00036939755,0.000060868686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026487876,0.000035105484,0.00010905023,0.00004408472,0.00003436359,0.00018680854,0.0005264436,0.059200577,0.00048670493,0.26158345,0.000050175524,0.67771673],"study_design_scores_gemma":[0.00090595084,0.0006391777,0.00041472548,0.0009759194,0.00002344707,0.00023339606,2.4572373e-7,0.56468314,0.004122909,0.4178155,0.008739501,0.0014460976],"about_ca_topic_score_codex":0.000005701618,"about_ca_topic_score_gemma":0.000039092658,"teacher_disagreement_score":0.67627066,"about_ca_system_score_codex":0.00016618244,"about_ca_system_score_gemma":0.0005748367,"threshold_uncertainty_score":0.9999313},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008653907,0.0000417324,0.99438673,0.00025718898,0.0002959362,0.0003680509,0.0000050765125,0.00013802522,0.003641841],"genre_scores_gemma":[0.7180484,0.000007982565,0.28013098,0.0015808262,0.00012705644,0.000008275712,0.0000030122208,0.000023671117,0.00006978101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968513,0.00008229154,0.00056785427,0.0009696699,0.001014952,0.00051389955],"domain_scores_gemma":[0.99624497,0.0012855091,0.0005180297,0.0015558645,0.0003132739,0.000082355364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021605897,0.00039685017,0.00062839704,0.0017762101,0.00027604096,0.00034919754,0.0034710527,0.00022983532,0.000036686062],"category_scores_gemma":[0.00019428671,0.00027185955,0.000298293,0.0015478273,0.0007401825,0.00038898355,0.0011273068,0.0006204953,0.000008958795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044696685,0.000018185063,0.000028390972,0.000023514518,0.000084500265,0.000009551495,0.0004932619,0.015397386,0.00030136795,0.3366941,0.000007036416,0.64693826],"study_design_scores_gemma":[0.000060065064,0.00013084339,0.000041147083,0.00027753762,0.000065086664,0.0000108136155,1.2714708e-7,0.78254354,0.008160744,0.20831938,0.000071952294,0.00031875193],"about_ca_topic_score_codex":0.00002646541,"about_ca_topic_score_gemma":0.000043661512,"teacher_disagreement_score":0.76714617,"about_ca_system_score_codex":0.00017591163,"about_ca_system_score_gemma":0.000269775,"threshold_uncertainty_score":0.99997336},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2916234,0.00009059961,0.7075925,0.00025076236,0.00026838385,0.00010377684,2.1215669e-7,0.000029109273,0.000041260893],"genre_scores_gemma":[0.7328091,0.000017686798,0.26699698,0.00012416436,0.000044581328,0.0000034848044,8.0279693e-7,0.0000030283531,1.5122514e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844533,0.00014256482,0.0003809564,0.0004205615,0.00029016688,0.00032042974],"domain_scores_gemma":[0.9989023,0.00031507402,0.0001412558,0.00048453017,0.00012143246,0.00003539989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084643386,0.00013168616,0.00019258568,0.0003339682,0.00014858662,0.00013187695,0.0011041036,0.000052202522,0.0000032658431],"category_scores_gemma":[0.00004288014,0.00012832922,0.00002999926,0.0023320212,0.00034264347,0.00045657114,0.00063068117,0.00024899625,0.0000010397855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035135124,0.00005600695,0.025134949,0.0000060021243,0.0000011897698,0.00000646028,0.00039402032,0.19499779,0.0067859716,0.0050528017,0.0000022876554,0.767559],"study_design_scores_gemma":[0.0003076638,0.000029774568,0.021531822,0.00008819651,5.6305925e-7,0.000020526066,0.0000014051806,0.9626443,0.013342653,0.0018933937,0.000003856411,0.00013585288],"about_ca_topic_score_codex":0.00007347219,"about_ca_topic_score_gemma":0.00033616967,"teacher_disagreement_score":0.7676465,"about_ca_system_score_codex":0.00013235112,"about_ca_system_score_gemma":0.00008913149,"threshold_uncertainty_score":0.5233114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004553784,0.00024245141,0.9912407,0.0005554987,0.00013718756,0.000109158376,0.0000055851006,0.000043381136,0.003112299],"genre_scores_gemma":[0.09244585,0.00022791002,0.8954477,0.0034981917,0.0020719124,0.000007787375,0.00020860731,0.00004863066,0.006043427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983371,0.0000270837,0.00023152605,0.0007225004,0.00042441327,0.0002573905],"domain_scores_gemma":[0.9989334,0.00015316994,0.00011733339,0.00040890093,0.00026601722,0.00012118678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053421926,0.00020853727,0.0005070378,0.0013093377,0.00009420535,0.00015334703,0.00019329108,0.00012294632,0.00006601708],"category_scores_gemma":[0.00016237627,0.0001677393,0.00015293459,0.001624285,0.0008687251,0.000105356194,0.0001343191,0.00035281797,0.00003646839],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025272433,0.000046542602,0.0042503714,0.0001581958,0.00031643282,0.0001732361,0.0004633955,0.000078932775,0.0010143623,0.0000017023499,0.00053846196,0.9929331],"study_design_scores_gemma":[0.0011044008,0.000793145,0.015996912,0.0020706907,0.005917631,0.00041773776,0.0000012247974,0.91933584,0.0063450355,0.044513535,0.0020982744,0.0014055767],"about_ca_topic_score_codex":0.00004080394,"about_ca_topic_score_gemma":0.000034910292,"teacher_disagreement_score":0.9915275,"about_ca_system_score_codex":0.00012859904,"about_ca_system_score_gemma":0.0002529323,"threshold_uncertainty_score":0.68402106},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011024448,0.00006928934,0.99232125,0.0011925214,0.0006088549,0.0002673974,0.000061450766,0.00020904506,0.005259142],"genre_scores_gemma":[0.030792234,0.000049304876,0.9669386,0.0007902007,0.0003508934,0.000022224176,0.00001999425,0.00004043068,0.0009960879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964975,0.000032479275,0.00047716833,0.0015182458,0.0008039242,0.00067066756],"domain_scores_gemma":[0.9971911,0.0009070013,0.00025431707,0.0011713265,0.00023496462,0.00024134158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076322607,0.00042121435,0.000425494,0.00039021755,0.00033505165,0.00065988733,0.0030759904,0.00019847954,0.000044757042],"category_scores_gemma":[0.00016980065,0.0003349801,0.000074418225,0.0003348427,0.00073943275,0.00045680246,0.0010660497,0.00070625107,0.00019208988],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012311816,0.000013019685,0.000011098795,0.000008451499,0.000006009322,0.000047453865,0.00015869326,0.0008281442,0.00011972491,0.078947894,0.000047536752,0.9198107],"study_design_scores_gemma":[0.00033450016,0.00027817098,0.00017793041,0.00046666866,0.000009867741,0.00006126616,1.9580759e-7,0.7651883,0.00037230816,0.22136515,0.0108415205,0.0009041513],"about_ca_topic_score_codex":0.000012069067,"about_ca_topic_score_gemma":0.000013172617,"teacher_disagreement_score":0.91890657,"about_ca_system_score_codex":0.00018321861,"about_ca_system_score_gemma":0.00053595874,"threshold_uncertainty_score":0.99991024},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002141274,0.00012653867,0.99392045,0.00035621595,0.003179995,0.00035685615,0.0000031026634,0.00039062544,0.0014520857],"genre_scores_gemma":[0.049729295,0.00005010933,0.94744134,0.0013085972,0.0012972334,0.0000082594925,0.0000016984608,0.000041399377,0.00012205314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959187,0.00007200146,0.0005950002,0.0013265715,0.0014548722,0.0006328543],"domain_scores_gemma":[0.9975329,0.00062802335,0.00039034066,0.00095390424,0.00027311585,0.00022172373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013776986,0.00045040838,0.00046035182,0.0008578686,0.00029411318,0.00049894146,0.0023036483,0.0003555784,0.000050217324],"category_scores_gemma":[0.0003270059,0.00037349862,0.00013014712,0.0004905594,0.00083120115,0.0011590443,0.0012494627,0.00068286434,0.000036742043],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033682159,0.0000072770226,0.000044407865,0.00001564783,0.000009948295,0.000034808927,0.00034748885,0.0013581335,0.008539478,0.0009850826,0.000009628848,0.9886447],"study_design_scores_gemma":[0.0009402696,0.00041571827,0.00020857011,0.0015955196,0.00003342817,0.00029207495,4.972268e-7,0.6200235,0.14106618,0.23243628,0.00079205644,0.0021958943],"about_ca_topic_score_codex":0.000026479278,"about_ca_topic_score_gemma":0.00002166923,"teacher_disagreement_score":0.9864488,"about_ca_system_score_codex":0.00052249886,"about_ca_system_score_gemma":0.00059947587,"threshold_uncertainty_score":0.9998717},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001565,0.0004370064,0.9920818,0.0016598048,0.0018329934,0.0010708662,0.000014911465,0.00007198753,0.0012656152],"genre_scores_gemma":[0.47356588,0.0002622595,0.49153054,0.003276627,0.024025336,0.000007631063,0.00059709273,0.00018806044,0.0065466044],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998129,0.000014239974,0.00042218657,0.00064099615,0.0005190832,0.00027445695],"domain_scores_gemma":[0.99873817,0.00047862867,0.0002602119,0.00034072573,0.00010560829,0.000076669894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038157922,0.00028147045,0.00040773512,0.00040996424,0.00013134205,0.00010166031,0.00024233422,0.00013343758,0.00012057296],"category_scores_gemma":[0.000103003484,0.00021400182,0.00024098663,0.00008419964,0.00014409026,0.00036987098,0.000085537264,0.0001618216,0.000027676911],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002919949,0.0000061022165,0.016636947,0.00010002813,0.00015320405,0.00004520269,0.0013212007,0.010557037,0.0021323657,0.0052438607,0.000076383345,0.96343565],"study_design_scores_gemma":[0.015933143,0.0018506908,0.011166623,0.004604204,0.0010045777,0.00007841268,0.0000024159074,0.17666611,0.008418154,0.7039962,0.07330771,0.0029717903],"about_ca_topic_score_codex":0.00001369722,"about_ca_topic_score_gemma":0.000009707547,"teacher_disagreement_score":0.9604639,"about_ca_system_score_codex":0.00029936744,"about_ca_system_score_gemma":0.0001470753,"threshold_uncertainty_score":0.87267405},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016597223,0.0010364808,0.99139255,0.000054625572,0.00070514873,0.0003627262,0.0000028382017,0.00052363664,0.0042622667],"genre_scores_gemma":[0.9831071,0.00008153805,0.016443433,0.00004305883,0.0001861421,0.000017799379,0.0000028976972,0.00005759908,0.000060423346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983358,0.000028935918,0.00044997883,0.00045490236,0.00039238774,0.0003380012],"domain_scores_gemma":[0.9985615,0.00031407116,0.000115761744,0.00088165165,0.0000735065,0.000053534743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000606939,0.00030926,0.00034245188,0.0008492933,0.000073430776,0.00015019979,0.0010336217,0.0003186779,0.000010491796],"category_scores_gemma":[0.000045326466,0.00029776306,0.00004691701,0.00026974708,0.00016893646,0.00029810518,0.00029144515,0.00069230207,0.000022601555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032079827,0.00000962027,0.00017515106,0.00022102069,0.000010280356,0.00003378551,0.0010160891,0.49337018,0.0023000198,0.013897779,0.000009939324,0.48895293],"study_design_scores_gemma":[0.00015574614,0.000030885923,0.00024686957,0.0017341698,0.0000034150153,0.00002925139,3.5316106e-7,0.9663229,0.0023039319,0.02753278,0.0010192287,0.0006204542],"about_ca_topic_score_codex":0.00002254648,"about_ca_topic_score_gemma":0.00017695829,"teacher_disagreement_score":0.9814474,"about_ca_system_score_codex":0.0006446527,"about_ca_system_score_gemma":0.000054275242,"threshold_uncertainty_score":0.9999474},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006847634,0.00045390535,0.9857784,0.003149613,0.0013539647,0.00030646927,0.0000056949248,0.000089078414,0.008794433],"genre_scores_gemma":[0.78764397,0.00020118889,0.20063747,0.0095820865,0.0013351231,0.00002058649,0.000009067178,0.00007365722,0.000496833],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714404,0.000035263154,0.00050292816,0.0008787369,0.0009526092,0.00048639206],"domain_scores_gemma":[0.9972555,0.0004746991,0.00039596774,0.0014754098,0.0003046679,0.000093762195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063139707,0.00038390022,0.0003783165,0.00051810395,0.00017430376,0.00019915443,0.004754509,0.00020797293,0.000020628333],"category_scores_gemma":[0.000019645295,0.0002232861,0.0001334973,0.00063773425,0.00048297216,0.0005558746,0.0014875053,0.00037819037,0.000028316825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008195513,0.000018046514,0.00006105986,0.00009714549,0.000017989038,0.000015414884,0.005573532,0.005451072,0.0002763874,0.19915004,0.000010476275,0.78932065],"study_design_scores_gemma":[0.00059662777,0.00034701213,0.00033368432,0.0012534289,0.000025256415,0.00012067229,0.0000016879119,0.1898175,0.013414498,0.7817636,0.011296636,0.001029376],"about_ca_topic_score_codex":0.000026443577,"about_ca_topic_score_gemma":0.00010089079,"teacher_disagreement_score":0.7882913,"about_ca_system_score_codex":0.000080325655,"about_ca_system_score_gemma":0.00033639008,"threshold_uncertainty_score":0.91053426},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038691178,0.0012304324,0.46290588,0.008200342,0.0035048653,0.0002639106,0.0000055094206,0.000119835204,0.5237305],"genre_scores_gemma":[0.81049687,0.0028000318,0.052259047,0.0076661087,0.015625078,0.00004432551,0.000007686835,0.00010972589,0.11099113],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997687,0.000036818885,0.00026502457,0.00077904476,0.00071080937,0.00052133313],"domain_scores_gemma":[0.99877137,0.00035815485,0.0001670443,0.00045080602,0.00016188857,0.00009073626],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007338908,0.00023925406,0.00031401496,0.00025933646,0.00089034316,0.00009962381,0.0011315072,0.00038868564,0.00041030304],"category_scores_gemma":[0.00015521492,0.00018470068,0.000097660886,0.00018800733,0.00401092,0.00013307176,0.00030535334,0.0004190418,0.00023089834],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003698071,0.00001082555,0.00006782343,0.00000649509,0.0000062515637,0.000017383041,0.0023822943,0.000020864794,0.000023132152,0.36858845,0.000411606,0.6284612],"study_design_scores_gemma":[0.00023876267,0.00010771648,0.0011185743,0.0002786491,0.000012591005,0.0000061279475,0.000006025558,0.0006424859,0.000016954558,0.20895498,0.78789985,0.0007172942],"about_ca_topic_score_codex":0.000060974533,"about_ca_topic_score_gemma":0.00076085044,"teacher_disagreement_score":0.8104582,"about_ca_system_score_codex":0.000964378,"about_ca_system_score_gemma":0.0007253754,"threshold_uncertainty_score":0.9986996},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019973976,0.00023362205,0.996648,0.00006606443,0.0016583732,0.00028350786,0.00001724234,0.00018616462,0.00070725277],"genre_scores_gemma":[0.41621426,0.0003426816,0.58039594,0.00028506323,0.0007186442,0.000059248832,0.00006282899,0.00020129781,0.0017200622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988721,0.0000035393298,0.0002223064,0.00041193442,0.00021544074,0.00027468443],"domain_scores_gemma":[0.99952006,0.00008025165,0.000062729945,0.00021407036,0.000078290155,0.00004458011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017497652,0.0002586902,0.00023706253,0.0002917793,0.00010136487,0.00017195547,0.0003466553,0.00017949055,0.000055932018],"category_scores_gemma":[0.000022107097,0.00021796412,0.00005140248,0.000070395894,0.00012832959,0.0001773268,0.00006710304,0.000100866746,0.000005019492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010276693,0.000003051169,0.0000053841864,0.00035276046,0.000011660227,0.0000021210244,0.00021881949,0.78994393,0.0010557829,0.0049490663,0.000010309479,0.2034368],"study_design_scores_gemma":[0.00023668469,0.000025351568,0.000010220505,0.00044284662,0.0000091388065,0.0000050774206,3.851627e-8,0.9546908,0.005003062,0.03608754,0.003135911,0.0003533096],"about_ca_topic_score_codex":0.0000012720991,"about_ca_topic_score_gemma":0.0000076178485,"teacher_disagreement_score":0.4162521,"about_ca_system_score_codex":0.00018489675,"about_ca_system_score_gemma":0.00004617068,"threshold_uncertainty_score":0.88883185},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009014199,0.0003781173,0.9917629,0.0015534043,0.0035863016,0.0007345119,0.000009848869,0.000083215826,0.0018827174],"genre_scores_gemma":[0.10339436,0.00016231007,0.888031,0.002617415,0.004492194,0.000082572944,0.000013773882,0.00007945627,0.0011269168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642384,0.000059634633,0.0005560928,0.0015362068,0.00058183935,0.00084241276],"domain_scores_gemma":[0.9980269,0.00047077725,0.0002568469,0.0009523904,0.00014575444,0.00014732823],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009046951,0.00047681318,0.00048194246,0.0004502065,0.00026337072,0.00035936,0.001758612,0.00035288848,0.000017836788],"category_scores_gemma":[0.000057057372,0.00038752228,0.00015239467,0.00043022135,0.00030299975,0.00061503856,0.0007180717,0.0005034019,0.000018266795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013723072,0.00002913292,0.0001214745,0.000018643042,0.000012345384,0.000025850362,0.00022934207,0.3069809,0.00012255558,0.010636304,0.00020564762,0.6816041],"study_design_scores_gemma":[0.00043845942,0.00024571663,0.0004661938,0.00040033067,0.000008574383,0.000012775975,6.371253e-8,0.8929017,0.00046365228,0.09915831,0.0054333643,0.0004708267],"about_ca_topic_score_codex":0.0000080156005,"about_ca_topic_score_gemma":0.00014802392,"teacher_disagreement_score":0.6811332,"about_ca_system_score_codex":0.00030431466,"about_ca_system_score_gemma":0.00022965674,"threshold_uncertainty_score":0.99985766},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018300326,0.00023916758,0.99690604,0.00029027465,0.00033257957,0.00021817842,0.0000025616218,0.000062197774,0.00011896695],"genre_scores_gemma":[0.9102894,0.00002154721,0.08878908,0.00041924493,0.00033367117,0.0000060864386,0.000023205137,0.000020140125,0.00009759996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997282,0.00007388121,0.00047935118,0.0010836123,0.0005826855,0.0004984163],"domain_scores_gemma":[0.99846005,0.0004005484,0.00034243547,0.0004800885,0.00021715736,0.00009968639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061174185,0.00035104516,0.0006264973,0.0013318793,0.00022209596,0.00020024748,0.0014431825,0.00030899062,0.000011795261],"category_scores_gemma":[0.000027571848,0.00033885535,0.00020482468,0.0031088,0.00032455818,0.00026681685,0.0005098593,0.001079834,0.0000012186424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003227045,0.000009886192,0.0018433478,0.0000071763097,0.000023685616,0.000003699152,0.00006266583,0.9058996,0.00013325985,0.0053551774,0.0000053536273,0.08665296],"study_design_scores_gemma":[0.00014448304,0.000053396077,0.0022388673,0.00008494171,0.000046127854,0.000015150947,7.10751e-8,0.99276567,0.000030862146,0.00416169,0.00014372532,0.0003150155],"about_ca_topic_score_codex":0.000061999184,"about_ca_topic_score_gemma":0.00026274592,"teacher_disagreement_score":0.90845937,"about_ca_system_score_codex":0.00020969044,"about_ca_system_score_gemma":0.00015060669,"threshold_uncertainty_score":0.99990636},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14520027,0.0015479712,0.8505817,0.0009680425,0.0013684176,0.0002659526,0.00001795217,0.000008160019,0.000041557945],"genre_scores_gemma":[0.90112966,0.00028076,0.0976226,0.00018721588,0.00072711584,0.000022147051,0.000010224888,0.000017504244,0.000002772244],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981618,0.000043765875,0.00027387126,0.0006939919,0.00042585545,0.0004007267],"domain_scores_gemma":[0.99786854,0.00007395148,0.00016578163,0.0016532867,0.00016929608,0.00006915834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006876203,0.00022187228,0.0002004936,0.00010403981,0.00010552095,0.0000714036,0.0026195222,0.00021624444,0.0000019220902],"category_scores_gemma":[0.0001889933,0.00013909105,0.0000949053,0.00022094499,0.00076070946,0.0000030163656,0.003422504,0.00022499035,0.0000029064183],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001654698,0.000029955436,0.004062342,0.00003619385,0.000038545433,0.000005145267,0.00011803391,0.004508166,0.43967193,0.00002228557,0.00007027325,0.55142057],"study_design_scores_gemma":[0.0009871217,0.0003782191,0.023924774,0.00022182016,0.000023863919,0.000014078883,0.0000012571273,0.025496367,0.82566965,0.12078018,0.0016586141,0.0008440386],"about_ca_topic_score_codex":0.00003196671,"about_ca_topic_score_gemma":0.00024165671,"teacher_disagreement_score":0.7559294,"about_ca_system_score_codex":0.000039972645,"about_ca_system_score_gemma":0.00035084528,"threshold_uncertainty_score":0.56719685},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52591044,0.0000942811,0.47311956,0.000087836626,0.0004149356,0.00033078442,8.635927e-8,0.000004922165,0.00003716494],"genre_scores_gemma":[0.9875577,0.000002174175,0.012346083,0.00007122011,0.000010502098,0.0000071331765,7.1833606e-9,0.0000032147484,0.0000019457107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768764,0.0011763113,0.00024776536,0.00031219638,0.0003687665,0.00020731526],"domain_scores_gemma":[0.9961279,0.0028232264,0.00020403658,0.0006456839,0.00016548958,0.000033637134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031062227,0.00010815058,0.00016878298,0.00006756994,0.00040591595,0.000120401746,0.0013537864,0.000028219112,0.000001164699],"category_scores_gemma":[0.00087894616,0.0000544592,0.000034768458,0.0015892421,0.0005257465,0.00019468291,0.00046568454,0.00022365508,2.5059373e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051973624,0.0010500082,0.32855338,0.00015315367,0.000052127616,0.00004125733,0.07692737,0.42421186,0.017527439,0.009408412,0.00002037053,0.14200264],"study_design_scores_gemma":[0.002271785,0.0012369312,0.25674585,0.00076618645,0.000031917334,0.0011672125,0.001513842,0.50407064,0.22603807,0.0056109843,0.000059581263,0.00048698945],"about_ca_topic_score_codex":0.00015338795,"about_ca_topic_score_gemma":0.000049474147,"teacher_disagreement_score":0.4616473,"about_ca_system_score_codex":0.00002928464,"about_ca_system_score_gemma":0.0002454141,"threshold_uncertainty_score":0.31220183},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016693273,0.00012839567,0.9840684,0.0007418875,0.0005515841,0.00037214218,0.00001976323,0.00048259035,0.013468299],"genre_scores_gemma":[0.74063796,0.000092435905,0.25686646,0.0016895509,0.00029439662,0.000016914624,0.0000071012932,0.000063103595,0.00033210783],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961417,0.000018196864,0.00048970943,0.0016782152,0.000855046,0.000817162],"domain_scores_gemma":[0.99784535,0.00034747165,0.00021285488,0.0012825514,0.00011259703,0.00019916608],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004893697,0.00069854036,0.0005644177,0.0011801559,0.00031937545,0.00090255396,0.0023985885,0.00036452682,0.000005936835],"category_scores_gemma":[0.000028295615,0.00049379223,0.0001803939,0.00040369754,0.0009019327,0.0012940044,0.0006164856,0.00071759557,0.00000969257],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013843244,0.000028139191,0.00029298852,0.000046248548,0.000009190551,0.0001501819,0.0001256418,0.00059171626,0.00058916287,0.015246384,0.0000064207,0.9829001],"study_design_scores_gemma":[0.001404518,0.0008472374,0.00031539338,0.0048137773,0.000015557429,0.00023964366,1.6626255e-7,0.32261142,0.03378249,0.6140122,0.018740065,0.003217543],"about_ca_topic_score_codex":0.0000012015013,"about_ca_topic_score_gemma":0.0000023359555,"teacher_disagreement_score":0.97968256,"about_ca_system_score_codex":0.00012881788,"about_ca_system_score_gemma":0.00015023258,"threshold_uncertainty_score":0.9997514},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010740126,0.00062630844,0.9575756,0.0003560137,0.0022291776,0.00083937286,0.0000084818075,0.00040992387,0.03794433],"genre_scores_gemma":[0.028474912,0.000031594223,0.9629676,0.0012325003,0.0014609378,0.00010157828,0.0000056560307,0.00009393344,0.0056313025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953565,0.000056967114,0.0007168601,0.0020046,0.00077239063,0.0010926923],"domain_scores_gemma":[0.9956809,0.0015532973,0.00050203543,0.0016682101,0.00035012647,0.00024541488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025865142,0.000709714,0.00075344037,0.0007207369,0.00048892427,0.0006389328,0.0043140706,0.0004235109,0.00003024163],"category_scores_gemma":[0.00045035937,0.0005159679,0.000298452,0.00044286443,0.0008075207,0.0007103293,0.001658686,0.00056049495,0.00008811303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066215152,0.000018756902,0.000010728954,0.00006954282,0.000010496081,0.000009051926,0.00061162567,0.00031488884,0.00006235848,0.52068025,0.00003105365,0.4781746],"study_design_scores_gemma":[0.00041937415,0.00018408286,0.000009352245,0.00051228976,0.000009617453,0.000052287054,3.3460088e-7,0.13176852,0.003265955,0.8593815,0.003610578,0.0007860738],"about_ca_topic_score_codex":0.0000019960778,"about_ca_topic_score_gemma":0.0000065536046,"teacher_disagreement_score":0.47738853,"about_ca_system_score_codex":0.0003489224,"about_ca_system_score_gemma":0.0006606907,"threshold_uncertainty_score":0.9997292},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036301458,0.00031945042,0.9935864,0.0011964509,0.0017160913,0.00026995502,0.0000098836135,0.00016520542,0.0023735329],"genre_scores_gemma":[0.73553604,0.000066900655,0.26233363,0.00066284207,0.0009839591,0.000007696398,0.0000047994613,0.000064168016,0.0003399853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99589586,0.00005653366,0.00070418086,0.0015544262,0.0011228046,0.00066618045],"domain_scores_gemma":[0.99665457,0.00066723203,0.00045337455,0.0017615319,0.00026907978,0.00019423953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090969587,0.00050193333,0.0006243009,0.00091002946,0.00019819614,0.00019509508,0.0038223972,0.0003334687,0.000015312904],"category_scores_gemma":[0.00012286774,0.00039076584,0.00018838284,0.0005874505,0.0009848683,0.0003004481,0.0011273061,0.0007964449,0.000037871167],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024952888,0.00002400828,0.000014516211,0.000035323912,0.0000083859895,0.000026727761,0.0003659012,0.007160522,0.0006837483,0.14384657,0.000006972045,0.8478248],"study_design_scores_gemma":[0.0002227215,0.00019284795,0.00022644301,0.00056380057,0.000004556008,0.000066163564,3.4228762e-8,0.65865874,0.0017510578,0.3369289,0.0009024351,0.00048226328],"about_ca_topic_score_codex":0.0000063838547,"about_ca_topic_score_gemma":0.0000036010124,"teacher_disagreement_score":0.84734255,"about_ca_system_score_codex":0.00015038604,"about_ca_system_score_gemma":0.0006279232,"threshold_uncertainty_score":0.99985445},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014132658,0.000054781558,0.9931742,0.00065719715,0.0012727192,0.00058281067,0.000035233974,0.00042921826,0.0023805755],"genre_scores_gemma":[0.82683593,0.00028224167,0.15006861,0.004974448,0.0026054871,0.00019954218,0.00058094,0.0003056901,0.01414714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964273,0.000064052205,0.0004856891,0.0015534144,0.0008899738,0.0005796008],"domain_scores_gemma":[0.99805063,0.00021406,0.00047511907,0.0007348324,0.00034905938,0.00017632783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006173545,0.00057029544,0.00043621447,0.0006984084,0.0003970228,0.0005098013,0.00093689485,0.00034229032,0.0002815137],"category_scores_gemma":[0.00003567967,0.00044259903,0.00012237352,0.0004063303,0.00034236885,0.0022459284,0.00028143672,0.00063662056,0.0005626265],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040230825,0.00004700893,0.000012354793,0.00004855639,0.000022568509,0.000022512299,0.00011977835,0.00014565335,0.0029753062,0.00019362371,0.00010047489,0.9962719],"study_design_scores_gemma":[0.0029581569,0.003434547,0.0009088997,0.0034922082,0.00016709411,0.0007558252,7.606965e-7,0.5874971,0.019536987,0.36862412,0.007990707,0.0046335687],"about_ca_topic_score_codex":0.00000995619,"about_ca_topic_score_gemma":0.000056787543,"teacher_disagreement_score":0.99163836,"about_ca_system_score_codex":0.000491348,"about_ca_system_score_gemma":0.00034219425,"threshold_uncertainty_score":0.9998026},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068972404,0.00046193512,0.99031264,0.0029132443,0.0027462156,0.0005254486,0.000025753696,0.00013771975,0.0028080482],"genre_scores_gemma":[0.07587242,0.00005932737,0.9147031,0.002003368,0.002357509,0.00005029553,0.00002109411,0.000046442332,0.004886466],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996903,0.000030012638,0.00045339778,0.0013707532,0.000691811,0.0005510029],"domain_scores_gemma":[0.99743444,0.0009375494,0.00025650088,0.0008051187,0.00040675513,0.00015965862],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078117533,0.0004014317,0.00038784143,0.0007959096,0.0003380465,0.0003904573,0.0020512242,0.0002489788,0.000023058183],"category_scores_gemma":[0.00016767652,0.0003308179,0.0001656701,0.0005398124,0.00039377398,0.00064551947,0.0005443245,0.0002753149,0.00004507244],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011913936,0.00002464921,0.000009998429,0.000030231386,0.000015057171,0.000018124263,0.000312641,0.013537396,0.0010641685,0.053602695,0.00020207082,0.93117106],"study_design_scores_gemma":[0.00048291424,0.00044669068,0.000042119384,0.0003201341,0.000011210034,0.00007782438,1.6164583e-7,0.4629263,0.007566163,0.503276,0.02402507,0.00082540594],"about_ca_topic_score_codex":0.000005449803,"about_ca_topic_score_gemma":0.00003571473,"teacher_disagreement_score":0.93034565,"about_ca_system_score_codex":0.000232039,"about_ca_system_score_gemma":0.000816432,"threshold_uncertainty_score":0.9999144},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014747199,0.000115812785,0.9945628,0.00034183604,0.0004987988,0.00048694492,0.000025317166,0.00008144396,0.003872303],"genre_scores_gemma":[0.797486,0.0000036241042,0.19017868,0.00028840534,0.011447816,0.000117052645,0.000051820076,0.00007226652,0.00035435735],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798506,0.000028921428,0.0004295318,0.00082007836,0.00024310249,0.00049327785],"domain_scores_gemma":[0.998385,0.00074077724,0.00022481842,0.00043162057,0.0001535738,0.00006421825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053926435,0.0003596468,0.00048513536,0.00049994816,0.00021678806,0.00012601094,0.00071984506,0.00031236422,0.00012536632],"category_scores_gemma":[0.000014821202,0.00031565633,0.00023841047,0.00039346245,0.00031622755,0.00010266985,0.00023556511,0.00067580974,0.000007001302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014865853,0.00003276283,0.000805384,0.000012856481,0.00001760403,0.0000010578229,0.00011841834,0.013426006,0.0000057253965,0.09068737,0.00015046267,0.89472747],"study_design_scores_gemma":[0.00018340825,0.000047139038,0.0001271993,0.000425063,0.000014709797,1.5759882e-7,5.2312245e-8,0.45143807,0.000040240935,0.54462755,0.0028435066,0.0002529123],"about_ca_topic_score_codex":0.000007213005,"about_ca_topic_score_gemma":0.00003521865,"teacher_disagreement_score":0.89447457,"about_ca_system_score_codex":0.00021480054,"about_ca_system_score_gemma":0.00024699443,"threshold_uncertainty_score":0.99992955},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042059444,0.000027639591,0.98095304,0.0026417729,0.0017868918,0.00066104415,0.000015802712,0.00014546515,0.013347745],"genre_scores_gemma":[0.8756443,0.0000073429305,0.0762365,0.038703803,0.0028729513,0.00011903602,0.000012967906,0.00010145447,0.006301647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967842,0.00007977257,0.0003899636,0.0013710355,0.0008398846,0.00053510483],"domain_scores_gemma":[0.9983606,0.00060732925,0.00023190063,0.00051556784,0.00009342441,0.00019121269],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005372317,0.00034723248,0.0002711986,0.00040922128,0.00034739307,0.00021507197,0.00085486326,0.00013180044,0.000055651333],"category_scores_gemma":[0.00031763874,0.00029135495,0.00008836995,0.00055074075,0.000630135,0.00026265075,0.00026177842,0.00043630705,0.00015254838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010122593,0.00009317784,0.00006125433,0.0000519863,0.000006475404,0.000039623108,0.00066116423,0.09474709,0.07930837,0.10209937,0.0013123462,0.7215179],"study_design_scores_gemma":[0.0013209371,0.000522498,0.0012856026,0.00046972782,0.000017735536,0.0007173808,0.0000012742653,0.78068084,0.040879145,0.16000293,0.012021098,0.0020808117],"about_ca_topic_score_codex":0.000002731397,"about_ca_topic_score_gemma":0.000009568344,"teacher_disagreement_score":0.90471655,"about_ca_system_score_codex":0.0003813785,"about_ca_system_score_gemma":0.0002319398,"threshold_uncertainty_score":0.99995387},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001632082,0.00014709077,0.9656394,0.0026490681,0.0009006962,0.00037617388,0.00000361846,0.00019655986,0.030071061],"genre_scores_gemma":[0.21743768,0.0000050736903,0.7715815,0.008967254,0.0009589202,0.000030348523,0.0000035754265,0.000040034796,0.0009756363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957509,0.00003205287,0.0004901461,0.001918888,0.0011100725,0.0006979351],"domain_scores_gemma":[0.9975962,0.0002444918,0.00029710468,0.0013208546,0.00028189196,0.00025947648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007826799,0.00050559716,0.00047678198,0.00073173083,0.0003202086,0.0006838419,0.0036083208,0.00028297893,0.000022017859],"category_scores_gemma":[0.0000428848,0.0003980919,0.0001201183,0.0007048333,0.0004655882,0.0005973944,0.00066311914,0.000493018,0.000113875045],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006082126,0.000030291387,0.00001711244,0.000043941323,0.000003633671,0.000009545881,0.0002982027,0.022928463,0.00077336613,0.024174789,0.00013107261,0.9515835],"study_design_scores_gemma":[0.0004324601,0.00014002094,0.0002116503,0.00093871285,0.0000070309293,0.000027100863,9.7284534e-8,0.9180925,0.0038847483,0.065890975,0.009264543,0.0011101717],"about_ca_topic_score_codex":0.0000026178498,"about_ca_topic_score_gemma":0.0000032669643,"teacher_disagreement_score":0.9504733,"about_ca_system_score_codex":0.00035174907,"about_ca_system_score_gemma":0.00095546065,"threshold_uncertainty_score":0.9998471},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009476931,0.00016783508,0.9948449,0.000318754,0.0020962986,0.002078485,0.00001847232,0.00006228158,0.0003181826],"genre_scores_gemma":[0.29138824,0.00012853,0.7033364,0.0016071169,0.00078195345,0.0005495394,0.000021529195,0.00011846159,0.002068211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961004,0.00005463173,0.0005996742,0.0017050138,0.00082226435,0.00071801885],"domain_scores_gemma":[0.9979022,0.00034926605,0.0004180926,0.0011230636,0.000053948286,0.00015341864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007122525,0.0005341269,0.00055264216,0.00062838953,0.00017924033,0.000209517,0.0020180978,0.00034896782,0.000015096036],"category_scores_gemma":[0.00003632076,0.00043611863,0.00015139606,0.00019527825,0.00016843928,0.00048656293,0.0007438767,0.0003065745,0.000049606777],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017769558,0.00006732602,0.000015699705,0.000033292727,0.000020130663,0.00005311314,0.0009078996,0.016032932,0.004730428,0.009124545,0.0000056810636,0.96899116],"study_design_scores_gemma":[0.0036392568,0.0015613374,0.00045581843,0.0022417484,0.000032051004,0.00019301141,0.0000010501998,0.54536194,0.09279539,0.33869743,0.011877928,0.0031430062],"about_ca_topic_score_codex":0.000022681985,"about_ca_topic_score_gemma":0.00011755319,"teacher_disagreement_score":0.96584815,"about_ca_system_score_codex":0.0010928895,"about_ca_system_score_gemma":0.00019329476,"threshold_uncertainty_score":0.9998091},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002618128,0.00025008447,0.98802805,0.0033666857,0.0029893876,0.0011973464,0.000016051144,0.00025347547,0.0036370903],"genre_scores_gemma":[0.08924969,0.0000139107005,0.9005729,0.006955006,0.0014291806,0.00009476142,0.000013184136,0.000075322896,0.0015960485],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949507,0.000054521846,0.0005974762,0.0025064272,0.00092071114,0.00097014906],"domain_scores_gemma":[0.99571097,0.001109465,0.0002972595,0.0022768294,0.00023054212,0.00037492986],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011561333,0.0006207688,0.0007760216,0.00062910985,0.00040386347,0.005865851,0.012823921,0.00039270657,0.000037647398],"category_scores_gemma":[0.0004485894,0.00048255827,0.00012905031,0.00043900372,0.00034617019,0.0032260036,0.0044461777,0.00039638067,0.000037388836],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026820053,0.000036544316,0.00004713463,0.000013380087,0.000021634964,0.000026111855,0.0033453514,0.001483214,0.0008098534,0.007626191,0.0002197821,0.986344],"study_design_scores_gemma":[0.0031168151,0.0015582007,0.00048986066,0.0034236026,0.000044896762,0.000051099974,0.000015880036,0.22318263,0.010658876,0.6973345,0.05624916,0.0038744684],"about_ca_topic_score_codex":0.00019340984,"about_ca_topic_score_gemma":0.000285234,"teacher_disagreement_score":0.9824695,"about_ca_system_score_codex":0.00029340427,"about_ca_system_score_gemma":0.00050802453,"threshold_uncertainty_score":0.9997626},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003834831,0.00037140842,0.6726795,0.0048148558,0.006678166,0.00078084203,0.00003091067,0.0002116878,0.31059784],"genre_scores_gemma":[0.9889121,0.00017320225,0.0012744649,0.0010709086,0.0047745146,0.000012342018,0.000005782669,0.000044873974,0.0037317998],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968568,0.00012115289,0.00036014072,0.00081222027,0.0009747457,0.00087495125],"domain_scores_gemma":[0.9981651,0.0010370445,0.00020103455,0.0002604941,0.00016460406,0.00017175163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016965261,0.00032655286,0.00044705402,0.00039828848,0.0005259039,0.00035232486,0.0011400338,0.0005595206,0.00011999046],"category_scores_gemma":[0.00058215176,0.00029368425,0.0001416086,0.00040018992,0.0018006908,0.00028612616,0.00031697346,0.00069101335,0.00004389934],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014108917,0.000022554454,0.0015305543,0.000013832408,0.000007002384,0.000045040862,0.019542929,0.00023919024,0.0000018411461,0.021327753,0.00005471571,0.95720047],"study_design_scores_gemma":[0.0020554264,0.00029366673,0.010342654,0.0049087955,0.000048327653,0.000012124228,0.000138149,0.0031989613,0.00001382826,0.85026413,0.123864904,0.0048590577],"about_ca_topic_score_codex":0.0002838062,"about_ca_topic_score_gemma":0.010406239,"teacher_disagreement_score":0.98507726,"about_ca_system_score_codex":0.00068192504,"about_ca_system_score_gemma":0.0006593122,"threshold_uncertainty_score":0.99995154},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021150722,0.00033422123,0.9932662,0.00040152468,0.0025048659,0.0011618219,0.000025343392,0.00065405184,0.0016498585],"genre_scores_gemma":[0.0031750728,0.000074243035,0.9941687,0.0010832397,0.00050755334,0.000060747683,0.0000066138537,0.00008379782,0.00084001175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938564,0.00010811283,0.0009236081,0.0026483773,0.0014229371,0.0010405978],"domain_scores_gemma":[0.9948961,0.0013620983,0.0007647983,0.00173182,0.0009226483,0.00032255036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007865867,0.0009895905,0.00090555777,0.0012840277,0.00047828013,0.00068852457,0.0033484858,0.0007131639,0.0000610946],"category_scores_gemma":[0.0005848541,0.00084714056,0.00021643713,0.0010911706,0.0011458639,0.001726323,0.0011283907,0.0012150616,0.00027797962],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002879838,0.00005375985,0.0000044337316,0.000019171503,0.000025392917,0.00006652917,0.0010084957,0.03224158,0.000061953324,0.017950283,0.000003755559,0.9485618],"study_design_scores_gemma":[0.0005562349,0.00014131954,0.0000740208,0.000685915,0.000009980492,0.00007459546,5.3103906e-7,0.82873774,0.0012003062,0.1674112,0.00019700454,0.0009111748],"about_ca_topic_score_codex":0.000010056097,"about_ca_topic_score_gemma":0.000013033618,"teacher_disagreement_score":0.9476506,"about_ca_system_score_codex":0.0011533117,"about_ca_system_score_gemma":0.0008147899,"threshold_uncertainty_score":0.99939793},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014627732,0.00005949563,0.9929087,0.00093841454,0.0019476772,0.00090074335,0.0000053218473,0.00007375529,0.0030195962],"genre_scores_gemma":[0.28584993,0.00002537749,0.71253896,0.00074105244,0.00035474793,0.0000806329,0.000013996918,0.000019165356,0.0003761357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748564,0.000028347813,0.0006376186,0.00089537207,0.0005368063,0.00041620457],"domain_scores_gemma":[0.9978606,0.00033107537,0.0004845677,0.0009699428,0.00027493076,0.00007886557],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013301262,0.00028560628,0.00032485684,0.0008111393,0.00021156266,0.0013414104,0.0029419758,0.00027724082,0.000009683086],"category_scores_gemma":[0.0001635329,0.00025425208,0.000063046085,0.00035164336,0.00015527813,0.00471751,0.0009236688,0.00038224744,0.000023683462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003902667,0.000011483274,0.00009730952,0.000029679859,0.0000018788724,0.000002661217,0.0003920279,0.0034777168,0.00019905888,0.038124643,0.00000623684,0.9576534],"study_design_scores_gemma":[0.00042196093,0.00004593171,0.0009751594,0.0004583235,0.0000028060347,0.000018976716,1.9475083e-7,0.7878999,0.00038511434,0.20632662,0.003110528,0.0003544569],"about_ca_topic_score_codex":0.00008501,"about_ca_topic_score_gemma":0.00023444575,"teacher_disagreement_score":0.95729893,"about_ca_system_score_codex":0.00061383133,"about_ca_system_score_gemma":0.0006036405,"threshold_uncertainty_score":0.999991},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034017747,0.00019946523,0.9664506,0.009028121,0.003632317,0.00052263925,0.000037556663,0.00009387217,0.01969527],"genre_scores_gemma":[0.9543463,0.0004951953,0.015244111,0.013319103,0.0019097275,0.00003285874,0.000002611648,0.00014114728,0.014508955],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966865,0.000056756962,0.0005686337,0.0009151204,0.0013138192,0.00045917358],"domain_scores_gemma":[0.9958761,0.002425457,0.00041188783,0.0009698958,0.00023237595,0.00008431284],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008597183,0.00031492524,0.00029964675,0.0003736312,0.00043989506,0.00012793754,0.0021703672,0.00019649013,0.00007759052],"category_scores_gemma":[0.0017888234,0.00018713399,0.00008811402,0.0004829865,0.00499967,0.00014481315,0.0005858001,0.00081400445,0.000046397443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015231422,0.00003432875,0.000017720182,0.000049205835,0.0000055808755,0.00003103562,0.00023067721,0.00015428227,0.12776598,0.16683178,0.00012732168,0.7047369],"study_design_scores_gemma":[0.0003021335,0.00018584552,0.0000588545,0.0005597514,0.00000856266,0.000032724747,8.025617e-8,0.0042121187,0.18395388,0.79251343,0.01768229,0.0004903199],"about_ca_topic_score_codex":0.0000028516495,"about_ca_topic_score_gemma":0.000029472832,"teacher_disagreement_score":0.95400614,"about_ca_system_score_codex":0.00009817714,"about_ca_system_score_gemma":0.00033564403,"threshold_uncertainty_score":0.99770814},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006290003,0.00028031436,0.9957919,0.0004941797,0.00085380685,0.0005214417,0.0000068381637,0.00018910662,0.0018561168],"genre_scores_gemma":[0.1259686,0.000014565452,0.872079,0.0011865566,0.00048393852,0.000038324783,0.0000024068097,0.000043743905,0.00018283335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99545485,0.00006696287,0.00074018794,0.0019165621,0.0007105983,0.0011108309],"domain_scores_gemma":[0.99550086,0.0023555248,0.00033379905,0.0012339244,0.00036581908,0.00021004982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002312495,0.0006109745,0.00069476804,0.00088794954,0.0002582697,0.00056678575,0.003534738,0.00052392454,0.000008433541],"category_scores_gemma":[0.0004006749,0.00051079644,0.00013891098,0.00080572383,0.0003368925,0.0006417923,0.0011462007,0.0008891092,0.000008658883],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056078916,0.000014415437,0.00010840919,0.000027911863,0.0000054820257,0.000034716555,0.00025313155,0.095747076,0.00009129965,0.04241551,0.0000113440965,0.8612851],"study_design_scores_gemma":[0.0001935457,0.00010324887,0.000039282764,0.0003718135,0.0000031585837,0.000028871784,1.0263549e-7,0.6156226,0.000116250005,0.38295427,0.00013925937,0.00042762293],"about_ca_topic_score_codex":0.000057258687,"about_ca_topic_score_gemma":0.0002652473,"teacher_disagreement_score":0.8608575,"about_ca_system_score_codex":0.00033290443,"about_ca_system_score_gemma":0.00081505877,"threshold_uncertainty_score":0.99973434},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000069568334,0.00038063145,0.9875453,0.00060255645,0.0014339272,0.0002079526,0.00000928561,0.00013376228,0.009617028],"genre_scores_gemma":[0.42098233,0.000090090005,0.57596165,0.0009826705,0.0006153354,0.0000064471774,0.0000038015332,0.000044160068,0.0013135022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996167,0.00004958558,0.0006732511,0.0014201707,0.0010250623,0.0006649556],"domain_scores_gemma":[0.9971556,0.00028925188,0.0004053335,0.0016135677,0.00030667143,0.00022958216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006476376,0.00052343804,0.0006447196,0.0006588973,0.00016464764,0.00023154895,0.0038462395,0.00038603036,0.000038902534],"category_scores_gemma":[0.00004267297,0.0004005735,0.00015406747,0.00038222756,0.00074115914,0.0005165023,0.0013845171,0.0005852046,0.000034755143],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071604277,0.00002802553,0.000038086353,0.00004107565,0.000009895313,0.000040014544,0.00027798154,0.010137088,0.0021067571,0.11118932,0.000067135814,0.87605745],"study_design_scores_gemma":[0.00027817723,0.00017919298,0.00006590721,0.0010107853,0.000006291826,0.000043816388,3.156023e-8,0.6306201,0.006424755,0.36012575,0.0006126415,0.00063256547],"about_ca_topic_score_codex":0.000022803622,"about_ca_topic_score_gemma":0.000015984418,"teacher_disagreement_score":0.8754249,"about_ca_system_score_codex":0.00014206576,"about_ca_system_score_gemma":0.00055866735,"threshold_uncertainty_score":0.9998446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025303181,0.00016700682,0.98929673,0.00083330483,0.0018164649,0.00026491482,0.0000200599,0.00021877448,0.0073574544],"genre_scores_gemma":[0.0029957837,0.00015250691,0.99482983,0.0009109017,0.00056812336,0.000016064125,0.000018243198,0.000029871562,0.00047869515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965397,0.000017590974,0.00042294114,0.0016376919,0.0008716893,0.0005103615],"domain_scores_gemma":[0.99737453,0.00029616436,0.000245251,0.0017377265,0.00017520344,0.00017112227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003644483,0.00044153564,0.00038710053,0.00068720535,0.0004114106,0.00039151666,0.002888209,0.0002490411,0.000024744837],"category_scores_gemma":[0.000057990288,0.0004124183,0.0001027387,0.0006435431,0.00097368995,0.00049505796,0.0007631057,0.0007569623,0.00015862132],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011830228,0.000021221782,0.0000014577774,0.000004946114,0.0000051599213,0.000032735283,0.00019919562,0.0027072595,0.000018160126,0.048067134,0.00025699666,0.9486846],"study_design_scores_gemma":[0.00035086393,0.00032891575,0.000058361526,0.00038583612,0.000008149005,0.0007730131,2.0224995e-7,0.71138275,0.0011955529,0.26274997,0.02164489,0.001121522],"about_ca_topic_score_codex":0.00001796728,"about_ca_topic_score_gemma":0.0000051295565,"teacher_disagreement_score":0.94756305,"about_ca_system_score_codex":0.00024289037,"about_ca_system_score_gemma":0.00048329393,"threshold_uncertainty_score":0.99983275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015240618,0.0013754023,0.9805965,0.0023990634,0.0024477583,0.0002742117,0.000016582992,0.00013623819,0.012601837],"genre_scores_gemma":[0.5721406,0.000038624545,0.4200548,0.00087386934,0.0012434452,0.000011533043,0.000004433633,0.00006569586,0.00556703],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939837,0.00006678906,0.0009032957,0.0017268732,0.0023492866,0.0009700887],"domain_scores_gemma":[0.9951987,0.002320096,0.00047574792,0.0011840133,0.00053438434,0.00028700274],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004403902,0.00046678245,0.00064123323,0.001018924,0.00055367907,0.0011845947,0.0022034603,0.00036594307,0.00020139907],"category_scores_gemma":[0.0017423625,0.00032917058,0.0002126745,0.00092664897,0.0022877106,0.00037982277,0.00032487154,0.0007919709,0.00029613235],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003926333,0.000018429284,0.00007575784,0.000002353315,0.0000064658548,0.00001476449,0.00032171622,0.0015357485,0.00021241959,0.0033279685,0.00013917152,0.99434125],"study_design_scores_gemma":[0.0006403807,0.00017630668,0.0000858484,0.0047508813,0.00003890942,0.00019551111,0.000005320365,0.07981122,0.0013256699,0.88980556,0.021645764,0.0015186464],"about_ca_topic_score_codex":0.0000068478994,"about_ca_topic_score_gemma":0.000018975821,"teacher_disagreement_score":0.99282265,"about_ca_system_score_codex":0.00039643853,"about_ca_system_score_gemma":0.00072328775,"threshold_uncertainty_score":0.999916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046783723,0.00042943846,0.99194944,0.000027286025,0.0012997371,0.00049079605,0.000014540734,0.000105317464,0.0010050825],"genre_scores_gemma":[0.98860383,0.000036013047,0.010891952,0.00007880291,0.00027850803,0.000011285686,0.0000018504379,0.000052276962,0.000045469256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982177,0.000020198791,0.00039100184,0.00047786505,0.00052833656,0.00036489716],"domain_scores_gemma":[0.9989153,0.00027112005,0.0002148114,0.00046034748,0.0000858366,0.00005254008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006607431,0.00035470093,0.0003405569,0.00048494886,0.00016298464,0.0000670657,0.0006526501,0.00021267064,0.000010592115],"category_scores_gemma":[0.000028068436,0.00021933927,0.000099932186,0.00028393563,0.00027475948,0.00012891625,0.00008351842,0.00042274295,0.00000991269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010441115,0.000043553395,0.000033884335,0.0005225342,0.00006166617,0.00003432038,0.0016412094,0.7167086,0.006683466,0.019923681,0.000007768795,0.25432885],"study_design_scores_gemma":[0.0001825884,0.000090225185,0.000020627524,0.0035988716,0.000014855597,0.00003272054,7.9051654e-7,0.9374564,0.00406027,0.054049,0.00007486847,0.00041874836],"about_ca_topic_score_codex":0.000008855552,"about_ca_topic_score_gemma":0.000006498456,"teacher_disagreement_score":0.98392546,"about_ca_system_score_codex":0.00015241008,"about_ca_system_score_gemma":0.000064234475,"threshold_uncertainty_score":0.8944396},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027659256,0.000030607753,0.98297274,0.00069819426,0.0009629003,0.00054882345,0.000117788164,0.000072484596,0.011830534],"genre_scores_gemma":[0.89879405,0.000008416335,0.09673061,0.0004373922,0.0026431317,0.000063258885,0.00006200342,0.000040688123,0.0012204151],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975709,0.000019181005,0.000375545,0.0010984355,0.00050456147,0.00043139086],"domain_scores_gemma":[0.99852633,0.00027755386,0.00023657309,0.00065058266,0.00017894867,0.00013000911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025695743,0.00035197102,0.00033403392,0.0003176171,0.00042922498,0.00029599876,0.0008272041,0.00014347381,0.0004573858],"category_scores_gemma":[0.0000035859462,0.00028136527,0.00013273105,0.00030033107,0.0007544416,0.00036620357,0.00039246565,0.0004060565,0.000243046],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010194098,0.000074266776,0.00064906344,0.000004827043,0.000018252349,0.0000046817404,0.00030665196,0.0016385701,0.0011607226,0.059258074,0.00013558341,0.9367391],"study_design_scores_gemma":[0.0011694399,0.0005384296,0.0028253896,0.0010003594,0.00007107245,0.000013951182,0.000002634699,0.23162092,0.0027420355,0.7292098,0.028959714,0.00184627],"about_ca_topic_score_codex":0.00007999515,"about_ca_topic_score_gemma":0.00011036022,"teacher_disagreement_score":0.93489283,"about_ca_system_score_codex":0.00016468401,"about_ca_system_score_gemma":0.0003580656,"threshold_uncertainty_score":0.9999639},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000047609046,0.00007516048,0.98988694,0.0046413136,0.0011935292,0.000662497,0.000010730789,0.00016230745,0.0033627793],"genre_scores_gemma":[0.004079147,0.000043058528,0.98916876,0.0038573118,0.00092050276,0.000028511737,0.0000032181085,0.000037989375,0.0018615247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965271,0.00003904812,0.00038227608,0.0013656225,0.0009229597,0.0007630083],"domain_scores_gemma":[0.9969487,0.0012098326,0.00017028466,0.0011649547,0.00027708875,0.00022910273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010608085,0.00039315733,0.00038124967,0.00078364863,0.00031647115,0.00061670993,0.0028617457,0.00030081903,0.00002892717],"category_scores_gemma":[0.00029566707,0.00029688896,0.00014473154,0.00037834008,0.00037340602,0.00038048552,0.000888271,0.00074789365,0.00005919752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007054909,0.000014791264,0.0000019864913,0.000017720846,0.0000050303497,0.000010516956,0.00023774854,0.052168556,0.000026223011,0.45930177,0.000019777875,0.48818883],"study_design_scores_gemma":[0.00018649497,0.00028114332,0.000002242813,0.00040562992,0.0000011798231,0.0000071409627,1.5096502e-8,0.51769274,0.00028689465,0.4788247,0.002038083,0.00027374778],"about_ca_topic_score_codex":0.0000024232531,"about_ca_topic_score_gemma":0.0000066964176,"teacher_disagreement_score":0.48791507,"about_ca_system_score_codex":0.00022198471,"about_ca_system_score_gemma":0.00052327407,"threshold_uncertainty_score":0.9999483},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010875078,0.00017904861,0.995769,0.00075704313,0.0017350476,0.00043959843,0.000011645974,0.00011685103,0.00088299153],"genre_scores_gemma":[0.23491009,0.00014148318,0.762386,0.0009494338,0.0008544079,0.00003160173,0.0001152815,0.000043600452,0.00056808925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596447,0.00005543167,0.00059069635,0.0018515211,0.0010758428,0.00046203344],"domain_scores_gemma":[0.99643207,0.00023254566,0.00052820594,0.0025063546,0.00020242768,0.000098392484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010862217,0.0003940981,0.00037776274,0.00048327522,0.00030038343,0.0006177014,0.0040931986,0.00018310465,0.00006255043],"category_scores_gemma":[0.000056173303,0.00032715974,0.00010504829,0.00034380055,0.00027663913,0.0015710301,0.002414149,0.0003782465,0.000106968175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022118995,0.000035769503,0.00013406719,0.000017706863,0.000022828473,0.000021229926,0.0012081892,0.0041405167,0.0008614392,0.018669559,0.000041892592,0.9748446],"study_design_scores_gemma":[0.0003358721,0.00007295785,0.00022937797,0.00020559938,0.0000463318,0.000007949306,8.8570204e-7,0.9862172,0.0011859008,0.008724997,0.0023676653,0.0006052637],"about_ca_topic_score_codex":0.000030807798,"about_ca_topic_score_gemma":0.000019558462,"teacher_disagreement_score":0.9820767,"about_ca_system_score_codex":0.00036433412,"about_ca_system_score_gemma":0.00030649893,"threshold_uncertainty_score":0.99991804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000637623,0.0004270683,0.9919973,0.00033695556,0.004465299,0.00045874374,0.000017574926,0.00015080917,0.0015086171],"genre_scores_gemma":[0.43804637,0.00001637806,0.55911124,0.0016998781,0.0009216034,0.0000064372507,0.0000054345555,0.00008022933,0.000112461625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99415815,0.00010022356,0.0007883796,0.0026825117,0.0013272353,0.0009434836],"domain_scores_gemma":[0.99465513,0.0013925037,0.00050847995,0.0030748406,0.00019225631,0.00017678403],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001033994,0.0007575253,0.00072608626,0.001430777,0.00019938214,0.00033690318,0.007469474,0.0004252969,0.000059713406],"category_scores_gemma":[0.0004960383,0.0006545091,0.0001205605,0.00046187555,0.0011458386,0.0012758457,0.0029300656,0.0011114362,0.000030033949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006548577,0.000033298533,0.00009899909,0.000024159153,0.00001551912,0.00019418877,0.001059601,0.33010513,0.00053078664,0.051890854,0.000034074143,0.6159479],"study_design_scores_gemma":[0.00021088513,0.00016174585,0.00007596419,0.0009939482,0.000008103497,0.000011026204,5.720559e-7,0.8782282,0.001414463,0.11706769,0.0009865136,0.00084087887],"about_ca_topic_score_codex":0.00021396203,"about_ca_topic_score_gemma":0.00042156555,"teacher_disagreement_score":0.615107,"about_ca_system_score_codex":0.0020756435,"about_ca_system_score_gemma":0.0016474325,"threshold_uncertainty_score":0.99959064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014751377,0.00023669392,0.9901355,0.00021248817,0.0018090648,0.000357982,0.000018578681,0.0003018213,0.0067803375],"genre_scores_gemma":[0.5194077,0.00012328508,0.47770813,0.00012617724,0.0014950766,0.0000059675217,0.000026811535,0.00018527875,0.0009215793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979226,0.000023967386,0.0003780508,0.0007270634,0.0005112868,0.00043704218],"domain_scores_gemma":[0.99847126,0.00036516567,0.00016082749,0.0005322875,0.000372618,0.000097824384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002434454,0.00045045736,0.00038165945,0.0005861752,0.0001387837,0.00023808665,0.00047279586,0.0002825254,0.00002376179],"category_scores_gemma":[0.000118196454,0.00039907586,0.00006819072,0.00050699554,0.00051426655,0.0005086277,0.000100343335,0.00048857246,0.00008343515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017857059,0.000017706221,0.00003620149,0.00011980671,0.00006120368,0.00009433422,0.003257447,0.13902876,0.18571776,0.0031141008,0.00006555035,0.66846925],"study_design_scores_gemma":[0.00039928276,0.00008994336,0.00027500937,0.0008327688,0.000027591926,0.000048647642,0.000001773319,0.8412854,0.09751923,0.057439752,0.00076097454,0.0013196087],"about_ca_topic_score_codex":0.0000026261519,"about_ca_topic_score_gemma":0.000012197928,"teacher_disagreement_score":0.7022567,"about_ca_system_score_codex":0.00095189176,"about_ca_system_score_gemma":0.00020759512,"threshold_uncertainty_score":0.9998461},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065850734,0.000054537006,0.9328181,0.0008902559,0.0010531951,0.00028882144,0.0000026678372,0.000079059406,0.06415485],"genre_scores_gemma":[0.99199647,0.000038961614,0.0038860654,0.00026470498,0.0016391895,0.000009785248,0.000002437528,0.000018420884,0.0021439728],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803,0.000114079616,0.0002025837,0.00062510493,0.0006495844,0.00037863114],"domain_scores_gemma":[0.9987952,0.0005259178,0.00017208037,0.0001858049,0.00024626128,0.00007469979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010908908,0.0002344214,0.00022140727,0.00032630653,0.0010540832,0.00021214697,0.0005637206,0.0002210426,0.00017788126],"category_scores_gemma":[0.0001021479,0.00018252275,0.000056085737,0.0003131061,0.0017551859,0.00077525456,0.00012101939,0.00043590195,0.00007050302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038980816,0.000011688684,0.000031552652,0.000005917992,0.0000074030363,0.000009886878,0.0067708544,0.0006716198,0.000039383875,0.41999736,0.0000037340644,0.5724116],"study_design_scores_gemma":[0.00019879798,0.00037837314,0.00021264343,0.00090756826,0.000024239689,0.000027718386,0.000042288488,0.0029492518,0.0005931047,0.98767316,0.006080695,0.00091218384],"about_ca_topic_score_codex":0.00006471755,"about_ca_topic_score_gemma":0.0015436629,"teacher_disagreement_score":0.99133795,"about_ca_system_score_codex":0.0008818659,"about_ca_system_score_gemma":0.0005329159,"threshold_uncertainty_score":0.8107263},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000144344785,0.0024614779,0.975523,0.00008952001,0.0038480228,0.000273464,0.000006034732,0.00028772152,0.017496323],"genre_scores_gemma":[0.20342803,0.0008114472,0.7431223,0.0030748206,0.0088091325,0.0000905881,0.00013049184,0.0006373589,0.039895862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970781,0.000024638684,0.00045348745,0.00085822854,0.0008286487,0.00075687154],"domain_scores_gemma":[0.99834096,0.00016269334,0.000081449936,0.0009937608,0.00017294513,0.00024816903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063058676,0.00054668885,0.0005572567,0.000763042,0.00010905065,0.0002806863,0.0016805761,0.0002750926,0.000104927036],"category_scores_gemma":[0.000044201464,0.00049576885,0.000105888386,0.0007318675,0.00040742263,0.00025638283,0.0003688615,0.0010327676,0.00035815602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015229878,0.000008112347,0.000017292436,0.000048000587,0.0000081628505,0.00003735983,0.00019592223,0.8012641,0.000054974687,0.00021080962,0.00691466,0.19123907],"study_design_scores_gemma":[0.00016815215,0.00007591989,0.000048609258,0.00049215014,0.00001605369,0.000048675538,1.5183579e-7,0.91483605,0.0024943834,0.027720595,0.052924696,0.0011745396],"about_ca_topic_score_codex":0.00002437433,"about_ca_topic_score_gemma":0.00030329442,"teacher_disagreement_score":0.23240075,"about_ca_system_score_codex":0.0006395951,"about_ca_system_score_gemma":0.00049307867,"threshold_uncertainty_score":0.9997494},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018843076,0.0001777866,0.995767,0.00011142229,0.00067331624,0.0008103524,0.0000016637911,0.00007995526,0.0004942014],"genre_scores_gemma":[0.84703135,0.0000031324507,0.14138325,0.0068870923,0.0034563642,0.000029318187,0.00011469393,0.000059334718,0.0010354483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827015,0.0000033139684,0.0002980629,0.0006021843,0.0002168208,0.00060947065],"domain_scores_gemma":[0.9987901,0.00042374243,0.00027982454,0.0002670969,0.00021193588,0.000027340417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011964949,0.0002919686,0.0002903325,0.00029335366,0.00047551407,0.00078702404,0.0004004911,0.00019206302,0.000017448006],"category_scores_gemma":[0.00012155782,0.0002655335,0.00012027625,0.00031183547,0.00016180803,0.001010802,0.0004541448,0.0002610557,0.000011745542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027179509,0.00007554803,0.0058682994,0.0015922085,0.00002385454,0.000007429165,0.0004246103,0.7662364,0.0000053195918,0.0012107055,0.00053205516,0.22399637],"study_design_scores_gemma":[0.00067157974,0.000010966419,0.0010542714,0.00014918456,0.00002306098,7.4523973e-7,0.0000017722951,0.96829563,0.000011748186,0.0051251957,0.024321424,0.0003344098],"about_ca_topic_score_codex":0.00006806593,"about_ca_topic_score_gemma":0.000028670418,"teacher_disagreement_score":0.85438377,"about_ca_system_score_codex":0.00024779222,"about_ca_system_score_gemma":0.0001763209,"threshold_uncertainty_score":0.9999797},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022389986,0.00029138694,0.99728197,0.000033893233,0.0010093702,0.0003742966,0.000002339221,0.0001846299,0.0005982405],"genre_scores_gemma":[0.18430316,0.00036426896,0.81239176,0.00077076687,0.0010367528,0.000044702792,0.0000697869,0.00013926045,0.0008795706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981238,0.000032368458,0.0003694738,0.0006224881,0.00036879512,0.0004830491],"domain_scores_gemma":[0.9991761,0.00023678855,0.000064185784,0.00034980278,0.000089559,0.00008356343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026414345,0.00039710154,0.0004173081,0.00057870353,0.00009284437,0.0001601143,0.0006674814,0.00029225307,0.00002937315],"category_scores_gemma":[0.000020923597,0.0003749342,0.000041838353,0.0008446804,0.0002294517,0.00022384057,0.00014040536,0.00068397884,0.000019869996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005641019,0.000010458465,0.000037240647,0.000043205957,0.000004795851,0.0000553274,0.0008138553,0.937431,0.000002992849,0.000007421164,0.0004676069,0.061120495],"study_design_scores_gemma":[0.0002417376,0.0000526612,0.00042230703,0.0003705598,0.000003222789,0.000017075059,6.3116865e-8,0.9959088,0.0011801056,0.000552533,0.00077834126,0.0004725937],"about_ca_topic_score_codex":0.000005254998,"about_ca_topic_score_gemma":0.000019896966,"teacher_disagreement_score":0.18489021,"about_ca_system_score_codex":0.00038295743,"about_ca_system_score_gemma":0.00035612623,"threshold_uncertainty_score":0.99987024},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035788177,0.00046662663,0.99412674,0.00093782245,0.0017489339,0.00060921727,0.000004069645,0.00036759806,0.0013811019],"genre_scores_gemma":[0.1031461,0.00009281099,0.889564,0.0049596247,0.0014845167,0.000084548075,0.000055249347,0.00012410157,0.00048904656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937062,0.00023335172,0.00082550937,0.0023973258,0.0015566264,0.0012809671],"domain_scores_gemma":[0.9959155,0.0009189087,0.00042133118,0.001936163,0.000516437,0.00029169954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016043249,0.00079576566,0.0008304478,0.0029887664,0.00021272707,0.0007897085,0.005205971,0.0005122156,0.000028197974],"category_scores_gemma":[0.00024467244,0.0007784291,0.00019509385,0.0060101296,0.000782703,0.0010890185,0.0012017775,0.0016067418,0.00014064732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003998769,0.0003278386,0.0016126599,0.00026595945,0.000034313507,0.00033560544,0.001953616,0.14114027,0.0025391525,0.0068950765,0.006086801,0.8387687],"study_design_scores_gemma":[0.000849246,0.00035041932,0.0033894512,0.000847913,0.000009898536,0.00009197666,1.2013705e-7,0.8618104,0.001965807,0.124458216,0.004804644,0.0014219098],"about_ca_topic_score_codex":0.000148006,"about_ca_topic_score_gemma":0.0006250744,"teacher_disagreement_score":0.8373468,"about_ca_system_score_codex":0.0008730174,"about_ca_system_score_gemma":0.0019034672,"threshold_uncertainty_score":0.99946666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060383692,0.00051918195,0.9945418,0.00023382655,0.003060205,0.00034660823,0.000013626307,0.00063703966,0.00058731897],"genre_scores_gemma":[0.102791645,0.000003145342,0.89400756,0.0009696649,0.0013866744,0.000016507434,0.000058636426,0.000072864634,0.0006932969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950169,0.00008402177,0.0005446826,0.001596938,0.0016834678,0.0010739876],"domain_scores_gemma":[0.9964594,0.0006940606,0.00019198208,0.0017875774,0.00048066274,0.00038627916],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001895757,0.0005988661,0.0006449285,0.0009307147,0.00018100822,0.0009871108,0.0056270547,0.00037011874,0.0000046874206],"category_scores_gemma":[0.0003419403,0.0005711531,0.00015386041,0.0017456556,0.0003131498,0.00042705468,0.0013536257,0.0010490157,0.0001089941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022527845,0.000028384973,0.00011795073,0.00011105421,0.000007962855,0.00013389089,0.00034593054,0.91954285,0.000009834844,0.00071903167,0.0010324024,0.077948436],"study_design_scores_gemma":[0.00031329633,0.0001313088,0.00006664734,0.00064650376,0.000003795216,0.000052092866,4.6862407e-8,0.9842675,0.00019151563,0.004696855,0.008933509,0.00069694314],"about_ca_topic_score_codex":0.000024096267,"about_ca_topic_score_gemma":0.000007857141,"teacher_disagreement_score":0.10273126,"about_ca_system_score_codex":0.00091339956,"about_ca_system_score_gemma":0.004184524,"threshold_uncertainty_score":0.999753},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021773485,0.0007267636,0.9890569,0.0036243119,0.0023359787,0.00044246,0.0000035113885,0.0002008882,0.0033914947],"genre_scores_gemma":[0.015780602,0.0001271584,0.9704473,0.008133126,0.0028328022,0.000041954056,0.000021046677,0.00006693434,0.0025490676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99479645,0.00014262761,0.0007758829,0.0019591495,0.0010648543,0.0012610401],"domain_scores_gemma":[0.9970666,0.000567987,0.00031597348,0.0016575994,0.000166412,0.0002254327],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012865029,0.00061931246,0.0007178288,0.0016135657,0.00015636926,0.0004634126,0.0046876953,0.00033025738,0.000058690435],"category_scores_gemma":[0.00018640977,0.0006197913,0.00014488718,0.0016206359,0.00072786905,0.0010523701,0.0014767153,0.0014825662,0.0001652144],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000772461,0.000115661736,0.00017841364,0.000055254837,0.0000068843824,0.00053209264,0.00061543216,0.08013306,0.00022084569,0.008121897,0.0013103498,0.9087024],"study_design_scores_gemma":[0.0008909148,0.00021077732,0.0008379496,0.00046342667,0.000007975411,0.00036723394,1.8931415e-7,0.8253153,0.0021349182,0.12072036,0.04774898,0.0013019673],"about_ca_topic_score_codex":0.0000575587,"about_ca_topic_score_gemma":0.000753482,"teacher_disagreement_score":0.9074004,"about_ca_system_score_codex":0.0016477826,"about_ca_system_score_gemma":0.0023161583,"threshold_uncertainty_score":0.9996253},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014753244,0.000038391194,0.9825744,0.0037810039,0.001201605,0.0008453983,0.000013366079,0.00016743358,0.011230892],"genre_scores_gemma":[0.40632606,0.000042715445,0.5749945,0.002069055,0.0022134716,0.00020971861,0.000022450993,0.00006754832,0.014054485],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982698,0.00003771311,0.00025288793,0.0006064207,0.0004408498,0.00039231547],"domain_scores_gemma":[0.9975333,0.0014564351,0.00017149956,0.0003221765,0.00041996734,0.0000966115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007242857,0.0002301229,0.00028072868,0.0002997684,0.00048333732,0.00013314083,0.0007073502,0.0004938787,0.00032006126],"category_scores_gemma":[0.00158177,0.00018117766,0.0000883974,0.00019110765,0.0021051383,0.00022358024,0.00010795212,0.00033550916,0.00007846328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058267165,0.000024270064,0.00008421528,0.000015322088,0.000008193816,0.0000019110314,0.005056041,0.000048135014,0.00008379257,0.4831132,0.000090480506,0.5114686],"study_design_scores_gemma":[0.00028393182,0.00010825161,0.00005347868,0.00026184312,0.000011917425,0.000004119246,0.000014036625,0.0031344707,0.0014134038,0.9892634,0.005077912,0.00037319819],"about_ca_topic_score_codex":0.000023659886,"about_ca_topic_score_gemma":0.0005841874,"teacher_disagreement_score":0.5110954,"about_ca_system_score_codex":0.00042545158,"about_ca_system_score_gemma":0.00088419317,"threshold_uncertainty_score":0.7756469},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003457351,0.00019136001,0.9922687,0.0005462004,0.001268604,0.0005010104,0.0000018587908,0.00030665536,0.0014583046],"genre_scores_gemma":[0.34764963,0.00000797303,0.65100867,0.00045295423,0.00042907317,0.000006492372,0.0000019517345,0.00005565129,0.00038760644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596465,0.00005218051,0.0005224078,0.0016556557,0.0010828538,0.0007222643],"domain_scores_gemma":[0.99715465,0.00032076126,0.00042984352,0.001640739,0.00027167745,0.00018231412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006288111,0.0005750008,0.00060258294,0.00080782064,0.0002662299,0.0005548097,0.0024097457,0.00030271013,0.00002481389],"category_scores_gemma":[0.00008925567,0.00043551152,0.00008962505,0.0006063215,0.00049102004,0.0007783724,0.0008984045,0.0005132373,0.000023688937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000835206,0.000028605175,0.00023550124,0.00008628607,0.000031054275,0.00020554963,0.0014532907,0.049915265,0.0022732234,0.023071753,0.0000084290905,0.9226827],"study_design_scores_gemma":[0.00032171083,0.0001351478,0.00007316098,0.0013012312,0.000014839896,0.00016417398,2.1870848e-7,0.9693226,0.0015240082,0.026297325,0.00014716295,0.0006984256],"about_ca_topic_score_codex":0.00003128294,"about_ca_topic_score_gemma":0.0000326093,"teacher_disagreement_score":0.92198426,"about_ca_system_score_codex":0.00049382396,"about_ca_system_score_gemma":0.00096635066,"threshold_uncertainty_score":0.9998097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020630343,0.0011145246,0.99188596,0.00013864176,0.0017502459,0.00053470273,0.000014421066,0.00043197177,0.0041089216],"genre_scores_gemma":[0.0024576038,0.00007204208,0.9947188,0.0012085242,0.0003805794,0.000042609514,0.000014928469,0.00004170795,0.0010632068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954223,0.00008252834,0.0006838073,0.0018978807,0.0010013235,0.0009121646],"domain_scores_gemma":[0.99695355,0.00025641333,0.00029902524,0.0019684052,0.0003230098,0.00019957453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008547469,0.0006372656,0.000716491,0.0006408775,0.0003271813,0.00025306552,0.0026021206,0.00032716643,0.000009071847],"category_scores_gemma":[0.00015764458,0.0005799482,0.00013087655,0.0010781169,0.00085258466,0.0016479414,0.001242263,0.0008944162,0.000027683765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068764894,0.000044560133,0.00000726474,0.000086704975,0.000011665179,0.00014595086,0.0011783289,0.13395327,0.0005593595,0.11737624,0.00023020203,0.7463996],"study_design_scores_gemma":[0.0003866251,0.00027688415,0.0000011464057,0.001147316,0.0000071243653,0.00017848163,0.0000016508067,0.8164932,0.010062459,0.11011085,0.059615042,0.0017191984],"about_ca_topic_score_codex":0.000012345797,"about_ca_topic_score_gemma":0.000028277535,"teacher_disagreement_score":0.7446804,"about_ca_system_score_codex":0.00055371027,"about_ca_system_score_gemma":0.0017549535,"threshold_uncertainty_score":0.9996652},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01286864,0.00016368489,0.98418295,0.00068097276,0.00091766246,0.0002653051,0.0000010421999,0.00010125565,0.0008185038],"genre_scores_gemma":[0.8758437,0.00006034428,0.12250094,0.0007133363,0.00027204314,0.0000109548,0.000010828974,0.000016953845,0.0005709107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972532,0.000062098625,0.00048065552,0.0009662325,0.00080467685,0.00043315388],"domain_scores_gemma":[0.9990102,0.00014265023,0.00018295653,0.00042783556,0.00013371329,0.00010262402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008765557,0.00030749763,0.00030639538,0.0011369662,0.00020293276,0.00042242985,0.0010062782,0.00021887224,0.0000069859625],"category_scores_gemma":[0.000028272316,0.0002977755,0.000058035886,0.0011128348,0.000325956,0.0011825883,0.0005878204,0.00057140924,0.000037221507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058782903,0.000057049445,0.0013997811,0.000046988815,0.0000021001547,0.000010125557,0.00036028228,0.069035694,0.000049182447,0.0013662592,0.000019940182,0.9276467],"study_design_scores_gemma":[0.0003607842,0.0002368825,0.052735187,0.0003151078,0.000001887193,0.00006593206,1.7616134e-7,0.93004704,0.000046849498,0.015422335,0.0004238467,0.00034395937],"about_ca_topic_score_codex":0.000006324344,"about_ca_topic_score_gemma":0.00006238221,"teacher_disagreement_score":0.9273028,"about_ca_system_score_codex":0.00043669436,"about_ca_system_score_gemma":0.00037569547,"threshold_uncertainty_score":0.9999474},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004385371,0.00007160663,0.9931919,0.0011354942,0.00017209469,0.00046419582,0.0000043377395,0.0001509807,0.004765519],"genre_scores_gemma":[0.09482877,0.000018634244,0.9017512,0.0013705303,0.00039229376,0.000077746794,0.0000065720897,0.00004796305,0.0015062595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679697,0.00003275932,0.00037783172,0.0014734278,0.0007582165,0.00056081376],"domain_scores_gemma":[0.997864,0.00017359674,0.00020454875,0.0014382614,0.00013570966,0.00018385076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006853445,0.00043115925,0.00037696766,0.00075802126,0.00016847342,0.0003491183,0.002649566,0.00016690105,0.000014703],"category_scores_gemma":[0.000014348715,0.0003061361,0.000050293267,0.00046155718,0.0003330012,0.0006321563,0.0007048987,0.00071082014,0.000030884752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061480346,0.000044771237,0.00009721345,0.000015062814,0.00000364278,0.000026555337,0.00042991326,0.49247497,0.00003556234,0.045221645,0.0000046781847,0.46163982],"study_design_scores_gemma":[0.00031793918,0.00021031876,0.00004470358,0.00023091536,0.0000023941784,0.000028142449,1.0758702e-7,0.922612,0.00007201703,0.07548417,0.0005395532,0.00045771772],"about_ca_topic_score_codex":0.000015324073,"about_ca_topic_score_gemma":0.00011985057,"teacher_disagreement_score":0.46118212,"about_ca_system_score_codex":0.0002703266,"about_ca_system_score_gemma":0.000516087,"threshold_uncertainty_score":0.9999391},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045964375,0.00588974,0.9767038,0.00058129884,0.002882671,0.00048853026,0.0000047578624,0.00031680777,0.012672756],"genre_scores_gemma":[0.2354522,0.00059818116,0.7436036,0.016232645,0.0034531278,0.00003899152,0.0000824196,0.00017590089,0.00036297142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937285,0.00013922784,0.000856765,0.0023098155,0.0016660071,0.0012996692],"domain_scores_gemma":[0.9963903,0.00062067324,0.0004687164,0.0018200983,0.00038108032,0.00031913834],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015679067,0.00080378563,0.00089141226,0.0017602165,0.00023180689,0.00075129623,0.0077715376,0.00041198905,0.000005897351],"category_scores_gemma":[0.000022137447,0.00072330487,0.00012626071,0.0033432357,0.0003632491,0.0018740284,0.0031295035,0.0013355624,0.00006665815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010981749,0.00007692706,0.00062164984,0.00038792935,0.0000065467007,0.00019347093,0.007903101,0.13402939,0.000024676316,0.0024107404,0.000022710992,0.8543119],"study_design_scores_gemma":[0.0007870214,0.00023055609,0.00035269652,0.0019899656,0.000008372247,0.000107130974,0.0000046589475,0.7681093,0.00037397127,0.20739937,0.019303126,0.0013337906],"about_ca_topic_score_codex":0.0001599657,"about_ca_topic_score_gemma":0.003138559,"teacher_disagreement_score":0.8529781,"about_ca_system_score_codex":0.0005973673,"about_ca_system_score_gemma":0.0015700465,"threshold_uncertainty_score":0.9995218},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006808352,0.0013811127,0.9953169,0.00077491987,0.001038543,0.00021493263,0.0000020797268,0.00019944279,0.0010039356],"genre_scores_gemma":[0.020794196,0.00021843854,0.97505873,0.0018078171,0.0010908389,0.000010556023,0.00000720371,0.000033193646,0.0009790094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661773,0.000070728835,0.0005044604,0.0013299541,0.0006775888,0.00079951104],"domain_scores_gemma":[0.998059,0.00032325136,0.0002019424,0.0011115548,0.000113832495,0.00019042997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008499678,0.0004867539,0.00057139335,0.0014555097,0.00013880731,0.0004664817,0.002154192,0.00035961924,0.000007800307],"category_scores_gemma":[0.000046690748,0.00043203824,0.00008517474,0.001681306,0.0005105163,0.0015083695,0.0020676223,0.0009122094,0.000009605741],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032118458,0.000033641314,0.00019879038,0.000028562878,0.0000018936703,0.000057136862,0.0003423681,0.00046105834,0.000028970822,0.0009698241,0.00015064525,0.9977239],"study_design_scores_gemma":[0.0010534751,0.0013017316,0.010922569,0.0016237189,0.000014767908,0.00037720686,1.6192504e-7,0.71393394,0.005559846,0.21826078,0.044442654,0.002509143],"about_ca_topic_score_codex":0.00001294017,"about_ca_topic_score_gemma":0.00003397971,"teacher_disagreement_score":0.99521476,"about_ca_system_score_codex":0.00037505728,"about_ca_system_score_gemma":0.00029038463,"threshold_uncertainty_score":0.99981314},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006775873,0.00043094112,0.9824461,0.00024349596,0.0033072103,0.00035194523,5.062126e-7,0.00061044976,0.012541641],"genre_scores_gemma":[0.9414853,0.00002841807,0.05608758,0.00038372527,0.0007052485,0.000017558004,0.0000016353227,0.000036312165,0.0012542524],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967631,0.00008205999,0.0005010776,0.0013175793,0.0006593249,0.00067683466],"domain_scores_gemma":[0.99807185,0.00033706916,0.0002641716,0.0010709296,0.0001352334,0.00012076392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016711857,0.00041555756,0.00043850797,0.0009197214,0.00016464163,0.00042268538,0.0023607505,0.00033277457,0.000015713633],"category_scores_gemma":[0.00009199833,0.00031338853,0.00009674192,0.000566239,0.00045882465,0.00064357155,0.0008217745,0.00049879315,0.00012283208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031572092,0.000015276417,0.00008649987,0.000024611216,0.0000053492663,0.00006786673,0.00056977716,0.0013532876,0.00009685947,0.42808676,0.000006741762,0.5696838],"study_design_scores_gemma":[0.00033681912,0.000115940325,0.0002516645,0.00020864185,0.00000381636,0.00013264717,2.922058e-7,0.15520966,0.00076114765,0.840146,0.0021842977,0.00064906577],"about_ca_topic_score_codex":0.000025446749,"about_ca_topic_score_gemma":0.00007740908,"teacher_disagreement_score":0.9414175,"about_ca_system_score_codex":0.00039302307,"about_ca_system_score_gemma":0.00034899343,"threshold_uncertainty_score":0.9999318},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000689582,0.0003095968,0.99713093,0.000023576367,0.0016706482,0.00016269757,0.000004497787,0.0003523828,0.00027669637],"genre_scores_gemma":[0.045456454,0.000020004634,0.95337284,0.00037168208,0.00041930834,0.0000053119948,0.00003314366,0.000049127015,0.00027214113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985977,0.000013692926,0.00025151638,0.00043358843,0.00039656356,0.0003069657],"domain_scores_gemma":[0.999159,0.0002265299,0.000052065654,0.00037378957,0.00010440633,0.00008420378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016136788,0.0002669147,0.00022956633,0.00044525103,0.00011430655,0.00009735076,0.00046740883,0.00023774001,0.0000142151985],"category_scores_gemma":[0.000065076565,0.00027014676,0.00006116953,0.00052728585,0.0001796389,0.00010990925,0.00005230469,0.00041336453,0.00004275651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.253876e-7,0.000008484203,0.00001472559,0.000020523292,0.0000027462834,0.000010758178,0.00013574127,0.9401861,0.000013864128,0.0000013415857,0.000017885264,0.059587],"study_design_scores_gemma":[0.00026234143,0.000016286007,0.000050005998,0.00010676395,0.000003653593,0.0000036283122,4.051288e-8,0.9982921,0.00043174095,0.00007977571,0.0004552177,0.00029848513],"about_ca_topic_score_codex":0.0000021416936,"about_ca_topic_score_gemma":0.0000065045483,"teacher_disagreement_score":0.059288517,"about_ca_system_score_codex":0.00032814426,"about_ca_system_score_gemma":0.00027991334,"threshold_uncertainty_score":0.9999751},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001434186,0.0013868653,0.99164104,0.0016730968,0.002278548,0.0006203197,0.0000045664187,0.00026506718,0.0019870466],"genre_scores_gemma":[0.026471661,0.00002984769,0.9692996,0.0026814728,0.0010123303,0.000073228424,0.000029058934,0.00007261754,0.0003301621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99408174,0.00023288936,0.00080940383,0.0021676552,0.0015157292,0.0011925867],"domain_scores_gemma":[0.9963959,0.0006212916,0.00043299425,0.0017888814,0.00046466402,0.0002962806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002321703,0.0006801166,0.0008243693,0.001782726,0.00014149434,0.0005756416,0.0050580213,0.00055236183,0.000025185118],"category_scores_gemma":[0.00022419111,0.00064997206,0.00012218968,0.0020568203,0.0012781145,0.0011467529,0.0019894186,0.001448999,0.0002281186],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003525445,0.00023155237,0.0015338457,0.00015753323,0.00001439558,0.00081563916,0.0021400203,0.037141982,0.00014209439,0.022755975,0.004626621,0.9304051],"study_design_scores_gemma":[0.000878332,0.00037768862,0.0007585021,0.0004521582,0.0000062950126,0.00015938342,2.1417688e-7,0.62469023,0.00048133623,0.3679308,0.003248953,0.0010160886],"about_ca_topic_score_codex":0.00003976807,"about_ca_topic_score_gemma":0.00020225336,"teacher_disagreement_score":0.929389,"about_ca_system_score_codex":0.0014572303,"about_ca_system_score_gemma":0.0035146046,"threshold_uncertainty_score":0.99959517},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014523641,0.0026537832,0.98655576,0.0033622335,0.00044950334,0.0005369571,0.0000067852607,0.00054381875,0.0058766403],"genre_scores_gemma":[0.036062885,0.0014883474,0.9563017,0.0011645027,0.0011544699,0.00034828324,0.000008305067,0.00006003946,0.0034114842],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99628824,0.00006257056,0.00032574736,0.0015604733,0.0009087111,0.00085424166],"domain_scores_gemma":[0.995965,0.001614353,0.00012510722,0.0019108814,0.000291754,0.00009287707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015114337,0.0003161772,0.000383861,0.0010840858,0.00043159688,0.00080695713,0.005122129,0.00040796524,0.000002890827],"category_scores_gemma":[0.00043648857,0.00023063488,0.000051463732,0.0013399592,0.0024605922,0.00066743727,0.0037522467,0.0008469628,0.00006858927],"study_design_candidate":"design_other","study_design_consensus":null,"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.6309274e-7,0.000013315658,0.00006641473,0.000025789708,0.0000032071332,0.000020601983,0.00009852274,0.000037551534,0.000064485044,0.03101357,0.0003838261,0.96827185],"study_design_scores_gemma":[0.00019297855,0.00010684159,0.0003359762,0.0003143571,0.0000029288383,0.00007864914,9.890944e-7,0.010784251,0.0019152231,0.9358892,0.049876362,0.00050228357],"about_ca_topic_score_codex":0.000011176311,"about_ca_topic_score_gemma":0.000031830605,"teacher_disagreement_score":0.96776956,"about_ca_system_score_codex":0.00032963973,"about_ca_system_score_gemma":0.0010679808,"threshold_uncertainty_score":0.95182747},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010805291,0.0015154373,0.99367464,0.00019347885,0.00038588463,0.00023580232,0.000016250453,0.0000081140715,0.0028898383],"genre_scores_gemma":[0.30450797,0.006829972,0.679396,0.005216901,0.0019579371,0.0000333654,0.0010067204,0.000070424394,0.0009807576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826753,0.00003473632,0.00043820209,0.0004483999,0.00035501644,0.0004560995],"domain_scores_gemma":[0.9991587,0.00014569527,0.00013230693,0.00030190562,0.0001260508,0.00013535681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007025302,0.00024099495,0.00028648332,0.00039208625,0.000072093804,0.00007515382,0.0006039893,0.0003717044,0.0000045419583],"category_scores_gemma":[0.00025775936,0.00020226096,0.000041649524,0.00022182848,0.0013503421,0.000013508952,0.0005707256,0.00033409634,0.000009639026],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016134674,0.000024578158,0.0008025252,0.00020949455,0.0000053856006,0.00000260936,0.00018211172,0.010066064,0.0002557711,0.0001517951,0.00017417685,0.98810935],"study_design_scores_gemma":[0.0014916142,0.0015106521,0.0012267398,0.0004585989,0.000008708902,0.000071207476,0.0000028785025,0.798997,0.0019432053,0.09120525,0.10196794,0.0011162269],"about_ca_topic_score_codex":0.0000038397993,"about_ca_topic_score_gemma":0.000110236215,"teacher_disagreement_score":0.98699313,"about_ca_system_score_codex":0.000059005153,"about_ca_system_score_gemma":0.0006074258,"threshold_uncertainty_score":0.82479626},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014818983,0.0003620776,0.9723931,0.0015875011,0.00070087326,0.0009223467,0.000008165032,0.00017494126,0.023836195],"genre_scores_gemma":[0.023127966,0.00005813799,0.9697718,0.0014750176,0.0003137529,0.000038764334,0.0000011953936,0.000057059875,0.005156279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946499,0.000072968665,0.0006892984,0.0022073518,0.0013497464,0.0010307714],"domain_scores_gemma":[0.9953535,0.001060433,0.00046301095,0.0022771677,0.00038953632,0.0004563237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014865563,0.00085065275,0.001268741,0.0015682827,0.00033603737,0.00056684326,0.0043153926,0.0005048333,0.000024597968],"category_scores_gemma":[0.00016074025,0.00052708306,0.00026659816,0.0010553865,0.0006706745,0.00066672056,0.0012751679,0.00095858827,0.000033657736],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006162742,0.00003451787,0.0000063459147,0.000023193457,0.00003050283,0.00010826498,0.0002381762,0.0026492875,0.00015476542,0.03978435,0.00006546257,0.9568435],"study_design_scores_gemma":[0.001587091,0.0001742107,0.000007876459,0.0004811759,0.000020276342,0.00007896751,2.3880705e-8,0.69385326,0.00025180719,0.3027496,0.00012177545,0.00067394617],"about_ca_topic_score_codex":0.000005747289,"about_ca_topic_score_gemma":0.000012605365,"teacher_disagreement_score":0.95616955,"about_ca_system_score_codex":0.0002996399,"about_ca_system_score_gemma":0.0014792624,"threshold_uncertainty_score":0.99971807},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016349042,0.0016752617,0.96865255,0.008048633,0.0007498296,0.0038469455,0.000045932502,0.00028148017,0.0003503348],"genre_scores_gemma":[0.9632423,0.00011452884,0.034902234,0.0010379343,0.0002823995,0.0003215974,0.0000026612292,0.000035961977,0.000060408114],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778,0.000055173095,0.00027578612,0.0009324375,0.00036103826,0.00059556833],"domain_scores_gemma":[0.99683577,0.0017492237,0.00014486533,0.0006294265,0.00026260375,0.00037811283],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011310373,0.00028453075,0.000283897,0.0005872022,0.0019247796,0.0004980723,0.0010119912,0.0006052705,0.0000073169126],"category_scores_gemma":[0.00037487314,0.00021738444,0.00003410373,0.000652078,0.0021743155,0.00045213726,0.00023625177,0.0005821004,0.0000058886226],"study_design_candidate":"design_other","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.000001872749,0.0000062792674,0.0012428969,0.000011477302,0.000010434557,0.0000037349182,0.00588348,0.00013960394,0.00002663507,0.034793563,0.00000971549,0.9578703],"study_design_scores_gemma":[0.0006908179,0.00045274102,0.008393026,0.0017150174,0.000108984124,0.000036600813,0.00035423491,0.0022901094,0.0006721647,0.8225861,0.16040285,0.0022973437],"about_ca_topic_score_codex":0.0019790977,"about_ca_topic_score_gemma":0.13601677,"teacher_disagreement_score":0.95557296,"about_ca_system_score_codex":0.00046759416,"about_ca_system_score_gemma":0.001183872,"threshold_uncertainty_score":0.99937457},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088103744,0.0003193034,0.9969379,0.00014392193,0.0009968282,0.0003310437,0.000007945949,0.00017765789,0.00020438372],"genre_scores_gemma":[0.1413793,0.000008204651,0.8580722,0.00024505024,0.00017681158,0.0000057662114,0.0000061361425,0.00002329573,0.00008321571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99428016,0.00002831829,0.0005133483,0.0014136528,0.0029666037,0.0007979195],"domain_scores_gemma":[0.9938432,0.0031669775,0.0002180568,0.0010908248,0.001421564,0.00025940337],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002497596,0.00037333177,0.00042753472,0.0026515324,0.00038275472,0.0006226933,0.0041305036,0.00020503445,0.000007668873],"category_scores_gemma":[0.0027667978,0.00036103497,0.00005729215,0.0037887527,0.003961577,0.000916055,0.002179431,0.0007561893,0.0000060231428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049714117,0.000041548807,0.001655422,0.00019438672,0.000014659999,0.00004717378,0.0011831603,0.22982356,0.00017125634,0.021569315,0.00013218066,0.74516237],"study_design_scores_gemma":[0.0004617089,0.00024888743,0.027389528,0.00041574478,0.000008169928,0.00020041752,3.760211e-7,0.5850446,0.0019880093,0.3827047,0.0006052818,0.0009325307],"about_ca_topic_score_codex":0.00002211292,"about_ca_topic_score_gemma":0.000014845524,"teacher_disagreement_score":0.74422985,"about_ca_system_score_codex":0.0007360539,"about_ca_system_score_gemma":0.0053220415,"threshold_uncertainty_score":0.9998842},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059620346,0.0012996844,0.9906977,0.000119523174,0.00067035685,0.000294497,0.0000024253359,0.003055226,0.003800959],"genre_scores_gemma":[0.11891562,0.000007649656,0.8803574,0.0002448732,0.00031535488,0.000012806012,0.0000022336687,0.00002718713,0.00011688246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966059,0.000109969325,0.00077781576,0.0009983226,0.00090173626,0.0006063065],"domain_scores_gemma":[0.9924386,0.0036895233,0.0006869412,0.002603007,0.00047024005,0.00011169349],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020549842,0.00041277928,0.0006490298,0.0008006208,0.00023249967,0.00040155998,0.006475878,0.00027569092,9.0345975e-7],"category_scores_gemma":[0.0013983656,0.0003900327,0.00008638699,0.0016765543,0.0006471329,0.0004078424,0.0024970649,0.00087439374,0.000007368325],"study_design_candidate":"design_other","study_design_consensus":null,"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.3248244e-7,0.00003796776,0.0008286055,0.00013405547,0.00000589628,0.000017064425,0.00058739283,0.031094735,0.00008540823,0.001224748,0.00038792772,0.96559536],"study_design_scores_gemma":[0.000111246765,0.00014479426,0.00021989267,0.002400149,0.0000055777205,0.00013091059,4.99261e-8,0.91809106,0.00050316093,0.07729492,0.0005841789,0.00051407923],"about_ca_topic_score_codex":0.0001422979,"about_ca_topic_score_gemma":0.000007953538,"teacher_disagreement_score":0.9650813,"about_ca_system_score_codex":0.0004017927,"about_ca_system_score_gemma":0.0012584039,"threshold_uncertainty_score":0.99985516},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012917146,0.00009692271,0.9954405,0.00013898085,0.0009312613,0.0000846951,0.000015201916,0.00019829859,0.0029649937],"genre_scores_gemma":[0.9327035,0.000023806484,0.06567798,0.00036264272,0.0003575886,0.0000070164347,0.0000049490086,0.00003906964,0.0008234471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977336,0.0000095180085,0.00026217458,0.0006637074,0.0008696583,0.00046135832],"domain_scores_gemma":[0.99904704,0.00023784174,0.000042248146,0.00040085986,0.00014504461,0.00012695018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004319929,0.0002820438,0.00027382193,0.0010549125,0.00029333352,0.00018757023,0.0009321796,0.00013126021,0.00004351077],"category_scores_gemma":[0.000019583702,0.000230249,0.000097596756,0.0009944318,0.0008319308,0.0002121775,0.000030048835,0.00045981194,0.000089407615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.544998e-7,0.000006090476,0.0000010829245,0.000010253592,0.0000048707557,0.000003651697,0.000088891706,0.7569027,0.000054898646,0.000035624955,0.000023055938,0.24286821],"study_design_scores_gemma":[0.000100847814,0.0000285657,0.000012405496,0.00025667655,0.0000086345435,0.000007736524,6.463356e-8,0.9797336,0.00068172097,0.01870505,0.00016860916,0.00029609015],"about_ca_topic_score_codex":0.0000026072873,"about_ca_topic_score_gemma":0.00001005408,"teacher_disagreement_score":0.93257433,"about_ca_system_score_codex":0.00058851554,"about_ca_system_score_gemma":0.0006624504,"threshold_uncertainty_score":0.9389282},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012624679,0.00027979744,0.9962186,0.00085410406,0.00030253673,0.00040622798,0.000007187074,0.00004071028,0.0006283387],"genre_scores_gemma":[0.93817735,0.00025947485,0.060442984,0.00012724454,0.000093337665,0.00003598571,0.0000016344555,0.000021751583,0.0008402448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984398,0.00010128067,0.00036026965,0.0005446541,0.00036946207,0.00018452985],"domain_scores_gemma":[0.9984849,0.0002860197,0.00031456535,0.00071749656,0.00016121946,0.00003578438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006982157,0.00019024544,0.00024107596,0.00026424968,0.00018090938,0.000062340776,0.0013089166,0.00012683208,0.000002602961],"category_scores_gemma":[0.000054873,0.0001150874,0.00007160423,0.00092665816,0.00056877936,0.00018265861,0.00060572533,0.00041830816,9.736195e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033622691,0.000020577287,0.001325106,0.00001859996,0.000004487409,2.5114005e-7,0.0009148206,0.00392629,0.000114639086,0.0072561903,0.000003728325,0.9864119],"study_design_scores_gemma":[0.00052168587,0.00025740344,0.1388526,0.0006927319,0.000014657173,0.000038947503,0.0000024334943,0.6920373,0.009480327,0.14569034,0.011576628,0.0008349878],"about_ca_topic_score_codex":0.00010027173,"about_ca_topic_score_gemma":0.00079090707,"teacher_disagreement_score":0.985577,"about_ca_system_score_codex":0.000073490955,"about_ca_system_score_gemma":0.00024276949,"threshold_uncertainty_score":0.4693128},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016430726,0.0003150855,0.99469656,0.00023251695,0.0032290644,0.0005900077,0.0000053660983,0.0008218157,0.000093178125],"genre_scores_gemma":[0.004356832,0.000015948774,0.9941341,0.000368713,0.0007504898,0.0000715168,0.000023789138,0.000037786634,0.00024077352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970183,0.000034458262,0.0005049656,0.0009825426,0.00073962985,0.00072012],"domain_scores_gemma":[0.996374,0.00165378,0.00032264713,0.0012514094,0.00024303458,0.00015514721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021683653,0.00042388472,0.00041453703,0.00053699006,0.00016441706,0.000553849,0.0026541993,0.000304777,0.000008031837],"category_scores_gemma":[0.0009855571,0.00042232842,0.0001263002,0.0006673475,0.00011181955,0.0015430768,0.00076547044,0.0005084923,0.000017240964],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007570381,0.000058834536,0.00021135897,0.00033756217,0.00002207846,0.00000596932,0.00047207376,0.03195485,0.000103094615,0.0097283935,0.0003657458,0.95673245],"study_design_scores_gemma":[0.00067252695,0.00044105254,0.0012055046,0.0008259876,0.00003565043,0.000057256635,8.883317e-8,0.7211921,0.0030888591,0.1289247,0.14116949,0.0023867926],"about_ca_topic_score_codex":0.000012672514,"about_ca_topic_score_gemma":0.0000051910633,"teacher_disagreement_score":0.9543457,"about_ca_system_score_codex":0.00059502467,"about_ca_system_score_gemma":0.0005714449,"threshold_uncertainty_score":0.99982285},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034377023,0.0007562089,0.9944697,0.0028313017,0.00028957837,0.0005427438,0.00007247255,0.000030821222,0.00066340336],"genre_scores_gemma":[0.85728985,0.0007262042,0.12480398,0.0029900903,0.0017237908,0.000105633524,0.00036189644,0.00009727142,0.011901286],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765265,0.00019983327,0.00034724525,0.00093160826,0.00058562343,0.00028301874],"domain_scores_gemma":[0.99480504,0.0041162153,0.000224898,0.00041818834,0.00030688875,0.0001288003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031805146,0.00020001663,0.00033635405,0.00031607915,0.0007429477,0.00026930455,0.0006286748,0.00019956628,0.000037424186],"category_scores_gemma":[0.0019229765,0.00016249415,0.000037673282,0.00022327402,0.0014237735,0.0007257556,0.00022551062,0.00016138842,0.0000021601686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004667187,0.000073373194,0.00018148842,0.00017204646,0.00004099038,0.0000024578108,0.06773762,0.00015552578,0.000053666692,0.41544116,0.00068319426,0.5154118],"study_design_scores_gemma":[0.0014865003,0.000763457,0.000328813,0.0020568848,0.00018074359,0.0000019581298,0.0007310275,0.11419299,0.00007311522,0.7452011,0.13279305,0.002190323],"about_ca_topic_score_codex":0.00025512028,"about_ca_topic_score_gemma":0.0030576151,"teacher_disagreement_score":0.86966574,"about_ca_system_score_codex":0.00037121325,"about_ca_system_score_gemma":0.00064980384,"threshold_uncertainty_score":0.6626319},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021700768,0.0016218211,0.99348193,0.00039724226,0.001562965,0.0007604353,0.000020896858,0.00032554852,0.0016121314],"genre_scores_gemma":[0.18740898,0.00008149451,0.8085582,0.0015175908,0.0014452721,0.000021836406,0.00006991071,0.00006191986,0.00083476346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957486,0.00008475918,0.00065845513,0.0017699957,0.00074303226,0.0009951814],"domain_scores_gemma":[0.9966969,0.0013174333,0.00039794206,0.0010966532,0.00025051495,0.00024058831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010283049,0.00061934313,0.00083049305,0.00060057064,0.00056113413,0.00070555613,0.003126561,0.00034737334,0.0000010798173],"category_scores_gemma":[0.00012402626,0.00058457337,0.00016418748,0.0007695483,0.00070429983,0.00036226303,0.00128932,0.000633428,0.000012791325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021322161,0.000110789166,0.00053632696,0.0005241668,0.0000668351,0.0002488751,0.0061949696,0.27705315,0.000044790577,0.015836071,0.0043642363,0.69499844],"study_design_scores_gemma":[0.0007467215,0.00021841485,0.00032457625,0.0005817,0.000008338184,0.00032727676,9.672763e-7,0.97385895,0.0000385142,0.013039329,0.009958302,0.000896889],"about_ca_topic_score_codex":0.000026055595,"about_ca_topic_score_gemma":0.000018706165,"teacher_disagreement_score":0.69680583,"about_ca_system_score_codex":0.0002795566,"about_ca_system_score_gemma":0.00093240733,"threshold_uncertainty_score":0.99966055},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028579305,0.0077878833,0.98895705,0.0011647745,0.00045214675,0.00029928336,0.000011898927,0.00013493249,0.0011634617],"genre_scores_gemma":[0.005569432,0.0011749335,0.9922414,0.0005038999,0.000073968,0.00003196138,0.000011254358,0.000021060916,0.00037208106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977623,0.000047040558,0.0003386475,0.0010865668,0.00032739626,0.00043800936],"domain_scores_gemma":[0.99709004,0.00023099556,0.00019017438,0.0021700829,0.00021229255,0.00010643912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048254686,0.0003486538,0.00044321863,0.0009552524,0.0003969686,0.00021976598,0.0019286522,0.00025785706,8.047545e-7],"category_scores_gemma":[0.00005992572,0.00031415877,0.000022459992,0.0017395164,0.0017580998,0.0011352198,0.0028598227,0.00053389894,0.0000026971716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010486972,0.00002442887,0.00005506262,0.000081515405,0.0000058496576,0.000017468017,0.00038707026,0.0006499079,0.00007346484,0.6127645,0.000059464626,0.38588023],"study_design_scores_gemma":[0.00032821513,0.00008834879,0.000042456973,0.00054793135,0.0000067107153,0.00037338643,8.6836667e-7,0.32671976,0.00009436967,0.627566,0.04350149,0.00073045195],"about_ca_topic_score_codex":0.000011859261,"about_ca_topic_score_gemma":0.00006394768,"teacher_disagreement_score":0.38514978,"about_ca_system_score_codex":0.00011564387,"about_ca_system_score_gemma":0.000415314,"threshold_uncertainty_score":0.99993104},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007736357,0.0003063594,0.9918867,0.000660571,0.0027824808,0.00038378168,0.0000044439334,0.00024254406,0.0036557664],"genre_scores_gemma":[0.016006432,0.000009610381,0.98131263,0.0013985725,0.00067883113,0.000017794575,0.000009753115,0.000033535696,0.0005328481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920314,0.00023218189,0.0010886665,0.0030792106,0.002066615,0.0015019476],"domain_scores_gemma":[0.9956172,0.0010938274,0.00041552377,0.0020090812,0.00055781426,0.0003065261],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0053583016,0.0007542367,0.00081078155,0.0026273737,0.0004964249,0.0012105599,0.006850473,0.0005101897,0.000012002966],"category_scores_gemma":[0.00020547606,0.0007243981,0.00016208255,0.0049705915,0.002362002,0.0017203275,0.0026494032,0.0018243714,0.000060116963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031059715,0.00007274831,0.00018658515,0.000030085537,0.0000035899463,0.00006971791,0.00044969958,0.30206642,0.00020524366,0.018208243,0.00022261526,0.67848194],"study_design_scores_gemma":[0.00023936234,0.00009691304,0.0009729703,0.00035631092,0.000003591241,0.00006603056,4.0464872e-8,0.7994384,0.0005408493,0.19694601,0.000640532,0.000698979],"about_ca_topic_score_codex":0.00009897564,"about_ca_topic_score_gemma":0.00008554541,"teacher_disagreement_score":0.67778295,"about_ca_system_score_codex":0.001380083,"about_ca_system_score_gemma":0.005261986,"threshold_uncertainty_score":0.99982625},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034738223,0.00032904153,0.9881795,0.0034094527,0.003837639,0.0007810814,0.00008234243,0.00043644675,0.0029097316],"genre_scores_gemma":[0.015068522,0.00006747661,0.9502469,0.0018512947,0.007064878,0.00002577215,0.00007080927,0.00015036491,0.025453996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951558,0.000051184958,0.0006081597,0.0024206303,0.0008892398,0.0008749921],"domain_scores_gemma":[0.9953266,0.0006163231,0.0003770768,0.0032682708,0.0002243505,0.00018740485],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013854024,0.00059972954,0.00054233085,0.0005065969,0.00046768456,0.0006391673,0.006603174,0.00030768578,0.000019169516],"category_scores_gemma":[0.00014272593,0.0004687182,0.0001390352,0.00039369348,0.00046249726,0.00027774737,0.0055430015,0.00044730847,0.000111974216],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022770539,0.000040428713,0.000018629165,0.000062803316,0.00004609625,0.00003228271,0.0004972274,0.020832978,0.00007417171,0.010426475,0.0008415832,0.96710455],"study_design_scores_gemma":[0.00057706144,0.00016077951,0.000045106422,0.0011610254,0.000023138242,0.000030208555,2.223105e-7,0.89609027,0.00016200982,0.059914377,0.04114282,0.00069300405],"about_ca_topic_score_codex":0.000009056475,"about_ca_topic_score_gemma":0.00001552399,"teacher_disagreement_score":0.96641153,"about_ca_system_score_codex":0.00026604295,"about_ca_system_score_gemma":0.00027479848,"threshold_uncertainty_score":0.9997764},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004502238,0.0015214693,0.9833246,0.00040651404,0.006710804,0.00065155426,0.0000023114235,0.00029835227,0.006634156],"genre_scores_gemma":[0.3812857,0.00006671086,0.6122263,0.0030221208,0.0023692653,0.000038287355,0.0000072960042,0.00006357515,0.00092070893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911079,0.00016494594,0.0009348668,0.0031473925,0.0020651773,0.002579755],"domain_scores_gemma":[0.99496305,0.0008063932,0.0004659928,0.0026594473,0.0005177318,0.00058739644],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.004070908,0.0009793313,0.0010734014,0.0025842667,0.0006018804,0.0015014785,0.010892061,0.00055325706,0.000027486352],"category_scores_gemma":[0.000320523,0.0008342575,0.00021955199,0.0053235367,0.0031675443,0.0022561667,0.0048709745,0.0016649949,0.00032684064],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000864415,0.00033279596,0.0021283622,0.0001441594,0.000011910266,0.00040275377,0.0042538573,0.019702928,0.00019508383,0.03398886,0.00033210576,0.93849856],"study_design_scores_gemma":[0.0007776934,0.0003783806,0.0049600126,0.0007454489,0.00001435503,0.00039255028,3.652603e-7,0.8290073,0.00089492864,0.15851572,0.0023922396,0.0019209447],"about_ca_topic_score_codex":0.000053393494,"about_ca_topic_score_gemma":0.00023872776,"teacher_disagreement_score":0.9365776,"about_ca_system_score_codex":0.0017720355,"about_ca_system_score_gemma":0.0040145316,"threshold_uncertainty_score":0.9995453},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009873364,0.0009445786,0.9941569,0.00026489721,0.000475457,0.0002248113,0.0000583647,0.00008977809,0.0027978607],"genre_scores_gemma":[0.7809751,0.00006457307,0.21796447,0.0002388914,0.00013463455,0.0000037373939,0.000003629371,0.000031415515,0.0005835312],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997036,0.00004601701,0.0006247326,0.00096110196,0.0008690956,0.00046310193],"domain_scores_gemma":[0.99697506,0.00042980094,0.0005919149,0.0016568908,0.00024365644,0.00010265513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008081348,0.00038583865,0.00068319787,0.00043853393,0.000076092045,0.00008327562,0.0034493662,0.00015144087,0.00002771293],"category_scores_gemma":[0.00005711915,0.0002925991,0.00014943734,0.0003706509,0.0022492579,0.00042133228,0.0011683266,0.00027801775,0.000009301296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013278437,0.0000443601,0.00012025666,0.00017249028,0.000020682333,0.000038711325,0.00089499564,0.000999706,0.0027075675,0.4087225,0.00001331431,0.58625215],"study_design_scores_gemma":[0.00035940052,0.00019608233,0.00071878877,0.00123584,0.000007835454,0.000027825528,3.502862e-7,0.04810199,0.038274202,0.9099761,0.0005032877,0.0005982772],"about_ca_topic_score_codex":0.000021395103,"about_ca_topic_score_gemma":0.000039502007,"teacher_disagreement_score":0.7799878,"about_ca_system_score_codex":0.00010296996,"about_ca_system_score_gemma":0.0002678898,"threshold_uncertainty_score":0.9999526},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002011862,0.0017040627,0.97891575,0.00032221322,0.0017096067,0.0002668749,0.0000068654676,0.000107611355,0.016946867],"genre_scores_gemma":[0.15411004,0.0026303052,0.8356085,0.004834673,0.0019066603,0.000069617396,0.000054923064,0.000082706036,0.00070260215],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617183,0.00003581627,0.00068589265,0.0016760009,0.00063585496,0.00079462],"domain_scores_gemma":[0.9977351,0.00044843904,0.00021815993,0.0013293438,0.00010133003,0.00016763137],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052050024,0.00044664423,0.0005180642,0.0010574539,0.00014347794,0.0006103267,0.004799469,0.00026766444,0.000007211911],"category_scores_gemma":[0.00012418623,0.00043058116,0.000092421404,0.00166825,0.0008732646,0.0029939897,0.0015250384,0.0007710336,0.00014641148],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028197594,0.00004133835,0.00003721895,0.000020639522,9.259287e-7,0.0001380679,0.00030775095,0.014975577,0.0000024277579,0.023338621,0.000033869364,0.96110076],"study_design_scores_gemma":[0.00007217061,0.0001343622,0.00006356132,0.00035903318,0.000001233967,0.00011955677,2.4078062e-7,0.34506983,0.0007646197,0.6395494,0.013063406,0.0008026377],"about_ca_topic_score_codex":0.000016304562,"about_ca_topic_score_gemma":0.00028283472,"teacher_disagreement_score":0.9602981,"about_ca_system_score_codex":0.0004454983,"about_ca_system_score_gemma":0.0015840555,"threshold_uncertainty_score":0.99981457},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006125439,0.00033256563,0.7692852,0.009831206,0.0073455023,0.0004640935,0.00012192555,0.000115768285,0.21244247],"genre_scores_gemma":[0.43525696,0.00009069082,0.010885669,0.027985657,0.018462187,0.000023501914,0.000010225855,0.000113670736,0.50717145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832934,0.000014529191,0.00023329156,0.0005484514,0.00041248245,0.0004619119],"domain_scores_gemma":[0.99881804,0.00025215096,0.00008964042,0.0006037617,0.00012969736,0.00010673769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024104452,0.00028520302,0.0002611459,0.0002048712,0.0005053383,0.00033789818,0.0010182974,0.00008850297,0.00068378914],"category_scores_gemma":[0.000039215567,0.00016145462,0.00008565699,0.0000014119718,0.0013010013,0.00012780307,0.00040293785,0.00028748246,0.00049557525],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009462518,0.000017903516,0.0000052193527,0.000026992553,0.000024525012,0.00002905014,0.18318485,0.0012387772,0.000013227476,0.4229546,0.0037252794,0.3887701],"study_design_scores_gemma":[0.00008146277,0.000079267935,0.000014234713,0.00017099522,0.000008101789,0.0000049628293,0.0000014848152,0.00058546313,0.00010026062,0.24820419,0.75045156,0.00029804214],"about_ca_topic_score_codex":0.00013763545,"about_ca_topic_score_gemma":0.013580333,"teacher_disagreement_score":0.75839955,"about_ca_system_score_codex":0.000087451685,"about_ca_system_score_gemma":0.00015224537,"threshold_uncertainty_score":0.75781447},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018339738,0.00020384292,0.99907285,0.00009669029,0.00022971134,0.00006982768,0.000006383496,0.00006484775,0.00007247602],"genre_scores_gemma":[0.39524513,0.0000376254,0.6042863,0.00015191517,0.00017473538,0.000003216244,0.000037494385,0.000027172455,0.000036396017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988786,0.000041034076,0.00027090116,0.00034258515,0.00032380133,0.00014310525],"domain_scores_gemma":[0.9991824,0.00042056272,0.00010615624,0.00017518616,0.00006003119,0.00005567247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033029425,0.0001812086,0.00026461075,0.0002874406,0.000050454342,0.000074807525,0.00018089061,0.00013593254,0.00007063352],"category_scores_gemma":[0.00012119706,0.00014530144,0.000044961165,0.00016573061,0.00018717245,0.000158968,0.00006587035,0.00029574338,0.0000028350576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001114819,0.0000035331127,0.00038599374,0.000059631402,0.000016648246,0.0000021461017,0.00028896637,0.41337052,0.001518809,0.000027193624,0.0000027217327,0.5843227],"study_design_scores_gemma":[0.000113238806,0.000018702742,0.0000371992,0.00085265527,0.00003146519,9.3500256e-7,3.5948696e-7,0.9690108,0.016078629,0.013668172,0.00002618084,0.00016169684],"about_ca_topic_score_codex":0.00002390808,"about_ca_topic_score_gemma":0.000003623206,"teacher_disagreement_score":0.58416104,"about_ca_system_score_codex":0.00006696804,"about_ca_system_score_gemma":0.000025042415,"threshold_uncertainty_score":0.5925221},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001577023,0.00048902933,0.9859256,0.0039703017,0.0037230204,0.002232067,0.0003023649,0.00010685988,0.0016737286],"genre_scores_gemma":[0.97586054,0.0004496289,0.0132075315,0.0022984254,0.0054721967,0.00031831974,0.0001251506,0.00007992597,0.0021882993],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997335,0.000026594324,0.00051731686,0.0007698809,0.000715575,0.00063559896],"domain_scores_gemma":[0.9961416,0.0022999109,0.0002836403,0.00059346005,0.000570891,0.00011047382],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017355414,0.00034415745,0.00035305604,0.00037573866,0.0010322698,0.0007796146,0.001758398,0.00029773492,0.000013251965],"category_scores_gemma":[0.0008987115,0.00021844827,0.00028909746,0.00029807154,0.0045554033,0.0010449899,0.00027167742,0.00025965198,0.0000031792747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053924778,0.000059918482,0.00013662959,0.0001136247,0.000030033409,5.7102756e-7,0.006782883,0.00031995308,0.0000131445495,0.45109877,0.00014030485,0.5412502],"study_design_scores_gemma":[0.00039939466,0.00018430382,0.000041715208,0.0001315615,0.000028341528,0.0000011547423,0.000021472173,0.017588655,0.00010529438,0.96291304,0.01814114,0.0004439449],"about_ca_topic_score_codex":0.00007259411,"about_ca_topic_score_gemma":0.014316649,"teacher_disagreement_score":0.9742835,"about_ca_system_score_codex":0.00025101748,"about_ca_system_score_gemma":0.0006790375,"threshold_uncertainty_score":0.9981536},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008939461,0.00009189009,0.99617606,0.00042276288,0.0005312347,0.0005122774,0.000009020456,0.0002551897,0.0011075941],"genre_scores_gemma":[0.40027735,0.000005204372,0.5992219,0.00035878856,0.00008618968,0.000005394699,0.0000020068546,0.000018650358,0.000024513205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644053,0.00007020238,0.00075725943,0.0012111551,0.0010398638,0.0004810091],"domain_scores_gemma":[0.9967861,0.0006139532,0.0007544528,0.0012626379,0.00046384073,0.00011899393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013087476,0.0004743647,0.00058897934,0.00093683775,0.00017488892,0.00030758904,0.0028681983,0.00035836967,0.00001641785],"category_scores_gemma":[0.00017450149,0.00039641926,0.00014494649,0.0004733935,0.0011918336,0.001085654,0.0005412266,0.00046960404,0.000009882878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013253438,0.000034524994,0.00019026226,0.00006021143,0.00001189752,0.00004045497,0.0005103978,0.08452941,0.005600727,0.06540437,0.0000041259686,0.8436004],"study_design_scores_gemma":[0.00024390566,0.00013563664,0.000052821655,0.0005653976,0.0000063330363,0.000020917407,5.1222298e-8,0.8619778,0.021292763,0.11520102,0.00006615143,0.00043718735],"about_ca_topic_score_codex":0.0000841849,"about_ca_topic_score_gemma":0.0001397079,"teacher_disagreement_score":0.8431632,"about_ca_system_score_codex":0.00034397197,"about_ca_system_score_gemma":0.0012956932,"threshold_uncertainty_score":0.9998488},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003123893,0.000074469244,0.9811067,0.0010809634,0.0035346164,0.00053479243,0.000018973567,0.000057719375,0.010467845],"genre_scores_gemma":[0.9859448,0.000010974581,0.007966456,0.0004391377,0.0006168395,0.0000261618,0.0000017358341,0.000029321185,0.004964579],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984254,0.000021880609,0.00040170437,0.00053840043,0.00030051637,0.0003121013],"domain_scores_gemma":[0.9979556,0.0010128727,0.00023970954,0.0005522854,0.00017167772,0.00006783861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004235371,0.00022393995,0.00029419846,0.00034394357,0.00022146822,0.00007528113,0.00077192986,0.00012874766,0.000521775],"category_scores_gemma":[0.000072115356,0.0001462686,0.00010305939,0.00012712524,0.00031515284,0.000096208845,0.00017181678,0.00024705302,0.00018734485],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032578115,0.0000617656,0.0004221629,0.00019416452,0.00014432077,0.000027016153,0.010710893,0.0068985242,0.011342573,0.122893065,0.00042496691,0.84655476],"study_design_scores_gemma":[0.01350673,0.0076156207,0.1203505,0.019416714,0.00029090128,0.0010473948,0.00009661807,0.23982818,0.030266637,0.35082772,0.20710538,0.009647599],"about_ca_topic_score_codex":0.00001310106,"about_ca_topic_score_gemma":0.000065109685,"teacher_disagreement_score":0.9828209,"about_ca_system_score_codex":0.00011843969,"about_ca_system_score_gemma":0.000052434832,"threshold_uncertainty_score":0.59646606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000079331425,0.00005930027,0.9936548,0.0009681309,0.00037122288,0.004010814,0.000023159626,0.00030115378,0.0005321071],"genre_scores_gemma":[0.33677512,0.00000400162,0.6613993,0.0011088746,0.00033577965,0.00020691029,0.0000029789956,0.00005434952,0.00011268963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603504,0.00009018188,0.00043611132,0.0017012823,0.00086240727,0.00087495014],"domain_scores_gemma":[0.99733263,0.0007592282,0.00028381593,0.00089473696,0.00050426857,0.00022531538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018160839,0.00048453326,0.00046970704,0.0008416199,0.00061874016,0.00018105523,0.0021082007,0.0007338777,0.000005256201],"category_scores_gemma":[0.00029524235,0.00043027115,0.000119645454,0.0004976068,0.0009531002,0.00027259055,0.00025665626,0.00038211342,0.000017356366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047866546,0.00006588951,0.000028660808,0.000052892672,0.000009789512,0.0000022855593,0.003281282,0.32686132,0.00034400038,0.0031095487,0.00006682928,0.66612965],"study_design_scores_gemma":[0.00054796383,0.000068065754,0.0000062016024,0.00047847198,0.000016373187,0.0000019989793,0.0000018551356,0.9625861,0.00070294796,0.034778547,0.00024085169,0.000570622],"about_ca_topic_score_codex":0.00007277765,"about_ca_topic_score_gemma":0.00023152803,"teacher_disagreement_score":0.665559,"about_ca_system_score_codex":0.000693665,"about_ca_system_score_gemma":0.0015501737,"threshold_uncertainty_score":0.9998149},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044969592,0.00009222963,0.9963889,0.00009707316,0.0016752534,0.00076062896,0.00006213612,0.0001756626,0.0002983923],"genre_scores_gemma":[0.15923989,0.000047520116,0.8333853,0.0010399532,0.00087583903,0.00049830484,0.0011773059,0.00014790817,0.0035879714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984723,0.0000086496,0.0004890052,0.0004459635,0.00026018464,0.00032394714],"domain_scores_gemma":[0.99924624,0.00013348612,0.00008015845,0.00040328983,0.00006238955,0.000074440686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018080733,0.00026696097,0.00027030997,0.0004370569,0.00010940749,0.00011323736,0.0005071553,0.00017461798,0.000062353276],"category_scores_gemma":[0.0000109283255,0.00027793532,0.00015162345,0.00037106383,0.0002260118,0.00017456617,0.000049996197,0.0003067548,0.000034913846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027290264,0.00012213654,0.000058309357,0.0004077977,0.000064020336,0.0000035091534,0.00042233203,0.48866937,0.0006255151,0.0005418534,0.0020496328,0.5070328],"study_design_scores_gemma":[0.00087166467,0.00018069056,0.0067705032,0.00086594897,0.0000483177,0.0000085859265,4.9447624e-7,0.961462,0.00095253886,0.005850722,0.022219634,0.0007688726],"about_ca_topic_score_codex":0.0000042090205,"about_ca_topic_score_gemma":0.000070915834,"teacher_disagreement_score":0.5062639,"about_ca_system_score_codex":0.00036809442,"about_ca_system_score_gemma":0.00010460653,"threshold_uncertainty_score":0.9999673},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012910427,0.00096929265,0.99274236,0.00065923895,0.0015494361,0.0009020186,0.0000022518961,0.0010331118,0.0020132137],"genre_scores_gemma":[0.02565426,0.000044091135,0.97083545,0.0017846642,0.00078697875,0.00008999831,0.00000276513,0.00004721328,0.0007545685],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99369526,0.0001091309,0.00062345434,0.002875231,0.0014832838,0.0012136126],"domain_scores_gemma":[0.99432576,0.0012482727,0.0004061884,0.0031966707,0.00051808957,0.00030499956],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.003350269,0.0006914947,0.0006708718,0.0022719726,0.0010668497,0.0015102003,0.010691181,0.00040786294,0.000009046801],"category_scores_gemma":[0.00023209826,0.0006451988,0.000099473385,0.0028800268,0.007896691,0.0013749311,0.0065209614,0.0012117965,0.00015512796],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013618705,0.00003161931,0.00002003462,0.00004084885,0.0000054566863,0.000014489888,0.00047641655,0.0033047851,0.0001172093,0.10124913,0.00037581372,0.8943628],"study_design_scores_gemma":[0.0002179098,0.00018362483,0.00025867327,0.00026794078,0.00000830096,0.00015769902,3.1129255e-7,0.36462644,0.0007801633,0.6171775,0.01529135,0.0010300983],"about_ca_topic_score_codex":0.000010471374,"about_ca_topic_score_gemma":0.000007799873,"teacher_disagreement_score":0.8933327,"about_ca_system_score_codex":0.00095015526,"about_ca_system_score_gemma":0.0025526946,"threshold_uncertainty_score":0.99959993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085693045,0.0006700857,0.9891183,0.003549225,0.0025970007,0.0017155249,0.00007334131,0.00028415234,0.0011354671],"genre_scores_gemma":[0.3919062,0.00007055309,0.6049359,0.0012415027,0.00094843894,0.00006566001,0.000004562818,0.00008614737,0.0007410602],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905413,0.00016985538,0.0015542647,0.0042333254,0.0022888435,0.001212404],"domain_scores_gemma":[0.99096644,0.0024438591,0.00057491893,0.0040531964,0.0013352423,0.00062633154],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008958033,0.0009952321,0.0012730617,0.00048342263,0.00054322777,0.0010563702,0.0032878413,0.00068573304,0.00008759617],"category_scores_gemma":[0.0026768039,0.0007996873,0.00037707834,0.0004982213,0.0025277913,0.0014438123,0.002134314,0.0008461284,0.0000110288365],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007588532,0.00008752208,0.0024516524,0.00024832107,0.000032701075,0.000030021318,0.0008715381,0.00077152625,0.00025836035,0.015706105,0.00027250365,0.97919387],"study_design_scores_gemma":[0.0005778945,0.0006590408,0.0010428388,0.00049463334,0.000028865135,0.00016901281,3.474483e-7,0.017263832,0.0041253483,0.9541231,0.02019894,0.0013161722],"about_ca_topic_score_codex":0.00009839417,"about_ca_topic_score_gemma":0.0005251332,"teacher_disagreement_score":0.9778777,"about_ca_system_score_codex":0.0013609454,"about_ca_system_score_gemma":0.0033511142,"threshold_uncertainty_score":0.9999806},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07645074,0.00028650812,0.9186485,0.00040397624,0.00035537453,0.0012761772,0.000024782008,0.00011961353,0.0024343275],"genre_scores_gemma":[0.96333134,0.000018354507,0.035935845,0.00033284433,0.0002495607,0.000030573596,0.000004281364,0.000029005088,0.00006817194],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732864,0.000012641088,0.0004320105,0.0011370117,0.000518133,0.0005715923],"domain_scores_gemma":[0.99841493,0.0004700554,0.00015415298,0.0005767397,0.00021478125,0.0001693344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010027946,0.0003952212,0.0004995162,0.00051742146,0.00020941459,0.00014659815,0.0003248143,0.00021204939,0.000008050305],"category_scores_gemma":[0.0001889429,0.00029452707,0.0001882726,0.00031028243,0.0018400741,0.0003967221,0.00025588012,0.00046432944,0.0000021135852],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119752796,0.00002752468,0.028389163,0.0005679399,0.000019241319,0.000012884068,0.00012115573,0.00011773945,0.00007365133,0.00064648985,7.200269e-7,0.9699037],"study_design_scores_gemma":[0.0047158916,0.0043093683,0.05498565,0.013792975,0.0003011305,0.0034181944,0.0000023113466,0.171199,0.0065473514,0.73605686,0.0019874612,0.002683811],"about_ca_topic_score_codex":0.00000513918,"about_ca_topic_score_gemma":0.000011757269,"teacher_disagreement_score":0.96721995,"about_ca_system_score_codex":0.00015866038,"about_ca_system_score_gemma":0.00029704018,"threshold_uncertainty_score":0.9999507},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021755198,0.00013467489,0.9955576,0.0003170306,0.002479023,0.00068191846,0.000005711842,0.00048823463,0.00011826011],"genre_scores_gemma":[0.015623933,0.0000015796918,0.9829854,0.00023736856,0.0005947922,0.000051034556,0.000004191461,0.00006108603,0.0004406091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99551415,0.000013023409,0.00056008075,0.0015478384,0.0012628852,0.0011020243],"domain_scores_gemma":[0.99443024,0.0034503837,0.00021018913,0.0013011349,0.00035618598,0.00025188786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011873463,0.00058124587,0.00050387275,0.000918878,0.00035845157,0.0005192198,0.0038436658,0.0002742387,0.00000934103],"category_scores_gemma":[0.0014277251,0.00047190074,0.00013288356,0.00039176567,0.0004067966,0.00042977472,0.0016933513,0.0006973183,0.00004337321],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004263081,0.000008992317,0.00020241109,0.00010901854,0.0000148305,0.00003114611,0.00045182326,0.032488964,0.000030244171,0.0016392022,0.000012570731,0.96500653],"study_design_scores_gemma":[0.0009084556,0.00036645745,0.0010891698,0.0021813689,0.000011363139,0.00031915904,6.247162e-8,0.8356517,0.0051513137,0.14663008,0.005469487,0.0022213901],"about_ca_topic_score_codex":0.000002341165,"about_ca_topic_score_gemma":0.000009703268,"teacher_disagreement_score":0.9627851,"about_ca_system_score_codex":0.00067268487,"about_ca_system_score_gemma":0.0012412459,"threshold_uncertainty_score":0.99977326},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003091512,0.000086331725,0.99645054,0.0007861929,0.0008970704,0.00056019134,0.000021951098,0.00018202605,0.0009848031],"genre_scores_gemma":[0.29434887,0.0002181443,0.6856124,0.0076160375,0.002083986,0.00018733718,0.00013597279,0.00026106864,0.0095361965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618167,0.00003999326,0.0004955266,0.0015961468,0.0010893121,0.00059736],"domain_scores_gemma":[0.9973375,0.0003801881,0.00041055694,0.001032315,0.00063167803,0.0002077506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005110208,0.0005464734,0.0005238689,0.00071322307,0.00043284695,0.0007006594,0.002515969,0.00022887919,0.000046335892],"category_scores_gemma":[0.00013599242,0.00039402168,0.000114816205,0.0007181014,0.0009144106,0.0012349837,0.0005593286,0.0002125024,0.000013439137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000640897,0.0000971901,0.00014339994,0.00011787931,0.00006049642,0.00005357353,0.026605679,0.0037765033,0.00047684388,0.8038481,0.00022763414,0.16452864],"study_design_scores_gemma":[0.0018988021,0.0008877974,0.00004358991,0.0014100227,0.000028813061,0.00007018813,0.000014221811,0.87554556,0.003431718,0.08842865,0.026206637,0.0020339927],"about_ca_topic_score_codex":0.0000037697796,"about_ca_topic_score_gemma":0.00002368886,"teacher_disagreement_score":0.8717691,"about_ca_system_score_codex":0.00026936314,"about_ca_system_score_gemma":0.0006074091,"threshold_uncertainty_score":0.99985117},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007650959,0.00043656392,0.9895712,0.00005929776,0.0003406247,0.0001217961,0.00010135866,0.00009017612,0.0016280015],"genre_scores_gemma":[0.98069704,0.00011892301,0.018943144,0.000050992807,0.00014835835,0.000002391668,0.000004503645,0.000021498408,0.000013167914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975498,0.000042143354,0.00058596145,0.0008204473,0.000571906,0.0004297759],"domain_scores_gemma":[0.99768037,0.0009866322,0.000114081246,0.00086269906,0.00020600263,0.00015021328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007042839,0.00042559498,0.0009287462,0.0013071037,0.00013342408,0.00007553187,0.00060072803,0.0004082202,0.0001782318],"category_scores_gemma":[0.00039989932,0.00032300703,0.00025083905,0.0009502914,0.002138445,0.00022171684,0.00021187346,0.00077723584,0.000002581747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005213649,0.000006211663,0.0045317593,0.00011208641,0.00018828828,0.0000052860337,0.0002511279,0.6304625,0.00016927518,0.0013966865,0.0000033523372,0.36286822],"study_design_scores_gemma":[0.00012901615,0.00006132811,0.01769778,0.00011566972,0.00075720967,0.000007583588,4.819155e-7,0.82541716,0.0009431306,0.15418184,0.00010737879,0.0005814166],"about_ca_topic_score_codex":0.000015038676,"about_ca_topic_score_gemma":0.00013312793,"teacher_disagreement_score":0.97304606,"about_ca_system_score_codex":0.00018838652,"about_ca_system_score_gemma":0.00009529506,"threshold_uncertainty_score":0.9999222},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050837983,0.000064109176,0.99322486,0.0011616192,0.0019354584,0.001484193,0.000035200595,0.00021681956,0.0013693658],"genre_scores_gemma":[0.93504566,0.00002493973,0.057900816,0.0024612201,0.0009953894,0.00016945881,0.00006460256,0.00007253456,0.0032654086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963091,0.000055950786,0.00067445205,0.0015118422,0.0008568423,0.00059180474],"domain_scores_gemma":[0.9966668,0.0003718808,0.00044667601,0.0017334508,0.0005170893,0.00026414104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001088643,0.00044372524,0.00042343422,0.00063676154,0.0003376407,0.0007955683,0.0025128324,0.00034105347,0.00001101545],"category_scores_gemma":[0.000095052856,0.0003880176,0.00014841459,0.00033032615,0.0004006319,0.0011526453,0.00039698553,0.00029378882,0.000097523625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015121606,0.00014915744,0.000078463396,0.00021718218,0.000029304423,0.000011108866,0.0147475675,0.00078752235,0.0054364917,0.20707096,0.00013077023,0.77132636],"study_design_scores_gemma":[0.000673266,0.00018989973,0.00013448505,0.00070722285,0.0000130405815,0.000013183746,6.060701e-7,0.89674795,0.011009427,0.069101214,0.020449203,0.00096050446],"about_ca_topic_score_codex":0.000004541087,"about_ca_topic_score_gemma":0.000074748794,"teacher_disagreement_score":0.935324,"about_ca_system_score_codex":0.00034694193,"about_ca_system_score_gemma":0.00046077685,"threshold_uncertainty_score":0.9998572},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010611133,0.0008756345,0.9837723,0.0003464134,0.0028740072,0.00037265336,0.0000018691782,0.00019035787,0.011460702],"genre_scores_gemma":[0.30304158,0.0005743858,0.68819857,0.003083799,0.0026527536,0.000048780585,0.00001598924,0.000083802595,0.0023003523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949251,0.00011012106,0.00078993203,0.0020130684,0.0010272337,0.0011345895],"domain_scores_gemma":[0.9969955,0.0007350781,0.00029250846,0.0015205651,0.00024163404,0.00021469577],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011745805,0.0006247203,0.00071396143,0.0012180208,0.00027428145,0.00053007615,0.005902783,0.0005253201,0.000013341905],"category_scores_gemma":[0.0003714264,0.0005482138,0.00016121822,0.0025829752,0.0011173894,0.0006470341,0.0019169418,0.0013834161,0.0001998628],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058719424,0.0001372178,0.00017534688,0.00003661065,0.0000045697834,0.00055549067,0.002961937,0.026138486,0.000026418611,0.07037566,0.00016563294,0.89941674],"study_design_scores_gemma":[0.00008288192,0.00019597694,0.00022428494,0.00025574208,0.00000270564,0.00016752923,3.9711043e-7,0.51559955,0.0011669287,0.47945723,0.0020129948,0.0008337727],"about_ca_topic_score_codex":0.00003468741,"about_ca_topic_score_gemma":0.00036740932,"teacher_disagreement_score":0.898583,"about_ca_system_score_codex":0.0007870232,"about_ca_system_score_gemma":0.0022394583,"threshold_uncertainty_score":0.9996969},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018462955,0.0014657343,0.99389833,0.0010666578,0.00036155307,0.0012166302,0.000004258108,0.0007281257,0.0012402325],"genre_scores_gemma":[0.061193928,0.0005730329,0.9323303,0.0026707891,0.0010424063,0.00076358696,0.000018834888,0.00005975362,0.0013473365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961594,0.00004146688,0.00043798666,0.0019657079,0.0007233994,0.0006720581],"domain_scores_gemma":[0.9966798,0.00039153226,0.00022494949,0.0024665275,0.00013278057,0.000104403916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008291884,0.00045119994,0.00041624007,0.0007165297,0.00029453076,0.00054703414,0.0043784003,0.0002937153,0.00000600603],"category_scores_gemma":[0.000039151622,0.0004200716,0.00007281525,0.0014775624,0.0010353095,0.00048635306,0.0036941739,0.00070688734,0.000030944924],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.444046e-7,0.000032089592,0.000039300863,0.000052512903,0.0000052907017,0.000012393059,0.000062053994,0.029303107,0.0000035790847,0.0046690386,0.00029629306,0.9655236],"study_design_scores_gemma":[0.00025170765,0.00013002878,0.00020765312,0.00022076431,0.000012935449,0.00003325655,7.534081e-7,0.7814806,0.00038221848,0.1424425,0.07394059,0.00089699536],"about_ca_topic_score_codex":0.000009228997,"about_ca_topic_score_gemma":0.0000858382,"teacher_disagreement_score":0.9646266,"about_ca_system_score_codex":0.0007556819,"about_ca_system_score_gemma":0.00065112073,"threshold_uncertainty_score":0.9998251},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014653844,0.00003516879,0.9830642,0.00066637085,0.00070437003,0.000483012,8.153413e-7,0.00035569607,0.000036555615],"genre_scores_gemma":[0.17923316,0.0000042993724,0.8186773,0.00196006,0.000097069824,0.000014789724,0.0000015699089,0.000009472762,0.0000022606018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966627,0.00022416958,0.0004716209,0.000941927,0.0010781705,0.00062145875],"domain_scores_gemma":[0.99825686,0.00025852828,0.00021475945,0.00084731856,0.00022384278,0.00019865911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019034815,0.00024154285,0.000265824,0.00037183837,0.000312515,0.0009115274,0.0025778406,0.00007991071,0.000024746954],"category_scores_gemma":[0.0005248142,0.00022050155,0.000050377188,0.001964505,0.0003488601,0.0017961767,0.0011357038,0.00025423375,0.000013773666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066022267,0.000041835086,0.0009030564,0.000020970852,0.0000029565556,0.000009798101,0.001028025,0.07409391,0.018273462,0.000053052892,0.00001820479,0.9055481],"study_design_scores_gemma":[0.00051595597,0.00010275587,0.00085341773,0.00007868726,0.0000030401259,0.000023579694,8.4850666e-7,0.9300041,0.064847685,0.0033098964,0.00001654615,0.00024348624],"about_ca_topic_score_codex":0.000105141684,"about_ca_topic_score_gemma":0.000011944738,"teacher_disagreement_score":0.9053046,"about_ca_system_score_codex":0.00027741588,"about_ca_system_score_gemma":0.00025698688,"threshold_uncertainty_score":0.8991792},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014676529,0.0004931233,0.99093425,0.0007665116,0.0006638964,0.00042142748,0.000009488468,0.00013479688,0.006429759],"genre_scores_gemma":[0.42681065,0.00029596995,0.5663345,0.0032049115,0.00061903393,0.00002836878,0.0000031415298,0.00011564061,0.00258779],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612623,0.00005099818,0.0003798671,0.0017339891,0.0008426352,0.0008662844],"domain_scores_gemma":[0.9968551,0.0011992513,0.00020604563,0.0011986989,0.0002765176,0.00026441124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001054696,0.0005036753,0.00049055874,0.00087570475,0.00033578387,0.00047534122,0.0027286175,0.00028140785,0.000009582845],"category_scores_gemma":[0.00015764896,0.00040973796,0.00009950814,0.0004558099,0.0014193996,0.0011249487,0.0027889519,0.0008034005,0.00003411542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136522285,0.0000086663185,0.00004930758,0.000028570443,0.000010176433,0.00011492617,0.0004940836,0.00077261444,0.00084102666,0.34808078,0.0000071285217,0.64957905],"study_design_scores_gemma":[0.000314466,0.00024173291,0.000114260976,0.0006695346,0.0000034054624,0.00014770369,7.7495294e-8,0.03420497,0.004891736,0.95798844,0.00077449507,0.00064914837],"about_ca_topic_score_codex":0.000006453561,"about_ca_topic_score_gemma":0.000014355402,"teacher_disagreement_score":0.6489299,"about_ca_system_score_codex":0.000303838,"about_ca_system_score_gemma":0.00036882402,"threshold_uncertainty_score":0.99983543},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039928773,0.0002624494,0.99148893,0.00091019954,0.004336977,0.0008367989,0.000030701307,0.00020890305,0.0015257439],"genre_scores_gemma":[0.08850853,0.000028792303,0.8977473,0.011945449,0.0014882397,0.00002568007,0.0000123300615,0.00011202958,0.00013165956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99465656,0.00003790001,0.0008390066,0.002173915,0.0012354044,0.0010571909],"domain_scores_gemma":[0.99570465,0.0011393913,0.00051486556,0.0018171299,0.0005803164,0.00024364525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008635401,0.00083733944,0.0007201022,0.001152868,0.00047801613,0.0006452179,0.0053753927,0.00039370378,0.000071576455],"category_scores_gemma":[0.00004563018,0.0006449602,0.00025639444,0.00087797816,0.00019732927,0.00076373713,0.0025105716,0.0005251729,0.00007020229],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044197437,0.00003634023,0.00007617762,0.00018154812,0.000032294378,0.000058243535,0.0017064137,0.015129042,0.0003802621,0.014588201,0.000014993795,0.9677523],"study_design_scores_gemma":[0.00051107886,0.00024702743,0.00010436497,0.002214453,0.000033105633,0.00015180167,5.458022e-7,0.675562,0.0017700212,0.31032708,0.007866032,0.0012124606],"about_ca_topic_score_codex":0.00003459795,"about_ca_topic_score_gemma":0.00046522834,"teacher_disagreement_score":0.9665398,"about_ca_system_score_codex":0.00036583163,"about_ca_system_score_gemma":0.0005914798,"threshold_uncertainty_score":0.9996002},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000016796733,0.00033492752,0.9899721,0.0011825948,0.00027897925,0.0013490968,0.000059491773,0.00017457224,0.006646542],"genre_scores_gemma":[0.0005810797,0.00021614705,0.9943899,0.0005053402,0.0007594013,0.00011997397,0.000032095744,0.000038791208,0.003357299],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811316,0.0000053231415,0.00032516682,0.0008101953,0.00039372704,0.00035244875],"domain_scores_gemma":[0.9983269,0.00029916802,0.00020269795,0.0007556291,0.00029696684,0.0001186481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003371595,0.00028210992,0.00042932943,0.00045859232,0.00014306327,0.00006491398,0.000337697,0.0002442605,0.000016209997],"category_scores_gemma":[0.000075597316,0.00021936194,0.00015097405,0.00036131698,0.00045256002,0.00014388899,0.00011508119,0.00031068592,0.000015872998],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007076391,0.000016986243,0.000003103311,0.00002623527,0.0000046262408,0.000005490933,0.00001898746,0.00017501907,0.00059339014,0.0051702093,0.00020689993,0.993772],"study_design_scores_gemma":[0.0012308541,0.0011791532,0.00006939904,0.0014672248,0.00015411203,0.00012572554,4.0272943e-7,0.19393124,0.045104094,0.5466829,0.20874162,0.0013132514],"about_ca_topic_score_codex":0.0000048451734,"about_ca_topic_score_gemma":0.000001919903,"teacher_disagreement_score":0.9924587,"about_ca_system_score_codex":0.00026802428,"about_ca_system_score_gemma":0.00030505366,"threshold_uncertainty_score":0.8945321},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016123646,0.00079295994,0.99237293,0.00039579207,0.0014087937,0.0006728359,0.0000026295222,0.00029549608,0.0038973317],"genre_scores_gemma":[0.067354076,0.000107028914,0.9258471,0.004518035,0.0018905927,0.00006992207,0.00001638324,0.00006251303,0.00013436182],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953855,0.000076691584,0.0005146358,0.0019567006,0.0010621913,0.0010042359],"domain_scores_gemma":[0.99711627,0.00062190695,0.00031553343,0.0014386439,0.00021033402,0.00029730846],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010916907,0.0006307639,0.0006288722,0.00079091673,0.00034747904,0.0011462604,0.003033169,0.00038428634,0.000021334821],"category_scores_gemma":[0.00004826995,0.00059330504,0.00012308532,0.001986517,0.0010656166,0.0008452893,0.0018503824,0.0011195667,0.00006747064],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013388784,0.00008548856,0.00015055126,0.0001865111,0.000030085266,0.00006832809,0.0018442867,0.039691348,0.00050665694,0.052213732,0.0041773645,0.90103227],"study_design_scores_gemma":[0.0003373175,0.00012560605,0.00031897664,0.0002320707,0.000008853776,0.000044751996,1.2230804e-7,0.3959643,0.000413669,0.5990655,0.0026614717,0.0008273912],"about_ca_topic_score_codex":0.000029418605,"about_ca_topic_score_gemma":0.00003176857,"teacher_disagreement_score":0.9002049,"about_ca_system_score_codex":0.00029241358,"about_ca_system_score_gemma":0.00074344897,"threshold_uncertainty_score":0.9998906},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000067617834,0.00024398371,0.99229324,0.0033514712,0.0014547618,0.00076120713,0.000053633074,0.00030657055,0.0015283473],"genre_scores_gemma":[0.004352912,0.000026296932,0.99264354,0.0019604785,0.000677504,0.000045617653,0.0000064289507,0.000050575436,0.0002366254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588495,0.000050551527,0.0006210087,0.0016032069,0.0008943221,0.0009459814],"domain_scores_gemma":[0.9965683,0.001370515,0.0003348919,0.0012116868,0.00029570883,0.00021885385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010984064,0.0006782648,0.00069676514,0.0011143888,0.00048673886,0.00048740674,0.0032078922,0.00039196663,0.000017586608],"category_scores_gemma":[0.00008451519,0.000525733,0.00032896374,0.0005779642,0.00046775854,0.00050918636,0.00042546718,0.0005462734,0.00003662688],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003113235,0.00002103674,6.946905e-7,0.00005682277,0.000010204419,0.000013150062,0.00027762575,0.013805218,0.000047555397,0.010159279,0.000017023884,0.97558826],"study_design_scores_gemma":[0.00037190848,0.00018760459,0.0000066906528,0.00073525496,0.000013323972,0.000041968524,1.17324056e-7,0.87618715,0.0017665874,0.117771946,0.002258703,0.00065876293],"about_ca_topic_score_codex":0.000006532534,"about_ca_topic_score_gemma":0.000007717012,"teacher_disagreement_score":0.9749295,"about_ca_system_score_codex":0.00028857935,"about_ca_system_score_gemma":0.00064580067,"threshold_uncertainty_score":0.99971944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007171144,0.00043492863,0.9698156,0.0021278816,0.00030164127,0.0007488629,0.000006231873,0.00008485031,0.026408257],"genre_scores_gemma":[0.028033402,0.00006853347,0.96798795,0.00079183705,0.00026917193,0.000017713583,0.0000031383565,0.000017567503,0.0028107052],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951936,0.00017990542,0.0009909483,0.0011670782,0.0020388102,0.00042964658],"domain_scores_gemma":[0.99338573,0.0041189245,0.0007050247,0.0010605414,0.00062280183,0.00010697335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0087117255,0.00029908473,0.0004900092,0.0012517066,0.00018027867,0.00094479974,0.0019099286,0.00019601588,0.0000475713],"category_scores_gemma":[0.0067224205,0.0002348828,0.00006774742,0.0010650276,0.0020190254,0.000993954,0.001225945,0.00045806787,0.000015911428],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005805419,0.000050529277,0.00008412117,0.000016466674,0.000006961882,0.000015204766,0.0004856176,0.005515386,0.000054792916,0.0062991115,0.00035541196,0.9871106],"study_design_scores_gemma":[0.0003809541,0.0004098529,0.0003656342,0.00065240276,0.00004709146,0.00023043368,0.000015380021,0.11427042,0.0017774382,0.05051635,0.830374,0.0009600568],"about_ca_topic_score_codex":0.00001276791,"about_ca_topic_score_gemma":0.00013990316,"teacher_disagreement_score":0.98615056,"about_ca_system_score_codex":0.00022055268,"about_ca_system_score_gemma":0.00085635437,"threshold_uncertainty_score":0.9578243},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034677516,0.00008781397,0.97227585,0.0008215964,0.0003565826,0.00070496666,0.0000069678035,0.000089906156,0.02562161],"genre_scores_gemma":[0.7627267,0.00003151987,0.23537324,0.0013648957,0.0002991754,0.00014057182,0.000004124435,0.000026694928,0.000033027718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970971,0.00004514998,0.0004506832,0.0008737338,0.000960398,0.00057296664],"domain_scores_gemma":[0.9973849,0.0008019604,0.00034926427,0.0011375323,0.0002374289,0.000088894565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008138238,0.0004450578,0.00032626893,0.0007941709,0.00033906772,0.0006921942,0.0033673013,0.00018295685,0.0000072196367],"category_scores_gemma":[0.000013050747,0.00026873194,0.00009554857,0.0010893419,0.0008896425,0.0013973563,0.00041952287,0.000710578,0.00005340218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027106695,0.000017755963,0.000010076805,0.000010457211,0.000010882415,0.0000171291,0.0027058278,0.0048973197,0.000005963466,0.79227597,0.000012078006,0.20000947],"study_design_scores_gemma":[0.001175192,0.0009013288,0.00041102033,0.0005700773,0.000012719223,0.000057476616,0.000057223482,0.5170929,0.00010745879,0.4765463,0.0020343424,0.0010340018],"about_ca_topic_score_codex":0.000015855941,"about_ca_topic_score_gemma":0.00016184969,"teacher_disagreement_score":0.7626921,"about_ca_system_score_codex":0.00014989411,"about_ca_system_score_gemma":0.00072784856,"threshold_uncertainty_score":0.9999765},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017577073,0.0005195958,0.92731446,0.0030370087,0.002531593,0.0016579216,0.000009418533,0.00014706995,0.04720583],"genre_scores_gemma":[0.8822862,0.0017127963,0.058273304,0.0050667375,0.0021743297,0.0002000808,0.000013740159,0.00011477877,0.050158013],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99428743,0.00015088523,0.00036927362,0.0017600653,0.0022739398,0.001158421],"domain_scores_gemma":[0.9964014,0.0021770287,0.00007804629,0.00054713496,0.00048712746,0.00030926208],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.003242755,0.00028205523,0.00026456057,0.001894522,0.00087222195,0.00072802475,0.0018871065,0.00018919431,0.00020843557],"category_scores_gemma":[0.0017113854,0.00024541307,0.000025971689,0.003010054,0.004270373,0.0003450601,0.0013422525,0.0014273329,0.00036414218],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008132343,0.00007349194,0.00019301157,0.000033729237,8.946526e-7,0.0000694819,0.0018465485,0.00022838985,0.0022701926,0.0003301227,0.0003112037,0.9946348],"study_design_scores_gemma":[0.00060118694,0.001093234,0.0012496366,0.001834265,0.0000049351174,0.000574838,0.000041730305,0.07447992,0.36243495,0.3503854,0.20466076,0.0026391363],"about_ca_topic_score_codex":0.00001097975,"about_ca_topic_score_gemma":0.00007988078,"teacher_disagreement_score":0.9919957,"about_ca_system_score_codex":0.0005964902,"about_ca_system_score_gemma":0.0065469374,"threshold_uncertainty_score":0.9999998},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036195037,0.00043672076,0.9963737,0.000043077915,0.0011637164,0.00043969628,0.0000036804697,0.0012668844,0.0002363431],"genre_scores_gemma":[0.008432026,0.000032469175,0.9908367,0.00023852254,0.00018566746,0.000048617792,0.0000042825036,0.000064630556,0.0001570881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575514,0.00003269452,0.0006226038,0.0017133431,0.00086347695,0.0010127241],"domain_scores_gemma":[0.9972107,0.00028740102,0.0001690367,0.0019794106,0.00016014231,0.00019332823],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009038731,0.0006833715,0.000681202,0.0018632711,0.00007117581,0.00029326096,0.0054563545,0.0005100677,0.000005208267],"category_scores_gemma":[0.000055835833,0.000714166,0.00012934771,0.0015410034,0.00020831772,0.0012334138,0.0020239789,0.0013655688,0.000016743688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015528659,0.000031577736,0.00006815688,0.00008257044,0.00000499141,0.000146348,0.0009922134,0.64456946,0.000018184668,0.027060326,0.000052378236,0.32697225],"study_design_scores_gemma":[0.00013432736,0.00006790415,0.00010409453,0.0007052054,0.0000024417893,0.000044853703,7.984593e-9,0.91626537,0.00058915454,0.07952426,0.0018026627,0.00075970846],"about_ca_topic_score_codex":0.00004744532,"about_ca_topic_score_gemma":0.000034811004,"teacher_disagreement_score":0.32621256,"about_ca_system_score_codex":0.00092649204,"about_ca_system_score_gemma":0.00091475446,"threshold_uncertainty_score":0.9999246},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057040184,0.00037558403,0.9974781,0.0008005765,0.0003038767,0.00018342352,0.0000015838327,0.00009283132,0.00019361786],"genre_scores_gemma":[0.6842473,0.0002698552,0.2794075,0.022748701,0.011274077,0.00005324403,0.00018689051,0.00017449092,0.0016379595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979653,0.000007252689,0.00034608453,0.00079959497,0.000489778,0.00039200383],"domain_scores_gemma":[0.998924,0.00012903982,0.00025625728,0.0003299051,0.00034193255,0.00001885536],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00059604144,0.00032648182,0.0003324354,0.0008879491,0.00028541684,0.0014370935,0.00055677665,0.00013780636,0.0000442074],"category_scores_gemma":[0.000059987167,0.00029119366,0.000053560376,0.0010154459,0.00026404567,0.0018619146,0.00042431965,0.00028160267,0.00002583528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061782375,0.00002097803,0.0011527702,0.00014194123,0.000014445054,0.000012920116,0.00008371777,0.076558836,0.000019439061,0.00051833736,0.0006372898,0.9208332],"study_design_scores_gemma":[0.00048983685,0.000013757329,0.0009579842,0.00032126234,0.000116040916,0.0000093306635,0.0000016404717,0.93256456,0.000054664564,0.050526645,0.0140358815,0.0009083825],"about_ca_topic_score_codex":0.00023947319,"about_ca_topic_score_gemma":0.0002868315,"teacher_disagreement_score":0.91992474,"about_ca_system_score_codex":0.000103723774,"about_ca_system_score_gemma":0.00021996474,"threshold_uncertainty_score":0.99995404},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010953794,0.00017640153,0.98477036,0.0003323364,0.0013650481,0.00077007274,0.000040501207,0.00009131942,0.0015001617],"genre_scores_gemma":[0.96975774,0.000014097181,0.02736091,0.0007862571,0.0001956896,0.00008546176,0.000039396065,0.000028168803,0.0017322768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835396,0.00004146509,0.00044936416,0.0006525524,0.00024580315,0.0002568589],"domain_scores_gemma":[0.9984329,0.0007702489,0.00025587846,0.0002053445,0.00024496586,0.00009070621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047233322,0.00026684857,0.0002827049,0.00028438156,0.0002927538,0.00015101815,0.00016807509,0.00020070259,0.00021090913],"category_scores_gemma":[0.00007921064,0.0002169123,0.000028096927,0.00007602538,0.00039460915,0.00029630313,0.000047966583,0.00023767404,0.00001634319],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104289225,0.00003284379,0.00026182726,0.00003665502,0.000025124129,0.0000031409486,0.012706629,0.0000471115,0.00074502546,0.008727743,0.000076245626,0.97723335],"study_design_scores_gemma":[0.037632447,0.00777147,0.17578213,0.0060542836,0.00019074071,0.00061043707,0.00031472018,0.41760007,0.034353618,0.07759862,0.23367517,0.008416313],"about_ca_topic_score_codex":0.000013093613,"about_ca_topic_score_gemma":0.00003165237,"teacher_disagreement_score":0.96881706,"about_ca_system_score_codex":0.00022214047,"about_ca_system_score_gemma":0.00018090676,"threshold_uncertainty_score":0.8845427},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012881773,0.00013741404,0.9832921,0.006348676,0.0013275682,0.00034367325,0.00003361753,0.00018725214,0.008200894],"genre_scores_gemma":[0.028675111,0.000021449483,0.9651836,0.0040564924,0.0011350838,0.00004705649,0.0000069606863,0.000058551443,0.0008156937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596214,0.000042063544,0.00050421583,0.0016963729,0.001054069,0.000741153],"domain_scores_gemma":[0.99537927,0.0015363069,0.000350509,0.0023947824,0.00016784719,0.00017125836],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010772323,0.00053998025,0.0004034797,0.00049504556,0.0005612782,0.0010282126,0.005666009,0.00022664196,0.000022376124],"category_scores_gemma":[0.00016262349,0.00034831025,0.00013056066,0.00057268766,0.00067590235,0.00050126616,0.0016548678,0.0006259987,0.00010896032],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010281564,0.000020540918,0.0000047096178,0.0000058170276,0.000008351701,0.000021099704,0.00023074169,0.0004913494,0.00055866316,0.17397492,0.00019850704,0.8244843],"study_design_scores_gemma":[0.000426634,0.0004914956,0.00014089233,0.0024159804,0.000020903446,0.00013799637,8.698574e-7,0.5662587,0.006545712,0.36021978,0.061515685,0.0018253091],"about_ca_topic_score_codex":0.000012002951,"about_ca_topic_score_gemma":0.000028648465,"teacher_disagreement_score":0.82265896,"about_ca_system_score_codex":0.00034247863,"about_ca_system_score_gemma":0.0002990889,"threshold_uncertainty_score":0.9998969},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016041957,0.00013736045,0.98371494,0.00018547174,0.00022861875,0.00024096013,0.000014225967,0.00008813564,0.013786104],"genre_scores_gemma":[0.98642904,0.000006428094,0.0113062905,0.00022101948,0.0013206388,0.000009563338,0.000025709387,0.000045580036,0.00063573924],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808294,0.000054276537,0.00042159576,0.00048797476,0.00038331942,0.00056988746],"domain_scores_gemma":[0.99871486,0.0003926457,0.00023502986,0.0005319894,0.00007843874,0.00004702369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000531226,0.00039230502,0.0005741594,0.00040102078,0.0002686948,0.00019713692,0.0011282306,0.00015223598,0.00050926424],"category_scores_gemma":[0.0000023056014,0.00034885784,0.00018299934,0.00032533007,0.0005794749,0.0001911783,0.00063272135,0.0007357552,0.0000272815],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008462742,0.000030629613,0.003380535,0.000009710721,0.000039565366,0.000008385632,0.00080490997,0.01102459,0.000042718773,0.021859216,0.00013235085,0.96265894],"study_design_scores_gemma":[0.00027409883,0.00004233687,0.0017271609,0.00079887273,0.00002394997,0.000001830517,5.8369045e-7,0.21137516,0.000034508193,0.78291297,0.00199615,0.00081238814],"about_ca_topic_score_codex":0.00009412995,"about_ca_topic_score_gemma":0.00042890717,"teacher_disagreement_score":0.98482484,"about_ca_system_score_codex":0.00023311625,"about_ca_system_score_gemma":0.00013704704,"threshold_uncertainty_score":0.99989635},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00488709,0.000045012308,0.98862636,0.0014947731,0.0011962058,0.00024113028,0.000027209946,0.00004941812,0.0034327812],"genre_scores_gemma":[0.9636383,0.000023315057,0.032398198,0.001563844,0.00029769007,0.000036480862,0.00004773247,0.000020433334,0.0019740188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985162,0.00006653642,0.00047437375,0.0003992264,0.00033136221,0.00021232558],"domain_scores_gemma":[0.99883676,0.0004948736,0.0001093149,0.00031422309,0.00018184246,0.00006301226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006682331,0.0002056698,0.00020163803,0.0006683174,0.00021147483,0.00017379934,0.00027556202,0.00022754307,0.0005515257],"category_scores_gemma":[0.00006481818,0.0001791489,0.000036479854,0.00015379109,0.00021931925,0.000769413,0.00009652168,0.00034847434,0.0001657787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100311125,0.000014208315,0.00004955552,0.000008733827,0.0000063138878,0.0000061869755,0.0058470992,0.7234078,0.00000751832,0.01230724,0.000036029578,0.258209],"study_design_scores_gemma":[0.00040145425,0.00003740438,0.0006474847,0.00022227466,0.000002561301,0.00003719505,0.0000021210888,0.984226,0.000011201348,0.01092287,0.0032533715,0.00023606999],"about_ca_topic_score_codex":0.00003734123,"about_ca_topic_score_gemma":0.00011728925,"teacher_disagreement_score":0.9587512,"about_ca_system_score_codex":0.00019969154,"about_ca_system_score_gemma":0.00027014985,"threshold_uncertainty_score":0.730548},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002127308,0.0005645827,0.99355936,0.00064264616,0.00074812124,0.00035379626,7.7493877e-7,0.00014640161,0.0018570217],"genre_scores_gemma":[0.07223421,0.00005939427,0.9259336,0.0011421322,0.00015491224,0.000029306037,0.000002419314,0.000018482293,0.00042551119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977351,0.000026978372,0.0004058397,0.00093925244,0.0004246003,0.0004682267],"domain_scores_gemma":[0.9985103,0.0005316583,0.00017599548,0.00062136544,0.00009978352,0.000060886923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060672965,0.00032698628,0.00047534917,0.0008528307,0.00017546756,0.00029823015,0.0014998286,0.00032539837,0.0000047665085],"category_scores_gemma":[0.00010441135,0.00028922377,0.000038271253,0.0009029608,0.0008200314,0.00041357536,0.0013506879,0.00067560363,0.000023934235],"study_design_candidate":"design_other","study_design_consensus":null,"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.921087e-7,0.00007021291,0.00023049979,0.00014534347,0.000010537873,0.00007084461,0.008758321,0.0051028384,0.000024869978,0.024416177,0.0006362864,0.9605331],"study_design_scores_gemma":[0.00019965177,0.00006455469,0.00074836996,0.0002457155,0.0000026585753,0.000045475917,9.460621e-7,0.55336934,0.000030334364,0.44458857,0.0003664566,0.00033793616],"about_ca_topic_score_codex":0.000021979597,"about_ca_topic_score_gemma":0.0001794679,"teacher_disagreement_score":0.9601951,"about_ca_system_score_codex":0.00021043254,"about_ca_system_score_gemma":0.00031702948,"threshold_uncertainty_score":0.999956},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016825637,0.00076148345,0.9963578,0.00009510324,0.0010779884,0.0003497531,0.0000030013794,0.0012869417,0.00005113189],"genre_scores_gemma":[0.00089251954,0.000027416972,0.99837744,0.00028304773,0.00023075532,0.0000248774,0.0000033063568,0.000048132202,0.000112474816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965473,0.00003534794,0.0004536279,0.0014006981,0.00065901957,0.0009040185],"domain_scores_gemma":[0.9976659,0.00044765804,0.00014985377,0.00136741,0.0001441916,0.00022501485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013393373,0.00060071674,0.0005802177,0.000985625,0.00015368406,0.0004954376,0.0029857878,0.000410592,0.0000024118872],"category_scores_gemma":[0.00010613994,0.00059610285,0.0001016237,0.0009056283,0.0003012628,0.0011498875,0.0024516762,0.0010501067,0.000003533777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.2987566e-7,0.000010086954,0.000018852557,0.00011118122,0.000006964084,0.00004790579,0.00056296634,0.16788872,0.000057041932,0.015549648,0.000012821157,0.815733],"study_design_scores_gemma":[0.00021857944,0.00014877903,0.0001670723,0.0007677352,0.000007708963,0.00022852648,1.1584139e-8,0.9369057,0.0031555165,0.044484317,0.012935159,0.0009808829],"about_ca_topic_score_codex":0.00001184058,"about_ca_topic_score_gemma":0.0000047199696,"teacher_disagreement_score":0.8147521,"about_ca_system_score_codex":0.0010496099,"about_ca_system_score_gemma":0.0014367178,"threshold_uncertainty_score":0.99964905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04980297,0.0000353907,0.8296619,0.00530926,0.007900681,0.0021208315,0.00052147283,0.0003061766,0.10434132],"genre_scores_gemma":[0.99744374,0.00003864376,0.0001673362,0.00030284526,0.00028817082,0.000005961384,9.33014e-7,0.00002096078,0.0017314227],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976797,0.00007325678,0.00041450118,0.00074199203,0.00067117246,0.00041936454],"domain_scores_gemma":[0.9953965,0.0030476602,0.0003517826,0.0009676718,0.0001258059,0.00011056042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021465089,0.00031745026,0.00028516198,0.000319254,0.00048126662,0.00014481267,0.00082945806,0.00014597902,0.00008588603],"category_scores_gemma":[0.00048209523,0.00017747578,0.00024410663,0.00021873171,0.0009615424,0.00021432433,0.00019353634,0.00056788663,0.00008040584],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034328472,0.00038730275,0.000082020095,0.000022789292,0.000055738677,0.00011018325,0.0019713272,0.13573812,0.11745144,0.05329633,0.0008013208,0.6897401],"study_design_scores_gemma":[0.0015451048,0.0065170936,0.0025447144,0.0017472175,0.000056265504,0.000545484,0.0000048251122,0.14967057,0.5970787,0.225845,0.012009329,0.00243572],"about_ca_topic_score_codex":0.000057413752,"about_ca_topic_score_gemma":0.00005519138,"teacher_disagreement_score":0.9476408,"about_ca_system_score_codex":0.00047095664,"about_ca_system_score_gemma":0.00040595364,"threshold_uncertainty_score":0.7237252},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001280187,0.0009455708,0.99614084,0.00037308063,0.001112023,0.00045303887,0.000006935781,0.00015108155,0.0006893999],"genre_scores_gemma":[0.09712876,0.00006539214,0.9008726,0.0011182511,0.00043260615,0.000005804535,0.0000013758247,0.0000758591,0.00029934684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942355,0.00017907884,0.000663377,0.0021416082,0.0016805113,0.0010999279],"domain_scores_gemma":[0.9963215,0.00068330683,0.00038796375,0.001767523,0.00053456146,0.00030511947],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016777873,0.000951417,0.0010280185,0.00082856277,0.0005917196,0.0010372809,0.003554009,0.00037872404,0.000011908591],"category_scores_gemma":[0.00010998152,0.00063555123,0.00021641688,0.0005475205,0.0015003142,0.0010291835,0.0014480388,0.0010358753,0.0000142913805],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026208305,0.00006243752,0.000093403905,0.00008974912,0.000038279533,0.00040348116,0.0005753736,0.011351722,0.004641435,0.0014361641,0.000006084493,0.9812757],"study_design_scores_gemma":[0.0020563644,0.00046701165,0.0005497928,0.004774597,0.00009199411,0.0005752718,4.722583e-7,0.85741895,0.059962776,0.07091065,0.0005527568,0.0026393577],"about_ca_topic_score_codex":0.00004427301,"about_ca_topic_score_gemma":0.00009810966,"teacher_disagreement_score":0.9786363,"about_ca_system_score_codex":0.00058216415,"about_ca_system_score_gemma":0.0007059737,"threshold_uncertainty_score":0.99999976},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009451354,0.0003792147,0.9947237,0.00046926024,0.0004903099,0.0007461395,0.0000069745133,0.00025453622,0.001984767],"genre_scores_gemma":[0.39456588,0.0000151539525,0.6043168,0.00031429876,0.00021168905,0.000049183654,0.0000020689863,0.000044661854,0.00048027627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942469,0.000040269366,0.000694396,0.0023168381,0.0017925344,0.000909036],"domain_scores_gemma":[0.99654174,0.00031089538,0.00040625222,0.0021343457,0.00035787938,0.0002488658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097382255,0.00075326726,0.00069896836,0.000619748,0.00066131377,0.00055902306,0.0034548936,0.00027083917,0.000012579985],"category_scores_gemma":[0.000058407633,0.0005545404,0.00013906967,0.00027287574,0.0006355805,0.001059209,0.0019396814,0.00057145336,0.000012105428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015939213,0.000029936402,0.000054866818,0.000030932937,0.000017764538,0.000023946146,0.0027021896,0.8565735,0.00029638613,0.04009801,0.0000033427034,0.10015314],"study_design_scores_gemma":[0.0007152419,0.00022524342,0.000002944542,0.0007327972,0.000010073379,0.0000204589,3.790854e-7,0.8651186,0.00094866875,0.13147174,0.00006269285,0.00069116626],"about_ca_topic_score_codex":0.000050124243,"about_ca_topic_score_gemma":0.0003266552,"teacher_disagreement_score":0.39362076,"about_ca_system_score_codex":0.0006558468,"about_ca_system_score_gemma":0.00082701095,"threshold_uncertainty_score":0.9996906},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052412944,0.005836383,0.014420263,0.0017258556,0.0031316648,0.0006458047,0.00008704705,0.0000830174,0.9688287],"genre_scores_gemma":[0.9113371,0.0001636064,0.0009481732,0.00026295413,0.0026901464,0.0000139561325,0.000015526097,0.000043636206,0.08452491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980781,0.000041702853,0.00032634646,0.00037648252,0.00077854097,0.0003988374],"domain_scores_gemma":[0.9964814,0.0023145454,0.00032474566,0.00044096247,0.00037640138,0.000061936145],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012274387,0.00018444443,0.00022382103,0.00024270041,0.0009320195,0.005346175,0.0012161628,0.000072653434,0.000068260946],"category_scores_gemma":[0.0004763865,0.0001185508,0.00004065259,0.00011128167,0.00676356,0.0016101007,0.00073386123,0.0006299737,0.000011661684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025960779,0.00003857176,0.0001592815,0.00013602605,0.0000155501,0.0000072885355,0.019230211,0.00004414772,0.0000017525823,0.7289126,0.003969436,0.24745922],"study_design_scores_gemma":[0.000052933232,0.00031040193,0.000023414881,0.00018800252,0.0000032292473,0.0000048100874,0.00006227435,0.0007339554,0.000029756968,0.5926349,0.40576705,0.00018927042],"about_ca_topic_score_codex":0.000017714567,"about_ca_topic_score_gemma":0.00079011725,"teacher_disagreement_score":0.9060958,"about_ca_system_score_codex":0.000025088517,"about_ca_system_score_gemma":0.00037593616,"threshold_uncertainty_score":0.99593943},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000626337,0.00051350443,0.9929381,0.00004028078,0.0022409384,0.00027633348,0.000003772749,0.0001311871,0.0037932515],"genre_scores_gemma":[0.016413296,0.00017006896,0.98229045,0.0002605392,0.000692234,0.000017809854,0.0000024449494,0.000029566594,0.00012362252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975396,0.00004967063,0.00045067992,0.0006683818,0.00039128753,0.00090040086],"domain_scores_gemma":[0.9987981,0.0006066718,0.0000617543,0.00037835495,0.00003489669,0.000120225806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011128127,0.00041360207,0.0005602464,0.00039491625,0.00015471633,0.00014537932,0.0010527915,0.00024137388,0.00007085224],"category_scores_gemma":[0.00003798371,0.00034034235,0.000070628805,0.0010852398,0.0008059112,0.0002238008,0.0005299769,0.0006097986,0.000025241328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002779594,0.000008241527,0.000001967934,0.00003488499,0.0000027974895,0.000013528424,0.00014868667,0.51372206,0.000088612236,0.0007427405,0.00003981631,0.48519388],"study_design_scores_gemma":[0.00016840562,0.00008976291,0.000021240086,0.00016288554,0.000003444673,0.000009852261,2.9269438e-7,0.79601216,0.0012347889,0.20042904,0.0014205088,0.00044759215],"about_ca_topic_score_codex":0.0000028729617,"about_ca_topic_score_gemma":0.000005489994,"teacher_disagreement_score":0.48474628,"about_ca_system_score_codex":0.00029210272,"about_ca_system_score_gemma":0.000055297187,"threshold_uncertainty_score":0.9999049},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023377147,0.00005469871,0.97969335,0.0011190639,0.0037494851,0.00039864998,0.00002396781,0.00012858414,0.014598427],"genre_scores_gemma":[0.5379983,0.000010289673,0.4290855,0.0091992235,0.0012350011,0.000016685786,0.000040823037,0.000061043655,0.02235315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9861574,0.00011547611,0.0010898374,0.0036357986,0.008003293,0.0009981659],"domain_scores_gemma":[0.99269956,0.0028980551,0.00045657653,0.0027016508,0.0008932035,0.0003509366],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.012301579,0.00050915394,0.00059625664,0.0044460283,0.0013088986,0.0032850276,0.0076466696,0.00017536429,0.00019867174],"category_scores_gemma":[0.001364985,0.00040752572,0.00020096132,0.0074073244,0.0032001347,0.0008542095,0.0004596599,0.00089793425,0.00066867576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048952065,0.000052375774,0.0000054801526,0.0000023273417,0.0000018604063,0.000015833526,0.00018842205,0.4574245,0.000005407525,0.0005060378,0.0015320375,0.54026085],"study_design_scores_gemma":[0.00023006988,0.00018620181,0.0006787491,0.00016191695,0.0000071560867,0.00002407289,0.0000011549594,0.69469076,0.00010554613,0.29324204,0.01020041,0.00047191078],"about_ca_topic_score_codex":0.0000121722705,"about_ca_topic_score_gemma":0.000039428516,"teacher_disagreement_score":0.55060786,"about_ca_system_score_codex":0.00089806446,"about_ca_system_score_gemma":0.003070136,"threshold_uncertainty_score":0.99999124},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055696345,0.000031393633,0.99031717,0.00015675167,0.00072333403,0.0015574102,0.0000071521044,0.00051369454,0.0011234861],"genre_scores_gemma":[0.7466597,0.0000038456024,0.25251564,0.00016954361,0.00039718722,0.000042385003,0.000006721667,0.000043444146,0.00016153029],"study_design_codex":"design_other","study_design_gemma":"case_report","domain_scores_codex":[0.9946748,0.00022672035,0.0007929216,0.0018093404,0.0019393563,0.0005568814],"domain_scores_gemma":[0.9964869,0.0011708142,0.0004029919,0.0012196652,0.00044842955,0.00027122008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016309726,0.00059926766,0.0005677143,0.00066867325,0.00032978057,0.00065254327,0.001898409,0.00026836814,0.00002824044],"category_scores_gemma":[0.00007332977,0.0004289698,0.000094968156,0.00068602344,0.0007210054,0.0010980833,0.00031417716,0.0006641214,0.00002707162],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038434893,0.00033198786,0.00018657699,0.00025187107,0.00005774461,0.061541863,0.0069421413,0.0011065996,0.0017135506,0.0072574685,0.000048749906,0.920523],"study_design_scores_gemma":[0.016956188,0.011650655,0.00087057945,0.008999481,0.00038622651,0.46282148,0.00006115992,0.43120083,0.0364855,0.021245651,0.0005625277,0.008759724],"about_ca_topic_score_codex":0.000064859785,"about_ca_topic_score_gemma":0.00003904864,"teacher_disagreement_score":0.9117633,"about_ca_system_score_codex":0.00047944707,"about_ca_system_score_gemma":0.0003719676,"threshold_uncertainty_score":0.99981624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03776192,0.000014682136,0.96017057,0.00007384673,0.00063658773,0.00092441274,0.000015725676,0.000037083297,0.00036516122],"genre_scores_gemma":[0.96853805,0.0000061313012,0.031180872,0.00006311195,0.00013514963,0.000027219898,0.0000020505993,0.000015989706,0.00003142701],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835455,0.000093031354,0.00027385217,0.0006302816,0.00047816228,0.00017013965],"domain_scores_gemma":[0.998145,0.0010918964,0.00024347655,0.0002429178,0.00022533206,0.00005136929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049333024,0.00017746726,0.00021147514,0.0003298595,0.00021939572,0.00012858822,0.00016884992,0.00011883195,0.0000049509463],"category_scores_gemma":[0.00014032956,0.00015121535,0.00002750251,0.00008266071,0.00022776649,0.00059973425,0.00005539652,0.00013818569,0.0000015547362],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071931565,0.0000168184,0.000004151676,0.00009433161,0.000003533677,0.0000027726605,0.0006247483,0.01765495,0.50365,0.0035940392,0.0000010309544,0.4742817],"study_design_scores_gemma":[0.000325959,0.00020392585,0.000042671978,0.00037943618,0.000027449085,0.00007399932,8.3815155e-7,0.63365966,0.356377,0.008714787,0.000024548406,0.00016970398],"about_ca_topic_score_codex":0.0000029286157,"about_ca_topic_score_gemma":0.0000035973992,"teacher_disagreement_score":0.9307761,"about_ca_system_score_codex":0.00016840249,"about_ca_system_score_gemma":0.00011319498,"threshold_uncertainty_score":0.61663836},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008876517,0.00013002017,0.98817843,0.0007108888,0.00028853302,0.00041994936,0.000004291804,0.000028227058,0.001363133],"genre_scores_gemma":[0.99472004,0.000004166677,0.004310085,0.00015471394,0.00014359577,0.000020905247,0.000011994554,0.0000223818,0.0006121068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860734,0.00006701288,0.00032507538,0.00053634046,0.00024032286,0.0002239388],"domain_scores_gemma":[0.99652916,0.0024917617,0.0004459037,0.00020152876,0.00030399874,0.000027644504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013670346,0.0001768738,0.0001897698,0.0003471589,0.000091444526,0.000081267535,0.00025253565,0.000162966,0.000023585435],"category_scores_gemma":[0.0005292121,0.0001320415,0.00005228611,0.0001530976,0.00019406568,0.00017472183,0.000059142712,0.00043040392,0.000002325924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051455918,0.000060158494,0.0011002609,0.00005688964,0.000017202017,0.0000013082105,0.018986983,0.020390026,0.000223704,0.5148046,9.453051e-7,0.44430643],"study_design_scores_gemma":[0.00058063946,0.00034273663,0.0069358596,0.00037425235,0.000020822737,0.00001252581,0.0001966383,0.18386845,0.00016613731,0.8068014,0.00035385203,0.00034669423],"about_ca_topic_score_codex":0.0000056395756,"about_ca_topic_score_gemma":0.0000058692804,"teacher_disagreement_score":0.98584354,"about_ca_system_score_codex":0.00021667889,"about_ca_system_score_gemma":0.00015749768,"threshold_uncertainty_score":0.53844965},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006236482,0.00030385418,0.98739386,0.0004052424,0.0024602315,0.00042055987,0.0000027225838,0.00013742797,0.008252469],"genre_scores_gemma":[0.89428604,0.00007075409,0.102814265,0.0008234989,0.0013583936,0.000014989662,0.000005141946,0.00006142898,0.0005654704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995637,0.00008309539,0.0009580172,0.0017225302,0.0008329981,0.00076633715],"domain_scores_gemma":[0.9968973,0.00082274363,0.00057180686,0.0011947028,0.00037520795,0.00013828573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012362866,0.00059328915,0.0007733634,0.001642707,0.00015278246,0.00025607971,0.002798048,0.00035498894,0.000026146326],"category_scores_gemma":[0.000041063166,0.0005050047,0.00019227175,0.0008561935,0.0006112922,0.0006128824,0.0018546672,0.0010172684,0.000036278423],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006276694,0.000058625774,0.00023081264,0.000056789995,0.000012217218,0.00005206321,0.0006647175,0.014852738,0.0002674482,0.010305784,0.000036282094,0.97345626],"study_design_scores_gemma":[0.0011982319,0.0007725203,0.0014349717,0.008629823,0.000013273523,0.00011585007,2.2782066e-7,0.72837055,0.0025386163,0.2536524,0.0016749853,0.0015985408],"about_ca_topic_score_codex":0.000027329676,"about_ca_topic_score_gemma":0.00023618413,"teacher_disagreement_score":0.9718577,"about_ca_system_score_codex":0.00036039058,"about_ca_system_score_gemma":0.00029448682,"threshold_uncertainty_score":0.9997402},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025419515,0.00027731207,0.9947688,0.00064726785,0.0004952785,0.00035309515,0.0000049236987,0.00005987702,0.0031392805],"genre_scores_gemma":[0.7531425,0.000060943305,0.24484755,0.000710897,0.00031638867,0.000029247814,0.000006828122,0.000038699956,0.0008469383],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776906,0.000033322158,0.0004721802,0.0008094515,0.0005608808,0.00035510253],"domain_scores_gemma":[0.99827594,0.00021976959,0.00022596755,0.0010160863,0.0001981166,0.00006414201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005804947,0.0002644391,0.0003444926,0.000805751,0.00007082435,0.00013774945,0.0016647588,0.00016218796,0.000020441355],"category_scores_gemma":[0.00013588132,0.00021121671,0.0000688625,0.00065509963,0.0003646511,0.00094000343,0.00062998675,0.00027717356,0.000025636582],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006461773,0.0000691257,0.0002776163,0.00008251655,0.0000053396548,0.00007900945,0.009076173,0.0039971275,0.0042435178,0.062026605,0.00001585124,0.92012066],"study_design_scores_gemma":[0.001506313,0.00058146904,0.00083224353,0.0029056116,0.000013732616,0.00006336039,0.0000044359363,0.44696698,0.048179563,0.4960435,0.0009991083,0.001903675],"about_ca_topic_score_codex":0.000012175574,"about_ca_topic_score_gemma":0.00018078246,"teacher_disagreement_score":0.918217,"about_ca_system_score_codex":0.0001609465,"about_ca_system_score_gemma":0.0004479783,"threshold_uncertainty_score":0.86131674},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003179777,0.0013800226,0.98363906,0.00066937675,0.0059898677,0.00083278335,0.000010809055,0.0006748682,0.006771408],"genre_scores_gemma":[0.014327786,0.00003407206,0.9772429,0.0027347181,0.0028764461,0.000052163658,0.000019360301,0.000106095205,0.0026064594],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99113876,0.00037775986,0.0009609238,0.003384768,0.00253226,0.0016055406],"domain_scores_gemma":[0.99263924,0.0016274789,0.00045695226,0.003875775,0.00082895096,0.0005715738],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.005050079,0.001055475,0.0011394848,0.0014108917,0.00025517095,0.0012045272,0.010847946,0.00065041205,0.000028110422],"category_scores_gemma":[0.0005639924,0.0009561024,0.0002861613,0.0026263222,0.0017126297,0.001110804,0.0056980844,0.0018265441,0.00027114432],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006185398,0.0000985729,0.000020165138,0.000046890556,0.000015659987,0.0002431006,0.001226849,0.0244755,0.000013598843,0.008250123,0.00055909704,0.96504426],"study_design_scores_gemma":[0.00030854827,0.00021338923,0.0000743164,0.00013442845,0.000007926925,0.00016665133,2.0423896e-7,0.45767012,0.00015485457,0.5363391,0.0041231858,0.0008072572],"about_ca_topic_score_codex":0.000024356246,"about_ca_topic_score_gemma":0.000037662605,"teacher_disagreement_score":0.964237,"about_ca_system_score_codex":0.002029113,"about_ca_system_score_gemma":0.0051002684,"threshold_uncertainty_score":0.99983233},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082979226,0.0038054772,0.99375296,0.0002840704,0.00045793838,0.00015923938,0.000027342894,0.0000696639,0.0013603534],"genre_scores_gemma":[0.009964846,0.00065744016,0.9843667,0.00047432745,0.00045828705,0.00003514254,0.00019831494,0.00003546554,0.0038094902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973432,0.00006916841,0.00033654054,0.001443878,0.00035081225,0.00045644364],"domain_scores_gemma":[0.9981598,0.00065213855,0.00012630624,0.0008845591,0.00007398357,0.000103207625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007208863,0.00031425632,0.00038476594,0.0005436605,0.00020282602,0.00086875836,0.0016843686,0.00010255741,0.000004036266],"category_scores_gemma":[0.00016084818,0.00029426249,0.000040429888,0.001362267,0.00037421394,0.0010657903,0.0030307935,0.00084632996,0.000009531654],"study_design_candidate":"design_other","study_design_consensus":null,"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.4082825e-7,0.000062973886,0.00053818244,0.000054987784,0.000003818497,0.00007503403,0.0006352823,0.0015673075,0.000042908785,0.005790507,0.000077693534,0.99115044],"study_design_scores_gemma":[0.00022104719,0.000048599864,0.000416905,0.00062386796,0.0000039825327,0.00007538898,5.288969e-7,0.96533996,0.00022015332,0.0061775004,0.026387194,0.0004848892],"about_ca_topic_score_codex":0.000094733405,"about_ca_topic_score_gemma":0.0004144711,"teacher_disagreement_score":0.99066556,"about_ca_system_score_codex":0.00018039886,"about_ca_system_score_gemma":0.0010715568,"threshold_uncertainty_score":0.99995095},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052565365,0.0005703656,0.9918771,0.00090386847,0.0044598165,0.00063589524,0.0000048445713,0.0003587245,0.0006637683],"genre_scores_gemma":[0.22650287,0.0000108286595,0.7708256,0.0012751581,0.00094751344,0.000016498418,0.000063711756,0.000042153948,0.00031566242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99407834,0.00023561566,0.00085849804,0.002408101,0.0015833538,0.0008361009],"domain_scores_gemma":[0.9962404,0.0015563853,0.0005027517,0.00085472903,0.0005883395,0.0002574092],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017890786,0.00072661194,0.0007933311,0.0011127245,0.0004255317,0.0011036103,0.0023457103,0.00036921643,0.000005988799],"category_scores_gemma":[0.00017995595,0.00070928776,0.00017319909,0.0013690315,0.0011213992,0.00094083394,0.0021145886,0.0011151107,0.00004112682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055835417,0.00006294801,0.00016850991,0.00011423758,0.000015177982,0.000037980233,0.0004031993,0.14342584,0.000028792767,0.0038205718,0.00019434305,0.85172284],"study_design_scores_gemma":[0.00041347486,0.00016046313,0.0019686138,0.00016317703,0.000007896903,0.00013316632,1.3657431e-7,0.7527174,0.00005066542,0.24345532,0.00034516858,0.0005845493],"about_ca_topic_score_codex":0.000025129782,"about_ca_topic_score_gemma":0.00008120531,"teacher_disagreement_score":0.8511383,"about_ca_system_score_codex":0.0008070819,"about_ca_system_score_gemma":0.0011368209,"threshold_uncertainty_score":0.99993336},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007427889,0.00025267768,0.9622305,0.0011367549,0.00033587383,0.0006259486,0.000004681026,0.0000671626,0.035272095],"genre_scores_gemma":[0.048349243,0.000019286526,0.94946736,0.00040512142,0.00013622595,0.000014045787,0.0000028014074,0.000014415227,0.0015915065],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.995488,0.00018770203,0.00080379477,0.0009791404,0.0022455542,0.00029581055],"domain_scores_gemma":[0.9939205,0.0030474085,0.0006128285,0.00096362084,0.0013502315,0.00010538957],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.011374099,0.0002412735,0.0004426274,0.0010522682,0.000115762676,0.00088061416,0.0017214696,0.00016282275,0.0000146375905],"category_scores_gemma":[0.011302967,0.000183688,0.000046754594,0.0012173183,0.0019242971,0.0008167113,0.0013680293,0.0003641398,0.0000103645725],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006918668,0.000039577848,0.0000871994,0.000019141182,0.000006170689,0.000020932848,0.0010439098,0.0030101954,0.000036128095,0.009335332,0.00044162784,0.98595285],"study_design_scores_gemma":[0.00049774844,0.00085605145,0.00019114498,0.00078061677,0.000052533305,0.0002796841,0.000035384175,0.17547132,0.001249314,0.38899758,0.43050689,0.0010817593],"about_ca_topic_score_codex":0.000012872779,"about_ca_topic_score_gemma":0.00005864116,"teacher_disagreement_score":0.9848711,"about_ca_system_score_codex":0.00019185978,"about_ca_system_score_gemma":0.0011291039,"threshold_uncertainty_score":0.99702525},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006729689,0.0007170793,0.9967711,0.00009156048,0.0007117203,0.00037030553,0.0000047472586,0.0010494094,0.00021675587],"genre_scores_gemma":[0.035217132,0.000031060117,0.9638005,0.00018073889,0.00033879068,0.00003373096,0.000004572299,0.000052380354,0.00034110536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968165,0.000031580104,0.00041219906,0.0013283119,0.00074216595,0.00066921965],"domain_scores_gemma":[0.99782926,0.0002680699,0.00015877352,0.0014008342,0.00014377042,0.0001993077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006950478,0.00054686866,0.00060240255,0.00083498086,0.00010298701,0.00060578395,0.0027324387,0.000366946,5.9542293e-7],"category_scores_gemma":[0.000030152827,0.00052856567,0.000072154675,0.00053245935,0.00020982246,0.00049535395,0.0014260068,0.000771738,0.0000064694696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.801563e-7,0.000006277603,0.000017980346,0.00013034244,0.000005933539,0.0000270488,0.00032725648,0.8707482,0.00013210192,0.02832633,0.00009668198,0.10018135],"study_design_scores_gemma":[0.000096031385,0.00005796923,0.000018355046,0.00056660204,0.0000048740376,0.00007356499,1.7002044e-8,0.99209094,0.00019292529,0.0028451628,0.0034835248,0.00057002896],"about_ca_topic_score_codex":0.000014154853,"about_ca_topic_score_gemma":0.0000070461997,"teacher_disagreement_score":0.121342726,"about_ca_system_score_codex":0.0003740061,"about_ca_system_score_gemma":0.00035717298,"threshold_uncertainty_score":0.9997166},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025363558,0.000049033682,0.9724239,0.00038824647,0.0065187323,0.00038779443,0.000038223203,0.00012089024,0.019819519],"genre_scores_gemma":[0.6087519,0.00000873938,0.36416188,0.0040533342,0.000869284,0.000024312027,0.000029691286,0.00006878387,0.022032084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98741,0.00011452371,0.0010804081,0.0036308449,0.006778345,0.0009858801],"domain_scores_gemma":[0.9928678,0.0024855824,0.0004855391,0.0028558169,0.0009465113,0.0003587131],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.012176674,0.00050564297,0.0005756443,0.004381363,0.0012633002,0.0023091114,0.008237182,0.00017850347,0.0004547645],"category_scores_gemma":[0.0012012966,0.00040042555,0.00019770054,0.0064053796,0.0042591747,0.00087006134,0.0007298642,0.0008706278,0.0010636857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008808725,0.00008064413,0.00001707906,0.0000050893705,0.000004069468,0.000020690515,0.00058240123,0.3228676,0.000008238814,0.0012821135,0.0011025409,0.6740207],"study_design_scores_gemma":[0.0002733838,0.00019886892,0.0007189999,0.00019635439,0.000010819642,0.000029964121,0.0000020970879,0.6027176,0.0002943,0.38308167,0.01184662,0.0006293304],"about_ca_topic_score_codex":0.000029113893,"about_ca_topic_score_gemma":0.000059130824,"teacher_disagreement_score":0.6733914,"about_ca_system_score_codex":0.0007134999,"about_ca_system_score_gemma":0.003061403,"threshold_uncertainty_score":0.9998448},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006633597,0.01598526,0.97997785,0.0004041006,0.0016323366,0.00032424674,0.0000015394496,0.00036464125,0.0013033928],"genre_scores_gemma":[0.051095385,0.00019367834,0.9472267,0.00071305555,0.00062145083,0.00002101798,0.0000036128902,0.00002660198,0.000098497534],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959144,0.00007289381,0.0006446927,0.0014006724,0.0009727103,0.0009946062],"domain_scores_gemma":[0.99767345,0.00048783218,0.00029421205,0.0012239049,0.0001685513,0.0001520458],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013965927,0.0005014839,0.00052110094,0.0013316469,0.00013930543,0.00053698913,0.0054421863,0.00038813445,0.000011484132],"category_scores_gemma":[0.00024755334,0.00044589996,0.00008538739,0.0022503685,0.00065524055,0.0022732671,0.001678514,0.0013490759,0.000043162807],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027617416,0.00003522464,0.000027452448,0.000049144863,7.721118e-7,0.000053563865,0.0005993997,0.001530461,0.00006038532,0.028400037,0.00001016857,0.96923065],"study_design_scores_gemma":[0.000028605724,0.00006808537,0.000009970203,0.0005537537,0.0000021827038,0.000046726884,1.80258e-7,0.11397485,0.00900128,0.8747452,0.00095979834,0.00060936814],"about_ca_topic_score_codex":0.000016781098,"about_ca_topic_score_gemma":0.00017322779,"teacher_disagreement_score":0.96862125,"about_ca_system_score_codex":0.0006865731,"about_ca_system_score_gemma":0.0009458649,"threshold_uncertainty_score":0.99993885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010197333,0.00060595345,0.9960923,0.00020148407,0.0012514873,0.00017669259,0.0000032950309,0.00016487896,0.0014936941],"genre_scores_gemma":[0.028675698,0.0004790268,0.9507506,0.012818321,0.003621639,0.000016954322,0.00022855634,0.00013178443,0.0032774138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997039,0.00007109399,0.00040093125,0.0010836981,0.00088238856,0.00052283844],"domain_scores_gemma":[0.998222,0.00019872481,0.00022776495,0.00083402783,0.0002980358,0.00021944485],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012673765,0.00033766567,0.00038937977,0.0006110704,0.00024849907,0.0011029056,0.0018999873,0.00021314855,0.0000043627483],"category_scores_gemma":[0.0001441803,0.000318271,0.00004792811,0.001994425,0.00042654795,0.00087752036,0.0013712477,0.00032419234,0.000015113753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049620894,0.00007642161,0.0007321339,0.0001502869,0.00002871684,0.000095399264,0.0025940237,0.17899767,0.00001954305,0.17594475,0.012920888,0.6284352],"study_design_scores_gemma":[0.00016550554,0.00006351963,0.000052206102,0.00022459481,0.000006407078,0.000023925764,1.3725796e-7,0.8057956,0.00002967186,0.18504874,0.008203554,0.0003861538],"about_ca_topic_score_codex":0.0000066474868,"about_ca_topic_score_gemma":0.000031096708,"teacher_disagreement_score":0.6280491,"about_ca_system_score_codex":0.00019719008,"about_ca_system_score_gemma":0.0009937419,"threshold_uncertainty_score":0.999934},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019517296,0.00007608926,0.99227804,0.0012329135,0.0032949084,0.00037561552,0.000007818765,0.00040197684,0.0021374945],"genre_scores_gemma":[0.19846155,0.000005546206,0.7961429,0.0037434264,0.0008426195,0.000015556177,0.000006608904,0.000056905927,0.0007248975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926577,0.00009749012,0.0006596115,0.0027061794,0.002579293,0.001299723],"domain_scores_gemma":[0.99584866,0.0011335474,0.0003386554,0.0018297615,0.00044441057,0.00040495867],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002059906,0.00074115564,0.00066674803,0.0021839677,0.0012393482,0.001298251,0.006882827,0.0002900462,0.000015343672],"category_scores_gemma":[0.00010296101,0.00066499517,0.00021555636,0.0032619098,0.0024846783,0.0005984118,0.0005353794,0.0016945286,0.00012218599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002100481,0.00004031225,0.0000016651021,0.000016021422,0.0000038671988,0.00002076155,0.0003532781,0.5716625,0.000017689747,0.0021226744,0.00003403592,0.4257251],"study_design_scores_gemma":[0.00027645208,0.0003012556,0.00010108244,0.0003360915,0.000005070946,0.00011330627,7.692957e-8,0.8883153,0.0005112532,0.10793088,0.001423536,0.00068568997],"about_ca_topic_score_codex":0.000010398353,"about_ca_topic_score_gemma":0.000014582913,"teacher_disagreement_score":0.4250394,"about_ca_system_score_codex":0.00076624623,"about_ca_system_score_gemma":0.0038474677,"threshold_uncertainty_score":0.9997385},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018502189,0.000063576736,0.9228609,0.0007172628,0.0012317672,0.0008484357,0.000018036622,0.00033876568,0.07207099],"genre_scores_gemma":[0.89396954,0.00012242919,0.03803327,0.00216642,0.0016677997,0.000071682116,0.000004794514,0.00021815702,0.063745916],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9961208,0.00006505517,0.00040803617,0.0016290077,0.0009366415,0.0008404609],"domain_scores_gemma":[0.99701715,0.0012104772,0.00042024537,0.00093060435,0.00022458221,0.00019691762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019743867,0.00058184064,0.0005141837,0.00062748085,0.0007475947,0.0005804579,0.0014426851,0.00025205387,0.00009855121],"category_scores_gemma":[0.00035124586,0.00040646808,0.00012995217,0.0004326008,0.0010322494,0.00067877024,0.0005148633,0.0012327647,0.00010591985],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020491626,0.00006702238,0.00012221062,0.00007329575,0.000026127269,0.00045870704,0.002818314,0.0097858915,0.011483111,0.011248784,0.00002707975,0.96368456],"study_design_scores_gemma":[0.0057981717,0.0058389106,0.00007133727,0.0100766225,0.00019534418,0.0028966162,0.000052452422,0.06592352,0.65980303,0.07929966,0.16331194,0.0067323805],"about_ca_topic_score_codex":0.000011089343,"about_ca_topic_score_gemma":0.000070825845,"teacher_disagreement_score":0.95695215,"about_ca_system_score_codex":0.0002987859,"about_ca_system_score_gemma":0.00028692881,"threshold_uncertainty_score":0.9998387},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008066988,0.00037292478,0.9937556,0.000891008,0.0009137595,0.0005635906,0.000011732206,0.0002795925,0.0024050926],"genre_scores_gemma":[0.09007699,0.000017782899,0.9082697,0.0011093353,0.000282223,0.000014472682,0.00008594141,0.000018202632,0.00012534713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964262,0.00014744258,0.0007701658,0.001005369,0.0010162562,0.00063456857],"domain_scores_gemma":[0.9962909,0.0006267524,0.00045155804,0.0020710577,0.00040397458,0.00015572982],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011701724,0.00051831186,0.00054992276,0.0007596909,0.00049242686,0.0014102365,0.0041730828,0.0003153912,0.00000652677],"category_scores_gemma":[0.00012496019,0.0004874859,0.00008885021,0.0011073342,0.0016386088,0.0024526545,0.003580822,0.00093000237,0.000018734585],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003846624,0.000024189252,0.00043316575,0.00009605507,0.0000069274406,0.0000087472545,0.0010784,0.028597064,0.000005393998,0.017783059,0.00037215906,0.951591],"study_design_scores_gemma":[0.00021210723,0.00006577268,0.005326801,0.00007895374,0.0000035215505,0.00006179605,1.3216179e-7,0.6696757,0.00003515752,0.3228209,0.0012991492,0.0004199715],"about_ca_topic_score_codex":0.00023255534,"about_ca_topic_score_gemma":0.0002887732,"teacher_disagreement_score":0.95117104,"about_ca_system_score_codex":0.0007052469,"about_ca_system_score_gemma":0.00079049903,"threshold_uncertainty_score":0.9997577},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015509495,0.0024689117,0.9777925,0.00039087332,0.0018164327,0.001641806,0.000040012805,0.000117011296,0.00022297169],"genre_scores_gemma":[0.973616,0.0002621157,0.024970891,0.00015956185,0.00072988437,0.00008469553,3.8932774e-7,0.000049825594,0.0001266489],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99647826,0.000062424464,0.0005459298,0.0014517116,0.00084602844,0.00061564636],"domain_scores_gemma":[0.99456525,0.003684202,0.0004560374,0.0009502993,0.00024034863,0.00010388277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009924056,0.0005066689,0.0005602465,0.00033721366,0.00032448207,0.00021801172,0.002142536,0.00020769112,0.000010493579],"category_scores_gemma":[0.00017494701,0.00028863584,0.0001825167,0.00021143626,0.001478056,0.0003510123,0.0005852173,0.00040597454,0.0000041412545],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017729803,0.00016338886,0.00035744466,0.00038076358,0.00004571416,0.000026234282,0.005567847,0.01277219,0.13434309,0.0015250524,0.000008694632,0.84463227],"study_design_scores_gemma":[0.0009988856,0.0016358952,0.0007470768,0.0030003074,0.000034422763,0.000060847437,0.000008263175,0.045123447,0.9322713,0.014468806,0.0006205984,0.0010301209],"about_ca_topic_score_codex":0.000009327285,"about_ca_topic_score_gemma":0.000013935696,"teacher_disagreement_score":0.9581065,"about_ca_system_score_codex":0.00013205076,"about_ca_system_score_gemma":0.00022161275,"threshold_uncertainty_score":0.9999566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013086848,0.0002999984,0.99424225,0.00046003825,0.0011683236,0.00066868245,0.000015342774,0.0002881713,0.002844078],"genre_scores_gemma":[0.048709095,0.000053605818,0.94920325,0.00029648357,0.0011308201,0.000042899203,0.000003011864,0.0001038351,0.00045698247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980903,0.000019298157,0.00038664922,0.0005818254,0.0003624531,0.0005594268],"domain_scores_gemma":[0.997772,0.0013509805,0.00012509659,0.0005346992,0.00014256568,0.000074686235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012965361,0.00036037457,0.0003249783,0.00020964647,0.00025260565,0.00017802902,0.00088154786,0.00022865598,0.000024547806],"category_scores_gemma":[0.00013061144,0.00024976235,0.00010231127,0.00023018225,0.00038035336,0.00016375467,0.00016973335,0.00042745587,0.0000096667745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001543302,0.0000016829043,0.0000067693663,0.00002794585,0.0000107560545,0.000001704855,0.00020180138,0.38366315,0.000270456,0.0011953744,0.000004874364,0.61461395],"study_design_scores_gemma":[0.0002604456,0.000035014178,0.000017030286,0.0003448663,0.000011039247,0.00001253361,2.1513605e-7,0.9832648,0.0018018781,0.013042095,0.0008551163,0.00035497843],"about_ca_topic_score_codex":0.0000021468882,"about_ca_topic_score_gemma":0.0000060333587,"teacher_disagreement_score":0.61425894,"about_ca_system_score_codex":0.00021435042,"about_ca_system_score_gemma":0.00012880583,"threshold_uncertainty_score":0.99999547},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0127775,0.0013018165,0.9748376,0.0019241661,0.001601111,0.001271186,0.000031527696,0.000674927,0.0055801827],"genre_scores_gemma":[0.98150265,0.00026905266,0.016233377,0.00038965317,0.0007227705,0.000019417585,0.0000020263503,0.00006422846,0.0007968442],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957878,0.00006059185,0.00043641377,0.0015842404,0.0010355994,0.001095359],"domain_scores_gemma":[0.9973015,0.0013098866,0.0003147315,0.0006508318,0.00019061127,0.00023240478],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00082910573,0.0005924525,0.00057677453,0.0008664342,0.0006634143,0.00068500225,0.0014088348,0.00075941364,0.000049494214],"category_scores_gemma":[0.00048650423,0.00051172386,0.00011066038,0.00038557334,0.0039483104,0.0017549396,0.0007143682,0.00066319335,0.000028228324],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044827677,0.000027402113,0.0005602007,0.000053892585,0.000022962777,0.00007197649,0.016029589,0.000062649335,0.00005055126,0.007348346,0.000030185955,0.9756974],"study_design_scores_gemma":[0.013795938,0.0031700074,0.01403502,0.1039317,0.00037691157,0.0009914481,0.00095680496,0.043023847,0.008903503,0.756244,0.03189551,0.02267528],"about_ca_topic_score_codex":0.000107335225,"about_ca_topic_score_gemma":0.00050965726,"teacher_disagreement_score":0.96872514,"about_ca_system_score_codex":0.0004676336,"about_ca_system_score_gemma":0.00047485947,"threshold_uncertainty_score":0.99973345},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030730607,0.0010605643,0.98971844,0.0015421615,0.0022769745,0.00042205557,0.0000023007096,0.00010870766,0.0017957261],"genre_scores_gemma":[0.049650375,0.00023155194,0.9297026,0.014868396,0.0032175453,0.000008738166,0.00013658773,0.0001606637,0.00202359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603754,0.00014548548,0.0007231853,0.0011714564,0.0012553248,0.0006669893],"domain_scores_gemma":[0.99797714,0.00039731266,0.00028905077,0.00051813386,0.00030671683,0.0005116628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021528236,0.00046802303,0.0008507902,0.0006385671,0.00022161898,0.00026225115,0.00058192183,0.0004305204,0.00009151366],"category_scores_gemma":[0.0011160478,0.0004074828,0.0001361876,0.0008143832,0.0014640238,0.00013809917,0.00053484977,0.002203008,0.000015558106],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016120046,0.00013941892,0.0009059968,0.0004066404,0.000037790076,0.000624834,0.0002862371,0.00030225277,0.000093403854,0.00012176406,0.0025851745,0.9944804],"study_design_scores_gemma":[0.0019459139,0.00038717687,0.0026150786,0.004113395,0.00006417119,0.0023323507,5.7396215e-7,0.980617,0.00009804056,0.001878379,0.005424517,0.00052341225],"about_ca_topic_score_codex":0.000032587523,"about_ca_topic_score_gemma":0.000010531687,"teacher_disagreement_score":0.993957,"about_ca_system_score_codex":0.00038939674,"about_ca_system_score_gemma":0.001265924,"threshold_uncertainty_score":0.9998377},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025084363,0.0005590636,0.99429256,0.0005430856,0.0013762943,0.00017192903,7.0654175e-7,0.00004978448,0.0004981497],"genre_scores_gemma":[0.644547,0.000048784903,0.3509379,0.0012025664,0.002931192,0.000001247051,0.000008691583,0.00004669929,0.00027594448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984482,0.000017095921,0.00026646006,0.0005449986,0.00041551978,0.0003077361],"domain_scores_gemma":[0.9991681,0.00020029536,0.00018016687,0.00020169468,0.00011146194,0.0001382663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005247852,0.00020734286,0.0003026939,0.00030827016,0.00024222278,0.00008799725,0.00012660814,0.00019125637,0.00006004427],"category_scores_gemma":[0.00023661292,0.00017122221,0.000052795214,0.00010569473,0.00049998617,0.00016136252,0.00013349003,0.0007638937,0.000005400613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021921422,0.000015799402,0.011489925,0.00005858023,0.000020215852,0.00006518138,0.000075077296,0.20020263,0.00048084,0.00035132814,0.000012018428,0.7872065],"study_design_scores_gemma":[0.00033651138,0.00006824636,0.0019120296,0.0006977522,0.000029521643,0.00047250235,1.13320795e-7,0.98878276,0.000016266433,0.0070741945,0.00043302504,0.00017705101],"about_ca_topic_score_codex":0.000017445442,"about_ca_topic_score_gemma":0.000002543082,"teacher_disagreement_score":0.7885802,"about_ca_system_score_codex":0.00035508277,"about_ca_system_score_gemma":0.00015434189,"threshold_uncertainty_score":0.69822395},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000073496085,0.005179243,0.9920483,0.00011343072,0.00052333606,0.00022005581,0.000009031728,0.0005253084,0.0013739045],"genre_scores_gemma":[0.027424391,0.0016670726,0.96849483,0.0014255282,0.00078130775,0.000026187772,0.000035891408,0.000084398685,0.000060418075],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770224,0.000014958597,0.00049358205,0.00075367664,0.0004489874,0.0005865501],"domain_scores_gemma":[0.99898195,0.0001766516,0.000078765705,0.0006168738,0.00007172798,0.00007405668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038996103,0.00040658942,0.00040820282,0.00081005844,0.000064715125,0.00016781014,0.0014134118,0.00028052693,0.000009327202],"category_scores_gemma":[0.00011003369,0.00041424658,0.000040134444,0.0011049494,0.00041624377,0.0009620703,0.0002004424,0.0011150957,0.00001926022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019010284,0.00000828934,0.0000030239485,0.000038575232,5.15085e-7,0.000024643125,0.000074637865,0.323581,0.000047072037,0.00031313303,0.000086720276,0.67582047],"study_design_scores_gemma":[0.00002130525,0.000053150085,0.000007815805,0.000689479,0.0000016475691,0.000014996514,1.14382395e-7,0.40106115,0.009080082,0.580554,0.0080189435,0.00049729],"about_ca_topic_score_codex":0.0000026228704,"about_ca_topic_score_gemma":0.00014022953,"teacher_disagreement_score":0.6753232,"about_ca_system_score_codex":0.00053957436,"about_ca_system_score_gemma":0.0002836046,"threshold_uncertainty_score":0.99983096},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007429216,0.00053390395,0.9964399,0.0011436901,0.00026330675,0.001100796,0.000029368732,0.00016857998,0.00031304784],"genre_scores_gemma":[0.09281327,0.00032053902,0.9046748,0.0006911921,0.00029631818,0.00024221747,0.000013356223,0.000032999,0.00091529195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968495,0.00003147749,0.00036211667,0.0014978588,0.0005456733,0.0007134143],"domain_scores_gemma":[0.9978288,0.00028524295,0.0002010399,0.0012618175,0.00014075235,0.00028238312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006569525,0.00038435077,0.0003643115,0.00096212584,0.0005332062,0.00042434674,0.001978145,0.000110957946,0.000007790633],"category_scores_gemma":[0.000016955755,0.00032683637,0.0001773584,0.000749959,0.0003259042,0.0004690154,0.0010288192,0.00015213508,0.00001620963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001908583,0.00012896575,0.00007353518,0.00012810488,0.00043908902,0.00003202731,0.0003199551,0.0070699924,0.00036280023,0.23381226,0.00015821148,0.757456],"study_design_scores_gemma":[0.00074868335,0.00011283887,0.0005569912,0.00026229667,0.00031594798,0.0000044052576,1.1858579e-7,0.85865283,0.00013112949,0.13457274,0.0039064377,0.0007355895],"about_ca_topic_score_codex":0.0000025631984,"about_ca_topic_score_gemma":0.000020906875,"teacher_disagreement_score":0.8515828,"about_ca_system_score_codex":0.0004997203,"about_ca_system_score_gemma":0.0003433884,"threshold_uncertainty_score":0.99991834},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082677674,0.0003439849,0.9959253,0.00038998367,0.0004798386,0.00042367177,0.0000025483948,0.00056685234,0.0017851256],"genre_scores_gemma":[0.08607477,0.00017935925,0.91127837,0.0009072011,0.0007432894,0.00002218583,0.0000051990055,0.000029933351,0.00075967534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693775,0.00004853607,0.0004672708,0.0013758804,0.00057479995,0.00059578446],"domain_scores_gemma":[0.99770594,0.0004686903,0.0002996261,0.0011465149,0.00022909982,0.00015012328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008323765,0.00041038854,0.00043299087,0.00070237124,0.00044320978,0.00048535064,0.0026799284,0.0002472315,0.0000030752224],"category_scores_gemma":[0.000037642723,0.00034339546,0.00004947623,0.0008600923,0.00060757255,0.00051153795,0.0017142328,0.00049617275,0.0000248764],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010990793,0.000014474039,0.000084129475,0.00004351396,0.0000041520557,0.0000046746927,0.00013551848,0.030818556,0.000017724455,0.0074180295,0.0001042371,0.9613539],"study_design_scores_gemma":[0.0002623861,0.00011965759,0.0003278415,0.0005460268,0.0000046553732,0.0000721895,3.7068304e-8,0.92314804,0.0011511083,0.0703805,0.0032722345,0.0007153442],"about_ca_topic_score_codex":0.000005654608,"about_ca_topic_score_gemma":0.0000022353854,"teacher_disagreement_score":0.9606385,"about_ca_system_score_codex":0.00027919965,"about_ca_system_score_gemma":0.00063387724,"threshold_uncertainty_score":0.99990183},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006010612,0.0015936365,0.9946396,0.0002839754,0.0016803971,0.00049990887,0.00029297065,0.000101067984,0.0008483628],"genre_scores_gemma":[0.9706709,0.00037334516,0.026954213,0.00025062644,0.00082369015,0.000030486337,0.00011708468,0.000058525144,0.0007211399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962695,0.00010978298,0.00087468856,0.0012566709,0.00093181466,0.00055751204],"domain_scores_gemma":[0.99687105,0.0005047444,0.0005520871,0.0013166548,0.0005739216,0.00018154945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00118403,0.00041984406,0.0007848768,0.00037447416,0.00017238574,0.00037647743,0.0023186232,0.00031522685,0.00000363969],"category_scores_gemma":[0.00015969985,0.00032665342,0.00007657239,0.0010861912,0.0007813177,0.0006221318,0.0010199228,0.00033169877,0.000006024657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007857122,0.0003345606,0.0027411908,0.0028307792,0.00012277374,0.00018095186,0.004859437,0.09322177,0.00053979136,0.25546148,0.0024271242,0.63720155],"study_design_scores_gemma":[0.0010800664,0.0002703087,0.0007020514,0.0031163539,0.000014881511,0.00014156532,9.138252e-7,0.88575613,0.00042953048,0.07915586,0.028094446,0.0012379022],"about_ca_topic_score_codex":0.00003575559,"about_ca_topic_score_gemma":0.0000281948,"teacher_disagreement_score":0.9706108,"about_ca_system_score_codex":0.00037241954,"about_ca_system_score_gemma":0.0009647511,"threshold_uncertainty_score":0.9999186},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008493784,0.00013380194,0.9805883,0.00017424802,0.00024045748,0.00020945247,0.000008594309,0.00004794975,0.017747806],"genre_scores_gemma":[0.96876127,0.000007679358,0.030181747,0.00012852553,0.00047784502,0.000011713404,0.000015633663,0.000027057367,0.00038850904],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779296,0.000021972537,0.0004701001,0.0007696152,0.0005359823,0.00040939217],"domain_scores_gemma":[0.9987437,0.00032255935,0.00025634177,0.00049667095,0.000119439275,0.00006126408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006148973,0.00032182634,0.00038103768,0.0008437808,0.00012317303,0.0000899825,0.0006659376,0.00011281066,0.0003189308],"category_scores_gemma":[0.000008224617,0.0002743884,0.00018677297,0.0004696624,0.00035705135,0.00017731906,0.00032204716,0.00051340455,0.000018160828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005698582,0.00003630624,0.039380386,0.000008897379,0.00003118227,0.000010132401,0.00015097203,0.009181794,0.00007130372,0.444464,0.00006337141,0.50659597],"study_design_scores_gemma":[0.00016203432,0.00002396431,0.0020182983,0.00046889894,0.000010681248,0.0000016792798,9.851463e-8,0.033353824,0.00014016045,0.96145576,0.0019430816,0.00042151],"about_ca_topic_score_codex":0.00005441589,"about_ca_topic_score_gemma":0.00010804828,"teacher_disagreement_score":0.9679119,"about_ca_system_score_codex":0.00013975118,"about_ca_system_score_gemma":0.0001803595,"threshold_uncertainty_score":0.99997085},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005683392,0.00054611225,0.99401295,0.0022091838,0.001075642,0.0004012491,0.00007824938,0.000035761925,0.0010725135],"genre_scores_gemma":[0.6261738,0.00007340729,0.37194163,0.0013161076,0.00031891017,0.000006909939,0.000015158621,0.00002737005,0.00012670294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959684,0.00007223252,0.00093487155,0.0013144662,0.0011182999,0.0005917142],"domain_scores_gemma":[0.99543124,0.00097176456,0.00042518968,0.0026569162,0.00035642795,0.0001584611],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015639547,0.00045346247,0.0008328774,0.0005546005,0.00011346855,0.00016773475,0.0062887217,0.00027346317,0.000033266067],"category_scores_gemma":[0.00010572339,0.0003094337,0.00011271055,0.00072754256,0.00087251485,0.0006152273,0.004652021,0.0005052928,0.0000064175333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006597476,0.00005264407,0.00012520028,0.000095835094,0.00003251774,0.000096162395,0.0010442309,0.021178834,0.00029833333,0.011716094,0.0000554669,0.9652387],"study_design_scores_gemma":[0.00050330866,0.000114503506,0.0006943212,0.0013838799,0.000016255866,0.000060393824,0.0000017884164,0.9725661,0.00022575595,0.023718072,0.00018249555,0.00053308276],"about_ca_topic_score_codex":0.0001140852,"about_ca_topic_score_gemma":0.000054815588,"teacher_disagreement_score":0.96470565,"about_ca_system_score_codex":0.000098991775,"about_ca_system_score_gemma":0.00065157504,"threshold_uncertainty_score":0.99993575},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030835666,0.00009286041,0.9792666,0.00066398823,0.008295209,0.0003879727,0.000041594412,0.00011441188,0.010829039],"genre_scores_gemma":[0.7425702,0.000005733678,0.23901047,0.003357702,0.0012661447,0.000018791818,0.000030310104,0.00005357171,0.013687078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98677385,0.00012319592,0.0010451392,0.0030526638,0.007814647,0.0011905286],"domain_scores_gemma":[0.9922537,0.003321579,0.00046822513,0.0026902028,0.0008259041,0.00044039238],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.014941039,0.0005024863,0.00056835444,0.0040675593,0.001330138,0.0026172812,0.00711178,0.00017793398,0.000371699],"category_scores_gemma":[0.0012195137,0.00039652953,0.00019218348,0.006557678,0.0038075037,0.0011169047,0.0007075633,0.00088712474,0.0011865858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053847198,0.00007476191,0.000031168296,0.000004928789,0.000003346068,0.0000086002465,0.0004005152,0.38887143,0.000009207425,0.00078430446,0.0011442906,0.60866207],"study_design_scores_gemma":[0.00032595303,0.00015566635,0.0013874717,0.00021446284,0.000015845844,0.000040821305,0.0000026929697,0.7625665,0.0002468424,0.2098244,0.024429034,0.0007903001],"about_ca_topic_score_codex":0.00001621185,"about_ca_topic_score_gemma":0.000034347806,"teacher_disagreement_score":0.7422618,"about_ca_system_score_codex":0.00090820674,"about_ca_system_score_gemma":0.002574956,"threshold_uncertainty_score":0.99997},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012790448,0.00074408244,0.9938514,0.000021490623,0.0014050024,0.00017927232,0.000009521363,0.000042726177,0.0024674365],"genre_scores_gemma":[0.98965573,0.00003145755,0.009701786,0.00000419063,0.0001481503,0.0000036554707,0.000003870164,0.000015476237,0.00043565364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989329,0.000007780406,0.00037891956,0.00024320233,0.00031634988,0.0001208733],"domain_scores_gemma":[0.999069,0.00018902199,0.00017690193,0.00039133546,0.00014431661,0.000029434665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002806887,0.00014678732,0.00027266407,0.0007004258,0.000035561046,0.000024592751,0.00026644618,0.00013484021,0.000016469001],"category_scores_gemma":[0.00007564521,0.00011094505,0.00006327963,0.0002900706,0.0001504792,0.00014504686,0.00005103803,0.00012225889,0.00001253399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026658745,0.000006475358,0.000025258649,0.00013217525,0.000008739737,4.6432945e-7,0.0001138317,0.19269256,0.0054710684,0.0006988798,0.000038296388,0.80080956],"study_design_scores_gemma":[0.00020190963,0.00006080417,0.00082979095,0.0014728894,0.000018743633,0.000005040623,1.3171223e-7,0.96681625,0.009909842,0.020225817,0.0002311691,0.00022761458],"about_ca_topic_score_codex":0.000008336227,"about_ca_topic_score_gemma":0.000007797471,"teacher_disagreement_score":0.98837674,"about_ca_system_score_codex":0.000098057644,"about_ca_system_score_gemma":0.00004897394,"threshold_uncertainty_score":0.45242077},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025688365,0.00067942386,0.98981,0.0011289846,0.0017378869,0.0007756208,0.000043670592,0.00010134145,0.0054662125],"genre_scores_gemma":[0.5342914,0.000039310577,0.44121975,0.0062955245,0.0021097795,0.00011925241,0.0001005835,0.00009243411,0.015731964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98807895,0.00006165602,0.00095671485,0.003456083,0.0066075,0.00083911564],"domain_scores_gemma":[0.9932402,0.0021435698,0.0004705099,0.0019153947,0.0018580857,0.00037226515],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.012363724,0.00043101856,0.00050618936,0.0028590022,0.0012552879,0.0031202033,0.0059955693,0.00015565791,0.000051653933],"category_scores_gemma":[0.003148356,0.00035658287,0.000081281236,0.006885955,0.0036154399,0.00094641134,0.0034015481,0.0005709041,0.0002787237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000308103,0.000052028543,0.000039549734,0.000020992644,0.0000039416113,0.000014732887,0.0004448992,0.44488654,0.000023549945,0.009511872,0.0010517408,0.5439471],"study_design_scores_gemma":[0.00026302747,0.00005384833,0.0004862967,0.00014553398,0.000008121573,0.000045962133,0.0000014712075,0.54716766,0.00007695797,0.4135988,0.03768663,0.0004657031],"about_ca_topic_score_codex":0.000013789976,"about_ca_topic_score_gemma":0.00003282947,"teacher_disagreement_score":0.54859024,"about_ca_system_score_codex":0.0014814099,"about_ca_system_score_gemma":0.008869852,"threshold_uncertainty_score":0.9998886},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005954185,0.000048507154,0.99599427,0.00020785953,0.0007221326,0.0006035301,0.00001891751,0.00016456288,0.0016448197],"genre_scores_gemma":[0.24185257,0.000002555583,0.7575214,0.0003102009,0.00020835466,0.000011058302,0.0000018384621,0.000030773597,0.000061230756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962232,0.000052451156,0.0006313772,0.0014642304,0.0010654492,0.0005632873],"domain_scores_gemma":[0.9973991,0.00014319886,0.00044839818,0.0014020406,0.0003816762,0.00022560236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080072,0.00047847323,0.00056406774,0.0010014441,0.00018221434,0.0003282308,0.002546633,0.0002943397,0.0000046892756],"category_scores_gemma":[0.000033069693,0.0004095366,0.00010863989,0.00062448904,0.00042757826,0.0012230324,0.0005309045,0.0003595028,0.0000064930396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008191689,0.00003477766,0.000013676144,0.0000682033,0.000010223516,0.0000050831227,0.00091469084,0.44878638,0.0027493348,0.00961354,0.000002132774,0.53779376],"study_design_scores_gemma":[0.000207216,0.00012369358,0.000103940656,0.00041261982,0.000009832761,0.00009260028,2.8031693e-7,0.92026573,0.0011180213,0.07719771,0.000009989704,0.00045835055],"about_ca_topic_score_codex":0.000035513942,"about_ca_topic_score_gemma":0.000035397446,"teacher_disagreement_score":0.5373354,"about_ca_system_score_codex":0.0006978086,"about_ca_system_score_gemma":0.0007870427,"threshold_uncertainty_score":0.99983567},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013279824,0.00010340611,0.9958889,0.00090200186,0.00013869756,0.0009488313,0.000026041995,0.00008327175,0.0005808835],"genre_scores_gemma":[0.90165174,0.0003362948,0.09689962,0.0007196696,0.000118806085,0.00011803319,0.000033768632,0.00005502602,0.00006701592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625236,0.000101561505,0.0006117028,0.0017210995,0.0008289962,0.00048425747],"domain_scores_gemma":[0.99788535,0.00047310616,0.0003291993,0.0010367994,0.000096506534,0.00017906015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042689723,0.00045764228,0.00038174598,0.00043212046,0.00027658115,0.00038023145,0.00096630055,0.00018230143,0.000009435296],"category_scores_gemma":[0.000024376219,0.00036021514,0.000042770163,0.00045155102,0.0009088095,0.0008085296,0.00071775645,0.00053205393,0.000006721752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029393634,0.00020637325,0.000143464,0.000036649923,0.000014768852,0.00008472562,0.0027891782,0.3043243,0.0025733176,0.19812383,0.0000065541026,0.49166745],"study_design_scores_gemma":[0.0006773546,0.00039212426,0.000676254,0.00035379216,0.00000930671,0.00013457687,0.0000013175705,0.9145044,0.0014588302,0.08057123,0.00046662043,0.00075418135],"about_ca_topic_score_codex":0.000034455046,"about_ca_topic_score_gemma":0.00006279552,"teacher_disagreement_score":0.9003238,"about_ca_system_score_codex":0.0005155041,"about_ca_system_score_gemma":0.00019900572,"threshold_uncertainty_score":0.99988496},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010932825,0.035621982,0.75765985,0.00065391156,0.0037876347,0.00067222986,0.000312068,0.00018627993,0.19017322],"genre_scores_gemma":[0.9699382,0.000075616765,0.027413266,0.0004770477,0.00040738145,3.360476e-7,0.000062289706,0.0000066619045,0.0016191934],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986764,0.00011392833,0.00019631206,0.0003525945,0.00036210203,0.0002986555],"domain_scores_gemma":[0.9964084,0.0030689004,0.00013645626,0.00022544924,0.000059099395,0.00010171283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012488948,0.00018520333,0.00023824013,0.00011467996,0.000109310065,0.00028933355,0.000444661,0.00013237442,0.00010387868],"category_scores_gemma":[0.00058382365,0.0001309525,0.000033631208,0.00025883812,0.0009762716,0.0012945993,0.00008269617,0.00028991685,0.000023547564],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054150947,0.000012242166,0.016212802,0.00006143316,0.000009516507,0.000014327818,0.0017073753,0.001062495,0.0000049882333,0.00061956455,0.00006994724,0.98017114],"study_design_scores_gemma":[0.0011443985,0.0017518778,0.15857145,0.0017589342,0.00015848312,0.0013626242,0.00006185352,0.026654422,0.00077102735,0.7324139,0.071438074,0.003912982],"about_ca_topic_score_codex":0.00002788762,"about_ca_topic_score_gemma":0.000045235636,"teacher_disagreement_score":0.97625816,"about_ca_system_score_codex":0.00000660788,"about_ca_system_score_gemma":0.00022156061,"threshold_uncertainty_score":0.5340088},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017417047,0.0005304881,0.97942305,0.00015308941,0.001508563,0.0002476077,0.0000070578826,0.00018912167,0.017923592],"genre_scores_gemma":[0.08219303,0.000038790633,0.91339797,0.0027022446,0.0006946518,0.0000147705705,0.000025001118,0.000028731994,0.00090483297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561334,0.00006213708,0.00055512186,0.0017021698,0.0009828924,0.0010843218],"domain_scores_gemma":[0.996965,0.00026790574,0.00032187696,0.002011772,0.00019879553,0.000234659],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00088718097,0.00053415826,0.0007789673,0.0014859672,0.00030877182,0.0006359052,0.0060041696,0.00037138772,0.000055381715],"category_scores_gemma":[0.00004169268,0.00043760837,0.00034186392,0.0035709525,0.00079475757,0.0011144124,0.0021415432,0.00078010664,0.00007451661],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033144643,0.00004931271,0.0001296256,0.000016041253,0.00008722867,0.00012334033,0.0019746742,0.026511185,0.0000029061796,0.009808206,0.00028203757,0.9610121],"study_design_scores_gemma":[0.00025895835,0.00024076659,0.0007558228,0.000069791946,0.0000811334,0.00003887358,1.521126e-7,0.88267595,0.0001948539,0.111139484,0.0036095625,0.00093464146],"about_ca_topic_score_codex":0.00005126827,"about_ca_topic_score_gemma":0.00008528797,"teacher_disagreement_score":0.96007746,"about_ca_system_score_codex":0.00031437626,"about_ca_system_score_gemma":0.0010009279,"threshold_uncertainty_score":0.9998076},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025673961,0.00027099304,0.95418304,0.0016744124,0.0008436876,0.0013427597,0.0000037663776,0.00011669837,0.015890706],"genre_scores_gemma":[0.98612344,0.000036783385,0.012361659,0.00059984,0.00022481968,0.000009526268,0.000012783354,0.00002348846,0.0006076527],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9981245,0.000021630805,0.00038933722,0.000689363,0.00046271435,0.00031247525],"domain_scores_gemma":[0.9988226,0.0004205413,0.00014926399,0.0003529742,0.0001451305,0.0001094614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033157427,0.00024588883,0.00036021852,0.0005819956,0.000050927832,0.000055794248,0.00020600807,0.00020865633,0.00013441805],"category_scores_gemma":[0.00016973757,0.0001863691,0.00006118689,0.0002540097,0.00029115044,0.00013782717,0.00008266069,0.00037006813,0.00006581027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086081796,0.000059088925,0.0075863013,0.00022126384,0.000009728342,0.00017556637,0.00063360896,0.0066253366,0.00048063046,0.0011414886,0.000001048804,0.98297983],"study_design_scores_gemma":[0.02766384,0.0028720454,0.4492318,0.02271803,0.00021675344,0.00034281504,0.0000057707102,0.29052547,0.01493658,0.18384705,0.003836916,0.003802921],"about_ca_topic_score_codex":0.0000046415694,"about_ca_topic_score_gemma":0.00004144426,"teacher_disagreement_score":0.97917694,"about_ca_system_score_codex":0.00030129065,"about_ca_system_score_gemma":0.0002721131,"threshold_uncertainty_score":0.7599911},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018459728,0.00076213176,0.9705672,0.00016557539,0.0005239455,0.0005431977,0.0001916283,0.000011597846,0.025388744],"genre_scores_gemma":[0.585179,0.0014816808,0.4116462,0.00033453645,0.00049734884,0.000047276637,0.000036321926,0.00007727038,0.0007004203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987283,0.0000032063192,0.00059688283,0.00041900825,0.000042987478,0.00020962831],"domain_scores_gemma":[0.9983596,0.00047434773,0.00076433184,0.00026484553,0.000100012556,0.000036843037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009523055,0.00017674142,0.00046990722,0.00047375227,0.00007379149,0.000046222514,0.0002682265,0.00021281521,0.000014232688],"category_scores_gemma":[0.00013240469,0.00017845267,0.00010582361,0.00006013633,0.00029676224,0.00028552098,0.000078412784,0.00008400292,0.0000012172551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024359689,0.000037920832,0.0004926998,0.0015510432,0.00003565989,4.6171203e-7,0.0008270537,0.00049667683,0.00018356644,0.65413356,0.00033417673,0.3416636],"study_design_scores_gemma":[0.00045508667,0.00015732156,0.0004978223,0.00030879778,0.000008183952,0.0000050656286,3.562591e-7,0.016399227,0.0009679149,0.9771972,0.0037217007,0.000281375],"about_ca_topic_score_codex":0.0000039556726,"about_ca_topic_score_gemma":0.000013084409,"teacher_disagreement_score":0.58333296,"about_ca_system_score_codex":0.00010421748,"about_ca_system_score_gemma":0.000056565164,"threshold_uncertainty_score":0.7277088},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035035253,0.00021416228,0.99065256,0.0012765934,0.0021339708,0.0021894714,0.000018565179,0.0003356459,0.0031439688],"genre_scores_gemma":[0.26452008,0.000028456949,0.7293752,0.0024958071,0.0018643523,0.0003630476,0.000011757976,0.00009982049,0.0012415053],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946321,0.00004991661,0.00086081674,0.0023156481,0.001265533,0.0008759778],"domain_scores_gemma":[0.9956847,0.00065523596,0.0007820464,0.0022676834,0.00034035125,0.00027000427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078020716,0.0006699139,0.0006312512,0.0005759905,0.0003225273,0.0005594849,0.0049425126,0.00040179168,0.00011119549],"category_scores_gemma":[0.00020757901,0.000561153,0.00016880316,0.00048501234,0.00067565916,0.0012570255,0.0022516614,0.00083089806,0.0002496867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059256577,0.000032581975,0.000050947325,0.000028579105,0.000014116635,0.00009263649,0.0018019823,0.0020768219,0.00066350395,0.2179101,0.0000086162445,0.7773142],"study_design_scores_gemma":[0.00030288688,0.00007329509,0.00004413123,0.00066568766,0.000004639906,0.000019514462,1.3052647e-7,0.086124435,0.006012997,0.90396804,0.0020505898,0.0007336479],"about_ca_topic_score_codex":0.000008924523,"about_ca_topic_score_gemma":0.000019301382,"teacher_disagreement_score":0.7765806,"about_ca_system_score_codex":0.00037873856,"about_ca_system_score_gemma":0.0005213151,"threshold_uncertainty_score":0.999684},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001087771,0.00026388137,0.99233973,0.00007452496,0.004024609,0.00021104274,0.0000064184997,0.00035557957,0.0026154432],"genre_scores_gemma":[0.61048144,0.00022781084,0.3750988,0.0010233368,0.009347231,0.000050850464,0.00008038666,0.00034527117,0.0033448767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983413,0.00001681726,0.000342599,0.0005140416,0.00039060347,0.00039460819],"domain_scores_gemma":[0.999023,0.0001417611,0.000073654104,0.00060473464,0.00007619177,0.000080612685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000288302,0.0002964609,0.00032552,0.0003497449,0.00007207232,0.00018797189,0.0007676764,0.00025296092,0.000013441067],"category_scores_gemma":[0.000010370153,0.00023766332,0.00006022088,0.00030405025,0.00017742113,0.00014603973,0.00011436148,0.00030414312,0.00014479003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.500481e-7,0.0000059554773,0.000013510028,0.00010286921,0.00001068553,0.00001610254,0.00017764624,0.66230553,0.00091704755,0.000222281,0.0012673154,0.33496028],"study_design_scores_gemma":[0.00013761167,0.00002887457,0.00013944923,0.00057731924,0.0000037580621,0.000017596089,2.1381167e-8,0.98830736,0.0011660847,0.003881207,0.005363782,0.0003769645],"about_ca_topic_score_codex":0.0000022489132,"about_ca_topic_score_gemma":0.0000041086228,"teacher_disagreement_score":0.61724097,"about_ca_system_score_codex":0.00037363026,"about_ca_system_score_gemma":0.00017081737,"threshold_uncertainty_score":0.96916294},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002611122,0.00056961057,0.9890444,0.0013700039,0.00082947925,0.00024819042,0.0000013755606,0.00013383944,0.0051919497],"genre_scores_gemma":[0.6507266,0.00006891078,0.34779617,0.00061907194,0.00036918325,0.000010864434,0.0000012662923,0.000025164263,0.00038273414],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970253,0.000034275978,0.0004607645,0.0013829479,0.0005228728,0.00057380024],"domain_scores_gemma":[0.99801695,0.0007076917,0.00022100634,0.00084377563,0.000113270406,0.00009730688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087172206,0.00037558665,0.00041576568,0.00076909794,0.00015409039,0.00039194795,0.0017914787,0.00026746135,0.000006566251],"category_scores_gemma":[0.00021723601,0.00029953566,0.000052341635,0.00038812938,0.00065813673,0.00060435117,0.0009754449,0.0004269073,0.000023751169],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063447274,0.000014832824,0.0016197453,0.000032963955,0.0000034773204,0.00010377333,0.00081566186,0.00034359287,0.0003333076,0.03625548,0.000006022745,0.9604648],"study_design_scores_gemma":[0.0010683041,0.00039363132,0.030077407,0.0017054183,0.000012885394,0.00054978096,0.0000018977513,0.34873396,0.002975467,0.6113736,0.0012642585,0.0018434142],"about_ca_topic_score_codex":0.0000324805,"about_ca_topic_score_gemma":0.00016668299,"teacher_disagreement_score":0.9586214,"about_ca_system_score_codex":0.00017233113,"about_ca_system_score_gemma":0.00031994758,"threshold_uncertainty_score":0.9999457},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056451457,0.00012804237,0.9916032,0.000030624586,0.0012328178,0.0002235021,0.000028779608,0.00054144923,0.000566466],"genre_scores_gemma":[0.27458665,0.0007090166,0.7215895,0.0007931482,0.0012479433,0.000040403705,0.00011924864,0.0002579951,0.0006560962],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882156,0.000005129029,0.00025912758,0.0004122928,0.00021831247,0.0002836001],"domain_scores_gemma":[0.9993689,0.00008962927,0.00007212717,0.00035064504,0.000044894663,0.000073826865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019690242,0.00029011027,0.0002760598,0.0002769448,0.000051824478,0.00017990549,0.00044070595,0.00020697723,0.000029164456],"category_scores_gemma":[0.000027429458,0.00027644366,0.000020386993,0.00014669745,0.00026160918,0.0002687123,0.00018081008,0.0005596205,0.0000073805563],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037171847,0.000008631621,0.00003551672,0.000293129,0.000006164978,0.000038161867,0.00028536335,0.03269334,0.23810399,0.000056410874,0.00009417901,0.7283814],"study_design_scores_gemma":[0.0005743777,0.0001310759,0.0067215324,0.0012338575,0.000016865066,0.00015664473,6.191018e-8,0.34624732,0.37921944,0.23242539,0.030159513,0.0031139425],"about_ca_topic_score_codex":0.0000043223095,"about_ca_topic_score_gemma":0.00002839901,"teacher_disagreement_score":0.72526747,"about_ca_system_score_codex":0.00010087905,"about_ca_system_score_gemma":0.00008899319,"threshold_uncertainty_score":0.99996877},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003870694,0.014510961,0.8288992,0.00070651004,0.0068536075,0.0008274346,0.000009797288,0.00013679107,0.14766863],"genre_scores_gemma":[0.831836,0.0065756184,0.139806,0.0031026562,0.012975952,0.00013800368,0.00004832276,0.00019039126,0.0053270655],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99510247,0.0003109002,0.0005941154,0.001112526,0.0011969359,0.0016830765],"domain_scores_gemma":[0.9975763,0.000957646,0.00029041554,0.0006252286,0.000268984,0.00028145016],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0023189774,0.00049523165,0.0006729297,0.0010293088,0.00043735543,0.00024184461,0.0025584076,0.00079451385,0.00049242465],"category_scores_gemma":[0.00036112295,0.00046719043,0.00015019397,0.0016657247,0.0034156085,0.0014511023,0.0004385304,0.0013182323,0.00024284491],"study_design_candidate":"theoretical_or_conceptual","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.000026111105,0.00017990559,0.0034802207,0.00008803306,0.000008968368,0.00011282405,0.020916091,0.010238881,0.000018695957,0.13911733,0.000514729,0.8252982],"study_design_scores_gemma":[0.00025730822,0.00021505941,0.000897191,0.00045892264,0.000014469757,0.000027421354,0.000016608823,0.0036131297,0.00019770644,0.80021477,0.19267593,0.0014114649],"about_ca_topic_score_codex":0.00070492143,"about_ca_topic_score_gemma":0.020893337,"teacher_disagreement_score":0.8314489,"about_ca_system_score_codex":0.0013539144,"about_ca_system_score_gemma":0.003165938,"threshold_uncertainty_score":0.999778},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012535469,0.000497906,0.99370855,0.00010346096,0.00036070406,0.00054375397,0.000020959433,0.00003831993,0.003472789],"genre_scores_gemma":[0.31330496,0.000007610266,0.6844007,0.0006079041,0.00075526384,0.000027193819,0.0000022709103,0.000028569824,0.00086557027],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99405634,0.00032639125,0.0012667405,0.0016469237,0.0023000988,0.00040351966],"domain_scores_gemma":[0.9715898,0.024954572,0.0006891335,0.0017813507,0.00084309396,0.00014202186],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0135471,0.00032598356,0.00067425217,0.0011826783,0.00023306135,0.0004853245,0.0027001314,0.00024407529,0.00011153303],"category_scores_gemma":[0.01340624,0.00025084836,0.00008746221,0.0022319013,0.0018665955,0.00035610606,0.0014540378,0.0005266342,0.000031973577],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063899797,0.000019410267,0.0012890022,0.000014012642,0.000001827992,0.0000021499247,0.00033686135,0.006006017,0.00017059514,0.0015084564,0.00004065268,0.99060464],"study_design_scores_gemma":[0.00017987206,0.000052223146,0.0065136417,0.00020761468,0.000007638667,0.000032252065,0.0000014986659,0.10114461,0.00027590626,0.8870474,0.004188777,0.00034857067],"about_ca_topic_score_codex":0.000009696531,"about_ca_topic_score_gemma":0.000051725598,"teacher_disagreement_score":0.9902561,"about_ca_system_score_codex":0.00019144516,"about_ca_system_score_gemma":0.00085586385,"threshold_uncertainty_score":0.9999944},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006451863,0.0037723144,0.98613256,0.000096746284,0.0039836727,0.00037900553,0.000001906902,0.0002621157,0.005307186],"genre_scores_gemma":[0.42190608,0.0006729686,0.56436896,0.0029961788,0.003896948,0.000059760612,0.000015612777,0.00014655823,0.0059369286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634975,0.00009213602,0.0005003861,0.0017071784,0.00057730154,0.0007732332],"domain_scores_gemma":[0.9974842,0.00064839254,0.00026192894,0.0010985537,0.0002645876,0.00024231814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011415817,0.0005139918,0.0005651464,0.00071218977,0.000259973,0.00080902537,0.0027515586,0.00031863226,0.0000044484505],"category_scores_gemma":[0.0000772357,0.0004680005,0.000085923886,0.0007990397,0.0006725288,0.00031856075,0.0024179937,0.00090262515,0.000042812044],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002343746,0.000025413516,0.00004594727,0.00004855117,0.000010161379,0.00007996539,0.0009417234,0.007277888,0.0000039788315,0.004435248,0.00015944816,0.98696935],"study_design_scores_gemma":[0.00016424379,0.0002219889,0.00015145564,0.0008354491,0.000009592479,0.00022968656,2.1117994e-7,0.9494599,0.00018566725,0.040670894,0.007298643,0.0007722573],"about_ca_topic_score_codex":0.000042166674,"about_ca_topic_score_gemma":0.000021163592,"teacher_disagreement_score":0.98619705,"about_ca_system_score_codex":0.00033879557,"about_ca_system_score_gemma":0.0009305104,"threshold_uncertainty_score":0.9997772},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002011856,0.0015308411,0.99038404,0.0008958444,0.0021201014,0.00079266203,0.000002121279,0.00037585653,0.0036973457],"genre_scores_gemma":[0.04298194,0.00020576589,0.9429553,0.008127119,0.0033122113,0.000027561948,0.00001243751,0.00009009263,0.0022875345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99373275,0.00012828028,0.00076153013,0.0025296912,0.0013633614,0.0014843929],"domain_scores_gemma":[0.9963027,0.0006806904,0.0004357923,0.0020647272,0.00015258559,0.00036350032],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018017663,0.0007761911,0.0007445689,0.0010497776,0.00041752745,0.0012040582,0.004685143,0.0003304701,0.000023405133],"category_scores_gemma":[0.00006338029,0.00075971446,0.00013016726,0.0012413008,0.00056532916,0.00069939275,0.0043554325,0.0010275436,0.00006995893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000285949,0.000033767294,0.00002320586,0.0000612364,0.000014627425,0.00014276958,0.00052296114,0.15736055,0.000020775777,0.001769512,0.0021830385,0.8378647],"study_design_scores_gemma":[0.00041533064,0.00013340321,0.00012875233,0.00041665477,0.000014138837,0.00008604891,2.6162965e-7,0.9652918,0.00024733716,0.01036775,0.021998977,0.00089955155],"about_ca_topic_score_codex":0.000015854723,"about_ca_topic_score_gemma":0.00012379093,"teacher_disagreement_score":0.83696514,"about_ca_system_score_codex":0.001056653,"about_ca_system_score_gemma":0.0011132269,"threshold_uncertainty_score":0.9998328},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06324809,0.00015478482,0.92951053,0.0028652682,0.0010806599,0.0006119269,0.0000106962025,0.000027391352,0.0024906332],"genre_scores_gemma":[0.9915637,0.000007065973,0.007573488,0.00022007975,0.00039592825,0.000033191234,0.0000026928014,0.00001742951,0.00018643819],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99795634,0.000070396665,0.00035772214,0.0008314152,0.0004271493,0.00035697338],"domain_scores_gemma":[0.99212235,0.006876631,0.00022022991,0.00051953935,0.00018417815,0.000077067496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013836338,0.00022152477,0.00020361994,0.0009389807,0.0004765719,0.0001876745,0.0008410746,0.00010118701,0.000025302894],"category_scores_gemma":[0.0005701014,0.00016108036,0.000030363512,0.00068003713,0.0011659692,0.00062871404,0.00039051787,0.00046870913,0.000023232045],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023969118,0.000033934677,0.06538856,0.000013907874,0.000016580585,0.000005522631,0.03212219,0.012730307,0.00035989677,0.21582301,0.0000058716096,0.6734763],"study_design_scores_gemma":[0.00023251827,0.00007276202,0.65101767,0.00053138664,0.000013516418,0.000015450942,0.000021420441,0.00460057,0.00018618962,0.3427382,0.00019329831,0.00037699405],"about_ca_topic_score_codex":0.0000399595,"about_ca_topic_score_gemma":0.00004653737,"teacher_disagreement_score":0.9283156,"about_ca_system_score_codex":0.00048064874,"about_ca_system_score_gemma":0.00034168767,"threshold_uncertainty_score":0.65686667},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026888587,0.0001150717,0.99371666,0.00047801057,0.0027516992,0.0005612113,0.00000548527,0.00026129268,0.0020837022],"genre_scores_gemma":[0.04797611,0.00001016328,0.9500322,0.0010106185,0.0004340429,0.000024978552,0.0000049120954,0.00004608005,0.00046094364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963744,0.000111587615,0.0005432792,0.0015505842,0.0006619251,0.00075820537],"domain_scores_gemma":[0.9960989,0.0017746618,0.00045467308,0.0012248469,0.00028609255,0.00016083448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028792592,0.00050033483,0.00048308604,0.000749945,0.0004809752,0.0005222857,0.0030551245,0.00029948927,0.000016601369],"category_scores_gemma":[0.0008630684,0.0004262063,0.00017864181,0.00039233812,0.00054319005,0.000789654,0.00058539637,0.00071423716,0.00004994408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015724941,0.000010270176,0.000020841924,0.00007850462,0.00000820318,0.000011345128,0.0003981867,0.049770307,0.0005361092,0.044881172,0.000009485648,0.90425986],"study_design_scores_gemma":[0.0004002025,0.00023953196,0.00007520065,0.00039388603,0.000009086832,0.000011927167,8.637917e-8,0.8792271,0.0029350284,0.1131229,0.0029814688,0.00060355326],"about_ca_topic_score_codex":0.0000032865516,"about_ca_topic_score_gemma":0.0000060855,"teacher_disagreement_score":0.9036563,"about_ca_system_score_codex":0.0003944221,"about_ca_system_score_gemma":0.0005621945,"threshold_uncertainty_score":0.999819},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019111503,0.00043423095,0.9924642,0.00046730327,0.0022073016,0.0002326647,0.0000012550327,0.00025941874,0.0037425142],"genre_scores_gemma":[0.18790472,0.00014151708,0.79921913,0.0045355367,0.002893712,0.000056458,0.000050553128,0.00009179494,0.005106571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657834,0.00010644845,0.00039777797,0.0011030014,0.00093801285,0.0008764382],"domain_scores_gemma":[0.9981122,0.0003826626,0.00018806606,0.00089095446,0.00018363686,0.00024245011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009791417,0.00040375386,0.00040271704,0.00058146275,0.00031768595,0.0005857889,0.002678744,0.0003369451,0.00006263584],"category_scores_gemma":[0.00012227509,0.00035748727,0.00011927666,0.000839145,0.00030197448,0.001111621,0.00126456,0.0010420223,0.00035384382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036937545,0.000043865744,0.00020979016,0.000042085478,0.0000058921482,0.000034398978,0.0012443366,0.01799868,0.00059938245,0.0005176597,0.00047379793,0.9788264],"study_design_scores_gemma":[0.00054539763,0.00024226475,0.00037325392,0.0008352514,0.000014015518,0.00007641083,4.3741272e-7,0.9147587,0.007910775,0.0467617,0.027129998,0.0013518038],"about_ca_topic_score_codex":0.000010689425,"about_ca_topic_score_gemma":0.000019445195,"teacher_disagreement_score":0.97747463,"about_ca_system_score_codex":0.00023221849,"about_ca_system_score_gemma":0.00086593104,"threshold_uncertainty_score":0.9998877},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054394895,0.00032954963,0.97218364,0.00071005296,0.0065663313,0.00025229575,0.000015718027,0.000098369506,0.019789625],"genre_scores_gemma":[0.40573138,0.00041287873,0.27441654,0.08704696,0.20887439,0.00007607465,0.012646964,0.00072376453,0.010071044],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962247,0.0000091657785,0.0004773636,0.0016539362,0.0008701714,0.00076469063],"domain_scores_gemma":[0.9965544,0.0002628617,0.00038936708,0.00248707,0.00027688956,0.000029447856],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001454069,0.00048928085,0.00049551914,0.00093041494,0.0002929464,0.0010929873,0.005531163,0.00028261938,0.00020187035],"category_scores_gemma":[0.00054561836,0.00042558258,0.00005779947,0.0013726405,0.0006104065,0.0020382572,0.004810384,0.00072871184,0.00025688842],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006061958,0.000025926782,0.00032905847,0.00029231192,0.000005709476,0.000024325927,0.000016630493,0.0045001823,0.000026704418,0.0005816045,0.015201359,0.97899014],"study_design_scores_gemma":[0.00013486108,0.000011068908,0.00022472112,0.0008709765,0.000030990308,0.000013897174,1.9389772e-7,0.32446334,0.000058383153,0.040729426,0.632658,0.00080412277],"about_ca_topic_score_codex":0.00017429155,"about_ca_topic_score_gemma":0.0009803728,"teacher_disagreement_score":0.978186,"about_ca_system_score_codex":0.00014301708,"about_ca_system_score_gemma":0.00046209112,"threshold_uncertainty_score":0.999944},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018717644,0.00028274732,0.9843233,0.000033670793,0.002595776,0.00033590707,0.0000025360541,0.00030754003,0.0119313365],"genre_scores_gemma":[0.88308936,0.000036751382,0.1087495,0.0010322034,0.004666634,0.000021875465,0.000073392024,0.00013835731,0.0021919357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806654,0.0000216542,0.0004413957,0.0005318948,0.00052445184,0.00041406078],"domain_scores_gemma":[0.9988761,0.00022510994,0.00008741862,0.0005964937,0.000108057044,0.000106805666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005249939,0.00031307052,0.00036191504,0.0005288435,0.00007630092,0.00024221312,0.00065588026,0.0002938146,0.000024819417],"category_scores_gemma":[0.000014554955,0.00030292885,0.00008074221,0.00050103565,0.00016818219,0.00021279675,0.000072921204,0.00043485544,0.00012847318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022718345,0.000004904135,0.000025330342,0.000043516473,0.0000069981024,0.000008282918,0.00015668999,0.6839464,0.0001664175,0.00013739312,0.00024467323,0.31525713],"study_design_scores_gemma":[0.00024548202,0.000029054396,0.000667603,0.0001654739,0.000004608429,0.000009553944,7.247361e-8,0.9883357,0.00024286783,0.0017759547,0.00818529,0.0003382897],"about_ca_topic_score_codex":0.000008926444,"about_ca_topic_score_gemma":0.00001759574,"teacher_disagreement_score":0.8829022,"about_ca_system_score_codex":0.0004278743,"about_ca_system_score_gemma":0.00015857682,"threshold_uncertainty_score":0.9999423},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005591893,0.0032275326,0.98985714,0.00046954953,0.0021587564,0.00021628937,0.0000038677904,0.00014152289,0.0033661625],"genre_scores_gemma":[0.21946669,0.00072148116,0.7765946,0.0018705766,0.0010354738,0.000011485449,0.000028539036,0.000059301805,0.00021189688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99550474,0.0000930571,0.0006246566,0.0019193478,0.0008868041,0.00097142],"domain_scores_gemma":[0.99797696,0.00038491611,0.00026058007,0.0010886583,0.000091030015,0.00019788399],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077972346,0.00058288366,0.00069338933,0.0015380994,0.00028210098,0.0005373117,0.0028888392,0.00028357387,0.0000032953596],"category_scores_gemma":[0.00004122556,0.00051376666,0.00010284611,0.0022412008,0.0006839744,0.0006020572,0.0021207477,0.0012154812,0.00001223813],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017505166,0.000043628595,0.00035165614,0.00002602514,0.0000024191718,0.00014522785,0.0013632461,0.0119899,0.0000011444025,0.00081826333,0.00024873088,0.985008],"study_design_scores_gemma":[0.00045750718,0.00014164692,0.0049295044,0.0004393615,0.0000030486624,0.00023148837,1.2118788e-7,0.9633621,0.000015205276,0.02586932,0.003785724,0.0007649849],"about_ca_topic_score_codex":0.000035647357,"about_ca_topic_score_gemma":0.00007725758,"teacher_disagreement_score":0.98424304,"about_ca_system_score_codex":0.00042969867,"about_ca_system_score_gemma":0.0005910804,"threshold_uncertainty_score":0.9997314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011538349,0.00021049536,0.99317455,0.0021397395,0.00033719608,0.000855922,0.0000062166955,0.0001621142,0.0019599572],"genre_scores_gemma":[0.659387,0.00022407547,0.33855954,0.0012236554,0.00019558758,0.000049121136,0.000002766404,0.000041764175,0.0003164781],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745226,0.00055797806,0.00036019445,0.0007451536,0.00033312326,0.00055129424],"domain_scores_gemma":[0.9969017,0.0017125318,0.00021415524,0.00085573975,0.0002037816,0.000112123314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003123022,0.0003414595,0.00041416322,0.00060406857,0.0005332183,0.00012647109,0.0016956312,0.00061543484,0.000012987047],"category_scores_gemma":[0.000448865,0.00026715462,0.000050489605,0.0004149243,0.0025312984,0.0002934042,0.0006023002,0.001062767,0.000009877824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008765115,0.000033622357,0.00078102923,0.000015891797,0.0000061739515,0.0000030593203,0.012502917,0.00006701215,0.000344559,0.013476906,0.000011348451,0.9727487],"study_design_scores_gemma":[0.0014177203,0.00018383762,0.0062589734,0.0015286191,0.000015752525,0.00002088412,0.000058615595,0.01076193,0.005949992,0.9651696,0.007213521,0.0014205214],"about_ca_topic_score_codex":0.00064914365,"about_ca_topic_score_gemma":0.0076044733,"teacher_disagreement_score":0.9713282,"about_ca_system_score_codex":0.00035848326,"about_ca_system_score_gemma":0.00029393073,"threshold_uncertainty_score":0.99997807},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025073278,0.00049007055,0.9923497,0.0004975269,0.00075184944,0.00042686303,0.0000212222,0.0001185652,0.0028368863],"genre_scores_gemma":[0.897546,0.000645039,0.097625375,0.002282767,0.0005374343,0.00006986916,0.000058495498,0.00008851453,0.0011465285],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670476,0.00005586897,0.0005328312,0.0014672597,0.0006683767,0.00057092926],"domain_scores_gemma":[0.9983881,0.00034827017,0.00025554164,0.0005983096,0.00023033592,0.00017943043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006803131,0.00043953987,0.0004893379,0.0009818175,0.00019118338,0.00039315104,0.001167418,0.0003080647,0.000024483668],"category_scores_gemma":[0.00023622173,0.00036125083,0.000065321234,0.0005063032,0.0004894444,0.000608725,0.00042690168,0.00056458643,0.000036558507],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002772713,0.0000589763,0.00017124336,0.00015791104,0.000010936091,0.00011864469,0.0040740585,0.00057174684,0.0009238336,0.0010137443,0.00010179552,0.99276936],"study_design_scores_gemma":[0.0017017431,0.0003952087,0.00014488556,0.0050119283,0.000024808409,0.000085420514,0.0000023483783,0.18972547,0.0060008205,0.79301864,0.002045385,0.0018433371],"about_ca_topic_score_codex":0.00002418605,"about_ca_topic_score_gemma":0.00006492957,"teacher_disagreement_score":0.990926,"about_ca_system_score_codex":0.00019766059,"about_ca_system_score_gemma":0.00025038156,"threshold_uncertainty_score":0.99988395},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008709445,0.0005418055,0.98372895,0.002854422,0.0021402647,0.00044247924,0.00017102816,0.000108095126,0.009925847],"genre_scores_gemma":[0.07925711,0.0005026052,0.89699924,0.0050519397,0.0066531934,0.00008956078,0.0011632266,0.000105679595,0.010177431],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934953,0.000046325633,0.0008525438,0.0026637034,0.002268456,0.0006737152],"domain_scores_gemma":[0.989029,0.0021922998,0.00046499856,0.00783459,0.000333923,0.00014520026],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0031038083,0.00039277688,0.0005530333,0.001086699,0.0003847372,0.0016702223,0.019209225,0.0004687006,0.00035082607],"category_scores_gemma":[0.002327959,0.0002833227,0.00007523939,0.0026692483,0.001567051,0.0007833193,0.010023615,0.0010924544,0.0006431459],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.6296866e-7,0.000014669683,0.000056901506,0.0000038875337,0.0000024513397,0.000006849042,0.00003940011,0.00060945115,0.000025013092,0.00065769115,0.047091596,0.9514914],"study_design_scores_gemma":[0.00010622701,0.000038530834,0.00038864615,0.000116937765,0.00000626084,0.000025805448,0.0000015801094,0.094033375,0.000177496,0.47941768,0.42517245,0.0005150259],"about_ca_topic_score_codex":0.00005505683,"about_ca_topic_score_gemma":0.0002396814,"teacher_disagreement_score":0.9509764,"about_ca_system_score_codex":0.00022066459,"about_ca_system_score_gemma":0.0009847508,"threshold_uncertainty_score":0.9999619},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000288722,0.00031379767,0.994642,0.00029171284,0.0007543841,0.00048122343,0.000008928774,0.00010396993,0.0031152193],"genre_scores_gemma":[0.022054266,0.000029603223,0.97282535,0.00032440413,0.0013691739,0.00002118568,0.0000039205806,0.000068515335,0.003303595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974331,0.00006921653,0.00056714413,0.0009128532,0.0005630305,0.00045461365],"domain_scores_gemma":[0.9968205,0.0016070443,0.0004040767,0.000844094,0.00020823549,0.00011604306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016078495,0.0004412819,0.0005948833,0.00040033078,0.00023852482,0.00016656269,0.0007582091,0.00030475995,0.000022244816],"category_scores_gemma":[0.000475454,0.0003271676,0.00016495172,0.00015579989,0.00032106272,0.00015919923,0.00038557834,0.0004303401,0.0000011483551],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017977685,0.000013462846,0.000018578348,0.00006692226,0.000013640193,0.000016040747,0.00067124993,0.0030966199,0.008136927,0.006273709,0.000031402236,0.9816435],"study_design_scores_gemma":[0.0015617382,0.00010862128,0.000008103139,0.0013186791,0.0000439161,0.00007135821,6.6299435e-7,0.8306846,0.0062384983,0.1563949,0.0025157514,0.0010531928],"about_ca_topic_score_codex":0.000010522146,"about_ca_topic_score_gemma":0.00009844081,"teacher_disagreement_score":0.9805903,"about_ca_system_score_codex":0.0002026477,"about_ca_system_score_gemma":0.00012988299,"threshold_uncertainty_score":0.99991804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014759065,0.00052901224,0.9937184,0.001425948,0.0013748399,0.0010088324,0.000015154954,0.0002822847,0.00016960873],"genre_scores_gemma":[0.43772,0.000019485113,0.56086886,0.00086121174,0.00038962744,0.000028438539,0.000016481246,0.00004815671,0.000047756672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962842,0.000038956976,0.0006167853,0.0016918473,0.0006383023,0.0007299105],"domain_scores_gemma":[0.9974635,0.0007980434,0.00032207824,0.00093597086,0.000256917,0.00022345109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077309244,0.0006065697,0.0006472147,0.00078616216,0.0005972696,0.00086598005,0.0018122952,0.00029532352,0.0000036053677],"category_scores_gemma":[0.00011393219,0.0005599847,0.00015294612,0.0005158174,0.0008281852,0.00040783733,0.0009263203,0.0007379342,0.0000076272972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006458535,0.000043556327,0.000014513481,0.00015423779,0.000012979418,0.000027814824,0.0010172596,0.27404797,0.000044058015,0.23700762,0.000009494136,0.48761404],"study_design_scores_gemma":[0.00027311058,0.00021842675,0.000120314195,0.00035023276,0.000008192265,0.00007775096,1.0254233e-7,0.5276011,0.000029349843,0.4708216,0.00014479096,0.0003549993],"about_ca_topic_score_codex":0.000036147732,"about_ca_topic_score_gemma":0.00007251886,"teacher_disagreement_score":0.48725903,"about_ca_system_score_codex":0.00030571688,"about_ca_system_score_gemma":0.000633534,"threshold_uncertainty_score":0.99968517},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039893715,0.0007163439,0.99112993,0.0014314101,0.0046756216,0.00065144437,0.00001017244,0.0003516614,0.00063444575],"genre_scores_gemma":[0.19908553,0.000029488183,0.79789686,0.0011077572,0.0011838231,0.000022248345,0.000045184894,0.00005134994,0.0005777514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99414355,0.00019211831,0.0008312497,0.002403435,0.0015604635,0.0008691734],"domain_scores_gemma":[0.99621373,0.0016157435,0.0004805044,0.00082571566,0.0006090452,0.0002552707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014484407,0.0007129611,0.0007195892,0.0011191955,0.00040171106,0.00093197846,0.0023087128,0.00035457037,0.0000095841115],"category_scores_gemma":[0.00017460097,0.0006065162,0.00017030287,0.0012085045,0.0012394686,0.0012396026,0.002245786,0.0008511504,0.00005182893],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006717711,0.00005784162,0.00016778878,0.0000779942,0.00001639772,0.00005829437,0.00033602587,0.025023887,0.000064962966,0.00372594,0.00016401606,0.97030014],"study_design_scores_gemma":[0.0004925827,0.00013941167,0.0018183308,0.00024832506,0.0000067475876,0.00014140236,1.2965792e-7,0.6753576,0.00009024881,0.3208494,0.00026379252,0.0005920656],"about_ca_topic_score_codex":0.00001737108,"about_ca_topic_score_gemma":0.00004660011,"teacher_disagreement_score":0.9697081,"about_ca_system_score_codex":0.0010169096,"about_ca_system_score_gemma":0.001436226,"threshold_uncertainty_score":0.9996386},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030273647,0.0002560951,0.9983992,0.00014124115,0.00026095324,0.00045786583,0.0000016578849,0.00012047244,0.00005975295],"genre_scores_gemma":[0.6805479,0.00008129921,0.31852108,0.0004838578,0.000284879,0.00001496377,0.0000033649337,0.000030497518,0.000032173637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976128,0.000032381544,0.00030170966,0.0012141125,0.0004294924,0.0004095381],"domain_scores_gemma":[0.9983982,0.0004033803,0.0003110263,0.0005129385,0.0002463129,0.00012818459],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002450679,0.00037659562,0.00028285815,0.00035506123,0.0004969513,0.000250782,0.00054468575,0.00024935877,0.0000018046624],"category_scores_gemma":[0.00003318854,0.00030537703,0.000027928318,0.00049686036,0.000934518,0.0008980234,0.00048223304,0.00038966027,0.0000016474454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013656945,0.000011500469,0.00027961453,0.000014978339,0.000008094227,0.000006515353,0.00009585296,0.50920486,0.0004993639,0.0056877527,3.650289e-7,0.4841774],"study_design_scores_gemma":[0.0003581752,0.000084804786,0.00056265824,0.00022243295,0.00000781857,0.00015244281,1.0773868e-7,0.9742432,0.0007812052,0.023111219,0.0000879877,0.0003879291],"about_ca_topic_score_codex":0.0000075247094,"about_ca_topic_score_gemma":0.00010203528,"teacher_disagreement_score":0.68024516,"about_ca_system_score_codex":0.00029837163,"about_ca_system_score_gemma":0.00014529207,"threshold_uncertainty_score":0.99993986},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003042869,0.00077898457,0.9948363,0.00012108948,0.0017835664,0.00031264752,0.0000010940346,0.00011355939,0.0017485194],"genre_scores_gemma":[0.61769354,0.00007411949,0.37598047,0.0009893591,0.0014281813,0.000020923682,0.0000089439045,0.000045951296,0.0037585355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971819,0.00013357069,0.0003425417,0.0010198695,0.0007344199,0.0005876926],"domain_scores_gemma":[0.998445,0.00036563273,0.0002859905,0.0005993065,0.000116070056,0.00018801758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011813218,0.00035037144,0.00037047136,0.00050410593,0.00033479664,0.00040389667,0.0013664766,0.00024221418,0.000010269647],"category_scores_gemma":[0.00008382367,0.00031329217,0.000060751376,0.00053794205,0.00024429572,0.00084296847,0.0010192464,0.0007879612,0.000052243584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035954704,0.000039899496,0.0011282667,0.000076224176,0.000015998812,0.000032294738,0.0054692267,0.014639302,0.00009184544,0.0028644053,0.00024505,0.9753939],"study_design_scores_gemma":[0.0002877665,0.00014181482,0.0039811796,0.00036833243,0.000007786222,0.000057511686,4.805713e-7,0.9826045,0.00020784828,0.0061290674,0.005602211,0.00061147095],"about_ca_topic_score_codex":0.000038751954,"about_ca_topic_score_gemma":0.000023453402,"teacher_disagreement_score":0.9747824,"about_ca_system_score_codex":0.00029686515,"about_ca_system_score_gemma":0.00034669263,"threshold_uncertainty_score":0.99993193},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013077543,0.00006916188,0.98994935,0.0007293896,0.0015236859,0.0006521863,0.00007907009,0.000055439858,0.005633988],"genre_scores_gemma":[0.70575774,0.0000062601143,0.27675843,0.00075387314,0.00029831755,0.00009286647,0.000062863735,0.00006972138,0.016199956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788624,0.000023302951,0.00040048786,0.000883441,0.00032251756,0.0004839811],"domain_scores_gemma":[0.9988132,0.00029693794,0.00015163624,0.00044565758,0.00019740874,0.00009513906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003896065,0.00031119704,0.00032497643,0.00072076905,0.00014658055,0.00005584776,0.0006325741,0.00032677522,0.00010786988],"category_scores_gemma":[0.000021318812,0.00026797593,0.00010624152,0.00027367874,0.0003013517,0.00017028704,0.00013825603,0.00039727887,0.00008637418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048379792,0.00019864559,0.0006477817,0.000025644273,0.000017956814,0.000032218453,0.0011243812,0.45930392,0.000029388444,0.2711308,0.00025562666,0.26718527],"study_design_scores_gemma":[0.0011780232,0.0001229909,0.0025834271,0.00048034798,0.000016903941,0.000028459344,4.93763e-7,0.30503,0.0000042325883,0.68933237,0.0006862857,0.0005365108],"about_ca_topic_score_codex":0.000013308336,"about_ca_topic_score_gemma":0.000121380624,"teacher_disagreement_score":0.7131909,"about_ca_system_score_codex":0.00029158205,"about_ca_system_score_gemma":0.00034368414,"threshold_uncertainty_score":0.99997723},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032295633,0.00068300066,0.99230224,0.0032155374,0.000619748,0.0006570973,0.000015239473,0.00031317846,0.002161645],"genre_scores_gemma":[0.19380741,0.00013765617,0.777364,0.008946694,0.0032091758,0.00018703598,0.000014524102,0.00013125016,0.016202223],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743915,0.000030021147,0.0003700793,0.0009944029,0.0006306759,0.00053564616],"domain_scores_gemma":[0.9974101,0.00065261195,0.0002490752,0.0014318071,0.00018513192,0.000071276096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010674114,0.00036124795,0.00032167564,0.00032032537,0.00029636305,0.0005303691,0.0033267308,0.00019105784,0.000017719336],"category_scores_gemma":[0.00016557885,0.00022146548,0.00016724208,0.0003431354,0.0005370641,0.00042149524,0.00075444876,0.0003915904,0.000044938057],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039377155,0.000008906839,0.0000048482075,0.000026389964,0.000006258847,0.0000200146,0.0010772931,0.000012845945,0.0031836394,0.039155915,0.00006819136,0.95643175],"study_design_scores_gemma":[0.0012958585,0.0005581744,0.00020379128,0.001816687,0.000047551388,0.00032717967,0.0000040137816,0.33475295,0.2641667,0.36308965,0.030573241,0.003164188],"about_ca_topic_score_codex":0.000007427394,"about_ca_topic_score_gemma":0.000008759316,"teacher_disagreement_score":0.9532676,"about_ca_system_score_codex":0.0001890945,"about_ca_system_score_gemma":0.0003016325,"threshold_uncertainty_score":0.90311},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007733387,0.002502114,0.99369687,0.00016569694,0.0017090811,0.0005221771,0.00023082567,0.00010302136,0.0009928744],"genre_scores_gemma":[0.95588833,0.00021014838,0.042027004,0.00025214007,0.0007735488,0.000028986848,0.00027889945,0.0000618776,0.00047907975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609834,0.000120254794,0.000876846,0.001202832,0.001175545,0.0005261582],"domain_scores_gemma":[0.9966731,0.0003155185,0.0005390825,0.0012932541,0.00093751476,0.00024154372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017207502,0.00042083487,0.0008372534,0.0003769637,0.0001440799,0.00045735986,0.0023327703,0.00032597606,0.0000017601307],"category_scores_gemma":[0.00021084995,0.0003768591,0.000065155196,0.001471619,0.0006962862,0.0006065472,0.0010967621,0.00043918646,0.00000452112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008081978,0.00041663638,0.0020584748,0.0027684572,0.0001105601,0.0002086761,0.0093326885,0.56696063,0.0001371774,0.13946761,0.0060947337,0.27236354],"study_design_scores_gemma":[0.00052256766,0.00016486332,0.0001909233,0.0008318828,0.000008805577,0.0000833985,0.0000011487714,0.9407997,0.00007504138,0.04173601,0.014988598,0.0005970321],"about_ca_topic_score_codex":0.000072835996,"about_ca_topic_score_gemma":0.00004791095,"teacher_disagreement_score":0.95581096,"about_ca_system_score_codex":0.00046961382,"about_ca_system_score_gemma":0.0015904574,"threshold_uncertainty_score":0.99986833},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019538254,0.0004918757,0.9901052,0.0042186067,0.0006714009,0.0001586751,0.0000017127894,0.0003327998,0.0020658842],"genre_scores_gemma":[0.9870822,0.000018714882,0.009652055,0.0008984211,0.0020488221,0.0000036117233,0.000024474553,0.00002732044,0.00024441828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833715,0.0000033406272,0.00024444758,0.00069967925,0.00039770774,0.0003176661],"domain_scores_gemma":[0.9987514,0.00005076161,0.0004408533,0.00032890393,0.0004231127,0.000004947126],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004972337,0.0002738808,0.00038049807,0.00080275565,0.0009893704,0.0022664245,0.00090104074,0.00026857652,0.0000023523298],"category_scores_gemma":[0.00016550126,0.0002475114,0.000044138742,0.0006416217,0.0007298559,0.0010588549,0.0008703765,0.00037585336,0.000011126577],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033605916,0.00001173983,0.00035674134,0.00027961194,0.000008499288,0.00001041405,0.00014543472,0.0083565265,0.000025155388,0.0011946289,0.00020798377,0.9893999],"study_design_scores_gemma":[0.00020900532,0.0000054055477,0.00018649467,0.00035457965,0.00004620805,0.0000028293405,0.0000056710032,0.89729756,0.000033483455,0.09644446,0.004909157,0.00050516473],"about_ca_topic_score_codex":0.00006737448,"about_ca_topic_score_gemma":0.00017137402,"teacher_disagreement_score":0.98889476,"about_ca_system_score_codex":0.00008297701,"about_ca_system_score_gemma":0.00023466678,"threshold_uncertainty_score":0.99999774},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006291048,0.0016040477,0.9899306,0.0006380491,0.0035962136,0.0022666284,0.000012720494,0.00007963843,0.0012429596],"genre_scores_gemma":[0.8042807,0.0017815519,0.16634533,0.009876864,0.00684575,0.0018636932,0.0004736611,0.00032953033,0.008202915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967354,0.00022629804,0.0014088104,0.0003378102,0.0005080863,0.0007836157],"domain_scores_gemma":[0.9968417,0.0012168848,0.00095521315,0.00046593614,0.00035923324,0.00016097796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029929886,0.00023662692,0.00064412877,0.00076316437,0.000405577,0.000055144905,0.0004177646,0.00033271094,0.0000128908105],"category_scores_gemma":[0.0003339469,0.00021308051,0.000028956103,0.00051835825,0.00014839602,0.00051878137,0.0002185775,0.0011096374,0.000056155986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009176916,0.000039136114,0.0032767442,0.028119594,0.000042793046,0.0000016469552,0.023800448,0.07535343,0.000052009327,0.016646245,0.0048788036,0.84778],"study_design_scores_gemma":[0.00060498354,0.00035081134,0.001903974,0.008464381,0.000007267983,0.000019728408,0.000012186105,0.92117393,0.0000056122885,0.002985618,0.06395356,0.0005179487],"about_ca_topic_score_codex":0.0012877098,"about_ca_topic_score_gemma":0.00014083066,"teacher_disagreement_score":0.847262,"about_ca_system_score_codex":0.0016400806,"about_ca_system_score_gemma":0.0070647825,"threshold_uncertainty_score":0.99856424},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047618,0.00014578295,0.9945412,0.0014775173,0.0009565477,0.0003737349,0.000010357244,0.000080271624,0.0019383774],"genre_scores_gemma":[0.7905572,0.0000611894,0.20631516,0.0019234405,0.0009902259,0.00004020311,0.000021731767,0.000024473067,0.00006640349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971198,0.00007330551,0.00033607607,0.0010272472,0.0010689097,0.00037466624],"domain_scores_gemma":[0.9980805,0.00040668063,0.0002045545,0.0010784069,0.00016684752,0.00006303432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012723072,0.0003017329,0.00023531112,0.0006240744,0.00037610502,0.0010163956,0.0024358649,0.00017025629,0.00001580553],"category_scores_gemma":[0.000051273415,0.00018910681,0.00007426526,0.00086569664,0.0005259717,0.0015234146,0.00041574612,0.00048678383,0.000024860721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019478672,0.00009131123,0.00041606906,0.000025156884,0.000010724728,0.000053362324,0.0023612324,0.00071869575,0.00014824864,0.79453015,0.000041426654,0.20158416],"study_design_scores_gemma":[0.0005126096,0.00023871036,0.0041635027,0.00039302825,0.000010867658,0.0002019708,8.1980863e-7,0.051909536,0.0003773458,0.93911064,0.0023990653,0.0006818802],"about_ca_topic_score_codex":0.00004041625,"about_ca_topic_score_gemma":0.0012968461,"teacher_disagreement_score":0.790081,"about_ca_system_score_codex":0.00015105426,"about_ca_system_score_gemma":0.0003299505,"threshold_uncertainty_score":0.9801127},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006301242,0.00052459334,0.99734896,0.00011385248,0.00041124012,0.0002553738,0.0000033406484,0.0010189601,0.00026068458],"genre_scores_gemma":[0.07500585,0.0000263013,0.924365,0.00016622008,0.0002797772,0.000015222889,0.0000039168262,0.000025163386,0.00011257804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639326,0.000041550567,0.0004983959,0.0016064306,0.00085236435,0.00060798135],"domain_scores_gemma":[0.99767965,0.0001581524,0.00016253779,0.0016264032,0.00018921417,0.00018405059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093436206,0.0004891224,0.0007098306,0.0020586774,0.00016350011,0.00057679333,0.002955925,0.0003304419,0.0000014283715],"category_scores_gemma":[0.000011795227,0.00047090807,0.00015390651,0.002280044,0.00020935798,0.00059653743,0.0015149569,0.0006786509,0.0000059333465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.197593e-7,0.0000061084143,0.000032718868,0.00004830387,0.000028506856,0.000024649986,0.00025374643,0.6319348,0.00000722235,0.009007794,0.000007797181,0.3586478],"study_design_scores_gemma":[0.00006663832,0.000033038654,0.00002407198,0.0002582321,0.000042543237,0.000041933206,2.3060862e-8,0.9947059,0.00011750774,0.0036195116,0.0006071201,0.00048344143],"about_ca_topic_score_codex":0.000034788078,"about_ca_topic_score_gemma":0.000042733187,"teacher_disagreement_score":0.3627711,"about_ca_system_score_codex":0.0007664218,"about_ca_system_score_gemma":0.0004607669,"threshold_uncertainty_score":0.9997743},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013364406,0.00038940657,0.98053944,0.0001668619,0.0008108648,0.0004441171,0.000004751476,0.000094264724,0.017416626],"genre_scores_gemma":[0.31609395,0.0003629194,0.68158007,0.0013591113,0.000108426895,0.00001599458,0.000009285505,0.000054745466,0.0004154749],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635535,0.00006247548,0.000717906,0.0012606053,0.00092983997,0.00067383394],"domain_scores_gemma":[0.9977767,0.00019364413,0.00033471323,0.0012978992,0.00021380157,0.00018324773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085960084,0.00043408072,0.0005773923,0.001629963,0.00010102182,0.00017126957,0.0034289812,0.00032359542,0.00008043712],"category_scores_gemma":[0.00005545985,0.00041342966,0.00013339247,0.0010318263,0.00070452114,0.0005888854,0.001141594,0.00080739765,0.000028062555],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019644931,0.00025357882,0.0007794723,0.00016288385,0.000026730673,0.00043508896,0.004733409,0.075424895,0.00009741142,0.15963829,0.00006358759,0.75836504],"study_design_scores_gemma":[0.0006659014,0.00047715218,0.00096574525,0.0006249965,0.0000058643545,0.000081449725,2.5071583e-7,0.41543928,0.0009947201,0.57932234,0.0005248029,0.00089749816],"about_ca_topic_score_codex":0.000082463834,"about_ca_topic_score_gemma":0.00012143238,"teacher_disagreement_score":0.7574675,"about_ca_system_score_codex":0.00018232122,"about_ca_system_score_gemma":0.00072574074,"threshold_uncertainty_score":0.99983174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001822319,0.00004256628,0.9778916,0.0014685956,0.006886231,0.00037944724,0.00007510102,0.0001211192,0.012953065],"genre_scores_gemma":[0.6476698,0.0000141189,0.28751215,0.006146694,0.0018187986,0.000033915254,0.000027230053,0.000093268216,0.056684017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9862748,0.00011924862,0.00107304,0.0037033851,0.007797803,0.0010317151],"domain_scores_gemma":[0.9910947,0.0042661717,0.0004768544,0.00283522,0.0009683221,0.00035873373],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.01246279,0.0005002961,0.0005694011,0.0042354534,0.0013025228,0.0025578993,0.007795731,0.00017118153,0.00037329627],"category_scores_gemma":[0.0015652571,0.0003431232,0.00019775993,0.0051753432,0.0045108013,0.00092803536,0.00071430346,0.0006567555,0.0012746237],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008081024,0.000050451254,0.0000147939845,0.000004213946,0.000003676744,0.000017829787,0.00022055084,0.2227521,0.000024141102,0.0010920428,0.0014115243,0.7744006],"study_design_scores_gemma":[0.00044624208,0.00020155292,0.0004962225,0.0003797617,0.000009832232,0.00003317392,0.0000014588478,0.5143477,0.0004034011,0.460721,0.022212898,0.00074680155],"about_ca_topic_score_codex":0.000009597948,"about_ca_topic_score_gemma":0.00003219375,"teacher_disagreement_score":0.7736538,"about_ca_system_score_codex":0.0009792134,"about_ca_system_score_gemma":0.0032694456,"threshold_uncertainty_score":0.9999977},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003325177,0.00042414176,0.98207676,0.0007736233,0.0015110178,0.0007116558,0.00008032555,0.00010070028,0.013989238],"genre_scores_gemma":[0.41518125,0.000027289185,0.52194315,0.0066185463,0.0036724133,0.0001690555,0.0002611999,0.00012540664,0.052001663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98820007,0.00007545913,0.001015882,0.0033601092,0.0065190583,0.0008294475],"domain_scores_gemma":[0.9928666,0.0026960624,0.0005001981,0.0018301224,0.0018279166,0.00027914066],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0124295745,0.00042482562,0.0005020705,0.002952013,0.0012457693,0.0033135372,0.005596613,0.0001522744,0.00003744092],"category_scores_gemma":[0.0021696198,0.00035209316,0.00007919784,0.0067176567,0.0032016353,0.0008827083,0.0033340387,0.000518579,0.00027624748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030866754,0.000066433,0.00015733004,0.00002122499,0.0000037537452,0.000014643762,0.00016629903,0.26162142,0.000030770207,0.00808081,0.01703106,0.7128032],"study_design_scores_gemma":[0.00016736507,0.000035543813,0.0011116816,0.00007310812,0.0000073080337,0.000027353062,6.494993e-7,0.68775016,0.00004275019,0.21945935,0.09090963,0.00041511565],"about_ca_topic_score_codex":0.000027576063,"about_ca_topic_score_gemma":0.000055928824,"teacher_disagreement_score":0.71238804,"about_ca_system_score_codex":0.0005649388,"about_ca_system_score_gemma":0.0026472388,"threshold_uncertainty_score":0.9998931},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020347066,0.00015864836,0.78120196,0.0007752564,0.0037231268,0.00030695088,0.000004996487,0.00006628311,0.2135593],"genre_scores_gemma":[0.83942366,0.00010116862,0.09339485,0.0085076885,0.0040827217,0.00003095514,0.00001719934,0.00005101596,0.054390732],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815166,0.00016793329,0.00023754223,0.00050405524,0.00047836232,0.00046042603],"domain_scores_gemma":[0.9987294,0.0007442223,0.000109374494,0.00024176712,0.00009012846,0.00008509799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022241713,0.00015187272,0.0002161924,0.00043266267,0.00017345946,0.00008132079,0.0008937913,0.0002555266,0.00014562432],"category_scores_gemma":[0.0013301108,0.00012246601,0.000030284236,0.00040786157,0.00074936304,0.00008145864,0.00021136664,0.00028328176,0.000093594936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010440837,0.000034854947,0.0011094976,0.0000147817,0.0000062358276,0.00018903006,0.04844881,0.0001224581,0.000047611662,0.187122,0.00021290327,0.76268137],"study_design_scores_gemma":[0.00095062656,0.0000544579,0.0028144834,0.0006860542,0.000008195001,0.0000108268105,0.000019327732,0.00036115944,0.00025985707,0.8872416,0.106603034,0.0009903829],"about_ca_topic_score_codex":0.00014077041,"about_ca_topic_score_gemma":0.0016343043,"teacher_disagreement_score":0.83922017,"about_ca_system_score_codex":0.00067847496,"about_ca_system_score_gemma":0.0027504056,"threshold_uncertainty_score":0.4994019},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063478605,0.000661298,0.9880593,0.0005984012,0.0012501542,0.0004095691,0.000017880755,0.00029476563,0.008645182],"genre_scores_gemma":[0.47406653,0.00009781307,0.5243565,0.0003991487,0.0007500687,0.000009390866,0.0000064423475,0.0000745812,0.00023956239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944213,0.00004068521,0.0005830429,0.002640111,0.0013279865,0.0009868551],"domain_scores_gemma":[0.9946363,0.0007434905,0.00040350377,0.0036388608,0.00037973686,0.00019813947],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007456575,0.0007666862,0.0006381473,0.00080375996,0.00037523385,0.0015656403,0.009231553,0.00031151375,0.00004741222],"category_scores_gemma":[0.00011798558,0.0005495004,0.00006538226,0.00058520085,0.0013780621,0.0036651439,0.004113651,0.0008892491,0.000044308905],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015477013,0.000011656238,0.000017251798,0.000024287196,0.000027444215,0.00016130209,0.0012765446,0.059276488,0.00008756816,0.20007,0.000010685467,0.7390213],"study_design_scores_gemma":[0.00013072808,0.00023983975,0.000058076243,0.0007894856,0.000011427924,0.00009414565,0.000007254257,0.5070322,0.0017878254,0.48780438,0.0009407092,0.0011039004],"about_ca_topic_score_codex":0.000069427275,"about_ca_topic_score_gemma":0.00032580615,"teacher_disagreement_score":0.7379174,"about_ca_system_score_codex":0.00026201282,"about_ca_system_score_gemma":0.0011025361,"threshold_uncertainty_score":0.99969566},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015503883,0.0015978287,0.9956038,0.00033367466,0.0013528689,0.00017160377,0.000009035559,0.00024081979,0.0006748784],"genre_scores_gemma":[0.0042099818,0.00013261323,0.99420875,0.0007712608,0.00043235288,0.000005381236,0.000029589155,0.00002009775,0.00018998788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959088,0.000029069262,0.0003812965,0.0021196501,0.0009774315,0.00058375864],"domain_scores_gemma":[0.9966252,0.0004406726,0.00014280838,0.0024452684,0.00018096443,0.00016512682],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000793604,0.00040209747,0.0004120961,0.00054246624,0.00021977459,0.0007746602,0.006441256,0.00021027746,0.000004119803],"category_scores_gemma":[0.00017899944,0.0003800625,0.000039932645,0.0012640698,0.0006043794,0.0015378618,0.006415001,0.0007079312,0.0000031702568],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.731934e-7,0.000007837076,0.000010434602,0.0000319337,0.0000049803216,0.00011861582,0.0002041315,0.06912995,0.000049108974,0.010094964,0.00012208831,0.9202255],"study_design_scores_gemma":[0.000068124435,0.000031494354,0.000067868736,0.0001345761,0.0000024652936,0.0001725866,1.1712379e-7,0.702291,0.0003559464,0.29418537,0.0023134882,0.00037697764],"about_ca_topic_score_codex":0.0000055310893,"about_ca_topic_score_gemma":0.000007842408,"teacher_disagreement_score":0.9198485,"about_ca_system_score_codex":0.00023168442,"about_ca_system_score_gemma":0.001078973,"threshold_uncertainty_score":0.9998651},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000025615577,0.00018000118,0.9905146,0.003031199,0.0010333278,0.00153201,0.00003492507,0.00019962821,0.0034717557],"genre_scores_gemma":[0.003000385,0.0000730855,0.9929213,0.00053468806,0.0005968683,0.000101580474,0.000018592978,0.00006982127,0.0026836863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944193,0.000071703194,0.0007776977,0.0021039275,0.0016294961,0.000997915],"domain_scores_gemma":[0.99557906,0.0010966951,0.00037967807,0.0017329454,0.00090201636,0.0003095914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016205814,0.00065561326,0.0006609159,0.0013221011,0.0003861934,0.00090777484,0.004444833,0.00033916964,0.00008701889],"category_scores_gemma":[0.00041863477,0.00048325557,0.00018691507,0.0009376173,0.00067344954,0.0009312779,0.0017550362,0.00056592165,0.000049091897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017344926,0.000029482459,0.000036086556,0.00009361086,0.000019031238,0.00002767506,0.0003020427,0.48152658,0.00003502914,0.01966391,0.000039197654,0.49821],"study_design_scores_gemma":[0.000495596,0.00018397768,0.000014704987,0.00023270435,0.0000052237815,0.00003128149,3.431073e-8,0.8790665,0.000096494594,0.11862367,0.0007023461,0.00054742384],"about_ca_topic_score_codex":0.00000596506,"about_ca_topic_score_gemma":0.000008549459,"teacher_disagreement_score":0.49766257,"about_ca_system_score_codex":0.00036207616,"about_ca_system_score_gemma":0.00087505527,"threshold_uncertainty_score":0.99976194},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073222595,0.000099807454,0.99408674,0.0013160048,0.00015886234,0.0031037899,0.000008719654,0.000070553215,0.00042329417],"genre_scores_gemma":[0.77096075,0.000039956994,0.22568488,0.0004337019,0.000105293286,0.0016305201,0.0000021649535,0.00004082382,0.0011018814],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839836,0.00015412802,0.00037881476,0.00041890776,0.0002586954,0.0003910847],"domain_scores_gemma":[0.98722106,0.01081801,0.00036523948,0.0011623122,0.00038901332,0.00004437242],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012210873,0.00020444125,0.00031394968,0.000096214484,0.000875739,0.000020523352,0.0007858886,0.00021966698,0.000015179463],"category_scores_gemma":[0.00052353606,0.00009739805,0.00003150987,0.00012571093,0.0027945957,0.00008827102,0.0002953835,0.0005647627,0.0000034235825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001994365,0.0001474721,0.20580769,0.00065954606,0.00014239877,0.000001978458,0.010417236,0.0044268565,0.000078393714,0.11268875,0.00024949506,0.6633858],"study_design_scores_gemma":[0.0073835384,0.009023682,0.047950022,0.029254312,0.0003937213,0.00002578997,0.00024719065,0.071354374,0.0036835272,0.5648627,0.26133102,0.0044900947],"about_ca_topic_score_codex":0.000012352908,"about_ca_topic_score_gemma":0.0013949169,"teacher_disagreement_score":0.77022856,"about_ca_system_score_codex":0.00018702855,"about_ca_system_score_gemma":0.0007918697,"threshold_uncertainty_score":0.99991924},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005774858,0.00010753746,0.9907349,0.0003659549,0.0038608317,0.00034003248,0.000018767203,0.00020305664,0.0043112175],"genre_scores_gemma":[0.0028966672,0.000017388862,0.9943847,0.0010716986,0.0006887411,0.00001384639,0.000019814655,0.000026132022,0.00088099606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965608,0.000042079024,0.0007362469,0.00082827,0.0010587175,0.000773871],"domain_scores_gemma":[0.9964492,0.00061147555,0.00035348325,0.002124782,0.00023305659,0.00022801472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010473275,0.0004976884,0.0005552564,0.0005596708,0.00027688176,0.00041623635,0.0030901392,0.00043794423,0.000037305424],"category_scores_gemma":[0.00026069942,0.00040136988,0.000106936124,0.0008513559,0.0018322999,0.0012085921,0.0021627122,0.0015825209,0.00012782362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031580837,0.000025564144,0.0000338314,0.00008983244,0.000005927741,0.000048544694,0.0018584487,0.0039306283,0.00008710272,0.6143046,0.00042766653,0.37918466],"study_design_scores_gemma":[0.0003424825,0.00013602113,0.0001173343,0.0005327557,0.0000067524256,0.00013010719,7.4902624e-7,0.65053236,0.0014866199,0.30831403,0.037223943,0.0011768795],"about_ca_topic_score_codex":0.000012817674,"about_ca_topic_score_gemma":0.00006870874,"teacher_disagreement_score":0.64660174,"about_ca_system_score_codex":0.00019038841,"about_ca_system_score_gemma":0.0013330674,"threshold_uncertainty_score":0.99984384},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046064996,0.0002569685,0.99551445,0.0017342613,0.0007989637,0.00039224475,0.0000066638686,0.00015862827,0.0006771901],"genre_scores_gemma":[0.37952667,0.0000018268661,0.61956906,0.0006573765,0.000119617136,0.0000051547536,1.9145529e-7,0.000017665852,0.000102442405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968246,0.00013528911,0.0006287919,0.0011469481,0.00064955495,0.00061478873],"domain_scores_gemma":[0.9960905,0.0012801279,0.00045814284,0.0017322532,0.00032014525,0.0001188444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016520955,0.00043474953,0.00080498424,0.00074750045,0.0002444676,0.00018152354,0.00467642,0.00023310604,0.000008010142],"category_scores_gemma":[0.00022038395,0.00027472,0.00014864774,0.0006285687,0.0011325296,0.00019680781,0.00125485,0.00067793514,0.000018390305],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007565396,0.000033926633,0.00032843114,0.00001422637,0.0000235841,0.0000105325835,0.0005719456,0.02091693,0.013386389,0.08005543,0.000014194565,0.8846368],"study_design_scores_gemma":[0.0007701304,0.0003992055,0.00024937707,0.00047946605,0.00003152647,0.000058104404,4.810848e-7,0.74577886,0.0718704,0.17781916,0.0016777966,0.0008654774],"about_ca_topic_score_codex":0.000025554185,"about_ca_topic_score_gemma":0.000033265278,"teacher_disagreement_score":0.88377136,"about_ca_system_score_codex":0.00020546278,"about_ca_system_score_gemma":0.000315869,"threshold_uncertainty_score":0.9999705},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062392242,0.0003310019,0.88293564,0.00028024122,0.003070067,0.0007497836,0.000029899204,0.00009758168,0.050113544],"genre_scores_gemma":[0.97823584,0.000029871728,0.0011477526,0.0008969236,0.00017966563,0.000014591591,0.0000032890946,0.0000248088,0.019467242],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9980942,0.000051199615,0.00039997304,0.00080486416,0.00030336712,0.00034637662],"domain_scores_gemma":[0.9991168,0.0002628994,0.00018765616,0.00031346653,0.000031529016,0.000087658984],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003266627,0.00030022016,0.00029139675,0.0005518583,0.00016685008,0.000059946153,0.00033098322,0.00027075747,0.0010650334],"category_scores_gemma":[0.000025156958,0.000258896,0.000043835822,0.000081370345,0.00079736294,0.00020243454,0.00019141228,0.0006021973,0.00045096967],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043498454,0.00008401241,0.002939039,0.000011897939,0.000024384748,0.000059812992,0.004473535,0.00029607376,0.0002741497,0.0025529012,0.000016372116,0.9892243],"study_design_scores_gemma":[0.016471837,0.0024397492,0.86055493,0.010655527,0.00009778612,0.0005361823,0.000053636963,0.0603482,0.0018414812,0.013864,0.02724591,0.0058907443],"about_ca_topic_score_codex":0.0000069306116,"about_ca_topic_score_gemma":0.00005923337,"teacher_disagreement_score":0.9833336,"about_ca_system_score_codex":0.00015029937,"about_ca_system_score_gemma":0.000035963443,"threshold_uncertainty_score":0.99998635},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014195429,0.0071067065,0.916894,0.012951975,0.0061941887,0.0025722932,0.00005580108,0.00053116115,0.039498437],"genre_scores_gemma":[0.980613,0.001297999,0.01608148,0.0006138643,0.0009129236,0.00003839488,0.0000026980197,0.00003974345,0.00039990098],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967279,0.00006998382,0.00047111348,0.0010879672,0.0008226691,0.00082036667],"domain_scores_gemma":[0.998197,0.00030067217,0.00029624533,0.00090792537,0.00016659519,0.00013156662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010786991,0.0003433003,0.00044287246,0.0009644936,0.0005133524,0.00025451093,0.0022272742,0.00064225215,0.000095974465],"category_scores_gemma":[0.0010271507,0.00030641415,0.00007721343,0.0006585509,0.0018760805,0.00067364564,0.0015116154,0.0008237396,0.00006663921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001276359,0.000035074758,0.0013877435,0.000026816011,0.0000068699323,0.00005183958,0.0065517644,0.00014229781,0.0001428277,0.035522126,0.000041281663,0.9560786],"study_design_scores_gemma":[0.00050358707,0.00024615618,0.00034156567,0.0019652676,0.000007554511,0.000009329348,0.000012934575,0.0014534156,0.0012015798,0.94704014,0.046346262,0.0008722186],"about_ca_topic_score_codex":0.000750959,"about_ca_topic_score_gemma":0.0015743447,"teacher_disagreement_score":0.96641755,"about_ca_system_score_codex":0.0009572439,"about_ca_system_score_gemma":0.00077788805,"threshold_uncertainty_score":0.9999388},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065405614,0.0003921903,0.9795407,0.0011455835,0.0027002378,0.00041230058,0.000023353374,0.00018251596,0.014949056],"genre_scores_gemma":[0.21170138,0.00067897455,0.7732748,0.008806641,0.002305659,0.000053953238,0.00003642923,0.00015303321,0.002989152],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99543595,0.000049839586,0.0007269985,0.0017690052,0.001120537,0.00089763687],"domain_scores_gemma":[0.99674773,0.0005395548,0.00036882225,0.0018184708,0.00029526357,0.00023013203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009940069,0.0006067028,0.00054912525,0.0010048625,0.00042442986,0.00089498406,0.0034069149,0.00032158886,0.00012311857],"category_scores_gemma":[0.00006433256,0.00049879606,0.0002514789,0.0007709851,0.00072457496,0.0011169759,0.0014733474,0.00062538416,0.000141611],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007423199,0.00003896974,0.0000672584,0.00002798992,0.000026819913,0.00010617927,0.00079088286,0.0020903652,0.00009322549,0.06751932,0.00034361146,0.92888796],"study_design_scores_gemma":[0.0017395256,0.00072562887,0.00054260535,0.0012790379,0.00003207359,0.00019267987,0.0000012025073,0.13360152,0.00074770994,0.75496954,0.10261518,0.003553288],"about_ca_topic_score_codex":0.000017504732,"about_ca_topic_score_gemma":0.00023342326,"teacher_disagreement_score":0.9253347,"about_ca_system_score_codex":0.0003522888,"about_ca_system_score_gemma":0.00057697983,"threshold_uncertainty_score":0.9997464},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024626737,0.0020076954,0.7566553,0.0011660001,0.0066666394,0.0009902526,0.00006209999,0.00014013037,0.20768516],"genre_scores_gemma":[0.987498,0.00015708043,0.007468033,0.0011199208,0.0010278722,0.000007235044,0.0000031666382,0.000039131708,0.0026795634],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980193,0.000013666221,0.000532547,0.0005101279,0.000545019,0.00037937862],"domain_scores_gemma":[0.998513,0.0003116506,0.00043031585,0.00045919316,0.00020788083,0.00007800332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003998631,0.00025829586,0.00045127043,0.00034666652,0.00020363502,0.00008425751,0.0005408122,0.00009623407,0.00028614874],"category_scores_gemma":[0.000053849977,0.0001947288,0.0000722324,0.000052800562,0.0020690903,0.00032718372,0.00024106745,0.00025765845,0.000010274098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029886916,0.000029372562,0.00019748966,0.000921182,0.000018940236,0.0000427831,0.14857912,0.00023524655,0.0034816398,0.31930187,0.000083322535,0.52707916],"study_design_scores_gemma":[0.0016860119,0.0014968262,0.00006220853,0.013337476,0.00010028267,0.00006996125,0.00032539247,0.025513021,0.14168677,0.74316245,0.06884975,0.003709836],"about_ca_topic_score_codex":0.00016826634,"about_ca_topic_score_gemma":0.00017437011,"teacher_disagreement_score":0.96287125,"about_ca_system_score_codex":0.000069035945,"about_ca_system_score_gemma":0.00020010845,"threshold_uncertainty_score":0.79408103},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004292204,0.00006749996,0.9917472,0.0010345633,0.0014697935,0.00042985068,0.0000013586084,0.000067157125,0.000890356],"genre_scores_gemma":[0.978034,0.000037601116,0.021462396,0.00021532062,0.00018886477,0.000029162442,0.0000014428606,0.000013876038,0.000017299977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978844,0.00011746135,0.00044175005,0.00077563844,0.00048449676,0.00029628162],"domain_scores_gemma":[0.99804455,0.0006868702,0.00038344337,0.00068614655,0.00017570207,0.000023297316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011618015,0.0003008269,0.00028248993,0.0009198975,0.00018721404,0.00016756056,0.0010717555,0.00017273126,0.0000058610854],"category_scores_gemma":[0.00009039161,0.00020431244,0.000044795743,0.00041266228,0.00050086173,0.0011586375,0.00037482602,0.0007309985,0.0000051119023],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042675074,0.00005240651,0.00018105679,0.000042658565,0.000018531595,0.00006317022,0.0056266356,0.009552778,0.0038390518,0.0690677,0.0000056411095,0.91150767],"study_design_scores_gemma":[0.001673384,0.001876621,0.0074989307,0.0051316884,0.000035789646,0.0012560941,0.00003081213,0.58640856,0.07471382,0.3179104,0.0014486436,0.0020152582],"about_ca_topic_score_codex":0.000014962583,"about_ca_topic_score_gemma":0.000053160114,"teacher_disagreement_score":0.9737418,"about_ca_system_score_codex":0.00027760223,"about_ca_system_score_gemma":0.000077861914,"threshold_uncertainty_score":0.83316195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036212914,0.0002171573,0.9918798,0.00036383054,0.00096142956,0.0004904948,0.000053879874,0.000033879314,0.005963272],"genre_scores_gemma":[0.627377,0.000121728976,0.366633,0.0023454349,0.0006359546,0.000063649495,0.0000252972,0.000086082386,0.002711872],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973843,0.000042732514,0.00047869308,0.0010768704,0.0005059868,0.0005114311],"domain_scores_gemma":[0.9962503,0.0014477262,0.00039034878,0.0009904362,0.0008322671,0.00008895256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010145599,0.00040089965,0.000541627,0.0005979745,0.00011759609,0.0001360081,0.0026964815,0.0002538006,0.00001800627],"category_scores_gemma":[0.00026451726,0.00030868157,0.00017495775,0.00029833155,0.000581929,0.00056357234,0.0008332924,0.00030274704,0.000018933259],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005747148,0.00007215052,0.0006276319,0.000107952255,0.0000476323,0.000017144115,0.0006998496,0.00007012105,0.0089637125,0.038468994,0.0003883421,0.950479],"study_design_scores_gemma":[0.0013323076,0.0022226458,0.010302334,0.003960923,0.000040063573,0.000082934945,6.805424e-7,0.060072396,0.59077495,0.31559125,0.012472442,0.0031470913],"about_ca_topic_score_codex":0.000052052597,"about_ca_topic_score_gemma":0.000087618195,"teacher_disagreement_score":0.9473319,"about_ca_system_score_codex":0.00017082789,"about_ca_system_score_gemma":0.0004785198,"threshold_uncertainty_score":0.9999365},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008419547,0.00013952344,0.9888235,0.00070402987,0.0020287223,0.0011803191,0.0000033108647,0.00049205666,0.0065443423],"genre_scores_gemma":[0.7987548,0.00001041142,0.19551599,0.00066599686,0.0004173596,0.000059638664,0.000003905285,0.00007350364,0.004498376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99471736,0.00013983036,0.0008810277,0.0020529795,0.0011111681,0.0010976348],"domain_scores_gemma":[0.99464023,0.0008955247,0.000781938,0.0018673338,0.0016988831,0.00011611754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018485364,0.000769627,0.00078935345,0.002279564,0.00048106126,0.0007968373,0.003632405,0.00067167,0.000057646826],"category_scores_gemma":[0.00044321225,0.00063896884,0.00014399929,0.0010848872,0.0007703638,0.0030183895,0.0018590679,0.0011504451,0.00021290922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068268375,0.000085929474,0.000013981783,0.00027556322,0.00009424869,0.0005081578,0.0014489158,0.3951633,0.0014520539,0.3132076,0.000063428335,0.28761855],"study_design_scores_gemma":[0.00031053906,0.00029574835,0.000018600256,0.0010739149,0.000010382991,0.00007327681,0.0000016607175,0.7040722,0.011163117,0.28132635,0.00094541954,0.0007088248],"about_ca_topic_score_codex":0.0000268298,"about_ca_topic_score_gemma":0.0000083370405,"teacher_disagreement_score":0.79867065,"about_ca_system_score_codex":0.002210273,"about_ca_system_score_gemma":0.00085251394,"threshold_uncertainty_score":0.99960613},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025880498,0.0002581085,0.9841796,0.00025678854,0.0007763287,0.00013534927,0.00003218859,0.000036730322,0.014299011],"genre_scores_gemma":[0.8644429,0.0007195359,0.11387029,0.005659847,0.010945875,0.0000064501346,0.0006016672,0.00020860125,0.003544866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978436,0.000002476248,0.00041996088,0.0008146902,0.00065317587,0.00026610334],"domain_scores_gemma":[0.99767995,0.00008825952,0.0004288791,0.0014100834,0.0003804414,0.000012395525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053149456,0.00026999752,0.00031929003,0.00068102765,0.00007989069,0.0002666251,0.0028252213,0.00016250006,0.00016816625],"category_scores_gemma":[0.00008522273,0.00020438089,0.00004191442,0.0004407371,0.00048996316,0.0028135194,0.0020326285,0.0001831787,0.000057681216],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011934635,0.000023331468,0.00023010588,0.00022157414,0.0000118207145,0.0000121894,0.000021959968,0.016826876,0.00006919071,0.09365961,0.00017168865,0.8887397],"study_design_scores_gemma":[0.000078470344,0.000005024332,0.000031240066,0.0007187078,0.000024754925,0.0000031555596,6.626222e-8,0.670941,0.00007905799,0.3181623,0.009673751,0.00028247118],"about_ca_topic_score_codex":0.000063583866,"about_ca_topic_score_gemma":0.0000871052,"teacher_disagreement_score":0.88845724,"about_ca_system_score_codex":0.00004270012,"about_ca_system_score_gemma":0.000109756445,"threshold_uncertainty_score":0.8334411},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009355679,0.00028297503,0.9924383,0.00022415708,0.0024973662,0.0004883578,0.0000098670835,0.00021794246,0.0038316369],"genre_scores_gemma":[0.005345555,0.000102972575,0.99339944,0.0004881304,0.00025467272,0.000017998382,0.0000056230206,0.000035301207,0.00035030668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960114,0.000067857865,0.00056928134,0.0016611421,0.0011117869,0.0005785697],"domain_scores_gemma":[0.99664605,0.00078123494,0.00040868862,0.0016054977,0.00038807731,0.0001704295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012990951,0.000494073,0.0004214377,0.0006847662,0.00026968223,0.00046858174,0.0032845666,0.00042019758,0.0000289758],"category_scores_gemma":[0.00044719983,0.00039781578,0.00011166192,0.00062155916,0.0006136643,0.001353074,0.0010454517,0.0005256679,0.00008226338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069807793,0.000018783092,0.000011401138,0.0000073828355,0.0000045458364,0.0000064709375,0.00022059864,0.05740669,0.00012773635,0.021786356,0.000031354666,0.9203717],"study_design_scores_gemma":[0.00029333754,0.0001448584,0.00003680436,0.00032767528,0.000004375181,0.00002417081,5.817608e-8,0.87701154,0.0034281737,0.11698967,0.0011504759,0.00058883824],"about_ca_topic_score_codex":0.000006281631,"about_ca_topic_score_gemma":0.000007930549,"teacher_disagreement_score":0.9197829,"about_ca_system_score_codex":0.0006112679,"about_ca_system_score_gemma":0.0002918866,"threshold_uncertainty_score":0.99984735},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000057939556,0.00042884,0.97863436,0.0060376753,0.0011098868,0.000329872,0.000078956065,0.00017322005,0.013201424],"genre_scores_gemma":[0.001029099,0.0002651015,0.98587304,0.002106094,0.0008548244,0.000015344518,0.000074865755,0.000058526017,0.009723125],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99643314,0.00003343374,0.00040756934,0.0018520831,0.0007004574,0.000573324],"domain_scores_gemma":[0.99321306,0.0011716168,0.00028549778,0.0050922967,0.000071965325,0.00016556574],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0010617243,0.0003673833,0.00030138087,0.0002339911,0.0009438265,0.0030610862,0.025115302,0.0001691482,0.000026768896],"category_scores_gemma":[0.00009131594,0.00023600223,0.00004769032,0.00050160993,0.0007176307,0.0028142517,0.0230522,0.00044617482,0.00016368444],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020573539,0.0000087644885,0.000008861952,0.0000037466723,0.0000054474776,0.00001147648,0.000109295834,0.00009073387,0.000010390841,0.014838578,0.0026964087,0.9822142],"study_design_scores_gemma":[0.0002095589,0.00006442932,0.000031405605,0.00039500912,0.000005736054,0.000041935873,3.5700816e-7,0.41443262,0.00015218955,0.036656506,0.54752845,0.0004817954],"about_ca_topic_score_codex":0.000010742778,"about_ca_topic_score_gemma":0.000015454558,"teacher_disagreement_score":0.9817324,"about_ca_system_score_codex":0.00007547386,"about_ca_system_score_gemma":0.0006228227,"threshold_uncertainty_score":0.99797386},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000054103493,0.0003776587,0.99436,0.00034773347,0.001231666,0.00017499321,0.000023810671,0.000110312176,0.0033684073],"genre_scores_gemma":[0.24392211,0.00037783413,0.7427259,0.0020591891,0.0010600785,0.000013774788,0.00009552095,0.00011748841,0.009628077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997048,0.00003414206,0.00059578975,0.0009489537,0.0010325358,0.0003405382],"domain_scores_gemma":[0.99761224,0.00028309834,0.00041830077,0.0010738585,0.00049047807,0.0001220244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004066816,0.0003282847,0.0004123687,0.00086822954,0.00016218075,0.00013786963,0.0021294856,0.00021992052,0.00005570249],"category_scores_gemma":[0.0001797589,0.00027038073,0.0001039174,0.00062391185,0.0007039154,0.0008119524,0.001011063,0.00017963846,0.000034693185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060082234,0.00006848905,0.00023982578,0.0000755913,0.000013457859,0.00002024993,0.00075885863,0.003067946,0.00026595153,0.6392103,0.00038189784,0.35589147],"study_design_scores_gemma":[0.0004844678,0.000213952,0.00021955617,0.00081621256,0.000013750257,0.000031409905,2.4196515e-7,0.774726,0.0013086124,0.19454016,0.026830448,0.0008152278],"about_ca_topic_score_codex":0.0000071328195,"about_ca_topic_score_gemma":0.00001595211,"teacher_disagreement_score":0.771658,"about_ca_system_score_codex":0.00032271727,"about_ca_system_score_gemma":0.00054369774,"threshold_uncertainty_score":0.99997485},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031550674,0.00018828739,0.99286914,0.0013309377,0.0032644286,0.0011865975,0.00007899691,0.00026940077,0.00080903986],"genre_scores_gemma":[0.051186863,0.000032416083,0.9435973,0.0017965864,0.001871812,0.000094216906,0.0000504893,0.00010189692,0.0012684212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552876,0.000037356447,0.000832141,0.0015112596,0.0011116163,0.0009788744],"domain_scores_gemma":[0.9964978,0.00059641903,0.00058396533,0.0015762052,0.0005135984,0.00023200846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010124313,0.00064385316,0.00067821535,0.00070386543,0.00029697726,0.0008689217,0.00388981,0.0004049352,0.0000049413493],"category_scores_gemma":[0.00008817688,0.0005382685,0.00024646416,0.0003416972,0.0002970251,0.0012249077,0.0010302324,0.0004482428,0.00009982057],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020045766,0.00001962261,0.000012495275,0.000046792273,0.000016046299,0.000022868098,0.00018995765,0.006998192,0.00004065591,0.007669649,0.00004885872,0.98493284],"study_design_scores_gemma":[0.0008425541,0.00017955124,0.000027252067,0.0005784426,0.000014243059,0.00010446068,1.1470002e-7,0.9547686,0.00048227565,0.03807054,0.004206683,0.0007252631],"about_ca_topic_score_codex":0.000014099331,"about_ca_topic_score_gemma":0.000040788465,"teacher_disagreement_score":0.9842076,"about_ca_system_score_codex":0.0006279387,"about_ca_system_score_gemma":0.0005124166,"threshold_uncertainty_score":0.99970686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012453846,0.00029613992,0.9829284,0.0012041172,0.0010337032,0.0010549335,0.00010377165,0.00081803405,0.0001070799],"genre_scores_gemma":[0.7162494,0.00009984249,0.28290164,0.00019634547,0.00025269837,0.00022399974,0.000029835079,0.00004552967,7.193488e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763626,0.00007147142,0.00043133533,0.0008388557,0.00039351,0.0006285493],"domain_scores_gemma":[0.9967517,0.00083031505,0.00013364255,0.001979467,0.00017781366,0.00012701991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000602349,0.0004570019,0.0004561769,0.00052260497,0.0001613497,0.00029512882,0.0034218393,0.00032686422,0.000019323117],"category_scores_gemma":[0.00032820125,0.00040431094,0.00014674698,0.00051944255,0.0004473356,0.00030392464,0.0023483974,0.0008554965,0.000009691493],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014537823,0.0000715011,0.00041892374,0.0004017726,0.00004709487,0.000009434229,0.0069347057,0.05904892,0.0050003887,0.00043427694,0.0007867866,0.92683166],"study_design_scores_gemma":[0.00043685254,0.0000982218,0.0021483924,0.0016561988,0.000014147822,0.00001799945,0.00000115634,0.8191078,0.116072394,0.054710142,0.0045548277,0.0011819216],"about_ca_topic_score_codex":0.000014083277,"about_ca_topic_score_gemma":0.00001445671,"teacher_disagreement_score":0.92564976,"about_ca_system_score_codex":0.0005141771,"about_ca_system_score_gemma":0.00022478038,"threshold_uncertainty_score":0.99984086},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000080425625,0.00054882246,0.98952323,0.000058709178,0.0023981913,0.00034334228,0.00012955327,0.0015645666,0.005425531],"genre_scores_gemma":[0.950135,0.0013269628,0.04072558,0.00054328534,0.001380023,0.000093281524,0.00008802538,0.0001536946,0.00555418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986858,0.000017954922,0.0002125101,0.00055896206,0.00022293511,0.00030188257],"domain_scores_gemma":[0.9990282,0.00012447921,0.00003299642,0.00070372294,0.000029229386,0.000081389866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031970782,0.00023797518,0.00023399264,0.00041585419,0.00009916582,0.00013825452,0.00077542075,0.00016432487,0.000006450291],"category_scores_gemma":[0.000006254168,0.00019790641,0.000027093243,0.00018868694,0.00015243463,0.00021156282,0.00010870586,0.00032431196,0.000018793591],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005055417,0.00005909114,0.0000046460486,0.00031382038,0.00003155417,0.000010509203,0.0005451895,0.02773191,0.000052677868,0.00018458457,0.018415453,0.9526455],"study_design_scores_gemma":[0.0002327059,0.00004557107,0.0000127536005,0.0006012369,0.000011825834,0.000009201842,4.270749e-7,0.8900451,0.00011525314,0.00021713783,0.1084609,0.00024786158],"about_ca_topic_score_codex":0.0000014142491,"about_ca_topic_score_gemma":0.00006282812,"teacher_disagreement_score":0.95239764,"about_ca_system_score_codex":0.00019884195,"about_ca_system_score_gemma":0.000077602104,"threshold_uncertainty_score":0.80703896},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017669784,0.000171619,0.980533,0.0003621967,0.00065717404,0.00024948883,0.000020784739,0.000054791057,0.00028115217],"genre_scores_gemma":[0.91893375,0.00006010391,0.08068597,0.000101431724,0.00013873795,0.0000036001663,0.000006376249,0.000015092044,0.000054954406],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971258,0.000037277445,0.0005961794,0.0010896713,0.000718701,0.0004323431],"domain_scores_gemma":[0.9978211,0.00045375395,0.0003521261,0.0009770074,0.00025821113,0.00013781339],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040597725,0.00037340482,0.00054602453,0.001042833,0.0002125264,0.0002788743,0.0015085684,0.00018640446,0.000048921993],"category_scores_gemma":[0.00006408989,0.00029356015,0.00015863377,0.00065780367,0.0007336063,0.00040655973,0.00084185257,0.00028420275,0.0000031698119],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002322103,0.00009169099,0.0010312462,0.00007523529,0.00011484181,0.000028748727,0.0021910782,0.00034513377,0.01043636,0.115169436,0.000016131971,0.8704769],"study_design_scores_gemma":[0.0021694845,0.00048073524,0.0054096114,0.0005709945,0.000104909726,0.00006450765,0.0000012760433,0.4397228,0.012633596,0.5363829,0.00083314505,0.0016260111],"about_ca_topic_score_codex":0.000065720145,"about_ca_topic_score_gemma":0.00018044088,"teacher_disagreement_score":0.90126395,"about_ca_system_score_codex":0.00009586223,"about_ca_system_score_gemma":0.00021344789,"threshold_uncertainty_score":0.99995166},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1725009,0.00041635567,0.7513914,0.024719886,0.0091456,0.007028249,0.00026657156,0.00056437624,0.03396668],"genre_scores_gemma":[0.9932699,0.000032759886,0.0013803303,0.004410706,0.00034097658,0.00003513915,0.000013890833,0.000026035072,0.00049026747],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969192,0.00020609907,0.00038477746,0.00108497,0.0008479345,0.00055699825],"domain_scores_gemma":[0.9987532,0.00054764363,0.00018297887,0.00034408885,0.000081448554,0.00009063221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009891441,0.00034290735,0.0003309558,0.00071864825,0.00026140868,0.00031689845,0.0007479685,0.00033309913,0.0001196956],"category_scores_gemma":[0.00012725165,0.00024858635,0.00008518344,0.0007398954,0.0004632014,0.0003405299,0.00018498453,0.0007182421,0.00022276191],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012731277,0.00022215839,0.0018834326,0.00025046308,0.000009710054,0.00039330652,0.007586788,0.0050507863,0.02748604,0.013850213,0.00042057817,0.9427192],"study_design_scores_gemma":[0.009088997,0.002571609,0.030562358,0.03532487,0.000079509286,0.0020522894,0.00007406283,0.2548859,0.027808808,0.6180782,0.011505392,0.007968052],"about_ca_topic_score_codex":0.000017288534,"about_ca_topic_score_gemma":0.00019550943,"teacher_disagreement_score":0.93475115,"about_ca_system_score_codex":0.00045248852,"about_ca_system_score_gemma":0.0001314849,"threshold_uncertainty_score":0.99999666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000094005714,0.000111342015,0.994213,0.0007508023,0.0015109984,0.0007557374,0.000010276314,0.00019860358,0.002355231],"genre_scores_gemma":[0.828368,0.000010976536,0.16991524,0.0010646532,0.00032009117,0.0000426744,0.000009597272,0.00003195484,0.0002367978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971892,0.000019848738,0.00060284534,0.00088297785,0.000805482,0.000499608],"domain_scores_gemma":[0.9973255,0.00068285223,0.00040787662,0.0010615655,0.00038856055,0.00013367998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094121596,0.00036677704,0.0003170177,0.0009957036,0.00029424133,0.0004131396,0.0018751562,0.00023781887,0.000021818703],"category_scores_gemma":[0.00010772671,0.0002909161,0.00019331084,0.00045717147,0.00036366584,0.00042202845,0.0003790297,0.00023188502,0.0000789718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009206955,0.000018740626,0.0000035516423,0.000034354256,0.0000065706936,0.0000015155772,0.00062428776,0.13864374,0.00008225424,0.5010372,0.000010721188,0.3595279],"study_design_scores_gemma":[0.00037885073,0.00007543413,0.000039942755,0.00015137932,0.000004920905,0.0000036489346,1.0163165e-7,0.7863564,0.0002549766,0.21048254,0.0019298249,0.00032196328],"about_ca_topic_score_codex":9.794899e-7,"about_ca_topic_score_gemma":0.0000023327304,"teacher_disagreement_score":0.828274,"about_ca_system_score_codex":0.00017489758,"about_ca_system_score_gemma":0.000257888,"threshold_uncertainty_score":0.9999543},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035682037,0.00019530866,0.95927984,0.0018908901,0.0019144051,0.00085200014,0.00003125979,0.000138337,0.000015931373],"genre_scores_gemma":[0.56907374,0.000009294407,0.43014756,0.00053531234,0.00012720888,0.000088306755,0.000008805309,0.000009502751,2.5189505e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964759,0.00008542063,0.0004777804,0.0016447573,0.00058112154,0.000735044],"domain_scores_gemma":[0.9967573,0.0006375204,0.00038801678,0.0016440536,0.0004137675,0.00015930746],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013887387,0.00041003045,0.00041447888,0.0010661418,0.0013795974,0.0017732832,0.002440571,0.00022267978,0.000003816861],"category_scores_gemma":[0.0002550775,0.0003944417,0.00018838356,0.0009767949,0.00094934617,0.0006287439,0.002206202,0.00070419174,0.0000012587012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053621956,0.00029247883,0.014265536,0.00029467646,0.00006831947,0.000025281211,0.005193508,0.09014251,0.00060315034,0.014026447,0.00021996723,0.8748145],"study_design_scores_gemma":[0.00051833596,0.0001589496,0.0047980067,0.00019076707,0.000013441116,0.0000051899983,0.0000025529878,0.8273796,0.0006999203,0.1656669,0.00013609263,0.00043027516],"about_ca_topic_score_codex":0.00028730682,"about_ca_topic_score_gemma":0.0011612676,"teacher_disagreement_score":0.8743842,"about_ca_system_score_codex":0.000100744364,"about_ca_system_score_gemma":0.0007975637,"threshold_uncertainty_score":0.9999205},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000076764496,0.00048152223,0.98735094,0.00093029323,0.0023488598,0.00083751295,0.00004546847,0.00024969853,0.007678963],"genre_scores_gemma":[0.4277043,0.000042741965,0.5605527,0.0039377245,0.002009386,0.00016568323,0.00002511815,0.0001700875,0.00539225],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99489003,0.000027977338,0.000621566,0.0021111055,0.0011578053,0.0011914934],"domain_scores_gemma":[0.99648136,0.00048451236,0.00045256253,0.0018054799,0.00051474967,0.00026133077],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009279809,0.00075397495,0.00081486674,0.00060627883,0.00062852213,0.0017747532,0.003638633,0.00037464718,0.000009298088],"category_scores_gemma":[0.000058148387,0.0005423842,0.00019670268,0.0005415625,0.00093129603,0.0010606134,0.0006854129,0.0005067664,0.000036108442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005379525,0.00006650346,0.000091352675,0.0002711392,0.000066750115,0.0001530795,0.0015225471,0.0025211049,0.00028853142,0.390841,0.00016927996,0.6039549],"study_design_scores_gemma":[0.0040153493,0.0015161926,0.00015301722,0.0068382854,0.00006285568,0.0007033518,0.0000019779577,0.34359398,0.0031098987,0.4869078,0.1482511,0.0048461915],"about_ca_topic_score_codex":0.000016118305,"about_ca_topic_score_gemma":0.00012149449,"teacher_disagreement_score":0.5991087,"about_ca_system_score_codex":0.0005115093,"about_ca_system_score_gemma":0.0011969451,"threshold_uncertainty_score":0.99970275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15106331,0.0001370367,0.8474748,0.00069611665,0.00014867622,0.00013675247,6.077334e-7,0.00020829233,0.00013439807],"genre_scores_gemma":[0.5622696,0.0000018333942,0.43693405,0.00075420516,0.00003272709,0.0000018979046,0.0000011658324,0.0000039374067,5.5162155e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812186,0.00007249987,0.0002321256,0.0005645569,0.00047756132,0.00053140847],"domain_scores_gemma":[0.9978998,0.0005193381,0.000103061015,0.0012553299,0.0001087393,0.00011375952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018115182,0.00017380557,0.00017767845,0.00025742745,0.00033228262,0.0003853319,0.00243359,0.00005509874,0.000005831944],"category_scores_gemma":[0.000069567446,0.00013205392,0.000029874147,0.001647157,0.00080351194,0.0007752495,0.00064611045,0.0002634886,0.000013001382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002534344,0.0001953455,0.01071644,0.000017710916,0.0000065622867,0.00007741556,0.005183035,0.006637329,0.0033935118,0.045161225,0.000013539667,0.92857254],"study_design_scores_gemma":[0.0007079377,0.00016646684,0.07150941,0.00010609377,0.0000026615958,0.00012996218,0.000010226775,0.81409734,0.041165724,0.071471475,0.00015303803,0.00047967964],"about_ca_topic_score_codex":0.00015223103,"about_ca_topic_score_gemma":0.00058438146,"teacher_disagreement_score":0.92809284,"about_ca_system_score_codex":0.00010767674,"about_ca_system_score_gemma":0.000106106934,"threshold_uncertainty_score":0.53850025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013135003,0.000133101,0.9961439,0.000054951823,0.00038242087,0.00032811557,0.000015037796,0.00013142158,0.002679735],"genre_scores_gemma":[0.8724405,0.000019390387,0.12643762,0.0004066171,0.0004022223,0.000021099757,0.00001593185,0.000078206554,0.00017837975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987027,0.0000061389997,0.00035600466,0.00036509507,0.00030544208,0.00026462128],"domain_scores_gemma":[0.99906594,0.00018626881,0.00009523468,0.00042000815,0.00017881763,0.000053713786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034340375,0.0002235734,0.00027337682,0.00023231724,0.000057325702,0.00004988489,0.00047620243,0.00014420746,0.000021052992],"category_scores_gemma":[0.000006244603,0.00017754419,0.000023327078,0.00039066307,0.00033531172,0.000095431395,0.00003264112,0.00025070563,0.0000058893897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040156915,0.0000025463905,0.00006986894,0.00009806307,0.000015129857,0.000005504022,0.00020101291,0.9735729,0.00011442277,0.005298764,0.000008169224,0.020609604],"study_design_scores_gemma":[0.0006892639,0.00013348286,0.00052336085,0.0049382756,0.00004196633,0.000059807175,0.0000020535285,0.9792996,0.00060177664,0.009989728,0.002721364,0.0009993168],"about_ca_topic_score_codex":0.00000637233,"about_ca_topic_score_gemma":0.000059148166,"teacher_disagreement_score":0.8723092,"about_ca_system_score_codex":0.00007755452,"about_ca_system_score_gemma":0.00011232852,"threshold_uncertainty_score":0.7240042},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000493552,0.0002881737,0.9939642,0.0007181669,0.0014649993,0.00028911058,0.000008792565,0.00020913841,0.0030080897],"genre_scores_gemma":[0.1514756,0.00041432728,0.81596553,0.021903967,0.0011636926,0.00002328478,0.00010193635,0.00018088461,0.008770799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996123,0.000036221674,0.0006221386,0.0014957921,0.0010294406,0.0006933889],"domain_scores_gemma":[0.99742043,0.00021954159,0.00037461123,0.0015207602,0.00022848957,0.0002361533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006235268,0.00054093683,0.0005090406,0.000916216,0.0002680939,0.0009350371,0.004157516,0.0003043563,0.00011672164],"category_scores_gemma":[0.0000813855,0.00050500623,0.00013973891,0.00070886733,0.000348103,0.0012116273,0.0018281788,0.00062953535,0.0007011091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025117718,0.00009666312,0.000108864246,0.00008998173,0.00003359702,0.00008403047,0.0008974555,0.007870272,0.00045308901,0.14938414,0.0008408815,0.8401385],"study_design_scores_gemma":[0.00027344067,0.00009357748,0.00011278354,0.00050477614,0.000009885076,0.0000481003,1.8621506e-7,0.8337433,0.00084387575,0.13937138,0.0240882,0.0009104902],"about_ca_topic_score_codex":0.000029896317,"about_ca_topic_score_gemma":0.000011924501,"teacher_disagreement_score":0.83922803,"about_ca_system_score_codex":0.00025159644,"about_ca_system_score_gemma":0.00046003566,"threshold_uncertainty_score":0.9997402},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016515747,0.000111571266,0.9641494,0.0018043839,0.0019056835,0.0004743305,0.0000015394817,0.0002321147,0.031304438],"genre_scores_gemma":[0.14248346,0.000015846535,0.84094155,0.008966805,0.0008246832,0.00002451274,0.0000021241071,0.00006522509,0.0066758157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555624,0.000035398956,0.0005370166,0.00172128,0.0012240104,0.00092608447],"domain_scores_gemma":[0.9965563,0.0006584288,0.00025458477,0.0020305703,0.00020926785,0.00029088033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063678325,0.00056197174,0.00050447136,0.0007055333,0.0002554678,0.00065342634,0.0053266184,0.0003012094,0.000018964527],"category_scores_gemma":[0.0002520038,0.0004588383,0.00013804056,0.0006126844,0.0003130552,0.0006648066,0.0022717987,0.0008567329,0.00018465988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005437265,0.000013283285,0.000038944312,0.000029923287,0.000007541171,0.000030199168,0.0006146444,0.5822251,0.00010617662,0.038576346,0.00010152939,0.3782509],"study_design_scores_gemma":[0.00025093587,0.0003373595,0.00007553123,0.00034324842,0.000004783081,0.000070412025,1.1056285e-7,0.9719393,0.0007409066,0.020411154,0.0049265446,0.000899677],"about_ca_topic_score_codex":0.0000073924657,"about_ca_topic_score_gemma":0.000004874717,"teacher_disagreement_score":0.38971427,"about_ca_system_score_codex":0.0002992532,"about_ca_system_score_gemma":0.00031697497,"threshold_uncertainty_score":0.9997863},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000307367,0.000051472452,0.9952835,0.0003646869,0.0005567752,0.001016788,0.000057788784,0.00015877104,0.0025071844],"genre_scores_gemma":[0.024055472,0.000020468744,0.97471845,0.00018691746,0.00036973626,0.00004197029,0.00003089979,0.000047704056,0.000528367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585927,0.00007639584,0.00046469204,0.0016927739,0.001180355,0.0007265117],"domain_scores_gemma":[0.99637794,0.0005545714,0.00034029642,0.0013175085,0.0011181671,0.0002915319],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095863297,0.0004826107,0.0004589194,0.0009604038,0.00032813437,0.00068597164,0.0026025567,0.00030590987,0.000110723166],"category_scores_gemma":[0.00016118592,0.0003673347,0.000072193216,0.00060520304,0.0012720982,0.0013316092,0.00034757098,0.00042077707,0.000019622068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017461101,0.000021574228,0.0000033085623,0.000016635924,0.000009667709,0.000011002073,0.00008201661,0.5400565,0.000025852645,0.026896494,0.0000054497214,0.43285403],"study_design_scores_gemma":[0.00060231047,0.0005863249,0.000019507457,0.00018694774,0.000007793895,0.000047119724,2.7203822e-7,0.96402246,0.00042578287,0.033456113,0.00014286139,0.0005024914],"about_ca_topic_score_codex":0.0000050823783,"about_ca_topic_score_gemma":0.000017198785,"teacher_disagreement_score":0.43235153,"about_ca_system_score_codex":0.0005139817,"about_ca_system_score_gemma":0.0017346661,"threshold_uncertainty_score":0.99987787},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019516281,0.0002620873,0.99452674,0.00093454146,0.0007347235,0.00092450815,0.00009642505,0.00019035318,0.0021354388],"genre_scores_gemma":[0.7619654,0.000013062522,0.23678084,0.00035931548,0.00035856786,0.00009969177,0.000020956613,0.000055102864,0.00034708143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561054,0.000098077915,0.0010209426,0.0017070766,0.0009151205,0.00064827176],"domain_scores_gemma":[0.9955174,0.0011492985,0.00077619863,0.0018333847,0.0005217878,0.00020197155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011384264,0.0005254125,0.00084102916,0.00052052335,0.00030379443,0.00023410852,0.0035776251,0.00033396407,0.000007510856],"category_scores_gemma":[0.00014297239,0.00044701938,0.0001734097,0.00041728435,0.0012291978,0.00067884894,0.0011676353,0.0005414807,0.0000050767885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013603253,0.00036385414,0.00039511215,0.00026785384,0.00008102459,0.000014760473,0.007146353,0.18809554,0.003152423,0.33386162,0.00015561272,0.4663298],"study_design_scores_gemma":[0.00056594744,0.0005449885,0.00025037798,0.0007114228,0.000016811498,0.000019633591,0.000002778786,0.7553621,0.0120512415,0.22871621,0.0011119805,0.0006465249],"about_ca_topic_score_codex":0.000027127293,"about_ca_topic_score_gemma":0.00003872306,"teacher_disagreement_score":0.7617702,"about_ca_system_score_codex":0.00040134828,"about_ca_system_score_gemma":0.00047584626,"threshold_uncertainty_score":0.9997982},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037139348,0.00040988237,0.99098575,0.0011302141,0.002270624,0.0006253677,0.000016044527,0.00045639978,0.004101983],"genre_scores_gemma":[0.039973836,0.00008366766,0.9561701,0.0013932713,0.00065275276,0.000040334733,0.00000759652,0.000048416372,0.0016300158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966616,0.000034063953,0.000553626,0.0014658407,0.0006315014,0.0006533727],"domain_scores_gemma":[0.997373,0.00071821397,0.00037277574,0.0010506327,0.00031786488,0.0001675091],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096261635,0.00049063703,0.00052188936,0.0006706734,0.00028866896,0.0004619216,0.003478845,0.0003419941,0.000015887419],"category_scores_gemma":[0.00014147753,0.00039043845,0.00014272584,0.00029797683,0.00047320666,0.00052592525,0.000849044,0.00040796696,0.00002996737],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044961675,0.000025212592,0.000007912893,0.000035225443,0.000010539007,0.000013203316,0.00027060305,0.009558546,0.00004859563,0.1195825,0.00027683566,0.8701663],"study_design_scores_gemma":[0.0004707493,0.00026445728,0.000016855218,0.0005661608,0.0000071721533,0.00003403491,4.275057e-8,0.7327861,0.0016433541,0.25187755,0.011521968,0.00081151],"about_ca_topic_score_codex":0.0000030531462,"about_ca_topic_score_gemma":0.000011370736,"teacher_disagreement_score":0.86935484,"about_ca_system_score_codex":0.0002056791,"about_ca_system_score_gemma":0.00053134194,"threshold_uncertainty_score":0.99985474},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012147712,0.0008014991,0.9923212,0.002970156,0.0008104784,0.00017172645,0.0000013625943,0.00007096646,0.0016378236],"genre_scores_gemma":[0.926463,0.000017021748,0.07215712,0.00028200122,0.0004396245,0.0000020806062,3.4474147e-7,0.00002095383,0.0006178135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756706,0.000065391556,0.00056925503,0.000834494,0.0004943433,0.0004694398],"domain_scores_gemma":[0.99666274,0.0016165436,0.0005531476,0.0007696479,0.00029861022,0.000099325356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018584676,0.00031268073,0.00040136254,0.0004359199,0.0003225604,0.00024717316,0.0020162333,0.00017501827,0.000009208088],"category_scores_gemma":[0.0006549199,0.00018944418,0.00009116753,0.00034825807,0.0005820269,0.00035484432,0.0020249945,0.000748204,0.000007820176],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015042245,0.000015086108,0.0005177795,0.00007613578,0.000011231875,0.000015058684,0.002012237,0.0005451203,0.000237293,0.007180562,0.000009989483,0.989378],"study_design_scores_gemma":[0.00024610112,0.00016870079,0.0008727475,0.0042429604,0.000014597919,0.00009676924,0.0000025643267,0.87021923,0.0019684222,0.1212628,0.0003102952,0.0005948091],"about_ca_topic_score_codex":0.0000048375737,"about_ca_topic_score_gemma":0.00003625155,"teacher_disagreement_score":0.9887832,"about_ca_system_score_codex":0.0000777952,"about_ca_system_score_gemma":0.00046148588,"threshold_uncertainty_score":0.772531},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025610864,0.00024323257,0.9960556,0.0003445507,0.0008556652,0.00033462574,0.00001010112,0.00015639227,0.001743705],"genre_scores_gemma":[0.608978,0.000003878409,0.3903105,0.0005534479,0.00010264656,0.000006502706,0.000003474524,0.000017122866,0.000024474566],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680763,0.000039465074,0.0005936624,0.0011755025,0.00091921847,0.0004645191],"domain_scores_gemma":[0.9964764,0.0010648617,0.00033225096,0.0017471702,0.00024389455,0.00013538849],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011047038,0.00039574786,0.0005086022,0.00069180457,0.00015370338,0.000185091,0.0032186124,0.00026204617,0.00006235359],"category_scores_gemma":[0.00019171242,0.00035968272,0.00019562177,0.0006778736,0.00096433377,0.00037345532,0.0005400831,0.0004875023,0.00002093407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067098863,0.00011429935,0.000078441444,0.00009607428,0.000011122023,0.000032460553,0.00057217287,0.20471542,0.00063183723,0.3271617,0.0000034903585,0.46657628],"study_design_scores_gemma":[0.00028144897,0.00014026252,0.00023741326,0.00032943976,0.0000063617704,0.0000058146275,7.1719604e-8,0.44914466,0.0059079495,0.54347944,0.00007263776,0.00039449616],"about_ca_topic_score_codex":0.00003393004,"about_ca_topic_score_gemma":0.00004426591,"teacher_disagreement_score":0.60872185,"about_ca_system_score_codex":0.00036977488,"about_ca_system_score_gemma":0.001549125,"threshold_uncertainty_score":0.9998855},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000086562664,0.00080666546,0.98208994,0.00043399775,0.0017256879,0.00034402267,0.000016580112,0.00024056103,0.014255977],"genre_scores_gemma":[0.3813358,0.00033197895,0.615217,0.0006102517,0.0010377902,0.000021985448,0.000013203727,0.000070757065,0.001361243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959599,0.000051340776,0.00055384624,0.0019999233,0.0006420191,0.0007929726],"domain_scores_gemma":[0.9966357,0.00095812767,0.00026784168,0.0016104142,0.00023381182,0.00029412142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011023725,0.0005875834,0.00059001986,0.0005987398,0.0005199547,0.00075342605,0.0027552675,0.00033532287,0.000048449147],"category_scores_gemma":[0.00037897128,0.00046380365,0.0001159275,0.00044824326,0.0009965801,0.0012826438,0.0020937973,0.00064750225,0.000045201607],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005515962,0.00005298674,0.0003157448,0.00008036246,0.000019198016,0.00008810873,0.0013635237,0.0051820977,0.00032919267,0.14609705,0.000026360483,0.84643984],"study_design_scores_gemma":[0.0006158914,0.00025872214,0.0012834,0.00108529,0.000034749864,0.000372998,8.2705037e-7,0.66732514,0.0010438359,0.3204019,0.0055949,0.0019823664],"about_ca_topic_score_codex":0.000014142099,"about_ca_topic_score_gemma":0.00010422537,"teacher_disagreement_score":0.8444575,"about_ca_system_score_codex":0.00028905724,"about_ca_system_score_gemma":0.00045680586,"threshold_uncertainty_score":0.99978137},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013027074,0.00018052809,0.9928144,0.00051401387,0.0023369456,0.00025188073,0.0000018880119,0.00011330344,0.0024843079],"genre_scores_gemma":[0.54625326,0.000012211949,0.45194623,0.000781934,0.0008432323,0.0000032089822,0.000001706395,0.000029938108,0.00012826851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692404,0.00004375859,0.00060765404,0.0012227936,0.0006016508,0.00060007797],"domain_scores_gemma":[0.9983257,0.00040447045,0.00031899445,0.0007080742,0.00011912351,0.00012365422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007784192,0.0004099604,0.00041783974,0.0011594053,0.00015371997,0.00037401597,0.0017498911,0.00023102427,0.000012685106],"category_scores_gemma":[0.00009137317,0.00035418768,0.00009598596,0.000584205,0.00029067878,0.0009174619,0.0011031273,0.0005068275,0.0000394351],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069060993,0.000020104488,0.00022920732,0.000023469322,0.00000516508,0.00007511971,0.0010641284,0.016949056,0.0010631228,0.037806235,0.0000043949385,0.9427531],"study_design_scores_gemma":[0.00023570492,0.000046308916,0.00021152111,0.00075347617,0.0000022609197,0.000043227396,9.5397596e-8,0.7497101,0.00030107025,0.24812311,0.00016181718,0.0004113075],"about_ca_topic_score_codex":0.000043240732,"about_ca_topic_score_gemma":0.00011190895,"teacher_disagreement_score":0.9423418,"about_ca_system_score_codex":0.00045714917,"about_ca_system_score_gemma":0.0004787446,"threshold_uncertainty_score":0.999891},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02225667,0.00072234485,0.9726558,0.0019037542,0.0016413684,0.00051781966,0.000010374439,0.00024065094,0.00005123824],"genre_scores_gemma":[0.7137004,0.00003292946,0.28554288,0.0004869217,0.00018528075,0.000028005488,0.0000011669533,0.000019356865,0.0000030907902],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944999,0.00028904172,0.00047574425,0.002426162,0.0011363223,0.0011728287],"domain_scores_gemma":[0.9950576,0.0008205237,0.00022779433,0.003202302,0.0003189903,0.00037281698],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0017758531,0.0005457454,0.0005587042,0.00097541395,0.00030275824,0.00086411217,0.0070684426,0.00032306658,0.0000072162247],"category_scores_gemma":[0.00037972297,0.00042872792,0.000099738245,0.0018373637,0.0012838745,0.000899397,0.013164513,0.001153165,0.0000304258],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030196114,0.00009514421,0.004270655,0.00013539549,0.000025782652,0.00017798843,0.002445685,0.040033918,0.0037299227,0.008297208,0.00003367449,0.94072443],"study_design_scores_gemma":[0.0003040738,0.00009914588,0.0012163499,0.00021800384,0.0000019603194,0.00004545796,2.8142713e-7,0.39794624,0.011489548,0.58804774,0.00006927,0.0005619445],"about_ca_topic_score_codex":0.00003327685,"about_ca_topic_score_gemma":0.00005339971,"teacher_disagreement_score":0.9401625,"about_ca_system_score_codex":0.00027697365,"about_ca_system_score_gemma":0.0006822347,"threshold_uncertainty_score":0.9998165},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027423312,0.000030571613,0.996064,0.0001391993,0.00024008268,0.00019335521,0.00016877404,0.000050622246,0.00037103216],"genre_scores_gemma":[0.41749343,0.0000066079633,0.580996,0.0010846097,0.00016232264,0.000005459935,0.00016832296,0.000021304826,0.000061971376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981436,0.000026825737,0.00033796445,0.00080049405,0.0004427993,0.00024832442],"domain_scores_gemma":[0.9985714,0.00026134436,0.00027229136,0.00056673103,0.00021864077,0.00010958668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000428561,0.0002446652,0.00024440163,0.0005331933,0.00019606373,0.00030778442,0.00077013177,0.0001253332,0.000011052686],"category_scores_gemma":[0.000052743133,0.00020586273,0.000025753414,0.00023620226,0.0004345227,0.0010497617,0.00027292612,0.000199123,0.0000063290263],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008440273,0.000029784258,0.000016852138,0.000037316702,0.0000044065064,0.000018132974,0.00020567467,0.016469833,0.0066049807,0.0008023264,0.000017965045,0.9757843],"study_design_scores_gemma":[0.00035692428,0.00016526377,0.000063355044,0.00028980168,0.0000063176612,0.000018868557,6.611849e-8,0.9303735,0.013338893,0.055081226,0.00004937503,0.0002564159],"about_ca_topic_score_codex":0.000016072063,"about_ca_topic_score_gemma":0.000042202326,"teacher_disagreement_score":0.9755279,"about_ca_system_score_codex":0.00006328352,"about_ca_system_score_gemma":0.00028336924,"threshold_uncertainty_score":0.83948386},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015217884,0.0001258765,0.9921907,0.00025206903,0.0010197253,0.0011262891,0.000024470197,0.00043042656,0.0048152236],"genre_scores_gemma":[0.053494815,0.000014016882,0.94552076,0.00023773625,0.0003860463,0.000055245826,0.0000087419385,0.0000939537,0.0001886978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745333,0.000024642692,0.00065635523,0.0007546999,0.00042600872,0.00068498304],"domain_scores_gemma":[0.9978265,0.0010764713,0.00014738095,0.00048744565,0.00028955925,0.00017261761],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010734976,0.00049107807,0.00055437715,0.00045248817,0.00012215806,0.0002498693,0.0007137294,0.0003986834,0.000059362857],"category_scores_gemma":[0.0003473969,0.00041011348,0.00013079651,0.0002565069,0.00097074616,0.00017496513,0.0001376175,0.00054556475,0.000012686646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032765383,0.00000816671,0.000012626937,0.0001580169,0.00002360511,0.0000068808663,0.0002497373,0.22013673,0.0004720293,0.01293835,0.00000605345,0.76598454],"study_design_scores_gemma":[0.000521154,0.00013339426,0.0000042021757,0.0008454445,0.000019564197,0.000037169648,5.060511e-7,0.9586427,0.001033059,0.035723574,0.002312704,0.00072652684],"about_ca_topic_score_codex":0.000001045172,"about_ca_topic_score_gemma":0.000007768117,"teacher_disagreement_score":0.765258,"about_ca_system_score_codex":0.00028631472,"about_ca_system_score_gemma":0.00030435243,"threshold_uncertainty_score":0.9998351},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034386914,0.00017025734,0.9936809,0.000005460709,0.00047247336,0.00015125365,0.00000664402,0.00009854203,0.001975771],"genre_scores_gemma":[0.985548,0.000044393237,0.014072904,0.000019079185,0.00022845251,5.9536393e-7,0.0000025057052,0.000035248515,0.000048782847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985608,0.000011619626,0.00042796205,0.0003713039,0.00028857155,0.00033973635],"domain_scores_gemma":[0.9987685,0.0005125541,0.00018991856,0.00036965398,0.00010943246,0.000049925955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034007314,0.00025919662,0.0004193532,0.00025117456,0.000054943117,0.000014298805,0.00041199592,0.00017928732,0.000012199879],"category_scores_gemma":[0.0000211391,0.00022608181,0.00008187652,0.0001781658,0.00015767239,0.00024539235,0.00019129399,0.00028158905,0.0000021107167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004920204,0.0000027068281,0.0000024019434,0.0000491896,0.0000046347714,0.000004660152,0.00008547064,0.91059357,0.002737894,0.00051396433,3.157813e-7,0.08600026],"study_design_scores_gemma":[0.00014193171,0.0000347725,0.0000062882013,0.00072464964,0.0000056583663,0.0000026417936,3.3385692e-8,0.9600933,0.011407321,0.02735321,0.000016775837,0.00021336843],"about_ca_topic_score_codex":9.171986e-7,"about_ca_topic_score_gemma":0.000002572957,"teacher_disagreement_score":0.98210937,"about_ca_system_score_codex":0.00007468018,"about_ca_system_score_gemma":0.000031474552,"threshold_uncertainty_score":0.92193484},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002702173,0.00012204411,0.9932436,0.0012218247,0.001326861,0.00051013427,0.000017638044,0.000027350457,0.0032603724],"genre_scores_gemma":[0.9468789,0.00001667409,0.050768137,0.0013488465,0.00032957504,0.000025657933,0.000016323713,0.000029066083,0.0005868066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976107,0.000026727,0.00040818492,0.001083264,0.00039816918,0.00047296702],"domain_scores_gemma":[0.9985635,0.00039763024,0.00019893747,0.00054912246,0.00022746486,0.00006330457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000438078,0.00036396662,0.00035997204,0.0007980336,0.00011997924,0.00023196956,0.001427166,0.0001524088,0.000033245742],"category_scores_gemma":[0.000044111766,0.00030506705,0.00012080435,0.00019083427,0.00023038755,0.0011286155,0.00026315765,0.00032358684,0.00004909581],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011720048,0.000097985314,0.000044395376,0.00013433375,0.000037562077,0.000102595106,0.0045629027,0.016827349,0.01483865,0.098594636,0.00016680219,0.8644756],"study_design_scores_gemma":[0.0008863156,0.00048755086,0.00035362094,0.0013971595,0.000011508607,0.0000667626,8.340092e-7,0.5798298,0.066359855,0.34822428,0.0013777936,0.0010044783],"about_ca_topic_score_codex":0.000011723428,"about_ca_topic_score_gemma":0.00003942298,"teacher_disagreement_score":0.9466087,"about_ca_system_score_codex":0.0004109485,"about_ca_system_score_gemma":0.00024221242,"threshold_uncertainty_score":0.99994016},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006905376,0.00064525695,0.9881265,0.00041175148,0.0023672334,0.00044002125,0.00004470763,0.0001027272,0.000956389],"genre_scores_gemma":[0.89251816,0.000044733133,0.106334046,0.00021842093,0.0006971131,0.000002109138,0.0000048877614,0.000035716348,0.00014481104],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954076,0.00007509907,0.0014982027,0.0013287315,0.0010059662,0.0006844087],"domain_scores_gemma":[0.99535155,0.0011505018,0.0017078451,0.001245579,0.0003594281,0.0001850962],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010269615,0.0006270643,0.0012816653,0.0013382983,0.00015087095,0.00018278431,0.0035248413,0.00035058567,0.000033933684],"category_scores_gemma":[0.00017030448,0.0005109226,0.00026741944,0.0006519546,0.00089333265,0.0005651012,0.001565248,0.00040055058,0.00001597238],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026166914,0.000034026274,0.00010453497,0.00018297843,0.00003832375,0.000021012607,0.00074459676,0.002488352,0.016307747,0.021537837,0.000015660882,0.9584988],"study_design_scores_gemma":[0.0029966598,0.0011510788,0.008220662,0.0063943374,0.00011877729,0.00026917682,0.0000010956827,0.29852074,0.18147339,0.49585983,0.0011553741,0.0038388716],"about_ca_topic_score_codex":0.00003919498,"about_ca_topic_score_gemma":0.000020324236,"teacher_disagreement_score":0.9546599,"about_ca_system_score_codex":0.0002148976,"about_ca_system_score_gemma":0.0008250847,"threshold_uncertainty_score":0.9997342},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010575025,0.0006160178,0.9787727,0.0027255132,0.0028420906,0.00033909452,0.00001836315,0.00019752666,0.014478144],"genre_scores_gemma":[0.014647745,0.00030317038,0.94542706,0.0025066424,0.0056079575,0.000077496225,0.000012741416,0.00008555319,0.031331662],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99638844,0.000025059584,0.0004991511,0.0015655141,0.00088426546,0.00063758116],"domain_scores_gemma":[0.99697316,0.00054111617,0.0002810959,0.0017515603,0.0002416513,0.00021143878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006677471,0.00044584894,0.00042160647,0.00045482436,0.00045705336,0.00026001938,0.0034859418,0.0002998457,0.0000989929],"category_scores_gemma":[0.00005164418,0.00034162504,0.00014274986,0.00039257284,0.0006938111,0.00060111267,0.0020754554,0.00035333793,0.0006736382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030142696,0.000029698196,0.00001428241,0.000012659949,0.000010793549,0.000033988534,0.00015894124,0.0012113659,0.00056078774,0.28156117,0.0008971617,0.71550614],"study_design_scores_gemma":[0.0004127126,0.0001312127,0.00012721625,0.00043410764,0.000008364802,0.00012341789,2.7487442e-8,0.06550598,0.0021419846,0.79703444,0.13300994,0.0010705935],"about_ca_topic_score_codex":0.000008099685,"about_ca_topic_score_gemma":0.000016241303,"teacher_disagreement_score":0.7144355,"about_ca_system_score_codex":0.0005913619,"about_ca_system_score_gemma":0.0006406288,"threshold_uncertainty_score":0.99990356},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047106895,0.00017480434,0.9958939,0.00067529106,0.0009729473,0.00029903278,0.000016439539,0.00007834865,0.0014181716],"genre_scores_gemma":[0.46522543,0.000070991635,0.5335287,0.00050950865,0.00038959083,0.000011358648,0.0000075676794,0.00003101378,0.00022588445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650973,0.00003707159,0.00078516,0.001262112,0.0008410503,0.00056485296],"domain_scores_gemma":[0.99686843,0.0003861972,0.0005050002,0.0016442513,0.00044281755,0.00015328852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087157346,0.00043647876,0.0006256843,0.0012857208,0.00021294518,0.00024070192,0.0029083907,0.00023445609,0.000081198865],"category_scores_gemma":[0.00007417081,0.00034749386,0.00029035305,0.001034087,0.00065891247,0.00051755225,0.0010022529,0.0004032893,0.0000116327465],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010461788,0.000070116104,0.00009469715,0.00005067775,0.00008779287,0.000023223838,0.0013265288,0.0009950917,0.005746828,0.18355884,0.000016253609,0.80801946],"study_design_scores_gemma":[0.0009022157,0.00038411247,0.0002900646,0.0003674708,0.000060244158,0.00003674692,8.206444e-7,0.5288834,0.0091598295,0.45692495,0.0017727837,0.001217339],"about_ca_topic_score_codex":0.000062913496,"about_ca_topic_score_gemma":0.00015553311,"teacher_disagreement_score":0.80680215,"about_ca_system_score_codex":0.00016389404,"about_ca_system_score_gemma":0.00055381487,"threshold_uncertainty_score":0.9998977},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024236242,0.00021165134,0.9914579,0.0034002513,0.0029014952,0.0008923923,0.0000018774194,0.00042248497,0.0006877307],"genre_scores_gemma":[0.048654143,0.00002387879,0.9476659,0.0027747834,0.00040399705,0.00008486578,8.6557486e-7,0.000053846146,0.00033770938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627864,0.00009313017,0.00069369737,0.0014319108,0.00067302375,0.0008296083],"domain_scores_gemma":[0.9936236,0.0034250284,0.0005948021,0.0016964267,0.00057702244,0.000083111925],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028636635,0.0005641284,0.00048471158,0.0006184043,0.0012817384,0.0012462396,0.0045651724,0.0006925876,0.000003353511],"category_scores_gemma":[0.00077054044,0.00045032048,0.00013437045,0.0006553372,0.0011051899,0.00036047754,0.0008611571,0.0017536422,0.000031531996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012819761,0.000017804825,0.000004083049,0.000027388545,0.000017255648,0.00001676749,0.0011983548,0.0037559855,0.00012480785,0.88631314,0.00007808989,0.10843348],"study_design_scores_gemma":[0.00012180084,0.0003417736,0.0000016390591,0.0005263518,0.00000665244,0.00013106922,7.383992e-7,0.3494728,0.005348288,0.6387914,0.0048483014,0.00040922276],"about_ca_topic_score_codex":0.0000037844593,"about_ca_topic_score_gemma":0.000019290339,"teacher_disagreement_score":0.3457168,"about_ca_system_score_codex":0.00041872627,"about_ca_system_score_gemma":0.0006658297,"threshold_uncertainty_score":0.99979484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009839959,0.000056291174,0.99506575,0.0000060640773,0.0005643615,0.0004405862,0.000075688535,0.000054917036,0.0036379658],"genre_scores_gemma":[0.7235875,0.000010917753,0.27584338,0.000020310978,0.00035371567,0.000023152717,0.000053245385,0.000025119629,0.000082665494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895865,0.0000061260516,0.00030680915,0.0003218554,0.00019915093,0.0002073902],"domain_scores_gemma":[0.99945396,0.00004163181,0.00009300101,0.00029873633,0.00006840591,0.00004426063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035903946,0.0001790566,0.00023752778,0.00012362529,0.00004391239,0.000027768116,0.00031279188,0.00013211904,0.00000363698],"category_scores_gemma":[0.0000035391938,0.00015621538,0.000049579914,0.0000669682,0.00012368338,0.0000818602,0.000017267283,0.00012056074,4.835968e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009613847,0.000012046175,0.000021293128,0.0015256065,0.000023408045,0.0000062873455,0.00026206317,0.6769076,0.000025251422,0.054605324,0.000026456988,0.26657504],"study_design_scores_gemma":[0.00017824837,0.000063076426,0.00028763976,0.0006765063,0.000031358133,0.000004894388,2.8760476e-7,0.9828596,0.00016459665,0.014925663,0.0005319013,0.00027623656],"about_ca_topic_score_codex":0.0000069512485,"about_ca_topic_score_gemma":0.00003807336,"teacher_disagreement_score":0.7234891,"about_ca_system_score_codex":0.00011843544,"about_ca_system_score_gemma":0.000019197798,"threshold_uncertainty_score":0.6370278},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24159124,0.0051789274,0.61889875,0.03802211,0.02181293,0.002583521,0.00021994325,0.00078880496,0.070903786],"genre_scores_gemma":[0.98540634,0.00076725194,0.00657423,0.00010870456,0.0019368527,0.000024001127,0.000025259185,0.000040838804,0.00511652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963958,0.0004074083,0.00065240473,0.0007881294,0.0012768296,0.00047937332],"domain_scores_gemma":[0.99702066,0.0011287266,0.00043809958,0.00078645843,0.000452448,0.00017360962],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011112574,0.00031472152,0.0003403481,0.00060485315,0.0017912962,0.000163148,0.0018256397,0.0005279091,0.0011562275],"category_scores_gemma":[0.0011066153,0.00025802027,0.00015174937,0.00056683965,0.0007051574,0.0010576644,0.0006321814,0.00058767153,0.000086716325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003273775,0.00029056612,0.0023505546,0.000030967964,0.000113308386,0.0000501865,0.17788951,0.00023339191,0.0029898002,0.42938995,0.0018116465,0.38452274],"study_design_scores_gemma":[0.00044787605,0.000032045093,0.04223319,0.00045250604,0.000029119214,0.0000013289844,0.000030608462,0.000646792,0.00017504078,0.9227276,0.03202931,0.0011945702],"about_ca_topic_score_codex":0.00013782579,"about_ca_topic_score_gemma":0.0019097883,"teacher_disagreement_score":0.74381506,"about_ca_system_score_codex":0.00042427742,"about_ca_system_score_gemma":0.0008041599,"threshold_uncertainty_score":0.9999872},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029762643,0.0007032218,0.99144787,0.00081681204,0.0028981746,0.00046741022,0.000002623396,0.00022424666,0.0034098567],"genre_scores_gemma":[0.039012555,0.00014773096,0.9574563,0.0026422795,0.0004870951,0.00002100764,0.000002617441,0.000039916984,0.00019052504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959021,0.00010817835,0.00061235443,0.0013369207,0.0012586003,0.0007818526],"domain_scores_gemma":[0.9958971,0.0005889632,0.00045864368,0.0026497943,0.00025394658,0.00015154062],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0034036147,0.00053856475,0.000470213,0.0006434672,0.00057778286,0.0008184308,0.006611824,0.00033684468,0.000016483504],"category_scores_gemma":[0.00025351904,0.0003946326,0.0001678416,0.0007385525,0.00068470644,0.00075801,0.0020329251,0.0009907258,0.00010520772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016536842,0.0000044214303,9.640179e-7,0.000015121486,0.0000043106884,0.000006296187,0.00040311163,0.0017418776,0.000069074136,0.39989763,0.000009415857,0.5978461],"study_design_scores_gemma":[0.00013692089,0.00012885513,0.000026595542,0.00017166535,0.000008568452,0.000088429486,2.2395929e-7,0.57104015,0.010301082,0.41013017,0.0074311155,0.0005362217],"about_ca_topic_score_codex":0.000015825906,"about_ca_topic_score_gemma":0.000020827987,"teacher_disagreement_score":0.5973099,"about_ca_system_score_codex":0.0003140533,"about_ca_system_score_gemma":0.00031956926,"threshold_uncertainty_score":0.9998506},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009573046,0.00036514262,0.9938658,0.00008598886,0.0020834014,0.0006902117,0.000039561586,0.00037044316,0.0015421874],"genre_scores_gemma":[0.9092813,0.000019248158,0.087975,0.00059021765,0.0014110586,0.00009384939,0.00006211497,0.00015168093,0.00041552738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998272,0.000016365846,0.0003064187,0.00054087036,0.00037643343,0.0004879216],"domain_scores_gemma":[0.9986561,0.00058613,0.000100457146,0.0004766286,0.00010726983,0.00007341664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040699416,0.0003580774,0.00031492804,0.00051692635,0.00011327005,0.00019239032,0.00050891214,0.0003199956,0.000024315132],"category_scores_gemma":[0.00011257216,0.00032520463,0.000108377724,0.00020502,0.0001741358,0.00031882362,0.00004399755,0.0004207221,0.000026193604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006815116,0.000004651522,0.000003326586,0.00006136027,0.000007321832,0.0000024607662,0.00012421007,0.6289934,0.0012587443,0.0006698732,0.000059494236,0.36880833],"study_design_scores_gemma":[0.00041240628,0.00020662429,0.000028459606,0.00028128372,0.000011580882,0.000011404641,1.3097232e-7,0.98142856,0.0048367176,0.009122347,0.003220022,0.00044044803],"about_ca_topic_score_codex":0.0000032185105,"about_ca_topic_score_gemma":0.00007291333,"teacher_disagreement_score":0.908324,"about_ca_system_score_codex":0.00086187525,"about_ca_system_score_gemma":0.00017266272,"threshold_uncertainty_score":0.99992},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013446077,0.00025895695,0.99310243,0.004256748,0.0006706205,0.00044195045,0.00000681205,0.00006423876,0.0010638002],"genre_scores_gemma":[0.14374979,0.00043068433,0.8532297,0.0012858158,0.00058574567,0.00011250429,0.000008304872,0.000050894258,0.00054658507],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973464,0.000032902197,0.00062096276,0.00090214884,0.00064729253,0.00045028838],"domain_scores_gemma":[0.99688,0.0013051393,0.00039724546,0.0011556094,0.00016490908,0.00009709116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006161827,0.0002701791,0.00028764128,0.0003947631,0.00025305845,0.00012052009,0.0023399275,0.00014638712,0.000009169531],"category_scores_gemma":[0.0001137878,0.00018452833,0.000073722724,0.00088299165,0.0013694399,0.0004742933,0.000697298,0.00043223106,0.000018303032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005659437,0.000035957557,0.00021125212,0.0000144482165,0.000006533518,0.000023044362,0.00024559366,0.0025150406,0.0027782847,0.18620652,0.00005185246,0.8079058],"study_design_scores_gemma":[0.00048703217,0.00015051232,0.000637396,0.00034221972,0.0000053858616,0.00006340582,5.356878e-7,0.17886804,0.0043834476,0.8112588,0.0032508152,0.00055243156],"about_ca_topic_score_codex":0.000003937726,"about_ca_topic_score_gemma":0.00015870742,"teacher_disagreement_score":0.8073534,"about_ca_system_score_codex":0.00025837455,"about_ca_system_score_gemma":0.00029142483,"threshold_uncertainty_score":0.7524846},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027376593,0.00017885293,0.9941131,0.00038501606,0.0016741618,0.00068790646,0.00015562265,0.00062948966,0.0021731276],"genre_scores_gemma":[0.010568903,0.000024525263,0.98810697,0.00033329113,0.0006764012,0.000018856812,0.000038565428,0.000050593295,0.00018192604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99463755,0.000057711943,0.0006246364,0.0029257045,0.0008859105,0.00086847396],"domain_scores_gemma":[0.9926552,0.0016530203,0.00049184734,0.0046999906,0.00031953162,0.00018036448],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002398325,0.00065437536,0.0006203223,0.0010421142,0.00038218466,0.0010065739,0.010266731,0.00041566824,0.000014261298],"category_scores_gemma":[0.00054206187,0.00055500836,0.00012274804,0.0005006086,0.00038124374,0.0022731172,0.004667825,0.000601152,0.000017309461],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036585063,0.000008784715,0.000011539846,0.000029564191,0.00001200839,0.000013231745,0.00011044056,0.00038229147,0.0005119618,0.004336067,0.000071610106,0.99450886],"study_design_scores_gemma":[0.00022418056,0.00021686632,0.000024910369,0.00073743303,0.000016225114,0.000059399386,1.3182571e-7,0.8636667,0.009212605,0.12205467,0.0030379188,0.0007489315],"about_ca_topic_score_codex":0.000046782607,"about_ca_topic_score_gemma":0.00021984207,"teacher_disagreement_score":0.99375993,"about_ca_system_score_codex":0.00032024024,"about_ca_system_score_gemma":0.00044707482,"threshold_uncertainty_score":0.9996901},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019949413,0.00024546497,0.9935677,0.0034068206,0.0010471344,0.00057490275,0.000014375609,0.00003496184,0.0009091689],"genre_scores_gemma":[0.32509622,0.00012188927,0.6622265,0.008650926,0.0031973405,0.00010259831,0.000035379242,0.000045102588,0.00052405207],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977955,0.0000360056,0.00032969107,0.0008617387,0.00057497574,0.00040205513],"domain_scores_gemma":[0.99770087,0.001493973,0.0001397544,0.00045981602,0.00012717003,0.00007842264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010633935,0.00027798745,0.00027579642,0.0005120435,0.00021105299,0.0003281836,0.0015316793,0.0001830512,0.0000035907037],"category_scores_gemma":[0.00010249422,0.00018881977,0.000055125503,0.00038093684,0.0003004736,0.0003084488,0.00034103479,0.00028599674,0.000006395488],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006967289,0.00001570517,0.000031035772,0.000014622515,0.000004132813,0.00002266634,0.00087211584,0.0053439415,0.00005724461,0.052232303,0.000054470005,0.9413448],"study_design_scores_gemma":[0.0007266205,0.00037839828,0.0010239922,0.00016927555,0.0000075814164,0.0001523488,5.350537e-7,0.48389307,0.00040567585,0.5035559,0.009113798,0.000572831],"about_ca_topic_score_codex":0.000008657304,"about_ca_topic_score_gemma":0.00035560393,"teacher_disagreement_score":0.94077194,"about_ca_system_score_codex":0.00010024615,"about_ca_system_score_gemma":0.00033968603,"threshold_uncertainty_score":0.76998466},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004130433,0.00050195045,0.99585664,0.0014188921,0.00065104687,0.00039947662,0.000073434785,0.000105122905,0.000580407],"genre_scores_gemma":[0.6155182,0.00012124506,0.37506738,0.0032133143,0.0047586914,0.00021266786,0.00008991004,0.000103840226,0.0009146981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970808,0.000020657617,0.00039330576,0.0016127418,0.00040890183,0.00048358267],"domain_scores_gemma":[0.9982453,0.00037707863,0.0002063751,0.00085552793,0.00013746369,0.00017827578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036893567,0.00039868066,0.0003739487,0.00030468157,0.00034131887,0.00063311734,0.0022503627,0.00023038794,0.0000049119503],"category_scores_gemma":[0.000024973473,0.00034054017,0.00006181457,0.0003735748,0.00021036473,0.0006792024,0.0018027966,0.00028604863,0.000042637465],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010120169,0.00001516957,0.00003368626,0.0000065158924,0.0000065592753,0.000004224763,0.0006600094,0.00042126095,0.00015222213,0.0064694006,0.000060354396,0.99216956],"study_design_scores_gemma":[0.00027321567,0.00008461138,0.0009751001,0.00042676643,0.000014271264,0.000012820475,4.649105e-7,0.968761,0.0003174165,0.023283346,0.004962242,0.0008887143],"about_ca_topic_score_codex":0.00003069977,"about_ca_topic_score_gemma":0.00012769975,"teacher_disagreement_score":0.99128085,"about_ca_system_score_codex":0.00017847997,"about_ca_system_score_gemma":0.0001757033,"threshold_uncertainty_score":0.99990463},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028156224,0.00016020122,0.9894815,0.0005755086,0.00056349766,0.0011080891,0.000005611846,0.00008644713,0.0077375555],"genre_scores_gemma":[0.20320791,0.000010303201,0.79496765,0.00041720722,0.0005997602,0.00004185298,0.0000041483618,0.000043318876,0.00070781563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565035,0.00013077694,0.0008876851,0.0014711508,0.0011121903,0.00074786384],"domain_scores_gemma":[0.9968621,0.00049754867,0.0004617025,0.0017535359,0.0002735886,0.00015153053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020069883,0.0005094319,0.0007338865,0.0005557591,0.00014564802,0.00035341358,0.004414176,0.0003452477,0.000008166142],"category_scores_gemma":[0.00007927331,0.00034310232,0.00014100202,0.0008667124,0.0003686658,0.0005642942,0.0010468685,0.0005775843,0.000085431835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008715041,0.000015751673,0.0000112068265,0.000018377024,0.000008565337,0.000005358379,0.0013300992,0.92972636,0.0004203677,0.011425027,0.000035273984,0.056994885],"study_design_scores_gemma":[0.00023843853,0.000082013044,0.00002584484,0.0005277701,0.00000456128,0.000020604566,2.481375e-7,0.9864395,0.00029355066,0.011787149,0.00017273602,0.00040754853],"about_ca_topic_score_codex":0.00003685612,"about_ca_topic_score_gemma":0.00007216921,"teacher_disagreement_score":0.20292635,"about_ca_system_score_codex":0.00028601737,"about_ca_system_score_gemma":0.0006249907,"threshold_uncertainty_score":0.99990207},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011107905,0.00039598776,0.9917497,0.0016603539,0.0020138975,0.00046464824,0.0000173149,0.00026641667,0.003320603],"genre_scores_gemma":[0.2302881,0.0005388083,0.7548739,0.0060581896,0.0027361051,0.000033708046,0.00008385074,0.0002076778,0.00517966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559045,0.000055515102,0.0007291757,0.0017883641,0.0011070507,0.0007294427],"domain_scores_gemma":[0.9966695,0.00046923588,0.00036149638,0.0017312828,0.00058241945,0.00018609254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075779157,0.00058275583,0.000524172,0.00090024725,0.0002571152,0.00046461905,0.0029223817,0.00037220598,0.00008427267],"category_scores_gemma":[0.00025629238,0.00046611397,0.00014446673,0.00078501564,0.0005406103,0.0015035368,0.0011790515,0.00046006165,0.000100265985],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008147416,0.00007198086,0.00014394763,0.000061367246,0.000010570795,0.000058298203,0.0007759752,0.0035705515,0.0010815423,0.035172444,0.000066233115,0.95897895],"study_design_scores_gemma":[0.0007938851,0.00038315097,0.00034529986,0.0009940745,0.00002020505,0.000070378264,3.1027722e-7,0.56006795,0.004486823,0.4249132,0.0063387193,0.0015859791],"about_ca_topic_score_codex":0.000009008678,"about_ca_topic_score_gemma":0.00011228889,"teacher_disagreement_score":0.957393,"about_ca_system_score_codex":0.00038269034,"about_ca_system_score_gemma":0.00071819435,"threshold_uncertainty_score":0.99977905},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020760256,0.000089888854,0.9891956,0.002630179,0.00038725865,0.0002601664,0.000020421276,0.00003392786,0.005306556],"genre_scores_gemma":[0.89737785,0.000017284634,0.09915965,0.002152228,0.0003037728,0.0000024187837,0.000007045935,0.000023179964,0.0009565915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976079,0.000028522472,0.0004774894,0.0006547284,0.00076087605,0.0004705102],"domain_scores_gemma":[0.9988449,0.00011834294,0.00031689138,0.0005038918,0.000028963284,0.00018701414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007991054,0.00026723798,0.0003510389,0.00018161167,0.00017133118,0.000022240936,0.00063647836,0.00024516397,0.00037127067],"category_scores_gemma":[0.000029532413,0.00021370286,0.00007359153,0.00021175109,0.0011036848,0.00031468438,0.0003763189,0.00032268825,0.000110108944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040307197,0.000043420656,0.0028777535,0.00007963527,0.0000039890733,0.0000072576536,0.0013682726,0.6800867,0.000071592294,0.0017364911,0.0003630728,0.31332153],"study_design_scores_gemma":[0.0006976298,0.0005908687,0.0035925356,0.0012948827,0.000018385888,0.000022875945,4.138917e-7,0.7516417,0.0031717082,0.22214729,0.015694203,0.0011275187],"about_ca_topic_score_codex":0.00025146734,"about_ca_topic_score_gemma":0.0007588202,"teacher_disagreement_score":0.8953018,"about_ca_system_score_codex":0.00043886792,"about_ca_system_score_gemma":0.00015762771,"threshold_uncertainty_score":0.871455},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008764337,0.00010992933,0.9822811,0.00044158922,0.00034519105,0.00042038556,0.000068641246,0.000060550214,0.0075083156],"genre_scores_gemma":[0.9972152,0.000013518961,0.0018113515,0.00005881289,0.00033214246,0.000013462463,0.000013410111,0.000009060615,0.00053305685],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760216,0.00007876096,0.00047647333,0.00068734447,0.00078316726,0.00037207952],"domain_scores_gemma":[0.99800265,0.0005551475,0.00024267474,0.0006539905,0.00040886458,0.00013666172],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017946017,0.00020408907,0.00036752518,0.00031494716,0.00085308467,0.00009815435,0.0009869908,0.00026317776,0.00046549333],"category_scores_gemma":[0.0003159243,0.00017733072,0.0001890843,0.00038066207,0.0036498564,0.00016312243,0.00016632913,0.00031816575,0.000017697514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004836243,0.00023280292,0.003718228,0.000056990015,0.000022210028,0.000008947315,0.004742592,0.0012790672,0.0007297459,0.13063797,0.00000786549,0.8585587],"study_design_scores_gemma":[0.0007658286,0.00033793005,0.010218142,0.0017781166,0.00034330183,0.0000032069725,0.000023596602,0.0065105185,0.006235935,0.9651258,0.0064078895,0.0022497487],"about_ca_topic_score_codex":0.0012141576,"about_ca_topic_score_gemma":0.008370625,"teacher_disagreement_score":0.9884508,"about_ca_system_score_codex":0.0004847478,"about_ca_system_score_gemma":0.00073154236,"threshold_uncertainty_score":0.99906164},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018583373,0.0004471622,0.9828732,0.005659648,0.0035600532,0.0005064579,0.000009146894,0.0010393055,0.0057191798],"genre_scores_gemma":[0.14601338,0.000052218984,0.8464524,0.0039681275,0.0011258511,0.00003017706,0.0000021090812,0.00007900512,0.0022767342],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99387413,0.00003251571,0.00071456534,0.0025254202,0.0015115428,0.0013418274],"domain_scores_gemma":[0.99538016,0.0006421845,0.00031569175,0.0030114646,0.00036001223,0.00029046152],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010408993,0.00081581855,0.0007918781,0.0014517088,0.00034857172,0.00081350195,0.009193089,0.00059969706,0.000023406195],"category_scores_gemma":[0.00025434606,0.00064873043,0.0001851194,0.0010255212,0.0008433008,0.0007284199,0.004700736,0.0010615534,0.00036552493],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005200514,0.000015100538,0.000024164488,0.000016539667,0.000012558533,0.00019274467,0.00032866353,0.010813064,0.00080249354,0.026258633,0.00016707799,0.96136373],"study_design_scores_gemma":[0.00061647844,0.00045375645,0.00014856555,0.0019289076,0.000014952182,0.00026056624,3.0247685e-7,0.32080486,0.012922558,0.6300144,0.030225769,0.002608891],"about_ca_topic_score_codex":0.000015896378,"about_ca_topic_score_gemma":0.000069306145,"teacher_disagreement_score":0.9587549,"about_ca_system_score_codex":0.00051786663,"about_ca_system_score_gemma":0.00052732456,"threshold_uncertainty_score":0.9995964},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031254586,0.00009966736,0.9916022,0.0015843465,0.0007294443,0.0006636016,0.000023814697,0.0001372897,0.004847104],"genre_scores_gemma":[0.034535058,0.000019246025,0.9628514,0.0010116665,0.00064912025,0.000047165893,0.000036294536,0.00005478171,0.0007952478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99515426,0.000053706324,0.00072473066,0.0020067245,0.0012117774,0.00084879197],"domain_scores_gemma":[0.9967014,0.00061900617,0.00062669354,0.001433445,0.00040930923,0.00021011438],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020325629,0.0006035953,0.0006692982,0.0007432098,0.0005891186,0.0013060267,0.002480326,0.00028032876,0.00004668225],"category_scores_gemma":[0.000044945424,0.0004563365,0.00023339076,0.00047826645,0.0010264355,0.0009063392,0.0005146039,0.0004194077,0.000038561655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012615074,0.00018384603,0.0014238748,0.00018726943,0.0002643755,0.00013877363,0.0075741312,0.004284807,0.007972567,0.2982933,0.00040415383,0.67914677],"study_design_scores_gemma":[0.0036534546,0.0008736447,0.0013749197,0.0017785429,0.00006670951,0.00011001651,0.000010779996,0.5107473,0.0070179165,0.44511288,0.026094291,0.0031595328],"about_ca_topic_score_codex":0.0000026786429,"about_ca_topic_score_gemma":0.000015169589,"teacher_disagreement_score":0.67598724,"about_ca_system_score_codex":0.00038297297,"about_ca_system_score_gemma":0.0005380712,"threshold_uncertainty_score":0.9997888},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008951389,0.00035260525,0.9969727,0.00028498156,0.0008414779,0.000729461,0.000005470418,0.000278613,0.0004452033],"genre_scores_gemma":[0.086680934,0.000041319137,0.9126462,0.0002146372,0.00012231486,0.000043523454,0.0000033326899,0.000035970636,0.00021180871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647534,0.000030593907,0.00063160324,0.0014400876,0.0007710261,0.00065135956],"domain_scores_gemma":[0.99697757,0.00059441547,0.00065072434,0.0009914042,0.0006702891,0.00011561312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009464217,0.00048257588,0.00053765933,0.0011074056,0.0002576917,0.00023658591,0.0025190515,0.00024962693,0.000010398168],"category_scores_gemma":[0.0002187322,0.00040305714,0.00015631379,0.0006342382,0.00086279423,0.0005391605,0.0009899852,0.00045892925,0.0000055897062],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028449032,0.000037720045,0.000015888201,0.00012315577,0.000017183438,0.000007903204,0.0005745606,0.028787976,0.0053643654,0.019342303,0.0000096927715,0.9456908],"study_design_scores_gemma":[0.0009122101,0.00065060623,0.000016703987,0.0012861066,0.000015816335,0.000022141274,2.9601856e-7,0.4991383,0.04444839,0.45171797,0.00092535815,0.0008660928],"about_ca_topic_score_codex":0.000007857554,"about_ca_topic_score_gemma":0.0000063568687,"teacher_disagreement_score":0.9448247,"about_ca_system_score_codex":0.00030180224,"about_ca_system_score_gemma":0.00042939687,"threshold_uncertainty_score":0.9998421},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000813138,0.00009346227,0.9932949,0.000049930404,0.0016775695,0.00032387688,0.000035342786,0.000062844105,0.0036489284],"genre_scores_gemma":[0.9443022,0.00003433432,0.05434793,0.00005837014,0.00081111334,0.000036929865,0.000021688447,0.000046180663,0.0003412342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990437,0.0000034405891,0.00025509475,0.00028056777,0.00019968978,0.0002175009],"domain_scores_gemma":[0.9994068,0.00007063881,0.0000956348,0.00026539224,0.00012836009,0.000033159104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013672616,0.00018846309,0.00019645123,0.0002590751,0.00006166364,0.000031457083,0.00026960074,0.0001498027,0.000020634672],"category_scores_gemma":[0.000017786238,0.00015501755,0.00006214524,0.00007985647,0.00018268744,0.00014951643,0.00003249917,0.00013942392,0.00000586901],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049753303,0.000003934961,0.0000442729,0.00008778797,0.000017902224,0.0000011407024,0.00037644606,0.029739162,0.057862442,0.0054079792,0.000041715346,0.90641224],"study_design_scores_gemma":[0.001574799,0.00031649903,0.008394666,0.0026518106,0.00008388648,0.000030623276,0.000004182888,0.5332094,0.166701,0.28045,0.0048587173,0.001724472],"about_ca_topic_score_codex":0.0000023437835,"about_ca_topic_score_gemma":0.000009030467,"teacher_disagreement_score":0.9434891,"about_ca_system_score_codex":0.00019118494,"about_ca_system_score_gemma":0.00005663922,"threshold_uncertainty_score":0.63214326},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027988576,0.0005630252,0.99271786,0.0028918926,0.0016395113,0.00055402,0.0000075490198,0.0002341233,0.0013892202],"genre_scores_gemma":[0.014393155,0.000025795394,0.9779178,0.0056640944,0.00086741307,0.000022651664,0.0000032439452,0.00005817972,0.0010476499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648255,0.000013762516,0.0005548678,0.0013822122,0.00074281957,0.00082376495],"domain_scores_gemma":[0.99653155,0.0012554524,0.00036474792,0.0013999736,0.00031230398,0.0001359923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008751881,0.00051086326,0.0004211671,0.00044500982,0.0006658001,0.00062121457,0.0034848196,0.000112146234,0.000014875694],"category_scores_gemma":[0.00029440445,0.00032192678,0.00018088373,0.00033566542,0.0005344718,0.0011023494,0.00152848,0.0005711464,0.000028032306],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003379167,0.0000049231394,0.000033241202,0.000016818463,0.000002871788,0.000015529995,0.0002318992,0.002231412,0.000064692096,0.011535256,0.00005139006,0.9858086],"study_design_scores_gemma":[0.00031693265,0.0000352995,0.00002257185,0.0005413351,0.0000049421983,0.00008431725,3.21148e-7,0.7638446,0.00036699392,0.22584687,0.008439716,0.00049608824],"about_ca_topic_score_codex":0.0000052477117,"about_ca_topic_score_gemma":0.000013700534,"teacher_disagreement_score":0.9853125,"about_ca_system_score_codex":0.0002552655,"about_ca_system_score_gemma":0.0003125065,"threshold_uncertainty_score":0.9999233},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006113047,0.000054286385,0.99834496,0.0002077627,0.00032335837,0.0004961711,0.000015067093,0.00033285483,0.00016441822],"genre_scores_gemma":[0.32010427,0.000016187567,0.67967755,0.00010672401,0.000033459262,0.00002604031,0.000001138565,0.000021627353,0.000012977789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973437,0.0000370747,0.0006096878,0.0008173535,0.0007406249,0.00045156357],"domain_scores_gemma":[0.99827206,0.00019871209,0.00020509951,0.0010327804,0.0001965221,0.00009485209],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083426613,0.0004089138,0.00044990008,0.0014272777,0.000067940906,0.00010299608,0.0021775234,0.0003230515,0.000003910336],"category_scores_gemma":[0.00001552579,0.00036120924,0.000121086385,0.00045715706,0.00021372648,0.0006472139,0.00026365375,0.000489016,0.0000036877445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033241708,0.000013319574,0.0000076522565,0.000037378104,0.0000021776243,0.0000055441274,0.0002519468,0.4725038,0.000662185,0.008633011,4.233262e-7,0.51787925],"study_design_scores_gemma":[0.00020519472,0.00009722424,0.00004382168,0.00059544254,0.000003153731,0.000007530418,9.040113e-9,0.8887758,0.03366592,0.0762001,0.00004977142,0.00035600178],"about_ca_topic_score_codex":0.000020157007,"about_ca_topic_score_gemma":0.000038625247,"teacher_disagreement_score":0.5175232,"about_ca_system_score_codex":0.00042315634,"about_ca_system_score_gemma":0.0005609144,"threshold_uncertainty_score":0.999884},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009437367,0.0021585373,0.9950274,0.00027071027,0.00030306884,0.00052877195,0.0000021585718,0.0001009444,0.0015140239],"genre_scores_gemma":[0.14750983,0.0002062971,0.85132366,0.00034393396,0.00029758993,0.000011369408,0.000002007668,0.00003921088,0.00026609542],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622023,0.00005196938,0.00039216733,0.0011714133,0.0017469598,0.0004172659],"domain_scores_gemma":[0.9973041,0.00028317745,0.0003652637,0.0010150879,0.0008623029,0.00017006727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015900603,0.00044009613,0.00047968948,0.00058697764,0.00012362305,0.00019664649,0.001588844,0.0002540351,0.000021540563],"category_scores_gemma":[0.00020025889,0.00030282733,0.000061892686,0.00054703496,0.00069164555,0.0010588146,0.0006663017,0.00039697686,0.0000017355269],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008207739,0.000008939416,0.000045603767,0.000020545856,0.000010347033,0.000008761503,0.00023129777,0.002553843,0.00019303165,0.0038410237,0.000009037054,0.99306935],"study_design_scores_gemma":[0.0011734212,0.00093392655,0.00048510253,0.002206337,0.000099408,0.00020021072,4.799328e-7,0.40563732,0.021663636,0.5654671,0.0008234036,0.0013096476],"about_ca_topic_score_codex":0.000010551898,"about_ca_topic_score_gemma":0.00006284499,"teacher_disagreement_score":0.9917597,"about_ca_system_score_codex":0.00025154863,"about_ca_system_score_gemma":0.00094508124,"threshold_uncertainty_score":0.99994236},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042447777,0.00022228119,0.99313223,0.0014555601,0.0022097926,0.000782138,0.000059992526,0.0002464859,0.0018490456],"genre_scores_gemma":[0.14413723,0.000040000956,0.85311675,0.001579215,0.000980865,0.00002540765,0.0000437951,0.000050022718,0.000026734164],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995519,0.000050163926,0.000638267,0.0019343517,0.0010133655,0.00084486895],"domain_scores_gemma":[0.9958131,0.0018394606,0.00042234853,0.0011938589,0.00047045178,0.00026078435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011372351,0.00059162313,0.00060409907,0.000809196,0.0004310328,0.0007367202,0.0023325079,0.00043813736,0.000010988342],"category_scores_gemma":[0.0002227927,0.0005054399,0.00023023962,0.0005768882,0.00070087437,0.0013071328,0.0009714216,0.0007336313,0.000036467995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010576514,0.000057377245,0.00003566836,0.00009791892,0.000018506367,0.00004968841,0.0004286336,0.0021971646,0.00011485963,0.391629,0.00010599628,0.6052546],"study_design_scores_gemma":[0.0006012819,0.00022005694,0.00009187927,0.0005578212,0.0000139100275,0.00011094583,1.950397e-7,0.31344327,0.00061616494,0.6814905,0.0020682255,0.0007857271],"about_ca_topic_score_codex":0.0000039662127,"about_ca_topic_score_gemma":0.00007779595,"teacher_disagreement_score":0.6044689,"about_ca_system_score_codex":0.00021375,"about_ca_system_score_gemma":0.00090030313,"threshold_uncertainty_score":0.9997397},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074680126,0.00020422842,0.9633963,0.00054957956,0.002839203,0.00017953127,0.000003590634,0.0009368581,0.031143913],"genre_scores_gemma":[0.96709347,0.00012292426,0.026624605,0.0015871079,0.002402184,0.000010636577,0.000003436901,0.00013834448,0.002017274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875265,0.000008236588,0.00018890026,0.00039889125,0.00036391747,0.00028738918],"domain_scores_gemma":[0.9990754,0.00029467835,0.000052369618,0.0004977695,0.00003727101,0.000042526393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003040023,0.0002613205,0.00017609655,0.00023048629,0.00014008286,0.00007701247,0.00044192205,0.00021563005,0.000049767656],"category_scores_gemma":[0.00003558999,0.00015526949,0.000084076615,0.00013203199,0.00021697747,0.00010976142,0.00008076052,0.00049125176,0.000103362996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005892677,0.000010910803,0.000010589278,0.000046481626,0.000023876517,0.00004472546,0.00022171577,0.16209532,0.0033539555,0.015687251,0.00083020027,0.8176691],"study_design_scores_gemma":[0.00023427537,0.00022319263,0.00018559396,0.0022438725,0.000020765243,0.00008299124,1.6053139e-7,0.8488201,0.0154590905,0.05689105,0.0747331,0.0011058068],"about_ca_topic_score_codex":0.0000017196058,"about_ca_topic_score_gemma":0.0000054797442,"teacher_disagreement_score":0.9663467,"about_ca_system_score_codex":0.0002281469,"about_ca_system_score_gemma":0.00004610396,"threshold_uncertainty_score":0.6331706},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018218937,0.0017020178,0.9894483,0.00044299584,0.0055218632,0.00027683913,0.0000079677575,0.0001971768,0.0022206318],"genre_scores_gemma":[0.3197593,0.00012060368,0.6699928,0.003058131,0.0052029784,0.000015068742,0.000008688896,0.00013057192,0.0017118575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955227,0.00005431291,0.0005500412,0.0016721883,0.0012886296,0.00091217615],"domain_scores_gemma":[0.99742913,0.0004685292,0.00056745677,0.001086214,0.0002806389,0.00016800221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088099035,0.00055975746,0.00045664498,0.00037186797,0.0005803624,0.0004524127,0.0025699157,0.00039978555,0.000032505373],"category_scores_gemma":[0.00003450596,0.00045686687,0.0001302095,0.0005477855,0.00069787505,0.0009862788,0.0014158717,0.00080549903,0.00003297347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025098398,0.000033354798,0.0003762708,0.0000851972,0.000017415216,0.0000827736,0.00028893817,0.24054238,0.0049148086,0.008448323,0.0018768352,0.7433086],"study_design_scores_gemma":[0.00029605662,0.00009904569,0.00002849526,0.000697644,0.0000073513474,0.00009268211,4.6639364e-8,0.9333669,0.0020707694,0.058386825,0.0042415624,0.0007126534],"about_ca_topic_score_codex":0.000019860014,"about_ca_topic_score_gemma":0.000010803973,"teacher_disagreement_score":0.742596,"about_ca_system_score_codex":0.0009644363,"about_ca_system_score_gemma":0.0006078296,"threshold_uncertainty_score":0.9997883},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010919474,0.0006913661,0.99541837,0.00028794684,0.0014354928,0.0003512148,0.0000028840657,0.00011184349,0.0006089325],"genre_scores_gemma":[0.9281548,0.000049420487,0.07125003,0.00016066943,0.00030441032,0.000006948028,0.000001932648,0.000019074621,0.000052712967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964097,0.00005022414,0.00083977316,0.0012817264,0.0007524133,0.0006661237],"domain_scores_gemma":[0.997414,0.00045637443,0.00043756358,0.0013076484,0.0002729969,0.00011139964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015263159,0.00041252308,0.00067465106,0.00090047094,0.00013802099,0.00015527486,0.002422373,0.0004331331,0.000013044114],"category_scores_gemma":[0.00013196525,0.00032045055,0.00015898804,0.0008642734,0.0004353718,0.00079694815,0.0010261387,0.00064195966,0.00001613865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011385854,0.000030906536,0.0043503153,0.00019271468,0.000013891592,0.00003705611,0.00064678496,0.47486836,0.000120945246,0.0043550264,0.000004487185,0.5153681],"study_design_scores_gemma":[0.0002902865,0.00008773319,0.0014311923,0.0023353512,0.0000039538345,0.00001864022,2.0536469e-7,0.972083,0.0002784931,0.022997243,0.00004712218,0.00042682784],"about_ca_topic_score_codex":0.00005401891,"about_ca_topic_score_gemma":0.00016430872,"teacher_disagreement_score":0.92706287,"about_ca_system_score_codex":0.00046112033,"about_ca_system_score_gemma":0.0005176037,"threshold_uncertainty_score":0.9999248},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018142467,0.00003585883,0.9913135,0.0036701178,0.001451143,0.00052533695,0.00006120691,0.00013003983,0.0028109932],"genre_scores_gemma":[0.0076511335,0.000026324358,0.98735064,0.0017343557,0.00074576965,0.000034728244,0.000078701036,0.000027991551,0.0023503269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714404,0.000013509706,0.00043971217,0.0013314708,0.00056329166,0.0005079595],"domain_scores_gemma":[0.99830085,0.00026898124,0.00027358232,0.0008410599,0.00021290322,0.00010262244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000903428,0.00037233258,0.00031869567,0.00052679336,0.00028913817,0.00071462133,0.0024345545,0.00015876425,0.000016567197],"category_scores_gemma":[0.000067114044,0.00030782662,0.00011500531,0.00023579045,0.00019186095,0.0015762363,0.0011800025,0.00025829207,0.000029745719],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037208813,0.000014226937,0.000004397672,0.000017904236,0.000008247989,0.0000034689053,0.00012469612,0.01083928,0.000030069825,0.1558698,0.00011649419,0.8329677],"study_design_scores_gemma":[0.0002326224,0.000050103263,0.0000046663026,0.00011468771,0.000004632408,0.0000034454592,3.064836e-8,0.71426463,0.00006413495,0.28136787,0.003586016,0.0003071797],"about_ca_topic_score_codex":0.0000023776681,"about_ca_topic_score_gemma":0.000022160802,"teacher_disagreement_score":0.8326605,"about_ca_system_score_codex":0.0002622907,"about_ca_system_score_gemma":0.00036768444,"threshold_uncertainty_score":0.99993736},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8730162,0.00060401345,0.119990796,0.0053569716,0.0006663076,0.0002735655,5.5256356e-7,0.00005727126,0.000034316286],"genre_scores_gemma":[0.9968648,0.00003315005,0.0009870988,0.001910485,0.0001948913,0.000003045521,3.265245e-7,0.0000049881774,0.0000012032795],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99865866,0.000113329595,0.00014024631,0.00033940419,0.0004626888,0.0002856632],"domain_scores_gemma":[0.9986164,0.00062234554,0.00003944339,0.0005528936,0.000085182204,0.000083731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013504724,0.0001369526,0.00022023154,0.00012029358,0.00052873034,0.0003301892,0.00019625764,0.000053795524,7.2963996e-7],"category_scores_gemma":[0.00027342277,0.00005987705,0.00010801146,0.0010195449,0.0003336901,0.00010753161,0.000063997075,0.00032674737,0.000003949998],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044592187,0.00004000821,0.078077994,0.000029502438,0.00005107136,0.000021283831,0.0012168176,0.013146132,0.010369197,0.0009960813,0.00007445081,0.89593285],"study_design_scores_gemma":[0.00030507043,0.00021950931,0.957735,0.0002767659,0.000020890968,0.0001353394,0.000045641606,0.029143099,0.009171601,0.00026498002,0.0025128997,0.00016918221],"about_ca_topic_score_codex":0.00002933259,"about_ca_topic_score_gemma":0.0000028513123,"teacher_disagreement_score":0.8957637,"about_ca_system_score_codex":0.00013478659,"about_ca_system_score_gemma":0.00010318456,"threshold_uncertainty_score":0.40666196},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003700211,0.000040256444,0.9870503,0.0036087031,0.0010205407,0.00049906666,0.0000100691195,0.00012732887,0.0076067327],"genre_scores_gemma":[0.05328204,0.000027882657,0.9356926,0.0080666905,0.0009783577,0.0000733351,0.000032752545,0.00004223915,0.0018041142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977675,0.000021396283,0.0005205461,0.0006666511,0.00054642884,0.0004774903],"domain_scores_gemma":[0.99809515,0.00025691872,0.0004686553,0.00078536704,0.00028158556,0.00011229333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010276285,0.0003514211,0.00031690215,0.000555353,0.00031516032,0.0007346149,0.001861769,0.00022066668,0.000018558278],"category_scores_gemma":[0.0000643791,0.00027614718,0.00009109044,0.00028915162,0.00033854932,0.0019883134,0.0005166858,0.0002469205,0.00015019708],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048344336,0.0000058573432,0.000002988229,0.000036998204,0.0000039626566,9.834089e-7,0.0005254543,0.00044428164,0.00048712612,0.040888112,0.00009630738,0.9575031],"study_design_scores_gemma":[0.0006979316,0.00017165713,0.000100419005,0.0007622311,0.000006927426,0.00002324136,4.1109087e-7,0.48616132,0.0027715042,0.46917656,0.039292805,0.0008350192],"about_ca_topic_score_codex":0.0000010644786,"about_ca_topic_score_gemma":0.0000021173964,"teacher_disagreement_score":0.9566681,"about_ca_system_score_codex":0.00031836235,"about_ca_system_score_gemma":0.0005450337,"threshold_uncertainty_score":0.99996907},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081227894,0.00020199634,0.9947646,0.00028979455,0.0020112095,0.00018315154,0.0000031625364,0.00024420425,0.001489571],"genre_scores_gemma":[0.71057034,0.0000128084075,0.28735843,0.0007694427,0.0009913393,0.0000036252231,0.0000010716366,0.000037024573,0.0002558955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959559,0.000068631794,0.0005390402,0.0016915207,0.001012597,0.0007323063],"domain_scores_gemma":[0.99717855,0.00060650776,0.0003558802,0.0014452355,0.00021249782,0.00020130369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013807486,0.00049953535,0.0006288149,0.0018486549,0.0004382369,0.00073764275,0.002191255,0.00041442798,0.000026249056],"category_scores_gemma":[0.00014789861,0.0004134994,0.00032025983,0.0016997537,0.00042435664,0.0006950823,0.0010540956,0.00071372295,0.00004227492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007661019,0.00001793716,0.0004069814,0.00002093401,0.00011457389,0.00014956102,0.00055934134,0.072655104,0.0017878513,0.009425852,0.0000029675114,0.91485125],"study_design_scores_gemma":[0.00017709631,0.000109419605,0.00020579455,0.00022023937,0.00008991525,0.00013706072,7.21731e-8,0.91847605,0.003327478,0.076106,0.0003827665,0.00076810876],"about_ca_topic_score_codex":0.00008194846,"about_ca_topic_score_gemma":0.00020778406,"teacher_disagreement_score":0.9140831,"about_ca_system_score_codex":0.00048946484,"about_ca_system_score_gemma":0.00032071833,"threshold_uncertainty_score":0.9998317},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032597358,0.0017741041,0.9954097,0.00019624604,0.0010545556,0.00023086282,0.0000035108612,0.0000704347,0.00093457167],"genre_scores_gemma":[0.58957756,0.000061044186,0.4092613,0.0007453559,0.00025548565,0.000003443188,0.0000015777886,0.000024601975,0.00006965915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963874,0.00018102406,0.00072550424,0.0011568053,0.0008129784,0.00073625165],"domain_scores_gemma":[0.9968258,0.000941514,0.00056338485,0.0010864636,0.00039458764,0.0001882218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015279793,0.000466191,0.00077702163,0.00041980928,0.0001392355,0.00027452307,0.003128264,0.00033203248,0.000013926138],"category_scores_gemma":[0.000101518504,0.00037213584,0.00015685998,0.00043125762,0.0011025274,0.0009326449,0.00053617416,0.00046343548,0.0000012906502],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021863478,0.00002691906,0.000009474257,0.000021916208,0.000011162488,0.000028147344,0.0012277515,0.041247036,0.0806388,0.0030530868,0.000008119129,0.87370574],"study_design_scores_gemma":[0.00036522016,0.00035353474,0.00001299427,0.00037936817,0.000007106257,0.000046527024,4.3272476e-7,0.7898384,0.1552341,0.05325136,0.00005532096,0.00045566857],"about_ca_topic_score_codex":0.000048666072,"about_ca_topic_score_gemma":0.000020766493,"teacher_disagreement_score":0.87325007,"about_ca_system_score_codex":0.00014111948,"about_ca_system_score_gemma":0.00029658602,"threshold_uncertainty_score":0.99987304},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002663423,0.00024745482,0.9892412,0.0032459553,0.0010014862,0.0002564153,0.00009259911,0.00023298361,0.005415609],"genre_scores_gemma":[0.26184458,0.00018146039,0.72066784,0.005386913,0.002523721,0.00006227748,0.000046048706,0.00010963159,0.009177519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959499,0.00005188556,0.0005143847,0.0017822651,0.001038287,0.00066326756],"domain_scores_gemma":[0.99709845,0.0007438684,0.000327084,0.0012973803,0.0002770516,0.00025619206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005435426,0.00052608683,0.0005396402,0.00054082356,0.0004855628,0.0006731542,0.0026474078,0.00031417664,0.00062765117],"category_scores_gemma":[0.00013190784,0.00038675944,0.00026498837,0.00042403553,0.00059504947,0.0008732326,0.0015121851,0.0006819372,0.00026523008],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015942596,0.0001411497,0.0039905026,0.00011510534,0.00016561609,0.00022960166,0.0032054863,0.0026262272,0.0021350626,0.003552883,0.0013672581,0.9824552],"study_design_scores_gemma":[0.0013053528,0.00020142936,0.0036165202,0.0042370954,0.00010531012,0.000068696994,0.000002015379,0.78355104,0.01159765,0.1785018,0.013745721,0.0030673651],"about_ca_topic_score_codex":0.00009340329,"about_ca_topic_score_gemma":0.00009990836,"teacher_disagreement_score":0.9793878,"about_ca_system_score_codex":0.00021502093,"about_ca_system_score_gemma":0.00031464623,"threshold_uncertainty_score":0.99985844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056027107,0.00022304135,0.9965057,0.00022061245,0.0019291306,0.00043039856,0.000009027282,0.00040343686,0.00022266459],"genre_scores_gemma":[0.10664187,0.00002105299,0.8928037,0.00006532523,0.0002642145,0.000036965666,0.0000013557094,0.000026620737,0.00013884138],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978433,0.000020883708,0.00036879198,0.0009731546,0.0003720833,0.00042173808],"domain_scores_gemma":[0.9966189,0.0021726226,0.0002120797,0.000701418,0.00019338705,0.000101584206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007201928,0.00034740253,0.00036070644,0.00050942844,0.00020221034,0.00022605235,0.0009584215,0.0002051806,0.0000010902962],"category_scores_gemma":[0.00034113092,0.00028998134,0.00007625094,0.00015165735,0.00022764498,0.00063683005,0.00049297116,0.00030551682,0.0000071700965],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035826542,0.0000055172836,0.0000115574185,0.00012205988,0.000009555264,0.000010748553,0.00024454686,0.19106945,0.00030855034,0.060374506,0.0000014212985,0.7478385],"study_design_scores_gemma":[0.00070850545,0.000302952,0.000597593,0.0019537099,0.000023073182,0.00019382397,9.5048057e-7,0.3929181,0.0052149403,0.59545904,0.0012907065,0.001336613],"about_ca_topic_score_codex":0.0000033677954,"about_ca_topic_score_gemma":0.000011582219,"teacher_disagreement_score":0.74650186,"about_ca_system_score_codex":0.0003836628,"about_ca_system_score_gemma":0.00019702043,"threshold_uncertainty_score":0.99995524},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05893051,0.0002267622,0.9387961,0.00017101766,0.0012205163,0.00025768302,0.000007113787,0.000032836942,0.00035746905],"genre_scores_gemma":[0.99388874,0.000024230949,0.0055114026,0.00017571448,0.00019794745,0.0000028503407,3.2344022e-7,0.0000113940905,0.00018737951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976823,0.00006772787,0.00044835688,0.00080741436,0.0007351192,0.00025908262],"domain_scores_gemma":[0.9975937,0.00040958784,0.00043405258,0.0014020362,0.00010626613,0.000054368826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005235151,0.0002673493,0.00037415288,0.00033257925,0.00013075383,0.00006504383,0.0021028523,0.00006840427,0.0000046201844],"category_scores_gemma":[0.000032178326,0.00016374192,0.000068597,0.00022157852,0.00051867135,0.00004373121,0.0034306967,0.00019556723,9.0327956e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009526991,0.00021151839,0.0075967624,0.00015549529,0.000055435048,0.000032008633,0.002744987,0.010586826,0.00014824014,0.043352034,0.000020299018,0.93508685],"study_design_scores_gemma":[0.0075191045,0.004347628,0.0671128,0.015712554,0.00030774839,0.00040629867,0.000022080572,0.78171474,0.015829159,0.09625828,0.006007916,0.0047616614],"about_ca_topic_score_codex":0.0000830113,"about_ca_topic_score_gemma":0.00014051874,"teacher_disagreement_score":0.9349582,"about_ca_system_score_codex":0.000050423587,"about_ca_system_score_gemma":0.00008815329,"threshold_uncertainty_score":0.66772014},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021440258,0.0005163303,0.99549294,0.00016962134,0.0011915154,0.0006160351,0.0000024406672,0.0006301877,0.0011665474],"genre_scores_gemma":[0.14840293,0.0001049177,0.8494686,0.00055202516,0.000922512,0.000033484775,0.000010699651,0.000033245295,0.0004716076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967466,0.000052677464,0.0005426453,0.0014054432,0.00065354246,0.00059910427],"domain_scores_gemma":[0.9974232,0.00041735245,0.00036790903,0.0013286166,0.0002928154,0.00017013632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010792799,0.00044447108,0.0005079685,0.00075848645,0.00053720933,0.0009938068,0.0029538653,0.00040021492,0.0000012895449],"category_scores_gemma":[0.00004015941,0.0004250112,0.00004765765,0.0010359569,0.0005952386,0.00047630892,0.001554403,0.0011597042,0.000014869125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012252647,0.000027105092,0.000110573455,0.0001259983,0.0000062012814,0.000007792781,0.0002712287,0.3275126,0.00003839333,0.011826094,0.00012854309,0.65994424],"study_design_scores_gemma":[0.0001370912,0.00007284653,0.00016249096,0.00026583552,0.000004182426,0.000094538154,6.0926794e-8,0.9854286,0.0003554908,0.010034754,0.0029379083,0.0005062098],"about_ca_topic_score_codex":0.000026458241,"about_ca_topic_score_gemma":0.0000058145433,"teacher_disagreement_score":0.659438,"about_ca_system_score_codex":0.00022298394,"about_ca_system_score_gemma":0.0006913346,"threshold_uncertainty_score":0.9998202},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013474292,0.00012603322,0.9943155,0.00023743826,0.0007221951,0.00043397944,0.00003226358,0.000108847256,0.003889025],"genre_scores_gemma":[0.10611305,0.000021999935,0.8930544,0.00016777897,0.0003626523,0.000017376184,0.0000066668485,0.000027859676,0.00022818116],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976185,0.00002403009,0.00034346926,0.0010103844,0.00055306643,0.00045056615],"domain_scores_gemma":[0.99793065,0.00039356254,0.00034698678,0.00089166994,0.0002882681,0.00014885735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004924489,0.00035487433,0.0004230916,0.0005382019,0.0001866374,0.00017623311,0.0014159074,0.0002096836,0.000053626365],"category_scores_gemma":[0.000032336517,0.00027545463,0.00013726996,0.00053158164,0.0006607029,0.00070444087,0.00030307463,0.00025834053,0.0000038768526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005255717,0.000017915427,0.000027052027,0.000046663336,0.000020459416,0.0000036428742,0.000266628,0.0017785819,0.00010049605,0.3798464,0.000087995344,0.6177516],"study_design_scores_gemma":[0.0005990634,0.00060353347,0.000015908272,0.00077244185,0.000016985701,0.000042788324,5.606939e-7,0.045754246,0.004391406,0.9456528,0.0017012308,0.00044902405],"about_ca_topic_score_codex":0.000016968803,"about_ca_topic_score_gemma":0.000049055405,"teacher_disagreement_score":0.6173026,"about_ca_system_score_codex":0.00011469184,"about_ca_system_score_gemma":0.0005909861,"threshold_uncertainty_score":0.9999698},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002484637,0.00046837382,0.99402183,0.00031256973,0.0009376026,0.00084575836,0.000009462898,0.00038578382,0.0027701645],"genre_scores_gemma":[0.34206295,0.00004923106,0.657079,0.0002678968,0.00027159211,0.000061349885,4.6793363e-7,0.000029878585,0.00017763545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600166,0.000057203273,0.00060614944,0.0018859156,0.00084520085,0.00060385664],"domain_scores_gemma":[0.9967677,0.00060212566,0.0004249398,0.0016849487,0.0003482971,0.0001720101],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000880825,0.00058447075,0.0007642174,0.00094247225,0.00049358665,0.00064399425,0.0025985595,0.0002931649,0.000008848934],"category_scores_gemma":[0.000055593293,0.00040437473,0.00019483017,0.0012588527,0.0007728595,0.00085465633,0.0013241494,0.00061143975,0.000027178892],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031905543,0.00003772345,0.0005112515,0.00017228039,0.00036825563,0.0000882478,0.0053664767,0.023417858,0.0009945777,0.044923626,0.000025974838,0.92406183],"study_design_scores_gemma":[0.0025756226,0.0020583787,0.004108743,0.008237827,0.0010299557,0.003913326,0.000043152882,0.55103433,0.138593,0.26759836,0.00953102,0.011276268],"about_ca_topic_score_codex":0.000011897967,"about_ca_topic_score_gemma":0.0000052482515,"teacher_disagreement_score":0.91278553,"about_ca_system_score_codex":0.00043437508,"about_ca_system_score_gemma":0.00016752651,"threshold_uncertainty_score":0.9998408},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040425297,0.000036211597,0.9580061,0.0002077184,0.00025925072,0.00031938282,0.000056624267,0.000025873856,0.00066353776],"genre_scores_gemma":[0.99419963,0.000014138084,0.005595101,0.00009897034,0.000054669632,0.0000039460692,0.0000061911555,0.000008403823,0.000018929653],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980903,0.000038853916,0.00036420586,0.00079899677,0.00043811224,0.00026950022],"domain_scores_gemma":[0.9984615,0.0009629464,0.00020427536,0.0002252477,0.000083644314,0.000062427316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035700775,0.00022200936,0.00027139633,0.00024200181,0.0000962815,0.00007600102,0.00035823305,0.0001279942,0.000011135235],"category_scores_gemma":[0.0004376658,0.00017925822,0.000039384468,0.00024167215,0.0007828306,0.0002605368,0.0002815975,0.0003039766,0.0000018743389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006363439,0.000077041776,0.0065117073,0.00012285399,0.0000027154374,0.000018365334,0.00032002848,0.07259008,0.061236106,0.16128336,8.466182e-7,0.6977733],"study_design_scores_gemma":[0.0002182473,0.00014350835,0.003048492,0.00036893447,0.0000023809607,0.000017990764,1.3380985e-7,0.41141322,0.0169052,0.5676015,0.000032749496,0.00024762246],"about_ca_topic_score_codex":0.000009162229,"about_ca_topic_score_gemma":0.000041963576,"teacher_disagreement_score":0.95377433,"about_ca_system_score_codex":0.00017669084,"about_ca_system_score_gemma":0.00016489896,"threshold_uncertainty_score":0.73099375},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004912091,0.00022602311,0.98650336,0.0007622769,0.0039741406,0.0016849226,0.0000057547795,0.00058137113,0.0013500679],"genre_scores_gemma":[0.7714825,0.000007409074,0.22011188,0.0027499173,0.00385136,0.000052113694,0.000003752247,0.0001700625,0.001570992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931298,0.00017538974,0.0009417689,0.003114284,0.0014078296,0.0012309497],"domain_scores_gemma":[0.9942854,0.0010493828,0.0009721091,0.0028820783,0.00044581128,0.00036521797],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0030011968,0.00093206455,0.00096913753,0.001075797,0.000926131,0.0010001526,0.0062503163,0.00033063168,0.000008934004],"category_scores_gemma":[0.00013674742,0.0007589648,0.000244531,0.00064649724,0.0005725169,0.00021821131,0.003270531,0.00071307964,0.00006675206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043802018,0.0005206908,0.00036372928,0.00016216899,0.000090393674,0.00039418042,0.007755105,0.117482305,0.00011147707,0.016380308,0.00034287426,0.856353],"study_design_scores_gemma":[0.0021540022,0.0020587752,0.0004400278,0.0016813718,0.000050667386,0.00005136583,0.000026263577,0.92352843,0.00032849974,0.06136119,0.0057420535,0.0025773596],"about_ca_topic_score_codex":0.000009108264,"about_ca_topic_score_gemma":0.00012794834,"teacher_disagreement_score":0.8537756,"about_ca_system_score_codex":0.0004565446,"about_ca_system_score_gemma":0.0003020298,"threshold_uncertainty_score":0.99948615},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036455156,0.00030280944,0.9954504,0.0012255231,0.0007667008,0.0006959823,0.000010980387,0.00040520725,0.0011059511],"genre_scores_gemma":[0.1824194,0.00014018048,0.81212837,0.00042404604,0.0030079926,0.000105904335,0.000007174093,0.00009921015,0.001667726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997087,0.00002934211,0.0005058836,0.0012887688,0.0005145269,0.0005745015],"domain_scores_gemma":[0.99789774,0.00048207806,0.00043859213,0.0008163276,0.00022596477,0.00013930471],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079378014,0.0004217785,0.00040656189,0.0006017157,0.0006309504,0.0003613046,0.0020094875,0.0004402242,0.00001618127],"category_scores_gemma":[0.00011839958,0.00034600563,0.00015968732,0.00033511713,0.0003420066,0.00051545794,0.0009439156,0.0007829635,0.000010126618],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007805484,0.000017771936,0.00006616743,0.000021537904,0.0000137191355,0.0000059094637,0.00017318182,0.004680146,0.00064391294,0.031145096,0.000017367052,0.96320736],"study_design_scores_gemma":[0.00046263935,0.0003371242,0.0000049776318,0.00056882104,0.000013220171,0.000045537843,1.8375763e-7,0.8546178,0.0038555195,0.113823086,0.025580766,0.00069032435],"about_ca_topic_score_codex":0.0000410231,"about_ca_topic_score_gemma":0.00003474155,"teacher_disagreement_score":0.9625171,"about_ca_system_score_codex":0.00027375977,"about_ca_system_score_gemma":0.00042226573,"threshold_uncertainty_score":0.9998992},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003336389,0.00020584895,0.99368745,0.0016566282,0.0017356034,0.0005447578,0.000017685039,0.00007973037,0.0020389105],"genre_scores_gemma":[0.003394799,0.000035845205,0.9943298,0.0010891038,0.00036213986,0.000051032825,0.0000052716564,0.000020502144,0.00071147067],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724966,0.000028908757,0.00042375462,0.0012187388,0.00065157074,0.00042736685],"domain_scores_gemma":[0.99777853,0.0006011483,0.00028200072,0.00089194736,0.00033373712,0.000112657835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012587741,0.00034773565,0.00032988828,0.00037896595,0.00024183941,0.0002229208,0.0016459088,0.00019749583,0.00001121012],"category_scores_gemma":[0.00025148204,0.00027272545,0.00007582878,0.00024927015,0.0005223518,0.0007084071,0.0008121381,0.0002485321,0.000010159091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075280786,0.000008951534,0.000038587965,0.000024711588,0.0000068989875,0.0000017065329,0.00018850538,0.0003343659,0.0001433935,0.47804922,0.00002664582,0.5211695],"study_design_scores_gemma":[0.00044913308,0.00027944607,0.0014068737,0.000311442,0.000009406685,0.000018545794,1.1187672e-7,0.3162661,0.0016292983,0.6642161,0.014762157,0.0006513655],"about_ca_topic_score_codex":0.0000036956092,"about_ca_topic_score_gemma":0.000009758228,"teacher_disagreement_score":0.5205181,"about_ca_system_score_codex":0.00026585077,"about_ca_system_score_gemma":0.00029647598,"threshold_uncertainty_score":0.9999725},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008253848,0.00012197879,0.9831811,0.0023501155,0.0013496296,0.0008977626,0.000027626582,0.00037601267,0.011687531],"genre_scores_gemma":[0.18992664,0.00021782044,0.78919417,0.007888075,0.0015164478,0.0002601322,0.0000304447,0.00020753812,0.010758706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944335,0.00011040797,0.00079091016,0.0023454027,0.0013781023,0.0009416563],"domain_scores_gemma":[0.995488,0.0007336122,0.00050884555,0.0025497081,0.00040557422,0.00031428563],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011383916,0.00073637214,0.0007038846,0.00069280417,0.0004191656,0.00048532782,0.004257909,0.00042485932,0.000057818976],"category_scores_gemma":[0.00010259429,0.00060449936,0.00017538539,0.0007992999,0.0011921739,0.00088474544,0.001971503,0.00090378465,0.00015888366],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027869768,0.00014164014,0.000031418185,0.000079227546,0.000096669755,0.00020174134,0.001892346,0.035649233,0.0015566723,0.18436228,0.0018574757,0.7741034],"study_design_scores_gemma":[0.001364491,0.00041713766,0.0001224908,0.0014009691,0.000046002402,0.000093938026,8.992412e-7,0.48428246,0.009610989,0.47589478,0.024302095,0.002463739],"about_ca_topic_score_codex":0.000058608977,"about_ca_topic_score_gemma":0.0005484576,"teacher_disagreement_score":0.7716397,"about_ca_system_score_codex":0.001030577,"about_ca_system_score_gemma":0.0009120692,"threshold_uncertainty_score":0.99964064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000097655844,0.00015998993,0.980359,0.0011787085,0.0010710871,0.00037654897,0.000013920177,0.0001035873,0.01663947],"genre_scores_gemma":[0.2648992,0.00010061927,0.73089206,0.0035465625,0.00038222098,0.000027588234,0.000016019554,0.000027586837,0.0001081518],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679005,0.000040681836,0.00069966,0.0009747214,0.00080407807,0.00069081475],"domain_scores_gemma":[0.99760437,0.0003974198,0.0002914719,0.0013913108,0.0001881238,0.0001272862],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012060497,0.00043872895,0.0004913315,0.0009629686,0.00016531374,0.0005390046,0.0030888813,0.00030305123,0.00003266268],"category_scores_gemma":[0.00012268325,0.000329762,0.00009710313,0.0006337726,0.0005573753,0.0020630457,0.0015388362,0.00055146863,0.0001281718],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042812576,0.000014291207,0.00031495636,0.000032082324,0.0000021691112,0.000020184028,0.0004060319,0.0033397106,0.000006358503,0.06883928,0.000018400508,0.92700225],"study_design_scores_gemma":[0.0004381388,0.00015176584,0.0017655375,0.0003841189,0.0000023180164,0.000040851784,1.4196152e-7,0.22662216,0.0000748404,0.75813246,0.011634402,0.0007532794],"about_ca_topic_score_codex":0.00007678476,"about_ca_topic_score_gemma":0.00022308544,"teacher_disagreement_score":0.92624897,"about_ca_system_score_codex":0.00050107454,"about_ca_system_score_gemma":0.0005166332,"threshold_uncertainty_score":0.9999154},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058859754,0.00012225397,0.97560734,0.0013700979,0.00073954574,0.0002859351,0.000025339354,0.000092629045,0.021698011],"genre_scores_gemma":[0.11401269,0.00002811125,0.88392556,0.0012466568,0.00024343574,0.000016314958,0.000012924688,0.000032903466,0.0004814211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972657,0.00003084345,0.00049250736,0.0010101303,0.0007539643,0.00044684025],"domain_scores_gemma":[0.9977914,0.00056392554,0.0003006393,0.0010896878,0.0001286814,0.0001256851],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040928574,0.00035354585,0.00037931476,0.00048673945,0.00022059865,0.00016878893,0.002080766,0.00025949682,0.00004848764],"category_scores_gemma":[0.00006887011,0.0002681926,0.0001258842,0.0004253082,0.00071222143,0.00047678454,0.0005052317,0.0004840042,0.00006433567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009802983,0.00009106431,0.000016213164,0.000020258116,0.000018717657,0.000023471692,0.00043443043,0.032006405,0.00008955763,0.5463956,0.0005824361,0.42031202],"study_design_scores_gemma":[0.00038720798,0.0003842064,0.000025873556,0.00032467596,0.000009137988,0.000021773494,1.16317665e-7,0.55361974,0.0007703734,0.4411471,0.0026874437,0.0006223616],"about_ca_topic_score_codex":0.0000067392434,"about_ca_topic_score_gemma":0.0000039862575,"teacher_disagreement_score":0.52161336,"about_ca_system_score_codex":0.00012043764,"about_ca_system_score_gemma":0.0003790793,"threshold_uncertainty_score":0.99997705},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000110310466,0.0003975459,0.9935398,0.0006714626,0.00174566,0.00039772948,0.000010604626,0.00012846525,0.0029984375],"genre_scores_gemma":[0.18854599,0.000009481631,0.8097832,0.00045085797,0.00083961705,0.000008913994,0.000011282535,0.00003048457,0.00032012604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970544,0.000057352972,0.0005237485,0.0009900031,0.0007455208,0.0006289826],"domain_scores_gemma":[0.99756795,0.0006005287,0.00045084246,0.0010290889,0.00020215832,0.0001494471],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018974253,0.00041414407,0.0005681766,0.000595607,0.0003669223,0.00027184765,0.0023584845,0.00023761857,0.000011967804],"category_scores_gemma":[0.00017648116,0.0003765428,0.00019165543,0.00023891211,0.00061790086,0.00051633216,0.0008399734,0.00092347414,0.00001173815],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004829759,0.000040879066,0.00006484623,0.00008855162,0.000009753018,0.0000031560292,0.0008075459,0.0053008357,0.00014138132,0.12285779,0.000016988073,0.87066346],"study_design_scores_gemma":[0.00032434342,0.00023910907,0.00030818672,0.00033868614,0.00001211509,0.000038008493,1.3967963e-7,0.73546296,0.0005213187,0.25742632,0.004783078,0.000545711],"about_ca_topic_score_codex":0.00007132775,"about_ca_topic_score_gemma":0.00003315953,"teacher_disagreement_score":0.8701177,"about_ca_system_score_codex":0.00016610677,"about_ca_system_score_gemma":0.00026933438,"threshold_uncertainty_score":0.99986863},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035088183,0.00082831434,0.9912998,0.00010364969,0.0021488345,0.0017464717,0.0000040499904,0.00020272752,0.00015733606],"genre_scores_gemma":[0.1823343,0.000009636839,0.81650233,0.0003869219,0.00069713517,0.0000011886635,0.0000073483693,0.000051319013,0.0000097900565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953099,0.00010256664,0.00079589646,0.0017606069,0.0009879976,0.0010430661],"domain_scores_gemma":[0.9969284,0.00062662637,0.00058551435,0.0012962165,0.00037381856,0.00018942374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019829902,0.00070131075,0.00072561327,0.00076603575,0.00083608594,0.0010003926,0.0020387706,0.00027625088,0.000002525824],"category_scores_gemma":[0.00007876503,0.00066320796,0.00018699768,0.0006563052,0.00036164778,0.0012292438,0.001720129,0.0006481879,0.0000069480475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017649592,0.00005865431,0.00010528448,0.000104509774,0.000018509749,0.00009648527,0.0051524015,0.022711018,0.0005308777,0.00036962732,0.0000032926444,0.9708317],"study_design_scores_gemma":[0.0005303873,0.00038329963,0.00020208335,0.00044351871,0.000040217492,0.00012707889,0.00000550328,0.96908075,0.00047529125,0.027922656,0.000030671632,0.00075853267],"about_ca_topic_score_codex":0.000106445805,"about_ca_topic_score_gemma":0.000031314037,"teacher_disagreement_score":0.97007316,"about_ca_system_score_codex":0.00050240906,"about_ca_system_score_gemma":0.00030389839,"threshold_uncertainty_score":0.99958193},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020547333,0.006295671,0.9866653,0.0009586946,0.0020657517,0.0010839821,0.00007740824,0.00042936756,0.0024032567],"genre_scores_gemma":[0.048496,0.004355631,0.94227886,0.001012147,0.0008191058,0.00015642507,0.000044640157,0.00034132766,0.0024958795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98840606,0.00016757137,0.0016276268,0.0052497867,0.0021597228,0.0023892422],"domain_scores_gemma":[0.9919216,0.0011977204,0.00073287357,0.0052663884,0.0003033143,0.0005780956],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.0023548508,0.0016885266,0.002016761,0.002104175,0.000509614,0.0013693876,0.010320695,0.0006718818,0.000050952545],"category_scores_gemma":[0.00033694287,0.0014435515,0.00024925038,0.0010779648,0.0015791869,0.0050826203,0.022879934,0.0019324442,0.000051319075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003516134,0.00003880013,0.000021903785,0.00030574627,0.000067910914,0.0003863959,0.0005083306,0.17100008,0.00009543503,0.0001909064,0.0000038740945,0.82734543],"study_design_scores_gemma":[0.0009590837,0.00029095865,0.000056696346,0.0011714738,0.000051953848,0.0005330568,0.0000012752911,0.97630733,0.000065243636,0.01337673,0.005581012,0.0016052038],"about_ca_topic_score_codex":0.00008566772,"about_ca_topic_score_gemma":0.005165661,"teacher_disagreement_score":0.8257403,"about_ca_system_score_codex":0.0010877568,"about_ca_system_score_gemma":0.0005938742,"threshold_uncertainty_score":0.9996673},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011720365,0.00008577752,0.9863884,0.0057436572,0.0034312238,0.00091046956,0.000019240802,0.00012718879,0.003176861],"genre_scores_gemma":[0.9141355,0.000046499517,0.050346795,0.021702748,0.0045999126,0.00017331248,0.000007720577,0.00014760283,0.008839895],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963449,0.000035927987,0.00042067043,0.001693805,0.000837715,0.000666954],"domain_scores_gemma":[0.9891087,0.009586505,0.00032709868,0.00069504563,0.00018026569,0.00010238076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010683003,0.000457742,0.00040792002,0.0004316021,0.000614198,0.00019714059,0.00079199416,0.00025736916,0.000032320186],"category_scores_gemma":[0.005242992,0.00038460176,0.000164289,0.00024622973,0.000743046,0.00048246176,0.00055297423,0.0005017891,0.000028548568],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011716549,0.000034972563,0.00003163019,0.00013477074,0.000012516924,0.00003006939,0.0002068416,0.04559023,0.039435826,0.04561828,0.00041521637,0.8683725],"study_design_scores_gemma":[0.0012956351,0.0009058219,0.00014543554,0.0006260967,0.000030738232,0.00010865676,3.1470435e-7,0.39977717,0.07616039,0.48689803,0.032262057,0.0017896277],"about_ca_topic_score_codex":0.000011346394,"about_ca_topic_score_gemma":0.0000692695,"teacher_disagreement_score":0.9360416,"about_ca_system_score_codex":0.0006252267,"about_ca_system_score_gemma":0.0002885342,"threshold_uncertainty_score":0.9998606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022112515,0.00041062606,0.97590005,0.00011873947,0.00064377976,0.00013714988,0.000013559403,0.0002946154,0.00036894908],"genre_scores_gemma":[0.9672952,0.00008237891,0.032222383,0.00007605296,0.00023649477,0.0000053110166,0.0000063368516,0.000037251855,0.000038576163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820167,0.000020847012,0.0004308968,0.00046299587,0.00055258063,0.0003309872],"domain_scores_gemma":[0.99888384,0.00037447485,0.00010424403,0.0004149827,0.00012000895,0.00010246783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025456375,0.0002715437,0.00047907513,0.00051292387,0.00006528272,0.00007433706,0.00047183057,0.00015810235,0.00007457556],"category_scores_gemma":[0.0001067914,0.00021696185,0.00012961164,0.00034981934,0.0004335446,0.00020080907,0.00012796116,0.00025937322,0.00000580585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030297358,0.00001556942,0.002800453,0.0001815372,0.000068442714,0.000046957844,0.0002883856,0.36843354,0.0031786882,0.00007489879,0.000033540615,0.62487495],"study_design_scores_gemma":[0.00018710732,0.000020163756,0.00016116811,0.00064587913,0.00004941159,0.000010038148,2.1003582e-7,0.9914245,0.0058494406,0.0013788578,0.000026892374,0.00024635872],"about_ca_topic_score_codex":0.000029885381,"about_ca_topic_score_gemma":0.000005362409,"teacher_disagreement_score":0.9451827,"about_ca_system_score_codex":0.00017984571,"about_ca_system_score_gemma":0.00007059468,"threshold_uncertainty_score":0.88474476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002668228,0.0002448852,0.98131245,0.0021284856,0.0014378947,0.00050220144,0.000005596363,0.0001481597,0.013953492],"genre_scores_gemma":[0.8221312,0.000060570994,0.17606051,0.0012110036,0.00030574095,0.00001538354,0.0000073912142,0.00003364595,0.00017454682],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959776,0.000058993202,0.00064953906,0.0015143537,0.0010351993,0.00076435215],"domain_scores_gemma":[0.997755,0.00033566754,0.00033774655,0.0012090555,0.00022045031,0.00014206771],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010888978,0.00053707766,0.0005385603,0.0010285701,0.000114828545,0.00049408316,0.0026124606,0.00042393556,0.000032359694],"category_scores_gemma":[0.000108599335,0.00041612683,0.00012928345,0.0007420583,0.0004105593,0.0011294252,0.00096469896,0.000579263,0.00007468556],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006313239,0.000021139707,0.000059281254,0.000023603165,0.0000034101968,0.0000509059,0.0006884787,0.007291214,0.000020657486,0.14561057,0.000011445501,0.846213],"study_design_scores_gemma":[0.00034505507,0.00012701203,0.0006071613,0.0002943073,0.0000029829027,0.000032246888,6.325266e-8,0.46622428,0.00011790614,0.5310617,0.00074738247,0.00043992576],"about_ca_topic_score_codex":0.00002116339,"about_ca_topic_score_gemma":0.000052702537,"teacher_disagreement_score":0.84577304,"about_ca_system_score_codex":0.0006065589,"about_ca_system_score_gemma":0.00041957674,"threshold_uncertainty_score":0.99982905},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000095982265,0.000113909606,0.9969357,0.0001869153,0.0013695422,0.00081205345,0.000017527329,0.00024198799,0.00022632777],"genre_scores_gemma":[0.025894424,0.000032678203,0.97222537,0.0009685893,0.0005245345,0.000048876896,0.000012972638,0.000035144967,0.00025742725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622136,0.00006836153,0.00060527574,0.0014711736,0.0010931409,0.0005407141],"domain_scores_gemma":[0.997283,0.00063142343,0.00043835136,0.0010270956,0.00042997135,0.00019019359],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012618776,0.00043193804,0.0005811641,0.001614938,0.00029106304,0.0004663752,0.0016404885,0.00029434563,0.000030487423],"category_scores_gemma":[0.00013820585,0.00037404778,0.00032966962,0.0011866795,0.00042590778,0.0010260262,0.00052649237,0.0003231975,0.000011941879],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006469755,0.000012960157,0.00008973939,0.000034816425,0.0000896119,0.000008000934,0.00024111533,0.0023354366,0.0073166164,0.00040594334,0.0000074491163,0.9894518],"study_design_scores_gemma":[0.00041273705,0.00026413202,0.00027624896,0.0002526201,0.00022649695,0.000010605127,3.8136346e-7,0.7265608,0.23169506,0.039213195,0.00011331661,0.0009744482],"about_ca_topic_score_codex":0.000034446923,"about_ca_topic_score_gemma":0.000060236394,"teacher_disagreement_score":0.9884774,"about_ca_system_score_codex":0.0006964572,"about_ca_system_score_gemma":0.00031060286,"threshold_uncertainty_score":0.99987113},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004117086,0.00024248273,0.99355245,0.0008120188,0.0012111503,0.00048721305,0.000013094324,0.00020845991,0.0034319854],"genre_scores_gemma":[0.289583,0.000045366025,0.70656884,0.0013597091,0.00072112045,0.000040217205,0.000008308338,0.00006933598,0.0016040768],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572414,0.00003381574,0.0005444631,0.0018807041,0.0008546635,0.00096220535],"domain_scores_gemma":[0.9962475,0.0014751535,0.00041490913,0.0011934448,0.00043270388,0.00023631648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073634204,0.000657787,0.0006094075,0.0008473419,0.0005160786,0.0009260136,0.0033289646,0.00039181553,0.000037922742],"category_scores_gemma":[0.00022725186,0.00051716244,0.00020939979,0.00055426557,0.0008484439,0.00060346525,0.00047083045,0.00069269084,0.000048102902],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019047495,0.000038556722,0.00023094434,0.0002255438,0.000021048854,0.00006693842,0.0003744273,0.017768888,0.00086428376,0.065507405,0.000041434225,0.9148415],"study_design_scores_gemma":[0.0012287395,0.0008149219,0.00019103613,0.0017647361,0.000026745689,0.00012153163,2.5777229e-7,0.3298348,0.007185109,0.6507454,0.006065184,0.002021552],"about_ca_topic_score_codex":0.0000047820654,"about_ca_topic_score_gemma":0.000030898424,"teacher_disagreement_score":0.9128199,"about_ca_system_score_codex":0.00018612549,"about_ca_system_score_gemma":0.00072990626,"threshold_uncertainty_score":0.999728},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035923765,0.0002479451,0.99211633,0.0021996978,0.0008691955,0.00042284504,0.000006034553,0.0003484507,0.0037859047],"genre_scores_gemma":[0.04777187,0.00037100568,0.9457841,0.0043455334,0.0002772649,0.000040252813,0.000051017596,0.000070602095,0.0012883904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650866,0.00003712138,0.00047450676,0.0012944608,0.0010952918,0.0005899432],"domain_scores_gemma":[0.998007,0.00022837543,0.00023011245,0.0010672993,0.00025890808,0.00020832532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006617435,0.00042800567,0.00036249284,0.00088856457,0.0002807385,0.00085831404,0.0025062643,0.00028790307,0.000051853287],"category_scores_gemma":[0.00007268404,0.00040326564,0.00010731065,0.00091105734,0.0004598254,0.0014748822,0.00075624464,0.0006420053,0.000102476995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032195915,0.000051542873,0.000007999729,0.000041799623,0.000009487085,0.000045090077,0.0014448812,0.55144954,0.00011076817,0.10360881,0.00021142751,0.34301543],"study_design_scores_gemma":[0.0002731462,0.00013163559,0.0000037829168,0.00021822006,0.0000022170234,0.00001121406,8.22421e-8,0.63560176,0.00068413035,0.3607855,0.001840677,0.0004476596],"about_ca_topic_score_codex":0.00001888438,"about_ca_topic_score_gemma":0.000022736373,"teacher_disagreement_score":0.34256777,"about_ca_system_score_codex":0.00028026575,"about_ca_system_score_gemma":0.0006774475,"threshold_uncertainty_score":0.9998419},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022750641,0.00021271971,0.9907982,0.0011170608,0.00051644637,0.0007946931,0.000008195887,0.000117264404,0.004160375],"genre_scores_gemma":[0.86896837,0.00010804009,0.121369146,0.0016144997,0.00054035377,0.000012710402,0.000009534269,0.00006377524,0.0073135463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792254,0.00001480839,0.0002717826,0.00085977477,0.0005546135,0.00037650586],"domain_scores_gemma":[0.99893504,0.00014337199,0.00014347956,0.00046510235,0.00011483861,0.00019817372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029491205,0.00036192616,0.0004013259,0.0005231393,0.00015248824,0.000082575614,0.00022285577,0.00014543827,0.0000820725],"category_scores_gemma":[0.000054478656,0.00024412374,0.00007032278,0.00013591822,0.0005782309,0.000096745156,0.00014273799,0.00038655032,0.000019949497],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031373167,0.00011483345,0.00012146228,0.00019213054,0.00006499808,0.0011896178,0.00053861254,0.0014038009,0.0023020701,0.00046217884,0.00007458964,0.993222],"study_design_scores_gemma":[0.023591185,0.011660348,0.017041491,0.012354751,0.00075846416,0.020280005,0.000009877905,0.78896505,0.012199308,0.014300363,0.09306028,0.0057788817],"about_ca_topic_score_codex":0.000009788568,"about_ca_topic_score_gemma":0.00005802741,"teacher_disagreement_score":0.9874431,"about_ca_system_score_codex":0.00023032793,"about_ca_system_score_gemma":0.00018797188,"threshold_uncertainty_score":0.9955077},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038755257,0.00009958474,0.9604017,0.00005698258,0.0003203569,0.00014258968,0.0000013115013,0.00020873833,0.000013458551],"genre_scores_gemma":[0.55950165,0.0000041207445,0.44037428,0.00009818077,0.000012650328,0.0000054737125,3.94823e-7,0.0000031623426,6.2582025e-8],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978113,0.0001432665,0.00036504937,0.0007290948,0.00048721998,0.0004640333],"domain_scores_gemma":[0.9982338,0.00037899276,0.00017523162,0.0009594099,0.00016249977,0.000090041205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095576694,0.00020528294,0.00031266612,0.0017536476,0.00020870018,0.00012973289,0.001365905,0.000086559296,0.0000021895157],"category_scores_gemma":[0.00011530237,0.00018057547,0.00021079008,0.0117795495,0.00038292285,0.0007450568,0.00021374461,0.0002132592,6.278443e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010193927,0.00017018168,0.06998604,0.000029290257,0.00007824849,0.000011727056,0.0016022589,0.06507508,0.02628798,0.0030337186,8.7733997e-7,0.8337144],"study_design_scores_gemma":[0.00015995756,0.00019251755,0.007967823,0.000022245202,0.000021301244,0.0000128149895,6.337989e-7,0.34277743,0.5259822,0.122456774,0.000097531985,0.000308777],"about_ca_topic_score_codex":0.0000671911,"about_ca_topic_score_gemma":0.00008523944,"teacher_disagreement_score":0.8334056,"about_ca_system_score_codex":0.000045432793,"about_ca_system_score_gemma":0.00005768698,"threshold_uncertainty_score":0.73636544},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012510985,0.00047940778,0.98825175,0.0025508404,0.007167813,0.0005854998,0.0000142763865,0.00015000491,0.0007878925],"genre_scores_gemma":[0.13417006,0.00014637278,0.8513325,0.0054636127,0.006004717,0.00022137535,0.000044621393,0.00010300897,0.0025137616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969055,0.000042464926,0.0004793232,0.0014321102,0.0004800718,0.000660516],"domain_scores_gemma":[0.99757475,0.0007844844,0.00037685983,0.0007947753,0.0003501695,0.00011898018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000578977,0.00040520472,0.00044059285,0.00054201233,0.00033665085,0.00014360208,0.0017830572,0.0004942725,0.00003942658],"category_scores_gemma":[0.000041034225,0.00035776396,0.00012632553,0.00024758524,0.0009057648,0.00046065537,0.00057136174,0.00042154331,0.000020573983],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035464873,0.000013289072,0.00008372761,0.000029945497,0.000019906594,0.00001819797,0.00016799386,0.02560913,0.00012413831,0.05350042,0.00031642438,0.9200814],"study_design_scores_gemma":[0.0007757268,0.000488821,0.00010758497,0.00014546831,0.000012867743,0.00019497384,1.2366277e-7,0.71055716,0.00049438013,0.2779468,0.008641042,0.00063503045],"about_ca_topic_score_codex":0.000012614403,"about_ca_topic_score_gemma":0.00012609383,"teacher_disagreement_score":0.91944635,"about_ca_system_score_codex":0.001089609,"about_ca_system_score_gemma":0.0006459719,"threshold_uncertainty_score":0.9998874},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044547793,0.00023380296,0.9902601,0.0003749034,0.0009008022,0.00044513485,0.00001583459,0.00012839535,0.007195542],"genre_scores_gemma":[0.37186217,0.00004494213,0.6269433,0.0007708778,0.00023983777,0.000009440008,0.000003013597,0.000042502725,0.000083937855],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99513084,0.00003610972,0.0006445741,0.0019590114,0.0012327526,0.0009966859],"domain_scores_gemma":[0.99635494,0.0011162243,0.00030664852,0.0018141598,0.00016994266,0.00023808274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007589478,0.0006758721,0.00069779897,0.0010616265,0.00029539215,0.0006333724,0.003879528,0.0003191056,0.00003153241],"category_scores_gemma":[0.000110621,0.0004450233,0.000096717,0.0007886708,0.0007715965,0.00072354265,0.0013910038,0.0008046046,0.000063455045],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009621953,0.000025686717,0.0015099499,0.000014295716,0.000006957791,0.0005753628,0.0004425222,0.00694584,0.000007891099,0.031155147,0.000008359755,0.9592984],"study_design_scores_gemma":[0.0009264646,0.00076091127,0.0062581208,0.0025432166,0.000010239192,0.00030830785,3.466837e-7,0.46456552,0.000060876253,0.522563,0.0005801669,0.0014228446],"about_ca_topic_score_codex":0.000019938994,"about_ca_topic_score_gemma":0.0012486115,"teacher_disagreement_score":0.95787555,"about_ca_system_score_codex":0.00029851828,"about_ca_system_score_gemma":0.0005988938,"threshold_uncertainty_score":0.99980015},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001775588,0.0003499892,0.99076873,0.000554281,0.0012994163,0.00025409673,0.000007835872,0.0000706185,0.0065174703],"genre_scores_gemma":[0.21126623,0.00008552865,0.786789,0.00030658525,0.0003968253,0.0000099976205,0.000025287958,0.000026607382,0.0010939584],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971116,0.000030665673,0.00051614887,0.0010502408,0.000924274,0.00036707538],"domain_scores_gemma":[0.9967456,0.00048376987,0.0005093976,0.0016461014,0.0004999046,0.00011523392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070699456,0.00031277174,0.0003930973,0.0010823528,0.0004398789,0.00043668287,0.0033580572,0.0001829739,0.000018346873],"category_scores_gemma":[0.0002925138,0.00031634813,0.0001177266,0.0005019071,0.00040052764,0.00086951413,0.001005003,0.0004288872,0.0000119827755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064919773,0.000036683276,0.0002335904,0.00007500838,0.000029077839,0.00005608892,0.000808531,0.2135431,0.00070732855,0.2506227,0.000084591666,0.53379685],"study_design_scores_gemma":[0.00026022596,0.00009575631,0.00079109997,0.0003514673,0.000010113353,0.00004409446,2.1630605e-7,0.382925,0.003169987,0.6108836,0.0010054508,0.0004629745],"about_ca_topic_score_codex":0.000064797925,"about_ca_topic_score_gemma":0.00012513346,"teacher_disagreement_score":0.53333384,"about_ca_system_score_codex":0.000085756015,"about_ca_system_score_gemma":0.00057665515,"threshold_uncertainty_score":0.99992883},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009769029,0.000106357285,0.9955152,0.0009408837,0.00022276134,0.0012572313,0.000024086014,0.00017814728,0.00077838387],"genre_scores_gemma":[0.5893197,0.00005865719,0.40815127,0.00083915965,0.0008581748,0.00009597019,0.000019373749,0.00006449316,0.00059318176],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842936,0.00000461068,0.00022242978,0.0007296639,0.0003089971,0.00030494347],"domain_scores_gemma":[0.99865156,0.0003533888,0.00019008924,0.00049391465,0.00021711133,0.000093944334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012483059,0.00027448247,0.00033087863,0.000235481,0.00014955616,0.000038538696,0.00025490165,0.00013169147,0.000011853288],"category_scores_gemma":[0.00004492976,0.00017832186,0.0000629153,0.00014979664,0.000564563,0.00014249946,0.000088250345,0.00036141174,0.0000017632525],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074691727,0.000035276957,0.0031306338,0.0002014935,0.00006755368,0.00008112208,0.0005171505,0.00743426,0.0026931467,0.030960567,0.00012315258,0.9540087],"study_design_scores_gemma":[0.0041688317,0.004769688,0.010048312,0.00580499,0.0003114433,0.0017772667,0.0000013577993,0.20136017,0.023308279,0.7118715,0.034270395,0.0023077475],"about_ca_topic_score_codex":0.0000022350675,"about_ca_topic_score_gemma":0.000008496571,"teacher_disagreement_score":0.951701,"about_ca_system_score_codex":0.0001820658,"about_ca_system_score_gemma":0.0002161168,"threshold_uncertainty_score":0.7271754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028441905,0.00015898481,0.98251724,0.003553611,0.0029485112,0.0023497473,0.000029916246,0.00019514762,0.0079624215],"genre_scores_gemma":[0.84815073,0.00010277578,0.12366626,0.0099017015,0.0063262284,0.0006614014,0.000053030715,0.00035299346,0.010784913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959485,0.000115450595,0.0009802621,0.0011135238,0.0006552891,0.0011869741],"domain_scores_gemma":[0.9939157,0.004229766,0.0004191575,0.00063608255,0.0005590829,0.00024025857],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018433065,0.00045749077,0.0006126917,0.0005797227,0.0013196111,0.00003765771,0.0010267819,0.00080530107,0.0003146701],"category_scores_gemma":[0.00061197736,0.00033596138,0.00018146023,0.00023143091,0.0006741222,0.0001840861,0.0001480909,0.0018721168,0.00021221834],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080413425,0.0000128251995,0.0018070122,0.0004271953,0.000006239416,0.000009334511,0.0020450405,0.0031449196,0.00017839484,0.008568528,0.000030186884,0.9836899],"study_design_scores_gemma":[0.001192691,0.0014014511,0.00025357128,0.010153334,0.000040362647,0.0000044717035,0.000013863144,0.47238198,0.0050244806,0.43638638,0.07113172,0.0020157143],"about_ca_topic_score_codex":0.00006543428,"about_ca_topic_score_gemma":0.0023997428,"teacher_disagreement_score":0.9816742,"about_ca_system_score_codex":0.0006329389,"about_ca_system_score_gemma":0.0021965124,"threshold_uncertainty_score":0.9999805},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026853933,0.0007229735,0.9863691,0.0018956955,0.0015177047,0.0007355591,0.000046760695,0.00010297452,0.008340739],"genre_scores_gemma":[0.2959874,0.00011102555,0.6539756,0.009554438,0.0047933757,0.00014382863,0.00011282604,0.000107591266,0.03521393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9880105,0.000074794836,0.0009993091,0.0034084395,0.006555441,0.0009515148],"domain_scores_gemma":[0.99289936,0.002730391,0.0004808559,0.0019223193,0.0015556337,0.00041141966],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.015210554,0.0004284639,0.00050516054,0.0029796476,0.0012129897,0.0031153315,0.0061416873,0.00015419314,0.000102845],"category_scores_gemma":[0.0027458859,0.00035491408,0.00007930264,0.0051703006,0.0030368129,0.0010664451,0.003691214,0.00057112705,0.00047443158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025802635,0.0000426368,0.00003461459,0.000010600198,0.000003313103,0.0000066025254,0.00021936155,0.15835343,0.000021538084,0.0048727104,0.004497381,0.8319352],"study_design_scores_gemma":[0.00017031502,0.00002954767,0.00048404103,0.00007273084,0.000007053318,0.00003399382,0.0000011846311,0.74842954,0.000047147914,0.099104285,0.15121523,0.00040492453],"about_ca_topic_score_codex":0.0000062501153,"about_ca_topic_score_gemma":0.000055847864,"teacher_disagreement_score":0.8315303,"about_ca_system_score_codex":0.0007322654,"about_ca_system_score_gemma":0.0034141096,"threshold_uncertainty_score":0.99989027},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003733737,0.0008683986,0.9901005,0.0035190375,0.00041806357,0.0010291573,0.000021885919,0.000052557756,0.00025668673],"genre_scores_gemma":[0.8170826,0.0049776435,0.17163697,0.0025703674,0.0017269889,0.00011521686,0.00022337517,0.00014212159,0.0015247067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977091,0.0000518979,0.0003514822,0.000834543,0.0007113808,0.00034159145],"domain_scores_gemma":[0.9989595,0.00028231964,0.00013996311,0.00026121232,0.00021336271,0.00014366461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006586775,0.00030785942,0.000421583,0.000729842,0.00017503876,0.00009503814,0.00009724583,0.00030962672,0.000024811663],"category_scores_gemma":[0.00029508836,0.00023944661,0.000039265564,0.00023927719,0.00055321096,0.0003278753,0.00019740144,0.0005428355,0.0000023796458],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021681252,0.00008179496,0.031084146,0.0005225288,0.000047274127,0.00007150264,0.0019301599,0.0077382755,0.070209116,0.000081928534,0.00024794383,0.8877685],"study_design_scores_gemma":[0.003595324,0.00074653514,0.1476124,0.0027799404,0.000039949613,0.00017343608,0.000004625699,0.83217293,0.007252755,0.004190777,0.00083270896,0.0005985977],"about_ca_topic_score_codex":0.000053219563,"about_ca_topic_score_gemma":0.00023372656,"teacher_disagreement_score":0.8871699,"about_ca_system_score_codex":0.00045817843,"about_ca_system_score_gemma":0.00013085626,"threshold_uncertainty_score":0.97643495},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007243595,0.0004327229,0.9866346,0.000017559454,0.0007199579,0.00017497373,0.000007776182,0.00015443149,0.004614357],"genre_scores_gemma":[0.9595253,0.00006858296,0.03967116,0.00007408515,0.00055118,0.0000047162575,0.0000043073264,0.00004413582,0.00005655947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985381,0.000014717405,0.00032971546,0.00044006613,0.00030915914,0.00036827472],"domain_scores_gemma":[0.9990241,0.00026160004,0.00013660907,0.00043896932,0.00007571063,0.0000629978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005538215,0.0002800316,0.00027387965,0.00024529977,0.00013644935,0.00007192391,0.0007527464,0.00020875776,0.000007953725],"category_scores_gemma":[0.000045421435,0.00018649538,0.00006392615,0.00017479807,0.00034609553,0.00020016594,0.000131929,0.00050122244,0.0000015839711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000091981,0.000015273596,0.00082675106,0.00019626756,0.000031781743,0.0000030536728,0.0010351103,0.28673056,0.011394954,0.00403572,0.000004200429,0.6957171],"study_design_scores_gemma":[0.00013600958,0.00007785642,0.0001052331,0.00032797846,0.000012438306,0.00002647411,1.6956845e-7,0.9829693,0.009211224,0.006645265,0.00018620859,0.00030188015],"about_ca_topic_score_codex":0.000013275799,"about_ca_topic_score_gemma":0.000017480023,"teacher_disagreement_score":0.95228165,"about_ca_system_score_codex":0.000109712455,"about_ca_system_score_gemma":0.00006361656,"threshold_uncertainty_score":0.7605061},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053783967,0.000097785654,0.9877193,0.00023850254,0.00046576667,0.00039346793,0.00004983877,0.000026206824,0.0056307334],"genre_scores_gemma":[0.9926239,0.000010267458,0.006554538,0.00017252387,0.00035413355,0.000028724771,0.000017416247,0.000021794353,0.00021666603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981257,0.00001510693,0.00035597105,0.00080181466,0.00030413576,0.00039730777],"domain_scores_gemma":[0.99844235,0.00014286056,0.00026670663,0.0009531455,0.00009534933,0.00009956496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004466332,0.00031434346,0.00039526843,0.00024998642,0.00022697588,0.00023032313,0.0010435977,0.000121866346,0.00008035222],"category_scores_gemma":[0.000014122372,0.00029243508,0.00012594927,0.000101664205,0.00038975634,0.00015488215,0.0003185543,0.00054136687,0.00004543206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006024449,0.00008427641,0.0018422554,0.000016114793,0.0000144384085,0.0000101179985,0.00052500993,0.0009602918,0.0002474727,0.53915024,0.00002963438,0.45711416],"study_design_scores_gemma":[0.00029203354,0.00003233397,0.00057596184,0.00020240861,0.0000069854937,0.0000015013644,5.639371e-7,0.06286515,0.0005939125,0.9321294,0.0028790347,0.00042075725],"about_ca_topic_score_codex":0.00026255564,"about_ca_topic_score_gemma":0.00021128339,"teacher_disagreement_score":0.98724556,"about_ca_system_score_codex":0.00005139978,"about_ca_system_score_gemma":0.00018267422,"threshold_uncertainty_score":0.9999528},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021415115,0.0003037387,0.990747,0.00020179161,0.0020776547,0.000300833,0.000008237033,0.00015494542,0.004064298],"genre_scores_gemma":[0.89079064,0.000044458855,0.10828549,0.0005729063,0.00021403727,0.00001443118,0.0000049998926,0.000013942959,0.000059075763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724716,0.000044279062,0.00059528986,0.0008386151,0.00076063484,0.0005140147],"domain_scores_gemma":[0.9974307,0.001034843,0.00028858898,0.0010191497,0.00012470366,0.00010200446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043546484,0.0003865703,0.0004656994,0.0007468992,0.00016147357,0.00045949867,0.0022766746,0.0003268209,0.000006853652],"category_scores_gemma":[0.00010760402,0.00028993998,0.00006705942,0.00023470497,0.0003851601,0.0013591974,0.0007900476,0.00054902316,0.000067716755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000134162965,0.000014744653,0.00004810704,0.000020129113,0.00000787044,0.00004796456,0.0038070632,0.6957651,0.00026698757,0.16226411,0.000009936102,0.13773459],"study_design_scores_gemma":[0.00038326407,0.00007304826,0.00008274949,0.0018797836,0.0000025790648,0.00000799318,0.0000026093044,0.8999639,0.0008024946,0.09594831,0.00036625835,0.00048700627],"about_ca_topic_score_codex":0.00013489691,"about_ca_topic_score_gemma":0.000044185494,"teacher_disagreement_score":0.88864917,"about_ca_system_score_codex":0.0002870649,"about_ca_system_score_gemma":0.00027145457,"threshold_uncertainty_score":0.9999553},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004536732,0.00048409775,0.99472296,0.0015940194,0.0016378625,0.00062900997,0.000012347819,0.000045289067,0.0008290564],"genre_scores_gemma":[0.21365717,0.00006865051,0.78338975,0.000992002,0.0009507368,0.00005158284,0.000030240897,0.000031984328,0.0008279065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976263,0.000018653847,0.0004498538,0.0008344455,0.0007326443,0.00033811308],"domain_scores_gemma":[0.9971052,0.00072916533,0.00052818103,0.0011630638,0.0004061122,0.00006828302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010541251,0.00031097082,0.00035355712,0.000557673,0.0005545114,0.00049416546,0.0029332275,0.00017612244,0.0000056793137],"category_scores_gemma":[0.00013133213,0.00023293776,0.00018256374,0.00023116967,0.00049283175,0.00061682303,0.0005328725,0.00029150702,0.0000053394624],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014486365,0.000024348157,0.000014541388,0.00006625907,0.00002481635,0.0000057705224,0.00072606653,0.0566255,0.00020414079,0.119082205,0.000083918785,0.8231279],"study_design_scores_gemma":[0.00024465827,0.00013966995,0.00017974491,0.00014236842,0.000013465424,0.000027490069,1.04447786e-7,0.65151566,0.0020671366,0.3421282,0.0032613154,0.00028018633],"about_ca_topic_score_codex":0.000013309776,"about_ca_topic_score_gemma":0.00003260675,"teacher_disagreement_score":0.8228478,"about_ca_system_score_codex":0.000078124816,"about_ca_system_score_gemma":0.00039760777,"threshold_uncertainty_score":0.94989264},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021819107,0.0021254763,0.9871908,0.0013026743,0.0009114717,0.0003882246,0.000037447848,0.00020395433,0.0056580394],"genre_scores_gemma":[0.60634625,0.00020161453,0.39092994,0.0010973321,0.0005327523,0.0000045558522,0.000014811522,0.00006502007,0.0008077387],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962675,0.00006100726,0.0005722363,0.0014820023,0.00097326626,0.0006439621],"domain_scores_gemma":[0.9947614,0.0005016034,0.00060884806,0.0037099782,0.00021593826,0.00020222263],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.001313944,0.000570654,0.0008555377,0.0006147313,0.00039058013,0.0005947763,0.0065178527,0.00033544714,0.000031048654],"category_scores_gemma":[0.00024769944,0.00050673814,0.00014951719,0.0001595485,0.003275323,0.00066764234,0.003649879,0.00063240685,0.000011119372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019022196,0.000083490515,0.00029915158,0.00026514262,0.00004786411,0.00027262254,0.0022498781,0.00058871636,0.001597586,0.42127737,0.00025960372,0.57303953],"study_design_scores_gemma":[0.0007305991,0.0002930503,0.002626246,0.00083381264,0.000020192256,0.00020798626,0.0000012085817,0.1014488,0.0057294252,0.88552946,0.0015705773,0.001008616],"about_ca_topic_score_codex":0.00014662124,"about_ca_topic_score_gemma":0.00020953946,"teacher_disagreement_score":0.6041643,"about_ca_system_score_codex":0.0001013508,"about_ca_system_score_gemma":0.00033272678,"threshold_uncertainty_score":0.9997384},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000076744895,0.000119544005,0.9884662,0.0026368713,0.0012166341,0.0005100502,0.000006233673,0.00022351136,0.0067441887],"genre_scores_gemma":[0.28072113,0.00003958506,0.70933735,0.007842009,0.0012449097,0.000035254307,0.00001553011,0.000051737985,0.0007124846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961343,0.00002608094,0.00072640716,0.0011034361,0.0013936962,0.000616083],"domain_scores_gemma":[0.9973345,0.0004737334,0.00029716775,0.0010929073,0.00032919174,0.0004724949],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015786481,0.0004049705,0.0004080942,0.0006923497,0.000224699,0.00046815432,0.0034122756,0.0004463546,0.000037797898],"category_scores_gemma":[0.00053187343,0.00034721455,0.00007837382,0.00057187065,0.0003941345,0.001196101,0.0014675092,0.0006437971,0.00023466478],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042006845,0.000006776695,0.0000059849554,0.000018719327,0.000003479593,0.0000033928698,0.0011541583,0.00054987945,0.00011106333,0.021806853,0.000072354174,0.97626317],"study_design_scores_gemma":[0.00050444365,0.000113804046,0.000016629298,0.0009652063,0.0000056630306,0.000079782905,5.097e-7,0.91728276,0.0012990767,0.04378891,0.03503574,0.0009074429],"about_ca_topic_score_codex":0.000005220963,"about_ca_topic_score_gemma":0.000010882445,"teacher_disagreement_score":0.9753557,"about_ca_system_score_codex":0.0004158192,"about_ca_system_score_gemma":0.0011684053,"threshold_uncertainty_score":0.99989796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085764285,0.0011440681,0.99349594,0.0007322113,0.0011074487,0.0022051572,0.000047559857,0.00012308195,0.00028686607],"genre_scores_gemma":[0.43548876,0.000076900746,0.5635245,0.00024593275,0.0003288051,0.00017484136,0.000034485955,0.000040557486,0.00008527003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948309,0.000084652296,0.0012486303,0.0017378564,0.0013270902,0.0007708617],"domain_scores_gemma":[0.99632823,0.0003970503,0.000599789,0.0010634686,0.0013856357,0.00022581629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015690869,0.00063079287,0.00075062696,0.0016187531,0.0005328639,0.00012676387,0.0018479022,0.00038514507,0.0000049357136],"category_scores_gemma":[0.00018375523,0.0006729768,0.00022080314,0.0015451987,0.0006033378,0.00083640055,0.0005784591,0.0005049144,0.000030644882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044750606,0.0003518182,0.00006797161,0.00012399227,0.000025248513,0.000026014612,0.00080679933,0.87892634,0.0031016918,0.063889086,0.00013954287,0.052496724],"study_design_scores_gemma":[0.0006936064,0.00037631148,0.0015215282,0.00057053193,0.000019093497,0.000112199996,0.0000011645172,0.92917925,0.00083645876,0.06539291,0.0005623642,0.00073456665],"about_ca_topic_score_codex":0.00018069231,"about_ca_topic_score_gemma":0.00020260553,"teacher_disagreement_score":0.4346311,"about_ca_system_score_codex":0.002423439,"about_ca_system_score_gemma":0.00212614,"threshold_uncertainty_score":0.99957216},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000630973,0.00016827759,0.99322,0.00072881486,0.00061998295,0.00025269945,0.0000014798222,0.0001289506,0.0042488277],"genre_scores_gemma":[0.66562665,0.00017576323,0.3329167,0.0008422587,0.00022062284,0.000011892365,0.000008032565,0.00002575521,0.0001723184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977737,0.000017169219,0.00035823378,0.0008051727,0.00068324804,0.00036247986],"domain_scores_gemma":[0.9978872,0.00013441384,0.00043409827,0.0012017898,0.00020552018,0.00013700064],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006962477,0.00032815308,0.000292554,0.00073378545,0.0004939049,0.00110949,0.0016974433,0.00019412745,0.000008054908],"category_scores_gemma":[0.000047746984,0.00026771834,0.00005750881,0.00019407149,0.0007063299,0.001406853,0.0004544983,0.0004444207,0.000029278428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008792339,0.000014395866,0.00013979732,0.00005000389,0.000010613005,0.000014541957,0.0023476183,0.00097277755,0.00010104488,0.36108953,0.000008916371,0.635242],"study_design_scores_gemma":[0.00030903518,0.00019827654,0.0011635626,0.00050868944,0.0000098861965,0.00008660712,4.9653295e-7,0.6837924,0.00035711602,0.31086022,0.002142761,0.0005709329],"about_ca_topic_score_codex":0.0000119475435,"about_ca_topic_score_gemma":0.00002973786,"teacher_disagreement_score":0.68281966,"about_ca_system_score_codex":0.000070130925,"about_ca_system_score_gemma":0.00021855906,"threshold_uncertainty_score":0.9999775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012971637,0.0005804351,0.9967123,0.00023701058,0.00036223457,0.00019592034,0.0000011038993,0.00010355983,0.0016777165],"genre_scores_gemma":[0.6459537,0.000060801107,0.3534516,0.00030424638,0.00014153997,0.0000028779993,0.0000017347844,0.000022897038,0.000060591807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681836,0.000042400632,0.0005301226,0.001312898,0.00075962296,0.0005366009],"domain_scores_gemma":[0.9977971,0.00027319428,0.000302354,0.0011591658,0.0002611302,0.00020706998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005610473,0.00049949496,0.00066395017,0.00047822387,0.00019229953,0.00028791584,0.00206038,0.00032618528,0.0000040416276],"category_scores_gemma":[0.000022335838,0.00039173715,0.000073345436,0.0003542041,0.0006111008,0.00029159643,0.0008959805,0.00077929074,0.0000021738883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007690833,0.000008023623,0.00003348362,0.000026603482,0.0000060551333,0.000009953426,0.00018513619,0.58874434,0.000031044314,0.015085598,0.0000025420718,0.3958595],"study_design_scores_gemma":[0.00022905,0.00023048821,0.000015619278,0.0009906717,0.000009978934,0.000047261277,9.9651785e-8,0.9499643,0.00016320318,0.047869846,0.000029079541,0.0004504001],"about_ca_topic_score_codex":0.0000342623,"about_ca_topic_score_gemma":0.00006262721,"teacher_disagreement_score":0.645824,"about_ca_system_score_codex":0.00006201761,"about_ca_system_score_gemma":0.00025167293,"threshold_uncertainty_score":0.99985343},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101831,0.00044572112,0.99747163,0.00009699224,0.00028151562,0.00032802363,0.00007042735,0.00000834921,0.0011955033],"genre_scores_gemma":[0.6070935,0.00039985636,0.38871136,0.0013872756,0.0008496132,0.00006178847,0.00033773668,0.00006680787,0.0010920761],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99850607,0.0000072905036,0.0002545339,0.0008334627,0.00022017745,0.00017848158],"domain_scores_gemma":[0.9982651,0.0000133564845,0.00012224536,0.001374836,0.00014058754,0.000083906176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002354945,0.00018001012,0.00017247803,0.0001990475,0.000059829697,0.000027514994,0.001519722,0.00019659313,0.000014448933],"category_scores_gemma":[0.000021946007,0.00017096025,0.000041664753,0.00012250751,0.00020746417,0.000007978139,0.0005078058,0.00014907152,0.000004727401],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013101468,0.00002279787,0.000024292764,0.000021930984,0.000008536429,4.377952e-7,0.0001477946,0.00094706134,0.12864491,0.0004926679,0.00013053295,0.86954594],"study_design_scores_gemma":[0.0006620897,0.00033451733,0.00037513374,0.00040506586,0.00004333847,0.000019886607,0.000001787181,0.036851678,0.624995,0.021030776,0.3140813,0.001199399],"about_ca_topic_score_codex":0.000011251498,"about_ca_topic_score_gemma":0.00002627936,"teacher_disagreement_score":0.8683465,"about_ca_system_score_codex":0.000024192112,"about_ca_system_score_gemma":0.00021780023,"threshold_uncertainty_score":0.69715565},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025702198,0.00026842253,0.9918032,0.00072165136,0.0015961868,0.0002558293,0.000008629517,0.0001981918,0.0048908563],"genre_scores_gemma":[0.92965585,0.00018085825,0.065635175,0.00266213,0.00060445606,0.000017479997,0.000006741836,0.00006251789,0.0011748191],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970559,0.00003554532,0.00034394843,0.0014432201,0.0005530727,0.00056831684],"domain_scores_gemma":[0.9960681,0.001233857,0.00023121439,0.0021640481,0.00010943763,0.00019334181],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00070572377,0.000528409,0.0004666134,0.00083994935,0.00069572043,0.0010661191,0.003460665,0.0003443739,0.000009666829],"category_scores_gemma":[0.00021092885,0.00041822603,0.000111156856,0.00022890893,0.0009005777,0.0005617579,0.0014528296,0.0009074087,0.000026515047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075293756,0.00002921823,0.00009050225,0.000016760028,0.000013170019,0.00006267516,0.0005499565,0.0058669606,0.000040863433,0.17581035,0.000060768216,0.81745124],"study_design_scores_gemma":[0.00021405211,0.00015178944,0.00035163815,0.0002921814,0.0000029638854,0.00004977223,1.6561069e-7,0.3439276,0.00019910611,0.652916,0.0014319674,0.00046276723],"about_ca_topic_score_codex":0.00004071794,"about_ca_topic_score_gemma":0.000058139984,"teacher_disagreement_score":0.9293988,"about_ca_system_score_codex":0.00013519949,"about_ca_system_score_gemma":0.00031148808,"threshold_uncertainty_score":0.99997085},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011452243,0.0002893704,0.8521122,0.0009687316,0.00078177464,0.00053765025,0.000009503893,0.000047520007,0.14410804],"genre_scores_gemma":[0.99505794,0.00013703726,0.0026296952,0.00019838223,0.00078338094,0.000011011466,0.0000025458885,0.000014680483,0.0011653316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981301,0.00016259377,0.00026904716,0.00043897986,0.0006760266,0.00032328613],"domain_scores_gemma":[0.9973411,0.0015418911,0.00021015957,0.00032943662,0.0005214363,0.00005595536],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014561308,0.00022096296,0.0002561238,0.00011943958,0.0011284351,0.00023355437,0.0007346184,0.0001406099,0.00005737464],"category_scores_gemma":[0.0002529326,0.00012139993,0.000045586527,0.00021293742,0.0032914502,0.00037119896,0.000086466585,0.0003121266,0.00001585348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014352878,0.0000130703875,0.000018317915,0.000005918906,0.000013211806,0.0000045421307,0.0031410349,0.019830963,0.00006443394,0.8332539,0.000008673101,0.1435024],"study_design_scores_gemma":[0.0027363421,0.0029762425,0.00025118416,0.00330495,0.000057263354,0.000017155273,0.00023271157,0.010229431,0.0037667518,0.9632173,0.011499627,0.0017110235],"about_ca_topic_score_codex":0.000052731422,"about_ca_topic_score_gemma":0.0018690043,"teacher_disagreement_score":0.9939127,"about_ca_system_score_codex":0.00019319095,"about_ca_system_score_gemma":0.0013982574,"threshold_uncertainty_score":0.999421},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060308963,0.000063126354,0.9436018,0.00090954994,0.0037585585,0.00093663594,0.00006590907,0.00023357997,0.049827784],"genre_scores_gemma":[0.39642695,0.00010654075,0.5005799,0.018082911,0.017154707,0.000937065,0.0003167151,0.0005398299,0.06585543],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997356,0.00006634369,0.00040772767,0.0012686771,0.00031252095,0.00058872],"domain_scores_gemma":[0.9977631,0.00078434526,0.0002795215,0.0007773517,0.00021858902,0.00017711295],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043779696,0.00043253528,0.00049624615,0.0004102204,0.00024021523,0.00014092175,0.0011167052,0.0006882099,0.0014465495],"category_scores_gemma":[0.00006490225,0.00031452737,0.00020573079,0.00013301383,0.0008019492,0.00011756622,0.00014012141,0.0005594532,0.0002919621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001900552,0.00009864252,0.00003515166,0.0000073156116,0.000027196043,0.000049937935,0.0012809936,0.00007412134,0.003738231,0.042866886,0.00015983211,0.9514716],"study_design_scores_gemma":[0.0027908345,0.0056383465,0.0045914412,0.00065731537,0.00015253139,0.00034771833,0.0000054278585,0.0013452903,0.0010901552,0.9325059,0.047637776,0.0032372782],"about_ca_topic_score_codex":0.00004001797,"about_ca_topic_score_gemma":0.00010595624,"teacher_disagreement_score":0.9482344,"about_ca_system_score_codex":0.00023346579,"about_ca_system_score_gemma":0.00015009232,"threshold_uncertainty_score":0.9999307},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034983616,0.00020964464,0.99328864,0.00046292294,0.0023340003,0.00041568629,0.000022994063,0.00011743939,0.0027988546],"genre_scores_gemma":[0.6885228,0.000031240677,0.30941534,0.000513265,0.00087602355,0.000012110139,0.000017537439,0.000062550884,0.000549105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955818,0.00007789432,0.000643202,0.0018108964,0.0010807671,0.00080545165],"domain_scores_gemma":[0.9966625,0.0003399314,0.0003268012,0.0024151474,0.00010263096,0.0001529868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016040887,0.00045526604,0.00052211835,0.00086104654,0.00023564795,0.0006580783,0.003946931,0.00032168755,0.000020731744],"category_scores_gemma":[0.00014217677,0.0003695503,0.000062038336,0.000647646,0.00034789316,0.0015848252,0.0022947919,0.00049650506,0.00003257663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046595113,0.00021144924,0.0040797642,0.00037022066,0.000073263735,0.00052273687,0.009886351,0.04523877,0.00255831,0.31709945,0.0003995702,0.6195135],"study_design_scores_gemma":[0.0004004985,0.00008575062,0.00015528826,0.0015477977,0.0000057887514,0.0000326706,8.9459235e-7,0.9460593,0.00073182164,0.049418475,0.0008470873,0.0007146361],"about_ca_topic_score_codex":0.00009015964,"about_ca_topic_score_gemma":0.00023358082,"teacher_disagreement_score":0.9008205,"about_ca_system_score_codex":0.0012441033,"about_ca_system_score_gemma":0.0008138798,"threshold_uncertainty_score":0.99987566},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042206363,0.00009877782,0.98082787,0.000799798,0.0008079963,0.014633627,0.000013747343,0.000101763944,0.0022943553],"genre_scores_gemma":[0.5453597,0.00009713359,0.43531346,0.004698457,0.002663476,0.01072101,0.000021370293,0.0002846691,0.00084076205],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99584144,0.00006451722,0.0006487802,0.0014373433,0.0012936954,0.00071422744],"domain_scores_gemma":[0.99742067,0.00034265438,0.00039796744,0.0014176989,0.0002422006,0.00017881417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000745255,0.0005484749,0.00052488863,0.001342435,0.00026645645,0.00022062635,0.0024495204,0.00025816125,0.00008675128],"category_scores_gemma":[0.000024052773,0.0004137123,0.00025330018,0.00070846255,0.00074109127,0.0002218915,0.0008551044,0.0004315421,0.000027939115],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002568382,0.00016057071,0.00010934163,0.0001949102,0.000026472984,0.000059058206,0.002924343,0.003506362,0.0011887816,0.036234263,0.000041731353,0.9555285],"study_design_scores_gemma":[0.011683002,0.011769901,0.005156423,0.008912511,0.00014263931,0.00032890897,0.000015751151,0.2510349,0.22692646,0.43554777,0.040678266,0.0078034583],"about_ca_topic_score_codex":0.000028155395,"about_ca_topic_score_gemma":0.000065883694,"teacher_disagreement_score":0.947725,"about_ca_system_score_codex":0.00020369465,"about_ca_system_score_gemma":0.00034124719,"threshold_uncertainty_score":0.9998315},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002729794,0.0012112514,0.9810112,0.0007226213,0.003214724,0.0006343871,0.00000865688,0.0001986768,0.012971181],"genre_scores_gemma":[0.023172293,0.00023406834,0.95706725,0.0031843379,0.003995102,0.000036636633,0.00000853757,0.00009077162,0.012211001],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957767,0.00003203302,0.0005295552,0.0019453035,0.00077609054,0.00094032683],"domain_scores_gemma":[0.9968631,0.00056737044,0.00032065503,0.001593887,0.00040840547,0.00024656596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010459989,0.0006136736,0.0006364652,0.00057598227,0.00037209256,0.00056036416,0.0039626895,0.00042557484,0.000039222203],"category_scores_gemma":[0.00017182644,0.00043785182,0.00030325132,0.0003440068,0.0005326745,0.0006260341,0.0015568999,0.0004391592,0.00014003062],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073681667,0.000019701461,0.000018396177,0.0000447491,0.000010390319,0.000030276069,0.00038105005,0.00039192595,0.0002190789,0.16013183,0.00043330243,0.8383119],"study_design_scores_gemma":[0.0009651522,0.00050958135,0.00006896624,0.0009459146,0.000019953111,0.000111952875,6.5430825e-8,0.30956936,0.0021932095,0.5742523,0.10979715,0.0015663687],"about_ca_topic_score_codex":0.000004816403,"about_ca_topic_score_gemma":0.000022699765,"teacher_disagreement_score":0.83674556,"about_ca_system_score_codex":0.00032335846,"about_ca_system_score_gemma":0.0005984172,"threshold_uncertainty_score":0.9998073},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009954269,0.0001466421,0.98821396,0.00022746631,0.0014396489,0.00034993162,0.000015150808,0.00012492965,0.009382705],"genre_scores_gemma":[0.7202911,0.00003179416,0.27805007,0.0006172982,0.00041891605,0.00002233017,0.00002126543,0.000039114995,0.0005081301],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735886,0.000033709013,0.00046364137,0.0010306134,0.00072742184,0.00038575171],"domain_scores_gemma":[0.99784416,0.00034709336,0.00033508317,0.0011149455,0.00024526927,0.000113464615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063212233,0.00034928368,0.00036273577,0.0010422058,0.00023711663,0.00014989442,0.0017906016,0.00023251037,0.000067617504],"category_scores_gemma":[0.00006647936,0.00033416308,0.00019612379,0.00085271057,0.00076087116,0.00047347305,0.00066206517,0.00059599447,0.00003838874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010440736,0.000039056984,0.000022048978,0.000018769446,0.000012912624,0.000016827022,0.0007957539,0.040295724,0.000076589895,0.39569706,0.000023738878,0.5629911],"study_design_scores_gemma":[0.00029623692,0.0003952463,0.00047751077,0.00064339215,0.000014927522,0.000026076945,4.1094083e-7,0.06473769,0.0014909041,0.9299451,0.001460416,0.00051207875],"about_ca_topic_score_codex":0.000012568834,"about_ca_topic_score_gemma":0.000026835334,"teacher_disagreement_score":0.72019154,"about_ca_system_score_codex":0.00022164924,"about_ca_system_score_gemma":0.0005261679,"threshold_uncertainty_score":0.99991107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033632608,0.0002022341,0.9945254,0.0005125794,0.00051959633,0.0005496819,0.0000060364155,0.00008173448,0.0002395173],"genre_scores_gemma":[0.7886106,0.000008485523,0.21003959,0.0005617718,0.0003933024,0.000021604466,0.000010229509,0.000025799216,0.00032863874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577975,0.00006706143,0.0006958956,0.0019737037,0.0009401309,0.0005434644],"domain_scores_gemma":[0.99728787,0.0005032595,0.00036325387,0.0013855534,0.00021835364,0.00024168483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013622383,0.00047472553,0.00094007934,0.0015764171,0.00033206076,0.0008474173,0.0020118721,0.00017637381,0.000027423324],"category_scores_gemma":[0.000025702033,0.00036271987,0.0002499349,0.0009246777,0.00029673087,0.00051603955,0.0007926253,0.0002602409,0.000009852976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024891335,0.0005073362,0.087722495,0.000025244459,0.00080622686,0.000033940392,0.0051974617,0.015041227,0.000104862804,0.004887223,0.00008489048,0.8855642],"study_design_scores_gemma":[0.00058816146,0.00066666515,0.0042350776,0.0000631145,0.00027249457,0.0000035656647,0.000002390281,0.9804653,0.00021633318,0.012148454,0.0006844348,0.0006540079],"about_ca_topic_score_codex":0.000008301096,"about_ca_topic_score_gemma":0.00009321384,"teacher_disagreement_score":0.96542406,"about_ca_system_score_codex":0.00014032566,"about_ca_system_score_gemma":0.00014326037,"threshold_uncertainty_score":0.99988246},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014910508,0.0011424351,0.9837498,0.0015547142,0.0032330265,0.0019706453,0.000037237485,0.00010304244,0.00671802],"genre_scores_gemma":[0.8139608,0.00053065625,0.1688842,0.0063500768,0.0043186457,0.00061354286,0.0005969403,0.00015982245,0.004585323],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982012,0.0000073665547,0.00027327918,0.0008137959,0.00038558862,0.00031875152],"domain_scores_gemma":[0.9988362,0.00021114966,0.00014128759,0.00042658008,0.00026263308,0.00012213111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019454517,0.00030365042,0.00038192162,0.0002817535,0.00011473923,0.0000755103,0.00016937744,0.00023761259,0.00018981293],"category_scores_gemma":[0.000036378537,0.0002429401,0.0001474466,0.0001221397,0.00019206629,0.00014061545,0.00008606539,0.00025960963,0.00014688502],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076847486,0.000105344734,0.0003492526,0.00016917931,0.000043319058,0.0000270341,0.000049236296,0.00021968939,0.00010776241,0.00027213697,0.0005035494,0.9980767],"study_design_scores_gemma":[0.009056023,0.008314067,0.036250446,0.011638016,0.0015879982,0.0007167805,0.0000015677534,0.18482263,0.018491816,0.65453494,0.0711175,0.0034682516],"about_ca_topic_score_codex":0.000047264075,"about_ca_topic_score_gemma":0.00004559332,"teacher_disagreement_score":0.9946084,"about_ca_system_score_codex":0.00051560136,"about_ca_system_score_gemma":0.00022103736,"threshold_uncertainty_score":0.990681},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009054419,0.000269302,0.99196976,0.00013799859,0.0039927154,0.0016007494,0.000014137187,0.0008786698,0.0010461019],"genre_scores_gemma":[0.12821975,0.000015521922,0.8695466,0.00078929577,0.0010273311,0.00013329407,0.00000412199,0.00009323559,0.00017084528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99297386,0.00013145173,0.0009945609,0.0031906008,0.00148068,0.0012288237],"domain_scores_gemma":[0.9955685,0.00036271798,0.0003612974,0.0028484932,0.00039527842,0.0004636726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013234655,0.000954366,0.0009826783,0.002369657,0.00025220888,0.00073039485,0.0052717663,0.00054531964,0.000008121783],"category_scores_gemma":[0.00005775989,0.00080528704,0.00017266713,0.0013008083,0.00043963702,0.0007828913,0.0015668579,0.0009879671,0.00006719092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013993079,0.000056338937,0.000011843552,0.00005502133,0.0000056587505,0.000052939486,0.0004929229,0.38118556,0.00017361272,0.0053140125,0.000018953195,0.61261916],"study_design_scores_gemma":[0.0005931274,0.00064383296,0.00009361893,0.0011413668,0.00000625316,0.00019296768,4.0624593e-7,0.9771723,0.002912543,0.012134827,0.003426529,0.001682211],"about_ca_topic_score_codex":0.000035381887,"about_ca_topic_score_gemma":0.000041440886,"teacher_disagreement_score":0.61093694,"about_ca_system_score_codex":0.0011418421,"about_ca_system_score_gemma":0.00037631858,"threshold_uncertainty_score":0.9994398},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009482793,0.00016767916,0.9804228,0.0012973613,0.0011515204,0.0005052711,0.000020050507,0.00026450178,0.016075965],"genre_scores_gemma":[0.33338362,0.00021169733,0.65378505,0.0058591035,0.001372683,0.00006639374,0.000011704804,0.00025927124,0.0050504617],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933601,0.00013150739,0.0005579738,0.0023672658,0.0021326786,0.0014505006],"domain_scores_gemma":[0.9947708,0.0015991733,0.00025931117,0.0026552202,0.00030528023,0.0004102056],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001729545,0.000708592,0.0006420008,0.0020847733,0.0005684551,0.0006585955,0.0065316353,0.0002655494,0.000048497324],"category_scores_gemma":[0.00017030186,0.0005544763,0.00023503383,0.0010244708,0.001859369,0.00088302454,0.0026238675,0.0015385533,0.000430091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001468188,0.000018456405,0.00002833597,0.000018759582,0.000010233261,0.0001174188,0.00023544219,0.0054638702,0.00057785853,0.43560097,0.000011297019,0.5579027],"study_design_scores_gemma":[0.00035825532,0.00036128,0.00008928115,0.00072101457,0.0000026518228,0.000056676643,8.789533e-8,0.075072706,0.0013617533,0.9185855,0.0026097973,0.00078103575],"about_ca_topic_score_codex":0.0000045932093,"about_ca_topic_score_gemma":0.000024713043,"teacher_disagreement_score":0.55712163,"about_ca_system_score_codex":0.00035667807,"about_ca_system_score_gemma":0.00042726612,"threshold_uncertainty_score":0.99969065},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019100076,0.00043343156,0.9946286,0.0016970475,0.0016795461,0.00038796206,0.0000068366844,0.000098789926,0.00087678916],"genre_scores_gemma":[0.30674142,0.00012459973,0.6893295,0.0017911299,0.0009908513,0.00007441195,0.00001716443,0.00004514852,0.0008857534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969223,0.000030403944,0.00057883176,0.0013409948,0.00059902447,0.00052841933],"domain_scores_gemma":[0.99817467,0.00063069473,0.00027498693,0.0005767879,0.00021509765,0.00012775173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085152744,0.00038522546,0.00039121296,0.0011989094,0.00018725269,0.0003046639,0.0012400545,0.00023721252,0.000015865524],"category_scores_gemma":[0.00009290646,0.00034351044,0.00010995531,0.00041409716,0.0002465082,0.0005452725,0.00043158134,0.00023289707,0.000010392225],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010396318,0.000023102222,0.000019079442,0.000028637618,0.000007212637,0.000015692216,0.00020238584,0.026887441,0.00210938,0.17704055,0.00003323603,0.7936229],"study_design_scores_gemma":[0.0012200365,0.00029924614,0.00009863609,0.0011175043,0.000009998839,0.00009928834,1.15656675e-7,0.622686,0.022263316,0.34065935,0.010532908,0.0010135625],"about_ca_topic_score_codex":0.000009251296,"about_ca_topic_score_gemma":0.00005147903,"teacher_disagreement_score":0.79260933,"about_ca_system_score_codex":0.00043595684,"about_ca_system_score_gemma":0.00047865717,"threshold_uncertainty_score":0.9999017},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032222815,0.00040657015,0.99497515,0.0019783138,0.0012106958,0.00043208944,0.000002700149,0.00010617134,0.0008560631],"genre_scores_gemma":[0.0486778,0.000063620784,0.9499664,0.00060455076,0.00031940278,0.000016817876,0.0000034327925,0.000034677898,0.00031330355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968162,0.000034136276,0.00054858037,0.0013976305,0.0005938454,0.00060961285],"domain_scores_gemma":[0.9973363,0.0013735823,0.0002464736,0.00073899725,0.00019924545,0.00010538755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010311793,0.00037550167,0.00042842003,0.0009444763,0.00021725956,0.00027658898,0.0014071738,0.00017076747,0.00000908551],"category_scores_gemma":[0.00044757818,0.00032150742,0.00009804754,0.00039337564,0.0003409201,0.0010779067,0.0007870378,0.00036298836,0.000014199352],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010089637,0.000015062845,0.00004271435,0.000055820536,0.000001938156,0.000012547667,0.0007639718,0.0049584936,0.0008486129,0.011294806,0.000019767587,0.98197615],"study_design_scores_gemma":[0.0004164506,0.00024013242,0.000118649274,0.0014683126,0.0000025327686,0.000012557339,9.742362e-7,0.83230764,0.0005920665,0.16256565,0.0017694605,0.0005055652],"about_ca_topic_score_codex":0.000014671956,"about_ca_topic_score_gemma":0.000029424344,"teacher_disagreement_score":0.9814706,"about_ca_system_score_codex":0.0004492602,"about_ca_system_score_gemma":0.00020678507,"threshold_uncertainty_score":0.9999237},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040721123,0.0011233039,0.982489,0.001918302,0.00064214924,0.00030698968,0.0000018328967,0.0002045754,0.013273114],"genre_scores_gemma":[0.37120047,0.00072127435,0.62409943,0.002160196,0.00077081315,0.000021542648,0.000003044338,0.00006915596,0.00095408986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968145,0.0000550827,0.0004267929,0.0012863802,0.00078306376,0.0006341973],"domain_scores_gemma":[0.99671996,0.0005419699,0.00028353563,0.0019261086,0.00034661553,0.00018179121],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007040598,0.00049187895,0.00043933804,0.0005709437,0.00041261685,0.000510566,0.0039420663,0.00017045977,0.000049415263],"category_scores_gemma":[0.000059959155,0.00035376867,0.00008295574,0.0005668804,0.0006880255,0.0005795247,0.0020725226,0.0006686986,0.0000830346],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034087152,0.000013732163,0.000045976376,0.000010846181,0.000009227564,0.000039038103,0.00050971226,0.00305314,0.000105267,0.039838478,0.00000911482,0.95636207],"study_design_scores_gemma":[0.0018324911,0.0011977062,0.0006343616,0.006049679,0.00003001366,0.0005978453,5.829696e-7,0.8469754,0.003214229,0.11396878,0.021758668,0.0037402418],"about_ca_topic_score_codex":0.0000020393902,"about_ca_topic_score_gemma":0.000068313566,"teacher_disagreement_score":0.9526218,"about_ca_system_score_codex":0.00039202452,"about_ca_system_score_gemma":0.00059411814,"threshold_uncertainty_score":0.9998914},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019862659,0.0001169302,0.98575675,0.0008027784,0.0018310958,0.00040751378,0.0000025239797,0.00029486362,0.010767655],"genre_scores_gemma":[0.098434925,0.00002914285,0.8984927,0.0016935098,0.00041569656,0.000011708377,0.000010670178,0.000036191122,0.0008754445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964895,0.0000518933,0.00066375773,0.0013217147,0.00089941046,0.00057368376],"domain_scores_gemma":[0.9974525,0.00059120014,0.00041125825,0.0011478169,0.00022240465,0.0001747953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011721414,0.00047691603,0.0005738713,0.00076049916,0.0003460324,0.0007707439,0.0018408431,0.0002920842,0.00007148197],"category_scores_gemma":[0.0001733501,0.00044773013,0.00013223215,0.00053704745,0.00046730367,0.0005492895,0.00073029264,0.0006435683,0.00011242131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004115614,0.000006725879,0.000082433144,0.000031286832,0.0000075567973,0.000013595445,0.00031199632,0.09747228,0.00006301054,0.045538276,0.00003314525,0.8564356],"study_design_scores_gemma":[0.0006299766,0.00006429202,0.00008143229,0.00025370764,0.000006901751,0.00006199397,9.761866e-8,0.93300205,0.00037505158,0.06300844,0.0019450277,0.00057103345],"about_ca_topic_score_codex":0.000018253924,"about_ca_topic_score_gemma":0.000056401765,"teacher_disagreement_score":0.8558645,"about_ca_system_score_codex":0.00024263457,"about_ca_system_score_gemma":0.00040176776,"threshold_uncertainty_score":0.99979746},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004932893,0.00030530815,0.98542106,0.0022738702,0.0034110793,0.00048468861,0.000050420702,0.0001755131,0.007828722],"genre_scores_gemma":[0.057195585,0.000044304415,0.9334782,0.005350716,0.0022572493,0.000028088543,0.000018389635,0.00007884018,0.001548652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944241,0.00003453936,0.00062459265,0.002398514,0.0014130445,0.0011051929],"domain_scores_gemma":[0.9947314,0.00050054037,0.00053195335,0.0034433438,0.00032639562,0.00046631866],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00087676087,0.00075677753,0.00076678203,0.0009283666,0.000935806,0.0024741604,0.007888065,0.00042270494,0.00010720041],"category_scores_gemma":[0.00025957433,0.0006635999,0.00023706236,0.00038306194,0.00047911753,0.0018294462,0.0041032364,0.0011201894,0.00013354757],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006083138,0.000036933197,0.000062312625,0.00002945024,0.000014694934,0.00015280841,0.0008475392,0.0014767388,0.00011067133,0.0019755433,0.0012070346,0.9940802],"study_design_scores_gemma":[0.0008651321,0.000722696,0.0011148693,0.0025176383,0.000035581532,0.00028954318,6.684322e-7,0.6919974,0.004164075,0.23605062,0.05944149,0.002800269],"about_ca_topic_score_codex":0.00021581312,"about_ca_topic_score_gemma":0.00014434182,"teacher_disagreement_score":0.9912799,"about_ca_system_score_codex":0.00020478384,"about_ca_system_score_gemma":0.00042609024,"threshold_uncertainty_score":0.9995815},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024762197,0.0003804947,0.9958468,0.0004970567,0.0010789295,0.00043518245,0.0000049925075,0.0003482173,0.0011607016],"genre_scores_gemma":[0.18197934,0.00008930867,0.8148282,0.0015853313,0.0012809982,0.000048667767,0.000008388873,0.000084948915,0.0000947777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960184,0.00003232273,0.000445168,0.0017126105,0.0009867994,0.00080466777],"domain_scores_gemma":[0.99746466,0.0006171149,0.0002189166,0.001305374,0.00014141569,0.0002525379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084368436,0.00058523606,0.0005151649,0.0013424719,0.00017660965,0.0007037849,0.0030412942,0.0003030701,0.000008508977],"category_scores_gemma":[0.000088086,0.00050475815,0.00011054017,0.0012808236,0.0005614921,0.000768793,0.0021982081,0.00074069464,0.00003054169],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001781965,0.00009220662,0.00011587241,0.00038185006,0.00004006668,0.000119034434,0.0024352733,0.017728465,0.011321057,0.05512134,0.0005441553,0.91208285],"study_design_scores_gemma":[0.001151905,0.0002671291,0.000535984,0.0011865832,0.000018358201,0.0001708372,1.3657777e-7,0.52140963,0.013686143,0.45336413,0.0061136726,0.0020954695],"about_ca_topic_score_codex":0.000005167686,"about_ca_topic_score_gemma":0.000005515046,"teacher_disagreement_score":0.9099874,"about_ca_system_score_codex":0.00035945376,"about_ca_system_score_gemma":0.000625613,"threshold_uncertainty_score":0.9997404},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000039164274,0.00027351777,0.99425316,0.00007313809,0.0019444843,0.00097123015,0.00002622695,0.00048871257,0.0019656215],"genre_scores_gemma":[0.08337776,0.000010443987,0.9146447,0.00025027848,0.0006571468,0.00013487208,0.0000053491585,0.0001860891,0.00073336903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977973,0.000009192801,0.0004830858,0.00070134376,0.00041409803,0.00059494533],"domain_scores_gemma":[0.99807245,0.0008431572,0.000079088684,0.000794193,0.00011107786,0.000100060424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006895889,0.0005259767,0.000514502,0.00061380037,0.00007723333,0.00010357148,0.00096788816,0.00035181906,0.0000133891],"category_scores_gemma":[0.000074958036,0.00046431573,0.00014525747,0.00017642562,0.00015347503,0.00016672685,0.00009449337,0.0003488612,0.000028336748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005178139,0.000002926381,0.0000017481772,0.00009467826,0.000011240456,0.00000392321,0.00004595324,0.8601318,0.00021047328,0.00092099194,0.00005615452,0.13851495],"study_design_scores_gemma":[0.00038510325,0.000052866617,0.0000037234422,0.0004264278,0.00001051892,0.0000069798166,1.5089949e-8,0.98146105,0.0015167026,0.011738405,0.0037968538,0.0006013441],"about_ca_topic_score_codex":9.70083e-7,"about_ca_topic_score_gemma":0.0000018460472,"teacher_disagreement_score":0.1379136,"about_ca_system_score_codex":0.0005918455,"about_ca_system_score_gemma":0.00034339284,"threshold_uncertainty_score":0.99978083},"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":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013339109,0.0015071016,0.9934314,0.0002864947,0.0010131699,0.00034591902,0.000011211981,0.00026436942,0.0018064051],"genre_scores_gemma":[0.6493387,0.00013012165,0.3491976,0.0003799241,0.00006837019,0.000007710858,0.00002028733,0.000019374056,0.00083788537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963638,0.00005720848,0.0005431241,0.0016299647,0.00093206245,0.0004737991],"domain_scores_gemma":[0.9971069,0.00038584514,0.000387789,0.0015234854,0.0004824646,0.00011348268],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010819003,0.00044558296,0.00087783823,0.0032018619,0.0002533566,0.0011212142,0.002250539,0.00025153175,0.0000059430777],"category_scores_gemma":[0.00006444988,0.00036778857,0.00014257756,0.00466269,0.0013407805,0.0003367727,0.0013408068,0.0003228677,0.000005981407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021193197,0.00009182772,0.0016232005,0.0006625769,0.0011353752,0.0004278793,0.0081619825,0.046784565,0.00032690837,0.28909212,0.00024445952,0.6514279],"study_design_scores_gemma":[0.00020968901,0.00010087452,0.004454699,0.00056622445,0.00021095954,0.000016193286,8.46612e-7,0.96068484,0.00048777563,0.032202415,0.00057065516,0.0004948177],"about_ca_topic_score_codex":0.0000075077687,"about_ca_topic_score_gemma":0.00009937996,"teacher_disagreement_score":0.9139003,"about_ca_system_score_codex":0.000086112734,"about_ca_system_score_gemma":0.00017445703,"threshold_uncertainty_score":0.9999157},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019307547,0.00008099619,0.9981136,0.00019789003,0.0006397742,0.00030525157,8.8288937e-7,0.00003554554,0.0004329881],"genre_scores_gemma":[0.9394696,0.0000049955206,0.059775125,0.0001860758,0.00017585911,0.0000071511763,0.0000016412384,0.000020066509,0.00035952768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972687,0.000090647525,0.00061725813,0.0008024109,0.0007783063,0.00044267523],"domain_scores_gemma":[0.9973308,0.0011703755,0.00040833888,0.00094099576,0.00009018638,0.000059303933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015492315,0.00031992077,0.00040549473,0.00041259208,0.00023169818,0.0002410993,0.0019446196,0.00015596328,0.000008459721],"category_scores_gemma":[0.00007716936,0.0002477051,0.00009588423,0.00023228477,0.00035016434,0.00015608358,0.0006882118,0.0004925758,0.000014503803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036577842,0.000006734814,0.000093812814,0.000026349333,0.0000025738095,0.00000683872,0.00029083824,0.82631904,0.00008204472,0.016343126,5.287683e-7,0.15682447],"study_design_scores_gemma":[0.00015285861,0.000089431196,0.00053046126,0.00037469718,0.0000018744681,0.0000035058322,2.9005597e-7,0.9859912,0.0004275616,0.004435896,0.0077224914,0.00026975153],"about_ca_topic_score_codex":0.000042238753,"about_ca_topic_score_gemma":0.000057675075,"teacher_disagreement_score":0.93927646,"about_ca_system_score_codex":0.00029321128,"about_ca_system_score_gemma":0.0001330611,"threshold_uncertainty_score":0.9999975},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020039661,0.00030727423,0.9950312,0.0004182562,0.00050078804,0.0003520666,0.000035077337,0.00010994871,0.0030450327],"genre_scores_gemma":[0.26914108,0.00013445696,0.70256,0.004629254,0.0014960513,0.00014057211,0.00003097855,0.00008623603,0.021781396],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965784,0.00005456422,0.00054105476,0.0011656416,0.0013254684,0.00033484955],"domain_scores_gemma":[0.9954484,0.002706729,0.00025521498,0.001171,0.00029240106,0.00012621818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015922986,0.00026753588,0.00036083566,0.0004897492,0.00027431632,0.0007728244,0.0017610688,0.0002239585,0.00013911581],"category_scores_gemma":[0.0011716774,0.00017527287,0.00006447387,0.0007297753,0.000895231,0.00043245484,0.0007483888,0.00024675147,0.00007120188],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050511385,0.000012109626,0.00018210389,0.0000024561698,0.0000021169321,0.0000028976788,0.00027016326,0.00022799632,0.00014099778,0.00781997,0.0008590431,0.9904751],"study_design_scores_gemma":[0.00018096366,0.00005546424,0.00052325474,0.00009806937,0.0000027246974,0.000008860151,5.2654195e-7,0.003872592,0.0028509153,0.9408706,0.051203042,0.00033301004],"about_ca_topic_score_codex":0.000004307209,"about_ca_topic_score_gemma":0.0000052583446,"teacher_disagreement_score":0.9901421,"about_ca_system_score_codex":0.00017322943,"about_ca_system_score_gemma":0.0004982125,"threshold_uncertainty_score":0.74523634},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015367314,0.00057691644,0.98861367,0.0016020476,0.0016007079,0.00031574484,0.0000032424216,0.00006614934,0.0056847725],"genre_scores_gemma":[0.93988866,0.0000843754,0.056762356,0.0027679887,0.0003125422,0.0000102563945,0.0000011001653,0.000015526186,0.00015721681],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969966,0.0000872558,0.00046381744,0.0009498019,0.000992544,0.0005100039],"domain_scores_gemma":[0.9972089,0.0010825933,0.0002624679,0.0012750379,0.00011910967,0.000051900384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011722312,0.00037794033,0.00045391612,0.00053859083,0.00012016101,0.00026567205,0.0037760213,0.00031754348,0.0000045859906],"category_scores_gemma":[0.00020845112,0.0002155701,0.0001225234,0.00041682084,0.0007754956,0.00033740222,0.0005777422,0.0005999524,0.000020557925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021011498,0.000058338534,0.00013795983,0.000030494442,0.0000067404035,0.000117293006,0.0015862023,0.0035607647,0.00048515727,0.4710014,0.00011790701,0.52287674],"study_design_scores_gemma":[0.00047871005,0.00059033104,0.006794292,0.00084012916,0.000008604904,0.00007548467,0.0000018211322,0.034302384,0.0020875116,0.9531933,0.0009805809,0.00064685184],"about_ca_topic_score_codex":0.000029533014,"about_ca_topic_score_gemma":0.00009879978,"teacher_disagreement_score":0.9383519,"about_ca_system_score_codex":0.00012095598,"about_ca_system_score_gemma":0.00024325645,"threshold_uncertainty_score":0.87906927},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010070364,0.00006832585,0.9955222,0.00024910294,0.0006775202,0.00030106495,0.000010852098,0.000080141814,0.0029900915],"genre_scores_gemma":[0.18882181,0.0000055674686,0.8105055,0.00034524605,0.00008031435,0.0000049383734,9.358373e-7,0.000017105694,0.00021855427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725235,0.00010009989,0.00051167596,0.0009181091,0.0007865213,0.0004312247],"domain_scores_gemma":[0.99654603,0.0007653916,0.0005578078,0.0017129269,0.0003431954,0.0000746555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001674983,0.00035382525,0.00037376737,0.00048397193,0.0003048884,0.00018612097,0.0029321823,0.00020531371,0.000008530318],"category_scores_gemma":[0.00015429898,0.0002083098,0.00009495075,0.00066388363,0.0012410183,0.00064334425,0.0009326049,0.00054342713,0.0000059442614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015886264,0.000014481616,0.000029246645,0.000031817,0.000018354429,0.0000039216943,0.00096922985,0.66690344,0.0007743135,0.21530992,0.0000012942797,0.11592812],"study_design_scores_gemma":[0.00010338081,0.000102208556,0.000015471212,0.00039615203,0.00001176884,0.000023463945,2.875885e-7,0.88431233,0.0015449359,0.11319859,0.000027851438,0.0002635566],"about_ca_topic_score_codex":0.000010293865,"about_ca_topic_score_gemma":0.000013656105,"teacher_disagreement_score":0.21740893,"about_ca_system_score_codex":0.00027251485,"about_ca_system_score_gemma":0.0005541306,"threshold_uncertainty_score":0.8494627},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050240813,0.00035523876,0.99547523,0.00026498342,0.0014704446,0.00022474982,0.000023043007,0.00011183388,0.0015720818],"genre_scores_gemma":[0.14448501,0.00012878861,0.8547409,0.00021501188,0.00037138147,0.0000068170557,0.000009907447,0.000022468275,0.00001966555],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698704,0.00003209489,0.00054747507,0.0012300246,0.0007655854,0.00043778805],"domain_scores_gemma":[0.9975097,0.00021901628,0.00042541476,0.0014409305,0.0002801779,0.00012477016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005707543,0.00037147853,0.000445251,0.00087164907,0.00015057065,0.00018626754,0.0023850678,0.0003011505,0.000034468936],"category_scores_gemma":[0.0000400861,0.0003069277,0.00015255202,0.00070334214,0.0012607577,0.00074938964,0.0008051167,0.00038383124,0.000026620244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006098831,0.00001828722,0.00007142498,0.00003565537,0.0000080227865,0.000009691401,0.00013533773,0.0002052421,0.0033325988,0.3454397,0.0000066236526,0.6507313],"study_design_scores_gemma":[0.0004172692,0.00024222623,0.0002846834,0.00053684413,0.0000114080585,0.00010755737,2.3209112e-7,0.06973482,0.023570837,0.90175444,0.0024234424,0.0009162224],"about_ca_topic_score_codex":0.000009030616,"about_ca_topic_score_gemma":0.0000144833475,"teacher_disagreement_score":0.6498151,"about_ca_system_score_codex":0.00012207837,"about_ca_system_score_gemma":0.00031817472,"threshold_uncertainty_score":0.9999383},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035348618,0.0014643071,0.99418306,0.001984065,0.00087110733,0.0003706003,0.0000065691975,0.00031963116,0.0007653267],"genre_scores_gemma":[0.11526938,0.00004192703,0.88299507,0.001068712,0.0002754246,0.000012511927,0.000005158852,0.000031697455,0.00030014935],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961641,0.00004196857,0.0005687228,0.0014164443,0.0011219864,0.0006867658],"domain_scores_gemma":[0.9978407,0.00040016766,0.00029105096,0.0011201143,0.00021258014,0.00013535724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008304409,0.00051002734,0.0004906213,0.0010772865,0.00014710268,0.00041757186,0.003883582,0.0003747979,0.000018302415],"category_scores_gemma":[0.00007001668,0.00040584314,0.00011911081,0.0005602492,0.00059533824,0.00075463095,0.0016746243,0.0008933986,0.000028550074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008127181,0.000050680563,0.00010231454,0.00006912897,0.000007657467,0.00033040595,0.00034558598,0.00075971836,0.0010762702,0.31252527,0.00003079606,0.68469405],"study_design_scores_gemma":[0.00025144068,0.000113899994,0.000059479444,0.0015995011,0.0000037322766,0.000139338,3.4631586e-8,0.06003993,0.0051310863,0.93156415,0.00040994372,0.0006874311],"about_ca_topic_score_codex":0.000013091944,"about_ca_topic_score_gemma":0.00006688338,"teacher_disagreement_score":0.68400663,"about_ca_system_score_codex":0.00056430814,"about_ca_system_score_gemma":0.0004554882,"threshold_uncertainty_score":0.99983937},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001645986,0.00026456075,0.9941643,0.00036847426,0.0027696826,0.00042198808,0.000008005894,0.00039737055,0.0014410116],"genre_scores_gemma":[0.07882562,0.000055633223,0.918258,0.0021077842,0.0005548287,0.000013215524,0.000017827033,0.00003999781,0.00012706709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953208,0.00007661931,0.0005735155,0.002204062,0.0009365154,0.0008885008],"domain_scores_gemma":[0.9958849,0.00036669127,0.00046499813,0.0028758857,0.00014802025,0.00025953096],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013028083,0.0006510678,0.0005861408,0.0012219795,0.00038769725,0.0010092756,0.007709984,0.00043958926,0.00007184806],"category_scores_gemma":[0.00008617072,0.0006047683,0.00016663784,0.0007284032,0.0006028382,0.0013313971,0.001292216,0.001281888,0.0001319197],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003995923,0.000058372476,0.00018781226,0.00001859034,0.000015110756,0.00012704784,0.0006848944,0.022929592,0.000004029141,0.019613804,0.000030215906,0.95632654],"study_design_scores_gemma":[0.00027204168,0.00029450475,0.0009642169,0.00039844617,0.000018630613,0.000016057835,3.0748237e-7,0.7596337,0.0001297318,0.23400173,0.0032672815,0.0010033218],"about_ca_topic_score_codex":0.000039952247,"about_ca_topic_score_gemma":0.00013347603,"teacher_disagreement_score":0.9553232,"about_ca_system_score_codex":0.00019488003,"about_ca_system_score_gemma":0.00034458327,"threshold_uncertainty_score":0.99964035},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016816817,0.00024337432,0.9921448,0.0016569187,0.0016586563,0.00029146546,0.0000025984543,0.00008394524,0.002236525],"genre_scores_gemma":[0.39114812,0.00004935948,0.605842,0.0018754221,0.00058134296,0.000017893188,0.0000036267916,0.00003532111,0.00044690227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664587,0.000032542855,0.00052715687,0.0014038706,0.000793744,0.00059679186],"domain_scores_gemma":[0.998238,0.00029108353,0.00022354457,0.001068216,0.00006325648,0.000115863215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007261186,0.00038411847,0.00036841078,0.0008112432,0.00011034568,0.0002956018,0.0022769002,0.00018480903,0.00002644827],"category_scores_gemma":[0.000033782228,0.000323544,0.00007448556,0.00031469078,0.00032860623,0.000939082,0.0009541297,0.0004034432,0.000034242046],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024475835,0.000013612874,0.00049274444,0.000012589136,0.000003687184,0.00007669954,0.0011127016,0.009483066,0.00011797808,0.009448521,0.000006391176,0.97922957],"study_design_scores_gemma":[0.0008273167,0.00014502466,0.00053748576,0.001657808,0.000007684554,0.000056432746,0.000002340093,0.762824,0.0014555869,0.23079199,0.00054409535,0.0011502111],"about_ca_topic_score_codex":0.000032570577,"about_ca_topic_score_gemma":0.00018233142,"teacher_disagreement_score":0.9780794,"about_ca_system_score_codex":0.00049537583,"about_ca_system_score_gemma":0.0003384606,"threshold_uncertainty_score":0.9999217},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012357687,0.00016296342,0.98363614,0.0029353162,0.00035230085,0.00085600815,0.000023164033,0.00015497672,0.0118668],"genre_scores_gemma":[0.120660126,0.000017853392,0.8724233,0.0034002897,0.00052769476,0.000115699164,0.000019739911,0.00007150257,0.0027637733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609566,0.000048796763,0.00031428298,0.0020855567,0.0006956349,0.00076006417],"domain_scores_gemma":[0.9947005,0.00088330876,0.0003369791,0.0035306243,0.0003845347,0.00016408172],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00087054836,0.0005726854,0.00053277373,0.00029065958,0.00061793433,0.00068893656,0.011583184,0.00026897635,0.000005476319],"category_scores_gemma":[0.00011195127,0.00021913218,0.000065974884,0.00033695094,0.0010970642,0.0011034681,0.003166582,0.00057316566,0.000005172638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020422123,0.00013884771,0.00020846345,0.00014280235,0.00006100143,0.00010900869,0.001153302,0.1316745,0.00020543413,0.09788253,0.00071074074,0.76750916],"study_design_scores_gemma":[0.00061045744,0.00033607037,0.0000294314,0.0005172769,0.00002019862,0.000046975754,1.933621e-7,0.96299225,0.00026640226,0.031083584,0.0035300646,0.000567107],"about_ca_topic_score_codex":0.000016238517,"about_ca_topic_score_gemma":0.0013204367,"teacher_disagreement_score":0.8313177,"about_ca_system_score_codex":0.00015176818,"about_ca_system_score_gemma":0.0014481276,"threshold_uncertainty_score":0.99376464},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000520681,0.000053302592,0.9748037,0.007437566,0.0014013347,0.0004127634,0.000005426429,0.0002025638,0.015678145],"genre_scores_gemma":[0.05598576,0.000013427143,0.93971354,0.0023318597,0.0005640577,0.0000072434996,0.0000037100606,0.000025587575,0.0013548465],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971122,0.000023573308,0.000407648,0.001280082,0.0006979833,0.00047849608],"domain_scores_gemma":[0.9982467,0.00021374442,0.0001782498,0.0009312154,0.000091453905,0.0003386301],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045218872,0.00039692043,0.0003403543,0.0008443307,0.00016979092,0.00048666308,0.0015407813,0.00024582056,0.00019157804],"category_scores_gemma":[0.000039186896,0.00033737102,0.00010049196,0.0004479443,0.00031836494,0.0005798519,0.0006586005,0.00032470774,0.00020432928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023354844,0.0000040571117,0.000015056052,0.0000050559556,0.000004106969,0.000011409378,0.00023438636,0.007872257,0.000051316405,0.18734038,0.00003387057,0.8044258],"study_design_scores_gemma":[0.0009634417,0.00037046307,0.0006526236,0.0010154633,0.00001598726,0.00031718542,4.1537092e-7,0.27671847,0.0032210443,0.70773983,0.006889948,0.0020951522],"about_ca_topic_score_codex":0.000006347457,"about_ca_topic_score_gemma":0.000038726263,"teacher_disagreement_score":0.8023306,"about_ca_system_score_codex":0.00033797402,"about_ca_system_score_gemma":0.0008120779,"threshold_uncertainty_score":0.99990785},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021865078,0.0002671242,0.97534406,0.002296999,0.003125883,0.0003394151,0.000004698757,0.00025894548,0.018341018],"genre_scores_gemma":[0.10643125,0.00020680277,0.870421,0.008966008,0.0025360382,0.00002934543,0.0000025907132,0.00013394558,0.011273046],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99526966,0.000035452253,0.0006441635,0.001913833,0.0012160485,0.0009208591],"domain_scores_gemma":[0.9962729,0.0006412757,0.0003182895,0.0021964132,0.00032615897,0.00024494706],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009229459,0.0005993255,0.0005447084,0.0008202013,0.00026266888,0.0005335064,0.0053598345,0.0004006931,0.00015547335],"category_scores_gemma":[0.00019248758,0.00047517434,0.00019958655,0.0005251034,0.0013255894,0.0010297479,0.0021290625,0.00072044093,0.0009361067],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004319151,0.000017123568,0.000031148367,0.000013728262,0.000008483841,0.00014735352,0.0006045056,0.0015508813,0.0003117884,0.078460895,0.00020205273,0.9186477],"study_design_scores_gemma":[0.0001350393,0.00018622901,0.00002799516,0.0007822792,0.000008411599,0.00010283283,2.0920012e-7,0.12333588,0.01022719,0.83933926,0.024615891,0.0012387598],"about_ca_topic_score_codex":0.000020652977,"about_ca_topic_score_gemma":0.00007580031,"teacher_disagreement_score":0.91740894,"about_ca_system_score_codex":0.00042492486,"about_ca_system_score_gemma":0.000681,"threshold_uncertainty_score":0.9998418},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016076019,0.00029106124,0.97913843,0.000018901816,0.00073082134,0.00016939158,0.000002460218,0.000033611283,0.0035393115],"genre_scores_gemma":[0.98066044,0.00011103281,0.019021787,0.000034202658,0.00010975579,0.0000015351437,0.0000022674228,0.000020237003,0.000038723025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989224,0.000008569616,0.00020253025,0.00024635406,0.00046954385,0.00015059648],"domain_scores_gemma":[0.99946314,0.000056439058,0.000052164705,0.00021940256,0.00017137094,0.00003745745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044497807,0.00015608963,0.00016900997,0.0002486849,0.00003811682,0.00002906731,0.00016529506,0.00011713197,0.000020315105],"category_scores_gemma":[0.000029833029,0.00012847534,0.000017502187,0.000091716916,0.00019813415,0.0001152192,0.000046668818,0.00011625266,0.000004286193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.372995e-7,0.0000012921851,0.00012360838,0.000030547148,0.000002842813,3.7106358e-7,0.00008159207,0.55983984,0.00032682045,0.0001762147,0.0000020605353,0.43941388],"study_design_scores_gemma":[0.00014372465,0.000033481938,0.0004306151,0.00032281427,0.000011058752,0.0000034497868,3.307558e-8,0.99333316,0.0023359864,0.003176041,0.000054716755,0.00015494692],"about_ca_topic_score_codex":0.0000013725353,"about_ca_topic_score_gemma":0.0000066687485,"teacher_disagreement_score":0.9645844,"about_ca_system_score_codex":0.00012480546,"about_ca_system_score_gemma":0.00006755122,"threshold_uncertainty_score":0.52390724},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003344668,0.0010597861,0.9851062,0.0056348178,0.00043080217,0.0016566663,0.00002461058,0.00007237556,0.005680252],"genre_scores_gemma":[0.94067883,0.00007797673,0.049815703,0.0048527946,0.0015897872,0.00015571139,0.00012600071,0.00008879228,0.0026144052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732774,0.0000184732,0.0002686921,0.0009613949,0.00087349216,0.0005502138],"domain_scores_gemma":[0.9982414,0.00037607062,0.00012211778,0.0005518954,0.00037804968,0.0003304356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042806522,0.00033366683,0.00033459382,0.00055699056,0.00016300428,0.00012389384,0.0004560211,0.00016641652,0.00027153184],"category_scores_gemma":[0.00015343087,0.00024052495,0.00018778422,0.00014642326,0.0006502414,0.00011502213,0.00010914358,0.00035278127,0.00004563081],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042331388,0.00010857506,0.0021323194,0.00012721335,0.00004795966,0.000082854225,0.000042122476,0.00012498461,0.00070114655,0.0043283813,0.0001189262,0.9917622],"study_design_scores_gemma":[0.0066561676,0.0027318734,0.2157591,0.003434113,0.0007936614,0.000059785085,7.087289e-7,0.581284,0.010695785,0.16477372,0.011905388,0.0019057135],"about_ca_topic_score_codex":0.0000014467882,"about_ca_topic_score_gemma":0.000009136723,"teacher_disagreement_score":0.9898565,"about_ca_system_score_codex":0.00019131484,"about_ca_system_score_gemma":0.00082123565,"threshold_uncertainty_score":0.98083234},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028554045,0.00087829103,0.98832077,0.00044041383,0.0022135125,0.00044652566,0.0000055780915,0.00029123938,0.007118117],"genre_scores_gemma":[0.2830726,0.00037210938,0.70943636,0.0033878554,0.0021092359,0.00012395316,0.00003758843,0.00016479468,0.0012954917],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947849,0.00016990877,0.0006145763,0.002169151,0.0010376988,0.0012237825],"domain_scores_gemma":[0.99528944,0.0006942348,0.00045457925,0.0029846365,0.00032439936,0.0002526894],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017146377,0.00072190247,0.000782527,0.0028835307,0.0005305129,0.0013013203,0.0087786205,0.00049682317,0.00001952296],"category_scores_gemma":[0.0002583647,0.00067228323,0.00026279534,0.0033783833,0.001281253,0.0010833322,0.0017494867,0.0013956839,0.00005020724],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027984446,0.00016283336,0.002117445,0.00008230277,0.000029988452,0.00029571075,0.0013131198,0.0022847624,0.00017740316,0.027931346,0.0011685893,0.9644085],"study_design_scores_gemma":[0.00080426526,0.00033445616,0.0059369183,0.0015557411,0.000013209726,0.00008793688,1.8806162e-7,0.06505365,0.0007686866,0.9147001,0.009117763,0.0016270833],"about_ca_topic_score_codex":0.00004166518,"about_ca_topic_score_gemma":0.0002382508,"teacher_disagreement_score":0.9627814,"about_ca_system_score_codex":0.0003020806,"about_ca_system_score_gemma":0.0020335375,"threshold_uncertainty_score":0.9997354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006400978,0.00036434937,0.9933116,0.0027744595,0.0009960188,0.00038739239,0.00001997794,0.00016178518,0.0019204149],"genre_scores_gemma":[0.16781686,0.00007105729,0.8250269,0.0017496976,0.00159153,0.000024700827,0.000032568307,0.00010928142,0.003577393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606067,0.00008299448,0.0003987276,0.0018163134,0.0008873403,0.0007539822],"domain_scores_gemma":[0.9974267,0.00053407886,0.00041446582,0.0011412187,0.0002597965,0.00022373466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033027804,0.00063008384,0.0005085638,0.0006436455,0.00056007877,0.0010137025,0.0020617878,0.00028080674,0.000018408531],"category_scores_gemma":[0.00013012883,0.00043901126,0.00012082479,0.0007916584,0.0006620066,0.0011627756,0.0008386854,0.00066617975,0.000014916962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026749949,0.000038229115,0.00015481494,0.000026962238,0.000044382647,0.00014386143,0.00045543863,0.0170466,0.005826748,0.0015000002,0.0009290969,0.9738071],"study_design_scores_gemma":[0.0008262839,0.0004956539,0.0004914893,0.00093929155,0.000039768416,0.00013118607,8.0386826e-7,0.97367233,0.009402321,0.010289944,0.0020594185,0.0016514928],"about_ca_topic_score_codex":0.000058915204,"about_ca_topic_score_gemma":0.00010654965,"teacher_disagreement_score":0.97215563,"about_ca_system_score_codex":0.00021637008,"about_ca_system_score_gemma":0.0004124613,"threshold_uncertainty_score":0.99980617},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005842088,0.00018463812,0.9957886,0.00076289236,0.0016681643,0.00096921,0.000003861474,0.00015694897,0.00040728145],"genre_scores_gemma":[0.12932454,0.00004987841,0.86861634,0.0009936937,0.00071978976,0.00012576998,0.000012600466,0.000051486055,0.000105903426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968468,0.00004088312,0.0005625768,0.0014544551,0.0004204433,0.0006748707],"domain_scores_gemma":[0.9976555,0.00078653934,0.00035512072,0.00091429125,0.00016727997,0.00012123775],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052333693,0.00044752483,0.00038050246,0.0006743174,0.00025649197,0.0003320421,0.0019306443,0.00023030063,0.000008593292],"category_scores_gemma":[0.000043766195,0.0004042519,0.00012309397,0.0006549648,0.00035139566,0.001287548,0.0007610056,0.00055152003,0.000006588805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006976522,0.00001101522,0.000015826521,0.000009617093,0.0000029322453,0.000008492966,0.00019827319,0.35412887,0.00037313468,0.0067810533,0.0000063366183,0.6384575],"study_design_scores_gemma":[0.00039625022,0.000100501784,0.000042880703,0.00015555082,0.0000037958287,0.00002510334,2.8500415e-7,0.929703,0.00044935246,0.06858109,0.000119548495,0.00042264274],"about_ca_topic_score_codex":0.0000066157995,"about_ca_topic_score_gemma":0.00016109429,"teacher_disagreement_score":0.6380348,"about_ca_system_score_codex":0.00061376,"about_ca_system_score_gemma":0.000081957056,"threshold_uncertainty_score":0.9998409},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013275507,0.00052258716,0.98388153,0.0007289366,0.00019006876,0.00038456745,0.000024992622,0.000034165532,0.0009576694],"genre_scores_gemma":[0.9667042,0.00011442674,0.032462317,0.00025846355,0.00025508262,0.000010573052,0.000035874942,0.000017405111,0.00014168797],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9970887,0.000028100892,0.0004413676,0.0012630029,0.0007759121,0.00040297475],"domain_scores_gemma":[0.9982183,0.00051240646,0.00018142394,0.0006763022,0.00015344174,0.00025810662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030105474,0.000362258,0.0009959729,0.0022537224,0.000120882985,0.00014846698,0.0002053303,0.00017481565,0.0003513389],"category_scores_gemma":[0.00008495396,0.00025803922,0.0003085901,0.0016202005,0.00062721333,0.000116037336,0.00014605984,0.00025625792,0.000019325322],"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.00012346446,0.00024418838,0.72812825,0.000068179004,0.005598541,0.0011107702,0.0002935189,0.0056253923,0.00007022657,0.0058424124,0.000017480947,0.25287756],"study_design_scores_gemma":[0.0008104727,0.00044467932,0.90851325,0.0002466245,0.00978896,0.00008695084,2.2265061e-7,0.06257229,0.0004194939,0.016682418,0.000020033078,0.00041461043],"about_ca_topic_score_codex":0.00009141635,"about_ca_topic_score_gemma":0.00053076155,"teacher_disagreement_score":0.9534287,"about_ca_system_score_codex":0.00035087095,"about_ca_system_score_gemma":0.00015141674,"threshold_uncertainty_score":0.9999872},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07312826,0.00006822516,0.9218404,0.003943818,0.00064690615,0.00020740899,4.3449162e-7,0.000056316287,0.000108233464],"genre_scores_gemma":[0.6128812,0.0000011292484,0.38620672,0.0007306979,0.00016069457,0.000010308068,4.6452993e-7,0.000003974786,0.00000481728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980018,0.000059968403,0.00022023357,0.0006863637,0.00058820174,0.00044341126],"domain_scores_gemma":[0.99805564,0.00037145446,0.00019271651,0.0011513601,0.00014994411,0.00007888965],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010063547,0.00017863052,0.00017482306,0.00019930537,0.0011881965,0.0020710663,0.0027768943,0.000040034614,0.0000030530446],"category_scores_gemma":[0.0002146284,0.000114197326,0.000046640722,0.00052863365,0.0004089785,0.001167587,0.0008262883,0.00021167233,0.0000063035795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070934384,0.000035835303,0.007824129,0.0000052331366,0.000008265786,0.000029876526,0.002215244,0.038087964,0.0012838548,0.00074244814,0.000018393148,0.94974166],"study_design_scores_gemma":[0.00039534847,0.00013901107,0.022128204,0.00006143817,0.0000052287687,0.000077898,0.0000017195415,0.953784,0.012634312,0.010271203,0.00024128004,0.0002603842],"about_ca_topic_score_codex":0.000042010717,"about_ca_topic_score_gemma":0.00018598253,"teacher_disagreement_score":0.94948125,"about_ca_system_score_codex":0.000056232126,"about_ca_system_score_gemma":0.00019582905,"threshold_uncertainty_score":0.9989649},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004946178,0.0012211736,0.99235797,0.0009947611,0.002288693,0.000541741,0.00001898007,0.00025652058,0.0018255443],"genre_scores_gemma":[0.22850966,0.00037697522,0.7651799,0.003423053,0.0014077364,0.00018198579,0.00014369417,0.00013669411,0.0006403029],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99516094,0.00009358068,0.00071788277,0.0019090245,0.0011064318,0.0010121496],"domain_scores_gemma":[0.99763495,0.00046574304,0.00017349348,0.0012710656,0.00027128158,0.00018349782],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010794868,0.0005666457,0.00056000904,0.00383326,0.00020856298,0.0011155716,0.0033196763,0.00031936646,0.000040964864],"category_scores_gemma":[0.00007962788,0.0005385291,0.00019506739,0.010921748,0.00053372985,0.0006067225,0.001254566,0.001317185,0.00006303985],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015779651,0.0003334211,0.0032172727,0.00039809657,0.00008386032,0.0008800971,0.0075136162,0.008517092,0.0002314978,0.07654424,0.009202769,0.89306223],"study_design_scores_gemma":[0.00060165534,0.00026116022,0.004381429,0.00083429914,0.000018080205,0.000100254765,0.0000012240769,0.33932167,0.0002800673,0.63910615,0.013705411,0.0013885646],"about_ca_topic_score_codex":0.00014135757,"about_ca_topic_score_gemma":0.0018697164,"teacher_disagreement_score":0.8916737,"about_ca_system_score_codex":0.00041436683,"about_ca_system_score_gemma":0.0017001766,"threshold_uncertainty_score":0.9999214},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040501147,0.00037675703,0.9952852,0.0007094811,0.0013982849,0.00029018347,0.00033975518,0.00020127052,0.0009940461],"genre_scores_gemma":[0.030614233,0.000021597634,0.9667251,0.0011593129,0.0008602632,0.000012950955,0.00036406625,0.00004278823,0.00019968407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99482894,0.000037331687,0.0006179751,0.002754465,0.0010885984,0.00067271985],"domain_scores_gemma":[0.99277085,0.0008401047,0.00037309088,0.0055946843,0.0001620365,0.0002592077],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010366329,0.00055236474,0.0005401566,0.0004563331,0.00033987773,0.00097422214,0.009774517,0.00026257941,0.000026818143],"category_scores_gemma":[0.00013532744,0.0005065439,0.00007786277,0.0005113101,0.00054527493,0.0002715421,0.0052355845,0.00061319594,0.00014000018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011586045,0.000028983128,0.00002162065,0.000009050017,0.000012750818,0.000037925478,0.00040423597,0.017578593,0.000050190494,0.0059187245,0.0003070749,0.9756297],"study_design_scores_gemma":[0.00017799855,0.000057187295,0.000065336535,0.00031872332,0.000013360033,0.000026607837,2.958937e-7,0.976601,0.00014297962,0.011892448,0.010118197,0.00058586424],"about_ca_topic_score_codex":0.00020084373,"about_ca_topic_score_gemma":0.00013861204,"teacher_disagreement_score":0.97504383,"about_ca_system_score_codex":0.00019204515,"about_ca_system_score_gemma":0.00045285095,"threshold_uncertainty_score":0.99973863},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041498362,0.0008735734,0.995812,0.0013182389,0.00081747957,0.0003590304,0.000012974034,0.00011647433,0.0006487143],"genre_scores_gemma":[0.00794272,0.0001494994,0.9872556,0.0024579146,0.0011787373,0.000019182613,0.000042286236,0.000027923159,0.0009261443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967945,0.000028244514,0.0003057071,0.0018076225,0.00055292755,0.0005109918],"domain_scores_gemma":[0.9963947,0.00034022258,0.00016185586,0.002829335,0.0000996471,0.00017423002],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00037226378,0.00034869937,0.0003321619,0.0002728549,0.00025895875,0.0010410113,0.006706672,0.0001928031,0.000010992431],"category_scores_gemma":[0.000032384847,0.00028424215,0.00003036533,0.0007039322,0.0005937076,0.000909551,0.005029765,0.0006153247,0.000021856562],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.5691912e-7,0.000007691504,0.000013311546,0.000013152253,0.0000035338753,0.000010186185,0.00007998388,0.0022095856,0.000022022536,0.006461284,0.0022683544,0.9889106],"study_design_scores_gemma":[0.00008154514,0.00003149616,0.0002586413,0.00005764059,0.0000034821273,0.000057365232,2.7152629e-8,0.7798202,0.000061502564,0.21053284,0.008764295,0.00033097167],"about_ca_topic_score_codex":0.000033060445,"about_ca_topic_score_gemma":0.000028144828,"teacher_disagreement_score":0.9885797,"about_ca_system_score_codex":0.00008145681,"about_ca_system_score_gemma":0.00044710876,"threshold_uncertainty_score":0.999996},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010669333,0.000101105055,0.9912245,0.001070302,0.0010664776,0.001490947,0.000014455454,0.00037957527,0.00464197],"genre_scores_gemma":[0.07573545,0.00004656312,0.9228013,0.0006213698,0.000335606,0.00014772521,0.000004869534,0.00004214204,0.000264981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965639,0.000030936713,0.0005740386,0.0011801012,0.0010709073,0.00058013265],"domain_scores_gemma":[0.9968804,0.0006742555,0.00027284052,0.0012593874,0.0007953387,0.00011775235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016173729,0.00041949464,0.00040669422,0.00091666065,0.00035607404,0.0003483505,0.002591502,0.00029242874,0.000024017269],"category_scores_gemma":[0.0002537452,0.0003593037,0.00016250173,0.0004407995,0.00032831854,0.0016419259,0.00056402874,0.00038465264,0.00002998763],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054136585,0.000012030881,0.0000018325759,0.00004260873,0.0000068589397,0.0000035918388,0.00022956771,0.0033137803,0.0011569499,0.019820474,0.000027891787,0.975379],"study_design_scores_gemma":[0.00029758556,0.00013049395,0.000017726947,0.00037092314,0.000010438328,0.000020712068,5.648221e-8,0.50764936,0.017691845,0.47131634,0.0020509092,0.00044359535],"about_ca_topic_score_codex":0.0000030972276,"about_ca_topic_score_gemma":0.000037567355,"teacher_disagreement_score":0.9749354,"about_ca_system_score_codex":0.00040132366,"about_ca_system_score_gemma":0.0005446971,"threshold_uncertainty_score":0.9998859},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014379501,0.00007379431,0.9946396,0.0017619698,0.0008912995,0.0006080393,0.000016142569,0.00031033767,0.001555055],"genre_scores_gemma":[0.73060364,0.000023005181,0.26738092,0.0011241313,0.00024738247,0.00002824549,0.0000019004656,0.000037736212,0.000553004],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965791,0.00008643459,0.00053048227,0.0012978154,0.0010153187,0.0004908246],"domain_scores_gemma":[0.99556583,0.001195736,0.00046911114,0.0022413402,0.0004197194,0.0001082619],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017047995,0.00042827427,0.0004289482,0.0005220574,0.00024047378,0.0001338998,0.0034098064,0.00034668055,0.00003945916],"category_scores_gemma":[0.0004667649,0.0002719985,0.0001658991,0.0005801316,0.0009701835,0.00043516292,0.0010617223,0.0007973525,0.000032990494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014138313,0.000022836513,0.000032783635,0.000024872708,0.000004950406,0.000011648656,0.00014069906,0.00078314514,0.0004068544,0.49459895,0.000024023337,0.5039351],"study_design_scores_gemma":[0.00012090246,0.00038409836,0.00019567569,0.0005002318,0.0000033686472,0.000023858425,4.2491695e-8,0.008431053,0.027168902,0.9621,0.0006831585,0.00038868003],"about_ca_topic_score_codex":0.0000040249715,"about_ca_topic_score_gemma":0.0000143211155,"teacher_disagreement_score":0.73045987,"about_ca_system_score_codex":0.00052859774,"about_ca_system_score_gemma":0.00030787077,"threshold_uncertainty_score":0.99997324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006691054,0.0007009549,0.988095,0.00062086154,0.0016998535,0.00042820215,0.0000054930942,0.00016632164,0.0015922451],"genre_scores_gemma":[0.6975502,0.000064622356,0.3012011,0.00060097524,0.00033961513,0.00001087374,0.00001784774,0.000025427064,0.00018932627],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955593,0.00006208664,0.0006817849,0.0020382681,0.0010214518,0.00063714624],"domain_scores_gemma":[0.9966196,0.00061836053,0.00050788966,0.0016642906,0.00031830365,0.00027157646],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016947979,0.0006071711,0.0006446746,0.0011173029,0.001045427,0.001481477,0.0027598047,0.00030053873,0.0000080350355],"category_scores_gemma":[0.0001890171,0.0005961719,0.00017418299,0.00039480187,0.0009720625,0.0011841711,0.0013738897,0.0008072972,0.000023120474],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000092465225,0.00003817164,0.0011125876,0.00010464946,0.000022894912,0.000069483205,0.0012645666,0.0147260465,0.00029793172,0.100799166,0.000026247557,0.88152903],"study_design_scores_gemma":[0.00037211872,0.00014652529,0.0024971021,0.00031626428,0.0000118310545,0.00011207172,2.9381437e-7,0.26200187,0.0014047085,0.73059547,0.0017176351,0.00082410907],"about_ca_topic_score_codex":0.000049613092,"about_ca_topic_score_gemma":0.00009786643,"teacher_disagreement_score":0.8807049,"about_ca_system_score_codex":0.00018851638,"about_ca_system_score_gemma":0.00042278453,"threshold_uncertainty_score":0.999649},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007619607,0.00037693616,0.99465287,0.00031663326,0.001121616,0.0007091453,0.000016958908,0.00004981103,0.001994078],"genre_scores_gemma":[0.14260696,0.00040259192,0.8545291,0.00032424522,0.0013867752,0.00006984988,0.000004021436,0.00008678819,0.0005896854],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99638337,0.00005104871,0.00056586193,0.0014095303,0.0007988405,0.00079136965],"domain_scores_gemma":[0.99645483,0.0019170627,0.00028021348,0.00091143267,0.00026913977,0.00016733643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010966182,0.00044248658,0.0006701309,0.0017365525,0.00015081302,0.00016969329,0.0023630047,0.00027447435,0.000011256273],"category_scores_gemma":[0.00015728593,0.00035912884,0.00012398223,0.0007971887,0.0013270121,0.0006990219,0.0010547191,0.000519607,0.00000306234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040986157,0.00002528577,0.00018685106,0.000058882662,0.000010635723,0.000043331853,0.0003644066,0.00027361262,0.00049012504,0.14442232,0.000007155386,0.8540764],"study_design_scores_gemma":[0.0008149789,0.00040202742,0.00045168115,0.00047617868,0.0000041885105,0.000021891252,3.3239246e-7,0.05402814,0.005059282,0.93750656,0.00073536526,0.00049938494],"about_ca_topic_score_codex":0.000008685297,"about_ca_topic_score_gemma":0.00018309524,"teacher_disagreement_score":0.853577,"about_ca_system_score_codex":0.00021346589,"about_ca_system_score_gemma":0.00039688588,"threshold_uncertainty_score":0.9998861},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018920712,0.00089989696,0.99259263,0.00092082046,0.0015650187,0.00025268173,0.000108247856,0.0003113311,0.003160177],"genre_scores_gemma":[0.21680185,0.0001335637,0.78050876,0.0010300011,0.000749615,0.0000053755807,0.00014399728,0.000060364036,0.00056649884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99427056,0.00004503834,0.0007472184,0.0028789302,0.0012487492,0.0008094826],"domain_scores_gemma":[0.99439985,0.00035179555,0.0003788937,0.0044274856,0.00017642727,0.00026554163],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00071924017,0.00073923444,0.0007152588,0.0005261121,0.0003039485,0.0014514426,0.010682308,0.00040799426,0.00006961546],"category_scores_gemma":[0.00009983711,0.00067672174,0.0001083925,0.00045191645,0.00061259203,0.0017772828,0.0053421757,0.0011011602,0.00017807871],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008707101,0.000076922646,0.00032376952,0.000044715693,0.000041049825,0.00032701207,0.0009198017,0.017431835,0.00012061972,0.0203128,0.00028882868,0.9601039],"study_design_scores_gemma":[0.00020371914,0.00007122816,0.00007831747,0.00046559572,0.000009372796,0.00002564736,1.3012439e-7,0.81367433,0.00010896769,0.1825559,0.0019878033,0.0008190118],"about_ca_topic_score_codex":0.00042384147,"about_ca_topic_score_gemma":0.00025651214,"teacher_disagreement_score":0.9592849,"about_ca_system_score_codex":0.00018279225,"about_ca_system_score_gemma":0.00061235554,"threshold_uncertainty_score":0.99958515},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000112860704,0.00017530766,0.9867172,0.003785579,0.0011443399,0.0010128075,0.000033179596,0.000120049386,0.0068986476],"genre_scores_gemma":[0.9774343,0.0000075300823,0.019372266,0.0013679677,0.0015636132,0.000062166015,0.000011758955,0.000028882378,0.00015154376],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971356,0.00006900683,0.00047439506,0.00086884503,0.0008492694,0.0006029064],"domain_scores_gemma":[0.99674726,0.0015319923,0.00051475246,0.00038179735,0.00066588976,0.00015830246],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015437828,0.0003679794,0.0004856968,0.00042088225,0.0010754127,0.0013987748,0.0018070077,0.0003922133,0.000042502237],"category_scores_gemma":[0.00033996854,0.00029446895,0.0001454625,0.00032178263,0.0015076806,0.001535723,0.0001745436,0.00033239817,0.000011548249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006086403,0.000023128185,0.0010390556,0.00006816446,0.000022147236,0.000013274959,0.0010009373,0.0113924015,0.00009838626,0.29563475,0.000028764096,0.69061816],"study_design_scores_gemma":[0.0015252816,0.00015888803,0.00023483844,0.00044281362,0.000034347646,9.713004e-7,0.0000059641097,0.06053886,0.00020845015,0.9316483,0.004431646,0.00076964597],"about_ca_topic_score_codex":0.0004462996,"about_ca_topic_score_gemma":0.0054532103,"teacher_disagreement_score":0.9773214,"about_ca_system_score_codex":0.00044151,"about_ca_system_score_gemma":0.002637284,"threshold_uncertainty_score":0.99995077},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021584844,0.00028353973,0.9600952,0.0012106027,0.0006256617,0.00033942645,0.0000034219693,0.0003240078,0.037115984],"genre_scores_gemma":[0.008624171,0.00004694602,0.984028,0.0017950207,0.0003288369,0.000012416339,0.000009180465,0.00005169962,0.0051037697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593073,0.00003820432,0.00037655156,0.0014146578,0.0015577506,0.0006821143],"domain_scores_gemma":[0.9971634,0.00017241192,0.00021997119,0.0014464512,0.0006542214,0.0003435465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090456795,0.00046175005,0.00042768996,0.0007285966,0.00020429559,0.000680538,0.003395178,0.00023683574,0.00004497042],"category_scores_gemma":[0.000055163797,0.0003658393,0.00006084869,0.00085632975,0.0006293141,0.0007816648,0.0011856857,0.0007977657,0.000110451314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011437709,0.000036893125,0.00002276153,0.00003275777,0.000013388952,0.00018130723,0.001242152,0.3445864,0.000011392592,0.03993378,0.0003905541,0.6135372],"study_design_scores_gemma":[0.000511262,0.00045305054,0.000016038673,0.0003138541,0.0000053992585,0.0001719024,2.5917186e-7,0.91577196,0.00008607808,0.06833838,0.013549409,0.0007824316],"about_ca_topic_score_codex":0.000022284938,"about_ca_topic_score_gemma":0.000112269176,"teacher_disagreement_score":0.61275476,"about_ca_system_score_codex":0.00029638593,"about_ca_system_score_gemma":0.0012349904,"threshold_uncertainty_score":0.99987936},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011946655,0.0006649956,0.96405196,0.00006066323,0.0011365424,0.00015897816,0.00000275588,0.00031347442,0.033598684],"genre_scores_gemma":[0.5504924,0.0013555546,0.4401218,0.0015743676,0.0013642653,0.000026868773,0.000036866342,0.00028897982,0.004738898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876195,0.000003790436,0.00022648524,0.00043039306,0.00027732682,0.0003000666],"domain_scores_gemma":[0.99929994,0.000069518086,0.000053668497,0.00036963404,0.00012307355,0.00008416247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015920804,0.0002958757,0.00024081438,0.0003753181,0.00008707639,0.00012065395,0.0006176993,0.00021277307,0.000116168405],"category_scores_gemma":[0.00003190198,0.0002774913,0.00003885672,0.00029754927,0.00023816884,0.0001518979,0.00011499889,0.00038876713,0.0000633725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016163576,0.000008423725,0.000031905824,0.00031811683,0.000010348172,0.0000142124045,0.0019881933,0.7406614,0.000031410156,0.0032218033,0.00004004867,0.25367254],"study_design_scores_gemma":[0.00031896838,0.00013356326,0.000037986112,0.0012298906,0.000017373544,0.000043420674,1.7524273e-7,0.85402596,0.003913288,0.10750224,0.031272974,0.001504188],"about_ca_topic_score_codex":0.000007410802,"about_ca_topic_score_gemma":0.00008332262,"teacher_disagreement_score":0.5504805,"about_ca_system_score_codex":0.00009351556,"about_ca_system_score_gemma":0.00015201107,"threshold_uncertainty_score":0.99996775},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047763126,0.00027564366,0.9832373,0.0040752105,0.0026304713,0.00036209347,0.0000053285103,0.0002944582,0.009071685],"genre_scores_gemma":[0.1509896,0.00008628868,0.82235426,0.018899089,0.0020054223,0.000022315806,0.0000051641664,0.00013132855,0.005506548],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99433625,0.00004343232,0.00076918904,0.0022987707,0.0014909696,0.001061392],"domain_scores_gemma":[0.99564344,0.000735504,0.0004389414,0.0025210425,0.0003781308,0.00028291612],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011549245,0.0007501127,0.000746634,0.0009945605,0.0003748583,0.0009785638,0.0066813696,0.00043571915,0.00012726328],"category_scores_gemma":[0.00017004412,0.000708322,0.00023917138,0.00071845483,0.0013675162,0.00060367765,0.0022261052,0.0010675681,0.0008821154],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034605973,0.000015246645,0.00005526206,0.000030386886,0.000011764562,0.00006101448,0.0020629081,0.0056191757,0.00027205577,0.082502395,0.0005294225,0.9088369],"study_design_scores_gemma":[0.000077845114,0.00018293985,0.000026443708,0.00033803825,0.000007801771,0.0000493965,2.2862076e-7,0.46739256,0.006201406,0.4805788,0.044130135,0.0010144028],"about_ca_topic_score_codex":0.0000710362,"about_ca_topic_score_gemma":0.000099627134,"teacher_disagreement_score":0.9078225,"about_ca_system_score_codex":0.00032897,"about_ca_system_score_gemma":0.00046377126,"threshold_uncertainty_score":0.9998958},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011239678,0.0006079017,0.98312855,0.0011741694,0.0066651376,0.0006086918,8.816908e-7,0.00040739938,0.0073960153],"genre_scores_gemma":[0.15461886,0.000021913042,0.8380392,0.0020449276,0.0018095779,0.00003540396,0.000010694856,0.00006384897,0.0033555438],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947729,0.00004366131,0.0006373349,0.0020670427,0.0014158621,0.0010632091],"domain_scores_gemma":[0.9966236,0.00028702646,0.00040675217,0.0017774611,0.0006120358,0.0002931218],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011685569,0.0007087356,0.00067669025,0.00065886875,0.00049468403,0.0011295557,0.0040089763,0.0007227236,0.00008593431],"category_scores_gemma":[0.00008981221,0.0005679565,0.00019777207,0.00080041226,0.0011142235,0.0006036834,0.0017343556,0.0015817906,0.00020875341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002690378,0.000042679476,0.00002937037,0.00003403977,0.000010312937,0.00018735269,0.00026976125,0.00044861424,0.00018003081,0.3864002,0.000019775911,0.61237514],"study_design_scores_gemma":[0.000368017,0.0003166468,0.00011964769,0.0000906413,0.0000126781515,0.00030129013,1.7406674e-7,0.03529081,0.00047679344,0.8522037,0.10956385,0.0012557256],"about_ca_topic_score_codex":0.000043213957,"about_ca_topic_score_gemma":0.000120835975,"teacher_disagreement_score":0.61111945,"about_ca_system_score_codex":0.00017598363,"about_ca_system_score_gemma":0.00064135087,"threshold_uncertainty_score":0.9999074},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025631762,0.00052488036,0.9927851,0.00023777633,0.0013982734,0.00055608165,2.236553e-7,0.00024960804,0.0042224135],"genre_scores_gemma":[0.28567195,0.000106020685,0.7100174,0.000747437,0.00042586887,0.000018432978,0.000008526185,0.00007313938,0.0029312575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943247,0.00008009119,0.0011497221,0.0015358804,0.0014240898,0.0014855482],"domain_scores_gemma":[0.9967717,0.0006496118,0.00066896796,0.0014441829,0.00018873166,0.0002768116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021470778,0.0007535354,0.00073089206,0.0013840223,0.00034263334,0.00068469363,0.0036986324,0.00044659036,0.00006992231],"category_scores_gemma":[0.00037706757,0.00075481104,0.00014440829,0.00091619603,0.00046752638,0.0012449854,0.0027664262,0.0022355318,0.00019830132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025774534,0.000014591541,0.00039271617,0.000033161283,0.0000068574127,0.000039257597,0.0011719051,0.82781523,0.00019440457,0.0015507459,0.000002331887,0.16877623],"study_design_scores_gemma":[0.0004777134,0.00017517582,0.00030592046,0.00058950187,0.0000069455077,0.000036308425,5.081247e-7,0.99429274,0.00034959265,0.0010805319,0.0018584104,0.000826651],"about_ca_topic_score_codex":0.00005567269,"about_ca_topic_score_gemma":0.00003887051,"teacher_disagreement_score":0.28564632,"about_ca_system_score_codex":0.0008053603,"about_ca_system_score_gemma":0.0004520614,"threshold_uncertainty_score":0.99949026},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020839437,0.00008609455,0.9974946,0.00035571487,0.00028176614,0.00046017568,0.000019864983,0.000024705514,0.0010687165],"genre_scores_gemma":[0.17156884,0.000013486182,0.8277739,0.00035018925,0.00002965303,0.000004934869,0.000013540921,0.000008925951,0.0002365281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978995,0.00003083735,0.0005799896,0.0006967101,0.00057227723,0.00022071373],"domain_scores_gemma":[0.9962469,0.0013874092,0.00036421965,0.0005571132,0.001332455,0.0001119325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012064837,0.0002196506,0.00044316525,0.0008641855,0.00009151401,0.000090912545,0.0007982064,0.00017642014,0.00001769781],"category_scores_gemma":[0.001021354,0.00019118343,0.00011207877,0.002069281,0.0003587725,0.00027852046,0.00041875144,0.0002189521,0.0000041924786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007196899,0.00020510876,0.003793201,0.0001918231,0.00010741012,0.000002101624,0.0032094906,0.1964501,0.00007124413,0.2528278,0.000061665196,0.5430081],"study_design_scores_gemma":[0.00024472625,0.00029982795,0.0015591816,0.00015963642,0.000031489766,0.00000241684,6.1020586e-7,0.84835154,0.00059193344,0.14792576,0.00054060423,0.00029230537],"about_ca_topic_score_codex":0.00004925164,"about_ca_topic_score_gemma":0.000051884374,"teacher_disagreement_score":0.6519014,"about_ca_system_score_codex":0.00013235291,"about_ca_system_score_gemma":0.00032498728,"threshold_uncertainty_score":0.7796234},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050776574,0.00020979386,0.9929474,0.0012654675,0.0029176457,0.0008680585,0.000029957144,0.0001727776,0.001081115],"genre_scores_gemma":[0.07476274,0.00008433083,0.9224043,0.0016765064,0.0006115274,0.00010314184,0.00003270604,0.000059975355,0.00026479072],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99556184,0.0000538951,0.00075606385,0.001868115,0.000794375,0.00096570334],"domain_scores_gemma":[0.9966865,0.000890967,0.00033234392,0.0015776645,0.0002878226,0.00022468819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013652612,0.0006422711,0.0006656382,0.0015405044,0.00039092184,0.00062611303,0.0038525858,0.00058883673,0.000025208443],"category_scores_gemma":[0.00014846731,0.00062792504,0.00027706366,0.001191043,0.0011095422,0.00076694373,0.0010986186,0.0015326424,0.00001761243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035002577,0.00019409566,0.0002698834,0.00014821094,0.000022938664,0.00012485209,0.0013755533,0.017781291,0.0006606023,0.40779907,0.0000538065,0.5715347],"study_design_scores_gemma":[0.00039409625,0.00022446127,0.00033167028,0.00034361766,0.000007136844,0.000040984993,2.859709e-7,0.33395597,0.0009212633,0.6594312,0.0036564255,0.0006928569],"about_ca_topic_score_codex":0.000058264515,"about_ca_topic_score_gemma":0.0016450359,"teacher_disagreement_score":0.57084185,"about_ca_system_score_codex":0.00013763468,"about_ca_system_score_gemma":0.00052032276,"threshold_uncertainty_score":0.9996172},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028295162,0.0010577398,0.9817465,0.00035921525,0.0032539326,0.00024924532,0.0000013023869,0.000111348185,0.013192429],"genre_scores_gemma":[0.1868947,0.00046490756,0.80677444,0.003103742,0.0014018967,0.000032205597,0.0000051260126,0.000062183135,0.0012608132],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606144,0.000051991312,0.0006768637,0.0015663262,0.0007960187,0.0008473419],"domain_scores_gemma":[0.99803656,0.00028530427,0.00028195066,0.0011126499,0.00015098334,0.00013251985],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010597452,0.00047023766,0.0005098905,0.0010668495,0.000119993856,0.0005226083,0.0059187277,0.0002905555,0.000028535485],"category_scores_gemma":[0.00012674383,0.0004267342,0.000118203105,0.0012037128,0.0006262915,0.0014840771,0.001668739,0.0010616127,0.00011810048],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004768139,0.000046753255,0.000017337412,0.000029643143,0.0000014312922,0.000107106236,0.0013453219,0.008156186,0.000017202166,0.05151712,0.000021879581,0.93873525],"study_design_scores_gemma":[0.000039174614,0.0001520522,0.000023279936,0.00050893886,0.0000016611598,0.000033320684,2.6667334e-7,0.30787092,0.0028541652,0.684741,0.003233838,0.00054135855],"about_ca_topic_score_codex":0.00004892356,"about_ca_topic_score_gemma":0.00035239698,"teacher_disagreement_score":0.9381939,"about_ca_system_score_codex":0.00041452312,"about_ca_system_score_gemma":0.0008147215,"threshold_uncertainty_score":0.99981844},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048339178,0.00017016112,0.9858318,0.0008211545,0.00084897724,0.00034560502,0.0000064638575,0.00004699149,0.011445428],"genre_scores_gemma":[0.8216088,0.00019899156,0.1511018,0.0076909866,0.0009879187,0.00003823767,0.00001222757,0.00006871874,0.018292328],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963361,0.000044842727,0.00054210855,0.0013082272,0.0014226654,0.0003460631],"domain_scores_gemma":[0.9973851,0.0008908618,0.0003104945,0.001079661,0.0002050491,0.00012886872],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0030550242,0.00027339158,0.00035787807,0.0007604025,0.00024946185,0.0011651516,0.0015929688,0.00017240323,0.00015869232],"category_scores_gemma":[0.0005740618,0.00020957139,0.000058341866,0.0004377422,0.00070445536,0.00066610717,0.0015123237,0.00041826203,0.00036733373],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002592218,0.000004983262,0.000013993133,0.000007639911,0.0000034911357,0.000006211754,0.00023364325,0.0014691707,0.00010041675,0.0058882926,0.00009440849,0.99217516],"study_design_scores_gemma":[0.00018332704,0.000109933055,0.0010452975,0.00012830934,0.0000099348135,0.00002382101,0.0000018376526,0.15834357,0.00089990534,0.77422065,0.06450952,0.00052390574],"about_ca_topic_score_codex":0.000066767214,"about_ca_topic_score_gemma":0.00015421928,"teacher_disagreement_score":0.99165124,"about_ca_system_score_codex":0.00008816569,"about_ca_system_score_gemma":0.00006822636,"threshold_uncertainty_score":0.99987173},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045133114,0.00037792663,0.9815868,0.0012073116,0.0028496995,0.00040540876,0.0000013182905,0.00009522704,0.013431155],"genre_scores_gemma":[0.042621996,0.000073458905,0.9544427,0.0015720229,0.00055321073,0.000020150854,0.0000014856455,0.000031228425,0.0006837674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651486,0.00008750007,0.0005196319,0.0013103117,0.00092416356,0.0006435574],"domain_scores_gemma":[0.9955535,0.0005312556,0.00045875792,0.0032047506,0.00015905849,0.00009270422],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0030877474,0.00041659828,0.00040849202,0.00062853337,0.00051559316,0.0009948926,0.008761573,0.00029653148,0.000009856589],"category_scores_gemma":[0.0004779585,0.00031705407,0.000099627156,0.00037011201,0.0010219525,0.0011170289,0.0019853923,0.0012018626,0.000063941065],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030103552,0.000011851905,0.000058864796,0.000022825672,0.0000037797047,0.000038155416,0.0011357802,0.010558343,0.00007814581,0.099452004,0.000012028012,0.8886252],"study_design_scores_gemma":[0.00019935892,0.000076210126,0.0015030911,0.0005345615,0.000004272988,0.00007869255,2.3688604e-7,0.7615903,0.0010742547,0.22636071,0.007944506,0.00063382316],"about_ca_topic_score_codex":0.00006208447,"about_ca_topic_score_gemma":0.00020406417,"teacher_disagreement_score":0.88799137,"about_ca_system_score_codex":0.00034025963,"about_ca_system_score_gemma":0.00046675248,"threshold_uncertainty_score":0.9999282},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046572072,0.00067969476,0.9951791,0.000021443657,0.0011538252,0.00097342173,0.000017715493,0.00022048867,0.0012885893],"genre_scores_gemma":[0.85567045,0.000017556215,0.14253628,0.00010181563,0.0011022758,0.00007483976,0.00007355522,0.00010773975,0.0003155055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825823,0.000008635626,0.00042461816,0.00047459762,0.00043475197,0.00039917647],"domain_scores_gemma":[0.9990366,0.00016495283,0.000096297554,0.00035306904,0.00024606116,0.00010303243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004360392,0.00035893416,0.00037943016,0.00067733333,0.00014496442,0.0003726282,0.0003103332,0.00024639867,0.000017758335],"category_scores_gemma":[0.00002609543,0.00029849674,0.000047363486,0.0004113377,0.0000884686,0.00043070447,0.000045693076,0.00023621916,0.00003192038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009860804,0.000017687835,0.000087295935,0.000254694,0.000029958126,0.0000019270387,0.00060209417,0.9397273,0.0068488573,0.0016692538,0.000013190378,0.050737854],"study_design_scores_gemma":[0.0003657358,0.000088818,0.000027060833,0.0002946886,0.000013641008,0.00006278502,2.688247e-7,0.9971005,0.0007090481,0.00006769365,0.0008480218,0.00042177644],"about_ca_topic_score_codex":0.000013758513,"about_ca_topic_score_gemma":0.000021104092,"teacher_disagreement_score":0.8552047,"about_ca_system_score_codex":0.00032323922,"about_ca_system_score_gemma":0.00011987273,"threshold_uncertainty_score":0.9999467},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011571929,0.00048762007,0.99291426,0.00007148476,0.0038426078,0.00038664055,0.00003049511,0.00014546762,0.00096424064],"genre_scores_gemma":[0.9508849,0.00012371555,0.047261454,0.00013375764,0.0011593233,0.000008169679,0.000021231494,0.00009121062,0.00031624126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997942,0.000008283113,0.0003053363,0.00075056223,0.0004226755,0.0005711498],"domain_scores_gemma":[0.9986427,0.00019092612,0.00012032413,0.0008132451,0.0000970452,0.0001357569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043150928,0.00043234963,0.00039678864,0.000417711,0.00038064024,0.0003406988,0.0015081852,0.00027198016,0.000027165963],"category_scores_gemma":[0.00005487117,0.0004206719,0.00013207363,0.00006797015,0.00024676562,0.00024783716,0.00029830975,0.0006024212,0.000012219073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070803267,0.000009819744,0.00009898585,0.00018856276,0.000022590886,0.00006070708,0.0010133527,0.49218774,0.00052652793,0.0016727011,0.000049523613,0.50416243],"study_design_scores_gemma":[0.0002659372,0.00016224763,0.000110484194,0.00087525346,0.000024462928,0.00002236906,9.62613e-7,0.9739905,0.00788156,0.008565673,0.0071265916,0.00097398396],"about_ca_topic_score_codex":0.0000619595,"about_ca_topic_score_gemma":0.00019064847,"teacher_disagreement_score":0.9497277,"about_ca_system_score_codex":0.00036222616,"about_ca_system_score_gemma":0.00010162327,"threshold_uncertainty_score":0.9998245},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82089615,0.0013460778,0.08179131,0.020516751,0.016685594,0.0026675828,0.00005993226,0.00023018006,0.055806417],"genre_scores_gemma":[0.9971262,0.000039173083,0.0006821983,0.00033513323,0.0009269064,0.0000039703455,0.0000025043232,0.000008874599,0.00087499083],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981836,0.00006278348,0.00024479863,0.00039111136,0.0006223123,0.0004953649],"domain_scores_gemma":[0.9989689,0.000569745,0.00015166488,0.00009000518,0.00010536787,0.000114339105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006101963,0.00016225502,0.00022665547,0.00048808916,0.0002909198,0.00019842114,0.00050245767,0.0001862808,0.000016707949],"category_scores_gemma":[0.0014626421,0.00017998397,0.000022819277,0.00021501396,0.00067601417,0.00017677883,0.00013377298,0.00078078755,0.000003547415],"study_design_candidate":"observational","study_design_consensus":null,"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.000008100855,0.000019491228,0.61684453,0.000049880233,0.000011452198,0.000123136,0.029669527,0.007296031,0.000032879438,0.11190852,0.00012299632,0.23391347],"study_design_scores_gemma":[0.0018982423,0.00026705343,0.3305747,0.004109696,0.00002704202,0.000061905535,0.00016147787,0.06877913,0.00061170396,0.5225813,0.06710601,0.0038217502],"about_ca_topic_score_codex":0.94663143,"about_ca_topic_score_gemma":0.99545264,"teacher_disagreement_score":0.41067278,"about_ca_system_score_codex":0.0022694906,"about_ca_system_score_gemma":0.006562369,"threshold_uncertainty_score":0.9990695},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042411932,0.0008039025,0.9882112,0.00020262257,0.0046354276,0.00038033267,0.000022366336,0.00002851919,0.0052915104],"genre_scores_gemma":[0.32171026,0.0020300332,0.5293133,0.0068448726,0.07617559,0.00029156348,0.001146844,0.0009465477,0.061540943],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975598,0.00003554941,0.00026839858,0.0010541603,0.00053116103,0.00055096764],"domain_scores_gemma":[0.99872196,0.00004532834,0.0001343385,0.00081298465,0.00016244371,0.00012297663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046672625,0.00035989127,0.00029474436,0.00023725153,0.00010395831,0.000096849595,0.0011656446,0.0004124648,0.000027350616],"category_scores_gemma":[0.00007504845,0.00029571127,0.0001095457,0.00021399479,0.0005494118,0.000007010528,0.00071667065,0.0002693111,0.000058995687],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032588803,0.00008843305,0.00018949079,0.00006274351,0.000060947063,0.00005545996,0.00012062029,0.0008649409,0.03029007,0.00036427507,0.0019824132,0.965888],"study_design_scores_gemma":[0.0065590674,0.0031651063,0.00063008827,0.0010322398,0.00008788815,0.00022547103,5.383276e-7,0.012491384,0.17454535,0.26659444,0.52956194,0.0051064836],"about_ca_topic_score_codex":0.0000036062875,"about_ca_topic_score_gemma":0.000008691131,"teacher_disagreement_score":0.9607815,"about_ca_system_score_codex":0.00017788468,"about_ca_system_score_gemma":0.00083672104,"threshold_uncertainty_score":0.9999495},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018852473,0.00026553278,0.9878671,0.0009883209,0.0044098734,0.0008882044,0.0000033090648,0.00008779913,0.0036045818],"genre_scores_gemma":[0.44212916,0.0004994533,0.527614,0.0031551605,0.012008985,5.673532e-7,0.00015194861,0.00016366348,0.014277083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742633,0.00002299316,0.00068629254,0.0007070574,0.00084617874,0.00031115836],"domain_scores_gemma":[0.9978604,0.00051719864,0.0006051032,0.00065963855,0.0002312546,0.00012643904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009997048,0.00031586757,0.0006113406,0.0007871272,0.0002623048,0.00022028435,0.00045949942,0.00037157885,0.00011422795],"category_scores_gemma":[0.00067282695,0.00027199875,0.00030218568,0.0001664417,0.00037423606,0.00022688434,0.00033401925,0.0005090449,0.000049053433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004374874,0.00001126213,0.06574485,0.000140712,0.0001950269,0.00019650708,0.00052119006,0.04804109,0.0004147628,0.00085421634,0.00006116198,0.8833817],"study_design_scores_gemma":[0.005998295,0.0009812675,0.008093839,0.0012623518,0.00089466135,0.000113111164,6.818271e-7,0.94244546,0.00037510876,0.024162766,0.014261795,0.0014106366],"about_ca_topic_score_codex":0.000023827266,"about_ca_topic_score_gemma":0.000015270529,"teacher_disagreement_score":0.8944044,"about_ca_system_score_codex":0.00030374897,"about_ca_system_score_gemma":0.00037978712,"threshold_uncertainty_score":0.99997324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007169575,0.0001129154,0.9920845,0.0005067398,0.0024972924,0.0009954055,0.00006527586,0.00021613907,0.0034500281],"genre_scores_gemma":[0.02089657,0.00009355442,0.97207224,0.0017293257,0.0011807778,0.000060942282,0.00010183945,0.00011627141,0.003748459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994723,0.000034962603,0.00068217074,0.0021939718,0.0013190095,0.0010468707],"domain_scores_gemma":[0.9952877,0.00075560797,0.0007194751,0.0025044892,0.00043677702,0.00029594442],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009524481,0.0008564201,0.00079930056,0.0007960561,0.0007854621,0.0011032149,0.0041731386,0.00066283264,0.000011216611],"category_scores_gemma":[0.0000996993,0.00077739963,0.00025896975,0.0003086993,0.00063052133,0.0006987802,0.0008556589,0.00096308696,0.00003482704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000113119,0.00005101862,9.6732e-7,0.00002520854,0.000016850761,0.0000379753,0.0002448515,0.24542965,0.00009002297,0.0037896077,0.00016921744,0.75013334],"study_design_scores_gemma":[0.0006990741,0.00046755598,0.0000023471187,0.00047380477,0.000010936307,0.000029488021,7.1005594e-8,0.96889615,0.0047190096,0.018269653,0.0055772266,0.00085466955],"about_ca_topic_score_codex":0.000017871998,"about_ca_topic_score_gemma":0.00002303746,"teacher_disagreement_score":0.74927866,"about_ca_system_score_codex":0.00045118728,"about_ca_system_score_gemma":0.00038847895,"threshold_uncertainty_score":0.9999337},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005706357,0.00052083796,0.9903318,0.0010289887,0.00083919603,0.00039101302,0.0000069371986,0.00006448012,0.0067596543],"genre_scores_gemma":[0.3790901,0.00009149332,0.61884105,0.0003446469,0.0004611153,0.00002215488,0.000010863342,0.000056336274,0.001082258],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964619,0.00011459834,0.00057348976,0.000929028,0.0013522739,0.0005686619],"domain_scores_gemma":[0.99577576,0.0012404404,0.00045165617,0.0016020047,0.0007878387,0.0001423226],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0034442528,0.00032629035,0.00040718575,0.00047167935,0.00042240223,0.00034431426,0.004456886,0.00017229612,0.000009809387],"category_scores_gemma":[0.00048075803,0.00024026626,0.000100426885,0.0007040975,0.0035128111,0.0005758151,0.0013444663,0.00078438624,0.000018646764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010996696,0.000007848065,0.0000065457607,0.00001847358,0.000006644573,0.0000110210185,0.0007910124,0.0061298767,0.00020782824,0.4133504,0.000025199779,0.57943416],"study_design_scores_gemma":[0.00014500412,0.00011503696,0.000021119813,0.000119657976,0.0000017485751,0.000024453937,6.1470485e-7,0.21559024,0.001841123,0.78097373,0.00094370806,0.00022356353],"about_ca_topic_score_codex":0.000011714641,"about_ca_topic_score_gemma":0.00010747129,"teacher_disagreement_score":0.5792106,"about_ca_system_score_codex":0.00025869027,"about_ca_system_score_gemma":0.0006245102,"threshold_uncertainty_score":0.99919903},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001878219,0.0012895799,0.9636734,0.00018614792,0.002738445,0.00031755882,0.0000010420546,0.0004273709,0.03134767],"genre_scores_gemma":[0.07604103,0.00018562253,0.8827081,0.0027690302,0.003932557,0.00004890422,0.000021328624,0.00014108136,0.034152403],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995337,0.00017079109,0.0004776486,0.0019235708,0.001003291,0.0010877153],"domain_scores_gemma":[0.9970403,0.0007981232,0.0003103377,0.0013532887,0.00025133396,0.0002466349],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018867118,0.0006405652,0.0006250851,0.00083266967,0.0004984296,0.0008173564,0.00535701,0.0004523342,0.000027744476],"category_scores_gemma":[0.0003430718,0.0005515707,0.00020436147,0.0014040685,0.0009196494,0.0006928856,0.0020169392,0.0017401831,0.0001878772],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039234783,0.00005644315,0.000047533507,0.00005754372,0.000014714501,0.00021539997,0.003906855,0.052843925,0.00003120729,0.057895653,0.00007859962,0.8848482],"study_design_scores_gemma":[0.0004905259,0.00030564776,0.00014160443,0.00053110946,0.000011117749,0.00020541789,3.9896148e-7,0.29004163,0.0005913619,0.69280165,0.013785816,0.0010937346],"about_ca_topic_score_codex":0.0000133571975,"about_ca_topic_score_gemma":0.00002437668,"teacher_disagreement_score":0.8837545,"about_ca_system_score_codex":0.0016331441,"about_ca_system_score_gemma":0.004968297,"threshold_uncertainty_score":0.9996936},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021492026,0.00029683363,0.98294383,0.00004950916,0.010482805,0.0003428805,0.000010212735,0.00034256425,0.005316423],"genre_scores_gemma":[0.7866874,0.00040456114,0.13163103,0.0020549744,0.05756408,0.00010085552,0.00005787302,0.0007536343,0.020745631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759793,0.0000390776,0.00047382948,0.0007190139,0.00062699994,0.0005431331],"domain_scores_gemma":[0.99868643,0.00030269625,0.00010452374,0.00065363216,0.00011858444,0.00013411976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065121596,0.00042498787,0.00048247588,0.00068280776,0.0001415794,0.00025209002,0.00066791935,0.00057685317,0.000052692787],"category_scores_gemma":[0.00002416329,0.000309331,0.00012916506,0.00046555387,0.00020822692,0.00028724942,0.00023533245,0.0006177823,0.00034825807],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006438182,0.0000065066215,0.0000047230815,0.000048810998,0.0000086316195,0.000029601648,0.00007872499,0.05490268,0.00059399166,0.000030597977,0.0073404945,0.9369488],"study_design_scores_gemma":[0.0012177865,0.00072555966,0.00013375127,0.004316764,0.000017888311,0.00019712155,1.15442695e-7,0.7764641,0.0060870284,0.011620664,0.19739673,0.0018224982],"about_ca_topic_score_codex":0.000008606289,"about_ca_topic_score_gemma":0.000012513846,"teacher_disagreement_score":0.9351263,"about_ca_system_score_codex":0.00061002467,"about_ca_system_score_gemma":0.00027505984,"threshold_uncertainty_score":0.99993587},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005734653,0.0007568327,0.9938264,0.00046497656,0.0010892901,0.0006492317,0.00007573384,0.000018467206,0.0025455903],"genre_scores_gemma":[0.99625385,0.000013259857,0.0023835422,0.00010808266,0.00024758728,0.000026899823,0.00000588311,0.000020945161,0.00093996455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825877,0.000020535792,0.0007148805,0.00060259347,0.0001237434,0.0002794894],"domain_scores_gemma":[0.9964078,0.0011096637,0.0012425737,0.0010763138,0.00013143924,0.0000321879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031787045,0.00024236487,0.0006793,0.0005059291,0.0004491924,0.00023359554,0.0013459236,0.00016794258,0.000011351222],"category_scores_gemma":[0.00010760334,0.0001560524,0.00028220008,0.00021583999,0.00054130907,0.00010455016,0.00015432353,0.00025640434,0.000011181923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021277367,0.000022156508,0.0007031368,0.00033472062,0.00041993754,0.000003108578,0.0021157197,0.15949517,0.000008885193,0.7949174,0.0000076049405,0.041950878],"study_design_scores_gemma":[0.00019360491,0.00007275146,0.0015571968,0.00026349557,0.000187991,0.0000111549325,0.000004476071,0.89068735,0.000031333024,0.10551791,0.0011593234,0.00031339235],"about_ca_topic_score_codex":0.00007890615,"about_ca_topic_score_gemma":0.00014321481,"teacher_disagreement_score":0.9956804,"about_ca_system_score_codex":0.00014452024,"about_ca_system_score_gemma":0.00005141459,"threshold_uncertainty_score":0.6363632},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9206095,0.00017730171,0.075536005,0.0016688011,0.00023094173,0.001634031,0.0000011736518,0.000057175283,0.000085083724],"genre_scores_gemma":[0.97785133,0.000009853025,0.021113154,0.0006197418,0.00022985335,0.00016140235,0.0000017243411,0.000011007451,0.0000019470406],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99827826,0.000040665876,0.00016718965,0.0007013157,0.00043973414,0.00037285237],"domain_scores_gemma":[0.99864894,0.0001439245,0.000091987706,0.000874829,0.00010784554,0.00013245545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034994466,0.00021541874,0.00036668006,0.000100718615,0.0004645638,0.00022359281,0.0005141263,0.00006597906,0.000021913047],"category_scores_gemma":[0.00012318425,0.00012247807,0.000042486838,0.0002704273,0.0004349192,0.00019528548,0.00016679097,0.00023317404,0.000007773782],"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.00017444028,0.0005504963,0.89364463,0.000031270556,0.000039501523,0.0003705403,0.0025191545,0.0008939836,0.00012274536,0.000017091095,0.000012869873,0.101623274],"study_design_scores_gemma":[0.003690049,0.0038917542,0.9768988,0.00041459422,0.00005386399,0.00010586741,0.000020806063,0.011192831,0.0031763213,0.00024018652,0.000059008613,0.00025594863],"about_ca_topic_score_codex":0.000100969955,"about_ca_topic_score_gemma":0.00016811246,"teacher_disagreement_score":0.101367325,"about_ca_system_score_codex":0.00017620987,"about_ca_system_score_gemma":0.00023845528,"threshold_uncertainty_score":0.49945107},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032220615,0.00021323794,0.98680586,0.0009783338,0.0004802971,0.0003524379,0.0000030927804,0.0000548191,0.010789743],"genre_scores_gemma":[0.9300731,0.000016136391,0.066764414,0.0027474235,0.00017607208,0.00002232202,8.943193e-7,0.000024334779,0.00017530884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977888,0.000030027277,0.0003337046,0.00087290566,0.0005930934,0.0003814548],"domain_scores_gemma":[0.99691784,0.00092378334,0.00029696274,0.0016450325,0.00012952175,0.00008687466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003115527,0.00033605576,0.00030638286,0.00027675767,0.00020222987,0.00013573407,0.0039431513,0.00014747864,0.000070639755],"category_scores_gemma":[0.00004708471,0.00020974514,0.00012875858,0.00036919303,0.0007872193,0.00008944457,0.00094372866,0.00066320086,0.00002581268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005782447,0.000033150143,0.000004831199,0.000008006831,0.000009961058,0.00001565179,0.0012825518,0.027448067,0.0001851377,0.50371337,0.00008963341,0.4672039],"study_design_scores_gemma":[0.00008203861,0.00017921484,0.00009697444,0.00018952812,0.0000041387434,0.000021071775,9.372048e-8,0.08461404,0.0041242703,0.9096501,0.00069487526,0.00034365276],"about_ca_topic_score_codex":0.000008566211,"about_ca_topic_score_gemma":0.000018190283,"teacher_disagreement_score":0.92975086,"about_ca_system_score_codex":0.000039464503,"about_ca_system_score_gemma":0.00010533702,"threshold_uncertainty_score":0.85531586},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025959942,0.00035310275,0.99780893,0.00007347577,0.00043984753,0.0002857999,0.00015684028,0.00050940574,0.00011299593],"genre_scores_gemma":[0.08398276,0.00027000922,0.9140085,0.00009577215,0.0008042713,0.000009877721,0.00063766656,0.00009728237,0.00009387279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982557,0.0000023401326,0.00021887357,0.00077944,0.00025377155,0.0004898594],"domain_scores_gemma":[0.99761397,0.00014192193,0.0000917479,0.0020254184,0.00007308115,0.000053835793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000119441356,0.0003078156,0.00028856786,0.00019505157,0.000112798174,0.00013266766,0.0029185745,0.00031445865,0.00000440349],"category_scores_gemma":[0.000107242224,0.00029859124,0.00003476366,0.0000614681,0.0003382849,0.00046612957,0.00038344224,0.0005997309,0.0000042477727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.99587e-7,0.0000072919715,7.613421e-7,0.000017373171,0.0000058384994,0.000003410346,0.000011157079,0.07180375,0.0041222903,0.0001830132,0.000010119281,0.92383397],"study_design_scores_gemma":[0.00011995992,0.000065194945,0.0000026805305,0.000074112555,0.000008544359,0.000008459061,5.6888517e-8,0.8631084,0.045436554,0.08617319,0.0046593947,0.00034345355],"about_ca_topic_score_codex":0.0000026480718,"about_ca_topic_score_gemma":0.000041511674,"teacher_disagreement_score":0.9234905,"about_ca_system_score_codex":0.00025867604,"about_ca_system_score_gemma":0.000040610223,"threshold_uncertainty_score":0.9999466},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3189582,0.000073934105,0.66937447,0.0065152836,0.0026370015,0.00020847727,0.000004244199,0.00008799179,0.0021403737],"genre_scores_gemma":[0.988452,0.0000018540301,0.008628464,0.0024254147,0.00044944364,0.000004206071,8.5162924e-7,0.0000057132193,0.00003206447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989438,0.000020107913,0.000147174,0.00032712333,0.00025470587,0.00030710828],"domain_scores_gemma":[0.9995177,0.000043648153,0.000038014645,0.00020263945,0.0001406004,0.00005742353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023142602,0.000119109565,0.0001244766,0.00013530182,0.00031731653,0.00036448915,0.00034933217,0.000031198095,0.0005124296],"category_scores_gemma":[0.00003488854,0.00009002289,0.000032629585,0.00025978402,0.0006375793,0.00028665445,0.00013709924,0.00015973099,0.00006453088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003482953,0.0007179569,0.0026210102,0.000054844717,0.000029518927,0.00017023487,0.04386228,0.18195674,0.004467934,0.64067435,0.0002427352,0.12516755],"study_design_scores_gemma":[0.0012511394,0.0004025413,0.008736702,0.00009221957,0.000007896752,0.000012272229,0.0000098604205,0.026935827,0.0060110223,0.9488449,0.007034663,0.0006609238],"about_ca_topic_score_codex":0.00039634356,"about_ca_topic_score_gemma":0.0033855182,"teacher_disagreement_score":0.6694938,"about_ca_system_score_codex":0.00009777233,"about_ca_system_score_gemma":0.00012449134,"threshold_uncertainty_score":0.56107444},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16305244,0.00017065603,0.8344572,0.0014119942,0.000695406,0.00010088187,1.4562188e-7,0.000054733937,0.000056537883],"genre_scores_gemma":[0.7512121,0.000014916059,0.24827164,0.0004603473,0.000035809797,0.000002576198,2.3073345e-7,0.000001950743,3.8698974e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986678,0.00006651744,0.0002583354,0.00037781228,0.00032855535,0.00030097907],"domain_scores_gemma":[0.9989164,0.00027579322,0.00012565727,0.00054691656,0.000115029725,0.00002019479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038248117,0.000113450355,0.0001672757,0.0001312595,0.00025245454,0.000067662,0.0016655147,0.000058779988,0.0000012355048],"category_scores_gemma":[0.00016250533,0.000074395226,0.000033978933,0.0011556672,0.00063946185,0.00092150806,0.00046606315,0.00014193443,0.0000029742735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013959634,0.0001316769,0.019652339,0.00003591594,0.000012477709,0.000035142097,0.037715346,0.31948486,0.010999513,0.028405808,0.000017907603,0.5834951],"study_design_scores_gemma":[0.0001705759,0.00011690005,0.022731297,0.00003177356,0.0000016636577,0.00013349621,0.0000047759236,0.86182946,0.08465838,0.030165441,0.000027651693,0.00012857006],"about_ca_topic_score_codex":0.00017316751,"about_ca_topic_score_gemma":0.00010373149,"teacher_disagreement_score":0.5881597,"about_ca_system_score_codex":0.00003897957,"about_ca_system_score_gemma":0.00010975685,"threshold_uncertainty_score":0.30949685},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000400161,0.0003232281,0.99307287,0.00042043434,0.0010943447,0.0003151116,0.0000039343986,0.00009063928,0.004639427],"genre_scores_gemma":[0.011788372,0.000041041367,0.9857159,0.0004908238,0.0006898055,0.000015348343,0.00001444894,0.000019632887,0.0012245992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973085,0.000015583462,0.000349912,0.0011226224,0.0007792468,0.0004241565],"domain_scores_gemma":[0.9978892,0.00035379463,0.000303787,0.001165969,0.0001383778,0.00014887],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007558154,0.0003621785,0.00040231066,0.0005331085,0.00047566244,0.0012140503,0.0023486947,0.00020328621,0.0000037157447],"category_scores_gemma":[0.00008802644,0.0003263571,0.000057930956,0.00040072872,0.0005038926,0.00053674955,0.0013907271,0.0004371448,0.000021952377],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013346372,0.000023165525,0.00000395945,0.000064479085,0.000008413609,0.000023472108,0.00074802985,0.01709158,0.00014052866,0.020710872,0.00012648776,0.96105766],"study_design_scores_gemma":[0.00019121612,0.000054091757,0.00011211724,0.00013216662,0.000005931769,0.00005937574,9.81291e-8,0.75403893,0.0006161756,0.2424613,0.0019179981,0.00041062385],"about_ca_topic_score_codex":0.0000037869374,"about_ca_topic_score_gemma":0.0000127028625,"teacher_disagreement_score":0.96064705,"about_ca_system_score_codex":0.00016024472,"about_ca_system_score_gemma":0.0007748413,"threshold_uncertainty_score":0.9999189},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008630008,0.00041241347,0.98842484,0.0014101863,0.0015738953,0.0003850888,0.0000011313282,0.000114709175,0.0076690842],"genre_scores_gemma":[0.12521386,0.00042693975,0.86968195,0.002375941,0.0005467157,0.000018133538,0.000005264308,0.000052717303,0.0016784853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621844,0.000042366795,0.00052467576,0.0014931144,0.0007981424,0.00092326326],"domain_scores_gemma":[0.99710107,0.00027175582,0.00032524098,0.0018467135,0.0002528648,0.0002023533],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015120362,0.00044112487,0.0005060878,0.00081645715,0.00035603959,0.0011912466,0.005169353,0.00035528102,0.000021894033],"category_scores_gemma":[0.00020496533,0.0004084343,0.00010306304,0.00037330063,0.00070573075,0.00096372055,0.0018073665,0.0013079861,0.00004187793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002500503,0.000013092817,0.00013943216,0.000014121178,0.000002866966,0.00010080191,0.00024271202,0.66654444,0.0000050846465,0.027827311,0.0000139126505,0.30509374],"study_design_scores_gemma":[0.00027749006,0.000054003893,0.00021181321,0.0006015455,0.0000011691461,0.000025788297,5.9272736e-8,0.92050165,0.000022083557,0.07669281,0.0011701097,0.0004414702],"about_ca_topic_score_codex":0.000037373233,"about_ca_topic_score_gemma":0.00026704336,"teacher_disagreement_score":0.30465227,"about_ca_system_score_codex":0.0002961215,"about_ca_system_score_gemma":0.0005738457,"threshold_uncertainty_score":0.9998456},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011805568,0.003783369,0.99127984,0.00095096766,0.0019303269,0.00062932004,0.000008667685,0.00014978767,0.0011496749],"genre_scores_gemma":[0.052623104,0.0006143003,0.9422156,0.0021115532,0.0006526742,0.00001770289,0.000019666924,0.000077597375,0.0016677945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599344,0.000048711696,0.0006237902,0.0016717684,0.000854925,0.00080738566],"domain_scores_gemma":[0.99516547,0.000561396,0.00054105686,0.0028334507,0.0005678058,0.0003308257],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00087383256,0.00068704766,0.0006806189,0.0009285687,0.0014285432,0.0012367509,0.0059035053,0.00032684093,0.000029059585],"category_scores_gemma":[0.0001706959,0.00065137784,0.00031623614,0.00042613747,0.000911584,0.0010059841,0.002827,0.0008296957,0.00001771791],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009535244,0.00002493462,0.00002952055,0.000018693647,0.000022378797,0.000012931016,0.0003401383,0.0064425636,0.0005086162,0.08631955,0.00019097612,0.9060802],"study_design_scores_gemma":[0.0006594103,0.0001388813,0.00004499281,0.0007760107,0.000017731943,0.000083679486,1.2125851e-7,0.76120776,0.0007945765,0.19926366,0.0360189,0.0009942525],"about_ca_topic_score_codex":0.000023682764,"about_ca_topic_score_gemma":0.000079813704,"teacher_disagreement_score":0.9050859,"about_ca_system_score_codex":0.00021804548,"about_ca_system_score_gemma":0.0012168112,"threshold_uncertainty_score":0.99987143},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030257393,0.000022457303,0.9724636,0.00080546096,0.0011277328,0.00028053758,0.000012411551,0.000024540588,0.024960695],"genre_scores_gemma":[0.9809757,0.0000011221249,0.014147352,0.0009625664,0.003552766,0.0000049165283,0.000051275943,0.000024168372,0.00028012294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981691,0.000012813264,0.00033336645,0.0006023602,0.00048507508,0.00039724304],"domain_scores_gemma":[0.998641,0.00047436255,0.00023941002,0.00047840804,0.000101911566,0.00006489533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059236214,0.00028500133,0.00021524426,0.00014142974,0.0002571746,0.00017553361,0.0005605299,0.00010626134,0.000029908122],"category_scores_gemma":[0.000018726518,0.00019587352,0.00009215404,0.00026331146,0.00025162683,0.00007197574,0.00013107227,0.00056791806,0.000026675738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029822757,0.000019187526,0.00013448103,0.000002299145,0.0000069358143,0.0000024566189,0.00017742232,0.40866536,0.000007933724,0.072292745,0.000103590195,0.5185578],"study_design_scores_gemma":[0.00014537806,0.00011057173,0.00076474325,0.00013554223,0.000009130993,0.000002400568,3.3155743e-7,0.8849693,0.000048080423,0.11146438,0.002034369,0.00031575],"about_ca_topic_score_codex":0.00003978024,"about_ca_topic_score_gemma":0.0000103151715,"teacher_disagreement_score":0.98067313,"about_ca_system_score_codex":0.00007331512,"about_ca_system_score_gemma":0.00009355914,"threshold_uncertainty_score":0.7987491},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057875975,0.0006241877,0.9937663,0.00018004027,0.00040768174,0.00028033473,0.000007876608,0.000022460177,0.0046532587],"genre_scores_gemma":[0.17478453,0.00025255943,0.82425946,0.00040261017,0.00010369994,0.000011526956,0.000009970276,0.000012285995,0.00016337824],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878377,0.000009654364,0.0003382974,0.00039502134,0.00028178055,0.00019150722],"domain_scores_gemma":[0.9985044,0.00010678208,0.00036818357,0.00062649423,0.00033383854,0.00006028147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025422225,0.0002270255,0.0003195869,0.00030589534,0.00015252414,0.00017560147,0.0011116873,0.00015703875,0.0000048010343],"category_scores_gemma":[0.0000136484,0.00016870875,0.000022121312,0.00020997447,0.0006555241,0.0005990367,0.00072525284,0.0001798535,0.000003104234],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002392764,0.000008618752,0.00008329602,0.00005832377,0.000009245804,7.0494565e-7,0.00044706318,0.000092780094,0.000027149737,0.023713116,0.000009406798,0.9755479],"study_design_scores_gemma":[0.0012475908,0.0004819738,0.028336737,0.00084108784,0.00002784374,0.00005948023,0.0000010464076,0.10217003,0.0015095312,0.80799013,0.05576705,0.0015674749],"about_ca_topic_score_codex":0.000019401477,"about_ca_topic_score_gemma":0.0000071585214,"teacher_disagreement_score":0.9739804,"about_ca_system_score_codex":0.000027087577,"about_ca_system_score_gemma":0.00018975897,"threshold_uncertainty_score":0.68797433},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008543347,0.00007197819,0.68472314,0.017264957,0.0059598866,0.0016053,0.00004460175,0.00016950014,0.28161728],"genre_scores_gemma":[0.9534582,0.000027119264,0.03623853,0.0023037775,0.0016482497,0.000012587497,0.000014559111,0.00002325697,0.006273709],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998256,0.00015143251,0.00027392755,0.0004407723,0.0006531017,0.00022472769],"domain_scores_gemma":[0.99760276,0.00057957566,0.00038726686,0.00067364256,0.00069667026,0.000060062495],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014744296,0.00017375109,0.00018608339,0.00031895336,0.0014906159,0.00058208837,0.0009799402,0.00018529163,0.00007564816],"category_scores_gemma":[0.001035316,0.00013149352,0.00003248955,0.00034292374,0.0014206824,0.0006174438,0.00008738354,0.0006671588,0.000010000533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011346276,0.00007488764,0.000016850832,0.000004376699,0.0000096521335,0.0000019106,0.021260962,0.014350585,0.00015904006,0.42550293,0.00021490343,0.53839254],"study_design_scores_gemma":[0.00038648234,0.0010755043,0.00092448207,0.0009947205,0.00003387775,0.0000066453795,0.00017571775,0.04103975,0.0017249222,0.4202456,0.531983,0.0014092745],"about_ca_topic_score_codex":0.0006767574,"about_ca_topic_score_gemma":0.005696298,"teacher_disagreement_score":0.9449149,"about_ca_system_score_codex":0.00022045826,"about_ca_system_score_gemma":0.0015372789,"threshold_uncertainty_score":0.9998093},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044911285,0.00018107354,0.9943934,0.00013871747,0.0018625045,0.0014925966,0.000019871626,0.00047198712,0.0013949289],"genre_scores_gemma":[0.064919785,0.00003071318,0.9337195,0.00032484139,0.0003191108,0.00002698961,0.000010242185,0.000111937195,0.0005368401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99246645,0.0001702233,0.0009993735,0.0032034647,0.0017703573,0.0013901256],"domain_scores_gemma":[0.9937045,0.00079994166,0.00086720847,0.0025416103,0.0016318462,0.0004548783],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014454139,0.0011591257,0.0011262285,0.0016036843,0.0013482972,0.0013249682,0.0045761587,0.0007153856,0.00003090279],"category_scores_gemma":[0.0006094054,0.0011771638,0.0002761968,0.0005979482,0.0026144134,0.0024418808,0.002546428,0.0018525955,0.00007912412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012046811,0.00009473884,0.000030229723,0.000039464558,0.000039609105,0.00014352567,0.0022593667,0.7358192,0.00029967062,0.0018018153,4.8520684e-7,0.25945982],"study_design_scores_gemma":[0.001365231,0.00016282497,0.0004995108,0.00063750887,0.000021241927,0.00016374452,0.000003936068,0.9859241,0.004425119,0.0055109323,0.0000312877,0.0012545318],"about_ca_topic_score_codex":0.00015613578,"about_ca_topic_score_gemma":0.00014731106,"teacher_disagreement_score":0.2582053,"about_ca_system_score_codex":0.0023823695,"about_ca_system_score_gemma":0.0019453425,"threshold_uncertainty_score":0.99995184},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018513532,0.0003545632,0.9950887,0.00032189253,0.0006839214,0.0006733654,0.0000083945,0.00020372515,0.0008140725],"genre_scores_gemma":[0.32756788,0.000025426738,0.67162377,0.0004113495,0.00018432584,0.000025431636,0.000014469612,0.00004921168,0.00009812133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99512666,0.000024110706,0.000826253,0.0021858355,0.0009441127,0.00089302735],"domain_scores_gemma":[0.9967868,0.0003154509,0.00037866656,0.0021103509,0.00021047289,0.00019831232],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015888972,0.00067525444,0.0008139022,0.0015775223,0.000695217,0.0014622184,0.004594037,0.00044358964,0.000003636267],"category_scores_gemma":[0.00033303213,0.00064100686,0.00010614624,0.00089151633,0.0007014446,0.0022468283,0.002710212,0.0014047491,0.0000069573534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011250469,0.00007651978,0.0018744312,0.00011876666,0.000026221553,0.00013930119,0.004861225,0.3155844,0.000022522041,0.028498588,0.0000054350153,0.64878136],"study_design_scores_gemma":[0.0004320226,0.000056185952,0.0003106067,0.0005999926,0.000007643527,0.00010039702,0.000001363075,0.93872666,0.00003348354,0.058828097,0.00013658426,0.00076693925],"about_ca_topic_score_codex":0.00011454956,"about_ca_topic_score_gemma":0.0002248349,"teacher_disagreement_score":0.64801437,"about_ca_system_score_codex":0.00037095053,"about_ca_system_score_gemma":0.00061801047,"threshold_uncertainty_score":0.9996041},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006887549,0.00055908517,0.9780215,0.00076605804,0.0031217453,0.00025044175,0.000003440078,0.00024368434,0.016965142],"genre_scores_gemma":[0.14945593,0.00010196145,0.84602994,0.0019109977,0.0012026032,0.000009032773,0.000004704915,0.00006708176,0.0012177684],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563944,0.00005647006,0.0005260353,0.001798437,0.0011234252,0.00085617614],"domain_scores_gemma":[0.99541545,0.0006645599,0.00044369287,0.002962316,0.0003353267,0.00017864372],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0026101805,0.00058390683,0.00068976183,0.0006518819,0.00070309074,0.0017490474,0.0064989184,0.00037662202,0.000022178536],"category_scores_gemma":[0.00032857052,0.0005406401,0.00018878479,0.00024974789,0.000800705,0.0010557281,0.0017124775,0.0009816523,0.00009763289],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027331876,0.000013261179,0.0004410355,0.000038527116,0.000011564914,0.00016926676,0.0003628143,0.0031893996,0.00009675156,0.011559477,0.000017624672,0.98409754],"study_design_scores_gemma":[0.00080068136,0.00021824283,0.0035398577,0.0012842037,0.000016384312,0.00021694943,1.1782329e-7,0.44594797,0.002498166,0.5238026,0.019454183,0.0022206872],"about_ca_topic_score_codex":0.000048163012,"about_ca_topic_score_gemma":0.0001224036,"teacher_disagreement_score":0.98187685,"about_ca_system_score_codex":0.00019575283,"about_ca_system_score_gemma":0.00070654537,"threshold_uncertainty_score":0.99970454},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018964386,0.0005768572,0.99363667,0.0007294075,0.001968171,0.00065660774,0.000016979744,0.00017778535,0.0020478743],"genre_scores_gemma":[0.13298987,0.000021137177,0.8641972,0.0007619102,0.00047210194,0.000039406386,0.000053372885,0.0000342873,0.0014307348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676675,0.000031583124,0.0004649409,0.0014838723,0.0007059585,0.00054691016],"domain_scores_gemma":[0.9975241,0.0009190864,0.00027709274,0.000828283,0.00033907048,0.000112361406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008274246,0.00045833542,0.0004583834,0.0008224877,0.00034908456,0.00046861873,0.001767252,0.00027953726,0.000007965831],"category_scores_gemma":[0.0001183692,0.00045395165,0.00018271855,0.00059762143,0.0002981985,0.0005684576,0.0005224491,0.00039295983,0.000019480702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100503285,0.00003859764,0.000010536981,0.000037878166,0.000010266938,0.000015826716,0.00012865549,0.38084412,0.00021270399,0.04523563,0.00015479572,0.57330096],"study_design_scores_gemma":[0.00026206518,0.00018391214,0.00012263698,0.00008088975,0.000005628926,0.0000331815,3.451567e-8,0.70930547,0.0003417713,0.28644118,0.0027849039,0.00043833206],"about_ca_topic_score_codex":0.000017984497,"about_ca_topic_score_gemma":0.00017783356,"teacher_disagreement_score":0.5728626,"about_ca_system_score_codex":0.00036727925,"about_ca_system_score_gemma":0.00056568644,"threshold_uncertainty_score":0.9997912},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001273226,0.00063016353,0.974532,0.008934304,0.0020303833,0.00066478166,0.00007250642,0.0009504928,0.012172624],"genre_scores_gemma":[0.006233437,0.00006990184,0.99157995,0.00066552067,0.0005616311,0.000021376927,0.00010019857,0.00007583624,0.0006921746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9902819,0.000039222916,0.000860244,0.005526836,0.0018551683,0.001436664],"domain_scores_gemma":[0.9300485,0.00045006152,0.000801262,0.06823651,0.00022068674,0.00024298382],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0029283352,0.0009864167,0.0009886172,0.0012271625,0.00079498783,0.0030651595,0.28839967,0.00086117286,0.000026405229],"category_scores_gemma":[0.0120505085,0.00092814874,0.00013933131,0.00037873548,0.0019532226,0.0039044204,0.5287122,0.0023695547,0.000107034786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007032918,0.00007105698,0.00018355,0.00012734512,0.000045875702,0.0002451996,0.00034522178,0.00050855265,0.000030354448,0.011153646,0.010548712,0.97673345],"study_design_scores_gemma":[0.00016976972,0.000044204156,0.00003442478,0.0003071854,0.000008851868,0.000098621334,7.305261e-8,0.50274885,0.00019169188,0.48802382,0.0077222977,0.00065019814],"about_ca_topic_score_codex":0.00007365886,"about_ca_topic_score_gemma":0.000055406173,"teacher_disagreement_score":0.9760833,"about_ca_system_score_codex":0.00045598322,"about_ca_system_score_gemma":0.0008344416,"threshold_uncertainty_score":0.999932},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6035149,0.00052293035,0.013501709,0.004684609,0.007725774,0.0030090674,0.00017149179,0.00024438818,0.36662513],"genre_scores_gemma":[0.9978414,0.000022101021,0.0015578028,0.000033462024,0.00027786096,0.000008771615,0.0000040341442,0.000011499008,0.00024304347],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981503,0.00006186929,0.00036702264,0.00041757105,0.0006958608,0.00030735787],"domain_scores_gemma":[0.9984169,0.00042123056,0.00053233217,0.00022489959,0.00034198223,0.000062656974],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010012886,0.00017854049,0.00045601584,0.00070124964,0.0002637747,0.000057054804,0.0009798855,0.00048004018,0.000012293043],"category_scores_gemma":[0.001097122,0.0001888348,0.000082923725,0.00028247872,0.0073572053,0.0001940921,0.00023140127,0.00042985874,0.0000016450541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005631226,0.000100049976,0.1015403,0.00016358904,0.000035056793,0.00006664551,0.14171872,0.00007672845,0.0006674464,0.29060346,0.000020867374,0.46495086],"study_design_scores_gemma":[0.0022875795,0.0015500098,0.1557042,0.005572894,0.00018018273,0.00000850134,0.001073096,0.00062174076,0.007742059,0.8169675,0.0055353707,0.0027568866],"about_ca_topic_score_codex":0.0002881843,"about_ca_topic_score_gemma":0.0023771445,"teacher_disagreement_score":0.526364,"about_ca_system_score_codex":0.00023815737,"about_ca_system_score_gemma":0.000986621,"threshold_uncertainty_score":0.9953442},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003600867,0.00004064138,0.99312973,0.000082131504,0.0007353373,0.0019147622,0.000014146563,0.00017597579,0.00030638045],"genre_scores_gemma":[0.5003227,0.000015896017,0.49909225,0.00014150715,0.00021145899,0.00010135082,0.000006798042,0.00003294766,0.000075054224],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969761,0.000032519787,0.00060507416,0.001341214,0.00061192113,0.0004331672],"domain_scores_gemma":[0.9972226,0.00027732018,0.0006045318,0.0015216089,0.0002995803,0.00007433086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007773887,0.00039590092,0.0005766697,0.0011297853,0.00022398162,0.00022621428,0.003235314,0.00025675635,0.000003969903],"category_scores_gemma":[0.000303344,0.00039780972,0.00010702047,0.0002610236,0.00032961616,0.0008046067,0.0011900072,0.00054313836,0.000004325722],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001727169,0.00011074204,0.00041441107,0.00001963476,0.000008057996,0.000014880631,0.0011369888,0.0007247499,0.000056375444,0.00027022164,0.0000052327573,0.9972214],"study_design_scores_gemma":[0.004263889,0.0054580127,0.011987792,0.001633914,0.000039429873,0.00017961863,0.0000018166035,0.051438257,0.029940067,0.8909693,0.001266296,0.0028216038],"about_ca_topic_score_codex":0.000092163165,"about_ca_topic_score_gemma":0.00039968762,"teacher_disagreement_score":0.99439985,"about_ca_system_score_codex":0.00017723702,"about_ca_system_score_gemma":0.00025765234,"threshold_uncertainty_score":0.99984735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9669864,0.00017073916,0.007037094,0.00016497464,0.0013018848,0.001203851,0.000005041925,0.000040381357,0.0230896],"genre_scores_gemma":[0.9991354,0.000051479103,0.0004332621,0.000030020316,0.0001392703,0.000009899885,0.0000010145205,0.000010871967,0.00018882367],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9976658,0.0002758975,0.00034039936,0.00072754396,0.0006571952,0.00033315594],"domain_scores_gemma":[0.99772525,0.0012336462,0.00029247458,0.00042294792,0.00023448703,0.00009117553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038999284,0.00022261741,0.00055108365,0.00026162123,0.00034690904,0.0002417727,0.000769058,0.00023252948,0.0000065266386],"category_scores_gemma":[0.0023550764,0.00021587273,0.000059579637,0.00014214645,0.0022137042,0.0003186428,0.00031275352,0.00046784343,0.0000013834523],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110664565,0.00029198674,0.14679022,0.00014385693,0.000015080636,0.000030456144,0.049119323,0.00009818988,0.0000769314,0.0015211134,0.0000025965583,0.8017996],"study_design_scores_gemma":[0.0010807624,0.0005491802,0.93018544,0.002088201,0.00001977381,0.0000013416261,0.00014259857,0.0012341355,0.000017926155,0.063898884,0.00026064436,0.00052111846],"about_ca_topic_score_codex":0.0029803952,"about_ca_topic_score_gemma":0.017506473,"teacher_disagreement_score":0.8012785,"about_ca_system_score_codex":0.00023002103,"about_ca_system_score_gemma":0.0002712391,"threshold_uncertainty_score":0.97690225},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001372581,0.0003288182,0.99475324,0.000806822,0.0014388241,0.0013645155,0.000039346738,0.00031025973,0.0008209058],"genre_scores_gemma":[0.056117546,0.00021571848,0.94083184,0.00096759084,0.00049662904,0.0000516436,0.000020368747,0.00006602581,0.0012326249],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99571943,0.000036291793,0.0006283151,0.0018783263,0.0007528854,0.0009847626],"domain_scores_gemma":[0.9962292,0.0005289303,0.00034810652,0.00228434,0.0004244122,0.00018506587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011985527,0.00058068905,0.0007256344,0.0011018579,0.0006950381,0.0005837282,0.00355068,0.00044486317,0.0000104979845],"category_scores_gemma":[0.0004288215,0.0005391857,0.00020777373,0.0005572462,0.00049486326,0.0013479315,0.0015813701,0.0009707814,0.000016279566],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018942995,0.00050874293,0.0005181896,0.000267651,0.00004487707,0.0004244095,0.0033476271,0.004987357,0.0030497287,0.092991434,0.0004636341,0.8932069],"study_design_scores_gemma":[0.001539813,0.00080551935,0.00041684206,0.001095244,0.000023640865,0.00008837369,8.3871623e-7,0.33865103,0.02376379,0.61658835,0.0153633095,0.0016632647],"about_ca_topic_score_codex":0.000039088147,"about_ca_topic_score_gemma":0.0003042071,"teacher_disagreement_score":0.8915436,"about_ca_system_score_codex":0.0003740616,"about_ca_system_score_gemma":0.0006983619,"threshold_uncertainty_score":0.999706},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003731213,0.00015553908,0.992222,0.000063652275,0.0015043112,0.0003797228,8.689437e-7,0.00041038642,0.004890372],"genre_scores_gemma":[0.16214043,0.000026383796,0.8366586,0.00015842794,0.0005951574,0.000004662081,0.0000010416444,0.000027808454,0.0003874603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654406,0.000024352525,0.00045600868,0.0014865296,0.0008317965,0.0006572474],"domain_scores_gemma":[0.9974094,0.00013536056,0.00042040707,0.0015471862,0.00024107451,0.00024658238],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00088402827,0.0005007556,0.00046437993,0.0009211843,0.0008276295,0.001270674,0.0037816039,0.00024668145,0.0000025020784],"category_scores_gemma":[0.000119087534,0.00050741294,0.00010190065,0.0003535395,0.00018935242,0.0009757581,0.0013520805,0.0006147543,0.00001181784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051136203,0.000011859926,0.00008098292,0.000025322275,0.00000629292,0.000008039248,0.0006788291,0.4649739,0.00021346803,0.00031560147,0.00001832052,0.53366226],"study_design_scores_gemma":[0.0001636963,0.00009415816,0.000042507127,0.0008582946,0.000006909047,0.00008210083,2.2491412e-7,0.98839426,0.0064767543,0.00290666,0.00035676057,0.00061768485],"about_ca_topic_score_codex":0.000075937256,"about_ca_topic_score_gemma":0.0000035886255,"teacher_disagreement_score":0.5330446,"about_ca_system_score_codex":0.0004965588,"about_ca_system_score_gemma":0.00060902385,"threshold_uncertainty_score":0.9997661},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006371411,0.0009113716,0.9923818,0.00023563432,0.0019956036,0.00018210146,0.000003786603,0.00006305231,0.0035894755],"genre_scores_gemma":[0.6093739,0.00009590557,0.38902083,0.00025725318,0.0004809579,0.000003513447,0.0000011245601,0.00002146536,0.00074503507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974998,0.000017899818,0.00039405737,0.0010355576,0.00065085565,0.00040180504],"domain_scores_gemma":[0.99764377,0.00031090772,0.0003786014,0.0013859686,0.0001678886,0.00011285706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005491125,0.0003304165,0.0004906588,0.0004037393,0.00022409993,0.00045732333,0.0025937832,0.00020919484,0.000011573853],"category_scores_gemma":[0.0001258713,0.00031205526,0.00007628123,0.00007703909,0.001017809,0.0006592003,0.0015807394,0.0004239152,0.0000051626434],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003844435,0.00001391319,0.00028255177,0.00015901371,0.00001831716,0.00007033781,0.0039546187,0.0097838715,0.0004539028,0.11318641,0.000017252327,0.87205595],"study_design_scores_gemma":[0.00031179114,0.00012691507,0.0002744486,0.0008807859,0.000011246531,0.00006035695,4.7768833e-7,0.80989736,0.0020364234,0.18453132,0.0011987075,0.0006701898],"about_ca_topic_score_codex":0.000038474347,"about_ca_topic_score_gemma":0.00004308372,"teacher_disagreement_score":0.87138575,"about_ca_system_score_codex":0.00008382631,"about_ca_system_score_gemma":0.00032863714,"threshold_uncertainty_score":0.9999332},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016094482,0.000528487,0.99034214,0.00042654428,0.0028197907,0.0007555483,0.0000061124647,0.00063645985,0.004323959],"genre_scores_gemma":[0.6872389,0.00023425496,0.3096309,0.0015218698,0.00074963225,0.000058485366,0.0000063151315,0.00007736179,0.00048228505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99486357,0.000069220456,0.0008280315,0.002190607,0.0010750783,0.0009735206],"domain_scores_gemma":[0.99578077,0.00039515368,0.00049097696,0.002850923,0.0002618197,0.00022035824],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014140045,0.00075901154,0.00089542154,0.0011669307,0.0004108892,0.00096088555,0.0066546574,0.0005717264,0.000021870357],"category_scores_gemma":[0.00010887186,0.00073561294,0.00015877103,0.00050579495,0.0005608586,0.002096897,0.0020793392,0.0012497588,0.000037195296],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014478396,0.000028722146,0.0006424636,0.000103323015,0.000015039771,0.00032923956,0.00028418316,0.02923631,0.0001249817,0.005304774,0.000090640926,0.9638258],"study_design_scores_gemma":[0.00065038615,0.0005756594,0.0012005679,0.0031260282,0.000016501946,0.00031295532,4.2544568e-7,0.7542083,0.003274767,0.1512215,0.08251622,0.0028966782],"about_ca_topic_score_codex":0.00008924807,"about_ca_topic_score_gemma":0.004106244,"teacher_disagreement_score":0.96092916,"about_ca_system_score_codex":0.0006595747,"about_ca_system_score_gemma":0.00052798097,"threshold_uncertainty_score":0.9995095},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047334706,0.0003414681,0.98892885,0.00038485863,0.0020801395,0.0007703978,7.512589e-7,0.0002631446,0.0071830363],"genre_scores_gemma":[0.73625976,0.000024571695,0.26147595,0.0003929369,0.0007474386,0.000024140414,0.000005119345,0.0000711968,0.0009988782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953465,0.000032080694,0.0004568755,0.0018908563,0.0012680658,0.0010056364],"domain_scores_gemma":[0.99617374,0.00019365687,0.00062825327,0.0024538604,0.00029186052,0.00025861504],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000841816,0.0006946777,0.0006826771,0.0005732387,0.00086354616,0.0021461349,0.0050224466,0.0004152123,0.000006031749],"category_scores_gemma":[0.000058830065,0.0005250463,0.00015449448,0.0003289279,0.0013771316,0.0008752899,0.001257856,0.0007485003,0.000046546986],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136184235,0.00008058187,0.000985811,0.00022644587,0.00006413942,0.00063627877,0.0015650868,0.011017841,0.000024634714,0.099783935,0.000022744387,0.8855789],"study_design_scores_gemma":[0.0011669396,0.001399577,0.00016017951,0.0012572319,0.000060396505,0.0011890872,0.0000014018809,0.70514697,0.00058123504,0.24853237,0.037322316,0.0031822806],"about_ca_topic_score_codex":0.00024019985,"about_ca_topic_score_gemma":0.0011823148,"teacher_disagreement_score":0.8823966,"about_ca_system_score_codex":0.00037394644,"about_ca_system_score_gemma":0.0009616105,"threshold_uncertainty_score":0.9997201},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001584795,0.00025629476,0.9976141,0.0002479017,0.00046360787,0.0010075935,0.000018100207,0.000019070125,0.00021487713],"genre_scores_gemma":[0.19063722,0.00011324694,0.8027294,0.0015467717,0.0030041356,0.00029166695,0.00069467264,0.000118186865,0.0008646514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984352,0.000024903471,0.0002736745,0.0007101412,0.00023607242,0.00031999775],"domain_scores_gemma":[0.99882364,0.00006428396,0.00018507915,0.00068374607,0.0001802547,0.00006302113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006832454,0.00027698578,0.00021115343,0.00010914912,0.00017194968,0.00014560987,0.0007336242,0.00026428502,0.000006487196],"category_scores_gemma":[0.000019424957,0.00020728773,0.00009213223,0.00007521917,0.00031999632,0.000010333569,0.00018299566,0.00020557348,0.0000042366687],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010471526,0.000019789073,0.000006611815,0.000030133053,0.000017721952,4.2343638e-7,0.00009560739,0.0030515995,0.017539276,0.0001504551,0.00003463086,0.9790433],"study_design_scores_gemma":[0.0004055273,0.00074604567,0.000025395979,0.00006188642,0.000027831857,0.000010805663,6.4619485e-7,0.9561447,0.01934941,0.0134587055,0.009361576,0.00040747056],"about_ca_topic_score_codex":0.000008113172,"about_ca_topic_score_gemma":0.00005743226,"teacher_disagreement_score":0.9786358,"about_ca_system_score_codex":0.00005161053,"about_ca_system_score_gemma":0.00010895526,"threshold_uncertainty_score":0.8452948},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023831341,0.000065188564,0.97325015,0.00027593432,0.001401531,0.00052319845,0.00014662989,0.00005514054,0.00045090288],"genre_scores_gemma":[0.9810723,0.0000046388823,0.017816866,0.0008561716,0.0001656483,0.0000033221509,0.0000031123614,0.00004107291,0.00003684411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958867,0.0001303209,0.0010214242,0.0012879369,0.0011932789,0.00048034877],"domain_scores_gemma":[0.99408776,0.0021314437,0.0014935954,0.0018367717,0.0003339086,0.00011654221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077571336,0.00059086323,0.0010993503,0.0010857244,0.00017881386,0.00012336505,0.0032540807,0.00033783747,0.00001794155],"category_scores_gemma":[0.0005582234,0.00050709845,0.00031312957,0.00023651794,0.0018092826,0.0002363796,0.0004452319,0.0008502279,0.0000027723029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048428244,0.00039623337,0.00018383354,0.00048825183,0.000021508627,0.000032712014,0.00048200297,0.54486674,0.1739718,0.00037391065,0.000014441661,0.27868432],"study_design_scores_gemma":[0.0016181038,0.0013587569,0.00016996535,0.0016903771,0.000015772255,0.000007589754,1.34572e-7,0.5562587,0.43680686,0.0017322071,0.000062066516,0.00027948408],"about_ca_topic_score_codex":0.000074107964,"about_ca_topic_score_gemma":0.00015087212,"teacher_disagreement_score":0.957241,"about_ca_system_score_codex":0.000117159,"about_ca_system_score_gemma":0.00034838327,"threshold_uncertainty_score":0.99973804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011203756,0.00046078296,0.9842488,0.0008754614,0.00028178078,0.00062753283,0.000014477116,0.000103899656,0.0021835165],"genre_scores_gemma":[0.9775855,0.0000740293,0.021994997,0.0002998507,0.000024058463,0.0000065911945,0.000004074695,0.000006961968,0.000003950768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992501,0.000027068116,0.00024348713,0.00012891144,0.00022791966,0.0001225244],"domain_scores_gemma":[0.99889946,0.00014937177,0.00014812476,0.00072537706,0.000059641705,0.000018036748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006499893,0.00014942454,0.00017088998,0.00014569549,0.00016003306,0.00014693168,0.0007945153,0.00010599718,0.0000016380753],"category_scores_gemma":[0.00005346944,0.00009972805,0.000023042088,0.00007331551,0.0008920332,0.00040259658,0.00037432063,0.0004962842,6.3885994e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012352638,0.000024776435,0.0025207286,0.00041537045,0.000016716209,0.0000010626846,0.01943929,0.017181605,0.00062627485,0.0271031,0.00011207183,0.9325467],"study_design_scores_gemma":[0.0004001245,0.000040285915,0.02403444,0.0005865558,0.000011123547,0.000024537827,0.000004297702,0.8933618,0.001953626,0.073825054,0.005410712,0.0003474261],"about_ca_topic_score_codex":0.00004647081,"about_ca_topic_score_gemma":0.0003848828,"teacher_disagreement_score":0.9663817,"about_ca_system_score_codex":0.000043167296,"about_ca_system_score_gemma":0.000027170334,"threshold_uncertainty_score":0.40667918},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043458007,0.00016567152,0.9528758,0.00025824396,0.0026689377,0.00015056191,0.0000014180779,0.00020795921,0.00021339626],"genre_scores_gemma":[0.83548427,0.0000090355,0.16384746,0.00033399253,0.00028504097,0.0000066602947,8.8230206e-7,0.00001874323,0.000013900321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983461,0.000014203997,0.0002396311,0.00047734298,0.00035344932,0.0005693097],"domain_scores_gemma":[0.9990714,0.00010994628,0.000028543493,0.00058940117,0.000062424464,0.00013826587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003656025,0.00022646683,0.00019471726,0.000285087,0.00013324154,0.00021542681,0.00091821747,0.00008946911,0.00015519053],"category_scores_gemma":[0.00005522126,0.00019560373,0.000048826354,0.0012219291,0.00026109625,0.00032561427,0.00016766414,0.0006654414,0.000077689954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010918668,0.000013872164,0.00097054685,0.0000103946195,0.0000025112101,0.0000072656426,0.0002461066,0.7558696,0.01816166,0.00012557454,0.000054648728,0.22453667],"study_design_scores_gemma":[0.000085155945,0.00001975979,0.0037760076,0.000030780226,0.0000023732,0.000017796674,1.9450172e-7,0.8968343,0.0955564,0.0024507928,0.00092114403,0.0003052788],"about_ca_topic_score_codex":0.000047508256,"about_ca_topic_score_gemma":0.0007543907,"teacher_disagreement_score":0.7920263,"about_ca_system_score_codex":0.00005281579,"about_ca_system_score_gemma":0.000059031274,"threshold_uncertainty_score":0.79764885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005209331,0.00037197658,0.9896156,0.0026389582,0.0017904759,0.00069781137,0.000005140841,0.0026810481,0.002193736],"genre_scores_gemma":[0.029558515,0.000019511102,0.9656289,0.0033626175,0.00074598077,0.00005509886,0.0000029045568,0.00004584754,0.0005806099],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965101,0.00002850995,0.00044258742,0.0014014388,0.0008987414,0.0007186185],"domain_scores_gemma":[0.993872,0.0021276863,0.00047233386,0.003117835,0.00032256066,0.00008758533],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0022809124,0.0005120956,0.00047878912,0.00038948536,0.0012717034,0.0019213083,0.008406824,0.000298448,0.0000028904678],"category_scores_gemma":[0.0011370655,0.00036536664,0.00020731603,0.00015992047,0.00079992064,0.0005272474,0.0020933794,0.0007801795,0.000013818188],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042155866,0.000012375435,0.00011679743,0.000035785844,0.000010907961,0.000033021726,0.00092253124,0.0011158378,0.000010255077,0.036078442,0.0010698154,0.96059],"study_design_scores_gemma":[0.00012985991,0.000117696676,0.00009543908,0.00050226215,0.00000874407,0.00007069801,1.9611564e-8,0.12434556,0.00027693165,0.8671624,0.00679449,0.0004958882],"about_ca_topic_score_codex":0.00005773173,"about_ca_topic_score_gemma":0.00003759136,"teacher_disagreement_score":0.96009415,"about_ca_system_score_codex":0.00018098611,"about_ca_system_score_gemma":0.0006143261,"threshold_uncertainty_score":0.99987984},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009311325,0.00049762294,0.988058,0.0004872121,0.0014767059,0.00025452953,0.0000040676555,0.005783243,0.0033455393],"genre_scores_gemma":[0.24657238,0.0000058743562,0.75188315,0.0005428139,0.00072924973,0.000009807264,0.0000062611393,0.000058414633,0.00019208486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954252,0.00006288669,0.0005524363,0.0020619554,0.0010677455,0.00082973286],"domain_scores_gemma":[0.99255174,0.0035339235,0.00073105696,0.0024821006,0.00049620285,0.00020500096],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011737227,0.000722505,0.0007104115,0.00082290504,0.0011002185,0.0019197807,0.005343126,0.00043336977,0.000012276231],"category_scores_gemma":[0.0028448147,0.0006822058,0.00015070244,0.0003697803,0.00090285786,0.0006834713,0.0018241368,0.0014265386,0.000043889595],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033398244,0.000024001998,0.0019227216,0.000034019096,0.000008110805,0.0001677299,0.00023401182,0.025212536,0.00009721011,0.00042347616,0.00007081826,0.971802],"study_design_scores_gemma":[0.00020873261,0.00019192854,0.0005427221,0.002145315,0.000012823265,0.00003955289,2.2733971e-8,0.631481,0.0019172848,0.36071664,0.0017807131,0.00096325396],"about_ca_topic_score_codex":0.00043553117,"about_ca_topic_score_gemma":0.00006197192,"teacher_disagreement_score":0.9708388,"about_ca_system_score_codex":0.0002840577,"about_ca_system_score_gemma":0.0011558414,"threshold_uncertainty_score":0.9995629},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044997705,0.00043272375,0.99308544,0.00039931972,0.0019383181,0.000252152,0.000002801662,0.0002722134,0.0035720458],"genre_scores_gemma":[0.38306034,0.000040307725,0.6140287,0.0014348193,0.0010851992,0.000005126166,0.0000035516362,0.000045121582,0.00029683183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946212,0.00008242762,0.0007519042,0.0020861577,0.001193743,0.0012645769],"domain_scores_gemma":[0.99637073,0.00057245657,0.00042399106,0.0019518908,0.00032411984,0.0003567883],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013237263,0.0008215683,0.00082528475,0.0006689044,0.00047680872,0.0010490796,0.004743867,0.00052077643,0.000039235296],"category_scores_gemma":[0.0001017609,0.0007767884,0.00018784392,0.0008333286,0.00082063314,0.0005817348,0.0016432541,0.001278732,0.00006096101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004912808,0.000013318221,0.0001261047,0.000027293889,0.000010817231,0.00006010714,0.00019524846,0.41729492,0.00005848675,0.09015502,0.000027741917,0.49202603],"study_design_scores_gemma":[0.00013046044,0.00011556725,0.000052704574,0.0005630379,0.000009538292,0.0000658969,3.9396696e-8,0.75044876,0.00008811103,0.247199,0.0006198526,0.0007070307],"about_ca_topic_score_codex":0.000058038368,"about_ca_topic_score_gemma":0.00014036054,"teacher_disagreement_score":0.491319,"about_ca_system_score_codex":0.0003107697,"about_ca_system_score_gemma":0.0010097892,"threshold_uncertainty_score":0.9999879},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031297794,0.0000971238,0.9792044,0.0016794724,0.0009145436,0.00045640854,0.000004749047,0.00008698563,0.017525027],"genre_scores_gemma":[0.2945789,0.00011757489,0.7012224,0.0010878872,0.0003982233,0.000012686422,0.000009336723,0.00006311749,0.002509841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963776,0.0000510537,0.00040505012,0.0013134856,0.0012701742,0.0005826767],"domain_scores_gemma":[0.9966393,0.00023109524,0.00035138038,0.0021783975,0.00042610645,0.00017371621],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011505509,0.00037147297,0.00045330156,0.0010478955,0.0003915837,0.0005910991,0.004371412,0.00018112051,0.000011446498],"category_scores_gemma":[0.00021298813,0.00032504197,0.00010210673,0.00034413257,0.00090209476,0.00058180187,0.0011263828,0.0008105128,0.000027707256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006095123,0.000048150407,0.000048110953,0.00010130058,0.000012294081,0.00005296922,0.0015906692,0.07652821,0.00025440106,0.1202305,0.000040586445,0.8010867],"study_design_scores_gemma":[0.0005080386,0.0007029998,0.00028556754,0.0013724938,0.0000063887096,0.000045864195,2.5714616e-7,0.73812586,0.0060728174,0.24997495,0.0019252881,0.0009794515],"about_ca_topic_score_codex":0.000024848587,"about_ca_topic_score_gemma":0.000033030767,"teacher_disagreement_score":0.80010724,"about_ca_system_score_codex":0.000104175124,"about_ca_system_score_gemma":0.00071344484,"threshold_uncertainty_score":0.9999202},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028289245,0.019758206,0.9645483,0.0044479477,0.0010998108,0.0025764767,0.000014667237,0.00011381463,0.0046118787],"genre_scores_gemma":[0.8767102,0.0033692622,0.110816605,0.0011422609,0.0004640491,0.00005017836,0.000017306842,0.00014837796,0.0072818054],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.99609774,0.00006668329,0.00045960044,0.0012930658,0.001301668,0.000781232],"domain_scores_gemma":[0.99633944,0.0014490116,0.00016700865,0.0010552162,0.0002116895,0.00077765645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011215649,0.00039590345,0.0006215307,0.0019445164,0.00034088292,0.00015914044,0.00085471343,0.000595048,0.00012767492],"category_scores_gemma":[0.007881682,0.00033576254,0.00009799857,0.0006931217,0.0008137432,0.00019272971,0.0008927808,0.0015809755,0.00019946876],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072352006,0.000088670764,0.00063638086,0.0008542541,0.000042152933,0.00079833914,0.00032659993,0.00017146542,0.0011653024,0.0009120803,0.000029793036,0.9949026],"study_design_scores_gemma":[0.013104098,0.012558978,0.01608229,0.4516852,0.00042195863,0.0023923938,0.0000030559509,0.32505494,0.037445843,0.13113429,0.0033312999,0.0067856736],"about_ca_topic_score_codex":0.000012176967,"about_ca_topic_score_gemma":0.000013945897,"teacher_disagreement_score":0.9881169,"about_ca_system_score_codex":0.00037511214,"about_ca_system_score_gemma":0.00050809473,"threshold_uncertainty_score":0.99990946},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03477956,0.00028149568,0.96036506,0.000030485413,0.0007225579,0.0005082861,0.000034286564,0.00015224323,0.003126037],"genre_scores_gemma":[0.9967242,0.000016239039,0.0028593529,0.00009450423,0.00020317733,0.0000032986595,0.00000840925,0.000037424372,0.000053417698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851865,0.000012536922,0.00032927713,0.00043248522,0.00039342372,0.00031361892],"domain_scores_gemma":[0.9989057,0.0003013842,0.00017969275,0.00045166907,0.00007603041,0.00008549737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025175652,0.00033967177,0.0005060662,0.0005023536,0.00017087384,0.00013808781,0.00041449146,0.00023181013,0.000031005806],"category_scores_gemma":[0.000049843275,0.0002889845,0.0000610839,0.000087997214,0.0002195164,0.000113452945,0.000056817586,0.00032983633,0.0000042619545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056552195,0.000033779466,0.00001876638,0.00020834088,0.000021293617,0.000012994385,0.000096932905,0.8180256,0.01502248,0.00017271236,0.000009525245,0.16632102],"study_design_scores_gemma":[0.000632195,0.00026671725,0.00014247495,0.00048794106,0.000016773241,0.0000012942138,1.8756715e-8,0.96344715,0.03221734,0.0016519856,0.00079974777,0.00033636246],"about_ca_topic_score_codex":0.000011218754,"about_ca_topic_score_gemma":0.000007906335,"teacher_disagreement_score":0.96194464,"about_ca_system_score_codex":0.00008483318,"about_ca_system_score_gemma":0.00006952522,"threshold_uncertainty_score":0.99995625},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02559481,0.0017097847,0.93719155,0.0012960357,0.0057384763,0.0013743022,0.00013088925,0.000086718384,0.026877439],"genre_scores_gemma":[0.979879,0.00018169913,0.015122985,0.0010304027,0.0007426397,0.000010801403,0.00006930669,0.000077104014,0.002886033],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975069,0.000016636952,0.0001971305,0.0011843246,0.00058847567,0.000506501],"domain_scores_gemma":[0.9981264,0.00003468865,0.0002783435,0.0013276347,0.00010504582,0.00012789668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031902536,0.00045022456,0.00032871022,0.00028001267,0.00023191007,0.00020690817,0.0014887718,0.0003839656,0.00003489089],"category_scores_gemma":[0.00006552721,0.00041301048,0.00016822891,0.000045627865,0.0006720998,0.0000099317585,0.0005453869,0.00044508302,0.000034916033],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034342532,0.00023834812,0.0026181056,0.00020100627,0.0003265971,0.00039455923,0.00053038314,0.032125756,0.045201145,0.0035033727,0.001310381,0.91320693],"study_design_scores_gemma":[0.011569342,0.012275286,0.030648237,0.0046230615,0.00037266163,0.0005110236,0.0000094808265,0.02841695,0.47722045,0.18149814,0.23612753,0.016727867],"about_ca_topic_score_codex":0.000009167112,"about_ca_topic_score_gemma":0.000083855986,"teacher_disagreement_score":0.9542842,"about_ca_system_score_codex":0.000071623115,"about_ca_system_score_gemma":0.00016923208,"threshold_uncertainty_score":0.99983215},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069668725,0.0017726277,0.91561276,0.00082632253,0.001995089,0.0029596598,0.00023409649,0.00019886973,0.006731861],"genre_scores_gemma":[0.9941781,0.000031533684,0.0055691362,0.00004877858,0.000066883236,0.000007764863,0.0000030155381,0.000015774442,0.00007902366],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989229,0.000013058997,0.0002728743,0.00029980927,0.00030253208,0.00018881212],"domain_scores_gemma":[0.9987656,0.00023463505,0.00022021937,0.00058016885,0.00016746997,0.00003191255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033031582,0.00020116867,0.0003022846,0.00023641848,0.00013869774,0.00003137176,0.0005906478,0.00013640858,0.0000035074167],"category_scores_gemma":[0.000121107674,0.00015402569,0.00016982971,0.0001422419,0.00080059975,0.00010905143,0.000083782375,0.00023508354,5.661358e-8],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006198563,0.00003432217,0.02034352,0.0034054837,0.0005257756,0.0000014744816,0.0069732494,0.17725477,0.049737673,0.013710245,0.00029109285,0.7276604],"study_design_scores_gemma":[0.0010606884,0.0005887577,0.16586341,0.002101555,0.00017762894,0.000008627314,0.000004135191,0.108390786,0.17143248,0.54775083,0.0013294154,0.0012917035],"about_ca_topic_score_codex":0.000009461013,"about_ca_topic_score_gemma":0.000034266675,"teacher_disagreement_score":0.92450935,"about_ca_system_score_codex":0.000022370994,"about_ca_system_score_gemma":0.00006651892,"threshold_uncertainty_score":0.62809855},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003743847,0.00045837555,0.9936618,0.0008820539,0.00055870967,0.0002600792,0.0000018703504,0.0002135211,0.0035891777],"genre_scores_gemma":[0.18821573,0.00011897312,0.80946875,0.0014573293,0.0004974398,0.0000027482072,0.0000028418754,0.000023494486,0.00021272006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971644,0.00002841894,0.00039761647,0.0014138663,0.00054838957,0.00044728926],"domain_scores_gemma":[0.99778575,0.0001635744,0.00051378,0.0011902248,0.00021788263,0.00012881107],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009653333,0.00039794983,0.0004453674,0.00044345632,0.0006465584,0.0011165078,0.0024959513,0.00041269872,0.0000057985],"category_scores_gemma":[0.00016535861,0.00032813233,0.000066585984,0.0001875202,0.0011890687,0.0007700095,0.0013055381,0.0005603048,0.00000590662],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006998141,0.000010986584,0.00005927525,0.000035658653,0.0000049556975,0.000033376222,0.00021807417,0.000071486116,0.01002629,0.0078016026,0.000007442071,0.98172385],"study_design_scores_gemma":[0.00029656081,0.00028523733,0.0013081249,0.0014307176,0.000020511614,0.00022617064,1.9683141e-7,0.6358079,0.025989354,0.32776895,0.005364463,0.0015018528],"about_ca_topic_score_codex":0.000008163584,"about_ca_topic_score_gemma":0.0000060401867,"teacher_disagreement_score":0.980222,"about_ca_system_score_codex":0.00017091735,"about_ca_system_score_gemma":0.0004224013,"threshold_uncertainty_score":0.9999204},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045757733,0.00031713498,0.99523497,0.0005459621,0.0021936332,0.00041273804,0.0000052213745,0.00088032504,0.0003642402],"genre_scores_gemma":[0.01200109,0.000011391626,0.986396,0.00043757772,0.0005698174,0.000039062917,0.000004885746,0.0000444293,0.0004957515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967184,0.000020216039,0.00033157945,0.0013919399,0.00079584797,0.00074201584],"domain_scores_gemma":[0.996613,0.0006817971,0.00020750483,0.0021737886,0.00006684883,0.0002570604],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00092650583,0.0005228971,0.00046766116,0.0008038451,0.00027966342,0.0015549081,0.0060922666,0.00029108548,0.000005796541],"category_scores_gemma":[0.00064119016,0.00051317445,0.000114289294,0.0005441801,0.00016130434,0.001097052,0.0025180934,0.00087119633,0.000045586414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004522,0.00004247294,0.00028224097,0.00014843297,0.00002136796,0.00016246807,0.00095490203,0.1492781,0.000029049326,0.0030569497,0.00064552063,0.845374],"study_design_scores_gemma":[0.0003314733,0.0005184926,0.0014010986,0.0015428313,0.000019344609,0.00029926753,1.3386125e-7,0.874612,0.002497023,0.027980568,0.08810278,0.0026950005],"about_ca_topic_score_codex":0.00001782519,"about_ca_topic_score_gemma":0.00001051746,"teacher_disagreement_score":0.84267896,"about_ca_system_score_codex":0.0005300024,"about_ca_system_score_gemma":0.0006396722,"threshold_uncertainty_score":0.99973196},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07406708,0.000049836595,0.92495537,0.00028937348,0.00034822786,0.00012731862,0.0000018162466,0.000038889004,0.00012210348],"genre_scores_gemma":[0.5862587,0.0000017121295,0.41358674,0.000121610676,0.000026399051,7.33594e-7,2.708734e-7,0.00000267201,0.0000011757606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985073,0.0000361705,0.00023086046,0.000516918,0.0003440157,0.00036474297],"domain_scores_gemma":[0.9988251,0.00033445275,0.000085259555,0.00055916514,0.00009190491,0.000104161874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004687861,0.0001526306,0.00020202911,0.00037244376,0.00020822759,0.00017224165,0.00094626733,0.0000560231,0.000008015533],"category_scores_gemma":[0.00011030372,0.00014052853,0.000040403687,0.0018850946,0.00049882097,0.00055505283,0.0003829698,0.0001648964,0.000004820701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008220938,0.00023077984,0.009004544,0.000032779975,0.0000136491235,0.000021072728,0.0045238063,0.48441115,0.011148019,0.013987762,0.000027187303,0.47659102],"study_design_scores_gemma":[0.00026061674,0.00009218961,0.004337156,0.000026310145,0.0000014866908,0.000028748658,4.3736915e-7,0.9629321,0.017317498,0.014770053,0.000059830876,0.00017358817],"about_ca_topic_score_codex":0.0000481748,"about_ca_topic_score_gemma":0.00007374388,"teacher_disagreement_score":0.5121916,"about_ca_system_score_codex":0.000038264432,"about_ca_system_score_gemma":0.00018276127,"threshold_uncertainty_score":0.5730587},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008368495,0.00059654773,0.9752409,0.0062848977,0.0017050316,0.002636983,0.00009993686,0.00014464567,0.0049225553],"genre_scores_gemma":[0.9418351,0.000025257074,0.04946958,0.0068250834,0.00037155426,0.000041886957,0.00004546413,0.000054092954,0.0013319581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981264,0.000012139021,0.00023850235,0.00091138895,0.0003382964,0.00037327],"domain_scores_gemma":[0.9983912,0.00031093095,0.00017339199,0.0008238399,0.0001226475,0.00017795418],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016682665,0.00035494138,0.0005069714,0.00024326298,0.00032433943,0.00010372537,0.00036333635,0.00029616288,0.00007379692],"category_scores_gemma":[0.00018529424,0.00024536773,0.00019300324,0.000050743445,0.0004301034,0.00008134041,0.0001712021,0.00034712726,0.000009250932],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036216973,0.00027807656,0.0009883755,0.00020914595,0.00003708225,0.00979881,0.00010838841,0.0007554175,0.00025180096,0.00026240037,0.00024578194,0.98670256],"study_design_scores_gemma":[0.027729299,0.018059602,0.005243566,0.0065873954,0.0012295961,0.005849528,8.017338e-7,0.58222264,0.017866652,0.2770665,0.053595565,0.0045488207],"about_ca_topic_score_codex":0.00003329896,"about_ca_topic_score_gemma":0.00007954587,"teacher_disagreement_score":0.9821537,"about_ca_system_score_codex":0.00008398654,"about_ca_system_score_gemma":0.00021690234,"threshold_uncertainty_score":0.9999999},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028957917,0.00022793077,0.9894514,0.0029256495,0.002558595,0.0006838582,0.000017603727,0.00025342303,0.0038525783],"genre_scores_gemma":[0.11451554,0.000019184508,0.88151354,0.002036121,0.0013660211,0.000052584393,0.000044344833,0.000054711858,0.00039793862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959538,0.00003153942,0.0007072762,0.001758857,0.00094884366,0.0005996793],"domain_scores_gemma":[0.9939411,0.00083197956,0.00082951953,0.0035981904,0.0006502039,0.00014899037],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016671387,0.00047284862,0.00046070977,0.0007080988,0.0009844216,0.0014108686,0.007849478,0.0003430765,0.000014696588],"category_scores_gemma":[0.0006166637,0.00050612947,0.00019466285,0.00021135365,0.00055972347,0.00076705765,0.0008676068,0.000548019,0.000037916707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001581383,0.00006948595,0.000058432288,0.000115639516,0.000018803925,0.00001728209,0.00058497844,0.029452508,0.00025561193,0.1796764,0.00035999014,0.78937507],"study_design_scores_gemma":[0.0005177349,0.00009998244,0.0001105757,0.0002864772,0.0000082474035,0.000014217795,1.0148753e-7,0.8072386,0.002083523,0.17480113,0.014279207,0.0005602233],"about_ca_topic_score_codex":0.000024036686,"about_ca_topic_score_gemma":0.000033159446,"teacher_disagreement_score":0.78881484,"about_ca_system_score_codex":0.00032414243,"about_ca_system_score_gemma":0.0007962771,"threshold_uncertainty_score":0.99973905},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012447375,0.0015530261,0.99516755,0.00051434693,0.0013373167,0.0002521724,0.000058060763,0.0002605735,0.00073248596],"genre_scores_gemma":[0.30986348,0.0001895062,0.689605,0.00010345209,0.00013998817,0.000001096687,0.000040693176,0.000018190894,0.000038576545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620265,0.000024531224,0.00053156324,0.0020166035,0.0007622405,0.00046243548],"domain_scores_gemma":[0.9875282,0.00032821592,0.0006253007,0.011277998,0.00019420058,0.0000460862],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0010690102,0.00042073615,0.0006099154,0.0006861563,0.00026971934,0.0006005664,0.026204934,0.0003840078,0.0000035290188],"category_scores_gemma":[0.0005451221,0.00034604242,0.00005351964,0.0002125644,0.0015130676,0.0020152652,0.017382277,0.00054679764,0.000007341227],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028877378,0.000015920255,0.000056972105,0.000032477452,0.000014378072,0.00007478205,0.00008966315,0.0018459619,0.00050407916,0.0040114485,0.000022882092,0.9933286],"study_design_scores_gemma":[0.00011613031,0.00006778241,0.000021740252,0.0004622236,0.000015060265,0.0001365092,4.3794785e-7,0.93598217,0.0036224693,0.05819039,0.0009967061,0.0003883979],"about_ca_topic_score_codex":0.00008446032,"about_ca_topic_score_gemma":0.00039772055,"teacher_disagreement_score":0.9929401,"about_ca_system_score_codex":0.00009522585,"about_ca_system_score_gemma":0.000931101,"threshold_uncertainty_score":0.99989915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002666134,0.0007429385,0.99616355,0.00040680045,0.0014641699,0.00033458645,0.000014326371,0.0002175902,0.00062937255],"genre_scores_gemma":[0.07327548,0.000075535325,0.9234707,0.00145396,0.0014155789,0.0000075551307,0.00010382958,0.000055903747,0.0001414632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99466103,0.00003528019,0.00055620936,0.0025336505,0.0013834904,0.00083035487],"domain_scores_gemma":[0.9956374,0.00045203368,0.0002761165,0.0029683555,0.00044507996,0.00022100612],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007681181,0.00061211194,0.00047422017,0.0006603496,0.0004673292,0.00035395043,0.0060633384,0.00036889926,0.000031996296],"category_scores_gemma":[0.000047098216,0.0005214535,0.00008209667,0.001018824,0.0013604019,0.001782121,0.0031441185,0.001227933,0.000025231828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011448024,0.000010609565,0.000035414818,0.000005164904,0.000014087333,0.000041181193,0.000052945703,0.9210442,0.0000015536524,0.03621203,0.000051410836,0.042519998],"study_design_scores_gemma":[0.00019539236,0.00010201435,0.000023586726,0.00024304245,0.000007436596,0.00011508357,3.5464048e-8,0.77644134,0.0000029117384,0.2220209,0.0003417445,0.0005065341],"about_ca_topic_score_codex":0.000008044485,"about_ca_topic_score_gemma":0.00012034877,"teacher_disagreement_score":0.18580887,"about_ca_system_score_codex":0.00017196014,"about_ca_system_score_gemma":0.0005449088,"threshold_uncertainty_score":0.99972373},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006446239,0.00025669375,0.97888464,0.00036813418,0.0048296535,0.0007945985,0.0000025537493,0.00021018366,0.014647098],"genre_scores_gemma":[0.55555415,0.000027951031,0.43267962,0.00085125846,0.0013350364,0.00006614642,0.00001506573,0.00006895584,0.009401795],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961628,0.000044988796,0.0005154188,0.0017375791,0.00083810685,0.00070114026],"domain_scores_gemma":[0.996145,0.0003418046,0.0006347461,0.0022652582,0.0004236965,0.00018946543],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00082529255,0.00056889694,0.0005560471,0.0005908789,0.0007256014,0.0022900496,0.0048164516,0.00034730934,0.000024566685],"category_scores_gemma":[0.00024598732,0.0004804203,0.00018622726,0.00021282,0.00093461416,0.0014943357,0.0016935728,0.0008782111,0.0002473611],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006157086,0.00008702292,0.00011726426,0.000062793886,0.000042742628,0.00012726693,0.0026396832,0.0008562335,0.000079977384,0.12847576,0.000050800405,0.8674543],"study_design_scores_gemma":[0.0007981373,0.00038539534,0.0003701734,0.00024451886,0.000024555358,0.00018990181,8.8924713e-7,0.39779726,0.00054473506,0.5474247,0.050656915,0.0015628692],"about_ca_topic_score_codex":0.00011384849,"about_ca_topic_score_gemma":0.00049944146,"teacher_disagreement_score":0.86589146,"about_ca_system_score_codex":0.0004112367,"about_ca_system_score_gemma":0.00073391694,"threshold_uncertainty_score":0.99976474},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032761306,0.0007316394,0.990353,0.0020603158,0.0018114436,0.0003835882,0.000031188887,0.00021543693,0.0040857615],"genre_scores_gemma":[0.7947944,0.000027064676,0.20061602,0.0034387491,0.00065182074,0.000009273769,0.000023181738,0.000071803835,0.00036770347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955565,0.000026113603,0.00039437306,0.0018394965,0.0013602305,0.00082329387],"domain_scores_gemma":[0.99609035,0.00046712055,0.00027064417,0.002582038,0.00034274743,0.00024711745],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004746626,0.0007121561,0.00058088504,0.0013507063,0.00074170344,0.0022448003,0.0051759216,0.0005390129,0.000018138413],"category_scores_gemma":[0.00020728375,0.00060024665,0.00038107592,0.00035999433,0.0014142834,0.0009483815,0.0010108288,0.0012697853,0.000053637334],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000831718,0.0003018228,0.0003376425,0.00019209832,0.000083730236,0.0015293268,0.0017392308,0.024328306,0.0015292715,0.09698766,0.00011551812,0.8727722],"study_design_scores_gemma":[0.00071869773,0.0009870407,0.00041495566,0.0012617421,0.000018305422,0.00011383578,4.4924795e-7,0.81819445,0.0020516377,0.17024173,0.0043022092,0.0016949482],"about_ca_topic_score_codex":0.000012649912,"about_ca_topic_score_gemma":0.000017790955,"teacher_disagreement_score":0.8710773,"about_ca_system_score_codex":0.000138705,"about_ca_system_score_gemma":0.0006719258,"threshold_uncertainty_score":0.9996449},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014584385,0.00019237048,0.99636465,0.0012914891,0.00022129383,0.00053582416,0.000013821873,0.000059630776,0.0011750833],"genre_scores_gemma":[0.64367193,0.00014554162,0.35331705,0.0021371315,0.00017932913,0.00009858973,0.000005162398,0.000027284492,0.00041796893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998041,0.000014723464,0.00025282905,0.000894752,0.00045196424,0.0003447568],"domain_scores_gemma":[0.9978599,0.00040388436,0.00019297787,0.0013323085,0.00011805417,0.00009288392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005377069,0.00028636164,0.00021498419,0.00034383356,0.0009287836,0.0007938781,0.0025807952,0.00011301604,0.0000069740063],"category_scores_gemma":[0.000053531272,0.0002125446,0.0000681332,0.00013559562,0.0003811581,0.00032969067,0.0011316771,0.00046529126,0.0000121049725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013129479,0.000023236693,0.0000062246586,0.00001841397,0.000007922382,0.000006291474,0.0010118994,0.016463503,0.00007632051,0.63715404,0.000020231717,0.34521058],"study_design_scores_gemma":[0.000106547435,0.00002803724,0.000037867623,0.00006810035,0.000003077055,0.000010509124,1.18266875e-7,0.7857374,0.00010405817,0.21277544,0.0009099362,0.00021892358],"about_ca_topic_score_codex":0.000009059641,"about_ca_topic_score_gemma":0.000089953464,"teacher_disagreement_score":0.7692739,"about_ca_system_score_codex":0.000056069024,"about_ca_system_score_gemma":0.00016200116,"threshold_uncertainty_score":0.86673176},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030602448,0.0006229558,0.98280215,0.0011722818,0.0025439872,0.00044808438,0.000004673768,0.00021271131,0.011887117],"genre_scores_gemma":[0.18432339,0.00017853483,0.80176175,0.008529913,0.0009109293,0.0000448447,0.000054955468,0.000074212396,0.004121496],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957644,0.00004178019,0.000565071,0.0016587246,0.0013035324,0.00066651485],"domain_scores_gemma":[0.997387,0.00043790357,0.0002928947,0.0012297229,0.00038154837,0.00027091408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006351625,0.00057604344,0.00047886596,0.0016394717,0.00036630905,0.00083374017,0.0029684377,0.00033958151,0.00012381944],"category_scores_gemma":[0.00007837856,0.0005406034,0.00019487516,0.0012449945,0.00046067042,0.000944875,0.0006637397,0.0007117769,0.000527473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033682318,0.00002804783,0.000017568007,0.000020166406,0.000015881447,0.000059709942,0.00029797823,0.02415062,0.00019178049,0.44056606,0.000403405,0.5342454],"study_design_scores_gemma":[0.00020315389,0.0001841607,0.00015793057,0.00012955848,0.0000065928634,0.0001189018,8.7410136e-8,0.17349692,0.00074652623,0.81879425,0.005529631,0.00063229253],"about_ca_topic_score_codex":0.000046993897,"about_ca_topic_score_gemma":0.000039025774,"teacher_disagreement_score":0.5336131,"about_ca_system_score_codex":0.00016333497,"about_ca_system_score_gemma":0.0006320435,"threshold_uncertainty_score":0.99970454},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034143333,0.00027192888,0.99273235,0.001946585,0.0016044449,0.0008350345,0.00003778447,0.00012896807,0.002408783],"genre_scores_gemma":[0.03869313,0.00012405026,0.95696795,0.0007781667,0.0008183808,0.00018982009,0.00006254598,0.000044119824,0.0023218358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673694,0.000015906371,0.00048639486,0.0015144158,0.00068275904,0.00056358625],"domain_scores_gemma":[0.9966446,0.0003122619,0.00041296362,0.0021279347,0.00031747174,0.00018477859],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004904635,0.00038782618,0.00036683472,0.0005236796,0.001068921,0.0005335151,0.0038477017,0.00020434117,0.00002507305],"category_scores_gemma":[0.000101327445,0.00038170617,0.00021567236,0.00026179955,0.00049999123,0.00070066575,0.001075127,0.0003984983,0.00003384741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011251528,0.00018527095,0.00028376328,0.000089377514,0.00008475176,0.000065168446,0.0017741014,0.07315631,0.00039295264,0.2866338,0.0017964232,0.63552684],"study_design_scores_gemma":[0.0003078531,0.00007105569,0.0008696315,0.00013443513,0.0000135702,0.000027738826,1.8693208e-7,0.61860484,0.00014956592,0.36972362,0.009589162,0.0005083354],"about_ca_topic_score_codex":0.000046707664,"about_ca_topic_score_gemma":0.00007864015,"teacher_disagreement_score":0.6350185,"about_ca_system_score_codex":0.00017806339,"about_ca_system_score_gemma":0.00038666482,"threshold_uncertainty_score":0.9998635},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015741072,0.00020317145,0.9703345,0.0025894681,0.006148562,0.00047470702,0.0000037220457,0.0004136576,0.019674812],"genre_scores_gemma":[0.6687192,0.00011919056,0.31562403,0.0062147677,0.0061399806,0.000046535097,0.000007925541,0.00013706181,0.002991333],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958375,0.000045765304,0.0005695455,0.0018327829,0.000988729,0.0007256862],"domain_scores_gemma":[0.9957195,0.00024741353,0.00057423994,0.0030721643,0.00018485346,0.00020182408],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009728777,0.00067696784,0.00064931664,0.0008255415,0.000496539,0.001517445,0.0061949203,0.0005086225,0.000015935912],"category_scores_gemma":[0.000056533227,0.0005589918,0.00019974905,0.00015464574,0.00038170718,0.0008225905,0.0019628454,0.0013272181,0.00005936915],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072142548,0.000035924153,0.0008035009,0.00006716103,0.000026470334,0.00024720308,0.0017903436,0.0003346576,0.00003926329,0.023313122,0.00079257315,0.9725426],"study_design_scores_gemma":[0.0014528284,0.002220043,0.0034769906,0.0089473715,0.000036134767,0.00081690354,0.0000020362247,0.3288725,0.007009407,0.49889955,0.14313695,0.0051292717],"about_ca_topic_score_codex":0.000050722418,"about_ca_topic_score_gemma":0.00015151661,"teacher_disagreement_score":0.9674133,"about_ca_system_score_codex":0.0003057984,"about_ca_system_score_gemma":0.00027407875,"threshold_uncertainty_score":0.9996862},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008733693,0.00043536894,0.99489117,0.000097557364,0.00026686737,0.00028433718,0.0000010693459,0.00022467374,0.0029255718],"genre_scores_gemma":[0.66408515,0.00002394262,0.3353189,0.00007325388,0.00020751143,0.0000036647868,7.055818e-7,0.00003086689,0.0002559892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996294,0.000048328387,0.00047619897,0.0014527612,0.0011191237,0.00060959486],"domain_scores_gemma":[0.99667567,0.00011276184,0.00074144057,0.001972776,0.00036653123,0.00013080581],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050352514,0.0005841164,0.00090849405,0.00082438975,0.00044798423,0.00044693632,0.0044698888,0.00030365319,0.0000018393167],"category_scores_gemma":[0.00011183007,0.00048531248,0.0002555582,0.0003174855,0.00118856,0.0015720812,0.0019915951,0.0011355457,0.0000040889254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008787974,0.000050448296,0.00002896606,0.00013132006,0.000040168004,0.00007685285,0.005594716,0.44133222,0.015994119,0.0207602,0.000001989773,0.51598024],"study_design_scores_gemma":[0.00007907837,0.0001033949,0.0000047759813,0.0007812266,0.00001550702,0.000024700023,3.382549e-7,0.77305657,0.027461996,0.19798452,0.00003206231,0.00045582504],"about_ca_topic_score_codex":0.000042680706,"about_ca_topic_score_gemma":0.00003169166,"teacher_disagreement_score":0.6632118,"about_ca_system_score_codex":0.0002449363,"about_ca_system_score_gemma":0.0005210958,"threshold_uncertainty_score":0.99975985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033701183,0.00017916424,0.9947472,0.000108308144,0.0009162449,0.00029175455,0.000017879618,0.00007049346,0.0002987966],"genre_scores_gemma":[0.76201785,0.000019024914,0.23770739,0.00007354749,0.00011953711,0.0000079996535,0.0000028144464,0.000026381933,0.00002545993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971126,0.00004712447,0.00059830595,0.00090031157,0.0009918072,0.00034985144],"domain_scores_gemma":[0.9971169,0.00015848246,0.0009684618,0.001094712,0.000578542,0.00008290499],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052789546,0.00036475976,0.00051409577,0.00045597114,0.00026977214,0.00019729635,0.0016589751,0.00026354674,0.000019572224],"category_scores_gemma":[0.00004951381,0.0003683563,0.00013598416,0.00025160942,0.0005820266,0.00068327796,0.0003782746,0.0005093985,0.0000024234325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009090318,0.000014322781,0.0010300911,0.00010159383,0.000014192036,0.0000044444128,0.00031203032,0.89768183,0.005697707,0.0004942248,5.077669e-7,0.09463997],"study_design_scores_gemma":[0.00023412195,0.000063163796,0.00026175188,0.0008236901,0.000023046308,0.000025903004,1.1187417e-7,0.9510171,0.03129265,0.01599201,0.000004606284,0.00026188724],"about_ca_topic_score_codex":0.0001456988,"about_ca_topic_score_gemma":0.000057937752,"teacher_disagreement_score":0.75864774,"about_ca_system_score_codex":0.0004415447,"about_ca_system_score_gemma":0.0009909621,"threshold_uncertainty_score":0.99987686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028467673,0.0006168326,0.9587335,0.0000548646,0.0018527551,0.001119327,8.062233e-7,0.0002594504,0.03707781],"genre_scores_gemma":[0.9619828,0.00000988559,0.03560074,0.00019117155,0.00050474406,0.00004576018,0.0000010879056,0.00004458548,0.0016192356],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99575484,0.00009694753,0.00070881064,0.0016069538,0.000914667,0.0009178079],"domain_scores_gemma":[0.9955644,0.00062594045,0.0005013736,0.0027294594,0.00028802326,0.00029077273],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0033133042,0.0006908365,0.0008085913,0.0008897429,0.0009840343,0.0017246917,0.0046614315,0.00035429042,0.000023425951],"category_scores_gemma":[0.00020538493,0.0005276318,0.00024833952,0.00032677306,0.00085437624,0.0009334512,0.0024949252,0.0008617819,0.00025442013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004826882,0.0001618538,0.000051698727,0.00008980209,0.000033996996,0.0045155096,0.011209758,0.00007764519,0.0000026247699,0.4842698,0.0000072926723,0.4995752],"study_design_scores_gemma":[0.000468471,0.00067512045,0.000009312525,0.00014015299,0.000028053593,0.0074874423,0.000012858455,0.03789659,0.000061085724,0.9507429,0.0016663045,0.000811688],"about_ca_topic_score_codex":0.000106099455,"about_ca_topic_score_gemma":0.00038044166,"teacher_disagreement_score":0.9616981,"about_ca_system_score_codex":0.00019679149,"about_ca_system_score_gemma":0.00058598176,"threshold_uncertainty_score":0.99971753},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03536537,0.00092769664,0.9406569,0.0007482459,0.00090607884,0.00078606687,0.0000020510652,0.00003493458,0.02057263],"genre_scores_gemma":[0.9978369,0.000035837147,0.0017938778,0.00013322335,0.000108265995,0.000010441209,0.0000012333658,0.000005966378,0.000074258656],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801415,0.00014955319,0.000328788,0.00077392283,0.00043886853,0.00029473956],"domain_scores_gemma":[0.9975052,0.0009274241,0.00027368212,0.001130207,0.00012545091,0.00003806269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024197043,0.00025317076,0.0002809275,0.0003617824,0.00025527467,0.00028968952,0.0020185024,0.00021216675,0.0000031118261],"category_scores_gemma":[0.00030434335,0.00015069224,0.000060431164,0.0002814947,0.0006033949,0.00038439815,0.00050521735,0.00062839047,0.000007523644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014345793,0.000098810735,0.00069140445,0.0000281414,0.0000031026063,0.00000846987,0.01098163,0.0010546009,0.00021964591,0.25712404,0.0000067935744,0.729769],"study_design_scores_gemma":[0.00025856428,0.00018465793,0.019537017,0.00033416977,0.000004202663,0.000018847897,0.000004695855,0.43330106,0.0013214652,0.54451656,0.00025068768,0.00026804753],"about_ca_topic_score_codex":0.0001831982,"about_ca_topic_score_gemma":0.0027190158,"teacher_disagreement_score":0.96247154,"about_ca_system_score_codex":0.00021310635,"about_ca_system_score_gemma":0.00029419502,"threshold_uncertainty_score":0.6145051},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009849484,0.001531503,0.9236251,0.00047082244,0.006500153,0.001831191,0.000020555202,0.00031776074,0.06471793],"genre_scores_gemma":[0.97756976,0.000020718626,0.010488116,0.0010398937,0.009537456,0.0001342627,0.00006365219,0.00009955086,0.00104659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982358,0.000004458753,0.00027908626,0.0007492322,0.00030814818,0.0004232824],"domain_scores_gemma":[0.9984504,0.00017931945,0.0003858113,0.0006450693,0.00031859477,0.00002083657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008264512,0.00035536848,0.0003863805,0.0007043878,0.0005747146,0.0009895643,0.0010616392,0.0002060927,0.000033998193],"category_scores_gemma":[0.00004510736,0.00032766964,0.00012917379,0.000110798996,0.00023178282,0.0009362349,0.000646219,0.00025118,0.0001060663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023880257,0.000019028705,0.00064610806,0.0010322683,0.00000902959,0.00002135078,0.00018522372,0.000024437884,0.000057005647,0.009186356,0.000054609634,0.9887407],"study_design_scores_gemma":[0.00390806,0.00018021368,0.030206172,0.019150894,0.00081230595,0.00012229908,0.0000047899875,0.4599639,0.00044911116,0.12270111,0.35607603,0.006425145],"about_ca_topic_score_codex":0.00010270012,"about_ca_topic_score_gemma":0.00015205625,"teacher_disagreement_score":0.98231554,"about_ca_system_score_codex":0.00013926355,"about_ca_system_score_gemma":0.00008077429,"threshold_uncertainty_score":0.9999175},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012431749,0.00020229741,0.997764,0.0004582804,0.0004279034,0.00042020078,0.000001534168,0.00016375951,0.00043771634],"genre_scores_gemma":[0.6105397,0.000040667084,0.38922405,0.00004819287,0.000034426517,0.000014310165,0.0000016191178,0.000009581476,0.000087457905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998253,0.00002208772,0.00036252956,0.0006850779,0.00045477977,0.00022255615],"domain_scores_gemma":[0.9980917,0.0002014473,0.00053350365,0.00097033434,0.00015901511,0.000043981887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067324535,0.00021828189,0.00027833425,0.00054625474,0.00020510306,0.00037924253,0.0016309469,0.00015431909,0.000003407431],"category_scores_gemma":[0.000030607967,0.00019826321,0.000036251702,0.000120958684,0.00045065553,0.000636322,0.000560636,0.0001853654,0.0000060232437],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002615152,0.0000045673396,0.000099187535,0.000060539744,0.0000059437853,0.0000056114127,0.0005463118,0.00055379915,0.0004071914,0.11302467,0.000009279879,0.8852803],"study_design_scores_gemma":[0.0009822482,0.00075554964,0.0024690656,0.00093089003,0.000029219838,0.00009156005,0.00000866518,0.61901635,0.053016,0.32076487,0.00084504765,0.0010905067],"about_ca_topic_score_codex":0.00002942333,"about_ca_topic_score_gemma":0.000029285016,"teacher_disagreement_score":0.8841898,"about_ca_system_score_codex":0.00013773881,"about_ca_system_score_gemma":0.0002488719,"threshold_uncertainty_score":0.80849385},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002347765,0.00021677611,0.9949724,0.00047011813,0.0018518298,0.00093856273,0.00000732057,0.00012965513,0.0011785348],"genre_scores_gemma":[0.18533471,0.000009474275,0.8131587,0.0005933936,0.00060817937,0.000042145668,0.000004069693,0.000029889226,0.0002194321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659306,0.00002551578,0.00045947568,0.0015573218,0.000717964,0.00064665196],"domain_scores_gemma":[0.99718684,0.0006831115,0.00046892237,0.0011867697,0.00033624933,0.0001380835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012502144,0.00043644832,0.0004256644,0.0005062987,0.0006619419,0.0007485228,0.0026206675,0.00026550828,0.0000037813454],"category_scores_gemma":[0.0001410654,0.00042219312,0.00015803643,0.00011069606,0.00033048296,0.00066102186,0.00094053533,0.0005083885,0.000013556262],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001400275,0.000016810856,0.000023387653,0.00005337282,0.00001482484,0.00002624042,0.002803631,0.019683752,0.00004711877,0.013025249,0.000002808783,0.9642888],"study_design_scores_gemma":[0.00051744026,0.00020278592,0.00007064452,0.0006321201,0.000008680705,0.000026334335,0.0000010018952,0.7477716,0.00072901405,0.24917725,0.0003702602,0.00049287366],"about_ca_topic_score_codex":0.000032114935,"about_ca_topic_score_gemma":0.00015865499,"teacher_disagreement_score":0.9637959,"about_ca_system_score_codex":0.00031333175,"about_ca_system_score_gemma":0.0005240505,"threshold_uncertainty_score":0.999823},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004418504,0.00020089613,0.9644859,0.0009859102,0.0028065809,0.0004423684,0.000009942237,0.00020024787,0.030863773],"genre_scores_gemma":[0.021717208,0.00012614118,0.9586114,0.0024933883,0.0019301947,0.000031683427,0.000043416596,0.00008594114,0.0149606],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959553,0.000020004516,0.00041480557,0.0018363919,0.0010479232,0.0007255724],"domain_scores_gemma":[0.9957241,0.00019952825,0.00035806795,0.0033836695,0.00016007684,0.00017458333],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009339186,0.000531834,0.00049189373,0.00063903537,0.0004546437,0.0021007168,0.009117804,0.00021501728,0.000034999553],"category_scores_gemma":[0.00014692367,0.0004727427,0.000119427146,0.00020586993,0.0008969443,0.0014644995,0.003999853,0.0006444384,0.00022471219],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014807868,0.000020822963,0.000010356869,0.000043019798,0.000009682551,0.00016338924,0.00013955045,0.002147757,0.0000065617305,0.07446954,0.0002447681,0.9227431],"study_design_scores_gemma":[0.0002629837,0.00013989607,0.00013635682,0.00036802844,0.000012274665,0.000039096623,3.1820846e-8,0.47664285,0.00010203326,0.48841387,0.032989673,0.0008928875],"about_ca_topic_score_codex":0.000022444741,"about_ca_topic_score_gemma":0.000068858426,"teacher_disagreement_score":0.9218502,"about_ca_system_score_codex":0.00018488003,"about_ca_system_score_gemma":0.00035312818,"threshold_uncertainty_score":0.9997724},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004783646,0.00009108019,0.99530345,0.0001003097,0.0024554445,0.0014432796,0.00015493257,0.0001564583,0.00029025666],"genre_scores_gemma":[0.023430122,0.0000111714135,0.975932,0.00017992353,0.00019756223,0.00005762164,0.000060512768,0.000055694338,0.00007538511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951363,0.00007034672,0.00094795745,0.0021866919,0.00093989156,0.0007187936],"domain_scores_gemma":[0.9928394,0.0014309622,0.0015167425,0.002112784,0.0018523165,0.00024776996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011670887,0.000778003,0.001349327,0.0027995317,0.0006323298,0.0005156322,0.0027667377,0.00050978165,0.00001882467],"category_scores_gemma":[0.0008176649,0.00078767556,0.000520934,0.0012728929,0.0016254612,0.00097319495,0.00067489693,0.00060250453,0.000002351037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002274481,0.0001081684,0.000019140081,0.000026017775,0.00018343586,0.00015183148,0.00039206987,0.8676425,0.000013118083,0.00443993,8.316653e-7,0.12700017],"study_design_scores_gemma":[0.0019585534,0.00026757226,0.000027246997,0.00016572083,0.00021673748,0.000065119384,9.032852e-7,0.9870065,0.00092938927,0.008552771,0.00003077467,0.00077870156],"about_ca_topic_score_codex":0.000056767258,"about_ca_topic_score_gemma":0.00008397803,"teacher_disagreement_score":0.12622146,"about_ca_system_score_codex":0.0006113024,"about_ca_system_score_gemma":0.0011674796,"threshold_uncertainty_score":0.9994574},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010672181,0.00007003321,0.95452535,0.0014415727,0.0048508123,0.00033577444,0.00001863549,0.000077601864,0.038573522],"genre_scores_gemma":[0.9263707,0.00007574616,0.035420444,0.0018654704,0.0051282686,0.000045662993,0.000015057588,0.000076861,0.031001808],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99571806,0.000064901105,0.0006673679,0.0014035624,0.0017196182,0.00042650185],"domain_scores_gemma":[0.99492836,0.0013181759,0.0006959058,0.0022829464,0.0005891668,0.00018543366],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.003126899,0.0003396792,0.00049247674,0.0008573589,0.0013867521,0.00081820646,0.0035872196,0.00034148683,0.0004339388],"category_scores_gemma":[0.0018462931,0.00028154056,0.00019657625,0.00050458463,0.0016584243,0.0005400721,0.000616331,0.0008934527,0.00073650345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019280407,0.000050669725,0.00005898837,0.0000035484575,0.000009872053,0.000017386885,0.00025337088,0.0049774465,0.00010995381,0.41494498,0.0011209204,0.5784336],"study_design_scores_gemma":[0.00016575994,0.000053438944,0.0000904971,0.000035626632,0.000008829565,0.000033697997,2.6344688e-7,0.0066775703,0.00047463295,0.91526943,0.0768873,0.00030292757],"about_ca_topic_score_codex":0.000022624607,"about_ca_topic_score_gemma":0.00005073406,"teacher_disagreement_score":0.926264,"about_ca_system_score_codex":0.00021993375,"about_ca_system_score_gemma":0.00055704184,"threshold_uncertainty_score":0.9999637},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050939578,0.00009085316,0.98501474,0.0009914102,0.003639665,0.0004845169,0.000018415612,0.00014751167,0.0045189424],"genre_scores_gemma":[0.9056995,0.000066049084,0.091413744,0.00096829736,0.0010642289,0.000020679146,0.000026137468,0.000049821876,0.0006915792],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955031,0.00004067465,0.0005790895,0.0018117393,0.0012125307,0.00085284165],"domain_scores_gemma":[0.996138,0.0002902808,0.00046737105,0.002651511,0.00021263954,0.00024023355],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00058324524,0.0006311226,0.00058573275,0.0009848244,0.0009902364,0.002109117,0.0047199856,0.0003087313,0.00009611393],"category_scores_gemma":[0.000059770544,0.00056563807,0.0002443439,0.00030695242,0.00078331487,0.0007509782,0.0014763215,0.0009113298,0.00006546116],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029377916,0.00018520303,0.00017617171,0.0000672586,0.00005836578,0.00019069167,0.002407056,0.00234954,0.000678618,0.18464062,0.0004816317,0.8087355],"study_design_scores_gemma":[0.0024105266,0.0015640402,0.0046290485,0.0012156321,0.00005836231,0.00020542736,9.731483e-7,0.39722124,0.0054689837,0.56498504,0.018599888,0.0036408752],"about_ca_topic_score_codex":0.00008441138,"about_ca_topic_score_gemma":0.00031084768,"teacher_disagreement_score":0.9006055,"about_ca_system_score_codex":0.00024112129,"about_ca_system_score_gemma":0.0005223776,"threshold_uncertainty_score":0.9996795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036002844,0.00007287714,0.99507755,0.000712001,0.0022143924,0.00045866973,0.00000303608,0.00017391212,0.0009275334],"genre_scores_gemma":[0.29723164,0.000011100808,0.7002515,0.00012688516,0.0013553094,0.000016534168,0.000018144625,0.000048182756,0.0009406727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652505,0.000068347596,0.00042169046,0.0016552743,0.0007734564,0.000556163],"domain_scores_gemma":[0.99702156,0.0003623093,0.0008627352,0.0011886831,0.00043027443,0.00013443231],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0013371868,0.00042145516,0.00045546837,0.0005036745,0.0014209832,0.00080068555,0.0019690811,0.00032370313,0.000005203503],"category_scores_gemma":[0.00041645468,0.00042010692,0.00015596779,0.00016521731,0.0004808723,0.0009270548,0.00080817885,0.0011845408,0.000008368241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010775943,0.000020787846,0.000014968494,0.000045056368,0.000011772632,0.0000040506497,0.00033486332,0.053069945,0.0036827184,0.0090762805,0.000002109252,0.93372667],"study_design_scores_gemma":[0.00023246516,0.000120707584,0.00021990112,0.0002745563,0.000014045201,0.000039512008,4.1292938e-7,0.9537317,0.0015999501,0.042665552,0.00063134084,0.00046982217],"about_ca_topic_score_codex":0.00010386681,"about_ca_topic_score_gemma":0.000012386252,"teacher_disagreement_score":0.93325686,"about_ca_system_score_codex":0.0004906508,"about_ca_system_score_gemma":0.00062039425,"threshold_uncertainty_score":0.999879},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046680012,0.0003067983,0.99428266,0.00050792965,0.0022579283,0.00027870096,0.0000027391031,0.000114885,0.0017815286],"genre_scores_gemma":[0.61595654,0.000027216234,0.38282368,0.00027493213,0.0003591962,0.0000056582403,0.000004160364,0.000039151295,0.00050947804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644196,0.00009142994,0.00040180527,0.0015594289,0.00093486987,0.0005704874],"domain_scores_gemma":[0.9970857,0.00023651564,0.0005788112,0.0016713068,0.00029923764,0.00012845508],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018480374,0.0004662919,0.00049846165,0.0006903917,0.0006651993,0.0013340852,0.003444485,0.00026038778,0.000006635366],"category_scores_gemma":[0.00016227001,0.00043100695,0.00015489943,0.00017798715,0.00087691227,0.0010997768,0.000706637,0.0006479502,0.00003526609],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027747326,0.000021308133,0.000101583486,0.000024431498,0.000006153699,0.000068540234,0.0016498087,0.003317179,0.00033074024,0.005467489,0.000002809503,0.9890072],"study_design_scores_gemma":[0.00025284538,0.00014977799,0.0018109594,0.0005772219,0.000016831182,0.00020173738,6.7272333e-7,0.8550436,0.0025791829,0.1381126,0.00031498168,0.00093961944],"about_ca_topic_score_codex":0.000050184288,"about_ca_topic_score_gemma":0.00006064051,"teacher_disagreement_score":0.98806757,"about_ca_system_score_codex":0.0003191908,"about_ca_system_score_gemma":0.00046473596,"threshold_uncertainty_score":0.99981415},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069443905,0.00010476148,0.99521947,0.0003599888,0.0011326647,0.0008231473,0.000005529222,0.00007245687,0.0015875712],"genre_scores_gemma":[0.91190034,0.000027256987,0.08541865,0.00034911235,0.0003088912,0.000015446314,0.0000019443316,0.00003306671,0.0019453075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721664,0.00007884214,0.00048079953,0.00089532696,0.0009788799,0.00034951154],"domain_scores_gemma":[0.99683833,0.00019128175,0.00043896848,0.002099745,0.0003321844,0.00009947586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013441236,0.0002809313,0.0003342223,0.00037898656,0.00058597606,0.00052080245,0.0034844899,0.0001581133,0.00001915264],"category_scores_gemma":[0.00014404077,0.00020293609,0.00011503644,0.000275911,0.0006131498,0.00070923415,0.0018980606,0.0005992364,0.000017061038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069258635,0.00021927488,0.00029087235,0.00007513564,0.0000417903,0.0007854028,0.010161276,0.35130844,0.00017818932,0.0025406806,0.000042379183,0.63434964],"study_design_scores_gemma":[0.00029153784,0.00022285379,0.00006467612,0.00028547583,0.000008878743,0.00046924123,0.0000011650917,0.988345,0.000100810656,0.009699697,0.00030068393,0.00020996596],"about_ca_topic_score_codex":0.000056284967,"about_ca_topic_score_gemma":0.000074743,"teacher_disagreement_score":0.9112059,"about_ca_system_score_codex":0.00013004504,"about_ca_system_score_gemma":0.0004884808,"threshold_uncertainty_score":0.82754934},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022690144,0.00027563836,0.9925079,0.00073592167,0.0006852352,0.00024169302,0.000001062352,0.00021422774,0.005111419],"genre_scores_gemma":[0.1994415,0.000017328697,0.7986718,0.00064180355,0.00039243768,0.0000058261267,0.000005363359,0.00003519106,0.0007887671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966042,0.000039074297,0.00039313638,0.0014369243,0.0009913603,0.0005353139],"domain_scores_gemma":[0.99725336,0.0003294039,0.00052033376,0.0015001294,0.00022800392,0.00016874341],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010336258,0.00044425193,0.0004144765,0.00058095146,0.0006607314,0.0010886085,0.0032177712,0.00023844348,0.0000071640666],"category_scores_gemma":[0.00028464728,0.00037972347,0.00006543942,0.00020303327,0.0005656754,0.00090959965,0.0011101787,0.0013290822,0.000023126971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012676027,0.000006181041,0.0005280977,0.00004515625,0.000008236604,0.000068125104,0.0015316205,0.17036466,0.00011725098,0.017469434,0.0000012485027,0.80985874],"study_design_scores_gemma":[0.00020802603,0.000126262,0.00012355925,0.00066755497,0.0000053964236,0.000053952695,1.13454874e-7,0.9292235,0.00030705778,0.0682182,0.0005802223,0.00048615065],"about_ca_topic_score_codex":0.00006572455,"about_ca_topic_score_gemma":0.0001582144,"teacher_disagreement_score":0.80937254,"about_ca_system_score_codex":0.0001805574,"about_ca_system_score_gemma":0.00049737375,"threshold_uncertainty_score":0.9999484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017383536,0.0002664396,0.9888998,0.0011092355,0.0068236333,0.0007451834,0.00006811113,0.00027844627,0.0018073998],"genre_scores_gemma":[0.000953478,0.000026409947,0.9928571,0.0016063851,0.0023816884,0.000050038347,0.00010653972,0.000051771323,0.0019666143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519414,0.000033699747,0.0005732494,0.0020329792,0.0011114264,0.0010544796],"domain_scores_gemma":[0.99640876,0.0004398265,0.0005526905,0.0021235738,0.00026791502,0.0002072412],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016118152,0.0006757598,0.00064127636,0.00061508064,0.0011189377,0.001823392,0.006009014,0.00029861194,0.000023305725],"category_scores_gemma":[0.000058421192,0.0006405182,0.00026054645,0.00028529708,0.00056424504,0.0013691621,0.0016412226,0.0006368429,0.000052271917],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035420921,0.000018284316,0.000004205949,0.00003336158,0.000021782032,0.000043781376,0.0000543859,0.03116007,0.00001367003,0.009386236,0.00041941664,0.95884126],"study_design_scores_gemma":[0.00034746338,0.00010081313,0.000023749097,0.00029941904,0.000013655639,0.000009790945,5.575507e-8,0.78202844,0.00012031019,0.1911947,0.02518412,0.0006774718],"about_ca_topic_score_codex":0.00006791933,"about_ca_topic_score_gemma":0.00008129915,"teacher_disagreement_score":0.9581638,"about_ca_system_score_codex":0.00027364647,"about_ca_system_score_gemma":0.00061240763,"threshold_uncertainty_score":0.9996046},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002150286,0.00010254502,0.99096036,0.0012864404,0.002833686,0.000662296,0.000031041254,0.00020252935,0.003899578],"genre_scores_gemma":[0.0015653073,0.000026527483,0.9963225,0.00054311106,0.0005281539,0.000012314116,0.000041607607,0.00003375269,0.00092671945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995505,0.00010699242,0.0005795754,0.0021384691,0.0009270079,0.00074299396],"domain_scores_gemma":[0.9964516,0.0003115356,0.0005998619,0.0022160378,0.00025758139,0.00016338639],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024865544,0.00063757395,0.0006858451,0.00063434074,0.0007351513,0.0021298013,0.004910117,0.0002715686,0.000064818894],"category_scores_gemma":[0.00016983556,0.00058828964,0.0001986284,0.00032195446,0.00073132984,0.0024816378,0.0025314777,0.00071646075,0.000024600957],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008339446,0.000030740724,0.000048774495,0.0000666347,0.000024207402,0.000034777186,0.0006025649,0.0017543081,0.000045550085,0.016151011,0.000031671465,0.9812014],"study_design_scores_gemma":[0.00041274144,0.00009550255,0.00008678406,0.00023703418,0.000025583706,0.000043028478,3.3991452e-7,0.5725266,0.00029318556,0.41023472,0.015237845,0.00080666365],"about_ca_topic_score_codex":0.00012043508,"about_ca_topic_score_gemma":0.00011367221,"teacher_disagreement_score":0.9803948,"about_ca_system_score_codex":0.0005221333,"about_ca_system_score_gemma":0.0005077689,"threshold_uncertainty_score":0.99965686},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009473052,0.00027635667,0.9928259,0.000016822047,0.00092982803,0.0007249129,0.000011802133,0.00005231187,0.0050673103],"genre_scores_gemma":[0.47057733,0.00055886694,0.5255949,0.00021077004,0.00041011276,0.00013376778,0.000025231418,0.00014522238,0.0023438286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981754,0.0000064094215,0.0002925983,0.0007094133,0.0003345471,0.00048167488],"domain_scores_gemma":[0.9990444,0.00006149113,0.00009081848,0.00071612484,0.000017414628,0.00006974055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022965857,0.00040356474,0.00036155025,0.00033977226,0.00013279656,0.00023130434,0.001123976,0.00021575698,0.000013479145],"category_scores_gemma":[0.000010028107,0.00038310248,0.000074481744,0.000047319107,0.00030936283,0.00028116317,0.00026253157,0.00043868384,0.00001995254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040707314,0.000015166264,0.000008706496,0.00006365836,0.00001499399,0.0000262332,0.0004665411,0.48538777,0.00013399006,0.0006457535,0.00000653102,0.51322657],"study_design_scores_gemma":[0.0005699518,0.00013514842,0.00055718253,0.00077536737,0.000022055632,0.0000140936145,0.000005814086,0.9579361,0.0041766707,0.027704457,0.006965969,0.0011371543],"about_ca_topic_score_codex":0.000026609428,"about_ca_topic_score_gemma":0.0002522528,"teacher_disagreement_score":0.51208943,"about_ca_system_score_codex":0.00036856424,"about_ca_system_score_gemma":0.00004672105,"threshold_uncertainty_score":0.9998621},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1326408,0.00050339306,0.80500436,0.0013637606,0.0043414305,0.0006839591,0.00019448658,0.00009592929,0.05517191],"genre_scores_gemma":[0.9646683,0.000003544036,0.015199102,0.017191118,0.0020734556,0.000005729499,0.000029673069,0.000067514244,0.00076160807],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99558717,0.00014863952,0.0005031254,0.00221901,0.0007326006,0.00080943987],"domain_scores_gemma":[0.9972341,0.0010216931,0.0003930753,0.0008578537,0.00020706789,0.00028618242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006336723,0.0007050799,0.0008476535,0.0005669331,0.0005550546,0.00031798385,0.0015498517,0.0006466709,0.0006733433],"category_scores_gemma":[0.00009289154,0.00063646457,0.00019918043,0.00013659848,0.0011771014,0.00013679727,0.0003581006,0.0013094068,0.00023318468],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035108294,0.00025894892,0.0007916289,0.000039001494,0.00027536202,0.00079974334,0.05930535,0.0014839282,0.00042459287,0.0043789456,0.00033109452,0.93156034],"study_design_scores_gemma":[0.010358692,0.0038272224,0.58174634,0.012812381,0.00058805867,0.0007269651,0.0000783149,0.03405858,0.0010376798,0.3019157,0.041463237,0.011386826],"about_ca_topic_score_codex":0.00048049848,"about_ca_topic_score_gemma":0.00040227556,"teacher_disagreement_score":0.92017347,"about_ca_system_score_codex":0.00018364441,"about_ca_system_score_gemma":0.00018762753,"threshold_uncertainty_score":0.99960864},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016110779,0.00019022501,0.9919863,0.0005779749,0.0014030177,0.0011192785,0.000005631917,0.00023265198,0.004323818],"genre_scores_gemma":[0.6016432,0.00005854703,0.3930071,0.0012265284,0.0007271246,0.0001246472,0.0000067243554,0.00011515167,0.0030909895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604535,0.000088175235,0.0004812458,0.0017230712,0.000837458,0.0008246971],"domain_scores_gemma":[0.99613017,0.002107814,0.00012044926,0.0011189023,0.0002973005,0.00022536551],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014100403,0.00062672305,0.0006971198,0.0006859892,0.0009264342,0.0010262541,0.0030937437,0.0004062161,0.000024501242],"category_scores_gemma":[0.00040604916,0.0005871175,0.0003346116,0.0001897626,0.00070539163,0.000795385,0.00026866514,0.0011037445,0.000054983757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023501376,0.000022471218,0.000022424234,0.00005794901,0.000025697369,0.00002961856,0.0023337284,0.039565817,0.00050471927,0.013423019,0.00000433025,0.9439867],"study_design_scores_gemma":[0.0015830378,0.0005695941,0.00048757537,0.0005607992,0.000036015474,0.000044135897,9.96497e-7,0.91720486,0.004333409,0.051216226,0.022614446,0.0013489156],"about_ca_topic_score_codex":0.000014906465,"about_ca_topic_score_gemma":0.00006352623,"teacher_disagreement_score":0.9426378,"about_ca_system_score_codex":0.00024523048,"about_ca_system_score_gemma":0.0003398211,"threshold_uncertainty_score":0.99965805},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008487086,0.00003988208,0.9893443,0.0042132055,0.00090120896,0.00060340634,0.000008009573,0.00010543741,0.004699682],"genre_scores_gemma":[0.9939245,0.000007830648,0.0020969806,0.0019791012,0.001384892,0.000055798286,0.00020343703,0.000029575185,0.00031788315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678725,0.00017855046,0.0004932821,0.0010467137,0.0009840783,0.0005101187],"domain_scores_gemma":[0.9968878,0.000728527,0.00058231823,0.0007699288,0.00087975065,0.00015169567],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0023331344,0.00037142416,0.00039704042,0.0006722376,0.0028136473,0.00064442493,0.0012791315,0.00055521546,0.00037606046],"category_scores_gemma":[0.00043170384,0.00039939221,0.00015999112,0.0004828839,0.0018556891,0.0002654028,0.00006233647,0.00071347825,0.000061559476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018478688,0.000095117015,0.00029363466,0.000021707976,0.0000068780396,0.0000028472275,0.0007666561,0.3594464,0.000001279035,0.0030836777,0.000042016673,0.6362213],"study_design_scores_gemma":[0.0005868619,0.0002309403,0.0025600684,0.00050882006,0.000113202244,2.9270495e-7,0.000005332023,0.9721506,0.000072386116,0.014248069,0.008482546,0.0010408288],"about_ca_topic_score_codex":0.0015958226,"about_ca_topic_score_gemma":0.016594283,"teacher_disagreement_score":0.9938396,"about_ca_system_score_codex":0.0011421422,"about_ca_system_score_gemma":0.0025822339,"threshold_uncertainty_score":0.9998458},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004012427,0.0008536238,0.99555445,0.0005544652,0.0014679038,0.0004403674,0.000010472311,0.00015106027,0.00092755817],"genre_scores_gemma":[0.328262,0.000113203205,0.66927737,0.00054115575,0.0010510667,0.000008787863,0.000009832884,0.00005119935,0.0006853626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958175,0.000052616422,0.00049518945,0.0017993668,0.0008195332,0.0010158163],"domain_scores_gemma":[0.99680144,0.00065635523,0.00034544495,0.0015098467,0.00039435597,0.00029257257],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012945179,0.0006131713,0.0007159702,0.00040118975,0.001118048,0.0016464255,0.0037701183,0.0004773705,0.000009564072],"category_scores_gemma":[0.00025301552,0.0005572686,0.00014060244,0.00018793519,0.0009013148,0.00049178925,0.001575606,0.0014983326,0.000006369889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008980827,0.000007671494,0.00014837403,0.000080975384,0.00002396813,0.00003843201,0.00048655987,0.14452967,0.000054457567,0.10858286,0.00003297438,0.74600506],"study_design_scores_gemma":[0.00015927418,0.00016406558,0.000073690135,0.0003157171,0.000014123977,0.00004555363,6.081168e-8,0.6369738,0.00014320869,0.3605614,0.0010504859,0.0004986046],"about_ca_topic_score_codex":0.00002284562,"about_ca_topic_score_gemma":0.000067105706,"teacher_disagreement_score":0.74550647,"about_ca_system_score_codex":0.00012407992,"about_ca_system_score_gemma":0.0006544206,"threshold_uncertainty_score":0.99968785},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002820334,0.00059035636,0.991773,0.0018506768,0.0014737875,0.0006506419,0.0000033908345,0.00016256365,0.0034673822],"genre_scores_gemma":[0.0882414,0.000060387523,0.9084564,0.00032940085,0.0004267075,0.000028940736,0.000007878037,0.000026864942,0.0024220173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972827,0.000014205983,0.00026512728,0.0012444507,0.0007126299,0.00048089444],"domain_scores_gemma":[0.9973923,0.0003622738,0.00042797156,0.0014679204,0.0002595502,0.00008998762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057369797,0.0004106486,0.0004078004,0.00043483629,0.0004836343,0.00075642567,0.0022885904,0.00037106356,0.0000024817896],"category_scores_gemma":[0.000056543544,0.000315226,0.000103074744,0.00011879405,0.00033782402,0.0013379407,0.00041516314,0.0005142527,0.000008490311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045308756,0.00003560053,0.000071250855,0.00008666551,0.000028171853,0.00007414719,0.0008716252,0.13951248,0.00012425242,0.17642449,0.0001714592,0.68255454],"study_design_scores_gemma":[0.00033319066,0.00023821535,0.00026451235,0.00027814286,0.000014967446,0.000090982336,1.8361867e-7,0.6620216,0.0003965102,0.33374014,0.0021693096,0.00045226057],"about_ca_topic_score_codex":0.000017862629,"about_ca_topic_score_gemma":0.000098383665,"teacher_disagreement_score":0.6821023,"about_ca_system_score_codex":0.00023966254,"about_ca_system_score_gemma":0.00039042134,"threshold_uncertainty_score":0.99992996},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000095068994,0.0023237828,0.99055254,0.00047724848,0.0013203801,0.00024894188,0.000002829219,0.00007242368,0.004906773],"genre_scores_gemma":[0.7371969,0.0001783891,0.2619328,0.00030352213,0.00017686913,0.000007182403,0.0000024841377,0.000020493964,0.00018133233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966049,0.00005367949,0.00074467366,0.0013691614,0.0006426947,0.0005848986],"domain_scores_gemma":[0.9964433,0.00045041103,0.0005148549,0.0021088426,0.00036288425,0.00011974406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013520918,0.00043251988,0.00065545324,0.00090850255,0.00025687306,0.0005418835,0.0044212597,0.00025391337,0.0000063952702],"category_scores_gemma":[0.00035640138,0.000412969,0.000121638855,0.0003715332,0.0011160418,0.0008083896,0.0016231132,0.0009813732,0.0000086239925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008688629,0.000038046706,0.00038213935,0.000077706216,0.000013768999,0.00007460369,0.0017970739,0.21630552,0.00016362182,0.042695172,0.0000322417,0.7384114],"study_design_scores_gemma":[0.00014172068,0.000090108726,0.00037517937,0.0018591065,0.0000061045585,0.00002880507,2.8401854e-7,0.87055135,0.0004488042,0.12593031,0.00008833369,0.0004799075],"about_ca_topic_score_codex":0.0001444621,"about_ca_topic_score_gemma":0.0007505751,"teacher_disagreement_score":0.7379315,"about_ca_system_score_codex":0.00018718345,"about_ca_system_score_gemma":0.0008095761,"threshold_uncertainty_score":0.9998322},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018177189,0.000083143575,0.96994346,0.0013497369,0.0013153175,0.00020677569,0.000019632476,0.00006313191,0.026837043],"genre_scores_gemma":[0.82604456,0.000057748402,0.13199322,0.00467779,0.002716261,0.000025326732,0.000020899359,0.000073448646,0.034390762],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606854,0.000049086688,0.00055435556,0.0014675533,0.0014986489,0.00036181038],"domain_scores_gemma":[0.9953086,0.00065158046,0.000548222,0.0029065476,0.0003748914,0.0002101642],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032209551,0.00030580183,0.0004005056,0.00062786386,0.000869351,0.0011956815,0.0049666525,0.00024692953,0.0006217935],"category_scores_gemma":[0.0006049555,0.0002338489,0.000117750926,0.0002214985,0.0016747138,0.0007995479,0.0007031491,0.0005569915,0.0011827803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052412647,0.000014261557,0.000027325674,0.0000012934324,0.000002361593,0.000010800924,0.0002031237,0.004391718,0.00005491644,0.08088756,0.0001104812,0.9142909],"study_design_scores_gemma":[0.000076260505,0.000043796645,0.000119118,0.00003267221,0.0000040377663,0.000028138338,3.2107044e-7,0.018200248,0.00047321385,0.91298544,0.06774485,0.00029191474],"about_ca_topic_score_codex":0.0000068808713,"about_ca_topic_score_gemma":0.0000877384,"teacher_disagreement_score":0.913999,"about_ca_system_score_codex":0.00007707379,"about_ca_system_score_gemma":0.00031138447,"threshold_uncertainty_score":0.99984115},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012173326,0.00017127836,0.99253154,0.0009330924,0.0013174207,0.0004288809,0.00007012223,0.000273279,0.004262214],"genre_scores_gemma":[0.2083889,0.00021278566,0.78975433,0.0002974651,0.00046076404,0.000018352493,0.00022415692,0.000044385844,0.0005988538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957484,0.000038109127,0.0007224845,0.001990923,0.0010619336,0.00043814752],"domain_scores_gemma":[0.98918337,0.00023540464,0.0012215952,0.008818118,0.0004338252,0.00010767376],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013894079,0.00042054433,0.0005514467,0.00077125494,0.00028553282,0.0004749522,0.012721712,0.0003958036,0.000013003782],"category_scores_gemma":[0.00034027154,0.0004097982,0.000072886716,0.0002886355,0.0010965703,0.0020795094,0.0030690953,0.0006644099,0.000035773304],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006463144,0.000040920706,0.00012293109,0.000061243954,0.000012020664,0.0000093476165,0.00016466095,0.00040422473,0.0034924215,0.05082641,0.00031952895,0.94453984],"study_design_scores_gemma":[0.00031367902,0.0001432935,0.0048445174,0.00062250166,0.000015369773,0.00004393276,1.6345669e-7,0.7607872,0.010992326,0.20975742,0.011606023,0.0008735761],"about_ca_topic_score_codex":0.000026008898,"about_ca_topic_score_gemma":0.000046335947,"teacher_disagreement_score":0.9436663,"about_ca_system_score_codex":0.000255182,"about_ca_system_score_gemma":0.00067474303,"threshold_uncertainty_score":0.9998354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020290723,0.0003152382,0.9709659,0.0010769151,0.0034991943,0.0004491847,0.000011631533,0.00024403655,0.023417601],"genre_scores_gemma":[0.38029146,0.000048033486,0.6152068,0.0027397536,0.0010847495,0.000014510666,0.000046646277,0.00006946026,0.000498597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99521494,0.000045950954,0.000580537,0.00205517,0.0012373851,0.00086600793],"domain_scores_gemma":[0.99557984,0.00024657912,0.0006158888,0.0030168088,0.00030337085,0.00023754055],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00068991416,0.00074925896,0.00067983154,0.00073548267,0.0007586915,0.0016945356,0.006207654,0.0005696078,0.000023412744],"category_scores_gemma":[0.000103793995,0.000635734,0.00019119128,0.00037637862,0.0009235361,0.0009287307,0.0011734096,0.00089894584,0.00008875368],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007864375,0.000021329235,0.00007453258,0.000044919972,0.0000108291215,0.00015296355,0.00044897586,0.061090752,0.000043376436,0.049061242,0.00009668557,0.88894653],"study_design_scores_gemma":[0.00045989858,0.0001821137,0.00031579044,0.00021085193,0.000011726048,0.000056762525,7.489501e-8,0.5544229,0.00044948654,0.43837005,0.004543086,0.0009772343],"about_ca_topic_score_codex":0.000073611416,"about_ca_topic_score_gemma":0.000105098414,"teacher_disagreement_score":0.8879693,"about_ca_system_score_codex":0.00032967216,"about_ca_system_score_gemma":0.0010053067,"threshold_uncertainty_score":0.9996094},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010715561,0.00035273418,0.99337775,0.00045485888,0.0020074833,0.00027701975,4.76961e-7,0.00022496184,0.003197578],"genre_scores_gemma":[0.20093468,0.00007274021,0.7963879,0.0004228363,0.00057493336,0.000009695108,0.000006266611,0.00003221149,0.0015587356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622786,0.000046583616,0.00045827994,0.0017499217,0.00090970524,0.00060764706],"domain_scores_gemma":[0.99700034,0.00022025981,0.00045586252,0.0018643814,0.00030120375,0.00015793747],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006743557,0.0004504144,0.00044356863,0.0005629001,0.0007067021,0.0012984396,0.004146949,0.00030018348,0.000011487227],"category_scores_gemma":[0.00028368365,0.00040682577,0.00016403102,0.00019754739,0.00055204623,0.0013273287,0.0015840116,0.0010882994,0.00004991333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018727076,0.00001089891,0.00023164271,0.00001613911,0.000008436331,0.00007404052,0.0015381782,0.22700757,0.00011827073,0.006547755,0.000003648105,0.76444155],"study_design_scores_gemma":[0.00026210875,0.000049191884,0.00027419275,0.00018694096,0.000005518619,0.000055727007,3.7452247e-7,0.9518801,0.00037212134,0.045934938,0.00048118868,0.00049758994],"about_ca_topic_score_codex":0.000077066405,"about_ca_topic_score_gemma":0.00014986396,"teacher_disagreement_score":0.763944,"about_ca_system_score_codex":0.00019221717,"about_ca_system_score_gemma":0.00021020547,"threshold_uncertainty_score":0.99983835},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015196802,0.0010028353,0.9789442,0.00015156268,0.00043052257,0.00023849835,0.000024470943,0.000011270558,0.003999866],"genre_scores_gemma":[0.9739774,0.00011968963,0.02432418,0.0004509285,0.00025754428,0.0000025103438,0.000058222544,0.000013541285,0.00079597253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856985,0.000014183963,0.00016907677,0.0007335216,0.00022269768,0.00029068027],"domain_scores_gemma":[0.9989769,0.000027274134,0.0001240871,0.00069549016,0.00011533982,0.000060910257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035092846,0.00022112468,0.00027934107,0.00041106628,0.00015721377,0.00012368851,0.001004594,0.00031066968,0.00002364427],"category_scores_gemma":[0.000101818914,0.00021937753,0.00011315585,0.00018340502,0.00040233854,0.00000813458,0.0005909812,0.00027321608,0.000009329097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016865304,0.00015477862,0.20537993,0.00015022207,0.0007045089,0.00038364314,0.00092475663,0.25132102,0.019965012,0.0012450102,0.00008322131,0.51951927],"study_design_scores_gemma":[0.0061071375,0.0024149525,0.19718327,0.0019418438,0.0014138663,0.00015580245,0.000003772007,0.31011215,0.18902612,0.24668609,0.033491928,0.01146306],"about_ca_topic_score_codex":0.000080170634,"about_ca_topic_score_gemma":0.0013281573,"teacher_disagreement_score":0.9587806,"about_ca_system_score_codex":0.00004345329,"about_ca_system_score_gemma":0.00020320519,"threshold_uncertainty_score":0.8945956},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008076859,0.00045814144,0.8563696,0.001830271,0.0017158764,0.00022393597,0.000004300794,0.00015292117,0.13923688],"genre_scores_gemma":[0.08035898,0.00012903562,0.910272,0.002169092,0.0008633276,0.000011020772,0.0000072565363,0.000044336797,0.006144924],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99673295,0.000021609845,0.00038919915,0.0014319632,0.00083317235,0.0005910943],"domain_scores_gemma":[0.9965406,0.00029902658,0.00033955267,0.0024567074,0.0001847905,0.00017933575],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00065209495,0.0004452404,0.00042715555,0.0005550317,0.000728429,0.0013928582,0.0053497725,0.00031812696,0.000058171267],"category_scores_gemma":[0.00014572334,0.0003793299,0.00014685302,0.00018260434,0.00089089375,0.0009527337,0.0017698987,0.0007992663,0.00051745394],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017407059,0.000017733855,0.000050812596,0.000010219129,0.000008060418,0.0001982728,0.00033185378,0.0036460783,0.00002087816,0.06343528,0.00025221545,0.93202686],"study_design_scores_gemma":[0.00021951861,0.00017263611,0.0004716328,0.00025317274,0.000008515601,0.00014788398,5.4999173e-8,0.14239484,0.00024868967,0.83988875,0.015396724,0.0007975584],"about_ca_topic_score_codex":0.00004465989,"about_ca_topic_score_gemma":0.00003731289,"teacher_disagreement_score":0.9312293,"about_ca_system_score_codex":0.00018127925,"about_ca_system_score_gemma":0.0006074772,"threshold_uncertainty_score":0.9998659},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001349383,0.0018579355,0.93369883,0.0005406979,0.0026574356,0.00038109333,0.0000023224231,0.00016418485,0.06056256],"genre_scores_gemma":[0.8397418,0.00017198858,0.15289707,0.0010210462,0.0009518875,0.000021532132,0.0000054246325,0.000064912136,0.0051243156],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955199,0.000057419456,0.0006086551,0.0019922748,0.00083096663,0.0009907922],"domain_scores_gemma":[0.9960862,0.00049043464,0.00052030693,0.0024378016,0.0002329395,0.00023230845],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015564121,0.0006501998,0.0008201763,0.0008863037,0.00043871708,0.0010494259,0.006492929,0.00048707356,0.00002019792],"category_scores_gemma":[0.00042922312,0.00058386015,0.00017627285,0.0002933908,0.00093994185,0.000902278,0.0021227894,0.0012214712,0.00014682692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007535273,0.00003805792,0.0009742989,0.00005477435,0.000009958693,0.00051843846,0.0019501597,0.0017152388,0.00006638908,0.16578937,0.00004839323,0.8288274],"study_design_scores_gemma":[0.0012003601,0.0003081412,0.0030825397,0.0032220439,0.000012173917,0.00040422127,3.4792868e-7,0.35232297,0.0008091181,0.6288601,0.0076796804,0.0020982781],"about_ca_topic_score_codex":0.0000922263,"about_ca_topic_score_gemma":0.0007426376,"teacher_disagreement_score":0.8396069,"about_ca_system_score_codex":0.0005081581,"about_ca_system_score_gemma":0.0008510876,"threshold_uncertainty_score":0.9999876},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008603916,0.0010412815,0.9790093,0.00048390892,0.001875073,0.0004259314,0.0000014944658,0.000049878126,0.016252745],"genre_scores_gemma":[0.86987853,0.000003611863,0.12407448,0.0021768897,0.00072107726,0.000040321043,0.0000017853752,0.00006638887,0.0030369153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726033,0.00056464144,0.00039948136,0.0008721175,0.00039416432,0.0005092643],"domain_scores_gemma":[0.9972161,0.0010904388,0.00038428104,0.0011501,0.00011364993,0.000045422654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005400565,0.00036582028,0.00042019982,0.00035288365,0.00046484178,0.0002287801,0.001402977,0.00029739115,0.00016542312],"category_scores_gemma":[0.00034374066,0.00025836015,0.000064401305,0.00015458494,0.00096523203,0.00008383183,0.00024287758,0.0017049258,0.00005752417],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026581742,0.000028598619,0.00028642503,0.000006777467,0.000021212738,0.000082908446,0.028544227,0.006209371,0.00038069318,0.017834626,0.0000622955,0.9465163],"study_design_scores_gemma":[0.010233659,0.0037210316,0.03206076,0.009054959,0.00013505951,0.0007191614,0.00025903466,0.3831488,0.011586454,0.32486987,0.2134357,0.010775531],"about_ca_topic_score_codex":0.00026010044,"about_ca_topic_score_gemma":0.00006597156,"teacher_disagreement_score":0.93574077,"about_ca_system_score_codex":0.00023390382,"about_ca_system_score_gemma":0.0002481987,"threshold_uncertainty_score":0.9999869},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15105481,0.048624028,0.6205905,0.06895956,0.014643099,0.0161323,0.00027611875,0.0006233403,0.07909622],"genre_scores_gemma":[0.7461766,0.0019224343,0.24276067,0.0010876838,0.00091373286,0.00009293216,0.000009134613,0.00018912737,0.0068476764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646896,0.00005616461,0.00087583595,0.0011316995,0.0006525346,0.00081483176],"domain_scores_gemma":[0.9958111,0.0013871492,0.00065868715,0.0018393705,0.00020608578,0.00009760997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022255068,0.0005128774,0.0009153935,0.00097278325,0.00026258407,0.00021796237,0.0022450876,0.00042975222,0.000026624295],"category_scores_gemma":[0.0012884586,0.00037925612,0.000077003046,0.0005384401,0.00194051,0.0003205737,0.0012607529,0.0009518954,0.000008310375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008472448,0.00043075293,0.00336768,0.0018592194,0.000080192454,0.00031735943,0.013643727,0.00030858704,0.00016729465,0.59431636,0.0014096033,0.3840145],"study_design_scores_gemma":[0.00075210334,0.00021304902,0.0006445659,0.00084990053,0.00001583729,0.00007010055,0.0000045248457,0.002086618,0.00037418894,0.99304104,0.0015102008,0.00043784408],"about_ca_topic_score_codex":0.00021614975,"about_ca_topic_score_gemma":0.0009405558,"teacher_disagreement_score":0.5951218,"about_ca_system_score_codex":0.00014669985,"about_ca_system_score_gemma":0.00038998664,"threshold_uncertainty_score":0.99986595},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000098410615,0.0000952809,0.97097826,0.0015121092,0.0014491744,0.0007767353,0.0000028165355,0.00019436359,0.024892857],"genre_scores_gemma":[0.17457306,0.000027426117,0.81790215,0.0029637516,0.0021328449,0.0002644258,0.00011772764,0.000082062266,0.0019365165],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820787,0.0000034710429,0.0003756416,0.000644077,0.00023959413,0.0005293471],"domain_scores_gemma":[0.9983098,0.00012586465,0.000529768,0.0005351249,0.00049174647,0.000007701236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015550635,0.00030939447,0.00036371656,0.001447009,0.0012722905,0.00025298927,0.0011954589,0.00065465644,0.00001821517],"category_scores_gemma":[0.0005590058,0.00029662118,0.00007316053,0.00032796006,0.0013703341,0.0006579241,0.00066555064,0.0005596499,0.000028367262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007053434,0.000009875028,0.00009496892,0.000072485214,0.000012107362,0.000002399704,0.00017259252,0.000055641005,0.000016664271,0.265999,0.00005267625,0.73350453],"study_design_scores_gemma":[0.00055704085,0.000022335002,0.0004463341,0.0006692121,0.00002708859,0.0000066872885,0.0000067035085,0.03151238,0.0010051328,0.9147885,0.050261863,0.00069676625],"about_ca_topic_score_codex":0.000014866421,"about_ca_topic_score_gemma":0.00004275423,"teacher_disagreement_score":0.73280776,"about_ca_system_score_codex":0.00017735093,"about_ca_system_score_gemma":0.00016602887,"threshold_uncertainty_score":0.9999486},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014976917,0.00058859994,0.9966942,0.00009350747,0.0009586884,0.00036978914,0.000006026653,0.0009868339,0.00015259151],"genre_scores_gemma":[0.028804123,0.000031863652,0.97037935,0.00012510983,0.00030785686,0.00003152319,0.0000037942095,0.000047720143,0.0002686759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970495,0.000018165949,0.00036605785,0.001242874,0.0006952122,0.000628168],"domain_scores_gemma":[0.99790424,0.00022060049,0.00013914477,0.0013990789,0.00014179309,0.00019515115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005838766,0.00050892273,0.00051314564,0.00082157104,0.00010448243,0.00064753834,0.0028189446,0.00047966797,7.6842093e-7],"category_scores_gemma":[0.00003399556,0.00049310306,0.00006590362,0.0005122202,0.00023625171,0.0005623241,0.0015071498,0.0012733104,0.0000046241444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.1839345e-7,0.000009734187,0.00002375491,0.000117406365,0.0000064041296,0.000052113828,0.0005039329,0.8495637,0.0007872957,0.027442778,0.00006949077,0.12142285],"study_design_scores_gemma":[0.00008007743,0.00003863195,0.00002227638,0.00036539824,0.000004147814,0.000087683635,1.8739566e-8,0.99300796,0.00041051314,0.0035848152,0.0018697567,0.00052872516],"about_ca_topic_score_codex":0.000017439479,"about_ca_topic_score_gemma":0.000012763322,"teacher_disagreement_score":0.14344424,"about_ca_system_score_codex":0.00026441325,"about_ca_system_score_gemma":0.00048664786,"threshold_uncertainty_score":0.99975204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018332212,0.000040723095,0.94438785,0.0010261792,0.0021437265,0.0005811575,0.00001863353,0.00043807653,0.049530447],"genre_scores_gemma":[0.6636358,0.000010942371,0.32464924,0.0053568506,0.0003114378,0.000026860676,0.000040238556,0.00009616011,0.005872472],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954303,0.0004053712,0.00080254284,0.0012137205,0.0010415713,0.0011065217],"domain_scores_gemma":[0.992052,0.0012988327,0.00076156965,0.004864742,0.00079751795,0.00022531592],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0040986976,0.0008435214,0.00086227775,0.0012861412,0.0036199447,0.0013389803,0.011167491,0.0006803979,0.00008906586],"category_scores_gemma":[0.000709287,0.0008873147,0.00016469156,0.00035086612,0.0017228667,0.0006710856,0.0061399983,0.0066182106,0.0003708478],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012062766,0.00087578845,0.00073340547,0.0004049344,0.0003208284,0.00075830217,0.05281939,0.0074020536,0.041328445,0.018471269,0.041960374,0.8348046],"study_design_scores_gemma":[0.0025180087,0.007355256,0.0014012168,0.0047344,0.00011836982,0.0014015391,0.00004051013,0.06540848,0.18863934,0.6242773,0.09507111,0.00903448],"about_ca_topic_score_codex":0.000101776764,"about_ca_topic_score_gemma":0.0012151478,"teacher_disagreement_score":0.8257701,"about_ca_system_score_codex":0.0009351334,"about_ca_system_score_gemma":0.00048588807,"threshold_uncertainty_score":0.99969774},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006105492,0.004559714,0.98692304,0.0002773554,0.0045826384,0.0016547512,0.000014032919,0.00007560595,0.001302304],"genre_scores_gemma":[0.7152249,0.0018470425,0.26142928,0.0051396713,0.008763677,0.00064175104,0.0001868765,0.0003664933,0.006400287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596936,0.00023265897,0.0018384111,0.000288285,0.00055871,0.0011125846],"domain_scores_gemma":[0.9961406,0.001657304,0.0011766724,0.00055758515,0.00023346131,0.00023440001],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005280222,0.0002737088,0.00079391064,0.0006648238,0.0004406114,0.000031008156,0.000486304,0.00036987796,0.000008458576],"category_scores_gemma":[0.000298456,0.00024538155,0.000034850458,0.00055165566,0.00019053234,0.00025358214,0.0003031482,0.0013828182,0.000024393064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015229329,0.00010990253,0.015298962,0.061738335,0.00008639496,0.000003456839,0.07896109,0.07665389,0.00005768317,0.020491462,0.0026973747,0.74388623],"study_design_scores_gemma":[0.00087831955,0.00045980437,0.0020213795,0.015081232,0.00002121417,0.00005448268,0.000030558596,0.86235744,0.000008639607,0.0023299216,0.1158363,0.0009207245],"about_ca_topic_score_codex":0.00037005337,"about_ca_topic_score_gemma":0.00015012648,"teacher_disagreement_score":0.78570354,"about_ca_system_score_codex":0.0017206395,"about_ca_system_score_gemma":0.0074020466,"threshold_uncertainty_score":0.9999998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008288764,0.00017748355,0.98257643,0.0027891381,0.0013938826,0.003853247,0.00006449893,0.00047664688,0.00037993168],"genre_scores_gemma":[0.75510335,0.000049296676,0.2406121,0.0015446249,0.0009310187,0.00018294925,0.000015940035,0.00012136731,0.0014393349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99510294,0.00006132759,0.00056848035,0.0019639004,0.0010105664,0.0012927934],"domain_scores_gemma":[0.9964788,0.0007237678,0.00047753775,0.0012462686,0.00072155835,0.00035209485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011635154,0.0006563253,0.00075332087,0.0009041175,0.0010661929,0.00054020976,0.0038511313,0.0008088658,0.0000282188],"category_scores_gemma":[0.0014977108,0.0006287087,0.00017927343,0.00031103793,0.0014028639,0.0005313245,0.0005949789,0.00076600787,0.00003334413],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030996508,0.00024381344,0.0008687499,0.00021701251,0.00005906214,0.00010936304,0.051277615,0.0060539637,0.00011504547,0.0009047953,0.00017117085,0.93966943],"study_design_scores_gemma":[0.032511614,0.0060699205,0.016070645,0.06453982,0.00069550815,0.00028209467,0.00039142114,0.4103008,0.018477218,0.32234758,0.10610124,0.022212148],"about_ca_topic_score_codex":0.00027746512,"about_ca_topic_score_gemma":0.006198286,"teacher_disagreement_score":0.9174573,"about_ca_system_score_codex":0.00039896424,"about_ca_system_score_gemma":0.0010058008,"threshold_uncertainty_score":0.99961644},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041904082,0.00012447828,0.9883612,0.0016739604,0.001339902,0.00021765406,0.0000037681832,0.0000735315,0.0077864653],"genre_scores_gemma":[0.9486041,0.00002804517,0.04063717,0.0012256657,0.001506415,0.000006946763,0.000025697693,0.000040917133,0.0079250345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979552,0.000010718479,0.00026414258,0.00078373175,0.00073034904,0.0002558818],"domain_scores_gemma":[0.9980179,0.00013306993,0.00023043875,0.0013165297,0.00018748002,0.00011455581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050432415,0.0002557267,0.00037340017,0.00059086253,0.00025101544,0.0001973022,0.00057830184,0.0002092896,0.00003073301],"category_scores_gemma":[0.00019644067,0.0002087129,0.00014145505,0.00010680125,0.00039219653,0.00007759424,0.00009103583,0.00053886604,0.0000931427],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024843126,0.000043580912,0.0018481119,0.00008740982,0.000020101981,0.00011151749,0.000089745474,0.010302924,0.00091772154,0.00009597481,0.000048465532,0.9864096],"study_design_scores_gemma":[0.000617884,0.0003680891,0.0042411312,0.00243181,0.00014219004,0.000023168985,1.3137027e-7,0.9697119,0.010191219,0.009113543,0.0025682438,0.0005906751],"about_ca_topic_score_codex":0.000023016408,"about_ca_topic_score_gemma":0.000014100683,"teacher_disagreement_score":0.9858189,"about_ca_system_score_codex":0.00019252187,"about_ca_system_score_gemma":0.00028560497,"threshold_uncertainty_score":0.85110646},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068792776,0.000078894154,0.99056154,0.0040476806,0.0004842716,0.0011382757,0.00003346329,0.0002817508,0.002686176],"genre_scores_gemma":[0.37569892,0.000032611908,0.6160568,0.004965563,0.00049140945,0.00024373647,0.000055335786,0.00013116762,0.00232443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942173,0.00004728581,0.0005995101,0.0026846882,0.0015634687,0.0008877448],"domain_scores_gemma":[0.993542,0.00011822402,0.00054626656,0.004894586,0.00034665398,0.00055226753],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008692823,0.000737388,0.0006702131,0.00068377063,0.0008976004,0.0011501828,0.006358457,0.00033822565,0.000024456662],"category_scores_gemma":[0.000032029362,0.0006524118,0.00012176421,0.00042172006,0.0009312289,0.0010504752,0.0019603327,0.0008175914,0.00008899776],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000593453,0.0005316959,0.0004512248,0.000088182744,0.00008718789,0.0002711737,0.01899617,0.049533777,0.0038257183,0.026397211,0.0007070194,0.8990513],"study_design_scores_gemma":[0.0025821058,0.0035520268,0.005079903,0.0035862876,0.00019667983,0.00050108985,0.0000132577825,0.7886037,0.08905262,0.07057093,0.028459108,0.007802253],"about_ca_topic_score_codex":0.00036327413,"about_ca_topic_score_gemma":0.00044276024,"teacher_disagreement_score":0.89124906,"about_ca_system_score_codex":0.0008147053,"about_ca_system_score_gemma":0.0005532517,"threshold_uncertainty_score":0.9998867},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006055771,0.00009204071,0.99633133,0.0002384184,0.0007434113,0.00097373937,0.0000048634133,0.00020705124,0.001348576],"genre_scores_gemma":[0.3233898,0.000022110145,0.67498654,0.0007507506,0.00038673205,0.000041400508,0.0000032846822,0.00003723235,0.00038216333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948739,0.000049733357,0.0005899863,0.0022449188,0.0015196918,0.0007217965],"domain_scores_gemma":[0.9946983,0.00037259288,0.00050360995,0.0034475736,0.0006320102,0.000345908],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002743389,0.000523761,0.0005037369,0.0015302671,0.00214208,0.0033118222,0.008848454,0.00017307082,0.000011719941],"category_scores_gemma":[0.00025659375,0.0004964282,0.00008843865,0.0010596751,0.0021458608,0.0016503467,0.00363956,0.00059401133,0.000054807064],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021967044,0.00013500126,0.00007749931,0.0000375346,0.00001814433,0.0019836412,0.0026984224,0.02165647,0.0002268403,0.066727005,0.000042794712,0.9063944],"study_design_scores_gemma":[0.00037231584,0.00023641778,0.000017985192,0.00019047825,0.000025322568,0.0013916127,0.0000033315878,0.8175332,0.0008644696,0.17576765,0.002574562,0.0010226654],"about_ca_topic_score_codex":0.000094842035,"about_ca_topic_score_gemma":0.00009425807,"teacher_disagreement_score":0.9053718,"about_ca_system_score_codex":0.0004159829,"about_ca_system_score_gemma":0.0017142484,"threshold_uncertainty_score":0.9997487},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015597052,0.0016025314,0.9894661,0.0022646005,0.0028047448,0.0010713389,0.00006611319,0.000116106174,0.0010488066],"genre_scores_gemma":[0.47170347,0.0012550891,0.5040873,0.009590206,0.009077005,0.00019169856,0.00037083947,0.0002690867,0.0034552414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972761,0.000017998735,0.00045864208,0.0011114603,0.0005933845,0.00054236635],"domain_scores_gemma":[0.9980877,0.00031000315,0.00037180027,0.00082110165,0.0002110604,0.00019834064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078265934,0.0004314553,0.0007459064,0.00053106016,0.00038212325,0.00034147096,0.00080563175,0.00038108643,0.000012389853],"category_scores_gemma":[0.00033968617,0.00034455297,0.0002837803,0.000118667886,0.0010663188,0.00025137857,0.00031083875,0.0011369622,0.0000011947263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017955816,0.00009400477,0.009652635,0.00059012935,0.00014463428,0.00023072577,0.00038217672,0.017205862,0.0018672068,0.0014960519,0.0005616888,0.96759534],"study_design_scores_gemma":[0.001553561,0.0004029993,0.0056034247,0.00214135,0.00017915077,0.00016702063,1.5012318e-7,0.96889764,0.00036425787,0.015338423,0.004825113,0.0005269384],"about_ca_topic_score_codex":0.000024513525,"about_ca_topic_score_gemma":0.000012117836,"teacher_disagreement_score":0.9670684,"about_ca_system_score_codex":0.0002921919,"about_ca_system_score_gemma":0.00047629653,"threshold_uncertainty_score":0.99990064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008164265,0.00016392919,0.98768914,0.002189434,0.00027416542,0.00064646924,0.000014716927,0.00020175925,0.00065614487],"genre_scores_gemma":[0.848866,0.000008510829,0.15031606,0.0005569688,0.000118236574,0.000020673155,0.00004486311,0.000033084543,0.0000356156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611646,0.00008640232,0.0006587908,0.0015872997,0.0010138758,0.0005371707],"domain_scores_gemma":[0.99640435,0.0006311858,0.00088764605,0.001435637,0.00038593655,0.00025522272],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013889158,0.00060447934,0.00052189454,0.0005494331,0.0007747957,0.0016657464,0.0018994856,0.00032312635,0.0000049599334],"category_scores_gemma":[0.00020940017,0.00053690816,0.000064285836,0.00036357512,0.001449531,0.0015340368,0.0003572029,0.00083441345,0.000010745052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003363881,0.000036470643,0.00011777452,0.0001225478,0.000015838776,0.000010530711,0.0019033832,0.2303117,0.0020650078,0.006267313,0.000008023891,0.75910777],"study_design_scores_gemma":[0.0005559153,0.000768165,0.0003306241,0.0019449679,0.00002040881,0.000026577944,0.0000023640507,0.96901894,0.007939403,0.018456364,0.00023878607,0.00069747964],"about_ca_topic_score_codex":0.00018087577,"about_ca_topic_score_gemma":0.0008510302,"teacher_disagreement_score":0.8407017,"about_ca_system_score_codex":0.00029692324,"about_ca_system_score_gemma":0.0008476114,"threshold_uncertainty_score":0.99970824},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02443519,0.00007198048,0.9737032,0.0007043759,0.0003233888,0.0005880933,0.000006076563,0.000012318954,0.00015534791],"genre_scores_gemma":[0.99693775,0.00001849102,0.0022746567,0.0006212008,0.00008712065,0.00001591232,0.0000027748968,0.000011609566,0.000030491396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889743,0.000030087185,0.0002385643,0.00021556167,0.00047090946,0.00014741515],"domain_scores_gemma":[0.99903625,0.00022046558,0.000090742105,0.00055922964,0.00006668397,0.000026627364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005295646,0.000143883,0.000151643,0.0001474603,0.00007475953,0.0001256509,0.0007887429,0.00007872463,0.000010503575],"category_scores_gemma":[0.00013584708,0.00008404674,0.00003221105,0.00015769,0.00024040071,0.00010268327,0.00015905847,0.0002776424,0.000014766728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072881435,0.000006506266,0.000016765733,0.000015732572,0.000004769997,0.0000014769205,0.00473434,0.6676485,0.0006021768,0.00021761384,0.000010392223,0.32673442],"study_design_scores_gemma":[0.0009163335,0.0011147523,0.04852133,0.0022841766,0.00009386223,0.000048972204,0.00002697575,0.8790831,0.014724155,0.03399906,0.017831696,0.0013555645],"about_ca_topic_score_codex":0.00011069594,"about_ca_topic_score_gemma":0.00034499477,"teacher_disagreement_score":0.9725025,"about_ca_system_score_codex":0.000087946326,"about_ca_system_score_gemma":0.000048989143,"threshold_uncertainty_score":0.34273267},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010707293,0.0001298467,0.99370354,0.000801001,0.0016600795,0.00024026865,0.0000073497617,0.00010509653,0.0033421284],"genre_scores_gemma":[0.27605838,0.00021884919,0.714269,0.0026636184,0.0006254643,0.000016722128,0.00001899924,0.00007572576,0.0060532717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971416,0.00005352845,0.0004957389,0.0011804191,0.00060082244,0.0005279096],"domain_scores_gemma":[0.99693906,0.0006501673,0.00035474132,0.0017209618,0.00018266322,0.00015242216],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008944304,0.000402637,0.0004321678,0.0011786507,0.0002582045,0.001288115,0.004444776,0.00016577113,0.000044522392],"category_scores_gemma":[0.00051221135,0.00038034673,0.00009014668,0.00034146235,0.00045145056,0.0013116077,0.0015694164,0.0006697094,0.000115343486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093331355,0.000095831,0.000112886366,0.000037557114,0.000019289699,0.00029999015,0.0011886555,0.21793033,0.0001476936,0.0197762,0.0005497594,0.75983244],"study_design_scores_gemma":[0.0001995149,0.00007811549,0.0000664807,0.000808982,0.0000048038605,0.000060261533,2.0157493e-7,0.9526285,0.0008893273,0.039039403,0.005743962,0.00048048442],"about_ca_topic_score_codex":0.00003880349,"about_ca_topic_score_gemma":0.0003888747,"teacher_disagreement_score":0.75935197,"about_ca_system_score_codex":0.00028804122,"about_ca_system_score_gemma":0.000555933,"threshold_uncertainty_score":0.9998648},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023489005,0.0012685172,0.9581762,0.02847923,0.0046005533,0.0014046687,0.00039129626,0.00006873624,0.003261922],"genre_scores_gemma":[0.9422688,0.00062713376,0.029854761,0.012739505,0.0014311398,0.000046954097,0.0010195215,0.000107111526,0.011905103],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9975052,0.000059588696,0.00060448283,0.0010123805,0.00039581288,0.00042254993],"domain_scores_gemma":[0.9979525,0.00044162752,0.00053738005,0.0006884721,0.00022174706,0.00015824952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009896354,0.000296733,0.000386354,0.0003723477,0.00041636612,0.00021920043,0.00072784815,0.00023546633,0.00015082807],"category_scores_gemma":[0.00025000185,0.00026036645,0.000035269706,0.00016714947,0.00042841304,0.00018874336,0.00025189252,0.00048194904,0.00001948725],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012431253,0.00012549972,0.044144686,0.00007773665,0.000034637655,0.00000826639,0.013576935,0.00064562686,0.00026541756,0.03342559,0.00051846716,0.9070528],"study_design_scores_gemma":[0.00403845,0.0007782944,0.771744,0.002176518,0.00004875298,0.00017920084,0.00009176214,0.012509673,0.0009309457,0.09759319,0.10624872,0.0036604528],"about_ca_topic_score_codex":0.00077535765,"about_ca_topic_score_gemma":0.0023845208,"teacher_disagreement_score":0.9399199,"about_ca_system_score_codex":0.0004460083,"about_ca_system_score_gemma":0.0009632152,"threshold_uncertainty_score":0.99998486},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01677021,0.0013502252,0.9674517,0.003568692,0.0036367562,0.0007724587,0.00003900879,0.0002520848,0.0061588776],"genre_scores_gemma":[0.9577879,0.00015851443,0.030037617,0.005120862,0.000322975,0.000023771467,0.0000049295318,0.000047061378,0.006496399],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953842,0.00003506318,0.0006610621,0.0017188538,0.0016822917,0.0005185322],"domain_scores_gemma":[0.99624366,0.0006045572,0.00050318916,0.0020546473,0.00033966254,0.00025430825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022245676,0.00043683933,0.00063395855,0.0011833496,0.0006054575,0.0009874701,0.0032068987,0.00063662993,0.00021687346],"category_scores_gemma":[0.00082419626,0.00034355157,0.00013041704,0.00022318421,0.002413053,0.00046201772,0.001679151,0.0010549694,0.000090001886],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014327621,0.000037038015,0.012599509,0.000010541429,0.000010347907,0.00016512662,0.0009980175,0.0012716146,0.00016689576,0.0054337666,0.0008411235,0.97845167],"study_design_scores_gemma":[0.0014708536,0.000942423,0.011555616,0.0007807877,0.000065478605,0.00055464415,0.00001178279,0.057711843,0.0013832792,0.4183674,0.5044416,0.0027142854],"about_ca_topic_score_codex":0.00000986701,"about_ca_topic_score_gemma":0.000091377486,"teacher_disagreement_score":0.9757374,"about_ca_system_score_codex":0.00011548078,"about_ca_system_score_gemma":0.000312063,"threshold_uncertainty_score":0.99990165},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004272368,0.0002474182,0.9883172,0.0014798002,0.0036818583,0.0010822109,0.000002821938,0.00023285489,0.0006834998],"genre_scores_gemma":[0.6682856,0.00032413044,0.32840532,0.0010421393,0.00040281776,0.00016076083,0.000004870221,0.00006490346,0.0013094501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948659,0.0001554505,0.0007933211,0.002393858,0.00091718114,0.00087432313],"domain_scores_gemma":[0.9949042,0.00093813817,0.00066284323,0.00285551,0.00051666703,0.00012259823],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011733451,0.0007360353,0.00084158743,0.001343267,0.00048110212,0.0015798872,0.006124248,0.0008003437,0.000067825364],"category_scores_gemma":[0.00040758518,0.0006130106,0.00014257096,0.00042841904,0.0033008207,0.0032273654,0.002180661,0.002122799,0.000087895394],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007572183,0.00020738132,0.0001496008,0.000047490663,0.000019651176,0.00063086546,0.005355403,0.010396786,0.0036744454,0.010263928,0.00007501261,0.9691037],"study_design_scores_gemma":[0.0012989885,0.0017392194,0.001399009,0.0032487346,0.000015767973,0.0004733484,0.000010585795,0.6885587,0.01278342,0.28207672,0.0061460393,0.002249489],"about_ca_topic_score_codex":0.000008039651,"about_ca_topic_score_gemma":0.00026139827,"teacher_disagreement_score":0.9668542,"about_ca_system_score_codex":0.0008677985,"about_ca_system_score_gemma":0.0010148862,"threshold_uncertainty_score":0.9996321},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044474593,0.0005354386,0.99180186,0.0039253505,0.0019734455,0.00036567342,0.00003664207,0.00007181273,0.0012452856],"genre_scores_gemma":[0.59481156,0.0009664945,0.39542085,0.004863703,0.0019256589,0.000018773851,0.000033924764,0.00010943098,0.0018496277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936984,0.00012047006,0.0007840184,0.001788656,0.0030456109,0.00056280947],"domain_scores_gemma":[0.9891703,0.0025189542,0.00096031424,0.0067343726,0.00046204246,0.00015398144],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0026948163,0.00048485567,0.0007808705,0.00031313978,0.00044966635,0.0013626282,0.017349994,0.00043248176,0.000042168336],"category_scores_gemma":[0.0015072619,0.00035455966,0.00013683693,0.00033450796,0.0018693353,0.0020753166,0.0074361945,0.0011339871,0.00004280245],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053942044,0.000042568063,0.000060088714,0.000064351494,0.000056340763,0.00010157359,0.0011443417,0.0017028162,0.00004049561,0.008608498,0.00047421645,0.98769933],"study_design_scores_gemma":[0.00023918426,0.00009964099,0.00006687154,0.0019564752,0.000028356673,0.00020266845,5.0938297e-7,0.8947369,0.0010100346,0.03773663,0.063209936,0.0007128159],"about_ca_topic_score_codex":0.00039622094,"about_ca_topic_score_gemma":0.0013913774,"teacher_disagreement_score":0.9869865,"about_ca_system_score_codex":0.00012064941,"about_ca_system_score_gemma":0.0013169657,"threshold_uncertainty_score":0.9998906},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062748934,0.00020653565,0.9805052,0.009991713,0.0014047663,0.00060760457,0.00001303503,0.00012585003,0.0008703563],"genre_scores_gemma":[0.9378173,0.000015716621,0.055674333,0.004421539,0.00027981555,0.000017386894,0.0000014721085,0.000038784554,0.0017336933],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995454,0.000056673558,0.00054786087,0.0014588977,0.0018961577,0.0005863903],"domain_scores_gemma":[0.99557334,0.0005619019,0.0005588322,0.0024831714,0.0004852928,0.00033745874],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0030509452,0.00039889937,0.000472435,0.00094604393,0.0014112011,0.0011240653,0.0043144044,0.0004043761,0.000088653826],"category_scores_gemma":[0.0014445,0.00023591713,0.000103201855,0.00041380082,0.0012333789,0.00046231694,0.0009556405,0.0011897752,0.00010370941],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033934575,0.0000064974306,0.0054023163,0.000008588894,0.0000051004454,0.00005448046,0.0013117415,0.006152156,0.00007901248,0.004469442,0.00008037598,0.98239636],"study_design_scores_gemma":[0.003412648,0.003546179,0.06328234,0.0054284856,0.00016237433,0.0012027826,0.00019892977,0.18056445,0.0026828372,0.6323032,0.10016593,0.0070498735],"about_ca_topic_score_codex":0.00012894585,"about_ca_topic_score_gemma":0.0013831222,"teacher_disagreement_score":0.9753465,"about_ca_system_score_codex":0.000265224,"about_ca_system_score_gemma":0.0009414893,"threshold_uncertainty_score":0.99991286},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017057423,0.00014208963,0.9777915,0.00064279477,0.0016462869,0.0006332864,0.0000012164734,0.00008146765,0.0020039543],"genre_scores_gemma":[0.9713424,0.000030008201,0.028091874,0.00023644895,0.00017857319,0.000027072734,0.0000051645557,0.000011591304,0.00007686589],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968268,0.00012940048,0.0005380483,0.0010078335,0.0011187932,0.00037908833],"domain_scores_gemma":[0.9964632,0.00029796953,0.0006473118,0.0017101911,0.00085609645,0.000025240108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003055912,0.00031297142,0.0003508158,0.0006353315,0.000418904,0.00033775848,0.0036602786,0.0003886118,0.000009623528],"category_scores_gemma":[0.0007032216,0.00022677718,0.00007075611,0.00028166617,0.0012698916,0.0010233654,0.00073565426,0.0009376503,0.000025851812],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016169592,0.00003834259,0.00005324349,0.0000072172725,0.0000072235594,0.000010248081,0.0004321841,0.0054988787,0.0027907314,0.13846569,0.000008095283,0.852672],"study_design_scores_gemma":[0.00025649447,0.00043435866,0.0044297227,0.00023867386,0.00000549507,0.00003062145,6.4890247e-7,0.32878548,0.0050466442,0.66010576,0.00033568786,0.00033040266],"about_ca_topic_score_codex":0.000028485336,"about_ca_topic_score_gemma":0.00026385582,"teacher_disagreement_score":0.95428497,"about_ca_system_score_codex":0.00039476715,"about_ca_system_score_gemma":0.0005088135,"threshold_uncertainty_score":0.9247705},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068079582,0.0012861011,0.9611039,0.006473758,0.003484942,0.0022057951,0.00033431037,0.00034823015,0.017955016],"genre_scores_gemma":[0.9719295,0.00007825289,0.02512,0.00019035954,0.0008284796,0.000020320127,0.000019865629,0.00003859269,0.001774612],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730897,0.000011205578,0.00036785443,0.00089719536,0.00084965903,0.00056513574],"domain_scores_gemma":[0.9976997,0.00054953777,0.00045645187,0.0006852414,0.000501564,0.00010753294],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00057411735,0.00031050213,0.00045052276,0.00043921077,0.00062148,0.00024091433,0.0021480266,0.0006212439,0.00003406235],"category_scores_gemma":[0.0006587739,0.00030426815,0.00018077987,0.00010134151,0.0037449598,0.0005077978,0.0004018604,0.00040597585,0.000013428337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013916541,0.000038653856,0.0005553886,0.000056025507,0.000015620955,0.0000035990731,0.005656165,0.00042551197,0.0000022043432,0.0362777,0.00009054186,0.95686466],"study_design_scores_gemma":[0.0026642454,0.0004893495,0.01141717,0.004828654,0.00006328233,0.000024269804,0.000024356741,0.0068262825,0.0010654767,0.95226246,0.018192822,0.0021415995],"about_ca_topic_score_codex":0.00006194926,"about_ca_topic_score_gemma":0.0008439056,"teacher_disagreement_score":0.96512157,"about_ca_system_score_codex":0.00018847294,"about_ca_system_score_gemma":0.0007541433,"threshold_uncertainty_score":0.99994093},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048067464,0.000020068364,0.99307764,0.00055238034,0.0046581477,0.0008669359,0.000016206246,0.00006470705,0.00069587084],"genre_scores_gemma":[0.76751477,0.0000041428266,0.22907157,0.00038168742,0.0015021985,0.000116822295,0.000012126314,0.000047145666,0.0013495164],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966459,0.00006944234,0.00057102257,0.0011499574,0.0012336606,0.00033000196],"domain_scores_gemma":[0.99487674,0.0023238997,0.0007416665,0.0012775756,0.0006638451,0.00011624544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0046420926,0.00031170557,0.0004021099,0.00056518894,0.0010422755,0.00075905677,0.0020387708,0.0003233312,0.000073877905],"category_scores_gemma":[0.0011308924,0.00027179913,0.00015801142,0.00018566228,0.00063457503,0.00049948815,0.00020890914,0.0003377491,0.000056925095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005663411,0.00004531501,0.0000040365185,0.000010808468,0.0000054250995,0.000004764602,0.00018222979,0.048924692,0.00049617054,0.17390545,0.00005339574,0.7763111],"study_design_scores_gemma":[0.0002555808,0.00009734368,0.000013455932,0.00005085442,0.000010739489,0.0000067112433,2.7150864e-7,0.3464325,0.005332219,0.6460418,0.0015524796,0.00020604071],"about_ca_topic_score_codex":0.0000028726522,"about_ca_topic_score_gemma":0.000010610313,"teacher_disagreement_score":0.77610505,"about_ca_system_score_codex":0.00018041037,"about_ca_system_score_gemma":0.00048927503,"threshold_uncertainty_score":0.9999734},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013924893,0.00027430462,0.9803829,0.0010809047,0.0023295244,0.0008894561,0.00002291778,0.000315158,0.0007799126],"genre_scores_gemma":[0.87696165,0.00001802901,0.12094296,0.00088552403,0.0010868136,0.0000054572392,0.000010405479,0.00004269473,0.000046491263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942339,0.00013122085,0.0006689835,0.0027802477,0.0012772332,0.0009083836],"domain_scores_gemma":[0.99394155,0.00055258453,0.0004677806,0.0043123076,0.00027524485,0.00045053771],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002005866,0.0007104821,0.000800435,0.0006589796,0.0013046765,0.0021732238,0.0073690726,0.00037874223,0.000008520062],"category_scores_gemma":[0.0003182661,0.0006975761,0.00010592561,0.00030589724,0.0013656687,0.0013623659,0.007961817,0.0015261489,0.000027815096],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003342236,0.001253737,0.012699047,0.0001462413,0.000100239966,0.0011723827,0.07271851,0.0031693568,0.000035764075,0.03541057,0.00035639227,0.87290436],"study_design_scores_gemma":[0.0007564298,0.0009967114,0.0042641596,0.0002828136,0.000027682285,0.0002678993,0.000002613641,0.77868295,0.000044207256,0.20990571,0.0033930552,0.0013757645],"about_ca_topic_score_codex":0.000112247144,"about_ca_topic_score_gemma":0.00082938967,"teacher_disagreement_score":0.87152857,"about_ca_system_score_codex":0.0002839128,"about_ca_system_score_gemma":0.00063294906,"threshold_uncertainty_score":0.99999547},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022887432,0.00050942134,0.99396396,0.00040835355,0.001436847,0.00018687267,0.0000029719804,0.000050120252,0.0011527122],"genre_scores_gemma":[0.71964324,0.000029549059,0.2787977,0.00059359835,0.0004194002,0.0000036287454,0.0000026176751,0.000018178403,0.0004921466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974801,0.000034473665,0.00047677592,0.00075984176,0.000912666,0.0003361731],"domain_scores_gemma":[0.99808055,0.00033963358,0.0003591689,0.000897453,0.00025262326,0.000070587324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047806447,0.00027935402,0.00029690049,0.00046764163,0.0005211863,0.0003552985,0.0021373592,0.00014524288,0.000008040582],"category_scores_gemma":[0.000100343495,0.00021400405,0.00014520135,0.00089775654,0.0008315766,0.00041220244,0.0010046046,0.0004362887,0.0000076030583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027420176,0.00001913152,0.0000880821,0.000020265581,0.0000082401,0.000013997769,0.0015214595,0.33909118,0.00061856606,0.010021908,0.000037155343,0.6485573],"study_design_scores_gemma":[0.0002606795,0.000094137686,0.0009906325,0.00046238687,0.0000072418684,0.00014205427,1.1397809e-7,0.9299129,0.01400388,0.047786206,0.0058439164,0.0004958314],"about_ca_topic_score_codex":0.000011851857,"about_ca_topic_score_gemma":0.000028533721,"teacher_disagreement_score":0.7173545,"about_ca_system_score_codex":0.00011600338,"about_ca_system_score_gemma":0.0008774875,"threshold_uncertainty_score":0.87268317},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20424646,0.00092469266,0.78880876,0.00090583996,0.0008832281,0.0035201358,0.000098695746,0.000035947753,0.0005762295],"genre_scores_gemma":[0.98108464,0.00025150666,0.014465385,0.0035098114,0.00025281872,0.00003615427,0.000085433625,0.000022471673,0.00029176695],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.997418,0.000031752843,0.0009963174,0.00058600184,0.00071330165,0.00025465086],"domain_scores_gemma":[0.99665207,0.0003998447,0.0016075835,0.0006794732,0.0005057502,0.0001552948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009409699,0.0002697175,0.0011771745,0.0012882925,0.00008785333,0.000023185681,0.00034622086,0.00012929339,0.00008017146],"category_scores_gemma":[0.00064845465,0.00020789394,0.00016516987,0.0004660416,0.0002686075,0.00009144762,0.00009143551,0.00028125913,0.0000068240647],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021313496,0.000112278714,0.028925922,0.0007253751,0.00033753106,0.000030928964,0.0040481635,0.012584044,0.0011032028,0.0005178756,0.000105473875,0.9512961],"study_design_scores_gemma":[0.014884454,0.022308424,0.61148363,0.041171785,0.010414312,0.00008466226,0.00020760746,0.08139089,0.025282005,0.0020584194,0.1868102,0.0039035995],"about_ca_topic_score_codex":0.000120192926,"about_ca_topic_score_gemma":0.00051078195,"teacher_disagreement_score":0.94739246,"about_ca_system_score_codex":0.00014769718,"about_ca_system_score_gemma":0.00018986555,"threshold_uncertainty_score":0.8477669},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074580185,0.00021745553,0.9138095,0.0007359975,0.001387544,0.0006959681,0.000014548061,0.000041873183,0.008516942],"genre_scores_gemma":[0.9760504,0.00002278078,0.02261482,0.00053887465,0.00029208692,0.000016875834,0.000036937196,0.00002317829,0.00040404088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998441,0.00003205486,0.00016548738,0.00069186056,0.00044467818,0.00022496196],"domain_scores_gemma":[0.9989087,0.00008022448,0.00019150742,0.0005729804,0.00016760423,0.00007897145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056980184,0.00021153006,0.0001839195,0.000273525,0.00029115303,0.00021008922,0.00038126128,0.0001793734,0.00011883467],"category_scores_gemma":[0.00001926215,0.00017472525,0.000022856948,0.00005624249,0.00058017287,0.00030809728,0.00007681111,0.0003391754,0.000016039457],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003765656,0.000032297183,0.0046093795,0.000012429585,0.000018694482,0.000015196004,0.007078271,0.006076729,0.0000074002755,0.0023133168,0.000010348363,0.9797883],"study_design_scores_gemma":[0.0011715612,0.0014068807,0.113586344,0.0003530583,0.0000849265,0.0001924087,0.000013317449,0.8170427,0.0000130983,0.06459251,0.00070140715,0.00084175763],"about_ca_topic_score_codex":0.000043528904,"about_ca_topic_score_gemma":0.0003779229,"teacher_disagreement_score":0.9789465,"about_ca_system_score_codex":0.00013641483,"about_ca_system_score_gemma":0.00018057195,"threshold_uncertainty_score":0.7125089},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019310519,0.00045985423,0.9962117,0.00052535353,0.0006829454,0.0017432009,0.000115768395,0.000097181255,0.0001446505],"genre_scores_gemma":[0.020802613,0.000105907035,0.97850204,0.00021866534,0.00015989484,0.00003988331,0.00008956696,0.000025226771,0.000056183588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958143,0.0001417884,0.00073280436,0.002265695,0.0005832503,0.0004621215],"domain_scores_gemma":[0.9912723,0.0020916897,0.0012159045,0.0045972886,0.00075304025,0.000069778886],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019725147,0.00055017864,0.00090170326,0.0007476879,0.0005012822,0.0009866373,0.0098693315,0.00030523748,0.0000069542884],"category_scores_gemma":[0.0005258624,0.0005141864,0.000048860795,0.00028729258,0.0013249208,0.008733061,0.005685973,0.0006198318,0.000005103238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017756641,0.00013486714,0.000011017173,0.00022029674,0.00024429828,0.00005440234,0.003160084,0.028682733,0.0021443805,0.18236837,0.0008684866,0.7819335],"study_design_scores_gemma":[0.00053648086,0.0004725273,0.000024768266,0.0010826517,0.00003190841,0.000042845317,0.0000016782265,0.89344984,0.0065187486,0.095172256,0.0021437183,0.00052255305],"about_ca_topic_score_codex":0.000014111696,"about_ca_topic_score_gemma":0.00003622726,"teacher_disagreement_score":0.86476713,"about_ca_system_score_codex":0.00021184141,"about_ca_system_score_gemma":0.00064200803,"threshold_uncertainty_score":0.99973094},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31855872,0.0005933196,0.6784507,0.0003718514,0.0006906482,0.00113327,0.0001274646,0.000030792333,0.00004322624],"genre_scores_gemma":[0.99298483,0.00002744011,0.0065121083,0.00016318346,0.00020535338,0.00001207759,0.000045231205,0.000021844928,0.000027957081],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99852,0.000016852497,0.00029063207,0.0006002965,0.0003672944,0.00020489944],"domain_scores_gemma":[0.9982668,0.00043461402,0.00030480998,0.00076983735,0.00014925915,0.00007467157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031959632,0.00024308052,0.0006221168,0.00038490558,0.00027062657,0.00016917256,0.00026287054,0.00012419262,0.0000160071],"category_scores_gemma":[0.00016707627,0.00017344819,0.00070230645,0.000111860376,0.0002463022,0.000119141456,0.00020536767,0.00018453,9.374151e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008677806,0.00004540126,0.046723288,0.00016783664,0.0018834696,0.000007006746,0.0005652799,0.0020175916,0.0007157306,0.000028232096,0.000004835618,0.94775456],"study_design_scores_gemma":[0.0015133864,0.00039201966,0.6123714,0.0013815208,0.008244386,0.000015193097,0.0000016285294,0.3644979,0.0021988263,0.00903355,0.000025067018,0.0003251499],"about_ca_topic_score_codex":0.00072302466,"about_ca_topic_score_gemma":0.000110451365,"teacher_disagreement_score":0.9474294,"about_ca_system_score_codex":0.00013815965,"about_ca_system_score_gemma":0.00006752143,"threshold_uncertainty_score":0.7073012},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026459342,0.00089312246,0.9913198,0.001450796,0.0017034225,0.000525425,0.000004754118,0.0001557596,0.0013010314],"genre_scores_gemma":[0.66375864,0.000028413082,0.33556157,0.00034815253,0.000110751615,0.000006025588,0.000002133681,0.00002436605,0.00015996753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660414,0.00005887957,0.0006217653,0.0012701444,0.0007561507,0.0006889003],"domain_scores_gemma":[0.9958973,0.00037721524,0.00082851725,0.002215606,0.0005828319,0.0000985301],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007355993,0.0005374255,0.00094606285,0.0021427074,0.0003736408,0.00028785135,0.0044451426,0.00045316547,0.000010330462],"category_scores_gemma":[0.00034077934,0.00045791638,0.0001304077,0.00062975695,0.0021994906,0.00043952817,0.0015969496,0.00067474874,0.000012910386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038043978,0.00012906575,0.0010802489,0.00025884266,0.000048559883,0.0006652138,0.0015783125,0.042876184,0.0030931013,0.040733762,0.00004023853,0.9094584],"study_design_scores_gemma":[0.00064034783,0.0006083395,0.00020517218,0.00096440414,0.00003444751,0.00019212898,0.000002839173,0.8539655,0.02576566,0.11566387,0.0010600212,0.0008972244],"about_ca_topic_score_codex":0.0000662064,"about_ca_topic_score_gemma":0.00012990157,"teacher_disagreement_score":0.9085612,"about_ca_system_score_codex":0.00022868362,"about_ca_system_score_gemma":0.0015430965,"threshold_uncertainty_score":0.9997873},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045031037,0.000049462138,0.934483,0.0002881832,0.0027764528,0.0006593417,0.000047817335,0.000029270715,0.01663547],"genre_scores_gemma":[0.99711204,0.000002704504,0.000843179,0.00049996,0.0009893813,0.000010294065,0.000007153429,0.000025449672,0.0005098209],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997981,0.00012650211,0.0003515312,0.00075586996,0.00041982505,0.00036524827],"domain_scores_gemma":[0.9972313,0.000812991,0.00037107052,0.0011906296,0.00032150114,0.00007248684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010622168,0.00035569875,0.00037677653,0.00032957472,0.00062206737,0.00024154865,0.0012366688,0.00020535917,0.00019672977],"category_scores_gemma":[0.00007789909,0.00019925009,0.00018958833,0.00013166448,0.001070502,0.000111889414,0.0004372756,0.0007643864,0.000041379288],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110930814,0.000103397724,0.00007762192,0.000010706032,0.00011792126,0.000022641148,0.0025636384,0.015185229,0.0012085589,0.00370663,0.00032844598,0.9765643],"study_design_scores_gemma":[0.008567399,0.06061781,0.17342031,0.015484987,0.001373022,0.0014282162,0.00014742567,0.16462731,0.02738055,0.5278404,0.009425065,0.009687498],"about_ca_topic_score_codex":0.00033915485,"about_ca_topic_score_gemma":0.00020687278,"teacher_disagreement_score":0.9668768,"about_ca_system_score_codex":0.0001557128,"about_ca_system_score_gemma":0.00019106809,"threshold_uncertainty_score":0.8125183},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14524606,0.0064075952,0.8336494,0.0043762247,0.0019224038,0.0042051156,0.000019254921,0.00010203832,0.0040719155],"genre_scores_gemma":[0.98766357,0.000045300865,0.011798116,0.00015132295,0.00019498188,0.00005063205,0.0000017312848,0.0000079291585,0.000086409775],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771154,0.0000712791,0.0003852793,0.00087704934,0.0005337675,0.0004211037],"domain_scores_gemma":[0.9977455,0.00088495004,0.00035315947,0.0007554267,0.00020686601,0.000054066033],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0028138808,0.00024852896,0.0004354023,0.0003288798,0.00063094305,0.00024650994,0.002849472,0.00072155526,0.0000155469],"category_scores_gemma":[0.00053229247,0.00017118151,0.00006378434,0.00027662795,0.005542835,0.00036631306,0.00016573031,0.00075167476,2.5922546e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000211235,0.0002922099,0.20302284,0.00037770093,0.000033866072,0.00006405651,0.29769617,0.0003872764,0.00025329588,0.021514185,0.00010138383,0.4760458],"study_design_scores_gemma":[0.00074553816,0.0003855929,0.02341824,0.0007431025,0.000038504713,0.0000029151831,0.00040435698,0.0064502712,0.0015314906,0.9630919,0.0021977022,0.0009903988],"about_ca_topic_score_codex":0.0001382749,"about_ca_topic_score_gemma":0.0015806846,"teacher_disagreement_score":0.9415777,"about_ca_system_score_codex":0.000077966106,"about_ca_system_score_gemma":0.00060774526,"threshold_uncertainty_score":0.99716353},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019208437,0.0011227318,0.9915703,0.001291389,0.0026691516,0.00091580156,0.00003618875,0.0002730322,0.0021021834],"genre_scores_gemma":[0.010021832,0.00003831557,0.98705035,0.000712129,0.0012485967,0.00003298413,0.00003470039,0.000058876543,0.0008022029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99445915,0.000033033535,0.00079881103,0.0023182814,0.0013350133,0.0010557098],"domain_scores_gemma":[0.99599195,0.0006832191,0.00048259177,0.0021474573,0.00038687733,0.00030791177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093574607,0.0007804579,0.00089457823,0.00083636516,0.0004947048,0.0008001233,0.0047992175,0.0004391881,0.0000254204],"category_scores_gemma":[0.00009521379,0.00068318786,0.0002394441,0.0006217117,0.0005384542,0.00051363197,0.0021486497,0.00080413563,0.000062310675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010344405,0.0000804505,0.0000064817814,0.00002844973,0.00001045757,0.000017854745,0.00037601741,0.09288334,0.00006860195,0.013322502,0.00029905827,0.8928964],"study_design_scores_gemma":[0.0006157208,0.0002481092,0.000042376738,0.0002934521,0.000011498125,0.00003384482,2.4744443e-7,0.94610775,0.0010893872,0.019368585,0.031373806,0.0008152407],"about_ca_topic_score_codex":0.000026008907,"about_ca_topic_score_gemma":0.00007483354,"teacher_disagreement_score":0.8920812,"about_ca_system_score_codex":0.00039524765,"about_ca_system_score_gemma":0.00057660334,"threshold_uncertainty_score":0.9995619},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025314334,0.00017799059,0.99624693,0.00023867219,0.0019231413,0.00040995522,0.0000038101468,0.000032853422,0.00071349967],"genre_scores_gemma":[0.13020417,0.000050232928,0.86825806,0.00040180798,0.00070949557,0.000051681072,0.000007541366,0.00003476525,0.00028222034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783194,0.000035681187,0.00028844582,0.0011088807,0.0003030109,0.000432046],"domain_scores_gemma":[0.9983018,0.00049428956,0.00031262756,0.0004337949,0.00037029944,0.00008715686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087473897,0.00034560208,0.00035421018,0.00041786494,0.0006980624,0.0008216059,0.0012443272,0.00019246143,0.0000039161528],"category_scores_gemma":[0.00019539717,0.00033820537,0.000108854205,0.000110987276,0.00028055665,0.0019779082,0.0004703656,0.00049717224,0.000005102738],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009336111,0.0000067506307,0.000024664403,0.000035115627,0.000010866188,0.0000041524927,0.0011779749,0.000933905,0.00969141,0.0075427983,0.000006126116,0.9805569],"study_design_scores_gemma":[0.00055833056,0.00043756122,0.0011560306,0.0008634871,0.000026121535,0.00011345256,0.000001235894,0.71378416,0.108943954,0.16398627,0.009060558,0.0010688211],"about_ca_topic_score_codex":0.000016964546,"about_ca_topic_score_gemma":0.000011236444,"teacher_disagreement_score":0.9794881,"about_ca_system_score_codex":0.00020241669,"about_ca_system_score_gemma":0.00018665462,"threshold_uncertainty_score":0.999907},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073502207,0.0008260209,0.9957613,0.00034455617,0.00095215056,0.00028382277,0.000003820432,0.00012464395,0.00096868176],"genre_scores_gemma":[0.3856225,0.000023385355,0.61364245,0.00012360822,0.00024023025,0.000004590519,0.0000016781029,0.000026809787,0.0003147406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968201,0.00009356074,0.00041538893,0.0012979277,0.0008555938,0.0005174376],"domain_scores_gemma":[0.9966199,0.0009926702,0.00063104887,0.0013749682,0.0002493249,0.00013211294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021356223,0.0004291612,0.0006011533,0.00044219513,0.0004949238,0.00059392233,0.002458893,0.0002489365,0.0000035238404],"category_scores_gemma":[0.00089438976,0.00039297418,0.000101865495,0.00013053208,0.0009818276,0.00041164205,0.0014539097,0.0010191795,0.000006264742],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036161782,0.000014757025,0.00021052577,0.00006215349,0.000012283868,0.000030415507,0.0026710548,0.0039956924,0.00006793243,0.0030531941,0.0000048852403,0.98987347],"study_design_scores_gemma":[0.0009590195,0.0014239042,0.0022371395,0.0029569725,0.000055626973,0.00023476747,0.0000016536608,0.897767,0.00090647803,0.08574374,0.0061456533,0.0015680674],"about_ca_topic_score_codex":0.00009763875,"about_ca_topic_score_gemma":0.00007435907,"teacher_disagreement_score":0.98830545,"about_ca_system_score_codex":0.000118556425,"about_ca_system_score_gemma":0.0003603853,"threshold_uncertainty_score":0.99985224},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011419201,0.0007444922,0.99167174,0.002440327,0.0034159007,0.0004350396,0.0000041904773,0.00007954128,0.0010945804],"genre_scores_gemma":[0.36290815,0.00007800441,0.62811804,0.0034375102,0.0028604546,0.00007431581,0.000050938677,0.00007311721,0.0023994744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723554,0.000032520442,0.00043259416,0.0010807168,0.000746211,0.00047242225],"domain_scores_gemma":[0.99678516,0.00077672023,0.0005833448,0.0015332497,0.00022813266,0.000093384464],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013416312,0.00037211148,0.00039858278,0.00047681664,0.0007578548,0.0011800205,0.003071804,0.0001939145,0.000018242328],"category_scores_gemma":[0.00015499418,0.00026900257,0.00026113976,0.000157015,0.00036966195,0.0004970567,0.00046463404,0.0003717275,0.000015611815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014751901,0.00003077057,0.00014510922,0.000042191507,0.0000330463,0.000016417915,0.0011721769,0.013979242,0.0008253091,0.0074483515,0.00021989203,0.9760727],"study_design_scores_gemma":[0.00045822808,0.00012603006,0.00014768854,0.00035465506,0.000017331009,0.000012973382,0.000001886178,0.9834231,0.0019487067,0.0029839936,0.010089793,0.0004355793],"about_ca_topic_score_codex":0.000024165196,"about_ca_topic_score_gemma":0.0000767193,"teacher_disagreement_score":0.97563714,"about_ca_system_score_codex":0.00014873406,"about_ca_system_score_gemma":0.0004111092,"threshold_uncertainty_score":0.9999762},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04401301,0.0049419296,0.9370096,0.004807259,0.0029187396,0.005580499,0.00017311676,0.000037768375,0.0005181106],"genre_scores_gemma":[0.9858793,0.0002787915,0.012421853,0.0006773224,0.00031338632,0.00009731846,0.00008296682,0.000024077886,0.00022498971],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985652,0.00001351836,0.0003114095,0.0004789356,0.00035913556,0.00027182413],"domain_scores_gemma":[0.99881804,0.00022940504,0.00029727176,0.00041102714,0.00018548233,0.00005880345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020386362,0.0002312963,0.00035715676,0.00015107251,0.00016054072,0.000057478566,0.00030751238,0.000118062664,0.000011210412],"category_scores_gemma":[0.00004071489,0.00014688021,0.00010307826,0.00007650997,0.000558417,0.00009769082,0.00017518527,0.00025098515,4.5865787e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005903299,0.0002671412,0.083435744,0.00033825307,0.000079486825,0.00007728964,0.0011058123,0.037623532,0.0007479863,0.0006335431,0.000104657935,0.87499624],"study_design_scores_gemma":[0.0063132355,0.0010154033,0.10490864,0.0021704521,0.00012624406,0.000063833846,9.653974e-7,0.85686314,0.005383149,0.022228545,0.00043815092,0.000488241],"about_ca_topic_score_codex":0.000040449606,"about_ca_topic_score_gemma":0.00020073836,"teacher_disagreement_score":0.9418663,"about_ca_system_score_codex":0.00026769983,"about_ca_system_score_gemma":0.000240418,"threshold_uncertainty_score":0.5989601},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007940642,0.000236279,0.9881652,0.00085826375,0.0028278634,0.0005809267,0.000008805145,0.00018457168,0.007130169],"genre_scores_gemma":[0.0034840577,0.000013258287,0.9921829,0.0018319337,0.001180784,0.000013219434,0.000003990563,0.00006132698,0.0012285159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537903,0.00005749395,0.0005581473,0.0019985728,0.0010225981,0.0009841685],"domain_scores_gemma":[0.9948395,0.0017336899,0.00053398916,0.0022593208,0.00043192596,0.00020159414],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025361679,0.0006715902,0.00071461237,0.0008326013,0.0011023661,0.0023036492,0.0050218715,0.00036774934,0.000005760409],"category_scores_gemma":[0.00084782974,0.00061698636,0.00027036763,0.00019528021,0.00071412156,0.001027712,0.0012577767,0.00093187194,0.00004601007],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014880691,0.000016598155,0.0000010885308,0.000043365588,0.000007497874,0.00020745386,0.0004655191,0.0022287292,0.001490307,0.0046760184,0.000036198482,0.99081236],"study_design_scores_gemma":[0.0008518792,0.00043766148,0.000025949086,0.0012280871,0.000018222296,0.00015394947,7.193745e-8,0.66150737,0.01793358,0.31250793,0.0042108768,0.0011244328],"about_ca_topic_score_codex":0.000022070359,"about_ca_topic_score_gemma":0.0000153695,"teacher_disagreement_score":0.9896879,"about_ca_system_score_codex":0.00032972067,"about_ca_system_score_gemma":0.00062434067,"threshold_uncertainty_score":0.9996281},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07439325,0.000059405673,0.9248919,0.00014427672,0.0002887859,0.000030396443,3.6047408e-7,0.00006430162,0.00012732873],"genre_scores_gemma":[0.9323749,0.000004381735,0.06749321,0.000056890716,0.00006583308,0.0000013827608,8.781694e-7,0.0000021561978,3.6326682e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994986,0.000008580108,0.00013096978,0.00011176161,0.00013648722,0.00011361862],"domain_scores_gemma":[0.9997095,0.00009621102,0.00001904448,0.00012946442,0.00002352892,0.000022250675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002952057,0.000046023266,0.00007724875,0.000096352036,0.000017205864,0.000009266039,0.0002198333,0.000052955536,0.000008291963],"category_scores_gemma":[0.00022836748,0.000040559502,0.00002176578,0.0003381069,0.00019624857,0.00008458023,0.000036771133,0.00012229345,0.000002789778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011571736,0.00001368951,0.00030305507,0.000025545123,0.0000018431667,0.0000011499293,0.00006871866,0.061017375,0.0014360365,0.0022359688,0.000012351403,0.9348831],"study_design_scores_gemma":[0.00009817469,0.00007304822,0.0011861774,0.000050774444,8.599184e-7,0.0000062248846,2.1649208e-7,0.9452358,0.038734887,0.013929023,0.00062904257,0.00005580729],"about_ca_topic_score_codex":0.0000036009142,"about_ca_topic_score_gemma":0.000014248372,"teacher_disagreement_score":0.9348273,"about_ca_system_score_codex":0.000019238363,"about_ca_system_score_gemma":0.000017723785,"threshold_uncertainty_score":0.16539685},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007666633,0.0002927281,0.9928861,0.0001144833,0.0010965292,0.0005331221,0.00000962129,0.0002904685,0.0040102284],"genre_scores_gemma":[0.3155245,0.000026988644,0.683214,0.000105062456,0.0005324684,0.000009957813,0.000008156547,0.000120116594,0.00045877497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800044,0.000015586209,0.00037969273,0.00070693466,0.00035040439,0.0005469294],"domain_scores_gemma":[0.99844706,0.00040903044,0.00017854843,0.0006925484,0.00014612007,0.00012669084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010012964,0.0004088424,0.00047158735,0.00029771854,0.00042842477,0.00054455,0.0007277086,0.0002613707,0.000005112451],"category_scores_gemma":[0.00028225756,0.00041566024,0.000070398295,0.000103511615,0.00036175494,0.00030518818,0.00023070283,0.0005346174,0.000002636725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008857063,0.000007598792,0.00042126796,0.00027243243,0.00002862725,0.00001250593,0.00085999863,0.6634934,0.0007269389,0.0033467768,0.000012167562,0.33080947],"study_design_scores_gemma":[0.00036024806,0.00005612696,0.00015491992,0.00055887917,0.000014383581,0.00002617865,3.1442e-7,0.9861998,0.0021974582,0.008739812,0.0012146104,0.00047727718],"about_ca_topic_score_codex":0.000011195954,"about_ca_topic_score_gemma":0.000028005368,"teacher_disagreement_score":0.3303322,"about_ca_system_score_codex":0.00023445745,"about_ca_system_score_gemma":0.000113764145,"threshold_uncertainty_score":0.99982953},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041977517,0.00047785975,0.9130369,0.014564242,0.0028354889,0.0013314813,0.000037105,0.00008351149,0.06721364],"genre_scores_gemma":[0.85845286,0.00022248458,0.13421665,0.0026594815,0.00082275685,0.000019054643,0.000015527577,0.0000444272,0.0035467793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995415,0.000107988715,0.00037945237,0.0016735252,0.0017925738,0.0006314894],"domain_scores_gemma":[0.99169797,0.0017432107,0.00032050026,0.0057914034,0.00034963185,0.00009725971],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0052404907,0.0003261713,0.00048053885,0.0005026605,0.0007386086,0.0015737298,0.038717765,0.00024448027,0.00004140691],"category_scores_gemma":[0.0008329311,0.00020971056,0.0000707963,0.00027669888,0.002179789,0.0009322922,0.021446656,0.0011878792,0.00006898029],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002422935,0.00007897944,0.00020929515,0.00004754456,0.000036365298,0.00016466886,0.0017408577,0.0002961353,0.00009006901,0.13220242,0.0026562728,0.86245316],"study_design_scores_gemma":[0.00040873268,0.00038102284,0.001504029,0.0011227044,0.000008022139,0.000039279726,0.0000014981474,0.75211596,0.00046049815,0.22307584,0.020323765,0.0005586413],"about_ca_topic_score_codex":0.00014555422,"about_ca_topic_score_gemma":0.0002742029,"teacher_disagreement_score":0.86189455,"about_ca_system_score_codex":0.00010746066,"about_ca_system_score_gemma":0.0015734578,"threshold_uncertainty_score":0.9994627},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012195885,0.000116829695,0.9802731,0.0023620748,0.0010192073,0.00061667006,0.000006430558,0.0005263573,0.015067104],"genre_scores_gemma":[0.093020394,0.00004797238,0.9039362,0.0017191678,0.00040158496,0.000055692137,0.000017055236,0.000051058367,0.0007508534],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956336,0.000049489136,0.0005945601,0.0018456558,0.0012154073,0.000661257],"domain_scores_gemma":[0.9953202,0.0003377809,0.0006265085,0.0030117626,0.00049010984,0.0002136091],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012557053,0.00058458047,0.00052949914,0.0010458836,0.0005087432,0.0018589473,0.005574312,0.00041776797,0.000059099635],"category_scores_gemma":[0.00017563322,0.0005567603,0.00019441858,0.0002247206,0.0010352058,0.0012178937,0.0010607567,0.000844764,0.00020306569],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037904395,0.000026154263,0.000010587432,0.00003547955,0.0000058872056,0.000063964486,0.00010327427,0.00014173122,0.0009252807,0.015579615,0.00008495519,0.9830193],"study_design_scores_gemma":[0.00054393074,0.00033456413,0.00029455373,0.000963201,0.000016012526,0.000054318356,7.787867e-8,0.28526175,0.04820397,0.654178,0.0087201,0.0014294868],"about_ca_topic_score_codex":0.000024224431,"about_ca_topic_score_gemma":0.000047465663,"teacher_disagreement_score":0.9815898,"about_ca_system_score_codex":0.00051949744,"about_ca_system_score_gemma":0.0008733572,"threshold_uncertainty_score":0.999806},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031348437,0.00015459277,0.99700475,0.00071328477,0.0007352687,0.0002724002,0.00006675699,0.00006626957,0.00067318644],"genre_scores_gemma":[0.48427564,0.0000038602857,0.515264,0.00023981625,0.00007356072,0.0000018050089,0.00010826855,0.000015651134,0.000017422013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664533,0.000053636864,0.0006610496,0.0013005775,0.0009832558,0.00035615094],"domain_scores_gemma":[0.99582267,0.0010367325,0.00082243147,0.0016877137,0.0005133342,0.000117138334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089606736,0.00033639156,0.00041418575,0.00045491624,0.00043950163,0.0004228793,0.0033508479,0.00022332105,0.00000466882],"category_scores_gemma":[0.00028548404,0.00034517603,0.00006115165,0.00018685247,0.0007453277,0.00051410863,0.0008723644,0.00042377203,0.000004981805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023096381,0.00011052806,0.00015114939,0.0001258749,0.000023437084,0.000026101721,0.00014390599,0.18039444,0.004095431,0.08447992,0.00007756439,0.7303485],"study_design_scores_gemma":[0.00027003154,0.00006671655,0.00015415218,0.00039301455,0.000013104109,0.000013409114,1.2396853e-7,0.8691189,0.000602405,0.12900963,0.000051161474,0.00030730866],"about_ca_topic_score_codex":0.00004559787,"about_ca_topic_score_gemma":0.0000121142775,"teacher_disagreement_score":0.7300412,"about_ca_system_score_codex":0.00025002446,"about_ca_system_score_gemma":0.0007857773,"threshold_uncertainty_score":0.99990004},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022443517,0.00031166078,0.99142367,0.00020194986,0.0042118053,0.00034776327,0.0000022235934,0.000079022226,0.0011775863],"genre_scores_gemma":[0.90440327,0.000087288674,0.08932297,0.0011227983,0.004131317,0.000005660881,0.00007480672,0.00006136632,0.0007904969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808455,0.000020859063,0.000275375,0.0006126143,0.0007132549,0.00029333244],"domain_scores_gemma":[0.99872285,0.00012544067,0.0002539376,0.0005680094,0.00021739137,0.00011234313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004631803,0.00027083384,0.00041769692,0.0003569543,0.0004647174,0.00014012374,0.00016654549,0.00030464176,0.000059540293],"category_scores_gemma":[0.00016593465,0.0002402458,0.0002561806,0.00011409381,0.00041631216,0.000278425,0.00010325007,0.00067923387,0.00002260595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007554982,0.000017245477,0.0083026495,0.00004342275,0.00006340831,0.00005272784,0.00004080743,0.70505893,0.000103558705,0.00017558514,0.000069585054,0.28599653],"study_design_scores_gemma":[0.00048949936,0.00010338213,0.01711721,0.00048173597,0.00011595901,0.00042553624,1.386457e-7,0.9718898,0.0000920064,0.005501384,0.0034936243,0.00028975145],"about_ca_topic_score_codex":0.00006987869,"about_ca_topic_score_gemma":0.0000354504,"teacher_disagreement_score":0.9021589,"about_ca_system_score_codex":0.00059869897,"about_ca_system_score_gemma":0.0003713313,"threshold_uncertainty_score":0.979694},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003098973,0.00015038159,0.9793725,0.0031826166,0.007618057,0.001145673,0.000024748664,0.00016659244,0.005240484],"genre_scores_gemma":[0.93751997,0.00004396306,0.043884397,0.009068285,0.0066934335,0.000038601378,0.0000072980915,0.0001618936,0.0025821563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950752,0.00011871085,0.0005503615,0.0021452121,0.0013211136,0.0007893553],"domain_scores_gemma":[0.99039793,0.0074868742,0.0006206047,0.0011230535,0.00022846421,0.0001430827],"candidate_categories":["metaresearch","metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001349784,0.0006608609,0.0007169413,0.0005912552,0.0015877206,0.0005591495,0.0015009248,0.00041436902,0.00004211416],"category_scores_gemma":[0.010463366,0.00062297407,0.00022419196,0.00021795838,0.0017829861,0.00076343975,0.0009346527,0.0011340245,0.000043709333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006288978,0.0001905746,0.0004714507,0.00017011895,0.0000502873,0.0007572049,0.0013166408,0.27274737,0.11205509,0.0039488925,0.0014679745,0.6061955],"study_design_scores_gemma":[0.00326342,0.00038065252,0.00071463035,0.00094405166,0.00005690384,0.00066253106,4.5904972e-7,0.8417942,0.03850553,0.09641672,0.014994515,0.0022664047],"about_ca_topic_score_codex":0.0001623673,"about_ca_topic_score_gemma":0.00052926794,"teacher_disagreement_score":0.9354881,"about_ca_system_score_codex":0.00066586083,"about_ca_system_score_gemma":0.0007139244,"threshold_uncertainty_score":0.99971205},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09402383,0.005110567,0.83559215,0.04242085,0.0050616604,0.011887942,0.00007287546,0.00041257654,0.0054175416],"genre_scores_gemma":[0.8048751,0.00008753915,0.18706295,0.0065794555,0.00081853743,0.00019068006,0.0000130919725,0.00008976099,0.0002829152],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99651164,0.000039836585,0.00044452128,0.0012751337,0.0010725523,0.0006563396],"domain_scores_gemma":[0.99763197,0.000511216,0.00024889022,0.0011586482,0.00014316024,0.0003060966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008055319,0.00064892805,0.0011692165,0.0013677267,0.00016587043,0.0002529618,0.00082799984,0.00029202932,0.0001313247],"category_scores_gemma":[0.00028523832,0.00045308788,0.00015970012,0.00022204385,0.00024528473,0.000082860344,0.0005267716,0.00047234588,0.000029620898],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059870286,0.0004836509,0.0026955353,0.00027704035,0.00009939687,0.00032500378,0.0015404061,0.0015819462,0.0015250439,0.00041744913,0.000046648765,0.990948],"study_design_scores_gemma":[0.006316187,0.004199663,0.51301223,0.023263916,0.00062558916,0.00057096384,0.0000016683452,0.4205936,0.011269,0.01712712,0.0009512761,0.0020687853],"about_ca_topic_score_codex":0.000097279866,"about_ca_topic_score_gemma":0.0015226477,"teacher_disagreement_score":0.9888792,"about_ca_system_score_codex":0.0007041163,"about_ca_system_score_gemma":0.00036003912,"threshold_uncertainty_score":0.9997921},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006172544,0.0020257605,0.9866435,0.0042047785,0.0014306423,0.00091116555,0.0000053178824,0.0001733214,0.0039882753],"genre_scores_gemma":[0.57298243,0.00035025206,0.42197213,0.0025281447,0.000859262,0.00005585309,0.0000027362655,0.00008121833,0.0011679605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954607,0.000104700746,0.0007240863,0.001970959,0.00081184466,0.00092769536],"domain_scores_gemma":[0.9951528,0.0021375408,0.0005744061,0.0017412531,0.00016843413,0.0002256221],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001960494,0.000752585,0.0015459948,0.0012228498,0.0005447406,0.0011194417,0.0038104437,0.0004139434,0.000013464114],"category_scores_gemma":[0.0006835978,0.0006019279,0.00022417796,0.0002889891,0.00090391573,0.0004595917,0.0018136159,0.0011100695,0.00001939653],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104107094,0.00006906777,0.00019315245,0.00009605131,0.00005162232,0.00062609726,0.0008324352,0.058187176,0.00013728264,0.019520672,0.000030347373,0.920152],"study_design_scores_gemma":[0.002182127,0.00015281343,0.00020868165,0.00078895735,0.000015673088,0.00009151098,1.8376466e-7,0.79655546,0.00017125426,0.19872889,0.00041658143,0.000687899],"about_ca_topic_score_codex":0.00008387107,"about_ca_topic_score_gemma":0.00016590513,"teacher_disagreement_score":0.9194641,"about_ca_system_score_codex":0.00018970847,"about_ca_system_score_gemma":0.0004966411,"threshold_uncertainty_score":0.9999175},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037258887,0.00090082985,0.9837488,0.0006483455,0.00092640496,0.00038058238,0.0000124910575,0.0001701973,0.012839773],"genre_scores_gemma":[0.5256501,0.000060365986,0.4699368,0.0010403147,0.0006081973,0.0000119745855,0.000010620769,0.00006353675,0.0026181168],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664026,0.000045014254,0.0005044684,0.0013135904,0.0009406152,0.000556059],"domain_scores_gemma":[0.9958473,0.00019855617,0.00056125544,0.0030133727,0.00024157371,0.00013793207],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010720408,0.00048129214,0.00073093217,0.00047694155,0.00028435566,0.00044410542,0.006094109,0.00028911623,0.000043231685],"category_scores_gemma":[0.000114430986,0.00039007762,0.00017050808,0.00016314327,0.0025043993,0.00068246963,0.0021703395,0.0005717549,0.00003779414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008194838,0.00005126378,0.00006824193,0.00014837061,0.000025572148,0.00012664597,0.0011129972,0.0008837616,0.0011427171,0.2368935,0.0000610999,0.7594776],"study_design_scores_gemma":[0.00047310526,0.00027374667,0.0007857967,0.001256439,0.000017805425,0.00013580183,5.7899166e-7,0.18487287,0.019277794,0.7882245,0.003548208,0.0011333632],"about_ca_topic_score_codex":0.000054640073,"about_ca_topic_score_gemma":0.000044482542,"teacher_disagreement_score":0.7583443,"about_ca_system_score_codex":0.00011164098,"about_ca_system_score_gemma":0.00040386704,"threshold_uncertainty_score":0.9998551},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006860558,0.00023551784,0.98402154,0.002789481,0.007177378,0.0014014877,0.00009432474,0.00024886397,0.0033453715],"genre_scores_gemma":[0.85364753,0.000033117198,0.1088326,0.024678016,0.0058756177,0.000086663444,0.000010797319,0.0002692088,0.006566444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99381274,0.00008590743,0.0008533426,0.0029509421,0.0009799679,0.0013170904],"domain_scores_gemma":[0.99294245,0.0036971967,0.00075139577,0.002043916,0.0002742832,0.00029077308],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011612948,0.0010436967,0.0011417747,0.00085606176,0.00079845946,0.0015456459,0.004737233,0.0005081328,0.00008514534],"category_scores_gemma":[0.00070192467,0.0009168169,0.0004447234,0.00016233852,0.0021646954,0.0007934612,0.0012654256,0.0012140415,0.00012836115],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015548116,0.00011552538,0.000027801114,0.00024251375,0.00003939124,0.00026149143,0.0012959376,0.02474226,0.029493697,0.003814964,0.0036930814,0.9361178],"study_design_scores_gemma":[0.003404557,0.0015755397,0.00009042932,0.0021500532,0.00006473521,0.0005341477,4.4489033e-7,0.6630889,0.13953055,0.117474414,0.06882596,0.0032602542],"about_ca_topic_score_codex":0.000013006637,"about_ca_topic_score_gemma":0.00004834261,"teacher_disagreement_score":0.9328576,"about_ca_system_score_codex":0.00026979164,"about_ca_system_score_gemma":0.000459858,"threshold_uncertainty_score":0.99949086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004500761,0.00021282956,0.9930757,0.0002737178,0.0014025723,0.0009195332,0.000029087114,0.00007023695,0.0035662067],"genre_scores_gemma":[0.6019471,0.00003401244,0.39681533,0.0003642169,0.00052035274,0.000081062404,0.00008605421,0.000038934948,0.00011291809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654925,0.000070308575,0.00042734656,0.0011221914,0.001471395,0.0003594989],"domain_scores_gemma":[0.9961774,0.0002262379,0.0005672633,0.0014218539,0.0014878531,0.00011939842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002931794,0.00032880798,0.00039435088,0.00053646695,0.0003194854,0.00037857896,0.0023079938,0.0003478708,0.000017376475],"category_scores_gemma":[0.00029922728,0.0003031603,0.00012931449,0.00012519912,0.00031756496,0.0012698341,0.0002710365,0.0003174156,0.000022606275],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009977091,0.000028730443,0.000005105523,0.000034583136,0.0000062565537,0.0000013729536,0.00041339302,0.0055935457,0.0013706965,0.0004803509,0.000025806501,0.9920302],"study_design_scores_gemma":[0.0006033095,0.00029188266,0.00008036772,0.00078930974,0.000033658438,0.000011538227,4.0984244e-7,0.5523957,0.018442305,0.42667067,0.00022761115,0.00045324603],"about_ca_topic_score_codex":0.000014240296,"about_ca_topic_score_gemma":0.00007687414,"teacher_disagreement_score":0.9915769,"about_ca_system_score_codex":0.00015299619,"about_ca_system_score_gemma":0.00066095847,"threshold_uncertainty_score":0.99994206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010866942,0.0014814268,0.9926484,0.0020792454,0.0012964554,0.0011229928,0.000035333647,0.00003208147,0.00021731909],"genre_scores_gemma":[0.52429205,0.0011550487,0.47041178,0.001650312,0.0008844014,0.00007256931,0.00010480315,0.00010339793,0.0013256355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757576,0.0000181922,0.00050765334,0.00090150617,0.0005588847,0.00043802793],"domain_scores_gemma":[0.9977522,0.0003296789,0.0006714329,0.0007851188,0.00030232262,0.0001592792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007189503,0.0003704866,0.00074575533,0.0006649995,0.0001889076,0.00016035067,0.00072840624,0.00031293608,0.000008436833],"category_scores_gemma":[0.000561218,0.000302156,0.00018190549,0.00019772563,0.0014308369,0.00023165977,0.00014505189,0.0009106053,0.0000015945686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016151149,0.00006752106,0.0025385572,0.00068901305,0.00009490556,0.000046755133,0.0008974898,0.02409742,0.0058499705,0.00076605816,0.000062450315,0.96472836],"study_design_scores_gemma":[0.001264951,0.00020019329,0.0010288352,0.0008950783,0.00010223512,0.00006393779,5.419323e-7,0.9885493,0.0014077933,0.004654579,0.0014839922,0.0003485856],"about_ca_topic_score_codex":0.00010143836,"about_ca_topic_score_gemma":0.000049890852,"teacher_disagreement_score":0.96445185,"about_ca_system_score_codex":0.00044030417,"about_ca_system_score_gemma":0.00075530977,"threshold_uncertainty_score":0.9999431},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038823255,0.00035916653,0.9881835,0.0011021439,0.002457998,0.0005828245,0.0000032887556,0.00012511731,0.0033036608],"genre_scores_gemma":[0.9929408,0.00007490572,0.0056831893,0.0007811073,0.00016425422,0.0000316274,0.0000036322158,0.000025715448,0.00029477582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584436,0.00018837821,0.0006110122,0.0014976347,0.0011440438,0.00071454165],"domain_scores_gemma":[0.997504,0.0003962378,0.0004284277,0.0014482132,0.00013366916,0.00008945243],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002354018,0.0005203862,0.00051073486,0.0010892875,0.0005265298,0.00124345,0.0036517084,0.00032948426,0.0000065253375],"category_scores_gemma":[0.00018233895,0.00041853794,0.00013910542,0.0006806949,0.00059872115,0.0010122096,0.00078676635,0.0012610205,0.000028203744],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032124106,0.00022075941,0.0007561965,0.000092088776,0.0000125381475,0.00023738347,0.0071149487,0.010624273,0.004884142,0.0059540435,0.00009777104,0.96997374],"study_design_scores_gemma":[0.0022651984,0.0012692075,0.0096169645,0.0019223301,0.000021337548,0.00032597646,0.000022375229,0.75399095,0.03536953,0.18995993,0.0024757779,0.0027604427],"about_ca_topic_score_codex":0.00032829575,"about_ca_topic_score_gemma":0.0017446484,"teacher_disagreement_score":0.9890585,"about_ca_system_score_codex":0.00039737593,"about_ca_system_score_gemma":0.00022401795,"threshold_uncertainty_score":0.99982667},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011706348,0.005142455,0.9736514,0.003968598,0.0048786597,0.00069362076,0.00001582133,0.00012766267,0.0103511615],"genre_scores_gemma":[0.90161705,0.00023202157,0.092630744,0.0018017852,0.0030399722,0.00000858867,0.00009401651,0.00006061951,0.000515187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979836,0.000022084654,0.00034396333,0.00058268226,0.0007452057,0.00032251148],"domain_scores_gemma":[0.99770314,0.0008125813,0.00031962775,0.0007739714,0.00028312628,0.00010755765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000533549,0.00028627765,0.00057233433,0.00023958128,0.00016503231,0.00008319475,0.00039070635,0.00019204286,0.000010482158],"category_scores_gemma":[0.0005374546,0.0002447415,0.00013980173,0.000091656664,0.00082926574,0.00011082071,0.00021975576,0.0005340817,0.0000079668425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000892828,0.000049707305,0.00243247,0.00024217328,0.000036768557,0.00013911037,0.00038198734,0.2148952,0.000030990304,0.0005317852,0.0015631607,0.77960736],"study_design_scores_gemma":[0.0019922142,0.001145469,0.03978037,0.0117378915,0.00050729746,0.0009488446,2.859243e-7,0.860529,0.0018177642,0.07106338,0.00884804,0.0016294087],"about_ca_topic_score_codex":0.000047852274,"about_ca_topic_score_gemma":0.000027966355,"teacher_disagreement_score":0.9004464,"about_ca_system_score_codex":0.000106846834,"about_ca_system_score_gemma":0.00042512355,"threshold_uncertainty_score":0.9980269},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02811638,0.00013058765,0.96637404,0.00043788512,0.0031885768,0.0011450045,0.00004085533,0.00011856151,0.00044808508],"genre_scores_gemma":[0.9789595,0.0000076502065,0.018372461,0.0012855635,0.0011658715,0.000023109416,0.000002871477,0.000069507325,0.00011343692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537146,0.00013743641,0.000667234,0.0021905187,0.00087817333,0.0007551806],"domain_scores_gemma":[0.98593885,0.011857521,0.00071390445,0.001107565,0.000134332,0.00024784787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018880884,0.0007898674,0.001007039,0.00072285073,0.00042260496,0.0006822892,0.002010938,0.0003343696,0.000016999235],"category_scores_gemma":[0.0017625942,0.0006588579,0.00021127712,0.000116905016,0.0019449419,0.00072173757,0.00047590834,0.0008546667,0.000009392241],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004967133,0.000084093226,0.00004784525,0.0006242466,0.0000134904085,0.00009737425,0.0011390141,0.03505601,0.0586292,0.00017430181,0.00017036914,0.90346736],"study_design_scores_gemma":[0.0010569618,0.0071173636,0.0004385463,0.0050138975,0.000034060635,0.00007800651,3.2268858e-7,0.8397617,0.14150935,0.0034939288,0.0005076969,0.0009882159],"about_ca_topic_score_codex":0.000011366564,"about_ca_topic_score_gemma":0.00002016617,"teacher_disagreement_score":0.95084316,"about_ca_system_score_codex":0.00014391371,"about_ca_system_score_gemma":0.00037158636,"threshold_uncertainty_score":0.9995863},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009802997,0.00033601912,0.99657416,0.0016047165,0.00012984607,0.00022604772,0.0000024507406,0.000018293029,0.0010104171],"genre_scores_gemma":[0.22357886,0.00006757485,0.7727001,0.0014514375,0.00048634165,0.000014860717,0.0000050215003,0.00002071781,0.0016751264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999239,0.0000036289646,0.00012261032,0.0002916649,0.00022368509,0.000119356795],"domain_scores_gemma":[0.9992161,0.00007044084,0.0001004596,0.0004925266,0.00008733767,0.000033179243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014603653,0.00009827115,0.00016705532,0.0000804003,0.00016922707,0.000024937655,0.00022483178,0.000053438936,0.0000028696786],"category_scores_gemma":[0.000021700835,0.000066375156,0.000041513253,0.00008544858,0.0006462642,0.00005623313,0.00021225204,0.00028866163,5.344531e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002306035,0.00007040657,0.0024440938,0.0001966934,0.0000071316304,0.000007939454,0.00031593387,0.38201156,0.0030443985,0.00398169,0.0017560599,0.60614103],"study_design_scores_gemma":[0.00019699032,0.00003384771,0.0013915213,0.0009340316,0.00001998863,0.00014504342,1.3727505e-7,0.83734137,0.0044352044,0.14667356,0.008660366,0.00016794413],"about_ca_topic_score_codex":0.0000069698353,"about_ca_topic_score_gemma":0.0000021373683,"teacher_disagreement_score":0.60597306,"about_ca_system_score_codex":0.00006287102,"about_ca_system_score_gemma":0.00031725518,"threshold_uncertainty_score":0.27067003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062642776,0.00009362113,0.9903171,0.00025761107,0.0015511722,0.0010214903,0.000013103163,0.00028478794,0.005834709],"genre_scores_gemma":[0.12062014,0.000007940455,0.87748533,0.00086834544,0.00030196918,0.00006425592,0.000041650466,0.00007319337,0.0005371999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99378,0.000032367057,0.0010798895,0.0023903854,0.0015642704,0.0011530697],"domain_scores_gemma":[0.9944027,0.00045351047,0.00087924977,0.0035975855,0.00047343268,0.00019353101],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002142326,0.0007834605,0.00086430664,0.0015644288,0.00081238506,0.0016469532,0.009543389,0.00048250775,0.000017544775],"category_scores_gemma":[0.00072672754,0.00075355684,0.00013634171,0.0010779073,0.0008383271,0.003263226,0.0056338054,0.0015569145,0.000056541045],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013565445,0.00017006758,0.0044562877,0.00012796184,0.00003067308,0.0002026516,0.003597117,0.021543888,0.00004365394,0.043282457,0.0000438068,0.92648786],"study_design_scores_gemma":[0.002458638,0.0003285889,0.0042254473,0.0035467914,0.000022297505,0.00026183567,0.000004481036,0.65956175,0.00059361605,0.32172865,0.003534622,0.0037333092],"about_ca_topic_score_codex":0.00010959363,"about_ca_topic_score_gemma":0.0001925102,"teacher_disagreement_score":0.9227546,"about_ca_system_score_codex":0.00076320046,"about_ca_system_score_gemma":0.00095680234,"threshold_uncertainty_score":0.9994916},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011638378,0.00014290688,0.989164,0.0002956661,0.00032811376,0.00047561672,0.0000068834884,0.00004502318,0.008377939],"genre_scores_gemma":[0.9089894,0.000035481087,0.08872371,0.0006276148,0.00031702244,0.000012181254,0.000019064077,0.000021387901,0.0012541338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982735,0.000013761581,0.00027968222,0.0006576966,0.0005394595,0.0002359305],"domain_scores_gemma":[0.9991258,0.000048770813,0.00016905271,0.00036227138,0.0001751785,0.00011893622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019311464,0.00024272411,0.0004780693,0.00037709347,0.0001499079,0.000046981524,0.0004018231,0.00014268974,0.000046182184],"category_scores_gemma":[0.000059784594,0.00019652183,0.000109007655,0.00008572417,0.00024408325,0.00003567906,0.00037067293,0.0005142644,0.000010379912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041309355,0.000040241932,0.00002984892,0.00006443894,0.000021563412,0.000018249053,0.00022991147,0.91947097,0.00011443719,0.00047000742,0.0000086679,0.079490356],"study_design_scores_gemma":[0.00029096674,0.00026727768,0.00013231783,0.00024348177,0.000025887706,0.000061479754,2.5282324e-7,0.99421227,0.000043129414,0.0036546295,0.0008747474,0.00019354331],"about_ca_topic_score_codex":0.00009396778,"about_ca_topic_score_gemma":0.000029631623,"teacher_disagreement_score":0.9078256,"about_ca_system_score_codex":0.00016071399,"about_ca_system_score_gemma":0.00016324392,"threshold_uncertainty_score":0.80139273},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001837088,0.00119505,0.9868996,0.0031495574,0.002139198,0.00026156477,0.0000022968532,0.00012921187,0.0060398187],"genre_scores_gemma":[0.702233,0.0008645576,0.28740913,0.0067434325,0.0016451253,0.000034134926,0.000003895829,0.000096844095,0.0009698759],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970436,0.00005658234,0.00034577033,0.0012592803,0.0006481828,0.00064657954],"domain_scores_gemma":[0.9964557,0.00082788634,0.00029788815,0.002134061,0.00010904842,0.0001753617],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00163863,0.00045037488,0.0003591743,0.00043070433,0.001529614,0.0017159143,0.004937543,0.0001688176,0.0000051402744],"category_scores_gemma":[0.0000812432,0.0003228976,0.00014752349,0.00018814724,0.0021975613,0.0005995107,0.00260932,0.00076305144,0.000018656854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009574665,0.000008803074,0.00003685724,0.000011815758,0.000011787387,0.00007360731,0.00046505657,0.000538509,0.00008284376,0.20282954,0.000053944575,0.79587764],"study_design_scores_gemma":[0.00028862833,0.00024753268,0.0002504986,0.00029908394,0.000009243187,0.0001323737,2.6738942e-7,0.08168649,0.00022236098,0.90820163,0.008045944,0.00061596744],"about_ca_topic_score_codex":0.000018555742,"about_ca_topic_score_gemma":0.00007406666,"teacher_disagreement_score":0.7952617,"about_ca_system_score_codex":0.00007670209,"about_ca_system_score_gemma":0.00022760405,"threshold_uncertainty_score":0.99992234},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012800927,0.00019937051,0.9775334,0.010381685,0.001107459,0.00026764805,6.8431973e-7,0.00006185101,0.010435098],"genre_scores_gemma":[0.3461304,0.000093262955,0.6424985,0.010252604,0.00047412113,0.000012824721,0.0000032420783,0.000030796426,0.0005042623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974368,0.000032127733,0.00035259075,0.0009706655,0.00072573853,0.00048206837],"domain_scores_gemma":[0.99733084,0.000469993,0.0002533397,0.0018207001,0.000056311063,0.000068800655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008384387,0.00033781817,0.00030921688,0.00048515046,0.00035285976,0.0009020633,0.0048867464,0.00015944654,0.000012684933],"category_scores_gemma":[0.00019896954,0.00024274523,0.00008234003,0.00022461308,0.00020464114,0.0009160256,0.0006394996,0.00090445264,0.000047560578],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024270523,0.00001588117,0.000035801237,0.000010513653,0.0000015739432,0.000099048695,0.0009891539,0.006242885,0.0000669317,0.017666217,0.00005498167,0.9748146],"study_design_scores_gemma":[0.00017428272,0.000095978394,0.0003182644,0.00041023307,0.0000022388333,0.000081870785,2.2776351e-7,0.6462165,0.001569023,0.347487,0.0032652288,0.00037917012],"about_ca_topic_score_codex":0.000023032755,"about_ca_topic_score_gemma":0.00008086929,"teacher_disagreement_score":0.9744354,"about_ca_system_score_codex":0.00011416947,"about_ca_system_score_gemma":0.00020142672,"threshold_uncertainty_score":0.9898863},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106096566,0.0015066251,0.63067734,0.07288663,0.02580069,0.003909445,0.00032897235,0.0013089809,0.15748478],"genre_scores_gemma":[0.98243284,0.000041343283,0.002363343,0.008218692,0.00082790107,0.000008982191,0.0000042476327,0.00004394142,0.0060586976],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965588,0.00004083735,0.00032838382,0.0016498099,0.0008417716,0.00058042555],"domain_scores_gemma":[0.9983546,0.00031240968,0.00026366184,0.00090202224,0.000039682796,0.00012759292],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00027535993,0.0004501029,0.00043415016,0.00031540892,0.00089980237,0.0002500122,0.0018799574,0.00027288694,0.00006652457],"category_scores_gemma":[0.000094240495,0.00036261187,0.00017589465,0.00011907037,0.003413551,0.0002530548,0.0007622991,0.000970096,0.000088389716],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009998859,0.0002799186,0.002112308,0.00006956072,0.000019128101,0.00097171555,0.0004971018,0.0026915343,0.07788352,0.010173097,0.0014689746,0.90373313],"study_design_scores_gemma":[0.0024994968,0.0012282762,0.03585938,0.0014523275,0.0001381495,0.0015223701,0.0000013465533,0.0055752285,0.13083813,0.7562877,0.05971142,0.0048861564],"about_ca_topic_score_codex":0.00000774866,"about_ca_topic_score_gemma":0.000043936634,"teacher_disagreement_score":0.898847,"about_ca_system_score_codex":0.00011424722,"about_ca_system_score_gemma":0.0001021252,"threshold_uncertainty_score":0.9998826},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025279485,0.0000512366,0.990475,0.00048594794,0.0020817453,0.0007050576,0.000027727347,0.00020032655,0.0034450362],"genre_scores_gemma":[0.6604331,0.00003696554,0.32943243,0.004044841,0.0038021563,0.0001735257,0.000081875965,0.00012403114,0.0018710624],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996858,0.0000345043,0.00037966474,0.0015077759,0.0006155346,0.00060454465],"domain_scores_gemma":[0.9976064,0.00025461387,0.0004727116,0.0011762428,0.000327471,0.0001625483],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00070959853,0.00049909804,0.000486141,0.0007500632,0.0009632278,0.0010671779,0.002200945,0.00039128424,0.0000788711],"category_scores_gemma":[0.000074060204,0.0004970124,0.000247697,0.00010705611,0.00048522282,0.0014295983,0.00043501207,0.0006988889,0.0000921647],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007982109,0.00003838557,0.000007980408,0.000048436494,0.000012911933,0.00001811661,0.0002092193,0.000039235485,0.0017964991,0.000514172,0.00008742562,0.9972196],"study_design_scores_gemma":[0.0015786027,0.00092082476,0.0009955423,0.001372153,0.00006175103,0.00011068174,2.233683e-7,0.20650351,0.03029272,0.74508345,0.010635523,0.0024450088],"about_ca_topic_score_codex":0.000022020862,"about_ca_topic_score_gemma":0.00013401074,"teacher_disagreement_score":0.99477464,"about_ca_system_score_codex":0.00028594874,"about_ca_system_score_gemma":0.0002995215,"threshold_uncertainty_score":0.9999698},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009626406,0.00011505166,0.991493,0.0049864748,0.00018314969,0.00080706767,0.00001081965,0.00013366064,0.0021745048],"genre_scores_gemma":[0.09738907,0.00004832805,0.89029,0.0046491763,0.000794574,0.00007794429,0.00003467607,0.000073676965,0.0066425274],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865097,0.0000029841228,0.00018720627,0.0006576446,0.00024815468,0.000253062],"domain_scores_gemma":[0.9985663,0.0001622672,0.00012479202,0.0009101965,0.00015175143,0.000084654785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001570842,0.00021386363,0.0003059635,0.00018070557,0.00021945593,0.00007435481,0.0003806671,0.00015708289,0.000021395685],"category_scores_gemma":[0.00010045273,0.00018774536,0.00010115969,0.000041558887,0.0004018865,0.00009175526,0.00013494899,0.00038655696,0.000014723016],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002711711,0.00004466768,0.0003055817,0.00014699886,0.000010265497,0.000021822725,0.00017866545,0.0010641163,0.001473499,0.009409097,0.0009357361,0.9863824],"study_design_scores_gemma":[0.0006403439,0.0004943201,0.0014290127,0.001152794,0.00006561877,0.00021748408,7.6826545e-8,0.05433775,0.008226618,0.48918816,0.4435139,0.0007339069],"about_ca_topic_score_codex":0.000007916983,"about_ca_topic_score_gemma":0.0000065350955,"teacher_disagreement_score":0.9856485,"about_ca_system_score_codex":0.000102317,"about_ca_system_score_gemma":0.000118757016,"threshold_uncertainty_score":0.76560336},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016086173,0.00012883768,0.98775584,0.00028689794,0.00027512794,0.00027608435,0.000015810387,0.00039619897,0.010704358],"genre_scores_gemma":[0.9445476,0.000046210476,0.054193344,0.00022800293,0.0003005983,0.000076636396,0.000035963116,0.00005694222,0.00051471946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849546,0.000004443019,0.00024939489,0.00069343176,0.00025387917,0.0003034084],"domain_scores_gemma":[0.9981786,0.00009583085,0.00013729736,0.0014597605,0.00006423168,0.00006430472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001371744,0.00034089692,0.00036648667,0.0007610408,0.00026282828,0.00016739649,0.0013006087,0.00037121074,0.000026817344],"category_scores_gemma":[0.000018668246,0.00032305633,0.00011999288,0.00018709729,0.0005725371,0.00013633777,0.00019826603,0.0006398279,0.00008939475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022946876,0.00001011636,0.00004742036,0.000017918315,0.00006795198,0.0000126509285,0.00012449677,0.059331127,0.00068552594,0.0015163118,0.000028081728,0.9381561],"study_design_scores_gemma":[0.00013430715,0.000038487407,0.0008506972,0.00012238708,0.00008676629,0.00000985411,8.3287006e-8,0.9448688,0.0031016914,0.030292824,0.019928955,0.0005651217],"about_ca_topic_score_codex":0.0000078156745,"about_ca_topic_score_gemma":0.00014102095,"teacher_disagreement_score":0.9443867,"about_ca_system_score_codex":0.00017928371,"about_ca_system_score_gemma":0.000034830784,"threshold_uncertainty_score":0.99992216},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020076302,0.00003427812,0.99694127,0.0005286109,0.00052126386,0.0012646221,0.000028931832,0.0001951921,0.0004657515],"genre_scores_gemma":[0.057046067,0.000021899506,0.94079375,0.001657045,0.00013657614,0.00010493732,0.00006758367,0.000036651083,0.0001354664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682635,0.000046271794,0.0005455646,0.001253866,0.0008581398,0.0004698022],"domain_scores_gemma":[0.9973517,0.0005802113,0.0005143855,0.0010245468,0.0003946964,0.0001344657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081767526,0.0004156472,0.00043024632,0.0009483726,0.0002827918,0.0005943543,0.002351507,0.00028618152,0.000013040365],"category_scores_gemma":[0.0005238185,0.00041206597,0.00009188348,0.00023795727,0.00058140553,0.0014265352,0.0004723144,0.00042705965,0.0000061505093],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002700851,0.00006808518,0.00004918268,0.00009463399,0.000007678607,0.000026606303,0.0012222627,0.048440263,0.0063306056,0.0017516941,0.00007556674,0.9419064],"study_design_scores_gemma":[0.00065352884,0.00009945404,0.000032491425,0.00026127556,0.000005221423,0.0000029295043,2.9241124e-7,0.7761034,0.17277388,0.049692016,0.000018340354,0.00035719032],"about_ca_topic_score_codex":0.000033198026,"about_ca_topic_score_gemma":0.00012623932,"teacher_disagreement_score":0.94154924,"about_ca_system_score_codex":0.00049056887,"about_ca_system_score_gemma":0.00083200657,"threshold_uncertainty_score":0.9998331},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024793227,0.0009079579,0.99479485,0.00031175584,0.0007076508,0.00030566647,0.000003140864,0.000021912792,0.0004677391],"genre_scores_gemma":[0.98399544,0.001011648,0.014605732,0.000062922125,0.00012338464,0.000013440613,0.000005254273,0.000011341667,0.00017081591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981037,0.000042441683,0.00045460454,0.0008463204,0.00028985305,0.00026307552],"domain_scores_gemma":[0.99810994,0.00045200952,0.00058311917,0.00055415026,0.00021239101,0.00008840294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005095847,0.00024440765,0.00038410918,0.00034815405,0.00024372345,0.00011706093,0.00073789014,0.0002016122,0.0000091337515],"category_scores_gemma":[0.000074373645,0.00023832463,0.000047274007,0.00031587956,0.0009938736,0.0004465226,0.00041506338,0.0005037184,0.000001566893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003063385,0.000034628683,0.011430194,0.0000736679,0.000016489088,0.0000050483623,0.0004576559,0.046822682,0.001129124,0.03729349,0.000030227626,0.90267617],"study_design_scores_gemma":[0.00024551066,0.0001906093,0.016879113,0.0003559641,0.0000148857025,0.000014722793,0.0000011833748,0.95753294,0.00040176883,0.023469051,0.00058368564,0.0003105814],"about_ca_topic_score_codex":0.000045375535,"about_ca_topic_score_gemma":0.00010452436,"teacher_disagreement_score":0.9815161,"about_ca_system_score_codex":0.000046709178,"about_ca_system_score_gemma":0.00014076888,"threshold_uncertainty_score":0.97185963},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001744145,0.0010760532,0.9937066,0.0002714687,0.001883399,0.00027829153,0.0000019821366,0.00012095754,0.0009171228],"genre_scores_gemma":[0.73977786,0.0001286797,0.2591861,0.0003100978,0.00042213147,0.000009059017,0.0000012260796,0.000035819194,0.00012903164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968175,0.00009828745,0.00042555865,0.0014981546,0.0006020333,0.00055846624],"domain_scores_gemma":[0.9977072,0.00044832806,0.00036529687,0.0012114453,0.00014299521,0.00012472922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022288936,0.0004753939,0.0006786407,0.0010323676,0.00040361812,0.0008887682,0.0015375341,0.0003444583,0.000004786201],"category_scores_gemma":[0.00022441469,0.0004276021,0.00012791294,0.0003633006,0.0004700099,0.0010922161,0.00075951964,0.00079697825,0.0000035527573],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008281456,0.00001589787,0.0014279272,0.000032575936,0.000024954743,0.00010137276,0.00044980898,0.00780798,0.00062013953,0.0005316245,8.60129e-7,0.98897856],"study_design_scores_gemma":[0.00069449324,0.00024944096,0.019892773,0.0008269785,0.00006128998,0.00045158633,1.6856346e-7,0.77068865,0.006846635,0.19823557,0.0006209642,0.0014314211],"about_ca_topic_score_codex":0.0003938423,"about_ca_topic_score_gemma":0.0032188336,"teacher_disagreement_score":0.98754716,"about_ca_system_score_codex":0.00035051582,"about_ca_system_score_gemma":0.0003175019,"threshold_uncertainty_score":0.99981755},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009349259,0.00035702254,0.99070036,0.0005458485,0.0018707177,0.00027921342,0.000004883598,0.000119759134,0.0060286797],"genre_scores_gemma":[0.2075113,0.000045062214,0.7890335,0.0018257141,0.00083418755,0.000003725837,0.0000049665373,0.000062782245,0.0006787684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955186,0.0000516373,0.00058236415,0.0019210284,0.0010535484,0.00087280007],"domain_scores_gemma":[0.99604356,0.00044217287,0.0007180746,0.0021577666,0.00038295583,0.00025545928],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007944576,0.0006328479,0.0006934169,0.0006578159,0.0011417444,0.0012852957,0.0040190653,0.00024713686,0.000015763278],"category_scores_gemma":[0.000345885,0.0005989839,0.00018336487,0.00027951537,0.0011818648,0.0017659279,0.0025023436,0.00087103277,0.000025885978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006453897,0.0000316444,0.000049672333,0.000019381898,0.000011102988,0.00014439298,0.0012895523,0.025907874,0.0033510614,0.00552448,0.000009988834,0.9636544],"study_design_scores_gemma":[0.0003086049,0.00016891191,0.000057300356,0.0010766223,0.00001094473,0.0001455845,0.0000014198812,0.9473414,0.0053988984,0.043288976,0.0012953576,0.00090597005],"about_ca_topic_score_codex":0.00013159461,"about_ca_topic_score_gemma":0.00005385508,"teacher_disagreement_score":0.9627484,"about_ca_system_score_codex":0.0005333882,"about_ca_system_score_gemma":0.0006395246,"threshold_uncertainty_score":0.99975145},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004486884,0.00011439813,0.9927651,0.00084331667,0.0006855807,0.00071845,0.00007637907,0.000033662454,0.00027617475],"genre_scores_gemma":[0.95925456,0.0000016443793,0.039539985,0.00008683154,0.00006222368,0.00069966074,0.000049167793,0.00001907468,0.00028684977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769884,0.00011931747,0.00060050195,0.0009207848,0.00036886887,0.00029166142],"domain_scores_gemma":[0.99676627,0.0012238042,0.00067534245,0.000765908,0.0004898416,0.000078809935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076184963,0.0003031185,0.0006134932,0.0014179077,0.00022055127,0.00014330649,0.00086959166,0.00040008035,0.00024948688],"category_scores_gemma":[0.00070743915,0.00025192028,0.00015299743,0.0004117894,0.0007268345,0.00026414896,0.00018357253,0.000437164,0.0000019371694],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018165224,0.00041754087,0.00015318547,0.00004747395,0.00016865741,0.000023670995,0.0020019698,0.0066333925,0.000015155657,0.027365994,0.00005160122,0.9629397],"study_design_scores_gemma":[0.0065183574,0.0035839495,0.31047603,0.00399397,0.0024161271,0.00011996485,0.00045885475,0.46877006,0.0036517344,0.1962487,0.0008862569,0.0028759849],"about_ca_topic_score_codex":0.00013891303,"about_ca_topic_score_gemma":0.00041124938,"teacher_disagreement_score":0.9600637,"about_ca_system_score_codex":0.00005822007,"about_ca_system_score_gemma":0.00011530119,"threshold_uncertainty_score":0.9999933},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053223025,0.0001768795,0.9924008,0.001796252,0.00037079127,0.00019062837,0.00003769937,0.000015679156,0.0044789896],"genre_scores_gemma":[0.87200934,0.00000719661,0.12757765,0.000093142444,0.00013745575,0.0000012653926,0.000021059162,0.000004092153,0.00014880572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980441,0.000046770423,0.00038648176,0.0008627426,0.00042338978,0.00023652105],"domain_scores_gemma":[0.9956612,0.0004733007,0.000765931,0.0026694406,0.0003816407,0.00004847153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095015,0.00024415125,0.00033604732,0.00016399036,0.0003498922,0.00014328684,0.00501141,0.0001855474,0.000009745296],"category_scores_gemma":[0.00023396472,0.00017565495,0.000067679575,0.00014709437,0.0017063976,0.00035702673,0.0023518784,0.0004887392,0.0000011320615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028801429,0.00017741193,0.0002002935,0.00056492136,0.000106691725,0.0009578719,0.0071314625,0.085307874,0.015674297,0.21508916,0.00011799991,0.6746432],"study_design_scores_gemma":[0.00011203981,0.000046006433,0.000111636255,0.00039200584,0.000018571613,0.00073228084,0.000003368906,0.8944652,0.003244927,0.10035064,0.0002913669,0.00023192466],"about_ca_topic_score_codex":0.00006956132,"about_ca_topic_score_gemma":0.00004990696,"teacher_disagreement_score":0.8714771,"about_ca_system_score_codex":0.000057139372,"about_ca_system_score_gemma":0.00036481433,"threshold_uncertainty_score":0.931253},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015977714,0.0007024932,0.97898793,0.0010936455,0.0020862275,0.00092719373,0.000012008715,0.00015198035,0.000060778846],"genre_scores_gemma":[0.58829653,0.00003917592,0.41116077,0.00020101656,0.00022716733,0.00005265032,0.0000017585047,0.000018646251,0.000002262364],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99524885,0.00011820344,0.00040766635,0.0022121118,0.0008439999,0.0011691429],"domain_scores_gemma":[0.9949247,0.0015154651,0.00033986752,0.0026623623,0.0003082776,0.00024930658],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002843136,0.0005015482,0.0005837242,0.0007054797,0.0008296593,0.002511318,0.006811421,0.00027906513,0.000002087971],"category_scores_gemma":[0.0010478367,0.00045718334,0.0001434313,0.0006295903,0.00154898,0.0010468974,0.00783642,0.0010594726,0.0000031776342],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001896172,0.000039186416,0.0006308516,0.00018360437,0.000014206031,0.000039721956,0.0018586577,0.060511522,0.0015161311,0.021215163,0.000004828925,0.9139672],"study_design_scores_gemma":[0.00024010504,0.00008744201,0.00044365617,0.0003003024,0.000002807361,0.00002288067,4.7165125e-7,0.46749908,0.0054362724,0.5254773,0.00009695897,0.00039271472],"about_ca_topic_score_codex":0.000029495266,"about_ca_topic_score_gemma":0.00004903581,"teacher_disagreement_score":0.91357446,"about_ca_system_score_codex":0.00019173573,"about_ca_system_score_gemma":0.000532851,"threshold_uncertainty_score":0.999788},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88232845,0.00019906946,0.11683107,0.00019168631,0.00022632393,0.00021056905,0.000002362811,0.000004735811,0.0000057565226],"genre_scores_gemma":[0.99008477,0.000017702783,0.009757569,0.00009123997,0.00004094225,0.000002812373,6.6718474e-7,0.000004052579,2.5712882e-7],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992031,0.000018164414,0.00013669147,0.00024251892,0.00024330003,0.00015621429],"domain_scores_gemma":[0.9994549,0.000078409656,0.000060258462,0.00031165176,0.0000437806,0.00005098065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016535068,0.000081822145,0.00016575961,0.0001321792,0.00012909605,0.00005978019,0.0001418529,0.000025164505,0.000001874002],"category_scores_gemma":[0.0001629913,0.000054592347,0.00012438206,0.00020686255,0.0001312008,0.00018563122,0.0001441066,0.00008623844,0.0000010462658],"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.000011137999,0.000056712484,0.98225075,0.000036943675,0.000007365581,0.000009481873,0.00016608121,0.011965955,0.00047583773,0.000001192717,4.36633e-7,0.005018116],"study_design_scores_gemma":[0.00062204374,0.00005891067,0.7697197,0.00004797429,0.000045056127,0.000047544698,9.596098e-7,0.2288218,0.00023376952,0.00035852182,4.088916e-8,0.000043680255],"about_ca_topic_score_codex":0.00009270585,"about_ca_topic_score_gemma":0.0000088863835,"teacher_disagreement_score":0.21685585,"about_ca_system_score_codex":0.000052488005,"about_ca_system_score_gemma":0.00009521651,"threshold_uncertainty_score":0.22262113},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006868012,0.00035114342,0.9659595,0.0039891168,0.005377667,0.0006488744,0.0000105584695,0.00010526519,0.022871085],"genre_scores_gemma":[0.93497837,0.00028314465,0.057074998,0.0033119945,0.0007850476,0.000025136344,0.0000016104689,0.00007675911,0.0034629458],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957304,0.000079463636,0.00065206,0.0012171953,0.001614838,0.0007060612],"domain_scores_gemma":[0.99324155,0.0016243828,0.00077626645,0.003929892,0.00030977526,0.00011816455],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011509709,0.0005113005,0.0005048222,0.00022746899,0.0009299146,0.0008701497,0.011690451,0.00030567744,0.000020449968],"category_scores_gemma":[0.00040712245,0.00030846635,0.00027219963,0.00032204913,0.0035543805,0.0004191893,0.0016115081,0.0010697611,0.00012530475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001625142,0.00004355557,0.0003612734,0.000021498006,0.000028290344,0.000021536693,0.0016778037,0.004094382,0.00014496973,0.39978647,0.00017951558,0.5936245],"study_design_scores_gemma":[0.00008591941,0.00014139501,0.00073341996,0.00076852116,0.000011669611,0.00004016644,7.182012e-7,0.047900584,0.012799302,0.92882794,0.008102572,0.0005878089],"about_ca_topic_score_codex":0.00009719452,"about_ca_topic_score_gemma":0.00033836428,"teacher_disagreement_score":0.93429154,"about_ca_system_score_codex":0.00015108121,"about_ca_system_score_gemma":0.00052236824,"threshold_uncertainty_score":0.99993676},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012012246,0.00008765568,0.9935656,0.00081375515,0.0015138877,0.0009836827,0.000011872244,0.00050492695,0.0025065877],"genre_scores_gemma":[0.63129205,0.000051281437,0.36599463,0.0009727548,0.0010799934,0.0001659234,0.000074115334,0.0000663772,0.00030287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957001,0.000046597288,0.0006437356,0.0020486163,0.0007398483,0.0008210698],"domain_scores_gemma":[0.9959105,0.0005103011,0.0008657832,0.0021413302,0.00040686585,0.00016516655],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010101048,0.000611368,0.00057989714,0.0007486211,0.0006574994,0.0011811506,0.0042998414,0.0005329258,0.0000068928657],"category_scores_gemma":[0.00018455638,0.00058657356,0.00016364951,0.00029852337,0.0005370836,0.0011195552,0.00037901505,0.00095308403,0.000010055468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017999484,0.000021652553,0.000020043753,0.000017315608,0.000008069293,0.0000049390655,0.00016037267,0.034075733,0.00030524214,0.07144529,0.000048234593,0.8938751],"study_design_scores_gemma":[0.00028512353,0.00034529538,0.0005076826,0.0001472305,0.000007239122,0.000026051157,1.8679728e-7,0.9177796,0.0008474314,0.0783672,0.0011141045,0.00057283853],"about_ca_topic_score_codex":0.0000067440865,"about_ca_topic_score_gemma":0.000064086504,"teacher_disagreement_score":0.89330226,"about_ca_system_score_codex":0.00049052614,"about_ca_system_score_gemma":0.0003643358,"threshold_uncertainty_score":0.9998557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037624696,0.006593534,0.99056256,0.00017724662,0.00089253567,0.0007674772,0.000026366279,0.00030501003,0.00029901142],"genre_scores_gemma":[0.5366152,0.0011468836,0.45994696,0.00048566563,0.0011108363,0.000100561134,0.0002665256,0.00024859616,0.00007876545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977322,0.000025830834,0.000394739,0.0007772441,0.00036449506,0.00070547365],"domain_scores_gemma":[0.99678993,0.0006187736,0.00017359451,0.0020672572,0.00015971877,0.00019073425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061722833,0.00057130284,0.0005941442,0.00026698923,0.0006622682,0.000375392,0.0018821317,0.000537619,0.0000039323545],"category_scores_gemma":[0.000114682705,0.0005660061,0.00014188018,0.00013444449,0.0007015424,0.00027941304,0.0009275254,0.0011590249,0.0000030186134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004665232,0.000007539311,0.00015545006,0.00010504633,0.000037114445,0.000013759957,0.00012702937,0.8549597,0.00001781067,0.0023701135,0.000044523927,0.14215723],"study_design_scores_gemma":[0.00032096842,0.00005265593,0.00026735428,0.00077696453,0.00004396945,0.000044782864,2.1883756e-7,0.98383385,0.000012870399,0.004833359,0.009213734,0.0005992713],"about_ca_topic_score_codex":0.000010059308,"about_ca_topic_score_gemma":0.0004257448,"teacher_disagreement_score":0.53623897,"about_ca_system_score_codex":0.00021291972,"about_ca_system_score_gemma":0.00007793773,"threshold_uncertainty_score":0.99967915},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047192872,0.0018027825,0.97823703,0.0000854124,0.008080789,0.0005002233,0.000002085564,0.0003528053,0.010891678],"genre_scores_gemma":[0.228856,0.00067188987,0.44025457,0.0021437693,0.019471819,0.00022043094,0.00003506235,0.00046637218,0.30788007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99445915,0.00012613022,0.0008603953,0.0019493175,0.0014638882,0.0011411131],"domain_scores_gemma":[0.99695295,0.00047167632,0.00036256463,0.0017136042,0.00025525468,0.00024392226],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015115013,0.0006888581,0.00076846645,0.001126096,0.00038520465,0.0016235102,0.004595595,0.00038541024,0.000021101212],"category_scores_gemma":[0.00008363427,0.00063112285,0.0001935904,0.0011614388,0.0002924166,0.00073204725,0.0010412557,0.0013558079,0.00034233826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041442427,0.000039537663,0.000069536865,0.00014421449,0.000023552104,0.00025219037,0.0019156233,0.46904227,0.000057312533,0.050614145,0.00017457834,0.4776629],"study_design_scores_gemma":[0.00018671538,0.00025692166,0.0000487006,0.0028832557,0.000010199546,0.00024861665,9.43827e-7,0.675601,0.0011259292,0.012510876,0.30559167,0.0015351848],"about_ca_topic_score_codex":0.00011230996,"about_ca_topic_score_gemma":0.000007199883,"teacher_disagreement_score":0.53798246,"about_ca_system_score_codex":0.0012847059,"about_ca_system_score_gemma":0.0012994321,"threshold_uncertainty_score":0.999614},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063379453,0.00014024101,0.9908449,0.0009991917,0.0002738203,0.0010553739,0.000010536194,0.00010984243,0.00022813378],"genre_scores_gemma":[0.79751587,0.000014485673,0.20134127,0.0009101332,0.0001007169,0.00007054904,0.0000033443407,0.00003050042,0.000013133611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949496,0.000092393166,0.0006258942,0.0022908938,0.0009830296,0.001058218],"domain_scores_gemma":[0.9963466,0.00021252334,0.0004622436,0.0024261074,0.00027925216,0.0002733],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011525677,0.0007139522,0.00077576446,0.0006200769,0.00067977386,0.0011043565,0.0058521065,0.00039166198,9.766931e-7],"category_scores_gemma":[0.00008008154,0.0005214159,0.00016596408,0.0006164937,0.0006156816,0.001027493,0.00071910676,0.0010582161,0.0000037944408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002311649,0.00002263373,0.000036357153,0.000043169966,0.000004621205,0.000012407905,0.00058186695,0.88798076,0.0003831333,0.0068044835,7.1000125e-7,0.10410672],"study_design_scores_gemma":[0.0001266196,0.0001755345,0.00009408457,0.00029922277,0.000008004041,0.00000624746,8.677423e-7,0.8678449,0.00025551143,0.13057886,0.0000052302626,0.00060490903],"about_ca_topic_score_codex":0.00033587252,"about_ca_topic_score_gemma":0.00041626216,"teacher_disagreement_score":0.7911779,"about_ca_system_score_codex":0.0004603171,"about_ca_system_score_gemma":0.0012844095,"threshold_uncertainty_score":0.9999326},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078678556,0.00014917653,0.993735,0.00008941804,0.0016389599,0.00031274845,0.000014350718,0.00016157705,0.0031119674],"genre_scores_gemma":[0.7121879,0.000065071246,0.28689316,0.000019053443,0.00049379945,0.0000018227844,0.000033075758,0.00007260666,0.00023353683],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981077,0.00001271958,0.00042694208,0.00060944696,0.0005140984,0.00032909634],"domain_scores_gemma":[0.9983963,0.00017570243,0.00029462963,0.0007696566,0.0002854381,0.00007831128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002270875,0.00039250398,0.00042740963,0.0006085716,0.00017866788,0.00014937551,0.000651538,0.00028332634,0.000015167383],"category_scores_gemma":[0.000066174296,0.00039690817,0.000094919145,0.00018089265,0.0005871982,0.00048299108,0.0001209263,0.00053951924,0.000021075648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028022552,0.000046457208,0.0002629649,0.00035000837,0.00010780429,0.00010029459,0.0026324275,0.3474414,0.35175553,0.0006658385,0.000085330954,0.29652393],"study_design_scores_gemma":[0.00021592295,0.000053230382,0.0013884753,0.0004617076,0.000022435772,0.000033106335,5.080306e-7,0.87100464,0.11157806,0.014715114,0.00007531079,0.00045149488],"about_ca_topic_score_codex":0.000021328387,"about_ca_topic_score_gemma":0.000013356281,"teacher_disagreement_score":0.7114011,"about_ca_system_score_codex":0.00041823983,"about_ca_system_score_gemma":0.00013860798,"threshold_uncertainty_score":0.9998483},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042457087,0.00046542165,0.99264485,0.00010620608,0.0014032657,0.00062206754,0.00013358261,0.00025519019,0.00012369975],"genre_scores_gemma":[0.88770044,0.00019409943,0.11087802,0.000044424585,0.000976492,0.000021012074,0.000055994766,0.000046381305,0.000083135266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998583,0.0000052659593,0.00025176757,0.0006190172,0.00026997583,0.00027093902],"domain_scores_gemma":[0.9992353,0.00008229735,0.000116786214,0.0003852207,0.000092666014,0.000087783184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001412995,0.00032230528,0.00026931672,0.0003076951,0.0002998337,0.00018020102,0.00029022255,0.00038679806,0.0000059492495],"category_scores_gemma":[0.00001724862,0.00031248492,0.00005652559,0.00006493806,0.00015750168,0.00045461088,0.000039062674,0.00041877248,0.000006109804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017637241,0.0000030234823,0.0000047160484,0.000033260363,0.000012034174,0.0000013326264,0.00012685132,0.11084734,0.04167081,0.000022133314,0.0000033414683,0.8472575],"study_design_scores_gemma":[0.0004178364,0.00013641905,0.0051491167,0.00025426477,0.000058532576,0.000027454455,3.1443233e-7,0.82852626,0.13406041,0.022469046,0.00821684,0.000683526],"about_ca_topic_score_codex":0.0001230603,"about_ca_topic_score_gemma":0.0003146777,"teacher_disagreement_score":0.88345474,"about_ca_system_score_codex":0.00023281385,"about_ca_system_score_gemma":0.000029736068,"threshold_uncertainty_score":0.9999327},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035617873,0.0005918792,0.997078,0.0008972461,0.00013408266,0.0002993434,0.000011702594,0.000014746143,0.00061682897],"genre_scores_gemma":[0.38349068,0.00010071916,0.61504227,0.00027078428,0.00041973096,0.000012465244,0.00005982578,0.000018947698,0.0005845744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988324,0.00001176005,0.00023243667,0.0004054766,0.00035889016,0.00015900834],"domain_scores_gemma":[0.9987068,0.00027497337,0.00026820492,0.00049643253,0.00021014514,0.0000433996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004100266,0.00014976172,0.00028018342,0.0000945502,0.00017908563,0.000113647715,0.00034673247,0.00007451022,0.000013414314],"category_scores_gemma":[0.00013121912,0.00009970447,0.00009803953,0.00007045219,0.0005127936,0.00010281831,0.00007894035,0.00019195274,8.233361e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095036674,0.00005546046,0.0012601946,0.00011710529,0.00008231599,0.000007495721,0.0007274521,0.64724714,0.0031356525,0.00009976814,0.00003538337,0.347137],"study_design_scores_gemma":[0.00033410342,0.00010069084,0.0003193863,0.00022487679,0.0001831715,0.000007742772,0.0000017817847,0.97575366,0.02138499,0.0015339844,0.000037555074,0.000118067015],"about_ca_topic_score_codex":0.00005663427,"about_ca_topic_score_gemma":0.0000021207168,"teacher_disagreement_score":0.38313448,"about_ca_system_score_codex":0.00004775875,"about_ca_system_score_gemma":0.0001026779,"threshold_uncertainty_score":0.406583},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004192017,0.00012927658,0.9970384,0.00004580251,0.0016698008,0.00033556786,0.000016470678,0.00021706423,0.0001284144],"genre_scores_gemma":[0.24774005,0.000008805841,0.751403,0.0001492722,0.0005133592,0.0000062271683,0.000025050289,0.00007549064,0.000078771416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822026,0.000008332662,0.00027134424,0.0007115028,0.00031658635,0.00047195595],"domain_scores_gemma":[0.998736,0.00024384416,0.000080159356,0.00071458414,0.00008220593,0.00014315742],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026615747,0.00038617454,0.00036106352,0.00024324862,0.000298396,0.00017626128,0.0008105755,0.0002432183,0.000005839075],"category_scores_gemma":[0.000038264094,0.00036726028,0.00011113511,0.000055822937,0.00028353423,0.00026779567,0.00010120429,0.0005410338,0.0000076016213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019840545,0.0000037003986,1.4241178e-7,0.000021188745,0.0000016469767,0.000017079372,0.000017317245,0.5181406,0.00086959027,0.00001698063,8.1110437e-7,0.48090893],"study_design_scores_gemma":[0.00024251165,0.00019506829,0.0000103615475,0.0003029626,0.000007651891,0.000018435829,5.534783e-8,0.9823799,0.010624599,0.005566922,0.00022578189,0.00042575636],"about_ca_topic_score_codex":4.2497086e-7,"about_ca_topic_score_gemma":0.000009431218,"teacher_disagreement_score":0.48048317,"about_ca_system_score_codex":0.00016656495,"about_ca_system_score_gemma":0.000074793265,"threshold_uncertainty_score":0.9998779},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053000957,0.0007397656,0.9795924,0.0014198578,0.001203426,0.0026442162,0.00016298723,0.000086635424,0.0136207165],"genre_scores_gemma":[0.7537467,0.00026568613,0.2258453,0.0028353375,0.0034782253,0.0003433389,0.00038531583,0.00019373323,0.01290637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753135,0.0000082538845,0.00032415905,0.0010576076,0.0006419242,0.0004366726],"domain_scores_gemma":[0.9978401,0.000084230756,0.00021786845,0.0011138486,0.00046079227,0.00028317634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002803037,0.00040831434,0.0006590346,0.00030685906,0.00027658467,0.00027607498,0.00042618043,0.00021509858,0.000010406066],"category_scores_gemma":[0.0001989577,0.00035544301,0.0007649482,0.000072074195,0.00030233822,0.00024741728,0.00017903336,0.00021788377,0.000026910018],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014174932,0.00067102304,0.008959247,0.003699353,0.002218296,0.00047573453,0.0030835238,0.08143639,0.002254053,0.01486941,0.024061585,0.8568539],"study_design_scores_gemma":[0.0099525945,0.0043337634,0.043185715,0.009665652,0.004555381,0.0002792369,0.0000033382762,0.4514559,0.0038603551,0.43551448,0.03146444,0.005729159],"about_ca_topic_score_codex":0.000057311343,"about_ca_topic_score_gemma":0.000020792946,"teacher_disagreement_score":0.8511247,"about_ca_system_score_codex":0.00029321804,"about_ca_system_score_gemma":0.00091066526,"threshold_uncertainty_score":0.99988973},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010457376,0.0015324462,0.9858288,0.000069908376,0.0002718001,0.00023176242,0.0000033906335,0.000053767184,0.0015507033],"genre_scores_gemma":[0.93718016,0.0009214898,0.05475529,0.0009511264,0.0013667425,0.00001290258,0.00033774474,0.00010541638,0.00436913],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830246,0.000019559135,0.00026248497,0.0009560834,0.00023936747,0.00022003091],"domain_scores_gemma":[0.99871796,0.000017599185,0.00027703267,0.0008178447,0.00010540169,0.00006413896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030612992,0.00026508453,0.00021459162,0.00034824046,0.00030487328,0.00041611792,0.0004671042,0.0003437912,0.000040967992],"category_scores_gemma":[0.000038422546,0.00026453263,0.00007844994,0.000096339805,0.00045348896,0.000078372024,0.0005782464,0.00024036868,0.000006264178],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070816364,0.000035556597,0.00070625596,0.00007457812,0.000050033042,0.00001467599,0.00002486709,0.0077035553,0.52964574,0.00009320434,0.0004231711,0.46115753],"study_design_scores_gemma":[0.0005267631,0.0008573311,0.0043406095,0.0005711751,0.00028606688,0.0001062588,6.908783e-7,0.7312008,0.2211689,0.021538345,0.017737297,0.0016657204],"about_ca_topic_score_codex":0.000012104948,"about_ca_topic_score_gemma":0.000017025115,"teacher_disagreement_score":0.93107355,"about_ca_system_score_codex":0.00003539072,"about_ca_system_score_gemma":0.00014513386,"threshold_uncertainty_score":0.9999807},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027179512,0.0005293451,0.99333,0.00019790833,0.0018594845,0.00073288707,0.0000116503725,0.00031571698,0.0030202747],"genre_scores_gemma":[0.039064128,0.000026523856,0.95917,0.00006333741,0.0005020169,0.0000223592,0.0000058798046,0.0000871106,0.0010586611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838996,0.000011329024,0.0003231377,0.0005315977,0.0003425267,0.0004014769],"domain_scores_gemma":[0.9981039,0.00058173935,0.00013841804,0.0009792013,0.00010671708,0.00009002334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008179034,0.0003426079,0.00034453528,0.00019640065,0.00032229564,0.00043341308,0.0015595991,0.00023104026,0.00000548116],"category_scores_gemma":[0.00007307797,0.0002634119,0.00009982739,0.00009559898,0.00017931784,0.00014918025,0.00021040234,0.00045512922,0.000008635921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010741704,6.4676476e-7,0.000007062702,0.00006386405,0.000010107993,0.0000026774494,0.00010291083,0.6644559,0.000023454673,0.0006819835,0.000012986695,0.33463734],"study_design_scores_gemma":[0.00014033227,0.000023990193,0.000034067973,0.00049529393,0.000022578051,0.000030272335,1.3228393e-7,0.993437,0.00012451869,0.0037123035,0.0016758395,0.00030367041],"about_ca_topic_score_codex":0.000016011838,"about_ca_topic_score_gemma":0.00009405971,"teacher_disagreement_score":0.33433366,"about_ca_system_score_codex":0.00038065016,"about_ca_system_score_gemma":0.00023881088,"threshold_uncertainty_score":0.9999818},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029010968,0.00021534192,0.9928827,0.0003344949,0.0013080918,0.00025943102,0.000017532288,0.000056776793,0.002024509],"genre_scores_gemma":[0.84088206,0.00006374005,0.15841956,0.00013508166,0.00029304766,0.0000071047552,0.000011603421,0.000021437474,0.00016635614],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634224,0.000032553053,0.00070706184,0.0012552402,0.0010940217,0.0005688914],"domain_scores_gemma":[0.9962452,0.00021627141,0.00069738476,0.00234781,0.00033972133,0.00015363016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062072976,0.00044707186,0.0006821413,0.0012935637,0.00053617335,0.00086809974,0.0043364763,0.00023773233,0.000098126904],"category_scores_gemma":[0.000060893355,0.0004056014,0.0003222405,0.00046405182,0.0010167473,0.00066284044,0.0014464813,0.0005269519,0.000008410199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010957315,0.000116796095,0.0003394469,0.000085221574,0.0001318354,0.00006453357,0.0021563869,0.0010329395,0.0019403561,0.17960854,0.00005510496,0.8144579],"study_design_scores_gemma":[0.0008264925,0.00036453776,0.0027836298,0.0004384496,0.000109993576,0.00006432839,6.0703877e-7,0.22271426,0.006828107,0.76267916,0.0018449957,0.0013454318],"about_ca_topic_score_codex":0.00016757123,"about_ca_topic_score_gemma":0.0003731672,"teacher_disagreement_score":0.837981,"about_ca_system_score_codex":0.0001336323,"about_ca_system_score_gemma":0.0005363691,"threshold_uncertainty_score":0.9998396},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005167236,0.0016391417,0.98943186,0.00082527724,0.0015546096,0.00022902104,0.0000030639167,0.0002080338,0.0055922833],"genre_scores_gemma":[0.7278016,0.00023441386,0.2671649,0.0026820283,0.0010408768,0.000008841266,0.0000028242553,0.00006859035,0.0009959379],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965461,0.000037630525,0.00037195615,0.0015457781,0.0008603364,0.00063818437],"domain_scores_gemma":[0.9968971,0.0004081859,0.00032447831,0.0020516808,0.00011311526,0.000205413],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012405261,0.00051238196,0.0005392666,0.0005235262,0.00068262516,0.0020919386,0.004387597,0.00028912743,0.0000091518705],"category_scores_gemma":[0.00015578113,0.0004462395,0.00010941451,0.00013515003,0.0010032824,0.00122142,0.0020158929,0.0007906703,0.000033844008],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024123829,0.000008395226,0.00006173287,0.000021322141,0.000008873264,0.00007438749,0.0008202204,0.00049295864,0.00026991585,0.0276825,0.000014863857,0.97054243],"study_design_scores_gemma":[0.0004380991,0.00016107147,0.0013031295,0.00086857745,0.000013469205,0.00027480628,1.9514938e-7,0.25272447,0.0013481625,0.7350968,0.006560417,0.0012107703],"about_ca_topic_score_codex":0.00005095949,"about_ca_topic_score_gemma":0.00006732618,"teacher_disagreement_score":0.9693316,"about_ca_system_score_codex":0.000100358266,"about_ca_system_score_gemma":0.00028613157,"threshold_uncertainty_score":0.99979895},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009070357,0.0013330927,0.98702496,0.00012872837,0.0016058066,0.00029874692,9.146604e-7,0.00005512932,0.0004822613],"genre_scores_gemma":[0.98968583,0.00021604357,0.009281126,0.00006214434,0.00046858095,0.0000010794539,0.000011531089,0.00002934817,0.00024431513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982539,0.000038829538,0.00037297726,0.00064658874,0.00041863768,0.0002691114],"domain_scores_gemma":[0.9984964,0.00021748072,0.0003511075,0.0006194748,0.00021103211,0.00010449455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009115457,0.00023656094,0.0004993247,0.00033687157,0.00028439765,0.00008741425,0.00024427284,0.00026847172,0.000024649184],"category_scores_gemma":[0.00035088434,0.00020297871,0.00016128611,0.00011838166,0.0005151284,0.00011740764,0.0002040575,0.00088406604,0.0000095751675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016704337,0.000027128153,0.010391345,0.00014406067,0.000121091776,0.00007969692,0.0014697921,0.046367463,0.002023791,0.00014163431,0.000010105723,0.9390569],"study_design_scores_gemma":[0.0037700585,0.0017953593,0.04090439,0.0062726443,0.00067438406,0.0021353408,0.000015187634,0.9098792,0.0064543067,0.009579864,0.016719548,0.0017997206],"about_ca_topic_score_codex":0.000049872346,"about_ca_topic_score_gemma":0.00008970575,"teacher_disagreement_score":0.9806155,"about_ca_system_score_codex":0.00013285551,"about_ca_system_score_gemma":0.00010890818,"threshold_uncertainty_score":0.82772315},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002076949,0.0010812135,0.9749484,0.00040679605,0.0026631146,0.00030270588,0.000002378235,0.00047740925,0.018041013],"genre_scores_gemma":[0.78908944,0.000042478026,0.17192796,0.00019527889,0.0012896226,0.00004957175,0.000041464802,0.00012617461,0.03723799],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970093,0.00041309578,0.00038957442,0.0012017009,0.0004143799,0.0005719912],"domain_scores_gemma":[0.9974783,0.00090158073,0.0006841574,0.00061689696,0.00027228854,0.000046771886],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004666489,0.00040126825,0.0005485489,0.0008931079,0.0010674052,0.00055403926,0.00093429314,0.00068655686,0.000024206607],"category_scores_gemma":[0.0019862612,0.00037476906,0.00004423657,0.00061389175,0.00096729107,0.00018695676,0.00047211794,0.0036175407,0.00003209396],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000143690595,0.00002418019,0.0033198774,0.00005858717,0.000024461744,0.00003147568,0.005945886,0.004299084,0.0006489432,0.0013047826,0.00013773717,0.98419064],"study_design_scores_gemma":[0.0032470922,0.0028347685,0.0056454046,0.003846342,0.00008771178,0.0006143618,0.0001938499,0.27494997,0.0013216687,0.02316622,0.68000376,0.0040888563],"about_ca_topic_score_codex":0.000054897046,"about_ca_topic_score_gemma":0.000045142828,"teacher_disagreement_score":0.98010176,"about_ca_system_score_codex":0.0003326727,"about_ca_system_score_gemma":0.0004736363,"threshold_uncertainty_score":0.9998704},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017259712,0.00038658874,0.996222,0.0012881889,0.00043860727,0.0011105691,0.000012505331,0.00025740053,0.00011153698],"genre_scores_gemma":[0.3611074,0.000006769175,0.6319306,0.005255919,0.0011687586,0.00017204903,0.000036218917,0.00007190538,0.00025033992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964597,0.000024741328,0.0004501859,0.0017968152,0.0005488894,0.00071963546],"domain_scores_gemma":[0.9979652,0.00029284167,0.00024196296,0.0009931165,0.00022745662,0.00027938647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003014369,0.00055398274,0.00044183512,0.00043209037,0.00041676298,0.00051156135,0.0023169618,0.0003178062,0.0000039595107],"category_scores_gemma":[0.000032021846,0.0005086108,0.00007549559,0.0009746826,0.00022930356,0.000288249,0.0007014077,0.00082295114,0.000007800472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004643239,0.000020853045,0.000031301683,0.000022391161,0.0000020240275,0.0000052812416,0.00004284226,0.77023923,0.00007834908,0.00074143184,0.000042021245,0.22876965],"study_design_scores_gemma":[0.00024694242,0.00007996843,0.00013282335,0.00011915047,0.000007162161,0.000027204325,2.5839476e-8,0.99256426,0.0002696056,0.0047594598,0.0012289163,0.00056450616],"about_ca_topic_score_codex":0.000029424242,"about_ca_topic_score_gemma":0.000095696305,"teacher_disagreement_score":0.3642914,"about_ca_system_score_codex":0.00009421561,"about_ca_system_score_gemma":0.00023844208,"threshold_uncertainty_score":0.99973655},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005414578,0.00047224233,0.9843982,0.00028309828,0.0020076183,0.00027742874,0.0000014251018,0.00022245094,0.011796073],"genre_scores_gemma":[0.58477384,0.00007425586,0.41070437,0.0014037839,0.00066000386,0.000018539211,0.000012585847,0.00004000965,0.0023126202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974842,0.000040359515,0.00041644782,0.0011632892,0.00049632846,0.0003993775],"domain_scores_gemma":[0.99798214,0.00022273486,0.00018853266,0.0013296469,0.00020190468,0.00007502834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052322564,0.00034918534,0.00035455503,0.0005656756,0.00015187623,0.00043915483,0.0022033209,0.00022147517,0.000054481836],"category_scores_gemma":[0.00017659176,0.00029753413,0.00009876841,0.00034852533,0.0003758215,0.00079257245,0.0009789239,0.0004314997,0.00016544889],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055130895,0.000022948534,0.00007625193,0.000019993171,0.000007383865,0.000112287424,0.003669124,0.0006557334,0.0003624733,0.030596292,0.000040982926,0.964431],"study_design_scores_gemma":[0.0007910918,0.00052392524,0.0010255306,0.0008080574,0.000027716214,0.00022725204,0.000002844682,0.68524235,0.034536608,0.2732345,0.0017492864,0.0018308465],"about_ca_topic_score_codex":0.0000674041,"about_ca_topic_score_gemma":0.00016381877,"teacher_disagreement_score":0.9626002,"about_ca_system_score_codex":0.00015473775,"about_ca_system_score_gemma":0.00026150257,"threshold_uncertainty_score":0.99994767},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002798632,0.00036559443,0.9711229,0.006731151,0.004265464,0.0005344031,0.0000033211272,0.00029872396,0.013879796],"genre_scores_gemma":[0.92408484,0.000075098695,0.06900079,0.004170461,0.00085582904,0.00002785265,0.0000023354778,0.000036712743,0.0017461047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955553,0.000183066,0.00047141995,0.0018259842,0.0010917999,0.00087245787],"domain_scores_gemma":[0.99344283,0.0015691601,0.00037642187,0.0042735157,0.00021200246,0.00012609425],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023640853,0.0005823123,0.0006368476,0.00041929833,0.0008682614,0.0018471224,0.010813055,0.0003112385,0.000017942577],"category_scores_gemma":[0.0012510758,0.0003626851,0.00019147227,0.0004890516,0.0016944604,0.0005688999,0.0028291866,0.0013537934,0.0001299281],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026097312,0.00017973647,0.0012502625,0.00017686444,0.000057230463,0.00043895084,0.0035571158,0.0060512475,0.0004135242,0.039360013,0.0055233086,0.9429656],"study_design_scores_gemma":[0.0003310025,0.0003253141,0.0016399339,0.0016066289,0.000013442653,0.00011623695,0.000001017097,0.90626186,0.0013971778,0.08056475,0.006797871,0.00094476435],"about_ca_topic_score_codex":0.000036021735,"about_ca_topic_score_gemma":0.00028134158,"teacher_disagreement_score":0.9420209,"about_ca_system_score_codex":0.0004256256,"about_ca_system_score_gemma":0.0019100637,"threshold_uncertainty_score":0.9998825},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039730435,0.00052714493,0.9274165,0.000095900024,0.001131921,0.00023401067,0.000026678665,0.00005253468,0.06654226],"genre_scores_gemma":[0.9629151,0.000021977037,0.026487837,0.0004504299,0.00079359725,0.000008770028,0.00000824903,0.0000426226,0.009271378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998028,0.000015018717,0.00048589625,0.00092915475,0.000114757495,0.0004271946],"domain_scores_gemma":[0.99865246,0.00015258965,0.00042725046,0.0006298073,0.000048102112,0.00008978815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012792874,0.00031576998,0.0006016291,0.00042528388,0.00014215754,0.00025847138,0.00088150695,0.00020306351,0.00021089871],"category_scores_gemma":[0.000045265122,0.00027905617,0.00006430871,0.00017642877,0.00040585123,0.0001437541,0.00017290373,0.0003970129,0.00023101356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024473728,0.00002127267,0.0045765406,0.00013275981,0.000035763103,0.000020173744,0.0007325393,0.026107226,0.000013657517,0.9140891,0.000051796207,0.054194704],"study_design_scores_gemma":[0.0004388909,0.00038944292,0.000735619,0.000481065,0.0000069446314,0.00003562999,2.944617e-7,0.053460266,0.00021001256,0.9206888,0.022529012,0.0010240162],"about_ca_topic_score_codex":0.00008438957,"about_ca_topic_score_gemma":0.00009891083,"teacher_disagreement_score":0.9589421,"about_ca_system_score_codex":0.000113088165,"about_ca_system_score_gemma":0.00007503813,"threshold_uncertainty_score":0.99996614},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014040537,0.00022094142,0.98237747,0.0006692353,0.00095642323,0.00056775665,0.000015292888,0.00012248334,0.0010298681],"genre_scores_gemma":[0.94389826,0.000016851052,0.05514946,0.00042827887,0.00036475444,0.000033039418,0.000012952227,0.000027789038,0.00006860646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961616,0.00013585904,0.0005066344,0.001787181,0.00080920913,0.00059956237],"domain_scores_gemma":[0.99688137,0.0010609998,0.00037341946,0.0012570182,0.00022367579,0.00020349956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001675744,0.00048485614,0.0006862329,0.0006373562,0.00031505784,0.0009708837,0.0016654594,0.0003226773,0.000008134425],"category_scores_gemma":[0.00031451962,0.00042716676,0.00007249674,0.00023777923,0.00100742,0.0013378264,0.0009889209,0.0010543433,0.000021442718],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034806675,0.000038668008,0.006980143,0.0000675871,0.000011476858,0.00022219674,0.0015830568,0.0003821401,0.00004679977,0.00018785083,0.000004952578,0.9904403],"study_design_scores_gemma":[0.0037779135,0.0014315043,0.05558061,0.008853383,0.000046969646,0.0012660219,0.0000040834766,0.54932934,0.0017958087,0.36896905,0.0045125373,0.0044327765],"about_ca_topic_score_codex":0.00014265577,"about_ca_topic_score_gemma":0.00070094934,"teacher_disagreement_score":0.9860076,"about_ca_system_score_codex":0.00022221929,"about_ca_system_score_gemma":0.0005048068,"threshold_uncertainty_score":0.999818},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007038622,0.00043756663,0.9885958,0.0005845501,0.0014336756,0.0006188187,0.000007647801,0.00006590172,0.0075521735],"genre_scores_gemma":[0.9207239,0.00004006886,0.07623818,0.0009623671,0.00077071355,0.00003343241,0.000007615627,0.000053367723,0.0011703463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954664,0.00008119275,0.00059382047,0.001880976,0.0011720208,0.0008056063],"domain_scores_gemma":[0.99675196,0.00056929776,0.0004960221,0.0016171909,0.00035270612,0.00021284823],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010424908,0.00068859605,0.000834929,0.00094454194,0.0005503467,0.002019226,0.003663094,0.00041198832,0.000014064766],"category_scores_gemma":[0.00015137829,0.00053389464,0.00010571007,0.00032671387,0.0010857397,0.0010730341,0.0010610683,0.0011021497,0.00005475925],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013504513,0.00005662689,0.0006442552,0.00007692991,0.000042418087,0.0010243608,0.012497809,0.021830846,0.0009615757,0.006028683,0.0000308572,0.9567921],"study_design_scores_gemma":[0.012485473,0.007212105,0.018642537,0.033777196,0.00015643828,0.006066316,0.000060678245,0.64497584,0.071079,0.1453114,0.043013625,0.017219367],"about_ca_topic_score_codex":0.000107245185,"about_ca_topic_score_gemma":0.00049895124,"teacher_disagreement_score":0.93957275,"about_ca_system_score_codex":0.00023510346,"about_ca_system_score_gemma":0.00081609184,"threshold_uncertainty_score":0.9997113},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008035955,0.00019866355,0.99746954,0.00011455198,0.000154024,0.0008640001,0.000017472883,0.00056467304,0.00053671177],"genre_scores_gemma":[0.74703693,0.0000064714295,0.25101775,0.001037114,0.0001699724,0.00045894407,0.00015635077,0.000071344904,0.000045096906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878764,0.0000049009304,0.00025714995,0.00044617444,0.00023329236,0.00027085913],"domain_scores_gemma":[0.9986795,0.00024784938,0.000088776804,0.00043989622,0.00049919606,0.000044773227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001564237,0.0002945253,0.00025383895,0.00044906253,0.00018563983,0.00015250844,0.00063079,0.00024839336,0.000010793463],"category_scores_gemma":[0.000016277781,0.0002543631,0.00003344217,0.0006557257,0.00021565295,0.00009381999,0.00004501638,0.00029800495,0.0000142035715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038559915,0.000004372616,0.00003747837,0.00017935484,0.000007978442,5.220652e-7,0.00006636853,0.8793723,0.00006243536,0.0017297857,0.000007833215,0.1185277],"study_design_scores_gemma":[0.00025100698,0.000093975934,0.000021637625,0.0004355189,0.000018193996,0.000004992266,0.000001295223,0.98182166,0.0066466387,0.0040371786,0.006254169,0.00041375475],"about_ca_topic_score_codex":0.000011475445,"about_ca_topic_score_gemma":0.00030681727,"teacher_disagreement_score":0.7469566,"about_ca_system_score_codex":0.00018785625,"about_ca_system_score_gemma":0.00018909843,"threshold_uncertainty_score":0.9999909},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2129224,0.003651562,0.76114714,0.0013056276,0.0036647373,0.002560077,0.00014006291,0.0003814459,0.014226943],"genre_scores_gemma":[0.99595296,0.000024888355,0.0034499504,0.000030229707,0.00038751028,0.0000034091693,0.000009970419,0.0000031933644,0.00013788625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981313,0.000035238074,0.0003053312,0.0007529102,0.00043813637,0.00033708542],"domain_scores_gemma":[0.99901646,0.00016914375,0.00042323105,0.00018614334,0.00013375997,0.00007128704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057721476,0.00030768884,0.0004265129,0.00008140573,0.0006482813,0.00012870332,0.00082425686,0.00024141214,0.00002571188],"category_scores_gemma":[0.00008576511,0.00013943104,0.00012619329,0.00016432327,0.0007401238,0.00021227116,0.00041419532,0.00059166533,0.0000035783735],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043236363,0.000028298147,0.0005790181,0.000025069878,0.000013241061,0.000007763697,0.00027399737,0.009227908,0.021586768,0.00036281825,6.0223094e-8,0.9678518],"study_design_scores_gemma":[0.0010381398,0.0041782157,0.039134856,0.0015605752,0.00012379029,0.00021384505,0.00001114863,0.6639009,0.20275933,0.07982475,0.0040656175,0.0031888138],"about_ca_topic_score_codex":0.0003975768,"about_ca_topic_score_gemma":0.0023501418,"teacher_disagreement_score":0.964663,"about_ca_system_score_codex":0.00010532426,"about_ca_system_score_gemma":0.00004950645,"threshold_uncertainty_score":0.56858325},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035044723,0.0002501811,0.98854005,0.0018585484,0.0012939225,0.0005982641,0.000018024557,0.00024079763,0.0071651633],"genre_scores_gemma":[0.24135955,0.000020208661,0.7569479,0.001218677,0.00022227484,0.000026299307,0.000013658795,0.000046496472,0.00014493348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533856,0.000052017982,0.00052193686,0.0021589042,0.001044823,0.0008837868],"domain_scores_gemma":[0.9946741,0.00036920336,0.0005253669,0.0038250189,0.0003336879,0.0002726177],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007993553,0.0007524349,0.0006686564,0.00060762715,0.00067873776,0.0017546347,0.006344379,0.00039635826,0.000057819365],"category_scores_gemma":[0.00008313927,0.00057034154,0.00015906485,0.00033189842,0.0020115832,0.00078888115,0.0009900314,0.000904757,0.00009263194],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002539973,0.00016329976,0.00020364714,0.00009549023,0.000030027632,0.0003570104,0.0008573606,0.01792328,0.00008387027,0.02919239,0.0000937803,0.95097446],"study_design_scores_gemma":[0.00055428944,0.00024509206,0.0013279697,0.0004078329,0.000015095603,0.00006636173,8.476614e-8,0.9204099,0.00009935953,0.074517205,0.001551382,0.00080539996],"about_ca_topic_score_codex":0.00003504628,"about_ca_topic_score_gemma":0.00030490337,"teacher_disagreement_score":0.950169,"about_ca_system_score_codex":0.00024047708,"about_ca_system_score_gemma":0.00078706647,"threshold_uncertainty_score":0.9996748},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009543004,0.0012053318,0.99183613,0.0009420978,0.0027418907,0.0006625832,0.0000063442785,0.00043804522,0.002072144],"genre_scores_gemma":[0.016763847,0.00008193417,0.9801574,0.0012833418,0.0009580935,0.000021023974,0.000011682814,0.000053169682,0.0006695274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936382,0.00015028691,0.00079654116,0.0028287019,0.0015158745,0.0010703644],"domain_scores_gemma":[0.9961878,0.001147303,0.00037130414,0.0015529381,0.000390278,0.00035034408],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013733403,0.00080646836,0.0008633083,0.001194436,0.0003941593,0.0012628633,0.003635037,0.00047571753,0.000015970538],"category_scores_gemma":[0.00016409214,0.00077765464,0.00014854794,0.001870935,0.00122035,0.0009907929,0.003129216,0.0011700107,0.00006451706],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014158934,0.000068088535,0.00006064357,0.000059245747,0.000009233151,0.000118909746,0.0007385477,0.02513003,0.000011503146,0.0008303189,0.0002400009,0.97273207],"study_design_scores_gemma":[0.00033008616,0.00021525595,0.00048128483,0.00015110336,0.000007460925,0.0002089411,1.4339639e-7,0.8506514,0.000085994485,0.14616615,0.0009504845,0.0007516972],"about_ca_topic_score_codex":0.00003189087,"about_ca_topic_score_gemma":0.00003383055,"teacher_disagreement_score":0.9719804,"about_ca_system_score_codex":0.000787881,"about_ca_system_score_gemma":0.00076446845,"threshold_uncertainty_score":0.9997739},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015690656,0.001077537,0.99643195,0.00020758055,0.00046224234,0.0005872627,0.000001938987,0.0005021069,0.00057247485],"genre_scores_gemma":[0.017531691,0.000032557342,0.98120403,0.0005235335,0.00023772704,0.000041847106,0.0000025355284,0.0000278241,0.0003982583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691814,0.000083396066,0.00042443137,0.0014838631,0.00060677575,0.00048340592],"domain_scores_gemma":[0.9971562,0.0009169401,0.00028746255,0.0011704747,0.00030514124,0.00016375816],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009972907,0.0004029853,0.00042749508,0.00057109614,0.00024554835,0.0010860041,0.0018784743,0.00031373932,0.0000016748257],"category_scores_gemma":[0.00049208454,0.00037371382,0.00003018017,0.00078680017,0.00059003435,0.0009815252,0.0012593658,0.00056620967,0.000012441586],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.260311e-7,0.000009448899,0.0003868344,0.00013588344,0.0000039506285,0.000020460366,0.00071781094,0.00020074866,0.0005292246,0.0017221187,0.00038839172,0.9958845],"study_design_scores_gemma":[0.0003080326,0.0003963635,0.002293345,0.0018085202,0.000012235643,0.00054647983,3.6922833e-7,0.69713295,0.0047447295,0.28870833,0.002512796,0.0015358899],"about_ca_topic_score_codex":0.00005049723,"about_ca_topic_score_gemma":0.000010146362,"teacher_disagreement_score":0.9943486,"about_ca_system_score_codex":0.0002537181,"about_ca_system_score_gemma":0.00058811426,"threshold_uncertainty_score":0.99995095},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02725132,0.0000085119955,0.96889096,0.0028093825,0.00007984424,0.00090762664,0.0000017920665,0.000041967935,0.000008564316],"genre_scores_gemma":[0.5896664,0.000003576408,0.4100538,0.00011627807,0.000058073856,0.00006797956,0.000025770125,0.0000050761682,0.0000030079295],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990957,0.0000079578485,0.00024409537,0.00030303176,0.00017758469,0.00017167647],"domain_scores_gemma":[0.99918824,0.000060369486,0.00008772342,0.00030727359,0.0003171032,0.0000393088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023609572,0.00008264316,0.00013070196,0.00014171243,0.000084411564,0.000024148883,0.00014384018,0.00006558777,0.000009542361],"category_scores_gemma":[0.00005263855,0.000060081602,0.00003174881,0.00033130284,0.00025975332,0.00019404633,0.00004492884,0.00008059969,0.000005669098],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014517989,0.00006697061,0.00063932483,0.000033124445,0.0000011420103,1.854615e-7,0.00021033139,0.034755595,0.40880436,0.00021065524,0.000035619254,0.5552282],"study_design_scores_gemma":[0.00015548774,0.00008484349,0.005134876,0.000031633597,0.000003833468,0.0000027815765,6.6386673e-7,0.4310471,0.5531723,0.010275857,0.0000426204,0.000048002],"about_ca_topic_score_codex":0.000062303196,"about_ca_topic_score_gemma":0.0000063307975,"teacher_disagreement_score":0.5624151,"about_ca_system_score_codex":0.000057955483,"about_ca_system_score_gemma":0.000050476374,"threshold_uncertainty_score":0.24500567},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006220468,0.0004511173,0.9888231,0.00047863793,0.0009196313,0.0005694927,0.000009814738,0.000039215436,0.002488479],"genre_scores_gemma":[0.9768146,0.000015197456,0.02208675,0.0002222652,0.00010960585,0.000023986539,0.0000016297216,0.000020237521,0.0007057221],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668616,0.00047692665,0.00080069865,0.0007035678,0.0008799128,0.0004527588],"domain_scores_gemma":[0.9945257,0.0022723186,0.00075182057,0.001958635,0.0003843448,0.00010722026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005158454,0.00037827386,0.00079280615,0.0006579239,0.0003763009,0.00018109335,0.00513506,0.0002071799,0.000008562057],"category_scores_gemma":[0.0008288455,0.00028968573,0.00022146133,0.00039290183,0.0011426834,0.00023688102,0.0011069658,0.0012232604,0.0000066363255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009918666,0.0004141605,0.023184538,0.0009338749,0.000078102494,0.000031178333,0.060866553,0.23324148,0.00077336375,0.13918737,0.000041436717,0.5411488],"study_design_scores_gemma":[0.0048782183,0.00466848,0.06090854,0.029849373,0.00008466908,0.00003564235,0.00014620849,0.75415033,0.027964346,0.05000539,0.061891384,0.005417423],"about_ca_topic_score_codex":0.001477342,"about_ca_topic_score_gemma":0.0010506202,"teacher_disagreement_score":0.9705941,"about_ca_system_score_codex":0.00025895302,"about_ca_system_score_gemma":0.0006628602,"threshold_uncertainty_score":0.99995553},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030604715,0.00068257033,0.9878468,0.002650483,0.0011521255,0.0005579391,0.0000034801126,0.00021574684,0.0068602473],"genre_scores_gemma":[0.33641073,0.00019140956,0.6548427,0.0058786804,0.001150127,0.00004513262,0.0000051121665,0.00012892576,0.0013472127],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947314,0.00007683326,0.0005024238,0.0018015987,0.0017190274,0.0011687189],"domain_scores_gemma":[0.99525917,0.0012188564,0.00023248178,0.0027744602,0.0002776904,0.00023731879],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017718059,0.00058909314,0.0004768939,0.0009768496,0.0007474969,0.0008280141,0.0089355465,0.0002770365,0.000043747852],"category_scores_gemma":[0.00019546009,0.0004222506,0.00019553593,0.0012724476,0.0021927764,0.0008164675,0.0034090967,0.001907463,0.0001295418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050419667,0.000013830102,0.000014126633,0.000022082399,0.0000093161225,0.00011362117,0.0006715397,0.04343001,0.00010057226,0.4508524,0.000008235698,0.5047592],"study_design_scores_gemma":[0.00021180659,0.00011382925,0.00004650381,0.00023647939,0.000003261695,0.00009253524,1.6685533e-7,0.060512695,0.00082579424,0.93493813,0.0025050817,0.0005137007],"about_ca_topic_score_codex":0.000015882893,"about_ca_topic_score_gemma":0.00003836323,"teacher_disagreement_score":0.5042455,"about_ca_system_score_codex":0.00053027726,"about_ca_system_score_gemma":0.0010565287,"threshold_uncertainty_score":0.9998229},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030879615,0.00019228975,0.99249434,0.0016946507,0.0016100903,0.0013889145,0.000003676309,0.00036114265,0.0019461182],"genre_scores_gemma":[0.09864264,0.000008067915,0.8874111,0.009768688,0.0022778471,0.00019031377,0.000007167596,0.000094492694,0.0015996591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957075,0.000028448392,0.00058623485,0.00198087,0.0008668925,0.0008300655],"domain_scores_gemma":[0.9966029,0.00051118253,0.00029728567,0.0020439846,0.0002644166,0.00028022367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011652369,0.00054227427,0.0005235981,0.0007614762,0.0005598591,0.0007803871,0.0052287593,0.00022909636,0.000005541501],"category_scores_gemma":[0.000024109477,0.0005029525,0.00020535805,0.00060659344,0.00019647469,0.000060574457,0.0028523353,0.0004248111,0.00014102795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006081024,0.000027369868,0.000038748138,0.00018946207,0.000018023162,0.0000058251967,0.00068153563,0.17849886,0.000018243125,0.08384889,0.00008778448,0.7365792],"study_design_scores_gemma":[0.00034680264,0.00027290548,0.000059309958,0.00049711636,0.000019805933,0.000016933167,5.2503674e-7,0.75410634,0.00017100491,0.105562836,0.1380095,0.0009369034],"about_ca_topic_score_codex":0.000023677714,"about_ca_topic_score_gemma":0.00010072217,"teacher_disagreement_score":0.73564225,"about_ca_system_score_codex":0.00024373739,"about_ca_system_score_gemma":0.00013831562,"threshold_uncertainty_score":0.9997422},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1896219,0.0017838991,0.80496097,0.0020680656,0.00029640034,0.0009819848,0.000009759213,0.000039638147,0.00023740804],"genre_scores_gemma":[0.93172765,0.00004280531,0.066345245,0.0012852078,0.0005030993,0.00001845615,0.0000188101,0.000037720474,0.000021035314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728304,0.00006728378,0.00045819918,0.0010172316,0.00036588134,0.0008083831],"domain_scores_gemma":[0.99891573,0.00032059298,0.00012129628,0.0003753011,0.0000775385,0.00018955942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041030708,0.00045113757,0.0009470961,0.0011248953,0.00011313114,0.000029334606,0.00019611826,0.00037479828,0.000011950856],"category_scores_gemma":[0.000025385949,0.000429418,0.000115220246,0.00040908082,0.0004403257,0.00016384402,0.00022873524,0.00083307613,0.0000029175928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014565981,0.00006621925,0.00033059338,0.0001301163,0.000019454885,0.00018141921,0.00071512983,0.9788325,0.003383272,0.0015072426,0.0000043930804,0.0146840075],"study_design_scores_gemma":[0.0010938339,0.00045005593,0.0019977672,0.00060579187,0.000027300666,0.00023061619,0.0000011439686,0.9490866,0.00080833427,0.044963792,0.00013709463,0.00059765816],"about_ca_topic_score_codex":0.000051710656,"about_ca_topic_score_gemma":0.00013740515,"teacher_disagreement_score":0.7421057,"about_ca_system_score_codex":0.00038705525,"about_ca_system_score_gemma":0.00047128275,"threshold_uncertainty_score":0.99981576},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082727754,0.00055929035,0.99250007,0.0006099454,0.0005223504,0.00053453195,0.0000038574317,0.00012287017,0.004319832],"genre_scores_gemma":[0.40878218,0.00009104175,0.5889506,0.0007158417,0.0004529736,0.000018869392,0.000006830208,0.000039775226,0.00094192335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963869,0.000030368827,0.00031857233,0.0017524157,0.00090741605,0.0006043341],"domain_scores_gemma":[0.9979909,0.00022779821,0.00014861932,0.0011801351,0.00024126012,0.00021128693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006577303,0.00046855933,0.0004338405,0.00040482136,0.00031608617,0.00079492613,0.0015503198,0.0002494432,0.00004471473],"category_scores_gemma":[0.000015573583,0.00032629797,0.000057889007,0.00043534528,0.0010216879,0.000756188,0.0012688836,0.0007803925,0.000069218],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021132284,0.000036244535,0.0005050365,0.000058520665,0.000016108415,0.000048894333,0.00065888086,0.0069163325,0.00002156724,0.027627682,0.000029523086,0.96406007],"study_design_scores_gemma":[0.00073204126,0.0017144766,0.009581006,0.00043559817,0.000025703404,0.00019685042,0.0000012035274,0.75178576,0.00017054561,0.23218943,0.001744427,0.001422955],"about_ca_topic_score_codex":0.00009335255,"about_ca_topic_score_gemma":0.000063479216,"teacher_disagreement_score":0.9626371,"about_ca_system_score_codex":0.00018015539,"about_ca_system_score_gemma":0.0003110198,"threshold_uncertainty_score":0.9999189},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003741608,0.0003955659,0.9894355,0.0011565399,0.00037126054,0.00064365723,0.0000070924975,0.000059049333,0.0041897213],"genre_scores_gemma":[0.9562458,0.000013754426,0.0431999,0.00022155917,0.00020584236,0.000009800331,0.000004681377,0.000011399481,0.000087293796],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976941,0.00012325024,0.00035760138,0.00074637326,0.00063660066,0.00044209763],"domain_scores_gemma":[0.9982955,0.0008563516,0.00016149896,0.0003904867,0.00013671273,0.00015947524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025863526,0.00023039775,0.00030946615,0.00034352447,0.00044005475,0.00020645323,0.00048630044,0.0003904993,0.00003448155],"category_scores_gemma":[0.0007491317,0.000220639,0.00005125549,0.00045934127,0.0012988438,0.00053638936,0.00014472163,0.0005634232,0.000004662583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023451432,0.000053314106,0.28113395,0.000037171252,0.0000023463535,0.0000032901442,0.0038590457,0.07511687,0.000004037036,0.098746456,0.0000015652992,0.5410185],"study_design_scores_gemma":[0.00027311879,0.00001778839,0.063849784,0.00011524068,0.000008475438,3.576234e-7,7.3537484e-7,0.44455042,0.0000037428713,0.49082142,0.000069490176,0.00028941288],"about_ca_topic_score_codex":0.00033368098,"about_ca_topic_score_gemma":0.0065595014,"teacher_disagreement_score":0.95250416,"about_ca_system_score_codex":0.00049731677,"about_ca_system_score_gemma":0.0007967641,"threshold_uncertainty_score":0.89973974},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009592818,0.000040671082,0.98803204,0.0018750671,0.0001523548,0.0002294183,0.0000010368444,0.00004624997,0.000030331668],"genre_scores_gemma":[0.34868208,9.74784e-7,0.649314,0.0019521785,0.000039437924,0.000006253972,6.6389566e-7,0.000004039384,3.609118e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814564,0.0002315995,0.00018512066,0.000666531,0.0004724763,0.00029862966],"domain_scores_gemma":[0.9983795,0.0010200454,0.00007659395,0.0003777488,0.00007409933,0.00007198394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023422805,0.00016608216,0.0001412242,0.00023898424,0.00043834996,0.0008171171,0.00064577936,0.000047837868,0.0000012750133],"category_scores_gemma":[0.0002394234,0.000117141135,0.000025021362,0.0009725249,0.0003369084,0.00053702266,0.00026973797,0.00022869707,9.765961e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019286907,0.00009708988,0.0002182938,0.000025632808,0.000004612784,0.000027479791,0.004583739,0.33010966,0.035059087,0.009059525,0.0000014153469,0.6207942],"study_design_scores_gemma":[0.00062021526,0.000076843266,0.0030251527,0.0000318717,0.000002661313,0.000041459072,0.000002138288,0.94534826,0.022353008,0.02834815,0.0000031489035,0.00014709875],"about_ca_topic_score_codex":0.000058650785,"about_ca_topic_score_gemma":0.0000056186723,"teacher_disagreement_score":0.6206471,"about_ca_system_score_codex":0.00008907312,"about_ca_system_score_gemma":0.00014659598,"threshold_uncertainty_score":0.7879479},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014840747,0.00033277998,0.9959584,0.0002123897,0.0006916246,0.0004374398,0.000007319425,0.00053692097,0.001674739],"genre_scores_gemma":[0.010176127,0.000013367964,0.98871386,0.0005982175,0.00026176736,0.000034929664,0.00001199555,0.0001519762,0.000037755934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976923,0.000012925922,0.0004957599,0.0006955483,0.00045936927,0.00064410013],"domain_scores_gemma":[0.9980091,0.001228137,0.000076030774,0.00049169996,0.00006501781,0.0001300165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062956434,0.00054579874,0.0005223706,0.00045369208,0.00012200663,0.00019238131,0.0006263631,0.00043284008,0.00009770535],"category_scores_gemma":[0.00036546908,0.00054925313,0.00012503302,0.00024731693,0.00032473676,0.00026207307,0.00018552582,0.0010750117,0.000019647954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000875766,0.000014213401,0.0000036010047,0.00027171185,0.000037615497,0.00007054468,0.00084017374,0.6959105,0.0017436194,0.000639384,0.00005645031,0.30040345],"study_design_scores_gemma":[0.00024084384,0.000060636252,0.000026190331,0.0011244826,0.000020339758,0.0002473097,0.0000023975947,0.9576656,0.0075708777,0.017618634,0.014332971,0.0010896787],"about_ca_topic_score_codex":0.000001138387,"about_ca_topic_score_gemma":0.0000018942369,"teacher_disagreement_score":0.29931375,"about_ca_system_score_codex":0.0006213744,"about_ca_system_score_gemma":0.00007700818,"threshold_uncertainty_score":0.9996959},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019065934,0.00033182104,0.9661866,0.0007658866,0.0010874363,0.00037710366,0.000005094188,0.0001127303,0.030942688],"genre_scores_gemma":[0.2775747,0.00010793941,0.7210931,0.0006263267,0.0002890957,0.000019403127,0.000005852816,0.000037906193,0.000245649],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99593985,0.000024557909,0.00044447216,0.0016869059,0.001099326,0.0008048896],"domain_scores_gemma":[0.9965295,0.0004876774,0.00034137373,0.0022801762,0.00019463678,0.00016663958],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00070326193,0.000571441,0.0005922425,0.00073024107,0.0005568934,0.0019572603,0.0047890567,0.0003468513,0.000022227448],"category_scores_gemma":[0.00006490106,0.00042515958,0.0000967782,0.00039474558,0.0008005798,0.0019312889,0.0012773349,0.0009928421,0.000054058328],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014065562,0.000046459485,0.00020499181,0.000015576128,0.000011025747,0.000434625,0.000506195,0.09430696,0.000006676694,0.046254132,0.000035204706,0.8581641],"study_design_scores_gemma":[0.00041189644,0.00027344213,0.002404088,0.00060026627,0.000005355023,0.00014554904,5.2442664e-7,0.3617022,0.000035517096,0.63151383,0.0021451735,0.0007621333],"about_ca_topic_score_codex":0.00018572916,"about_ca_topic_score_gemma":0.0030050643,"teacher_disagreement_score":0.85740197,"about_ca_system_score_codex":0.00026648768,"about_ca_system_score_gemma":0.0010802909,"threshold_uncertainty_score":0.99982},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40490916,0.000014856245,0.59383947,0.0010172375,0.00003526099,0.00016553415,0.0000013418495,0.000010847616,0.000006305461],"genre_scores_gemma":[0.92799866,0.0000024903068,0.07131888,0.0006099563,0.000048524413,0.000008885991,0.0000077932955,0.0000036603874,0.0000011223119],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986847,0.000041338888,0.00019808569,0.00045620295,0.0003490241,0.0002706254],"domain_scores_gemma":[0.9989674,0.0001801186,0.00005004553,0.0003946866,0.0001908246,0.00021691264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059584883,0.0001093544,0.00033911146,0.0004409725,0.00006243769,0.00002687923,0.00017105225,0.00005513428,0.000008992078],"category_scores_gemma":[0.00016765596,0.000083224746,0.000053328644,0.001751768,0.000326352,0.00006163031,0.00016534893,0.0001532493,0.0000060754273],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009588514,0.00010251785,0.6872712,0.000016767272,0.000047865935,0.0000062841887,0.00037012418,0.010634751,0.0016620818,0.00003083623,0.000006533817,0.29975516],"study_design_scores_gemma":[0.00027999928,0.00034567976,0.4523076,0.000019036086,0.000042349846,0.0000048690395,0.0000015816928,0.54088825,0.005684483,0.00035706896,0.000014875362,0.00005418796],"about_ca_topic_score_codex":0.0009405532,"about_ca_topic_score_gemma":0.00046919571,"teacher_disagreement_score":0.5302535,"about_ca_system_score_codex":0.000074170755,"about_ca_system_score_gemma":0.000071554874,"threshold_uncertainty_score":0.33938065},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010024747,0.00080089155,0.80349237,0.036111545,0.008035736,0.0012953364,0.000018740475,0.0013955267,0.1478474],"genre_scores_gemma":[0.47736552,0.0009194788,0.5098502,0.0033815945,0.0030207732,0.0001307124,0.000047471138,0.00010442992,0.0051798136],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770063,0.00007741926,0.0002709444,0.00069412065,0.0006439882,0.00061288325],"domain_scores_gemma":[0.99718,0.0010297698,0.00021403795,0.0011717122,0.0002764529,0.00012806586],"candidate_categories":["sts","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.00090795686,0.0002414461,0.00035557273,0.0014235293,0.0005452386,0.000100709905,0.0038679352,0.0014231615,0.00019960105],"category_scores_gemma":[0.001676419,0.00023616958,0.00005952755,0.0016037497,0.0067544472,0.00016286648,0.00085467775,0.002337583,0.00011513517],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021670178,0.000024757814,0.000067259454,0.0000034133534,0.0000037489363,0.000008916003,0.0044019534,0.000019401228,0.00010151158,0.02415761,0.000118961,0.9710903],"study_design_scores_gemma":[0.0003019095,0.000049628114,0.00014239551,0.00013275596,0.0000101254245,0.000011741603,0.000014191493,0.0031292213,0.0020498186,0.64001614,0.35349828,0.00064381945],"about_ca_topic_score_codex":0.00015751345,"about_ca_topic_score_gemma":0.011865519,"teacher_disagreement_score":0.97044647,"about_ca_system_score_codex":0.00046300518,"about_ca_system_score_gemma":0.002707873,"threshold_uncertainty_score":0.99996406},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028155575,0.0012330207,0.9902473,0.0006411903,0.0018995736,0.00021432473,0.000002052869,0.00008835622,0.00539261],"genre_scores_gemma":[0.9427331,0.000031476728,0.05570798,0.00034623872,0.00026249542,0.0000036514552,0.0000016503419,0.00002893087,0.0008844961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971024,0.000047553767,0.00049132615,0.0008304644,0.0010456096,0.00048266328],"domain_scores_gemma":[0.99674606,0.0007382573,0.00034494838,0.001484426,0.00054894085,0.00013738789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018655033,0.0003344485,0.0003867531,0.00030368436,0.0002958401,0.00041093642,0.0025588453,0.00022413536,0.000005278542],"category_scores_gemma":[0.00026096945,0.00023866656,0.000108619366,0.00038278816,0.001152496,0.000270412,0.00088977563,0.00058869534,0.00002204381],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009746792,0.000016700178,0.000022304615,0.000014052951,0.000011359216,0.000034636392,0.0014757429,0.015264891,0.00021321613,0.084030606,0.00023675385,0.89867],"study_design_scores_gemma":[0.0008269999,0.000820395,0.00023370776,0.0012320933,0.000021068288,0.0003164823,0.0000033217914,0.5326786,0.004613611,0.4284737,0.029318526,0.0014615001],"about_ca_topic_score_codex":0.000022889906,"about_ca_topic_score_gemma":0.00005141558,"teacher_disagreement_score":0.94245154,"about_ca_system_score_codex":0.00018293312,"about_ca_system_score_gemma":0.0006419258,"threshold_uncertainty_score":0.97325397},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008058771,0.00007307074,0.9820825,0.000623968,0.001071869,0.0004668699,0.00002301248,0.00012128558,0.015456858],"genre_scores_gemma":[0.13266383,0.00004077156,0.86416554,0.0024410838,0.00039681775,0.000032849886,0.00010702858,0.000027164137,0.0001248959],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969189,0.00003793214,0.00062925345,0.000943151,0.00081615074,0.0006545723],"domain_scores_gemma":[0.9968515,0.00014933053,0.000466049,0.002152855,0.00022084112,0.0001594393],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009942406,0.00044397745,0.00048429516,0.0009547292,0.00049204874,0.001985097,0.004802465,0.00031597898,0.000017445003],"category_scores_gemma":[0.000082021135,0.00040041486,0.00007183712,0.00040016594,0.00045116205,0.0054803034,0.0013672048,0.0007475137,0.000081856415],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004667693,0.00003314507,0.00015538005,0.000045600897,0.0000044163144,0.000038891096,0.0026427277,0.06658208,0.000007243228,0.04892605,0.00006652277,0.8814933],"study_design_scores_gemma":[0.00025208792,0.00011919664,0.00046039355,0.00015913598,0.0000023850992,0.000030374049,2.934267e-7,0.8010299,0.000023182512,0.1913575,0.00608101,0.0004845085],"about_ca_topic_score_codex":0.00015235184,"about_ca_topic_score_gemma":0.0004400032,"teacher_disagreement_score":0.88100874,"about_ca_system_score_codex":0.00027935137,"about_ca_system_score_gemma":0.0005279316,"threshold_uncertainty_score":0.9998448},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017161666,0.00021595982,0.4195243,0.0011148015,0.0029067623,0.0003466609,0.0000049177943,0.00016531351,0.57554966],"genre_scores_gemma":[0.6542209,0.000024018711,0.031894904,0.006914081,0.008585005,0.0000036940617,0.00006222395,0.000092361945,0.29820284],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986233,0.000013459502,0.0002363607,0.00048128248,0.00037331277,0.00027224765],"domain_scores_gemma":[0.99924624,0.00012432912,0.00011693135,0.00035291218,0.00011530309,0.000044255707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003125328,0.00025476038,0.00024067091,0.00033136806,0.0003101704,0.00070125994,0.0004522521,0.00006062992,0.00080245506],"category_scores_gemma":[0.000017077324,0.00021071298,0.00007225032,0.00006698424,0.00051584304,0.00024130411,0.0002801644,0.00032066504,0.00009719977],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060196717,0.0000044628323,0.000014617213,0.0000722633,0.000010316856,0.000024518155,0.0059454557,0.0009759281,0.000018022925,0.2825728,0.000733223,0.7096224],"study_design_scores_gemma":[0.00013849385,0.00005649097,0.000025792207,0.00040359297,0.000014756093,0.0000024928943,0.0000020407997,0.0461589,0.000045157303,0.13947037,0.8131186,0.0005633225],"about_ca_topic_score_codex":0.00008133241,"about_ca_topic_score_gemma":0.00800759,"teacher_disagreement_score":0.8123854,"about_ca_system_score_codex":0.00007365354,"about_ca_system_score_gemma":0.000023658044,"threshold_uncertainty_score":0.878632},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010299662,0.00036404352,0.9945084,0.00064999424,0.0006528247,0.00034330663,0.0000025346485,0.00013741436,0.003331184],"genre_scores_gemma":[0.523807,0.000035484278,0.47461697,0.0010733625,0.0002490907,0.000013936065,0.0000020229988,0.000025165738,0.00017698863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964503,0.000027331562,0.00063917576,0.0014805081,0.0008056902,0.0005969891],"domain_scores_gemma":[0.99727076,0.00023910835,0.00032822532,0.0016207803,0.00030827068,0.00023285435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006784323,0.00043978338,0.00053813774,0.00062472676,0.00016124759,0.0002707368,0.0033378818,0.00031793962,0.000010763606],"category_scores_gemma":[0.00004806289,0.0004389597,0.00011319419,0.0009469732,0.00031848176,0.00035343794,0.0008084866,0.0006431943,0.000025501608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024104065,0.000016717764,0.000048668477,0.00002207589,0.0000049096457,0.000008421563,0.0001962386,0.27666125,0.00009586531,0.04027624,0.000019840716,0.68264735],"study_design_scores_gemma":[0.00007688553,0.00008864205,0.000085357606,0.0003681266,0.000004568255,0.000014025431,4.7787935e-8,0.9574255,0.00023296122,0.040782385,0.0004690446,0.00045249274],"about_ca_topic_score_codex":0.000016645077,"about_ca_topic_score_gemma":0.00003457645,"teacher_disagreement_score":0.6821949,"about_ca_system_score_codex":0.000207338,"about_ca_system_score_gemma":0.00018428726,"threshold_uncertainty_score":0.9998062},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021113106,0.00065179565,0.99240416,0.0002944826,0.00035090328,0.00046136463,0.0000072726734,0.001542142,0.0021765379],"genre_scores_gemma":[0.5293907,0.000011816097,0.46947688,0.00091424305,0.00013007496,0.00002257909,0.000002679367,0.000024783529,0.000026256259],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649024,0.000050555285,0.0004771203,0.0013608838,0.00078473054,0.00083647243],"domain_scores_gemma":[0.99774253,0.0004761128,0.00016952942,0.0011314807,0.00021990543,0.000260449],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014750382,0.0005417508,0.0006563461,0.0011438314,0.00020327639,0.0005834954,0.0026041728,0.00030955704,9.898341e-7],"category_scores_gemma":[0.00030038407,0.000501499,0.00006490828,0.0008079962,0.00057456107,0.0006099581,0.0027282748,0.0006904649,0.000005429388],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000326001,0.00009965027,0.0025149176,0.0002606327,0.00001454123,0.00012141366,0.019730717,0.0076596015,0.000039668288,0.018128647,0.00047687296,0.95092076],"study_design_scores_gemma":[0.0002967579,0.00034144917,0.0015707327,0.00050954573,0.000004701273,0.00025249558,3.6161927e-7,0.46254537,0.0001695517,0.53230184,0.0010682131,0.00093895284],"about_ca_topic_score_codex":0.00038380057,"about_ca_topic_score_gemma":0.00015043996,"teacher_disagreement_score":0.9499818,"about_ca_system_score_codex":0.00029184058,"about_ca_system_score_gemma":0.00038219104,"threshold_uncertainty_score":0.99974364},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045508652,0.0010474047,0.9859425,0.00411389,0.002377389,0.0003504455,0.0000023443224,0.00010166708,0.0060188808],"genre_scores_gemma":[0.10830166,0.00054715335,0.85367316,0.015867064,0.0028887338,0.000079732716,0.000017430637,0.000089474175,0.01853556],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679387,0.000031676747,0.00043597422,0.0011346296,0.0010502475,0.00055360177],"domain_scores_gemma":[0.99736565,0.0006260827,0.0002311357,0.0012414205,0.00038708566,0.0001486392],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007592127,0.00039535886,0.0002805883,0.0005507205,0.00065250375,0.0012666009,0.0030901094,0.00020418009,0.000055404762],"category_scores_gemma":[0.000066586115,0.00028078628,0.00014604956,0.0008255432,0.0005224694,0.00059799524,0.0009865502,0.00056736945,0.00029609146],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016606463,0.00001056515,0.000004884121,0.0000071642203,0.000010380288,0.000010774265,0.00031907868,0.020575492,0.00004533908,0.08737425,0.00087362435,0.8907668],"study_design_scores_gemma":[0.00012808907,0.000084157444,0.00010414814,0.0000760224,0.0000043160726,0.000043140404,8.239447e-8,0.46334913,0.0007534151,0.49761504,0.03741058,0.00043187992],"about_ca_topic_score_codex":0.000016089089,"about_ca_topic_score_gemma":0.00003245794,"teacher_disagreement_score":0.8903349,"about_ca_system_score_codex":0.00013419481,"about_ca_system_score_gemma":0.0004667131,"threshold_uncertainty_score":0.9999644},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012668422,0.00071273424,0.99630123,0.0005596893,0.00078467914,0.00023626795,0.0004334032,0.000101047226,0.0007442429],"genre_scores_gemma":[0.03315586,0.00002269213,0.9651917,0.00056799187,0.0004434423,0.0000075401585,0.0005139446,0.000031441556,0.000065382235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962561,0.000031455722,0.0006094989,0.0016484148,0.0008992886,0.0005552044],"domain_scores_gemma":[0.9943032,0.0006708686,0.00046771602,0.004168055,0.00018912404,0.0002010367],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008166118,0.00043871495,0.00052636664,0.0004684309,0.00017985376,0.00033482458,0.008308007,0.00023275102,0.000036806345],"category_scores_gemma":[0.00008096716,0.00040471426,0.000070102455,0.0006497199,0.000592807,0.00080389495,0.0027250447,0.0004467239,0.000029882312],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012129809,0.00004499658,0.00015827929,0.0000138807645,0.000011908978,0.0000121291005,0.00031960188,0.003182932,0.00019244864,0.0022208756,0.00014124418,0.9937005],"study_design_scores_gemma":[0.00027220973,0.00006476238,0.00048795086,0.00044051427,0.000021239606,0.000008922127,4.622138e-7,0.9835011,0.0015444339,0.0073722475,0.0056660986,0.0006200731],"about_ca_topic_score_codex":0.00027214305,"about_ca_topic_score_gemma":0.00013082872,"teacher_disagreement_score":0.99308044,"about_ca_system_score_codex":0.00013950608,"about_ca_system_score_gemma":0.0006435896,"threshold_uncertainty_score":0.9998405},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005503725,0.0009100227,0.9959666,0.00044490842,0.00067179714,0.00030287905,0.000004049175,0.00062658114,0.0010181108],"genre_scores_gemma":[0.059410207,0.00017500036,0.93966055,0.00030368878,0.00021039986,0.000012888013,0.0000019318115,0.00003962098,0.00018573266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964964,0.000018565743,0.00039782454,0.0016506003,0.0007742664,0.00066233566],"domain_scores_gemma":[0.99695426,0.00022003232,0.00027889397,0.0021178187,0.00021664727,0.00021235016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008642224,0.00057458115,0.00055167073,0.00092003704,0.0004201091,0.00081748905,0.003977809,0.0003282961,0.000003999779],"category_scores_gemma":[0.000054253593,0.000570515,0.00013379744,0.00022960991,0.0008302809,0.0008309662,0.0019559865,0.00089795876,0.0000060387288],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014874647,0.000008442204,0.00006115508,0.00006229578,0.000009494184,0.00012261473,0.00047563628,0.0034794335,0.00008699543,0.054258496,0.000011505293,0.94142246],"study_design_scores_gemma":[0.0002922068,0.0002664431,0.00031917103,0.0018409577,0.000017318533,0.00043346558,7.770716e-8,0.7895146,0.0012691738,0.19458815,0.009860302,0.0015981338],"about_ca_topic_score_codex":0.00001999643,"about_ca_topic_score_gemma":0.000021954242,"teacher_disagreement_score":0.9398243,"about_ca_system_score_codex":0.0001486183,"about_ca_system_score_gemma":0.00020845306,"threshold_uncertainty_score":0.9996746},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008276886,0.000058604666,0.99505776,0.00015155894,0.0003511898,0.00035420875,0.0000050836934,0.00007535088,0.003118558],"genre_scores_gemma":[0.45799413,0.0000038515045,0.54111737,0.00016357217,0.0003836337,0.000001618142,0.00001898541,0.000029710945,0.00028713234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997523,0.000022752074,0.00047223363,0.0009182352,0.00070344517,0.0003603124],"domain_scores_gemma":[0.9978199,0.00039840685,0.00040131822,0.001070705,0.00018314291,0.00012652944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090931816,0.00036358245,0.00060602167,0.0009480159,0.00046499804,0.0003892693,0.0010152543,0.00027080296,0.000030957075],"category_scores_gemma":[0.00026281134,0.000336032,0.00019646848,0.00029513013,0.0002120299,0.00019736442,0.0003627339,0.0003771378,0.000011710571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037673829,0.000015681106,0.00027492075,0.00003179067,0.00003962514,0.0000058217834,0.0014159214,0.93110365,0.0000016558945,0.006941751,0.0000059272306,0.060159486],"study_design_scores_gemma":[0.00009416935,0.000023355315,0.0000883612,0.000109362845,0.00011254132,0.0000024675649,1.7097436e-7,0.8357433,0.000034119275,0.16336249,0.00010747784,0.00032219072],"about_ca_topic_score_codex":0.000024609655,"about_ca_topic_score_gemma":0.00018005476,"teacher_disagreement_score":0.45716643,"about_ca_system_score_codex":0.00013248312,"about_ca_system_score_gemma":0.00013231677,"threshold_uncertainty_score":0.99990916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030618558,0.00045155824,0.9853029,0.0070994217,0.0035075662,0.0010195996,0.00011933002,0.0008266378,0.0016423495],"genre_scores_gemma":[0.024826873,0.00010516201,0.9734618,0.0003930724,0.00066647975,0.000038625287,0.00008111616,0.000080125246,0.00034672208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99301445,0.000036955684,0.0007269909,0.003792048,0.001247047,0.0011824863],"domain_scores_gemma":[0.9487529,0.0009485853,0.0007642457,0.049009986,0.0003444164,0.00017991265],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0022798255,0.00079509354,0.0007651844,0.0010009765,0.0009317433,0.002057887,0.18170553,0.0007583581,0.000013676061],"category_scores_gemma":[0.02495364,0.00076254836,0.00014674981,0.00032587652,0.0011028826,0.0034262692,0.32389957,0.0013129564,0.00003884832],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008193291,0.000023289487,0.00003490061,0.000074433774,0.000023886412,0.000035011195,0.00006939931,0.00031240238,0.00018796774,0.0009774873,0.002241554,0.9960115],"study_design_scores_gemma":[0.00021964088,0.00009352574,0.000026797046,0.00027193935,0.000010693868,0.000030056046,6.924089e-8,0.5572983,0.0019494,0.4304005,0.009164756,0.00053433096],"about_ca_topic_score_codex":0.000090709415,"about_ca_topic_score_gemma":0.0003713922,"teacher_disagreement_score":0.99547714,"about_ca_system_score_codex":0.00045040302,"about_ca_system_score_gemma":0.0006379259,"threshold_uncertainty_score":0.9994826},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005468894,0.0003852247,0.99408233,0.00030937942,0.0011402606,0.00079733686,0.000027826323,0.000620153,0.0025827845],"genre_scores_gemma":[0.2545894,0.000042891723,0.7445323,0.00040339777,0.00027033273,0.00004494282,0.00001616806,0.000046281628,0.000054303593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946855,0.0000639556,0.0007080473,0.0018981623,0.001824359,0.0008200062],"domain_scores_gemma":[0.99616927,0.00026481834,0.0005304176,0.0023108898,0.00048436716,0.00024022287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002491458,0.0006882318,0.000643011,0.00064234174,0.00040917448,0.00097452156,0.003896089,0.0005021934,0.000029198216],"category_scores_gemma":[0.00007638262,0.0007039355,0.00019611923,0.00018523428,0.0014212063,0.0011911736,0.00125047,0.0010643835,0.000008928911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020563855,0.000017105713,0.000009591425,0.000024297487,0.000014223834,0.00003765279,0.000312698,0.077470854,0.00023146466,0.14592303,0.00009061509,0.7758664],"study_design_scores_gemma":[0.0002322007,0.00007182789,0.000006819218,0.00048391405,0.000012042091,0.00006014728,3.824302e-8,0.7694654,0.0014255091,0.22625995,0.0013568936,0.0006252963],"about_ca_topic_score_codex":0.000043937052,"about_ca_topic_score_gemma":0.000019178962,"teacher_disagreement_score":0.77524114,"about_ca_system_score_codex":0.00048710112,"about_ca_system_score_gemma":0.00083698257,"threshold_uncertainty_score":0.99954116},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014633121,0.00015181676,0.9953405,0.0010296106,0.0014108515,0.00042728227,0.0000024894787,0.00006960365,0.0015531593],"genre_scores_gemma":[0.1461658,0.000027329026,0.85123503,0.0012472427,0.0008772096,0.000041320178,0.00021477364,0.000020295582,0.00017097553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973519,0.000020145762,0.00065709406,0.0008050234,0.0007869761,0.00037885254],"domain_scores_gemma":[0.9972364,0.0002459125,0.00093721837,0.0010279594,0.00043817447,0.000114364775],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010816104,0.00034892006,0.00035929566,0.0006808958,0.0008636866,0.0015719245,0.0020959568,0.00024559442,0.000010298197],"category_scores_gemma":[0.0000660858,0.00033654657,0.00017110076,0.0001975001,0.00028140852,0.0019428729,0.00071874924,0.0003424733,0.000025816216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005738979,0.000018241528,0.00009557482,0.000025720768,0.000025746678,0.0000024769934,0.0005754416,0.09780389,0.00004926355,0.07710712,0.000052929634,0.8242379],"study_design_scores_gemma":[0.00022404984,0.000074287535,0.00027715592,0.0001810208,0.000012568084,0.000006494955,3.791697e-7,0.9298219,0.00012325103,0.0678169,0.0011101044,0.0003518697],"about_ca_topic_score_codex":0.000011266798,"about_ca_topic_score_gemma":0.000030774623,"teacher_disagreement_score":0.832018,"about_ca_system_score_codex":0.0002938448,"about_ca_system_score_gemma":0.00026917443,"threshold_uncertainty_score":0.9999087},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004174075,0.00078914413,0.990241,0.005255408,0.002788115,0.00053221063,0.0000067327123,0.00016432087,0.00018134614],"genre_scores_gemma":[0.10000243,0.00025840473,0.8940414,0.0031004087,0.0023872922,0.000049335475,0.000011530791,0.000063659776,0.00008551872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947542,0.000075322925,0.00054696616,0.0022215967,0.0015927634,0.00080916716],"domain_scores_gemma":[0.9966986,0.00096906826,0.00030018692,0.0012684234,0.00019956744,0.0005641407],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019594706,0.0005534241,0.00067252567,0.0009068269,0.0007268992,0.0012826868,0.0030828982,0.0005680132,0.0000034316813],"category_scores_gemma":[0.000162508,0.00047422273,0.0001136228,0.00042039805,0.0028567668,0.0012745766,0.0027097622,0.0010144068,0.0000015385275],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011007828,0.000026479413,0.000036588903,0.00010130449,0.0000088745965,0.00007620126,0.0002795546,0.0007064146,0.000013131363,0.002942971,0.0005156651,0.9952818],"study_design_scores_gemma":[0.00048803235,0.00026352395,0.0000986958,0.0005432664,0.000007864533,0.00037837386,6.594366e-8,0.78599215,0.000026749098,0.20994973,0.0018317661,0.00041975762],"about_ca_topic_score_codex":0.0000259177,"about_ca_topic_score_gemma":0.00005152825,"teacher_disagreement_score":0.994862,"about_ca_system_score_codex":0.00027143655,"about_ca_system_score_gemma":0.001225767,"threshold_uncertainty_score":0.9998569},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021479565,0.0000297471,0.9557107,0.00022732218,0.00079250504,0.0006491864,0.000020443547,0.00004540493,0.042309877],"genre_scores_gemma":[0.95387775,0.0000011935201,0.037674695,0.0010551278,0.00039061633,0.00004268268,0.0000053735544,0.000029553034,0.0069230213],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99494046,0.000040322335,0.0007539953,0.001652643,0.0020027352,0.0006098652],"domain_scores_gemma":[0.99446386,0.0015761948,0.00040718075,0.0028253796,0.00037993214,0.00034743588],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024312357,0.00044887618,0.00060818397,0.0009462024,0.00068163953,0.0012673998,0.0055977292,0.0002268051,0.00011101855],"category_scores_gemma":[0.0024358297,0.0003583283,0.00014337816,0.00033697515,0.0011977123,0.00032921764,0.0012473692,0.0005548595,0.0008155481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030365167,0.000059653885,0.000012334007,0.000023145105,0.0000124608005,0.000023907383,0.0016143735,0.11907037,0.00018001281,0.06672387,0.00012054769,0.81212896],"study_design_scores_gemma":[0.00023694328,0.00016791909,0.00015309587,0.00025569584,0.000021117672,0.00006135381,0.0000013617918,0.1608779,0.00010928442,0.83317107,0.0042082337,0.0007360302],"about_ca_topic_score_codex":0.000006976353,"about_ca_topic_score_gemma":0.000015271491,"teacher_disagreement_score":0.95366293,"about_ca_system_score_codex":0.00015450045,"about_ca_system_score_gemma":0.0003994204,"threshold_uncertainty_score":0.99996245},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091330445,0.0020161567,0.9916528,0.0041039237,0.0005694375,0.00031279476,0.000015413627,0.000053173302,0.00036298478],"genre_scores_gemma":[0.37810925,0.00012120693,0.62011987,0.0012700382,0.00027968327,0.000007876376,0.00000408612,0.000022767541,0.00006526284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969351,0.0002199641,0.00041087114,0.0011090296,0.0009052121,0.0004198121],"domain_scores_gemma":[0.9964288,0.0021355483,0.00022955357,0.000784562,0.00027183368,0.0001497108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091782404,0.0003191321,0.00044470245,0.00027881176,0.00028203084,0.00020422948,0.0015709598,0.00020035906,0.0000039077995],"category_scores_gemma":[0.00027328564,0.00023629428,0.000042456555,0.00037769708,0.0015900612,0.00026073353,0.001894358,0.0006544346,0.0000020602456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013823408,0.000056930392,0.0014547622,0.000848532,0.000026777272,0.00002164171,0.0053838245,0.2354516,0.000010513132,0.18385081,0.0005940582,0.5722867],"study_design_scores_gemma":[0.00010438342,0.00014075199,0.004120669,0.00023772672,0.0000033388578,0.000075831966,2.350448e-7,0.6652935,0.000014629247,0.32965037,0.00018248022,0.00017607122],"about_ca_topic_score_codex":0.00003974742,"about_ca_topic_score_gemma":0.00007996127,"teacher_disagreement_score":0.57211065,"about_ca_system_score_codex":0.000105290455,"about_ca_system_score_gemma":0.0009189354,"threshold_uncertainty_score":0.96358013},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08341283,0.000071431634,0.9027249,0.012741817,0.00045424592,0.00028326578,0.000003571772,0.00006381993,0.00024410382],"genre_scores_gemma":[0.7310148,0.0000025655943,0.2671326,0.0014089246,0.0003875432,0.000005719538,0.00003070909,0.000011549592,0.0000056156564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978127,0.00009721925,0.00034605895,0.00049084565,0.000758514,0.0004946892],"domain_scores_gemma":[0.99847347,0.0004584212,0.00025008776,0.00039621643,0.00017473643,0.00024707886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015435363,0.00019988704,0.00025428314,0.00017824028,0.0002301461,0.0002677103,0.00021168584,0.00010867908,0.000019416097],"category_scores_gemma":[0.002355483,0.00016783345,0.000047109595,0.00074903277,0.00044887513,0.0007258908,0.00008273794,0.0005850774,0.000007497384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011353736,0.0005412588,0.13073057,0.00021661115,0.000036252637,0.00012028523,0.006703651,0.015600906,0.0870043,0.012734223,0.00063474395,0.7455637],"study_design_scores_gemma":[0.0008129133,0.0002585992,0.061551515,0.00017143038,0.000027170327,0.00021421816,0.0000077420045,0.9282044,0.004348338,0.0036081662,0.00050380285,0.00029169815],"about_ca_topic_score_codex":0.0001035675,"about_ca_topic_score_gemma":0.000017160592,"teacher_disagreement_score":0.9126035,"about_ca_system_score_codex":0.0002377484,"about_ca_system_score_gemma":0.00030928783,"threshold_uncertainty_score":0.68440497},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6415715,0.006993902,0.31933817,0.0014770848,0.0046303067,0.0013055875,0.00010971702,0.000096350195,0.024477357],"genre_scores_gemma":[0.9819341,0.00017129928,0.016584989,0.00057270273,0.0005669999,0.0000020044927,0.000035092075,0.0000149021735,0.000117963194],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982862,0.00002263567,0.00023647104,0.00090579374,0.00018060647,0.00036830676],"domain_scores_gemma":[0.9991488,0.000045505723,0.00014226355,0.00052334805,0.000051303545,0.000088816865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038726538,0.0002938829,0.0003073885,0.0001575841,0.0002042728,0.00014335536,0.00077492703,0.00033203917,0.0000054865623],"category_scores_gemma":[0.00007891494,0.00023907091,0.00006910392,0.000045263572,0.0013164686,0.000007090111,0.0008886973,0.0003564987,0.0000023070336],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006934279,0.0000733738,0.020441758,0.00009359508,0.000031095366,0.00014674722,0.00018646508,0.0013746334,0.028577745,0.0047059925,0.00006416211,0.9442351],"study_design_scores_gemma":[0.0028412535,0.002679052,0.24985035,0.0018370188,0.000045225213,0.00041560736,0.000001667746,0.028151011,0.035648733,0.6315716,0.04207333,0.004885154],"about_ca_topic_score_codex":0.000043235967,"about_ca_topic_score_gemma":0.0007135243,"teacher_disagreement_score":0.93934995,"about_ca_system_score_codex":0.000023581173,"about_ca_system_score_gemma":0.000082053084,"threshold_uncertainty_score":0.97490287},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01820797,0.0005622166,0.9748558,0.0012764967,0.0041336,0.00056781387,0.0000046727987,0.00030561798,0.000085825355],"genre_scores_gemma":[0.5804072,0.000048919617,0.4192185,0.00018100895,0.000085538624,0.000038175487,0.000001684033,0.00001633225,0.0000026185949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99404895,0.00017478282,0.00046550954,0.0025527675,0.0014036057,0.0013543929],"domain_scores_gemma":[0.9935844,0.00058566977,0.00037311637,0.0048254016,0.00034350704,0.00028792996],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002417379,0.0005482816,0.0005923366,0.0014820023,0.00082712725,0.002127151,0.015289824,0.00032338596,0.000004335222],"category_scores_gemma":[0.00057658396,0.0005211447,0.00019291887,0.0016828735,0.0016522396,0.0011588498,0.014802129,0.0021005648,0.00003006287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093809695,0.00006511842,0.00095566956,0.00008491083,0.0000127983085,0.00018693598,0.0008858803,0.34010568,0.0008233425,0.0040671052,0.000003208772,0.65279996],"study_design_scores_gemma":[0.00014621805,0.000052878044,0.001705247,0.000198223,0.0000017609051,0.00002542401,1.5392041e-7,0.5636501,0.0019703496,0.43183196,0.000022784227,0.00039494789],"about_ca_topic_score_codex":0.000059275237,"about_ca_topic_score_gemma":0.00013213702,"teacher_disagreement_score":0.652405,"about_ca_system_score_codex":0.0004374171,"about_ca_system_score_gemma":0.0009909524,"threshold_uncertainty_score":0.99972403},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004469925,0.00016362822,0.97146195,0.00066897797,0.004433663,0.0004695232,0.0000062283684,0.00007687974,0.018249206],"genre_scores_gemma":[0.49599966,0.0000026543937,0.48853868,0.0016178022,0.0019483544,0.0000566759,0.000033397093,0.00011742854,0.011685343],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697256,0.00023074125,0.00045860652,0.0012201931,0.00039541186,0.00072246924],"domain_scores_gemma":[0.9971383,0.0012370772,0.00040503836,0.0009789675,0.00016784137,0.000072729505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008420649,0.00044224135,0.0005538257,0.000826542,0.00038197188,0.00027186738,0.0015687047,0.0004759058,0.00008707648],"category_scores_gemma":[0.0005130049,0.0004075046,0.0001225224,0.00012990236,0.0005093323,0.0001214142,0.00030289352,0.0018434284,0.00003224282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007854403,0.000062587445,0.001401335,0.00007157302,0.000029506018,0.000076444274,0.017020099,0.0010667781,0.00021218056,0.13962537,0.00006608354,0.84028953],"study_design_scores_gemma":[0.0017218295,0.0006118809,0.01648249,0.0012314947,0.000027148597,0.00007321661,0.000005593877,0.005302231,0.00011115548,0.94260496,0.030230258,0.0015977286],"about_ca_topic_score_codex":0.00028037556,"about_ca_topic_score_gemma":0.00036912312,"teacher_disagreement_score":0.8386918,"about_ca_system_score_codex":0.00025711965,"about_ca_system_score_gemma":0.00009972043,"threshold_uncertainty_score":0.9998377},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48485455,0.00017284683,0.5142087,0.00001804551,0.00058545417,0.000051078347,0.000003099449,0.000096781485,0.0000094622455],"genre_scores_gemma":[0.894022,0.0000027434567,0.10536317,0.000077393925,0.00050305965,0.0000012776721,0.0000017249986,0.000028299668,3.425739e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984913,0.000015145215,0.00020181204,0.000301106,0.0003000744,0.0006905966],"domain_scores_gemma":[0.9993891,0.000099397555,0.000029141125,0.00029473918,0.000042034444,0.00014557567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002891437,0.00025407985,0.0002029858,0.0002786004,0.00011671502,0.00013100482,0.00024880108,0.000061142644,0.000013349363],"category_scores_gemma":[0.000031347012,0.00020632641,0.000028412273,0.0006791086,0.00010797987,0.0004168873,0.000050812487,0.00032341204,0.0000028281354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003965125,0.0000119703745,0.0036822124,0.00005985166,0.0000129899045,0.000018549556,0.0016662118,0.92831933,0.04222947,0.000019420759,0.0000508083,0.023925228],"study_design_scores_gemma":[0.00019748053,0.00003615907,0.002625559,0.00012392346,0.0000063511484,0.00026030032,0.0000025611168,0.8359227,0.16014847,0.00020172613,0.00010477278,0.0003699951],"about_ca_topic_score_codex":0.000011141184,"about_ca_topic_score_gemma":0.000006845986,"teacher_disagreement_score":0.40916744,"about_ca_system_score_codex":0.00014848355,"about_ca_system_score_gemma":0.000032370077,"threshold_uncertainty_score":0.8413747},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024702655,0.000077668585,0.9699111,0.0012434308,0.00090306555,0.00038087938,0.0000052711293,0.00015826501,0.027295632],"genre_scores_gemma":[0.38812432,0.000048673784,0.60842186,0.0009480439,0.00067631627,0.000008091371,0.000010373968,0.000041989075,0.0017203543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996276,0.00003284283,0.0005152308,0.0013767481,0.001009705,0.00078943296],"domain_scores_gemma":[0.99682516,0.00046698036,0.00040015235,0.0017325208,0.00030693554,0.00026823505],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013030834,0.00044822093,0.0005511227,0.00063514727,0.00069597363,0.0018006102,0.005104827,0.00030323875,0.00003487042],"category_scores_gemma":[0.00019955714,0.00041157086,0.00012114337,0.00025471166,0.0009793952,0.001129399,0.0017967359,0.0008195613,0.00009632959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026949938,0.000019882307,0.00054911355,0.00005581667,0.000024826068,0.00008225787,0.0012127598,0.031116884,0.000080526705,0.023498533,0.000039002396,0.9433177],"study_design_scores_gemma":[0.00043612393,0.00016231037,0.00032970659,0.0005727234,0.000008814064,0.000020404037,1.641122e-7,0.9275494,0.00071481447,0.0678914,0.0015801353,0.0007339588],"about_ca_topic_score_codex":0.000032340777,"about_ca_topic_score_gemma":0.000030869494,"teacher_disagreement_score":0.94258374,"about_ca_system_score_codex":0.00016225166,"about_ca_system_score_gemma":0.00092868396,"threshold_uncertainty_score":0.99983364},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3968179,0.00027787226,0.48575243,0.013900127,0.006706536,0.0040288293,0.00024528758,0.00080837996,0.09146263],"genre_scores_gemma":[0.99234974,0.000018138473,0.0065785646,0.00032107387,0.00024878426,0.0000032788257,0.000001250172,0.000020279189,0.00045886677],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963383,0.00006727436,0.0004351781,0.00094106054,0.0014464423,0.00077173655],"domain_scores_gemma":[0.99759096,0.00017509946,0.00054467615,0.00086953363,0.00063790916,0.0001818399],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015588661,0.00037517108,0.0005980647,0.0004890415,0.0012725325,0.0004651202,0.0031510503,0.000570012,0.000032965363],"category_scores_gemma":[0.0010182267,0.0003743867,0.00014119354,0.00025139694,0.006488825,0.00058445084,0.000701525,0.00083094666,0.000029051433],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015783167,0.00022185166,0.012849337,0.00025340015,0.00007692471,0.00016058366,0.059117243,0.002318941,0.0020783783,0.051227182,0.00025743578,0.8712809],"study_design_scores_gemma":[0.0011233167,0.00083387824,0.22234726,0.0022657756,0.00007648606,0.000012674258,0.00022746295,0.0005911395,0.0035197951,0.7642301,0.0019942096,0.002777946],"about_ca_topic_score_codex":0.001172935,"about_ca_topic_score_gemma":0.0118227545,"teacher_disagreement_score":0.8685029,"about_ca_system_score_codex":0.0005863525,"about_ca_system_score_gemma":0.0019167317,"threshold_uncertainty_score":0.99987084},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003944176,0.0002110795,0.993223,0.0018002656,0.0011032766,0.0014009484,0.000020042351,0.000043253956,0.0021586702],"genre_scores_gemma":[0.09169669,0.000014516885,0.9043731,0.002044774,0.000847388,0.0001536866,0.00009123991,0.000023608352,0.00075497635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967259,0.000047410886,0.0004703272,0.0012563532,0.000996701,0.00050329906],"domain_scores_gemma":[0.99772036,0.00053395366,0.0002717624,0.0011725611,0.00019990926,0.000101433885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018847244,0.00038338703,0.0003914261,0.0006063341,0.00049109984,0.001025453,0.0032158575,0.00014852473,0.00000316364],"category_scores_gemma":[0.00009835846,0.0003052517,0.00009831486,0.0003473359,0.00020398399,0.0004424474,0.00054459256,0.00039186672,0.000014094642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039476523,0.00013927564,0.0000137048,0.0000892938,0.000012128829,0.000022437263,0.0029303823,0.5472577,0.000058846643,0.1612153,0.00042724385,0.28779417],"study_design_scores_gemma":[0.00046937086,0.00025460662,0.00025802362,0.00016285497,0.0000057878447,0.00006440407,0.0000010077641,0.89260477,0.00008757859,0.09146021,0.014149784,0.00048159788],"about_ca_topic_score_codex":0.000025962763,"about_ca_topic_score_gemma":0.000113762224,"teacher_disagreement_score":0.34534705,"about_ca_system_score_codex":0.00031959623,"about_ca_system_score_gemma":0.0002963679,"threshold_uncertainty_score":0.99994},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006158954,0.00019109195,0.9907201,0.001174648,0.0015326813,0.00019607299,0.000037152655,0.0002197841,0.005866882],"genre_scores_gemma":[0.7624676,0.000073271534,0.2344973,0.0013023558,0.00043095852,0.000006905111,0.000054790635,0.00005649308,0.0011103327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693304,0.0001082051,0.00053931033,0.0010743551,0.0007728246,0.00057226507],"domain_scores_gemma":[0.9951728,0.00059119833,0.0005724608,0.003206215,0.0002943485,0.00016298852],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009624397,0.0005017603,0.00054907415,0.00069383526,0.0013623044,0.0025952489,0.008344896,0.0002799764,0.000050975057],"category_scores_gemma":[0.00032097616,0.0004979964,0.00012208376,0.00045862392,0.0007693182,0.0013512846,0.004627033,0.0014163062,0.00008659584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009256461,0.00011928925,0.0008997286,0.00005779043,0.00005973553,0.00008013552,0.004789352,0.08429805,0.000049297643,0.07226232,0.00024318435,0.83713186],"study_design_scores_gemma":[0.0004311159,0.00006159889,0.0005117595,0.0022054925,0.00003216131,0.00001708582,0.0000022049182,0.85586965,0.00050497695,0.12815471,0.010954063,0.0012552126],"about_ca_topic_score_codex":0.00014998436,"about_ca_topic_score_gemma":0.00057309173,"teacher_disagreement_score":0.83587664,"about_ca_system_score_codex":0.00027993968,"about_ca_system_score_gemma":0.00045056897,"threshold_uncertainty_score":0.9999378},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051778334,0.00018542753,0.99600625,0.00048073533,0.00043936496,0.00020995285,0.0000055374994,0.00007619583,0.0020787818],"genre_scores_gemma":[0.11007035,0.000056517714,0.88722944,0.00025802248,0.00053889456,0.0000026337732,0.0000086138,0.000041781343,0.001793769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693584,0.000045917746,0.00039461406,0.0013894029,0.0007177526,0.00051644555],"domain_scores_gemma":[0.99764633,0.00020917511,0.00033428037,0.0013978241,0.00026304784,0.00014933644],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00095809257,0.0003795799,0.0005197558,0.00047061336,0.00086350756,0.0015580348,0.0019106162,0.00022798683,0.000025645355],"category_scores_gemma":[0.00013762567,0.00034770946,0.00010919699,0.0002335984,0.00086853816,0.0015641585,0.0022811894,0.0005457977,0.00001621049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018025514,0.00002261538,0.00029174125,0.000060334536,0.00004904842,0.00019979806,0.0021802937,0.06367621,0.0021928966,0.009385375,0.0000081523895,0.92191553],"study_design_scores_gemma":[0.00013765506,0.00007034958,0.000492804,0.00019490284,0.000013979329,0.000104506966,2.672167e-7,0.9651298,0.0009442077,0.032286096,0.00021335826,0.00041209752],"about_ca_topic_score_codex":0.00023055471,"about_ca_topic_score_gemma":0.00007534064,"teacher_disagreement_score":0.9215034,"about_ca_system_score_codex":0.00013145241,"about_ca_system_score_gemma":0.00027032854,"threshold_uncertainty_score":0.9998975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40301552,0.0007203942,0.59317523,0.0008160335,0.00028910386,0.0011761171,0.000013423446,0.000044693184,0.00074946886],"genre_scores_gemma":[0.97706324,0.00006435016,0.0225848,0.00011476831,0.00005468042,0.000014593619,8.146151e-7,0.00001030878,0.00009242289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702483,0.00016124334,0.0006287174,0.0009843748,0.0008156468,0.0003852006],"domain_scores_gemma":[0.99756867,0.00045652236,0.0006866233,0.0009541151,0.00025188713,0.00008219151],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017015673,0.00037342255,0.00073525804,0.00033781142,0.000353162,0.0004264271,0.0024844958,0.00025831565,0.0000014609718],"category_scores_gemma":[0.00031398173,0.00026855283,0.00007653294,0.00033620346,0.002568554,0.00076679693,0.0011860565,0.0006934869,0.0000031891602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001169817,0.000060914394,0.0072834715,0.00026940563,0.0000388758,0.000021676788,0.1720356,0.7267352,0.008195613,0.04538347,0.000009888389,0.03984892],"study_design_scores_gemma":[0.012859445,0.004726884,0.30723715,0.015467225,0.00013206892,0.00020211145,0.0007560952,0.17676581,0.014759296,0.44639212,0.011736023,0.008965766],"about_ca_topic_score_codex":0.00035345164,"about_ca_topic_score_gemma":0.0007516349,"teacher_disagreement_score":0.57404774,"about_ca_system_score_codex":0.00016425691,"about_ca_system_score_gemma":0.00049949874,"threshold_uncertainty_score":0.9999767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012679357,0.0005004657,0.9949128,0.0011410532,0.0010191317,0.0002959564,0.0000024225783,0.00033542016,0.0016659743],"genre_scores_gemma":[0.07253195,0.00020217376,0.92501533,0.0010062429,0.0003057671,0.000009198995,0.0000049526493,0.000035808123,0.00088855514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963741,0.000044743563,0.0005462122,0.0016019733,0.00075406383,0.0006789165],"domain_scores_gemma":[0.9975114,0.00031667235,0.00038217191,0.001397996,0.00019645746,0.00019528989],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095201354,0.00052736397,0.0006493482,0.0008871084,0.0004143894,0.0005411932,0.003193678,0.00038225477,0.0000055674755],"category_scores_gemma":[0.0002598469,0.0004907929,0.00009846916,0.00029726909,0.00084143726,0.00077203003,0.0018491225,0.00090527924,0.0000163926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027107282,0.00008549837,0.0014343415,0.00011396862,0.000026552874,0.00034194352,0.0037776497,0.13036166,0.00008530809,0.008939294,0.00033869705,0.854468],"study_design_scores_gemma":[0.00030437743,0.0001566844,0.00061891763,0.00058325235,0.0000041469066,0.000055780805,2.3901939e-7,0.94061106,0.00041961187,0.055467095,0.0011297863,0.0006490541],"about_ca_topic_score_codex":0.00007895568,"about_ca_topic_score_gemma":0.000053675547,"teacher_disagreement_score":0.8538189,"about_ca_system_score_codex":0.00017689622,"about_ca_system_score_gemma":0.0004363979,"threshold_uncertainty_score":0.99975437},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001994095,0.0009231693,0.99145555,0.00087018136,0.00055167614,0.002481538,0.000017433586,0.000025199564,0.0016811471],"genre_scores_gemma":[0.34617642,0.00014572221,0.6515604,0.000118159376,0.0009221735,0.00018939753,0.000009238917,0.00002468443,0.0008537672],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693865,0.00020149468,0.00030725455,0.00080489076,0.0013735197,0.00037419944],"domain_scores_gemma":[0.99591345,0.0016627471,0.0004233323,0.00041224196,0.0014846097,0.000103644976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008797614,0.00019759394,0.00045391524,0.00027924014,0.0011322494,0.0003109799,0.0008923421,0.00017742418,0.000011294497],"category_scores_gemma":[0.002812122,0.00017397819,0.00009498714,0.00007061479,0.0026769638,0.00074909546,0.00021763972,0.00015611517,3.4300115e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012177383,0.000031769567,0.000033752687,0.00024462133,0.00003764702,0.00000248403,0.0646017,0.0005702112,0.0009015936,0.057957765,0.000019670551,0.875477],"study_design_scores_gemma":[0.0012756481,0.00071352517,0.00014877244,0.00075001776,0.000062875864,0.0000016546835,0.00055316306,0.05036717,0.0034406986,0.94102293,0.0010465184,0.000617042],"about_ca_topic_score_codex":0.00040974183,"about_ca_topic_score_gemma":0.0012634112,"teacher_disagreement_score":0.88306516,"about_ca_system_score_codex":0.00029890516,"about_ca_system_score_gemma":0.0007304771,"threshold_uncertainty_score":0.9863385},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015066598,0.00066788273,0.9806493,0.00089632627,0.0018325102,0.0005691872,0.000015691754,0.00024179873,0.00006073155],"genre_scores_gemma":[0.7503271,0.000008140781,0.24914716,0.00017535868,0.00027170754,0.000045712364,0.0000068257236,0.000015509055,0.0000024484743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99513257,0.000070557515,0.0005074713,0.002126908,0.0012369066,0.00092558976],"domain_scores_gemma":[0.99567854,0.00014539632,0.0006160292,0.0029032268,0.00043052144,0.00022626261],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010197756,0.0005727304,0.0006429542,0.00035790872,0.00064595114,0.002983183,0.0069638924,0.00027969904,0.0000012393077],"category_scores_gemma":[0.00013966837,0.00043873425,0.00010644058,0.00087545766,0.0006203135,0.0010014267,0.0034059307,0.0010292988,0.000010285675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007002363,0.000096214964,0.0061063725,0.0001368528,0.000007916736,0.000093976356,0.0009874873,0.26163214,0.00006236152,0.00017725003,0.000008473258,0.7306839],"study_design_scores_gemma":[0.00040676442,0.00010705888,0.0077476124,0.0014434024,0.00000512017,0.000066335655,6.0411236e-7,0.97856617,0.0015261376,0.009317538,0.00017295779,0.0006403194],"about_ca_topic_score_codex":0.0002968568,"about_ca_topic_score_gemma":0.00040092142,"teacher_disagreement_score":0.73526055,"about_ca_system_score_codex":0.00027996133,"about_ca_system_score_gemma":0.0014445848,"threshold_uncertainty_score":0.99980646},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016965022,0.000057183865,0.9793289,0.00032684612,0.0015224045,0.0005271774,0.000038561517,0.00006869163,0.001165261],"genre_scores_gemma":[0.9023111,0.000020168127,0.09718857,0.00021812164,0.00019040682,0.000011578024,0.000018438439,0.000018136989,0.000023469483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996449,0.000021653228,0.00066378445,0.0011053812,0.001230564,0.000529611],"domain_scores_gemma":[0.99715203,0.00025009198,0.0007046608,0.0015250951,0.00024847724,0.000119630255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009672525,0.0004182702,0.00044262555,0.0011590187,0.0005070432,0.00041277803,0.0023073645,0.00018359168,0.00007737748],"category_scores_gemma":[0.000031487707,0.00038755758,0.00015435122,0.00030145148,0.0005304453,0.0002331493,0.0007636952,0.00046983513,0.000016666387],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008088001,0.000052925265,0.000110082445,0.00004127654,0.00001636923,0.000016822312,0.0013693055,0.017853342,0.00025154022,0.2418744,0.00001081713,0.73839504],"study_design_scores_gemma":[0.0024819495,0.0016358336,0.013495353,0.0008759737,0.000048072925,0.00005870425,0.000006653916,0.51639444,0.014702663,0.44684356,0.0015853668,0.0018714559],"about_ca_topic_score_codex":0.00027074717,"about_ca_topic_score_gemma":0.0005125237,"teacher_disagreement_score":0.8853461,"about_ca_system_score_codex":0.0002522787,"about_ca_system_score_gemma":0.00038538396,"threshold_uncertainty_score":0.9998576},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053202657,0.0010185747,0.9694722,0.00072076725,0.0008961585,0.0002704642,0.000020067155,0.0002522348,0.027296297],"genre_scores_gemma":[0.5704213,0.00008928339,0.4204197,0.0010593204,0.0015958033,0.0000159065,0.000019455238,0.00008291357,0.006296329],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99642,0.000040304163,0.0004229162,0.0015868793,0.00086863886,0.0006612443],"domain_scores_gemma":[0.9959208,0.0006871947,0.00048239392,0.0025946812,0.0001382005,0.00017674538],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009129353,0.0005383421,0.0006155453,0.0004292107,0.0004882361,0.0008738999,0.0059976242,0.00033672003,0.000019969406],"category_scores_gemma":[0.00016033008,0.00046370918,0.00015166121,0.00018102715,0.0010490677,0.0013158753,0.0019024597,0.0008932193,0.000102202546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022005088,0.000010415585,0.00022650027,0.000027802287,0.000017982213,0.00012690345,0.00089799357,0.00043063654,0.000022146927,0.14812383,0.000035366844,0.8500782],"study_design_scores_gemma":[0.00032471793,0.00016179486,0.0014768946,0.0010203596,0.000018656141,0.00003463454,2.899263e-7,0.054379635,0.0009976308,0.92892593,0.011455705,0.0012037397],"about_ca_topic_score_codex":0.000023318224,"about_ca_topic_score_gemma":0.000040987805,"teacher_disagreement_score":0.8488745,"about_ca_system_score_codex":0.00022539064,"about_ca_system_score_gemma":0.00031722954,"threshold_uncertainty_score":0.9997815},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063751556,0.0005001011,0.9855199,0.0029643713,0.0028691937,0.0012395637,0.000058011618,0.00016879638,0.006042579],"genre_scores_gemma":[0.9500452,0.00013732075,0.04472602,0.0012745536,0.0009271027,0.000037762882,0.000026216245,0.00006263842,0.00276317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99560297,0.000053489573,0.0006452623,0.0019746039,0.00090386847,0.00081978756],"domain_scores_gemma":[0.9957741,0.00044580156,0.00053334585,0.0024622038,0.00044700434,0.0003375545],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014895985,0.0006209063,0.00077997876,0.00051232486,0.00070756976,0.0015828117,0.0038675691,0.0004897894,0.000021309752],"category_scores_gemma":[0.00019694002,0.00059638073,0.0001927568,0.00019434965,0.0009433072,0.00097055646,0.0014670131,0.00070010655,0.000039442908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017598121,0.00077644363,0.0018250872,0.0032021008,0.00032961552,0.00046833477,0.19463223,0.0009226672,0.0010282611,0.35479334,0.00830263,0.4335433],"study_design_scores_gemma":[0.0005730941,0.00018575178,0.000081416205,0.0003982639,0.00001783713,0.00008799211,7.347313e-7,0.54933685,0.0010441736,0.41148695,0.03596035,0.00082659774],"about_ca_topic_score_codex":0.000068705296,"about_ca_topic_score_gemma":0.0004098578,"teacher_disagreement_score":0.9494077,"about_ca_system_score_codex":0.00020989667,"about_ca_system_score_gemma":0.00044124614,"threshold_uncertainty_score":0.99964875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4497739,0.000020832176,0.54938275,0.00020984834,0.00014055637,0.00031922405,0.0000018527498,0.000067135414,0.00008385664],"genre_scores_gemma":[0.6172976,0.0000012115648,0.3824618,0.00005759343,0.000093091585,0.00007590056,9.2359215e-7,0.000011832124,3.926981e-8],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984681,0.000011676574,0.00024439103,0.00048588903,0.00026087262,0.00052908337],"domain_scores_gemma":[0.9989345,0.00026977234,0.000049364236,0.0005640619,0.00007638376,0.00010592209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036239543,0.00019394542,0.00021111338,0.0003101201,0.0002435968,0.000430005,0.00097071356,0.000101600766,0.0000046477885],"category_scores_gemma":[0.00023135806,0.00016838126,0.00003514885,0.000914959,0.000495962,0.00049834495,0.000063049534,0.00027726547,0.0000023226617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018293335,0.0003437623,0.052345924,0.0005950726,0.00004824976,0.00006890672,0.0054373886,0.18503964,0.3343578,0.005811919,0.00001358296,0.41575482],"study_design_scores_gemma":[0.0041001188,0.00087019254,0.27318168,0.0009449435,0.000030968466,0.000076897784,0.00002127885,0.4152509,0.18098919,0.12257953,0.000026546028,0.0019277621],"about_ca_topic_score_codex":0.000013461529,"about_ca_topic_score_gemma":0.00061997556,"teacher_disagreement_score":0.41382706,"about_ca_system_score_codex":0.00011181419,"about_ca_system_score_gemma":0.00011435812,"threshold_uncertainty_score":0.68663883},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000029157968,0.00005235821,0.96072364,0.00066659966,0.0008479359,0.032283686,0.000008029539,0.00034037873,0.0050744493],"genre_scores_gemma":[0.026308013,0.0000119507085,0.9251564,0.0023709442,0.0017456589,0.040604312,0.000018735807,0.00012948416,0.0036544967],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941617,0.000105986204,0.00071034284,0.002430984,0.0015480195,0.0010429324],"domain_scores_gemma":[0.9928452,0.0003798195,0.0008802667,0.005135613,0.0004659747,0.00029317],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015456057,0.00068416225,0.00073057105,0.00063182344,0.00072962424,0.0017901447,0.012257585,0.00045213025,0.000022132828],"category_scores_gemma":[0.00049492955,0.00064946467,0.00017943632,0.00068381306,0.0014296301,0.0019168862,0.0037484157,0.0014027595,0.00016530653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015239047,0.00027864004,0.00016933563,0.00041206105,0.000018469495,0.00020919107,0.002624677,0.0044470862,0.00012470665,0.123273484,0.00035028232,0.8680768],"study_design_scores_gemma":[0.00036421086,0.00012437328,0.00008199518,0.0006407892,0.0000029786731,0.000041908646,3.7400913e-8,0.17167415,0.002166334,0.81080204,0.013403935,0.0006972259],"about_ca_topic_score_codex":0.0000075922308,"about_ca_topic_score_gemma":0.000038352053,"teacher_disagreement_score":0.8673796,"about_ca_system_score_codex":0.0007587362,"about_ca_system_score_gemma":0.002969439,"threshold_uncertainty_score":0.99959564},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016991791,0.00027930233,0.9822569,0.010469131,0.001014174,0.0005559586,0.000013100719,0.00021100906,0.003501278],"genre_scores_gemma":[0.7681275,0.00012292457,0.23039263,0.00060467416,0.00055366196,0.00001769835,0.000013761507,0.00004592861,0.00012118372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603784,0.000104505154,0.00061892136,0.0013886854,0.0011515022,0.00069857156],"domain_scores_gemma":[0.9895288,0.001260088,0.0008030668,0.008216814,0.0001395841,0.000051657917],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0020262564,0.0004960162,0.0005753829,0.00071447634,0.00064359885,0.00065091444,0.047173694,0.00049388135,0.000014212693],"category_scores_gemma":[0.0061148033,0.0004004034,0.00010639426,0.0005778745,0.0011487575,0.0008766543,0.060144722,0.0013111639,0.000009178022],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029048764,0.00009679951,0.003756551,0.0002474173,0.000027398914,0.00009926633,0.0021359015,0.039013848,0.00059655216,0.03187136,0.0032416915,0.91888416],"study_design_scores_gemma":[0.00013483262,0.00004647041,0.0008589042,0.00058631616,0.0000034373859,0.0000042007896,6.652942e-7,0.5949556,0.0009895302,0.40187162,0.00021796752,0.00033046235],"about_ca_topic_score_codex":0.00004576901,"about_ca_topic_score_gemma":0.00020559554,"teacher_disagreement_score":0.9185537,"about_ca_system_score_codex":0.00034577402,"about_ca_system_score_gemma":0.00027204602,"threshold_uncertainty_score":0.9998448},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07918042,0.00053555594,0.9150313,0.0021130482,0.0026089263,0.00037237437,0.0000055390155,0.00014298239,0.000009851378],"genre_scores_gemma":[0.89731187,0.000022436112,0.10171353,0.00036821698,0.0005367962,0.000027061536,0.000006951022,0.000012908467,2.4602318e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963568,0.0001702777,0.0004765437,0.0016512653,0.0006272094,0.00071789406],"domain_scores_gemma":[0.99771523,0.0005380629,0.0003107391,0.0011029465,0.00017646339,0.00015658296],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012163789,0.00039266894,0.0004947919,0.0006466627,0.00046074291,0.0011452008,0.0026622275,0.0003795372,0.0000025418124],"category_scores_gemma":[0.00014052266,0.00041517895,0.000074204385,0.0008679292,0.000829191,0.000852152,0.002019307,0.001562113,0.0000012670107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006439176,0.000011273878,0.010008482,0.000026693435,0.0000060895745,0.000026742875,0.0006717045,0.7001424,0.00004046417,0.00010464004,0.000002513965,0.2889526],"study_design_scores_gemma":[0.0003809648,0.00007067256,0.07451472,0.00024101246,0.00000482721,0.000036640187,4.0318676e-7,0.90720737,0.00021398276,0.016923252,0.000006965463,0.00039919058],"about_ca_topic_score_codex":0.00035952174,"about_ca_topic_score_gemma":0.00043511798,"teacher_disagreement_score":0.81813145,"about_ca_system_score_codex":0.00046497013,"about_ca_system_score_gemma":0.000498095,"threshold_uncertainty_score":0.9998917},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021577094,0.00056879513,0.98425263,0.0002517528,0.0015401925,0.00028500363,0.000004407473,0.00010424097,0.012971414],"genre_scores_gemma":[0.041982718,0.00011608006,0.95692956,0.00016242196,0.000218044,0.000009715693,0.0000022718225,0.000022993287,0.00055619294],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690884,0.000032071726,0.0005446379,0.0011346769,0.0009324161,0.00044733842],"domain_scores_gemma":[0.9956445,0.0003507196,0.0007787666,0.0025177582,0.00060491764,0.000103346305],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012853954,0.00039819995,0.00052711455,0.0006686245,0.0002757844,0.00044761476,0.006433545,0.00028658577,0.000011838959],"category_scores_gemma":[0.0007520904,0.00035378448,0.00008591463,0.0003612367,0.001583119,0.0011502785,0.0014453316,0.00050568045,0.000020201689],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006740974,0.000022907994,0.00006887755,0.0002603038,0.000008957474,0.00001553267,0.0007317783,0.0011015232,0.00016978246,0.09906999,0.000012750892,0.89853084],"study_design_scores_gemma":[0.0003141088,0.0003789797,0.0006281768,0.0010892224,0.00001759606,0.000098572345,2.5088883e-7,0.18145928,0.04398753,0.7647748,0.0060105473,0.0012409333],"about_ca_topic_score_codex":0.000017237142,"about_ca_topic_score_gemma":0.00002694259,"teacher_disagreement_score":0.89728993,"about_ca_system_score_codex":0.00012568565,"about_ca_system_score_gemma":0.0010501,"threshold_uncertainty_score":0.9998914},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027926854,0.000122048885,0.99109894,0.00031584167,0.002104774,0.00088912866,0.000010815967,0.00018518636,0.004993988],"genre_scores_gemma":[0.7448816,0.000023061033,0.2536085,0.0006158473,0.00044968695,0.0000537649,0.000052520772,0.000029451616,0.00028562162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663913,0.000048905815,0.0005949087,0.0011387618,0.0010846915,0.00049358036],"domain_scores_gemma":[0.9969366,0.00015394145,0.00074907334,0.0017489326,0.00029696152,0.000114487986],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00060371094,0.00047366755,0.00045943138,0.00046580643,0.0006432835,0.0010387105,0.0028088556,0.00036458415,0.000018584215],"category_scores_gemma":[0.000030305158,0.0004305818,0.00014265874,0.00014983716,0.00031900828,0.0021784226,0.00050764944,0.000522283,0.00009016452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019333642,0.00021220389,0.0003748305,0.0002670942,0.00001677321,0.00007556802,0.002974476,0.025520667,0.0026259285,0.030144729,0.00021446066,0.93755394],"study_design_scores_gemma":[0.0008055547,0.00026710107,0.0015563975,0.0011998097,0.000025084375,0.00006527035,1.7162753e-7,0.9544143,0.011521142,0.02656068,0.0025468585,0.0010375984],"about_ca_topic_score_codex":0.00006903984,"about_ca_topic_score_gemma":0.00009547011,"teacher_disagreement_score":0.93651634,"about_ca_system_score_codex":0.00041938914,"about_ca_system_score_gemma":0.00036902635,"threshold_uncertainty_score":0.99999833},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020359597,0.00037546293,0.990751,0.0017496899,0.0019638794,0.0007356244,0.000006151578,0.00021629034,0.004181495],"genre_scores_gemma":[0.017870318,0.000026875976,0.97622645,0.0018731817,0.000701017,0.000017450988,0.0000023065725,0.000062662504,0.0032197305],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99366003,0.00007001888,0.00051102234,0.002506594,0.0020151376,0.0012371937],"domain_scores_gemma":[0.9932386,0.00075514155,0.00028839562,0.0044571557,0.00047543313,0.0007852335],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017583163,0.00071959395,0.0007500124,0.0015682703,0.00060620776,0.0014910863,0.010545315,0.00043422947,0.000036038433],"category_scores_gemma":[0.0007998653,0.0006530655,0.00026433961,0.0006900185,0.0008515669,0.0010500684,0.0037378988,0.0016383178,0.0002252777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019448442,0.0000171596,0.000045759145,0.00001838563,0.000015470092,0.00014198812,0.00046061722,0.005279426,0.00012886927,0.03758777,0.00012641614,0.9561587],"study_design_scores_gemma":[0.00034833842,0.00031541983,0.00015624019,0.0004535406,0.0000069683315,0.00007687927,5.207045e-8,0.036462564,0.0016097007,0.9524949,0.00706448,0.0010109214],"about_ca_topic_score_codex":0.00006176249,"about_ca_topic_score_gemma":0.00024237703,"teacher_disagreement_score":0.95514774,"about_ca_system_score_codex":0.00026426173,"about_ca_system_score_gemma":0.0012076054,"threshold_uncertainty_score":0.99959207},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082629666,0.0078034415,0.90662616,0.00009547886,0.0006162218,0.00028463316,0.000017834593,0.000062596366,0.0018639795],"genre_scores_gemma":[0.974076,0.000044886092,0.022703476,0.0012812092,0.0011349476,0.000003777706,0.000050402028,0.000038884595,0.00066643825],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99804187,0.000035511162,0.00028532377,0.0008589292,0.00027106883,0.0005073169],"domain_scores_gemma":[0.9990732,0.000039480234,0.00016169836,0.00052366214,0.00008633574,0.00011564217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000526861,0.0003521139,0.00031209216,0.00010764093,0.00015219877,0.00010332414,0.0006499298,0.00045398145,0.000014007472],"category_scores_gemma":[0.000035838424,0.0002769334,0.0001073893,0.00013203395,0.00022228595,0.0000052301484,0.0005383248,0.00029890248,0.000014329434],"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.000011704431,0.000013022199,0.00012321518,0.00004407339,0.000022670065,0.000016182228,0.00018699381,0.0005261917,0.80827445,0.00015204928,0.0001122939,0.19051714],"study_design_scores_gemma":[0.00051268045,0.00040221514,0.000050151997,0.0008045237,0.000040695853,0.00019014596,0.0000039245383,0.030182898,0.9476555,0.0006594756,0.018012458,0.0014853205],"about_ca_topic_score_codex":0.000021004005,"about_ca_topic_score_gemma":0.000011363593,"teacher_disagreement_score":0.8914463,"about_ca_system_score_codex":0.00008174582,"about_ca_system_score_gemma":0.00007313223,"threshold_uncertainty_score":0.9999683},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056781986,0.00076706626,0.91711456,0.0008179721,0.015761767,0.0028751264,0.000038384667,0.00011128385,0.061946023],"genre_scores_gemma":[0.9801064,0.00034856843,0.010906841,0.0011722452,0.0036384903,0.00013141101,0.000068260924,0.00006569873,0.003562052],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99442065,0.00031979528,0.0029534888,0.00060754846,0.00094096194,0.00075756357],"domain_scores_gemma":[0.99253374,0.0012723481,0.0033991076,0.001527244,0.0010569099,0.00021064961],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007427968,0.0003266536,0.0011748563,0.00051940314,0.0005975089,0.0000747914,0.0014081087,0.0010419963,0.00003089453],"category_scores_gemma":[0.0014731319,0.0002772166,0.00016221366,0.00011516029,0.00058263063,0.0005226246,0.00034192245,0.0020369198,0.00023170644],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045624267,0.000021348345,0.0034213439,0.0016872172,0.000024460336,0.000004019433,0.0019334522,0.0007265035,0.000010034732,0.013526399,0.00034908144,0.9782505],"study_design_scores_gemma":[0.0041818097,0.0020408544,0.02055539,0.023332492,0.00012811915,0.00006385346,0.000021196513,0.29216093,0.00012617558,0.04355898,0.6113119,0.0025182767],"about_ca_topic_score_codex":0.0010894585,"about_ca_topic_score_gemma":0.00033544167,"teacher_disagreement_score":0.9795386,"about_ca_system_score_codex":0.0006177699,"about_ca_system_score_gemma":0.005373401,"threshold_uncertainty_score":0.999968},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030074344,0.00011344759,0.98736525,0.0009140427,0.0024747767,0.00044866724,0.0000020653965,0.00025114446,0.008129874],"genre_scores_gemma":[0.72983426,0.000008276799,0.26540217,0.0017350493,0.001018702,0.00001529437,0.0000033205354,0.00004807641,0.001934887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947989,0.000038924118,0.00072301895,0.0022016591,0.0012345106,0.0010029926],"domain_scores_gemma":[0.99656886,0.00036953122,0.00052501366,0.0018753135,0.0003394859,0.0003218094],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013688249,0.0006835619,0.0008093302,0.00095235807,0.0006187102,0.0018782492,0.008115103,0.00030976886,0.000042760585],"category_scores_gemma":[0.00035548225,0.00062069256,0.0003007683,0.0003211492,0.00036014715,0.0008177227,0.0032984114,0.0010103381,0.00029030253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003776604,0.000022860524,0.000021937796,0.000027625521,0.00002617742,0.00018519255,0.0037112853,0.12546569,0.000025551231,0.052064545,0.00020012032,0.81824523],"study_design_scores_gemma":[0.00014681394,0.00014454646,0.000038107162,0.0007623582,0.000011455058,0.000059249385,3.3712433e-7,0.98749197,0.00023720629,0.0028044116,0.0074625956,0.0008409628],"about_ca_topic_score_codex":0.000018763327,"about_ca_topic_score_gemma":0.00014285264,"teacher_disagreement_score":0.8620263,"about_ca_system_score_codex":0.0003499056,"about_ca_system_score_gemma":0.00048291028,"threshold_uncertainty_score":0.99962443},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049087575,0.0001765117,0.9915394,0.0003263796,0.0019659724,0.00068306975,0.00000867542,0.0014064225,0.0038444402],"genre_scores_gemma":[0.06532444,0.00027011367,0.9312753,0.0006329667,0.0009061945,0.000055096432,0.000004816268,0.00010899467,0.0014220779],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99474025,0.00005480734,0.0006667247,0.0023894582,0.0012430635,0.0009057179],"domain_scores_gemma":[0.9943403,0.00056734454,0.0007279435,0.0036779563,0.0004155873,0.00027089543],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009195838,0.00082089537,0.0008248698,0.0012229647,0.0008781018,0.0010481654,0.005356483,0.00085884135,0.000041191906],"category_scores_gemma":[0.00037853798,0.0008234743,0.00024912873,0.0004528467,0.0009431143,0.0015505063,0.0016744622,0.0015557973,0.00015341085],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001588418,0.000020419839,0.0000045667707,0.000036516318,0.00001189121,0.00014287492,0.00032109433,0.0018344704,0.002864063,0.0036164718,0.000016188646,0.99111557],"study_design_scores_gemma":[0.00041497106,0.0006290219,0.0000931789,0.0011988523,0.000019167615,0.00043523134,1.4579314e-7,0.12367775,0.0775404,0.78617334,0.007920519,0.0018973991],"about_ca_topic_score_codex":0.00004310938,"about_ca_topic_score_gemma":0.00008489297,"teacher_disagreement_score":0.9892182,"about_ca_system_score_codex":0.0006272722,"about_ca_system_score_gemma":0.00041872487,"threshold_uncertainty_score":0.99998885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038357917,0.000448442,0.98369473,0.0011626217,0.002346005,0.00032688671,0.000020973253,0.00015967835,0.011802318],"genre_scores_gemma":[0.12550607,0.00089354755,0.8618632,0.003346655,0.0020044209,0.000025986497,0.00006618954,0.00011357296,0.0061803316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964668,0.000023684097,0.00035646907,0.0016255904,0.00088769034,0.0006397218],"domain_scores_gemma":[0.9970839,0.00011820961,0.00033292908,0.0020844555,0.00015858568,0.00022190405],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00065202074,0.00056138565,0.0005104419,0.0005886107,0.00062493613,0.002590962,0.0048688618,0.00022767531,0.000030582898],"category_scores_gemma":[0.000099930134,0.0005034971,0.00009063628,0.00017392625,0.0014488471,0.0020435154,0.004758967,0.0005600612,0.000055979446],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037453137,0.000013806533,0.000099362594,0.000038484868,0.000012249577,0.00023414606,0.0004732532,0.0004528907,0.000007909199,0.043483257,0.00010158935,0.9550793],"study_design_scores_gemma":[0.0011469891,0.00055093085,0.0029527855,0.0006946319,0.00005313951,0.00010367328,0.0000011676265,0.5485183,0.0008163135,0.3786104,0.06373954,0.002812147],"about_ca_topic_score_codex":0.00035175774,"about_ca_topic_score_gemma":0.0004954068,"teacher_disagreement_score":0.95226717,"about_ca_system_score_codex":0.000117271506,"about_ca_system_score_gemma":0.00041650335,"threshold_uncertainty_score":0.9997417},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004132296,0.0013355756,0.9626065,0.0050363666,0.004016287,0.00033327742,0.000021378777,0.0002240062,0.026013361],"genre_scores_gemma":[0.3860821,0.00024639603,0.6036359,0.0046295393,0.0031553477,0.000016262144,0.000040287312,0.00007794559,0.0021162026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595916,0.000055601744,0.00041790248,0.0021228658,0.0008102501,0.0006342407],"domain_scores_gemma":[0.9894762,0.0024423643,0.00038336308,0.0074264617,0.0001531661,0.000118411794],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013415769,0.0005451883,0.0005554941,0.00035120972,0.0007063337,0.0013678039,0.01925637,0.00036327948,0.000029154602],"category_scores_gemma":[0.00072946266,0.00036258722,0.0001012208,0.00018197933,0.0012111651,0.0006934477,0.007214166,0.0009415244,0.00020334005],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006914305,0.000038984137,0.0001123238,0.00002052523,0.00003232968,0.00013543398,0.0013974031,0.00035211103,0.00010507447,0.039721712,0.0011609177,0.9569163],"study_design_scores_gemma":[0.0003366897,0.0001347424,0.0005594215,0.0014078608,0.000017562501,0.00002827157,7.926821e-7,0.833218,0.0007074411,0.13275066,0.029933024,0.0009055658],"about_ca_topic_score_codex":0.000045181463,"about_ca_topic_score_gemma":0.00042008742,"teacher_disagreement_score":0.9560107,"about_ca_system_score_codex":0.00011075878,"about_ca_system_score_gemma":0.0008407168,"threshold_uncertainty_score":0.99988264},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035505363,0.00011685855,0.9856865,0.00055863865,0.0015760541,0.00034176244,0.0000052675978,0.00047249996,0.0112069305],"genre_scores_gemma":[0.08706317,0.00027021387,0.90615255,0.0017006808,0.00096001517,0.000016959064,0.00005172603,0.00007499731,0.0037096944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996632,0.000020319301,0.0005094989,0.001414854,0.0008239698,0.00059936167],"domain_scores_gemma":[0.99667305,0.00016061748,0.00061399664,0.0021076424,0.0002775739,0.00016711993],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007997423,0.0005226798,0.00051432924,0.00082793663,0.0005979708,0.0012855857,0.0047306377,0.00041135174,0.000022243483],"category_scores_gemma":[0.00010700412,0.0005031066,0.00012722082,0.00021723306,0.00045715214,0.0012327645,0.0014968503,0.0006848911,0.0000864595],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040242217,0.000021534412,0.00004472533,0.000026363405,0.000008251679,0.00005059528,0.0004296595,0.009785473,0.0002477018,0.022239903,0.00004069818,0.9671011],"study_design_scores_gemma":[0.00021953868,0.0001382105,0.00036405574,0.000480487,0.00000597238,0.000057038083,2.1303126e-8,0.88781685,0.0027110877,0.099627696,0.0077095386,0.00086948683],"about_ca_topic_score_codex":0.000011115334,"about_ca_topic_score_gemma":0.000013216383,"teacher_disagreement_score":0.9662316,"about_ca_system_score_codex":0.00025272873,"about_ca_system_score_gemma":0.0004682616,"threshold_uncertainty_score":0.99975115},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002546521,0.0011195746,0.98576134,0.0027135878,0.0017070035,0.00045382397,0.00001923571,0.00016596352,0.007804826],"genre_scores_gemma":[0.064556606,0.00056801236,0.929848,0.003200582,0.0011823573,0.000035317913,0.000029292381,0.00009254815,0.0004872516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948051,0.0000698016,0.00061516126,0.0022721686,0.0012720278,0.000965715],"domain_scores_gemma":[0.99535495,0.0004656409,0.000447864,0.003326258,0.00019102384,0.00021427924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00121913,0.00071539794,0.0007696555,0.0015305078,0.0007800234,0.0009922374,0.0050705797,0.0005621601,0.00010989011],"category_scores_gemma":[0.00014850384,0.0006449425,0.00025841026,0.0006003034,0.001832388,0.0017571992,0.004250925,0.0012082212,0.00007426841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007928667,0.0004397648,0.0030777992,0.00015211564,0.00005755595,0.001310239,0.0048159882,0.0009901073,0.00030420983,0.5878212,0.0015726463,0.3993791],"study_design_scores_gemma":[0.00097392855,0.00043374964,0.0020914713,0.000934512,0.000019265557,0.00023783192,3.9508927e-7,0.047050454,0.0020165485,0.81532997,0.12881394,0.002097957],"about_ca_topic_score_codex":0.00010427326,"about_ca_topic_score_gemma":0.0011051949,"teacher_disagreement_score":0.39728117,"about_ca_system_score_codex":0.00020042692,"about_ca_system_score_gemma":0.00043837682,"threshold_uncertainty_score":0.9996002},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000073193596,0.00047873403,0.9956102,0.00034494154,0.001687697,0.0005309398,0.00004754919,0.00013797588,0.0011546639],"genre_scores_gemma":[0.018953329,0.000099749464,0.97895867,0.0005441375,0.0007137623,0.0000165515,0.00003392105,0.000055961507,0.0006239475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99508095,0.00006741515,0.00066210935,0.002450972,0.0009231468,0.0008154302],"domain_scores_gemma":[0.99149144,0.00051981193,0.0005125915,0.007159632,0.00013294956,0.00018358376],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001674353,0.00061869796,0.0007299604,0.0008320115,0.00037782054,0.00061935774,0.00968158,0.00030363502,0.00000880792],"category_scores_gemma":[0.00025161225,0.0005534185,0.0000642332,0.00026160554,0.0008493068,0.0031217006,0.0069823326,0.0009235633,0.000058188423],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013301433,0.000036730005,0.00013768188,0.000071632734,0.000008619635,0.0009665287,0.0007478983,0.015104347,0.00004286445,0.018004151,0.00014441925,0.9647218],"study_design_scores_gemma":[0.0010294062,0.00028887924,0.00064045493,0.002798937,0.000011996526,0.0004196681,6.103953e-7,0.8309268,0.0007356432,0.09215916,0.068470396,0.0025180606],"about_ca_topic_score_codex":0.00010156584,"about_ca_topic_score_gemma":0.00051074906,"teacher_disagreement_score":0.96220374,"about_ca_system_score_codex":0.00024399107,"about_ca_system_score_gemma":0.0008185922,"threshold_uncertainty_score":0.9996917},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052971125,0.0013007002,0.99394757,0.0002958174,0.0015178465,0.00028665474,0.000011006152,0.000093322065,0.0020173728],"genre_scores_gemma":[0.51338315,0.0003575733,0.48453334,0.00080307154,0.00038049615,0.000008457372,0.000028692408,0.000034878216,0.00047035562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962268,0.000036804428,0.00069004955,0.0012093462,0.0013174058,0.00051960995],"domain_scores_gemma":[0.9973419,0.00052898016,0.00044190086,0.0010363152,0.0004772374,0.00017370278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006334595,0.00043769617,0.00057544274,0.0029999972,0.00023470253,0.00016593546,0.0023491245,0.0002201432,0.000022712065],"category_scores_gemma":[0.00011135654,0.00042927486,0.00025461413,0.002848821,0.0006669321,0.00054684107,0.0008124727,0.0004898227,0.000041700638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009243922,0.00006587418,0.00011579022,0.00006137693,0.000036359746,0.00008024557,0.00053424935,0.3500858,0.00043113256,0.036451768,0.00029165586,0.6118365],"study_design_scores_gemma":[0.00073428015,0.00056839356,0.002065094,0.0003743941,0.00002318346,0.00036613562,1.6314061e-7,0.82351804,0.004959579,0.15599188,0.009983901,0.0014149521],"about_ca_topic_score_codex":0.000018761875,"about_ca_topic_score_gemma":0.000018027957,"teacher_disagreement_score":0.61042154,"about_ca_system_score_codex":0.00015070592,"about_ca_system_score_gemma":0.0005544401,"threshold_uncertainty_score":0.9998159},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006161029,0.00023018912,0.9864961,0.0004422697,0.008586456,0.0006425192,0.0000074750037,0.00047323326,0.002505686],"genre_scores_gemma":[0.5165736,0.00007717469,0.4720104,0.0028525768,0.007212313,0.000032147622,0.000058290017,0.0002189966,0.0009645284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918838,0.00018266264,0.0010173713,0.0031635168,0.0019761755,0.0017764656],"domain_scores_gemma":[0.99195814,0.00071797764,0.001000413,0.0052658604,0.00043614508,0.0006214676],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001726168,0.0011743214,0.001142844,0.0008825294,0.0010069091,0.002131694,0.009822203,0.0011485886,0.00003854273],"category_scores_gemma":[0.00010303608,0.0011295284,0.00032232207,0.00058086973,0.0014833158,0.00080598076,0.0015893934,0.0021106582,0.000079981546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016986829,0.000056889734,0.00005701346,0.000011312144,0.000014464508,0.00023249898,0.0001655263,0.65772563,0.000047797646,0.0072412924,0.000061279956,0.3343693],"study_design_scores_gemma":[0.0005381097,0.00033811823,0.000022862152,0.0007605522,0.000018830358,0.00004146406,3.0140816e-7,0.9852216,0.0018572536,0.006673248,0.0032044188,0.0013232055],"about_ca_topic_score_codex":0.000068417634,"about_ca_topic_score_gemma":0.0002507409,"teacher_disagreement_score":0.5159575,"about_ca_system_score_codex":0.0007960221,"about_ca_system_score_gemma":0.0012211498,"threshold_uncertainty_score":0.99911547},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013759627,0.00028711092,0.9926145,0.0010175925,0.0023938098,0.00030171312,0.00007438273,0.00007429243,0.003098981],"genre_scores_gemma":[0.9578439,0.00011261856,0.012815566,0.0080066975,0.019298337,0.0000075127036,0.0012815825,0.00012966825,0.0005040953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969358,0.000006821839,0.00041491693,0.0013944731,0.0006752624,0.00057272916],"domain_scores_gemma":[0.9972297,0.00016412565,0.00053410564,0.0017791673,0.00025906143,0.00003385907],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007596344,0.000522775,0.00054267107,0.00058747426,0.00073911005,0.0020821912,0.0036342535,0.00034847387,0.00013130049],"category_scores_gemma":[0.00015462065,0.00046567852,0.00007019056,0.00029032023,0.001438565,0.0011562018,0.0032138443,0.00061194133,0.000026177695],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031847467,0.000029036622,0.00065317244,0.0001635546,0.00001803398,0.000045979814,0.00001873228,0.010081978,0.000021267828,0.0018994636,0.0019888133,0.9850481],"study_design_scores_gemma":[0.00025413465,0.0000091934335,0.0023780358,0.00031534716,0.000062729516,0.0000045933957,1.7197357e-7,0.92114204,0.0000059532204,0.019958092,0.055215824,0.0006538678],"about_ca_topic_score_codex":0.00035894895,"about_ca_topic_score_gemma":0.0007213214,"teacher_disagreement_score":0.98439425,"about_ca_system_score_codex":0.000076001226,"about_ca_system_score_gemma":0.00020818596,"threshold_uncertainty_score":0.9997795},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005349314,0.000017309874,0.98603576,0.00031070906,0.002157857,0.0013654385,0.000027062388,0.000078804536,0.0046577295],"genre_scores_gemma":[0.65608406,7.5440914e-7,0.3199709,0.0007725264,0.0011233507,0.00009298777,0.0000062942286,0.00008402791,0.021865083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933539,0.0002038726,0.0010984461,0.0024512457,0.0021859424,0.0007065634],"domain_scores_gemma":[0.9906154,0.0050563775,0.0011608155,0.0020941154,0.0008503019,0.0002229651],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009387162,0.00063617533,0.0010398682,0.002970695,0.0009195411,0.0015307985,0.002161124,0.00038013342,0.00023613664],"category_scores_gemma":[0.0068417517,0.000532054,0.00048741684,0.0008574174,0.00038388788,0.0005268558,0.00081094983,0.0005206027,0.00007859731],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032315365,0.000014066182,0.00043089784,0.000011701417,0.00009195175,0.00000944957,0.00039727232,0.01931424,0.0013926082,0.000025648387,0.00009179376,0.9778972],"study_design_scores_gemma":[0.000625155,0.001584031,0.011144494,0.00023183798,0.00028146958,0.000035376153,0.0000021473272,0.9112805,0.012884173,0.057625525,0.002994781,0.0013105058],"about_ca_topic_score_codex":0.000037157737,"about_ca_topic_score_gemma":0.00047057876,"teacher_disagreement_score":0.9765867,"about_ca_system_score_codex":0.0005498852,"about_ca_system_score_gemma":0.00017611313,"threshold_uncertainty_score":0.9997131},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.973948,0.00022887708,0.008714407,0.00014323897,0.0030075037,0.0012339951,0.00023833952,0.000030209887,0.012455424],"genre_scores_gemma":[0.99883544,0.0000015778629,0.00067504396,0.00014770181,0.00013769433,0.000013787479,0.000019056954,0.000014840378,0.00015484962],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9976706,0.00022606723,0.00039013437,0.0005578662,0.000680269,0.0004750671],"domain_scores_gemma":[0.99717236,0.0007524577,0.0002609872,0.0010696608,0.00058490084,0.00015964672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001955402,0.00024725124,0.00042077817,0.0013326751,0.00031958122,0.000120685734,0.0023994576,0.00034819968,0.00015300776],"category_scores_gemma":[0.0004895197,0.00025754853,0.000052430027,0.0002309741,0.0008724573,0.00010389139,0.00040792543,0.0019448317,0.0000113019905],"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.00045619954,0.0043999953,0.4064438,0.00022361956,0.0002594058,0.0014431304,0.26821566,0.038707446,0.00010373371,0.00346368,0.00012567794,0.27615765],"study_design_scores_gemma":[0.006339102,0.0020210568,0.8290428,0.0010308665,0.000027582451,0.000019181218,0.000097600285,0.023216499,0.00028291057,0.13597338,0.0004240728,0.001524972],"about_ca_topic_score_codex":0.20434082,"about_ca_topic_score_gemma":0.91820973,"teacher_disagreement_score":0.7138689,"about_ca_system_score_codex":0.00040625702,"about_ca_system_score_gemma":0.0018556376,"threshold_uncertainty_score":0.99998766},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014391309,0.00018823311,0.98098534,0.0000029369257,0.0025239505,0.0006885599,0.000015685653,0.00014164038,0.0010623205],"genre_scores_gemma":[0.48009095,0.0000079750425,0.51840955,0.000009984861,0.0013085604,0.00002318434,0.0000058283185,0.00011278558,0.000031169588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969944,0.0000073497545,0.00052794657,0.0010005017,0.0006053324,0.0008644717],"domain_scores_gemma":[0.99807096,0.00041923704,0.00020272227,0.0009316447,0.00019050483,0.0001849567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005539372,0.0006458868,0.0006112144,0.0007916718,0.0003287688,0.0005826003,0.0013853535,0.00046711313,0.000003139427],"category_scores_gemma":[0.00014146861,0.00069443235,0.00012731565,0.00020072026,0.00028358932,0.0008738793,0.0005164169,0.00088361,0.0000026774026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064665596,0.000036637946,0.000933246,0.00020336844,0.00002273551,0.000024095638,0.0006872859,0.8640402,0.042194873,0.000081286664,2.3407748e-7,0.09176958],"study_design_scores_gemma":[0.00041020062,0.00011455592,0.0012126523,0.0019302617,0.000028863931,0.00005485233,0.000002700425,0.9698838,0.023680378,0.0014954864,0.000022256567,0.0011639774],"about_ca_topic_score_codex":0.000036448397,"about_ca_topic_score_gemma":0.000035809495,"teacher_disagreement_score":0.46569964,"about_ca_system_score_codex":0.001167349,"about_ca_system_score_gemma":0.00013808452,"threshold_uncertainty_score":0.9995507},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095607914,0.000050202136,0.8976537,0.003743992,0.0024935356,0.00017202186,2.2846231e-7,0.00017804571,0.00010034766],"genre_scores_gemma":[0.6547386,0.0000021315138,0.34469825,0.00051749806,0.000029542598,0.000008753345,1.09071124e-7,0.000003847826,0.0000012579528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978528,0.00004825833,0.00030885695,0.0006786333,0.0004830931,0.0006283342],"domain_scores_gemma":[0.9981504,0.0005465156,0.000094420524,0.00089875056,0.00017380035,0.00013612448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018767606,0.0001746241,0.00014694792,0.00020687695,0.0006462986,0.0008542145,0.0026882922,0.00007146385,0.0000027733881],"category_scores_gemma":[0.00022314816,0.00011363103,0.000055371594,0.0016771553,0.0009835496,0.00048781023,0.0008163667,0.0006035909,0.000018547908],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037627622,0.0000462822,0.0013085617,0.000006400559,0.00000411146,0.000017397826,0.0010728947,0.008965393,0.031730596,0.084114894,0.00001667949,0.872713],"study_design_scores_gemma":[0.00027896173,0.000099208664,0.00082140014,0.000036248406,0.000001287973,0.00008900949,7.5266485e-7,0.7070195,0.02271466,0.26839602,0.00030978082,0.0002331455],"about_ca_topic_score_codex":0.000035401787,"about_ca_topic_score_gemma":0.00016528425,"teacher_disagreement_score":0.87247986,"about_ca_system_score_codex":0.000026930607,"about_ca_system_score_gemma":0.00024732138,"threshold_uncertainty_score":0.823721},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06784782,0.000053918713,0.9243248,0.0032960558,0.0035663275,0.0006109151,0.000012676958,0.00022884904,0.0000586223],"genre_scores_gemma":[0.5303828,0.0000019101024,0.4681138,0.0008108083,0.0006167465,0.00004941448,0.000011947362,0.000009390295,0.0000031680927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617624,0.00011897938,0.0004292929,0.0017716571,0.0009167008,0.0005871423],"domain_scores_gemma":[0.99688447,0.00047666446,0.0001887787,0.0014552794,0.0007309554,0.00026388207],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00090023375,0.00035148746,0.00032082677,0.001223684,0.00060701306,0.0012296364,0.0017254452,0.00013462578,0.0000128724405],"category_scores_gemma":[0.00032759595,0.00032459738,0.00007960428,0.004259661,0.00027928842,0.0007033512,0.0024764945,0.0005251819,0.00004001596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074949057,0.000058703834,0.0004204687,0.00001803886,0.000010748733,0.000039529525,0.0015450766,0.9262308,0.00027044798,0.0009029642,0.00013224404,0.070363484],"study_design_scores_gemma":[0.00027733025,0.0002687701,0.0038791532,0.00018139681,0.000009219238,0.0001571095,0.0000027059357,0.95980066,0.010296151,0.024253689,0.00030417554,0.0005696457],"about_ca_topic_score_codex":0.00013504615,"about_ca_topic_score_gemma":0.00027343226,"teacher_disagreement_score":0.46253496,"about_ca_system_score_codex":0.00032180393,"about_ca_system_score_gemma":0.0010445786,"threshold_uncertainty_score":0.9999206},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017823526,0.00016721665,0.9789035,0.001127709,0.0017186773,0.00038304445,0.0000016640907,0.0003028453,0.017217109],"genre_scores_gemma":[0.357558,0.000018487559,0.6302678,0.0033384296,0.0013793804,0.000020976979,0.000004918472,0.00008627235,0.007325715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99521667,0.000041430394,0.0006434293,0.0019393376,0.0012271369,0.000931983],"domain_scores_gemma":[0.997179,0.0005450203,0.00024900056,0.0014489066,0.00032296253,0.00025513518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091399316,0.00057997956,0.0005281136,0.0011081145,0.00035908152,0.0008900374,0.0045466316,0.00033212724,0.000033993652],"category_scores_gemma":[0.0002193009,0.0005644918,0.00015087609,0.00067722384,0.0005792205,0.00056499336,0.0021250818,0.0011497211,0.00049618515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023668426,0.000013242433,0.00013674308,0.000008995899,0.0000036502224,0.00008782434,0.0010613456,0.2775176,0.00012609009,0.007426199,0.00012055737,0.7134954],"study_design_scores_gemma":[0.000071730195,0.000428499,0.00011523437,0.00041646397,0.000006567111,0.000061652725,0.0000011622466,0.7784922,0.008620188,0.1885891,0.021892415,0.0013047553],"about_ca_topic_score_codex":0.00011481512,"about_ca_topic_score_gemma":0.00021645345,"teacher_disagreement_score":0.7121906,"about_ca_system_score_codex":0.0003918287,"about_ca_system_score_gemma":0.0004000173,"threshold_uncertainty_score":0.99968064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029853087,0.000053538755,0.988307,0.0015228178,0.0011450967,0.0026483112,0.00008397963,0.00027758794,0.005931787],"genre_scores_gemma":[0.9370964,0.0000062271133,0.057843372,0.0026763224,0.00045554494,0.0004417457,0.00001963204,0.00007920235,0.0013815454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947722,0.000081036545,0.0006464353,0.002666641,0.0009752362,0.0008584555],"domain_scores_gemma":[0.9921504,0.0027307293,0.0010501881,0.0028913654,0.0008932208,0.00028405088],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001116437,0.0009044791,0.0010591195,0.0010810723,0.0010006552,0.0013574054,0.0046268012,0.00052658294,0.000013333809],"category_scores_gemma":[0.00016210003,0.0009096,0.0004325237,0.00022805603,0.0007602674,0.0014585853,0.0009663309,0.0012043088,0.000101594764],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067389185,0.00011880116,0.000017012339,0.00008722702,0.000033368415,0.000016511216,0.0006296415,0.015561354,0.00031233748,0.003845099,0.0000672389,0.979244],"study_design_scores_gemma":[0.00083559105,0.00017639423,0.000026055914,0.000836492,0.000018867422,0.000024867644,5.2662574e-7,0.9488023,0.003953601,0.04049513,0.003914277,0.0009158991],"about_ca_topic_score_codex":0.00005823042,"about_ca_topic_score_gemma":0.00035964145,"teacher_disagreement_score":0.9783281,"about_ca_system_score_codex":0.00084172765,"about_ca_system_score_gemma":0.0012238674,"threshold_uncertainty_score":0.99967927},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022514962,0.0013298417,0.97059023,0.00004528548,0.0010959785,0.00012073233,0.000005542879,0.00021441346,0.004083021],"genre_scores_gemma":[0.9814831,0.00015969123,0.01798722,0.000051816558,0.00015395539,0.0000039073525,8.9607494e-7,0.000016445289,0.00014297165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989504,0.000008735869,0.0002477499,0.00031739063,0.00022873972,0.00024698616],"domain_scores_gemma":[0.9987747,0.00044375032,0.000103423554,0.00058905635,0.000047279384,0.00004180384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036426063,0.00019089604,0.0003779632,0.00020774976,0.00008735,0.0000974607,0.0007284303,0.00021579445,0.0000056194767],"category_scores_gemma":[0.0004323138,0.00017667186,0.00003933135,0.00010068442,0.00069763104,0.00012227251,0.00041086363,0.00033985806,0.0000016152844],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046467158,0.000015395106,0.002307968,0.0010724067,0.000040451403,0.000006164261,0.0014557753,0.033416085,0.0023866836,0.0010739502,0.00031284615,0.9579076],"study_design_scores_gemma":[0.0013648472,0.00063792703,0.09794973,0.008803931,0.000049684273,0.000034948574,0.000012059018,0.62117946,0.06813782,0.18870877,0.007830339,0.0052904845],"about_ca_topic_score_codex":0.000024788988,"about_ca_topic_score_gemma":0.00011438781,"teacher_disagreement_score":0.95896816,"about_ca_system_score_codex":0.000072722076,"about_ca_system_score_gemma":0.0001416872,"threshold_uncertainty_score":0.72044694},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039077494,0.0005411139,0.9876083,0.0015819985,0.004559248,0.0008031736,0.0001430192,0.00011400336,0.00074138417],"genre_scores_gemma":[0.6776449,0.000013300263,0.31715825,0.0007664358,0.00085667125,0.00004826104,0.00002103557,0.00005261333,0.00343856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99405944,0.000083687235,0.00091253663,0.0021141632,0.0019526768,0.0008774865],"domain_scores_gemma":[0.99132955,0.0042565074,0.0009959099,0.0021076626,0.0009845672,0.0003258072],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0034402881,0.0005979392,0.00087756896,0.0010275178,0.0018837368,0.0012356434,0.0027320567,0.00050359976,0.00016041342],"category_scores_gemma":[0.0063827527,0.000502347,0.00035799632,0.00037910146,0.0016685501,0.00033614214,0.0005687003,0.000792516,0.00013229216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006444992,0.000037986665,0.0037144404,0.000041908483,0.000042194362,0.000029966339,0.0010211327,0.43444115,0.00032959538,0.0015243861,0.0002437708,0.558509],"study_design_scores_gemma":[0.0016415981,0.00023642738,0.0036292777,0.0009511056,0.00007788519,0.00003702005,0.0000023458422,0.8531281,0.0014790605,0.1267323,0.0107986685,0.001286208],"about_ca_topic_score_codex":0.00021323022,"about_ca_topic_score_gemma":0.0031843125,"teacher_disagreement_score":0.6737371,"about_ca_system_score_codex":0.0005978983,"about_ca_system_score_gemma":0.0018943397,"threshold_uncertainty_score":0.99980116},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003636311,0.0001536402,0.7719226,0.019062111,0.001719909,0.00119218,0.0000033571148,0.000029010123,0.20555355],"genre_scores_gemma":[0.8367565,0.000023333858,0.15063134,0.0028439485,0.0008607814,0.00007826226,0.000020488535,0.000030997086,0.008754321],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997089,0.00009725521,0.00041008907,0.00088895275,0.0011954489,0.00031924734],"domain_scores_gemma":[0.99648553,0.0005669329,0.00052338233,0.0015786932,0.0007201082,0.00012532398],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0033847722,0.00025014457,0.0002981957,0.00047076668,0.0008535144,0.0021770624,0.008554398,0.0001183638,0.00022312958],"category_scores_gemma":[0.0005943975,0.00019353276,0.00006260331,0.00029879218,0.00047751336,0.0011523209,0.0014852171,0.0003474012,0.00010135124],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000925906,0.00006386034,0.00059537357,0.000021196738,0.00001768535,0.0000011430342,0.010245822,0.025968153,0.00013136373,0.13916169,0.0015805139,0.82220393],"study_design_scores_gemma":[0.0009611448,0.0005111803,0.03997821,0.0017118448,0.000057852983,0.00007513938,0.000025700898,0.33347765,0.0033239173,0.491006,0.12702169,0.0018496955],"about_ca_topic_score_codex":0.00014584493,"about_ca_topic_score_gemma":0.00012552539,"teacher_disagreement_score":0.8363929,"about_ca_system_score_codex":0.00017930745,"about_ca_system_score_gemma":0.001746817,"threshold_uncertainty_score":0.99885875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006395558,0.00013291965,0.99007607,0.000850567,0.00080468575,0.0007213948,0.000054038926,0.0001034457,0.00086132216],"genre_scores_gemma":[0.7282772,0.000029273222,0.2699381,0.0004872838,0.0009381027,0.000072437375,0.000054421304,0.000066291585,0.00013690835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977359,0.00007602524,0.00033588635,0.0007606983,0.0006506487,0.000440799],"domain_scores_gemma":[0.99870515,0.00021063317,0.00004963311,0.00056955474,0.00029082302,0.00017422534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078305794,0.00031896314,0.00034047585,0.0011459914,0.00024272228,0.0003919839,0.0007426153,0.00030897147,0.000069269954],"category_scores_gemma":[0.000064315485,0.00031106468,0.000033608674,0.00046667512,0.0002254241,0.00028413214,0.00009045194,0.0009424105,0.00004010623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003840025,0.00000927556,0.000029968704,0.000020026002,0.000009488114,0.000035859513,0.008934518,0.5762783,0.0034056213,0.0003220226,0.00008595912,0.4108305],"study_design_scores_gemma":[0.0014173128,0.0027254617,0.002434629,0.0050902227,0.00003223189,0.00006620861,0.000098943776,0.7518827,0.07656865,0.13876964,0.017572172,0.0033418476],"about_ca_topic_score_codex":0.00028593527,"about_ca_topic_score_gemma":0.0034968539,"teacher_disagreement_score":0.7218816,"about_ca_system_score_codex":0.0003512535,"about_ca_system_score_gemma":0.00024347981,"threshold_uncertainty_score":0.99993414},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007606321,0.00005063205,0.9942282,0.00004635508,0.002026978,0.00027993586,0.000012611073,0.00024175103,0.0023529099],"genre_scores_gemma":[0.96513265,0.000011723199,0.0335611,0.00009508759,0.0004158632,0.000009537439,0.00002245485,0.000058006146,0.0006935738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988789,0.0000039757024,0.00022282147,0.00038382993,0.00025197864,0.00025848224],"domain_scores_gemma":[0.99932295,0.000071972325,0.00009376455,0.00038944624,0.00006120913,0.000060639122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029407657,0.00024323512,0.00025910747,0.00030491946,0.00020018606,0.0003058716,0.0005687497,0.00017944939,0.000007623362],"category_scores_gemma":[0.000021254924,0.00024003789,0.000078613004,0.00003050692,0.00012349022,0.00023002033,0.000071663264,0.00029801714,0.000037393336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004355242,0.0000049502864,0.0000032433793,0.0004129613,0.000016957816,0.000038347527,0.00089305564,0.07156557,0.001609216,0.0045366166,0.000014189734,0.9209005],"study_design_scores_gemma":[0.0001757982,0.000044313652,0.00008759255,0.00090923073,0.0000077212035,0.000049765767,3.0938355e-7,0.9950788,0.0004266089,0.0022446702,0.0006507124,0.0003244583],"about_ca_topic_score_codex":0.0000021452356,"about_ca_topic_score_gemma":0.000022283577,"teacher_disagreement_score":0.96437204,"about_ca_system_score_codex":0.00035132217,"about_ca_system_score_gemma":0.000048845748,"threshold_uncertainty_score":0.97884613},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027049289,0.0017378653,0.8063809,0.055861574,0.019350566,0.002251877,0.00012975132,0.0002873177,0.11129518],"genre_scores_gemma":[0.9014661,0.000023850405,0.07274862,0.019066263,0.0044780183,0.00002086888,0.000063202024,0.00014724952,0.0019858568],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620384,0.00006723463,0.00055691716,0.0012170345,0.0008371233,0.0011178419],"domain_scores_gemma":[0.9979162,0.0004165499,0.00045138592,0.000706763,0.000073902505,0.0004351934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014858476,0.00039627764,0.0005667578,0.00064543006,0.0012275731,0.000319029,0.0014551807,0.00031024206,0.00028753842],"category_scores_gemma":[0.00010362831,0.0004103517,0.0000805534,0.00014608285,0.00072116876,0.0001754211,0.0006446808,0.00071107235,0.00014840711],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022502416,0.00003099243,0.000120835204,0.000064134394,0.000013082419,0.000048095226,0.042119153,0.000012505967,0.0000059859253,0.016597359,0.0019356622,0.9390297],"study_design_scores_gemma":[0.017271977,0.0073198276,0.02047028,0.015546897,0.00010183448,0.0022718585,0.0013904081,0.017623654,0.00034357037,0.5970348,0.30404678,0.016578099],"about_ca_topic_score_codex":0.00006563404,"about_ca_topic_score_gemma":0.0014527107,"teacher_disagreement_score":0.9224516,"about_ca_system_score_codex":0.0011812078,"about_ca_system_score_gemma":0.0007269345,"threshold_uncertainty_score":0.99983484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023860775,0.00026068924,0.9877517,0.00012886526,0.0015749916,0.00025364873,0.0000035441735,0.00019634892,0.009591608],"genre_scores_gemma":[0.98710227,0.000012056117,0.011058854,0.0005760613,0.00084487826,0.000006929329,0.000007821759,0.000045735298,0.00034541768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986318,0.000013420453,0.00025808575,0.0004324063,0.00031905438,0.0003452871],"domain_scores_gemma":[0.99914414,0.00018231591,0.00012654325,0.00038601624,0.000085965396,0.00007502171],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027968627,0.0003096519,0.00033271805,0.00027503897,0.00020119404,0.00033682486,0.00059804315,0.00017419056,0.0001209307],"category_scores_gemma":[0.000041868952,0.00028855528,0.00009485111,0.0000524843,0.00020601098,0.00024216887,0.00008805675,0.00060490106,0.00005465339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005543678,0.0000034200034,0.000011243497,0.00001918042,0.000008520915,0.000015366544,0.00017879001,0.6484007,0.00011912363,0.000378056,0.000059214843,0.3508008],"study_design_scores_gemma":[0.0003334969,0.000038334314,0.0002444531,0.0004259495,0.000007118238,0.0000060592724,4.5936023e-8,0.9861307,0.00020814646,0.009538564,0.002747091,0.00032001507],"about_ca_topic_score_codex":0.0000029995376,"about_ca_topic_score_gemma":0.00005481849,"teacher_disagreement_score":0.9868636,"about_ca_system_score_codex":0.00018813417,"about_ca_system_score_gemma":0.000049710834,"threshold_uncertainty_score":0.99995667},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010485122,0.00008941102,0.99039906,0.0005278378,0.001186528,0.00026297534,0.00003060036,0.00008329005,0.007409795],"genre_scores_gemma":[0.41695237,0.000004483176,0.58122206,0.00045508004,0.0003239379,0.0000071788027,0.000021666348,0.000021992084,0.0009912442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949904,0.00007117624,0.0008256519,0.0017232009,0.0019493236,0.00044022794],"domain_scores_gemma":[0.9944286,0.0013623385,0.0005166424,0.0027143683,0.0007825951,0.00019549507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004195182,0.00043468387,0.00083573797,0.0010012386,0.00031117655,0.00089458737,0.0036650584,0.0003589242,0.0002208176],"category_scores_gemma":[0.005078027,0.00032206782,0.00031511375,0.0010898284,0.0010851363,0.00032952326,0.0005823314,0.00041246865,0.00003931886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010477657,0.000018519544,0.00039152926,0.0000057415295,0.000022689686,0.000013856274,0.0000373794,0.89854246,0.0000010486192,0.0007538632,0.000024886811,0.10017752],"study_design_scores_gemma":[0.0001585467,0.000057561745,0.0005039759,0.00006842346,0.00006835546,0.0000037016848,7.284798e-8,0.91378194,0.000010305084,0.0846672,0.00035349827,0.00032639113],"about_ca_topic_score_codex":0.00004910298,"about_ca_topic_score_gemma":0.00015343113,"teacher_disagreement_score":0.41694188,"about_ca_system_score_codex":0.00049643853,"about_ca_system_score_gemma":0.00065433455,"threshold_uncertainty_score":0.9999231},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032711853,0.0009583385,0.99152935,0.001967613,0.0007527196,0.0004064412,0.000004069151,0.00017568005,0.00093459745],"genre_scores_gemma":[0.37831962,0.000104461535,0.6198122,0.00057754497,0.0005441464,0.0000121908915,0.00000961175,0.000059471025,0.0005607908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962215,0.00003073061,0.00044441115,0.0019334417,0.00072190096,0.0006480268],"domain_scores_gemma":[0.9968301,0.0004747938,0.0005009176,0.0017470453,0.00019465157,0.00025249872],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00082949694,0.00058658415,0.0005735172,0.0005824399,0.0011195341,0.0016088537,0.0017623283,0.00023611585,0.0000030411159],"category_scores_gemma":[0.00012688112,0.0004701188,0.00006643518,0.0001813958,0.0014627778,0.00064794684,0.0021567128,0.0008536057,0.000004410422],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001998858,0.000031152562,0.0005647099,0.00012340432,0.000032258882,0.002018557,0.002215353,0.010735161,0.000040633906,0.010458448,0.000022764407,0.9737376],"study_design_scores_gemma":[0.0003129062,0.00053724105,0.002463609,0.00093121285,0.00001711102,0.0045621684,3.5735053e-7,0.90997773,0.00003249445,0.079188615,0.0012662231,0.00071032124],"about_ca_topic_score_codex":0.00005043121,"about_ca_topic_score_gemma":0.00007355138,"teacher_disagreement_score":0.9730272,"about_ca_system_score_codex":0.00008076957,"about_ca_system_score_gemma":0.0005035112,"threshold_uncertainty_score":0.99977505},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016721198,0.00014298173,0.9936522,0.0011685287,0.0010530493,0.00073709124,0.000020619838,0.00017079587,0.0013825734],"genre_scores_gemma":[0.55907387,0.000010563164,0.43969023,0.0007892896,0.00030898055,0.00006532158,0.000012606218,0.000027392365,0.000021752401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99612164,0.000027474423,0.0004907868,0.0019182308,0.000789927,0.0006519416],"domain_scores_gemma":[0.9962816,0.00021313725,0.0002966081,0.0028132698,0.0001642892,0.00023109652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009739448,0.00046527354,0.0004394184,0.0015829714,0.0004884581,0.00071342586,0.004506896,0.00026702014,0.00000763907],"category_scores_gemma":[0.00012745587,0.0004680981,0.00013818365,0.0007265563,0.00059461966,0.00035114854,0.0014324859,0.0007876266,0.000059397287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022543927,0.0002051424,0.00040136275,0.00008803559,0.000011542115,0.00005414343,0.0012139907,0.30241108,0.001332343,0.13497083,0.000052890708,0.5592361],"study_design_scores_gemma":[0.00035529092,0.000087887696,0.0015056212,0.00045920667,0.0000066292905,0.000024665092,2.0518274e-7,0.91882735,0.0020314571,0.06715413,0.008746667,0.00080087583],"about_ca_topic_score_codex":0.00012037697,"about_ca_topic_score_gemma":0.0002674417,"teacher_disagreement_score":0.6164163,"about_ca_system_score_codex":0.0003070299,"about_ca_system_score_gemma":0.000438396,"threshold_uncertainty_score":0.9997771},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005489798,0.00088734255,0.99273914,0.000028179007,0.00030833264,0.00022388175,0.000007777834,0.000009427593,0.00030612393],"genre_scores_gemma":[0.9604585,0.000092508024,0.038032897,0.00007893173,0.00105402,0.000009072399,0.00009751607,0.000031956955,0.0001445822],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982942,0.00001269805,0.00032784848,0.0007999654,0.00024607996,0.00031920717],"domain_scores_gemma":[0.9982843,0.00005083401,0.00042315706,0.000954609,0.00021413412,0.00007295792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043767624,0.00028004014,0.000425533,0.00015449533,0.00012418295,0.000057760666,0.00074529665,0.0004209803,0.0000024269918],"category_scores_gemma":[0.00008079314,0.000264398,0.00025357047,0.00006907538,0.0004802526,0.000007769032,0.00035769862,0.0002044274,4.3940094e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009129609,0.000038355844,0.00028153567,0.00013950179,0.00021265326,0.000004300872,0.000029281424,0.17235795,0.5710273,0.0001791531,0.000067844674,0.25557086],"study_design_scores_gemma":[0.00046681127,0.00019542764,0.00012620809,0.0002229427,0.00021359304,0.000024942448,1.5288525e-7,0.49092394,0.49349782,0.011842828,0.001708341,0.000776974],"about_ca_topic_score_codex":0.000010893272,"about_ca_topic_score_gemma":0.00002233969,"teacher_disagreement_score":0.9549687,"about_ca_system_score_codex":0.00004506051,"about_ca_system_score_gemma":0.00013592024,"threshold_uncertainty_score":0.9999808},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027558577,0.00033358936,0.994291,0.000011042275,0.0016065051,0.0011436533,0.00008073495,0.0006104424,0.0016474173],"genre_scores_gemma":[0.7603832,0.000004747192,0.23902418,0.00002650231,0.00026975386,0.000059226848,0.000038079528,0.00014311685,0.000051214694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965924,0.000039656632,0.0007864297,0.0011908901,0.0005476397,0.00084299064],"domain_scores_gemma":[0.99712855,0.00025942834,0.00023427115,0.0019237942,0.00018811855,0.0002658595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011548192,0.0008907698,0.0009931403,0.0009807579,0.0001923556,0.00043623048,0.0014829449,0.00060102245,0.0000053025665],"category_scores_gemma":[0.00007369963,0.00085384236,0.00017012212,0.00018957796,0.0002918149,0.00051217026,0.00022767283,0.0014673644,0.0000046719842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048362094,0.000020951607,0.00005286695,0.00030552206,0.000025890746,0.0003388394,0.0003931026,0.9768732,0.000028947929,0.00010266267,0.000002156736,0.021851001],"study_design_scores_gemma":[0.00048459513,0.00009118494,0.00015953863,0.00068356824,0.000014343456,0.00040397997,7.5311345e-7,0.99684745,0.000030798692,0.0003640006,0.000050485785,0.00086929445],"about_ca_topic_score_codex":0.00023129857,"about_ca_topic_score_gemma":0.00011181786,"teacher_disagreement_score":0.7601076,"about_ca_system_score_codex":0.0030021926,"about_ca_system_score_gemma":0.0009828721,"threshold_uncertainty_score":0.99939126},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005281438,0.00026399974,0.9917239,0.00004872808,0.0023804614,0.00074902974,0.000020381634,0.00009979582,0.0041855364],"genre_scores_gemma":[0.8067832,0.000028650675,0.19218193,0.000041893687,0.0006889699,0.000064420434,0.000039799168,0.000040225237,0.00013087959],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871707,0.0000078545345,0.0002537135,0.0004852363,0.00034538336,0.00019072401],"domain_scores_gemma":[0.9987758,0.00024334893,0.00013529095,0.0003887181,0.0004116948,0.0000451592],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00029508013,0.00024285357,0.00020012188,0.00042804613,0.0003426809,0.0012519038,0.0002707577,0.00019068485,0.000011168009],"category_scores_gemma":[0.00018589105,0.00023537013,0.000035342702,0.00010974228,0.00021541957,0.0012916832,0.000057842837,0.0002947532,0.0000031648794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009480925,0.0000042516212,0.000015289337,0.00001536425,0.0000066968933,6.293204e-7,0.0004052818,0.085461766,0.000026163965,0.0005811517,0.000024752482,0.91344917],"study_design_scores_gemma":[0.00016530599,0.00008263004,0.000057547313,0.0005572981,0.000019307803,0.00004046675,0.0000031075106,0.9772246,0.000035604022,0.019274548,0.0022646924,0.00027492072],"about_ca_topic_score_codex":0.0000045752704,"about_ca_topic_score_gemma":0.0010023154,"teacher_disagreement_score":0.9131743,"about_ca_system_score_codex":0.00040041163,"about_ca_system_score_gemma":0.00034885222,"threshold_uncertainty_score":0.9997849},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005314949,0.00025249994,0.985271,0.0017504424,0.0020279866,0.00023815008,0.000006642745,0.00008710393,0.010313027],"genre_scores_gemma":[0.7016672,0.00014045283,0.29650116,0.0005461664,0.0004322986,0.000010874973,0.000006088121,0.0000266308,0.0006691256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975969,0.00006447669,0.00047410766,0.0007634498,0.00076860155,0.00033242098],"domain_scores_gemma":[0.99686086,0.00044339502,0.0006075697,0.001674022,0.00033321336,0.00008094148],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013199624,0.00028189435,0.00037292874,0.00036596565,0.0014547274,0.0017079875,0.002389784,0.00019242892,0.000015348487],"category_scores_gemma":[0.00043651977,0.00022202793,0.0001416998,0.00025512115,0.0019390091,0.00071555254,0.00074509566,0.0006414768,0.000005705048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005697496,0.000011377539,0.00061859767,0.00003114885,0.000026055508,0.000015464964,0.002702684,0.040107362,0.000041540898,0.25428388,0.00006208251,0.7020941],"study_design_scores_gemma":[0.0005523742,0.0001555848,0.015152067,0.0013119887,0.000053130603,0.00019795516,0.000003495491,0.6975761,0.00096677395,0.25965917,0.023100274,0.0012710514],"about_ca_topic_score_codex":0.00028604266,"about_ca_topic_score_gemma":0.00061816035,"teacher_disagreement_score":0.701614,"about_ca_system_score_codex":0.0001708489,"about_ca_system_score_gemma":0.0010383553,"threshold_uncertainty_score":0.99984527},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027590222,0.00029522186,0.97345835,0.00045631593,0.0027815225,0.00054172473,0.000010288496,0.00013540161,0.022293594],"genre_scores_gemma":[0.112970226,0.000009880141,0.8812748,0.001099972,0.0017872609,0.000042260894,0.000014830221,0.000046819507,0.002753903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964764,0.0000210624,0.00045288546,0.0015667279,0.00076420046,0.00071868557],"domain_scores_gemma":[0.9965026,0.0008599506,0.0004739602,0.0014175888,0.00055638404,0.00018955542],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010058905,0.0005016562,0.00050669856,0.00043039833,0.0008479555,0.0011373966,0.0045763147,0.00028995195,0.000014763614],"category_scores_gemma":[0.0007729945,0.00043583458,0.00017266857,0.00017969818,0.0006079029,0.0006788208,0.0012551467,0.00044271865,0.00005601125],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007828002,0.00004765517,0.00025039064,0.00007422631,0.000018402117,0.00008047661,0.0009036692,0.0031757737,0.0001792674,0.07367839,0.0003817754,0.9212021],"study_design_scores_gemma":[0.0004982617,0.00025647393,0.00073748577,0.00040334952,0.000011687874,0.000080105194,9.217746e-8,0.6587773,0.0004887484,0.3287809,0.009174459,0.00079114706],"about_ca_topic_score_codex":0.000014878991,"about_ca_topic_score_gemma":0.00007130442,"teacher_disagreement_score":0.920411,"about_ca_system_score_codex":0.00022448605,"about_ca_system_score_gemma":0.001012722,"threshold_uncertainty_score":0.9998995},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008960788,0.0015499176,0.98453665,0.0012133232,0.0014876411,0.00024211663,0.000005525774,0.00019427786,0.010680955],"genre_scores_gemma":[0.54773355,0.0007553271,0.44000217,0.006053638,0.0012319178,0.000012861735,0.000009448875,0.00011556934,0.004085547],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99652606,0.000029906965,0.0003864201,0.0016133854,0.00079789315,0.00064632884],"domain_scores_gemma":[0.99652976,0.000511233,0.00034909497,0.0022841988,0.000109241344,0.00021649986],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001011467,0.00053315837,0.0005679715,0.00052629487,0.00052988017,0.001509021,0.0040908474,0.0003422541,0.000022636603],"category_scores_gemma":[0.000108324384,0.00047323984,0.00010048512,0.00013599431,0.0011768632,0.0008934006,0.0024195139,0.0006339052,0.000046580088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022101733,0.000013406276,0.000044094922,0.00003339228,0.0000118803555,0.000110435445,0.0003297069,0.0004915059,0.00008686537,0.24486898,0.00005013386,0.7539574],"study_design_scores_gemma":[0.00025480182,0.000100741876,0.00038480904,0.00043451428,0.000007626017,0.00014497353,1.3948414e-7,0.13937868,0.00039421543,0.8544794,0.0037142145,0.0007058777],"about_ca_topic_score_codex":0.000031374348,"about_ca_topic_score_gemma":0.00006529072,"teacher_disagreement_score":0.7532515,"about_ca_system_score_codex":0.00016239184,"about_ca_system_score_gemma":0.0004142742,"threshold_uncertainty_score":0.99977195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029086627,0.0002726581,0.9706217,0.00023572925,0.00073666987,0.00035882194,0.000012563257,0.00006118666,0.027409812],"genre_scores_gemma":[0.5901852,0.00034025082,0.399297,0.0010957795,0.0013484756,0.000025056534,0.000016524094,0.00019442245,0.0074972515],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977121,0.000015306363,0.00042632886,0.0008045628,0.00064817833,0.00039352136],"domain_scores_gemma":[0.9973782,0.00091071846,0.00037826766,0.0010296757,0.00015155123,0.00015161939],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008998632,0.00039948578,0.00058516546,0.00052903406,0.0002758388,0.0004232677,0.00079019857,0.0003533797,0.000066209555],"category_scores_gemma":[0.000811326,0.00032521188,0.000101123536,0.000115973504,0.0005472282,0.00019168734,0.00057463336,0.0006003201,0.0000324425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073560786,0.00004092268,0.000029074972,0.00028026724,0.000021814956,0.00003950958,0.00017716145,0.00008453199,0.000023201575,0.46839595,0.00006196138,0.53083825],"study_design_scores_gemma":[0.00014404675,0.00010174544,0.00007337056,0.0003937386,0.000030952197,0.000031510433,1.0183004e-7,0.12810591,0.000017352608,0.86996406,0.00078550813,0.00035173527],"about_ca_topic_score_codex":0.000009887981,"about_ca_topic_score_gemma":0.000036739602,"teacher_disagreement_score":0.58989435,"about_ca_system_score_codex":0.00010061035,"about_ca_system_score_gemma":0.00011816796,"threshold_uncertainty_score":0.99992},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008955272,0.00018317618,0.9922908,0.00075390976,0.0010807666,0.00027971936,0.000014669151,0.000080860125,0.004420586],"genre_scores_gemma":[0.763683,0.000022517213,0.23483035,0.0010283567,0.0001836063,0.000007721424,0.0000035700818,0.000026063697,0.00021481492],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734116,0.00008432533,0.0005173694,0.00090110017,0.0006589831,0.00049708475],"domain_scores_gemma":[0.9967294,0.00046580005,0.0008658965,0.0016433651,0.00020537732,0.00009016576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012510186,0.00035390529,0.00041078852,0.00038377734,0.0006680272,0.0005286496,0.0045339772,0.00015584851,0.00001172675],"category_scores_gemma":[0.00014037355,0.0002798822,0.00018833035,0.00031974717,0.00228622,0.0004403852,0.001367284,0.00063687627,0.0000023753078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011469509,0.000025658157,0.0016563667,0.00008562566,0.000034434,0.000018440573,0.0012669982,0.0026014252,0.007764176,0.22952183,0.000059898877,0.7569537],"study_design_scores_gemma":[0.0004896358,0.000120488934,0.0003745626,0.0017598177,0.000026066335,0.00018177961,0.0000012664357,0.19283769,0.020524554,0.78016627,0.0027240035,0.00079385866],"about_ca_topic_score_codex":0.00005399438,"about_ca_topic_score_gemma":0.0000732577,"teacher_disagreement_score":0.76278746,"about_ca_system_score_codex":0.00016154713,"about_ca_system_score_gemma":0.00036136355,"threshold_uncertainty_score":0.9999653},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018260147,0.0005539814,0.98888373,0.0009875952,0.007999025,0.00075067696,0.000019106881,0.00020606576,0.0005815841],"genre_scores_gemma":[0.13489829,0.00009421431,0.85876983,0.0018404131,0.0024161187,0.00012567957,0.000025405447,0.00007798236,0.0017520649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570686,0.000057461435,0.0005611159,0.002070677,0.0006966155,0.00090726913],"domain_scores_gemma":[0.9958506,0.00072034006,0.0006596204,0.0020195388,0.0005578717,0.00019202675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012779577,0.00059526425,0.00065461925,0.0005549803,0.00086356455,0.00046534793,0.004861777,0.0006350995,0.000013305756],"category_scores_gemma":[0.00022428883,0.0005937719,0.00024102631,0.00016890335,0.0018113145,0.0006295825,0.0014076565,0.000945749,0.000021973177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003870725,0.00003215657,0.00011777898,0.00004088683,0.000014874036,0.000090928945,0.00030897913,0.51805836,0.00007258038,0.019637458,0.0001464246,0.46144086],"study_design_scores_gemma":[0.0005882034,0.00024781964,0.00043166452,0.00017444219,0.00001142648,0.00016385183,4.7758274e-8,0.93082446,0.0000675872,0.057382684,0.009466279,0.0006415622],"about_ca_topic_score_codex":0.000039994786,"about_ca_topic_score_gemma":0.00039537766,"teacher_disagreement_score":0.4607993,"about_ca_system_score_codex":0.0012544508,"about_ca_system_score_gemma":0.00102986,"threshold_uncertainty_score":0.9996514},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047547594,0.00046471923,0.99149096,0.00033094487,0.0018954653,0.0005940437,0.000022041913,0.00009482336,0.00035226598],"genre_scores_gemma":[0.40053236,0.00005096649,0.5974456,0.0008268284,0.0004405681,0.000029515426,0.000031252053,0.000038354392,0.0006045651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965665,0.000037908045,0.0006344286,0.0012980535,0.0009201044,0.0005430487],"domain_scores_gemma":[0.9975909,0.00063011056,0.00040531092,0.00079222344,0.00043367167,0.00014775651],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009066362,0.00046211024,0.0005329371,0.0012400692,0.00040025235,0.00045109077,0.0020298264,0.00024439502,0.000041762],"category_scores_gemma":[0.00010037426,0.0004089686,0.00024354667,0.0010178486,0.00084509584,0.0006144849,0.00069139135,0.00030980998,0.0000111540585],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017129442,0.00021590642,0.00035842048,0.00040998936,0.00010690664,0.000058659876,0.0055464515,0.04889045,0.0035441883,0.17370413,0.0005512707,0.76644236],"study_design_scores_gemma":[0.000918148,0.0010964546,0.00041838753,0.0005620916,0.00002753122,0.00010738514,0.0000018625034,0.49166307,0.008546029,0.49119058,0.004461526,0.0010069103],"about_ca_topic_score_codex":0.000013724611,"about_ca_topic_score_gemma":0.00009485134,"teacher_disagreement_score":0.7654354,"about_ca_system_score_codex":0.00016725062,"about_ca_system_score_gemma":0.0007639329,"threshold_uncertainty_score":0.9998362},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016419617,0.0015124788,0.99694383,0.000021928698,0.0010248879,0.00020088717,0.000037437305,0.000035512825,0.00005881785],"genre_scores_gemma":[0.008172799,0.00027245076,0.99090624,0.0000501901,0.00045683526,0.000016798795,0.000025806556,0.000020461235,0.00007840044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992463,0.000009609504,0.00019719306,0.00025404806,0.00016280988,0.00013003031],"domain_scores_gemma":[0.99890244,0.0006729512,0.0000666297,0.00020666062,0.00011959461,0.000031708154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039694193,0.00012923873,0.0002761769,0.00035623097,0.000082468454,0.00016232958,0.00018634959,0.000113829614,0.0000016043892],"category_scores_gemma":[0.00006530506,0.00009490693,0.000036149435,0.0005642424,0.00047902507,0.000076265176,0.000048434435,0.000113743285,1.6046647e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.3675675e-7,9.795929e-7,0.000053391097,0.000050519913,0.000078186684,1.9551021e-7,0.0001843209,0.7590129,0.0000054134193,0.0000651633,0.000010154863,0.24053788],"study_design_scores_gemma":[0.000080610516,0.000023323266,0.00014477692,0.00006467771,0.000121489604,0.0000076124575,0.0000010536469,0.99882376,0.00009014333,0.00035500346,0.00018122575,0.000106334315],"about_ca_topic_score_codex":0.0000039784977,"about_ca_topic_score_gemma":0.000005520658,"teacher_disagreement_score":0.24043155,"about_ca_system_score_codex":0.000043636075,"about_ca_system_score_gemma":0.000054419743,"threshold_uncertainty_score":0.38701922},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05862701,0.0015515176,0.9199464,0.00033583038,0.002248763,0.0020732356,0.00007230273,0.00008877632,0.015056191],"genre_scores_gemma":[0.9565686,0.000015970409,0.03893635,0.00032723576,0.0011956437,0.00003238025,0.00004851381,0.000057278492,0.002818058],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99724686,0.000015281801,0.00036983233,0.0012250764,0.00066309643,0.0004798809],"domain_scores_gemma":[0.99761033,0.00034740756,0.00032501906,0.0012775272,0.00022089752,0.00021883234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029650886,0.0004931793,0.0006615225,0.00040775273,0.00032970725,0.0001733061,0.00061776274,0.00023469065,0.000042435986],"category_scores_gemma":[0.00007504314,0.0004118621,0.00025282125,0.000073782656,0.00046819495,0.00011658094,0.0002452012,0.00047171075,0.000042104923],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005138152,0.0001367181,0.0011331398,0.00032333875,0.000073354626,0.0018792606,0.0006340104,0.0017004722,0.03583378,0.00007769048,0.00014176167,0.9575527],"study_design_scores_gemma":[0.005470155,0.0037145892,0.010548355,0.0011568298,0.0005121212,0.0004675506,6.4406817e-7,0.054759398,0.87815684,0.031262517,0.0124102775,0.001540721],"about_ca_topic_score_codex":0.00021666168,"about_ca_topic_score_gemma":0.00028011878,"teacher_disagreement_score":0.95601195,"about_ca_system_score_codex":0.0006993354,"about_ca_system_score_gemma":0.000540403,"threshold_uncertainty_score":0.99983335},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054346667,0.000007340309,0.99727285,0.00054680766,0.00018979087,0.0009022025,0.0001033579,0.000050526323,0.00087275804],"genre_scores_gemma":[0.05154751,0.0000020849698,0.94753754,0.00047802,0.0002635737,0.00003268017,0.000051654228,0.000033946857,0.000053005602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977524,0.00002727988,0.0003067241,0.0011973594,0.0004195492,0.00029663692],"domain_scores_gemma":[0.9952063,0.0013275315,0.00031172112,0.0027330187,0.0002707926,0.000150663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010978106,0.0002644423,0.00033437752,0.00018615996,0.00025726363,0.00034396144,0.0021920945,0.00010297749,0.000008342155],"category_scores_gemma":[0.0011818123,0.00021143623,0.000021795442,0.000082633065,0.00036225643,0.00025004958,0.00030164915,0.00028303283,0.000007220446],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027490263,0.000030542305,0.000045434434,0.000072844334,0.000003818622,0.0000035642324,0.00012290104,0.00043125817,0.0005740904,0.091586165,0.000041880598,0.90706],"study_design_scores_gemma":[0.00012576318,0.00015471903,0.00042015282,0.00017455388,0.000019202947,0.0000065658296,1.5727785e-7,0.54781324,0.0001887105,0.4499654,0.0008771039,0.00025441102],"about_ca_topic_score_codex":0.000017414128,"about_ca_topic_score_gemma":0.0001229549,"teacher_disagreement_score":0.9068056,"about_ca_system_score_codex":0.00007277873,"about_ca_system_score_gemma":0.00023924085,"threshold_uncertainty_score":0.8622119},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036401875,0.00027086926,0.99165535,0.0021387206,0.0013608128,0.0005313336,0.000009532518,0.000094435534,0.0035749092],"genre_scores_gemma":[0.5274784,0.00041605651,0.467332,0.00409577,0.0005287498,0.000023871748,0.00001014688,0.00003784344,0.000077151686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951975,0.000084141546,0.00062069984,0.0017521536,0.0015686143,0.00077692216],"domain_scores_gemma":[0.99651635,0.0008241331,0.00025736634,0.0021409807,0.00014495174,0.00011620456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014289102,0.00059540634,0.0005278308,0.0007952864,0.0004099205,0.00051247294,0.005046483,0.00039704784,0.000006119209],"category_scores_gemma":[0.00011664441,0.00040386152,0.00017815639,0.0010728402,0.0008125331,0.00052064215,0.0008668805,0.0013410257,0.000070756854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016067817,0.000045957357,0.0000044458147,0.000008995977,0.0000029269795,0.00018105666,0.0032842222,0.55191517,0.0000044032436,0.022021929,0.00031040527,0.42220443],"study_design_scores_gemma":[0.00022493138,0.00018397719,0.00004504427,0.00021322531,0.0000032892613,0.00022571643,2.4583775e-7,0.7089383,0.000039831524,0.28906062,0.0006596027,0.00040521857],"about_ca_topic_score_codex":0.00001847891,"about_ca_topic_score_gemma":0.000028606115,"teacher_disagreement_score":0.5271144,"about_ca_system_score_codex":0.00037540615,"about_ca_system_score_gemma":0.00047930473,"threshold_uncertainty_score":0.99984133},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008839577,0.00009929959,0.9975062,0.0002572387,0.00065599004,0.00092811865,0.000024180257,0.0001371214,0.00030342746],"genre_scores_gemma":[0.008775891,0.000010381281,0.99028414,0.00052187673,0.00019693469,0.000025641173,0.000009521731,0.000027973476,0.00014764495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645,0.000058093974,0.000783432,0.0010923696,0.000982878,0.00063322985],"domain_scores_gemma":[0.9960878,0.0006127909,0.0012464338,0.0013768884,0.00056039623,0.00011571855],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025214197,0.00044458517,0.00048469554,0.0004036299,0.00082007656,0.0010789526,0.0038203858,0.00019677638,0.000007760571],"category_scores_gemma":[0.00031623984,0.0003552354,0.00014900998,0.00026971695,0.0016516125,0.001504459,0.00067320187,0.0005834164,0.0000015179202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017598279,0.000029322697,0.000013963516,0.0003182912,0.000023114995,0.000052563544,0.001019636,0.1394299,0.10885096,0.00088927906,0.000015927493,0.74933946],"study_design_scores_gemma":[0.00022386982,0.0001318773,0.0000015826076,0.000475408,0.000009941159,0.00003780522,7.429105e-7,0.76842207,0.22623368,0.004126951,0.00004196668,0.00029410384],"about_ca_topic_score_codex":0.00027992704,"about_ca_topic_score_gemma":0.00009444723,"teacher_disagreement_score":0.7490453,"about_ca_system_score_codex":0.0003959649,"about_ca_system_score_gemma":0.001342669,"threshold_uncertainty_score":0.99995804},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015388647,0.00016131939,0.98847044,0.00078958384,0.0010783894,0.00056368025,0.000008740314,0.00023956272,0.008534406],"genre_scores_gemma":[0.013936617,0.00003266014,0.9810437,0.0011727908,0.0008708516,0.000032538304,0.0000054477255,0.00006765556,0.0028377424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949915,0.00007019903,0.00044788618,0.0021183474,0.001369082,0.0010030201],"domain_scores_gemma":[0.9947723,0.0014784805,0.00025924924,0.0025685858,0.00061125244,0.00031012367],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009720768,0.0005838723,0.0005052493,0.0009164114,0.00045785148,0.0006782748,0.0055805417,0.00024869427,0.00012628738],"category_scores_gemma":[0.00023915988,0.00047880266,0.00012246554,0.0013673336,0.0024926444,0.0008020709,0.0020564538,0.0010070426,0.00019114085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008630731,0.00013719093,0.00038010042,0.00010693627,0.00008789536,0.0007627104,0.0038262703,0.039835617,0.0005180626,0.2286854,0.00025330225,0.7253202],"study_design_scores_gemma":[0.0006145975,0.0006786588,0.0003045768,0.00044041369,0.0000120979885,0.00025916492,6.688886e-7,0.07287941,0.0029382934,0.9160311,0.004644709,0.0011962601],"about_ca_topic_score_codex":0.000019253946,"about_ca_topic_score_gemma":0.00023161153,"teacher_disagreement_score":0.72412395,"about_ca_system_score_codex":0.00024395458,"about_ca_system_score_gemma":0.00078315334,"threshold_uncertainty_score":0.9997997},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92768604,0.0012132879,0.048822846,0.0022041933,0.009192956,0.0033143763,0.0007462521,0.00019087619,0.006629183],"genre_scores_gemma":[0.99291426,0.00010591933,0.005178657,0.00043685487,0.0012210297,0.000021639871,0.000043712484,0.000015420994,0.00006249519],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9974689,0.00008260848,0.0003734376,0.00058036915,0.00097519817,0.0005195151],"domain_scores_gemma":[0.9982416,0.00038523477,0.00035917462,0.0006538495,0.0001682018,0.00019193874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008390319,0.00023547283,0.00063582807,0.0013469114,0.00030025752,0.00015060973,0.0017598184,0.00045687938,0.00008026144],"category_scores_gemma":[0.00024790736,0.00023678386,0.00014760962,0.0005669785,0.0019967493,0.0003318012,0.00019113152,0.0004701619,0.0000030071392],"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.0000034516006,0.00019355291,0.3436553,0.0000184431,0.00005177093,0.000057443835,0.08930718,0.00030343296,0.000021004966,0.01445646,0.0000014734567,0.5519305],"study_design_scores_gemma":[0.000854855,0.00058042945,0.8719087,0.0008773645,0.001427024,0.000003090753,0.00019729788,0.020421911,0.00024090004,0.095544726,0.005599748,0.0023439154],"about_ca_topic_score_codex":0.0082100555,"about_ca_topic_score_gemma":0.067956805,"teacher_disagreement_score":0.5495866,"about_ca_system_score_codex":0.000254241,"about_ca_system_score_gemma":0.0004994868,"threshold_uncertainty_score":0.99839437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017432762,0.00040961514,0.9763958,0.00005409815,0.0005389239,0.00013749844,0.000003551806,0.00017532008,0.004852449],"genre_scores_gemma":[0.97474676,0.000047192898,0.024981717,0.000018174747,0.00009790765,0.0000018106646,0.0000015315527,0.00002432244,0.00008059678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884707,0.000005617263,0.00032225702,0.00039672115,0.00015950407,0.00026883488],"domain_scores_gemma":[0.9990375,0.00022960124,0.0002453846,0.00039971905,0.000049872186,0.000037915906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003448739,0.0002411149,0.00034113973,0.00037390398,0.00016189837,0.000056619087,0.00042353597,0.00030093954,0.000013514252],"category_scores_gemma":[0.00007740853,0.00024261087,0.000041370156,0.000047009187,0.0005089569,0.0003056746,0.00021073669,0.0007261304,0.0000025381485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005118166,0.000004244025,0.00045644603,0.000057772788,0.00001721736,0.000032009484,0.00082889403,0.039775163,0.0031024313,0.0002632545,0.0000010880043,0.9554564],"study_design_scores_gemma":[0.00027670842,0.000110511195,0.005209247,0.0011243697,0.0000313142,0.00017739978,0.000002937116,0.9441541,0.028460555,0.019386532,0.00040121767,0.00066510955],"about_ca_topic_score_codex":0.00001866669,"about_ca_topic_score_gemma":0.00015113976,"teacher_disagreement_score":0.957314,"about_ca_system_score_codex":0.00011197586,"about_ca_system_score_gemma":0.00005127359,"threshold_uncertainty_score":0.9893384},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000061644954,0.00020557457,0.99748015,0.0002605978,0.00060369226,0.0005177922,0.0000030500098,0.00028719354,0.00058029837],"genre_scores_gemma":[0.04705149,0.000042563748,0.9520055,0.00065615436,0.0000999227,0.000016361222,0.00001146786,0.000030399147,0.00008614042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621266,0.00006773669,0.0007065847,0.0010699145,0.0015219295,0.00042117943],"domain_scores_gemma":[0.9960897,0.00039890647,0.0007674885,0.002201305,0.0003783468,0.00016427177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011237423,0.0004300166,0.00062239985,0.001085955,0.00023618701,0.0004143227,0.0040609306,0.00027276532,0.00005256146],"category_scores_gemma":[0.00037147157,0.00038937188,0.00019190783,0.00038903,0.0012068137,0.0007044467,0.0006177074,0.00043802895,0.000013471163],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001163933,0.000051828283,0.000100454854,0.0001914615,0.00001740667,0.00003667229,0.00029845664,0.02191806,0.0008610359,0.002049954,0.000026232718,0.97444725],"study_design_scores_gemma":[0.00030687923,0.00018405328,0.00065580336,0.0010434036,0.000019312623,0.000007634115,6.5605846e-8,0.9296105,0.016323352,0.051346127,0.000034454857,0.00046843864],"about_ca_topic_score_codex":0.000042383163,"about_ca_topic_score_gemma":0.000037241676,"teacher_disagreement_score":0.9739788,"about_ca_system_score_codex":0.00017810942,"about_ca_system_score_gemma":0.0006701349,"threshold_uncertainty_score":0.9998558},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025041182,0.0005843124,0.97253656,0.0002895296,0.0006622535,0.0004135851,0.00008581149,0.00006900066,0.00031778167],"genre_scores_gemma":[0.8295068,0.000059840164,0.17006473,0.000069116155,0.0002165549,0.000006891846,0.000021444954,0.00003598027,0.000018634144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820966,0.000020135463,0.00035192163,0.00069554104,0.0003159874,0.00040675403],"domain_scores_gemma":[0.99712175,0.0021450005,0.00011632701,0.00044043735,0.00007074998,0.00010573787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043729096,0.0003506674,0.0005208473,0.0002703053,0.00017861938,0.00019125876,0.0006479609,0.00029540906,0.000006574532],"category_scores_gemma":[0.0015982009,0.00032678433,0.000064486936,0.00006557603,0.000495647,0.00017243998,0.00032328855,0.0010652615,5.0345636e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033816425,0.00001557316,0.00042255357,0.0001644096,0.000009583966,0.000026336578,0.0014823828,0.03273628,0.029574368,0.00010437972,0.000011018979,0.9354193],"study_design_scores_gemma":[0.0006653085,0.00006547952,0.011252392,0.0014203736,0.000013928838,0.000011753059,0.0000011396329,0.9683503,0.0071052313,0.01058025,0.00013858038,0.00039527772],"about_ca_topic_score_codex":0.0005286627,"about_ca_topic_score_gemma":0.0005917072,"teacher_disagreement_score":0.935614,"about_ca_system_score_codex":0.00011538255,"about_ca_system_score_gemma":0.000062814164,"threshold_uncertainty_score":0.9999184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004852146,0.00024280259,0.9955764,0.00010049936,0.0008883328,0.0005426517,0.000016067244,0.0018362564,0.0007485061],"genre_scores_gemma":[0.1012588,0.000016405053,0.8979219,0.00034849936,0.00029573764,0.000034276316,0.00001272765,0.000045400502,0.00006623941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951437,0.00008253498,0.0004656576,0.0023159846,0.0010114126,0.0009807276],"domain_scores_gemma":[0.9941466,0.00050667685,0.0003382029,0.0042836405,0.00029693305,0.00042795908],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016149816,0.00078275107,0.0010820566,0.002429935,0.00036256982,0.0009817512,0.007964436,0.00041636435,0.0000030948827],"category_scores_gemma":[0.00028282034,0.0006791456,0.0003100229,0.0011898987,0.00040544846,0.0022291648,0.0017241123,0.00074346684,0.000014837517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027965634,0.00001945052,0.00001493962,0.000012863682,0.000049751958,0.000023831179,0.001176707,0.81514287,0.000025623569,0.0022186798,0.0000037521359,0.18130875],"study_design_scores_gemma":[0.00008771673,0.00015714843,0.0004596175,0.0000694211,0.000035464524,0.000022270136,9.864777e-8,0.91287225,0.00011285901,0.08540972,0.000035153356,0.0007382517],"about_ca_topic_score_codex":0.00008809722,"about_ca_topic_score_gemma":0.000027666096,"teacher_disagreement_score":0.1805705,"about_ca_system_score_codex":0.0004902572,"about_ca_system_score_gemma":0.00028452152,"threshold_uncertainty_score":0.99956596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035890944,0.0005333797,0.95132273,0.00034021048,0.00095714367,0.00067094725,0.000042737054,0.000031686715,0.0102102375],"genre_scores_gemma":[0.99459964,0.000044927263,0.004604243,0.00017020738,0.00016645559,0.000012535656,0.000008127601,0.00001125308,0.0003826319],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956471,0.00020128815,0.0010850524,0.0011528098,0.0014701629,0.0004436188],"domain_scores_gemma":[0.9933207,0.0033589413,0.0010939755,0.0017346607,0.0003901115,0.00010163458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004482452,0.0003336858,0.00075098226,0.0004889117,0.00030336148,0.00034176727,0.0029036028,0.00027717932,0.00017804853],"category_scores_gemma":[0.00070935796,0.00025044876,0.0001397763,0.00037169602,0.0016503059,0.00025129283,0.00059818896,0.00052919093,0.00004919298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060808026,0.00010144501,0.005840925,0.000027664457,0.000021539896,0.0000071958416,0.0014244071,0.25631216,0.0004731305,0.11098879,0.000026141766,0.6247158],"study_design_scores_gemma":[0.00021166948,0.00004809663,0.010841359,0.00017887984,0.000008886894,0.000005761011,0.0000018538389,0.011036276,0.00027362476,0.9767379,0.0003665615,0.00028913218],"about_ca_topic_score_codex":0.00016878579,"about_ca_topic_score_gemma":0.002376129,"teacher_disagreement_score":0.9587087,"about_ca_system_score_codex":0.000114602655,"about_ca_system_score_gemma":0.00043585402,"threshold_uncertainty_score":0.99999475},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012138452,0.0002743046,0.9850781,0.011678333,0.0011443843,0.00055879983,0.00016009016,0.00048349262,0.00050110026],"genre_scores_gemma":[0.034613397,0.00027181287,0.9631195,0.0009790476,0.00044205264,0.00002571919,0.00032892215,0.00006183233,0.00015768773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943277,0.000022625843,0.0005477517,0.0026715281,0.0014995898,0.0009308088],"domain_scores_gemma":[0.9823214,0.0013518169,0.0004559925,0.015482049,0.00014097225,0.00024778198],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0023601067,0.00058635697,0.00068093353,0.00048307423,0.00083572685,0.0012739851,0.072798416,0.00070606393,0.000011364156],"category_scores_gemma":[0.02584222,0.00050183304,0.000065311564,0.00021263117,0.0014597639,0.001461082,0.15051678,0.0017322961,0.000016234462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018701327,0.000030293306,0.00009615119,0.00008549266,0.000022908547,0.00012119311,0.00005033446,0.001247,0.000018631512,0.010454959,0.002454578,0.9853998],"study_design_scores_gemma":[0.0003551401,0.00017146788,0.000049851973,0.00063855806,0.0000057600582,0.000056245502,6.7929946e-8,0.69693375,0.0002731175,0.28652072,0.01455962,0.00043569328],"about_ca_topic_score_codex":0.000021609538,"about_ca_topic_score_gemma":0.000054096527,"teacher_disagreement_score":0.9849641,"about_ca_system_score_codex":0.00021115372,"about_ca_system_score_gemma":0.00046398662,"threshold_uncertainty_score":0.9997628},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016520035,0.00059552037,0.9861274,0.00012946974,0.005700789,0.0002036716,0.0000010598824,0.0000958663,0.0054942626],"genre_scores_gemma":[0.5004309,0.00005411388,0.49582496,0.00010040015,0.0029351325,0.000004320205,0.0000027352962,0.000051892333,0.00059558224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970656,0.000016633681,0.00038888748,0.0010892722,0.0008652024,0.0005744213],"domain_scores_gemma":[0.9975268,0.00024119028,0.00046215774,0.0015810659,0.00005095616,0.00013781557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003493409,0.0004620126,0.0005291124,0.0004425499,0.00040742644,0.000609066,0.003809375,0.00021223137,0.000002634481],"category_scores_gemma":[0.000022686612,0.00038611144,0.00010013236,0.00011478932,0.0010884511,0.0010184093,0.0018052174,0.000564993,0.0000127651365],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012441784,0.00003210614,0.0041793026,0.000041497446,0.000022835553,0.00014888532,0.0017396666,0.0031611107,0.00016721062,0.0012308207,0.0000193796,0.98924476],"study_design_scores_gemma":[0.003017924,0.0026694522,0.07427485,0.0068873074,0.000104782695,0.00073526084,0.0000025035501,0.47405285,0.05693041,0.36648005,0.008521501,0.0063230926],"about_ca_topic_score_codex":0.00004125128,"about_ca_topic_score_gemma":0.0000063454722,"teacher_disagreement_score":0.98292166,"about_ca_system_score_codex":0.000130261,"about_ca_system_score_gemma":0.00035233426,"threshold_uncertainty_score":0.9998591},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006386178,0.00006704089,0.9457808,0.00057994487,0.0075782035,0.0003213971,0.000041527604,0.00014775303,0.044844717],"genre_scores_gemma":[0.9900345,0.0000010402406,0.00082123687,0.0003031125,0.00095571246,0.00013943887,0.000017654878,0.00004292302,0.007684334],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965231,0.00013438653,0.0007325774,0.0013987748,0.0006290258,0.00058216735],"domain_scores_gemma":[0.9968273,0.0003742086,0.00082915864,0.0016231608,0.00018037981,0.00016579712],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011162932,0.00046984068,0.00062973594,0.00049625564,0.0006606179,0.00031618323,0.0017706675,0.000559369,0.0010783756],"category_scores_gemma":[0.00013416966,0.0004210534,0.0002682888,0.00011717575,0.0010601585,0.0001987402,0.0004916247,0.0011095664,0.0003156632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005397928,0.00004391336,0.00002604172,0.000024483421,0.000029862687,0.00015789502,0.0015606456,0.003227392,0.000008036763,0.41321227,0.00059416913,0.5810613],"study_design_scores_gemma":[0.0069995797,0.007905628,0.018278228,0.010859668,0.0004109777,0.002316092,0.00018585687,0.30720365,0.0005458653,0.5626056,0.0752942,0.007394619],"about_ca_topic_score_codex":0.00012284998,"about_ca_topic_score_gemma":0.00016873104,"teacher_disagreement_score":0.9893959,"about_ca_system_score_codex":0.00023380994,"about_ca_system_score_gemma":0.0002495786,"threshold_uncertainty_score":0.9998348},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12206712,0.00003867508,0.8735158,0.0026582833,0.0006600118,0.00010833119,2.0691472e-7,0.00009651911,0.00085506367],"genre_scores_gemma":[0.9876908,0.000007055587,0.009815694,0.0015562098,0.00089639134,0.000013124291,0.0000020980274,0.000014243046,0.0000043775945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816346,0.0000025930187,0.00021756496,0.0006616509,0.000509703,0.00044505126],"domain_scores_gemma":[0.9984827,0.000016081422,0.00023418354,0.00079490064,0.00045651765,0.000015616519],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00054255436,0.00020240515,0.0002142239,0.0005404065,0.0010407759,0.0021193712,0.0018538279,0.000050412327,0.000018441686],"category_scores_gemma":[0.00016583539,0.00016935244,0.000042117208,0.0015776821,0.00037415588,0.0023979512,0.0006717448,0.00013955947,0.00006081992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009638867,0.000074308475,0.026758093,0.00029687583,0.000008516624,0.000039504288,0.0000556468,0.16674988,0.000056108784,0.0006686934,0.000008127767,0.8052746],"study_design_scores_gemma":[0.00038156536,0.0000024862716,0.053457435,0.00021643436,0.000027107837,0.0000031227441,0.0000020043763,0.89465076,0.0002072542,0.050448976,0.00023579689,0.00036703685],"about_ca_topic_score_codex":0.00029553662,"about_ca_topic_score_gemma":0.0001013028,"teacher_disagreement_score":0.8656237,"about_ca_system_score_codex":0.000029884955,"about_ca_system_score_gemma":0.00004323484,"threshold_uncertainty_score":0.9989165},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036406391,0.00009863535,0.9928297,0.000076529606,0.00017210675,0.00019442545,0.000005322766,0.000022714947,0.0029599434],"genre_scores_gemma":[0.9816661,0.000014464949,0.017690685,0.000025799864,0.0005306679,0.000006789691,0.000008840425,0.000015707272,0.000040983152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986148,0.000021873806,0.00034585813,0.0005093201,0.00023948163,0.00026868077],"domain_scores_gemma":[0.99891514,0.00018453693,0.00032463734,0.0004293657,0.000102458864,0.000043882945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028575765,0.00025965887,0.0005120664,0.00033820214,0.00021362618,0.00013569965,0.0005978188,0.00013311575,0.000039374612],"category_scores_gemma":[0.000007710506,0.0002504641,0.00010064619,0.00012251611,0.0005496839,0.0001551116,0.00047778685,0.00045042599,7.9468543e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010848582,0.00005272163,0.006748907,0.000014156947,0.000042405183,0.0000035821556,0.0002901834,0.23845212,0.00002657503,0.022429328,0.000012431362,0.7319167],"study_design_scores_gemma":[0.0002550993,0.00006744961,0.0015569339,0.0002252864,0.000038281076,9.534073e-7,1.0123952e-7,0.72791606,0.00009089917,0.26939175,0.00013122073,0.00032595702],"about_ca_topic_score_codex":0.0011065548,"about_ca_topic_score_gemma":0.0015534201,"teacher_disagreement_score":0.97802544,"about_ca_system_score_codex":0.000050468698,"about_ca_system_score_gemma":0.00012567922,"threshold_uncertainty_score":0.99999475},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71538866,0.00020550411,0.27991268,0.0017365,0.0004584113,0.0021852306,0.000043453125,0.000021531507,0.00004801998],"genre_scores_gemma":[0.9968326,0.000013377119,0.002268507,0.00032258697,0.00041855985,0.000093197195,0.000013665365,0.000022961027,0.0000145109025],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9971531,0.00006759767,0.00039453013,0.00071636785,0.0010338026,0.0006345961],"domain_scores_gemma":[0.9969489,0.0006241958,0.00021254404,0.00174279,0.00031794765,0.00015362524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071100617,0.0002779901,0.00045414153,0.00021584576,0.00063429767,0.00028586024,0.0017070099,0.0000849795,0.000021103237],"category_scores_gemma":[0.0006425033,0.00017833232,0.00016146034,0.0004105033,0.0010013131,0.0006690449,0.0008770928,0.0003818811,0.0000021968538],"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.00040420855,0.000782668,0.7433514,0.0006992097,0.000069726986,0.00014906494,0.0022260353,0.0022407738,0.0024145467,0.00003729406,0.000024307852,0.24760075],"study_design_scores_gemma":[0.0015359661,0.00027553624,0.79836184,0.00024252528,0.00004408671,0.000028405115,0.00003116816,0.19574597,0.0029974796,0.0005380834,0.00001680846,0.00018214433],"about_ca_topic_score_codex":0.0003718421,"about_ca_topic_score_gemma":0.00037465148,"teacher_disagreement_score":0.28144395,"about_ca_system_score_codex":0.00030901664,"about_ca_system_score_gemma":0.0010786065,"threshold_uncertainty_score":0.72721815},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062246583,0.000020772788,0.93232524,0.004950473,0.0001323857,0.00019720006,4.5953269e-7,0.00008724193,0.00003965321],"genre_scores_gemma":[0.5233749,0.000003980122,0.47627637,0.0002470878,0.0000873468,0.0000020998823,4.83703e-7,0.000005601344,0.000002121582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999081,0.0000067625288,0.000104520106,0.00038987192,0.0001979447,0.00021987187],"domain_scores_gemma":[0.99888694,0.00004472154,0.00010210848,0.000815597,0.0000867949,0.000063814296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019039806,0.000092893184,0.00012047828,0.00012255613,0.0005045954,0.00014236257,0.00035758264,0.000037237074,0.0000020025832],"category_scores_gemma":[0.00023110889,0.00008404317,0.000023548966,0.0003104458,0.0003405865,0.00023009875,0.00022018548,0.00016996502,0.0000015970239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003351777,0.00013808634,0.0662775,0.0000769128,0.0000062830004,0.00007259697,0.0008861218,0.37244797,0.32690167,0.01006282,0.000016994509,0.22307955],"study_design_scores_gemma":[0.00018467523,0.000034913875,0.009269853,0.00013151197,0.000005723006,0.000074373864,3.1317848e-7,0.8925055,0.07092636,0.02658918,0.00016390262,0.00011367495],"about_ca_topic_score_codex":0.00002649511,"about_ca_topic_score_gemma":0.0000033008964,"teacher_disagreement_score":0.52005756,"about_ca_system_score_codex":0.000074772746,"about_ca_system_score_gemma":0.00008361402,"threshold_uncertainty_score":0.3880991},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003698529,0.00020471065,0.99727947,0.00045168627,0.00069596054,0.00064694096,0.0000055985724,0.00024814627,0.00009762152],"genre_scores_gemma":[0.32156643,0.000023785933,0.6777345,0.00038305952,0.00017097202,0.000023061202,0.000023398314,0.000026910442,0.00004791996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970384,0.000057391157,0.0006557429,0.0010355124,0.0007584582,0.00045444298],"domain_scores_gemma":[0.9976793,0.0008257706,0.00055678125,0.0005987012,0.00020341654,0.00013606508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013476419,0.00036210733,0.0005542594,0.0007863581,0.00029000675,0.00030712242,0.0016051426,0.00028573495,0.000008479359],"category_scores_gemma":[0.00049973244,0.0003616956,0.000082451,0.00020180072,0.00064236304,0.0005941959,0.0010154188,0.0007364883,0.0000016167652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013122807,0.00002314818,0.00032495696,0.00013360743,0.000009613656,0.00021748489,0.0010962334,0.00884907,0.0011907184,0.00023487126,0.00001549218,0.9878917],"study_design_scores_gemma":[0.0007348354,0.00028274584,0.00030429292,0.000610323,0.000006498654,0.000070229704,6.308217e-7,0.98042953,0.010896244,0.0062579657,0.000051995696,0.00035468023],"about_ca_topic_score_codex":0.00021887649,"about_ca_topic_score_gemma":0.000092927476,"teacher_disagreement_score":0.987537,"about_ca_system_score_codex":0.00015184055,"about_ca_system_score_gemma":0.0003220243,"threshold_uncertainty_score":0.9998835},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042896303,0.000340325,0.993992,0.000302635,0.000442844,0.00034995275,0.0000108996355,0.000043046883,0.00022871117],"genre_scores_gemma":[0.13824323,0.00021924195,0.8585192,0.0017904628,0.000467561,0.00000620677,0.00019699514,0.00005192447,0.00050515414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998325,0.000014736648,0.00028340373,0.0005883191,0.00058182987,0.0002067148],"domain_scores_gemma":[0.99866223,0.0000854304,0.00023859409,0.0006079479,0.00026858388,0.00013720682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037996098,0.00024489197,0.00032810977,0.00036561032,0.00030159473,0.0001904297,0.00031266373,0.00022094416,0.00002343363],"category_scores_gemma":[0.0008924727,0.00019705539,0.00006415128,0.00009564658,0.00055322517,0.00026045737,0.0003155715,0.00026243887,0.000007554129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004958719,0.000020923742,0.002501841,0.00012765346,0.000021182055,0.00013147856,0.00032951788,0.060284,0.000889553,0.00016552262,0.00006355663,0.9354152],"study_design_scores_gemma":[0.0007659528,0.00015130552,0.0024289633,0.0018240715,0.00006020709,0.00035762563,2.2997257e-7,0.9601128,0.00095417176,0.03283469,0.00025039067,0.0002595543],"about_ca_topic_score_codex":0.000020575797,"about_ca_topic_score_gemma":0.00002053971,"teacher_disagreement_score":0.93515563,"about_ca_system_score_codex":0.00013221514,"about_ca_system_score_gemma":0.00034622673,"threshold_uncertainty_score":0.80356854},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000066775254,0.00069562026,0.9925235,0.00085113867,0.0012566816,0.0006077319,0.000024225601,0.00020429019,0.0037700327],"genre_scores_gemma":[0.100485474,0.000055198307,0.8940823,0.0025691334,0.0013235231,0.00005060354,0.00011844902,0.00013925083,0.0011760703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682665,0.00003155637,0.00040955655,0.0013139012,0.0007206657,0.000697666],"domain_scores_gemma":[0.99669677,0.0013948026,0.00035470608,0.00092710153,0.00038110907,0.00024552576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009357874,0.0005741427,0.0006900083,0.0015551725,0.0008090015,0.0003231679,0.00068439846,0.00023168625,0.00003777882],"category_scores_gemma":[0.0004248868,0.0005196331,0.00052588293,0.00025411238,0.0013336444,0.00021218017,0.00010606921,0.0012398368,0.000011589587],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030804233,0.00018794842,0.02540789,0.00043609104,0.00018245286,0.00006099071,0.00086077163,0.045182426,0.005308386,0.00031117068,0.00026504797,0.92148876],"study_design_scores_gemma":[0.0067696963,0.002587474,0.011889155,0.0064492323,0.00091286673,0.0024008218,0.0000058990277,0.5650164,0.0024591521,0.072119206,0.32556623,0.0038238398],"about_ca_topic_score_codex":0.000038122584,"about_ca_topic_score_gemma":0.000019848665,"teacher_disagreement_score":0.91766495,"about_ca_system_score_codex":0.00013952106,"about_ca_system_score_gemma":0.0005151133,"threshold_uncertainty_score":0.9997255},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01916371,0.0013158061,0.9715511,0.004427762,0.0013702972,0.0014074607,0.000009050681,0.00013733275,0.0006174346],"genre_scores_gemma":[0.29553103,0.000096982985,0.70130277,0.0017963193,0.000981915,0.000017015513,0.000022164817,0.000042225845,0.00020957322],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9975904,0.000035135283,0.00041475875,0.0010995206,0.00044201248,0.00041815056],"domain_scores_gemma":[0.9977742,0.0009028384,0.00026919227,0.0005583234,0.00019740971,0.00029807643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049985823,0.00040697257,0.0007846508,0.00028920846,0.00023217361,0.0003745177,0.00032514372,0.00020069083,0.0000061725477],"category_scores_gemma":[0.00047061304,0.00030624683,0.00010417983,0.00011018123,0.001644441,0.00010696705,0.00030950707,0.0006214547,0.0000063870602],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002147356,0.0009708519,0.38166732,0.0013658206,0.00016025045,0.0017660158,0.0001762998,0.0011188865,0.00020089473,0.00005520494,0.0017835317,0.6105202],"study_design_scores_gemma":[0.006278274,0.006385682,0.71527237,0.012338564,0.0005736884,0.0018246828,2.7852047e-7,0.25316402,0.0004952785,0.0024228648,0.00033527907,0.0009090255],"about_ca_topic_score_codex":0.000019905467,"about_ca_topic_score_gemma":0.000043292006,"teacher_disagreement_score":0.60961115,"about_ca_system_score_codex":0.0001669393,"about_ca_system_score_gemma":0.0011570656,"threshold_uncertainty_score":0.99993896},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015867203,0.00019262364,0.97691727,0.0017113145,0.0023388206,0.00058757234,0.000013691394,0.0000886424,0.002282849],"genre_scores_gemma":[0.97404146,0.00003761477,0.022103617,0.0028144293,0.0006057277,0.0000063282096,5.555364e-7,0.000033609944,0.00035666488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972172,0.0000527312,0.000308417,0.0012651385,0.00054648396,0.0006100747],"domain_scores_gemma":[0.9978787,0.0006733019,0.00015448165,0.0010432749,0.00008285863,0.00016741577],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004094782,0.0004197574,0.00035485465,0.00037929552,0.0008639197,0.0011391109,0.0024666267,0.00016496549,0.000012427729],"category_scores_gemma":[0.00036527606,0.00029336955,0.0000870153,0.00017188421,0.001536473,0.0003189409,0.0012396824,0.000776138,0.000019162788],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021325473,0.00003818432,0.000117148375,0.00003407955,0.000011806968,0.000115976974,0.0037934827,0.01048311,0.052644465,0.0037893727,0.000068606656,0.9288824],"study_design_scores_gemma":[0.0006638946,0.0015564372,0.0008142143,0.0033535915,0.000071908886,0.001807439,0.0000031387165,0.5416868,0.19193606,0.2442207,0.010991735,0.0028941182],"about_ca_topic_score_codex":0.000037377544,"about_ca_topic_score_gemma":0.000075203745,"teacher_disagreement_score":0.9581742,"about_ca_system_score_codex":0.00011613632,"about_ca_system_score_gemma":0.00014286791,"threshold_uncertainty_score":0.99995184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006562925,0.000019086185,0.96734107,0.0018055169,0.0015249245,0.0014826374,0.00014395952,0.00021808238,0.026808426],"genre_scores_gemma":[0.64145505,0.00009227721,0.32400632,0.00854958,0.0037510253,0.00019934603,0.00007895018,0.00036153154,0.021505902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99384546,0.00016663647,0.00071931013,0.0029889303,0.0012203592,0.0010593229],"domain_scores_gemma":[0.9942476,0.002596512,0.0007400428,0.0019153486,0.0002234681,0.00027699562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014184375,0.00087186013,0.0009796531,0.00052941527,0.0006320141,0.000913527,0.0038750535,0.00045093504,0.000031385203],"category_scores_gemma":[0.0005606358,0.0007655133,0.00031356802,0.00018492722,0.0020384446,0.0005853665,0.0014417254,0.0011389522,0.0000394414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053913554,0.00056029164,0.00002181405,0.00031273632,0.000067578934,0.00030833206,0.003637996,0.08880953,0.080791995,0.058713805,0.0038667617,0.76237005],"study_design_scores_gemma":[0.0010830224,0.0017893405,0.00020906104,0.00048604872,0.000030769315,0.00015063396,8.5380947e-7,0.89092577,0.01592302,0.081305176,0.0064696176,0.0016267116],"about_ca_topic_score_codex":0.00004869306,"about_ca_topic_score_gemma":0.000022651217,"teacher_disagreement_score":0.8021162,"about_ca_system_score_codex":0.00036576408,"about_ca_system_score_gemma":0.0007618712,"threshold_uncertainty_score":0.9994796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022733197,0.00078307564,0.97424203,0.000022747217,0.0007789715,0.00016278792,0.000014711402,0.00006998921,0.0011924849],"genre_scores_gemma":[0.9446451,0.00013506417,0.055004165,0.000022188946,0.00013990358,0.000003845887,0.0000055473765,0.00003069564,0.000013514262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997862,0.000012361214,0.0004928853,0.00067218323,0.0005480975,0.0004124719],"domain_scores_gemma":[0.99870783,0.00018184877,0.00014643771,0.0007901706,0.00011433111,0.00005937422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039959722,0.00037930586,0.0007467476,0.0010386378,0.00011349818,0.00012232504,0.0012425779,0.00026445958,0.00001133323],"category_scores_gemma":[0.00008925842,0.00037423524,0.00017494235,0.0004975173,0.00047935417,0.00041652168,0.0002868586,0.00064016064,0.0000041630055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019482636,0.000004043713,0.0011276165,0.00005801611,0.000058239446,0.00003027966,0.00066099333,0.9770443,0.002671498,0.000057043424,7.512931e-8,0.018285962],"study_design_scores_gemma":[0.00008118592,0.00002573779,0.00015833958,0.0004880998,0.000060024104,0.0000029604773,5.302893e-7,0.9869851,0.002250185,0.009574842,0.000009256503,0.00036375292],"about_ca_topic_score_codex":0.0003647334,"about_ca_topic_score_gemma":0.0013370118,"teacher_disagreement_score":0.9219119,"about_ca_system_score_codex":0.00040489613,"about_ca_system_score_gemma":0.00013415268,"threshold_uncertainty_score":0.99987096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45026594,0.0009843322,0.3654151,0.0014869245,0.0028849386,0.0032403802,0.000029337138,0.0001817872,0.17551126],"genre_scores_gemma":[0.99470913,0.000080673024,0.004660326,0.0003010936,0.00012223859,0.0000013732454,0.0000091205475,0.000008541814,0.00010746963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990158,0.000023264154,0.00024327706,0.00030441573,0.00028940573,0.00012381606],"domain_scores_gemma":[0.998824,0.0006048433,0.00017975603,0.00027000552,0.000085092586,0.000036311194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000543135,0.00012857691,0.00027904898,0.00020483145,0.00008733687,0.000060231814,0.00015840962,0.00013740039,0.00005056449],"category_scores_gemma":[0.00020831345,0.000089735644,0.000028236938,0.00008198242,0.0006166875,0.00009385641,0.0000335405,0.00020707045,0.0000029000935],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074507894,0.000025473732,0.0057393205,0.00006049484,0.000010699621,0.000021986347,0.0028196897,0.0006126372,0.0014685092,0.0035099578,0.0000024555327,0.9856543],"study_design_scores_gemma":[0.014235558,0.0024797483,0.102710806,0.012453259,0.00029203782,0.0020844527,0.000046446832,0.7182864,0.016172364,0.12226009,0.0065918528,0.002387003],"about_ca_topic_score_codex":0.000037259982,"about_ca_topic_score_gemma":0.00004188544,"teacher_disagreement_score":0.98326725,"about_ca_system_score_codex":0.0000425611,"about_ca_system_score_gemma":0.000093380586,"threshold_uncertainty_score":0.36593133},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015453178,0.00006142747,0.981709,0.00026122888,0.00008856608,0.00053252635,0.0000070733463,0.000060336362,0.0018266551],"genre_scores_gemma":[0.91813016,0.00006395661,0.08151284,0.000108326814,0.00005570604,0.0000042880733,0.000020248921,0.000017687069,0.00008681361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999011,0.000008610537,0.00023962725,0.00042626204,0.00019139514,0.00012311217],"domain_scores_gemma":[0.9991126,0.00018849516,0.00024518764,0.00027995708,0.00013491153,0.0000388137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117912976,0.00015807069,0.00031959088,0.0003788831,0.00006235861,0.000034085802,0.00016718563,0.00008545485,0.000006411973],"category_scores_gemma":[0.000076504664,0.00014295483,0.000026066713,0.000081870174,0.00046540142,0.00014272862,0.00014781422,0.00020876195,9.256647e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017557196,0.00006229009,0.010986157,0.0003780746,0.00002587165,0.00009388081,0.0028629955,0.010236109,0.023006886,0.019365571,0.00002264395,0.93278396],"study_design_scores_gemma":[0.0009151061,0.00041650064,0.026984412,0.001967358,0.000030980063,0.00016320703,7.022095e-7,0.6935934,0.00982803,0.2655351,0.000115696086,0.0004495578],"about_ca_topic_score_codex":0.00002995828,"about_ca_topic_score_gemma":0.000012828688,"teacher_disagreement_score":0.93233436,"about_ca_system_score_codex":0.00008600462,"about_ca_system_score_gemma":0.00008573214,"threshold_uncertainty_score":0.58295286},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006911344,0.00009029657,0.9930314,0.00029438545,0.004020841,0.000966974,0.0000051407783,0.00024474756,0.00127712],"genre_scores_gemma":[0.5443412,0.00006662772,0.4524774,0.0008405026,0.0009153791,0.00014893057,0.00001913971,0.00008024259,0.0011105791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670905,0.000033084645,0.00049488223,0.0015050702,0.00073489983,0.00052299467],"domain_scores_gemma":[0.9974342,0.00018959604,0.00045991613,0.0013314817,0.00044486564,0.00013992182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008909233,0.00044169326,0.00040712795,0.0008546739,0.00080768304,0.0008994327,0.0020334912,0.0003271686,0.000011930782],"category_scores_gemma":[0.00026091177,0.0004146672,0.00022089996,0.0002802052,0.0004287712,0.00077788904,0.00046061294,0.00040343133,0.000017883143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013522702,0.000037930047,0.0000057741054,0.000068012654,0.000009908132,0.000006806723,0.00019504914,0.26433372,0.00025730242,0.0073739705,0.000007301257,0.7276907],"study_design_scores_gemma":[0.00030421,0.0003800175,0.000045979115,0.00016943685,0.0000125119195,0.00002954309,9.264577e-8,0.8906897,0.0015187928,0.10572,0.00065545953,0.00047429695],"about_ca_topic_score_codex":0.000017765062,"about_ca_topic_score_gemma":0.00014168075,"teacher_disagreement_score":0.72721636,"about_ca_system_score_codex":0.00034110728,"about_ca_system_score_gemma":0.00029215243,"threshold_uncertainty_score":0.99983054},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52165055,0.0036817621,0.4622338,0.0066974573,0.0020370504,0.0015234731,0.0013550473,0.0000773555,0.00074348896],"genre_scores_gemma":[0.9985866,0.00046603233,0.0004509624,0.000019769335,0.00011254403,0.0000030699555,0.00031786534,8.0308536e-7,0.000042362506],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99900264,0.000024184672,0.0002552595,0.0002832812,0.0003204087,0.000114243616],"domain_scores_gemma":[0.9989441,0.00028511317,0.00040300947,0.00010102136,0.00023428974,0.000032486627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029808987,0.000117899464,0.00014455766,0.00001827012,0.00035003902,0.000071217626,0.00029149675,0.00012324043,0.000010594815],"category_scores_gemma":[0.00013738043,0.000050506445,0.000037817226,0.000081785605,0.00032869316,0.00009735323,0.00009760365,0.00011969328,4.784392e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020765297,0.0000474377,0.0016582826,0.000010970473,0.000011676448,5.2117144e-7,0.00008018294,0.0011110639,0.036538776,0.0014264949,0.000020770678,0.95907307],"study_design_scores_gemma":[0.0007303821,0.0015208658,0.43322054,0.00055368,0.00010224621,0.00003473244,0.0000025008787,0.1804513,0.11858338,0.25319505,0.010552281,0.0010530249],"about_ca_topic_score_codex":0.00015421455,"about_ca_topic_score_gemma":0.0004827631,"teacher_disagreement_score":0.95802003,"about_ca_system_score_codex":0.000050783947,"about_ca_system_score_gemma":0.000029586043,"threshold_uncertainty_score":0.26922524},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001086291,0.0003391973,0.97639763,0.0034291677,0.0018374458,0.0015110483,0.000010812058,0.00014080512,0.015247627],"genre_scores_gemma":[0.6226563,0.00036487548,0.31586674,0.012208819,0.0031615084,0.0000745403,0.000039295857,0.00022571089,0.045402247],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975675,0.000012058091,0.00029159774,0.0009490001,0.0007510721,0.00042881243],"domain_scores_gemma":[0.9982895,0.00008461071,0.00020907258,0.0009909015,0.00019383502,0.00023207701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003594801,0.0003835444,0.00046147036,0.000720523,0.0003062409,0.0002470889,0.00065574737,0.00022221464,0.0000678084],"category_scores_gemma":[0.00012410138,0.00032297175,0.00013605741,0.0001305757,0.00045866464,0.000093686125,0.0005242247,0.0005287843,0.00008020152],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066180844,0.000039254213,0.0000626617,0.00009795254,0.00002232475,0.00079125,0.00023586678,0.0014927301,0.0007927371,0.00021774689,0.0005116951,0.9956696],"study_design_scores_gemma":[0.0074840155,0.010743877,0.026779946,0.01731985,0.0008767181,0.005981147,0.000005796745,0.061931424,0.09144285,0.16800627,0.60114205,0.008286044],"about_ca_topic_score_codex":0.000017917115,"about_ca_topic_score_gemma":0.00004473667,"teacher_disagreement_score":0.98738354,"about_ca_system_score_codex":0.00019072785,"about_ca_system_score_gemma":0.00020987315,"threshold_uncertainty_score":0.9999222},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047023455,0.0011918297,0.9898682,0.00032770642,0.0004245993,0.0005641389,0.00003142254,0.000012149731,0.0028775884],"genre_scores_gemma":[0.9355418,0.00018872682,0.05638911,0.00030007176,0.0004966223,0.000018422932,0.000026366662,0.00006956443,0.006969281],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985171,0.000013293574,0.00020804346,0.00064669905,0.00033151516,0.00028335958],"domain_scores_gemma":[0.9983169,0.000023249111,0.00029995764,0.0011659173,0.00014436024,0.000049655122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020627145,0.0002567073,0.00026426069,0.00006724811,0.00015550185,0.00008650325,0.0012215042,0.00017919214,0.000014108704],"category_scores_gemma":[0.000039630868,0.00015185076,0.00006742556,0.00008083726,0.0007080492,0.0000076148403,0.00039731126,0.00018006997,0.0000020474743],"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.0003425628,0.0002729135,0.0009158282,0.00027937404,0.00020192993,0.0001279888,0.0004511215,0.016218876,0.52010196,0.0004925225,0.000121166115,0.46047378],"study_design_scores_gemma":[0.0024902697,0.002733868,0.0025370256,0.0017350783,0.00016802236,0.0006036454,0.000001567672,0.019123005,0.8484591,0.008537198,0.11114586,0.0024653308],"about_ca_topic_score_codex":0.000016347623,"about_ca_topic_score_gemma":0.0003704934,"teacher_disagreement_score":0.93347913,"about_ca_system_score_codex":0.000040533338,"about_ca_system_score_gemma":0.00032555766,"threshold_uncertainty_score":0.61922944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002160519,0.00003951626,0.989189,0.0011305091,0.00025979785,0.00035992893,0.000007086211,0.00007413191,0.008723945],"genre_scores_gemma":[0.046432726,0.000019446674,0.9343859,0.0045216195,0.0008929546,0.000021018725,0.00004889154,0.00007198918,0.013605435],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855655,0.0000046942628,0.0002121175,0.000634762,0.00037025474,0.00022161427],"domain_scores_gemma":[0.9988498,0.00004722313,0.00018473766,0.0007175547,0.00012689985,0.00007380185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013141465,0.00022678338,0.00023608946,0.00026123857,0.00024804854,0.00010026819,0.00027567506,0.00013388666,0.0004233635],"category_scores_gemma":[0.000011334827,0.00020623629,0.00006760027,0.000065702596,0.00037526852,0.00016760865,0.0002016724,0.0004182902,0.00007441261],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015635153,0.00022125695,0.039154742,0.00047011208,0.00008890397,0.00035805782,0.0007548217,0.07072322,0.011576799,0.005338048,0.0038290855,0.8673286],"study_design_scores_gemma":[0.0026779256,0.00062369055,0.07833787,0.0041703884,0.0004322427,0.0031108565,5.385511e-7,0.36640105,0.011552204,0.45869562,0.07071389,0.0032837107],"about_ca_topic_score_codex":0.0000057632533,"about_ca_topic_score_gemma":0.0000020444465,"teacher_disagreement_score":0.8640449,"about_ca_system_score_codex":0.00018230085,"about_ca_system_score_gemma":0.00016887202,"threshold_uncertainty_score":0.84100723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06256771,0.00051865896,0.48379633,0.0015560946,0.005199331,0.0016843589,0.000017482409,0.00045693625,0.4442031],"genre_scores_gemma":[0.95686823,0.00015394711,0.033496697,0.00060669973,0.0035744263,0.000009605895,0.000091411996,0.00011642429,0.005082564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982626,0.0000043499267,0.00036933945,0.0005705292,0.0005184986,0.00027468053],"domain_scores_gemma":[0.998146,0.00014703788,0.00067213894,0.00073186186,0.00028852824,0.000014447065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008484807,0.0002775859,0.00039154314,0.0006282697,0.00022092875,0.00045005122,0.0010481834,0.00015686172,0.0003360746],"category_scores_gemma":[0.0001326421,0.00025256077,0.00009146439,0.00015402715,0.00037395916,0.00080390467,0.00061482517,0.00026464745,0.00006659287],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032713087,0.00003224942,0.006074002,0.0003208307,0.000015827829,0.00003572457,0.0001244782,0.00119396,0.003433696,0.0018492971,0.00006680587,0.9868204],"study_design_scores_gemma":[0.0038246876,0.0002782839,0.08004084,0.010921818,0.0012997522,0.00008549479,0.0000016843435,0.47802427,0.01728003,0.3077538,0.09250102,0.007988326],"about_ca_topic_score_codex":0.00029831467,"about_ca_topic_score_gemma":0.000071430855,"teacher_disagreement_score":0.97883207,"about_ca_system_score_codex":0.000040184725,"about_ca_system_score_gemma":0.00010062913,"threshold_uncertainty_score":0.99999267},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008581317,0.000058799338,0.9845611,0.00002421792,0.00021790323,0.0061368155,0.0000050618805,0.000016691401,0.000398134],"genre_scores_gemma":[0.91088784,0.000009843368,0.08862834,0.0000113415535,0.00008865597,0.00032415218,0.000005034074,0.00001784917,0.000026971265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670386,0.000049788723,0.00066469586,0.000856891,0.001328309,0.00039645968],"domain_scores_gemma":[0.9967331,0.00043120416,0.000917174,0.0014874418,0.00037130492,0.000059736296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002233162,0.00032724848,0.0005171438,0.0006389387,0.00010430319,0.000092179194,0.0020931417,0.00024897736,0.000008233978],"category_scores_gemma":[0.00013005517,0.00029160242,0.00016025828,0.0001651078,0.00043466862,0.00046683926,0.00045914666,0.00027727496,0.0000016073833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011306132,0.00003512612,0.0004138713,0.000028391943,0.0000045358056,4.9700367e-7,0.00017891503,0.67903787,0.00010501565,0.00029335538,3.3866863e-7,0.31989077],"study_design_scores_gemma":[0.00061589916,0.00045645662,0.0051993253,0.00071414036,0.0000077403565,0.0000017079088,2.5369943e-8,0.9860154,0.0014696557,0.005228267,0.000030494324,0.00026087966],"about_ca_topic_score_codex":0.000018217836,"about_ca_topic_score_gemma":0.00002345267,"teacher_disagreement_score":0.9023065,"about_ca_system_score_codex":0.00057113357,"about_ca_system_score_gemma":0.00057543645,"threshold_uncertainty_score":0.9999536},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014526381,0.00011537572,0.99340844,0.00017146755,0.00019620243,0.0002751556,5.3579964e-7,0.0022964915,0.0033910768],"genre_scores_gemma":[0.33712578,0.000009243464,0.66225374,0.00022575795,0.00007759874,0.000008737505,0.0000022226,0.000020416905,0.00027650007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970455,0.000021601563,0.0003389196,0.001309072,0.00076714787,0.0005177149],"domain_scores_gemma":[0.99725854,0.00052800967,0.000414188,0.0012958854,0.00035715252,0.00014622066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009920612,0.000441553,0.00039136037,0.00046489414,0.00077797694,0.00065067236,0.0015740861,0.00020933384,0.0000010366533],"category_scores_gemma":[0.0006910508,0.00037551677,0.00003972461,0.00020161005,0.0007136731,0.0006208598,0.0013230311,0.0008881683,0.0000028619386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007951231,0.000011683498,0.0012391824,0.000054687516,0.000007691666,0.000058349426,0.00077981746,0.3378693,0.00003597067,0.0060620653,0.00001828109,0.653855],"study_design_scores_gemma":[0.0001394432,0.00025211571,0.0001234307,0.0007870019,0.000006047778,0.00008201097,2.9769508e-8,0.8520257,0.00015073338,0.14592917,0.00009994812,0.00040436417],"about_ca_topic_score_codex":0.00007290976,"about_ca_topic_score_gemma":0.000012035928,"teacher_disagreement_score":0.65345067,"about_ca_system_score_codex":0.00018958193,"about_ca_system_score_gemma":0.00041565913,"threshold_uncertainty_score":0.9998697},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032434365,0.000055237168,0.9912792,0.0014589988,0.0035459078,0.00034495594,0.000020249721,0.0002172458,0.0027538536],"genre_scores_gemma":[0.275891,0.000019426932,0.72101,0.0011360105,0.0014981123,0.000017225268,0.000013532016,0.00003974726,0.00037488848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554926,0.000056246627,0.00046042318,0.0021472275,0.0010588221,0.0007279905],"domain_scores_gemma":[0.9960614,0.0005810316,0.0006076829,0.0020686272,0.00036751953,0.00031374628],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042428475,0.00064139755,0.0006407242,0.00066205644,0.00061093806,0.001196377,0.004872203,0.0003644109,0.000037040205],"category_scores_gemma":[0.00040199756,0.00060436246,0.00013096155,0.00030693263,0.0008463714,0.0010163994,0.0021156138,0.0014654481,0.00014369519],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000463777,0.000008533068,0.000055902598,0.000008815396,0.000012615435,0.000093198796,0.00154587,0.010635049,0.00044163805,0.003287497,0.000005504382,0.9839007],"study_design_scores_gemma":[0.00030765508,0.00022873576,0.0006420904,0.0010252834,0.000013962878,0.00010233285,7.3352766e-7,0.68267924,0.0052870726,0.30618864,0.0022244195,0.0012998357],"about_ca_topic_score_codex":0.00059299427,"about_ca_topic_score_gemma":0.00012435162,"teacher_disagreement_score":0.9826009,"about_ca_system_score_codex":0.00040096452,"about_ca_system_score_gemma":0.0006833335,"threshold_uncertainty_score":0.9998405},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092944974,0.00014304063,0.9664643,0.031092158,0.0005953784,0.00035003026,0.0000014880973,0.00003816963,0.00038602843],"genre_scores_gemma":[0.9390552,0.000071131915,0.048592057,0.011930369,0.0002511879,0.0000055222467,7.003845e-7,0.000029675935,0.0000641363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638474,0.00021506069,0.0005926475,0.0010609295,0.0011139062,0.00063268817],"domain_scores_gemma":[0.9927351,0.0048151943,0.000498386,0.0017590933,0.00009269204,0.000099520104],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0042248727,0.00041627183,0.00048502517,0.00045046496,0.0007297895,0.0014610835,0.0024374982,0.0006394856,0.0000025023162],"category_scores_gemma":[0.0007805847,0.00026318541,0.00010390557,0.00027604582,0.0025583513,0.0006783961,0.0013410436,0.004042296,0.0000030445226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097164084,0.00010553603,0.00201405,0.0004918457,0.000098184115,0.001606759,0.07358242,0.10601658,0.0021260772,0.5267303,0.0016116435,0.28551945],"study_design_scores_gemma":[0.00056238397,0.00019134361,0.001349434,0.0026525725,0.000043844146,0.0015518697,0.000023491211,0.7211674,0.00062669616,0.2673979,0.0033563187,0.0010767438],"about_ca_topic_score_codex":0.000070222806,"about_ca_topic_score_gemma":0.00012911997,"teacher_disagreement_score":0.9381258,"about_ca_system_score_codex":0.00021391241,"about_ca_system_score_gemma":0.00037783157,"threshold_uncertainty_score":0.99998206},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029112665,0.0005313559,0.9630447,0.00057694764,0.0040672366,0.0013899024,0.0009875012,0.00028384494,0.000005814267],"genre_scores_gemma":[0.50987333,0.000014911847,0.4890101,0.00047974518,0.00028166405,0.000017099068,0.0003076519,0.00001539829,1.2294525e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993299,0.00019605069,0.0005398946,0.0036094745,0.0011802486,0.0011753239],"domain_scores_gemma":[0.9902707,0.0006868124,0.00028092743,0.008077587,0.0004054172,0.00027857753],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0021454142,0.0006032475,0.0006657887,0.00090206077,0.0004434333,0.002185868,0.017737672,0.00043856146,0.000012210554],"category_scores_gemma":[0.00030820986,0.00054242555,0.00012924008,0.0023218717,0.00077434676,0.0021731118,0.011827273,0.0012298446,0.000006229798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001009202,0.0004696894,0.0059877858,0.000847674,0.00005044569,0.000040812047,0.007111445,0.5109394,0.0024495837,0.0145895975,0.00030292512,0.45710966],"study_design_scores_gemma":[0.0004412848,0.00019957632,0.0018689606,0.00014927654,0.000008905966,0.000015304591,0.0000014918228,0.9241544,0.0024306076,0.069614634,0.00046392294,0.0006516491],"about_ca_topic_score_codex":0.00026225141,"about_ca_topic_score_gemma":0.00048145698,"teacher_disagreement_score":0.48076063,"about_ca_system_score_codex":0.00013271389,"about_ca_system_score_gemma":0.0012692352,"threshold_uncertainty_score":0.99970275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062384276,0.0031113708,0.9855863,0.008017749,0.0011253094,0.0008010488,0.000069902264,0.00037312182,0.0002913556],"genre_scores_gemma":[0.16567963,0.0005233092,0.8307709,0.002512796,0.00026283294,0.00004259605,0.000101487545,0.000058434194,0.000047996145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941425,0.000068430025,0.00066473545,0.0030710057,0.001142186,0.00091118994],"domain_scores_gemma":[0.9825057,0.00053174153,0.00034009462,0.016320104,0.0001287056,0.00017365816],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001988712,0.00061249395,0.00065944996,0.0010379271,0.00021595097,0.0006138357,0.055465396,0.0004914509,0.000009136719],"category_scores_gemma":[0.00078661233,0.00056669686,0.000039350612,0.00077825866,0.00070097775,0.0005421722,0.1832368,0.001260179,0.000021172178],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013198094,0.00007050415,0.0004923166,0.00065480795,0.000016511021,0.00016680901,0.0009606861,0.025143312,0.000039331655,0.008165929,0.000928104,0.9633485],"study_design_scores_gemma":[0.00028133718,0.00016397769,0.0000932377,0.0008603383,0.0000037512625,0.00004660794,9.3721377e-7,0.88069326,0.00013016633,0.11277414,0.004383339,0.0005689203],"about_ca_topic_score_codex":0.00011992742,"about_ca_topic_score_gemma":0.00075304677,"teacher_disagreement_score":0.9627796,"about_ca_system_score_codex":0.00036734322,"about_ca_system_score_gemma":0.00036256143,"threshold_uncertainty_score":0.99967843},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016908205,0.00033219164,0.9935853,0.0008506515,0.0018579754,0.0006513412,0.0000059546473,0.00017594076,0.0023715757],"genre_scores_gemma":[0.13917856,0.000007709901,0.8593484,0.00058776076,0.00039047678,0.000025411375,0.000006020412,0.000043140826,0.00041252305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576277,0.0000621766,0.00044129303,0.001945572,0.00094917003,0.00083903206],"domain_scores_gemma":[0.99606615,0.0010332824,0.0005039607,0.0019400286,0.00028506253,0.00017149589],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024307645,0.00066830794,0.0008146592,0.0005933486,0.0008063754,0.0017829319,0.0037634096,0.00032037878,0.000004800313],"category_scores_gemma":[0.00027565795,0.0005088578,0.00028768898,0.00024443222,0.00046109452,0.0012422976,0.0005465227,0.00084104703,0.000013664349],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001861296,0.000021422033,0.00019007904,0.000059223716,0.000030969157,0.00012427567,0.0015913437,0.003660695,0.00020011216,0.0026095135,0.00001689161,0.99147683],"study_design_scores_gemma":[0.0026357733,0.0023360741,0.0015007623,0.0060442756,0.000073360105,0.00033323158,0.000003454223,0.8800388,0.0026551806,0.0964419,0.0044662803,0.003470921],"about_ca_topic_score_codex":0.00002853689,"about_ca_topic_score_gemma":0.0002467259,"teacher_disagreement_score":0.98800594,"about_ca_system_score_codex":0.00020426833,"about_ca_system_score_gemma":0.00059991947,"threshold_uncertainty_score":0.9997363},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001310051,0.00013843417,0.9944234,0.0005284934,0.0019028202,0.0009552924,0.000018234054,0.00021065738,0.00051262364],"genre_scores_gemma":[0.6643538,0.000015642468,0.33056518,0.0013465578,0.0011133669,0.00006594785,0.000062355844,0.00010864019,0.0023685065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959704,0.000059579546,0.0007001405,0.0017107084,0.0008793076,0.0006798352],"domain_scores_gemma":[0.9952885,0.0002726771,0.00072286814,0.0029219359,0.0005308956,0.00026311426],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012467755,0.0005519061,0.00066661637,0.0008711576,0.0006208217,0.0018842841,0.005115106,0.00040450794,0.000023830478],"category_scores_gemma":[0.00014924988,0.00055990554,0.00019494379,0.00025068613,0.00049889536,0.0017444867,0.0008748229,0.00045905443,0.00005678788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013833515,0.0012847622,0.0011570284,0.001721982,0.00046732894,0.00007216096,0.1221154,0.0024180047,0.023500899,0.10973694,0.00042523525,0.7369619],"study_design_scores_gemma":[0.00034937885,0.00012858803,0.00019341052,0.000578453,0.000018671804,0.000015936754,5.340703e-7,0.91884726,0.0007925486,0.07664894,0.0017874899,0.00063876295],"about_ca_topic_score_codex":0.00004308521,"about_ca_topic_score_gemma":0.000066229004,"teacher_disagreement_score":0.9164293,"about_ca_system_score_codex":0.00031289062,"about_ca_system_score_gemma":0.0005252556,"threshold_uncertainty_score":0.9996852},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009901054,0.0004988389,0.9923654,0.0031509814,0.0012220859,0.0008391665,0.000018523519,0.00032084872,0.00059402594],"genre_scores_gemma":[0.2928356,0.000053680185,0.7053972,0.0011009317,0.00027296037,0.0000352939,0.00000850521,0.000030629784,0.00026525365],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972132,0.0000474015,0.0003961503,0.0010788321,0.0005828118,0.0006816433],"domain_scores_gemma":[0.99592745,0.000825085,0.00032774013,0.0023172318,0.00043810936,0.00016439095],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017080075,0.00047228753,0.00054229074,0.00075113657,0.001169127,0.0015317108,0.00511397,0.0004060733,0.0000012278251],"category_scores_gemma":[0.0005307832,0.00045933775,0.00006681441,0.00031658742,0.00075014425,0.0008242067,0.0031032318,0.0009056973,0.000008329142],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011808067,0.000018736895,0.000094369454,0.000056235385,0.000012411869,0.000020054335,0.0020688693,0.010867046,0.00024488574,0.014047748,0.00023739178,0.97232044],"study_design_scores_gemma":[0.0006696957,0.00070283166,0.00066305726,0.0009256117,0.000019326808,0.00010960836,0.0000020016998,0.43905038,0.0037460548,0.54006433,0.01271716,0.0013299446],"about_ca_topic_score_codex":0.000046954483,"about_ca_topic_score_gemma":0.00071640685,"teacher_disagreement_score":0.9709905,"about_ca_system_score_codex":0.00023400925,"about_ca_system_score_gemma":0.00040598665,"threshold_uncertainty_score":0.99978584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10683706,0.015371775,0.47961685,0.35259065,0.014113109,0.01111067,0.0002358738,0.0007793084,0.019344712],"genre_scores_gemma":[0.9949111,0.00037799616,0.00079968345,0.0025660787,0.00043095188,0.000018972583,8.9702746e-7,0.000025681362,0.00086866214],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99764305,0.00017082543,0.00030637413,0.00053681526,0.000819414,0.00052354165],"domain_scores_gemma":[0.99698335,0.0015140023,0.00041616283,0.00091123866,0.0001421917,0.000033070413],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0020400065,0.00024057749,0.00029210758,0.00011742654,0.002441094,0.0008727024,0.003381431,0.00049307547,0.000007082525],"category_scores_gemma":[0.0005893228,0.00012956755,0.00007446693,0.00029120862,0.0069784047,0.00028680515,0.00054553436,0.000916972,0.0000010962291],"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.000030752788,0.00005164643,0.016851895,0.000028492092,0.000040029332,0.000010500774,0.0963867,0.00070016476,0.00000881603,0.11624623,0.00611558,0.7635292],"study_design_scores_gemma":[0.0006648779,0.0001805254,0.01703631,0.0005223219,0.00004271161,0.000024928831,0.00011138076,0.008460405,0.00005740266,0.14067838,0.8312744,0.00094639865],"about_ca_topic_score_codex":0.0017913454,"about_ca_topic_score_gemma":0.06939074,"teacher_disagreement_score":0.88807404,"about_ca_system_score_codex":0.000106663916,"about_ca_system_score_gemma":0.0004179946,"threshold_uncertainty_score":0.9988576},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002419104,0.00013063951,0.9812869,0.00015649457,0.0005315101,0.0005393135,0.000014371091,0.00011042016,0.017206194],"genre_scores_gemma":[0.053376067,0.00048435494,0.9318122,0.00045658348,0.00013874845,0.00014739884,0.0000220248,0.00008548845,0.0134771075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971383,0.000029255598,0.00041155244,0.0010337905,0.0008574436,0.00052963867],"domain_scores_gemma":[0.99741596,0.00028143704,0.00037007613,0.0013143542,0.0004287024,0.00018948628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059598184,0.00036561087,0.00050252967,0.0008032279,0.0006009459,0.0006185848,0.0025442343,0.0001520564,0.000079157515],"category_scores_gemma":[0.000056882105,0.0003171654,0.00008474446,0.00062315876,0.0016288102,0.0010748637,0.00063718384,0.0005112812,0.000024777662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015098685,0.00013367695,0.000042452124,0.00009217574,0.00005705291,0.000054377684,0.0015848996,0.65583,0.00075748254,0.015614801,0.0007159993,0.32510197],"study_design_scores_gemma":[0.0011484356,0.0012618869,0.000017716136,0.0016142362,0.000019856034,0.00012849754,9.586649e-7,0.9354051,0.0071508666,0.046910446,0.004959199,0.0013828179],"about_ca_topic_score_codex":0.000032391024,"about_ca_topic_score_gemma":0.00002789382,"teacher_disagreement_score":0.32371914,"about_ca_system_score_codex":0.0001238696,"about_ca_system_score_gemma":0.00073455164,"threshold_uncertainty_score":0.99992806},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016888143,0.00048135198,0.99229026,0.00056447845,0.0016946851,0.0004277385,0.000012780133,0.00016975998,0.00267012],"genre_scores_gemma":[0.92151016,0.000048465252,0.07679947,0.00014767652,0.00029978942,0.000011769506,0.0000182506,0.000034497178,0.0011298966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958622,0.00017692999,0.0008908496,0.0014113936,0.0010678109,0.00059080456],"domain_scores_gemma":[0.99711865,0.00040069877,0.0006379822,0.0014456379,0.0002545257,0.00014252665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002353422,0.00045011815,0.0007116081,0.00079806265,0.00046793776,0.0005234073,0.0029396485,0.00037847206,0.000006728925],"category_scores_gemma":[0.00032013236,0.00042815667,0.00013404344,0.00033498657,0.00054725294,0.00084037846,0.0007442115,0.0011069647,0.000010024983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003341288,0.00023733721,0.015974576,0.00048125786,0.000050769577,0.000102992424,0.02045222,0.07799229,0.024668926,0.019476963,0.00022298696,0.8403063],"study_design_scores_gemma":[0.0011257133,0.00041925424,0.0039660283,0.003165851,0.0000090564945,0.00006657865,0.0000037148377,0.9564043,0.004615668,0.02557051,0.0034982893,0.0011550199],"about_ca_topic_score_codex":0.0009057189,"about_ca_topic_score_gemma":0.00019633229,"teacher_disagreement_score":0.9198214,"about_ca_system_score_codex":0.00037295616,"about_ca_system_score_gemma":0.0006116523,"threshold_uncertainty_score":0.999817},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053770225,0.0005793973,0.96924704,0.018275063,0.003115446,0.00059767865,0.00001946128,0.0010959426,0.007016196],"genre_scores_gemma":[0.031537596,0.00012913063,0.96516144,0.0012221244,0.0006220924,0.000024840274,0.000010402704,0.00007564862,0.0012167438],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928273,0.00005225213,0.0007708377,0.003251818,0.0016433625,0.0014544466],"domain_scores_gemma":[0.9689594,0.00070987083,0.0008515894,0.028908754,0.00032106534,0.00024931112],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0018838171,0.0009563042,0.0009522412,0.001391475,0.00080574246,0.0016520944,0.12485167,0.0008923773,0.00004608298],"category_scores_gemma":[0.013344922,0.0008963178,0.00020932892,0.00048138155,0.0020904373,0.0010170101,0.19876969,0.0020333154,0.00022275613],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074736718,0.00005335441,0.000076260236,0.00008100388,0.000036834826,0.00059912796,0.00026115996,0.0017384493,0.00023601283,0.016425457,0.0069773425,0.9735075],"study_design_scores_gemma":[0.00025158064,0.00010513277,0.000053362874,0.00041914597,0.000007321849,0.00009801443,4.149819e-8,0.3178983,0.001608756,0.66962785,0.009142848,0.000787658],"about_ca_topic_score_codex":0.00005907688,"about_ca_topic_score_gemma":0.00007461087,"teacher_disagreement_score":0.97271985,"about_ca_system_score_codex":0.00064026454,"about_ca_system_score_gemma":0.0011694127,"threshold_uncertainty_score":0.9993843},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029803364,0.00012910803,0.9876043,0.0007317137,0.002420897,0.0006763498,0.000014982821,0.00033209057,0.0077924835],"genre_scores_gemma":[0.97962826,0.000015580885,0.017778473,0.0004941477,0.00086007337,0.0000391891,0.000018291696,0.00005116059,0.0011148427],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952984,0.000091730435,0.00055272976,0.0021111981,0.0012532974,0.0006926454],"domain_scores_gemma":[0.99468875,0.00052253937,0.00087824906,0.0027759294,0.00089348096,0.0002410453],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012542328,0.00066886673,0.0007365172,0.0010165396,0.0009863564,0.0016212774,0.0042413566,0.00051004044,0.000052968993],"category_scores_gemma":[0.00019124745,0.0006949713,0.00019341405,0.00034495932,0.0007626991,0.002272148,0.0014459899,0.0010880285,0.00037964838],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038901585,0.00004326537,0.00004508246,0.00007373742,0.000015795382,0.00005473739,0.0003122082,0.0002378181,0.00027222544,0.00064372085,0.00003739068,0.99826014],"study_design_scores_gemma":[0.002236641,0.0009218993,0.0038057673,0.0074799336,0.0000765549,0.0007677738,9.460124e-7,0.38433856,0.018417468,0.5678695,0.008068208,0.006016786],"about_ca_topic_score_codex":0.00022094979,"about_ca_topic_score_gemma":0.00092404505,"teacher_disagreement_score":0.99224335,"about_ca_system_score_codex":0.00058812095,"about_ca_system_score_gemma":0.00085078384,"threshold_uncertainty_score":0.99955016},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008262105,0.0009909951,0.9791413,0.0014678105,0.0030104453,0.00042585807,0.000006472256,0.00044852367,0.014425954],"genre_scores_gemma":[0.13527094,0.000094800984,0.85654634,0.001969632,0.001974734,0.000009784638,0.000022299566,0.00009835916,0.0040130964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942581,0.00005728295,0.00060368114,0.002705379,0.0014763967,0.0008991721],"domain_scores_gemma":[0.99117786,0.0004293156,0.00060057425,0.0073578134,0.00018693498,0.00024752313],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001989015,0.00066138257,0.0006493904,0.0007238099,0.0009160306,0.0015861958,0.016543057,0.00027668252,0.000009998335],"category_scores_gemma":[0.00016933565,0.0005901766,0.0001568449,0.00021299644,0.00060797494,0.00024092541,0.01552062,0.00096338807,0.000073605064],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030949861,0.000058843038,0.00005049849,0.000092750415,0.00006151125,0.00029000425,0.0009614839,0.027057368,0.0000078112425,0.01349046,0.00023508149,0.9576911],"study_design_scores_gemma":[0.0002721922,0.000111154455,0.00009911507,0.00058578834,0.000024102997,0.000068483314,2.720575e-7,0.92904365,0.000029566118,0.027486302,0.04150295,0.00077641907],"about_ca_topic_score_codex":0.00004243488,"about_ca_topic_score_gemma":0.000092014794,"teacher_disagreement_score":0.95691466,"about_ca_system_score_codex":0.0003292138,"about_ca_system_score_gemma":0.0005651421,"threshold_uncertainty_score":0.99965495},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50817025,0.000105674946,0.490998,0.000059782466,0.0005134409,0.000102517704,0.000009283088,0.000009362899,0.000031733605],"genre_scores_gemma":[0.9077176,0.000016200118,0.09145689,0.00036970183,0.00040115925,0.000002557578,0.00002703049,0.000007794881,0.0000010736334],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99800646,0.000087553846,0.00033276537,0.00090084015,0.0002764662,0.00039593343],"domain_scores_gemma":[0.9987834,0.00004814294,0.00022072809,0.00065081945,0.00022226163,0.000074626725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067731686,0.00024513717,0.00031080795,0.000103187456,0.00007902258,0.00007252491,0.0011533593,0.00024453184,0.000004344236],"category_scores_gemma":[0.00019639794,0.00019536426,0.00010859648,0.00029396298,0.0012979517,0.000003359833,0.0028861505,0.00031680046,0.00000269483],"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.00011313816,0.0002618037,0.035284214,0.0002176309,0.000048305894,0.000015527763,0.00027066594,0.077851534,0.63639206,0.000057242527,0.00006508667,0.24942282],"study_design_scores_gemma":[0.00034589536,0.0008805273,0.036075562,0.00022992496,0.000008277117,0.000015129144,5.265542e-7,0.12502266,0.8042511,0.032301966,0.00019795363,0.0006704876],"about_ca_topic_score_codex":0.00005326939,"about_ca_topic_score_gemma":0.00005214055,"teacher_disagreement_score":0.39954737,"about_ca_system_score_codex":0.00003044816,"about_ca_system_score_gemma":0.00024900268,"threshold_uncertainty_score":0.79667234},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004124948,0.0001958862,0.9864861,0.0004975021,0.0071017747,0.00055009354,0.000004938658,0.00034861354,0.0047738496],"genre_scores_gemma":[0.08378573,0.000009328569,0.9120802,0.0006444827,0.0032231559,0.000006803008,0.0000059032777,0.00008167773,0.00016271076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99396753,0.00011927197,0.0007886986,0.0022661372,0.0015776058,0.0012807358],"domain_scores_gemma":[0.9947306,0.00087025255,0.0011610496,0.0025978715,0.00034266643,0.00029756132],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020465308,0.00087999465,0.0009791714,0.00065176724,0.0017447073,0.0013815484,0.0069186194,0.00060843653,0.000022603315],"category_scores_gemma":[0.00080846564,0.000883498,0.00022372497,0.00039714368,0.001280227,0.0016707649,0.005092576,0.0021285359,0.000029873287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015346475,0.0000111916725,0.0002818656,0.00003170711,0.000025000301,0.00018005677,0.0004568562,0.8569111,0.000024623007,0.014221465,0.000018165249,0.12782261],"study_design_scores_gemma":[0.00046976167,0.00012858261,0.00011395051,0.00091181404,0.000023163666,0.00009531625,8.607613e-8,0.890058,0.000045979043,0.1066772,0.0006853294,0.000790823],"about_ca_topic_score_codex":0.000060272934,"about_ca_topic_score_gemma":0.00003995952,"teacher_disagreement_score":0.12703179,"about_ca_system_score_codex":0.0006806352,"about_ca_system_score_gemma":0.0013734498,"threshold_uncertainty_score":0.9996551},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067137805,0.00023142427,0.99476045,0.00011060038,0.0010559228,0.0011101741,0.00005304266,0.0001582492,0.0018487321],"genre_scores_gemma":[0.95325524,0.0000655843,0.045732897,0.00025967427,0.000239066,0.000041522013,0.000031260468,0.00008180966,0.00029294533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777615,0.000009004392,0.00042083973,0.0007379937,0.00040912948,0.0006468537],"domain_scores_gemma":[0.9985356,0.00019951821,0.00018141154,0.00071651075,0.00019409561,0.00017289154],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030792083,0.00052755873,0.0006241232,0.0002476156,0.00029573956,0.00027477692,0.0008322007,0.00031594528,0.00005884517],"category_scores_gemma":[0.000038268485,0.00043391698,0.00012969621,0.000056374734,0.00042481505,0.00026260942,0.000029410128,0.00041210785,0.000012019783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001168426,0.000015891035,0.000020373755,0.0002045391,0.0000983818,0.00007299337,0.00035178586,0.69472414,0.0019025857,0.0037835022,0.00002953528,0.2986794],"study_design_scores_gemma":[0.0013321295,0.00025116713,0.000029068298,0.0008907692,0.000052706262,0.000106073836,4.3300713e-7,0.9633983,0.016020883,0.015418706,0.001600896,0.0008989147],"about_ca_topic_score_codex":0.00001707923,"about_ca_topic_score_gemma":0.00012030661,"teacher_disagreement_score":0.95258385,"about_ca_system_score_codex":0.00021896807,"about_ca_system_score_gemma":0.00016391819,"threshold_uncertainty_score":0.9998113},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000066153996,0.00014523517,0.994228,0.0003076124,0.0018912393,0.0004307858,0.000012441707,0.00019102886,0.0027275025],"genre_scores_gemma":[0.024076259,0.00007417719,0.9735982,0.0014320548,0.00043794003,0.000010744534,0.000049303624,0.00004816765,0.00027316544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963003,0.00008012759,0.0005138869,0.0015884606,0.0009394599,0.00057776034],"domain_scores_gemma":[0.9970377,0.0003209796,0.0005897023,0.0014544723,0.0004211134,0.000176047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010381775,0.0005302122,0.0005325166,0.0008404408,0.0006682264,0.0010244919,0.0024404603,0.00047096302,0.000048810874],"category_scores_gemma":[0.00021822403,0.0004927746,0.00015278796,0.00029997533,0.00032720546,0.0013998826,0.001011829,0.000640523,0.000091507995],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007745748,0.000022894272,0.000015270336,0.00003981034,0.000009888447,0.000054692344,0.00044437457,0.058511343,0.00096425624,0.00026316685,0.000051735813,0.93961483],"study_design_scores_gemma":[0.00026003525,0.00007652948,0.000016933383,0.0009429101,0.000014709491,0.00009179008,2.3228573e-7,0.8806906,0.00924137,0.107171446,0.0008748451,0.0006186405],"about_ca_topic_score_codex":0.00005814927,"about_ca_topic_score_gemma":0.00004726791,"teacher_disagreement_score":0.9389962,"about_ca_system_score_codex":0.00027269503,"about_ca_system_score_gemma":0.00040972792,"threshold_uncertainty_score":0.9997524},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003253876,0.0001246161,0.98636925,0.000062532614,0.004365381,0.00033676845,0.000019822686,0.00014057473,0.008255672],"genre_scores_gemma":[0.91980755,0.00006211834,0.07537779,0.0004088004,0.0030900864,0.000039698636,0.000026168553,0.00015025554,0.0010375058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818176,0.000005340207,0.00025667434,0.0005548491,0.00043845855,0.0005629348],"domain_scores_gemma":[0.9991884,0.00010454626,0.0000975163,0.000474554,0.000039108894,0.000095833755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017940796,0.00035755464,0.0002914358,0.00010004209,0.0002134217,0.00024188186,0.00060853676,0.00021086393,0.00001256094],"category_scores_gemma":[0.000025653888,0.00033296127,0.00010344012,0.0000415628,0.00015493015,0.00021765352,0.00011496683,0.00039284644,0.000005817581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014183061,0.000014325006,0.00014588718,0.00015859763,0.00002583755,0.000028562137,0.0005210573,0.24275304,0.00093964144,0.0006621113,0.00021010755,0.7545266],"study_design_scores_gemma":[0.00028892182,0.00019677106,0.00027130998,0.0003376624,0.00002055151,0.000053970685,1.4993248e-7,0.97080237,0.0041235853,0.007113008,0.016167752,0.00062395266],"about_ca_topic_score_codex":0.000012693087,"about_ca_topic_score_gemma":0.00013875472,"teacher_disagreement_score":0.9194822,"about_ca_system_score_codex":0.00028287419,"about_ca_system_score_gemma":0.000055474684,"threshold_uncertainty_score":0.99991226},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001360952,0.00012557744,0.992781,0.0014288321,0.0018849396,0.0011201861,0.00003245341,0.00024478568,0.0022461633],"genre_scores_gemma":[0.7922132,0.0000034695363,0.19407047,0.012715999,0.00070213724,0.00004209456,0.000051688774,0.000064926644,0.00013599794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99535334,0.000034230216,0.0006026213,0.0019613889,0.0011857772,0.00086261745],"domain_scores_gemma":[0.99420583,0.0019773832,0.00064007856,0.002510524,0.00041257517,0.0002535898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007616279,0.000789735,0.00071700383,0.0010396137,0.000871954,0.001001705,0.0049332045,0.00048068812,0.000017131028],"category_scores_gemma":[0.00007364887,0.00068621483,0.0003119626,0.0002623255,0.00038518693,0.0006774706,0.00055591407,0.0007453659,0.000033290584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058240577,0.000039730505,0.000037441274,0.00009686492,0.000010764442,0.000025606312,0.00041763377,0.722151,0.00003955472,0.005434513,0.000008863273,0.27167982],"study_design_scores_gemma":[0.0011713115,0.00051236345,0.00010367362,0.00075127545,0.000016943466,0.0000046139116,1.912462e-7,0.9531624,0.0014568854,0.03525599,0.006811482,0.00075287337],"about_ca_topic_score_codex":0.000044462224,"about_ca_topic_score_gemma":0.00054751866,"teacher_disagreement_score":0.79871047,"about_ca_system_score_codex":0.00023975891,"about_ca_system_score_gemma":0.0007374916,"threshold_uncertainty_score":0.9995589},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029457603,0.00020326703,0.96808636,0.0004178121,0.000637872,0.0005380048,0.00019210245,0.00002212234,0.00044484073],"genre_scores_gemma":[0.99241114,0.000013106193,0.006849198,0.00030005557,0.00007618755,0.000004113452,0.000015144722,0.00001590258,0.00031513808],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974879,0.000036421276,0.0005489398,0.0010011435,0.00064989313,0.00027567093],"domain_scores_gemma":[0.9971164,0.0012465835,0.00082295213,0.0006023666,0.00013920071,0.000072489835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005915952,0.0003002563,0.0007810666,0.00083822577,0.00021402778,0.0001995063,0.0011652993,0.00016864677,0.000019679617],"category_scores_gemma":[0.00022914834,0.00027245373,0.00020556514,0.00023029628,0.0012110159,0.000278112,0.0002831566,0.00023452629,0.0000010252302],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019108436,0.00022248308,0.003003911,0.00037424846,0.00024265268,0.000008361767,0.0072559407,0.052837834,0.582867,0.0034417945,0.00035223184,0.3492024],"study_design_scores_gemma":[0.00032853062,0.00033909746,0.0015686607,0.00022754198,0.00012978046,0.000006029801,0.0000014097402,0.7229405,0.2710116,0.0027926487,0.00034161692,0.00031261877],"about_ca_topic_score_codex":0.000032235428,"about_ca_topic_score_gemma":0.000062351435,"teacher_disagreement_score":0.96295357,"about_ca_system_score_codex":0.00007673505,"about_ca_system_score_gemma":0.00011409084,"threshold_uncertainty_score":0.99997276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041473028,0.0017320083,0.9925858,0.0014169659,0.0021626283,0.0013603963,0.00007930237,0.00015079242,0.00047063298],"genre_scores_gemma":[0.11653953,0.00025720338,0.8769991,0.0036175076,0.0014534035,0.00010951701,0.00008290734,0.00010498391,0.0008358711],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99498904,0.00006554039,0.0007378582,0.0020993215,0.0010796454,0.0010285764],"domain_scores_gemma":[0.9957258,0.0006596013,0.0005705172,0.002205407,0.00041178116,0.00042686987],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012382595,0.0007187794,0.0007040694,0.00064966734,0.0010615089,0.0014814303,0.004615368,0.00038561918,0.000024708539],"category_scores_gemma":[0.0001773934,0.00068800687,0.00028513386,0.00031989912,0.000849983,0.00079618156,0.0011932657,0.0006132199,0.000012514645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007324365,0.00020543877,0.000032537715,0.00011859826,0.00011419221,0.00010073178,0.013059193,0.018919347,0.00081074156,0.15611438,0.027630892,0.7828207],"study_design_scores_gemma":[0.0011688832,0.0005546028,0.000017505901,0.00022808352,0.000024540566,0.00003944177,9.71737e-7,0.37114647,0.0050778985,0.599175,0.021332106,0.0012344988],"about_ca_topic_score_codex":0.00019678268,"about_ca_topic_score_gemma":0.00032731175,"teacher_disagreement_score":0.7815862,"about_ca_system_score_codex":0.00024907888,"about_ca_system_score_gemma":0.0012931885,"threshold_uncertainty_score":0.99955714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006005596,0.00026299694,0.997721,0.00011451738,0.00026140024,0.00050219457,0.0000040685454,0.00016257915,0.0003706903],"genre_scores_gemma":[0.12309881,0.000011922117,0.87604123,0.00023998988,0.00047770134,0.000023742574,0.000006939282,0.000044896115,0.000054739663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965566,0.000014851824,0.00043609354,0.001427377,0.0008681946,0.0006969203],"domain_scores_gemma":[0.99769366,0.00009635418,0.0003350153,0.0010754466,0.00059694913,0.00020257026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038036334,0.0004906918,0.00036914795,0.0006442145,0.0007489438,0.00067840033,0.0020615235,0.00021496009,0.000004383537],"category_scores_gemma":[0.000019848216,0.000436912,0.000053076576,0.00178966,0.0010048031,0.000517026,0.00062587037,0.00055549963,0.0000047458516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007174622,0.000074604424,0.00026745582,0.00023284779,0.00003031347,0.00022433136,0.0031218114,0.06765341,0.00023042737,0.009769336,0.000013560077,0.9183747],"study_design_scores_gemma":[0.00015279064,0.0001680251,0.0002974259,0.00073765864,0.000018189428,0.00030029553,7.4256167e-7,0.9734402,0.00016181075,0.023392914,0.0007052892,0.0006247176],"about_ca_topic_score_codex":0.00009998265,"about_ca_topic_score_gemma":0.0001524042,"teacher_disagreement_score":0.91775,"about_ca_system_score_codex":0.00026146777,"about_ca_system_score_gemma":0.0012238149,"threshold_uncertainty_score":0.99980825},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025684602,0.0001026733,0.9937547,0.00022958947,0.0005064653,0.002032131,0.000005577169,0.000403657,0.0027083529],"genre_scores_gemma":[0.6492652,0.000054024273,0.34720585,0.0012455266,0.00050000224,0.0008266396,0.0000042852416,0.00007784157,0.0008205713],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957261,0.000060160015,0.00057071244,0.0021006938,0.00096060074,0.00058169593],"domain_scores_gemma":[0.9954761,0.00050273543,0.00038082595,0.0033028503,0.00017680247,0.00016065157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009559753,0.0005283896,0.00057084125,0.0012899506,0.0004343637,0.00055967737,0.0047961613,0.00030790828,0.000008221125],"category_scores_gemma":[0.00011251013,0.0005029537,0.0000995554,0.000517776,0.00059732166,0.00067115924,0.0016231717,0.0012334116,0.000059974736],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012277273,0.0003197419,0.0007404534,0.000021690963,0.0000072381404,0.00021849805,0.0011394179,0.009619964,0.00013131168,0.0018377098,0.000029317413,0.9859224],"study_design_scores_gemma":[0.0027525572,0.0077088336,0.01404443,0.0014880121,0.00003160371,0.0003677293,0.0000049634045,0.12209095,0.0141440155,0.75475764,0.07686342,0.0057458086],"about_ca_topic_score_codex":0.000026465823,"about_ca_topic_score_gemma":0.00026193474,"teacher_disagreement_score":0.98017657,"about_ca_system_score_codex":0.00049878797,"about_ca_system_score_gemma":0.0003156295,"threshold_uncertainty_score":0.9997422},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023994729,0.00036485976,0.9966095,0.00008389083,0.0018725729,0.000556765,0.000010758245,0.00022797732,0.000033727134],"genre_scores_gemma":[0.1250547,0.000053437412,0.87445444,0.00008548745,0.00023140924,0.000034247987,0.000009369378,0.00003125823,0.000045650977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972798,0.00005351878,0.00046052752,0.0011081486,0.0006033431,0.0004946512],"domain_scores_gemma":[0.99666333,0.00058795634,0.0004436359,0.0016961923,0.000494437,0.00011442148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012266889,0.0004305027,0.00060243433,0.00041943567,0.00024527032,0.00021678096,0.0026461596,0.00030117616,0.0000019424695],"category_scores_gemma":[0.00035366372,0.00041523547,0.00013028797,0.00011653074,0.0005425459,0.0016407615,0.0007397263,0.00036270774,0.0000024743038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015403746,0.00003346829,0.0000060093776,0.000059977574,0.00001112593,0.000007844028,0.0019734125,0.71882474,0.0029635662,0.023082182,0.0000048875067,0.2530174],"study_design_scores_gemma":[0.00031770076,0.00036083465,0.00003132537,0.00024290448,0.000009140438,0.00001203177,0.0000016186773,0.70672125,0.006299326,0.2852489,0.00022222314,0.00053273054],"about_ca_topic_score_codex":0.0000043828595,"about_ca_topic_score_gemma":0.000007100244,"teacher_disagreement_score":0.2621667,"about_ca_system_score_codex":0.00032383387,"about_ca_system_score_gemma":0.00028371013,"threshold_uncertainty_score":0.99982995},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021400295,0.00010530089,0.99715483,0.00049643364,0.00057271455,0.00096470735,0.000015573927,0.0001175389,0.00035892185],"genre_scores_gemma":[0.06872366,0.000016008633,0.93036026,0.00038266034,0.00020533787,0.000036964208,0.000014343168,0.000027553197,0.00023319272],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690217,0.00004819991,0.0007781601,0.001227604,0.0005964744,0.00044738073],"domain_scores_gemma":[0.99693555,0.00080990145,0.00038900002,0.0014668157,0.00029834232,0.000100385885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027273064,0.00036197322,0.0005885985,0.0007709533,0.000070998394,0.00015316562,0.0029364778,0.0002954088,0.000024222945],"category_scores_gemma":[0.00022018726,0.00031622892,0.0001215682,0.0005403079,0.00055792485,0.00051152514,0.000835675,0.00032283086,0.0000067873157],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030316774,0.00008140757,0.00008744177,0.0002083941,0.00001251969,0.000015126129,0.0026624245,0.0027815616,0.005361941,0.072572805,0.00016441164,0.91602165],"study_design_scores_gemma":[0.000295106,0.00025373726,0.00012069442,0.00034860903,0.0000027926856,0.000014112585,2.4364422e-7,0.3630483,0.019384436,0.61572486,0.0005034215,0.0003037212],"about_ca_topic_score_codex":0.00012033732,"about_ca_topic_score_gemma":0.00014133357,"teacher_disagreement_score":0.91571796,"about_ca_system_score_codex":0.0002574235,"about_ca_system_score_gemma":0.00068061467,"threshold_uncertainty_score":0.99992895},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050860435,0.000109646215,0.9886717,0.0005369698,0.0011671693,0.00066358934,0.000008177876,0.0011823212,0.007609554],"genre_scores_gemma":[0.6053386,0.000009779583,0.39308503,0.0011301724,0.00021238506,0.000027429722,0.0000023935695,0.00004540511,0.00014881919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951242,0.000058246107,0.000607629,0.0020448712,0.0013638046,0.0008012211],"domain_scores_gemma":[0.9947844,0.000679169,0.0006430464,0.003354086,0.00030741285,0.00023184942],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009914106,0.0007727118,0.0007612033,0.0011365168,0.0007078332,0.0009889317,0.0053828876,0.00045326332,0.000021448363],"category_scores_gemma":[0.00033328048,0.0007419276,0.0002238902,0.0002800187,0.0008131865,0.0011505325,0.0012773625,0.0012774789,0.000046620204],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077602845,0.000047386635,0.000008416872,0.00007430667,0.000008421141,0.00010715674,0.0002927785,0.03293166,0.00018859238,0.010811364,0.00001875221,0.9555034],"study_design_scores_gemma":[0.0002505315,0.00024228901,0.00003541249,0.00075013784,0.0000052524647,0.000034486126,5.6053757e-8,0.7335278,0.010601285,0.25338304,0.0005148619,0.0006549096],"about_ca_topic_score_codex":0.000020762254,"about_ca_topic_score_gemma":0.000076158925,"teacher_disagreement_score":0.95484847,"about_ca_system_score_codex":0.00056150364,"about_ca_system_score_gemma":0.00055655115,"threshold_uncertainty_score":0.99999845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002980449,0.00013151085,0.99072194,0.00002003682,0.00076290173,0.00017182095,0.0000072256494,0.00024165958,0.004962438],"genre_scores_gemma":[0.915685,0.000031776206,0.08266776,0.00020903302,0.00055305066,0.0000031825186,0.000004061726,0.00007351159,0.00077265536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825317,0.00000522871,0.00026114078,0.00063212303,0.00038145107,0.00046689092],"domain_scores_gemma":[0.99901366,0.00017901327,0.000099613964,0.000529468,0.000057179448,0.00012103795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015710127,0.0004034061,0.00038355886,0.00021171974,0.00026709042,0.00014495965,0.0010364316,0.0002111849,0.00002000999],"category_scores_gemma":[0.00005764442,0.00039153904,0.00007464303,0.00004174833,0.0002883409,0.00024865818,0.0004086122,0.00075415644,0.00006760329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031567433,0.000002528013,0.0000014449339,0.000026002623,0.00000416729,0.000045819233,0.00006529736,0.90122664,0.0098961685,0.0000746054,0.0000032993876,0.088650875],"study_design_scores_gemma":[0.00012192088,0.000027219381,0.00001067175,0.0002297715,0.0000071094814,0.000030762272,1.3326203e-8,0.9530726,0.023385234,0.022624262,0.00006836275,0.00042206558],"about_ca_topic_score_codex":0.0000011363556,"about_ca_topic_score_gemma":0.000018632254,"teacher_disagreement_score":0.9127045,"about_ca_system_score_codex":0.00017024932,"about_ca_system_score_gemma":0.00008395217,"threshold_uncertainty_score":0.9998537},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010237187,0.00019116972,0.98641276,0.00008838641,0.00057376554,0.00043950547,0.0000025248669,0.0000639402,0.0019907835],"genre_scores_gemma":[0.93120724,0.000004200995,0.0685117,0.00007151878,0.00010656824,0.000008813924,0.000003888919,0.0000141409755,0.00007194078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970994,0.000086351596,0.00044218995,0.0013086993,0.00072530564,0.0003380501],"domain_scores_gemma":[0.99699044,0.00016781979,0.00047729514,0.0021580493,0.00011060246,0.00009580835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000962088,0.00032390983,0.00043394064,0.0007099799,0.00022065765,0.00034235054,0.0039281095,0.00015533055,0.000006121062],"category_scores_gemma":[0.00006991911,0.0003074333,0.00004317495,0.0002010284,0.0003391081,0.0009244419,0.0009013267,0.0006503634,0.000008087773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041016636,0.0013236785,0.0032775195,0.000038732454,0.000018476183,0.00018079953,0.029891023,0.07737489,0.0033735367,0.024952022,0.00000711601,0.8595212],"study_design_scores_gemma":[0.0007129009,0.0017846638,0.0057296846,0.00034619894,0.000004950546,0.000020357009,0.00001323757,0.9814195,0.0018541691,0.0073252814,0.00014655068,0.00064248743],"about_ca_topic_score_codex":0.00035347103,"about_ca_topic_score_gemma":0.00047470175,"teacher_disagreement_score":0.92097,"about_ca_system_score_codex":0.00018087217,"about_ca_system_score_gemma":0.00025585122,"threshold_uncertainty_score":0.9999378},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023896093,0.0019495101,0.9831608,0.0024215728,0.002748435,0.000659561,0.0000065205054,0.00016062851,0.0065033706],"genre_scores_gemma":[0.99280524,0.00019177573,0.005487378,0.0001403919,0.00026730864,0.000015871912,0.0000022021727,0.000021511358,0.0010682999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995917,0.00012752891,0.0004893855,0.0014890666,0.0012807263,0.00069626793],"domain_scores_gemma":[0.99688846,0.00071226596,0.00020245528,0.0016747798,0.00031299263,0.00020902848],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0034050923,0.00032601604,0.00044233727,0.00527913,0.00069447723,0.0013742445,0.0033428825,0.00027404196,0.000011406599],"category_scores_gemma":[0.0003821734,0.00031753007,0.00005953611,0.0018516954,0.0010283215,0.0007726555,0.0020146568,0.0012261663,0.00004046954],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047293915,0.00009211678,0.00081660866,0.00006951642,0.00001317184,0.00009588249,0.032030746,0.000140375,0.00009328089,0.054842234,0.000058216945,0.9117431],"study_design_scores_gemma":[0.00043872566,0.00021575615,0.0021878127,0.00073337404,0.0000044832286,0.00008115122,0.0000023506066,0.73399925,0.00022729325,0.24224894,0.019050878,0.0008099647],"about_ca_topic_score_codex":0.00020552844,"about_ca_topic_score_gemma":0.0012706125,"teacher_disagreement_score":0.99041563,"about_ca_system_score_codex":0.00030285935,"about_ca_system_score_gemma":0.0003901094,"threshold_uncertainty_score":0.9999277},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031697503,0.0011399031,0.9797042,0.0032038023,0.0066503845,0.00069274293,0.0000132765945,0.0005892239,0.0076894807],"genre_scores_gemma":[0.0588852,0.00017829453,0.9004458,0.030772401,0.0066632656,0.000046249763,0.0001400217,0.00027466583,0.0025940896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915953,0.00015502595,0.0010248687,0.0033090413,0.0020042458,0.0019115163],"domain_scores_gemma":[0.99161905,0.00095687615,0.0010783264,0.0049682865,0.00085525046,0.0005222266],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015723578,0.0012359155,0.0011917828,0.0014473388,0.0014196759,0.0020430249,0.013819137,0.00077707367,0.000021232752],"category_scores_gemma":[0.00008316439,0.0011099632,0.00029425253,0.0023118411,0.0006785002,0.0014917076,0.0065143085,0.002133417,0.00023422862],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018147148,0.00011531087,0.00016649025,0.0002882601,0.00005701206,0.00027426187,0.005792448,0.027274238,0.00010826678,0.004594527,0.00064050424,0.96067053],"study_design_scores_gemma":[0.0013583143,0.00027950015,0.00080965215,0.0041031945,0.000049226477,0.00025607322,0.0000036740512,0.8539808,0.0013218883,0.08121506,0.053739294,0.0028833274],"about_ca_topic_score_codex":0.00028921253,"about_ca_topic_score_gemma":0.0013737822,"teacher_disagreement_score":0.9577872,"about_ca_system_score_codex":0.00057892787,"about_ca_system_score_gemma":0.0029846847,"threshold_uncertainty_score":0.9998803},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021715324,0.00004811434,0.9717236,0.0009276622,0.007879737,0.00038785007,0.000049303384,0.00009866369,0.018667879],"genre_scores_gemma":[0.69207036,0.000010237868,0.26496094,0.0033829443,0.0013175209,0.00002372981,0.000035640784,0.00006755956,0.03813106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98654824,0.00009930559,0.00096613803,0.00369756,0.0077151717,0.0009735945],"domain_scores_gemma":[0.99090576,0.0029091234,0.0006920327,0.004282802,0.0008618154,0.00034847934],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.014066709,0.000499422,0.0006174889,0.00368672,0.0026513867,0.005933449,0.011750044,0.000179288,0.00021322127],"category_scores_gemma":[0.002325023,0.00039699912,0.0002080598,0.0030313476,0.005539833,0.0011193758,0.00089854404,0.0008935464,0.00074054516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056430385,0.00004680648,0.000016703427,0.000004411522,0.000003241538,0.00002305865,0.00023405947,0.37504628,0.000006313919,0.0005202846,0.0014815627,0.62261164],"study_design_scores_gemma":[0.0002744122,0.00013501698,0.0009999672,0.00023851452,0.000009073676,0.000026359556,0.000001184907,0.71736205,0.00012314747,0.26239875,0.017885128,0.0005463858],"about_ca_topic_score_codex":0.00002605375,"about_ca_topic_score_gemma":0.00007332966,"teacher_disagreement_score":0.7067627,"about_ca_system_score_codex":0.00078320596,"about_ca_system_score_gemma":0.003726865,"threshold_uncertainty_score":0.9998482},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008724852,0.0023351847,0.9926608,0.00010653345,0.0032518175,0.00091457774,0.000012467373,0.0003278091,0.00030351922],"genre_scores_gemma":[0.557057,0.0002842569,0.43864307,0.0010764883,0.0021401471,0.000100193,0.000120302626,0.00034689717,0.00023162091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693865,0.000020840485,0.00045254474,0.0010609457,0.0005437294,0.0009833009],"domain_scores_gemma":[0.9978406,0.0003308464,0.00018785083,0.0012975329,0.00014417667,0.00019901601],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007805163,0.0006976156,0.00061034405,0.00042500137,0.00041242212,0.00035360898,0.0012928584,0.0007044088,0.000010860495],"category_scores_gemma":[0.000066707864,0.00070889795,0.00024749822,0.00010524873,0.00032952166,0.00023431113,0.00026229466,0.0010985387,0.00001597218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015001725,0.000008435064,0.000002472502,0.000060679162,0.0000145034055,0.00003812934,0.00003890792,0.7629212,0.00010565059,0.000011963507,0.000040462015,0.23674256],"study_design_scores_gemma":[0.00066256785,0.0001533498,0.000034616423,0.0009890947,0.000028088249,0.000019530695,3.8857934e-8,0.989855,0.00011526144,0.00047281786,0.0069222185,0.0007474386],"about_ca_topic_score_codex":0.0000039903625,"about_ca_topic_score_gemma":0.00030691765,"teacher_disagreement_score":0.55696976,"about_ca_system_score_codex":0.0005734156,"about_ca_system_score_gemma":0.00012340519,"threshold_uncertainty_score":0.9995362},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003414947,0.000112154215,0.99469334,0.0011841339,0.0008016701,0.0020785271,0.000013478412,0.00043277984,0.00034240648],"genre_scores_gemma":[0.0109888585,0.000023132847,0.98712564,0.00070457114,0.0005831203,0.00021910865,0.000038459897,0.000049498183,0.00026760405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634576,0.000033421056,0.00060025504,0.001543874,0.00088262116,0.00059408264],"domain_scores_gemma":[0.9967357,0.0006434403,0.00062269584,0.0014886372,0.0003484733,0.0001610574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005217862,0.000524891,0.0005117229,0.00041405848,0.00044918864,0.00051178737,0.0020372816,0.00021048343,0.000026557318],"category_scores_gemma":[0.0000522692,0.0004530053,0.000112438225,0.0007049481,0.00061037944,0.0009183252,0.00038020045,0.00034419118,0.000048953094],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006205497,0.000027379954,0.000016146138,0.00012734247,0.00002327793,0.000007328895,0.00073595776,0.018791234,0.00024736332,0.008835666,0.00043052857,0.9707516],"study_design_scores_gemma":[0.0002602094,0.00034922734,0.00010238102,0.00031975866,0.000023126911,0.00002958722,3.2151735e-7,0.91025746,0.0010211571,0.08617377,0.00093797676,0.0005250167],"about_ca_topic_score_codex":0.0000032166324,"about_ca_topic_score_gemma":0.000032533964,"teacher_disagreement_score":0.9702265,"about_ca_system_score_codex":0.00038660344,"about_ca_system_score_gemma":0.000518299,"threshold_uncertainty_score":0.99979216},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006283116,0.00076991436,0.9913035,0.0012579713,0.002251326,0.0006010465,0.00000797806,0.00011040355,0.0036350463],"genre_scores_gemma":[0.08044286,0.00012703796,0.9132794,0.0028148359,0.0012840169,0.000040467723,0.000008204504,0.000060868275,0.0019423174],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965913,0.00001852638,0.0004026691,0.0014866913,0.00076842314,0.00073238305],"domain_scores_gemma":[0.9965434,0.00046369404,0.00031969175,0.002183754,0.00031419794,0.00017524773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063843664,0.0004797096,0.00053445494,0.0006690805,0.00057409075,0.0008174559,0.0042619286,0.00047738265,0.00003357175],"category_scores_gemma":[0.00012905028,0.00042740328,0.0002433839,0.00026771252,0.00076270837,0.0005304615,0.0011946119,0.0006772959,0.000025002768],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010653958,0.00005644092,0.00006230442,0.000062597486,0.00003966472,0.000045115827,0.0005184268,0.001983185,0.00009139405,0.037350442,0.0001233459,0.9596564],"study_design_scores_gemma":[0.0012637987,0.00060539506,0.0013409724,0.0008090019,0.00005282174,0.00007900984,1.02961884e-7,0.27179444,0.0040187663,0.68376327,0.0343227,0.0019497299],"about_ca_topic_score_codex":0.00004745609,"about_ca_topic_score_gemma":0.00014834563,"teacher_disagreement_score":0.9577067,"about_ca_system_score_codex":0.00008475734,"about_ca_system_score_gemma":0.0004924455,"threshold_uncertainty_score":0.9998178},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015062077,0.0006609323,0.99437976,0.0001788475,0.0012731185,0.0002966292,0.0000085905385,0.0001129553,0.0015829486],"genre_scores_gemma":[0.5417475,0.000017334649,0.4573795,0.00036816462,0.00034497044,0.000002856413,0.000001866075,0.00003953258,0.000098246484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957013,0.00007187515,0.0006249739,0.0014960632,0.0012592773,0.000846525],"domain_scores_gemma":[0.9955746,0.0006186086,0.0009795707,0.0021394186,0.00054827455,0.00013953693],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002600328,0.00059094053,0.0009042317,0.0007219253,0.00074796804,0.0010740212,0.004207583,0.0003372299,0.000010625465],"category_scores_gemma":[0.00017952554,0.0004828747,0.00014940117,0.00039663282,0.0010381697,0.0011330888,0.0013464815,0.00049725955,0.000006863692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054752643,0.00012243148,0.013766209,0.0005612023,0.00014817438,0.0005542746,0.0033081716,0.045568023,0.0035821283,0.011540158,0.00001402059,0.9207805],"study_design_scores_gemma":[0.0012630622,0.0004578613,0.002956948,0.0043858155,0.000052489686,0.00033630332,8.6058685e-7,0.919466,0.019844025,0.04624845,0.0030458604,0.0019422993],"about_ca_topic_score_codex":0.00011940635,"about_ca_topic_score_gemma":0.0006155192,"teacher_disagreement_score":0.91883814,"about_ca_system_score_codex":0.00013907456,"about_ca_system_score_gemma":0.00089571945,"threshold_uncertainty_score":0.999963},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030071317,0.000016206148,0.9946669,0.00020693442,0.0013811671,0.00054088153,0.000008775439,0.00021887591,0.0026595949],"genre_scores_gemma":[0.08899748,0.000003987091,0.90804523,0.0015039691,0.0010418746,0.000037468028,0.000119442004,0.000023568298,0.00022699637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977776,0.000016470605,0.0005723129,0.00064807595,0.0005789118,0.00040665086],"domain_scores_gemma":[0.9982389,0.00017105512,0.00045506802,0.0005919549,0.0004435113,0.00009946666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000724051,0.00032904025,0.00028532295,0.0008698984,0.0005432797,0.00089236256,0.001152644,0.00023122359,0.000057362016],"category_scores_gemma":[0.00008501409,0.00032569433,0.00010102528,0.00027464837,0.0002625508,0.0030318317,0.0003563014,0.0003167481,0.00014311922],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040767536,0.000014904239,0.0000066194098,0.00006381754,0.0000063173516,0.0000033155236,0.0012614619,0.0025611992,0.0000691893,0.008816766,0.00016568093,0.98702663],"study_design_scores_gemma":[0.000317435,0.00025453334,0.000027606047,0.00032979954,0.000007097192,0.000025316953,4.500624e-7,0.74848163,0.0014827661,0.24447072,0.0041381354,0.00046450776],"about_ca_topic_score_codex":0.0000103776665,"about_ca_topic_score_gemma":0.000025476413,"teacher_disagreement_score":0.98656213,"about_ca_system_score_codex":0.00021376775,"about_ca_system_score_gemma":0.00022121999,"threshold_uncertainty_score":0.99991953},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009722569,0.0006690096,0.98734933,0.0017012032,0.0023768968,0.00029696967,0.0000053198814,0.000084458654,0.006544547],"genre_scores_gemma":[0.59474576,0.0000615655,0.40125763,0.0013110766,0.0011806582,0.000016078107,0.000013237628,0.00003076848,0.0013832132],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962422,0.000045165798,0.0005474618,0.0014509701,0.0010543754,0.00065980764],"domain_scores_gemma":[0.9977384,0.00040845174,0.00035260513,0.0011589515,0.00016357434,0.0001779674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011366605,0.0004643354,0.0005015685,0.0013356195,0.00047135714,0.0009388182,0.003502341,0.00027500105,0.000032153213],"category_scores_gemma":[0.00010699421,0.0004557795,0.0001239374,0.0004092541,0.0005757438,0.0009982102,0.0012190735,0.00073676,0.00004791406],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011424217,0.000055464112,0.00036974857,0.000037143767,0.000013959425,0.00028698408,0.0012381612,0.07649254,0.00039926855,0.10075802,0.000042135784,0.82029516],"study_design_scores_gemma":[0.0005926246,0.0001771499,0.0028840606,0.00059669395,0.0000053631093,0.00016764557,4.7307157e-7,0.39227238,0.0015004026,0.5968789,0.0038295416,0.0010948138],"about_ca_topic_score_codex":0.00006253941,"about_ca_topic_score_gemma":0.00038748735,"teacher_disagreement_score":0.81920034,"about_ca_system_score_codex":0.00028041145,"about_ca_system_score_gemma":0.00096145703,"threshold_uncertainty_score":0.9997894},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020130381,0.00003252393,0.98590297,0.00019969537,0.0010438414,0.00068410404,0.0000027992046,0.000093048686,0.012020871],"genre_scores_gemma":[0.51166785,0.000030979074,0.48700628,0.00007041366,0.0006667607,0.00006404909,0.00004238008,0.000055033663,0.00039625837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984104,0.00003633123,0.00027927125,0.0004950724,0.0004745945,0.00030430136],"domain_scores_gemma":[0.99901795,0.00033947575,0.00004962131,0.00042184565,0.00012515791,0.00004593783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018815191,0.00020878998,0.00024108132,0.00077383476,0.00018189296,0.00028847466,0.00050910306,0.00021882787,0.000010629921],"category_scores_gemma":[0.00010186932,0.00018821664,0.000044362056,0.000115803254,0.00010294794,0.0002652594,0.00009271465,0.0005548579,0.0000126914665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010774722,0.0000052056807,9.739465e-7,0.00007782974,0.0000036524334,0.0000047441567,0.00018201495,0.78759533,0.000030312556,0.030563414,0.00005130249,0.18147445],"study_design_scores_gemma":[0.0001838581,0.00009414011,0.000016669717,0.0004479498,0.000004309232,0.0000017284029,0.0000015576683,0.9946567,0.00059095124,0.0033344515,0.00048410156,0.00018361108],"about_ca_topic_score_codex":0.000011907588,"about_ca_topic_score_gemma":0.00019593727,"teacher_disagreement_score":0.5116477,"about_ca_system_score_codex":0.0005006273,"about_ca_system_score_gemma":0.000060073835,"threshold_uncertainty_score":0.76752514},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043120557,0.000082399034,0.99338317,0.000040394345,0.000725696,0.00023973144,0.000044057353,0.0000563476,0.0011161637],"genre_scores_gemma":[0.90428376,0.000003939077,0.095214546,0.00005309019,0.0001496299,0.000012791218,0.00001675721,0.000024613824,0.0002408853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907315,9.551311e-7,0.00024253014,0.00027499182,0.00023009133,0.00017829328],"domain_scores_gemma":[0.9993922,0.00008971083,0.00007182352,0.00027110137,0.00014003749,0.00003513148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002074978,0.00015632356,0.00019939311,0.00023599547,0.000100964346,0.000046591806,0.0003696767,0.000107100896,0.000017371936],"category_scores_gemma":[0.000017870716,0.00015750634,0.00006969592,0.000051009978,0.00026328836,0.000041438467,0.00002688901,0.00021093908,0.0000018990111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031490267,0.000011904029,0.00011275055,0.00014057774,0.000015765221,0.000002448293,0.0016615597,0.7642099,0.0007358929,0.0025874332,0.000008056155,0.23051053],"study_design_scores_gemma":[0.00021198217,0.000032085645,0.0017473794,0.00026562557,0.000010835851,0.0000029387338,2.643267e-7,0.98835665,0.002496564,0.005504931,0.0011254083,0.00024532253],"about_ca_topic_score_codex":0.00003538647,"about_ca_topic_score_gemma":0.00051641883,"teacher_disagreement_score":0.89997166,"about_ca_system_score_codex":0.00010620294,"about_ca_system_score_gemma":0.00012975757,"threshold_uncertainty_score":0.6422922},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020657399,0.00010660012,0.9737195,0.00085299596,0.0009831974,0.00049870537,0.000004150785,0.00011642909,0.02369776],"genre_scores_gemma":[0.11034925,0.000038699447,0.88413024,0.002424231,0.0007223359,0.000032330976,0.00004327444,0.0000580111,0.0022015977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951754,0.000053408727,0.0006082232,0.0020124672,0.0015205352,0.0006299295],"domain_scores_gemma":[0.9962435,0.000130489,0.00044391336,0.0025421605,0.00035443957,0.00028550063],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015068094,0.00053119514,0.0006305013,0.001324823,0.00060021033,0.0018758471,0.005124889,0.0003874927,0.000011387118],"category_scores_gemma":[0.00012717074,0.00048576744,0.00018099553,0.0005403965,0.00029433647,0.0009851779,0.0020678164,0.0005913221,0.00007442083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008150612,0.00007931984,0.000273046,0.00004193392,0.000033677275,0.000046167086,0.0017268371,0.09687212,0.00022179207,0.20563409,0.000111113535,0.6949518],"study_design_scores_gemma":[0.00039040262,0.00015214444,0.0006760719,0.0003208874,0.000021990982,0.000038957678,3.165428e-7,0.6979721,0.00038886198,0.28654924,0.012271191,0.0012178194],"about_ca_topic_score_codex":0.000052475618,"about_ca_topic_score_gemma":0.00017634418,"teacher_disagreement_score":0.69373393,"about_ca_system_score_codex":0.00037540335,"about_ca_system_score_gemma":0.00053127756,"threshold_uncertainty_score":0.9997594},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025824812,0.00052007625,0.9951207,0.00055690086,0.0006228868,0.0021373008,0.0000014771532,0.00002714318,0.00075524254],"genre_scores_gemma":[0.82095563,0.000077146324,0.17616698,0.0012219145,0.0012364363,0.00025638202,0.0000035919388,0.000024351688,0.000057582318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979492,0.00006901572,0.0003957002,0.00063108606,0.00056454755,0.00039046077],"domain_scores_gemma":[0.998357,0.00049439416,0.00025098395,0.0007475214,0.00008847976,0.00006162232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015238104,0.00028141422,0.00033511233,0.00035643348,0.00011816239,0.000317263,0.0019697824,0.0001958669,0.000004168301],"category_scores_gemma":[0.000040704716,0.00018901296,0.000050874318,0.00046922656,0.0003832537,0.0005539067,0.0005768349,0.0006081838,0.0000025584818],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054506186,0.000022181768,0.0003622184,0.000053693253,0.0000030456913,0.000011258027,0.00394567,0.0017251528,0.00027061068,0.054572936,0.000019602106,0.9390082],"study_design_scores_gemma":[0.0005690244,0.00047980057,0.0027417212,0.0021197584,0.000011315293,0.0001305482,0.00000245603,0.82298213,0.0024855,0.16289099,0.0046172948,0.00096944376],"about_ca_topic_score_codex":0.00003753304,"about_ca_topic_score_gemma":0.00013613387,"teacher_disagreement_score":0.9380387,"about_ca_system_score_codex":0.00006971808,"about_ca_system_score_gemma":0.00016480628,"threshold_uncertainty_score":0.7707725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017688766,0.00030746602,0.97638196,0.0018623077,0.0027257525,0.00037471048,0.00002181623,0.00050024583,0.00013699423],"genre_scores_gemma":[0.58424985,0.000009825594,0.41333935,0.0017774757,0.0005719939,0.000015547977,0.000012751512,0.000020436017,0.000002774043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503964,0.00026705206,0.0005751407,0.0020925405,0.0010533709,0.0009722287],"domain_scores_gemma":[0.9938731,0.00061220204,0.00032680502,0.0046354523,0.00031952103,0.00023288366],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0018995687,0.0005924258,0.0006065856,0.00053658424,0.00036702058,0.0013419829,0.011679669,0.0003268706,0.000027807051],"category_scores_gemma":[0.0005676155,0.0005309618,0.000118462776,0.0020245856,0.0012905665,0.00046487906,0.012897004,0.0008167839,0.000047803303],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007785059,0.00017409636,0.00071593735,0.00020193215,0.000025580382,0.00039523563,0.0025247748,0.03432762,0.0021683834,0.0052221846,0.0008088089,0.9534277],"study_design_scores_gemma":[0.00026512757,0.00011462829,0.003712031,0.00032129514,0.0000068183085,0.00009924748,0.0000011554904,0.8075687,0.003753652,0.18329,0.0002165338,0.0006507935],"about_ca_topic_score_codex":0.00012921814,"about_ca_topic_score_gemma":0.00007546015,"teacher_disagreement_score":0.95277685,"about_ca_system_score_codex":0.00023827987,"about_ca_system_score_gemma":0.00071695715,"threshold_uncertainty_score":0.9997142},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043029573,0.000013357924,0.95412225,0.0020389173,0.00009594434,0.00054790324,0.0000010635699,0.00014477891,0.000006230512],"genre_scores_gemma":[0.47929674,8.589274e-7,0.5202047,0.0004022288,0.00006979181,0.000015737565,0.000002765969,0.000006385601,7.7692994e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999025,0.0000301362,0.00014639004,0.0004216117,0.0001686949,0.00020820231],"domain_scores_gemma":[0.9991031,0.00027240827,0.00008696541,0.00037615927,0.00010492389,0.000056415538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035138434,0.00010610992,0.00014866657,0.00015137137,0.00015392227,0.000041827414,0.00017444137,0.0000580555,0.0000014913514],"category_scores_gemma":[0.0002007013,0.0000896333,0.00003774884,0.0005601907,0.000112679074,0.00009909145,0.00004841652,0.00015453188,8.8132015e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070749793,0.00005265428,0.004364376,0.000049081274,0.0000016334345,6.198023e-7,0.00021413907,0.01824661,0.12419381,0.00050210283,0.0000059133085,0.852362],"study_design_scores_gemma":[0.00029715407,0.000056773104,0.023017326,0.000053937772,0.000009533239,0.000033544296,4.1800746e-7,0.9494071,0.020330248,0.0065508783,0.00015485789,0.000088229885],"about_ca_topic_score_codex":0.0000063114076,"about_ca_topic_score_gemma":0.0000021752037,"teacher_disagreement_score":0.9311605,"about_ca_system_score_codex":0.00008826255,"about_ca_system_score_gemma":0.000061605344,"threshold_uncertainty_score":0.36551398},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016066078,0.00038613414,0.97831005,0.00020851499,0.0020427096,0.0008837492,0.00002388389,0.00016986365,0.016368503],"genre_scores_gemma":[0.9128413,0.00011569579,0.082951374,0.0003156492,0.00062821293,0.000037419475,0.000013601087,0.00007550741,0.0030211937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958981,0.000067437526,0.0006898404,0.0015328004,0.0011980691,0.0006137314],"domain_scores_gemma":[0.9958412,0.0006858781,0.0008357358,0.002033029,0.00042771327,0.0001764338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010680354,0.00059136347,0.0009799779,0.0008318545,0.00039187924,0.0009092527,0.0037641262,0.00046826678,0.00001803066],"category_scores_gemma":[0.0001221361,0.00050531083,0.00021815624,0.00020592636,0.0009993776,0.00049270084,0.0007324134,0.0007302797,0.00011739986],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014484424,0.0000703274,0.000022491968,0.000080169615,0.000028553739,0.0001614932,0.0017542894,0.0021930835,0.0029123006,0.0013837678,0.000038510498,0.9913405],"study_design_scores_gemma":[0.0057138647,0.006166422,0.003704031,0.01742281,0.00014830018,0.0015806152,0.0000031118914,0.67544687,0.041958105,0.22039594,0.019935083,0.0075248796],"about_ca_topic_score_codex":0.000043462886,"about_ca_topic_score_gemma":0.00007546247,"teacher_disagreement_score":0.98381567,"about_ca_system_score_codex":0.00020053731,"about_ca_system_score_gemma":0.00046372673,"threshold_uncertainty_score":0.9997398},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006888318,0.000055661843,0.99430746,0.0014799664,0.0004876799,0.00017110318,0.00000699482,0.000070049166,0.0027322366],"genre_scores_gemma":[0.7292653,0.0000038058477,0.2697642,0.00042777508,0.00029560959,0.000002387281,0.0000065005233,0.000014876168,0.00021955771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640965,0.000032058175,0.00039208544,0.0013969896,0.0012625944,0.000506642],"domain_scores_gemma":[0.9981189,0.00043206575,0.00048460704,0.00060257176,0.0001854081,0.00017645939],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00088682445,0.0004527065,0.00048235038,0.00024480186,0.00049079076,0.0012573741,0.0019178017,0.0002370324,0.000027250015],"category_scores_gemma":[0.00018996293,0.00035234418,0.00010032774,0.000108556655,0.00095434394,0.0010117036,0.0015103918,0.0015122655,0.000017701688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000143102725,0.00005519663,0.00038857173,0.000036130252,0.00006200799,0.0003966408,0.0007863191,0.0030921528,0.0000103579905,0.8929268,0.00008409374,0.1021474],"study_design_scores_gemma":[0.00028964752,0.00020679492,0.00032050224,0.0004967941,0.000022316963,0.00049209764,9.30913e-7,0.99169177,0.000089834335,0.004998421,0.0008150802,0.0005758225],"about_ca_topic_score_codex":0.00002482909,"about_ca_topic_score_gemma":0.00025193847,"teacher_disagreement_score":0.9885996,"about_ca_system_score_codex":0.0004173551,"about_ca_system_score_gemma":0.00057114544,"threshold_uncertainty_score":0.99989283},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004998051,0.0005389621,0.99157774,0.00072002964,0.0029189328,0.00051542337,0.000006649174,0.0004127345,0.0028097176],"genre_scores_gemma":[0.17732455,0.00009012671,0.8183957,0.0012138303,0.0016364811,0.000016293036,0.00002113022,0.00014066683,0.0011612468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99459624,0.000053341744,0.0006231937,0.0022824376,0.0014067803,0.0010380283],"domain_scores_gemma":[0.9958821,0.00044952956,0.000436317,0.0025508846,0.00038683036,0.00029431877],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010667854,0.0008710109,0.0007951536,0.00092188385,0.001097312,0.0013756242,0.004783143,0.00049067766,0.000009924609],"category_scores_gemma":[0.00011288802,0.00070622365,0.00016268119,0.00041744966,0.00092299253,0.0007234447,0.0014761224,0.0019181981,0.00006019071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013789678,0.00002771869,0.000031432555,0.000035821045,0.000024143155,0.00035913254,0.00081319694,0.2551991,0.00005012927,0.0034899719,0.000019603824,0.73993593],"study_design_scores_gemma":[0.00048764792,0.000381593,0.00020168298,0.0012444948,0.000015565225,0.00054670806,1.1335092e-7,0.96500236,0.00037694728,0.02953196,0.0012558489,0.0009550615],"about_ca_topic_score_codex":0.000071775874,"about_ca_topic_score_gemma":0.000071242415,"teacher_disagreement_score":0.7389809,"about_ca_system_score_codex":0.00030673863,"about_ca_system_score_gemma":0.00094981166,"threshold_uncertainty_score":0.999661},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027233837,0.000055639088,0.96026564,0.000631675,0.00085067423,0.032522626,0.000008429783,0.0003308367,0.005331759],"genre_scores_gemma":[0.024651103,0.000011907177,0.92603606,0.0024610874,0.0018086269,0.0411188,0.000020087886,0.00012984747,0.0037624799],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941719,0.000106341366,0.00070927624,0.0024115501,0.0015631691,0.0010377589],"domain_scores_gemma":[0.99291354,0.00037474462,0.0008777076,0.0050670267,0.00047192269,0.00029507268],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015354395,0.0006820664,0.00073062145,0.00064917194,0.0007132058,0.0017459992,0.012093409,0.0004519438,0.000023093382],"category_scores_gemma":[0.0004899641,0.00064706925,0.00017883007,0.00069918693,0.0014048885,0.0019315083,0.0036954868,0.0014088217,0.00016470678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001446365,0.0002652598,0.00015536086,0.00039396496,0.000017509108,0.00019385332,0.0026306473,0.0042021913,0.00010759672,0.116362445,0.00035099417,0.8753057],"study_design_scores_gemma":[0.00036684002,0.00012722501,0.000082900544,0.00065518863,0.0000029809262,0.00004346757,3.7529603e-8,0.16944697,0.0019700502,0.8125207,0.014087514,0.0006961542],"about_ca_topic_score_codex":0.0000083755485,"about_ca_topic_score_gemma":0.000041191754,"teacher_disagreement_score":0.8746096,"about_ca_system_score_codex":0.00076469383,"about_ca_system_score_gemma":0.0028639885,"threshold_uncertainty_score":0.9995981},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008397236,0.0030639274,0.53034896,0.0033509482,0.0034676937,0.0019582277,0.00002809963,0.00026472882,0.4566777],"genre_scores_gemma":[0.9688733,0.00030287725,0.015294217,0.0021944428,0.011739229,0.000050519342,0.000009377121,0.000046737714,0.0014892672],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969887,0.000047701822,0.00025127945,0.00087254355,0.0008666026,0.00097317836],"domain_scores_gemma":[0.99880624,0.00018193541,0.00033783607,0.0003854762,0.00011429388,0.00017420763],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014901405,0.0003654043,0.0004952418,0.00022481095,0.003304954,0.00090632006,0.0013401719,0.0004667835,0.00002214882],"category_scores_gemma":[0.00012162685,0.00032373556,0.000106084,0.00012880862,0.0020467448,0.0007450317,0.00055456196,0.00075908226,0.000008967126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002117832,0.000014850885,0.0003460453,0.000017225182,0.000010453723,0.000018782846,0.0063595637,0.00019390754,2.3904826e-7,0.08966971,0.00002988221,0.90331817],"study_design_scores_gemma":[0.004990779,0.001000491,0.06008377,0.0036046428,0.0002512355,0.00008160855,0.000039822924,0.21753055,0.0000134904485,0.51269966,0.19323738,0.0064665545],"about_ca_topic_score_codex":0.00051859976,"about_ca_topic_score_gemma":0.001173805,"teacher_disagreement_score":0.9680336,"about_ca_system_score_codex":0.00016792481,"about_ca_system_score_gemma":0.0003172459,"threshold_uncertainty_score":0.99992144},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002435822,0.0005906046,0.99482805,0.00018275913,0.0006948237,0.0007014513,0.00002217936,0.0002789264,0.0002653864],"genre_scores_gemma":[0.08445134,0.00009549392,0.907994,0.0008155372,0.005914052,0.000043869717,0.000021456786,0.000015039044,0.00064921024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981459,0.000011603126,0.00033012658,0.00075433846,0.0002704245,0.00048765325],"domain_scores_gemma":[0.99915016,0.00022774133,0.00019084988,0.00018460039,0.00015228456,0.00009437353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003187722,0.00032159744,0.0003806569,0.00010199248,0.0002858061,0.00017378901,0.00097455457,0.0005149363,0.00008063736],"category_scores_gemma":[0.00003308503,0.00014707692,0.00010405053,0.00021474669,0.00035895378,0.00010811399,0.00030276773,0.000296764,0.000012447736],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000391934,0.00000534914,0.000054373497,0.000008439142,0.0000061276464,0.000006460242,0.000027700293,0.00021113869,0.003571646,0.00019223584,0.000021835669,0.9958908],"study_design_scores_gemma":[0.0007112442,0.0027612713,0.0013885049,0.0018699967,0.00012841403,0.00037598234,0.000003241182,0.6069313,0.022176072,0.29702348,0.06348345,0.003147002],"about_ca_topic_score_codex":0.00014163907,"about_ca_topic_score_gemma":0.00021919252,"teacher_disagreement_score":0.9927438,"about_ca_system_score_codex":0.00010892295,"about_ca_system_score_gemma":0.00007263361,"threshold_uncertainty_score":0.5997623},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015283191,0.000079375335,0.9837504,0.00001749981,0.0002710247,0.00025755327,0.0000041546677,0.000070171016,0.000266612],"genre_scores_gemma":[0.41060507,0.0000067375604,0.5892725,0.000044863973,0.00004170395,0.0000018207186,0.000003359243,0.000010888295,0.000013031415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720275,0.000063832216,0.0005839922,0.0010634484,0.0006745916,0.00041135555],"domain_scores_gemma":[0.9977281,0.00012851912,0.0005641928,0.0011248899,0.0003600138,0.000094261224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001962534,0.00036301382,0.00050360296,0.0013991395,0.00024560586,0.00037024793,0.0017962832,0.00025636176,0.0000036019917],"category_scores_gemma":[0.00012093537,0.0003183193,0.00011221135,0.0010012939,0.0008719991,0.0022571578,0.00078595645,0.00038775598,6.602839e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007803321,0.00002003751,0.000031058113,0.000030595773,0.000027774191,0.000001858245,0.0045178575,0.38857824,0.004380826,0.0298893,6.4796936e-8,0.5725146],"study_design_scores_gemma":[0.00007587235,0.00012067376,0.00014614812,0.00015329066,0.000049750626,0.000013679109,0.0000015092996,0.9152804,0.0045402884,0.07931377,0.0000011311114,0.00030346203],"about_ca_topic_score_codex":0.000024421128,"about_ca_topic_score_gemma":0.00018732631,"teacher_disagreement_score":0.57221115,"about_ca_system_score_codex":0.0002353494,"about_ca_system_score_gemma":0.00026314618,"threshold_uncertainty_score":0.99992687},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013296218,0.00016387018,0.98308325,0.001949278,0.0020183662,0.00035947585,0.0000032081282,0.0002575886,0.012151694],"genre_scores_gemma":[0.07844991,0.000096036485,0.9156942,0.002593785,0.00064695685,0.000013934465,0.00001095703,0.000052033363,0.0024422097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620473,0.00003762678,0.00041745833,0.0014689495,0.0011216012,0.000749629],"domain_scores_gemma":[0.9972728,0.00035667996,0.00023291197,0.0016228923,0.0002481368,0.0002666044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094309135,0.0004762912,0.0004507455,0.0008981728,0.00033800094,0.0010312994,0.004462228,0.00045848792,0.00010803842],"category_scores_gemma":[0.00010217869,0.00042604608,0.00013059094,0.00073298404,0.00072893535,0.00052525604,0.0015453034,0.0014347641,0.00013507163],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005584092,0.000037143895,0.000097420445,0.000022050905,0.000013492038,0.00010537322,0.001194418,0.06901806,0.0004687375,0.062684424,0.000101295445,0.866252],"study_design_scores_gemma":[0.00040914543,0.0001654314,0.00008670176,0.00029339586,0.0000041155836,0.00006520134,1.05181996e-7,0.7959472,0.0014186179,0.16995917,0.03071022,0.0009407119],"about_ca_topic_score_codex":0.000012313011,"about_ca_topic_score_gemma":0.00024167614,"teacher_disagreement_score":0.86531126,"about_ca_system_score_codex":0.00013469544,"about_ca_system_score_gemma":0.00058696663,"threshold_uncertainty_score":0.99981916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037568328,0.0009575432,0.99056304,0.000028078295,0.0007080535,0.00027018864,0.0000068908957,0.00020796906,0.0035013873],"genre_scores_gemma":[0.93190634,0.000041145726,0.067171894,0.00007253416,0.00044503566,0.000011778654,0.000011745499,0.00008819543,0.00025132738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800843,0.000011490388,0.0003329022,0.0006770643,0.0003691182,0.00060100615],"domain_scores_gemma":[0.9983987,0.0009759585,0.00009719153,0.00028532703,0.0001260461,0.00011674242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066176144,0.00045042034,0.00042737016,0.00028268303,0.00059689087,0.00026003743,0.00044944225,0.00030669454,0.000005529483],"category_scores_gemma":[0.0004274197,0.00041234907,0.00010137269,0.000082266815,0.00021533182,0.00020712447,0.000099629666,0.00081737246,9.66707e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015350784,0.000003585159,0.000450566,0.0001906793,0.00000883061,0.00001775694,0.00033565448,0.35556418,0.0014238509,0.00005716547,0.0000033861538,0.64192903],"study_design_scores_gemma":[0.00044407876,0.00009059061,0.000026322066,0.0015494162,0.000012591601,0.000022214097,1.4886865e-7,0.9867271,0.0066189617,0.0012946983,0.00273235,0.00048149802],"about_ca_topic_score_codex":0.000017716799,"about_ca_topic_score_gemma":0.00012546113,"teacher_disagreement_score":0.9281495,"about_ca_system_score_codex":0.0001855419,"about_ca_system_score_gemma":0.00014025517,"threshold_uncertainty_score":0.9998328},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005541232,0.0014205861,0.9843648,0.0016107264,0.0033428418,0.0004953629,0.000013312668,0.00023073559,0.007967484],"genre_scores_gemma":[0.90959424,0.0003518282,0.084364824,0.0028130524,0.0014306494,0.000020011537,0.000013537262,0.00013644608,0.0012754395],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942372,0.000061931314,0.0006237585,0.0024006534,0.0015435389,0.0011329113],"domain_scores_gemma":[0.99486464,0.0005605486,0.0004106244,0.0035593628,0.00024702615,0.0003577919],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009102927,0.0008818602,0.00082079764,0.0014127474,0.0011513893,0.0012777228,0.0063729933,0.0005425594,0.000018093697],"category_scores_gemma":[0.0001373272,0.0007588806,0.00043071355,0.00039333693,0.0015817658,0.00056392123,0.0015739297,0.0012564859,0.0001051775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121061625,0.0004127361,0.000107863096,0.00028632916,0.00016867423,0.002562803,0.00484003,0.030989472,0.0025020023,0.23603977,0.0003323781,0.7216369],"study_design_scores_gemma":[0.0009908858,0.0012460251,0.0010108817,0.0019807944,0.00004696365,0.00017372449,0.0000010842625,0.3022726,0.003756386,0.6785808,0.0074255294,0.002514323],"about_ca_topic_score_codex":0.0000685822,"about_ca_topic_score_gemma":0.0001636385,"teacher_disagreement_score":0.9090401,"about_ca_system_score_codex":0.00022632325,"about_ca_system_score_gemma":0.0004610859,"threshold_uncertainty_score":0.999759},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017469218,0.000047087822,0.9574837,0.0007072322,0.0002866214,0.00024986084,0.000011729532,0.00007313369,0.04096596],"genre_scores_gemma":[0.88576883,0.0000029864107,0.107620925,0.00030369902,0.001834042,0.000015239753,0.000017565599,0.000039673374,0.00439703],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764293,0.000013525918,0.0002615815,0.0010395176,0.0005371599,0.0005053018],"domain_scores_gemma":[0.9978598,0.000103383696,0.00024788492,0.0014008927,0.00018393094,0.00020412364],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000332867,0.0004349019,0.0005186487,0.0003978748,0.0003049377,0.0011730137,0.0020433504,0.00012779389,0.00018185846],"category_scores_gemma":[0.000010642654,0.00038610393,0.00019149059,0.00015292734,0.00038413686,0.00023182192,0.000808537,0.0006126051,0.000030184903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043045334,0.000017026678,0.00024315238,0.000005507471,0.00003303062,0.000016914408,0.00013182015,0.0035785951,0.00009343819,0.046538133,0.0001450332,0.94919306],"study_design_scores_gemma":[0.00020539909,0.00017999156,0.00042613086,0.00039166235,0.000051685252,0.0000045670545,4.4124397e-7,0.041080873,0.0012276628,0.9203909,0.034800634,0.001240079],"about_ca_topic_score_codex":0.00006777032,"about_ca_topic_score_gemma":0.00007979329,"teacher_disagreement_score":0.947953,"about_ca_system_score_codex":0.00012244197,"about_ca_system_score_gemma":0.0002836206,"threshold_uncertainty_score":0.99986386},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055022778,0.0015124355,0.994417,0.00078917167,0.0013452903,0.00045988837,0.0000026803207,0.00015507807,0.0012634114],"genre_scores_gemma":[0.9202136,0.000053816988,0.07631039,0.0010086749,0.00030196356,0.00004840935,0.000021231857,0.00006228777,0.0019796446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553907,0.00012417015,0.0006811271,0.0017671876,0.0009951992,0.00089323847],"domain_scores_gemma":[0.9969648,0.00059718284,0.00058462634,0.0014040711,0.0001994466,0.00024986532],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013073033,0.00057662715,0.00072217773,0.000717767,0.00080277445,0.001630128,0.003151304,0.00026676295,0.000039124887],"category_scores_gemma":[0.0003552078,0.00052756316,0.00023908462,0.0003953037,0.00079060055,0.000803891,0.0011944225,0.0018135331,0.000029326053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047297926,0.000021533015,0.00006781885,0.000007620245,0.000025597434,0.00006229363,0.0006831837,0.7831421,0.000017826911,0.0020511162,0.000024939662,0.21389124],"study_design_scores_gemma":[0.00032530766,0.000096092735,0.00027687228,0.000109727596,0.000031835905,0.000041485284,6.7390806e-7,0.99055034,0.000015866824,0.0066374335,0.0013736276,0.00054075936],"about_ca_topic_score_codex":0.00009331717,"about_ca_topic_score_gemma":0.00017196334,"teacher_disagreement_score":0.92015857,"about_ca_system_score_codex":0.00030829443,"about_ca_system_score_gemma":0.00024381798,"threshold_uncertainty_score":0.9997176},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013471624,0.0001395045,0.98163855,0.00092424825,0.0011910277,0.00060389267,0.000018062501,0.00020109654,0.0018119864],"genre_scores_gemma":[0.4363861,0.000015253469,0.5619373,0.0010743524,0.00026508555,0.000021148146,0.000019794277,0.000052512274,0.00022848987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947346,0.000031898,0.0005837549,0.0022214407,0.0013669712,0.0010613693],"domain_scores_gemma":[0.99569947,0.00071266876,0.00065936655,0.0023068425,0.00020867988,0.0004129911],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00045368393,0.00088090263,0.0008992135,0.00054608035,0.0006015279,0.0015923257,0.0048168967,0.00034106176,0.00000995725],"category_scores_gemma":[0.00005721291,0.00063865853,0.00017528103,0.00030052,0.0013706883,0.0013808415,0.0011967183,0.0010545494,0.000032986576],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103305116,0.000054219494,0.00021174124,0.000030037985,0.00008883712,0.00037634475,0.0015297917,0.025684033,0.000036675847,0.0064823157,0.00003822192,0.96536446],"study_design_scores_gemma":[0.0022658552,0.0019659034,0.0014501592,0.0016717953,0.00008534543,0.0003276394,0.0000011459506,0.5716281,0.0032682442,0.41282803,0.0017444147,0.0027633435],"about_ca_topic_score_codex":0.00097282825,"about_ca_topic_score_gemma":0.0034320713,"teacher_disagreement_score":0.9626011,"about_ca_system_score_codex":0.00059348164,"about_ca_system_score_gemma":0.0014803272,"threshold_uncertainty_score":0.9996065},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002081283,0.00017548006,0.99494773,0.00036776997,0.0012309114,0.000298347,0.000013070907,0.000055989625,0.0008294406],"genre_scores_gemma":[0.50924915,0.000037801095,0.49018767,0.00016670927,0.00017756302,0.0000050396725,0.000022149681,0.000017806451,0.00013608427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963592,0.00004346872,0.0007497167,0.0012102696,0.0011805699,0.00045675354],"domain_scores_gemma":[0.99635535,0.0003845472,0.0007786212,0.0018264736,0.0005147952,0.00014019907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001028064,0.00041672454,0.00059182604,0.0011437862,0.00051969255,0.00028042094,0.002272564,0.00026189908,0.00004987889],"category_scores_gemma":[0.00013605898,0.0003901818,0.00026797934,0.00045823105,0.00071886403,0.0007401049,0.0009586689,0.0005572341,0.00001781579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002916976,0.00020284898,0.0009809979,0.000088271016,0.00015412744,0.0000889569,0.0033357868,0.07738209,0.0032350305,0.23200548,0.00008806926,0.68240917],"study_design_scores_gemma":[0.0004470651,0.00014037106,0.0009263962,0.0002259709,0.000038270737,0.000024948044,2.4030908e-7,0.8152626,0.002256791,0.17917463,0.00094191177,0.00056081987],"about_ca_topic_score_codex":0.00014207179,"about_ca_topic_score_gemma":0.00015113644,"teacher_disagreement_score":0.7378805,"about_ca_system_score_codex":0.00014820398,"about_ca_system_score_gemma":0.0004990453,"threshold_uncertainty_score":0.999855},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004880737,0.0006932711,0.99300945,0.00021335087,0.0023794346,0.00017473678,0.0000031143356,0.00008123117,0.0029573494],"genre_scores_gemma":[0.9811513,0.00061161554,0.01575752,0.0003651248,0.0009840521,0.0000060344773,0.00001011962,0.00006682364,0.0010474465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990601,0.0000030692268,0.00014092821,0.00033286744,0.00024617332,0.00021688678],"domain_scores_gemma":[0.99931145,0.00008328743,0.000066822366,0.000454191,0.000040376748,0.00004385935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039894017,0.00021589512,0.00021548936,0.00012785739,0.00017528643,0.0002541716,0.00042398152,0.0001689752,0.000009506881],"category_scores_gemma":[0.000015018399,0.00015003003,0.000045843262,0.000044806606,0.00036160497,0.00009886834,0.0001740722,0.00038008817,0.0000053891035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026421887,0.0000033091724,0.000047818296,0.00006576647,0.000028969607,0.000033260247,0.00039301923,0.05846501,0.00012507095,0.017437119,0.000033268916,0.923341],"study_design_scores_gemma":[0.0002268122,0.000014910848,0.00008722895,0.00014188355,0.000014341823,0.000030957563,1.15426815e-7,0.93531495,0.00003002128,0.05954567,0.0043541747,0.00023893014],"about_ca_topic_score_codex":0.000020073867,"about_ca_topic_score_gemma":0.00019798394,"teacher_disagreement_score":0.9806632,"about_ca_system_score_codex":0.000063749205,"about_ca_system_score_gemma":0.000033910146,"threshold_uncertainty_score":0.6118047},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002552479,0.00015080589,0.99315536,0.000233702,0.0034701573,0.0005732693,0.0000044969843,0.00047858665,0.0016783862],"genre_scores_gemma":[0.35420576,0.0000716403,0.6436081,0.0005380728,0.00047589757,0.000029562421,0.000012744569,0.000051480198,0.0010067694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957329,0.000063242944,0.00057772675,0.0019193529,0.0010518082,0.00065495673],"domain_scores_gemma":[0.996516,0.00025392283,0.00059611467,0.0019936883,0.00044612173,0.00019415458],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010864134,0.00058052235,0.00049255404,0.0011098786,0.000855662,0.0015407725,0.0032683774,0.00045155137,0.00003742738],"category_scores_gemma":[0.00012094905,0.0005630881,0.00015687439,0.00027285493,0.00058626255,0.0020155816,0.0013649075,0.00094283314,0.00011139467],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047701965,0.000027380394,0.000024888735,0.000032289485,0.000006051866,0.000045569104,0.00039389607,0.0003002007,0.0053235525,0.0003391946,0.000014637139,0.9934876],"study_design_scores_gemma":[0.0008833296,0.00028717404,0.0010090087,0.001460268,0.000019247955,0.00022487273,6.606099e-7,0.7122418,0.19327527,0.08596109,0.0030714746,0.0015657992],"about_ca_topic_score_codex":0.00006674775,"about_ca_topic_score_gemma":0.00013083834,"teacher_disagreement_score":0.9919218,"about_ca_system_score_codex":0.000509246,"about_ca_system_score_gemma":0.00034656675,"threshold_uncertainty_score":0.99968207},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023713077,0.0008974829,0.9911878,0.000051803276,0.0037340727,0.00026694068,0.0000048080574,0.00007014127,0.0014156125],"genre_scores_gemma":[0.99152505,0.00032390666,0.007509721,0.00011658018,0.00032215365,0.0000060818284,0.000020334066,0.00003033664,0.00014583631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988917,0.0000036738336,0.00017555243,0.00037247923,0.0003750055,0.00018156099],"domain_scores_gemma":[0.9993629,0.000028196735,0.00007390635,0.00037295657,0.00010620464,0.000055842218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056577974,0.00021066767,0.0001919431,0.0002628613,0.00009442365,0.00015605419,0.0002746833,0.00018724617,0.00004991719],"category_scores_gemma":[0.000019065448,0.00018589987,0.000036520945,0.000042967684,0.0001388608,0.00012271412,0.00010165931,0.00025514595,0.0000072790067],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033164201,0.0000022709544,0.000016675836,0.000025632242,0.000009680889,0.0000043140158,0.000069569316,0.026933756,0.00036614208,0.0016297322,0.000012773836,0.97092617],"study_design_scores_gemma":[0.000115691226,0.00003782249,0.00022222946,0.00013012168,0.00001758449,0.000009627685,7.208941e-8,0.93732595,0.00025742163,0.060171865,0.0014855057,0.00022608052],"about_ca_topic_score_codex":0.000006545464,"about_ca_topic_score_gemma":0.00007372874,"teacher_disagreement_score":0.98915374,"about_ca_system_score_codex":0.00015727787,"about_ca_system_score_gemma":0.00007343454,"threshold_uncertainty_score":0.7580777},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000926936,0.00020183939,0.98278815,0.0012251304,0.0037119947,0.0002460662,0.0000049371843,0.000199875,0.011529294],"genre_scores_gemma":[0.1977977,0.00017644413,0.7959663,0.0015993573,0.0024216447,0.000036136447,0.000007301404,0.00007447763,0.0019206158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995961,0.000023559205,0.00052403565,0.0015820988,0.0011967913,0.0007125314],"domain_scores_gemma":[0.99650306,0.00043152706,0.00034968337,0.0021782648,0.00033162432,0.00020586952],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007702097,0.0005055699,0.0004605804,0.00069031876,0.0006269723,0.00090343907,0.006077937,0.0002340941,0.00004011462],"category_scores_gemma":[0.0001927242,0.0004877964,0.00016907403,0.00019547292,0.0011293457,0.001860354,0.0020827907,0.00090047106,0.0004700398],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039319875,0.000021225906,0.00003038988,0.000015772965,0.000009427521,0.00017356136,0.0008188284,0.015843248,0.00014807523,0.08473432,0.000014599092,0.8981866],"study_design_scores_gemma":[0.00007280562,0.00014976275,0.00010576195,0.0005661463,0.000006478454,0.0001009184,1.5611604e-7,0.5257284,0.008414592,0.4598107,0.0041542454,0.00089004246],"about_ca_topic_score_codex":0.000034755427,"about_ca_topic_score_gemma":0.00005359986,"teacher_disagreement_score":0.89729655,"about_ca_system_score_codex":0.0002950055,"about_ca_system_score_gemma":0.0005692697,"threshold_uncertainty_score":0.99975735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007794715,0.00012264999,0.9727076,0.0025103888,0.00088622153,0.00040172462,0.000004869196,0.00008798528,0.015483818],"genre_scores_gemma":[0.98950416,0.000025365158,0.008148973,0.00028423633,0.0009120992,0.0000025999254,0.000004205695,0.000017368042,0.0011010111],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972993,0.00012929489,0.0002342742,0.000899241,0.0009820955,0.0004557727],"domain_scores_gemma":[0.997885,0.00044162176,0.0003797432,0.0008363131,0.00027313762,0.00018421028],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0019842505,0.00028387023,0.00037871266,0.00047784814,0.0018916485,0.0006313905,0.0011630573,0.00033996903,0.0001245656],"category_scores_gemma":[0.0005784816,0.00029195784,0.00014157253,0.00025772274,0.0034288163,0.00053836143,0.00019137157,0.00060914434,0.000023877514],"study_design_candidate":"design_other","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.000023506864,0.00009031835,0.002918903,0.00012795342,0.000074765245,0.00006357274,0.037443902,0.07281611,0.0011782761,0.035683654,0.000067271685,0.84951174],"study_design_scores_gemma":[0.0004960424,0.00016230911,0.002793021,0.0011644685,0.00016585916,0.0000068768954,0.000029283108,0.42097726,0.0031002564,0.56090397,0.00808555,0.0021150764],"about_ca_topic_score_codex":0.007847705,"about_ca_topic_score_gemma":0.042017978,"teacher_disagreement_score":0.9817094,"about_ca_system_score_codex":0.00091322465,"about_ca_system_score_gemma":0.0020373354,"threshold_uncertainty_score":0.99995327},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043852455,0.000208796,0.98490703,0.00033235413,0.00049380946,0.00037358378,0.000003366727,0.00009954282,0.013537658],"genre_scores_gemma":[0.12538186,0.00024133122,0.8665839,0.0017168057,0.00033620116,0.00007926976,0.000014002072,0.000074937765,0.005571725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961567,0.000041652875,0.00041636304,0.0015302125,0.0010860644,0.0007690039],"domain_scores_gemma":[0.9973644,0.00015211926,0.00028600762,0.0017620483,0.00020734903,0.00022810348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061941857,0.00048809842,0.00049820496,0.0009819565,0.00029593892,0.0010331293,0.004328012,0.00025993062,0.000043131287],"category_scores_gemma":[0.000028831553,0.0004067471,0.0000830369,0.0003812434,0.0007447674,0.0009321425,0.0013851637,0.00067101605,0.000031227737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009802748,0.00004732901,0.000097929886,0.000016926331,0.0000071841637,0.00023934926,0.0008129389,0.24755244,0.000011411554,0.004946215,0.000035747886,0.74622273],"study_design_scores_gemma":[0.0006400165,0.00039715474,0.00010520444,0.00043990253,0.0000030045728,0.00006961686,1.9332072e-7,0.97812915,0.0001789564,0.009307814,0.010087126,0.0006418727],"about_ca_topic_score_codex":0.000081004706,"about_ca_topic_score_gemma":0.0004919479,"teacher_disagreement_score":0.74558085,"about_ca_system_score_codex":0.000249605,"about_ca_system_score_gemma":0.0007146187,"threshold_uncertainty_score":0.9998384},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072761034,0.000015140085,0.9908141,0.00065275765,0.000355325,0.00061095884,0.000036813315,0.000067418434,0.0001714136],"genre_scores_gemma":[0.60514444,0.0000014932707,0.3936192,0.00069782225,0.00036193125,0.000032437878,0.000095480646,0.000014172856,0.000033012035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723566,0.000050672767,0.0005371499,0.0011165034,0.00068316015,0.00037682895],"domain_scores_gemma":[0.9980473,0.00033786058,0.0002798837,0.00082413456,0.00036784602,0.00014296644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009899373,0.00030677757,0.0004504798,0.0005861289,0.00012420089,0.00010819117,0.0013419497,0.00024271302,0.000031470667],"category_scores_gemma":[0.00013935825,0.00028597415,0.00006109817,0.00057779433,0.0003349222,0.0005376972,0.00030994814,0.00043901743,0.000009927956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022158536,0.00013971906,0.00010158221,0.00011466629,0.000026792808,0.00006468479,0.008844444,0.2611573,0.0007964732,0.0058479975,0.000027218079,0.7226575],"study_design_scores_gemma":[0.0009975801,0.0003433922,0.00011181599,0.0002899029,0.0000062020713,0.000028915762,0.0000013663731,0.8698863,0.001539229,0.12631793,0.00008046849,0.00039692622],"about_ca_topic_score_codex":0.00005972806,"about_ca_topic_score_gemma":0.0006779576,"teacher_disagreement_score":0.7222606,"about_ca_system_score_codex":0.0001523218,"about_ca_system_score_gemma":0.00038725274,"threshold_uncertainty_score":0.99995923},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013406892,0.015987813,0.97845924,0.0030024538,0.00083051535,0.0006086037,0.00001030921,0.00047551026,0.0006121608],"genre_scores_gemma":[0.24123852,0.00010131369,0.75718737,0.0004770317,0.0003978496,0.000055468714,0.0000016935107,0.000032786967,0.0005079443],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776757,0.000024168707,0.00030312844,0.00081210776,0.0006510753,0.0004419499],"domain_scores_gemma":[0.9962994,0.0011463214,0.0003251753,0.0020092363,0.00019628055,0.000023601518],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007302049,0.00031919047,0.000328577,0.0002817366,0.00025181632,0.0005140904,0.009736167,0.00029498094,6.2519774e-7],"category_scores_gemma":[0.0007825822,0.00016387667,0.00015096094,0.0007901328,0.0019356811,0.00035439947,0.0030746094,0.0005824997,0.0000019357694],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021993108,0.000013856345,0.000003254146,0.00008154406,0.000007996342,0.000008273515,0.0015394846,0.00005684022,0.00015300968,0.024947526,0.00027283825,0.9729132],"study_design_scores_gemma":[0.00016597152,0.0002285154,0.000030736323,0.0009216906,0.000012919137,0.00005715738,0.000005534689,0.039240964,0.043118566,0.9119025,0.0037737899,0.0005416623],"about_ca_topic_score_codex":0.000004805727,"about_ca_topic_score_gemma":0.00004128296,"teacher_disagreement_score":0.9723715,"about_ca_system_score_codex":0.0001495229,"about_ca_system_score_gemma":0.00047176288,"threshold_uncertainty_score":0.9956216},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037335441,0.000120241304,0.99241257,0.0004660922,0.0012550629,0.0002726168,0.000002265379,0.00007800465,0.0016596328],"genre_scores_gemma":[0.99039733,0.000022684359,0.004559936,0.001044571,0.003333066,0.0000049136015,0.00001922835,0.000018148608,0.00060013024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976069,0.00009471425,0.00036134236,0.00076604006,0.0007376822,0.0004333481],"domain_scores_gemma":[0.9985765,0.0002342433,0.00020688366,0.00047897617,0.00038169936,0.00012164903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014970666,0.0002317201,0.0002543188,0.00043277445,0.0009144718,0.00029710197,0.0006916537,0.0003576376,0.0004583773],"category_scores_gemma":[0.00012236647,0.0002304665,0.00010569611,0.000525095,0.0019936403,0.0003051424,0.00012625319,0.00044515444,0.000023875024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007857674,0.000024759334,0.0011911171,0.000015399955,0.000016404938,0.0000048344386,0.007739162,0.7840779,0.00001051715,0.0008801881,0.00006115251,0.2059707],"study_design_scores_gemma":[0.00006635931,0.00004141862,0.0002517939,0.00009416719,0.000028201885,0.0000015559687,0.0000035825094,0.9761136,0.0000110140345,0.02198917,0.0011705589,0.00022856663],"about_ca_topic_score_codex":0.001354736,"about_ca_topic_score_gemma":0.005488229,"teacher_disagreement_score":0.98785263,"about_ca_system_score_codex":0.0005242558,"about_ca_system_score_gemma":0.00047276344,"threshold_uncertainty_score":0.9398151},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000093513285,0.0001548498,0.98671806,0.0015975148,0.0005353932,0.00036848703,0.00000898466,0.0002434776,0.0102797495],"genre_scores_gemma":[0.086274296,0.000026540054,0.90952295,0.0018627251,0.0005408592,0.00001889753,0.00004331099,0.000047680067,0.0016627318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962621,0.000054010558,0.0004222102,0.0016899809,0.0009903123,0.00058142724],"domain_scores_gemma":[0.9968987,0.00028545188,0.00037000506,0.0019052175,0.00035686712,0.00018377526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009800672,0.00047825085,0.00042436345,0.00054303044,0.00029434505,0.0007449984,0.00297632,0.0001790648,0.00005549114],"category_scores_gemma":[0.000054752065,0.00036940994,0.00006514035,0.0005818865,0.00096490065,0.00055152015,0.0009201695,0.00073831016,0.0001903931],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002099426,0.00007094045,0.0006495933,0.0000903767,0.000032880507,0.00012330753,0.001462357,0.009264268,0.00017416892,0.10494298,0.00035457857,0.8828136],"study_design_scores_gemma":[0.0014480208,0.0013213813,0.00091786485,0.0014179689,0.00003865954,0.00053658884,4.934169e-7,0.72592634,0.0011940129,0.21282795,0.052101582,0.002269127],"about_ca_topic_score_codex":0.000041568182,"about_ca_topic_score_gemma":0.00022934141,"teacher_disagreement_score":0.8805444,"about_ca_system_score_codex":0.00018749856,"about_ca_system_score_gemma":0.0006108452,"threshold_uncertainty_score":0.9998758},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014463734,0.0006046028,0.9586045,0.0010975429,0.0038971694,0.00032204247,0.0000055312153,0.00021017567,0.035243966],"genre_scores_gemma":[0.019577611,0.000093447874,0.9740867,0.003202776,0.0012447883,0.000017856364,0.000012221175,0.00004508602,0.001719537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953669,0.000055261346,0.00045178717,0.0019594752,0.0011669531,0.0009996317],"domain_scores_gemma":[0.99534935,0.00031661463,0.00041450615,0.0035091848,0.00018296402,0.00022740776],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010171679,0.0005856559,0.0006374775,0.0005643409,0.0006544285,0.0019599434,0.010135844,0.00043067598,0.0000131821025],"category_scores_gemma":[0.00013304563,0.00048949354,0.00017185215,0.00055347,0.0009078247,0.001100202,0.002972413,0.00099344,0.00017682518],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017514718,0.000028146971,0.000035888603,0.00002744497,0.0000064391293,0.00022718143,0.000410863,0.0054862066,0.000003457098,0.0020931684,0.0013169837,0.99036247],"study_design_scores_gemma":[0.0003041964,0.00018283592,0.00038167287,0.00033314695,0.000006483484,0.00013723428,3.4094537e-8,0.67455834,0.0000938116,0.2995231,0.023531822,0.00094732165],"about_ca_topic_score_codex":0.00003216463,"about_ca_topic_score_gemma":0.000050417137,"teacher_disagreement_score":0.98941517,"about_ca_system_score_codex":0.00042956695,"about_ca_system_score_gemma":0.0017513641,"threshold_uncertainty_score":0.9997557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000120165,0.0001429294,0.9866018,0.0029758927,0.002039348,0.00046649764,0.000002491665,0.00016914673,0.007589856],"genre_scores_gemma":[0.13204089,0.00024296982,0.8616271,0.0019948147,0.0010879738,0.000053127886,0.0000036381787,0.00007042769,0.002879038],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720234,0.000037904363,0.00042850996,0.0010323626,0.00072923675,0.0005696419],"domain_scores_gemma":[0.99760187,0.0006751978,0.00029793163,0.0009716614,0.0003114853,0.00014188186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080069224,0.00037026498,0.00027400907,0.00037163237,0.0005723042,0.0008388644,0.0019782924,0.00022537906,0.000026385507],"category_scores_gemma":[0.00013659362,0.00023849879,0.000105151055,0.0003923131,0.0017440512,0.00054467935,0.00071825326,0.0005911159,0.000052697058],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001600548,0.0000042860493,0.000021451346,0.0000034207717,0.000006901614,0.000013898441,0.00019765666,0.0007714549,0.00001871779,0.12678435,0.000005224159,0.87217104],"study_design_scores_gemma":[0.0010752054,0.00039278847,0.00044880467,0.0011011235,0.000022430799,0.00046196967,0.0000026533464,0.34941697,0.0013819356,0.603722,0.039703835,0.0022702732],"about_ca_topic_score_codex":0.0000049703076,"about_ca_topic_score_gemma":0.00008410879,"teacher_disagreement_score":0.86990076,"about_ca_system_score_codex":0.00031493412,"about_ca_system_score_gemma":0.00074152224,"threshold_uncertainty_score":0.9725698},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012912645,0.000014672181,0.9844971,0.0003804352,0.0008679737,0.0004939825,0.000009935229,0.00012960931,0.00069369934],"genre_scores_gemma":[0.57576054,0.000008439096,0.41064212,0.010361801,0.000925193,0.000027828748,0.0000073287606,0.00012609559,0.002140677],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970712,0.00006282907,0.00034293742,0.0013331088,0.00076281035,0.00042711888],"domain_scores_gemma":[0.9985005,0.00029264696,0.00034253395,0.0006025134,0.00013607975,0.00012572113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004080133,0.00037331917,0.0002774228,0.00048648947,0.00038881545,0.0003001526,0.0007066113,0.0001389699,0.000110192144],"category_scores_gemma":[0.00014635475,0.00031895158,0.00005767211,0.00056597975,0.0014924727,0.00036723478,0.00018033742,0.00047851968,0.00007967495],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018464557,0.0002181408,0.00040605298,0.00015655685,0.000012142569,0.00032266797,0.005328722,0.02286264,0.64455134,0.00074538135,0.00007672015,0.325135],"study_design_scores_gemma":[0.00088106946,0.00037865492,0.00031429855,0.00042163802,0.000016446687,0.0007235256,0.0000025312524,0.73862803,0.25292462,0.0037663493,0.0010695871,0.0008732417],"about_ca_topic_score_codex":0.000016272685,"about_ca_topic_score_gemma":0.00016372642,"teacher_disagreement_score":0.7157654,"about_ca_system_score_codex":0.00035960812,"about_ca_system_score_gemma":0.000300279,"threshold_uncertainty_score":0.99992627},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013925397,0.0004236375,0.996463,0.000490689,0.0009553129,0.00037679798,0.000009478138,0.00073600595,0.00040584622],"genre_scores_gemma":[0.009257519,0.00008795694,0.989413,0.00074530987,0.00028583486,0.000019502699,0.000003840975,0.00003942053,0.00014756959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967208,0.000024424902,0.00042617216,0.0015279423,0.000745175,0.00055549166],"domain_scores_gemma":[0.9970145,0.00015509222,0.00010281518,0.0022486912,0.0002732222,0.00020565758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006121177,0.0005391438,0.00044591713,0.001148882,0.00029416961,0.0006535863,0.0039682146,0.00034533124,0.000022782922],"category_scores_gemma":[0.000034392022,0.00051214907,0.00010427397,0.00065515004,0.0009890996,0.0007463687,0.0023314361,0.00065565266,0.000017122999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024432165,0.000029629551,0.0000613839,0.00005051425,0.000025437354,0.00007358362,0.0014627201,0.018679619,0.00018149945,0.52227,0.00043588606,0.45672724],"study_design_scores_gemma":[0.00019620717,0.0002336962,0.000119962584,0.00035329512,0.000009590253,0.00011591851,2.9913057e-8,0.35339463,0.0013591063,0.63810694,0.0052174637,0.0008931591],"about_ca_topic_score_codex":0.000032122,"about_ca_topic_score_gemma":0.0001239397,"teacher_disagreement_score":0.4558341,"about_ca_system_score_codex":0.0001169539,"about_ca_system_score_gemma":0.00023830561,"threshold_uncertainty_score":0.99973303},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008060712,0.00051159144,0.984225,0.0011246396,0.00063502206,0.0004839437,0.00000396437,0.00022227567,0.004732895],"genre_scores_gemma":[0.9576324,0.00006722553,0.03541804,0.0032193146,0.0023765552,0.000004792667,0.000019245668,0.000042033345,0.0012203674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981313,0.000008783726,0.0003120774,0.00061908783,0.00064583175,0.00028292887],"domain_scores_gemma":[0.99886364,0.000105836705,0.00013761413,0.00048525562,0.00025151626,0.00015613872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036353228,0.00025681462,0.00036315963,0.0003953069,0.000104498344,0.000069513975,0.0002946932,0.00034897804,0.00058415695],"category_scores_gemma":[0.00008553526,0.00020145676,0.00010896288,0.00020516731,0.000533124,0.00011255776,0.00016599183,0.00052012654,0.00007258078],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036630916,0.00013276323,0.0013189316,0.00018948573,0.00003413441,0.00064142176,0.00050891546,0.0015801718,0.00069553405,0.004059205,0.00068982464,0.9897833],"study_design_scores_gemma":[0.004097295,0.007563574,0.011917205,0.0053443075,0.00021045844,0.0024792303,8.7304846e-7,0.3788088,0.036426347,0.23560046,0.3147216,0.0028298544],"about_ca_topic_score_codex":0.000015079562,"about_ca_topic_score_gemma":0.000009817971,"teacher_disagreement_score":0.98695344,"about_ca_system_score_codex":0.00017568925,"about_ca_system_score_gemma":0.00024147506,"threshold_uncertainty_score":0.8215168},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013866742,0.0035260092,0.9774392,0.00020798387,0.0014685092,0.0012840763,0.00012715242,0.0000150308315,0.0020652704],"genre_scores_gemma":[0.6481153,0.0009336965,0.33547997,0.0019924873,0.0067775585,0.00016171721,0.00015339955,0.00021744904,0.006168461],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977982,0.000012286817,0.000335909,0.0011163703,0.00022743354,0.0005098066],"domain_scores_gemma":[0.9986935,0.00008206525,0.00017711618,0.00067553355,0.00027076976,0.00010096122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033126137,0.00042452198,0.00037029068,0.00016228016,0.00018442197,0.00009276217,0.00086546736,0.00034001257,0.00002499523],"category_scores_gemma":[0.00007887938,0.0003947188,0.0001350412,0.00008717431,0.000795378,0.0000015117877,0.0006147737,0.00015067255,0.000025656194],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000764782,0.00007319026,0.00033808112,0.00014201096,0.00016945372,0.0000061244773,0.0005995674,0.016737832,0.51082015,0.00006681227,0.0013848172,0.46958548],"study_design_scores_gemma":[0.0040663774,0.009652757,0.0017737503,0.0009629845,0.00023862238,0.00014559049,0.0000016220474,0.117611244,0.3687991,0.08243523,0.407539,0.006773699],"about_ca_topic_score_codex":0.000007719503,"about_ca_topic_score_gemma":0.000049315717,"teacher_disagreement_score":0.64195925,"about_ca_system_score_codex":0.000044850825,"about_ca_system_score_gemma":0.00034119864,"threshold_uncertainty_score":0.99985045},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016206732,0.00013005333,0.9794705,0.00096291135,0.0025315913,0.00045386943,0.0000018293905,0.00018231789,0.000060216455],"genre_scores_gemma":[0.4508146,0.0000028346205,0.54865736,0.00031951637,0.00018164612,0.000011411825,0.0000011941324,0.0000106204125,8.0249487e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959724,0.00013685742,0.00038952805,0.0018204047,0.0009087244,0.00077208],"domain_scores_gemma":[0.99714124,0.0005419701,0.00028946914,0.001675366,0.00018764725,0.00016428322],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011929948,0.00042680075,0.00051043165,0.00055966026,0.00019589033,0.0010620345,0.0036765584,0.00022157516,0.000003752245],"category_scores_gemma":[0.000112217225,0.00032595085,0.00009230656,0.0021777628,0.00024759572,0.00057627313,0.0034313751,0.0010452495,0.000022005734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028507652,0.000024995374,0.003447001,0.00003295982,0.0000051113193,0.000017713122,0.0003730329,0.33286217,0.000314886,0.00060561777,0.0000013918565,0.66231227],"study_design_scores_gemma":[0.00019181802,0.00014555715,0.011035501,0.0002468911,0.000004078364,0.000035195404,1.9537353e-7,0.9263389,0.0038330187,0.057640716,0.000033362194,0.0004947505],"about_ca_topic_score_codex":0.0000921751,"about_ca_topic_score_gemma":0.000022245338,"teacher_disagreement_score":0.66181755,"about_ca_system_score_codex":0.0002596411,"about_ca_system_score_gemma":0.00056742056,"threshold_uncertainty_score":0.99997497},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023996818,0.00014503633,0.99361485,0.00016808983,0.0020855744,0.0004873924,0.000006974411,0.0001829204,0.00090945273],"genre_scores_gemma":[0.5843881,0.000004276527,0.4137415,0.0005316181,0.0007229808,0.000008750678,0.000012854079,0.000035275247,0.0005546998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536884,0.000048341954,0.0007247357,0.0018851212,0.0011400821,0.0008329041],"domain_scores_gemma":[0.996722,0.0010696957,0.0004774062,0.0008735222,0.00068396743,0.00017342989],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018619646,0.0006134262,0.0007032817,0.0007228083,0.00043855616,0.0007205751,0.003644259,0.0003724199,0.00009775777],"category_scores_gemma":[0.00027921755,0.0005073935,0.0003474653,0.00052691274,0.0005502567,0.00050558354,0.0009931822,0.00059845985,0.000042607215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002461401,0.00009109475,0.00009653361,0.00012923333,0.0001376816,0.000046619432,0.0076396437,0.036127593,0.00016642724,0.21537212,0.00032798227,0.73984045],"study_design_scores_gemma":[0.00022215287,0.00031802975,0.000023510727,0.00023696572,0.000021829004,0.0000106272,4.846076e-7,0.9794949,0.00062193547,0.01769923,0.0007527502,0.00059753796],"about_ca_topic_score_codex":0.000008892325,"about_ca_topic_score_gemma":0.00011812761,"teacher_disagreement_score":0.94336736,"about_ca_system_score_codex":0.00030330283,"about_ca_system_score_gemma":0.0004948343,"threshold_uncertainty_score":0.99973774},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020691911,0.0001349984,0.98585945,0.001190838,0.0016105088,0.00050164363,0.0000071350014,0.00020133147,0.01028715],"genre_scores_gemma":[0.1380972,0.0002567382,0.8529008,0.0048331325,0.0009140396,0.00008192475,0.000103633196,0.00007925932,0.0027332606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967316,0.00004355932,0.0004775587,0.0013274534,0.00089946925,0.00052038365],"domain_scores_gemma":[0.99793935,0.00027983004,0.0003111513,0.00091335684,0.00038591548,0.00017039593],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006183131,0.00043440412,0.0003649897,0.0008290651,0.00024560886,0.0006815347,0.0018526034,0.00040052587,0.00021388974],"category_scores_gemma":[0.000112299655,0.00039445443,0.000104864266,0.00047726062,0.00033332108,0.0015125317,0.00079218415,0.00065324025,0.0013430706],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020706043,0.000021645481,0.0000022794886,0.000023441078,0.0000045687607,0.000024455501,0.0004936449,0.0011998641,0.0005949892,0.0023777578,0.00020352677,0.99505174],"study_design_scores_gemma":[0.00043306884,0.00022218458,0.000107296815,0.0010313359,0.0000113538235,0.00009713665,7.7089317e-7,0.54183364,0.0123764025,0.43939483,0.0033313397,0.0011606347],"about_ca_topic_score_codex":0.00003371369,"about_ca_topic_score_gemma":0.000025452999,"teacher_disagreement_score":0.9938911,"about_ca_system_score_codex":0.0002237388,"about_ca_system_score_gemma":0.00028199062,"threshold_uncertainty_score":0.99985075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019097782,0.00024994247,0.99748987,0.00019549966,0.000578137,0.0003440404,0.0000126066425,0.000579783,0.0003591447],"genre_scores_gemma":[0.12393642,0.000082626204,0.8754678,0.00026441357,0.00014146046,0.000010355454,0.000005854142,0.000022165823,0.00006890611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768054,0.000035660552,0.00040365578,0.0008740406,0.0006687285,0.00033737713],"domain_scores_gemma":[0.99797034,0.0001381658,0.00023580229,0.0011851826,0.00038152564,0.00008897876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007406737,0.0003459811,0.00038515232,0.00045803096,0.00018887487,0.00024972454,0.0018309809,0.00022502542,0.00000554085],"category_scores_gemma":[0.00002308705,0.00026448385,0.00007350276,0.00043170317,0.0010582254,0.00043550084,0.0011672834,0.00031435525,0.0000021180094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004357004,0.000024372717,0.000018144674,0.00009524051,0.00003293928,0.000026778831,0.0019009544,0.24696803,0.000408436,0.4551115,0.0005375761,0.2948717],"study_design_scores_gemma":[0.00008002446,0.00009262238,0.000026023361,0.00017846232,0.000010236989,0.000033967237,5.2194576e-8,0.89993364,0.0010334098,0.09810633,0.00025144883,0.0002537589],"about_ca_topic_score_codex":0.00009098565,"about_ca_topic_score_gemma":0.000037335074,"teacher_disagreement_score":0.6529656,"about_ca_system_score_codex":0.00011233636,"about_ca_system_score_gemma":0.00024451976,"threshold_uncertainty_score":0.99998075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018067405,0.000021444439,0.9926606,0.00014943683,0.0013753093,0.0003148703,0.0000098960645,0.00008711379,0.0035746263],"genre_scores_gemma":[0.6940022,0.00003033585,0.30440333,0.0006144693,0.00036025734,0.000004737343,0.00002161745,0.00003422962,0.000528848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961774,0.00004512055,0.00057382445,0.0008207684,0.0017828811,0.0006000212],"domain_scores_gemma":[0.9976371,0.00010906898,0.00022542806,0.001091886,0.0007029215,0.00023361527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014472938,0.00032821656,0.00039987484,0.0012077125,0.0002599746,0.00040548528,0.0030391768,0.0002398234,0.00010152229],"category_scores_gemma":[0.000074778916,0.00028746773,0.000114131886,0.0009026808,0.0011478538,0.0014100114,0.0015286525,0.00062291825,0.000051583913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052295334,0.00018343447,0.00051202794,0.0002204503,0.000036657402,0.000092655035,0.013991198,0.0025196443,0.00075598515,0.40570143,0.000047992977,0.57588625],"study_design_scores_gemma":[0.00078454067,0.0015078371,0.0008512296,0.0007980787,0.00001581147,0.00007650634,0.000009716329,0.77187884,0.018187333,0.20382255,0.0008976081,0.0011699348],"about_ca_topic_score_codex":0.00004568701,"about_ca_topic_score_gemma":0.000042452193,"teacher_disagreement_score":0.76935923,"about_ca_system_score_codex":0.0005469542,"about_ca_system_score_gemma":0.00074861856,"threshold_uncertainty_score":0.99995774},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002290706,0.00043966307,0.99456096,0.000042770866,0.0016213859,0.00033882147,0.0000020284858,0.00034143787,0.00036220977],"genre_scores_gemma":[0.32345828,0.00003675932,0.67590797,0.00007071578,0.00044685006,0.0000054622287,2.0143216e-7,0.000028783996,0.00004497053],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968606,0.000028522247,0.0005595265,0.0011747937,0.00087932224,0.0004972382],"domain_scores_gemma":[0.99744755,0.00012170857,0.00043920797,0.001335836,0.000549763,0.00010591449],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059213396,0.00043438064,0.0005138859,0.0008392145,0.00020474262,0.00019718715,0.002709679,0.0002920803,0.0000103971015],"category_scores_gemma":[0.00010603726,0.00040396934,0.00011710644,0.00060419436,0.0010521654,0.0009007413,0.0016350792,0.00059209217,0.000007761489],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021099628,0.00006451793,0.00023809055,0.00027958493,0.00002973094,0.000069545174,0.005246746,0.014690879,0.015466939,0.003519294,0.000004656941,0.96036893],"study_design_scores_gemma":[0.00014080376,0.00031670782,0.000029380328,0.0015204415,0.000008894664,0.00009488511,6.9291497e-7,0.21366745,0.5516108,0.23142743,0.0004080399,0.00077441],"about_ca_topic_score_codex":0.000026525871,"about_ca_topic_score_gemma":0.0000100392235,"teacher_disagreement_score":0.9595945,"about_ca_system_score_codex":0.00035788247,"about_ca_system_score_gemma":0.00035531013,"threshold_uncertainty_score":0.9998412},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017666132,0.00078957604,0.9964397,0.00013623152,0.00032597771,0.00029778213,0.000004915844,0.00003115755,0.00020802442],"genre_scores_gemma":[0.3850809,0.00006996228,0.6099807,0.0012104294,0.0031751222,0.000016856977,0.00006179107,0.00009722686,0.0003069797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977903,0.000020832973,0.00025920375,0.001057959,0.0002886091,0.0005830975],"domain_scores_gemma":[0.9983872,0.000084241365,0.00020584028,0.00100714,0.00018125724,0.00013427985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004760076,0.0003935054,0.0003567375,0.00017464258,0.00020693729,0.00014793807,0.0008847467,0.0005244597,0.000014970743],"category_scores_gemma":[0.000037949096,0.00034431161,0.00015138311,0.00019055017,0.0007475411,0.000006115633,0.00036317934,0.00030441486,0.000003034668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020547936,0.00005117418,0.00044722232,0.00008488784,0.00026239938,0.000029150655,0.0002436276,0.7668817,0.002634397,0.001771589,0.0004929465,0.22689539],"study_design_scores_gemma":[0.0006003427,0.0012812462,0.000145468,0.0008187555,0.0001539543,0.00013126431,5.271262e-7,0.89944685,0.00928894,0.07390325,0.012840976,0.0013884441],"about_ca_topic_score_codex":0.0000028936072,"about_ca_topic_score_gemma":0.000065031774,"teacher_disagreement_score":0.386459,"about_ca_system_score_codex":0.00008809017,"about_ca_system_score_gemma":0.00031412992,"threshold_uncertainty_score":0.9999009},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12592086,0.00023772745,0.87004924,0.00046472234,0.0029029488,0.00027334402,0.0000068343543,0.00009951992,0.000044819455],"genre_scores_gemma":[0.5542218,0.000009246137,0.44520056,0.00033297975,0.00021525136,0.0000057425227,0.000008042255,0.0000059827485,3.8537993e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963832,0.00020481953,0.0005916777,0.0013240745,0.0010002069,0.0004960241],"domain_scores_gemma":[0.9971024,0.0006000766,0.0003964121,0.0012271468,0.00052827195,0.00014569047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001972291,0.00034959803,0.000461828,0.0011463203,0.00020827187,0.00040866315,0.0030844556,0.00022929584,0.000008234529],"category_scores_gemma":[0.00030895046,0.00034008114,0.00013246539,0.002477317,0.0006584433,0.00046072877,0.0019988504,0.00055434485,0.000010625236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032821034,0.000219195,0.005019468,0.00023052364,0.00003705362,0.00004732364,0.0022442078,0.57813644,0.0045110118,0.011472508,0.00006984025,0.39797962],"study_design_scores_gemma":[0.00017784155,0.0001049759,0.0066633685,0.00020635875,0.0000052347305,0.00004353263,2.0900745e-7,0.7459452,0.020616649,0.22588292,0.000026014271,0.0003276695],"about_ca_topic_score_codex":0.00015363097,"about_ca_topic_score_gemma":0.000032601398,"teacher_disagreement_score":0.42830095,"about_ca_system_score_codex":0.00013072508,"about_ca_system_score_gemma":0.0009084331,"threshold_uncertainty_score":0.9999051},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003871752,0.0014712332,0.99417686,0.00062268384,0.0013371619,0.0006295621,0.000043268723,0.0002615445,0.0014538285],"genre_scores_gemma":[0.017952291,0.00042782773,0.9766186,0.0020655952,0.00065562973,0.00007574978,0.00017229437,0.00008566406,0.0019463598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957954,0.000046157285,0.00053642876,0.0013728157,0.0011930987,0.001056049],"domain_scores_gemma":[0.9973608,0.0002802437,0.00025412356,0.0013721302,0.0003207329,0.00041195322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009182227,0.00054141006,0.00050545967,0.00050063693,0.00031444657,0.00068381,0.0035472545,0.00037364158,0.00009281217],"category_scores_gemma":[0.000053103773,0.0004917409,0.00013451312,0.000781526,0.0005639478,0.0010605439,0.0015535045,0.0008328705,0.00012908349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023932835,0.000074255564,0.000039608673,0.000029591403,0.00001340039,0.000022051665,0.00040562218,0.11983072,0.00008541461,0.0075438414,0.0008004976,0.8711526],"study_design_scores_gemma":[0.00035330097,0.00020180577,0.000018929044,0.00014739048,0.000006437098,0.00003312735,1.6186125e-7,0.93452173,0.0010427607,0.030310104,0.032472637,0.0008916314],"about_ca_topic_score_codex":0.000016043676,"about_ca_topic_score_gemma":0.000012738046,"teacher_disagreement_score":0.87026095,"about_ca_system_score_codex":0.00031914577,"about_ca_system_score_gemma":0.00037778157,"threshold_uncertainty_score":0.9997534},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026536227,0.00026629187,0.9957481,0.00021878786,0.0024535747,0.0003118203,0.000002975713,0.00013535896,0.00059771916],"genre_scores_gemma":[0.16997352,0.000013216576,0.8281757,0.00064224174,0.0010377276,0.0000024163814,0.0000032085945,0.000035979792,0.00011598018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963677,0.0000617754,0.00051184057,0.0015415037,0.0008054178,0.0007117939],"domain_scores_gemma":[0.9976575,0.0004346631,0.00035572812,0.0009996801,0.00038644942,0.00016598805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079855486,0.0005285319,0.00048299553,0.0006752187,0.0005097031,0.0008507507,0.002091486,0.00029147143,0.000036332487],"category_scores_gemma":[0.00016333778,0.0004982229,0.00015280931,0.00061405584,0.00075499935,0.0010945511,0.0010353072,0.00046602997,0.00004657723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049557743,0.000016378915,0.00006163413,0.0000165385,0.000017796308,0.000045426346,0.0011342679,0.73298526,0.0009647235,0.000587188,0.00005032349,0.2641155],"study_design_scores_gemma":[0.00018499898,0.00008545932,0.000046488272,0.00024106543,0.000011267953,0.000036653706,3.2373822e-7,0.95820695,0.0032386403,0.037009522,0.00039625657,0.00054236123],"about_ca_topic_score_codex":0.00005664077,"about_ca_topic_score_gemma":0.0001251916,"teacher_disagreement_score":0.26357314,"about_ca_system_score_codex":0.00043053235,"about_ca_system_score_gemma":0.0005729879,"threshold_uncertainty_score":0.9997469},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17986798,0.0003700226,0.81870323,0.00011978352,0.00029198485,0.00021104072,0.000015057794,0.000050908548,0.00036999802],"genre_scores_gemma":[0.9648712,0.000027630776,0.034493033,0.00003299432,0.00048126664,0.0000012475572,0.000006430665,0.000012031367,0.00007412954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984777,0.000025093765,0.00025972904,0.00046772053,0.00053254684,0.00023721845],"domain_scores_gemma":[0.9990665,0.000257993,0.00016121186,0.00020895564,0.0002288102,0.000076572214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007892096,0.00018280203,0.00028251504,0.0003231673,0.00034561806,0.00009929305,0.00031477754,0.00023234673,0.000029835815],"category_scores_gemma":[0.0001437649,0.00018342161,0.00007077618,0.000349518,0.001019501,0.00023061656,0.000022490467,0.0002696608,4.0468234e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036625708,0.000048380345,0.0067778537,0.00048172515,0.00008335431,0.00002952807,0.11496359,0.6941389,0.0056763515,0.009874347,0.0000040771056,0.16788527],"study_design_scores_gemma":[0.00019080818,0.00008419951,0.0014181635,0.0009113071,0.000104838015,0.000004181537,0.00005101557,0.97901106,0.0021764925,0.015094105,0.00041561198,0.00053822284],"about_ca_topic_score_codex":0.001187268,"about_ca_topic_score_gemma":0.007735592,"teacher_disagreement_score":0.78500324,"about_ca_system_score_codex":0.00013929831,"about_ca_system_score_gemma":0.00037896555,"threshold_uncertainty_score":0.7479716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09761716,0.0007236936,0.8958563,0.0006528276,0.0019452291,0.0026601073,0.00002635394,0.00011014668,0.00040815977],"genre_scores_gemma":[0.96373785,0.0017004334,0.032450862,0.00035626334,0.0014924261,0.000041233303,0.000017519485,0.00003415809,0.00016925795],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99640965,0.00023219989,0.0011051721,0.0010413058,0.00084624114,0.00036541888],"domain_scores_gemma":[0.9966084,0.0022094438,0.000310511,0.00041383458,0.00028340315,0.00017445812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00652423,0.0003008442,0.00085753604,0.00081522996,0.00020536919,0.000100202364,0.00020659632,0.0003751206,0.00006345671],"category_scores_gemma":[0.004831458,0.00024155449,0.0001252536,0.00032183636,0.0011859349,0.00017052876,0.00035217073,0.000751748,0.000021158196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023586157,0.00005881371,0.020330276,0.00007256587,0.00002649694,0.0000071172835,0.00045469316,0.00023243492,0.009658892,0.0000033822084,0.00005534467,0.96886414],"study_design_scores_gemma":[0.009719202,0.0029630768,0.57094836,0.0049679433,0.00012270523,0.00004721486,0.0000070691835,0.37935945,0.025794761,0.004138439,0.0011273428,0.0008044086],"about_ca_topic_score_codex":0.000057589088,"about_ca_topic_score_gemma":0.0006769383,"teacher_disagreement_score":0.9680597,"about_ca_system_score_codex":0.00035449103,"about_ca_system_score_gemma":0.00020134645,"threshold_uncertainty_score":0.9850306},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009234127,0.00033720687,0.996869,0.00019991226,0.0006045212,0.0007095616,0.000018134124,0.000023168499,0.00031503185],"genre_scores_gemma":[0.94446373,0.0000718333,0.054981492,0.000119977914,0.00028546632,0.00002840978,0.00000816151,0.000013639169,0.000027264648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967502,0.00006628486,0.0006432805,0.00089573994,0.0012461783,0.00039836392],"domain_scores_gemma":[0.9950239,0.00086943014,0.00023444048,0.0033941334,0.00043255274,0.0000455332],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0053583095,0.00019828108,0.00035040113,0.0007183674,0.00009666648,0.000096219715,0.007422696,0.00011314818,0.0000022408058],"category_scores_gemma":[0.00010832651,0.00013950221,0.000042066702,0.0012272291,0.00091776805,0.00037146732,0.0021805405,0.000525776,0.00001112112],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005486748,0.000059441794,0.00049144967,0.0003144991,0.000010323815,0.0000057487186,0.0036472117,0.0030834288,0.0001577963,0.0021355199,0.000037905622,0.9900512],"study_design_scores_gemma":[0.0008511225,0.0007421233,0.0025612228,0.0033961693,0.000012429885,0.000048029175,0.000007887291,0.8446259,0.006140271,0.12647626,0.014123926,0.001014687],"about_ca_topic_score_codex":0.00008811874,"about_ca_topic_score_gemma":0.0001129509,"teacher_disagreement_score":0.9890365,"about_ca_system_score_codex":0.00011448301,"about_ca_system_score_gemma":0.00047674438,"threshold_uncertainty_score":0.99794763},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08513855,0.0012577288,0.90950716,0.0016742677,0.0016089608,0.0005774281,0.000026858377,0.000022319833,0.00018675663],"genre_scores_gemma":[0.6945298,0.00070897327,0.29194802,0.0033521464,0.003896171,0.00012873735,0.00023013004,0.00008730749,0.005118757],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99818665,0.000054787488,0.00033668726,0.00080257864,0.00017538932,0.0004439167],"domain_scores_gemma":[0.99822694,0.00058344676,0.00039979792,0.00026939288,0.00047330812,0.00004713653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001098807,0.00027570405,0.0003672083,0.0003012788,0.00023825647,0.000046859135,0.00030705996,0.00040244433,0.000006124803],"category_scores_gemma":[0.002270572,0.00027455797,0.00011960901,0.00019526834,0.00013046546,0.000009982109,0.00021503851,0.00034850187,0.0000055796504],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029724115,0.00022866156,0.28550586,0.00028291566,0.0012593855,0.00001279224,0.004215138,0.23620544,0.26761767,0.000102088925,0.0078085437,0.19646427],"study_design_scores_gemma":[0.006108984,0.005360168,0.13500696,0.0011448106,0.0005436758,0.0002479205,0.00005465406,0.17212172,0.3047357,0.1444355,0.2227602,0.0074797203],"about_ca_topic_score_codex":0.000013277803,"about_ca_topic_score_gemma":0.0020822738,"teacher_disagreement_score":0.61755913,"about_ca_system_score_codex":0.00061545393,"about_ca_system_score_gemma":0.00020872035,"threshold_uncertainty_score":0.9999707},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23688939,0.00029165237,0.76019293,0.00048039918,0.0015647516,0.00033655297,0.0000012482087,0.0001864579,0.000056624314],"genre_scores_gemma":[0.6503358,0.000023717465,0.349106,0.00028208137,0.00021703777,0.000018567529,7.8899325e-7,0.000015331127,6.5248236e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949618,0.00020133561,0.0004528576,0.0023744162,0.00091252587,0.0010970524],"domain_scores_gemma":[0.99649566,0.00061221793,0.00022648634,0.0020599398,0.00031851322,0.00028717844],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024741841,0.00047536023,0.00048995577,0.0015325366,0.00041777003,0.0012390289,0.00491354,0.00030702248,0.0000057626257],"category_scores_gemma":[0.00042381033,0.00045408474,0.00008974568,0.0025544611,0.0011301006,0.0008233419,0.008288119,0.0016077799,0.000012085874],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013871047,0.000050285966,0.0045885188,0.00012383061,0.00001668474,0.00009945791,0.0041654636,0.018990437,0.005117228,0.0028447758,0.00000437762,0.9639851],"study_design_scores_gemma":[0.00022931227,0.0001541416,0.0049797925,0.00043007793,0.0000026053644,0.000063819905,8.951946e-7,0.5424814,0.031552378,0.41946384,0.000016714457,0.0006249763],"about_ca_topic_score_codex":0.000058295624,"about_ca_topic_score_gemma":0.000041527688,"teacher_disagreement_score":0.9633601,"about_ca_system_score_codex":0.0001729936,"about_ca_system_score_gemma":0.00051451946,"threshold_uncertainty_score":0.99979776},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28728053,0.00022223486,0.2934456,0.006136174,0.0052226754,0.0023210149,0.00024676128,0.00031367666,0.40481135],"genre_scores_gemma":[0.98822165,0.000058186164,0.009237612,0.0014435838,0.00017540218,2.525578e-7,0.0000101655805,0.0000043539817,0.0008487708],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844253,0.000026779497,0.0002957196,0.000222115,0.0006889645,0.00032387685],"domain_scores_gemma":[0.99893624,0.00010011303,0.00022917874,0.00022763263,0.00026833187,0.00023851468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079261133,0.00014264332,0.00020070218,0.001751976,0.0005137807,0.00050479546,0.0010849561,0.00013609746,0.00013367321],"category_scores_gemma":[0.00005219978,0.00014451121,0.000032677337,0.0007560326,0.0012463263,0.011235308,0.00027071105,0.00019522,0.000035807472],"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.00002128891,0.000022265778,0.028435854,0.00013121055,0.000024046929,0.00001762303,0.36459002,0.0009857399,0.000008798117,0.12763718,0.00059152,0.47753444],"study_design_scores_gemma":[0.00075509405,0.00020281995,0.05845454,0.0009691988,0.000017506327,0.000010793372,0.000108238644,0.035504907,0.00011498936,0.036875308,0.8658881,0.0010984774],"about_ca_topic_score_codex":0.009763825,"about_ca_topic_score_gemma":0.008932037,"teacher_disagreement_score":0.8652966,"about_ca_system_score_codex":0.00020203684,"about_ca_system_score_gemma":0.0009272037,"threshold_uncertainty_score":0.9968302},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043950838,0.000794129,0.9932405,0.0006172676,0.0025612225,0.00023642935,0.000002324467,0.00018891184,0.0019197479],"genre_scores_gemma":[0.09872966,0.000030055326,0.89684016,0.0016399907,0.0017376101,0.000016489546,0.00003825219,0.00003386337,0.0009339039],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645996,0.00004325704,0.00051055686,0.0014105453,0.0010682138,0.00050748134],"domain_scores_gemma":[0.9979417,0.00027843827,0.0002688428,0.00089278346,0.00043710365,0.00018114097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093072193,0.00042469794,0.0003701998,0.000847407,0.00049520377,0.0006078082,0.0018187752,0.0002532469,0.000116087576],"category_scores_gemma":[0.000114338494,0.00042263226,0.00014112674,0.00087370904,0.00061567716,0.0007062016,0.00076837733,0.00048409402,0.0001406941],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072462517,0.000036412057,0.000042652326,0.000032175532,0.000017080129,0.00006695274,0.0013511385,0.05305686,0.00034601908,0.053720623,0.00026901523,0.89105386],"study_design_scores_gemma":[0.00019428701,0.00025311598,0.0001001836,0.00025505605,0.000009086098,0.00009049973,1.6180519e-7,0.43801287,0.0017162953,0.541547,0.017132448,0.0006889976],"about_ca_topic_score_codex":0.00001617395,"about_ca_topic_score_gemma":0.00014028781,"teacher_disagreement_score":0.8903648,"about_ca_system_score_codex":0.00034750334,"about_ca_system_score_gemma":0.00063417986,"threshold_uncertainty_score":0.99982256},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002461302,0.0000636477,0.9911111,0.001516364,0.0016383495,0.00042824892,0.000028219296,0.0002586927,0.0047092596],"genre_scores_gemma":[0.026199223,0.00002895007,0.9681025,0.0043086014,0.00070030056,0.00003027364,0.00009518324,0.000048901406,0.00048604835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958131,0.00009845569,0.0006586906,0.0016385474,0.0011867944,0.00060442014],"domain_scores_gemma":[0.9968384,0.0005798704,0.00044609644,0.0012527088,0.0006856438,0.00019729264],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014509931,0.0005134855,0.00046275827,0.00091836543,0.00036173387,0.00073576806,0.002220164,0.00041356214,0.00026057803],"category_scores_gemma":[0.00024960565,0.00047786205,0.0001624405,0.000612948,0.00081790634,0.001093033,0.0006346104,0.00062341214,0.00087280956],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021404112,0.00010165522,0.000008884605,0.00013322696,0.000014317699,0.00008990396,0.0015524734,0.0013452835,0.0036911345,0.002070458,0.00053222466,0.99043906],"study_design_scores_gemma":[0.00084909104,0.00037617184,0.00010497007,0.0014203866,0.000016799488,0.000043552376,0.0000014634456,0.6632117,0.03222651,0.296964,0.0031698367,0.0016155218],"about_ca_topic_score_codex":0.000027034412,"about_ca_topic_score_gemma":0.00005225319,"teacher_disagreement_score":0.98882353,"about_ca_system_score_codex":0.000248063,"about_ca_system_score_gemma":0.00058805157,"threshold_uncertainty_score":0.9999051},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052701234,0.00006857871,0.99166864,0.00033286004,0.0016511311,0.0013032793,2.8250972e-7,0.0005149077,0.003933328],"genre_scores_gemma":[0.37545514,0.000032289496,0.6200158,0.0019241554,0.00056381215,0.00007292929,0.000013523907,0.000100645986,0.001821696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934533,0.0000759116,0.0010953454,0.0020577183,0.0018943448,0.0014233433],"domain_scores_gemma":[0.9969941,0.00046677163,0.0004743441,0.0013312083,0.0003742391,0.0003593373],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018079143,0.00080245914,0.0007600332,0.0022533839,0.00037574724,0.0011652082,0.004029999,0.00042813708,0.00006819616],"category_scores_gemma":[0.00039726138,0.0007939676,0.0001802622,0.0019443167,0.0005908401,0.0007252152,0.0028243603,0.0015645768,0.00022840315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008814852,0.000021200898,0.00014535457,0.000028695324,0.000009050403,0.000058428184,0.0013750596,0.760992,0.000052384985,0.0029051816,0.000013336374,0.23439051],"study_design_scores_gemma":[0.00039899984,0.0011879912,0.00012356103,0.0008740992,0.0000069062644,0.00002294433,8.7734475e-7,0.98320544,0.00045951147,0.009454544,0.003327713,0.0009374351],"about_ca_topic_score_codex":0.000033937944,"about_ca_topic_score_gemma":0.00005289411,"teacher_disagreement_score":0.37492815,"about_ca_system_score_codex":0.000708014,"about_ca_system_score_gemma":0.00057207426,"threshold_uncertainty_score":0.9998717},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001618884,0.00034813912,0.99661505,0.00050280755,0.00088825246,0.00032964093,0.000016948508,0.00008958577,0.0010477086],"genre_scores_gemma":[0.47238603,0.00013587659,0.52504295,0.00040422982,0.00088626903,0.00006182714,0.0000709028,0.000051116196,0.0009607987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969285,0.00004689631,0.00068095454,0.0011265585,0.0008321583,0.00038493445],"domain_scores_gemma":[0.99777836,0.00028688207,0.00034798693,0.0010770318,0.00040999192,0.00009977259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059019116,0.0003281921,0.00040991823,0.0007070873,0.00019780686,0.00007074326,0.0018867363,0.0002664024,0.000032419208],"category_scores_gemma":[0.00009079636,0.00033267014,0.0000892513,0.0009734667,0.0012032028,0.0007340612,0.0008556688,0.0003351846,0.00001958667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025282927,0.00043731066,0.0009080561,0.00010320646,0.00002017431,0.00003468924,0.0069366456,0.08418442,0.00042324432,0.639776,0.0008546251,0.2662964],"study_design_scores_gemma":[0.00026281687,0.00021539179,0.0019024456,0.00022765931,0.000004398112,0.000021721073,8.544054e-7,0.7671322,0.0003813952,0.22574127,0.0036507868,0.0004590309],"about_ca_topic_score_codex":0.00007751067,"about_ca_topic_score_gemma":0.0001560125,"teacher_disagreement_score":0.6829478,"about_ca_system_score_codex":0.00060838676,"about_ca_system_score_gemma":0.00059396104,"threshold_uncertainty_score":0.99991256},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012364237,0.00032400817,0.96827555,0.00072033296,0.0018545308,0.00032348448,0.000051336752,0.00011667567,0.028210467],"genre_scores_gemma":[0.36762723,0.00004241614,0.62146324,0.0029988573,0.0018093875,0.000027635255,0.000060580303,0.00010398996,0.005866648],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619234,0.00003967543,0.00065887324,0.0012048605,0.0011817261,0.0007225395],"domain_scores_gemma":[0.996479,0.0008012464,0.0005027074,0.0017814949,0.00028087388,0.00015469313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007980611,0.00051126175,0.00056398264,0.00033108832,0.00032471842,0.00060005125,0.005362847,0.00021879324,0.00035187168],"category_scores_gemma":[0.00008628385,0.00036518538,0.0002260112,0.00065319816,0.0023836687,0.0005985219,0.0024768012,0.00065983506,0.00009190771],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005394958,0.00006767236,0.00005842847,0.000052524894,0.000034365934,0.000035046596,0.0016843172,0.0027749897,0.0000458447,0.05930221,0.003174903,0.9327643],"study_design_scores_gemma":[0.0004607188,0.00056108844,0.00044989388,0.0014750643,0.00003941032,0.00021347839,0.0000024956541,0.30633396,0.0067835986,0.54577684,0.13618693,0.0017165227],"about_ca_topic_score_codex":0.000051354957,"about_ca_topic_score_gemma":0.00018384906,"teacher_disagreement_score":0.9310478,"about_ca_system_score_codex":0.00011330384,"about_ca_system_score_gemma":0.00058357976,"threshold_uncertainty_score":0.99988},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028050878,0.00020744186,0.9922198,0.00022130061,0.005261782,0.00046941717,0.0000057198818,0.000118390584,0.0014681136],"genre_scores_gemma":[0.035108294,0.000047006186,0.95847046,0.0010455681,0.0050519337,0.000006577072,0.000012858889,0.000053370644,0.00020392826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959443,0.00010530686,0.000584304,0.0017630452,0.0008112586,0.00079179154],"domain_scores_gemma":[0.9972862,0.0003082024,0.00043575602,0.0011501343,0.0006241553,0.00019556822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086025574,0.0006520543,0.00061887625,0.00056510716,0.0005847841,0.0009613112,0.0023717782,0.0004334849,0.0001123155],"category_scores_gemma":[0.00011644364,0.0006108894,0.00017064225,0.00079419237,0.0011118299,0.0012987145,0.0013845927,0.00061385566,0.000042912525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021720725,0.000034091237,0.000013867016,0.000013026383,0.0000443795,0.00008615198,0.0008871901,0.87537223,0.0014738045,0.0047725993,0.00031686385,0.11696407],"study_design_scores_gemma":[0.00027140373,0.00016591944,0.000011903256,0.0001408897,0.000018343888,0.00002285559,1.9701724e-7,0.9668376,0.0017992283,0.029333444,0.00074972154,0.0006484912],"about_ca_topic_score_codex":0.000024396919,"about_ca_topic_score_gemma":0.00007025004,"teacher_disagreement_score":0.11631558,"about_ca_system_score_codex":0.0004526522,"about_ca_system_score_gemma":0.00064246723,"threshold_uncertainty_score":0.99963427},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004184164,0.00015860559,0.9932023,0.00031466578,0.00081962143,0.00046311883,0.000007716557,0.0002950186,0.0046970765],"genre_scores_gemma":[0.039456066,0.00003413511,0.9593663,0.00044199324,0.0002639585,0.000010743422,0.00001065498,0.000026503314,0.00038963094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960911,0.000066821,0.00079096307,0.0013009624,0.0012476962,0.00050241285],"domain_scores_gemma":[0.99661976,0.0002402616,0.0006065025,0.0016950299,0.0007407548,0.000097699536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012559819,0.00043832613,0.00053684553,0.0008634062,0.00015919832,0.00020847986,0.0032503286,0.00030911333,0.00013540997],"category_scores_gemma":[0.00014473099,0.00043396585,0.00012155397,0.0007280294,0.0013762453,0.0011326355,0.0017877738,0.0004640628,0.000028718941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109704226,0.00054505595,0.00053160114,0.00068592886,0.00010417076,0.00015907429,0.0043050908,0.15050259,0.014052833,0.068168476,0.0018724074,0.75896305],"study_design_scores_gemma":[0.0002834597,0.00027043157,0.00034702808,0.00043790412,0.000006546139,0.000023588358,1.8365486e-7,0.84915394,0.023176113,0.12522231,0.000332621,0.0007458752],"about_ca_topic_score_codex":0.00003286283,"about_ca_topic_score_gemma":0.000013537736,"teacher_disagreement_score":0.7582172,"about_ca_system_score_codex":0.00035071463,"about_ca_system_score_gemma":0.00051882386,"threshold_uncertainty_score":0.99981123},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019638956,0.000069045,0.9785361,0.00007936644,0.0010885028,0.00013580268,0.0000108457625,0.00009114084,0.0003502402],"genre_scores_gemma":[0.9096503,0.000041999363,0.089762524,0.00024146108,0.0002501727,0.000002973469,0.000010017104,0.0000151154345,0.000025420122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972142,0.000098241624,0.00046610972,0.0011724242,0.00069335516,0.00035564994],"domain_scores_gemma":[0.9975424,0.00045936133,0.00032599692,0.001303021,0.00024370027,0.00012552936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010915565,0.00030208117,0.0005186932,0.003247155,0.00018586307,0.00022562267,0.0018276458,0.00034443047,0.000060693277],"category_scores_gemma":[0.00013536817,0.00028469966,0.0001917454,0.003348617,0.00044745975,0.00066707446,0.00050208264,0.0006540593,0.000018777304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027595323,0.0002846687,0.06442215,0.00003698168,0.0001545612,0.00005544828,0.009697682,0.40966344,0.00017970169,0.002069502,0.000051428957,0.51335686],"study_design_scores_gemma":[0.0001607465,0.000369124,0.027552819,0.00010496143,0.00007703568,0.00000942256,4.134535e-7,0.9308759,0.00050342956,0.039733667,0.00023480982,0.0003776994],"about_ca_topic_score_codex":0.00027509322,"about_ca_topic_score_gemma":0.0023943046,"teacher_disagreement_score":0.89001137,"about_ca_system_score_codex":0.00026182877,"about_ca_system_score_gemma":0.0002317745,"threshold_uncertainty_score":0.99996054},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004736492,0.00010368906,0.9872818,0.0015654694,0.0018446537,0.0007157083,0.000009051076,0.00009872339,0.0036444247],"genre_scores_gemma":[0.8244362,0.00003481809,0.16835552,0.005910701,0.0009713399,0.000044252163,0.000015746402,0.00004628595,0.00018511953],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586433,0.000079803125,0.0006244074,0.0015774205,0.001053307,0.0008007508],"domain_scores_gemma":[0.99689776,0.0005740913,0.00028116876,0.0019352032,0.00019042926,0.000121364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016287151,0.00053011585,0.0004381303,0.0010401731,0.00043845407,0.00096116826,0.004406057,0.00025703973,0.00005618515],"category_scores_gemma":[0.00006673849,0.00041273536,0.00017059036,0.0011620376,0.0007858995,0.0004849739,0.0007729009,0.0007727307,0.00003379866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004699962,0.00038271325,0.000105699255,0.00009335251,0.000047345493,0.00024230125,0.03039538,0.0017661832,0.0007540861,0.39130995,0.00076427305,0.57409173],"study_design_scores_gemma":[0.0012655423,0.0014974377,0.00050365826,0.000600996,0.000020213642,0.0001430892,0.0000081164,0.33429408,0.0018167523,0.64824945,0.009834973,0.0017656741],"about_ca_topic_score_codex":0.00008369283,"about_ca_topic_score_gemma":0.00104063,"teacher_disagreement_score":0.8196997,"about_ca_system_score_codex":0.00023022694,"about_ca_system_score_gemma":0.00039146296,"threshold_uncertainty_score":0.99983245},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040711015,0.00032631532,0.9415758,0.0003188082,0.004289795,0.00035362015,0.000017912877,0.00011650107,0.048930112],"genre_scores_gemma":[0.94877064,0.000033622055,0.03755087,0.0008132961,0.007937783,0.0000044706508,0.000008418253,0.000058104622,0.004822776],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749106,0.000050080784,0.00033388985,0.00074656605,0.000826306,0.00055207463],"domain_scores_gemma":[0.9987931,0.00017772692,0.00021487098,0.0004115064,0.00026036063,0.00014241856],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009060681,0.00027055916,0.00028660515,0.00041249316,0.0008906829,0.0004628898,0.0010235115,0.00030129077,0.0019164162],"category_scores_gemma":[0.00018837214,0.00026121532,0.00016967602,0.00021681562,0.001652945,0.00027316847,0.00040715473,0.0005252527,0.00004798465],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000309776,0.0001390406,0.005550576,0.00013026666,0.00007996874,0.00012069258,0.042013817,0.0038198822,0.0008215687,0.013396624,0.001157737,0.93273884],"study_design_scores_gemma":[0.0016888464,0.0018894906,0.011813412,0.012279403,0.0004088663,0.0002215863,0.00010023513,0.2850858,0.008975432,0.5463772,0.12389117,0.0072685736],"about_ca_topic_score_codex":0.004826748,"about_ca_topic_score_gemma":0.008770549,"teacher_disagreement_score":0.9446996,"about_ca_system_score_codex":0.0003644635,"about_ca_system_score_gemma":0.00047608864,"threshold_uncertainty_score":0.999984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013555582,0.000091163354,0.9954824,0.00054530945,0.001572065,0.00062066875,0.00001799814,0.0002893413,0.0012454875],"genre_scores_gemma":[0.0067700413,0.000018972472,0.99136996,0.0011533718,0.00027197634,0.000017039176,0.000005460947,0.000045668574,0.0003475158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99550694,0.00010148867,0.0007334517,0.0016847423,0.0011628433,0.0008105512],"domain_scores_gemma":[0.9933064,0.0016341185,0.0003679535,0.004013125,0.00047740445,0.00020097072],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023668392,0.0006081124,0.0007294466,0.0007811519,0.00018940581,0.0001832853,0.008376983,0.0003035787,0.000010668126],"category_scores_gemma":[0.0018315576,0.00045766294,0.0001669153,0.0012576832,0.0016875505,0.0004420266,0.0040688403,0.00081033254,0.000033262768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040729046,0.000074430296,0.000030608117,0.00015350804,0.000051431565,0.00005621593,0.014425778,0.7470747,0.00055030594,0.023114996,0.0010196313,0.21340762],"study_design_scores_gemma":[0.0012380031,0.0026574044,0.00036142583,0.0014379736,0.00007205714,0.00040591697,0.000009182372,0.50148886,0.019785574,0.43448377,0.03406417,0.00399567],"about_ca_topic_score_codex":0.000009305651,"about_ca_topic_score_gemma":0.000013235295,"teacher_disagreement_score":0.41136876,"about_ca_system_score_codex":0.00026684598,"about_ca_system_score_gemma":0.00042208444,"threshold_uncertainty_score":0.9997875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002828173,0.000067680005,0.96819884,0.00028128538,0.0013169007,0.0011189563,0.0000024001672,0.00012813238,0.028602995],"genre_scores_gemma":[0.14304022,0.0000051110674,0.8536656,0.0026570181,0.0003973874,0.00005243647,0.000011959184,0.000021340495,0.0001489593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961862,0.00007746788,0.0004687374,0.0013964743,0.0013080454,0.0005630772],"domain_scores_gemma":[0.9967393,0.00019285195,0.00023567275,0.0020212387,0.0006054924,0.00020542655],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0030025276,0.00042749825,0.0004906804,0.00071311276,0.00030459958,0.0018629751,0.009781109,0.00025443864,0.000032770164],"category_scores_gemma":[0.00015509682,0.00035829027,0.000059943348,0.0006879085,0.00047301417,0.002318691,0.0031600178,0.00035432473,0.00012279108],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008819107,0.00004941104,0.000033477525,0.000024928608,0.000008752932,0.0000056346494,0.0055053923,0.029379064,0.000032214128,0.023136145,0.00008032082,0.94173586],"study_design_scores_gemma":[0.0002800628,0.00033667532,0.0005075649,0.00017855094,0.000008285833,0.000036288577,0.0000018092426,0.83326447,0.00089255016,0.16204289,0.0018261523,0.0006246956],"about_ca_topic_score_codex":0.0000483625,"about_ca_topic_score_gemma":0.0000771759,"teacher_disagreement_score":0.94111115,"about_ca_system_score_codex":0.00030410726,"about_ca_system_score_gemma":0.0009520686,"threshold_uncertainty_score":0.99988693},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054326234,0.000064753825,0.99430156,0.00034390937,0.0033207354,0.0008893295,0.00000810029,0.00023057364,0.0002977575],"genre_scores_gemma":[0.07078163,0.00001922233,0.9255303,0.0017834537,0.0006803243,0.000049927294,0.000014442455,0.000040217055,0.0011004732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967587,0.000035541034,0.00050802395,0.0014605684,0.0007126614,0.00052449794],"domain_scores_gemma":[0.9980803,0.00022095328,0.00032607492,0.0007941723,0.00043579694,0.00014271638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009472576,0.00041855936,0.0003789934,0.00063030503,0.00043501786,0.0005203473,0.0017570693,0.0002893165,0.00008141125],"category_scores_gemma":[0.000100910955,0.0003891312,0.00018039955,0.00044233567,0.00052009325,0.00070024544,0.0005316819,0.00035744315,0.00011139523],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016692942,0.00006650792,0.00003851093,0.000073880015,0.000015163965,0.000009070183,0.0012555984,0.00090686453,0.0023672197,0.002457551,0.000060211452,0.9927327],"study_design_scores_gemma":[0.00063810084,0.00046826343,0.0002791064,0.0001470228,0.0000093481,0.000028802517,4.4966416e-7,0.95283216,0.0069248113,0.037236355,0.00089590973,0.0005396635],"about_ca_topic_score_codex":0.000009127344,"about_ca_topic_score_gemma":0.00007665046,"teacher_disagreement_score":0.99219304,"about_ca_system_score_codex":0.0002953597,"about_ca_system_score_gemma":0.00032556828,"threshold_uncertainty_score":0.99985605},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000073743955,0.00045860774,0.9869769,0.0026326866,0.008005698,0.0006764779,0.00009495023,0.0002241513,0.0008567613],"genre_scores_gemma":[0.09296504,0.00007375393,0.89286005,0.00396452,0.008047879,0.00022106899,0.00003331989,0.000105149404,0.0017291966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958418,0.000051592782,0.000584872,0.0019076195,0.00073209754,0.00088204496],"domain_scores_gemma":[0.9968519,0.00045810835,0.0005640669,0.0012314151,0.0007292501,0.00016524584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000815161,0.0005261461,0.00050470757,0.00046670844,0.00051514065,0.0003422527,0.002663216,0.00035978694,0.00015209237],"category_scores_gemma":[0.00003909043,0.0005262097,0.00017056608,0.0005561364,0.0015674125,0.00080074207,0.00071746856,0.0006386681,0.00003948318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107671425,0.000042678428,0.0002702904,0.00011567793,0.000046081626,0.000026558617,0.0005068322,0.10321975,0.001025882,0.07860812,0.0023401326,0.8136903],"study_design_scores_gemma":[0.0004441696,0.0001575961,0.0010464406,0.00013118814,0.000013883793,0.0001304165,1.4543821e-7,0.9089589,0.00017899692,0.08208574,0.006254151,0.0005983848],"about_ca_topic_score_codex":0.00007557028,"about_ca_topic_score_gemma":0.00049443677,"teacher_disagreement_score":0.81309193,"about_ca_system_score_codex":0.0014351826,"about_ca_system_score_gemma":0.0010139003,"threshold_uncertainty_score":0.99971896},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004734752,0.000050373415,0.9926146,0.00027806012,0.0005670076,0.00030937922,0.000009641455,0.00006931052,0.0013668636],"genre_scores_gemma":[0.7319191,0.0000096041995,0.26756874,0.00019750232,0.00022814404,0.000003910493,0.000016615795,0.000010639195,0.000045733672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975677,0.000031971253,0.00065319345,0.0006407806,0.00079308747,0.00031327025],"domain_scores_gemma":[0.9974169,0.00019877264,0.00055800343,0.0012838822,0.00045720892,0.00008521906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008255369,0.0002777486,0.00031314316,0.0006865926,0.00016993395,0.0002955586,0.001985263,0.00025726107,0.00002129419],"category_scores_gemma":[0.000114971066,0.00025185212,0.00008638334,0.0004950434,0.001055846,0.0018614928,0.0005007715,0.00030304215,0.000038633087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007357384,0.000032035343,0.0001390619,0.00006258998,0.0000073773076,0.0000012558548,0.0024512452,0.0075958353,0.0012713439,0.0819053,0.00001599357,0.9065106],"study_design_scores_gemma":[0.00014979187,0.0001391617,0.0022834141,0.00021350368,0.000009994585,0.000024999477,0.0000032751307,0.9175976,0.002417038,0.07602378,0.0007048541,0.0004326149],"about_ca_topic_score_codex":0.000030796833,"about_ca_topic_score_gemma":0.000037143393,"teacher_disagreement_score":0.91000175,"about_ca_system_score_codex":0.0002528343,"about_ca_system_score_gemma":0.00059346616,"threshold_uncertainty_score":0.9999934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010386028,0.000089081834,0.99451864,0.0009825282,0.00017288215,0.0019526923,0.00001716512,0.00010287311,0.0011255154],"genre_scores_gemma":[0.39078155,0.000096984106,0.60637516,0.001183195,0.0005945863,0.00021191631,0.00010960048,0.000046892303,0.0006000889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976885,0.000008902187,0.0004710616,0.0010070313,0.00047614938,0.00034840248],"domain_scores_gemma":[0.9983347,0.00014034483,0.00018879215,0.00093101145,0.00023459026,0.00017057468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041755155,0.00031530386,0.00050463877,0.0009806737,0.00008820704,0.000041871226,0.0003175611,0.00026343917,0.000016085432],"category_scores_gemma":[0.0000793279,0.00029571392,0.00007957427,0.0008791109,0.00024353586,0.00011818585,0.00015816647,0.00044786427,0.000046673467],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018355339,0.0002872313,0.0013018586,0.00019470109,0.000014172832,0.00007382221,0.0011352737,0.027190467,0.014448573,0.0033708103,0.0011884914,0.95061105],"study_design_scores_gemma":[0.0020183637,0.0019618745,0.018581888,0.0036198238,0.00010311684,0.00023799301,0.0000030160284,0.7929814,0.04443232,0.08794982,0.045734145,0.0023762377],"about_ca_topic_score_codex":0.000066882014,"about_ca_topic_score_gemma":0.00007282455,"teacher_disagreement_score":0.9482348,"about_ca_system_score_codex":0.00036032955,"about_ca_system_score_gemma":0.00018266516,"threshold_uncertainty_score":0.9999495},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014477785,0.000060125403,0.9901225,0.00045269475,0.0065595135,0.00035303246,0.0000026459552,0.00018705144,0.00081467297],"genre_scores_gemma":[0.517472,0.000020448966,0.4710559,0.0019267381,0.004737316,0.000051110826,0.000007725107,0.00007014172,0.0046586255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975666,0.000026109554,0.0003705335,0.0010610693,0.0005033155,0.00047236547],"domain_scores_gemma":[0.99791604,0.000561217,0.0003601483,0.00070858665,0.00036448924,0.00008952163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010297913,0.0003176804,0.00030340895,0.00056128326,0.00031552784,0.0006859722,0.0014695298,0.00040917317,0.000016299464],"category_scores_gemma":[0.0002929761,0.0003146866,0.00013295696,0.000366198,0.0001331798,0.0006769402,0.00043665004,0.00038569514,0.000036173013],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013943214,0.00001669308,0.0001220742,0.00003943713,0.00001990971,0.0000055526366,0.0015802133,0.00087990507,0.00070090545,0.0028432198,0.000179681,0.99359846],"study_design_scores_gemma":[0.0009035673,0.001315635,0.0005642715,0.0006844017,0.000036631664,0.00006270727,9.649835e-7,0.66035604,0.03441307,0.25446248,0.04565688,0.0015433184],"about_ca_topic_score_codex":0.000020787698,"about_ca_topic_score_gemma":0.00055691676,"teacher_disagreement_score":0.9920551,"about_ca_system_score_codex":0.0007406855,"about_ca_system_score_gemma":0.00016389647,"threshold_uncertainty_score":0.9999305},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003471199,0.000050758103,0.9506581,0.018685013,0.0005251052,0.026413567,0.0000019426702,0.000151158,0.00004317146],"genre_scores_gemma":[0.4439795,0.000006899135,0.5086149,0.0063357693,0.0004658649,0.04056329,0.0000024571652,0.000020154901,0.000011158923],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601257,0.0002449633,0.00051091175,0.0016562562,0.0008607445,0.00071455346],"domain_scores_gemma":[0.99527097,0.0004174465,0.00028735763,0.003827144,0.00011502314,0.000082069586],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.003007346,0.00040043704,0.00032290883,0.00039564687,0.00054004043,0.00062659796,0.010615731,0.0003937101,0.000017266148],"category_scores_gemma":[0.00008969437,0.00022867312,0.00009817785,0.0024093245,0.00081744796,0.00014959204,0.008785166,0.0014694013,0.00004071111],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020129928,0.0003703355,0.0007343189,0.000100684585,0.000018627554,0.00006959292,0.01247608,0.013516595,0.000531774,0.085361995,0.0012607859,0.88553905],"study_design_scores_gemma":[0.0003001141,0.00012428107,0.0007436428,0.00011463391,0.0000032512387,0.00006692113,0.0000016646421,0.3344031,0.009358678,0.65207046,0.0024618083,0.00035142613],"about_ca_topic_score_codex":0.00029172513,"about_ca_topic_score_gemma":0.0012218083,"teacher_disagreement_score":0.8851876,"about_ca_system_score_codex":0.00036773397,"about_ca_system_score_gemma":0.0007828022,"threshold_uncertainty_score":0.9992316},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001818131,0.00031937283,0.994897,0.00042768606,0.0004113898,0.00077164924,0.000015299276,0.0001287106,0.0012107558],"genre_scores_gemma":[0.74286556,0.000006673503,0.2562757,0.0006446474,0.00013902993,0.000021050762,0.0000068748113,0.000023305336,0.000017122666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964589,0.000022088963,0.0005035291,0.0014819468,0.0010049772,0.0005285428],"domain_scores_gemma":[0.9968192,0.000086843786,0.00031404794,0.0020818708,0.0004969482,0.00020108925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059033,0.00049783813,0.00057786505,0.0007845598,0.00018425229,0.0003126427,0.0036220562,0.00025289037,0.00002305881],"category_scores_gemma":[0.000024238288,0.00037333005,0.0001075827,0.0010736622,0.0011388719,0.00061389315,0.0014349269,0.0006008266,0.000044413002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043085194,0.00087780744,0.0031801604,0.0005606903,0.00021363886,0.00007807499,0.03756924,0.015401001,0.011563739,0.75302494,0.0017482588,0.1753516],"study_design_scores_gemma":[0.0019266766,0.0051878565,0.0024082244,0.0058888937,0.0001053787,0.00028019544,0.000012097128,0.50255865,0.12352249,0.31738004,0.034649726,0.006079778],"about_ca_topic_score_codex":0.00003758094,"about_ca_topic_score_gemma":0.00027081592,"teacher_disagreement_score":0.74104744,"about_ca_system_score_codex":0.00010184907,"about_ca_system_score_gemma":0.0003630053,"threshold_uncertainty_score":0.99987185},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077429035,0.005544637,0.9829147,0.0008298781,0.0060932743,0.00038583748,0.000017305732,0.0004220411,0.003018037],"genre_scores_gemma":[0.5822984,0.00048280015,0.41027272,0.0041683507,0.0018011275,0.000034381555,0.000044583714,0.00018833534,0.00070930965],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99469084,0.000041965053,0.0006200568,0.00248402,0.001303282,0.00085982884],"domain_scores_gemma":[0.9971112,0.00035729568,0.00017417257,0.0018799428,0.00020993488,0.00026745515],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005819387,0.00078402966,0.0006277211,0.002631452,0.0003955795,0.0013993325,0.0031039391,0.0005637653,0.00007744348],"category_scores_gemma":[0.0000218618,0.00068845716,0.0005266684,0.002040745,0.0011750741,0.0007212589,0.0013023124,0.0013304922,0.00017105493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026913825,0.000110230154,0.00047965947,0.00014131173,0.00023302478,0.00053778203,0.0024063662,0.005166196,0.0016028762,0.29920456,0.00014534606,0.68994576],"study_design_scores_gemma":[0.00026971428,0.00025998574,0.0005940702,0.00069994386,0.00006749991,0.000054053493,6.655732e-7,0.07069656,0.00052296504,0.92121917,0.0046622446,0.0009531322],"about_ca_topic_score_codex":0.00009410571,"about_ca_topic_score_gemma":0.00017417272,"teacher_disagreement_score":0.6889926,"about_ca_system_score_codex":0.00011869483,"about_ca_system_score_gemma":0.00028342224,"threshold_uncertainty_score":0.9996373},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08471254,0.0011014113,0.9074816,0.00021589163,0.0018511683,0.0011509394,0.00007544797,0.00006844948,0.0033425263],"genre_scores_gemma":[0.96577215,0.00015945153,0.02584974,0.00035653956,0.0011680428,0.00003794064,0.00012692295,0.00006734839,0.006461842],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99735653,0.00010104983,0.0005143053,0.001166301,0.00039255933,0.00046922552],"domain_scores_gemma":[0.9982857,0.0001658302,0.0003996398,0.0005793462,0.00046358525,0.00010589682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005767185,0.00046810324,0.00042045867,0.00030985777,0.00026509142,0.00037808987,0.0007257605,0.00037563682,0.000119925055],"category_scores_gemma":[0.0005956672,0.00044506852,0.00012648395,0.00022490213,0.00047605982,0.000049080936,0.000455099,0.00056279247,0.000050698967],"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.00030824475,0.0001222544,0.0015812889,0.0002078555,0.00008567122,0.00006336563,0.0015072925,0.04716931,0.6813577,0.00012191776,0.00015606236,0.26731905],"study_design_scores_gemma":[0.0012943245,0.00073698093,0.0010851689,0.0017379404,0.000048818198,0.000098739525,0.0000042968013,0.03171854,0.91394806,0.009261812,0.038331624,0.0017337009],"about_ca_topic_score_codex":0.00005673869,"about_ca_topic_score_gemma":0.000333323,"teacher_disagreement_score":0.8816319,"about_ca_system_score_codex":0.0000777106,"about_ca_system_score_gemma":0.00030045846,"threshold_uncertainty_score":0.9998001},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014910455,0.00034629848,0.97425485,0.0013293532,0.007856017,0.0009484248,0.000007886119,0.00032761908,0.000019074152],"genre_scores_gemma":[0.39601892,0.000007637418,0.6022427,0.0009147278,0.00071817404,0.00007476101,0.0000026733717,0.00001997555,4.014604e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993996,0.00037887497,0.00070868776,0.0025569105,0.0011760086,0.001183504],"domain_scores_gemma":[0.9928505,0.003375067,0.00046806867,0.002487097,0.0006300613,0.0001891987],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.007856896,0.00057544524,0.0007355089,0.0006813913,0.0004570693,0.0014043193,0.005781338,0.0005117247,0.0000059201416],"category_scores_gemma":[0.0032768196,0.0005299386,0.0002854989,0.0021313683,0.0006352077,0.00050748023,0.00309102,0.0012888089,0.0000143993375],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015656095,0.00006242763,0.0013616993,0.00014679822,0.000019862784,0.000012848094,0.002682078,0.10533876,0.00022449328,0.0013685037,0.000016559445,0.8887503],"study_design_scores_gemma":[0.00018738177,0.00021100901,0.0018618274,0.0004197576,0.0000058730047,0.00001377635,3.7652717e-7,0.5929707,0.0040514427,0.3998191,0.000024124576,0.00043458742],"about_ca_topic_score_codex":0.000048892,"about_ca_topic_score_gemma":0.000045689798,"teacher_disagreement_score":0.88831574,"about_ca_system_score_codex":0.00029684792,"about_ca_system_score_gemma":0.0013968662,"threshold_uncertainty_score":0.9997152},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005108206,0.0006981976,0.9896044,0.000246815,0.0031890352,0.00065925857,0.000008948704,0.00017944771,0.00030565844],"genre_scores_gemma":[0.29669297,0.00008591624,0.7004536,0.0007392714,0.001596282,0.00007300737,0.000003927139,0.00007819268,0.0002768414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592555,0.000050341467,0.00063183927,0.0017451555,0.000928621,0.0007185017],"domain_scores_gemma":[0.9976643,0.00018787202,0.0004523187,0.0012377658,0.00031278914,0.00014499361],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007688465,0.00048057965,0.00042714807,0.0010172398,0.0003607388,0.000419466,0.0022127526,0.00020637197,0.00004129124],"category_scores_gemma":[0.000063648695,0.0004728914,0.000057587284,0.0010072035,0.00058141036,0.0010322065,0.0013081532,0.0007694986,0.000020663798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028123928,0.000056840006,0.0020380467,0.00015619122,0.000013633822,0.0001816519,0.0059817443,0.43744484,0.02783966,0.0004225951,0.00004347281,0.5257932],"study_design_scores_gemma":[0.0002810767,0.00016668411,0.00019893909,0.001571467,0.0000071700433,0.00011105775,5.589584e-7,0.8757997,0.09417507,0.026407214,0.00060899433,0.0006720454],"about_ca_topic_score_codex":0.00033026322,"about_ca_topic_score_gemma":0.00070255535,"teacher_disagreement_score":0.52512115,"about_ca_system_score_codex":0.0013164378,"about_ca_system_score_gemma":0.0011201411,"threshold_uncertainty_score":0.99977225},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097122066,0.00021533412,0.90107507,0.000047323952,0.0006030151,0.00055214023,0.00019884869,0.0000034700086,0.0001827342],"genre_scores_gemma":[0.9947559,0.000031237985,0.00490918,0.00006619537,0.00012325481,0.000008842637,0.000056642835,0.000011480875,0.000037240872],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987945,0.000021592257,0.00040223604,0.00038929572,0.0002316544,0.00016073519],"domain_scores_gemma":[0.9986293,0.000019298408,0.0004111522,0.0006732308,0.00023185753,0.00003518012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027833783,0.00019383866,0.00020862598,0.00007005167,0.000056233523,0.000016549375,0.00052738807,0.00019615448,0.00000620183],"category_scores_gemma":[0.0000073906585,0.00013106313,0.0001265575,0.000118182616,0.00074722036,0.0000037477105,0.00013470645,0.00006661858,4.3553533e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026636964,0.00082417653,0.011660757,0.0002586278,0.00027888163,2.5911262e-7,0.00070215296,0.031023614,0.08156457,0.00003847996,0.0000491327,0.873333],"study_design_scores_gemma":[0.0024166883,0.0012063257,0.040446065,0.0002563098,0.00015317346,0.0000064671676,9.680095e-7,0.4267803,0.5222651,0.0049192063,0.0005437866,0.0010056386],"about_ca_topic_score_codex":0.000049275135,"about_ca_topic_score_gemma":0.00012533498,"teacher_disagreement_score":0.89763385,"about_ca_system_score_codex":0.00008698898,"about_ca_system_score_gemma":0.00023239575,"threshold_uncertainty_score":0.53445995},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070878305,0.00026295034,0.961562,0.0016644953,0.0034925465,0.0006176234,0.000008518104,0.0001710085,0.025133073],"genre_scores_gemma":[0.8697175,0.000024644445,0.124422416,0.0014417042,0.0030256782,0.000006526218,0.000006191178,0.000034393222,0.001320975],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504095,0.0004950947,0.0006039362,0.0009742853,0.0021450336,0.0007407029],"domain_scores_gemma":[0.990815,0.007181973,0.0007450896,0.0005150145,0.0006266207,0.00011628905],"candidate_categories":["metaresearch","metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0075920476,0.00037613232,0.00056100974,0.0007661995,0.00085580605,0.00020360803,0.0020832366,0.000560644,0.00035943952],"category_scores_gemma":[0.012564697,0.00034322846,0.00014024036,0.001076589,0.008128612,0.00034672653,0.00038043963,0.00082766527,0.00002869756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003406324,0.0000376514,0.003002688,0.000076711454,0.000028751034,0.000005973292,0.08161138,0.07673867,0.00032526962,0.02994257,0.000062405874,0.80813384],"study_design_scores_gemma":[0.00029412308,0.0003605859,0.004502208,0.00047791912,0.000025379626,0.0000019935092,0.00010145738,0.01542293,0.0012202538,0.9664143,0.0101597225,0.0010191766],"about_ca_topic_score_codex":0.000794696,"about_ca_topic_score_gemma":0.0016893937,"teacher_disagreement_score":0.9364717,"about_ca_system_score_codex":0.00056983664,"about_ca_system_score_gemma":0.0011557825,"threshold_uncertainty_score":0.99990195},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014175998,0.00029181514,0.9784091,0.0015192397,0.0048708436,0.00034016318,0.0000033301203,0.00019625144,0.00019327526],"genre_scores_gemma":[0.5821053,0.000015407206,0.41275036,0.004331854,0.0007395955,0.000021400238,0.000008950861,0.000012501719,0.000014640411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604607,0.00008770273,0.00039865516,0.001790617,0.0010460259,0.00063094514],"domain_scores_gemma":[0.9975009,0.000451654,0.00020497381,0.0013556319,0.00031442277,0.000172405],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010203879,0.00040162573,0.00034254973,0.0008792441,0.00032719775,0.0011034075,0.0032815344,0.00022332139,0.00003541453],"category_scores_gemma":[0.0002474843,0.00037233293,0.00011505112,0.0018408353,0.0003673947,0.00066638744,0.0030015546,0.000709565,0.000114747636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070450947,0.00008885312,0.000063141255,0.00003029705,0.0000069046387,0.000018545905,0.00072976586,0.82735693,0.00021468688,0.0041745813,0.0006179971,0.16669123],"study_design_scores_gemma":[0.00015461358,0.00015709591,0.00034815772,0.00016958229,0.000002576922,0.00001436532,7.786852e-8,0.87321454,0.007914222,0.11712175,0.0005115428,0.0003914671],"about_ca_topic_score_codex":0.000024172297,"about_ca_topic_score_gemma":0.000014012561,"teacher_disagreement_score":0.56792927,"about_ca_system_score_codex":0.00028934603,"about_ca_system_score_gemma":0.0007058057,"threshold_uncertainty_score":0.99993354},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016586262,0.0000330774,0.99067795,0.00013939536,0.0018029639,0.0004848492,0.0000054988536,0.00010896294,0.0050886488],"genre_scores_gemma":[0.64398086,0.000019782203,0.3544195,0.0006800082,0.0005763855,0.000028520759,0.000007553729,0.00005867074,0.00022874156],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99602115,0.0000879431,0.0005753653,0.0014059884,0.0013742126,0.0005353543],"domain_scores_gemma":[0.9967418,0.00085500476,0.0004905248,0.0013889296,0.00040930972,0.00011446409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016928696,0.00043328895,0.00046034253,0.00203254,0.00022753036,0.00019773409,0.002592173,0.00024277455,0.000022403026],"category_scores_gemma":[0.0003142469,0.00038232768,0.00015901162,0.0010327399,0.0010334265,0.0005118481,0.00079390424,0.00085397897,0.000043853033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000652304,0.00008167309,0.000014364513,0.000074259835,0.000013971315,0.000025920574,0.0018894617,0.010893755,0.0010499309,0.22964495,0.00002066289,0.7562258],"study_design_scores_gemma":[0.00031173596,0.0013664984,0.00004906245,0.00094067137,0.0000033645097,0.000023376952,7.835371e-7,0.24800664,0.017260684,0.7314882,0.000119233475,0.00042974734],"about_ca_topic_score_codex":0.0000052439286,"about_ca_topic_score_gemma":0.00001477255,"teacher_disagreement_score":0.7557961,"about_ca_system_score_codex":0.0003210986,"about_ca_system_score_gemma":0.00018556113,"threshold_uncertainty_score":0.99986285},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000343117,0.0001083903,0.99299777,0.00084691774,0.0038919637,0.001102797,0.000025835065,0.00030597227,0.00037721836],"genre_scores_gemma":[0.021315709,0.0000057164693,0.97583467,0.0007935421,0.0015776667,0.00004352768,0.00005745575,0.00006706598,0.00030464318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495906,0.00017265788,0.0009474309,0.0020585447,0.0010959317,0.00076638017],"domain_scores_gemma":[0.9948741,0.0016827366,0.00082516717,0.0015201619,0.00090729253,0.00019051813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026481887,0.00061977823,0.0006146201,0.0009302687,0.00080576265,0.0007158175,0.0021740422,0.00029853324,0.000010659222],"category_scores_gemma":[0.00028717538,0.00064846966,0.00029886467,0.00093979854,0.0005730264,0.0013070033,0.00072336756,0.0007471624,0.000009173046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033195018,0.00003614968,0.000011432497,0.000038786184,0.000015015002,0.0000029068422,0.00041360434,0.97258186,0.00016505002,0.006350371,0.00014891403,0.020202735],"study_design_scores_gemma":[0.00033712664,0.00005187947,0.00002054432,0.0004734439,0.000024644178,0.000016500648,3.5414084e-7,0.7957436,0.00047295698,0.20158158,0.00078583637,0.0004915132],"about_ca_topic_score_codex":0.000015336514,"about_ca_topic_score_gemma":0.000048603695,"teacher_disagreement_score":0.19523121,"about_ca_system_score_codex":0.0010660451,"about_ca_system_score_gemma":0.0017330399,"threshold_uncertainty_score":0.99959666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042352054,0.0003235109,0.97566867,0.00041486393,0.000979979,0.0010308506,0.000009619236,0.00018345682,0.021346726],"genre_scores_gemma":[0.34893262,0.000015771582,0.6496304,0.0010015501,0.00027954366,0.000060288457,0.000018927487,0.00003319744,0.00002763948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99489766,0.00018019814,0.00077085634,0.0014119109,0.0022612037,0.00047813816],"domain_scores_gemma":[0.99554354,0.0003429693,0.00064596196,0.0014999043,0.0018383013,0.00012934553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025379106,0.00052095664,0.00071386335,0.0011125344,0.00016829753,0.00028863217,0.0025081318,0.00037761466,0.000065591805],"category_scores_gemma":[0.00008683216,0.00047334304,0.00019773329,0.0006711665,0.0006524495,0.00044750026,0.00068517687,0.0004951733,0.000009444275],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009999159,0.0001131108,0.000012877964,0.00017030994,0.00003844556,0.000006638143,0.0012304296,0.004372995,0.00010381474,0.0062694745,0.0002695509,0.9874024],"study_design_scores_gemma":[0.00055080897,0.00027981427,0.000037593712,0.00066862756,0.00003353504,0.000029815219,0.0000011176578,0.7964404,0.0036786217,0.19692126,0.00082591275,0.00053245417],"about_ca_topic_score_codex":0.000034771536,"about_ca_topic_score_gemma":0.000016871516,"teacher_disagreement_score":0.9868699,"about_ca_system_score_codex":0.0003633888,"about_ca_system_score_gemma":0.0013125708,"threshold_uncertainty_score":0.99977183},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008356184,0.00010851901,0.9937212,0.00036331563,0.0006810782,0.0005114599,0.0000069740286,0.00003616407,0.0044877413],"genre_scores_gemma":[0.03314834,0.000005793023,0.9649134,0.0013054551,0.00040458067,0.000027618593,0.000004306747,0.00002789357,0.0001625989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712396,0.00006840661,0.00053473294,0.0011257143,0.0006003845,0.00054682285],"domain_scores_gemma":[0.9973298,0.0005995697,0.0003141022,0.0013799039,0.00029111045,0.00008552909],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014832129,0.00040635365,0.00051290187,0.0003208622,0.0001525112,0.00021248653,0.0033489089,0.00040961197,0.000008092262],"category_scores_gemma":[0.00009049056,0.0003017601,0.0001882079,0.00045149538,0.0006384288,0.0003403848,0.00062839786,0.0005731986,0.0000015838914],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002153227,0.0000810583,0.000110191155,0.00018709681,0.000014103382,0.000009618369,0.002571747,0.04574142,0.000022661983,0.16150934,0.00009028815,0.78964096],"study_design_scores_gemma":[0.0002973513,0.000058802187,0.000016527662,0.00013584942,0.0000057399543,0.000007853953,1.04322076e-7,0.6672879,0.00056012085,0.33115056,0.0002283774,0.00025081667],"about_ca_topic_score_codex":0.000008836205,"about_ca_topic_score_gemma":0.000016346694,"teacher_disagreement_score":0.78939015,"about_ca_system_score_codex":0.000091281625,"about_ca_system_score_gemma":0.0004682217,"threshold_uncertainty_score":0.99994344},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015420299,0.00024408314,0.9937361,0.00005653694,0.0016037212,0.00025588158,0.0000056217154,0.00066896726,0.0018870643],"genre_scores_gemma":[0.49186587,0.000038533606,0.5072331,0.000167496,0.0004831239,0.000012674489,0.0000044707103,0.00006623037,0.00012850287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998534,0.000003278854,0.00028112507,0.0005545335,0.00022263055,0.00040441038],"domain_scores_gemma":[0.9989029,0.00034994297,0.000059519796,0.00054622866,0.000081414546,0.00005995037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003600012,0.00029815477,0.000314933,0.00036555293,0.00017849835,0.00006433808,0.00085325754,0.0005044922,0.00003181275],"category_scores_gemma":[0.000043126398,0.00028619447,0.00008642671,0.00015361777,0.00036620325,0.000112398,0.00022622493,0.00047659857,0.000038705108],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003834052,0.000007644012,0.0001252922,0.000040287512,0.000022363314,0.000014093822,0.0002915742,0.051487762,0.00009375412,0.0020524843,0.00012929825,0.94573164],"study_design_scores_gemma":[0.00021490011,0.00011203214,0.00033162074,0.00030274707,0.000016303438,0.00003328639,1.16351366e-7,0.84100074,0.0019173699,0.14267355,0.012879053,0.0005182538],"about_ca_topic_score_codex":0.0000011139426,"about_ca_topic_score_gemma":0.00007362705,"teacher_disagreement_score":0.9452134,"about_ca_system_score_codex":0.00029260517,"about_ca_system_score_gemma":0.000098647586,"threshold_uncertainty_score":0.999959},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045327113,0.0007401987,0.9948327,0.0010429883,0.0019826167,0.00057201204,0.0000065436084,0.00050690776,0.00027071993],"genre_scores_gemma":[0.022055725,0.000014999606,0.9749393,0.0014017185,0.0011883475,0.00002184876,0.000010013563,0.000038071685,0.0003299873],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967972,0.000021393684,0.0004481171,0.0015659234,0.00051859004,0.0006487601],"domain_scores_gemma":[0.99771214,0.00024266918,0.00032861062,0.0011409943,0.0004471743,0.00012840578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009649619,0.00046566295,0.000443784,0.0006884031,0.0003485217,0.00079191756,0.0031431927,0.00047594434,0.000013657723],"category_scores_gemma":[0.00019766908,0.00040495387,0.0001246425,0.00047639522,0.00062191556,0.00083917414,0.00107798,0.00076563563,0.000008961054],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016939897,0.000014885621,0.0000026791665,0.00006295186,0.000009057365,0.000016717728,0.0006786803,0.00007259272,0.0027546298,0.018779477,0.00013345349,0.97745794],"study_design_scores_gemma":[0.00022462403,0.0002826117,0.0000046343866,0.00045847544,0.000008276951,0.00008459592,5.6628284e-8,0.21837619,0.022585252,0.7544729,0.002838819,0.0006635515],"about_ca_topic_score_codex":0.00003234571,"about_ca_topic_score_gemma":0.0000850725,"teacher_disagreement_score":0.97679436,"about_ca_system_score_codex":0.00037345412,"about_ca_system_score_gemma":0.000494737,"threshold_uncertainty_score":0.99984026},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028848555,0.00029192597,0.99376,0.00041448994,0.0013894844,0.00028662468,0.000006520843,0.00016113448,0.00080500066],"genre_scores_gemma":[0.42084658,0.00053704355,0.5708396,0.0030509257,0.0015128023,0.00003544189,0.0001870428,0.00011589898,0.002874685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971439,0.000057241563,0.00044846357,0.0012946678,0.00066852465,0.00038717125],"domain_scores_gemma":[0.99841666,0.00016081962,0.0002943195,0.0006251223,0.00034361164,0.00015947531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008036927,0.00036999077,0.00033454076,0.00044254857,0.00037668296,0.0005078753,0.00089353404,0.00031189766,0.000076041375],"category_scores_gemma":[0.00006585778,0.00033661822,0.00005786952,0.00041493546,0.00052943215,0.0008949027,0.000792056,0.00034864704,0.00005036952],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009779641,0.00018050353,0.00012317332,0.00021391125,0.000052387913,0.000047501693,0.0041921735,0.008190529,0.028605284,0.030037731,0.0046649785,0.923594],"study_design_scores_gemma":[0.00073367613,0.00024715188,0.00007018888,0.0009308716,0.000016416301,0.0001239891,0.0000010533798,0.7330978,0.017225474,0.24008569,0.006488726,0.000978984],"about_ca_topic_score_codex":0.000025505482,"about_ca_topic_score_gemma":0.000009701297,"teacher_disagreement_score":0.92261505,"about_ca_system_score_codex":0.00011324167,"about_ca_system_score_gemma":0.00016952712,"threshold_uncertainty_score":0.99990857},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073216166,0.00015174111,0.98547506,0.00010940901,0.0018340283,0.0003236426,0.000006254245,0.00014849677,0.0046297396],"genre_scores_gemma":[0.92828315,0.000018503906,0.069027826,0.0008523919,0.0015401139,0.000037610604,0.000007194908,0.00009310488,0.00014007422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872786,0.000007718426,0.00020755659,0.00044984114,0.00027878935,0.00032821592],"domain_scores_gemma":[0.9986826,0.0007698326,0.00005269601,0.0004164486,0.000045128872,0.000033304856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047186867,0.0002937196,0.00021199844,0.00020089255,0.00018703792,0.00032140105,0.00044850272,0.000107343,0.00001909762],"category_scores_gemma":[0.000062934676,0.0002235408,0.000044734625,0.0001082861,0.0002614061,0.000104329156,0.00021373534,0.0002812845,0.000009037008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026058021,0.0000014829561,0.000009906496,0.000043204906,0.0000117359805,0.0000039278134,0.00030797257,0.96200275,0.000018911229,0.0096219415,0.000096786964,0.027878767],"study_design_scores_gemma":[0.000108112996,0.00009533644,0.00010584992,0.0002673402,0.000008499168,0.0000032087491,0.0000011331955,0.97259754,0.00014213946,0.022328142,0.0040350836,0.00030760397],"about_ca_topic_score_codex":0.0000035242808,"about_ca_topic_score_gemma":0.000034861147,"teacher_disagreement_score":0.92096156,"about_ca_system_score_codex":0.00010871663,"about_ca_system_score_gemma":0.00004132343,"threshold_uncertainty_score":0.91157293},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03571322,0.000050349856,0.9348401,0.00075610913,0.0015583936,0.0005212674,0.000016568723,0.00009986045,0.026444139],"genre_scores_gemma":[0.99079937,0.000036655616,0.007812187,0.00057524594,0.00072139525,7.4233816e-7,0.000018504448,0.00001119117,0.000024715204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613535,0.00005505758,0.0006605244,0.0002566327,0.002441909,0.00045050165],"domain_scores_gemma":[0.99865276,0.0002958665,0.00050725153,0.00015913375,0.00021160528,0.00017339576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037676927,0.00022592049,0.0003986813,0.00076236017,0.00044110938,0.00023004653,0.00091212196,0.00048066908,0.00040362228],"category_scores_gemma":[0.0015898667,0.0002120979,0.00006064227,0.0005076106,0.0011901588,0.0010316448,0.0003516902,0.0008292585,0.000016960954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001676951,0.000010456253,0.00006424743,0.00005923718,0.0000040866726,0.0000021848173,0.14779235,0.0019389238,0.000022268996,0.0040782127,0.0000081287335,0.8460031],"study_design_scores_gemma":[0.0028713827,0.00021590406,0.0040759128,0.001450058,0.000043497548,0.000024871008,0.0004345295,0.91427416,0.0017015955,0.058327936,0.014199884,0.00238028],"about_ca_topic_score_codex":0.0007004916,"about_ca_topic_score_gemma":0.0020597046,"teacher_disagreement_score":0.9550862,"about_ca_system_score_codex":0.00045369673,"about_ca_system_score_gemma":0.0018298175,"threshold_uncertainty_score":0.8649102},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09321293,0.00027958673,0.8983931,0.00051076734,0.0037136879,0.0012568928,0.0010018,0.000046145346,0.0015851209],"genre_scores_gemma":[0.9909568,0.0000029323273,0.008105256,0.00039383688,0.0003560811,0.000013988175,0.0000929001,0.000019368294,0.000058876798],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9979334,0.000049756443,0.00066828815,0.0005584053,0.00041928087,0.00037088685],"domain_scores_gemma":[0.9981742,0.00054786884,0.0006990112,0.00029318308,0.0001991429,0.00008659553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007765466,0.00019137427,0.0005953031,0.0011227179,0.00023438384,0.000015410027,0.0003935627,0.0002167548,0.00027482884],"category_scores_gemma":[0.00004000666,0.00019995046,0.00018264526,0.0005920675,0.00076069485,0.000065373715,0.00010157719,0.00022961781,0.000007303716],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036333196,0.00032864886,0.0018541885,0.00063308014,0.00091985345,0.000006456192,0.1071625,0.00031959778,0.003110589,0.012885584,0.00022831802,0.87218785],"study_design_scores_gemma":[0.014526648,0.019176375,0.5209463,0.0052808947,0.0029517664,0.00018994075,0.0003501408,0.15309115,0.03513132,0.23795241,0.003905772,0.0064972793],"about_ca_topic_score_codex":0.00013225336,"about_ca_topic_score_gemma":0.0011530411,"teacher_disagreement_score":0.8977438,"about_ca_system_score_codex":0.00027307542,"about_ca_system_score_gemma":0.00018491807,"threshold_uncertainty_score":0.8153743},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00669002,0.00032879395,0.9890175,0.0002571925,0.0026796334,0.00050625997,0.00002187626,0.00008756963,0.00041116663],"genre_scores_gemma":[0.9579041,0.0000072855896,0.040340364,0.0005593474,0.0010546243,0.000018384888,0.000010960385,0.000026817113,0.00007811891],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974717,0.000068613444,0.00045962716,0.0009918065,0.0006722267,0.00033606568],"domain_scores_gemma":[0.99781847,0.00017379691,0.00031348856,0.0009825635,0.0004959154,0.00021574169],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007566211,0.0003352666,0.00029945813,0.00056570314,0.0002824219,0.00031840126,0.0013513764,0.00017568075,0.000032499873],"category_scores_gemma":[0.00006328762,0.00026881188,0.00012435336,0.00050322426,0.00037463993,0.0005719006,0.0007617098,0.0003983181,0.000110300025],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001686495,0.000055367014,0.00002908314,0.000011433743,0.000018102908,0.0000115590865,0.0030437182,0.0010425515,0.003144995,0.0005079674,0.000036171863,0.9920822],"study_design_scores_gemma":[0.0009867398,0.0008575457,0.0063877963,0.0012548573,0.00019371379,0.00002942142,0.0000051090738,0.30586508,0.08505103,0.59449697,0.0029567739,0.0019149634],"about_ca_topic_score_codex":0.000059977312,"about_ca_topic_score_gemma":0.00019093697,"teacher_disagreement_score":0.9901672,"about_ca_system_score_codex":0.00021440854,"about_ca_system_score_gemma":0.00035512957,"threshold_uncertainty_score":0.9999764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007681992,0.0002466739,0.98974025,0.0003444509,0.00088287384,0.0006510974,0.000011874324,0.00008183052,0.0003589593],"genre_scores_gemma":[0.73230237,0.00003901221,0.2669255,0.0003079065,0.00031318716,0.000021797396,0.0000057688158,0.000029757295,0.000054671626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707955,0.000019915047,0.0006833212,0.001154838,0.000563215,0.0004991591],"domain_scores_gemma":[0.9975442,0.0009914157,0.00044485845,0.0005842473,0.00034249076,0.00009275562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009108478,0.00036175322,0.00047849593,0.000715679,0.00017708172,0.00029151488,0.0016207211,0.00026451208,0.0000028918707],"category_scores_gemma":[0.00063263375,0.0003509929,0.00005389708,0.0005647866,0.0009678406,0.00081408594,0.00071455765,0.00034111354,0.0000025807724],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004925485,0.000095198615,0.013013891,0.000967368,0.000024860781,0.00003464402,0.022305248,0.035677038,0.0009329652,0.014075635,0.00005913813,0.9127647],"study_design_scores_gemma":[0.00017639634,0.0005241383,0.0006133343,0.0022963008,0.000008583464,0.000027740525,0.0000017282225,0.75491065,0.013032171,0.22753549,0.0004589783,0.00041450976],"about_ca_topic_score_codex":0.00005316757,"about_ca_topic_score_gemma":0.0007114465,"teacher_disagreement_score":0.91235024,"about_ca_system_score_codex":0.00013135908,"about_ca_system_score_gemma":0.00053045736,"threshold_uncertainty_score":0.9998942},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054749433,0.00022075452,0.99589014,0.000051525265,0.0019992255,0.00065134204,0.000050700924,0.0005351819,0.000053664324],"genre_scores_gemma":[0.1315706,0.000013493257,0.86748236,0.000017942524,0.00074712944,0.000054105454,0.000009807338,0.000045721245,0.00005884784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683857,0.00002093212,0.00054752204,0.0011874002,0.00081521156,0.0005903471],"domain_scores_gemma":[0.9970514,0.00041167776,0.0003508583,0.0014917188,0.0005623826,0.00013192114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005715287,0.000530734,0.0007634726,0.0006204437,0.000150979,0.00029338247,0.0030911257,0.000292818,0.0000015241549],"category_scores_gemma":[0.00003711011,0.00049920974,0.00021114906,0.0005443692,0.0007138563,0.0004948439,0.0009818032,0.00041468997,0.000004514456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031814136,0.00015741623,0.00047410667,0.00083346723,0.00012749605,0.000053986085,0.003536164,0.16831501,0.0020088546,0.4545816,0.0002277586,0.36965233],"study_design_scores_gemma":[0.0002815229,0.0006083083,0.0001714972,0.0017689802,0.000024400097,0.0000371708,1.8030329e-7,0.85057825,0.020418568,0.11973092,0.00524213,0.0011380535],"about_ca_topic_score_codex":0.000022487486,"about_ca_topic_score_gemma":0.0000024543854,"teacher_disagreement_score":0.68226326,"about_ca_system_score_codex":0.0002254928,"about_ca_system_score_gemma":0.0002342649,"threshold_uncertainty_score":0.99974597},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06701173,0.0011170731,0.93076706,0.000013828224,0.00043482706,0.00043371654,0.0000057240454,0.00012679868,0.00008924923],"genre_scores_gemma":[0.51168466,0.000030887117,0.48782012,0.00003328092,0.00033332923,0.000005462822,0.0000063709044,0.000071547714,0.000014332737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786717,0.000006769475,0.00046660495,0.0005889749,0.00037627388,0.00069422607],"domain_scores_gemma":[0.9990441,0.0001242682,0.00016837701,0.00036656234,0.00021295197,0.00008373129],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038513998,0.00041919498,0.0004941264,0.0006987677,0.00015974011,0.00012985688,0.000663841,0.00032796088,0.000015319496],"category_scores_gemma":[0.00003402878,0.0004142455,0.00013820098,0.0005262906,0.00022978972,0.00020622474,0.00012512405,0.0005603103,0.0000017725209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007901792,0.0000053111908,0.00003323649,0.0002225731,0.000027177692,0.000004033778,0.00026574347,0.5667722,0.020821746,0.0001532585,0.0000022193396,0.4116846],"study_design_scores_gemma":[0.00017224491,0.000147086,0.000023068393,0.0003818473,0.00002379308,0.00003181521,3.8011459e-7,0.97223973,0.01900244,0.0073587038,0.00020246855,0.0004164019],"about_ca_topic_score_codex":0.000004972645,"about_ca_topic_score_gemma":0.000009231273,"teacher_disagreement_score":0.44467294,"about_ca_system_score_codex":0.0003319133,"about_ca_system_score_gemma":0.00017931289,"threshold_uncertainty_score":0.99983096},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003635821,0.00017349834,0.9912202,0.00009538785,0.0055269827,0.00053597917,0.00002662985,0.00008282437,0.0019749308],"genre_scores_gemma":[0.729867,0.000008656788,0.2668668,0.0005340767,0.0012811989,0.0000620623,0.0000313981,0.000076344404,0.0012724779],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810165,0.000013028447,0.00024733716,0.0008918698,0.00031584103,0.00043029702],"domain_scores_gemma":[0.9986977,0.00040675275,0.0001520519,0.0005722785,0.00008162274,0.00008956906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027492738,0.00030132,0.00026825216,0.00041883232,0.00023522117,0.000113348324,0.0004314772,0.00043070927,0.00054868637],"category_scores_gemma":[0.000040398972,0.00027206622,0.000118902404,0.00015429122,0.00042861176,0.00006484331,0.00010913355,0.00036945063,0.000118461496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022031264,0.00035269244,0.0016009549,0.000049821792,0.00023899191,0.00018579379,0.012090379,0.0010557328,0.00005136655,0.15644404,0.0006214627,0.8270884],"study_design_scores_gemma":[0.0011022124,0.00086866727,0.0010174911,0.00071087887,0.00012910213,0.000047354875,0.0000028823567,0.005128341,0.0001942796,0.9874871,0.0026089821,0.0007027424],"about_ca_topic_score_codex":0.000016012327,"about_ca_topic_score_gemma":0.000035152105,"teacher_disagreement_score":0.831043,"about_ca_system_score_codex":0.00050669047,"about_ca_system_score_gemma":0.00007921946,"threshold_uncertainty_score":0.9999732},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005168396,0.00013445792,0.98516726,0.00006909832,0.0008820622,0.000294708,0.0000011688691,0.0018514293,0.011548147],"genre_scores_gemma":[0.020582715,0.00004054528,0.9762351,0.00032578825,0.0013552924,0.000013782676,0.000037880105,0.00011648694,0.0012923889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972406,0.00002229922,0.00048803302,0.00082951173,0.00070801005,0.0007115698],"domain_scores_gemma":[0.99883103,0.000101621896,0.00011561693,0.00044895476,0.00023654573,0.0002662406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006016677,0.0005323282,0.00045142262,0.0012831786,0.00030627887,0.00035227655,0.00080954825,0.00036622747,0.000051942112],"category_scores_gemma":[0.00020281236,0.00054718833,0.0000905451,0.0009045729,0.00024329191,0.00017076547,0.00034125138,0.001179092,0.00016988219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014598947,0.000004682601,0.000002844219,0.000025648724,0.000014096103,0.000004131324,0.0009273613,0.84712315,0.000017240243,0.0001242619,0.000009675567,0.15174547],"study_design_scores_gemma":[0.0001913364,0.000111764704,0.000004622148,0.00024332631,0.000008269579,0.000023077677,0.0000015397162,0.9965271,0.00036226882,0.00046976973,0.0014512854,0.0006056564],"about_ca_topic_score_codex":0.000014298997,"about_ca_topic_score_gemma":0.0000015030606,"teacher_disagreement_score":0.15113981,"about_ca_system_score_codex":0.0004849625,"about_ca_system_score_gemma":0.00024428245,"threshold_uncertainty_score":0.999698},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018398144,0.00026127484,0.9968334,0.0001331179,0.000950012,0.00044790248,0.000021595673,0.0005110492,0.0006577006],"genre_scores_gemma":[0.017947054,0.00000973276,0.9809141,0.0004222745,0.0003631872,0.000019104746,0.0001137511,0.00008175079,0.00012905442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981069,0.000011424249,0.00033682876,0.0006973377,0.00038408555,0.00046341142],"domain_scores_gemma":[0.9988689,0.00025257404,0.00010486789,0.00042109904,0.0002303318,0.00012224607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032958545,0.00046807513,0.00037188316,0.0005103993,0.00022829797,0.00023145415,0.00051611377,0.00028062076,0.00008140743],"category_scores_gemma":[0.00003085154,0.00040732374,0.000091085734,0.00033568367,0.00031382256,0.00017755543,0.000056964127,0.000457188,0.000015056717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029930026,0.000009409403,0.000011196896,0.000059636237,0.00002172772,0.000007989755,0.0001248962,0.9788852,0.00004516279,0.00030696127,0.0000047397316,0.02049318],"study_design_scores_gemma":[0.00086221704,0.00015739896,0.0000032744624,0.0003621464,0.000022561593,0.000010238089,4.7696165e-7,0.99219686,0.0011328147,0.004652118,0.000063028165,0.0005368693],"about_ca_topic_score_codex":0.0000045898646,"about_ca_topic_score_gemma":0.00003989031,"teacher_disagreement_score":0.019956311,"about_ca_system_score_codex":0.00018981959,"about_ca_system_score_gemma":0.00015360696,"threshold_uncertainty_score":0.9998379},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026803642,0.00004952014,0.9934032,0.00059279305,0.00091305573,0.0005876628,4.459913e-7,0.00035259075,0.0040739155],"genre_scores_gemma":[0.3560344,0.0000152556795,0.63974243,0.0024644807,0.00030891437,0.000036428908,0.000031550175,0.00007093279,0.0012955691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947171,0.000074107236,0.00094570883,0.0016374956,0.0016936542,0.0009319216],"domain_scores_gemma":[0.9968217,0.0004176736,0.0006002897,0.0015807811,0.0003931437,0.00018642927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015603651,0.0006864014,0.0005745076,0.0017618391,0.00031278873,0.0006964096,0.003207467,0.00041524787,0.000056932924],"category_scores_gemma":[0.00021225029,0.0006965353,0.00014453923,0.0009764398,0.0005841382,0.001174495,0.00083006633,0.0013288714,0.00012692196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011609889,0.000013451795,0.000052141197,0.000045057004,0.0000036103947,0.00002587275,0.0006424331,0.9718223,0.00003252987,0.0021325212,0.00001672147,0.025201725],"study_design_scores_gemma":[0.0006146638,0.0004171708,0.0000103323255,0.0006543874,0.0000058524574,0.000002583605,2.8622614e-7,0.98597425,0.0008281986,0.010119856,0.0006485623,0.0007238467],"about_ca_topic_score_codex":0.000019463638,"about_ca_topic_score_gemma":0.000053024578,"teacher_disagreement_score":0.3560076,"about_ca_system_score_codex":0.0008733012,"about_ca_system_score_gemma":0.0014467106,"threshold_uncertainty_score":0.99954855},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042491985,0.000116970616,0.9868665,0.00063825713,0.0011489575,0.0003765403,0.0000018500556,0.00034322662,0.010082807],"genre_scores_gemma":[0.11258742,0.00021518902,0.88103426,0.0012837611,0.0018342723,0.00002371119,0.000012954455,0.00010136317,0.0029070969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955897,0.0001944653,0.0005949791,0.0019167385,0.0009418278,0.0007622916],"domain_scores_gemma":[0.99642164,0.0012440428,0.00047422756,0.0013485423,0.0003361614,0.00017541528],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023740823,0.0005883436,0.00067710277,0.0008609858,0.0004439684,0.00073994277,0.0028185807,0.00043232995,0.00006144015],"category_scores_gemma":[0.00030823483,0.0005295234,0.00019532948,0.00064877653,0.0005954312,0.00043200864,0.00051351235,0.0010058946,0.0005222097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032355274,0.000042443255,0.000149803,0.000021232188,0.000024259274,0.000057531695,0.0010247902,0.0077446913,0.0044147894,0.006254774,0.000051600284,0.98018175],"study_design_scores_gemma":[0.00097033073,0.000870389,0.0022404878,0.00055317505,0.00001792713,0.00008801826,4.2572248e-7,0.85996884,0.0022781848,0.12757419,0.0040421933,0.0013958362],"about_ca_topic_score_codex":0.000018131628,"about_ca_topic_score_gemma":0.000025200097,"teacher_disagreement_score":0.9787859,"about_ca_system_score_codex":0.00032311733,"about_ca_system_score_gemma":0.0003531584,"threshold_uncertainty_score":0.9997156},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003958597,0.00008730165,0.9809629,0.0006601514,0.0018683214,0.0003224748,0.000020399035,0.000077120385,0.012042766],"genre_scores_gemma":[0.6937972,0.000048087288,0.28171244,0.0040711486,0.0014168229,0.000018012423,0.000025266727,0.00007768837,0.018833393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99470615,0.000026191063,0.0008551407,0.0011357174,0.0027684865,0.0005082913],"domain_scores_gemma":[0.9976522,0.00032683468,0.00043372763,0.0010375694,0.00038698583,0.0001626851],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025446971,0.00039276382,0.00042386542,0.0014391281,0.00037218214,0.0013544061,0.0030732048,0.00019788135,0.0008485704],"category_scores_gemma":[0.000085350475,0.00030583102,0.00017247898,0.00069032644,0.0008190506,0.0016145393,0.0011695895,0.0004004101,0.0009928227],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027561582,0.000026455911,0.000111988484,0.000010845856,0.000013156788,0.000028313836,0.0031225611,0.025755083,0.00027440127,0.016221734,0.0027275353,0.95168036],"study_design_scores_gemma":[0.00016809997,0.000059695343,0.00011251495,0.000106932246,0.000010172119,0.000017250344,0.0000016968032,0.5664459,0.0004981388,0.41217288,0.019928282,0.00047842957],"about_ca_topic_score_codex":0.000008790991,"about_ca_topic_score_gemma":0.000027426611,"teacher_disagreement_score":0.9512019,"about_ca_system_score_codex":0.00021580979,"about_ca_system_score_gemma":0.00014728098,"threshold_uncertainty_score":0.9999394},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039264167,0.00065190194,0.99520296,0.00003724391,0.0026779503,0.00042787386,0.00002687868,0.00032234716,0.00026022914],"genre_scores_gemma":[0.1679343,0.00029370477,0.829701,0.00023248007,0.0015463418,0.000012774328,0.00010768791,0.00009683623,0.00007488911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842733,0.000016720976,0.000270945,0.0007668789,0.00018923852,0.0003289062],"domain_scores_gemma":[0.9985214,0.00022731925,0.0000823342,0.0009208966,0.00015982015,0.00008822604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038377577,0.00033971312,0.00032908475,0.00037715214,0.00012438577,0.00020241419,0.0008367346,0.00020988745,0.000003554595],"category_scores_gemma":[0.00006626083,0.0003082929,0.000034554723,0.00019278198,0.00029703995,0.00014922634,0.0004863588,0.00025510084,0.0000014366132],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006621268,0.000009727058,0.000010522479,0.000047612313,0.000029467137,0.000005928137,0.0004289757,0.008305766,0.0033461917,0.00028000833,0.0004592285,0.98706996],"study_design_scores_gemma":[0.0001605598,0.00013042027,0.00003878531,0.0003260157,0.000029295428,0.000024476927,1.5690003e-7,0.89965636,0.028355448,0.0476725,0.02307458,0.00053140015],"about_ca_topic_score_codex":0.000008532512,"about_ca_topic_score_gemma":0.000022515886,"teacher_disagreement_score":0.9865385,"about_ca_system_score_codex":0.00010154371,"about_ca_system_score_gemma":0.00005315591,"threshold_uncertainty_score":0.99993694},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051486255,0.0005290909,0.9939573,0.0004979191,0.0018429668,0.0006615026,0.0000071514137,0.00038371544,0.0020689059],"genre_scores_gemma":[0.39894164,0.00004992629,0.5976124,0.0018804218,0.0009587717,0.000043896634,0.000008324587,0.00006853621,0.0004361466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99411726,0.0000612456,0.00085332367,0.002405397,0.00094983523,0.0016129127],"domain_scores_gemma":[0.9955053,0.0010617403,0.00043843637,0.0018771138,0.0007064399,0.00041098037],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020153585,0.00086645124,0.0008037673,0.00084904867,0.00061851915,0.0013562139,0.005437002,0.00073365524,0.000043779524],"category_scores_gemma":[0.0002658276,0.0008316225,0.00024884872,0.0007383658,0.0009851188,0.0007292567,0.0013450026,0.0011011595,0.00003877978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020265536,0.00006275406,0.000039201594,0.00008395058,0.000024820465,0.00004275492,0.0013950027,0.3484191,0.000121640514,0.11229396,0.00013043015,0.5373661],"study_design_scores_gemma":[0.0002272038,0.0002770048,0.000007298585,0.00042195548,0.000011952645,0.000035150417,1.590987e-7,0.73717505,0.00028190904,0.26041818,0.0004168687,0.0007272898],"about_ca_topic_score_codex":0.000027102555,"about_ca_topic_score_gemma":0.000058577836,"teacher_disagreement_score":0.5366388,"about_ca_system_score_codex":0.00046862257,"about_ca_system_score_gemma":0.0014634238,"threshold_uncertainty_score":0.99994403},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003868105,0.0010083714,0.99524575,0.00055246847,0.0014875517,0.0003912658,0.0000040905984,0.0002880904,0.0006356137],"genre_scores_gemma":[0.6528231,0.000039880288,0.34396195,0.0025286207,0.0005139357,0.0000070697206,0.000005171118,0.000048576665,0.00007169505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951126,0.00007774329,0.00069753104,0.0021490625,0.0009080213,0.0010550449],"domain_scores_gemma":[0.9963479,0.00088668417,0.00042507972,0.0016095075,0.0003502039,0.0003806004],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010059357,0.00077523483,0.00068497105,0.0007108837,0.000632365,0.0017448979,0.0034806293,0.00044715437,0.000024164721],"category_scores_gemma":[0.00014487485,0.0007127502,0.00013082469,0.0006323792,0.0015494344,0.0007389172,0.0015569822,0.0009669839,0.000024929184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025685491,0.00006521462,0.00007910168,0.00009110072,0.000013596061,0.00012223513,0.0008281112,0.19574454,0.00018375662,0.0029872095,0.000038344744,0.7998211],"study_design_scores_gemma":[0.0003108589,0.00023564661,0.0000532352,0.0010387369,0.000011869885,0.00007502794,1.6128786e-7,0.97388625,0.00076570106,0.022586282,0.00022416457,0.0008120686],"about_ca_topic_score_codex":0.000026508062,"about_ca_topic_score_gemma":0.000035326753,"teacher_disagreement_score":0.799009,"about_ca_system_score_codex":0.0002028015,"about_ca_system_score_gemma":0.00072428974,"threshold_uncertainty_score":0.99953234},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022884241,0.00017116085,0.99683243,0.00060718023,0.000976804,0.00042314094,0.000015611513,0.00008987974,0.000654942],"genre_scores_gemma":[0.0697789,0.00003521486,0.9215289,0.0014843378,0.0007115009,0.000029465746,0.00003072062,0.00003611082,0.006364872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519026,0.000026005033,0.0007621255,0.0020520203,0.0011672822,0.0008022867],"domain_scores_gemma":[0.99687475,0.0002644699,0.00045888466,0.0017199037,0.00046416116,0.0002178313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010499092,0.0005857884,0.00086459896,0.0018379821,0.0003449884,0.00074101,0.003026688,0.0002663433,0.00010078091],"category_scores_gemma":[0.000046462777,0.0005291668,0.00064468826,0.0014040854,0.00042238127,0.0004978653,0.0011755367,0.00032570877,0.000052419342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023826617,0.00015580977,0.0009475648,0.00008091923,0.0010092898,0.000053367014,0.004778451,0.5662288,0.00018455843,0.026872624,0.0006558029,0.399009],"study_design_scores_gemma":[0.00026300654,0.00008363447,0.00008445341,0.00010435883,0.00017347609,0.0000054936672,4.461705e-7,0.95605636,0.0005552272,0.0415534,0.00054650515,0.0005736656],"about_ca_topic_score_codex":0.000015037015,"about_ca_topic_score_gemma":0.00013712066,"teacher_disagreement_score":0.39843532,"about_ca_system_score_codex":0.000259669,"about_ca_system_score_gemma":0.0003766866,"threshold_uncertainty_score":0.999716},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000055686664,0.000102191465,0.99125963,0.00067368394,0.0006835573,0.0012103633,0.000025525465,0.00022847355,0.005810975],"genre_scores_gemma":[0.07686686,0.0000220134,0.92148924,0.0009352269,0.00035013296,0.000050468738,0.000017998527,0.000052677497,0.00021536527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99551344,0.000022882603,0.0006400147,0.0019766572,0.0009233781,0.00092361704],"domain_scores_gemma":[0.9968291,0.00030688115,0.0005271686,0.0012176101,0.0008324104,0.00028686045],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00070689985,0.00072562206,0.00065236277,0.0006851537,0.00039858618,0.0010459822,0.0029445393,0.00042373562,0.00017179357],"category_scores_gemma":[0.000086870656,0.0005905748,0.00011739792,0.0007152549,0.002739517,0.0008493775,0.00049261993,0.000537731,0.000017503018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041162246,0.000099476274,0.00005772353,0.00044777914,0.000051494222,0.00008844386,0.00174547,0.1333849,0.000052181247,0.10986785,0.00009694228,0.7540666],"study_design_scores_gemma":[0.0007630732,0.00079528283,0.000014362985,0.0010297252,0.000018943003,0.00014648354,6.057132e-7,0.857844,0.00033218626,0.13739134,0.00071968185,0.0009443086],"about_ca_topic_score_codex":0.0000058381715,"about_ca_topic_score_gemma":0.00004346256,"teacher_disagreement_score":0.75312227,"about_ca_system_score_codex":0.00019146728,"about_ca_system_score_gemma":0.0017753828,"threshold_uncertainty_score":0.999991},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015324914,0.0005079332,0.99506855,0.0005874262,0.0015200953,0.0011648816,0.000010917729,0.000041711784,0.000945215],"genre_scores_gemma":[0.008648114,0.00001737052,0.988436,0.00039898627,0.0013968729,0.00006241976,0.000010616246,0.000052866504,0.0009767778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990051,0.0012826404,0.0014197576,0.002484955,0.0036434012,0.0011182971],"domain_scores_gemma":[0.9643184,0.031321704,0.00079117867,0.0010090207,0.002371603,0.0001881136],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.05228436,0.00052776566,0.0011388768,0.004207607,0.00045418914,0.0008935766,0.0026954452,0.0005960916,0.00025393776],"category_scores_gemma":[0.067138396,0.00043069382,0.00020305211,0.002097528,0.0018590282,0.0009400331,0.0011277191,0.0014313919,0.000041323772],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002994944,0.000017104492,0.000028383543,0.000008076645,0.0000067928704,0.0000050497306,0.0010422703,0.093210086,0.0010471026,0.0004035408,0.000013111424,0.9041885],"study_design_scores_gemma":[0.00076035724,0.00019193915,0.00031814122,0.00014631782,0.0000080474465,0.000037109923,0.000006390933,0.65596986,0.0013798717,0.33657315,0.004244145,0.00036464483],"about_ca_topic_score_codex":0.00004909739,"about_ca_topic_score_gemma":0.0002835125,"teacher_disagreement_score":0.9038239,"about_ca_system_score_codex":0.0010562775,"about_ca_system_score_gemma":0.0027497548,"threshold_uncertainty_score":0.9998145},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087739195,0.00008141024,0.9901743,0.00096830097,0.001256474,0.0004974498,0.000004577417,0.00028195916,0.005858123],"genre_scores_gemma":[0.13898164,0.000006823827,0.85746956,0.002286294,0.00048064053,0.000014328644,0.0000016117034,0.000043208962,0.0007158704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954182,0.000030235502,0.0004993358,0.0019818693,0.0012237207,0.0008466246],"domain_scores_gemma":[0.9968059,0.00017302677,0.00017262033,0.0021381879,0.00038381363,0.00032644492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007256927,0.0005729216,0.00050848984,0.0009340434,0.00038503594,0.0009214837,0.0041485266,0.00024365091,0.000033618766],"category_scores_gemma":[0.000022080536,0.00048928114,0.000090709254,0.00068209757,0.0004162685,0.0011719002,0.0017820607,0.00071252737,0.00013570517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010131329,0.000021451666,0.000015148532,0.000033715536,0.000017865945,0.000086616004,0.00879054,0.66537964,0.00014384827,0.11328028,0.000056432527,0.21216434],"study_design_scores_gemma":[0.00013762142,0.00015100687,0.000008718173,0.00040814286,0.000005692067,0.000057588863,6.859331e-7,0.59002966,0.00014461261,0.40796152,0.0005462905,0.00054845575],"about_ca_topic_score_codex":0.00008974039,"about_ca_topic_score_gemma":0.00037778655,"teacher_disagreement_score":0.29468125,"about_ca_system_score_codex":0.00039433723,"about_ca_system_score_gemma":0.0006492798,"threshold_uncertainty_score":0.99975586},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016624434,0.000084088875,0.99752647,0.000074982556,0.0004460318,0.00046259223,0.000027691245,0.00051378505,0.00069811445],"genre_scores_gemma":[0.14370818,0.0000044732965,0.85583204,0.000094559895,0.00027069685,0.000014800262,0.000008017273,0.0000144456835,0.00005275164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997848,0.000022648652,0.00055302243,0.0008215834,0.00048400453,0.00027074866],"domain_scores_gemma":[0.9956918,0.0015234973,0.0005494011,0.0009901401,0.0011872813,0.000057876303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000749655,0.00027148266,0.00039932015,0.00055127474,0.00017234209,0.00017562194,0.0016356509,0.00016784214,0.0000041453336],"category_scores_gemma":[0.00072459574,0.0002550006,0.00009468732,0.0005012056,0.000587753,0.0006170378,0.00052932993,0.00019092667,0.0000017696921],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007797785,0.00007178277,0.00012214124,0.000119176446,0.000019682442,0.0000046568753,0.0038748619,0.061565783,0.0028163346,0.050920717,0.00056087517,0.8799162],"study_design_scores_gemma":[0.00007364922,0.0001954428,0.000017762155,0.000286718,0.0000053811386,0.0000064731685,7.553267e-8,0.6185697,0.0077555655,0.3728752,0.000033841894,0.0001801779],"about_ca_topic_score_codex":0.000015692302,"about_ca_topic_score_gemma":0.0000071932545,"teacher_disagreement_score":0.879736,"about_ca_system_score_codex":0.000104410006,"about_ca_system_score_gemma":0.00036101238,"threshold_uncertainty_score":0.9999902},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030747236,0.00031500735,0.9941106,0.000030719442,0.0032237452,0.0006517421,0.000016342874,0.00015967462,0.0011847139],"genre_scores_gemma":[0.76083636,0.00009427608,0.23590223,0.00048074225,0.0017828778,0.00013210642,0.000013205415,0.00005990186,0.0006982888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744105,0.000018675088,0.0005144655,0.0010571014,0.0005807707,0.00038794105],"domain_scores_gemma":[0.99776745,0.00034750922,0.0003710023,0.0007955524,0.00062517007,0.0000933218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006500961,0.00034898077,0.00041153314,0.0008014872,0.00018814314,0.00021102959,0.0013325372,0.0002869932,0.000045177374],"category_scores_gemma":[0.000091843765,0.0003346472,0.00017801201,0.00048231235,0.00053578336,0.00046893206,0.00037451892,0.00031523756,0.00004485513],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016899254,0.000021178272,0.0000034733685,0.000073459836,0.000008471672,0.0000016021138,0.00047355198,0.00095656625,0.0026632885,0.0005915762,0.000017912253,0.995172],"study_design_scores_gemma":[0.00059488375,0.0016298397,0.000025171914,0.0004580954,0.000018701587,0.000068789115,4.0631159e-7,0.66398084,0.1347612,0.18470478,0.013007027,0.00075027224],"about_ca_topic_score_codex":0.0000094137795,"about_ca_topic_score_gemma":0.00005628505,"teacher_disagreement_score":0.9944217,"about_ca_system_score_codex":0.00016551938,"about_ca_system_score_gemma":0.00024043913,"threshold_uncertainty_score":0.99991053},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037790183,0.001120984,0.9556196,0.000358085,0.004034772,0.00040238682,0.0000030978858,0.00042114736,0.0002497751],"genre_scores_gemma":[0.58455884,0.000021525908,0.41454583,0.00035417225,0.0004963139,0.0000058333735,0.0000029545795,0.000013594135,9.448826e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943747,0.00023266088,0.00066929054,0.0027742966,0.0009107633,0.0010382851],"domain_scores_gemma":[0.99578947,0.0006179734,0.00039842227,0.0024113075,0.00044915418,0.00033366578],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0029937755,0.0006191452,0.0006659384,0.00074490235,0.0006305279,0.0012277375,0.00439344,0.00031206483,0.000004651742],"category_scores_gemma":[0.00066644733,0.0005569983,0.00013145727,0.0015778736,0.0011548214,0.00072403776,0.014160493,0.0011790846,0.000024339046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011968408,0.00021109845,0.018251475,0.0004933655,0.000040991206,0.0002746287,0.009256809,0.019003743,0.0009842892,0.0017614507,0.00006505183,0.9496451],"study_design_scores_gemma":[0.00026408298,0.00010092554,0.004767057,0.00062768534,0.000009793009,0.00018626523,8.8072744e-7,0.95600915,0.002960193,0.034299493,0.000047042566,0.0007274461],"about_ca_topic_score_codex":0.0001944751,"about_ca_topic_score_gemma":0.00018372043,"teacher_disagreement_score":0.9489177,"about_ca_system_score_codex":0.0002831922,"about_ca_system_score_gemma":0.0007703607,"threshold_uncertainty_score":0.9998091},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16958404,0.0002483643,0.8274604,0.0002144769,0.0019518659,0.00022277942,0.000026276703,0.00004311083,0.00024868027],"genre_scores_gemma":[0.96410453,0.000017919268,0.03518181,0.00032679795,0.00033450738,0.000013845469,0.000009376618,0.0000084808,0.0000027418553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984248,0.0000299961,0.0005405087,0.0005629779,0.000076234006,0.00036542752],"domain_scores_gemma":[0.9989195,0.000104803876,0.0003890532,0.00046249075,0.00005448554,0.0000696947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020568038,0.00020333563,0.00036888017,0.00038820124,0.00015775199,0.00067073415,0.00055813824,0.0002022838,0.00003437165],"category_scores_gemma":[0.00016071972,0.0002099279,0.00003984067,0.0003469736,0.00036437262,0.0005359794,0.00075877603,0.00034741548,0.00008093452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038418188,0.00007993575,0.03642866,0.00072815304,0.000037624708,0.0000037426005,0.007252873,0.869411,0.000024896657,0.05466676,0.0000804517,0.031247463],"study_design_scores_gemma":[0.00023874127,0.000057071236,0.0070142485,0.00018033956,0.0000023976563,0.000009946451,0.0000032513624,0.7136832,0.0005504254,0.27752087,0.0003494092,0.00039012323],"about_ca_topic_score_codex":0.00017057978,"about_ca_topic_score_gemma":0.0000128077145,"teacher_disagreement_score":0.7945205,"about_ca_system_score_codex":0.00010793842,"about_ca_system_score_gemma":0.00006550505,"threshold_uncertainty_score":0.8560611},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013124433,0.0013128641,0.9917302,0.00048333502,0.001068821,0.00016876328,0.0000030321398,0.00022483608,0.0036957148],"genre_scores_gemma":[0.24646676,0.00017268294,0.7431896,0.005295002,0.002798785,0.000009227377,0.000007977636,0.000091947215,0.001968042],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718225,0.00002613176,0.00032126217,0.0012677346,0.00066311983,0.00053951674],"domain_scores_gemma":[0.9980254,0.0003307228,0.00020008124,0.001175505,0.00014173564,0.00012655981],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011057653,0.00039960188,0.00039076412,0.00047541302,0.00024914314,0.00071527576,0.0022482295,0.00024061854,0.000043738957],"category_scores_gemma":[0.000076179516,0.00035034528,0.00006589637,0.00034644667,0.0009750425,0.0005611225,0.0015650743,0.00042676405,0.000043232732],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036145514,0.00001560327,0.00011373689,0.000065546104,0.000014502163,0.00017735251,0.00191685,0.0003409729,0.00040967588,0.07316109,0.0001807683,0.9236003],"study_design_scores_gemma":[0.00034956215,0.00023054413,0.0004240103,0.00090436527,0.0000130300405,0.00033218673,0.000001487133,0.4206285,0.0031428928,0.564657,0.008045979,0.0012704701],"about_ca_topic_score_codex":0.000017123039,"about_ca_topic_score_gemma":0.00003017076,"teacher_disagreement_score":0.92232984,"about_ca_system_score_codex":0.00009840257,"about_ca_system_score_gemma":0.00018574113,"threshold_uncertainty_score":0.99989486},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014994388,0.00025353718,0.9939338,0.0012803128,0.002199418,0.0006543737,0.00001316515,0.00019677731,0.0013186675],"genre_scores_gemma":[0.054188382,0.000036932055,0.9440222,0.0006886595,0.00072782347,0.000060498987,0.000011136885,0.000042766882,0.0002216053],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961648,0.00010971084,0.0005506723,0.0017419214,0.0008359666,0.0005969534],"domain_scores_gemma":[0.99589187,0.0015864195,0.00041071666,0.0015249491,0.0004918187,0.0000942143],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026955805,0.00046886338,0.000520874,0.0004981332,0.00043799623,0.00070485676,0.0025894567,0.0003484421,0.00002681439],"category_scores_gemma":[0.00032772537,0.000445091,0.00020346705,0.000577451,0.00053295895,0.0009934666,0.0002810875,0.00034033612,0.00005258447],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026788563,0.000040913925,0.00004378043,0.00012865936,0.000032794294,0.000016949733,0.009973039,0.0076076076,0.00077948143,0.02750707,0.000097668875,0.95374525],"study_design_scores_gemma":[0.00038995547,0.00023464617,0.000441171,0.00052388525,0.000021826629,0.000025531821,0.00000520441,0.4300094,0.007977718,0.55361843,0.0057606166,0.000991601],"about_ca_topic_score_codex":0.000026818798,"about_ca_topic_score_gemma":0.00012457618,"teacher_disagreement_score":0.95275366,"about_ca_system_score_codex":0.00027459124,"about_ca_system_score_gemma":0.00039509873,"threshold_uncertainty_score":0.9998001},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075822696,0.00021709273,0.99617606,0.0007132005,0.00085237727,0.0010347066,0.0000111422305,0.00003104897,0.00020615644],"genre_scores_gemma":[0.1605295,0.00008111787,0.8378936,0.00006137924,0.0008196943,0.000050432518,0.000002758285,0.000066320936,0.0004952131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863416,0.000011912599,0.00036528084,0.00045578796,0.0002987062,0.00023417283],"domain_scores_gemma":[0.99693096,0.0018865181,0.00035589075,0.000456384,0.0003113792,0.000058889844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005222067,0.00025125747,0.00036013444,0.00015316368,0.00023052457,0.00009204073,0.00035814923,0.00016130361,0.000009063063],"category_scores_gemma":[0.0005719822,0.00018312872,0.000049603274,0.00013108997,0.0012636282,0.00012938198,0.00021675814,0.00025148183,8.122286e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053104523,0.000084471096,0.0000054153206,0.001617476,0.00009167869,0.0000023335367,0.017280286,0.00042796103,0.0037544065,0.8318556,0.00014695662,0.14468032],"study_design_scores_gemma":[0.00025723226,0.0001477341,0.0000031906739,0.00025312294,0.000053040163,0.000029863133,0.0000028232712,0.03348172,0.0013987063,0.9639952,0.00019027675,0.00018706267],"about_ca_topic_score_codex":0.0000046373034,"about_ca_topic_score_gemma":0.00003540658,"teacher_disagreement_score":0.15977128,"about_ca_system_score_codex":0.00007114415,"about_ca_system_score_gemma":0.00014836178,"threshold_uncertainty_score":0.74677724},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020009119,0.000048061775,0.97988975,0.00045536776,0.012334132,0.00044353303,0.000004405695,0.00021100082,0.00641366],"genre_scores_gemma":[0.9594378,0.000011003999,0.025639705,0.009751916,0.003618792,0.00004075113,0.00001606882,0.00007128495,0.0014127011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996069,0.000071914306,0.00054667256,0.0017188878,0.0009552448,0.0006382628],"domain_scores_gemma":[0.9972415,0.00034814497,0.00034882268,0.0015407001,0.00035184165,0.00016899494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010187466,0.0005623261,0.00044095324,0.0009483214,0.00043785005,0.00090566935,0.0015138563,0.00043531056,0.00013045347],"category_scores_gemma":[0.000048405494,0.00048206223,0.00022390319,0.00060123147,0.00045363724,0.00043961784,0.0002435055,0.0008675118,0.00020609141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033426422,0.0003131799,0.00003059237,0.00009197681,0.000049796072,0.00011595456,0.000696103,0.18374658,0.0005206987,0.048309464,0.002536323,0.76325506],"study_design_scores_gemma":[0.00037790675,0.0022887897,0.00003823111,0.00064485834,0.0000071189756,0.000018401668,1.3082898e-7,0.94528294,0.00051414315,0.042788386,0.0074376944,0.00060141593],"about_ca_topic_score_codex":0.000021360036,"about_ca_topic_score_gemma":0.0000776953,"teacher_disagreement_score":0.9592377,"about_ca_system_score_codex":0.00035773,"about_ca_system_score_gemma":0.00027132808,"threshold_uncertainty_score":0.99976313},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044386704,0.00014116215,0.9853184,0.007283581,0.0014016737,0.0009516849,0.000007708576,0.00029654903,0.00016055218],"genre_scores_gemma":[0.47644526,0.000020435811,0.5221053,0.0011720513,0.00016559225,0.000056976245,0.0000033896267,0.000018711567,0.0000123244145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937599,0.0002416846,0.0005022143,0.0026029837,0.0016281321,0.0012651286],"domain_scores_gemma":[0.99606895,0.00038684413,0.0002525305,0.0023358571,0.0005255191,0.00043029708],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018636753,0.0005698346,0.0006138216,0.0029865862,0.00022458607,0.0019295149,0.006009283,0.00030354102,0.00000836842],"category_scores_gemma":[0.0005207002,0.0004693567,0.000080577214,0.010595367,0.00047641568,0.00073497964,0.005692386,0.0012927176,0.000030127285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020772775,0.00016414512,0.0021914977,0.000086615146,0.000009689593,0.00015211171,0.0038599542,0.69483066,0.000037559097,0.00051099644,0.00018398695,0.297952],"study_design_scores_gemma":[0.00047225083,0.000479164,0.003343228,0.00047065684,0.0000031689642,0.00005064751,0.0000013662337,0.9848246,0.000525103,0.008861081,0.0002305377,0.0007382169],"about_ca_topic_score_codex":0.00027295446,"about_ca_topic_score_gemma":0.001079907,"teacher_disagreement_score":0.4720066,"about_ca_system_score_codex":0.00057863526,"about_ca_system_score_gemma":0.0012412302,"threshold_uncertainty_score":0.9997758},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013609305,0.00066256983,0.99345773,0.0002916718,0.003404561,0.00045712915,0.0000019123281,0.00023864087,0.0013496986],"genre_scores_gemma":[0.11728912,0.00009030005,0.88048905,0.0008805187,0.0005042503,0.000018277347,0.000008507808,0.000040773837,0.0006791819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645054,0.00006505113,0.0006259799,0.0014942246,0.00069725304,0.0006669529],"domain_scores_gemma":[0.997924,0.0003466991,0.00028601932,0.0010201768,0.0003124536,0.00011069479],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00091828575,0.00048649398,0.00058984896,0.0010042654,0.00021528386,0.0010493504,0.0025519386,0.0004455965,0.000019676623],"category_scores_gemma":[0.00016451644,0.00042938002,0.00007579272,0.0007559907,0.00057435443,0.0006998246,0.0009575901,0.0005427867,0.00006171713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009500508,0.00006945971,0.00035989916,0.00008759284,0.000014273598,0.0002776577,0.0013871479,0.9177503,0.000098931654,0.004002679,0.00008384404,0.07585873],"study_design_scores_gemma":[0.00031690736,0.00009769942,0.00020909801,0.0004847147,0.0000030785923,0.000061209794,6.4819943e-7,0.9939457,0.0002192093,0.0039297426,0.00022861891,0.00050337036],"about_ca_topic_score_codex":0.0001307735,"about_ca_topic_score_gemma":0.00030741232,"teacher_disagreement_score":0.117153026,"about_ca_system_score_codex":0.0003317352,"about_ca_system_score_gemma":0.00049780024,"threshold_uncertainty_score":0.99998766},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015705341,0.0006033876,0.9945065,0.00009933786,0.0020311195,0.00038536725,0.000003514002,0.00022655212,0.001987214],"genre_scores_gemma":[0.030944748,0.000026787631,0.96840113,0.00013522505,0.0002738388,0.00001112996,0.0000021855524,0.000026701797,0.0001782777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958622,0.00009649674,0.00053953857,0.0012573794,0.0017188662,0.0005255146],"domain_scores_gemma":[0.9957669,0.0010089336,0.00033532223,0.001863556,0.00092913164,0.00009616122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00403797,0.00042007145,0.00055021094,0.0006971078,0.000110514295,0.00013899543,0.0032919173,0.00030744623,0.00003237362],"category_scores_gemma":[0.00092300103,0.0003931009,0.00010860009,0.00059627776,0.00070141046,0.00092836027,0.0013848759,0.0005021029,0.000018774006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022731735,0.0000072100056,0.0000025179402,0.00002022265,0.000005867733,0.0000038319404,0.0005495663,0.7258877,0.00014900493,0.0070653744,0.000012829479,0.2662936],"study_design_scores_gemma":[0.00011449147,0.00008393681,0.000010223087,0.00014451088,0.0000073657884,0.000011900973,9.87036e-8,0.5054994,0.002951662,0.49086368,0.00007129903,0.00024140165],"about_ca_topic_score_codex":0.000008516036,"about_ca_topic_score_gemma":0.000008506116,"teacher_disagreement_score":0.48379833,"about_ca_system_score_codex":0.00040386379,"about_ca_system_score_gemma":0.00072078494,"threshold_uncertainty_score":0.99985206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021385797,0.0002078489,0.9949356,0.00070318143,0.0019107404,0.0008520004,0.000010047733,0.00041906003,0.00095942465],"genre_scores_gemma":[0.0006517889,0.000046082307,0.99569386,0.00093459716,0.00047268067,0.00003496753,0.00001352123,0.00008027047,0.0020722044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939056,0.00011533354,0.00067359844,0.0026873327,0.0015833554,0.0010347734],"domain_scores_gemma":[0.99523205,0.00079651724,0.00055147713,0.0018686333,0.0012272376,0.0003241167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008620429,0.00093019207,0.000735463,0.0010954434,0.0005818767,0.00061119447,0.0036904074,0.0004439173,0.00010602925],"category_scores_gemma":[0.00012406586,0.0006962957,0.00013260772,0.0018595643,0.0018982432,0.0015856362,0.0013571194,0.00093453896,0.00010460206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027894015,0.00007683804,0.0000300372,0.000016234828,0.000035860798,0.0002350674,0.0007314282,0.49515855,0.000009762726,0.0006633664,0.00011393543,0.502901],"study_design_scores_gemma":[0.00068910513,0.00036998815,0.00020300112,0.0005805787,0.000016556565,0.00020334385,8.9765274e-7,0.97495615,0.00038244392,0.020187847,0.0012123013,0.0011977886],"about_ca_topic_score_codex":0.000012875694,"about_ca_topic_score_gemma":0.000055063527,"teacher_disagreement_score":0.5017032,"about_ca_system_score_codex":0.0008822862,"about_ca_system_score_gemma":0.0011200531,"threshold_uncertainty_score":0.9995488},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01053394,0.0002620095,0.9880538,0.00029819342,0.00022843649,0.00044460807,0.000010709054,0.000030325618,0.0001379679],"genre_scores_gemma":[0.93071604,0.000034694276,0.06874857,0.0003474463,0.00010452167,0.000014065552,0.00000660072,0.000009226177,0.000018826866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998002,0.00003282332,0.00034851735,0.00075109315,0.00064205425,0.00022354168],"domain_scores_gemma":[0.9981286,0.00021363438,0.000292569,0.00083896884,0.00043130576,0.000094932286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071967725,0.00021268283,0.00029357016,0.0017576342,0.00012791091,0.00021756811,0.0015702889,0.00015614013,0.000004018231],"category_scores_gemma":[0.00009786845,0.00014845758,0.0000523245,0.0021936153,0.00050644035,0.00062635855,0.00030753438,0.00021881616,0.000004091564],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013728443,0.000040500454,0.00022364056,0.00010729681,0.000008080826,0.0000014971988,0.0019830787,0.004127828,0.005549835,0.0015125447,0.000029752633,0.9864022],"study_design_scores_gemma":[0.00040664335,0.0017127721,0.011800902,0.001404711,0.000046661313,0.00007846442,0.000007292937,0.6552138,0.05174329,0.27608562,0.00049229944,0.0010075917],"about_ca_topic_score_codex":0.000017189333,"about_ca_topic_score_gemma":0.000042275566,"teacher_disagreement_score":0.9853946,"about_ca_system_score_codex":0.000032453812,"about_ca_system_score_gemma":0.00011833817,"threshold_uncertainty_score":0.6053924},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003111849,0.00022923284,0.9891836,0.0030437037,0.0014125112,0.0003132526,0.0000043517834,0.00017143777,0.0053307423],"genre_scores_gemma":[0.95352274,0.0000072226458,0.02970622,0.009706439,0.0060164114,0.000037577196,0.000056981124,0.00010930539,0.0008370936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699837,0.000006838583,0.00045710968,0.0012165505,0.00076883205,0.0005522789],"domain_scores_gemma":[0.9983105,0.00008346915,0.0003394564,0.00075450056,0.00046909088,0.000042953274],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009494151,0.0005064514,0.0005591903,0.0010878087,0.00031945252,0.001204092,0.001302359,0.00026255177,0.00009983429],"category_scores_gemma":[0.00006705982,0.00043551833,0.00012349988,0.0009763735,0.00040701719,0.00059760554,0.00043259654,0.00039718708,0.00029126822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022019334,0.00006999858,0.00029429197,0.0005816425,0.000041433534,0.00002681351,0.00013143962,0.73891777,0.000018875558,0.005285177,0.00063258933,0.25397792],"study_design_scores_gemma":[0.00015881001,0.00001530589,0.000013801891,0.00076611864,0.00006761246,0.000002677371,0.0000010763928,0.96791327,0.000021314096,0.021016812,0.009367454,0.000655754],"about_ca_topic_score_codex":0.000209239,"about_ca_topic_score_gemma":0.00011650673,"teacher_disagreement_score":0.95947737,"about_ca_system_score_codex":0.00013753393,"about_ca_system_score_gemma":0.00025897173,"threshold_uncertainty_score":0.99983275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065729296,0.00019217441,0.9948963,0.001185515,0.0019079784,0.00051260355,0.00005152011,0.00015012639,0.00044650913],"genre_scores_gemma":[0.007690176,0.000051433504,0.98829806,0.0023714337,0.0014033995,0.000019688765,0.000033148197,0.000058159356,0.00007448175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981729,0.000040538118,0.00045961616,0.00054712564,0.0004655333,0.0003143246],"domain_scores_gemma":[0.99852794,0.00040281372,0.00010531436,0.0005837771,0.00029073362,0.00008941072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007422835,0.000313543,0.00026149553,0.00017734445,0.00016675981,0.00023936194,0.0008273734,0.00013481277,0.00017179918],"category_scores_gemma":[0.00013083566,0.00024517963,0.0000432914,0.0004988066,0.00019203952,0.0001229465,0.00023142261,0.00021123745,0.00006229709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022650108,0.000001866064,0.00004744084,0.000004677372,0.000015513544,0.0000025875772,0.0025369895,0.747088,0.00018032266,0.0002126538,0.0012918082,0.24861586],"study_design_scores_gemma":[0.00021435719,0.000079701385,0.0002479008,0.00022429737,0.000020992884,0.000003183617,0.0000062767103,0.95364416,0.003985222,0.020286338,0.020711156,0.00057639723],"about_ca_topic_score_codex":0.00005052919,"about_ca_topic_score_gemma":0.0003348078,"teacher_disagreement_score":0.24803947,"about_ca_system_score_codex":0.00032855297,"about_ca_system_score_gemma":0.00019584196,"threshold_uncertainty_score":0.99981356},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014017742,0.0005557265,0.99335814,0.000015441972,0.0027514496,0.0005448888,0.00002826239,0.0004325108,0.00091181597],"genre_scores_gemma":[0.62904197,0.000020913532,0.36926052,0.00006953459,0.0013283703,0.00002045342,0.000010831166,0.00019775929,0.000049683684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671423,0.000010180689,0.0006880863,0.0007468794,0.0008891293,0.00095149514],"domain_scores_gemma":[0.9985101,0.00010682014,0.000087693064,0.0010088905,0.0001571823,0.00012931666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010263391,0.0006984799,0.0005781723,0.0005541672,0.00021639498,0.0002800578,0.0014351895,0.0002414234,0.00001547924],"category_scores_gemma":[0.000049748793,0.00060187705,0.00014341023,0.00031249132,0.00021309622,0.00049585407,0.00048228248,0.00088376785,0.0000139784515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033198394,0.0000024950562,0.0000020017774,0.00015632299,0.000035344838,0.000009501742,0.0004709919,0.9861174,0.00022532357,0.00017385656,0.0000070037895,0.012796444],"study_design_scores_gemma":[0.00019170174,0.000031873242,0.0000026790085,0.0006360183,0.000019614607,0.00012330445,5.0690596e-7,0.9958238,0.0006961242,0.0008530088,0.0009627861,0.00065858266],"about_ca_topic_score_codex":0.000014061153,"about_ca_topic_score_gemma":0.00000401702,"teacher_disagreement_score":0.6276402,"about_ca_system_score_codex":0.0010543995,"about_ca_system_score_gemma":0.00020460838,"threshold_uncertainty_score":0.99964327},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038459104,0.00018758685,0.9597005,0.00019822916,0.0009852583,0.00025146635,0.00000307754,0.00003178937,0.00018299416],"genre_scores_gemma":[0.59091413,0.0000043455448,0.40822196,0.00029724964,0.00050986966,0.0000010694142,4.5296335e-7,0.000014824926,0.000036107936],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977378,0.000090111025,0.00046204793,0.0007593948,0.00063239667,0.00031821497],"domain_scores_gemma":[0.9978908,0.0005590286,0.00037719705,0.0008101588,0.0002799333,0.00008292876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015525818,0.00030602273,0.00049975875,0.00044972397,0.0001368241,0.00019560475,0.0022739088,0.00025265774,0.0000057858024],"category_scores_gemma":[0.00019968754,0.00021785716,0.00008500936,0.00044553165,0.00097073725,0.0003412455,0.0014690027,0.0005472747,0.0000010453635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120808465,0.00009096756,0.0068005323,0.00015234547,0.00011840713,0.000053471747,0.022524755,0.005715011,0.019916447,0.019588321,0.00015647012,0.9247625],"study_design_scores_gemma":[0.002047693,0.005463924,0.011918047,0.0070272516,0.000112075184,0.0003994758,0.0000073757956,0.3847969,0.3897977,0.19358371,0.0016259247,0.0032199558],"about_ca_topic_score_codex":0.00018137056,"about_ca_topic_score_gemma":0.000035026835,"teacher_disagreement_score":0.9215425,"about_ca_system_score_codex":0.000053103668,"about_ca_system_score_gemma":0.00015425836,"threshold_uncertainty_score":0.8883957},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068786116,0.0009741273,0.99002725,0.0002991849,0.0002946023,0.00045546534,0.000023648327,0.00009371022,0.00095341186],"genre_scores_gemma":[0.6690605,0.000059689046,0.33048746,0.00007742649,0.0002563811,0.000009201408,0.000020988833,0.00001820343,0.0000101107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973722,0.000062404695,0.0005575705,0.0011010187,0.0006140137,0.00029279993],"domain_scores_gemma":[0.99798733,0.00034037774,0.00038883003,0.0009431233,0.00020865918,0.00013167653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000593347,0.00034810943,0.00042506887,0.0006051429,0.0002559813,0.00022778631,0.0012262913,0.00025309957,0.0000034532595],"category_scores_gemma":[0.000004245372,0.0003050283,0.00005507819,0.00035299757,0.00041987989,0.00067327975,0.0004005679,0.00027865375,0.0000045117476],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004877247,0.00007673815,0.0003987952,0.0015907336,0.000056052584,0.000014740817,0.03329417,0.013294536,0.023801737,0.18068525,0.0000104703595,0.746728],"study_design_scores_gemma":[0.0008120174,0.00034514378,0.0021249559,0.0033062848,0.00005484191,0.00008182132,0.00001780401,0.56903327,0.01592024,0.40642545,0.00074856944,0.0011295826],"about_ca_topic_score_codex":0.000025515295,"about_ca_topic_score_gemma":0.000049775776,"teacher_disagreement_score":0.74559844,"about_ca_system_score_codex":0.00007449094,"about_ca_system_score_gemma":0.00012474797,"threshold_uncertainty_score":0.99994016},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031787473,0.00034876543,0.97441137,0.0001392478,0.004308804,0.00065173715,0.0000014225227,0.00033707687,0.01976977],"genre_scores_gemma":[0.669299,0.000085003194,0.31927323,0.0017477399,0.0035822433,0.000059417383,0.000015396288,0.0000937579,0.0058442173],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960682,0.000044817338,0.0005349457,0.0015582162,0.0010142599,0.0007795774],"domain_scores_gemma":[0.99738914,0.00018644326,0.00035259905,0.0015693007,0.00037128673,0.00013124544],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014509615,0.0005450892,0.0005073706,0.0008159779,0.00035525623,0.001193808,0.0034977768,0.00039947339,0.00003553131],"category_scores_gemma":[0.00009317883,0.00042496625,0.00015489798,0.00076834636,0.000993089,0.0009415825,0.0011543345,0.0005616357,0.00023803582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007030028,0.000030864074,0.00006453892,0.00006916444,0.00001632883,0.000059868555,0.0039080037,0.00017535957,0.00005392836,0.48419914,0.00016006762,0.51125574],"study_design_scores_gemma":[0.00021856315,0.000463328,0.000024962688,0.000096951546,0.000007952359,0.00012108879,9.58426e-7,0.056032777,0.000560182,0.91147506,0.030260224,0.0007379372],"about_ca_topic_score_codex":0.000075549775,"about_ca_topic_score_gemma":0.00014190751,"teacher_disagreement_score":0.6692672,"about_ca_system_score_codex":0.00033541073,"about_ca_system_score_gemma":0.0007147438,"threshold_uncertainty_score":0.99984306},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010390501,0.000073044816,0.9870381,0.00005121705,0.0015434268,0.00018645888,0.0000031856293,0.000040535142,0.00067357504],"genre_scores_gemma":[0.92805916,0.00002554929,0.07054315,0.00018372803,0.000298817,0.0000041207522,0.0000061793194,0.00001587308,0.0008634477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714994,0.000046756657,0.00051809184,0.00096054643,0.0010228871,0.0003017873],"domain_scores_gemma":[0.9983298,0.0002563306,0.00050028303,0.00054095924,0.00029858606,0.00007401107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067417393,0.000301295,0.00048131123,0.00078737445,0.00018551854,0.0003384456,0.0013380245,0.00017914476,0.000047202477],"category_scores_gemma":[0.00004980404,0.0002811183,0.00014329063,0.00056923117,0.0004112421,0.0006439317,0.0008762048,0.00040586872,0.000014114961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007789557,0.00042656556,0.18665527,0.00043416274,0.0018252629,0.0002734586,0.059799284,0.14196403,0.0016760911,0.2217148,0.00009048248,0.3850627],"study_design_scores_gemma":[0.001383832,0.001357381,0.0527401,0.003091089,0.0006770519,0.00011619942,0.000019420506,0.8377245,0.0073244832,0.08158188,0.010841077,0.0031429979],"about_ca_topic_score_codex":0.00010080548,"about_ca_topic_score_gemma":0.00004253223,"teacher_disagreement_score":0.91766864,"about_ca_system_score_codex":0.00022806288,"about_ca_system_score_gemma":0.000120214696,"threshold_uncertainty_score":0.9999641},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010313581,0.00018525787,0.9870422,0.000042610925,0.0011757467,0.0004661984,0.000011824471,0.000110943554,0.0006516728],"genre_scores_gemma":[0.38089785,0.000002408569,0.6187092,0.00012255258,0.00024313817,0.0000019190338,0.000005316255,0.000015371947,0.0000022566608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604386,0.00006491163,0.00073124404,0.0015837043,0.0010012157,0.0005750914],"domain_scores_gemma":[0.9967265,0.0002452062,0.0005281595,0.0019027395,0.0004340164,0.00016337252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012466355,0.00044642732,0.000583258,0.00045179826,0.0002630925,0.00035027173,0.0027498836,0.0002801599,0.00004017904],"category_scores_gemma":[0.000070463604,0.00038409847,0.00013271754,0.00059291185,0.0012554053,0.00052176084,0.0008627943,0.00041843118,0.0000058436317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016216838,0.00022239637,0.00009254915,0.00016704398,0.0000146246575,0.000016287997,0.007438757,0.47399235,0.0010333321,0.02021217,0.0000018664215,0.4967924],"study_design_scores_gemma":[0.00015577997,0.00019715267,0.00007324424,0.00027980038,0.0000062978042,0.000015618902,8.5843965e-7,0.93740463,0.003550465,0.057883807,0.000019487183,0.0004128577],"about_ca_topic_score_codex":0.000038778573,"about_ca_topic_score_gemma":0.000016363934,"teacher_disagreement_score":0.49637955,"about_ca_system_score_codex":0.00028270436,"about_ca_system_score_gemma":0.0005050374,"threshold_uncertainty_score":0.9998611},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000693629,0.00033750947,0.9921137,0.0002518128,0.0018774498,0.00025642596,2.6146375e-7,0.00082907587,0.0036401318],"genre_scores_gemma":[0.35579044,0.000027468008,0.64224184,0.0006756349,0.00066518,0.00000954207,0.0000022446263,0.000051106235,0.0005365345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99560386,0.00006036536,0.00063834165,0.0018737387,0.000939081,0.0008846127],"domain_scores_gemma":[0.9977138,0.00035135308,0.00027135602,0.001320715,0.0001871252,0.00015566952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013948515,0.0005097545,0.0005390731,0.0012296283,0.00023569283,0.0006023762,0.003621203,0.00036369712,0.000035781264],"category_scores_gemma":[0.00017765553,0.0005051198,0.000092672875,0.0008236566,0.000429189,0.00075072894,0.0019442689,0.0012402612,0.000104779894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025768413,0.000014959189,0.00040464412,0.000037403377,0.0000055757973,0.00016030617,0.0027747364,0.40106884,0.00009148477,0.0055331024,0.000003940608,0.58990246],"study_design_scores_gemma":[0.00020072509,0.000075985496,0.0002021887,0.00054064795,0.0000023350506,0.000044565593,2.4823296e-7,0.9550353,0.0002876207,0.042697564,0.00038787426,0.0005249015],"about_ca_topic_score_codex":0.00004630883,"about_ca_topic_score_gemma":0.00019714757,"teacher_disagreement_score":0.5893775,"about_ca_system_score_codex":0.00058487494,"about_ca_system_score_gemma":0.00057148776,"threshold_uncertainty_score":0.99974006},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01104834,0.00015279214,0.98733306,0.0002551951,0.00048160597,0.0004519497,0.000015455056,0.000060061506,0.00020156012],"genre_scores_gemma":[0.36109558,0.0000029447974,0.63814247,0.0004144399,0.00027048768,0.0000053128083,0.000016685191,0.000016806944,0.0000352876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968224,0.00008514568,0.0006746274,0.0009083084,0.0011572669,0.0003522269],"domain_scores_gemma":[0.9971718,0.00036463776,0.0005751535,0.001514197,0.0003113049,0.00006287732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017123574,0.0003044705,0.0003481592,0.0002436402,0.0003637572,0.0002275879,0.0026849937,0.00016990596,0.000057336543],"category_scores_gemma":[0.000048225054,0.00022842952,0.00010440768,0.00052793085,0.0009900563,0.0003589423,0.0011448271,0.00042464954,0.000008095598],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054862703,0.000028682372,0.000030795407,0.00008838068,0.000018925715,0.0000019306053,0.0014859482,0.060033206,0.015766224,0.029361678,0.000011880275,0.89316684],"study_design_scores_gemma":[0.00012148952,0.000063948624,0.00011132656,0.00009643103,0.000009465526,0.000015175018,8.165599e-7,0.8101255,0.009278636,0.17987482,0.00006993339,0.00023243761],"about_ca_topic_score_codex":0.00006240276,"about_ca_topic_score_gemma":0.000056534653,"teacher_disagreement_score":0.89293444,"about_ca_system_score_codex":0.00020685857,"about_ca_system_score_gemma":0.0004252743,"threshold_uncertainty_score":0.93150854},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015421732,0.00032243642,0.9824564,0.00048510625,0.00028965922,0.00033068418,7.485254e-7,0.000027170669,0.0006660606],"genre_scores_gemma":[0.9855715,0.000017412567,0.013633678,0.0002230013,0.00014582255,0.0000065422437,0.0000011086412,0.000012725236,0.0003882279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812347,0.000155595,0.00032681544,0.0006655732,0.00041156713,0.00031700515],"domain_scores_gemma":[0.99818754,0.00091760926,0.0002889758,0.00043380714,0.00013780518,0.00003426473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019420291,0.00027041938,0.0003624164,0.0006917907,0.00014480362,0.00019732298,0.0009801309,0.00014354118,0.0000030652307],"category_scores_gemma":[0.00014406246,0.0001700189,0.000035115994,0.00053906586,0.00040636217,0.00028533684,0.00025032033,0.0008083922,0.0000035459982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031970958,0.000065324515,0.03010217,0.00019590445,0.000026223024,0.0000900742,0.16158327,0.042702932,0.0003385328,0.2911346,0.000004484111,0.4737245],"study_design_scores_gemma":[0.0017591573,0.0034989014,0.07068437,0.010625118,0.000024769017,0.0003740201,0.0005162215,0.8065577,0.004367703,0.08554114,0.013531887,0.0025189733],"about_ca_topic_score_codex":0.00008526598,"about_ca_topic_score_gemma":0.0008304976,"teacher_disagreement_score":0.97014976,"about_ca_system_score_codex":0.00010818266,"about_ca_system_score_gemma":0.00013269311,"threshold_uncertainty_score":0.693317},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014956442,0.0030247774,0.99351835,0.000115030125,0.0008868529,0.00040253354,0.0000071671034,0.00043586924,0.00011377551],"genre_scores_gemma":[0.09622793,0.00005032296,0.9024403,0.0006558715,0.00027247582,0.0000038537,0.000006838824,0.00003814273,0.0003042425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590206,0.000048416452,0.0005493025,0.0018773009,0.0009520653,0.0006708623],"domain_scores_gemma":[0.9973168,0.000247136,0.00046787423,0.0012774485,0.00049929554,0.00019148075],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00074618065,0.00060488266,0.00049300835,0.000768951,0.00049312017,0.0013271623,0.0030051912,0.0004253662,0.000025215451],"category_scores_gemma":[0.00022340976,0.00052667136,0.00007831826,0.00067291904,0.0016191024,0.0014752712,0.0028294872,0.00080375606,0.0000128819975],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022510096,0.00007679815,0.0013944682,0.00026351042,0.00001660538,0.0003470701,0.0047398764,0.0026228079,0.03135139,0.004792911,0.000020280959,0.9543518],"study_design_scores_gemma":[0.00026698902,0.00009326214,0.00013624468,0.0013456418,0.00000806257,0.0002089826,7.170196e-7,0.9477831,0.020462494,0.028865974,0.0000731621,0.00075537316],"about_ca_topic_score_codex":0.00010260374,"about_ca_topic_score_gemma":0.000056391553,"teacher_disagreement_score":0.9535964,"about_ca_system_score_codex":0.00026626178,"about_ca_system_score_gemma":0.00030258702,"threshold_uncertainty_score":0.9997185},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001539101,0.0003033506,0.9811889,0.0023946965,0.0024206294,0.0005873637,0.0000047117487,0.00025247916,0.012832466],"genre_scores_gemma":[0.009308128,0.000052676016,0.98501545,0.0015406964,0.00039422483,0.00002422431,0.000004637729,0.000042729294,0.0036172282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956714,0.00006414547,0.0005072295,0.0017936042,0.0012666445,0.0006970138],"domain_scores_gemma":[0.9961062,0.0002852783,0.00042766568,0.0024650746,0.00050921686,0.00020652902],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009854496,0.00057417684,0.0004942218,0.0007937254,0.00028430307,0.001655948,0.0047447016,0.0004375404,0.00008438854],"category_scores_gemma":[0.00022082601,0.00052741345,0.00013570685,0.00092788,0.000727288,0.002001719,0.0013861764,0.0007578799,0.00019839262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013368436,0.000022337132,0.000039199225,0.00004340646,0.000007954709,0.000006422946,0.0006983659,0.0020742405,0.00016562713,0.29586652,0.00012507064,0.7009495],"study_design_scores_gemma":[0.00018901117,0.00015733158,0.0001531522,0.00020415615,0.0000075243033,0.000050804785,3.4351714e-7,0.7063241,0.0054026763,0.26531088,0.02132244,0.0008775643],"about_ca_topic_score_codex":0.00001181108,"about_ca_topic_score_gemma":0.000010213373,"teacher_disagreement_score":0.70424986,"about_ca_system_score_codex":0.00036725812,"about_ca_system_score_gemma":0.00045146118,"threshold_uncertainty_score":0.9997178},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020526363,0.0017169961,0.9715474,0.00017007724,0.0030101156,0.0003860932,0.000016268667,0.00015106698,0.002475615],"genre_scores_gemma":[0.42228425,0.00009526821,0.5645292,0.0050993073,0.0073636877,0.0000064187752,0.00006778876,0.00013770408,0.00041641394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661714,0.000025014251,0.0004643612,0.0011272457,0.0009039217,0.000862295],"domain_scores_gemma":[0.9980239,0.00043798017,0.00022157685,0.0007072371,0.00033574097,0.00027355857],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004777444,0.00055312034,0.0006096494,0.0008828846,0.00039016604,0.00017298524,0.0005239684,0.00031976277,0.00021303567],"category_scores_gemma":[0.00007919825,0.00049817446,0.00032130614,0.0008605594,0.0027882094,0.00018090954,0.00016611963,0.00095005066,0.000038866918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010012559,0.0006412602,0.21679066,0.0007835792,0.0011808524,0.00032056615,0.004084417,0.5328598,0.026952503,0.0037207229,0.0031218666,0.20854251],"study_design_scores_gemma":[0.0068509756,0.005011061,0.055315863,0.010420115,0.0014090604,0.015355573,0.0000050958106,0.43072212,0.0010676782,0.3150785,0.15056212,0.008201852],"about_ca_topic_score_codex":0.000032808024,"about_ca_topic_score_gemma":0.000029689503,"teacher_disagreement_score":0.40701824,"about_ca_system_score_codex":0.00018151705,"about_ca_system_score_gemma":0.00043643953,"threshold_uncertainty_score":0.9999256},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080281785,0.00025769512,0.9869515,0.0006020538,0.0036170674,0.00034048245,0.000005653174,0.00018261606,0.000014797392],"genre_scores_gemma":[0.62930095,0.000023367369,0.36918184,0.00076448853,0.00067394093,0.0000088457155,0.000032693235,0.000013100688,7.9150703e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99490875,0.00024347799,0.00076908356,0.0020581342,0.0012023024,0.0008182674],"domain_scores_gemma":[0.9965437,0.00026786042,0.0004880328,0.001644869,0.00086166436,0.00019385252],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018770028,0.00048815287,0.0005343885,0.00089727493,0.00053821167,0.0015736739,0.0038567102,0.00043966752,0.000015426047],"category_scores_gemma":[0.00031119175,0.00047427882,0.00017103231,0.003523264,0.00076401955,0.001118692,0.004111531,0.0008117883,0.0000115011135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032224038,0.000034208522,0.0051541193,0.000020083384,0.00001251825,0.000013330364,0.00025359032,0.9362827,0.00042613648,0.00112378,0.000013486214,0.0566628],"study_design_scores_gemma":[0.0001389208,0.0000442582,0.002061542,0.00022331021,0.000014125473,0.000021069302,1.6996108e-7,0.95794064,0.00060265267,0.03842593,0.00002504404,0.0005023378],"about_ca_topic_score_codex":0.00023134329,"about_ca_topic_score_gemma":0.00014510386,"teacher_disagreement_score":0.62127274,"about_ca_system_score_codex":0.00066371995,"about_ca_system_score_gemma":0.0014516166,"threshold_uncertainty_score":0.9997709},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023759903,0.00047367343,0.9559991,0.00024345405,0.0067064976,0.0008223979,0.000019361096,0.00008231829,0.011893339],"genre_scores_gemma":[0.98973626,0.000089398105,0.0064246505,0.0005921967,0.0017477819,0.000024925124,0.00008823518,0.00003692375,0.0012596305],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978794,0.000075071985,0.00033082953,0.000870063,0.000565369,0.0002792844],"domain_scores_gemma":[0.9989042,0.00009157902,0.00020919033,0.0003656893,0.0003433977,0.00008594241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012179153,0.00026178724,0.00023315774,0.0005600023,0.00014317429,0.00010306495,0.00021513531,0.00038379044,0.0007804597],"category_scores_gemma":[0.000059198734,0.00023694093,0.00005120471,0.00015272443,0.0005474723,0.00018487152,0.000103564096,0.00032810547,0.0001656137],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031523385,0.00003519157,0.000111050234,0.000026511207,0.000014074263,0.000006363289,0.0023038916,0.0002977756,0.0002925636,0.0005943615,0.000102869875,0.9961838],"study_design_scores_gemma":[0.0057035084,0.002793921,0.04661388,0.0035791541,0.000352482,0.0009762382,0.000014937215,0.45047408,0.0045540812,0.4739226,0.008825705,0.0021894071],"about_ca_topic_score_codex":0.000019015672,"about_ca_topic_score_gemma":0.00006518985,"teacher_disagreement_score":0.9939944,"about_ca_system_score_codex":0.00016712182,"about_ca_system_score_gemma":0.00011638091,"threshold_uncertainty_score":0.9662171},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048779745,0.000500172,0.9463439,0.0012188666,0.0027803152,0.00027869974,0.0000011846549,0.000074456686,0.000022656637],"genre_scores_gemma":[0.72906053,0.000040562238,0.27043587,0.00011295891,0.0003314597,0.0000064716855,0.0000025978472,0.0000072768507,0.0000022847864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619186,0.00015526255,0.00072090724,0.0015834318,0.0008475415,0.00050097954],"domain_scores_gemma":[0.9975193,0.00017136314,0.00040024574,0.0015032468,0.0003383798,0.00006747168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002074874,0.00031890848,0.0005535726,0.00121597,0.00011771698,0.00035172023,0.0029274037,0.0002035515,0.000008595196],"category_scores_gemma":[0.0002693326,0.00029104628,0.00010407236,0.0034916308,0.0004005584,0.00047557155,0.0029617557,0.00056215987,0.00001093511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018435472,0.0002018001,0.0053064055,0.000179854,0.000025748319,0.000017627775,0.006039568,0.19260755,0.015193969,0.00031133098,0.00001963467,0.78007805],"study_design_scores_gemma":[0.00017102544,0.00008805334,0.011346563,0.0003407057,0.000004194118,0.0000044098183,6.816256e-7,0.882554,0.09833238,0.0066983933,0.00014806858,0.00031150627],"about_ca_topic_score_codex":0.00023499438,"about_ca_topic_score_gemma":0.00012984035,"teacher_disagreement_score":0.77976656,"about_ca_system_score_codex":0.00020617923,"about_ca_system_score_gemma":0.00039001863,"threshold_uncertainty_score":0.99995416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063219276,0.00007655335,0.99569076,0.00059064734,0.00093803497,0.0009772305,0.000010296469,0.00012860648,0.0009556687],"genre_scores_gemma":[0.8501719,0.00006300218,0.14746375,0.00075552415,0.0006130313,0.00012072413,0.00003707829,0.00005847369,0.0007165143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963655,0.00007971292,0.00067427265,0.0014555991,0.000720133,0.0007047998],"domain_scores_gemma":[0.9971982,0.00074065366,0.00038386983,0.0011952269,0.00028795464,0.00019405334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021084305,0.0004287362,0.00054238556,0.0007706436,0.0002659553,0.00074879,0.0022597115,0.00036333574,0.0000051960683],"category_scores_gemma":[0.0003116563,0.00040871667,0.0001191451,0.00069375086,0.000553755,0.00065997505,0.0006329896,0.00066256576,0.000037336227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016496253,0.00006523102,0.000033337077,0.00008290453,0.000012086096,0.000010673097,0.0018547621,0.3629765,0.00010960156,0.06101225,0.0001533145,0.57367283],"study_design_scores_gemma":[0.00031133083,0.00067556783,0.00011131498,0.0004088064,0.0000049697,0.000022976079,0.0000012963359,0.92481434,0.00023644582,0.069323696,0.0035901163,0.0004991335],"about_ca_topic_score_codex":0.00015904027,"about_ca_topic_score_gemma":0.00018917052,"teacher_disagreement_score":0.8495397,"about_ca_system_score_codex":0.00055729423,"about_ca_system_score_gemma":0.00047907652,"threshold_uncertainty_score":0.99983644},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1025189,0.00023314712,0.890102,0.0025797877,0.0030670294,0.0008086134,0.000056007328,0.00012574489,0.00050872035],"genre_scores_gemma":[0.85297346,0.00010746653,0.13322785,0.0032176983,0.0009303555,0.00007262299,0.00001821917,0.0000812861,0.009371024],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643236,0.000038973438,0.0006245567,0.0012611472,0.0012042088,0.00043874042],"domain_scores_gemma":[0.99635905,0.0014763353,0.0003642828,0.0012261227,0.00045951307,0.00011472507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017741796,0.0003720024,0.00042876435,0.0008000946,0.00066772406,0.0006161532,0.0023465937,0.00045257554,0.00029933054],"category_scores_gemma":[0.00077502045,0.00021936257,0.0001175696,0.0005296926,0.0025055017,0.00035396748,0.00089829974,0.00058346055,0.000039926897],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040667433,0.0000643899,0.02975727,0.000019582889,0.000035768528,0.00001705953,0.0034799068,0.00059796975,0.0000925499,0.021417882,0.0013687956,0.94310814],"study_design_scores_gemma":[0.0006365232,0.0004406923,0.015491869,0.00021449297,0.00004966932,0.00010717711,0.000032687643,0.011334798,0.0010129107,0.8837712,0.08596696,0.00094103126],"about_ca_topic_score_codex":0.000023066426,"about_ca_topic_score_gemma":0.00032908042,"teacher_disagreement_score":0.9421671,"about_ca_system_score_codex":0.00012780537,"about_ca_system_score_gemma":0.0002084046,"threshold_uncertainty_score":0.9231625},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002511931,0.000030698826,0.99474066,0.000010546215,0.00013336206,0.00012767807,0.000036553738,0.000034327793,0.0023742158],"genre_scores_gemma":[0.7382986,0.0000064912224,0.26114213,0.00004250962,0.000350339,0.0000047993135,0.00004463899,0.000018571842,0.00009195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979162,0.000017489885,0.0004905018,0.0007135313,0.00050894666,0.00035330356],"domain_scores_gemma":[0.998518,0.00021989101,0.00028767437,0.00069163385,0.00020323016,0.00007960294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042581582,0.00031286763,0.0007159853,0.0012209037,0.00010921956,0.0000837923,0.000811359,0.0000861842,0.0007226835],"category_scores_gemma":[0.0000051760876,0.00028831448,0.00023345163,0.0011349972,0.00077344617,0.00010291176,0.0004916674,0.00033004343,0.0000068556237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012160568,0.00005040518,0.009513789,0.000034201163,0.00072005036,0.000005309954,0.0004716093,0.08781298,0.000055002638,0.004749966,0.000042713982,0.8965318],"study_design_scores_gemma":[0.00006782526,0.00009206929,0.001545774,0.00012163649,0.0003315617,7.1070644e-7,1.9699618e-7,0.96001506,0.00038021876,0.036998205,0.00012475846,0.0003219663],"about_ca_topic_score_codex":0.00008062378,"about_ca_topic_score_gemma":0.000073384894,"teacher_disagreement_score":0.89620984,"about_ca_system_score_codex":0.0000629573,"about_ca_system_score_gemma":0.000103906954,"threshold_uncertainty_score":0.9999569},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005665962,0.000068543224,0.9938537,0.0012389318,0.0010816221,0.0020774798,0.0000010730705,0.00013261591,0.0014894056],"genre_scores_gemma":[0.34858704,0.00002773721,0.64565563,0.0027727678,0.00082858844,0.00040706186,0.0000062808267,0.00006891206,0.0016459633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964313,0.000039552066,0.00058608607,0.0015802636,0.0007956063,0.0005671733],"domain_scores_gemma":[0.9971515,0.0002346853,0.0003621167,0.0018414146,0.00027933432,0.0001309818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006905268,0.00040746722,0.00037171255,0.000957017,0.00015001415,0.00031800737,0.0033868756,0.00028034116,0.000056800436],"category_scores_gemma":[0.00012442133,0.00040267644,0.000082201834,0.00079382816,0.00082101504,0.0012303756,0.0011342093,0.0005905002,0.00025397664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010182102,0.000113092465,0.00010116128,0.0000767747,0.000006935574,0.00010615216,0.0050707716,0.0022921085,0.00026306708,0.59402496,0.000037601363,0.3978972],"study_design_scores_gemma":[0.00019385671,0.00007433895,0.00014276475,0.00023741242,0.0000020654588,0.000036245263,7.811491e-8,0.19730623,0.0013139487,0.79873097,0.0015799083,0.00038215533],"about_ca_topic_score_codex":0.000006663066,"about_ca_topic_score_gemma":0.00004288093,"teacher_disagreement_score":0.39751506,"about_ca_system_score_codex":0.00044357663,"about_ca_system_score_gemma":0.00038866582,"threshold_uncertainty_score":0.9998425},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007097284,0.0010131154,0.995403,0.00026058126,0.0011108916,0.0009115137,0.00001442582,0.00041426634,0.0008012276],"genre_scores_gemma":[0.35725868,0.000029332585,0.64157236,0.00033243143,0.00031381228,0.00025941693,0.000004155381,0.00005292255,0.00017689675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592245,0.000038044873,0.0006513992,0.0020496885,0.0005275554,0.0008108888],"domain_scores_gemma":[0.99682826,0.0008155971,0.0002758365,0.0012736566,0.0004786701,0.0003279918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010337951,0.0006706374,0.00075207296,0.00054003287,0.00053433015,0.00083893025,0.0024432822,0.0004149342,0.000005873491],"category_scores_gemma":[0.00016454913,0.00061385403,0.00013132143,0.0003524509,0.00090478646,0.0005248192,0.0011773963,0.00047541058,0.00001810565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002169167,0.00016465457,0.000029315213,0.0010302716,0.000042419077,0.000042931253,0.010967182,0.10087809,0.00005734895,0.25061646,0.0004773732,0.6356723],"study_design_scores_gemma":[0.0002514223,0.00023816648,0.0000021902315,0.0013338872,0.00001292426,0.00005162984,5.759189e-7,0.8564913,0.00011945207,0.14075513,0.00012765476,0.0006156429],"about_ca_topic_score_codex":0.00001443686,"about_ca_topic_score_gemma":0.000043731685,"teacher_disagreement_score":0.7556132,"about_ca_system_score_codex":0.0003611865,"about_ca_system_score_gemma":0.0009091097,"threshold_uncertainty_score":0.9996313},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006835121,0.0022880933,0.9949751,0.0002211059,0.0011704676,0.00025797944,0.0000072051475,0.00025861556,0.00013793792],"genre_scores_gemma":[0.095301665,0.000048753413,0.90354145,0.0006969487,0.0002607772,0.0000026094215,0.000005250109,0.000033637087,0.00010889436],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99618405,0.00003606968,0.00062332884,0.0013737591,0.0011737121,0.0006090909],"domain_scores_gemma":[0.9974222,0.00020795382,0.00067178445,0.0011636146,0.00040843082,0.00012600598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009140095,0.0005087569,0.00059446803,0.0007848784,0.00021777237,0.0005545868,0.0044506006,0.00034541386,0.000018826164],"category_scores_gemma":[0.000100126905,0.00045011603,0.00014221328,0.0007366144,0.0012250941,0.0011309661,0.0016195563,0.00066776003,0.000008355559],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014515126,0.00007762036,0.00016029768,0.0003961454,0.00005036205,0.0001754617,0.004113047,0.0004705971,0.047208153,0.007931907,0.0001744588,0.93922746],"study_design_scores_gemma":[0.00024480623,0.00027075995,0.000013474123,0.0029614898,0.000027450054,0.00016787935,0.0000011160554,0.3053506,0.17999719,0.50909233,0.00041437958,0.0014585148],"about_ca_topic_score_codex":0.00005448491,"about_ca_topic_score_gemma":0.000016369937,"teacher_disagreement_score":0.93776894,"about_ca_system_score_codex":0.00023200709,"about_ca_system_score_gemma":0.0003409443,"threshold_uncertainty_score":0.9997951},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033921262,0.0002700226,0.99105626,0.00039513834,0.0018792456,0.0004036664,0.0000029303126,0.00005082748,0.00560268],"genre_scores_gemma":[0.04022162,0.000012014469,0.95541584,0.0029946174,0.00071203965,0.000016317423,0.000003610857,0.000041946692,0.00058197003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957517,0.00010579595,0.0005273324,0.0018898126,0.0009701249,0.00075523014],"domain_scores_gemma":[0.9967209,0.0010445256,0.00040301288,0.0010838779,0.0005703462,0.00017732324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016510986,0.0005834652,0.00059041556,0.0008167605,0.0004143348,0.00073427445,0.0023320345,0.00028853427,0.0000799312],"category_scores_gemma":[0.00035354265,0.00053019816,0.0001563274,0.00047693503,0.0006091414,0.0009492473,0.0019095478,0.0007564136,0.00007931649],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003009988,0.00007077273,0.000035684585,0.00006895021,0.00005960078,0.00014721116,0.0067123338,0.0013837265,0.06655022,0.017023051,0.00008080271,0.90783757],"study_design_scores_gemma":[0.0005010413,0.00085033244,0.00012945573,0.00074033125,0.000033322765,0.0002906796,0.0000017698422,0.86972886,0.02961892,0.09596487,0.0010825937,0.0010578382],"about_ca_topic_score_codex":0.00002015834,"about_ca_topic_score_gemma":0.000022033653,"teacher_disagreement_score":0.9067797,"about_ca_system_score_codex":0.00032105067,"about_ca_system_score_gemma":0.00036702806,"threshold_uncertainty_score":0.999715},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013316417,0.0001462422,0.9964179,0.0005277594,0.000778298,0.00029595723,0.000015064751,0.00006121217,0.00042591916],"genre_scores_gemma":[0.44057962,0.000019271334,0.5560284,0.0012601601,0.0015628596,0.000011311429,0.000020763033,0.000043866887,0.00047370652],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794203,0.000015166905,0.0003190634,0.00082278316,0.0005067974,0.00039413088],"domain_scores_gemma":[0.9982411,0.00066214585,0.00013975422,0.00052326545,0.00027844653,0.00015527011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050411065,0.00027990428,0.00048910594,0.00039631774,0.00014988634,0.00011232486,0.00027951295,0.00016811638,0.00010071993],"category_scores_gemma":[0.00072859426,0.00023333808,0.0001343466,0.0001661638,0.00082879094,0.000050632014,0.00010645898,0.0005955576,0.000045428056],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000919079,0.000039173472,0.00023942532,0.00022446,0.000040115876,0.00011994033,0.00021968548,0.00027312443,0.0005573144,0.0013406421,0.00007952528,0.9967747],"study_design_scores_gemma":[0.0004284028,0.0012545699,0.00036620838,0.0017837151,0.00027242675,0.00021420035,3.1091497e-7,0.32247937,0.013466903,0.65694886,0.002190134,0.0005949189],"about_ca_topic_score_codex":0.000006210021,"about_ca_topic_score_gemma":0.0000037230934,"teacher_disagreement_score":0.99617976,"about_ca_system_score_codex":0.00015783466,"about_ca_system_score_gemma":0.0001642107,"threshold_uncertainty_score":0.9515251},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009065554,0.00007564791,0.98996615,0.0006345416,0.0019340992,0.0013240804,0.00020747175,0.00015678766,0.0047946665],"genre_scores_gemma":[0.12203653,0.000007421191,0.87215835,0.0017087251,0.002658638,0.000052754593,0.000026713347,0.00014330444,0.0012075412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98945755,0.00012126261,0.0019320247,0.0033739598,0.0036911874,0.0014240348],"domain_scores_gemma":[0.9845472,0.010842775,0.0011576738,0.0018912408,0.0011210376,0.00044005166],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0061386167,0.0010746464,0.0013733748,0.0020452766,0.00088769157,0.0016932783,0.0046244673,0.00070540747,0.00038733555],"category_scores_gemma":[0.004379728,0.00089722837,0.0005111111,0.00106212,0.0042307028,0.00057687983,0.0017042572,0.0012617204,0.000201664],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007587154,0.00002426024,0.000022500906,0.000027878648,0.000040599818,0.00008802594,0.0028270741,0.030669624,0.00036573876,0.0011353875,0.00012353527,0.9645995],"study_design_scores_gemma":[0.0011747598,0.0010601232,0.00009738692,0.0010697366,0.00004631891,0.00032137663,0.000022341714,0.89209235,0.0036671774,0.07658914,0.022150986,0.0017083341],"about_ca_topic_score_codex":0.000019333858,"about_ca_topic_score_gemma":0.00017450447,"teacher_disagreement_score":0.96289116,"about_ca_system_score_codex":0.00053233246,"about_ca_system_score_gemma":0.000981958,"threshold_uncertainty_score":0.99934787},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013580428,0.00015778751,0.9962847,0.00020633137,0.0013422074,0.0006904067,0.000012092073,0.00012825473,0.0010423865],"genre_scores_gemma":[0.19732451,0.0000058723845,0.8017145,0.0001121591,0.0006481983,0.00002674483,0.000004582804,0.000043163298,0.0001202975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955265,0.000038886268,0.00078509125,0.0015052457,0.0012564844,0.0008878143],"domain_scores_gemma":[0.99656296,0.00092571706,0.00037510434,0.0014133413,0.00052771176,0.00019514485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084616727,0.00050613866,0.0008355509,0.00083754136,0.00025194863,0.00049044436,0.0036817358,0.00033401075,0.000026433456],"category_scores_gemma":[0.00014879237,0.0004809058,0.00017139828,0.00045469945,0.0015289679,0.00063747814,0.0026243145,0.00081599446,0.000013231993],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047559708,0.000055716406,0.00002209079,0.00023066858,0.000021306894,0.000020087535,0.002909911,0.06401666,0.00086629257,0.007063191,0.000014073094,0.92473245],"study_design_scores_gemma":[0.00034404427,0.0008313085,0.00002291944,0.00033883742,0.0000044327285,0.000022168566,0.0000012017732,0.8600181,0.003581599,0.13399744,0.00040941485,0.00042857075],"about_ca_topic_score_codex":0.000029246721,"about_ca_topic_score_gemma":0.00020691186,"teacher_disagreement_score":0.9243039,"about_ca_system_score_codex":0.00026685366,"about_ca_system_score_gemma":0.0009746122,"threshold_uncertainty_score":0.99976426},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9480452,0.000627,0.039758988,0.0006114424,0.0006273588,0.0007302163,0.00001722904,0.000020052712,0.009562496],"genre_scores_gemma":[0.99836844,0.000009387281,0.001030775,0.0000898044,0.00014211448,0.000003009224,0.0000027895462,0.000015900323,0.00033778476],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99782413,0.000114037284,0.00032373323,0.0007564706,0.0005114186,0.00047021982],"domain_scores_gemma":[0.9984887,0.0008198951,0.00014419106,0.00032185615,0.00016695976,0.000058391175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093276374,0.00024393985,0.00045575804,0.00068274344,0.0000961935,0.000024131119,0.0005918716,0.00030144933,0.00022026629],"category_scores_gemma":[0.000043573506,0.00018912514,0.000086398046,0.00022062557,0.0020201188,0.000089165456,0.00034075955,0.00068155216,0.000014732569],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017200297,0.00035129214,0.044020217,0.0003066541,0.00016571334,0.0002231145,0.2991077,0.0002473027,0.00048620976,0.0033508441,0.00017257976,0.64984834],"study_design_scores_gemma":[0.007735999,0.015315066,0.8590122,0.02459065,0.000084512496,0.0004782877,0.0003122038,0.039837465,0.014268933,0.035247903,0.000036722187,0.0030800537],"about_ca_topic_score_codex":0.00043556647,"about_ca_topic_score_gemma":0.00011052971,"teacher_disagreement_score":0.814992,"about_ca_system_score_codex":0.00019193678,"about_ca_system_score_gemma":0.00019703168,"threshold_uncertainty_score":0.7712299},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001525906,0.00015355466,0.99359447,0.0003151982,0.0021054402,0.0012723157,0.000006791201,0.0003082105,0.0007181355],"genre_scores_gemma":[0.3991989,0.0000028705256,0.59793425,0.0010982145,0.0014417547,0.00008467766,0.00004346013,0.00008252233,0.00011336409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938581,0.0001416237,0.0006801553,0.0024970402,0.002006421,0.000816685],"domain_scores_gemma":[0.99555576,0.00028708976,0.0004556002,0.00210549,0.001306526,0.00028953992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035263633,0.0006705501,0.00061286386,0.0007477957,0.0005840591,0.00060552265,0.0047300975,0.00049695297,0.00007738407],"category_scores_gemma":[0.0003080978,0.0006479034,0.00014501392,0.00061133166,0.00086485257,0.0022608358,0.00042360893,0.00086672005,0.000017746177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026367963,0.00007652811,0.00005016346,0.00010915431,0.000020196481,0.000009918839,0.0047579496,0.45059323,0.00030952727,0.010474367,0.000017093436,0.5335555],"study_design_scores_gemma":[0.00042394854,0.0006672528,0.00006841003,0.00019691393,0.000026940521,0.000022005604,7.555092e-7,0.80867493,0.0010063509,0.18793695,0.0003037882,0.0006717843],"about_ca_topic_score_codex":0.00001534912,"about_ca_topic_score_gemma":0.00013415144,"teacher_disagreement_score":0.5328837,"about_ca_system_score_codex":0.00042252848,"about_ca_system_score_gemma":0.0014257885,"threshold_uncertainty_score":0.99959725},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6508243,0.0035698304,0.27749115,0.011100618,0.00314236,0.0066885385,0.00024221295,0.0012566543,0.045684326],"genre_scores_gemma":[0.9803076,0.000036676043,0.018902985,0.00019411395,0.00039980718,0.000010798887,0.000007264313,0.00003430645,0.000106489126],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966369,0.000038851915,0.0003950031,0.0013267657,0.000924801,0.00067765923],"domain_scores_gemma":[0.9971035,0.0012117884,0.0006835486,0.00043568417,0.00043352268,0.00013194443],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005907727,0.00042907588,0.00045213813,0.00077326066,0.00039374578,0.002023101,0.0009862834,0.00044715955,0.000019932586],"category_scores_gemma":[0.0016369055,0.0003650244,0.00003158097,0.0010337677,0.003989047,0.0033621222,0.0004982717,0.0007711857,0.000012691053],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011338869,0.00007643407,0.008709541,0.000056272613,0.000021103355,0.00028992048,0.18125705,0.00005242518,0.0000028589905,0.002022955,0.000013387429,0.80738467],"study_design_scores_gemma":[0.016627705,0.00528319,0.041307464,0.088506676,0.00023204954,0.001061098,0.003174515,0.038467344,0.0011483931,0.72735447,0.0601273,0.01670981],"about_ca_topic_score_codex":0.000069188056,"about_ca_topic_score_gemma":0.004100411,"teacher_disagreement_score":0.79067487,"about_ca_system_score_codex":0.0003009526,"about_ca_system_score_gemma":0.0010683724,"threshold_uncertainty_score":0.9998802},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007006052,0.00029505786,0.9961997,0.000058089157,0.0019932047,0.0003832661,0.000007955037,0.00021320439,0.0007794146],"genre_scores_gemma":[0.11294918,0.000068992325,0.88602024,0.00026930004,0.00050703407,0.000008295049,0.000014391794,0.00007284785,0.00008973825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982288,0.000008117045,0.00032096502,0.00056320964,0.0004419945,0.0004369552],"domain_scores_gemma":[0.9982261,0.0009502957,0.000046789057,0.00048629634,0.00017576649,0.0001147717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005196982,0.00030306858,0.00031451066,0.00035757656,0.00015857158,0.00021797958,0.00066521706,0.00041620678,0.00008604728],"category_scores_gemma":[0.00009404658,0.00028494865,0.00008816343,0.00029409386,0.00044178276,0.00010507488,0.00016996775,0.00064265257,0.000053942018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057441866,0.000003650552,0.000008717231,0.000044149587,0.000005079661,0.0000026438968,0.00036975968,0.7359271,0.0000059106183,0.0019218243,0.00003415029,0.26167127],"study_design_scores_gemma":[0.00014370179,0.000079380676,0.000007348651,0.00079423754,0.000004418808,0.000006665825,1.8732342e-7,0.86301774,0.00034142687,0.13336855,0.0019335388,0.0003028058],"about_ca_topic_score_codex":0.0000019680724,"about_ca_topic_score_gemma":0.000026471704,"teacher_disagreement_score":0.26136848,"about_ca_system_score_codex":0.0001801188,"about_ca_system_score_gemma":0.00008794433,"threshold_uncertainty_score":0.99996024},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011492862,0.00021165061,0.9935449,0.00031602127,0.00026535455,0.00036571207,0.000009121048,0.00010738099,0.0050649485],"genre_scores_gemma":[0.026954683,0.000008085404,0.9660689,0.00045884534,0.0055832816,0.000031374886,0.000026104852,0.00008697418,0.0007816984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720037,0.000038545288,0.00034140362,0.0010403377,0.00066825486,0.0007110787],"domain_scores_gemma":[0.99734074,0.0002827076,0.0003038425,0.0016841431,0.00027892756,0.0001096491],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006143711,0.00056193536,0.0005689478,0.00021277479,0.0005458849,0.0004184827,0.0025257727,0.00013174674,0.0003198853],"category_scores_gemma":[0.0000028491336,0.0003680777,0.00017987279,0.00062492583,0.0012928318,0.00018199724,0.0012293811,0.00076505664,0.00001017594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008570645,0.000014947024,0.0002262949,0.0000058034543,0.00007088404,0.000010909769,0.00026075137,0.37757874,0.000001620181,0.0015973978,0.0012323876,0.6189917],"study_design_scores_gemma":[0.00025171315,0.00014384014,0.000038101003,0.0004869902,0.000102197526,0.000014492626,8.20555e-7,0.8946124,0.00013523498,0.09798289,0.005423822,0.00080751244],"about_ca_topic_score_codex":0.000060341496,"about_ca_topic_score_gemma":0.0002406316,"teacher_disagreement_score":0.6181842,"about_ca_system_score_codex":0.000111491005,"about_ca_system_score_gemma":0.00018730717,"threshold_uncertainty_score":0.9998771},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016777966,0.00020796189,0.97959787,0.000049182487,0.00010699536,0.0002190097,0.0000030064425,0.00005532624,0.0029826972],"genre_scores_gemma":[0.9588373,0.000007825994,0.03997685,0.00015946206,0.00093666656,0.000009900195,0.00000963452,0.000030032354,0.000032385065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834156,0.00004479829,0.00033316528,0.000534332,0.00027829525,0.00046783287],"domain_scores_gemma":[0.9989137,0.00028551082,0.00024178435,0.0004121225,0.00009952195,0.00004736764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004721865,0.00037332886,0.0005146353,0.00028837527,0.00041722425,0.00026914195,0.0006097837,0.00012244422,0.00006360486],"category_scores_gemma":[0.000002515601,0.00034797148,0.00006453219,0.00032884695,0.0007889797,0.00020608478,0.000544464,0.0008188738,0.0000011250943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023895165,0.000024047693,0.0103700785,0.000025514955,0.00004374801,0.000008796764,0.0041756327,0.092226446,0.0000075330954,0.0027231702,0.000027744443,0.89034337],"study_design_scores_gemma":[0.00029417637,0.000106701526,0.0013014247,0.0009100222,0.000022487266,0.000005959015,0.000008039536,0.93533397,0.000047913833,0.060636662,0.00062943716,0.0007031949],"about_ca_topic_score_codex":0.00038550928,"about_ca_topic_score_gemma":0.001348599,"teacher_disagreement_score":0.9420593,"about_ca_system_score_codex":0.0001117226,"about_ca_system_score_gemma":0.00008569902,"threshold_uncertainty_score":0.99989724},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029627313,0.0008609173,0.992904,0.0014018232,0.0003965991,0.0001401271,0.000015965745,0.00007098894,0.0012468379],"genre_scores_gemma":[0.5828026,0.0021359003,0.40215698,0.0017302275,0.00080052804,0.0000012154317,0.00003606976,0.000060829556,0.010275675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976824,0.000037517402,0.000291274,0.0010174501,0.0005963483,0.0003750154],"domain_scores_gemma":[0.9979166,0.0003336794,0.0002472558,0.0012323001,0.00014581029,0.00012437248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000529225,0.00031092708,0.00044805274,0.00040393003,0.00040023282,0.00012335808,0.0027957193,0.00020993532,0.00001826918],"category_scores_gemma":[0.00003395913,0.00024319722,0.00012177122,0.00045775506,0.0013178015,0.0003515889,0.0018957752,0.00046531158,0.000022091526],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011032804,0.000021683432,0.00027097386,0.00003741709,0.00003926875,0.00019866975,0.0058003315,0.0075619863,0.00015255807,0.0014364532,0.0003115128,0.9841581],"study_design_scores_gemma":[0.0011078406,0.0005276566,0.0017332596,0.0007771949,0.00010216225,0.00057654275,0.000003771647,0.9036919,0.002474292,0.013170388,0.07406417,0.0017708353],"about_ca_topic_score_codex":0.00016679335,"about_ca_topic_score_gemma":0.00032416347,"teacher_disagreement_score":0.9823873,"about_ca_system_score_codex":0.00010795098,"about_ca_system_score_gemma":0.00022538059,"threshold_uncertainty_score":0.9917295},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001383174,0.000086258246,0.9658269,0.0004488169,0.0029272255,0.00041044553,0.000013813152,0.00021747612,0.028685879],"genre_scores_gemma":[0.41899398,0.0001371204,0.44367012,0.0992878,0.004896621,0.00006545844,0.000030014322,0.0003326423,0.032586243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965615,0.00007780556,0.0006781977,0.0009385268,0.0009146389,0.00082932867],"domain_scores_gemma":[0.99709046,0.0012698112,0.00035899234,0.0010037294,0.00009306358,0.0001839205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007016336,0.0005310658,0.0005038101,0.00079633744,0.00023738478,0.00046024896,0.0031844547,0.00033358482,0.00007143998],"category_scores_gemma":[0.0005030695,0.00044655372,0.00012803279,0.0008425889,0.0012746579,0.00060208153,0.0011997793,0.0010808595,0.0002454459],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025046218,0.00013183677,0.000064482316,0.00027463882,0.000009254142,0.00018902626,0.01206911,0.014192837,0.0048571206,0.0035348993,0.0070233494,0.95762837],"study_design_scores_gemma":[0.0010620293,0.0010161034,0.000117705385,0.0018198454,0.000021386502,0.00068696274,0.0000016259216,0.34638518,0.30484673,0.2256408,0.11534325,0.003058371],"about_ca_topic_score_codex":0.000008583616,"about_ca_topic_score_gemma":0.000020876101,"teacher_disagreement_score":0.95457006,"about_ca_system_score_codex":0.00026175234,"about_ca_system_score_gemma":0.00084355,"threshold_uncertainty_score":0.9997986},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040384824,0.00011321174,0.9821475,0.00054858235,0.0005736588,0.00032903644,0.0000018160681,0.0001994157,0.012048277],"genre_scores_gemma":[0.8707644,0.00002172243,0.11752992,0.007042885,0.0030817685,0.000014776084,0.00003186595,0.00014249112,0.0013702218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972156,0.000011364644,0.00045469895,0.001128362,0.00059249945,0.0005974356],"domain_scores_gemma":[0.9983825,0.00021358002,0.00040617315,0.0006674988,0.0003047913,0.00002545097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085584127,0.0005353301,0.0006209037,0.0011200568,0.00024567312,0.00046836757,0.0010419767,0.00023059176,0.0002132969],"category_scores_gemma":[0.00013454705,0.00044311018,0.00010453493,0.0011321446,0.0012292749,0.00124294,0.0005748066,0.0005595987,0.00008809211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002740302,0.0001296324,0.0070486786,0.0005476222,0.00016731175,0.0006282195,0.0010166032,0.686877,0.00038572584,0.09864389,0.00015927864,0.204122],"study_design_scores_gemma":[0.0011368433,0.00007861396,0.00020020317,0.002022565,0.00010513263,0.000027628992,0.000004800296,0.29190117,0.00040025942,0.6949536,0.00766063,0.0015085216],"about_ca_topic_score_codex":0.00008426809,"about_ca_topic_score_gemma":0.0006441796,"teacher_disagreement_score":0.86672586,"about_ca_system_score_codex":0.00017806087,"about_ca_system_score_gemma":0.00013566006,"threshold_uncertainty_score":0.99980205},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019839059,0.0002622166,0.99459743,0.0012436237,0.0017755475,0.001110632,0.000008558976,0.0002648032,0.0007173239],"genre_scores_gemma":[0.15395129,0.000036980633,0.84223795,0.0015362478,0.0017295491,0.00014215901,0.00008103614,0.00005805989,0.00022670708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618393,0.000035852467,0.0006745249,0.0017817874,0.00060714385,0.0007167455],"domain_scores_gemma":[0.9963076,0.00081962993,0.0005434394,0.0015053218,0.00064310664,0.00018088277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053948484,0.000523393,0.0004292392,0.000495827,0.0004866781,0.00046074754,0.0028407942,0.00034512827,0.000026402085],"category_scores_gemma":[0.000102283186,0.000521857,0.00017238932,0.0006700606,0.001036289,0.001047173,0.00081115396,0.00061416195,0.00004311179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003092181,0.000045724704,0.000037457252,0.000033121796,0.000019323075,0.000008339226,0.0003658954,0.22144832,0.00058549544,0.10029107,0.0005383353,0.676596],"study_design_scores_gemma":[0.00018853323,0.00011802547,0.000109024986,0.00006390023,0.000008787854,0.000030559335,1.2958428e-7,0.83264387,0.0000852245,0.16471975,0.0015955089,0.0004366752],"about_ca_topic_score_codex":0.0000028765542,"about_ca_topic_score_gemma":0.000051628096,"teacher_disagreement_score":0.6761593,"about_ca_system_score_codex":0.00038529147,"about_ca_system_score_gemma":0.00018740512,"threshold_uncertainty_score":0.9997233},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012881,0.000022554006,0.9838077,0.00017628491,0.0015346424,0.00057155977,0.00003225483,0.00016049496,0.0008134965],"genre_scores_gemma":[0.97652406,0.0000060900343,0.020775048,0.0011743584,0.00095950405,0.000020241947,0.000023535424,0.00005873926,0.00045842747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969423,0.000053711636,0.00042266803,0.0014717254,0.0005471401,0.0005624963],"domain_scores_gemma":[0.99820966,0.0009627959,0.00017181251,0.00035383063,0.00019070283,0.000111175614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052565517,0.00044469463,0.00034414968,0.0004516181,0.00041747603,0.0004770619,0.0007771163,0.00031470833,0.00014599027],"category_scores_gemma":[0.00020418382,0.00040927547,0.00016218699,0.00022055004,0.00069284847,0.00064857,0.00010338994,0.00078857644,0.00004698284],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007142458,0.000043548298,0.000007728887,0.00014723459,0.0000040091372,0.000023859258,0.00036570264,0.06746651,0.09285963,0.00020634015,0.00001691786,0.8387871],"study_design_scores_gemma":[0.0005548879,0.0009709726,0.000026638209,0.00041257302,0.000022423905,0.00004196874,7.637198e-7,0.57233095,0.40196034,0.021083498,0.0018276194,0.0007673603],"about_ca_topic_score_codex":0.000010802739,"about_ca_topic_score_gemma":0.00003702457,"teacher_disagreement_score":0.9636431,"about_ca_system_score_codex":0.0001809507,"about_ca_system_score_gemma":0.00026087777,"threshold_uncertainty_score":0.9998359},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084148045,0.00080311194,0.9761505,0.002156376,0.0011735529,0.0005018751,0.000014197038,0.000078828656,0.018280068],"genre_scores_gemma":[0.95168036,0.0010539339,0.044214454,0.00034999693,0.0021657757,0.0000118671405,0.0000023513624,0.0000310334,0.00049022475],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731076,0.00006768524,0.0003815033,0.0010413349,0.00069945084,0.0004992451],"domain_scores_gemma":[0.9972744,0.0015082443,0.00017681571,0.00031975252,0.0005053312,0.00021545008],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011373612,0.0002979754,0.00029600575,0.00041751706,0.0012266532,0.00047178834,0.00063164986,0.0003243407,0.00014139395],"category_scores_gemma":[0.0013644071,0.00029800713,0.000046013938,0.0003850461,0.011050936,0.0004658236,0.00036009034,0.0005189861,0.000044178698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018413459,0.000026499973,0.000029493674,0.000016717353,0.000011401707,0.000012994356,0.10801404,0.0015243085,0.000021489303,0.3380708,0.000015766389,0.55223805],"study_design_scores_gemma":[0.0000125715505,0.0002618372,0.00006783537,0.00020436046,0.000049658644,0.00000796114,0.0007113027,0.03937956,0.00039705276,0.9567767,0.0016661005,0.0004650821],"about_ca_topic_score_codex":0.00013365697,"about_ca_topic_score_gemma":0.0031157483,"teacher_disagreement_score":0.95083886,"about_ca_system_score_codex":0.00025635207,"about_ca_system_score_gemma":0.0005070812,"threshold_uncertainty_score":0.9999472},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017335014,0.00022469496,0.99437934,0.00022812487,0.00074072834,0.00029203677,0.0000058710752,0.00007429888,0.004037544],"genre_scores_gemma":[0.0048787715,0.0000094426405,0.9932745,0.00025464923,0.00052029133,0.0000028275156,0.0000032614744,0.000022361715,0.0010338657],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996803,0.000018909033,0.00054117845,0.0011156822,0.0010657368,0.00045551787],"domain_scores_gemma":[0.99722534,0.0002666816,0.00032021137,0.0017576606,0.00022217068,0.00020794313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057700754,0.00037942207,0.00053752266,0.00046939502,0.00011046993,0.00024858865,0.0038016532,0.00025177095,0.00022015214],"category_scores_gemma":[0.00007604315,0.00030089205,0.00011067943,0.00042238607,0.00053919177,0.0005637061,0.0024209523,0.00042328238,0.000087880806],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057297098,0.000041467887,0.0000046889336,0.00007276587,0.0000097530865,0.000032962314,0.0010286481,0.0006528309,0.00015294238,0.040894747,0.0005572165,0.95654625],"study_design_scores_gemma":[0.00022121548,0.00027016053,0.000016211854,0.0007126303,0.000006159749,0.000057414436,8.965658e-8,0.43277234,0.0042334725,0.5583964,0.002897095,0.00041683778],"about_ca_topic_score_codex":0.000013712115,"about_ca_topic_score_gemma":0.000009728049,"teacher_disagreement_score":0.95612943,"about_ca_system_score_codex":0.0000906588,"about_ca_system_score_gemma":0.00067848165,"threshold_uncertainty_score":0.9999443},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49501336,0.002416053,0.44857976,0.028371684,0.0036652952,0.017479727,0.00030706625,0.00007443842,0.004092625],"genre_scores_gemma":[0.9935166,0.0002405061,0.00087070436,0.0048303953,0.00032595836,0.00012137069,0.000040175033,0.000012230783,0.0000420259],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966745,0.00031349837,0.0013253739,0.00049513753,0.0009285958,0.00026289432],"domain_scores_gemma":[0.9930456,0.0048641674,0.0008094023,0.00058676425,0.00062216446,0.00007190171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037017288,0.0002750149,0.0007465381,0.00035078597,0.00010359648,0.00004773411,0.0004894615,0.00013418662,0.00007053097],"category_scores_gemma":[0.0020635212,0.0001560606,0.000069928145,0.00059940876,0.0009244761,0.00010236981,0.00006382455,0.00041395728,0.000010692882],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007924989,0.0002503757,0.0010555836,0.0010868399,0.0000691958,0.000020338435,0.100813895,0.0054568974,0.0011205527,0.13607138,0.0034369833,0.7498255],"study_design_scores_gemma":[0.06191362,0.1264198,0.105663784,0.10661059,0.00204714,0.00071932666,0.06993265,0.06896874,0.06221861,0.09002042,0.29603007,0.009455261],"about_ca_topic_score_codex":0.0006520177,"about_ca_topic_score_gemma":0.0007089615,"teacher_disagreement_score":0.7403702,"about_ca_system_score_codex":0.00016510699,"about_ca_system_score_gemma":0.00067481596,"threshold_uncertainty_score":0.6363967},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000083215255,0.00090528117,0.97739613,0.0003592934,0.0015220135,0.00031046694,0.0000040340883,0.00015066101,0.019343812],"genre_scores_gemma":[0.08996916,0.00008013352,0.9076147,0.0006917026,0.0006211523,0.0000050884414,0.0000036536019,0.00005123809,0.0009631836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950819,0.00014624867,0.00082278124,0.0018470131,0.0012282665,0.0008738042],"domain_scores_gemma":[0.99594605,0.0010185713,0.00064485025,0.0017231754,0.00038697515,0.00028035385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019550011,0.0007038911,0.0009238662,0.0021672926,0.0002840945,0.00038911766,0.0041344524,0.00057802256,0.000068192254],"category_scores_gemma":[0.00039501916,0.0006145038,0.00027236456,0.0017205118,0.0010403194,0.00053810386,0.0014623778,0.0013121304,0.00003676915],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070551423,0.0000282276,0.000039178216,0.00006953245,0.00002024411,0.0000628453,0.0010361891,0.0034242645,0.00014822258,0.051066905,0.000046443998,0.9440509],"study_design_scores_gemma":[0.00027047205,0.00043280097,0.00005592112,0.0005155137,0.000016559577,0.000057496633,1.1764011e-7,0.5007959,0.0046765516,0.49027142,0.0021138676,0.000793367],"about_ca_topic_score_codex":0.000021394224,"about_ca_topic_score_gemma":0.00001732148,"teacher_disagreement_score":0.9432575,"about_ca_system_score_codex":0.00016008748,"about_ca_system_score_gemma":0.00058495667,"threshold_uncertainty_score":0.99963063},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004076785,0.000497211,0.98036945,0.00012342096,0.0021110708,0.0001799897,0.0000037926832,0.00025127162,0.016423022],"genre_scores_gemma":[0.063526705,0.0003245294,0.9322005,0.0006844629,0.0020065866,0.00001125563,0.00000647497,0.00016533234,0.001074166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836946,0.000022270799,0.00032388454,0.00044476663,0.00041704817,0.00042260071],"domain_scores_gemma":[0.9984531,0.00060780393,0.00007354375,0.0006392086,0.0001423428,0.00008399933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092560507,0.00029345512,0.00023233212,0.00020693142,0.0002529521,0.00025150226,0.00095840776,0.00022360303,0.000095189695],"category_scores_gemma":[0.00011250397,0.00022385994,0.000060878992,0.0002482123,0.0011529528,0.000085073276,0.00017331801,0.000567962,0.00006912896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.6829195e-7,0.0000016410349,0.000009100033,0.000015067286,0.000010576165,0.000008818489,0.00026335704,0.30809507,0.000075518044,0.0032491572,0.00007446306,0.6881965],"study_design_scores_gemma":[0.00009013611,0.000028185475,0.000020823258,0.00015158723,0.0000061737132,0.000037614962,1.3802718e-7,0.94009817,0.0011005715,0.047605228,0.010506074,0.00035531697],"about_ca_topic_score_codex":0.0000011543443,"about_ca_topic_score_gemma":0.000013530843,"teacher_disagreement_score":0.6878412,"about_ca_system_score_codex":0.00019893763,"about_ca_system_score_gemma":0.00014021137,"threshold_uncertainty_score":0.91287434},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006993406,0.00004468019,0.9912947,0.0008988647,0.0013329239,0.00027240405,0.0000025792312,0.00022207528,0.0058618686],"genre_scores_gemma":[0.09794794,0.000010175854,0.8985072,0.0025279701,0.0005903465,0.0000052687506,0.000007629475,0.000032422737,0.00037105923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679464,0.000032827993,0.00042364735,0.0012105451,0.0010024476,0.00053590606],"domain_scores_gemma":[0.9978965,0.00034129753,0.00020034765,0.0009560764,0.00046625824,0.00013953619],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096037,0.00036818648,0.0003139663,0.0007874351,0.0003866144,0.0010089978,0.0019034893,0.00024920012,0.00030240227],"category_scores_gemma":[0.00008798214,0.0003596653,0.000090461006,0.0006170127,0.00069229887,0.00059704547,0.000613812,0.0006180728,0.00012534864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032964585,0.000014902935,0.00019204724,0.000028875727,0.000005937279,0.00003127734,0.0005518253,0.14489715,0.00008746711,0.010818886,0.000045291894,0.84332305],"study_design_scores_gemma":[0.00019857273,0.00008472176,0.00013269279,0.00019595968,0.0000027249757,0.000022585522,1.2166652e-7,0.9808246,0.0011163641,0.016328381,0.00067629945,0.0004169773],"about_ca_topic_score_codex":0.000014827648,"about_ca_topic_score_gemma":0.00009542451,"teacher_disagreement_score":0.84290606,"about_ca_system_score_codex":0.00027940492,"about_ca_system_score_gemma":0.001013984,"threshold_uncertainty_score":0.99988556},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014200792,0.0002962076,0.9897206,0.0010457935,0.0009158549,0.0010734971,0.00005458772,0.006515954,0.00023553339],"genre_scores_gemma":[0.12445888,0.0000016254165,0.86986464,0.004925391,0.00058695086,0.000054188204,0.0000071631375,0.0000737475,0.000027410233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925481,0.000100974525,0.00088496733,0.0030405582,0.0019021898,0.0015232195],"domain_scores_gemma":[0.9833686,0.011612364,0.00051346014,0.0022492264,0.0016168524,0.0006394953],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.0048567043,0.0009823428,0.00086578244,0.001611112,0.0018301071,0.0012171128,0.005287217,0.00056640693,0.000012312679],"category_scores_gemma":[0.019400414,0.00091255415,0.00027884232,0.0019124758,0.003421009,0.0006101944,0.0012607027,0.0010299955,0.00002000873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003206159,0.00028478837,0.007076959,0.0005154076,0.000023694587,0.0015785978,0.0005519968,0.095027834,0.00009005048,0.0009395837,0.002644101,0.89123493],"study_design_scores_gemma":[0.00045811824,0.001200317,0.0000662699,0.0011026567,0.000020026597,0.00039412666,9.836817e-8,0.8666967,0.0016564515,0.12685181,0.00042455827,0.00112887],"about_ca_topic_score_codex":0.00020016287,"about_ca_topic_score_gemma":0.000104595674,"teacher_disagreement_score":0.8901061,"about_ca_system_score_codex":0.00048771314,"about_ca_system_score_gemma":0.006121699,"threshold_uncertainty_score":0.9998197},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.2008037e-7,0.49194273,0.5072236,0.000005269665,0.00015981586,0.00047287327,0.000026036938,0.00015322657,0.000016337517],"genre_scores_gemma":[0.00004750721,0.6461968,0.35305965,0.00011444815,0.00024313858,0.00004431593,0.0002712459,0.000022490342,3.96799e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977534,0.000057610392,0.0005074251,0.0009470983,0.00030381844,0.00043068765],"domain_scores_gemma":[0.99745363,0.00018178922,0.00018126884,0.0020064644,0.00011554226,0.00006130441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011953559,0.00035640525,0.0012066505,0.000542392,0.00010995784,0.00013534946,0.0020814661,0.00019143969,0.000003199931],"category_scores_gemma":[0.00013757548,0.00028317797,0.00023861633,0.0033537594,0.00010123579,0.00023788112,0.00053899665,0.000319955,0.000005212921],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.2171212e-7,0.000017519016,0.0000018001741,0.006211139,0.000075783835,0.0000011195344,0.000035440753,0.002424294,3.6088e-7,0.0000048922657,0.000657334,0.99057],"study_design_scores_gemma":[0.000038196922,0.000019796571,0.000001434078,0.012313317,0.0007255535,0.000013048877,6.008575e-8,0.79369015,0.000014353837,0.00016296598,0.19267441,0.0003467045],"about_ca_topic_score_codex":0.0000049954024,"about_ca_topic_score_gemma":0.000027041215,"teacher_disagreement_score":0.9902233,"about_ca_system_score_codex":0.00012113646,"about_ca_system_score_gemma":0.00011255829,"threshold_uncertainty_score":0.99996203},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004381916,0.000032156513,0.9909207,0.0007116232,0.0016612565,0.00066999585,0.000031410364,0.000057813882,0.0015331197],"genre_scores_gemma":[0.98758346,0.00001772823,0.009946658,0.001244437,0.00056788296,0.000015318863,0.000003228886,0.000029959088,0.0005913295],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977894,0.00003206737,0.0004903196,0.0007738579,0.00056560826,0.00034874477],"domain_scores_gemma":[0.99653107,0.0021179214,0.00041687826,0.0006522295,0.00021882435,0.000063078456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018688255,0.00030133507,0.00040251817,0.00030248228,0.0004221578,0.00020992273,0.001093066,0.00018612156,0.000092024995],"category_scores_gemma":[0.00039195787,0.00021729013,0.00016258596,0.00024781516,0.001056853,0.00034569984,0.00021129992,0.0004166109,0.000033447413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005538984,0.00039373914,0.00023857423,0.00023509815,0.00005330617,0.000013490662,0.010962561,0.20154071,0.38377818,0.018896837,0.002064042,0.38126954],"study_design_scores_gemma":[0.00018058134,0.0004957293,0.00008278488,0.00015226488,0.000021361886,0.000020125599,0.0000024204398,0.6021907,0.38019833,0.013221845,0.0031489697,0.00028492574],"about_ca_topic_score_codex":0.000012994678,"about_ca_topic_score_gemma":0.00010712563,"teacher_disagreement_score":0.98320156,"about_ca_system_score_codex":0.00011046769,"about_ca_system_score_gemma":0.00022540895,"threshold_uncertainty_score":0.8860834},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012679213,0.0001390761,0.9936071,0.0002372947,0.0016812155,0.0006588801,0.0000048326615,0.000024137946,0.0023795099],"genre_scores_gemma":[0.27408066,0.000010208565,0.7217151,0.0029326384,0.0007974342,0.000059190155,0.000016597256,0.00004102414,0.00034714927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969712,0.000044605313,0.00046485115,0.0013009155,0.00065148337,0.00056698144],"domain_scores_gemma":[0.9975295,0.00083431846,0.0003238478,0.00067647634,0.00056762405,0.00006824561],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012644232,0.00037858624,0.00038339323,0.00083774125,0.0002071688,0.00038108675,0.001982197,0.00019883683,0.00003551346],"category_scores_gemma":[0.00027190332,0.00035397478,0.00011532099,0.00045719722,0.0002776253,0.0009961342,0.0005496723,0.00040916094,0.00006074861],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060658058,0.00007274662,0.00036052233,0.00015540511,0.000031627023,0.000039575752,0.008154164,0.024757883,0.006951773,0.012223982,0.00008973659,0.94710195],"study_design_scores_gemma":[0.00046835942,0.0006369636,0.0012486678,0.00071090634,0.000008981512,0.000019831277,0.0000014827002,0.91684574,0.006810385,0.072119705,0.0005127254,0.0006162711],"about_ca_topic_score_codex":0.00002885189,"about_ca_topic_score_gemma":0.00028903526,"teacher_disagreement_score":0.94648564,"about_ca_system_score_codex":0.00035366666,"about_ca_system_score_gemma":0.0004878086,"threshold_uncertainty_score":0.9998912},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8623371,0.0003174087,0.134101,0.00086745305,0.0001874663,0.0007043364,0.000014371368,0.000037762224,0.0014330882],"genre_scores_gemma":[0.98982394,0.000038091173,0.008714706,0.0011056772,0.00012106126,0.0000032267744,0.000011016882,0.000016339607,0.00016596481],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9984799,0.000014638198,0.00025144566,0.0004881726,0.00051097735,0.00025487063],"domain_scores_gemma":[0.9993491,0.00017779399,0.00010493136,0.00022016406,0.00007885744,0.000069126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016157069,0.00022191448,0.0003774567,0.00032896723,0.000034320277,0.000022437325,0.00024820614,0.00014077316,0.00009288216],"category_scores_gemma":[0.00002847921,0.00014032135,0.000036488596,0.00036035807,0.0006367889,0.00009083977,0.000050594048,0.00032999282,0.0000047582967],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0055046678,0.00058382296,0.35930392,0.000935688,0.000089584624,0.002244393,0.0061691143,0.02196256,0.00087733567,0.00022856318,0.00010421823,0.6019961],"study_design_scores_gemma":[0.0200216,0.039263308,0.7323471,0.0056337263,0.00037713672,0.0014461351,0.000004045101,0.14187136,0.0051459577,0.046585184,0.003814793,0.0034896568],"about_ca_topic_score_codex":0.000063696774,"about_ca_topic_score_gemma":0.00036522365,"teacher_disagreement_score":0.59850645,"about_ca_system_score_codex":0.000033004766,"about_ca_system_score_gemma":0.00015049329,"threshold_uncertainty_score":0.5722139},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010505176,0.00023055132,0.98298615,0.0012997793,0.0032910586,0.000755098,0.0000048557963,0.0001754372,0.00075188954],"genre_scores_gemma":[0.7653353,0.00022331186,0.22918317,0.002096031,0.0009315933,0.00009936601,0.0000075312673,0.00007044677,0.0020532398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959249,0.00010676774,0.000781387,0.0016358608,0.0009694211,0.0005816783],"domain_scores_gemma":[0.9946762,0.0010116402,0.0007144598,0.0024902278,0.0010320931,0.00007539502],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000939274,0.0005510854,0.0006425124,0.0007053579,0.00036585418,0.00060646044,0.005259266,0.00051789795,0.00023057497],"category_scores_gemma":[0.00026611143,0.00035490902,0.00016568507,0.0007591982,0.0055876854,0.0015655947,0.0021119274,0.0013368006,0.000098533375],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016493507,0.00043991322,0.00014708281,0.00016778686,0.00012212682,0.00026520304,0.035824124,0.0057818196,0.014339151,0.04234625,0.001013646,0.89938796],"study_design_scores_gemma":[0.00087155815,0.0034418353,0.0009220434,0.0030163815,0.000043497534,0.0005847179,0.000054558583,0.50422186,0.047175113,0.42479682,0.013029589,0.0018420106],"about_ca_topic_score_codex":0.0000052314267,"about_ca_topic_score_gemma":0.00007586774,"teacher_disagreement_score":0.89754593,"about_ca_system_score_codex":0.00032055948,"about_ca_system_score_gemma":0.000554604,"threshold_uncertainty_score":0.99989027},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006202804,0.00024708096,0.99764925,0.00007614066,0.00035222445,0.00020191514,0.0000026659413,0.00014079154,0.0007096214],"genre_scores_gemma":[0.08198825,0.000061191065,0.9174689,0.00009928516,0.00026531768,0.0000035538935,0.0000033192862,0.000042226016,0.000067928784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988883,0.000012333307,0.00024213013,0.00036521073,0.0002586752,0.00023333126],"domain_scores_gemma":[0.9993548,0.00020437149,0.00005826921,0.00025902942,0.00008043158,0.000043147145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059667806,0.0002103796,0.00017421258,0.00016269696,0.00014859244,0.00014348754,0.0003156932,0.0001457708,0.000015042684],"category_scores_gemma":[0.000010875087,0.0001673666,0.000029707706,0.00016135532,0.0002706918,0.00014101868,0.000032484862,0.00036047658,0.0000033449485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.4858256e-7,7.087838e-7,0.000010059939,0.000031991225,0.000003423728,0.0000016432936,0.0014949793,0.93879795,0.000039585197,0.00020290956,0.0000026322793,0.059413448],"study_design_scores_gemma":[0.000056083078,0.000013494402,0.000009820994,0.00017451096,0.000008157005,0.000006329652,2.707077e-7,0.98323655,0.00037579887,0.015725665,0.00020106928,0.00019225215],"about_ca_topic_score_codex":0.000005878057,"about_ca_topic_score_gemma":0.000021697255,"teacher_disagreement_score":0.08136798,"about_ca_system_score_codex":0.00006215492,"about_ca_system_score_gemma":0.00004288276,"threshold_uncertainty_score":0.68250114},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026386135,0.00007665102,0.99229366,0.000961223,0.00077961327,0.00032237955,0.0000090656695,0.00015130085,0.0051422785],"genre_scores_gemma":[0.38803798,0.00014111983,0.60854965,0.0017713658,0.0009266089,0.000008675439,0.000038462273,0.000040688785,0.00048543507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771166,0.000027209584,0.00042757244,0.00087241054,0.00059167476,0.00036945858],"domain_scores_gemma":[0.9986967,0.00020711319,0.00018648297,0.00058519916,0.00017011203,0.00015440494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005597489,0.0003407956,0.00033060287,0.0006390294,0.00024482387,0.000540138,0.00097329053,0.00027049865,0.00008686108],"category_scores_gemma":[0.000030522348,0.00032459825,0.000059179056,0.00037494197,0.0006363692,0.0009442754,0.00031330984,0.00040780922,0.00004738164],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020604539,0.0000046580876,0.00016548164,0.000024905505,0.000007657522,0.000005414028,0.0020082183,0.0027544743,0.0000199269,0.009343679,0.000029282422,0.98563427],"study_design_scores_gemma":[0.0007173492,0.00035032973,0.0036485686,0.00040032985,0.000025007539,0.00013302336,9.0543307e-7,0.81551427,0.0010982411,0.16724601,0.009602005,0.0012639363],"about_ca_topic_score_codex":0.000011063883,"about_ca_topic_score_gemma":0.00008355037,"teacher_disagreement_score":0.9843703,"about_ca_system_score_codex":0.00013011064,"about_ca_system_score_gemma":0.00024120009,"threshold_uncertainty_score":0.9999206},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071284646,0.0003081839,0.9922855,0.00048823195,0.002802827,0.00041799113,0.0000022870547,0.00024939305,0.0027327302],"genre_scores_gemma":[0.056038044,0.0000270356,0.9409527,0.0018212106,0.000924072,0.0000049870478,0.00000194978,0.000042055508,0.00018793334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562633,0.000033441098,0.0005764315,0.0016323259,0.0011673949,0.0009640664],"domain_scores_gemma":[0.99646133,0.00077603315,0.00042183566,0.0019678846,0.00023240483,0.00014048842],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015464313,0.0006656101,0.00063293753,0.0006341365,0.0007765365,0.0011614418,0.0044807997,0.0003677517,0.000027898705],"category_scores_gemma":[0.00019743736,0.0004447132,0.00019085236,0.00062255515,0.0016790516,0.000794664,0.0015088706,0.0010044829,0.00003346219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010557908,0.00002117481,0.00001185035,0.000037223803,0.000044200267,0.0003240614,0.00479306,0.04674191,0.0001926062,0.012271064,0.000031305917,0.935521],"study_design_scores_gemma":[0.00022798587,0.00019488997,0.000017044837,0.0008353763,0.000015604805,0.0002966046,0.000003922432,0.93227583,0.002014536,0.06337831,0.00013584294,0.0006040274],"about_ca_topic_score_codex":0.00003933094,"about_ca_topic_score_gemma":0.000036453166,"teacher_disagreement_score":0.934917,"about_ca_system_score_codex":0.00028739366,"about_ca_system_score_gemma":0.00054440554,"threshold_uncertainty_score":0.9998754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020108515,0.00045755276,0.9960256,0.0007603856,0.0016545655,0.00046081227,0.00000692332,0.00012692336,0.0004871102],"genre_scores_gemma":[0.0073353522,0.00015474526,0.99000424,0.0013802772,0.0006063508,0.000029357749,0.0000046226874,0.00003111036,0.00045392258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975336,0.000023391574,0.00037104895,0.0011175291,0.0004608486,0.00049353886],"domain_scores_gemma":[0.9980566,0.0005401956,0.00022604794,0.00081685954,0.000236032,0.00012428338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070482225,0.00038979852,0.00032408023,0.00037140338,0.00052204245,0.00068870146,0.0013401975,0.0002234919,0.000055029308],"category_scores_gemma":[0.00011824034,0.0003020276,0.000098248536,0.00032370095,0.00083883776,0.00043956676,0.0008092026,0.00038134318,0.000009988223],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022945717,0.0000046159635,0.000015392736,0.000013178575,0.000011792042,0.0000068275153,0.0005813726,0.005237139,0.000029269046,0.005557039,0.000049958275,0.9884911],"study_design_scores_gemma":[0.00021735122,0.0000975252,0.00014497187,0.0001742725,0.000012242772,0.00010584488,4.85029e-7,0.9745398,0.00041203966,0.020367322,0.0035470806,0.00038106545],"about_ca_topic_score_codex":0.000015383093,"about_ca_topic_score_gemma":0.00007190279,"teacher_disagreement_score":0.98811007,"about_ca_system_score_codex":0.00012838584,"about_ca_system_score_gemma":0.00025809382,"threshold_uncertainty_score":0.9999432},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000647797,0.00006807796,0.99703425,0.00028444343,0.00047028286,0.00038211085,0.000026089729,0.00071859476,0.00095134747],"genre_scores_gemma":[0.2074342,0.000037420057,0.7912069,0.0008261219,0.00029312735,0.000012986549,0.000034487184,0.000043952725,0.00011081759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647766,0.00006911786,0.0006346124,0.0013768624,0.0009961644,0.00044558744],"domain_scores_gemma":[0.9967146,0.00045957332,0.0006491773,0.0016790961,0.0003985874,0.00009898417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011097935,0.00047894407,0.00050352747,0.0016758675,0.00022073879,0.00021112354,0.0029609771,0.00039111255,0.000029350611],"category_scores_gemma":[0.0002939943,0.00044527077,0.00011917968,0.00087367254,0.00067544065,0.0004911549,0.00076429476,0.0010611011,0.00001600188],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016677617,0.00009830187,0.00005465744,0.000065799184,0.0000070817136,0.000014165235,0.00019695374,0.0024970497,0.01747854,0.0028915163,0.000010704093,0.97666854],"study_design_scores_gemma":[0.00011129622,0.00060485135,0.00009084691,0.00058974535,0.0000046129644,0.000011012531,7.9270954e-8,0.6599035,0.3171592,0.018016463,0.0030702688,0.00043813017],"about_ca_topic_score_codex":0.0000250501,"about_ca_topic_score_gemma":0.00005216673,"teacher_disagreement_score":0.97623044,"about_ca_system_score_codex":0.00034740323,"about_ca_system_score_gemma":0.00025558483,"threshold_uncertainty_score":0.9997999},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040602798,0.000045113557,0.99438125,0.0012225951,0.0028675352,0.0008085614,0.000012584935,0.0002464307,0.00000990198],"genre_scores_gemma":[0.166086,0.0000042737092,0.8323454,0.0010694343,0.00040103734,0.000061142855,0.000016687887,0.000015159925,8.453319e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664015,0.000075536045,0.00043476053,0.0016094121,0.00062600686,0.0006141281],"domain_scores_gemma":[0.99761593,0.0004954446,0.00029563325,0.0010803962,0.00036689616,0.00014566722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069745345,0.00037497445,0.00036909862,0.0005238286,0.00035179936,0.0008706306,0.0023742372,0.00021060542,0.0000030176095],"category_scores_gemma":[0.00032235467,0.00034735142,0.0001097631,0.001043428,0.00038421532,0.0014046762,0.0022429824,0.0005568954,0.0000062235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004293885,0.000031914708,0.0000063712964,0.0000179488,0.000003447787,0.000002505355,0.0007041831,0.11047502,0.00012788783,0.00018209046,0.000016543085,0.8884278],"study_design_scores_gemma":[0.00027769327,0.0001159771,0.0001418547,0.00013416832,0.0000034200282,0.000010068329,5.066914e-7,0.85413724,0.014558985,0.13023259,0.000043057116,0.0003444489],"about_ca_topic_score_codex":0.000019695863,"about_ca_topic_score_gemma":0.000009798842,"teacher_disagreement_score":0.88808334,"about_ca_system_score_codex":0.00030698397,"about_ca_system_score_gemma":0.00061669206,"threshold_uncertainty_score":0.99989784},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013289608,0.00008375527,0.99662393,0.00014524927,0.00042586905,0.000515239,0.000111029185,0.00048315118,0.0002828376],"genre_scores_gemma":[0.051207907,0.000004519338,0.94711274,0.000819528,0.00052214146,0.00006836352,0.00017188051,0.00007174822,0.000021189195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975243,0.000019099254,0.00045381635,0.00090368406,0.0006225227,0.0004765387],"domain_scores_gemma":[0.9981244,0.0007067968,0.00010562149,0.00066615816,0.00024824328,0.00014876392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037424432,0.00050965743,0.00061266293,0.0013042373,0.00016058839,0.00016852985,0.00075042434,0.00029282446,0.00012788904],"category_scores_gemma":[0.00004091356,0.00047728413,0.00032411984,0.00057039666,0.00037568004,0.0001513455,0.0002015881,0.0004469472,0.000014651988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100378375,0.000073918745,0.00009731259,0.000059258186,0.00011470816,0.00003315517,0.00013440513,0.6988485,0.001331167,0.00004023318,0.00073385454,0.2985235],"study_design_scores_gemma":[0.00027632856,0.000108861204,0.000071357004,0.00014397093,0.000113141105,0.000006781128,1.6791919e-8,0.9758792,0.007539873,0.015108471,0.00023558771,0.0005164122],"about_ca_topic_score_codex":0.000027979793,"about_ca_topic_score_gemma":0.00012666876,"teacher_disagreement_score":0.29800707,"about_ca_system_score_codex":0.00037446147,"about_ca_system_score_gemma":0.00011855955,"threshold_uncertainty_score":0.9997679},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029675325,0.0003404319,0.9961257,0.00025736497,0.001169734,0.00043292865,0.000002715067,0.00033318627,0.001041171],"genre_scores_gemma":[0.7244079,0.00006595059,0.27466398,0.00026521026,0.00037812162,0.000008993136,0.000005957455,0.000040945484,0.00016289711],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956029,0.000058133413,0.0009488846,0.0017282049,0.000846792,0.0008150808],"domain_scores_gemma":[0.99603003,0.00062191905,0.00058328564,0.002244066,0.00042762433,0.00009308461],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014006295,0.0005399695,0.000726639,0.00096084987,0.00015040615,0.00024329143,0.0048957714,0.00062288117,0.00005296242],"category_scores_gemma":[0.00026285477,0.00050658523,0.00011840912,0.0017702372,0.0015498877,0.00061685755,0.0028112552,0.0010212896,0.000023703376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038691783,0.00003438711,0.00067847094,0.00004071132,0.0000065078184,0.000031574473,0.000506846,0.3278714,0.000012045928,0.008563039,0.00005423414,0.6621969],"study_design_scores_gemma":[0.00018682852,0.00016284398,0.00019799049,0.00067588635,0.0000033805886,0.000014573575,4.7636092e-7,0.88345397,0.00057695725,0.114071295,0.00018461404,0.00047120097],"about_ca_topic_score_codex":0.000039151615,"about_ca_topic_score_gemma":0.00014905549,"teacher_disagreement_score":0.7241112,"about_ca_system_score_codex":0.00048399068,"about_ca_system_score_gemma":0.0004884943,"threshold_uncertainty_score":0.9997386},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005030993,0.00022546698,0.98918265,0.0016898805,0.0012787497,0.00032095614,0.00000520484,0.00007055901,0.0067234295],"genre_scores_gemma":[0.8318148,0.00008201459,0.16358832,0.0035353624,0.0007667645,0.000010565783,0.0000016585041,0.000037751997,0.00016276876],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970304,0.000051971554,0.00040616805,0.0010348149,0.0010078726,0.00046880182],"domain_scores_gemma":[0.9964874,0.0010410765,0.0002835867,0.0018503981,0.0002387246,0.00009884362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010417134,0.00038302602,0.00039592828,0.000641853,0.00025537735,0.00022818353,0.0041516647,0.00024979247,0.00005221982],"category_scores_gemma":[0.000113170616,0.0002471257,0.00020819077,0.00082723773,0.0017926304,0.00019902666,0.0011189567,0.0007392777,0.00005008813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024952513,0.00014569827,0.00006063283,0.000100968835,0.000044250675,0.0001059339,0.008419335,0.0034605488,0.0003292907,0.492494,0.00038197116,0.49443242],"study_design_scores_gemma":[0.00018275967,0.00045231817,0.00017023427,0.0005365313,0.000009471064,0.000037253267,2.4406137e-7,0.114340976,0.0068759276,0.8742117,0.002689946,0.00049263],"about_ca_topic_score_codex":0.000018709712,"about_ca_topic_score_gemma":0.0000641556,"teacher_disagreement_score":0.8313117,"about_ca_system_score_codex":0.00006884241,"about_ca_system_score_gemma":0.0003126367,"threshold_uncertainty_score":0.9999981},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001960898,0.0015687378,0.99452126,0.000061305174,0.0009867317,0.00011138315,0.000002742473,0.0002989404,0.00225279],"genre_scores_gemma":[0.65615255,0.00023034641,0.34148365,0.00035778686,0.0013012483,0.000008499446,0.00001899507,0.00011101715,0.00033589883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977904,0.000024226925,0.00041424014,0.00048340988,0.00091712095,0.0003706242],"domain_scores_gemma":[0.998953,0.00010774032,0.00013535176,0.00044144056,0.00024434828,0.00011812634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008485713,0.0003184507,0.0005393597,0.00030398893,0.000077747776,0.000044059143,0.0004943052,0.000179691,0.0000729328],"category_scores_gemma":[0.000115345065,0.0002432606,0.000105046114,0.00035433462,0.0005122022,0.000074372125,0.00013160608,0.00036941638,0.000019730782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006604937,0.000026730017,0.000075254255,0.00030657853,0.00018493288,0.000054808395,0.000955904,0.7426036,0.0070923045,0.00017132728,0.0022162541,0.24630567],"study_design_scores_gemma":[0.00010289805,0.000052088606,0.0000840386,0.0018075628,0.00003568723,0.0000054327643,1.0266853e-7,0.9874907,0.0061474685,0.0027941968,0.001182229,0.00029759368],"about_ca_topic_score_codex":0.000023279286,"about_ca_topic_score_gemma":0.00003564755,"teacher_disagreement_score":0.65595645,"about_ca_system_score_codex":0.00016228957,"about_ca_system_score_gemma":0.000076476594,"threshold_uncertainty_score":0.99198794},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076640225,0.00031062917,0.99072397,0.00027435247,0.0002911577,0.00034402084,0.0001090012,0.000029326913,0.00025350048],"genre_scores_gemma":[0.90776837,0.00002987206,0.08976635,0.0013673474,0.00031378574,0.00003904867,0.000011542457,0.000033208198,0.00067046535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819946,0.000013825679,0.00041823575,0.0005976869,0.00043542948,0.00033533233],"domain_scores_gemma":[0.99821687,0.000654111,0.00029856697,0.0003979219,0.0003580156,0.00007454449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076131016,0.00023214641,0.0002723851,0.00016312998,0.0002728353,0.00014790901,0.00065228017,0.000099871635,0.00006317862],"category_scores_gemma":[0.00010305835,0.00016761213,0.0000552262,0.00012657474,0.0007245124,0.00009253541,0.00026306926,0.000135368,0.0000026235748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009577363,0.00012297106,0.0000044961503,0.00024196474,0.000022823331,0.0000015538204,0.0029789114,0.73202693,0.18031313,0.021417988,0.00011119599,0.06266229],"study_design_scores_gemma":[0.0003541206,0.00018732643,7.8398574e-7,0.00014340223,0.00001062853,0.0000031620007,0.0000012181686,0.846623,0.07569673,0.0761849,0.00059524557,0.00019950354],"about_ca_topic_score_codex":0.000012803251,"about_ca_topic_score_gemma":0.000021641248,"teacher_disagreement_score":0.90095764,"about_ca_system_score_codex":0.00005075381,"about_ca_system_score_gemma":0.00029796633,"threshold_uncertainty_score":0.68350244},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026103887,0.0003764505,0.9933965,0.00082434824,0.00067086617,0.0002071668,8.754739e-7,0.00004113754,0.0018722343],"genre_scores_gemma":[0.73664707,0.00004143078,0.26107362,0.0013667839,0.0005627573,0.0000082612205,0.0000032721418,0.000023290835,0.00027352443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651223,0.000033889683,0.0005533538,0.0013277665,0.00079941424,0.0007733453],"domain_scores_gemma":[0.99844146,0.00034508272,0.00017984716,0.0007377164,0.00010406962,0.00019183126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010250224,0.00038513754,0.0004420303,0.00088022096,0.00018487104,0.0005353223,0.0013864359,0.00016260825,0.00008320445],"category_scores_gemma":[0.00006389231,0.0003400606,0.00008473991,0.0004087408,0.0004991729,0.00036009809,0.0015433062,0.00039340986,0.000043606866],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000872132,0.00008104782,0.0055825613,0.000068917885,0.000046900725,0.000111551926,0.00341754,0.002566742,0.00026855353,0.06053465,0.000025687837,0.9272871],"study_design_scores_gemma":[0.0005436819,0.0003396206,0.0019341361,0.00079537614,0.000017539307,0.000041736082,0.0000039540537,0.83643174,0.0027762738,0.15522194,0.0008818869,0.0010120921],"about_ca_topic_score_codex":0.00004953506,"about_ca_topic_score_gemma":0.00025324422,"teacher_disagreement_score":0.926275,"about_ca_system_score_codex":0.00028163992,"about_ca_system_score_gemma":0.0001458215,"threshold_uncertainty_score":0.99990517},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009160643,0.00058792176,0.9854837,0.00026083682,0.012056207,0.00071687374,0.0000054760494,0.00029265962,0.00058714027],"genre_scores_gemma":[0.13006946,0.000026690734,0.8659929,0.0013145634,0.0020545197,0.000013482823,0.000010999661,0.000058365516,0.00045902925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630743,0.000057491503,0.0006501598,0.0014496204,0.0007443138,0.0007909901],"domain_scores_gemma":[0.9968753,0.0008898519,0.00049107714,0.0010171769,0.0003845251,0.0003420924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011502075,0.00058228674,0.0006182954,0.0007968963,0.00044803618,0.0005576238,0.0015073934,0.00027568123,0.000027285518],"category_scores_gemma":[0.00023215718,0.00055226235,0.0001983854,0.00052505854,0.00014955609,0.001700439,0.00041959793,0.0006017024,0.000028831679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029370802,0.000011327332,0.000085706306,0.000050590876,0.000009761945,0.000006199439,0.00016497675,0.01289272,0.00088340754,0.005380065,0.00009242438,0.98039347],"study_design_scores_gemma":[0.0005040999,0.0001728682,0.00009302231,0.00086095877,0.000029170968,0.000056404322,6.9135444e-7,0.9812426,0.0025573215,0.0069748387,0.0068603503,0.0006476556],"about_ca_topic_score_codex":0.000078012614,"about_ca_topic_score_gemma":0.000033241573,"teacher_disagreement_score":0.9797458,"about_ca_system_score_codex":0.0007682756,"about_ca_system_score_gemma":0.00084569317,"threshold_uncertainty_score":0.9996929},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007592589,0.0012156492,0.99399537,0.00021064603,0.002355012,0.00094368914,0.000011657577,0.0006057731,0.00058627024],"genre_scores_gemma":[0.046904564,0.000012552122,0.9512345,0.0003573269,0.00095233665,0.000041108775,0.000016297876,0.000035439283,0.00044584685],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964258,0.000027529077,0.0005416439,0.0015983732,0.0008149648,0.0005916979],"domain_scores_gemma":[0.9972996,0.00033735935,0.00038085924,0.00105107,0.00082097534,0.000110110166],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011802196,0.00048535812,0.0004337042,0.0007893154,0.00042171753,0.0010741485,0.0026860093,0.00045331754,0.000027290718],"category_scores_gemma":[0.00047200412,0.00044153724,0.0001659587,0.00060989277,0.00077579106,0.0007946058,0.00046343607,0.00063387764,0.000014787178],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014453206,0.000034832647,0.00004467378,0.00021018893,0.000011902011,0.000021534895,0.0028596055,0.0002934125,0.0004566301,0.008436702,0.0000442738,0.9875718],"study_design_scores_gemma":[0.00027293334,0.00027399344,0.000025796133,0.00043839242,0.000012054561,0.00003876227,5.8932667e-8,0.3686608,0.0058860625,0.621865,0.001897857,0.0006283257],"about_ca_topic_score_codex":0.00004237527,"about_ca_topic_score_gemma":0.00016472195,"teacher_disagreement_score":0.9869435,"about_ca_system_score_codex":0.00038092525,"about_ca_system_score_gemma":0.00060097786,"threshold_uncertainty_score":0.9999628},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020580979,0.0009409647,0.993297,0.00029332147,0.0022998815,0.00037149026,0.000019109635,0.00026489617,0.0023075638],"genre_scores_gemma":[0.14363717,0.00002614198,0.85484916,0.0008465315,0.0005343022,0.000008204237,0.000039697275,0.000035298868,0.000023507528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955304,0.000052983625,0.0005642672,0.0017137508,0.0014367123,0.00070183526],"domain_scores_gemma":[0.9973292,0.00029235383,0.00030823098,0.0013416492,0.00041925936,0.00030934843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001422234,0.00054347777,0.0005117544,0.0009899504,0.00030388084,0.0006705321,0.0028495085,0.00030586723,0.000012002661],"category_scores_gemma":[0.00008388363,0.0005070398,0.00016268581,0.00089431484,0.00061580696,0.0005413692,0.0016871564,0.000740165,0.000065500084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007140612,0.00006669354,0.000035258676,0.000035365232,0.000012331895,0.00009239978,0.0012879656,0.3773041,0.000115927054,0.1161688,0.00022476818,0.5046493],"study_design_scores_gemma":[0.00031439684,0.00008839414,0.000053984706,0.00014641102,0.000006300994,0.00004506578,1.5243313e-7,0.823315,0.00029230397,0.1723556,0.0027932988,0.0005890898],"about_ca_topic_score_codex":0.000044363675,"about_ca_topic_score_gemma":0.000068492554,"teacher_disagreement_score":0.50406015,"about_ca_system_score_codex":0.00029873863,"about_ca_system_score_gemma":0.0005276374,"threshold_uncertainty_score":0.9997381},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070237194,0.000075503776,0.99120796,0.000987687,0.0013950854,0.0004295847,0.000048227506,0.00021122834,0.0049423343],"genre_scores_gemma":[0.46666282,0.00009578955,0.51719177,0.011030155,0.0029337322,0.00006172324,0.00028972857,0.0001830711,0.0015512068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594295,0.000044783323,0.0005470422,0.0015936736,0.0011018782,0.0007696492],"domain_scores_gemma":[0.9972851,0.00039478374,0.00026860504,0.0016109573,0.00021518023,0.00022534809],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000771653,0.0005570767,0.00047923593,0.0008164775,0.0004278301,0.0006125197,0.0031392674,0.00029033067,0.00035007467],"category_scores_gemma":[0.00005058092,0.0005137308,0.0001999778,0.00094757654,0.0009840176,0.0004470737,0.0007887243,0.00070380856,0.00024631855],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036372305,0.00024715497,0.00012945772,0.00007273031,0.000083755505,0.00026191914,0.005211057,0.009518179,0.00023256888,0.064989716,0.0051402887,0.9140768],"study_design_scores_gemma":[0.0014268511,0.0015353984,0.0008209024,0.00065592694,0.000034468147,0.00013573287,0.0000021821515,0.6475629,0.0021549056,0.31634253,0.02672531,0.0026028804],"about_ca_topic_score_codex":0.000015112676,"about_ca_topic_score_gemma":0.000057860143,"teacher_disagreement_score":0.91147393,"about_ca_system_score_codex":0.00027032843,"about_ca_system_score_gemma":0.00038655594,"threshold_uncertainty_score":0.9997314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010888608,0.00014179829,0.98181874,0.00018712046,0.0022132527,0.00034355433,0.0000143651605,0.00006226768,0.004330273],"genre_scores_gemma":[0.8391949,0.000016740327,0.15898031,0.0011386523,0.00050031557,0.0000043172918,0.0000013842546,0.000020799907,0.00014259356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683636,0.00007731605,0.0005524638,0.0009617032,0.0010088597,0.0005633058],"domain_scores_gemma":[0.9974648,0.0009185452,0.0003589918,0.0006580244,0.0004541596,0.00014549347],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016689165,0.00031796694,0.0005046279,0.00042750567,0.0004442527,0.00010226877,0.0017595509,0.0005522343,0.00034097992],"category_scores_gemma":[0.0007112169,0.00029587862,0.00020215315,0.00035911822,0.0032461833,0.00019617668,0.0003735876,0.0004655243,0.00003821124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015581473,0.00034520257,0.002698391,0.00007473632,0.00004133606,0.000029318233,0.033444617,0.112612054,0.00064761395,0.009581863,0.00030588332,0.84006315],"study_design_scores_gemma":[0.0004280837,0.0001780361,0.00096681295,0.0008150534,0.000017286973,0.0000012358653,0.0000073913475,0.77896494,0.00019098305,0.21606778,0.0017044282,0.0006579499],"about_ca_topic_score_codex":0.00021177769,"about_ca_topic_score_gemma":0.0032990973,"teacher_disagreement_score":0.83940524,"about_ca_system_score_codex":0.0005253958,"about_ca_system_score_gemma":0.0009650019,"threshold_uncertainty_score":0.99994934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016755601,0.000057376383,0.99499995,0.000024384202,0.00042148115,0.00034205592,0.000008242031,0.000080508406,0.0023904354],"genre_scores_gemma":[0.9492396,0.000001966931,0.04747684,0.00013509346,0.0029485668,0.000009099515,0.000035201,0.000041999523,0.00011160317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749833,0.000059982027,0.0005205386,0.000899948,0.00049705483,0.00052414637],"domain_scores_gemma":[0.9987939,0.00019778,0.00032210382,0.00043905803,0.00017072188,0.00007641189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006601107,0.0004093282,0.00054817833,0.0012139783,0.00025180492,0.00019340638,0.0007548071,0.00024028939,0.00039097082],"category_scores_gemma":[0.000010154778,0.00042074273,0.00018704496,0.0014315344,0.0004959183,0.00022182222,0.00043244133,0.00064965774,0.000009934287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003328027,0.000105876505,0.004287521,0.000020375219,0.0000895208,0.000019119883,0.0011636252,0.43473655,0.00019325175,0.0029991684,0.00065333507,0.5556984],"study_design_scores_gemma":[0.00020517253,0.00007120395,0.00020064239,0.00014320368,0.000036625748,0.0000010944016,7.068719e-7,0.9204666,0.00013454471,0.07810036,0.00025192313,0.00038793843],"about_ca_topic_score_codex":0.00017540925,"about_ca_topic_score_gemma":0.0001253036,"teacher_disagreement_score":0.94756407,"about_ca_system_score_codex":0.00038016064,"about_ca_system_score_gemma":0.00020740635,"threshold_uncertainty_score":0.99982446},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095113024,0.00008230685,0.90078443,0.00009759432,0.0017391037,0.0015008139,0.000008598636,0.00013051958,0.0005435867],"genre_scores_gemma":[0.9228292,0.0000011791527,0.075642556,0.00094433554,0.0004227578,0.0000346536,0.0000021590174,0.000037584796,0.00008557977],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9937344,0.00017760042,0.0012320309,0.0022436527,0.0018193858,0.0007929038],"domain_scores_gemma":[0.99582255,0.0007215381,0.00063282176,0.002199218,0.00036579376,0.00025806163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023558363,0.0006957038,0.0009739423,0.0007206341,0.00031436124,0.0004707293,0.003522612,0.00019559516,0.000019840356],"category_scores_gemma":[0.000060928265,0.00064698653,0.00018214501,0.00058173505,0.000461175,0.00045361317,0.0031358728,0.0005878056,0.0000447256],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007487088,0.0026998639,0.00041685105,0.00016977046,0.00010541027,0.00013118425,0.04454116,0.010534079,0.020257937,0.007123729,0.00006490632,0.9138802],"study_design_scores_gemma":[0.0033318063,0.023354536,0.0025292332,0.0026713714,0.000051985986,0.00003482222,0.0002172799,0.2625575,0.68875176,0.0116162095,0.00055105577,0.0043324223],"about_ca_topic_score_codex":0.00015936335,"about_ca_topic_score_gemma":0.0000527944,"teacher_disagreement_score":0.9095478,"about_ca_system_score_codex":0.00065455807,"about_ca_system_score_gemma":0.00046491876,"threshold_uncertainty_score":0.99959815},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025655434,0.00025500014,0.9771549,0.0007535549,0.002167419,0.00029212073,0.000012656335,0.00019704073,0.019141624],"genre_scores_gemma":[0.023203956,0.000046802073,0.96810156,0.0040450767,0.0013710875,0.000025004078,0.000049242422,0.000052743624,0.0031045084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996749,0.00002593698,0.00041680972,0.0014274408,0.0008067957,0.00057406153],"domain_scores_gemma":[0.99782455,0.00018009687,0.0002275785,0.0014111139,0.00020531486,0.00015132308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000572257,0.00043714078,0.0003607068,0.00048722845,0.000334819,0.00069968303,0.0026447917,0.0003143688,0.00015457039],"category_scores_gemma":[0.000036841466,0.00036846183,0.00011415452,0.00052359776,0.0006527986,0.00070856133,0.0009674264,0.0005314727,0.00040645272],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004065892,0.00004638986,0.000013786693,0.000026033702,0.000012534808,0.000021438684,0.0007108121,0.0020353356,0.000110784706,0.0074648615,0.006278029,0.98327595],"study_design_scores_gemma":[0.00025707833,0.00031894995,0.000035356108,0.00016245389,0.000008984003,0.00006401408,1.7466633e-7,0.7320902,0.00053765485,0.23315045,0.032511957,0.0008627718],"about_ca_topic_score_codex":0.000011038617,"about_ca_topic_score_gemma":0.000017635663,"teacher_disagreement_score":0.9824132,"about_ca_system_score_codex":0.00019859232,"about_ca_system_score_gemma":0.00022997163,"threshold_uncertainty_score":0.99987674},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002483503,0.0004956665,0.98962444,0.0011781327,0.0032679664,0.0003066912,0.000002339032,0.0002811824,0.0045952257],"genre_scores_gemma":[0.4840761,0.0002159245,0.48146456,0.008158483,0.003999561,0.000054398144,0.000042155232,0.0001745968,0.021814208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99489486,0.00008158648,0.00075460295,0.0021518273,0.0011905028,0.00092659105],"domain_scores_gemma":[0.99666464,0.00021653403,0.00047207015,0.0021669702,0.00026089582,0.00021887758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009766957,0.00071329914,0.0006079238,0.0009534683,0.00038392388,0.0009584362,0.0042933375,0.00030150855,0.00006764603],"category_scores_gemma":[0.000026928223,0.00063450274,0.00021456089,0.00075505534,0.000607773,0.00019685464,0.0040839147,0.00051671546,0.000113011294],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018834891,0.00010515221,0.00007974777,0.00004088275,0.000048379556,0.00008585249,0.0011679692,0.036243536,0.00009631162,0.0011012157,0.0016759137,0.9593362],"study_design_scores_gemma":[0.00045518592,0.00025095287,0.000020007134,0.0010368453,0.000015727803,0.000031808042,4.0332705e-7,0.8853942,0.0014173542,0.049765702,0.060767382,0.0008444247],"about_ca_topic_score_codex":0.000446828,"about_ca_topic_score_gemma":0.0012532859,"teacher_disagreement_score":0.9584918,"about_ca_system_score_codex":0.0005518146,"about_ca_system_score_gemma":0.00021244361,"threshold_uncertainty_score":0.9996106},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024099725,0.0005647005,0.99350476,0.0005635674,0.00041887118,0.0022286666,0.000025473857,0.00015549267,0.0001284893],"genre_scores_gemma":[0.8661411,0.000048094764,0.13307631,0.00022270491,0.00022924693,0.00019578301,0.0000045445167,0.00002286006,0.000059361613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722177,0.000067405024,0.00036392538,0.001407855,0.00046814402,0.00047088324],"domain_scores_gemma":[0.99773926,0.0006139507,0.0004830975,0.0006892258,0.00034686472,0.00012761244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076059625,0.0004428468,0.0007647671,0.00081683754,0.0002220621,0.00020514196,0.00092416647,0.0003588708,0.0000017531561],"category_scores_gemma":[0.00008453241,0.0003589325,0.0001148307,0.0004805803,0.0012466474,0.00030781186,0.0005392958,0.0002804861,0.0000024965689],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019635845,0.000045593104,0.000035167446,0.000098356824,0.000026025675,0.0000030443882,0.0022039441,0.00006439531,0.00046319925,0.0005363514,9.891689e-7,0.9965033],"study_design_scores_gemma":[0.0047792904,0.028712101,0.003974038,0.0023769888,0.000098113065,0.0007868899,0.00002564151,0.66703516,0.16020563,0.12617217,0.002428192,0.0034057868],"about_ca_topic_score_codex":0.00008533877,"about_ca_topic_score_gemma":0.000101958874,"teacher_disagreement_score":0.9930975,"about_ca_system_score_codex":0.0005206981,"about_ca_system_score_gemma":0.00026273975,"threshold_uncertainty_score":0.9998863},"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":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009183004,0.000571744,0.98794556,0.008892073,0.00083267357,0.0010867491,0.00008845272,0.00024321112,0.00024768393],"genre_scores_gemma":[0.08839671,0.000022501512,0.9089173,0.0015349878,0.000880531,0.000060461214,0.00006731514,0.00004392662,0.00007623713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993235,0.00006151269,0.00053938746,0.0038905628,0.0011977649,0.0010757799],"domain_scores_gemma":[0.979532,0.0032042153,0.0002912709,0.016325189,0.0005226993,0.00012461808],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["sts","open_science"],"category_scores_codex":[0.009253443,0.0004342693,0.0004208475,0.0008167609,0.0014886898,0.0009196351,0.04647778,0.0006312687,0.000017769582],"category_scores_gemma":[0.0010320178,0.00032566857,0.00006363725,0.0015231825,0.0030468088,0.00024294651,0.024355758,0.0021981057,0.000026252606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010578997,0.00007231961,0.000055861197,0.00006263692,0.00003137335,0.000015969374,0.0008546863,0.0026931828,0.000034060722,0.36866888,0.0008806025,0.6266198],"study_design_scores_gemma":[0.0000815457,0.000044266424,0.0000047901126,0.00020147245,0.000005181603,0.0000059460317,5.3406455e-7,0.56767434,0.00020955272,0.42261034,0.008928808,0.00023320418],"about_ca_topic_score_codex":0.0000390935,"about_ca_topic_score_gemma":0.00021350205,"teacher_disagreement_score":0.62638664,"about_ca_system_score_codex":0.0002154654,"about_ca_system_score_gemma":0.00089301204,"threshold_uncertainty_score":0.99991953},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010111616,0.00030378933,0.9863917,0.00064537005,0.003957229,0.0018117044,0.000004277212,0.00008974214,0.0057850135],"genre_scores_gemma":[0.6366432,0.00022499649,0.2999068,0.012545773,0.00835002,0.00019083057,0.000079751466,0.00034435582,0.041714348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621594,0.000018129494,0.00043664037,0.0007783677,0.0021626572,0.00038824935],"domain_scores_gemma":[0.9985777,0.00039876733,0.0001718658,0.00048167352,0.00019323958,0.00017673917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020246124,0.00027635167,0.00053192105,0.00042098743,0.00011308639,0.00021788613,0.0006817227,0.00023774758,0.000102971],"category_scores_gemma":[0.0003757992,0.00023376117,0.00011960783,0.00012412597,0.0002178292,0.000056730983,0.00037156226,0.0004814625,0.000048627317],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010185447,0.000057744783,0.000077243305,0.0007102002,0.00009195764,0.0003517786,0.0010210689,0.0052459342,0.00045943446,0.0016345938,0.00014971747,0.9900985],"study_design_scores_gemma":[0.0026016755,0.0016940444,0.000115889285,0.003452947,0.00013608589,0.0011343026,0.000005685729,0.97194946,0.0001358113,0.0033609124,0.014766216,0.0006469772],"about_ca_topic_score_codex":0.000010581587,"about_ca_topic_score_gemma":0.0000170869,"teacher_disagreement_score":0.98945147,"about_ca_system_score_codex":0.00029647315,"about_ca_system_score_gemma":0.00074883306,"threshold_uncertainty_score":0.95325035},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023715407,0.00004234396,0.97513163,0.000466403,0.000086954125,0.0004605984,3.5629117e-7,0.000068548754,0.000027784792],"genre_scores_gemma":[0.7177873,0.000008986278,0.281922,0.000115237,0.00005970871,0.0000036467131,0.0000019603258,0.0000127467165,0.00008839234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971502,0.00027594785,0.00023974347,0.0007910915,0.0012543915,0.00028861323],"domain_scores_gemma":[0.9981006,0.00085939636,0.0002526626,0.0005622162,0.00016177593,0.00006337772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023280878,0.00026851322,0.00026664606,0.00053037686,0.00013448474,0.0005064217,0.00092282996,0.00013383049,0.0000023532464],"category_scores_gemma":[0.00026151215,0.00019224446,0.000029661185,0.0005518427,0.00026372419,0.0004877767,0.0002738888,0.00048798358,0.0000031344803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006761991,0.000018549037,0.00088613207,0.000008524798,0.000007433326,0.0000066036673,0.0051524304,0.8925104,0.00004019839,0.00006244211,0.0000010387628,0.10129949],"study_design_scores_gemma":[0.0002533282,0.00038647142,0.002325965,0.0002073018,0.00002218543,0.00000907589,0.0000023716004,0.9943048,0.000078092075,0.0020812713,0.000094909716,0.00023422834],"about_ca_topic_score_codex":0.000005399737,"about_ca_topic_score_gemma":0.000018196972,"teacher_disagreement_score":0.6940719,"about_ca_system_score_codex":0.00015993162,"about_ca_system_score_gemma":0.00018912999,"threshold_uncertainty_score":0.78395015},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035738875,0.00004615649,0.9913249,0.0010629207,0.0010949716,0.00032658424,0.000004045841,0.00022684316,0.002339705],"genre_scores_gemma":[0.82974845,0.0000033582132,0.16344264,0.0021931927,0.0013794033,0.000023530672,0.00008406699,0.000080280595,0.0030450856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99516493,0.00016275454,0.00081993133,0.0018116154,0.0015312958,0.00050949916],"domain_scores_gemma":[0.9956139,0.00071103254,0.00065110996,0.0025520385,0.00025785863,0.00021406163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013106696,0.0005427456,0.0007666288,0.0028107485,0.00038138902,0.00028301994,0.0026737791,0.00029924203,0.000034148215],"category_scores_gemma":[0.00013706653,0.000476925,0.00031744942,0.0019633104,0.00038361055,0.000074949014,0.0007252429,0.0005807185,0.000016291395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022379258,0.00012818942,0.00004632624,0.000021746522,0.000050423772,0.0000059186136,0.0005285625,0.76848567,0.000008053192,0.0014183376,0.00020975653,0.22907463],"study_design_scores_gemma":[0.00020285,0.00086259836,0.00042974064,0.00024526694,0.00015954711,0.0000024741626,8.345443e-7,0.98927796,0.00010505228,0.0038888636,0.0043501817,0.00047460452],"about_ca_topic_score_codex":0.00006151569,"about_ca_topic_score_gemma":0.00012881681,"teacher_disagreement_score":0.82788223,"about_ca_system_score_codex":0.0013818336,"about_ca_system_score_gemma":0.00016419718,"threshold_uncertainty_score":0.99976826},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005512418,0.0005731019,0.99083495,0.0007158471,0.002809529,0.00019625342,0.0000080958325,0.00030901958,0.0040019425],"genre_scores_gemma":[0.20732298,0.000075286734,0.7854871,0.0020015654,0.0028520909,0.0000093333865,0.000017761364,0.0000636796,0.0021702028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557376,0.000055802553,0.0005136155,0.0019802705,0.0011410911,0.00073545246],"domain_scores_gemma":[0.9966439,0.0008151032,0.00033648498,0.0017287545,0.00024100574,0.0002347294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007335483,0.0006184926,0.00058078323,0.0006294331,0.00033727498,0.001027242,0.005025896,0.00036956917,0.00023054951],"category_scores_gemma":[0.00018356666,0.0005414036,0.00014109386,0.0005505159,0.00089089846,0.00070006127,0.0016802266,0.0012350127,0.0003849713],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002950694,0.000023968782,0.0003414746,0.000016259442,0.000013750362,0.00012896823,0.0014664092,0.0063889115,0.000038237114,0.0036093772,0.000051711657,0.98791796],"study_design_scores_gemma":[0.00025429114,0.00023262617,0.001126092,0.0005390389,0.000009385631,0.000035747926,1.4542074e-7,0.76007533,0.00074688875,0.23245484,0.0035523318,0.00097325764],"about_ca_topic_score_codex":0.00016182207,"about_ca_topic_score_gemma":0.00018645164,"teacher_disagreement_score":0.98694474,"about_ca_system_score_codex":0.00015023722,"about_ca_system_score_gemma":0.00048776538,"threshold_uncertainty_score":0.99970376},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005675751,0.000543973,0.99579096,0.00010032423,0.0011647737,0.00019495872,0.000028566914,0.00076480955,0.00084407366],"genre_scores_gemma":[0.8979808,0.00013586374,0.09723633,0.0003094784,0.0016881542,0.0000068346203,0.0011722439,0.0001763346,0.0012939338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800706,0.000013771121,0.0003211718,0.00086248276,0.00046196644,0.00033355894],"domain_scores_gemma":[0.99821055,0.00007970726,0.00010094848,0.0014434825,0.00011443723,0.00005088742],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028048444,0.00035608988,0.00031261996,0.00043277384,0.000258907,0.00027302207,0.0022192486,0.0004958278,0.00013128563],"category_scores_gemma":[0.0000683497,0.00034958922,0.000044833625,0.0003111651,0.00047419418,0.0003464464,0.0006324274,0.00086355157,0.00008876805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007476281,0.00002314418,0.00032078044,0.00018867919,0.00009367204,0.000085955886,0.0020650735,0.20275602,0.023419116,0.0012884922,0.002447445,0.7673041],"study_design_scores_gemma":[0.00026483543,0.00004954115,0.00035674524,0.00032642492,0.000030207735,0.0000130703565,0.0000016646641,0.9238171,0.01799156,0.04538342,0.010914606,0.00085085054],"about_ca_topic_score_codex":0.000020688722,"about_ca_topic_score_gemma":0.00012710225,"teacher_disagreement_score":0.8985546,"about_ca_system_score_codex":0.00012778473,"about_ca_system_score_gemma":0.000049858434,"threshold_uncertainty_score":0.99989563},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026529358,0.0005232674,0.99310255,0.0005249453,0.0012759342,0.00027226945,0.000017962157,0.000090155125,0.003927629],"genre_scores_gemma":[0.22345024,0.00017816063,0.77421004,0.0011408848,0.00046105,0.000008496093,0.000044061973,0.000032302298,0.000474744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967695,0.00003725944,0.0005684473,0.0011254863,0.0010763669,0.00042295107],"domain_scores_gemma":[0.99774456,0.0004478936,0.00038718764,0.0007828759,0.0004900285,0.00014746582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047705977,0.00040337065,0.00047580304,0.0011320772,0.00018844873,0.00012594556,0.0018432204,0.00022980726,0.00004172711],"category_scores_gemma":[0.000076326454,0.00038473084,0.00019024148,0.0009221654,0.0005532932,0.0005814807,0.00071945874,0.00045302525,0.000036164034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001038799,0.000056056673,0.000013086085,0.000035817433,0.000028965367,0.00011243786,0.0010667299,0.06438513,0.0002101439,0.01836212,0.0005661246,0.915153],"study_design_scores_gemma":[0.00050038873,0.0003687409,0.00048976816,0.00039683844,0.000012280019,0.00032706108,2.0588807e-7,0.8705686,0.007669664,0.11334016,0.0054020267,0.00092428736],"about_ca_topic_score_codex":0.000012001364,"about_ca_topic_score_gemma":0.00001651276,"teacher_disagreement_score":0.91422874,"about_ca_system_score_codex":0.00018511878,"about_ca_system_score_gemma":0.0008059684,"threshold_uncertainty_score":0.99986047},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40857854,0.00010932825,0.5722265,0.016173288,0.0015636501,0.0006220234,0.000026321319,0.0003173308,0.000382992],"genre_scores_gemma":[0.7030329,0.000019695573,0.23632504,0.043139093,0.0024958935,0.00005024395,0.000043409193,0.00020838554,0.014685312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99460346,0.0010485564,0.0007910219,0.0015010728,0.0010493583,0.0010065397],"domain_scores_gemma":[0.99539465,0.0009360885,0.00032865928,0.0027174284,0.0003360033,0.00028715935],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004560978,0.0007139814,0.0006988212,0.001104834,0.0010790748,0.0010385796,0.00522367,0.00046688927,0.00008178659],"category_scores_gemma":[0.00025613123,0.00055837305,0.00016315983,0.0011030585,0.0007208657,0.0014669033,0.002276167,0.002718652,0.00029720468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031271065,0.00045493097,0.0028513274,0.00010663169,0.00010887879,0.000425123,0.16099104,0.10958776,0.014241054,0.00040684539,0.0018250031,0.7086887],"study_design_scores_gemma":[0.00082189,0.001675939,0.021606183,0.0033179095,0.000027515638,0.00019811539,0.000011708761,0.9189691,0.0024904327,0.013063302,0.035123654,0.002694275],"about_ca_topic_score_codex":0.0010463522,"about_ca_topic_score_gemma":0.00036670725,"teacher_disagreement_score":0.8093813,"about_ca_system_score_codex":0.00045879002,"about_ca_system_score_gemma":0.00043556932,"threshold_uncertainty_score":0.99999845},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3813504,0.000063275205,0.6172346,0.000030954125,0.0006064091,0.00017134787,0.0000013436664,0.0005337137,0.000007994244],"genre_scores_gemma":[0.97145164,0.000014545719,0.02801864,0.00004099037,0.00043352018,0.000015591835,0.0000055749965,0.000018831019,6.529043e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869406,0.00001828649,0.00018458239,0.0003837085,0.00024418364,0.00047516293],"domain_scores_gemma":[0.9994282,0.00015935603,0.000035620877,0.0002455106,0.00006900802,0.000062267034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024774944,0.00018928545,0.0001809309,0.00021340817,0.00020492909,0.00013212713,0.00034266885,0.00012901486,0.000003977421],"category_scores_gemma":[0.000011335103,0.00014988707,0.00003184509,0.0012854114,0.00020484984,0.0002590944,0.000060053328,0.00020291495,0.000005000866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014635789,0.000013617624,0.0003151227,0.00002390061,0.000002132473,0.0000065288846,0.0001590037,0.96915954,0.013181191,0.000010311514,0.000024221126,0.01708982],"study_design_scores_gemma":[0.0002892546,0.00012891115,0.0076965746,0.000069167436,0.0000035355438,0.000033938162,3.7168385e-7,0.974223,0.01636954,0.00091253605,0.000032998923,0.00024012735],"about_ca_topic_score_codex":0.00005485301,"about_ca_topic_score_gemma":0.00024088359,"teacher_disagreement_score":0.59010124,"about_ca_system_score_codex":0.00011662418,"about_ca_system_score_gemma":0.000033865428,"threshold_uncertainty_score":0.61122173},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005071304,0.00089737354,0.99584097,0.0009275987,0.00040265435,0.000998541,0.0000019706604,0.00007256608,0.00035122136],"genre_scores_gemma":[0.14235574,0.00019907276,0.8532089,0.0020103892,0.0006785236,0.000079191515,0.000059134378,0.000111091395,0.0012979356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773645,0.00001971516,0.00049097644,0.00089463254,0.00035819167,0.0005000275],"domain_scores_gemma":[0.99861515,0.0004646637,0.00022412823,0.00038815432,0.00015393956,0.00015398416],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011629725,0.00031998003,0.0005771609,0.0006437932,0.00019924634,0.0000929219,0.0005052074,0.00024219896,0.000025219722],"category_scores_gemma":[0.0004889008,0.00029536962,0.00012232989,0.0003184208,0.0006490545,0.00007816636,0.00019859233,0.0013577356,0.000017119688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016965605,0.00004512158,0.0012304775,0.00032359958,0.00001643554,0.000027609429,0.00049317663,0.032880634,0.00033267375,0.0005806717,0.000010843355,0.96404177],"study_design_scores_gemma":[0.0008143313,0.00012021062,0.00033565488,0.0010945738,0.00002630162,0.00008649705,4.6650533e-7,0.9823449,0.000032407504,0.0033842563,0.01146685,0.00029351845],"about_ca_topic_score_codex":0.000015229928,"about_ca_topic_score_gemma":0.00005688002,"teacher_disagreement_score":0.9637483,"about_ca_system_score_codex":0.0003893951,"about_ca_system_score_gemma":0.00034400166,"threshold_uncertainty_score":0.9999499},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1674068,0.00004214236,0.82930857,0.0021377907,0.0006012827,0.0003253828,0.000010609916,0.00010030336,0.00006710802],"genre_scores_gemma":[0.5155427,5.095571e-7,0.4836146,0.00055625173,0.00026323306,0.000013098557,0.0000017623825,0.0000071921795,6.6949883e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966046,0.00030692678,0.000402278,0.0012939211,0.0007538717,0.0006384018],"domain_scores_gemma":[0.9974016,0.0005724775,0.00017520114,0.0011509218,0.00048138906,0.00021842208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009337364,0.00028497353,0.00038343895,0.00046434344,0.00025396651,0.00027044426,0.0028266218,0.000090958914,0.00001323659],"category_scores_gemma":[0.00062392716,0.00024218352,0.00006168652,0.0029409465,0.00071726245,0.0006033322,0.0012991,0.0003835378,0.000025256424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051496023,0.00021638146,0.014690382,0.00010812977,0.000022895307,0.000039393737,0.12150256,0.02169732,0.046120975,0.002855305,0.000103269704,0.79259187],"study_design_scores_gemma":[0.00022827985,0.00066216604,0.022739818,0.00007820889,0.0000025792822,0.000011299584,0.000009404704,0.87822187,0.091586225,0.0060979133,0.000035821977,0.00032641416],"about_ca_topic_score_codex":0.0013458146,"about_ca_topic_score_gemma":0.0003274081,"teacher_disagreement_score":0.8565245,"about_ca_system_score_codex":0.00016133804,"about_ca_system_score_gemma":0.00039438473,"threshold_uncertainty_score":0.98759574},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037617951,0.0011654913,0.9855185,0.0025951846,0.003933188,0.0007430792,0.00005682469,0.0011778097,0.0010480974],"genre_scores_gemma":[0.076547675,0.0000730447,0.9213006,0.0013247385,0.0005138119,0.000011939708,0.00001529004,0.000092338996,0.0001205478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.991967,0.00009347159,0.0009625678,0.003242441,0.0022107088,0.001523772],"domain_scores_gemma":[0.9793243,0.00085818686,0.00073713827,0.018265406,0.0005800377,0.00023493633],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0014292625,0.0011480959,0.0010240311,0.0018442512,0.0007150662,0.001443188,0.07096608,0.0009963906,0.000045889854],"category_scores_gemma":[0.006754601,0.0010377491,0.00023336778,0.0018141733,0.0033137002,0.0006912928,0.12427487,0.0017812969,0.00010152284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008571104,0.00027433154,0.00007946578,0.00035969503,0.00017542344,0.0013471625,0.002193351,0.55153674,0.0044664666,0.0141323,0.007965987,0.41738337],"study_design_scores_gemma":[0.00035533422,0.00013383615,0.000021480824,0.0006978964,0.00001325153,0.00008794382,4.339811e-7,0.6877683,0.0029748841,0.3061795,0.00091939647,0.0008477822],"about_ca_topic_score_codex":0.00008556116,"about_ca_topic_score_gemma":0.0000744241,"teacher_disagreement_score":0.4165356,"about_ca_system_score_codex":0.0008889188,"about_ca_system_score_gemma":0.0010296697,"threshold_uncertainty_score":0.99959344},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014400838,0.00011865052,0.9950797,0.0002367802,0.00032434784,0.000382851,0.000011687451,0.00007108884,0.002334827],"genre_scores_gemma":[0.11378468,0.000031363397,0.88486767,0.000979508,0.000128908,0.000011075817,0.000013479691,0.000015000566,0.00016833581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980236,0.00003189499,0.0004045,0.0007804752,0.00045777965,0.0003017252],"domain_scores_gemma":[0.9985822,0.0001570991,0.00012378249,0.00071907946,0.00029713623,0.00012070574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059626705,0.0002585268,0.0003122259,0.00055524474,0.00020982015,0.00034079698,0.001280269,0.0001005497,0.0000055274254],"category_scores_gemma":[0.00008477538,0.00023344888,0.000045104938,0.0004934438,0.0008040059,0.0006139385,0.00086616207,0.0001733268,0.00000835674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064796936,0.00006555358,0.000020983518,0.00006750922,0.000015096537,0.0000034271084,0.007931028,0.1089723,0.0004507386,0.5011508,0.00005257498,0.38126352],"study_design_scores_gemma":[0.00010793359,0.00012036606,0.00022151363,0.00008390882,0.0000033104152,0.000019523273,4.412483e-7,0.7772773,0.00075592264,0.22096138,0.00020790662,0.0002404832],"about_ca_topic_score_codex":0.000023576606,"about_ca_topic_score_gemma":0.00009858677,"teacher_disagreement_score":0.66830504,"about_ca_system_score_codex":0.00007224473,"about_ca_system_score_gemma":0.00020424595,"threshold_uncertainty_score":0.9519769},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60999846,0.005273817,0.29744828,0.002563837,0.013472053,0.01473918,0.0011207677,0.0005835835,0.054799993],"genre_scores_gemma":[0.99110717,0.00008093173,0.005310925,0.0011321218,0.000444498,0.00004964372,0.000053044612,0.00003750121,0.0017841692],"study_design_codex":"observational","study_design_gemma":"systematic_review","domain_scores_codex":[0.9975507,0.00011949798,0.00053066335,0.0006084653,0.00055906596,0.0006315525],"domain_scores_gemma":[0.9958554,0.0027999268,0.0005092306,0.0003754469,0.00027022095,0.00018979475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065392227,0.00028498232,0.00045621264,0.0003016365,0.00068791315,0.000021747976,0.00032204177,0.00025623364,0.000754174],"category_scores_gemma":[0.00023253397,0.0002284818,0.000042856118,0.00018012166,0.001138311,0.00013139982,0.0002523262,0.0006458317,0.000021261298],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030787376,0.00066598644,0.56519103,0.01793488,0.00030382976,0.000031114894,0.26029614,0.0008831247,0.000272772,0.011803318,0.0015828284,0.14072712],"study_design_scores_gemma":[0.009323199,0.03086378,0.088917896,0.54319495,0.00059141946,0.000048436093,0.002050087,0.16734493,0.00067679636,0.1338974,0.01496481,0.008126296],"about_ca_topic_score_codex":0.0003122481,"about_ca_topic_score_gemma":0.0037243385,"teacher_disagreement_score":0.5252601,"about_ca_system_score_codex":0.0009395704,"about_ca_system_score_gemma":0.0011187897,"threshold_uncertainty_score":0.93172175},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013194855,0.00012820482,0.9931666,0.00037284294,0.0034831006,0.0010063209,0.00003591635,0.00028478072,0.0013902338],"genre_scores_gemma":[0.011787871,0.000010209601,0.98628986,0.0007332135,0.00091825787,0.000054408738,0.000010069018,0.000044447985,0.00015167799],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99503124,0.00011269806,0.0008194034,0.0021787107,0.00093467865,0.00092328986],"domain_scores_gemma":[0.9948598,0.0012598955,0.0005334848,0.0025219927,0.0006447864,0.00018002582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005067068,0.0006344986,0.00065205444,0.00055628654,0.00052363036,0.00070522114,0.0044918694,0.0004527842,0.000028603195],"category_scores_gemma":[0.0008746713,0.0005807918,0.0002000429,0.0006225887,0.0014322004,0.0010257326,0.0016073716,0.0006408887,0.00003490599],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009439727,0.000014746608,0.000037211583,0.00007944919,0.000010818613,0.000003753082,0.0015075714,0.0020846114,0.00013069846,0.1317077,0.000027009613,0.864387],"study_design_scores_gemma":[0.00012599434,0.00017426745,0.00009440879,0.00010574182,0.0000055040273,0.000025069594,3.6130598e-7,0.43129343,0.0026036766,0.564101,0.0010415902,0.0004289594],"about_ca_topic_score_codex":0.00002035265,"about_ca_topic_score_gemma":0.000022071872,"teacher_disagreement_score":0.86395806,"about_ca_system_score_codex":0.00045794787,"about_ca_system_score_gemma":0.0004813946,"threshold_uncertainty_score":0.99966437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015085583,0.00012857812,0.99640375,0.0004064778,0.00073136523,0.00048709507,0.000017005314,0.0010723019,0.0006025934],"genre_scores_gemma":[0.03419298,0.00004453646,0.96461904,0.00057651463,0.00020761299,0.000023463526,0.0000066993716,0.00005305113,0.00027608924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957696,0.000022544062,0.00066936173,0.0015079827,0.0011752946,0.00085519435],"domain_scores_gemma":[0.9959555,0.00011676127,0.00023651142,0.003100204,0.00039312764,0.00019786801],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012598467,0.0006581012,0.0005966358,0.00064031436,0.00025930692,0.00058838987,0.0066717872,0.0004934184,0.000011512722],"category_scores_gemma":[0.000024958093,0.0006288792,0.00018836725,0.0005377364,0.00057942653,0.0017390919,0.0018092458,0.0008311649,0.000047865844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040690275,0.000018751998,0.0000015379192,0.000048530124,0.000012199186,0.000018081302,0.006787956,0.4835751,0.00014421788,0.08754281,0.000066233966,0.4217805],"study_design_scores_gemma":[0.00010966677,0.000077646284,0.0000021677085,0.00019180457,0.0000048414704,0.000029181123,2.5018576e-8,0.7564535,0.0020991466,0.23852053,0.0019883362,0.00052314793],"about_ca_topic_score_codex":0.000012258598,"about_ca_topic_score_gemma":0.000033008273,"teacher_disagreement_score":0.42125738,"about_ca_system_score_codex":0.00041102016,"about_ca_system_score_gemma":0.00037844668,"threshold_uncertainty_score":0.99961627},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014636728,0.0003542422,0.9933672,0.00020439026,0.0035112947,0.00029523027,0.000001073252,0.00023966926,0.0018805483],"genre_scores_gemma":[0.025317801,0.000033257485,0.97229034,0.0006346415,0.0014792996,0.000003211335,0.0000012777951,0.000051025523,0.00018915819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954588,0.00013638675,0.00062772766,0.002006521,0.00089825236,0.00087232265],"domain_scores_gemma":[0.99738467,0.00043519313,0.00045773236,0.0011319417,0.00032427578,0.00026619845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015386462,0.0006502568,0.0006757635,0.0010142466,0.0005639966,0.0008096695,0.00227227,0.00073543075,0.000089500754],"category_scores_gemma":[0.00021406318,0.0006211934,0.00019036679,0.0008799265,0.00095291424,0.00081490586,0.0011586939,0.0017363281,0.00003493833],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005403617,0.000012907515,0.00004311174,0.000024281251,0.00001149922,0.00004253286,0.00072161114,0.0027721194,0.00023247016,0.016434478,0.0000032674798,0.97969633],"study_design_scores_gemma":[0.00009074959,0.00013424645,0.000009865573,0.0006392364,0.000008290866,0.00023740919,1.0427567e-7,0.59048235,0.00080989086,0.40688062,0.00022070108,0.00048653394],"about_ca_topic_score_codex":0.000016189524,"about_ca_topic_score_gemma":0.000012637851,"teacher_disagreement_score":0.9792098,"about_ca_system_score_codex":0.00038219488,"about_ca_system_score_gemma":0.00066339335,"threshold_uncertainty_score":0.99962395},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11262785,0.00076766714,0.88435614,0.00015702416,0.0013097723,0.00036108366,0.0002329808,0.00005704582,0.00013040502],"genre_scores_gemma":[0.96590966,0.000021714539,0.03282762,0.0002985466,0.00078739086,0.0000076073197,0.00008526015,0.00003536042,0.000026868163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973331,0.00004109097,0.00033637005,0.0013310085,0.0005663817,0.00039201786],"domain_scores_gemma":[0.9985701,0.0001221498,0.00026271207,0.000878422,0.000030720625,0.00013588478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006513906,0.00032376524,0.00039400396,0.00011901298,0.00032576633,0.00017735489,0.0010559303,0.0002814223,0.000189974],"category_scores_gemma":[0.000021045003,0.00027245187,0.000035730827,0.00022267322,0.00013848984,0.00063648506,0.0011808894,0.00027579188,0.00004994694],"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.00006644746,0.00021240705,0.038684078,0.00011584236,0.000050031627,0.000014947579,0.003582178,0.00076837244,0.0306071,0.000008155966,0.00028375306,0.92560667],"study_design_scores_gemma":[0.0002205892,0.00012803439,0.015673254,0.00018682139,0.00004157615,0.000009102006,7.946321e-7,0.9734736,0.0011623844,0.0011843402,0.0073877196,0.0005317721],"about_ca_topic_score_codex":0.003556481,"about_ca_topic_score_gemma":0.019091321,"teacher_disagreement_score":0.97270525,"about_ca_system_score_codex":0.00080357987,"about_ca_system_score_gemma":0.000026253407,"threshold_uncertainty_score":0.99997276},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019763415,0.00021804753,0.9951562,0.00023793208,0.00044274595,0.00043452598,0.000008089361,0.0000317357,0.0014943545],"genre_scores_gemma":[0.51719123,0.0000056667477,0.4821619,0.0004026187,0.00018399056,0.0000065581603,0.000013336641,0.000012041188,0.000022623117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692696,0.00007089895,0.0005036177,0.0009881173,0.0011608722,0.00034953112],"domain_scores_gemma":[0.9980151,0.0002603464,0.00030824286,0.0010196158,0.00033960666,0.00005706386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092446554,0.0003580526,0.00034891168,0.0009307637,0.000126298,0.0002381105,0.002900544,0.0002613359,0.0000067894794],"category_scores_gemma":[0.0000865861,0.00027817397,0.000106034655,0.001026369,0.0004798957,0.0004531822,0.00053863274,0.0004977658,0.000002671833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003554005,0.000027140037,0.000006594055,0.000028850485,0.000003775979,0.000011737442,0.0015629961,0.81477576,0.00041823465,0.02477052,0.000008529462,0.15838228],"study_design_scores_gemma":[0.00015490582,0.00008461826,0.00006896071,0.00006873437,0.000005023106,0.000041873485,2.833211e-7,0.8026306,0.0010092483,0.19565995,0.000040898307,0.00023487426],"about_ca_topic_score_codex":0.0000086163445,"about_ca_topic_score_gemma":0.000055629458,"teacher_disagreement_score":0.5152149,"about_ca_system_score_codex":0.00012639958,"about_ca_system_score_gemma":0.00041265544,"threshold_uncertainty_score":0.99996704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003902517,0.00010751065,0.9986393,0.000031588843,0.00021616522,0.00038543085,0.000048802918,0.000053815544,0.00012712559],"genre_scores_gemma":[0.40654826,0.000025162359,0.59265274,0.000117662355,0.00027577713,0.000013443933,0.0002913168,0.000042505297,0.000033128712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886554,0.000007501438,0.0003206075,0.00036211463,0.00026381682,0.00018041444],"domain_scores_gemma":[0.9990212,0.000126301,0.0001304743,0.00042049628,0.00025439798,0.00004715147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022208941,0.00019272893,0.00032889366,0.00068377034,0.00009605448,0.00006268159,0.00027047592,0.00016212242,0.000011377997],"category_scores_gemma":[0.000026867905,0.00019177704,0.00010022367,0.0006672539,0.00020154078,0.00007344943,0.000041974345,0.00012157114,7.492433e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027590395,0.0000066063476,0.000016546495,0.000057162666,0.00006132242,2.6733323e-7,0.00009914781,0.9496734,0.00053080637,0.00040925582,0.000009405459,0.04913333],"study_design_scores_gemma":[0.000076707474,0.000023665598,0.00015061533,0.00007932763,0.00018672565,0.0000010867793,1.2398658e-7,0.992161,0.002053059,0.0050230203,0.00006870915,0.0001760008],"about_ca_topic_score_codex":0.0000346017,"about_ca_topic_score_gemma":0.00009127929,"teacher_disagreement_score":0.40615803,"about_ca_system_score_codex":0.00018331208,"about_ca_system_score_gemma":0.00006370272,"threshold_uncertainty_score":0.7820441},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020330875,0.0002384194,0.9961612,0.00008271621,0.00018850766,0.0024142894,0.000025907877,0.000024793151,0.00066084316],"genre_scores_gemma":[0.005666564,0.00004829609,0.99160796,0.0002486255,0.0011135185,0.00063766324,0.0003282718,0.00005083671,0.00029823295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982333,0.000027022677,0.00029957737,0.0008278581,0.00031401656,0.00029821755],"domain_scores_gemma":[0.9987964,0.000085251915,0.00025740956,0.0004939633,0.00029853082,0.000068438814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069710886,0.00029738253,0.00034827867,0.00020526997,0.00016061684,0.000116697855,0.00050984905,0.00019919926,0.000014042186],"category_scores_gemma":[0.000023827353,0.00025307166,0.00011502486,0.0001069909,0.00052729726,0.000011235995,0.00017316523,0.00013122123,0.000009708567],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081635447,0.000050791125,0.0000031194306,0.00006445909,0.00008956855,0.000001982552,0.00012914758,0.005089068,0.005048686,0.00028252386,0.000022545557,0.9884018],"study_design_scores_gemma":[0.036114678,0.00075942895,0.000004535218,0.00024218785,0.00011637999,0.00008659957,7.916771e-7,0.8232389,0.030629562,0.10012513,0.007604342,0.0010774739],"about_ca_topic_score_codex":0.000004897471,"about_ca_topic_score_gemma":0.000016800826,"teacher_disagreement_score":0.9873243,"about_ca_system_score_codex":0.00006927167,"about_ca_system_score_gemma":0.00013236832,"threshold_uncertainty_score":0.99999213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036071748,0.00052111014,0.9926387,0.00046924368,0.001610446,0.00033751756,0.0000018497882,0.00026288428,0.00055108167],"genre_scores_gemma":[0.7474322,0.00006181378,0.24921417,0.0017651727,0.0004119187,0.00001017602,0.0000046566024,0.000074594245,0.0010253341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958665,0.0000768459,0.00061957573,0.0017788381,0.00091574475,0.00074250373],"domain_scores_gemma":[0.9977794,0.0002812616,0.00021748239,0.0013461305,0.00017329257,0.00020243338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012526155,0.00055487826,0.0005730978,0.0010372516,0.00025577474,0.00048535384,0.003391349,0.00038237876,0.000032694505],"category_scores_gemma":[0.000067771325,0.0005050738,0.00015319686,0.00059955486,0.0004171135,0.00072584394,0.00085871323,0.0011349394,0.000073065414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038884387,0.00015327612,0.00019081509,0.000092300936,0.000022788176,0.00045721442,0.0054828175,0.04709384,0.009740311,0.003325695,0.00007712557,0.93332493],"study_design_scores_gemma":[0.0007303041,0.00018023491,0.00028978664,0.0011362521,0.0000073632655,0.00006711115,3.2887544e-7,0.9760998,0.0016720735,0.018395457,0.00057751883,0.0008438019],"about_ca_topic_score_codex":0.00024358343,"about_ca_topic_score_gemma":0.0005518354,"teacher_disagreement_score":0.9324811,"about_ca_system_score_codex":0.00036585046,"about_ca_system_score_gemma":0.00045921307,"threshold_uncertainty_score":0.99974006},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041983367,0.000019804824,0.99348086,0.0014196073,0.002515062,0.0004378341,0.0000119892775,0.00017847905,0.0018943603],"genre_scores_gemma":[0.04857628,0.000007660927,0.9420374,0.008364424,0.00045631357,0.000008454385,0.000012808636,0.000032647866,0.00050397986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679893,0.000025629452,0.00045832022,0.0012731082,0.0008733897,0.0005705932],"domain_scores_gemma":[0.99778557,0.00016832358,0.00020450122,0.0011398975,0.00042345768,0.0002782718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052515115,0.00039978483,0.00032452683,0.0007007049,0.00022860242,0.0005590783,0.0018968631,0.0002102059,0.00016177153],"category_scores_gemma":[0.000119355434,0.000395935,0.00008090983,0.00066299026,0.00039237883,0.00030706805,0.00065977115,0.00038215015,0.00016854263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007710437,0.00003193358,0.00013820044,0.000030682342,0.00000867433,0.000032146338,0.00046578326,0.054217976,0.00012090863,0.009244773,0.00020928528,0.9354919],"study_design_scores_gemma":[0.00043482223,0.0003091677,0.0004710252,0.0002746362,0.000009032558,0.000015112666,1.3724315e-7,0.93923736,0.0021420866,0.042998273,0.013205132,0.00090319134],"about_ca_topic_score_codex":0.000014311042,"about_ca_topic_score_gemma":0.00008353725,"teacher_disagreement_score":0.93458873,"about_ca_system_score_codex":0.00035521915,"about_ca_system_score_gemma":0.00078741106,"threshold_uncertainty_score":0.99984926},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005498215,0.00031652584,0.99380165,0.001254089,0.0007952403,0.00027623423,0.000011123018,0.00010980688,0.002885497],"genre_scores_gemma":[0.6578996,0.00007031963,0.33728933,0.0033035371,0.000786062,0.000010768141,0.000031515192,0.000042173597,0.0005666649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698097,0.000041240764,0.0003666647,0.0012828535,0.0007818449,0.0005464424],"domain_scores_gemma":[0.99822706,0.0003831605,0.00017345684,0.00075761485,0.00021344805,0.00024524578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000677186,0.0004011772,0.00034925697,0.00075710367,0.00041573436,0.0006637495,0.0015772156,0.00018774855,0.000028408731],"category_scores_gemma":[0.00007706922,0.0003828168,0.00007320193,0.0005374153,0.0004239914,0.00055947277,0.0013536154,0.0006049923,0.000012819682],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004213149,0.000017850492,0.00005826129,0.000026894804,0.000009579576,0.000051998522,0.0016687461,0.018098136,0.00013086459,0.08016772,0.000043536787,0.8997222],"study_design_scores_gemma":[0.00027018672,0.00022873774,0.00068966625,0.0001285625,0.000007849221,0.000113288224,3.470956e-7,0.60396904,0.0011445911,0.38897485,0.003763098,0.00070978276],"about_ca_topic_score_codex":0.00009797816,"about_ca_topic_score_gemma":0.00027228743,"teacher_disagreement_score":0.8990124,"about_ca_system_score_codex":0.00013307772,"about_ca_system_score_gemma":0.00055664574,"threshold_uncertainty_score":0.9998624},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006691885,0.00042978654,0.9967289,0.00018960779,0.0010697262,0.0003740306,0.000011629878,0.00002464284,0.00050248584],"genre_scores_gemma":[0.12053656,0.00004079725,0.87374836,0.0022669178,0.0020949873,0.000034068864,0.00007084649,0.000072502204,0.0011349379],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974665,0.000079739584,0.0003593225,0.0013657229,0.00035708767,0.00037163784],"domain_scores_gemma":[0.9981918,0.000058120087,0.00027329253,0.0009972174,0.00029382284,0.000185766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006332967,0.0004065629,0.00032507678,0.00031865752,0.0001597781,0.00007171532,0.0007412361,0.0005082329,0.00009006634],"category_scores_gemma":[0.000060127993,0.00034097713,0.00011581368,0.00023186154,0.00034165356,0.000008281909,0.0004107595,0.00028483247,0.000015508183],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021020242,0.000019585472,0.000026781427,0.000011239081,0.000017677596,0.000006513408,0.00008849345,0.055496156,0.27663028,0.0000675041,0.0007587101,0.66666687],"study_design_scores_gemma":[0.00085419446,0.0007506094,0.00074293953,0.0009913521,0.000030624185,0.000040025316,0.0000010240753,0.40932494,0.5626575,0.006426213,0.016929738,0.0012508753],"about_ca_topic_score_codex":0.000005351188,"about_ca_topic_score_gemma":0.000026357091,"teacher_disagreement_score":0.665416,"about_ca_system_score_codex":0.00009291186,"about_ca_system_score_gemma":0.00038145052,"threshold_uncertainty_score":0.9999042},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012317957,0.000044401397,0.9858789,0.00029221294,0.0008445146,0.00045786315,0.00004436854,0.000055330656,0.000064446],"genre_scores_gemma":[0.245833,0.00001517534,0.7534424,0.00014163567,0.00031361452,0.000016055432,0.00019130709,0.000022090204,0.00002473308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728143,0.000019124422,0.00045238482,0.0015527311,0.0003545593,0.00033976787],"domain_scores_gemma":[0.9978037,0.00021337574,0.00030710036,0.0014135577,0.00018540889,0.000076888595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008148743,0.00026174422,0.00024639152,0.00047471884,0.00023090867,0.00045926083,0.0018149763,0.00014614608,0.0000022396464],"category_scores_gemma":[0.00012548857,0.00025687378,0.000022234115,0.00028417126,0.00024435113,0.000921056,0.0017053538,0.00025229395,0.0000034122677],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003211712,0.000028213346,0.0008604233,0.000029096487,0.0000030163849,0.0000011911559,0.0008462414,0.00017496219,0.00012598981,0.0007740846,0.000038355276,0.9971152],"study_design_scores_gemma":[0.00030565218,0.00014236988,0.0041378043,0.0008244523,0.0000066757943,0.000011461491,0.0000016029111,0.9851856,0.00015782163,0.008521277,0.00035305668,0.00035218528],"about_ca_topic_score_codex":0.000026477768,"about_ca_topic_score_gemma":0.000063413594,"teacher_disagreement_score":0.99676305,"about_ca_system_score_codex":0.0001816769,"about_ca_system_score_gemma":0.00012823656,"threshold_uncertainty_score":0.9999884},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33256668,0.00007506931,0.66678494,0.000046949437,0.00028864932,0.00017368843,2.537216e-7,0.000057934332,0.000005822075],"genre_scores_gemma":[0.70998865,0.0000039434462,0.28975546,0.00015570728,0.00007937298,0.0000047471776,8.812105e-7,0.000011119961,1.257718e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989769,0.000023953628,0.0001833145,0.00028483523,0.00019701422,0.0003340133],"domain_scores_gemma":[0.9995631,0.00005249644,0.000022261882,0.00020104242,0.000095821066,0.00006528845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011708808,0.00014907398,0.0001451732,0.00017034823,0.00011611337,0.00028705865,0.00023687328,0.000058558624,0.000016216569],"category_scores_gemma":[0.000036863818,0.00013391471,0.000022349039,0.0007485773,0.00011466821,0.00038026634,0.000043610293,0.00018414909,0.000007715089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.4885372e-7,0.000007767095,0.0017971618,0.000013327707,0.0000025896181,0.0000046087866,0.00054959394,0.9346059,0.02271404,0.000016509202,8.902196e-7,0.040287368],"study_design_scores_gemma":[0.000111005895,0.000022429764,0.0016076601,0.000057712077,0.0000022558304,0.0000063927955,0.0000011078525,0.94856983,0.0490894,0.000390858,0.0000030632111,0.00013826421],"about_ca_topic_score_codex":0.0001533111,"about_ca_topic_score_gemma":0.000033332704,"teacher_disagreement_score":0.37742195,"about_ca_system_score_codex":0.00014010155,"about_ca_system_score_gemma":0.000049139308,"threshold_uncertainty_score":0.54608834},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006790023,0.00072168617,0.9872973,0.000310399,0.0038651428,0.00046278207,0.000015566397,0.00009765693,0.00043943067],"genre_scores_gemma":[0.18024997,0.000016035148,0.816415,0.0013768788,0.0018127131,0.0000055210676,0.0000027739643,0.00004071622,0.000080398764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955283,0.00021681425,0.0006748351,0.0015949985,0.001234321,0.0007507697],"domain_scores_gemma":[0.99592674,0.0015397068,0.00045791446,0.0011992822,0.0006351905,0.00024119207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021187917,0.0005660983,0.00070847437,0.00043671776,0.00022805465,0.00029084686,0.0021936381,0.00019340437,0.000029203293],"category_scores_gemma":[0.00012496962,0.0005431456,0.00018246066,0.0009953014,0.0005875877,0.00069776794,0.0025680324,0.0004816529,0.0000091163365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008767569,0.00001743879,0.0001523542,0.00003763727,0.000009070707,0.000025824915,0.00069023535,0.8610909,0.00027589072,0.0006433367,0.00003233363,0.13701624],"study_design_scores_gemma":[0.00012654102,0.00007759626,0.00039650686,0.00032800584,0.0000149023035,0.000026260492,1.981116e-7,0.9642132,0.0028508173,0.03127472,0.0001769086,0.0005143233],"about_ca_topic_score_codex":0.00037914838,"about_ca_topic_score_gemma":0.0013606917,"teacher_disagreement_score":0.17345995,"about_ca_system_score_codex":0.00041330245,"about_ca_system_score_gemma":0.000747936,"threshold_uncertainty_score":0.99970204},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012273851,0.000040770545,0.9954412,0.0008857553,0.0014146019,0.00036151818,0.00003197396,0.00014712333,0.00044967464],"genre_scores_gemma":[0.35028306,0.000062950756,0.64284855,0.0031032967,0.0021281957,0.00006604767,0.00047231477,0.00005994127,0.0009756292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706066,0.000028621205,0.00060211116,0.00096068595,0.00088413164,0.00046378424],"domain_scores_gemma":[0.99773353,0.00030440872,0.00040638784,0.0009939036,0.00042855638,0.00013320196],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00071260624,0.0004297354,0.00041599674,0.001012242,0.0003264041,0.0011847666,0.0018912668,0.00029365328,0.00008912788],"category_scores_gemma":[0.00009675764,0.00037704236,0.00017400998,0.0003600237,0.00024234042,0.0025699898,0.0005792266,0.00033063488,0.00010374202],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015606747,0.000046441484,0.0000686471,0.00007985283,0.00003756909,0.0000027450922,0.0026103223,0.001628177,0.00072148134,0.0021311652,0.0010688041,0.9915892],"study_design_scores_gemma":[0.00038716593,0.00027173047,0.00011259306,0.00020998009,0.00003161158,0.000012240958,8.094054e-7,0.9461528,0.006166409,0.033965092,0.012127515,0.0005620742],"about_ca_topic_score_codex":0.00001449484,"about_ca_topic_score_gemma":0.000019770709,"teacher_disagreement_score":0.9910271,"about_ca_system_score_codex":0.00025920573,"about_ca_system_score_gemma":0.00031983788,"threshold_uncertainty_score":0.99986815},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028977616,0.00034851904,0.98979676,0.0004049954,0.0016868986,0.0002121864,0.00001149461,0.0002476937,0.0070016747],"genre_scores_gemma":[0.26797432,0.000095495874,0.7269877,0.00288368,0.0010224244,0.000008990358,0.0000106228645,0.00007799683,0.0009387562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643594,0.00003633558,0.0006092156,0.0013455129,0.0009687714,0.00060423947],"domain_scores_gemma":[0.99627733,0.0006650736,0.0004112371,0.0022612775,0.00023384647,0.00015122948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010143105,0.00047801138,0.00059954845,0.0007436376,0.00016332955,0.0002830048,0.0050671822,0.0003035718,0.00012961816],"category_scores_gemma":[0.000102020465,0.00041569507,0.00016263948,0.0006213486,0.0012020118,0.00062226376,0.0021311706,0.00046088183,0.00014782907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010027528,0.000086595406,0.00003372406,0.000111412635,0.000030271487,0.00012263845,0.0018422742,0.008180163,0.00041113858,0.10607394,0.0003040896,0.8827937],"study_design_scores_gemma":[0.00021975007,0.00019815729,0.00007489181,0.00036807498,0.0000061550386,0.00004278782,8.090417e-8,0.56257164,0.0038500219,0.42941874,0.0027473357,0.0005023303],"about_ca_topic_score_codex":0.000014036894,"about_ca_topic_score_gemma":0.000016160227,"teacher_disagreement_score":0.8822914,"about_ca_system_score_codex":0.000117028976,"about_ca_system_score_gemma":0.0003884898,"threshold_uncertainty_score":0.9998295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04240791,0.000056011067,0.95591944,0.0001734108,0.00043760065,0.00061815284,0.000019680003,0.000022823631,0.00034495784],"genre_scores_gemma":[0.9419952,0.000013453042,0.057353467,0.00027292868,0.00018742055,0.0000069998173,0.00005262215,0.000025338139,0.00009258349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99797046,0.000024983308,0.0006571124,0.0005821874,0.0005092245,0.00025603216],"domain_scores_gemma":[0.99553835,0.0031479793,0.00038144187,0.00046902554,0.00038703124,0.00007618463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086242746,0.00024979567,0.0005294854,0.0010714049,0.00004755344,0.00004767513,0.00020353812,0.00016190461,0.000007674962],"category_scores_gemma":[0.001688969,0.0002389271,0.00014515623,0.000483011,0.0003831247,0.00013142826,0.000026792217,0.00024309666,0.000001309582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019832746,0.00009885653,0.018538965,0.00054352253,0.00002093086,0.000001949806,0.0008009332,0.7814436,0.16829407,0.00031292724,0.0000574328,0.029688504],"study_design_scores_gemma":[0.006589023,0.006795574,0.10792179,0.012694933,0.00057286245,0.0003296125,0.000009009139,0.17227799,0.5739021,0.10531421,0.009860386,0.0037325108],"about_ca_topic_score_codex":0.000033073626,"about_ca_topic_score_gemma":0.000013184753,"teacher_disagreement_score":0.8995873,"about_ca_system_score_codex":0.00007549408,"about_ca_system_score_gemma":0.00017408979,"threshold_uncertainty_score":0.9743164},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010451536,0.00064061844,0.934202,0.00007826017,0.001937105,0.0003386889,0.000016859629,0.00006222471,0.061679076],"genre_scores_gemma":[0.842311,0.0000049803584,0.15305804,0.0006544769,0.00048983167,0.000010813912,0.0000011894637,0.00004188098,0.0034277788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9892612,0.00012330542,0.0015874875,0.0024165623,0.0058156564,0.00079575955],"domain_scores_gemma":[0.9907214,0.005722808,0.00097572815,0.0017660044,0.00055382424,0.00026023804],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0043918206,0.0006236523,0.0010351088,0.0009298215,0.0006688491,0.0015706392,0.0037812756,0.0002832614,0.00034034767],"category_scores_gemma":[0.0020021813,0.00047278946,0.00028733554,0.00084381195,0.0011463921,0.000732734,0.0021063196,0.0006808358,0.0002903706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046953097,0.00002601685,0.000280971,0.000012211286,0.000011199465,0.00009094359,0.0061761555,0.13800028,0.0002447093,0.39391994,0.00025061518,0.46094],"study_design_scores_gemma":[0.00016458928,0.00012252938,0.000072950315,0.00028069416,0.0000030385731,0.000046416924,0.000022237835,0.59280664,0.00006392075,0.4033405,0.0026379528,0.00043857514],"about_ca_topic_score_codex":0.00010587382,"about_ca_topic_score_gemma":0.00025792475,"teacher_disagreement_score":0.84126586,"about_ca_system_score_codex":0.0006603897,"about_ca_system_score_gemma":0.00030019594,"threshold_uncertainty_score":0.99977237},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020901074,0.00020221493,0.98474187,0.005710883,0.003517816,0.0005063187,0.000002786279,0.00026917885,0.004839933],"genre_scores_gemma":[0.42364603,0.000052473362,0.53310835,0.039681397,0.001419319,0.000037852646,0.000007410932,0.00006247387,0.0019846684],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959802,0.000079502795,0.0004402141,0.0015813414,0.0011109317,0.0008077784],"domain_scores_gemma":[0.9966121,0.0008523726,0.00024185139,0.0019111022,0.00019319358,0.00018941605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012572649,0.0006000102,0.000533708,0.00073319883,0.00049610366,0.00096709636,0.005083383,0.00036000804,0.000018369958],"category_scores_gemma":[0.0004494352,0.00039473185,0.00017259677,0.00062107225,0.0005119246,0.00035102305,0.0016074947,0.0009394977,0.0002752458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000164977,0.000022021028,0.00003596298,0.000031789354,0.000014001928,0.00007769742,0.0014079368,0.054085523,0.00011869778,0.39066178,0.0026994322,0.5508287],"study_design_scores_gemma":[0.0004423106,0.0009204624,0.0012886021,0.0010386341,0.000023785578,0.00018012033,0.000001845235,0.33553362,0.001008114,0.636548,0.021429839,0.0015846738],"about_ca_topic_score_codex":0.000051497733,"about_ca_topic_score_gemma":0.0005183342,"teacher_disagreement_score":0.549244,"about_ca_system_score_codex":0.00028097312,"about_ca_system_score_gemma":0.0002242877,"threshold_uncertainty_score":0.99985045},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08717702,0.00031598695,0.9100874,0.00005798805,0.0005344852,0.00027582268,0.000035326684,0.0000052337236,0.001510749],"genre_scores_gemma":[0.99124146,0.000050735674,0.0079584755,0.00031750725,0.00033905142,0.0000051202405,0.000014758854,0.000017081926,0.000055840082],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998755,0.000018716428,0.00021972739,0.00058898004,0.00021103784,0.00020654271],"domain_scores_gemma":[0.9991004,0.000028880939,0.00013637144,0.0005198311,0.00015661768,0.000057913432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022488137,0.0002219024,0.00018251356,0.0001398841,0.000099803736,0.000033642144,0.0003720548,0.0001837681,0.000016034788],"category_scores_gemma":[0.00002114418,0.00020317755,0.00006635011,0.00007145957,0.00037966884,0.0000013346153,0.00013747436,0.00011247626,0.0000049346254],"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.00007126276,0.00008616104,0.000081134356,0.000032070566,0.00003467553,0.0000043620585,0.00011227245,0.15507905,0.6870518,0.00018057477,0.000018266373,0.15724838],"study_design_scores_gemma":[0.0006409959,0.0053588375,0.0018381514,0.00017293224,0.000037239184,0.000012757951,0.0000012700157,0.103478126,0.8684931,0.014042407,0.0050215973,0.00090258586],"about_ca_topic_score_codex":0.000010340327,"about_ca_topic_score_gemma":0.00014598033,"teacher_disagreement_score":0.9040644,"about_ca_system_score_codex":0.000033583518,"about_ca_system_score_gemma":0.0001535637,"threshold_uncertainty_score":0.828534},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014081842,0.00010153628,0.9926763,0.00029617554,0.0010324476,0.0004938784,0.0000039298393,0.00040960318,0.0048452825],"genre_scores_gemma":[0.63337386,0.000062730825,0.36344174,0.0021429083,0.0003403476,0.000020196032,0.0000035701455,0.000060838214,0.00055384473],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958569,0.000071072645,0.0005894624,0.0018304691,0.0009915326,0.00066058367],"domain_scores_gemma":[0.9972062,0.00070243474,0.00031717937,0.0014587747,0.00014102228,0.00017439932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013197849,0.00054407894,0.0005479826,0.0013435557,0.0002768569,0.00036830467,0.0024826294,0.00040062936,0.000056253055],"category_scores_gemma":[0.00023669454,0.0005060544,0.00010858441,0.0007932368,0.000812859,0.00075266336,0.001106321,0.001030955,0.00004109586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006243416,0.0001030308,0.000044852306,0.00008331191,0.000010001109,0.0003473572,0.0025536215,0.0067413133,0.00072067004,0.17803073,0.00015333817,0.81114936],"study_design_scores_gemma":[0.00037107055,0.00051422376,0.000042346353,0.0009872089,0.0000022624563,0.00006726184,9.138187e-7,0.096679196,0.0060911505,0.893071,0.0013918079,0.00078155525],"about_ca_topic_score_codex":0.000016040745,"about_ca_topic_score_gemma":0.0001288814,"teacher_disagreement_score":0.81036776,"about_ca_system_score_codex":0.0014886592,"about_ca_system_score_gemma":0.00029821592,"threshold_uncertainty_score":0.9997391},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006219619,0.0003448955,0.9917933,0.00015268536,0.0005420431,0.00023282836,0.000041696087,0.0000516387,0.00621895],"genre_scores_gemma":[0.5920076,0.000031147527,0.4068395,0.0005395693,0.00017102975,0.000008029491,0.00003976345,0.000025408845,0.00033797955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968593,0.000032053078,0.0006120989,0.0010501861,0.0010211222,0.00042520787],"domain_scores_gemma":[0.99732125,0.00025417216,0.00037731745,0.0014199842,0.00046800185,0.00015929143],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011157207,0.00033895916,0.00066232675,0.0026299472,0.0001208572,0.00027210143,0.002519429,0.00017741107,0.0002452058],"category_scores_gemma":[0.000040415638,0.00031569356,0.00025412248,0.0026662322,0.00055368646,0.0005059721,0.0009921392,0.00041228582,0.00000787465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011670986,0.00014043743,0.0011011553,0.000099366094,0.0006279093,0.00008769651,0.006642007,0.03775309,0.00029047503,0.23391101,0.0003136443,0.71902156],"study_design_scores_gemma":[0.0005068194,0.0002866458,0.0023223993,0.00011497171,0.00023961687,0.000019959094,9.1252605e-7,0.7076292,0.0007473086,0.27991748,0.007267752,0.00094691786],"about_ca_topic_score_codex":0.0000326489,"about_ca_topic_score_gemma":0.00079128373,"teacher_disagreement_score":0.7180746,"about_ca_system_score_codex":0.00012953229,"about_ca_system_score_gemma":0.0005060738,"threshold_uncertainty_score":0.9999295},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007190016,0.00038767693,0.99599206,0.001058491,0.0007249128,0.00065291225,0.0000062760796,0.00004570712,0.000412943],"genre_scores_gemma":[0.8962125,0.00002170565,0.103044145,0.00023213342,0.00024440716,0.0000118162225,9.2128823e-7,0.000021965021,0.00021039385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689853,0.00005332722,0.0007197751,0.0010155885,0.0007281087,0.000584685],"domain_scores_gemma":[0.9937613,0.004065745,0.00026447687,0.0014379849,0.000387867,0.00008263818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001490282,0.00034133825,0.0004929889,0.00086878566,0.00017903063,0.00029170784,0.0040841955,0.00021810996,0.000009627261],"category_scores_gemma":[0.0002951268,0.0002629694,0.00017414434,0.0008865024,0.00091777457,0.0003205741,0.0009152982,0.0006003519,0.00001108849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003885857,0.000010029445,0.00029264658,0.000015077412,0.00000585781,0.0000025477582,0.0010550515,0.5718605,0.00010227784,0.015648669,0.000004343398,0.4109991],"study_design_scores_gemma":[0.00007779664,0.00010333266,0.00028787256,0.00019980209,0.0000065304766,0.000003527186,6.332714e-7,0.942471,0.002919059,0.053220462,0.0004451452,0.00026483918],"about_ca_topic_score_codex":0.00012236804,"about_ca_topic_score_gemma":0.0011756959,"teacher_disagreement_score":0.8954935,"about_ca_system_score_codex":0.00019366131,"about_ca_system_score_gemma":0.0003630308,"threshold_uncertainty_score":0.99998224},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09437327,0.000037978527,0.8991277,0.0058188825,0.00006166447,0.00045608144,7.6219874e-7,0.000104934305,0.000018675813],"genre_scores_gemma":[0.5100816,0.0000012657164,0.48711547,0.0026745978,0.00007110135,0.000045177803,6.717805e-7,0.0000051354723,0.0000049949595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991765,0.000004243652,0.000112626425,0.00032749656,0.00013733369,0.0002417688],"domain_scores_gemma":[0.9992909,0.00020440161,0.000025703015,0.00032313573,0.00009017331,0.0000657303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011287935,0.00007995715,0.00011820097,0.00014610958,0.00009818586,0.00005217107,0.00017940969,0.000032528347,0.00003037097],"category_scores_gemma":[0.00014005891,0.00006503671,0.000033029373,0.00060608616,0.00016491298,0.00013952873,0.00009389237,0.00014365923,0.000017709637],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006123042,0.00008126574,0.012356667,0.00004908702,0.0000024914805,0.0000024671933,0.00017175252,0.0049438747,0.039153248,0.00027165233,0.00072008,0.9422413],"study_design_scores_gemma":[0.0006365486,0.0003735217,0.060301732,0.00020583584,0.000010523352,0.00014108712,0.0000012488614,0.6706234,0.15416464,0.10264385,0.010502302,0.0003952542],"about_ca_topic_score_codex":0.000016601132,"about_ca_topic_score_gemma":5.680039e-7,"teacher_disagreement_score":0.941846,"about_ca_system_score_codex":0.000036992424,"about_ca_system_score_gemma":0.000044682136,"threshold_uncertainty_score":0.265212},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006301884,0.00018243698,0.9909279,0.000098974575,0.0005777963,0.00008546096,0.000024741703,0.00021313327,0.007259416],"genre_scores_gemma":[0.9553722,0.00010230953,0.042237736,0.0011462747,0.00055973226,0.0000057875036,0.00012353771,0.00005965926,0.00039275258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797124,0.00001553901,0.00037805774,0.00074717746,0.0005069512,0.00038101658],"domain_scores_gemma":[0.99876845,0.00026489332,0.000092472,0.00062584603,0.00010519289,0.00014311999],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022896614,0.0004176033,0.00068005075,0.001368944,0.000087596956,0.0002184306,0.0007175272,0.0002525029,0.0006959458],"category_scores_gemma":[0.00004025561,0.00039709784,0.00035021672,0.00096238125,0.00022042728,0.00009166503,0.0001265281,0.00051487796,0.00020583907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002636561,0.000005829936,0.00039409456,0.000023780414,0.00030231482,0.000022386172,0.00012802545,0.73762745,0.00018694188,0.00010304238,0.00011534062,0.26108816],"study_design_scores_gemma":[0.00017620408,0.000027463691,0.0012058717,0.00012559525,0.0004257381,0.0000033460112,1.4395924e-7,0.98184973,0.00043732463,0.009745341,0.0053061075,0.0006971438],"about_ca_topic_score_codex":0.00014471056,"about_ca_topic_score_gemma":0.0014620516,"teacher_disagreement_score":0.954742,"about_ca_system_score_codex":0.00016351047,"about_ca_system_score_gemma":0.00004539806,"threshold_uncertainty_score":0.99984807},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010160764,0.00014814605,0.95708555,0.002356114,0.00063320284,0.0004808441,0.0000032110759,0.00008790887,0.039194867],"genre_scores_gemma":[0.1790361,0.00018220079,0.81094325,0.007212066,0.00027168746,0.000025519825,0.000006577482,0.00004577017,0.0022768262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718267,0.00006156727,0.0003904187,0.0007384949,0.0011221309,0.0005047363],"domain_scores_gemma":[0.99749875,0.00048385526,0.00022667632,0.0014708448,0.0001973566,0.00012250118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011928885,0.00031828505,0.00031557123,0.00045800072,0.00021355163,0.00020702345,0.0035154733,0.00012860261,0.00013802154],"category_scores_gemma":[0.000036176065,0.0002176978,0.00009908868,0.00052971445,0.0010300671,0.00029425055,0.0014784092,0.00054568995,0.00008602987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034055145,0.000039177186,0.0000069489615,0.000036870566,0.00001146917,0.000006502152,0.00039829413,0.019156134,0.000007346225,0.8184142,0.00012726148,0.1617924],"study_design_scores_gemma":[0.0002162221,0.00013506353,0.000161364,0.00031562283,0.000006645229,0.000009935977,2.3328926e-7,0.49899614,0.00031885502,0.4959143,0.0035266252,0.00039898523],"about_ca_topic_score_codex":0.000012249527,"about_ca_topic_score_gemma":0.0000145348795,"teacher_disagreement_score":0.47984,"about_ca_system_score_codex":0.00012369311,"about_ca_system_score_gemma":0.00011320282,"threshold_uncertainty_score":0.88774586},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012803213,0.00021259412,0.99470836,0.000030525105,0.00062875496,0.00028609807,0.000030065423,0.00038844402,0.0024348507],"genre_scores_gemma":[0.8427412,0.00022962035,0.15546528,0.00031743106,0.00047672135,0.000016153954,0.00016185475,0.000102409635,0.00048932206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987553,0.0000033758713,0.00033908317,0.00032509683,0.00028646865,0.00029072748],"domain_scores_gemma":[0.9988626,0.000040469942,0.00007503698,0.0009114848,0.000054267795,0.00005608867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014088015,0.0002868353,0.00026257776,0.00032510434,0.00011780111,0.0002333315,0.001017422,0.00027018553,0.000044073775],"category_scores_gemma":[0.000024005341,0.00025667596,0.000021066633,0.00010422909,0.000556521,0.00035409702,0.0007677989,0.00043719768,0.000033391796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.1632315e-7,0.0000052267446,0.00018826786,0.00010841553,0.0000089520045,0.000015648844,0.0003753455,0.024871401,0.000088504334,0.0010406733,0.00012356185,0.9731735],"study_design_scores_gemma":[0.0002353636,0.00005400605,0.0004319129,0.0002573322,0.000023368331,0.00003867789,0.000001276265,0.9853801,0.0018081322,0.00806969,0.0029904684,0.00070967665],"about_ca_topic_score_codex":0.000032839645,"about_ca_topic_score_gemma":0.00011925707,"teacher_disagreement_score":0.9724638,"about_ca_system_score_codex":0.00006665455,"about_ca_system_score_gemma":0.000028254555,"threshold_uncertainty_score":0.99998856},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005744546,0.00005244378,0.99046683,0.00002333958,0.00024508094,0.0003085784,0.0000017328625,0.00033551775,0.0028219346],"genre_scores_gemma":[0.96935475,0.0000052952987,0.03039103,0.000036289868,0.0001252988,0.0000032225591,0.00001529958,0.000023501765,0.000045320114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895614,0.000011278989,0.00028613713,0.00029987557,0.00024003926,0.00020653407],"domain_scores_gemma":[0.9995584,0.000094818155,0.00011652775,0.00014959833,0.000047910515,0.000032760316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037988348,0.00019817447,0.00024201625,0.00033398953,0.000050030547,0.00005137903,0.00018393937,0.00013149888,0.000014926274],"category_scores_gemma":[0.000012124949,0.00019068191,0.000019832187,0.00017510228,0.0001993127,0.00018541995,0.00008922592,0.0002603564,0.000003130809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015796892,0.000011480709,0.0011204873,0.00009008898,0.000011070434,0.000011657302,0.0007248301,0.6130125,0.00008009764,0.00036401735,0.00009603434,0.38446197],"study_design_scores_gemma":[0.00020129335,0.000143112,0.0025758478,0.00044406846,0.0000069814887,0.000008013062,1.944895e-7,0.99408954,0.00008554597,0.0022488753,0.000017603455,0.0001789279],"about_ca_topic_score_codex":0.000023150043,"about_ca_topic_score_gemma":0.00008092035,"teacher_disagreement_score":0.9636102,"about_ca_system_score_codex":0.00007197142,"about_ca_system_score_gemma":0.000020332618,"threshold_uncertainty_score":0.77757823},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009767216,0.000111125795,0.98763555,0.0004216786,0.001268662,0.00050042593,0.0000024020947,0.00015522754,0.00013770103],"genre_scores_gemma":[0.43243712,0.000030503412,0.5663375,0.00066465384,0.0004252471,0.000009128634,0.000004483421,0.000020821106,0.000070514776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969895,0.000051182615,0.00049341604,0.0012933245,0.0005985895,0.000574021],"domain_scores_gemma":[0.99831605,0.0003720559,0.0003198557,0.00064739585,0.00018281235,0.00016184174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095133355,0.00044601527,0.0003791995,0.0005639686,0.00034351222,0.0005437047,0.0013423016,0.00017639098,0.000025011663],"category_scores_gemma":[0.00003344968,0.0004101285,0.00004557106,0.00041263291,0.00044450266,0.00082989095,0.0009912128,0.00036559274,0.00005169995],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012497398,0.000016160819,0.000039422408,0.000032826047,0.000012198064,0.000020466146,0.0019788921,0.012635934,0.00044489084,0.0073999637,0.000034537865,0.9773722],"study_design_scores_gemma":[0.00055419747,0.000390693,0.0012381705,0.00022756084,0.000009476788,0.00005573463,2.6739139e-7,0.8586777,0.004342746,0.13359858,0.00029481627,0.0006100948],"about_ca_topic_score_codex":0.00006313676,"about_ca_topic_score_gemma":0.000026856342,"teacher_disagreement_score":0.9767621,"about_ca_system_score_codex":0.00017668886,"about_ca_system_score_gemma":0.00038771375,"threshold_uncertainty_score":0.9998351},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000071044786,0.00022678547,0.9934193,0.0005372215,0.0025830045,0.001333212,0.000020743197,0.00024471132,0.0015639635],"genre_scores_gemma":[0.012321746,0.000028314753,0.9856976,0.00069263263,0.0006464975,0.00006673867,0.000008337794,0.000045827124,0.0004922902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99517703,0.000076680524,0.0007522006,0.0020731855,0.0010315547,0.0008893659],"domain_scores_gemma":[0.9954052,0.0010125027,0.00051351846,0.00221415,0.00065143214,0.00020320194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030420285,0.00058896927,0.0006701399,0.0006245223,0.00052623154,0.00058595,0.0045273225,0.0004183635,0.000025078205],"category_scores_gemma":[0.0011392862,0.00057820487,0.00016501942,0.0008114834,0.00115999,0.00075260614,0.0012608916,0.0006445856,0.000026250416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046591584,0.000098833174,0.000032727196,0.00030107843,0.000024912883,0.000012843544,0.0012953577,0.003443873,0.00037093807,0.3700059,0.000081182174,0.62428576],"study_design_scores_gemma":[0.00028730682,0.00024302707,0.00007116946,0.000432209,0.00001191359,0.000015110446,1.08333914e-7,0.6711545,0.0019889423,0.3228113,0.0023567083,0.0006276786],"about_ca_topic_score_codex":0.0000060070556,"about_ca_topic_score_gemma":0.00007825182,"teacher_disagreement_score":0.66771066,"about_ca_system_score_codex":0.00064403587,"about_ca_system_score_gemma":0.00061827706,"threshold_uncertainty_score":0.9996669},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022501764,0.00019289626,0.9962814,0.00033470895,0.00020706833,0.00046644444,0.000012837777,0.000024507768,0.0002299971],"genre_scores_gemma":[0.8413385,0.000013622132,0.15690891,0.00040907614,0.00025828657,0.0001534116,0.000016141606,0.000040014515,0.0008620093],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987287,0.000025406676,0.00037405972,0.0005418143,0.00014121538,0.00018883575],"domain_scores_gemma":[0.99836445,0.0008188514,0.0002278544,0.00024911025,0.0003030303,0.000036710928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005164,0.00015988754,0.00024116285,0.0003316427,0.000083827465,0.000046418267,0.00032012298,0.00017329652,0.000063215986],"category_scores_gemma":[0.00030322582,0.00014838218,0.00003188759,0.00020473717,0.00060093554,0.00008450662,0.00007279219,0.00017705365,0.000021317835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008803897,0.00016734906,0.0010854276,0.00047315372,0.000031980762,0.0000035383564,0.015323644,0.0013851259,0.0007054078,0.05756745,0.00006284347,0.923106],"study_design_scores_gemma":[0.00034279845,0.0002535205,0.010658467,0.00039579457,0.000024324692,0.000025103172,0.000005067999,0.005948488,0.00093493337,0.98101574,0.00009845094,0.00029729103],"about_ca_topic_score_codex":0.0000024315507,"about_ca_topic_score_gemma":0.000008641582,"teacher_disagreement_score":0.9234483,"about_ca_system_score_codex":0.000029111106,"about_ca_system_score_gemma":0.00009910228,"threshold_uncertainty_score":0.60508496},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01086107,0.0001998521,0.9845168,0.00003460266,0.0029558188,0.00029976986,0.000002691284,0.0002975862,0.0008318125],"genre_scores_gemma":[0.91705,0.000016946087,0.07811216,0.00068041816,0.003928522,0.000005287615,0.000025404635,0.00009767601,0.00008356355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800783,0.000025579739,0.00034379537,0.0006281178,0.00038103934,0.0006136058],"domain_scores_gemma":[0.999093,0.00021049565,0.00014812722,0.00035333127,0.000090111556,0.000104959996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004012461,0.0003850752,0.0003637421,0.00019524524,0.00026688786,0.00014280657,0.00056585006,0.00015843511,0.00006443147],"category_scores_gemma":[0.00002021729,0.00039048144,0.000067144196,0.0002737417,0.00019942492,0.00044820603,0.00020937684,0.00061254203,0.000014603029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018979474,0.0000017542878,0.000030416826,0.000013933739,0.000006495758,0.00001569966,0.00050299946,0.7974963,0.00020854043,0.00008529194,0.000012870196,0.20162377],"study_design_scores_gemma":[0.00019766508,0.00018398261,0.0002444702,0.00020075012,0.000016606495,0.000021598926,0.0000016122973,0.96348524,0.0032956717,0.03161908,0.00012023048,0.00061311724],"about_ca_topic_score_codex":0.0000032444336,"about_ca_topic_score_gemma":0.00011732455,"teacher_disagreement_score":0.9064046,"about_ca_system_score_codex":0.00031880513,"about_ca_system_score_gemma":0.00005089329,"threshold_uncertainty_score":0.9998547},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023103462,0.0002501895,0.9948683,0.003030173,0.00033753322,0.00096251373,0.000010200957,0.00003326437,0.00027678502],"genre_scores_gemma":[0.0930645,0.000054294556,0.90602154,0.00046788843,0.0002416604,0.00008113593,0.000005485349,0.000022850769,0.00004064334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701774,0.000104248815,0.0006853103,0.0009812374,0.0007917399,0.00041970244],"domain_scores_gemma":[0.9938748,0.0037786514,0.0007642952,0.0012476826,0.00027679058,0.00005781746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013525266,0.00031535872,0.0004110919,0.00049890135,0.00021354263,0.00009836226,0.0029519713,0.00017474672,0.0000046129308],"category_scores_gemma":[0.00037845908,0.00023878465,0.00010074943,0.00088057586,0.0009262931,0.00048407566,0.00049024005,0.00032254003,0.000002385525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060584494,0.00009708186,0.00007465464,0.0001841756,0.000009941959,0.000006878476,0.0037648238,0.134193,0.012065426,0.013998099,0.0005268569,0.83501846],"study_design_scores_gemma":[0.00022472508,0.00024217373,0.00029832713,0.0013666069,0.000011837986,0.00002528948,0.0000022979812,0.8263624,0.01877134,0.15185305,0.00047596561,0.0003660082],"about_ca_topic_score_codex":0.00001242497,"about_ca_topic_score_gemma":0.00005845069,"teacher_disagreement_score":0.8346525,"about_ca_system_score_codex":0.00014048806,"about_ca_system_score_gemma":0.00022870184,"threshold_uncertainty_score":0.9737356},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011743524,0.00019646274,0.9913235,0.0011474827,0.0022921478,0.0018911253,0.000019814963,0.00025583257,0.0016993067],"genre_scores_gemma":[0.18361092,0.000022745866,0.8141662,0.0011726085,0.0004841401,0.00007027455,0.000014383426,0.00007892854,0.00037984332],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99366504,0.00016700184,0.0011248713,0.0026020093,0.0013073613,0.0011337021],"domain_scores_gemma":[0.99509245,0.0014135417,0.00056358625,0.0016983408,0.0009154334,0.00031664036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026408588,0.0009521879,0.0010357173,0.0008527584,0.0006352051,0.0006738706,0.0046155774,0.00046962357,0.00002468248],"category_scores_gemma":[0.00021606807,0.0008764463,0.00034922612,0.00071700086,0.002141369,0.00086123566,0.0014216835,0.0007615869,0.00004185497],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037687372,0.00014859256,0.000020634878,0.00024411848,0.000062437226,0.00008485861,0.12982133,0.010906774,0.0001094662,0.06741933,0.00003469867,0.79111004],"study_design_scores_gemma":[0.000570874,0.00076730986,0.000021320324,0.0004247401,0.000018916446,0.00006512381,0.00001270828,0.45115584,0.0014869092,0.54033905,0.0041516772,0.0009855531],"about_ca_topic_score_codex":0.000047255675,"about_ca_topic_score_gemma":0.00040369545,"teacher_disagreement_score":0.79012454,"about_ca_system_score_codex":0.0007620225,"about_ca_system_score_gemma":0.00094266917,"threshold_uncertainty_score":0.9993686},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000073381954,0.00059155206,0.9925764,0.0024956388,0.0021944006,0.00046497278,0.00001280531,0.00024298378,0.0013478347],"genre_scores_gemma":[0.029244315,0.00018718299,0.96702677,0.0011917583,0.001758444,0.000010016512,0.000047375324,0.0000612966,0.00047286227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586976,0.00007384974,0.00064974657,0.002299777,0.0005665322,0.0005403447],"domain_scores_gemma":[0.9961233,0.0002879104,0.00042126895,0.0027835795,0.00020887531,0.00017502718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016013938,0.00051312614,0.0005933423,0.00070601946,0.0003434758,0.0006633128,0.0038479618,0.00024459627,0.000025966658],"category_scores_gemma":[0.000120564575,0.00046223053,0.000057453653,0.000435356,0.0003997127,0.0013783337,0.0042057266,0.00058559823,0.000009400836],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031850589,0.000034619392,0.000117418276,0.000045561774,0.000011649688,0.000015423882,0.00036236682,0.0000318625,0.00007522425,0.0014271522,0.0013895198,0.996486],"study_design_scores_gemma":[0.00039646582,0.0005055487,0.00010845676,0.00087780895,0.00003137955,0.0006603632,5.0353725e-7,0.71796477,0.0014937635,0.08434491,0.19188632,0.0017296927],"about_ca_topic_score_codex":0.00026903444,"about_ca_topic_score_gemma":0.00011542046,"teacher_disagreement_score":0.99475634,"about_ca_system_score_codex":0.0007069555,"about_ca_system_score_gemma":0.00033382213,"threshold_uncertainty_score":0.9997829},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060736755,0.0006073043,0.98923415,0.0010835445,0.0026111705,0.00034135883,0.0000044577364,0.00041824568,0.005639036],"genre_scores_gemma":[0.027048938,0.000117282514,0.9659191,0.0042265463,0.0009319911,0.000008103726,0.000007708917,0.000075456664,0.0016648956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99459964,0.000044109725,0.00069948414,0.002290932,0.0012958527,0.001070005],"domain_scores_gemma":[0.9962158,0.00036435705,0.000401229,0.0021619557,0.00053048757,0.00032615472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087167684,0.00077282754,0.00069808064,0.0010891275,0.00042572827,0.0007914287,0.004857325,0.0003182371,0.00012645024],"category_scores_gemma":[0.00017409904,0.00069568085,0.00018228733,0.001178506,0.0012586599,0.0012246658,0.002282208,0.0009766375,0.00042221713],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005993345,0.000032063846,0.00003467941,0.000024530185,0.000010489208,0.00010463183,0.0006797721,0.0015765488,0.00041030569,0.0031327445,0.00019306362,0.99379516],"study_design_scores_gemma":[0.00044324275,0.00021707866,0.00015378746,0.0006097883,0.000008911725,0.000113971095,3.2553442e-7,0.7285951,0.0066833333,0.24959527,0.012362642,0.001216536],"about_ca_topic_score_codex":0.000011003529,"about_ca_topic_score_gemma":0.000017327098,"teacher_disagreement_score":0.9925786,"about_ca_system_score_codex":0.00034089337,"about_ca_system_score_gemma":0.0005982193,"threshold_uncertainty_score":0.99954945},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033201627,0.00007894987,0.99295765,0.00022108993,0.0019400191,0.00040429813,0.0000065721483,0.0001142075,0.0009570771],"genre_scores_gemma":[0.77202505,0.000029466579,0.22695768,0.00049032306,0.0003957867,0.000027576656,0.000005389358,0.00004213941,0.000026620015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963057,0.000058988524,0.00060654414,0.0013373859,0.0010500123,0.00064138183],"domain_scores_gemma":[0.99719477,0.00045465512,0.00049445627,0.0014471816,0.00024619667,0.00016273471],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006257678,0.00056507904,0.0006859446,0.00063177355,0.00020770407,0.00047116636,0.0025769586,0.00016513203,0.000017691738],"category_scores_gemma":[0.000024440127,0.0004010215,0.000110737645,0.00040780185,0.0004197717,0.00063105364,0.00074079767,0.0005245265,0.0000070918186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056846486,0.00021296284,0.004800115,0.0008727844,0.00011550542,0.00021475845,0.0061932327,0.18377689,0.00015014743,0.009243542,0.000070108435,0.7942931],"study_design_scores_gemma":[0.0005066416,0.00078659464,0.0006494601,0.0021553773,0.000014714598,0.000029735045,0.0000027041822,0.9896543,0.0010992889,0.004015267,0.00020267718,0.0008832477],"about_ca_topic_score_codex":0.00005447175,"about_ca_topic_score_gemma":0.00006832982,"teacher_disagreement_score":0.8058774,"about_ca_system_score_codex":0.00021913399,"about_ca_system_score_gemma":0.0002388177,"threshold_uncertainty_score":0.9998442},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042182887,0.000134957,0.99167037,0.0005180981,0.0013845204,0.0013102063,0.0000056760255,0.000048816903,0.0007090739],"genre_scores_gemma":[0.5986471,0.00021174515,0.38318118,0.0072702477,0.00436558,0.00011619972,0.00020477927,0.000121644625,0.0058815125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819416,0.000012507796,0.00035289745,0.0006690298,0.0004486628,0.0003227199],"domain_scores_gemma":[0.9991704,0.00015238741,0.0001453381,0.00028096326,0.00016430413,0.00008659272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043497325,0.0002441728,0.0003064627,0.00052886846,0.000116903735,0.00006282391,0.00021438386,0.00020761741,0.00022720521],"category_scores_gemma":[0.000041156047,0.00022492566,0.00008590687,0.00019093792,0.00027926432,0.00007513474,0.00015167324,0.00030162418,0.000020666428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034439607,0.000070645845,0.00009484238,0.00014227233,0.000023983162,0.000085636464,0.00042984184,0.012437218,0.000508178,0.00074337923,0.00035326253,0.98476636],"study_design_scores_gemma":[0.0015362387,0.0009837667,0.0011854827,0.00063934294,0.000037332185,0.00015232169,0.0000017300514,0.97669214,0.0005368902,0.0085588135,0.009283135,0.000392812],"about_ca_topic_score_codex":0.000012364871,"about_ca_topic_score_gemma":0.00021464337,"teacher_disagreement_score":0.9843735,"about_ca_system_score_codex":0.0005137927,"about_ca_system_score_gemma":0.00020851444,"threshold_uncertainty_score":0.9172203},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009584557,0.0008806548,0.9936116,0.00021494989,0.0019700646,0.00036517347,0.00004645991,0.0002747443,0.0016779508],"genre_scores_gemma":[0.15606207,0.00012172646,0.8384437,0.0019436104,0.0011283506,0.000014061997,0.00011616134,0.00012678132,0.0020435653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99422383,0.00005045912,0.0005838935,0.0029822737,0.0012029042,0.00095664005],"domain_scores_gemma":[0.9953562,0.00021293627,0.00040061807,0.003561008,0.0002129156,0.00025630067],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012288386,0.00073125935,0.0006011011,0.0008754991,0.0006340424,0.0009427643,0.009211449,0.00037481062,0.00009588838],"category_scores_gemma":[0.000035441393,0.00064073736,0.00014099943,0.0009676128,0.001802138,0.0016644823,0.007035418,0.000743476,0.00011205362],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000878873,0.00004173576,0.00010462003,0.000061076986,0.000013680072,0.000085981,0.0007938034,0.0004218,0.00014268453,0.0017546059,0.0000459155,0.9965253],"study_design_scores_gemma":[0.00029952353,0.00015903347,0.00016542802,0.00058080733,0.00001619474,0.00014485251,2.2669498e-7,0.69113207,0.0005398802,0.3039448,0.0020576308,0.0009595749],"about_ca_topic_score_codex":0.000012490877,"about_ca_topic_score_gemma":0.00024101032,"teacher_disagreement_score":0.9955657,"about_ca_system_score_codex":0.00025789702,"about_ca_system_score_gemma":0.00035303255,"threshold_uncertainty_score":0.9996044},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013343199,0.000027503182,0.9965969,0.000057439578,0.00018663183,0.00044908485,0.0000016753409,0.00005072744,0.0012957605],"genre_scores_gemma":[0.84812665,0.0000017766673,0.15076204,0.00020589207,0.0007997478,0.00005480453,0.000009581524,0.000023228076,0.000016295748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981114,0.00018271308,0.00047032075,0.0006122347,0.00022920838,0.00039407908],"domain_scores_gemma":[0.99876356,0.00026437125,0.00020583824,0.00060850027,0.00010043082,0.000057288413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001540859,0.00031227287,0.00047388131,0.00074419257,0.00028042472,0.00011714189,0.0009542462,0.00017476904,0.000027301503],"category_scores_gemma":[0.000007939007,0.0003400571,0.00010641357,0.0011158813,0.0002812152,0.00014070816,0.00061933167,0.0011459751,0.0000038322532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001123699,0.0000305973,0.00056442356,0.0000067167657,0.0000053094027,5.1905715e-7,0.0006961873,0.13256401,0.00020035914,0.0006009875,0.000007020316,0.86531264],"study_design_scores_gemma":[0.0001365419,0.000061671075,0.0019993526,0.00015079364,0.000007118476,7.4536825e-7,0.0000011113237,0.7661493,0.0006262081,0.22983299,0.0006359934,0.0003982164],"about_ca_topic_score_codex":0.0006527517,"about_ca_topic_score_gemma":0.0043618535,"teacher_disagreement_score":0.8649144,"about_ca_system_score_codex":0.00024808,"about_ca_system_score_gemma":0.000050306866,"threshold_uncertainty_score":0.99990517},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009257344,0.000112495676,0.9943295,0.00021493835,0.0013814962,0.00041147368,0.000021008704,0.0003756803,0.0022276454],"genre_scores_gemma":[0.23597847,0.000019312725,0.76272285,0.00090895727,0.00026789843,0.00000558793,0.0000142539375,0.00003639632,0.00004625283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529445,0.00005858841,0.0008281169,0.0015886519,0.001627573,0.00060264085],"domain_scores_gemma":[0.995514,0.0017006334,0.00058104296,0.0016470698,0.00038992678,0.00016735734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013929005,0.00058044994,0.0006935648,0.000969565,0.00030675204,0.000353308,0.0040631522,0.00031073755,0.000059245238],"category_scores_gemma":[0.00012888956,0.0005146978,0.00017849273,0.00071379374,0.001350337,0.00056585943,0.0017781814,0.00061971194,0.00010227354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028458197,0.000292614,0.000041753286,0.00018849998,0.00004359049,0.00008341994,0.002387151,0.29370093,0.00007265811,0.16367851,0.00015106682,0.5393313],"study_design_scores_gemma":[0.00029040937,0.0002467211,0.0001389856,0.0006587504,0.0000041620365,0.00003094273,8.472931e-8,0.5696798,0.00026716889,0.42799175,0.00036138523,0.0003298568],"about_ca_topic_score_codex":0.0000148054505,"about_ca_topic_score_gemma":0.000017568202,"teacher_disagreement_score":0.53900146,"about_ca_system_score_codex":0.00024944622,"about_ca_system_score_gemma":0.0004724451,"threshold_uncertainty_score":0.99973047},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28768396,0.0027743233,0.6964544,0.008992408,0.0018622619,0.0007839523,0.00001352468,0.00015450867,0.0012806739],"genre_scores_gemma":[0.99143755,0.0002517514,0.0074922065,0.00024796798,0.0003028225,0.0000029756686,0.000001529879,0.000014905345,0.0002482735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975598,0.000081828424,0.00038588242,0.00080425764,0.00071523216,0.0004530364],"domain_scores_gemma":[0.99722594,0.0015710989,0.00026275608,0.00074707845,0.000108399196,0.00008473328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023452335,0.00033583047,0.00042967286,0.00026364485,0.00023678399,0.00015039308,0.0019865339,0.00025547235,0.0000028229852],"category_scores_gemma":[0.00020202936,0.00022106322,0.000069220514,0.00043154648,0.0012451151,0.00021128944,0.00066943973,0.0012559517,0.000010831225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051423398,0.000027401591,0.033777162,0.00019271769,0.000022487397,0.000021509684,0.0013474014,0.027192496,0.000043966385,0.0068072095,0.000045755485,0.93047047],"study_design_scores_gemma":[0.0004264513,0.0014467508,0.01702508,0.0011012357,0.000012772061,0.000030939642,2.9460227e-7,0.9614674,0.0012363301,0.0159927,0.00081160374,0.0004484702],"about_ca_topic_score_codex":0.000008766474,"about_ca_topic_score_gemma":0.00002504898,"teacher_disagreement_score":0.93427485,"about_ca_system_score_codex":0.00009812521,"about_ca_system_score_gemma":0.00023042283,"threshold_uncertainty_score":0.90146965},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012072027,0.00008135548,0.9952227,0.0009923312,0.00047758888,0.0005233495,0.0000028087047,0.00038265862,0.0011100026],"genre_scores_gemma":[0.29074144,0.000004276257,0.70778024,0.0004910571,0.00041734235,0.000017082235,0.000010851858,0.00004310263,0.0004946007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607176,0.000045290857,0.00034018335,0.0019021892,0.001008905,0.0006316951],"domain_scores_gemma":[0.997177,0.0002706276,0.0003843753,0.0015340853,0.0004348512,0.00019903471],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063464756,0.00058053277,0.0004406066,0.0007114352,0.0004659877,0.0006538442,0.002672942,0.00037635755,0.000028166029],"category_scores_gemma":[0.00011344956,0.0004900991,0.000086468965,0.0008517205,0.00067506783,0.00063397316,0.00097872,0.0011721783,0.0001234202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001736493,0.000082856604,0.001829718,0.00004323194,0.000027630538,0.000053270713,0.002126597,0.18161017,0.0004365497,0.012565649,0.00004353847,0.80116343],"study_design_scores_gemma":[0.00031892362,0.00018764495,0.0067715426,0.0003370807,0.000007497288,0.00007212345,1.371872e-7,0.98255897,0.0002582878,0.008096712,0.0007711795,0.00061988557],"about_ca_topic_score_codex":0.00008185491,"about_ca_topic_score_gemma":0.00013770249,"teacher_disagreement_score":0.8009488,"about_ca_system_score_codex":0.00030613336,"about_ca_system_score_gemma":0.00041865694,"threshold_uncertainty_score":0.9997551},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038769603,0.000118378,0.99685836,0.00005934013,0.0012887301,0.00045918016,0.000010764798,0.0003645916,0.00045298997],"genre_scores_gemma":[0.15787834,0.0000055814085,0.84181273,0.00006836437,0.00015073759,0.000014665923,0.0000069054167,0.00002721115,0.000035453617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968353,0.0000677192,0.00057998684,0.0009979743,0.0010042697,0.0005147869],"domain_scores_gemma":[0.9968865,0.00091643276,0.00047146913,0.0012548467,0.00034686716,0.00012387123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092946645,0.00047068164,0.00060722406,0.00069682347,0.00019915926,0.00016766496,0.0022701328,0.00022423285,0.000005622477],"category_scores_gemma":[0.000079437705,0.0003979488,0.00009009383,0.00047359933,0.0007029203,0.0007236614,0.000824439,0.00043289797,0.000014624878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003093431,0.000051577845,0.00008123447,0.00036852862,0.000057634905,0.00008393466,0.0015661938,0.8725228,0.0014234927,0.031775713,0.0000136074605,0.092024386],"study_design_scores_gemma":[0.0011538694,0.0016239954,0.00083741645,0.0047413935,0.00005765068,0.00055002415,0.0000033805372,0.87383294,0.029592257,0.08529993,0.0003165983,0.0019905306],"about_ca_topic_score_codex":0.000008859836,"about_ca_topic_score_gemma":0.000009575139,"teacher_disagreement_score":0.15749064,"about_ca_system_score_codex":0.0005874013,"about_ca_system_score_gemma":0.00027266718,"threshold_uncertainty_score":0.99984723},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041083057,0.00075675064,0.99706125,0.00011258962,0.00020324446,0.0009640519,0.000004595854,0.00045369324,0.000032977623],"genre_scores_gemma":[0.12372066,0.000011215619,0.8760543,0.00009180196,0.000059977876,0.000014787837,0.000017361574,0.000016473428,0.000013461701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981508,0.000022981607,0.00040535102,0.00088559237,0.00031922382,0.00021602261],"domain_scores_gemma":[0.9984769,0.00013196992,0.00035398058,0.0005280528,0.00043521004,0.00007384443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065746246,0.00026073318,0.00030769256,0.0004824495,0.000111151196,0.00028908794,0.0005761414,0.00026475792,0.0000020960056],"category_scores_gemma":[0.000091245485,0.00022050309,0.000027147098,0.00036444413,0.00047290648,0.0007299681,0.00016053535,0.00019695213,1.3194553e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018715778,0.000015846896,0.000091664595,0.0001598425,0.0000057640623,0.000014558204,0.0013495593,0.00021066563,0.0035545274,0.0019538575,0.000007829181,0.9926172],"study_design_scores_gemma":[0.00013091764,0.0005491082,0.00006965223,0.0004580021,0.000008267754,0.0000888338,1.4581866e-7,0.8257476,0.013843306,0.15866616,0.00014280775,0.0002951989],"about_ca_topic_score_codex":0.000027175605,"about_ca_topic_score_gemma":0.00006126956,"teacher_disagreement_score":0.99232197,"about_ca_system_score_codex":0.00005113628,"about_ca_system_score_gemma":0.00021993964,"threshold_uncertainty_score":0.8991855},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018823136,0.000063670755,0.97409135,0.00023358263,0.0013618739,0.000405455,4.4847852e-7,0.000120274155,0.0049002073],"genre_scores_gemma":[0.9815723,0.0000034854177,0.011704567,0.0039859684,0.002423507,0.0000036714378,0.00001812732,0.000052832176,0.00023556931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790376,0.000010842574,0.00033515456,0.00085180905,0.0005253721,0.00037303186],"domain_scores_gemma":[0.9985278,0.00048379131,0.0003062534,0.0005107509,0.00015628395,0.000015091067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008637021,0.00036020373,0.00040672798,0.0012987707,0.00017033973,0.00036966245,0.00068086374,0.0001951109,0.00009584402],"category_scores_gemma":[0.00046866483,0.00032580225,0.00008676103,0.0007412401,0.00035774056,0.0006750176,0.00032027857,0.00048224613,0.00023500553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013652969,0.000060360388,0.0002007571,0.00029736123,0.000025479956,0.00016125967,0.00027849973,0.70527375,0.0010162953,0.10678662,0.000034635614,0.18572843],"study_design_scores_gemma":[0.00021271736,0.000017353725,0.000092807015,0.00061185996,0.000015536663,0.0000011286068,1.3488538e-7,0.58645487,0.00015375137,0.41191882,0.00021865069,0.0003024009],"about_ca_topic_score_codex":0.000035780606,"about_ca_topic_score_gemma":0.00019899358,"teacher_disagreement_score":0.9627491,"about_ca_system_score_codex":0.00020570509,"about_ca_system_score_gemma":0.000041779243,"threshold_uncertainty_score":0.9999194},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008243926,0.00017381147,0.9931607,0.0014012664,0.0015946,0.00027607326,0.0000045345096,0.00017802586,0.0023865767],"genre_scores_gemma":[0.094602205,0.00005138173,0.9017234,0.0016468375,0.0011104955,0.000011232266,0.000025477517,0.00004635227,0.00078265194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696773,0.00004157461,0.0003284637,0.0013203424,0.0008084306,0.00053347286],"domain_scores_gemma":[0.9979654,0.00017107351,0.00025756328,0.0010824511,0.00036449157,0.00015903953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005535587,0.00040274832,0.0003399978,0.0006152588,0.00043003756,0.0007132133,0.0016928093,0.00040872904,0.000094572315],"category_scores_gemma":[0.000067364665,0.00037177006,0.000108254586,0.0005737665,0.00047530132,0.0009790964,0.00064923515,0.0006154565,0.00015797593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031423933,0.00011537928,0.00030067138,0.00017571877,0.00003920821,0.00014117848,0.0046174256,0.02305426,0.025884975,0.02370028,0.0020799537,0.9198595],"study_design_scores_gemma":[0.00021378735,0.00008841628,0.00011891123,0.00078179827,0.000009314619,0.00005244443,7.01231e-7,0.9120138,0.0066664275,0.076917626,0.002559489,0.0005772645],"about_ca_topic_score_codex":0.000011884251,"about_ca_topic_score_gemma":0.000026466885,"teacher_disagreement_score":0.91928226,"about_ca_system_score_codex":0.0002533297,"about_ca_system_score_gemma":0.00038904944,"threshold_uncertainty_score":0.9998734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051176827,0.001265117,0.97115505,0.001251199,0.019439198,0.0013970847,0.00000907362,0.00033480037,0.00003079378],"genre_scores_gemma":[0.4347518,0.000028651766,0.56246305,0.0009370354,0.0016355969,0.00014246558,0.000007446996,0.000028601038,0.0000053540084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941239,0.00028592726,0.00074429554,0.0027156293,0.0007897474,0.0013405111],"domain_scores_gemma":[0.99530065,0.0013736364,0.0005476965,0.0023222845,0.00028631993,0.00016943904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029854882,0.00059755193,0.00079816714,0.0007888253,0.00041225954,0.0006808993,0.005190473,0.0005719413,0.0000036578513],"category_scores_gemma":[0.00043495203,0.0005936025,0.00022868009,0.0019267203,0.00047090204,0.00051675376,0.0034776723,0.001257535,0.000012667445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003852257,0.000030723906,0.00080928125,0.00008367319,0.0000065298946,0.000019926225,0.0010651135,0.628345,0.00012817344,0.00040417552,0.00014230156,0.36892655],"study_design_scores_gemma":[0.00060117675,0.00034638622,0.0017452706,0.00021897141,0.000012564465,0.000074460906,4.729717e-7,0.9185821,0.0016600298,0.07553834,0.0005783886,0.00064187375],"about_ca_topic_score_codex":0.000093926574,"about_ca_topic_score_gemma":0.00023056289,"teacher_disagreement_score":0.42963412,"about_ca_system_score_codex":0.0011209594,"about_ca_system_score_gemma":0.0011597339,"threshold_uncertainty_score":0.99965155},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007951363,0.00094534026,0.995842,0.00049369194,0.00054335024,0.0004109902,0.0000042727274,0.00030600783,0.0013748495],"genre_scores_gemma":[0.022955343,0.00008408572,0.97267485,0.0005575511,0.00096725073,0.000046496865,0.00003244588,0.00004615294,0.0026358448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966958,0.0000358853,0.00046428174,0.0014654308,0.00073128915,0.0006073234],"domain_scores_gemma":[0.9980037,0.00024182917,0.0002760271,0.0010129459,0.00030744547,0.00015800579],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056225184,0.0004010534,0.00033677986,0.00048493582,0.0008313973,0.0006039369,0.0021125944,0.00023210526,0.00006216676],"category_scores_gemma":[0.000057410773,0.00039450199,0.000116379204,0.00095304335,0.0006125247,0.00044012576,0.0008966119,0.0008013875,0.00015577205],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012764687,0.00003022641,0.000078989884,0.000019899058,0.000011410899,0.000012858201,0.00042768952,0.008479506,0.00015480982,0.0028442948,0.00032367595,0.98761535],"study_design_scores_gemma":[0.0002604402,0.00032574442,0.0001849704,0.0004127942,0.00001791274,0.00012930499,5.443417e-7,0.8389553,0.00015723173,0.052023754,0.10661832,0.00091369863],"about_ca_topic_score_codex":0.000012306597,"about_ca_topic_score_gemma":0.0000076580545,"teacher_disagreement_score":0.98670167,"about_ca_system_score_codex":0.00022390466,"about_ca_system_score_gemma":0.00027325907,"threshold_uncertainty_score":0.9998507},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001857567,0.00028856576,0.9899375,0.002631611,0.0007894019,0.0018190369,0.000008094498,0.00008783895,0.004252193],"genre_scores_gemma":[0.35581672,0.00010600253,0.6296416,0.01172755,0.00072800205,0.00044688856,0.00002344984,0.0001035693,0.0014062016],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946943,0.00021781368,0.0006335004,0.00180468,0.0015923405,0.0010573464],"domain_scores_gemma":[0.9927546,0.0042167515,0.00024252574,0.0022858384,0.0003427424,0.00015758144],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0033721412,0.00059906836,0.000575361,0.0016592358,0.00035442878,0.00091240497,0.007677523,0.00031213832,0.000026225534],"category_scores_gemma":[0.00071252586,0.00040983356,0.00021281277,0.0023522226,0.0009995344,0.000846982,0.00096790725,0.0016901223,0.00007145469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015935913,0.00004743511,0.000020790732,0.000025827036,0.000006126835,0.000023666531,0.00064578734,0.006264812,0.000020775202,0.48038384,0.00015422543,0.5123908],"study_design_scores_gemma":[0.00035774664,0.00042557737,0.00014144888,0.00014016207,0.0000022670679,0.000019007803,4.842636e-7,0.16165252,0.00031896413,0.83460945,0.0018796414,0.00045275505],"about_ca_topic_score_codex":0.00004414023,"about_ca_topic_score_gemma":0.00011555514,"teacher_disagreement_score":0.51193804,"about_ca_system_score_codex":0.00043084146,"about_ca_system_score_gemma":0.00042341358,"threshold_uncertainty_score":0.9998354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010363928,0.00008212807,0.9797965,0.00039677668,0.0017640018,0.00068478513,0.000009053808,0.00015000433,0.016080324],"genre_scores_gemma":[0.14281482,0.0000047666695,0.8555387,0.00084543513,0.0006478812,0.00001443913,0.0000048617876,0.000031602518,0.00009748946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537206,0.00006706159,0.00072765077,0.0017477551,0.00107692,0.0010085282],"domain_scores_gemma":[0.9976899,0.00044154792,0.0004528675,0.0009907824,0.00022667658,0.00019825251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018999822,0.0005283118,0.0006616601,0.000995692,0.0002457244,0.0008733216,0.0024536636,0.0004523502,0.000018922878],"category_scores_gemma":[0.00016166395,0.00050063693,0.00012348201,0.00085812673,0.00040774106,0.0002921089,0.0014669341,0.0008180933,0.000075846445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004869165,0.00012006102,0.0020948353,0.00019022512,0.000056457407,0.00029613968,0.007859637,0.09982688,0.00037531788,0.01834385,0.00020316782,0.8705847],"study_design_scores_gemma":[0.00053866394,0.00018036253,0.00021199883,0.000316954,0.000007648207,0.00019704702,0.000001769087,0.95174724,0.00015923554,0.045233328,0.00055022625,0.00085551676],"about_ca_topic_score_codex":0.00008771618,"about_ca_topic_score_gemma":0.00043380883,"teacher_disagreement_score":0.8697292,"about_ca_system_score_codex":0.0010242213,"about_ca_system_score_gemma":0.00045551462,"threshold_uncertainty_score":0.99974453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005772952,0.0003102688,0.99366826,0.00033944973,0.0023429152,0.0010308678,0.000007800295,0.0006259638,0.0010972008],"genre_scores_gemma":[0.19612753,0.000019089795,0.7976963,0.0046225693,0.0012136494,0.000079528,0.00007226019,0.00009943803,0.00006964882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99379987,0.0001463164,0.00078048895,0.0029625096,0.00089450966,0.001416328],"domain_scores_gemma":[0.995405,0.00082982983,0.0005834418,0.0022138571,0.00047546878,0.00049238704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012495058,0.0008750625,0.0008355331,0.0011195915,0.00080946606,0.00078207726,0.0041392045,0.00075407705,0.000015113194],"category_scores_gemma":[0.0002297686,0.0008507249,0.00017700293,0.0014292088,0.00067502423,0.0008135095,0.001136818,0.0012498774,0.000034646073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039461065,0.00006789199,0.000109761,0.00003885652,0.000014705806,0.000016310221,0.0014991793,0.5440175,0.00001452907,0.0030969407,0.00008077042,0.45100412],"study_design_scores_gemma":[0.0004480937,0.00064900535,0.00034448417,0.00041912388,0.000015123347,0.0000341321,0.0000017431763,0.9868276,0.00025325714,0.008898555,0.0009579258,0.001150945],"about_ca_topic_score_codex":0.000023651783,"about_ca_topic_score_gemma":0.000062814855,"teacher_disagreement_score":0.44985318,"about_ca_system_score_codex":0.00073622185,"about_ca_system_score_gemma":0.00094698084,"threshold_uncertainty_score":0.99939436},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020913324,0.0004550423,0.991177,0.0009207809,0.0017714142,0.00021569319,0.0000044088533,0.00021428306,0.005032233],"genre_scores_gemma":[0.47972736,0.00010847295,0.5166328,0.001121377,0.0013739972,0.00001745633,0.000005465588,0.000042297837,0.0009707461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742484,0.000026929649,0.00032680965,0.0012329479,0.00056386634,0.00042462032],"domain_scores_gemma":[0.9979472,0.00030840014,0.00018326021,0.0011654054,0.00023727275,0.000158423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006813412,0.00032408134,0.0002708168,0.0006817034,0.0005834159,0.0008117172,0.0018192895,0.00026893598,0.000021526337],"category_scores_gemma":[0.00012289915,0.00031961245,0.00006862507,0.0005526209,0.0007898709,0.0009008673,0.00083471526,0.0005906283,0.0000672163],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006144024,0.000053188098,0.00014866414,0.00005639509,0.000028338976,0.000030523304,0.0049768854,0.010722682,0.0005721063,0.10787,0.0005745503,0.87496054],"study_design_scores_gemma":[0.00015852803,0.00013678888,0.00058249413,0.00023403,0.000010962491,0.000109906956,2.1007948e-7,0.62992716,0.00044346732,0.36274493,0.005063074,0.00058845145],"about_ca_topic_score_codex":0.000038657614,"about_ca_topic_score_gemma":0.000118926546,"teacher_disagreement_score":0.87437207,"about_ca_system_score_codex":0.00022890489,"about_ca_system_score_gemma":0.00027803256,"threshold_uncertainty_score":0.9999256},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011677978,0.00030700467,0.98456043,0.00031292933,0.0016498639,0.00030831137,0.0000020955545,0.000059117923,0.0011222617],"genre_scores_gemma":[0.97303474,0.00010929058,0.026314208,0.0001875686,0.00018082246,0.0000035029766,0.0000013459331,0.00001333584,0.0001551832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998136,0.000043511664,0.00028053814,0.0006158413,0.0006438172,0.00028028202],"domain_scores_gemma":[0.99834836,0.00061113655,0.0002038027,0.0006286435,0.00013975592,0.000068294015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007064035,0.00028995518,0.00027395468,0.00026081438,0.00036565767,0.0002508446,0.0010068301,0.00013347069,0.00001632399],"category_scores_gemma":[0.000084522384,0.00018099429,0.000059464917,0.0002163225,0.0011107126,0.00029573223,0.00037529634,0.00032022802,0.000008331075],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018479735,0.0000011216422,0.000964975,0.000022341268,0.000009510846,0.000001816023,0.00031166602,0.009145871,0.000056527548,0.0018052916,0.000013830627,0.98764855],"study_design_scores_gemma":[0.0005375104,0.0014650126,0.009464186,0.0004514982,0.000016233313,0.00006804954,2.1005776e-7,0.95956427,0.011340883,0.015716814,0.00074751786,0.00062780146],"about_ca_topic_score_codex":0.0000049435,"about_ca_topic_score_gemma":0.00004515811,"teacher_disagreement_score":0.9870208,"about_ca_system_score_codex":0.00007089563,"about_ca_system_score_gemma":0.000108610795,"threshold_uncertainty_score":0.7380733},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007846547,0.0001565545,0.98658943,0.0015493477,0.0018937049,0.0017899995,0.00004590139,0.00011488405,0.000013602179],"genre_scores_gemma":[0.5235384,0.00002225834,0.4753271,0.0008025991,0.00017343507,0.0000882314,0.000030350639,0.000016521351,0.0000011109887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995264,0.000099594516,0.0007167352,0.0020623403,0.00079633866,0.0010609942],"domain_scores_gemma":[0.9930476,0.0032078286,0.00070436473,0.0021885098,0.0006519578,0.00019974433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013414673,0.0005219618,0.00095062336,0.0013995599,0.00031967091,0.00031226405,0.003985081,0.00035444598,0.0000024398512],"category_scores_gemma":[0.00035268173,0.00048896763,0.00042307086,0.008183472,0.0002932968,0.00069397356,0.0026513769,0.00096657197,0.000001507076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033394124,0.00010416921,0.00077879673,0.000056845794,0.000052451367,0.000001455998,0.00025550535,0.8411456,0.000014662967,0.0011283406,0.000014441433,0.15641439],"study_design_scores_gemma":[0.0004304787,0.00032805893,0.0023741517,0.000044892586,0.00015034564,0.0000041650515,0.0000011315673,0.9931544,0.00061343587,0.0022289979,0.00018344108,0.00048648284],"about_ca_topic_score_codex":0.0000107309625,"about_ca_topic_score_gemma":0.00008431907,"teacher_disagreement_score":0.5156918,"about_ca_system_score_codex":0.00033519528,"about_ca_system_score_gemma":0.0004608584,"threshold_uncertainty_score":0.9997562},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030273135,0.00016513189,0.9973432,0.00006635787,0.00014849126,0.0005265313,0.00001596287,0.0010281323,0.00040349326],"genre_scores_gemma":[0.19878764,0.000009041943,0.8010474,0.000057775927,0.000044634955,0.000011216238,0.000011134339,0.000021194379,0.000009953528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972308,0.000045158005,0.000499964,0.00091676065,0.00089274417,0.00041453552],"domain_scores_gemma":[0.99830776,0.00012828544,0.00018963385,0.00094236573,0.0003128735,0.00011904997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010999261,0.0003986355,0.0004923817,0.0011341366,0.000117340875,0.00017960121,0.001666575,0.00032169383,0.0000041098942],"category_scores_gemma":[0.000009924385,0.00037316146,0.0000903774,0.000453132,0.00085412234,0.0007031961,0.00028733112,0.0004230728,0.0000049563364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015306317,0.000075510834,0.000026282412,0.0005332225,0.00003088208,0.000009245744,0.0038062206,0.47136772,0.0007139622,0.22255257,0.000027619559,0.30084145],"study_design_scores_gemma":[0.00018622843,0.0001662996,0.000038073096,0.0002843472,0.000007853454,0.000021463808,6.89648e-8,0.9710552,0.0039120317,0.023769047,0.00021106726,0.0003482942],"about_ca_topic_score_codex":0.000025539719,"about_ca_topic_score_gemma":0.0000032803243,"teacher_disagreement_score":0.4996875,"about_ca_system_score_codex":0.00032048687,"about_ca_system_score_gemma":0.0004436909,"threshold_uncertainty_score":0.999872},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011281173,0.00011718683,0.985651,0.00014737407,0.0016360427,0.00048628965,0.000012102836,0.0002197534,0.00044905205],"genre_scores_gemma":[0.75841033,0.000014682171,0.2400314,0.00058585336,0.0006109649,0.0000072923995,0.000007993687,0.00006968329,0.0002617734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955679,0.000044364013,0.0004957681,0.0019511562,0.0011334266,0.0008073747],"domain_scores_gemma":[0.9973119,0.0005223144,0.00038819583,0.0012083468,0.00027933685,0.00028994394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006742957,0.0007510445,0.0006318695,0.00090157485,0.00036967805,0.00088104396,0.0022315402,0.00029152344,0.000038801754],"category_scores_gemma":[0.00009323477,0.00058191956,0.00008808493,0.00056277466,0.0010472481,0.00097171904,0.0013476149,0.00066438195,0.0000398295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022564725,0.00040075573,0.006143476,0.0004747204,0.00023068646,0.00074053806,0.029381473,0.045719232,0.030252488,0.020928837,0.00011352047,0.86538863],"study_design_scores_gemma":[0.002871812,0.0021626449,0.010408473,0.0026152802,0.00006921631,0.00025829233,0.0000024988697,0.8878148,0.055823505,0.029376429,0.0041103335,0.004486687],"about_ca_topic_score_codex":0.0001064882,"about_ca_topic_score_gemma":0.000043699412,"teacher_disagreement_score":0.86090195,"about_ca_system_score_codex":0.00039957746,"about_ca_system_score_gemma":0.00038798148,"threshold_uncertainty_score":0.99966323},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030641985,0.00010202011,0.99633545,0.00021518038,0.0006836644,0.0007139129,0.000010932385,0.00013923444,0.0014932017],"genre_scores_gemma":[0.36727402,0.000010189354,0.63185483,0.00034469104,0.00016165992,0.00002489904,0.0000016168394,0.000028726025,0.00029936028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959723,0.000031428648,0.00078469695,0.0016237883,0.0009163798,0.0006714248],"domain_scores_gemma":[0.99642867,0.00041901506,0.00039897606,0.0013554094,0.001255698,0.00014221786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017482521,0.0004769348,0.00060271396,0.0007000294,0.00024056964,0.00025435706,0.0033675802,0.0003619636,0.000011133978],"category_scores_gemma":[0.00036017766,0.0004547677,0.0002268046,0.0005431675,0.0010216063,0.0008894176,0.00090219686,0.00046187127,0.00001326302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023885652,0.000039969284,0.000011923896,0.00006235235,0.00001027385,9.793279e-7,0.0018535752,0.78395826,0.0017539983,0.044481926,0.000028678136,0.16777417],"study_design_scores_gemma":[0.000043314012,0.00014505259,0.0000010506433,0.000101821126,0.000005423171,0.0000041303497,1.658284e-7,0.56793624,0.02717021,0.404305,0.000039842125,0.0002477726],"about_ca_topic_score_codex":0.00002708828,"about_ca_topic_score_gemma":0.00026593683,"teacher_disagreement_score":0.3669676,"about_ca_system_score_codex":0.0004190705,"about_ca_system_score_gemma":0.0010679795,"threshold_uncertainty_score":0.99979043},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020618628,0.00004772161,0.98975456,0.0019729682,0.0039085746,0.0010318621,0.000008180632,0.0010469701,0.0020230017],"genre_scores_gemma":[0.059781767,0.000004625817,0.9352961,0.0025294332,0.0018251291,0.000034993165,0.0000077377,0.00007930824,0.00044091206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940928,0.00007552766,0.00071075675,0.0025525172,0.0013159092,0.0012524716],"domain_scores_gemma":[0.9955181,0.0012247737,0.0003586473,0.0020499728,0.00047894267,0.00036958975],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017020068,0.00083372305,0.00083835155,0.0011787849,0.0006481512,0.00094182754,0.006283016,0.0006412509,0.00014333421],"category_scores_gemma":[0.0012999622,0.0007971985,0.00024591322,0.00112865,0.0007715001,0.0006334966,0.0037141223,0.0012417695,0.00014624471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018077893,0.000016563265,0.00002066374,0.000056303423,0.000025035808,0.000054114334,0.0068777506,0.47339284,0.000038160942,0.026281316,0.00016312275,0.49305606],"study_design_scores_gemma":[0.00021868711,0.0003150004,0.0001224559,0.0006886225,0.000013167213,0.000026233716,0.0000010810256,0.8630297,0.0000620985,0.12740684,0.0072369156,0.0008792063],"about_ca_topic_score_codex":0.00004393427,"about_ca_topic_score_gemma":0.00009052181,"teacher_disagreement_score":0.49217686,"about_ca_system_score_codex":0.0007665575,"about_ca_system_score_gemma":0.0005594238,"threshold_uncertainty_score":0.9994479},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003260356,0.00054870895,0.9770159,0.00771268,0.003011493,0.00053735165,0.0000016291574,0.00024884078,0.010890751],"genre_scores_gemma":[0.109875314,0.00024624055,0.80510134,0.037732646,0.008588174,0.00006585538,0.00000927458,0.00024457643,0.03813656],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946242,0.000061134466,0.00068069174,0.0019617453,0.0014153194,0.0012569363],"domain_scores_gemma":[0.9950741,0.00071225845,0.00031817443,0.0030878182,0.00048627745,0.0003213561],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015691848,0.0006780875,0.0005313509,0.0006840983,0.0007837857,0.0016000217,0.008783604,0.00037469075,0.00026257796],"category_scores_gemma":[0.00025424824,0.0005054731,0.00018969104,0.001228884,0.0015007353,0.0013719775,0.0026994685,0.0011510503,0.0010617666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011849952,0.000038460767,0.000018406075,0.000030679934,0.000021172433,0.00020963453,0.0056634457,0.017913913,0.00023522897,0.21191797,0.004547774,0.7593915],"study_design_scores_gemma":[0.00009368134,0.00024339613,0.000011380153,0.0002278317,0.000007644244,0.00009093472,0.0000013608013,0.22928266,0.010916398,0.6983115,0.060084525,0.00072867697],"about_ca_topic_score_codex":0.00020050403,"about_ca_topic_score_gemma":0.00045620668,"teacher_disagreement_score":0.75866276,"about_ca_system_score_codex":0.00043207285,"about_ca_system_score_gemma":0.001554366,"threshold_uncertainty_score":0.9997397},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4993541,0.000025956715,0.49966818,0.000059946724,0.0005913927,0.00016390695,0.000002454738,0.00009821179,0.00003584444],"genre_scores_gemma":[0.9317329,0.000006959902,0.06619454,0.0015466951,0.00047962507,0.000005662017,0.0000013060204,0.00003050326,0.0000018282096],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961185,0.00007846858,0.00052624184,0.0013362282,0.00095714553,0.0009834012],"domain_scores_gemma":[0.9987773,0.00016998115,0.0001222019,0.0005937969,0.00010757142,0.00022920297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067416666,0.00036697046,0.00040787732,0.00041805953,0.00064631435,0.00014620369,0.0011964256,0.00012738549,0.00005463435],"category_scores_gemma":[0.00014605543,0.0003351748,0.00013044906,0.0025281878,0.0014798134,0.00073169795,0.00012117986,0.0002031189,0.000024813146],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009282084,0.00012424603,0.0021273987,0.000035061767,0.0000027977655,0.00015155465,0.0029159228,0.022120154,0.94468105,0.00042068947,5.1993106e-7,0.027327757],"study_design_scores_gemma":[0.0006743731,0.00023870592,0.002085369,0.00011416284,0.000010637402,0.00018332877,0.0000016250654,0.5393573,0.455681,0.0012868679,0.000023846145,0.0003428125],"about_ca_topic_score_codex":0.000106739964,"about_ca_topic_score_gemma":0.00004506321,"teacher_disagreement_score":0.5172371,"about_ca_system_score_codex":0.00023007243,"about_ca_system_score_gemma":0.00049026095,"threshold_uncertainty_score":0.99991006},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007956893,0.00015052521,0.9973357,0.00012058583,0.00083509594,0.0005336735,0.000007487788,0.00018548971,0.00082351296],"genre_scores_gemma":[0.008692456,0.00003712383,0.9902159,0.00036532382,0.00012816791,0.000010597846,0.0000031519753,0.000043557062,0.0005037271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601716,0.00006220399,0.00066223135,0.0016037086,0.0010508397,0.00060383906],"domain_scores_gemma":[0.9962126,0.0005382426,0.0005925497,0.0015462732,0.0009448679,0.00016547614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087913655,0.00056477915,0.00066201354,0.0009770507,0.00019362886,0.00021709454,0.0032861123,0.0003188577,0.000026949217],"category_scores_gemma":[0.00018108902,0.0005310357,0.0001206723,0.0008922508,0.0012436897,0.0008398335,0.0012860722,0.0005031734,0.00003360895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007831393,0.000031376956,0.0000022875274,0.00001634195,0.000011065815,0.000020019073,0.0006565354,0.8581112,0.00034085158,0.0034754223,0.000008694898,0.13731834],"study_design_scores_gemma":[0.00031726286,0.0001590006,0.000010866066,0.00021105257,0.00000676878,0.000036227248,1.0714699e-7,0.9124037,0.0032628016,0.083068594,0.000038037713,0.00048556607],"about_ca_topic_score_codex":0.0000043934156,"about_ca_topic_score_gemma":0.000009595068,"teacher_disagreement_score":0.13683277,"about_ca_system_score_codex":0.00031515356,"about_ca_system_score_gemma":0.00087172654,"threshold_uncertainty_score":0.99971414},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32514063,0.00020757434,0.67434275,0.000004715349,0.000053391926,0.00013480666,0.000012830623,0.000011639653,0.00009163784],"genre_scores_gemma":[0.95402557,0.000116923744,0.045786306,0.0000047683593,0.000020845331,0.0000038502267,0.0000029867795,0.000017281836,0.000021442089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837065,0.000040208386,0.00046530744,0.00042790367,0.0004176255,0.00027831152],"domain_scores_gemma":[0.99880224,0.0005475889,0.00017670022,0.00024485384,0.00014589854,0.00008272727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008481014,0.0001939524,0.00048638237,0.001753969,0.000102292375,0.00006855509,0.00029892402,0.00011370132,0.000009981877],"category_scores_gemma":[0.00039300663,0.00015930766,0.00004727394,0.0015842939,0.00040924712,0.00016594862,0.00012364812,0.0005484024,5.610765e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000939476,0.0000037637524,0.11020024,0.000023293205,0.000030613497,0.0000056029235,0.0016129471,0.8578959,0.00006868767,0.000010805475,4.402296e-7,0.030138306],"study_design_scores_gemma":[0.0002098525,0.0000910607,0.049137842,0.0008192678,0.00003095441,0.0000014697907,0.000008861618,0.94625324,0.00032384633,0.002873542,0.000034997567,0.00021505952],"about_ca_topic_score_codex":0.00029715287,"about_ca_topic_score_gemma":0.0028576937,"teacher_disagreement_score":0.628885,"about_ca_system_score_codex":0.00011112829,"about_ca_system_score_gemma":0.00006424374,"threshold_uncertainty_score":0.6496378},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005313822,0.00025551813,0.98350877,0.007241288,0.0019134721,0.00038937852,0.0000045125526,0.00024576698,0.005909921],"genre_scores_gemma":[0.3799369,0.000048640064,0.58865666,0.01617151,0.008271476,0.00003766444,0.000018372708,0.00016562775,0.006693121],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966983,0.000051107374,0.00037549456,0.001367914,0.00084620225,0.00066097424],"domain_scores_gemma":[0.9975318,0.00051747006,0.0002820295,0.0013708832,0.00011425332,0.00018361773],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047969786,0.0005334479,0.00041415734,0.00054529833,0.00045403998,0.0013150002,0.004297814,0.00018845884,0.00008000574],"category_scores_gemma":[0.000024733812,0.00034216998,0.00011307058,0.0006070001,0.001886225,0.0010396756,0.0016356572,0.0007065152,0.00015400743],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003229226,0.000044168566,0.000023565935,0.000027866987,0.00003221978,0.00015046778,0.0029630037,0.0071626976,0.00003745625,0.03262669,0.0022707505,0.9546288],"study_design_scores_gemma":[0.0009811502,0.0012261434,0.0003935491,0.0006750747,0.00004039137,0.000419976,9.422847e-7,0.6698558,0.002146019,0.227704,0.094476305,0.002080676],"about_ca_topic_score_codex":0.000020189216,"about_ca_topic_score_gemma":0.00007308733,"teacher_disagreement_score":0.95254815,"about_ca_system_score_codex":0.00011247638,"about_ca_system_score_gemma":0.00086155446,"threshold_uncertainty_score":0.999903},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46358827,0.00028759995,0.53490144,0.000020591446,0.00037788416,0.0003807138,0.000008118815,0.000015044355,0.00042034657],"genre_scores_gemma":[0.9903375,0.000021111033,0.0090620285,0.00011643933,0.0002785163,0.0000091037955,0.0000066018565,0.000020903619,0.00014781933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846816,0.000052067015,0.00026700526,0.000659935,0.00020948246,0.00034333288],"domain_scores_gemma":[0.9991671,0.00004563397,0.00024275998,0.00029337575,0.00019391003,0.0000572487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003554165,0.0002626808,0.00023775906,0.00016469901,0.00061935716,0.000057010195,0.0005076268,0.00028751575,0.000010674352],"category_scores_gemma":[0.00009433908,0.00021099024,0.00012801595,0.00017164808,0.0007569915,0.000010363932,0.0013813969,0.00041810022,0.0000021463989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025510663,0.000349381,0.011037678,0.00027384903,0.00011631948,0.00041683382,0.015519678,0.582053,0.014723749,0.00012678538,0.00009328509,0.37503433],"study_design_scores_gemma":[0.0028548294,0.002096174,0.0027160759,0.00071239093,0.00012501217,0.00078973593,0.00012656437,0.9150249,0.04985551,0.022649104,0.0006781486,0.0023715955],"about_ca_topic_score_codex":0.00020858059,"about_ca_topic_score_gemma":0.00075351796,"teacher_disagreement_score":0.5267492,"about_ca_system_score_codex":0.00007548556,"about_ca_system_score_gemma":0.00023452762,"threshold_uncertainty_score":0.8603932},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5188525,0.0000117110885,0.48060983,0.00002199456,0.00004585318,0.0002893834,1.7580915e-7,0.00016120599,0.0000073603924],"genre_scores_gemma":[0.9728073,0.000002111504,0.026942156,0.00017281031,0.000059148944,0.000003938754,0.0000023947507,0.0000095887535,5.499806e-7],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848443,0.0001665632,0.00030172258,0.00039190426,0.00036961952,0.00028577622],"domain_scores_gemma":[0.9994911,0.00013496769,0.00005850143,0.00022372803,0.000053684485,0.000038002338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016180361,0.00012904486,0.00025885704,0.0007811028,0.00005978665,0.000026635402,0.00022606345,0.00009425703,0.000009375258],"category_scores_gemma":[0.00018385952,0.00012325033,0.000045125205,0.0017399146,0.00012110969,0.00015505949,0.000075358825,0.00031352544,0.000001556834],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022677998,0.00009351117,0.555547,0.00006233148,0.0000066189655,0.000009244766,0.00038582215,0.03452846,0.24054609,0.0000016264825,7.090047e-7,0.16879588],"study_design_scores_gemma":[0.00048625533,0.00025498698,0.3929164,0.00011909811,0.000007812618,0.00000833776,7.899348e-7,0.577357,0.028676672,0.00007148791,0.0000013566004,0.00009979002],"about_ca_topic_score_codex":0.00025862557,"about_ca_topic_score_gemma":0.00006553239,"teacher_disagreement_score":0.54282856,"about_ca_system_score_codex":0.00018636714,"about_ca_system_score_gemma":0.00007136369,"threshold_uncertainty_score":0.50260025},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046734372,0.0016685368,0.9916154,0.00010618444,0.00037103958,0.00039199888,0.000004343598,0.000172265,0.0052028485],"genre_scores_gemma":[0.9535065,0.00050452224,0.04521137,0.00024709845,0.00024456505,0.00004876983,0.000022585999,0.00006156064,0.00015297893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982718,0.00003724136,0.00053235784,0.00044529635,0.00028206175,0.00043119417],"domain_scores_gemma":[0.9974721,0.00017969255,0.000083574465,0.0020821912,0.00009897306,0.000083461746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044982426,0.0003351261,0.000360623,0.0004283958,0.00013274982,0.00020314402,0.0025452499,0.0003174763,0.00007837059],"category_scores_gemma":[0.0000021255173,0.0003186189,0.00006933129,0.00032881714,0.0006201116,0.00020387632,0.0006629316,0.00079536554,0.00008924762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038941366,0.00006695392,0.00037779583,0.00012991026,0.00003755373,0.000018365281,0.0037818837,0.64844763,0.0010119895,0.0011676161,0.00005985869,0.34489655],"study_design_scores_gemma":[0.000255634,0.00007685735,0.00008033187,0.0008291358,0.00000657781,0.000024249446,0.0000017450061,0.93569165,0.0010715992,0.05327274,0.007978647,0.00071085035],"about_ca_topic_score_codex":0.000043774675,"about_ca_topic_score_gemma":0.0009736913,"teacher_disagreement_score":0.9530392,"about_ca_system_score_codex":0.00035340496,"about_ca_system_score_gemma":0.00007495213,"threshold_uncertainty_score":0.99992657},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022009546,0.0007214595,0.9923335,0.00032140763,0.0021933762,0.0023049163,0.0000018004088,0.00006655747,0.0018369403],"genre_scores_gemma":[0.7678148,0.0003852825,0.22441933,0.002484874,0.00367185,0.00042252667,0.0000051483685,0.00014508687,0.00065107184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99551135,0.00010341564,0.00090416404,0.0014280418,0.0010744145,0.000978637],"domain_scores_gemma":[0.9958738,0.001426249,0.0005848962,0.0018206036,0.00013714412,0.00015731483],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020425743,0.0005688173,0.000656485,0.0004353859,0.00041274395,0.00065930345,0.005385439,0.00048322286,0.000020991043],"category_scores_gemma":[0.00003900687,0.00041780603,0.0001821288,0.0010072977,0.0010720297,0.00047044092,0.0012479422,0.0013157841,0.000010781728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029773524,0.000051729297,0.00020825159,0.0000696232,0.000010788347,0.0000645795,0.0012186719,0.2433816,0.0001583668,0.008035757,0.00039784546,0.746373],"study_design_scores_gemma":[0.00038164662,0.0003168345,0.00032026623,0.00085242564,0.000003967358,0.000014467549,2.6060684e-7,0.94510067,0.0012306343,0.04753034,0.0036918898,0.00055660395],"about_ca_topic_score_codex":0.000034447603,"about_ca_topic_score_gemma":0.0002238492,"teacher_disagreement_score":0.7679141,"about_ca_system_score_codex":0.00016906584,"about_ca_system_score_gemma":0.0005031298,"threshold_uncertainty_score":0.9999959},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050085504,0.00022071155,0.97890466,0.010880363,0.0012541323,0.00068523164,0.0000049848086,0.00030445482,0.007244573],"genre_scores_gemma":[0.8363393,0.00013413564,0.14314274,0.013581346,0.0009828283,0.00012346209,0.000008555928,0.00011314025,0.005574482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681455,0.0000479864,0.00037150792,0.0014422367,0.00073419505,0.0005895356],"domain_scores_gemma":[0.99604654,0.0005901504,0.0002561161,0.0028575764,0.00016637068,0.0000832145],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001224856,0.00044708705,0.0003863514,0.0005272619,0.0004667,0.00028595954,0.004444104,0.0005587756,0.00004913627],"category_scores_gemma":[0.000064473716,0.0003298694,0.00012124354,0.0007502808,0.0007927646,0.00011576396,0.0010797714,0.0014946628,0.00028873273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005096601,0.00004999161,0.000017333938,0.00001957041,0.000015719997,0.000013895526,0.0003985177,0.027419975,0.00012583562,0.75006694,0.00026642167,0.22160073],"study_design_scores_gemma":[0.0001543052,0.00018621724,0.00004297506,0.00015168429,0.0000054015177,0.00004188187,3.7992214e-7,0.5663268,0.0022409025,0.41606745,0.014289151,0.0004928347],"about_ca_topic_score_codex":0.000025930167,"about_ca_topic_score_gemma":0.000044663757,"teacher_disagreement_score":0.83583844,"about_ca_system_score_codex":0.00025368546,"about_ca_system_score_gemma":0.00043123795,"threshold_uncertainty_score":0.99991536},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52574843,0.000016715188,0.47368607,0.000076033204,0.000043657266,0.00027427607,1.9027733e-7,0.00015022806,0.0000044299068],"genre_scores_gemma":[0.9507445,0.0000066441726,0.048744608,0.00040469036,0.00008846972,0.0000037538553,7.1568485e-7,0.0000064400792,1.8838378e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987322,0.00010305534,0.00012811593,0.00043030077,0.00027950853,0.00032678474],"domain_scores_gemma":[0.99960077,0.00007145754,0.000048306945,0.00020477442,0.00002762528,0.000047058107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012450808,0.000121327015,0.00018387027,0.0005042381,0.000049763683,0.00004981164,0.00014960939,0.0000793962,0.0000026947823],"category_scores_gemma":[0.00016387801,0.00011374829,0.000020208436,0.0011785032,0.000099836674,0.00022717315,0.00014665155,0.00025276022,0.0000011251832],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023515944,0.000038623337,0.4151755,0.000019593917,0.000003387846,0.0000064510346,0.000090479414,0.0016548965,0.07182781,7.743392e-7,9.249531e-7,0.51115805],"study_design_scores_gemma":[0.00023828386,0.00010485523,0.44090766,0.000019749283,0.000003250021,0.000020378788,9.041586e-8,0.5396795,0.018806819,0.00014585796,0.0000010352201,0.00007251529],"about_ca_topic_score_codex":0.0002697781,"about_ca_topic_score_gemma":0.00003974704,"teacher_disagreement_score":0.5380246,"about_ca_system_score_codex":0.00022448,"about_ca_system_score_gemma":0.00010904917,"threshold_uncertainty_score":0.46385208},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049742794,0.0004413847,0.99257934,0.00047992234,0.003929029,0.0006908141,0.000008577668,0.0002234802,0.0011500064],"genre_scores_gemma":[0.21030374,0.000024236524,0.7862898,0.0006075989,0.0018986167,0.000035599867,0.0000097455195,0.00006236935,0.0007682551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950241,0.000049439746,0.0007573805,0.0021527791,0.0011119524,0.0009043387],"domain_scores_gemma":[0.99662966,0.0004085752,0.00048059746,0.0015742589,0.00070385716,0.00020307353],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017181827,0.000594157,0.0005890499,0.00085346354,0.00050486304,0.0008221648,0.003228968,0.00031199318,0.000012480958],"category_scores_gemma":[0.00017307569,0.0005831675,0.00020077398,0.0005879373,0.000617362,0.00091287564,0.0010796244,0.0004891236,0.000043026168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011704734,0.000025523195,0.0000048543952,0.00011598861,0.000025367408,0.00004140378,0.00496855,0.18143027,0.0033756578,0.009423765,0.0002512831,0.80032563],"study_design_scores_gemma":[0.00025869644,0.00021751673,0.0000016163544,0.0004217736,0.0000075935436,0.00006538077,9.695651e-7,0.9494209,0.0065757055,0.041354463,0.0010143655,0.0006609829],"about_ca_topic_score_codex":0.000014405672,"about_ca_topic_score_gemma":0.000055720036,"teacher_disagreement_score":0.7996647,"about_ca_system_score_codex":0.00072385545,"about_ca_system_score_gemma":0.000793673,"threshold_uncertainty_score":0.999662},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029550272,0.00012629604,0.99260527,0.00017330852,0.0056747384,0.0005175084,0.0000037699829,0.00015658664,0.00044701784],"genre_scores_gemma":[0.08543582,0.0000041954813,0.9121389,0.00047716463,0.0018224133,0.000019977446,0.000005858579,0.000047036887,0.000048640828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624,0.000035018154,0.0007607274,0.0014354927,0.00078135217,0.00074737886],"domain_scores_gemma":[0.99635404,0.0009606511,0.00042987763,0.001220134,0.00089389196,0.0001413825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014371248,0.00051374984,0.00063989713,0.00083752355,0.00037637606,0.0005412089,0.002944228,0.00038945818,0.000010039574],"category_scores_gemma":[0.00036438,0.00048562375,0.00024928607,0.0005956066,0.0005019477,0.00036182711,0.0008184855,0.00034920202,0.000007737321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011054615,0.000022565273,0.00001983566,0.000074790645,0.00000902906,0.0000040048576,0.00026593538,0.8842147,0.000024124922,0.0004301813,0.00002536223,0.1148984],"study_design_scores_gemma":[0.00023764653,0.00014317968,0.000004225165,0.00050217385,0.000013722423,0.000008126403,4.9691135e-8,0.97922844,0.002554991,0.016573496,0.00021741384,0.00051651144],"about_ca_topic_score_codex":0.00001887466,"about_ca_topic_score_gemma":0.0000068633635,"teacher_disagreement_score":0.11438189,"about_ca_system_score_codex":0.00020259932,"about_ca_system_score_gemma":0.0006771249,"threshold_uncertainty_score":0.99975955},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009644618,0.00052688346,0.9964016,0.000026253452,0.0007732271,0.0002628773,0.00006875206,0.00013179412,0.00084416516],"genre_scores_gemma":[0.98602664,0.000025933226,0.013516764,0.000013432557,0.00030086495,0.0000055856535,0.00005755956,0.000029033636,0.00002419264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978138,0.000014484381,0.0003859833,0.000530774,0.00084200205,0.0004129417],"domain_scores_gemma":[0.99864984,0.00020234755,0.00007594966,0.00041691196,0.0005566718,0.00009828315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035081015,0.0002938984,0.00034381245,0.00016201656,0.00007590586,0.00011259273,0.00046035176,0.00027469292,0.000013911381],"category_scores_gemma":[0.00020202246,0.00026927365,0.00004079688,0.0004768355,0.000846748,0.0002474783,0.00008290292,0.00040556578,0.000017862925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010328255,0.0000853116,0.00040336367,0.00083874405,0.0000383675,0.00008600351,0.00035539336,0.9010971,0.0026160772,0.028123513,0.00041353595,0.06583927],"study_design_scores_gemma":[0.00017665987,0.00047276384,0.00028043403,0.0008093404,0.000021798003,0.0000648529,1.749565e-7,0.9899558,0.0036122904,0.0036750077,0.00046958934,0.00046128198],"about_ca_topic_score_codex":0.000008169158,"about_ca_topic_score_gemma":0.000011396352,"teacher_disagreement_score":0.9850622,"about_ca_system_score_codex":0.0007887428,"about_ca_system_score_gemma":0.00028054963,"threshold_uncertainty_score":0.9999759},"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":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9723702,0.000026953472,0.0034797655,0.000202003,0.0005672344,0.0005378197,0.000014680023,0.000011815477,0.022789547],"genre_scores_gemma":[0.9987899,0.000004328525,0.00034898455,0.00030172453,0.000050470393,1.7993061e-7,0.0000015861408,0.0000038286394,0.0004990092],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9977262,0.0003344147,0.00020045905,0.00051971315,0.00083160144,0.00038761806],"domain_scores_gemma":[0.9988803,0.00040531153,0.00013799118,0.0003815235,0.00012191419,0.00007290491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017280692,0.00019340133,0.0002848991,0.00037110603,0.00037897733,0.00005197194,0.0013063573,0.00016150868,0.00027046932],"category_scores_gemma":[0.000022170247,0.00018113531,0.00004467418,0.00041749206,0.0008344118,0.00024100585,0.00038973952,0.00058846135,0.0000014916535],"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.000039353086,0.00016724176,0.027141973,0.000023702476,0.000026695552,0.007013145,0.95861256,0.0030271006,0.0000011641823,0.0026376967,0.00018943945,0.001119933],"study_design_scores_gemma":[0.01155537,0.0034094867,0.22480899,0.0011544941,0.00047841328,0.00064784236,0.5807029,0.0098240115,0.000061896615,0.06440696,0.09551369,0.007435964],"about_ca_topic_score_codex":0.99319756,"about_ca_topic_score_gemma":0.99986744,"teacher_disagreement_score":0.37790966,"about_ca_system_score_codex":0.0027219995,"about_ca_system_score_gemma":0.004841873,"threshold_uncertainty_score":0.8589275},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056297594,0.00030295044,0.9887537,0.00039249402,0.0002347293,0.00027895844,0.0000049822565,0.00013019484,0.0093390085],"genre_scores_gemma":[0.6725947,0.000044432752,0.3266309,0.00013203245,0.00021824689,0.000013922372,0.0000070325086,0.000030285113,0.0003284248],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961579,0.000058170303,0.0005641473,0.0012555106,0.0014265673,0.0005377078],"domain_scores_gemma":[0.99685913,0.0006225824,0.00029241032,0.0016225353,0.0005044533,0.00009889018],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013914749,0.00029886054,0.00043974866,0.0021169956,0.00015820588,0.0012257218,0.0041255667,0.0003173799,0.000013623518],"category_scores_gemma":[0.0005067818,0.00028857577,0.00009614809,0.0018515169,0.0021529219,0.0032150147,0.0016183967,0.0011215347,0.000025590338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000108594395,0.000055460554,0.00087303604,0.000046937937,0.000010262847,0.000046771216,0.0016285144,0.00058592163,0.0018622873,0.07794938,0.000029378913,0.9169012],"study_design_scores_gemma":[0.00018137723,0.00031451246,0.0020196454,0.0008794534,0.0000036871152,0.00001462128,0.0000012674489,0.07647056,0.0062254076,0.9088324,0.0044987747,0.00055833894],"about_ca_topic_score_codex":0.00000792151,"about_ca_topic_score_gemma":0.00004176205,"teacher_disagreement_score":0.91634285,"about_ca_system_score_codex":0.0003091139,"about_ca_system_score_gemma":0.0006029132,"threshold_uncertainty_score":0.99995667},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061474484,0.0023479918,0.933334,0.00087046204,0.0028560432,0.00027532494,0.0001783739,0.00004769849,0.053942684],"genre_scores_gemma":[0.9126818,0.0026516707,0.03841736,0.0036438406,0.0025515284,0.00003147437,0.000025085532,0.00015999743,0.039837204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780697,0.000006153668,0.0006115997,0.0011018428,0.00002509039,0.00044836968],"domain_scores_gemma":[0.99871683,0.00019191884,0.00037131578,0.00057644385,0.000022831035,0.00012067934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073752156,0.00030853192,0.0006194721,0.0005076914,0.00006910013,0.00024804258,0.0008058064,0.00026091948,0.00014587384],"category_scores_gemma":[0.000047800997,0.00030593193,0.00008500213,0.00008932085,0.0006344351,0.00032306396,0.00056624843,0.00029300514,0.00022302754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014101101,0.000021046799,0.0013586554,0.000056265482,0.00003414429,0.00000865778,0.00069592026,0.0019014998,0.000003929451,0.78766656,0.00064562133,0.20759362],"study_design_scores_gemma":[0.00034603794,0.00006288362,0.000082809005,0.000099209465,0.000002125885,0.000017061579,1.1752159e-7,0.058968272,0.00003872649,0.86792934,0.07197794,0.00047547676],"about_ca_topic_score_codex":0.000026476822,"about_ca_topic_score_gemma":0.00008604417,"teacher_disagreement_score":0.9065344,"about_ca_system_score_codex":0.00048528932,"about_ca_system_score_gemma":0.000235904,"threshold_uncertainty_score":0.99993926},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27327132,0.032557018,0.645906,0.0008317685,0.015644187,0.0009864991,0.00005937004,0.00001774705,0.03072615],"genre_scores_gemma":[0.95011866,0.000669211,0.04487428,0.00088961277,0.0013474773,0.0000074612476,0.000010332089,0.000034371606,0.0020485907],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989335,0.0000150115375,0.00025119394,0.00045573924,0.00016252403,0.00018202473],"domain_scores_gemma":[0.9990776,0.00006934619,0.0001806257,0.00045246675,0.00020109554,0.000018822975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029508222,0.00018598177,0.00020092296,0.00005220074,0.00007942326,0.0000152449575,0.00048288272,0.00015463211,0.000022512208],"category_scores_gemma":[0.00009001819,0.00014016757,0.000079822385,0.00003873224,0.0012535885,0.0000018124648,0.000316229,0.00013153792,0.0000027911592],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101599675,0.000048445196,0.0044729947,0.00021987915,0.00031769293,0.000007393422,0.01395421,0.0060475403,0.382111,0.0022767622,0.0024533952,0.5879891],"study_design_scores_gemma":[0.0014135778,0.0025471128,0.0017713037,0.00097293896,0.00019174382,0.00030321084,0.000041852043,0.016718958,0.3073965,0.18253815,0.48291752,0.0031871235],"about_ca_topic_score_codex":0.000024652096,"about_ca_topic_score_gemma":0.00010682426,"teacher_disagreement_score":0.67684734,"about_ca_system_score_codex":0.00009370817,"about_ca_system_score_gemma":0.00033038552,"threshold_uncertainty_score":0.5715868},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37202978,0.00028403144,0.624927,0.00019228297,0.0017528407,0.0005299137,0.0000033507258,0.0002740487,0.000006783881],"genre_scores_gemma":[0.5779092,0.000010151692,0.42143196,0.00023804193,0.00034034727,0.00003965267,0.00000193954,0.000028348759,3.8684885e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928123,0.0006060251,0.0008125907,0.0030140085,0.0012513634,0.0015037578],"domain_scores_gemma":[0.99479735,0.0018178838,0.00041902033,0.0023366797,0.00039502094,0.00023405241],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003658993,0.00083997013,0.0009958808,0.0014478777,0.00032305386,0.0014483946,0.005083004,0.00044486657,0.0000035361938],"category_scores_gemma":[0.000887492,0.00069977605,0.00018444452,0.0039000853,0.0009009266,0.0008645444,0.0022417963,0.0016663371,0.000013137593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000411306,0.00016254983,0.05944232,0.0001280471,0.000017218219,0.00020163787,0.0054604914,0.42613617,0.0007114992,0.0000086229065,0.0000027160597,0.5076876],"study_design_scores_gemma":[0.0009449821,0.00028379844,0.073379844,0.00091585674,0.0000063699254,0.00007299997,0.000001718863,0.90683913,0.0152790435,0.001312768,0.00002018557,0.0009432811],"about_ca_topic_score_codex":0.0003086016,"about_ca_topic_score_gemma":0.0041343295,"teacher_disagreement_score":0.5067443,"about_ca_system_score_codex":0.0005021021,"about_ca_system_score_gemma":0.0012912812,"threshold_uncertainty_score":0.9995882},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022973979,0.00047334933,0.97478575,0.00085979654,0.0001142742,0.00045498187,0.000010863015,0.000029515784,0.00029750593],"genre_scores_gemma":[0.78992814,0.000066991735,0.20858541,0.00022487895,0.00019897046,0.0000052204236,0.000021397886,0.000024735855,0.0009442624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986226,0.00002084398,0.00030042444,0.00054263306,0.00028738458,0.00022611243],"domain_scores_gemma":[0.99871266,0.0006474691,0.00017049625,0.00021838598,0.00018117302,0.00006983912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032779385,0.00020841458,0.00042422453,0.00060633913,0.00008971887,0.00004403092,0.00015355894,0.00012502473,0.000016892629],"category_scores_gemma":[0.0003886083,0.00016614344,0.000080507045,0.00021769681,0.0005515508,0.000048642683,0.0000910698,0.0004153615,0.0000012406605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011761571,0.000039835824,0.0014651349,0.00028985937,0.00003430312,0.00009768451,0.0017882414,0.043712676,0.016659126,0.000015557385,0.00001913166,0.93576086],"study_design_scores_gemma":[0.0028494068,0.0016123634,0.0023438793,0.0051144934,0.0003164607,0.00035157296,0.000012604201,0.9392725,0.026772186,0.018332299,0.0021167689,0.00090547017],"about_ca_topic_score_codex":0.000043369833,"about_ca_topic_score_gemma":0.00005618967,"teacher_disagreement_score":0.93485534,"about_ca_system_score_codex":0.00006989966,"about_ca_system_score_gemma":0.00010189117,"threshold_uncertainty_score":0.67751324},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000718645,0.00044351132,0.99411714,0.00050873746,0.0029786616,0.00072476163,0.000016750439,0.00022993168,0.00026183343],"genre_scores_gemma":[0.14354363,0.000094767696,0.85216326,0.0009141153,0.0018807469,0.0002574757,0.000009212252,0.0000936731,0.0010431309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962419,0.000035322762,0.00045475995,0.0018479415,0.00074847107,0.0006715888],"domain_scores_gemma":[0.9977652,0.00024846956,0.0004748529,0.0008275846,0.000561529,0.00012238201],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094048603,0.0004924215,0.00045689166,0.00062698463,0.0003714713,0.00028930718,0.0017021091,0.00031860333,0.0000105254985],"category_scores_gemma":[0.00005968816,0.00043352888,0.00011490472,0.00038557034,0.00081349554,0.00069156033,0.00067918847,0.00060103345,0.000007594102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011947137,0.000046405614,0.000301395,0.00014951371,0.000018979632,0.000023441356,0.001623193,0.097469606,0.0009516787,0.0011041941,0.00013524154,0.89805686],"study_design_scores_gemma":[0.0003501006,0.0007310538,0.00015364253,0.0004985021,0.00002054211,0.00006522319,1.6124936e-7,0.9682138,0.00073632004,0.028470492,0.00025992125,0.0005002329],"about_ca_topic_score_codex":0.000026067222,"about_ca_topic_score_gemma":0.0003911458,"teacher_disagreement_score":0.89755666,"about_ca_system_score_codex":0.0010124685,"about_ca_system_score_gemma":0.0008346841,"threshold_uncertainty_score":0.99981165},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050807645,0.0001353512,0.99586433,0.00008471664,0.00091674225,0.0004414321,0.000002412106,0.00052989426,0.0015170317],"genre_scores_gemma":[0.14490823,0.00002609547,0.85294175,0.0006860036,0.00087146554,0.000032467353,0.000001852552,0.00005344557,0.00047865318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966104,0.00003204228,0.0005286313,0.0014956349,0.0007163069,0.00061700685],"domain_scores_gemma":[0.9976787,0.00009330821,0.00033606202,0.0014116241,0.000306206,0.00017407446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058331643,0.00049458264,0.0003920044,0.00090613624,0.0005496699,0.00048762592,0.002284787,0.00043565774,0.000096180505],"category_scores_gemma":[0.000022142802,0.00048327036,0.0001771614,0.0007201291,0.00068016513,0.0008040135,0.00083081005,0.00072067714,0.00009307532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000648447,0.000038826573,0.000020271482,0.00002465464,0.000015627453,0.000025728225,0.0006215684,0.026143553,0.001502373,0.0035313962,0.000013007956,0.9680565],"study_design_scores_gemma":[0.000121518235,0.00017438532,0.0001347947,0.00008959676,0.0000105933095,0.00017561569,1.9275218e-7,0.9506492,0.008283179,0.036634155,0.0031106623,0.00061613275],"about_ca_topic_score_codex":0.00007184226,"about_ca_topic_score_gemma":0.00013515068,"teacher_disagreement_score":0.96744037,"about_ca_system_score_codex":0.00047809893,"about_ca_system_score_gemma":0.00036950805,"threshold_uncertainty_score":0.9997619},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003421582,0.00009047803,0.97106177,0.00093737163,0.0021562804,0.00026085868,0.0000028031088,0.00017257834,0.025283637],"genre_scores_gemma":[0.6546468,0.00012656732,0.33132294,0.007836649,0.0018258044,0.000010900074,0.000021586266,0.00009890925,0.0041098376],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694884,0.000028989018,0.0003804023,0.0012558372,0.00085363805,0.0005323075],"domain_scores_gemma":[0.9982043,0.00042357584,0.00018657968,0.0009365936,0.00009808029,0.00015087705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005491216,0.00037380436,0.00037879503,0.0009109743,0.0002578872,0.00065179035,0.0019152362,0.0002858574,0.00010020596],"category_scores_gemma":[0.000039016315,0.0003488921,0.00013416029,0.0003964066,0.00040495722,0.0007349535,0.00078061974,0.0009138042,0.00037719362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064130154,0.000030252355,0.000026442252,0.00005212017,0.000016467045,0.00010621196,0.00057795836,0.0048409556,0.00016476336,0.3894174,0.00013160513,0.6046294],"study_design_scores_gemma":[0.00027744533,0.0001498928,0.000041505627,0.00039649993,0.00000612887,0.000085077554,1.88554e-7,0.23968752,0.0005890822,0.7547365,0.0034059074,0.00062426354],"about_ca_topic_score_codex":0.000004726035,"about_ca_topic_score_gemma":0.00002606231,"teacher_disagreement_score":0.6546126,"about_ca_system_score_codex":0.0005212203,"about_ca_system_score_gemma":0.0005444165,"threshold_uncertainty_score":0.9998963},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016046134,0.00012940404,0.990172,0.00004369466,0.0014010286,0.00013162267,0.000004813986,0.0001610582,0.0063517643],"genre_scores_gemma":[0.5025908,0.0001093385,0.49649924,0.00008166579,0.00065433275,0.000007666489,0.000015235371,0.000021867185,0.000019859266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902606,0.0000044826497,0.00034437637,0.00024286851,0.00021404537,0.00016814184],"domain_scores_gemma":[0.9994426,0.0000444634,0.0000749841,0.00021025082,0.00017886162,0.000048860562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017651131,0.00020473995,0.0001562486,0.00051474426,0.00016741226,0.00027689984,0.00018162365,0.00018430453,0.00004005883],"category_scores_gemma":[0.000029884002,0.0002005936,0.000028894767,0.000180659,0.00033639855,0.0007402875,0.00005281591,0.0003819569,0.00001465311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013786813,7.4901703e-7,0.0000148456165,0.00002716049,0.0000052855094,2.98467e-7,0.00059244136,0.13040105,0.00030844702,0.041929282,0.0000067323035,0.82671237],"study_design_scores_gemma":[0.000058705227,0.00001360887,0.0000062264307,0.00019143158,0.000005136955,0.00005473469,0.0000034819261,0.9247506,0.00065947545,0.07330635,0.00075356686,0.00019665145],"about_ca_topic_score_codex":0.0000063230354,"about_ca_topic_score_gemma":0.000027176926,"teacher_disagreement_score":0.8265157,"about_ca_system_score_codex":0.000167091,"about_ca_system_score_gemma":0.000060794835,"threshold_uncertainty_score":0.817997},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.678577,0.0002015849,0.3191302,0.000011315145,0.0009967362,0.0008769009,0.000034829278,0.000047739668,0.00012368074],"genre_scores_gemma":[0.9925979,0.00005779199,0.007122293,0.000027930664,0.00014132618,0.0000057931084,0.000011841343,0.000026549345,0.0000085775755],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978021,0.000055778375,0.0004331307,0.0005472319,0.0009300228,0.00023177009],"domain_scores_gemma":[0.9983532,0.00011542856,0.00034041094,0.0007283394,0.00037940143,0.000083209874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049099396,0.00029169867,0.0009568728,0.0014429991,0.00004584207,0.000015374497,0.00019730208,0.00027163944,0.000021278938],"category_scores_gemma":[0.000070087066,0.00020955667,0.00042532894,0.0008369095,0.000640067,0.00007648197,0.00008605602,0.00046199703,0.0000036336448],"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.0002548501,0.00014907155,0.5727689,0.0009185324,0.0009672457,0.00002473528,0.0014738321,0.007667322,0.0002491989,0.00003357606,0.000014923883,0.4154778],"study_design_scores_gemma":[0.0025380303,0.0016204602,0.97858566,0.0026131482,0.0006902033,0.000018481898,0.0000027297265,0.0070532425,0.004680481,0.0011876371,0.00044051764,0.0005694011],"about_ca_topic_score_codex":0.00022753235,"about_ca_topic_score_gemma":0.00015860124,"teacher_disagreement_score":0.4149084,"about_ca_system_score_codex":0.00015920217,"about_ca_system_score_gemma":0.00017855222,"threshold_uncertainty_score":0.8545473},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010817078,0.00031439133,0.9956463,0.0013346281,0.0012841634,0.00016489578,0.0000012267825,0.00012232388,0.000050390543],"genre_scores_gemma":[0.75781256,0.0003956247,0.23963118,0.00027875425,0.0016014297,0.000018191622,0.000017751056,0.00009511312,0.00014939925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989346,0.0000054628035,0.00015279646,0.00038226714,0.0002714032,0.00025345988],"domain_scores_gemma":[0.999482,0.00010277291,0.000017756956,0.0001986238,0.000055933968,0.00014294853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021953609,0.00020587335,0.00019316631,0.0005428743,0.000031788193,0.000109132416,0.0002947895,0.00023638635,0.000028372622],"category_scores_gemma":[0.0000973268,0.00018850251,0.000010032048,0.000499781,0.00020733656,0.0001280207,0.00010301569,0.00024378294,0.000014906394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035046585,0.000037074675,0.000025019099,0.0005127485,0.000011575155,0.000025917152,0.004056068,0.033632264,0.0015378478,0.00040630074,0.0005119514,0.9592397],"study_design_scores_gemma":[0.0005514721,0.00053534826,0.0008788026,0.0025390298,0.000017558552,0.000075922384,0.000005383346,0.9341055,0.005104332,0.0330807,0.021303358,0.0018025646],"about_ca_topic_score_codex":0.0000027057974,"about_ca_topic_score_gemma":0.000011632564,"teacher_disagreement_score":0.95743716,"about_ca_system_score_codex":0.0001342722,"about_ca_system_score_gemma":0.000062165425,"threshold_uncertainty_score":0.7686909},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009512593,0.0018604534,0.98655087,0.0001547256,0.0009479479,0.0008185216,0.00008161115,0.000009587737,0.00006369756],"genre_scores_gemma":[0.8660976,0.000100720295,0.13294755,0.00024695633,0.00041918622,0.000009999058,0.00015512796,0.000016287864,0.000006564703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986515,0.000017845687,0.0002562057,0.0005232851,0.0003497064,0.00020144129],"domain_scores_gemma":[0.9988358,0.0003635772,0.0001089906,0.0005242567,0.000099149926,0.00006825233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033386343,0.00017487339,0.0003105839,0.00018500796,0.00007673008,0.000039417657,0.00027208246,0.00014266145,0.0000075030616],"category_scores_gemma":[0.00016098697,0.00012259971,0.00027685318,0.00023295809,0.00036410216,0.000067864465,0.0003159759,0.00028379727,3.710411e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048482988,0.00026497542,0.1645697,0.00025610175,0.0005861505,0.000022264332,0.0007249948,0.017556854,0.000036506506,0.0030349805,0.000111813024,0.8123508],"study_design_scores_gemma":[0.002006388,0.0005780849,0.12954463,0.0034843315,0.000565407,0.000022858863,0.0000041439175,0.81293064,0.00010531036,0.050294947,0.00008552321,0.00037772147],"about_ca_topic_score_codex":0.0000067427086,"about_ca_topic_score_gemma":0.000012926445,"teacher_disagreement_score":0.856585,"about_ca_system_score_codex":0.00010169406,"about_ca_system_score_gemma":0.00016680293,"threshold_uncertainty_score":0.49994713},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000361058,0.0005288982,0.9833531,0.003494417,0.0045510707,0.00056753383,0.0000135156415,0.00065277633,0.006477653],"genre_scores_gemma":[0.06806665,0.00009164648,0.87613565,0.047540236,0.0062465663,0.000043203654,0.00007239895,0.0002626436,0.0015410222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992455,0.00014328667,0.00095202064,0.0029223713,0.0018397607,0.0016875576],"domain_scores_gemma":[0.9942539,0.0010414887,0.0005925075,0.0029624682,0.0007135002,0.0004361434],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011680988,0.0010343681,0.0009425901,0.0015787529,0.00055574137,0.00071370485,0.008371995,0.0005500568,0.00003090047],"category_scores_gemma":[0.000041812298,0.00081046595,0.00022343466,0.0035637675,0.00044201454,0.0010481135,0.004461755,0.0012325327,0.00029952073],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014837325,0.000089613815,0.0001621172,0.00024905338,0.00004187437,0.00019028722,0.0046464964,0.009552304,0.00040754856,0.010269462,0.00022484447,0.97415155],"study_design_scores_gemma":[0.0021498953,0.0005033596,0.00058086595,0.0042880885,0.000045171557,0.00041731214,0.0000028548682,0.7143457,0.0059553627,0.20340943,0.06444326,0.0038586978],"about_ca_topic_score_codex":0.00011126988,"about_ca_topic_score_gemma":0.0006445419,"teacher_disagreement_score":0.97029287,"about_ca_system_score_codex":0.0006302755,"about_ca_system_score_gemma":0.001996404,"threshold_uncertainty_score":0.99943465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016888622,0.00012784963,0.995101,0.00022466952,0.0011269226,0.0012443587,0.000008328599,0.000330101,0.00014792557],"genre_scores_gemma":[0.30939695,0.00009400197,0.68961215,0.0002572367,0.00034965348,0.000023823084,0.000024488907,0.00004322847,0.00019847223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638146,0.00007825585,0.0007009841,0.0017443609,0.0006177368,0.00047721918],"domain_scores_gemma":[0.99667215,0.000854416,0.00042244542,0.001040316,0.000842229,0.00016843282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013056686,0.0004792837,0.00052988605,0.0005549089,0.00040842936,0.0009578743,0.001221347,0.00030896437,0.000011915223],"category_scores_gemma":[0.00008535114,0.0004535483,0.00010316947,0.0006100345,0.0007761163,0.0006956465,0.00079492474,0.00041271863,0.0000021768676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007241841,0.00018372074,0.0013348322,0.00040958618,0.00006730112,0.000095597825,0.001573595,0.026451923,0.00022608449,0.15169801,0.00011281191,0.8177741],"study_design_scores_gemma":[0.0003884899,0.00049981324,0.00006566683,0.00024169456,0.000008126198,0.00010977005,1.8460192e-7,0.8568359,0.0005294587,0.14003687,0.00082834257,0.00045570865],"about_ca_topic_score_codex":0.00001374891,"about_ca_topic_score_gemma":0.00005687241,"teacher_disagreement_score":0.83038396,"about_ca_system_score_codex":0.00028011005,"about_ca_system_score_gemma":0.00047560994,"threshold_uncertainty_score":0.9997916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070939487,0.000043258406,0.98941094,0.00047006784,0.001008277,0.0005836684,0.000012590504,0.00025748642,0.007504302],"genre_scores_gemma":[0.2537933,0.00009207315,0.73722243,0.0028911293,0.0019340046,0.00012876227,0.00007619076,0.00012379365,0.0037383137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963474,0.000063571235,0.00035706456,0.0015519536,0.001034923,0.0006450431],"domain_scores_gemma":[0.9978222,0.0005151268,0.0003257777,0.0006378387,0.0005194567,0.00017956788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005387012,0.00047338396,0.00036822885,0.0008213187,0.0005219489,0.00043347004,0.0010536979,0.0002975321,0.000057090387],"category_scores_gemma":[0.00012684618,0.0003801725,0.0000768348,0.00071228016,0.00078955904,0.0013413331,0.00052438787,0.0010369159,0.00009915286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016216472,0.00013627225,0.0010601493,0.00010235932,0.00009294982,0.00017461278,0.020180892,0.06147663,0.0009353629,0.0012284295,0.0012130608,0.9132371],"study_design_scores_gemma":[0.0011259842,0.002684924,0.0018432218,0.0019958294,0.000021223877,0.00016092551,0.000009401063,0.902349,0.005958401,0.07817265,0.004480697,0.0011977345],"about_ca_topic_score_codex":0.00004351197,"about_ca_topic_score_gemma":0.0000544967,"teacher_disagreement_score":0.9120394,"about_ca_system_score_codex":0.00036877696,"about_ca_system_score_gemma":0.0007337918,"threshold_uncertainty_score":0.999865},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005044941,0.00034979667,0.9966996,0.00021553067,0.00024127838,0.0015580634,0.000028143428,0.00013124754,0.0002718647],"genre_scores_gemma":[0.19879103,0.00007496905,0.7998621,0.00037151968,0.00031344267,0.00012058444,0.00008647629,0.00004148523,0.00033841553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795765,0.000012975308,0.00043247876,0.0009365981,0.00030067004,0.00035966045],"domain_scores_gemma":[0.9985876,0.00019407149,0.00023310467,0.00060130353,0.00029281425,0.00009108521],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040350095,0.00029354586,0.00038159202,0.00033024707,0.00013723355,0.00006830244,0.00031927502,0.0002357788,0.000017381411],"category_scores_gemma":[0.0000931021,0.00028862362,0.00006305467,0.0002915164,0.0004832733,0.00021148827,0.00004879664,0.00039939606,0.0000028600955],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026583935,0.000044724406,0.000007673545,0.000022075143,5.957482e-7,0.000007253297,0.00013074664,0.0008719356,0.004663961,0.000114761984,0.000007041734,0.99410266],"study_design_scores_gemma":[0.0010241877,0.0011291387,0.00070517487,0.0009751982,0.000021583812,0.000063680876,0.0000020210964,0.9203166,0.02203939,0.052931186,0.00035156158,0.00044029008],"about_ca_topic_score_codex":0.000021609345,"about_ca_topic_score_gemma":0.00019561693,"teacher_disagreement_score":0.99366236,"about_ca_system_score_codex":0.00034809983,"about_ca_system_score_gemma":0.00016124835,"threshold_uncertainty_score":0.9999566},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.781627,0.00020420153,0.21335217,0.00023586705,0.00052462297,0.0011728804,0.00038396972,0.000025084766,0.0024741725],"genre_scores_gemma":[0.8471877,0.000071945666,0.15153588,0.00039581105,0.00022039136,0.000010072945,0.0001770171,0.000035614128,0.00036554827],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99761486,0.000011341715,0.0006187564,0.00078547327,0.00065374566,0.00031583995],"domain_scores_gemma":[0.9983491,0.0001230997,0.00052011095,0.00060391286,0.00028654616,0.00011727369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014823307,0.0004394384,0.0007831338,0.00043216732,0.000045440313,0.00003406758,0.00029640793,0.00012370186,0.00013598743],"category_scores_gemma":[0.000043506298,0.00035738232,0.00012455975,0.00011551978,0.0008149487,0.00016213466,0.00044189446,0.00025407158,0.000006996923],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036784416,0.0003512725,0.01915913,0.00041229185,0.0007300391,0.00016458245,0.0026582365,0.00012554986,0.26854444,0.0000073963847,0.00058970007,0.7068895],"study_design_scores_gemma":[0.004821449,0.0028734992,0.02409014,0.0011123432,0.0007166018,0.00005250057,0.000008696086,0.010877337,0.95435613,0.00022450133,0.00025677728,0.0006100062],"about_ca_topic_score_codex":0.00022723402,"about_ca_topic_score_gemma":0.000029229957,"teacher_disagreement_score":0.7062795,"about_ca_system_score_codex":0.0003159316,"about_ca_system_score_gemma":0.00015734577,"threshold_uncertainty_score":0.9998878},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000102106846,0.00013305937,0.99762404,0.00005084773,0.001336334,0.00042953802,0.000006621504,0.00014995168,0.00016749697],"genre_scores_gemma":[0.20782617,0.00012591192,0.79056764,0.00014918808,0.0009977227,0.000022288887,0.000043182557,0.00006321728,0.00020468695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989987,0.000005491289,0.0001821452,0.0004565815,0.00015606542,0.00020101605],"domain_scores_gemma":[0.9993566,0.00015695527,0.00006017764,0.00021922353,0.0001626591,0.000044346136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001534527,0.00022883166,0.00021156791,0.00020432305,0.00014623154,0.00010273677,0.00014899933,0.0001859957,0.000009088277],"category_scores_gemma":[0.00016204863,0.00019955458,0.000020151834,0.00011240101,0.00033063028,0.00014546241,0.000054620807,0.00017243644,0.0000030757403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061118253,0.00000379402,0.0000050514072,0.00006255298,0.0000063558305,5.9369853e-7,0.0004684418,0.96182126,0.000036173606,0.0044960766,0.000017867324,0.03307574],"study_design_scores_gemma":[0.000109630935,0.00010295119,0.000033556273,0.0003081254,0.000011277355,0.0000074675663,3.500616e-7,0.80866116,0.004804084,0.18467994,0.00094864116,0.00033277713],"about_ca_topic_score_codex":9.511771e-7,"about_ca_topic_score_gemma":0.000014079719,"teacher_disagreement_score":0.20772406,"about_ca_system_score_codex":0.00010578523,"about_ca_system_score_gemma":0.00003369889,"threshold_uncertainty_score":0.81376},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004598209,0.00035585486,0.99025357,0.00029105367,0.004153745,0.00047244527,0.00000952618,0.00042250764,0.003581484],"genre_scores_gemma":[0.04373411,0.00003915889,0.95321184,0.00086376694,0.0012331357,0.000014748782,0.000010179528,0.00007771821,0.000815355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99412155,0.00005976273,0.00076442206,0.0024256953,0.0015423234,0.0010862728],"domain_scores_gemma":[0.99607944,0.00059127033,0.00034290645,0.0022417593,0.00039117536,0.0003534444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012819723,0.000786389,0.0007448835,0.00092553,0.00036756587,0.0007273921,0.0048012547,0.0005089176,0.000044832403],"category_scores_gemma":[0.00017107051,0.00072593964,0.00020268759,0.0008643314,0.0015554812,0.00075979927,0.001036654,0.0011312912,0.0001573967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000922223,0.000097486896,0.00055746164,0.000057397425,0.000040894123,0.0009321847,0.0058456585,0.08601086,0.00017097531,0.0019437103,0.00031792314,0.9040162],"study_design_scores_gemma":[0.00026371397,0.00038063372,0.001485563,0.00075027416,0.000015410433,0.00015822616,4.3509021e-7,0.96601427,0.0010323699,0.027006127,0.001763041,0.0011299442],"about_ca_topic_score_codex":0.00003928762,"about_ca_topic_score_gemma":0.00005350478,"teacher_disagreement_score":0.9028863,"about_ca_system_score_codex":0.00036394858,"about_ca_system_score_gemma":0.0006430229,"threshold_uncertainty_score":0.99951917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7944997,0.0012956314,0.20320795,0.00012109035,0.00015850429,0.00026408734,0.0001969196,0.0000029776572,0.00025317047],"genre_scores_gemma":[0.9974271,0.000289397,0.00203466,0.00009817964,0.00010583062,0.0000014480227,0.000013693988,0.0000042101947,0.000025487665],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9994404,0.000017672943,0.00014265973,0.00025486134,0.000075139105,0.00006931952],"domain_scores_gemma":[0.9995639,0.000073933945,0.00013204756,0.00012519794,0.00008451237,0.000020446127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002856945,0.000090169444,0.000107538996,0.00010143019,0.00004409275,0.000023345901,0.00007049403,0.00009474351,0.000003834746],"category_scores_gemma":[0.00007079525,0.000067631445,0.000013901297,0.000049886956,0.00015642228,0.000009315067,0.000095198244,0.00006255084,1.3014296e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032926773,0.00012835958,0.02388642,0.0003973975,0.000102401355,0.00015982064,0.0023262743,0.00444113,0.7658857,0.007933967,0.00005292851,0.19435632],"study_design_scores_gemma":[0.0020444896,0.00128474,0.68401664,0.00070557336,0.0001360174,0.0013357643,0.000011031501,0.20057437,0.027013872,0.07876549,0.0028917086,0.0012202816],"about_ca_topic_score_codex":0.000041899948,"about_ca_topic_score_gemma":0.0002725421,"teacher_disagreement_score":0.7388719,"about_ca_system_score_codex":0.000010381382,"about_ca_system_score_gemma":0.000059401176,"threshold_uncertainty_score":0.27579302},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8193629,0.0022263408,0.11357452,0.01331796,0.026204515,0.0020952714,0.0009961288,0.0003230779,0.021899277],"genre_scores_gemma":[0.98791045,0.00007027126,0.006060338,0.0028069166,0.0028423364,0.0000035357132,0.00004310746,0.000027455877,0.0002355709],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741423,0.00012563827,0.00035913658,0.00039895924,0.0009198802,0.0007821473],"domain_scores_gemma":[0.9972526,0.0018115557,0.0001835198,0.0003800808,0.00017888687,0.00019338474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005088307,0.00027086446,0.00040906106,0.0002762669,0.0007046487,0.00016322646,0.0015861506,0.00036252372,0.00015775021],"category_scores_gemma":[0.00028102388,0.0002869205,0.000048733,0.000354387,0.0018625265,0.00011841058,0.00030917296,0.00090578385,0.00000924738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.000008328743,0.00010202429,0.021376137,0.000038491544,0.000029694193,0.00021293836,0.64673924,0.0013554094,0.000008525936,0.0069711427,0.00019325915,0.3229648],"study_design_scores_gemma":[0.0019391277,0.00048536193,0.015142802,0.0063925614,0.000091524555,0.000017189026,0.00591359,0.016912824,0.000522444,0.7298647,0.21648857,0.006229281],"about_ca_topic_score_codex":0.95037264,"about_ca_topic_score_gemma":0.9972564,"teacher_disagreement_score":0.7228936,"about_ca_system_score_codex":0.0013649452,"about_ca_system_score_gemma":0.006897342,"threshold_uncertainty_score":0.9999583},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081946794,0.000091036556,0.99301326,0.00042469788,0.0003026082,0.00020491706,0.000009823042,0.00015293498,0.004981252],"genre_scores_gemma":[0.7735163,0.000042371747,0.22354564,0.00049579033,0.00034177245,0.0000025825866,0.000012596044,0.000046523983,0.0019964522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979033,0.000048138707,0.0003521325,0.00073441135,0.00051407015,0.00044794197],"domain_scores_gemma":[0.9985103,0.00033766325,0.00038417897,0.0006264306,0.000081193684,0.000060253427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005582378,0.00025153847,0.0003725005,0.0008409911,0.00007835321,0.00035437936,0.0020671694,0.00026189708,0.000019092031],"category_scores_gemma":[0.00003202767,0.00025374957,0.00009350262,0.00057808857,0.0001550812,0.0010948356,0.00096524076,0.00042801307,0.000007380417],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006929918,0.00023389583,0.020798082,0.00038728744,0.000085782005,0.00019041159,0.0037495582,0.01428444,0.00018687386,0.013544926,0.0011733868,0.94529605],"study_design_scores_gemma":[0.0006348515,0.0005227716,0.0011852242,0.0013053304,0.000008369969,0.000017399816,0.0000011262921,0.84567493,0.0028609699,0.11145595,0.035331678,0.0010014126],"about_ca_topic_score_codex":0.00003318027,"about_ca_topic_score_gemma":0.00010933625,"teacher_disagreement_score":0.94429463,"about_ca_system_score_codex":0.00051724014,"about_ca_system_score_gemma":0.00038320493,"threshold_uncertainty_score":0.9999915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005295939,0.00035965894,0.990863,0.0020494128,0.0015573119,0.00047382986,0.0000062872223,0.00047323343,0.0036876318],"genre_scores_gemma":[0.5126829,0.00018361762,0.47973135,0.0045040054,0.0012493393,0.00007277799,0.000018251321,0.00007658775,0.001481173],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964326,0.000028088005,0.0004897633,0.0016895563,0.0006535793,0.00070638285],"domain_scores_gemma":[0.99676555,0.00023028976,0.00030006206,0.0021972638,0.00034868554,0.00015813015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009927549,0.0004767971,0.0004962051,0.00072498515,0.00047371525,0.0003719642,0.0035699408,0.0006655773,0.00011332401],"category_scores_gemma":[0.00005989523,0.00045724455,0.00012011696,0.00076307217,0.0011699398,0.0004657209,0.0010942263,0.0010030784,0.00022947462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018223454,0.00016367399,0.000312043,0.000082974824,0.00004820277,0.00010788661,0.0010879332,0.0029021157,0.00048727586,0.2512406,0.00076627557,0.7427828],"study_design_scores_gemma":[0.00036680538,0.00028497458,0.00032369344,0.00018763599,0.000012519607,0.00017385428,1.7610691e-7,0.4735228,0.0050685825,0.4866303,0.032573033,0.00085561187],"about_ca_topic_score_codex":0.000081640814,"about_ca_topic_score_gemma":0.00022609178,"teacher_disagreement_score":0.74192715,"about_ca_system_score_codex":0.0003011986,"about_ca_system_score_gemma":0.00048470031,"threshold_uncertainty_score":0.9997879},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016047534,0.00036075964,0.9946657,0.00073809834,0.0014630887,0.00026860423,0.0000047240437,0.00008612195,0.0008081444],"genre_scores_gemma":[0.8346773,0.000019325716,0.16295996,0.0009368267,0.0008858102,0.0000027187514,0.0000032595442,0.000028324115,0.0004865001],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583685,0.00005245524,0.0008806195,0.0013141003,0.001153359,0.0007626079],"domain_scores_gemma":[0.9969815,0.00082358153,0.00050336827,0.0009632788,0.0005655735,0.00016269795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017566906,0.00048288633,0.000625128,0.00056871184,0.00044004197,0.000571562,0.005088211,0.00022318818,0.00002208295],"category_scores_gemma":[0.00024714365,0.00034061345,0.00024333132,0.00083336513,0.00065213337,0.00029198406,0.0019610804,0.000680697,0.00003563334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008544396,0.000038736376,0.00003975624,0.000034967125,0.00005913815,0.00003384699,0.0038326879,0.10957084,0.00009074491,0.14206618,0.000107646854,0.7441169],"study_design_scores_gemma":[0.000108106135,0.00020096355,0.00004561659,0.0006554854,0.000011305452,0.000022985645,0.0000018800838,0.9930668,0.00047827014,0.0034921463,0.0014825813,0.00043387694],"about_ca_topic_score_codex":0.000021333251,"about_ca_topic_score_gemma":0.0006058685,"teacher_disagreement_score":0.8834959,"about_ca_system_score_codex":0.00019049027,"about_ca_system_score_gemma":0.0003464335,"threshold_uncertainty_score":0.9999046},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012846879,0.00092175003,0.9800218,0.0005150587,0.006037738,0.0016054229,0.0000065720046,0.0005389354,0.009068059],"genre_scores_gemma":[0.8599581,0.000016040942,0.11472707,0.002661253,0.002606905,0.000070112845,0.00002022767,0.00019481355,0.019745462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937547,0.000068052446,0.0007269044,0.002630299,0.0016914889,0.0011285454],"domain_scores_gemma":[0.995764,0.00037592492,0.0005144288,0.0028962672,0.00018808401,0.00026129268],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013281833,0.00084924774,0.0007668413,0.0011189482,0.00030490072,0.0016252967,0.0056567322,0.00042810309,0.000013527933],"category_scores_gemma":[0.000060744427,0.0007342986,0.00024109577,0.0006295229,0.0003442072,0.00011547793,0.0031575593,0.0013584377,0.00019808981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009947747,0.00008234045,0.000010448186,0.00018114451,0.000034613364,0.00021436575,0.0017457114,0.20164038,0.00011159528,0.0055496576,0.00007447644,0.7903453],"study_design_scores_gemma":[0.0005499949,0.0005682243,0.00006378411,0.00122335,0.000015123187,0.00009197725,0.000003365448,0.9909787,0.0003381141,0.001329496,0.0036836504,0.0011541878],"about_ca_topic_score_codex":0.00009370343,"about_ca_topic_score_gemma":0.000021298823,"teacher_disagreement_score":0.8652947,"about_ca_system_score_codex":0.00060943654,"about_ca_system_score_gemma":0.00049777864,"threshold_uncertainty_score":0.99972314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029192776,0.00016806801,0.9921493,0.00010737831,0.0007569041,0.00018229718,0.0000033638194,0.0001123236,0.003601115],"genre_scores_gemma":[0.39226002,0.000018855111,0.60689175,0.00034615197,0.00024598924,0.0000023905395,0.0000020055816,0.00001825496,0.00021455112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973538,0.000027783666,0.0004983097,0.0009663677,0.00069780985,0.0004559409],"domain_scores_gemma":[0.99735206,0.00083717436,0.0004349277,0.0008895388,0.00034653448,0.00013973839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073820545,0.00038640364,0.0005025136,0.0005281849,0.00019223287,0.00026602054,0.0020709068,0.00018175581,0.000016087633],"category_scores_gemma":[0.00033831067,0.00034394494,0.000049721493,0.00048757088,0.0010718874,0.0004290197,0.0014807304,0.00061481184,0.000020386457],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004753839,0.000024129944,0.00118197,0.00012319483,0.00001186787,0.000029812902,0.0015967923,0.0064368774,0.0005435416,0.006010912,0.000009401728,0.98402673],"study_design_scores_gemma":[0.00023364641,0.00026326792,0.0013595369,0.0006884212,0.0000043845434,0.000054598604,1.2692121e-7,0.9400924,0.00085923064,0.0557573,0.00025359206,0.00043353962],"about_ca_topic_score_codex":0.000046973204,"about_ca_topic_score_gemma":0.000009934033,"teacher_disagreement_score":0.9835932,"about_ca_system_score_codex":0.000051494328,"about_ca_system_score_gemma":0.0002633645,"threshold_uncertainty_score":0.99990124},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010890425,0.00020496095,0.99567086,0.00030872406,0.0018148529,0.0009647124,0.000002973061,0.00061991723,0.00030410296],"genre_scores_gemma":[0.017410407,0.000031001386,0.9788683,0.0015177327,0.0016212623,0.000067829045,0.000010426586,0.00005357239,0.00041945573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955156,0.000088653665,0.0007147953,0.0018043885,0.0009811319,0.00089545286],"domain_scores_gemma":[0.9969346,0.0011166646,0.00039606335,0.00083515997,0.00036955884,0.00034794363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017039501,0.0005320816,0.000568922,0.00065102533,0.00051527406,0.0006057822,0.0023213245,0.00039740375,0.00004979959],"category_scores_gemma":[0.0006030352,0.00050970813,0.00015645474,0.0007433959,0.0005278262,0.00073653593,0.0008954921,0.00086456165,0.00002808521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013673981,0.000025841156,0.00017134637,0.000024599512,0.000011981366,0.000014096744,0.00070229743,0.015002796,0.00041516882,0.00015046408,0.00012275891,0.983345],"study_design_scores_gemma":[0.00044266414,0.00051545416,0.00050404394,0.0005356905,0.000014026144,0.00004662411,3.748234e-7,0.97892916,0.0058768727,0.009487863,0.00293142,0.0007158212],"about_ca_topic_score_codex":0.000019016057,"about_ca_topic_score_gemma":0.0001993875,"teacher_disagreement_score":0.9826292,"about_ca_system_score_codex":0.00037495737,"about_ca_system_score_gemma":0.00022190991,"threshold_uncertainty_score":0.9997355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000103082755,0.00016431652,0.99467963,0.0012840135,0.0010802527,0.0013903939,0.000018335044,0.00005139983,0.0012286027],"genre_scores_gemma":[0.050329845,0.000008463582,0.9452076,0.002730461,0.0010275801,0.0001284365,0.000084460495,0.000022055408,0.00046110485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966157,0.00005536727,0.0005122548,0.0012838006,0.0010168945,0.0005159955],"domain_scores_gemma":[0.99803865,0.0005722886,0.00019741575,0.00084268855,0.00024800605,0.00010092566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018819836,0.0003823983,0.00036315894,0.00068660267,0.00029828624,0.00063770404,0.0023680548,0.00014735573,0.000008998016],"category_scores_gemma":[0.00006994574,0.00030323688,0.00009013334,0.0008683205,0.00022073326,0.00034849322,0.0004762601,0.00033452708,0.000025875395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072409595,0.00024262574,0.00001469116,0.00013017879,0.000019091847,0.00002138434,0.0075798226,0.6089344,0.000110685105,0.16858426,0.0015005055,0.21278995],"study_design_scores_gemma":[0.00041291176,0.00038117138,0.00012417082,0.00013326596,0.0000053136323,0.000060398244,0.0000018122727,0.8913923,0.0001282678,0.093662255,0.013239575,0.00045857744],"about_ca_topic_score_codex":0.000015001569,"about_ca_topic_score_gemma":0.00008270773,"teacher_disagreement_score":0.2824579,"about_ca_system_score_codex":0.00034949323,"about_ca_system_score_gemma":0.00026653844,"threshold_uncertainty_score":0.99994195},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049616094,0.00007841292,0.99590486,0.00021681532,0.0010952557,0.00039595203,0.000004333827,0.00078171043,0.0014730183],"genre_scores_gemma":[0.01802904,0.000016738715,0.98001045,0.00078899105,0.0004834569,0.000015856147,0.0000069323964,0.00004658851,0.0006019375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607944,0.000024351622,0.00052271795,0.0015435957,0.0011912768,0.0006386397],"domain_scores_gemma":[0.9973107,0.0001487885,0.000252695,0.0017663754,0.0003619889,0.0001594339],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007809491,0.0005388091,0.00042399077,0.0008668328,0.00017404558,0.00045866778,0.003730527,0.0003557726,0.000049561386],"category_scores_gemma":[0.000029456234,0.00052830274,0.00010832689,0.00051688054,0.00052091473,0.00092746963,0.0015363266,0.0005897912,0.00013736765],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003907236,0.000026682492,0.000048731355,0.000036734513,0.000014010529,0.000059290636,0.0007326383,0.010021255,0.00024285394,0.14009088,0.00032336093,0.84839964],"study_design_scores_gemma":[0.0003437916,0.00045812724,0.00018648402,0.000858451,0.000012346526,0.00007325395,5.5004463e-8,0.7966963,0.0056677773,0.14226775,0.051904768,0.001530917],"about_ca_topic_score_codex":0.000012571859,"about_ca_topic_score_gemma":0.000021959935,"teacher_disagreement_score":0.84686875,"about_ca_system_score_codex":0.00044162603,"about_ca_system_score_gemma":0.0003280245,"threshold_uncertainty_score":0.9997169},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049847766,0.0003059986,0.989317,0.00032208278,0.0012622679,0.0002621916,0.0000031010227,0.00014596102,0.007882922],"genre_scores_gemma":[0.11269649,0.000035310903,0.88254863,0.0012700729,0.0011764956,0.0000056620293,0.000015695572,0.000058244288,0.002193411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965494,0.000032475116,0.0005889628,0.0012720719,0.0010597274,0.00049732404],"domain_scores_gemma":[0.99700814,0.00020938613,0.00044301464,0.0018961855,0.00031860752,0.00012464468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010516826,0.00040207387,0.0004456466,0.0008555484,0.0001927242,0.00018734093,0.0031405375,0.00019328973,0.00005272202],"category_scores_gemma":[0.000089056346,0.0003635149,0.00011431646,0.00078081747,0.0007320768,0.00011687158,0.0029962137,0.00038718502,0.00006028778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011338156,0.00010126879,0.00007397158,0.00026614763,0.000039813836,0.00009708858,0.002118834,0.13086241,0.00040030992,0.16001585,0.00033870648,0.70567423],"study_design_scores_gemma":[0.00026863316,0.00021544404,0.000039205624,0.00086400873,0.000012772099,0.000032128326,2.3931162e-7,0.9408022,0.004241969,0.045471594,0.0074692396,0.00058253435],"about_ca_topic_score_codex":0.000026896809,"about_ca_topic_score_gemma":0.000022076136,"teacher_disagreement_score":0.8099398,"about_ca_system_score_codex":0.00013733997,"about_ca_system_score_gemma":0.00025789425,"threshold_uncertainty_score":0.9998817},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007636373,0.00013861111,0.996603,0.000118191034,0.002079445,0.00050641235,0.0000046955893,0.00042452564,0.000048716527],"genre_scores_gemma":[0.018359728,0.000011763534,0.9802057,0.00034168913,0.0009047418,0.000024317398,0.000011694734,0.000044790457,0.000095586634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707276,0.00003821853,0.00033478084,0.0014119281,0.00061648083,0.0005258471],"domain_scores_gemma":[0.9973641,0.0005475383,0.00020371172,0.0013013398,0.00046482065,0.00011850283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009710687,0.0004619277,0.00041288414,0.0005362114,0.00024915108,0.00042473184,0.0017424577,0.00028115176,0.0000027265276],"category_scores_gemma":[0.00012420896,0.00039460865,0.000066708264,0.00037244355,0.0004554164,0.0013006618,0.00031806243,0.000395663,0.0000049639193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008009532,0.000010934725,0.00000183507,0.00002380423,0.0000073387305,0.0000060012107,0.00029789683,0.82156396,0.0002929668,0.015367329,0.000007639277,0.16241229],"study_design_scores_gemma":[0.00014624087,0.00054817175,0.000006439552,0.000073462885,0.000009387991,0.000025362977,9.635771e-8,0.6797032,0.0012959602,0.31769702,0.00012866699,0.000366016],"about_ca_topic_score_codex":0.000002825161,"about_ca_topic_score_gemma":0.000035745015,"teacher_disagreement_score":0.3023297,"about_ca_system_score_codex":0.00020904519,"about_ca_system_score_gemma":0.00028634834,"threshold_uncertainty_score":0.9998506},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005053752,0.00084308704,0.9902816,0.0011677094,0.0011727286,0.00069738383,0.000006228252,0.00018154003,0.0056447093],"genre_scores_gemma":[0.014207927,0.00007419538,0.97577703,0.0010813164,0.00078326976,0.00006513904,0.000047904214,0.000042592834,0.007920609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969153,0.000022209984,0.0004164961,0.0014157462,0.0006450029,0.0005852466],"domain_scores_gemma":[0.99758023,0.00070889253,0.00025249578,0.000984117,0.00033835619,0.00013588423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048265155,0.0003918696,0.0003881001,0.00042752005,0.0004649068,0.00023700485,0.0023525832,0.00027157972,0.000034157787],"category_scores_gemma":[0.000069511465,0.00038906175,0.00017236339,0.0004252674,0.0004975219,0.00057284,0.00081354525,0.00065732456,0.00026815408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046301534,0.000042191048,0.000068609945,0.000044108245,0.00001477525,0.000009373691,0.00030308738,0.24652694,0.000072353076,0.28743085,0.00040190853,0.46508116],"study_design_scores_gemma":[0.00021453122,0.00014154485,0.00017741873,0.000102809245,0.000004959488,0.000039313403,1.6030519e-7,0.8103543,0.000040169387,0.13896036,0.049539305,0.00042512122],"about_ca_topic_score_codex":0.0000034150978,"about_ca_topic_score_gemma":0.000008663355,"teacher_disagreement_score":0.56382734,"about_ca_system_score_codex":0.00031152408,"about_ca_system_score_gemma":0.000633586,"threshold_uncertainty_score":0.9998561},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002157656,0.0009181887,0.9955436,0.00030473518,0.0013434173,0.0006021534,0.000029634724,0.00095892994,0.00027774417],"genre_scores_gemma":[0.0027829772,0.00021195807,0.99555784,0.0006450405,0.000458128,0.000018067352,0.000011734053,0.000065021675,0.00024925155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954332,0.000041850173,0.00067580916,0.0019620454,0.0011017633,0.00078530965],"domain_scores_gemma":[0.996439,0.00016069754,0.00031146858,0.0020050392,0.0008461214,0.00023770818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008303412,0.00079015724,0.00079189404,0.0009159807,0.00021403114,0.0004852659,0.004654713,0.00048283735,0.000026102973],"category_scores_gemma":[0.000026656704,0.00074429787,0.00014973679,0.0010522451,0.00071678375,0.0007542178,0.001977725,0.0009916497,0.000045787878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032786934,0.000054610166,0.000004506653,0.00005972172,0.00001782377,0.000074661904,0.0014695039,0.2995352,0.000025500056,0.03499995,0.00004723563,0.663708],"study_design_scores_gemma":[0.00016558779,0.00016981387,0.000006280655,0.00068811263,0.000007210202,0.00002347985,4.7971373e-8,0.9367654,0.00081547705,0.04434567,0.016234307,0.0007786458],"about_ca_topic_score_codex":0.000025888543,"about_ca_topic_score_gemma":0.00005293418,"teacher_disagreement_score":0.66292936,"about_ca_system_score_codex":0.00049918453,"about_ca_system_score_gemma":0.0009379208,"threshold_uncertainty_score":0.9995008},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036849,0.00024573598,0.99111617,0.00008715011,0.0028864415,0.0010409241,0.000062475236,0.0005214608,0.00035474295],"genre_scores_gemma":[0.57158417,0.0000056640156,0.42661136,0.00085856696,0.0005804796,0.00008707844,0.000026713617,0.000106072825,0.00013992902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948119,0.000042825664,0.0008824877,0.0022513256,0.0009175129,0.0010939336],"domain_scores_gemma":[0.9965139,0.00069805305,0.0005357996,0.00152151,0.00049160083,0.00023911922],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00068275136,0.0008419028,0.0009184207,0.0014570258,0.00029700392,0.001876397,0.003611358,0.0003204517,0.000004187602],"category_scores_gemma":[0.00012117847,0.00084940175,0.00026197918,0.0008868871,0.0009791683,0.0011383989,0.0010090764,0.00039027084,0.00004490404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004798308,0.0009596618,0.000765823,0.0041996306,0.00056635326,0.0027034546,0.0015200202,0.123983406,0.0370663,0.006304355,0.00029182754,0.82115936],"study_design_scores_gemma":[0.0030570829,0.0006308567,0.00018502325,0.0024354835,0.00012470073,0.00025333682,3.1167303e-7,0.911087,0.06682096,0.013805291,0.00026346577,0.0013365303],"about_ca_topic_score_codex":0.00004287417,"about_ca_topic_score_gemma":0.00007669034,"teacher_disagreement_score":0.8198228,"about_ca_system_score_codex":0.001215172,"about_ca_system_score_gemma":0.0016041286,"threshold_uncertainty_score":0.99939567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005011587,0.0001889365,0.99609154,0.00051067636,0.001346959,0.00024923275,0.0000075478,0.0002932074,0.001261772],"genre_scores_gemma":[0.0058621923,0.000025099407,0.99341035,0.0003395255,0.0002313831,0.000005654349,0.0000027378528,0.000022616687,0.000100418714],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971261,0.000049348735,0.00054488756,0.0012094427,0.00064957456,0.0004206523],"domain_scores_gemma":[0.9950719,0.0014836212,0.00031284985,0.0024267535,0.00060445827,0.000100411395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012888424,0.0003655561,0.0005019032,0.00052795693,0.00010681914,0.00009456203,0.0038499997,0.0002479934,0.000035743215],"category_scores_gemma":[0.0006378607,0.00034785282,0.0000892287,0.00092761475,0.0008267902,0.00040588801,0.001322406,0.00045882934,0.00003178301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009402193,0.000059259448,0.000070327085,0.00024667915,0.00002240474,0.000023158764,0.0032075036,0.36581007,0.0009945106,0.0797932,0.00004895757,0.54971457],"study_design_scores_gemma":[0.0001156774,0.00011928196,0.0004731745,0.00026493895,0.0000057362518,0.000025675516,1.895147e-7,0.07851646,0.0063917185,0.9124081,0.0011429277,0.0005360914],"about_ca_topic_score_codex":0.000020069025,"about_ca_topic_score_gemma":0.00004229305,"teacher_disagreement_score":0.83261496,"about_ca_system_score_codex":0.00022246082,"about_ca_system_score_gemma":0.00036584432,"threshold_uncertainty_score":0.99989736},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006625866,0.00017488729,0.9966187,0.00013969283,0.000644294,0.0004599767,0.000019450583,0.000486566,0.0013901788],"genre_scores_gemma":[0.03348809,0.000024009914,0.96429163,0.0006597962,0.0011763375,0.000042637974,0.000025293462,0.00007797154,0.00021423654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844366,0.000003992685,0.00029639376,0.0006132319,0.00026321152,0.00037951028],"domain_scores_gemma":[0.99896204,0.00013976249,0.000077138706,0.0005548599,0.00019003768,0.00007614139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002754404,0.00033687742,0.00030593487,0.00028439428,0.00017910417,0.00024590117,0.0008130824,0.00019577924,0.000034551747],"category_scores_gemma":[0.000009704782,0.00031821866,0.00008136888,0.00018372582,0.00042513155,0.00015501009,0.00021674487,0.00034030984,0.000030496632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068083145,0.000017858447,0.0000026251837,0.00016033804,0.000011969969,0.0000063195366,0.00029606954,0.04992564,0.00135475,0.0020660204,0.0030965437,0.94305503],"study_design_scores_gemma":[0.0001682536,0.00010987122,0.000004106792,0.00031381514,0.0000091333695,0.000018911012,3.0584495e-8,0.89385885,0.005538666,0.08263787,0.01692,0.0004205108],"about_ca_topic_score_codex":0.000004051447,"about_ca_topic_score_gemma":0.000016708955,"teacher_disagreement_score":0.9426345,"about_ca_system_score_codex":0.00014443434,"about_ca_system_score_gemma":0.00007682516,"threshold_uncertainty_score":0.999927},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049506474,0.00014662319,0.9964492,0.0007909925,0.00094228523,0.00042623034,0.000008573393,0.00010550524,0.0010810855],"genre_scores_gemma":[0.05215032,0.00004578243,0.9462938,0.0008833353,0.00033847394,0.000014273759,0.000005254016,0.000018138473,0.00025062752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772924,0.000039014594,0.00033380673,0.0011115553,0.00041936187,0.00036701834],"domain_scores_gemma":[0.99786437,0.00096353417,0.00024905332,0.00049867784,0.00031456715,0.00010978248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080668856,0.00031077812,0.00032138327,0.00036650666,0.0002723922,0.00036139615,0.00077560905,0.00020171168,0.000025226906],"category_scores_gemma":[0.00041756357,0.0002924426,0.00006497364,0.00022853383,0.00078190764,0.0004733395,0.0004176095,0.00029530295,0.00000960076],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014953421,0.000008940121,0.000012419563,0.000032786433,0.000009094616,0.0000081546195,0.006943531,0.006315675,0.000039815695,0.099198125,0.000026222076,0.88739026],"study_design_scores_gemma":[0.0002527731,0.00019212627,0.000037811435,0.00017748062,0.0000042917272,0.00003234023,0.0000015349593,0.71651495,0.00014631539,0.28178385,0.00051750895,0.00033905794],"about_ca_topic_score_codex":0.000017229686,"about_ca_topic_score_gemma":0.00015629032,"teacher_disagreement_score":0.8870512,"about_ca_system_score_codex":0.00014311573,"about_ca_system_score_gemma":0.00030121277,"threshold_uncertainty_score":0.9999528},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027682725,0.00011889525,0.99127305,0.00016865082,0.0029240784,0.00041383956,0.0000019939966,0.0013264599,0.0010047562],"genre_scores_gemma":[0.20499088,0.000002265499,0.79375833,0.0005451282,0.000565013,0.0000056505733,0.0000029368084,0.000038096903,0.000091706745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532264,0.000058066482,0.00065409223,0.0019387031,0.0012083863,0.00081811164],"domain_scores_gemma":[0.9969777,0.00023336377,0.00042309714,0.0017624559,0.0004133516,0.000190019],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011469636,0.00058393955,0.000524478,0.0009637665,0.00039651568,0.00085293513,0.0033572316,0.00039090737,0.000034826695],"category_scores_gemma":[0.000059570386,0.000570869,0.00014417237,0.00074078346,0.00042846642,0.00079132814,0.001132637,0.00064764865,0.00006927809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011668553,0.00012636468,0.0007658604,0.00029568572,0.000056345387,0.0002843949,0.0022798644,0.5773025,0.0041524554,0.008132783,0.000034310062,0.40655777],"study_design_scores_gemma":[0.0002623694,0.00008501058,0.00007359872,0.0007738462,0.000012101119,0.000040140138,1.00346924e-7,0.9747218,0.0016658752,0.021641685,0.00010988229,0.0006135844],"about_ca_topic_score_codex":0.000043568867,"about_ca_topic_score_gemma":0.000032033728,"teacher_disagreement_score":0.40594417,"about_ca_system_score_codex":0.0008538326,"about_ca_system_score_gemma":0.0015350644,"threshold_uncertainty_score":0.99967426},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001498157,0.000072431925,0.995484,0.0004026613,0.0012770719,0.00044266292,0.000015572028,0.00010986484,0.00069759804],"genre_scores_gemma":[0.27494225,0.00013672357,0.7172227,0.0024440621,0.004499514,0.000032384098,0.00013780114,0.00006775347,0.0005168284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976221,0.000037917445,0.00030346273,0.0011430688,0.00049572147,0.00039774485],"domain_scores_gemma":[0.99824,0.0007321156,0.00021972634,0.00041292844,0.00025287876,0.00014235573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008359098,0.00030852584,0.00029368774,0.00047384392,0.00039311106,0.00037775293,0.00060269085,0.00037672275,0.000051192455],"category_scores_gemma":[0.000100296464,0.00030122735,0.00009633311,0.0002712628,0.00059257064,0.0008127848,0.0003928309,0.0006349519,0.000030218604],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052850737,0.000030489793,0.000008676087,0.000025566496,0.000011716805,0.000008250356,0.00019695138,0.0005163733,0.00011212045,0.005387644,0.00006295768,0.9935864],"study_design_scores_gemma":[0.00035539924,0.00033774553,0.00029436403,0.00019781892,0.000009780064,0.000056967314,4.107505e-8,0.55417705,0.00036082487,0.44255376,0.0012498101,0.00040646107],"about_ca_topic_score_codex":0.0000026576301,"about_ca_topic_score_gemma":0.00002105746,"teacher_disagreement_score":0.9931799,"about_ca_system_score_codex":0.00014142488,"about_ca_system_score_gemma":0.00015321844,"threshold_uncertainty_score":0.999944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043107415,0.00053547247,0.9949352,0.00017035304,0.00032348398,0.00028099684,0.000009853493,0.00044122257,0.0032602674],"genre_scores_gemma":[0.035381112,0.000045636625,0.9623067,0.00035406905,0.0013803081,0.00004823362,0.000010848027,0.00007359044,0.00039952234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988237,0.0000020400123,0.00024023371,0.00043821233,0.00017895052,0.0003168568],"domain_scores_gemma":[0.99922776,0.00011191645,0.000065277,0.00040961886,0.00013445556,0.000050951097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000277589,0.00023928865,0.00023310586,0.00020547998,0.00015821954,0.00016657695,0.00056269596,0.00015731645,0.000031332038],"category_scores_gemma":[0.000030675103,0.00023455272,0.00005936885,0.00016735109,0.00027035616,0.00010321058,0.00012325833,0.00028176937,0.000020947315],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010969169,0.0000025027114,0.0000021679057,0.00011331484,0.0000046665723,0.0000024347253,0.00016397118,0.006000526,0.000771317,0.0008873709,0.00031245867,0.9917382],"study_design_scores_gemma":[0.00011859401,0.000044459586,0.000010488,0.0007796308,0.000013476044,0.000021587688,7.878959e-8,0.81767386,0.015061713,0.13283627,0.03283501,0.0006048227],"about_ca_topic_score_codex":0.0000028184552,"about_ca_topic_score_gemma":0.000004180067,"teacher_disagreement_score":0.99113333,"about_ca_system_score_codex":0.00013349587,"about_ca_system_score_gemma":0.00007539407,"threshold_uncertainty_score":0.95647824},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010478345,0.0003272994,0.9772497,0.0008806077,0.0012322523,0.0005172084,0.0000019232002,0.000107003354,0.018636161],"genre_scores_gemma":[0.75702316,0.000010870226,0.23730385,0.0025821072,0.0017184269,0.00003205301,0.000014126376,0.000038584298,0.0012768492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960673,0.00013374831,0.00057507906,0.0013950994,0.0011832578,0.0006455594],"domain_scores_gemma":[0.9971707,0.00095534255,0.00027268563,0.0013147738,0.00019937784,0.00008712921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026931104,0.00046531134,0.00038601478,0.00065311085,0.0005070423,0.000714928,0.0038752914,0.0003574689,0.000045707315],"category_scores_gemma":[0.0004421686,0.00032930105,0.00014191297,0.00066322106,0.00064526236,0.00075990614,0.00092251215,0.0013394703,0.0001328378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000712172,0.00011402642,0.0013576592,0.000037628924,0.000014712792,0.00010863767,0.013472101,0.009689508,0.00003254774,0.64312345,0.00030823913,0.3317344],"study_design_scores_gemma":[0.0003807496,0.00015646404,0.0069216765,0.00031657156,0.000007417881,0.00012841112,6.0959275e-7,0.47579843,0.00006162639,0.5087837,0.0067282957,0.00071608153],"about_ca_topic_score_codex":0.000024807987,"about_ca_topic_score_gemma":0.00016453491,"teacher_disagreement_score":0.7559753,"about_ca_system_score_codex":0.0003385587,"about_ca_system_score_gemma":0.0006432112,"threshold_uncertainty_score":0.9999159},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015073502,0.00048265417,0.9946446,0.00047681478,0.0020253581,0.00055653346,0.0000058907863,0.00026424244,0.0013931664],"genre_scores_gemma":[0.09991903,0.00006445441,0.89126325,0.0030269553,0.0010285426,0.000021720434,0.00004087214,0.00009225165,0.0045429184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959477,0.00007623103,0.000644039,0.0016656707,0.0008658327,0.00080051273],"domain_scores_gemma":[0.99667364,0.0014517079,0.0005098776,0.00088764785,0.00029020372,0.0001869161],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015459418,0.0005816294,0.00059521483,0.0007207833,0.0006203688,0.0011853381,0.0025402838,0.00029629876,0.00003352591],"category_scores_gemma":[0.00044667572,0.0005514493,0.00018494064,0.0004501904,0.00029293387,0.0008224855,0.001053651,0.0011097423,0.000076615106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006181423,0.000008329296,0.000054415144,0.000025849005,0.00001082493,0.0000138103105,0.00089105,0.47310317,0.0004225166,0.025583753,0.000012115845,0.499868],"study_design_scores_gemma":[0.00042793955,0.00027548306,0.0000367949,0.00020403416,0.000006351818,0.000030631316,7.963245e-7,0.97600645,0.00030080852,0.006997486,0.015047357,0.0006658488],"about_ca_topic_score_codex":0.00001883478,"about_ca_topic_score_gemma":0.000059400412,"teacher_disagreement_score":0.50290334,"about_ca_system_score_codex":0.00020339536,"about_ca_system_score_gemma":0.00068320613,"threshold_uncertainty_score":0.9998515},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024151337,0.00035807226,0.99281543,0.001030597,0.0015122561,0.00047908426,0.00016170382,0.0005727523,0.0030459277],"genre_scores_gemma":[0.06611789,0.00008791549,0.92794466,0.002846898,0.0007591583,0.000021084745,0.00047808327,0.000099305726,0.0016450108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939687,0.00008419427,0.00066525704,0.0031751625,0.0010347667,0.0010718857],"domain_scores_gemma":[0.9925404,0.00037030282,0.00045560027,0.0058749453,0.00038797891,0.00037074886],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012017204,0.00070539996,0.00063249125,0.0011004626,0.00049417885,0.001088565,0.013428571,0.0005714332,0.0001717154],"category_scores_gemma":[0.00035094618,0.0006874171,0.00008395176,0.00074541755,0.0010478268,0.0015620623,0.0036508306,0.0013741805,0.00044957368],"study_design_candidate":"design_other","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.00000986347,0.00006700305,0.0005631749,0.00004000471,0.000056234938,0.00020507294,0.0020381415,0.0025716517,0.0013832323,0.008278119,0.001888541,0.98289895],"study_design_scores_gemma":[0.00031467475,0.000091014466,0.00040669998,0.00035258348,0.000011177572,0.000023660807,5.1835866e-7,0.9004963,0.001635875,0.026449932,0.06915645,0.0010611108],"about_ca_topic_score_codex":0.0066029993,"about_ca_topic_score_gemma":0.02571802,"teacher_disagreement_score":0.98183787,"about_ca_system_score_codex":0.00080182997,"about_ca_system_score_gemma":0.0017963,"threshold_uncertainty_score":0.9999484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047255653,0.0004786932,0.99284446,0.0009516373,0.0022738776,0.00061139354,0.0000050544622,0.00041458695,0.002373019],"genre_scores_gemma":[0.16002043,0.00006701352,0.8309932,0.0052413745,0.0031169306,0.000040219456,0.000021916898,0.00008915557,0.0004097981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99513173,0.00005185071,0.00066163525,0.002108951,0.00094699435,0.0010988263],"domain_scores_gemma":[0.99597657,0.0007160732,0.0004540196,0.0022120685,0.0003282244,0.00031303958],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046002853,0.0006983436,0.00061291695,0.0003781651,0.0006337446,0.00045746894,0.004860347,0.00038019769,0.00009484779],"category_scores_gemma":[0.000037776746,0.0006402271,0.00015974385,0.0009319649,0.001824413,0.00069892494,0.002477527,0.001104836,0.00015482845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057740426,0.000019278357,0.000031774107,0.000015558511,0.000008184481,0.000082707265,0.00019007888,0.29917252,0.000056374527,0.016799392,0.00023823787,0.6833801],"study_design_scores_gemma":[0.0001699896,0.0001086538,0.00005512047,0.00020762086,0.000005869894,0.00014450387,8.4189544e-8,0.780871,0.00018734057,0.21394166,0.0036975038,0.0006106495],"about_ca_topic_score_codex":0.0000035616754,"about_ca_topic_score_gemma":0.00005585709,"teacher_disagreement_score":0.6827695,"about_ca_system_score_codex":0.00023315578,"about_ca_system_score_gemma":0.00023484591,"threshold_uncertainty_score":0.9996049},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008125589,0.00018128287,0.9959135,0.0008395359,0.00076170464,0.0009890228,0.00002021612,0.0002874828,0.00019466637],"genre_scores_gemma":[0.25688535,0.000021768974,0.7391149,0.0028334376,0.0001566171,0.000061025083,0.000017447406,0.00008393528,0.00082551944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947426,0.00008936595,0.0010060981,0.0020214487,0.0012864432,0.00085407624],"domain_scores_gemma":[0.99575776,0.00097102404,0.0007165701,0.0014456114,0.0007395667,0.0003694698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001164942,0.00074266194,0.00080679904,0.00073223293,0.00027713572,0.00039555223,0.0035003861,0.000343514,0.000074890195],"category_scores_gemma":[0.0007695914,0.00072704215,0.00014258377,0.0010809649,0.00090063794,0.00049057725,0.0013518145,0.000688307,0.00003869861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002155259,0.0006291287,0.00026606102,0.0003535072,0.00024145881,0.00005355411,0.04015973,0.38965264,0.07318499,0.017597692,0.01475913,0.46288657],"study_design_scores_gemma":[0.0007465543,0.0019934452,0.000094184434,0.0011345455,0.000039450944,0.0000356413,0.0000014940017,0.8859174,0.058152985,0.049109306,0.0010005891,0.0017743813],"about_ca_topic_score_codex":0.000039100294,"about_ca_topic_score_gemma":0.000008392635,"teacher_disagreement_score":0.49626476,"about_ca_system_score_codex":0.00045399964,"about_ca_system_score_gemma":0.000419982,"threshold_uncertainty_score":0.99951804},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047265742,0.00034551643,0.94267917,0.0000794781,0.008285028,0.0008991331,7.068616e-7,0.00014252681,0.00030269835],"genre_scores_gemma":[0.8407398,0.000015534017,0.15664202,0.0002846614,0.002223387,0.000010524962,0.000008640083,0.000048235033,0.000027194916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99525577,0.00021547843,0.0010292878,0.0015844132,0.0010451908,0.0008698831],"domain_scores_gemma":[0.9966539,0.0014043528,0.00051632564,0.0010612279,0.00025218565,0.00011199826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032188802,0.00068826135,0.00083594944,0.0010744263,0.00047055105,0.00039505796,0.0025768294,0.00035863116,0.0000018298895],"category_scores_gemma":[0.00013450216,0.00053376774,0.00021672204,0.0010014261,0.0005413669,0.00041809707,0.0014283835,0.0011415103,0.0000399777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020764382,0.000022374867,0.00018136635,0.000063227475,0.000008600133,0.000017164868,0.0027689335,0.8093242,0.00009903629,0.00020416496,0.000015507867,0.18727463],"study_design_scores_gemma":[0.00067851925,0.00065584097,0.00010227581,0.0013033801,0.000009651291,0.00002661953,6.220112e-7,0.9913142,0.0008278191,0.0045078616,0.000055715656,0.00051750825],"about_ca_topic_score_codex":0.00007506774,"about_ca_topic_score_gemma":0.000033508124,"teacher_disagreement_score":0.7934741,"about_ca_system_score_codex":0.00043096388,"about_ca_system_score_gemma":0.00020804274,"threshold_uncertainty_score":0.9997114},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025196954,0.000036058773,0.99671704,0.0008741622,0.00045573612,0.0005239731,0.00012174137,0.00013804357,0.0011080327],"genre_scores_gemma":[0.16236241,0.00002416063,0.8244985,0.009742633,0.0011943958,0.000033355896,0.00078257313,0.000087655004,0.0012743302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970947,0.000018189408,0.0002946153,0.0013775558,0.0006978288,0.00051712483],"domain_scores_gemma":[0.99817795,0.00010806953,0.00019923405,0.0011312912,0.000120763965,0.00026269426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039474742,0.00038266738,0.00031424724,0.000653952,0.00032240292,0.00059241377,0.0017519125,0.00021202714,0.000116408606],"category_scores_gemma":[0.000010903268,0.00032945265,0.000045078352,0.00061675935,0.00020594541,0.00064061437,0.00061195256,0.00044905246,0.00033209028],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063568106,0.00010734725,0.000045400397,0.00011368575,0.000053825068,0.00009927148,0.0050973506,0.007186956,0.00055924576,0.0316639,0.009912216,0.9450972],"study_design_scores_gemma":[0.00094916136,0.0007178017,0.00008899088,0.0008481924,0.000030350335,0.00020665313,0.000003577176,0.6526979,0.00078442745,0.29086676,0.05124556,0.0015606253],"about_ca_topic_score_codex":0.00001662083,"about_ca_topic_score_gemma":0.0010115621,"teacher_disagreement_score":0.9435366,"about_ca_system_score_codex":0.00044456884,"about_ca_system_score_gemma":0.00039552498,"threshold_uncertainty_score":0.9999158},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024441184,0.00011396615,0.9975226,0.00024664035,0.0007444539,0.00070333,0.000007922679,0.00016848517,0.00046817726],"genre_scores_gemma":[0.017057857,0.000036220714,0.98202026,0.000106878826,0.00033465415,0.00003588349,0.000004266487,0.000037017075,0.0003669571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995881,0.00002995962,0.0006222862,0.0015442381,0.001185534,0.0007369534],"domain_scores_gemma":[0.9969235,0.00060876104,0.0003518784,0.0012433846,0.0007027887,0.0001696746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082141627,0.00042542294,0.00057720114,0.0007863867,0.00022796754,0.0002925028,0.0034842738,0.00028009815,0.000006738113],"category_scores_gemma":[0.00015182824,0.00040093772,0.00014651503,0.0006468304,0.00073916384,0.0008079867,0.0019174828,0.0004689117,0.000009135413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010531902,0.000025247233,0.000003704341,0.00012375755,0.00001299452,0.00001337721,0.0014671844,0.8550413,0.0001118492,0.0016625905,0.000007881017,0.14151956],"study_design_scores_gemma":[0.00023531931,0.00022822822,0.000002076894,0.000118805845,0.00000594211,0.000039573933,3.329373e-7,0.87245965,0.0010808931,0.12543021,0.000049887385,0.0003490826],"about_ca_topic_score_codex":0.000024737094,"about_ca_topic_score_gemma":0.000074371324,"teacher_disagreement_score":0.14117049,"about_ca_system_score_codex":0.00045678808,"about_ca_system_score_gemma":0.0007619932,"threshold_uncertainty_score":0.99984425},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000053380954,0.000049567032,0.9947647,0.0005347984,0.002077651,0.00027597608,0.00001836781,0.000055540248,0.0022180546],"genre_scores_gemma":[0.042180233,0.00012984374,0.9409476,0.0087531,0.0026107735,0.000017248976,0.00014605447,0.00009766356,0.0051174974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974896,0.00001417251,0.00042366647,0.0010877027,0.00055994734,0.00042493548],"domain_scores_gemma":[0.9977022,0.00032525655,0.0003154922,0.0010042996,0.00051951513,0.00013323723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053796114,0.00034080842,0.0003522378,0.00079798466,0.00020772872,0.0005869302,0.0023143382,0.000202156,0.00005759039],"category_scores_gemma":[0.00014244458,0.00032166694,0.00013759783,0.0005293817,0.00042259775,0.00072296156,0.00076946884,0.0002935895,0.00008816621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002865535,0.00012714512,0.000045768553,0.00017268657,0.000104334,0.00005641272,0.003035839,0.03056982,0.0003614152,0.2542542,0.004711746,0.706532],"study_design_scores_gemma":[0.00018809138,0.00017909824,0.0000052580317,0.00016813938,0.000013601749,0.000017253999,4.645513e-7,0.87722206,0.0015657928,0.09588159,0.024358636,0.00040001312],"about_ca_topic_score_codex":0.000004347246,"about_ca_topic_score_gemma":0.000034827593,"teacher_disagreement_score":0.84665227,"about_ca_system_score_codex":0.0002455984,"about_ca_system_score_gemma":0.00034923237,"threshold_uncertainty_score":0.9999235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.009319e-7,0.00022018801,0.99594903,0.0011762985,0.0016374781,0.00053437066,0.000029106546,0.000098616954,0.00035433267],"genre_scores_gemma":[0.0031678383,0.00010288575,0.9919037,0.0035005445,0.0007540969,0.000013248253,0.000022125187,0.000037588918,0.0004979237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996571,0.00004102586,0.0005508618,0.0014245906,0.0007826555,0.0006298747],"domain_scores_gemma":[0.996271,0.0010329369,0.00037254,0.0014001073,0.00070354156,0.00021987465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010017349,0.0004868894,0.0005094397,0.0008677443,0.00031594315,0.0008359098,0.0035280806,0.0004114595,0.000053074935],"category_scores_gemma":[0.0006246215,0.00045880157,0.00016976947,0.00092482415,0.00076325395,0.0005977956,0.00091659056,0.00048597454,0.00009087892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016803806,0.00008467143,0.000012577769,0.00012394848,0.00006698352,0.000048351587,0.0029990706,0.03918909,0.00003419949,0.8185058,0.0017746211,0.13714388],"study_design_scores_gemma":[0.00012119056,0.00019187065,0.000003319846,0.0003394364,0.000020868532,0.000012907008,7.011327e-7,0.5850285,0.00043436367,0.40988937,0.0035414558,0.00041598955],"about_ca_topic_score_codex":0.0000048932307,"about_ca_topic_score_gemma":0.000008579061,"teacher_disagreement_score":0.5458394,"about_ca_system_score_codex":0.00027196817,"about_ca_system_score_gemma":0.0008169972,"threshold_uncertainty_score":0.9997864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027934158,0.00007156083,0.9937983,0.00046576106,0.0010106224,0.00020483662,0.00002719125,0.00010417119,0.00428963],"genre_scores_gemma":[0.19257984,0.00007031856,0.7884995,0.011372733,0.0019477138,0.0000070721526,0.0004031021,0.0001313954,0.004988386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99610955,0.000033093816,0.00063805433,0.001427934,0.0012167131,0.0005746816],"domain_scores_gemma":[0.9973197,0.00021555905,0.0004075048,0.0012201854,0.0006138396,0.00022318577],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057340576,0.000493578,0.00049393007,0.0010572782,0.0003753303,0.00079963,0.0035698528,0.00024640365,0.00018984672],"category_scores_gemma":[0.00006560044,0.00048426527,0.00015537356,0.00081932225,0.0009840291,0.0006627976,0.0015620257,0.00047039444,0.00024316879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014229075,0.00031482044,0.00034807817,0.0001608009,0.00018598344,0.00038752906,0.0038566377,0.19708553,0.00021689956,0.6071632,0.0048074084,0.1854589],"study_design_scores_gemma":[0.0003119714,0.00014292091,0.000066514775,0.00020317812,0.000013300932,0.000031270138,3.6241303e-7,0.79451895,0.00021182085,0.20015575,0.0037750911,0.0005689011],"about_ca_topic_score_codex":0.0000075985668,"about_ca_topic_score_gemma":0.000034667828,"teacher_disagreement_score":0.5974334,"about_ca_system_score_codex":0.00029001027,"about_ca_system_score_gemma":0.00050183444,"threshold_uncertainty_score":0.9997609},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016427708,0.00054734905,0.9964678,0.00044960744,0.00049728225,0.00033888582,9.896877e-7,0.0003155069,0.0012182578],"genre_scores_gemma":[0.13400406,0.0000056176223,0.8644408,0.001081618,0.00023334767,0.000017856491,0.0000033836411,0.000019150144,0.00019416104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966551,0.000026536725,0.00045941808,0.0012701722,0.00083940977,0.0007493743],"domain_scores_gemma":[0.99838924,0.00028456954,0.0001815935,0.00076716405,0.00021009031,0.00016736475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009469936,0.00039845484,0.00039038208,0.0011910227,0.00025337486,0.00056000357,0.0032049539,0.00030402758,0.00004221249],"category_scores_gemma":[0.00030071457,0.00035047598,0.000076972894,0.00094459165,0.00033727134,0.000943043,0.0023236359,0.0009539602,0.000065219436],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013251751,0.000059270405,0.00007093709,0.000029139801,0.000007656314,0.00023907627,0.007923253,0.008290443,0.0016788101,0.063463986,0.000050985895,0.9181732],"study_design_scores_gemma":[0.0003064197,0.0006908848,0.00004534196,0.00088743964,0.0000043950204,0.00006038978,0.0000013673936,0.5103243,0.016366286,0.46874377,0.0013447178,0.0012246998],"about_ca_topic_score_codex":0.000019569225,"about_ca_topic_score_gemma":0.000079777645,"teacher_disagreement_score":0.9169485,"about_ca_system_score_codex":0.0003910161,"about_ca_system_score_gemma":0.00028954793,"threshold_uncertainty_score":0.99989474},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.5377366e-8,0.49789688,0.5004793,0.000078878365,0.00070126634,0.0007380446,9.987369e-7,0.00010363078,9.513537e-7],"genre_scores_gemma":[0.0000041306903,0.5072638,0.49223456,0.00019586887,0.00018771508,0.000093772935,0.000003197063,0.000016152137,8.2762045e-7],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99611276,0.000258589,0.00090844766,0.0013757348,0.0005332169,0.0008112429],"domain_scores_gemma":[0.9965952,0.00078583835,0.00076222385,0.0014264401,0.00030060677,0.0001296913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036265708,0.000489836,0.0016039545,0.0005924085,0.0002296815,0.00040123417,0.0042868974,0.0001998085,0.0000016052501],"category_scores_gemma":[0.00095507194,0.0003783798,0.0004849855,0.003208661,0.00047952472,0.00036170226,0.0009458236,0.00060917303,0.0000074399823],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.8399415e-7,0.000031914475,7.007206e-7,0.049132317,0.00001028311,0.0000030825063,0.0002825596,0.000026313875,6.531108e-8,0.00006976481,0.00003381464,0.9504088],"study_design_scores_gemma":[0.00007173791,0.00023322178,4.2722752e-7,0.13509637,0.000042873173,0.000083808874,8.7957474e-8,0.0051158797,0.0000032949495,0.0001643203,0.85881865,0.00036931466],"about_ca_topic_score_codex":0.000016268621,"about_ca_topic_score_gemma":0.0000066740317,"teacher_disagreement_score":0.9500395,"about_ca_system_score_codex":0.00015156646,"about_ca_system_score_gemma":0.0009338694,"threshold_uncertainty_score":0.9998668},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009111983,0.00039084634,0.99648744,0.00015336079,0.00055790105,0.00035091644,0.0000107354035,0.000110321205,0.001027282],"genre_scores_gemma":[0.8343428,0.00007024942,0.1633361,0.00079879485,0.00091464893,0.000020983947,0.00001584319,0.000090612964,0.00041000266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832904,0.0000080027785,0.0002686448,0.0005436013,0.00045509287,0.0003955938],"domain_scores_gemma":[0.9991855,0.000112980466,0.00005182091,0.00043827653,0.000105957784,0.000105432984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022658933,0.00033030313,0.000256542,0.00020102318,0.0001550819,0.00013576094,0.0007807796,0.00013993698,0.0001266598],"category_scores_gemma":[0.000005564357,0.00022076907,0.00004970648,0.00025158902,0.000400054,0.0001260561,0.000037295893,0.00042203275,0.000047415575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000576562,0.0000031884854,0.000012423865,0.000023690609,0.000009471368,0.000020370104,0.002469282,0.54523116,0.00010402869,0.0010834484,0.00007034988,0.45096684],"study_design_scores_gemma":[0.00047538045,0.0011307003,0.0013875653,0.0023428914,0.000081345366,0.000118620635,0.0000063250523,0.86579514,0.023028707,0.02391127,0.078935884,0.0027861684],"about_ca_topic_score_codex":0.00001971179,"about_ca_topic_score_gemma":0.0003959389,"teacher_disagreement_score":0.83343154,"about_ca_system_score_codex":0.00011100537,"about_ca_system_score_gemma":0.00007404846,"threshold_uncertainty_score":0.90027016},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016194431,0.00010259926,0.98987585,0.0020807062,0.0036057776,0.0010079214,0.00046231283,0.00020808283,0.0010373205],"genre_scores_gemma":[0.6421561,0.00002137606,0.30923432,0.044073645,0.0031722654,0.00008693992,0.00014683073,0.0002592942,0.000849184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937214,0.00010985809,0.00041601248,0.0037141456,0.0012501014,0.00078845775],"domain_scores_gemma":[0.98305106,0.014093856,0.00026522507,0.0021831547,0.0001682023,0.00023849886],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010144485,0.00072958384,0.00067760824,0.0008807326,0.0007843639,0.0003885499,0.003063196,0.00031463275,0.00011855937],"category_scores_gemma":[0.010099855,0.0006674345,0.00012481194,0.00075170666,0.0015317175,0.0004972151,0.0031231795,0.0011645409,0.0005185137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064144266,0.0004133664,0.002783466,0.00020169356,0.00013540068,0.0006899634,0.0074877436,0.12965721,0.08433615,0.002224405,0.005262072,0.7661671],"study_design_scores_gemma":[0.0012481761,0.00072559086,0.0015227878,0.0008746419,0.000048586404,0.000022152486,8.1283434e-7,0.909829,0.04153454,0.022195555,0.020188931,0.0018092144],"about_ca_topic_score_codex":0.00016556548,"about_ca_topic_score_gemma":0.0012096176,"teacher_disagreement_score":0.7801718,"about_ca_system_score_codex":0.00057599164,"about_ca_system_score_gemma":0.00036855697,"threshold_uncertainty_score":0.9995777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031905632,0.00016697249,0.954869,0.008257713,0.003751563,0.0007954757,0.0000054963543,0.00010446746,0.00014369922],"genre_scores_gemma":[0.8049006,0.000007940873,0.19086985,0.003928875,0.00022917341,0.000039090562,0.000009012703,0.000008970161,0.0000065057334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623805,0.0001979898,0.00043959374,0.0014766228,0.0011073024,0.0005404277],"domain_scores_gemma":[0.9961936,0.001481636,0.00025409463,0.0016736267,0.00029460082,0.0001024677],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016170766,0.00037946465,0.00032896813,0.000527741,0.00028821704,0.0010689279,0.003721968,0.00018518275,0.000011809915],"category_scores_gemma":[0.00022636297,0.00026739595,0.00013424191,0.0017141941,0.00029729464,0.00025792717,0.002833244,0.0009077873,0.00008774859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004386505,0.00006401814,0.000097042685,0.000030592513,0.000007791933,0.000009401312,0.0005939176,0.9012604,0.00016401423,0.013922341,0.00019574529,0.08365036],"study_design_scores_gemma":[0.00014233039,0.00010703555,0.0007419057,0.0001571058,0.0000030949495,0.000017500402,2.7742993e-7,0.8449854,0.0027146684,0.15068465,0.00013832402,0.00030770316],"about_ca_topic_score_codex":0.000019723624,"about_ca_topic_score_gemma":0.000021502898,"teacher_disagreement_score":0.77299494,"about_ca_system_score_codex":0.00022382518,"about_ca_system_score_gemma":0.0010088456,"threshold_uncertainty_score":0.9999778},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005836253,0.00090194726,0.9724273,0.00066002895,0.0034998208,0.00048757548,0.0000054747684,0.00009236821,0.021341845],"genre_scores_gemma":[0.6498052,0.000019252064,0.33348897,0.0025750785,0.0037773985,0.00007522397,0.000024882205,0.00009538188,0.010138637],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997914,0.0000241647,0.00030301773,0.0009504004,0.00039020443,0.00041819713],"domain_scores_gemma":[0.99862474,0.00020392379,0.0002481095,0.0006310473,0.00022550387,0.00006665169],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041260532,0.00028749203,0.00025044085,0.0003678966,0.00013368145,0.00014959229,0.00073011656,0.00025822214,0.0005354204],"category_scores_gemma":[0.000036021436,0.00026800015,0.00007428801,0.00024054378,0.00076885126,0.00010169072,0.00016831573,0.00042978022,0.00028663452],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013257871,0.000031246935,0.0000968831,0.000010374071,0.000016340748,0.000013236825,0.006060329,0.00023542412,0.000009803566,0.018084629,0.000117772775,0.9753107],"study_design_scores_gemma":[0.0009554887,0.0018655346,0.01589892,0.0024619102,0.000105687664,0.00052113185,0.00005524425,0.021960774,0.0002801489,0.50808686,0.44450274,0.0033055623],"about_ca_topic_score_codex":0.000019952016,"about_ca_topic_score_gemma":0.0000656543,"teacher_disagreement_score":0.9720051,"about_ca_system_score_codex":0.000186404,"about_ca_system_score_gemma":0.00021448598,"threshold_uncertainty_score":0.99997723},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086705986,0.00015901391,0.9876936,0.00045522713,0.001949173,0.00035506804,0.0000034415064,0.0001301356,0.008387286],"genre_scores_gemma":[0.5977762,0.00003143319,0.3959343,0.004358043,0.0014992633,0.00002952581,0.0000045654615,0.000051045427,0.00031561172],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717003,0.000030158688,0.00042882096,0.0011581004,0.0007903441,0.00042252883],"domain_scores_gemma":[0.9973875,0.00026107454,0.00035681252,0.0013923666,0.0004661436,0.00013610066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077546097,0.0003724223,0.00043314465,0.000623684,0.00015412799,0.00028481192,0.003175506,0.00031554373,0.00006914737],"category_scores_gemma":[0.00007701239,0.00035452534,0.00011201085,0.0008642509,0.000465333,0.0005884624,0.0011976615,0.00055426813,0.00013762453],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004990406,0.00014187842,0.00016110827,0.00037678485,0.00006443007,0.00012310247,0.01319178,0.005483369,0.0007535846,0.04938256,0.00032485893,0.92994666],"study_design_scores_gemma":[0.00037708168,0.000586346,0.000075184376,0.0006856283,0.000014817029,0.0001703945,4.7455472e-7,0.3325602,0.0111787915,0.63680696,0.016636008,0.00090806634],"about_ca_topic_score_codex":0.00017942401,"about_ca_topic_score_gemma":0.00027800878,"teacher_disagreement_score":0.9290386,"about_ca_system_score_codex":0.0001611534,"about_ca_system_score_gemma":0.00057066156,"threshold_uncertainty_score":0.9998907},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00250747,0.000032753047,0.99049854,0.000802785,0.001902164,0.00061431684,0.0000027266844,0.00030600256,0.0033332114],"genre_scores_gemma":[0.49648985,0.000004320574,0.48625124,0.011726868,0.004359919,0.000035056466,0.00001777179,0.00009746651,0.0010174869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954973,0.000060318012,0.00049786834,0.0021212008,0.0011298642,0.00069345697],"domain_scores_gemma":[0.9965254,0.0002225472,0.0003391007,0.0025420366,0.00019200485,0.00017891574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012206796,0.0005641525,0.0004489724,0.0006985807,0.00043521915,0.0006329019,0.0049921866,0.00029925318,0.00002293334],"category_scores_gemma":[0.00006501173,0.000506503,0.00012669287,0.000651689,0.00057958957,0.00009665274,0.0015420844,0.0006658891,0.00020737127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001779122,0.00010583599,0.000027987368,0.00003649134,0.0000063630137,0.000050572973,0.00040732493,0.23758283,0.000035229186,0.051573277,0.00022974897,0.70992655],"study_design_scores_gemma":[0.00029385232,0.00054194464,0.00014035939,0.0002643837,0.000005565472,0.000008239129,5.300938e-8,0.89709127,0.0006223276,0.08363656,0.01676142,0.0006340509],"about_ca_topic_score_codex":0.000016610049,"about_ca_topic_score_gemma":0.000051374154,"teacher_disagreement_score":0.7092925,"about_ca_system_score_codex":0.00030582788,"about_ca_system_score_gemma":0.00034741202,"threshold_uncertainty_score":0.99973863},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0206519,0.0003098504,0.31940076,0.0008021096,0.004649648,0.001076173,0.0000025458944,0.0003362943,0.6527707],"genre_scores_gemma":[0.9590685,0.000034033597,0.016721532,0.0055036936,0.01074863,0.000019027755,0.000035156827,0.000115021736,0.007754451],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976026,0.000007941774,0.00047530915,0.0009842182,0.0004943798,0.00043559386],"domain_scores_gemma":[0.99859464,0.00011933712,0.0003569676,0.0005585817,0.00034910024,0.000021344864],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00096299296,0.00037423696,0.00038975725,0.001244077,0.00035011565,0.0011818905,0.0006405383,0.00013505234,0.00056028133],"category_scores_gemma":[0.00025399643,0.0003476572,0.000080601654,0.00058970763,0.00065007014,0.0006583571,0.0013495242,0.0003062521,0.00015761732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085771615,0.00009512871,0.008193087,0.0009931545,0.00010896508,0.0001142415,0.004168906,0.00019106556,0.00023528602,0.48718995,0.0008934789,0.49773097],"study_design_scores_gemma":[0.0010667343,0.00006377222,0.000669376,0.0012939187,0.000098231976,0.000012971694,0.000040383246,0.058840845,0.00026732558,0.74106896,0.19479355,0.001783918],"about_ca_topic_score_codex":0.00022075351,"about_ca_topic_score_gemma":0.00030790843,"teacher_disagreement_score":0.93841654,"about_ca_system_score_codex":0.0001139338,"about_ca_system_score_gemma":0.0000608604,"threshold_uncertainty_score":0.99989754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007470401,0.0003767589,0.99673957,0.00027907925,0.0013925445,0.00038883236,0.000012630432,0.0004002818,0.00033562665],"genre_scores_gemma":[0.014440439,0.000021287333,0.98414254,0.00082031253,0.00036352707,0.00000876407,0.0000016642842,0.000051988292,0.00014949385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995829,0.00005259679,0.00045010616,0.001973018,0.00085367484,0.0008416269],"domain_scores_gemma":[0.9967212,0.0010601986,0.00018523222,0.0013635538,0.00036455432,0.00030525072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010350131,0.0006312489,0.0006635411,0.0007057797,0.00027962416,0.00053092255,0.002953888,0.00038353738,0.000005925796],"category_scores_gemma":[0.00082214456,0.00058093487,0.00006331756,0.0006897734,0.0007699036,0.00079646637,0.0019003877,0.0007847194,0.000008473615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079171305,0.000009832415,0.0000022018796,0.000063590065,0.0000098673045,0.00007255762,0.0008117193,0.83698386,0.00022715043,0.022794975,0.000016791779,0.13899952],"study_design_scores_gemma":[0.00009392713,0.00010649242,0.000025777723,0.00031360713,0.000007116584,0.00012097566,1.498069e-7,0.5560279,0.00040495928,0.4422482,0.00012085408,0.00053008087],"about_ca_topic_score_codex":0.000010536588,"about_ca_topic_score_gemma":0.00003057038,"teacher_disagreement_score":0.4194532,"about_ca_system_score_codex":0.00028530043,"about_ca_system_score_gemma":0.0005052803,"threshold_uncertainty_score":0.9996642},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8131404,0.0014761274,0.15654115,0.00021257016,0.0016659478,0.02662492,0.00011118589,0.000085837855,0.00014187752],"genre_scores_gemma":[0.57257825,0.00024335271,0.33827534,0.0034608033,0.0009771925,0.08319398,0.00021148371,0.00015272637,0.00090685487],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99618465,0.000072074334,0.0011670445,0.0010480755,0.00043767507,0.0010904638],"domain_scores_gemma":[0.9968328,0.00026295357,0.0007764436,0.0007035245,0.00074437127,0.00067992916],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015194267,0.00036599982,0.0006956263,0.0005976592,0.0016090599,0.00002541982,0.0005906393,0.00037572227,0.00004077064],"category_scores_gemma":[0.00007838042,0.0003440415,0.000035568228,0.00032889406,0.00034053554,0.00008319531,0.0003524467,0.00054005376,0.000014723956],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016466407,0.00006282372,0.006131507,0.002467748,0.0000028396937,2.6339555e-7,0.07997965,0.000025035055,0.00002886725,0.00006395785,0.00002497793,0.9111959],"study_design_scores_gemma":[0.0060022203,0.013509626,0.36903763,0.03803728,0.00019117471,0.000020170515,0.0030423098,0.0021207663,0.004235088,0.024210697,0.5327259,0.0068671578],"about_ca_topic_score_codex":0.00016366052,"about_ca_topic_score_gemma":0.0011034408,"teacher_disagreement_score":0.9043287,"about_ca_system_score_codex":0.0014412095,"about_ca_system_score_gemma":0.011735981,"threshold_uncertainty_score":0.9999012},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011332739,0.00022692501,0.99744225,0.00004674463,0.00046138078,0.00051721296,0.0000150838605,0.00026831415,0.00090873666],"genre_scores_gemma":[0.33781174,0.0000370999,0.6616196,0.00018975258,0.00025203667,0.000016184698,0.000022851704,0.000025287529,0.000025455849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611783,0.00003265361,0.000653364,0.0018219599,0.0009683339,0.00040584637],"domain_scores_gemma":[0.9948698,0.00018991675,0.0006863202,0.0037516842,0.00041490953,0.00008732819],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012518205,0.00036749284,0.00048438672,0.0008420933,0.0001954766,0.00020308538,0.0055823172,0.00023131636,0.000027062402],"category_scores_gemma":[0.00008178093,0.00037185647,0.0000738558,0.00092736725,0.00067068735,0.0013760397,0.0028809533,0.00044681228,0.000011255264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056380404,0.000035043413,0.00003467457,0.00006494499,0.000016631471,0.000010277231,0.0006193465,0.002754851,0.0017797202,0.002603489,0.000026621712,0.99204874],"study_design_scores_gemma":[0.00011976736,0.00018893131,0.000012866709,0.0002902581,0.000012710593,0.000027748432,2.4149585e-7,0.62544465,0.028293958,0.3430554,0.0020931156,0.00046038118],"about_ca_topic_score_codex":0.000019268322,"about_ca_topic_score_gemma":0.00006013586,"teacher_disagreement_score":0.99158835,"about_ca_system_score_codex":0.00026253884,"about_ca_system_score_gemma":0.00023697641,"threshold_uncertainty_score":0.99987334},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042914186,0.000011620621,0.94812876,0.00028849393,0.0018669871,0.00025624916,0.0000022362335,0.00012502469,0.006406467],"genre_scores_gemma":[0.95178,7.4243263e-7,0.029582828,0.011641352,0.006647679,0.0000058394116,0.00011614275,0.0000515417,0.00017387861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974698,0.0000040798923,0.0004602202,0.0010718832,0.0005346809,0.00045933583],"domain_scores_gemma":[0.9985929,0.000047942638,0.000234699,0.00054978224,0.0005468083,0.000027866896],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005612184,0.0003844759,0.0003455693,0.00064097875,0.00028584903,0.0008169944,0.0009026775,0.00024222824,0.001026448],"category_scores_gemma":[0.000035418194,0.00036333926,0.000046866848,0.0005524538,0.00034351496,0.0017173013,0.0005258253,0.00038178332,0.00034195906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017225412,0.00014277447,0.0013261893,0.00015250001,0.000055498826,0.00012519234,0.0065996978,0.38619024,0.002802469,0.1072471,0.0013696438,0.49381644],"study_design_scores_gemma":[0.00040129022,0.00007771453,0.00014500537,0.00035851588,0.000024032342,0.0000036561441,0.000008042737,0.866887,0.0002119376,0.12022151,0.010655381,0.0010059605],"about_ca_topic_score_codex":0.0015169288,"about_ca_topic_score_gemma":0.0005536882,"teacher_disagreement_score":0.9185459,"about_ca_system_score_codex":0.000073011346,"about_ca_system_score_gemma":0.00012509433,"threshold_uncertainty_score":0.99988675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004940793,0.00021790252,0.98700935,0.0003138034,0.0009491412,0.00027289393,0.000003401226,0.00011451159,0.0110695865],"genre_scores_gemma":[0.038020656,0.0003757019,0.9589092,0.0010443798,0.00020206117,0.000011096891,0.000005490702,0.00003835235,0.0013930512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969994,0.00003228105,0.00048475093,0.0010111135,0.0009690643,0.0005034322],"domain_scores_gemma":[0.9976055,0.0002348036,0.00024959116,0.0012743222,0.0004939673,0.00014183189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008139903,0.0003355493,0.00043615382,0.0011101429,0.00016284698,0.00027124054,0.003164548,0.00020895456,0.000101700185],"category_scores_gemma":[0.000074055926,0.0002978991,0.000113564274,0.0008854473,0.0011923461,0.0007004113,0.001183937,0.00040241197,0.000065774446],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000114164395,0.000095419164,0.000112906986,0.00016926505,0.00003177154,0.000045997636,0.0062623406,0.08348113,0.00039172318,0.20577851,0.0004279813,0.7031915],"study_design_scores_gemma":[0.000256214,0.0003267152,0.000024516308,0.0003755562,0.00000380066,0.00001643194,5.343779e-7,0.5100361,0.0032283973,0.48210686,0.003104279,0.000520557],"about_ca_topic_score_codex":0.000016217777,"about_ca_topic_score_gemma":0.000032348344,"teacher_disagreement_score":0.702671,"about_ca_system_score_codex":0.00008118692,"about_ca_system_score_gemma":0.00046819402,"threshold_uncertainty_score":0.9999473},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013629968,0.00007804057,0.9908239,0.00012007365,0.0011280659,0.00042446816,0.000011928842,0.00015877602,0.0071184477],"genre_scores_gemma":[0.024221627,0.000009981263,0.9741598,0.0005786792,0.00030900617,0.000014105834,0.000006671937,0.000041089486,0.00065903686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533814,0.00008102008,0.0008519834,0.0018103982,0.0010570915,0.00086138496],"domain_scores_gemma":[0.9969478,0.0005712555,0.00036743705,0.0016679347,0.00025044786,0.00019512295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018445579,0.0005786078,0.00072039274,0.0009787913,0.00018082546,0.00053085346,0.0037963036,0.0004395094,0.00006880483],"category_scores_gemma":[0.00037429458,0.0005526475,0.00008513602,0.00055648026,0.0011084502,0.0007114647,0.0013264911,0.0009098448,0.00028110525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030400006,0.000110520865,0.000056517492,0.00011201974,0.000014268834,0.00036036293,0.003079359,0.028905675,0.0007621387,0.18300714,0.00009227681,0.7834693],"study_design_scores_gemma":[0.0001731814,0.0001487635,0.0000672304,0.0002693956,0.0000049015616,0.00005258743,5.3521504e-8,0.7995816,0.000934553,0.19797541,0.00027744443,0.00051490724],"about_ca_topic_score_codex":0.0000083872,"about_ca_topic_score_gemma":0.00001766816,"teacher_disagreement_score":0.7829544,"about_ca_system_score_codex":0.00048398797,"about_ca_system_score_gemma":0.00067304855,"threshold_uncertainty_score":0.9996925},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008646668,0.00030357984,0.9897126,0.00012845079,0.0006398548,0.0001823723,9.1459844e-7,0.0001534425,0.00023211435],"genre_scores_gemma":[0.6118542,0.00006799401,0.38717437,0.00031824165,0.0004296115,0.0000032877472,0.00000590346,0.000020246795,0.0001261408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971884,0.00007058904,0.0004732534,0.0011572336,0.0007358403,0.0003747172],"domain_scores_gemma":[0.9984017,0.00018490572,0.000458183,0.0006473989,0.00018916452,0.00011865277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011261727,0.00032450075,0.0003950817,0.0012615713,0.0005609781,0.00067843584,0.0009288614,0.00021615409,0.00005192466],"category_scores_gemma":[0.000056536184,0.00031147583,0.00010955155,0.0012611444,0.00036627013,0.00056154997,0.0011212819,0.0006118983,0.000013604325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049213395,0.000022105583,0.0018041048,0.000034738892,0.00008600978,0.000020336493,0.0019451902,0.05928748,0.0011691694,0.002361678,0.0000025863555,0.9332617],"study_design_scores_gemma":[0.00008792487,0.00008793584,0.0010987113,0.00013508125,0.000051960265,0.00003490965,2.0102114e-7,0.9867947,0.0010360308,0.010104376,0.00024475393,0.00032339676],"about_ca_topic_score_codex":0.000078970384,"about_ca_topic_score_gemma":0.00018449304,"teacher_disagreement_score":0.9329383,"about_ca_system_score_codex":0.000306342,"about_ca_system_score_gemma":0.00012279401,"threshold_uncertainty_score":0.9999337},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16776086,0.0057000536,0.8207571,0.000073711366,0.0024576748,0.0006178089,0.00001169271,0.00043575116,0.0021853684],"genre_scores_gemma":[0.949713,0.0002904112,0.04823173,0.00027034487,0.0011230378,0.000019586576,0.0000149684765,0.00012563846,0.00021128036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697477,0.000030740066,0.0005283412,0.0009404034,0.00053785957,0.0009878693],"domain_scores_gemma":[0.99865204,0.0004120258,0.000089637375,0.00063449144,0.000088241024,0.00012358255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010385858,0.0005844734,0.0006035013,0.0011397755,0.00019211227,0.0003978564,0.00067294424,0.00034970004,0.000046233567],"category_scores_gemma":[0.00008305468,0.0006138596,0.000078313125,0.00041296944,0.0009378219,0.00046566824,0.0005251458,0.00096171437,0.0000136575445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002673306,0.000004771749,0.00029918685,0.00036356243,0.000016875536,0.000059114507,0.005134741,0.92809564,0.00020723142,0.0004804411,0.000016590693,0.06531916],"study_design_scores_gemma":[0.00020532598,0.00003562705,0.0000874836,0.0016832746,0.000008684346,0.000048979688,0.000011122642,0.97722036,0.0008942098,0.018027464,0.0010000623,0.0007774323],"about_ca_topic_score_codex":0.000017880391,"about_ca_topic_score_gemma":0.00048137817,"teacher_disagreement_score":0.78195214,"about_ca_system_score_codex":0.00045688674,"about_ca_system_score_gemma":0.00009016507,"threshold_uncertainty_score":0.9996313},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003482695,0.00008613958,0.9928395,0.0003306635,0.0006388003,0.00035887814,0.000014288133,0.00021162888,0.005485282],"genre_scores_gemma":[0.17055565,0.00020783726,0.8132353,0.008015725,0.0014606649,0.00013869313,0.0001389237,0.00018003798,0.0060672155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603754,0.00004377393,0.00036586297,0.0015203115,0.0012432447,0.0007892742],"domain_scores_gemma":[0.99763596,0.00020560503,0.00022831581,0.001332365,0.0003378775,0.00025985567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004974109,0.00051883,0.00041751383,0.00084976567,0.00034684982,0.00071717903,0.0027432535,0.0002249609,0.000117124044],"category_scores_gemma":[0.000029881983,0.00041361485,0.00009069188,0.0009699122,0.0006481337,0.000485949,0.0009854824,0.0004907841,0.000077517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022559892,0.000088426495,0.000019350888,0.000030104617,0.000024540768,0.0001636311,0.0013684429,0.17278202,0.00002815827,0.014733395,0.00040238668,0.810337],"study_design_scores_gemma":[0.0005136979,0.001049956,0.000022223534,0.00057291373,0.000005694264,0.000054638564,3.490885e-7,0.96066463,0.00077825435,0.01701566,0.018572992,0.0007490062],"about_ca_topic_score_codex":0.000014582381,"about_ca_topic_score_gemma":0.00006075676,"teacher_disagreement_score":0.80958796,"about_ca_system_score_codex":0.00029621596,"about_ca_system_score_gemma":0.00039520938,"threshold_uncertainty_score":0.99983156},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077087636,0.00053222023,0.9798227,0.0007362024,0.004129188,0.00057798374,0.000056056644,0.000111128,0.013263639],"genre_scores_gemma":[0.048655372,0.000029472973,0.9337879,0.002219715,0.005021016,0.000024543775,0.000057027977,0.00008894662,0.010116005],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99238604,0.000052977517,0.0010924842,0.0029063537,0.0027385054,0.0008236556],"domain_scores_gemma":[0.99264127,0.0032558502,0.00052423036,0.0026866908,0.0007023161,0.00018961784],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010408015,0.00046696607,0.000618741,0.001563839,0.0006492653,0.0023449294,0.004858242,0.00022014041,0.00047125292],"category_scores_gemma":[0.00074431516,0.00037210487,0.00024082701,0.0010244974,0.0013417033,0.00037783,0.0020912394,0.00039408568,0.00049642264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000130138105,0.000020153144,0.00004636379,0.00001442228,0.000008325852,0.000031251777,0.0009141109,0.0019987398,0.00006552109,0.0138477,0.007670469,0.97536993],"study_design_scores_gemma":[0.0003398253,0.00015558145,0.00013205754,0.0002636384,0.000007685024,0.000022774708,0.00001354111,0.030793132,0.00023045315,0.5174439,0.44995195,0.00064548233],"about_ca_topic_score_codex":0.000006701174,"about_ca_topic_score_gemma":0.000067814595,"teacher_disagreement_score":0.9747245,"about_ca_system_score_codex":0.00019410743,"about_ca_system_score_gemma":0.0001898794,"threshold_uncertainty_score":0.9998731},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00268876,0.00011786124,0.9923653,0.0017388645,0.001253747,0.0010765089,0.000028175202,0.00053224206,0.00019855358],"genre_scores_gemma":[0.66114926,0.0000044549256,0.33629504,0.0013868562,0.00085277564,0.00005133797,0.000015687716,0.00004677735,0.00019781027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955911,0.000031867807,0.0007018378,0.002059098,0.00069927477,0.000916828],"domain_scores_gemma":[0.9963208,0.00049871416,0.00047072693,0.0019395336,0.00058862835,0.00018163653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009144964,0.00066588254,0.00068042945,0.0008676847,0.0005699392,0.00028867426,0.00394739,0.0007608635,0.000020809115],"category_scores_gemma":[0.00008513947,0.00065957103,0.00024043652,0.0006255212,0.0013868918,0.00007386176,0.0012043997,0.0008869136,0.00002676691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045846195,0.0002532619,0.000025050571,0.00018320467,0.000044603545,0.000023520059,0.0020128395,0.35481718,0.0005434464,0.39891022,0.00020072427,0.24294008],"study_design_scores_gemma":[0.00044707255,0.00014307453,0.000005396257,0.00017674337,0.000011496926,0.00001385123,1.1854146e-7,0.760251,0.0011763467,0.23674448,0.0004941767,0.00053624326],"about_ca_topic_score_codex":0.0000062982836,"about_ca_topic_score_gemma":0.000053870375,"teacher_disagreement_score":0.6584605,"about_ca_system_score_codex":0.00029972228,"about_ca_system_score_gemma":0.0006309044,"threshold_uncertainty_score":0.99958557},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012073796,0.00008697066,0.9962898,0.00074431545,0.0013510917,0.0007931565,0.000007709648,0.00029122157,0.00031501695],"genre_scores_gemma":[0.13490972,0.000023401837,0.8606418,0.0018372828,0.0017176828,0.0001194323,0.000007855386,0.000066893175,0.0006759804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967947,0.000015589389,0.00040479822,0.0016053327,0.00054957706,0.0006300263],"domain_scores_gemma":[0.9972729,0.00047898592,0.000264867,0.0014718337,0.00035124403,0.00016018777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037640217,0.00041236787,0.00035426547,0.00041436395,0.00059025263,0.00041634945,0.0027518454,0.00027262623,0.000012601268],"category_scores_gemma":[0.000040934803,0.0003563554,0.00013195559,0.000656862,0.0007916427,0.0005906113,0.00087069185,0.0004551369,0.000061134284],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059446006,0.000013569053,0.000006003949,0.000017897517,0.000003846632,0.0000035420835,0.00017596316,0.009921766,0.0006217567,0.0026528179,0.000038487695,0.9865384],"study_design_scores_gemma":[0.0001852959,0.0001909234,0.000029256165,0.000099920384,0.000005404237,0.000028102377,6.3106924e-8,0.6907198,0.012759438,0.28843847,0.007089016,0.00045430876],"about_ca_topic_score_codex":0.000004208257,"about_ca_topic_score_gemma":0.00014597239,"teacher_disagreement_score":0.9860841,"about_ca_system_score_codex":0.00028017827,"about_ca_system_score_gemma":0.00022942775,"threshold_uncertainty_score":0.99988884},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050901924,0.00057225506,0.99537784,0.00073412596,0.0010326225,0.0005154486,0.0000055719106,0.0004575644,0.0007955648],"genre_scores_gemma":[0.33672988,0.0000026121118,0.6616737,0.0010981443,0.00032997585,0.000019116133,0.0000036071526,0.000026699567,0.00011623646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611914,0.000041943535,0.000543117,0.0015813132,0.0010483467,0.0006661415],"domain_scores_gemma":[0.99791145,0.00023583927,0.00022622924,0.001068875,0.00036323853,0.00019439083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009770014,0.00049300876,0.00052943337,0.0014668509,0.00014739219,0.00055198435,0.0035095958,0.00035567957,0.000014621009],"category_scores_gemma":[0.00011279813,0.00044257523,0.00008708084,0.0011336501,0.00042935283,0.0005524233,0.0015454935,0.0006634579,0.00007055853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075492964,0.00011743302,0.00038209592,0.0007700001,0.00006212432,0.0020581158,0.023355244,0.020692203,0.0046228166,0.3472383,0.00033420307,0.60029197],"study_design_scores_gemma":[0.00034909474,0.00025993388,0.000070626396,0.0022627327,0.000007961611,0.00017866187,6.40128e-7,0.759953,0.0093628615,0.22585373,0.0004843459,0.0012164041],"about_ca_topic_score_codex":0.00014260897,"about_ca_topic_score_gemma":0.00024918438,"teacher_disagreement_score":0.7392608,"about_ca_system_score_codex":0.0009276639,"about_ca_system_score_gemma":0.0006506232,"threshold_uncertainty_score":0.9998026},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021256054,0.00034279324,0.98863643,0.0005698117,0.0019014683,0.0005030879,0.0000062815143,0.00022368871,0.0076038856],"genre_scores_gemma":[0.08242271,0.000056959136,0.90742236,0.002642659,0.001643589,0.00003584151,0.000008339318,0.00012910922,0.005638413],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941466,0.00006688019,0.00059059326,0.0023133093,0.0016157898,0.0012668647],"domain_scores_gemma":[0.99508697,0.0009026634,0.00026837827,0.002920309,0.00047881433,0.00034285913],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013496297,0.00070358353,0.0006380936,0.0015116795,0.0003216908,0.0006706229,0.0067945244,0.00040314638,0.00013497264],"category_scores_gemma":[0.0002298106,0.00060848537,0.00022087965,0.0010743594,0.0023975829,0.0010229407,0.0032797914,0.0010714981,0.00046529004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036555342,0.000081284394,0.00027465328,0.000090433285,0.00004291956,0.0004321337,0.001581547,0.009184616,0.0006112057,0.13239194,0.00039845574,0.85487425],"study_design_scores_gemma":[0.0003241007,0.00040854252,0.00008602908,0.00028592272,0.0000055196506,0.00008499116,1.2395847e-7,0.1778501,0.0014563522,0.81203306,0.006570823,0.00089444144],"about_ca_topic_score_codex":0.00000719391,"about_ca_topic_score_gemma":0.00010726265,"teacher_disagreement_score":0.8539798,"about_ca_system_score_codex":0.00029353108,"about_ca_system_score_gemma":0.000510888,"threshold_uncertainty_score":0.99963665},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006507357,0.0002933736,0.9886803,0.0006998334,0.0026697519,0.00038415584,0.000010847227,0.0002522517,0.0005021487],"genre_scores_gemma":[0.21880569,0.000021524238,0.77282834,0.0068317405,0.0013133012,0.0000049612227,0.000019243256,0.000055981487,0.00011923143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949439,0.0000726329,0.00054056605,0.0027181003,0.0008099867,0.0009148128],"domain_scores_gemma":[0.99411094,0.00035096792,0.00027994195,0.004703311,0.00026169926,0.00029311384],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0009341356,0.0005805006,0.00068179925,0.00091180636,0.00036212412,0.0015704456,0.017791681,0.00038914618,0.000042286458],"category_scores_gemma":[0.00016552734,0.0005120311,0.00006851151,0.00059451844,0.00093005155,0.0016330136,0.009612834,0.0004599697,0.000052599382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038621944,0.00013858512,0.00069941167,0.000080965685,0.00006491512,0.0008189042,0.004069721,0.10677932,0.00053163985,0.005844751,0.00015765196,0.8807755],"study_design_scores_gemma":[0.00023010772,0.00047763914,0.00029617446,0.00026510257,0.000021115045,0.00050436356,6.5286474e-7,0.8957522,0.0027615859,0.09547553,0.003035466,0.0011800616],"about_ca_topic_score_codex":0.00019103246,"about_ca_topic_score_gemma":0.0020664483,"teacher_disagreement_score":0.87959546,"about_ca_system_score_codex":0.00017419012,"about_ca_system_score_gemma":0.0006453442,"threshold_uncertainty_score":0.99973315},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026941684,0.00014720585,0.9941636,0.00012608939,0.0008767855,0.00019847469,0.0000048286634,0.00032808358,0.0038855614],"genre_scores_gemma":[0.028068095,0.0000654489,0.9694551,0.00064335275,0.0006257571,0.000008669434,0.000048246155,0.000115777286,0.0009695207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984866,0.000010037303,0.0002450176,0.0005410411,0.0004182355,0.00029910041],"domain_scores_gemma":[0.9991698,0.0001173537,0.00007408837,0.00041752882,0.00012892562,0.00009225375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014678852,0.0003704148,0.00027491376,0.0004562476,0.00010752276,0.00015764822,0.0004348342,0.00025946097,0.0001265011],"category_scores_gemma":[0.0000278677,0.00030148544,0.00004019924,0.0003715413,0.00026521564,0.00010632525,0.00005535714,0.00043214334,0.00006968755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010537241,0.000006195565,0.000018289607,0.000017238022,0.00001208311,0.000013383741,0.00028870453,0.94756454,0.0000033640986,0.00017864438,0.00002630583,0.051860716],"study_design_scores_gemma":[0.0002888779,0.0001399073,0.000045882312,0.00037082957,0.000010893775,0.00002162644,1.4745342e-7,0.99597627,0.0001169565,0.0023072246,0.00032438018,0.0003970019],"about_ca_topic_score_codex":0.000003555263,"about_ca_topic_score_gemma":0.000029484909,"teacher_disagreement_score":0.051463716,"about_ca_system_score_codex":0.000116687304,"about_ca_system_score_gemma":0.00007630491,"threshold_uncertainty_score":0.99994373},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016761842,0.0003868262,0.99262065,0.00017373794,0.0018033562,0.00047590476,0.000016198506,0.0001494517,0.002697696],"genre_scores_gemma":[0.78480715,0.0000304466,0.21354748,0.00026226163,0.00047984513,0.000028259572,0.0000069422945,0.000040238323,0.00079741015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495107,0.00009310642,0.0010479107,0.0017839333,0.001437977,0.00068598444],"domain_scores_gemma":[0.9954649,0.0004588756,0.0008899293,0.0020368893,0.00094043714,0.00020894784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008398807,0.0005962644,0.0011478136,0.002571117,0.00028993408,0.000315973,0.0046884334,0.00032826193,0.00016496854],"category_scores_gemma":[0.00011103432,0.0005250503,0.00042902853,0.0030288177,0.0014676775,0.000613802,0.0016213699,0.0005109562,0.00005989732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006769827,0.00019963022,0.0015337366,0.00028205643,0.0014827476,0.00035890983,0.13316911,0.43995366,0.0015081498,0.07042639,0.0003385309,0.3506794],"study_design_scores_gemma":[0.000078599034,0.00023138571,0.00014076763,0.0006798263,0.00014770315,0.000010951038,0.000015525393,0.97524095,0.008681115,0.0139260385,0.00018296337,0.0006641993],"about_ca_topic_score_codex":0.00008413145,"about_ca_topic_score_gemma":0.0004757999,"teacher_disagreement_score":0.78313094,"about_ca_system_score_codex":0.0004348604,"about_ca_system_score_gemma":0.00048403806,"threshold_uncertainty_score":0.9997201},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001448689,0.00034047777,0.99381375,0.00016455042,0.0006934138,0.00030872345,0.0000054111465,0.0033624426,0.0011663756],"genre_scores_gemma":[0.06647915,0.00002526568,0.9315435,0.0012801222,0.0002581927,0.000016704524,0.000004288911,0.000053082444,0.00033967674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557525,0.000029127012,0.00062641694,0.0018642277,0.0009774895,0.00092749036],"domain_scores_gemma":[0.9966715,0.0007374576,0.0002997903,0.0018348931,0.00030591185,0.00015045407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013768121,0.0006213535,0.0006404444,0.001231019,0.00023501918,0.00069566193,0.0042117457,0.00041735222,0.000018217814],"category_scores_gemma":[0.00046603347,0.00060226046,0.0001117907,0.00075944973,0.00069866114,0.0007453921,0.0019940876,0.00087591534,0.00003671942],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014347892,0.00009985879,0.0023037698,0.00017178,0.000015633372,0.00027873757,0.004505068,0.11509475,0.00007611208,0.008523581,0.0015905628,0.8673258],"study_design_scores_gemma":[0.00009813344,0.00006542865,0.000044007356,0.0007458025,0.0000022152,0.00004483413,2.7819585e-8,0.53756016,0.0002526261,0.46051928,0.00021842672,0.00044904623],"about_ca_topic_score_codex":0.00010267462,"about_ca_topic_score_gemma":0.000105143925,"teacher_disagreement_score":0.8668767,"about_ca_system_score_codex":0.00050389755,"about_ca_system_score_gemma":0.00078035815,"threshold_uncertainty_score":0.99964285},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020575442,0.00023964091,0.9931166,0.0004166968,0.0017630734,0.0004921742,0.000002894781,0.00024531374,0.0037030408],"genre_scores_gemma":[0.0040429486,0.00006787575,0.99137694,0.0020108675,0.0011258321,0.000031898548,0.0000069873595,0.00004094349,0.0012957309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635655,0.000033401113,0.0006277252,0.0014650524,0.00075021473,0.0007670299],"domain_scores_gemma":[0.996827,0.0004098848,0.0003218481,0.002010757,0.00020135104,0.00022917877],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005774482,0.00052959775,0.00053814496,0.00050199905,0.00025217343,0.00057223334,0.0053959168,0.0002788804,0.000029638706],"category_scores_gemma":[0.000017317068,0.00045353663,0.00016259497,0.0011837077,0.00055096473,0.00042420547,0.0021893794,0.0008432481,0.00022250427],"study_design_candidate":"design_other","study_design_consensus":null,"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.033019e-7,0.000109109904,0.000008553267,0.00004863421,0.000009739827,0.00004095503,0.0009506627,0.014243345,0.000021516717,0.037998166,0.0012892144,0.9452792],"study_design_scores_gemma":[0.000081302365,0.00010140402,0.000024319328,0.0002480697,0.0000060795383,0.00006852068,4.7860194e-8,0.75864285,0.00058581197,0.2321852,0.0075276042,0.00052880537],"about_ca_topic_score_codex":0.000010966747,"about_ca_topic_score_gemma":0.000026475233,"teacher_disagreement_score":0.94475037,"about_ca_system_score_codex":0.0002773613,"about_ca_system_score_gemma":0.000607914,"threshold_uncertainty_score":0.99998534},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022262666,0.000083803614,0.9740825,0.0006785153,0.00038561565,0.0010165252,0.000020278669,0.00010134949,0.0013686903],"genre_scores_gemma":[0.85993177,0.00001828092,0.13954228,0.00023522806,0.00012523992,0.000038563197,0.000018331431,0.000027460523,0.00006282641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940419,0.00020427966,0.0008563392,0.0016715623,0.002568599,0.00065732637],"domain_scores_gemma":[0.99535865,0.00037782983,0.0007631081,0.0022207603,0.0010473478,0.00023233057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0044065304,0.0005339474,0.0007080265,0.000554845,0.00027745086,0.00040123038,0.0024348574,0.00031156058,0.00005154494],"category_scores_gemma":[0.00030838524,0.00044498494,0.00014088342,0.0009959916,0.0013029188,0.0007457343,0.0011700172,0.0005345681,0.000020810217],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048281945,0.00018378237,0.000038181126,0.000110135545,0.00007882482,0.000007876978,0.0015579477,0.007752298,0.00082277704,0.022959623,0.00003269379,0.9664076],"study_design_scores_gemma":[0.0011663646,0.0005808116,0.001975294,0.00075360347,0.00008829154,0.000041677056,0.0000014117687,0.91021025,0.0015909298,0.082264505,0.00063173496,0.0006951312],"about_ca_topic_score_codex":0.00015130319,"about_ca_topic_score_gemma":0.0006858516,"teacher_disagreement_score":0.9657124,"about_ca_system_score_codex":0.0009144341,"about_ca_system_score_gemma":0.0017369583,"threshold_uncertainty_score":0.9998002},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035429027,0.00027058323,0.90775305,0.0018121795,0.0020653855,0.0013131209,0.000004142526,0.00006185329,0.05129064],"genre_scores_gemma":[0.9786138,0.000010765728,0.018111503,0.002062518,0.00041139722,0.000007211586,0.0000097260445,0.00001588054,0.000757193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982672,0.0000068424697,0.00046162185,0.00044933037,0.00057234167,0.00024266071],"domain_scores_gemma":[0.9990486,0.000046251105,0.00023173759,0.0004986153,0.00016853104,0.000006296164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010465886,0.0002083456,0.0002875507,0.00052452146,0.00007894366,0.00008296369,0.0011215127,0.00006655999,0.00013813208],"category_scores_gemma":[0.000041273004,0.0001577521,0.0000607955,0.0003749097,0.0004394632,0.00045147105,0.00042312872,0.0002357025,0.000014128049],"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.000080198115,0.0002468996,0.010136265,0.002282707,0.00005080091,0.000044266242,0.012133769,0.72224385,0.00010936675,0.039244186,0.00056571426,0.21286197],"study_design_scores_gemma":[0.0015311376,0.00025744733,0.023482218,0.0045327363,0.00012524365,0.000003845821,0.00006230516,0.721279,0.00092385727,0.1335292,0.11192802,0.002344962],"about_ca_topic_score_codex":0.008304519,"about_ca_topic_score_gemma":0.08485837,"teacher_disagreement_score":0.9431848,"about_ca_system_score_codex":0.00013199532,"about_ca_system_score_gemma":0.00022542408,"threshold_uncertainty_score":0.99829924},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000326691,0.000079847865,0.9946983,0.00096438994,0.002517849,0.00077051786,0.000013688515,0.00017121632,0.00045752418],"genre_scores_gemma":[0.22960709,0.0000591039,0.75583947,0.005940171,0.004658563,0.000107878426,0.00017058202,0.00008444966,0.0035327203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966798,0.000039310806,0.00059235113,0.0009630891,0.0009681576,0.0007573106],"domain_scores_gemma":[0.9975687,0.00047342086,0.00027549043,0.0008278033,0.0006545029,0.0002000428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013902053,0.00039332392,0.00040700127,0.0005017317,0.0004850528,0.00061205734,0.0020396067,0.00038866216,0.00004410842],"category_scores_gemma":[0.00010360721,0.00034705809,0.00019297973,0.00048593275,0.00071372173,0.00084919744,0.00070953084,0.0006447716,0.00010260211],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035162222,0.000027634413,0.00011118079,0.00006412005,0.0000102720105,0.000017640583,0.0006017454,0.0035574397,0.0000341743,0.057091814,0.0006406846,0.93780816],"study_design_scores_gemma":[0.0005711413,0.000640386,0.00080594444,0.0005408729,0.000012740354,0.00006139604,3.7636698e-7,0.78920656,0.00031533747,0.19578701,0.011267868,0.00079037197],"about_ca_topic_score_codex":0.000010470888,"about_ca_topic_score_gemma":0.00004580879,"teacher_disagreement_score":0.93701774,"about_ca_system_score_codex":0.00027334728,"about_ca_system_score_gemma":0.00053889165,"threshold_uncertainty_score":0.99989814},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017848268,0.000101364094,0.9785345,0.0006174706,0.0011341292,0.00059968507,0.000006320515,0.00022080971,0.00093744416],"genre_scores_gemma":[0.7991406,0.00000295906,0.19458917,0.0051505924,0.0005887228,0.000014147829,0.000008058894,0.00006911637,0.00043667728],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99507904,0.000035590052,0.0006207779,0.002153373,0.0012614627,0.0008497282],"domain_scores_gemma":[0.99668825,0.00016271125,0.00033961932,0.0019232292,0.0005385354,0.00034765288],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009171984,0.00061745784,0.0005624541,0.000965433,0.00042874564,0.0021647753,0.004752063,0.0002946907,0.00010499034],"category_scores_gemma":[0.000045979603,0.0005284923,0.000098422606,0.0010142161,0.0006468468,0.0010433276,0.0016970759,0.0005381542,0.00013942913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000262266,0.00043522977,0.039965946,0.001638588,0.0006176692,0.0011987023,0.5290227,0.08740437,0.004022337,0.048399746,0.00046158303,0.28657085],"study_design_scores_gemma":[0.00036970255,0.00024343935,0.0006587467,0.001213631,0.000014282724,0.00013914928,0.0000018278774,0.9733818,0.00080585823,0.017811859,0.004184158,0.0011755312],"about_ca_topic_score_codex":0.00009476979,"about_ca_topic_score_gemma":0.0005566452,"teacher_disagreement_score":0.88597745,"about_ca_system_score_codex":0.00031950988,"about_ca_system_score_gemma":0.00051062455,"threshold_uncertainty_score":0.99971664},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010900723,0.00007330733,0.98133314,0.005549769,0.0006135269,0.0011544034,0.000013852688,0.00003122548,0.011219905],"genre_scores_gemma":[0.52289516,0.000104794235,0.45934913,0.013416837,0.00082593167,0.00021450355,0.000015228837,0.00011113249,0.00306732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756044,0.000057935584,0.00035923094,0.0007442654,0.0007578859,0.00052025693],"domain_scores_gemma":[0.99621123,0.0017399486,0.00021158799,0.0010838644,0.00060011155,0.00015323507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016439502,0.00031550313,0.00030228,0.00039772133,0.0007306521,0.0007951866,0.004031577,0.00017905945,0.00013869653],"category_scores_gemma":[0.00008992115,0.00018012391,0.000114588394,0.00045096263,0.0016553298,0.00026364555,0.00036510293,0.00046393546,0.00001988187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065696363,0.000016126258,0.000002980237,0.00003866396,0.000017853807,0.000003115869,0.0023682364,0.09541656,0.0000150580545,0.85270995,0.000110760426,0.04929412],"study_design_scores_gemma":[0.0001894965,0.00025189755,0.000031200903,0.00028865781,0.0000052615287,0.0000066082994,0.0000033432343,0.5646193,0.00044408182,0.42953506,0.004336084,0.0002890213],"about_ca_topic_score_codex":0.0005709793,"about_ca_topic_score_gemma":0.013834349,"teacher_disagreement_score":0.52288425,"about_ca_system_score_codex":0.00015428595,"about_ca_system_score_gemma":0.0025506932,"threshold_uncertainty_score":0.77198917},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017069393,0.00049024035,0.99440426,0.0010132906,0.0010861701,0.0002814941,0.0000055702894,0.0001582792,0.0008537853],"genre_scores_gemma":[0.04534763,0.000013903476,0.9529647,0.0010644797,0.0003763418,0.000008980039,0.0000051225256,0.00003479666,0.00018401543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99543273,0.00007592602,0.0006983807,0.0017629026,0.0011022176,0.0009278434],"domain_scores_gemma":[0.9977648,0.00049518415,0.00027008748,0.00115816,0.00011098387,0.00020077622],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017213983,0.00050052913,0.0005295096,0.00069485867,0.00020947508,0.00041308228,0.0030120478,0.0003363854,0.00002075881],"category_scores_gemma":[0.00010134616,0.0004672296,0.00010240569,0.0007843565,0.0007177412,0.0005633482,0.00073506346,0.0008247123,0.000058431473],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016292983,0.00009791225,0.00044419474,0.00005203054,0.000013740487,0.00055649976,0.0068913456,0.019616218,0.0022422944,0.0023198815,0.00038050138,0.9673691],"study_design_scores_gemma":[0.0005080719,0.00025172267,0.00040920218,0.0009404998,0.000004108603,0.00014888203,6.284657e-7,0.85402817,0.0022769037,0.13985871,0.0007406907,0.0008324285],"about_ca_topic_score_codex":0.00004073931,"about_ca_topic_score_gemma":0.000020509768,"teacher_disagreement_score":0.96653664,"about_ca_system_score_codex":0.00029728367,"about_ca_system_score_gemma":0.00037017724,"threshold_uncertainty_score":0.9997779},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09701182,0.00018174549,0.90207714,0.0001618135,0.00035749693,0.00014897862,0.0000024112685,0.00005460845,0.000003962],"genre_scores_gemma":[0.8952649,0.000023203253,0.104467206,0.00015511228,0.00004986237,0.0000079322845,0.00001978017,0.000011243266,7.336419e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987937,0.00003334218,0.00021017285,0.00046151856,0.00026795763,0.00023328565],"domain_scores_gemma":[0.9995818,0.000049800237,0.000041384676,0.00023721975,0.00002843408,0.00006133641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025140963,0.00018660525,0.00023653758,0.00032630743,0.000030328218,0.00016820949,0.0002834055,0.00009285009,0.0000065926024],"category_scores_gemma":[0.000026318326,0.00014855813,0.00002336417,0.00056415884,0.00018680027,0.00014434135,0.00023777373,0.00042053877,0.0000023523414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010787244,0.000013757996,0.029950727,0.00011403972,0.000006514458,0.000005645879,0.0011441922,0.8989248,0.00008498481,9.70959e-7,0.0000035118214,0.06974973],"study_design_scores_gemma":[0.0003144583,0.000016947053,0.005694639,0.0004582091,0.000007723834,0.000003787667,0.0000027530355,0.9922771,0.0008198032,0.00021546384,0.0000028209924,0.00018632045],"about_ca_topic_score_codex":0.00017462329,"about_ca_topic_score_gemma":0.0002613416,"teacher_disagreement_score":0.7982531,"about_ca_system_score_codex":0.000117132324,"about_ca_system_score_gemma":0.000050551513,"threshold_uncertainty_score":0.6058025},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011522111,0.00019655444,0.9836969,0.00021125349,0.0023010713,0.0006960329,0.000003783575,0.00015788886,0.0012144214],"genre_scores_gemma":[0.40979007,0.0000031763948,0.5891461,0.00047076814,0.00041654857,0.000009208033,0.0000048387997,0.000032159864,0.00012712856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952599,0.00023972876,0.0007806377,0.0021453635,0.00086561654,0.0007087553],"domain_scores_gemma":[0.9967525,0.0004457285,0.00037990612,0.0021101462,0.00016117499,0.00015051935],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0025567228,0.00050386693,0.0006529543,0.0009639917,0.00030370854,0.0020928024,0.005756617,0.00035985094,0.000004337447],"category_scores_gemma":[0.00009482691,0.00048911065,0.00006308165,0.00048329803,0.00020985551,0.0019732292,0.0029975933,0.0007933869,0.000021980117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019380035,0.000040352803,0.0003496348,0.0001317184,0.0000053162175,0.00025652285,0.0041501056,0.4654202,0.005615671,0.05045782,0.0000039623083,0.4735493],"study_design_scores_gemma":[0.0003431526,0.00013084458,0.000116575604,0.0013678583,0.0000022337952,0.00007192282,0.0000018840404,0.98036957,0.0005851484,0.016346049,0.00008052823,0.0005842376],"about_ca_topic_score_codex":0.000109534834,"about_ca_topic_score_gemma":0.00027134368,"teacher_disagreement_score":0.5149494,"about_ca_system_score_codex":0.00070305966,"about_ca_system_score_gemma":0.000940419,"threshold_uncertainty_score":0.99975604},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08713528,0.000690185,0.90848964,0.002535952,0.0006077559,0.00025057961,4.0109842e-7,0.00013811815,0.00015211034],"genre_scores_gemma":[0.7265195,0.000048637005,0.27279523,0.00059490703,0.000023537264,0.000013954059,3.597476e-7,0.0000033543097,4.7470138e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797624,0.000048640835,0.00026344004,0.0008994642,0.00026590048,0.00054631586],"domain_scores_gemma":[0.99848306,0.00025133052,0.00008057758,0.0010646551,0.000064564374,0.00005581183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006148129,0.00016149115,0.00023785328,0.0005682117,0.00008951428,0.000091926326,0.0026022694,0.00015161632,0.00001045282],"category_scores_gemma":[0.000054224645,0.00014685513,0.00003247814,0.0029034864,0.00036100775,0.0006754665,0.0007192185,0.0004150531,0.000097102056],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026880539,0.00008695255,0.023761515,0.000009223005,8.330608e-7,0.000012501584,0.0005178057,0.017133884,0.0007532268,0.09974684,0.000005942944,0.85796857],"study_design_scores_gemma":[0.0003802399,0.000112868605,0.012598107,0.000030343748,4.96228e-7,0.00004662283,8.9015936e-7,0.6805594,0.005064747,0.29984596,0.0010842456,0.00027607993],"about_ca_topic_score_codex":0.000025649984,"about_ca_topic_score_gemma":0.00011827074,"teacher_disagreement_score":0.85769254,"about_ca_system_score_codex":0.000087715176,"about_ca_system_score_gemma":0.00014244043,"threshold_uncertainty_score":0.5988579},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050187627,0.0001691872,0.98597974,0.0006770088,0.0025180376,0.00024656722,9.524785e-7,0.00021877821,0.010184721],"genre_scores_gemma":[0.0042703957,0.00003993661,0.9910024,0.0018780134,0.0005105278,0.0000029702994,0.000008826144,0.000037283848,0.0022496462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686384,0.000037654187,0.00036479183,0.0013657565,0.00083702954,0.000530909],"domain_scores_gemma":[0.99783504,0.00025522083,0.00025242465,0.0013348326,0.00017650131,0.0001459937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006260365,0.00043350295,0.00041312855,0.000730363,0.00019368132,0.00053541875,0.0028822783,0.00028095298,0.00007384433],"category_scores_gemma":[0.00008657294,0.00039762727,0.00011326581,0.00054475554,0.00029761906,0.0005729656,0.0011628094,0.0008947198,0.00021566234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.277935e-7,0.0000071693967,0.000024843102,0.000013404386,0.000003352925,0.000022666352,0.00021478541,0.7052806,0.0000036245963,0.005694447,0.000013206897,0.28872097],"study_design_scores_gemma":[0.0001865532,0.000098707336,0.000020129452,0.00013774252,0.0000038792796,0.000038441493,5.200104e-8,0.98072195,0.00004674277,0.016742328,0.0015388399,0.00046461844],"about_ca_topic_score_codex":0.000020649115,"about_ca_topic_score_gemma":0.000025938842,"teacher_disagreement_score":0.28825635,"about_ca_system_score_codex":0.00019041565,"about_ca_system_score_gemma":0.00047140237,"threshold_uncertainty_score":0.99984753},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035366241,0.0003566941,0.9896115,0.0002660291,0.0031080719,0.00116978,0.00000443943,0.00043707681,0.0015097952],"genre_scores_gemma":[0.5163431,0.000011465345,0.48113614,0.00068440934,0.0014024214,0.000015952119,0.000011568647,0.00007376222,0.00032115993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942355,0.00006458518,0.00093597994,0.0025383825,0.00098326,0.001242261],"domain_scores_gemma":[0.9944616,0.0011416551,0.0006541558,0.002594141,0.0008960916,0.00025234715],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019239327,0.0007984957,0.00080810726,0.00087693275,0.0009546739,0.0014257987,0.0040240893,0.0004861749,0.000015776552],"category_scores_gemma":[0.00042003245,0.00081667694,0.00025872164,0.0007383974,0.0007983733,0.0007831296,0.0026727293,0.000763695,0.000045538047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001648048,0.00004675522,0.00000800901,0.0002118748,0.000031688134,0.000026524362,0.0075508617,0.07876658,0.015703911,0.0020585954,0.00023761578,0.8953411],"study_design_scores_gemma":[0.0004324025,0.0003010874,0.000019926967,0.0013219131,0.000018237555,0.00006830819,0.0000018854713,0.92117286,0.03481163,0.037783198,0.0030034946,0.0010650574],"about_ca_topic_score_codex":0.000022592196,"about_ca_topic_score_gemma":0.000042531276,"teacher_disagreement_score":0.894276,"about_ca_system_score_codex":0.0004939703,"about_ca_system_score_gemma":0.0006325879,"threshold_uncertainty_score":0.99961084},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027099822,0.00042860003,0.9904226,0.0018605223,0.002177348,0.00079445116,0.000088705725,0.00010092239,0.0038558189],"genre_scores_gemma":[0.095635906,0.00068747497,0.8748584,0.0073556593,0.017744863,0.00008230309,0.00067390327,0.00013037265,0.0028311436],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730504,0.000056775796,0.00029092393,0.0011119937,0.00074349914,0.00049176335],"domain_scores_gemma":[0.9975522,0.00038116897,0.00021216906,0.0013730141,0.00032264166,0.00015878717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002683615,0.0002364655,0.00024827078,0.0003020956,0.0009616351,0.00047530088,0.0034601542,0.00033061396,0.00009469907],"category_scores_gemma":[0.0015204694,0.0002370376,0.000043325257,0.0003087992,0.001749508,0.0010880798,0.0013602201,0.0003726197,0.000058693622],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007431792,0.00006121009,0.00013793359,0.00038140052,0.00003055977,0.000014097645,0.023659425,0.00037031848,0.00030333636,0.032301355,0.0062400135,0.93642604],"study_design_scores_gemma":[0.00026654004,0.00019109373,0.000056168938,0.0004987416,0.00004369643,0.0000067897217,0.000009624755,0.045045722,0.00063902047,0.7950543,0.15754892,0.0006393787],"about_ca_topic_score_codex":0.00094201043,"about_ca_topic_score_gemma":0.006100105,"teacher_disagreement_score":0.93578666,"about_ca_system_score_codex":0.0002629959,"about_ca_system_score_gemma":0.0011591864,"threshold_uncertainty_score":0.96661127},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010445102,0.000024587856,0.9969009,0.00087781233,0.00006627565,0.00033238344,0.000006951388,0.000010601246,0.0007359758],"genre_scores_gemma":[0.6384983,0.000001279259,0.36101517,0.00022521723,0.000066901885,0.000049245475,0.000017701832,0.000017848475,0.00010832835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985208,0.00006182821,0.00036237924,0.0004456074,0.00028471515,0.00032468155],"domain_scores_gemma":[0.9978632,0.0010875422,0.0002361813,0.0006724111,0.00010779855,0.000032873253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008824611,0.00023970063,0.00031243858,0.00040302635,0.0001674466,0.000090007496,0.0008980287,0.000067756424,0.000139398],"category_scores_gemma":[0.000033186883,0.0001884096,0.00012890736,0.00028677064,0.00022094158,0.000052796164,0.00013604607,0.0003293808,0.0000032820124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007391064,0.0003102286,0.0003616947,0.00011043533,0.00013200224,0.0000013881697,0.0024202524,0.23395939,0.047952525,0.13251264,0.000051229927,0.5821143],"study_design_scores_gemma":[0.00020715855,0.00028257637,0.00003798051,0.0003267028,0.000022605482,3.5393214e-7,0.000001545,0.7176769,0.005321639,0.2759327,0.0000101887,0.00017967951],"about_ca_topic_score_codex":0.00010043965,"about_ca_topic_score_gemma":0.00005456997,"teacher_disagreement_score":0.6374538,"about_ca_system_score_codex":0.00008438562,"about_ca_system_score_gemma":0.0001235006,"threshold_uncertainty_score":0.7683121},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029766295,0.00015629787,0.9640003,0.00006893724,0.004614824,0.0012220425,0.000012915298,0.00012286993,0.000035549507],"genre_scores_gemma":[0.4943238,0.0000041540425,0.50550497,0.00004107203,0.000094678784,0.000018581793,0.0000024866256,0.000009961524,3.246668e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99515384,0.00040232565,0.0009612185,0.0017243034,0.0011731242,0.0005851949],"domain_scores_gemma":[0.9951096,0.00046904353,0.00087130006,0.0025727293,0.000857126,0.00012020817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028681816,0.0004235804,0.0006587257,0.00075555395,0.00012663109,0.00052765745,0.0047342777,0.00022095483,0.0000014309786],"category_scores_gemma":[0.00066381984,0.00040050666,0.00011125761,0.0016340164,0.0007105326,0.000734551,0.0031769066,0.0008586838,0.000013331944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008603268,0.00009449077,0.0002119974,0.00022958653,0.0000073448023,0.000003975442,0.0006162429,0.9138051,0.0024541623,0.009065997,8.91728e-7,0.07350157],"study_design_scores_gemma":[0.00015176118,0.00015025276,0.00066331,0.0005399568,0.000007981211,0.00004099985,0.0000010125749,0.96388257,0.016690953,0.017479615,0.0000051456627,0.00038646022],"about_ca_topic_score_codex":0.00015254469,"about_ca_topic_score_gemma":0.0000034890707,"teacher_disagreement_score":0.4645575,"about_ca_system_score_codex":0.0006088398,"about_ca_system_score_gemma":0.0012827672,"threshold_uncertainty_score":0.9998447},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007772304,0.0007656847,0.99581516,0.00038355583,0.0014290635,0.00091697456,0.000009293875,0.00017062233,0.00043190594],"genre_scores_gemma":[0.02139198,0.000051829487,0.97575516,0.0013405762,0.0008328135,0.00007614402,0.000013110422,0.000076416734,0.00046198265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955527,0.000046149144,0.0007182425,0.0019132787,0.00089472585,0.0008748906],"domain_scores_gemma":[0.9955826,0.0009435328,0.00038133812,0.0024714002,0.0004345764,0.00018659658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013561769,0.00056661206,0.00067536026,0.0007715823,0.0004147091,0.000456238,0.0032791002,0.00032904593,0.000034586803],"category_scores_gemma":[0.00012929643,0.00055110146,0.0003115989,0.0006791454,0.001017584,0.00046401878,0.0011119246,0.00040599197,0.000059967442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009744873,0.00014891935,0.000086276166,0.00029664606,0.00006546381,0.000042915766,0.0009914495,0.20496643,0.0006287139,0.009085373,0.0003231282,0.78335494],"study_design_scores_gemma":[0.00016426871,0.00013514227,0.000050172403,0.000429148,0.00003158267,0.00010805395,5.8619175e-8,0.9451089,0.001114952,0.048652682,0.0034873532,0.00071767165],"about_ca_topic_score_codex":0.00002907285,"about_ca_topic_score_gemma":0.000036336558,"teacher_disagreement_score":0.7826373,"about_ca_system_score_codex":0.00044204964,"about_ca_system_score_gemma":0.00076382107,"threshold_uncertainty_score":0.99969405},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000113654234,0.00027942433,0.99748194,0.00058752624,0.0009854372,0.00028538713,0.00010694203,0.000037881236,0.00012180776],"genre_scores_gemma":[0.013797442,0.000040014645,0.98230356,0.001724461,0.0008983912,0.000025342606,0.0006570661,0.000025086463,0.000528641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692285,0.0000274096,0.00043113768,0.0015598971,0.0005930812,0.00046564624],"domain_scores_gemma":[0.9978535,0.00060855545,0.0002839911,0.0009221384,0.00017830636,0.00015350681],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008940253,0.00037194425,0.00060618226,0.001405356,0.0002781299,0.00042338786,0.0013428063,0.00020835434,0.00012360717],"category_scores_gemma":[0.000049528506,0.00033500162,0.000201292,0.0007131668,0.0005667966,0.0003462896,0.0008946623,0.00022896432,0.000026004116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004480991,0.00018316237,0.0026826449,0.00010119333,0.0018372771,0.00006973899,0.003517617,0.019701859,0.00028130377,0.013228649,0.003603533,0.9547482],"study_design_scores_gemma":[0.00032956165,0.00015325323,0.0004357407,0.00004637864,0.0001797829,0.000015762309,2.2035165e-7,0.9766583,0.0003589962,0.011270181,0.010111419,0.00044043787],"about_ca_topic_score_codex":0.000019821578,"about_ca_topic_score_gemma":0.00016212814,"teacher_disagreement_score":0.9569564,"about_ca_system_score_codex":0.00011382645,"about_ca_system_score_gemma":0.00014448153,"threshold_uncertainty_score":0.9999102},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002683403,0.00014147532,0.99334186,0.00045355433,0.002133615,0.00069411297,0.000012611252,0.00023831023,0.0027161192],"genre_scores_gemma":[0.014359509,0.0000059250046,0.98085433,0.0012394253,0.0016041845,0.000014272753,0.0000087405715,0.000077863006,0.0018357688],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951621,0.00007991849,0.0004943267,0.0020676332,0.0010922534,0.0011037257],"domain_scores_gemma":[0.9964555,0.0010287369,0.00045212652,0.0013469834,0.00050216075,0.0002145054],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020208263,0.0007691321,0.00081494654,0.0007617333,0.0006894762,0.001523143,0.0025525452,0.00042683425,0.000026228607],"category_scores_gemma":[0.0001776376,0.00064836786,0.00020727766,0.0006068931,0.0008889964,0.0013681583,0.00081181544,0.0009871962,0.000018707386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029611963,0.00004452271,0.0000016143534,0.00023723008,0.0000817801,0.00054615847,0.022521311,0.016038304,0.03943925,0.010150437,0.0001443133,0.910499],"study_design_scores_gemma":[0.005753908,0.0023555092,0.000039580926,0.0040181684,0.000121229554,0.00066366955,0.000012501082,0.37020603,0.13553998,0.4691015,0.0074242186,0.0047637164],"about_ca_topic_score_codex":0.000014081379,"about_ca_topic_score_gemma":0.000054351007,"teacher_disagreement_score":0.90573525,"about_ca_system_score_codex":0.00028936262,"about_ca_system_score_gemma":0.0009222169,"threshold_uncertainty_score":0.9995968},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013584414,0.0002454454,0.9939053,0.0015406342,0.0010705232,0.00063012395,0.000040898984,0.00052197784,0.0006866573],"genre_scores_gemma":[0.9108217,0.00000615892,0.08746544,0.0012013062,0.00036772303,0.000037448463,0.000011353948,0.00003121645,0.00005764307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99629045,0.00005486363,0.0004907202,0.0017917147,0.0007150681,0.0006571605],"domain_scores_gemma":[0.99651754,0.000569081,0.0003412264,0.0020829933,0.00026585162,0.0002233092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011931683,0.0005677747,0.0006037883,0.0007107937,0.00047637278,0.0003310826,0.0026682802,0.0006563637,0.00000988406],"category_scores_gemma":[0.00009685648,0.0005182117,0.00009463143,0.00067082257,0.0013813438,0.00010063117,0.00084316754,0.0009791908,0.000036015394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066904955,0.000329589,0.00018338222,0.00030377842,0.00006474652,0.0005936807,0.0013558154,0.027674228,0.00021469314,0.58254856,0.00064886385,0.38601577],"study_design_scores_gemma":[0.0004154475,0.00029464232,0.00010494471,0.0003964171,0.000010450693,0.00007893264,3.6362783e-7,0.9596722,0.0005049173,0.034302544,0.0036393036,0.0005798074],"about_ca_topic_score_codex":0.00002519221,"about_ca_topic_score_gemma":0.000059077487,"teacher_disagreement_score":0.931998,"about_ca_system_score_codex":0.0004276536,"about_ca_system_score_gemma":0.00036965034,"threshold_uncertainty_score":0.99972695},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019424603,0.00016527562,0.98426175,0.000013276873,0.010397208,0.00090499263,0.000015890051,0.00028560654,0.002013548],"genre_scores_gemma":[0.98059297,0.000015253427,0.007834727,0.000106650645,0.010664507,0.00006528982,0.000010987536,0.00014685788,0.0005627534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978813,0.000020261776,0.00048128024,0.0006809405,0.0004674629,0.00046875793],"domain_scores_gemma":[0.998794,0.00029491173,0.00013713431,0.00049809733,0.00016799444,0.000107870386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008715068,0.0004032362,0.0004475708,0.0006494163,0.00021325491,0.00021233049,0.00040083716,0.00087785,0.00005827313],"category_scores_gemma":[0.00016759585,0.0003786641,0.00021739538,0.00035208135,0.00018970425,0.00017454063,0.00009322736,0.0007177819,0.0000686129],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006658441,0.000007861834,0.000007852012,0.000065016604,0.00003980408,0.000007623566,0.00025397548,0.03978271,0.0025816576,0.00007181049,0.00055795483,0.95655715],"study_design_scores_gemma":[0.0031871,0.0022895175,0.000030035724,0.001604496,0.00010863795,0.00018375977,0.0000013692251,0.70092726,0.09143782,0.03091626,0.16688494,0.0024287954],"about_ca_topic_score_codex":0.000025628051,"about_ca_topic_score_gemma":0.00018630683,"teacher_disagreement_score":0.9786505,"about_ca_system_score_codex":0.00043240705,"about_ca_system_score_gemma":0.00012674338,"threshold_uncertainty_score":0.99986655},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0879571,0.00024447162,0.91004086,0.000036101683,0.0009417971,0.00069987006,0.000013280739,0.000047833404,0.00001869233],"genre_scores_gemma":[0.729666,0.00014457101,0.2691041,0.00014178375,0.0008504337,0.000024175875,0.000022851254,0.000028074764,0.00001802624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996487,0.00007562633,0.00052048475,0.0018144285,0.0006129251,0.00048952823],"domain_scores_gemma":[0.997868,0.00029109287,0.00035265257,0.0013043722,0.00007241894,0.000111456655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001030349,0.00042860667,0.0005604258,0.0012312458,0.00043966738,0.00047916517,0.0012863869,0.0002113167,0.000010526762],"category_scores_gemma":[0.000025673235,0.00037703445,0.00006697702,0.0008044512,0.0005635693,0.0007507975,0.0025228,0.00051663246,0.000001232528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011580508,0.00003866506,0.00011059679,0.00006053449,0.00006306356,0.000014925106,0.0034790635,0.3637613,0.0024595454,0.000084691965,8.453306e-7,0.6298109],"study_design_scores_gemma":[0.00042744682,0.0004709594,0.00029103976,0.0003713231,0.00004349553,0.000035878566,0.0000012505075,0.9922988,0.0019778705,0.0029528965,0.000673035,0.00045602585],"about_ca_topic_score_codex":0.00011414774,"about_ca_topic_score_gemma":0.0010685244,"teacher_disagreement_score":0.64170885,"about_ca_system_score_codex":0.00043500238,"about_ca_system_score_gemma":0.00010641583,"threshold_uncertainty_score":0.99986815},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17352453,0.0002106099,0.8206683,0.0016768614,0.0006686272,0.0014114294,0.000008827015,0.00004467093,0.0017861746],"genre_scores_gemma":[0.9944933,0.0000057069974,0.004004393,0.0011166097,0.00022269165,0.00002257486,0.000009036381,0.000020239058,0.00010542441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964407,0.000041367362,0.0005705881,0.00069511146,0.0018691077,0.00038312137],"domain_scores_gemma":[0.9986702,0.00070153846,0.00010880579,0.0002151248,0.000054020515,0.00025031497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015114802,0.00025779678,0.0005565984,0.00077974214,0.000041841064,0.000041792246,0.00045283066,0.00028970867,0.0006750984],"category_scores_gemma":[0.0003318916,0.000223813,0.00007368712,0.0005315507,0.0009241348,0.000058652487,0.00028390094,0.00070377113,0.000029929106],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026502289,0.00019906063,0.0062913555,0.000022422233,0.000025886047,0.0002912129,0.015639167,0.004457356,0.0000043299406,0.00018967743,0.0000016656967,0.97261286],"study_design_scores_gemma":[0.05720797,0.014424531,0.3481037,0.07974925,0.0003908992,0.00041611076,0.0010254922,0.46178713,0.00027564654,0.01869414,0.012619149,0.0053059636],"about_ca_topic_score_codex":0.000006893248,"about_ca_topic_score_gemma":0.00009777985,"teacher_disagreement_score":0.96730685,"about_ca_system_score_codex":0.00020997356,"about_ca_system_score_gemma":0.00033038578,"threshold_uncertainty_score":0.9126829},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000043059904,0.00038619878,0.99375093,0.001612132,0.0016412812,0.0015772093,0.000022001555,0.00014380175,0.0008621259],"genre_scores_gemma":[0.008159294,0.00005607931,0.98956597,0.0009863992,0.000548553,0.00007313189,0.000020772,0.000037375263,0.0005524264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599445,0.000050655206,0.0005372618,0.0014763924,0.0011702267,0.00077102974],"domain_scores_gemma":[0.99653876,0.0011839271,0.00024181014,0.0015021152,0.000413434,0.00011995219],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017852468,0.00047141334,0.00044193649,0.0005090599,0.00055914634,0.0007552033,0.0035103767,0.00029156066,0.000014650921],"category_scores_gemma":[0.00003376868,0.00035755246,0.00022537085,0.00069410086,0.0009916406,0.0006472945,0.0011681322,0.00080713653,0.000046402572],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004130108,0.00002686204,0.0000016870914,0.000052570063,0.000012221735,0.000006452719,0.0005092943,0.020213574,0.00001469558,0.05572501,0.000053598316,0.9233799],"study_design_scores_gemma":[0.0002570904,0.00022097319,0.000015926405,0.00022112697,0.000008592446,0.000034918474,6.177453e-7,0.7740415,0.00035603857,0.22213846,0.0023435666,0.0003612197],"about_ca_topic_score_codex":0.000025396681,"about_ca_topic_score_gemma":0.00003465777,"teacher_disagreement_score":0.9230187,"about_ca_system_score_codex":0.00026464733,"about_ca_system_score_gemma":0.00072988466,"threshold_uncertainty_score":0.99988765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082401064,0.00046776902,0.99647367,0.00024435495,0.00025261636,0.0003979329,0.0000047628223,0.00003535512,0.0012995506],"genre_scores_gemma":[0.6720004,0.0007445031,0.31160077,0.0010784969,0.00092706585,0.00010200025,0.000011050694,0.00008809002,0.013447608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970544,0.00006498865,0.00053951103,0.0011340918,0.0007186687,0.00048834045],"domain_scores_gemma":[0.9965848,0.0024989983,0.0002991829,0.00038416398,0.00014846887,0.000084437466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036128236,0.0002608383,0.00036438616,0.00082696485,0.0004135717,0.00040906068,0.0009182745,0.0001893088,0.000112758236],"category_scores_gemma":[0.0004215658,0.00022558954,0.000075681244,0.0006281629,0.00041772742,0.00028697992,0.00024157604,0.0006777249,0.000029255752],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004873595,0.000008826134,0.000093485054,0.0000046739565,0.0000031054753,0.0000028526663,0.0004840061,0.02365889,0.000012719943,0.003011777,0.000014130037,0.97270066],"study_design_scores_gemma":[0.00015852507,0.00006249696,0.00004591732,0.00007674901,0.0000037286247,0.000019115618,0.000002466515,0.6539135,0.00008241141,0.33494845,0.01047254,0.00021408086],"about_ca_topic_score_codex":0.0000042945517,"about_ca_topic_score_gemma":0.000022805549,"teacher_disagreement_score":0.97248656,"about_ca_system_score_codex":0.00014487514,"about_ca_system_score_gemma":0.00011140921,"threshold_uncertainty_score":0.9199275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008701136,0.00021980278,0.99143803,0.0008323725,0.005153081,0.0013066328,0.000036326954,0.00044045283,0.00048628676],"genre_scores_gemma":[0.42138514,0.00003581497,0.5680476,0.00715288,0.0025371239,0.00008180948,0.00004724303,0.00015512106,0.0005572786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99317825,0.00010944388,0.0009546125,0.0027746072,0.0014014231,0.00158164],"domain_scores_gemma":[0.9937024,0.00181048,0.0006931301,0.002343071,0.0010923842,0.00035853128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001083841,0.0010483152,0.0010585291,0.00090945023,0.0006722982,0.0007032374,0.0044209594,0.0009433557,0.000032695767],"category_scores_gemma":[0.00010896311,0.0010233679,0.00040410834,0.00075664435,0.0010463152,0.00046499568,0.00082259957,0.0009657559,0.000035682784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005099095,0.00005167488,0.0000072380917,0.000039094182,0.000026903965,0.00005677098,0.00009212389,0.91394687,0.000071479764,0.045271166,0.00012809953,0.040257573],"study_design_scores_gemma":[0.0014996454,0.0004133123,0.000010023721,0.00047106665,0.000024513793,0.00004409896,8.8991605e-8,0.9449924,0.0004412556,0.050270718,0.00076471124,0.0010681221],"about_ca_topic_score_codex":0.000014155931,"about_ca_topic_score_gemma":0.00007259872,"teacher_disagreement_score":0.42339045,"about_ca_system_score_codex":0.0006915624,"about_ca_system_score_gemma":0.00076105277,"threshold_uncertainty_score":0.9992217},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004571246,0.000100511534,0.99168634,0.00019337222,0.0026251234,0.00031900327,0.0000028280717,0.0000984138,0.00040314958],"genre_scores_gemma":[0.83033085,0.0000170758,0.16852771,0.00042140254,0.00057327905,0.000007636016,0.0000051924007,0.000022205513,0.00009466305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968857,0.000098041965,0.0005236231,0.0012488931,0.0007245245,0.000519209],"domain_scores_gemma":[0.9982288,0.00022746228,0.00035482598,0.00074429007,0.00032653863,0.00011811468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011764003,0.0003758856,0.00035198164,0.0009658701,0.00029750713,0.00027189104,0.001511345,0.00037168118,0.000021551874],"category_scores_gemma":[0.00018070932,0.00037697988,0.00008031057,0.0008543826,0.00044024357,0.00085043145,0.00063258247,0.0007810032,0.00004006629],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029572579,0.00003996304,0.00061993324,0.00005787353,0.000009005775,0.000032617845,0.0072854566,0.004832272,0.0017889363,0.016763765,0.00000354489,0.96853703],"study_design_scores_gemma":[0.00025919967,0.00019994844,0.001628071,0.0004750123,0.000010494513,0.00005526934,0.00000500178,0.84448624,0.0089137945,0.14290008,0.00039444573,0.00067242415],"about_ca_topic_score_codex":0.000081921564,"about_ca_topic_score_gemma":0.00044799238,"teacher_disagreement_score":0.96786463,"about_ca_system_score_codex":0.00096102606,"about_ca_system_score_gemma":0.0005214552,"threshold_uncertainty_score":0.9998682},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007684223,0.0000144925,0.95983243,0.00019062842,0.0010272715,0.03806209,0.0000067339556,0.00050627795,0.0002832366],"genre_scores_gemma":[0.022087013,0.0000022456227,0.9531154,0.0014630725,0.0027638723,0.019782316,0.000027334456,0.00026162682,0.00049711566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929185,0.00009886248,0.0008425211,0.003167567,0.0013316429,0.001640929],"domain_scores_gemma":[0.9945947,0.0005468544,0.00065006583,0.003078815,0.0006912348,0.00043832138],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011111184,0.0011509428,0.0009447009,0.0007676332,0.0006546766,0.0012916292,0.005297071,0.00072428305,0.000023225788],"category_scores_gemma":[0.000024076095,0.00097205554,0.00019342663,0.00085742626,0.001388667,0.00091373327,0.0011732965,0.00097187643,0.000009538178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006696612,0.000058739282,0.000019060684,0.000084553896,0.000017248325,0.00008123446,0.0005490267,0.83471626,0.000050988143,0.0009480081,0.000033062155,0.16337484],"study_design_scores_gemma":[0.0010305649,0.0010959723,0.00001928571,0.0012798988,0.000011079813,0.00016108008,7.9357744e-7,0.9904786,0.0005977103,0.0018283732,0.002195482,0.0013011699],"about_ca_topic_score_codex":0.000018290517,"about_ca_topic_score_gemma":0.00038544377,"teacher_disagreement_score":0.16207367,"about_ca_system_score_codex":0.000447555,"about_ca_system_score_gemma":0.0005068662,"threshold_uncertainty_score":0.99974513},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024050907,0.000673095,0.98677665,0.0006185689,0.003633844,0.00031931512,0.0000017139714,0.00048045296,0.0074722795],"genre_scores_gemma":[0.03593212,0.00009927731,0.959867,0.001716294,0.0005447223,0.000011845594,0.0000058038545,0.000041588435,0.0017813549],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744016,0.000019800864,0.000333259,0.0011156878,0.00065695227,0.00043414105],"domain_scores_gemma":[0.9973107,0.0005851371,0.00023660545,0.0015524428,0.00019751127,0.000117601085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006454819,0.00039719598,0.00034024662,0.00065322046,0.00011285987,0.0005468198,0.003134626,0.0002996427,0.000045552693],"category_scores_gemma":[0.00013513553,0.00037584576,0.00009160082,0.00045584215,0.00016474139,0.00087995926,0.00093119417,0.0007344397,0.00012794348],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016627257,0.000021431433,0.000054971366,0.000043014425,0.0000055612004,0.000013221135,0.0001933284,0.006417473,0.000033461158,0.031253483,0.00021002759,0.96175236],"study_design_scores_gemma":[0.00024229762,0.00036487696,0.0004473043,0.0010823874,0.000019453797,0.00030444894,1.7701164e-7,0.4517383,0.0017582265,0.3907792,0.15133646,0.0019268685],"about_ca_topic_score_codex":0.000032124073,"about_ca_topic_score_gemma":0.000009327591,"teacher_disagreement_score":0.9598255,"about_ca_system_score_codex":0.00024069057,"about_ca_system_score_gemma":0.001314436,"threshold_uncertainty_score":0.99986935},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015932649,0.00013358977,0.98677707,0.0010591653,0.0032953524,0.0005467136,0.000012114888,0.0001627086,0.0064200284],"genre_scores_gemma":[0.7812667,0.000063495725,0.2119492,0.0049970387,0.00073384255,0.000018877943,0.00003518936,0.00006641457,0.0008692576],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956555,0.000041556683,0.0005815074,0.0017310979,0.0011984814,0.00079186214],"domain_scores_gemma":[0.99701,0.00045426103,0.00028315943,0.0018537983,0.00021495107,0.00018382136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075361284,0.0006073933,0.0005514213,0.0012573401,0.00033944016,0.0008713484,0.0036326717,0.00030097147,0.00008698836],"category_scores_gemma":[0.000046564044,0.0005369253,0.00024090875,0.0008630548,0.0005042728,0.0005877913,0.0011381315,0.0010874955,0.00016308404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012665923,0.000073325646,0.000112134076,0.00003207764,0.000023756096,0.000052231273,0.001715577,0.003830502,0.00012809823,0.2780195,0.00019091318,0.7158092],"study_design_scores_gemma":[0.0017379817,0.0019190699,0.0019180168,0.0011749695,0.00003585889,0.00020006337,0.0000030321826,0.43550482,0.0030310166,0.52363205,0.027474137,0.0033689882],"about_ca_topic_score_codex":0.00006330152,"about_ca_topic_score_gemma":0.00020639929,"teacher_disagreement_score":0.7796734,"about_ca_system_score_codex":0.00032051312,"about_ca_system_score_gemma":0.0007087949,"threshold_uncertainty_score":0.99970824},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006689285,0.0002682699,0.99319994,0.0010589539,0.0006356362,0.00045318628,0.0000017897496,0.00009914921,0.004216183],"genre_scores_gemma":[0.116073504,0.00035871973,0.8779163,0.002618657,0.00034153264,0.000009016571,0.000015432233,0.000050504525,0.0026163738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970826,0.000043064407,0.00029778335,0.001146463,0.00096294604,0.00046717466],"domain_scores_gemma":[0.9984016,0.00027266465,0.00008277184,0.0008629706,0.0002233586,0.00015667496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011213935,0.00028806395,0.00029262682,0.00071241084,0.00017904918,0.00070686295,0.0016544047,0.00021284926,0.000032871016],"category_scores_gemma":[0.00004372845,0.0002608121,0.00004891962,0.00043846603,0.000388299,0.00072690553,0.0012595047,0.00059075124,0.00009094614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032828304,0.000016672298,0.00008463953,0.000053573334,0.0000060771104,0.00001646762,0.0007723316,0.081280634,0.00013890537,0.12842387,0.000016780814,0.7891868],"study_design_scores_gemma":[0.00022711961,0.00014964293,0.00015332933,0.00014022653,0.0000017837102,0.00002412238,8.470464e-8,0.9527111,0.00013428957,0.045294337,0.0008413169,0.00032266942],"about_ca_topic_score_codex":0.000015624231,"about_ca_topic_score_gemma":0.00003042975,"teacher_disagreement_score":0.87143046,"about_ca_system_score_codex":0.00014764161,"about_ca_system_score_gemma":0.00042551168,"threshold_uncertainty_score":0.9999844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006141555,0.00032500905,0.9954668,0.00006797624,0.00068763306,0.00009478689,0.000007864434,0.00011470369,0.0026210262],"genre_scores_gemma":[0.9583999,0.00005517137,0.039903294,0.00018750972,0.0003008583,0.0000016221617,0.00003251633,0.00003818267,0.0010809527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987026,0.0000058501264,0.0002257891,0.0004339064,0.0004006278,0.00023123567],"domain_scores_gemma":[0.999397,0.00005625662,0.000051086783,0.00036463534,0.00007975584,0.000051275292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023838799,0.00023744217,0.00025933553,0.00043387763,0.00005734787,0.000100390396,0.00031234074,0.00019052971,0.00003381728],"category_scores_gemma":[0.00002141477,0.00023428665,0.00008091781,0.00018213796,0.00007457719,0.000106823165,0.000072244075,0.00036198224,0.00017922118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.531401e-7,0.000001419877,0.0000038181183,0.000018935736,0.0000060767397,0.000003948833,0.00020088369,0.78462416,0.00008545567,0.00013617935,0.000009848345,0.21490864],"study_design_scores_gemma":[0.00007393518,0.0000230674,0.000016285838,0.00014399253,0.000012614755,0.000008728961,2.1613084e-7,0.98840284,0.00035507538,0.010519481,0.00018335413,0.00026039872],"about_ca_topic_score_codex":0.000020711599,"about_ca_topic_score_gemma":0.00005347286,"teacher_disagreement_score":0.9577857,"about_ca_system_score_codex":0.00013399847,"about_ca_system_score_gemma":0.000086011656,"threshold_uncertainty_score":0.95539325},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007805672,0.00023723432,0.99232316,0.0005147922,0.00076403207,0.0005388843,0.0000108679205,0.00010525411,0.005427731],"genre_scores_gemma":[0.3932079,0.000030678937,0.6053272,0.0010508767,0.00015796987,0.000012113902,0.00000639849,0.00002767805,0.00017916365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965472,0.00007456079,0.0005792139,0.0012036299,0.0010648218,0.0005305599],"domain_scores_gemma":[0.9956964,0.0011468894,0.0003594985,0.002614087,0.0001287891,0.0000543369],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013976498,0.0003989909,0.0005107126,0.00066003174,0.000075155396,0.00032275362,0.009094009,0.00024299583,0.00000921033],"category_scores_gemma":[0.00017043609,0.0003035001,0.00009110792,0.00070024835,0.00086054316,0.0006935518,0.0027515225,0.0008156074,0.00001097512],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006575999,0.000052325075,0.0002604776,0.0000917937,0.000008592853,0.00011958358,0.0065247216,0.022371832,0.00017463553,0.048319932,0.00022354617,0.921846],"study_design_scores_gemma":[0.00040148094,0.0005296534,0.0006164704,0.001999685,0.0000083521045,0.00015038176,0.0000017082119,0.8863071,0.005583078,0.100381054,0.0029797754,0.0010412665],"about_ca_topic_score_codex":0.00007585085,"about_ca_topic_score_gemma":0.00012770206,"teacher_disagreement_score":0.92080474,"about_ca_system_score_codex":0.0001162097,"about_ca_system_score_gemma":0.00046845482,"threshold_uncertainty_score":0.9999417},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000696612,0.00022774316,0.99339277,0.00038582867,0.0011625546,0.0007546589,0.0000011333462,0.0005721449,0.0028065478],"genre_scores_gemma":[0.7105548,0.00003237037,0.28705812,0.0010771136,0.00028696546,0.00003423835,0.000008520724,0.00009913581,0.0008487464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977605,0.000008014936,0.0004626722,0.0007695269,0.0002903146,0.0007089966],"domain_scores_gemma":[0.99855155,0.00042968782,0.000112372174,0.00067749404,0.00007457353,0.0001543242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004490153,0.00047577792,0.00051649695,0.0005543705,0.00021747955,0.000102175116,0.0010129277,0.000672167,0.000038435872],"category_scores_gemma":[0.00017881447,0.00049870805,0.00010914964,0.00027034793,0.00030365557,0.0001453215,0.0004308526,0.0013731569,0.000108940745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035459552,0.000001815311,0.00006600522,0.000051795967,0.000014741088,0.0000060502134,0.0004937096,0.8070879,0.00011032817,0.0062903813,0.000007156948,0.18586658],"study_design_scores_gemma":[0.00014610704,0.00016232468,0.00010677575,0.00051165535,0.0000121989915,0.000011833379,3.558414e-7,0.9457524,0.0012968236,0.04390089,0.007476886,0.0006217865],"about_ca_topic_score_codex":0.0000035037444,"about_ca_topic_score_gemma":0.000028237704,"teacher_disagreement_score":0.7098582,"about_ca_system_score_codex":0.00050694286,"about_ca_system_score_gemma":0.00022311404,"threshold_uncertainty_score":0.99974644},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016764583,0.00031742718,0.96767277,0.00008424065,0.00022839812,0.00013268885,0.000005433479,0.00041223058,0.031130064],"genre_scores_gemma":[0.34351313,0.00004697159,0.6534158,0.00062223297,0.0007710928,0.000027035789,0.000022679367,0.000104944585,0.0014760925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989968,0.0000016562644,0.00019752163,0.00034054328,0.0002159164,0.0002475932],"domain_scores_gemma":[0.9994546,0.000044800152,0.000036002322,0.00036894996,0.000054529257,0.000041093557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001111155,0.0002192258,0.00018385533,0.00020752443,0.00007215786,0.0001459132,0.0005511171,0.00016411794,0.000019971752],"category_scores_gemma":[0.0000041036005,0.00021254712,0.000040017672,0.0001368245,0.0002816761,0.00008972652,0.00011675429,0.00039578186,0.00002503598],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.1792687e-7,0.0000075681637,0.000007631284,0.000075731565,0.0000037787975,0.000016037118,0.000062948675,0.081498384,0.00047960196,0.0035975387,0.00078958884,0.9134605],"study_design_scores_gemma":[0.000095580006,0.000028135817,0.000028879633,0.00029565234,0.000007873612,0.000033137316,2.1774587e-8,0.8274345,0.007340638,0.13188182,0.03225242,0.00060133846],"about_ca_topic_score_codex":0.000006612694,"about_ca_topic_score_gemma":0.000010556061,"teacher_disagreement_score":0.91285914,"about_ca_system_score_codex":0.000107740525,"about_ca_system_score_gemma":0.00005762769,"threshold_uncertainty_score":0.86674196},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022900183,0.00029465288,0.97618914,0.0004473559,0.0013027631,0.00030186673,0.0000014344799,0.0007685571,0.02067135],"genre_scores_gemma":[0.03355741,0.00007928969,0.9632008,0.0009450431,0.00039703585,0.000010452431,0.000003244304,0.000039934486,0.001766805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965621,0.000029387596,0.0005186539,0.001409094,0.00083105604,0.0006497087],"domain_scores_gemma":[0.99740195,0.000259329,0.0002978262,0.0015717889,0.0002866925,0.0001824383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000609793,0.00050555356,0.00047661207,0.00084666087,0.00025535372,0.00087717874,0.0038561274,0.00033416235,0.000055133005],"category_scores_gemma":[0.000068071466,0.00046563498,0.000115572104,0.0005370923,0.00033499772,0.0007239217,0.0016540051,0.00077030796,0.00020210774],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013401843,0.000019118792,0.000026662186,0.000029707855,0.000008895193,0.000044251712,0.00037643578,0.057111286,0.00007140547,0.0476012,0.0002633025,0.8944464],"study_design_scores_gemma":[0.0001369094,0.00010072725,0.000052375966,0.00036130872,0.0000033975653,0.000049956463,3.4088323e-8,0.76817566,0.0017992405,0.2220506,0.006487832,0.0007819828],"about_ca_topic_score_codex":0.000022984628,"about_ca_topic_score_gemma":0.0000075221933,"teacher_disagreement_score":0.8936644,"about_ca_system_score_codex":0.00030064277,"about_ca_system_score_gemma":0.0003381337,"threshold_uncertainty_score":0.9997795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000107240114,0.0019449181,0.97299635,0.006187789,0.005599492,0.0006934063,0.00000928553,0.00030115742,0.012160344],"genre_scores_gemma":[0.69465405,0.00045445707,0.29886943,0.002461151,0.002273421,0.000013842097,0.000014437611,0.00013778797,0.001121427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931113,0.0002515674,0.0009896663,0.0026449598,0.0018449187,0.0011576022],"domain_scores_gemma":[0.9928735,0.002461184,0.00068308023,0.0034285542,0.0003691832,0.00018453026],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.005019418,0.00085765426,0.0009055729,0.00077055657,0.00056437694,0.0012699916,0.0059104743,0.00054000894,0.000010580867],"category_scores_gemma":[0.00038662192,0.00062663207,0.00029870457,0.00086381444,0.00084132235,0.0011264432,0.0019666292,0.0015334006,0.0001621663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025200678,0.00006259481,0.0000126931745,0.000044053788,0.000021123376,0.00009559286,0.0015279076,0.012023672,0.0004870264,0.0060604243,0.00005518457,0.9795845],"study_design_scores_gemma":[0.0034787783,0.0036691728,0.002337045,0.0046260008,0.00006684466,0.00061836326,0.0000022305626,0.6057209,0.009660592,0.25852558,0.10602369,0.005270829],"about_ca_topic_score_codex":0.000034335884,"about_ca_topic_score_gemma":0.00020122943,"teacher_disagreement_score":0.9743137,"about_ca_system_score_codex":0.00037179154,"about_ca_system_score_gemma":0.0006059754,"threshold_uncertainty_score":0.99976677},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031284362,0.0003275899,0.9463136,0.01907495,0.0015556489,0.00066438946,0.0000099222225,0.0007305383,0.00003895153],"genre_scores_gemma":[0.73950475,0.000016601987,0.2580001,0.0021156815,0.00024012021,0.000097931406,0.0000052255077,0.00001891231,6.4965946e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946671,0.000094514064,0.00063042477,0.002775518,0.00091191544,0.0009204908],"domain_scores_gemma":[0.9963751,0.00030653845,0.00028360373,0.0026271737,0.00014550252,0.000262121],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0008832807,0.00062769646,0.0006958758,0.00065298163,0.00043765505,0.0005480269,0.007168189,0.00058989273,0.000007764178],"category_scores_gemma":[0.0001049992,0.00059584796,0.00018522763,0.0017499506,0.0007096032,0.00012590563,0.00376906,0.0024394416,0.000047096237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010655564,0.00026707083,0.0013551553,0.00008938317,0.000022322482,0.00010991008,0.004585011,0.38814545,0.00034832655,0.006551989,0.000065486754,0.59844923],"study_design_scores_gemma":[0.00023934519,0.00012687374,0.0015179543,0.00020783699,0.0000071625996,0.000018478742,0.0000010245278,0.8713501,0.007504214,0.11827627,0.0001483033,0.00060245063],"about_ca_topic_score_codex":0.00008364636,"about_ca_topic_score_gemma":0.00011513875,"teacher_disagreement_score":0.7082204,"about_ca_system_score_codex":0.00029273602,"about_ca_system_score_gemma":0.0005212508,"threshold_uncertainty_score":0.99986196},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014701774,0.00007884131,0.99517745,0.0006408177,0.0012903484,0.0003108852,0.000008971359,0.00076669443,0.0017113141],"genre_scores_gemma":[0.013371567,0.000026492333,0.98560625,0.00045483254,0.00030366503,0.000019369541,0.000008120343,0.000028996657,0.00018073303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972243,0.000011661579,0.00043355708,0.00094985944,0.00089281984,0.0004878029],"domain_scores_gemma":[0.99804616,0.00015045497,0.00013125062,0.0012986888,0.00021439875,0.00015902541],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005508173,0.0004270592,0.00034441924,0.0008632502,0.00021383238,0.0003502901,0.0032288525,0.0004283925,0.000051560863],"category_scores_gemma":[0.000011148424,0.00041887388,0.0001337108,0.0003991904,0.00045592964,0.00083025056,0.0005706254,0.0012899158,0.000062080195],"study_design_candidate":"design_other","study_design_consensus":null,"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.052635e-7,0.000014731196,0.0000056017657,0.000019815647,0.0000046063237,0.000018115392,0.0004524521,0.015658427,0.0003303316,0.25496086,0.000019388408,0.72851485],"study_design_scores_gemma":[0.00015543457,0.000091722664,0.000086707536,0.00023478788,0.0000053421013,0.00013089496,7.723482e-9,0.5821444,0.0028634146,0.3634826,0.049969528,0.0008352015],"about_ca_topic_score_codex":0.000006492746,"about_ca_topic_score_gemma":0.000029647312,"teacher_disagreement_score":0.72767967,"about_ca_system_score_codex":0.00019795427,"about_ca_system_score_gemma":0.00040486146,"threshold_uncertainty_score":0.9998263},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008422696,0.000095325195,0.97385895,0.0014397281,0.0074323197,0.00040705968,0.0000080061745,0.00032113903,0.016353272],"genre_scores_gemma":[0.5993377,0.000023705472,0.39120415,0.0032459034,0.0018135069,0.00005036573,0.000012627158,0.000091825015,0.0042202356],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612695,0.000046132674,0.0005876955,0.001655407,0.0009641037,0.0006197387],"domain_scores_gemma":[0.99616003,0.00088750926,0.0003779496,0.0019092096,0.00042612784,0.0002391933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084090524,0.00053879555,0.0005699605,0.0011882145,0.00034967533,0.0009385872,0.003428348,0.00037473248,0.00013665423],"category_scores_gemma":[0.00015143612,0.0005264401,0.0002057338,0.00060943054,0.00059617625,0.0013341932,0.0014909337,0.0018807994,0.00050957414],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002899377,0.000037265985,0.000057446137,0.000020176421,0.000014998448,0.000073867945,0.0005467746,0.00019512924,0.0012330312,0.005521969,0.000048426642,0.992248],"study_design_scores_gemma":[0.0011213213,0.0004236616,0.0006677442,0.0018154867,0.00003920359,0.0020549274,7.515105e-7,0.33655292,0.018822128,0.39474565,0.23978712,0.003969103],"about_ca_topic_score_codex":0.00006737221,"about_ca_topic_score_gemma":0.0010253624,"teacher_disagreement_score":0.9882789,"about_ca_system_score_codex":0.00030183973,"about_ca_system_score_gemma":0.00064919255,"threshold_uncertainty_score":0.9997187},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005422036,0.00020825065,0.9929711,0.00041666662,0.0013534469,0.0002997503,0.000010707075,0.00012418057,0.0040736524],"genre_scores_gemma":[0.6234276,0.000051580646,0.3743711,0.0011125271,0.00018043583,0.0000033516033,0.000011060877,0.000040479666,0.0008018124],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970218,0.00003465003,0.0005344261,0.0010639268,0.00089192967,0.00045327502],"domain_scores_gemma":[0.9974517,0.00032743244,0.00043276997,0.0014338194,0.00026206765,0.000092199916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009242818,0.00037344883,0.0005335715,0.00067554263,0.00009468151,0.00021228925,0.0032142717,0.0001710034,0.000028033919],"category_scores_gemma":[0.000042980028,0.00033064923,0.00012302717,0.00047394764,0.000995024,0.00058407563,0.0012079689,0.00045262717,0.00007353604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068887216,0.000038710117,0.00006290998,0.000096974094,0.000014382117,0.000026270582,0.0007721477,0.017030325,0.0007689033,0.34306327,0.000024593232,0.6380946],"study_design_scores_gemma":[0.00017383692,0.00010543236,0.00036674947,0.00022395176,0.0000031161403,0.000024765928,6.959358e-8,0.43110278,0.0039390363,0.5634733,0.00023807798,0.00034889058],"about_ca_topic_score_codex":0.000030317084,"about_ca_topic_score_gemma":0.000026743943,"teacher_disagreement_score":0.63774574,"about_ca_system_score_codex":0.00016282315,"about_ca_system_score_gemma":0.0005053388,"threshold_uncertainty_score":0.9999145},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030753657,0.00017981336,0.96718264,0.00029599076,0.0005567446,0.00046792912,0.0000064646933,0.000057145095,0.00049963477],"genre_scores_gemma":[0.94898826,0.000025608224,0.050310217,0.00037932722,0.00017368216,0.00000740055,0.000023364684,0.000024832469,0.000067337896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719465,0.00011617135,0.000580995,0.000886019,0.0008266385,0.00039553983],"domain_scores_gemma":[0.99816465,0.00043115907,0.0003528067,0.00074502954,0.00024321255,0.00006315319],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001195279,0.00034314793,0.00038532255,0.0007560835,0.00023827334,0.00043032804,0.0012987151,0.000186489,0.0000264089],"category_scores_gemma":[0.000029470326,0.00028391325,0.00009696447,0.0004845169,0.00028315175,0.000665718,0.0002572433,0.0005768679,0.000016930575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016006328,0.00006263775,0.00015244402,0.00007303371,0.0000076211627,0.000014705475,0.0005228906,0.8460069,0.016073555,0.00065895816,0.0000249534,0.13638632],"study_design_scores_gemma":[0.00043485,0.000068574154,0.00013070527,0.00047057524,0.0000057875855,0.000013442586,0.00000135259,0.98009884,0.014381305,0.003988592,0.00004228401,0.00036366272],"about_ca_topic_score_codex":0.00007030231,"about_ca_topic_score_gemma":0.000038212744,"teacher_disagreement_score":0.9182346,"about_ca_system_score_codex":0.00021813325,"about_ca_system_score_gemma":0.00020988903,"threshold_uncertainty_score":0.9999613},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047775284,0.00026071307,0.9778093,0.00034161794,0.0034519173,0.00042787445,0.0000028330444,0.0002492358,0.01740871],"genre_scores_gemma":[0.020030845,0.000035049055,0.97735167,0.0011783905,0.00035968795,0.000016309692,0.000003206747,0.000034444816,0.0009904095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960776,0.000053883006,0.00060470245,0.0015525301,0.0009986298,0.0007126522],"domain_scores_gemma":[0.9967377,0.00027121993,0.00036049925,0.002157909,0.00026965005,0.0002030044],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011586368,0.0005270415,0.00049098575,0.00089759124,0.00019770325,0.00071572664,0.005406405,0.0003834034,0.000090567206],"category_scores_gemma":[0.00017298214,0.0004780617,0.00012392264,0.0005659397,0.0007129315,0.0012415245,0.0018491363,0.00093860115,0.0006580728],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019138292,0.00001457909,0.0000144004425,0.00002256199,0.000006115921,0.0000194053,0.00043321855,0.0010101552,0.00016302009,0.11726748,0.000052949912,0.8809942],"study_design_scores_gemma":[0.00015910214,0.00015709826,0.00024616806,0.000347429,0.000004951295,0.00009993184,8.961969e-8,0.72098047,0.00315454,0.26915076,0.004926713,0.00077271444],"about_ca_topic_score_codex":0.000027848095,"about_ca_topic_score_gemma":0.0000139006015,"teacher_disagreement_score":0.8802215,"about_ca_system_score_codex":0.00038420098,"about_ca_system_score_gemma":0.00037938313,"threshold_uncertainty_score":0.99997485},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000073892414,0.00014802814,0.9956047,0.00059992605,0.0016269363,0.0008522831,0.0000051847887,0.00017900468,0.00091003446],"genre_scores_gemma":[0.103664644,0.000023450793,0.893874,0.00070179865,0.0003960445,0.000024646584,0.0000199336,0.0000585626,0.0012369059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643636,0.00006953209,0.00040882797,0.0014337302,0.0011121605,0.0005393942],"domain_scores_gemma":[0.99722856,0.00032986674,0.0004212753,0.0013859908,0.00053527404,0.00009904377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032688226,0.00052462734,0.00042814744,0.0005314004,0.00037959107,0.00050170376,0.002333007,0.00022484001,0.000030675554],"category_scores_gemma":[0.00006664505,0.000354585,0.000093943454,0.00078063045,0.0006407164,0.00080474536,0.0007177985,0.0006503084,0.00005166973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021426218,0.000028974626,0.000025037065,0.000015654708,0.000021353531,0.000030360228,0.0005887756,0.7674169,0.00013151484,0.040963676,0.0000071639865,0.19074917],"study_design_scores_gemma":[0.0007669003,0.00016426836,0.00032691107,0.00011736857,0.000011708238,0.00009397035,3.3313052e-7,0.9631791,0.00039563247,0.03420818,0.00021367669,0.0005219447],"about_ca_topic_score_codex":0.00002866088,"about_ca_topic_score_gemma":0.00010065482,"teacher_disagreement_score":0.1957622,"about_ca_system_score_codex":0.0005383552,"about_ca_system_score_gemma":0.00079372706,"threshold_uncertainty_score":0.9998906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003411332,0.00012869568,0.9954331,0.000417082,0.0001256594,0.00031936317,0.000005416459,0.000039939187,0.0031896383],"genre_scores_gemma":[0.98974085,0.00001849469,0.008458569,0.00040976985,0.0009167994,0.000008920773,0.000019898951,0.000024708885,0.00040196988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984934,0.000028256038,0.0002749235,0.00058126095,0.0003289776,0.0002932052],"domain_scores_gemma":[0.9989577,0.00024393522,0.00022842389,0.00044596865,0.00008898367,0.000035008896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004940792,0.00028568335,0.00040541295,0.0001501057,0.0002421501,0.00023106196,0.00063292007,0.00010506196,0.000035006073],"category_scores_gemma":[0.0000028748889,0.00020776158,0.00014095688,0.00014606699,0.0004702874,0.000111707304,0.00048741556,0.0004987309,0.0000045641336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010165211,0.000010816262,0.0010724762,0.000009483537,0.000038626207,6.45845e-7,0.00057984516,0.40607965,0.0000024804835,0.13755958,0.00009682127,0.45453942],"study_design_scores_gemma":[0.00016779304,0.000008398018,0.0000773593,0.00005325806,0.000023178207,3.6751334e-7,2.2334969e-7,0.7725324,0.000009597421,0.2268132,0.00012998092,0.00018426],"about_ca_topic_score_codex":0.000058561505,"about_ca_topic_score_gemma":0.00005932919,"teacher_disagreement_score":0.98939973,"about_ca_system_score_codex":0.000057681063,"about_ca_system_score_gemma":0.000105813815,"threshold_uncertainty_score":0.84722716},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025938496,0.00048064234,0.97846234,0.00060702965,0.0012730295,0.00024131211,0.0000016994748,0.0055725644,0.013335438],"genre_scores_gemma":[0.06943122,0.000076984616,0.9264593,0.002274126,0.00065967836,0.00001345731,0.0000033803744,0.000058538444,0.001023316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961137,0.000028927463,0.00048150923,0.0016352244,0.000986338,0.0007543016],"domain_scores_gemma":[0.99658203,0.0007298617,0.00025640277,0.002005162,0.00023721157,0.00018930928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008908914,0.00056446897,0.00054978643,0.0008924595,0.00027893367,0.00067231664,0.004409973,0.0003551415,0.000026604324],"category_scores_gemma":[0.00025043957,0.0005168619,0.0001403369,0.0007317366,0.0006258251,0.00050060643,0.0015920149,0.0008443161,0.00008416364],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016165208,0.000021750417,0.00024580353,0.000019848245,0.0000059858403,0.00019304403,0.00030469353,0.0015107793,0.000015986161,0.013810021,0.0005444786,0.983326],"study_design_scores_gemma":[0.00012229738,0.00015622345,0.00011382841,0.00050553464,0.0000050725343,0.0002313058,1.5178628e-8,0.099638574,0.00044256766,0.8931824,0.0048573334,0.0007448701],"about_ca_topic_score_codex":0.000053475058,"about_ca_topic_score_gemma":0.00002314078,"teacher_disagreement_score":0.98258114,"about_ca_system_score_codex":0.00026164314,"about_ca_system_score_gemma":0.00043557698,"threshold_uncertainty_score":0.9997283},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0654619,0.03244053,0.85483146,0.009448294,0.017737858,0.0074150013,0.0005590226,0.00051804614,0.0115878815],"genre_scores_gemma":[0.9949216,0.00025863707,0.0019246481,0.0012178122,0.0007808899,0.000012756407,0.000038792135,0.00005030419,0.0007945177],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.997129,0.00003075319,0.00027185387,0.0010175199,0.0010139524,0.00053688843],"domain_scores_gemma":[0.99813503,0.0002597524,0.00014140761,0.0010867863,0.00017810399,0.00019893002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026546145,0.0005241776,0.00069868343,0.00046131288,0.00018898249,0.0004488559,0.00062129745,0.00026091113,0.000031825377],"category_scores_gemma":[0.00003079076,0.00029105175,0.0040456164,0.00037494843,0.0006932501,0.0002065196,0.00015991194,0.0006490155,0.000035185934],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039124672,0.00028577523,0.14888753,0.0006329437,0.006039248,0.0010016224,0.0012129806,0.002568374,0.00021504151,0.0020006185,0.00029588275,0.83646876],"study_design_scores_gemma":[0.0044249,0.00095400773,0.9329421,0.0016343324,0.0046592974,0.00024049137,0.000004905464,0.0021136745,0.0011146929,0.04639432,0.0037518158,0.0017654927],"about_ca_topic_score_codex":0.000021728472,"about_ca_topic_score_gemma":0.000009203995,"teacher_disagreement_score":0.92945975,"about_ca_system_score_codex":0.00013706775,"about_ca_system_score_gemma":0.00040786515,"threshold_uncertainty_score":0.99995416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.054117e-7,0.00009459993,0.99250484,0.0013192698,0.0028303121,0.002008594,0.000017278324,0.0004193365,0.0008052544],"genre_scores_gemma":[0.0013611311,0.000014404009,0.99521226,0.0021225305,0.0003063836,0.000084218176,0.000023875911,0.00007908976,0.0007961358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952486,0.00003644522,0.00072171417,0.0021282507,0.0010932756,0.0007716742],"domain_scores_gemma":[0.9955671,0.0013163373,0.0004884938,0.0017238493,0.0007072856,0.00019692109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009915797,0.0007395722,0.00069656345,0.0013308271,0.000295652,0.00051032816,0.0029713265,0.00048191196,0.00005463355],"category_scores_gemma":[0.0003559296,0.00070602214,0.00020541629,0.0008430041,0.0002287601,0.00048123888,0.00086827495,0.0005643563,0.00004474459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014276601,0.00003570937,0.0000019353506,0.000046214584,0.000014789592,0.0000055617675,0.00020199812,0.9023377,0.0000038913176,0.061548993,0.00007037184,0.03571861],"study_design_scores_gemma":[0.00046533582,0.0005859187,0.0000052073974,0.0003998291,0.000018574392,0.000025123687,9.8693135e-8,0.9584059,0.00018103443,0.038768772,0.0004271201,0.0007170452],"about_ca_topic_score_codex":0.000011334377,"about_ca_topic_score_gemma":0.000016726079,"teacher_disagreement_score":0.05606829,"about_ca_system_score_codex":0.0005010555,"about_ca_system_score_gemma":0.000617011,"threshold_uncertainty_score":0.9995391},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005162483,0.000033003333,0.9781865,0.0014419265,0.004849677,0.0005706717,0.000009522243,0.000114551935,0.014277928],"genre_scores_gemma":[0.5148772,0.000013667113,0.4805887,0.0019346771,0.0012805597,0.000022168077,0.000017217902,0.000046631554,0.0012191525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99471015,0.000039913957,0.0008030385,0.0015148371,0.0023664068,0.00056567043],"domain_scores_gemma":[0.9967056,0.0005225745,0.0007000245,0.00067681447,0.001269563,0.00012542408],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016449168,0.00048706576,0.0004926595,0.0008490024,0.00021203455,0.0004954811,0.0061333096,0.00029890751,0.000024368604],"category_scores_gemma":[0.00018281618,0.0003796418,0.0002319948,0.001583197,0.0012424714,0.00055821677,0.002336993,0.0009834518,0.000017781405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003145144,0.00045266963,0.0012223329,0.00016851646,0.000050533472,0.000025447514,0.0014065981,0.09620532,0.00040719038,0.17797332,0.0007025492,0.72135407],"study_design_scores_gemma":[0.0003148377,0.00017566084,0.0021320418,0.00041856873,0.0000055181677,0.000045792112,5.6444134e-7,0.66418904,0.0012090439,0.33083197,0.00029022436,0.0003867562],"about_ca_topic_score_codex":0.000016238544,"about_ca_topic_score_gemma":0.000027341497,"teacher_disagreement_score":0.72096735,"about_ca_system_score_codex":0.00088408706,"about_ca_system_score_gemma":0.0013626815,"threshold_uncertainty_score":0.99986553},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032639853,0.00051610486,0.9862089,0.0012409368,0.0019338134,0.0006939883,0.0000033531608,0.00094257784,0.005196301],"genre_scores_gemma":[0.83226585,0.00007316634,0.16658863,0.0006413892,0.0001630792,0.000012562008,0.0000046229284,0.00003280311,0.00021789587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954658,0.000120779536,0.0007415865,0.002055289,0.0008534686,0.0007630704],"domain_scores_gemma":[0.99307376,0.0015723616,0.00051558495,0.004337013,0.00037090917,0.0001303844],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002468163,0.00059870264,0.000720335,0.00083906867,0.00050698966,0.0006907541,0.0055262307,0.00060668425,0.00002832702],"category_scores_gemma":[0.00070592505,0.00056781014,0.00019416535,0.00091290637,0.0010563314,0.0010699135,0.0031063007,0.001774762,0.00011864198],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068730915,0.00005210752,0.001135363,0.00012445786,0.000013398608,0.000010206365,0.000542797,0.012934415,0.0003726215,0.036134716,0.000017417431,0.9486556],"study_design_scores_gemma":[0.00066426926,0.00042825585,0.0028466473,0.00083689135,0.000015312902,0.000084257656,0.0000022488396,0.6278551,0.015090074,0.347489,0.0027261248,0.001961823],"about_ca_topic_score_codex":0.000055882236,"about_ca_topic_score_gemma":0.00015618096,"teacher_disagreement_score":0.9466938,"about_ca_system_score_codex":0.00064555433,"about_ca_system_score_gemma":0.0007436567,"threshold_uncertainty_score":0.9998543},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025125209,0.00010453951,0.9915754,0.0005675321,0.0026567874,0.00066000567,0.0000031063728,0.0001510798,0.0017689859],"genre_scores_gemma":[0.7718698,0.00002670475,0.2239127,0.0009775611,0.0005955675,0.000019416839,0.0000056919253,0.000034302273,0.002558273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659085,0.000040967367,0.00039116494,0.0014257248,0.0008646561,0.00068664196],"domain_scores_gemma":[0.9984046,0.0003665587,0.00015820986,0.000597059,0.00033049422,0.00014303256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011365591,0.00040158792,0.00044021872,0.00070735026,0.0003800382,0.0006610926,0.00182342,0.00033892939,0.000033768563],"category_scores_gemma":[0.000085781234,0.00033787428,0.00019435439,0.0004329641,0.0004933108,0.00069199584,0.0008733192,0.00065315416,0.00008645741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031246935,0.00006987356,0.00020103362,0.00009071483,0.000017797038,0.000025363543,0.0016069788,0.0089887325,0.0011094972,0.11558342,0.000017791923,0.87225753],"study_design_scores_gemma":[0.00039271775,0.0012178284,0.00024257657,0.00020210672,0.0000073686356,0.00006314485,0.0000026493647,0.93448484,0.004016768,0.05742102,0.0012814003,0.00066755846],"about_ca_topic_score_codex":0.000015808679,"about_ca_topic_score_gemma":0.000028650138,"teacher_disagreement_score":0.9254961,"about_ca_system_score_codex":0.00033383767,"about_ca_system_score_gemma":0.0004722624,"threshold_uncertainty_score":0.9999073},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020340472,0.00051241234,0.98835456,0.0006946344,0.0025823985,0.00038820805,0.0000028348747,0.00031424366,0.0069473037],"genre_scores_gemma":[0.12059111,0.0002659777,0.87407655,0.0026384003,0.00081434316,0.000013403072,0.0000039216484,0.00007429753,0.0015220294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951412,0.000041698408,0.0007320589,0.0019242251,0.0012608604,0.00089993095],"domain_scores_gemma":[0.9963138,0.00068506476,0.00034382733,0.0021372722,0.0002828005,0.00023724594],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006659071,0.0006474384,0.00069565774,0.00084784796,0.00032566756,0.0005533834,0.0057283053,0.0004269898,0.00004957758],"category_scores_gemma":[0.00017207612,0.0006036862,0.00021061586,0.0007294415,0.0016162315,0.00079513935,0.0018017458,0.00097265065,0.00034112734],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061154205,0.000030957675,0.000029578023,0.000016671404,0.000011005192,0.00028010036,0.0014288583,0.011347192,0.0001945099,0.010036014,0.0001010494,0.976518],"study_design_scores_gemma":[0.00017772961,0.0002785771,0.0000685765,0.00041659572,0.000008889992,0.00032750037,2.1441818e-7,0.70363504,0.01794047,0.25578192,0.019734597,0.0016299066],"about_ca_topic_score_codex":0.000027944332,"about_ca_topic_score_gemma":0.00003989942,"teacher_disagreement_score":0.974888,"about_ca_system_score_codex":0.00032721227,"about_ca_system_score_gemma":0.00066611933,"threshold_uncertainty_score":0.9996512},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015250608,0.0020037577,0.9726465,0.0029935616,0.0006817421,0.00024242306,0.0000011141434,0.0002205031,0.021195149],"genre_scores_gemma":[0.22359306,0.0025160399,0.7598849,0.0083594555,0.00076878007,0.000011943003,0.0000099840045,0.000054344182,0.004801508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971745,0.000056440807,0.00039856945,0.0011376691,0.00069459714,0.00053819775],"domain_scores_gemma":[0.9968878,0.00037743134,0.00020562806,0.0020723483,0.00029131275,0.00016546858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008216215,0.00044094483,0.00045179072,0.0006014963,0.0003722251,0.00064258784,0.004808441,0.00021960896,0.000035707275],"category_scores_gemma":[0.00007409246,0.00041165904,0.000111402056,0.000724937,0.00048214215,0.0005265733,0.0015281456,0.0008521261,0.00008191997],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013862875,0.000014243685,0.000010778132,0.0000045788315,0.000003942072,0.000022524879,0.00038577395,0.004482829,0.00008704709,0.08087301,0.000070592585,0.9140433],"study_design_scores_gemma":[0.0003894297,0.0002518104,0.00036136172,0.0006686349,0.0000082002125,0.00008877421,1.2550132e-7,0.73758817,0.0015195555,0.21469983,0.043066565,0.0013575375],"about_ca_topic_score_codex":0.0000030556241,"about_ca_topic_score_gemma":0.00012642254,"teacher_disagreement_score":0.91268575,"about_ca_system_score_codex":0.00026117315,"about_ca_system_score_gemma":0.000417584,"threshold_uncertainty_score":0.9998335},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011688001,0.002560226,0.9856042,0.0005725628,0.0027969205,0.0002463142,0.00000361829,0.000329845,0.007769397],"genre_scores_gemma":[0.41091052,0.00024311894,0.57989836,0.0051637217,0.0020976425,0.000019318919,0.0000080518075,0.00009741072,0.0015618472],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99614626,0.000035862777,0.0004809842,0.0013858101,0.0009867942,0.0009642609],"domain_scores_gemma":[0.99704283,0.00033280673,0.00024157883,0.0019898855,0.0001146057,0.0002782906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011739486,0.0005842281,0.00054530345,0.0007478142,0.0002801566,0.0007000638,0.0047853068,0.00034772206,0.00012794841],"category_scores_gemma":[0.000049553873,0.00050755567,0.00016425013,0.0006014608,0.00079430424,0.0009909754,0.0020249148,0.0008336508,0.00035144115],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018529305,0.000021560445,0.000038489645,0.000019045201,0.000006902652,0.000053283416,0.00077263714,0.0008574426,0.00012030886,0.077290006,0.000036527304,0.92078197],"study_design_scores_gemma":[0.000500973,0.00023262425,0.00038146324,0.0007761127,0.000021021862,0.00044722136,3.7698442e-7,0.33817917,0.002555446,0.63128287,0.0233515,0.002271206],"about_ca_topic_score_codex":0.000013270873,"about_ca_topic_score_gemma":0.000013471374,"teacher_disagreement_score":0.91851074,"about_ca_system_score_codex":0.0002537779,"about_ca_system_score_gemma":0.00041511032,"threshold_uncertainty_score":0.9997376},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018614333,0.00016573336,0.9931229,0.002735013,0.001239838,0.0013173788,0.000013150557,0.00018597413,0.0012014251],"genre_scores_gemma":[0.008611409,0.000021226413,0.98507875,0.0042263623,0.0005372737,0.00006475668,0.000025826303,0.00004557861,0.0013887972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673444,0.000020861718,0.00045153307,0.0015683939,0.000621918,0.0006028322],"domain_scores_gemma":[0.9969628,0.0011105195,0.00033800135,0.0012549906,0.00020839555,0.00012532926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049532385,0.00043591912,0.00039801723,0.00044759564,0.00024749333,0.0003297723,0.002781995,0.0002058034,0.000010750921],"category_scores_gemma":[0.00006613897,0.00042391586,0.00011514844,0.00052420906,0.0002864906,0.00067027943,0.00079222023,0.00045548985,0.00008806966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053669614,0.000017164319,0.0000105072895,0.000036235804,0.000006320302,0.0000064288415,0.00021098542,0.12370597,0.0015669715,0.06472026,0.00029946366,0.8094143],"study_design_scores_gemma":[0.00032653523,0.00016385931,0.000040624684,0.00012498737,0.0000056520034,0.00002977209,7.128842e-8,0.76595116,0.0025034286,0.22248256,0.0077999174,0.00057143165],"about_ca_topic_score_codex":0.0000031726731,"about_ca_topic_score_gemma":0.000027835622,"teacher_disagreement_score":0.8088429,"about_ca_system_score_codex":0.000286745,"about_ca_system_score_gemma":0.0003968175,"threshold_uncertainty_score":0.99982125},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002951384,0.0001489661,0.9585803,0.0012942184,0.00078902923,0.00025029242,0.000021375208,0.000065124405,0.038555566],"genre_scores_gemma":[0.8549613,0.000040379004,0.10544891,0.0025544513,0.0015876468,0.00002192238,0.000003110049,0.000058987203,0.035323292],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588275,0.000047128768,0.0006500666,0.001402552,0.0015873313,0.00043018768],"domain_scores_gemma":[0.994503,0.0029283112,0.0003167884,0.00170345,0.00038255527,0.00016585251],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027451029,0.0003321491,0.00044294805,0.00072146964,0.00023377182,0.00037918755,0.0031789253,0.00023476657,0.0007038426],"category_scores_gemma":[0.0009783225,0.00020777936,0.00015166968,0.0005079397,0.0015594879,0.0002776117,0.000713866,0.00042134314,0.0014909769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005540798,0.000010914255,0.00003999232,0.000001855533,0.0000025081404,0.000008870917,0.00018833797,0.0017125303,0.00023046999,0.059230532,0.00006975865,0.9384987],"study_design_scores_gemma":[0.0001405264,0.00004100032,0.000102910824,0.00010394409,0.000003750819,0.000018203962,2.497962e-7,0.015664602,0.0014119392,0.93165356,0.050534874,0.00032443745],"about_ca_topic_score_codex":0.0000023118844,"about_ca_topic_score_gemma":0.000023790955,"teacher_disagreement_score":0.93817425,"about_ca_system_score_codex":0.00008963231,"about_ca_system_score_gemma":0.00026965237,"threshold_uncertainty_score":0.9992865},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060609007,0.0004609036,0.9860639,0.001031678,0.0013381895,0.00043961886,0.000004078117,0.00027296357,0.010328055],"genre_scores_gemma":[0.040757477,0.000094036295,0.9504874,0.0057037356,0.0003434285,0.000022836497,0.0000061905757,0.000107833985,0.0024770654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99483544,0.00008317207,0.0005236324,0.0020222398,0.0014480496,0.0010874445],"domain_scores_gemma":[0.99605334,0.00084560656,0.00025170448,0.0021877694,0.00036484346,0.0002967288],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013940576,0.0006208141,0.00060229277,0.0013175728,0.000353446,0.0006032265,0.005383205,0.00035061085,0.00006649008],"category_scores_gemma":[0.00024424033,0.0005795294,0.00016081723,0.0012150486,0.0011836976,0.0008627123,0.0016526264,0.0014209929,0.00015242562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009341768,0.00003381321,0.000031063013,0.000040931627,0.000016559188,0.0002692782,0.00058017095,0.0089050885,0.0004334283,0.5047911,0.00007243248,0.48481682],"study_design_scores_gemma":[0.00027987818,0.00014068952,0.000025108397,0.00020329434,0.0000033269005,0.00014755687,9.487751e-8,0.070973165,0.0019669454,0.9201951,0.005313026,0.00075180485],"about_ca_topic_score_codex":0.000007847268,"about_ca_topic_score_gemma":0.000022277245,"teacher_disagreement_score":0.48406503,"about_ca_system_score_codex":0.00034478426,"about_ca_system_score_gemma":0.00048756076,"threshold_uncertainty_score":0.99999815},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039027716,0.0022907439,0.9878455,0.0003259073,0.0025094799,0.00021798121,0.000010875382,0.00023594349,0.0065245475],"genre_scores_gemma":[0.14730099,0.00017353498,0.8490532,0.0019263399,0.0014178444,0.000006962456,0.000020551013,0.000043440836,0.000057120786],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962526,0.000034542678,0.00045423175,0.0014013096,0.00096996373,0.00088738004],"domain_scores_gemma":[0.99703217,0.0003312837,0.000247625,0.0019426793,0.00015624653,0.00029001973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010457654,0.0005269151,0.00047572292,0.0009181731,0.00034595613,0.00077964325,0.0040556067,0.00035613822,0.000058635105],"category_scores_gemma":[0.00005156865,0.00048776605,0.00017915877,0.0007913543,0.00072223076,0.0015461063,0.0020898168,0.00095917174,0.000103481834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019805088,0.000025763924,0.00007729034,0.000024843435,0.0000063611296,0.000034371213,0.0006580338,0.00032959622,0.000066170716,0.21431391,0.000026460124,0.7844352],"study_design_scores_gemma":[0.0002813051,0.000104461025,0.00037166648,0.0004668532,0.000014156185,0.00014712916,1.4812281e-7,0.0777561,0.0011533317,0.89851016,0.01991466,0.0012800526],"about_ca_topic_score_codex":0.000022401498,"about_ca_topic_score_gemma":0.00004696699,"teacher_disagreement_score":0.78315514,"about_ca_system_score_codex":0.00015713734,"about_ca_system_score_gemma":0.00035149447,"threshold_uncertainty_score":0.9997574},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030123527,0.000092684226,0.99611706,0.0012583465,0.000117981755,0.0012109241,0.000014695596,0.0000721068,0.00081499456],"genre_scores_gemma":[0.08081621,0.00009606302,0.91746694,0.0006922819,0.00015395321,0.000028009877,0.000024032905,0.000020486308,0.00070202065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879664,0.0000024805445,0.00024809517,0.0005741889,0.00018246403,0.00019610944],"domain_scores_gemma":[0.999143,0.000105781386,0.0001361796,0.0003770039,0.00017008769,0.00006792399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014947867,0.0001973686,0.00031478904,0.00015230436,0.000084337415,0.000034261207,0.00010490176,0.0001520958,0.0000041373933],"category_scores_gemma":[0.000029025732,0.00017634504,0.000045676785,0.00007394545,0.0004047359,0.000104460145,0.000053760403,0.0002584791,0.0000019145775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013559117,0.000048668207,0.000042929216,0.00024230163,0.000011408598,0.0000028245177,0.00030497988,0.1633034,0.057121783,0.029804029,0.000052874842,0.7489292],"study_design_scores_gemma":[0.00053104194,0.0001651896,0.000032896176,0.00031896777,0.000023413564,0.000044863435,1.591621e-7,0.928494,0.009161724,0.059742115,0.001284153,0.00020148965],"about_ca_topic_score_codex":0.000004047871,"about_ca_topic_score_gemma":0.000015661912,"teacher_disagreement_score":0.7651906,"about_ca_system_score_codex":0.00008943362,"about_ca_system_score_gemma":0.00018753659,"threshold_uncertainty_score":0.7191142},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012689604,0.00039829954,0.96912545,0.0011791284,0.0022971253,0.00027371338,0.000007285509,0.00024824077,0.02645808],"genre_scores_gemma":[0.022911103,0.00020157218,0.969917,0.004157385,0.0018471585,0.000009028607,0.000008846121,0.000037695794,0.00091019645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965346,0.000022628301,0.0004556748,0.0014618896,0.0009265608,0.0005986903],"domain_scores_gemma":[0.9978285,0.0001598841,0.0002136747,0.0014786577,0.00014455216,0.00017477409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066505227,0.00044323283,0.00039645034,0.00062225584,0.0002403665,0.0004603519,0.0029670165,0.00034581046,0.00004980595],"category_scores_gemma":[0.00003718697,0.00038537226,0.00013142462,0.00049273495,0.000453037,0.00075244653,0.0010741756,0.0007476007,0.00016789735],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021643314,0.000018068415,0.000020720518,0.000011032307,0.0000049906043,0.000059683833,0.0002526523,0.013707748,0.000014011349,0.013036513,0.00021927805,0.97265315],"study_design_scores_gemma":[0.00029199646,0.00022020873,0.0001686902,0.00024435457,0.000008407524,0.00013797854,6.6347674e-8,0.77119493,0.00012799574,0.18567468,0.041240163,0.0006905184],"about_ca_topic_score_codex":0.000013450168,"about_ca_topic_score_gemma":0.00003103106,"teacher_disagreement_score":0.97196263,"about_ca_system_score_codex":0.0003222448,"about_ca_system_score_gemma":0.00035273528,"threshold_uncertainty_score":0.9998598},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010310119,0.0011150081,0.9906897,0.0005328396,0.002318535,0.00026717564,0.0000030988363,0.00014819934,0.0048223636],"genre_scores_gemma":[0.3351216,0.000059103728,0.6605886,0.0017223773,0.0015356286,0.000009335327,0.000015964359,0.000029270299,0.0009181136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967809,0.000034085973,0.00044713248,0.001213072,0.0009600224,0.0005648114],"domain_scores_gemma":[0.9977313,0.00037175135,0.00020414955,0.0012176291,0.00026622057,0.00020893272],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012128721,0.000389162,0.00035601362,0.0007194898,0.0002291329,0.00038044376,0.0021118033,0.00024260716,0.00006370719],"category_scores_gemma":[0.00008677181,0.0003688152,0.000121952435,0.0006780825,0.00032641177,0.0008872832,0.0010466278,0.00055025413,0.0001662242],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001974901,0.000027155955,0.000045796598,0.000016317976,0.000004987192,0.000010949595,0.00023213,0.025031399,0.000092148606,0.058022562,0.000025123414,0.9164895],"study_design_scores_gemma":[0.00025341433,0.00012966062,0.0009613394,0.0001297576,0.000009075516,0.000086836866,4.092037e-8,0.49772072,0.0022212197,0.48627216,0.011329531,0.0008862553],"about_ca_topic_score_codex":0.0000072527264,"about_ca_topic_score_gemma":0.000020799973,"teacher_disagreement_score":0.9156032,"about_ca_system_score_codex":0.00028408962,"about_ca_system_score_gemma":0.0005152081,"threshold_uncertainty_score":0.9998764},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010867976,0.0005783464,0.9495208,0.0014834852,0.002710312,0.000188525,0.0000025001611,0.00029653477,0.045208592],"genre_scores_gemma":[0.033392865,0.0001171418,0.9477392,0.004364989,0.0022239164,0.000010082089,0.0000066190337,0.000082002116,0.012063193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595165,0.000036651905,0.00044997275,0.00167239,0.0011259425,0.0007633634],"domain_scores_gemma":[0.9973989,0.00033186955,0.00024621934,0.0016407206,0.00015575878,0.00022654455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007124342,0.00056137395,0.00051474216,0.00083987415,0.0003143508,0.0006859862,0.004138493,0.0003169371,0.00012808018],"category_scores_gemma":[0.00008036432,0.00050358824,0.0001591609,0.00062815734,0.0005164228,0.00048344172,0.0014647933,0.0013587165,0.00032305668],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.651175e-7,0.000019734478,0.00002900954,0.00001707834,0.000006617236,0.00013427464,0.00040080913,0.012072395,0.00001400553,0.03655237,0.00012773633,0.9506252],"study_design_scores_gemma":[0.0002025237,0.00014815286,0.00006615129,0.00017917308,0.000004904989,0.00013056041,2.6102693e-8,0.7745585,0.00016331626,0.21060559,0.013219632,0.00072150637],"about_ca_topic_score_codex":0.000021236778,"about_ca_topic_score_gemma":0.0000110181645,"teacher_disagreement_score":0.9499037,"about_ca_system_score_codex":0.00017740243,"about_ca_system_score_gemma":0.00022579325,"threshold_uncertainty_score":0.99974155},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003609065,0.0016948887,0.9843715,0.00081815314,0.003552574,0.00030378095,0.0000073699994,0.00028237145,0.008933296],"genre_scores_gemma":[0.13083872,0.00017431466,0.8632104,0.002957587,0.0018428084,0.000012296942,0.000011064438,0.00007196718,0.0008808322],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955563,0.000038644655,0.00054190273,0.0015584613,0.0012239363,0.0010807383],"domain_scores_gemma":[0.9966611,0.00045932352,0.00026492725,0.0020822997,0.00020578103,0.0003265591],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010542087,0.0006480042,0.00059961807,0.0010615421,0.0003827835,0.0005980547,0.005254863,0.00036310015,0.000102922626],"category_scores_gemma":[0.00005748378,0.00060370396,0.00022540861,0.00080452836,0.0008472628,0.0009803541,0.0025300204,0.0010988213,0.00021912968],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021257597,0.000034161872,0.00006217162,0.000021867485,0.000009989589,0.000068042114,0.0003966287,0.0009624982,0.000032290183,0.104539715,0.00003925823,0.89383125],"study_design_scores_gemma":[0.00037997498,0.00021284218,0.0007485012,0.00039632726,0.000014833716,0.0003222972,9.650576e-8,0.22077075,0.0010735147,0.7550288,0.019482454,0.0015696406],"about_ca_topic_score_codex":0.000028324113,"about_ca_topic_score_gemma":0.000060687504,"teacher_disagreement_score":0.8922616,"about_ca_system_score_codex":0.00025914964,"about_ca_system_score_gemma":0.0004222984,"threshold_uncertainty_score":0.9996414},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000148863,0.00022281482,0.99444,0.0011095259,0.0020186915,0.0013215271,0.000027700025,0.0006395049,0.00007133354],"genre_scores_gemma":[0.18706691,0.000010393871,0.8109917,0.00035856568,0.00020068845,0.00007993315,0.000047465524,0.000039766033,0.0012045652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965799,0.000038328588,0.00039503182,0.0017165092,0.00065836305,0.00061188685],"domain_scores_gemma":[0.9976558,0.00035402656,0.00041601024,0.0009809575,0.0004967924,0.00009641616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033313507,0.00056850567,0.00047070222,0.0012153223,0.00045640324,0.00053063384,0.0022129342,0.000681171,0.000009775139],"category_scores_gemma":[0.00010842838,0.000526703,0.00017797056,0.0007019401,0.00045567477,0.00075745356,0.0005189059,0.0007819743,0.000036979643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107658845,0.00072396407,0.0006516767,0.00028383793,0.000083742714,0.000019971552,0.0005782944,0.028329803,0.026225436,0.11517542,0.00041826596,0.82740194],"study_design_scores_gemma":[0.0012919098,0.0004115895,0.0009102071,0.00020569073,0.000016048523,0.000010470153,4.367565e-7,0.97700226,0.0074687805,0.0118635185,0.00019969372,0.00061939395],"about_ca_topic_score_codex":0.00001120112,"about_ca_topic_score_gemma":0.00006906439,"teacher_disagreement_score":0.9486725,"about_ca_system_score_codex":0.0009357487,"about_ca_system_score_gemma":0.00085004733,"threshold_uncertainty_score":0.9997184},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007369158,0.00008149607,0.98505014,0.000255938,0.00020512413,0.00018946435,0.0000107194855,0.000011388914,0.0068265884],"genre_scores_gemma":[0.75136805,0.00024780253,0.2173278,0.004747287,0.00095635594,0.000010151682,0.0002551392,0.00012485303,0.024962578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983023,0.000010236919,0.00015637574,0.0007197979,0.00051708013,0.000294209],"domain_scores_gemma":[0.99914455,0.00003805561,0.00009223365,0.00049878523,0.00014169342,0.000084649495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024485224,0.0002253059,0.00017353105,0.00017230396,0.0001131743,0.00008571094,0.00050215406,0.00024293891,0.000017473007],"category_scores_gemma":[0.00004322356,0.00017869896,0.00005595995,0.00007913847,0.00029689664,0.000007847441,0.00049095514,0.0003943012,0.000012319346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000251436,0.00010700088,0.0007055029,0.00008358536,0.0000345872,0.00004736861,0.00019088974,0.67154455,0.064401396,0.0046355682,0.00019051578,0.25780755],"study_design_scores_gemma":[0.00036286179,0.0002662063,0.00010079812,0.00016747724,0.000004507405,0.0000368032,1.97387e-7,0.9884372,0.0011412177,0.005626886,0.00348063,0.00037521956],"about_ca_topic_score_codex":0.000005140356,"about_ca_topic_score_gemma":0.00008329301,"teacher_disagreement_score":0.7677223,"about_ca_system_score_codex":0.00005309766,"about_ca_system_score_gemma":0.0005782167,"threshold_uncertainty_score":0.7287132},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024848063,0.0004607465,0.9855943,0.0011880499,0.00080552784,0.00038763112,0.000002210506,0.00023519463,0.011301517],"genre_scores_gemma":[0.13973358,0.00019581521,0.85491985,0.0025280183,0.00041481253,0.00001663202,0.000008986742,0.00006381759,0.0021184552],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541134,0.000052350326,0.00045376547,0.0017025908,0.0015315999,0.0008483547],"domain_scores_gemma":[0.9968653,0.00048717807,0.00022729789,0.0018248017,0.000376525,0.0002189508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012695277,0.00050324376,0.00044655704,0.0018837964,0.0003036709,0.00049944996,0.004853226,0.0003067793,0.000021545397],"category_scores_gemma":[0.00014040331,0.00047565516,0.00015904798,0.0012869235,0.00086485915,0.0010143575,0.0011040587,0.0010498973,0.000085697895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033662102,0.000014252952,0.000004736836,0.000008356046,0.0000029378796,0.00005802229,0.00015170679,0.004499427,0.00010210579,0.29410133,0.0000077919585,0.70104593],"study_design_scores_gemma":[0.00016607245,0.00021019157,0.00014433205,0.00015540294,0.0000026609257,0.000052245425,4.5321798e-8,0.1086157,0.0013135463,0.8874951,0.0013488046,0.00049590756],"about_ca_topic_score_codex":0.0000037061775,"about_ca_topic_score_gemma":0.000021131544,"teacher_disagreement_score":0.70055,"about_ca_system_score_codex":0.00029869872,"about_ca_system_score_gemma":0.0003941001,"threshold_uncertainty_score":0.9997695},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020782103,0.00043990076,0.9716552,0.00021569643,0.0018141587,0.0002800546,0.0000017470173,0.00028824387,0.025284229],"genre_scores_gemma":[0.01660917,0.00001224518,0.9813658,0.00060940924,0.00046025967,0.000009054794,0.0000034114837,0.000032076583,0.00089856674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959888,0.000041495085,0.0005790206,0.0017036059,0.0010558243,0.0006312623],"domain_scores_gemma":[0.9970879,0.00023365111,0.00039403123,0.001901502,0.0002634433,0.00011945511],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014422298,0.00046969167,0.00042084637,0.00076299947,0.0002840602,0.00075172144,0.004157543,0.00034581294,0.000012580613],"category_scores_gemma":[0.00014722785,0.0004484482,0.00010617503,0.0007260568,0.0006784965,0.0011286718,0.0012157786,0.00077128905,0.000068866735],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022677505,0.000019316612,0.000032210573,0.00005238987,0.0000035334451,0.000029076311,0.0002883191,0.03901884,0.00015753275,0.040256288,0.00004766207,0.9200926],"study_design_scores_gemma":[0.00013284774,0.00007625121,0.00018426686,0.0003254267,0.000005082847,0.000072246155,3.5198507e-8,0.7501922,0.004403289,0.2401361,0.0038152277,0.0006570044],"about_ca_topic_score_codex":0.000021048809,"about_ca_topic_score_gemma":0.000013239826,"teacher_disagreement_score":0.91943556,"about_ca_system_score_codex":0.00035535335,"about_ca_system_score_gemma":0.00051649933,"threshold_uncertainty_score":0.99979675},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012815259,0.0026123626,0.73013777,0.0037718343,0.003222831,0.0005508649,0.000007613248,0.00018948951,0.2593791],"genre_scores_gemma":[0.7958408,0.00070657337,0.13610107,0.011861763,0.01843627,0.00005761408,0.000014699251,0.00009264678,0.036888566],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99688697,0.00008706006,0.00035578117,0.0008554108,0.0010702399,0.0007445596],"domain_scores_gemma":[0.99839985,0.0004795238,0.00020055406,0.0005124787,0.00022039964,0.00018719397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010767983,0.00029654425,0.00042517978,0.00037622746,0.0007071404,0.00042440882,0.0019344443,0.00036059564,0.00015974876],"category_scores_gemma":[0.0002634564,0.0002748589,0.000112743735,0.00080543105,0.0019705014,0.0005132142,0.0003032235,0.0006724611,0.000109230125],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042191755,0.000019057863,0.00023362023,0.000012348546,0.0000044116427,0.000029450477,0.0021858157,0.0029110636,0.0000030693236,0.004335897,0.00035665833,0.9899044],"study_design_scores_gemma":[0.0010134581,0.00014199136,0.002456056,0.0008799622,0.00004169113,0.000019482559,0.000004075034,0.027885588,0.000087038396,0.33811006,0.6272706,0.002090016],"about_ca_topic_score_codex":0.00033857994,"about_ca_topic_score_gemma":0.0055260547,"teacher_disagreement_score":0.98781437,"about_ca_system_score_codex":0.00065613596,"about_ca_system_score_gemma":0.0030849574,"threshold_uncertainty_score":0.9999704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012949623,0.00015134603,0.99600667,0.0002210264,0.0013722067,0.0017533065,0.000033888897,0.00013253669,0.00031604356],"genre_scores_gemma":[0.0038935156,0.000013729322,0.99501526,0.0004841381,0.0002467899,0.00003073691,0.000032124175,0.00005284057,0.0002308708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962862,0.000105879066,0.0006008404,0.0018511412,0.00068203744,0.00047386807],"domain_scores_gemma":[0.99574053,0.001251942,0.00068340264,0.0007689538,0.0014444066,0.00011075611],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008746242,0.0005377019,0.0005298707,0.0011173969,0.00042796019,0.00039614775,0.00096246804,0.0003696839,0.000009404832],"category_scores_gemma":[0.0005465109,0.0005620943,0.00010387623,0.0007148116,0.00030578478,0.0030022338,0.0007689884,0.00052915764,0.0000042375473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019387075,0.000019667279,0.000015459404,0.000026450758,0.000014902288,0.0000026440334,0.0006295614,0.8447291,0.0002291271,0.0038632802,0.0000015244779,0.15044886],"study_design_scores_gemma":[0.0006862748,0.00023734859,0.00017608667,0.0002510733,0.0000151236245,0.000041865314,0.0000014066875,0.9660978,0.0009246114,0.030915748,0.00007526915,0.0005774116],"about_ca_topic_score_codex":0.000025543488,"about_ca_topic_score_gemma":0.000019600078,"teacher_disagreement_score":0.14987145,"about_ca_system_score_codex":0.0011841797,"about_ca_system_score_gemma":0.00076679693,"threshold_uncertainty_score":0.9996831},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040729023,0.00023725093,0.98881507,0.0037891509,0.001978011,0.0006941572,0.0000033622725,0.00028753962,0.00012254591],"genre_scores_gemma":[0.64599305,0.000013457893,0.3491748,0.0017225078,0.0029259108,0.0000052999935,0.000010876659,0.000058962094,0.000095145966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558175,0.00005052335,0.00049632194,0.002428689,0.00077334687,0.0006693808],"domain_scores_gemma":[0.9974139,0.00023212734,0.00026848493,0.0015329578,0.00025964965,0.00029291306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010759021,0.00054462586,0.0005296505,0.0009172464,0.0003532757,0.0006067077,0.0024717802,0.00026382995,0.0000036510276],"category_scores_gemma":[0.000058884532,0.00051630504,0.00006952495,0.00072416535,0.00017938112,0.00049668003,0.001324311,0.00083373697,0.00005993578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036948338,0.000019911977,0.000015773061,0.00003591926,0.000004789278,0.0000080471855,0.0007151185,0.25753227,0.0011223924,0.053341474,0.000011079932,0.6871895],"study_design_scores_gemma":[0.00014064266,0.0003304985,0.00021645057,0.000119724966,0.000004527362,0.0001007352,1.9335141e-7,0.9662759,0.00074331125,0.02946288,0.0019998262,0.0006053332],"about_ca_topic_score_codex":0.00001280632,"about_ca_topic_score_gemma":0.000014817385,"teacher_disagreement_score":0.7087436,"about_ca_system_score_codex":0.00016516338,"about_ca_system_score_gemma":0.00029243453,"threshold_uncertainty_score":0.99972886},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019800213,0.0008198249,0.99269086,0.00053522666,0.002696405,0.00043895407,0.0000043395853,0.00077415357,0.0020204543],"genre_scores_gemma":[0.002663935,0.00020192987,0.9948896,0.001136366,0.0003473425,0.000014824064,0.0000014798306,0.00004892251,0.0006955937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99562526,0.000043852975,0.00049059285,0.0018958374,0.0010318031,0.0009126611],"domain_scores_gemma":[0.99589163,0.0012835981,0.00017684419,0.0021197558,0.00023386421,0.0002942942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075090677,0.00065758947,0.0006675553,0.0009966226,0.00023794966,0.00022358906,0.004849149,0.0003367983,0.000008199812],"category_scores_gemma":[0.0006921082,0.00062592514,0.00013040332,0.00092325284,0.0005063274,0.0009425096,0.002220735,0.00094224734,0.0001540424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031223424,0.000009701168,0.0000070032825,0.00001742449,0.0000061900832,0.00015352816,0.0007522439,0.64069164,0.00009742983,0.004115456,0.00012133267,0.35402495],"study_design_scores_gemma":[0.0013109458,0.0017046331,0.0010059129,0.0022206127,0.000027191283,0.0018041412,4.4151e-7,0.30394167,0.022217344,0.48103407,0.1761228,0.008610229],"about_ca_topic_score_codex":0.0000094468305,"about_ca_topic_score_gemma":0.000014130912,"teacher_disagreement_score":0.4769186,"about_ca_system_score_codex":0.00042612452,"about_ca_system_score_gemma":0.00046738438,"threshold_uncertainty_score":0.9996192},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028957764,0.000111993315,0.9884011,0.001473643,0.0019767887,0.00044683396,0.000006574785,0.00037923173,0.0043080254],"genre_scores_gemma":[0.89291316,0.000021850545,0.106610335,0.0001769443,0.0001340205,0.0000097096645,0.000003540755,0.000025876914,0.00010458232],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668723,0.000026938247,0.00072228606,0.0014075176,0.0006339709,0.0005220322],"domain_scores_gemma":[0.9974127,0.000358107,0.0007984494,0.0009493119,0.0004535026,0.00002794991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007869988,0.0004868201,0.00069452263,0.0014788061,0.0002995071,0.00025533885,0.002395594,0.00066493405,0.000042076193],"category_scores_gemma":[0.00020681613,0.00048188615,0.00011810236,0.0008894009,0.0015942656,0.0014003424,0.0020462698,0.0014147832,0.000012430308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098264945,0.000041328076,0.00021901188,0.000062353814,0.000024701936,0.000004472391,0.0010466543,0.00046617448,0.0022026398,0.21133217,0.000010562388,0.7845801],"study_design_scores_gemma":[0.001478523,0.0008479213,0.0073547983,0.00064456405,0.000053507083,0.00023792962,0.000060293976,0.268911,0.0622133,0.64936155,0.006083929,0.0027526384],"about_ca_topic_score_codex":0.000028264176,"about_ca_topic_score_gemma":0.00007974458,"teacher_disagreement_score":0.8900174,"about_ca_system_score_codex":0.00048159764,"about_ca_system_score_gemma":0.0003772278,"threshold_uncertainty_score":0.9997633},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030946528,0.0006067582,0.991736,0.00070424174,0.0021549184,0.00058519177,0.000014568359,0.00016387407,0.00372501],"genre_scores_gemma":[0.10554868,0.00029486718,0.88742024,0.004636554,0.0006792235,0.00014702148,0.00009760535,0.000059212936,0.0011166136],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954624,0.000114901915,0.00072874513,0.0017592664,0.00096629525,0.00096835225],"domain_scores_gemma":[0.99725074,0.0006212129,0.00021326567,0.0013995413,0.00036138657,0.00015388399],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009666126,0.00054516515,0.0005996615,0.004063292,0.0002653135,0.00075592194,0.0036978736,0.00032477776,0.00004452223],"category_scores_gemma":[0.00012339921,0.00053836347,0.00017810178,0.01103327,0.00050219236,0.0005723517,0.0012506753,0.0011582432,0.00001104126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016311582,0.00033299276,0.0074984753,0.00024163253,0.000055438166,0.00024836502,0.00376736,0.0077276784,0.00009113404,0.0684936,0.0057345056,0.90579253],"study_design_scores_gemma":[0.0013357103,0.00030507924,0.012429367,0.0011760534,0.000023209828,0.00005697015,0.0000015956423,0.34351417,0.00048321727,0.62269163,0.016159363,0.0018235983],"about_ca_topic_score_codex":0.0001377911,"about_ca_topic_score_gemma":0.0016193117,"teacher_disagreement_score":0.90396893,"about_ca_system_score_codex":0.00041277596,"about_ca_system_score_gemma":0.0025414687,"threshold_uncertainty_score":0.9997068},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026256763,0.000050877105,0.9672349,0.000819336,0.012563857,0.00040402278,0.00000637574,0.00024734647,0.018647015],"genre_scores_gemma":[0.17754528,0.000047380774,0.8080892,0.009953611,0.0012708816,0.00003142501,0.0000062766944,0.00007501939,0.0029809515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616,0.000034552402,0.00042580487,0.0017393394,0.0009569165,0.0006834218],"domain_scores_gemma":[0.99750626,0.00037842145,0.00016815345,0.0014813397,0.00020987842,0.0002559414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054462405,0.0005317134,0.0004371241,0.00082332786,0.0004668622,0.000605865,0.0026722627,0.00028314354,0.000091950074],"category_scores_gemma":[0.000040391064,0.000463993,0.0001595354,0.0008550477,0.000400498,0.0004741078,0.00023916167,0.00083467754,0.0005315517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009082148,0.000037836584,0.0000019856498,0.000007315828,0.000007291679,0.000036340378,0.00097057695,0.04918432,0.000011949489,0.0013160848,0.0006739742,0.94774324],"study_design_scores_gemma":[0.000293068,0.0013680537,0.00010970181,0.00058510527,0.000011660082,0.00014855896,2.7923392e-7,0.9010125,0.0010960917,0.07834097,0.015877914,0.0011561194],"about_ca_topic_score_codex":0.000036814323,"about_ca_topic_score_gemma":0.00015463038,"teacher_disagreement_score":0.94658715,"about_ca_system_score_codex":0.00037129445,"about_ca_system_score_gemma":0.00033641548,"threshold_uncertainty_score":0.9997812},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035751896,0.00032183126,0.98670274,0.0006106698,0.0031049305,0.000359441,0.000007542362,0.00015394617,0.008381356],"genre_scores_gemma":[0.91499174,0.000016064925,0.08322477,0.0010684062,0.000383946,0.0000073827046,0.000002447502,0.00003465659,0.00027059793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962154,0.000087970584,0.00067816157,0.0011823911,0.0011858586,0.0006502192],"domain_scores_gemma":[0.99532235,0.0017583565,0.00031700157,0.0022054492,0.00026773108,0.00012909928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013068987,0.0004917724,0.0006651613,0.00029360462,0.00017609574,0.00037306963,0.004507618,0.0002880842,0.000045390756],"category_scores_gemma":[0.00010010935,0.0003430019,0.00020174746,0.0005259234,0.001033675,0.00047462195,0.0017165239,0.0007471855,0.0002162801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017705273,0.00006319184,0.00024569881,0.00040915897,0.00003164336,0.00011067433,0.002205477,0.008146906,0.0007109114,0.6724933,0.00007150061,0.31549385],"study_design_scores_gemma":[0.00036170313,0.00016931545,0.00041448092,0.001628176,0.000020372083,0.00028253172,0.0000022129398,0.865969,0.0020879698,0.12685496,0.0013204583,0.0008888231],"about_ca_topic_score_codex":0.00002430194,"about_ca_topic_score_gemma":0.000007850819,"teacher_disagreement_score":0.9146342,"about_ca_system_score_codex":0.00019765853,"about_ca_system_score_gemma":0.0003894943,"threshold_uncertainty_score":0.9999022},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06084098,0.00014824959,0.9278093,0.009303908,0.0010097367,0.0005133187,0.0000038010996,0.00031534187,0.00005534026],"genre_scores_gemma":[0.69662344,0.000016370439,0.30269864,0.0004870892,0.00012569383,0.000037082136,0.0000018823847,0.000009284357,5.491548e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661475,0.00010909747,0.00052528403,0.0016318213,0.00064676575,0.00047229993],"domain_scores_gemma":[0.9964558,0.00030444577,0.0003840175,0.0025277168,0.00021668592,0.00011133331],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008268941,0.000341308,0.00046839478,0.0005644118,0.00018787458,0.00022381947,0.0064322734,0.000476279,0.000009307447],"category_scores_gemma":[0.0002763974,0.00032916202,0.00011359162,0.002163749,0.0004681743,0.00021559415,0.0062118447,0.0014876914,0.000010128181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025937894,0.0003278842,0.000815728,0.0002945074,0.000027057944,0.000021181984,0.006017989,0.23993304,0.004672922,0.021557944,0.00007739972,0.7262284],"study_design_scores_gemma":[0.0001458176,0.00016443647,0.001100901,0.00016047804,0.0000038421576,0.000011784239,7.832201e-7,0.78692853,0.028321981,0.1827317,0.00014445143,0.00028530357],"about_ca_topic_score_codex":0.000086144835,"about_ca_topic_score_gemma":0.000028937018,"teacher_disagreement_score":0.7259431,"about_ca_system_score_codex":0.00016219584,"about_ca_system_score_gemma":0.00042283302,"threshold_uncertainty_score":0.999916},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09765066,0.010063324,0.86427087,0.0022811342,0.006443531,0.0015216237,0.0063535874,0.00060026156,0.010815019],"genre_scores_gemma":[0.9932355,0.0003337808,0.0048449775,0.00040482898,0.00033465886,0.00000749981,0.00039521116,0.0000493554,0.00039417308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961797,0.000047738926,0.0006659758,0.0010940613,0.001507231,0.0005053185],"domain_scores_gemma":[0.99722725,0.000266383,0.00040351163,0.0012810393,0.00049445877,0.00032737394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028085551,0.0004921056,0.0012339513,0.0011594242,0.00013270631,0.000035849636,0.00072557235,0.00020509769,0.00013285094],"category_scores_gemma":[0.00022162548,0.00043294713,0.0002550255,0.001014961,0.0009683701,0.00013241368,0.00035238342,0.00057879207,0.0000060033844],"study_design_candidate":"design_other","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.0003553719,0.0001975226,0.023183705,0.0003818237,0.0014611975,0.0017830363,0.0016071234,0.016706,0.0011564783,0.00007350023,0.0018152844,0.951279],"study_design_scores_gemma":[0.006856892,0.0016801475,0.29855874,0.0047785887,0.005087669,0.00046160136,0.00002137756,0.5317773,0.010689313,0.0005537835,0.13219517,0.0073393825],"about_ca_topic_score_codex":0.028121699,"about_ca_topic_score_gemma":0.5246525,"teacher_disagreement_score":0.94393957,"about_ca_system_score_codex":0.00045634268,"about_ca_system_score_gemma":0.0040403884,"threshold_uncertainty_score":0.99981225},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04014903,0.0058926283,0.9486723,0.0006375152,0.0032226169,0.0003078394,0.000012549049,0.000053388816,0.001052129],"genre_scores_gemma":[0.72322065,0.0008096677,0.27008587,0.0021609324,0.001720488,0.0000057341144,0.00008744096,0.00010285462,0.0018063585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969636,0.000103793835,0.00069463084,0.0012714227,0.0003720788,0.00059446937],"domain_scores_gemma":[0.99837667,0.0003299987,0.00029293736,0.00080757914,0.000079726575,0.00011306664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013054028,0.00040221607,0.0006175035,0.0003393957,0.00011459979,0.000101458434,0.0012370113,0.0010138914,0.0000265847],"category_scores_gemma":[0.0011172851,0.0003611923,0.00017739485,0.00017500488,0.0012124174,0.000011751128,0.0012083836,0.0011944955,0.000015958694],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000684906,0.00008048768,0.03153429,0.00013071363,0.000058372414,0.00019265826,0.00027271733,0.011751568,0.01249238,0.00019404881,0.00009288786,0.9431314],"study_design_scores_gemma":[0.011135491,0.0050339852,0.021157457,0.007124655,0.00024499022,0.0020549216,0.000008295863,0.70649385,0.037674394,0.09866951,0.10200524,0.008397199],"about_ca_topic_score_codex":0.000132766,"about_ca_topic_score_gemma":0.0006316898,"teacher_disagreement_score":0.93473417,"about_ca_system_score_codex":0.000078921155,"about_ca_system_score_gemma":0.0003590594,"threshold_uncertainty_score":0.999884},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20563866,0.0002786573,0.7920771,0.00002773552,0.0016793165,0.00010769071,0.0000028032523,0.00017725608,0.000010762487],"genre_scores_gemma":[0.88228923,0.000019816001,0.11738306,0.000077384255,0.00018408436,0.0000049921573,0.000018334333,0.000022267299,8.401669e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832714,0.0000234864,0.00027830695,0.00060395605,0.00039170255,0.0003753921],"domain_scores_gemma":[0.99922144,0.0001049806,0.000058465033,0.00049336866,0.000058135243,0.000063623826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031416104,0.00025721447,0.00031523796,0.0008365634,0.000067417786,0.00026493098,0.0006802762,0.00019555184,0.000009051311],"category_scores_gemma":[0.00005093867,0.00025687175,0.00009315288,0.0015073396,0.000075464806,0.00012538023,0.00046591874,0.00063492154,0.000031529707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.5474217e-7,0.000005418546,0.0016527975,0.00005085895,0.000008143515,0.0000026594093,0.00017203901,0.83995944,0.00066502724,1.8938843e-7,0.000001989837,0.1574808],"study_design_scores_gemma":[0.000077231714,0.000012454989,0.0005691069,0.00013624788,0.0000115495295,0.0000045530464,1.9449746e-7,0.9960746,0.00221613,0.0006112345,0.0000024319606,0.00028424498],"about_ca_topic_score_codex":0.00003661998,"about_ca_topic_score_gemma":0.000010619773,"teacher_disagreement_score":0.6766506,"about_ca_system_score_codex":0.00021663294,"about_ca_system_score_gemma":0.00006366218,"threshold_uncertainty_score":0.9999884},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006850526,0.00023768972,0.99706775,0.00013160594,0.00031632444,0.00015827075,0.000013970578,0.00004488376,0.0013444425],"genre_scores_gemma":[0.8671389,0.0001420186,0.13084202,0.0002534328,0.00047912681,0.000008732008,0.00006696128,0.000056656765,0.0010121204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987862,0.0000066968896,0.00028869166,0.0003630443,0.00034214678,0.00021322715],"domain_scores_gemma":[0.9989374,0.0004838716,0.00009743835,0.0003007073,0.00012626153,0.00005431868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035349975,0.00022317447,0.00042280994,0.00026723623,0.00003956951,0.00007759352,0.00025054897,0.000059911952,0.000018942208],"category_scores_gemma":[0.0001133836,0.00016968948,0.00007950852,0.00018533626,0.00038618426,0.0001316041,0.00002143709,0.00025151428,0.0000026989771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074502323,0.000022128828,0.0004824573,0.00065512914,0.00011936026,0.000030472867,0.0004332497,0.60473984,0.0075786877,0.0007075048,0.0006064236,0.3846173],"study_design_scores_gemma":[0.0006244764,0.00025665626,0.0005203634,0.0034391934,0.0001523667,0.00012992373,0.0000026438054,0.896602,0.087064005,0.0078089484,0.0018647369,0.001534726],"about_ca_topic_score_codex":0.000011226673,"about_ca_topic_score_gemma":0.000020850664,"teacher_disagreement_score":0.8664539,"about_ca_system_score_codex":0.000057608548,"about_ca_system_score_gemma":0.00015917777,"threshold_uncertainty_score":0.6919736},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004768505,0.000078603356,0.98720104,0.00004830604,0.00019040072,0.0008663846,0.0000017799971,0.00042150758,0.010715149],"genre_scores_gemma":[0.13876231,0.000002127853,0.8604512,0.0002595727,0.0001953806,0.000012502043,0.000005338601,0.00010012953,0.00021143892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745274,0.00002945157,0.00037598147,0.0008508074,0.00057748787,0.0007135583],"domain_scores_gemma":[0.9987602,0.0002582139,0.000104000705,0.0005822682,0.00013606943,0.0001592457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089001766,0.00045958138,0.0004911806,0.00060251495,0.00011588087,0.00028495197,0.0007486249,0.0002459326,0.000012065227],"category_scores_gemma":[0.0000696415,0.0004214766,0.0000614236,0.0008793111,0.00016924413,0.00015149766,0.00017311299,0.0007876342,0.000058229674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032622822,0.00000692129,0.00004430894,0.00003686079,0.00001098298,0.000005415058,0.00031017984,0.7372764,0.0005193527,0.00029139817,0.0000022787142,0.26149267],"study_design_scores_gemma":[0.00021604658,0.0001109923,0.00003820736,0.00027688913,0.000012152528,0.000059383914,3.2210184e-7,0.997222,0.0009891049,0.00024054333,0.0002770351,0.00055730995],"about_ca_topic_score_codex":0.000003976807,"about_ca_topic_score_gemma":0.000002312115,"teacher_disagreement_score":0.26093537,"about_ca_system_score_codex":0.00035927532,"about_ca_system_score_gemma":0.00028060502,"threshold_uncertainty_score":0.9998237},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45219147,0.00013539763,0.5464334,0.00081627857,0.00023976355,0.0001357705,0.0000011896931,0.000033398053,0.000013372005],"genre_scores_gemma":[0.8001015,0.000014738588,0.198293,0.0015613928,0.000020576725,0.0000029911675,3.1218005e-7,0.0000041264398,0.0000013327726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982738,0.00019275125,0.00025955227,0.00049904326,0.00035849717,0.0004163571],"domain_scores_gemma":[0.9984364,0.0005519588,0.00012829134,0.00074526615,0.00006247637,0.000075616925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018899477,0.0001535769,0.00028409928,0.00013736293,0.00011602602,0.00024361843,0.0017023344,0.000037508904,0.0000076276606],"category_scores_gemma":[0.0000619311,0.0000998838,0.000046443052,0.00090826926,0.0014444957,0.0003765798,0.00085797516,0.00018379805,0.0000061218243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012220701,0.00010430404,0.010846187,0.000088941655,0.000026782844,0.000024291618,0.022017239,0.078978576,0.013150323,0.1210974,0.00001623885,0.7535275],"study_design_scores_gemma":[0.0008414658,0.000041361534,0.0048013264,0.000031024476,0.0000013272168,0.000029414965,9.843276e-7,0.7611834,0.008699023,0.22424622,0.000011031575,0.0001134549],"about_ca_topic_score_codex":0.00021477333,"about_ca_topic_score_gemma":0.0000353622,"teacher_disagreement_score":0.75341403,"about_ca_system_score_codex":0.00003922911,"about_ca_system_score_gemma":0.00014430976,"threshold_uncertainty_score":0.53223044},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9926551,0.00022807154,0.0020010264,0.0000727334,0.00034319368,0.0018785171,0.000007383272,0.00001425649,0.0027997005],"genre_scores_gemma":[0.99842185,0.000033226795,0.0011473965,0.000017601304,0.00016428228,0.000004954755,6.144509e-7,0.000020265543,0.00018982557],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99628085,0.00025276307,0.0005739682,0.001064072,0.0012685334,0.00055982627],"domain_scores_gemma":[0.9979755,0.0005223807,0.00037162067,0.00074828434,0.00018331045,0.00019885092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030247334,0.0003227189,0.00077043945,0.0025722648,0.00029640444,0.00031220753,0.0014298462,0.00019955261,0.00005658548],"category_scores_gemma":[0.0002011318,0.00030426827,0.000048720838,0.0011876334,0.0010813803,0.000568005,0.0007897875,0.00067308074,0.0000028409108],"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.00014616332,0.0042464933,0.449944,0.00026747602,0.00017056467,0.02140246,0.27515346,0.030140111,0.000021887141,0.0011280301,0.000026509515,0.21735285],"study_design_scores_gemma":[0.035164427,0.055341274,0.618145,0.0025998855,0.0005483316,0.0012333116,0.04098756,0.11450418,0.00025167136,0.12213326,0.00043824868,0.0086528845],"about_ca_topic_score_codex":0.017966071,"about_ca_topic_score_gemma":0.036287647,"teacher_disagreement_score":0.2341659,"about_ca_system_score_codex":0.0002285765,"about_ca_system_score_gemma":0.000603067,"threshold_uncertainty_score":0.99994093},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002472428,0.00006376148,0.98569435,0.00016871453,0.006148671,0.0002278107,0.000016277216,0.00007817513,0.007355014],"genre_scores_gemma":[0.0035420149,0.000013731756,0.98552364,0.0006513694,0.00096605386,0.000008393886,0.0000038901417,0.000024657747,0.009266234],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997224,0.00006240247,0.00033717632,0.0009219948,0.00090637064,0.00054808665],"domain_scores_gemma":[0.9949322,0.003462307,0.00022864433,0.0009230146,0.00035560562,0.000098269586],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029116734,0.00028032565,0.00036267037,0.0007241818,0.00029272432,0.0005082097,0.0018359327,0.0001489601,0.000040735846],"category_scores_gemma":[0.0071168216,0.00022833596,0.000053088832,0.0010077741,0.0043557314,0.00032444551,0.0006622731,0.00040986168,0.00004975034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029162944,0.0002674446,0.0002822167,0.0005901194,0.000021209056,0.00006158496,0.008207068,0.0006027572,0.0013711675,0.2952546,0.05174855,0.64156413],"study_design_scores_gemma":[0.00008205643,0.00006836775,0.00013967583,0.00022660394,0.0000094363095,0.000022309292,8.4375586e-7,0.0040581655,0.0036880118,0.98900664,0.0023723722,0.00032553193],"about_ca_topic_score_codex":0.0000047380963,"about_ca_topic_score_gemma":0.000021729971,"teacher_disagreement_score":0.69375205,"about_ca_system_score_codex":0.0005501549,"about_ca_system_score_gemma":0.0040254057,"threshold_uncertainty_score":0.99835384},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025608813,0.00023971107,0.9844894,0.00035286546,0.0039314674,0.0005337255,0.0000025387951,0.00027690784,0.009917337],"genre_scores_gemma":[0.13002206,0.000010502346,0.8662548,0.0015438928,0.0011211389,0.000012242197,0.000011569785,0.000046785946,0.0009770072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595094,0.00007771174,0.0006612353,0.0014114415,0.0011930622,0.0007056013],"domain_scores_gemma":[0.9971631,0.0006925173,0.00034084363,0.0013763198,0.00023661426,0.0001906176],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001263767,0.00046906705,0.00051864836,0.00069538073,0.00028153782,0.0010591001,0.0027379156,0.00029145155,0.000020569014],"category_scores_gemma":[0.000244208,0.00043115963,0.00013215888,0.00047170446,0.00024368116,0.00081222324,0.0010421926,0.0007071632,0.00028090455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050796402,0.00002668054,0.00035583068,0.00013724666,0.000021958549,0.000134874,0.0020702987,0.074366584,0.0020703243,0.042991225,0.00016964068,0.87765026],"study_design_scores_gemma":[0.00026162455,0.00007089141,0.00014453728,0.00036700148,0.0000056409554,0.000079270074,3.4371251e-7,0.95525914,0.0020082926,0.040695257,0.0005431087,0.00056489895],"about_ca_topic_score_codex":0.000041131174,"about_ca_topic_score_gemma":0.000062309926,"teacher_disagreement_score":0.8808926,"about_ca_system_score_codex":0.00028046162,"about_ca_system_score_gemma":0.00092411094,"threshold_uncertainty_score":0.9999779},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.481833,0.000058290916,0.5163211,0.00026325183,0.001010074,0.000429381,0.0000092005,0.00006386349,0.000011786717],"genre_scores_gemma":[0.9056714,0.000054326447,0.09337549,0.0006662283,0.00014218915,0.000040242405,0.000031174393,0.000017409551,0.0000015366419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961779,0.00015044522,0.00069333124,0.0017610026,0.00058426557,0.00063302193],"domain_scores_gemma":[0.99837726,0.00019874865,0.000117275944,0.0010177206,0.00013718514,0.00015182084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085521344,0.00049793394,0.0005297375,0.0007400931,0.00021668988,0.0007543148,0.0016792105,0.0003358597,0.00003232081],"category_scores_gemma":[0.000021521162,0.00048257643,0.00009256436,0.000818987,0.00035023072,0.0013159377,0.000780325,0.0010909482,0.000025295582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000701035,0.00037882169,0.013915396,0.00057432865,0.000033237022,0.00006788527,0.019820707,0.18716432,0.044689525,0.00043099164,0.000009952427,0.7328447],"study_design_scores_gemma":[0.000787423,0.00014814756,0.02340413,0.0005094158,0.000006799996,0.000013877849,0.000002023126,0.9290051,0.027454188,0.018061355,0.000008660166,0.0005989022],"about_ca_topic_score_codex":0.00032924418,"about_ca_topic_score_gemma":0.00034415995,"teacher_disagreement_score":0.7418408,"about_ca_system_score_codex":0.00021678413,"about_ca_system_score_gemma":0.0002925505,"threshold_uncertainty_score":0.9997626},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022136622,0.0010197106,0.99442494,0.0004791238,0.0021229181,0.00043377627,0.0000055187998,0.00038331607,0.00090933824],"genre_scores_gemma":[0.28923053,0.000030558815,0.70849574,0.0012619658,0.00049456034,0.000005013703,0.000012561856,0.000029561746,0.00043955262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637204,0.000037631686,0.00041011517,0.0015696664,0.0010776364,0.0005329216],"domain_scores_gemma":[0.99761844,0.00023496915,0.00040090736,0.0012698438,0.00034995284,0.00012591279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004666059,0.0005079269,0.00043407542,0.0006342504,0.0002630521,0.00067187165,0.003305504,0.00035814167,0.000020296011],"category_scores_gemma":[0.000075024735,0.00043386797,0.000112871436,0.00040200495,0.00041838325,0.0014760836,0.0018092177,0.0010987008,0.000059011447],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008063289,0.00003083277,0.00004992508,0.000049394297,0.0000083307,0.00017792253,0.0006617549,0.01367073,0.008205753,0.015171408,0.00010836068,0.9618575],"study_design_scores_gemma":[0.0001915159,0.00013481319,0.000060243347,0.00040937864,0.0000072302414,0.00009659191,2.1250476e-7,0.91169244,0.020361226,0.0660314,0.00028660765,0.00072837365],"about_ca_topic_score_codex":0.000039825714,"about_ca_topic_score_gemma":0.00003694103,"teacher_disagreement_score":0.9611291,"about_ca_system_score_codex":0.00033565063,"about_ca_system_score_gemma":0.00039378507,"threshold_uncertainty_score":0.9998113},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01780738,0.0020713322,0.93825674,0.00072358456,0.0016097993,0.0003977607,0.00001817072,0.000022118844,0.039093103],"genre_scores_gemma":[0.9956194,0.00033075246,0.0024670714,0.0010293412,0.00016617982,0.0000020871933,0.000004086732,0.000019034793,0.00036204068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829614,0.0000037818522,0.00054261193,0.0006930173,0.00013121899,0.00033322527],"domain_scores_gemma":[0.99888957,0.00018295912,0.00034314234,0.00050765334,0.000030159468,0.000046496727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012703247,0.00023988928,0.00041531542,0.000751786,0.0001297865,0.00026473776,0.000583192,0.00015788479,0.000099840625],"category_scores_gemma":[0.000048420592,0.00021045728,0.000080215286,0.0002927413,0.00023633843,0.00022176317,0.0001811443,0.0005964431,0.00002551815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016121016,0.00004778282,0.14958446,0.00012711143,0.00004382464,0.000102498976,0.007948714,0.46648175,0.000003469105,0.16894153,0.00003353651,0.20666921],"study_design_scores_gemma":[0.00012779885,0.000041693627,0.00863269,0.00022668504,0.0000061943942,0.00002629494,0.0000043581963,0.9431196,0.000004026408,0.04103018,0.0064193825,0.00036110717],"about_ca_topic_score_codex":0.000089200956,"about_ca_topic_score_gemma":0.00023942297,"teacher_disagreement_score":0.97781205,"about_ca_system_score_codex":0.000142382,"about_ca_system_score_gemma":0.00006606058,"threshold_uncertainty_score":0.85821986},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018137354,0.00005377328,0.98596025,0.00023767051,0.00028859894,0.00038193335,0.000024628773,0.0001169142,0.012754859],"genre_scores_gemma":[0.93778366,0.000002392047,0.059305076,0.00039767526,0.0017462285,0.000014600318,0.00011751299,0.000052804287,0.0005800642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978056,0.00001984069,0.00031746802,0.0009216439,0.0005386166,0.0003968599],"domain_scores_gemma":[0.99835324,0.00021816404,0.00024534733,0.0008916324,0.0002039949,0.000087617846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028875575,0.00041632948,0.00046093075,0.00040426682,0.00014048099,0.00019759842,0.0007901857,0.0001365939,0.00023242678],"category_scores_gemma":[0.000003407021,0.0003345587,0.00014523517,0.0003781471,0.0003936417,0.00014298518,0.00020761693,0.0006744671,0.000025293655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021237385,0.000030962266,0.0045032054,0.00002008886,0.00004558683,0.0000051942934,0.00006931329,0.38030022,0.000038900227,0.011856967,0.00010747172,0.6030009],"study_design_scores_gemma":[0.00038428113,0.00029802945,0.0004086087,0.000557768,0.000060911512,0.0000019510576,1.468755e-7,0.9153246,0.00058008754,0.07335171,0.008389602,0.00064224313],"about_ca_topic_score_codex":0.000081123486,"about_ca_topic_score_gemma":0.000055221437,"teacher_disagreement_score":0.9376023,"about_ca_system_score_codex":0.00017209859,"about_ca_system_score_gemma":0.0005749904,"threshold_uncertainty_score":0.99991065},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012898311,0.00005325288,0.9945608,0.0008732747,0.0015769146,0.00023751485,0.000047438218,0.00018424718,0.0023375775],"genre_scores_gemma":[0.3783059,0.000049448114,0.6154259,0.003081483,0.001154386,0.000007025208,0.00088181713,0.00008394365,0.0010100785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949993,0.00007559266,0.0005106398,0.002460624,0.0014260317,0.00052781356],"domain_scores_gemma":[0.99471056,0.0007036473,0.00033595832,0.0039099706,0.00019294673,0.00014694183],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015288113,0.0005143325,0.00050714676,0.0012687576,0.00024989198,0.0010187512,0.0057608606,0.0003185728,0.00006407912],"category_scores_gemma":[0.00016701456,0.00047143086,0.00011504305,0.0008934349,0.00023503868,0.0015119947,0.0015183825,0.00079347123,0.00025165864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011596418,0.00008825898,0.00012099159,0.000041062893,0.000018531637,0.00004839635,0.00008104999,0.44285288,0.000388199,0.0015374242,0.00021228944,0.55459934],"study_design_scores_gemma":[0.00029095775,0.00016720056,0.00008279558,0.0003145661,0.000021355097,0.0000110870205,1.3074899e-7,0.9945709,0.0005776931,0.0011824182,0.0022440578,0.00053681346],"about_ca_topic_score_codex":0.000026818816,"about_ca_topic_score_gemma":0.0000386108,"teacher_disagreement_score":0.5540625,"about_ca_system_score_codex":0.00023611236,"about_ca_system_score_gemma":0.0011206119,"threshold_uncertainty_score":0.99977374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.774874e-7,0.0002470288,0.99401313,0.0006945938,0.0013594673,0.0013817713,0.000014057117,0.00020309007,0.002085885],"genre_scores_gemma":[0.00016237369,0.000087963606,0.9958948,0.002040908,0.0004257916,0.000023732802,0.000023458742,0.000036676753,0.0013043043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963089,0.000059488975,0.00071546074,0.0012512897,0.00088548433,0.000779341],"domain_scores_gemma":[0.99651045,0.0014878878,0.0002898688,0.0009603308,0.0005209464,0.00023051318],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030435636,0.00047099573,0.0008314825,0.0011713045,0.00026124733,0.0005661833,0.0027626082,0.0003122001,0.000024073252],"category_scores_gemma":[0.00020493465,0.00040885506,0.00024533796,0.0006271122,0.0007143156,0.00048261488,0.0011461953,0.0006472978,0.0000151434115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013500426,0.000025472145,3.2668297e-7,0.000027442471,0.000013246612,0.000018859357,0.0002686057,0.05471187,0.0000039159668,0.008402621,0.000007726537,0.9363849],"study_design_scores_gemma":[0.015578635,0.000091238006,8.453327e-7,0.00021088151,0.000006819658,0.00002898874,7.950408e-8,0.9249141,0.00006360791,0.05566439,0.0030029805,0.00043742606],"about_ca_topic_score_codex":0.000015930053,"about_ca_topic_score_gemma":0.00009163296,"teacher_disagreement_score":0.9359475,"about_ca_system_score_codex":0.00016334368,"about_ca_system_score_gemma":0.00048992265,"threshold_uncertainty_score":0.9998363},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018988146,0.00033988227,0.99444044,0.0008880309,0.0008884925,0.00035716614,0.000014945367,0.000051473213,0.0011207778],"genre_scores_gemma":[0.52933264,0.000094759795,0.46151713,0.0029164962,0.0015217385,0.000030226758,0.00003312391,0.00007676057,0.0044771316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719113,0.00003596638,0.0005439516,0.0010392413,0.00070281763,0.00048687687],"domain_scores_gemma":[0.99688685,0.0010149847,0.0003479174,0.00153349,0.00015365514,0.0000631147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001386159,0.0003198261,0.0005447722,0.0005591644,0.00014348081,0.00037742604,0.0045030713,0.0002024455,0.000010330283],"category_scores_gemma":[0.00017659045,0.00023301874,0.00018328168,0.00057739887,0.00032459837,0.00050781504,0.0012100822,0.00048470465,0.000020034167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013940821,0.00007066182,0.003355431,0.00024144514,0.00006331852,0.000031216714,0.004066094,0.05935045,0.00070514786,0.016324103,0.00014717941,0.915631],"study_design_scores_gemma":[0.00026774436,0.0001473922,0.0005520942,0.00056291954,0.000022719047,0.000016392982,0.0000014721446,0.9821616,0.0005890682,0.014036826,0.001256184,0.0003856322],"about_ca_topic_score_codex":0.000067785644,"about_ca_topic_score_gemma":0.000056942772,"teacher_disagreement_score":0.9228111,"about_ca_system_score_codex":0.0001044935,"about_ca_system_score_gemma":0.0004896037,"threshold_uncertainty_score":0.95022285},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4057003,0.0015031417,0.4528048,0.00392034,0.022618819,0.006538644,0.000018349974,0.000386846,0.106508784],"genre_scores_gemma":[0.9975825,0.00010075768,0.0018648129,0.00010867466,0.00017944642,0.000013889202,0.0000018035386,0.000016169744,0.0001319758],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979359,0.00020043034,0.00026260316,0.00049902,0.00068981684,0.00041223096],"domain_scores_gemma":[0.99828994,0.0007890646,0.00022501715,0.00041546155,0.00023756517,0.000042927226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021507372,0.00022453385,0.00034400081,0.0005027449,0.00027652906,0.000119767574,0.0012212753,0.0002470405,0.000009463946],"category_scores_gemma":[0.00043476807,0.00018664777,0.00007787794,0.0005732641,0.0020225332,0.0005362683,0.00024725703,0.00066864793,0.000009842831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009378603,0.00016430512,0.0070527163,0.00026251381,0.000026031017,0.000010236871,0.027010754,0.0043914136,0.0005259978,0.4319694,0.0000074400496,0.5284854],"study_design_scores_gemma":[0.0015727349,0.00058743084,0.140818,0.009351017,0.000057072346,0.0000111830705,0.001582296,0.0014904637,0.006276707,0.8345071,0.0018024702,0.0019435487],"about_ca_topic_score_codex":0.00093007967,"about_ca_topic_score_gemma":0.0019725035,"teacher_disagreement_score":0.59188217,"about_ca_system_score_codex":0.00070803706,"about_ca_system_score_gemma":0.004332994,"threshold_uncertainty_score":0.7686546},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010733651,0.00057572464,0.98827314,0.00018971247,0.005578427,0.000927636,0.0000016982606,0.00015327464,0.004193035],"genre_scores_gemma":[0.83303475,0.000050313207,0.13924925,0.0007806176,0.0015246853,0.000056334433,0.0000135330865,0.00011607669,0.025174426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996566,0.000046540397,0.00054510415,0.0015607232,0.0006400418,0.0006415762],"domain_scores_gemma":[0.99705684,0.0010040316,0.00038634168,0.0011439371,0.0003022383,0.000106591004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012162243,0.00049801933,0.0005227734,0.000635284,0.00032188327,0.00054692576,0.002449776,0.00032432028,0.000004640361],"category_scores_gemma":[0.00006372348,0.00044958002,0.0001930749,0.00030458727,0.00015272909,0.00032684888,0.00051461643,0.0008537452,0.00008184074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055256833,0.000034360415,0.00001133755,0.000051442967,0.000013050183,0.000006429266,0.0010706799,0.49855232,0.00005305795,0.09159986,0.000010659861,0.40859127],"study_design_scores_gemma":[0.00022786659,0.0003409045,0.00018635587,0.0010533708,0.0000073312067,0.000012333147,9.865222e-7,0.9885474,0.00017006962,0.0039442806,0.004945459,0.000563651],"about_ca_topic_score_codex":0.0000043255936,"about_ca_topic_score_gemma":0.000026703405,"teacher_disagreement_score":0.8490239,"about_ca_system_score_codex":0.000712177,"about_ca_system_score_gemma":0.0003883091,"threshold_uncertainty_score":0.9997956},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009048298,0.0003299408,0.97820276,0.0009928137,0.010026814,0.00091812987,0.0000035592536,0.000436213,0.00004146509],"genre_scores_gemma":[0.702083,0.0000302384,0.29633248,0.0011107817,0.00036044157,0.00005500512,0.0000025473116,0.000024211064,0.0000013210642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939451,0.00016880482,0.00072342023,0.0028679345,0.0011599011,0.0011348415],"domain_scores_gemma":[0.99543273,0.00056380604,0.00021040394,0.0031650444,0.0003981824,0.00022984874],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012540108,0.00071445084,0.0006963679,0.0009589972,0.00024028773,0.001173651,0.007313195,0.00059644226,0.000015290561],"category_scores_gemma":[0.00015826414,0.0006857417,0.00020249591,0.0025528201,0.00055247825,0.0011121585,0.0045999787,0.0021144159,0.000055171608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075723356,0.000043267864,0.0004628223,0.00009211835,0.000009466781,0.000011402673,0.0014332397,0.38048464,0.0025174571,0.00011205796,0.0000018204807,0.6148241],"study_design_scores_gemma":[0.0003205877,0.00019038633,0.0011936779,0.00019040119,0.0000068250915,0.000029630106,2.2871224e-7,0.94131154,0.027113201,0.028836088,0.000045582907,0.00076185475],"about_ca_topic_score_codex":0.00029906747,"about_ca_topic_score_gemma":0.00034309877,"teacher_disagreement_score":0.69303465,"about_ca_system_score_codex":0.0008554691,"about_ca_system_score_gemma":0.0014035068,"threshold_uncertainty_score":0.9998632},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010929722,0.00020383012,0.9907758,0.00047082134,0.002251943,0.00042727744,0.000005987431,0.0042348076,0.0015202133],"genre_scores_gemma":[0.35891548,0.000020834615,0.6391354,0.00053009967,0.0006267694,0.000008802666,0.000004338587,0.000048509286,0.0007097248],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633354,0.000031199186,0.00047149853,0.0017449083,0.0007962835,0.0006225484],"domain_scores_gemma":[0.9960145,0.0010144563,0.0003132763,0.0021464531,0.000347571,0.00016374861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009940685,0.0005330715,0.00049472635,0.00079132227,0.0003223451,0.0005821961,0.0024553505,0.000401128,0.000010502899],"category_scores_gemma":[0.0004209557,0.00050489453,0.00012865181,0.00066068897,0.00048460276,0.0006126887,0.0014043176,0.0010209137,0.00007658088],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021097762,0.000043542306,0.00039192953,0.000068436326,0.0000058967958,0.0013076346,0.000515862,0.0020060895,0.00004402295,0.0030976841,0.00042968063,0.9920871],"study_design_scores_gemma":[0.00027363765,0.00049568526,0.00015794979,0.0010000769,0.000015584475,0.014064793,1.04561835e-7,0.4465648,0.00125735,0.5332011,0.0015042109,0.0014647243],"about_ca_topic_score_codex":0.000111458176,"about_ca_topic_score_gemma":0.000025381674,"teacher_disagreement_score":0.9906224,"about_ca_system_score_codex":0.00040985152,"about_ca_system_score_gemma":0.0008978705,"threshold_uncertainty_score":0.99974024},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017314223,0.00064951845,0.98799163,0.0005099357,0.0013728875,0.00044565237,8.3097257e-7,0.00025126588,0.008760937],"genre_scores_gemma":[0.8954984,0.00004768551,0.10297966,0.00055747665,0.000351442,0.00002582509,0.000010915741,0.00003023407,0.0004983438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969899,0.00007559467,0.00044268882,0.0011115385,0.0008245158,0.00055578095],"domain_scores_gemma":[0.9968728,0.00041970555,0.00037948618,0.0018910071,0.0002689212,0.00016808018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087936554,0.000448061,0.00048353782,0.0004718581,0.00046326162,0.0007364486,0.003282105,0.00023232162,0.000012963215],"category_scores_gemma":[0.000042836607,0.00035399376,0.00010500628,0.00047088048,0.0006533664,0.00046430784,0.0009600548,0.0007700352,0.00007077595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015216626,0.000017249778,0.000060390208,0.000027215136,0.000013975167,0.000012598663,0.0005445789,0.0021556655,0.000023592056,0.43074024,0.000019863479,0.5663831],"study_design_scores_gemma":[0.0015048299,0.0011109954,0.00032939424,0.00070976914,0.00006147798,0.0005794922,0.0000018488752,0.43452135,0.0022386813,0.43028745,0.12589636,0.002758348],"about_ca_topic_score_codex":0.00006766994,"about_ca_topic_score_gemma":0.00020259638,"teacher_disagreement_score":0.8954811,"about_ca_system_score_codex":0.00024419994,"about_ca_system_score_gemma":0.00035221654,"threshold_uncertainty_score":0.9998912},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000121029436,0.00007207156,0.9927789,0.00030659666,0.0013800343,0.0012361358,0.000014894351,0.00028362032,0.0038067263],"genre_scores_gemma":[0.05805553,0.000106588705,0.9264108,0.003115739,0.000850276,0.000102935395,0.00004188724,0.000081435974,0.011234809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967194,0.000015541078,0.0005848014,0.0010540101,0.0009491484,0.00067708245],"domain_scores_gemma":[0.9972116,0.0004990059,0.00031477257,0.0011155057,0.0007329324,0.00012623564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010197472,0.0004152071,0.00043060715,0.0007560308,0.0004077374,0.0009813989,0.0025518811,0.00037636893,0.000023690778],"category_scores_gemma":[0.0001772257,0.00037419202,0.00018051376,0.00069156475,0.00043285897,0.001412369,0.00076929113,0.0006181765,0.00009113017],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033501896,0.000030029449,0.00015011127,0.00014110349,0.000007703628,0.000009852363,0.0004762023,0.0043546883,0.00043612512,0.034076523,0.00030867587,0.9599755],"study_design_scores_gemma":[0.0007340625,0.000952608,0.00065417326,0.00037164846,0.000009642329,0.000069609465,1.999786e-7,0.6961126,0.03804072,0.1971658,0.06446782,0.001421159],"about_ca_topic_score_codex":0.000013605169,"about_ca_topic_score_gemma":0.000020469115,"teacher_disagreement_score":0.9585543,"about_ca_system_score_codex":0.0004524922,"about_ca_system_score_gemma":0.0008621913,"threshold_uncertainty_score":0.999871},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009160906,0.00018228525,0.9863362,0.0011789388,0.0010662758,0.00038201385,0.00000824744,0.000030668514,0.0016544833],"genre_scores_gemma":[0.9682663,0.00002378532,0.029955367,0.0012092813,0.00006003954,0.0000027262245,0.000011076683,0.000013411879,0.00045802197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723315,0.00008609247,0.00037243075,0.0012454556,0.00079600874,0.00026687034],"domain_scores_gemma":[0.9970371,0.00040564378,0.00031427215,0.0019916645,0.00015192508,0.000099405894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071541907,0.00028262776,0.0004891019,0.0011468851,0.00016425908,0.00032634774,0.0019452962,0.00014803819,0.000031249383],"category_scores_gemma":[0.00006907972,0.00019845284,0.00025424061,0.0012461521,0.00034689892,0.00034507722,0.0008856725,0.00041784023,0.000004838618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024940075,0.00017689096,0.030151732,0.0000638596,0.00063025433,0.000014830902,0.0046934756,0.5324082,0.00045689373,0.09409901,0.000063131156,0.3372168],"study_design_scores_gemma":[0.00009905392,0.00009811871,0.01943314,0.00011057282,0.00012697508,0.0000024551814,6.7613047e-7,0.9697179,0.0004561424,0.009637779,0.000087677116,0.0002294852],"about_ca_topic_score_codex":0.0001497584,"about_ca_topic_score_gemma":0.00060376973,"teacher_disagreement_score":0.9591054,"about_ca_system_score_codex":0.0001182641,"about_ca_system_score_gemma":0.00020996956,"threshold_uncertainty_score":0.80926716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0135564385,0.004292577,0.8630504,0.0014654945,0.005183397,0.0006778281,0.00012775025,0.00004497853,0.11160113],"genre_scores_gemma":[0.99518955,0.0004622369,0.00224848,0.00044775987,0.00027272926,0.0000013419778,0.0000043250893,0.000021089172,0.0013524988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858105,0.0000022009147,0.0005180452,0.00052513625,0.00011646974,0.00025710114],"domain_scores_gemma":[0.9985735,0.00016148869,0.0005572024,0.0006057282,0.000065740496,0.00003635986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007340841,0.00019355869,0.00041022035,0.00033081722,0.00009672383,0.0000877351,0.00085618626,0.00014129587,0.00016046029],"category_scores_gemma":[0.00004691059,0.00015736462,0.00010965736,0.00020791222,0.00035681573,0.0001341435,0.00021167823,0.00035967518,0.000054517237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002005796,0.0000468775,0.17392124,0.00024449895,0.000104044135,0.000015808619,0.002370588,0.35662773,0.0000126688565,0.33503866,0.00018052183,0.13141732],"study_design_scores_gemma":[0.00032150047,0.00022520362,0.013702844,0.0004394838,0.000014844722,0.000012635246,0.0000013692369,0.7798377,0.00015322349,0.15242937,0.05215485,0.0007069649],"about_ca_topic_score_codex":0.000118799064,"about_ca_topic_score_gemma":0.00008302413,"teacher_disagreement_score":0.9816331,"about_ca_system_score_codex":0.00009131451,"about_ca_system_score_gemma":0.00011939363,"threshold_uncertainty_score":0.6417143},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000073220094,0.0009282099,0.9931119,0.0012110036,0.0016627457,0.0005132124,0.0000029343505,0.0004939357,0.002068708],"genre_scores_gemma":[0.37300873,0.00000427381,0.6245807,0.0016203745,0.00030385915,0.000008006921,0.000010616307,0.00003598816,0.00042745925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595827,0.00005584407,0.00059329515,0.0015714932,0.0011641418,0.0006569624],"domain_scores_gemma":[0.99661326,0.00083041954,0.0005263948,0.001658704,0.00022598666,0.00014520879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012505087,0.0005576254,0.00046430854,0.0008794514,0.00030954232,0.0005745632,0.003208392,0.00046697134,0.00003052208],"category_scores_gemma":[0.00016990447,0.0004910724,0.00018412966,0.00067778974,0.00024835413,0.00065538206,0.00086699525,0.0017434278,0.00005078677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007318941,0.000041148287,0.00011973369,0.000029071773,0.0000055392957,0.00008602402,0.0001425402,0.54291505,0.000027055821,0.019457698,0.000072294184,0.4370965],"study_design_scores_gemma":[0.00013789904,0.00016398465,0.00004202447,0.0009213906,0.000005409572,0.000018639766,4.7900606e-8,0.91198397,0.00033029803,0.08510799,0.00074573804,0.00054263405],"about_ca_topic_score_codex":0.000020735419,"about_ca_topic_score_gemma":0.000029927054,"teacher_disagreement_score":0.43655387,"about_ca_system_score_codex":0.00058968225,"about_ca_system_score_gemma":0.0008413338,"threshold_uncertainty_score":0.9997541},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003448038,0.0007871343,0.9909017,0.00004383174,0.0034469296,0.00044493543,0.000010028614,0.00048550393,0.0035351117],"genre_scores_gemma":[0.7098012,0.00003776848,0.28673613,0.00036462792,0.0010531523,0.000035647867,0.000026202637,0.00029665313,0.001648609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764276,0.000013684988,0.00048623834,0.0007980835,0.00046582357,0.00059338834],"domain_scores_gemma":[0.99838245,0.00039248363,0.000070813105,0.0009862742,0.000061657665,0.00010633771],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044035658,0.0005114822,0.0005646565,0.0010789324,0.00003515989,0.00013226744,0.0012046007,0.00027592803,0.000033836026],"category_scores_gemma":[0.000044163633,0.00054510124,0.00007071148,0.00056641846,0.00015289887,0.00032764723,0.0001501067,0.0007892728,0.00007407326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014491748,0.0000037983125,0.0005856417,0.0001483187,0.0000049328833,0.00003558489,0.00017810805,0.9252117,0.000059697628,0.00035522357,0.00001579272,0.073399715],"study_design_scores_gemma":[0.00027152037,0.000044060787,0.0018857914,0.0015246542,0.0000041540293,0.000024527211,1.2470504e-7,0.9832887,0.00027181674,0.0034357775,0.008266209,0.0009826365],"about_ca_topic_score_codex":0.000018800463,"about_ca_topic_score_gemma":0.0008107189,"teacher_disagreement_score":0.7094564,"about_ca_system_score_codex":0.0007442467,"about_ca_system_score_gemma":0.00024697182,"threshold_uncertainty_score":0.99970007},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008340842,0.0006723984,0.99000347,0.00044154853,0.004017334,0.0005893362,0.0000010676819,0.00018783254,0.004003626],"genre_scores_gemma":[0.623659,0.00006176027,0.3731729,0.0017007468,0.00097496976,0.000006182566,0.000006184577,0.000071417104,0.00034683262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946364,0.00010930655,0.00077568705,0.0021800513,0.0011276904,0.0011708406],"domain_scores_gemma":[0.9961204,0.001174662,0.00049649796,0.0018438086,0.0001776226,0.00018701173],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019592068,0.00073521805,0.0010206695,0.0011379076,0.00025039795,0.00058126485,0.0050989725,0.0006047712,0.000032391363],"category_scores_gemma":[0.0002498889,0.0007350776,0.00018730132,0.0009336043,0.000534282,0.00085700414,0.0026412206,0.0025559114,0.00008329092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009787554,0.00001317698,0.00081544096,0.000014710068,0.0000069723624,0.00013850897,0.00030737263,0.79762596,0.0000046647833,0.016573075,0.0000022456325,0.18448809],"study_design_scores_gemma":[0.0006351878,0.000078172765,0.00048555344,0.00036585896,0.0000074158793,0.00003774009,1.7201711e-7,0.9545808,0.000016417154,0.04259188,0.00046279267,0.0007380091],"about_ca_topic_score_codex":0.00006851855,"about_ca_topic_score_gemma":0.00034630354,"teacher_disagreement_score":0.6235756,"about_ca_system_score_codex":0.0006208222,"about_ca_system_score_gemma":0.0005797577,"threshold_uncertainty_score":0.99974525},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012595469,0.0014929915,0.9815474,0.0010828299,0.0021860385,0.000674871,0.0000052349683,0.0003129733,0.000102197526],"genre_scores_gemma":[0.6029422,0.000029759407,0.39559135,0.0011703772,0.00022364405,0.000014016238,0.0000056046206,0.000018238716,0.0000047785534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99491423,0.00016797015,0.0005160778,0.002605995,0.0009049135,0.00089079054],"domain_scores_gemma":[0.99603236,0.0004889493,0.00027605725,0.002771664,0.00012678506,0.00030420886],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015239366,0.00060523656,0.0007070127,0.00067543495,0.0001924139,0.0021469104,0.0055507775,0.0004036267,0.000008461997],"category_scores_gemma":[0.0001896754,0.0005414979,0.00012737203,0.0016679829,0.00055585196,0.00076651917,0.006552159,0.001167657,0.000031104548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011174679,0.00014665956,0.0019155816,0.0003308812,0.000035642308,0.00005712938,0.00910823,0.15590419,0.0012064818,0.005912148,0.00006664492,0.8253052],"study_design_scores_gemma":[0.00045596348,0.00006817542,0.0009818655,0.00027533,0.0000073468195,0.000073335774,0.000002363592,0.879479,0.00065755,0.11728884,0.00006484758,0.0006453668],"about_ca_topic_score_codex":0.0002893239,"about_ca_topic_score_gemma":0.000021427064,"teacher_disagreement_score":0.8246599,"about_ca_system_score_codex":0.00018581463,"about_ca_system_score_gemma":0.0012643338,"threshold_uncertainty_score":0.99982965},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087755383,0.00012977101,0.99743,0.00018509361,0.00029533458,0.0006611607,0.0000031805398,0.00004040785,0.00037749455],"genre_scores_gemma":[0.45396262,0.000017044547,0.5447531,0.00020659629,0.00013652247,0.00004648618,0.00001655043,0.00001812811,0.0008429954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757916,0.000016327,0.0005700577,0.0008274946,0.0006111722,0.00039576527],"domain_scores_gemma":[0.99853104,0.0002407052,0.00035139255,0.0005513387,0.0002553646,0.000070128845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007300967,0.0002635828,0.00036191303,0.00033724628,0.00014153417,0.00011393361,0.0013629376,0.0001755031,0.000004528231],"category_scores_gemma":[0.00003278518,0.0002651938,0.000101457255,0.00031819218,0.0001949753,0.00053687155,0.0005453442,0.00043273668,0.0000073122615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005376171,0.00002253914,0.00004252757,0.00004211032,0.0000023830878,0.0000015410079,0.00031855455,0.90215886,0.0014474969,0.02907916,0.000002443658,0.06687704],"study_design_scores_gemma":[0.00029144695,0.00016706905,0.00006506494,0.00034890938,0.0000036993163,0.000005115423,2.5369985e-7,0.9193213,0.0014536615,0.07802428,0.00006712568,0.0002520514],"about_ca_topic_score_codex":0.000032938915,"about_ca_topic_score_gemma":0.00002860676,"teacher_disagreement_score":0.45308506,"about_ca_system_score_codex":0.00022236041,"about_ca_system_score_gemma":0.0007560699,"threshold_uncertainty_score":0.99998003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035226345,0.00053665286,0.991046,0.000025164802,0.0011439933,0.0002025498,0.0000047995936,0.00009088919,0.0065976637],"genre_scores_gemma":[0.7153769,0.0003168603,0.2826021,0.00023386326,0.00080838153,0.0000045043007,0.000021384552,0.00010297697,0.0005329848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982161,0.000006770284,0.00047737328,0.0004898193,0.00046977686,0.00034018053],"domain_scores_gemma":[0.9989927,0.00009813773,0.000100913385,0.00057293085,0.00015200871,0.00008335695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043858954,0.00031189414,0.00037388667,0.00046783415,0.00005390372,0.000045724475,0.0006230754,0.00029887012,0.00009443674],"category_scores_gemma":[0.000032913915,0.00030047528,0.00008718119,0.00023300473,0.00024716783,0.00014818042,0.00008638435,0.00049037655,0.00003234378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017012175,0.00000426505,0.00000474867,0.000045673976,0.0000062009353,0.000011950271,0.00016454514,0.71391934,0.0008866066,0.0007337244,0.0000047562944,0.2842165],"study_design_scores_gemma":[0.00006176621,0.000059696627,0.000040331695,0.00027465555,0.000006651437,0.000016869259,1.2012559e-7,0.9530354,0.037829645,0.0074069514,0.0009044586,0.000363426],"about_ca_topic_score_codex":0.00002093509,"about_ca_topic_score_gemma":0.00006501585,"teacher_disagreement_score":0.71502465,"about_ca_system_score_codex":0.00012169242,"about_ca_system_score_gemma":0.0000646769,"threshold_uncertainty_score":0.99994475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004918158,0.0008674031,0.99407804,0.00016610754,0.0020538378,0.00065301755,0.000036125428,0.00021326367,0.001440365],"genre_scores_gemma":[0.5910258,0.00007733356,0.40772775,0.0005745699,0.0004296845,0.000010039723,0.000012244015,0.00007030114,0.00007222876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99543405,0.000047089263,0.0008551002,0.0017841611,0.0011423661,0.0007372078],"domain_scores_gemma":[0.9955226,0.00052009395,0.0006025216,0.0027369044,0.0004280318,0.00018982096],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011946479,0.00060165895,0.00087338686,0.0012553631,0.00016711252,0.00040997204,0.005392669,0.00043258662,0.000021734186],"category_scores_gemma":[0.000095363335,0.00053990725,0.0002992376,0.001291154,0.00083336915,0.000735819,0.0018570347,0.0009016455,0.000055326986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004761928,0.00031845953,0.00036160668,0.00086713635,0.00007065213,0.00014409452,0.0031868555,0.006549667,0.0048911474,0.53597534,0.00005621837,0.4475312],"study_design_scores_gemma":[0.0009782586,0.0010311585,0.00018365268,0.0012397455,0.000026522694,0.00013145016,5.5394946e-7,0.87263274,0.007189535,0.113112606,0.0019167155,0.0015570493],"about_ca_topic_score_codex":0.00005631362,"about_ca_topic_score_gemma":0.00006408337,"teacher_disagreement_score":0.8660831,"about_ca_system_score_codex":0.0001236214,"about_ca_system_score_gemma":0.0010298718,"threshold_uncertainty_score":0.9999886},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044454497,0.00017959288,0.9918191,0.00073111564,0.0019335548,0.0006401968,0.000008678597,0.0003193577,0.003923871],"genre_scores_gemma":[0.32593408,0.000042529853,0.668646,0.0016770324,0.0007123597,0.000025048797,0.000048249898,0.00010411581,0.0028105956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99549264,0.000057075333,0.000638874,0.001494311,0.0014498733,0.0008672441],"domain_scores_gemma":[0.997204,0.00021227187,0.00029603273,0.0015558358,0.0001961421,0.0005357389],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006354286,0.00067698443,0.00057386764,0.000732855,0.00035861987,0.0012610932,0.003754951,0.00037046857,0.00001657562],"category_scores_gemma":[0.000071994764,0.00064164144,0.0001245945,0.0009283011,0.00011411987,0.0017964336,0.0013381185,0.0010685559,0.00009209555],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026927019,0.000115621275,0.00023773625,0.00022873211,0.00005610818,0.000030864518,0.013886108,0.03492079,0.006044405,0.008013658,0.009206115,0.9272329],"study_design_scores_gemma":[0.0024124638,0.00070856925,0.0007432432,0.0020170272,0.00003428922,0.000076661636,0.000010989621,0.8169737,0.06621973,0.008787946,0.09683071,0.00518467],"about_ca_topic_score_codex":0.00007988688,"about_ca_topic_score_gemma":0.000014167198,"teacher_disagreement_score":0.9220483,"about_ca_system_score_codex":0.00044246516,"about_ca_system_score_gemma":0.00063355296,"threshold_uncertainty_score":0.9997757},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001240638,0.00019124172,0.9963975,0.00024558383,0.00080820743,0.00095574587,0.000002865657,0.000089470166,0.000068769434],"genre_scores_gemma":[0.13420469,0.000023610468,0.8651446,0.00008256186,0.00036419297,0.000040848998,0.0000041884414,0.000020141575,0.0001151884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979903,0.000013509631,0.00030933422,0.0010283911,0.00034884232,0.00030963574],"domain_scores_gemma":[0.9987434,0.00012064067,0.00024040126,0.00057940267,0.00023964711,0.00007649779],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032070727,0.00025103657,0.00020791698,0.00043903923,0.00036210177,0.0003366874,0.0006683218,0.00023396772,0.0000011941279],"category_scores_gemma":[0.000023627234,0.00025164787,0.000058983318,0.00037916205,0.00025532444,0.0005084327,0.00026352395,0.00029008204,0.0000051390475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016949446,0.000013384891,0.000021439668,0.000029565455,0.000004193962,6.07733e-7,0.00015162362,0.017225023,0.002494338,0.0062616756,9.309787e-7,0.97379553],"study_design_scores_gemma":[0.0001286807,0.00010138388,0.0008430592,0.00007642232,0.000008461174,0.000053654043,3.6607227e-7,0.9588637,0.00044162382,0.03780504,0.0013954903,0.00028217214],"about_ca_topic_score_codex":0.00001342829,"about_ca_topic_score_gemma":0.000017111723,"teacher_disagreement_score":0.97351336,"about_ca_system_score_codex":0.00026680387,"about_ca_system_score_gemma":0.0002576979,"threshold_uncertainty_score":0.99999356},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042892606,0.0006015202,0.9911569,0.0006832998,0.0005730537,0.0005229332,0.000008881632,0.00021348594,0.001950661],"genre_scores_gemma":[0.92415863,0.00016979706,0.07172492,0.0013936209,0.00056405395,0.000041626492,0.00023577345,0.00007876599,0.0016328027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972759,0.00011312097,0.0006153618,0.0010859844,0.00040281197,0.00050681893],"domain_scores_gemma":[0.99793,0.0008576202,0.00023969811,0.0007132036,0.000114941904,0.00014457379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022834449,0.0002665096,0.0006265369,0.0007319707,0.000079813646,0.000042742795,0.00050976884,0.00023241395,0.000024317356],"category_scores_gemma":[0.0019219122,0.00024567475,0.00009226897,0.00056870683,0.0005655623,0.00012097829,0.00034398073,0.00081585866,0.00014360495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059962138,0.00007169213,0.028345095,0.00023161252,0.000023876315,0.00019624784,0.00078111276,0.090239584,0.00042834334,0.003310161,0.000031846856,0.8762805],"study_design_scores_gemma":[0.00064963085,0.00014112322,0.10347057,0.0005915372,0.000027776885,0.00009130691,0.0000019342076,0.8294191,0.00017592283,0.06393059,0.00096258946,0.0005379495],"about_ca_topic_score_codex":0.000034108052,"about_ca_topic_score_gemma":0.00013422489,"teacher_disagreement_score":0.91986936,"about_ca_system_score_codex":0.00023340063,"about_ca_system_score_gemma":0.0001830503,"threshold_uncertainty_score":0.9999995},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3825996,0.0004023586,0.6149238,0.00019894975,0.0012346812,0.0004907757,0.0000016565201,0.000047884118,0.000100338046],"genre_scores_gemma":[0.94789386,0.000036604517,0.050905906,0.00062028837,0.00049601233,0.000011470673,0.0000031505606,0.000024877636,0.00000781848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676985,0.00011684919,0.00036095706,0.0010941329,0.0010676576,0.00059058337],"domain_scores_gemma":[0.99817413,0.00017763721,0.00013292959,0.0010393034,0.00031354936,0.00016242813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010906509,0.00030313735,0.00045845786,0.00062372646,0.00017339723,0.00021335759,0.0007165454,0.00050928886,0.000023215662],"category_scores_gemma":[0.00012747548,0.00025586248,0.00012482237,0.0010947183,0.0003890535,0.00023496272,0.0011525266,0.0017728283,0.000017912304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007521245,0.00004786696,0.0007291307,0.00018748,0.000017648781,0.00007937307,0.00040053748,0.63179666,0.005389513,0.0000047690314,0.0000029837597,0.36126885],"study_design_scores_gemma":[0.00040526097,0.0001543827,0.0010104788,0.0006441943,0.000021991225,0.000094546696,0.0000010414449,0.976723,0.015454882,0.0052084145,0.000025378962,0.00025641057],"about_ca_topic_score_codex":0.00014805452,"about_ca_topic_score_gemma":0.000022746652,"teacher_disagreement_score":0.56529427,"about_ca_system_score_codex":0.0005142357,"about_ca_system_score_gemma":0.0012941335,"threshold_uncertainty_score":0.99998933},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013628258,0.00077703735,0.9749479,0.0028623813,0.0068045426,0.00044157944,0.0000026915563,0.00037421827,0.00016138112],"genre_scores_gemma":[0.88385916,0.000079974336,0.11452474,0.0011508027,0.00033416215,0.00002545351,0.000004389957,0.000015241318,0.0000060848665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962243,0.00013767896,0.00043862214,0.0015466798,0.00089902844,0.0007536863],"domain_scores_gemma":[0.9955585,0.0008722889,0.00027145902,0.003006616,0.00018973426,0.000101406746],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021160953,0.0003756202,0.0003396013,0.00033368715,0.00046430418,0.0019044324,0.0066947173,0.00024409585,0.0000045516363],"category_scores_gemma":[0.0001944763,0.00026005265,0.00013035756,0.0015252912,0.0005421884,0.0004534845,0.005452965,0.001068904,0.00005439782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076083284,0.0000623288,0.00082647573,0.000055871064,0.000014407122,0.00003877315,0.0010449524,0.33242652,0.00058512477,0.016778348,0.00009924043,0.6480604],"study_design_scores_gemma":[0.000108612076,0.000037161106,0.0020240599,0.00018990079,0.0000024536143,0.000022283104,3.3090217e-7,0.79607844,0.0031811208,0.19785842,0.00018580102,0.00031140764],"about_ca_topic_score_codex":0.000050596234,"about_ca_topic_score_gemma":0.000051680992,"teacher_disagreement_score":0.8702309,"about_ca_system_score_codex":0.00025385618,"about_ca_system_score_gemma":0.0006242852,"threshold_uncertainty_score":0.99998516},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025090243,0.00023296589,0.97170776,0.0016275014,0.0072640763,0.00047193078,0.000007654766,0.00028559784,0.018151617],"genre_scores_gemma":[0.21364532,0.000076863784,0.7771284,0.0029016137,0.0023133392,0.000029286079,0.000038592505,0.00012255087,0.0037440485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963368,0.000052773637,0.0005033842,0.001554844,0.00096431375,0.0005878698],"domain_scores_gemma":[0.9968835,0.0005550904,0.0003421486,0.0018579304,0.00019296164,0.00016836336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070721685,0.0005335815,0.00049837254,0.0006888582,0.00037811155,0.00088594825,0.003132173,0.00041252593,0.00002723532],"category_scores_gemma":[0.000055635446,0.00050310866,0.00017443183,0.0006138762,0.0005029042,0.0006380231,0.00071586674,0.0009498233,0.00015513338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012253542,0.00009005856,0.00013833039,0.0001193033,0.00006221083,0.00018101567,0.0017183975,0.030838605,0.0012288707,0.29772413,0.0005639522,0.6672126],"study_design_scores_gemma":[0.002307184,0.0009358856,0.00051032443,0.00048293255,0.000027940208,0.0001851957,4.5643503e-7,0.64920837,0.0010031803,0.31164554,0.0318206,0.0018723818],"about_ca_topic_score_codex":0.000054151005,"about_ca_topic_score_gemma":0.00035628089,"teacher_disagreement_score":0.66534024,"about_ca_system_score_codex":0.00035945605,"about_ca_system_score_gemma":0.0007011879,"threshold_uncertainty_score":0.99974203},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051092694,0.0017756957,0.99571043,0.0006693578,0.0008147947,0.00028464865,0.0000347375,0.00002255384,0.00017682592],"genre_scores_gemma":[0.15615775,0.00032793067,0.8396859,0.0014505523,0.0017528764,0.00003527728,0.000039986026,0.00004380484,0.000505876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833786,0.000009546435,0.00019728988,0.0008229144,0.00026739947,0.0003650145],"domain_scores_gemma":[0.99919486,0.00010749955,0.000113637034,0.00039371557,0.000110489374,0.000079797646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024572192,0.0002531755,0.00026810396,0.00008575315,0.00009220764,0.00005852466,0.00058165187,0.00071612914,0.000017187365],"category_scores_gemma":[0.000057275163,0.00018624077,0.000103651524,0.00006979831,0.00053284044,0.0000029046107,0.00031260916,0.00035460418,0.000004686469],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008104324,0.000023753157,0.0001232072,0.00006803191,0.000016522414,0.000005033351,0.000055471868,0.026986497,0.0010901587,0.0014937014,0.00006318282,0.9699934],"study_design_scores_gemma":[0.0012256462,0.0018985586,0.00022512571,0.0038412116,0.00006274101,0.00016349324,0.0000010718533,0.6305766,0.012989526,0.2894276,0.05733973,0.0022486968],"about_ca_topic_score_codex":0.0000040093496,"about_ca_topic_score_gemma":0.0000074708323,"teacher_disagreement_score":0.9677447,"about_ca_system_score_codex":0.000038884045,"about_ca_system_score_gemma":0.00030410182,"threshold_uncertainty_score":0.7594678},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040577576,0.00056182075,0.9826156,0.00067719637,0.010427723,0.00079635053,0.0000010857432,0.0004015879,0.00046090214],"genre_scores_gemma":[0.75704324,0.000014802919,0.24180163,0.00048656453,0.00060626527,0.000020066023,0.000006413494,0.000017829178,0.0000032092298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99491477,0.00018196095,0.00064791227,0.0020707003,0.0012367672,0.000947875],"domain_scores_gemma":[0.9971303,0.0002605501,0.0004127856,0.0016837863,0.00032528653,0.00018733666],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016644578,0.0005410232,0.0006844288,0.00081000995,0.00024139971,0.0018933843,0.004716413,0.00038459676,0.0000050123854],"category_scores_gemma":[0.00012816813,0.00047756705,0.00018369454,0.0018761603,0.00032997524,0.0005949833,0.004822099,0.0011058655,0.00012529187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024166827,0.00006212069,0.0015868006,0.00016487273,0.000011562441,0.000041889238,0.0026318887,0.32787374,0.000085475935,0.008832765,0.000019000654,0.6586875],"study_design_scores_gemma":[0.00023652882,0.00009008794,0.002917394,0.00007866307,0.000004628942,0.000047443504,9.063345e-7,0.83310795,0.0012039376,0.16152945,0.00021336193,0.00056966627],"about_ca_topic_score_codex":0.00030291703,"about_ca_topic_score_gemma":0.00004689962,"teacher_disagreement_score":0.7529855,"about_ca_system_score_codex":0.00043353165,"about_ca_system_score_gemma":0.001034794,"threshold_uncertainty_score":0.9997676},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079816475,0.00042054936,0.9784488,0.0007984742,0.0022225853,0.0003884077,0.000008700942,0.00020485699,0.016709454],"genre_scores_gemma":[0.6095248,0.00019748037,0.38040283,0.005945374,0.0007861926,0.000029924719,0.000027025342,0.00010559421,0.0029807547],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959,0.00005446577,0.00066365954,0.0016963216,0.00090782746,0.00077775866],"domain_scores_gemma":[0.99657744,0.000749333,0.000277837,0.0021242797,0.000127964,0.00014314614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012540322,0.0005310377,0.00061349064,0.0015222335,0.00015041875,0.000548088,0.0039036958,0.00039094896,0.0000853538],"category_scores_gemma":[0.00010508609,0.0004989794,0.00013299144,0.0012709275,0.0004764934,0.0007413287,0.001678807,0.0010932394,0.0002695322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007633416,0.000093287534,0.00074697885,0.00008983481,0.000016619219,0.0004419973,0.0023367528,0.025110887,0.00014826919,0.33258182,0.000058357644,0.6383676],"study_design_scores_gemma":[0.00064878043,0.0002466068,0.001846991,0.0014494312,0.000008429118,0.00020824482,7.736715e-7,0.3796353,0.00040378026,0.6089436,0.0051064193,0.0015016682],"about_ca_topic_score_codex":0.00002540395,"about_ca_topic_score_gemma":0.00013198557,"teacher_disagreement_score":0.6368659,"about_ca_system_score_codex":0.00029785573,"about_ca_system_score_gemma":0.00069361343,"threshold_uncertainty_score":0.9997462},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006577425,0.0001649829,0.994682,0.00091831415,0.0015933192,0.00035148853,0.000029593046,0.000045904075,0.001556652],"genre_scores_gemma":[0.8465653,0.000048142152,0.1500092,0.0022642203,0.0002951264,0.0000046714276,0.000024077832,0.00003059256,0.0007586391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968374,0.00004005326,0.00054698,0.0009646295,0.0012128733,0.00039807623],"domain_scores_gemma":[0.9972099,0.00027321724,0.0004208824,0.0017148651,0.0002758166,0.000105311774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072633935,0.00032700054,0.0005475375,0.0013674832,0.00023317662,0.00033353714,0.0026647814,0.00018082198,0.00009467657],"category_scores_gemma":[0.000043001248,0.00024279249,0.0003884023,0.0029340428,0.00041822594,0.00034949672,0.0009531391,0.0004736474,0.0000066820876],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014863643,0.0000302732,0.0010858813,0.000032176467,0.00031528424,0.000004872481,0.0051759765,0.05512839,0.00011621647,0.104490966,0.00012279658,0.8334823],"study_design_scores_gemma":[0.0010161308,0.0005682256,0.012460654,0.0002999799,0.0005679011,0.000014613017,0.000002292181,0.76808536,0.0006468015,0.1670513,0.048057675,0.0012290957],"about_ca_topic_score_codex":0.00012097775,"about_ca_topic_score_gemma":0.0013882146,"teacher_disagreement_score":0.84590757,"about_ca_system_score_codex":0.0001483333,"about_ca_system_score_gemma":0.0009693738,"threshold_uncertainty_score":0.99007905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017846364,0.0005935272,0.9887981,0.000023904546,0.0017706772,0.0001844313,9.956151e-7,0.00022463691,0.0066191005],"genre_scores_gemma":[0.8064635,0.000059368915,0.19258355,0.00018482753,0.00009570978,0.0000035419712,0.0000031890022,0.00007163899,0.00053467724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864167,0.0000026969271,0.00029457058,0.00045135428,0.00029713416,0.00031257793],"domain_scores_gemma":[0.99917436,0.000093746254,0.00008671997,0.00056316407,0.00004835967,0.000033625798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016235352,0.00027650685,0.0003301015,0.0005349802,0.000019205645,0.000028752991,0.0010188647,0.00028027964,0.000030528412],"category_scores_gemma":[0.000023316314,0.0002840524,0.000053204036,0.00016474567,0.00030583082,0.00022640335,0.00039597906,0.00067746174,0.000052314084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034965515,0.000007891723,0.0003253302,0.00024849843,0.000034791527,0.000034007066,0.0006062747,0.15948415,0.0017890955,0.010209057,0.000014798696,0.8272426],"study_design_scores_gemma":[0.00028252008,0.00010331301,0.00006571305,0.0012217691,0.000010723887,0.000030508914,9.138143e-8,0.8651021,0.045818176,0.082706094,0.003967061,0.0006919334],"about_ca_topic_score_codex":0.0000057018647,"about_ca_topic_score_gemma":0.0000055636924,"teacher_disagreement_score":0.82655066,"about_ca_system_score_codex":0.00024744106,"about_ca_system_score_gemma":0.00004674763,"threshold_uncertainty_score":0.99996114},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16091979,0.00030045953,0.83664674,0.00009112796,0.00061261444,0.0003485408,0.000018114568,0.00020455202,0.0008580879],"genre_scores_gemma":[0.9956446,0.0000087952,0.0040575312,0.00001547419,0.000036872327,0.0000027124906,0.0000020675154,0.000013816856,0.00021808365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991375,0.0000038014705,0.00021630673,0.00023796786,0.00025458433,0.00014984455],"domain_scores_gemma":[0.99953055,0.0000365174,0.00006832126,0.000315423,0.000037196045,0.000012008175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009212865,0.0001531607,0.00016972922,0.00025230777,0.00004560171,0.000044969678,0.00041175447,0.00017079,0.0000113187325],"category_scores_gemma":[0.000015680605,0.000121448305,0.00004654413,0.00014141468,0.0001509136,0.00014325154,0.00016106275,0.00035722635,0.0000025657457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033293097,0.0000025953816,0.000044224314,0.000044841665,0.0000036367562,7.225999e-7,0.00018550073,0.987527,0.008902534,0.0006546735,0.0000015076231,0.0026294184],"study_design_scores_gemma":[0.000091565824,0.000018539402,0.0006195259,0.00032874857,0.0000039395186,0.0000028515926,2.0020433e-7,0.93446976,0.058987956,0.0053194487,0.000009377775,0.00014805676],"about_ca_topic_score_codex":0.0000017684166,"about_ca_topic_score_gemma":0.000016433714,"teacher_disagreement_score":0.83472484,"about_ca_system_score_codex":0.000060258437,"about_ca_system_score_gemma":0.00006935558,"threshold_uncertainty_score":0.49525183},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074847434,0.004584854,0.92988783,0.06084854,0.0019761552,0.00044722256,0.000024139656,0.0003613306,0.0017950798],"genre_scores_gemma":[0.055698168,0.004362453,0.9374018,0.0019712176,0.00041566062,0.000007873333,0.00002515103,0.000056997542,0.000060686943],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99387395,0.0000774284,0.00060328736,0.003464694,0.0011224536,0.0008581887],"domain_scores_gemma":[0.9747562,0.0014276693,0.00025774183,0.023324875,0.00010373653,0.0001298119],"candidate_categories":["metaresearch","metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.002742879,0.00059438177,0.0007176257,0.0012376352,0.00011938655,0.00053942425,0.0806577,0.0011993863,0.0000052478867],"category_scores_gemma":[0.009604172,0.00054976076,0.00004464201,0.0006488075,0.0012360929,0.0008137899,0.28819832,0.0032391879,0.000040762683],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034412778,0.000016491449,0.00010712647,0.000087526845,0.0000068712966,0.000112564725,0.00020228015,0.00011702648,0.000023856916,0.018072356,0.00047045268,0.98078],"study_design_scores_gemma":[0.0002645569,0.00009605331,0.00042939754,0.00058053265,0.0000034473728,0.00008529878,2.1315105e-7,0.37402347,0.00011035484,0.6180293,0.0057730847,0.00060432195],"about_ca_topic_score_codex":0.000029054327,"about_ca_topic_score_gemma":0.00022825372,"teacher_disagreement_score":0.9801757,"about_ca_system_score_codex":0.00023129048,"about_ca_system_score_gemma":0.0007236395,"threshold_uncertainty_score":0.99969536},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079895527,0.0005170551,0.9951889,0.00042109253,0.00088055845,0.00083543075,0.000038016704,0.000023588329,0.0012964001],"genre_scores_gemma":[0.9161403,0.00003186578,0.08258548,0.0009396205,0.00015123733,0.000011054719,0.000035125875,0.00001786921,0.000087409804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971273,0.00003925933,0.0005769213,0.0012170513,0.00064564886,0.0003938343],"domain_scores_gemma":[0.99691665,0.00047859634,0.0003432118,0.0020805737,0.00013038455,0.000050601047],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.002082937,0.00030565236,0.00048341916,0.00025037574,0.000069149144,0.00039634877,0.006492958,0.00017041925,0.00000270834],"category_scores_gemma":[0.000115428054,0.0002275264,0.00005225886,0.00026208992,0.00025943806,0.001000163,0.0021649355,0.00043329358,0.000002860177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048414488,0.00016588467,0.0009415491,0.0013320534,0.000062287894,0.00007713733,0.032482903,0.0026929257,0.0003986375,0.1555896,0.00049133395,0.8057173],"study_design_scores_gemma":[0.00048216528,0.00012652797,0.00014237735,0.0010195557,0.0000058038972,0.000029955363,0.0000013592633,0.9517166,0.00020597974,0.039860144,0.0060707224,0.0003387956],"about_ca_topic_score_codex":0.00008900479,"about_ca_topic_score_gemma":0.00006107723,"teacher_disagreement_score":0.94902366,"about_ca_system_score_codex":0.000059095528,"about_ca_system_score_gemma":0.0002394648,"threshold_uncertainty_score":0.9988824},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012474735,0.0013432861,0.97705036,0.0004883884,0.0078062923,0.0007159637,0.0000055559626,0.000085526175,0.000029882529],"genre_scores_gemma":[0.67723465,0.000052533487,0.32016432,0.00021557423,0.0022909772,0.000009839811,0.000012300167,0.000017922295,0.0000018786324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957616,0.0003786908,0.0005188818,0.002091367,0.0005326854,0.0007168279],"domain_scores_gemma":[0.99753875,0.00035569284,0.00037600606,0.0011625239,0.00039103517,0.00017600428],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011243632,0.0006020269,0.00062393316,0.00050081365,0.0005079818,0.0015590272,0.001554898,0.00042245822,0.0000056871927],"category_scores_gemma":[0.0001608994,0.00055416435,0.000121386605,0.0012659675,0.0004605244,0.0009976273,0.0027241793,0.0008156514,0.0000072858807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046079526,0.000027762453,0.00038132616,0.000015922786,0.000013454744,0.0000048446423,0.0008225043,0.83516634,0.0013657738,0.0001638565,0.000028877403,0.16200472],"study_design_scores_gemma":[0.0003221009,0.00007276005,0.0008577951,0.00013550498,0.000017502214,0.000015141099,6.215444e-7,0.9920187,0.0035344744,0.0023433284,0.00006342903,0.00061864126],"about_ca_topic_score_codex":0.0000922145,"about_ca_topic_score_gemma":0.00016375478,"teacher_disagreement_score":0.66475993,"about_ca_system_score_codex":0.00040803745,"about_ca_system_score_gemma":0.0007272948,"threshold_uncertainty_score":0.999691},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45684698,0.000014594598,0.54270154,0.00012789012,0.00005926557,0.0001702238,0.0000010670457,0.00005064069,0.00002779164],"genre_scores_gemma":[0.88941026,5.8005423e-7,0.11015,0.00008171972,0.00029011615,0.000055501747,0.0000055023343,0.000005485607,8.027235e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870354,0.000044614982,0.00019280503,0.0005068222,0.00021059347,0.00034163502],"domain_scores_gemma":[0.9993654,0.000083845414,0.00007213935,0.0003218948,0.000089668814,0.00006708107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012623743,0.00015444336,0.00018138734,0.000107078784,0.00014419053,0.00019706033,0.00045383378,0.00004273557,0.00037145423],"category_scores_gemma":[0.0000086154205,0.00012639545,0.00006023928,0.0007225118,0.0002063726,0.00031757014,0.00019717545,0.0002598005,0.000029587332],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036101856,0.000047389593,0.009744704,0.0000010265993,0.0000053843523,0.0000011348101,0.00007429657,0.08420721,0.009706663,0.00021869334,0.000008141101,0.8959817],"study_design_scores_gemma":[0.00018025443,0.00013973321,0.035495393,0.000026327725,0.000004863679,0.0000011079236,0.0000032125074,0.79149777,0.057768457,0.11457257,0.00003322493,0.00027708523],"about_ca_topic_score_codex":0.0009235048,"about_ca_topic_score_gemma":0.000039462073,"teacher_disagreement_score":0.8957047,"about_ca_system_score_codex":0.0000488441,"about_ca_system_score_gemma":0.00004717433,"threshold_uncertainty_score":0.5154257},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003552971,0.0008726066,0.9846963,0.00020422072,0.0038280122,0.00053064723,0.000010089319,0.00012686416,0.009695722],"genre_scores_gemma":[0.38194737,0.00044465376,0.5878182,0.0041563874,0.0011528503,0.000040092975,0.00003895346,0.000101749436,0.02429973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596477,0.000035519413,0.0005690977,0.0016227013,0.0012404013,0.0005675156],"domain_scores_gemma":[0.99706626,0.0002588113,0.00030890928,0.0019056041,0.00028703667,0.00017336648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001084668,0.00042213337,0.0005203446,0.0017477367,0.00019358881,0.0009459199,0.004454466,0.00038563574,0.0001284369],"category_scores_gemma":[0.00006531439,0.00040009708,0.00017697216,0.0013731724,0.00048153836,0.0005894859,0.0011568305,0.00063543173,0.0005402275],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028141073,0.00006142914,0.000025892235,0.000058881255,0.000014816864,0.000040461415,0.0010736007,0.0016035979,0.0005082562,0.07076555,0.00027412007,0.9255706],"study_design_scores_gemma":[0.0010489606,0.00060692243,0.0009284941,0.00048463728,0.00002870797,0.00020607351,8.577873e-7,0.6314642,0.011351013,0.26547894,0.085598275,0.0028029557],"about_ca_topic_score_codex":0.000023399592,"about_ca_topic_score_gemma":0.000019517145,"teacher_disagreement_score":0.92276764,"about_ca_system_score_codex":0.0002485202,"about_ca_system_score_gemma":0.00075776945,"threshold_uncertainty_score":0.9998451},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009173663,0.0000479369,0.99707466,0.00006662067,0.00019715325,0.0012388699,0.000014344405,0.00024172595,0.0010269317],"genre_scores_gemma":[0.22251017,0.000024129538,0.77693605,0.000102855825,0.000100863035,0.00010763031,0.00003828117,0.00004748336,0.00013250927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616545,0.000104769046,0.0005529859,0.0017891185,0.00083616533,0.00055151625],"domain_scores_gemma":[0.99712116,0.0007436715,0.0006696431,0.0008614281,0.00046467557,0.00013943188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045525472,0.00058641843,0.0004996806,0.0012831439,0.0004457853,0.00023921148,0.0012386164,0.00025677242,0.000023307768],"category_scores_gemma":[0.00015786818,0.00048197986,0.00008097527,0.0011935689,0.0003658491,0.0010127813,0.00034384715,0.0007455581,0.000012354984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013619178,0.000040288585,0.0016693539,0.00000715547,0.0000069923317,0.000005252601,0.00025571173,0.8692856,0.000030859672,0.0012542602,5.0307822e-8,0.12743086],"study_design_scores_gemma":[0.0011481963,0.0001702125,0.0017411349,0.00026700643,0.00000893056,0.0000052754312,8.3195056e-7,0.9900424,0.0013840062,0.004564211,0.000016004607,0.0006518119],"about_ca_topic_score_codex":0.00008274651,"about_ca_topic_score_gemma":0.0002723031,"teacher_disagreement_score":0.22241844,"about_ca_system_score_codex":0.0014072441,"about_ca_system_score_gemma":0.00046809096,"threshold_uncertainty_score":0.9997632},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0212915,0.00026036246,0.97212684,0.0006786264,0.0034560065,0.000624804,0.0000053419703,0.0010198678,0.00053667586],"genre_scores_gemma":[0.5414189,0.0000010924321,0.4573956,0.0010087298,0.00013025028,0.000021321634,0.0000031726531,0.000017135062,0.0000037829764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947472,0.000089859146,0.0006708582,0.0024427702,0.0010740841,0.00097523676],"domain_scores_gemma":[0.99635047,0.00042504875,0.0004434021,0.0020403157,0.0005759867,0.00016479312],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016359775,0.0006075595,0.0005629754,0.0009844638,0.00023267837,0.0030033956,0.005151134,0.00036189036,0.000025064173],"category_scores_gemma":[0.00043482252,0.0005775085,0.00014601741,0.0025406892,0.00061587343,0.000745698,0.0071439245,0.0013418008,0.00005228308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044884805,0.000089592766,0.00024188965,0.00016136741,0.000007958266,0.000021608028,0.00061398663,0.2942119,0.00090863224,0.00036496564,0.000019460971,0.7033542],"study_design_scores_gemma":[0.00018527245,0.00009975313,0.0006253253,0.00049341656,0.0000048114425,0.000038493155,4.1292475e-7,0.9545545,0.006660279,0.03666826,0.000043871594,0.00062562217],"about_ca_topic_score_codex":0.000017371938,"about_ca_topic_score_gemma":0.00001057476,"teacher_disagreement_score":0.70272857,"about_ca_system_score_codex":0.0003444923,"about_ca_system_score_gemma":0.0013857135,"threshold_uncertainty_score":0.99966764},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009924383,0.0006429606,0.9871963,0.0060157827,0.0022436613,0.00037831036,0.000010267861,0.00031263317,0.0031008003],"genre_scores_gemma":[0.08346736,0.00016042816,0.8945303,0.01629529,0.00216817,0.000021438947,0.0000062840613,0.00015051925,0.0032001932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940142,0.000068894646,0.00076562306,0.0022124976,0.0016260828,0.0013127208],"domain_scores_gemma":[0.994858,0.0010537559,0.0004408347,0.0030484484,0.00030066306,0.0002983005],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016402671,0.0008642403,0.00071821193,0.0005431654,0.0013068024,0.0015453709,0.0082062995,0.00036888378,0.0000082677325],"category_scores_gemma":[0.00010072794,0.0006088856,0.00032567236,0.0006240783,0.0012193699,0.0002460359,0.0028850813,0.0016527754,0.00011686261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030805465,0.0000082078805,0.0000024993108,0.00001678773,0.000012312312,0.000022099464,0.0007166057,0.3392299,0.000032822943,0.025407871,0.0002878071,0.63426],"study_design_scores_gemma":[0.0001318958,0.00008526052,0.000008505237,0.00014867687,0.0000048811494,0.000041066476,5.524709e-8,0.6398452,0.000121577956,0.34908998,0.010014116,0.0005087692],"about_ca_topic_score_codex":0.000017349976,"about_ca_topic_score_gemma":0.00003257286,"teacher_disagreement_score":0.6337512,"about_ca_system_score_codex":0.00020567927,"about_ca_system_score_gemma":0.0006417585,"threshold_uncertainty_score":0.9999934},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024565004,0.0058560367,0.9848885,0.0004788409,0.0016534261,0.001194969,0.000004074376,0.000052749885,0.0034149184],"genre_scores_gemma":[0.9775423,0.00007009417,0.022099316,0.000033731365,0.00015683018,0.00003569657,0.0000011380445,0.00001930075,0.00004160356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940011,0.0005343847,0.001138819,0.0010661689,0.0024878972,0.00077164534],"domain_scores_gemma":[0.9934111,0.0035836045,0.00062308315,0.001565814,0.0007039644,0.000112437156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0073121204,0.00037851,0.00074828736,0.0015900253,0.0001772982,0.00023876308,0.004137836,0.00029016403,0.000004971679],"category_scores_gemma":[0.00020106226,0.00029468487,0.00010774145,0.0010968936,0.00056172913,0.0005465763,0.0016202014,0.0008766101,0.000017734425],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005778461,0.00023156125,0.0002978596,0.00043071326,0.000025808187,0.000017315562,0.025322678,0.0005006137,0.0005715722,0.008871065,0.0000063675843,0.96371865],"study_design_scores_gemma":[0.006448463,0.0034219578,0.24036504,0.1373996,0.00014747302,0.0021076966,0.0012164828,0.47533444,0.035942394,0.04858827,0.036584713,0.012443479],"about_ca_topic_score_codex":0.00009402775,"about_ca_topic_score_gemma":0.00070304755,"teacher_disagreement_score":0.9750858,"about_ca_system_score_codex":0.00043123664,"about_ca_system_score_gemma":0.0009103708,"threshold_uncertainty_score":0.9999505},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017618437,0.0003595176,0.9937539,0.0014841404,0.00089139096,0.00096348766,0.000006325579,0.00027742816,0.00050196407],"genre_scores_gemma":[0.7099355,0.000023272225,0.28898728,0.00046156204,0.00012617624,0.000066920475,9.847928e-7,0.00003396459,0.00036437908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967216,0.000026398762,0.00052601215,0.0015482218,0.0004197203,0.0007580067],"domain_scores_gemma":[0.99681795,0.0012600102,0.00025447106,0.0014005643,0.0001742855,0.00009273637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011376378,0.00045226535,0.000541345,0.0012833311,0.00038763814,0.0002838748,0.002762891,0.000590343,0.0000120313125],"category_scores_gemma":[0.000105812534,0.00046216353,0.00015531841,0.0008799046,0.00044666638,0.00017088579,0.00041348801,0.0011321685,0.000013908881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000423055,0.000080007274,0.00021540964,0.00008514523,0.000015832537,0.000016621667,0.001941034,0.040758044,0.0002571671,0.048741292,0.000003419524,0.9078818],"study_design_scores_gemma":[0.00026381057,0.00018691158,0.00012857949,0.00039368722,0.000008872073,0.000056818237,0.0000016709934,0.9041754,0.0013360087,0.0914223,0.0013645829,0.00066136534],"about_ca_topic_score_codex":0.00007894318,"about_ca_topic_score_gemma":0.0018888101,"teacher_disagreement_score":0.9072204,"about_ca_system_score_codex":0.00030985233,"about_ca_system_score_gemma":0.00051728485,"threshold_uncertainty_score":0.999783},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023997629,0.00007580101,0.98694444,0.00030543568,0.0015722375,0.008138909,0.0000060364473,0.00024062126,0.00269253],"genre_scores_gemma":[0.0016024581,0.000025994632,0.9926958,0.0012739386,0.0027790244,0.0007219606,0.000010561809,0.00005148261,0.0008387574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963218,0.000043414446,0.0006368336,0.0014902793,0.00067548256,0.0008321815],"domain_scores_gemma":[0.9972833,0.0006543302,0.0003953983,0.0012127289,0.00030151094,0.00015275461],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001464217,0.0005108747,0.0006186309,0.00035909755,0.00039155452,0.0006727452,0.0021486846,0.00040847008,0.000048547692],"category_scores_gemma":[0.00007797175,0.0004787846,0.00019006571,0.0004974513,0.0003530421,0.00048934814,0.00085737964,0.00066023006,0.00006416066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011889294,0.000015189588,0.0000027041376,0.000067940906,0.000010654619,0.000012161611,0.00018905268,0.33561805,0.00049590616,0.027565159,0.00017842214,0.63583285],"study_design_scores_gemma":[0.00032733343,0.0004148911,0.0000031485056,0.0006694547,0.0000047912413,0.000051096347,3.0307934e-8,0.93211246,0.0006449111,0.055920344,0.00930737,0.00054414803],"about_ca_topic_score_codex":0.000008781419,"about_ca_topic_score_gemma":0.000025245396,"teacher_disagreement_score":0.6352887,"about_ca_system_score_codex":0.00024033617,"about_ca_system_score_gemma":0.0007309938,"threshold_uncertainty_score":0.9997664},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052226783,0.00012678778,0.99024755,0.00021534352,0.0053539807,0.0006976542,0.0000028984966,0.00026138936,0.002572125],"genre_scores_gemma":[0.13305731,0.000007803242,0.8631093,0.00161338,0.0018627291,0.0000037663651,0.000015732081,0.00009407252,0.00023592547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942263,0.00012610402,0.0008657745,0.0023089615,0.0013669122,0.001105974],"domain_scores_gemma":[0.9960187,0.0010034161,0.0007115217,0.0016711754,0.00033065988,0.00026450434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001748348,0.00077064306,0.0007731149,0.0010339252,0.0006490937,0.0009941079,0.0035727138,0.0005502996,0.0000134637685],"category_scores_gemma":[0.00067073834,0.0008214848,0.00018278939,0.0012332146,0.00034975886,0.0011543698,0.0034004624,0.0014915051,0.000026165979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005745676,0.0000060390626,0.00015031554,0.000023232195,0.000010798006,0.000031718646,0.00055462413,0.8084106,0.00028213588,0.013062661,0.0000034833956,0.17745866],"study_design_scores_gemma":[0.00034648943,0.00007662322,0.00006416909,0.00091465475,0.000014058479,0.000028908576,7.042266e-7,0.98498684,0.00024035406,0.011994073,0.0004451439,0.0008879688],"about_ca_topic_score_codex":0.000048736227,"about_ca_topic_score_gemma":0.000032697266,"teacher_disagreement_score":0.17657626,"about_ca_system_score_codex":0.0007795837,"about_ca_system_score_gemma":0.0008839306,"threshold_uncertainty_score":0.9994236},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008675584,0.0001557642,0.98403424,0.0009102455,0.00037411676,0.00085273926,0.000009714542,0.000115846684,0.004871754],"genre_scores_gemma":[0.71072775,0.000047291804,0.28696156,0.0016518066,0.00024909014,0.000008882565,0.000014203942,0.000052325307,0.00028708094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980209,0.0000062977415,0.0003507652,0.0009402238,0.00028772213,0.00039408205],"domain_scores_gemma":[0.99874294,0.00020614619,0.00016491594,0.0007523786,0.000051932107,0.00008171055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017996835,0.0003222468,0.00048867974,0.0006384253,0.000081444115,0.00006510736,0.00052272703,0.00020833108,0.000035884015],"category_scores_gemma":[0.00004730343,0.0003002083,0.00007846114,0.00024587734,0.00030682443,0.00011259377,0.00036372067,0.00085846684,0.000014577858],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008427219,0.000058187878,0.004686989,0.0003426302,0.000017584587,0.000394353,0.0010650149,0.04141342,0.009583981,0.0065364717,0.00014902715,0.93566805],"study_design_scores_gemma":[0.0038564797,0.0013805352,0.03392196,0.008557912,0.00012271704,0.0015206648,0.0000027378521,0.4702,0.044845622,0.4157215,0.015979486,0.0038903672],"about_ca_topic_score_codex":0.000015477262,"about_ca_topic_score_gemma":0.000011186514,"teacher_disagreement_score":0.9317777,"about_ca_system_score_codex":0.00027725505,"about_ca_system_score_gemma":0.0002674283,"threshold_uncertainty_score":0.999945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048582832,0.0003044717,0.9926267,0.00042724377,0.0009984567,0.0001498381,0.0000069032685,0.00019049441,0.0048100357],"genre_scores_gemma":[0.68532944,0.00004474398,0.30951974,0.0017866516,0.00078786776,0.0000075717335,0.000061501334,0.000090810456,0.0023716683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979512,0.000009775591,0.00033127476,0.00059364917,0.0006965412,0.000417548],"domain_scores_gemma":[0.99891984,0.00020193415,0.000042591353,0.0005862582,0.000060750455,0.00018861143],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038920715,0.00032963612,0.00044390658,0.0006026498,0.000069570306,0.00019649639,0.00062199414,0.0001830083,0.00015907393],"category_scores_gemma":[0.000098016826,0.00029874884,0.00010397203,0.00034438746,0.00022951071,0.00013749936,0.00017555102,0.00058719737,0.00023499798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.3461564e-7,0.0000044726776,0.000015362308,0.00005614351,0.000012585859,0.000063103136,0.0002361827,0.4725348,0.0008020869,0.00018227863,0.00014949561,0.52594274],"study_design_scores_gemma":[0.00011406484,0.000026162921,0.00006069269,0.00035205248,0.000022408643,0.000014608082,1.1362168e-7,0.98949605,0.0007180512,0.003933051,0.0048641195,0.00039860333],"about_ca_topic_score_codex":0.000021863068,"about_ca_topic_score_gemma":0.000033310458,"teacher_disagreement_score":0.6848436,"about_ca_system_score_codex":0.00015545386,"about_ca_system_score_gemma":0.00010173234,"threshold_uncertainty_score":0.9999465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012199566,0.00009650608,0.98549163,0.00055312394,0.0009994558,0.0005014852,0.000007792838,0.00022996205,0.011998073],"genre_scores_gemma":[0.48366937,0.00008276004,0.5138417,0.00122406,0.00015266192,0.000009553368,0.000011103408,0.000039294344,0.0009695277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964844,0.00003238648,0.00042157248,0.0015449884,0.0009606053,0.0005560281],"domain_scores_gemma":[0.9976658,0.00028110418,0.00030855055,0.0012710548,0.000295185,0.00017828216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041356974,0.0005296172,0.00048230565,0.0010172629,0.00019542182,0.00063948485,0.0019915358,0.0002846853,0.00014170885],"category_scores_gemma":[0.00003611171,0.00044394008,0.00010611071,0.00073702296,0.0015069952,0.00079255115,0.00047231463,0.0007268054,0.00008551777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009487673,0.000020662497,0.0012254991,0.000028340302,0.00002070995,0.000042667587,0.00034755672,0.038274143,0.00008895473,0.056545556,0.000013004418,0.90338343],"study_design_scores_gemma":[0.002020312,0.0011012602,0.01492671,0.0020894217,0.000046167974,0.0006835087,0.0000012052665,0.87890226,0.0016035421,0.092736,0.002644266,0.003245368],"about_ca_topic_score_codex":0.00001008723,"about_ca_topic_score_gemma":0.0002210201,"teacher_disagreement_score":0.900138,"about_ca_system_score_codex":0.00015422548,"about_ca_system_score_gemma":0.0011414828,"threshold_uncertainty_score":0.9998012},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016204418,0.00006639114,0.9838838,0.0001687046,0.0011778937,0.0003291988,0.000022929196,0.00006263956,0.014272253],"genre_scores_gemma":[0.09503101,0.000033234297,0.8955761,0.0034944871,0.00096568966,0.0000141220635,0.000008765096,0.0001500704,0.004726531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764556,0.000008641705,0.0003316618,0.0008080511,0.00078193296,0.00042415422],"domain_scores_gemma":[0.99712497,0.0017664607,0.00016977484,0.0006882643,0.00014048461,0.000110015826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036157653,0.00036815982,0.0004784489,0.0002475766,0.00008717667,0.000108778724,0.00080088543,0.00025749335,0.00009808755],"category_scores_gemma":[0.00073159405,0.00029519806,0.00007685876,0.00015784276,0.00019105201,0.00005542552,0.00029372892,0.0006282099,0.00018306091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011598881,0.000025811678,5.5906315e-7,0.00012704344,0.0000062446147,0.000048881113,0.00014883066,0.0004369719,0.000012489561,0.8131599,0.00008743597,0.18593428],"study_design_scores_gemma":[0.00015108463,0.00030294523,0.0000017847507,0.00065545976,0.000011957093,0.000019600038,7.445489e-8,0.09583502,0.000101578335,0.90201366,0.0005794034,0.00032740712],"about_ca_topic_score_codex":0.0000019945915,"about_ca_topic_score_gemma":0.000009361714,"teacher_disagreement_score":0.18560687,"about_ca_system_score_codex":0.00014951476,"about_ca_system_score_gemma":0.0003578597,"threshold_uncertainty_score":0.99995},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003908031,0.00013222011,0.99263144,0.00026737835,0.0019437606,0.00074703543,4.618864e-7,0.00022756124,0.0040110443],"genre_scores_gemma":[0.6094308,0.00022340534,0.38038793,0.0011257544,0.0002962424,0.000029704743,0.000027760536,0.00010101186,0.008377407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519575,0.00008782197,0.0009030528,0.0016362872,0.0012488796,0.00092819537],"domain_scores_gemma":[0.9977198,0.00032505044,0.00024349683,0.0013424259,0.00021344141,0.00015577352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013407787,0.00063956867,0.0006064167,0.0016511474,0.00030268455,0.00053388526,0.002588277,0.0004623015,0.000046341393],"category_scores_gemma":[0.000093180286,0.0006480951,0.00017314342,0.00101638,0.00034986573,0.0009976637,0.0008313095,0.0020530755,0.00021971254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053904587,0.000015716614,0.000107788,0.00003678577,0.000009365505,0.000025681751,0.0008364464,0.93899286,0.00042841333,0.0058670617,0.000002432966,0.053672068],"study_design_scores_gemma":[0.0005853624,0.00034014336,0.00021332825,0.00042014944,0.000007925979,0.000034432724,3.2628276e-7,0.9930965,0.00036468368,0.0022546921,0.0019793932,0.00070310675],"about_ca_topic_score_codex":0.000060649836,"about_ca_topic_score_gemma":0.00010698928,"teacher_disagreement_score":0.61224353,"about_ca_system_score_codex":0.00091232435,"about_ca_system_score_gemma":0.00058217073,"threshold_uncertainty_score":0.999597},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0079052085,0.000058751193,0.98802984,0.0005295415,0.0016018205,0.0003453484,0.0000011494499,0.00004280577,0.0014855156],"genre_scores_gemma":[0.94278455,0.000010469953,0.055556107,0.0006025995,0.00040492282,0.000008166253,0.0000061039927,0.000021731556,0.0006053485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715155,0.000031542455,0.00047592816,0.0012222937,0.00069453515,0.00042414563],"domain_scores_gemma":[0.9990633,0.000086961096,0.000111672365,0.00052444194,0.000104561055,0.000109046094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067254604,0.00032582993,0.0004127213,0.0011320659,0.0002657462,0.00067577255,0.0011407095,0.00012768047,0.00001880221],"category_scores_gemma":[0.000019427607,0.0003236128,0.000102092265,0.0004748781,0.00010611937,0.000644106,0.0011853636,0.00047324895,0.000029612254],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064398487,0.00006827805,0.0022966133,0.000045987344,0.000044693646,0.00003433226,0.0049135983,0.020663233,0.0066402163,0.009269769,0.00004051224,0.9559763],"study_design_scores_gemma":[0.0013246401,0.00060781423,0.032924246,0.0020236638,0.00006320849,0.000048046677,0.000008318306,0.91131586,0.008210146,0.037556093,0.0028837754,0.0030342056],"about_ca_topic_score_codex":0.000049322764,"about_ca_topic_score_gemma":0.0002140275,"teacher_disagreement_score":0.95294213,"about_ca_system_score_codex":0.00037494104,"about_ca_system_score_gemma":0.00011324152,"threshold_uncertainty_score":0.9999216},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008767502,0.0011718367,0.97935957,0.00009332842,0.0008956593,0.00059335824,0.0000024630565,0.000050094863,0.009066172],"genre_scores_gemma":[0.95063627,0.000029700579,0.048882954,0.00013643719,0.00014081749,0.000006102916,0.0000021225273,0.00001534633,0.00015026558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969835,0.00006679827,0.00056051096,0.0009086239,0.00092571194,0.00055485254],"domain_scores_gemma":[0.9973822,0.0005081767,0.0004465388,0.0014397951,0.00016491346,0.000058352867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014126982,0.00036279042,0.00056618516,0.0004944702,0.00007178363,0.00016749153,0.0049382686,0.00021974242,0.0000068314007],"category_scores_gemma":[0.00010899061,0.00025700906,0.00014460347,0.00077325886,0.00068152125,0.00038451253,0.0013121605,0.0006962772,0.000010707078],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010281404,0.00014183293,0.0034857853,0.00042075638,0.000015772943,0.00008186429,0.026322162,0.0068292827,0.0007361596,0.12432152,0.0000054476764,0.83762914],"study_design_scores_gemma":[0.0035333198,0.003886373,0.013897765,0.01151981,0.00007969376,0.00039695937,0.00008032386,0.7991286,0.019014174,0.14207776,0.0019498402,0.004435363],"about_ca_topic_score_codex":0.00008982747,"about_ca_topic_score_gemma":0.00017776154,"teacher_disagreement_score":0.9418687,"about_ca_system_score_codex":0.00010937848,"about_ca_system_score_gemma":0.00046891544,"threshold_uncertainty_score":0.9999882},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004346802,0.0016704833,0.95133173,0.00053148123,0.0034207474,0.0003106468,0.0000019813594,0.00008106678,0.0426084],"genre_scores_gemma":[0.6854851,0.000682478,0.28913847,0.0024215383,0.0019068895,0.000016479795,0.000006300628,0.00011754191,0.02022517],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681795,0.00004250739,0.00050072826,0.0011039247,0.0009113776,0.0006235095],"domain_scores_gemma":[0.9959906,0.0010942162,0.00041285646,0.0020481849,0.00034021103,0.00011395903],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012370505,0.0004146294,0.00049709645,0.00032661672,0.0002960057,0.00040713322,0.005733589,0.00028893029,0.00001361852],"category_scores_gemma":[0.00018467307,0.0002685564,0.00018861347,0.0005046859,0.0009999645,0.0003357354,0.0018070702,0.000732129,0.00009090323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006812961,0.000022901862,0.00017903734,0.00004779078,0.000016139249,0.000027678307,0.001263209,0.0015629934,0.00014519952,0.29230526,0.00018691528,0.70423603],"study_design_scores_gemma":[0.0004731246,0.00048201857,0.0004439077,0.0006071989,0.00001592343,0.00011411521,5.218099e-7,0.43576357,0.004037652,0.5202555,0.036682997,0.0011234885],"about_ca_topic_score_codex":0.00001357458,"about_ca_topic_score_gemma":0.000083410596,"teacher_disagreement_score":0.70311254,"about_ca_system_score_codex":0.00015241095,"about_ca_system_score_gemma":0.00085765944,"threshold_uncertainty_score":0.99997663},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019106764,0.0005846007,0.98964584,0.00066934456,0.0020989012,0.0005162387,0.000004962412,0.00044573427,0.005843334],"genre_scores_gemma":[0.48384437,0.00006626626,0.5117902,0.0007972614,0.0013284937,0.0000568075,0.00004376309,0.00012927313,0.00194356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586767,0.00007810894,0.0005524872,0.0015308948,0.0012480982,0.0007227155],"domain_scores_gemma":[0.99792254,0.0004892205,0.00046940407,0.0007635635,0.00022562043,0.00012965564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010787668,0.0005554586,0.0006524348,0.0005678022,0.000391431,0.0007551595,0.002937333,0.00050980435,0.000016258427],"category_scores_gemma":[0.000080258826,0.00047253602,0.00014766336,0.00041225305,0.00034052372,0.0006220329,0.0015876915,0.0010370822,0.0000295099],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025556883,0.000016468228,0.0002647081,0.0000658227,0.000010072081,0.000028848475,0.003778453,0.00015511479,0.00024512375,0.0061924187,0.0008103252,0.9884301],"study_design_scores_gemma":[0.0022660084,0.0022926251,0.001249489,0.008210884,0.000063589425,0.00043818378,0.000016583128,0.6573831,0.028451651,0.117906146,0.17279792,0.008923846],"about_ca_topic_score_codex":0.000010891556,"about_ca_topic_score_gemma":0.000019811723,"teacher_disagreement_score":0.97950625,"about_ca_system_score_codex":0.0002579803,"about_ca_system_score_gemma":0.00044841526,"threshold_uncertainty_score":0.9997726},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011165955,0.000095694966,0.9542358,0.0014353427,0.0009599048,0.0004935893,0.0000013963295,0.0002730445,0.04249405],"genre_scores_gemma":[0.16921754,0.000064107844,0.8123914,0.0028619752,0.0009014324,0.000007678427,0.00001213153,0.00010688807,0.01443684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994888,0.00006453341,0.00061217975,0.0018409938,0.0015375223,0.0010567628],"domain_scores_gemma":[0.9962356,0.0006899589,0.0006151683,0.0018762109,0.00035609998,0.00022695337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009777768,0.00073719345,0.00072412076,0.0011203472,0.00034866823,0.0009246892,0.004065661,0.00039958957,0.000045057524],"category_scores_gemma":[0.00028057717,0.0006345338,0.00012181963,0.0011007278,0.001072986,0.0008128109,0.0014100734,0.001980544,0.00017949195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008055686,0.0000064367814,0.00015859546,0.000041800788,0.000017911509,0.00008291264,0.00047927277,0.84006155,0.0000574368,0.063093424,0.000007902089,0.095984735],"study_design_scores_gemma":[0.0005305195,0.0005839366,0.00010394125,0.00072671677,0.000010092204,0.00020273251,2.783664e-7,0.9778859,0.00021397593,0.011828969,0.00695263,0.00096028333],"about_ca_topic_score_codex":0.000030758332,"about_ca_topic_score_gemma":0.000015717518,"teacher_disagreement_score":0.16920638,"about_ca_system_score_codex":0.000528103,"about_ca_system_score_gemma":0.0027581628,"threshold_uncertainty_score":0.9996106},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001010936,0.00019834917,0.99401134,0.00040173862,0.001476439,0.0015425035,0.000001948471,0.00008081681,0.001275928],"genre_scores_gemma":[0.08703452,0.00009197114,0.9100425,0.0013011306,0.000301706,0.00004851263,0.00008309201,0.000082911334,0.0010136086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977915,0.00007783493,0.0004095396,0.00089303486,0.0004260032,0.0004020348],"domain_scores_gemma":[0.99830836,0.000869043,0.0001424521,0.00043012894,0.0001483321,0.00010165755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008558639,0.00036194752,0.00051264884,0.00094293884,0.000124459,0.00010663077,0.0002956756,0.00024136633,0.000106511405],"category_scores_gemma":[0.00018758336,0.00034092658,0.00014770048,0.00031890435,0.00015363574,0.00010839452,0.00014148735,0.00053007103,0.000018310468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005552785,0.000039741353,0.00008240275,0.0002624615,0.000018095345,0.000039658986,0.00032481563,0.027774528,0.009787761,0.0000673762,0.0000063201137,0.96104157],"study_design_scores_gemma":[0.005659995,0.0014099581,0.00037652403,0.00060406735,0.000083387386,0.000029432254,0.000007201904,0.9554316,0.031985994,0.00090107525,0.0029687928,0.00054199755],"about_ca_topic_score_codex":0.000028413915,"about_ca_topic_score_gemma":0.000080680235,"teacher_disagreement_score":0.9604996,"about_ca_system_score_codex":0.0005221317,"about_ca_system_score_gemma":0.0002642045,"threshold_uncertainty_score":0.9999043},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024558469,0.00047819753,0.9961561,0.00050639175,0.00082926,0.0011099442,0.00008780324,0.00015729765,0.00065047946],"genre_scores_gemma":[0.019458348,0.00002705581,0.9793772,0.0006466154,0.00014537621,0.000013486143,0.00024063261,0.00001687564,0.000074407304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975094,0.000022352395,0.00058000884,0.0008889231,0.00066778046,0.00033151903],"domain_scores_gemma":[0.9965665,0.00034491497,0.00059280323,0.0019246934,0.0005095894,0.000061530525],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010468591,0.0003241912,0.00044348912,0.00068464765,0.00014527918,0.0009615904,0.008398781,0.00030647166,0.000011806687],"category_scores_gemma":[0.000118408745,0.0002911108,0.00006788074,0.0003144892,0.0002134,0.0070758285,0.003693284,0.0003933909,0.000019967507],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023386792,0.000020158912,0.000011489699,0.00021443256,0.000009919755,0.0000029229384,0.00039787954,0.0018957201,0.00077974814,0.059488326,0.00014145259,0.9370146],"study_design_scores_gemma":[0.00031148462,0.00021346328,0.000034277848,0.000699936,0.000012941366,0.00003382927,3.301646e-7,0.7421211,0.007348722,0.24688013,0.0018565825,0.0004872257],"about_ca_topic_score_codex":0.000054942277,"about_ca_topic_score_gemma":0.000027415239,"teacher_disagreement_score":0.9365273,"about_ca_system_score_codex":0.0001920741,"about_ca_system_score_gemma":0.0006613866,"threshold_uncertainty_score":0.9999541},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026380983,0.00035871257,0.9955637,0.0003746623,0.00026171134,0.00027794464,4.629137e-7,0.00002857443,0.0004961735],"genre_scores_gemma":[0.9482449,0.00031226594,0.051089823,0.00016206918,0.000045050234,0.00000517563,0.000003317619,0.000010179662,0.00012716769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983864,0.000028629212,0.00030993845,0.0007728077,0.00029147722,0.00021078673],"domain_scores_gemma":[0.9986986,0.0005021299,0.00027214273,0.0004039609,0.00006555544,0.00005762093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039167146,0.00020835744,0.00026179696,0.00030757405,0.000098729935,0.00011614383,0.0005216962,0.0001683998,0.0000026084815],"category_scores_gemma":[0.00003793535,0.00017809903,0.000022770826,0.00034875277,0.0002855883,0.00026177894,0.00035966773,0.0005052247,0.0000031244779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043802816,0.000009553465,0.0004980024,0.000024011733,0.0000011557395,0.0000022999593,0.00012762162,0.20278338,0.00014456853,0.053613834,0.00000640943,0.7427848],"study_design_scores_gemma":[0.00011679133,0.00009465985,0.002011764,0.0004949075,0.0000017346541,0.000007662001,1.0420201e-7,0.96260273,0.00009528208,0.034320388,0.00008536186,0.00016860885],"about_ca_topic_score_codex":0.0000066610114,"about_ca_topic_score_gemma":0.000011146199,"teacher_disagreement_score":0.9456068,"about_ca_system_score_codex":0.00005090817,"about_ca_system_score_gemma":0.00008783218,"threshold_uncertainty_score":0.72626674},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024225787,0.0015071825,0.9953556,0.00023878261,0.0018232232,0.00043926592,0.000009501818,0.0004539266,0.00014828326],"genre_scores_gemma":[0.11872509,0.000019504605,0.88081557,0.0001988771,0.00016927303,0.000008025205,0.0000038936687,0.00004200664,0.000017754057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959032,0.00008959207,0.00073761586,0.0015043607,0.0011669947,0.00059821544],"domain_scores_gemma":[0.99453574,0.0030305656,0.0004766152,0.0015203615,0.000243988,0.0001926971],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009292475,0.0006213366,0.0009966639,0.0014155281,0.00010972323,0.0002113712,0.003899322,0.00034274868,0.0000017011118],"category_scores_gemma":[0.00045010768,0.0005763924,0.00019023406,0.0014104391,0.00057151687,0.00026577164,0.0009570565,0.0011711895,0.000008632885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056231916,0.000010458743,0.0000045901743,0.00015780632,0.000009547691,0.000044664255,0.0001332248,0.9227684,0.0001223791,0.006573442,0.0000012563819,0.07016861],"study_design_scores_gemma":[0.00017966553,0.00014594653,0.00000458815,0.00044573707,0.0000075260773,0.00002224947,8.804405e-8,0.91475236,0.0018332676,0.08192357,0.00016920155,0.00051582186],"about_ca_topic_score_codex":0.000016593582,"about_ca_topic_score_gemma":0.0000014035777,"teacher_disagreement_score":0.11870086,"about_ca_system_score_codex":0.00023273153,"about_ca_system_score_gemma":0.0004314066,"threshold_uncertainty_score":0.9996688},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024649707,0.00072857266,0.96390295,0.00075736624,0.00896489,0.000838263,0.0000028163088,0.00027846664,0.024502005],"genre_scores_gemma":[0.7238113,0.00038540232,0.2473166,0.005092043,0.012653282,0.000115180585,0.00005815216,0.0002475844,0.010320446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534583,0.00008195234,0.0008171582,0.0020953438,0.00078210596,0.00087763276],"domain_scores_gemma":[0.9964947,0.0004895807,0.00053540146,0.002004548,0.0003121671,0.00016359311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013950784,0.00064813806,0.0007222148,0.0007005731,0.0003598053,0.00084304117,0.0028904884,0.00056868297,0.00007932857],"category_scores_gemma":[0.000025508698,0.00059901405,0.0002499619,0.0007959919,0.00028709506,0.0005945795,0.00051010563,0.0013415866,0.00039379988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010507643,0.000014770346,0.000025081672,0.000038124737,0.000016476766,0.000012533975,0.0003733593,0.2825541,0.00015416484,0.06870253,0.0005514431,0.64754695],"study_design_scores_gemma":[0.00033328225,0.0002801601,0.000048012087,0.0008091078,0.0000074903237,0.0002659043,5.0769444e-7,0.67716175,0.00053282833,0.2171211,0.10235701,0.0010828435],"about_ca_topic_score_codex":0.000035630004,"about_ca_topic_score_gemma":0.00017298067,"teacher_disagreement_score":0.72378665,"about_ca_system_score_codex":0.0005306476,"about_ca_system_score_gemma":0.00034248538,"threshold_uncertainty_score":0.9996461},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025591664,0.00006921202,0.99330133,0.00019432232,0.00088231754,0.0021845067,0.000019899397,0.0002350615,0.0005541844],"genre_scores_gemma":[0.95943385,0.000005815445,0.039007466,0.00047599667,0.00010423539,0.00025392245,0.000034050172,0.00004451708,0.00064015074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575406,0.00005542579,0.0006471169,0.001817767,0.0011691074,0.0005565416],"domain_scores_gemma":[0.9965189,0.00020926306,0.00047645508,0.0022640757,0.00036162726,0.0001696934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000794615,0.00051459245,0.0004761547,0.0007943974,0.0002234517,0.00060973596,0.0029775798,0.0003600624,0.000014066468],"category_scores_gemma":[0.000023705783,0.0005036403,0.00016432011,0.0004770264,0.00025977963,0.00075370097,0.00059321447,0.0006159006,0.00013826409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037883194,0.0009522784,0.0037698203,0.0005829324,0.00007602354,0.000037642276,0.04945833,0.096237734,0.0051299105,0.1186751,0.000029265517,0.7250131],"study_design_scores_gemma":[0.000251157,0.00009879891,0.00047009232,0.00018078412,0.000020840633,0.000009613373,8.278985e-7,0.98808366,0.0013789515,0.0085628955,0.00039645436,0.00054592104],"about_ca_topic_score_codex":0.00003085047,"about_ca_topic_score_gemma":0.00006324307,"teacher_disagreement_score":0.95687467,"about_ca_system_score_codex":0.00044348303,"about_ca_system_score_gemma":0.00078370044,"threshold_uncertainty_score":0.9997415},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033653853,0.00030777723,0.99292743,0.0012067489,0.0026474644,0.0012633239,0.000012942803,0.00027100844,0.0010267814],"genre_scores_gemma":[0.3464079,0.000011844164,0.6517904,0.0012003947,0.00029654312,0.000024083538,0.0000048454867,0.000048996313,0.00021501584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938887,0.000033428438,0.0008549813,0.00259542,0.0014044258,0.0012230396],"domain_scores_gemma":[0.9961564,0.00095179357,0.00035949136,0.0018578831,0.00043513055,0.00023932611],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001485889,0.00076745026,0.0007574137,0.0009037703,0.00039169783,0.0005240138,0.0040390487,0.00038522235,0.000008200811],"category_scores_gemma":[0.0000695787,0.0007267723,0.0003488856,0.00056138495,0.0004198833,0.00036708193,0.0004177242,0.0008453734,0.000031495663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008125256,0.000023963881,0.000018748839,0.000119902135,0.0000061865453,0.000016682905,0.0004322483,0.89406896,0.00029321117,0.011722866,0.000002442006,0.09328667],"study_design_scores_gemma":[0.00045609943,0.00014515055,0.0000021816084,0.00083536794,0.000011637292,0.00002461191,5.3804837e-7,0.9765698,0.0025037401,0.018212572,0.0004356342,0.0008027257],"about_ca_topic_score_codex":0.000031309904,"about_ca_topic_score_gemma":0.000019749097,"teacher_disagreement_score":0.34607136,"about_ca_system_score_codex":0.0004882913,"about_ca_system_score_gemma":0.0012908618,"threshold_uncertainty_score":0.99951833},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036525316,0.00018062544,0.9827024,0.00009793566,0.002283817,0.00018488533,0.000015006588,0.0002399394,0.013930177],"genre_scores_gemma":[0.96045697,0.00018410396,0.03280968,0.001627669,0.0010175921,0.000008102493,0.0000823822,0.00013931602,0.0036741907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986672,0.000005370968,0.00024044565,0.00041459448,0.00040170504,0.00027071408],"domain_scores_gemma":[0.9992739,0.00010216797,0.00004434512,0.00043654442,0.000078221776,0.000064833934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020552668,0.00025863785,0.0002151989,0.00029901843,0.000060275615,0.000117483185,0.0004320923,0.00026285724,0.000084315754],"category_scores_gemma":[0.000012383741,0.0002506143,0.000060200295,0.00016761666,0.0001713874,0.00014743977,0.00009614371,0.00049256254,0.00010784635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011503191,0.000002348409,0.000025670484,0.000026274398,0.0000062005597,0.0000021878013,0.000082041006,0.9399581,0.00008570655,0.003616469,0.000036798698,0.05615707],"study_design_scores_gemma":[0.000119969955,0.000027771008,0.00019355086,0.000118027965,0.0000059257886,0.000009111242,1.3404195e-7,0.9721917,0.00008099139,0.025221076,0.0017800017,0.0002517212],"about_ca_topic_score_codex":0.0000041168073,"about_ca_topic_score_gemma":0.00006995722,"teacher_disagreement_score":0.9600917,"about_ca_system_score_codex":0.00035535882,"about_ca_system_score_gemma":0.0001526762,"threshold_uncertainty_score":0.99999464},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00787593,0.00013499965,0.9829982,0.00072588463,0.0061344327,0.0009543963,0.0000029920598,0.0010212115,0.00015198968],"genre_scores_gemma":[0.39555982,0.0000131669685,0.6037481,0.0004632911,0.00016365561,0.00003168965,0.0000059557246,0.000012890516,0.0000014294575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529696,0.00036389875,0.0005755641,0.00197039,0.0010649763,0.00072820415],"domain_scores_gemma":[0.99616235,0.00025475444,0.00036600372,0.0026594393,0.0004142659,0.00014319895],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001984137,0.00047076104,0.00050223526,0.0007252328,0.00022608912,0.0010269558,0.005569419,0.00037298683,0.000004512304],"category_scores_gemma":[0.00017709841,0.00035532002,0.00011487149,0.0022160246,0.00031146657,0.000972232,0.004590619,0.0012464826,0.000072411916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011555974,0.00024138251,0.0014124218,0.00024222831,0.000016438873,0.0000202485,0.0031455746,0.4061131,0.0027158062,0.0014736933,0.000029101768,0.58457845],"study_design_scores_gemma":[0.00017927724,0.000086018445,0.004762078,0.00025381774,0.0000051445572,0.000032789947,1.05260604e-7,0.9652125,0.018623298,0.010232706,0.00009703354,0.0005151836],"about_ca_topic_score_codex":0.00007726265,"about_ca_topic_score_gemma":0.000007440854,"teacher_disagreement_score":0.5840633,"about_ca_system_score_codex":0.00062050833,"about_ca_system_score_gemma":0.00083800976,"threshold_uncertainty_score":0.99988985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058534063,0.000080465274,0.93747973,0.000058134603,0.0007007373,0.0025122215,0.000010243485,0.000052343177,0.00057206507],"genre_scores_gemma":[0.977744,0.000002974589,0.021822881,0.0001301963,0.00014086899,0.00004077072,0.0000019669753,0.00004412325,0.00007225483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963482,0.00008041328,0.00057183456,0.0012889303,0.0011809856,0.0005296082],"domain_scores_gemma":[0.9970057,0.0013727711,0.0002886456,0.0010143154,0.00022448119,0.00009411356],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008179292,0.00035824094,0.00055198924,0.00091690145,0.00022289745,0.00016194081,0.0015937276,0.00022141363,0.000022524886],"category_scores_gemma":[0.0006499671,0.00031476488,0.00012789297,0.0005648742,0.00071258,0.00027438704,0.00051167945,0.00046157732,0.000019931387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014857204,0.0005550278,0.001211235,0.0006143091,0.000024220815,0.000046258257,0.0025767998,0.043224003,0.035992548,0.0034066937,0.0000031316742,0.9121972],"study_design_scores_gemma":[0.0005437435,0.001031145,0.0009720197,0.00032434773,0.000026833892,0.00001962169,0.0000036383144,0.965518,0.022436818,0.008756825,0.000020085523,0.0003468993],"about_ca_topic_score_codex":0.000011250071,"about_ca_topic_score_gemma":0.000014386183,"teacher_disagreement_score":0.922294,"about_ca_system_score_codex":0.000257356,"about_ca_system_score_gemma":0.00048511222,"threshold_uncertainty_score":0.99993044},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024675115,0.00058304786,0.9943689,0.00015702199,0.0018279691,0.0004421385,0.000010219741,0.00005576314,0.0000874179],"genre_scores_gemma":[0.6998242,0.000048786285,0.29888675,0.000466225,0.0006569335,0.0000019206996,0.000009822527,0.000030092115,0.000075266464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969368,0.00008108839,0.0006299002,0.0012042909,0.0006394383,0.00050847256],"domain_scores_gemma":[0.9977862,0.0002759273,0.00054991676,0.0010046831,0.00026949908,0.00011374695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052523636,0.00051602063,0.00070355745,0.00051232404,0.00015888302,0.00047503415,0.0012972653,0.0002923943,0.000051821346],"category_scores_gemma":[0.000056533903,0.00044972732,0.00012005078,0.00039632263,0.0004740194,0.0008716675,0.00090018415,0.0004754386,0.000004321785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051517027,0.000020679547,0.00010421941,0.00006755007,0.00004758906,0.00001681655,0.0004847023,0.5075692,0.0154107055,0.0018395887,0.000033308075,0.4744005],"study_design_scores_gemma":[0.00022044935,0.00008988901,0.00031196457,0.00027428393,0.00002221717,0.000029861978,8.830554e-8,0.9860643,0.008748175,0.0037153228,0.000079480895,0.00044393662],"about_ca_topic_score_codex":0.000023958073,"about_ca_topic_score_gemma":0.000019769148,"teacher_disagreement_score":0.6973567,"about_ca_system_score_codex":0.00015680514,"about_ca_system_score_gemma":0.00029684303,"threshold_uncertainty_score":0.99979544},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008987351,0.000041573,0.9852501,0.00018679014,0.00058208103,0.0004988092,0.000022482078,0.000034561148,0.013293695],"genre_scores_gemma":[0.6368219,0.000012211692,0.35338295,0.00020913935,0.00273443,0.000027542661,0.0011062048,0.00007252496,0.0056331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981044,0.00001604989,0.00024521482,0.001068658,0.00026477902,0.00030090308],"domain_scores_gemma":[0.99864846,0.00012202268,0.00020038674,0.00086629024,0.000096783115,0.000066041386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003557974,0.0002530512,0.00027099924,0.00015503884,0.00016679756,0.00020538631,0.0010663376,0.00011638812,0.00006140058],"category_scores_gemma":[0.000011466233,0.00022899795,0.00007711392,0.00012102622,0.0001984513,0.00028368973,0.00037371446,0.00059808575,0.000015022012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018968296,0.00004023027,0.00007374074,0.000044762386,0.000021648339,6.17551e-7,0.00015268178,0.093577884,0.0015494261,0.014508341,0.0002523949,0.8897593],"study_design_scores_gemma":[0.00017207074,0.000036244674,0.000019978877,0.000057164943,0.000011360586,0.0000022449387,6.4190374e-7,0.9866297,0.00017047318,0.009157244,0.0034769985,0.00026587534],"about_ca_topic_score_codex":0.000007312864,"about_ca_topic_score_gemma":8.950664e-7,"teacher_disagreement_score":0.8930518,"about_ca_system_score_codex":0.000045454333,"about_ca_system_score_gemma":0.0002150126,"threshold_uncertainty_score":0.9338265},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031172913,0.00048310956,0.99204135,0.001079728,0.003628214,0.0018751215,0.0000074067866,0.00022077345,0.00063311873],"genre_scores_gemma":[0.2399727,0.000088357025,0.7533047,0.0031519597,0.0022317807,0.00020154673,0.00006271525,0.00014007668,0.00084616337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957894,0.000029660601,0.0006160109,0.0019807534,0.00075002376,0.00083415577],"domain_scores_gemma":[0.9964,0.0008113285,0.00045832602,0.0017969616,0.00035454967,0.00017886041],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059495907,0.00056956004,0.0005146674,0.00046242782,0.00034077876,0.00036968818,0.0031873882,0.0002840873,0.00000856538],"category_scores_gemma":[0.000060787264,0.0005302198,0.00019078964,0.00073038944,0.00039001455,0.00038583323,0.0010912882,0.00077954,0.000038378366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004607481,0.000012736672,0.0000012212079,0.000012769373,0.000002320508,0.0000022101772,0.00004712451,0.54545045,0.000013819124,0.009936537,0.0000271997,0.44448903],"study_design_scores_gemma":[0.00026098138,0.00020356984,0.000021800683,0.00012841441,0.0000075172147,0.000023765173,5.5490144e-8,0.96290445,0.00031240756,0.03419693,0.0013809865,0.00055913],"about_ca_topic_score_codex":0.0000017105228,"about_ca_topic_score_gemma":0.000016616526,"teacher_disagreement_score":0.44392988,"about_ca_system_score_codex":0.00038170157,"about_ca_system_score_gemma":0.0002827975,"threshold_uncertainty_score":0.9997149},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048670406,0.00033853212,0.9940907,0.0011436978,0.0021543268,0.0012279566,0.000009421685,0.00030692565,0.0002417692],"genre_scores_gemma":[0.5031593,0.0000254317,0.49493617,0.001204687,0.00034117093,0.00003733726,0.00007399124,0.00005417006,0.00016776955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606717,0.000048682297,0.0005662243,0.0019186939,0.0006548935,0.00074432185],"domain_scores_gemma":[0.9968169,0.0004820023,0.00040645894,0.0017713514,0.0003567183,0.00016662458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007298182,0.000582425,0.00051456346,0.00092558016,0.00043233536,0.00061083125,0.0031985901,0.00039702308,0.000009040521],"category_scores_gemma":[0.00007083414,0.00056016824,0.00022328847,0.0009211121,0.00038603254,0.00046967715,0.0007177775,0.0009413975,0.000023531553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032110029,0.00001544621,0.00006948378,0.000016146,0.000008379896,0.0000029386504,0.00007751391,0.68620795,0.00022981981,0.011375175,0.000017384793,0.30197656],"study_design_scores_gemma":[0.00031560045,0.00014088793,0.00048504476,0.000073307245,0.000010805153,0.000023766419,2.7312112e-8,0.9688277,0.00009502723,0.029199187,0.0002475683,0.00058106874],"about_ca_topic_score_codex":0.000081193015,"about_ca_topic_score_gemma":0.00013453381,"teacher_disagreement_score":0.50267255,"about_ca_system_score_codex":0.000216798,"about_ca_system_score_gemma":0.0002802751,"threshold_uncertainty_score":0.999685},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005418303,0.00024115434,0.98752195,0.0012829546,0.002932026,0.002389332,0.000012494193,0.00032432837,0.005290317],"genre_scores_gemma":[0.019240499,0.00007425823,0.9772465,0.0008416881,0.0005754326,0.00016825582,0.00003865074,0.000081867736,0.0017328535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963028,0.00007050612,0.0007170083,0.0016135914,0.00065680075,0.00063929433],"domain_scores_gemma":[0.99651694,0.0009107454,0.00056114915,0.0014902306,0.0004060878,0.00011483586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018692586,0.00058302045,0.0009258448,0.000753482,0.00024318486,0.001008227,0.0023846477,0.0003490085,0.000009574415],"category_scores_gemma":[0.000044641474,0.0004456157,0.00015726428,0.0003654184,0.0001982966,0.00080313993,0.0005495447,0.00050677324,0.000016489446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023910793,0.0000753013,0.00004366787,0.00051503093,0.00010317211,0.000041161147,0.00090681465,0.055072743,0.00007321386,0.09720192,0.0015827953,0.84414506],"study_design_scores_gemma":[0.0026655935,0.0007691457,0.000007204361,0.0012273182,0.000018844637,0.00014042464,4.8207613e-7,0.92148954,0.0006040404,0.03063058,0.041377265,0.001069574],"about_ca_topic_score_codex":0.000062787454,"about_ca_topic_score_gemma":0.000033115775,"teacher_disagreement_score":0.8664168,"about_ca_system_score_codex":0.0003461694,"about_ca_system_score_gemma":0.0005883465,"threshold_uncertainty_score":0.99979955},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064201667,0.0015143928,0.9727509,0.0021724815,0.0014861274,0.0005429683,0.000027077576,0.000012161974,0.015073722],"genre_scores_gemma":[0.9728212,0.00015737776,0.016012566,0.007333683,0.0008721898,0.0000039709553,0.000054180306,0.00004465459,0.0027002036],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987748,0.000018689048,0.00026841016,0.00046185008,0.00019315329,0.00028308004],"domain_scores_gemma":[0.99874634,0.00015363227,0.00020432974,0.00079103064,0.00006447316,0.000040197654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004968856,0.0002491786,0.00024982635,0.00013491702,0.00007618571,0.00004760567,0.00089892774,0.00035427342,0.00002487983],"category_scores_gemma":[0.000046480156,0.00017089375,0.000113771115,0.00008744998,0.00032201989,0.0000032036696,0.00042573197,0.0004134772,0.000014454057],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001767661,0.0000733144,0.0003340856,0.00019425953,0.0002453919,0.000042711825,0.00058685016,0.16405872,0.073270194,0.10512187,0.007631468,0.64826435],"study_design_scores_gemma":[0.003739301,0.0076722824,0.0035011764,0.0029890302,0.0002216146,0.00081325613,0.000007658916,0.22098051,0.27080294,0.3174367,0.16472585,0.0071096644],"about_ca_topic_score_codex":0.0000059767117,"about_ca_topic_score_gemma":0.000030468493,"teacher_disagreement_score":0.966401,"about_ca_system_score_codex":0.000024430123,"about_ca_system_score_gemma":0.00016836711,"threshold_uncertainty_score":0.69688445},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056769015,0.00012563492,0.98751074,0.001058394,0.0006979865,0.0006535532,0.000004687982,0.0004190346,0.009473172],"genre_scores_gemma":[0.22368969,0.00013278573,0.7725304,0.001287918,0.00041094638,0.00004740806,0.000014597116,0.000051868676,0.0018343801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695766,0.000022768994,0.00049375504,0.0014475187,0.00064582494,0.00043244837],"domain_scores_gemma":[0.9968641,0.00034833205,0.00044419317,0.0019466506,0.0002725029,0.00012422235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043518853,0.0004078605,0.00036879478,0.00058792945,0.00029501825,0.0006075135,0.0031213914,0.00032174503,0.000026515216],"category_scores_gemma":[0.000052469546,0.00036713944,0.00013368759,0.0005183233,0.0004278266,0.00091585924,0.0011546472,0.00071494887,0.0002011118],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026431733,0.000027246704,0.000009625947,0.00002772838,0.000004100457,0.0000047756457,0.000118217904,0.00037825762,0.016779367,0.06387158,0.000110874644,0.9186656],"study_design_scores_gemma":[0.00021570419,0.00017743223,0.0006685608,0.00027543283,0.000008039424,0.000044391454,2.2275e-7,0.79222995,0.02081404,0.1666563,0.018060643,0.00084929704],"about_ca_topic_score_codex":0.00001473898,"about_ca_topic_score_gemma":0.000007588222,"teacher_disagreement_score":0.9178163,"about_ca_system_score_codex":0.0002448239,"about_ca_system_score_gemma":0.00042853333,"threshold_uncertainty_score":0.99987805},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013220635,0.00092904776,0.9840684,0.0004265097,0.0006629475,0.00023846427,0.0000011902126,0.00012708985,0.00032569363],"genre_scores_gemma":[0.65648973,0.00018659615,0.3428431,0.00009038701,0.000175074,0.0000013643165,0.000008713578,0.000021531769,0.00018348215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975444,0.000076672804,0.00030104557,0.0012567001,0.00048048695,0.00034067064],"domain_scores_gemma":[0.9986466,0.00019179565,0.00034227502,0.00060581794,0.00011648671,0.00009699703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008887185,0.0003278247,0.0003370561,0.0004987664,0.00047735288,0.00071674364,0.000662076,0.00021839429,0.0000029000341],"category_scores_gemma":[0.000058390873,0.0003328733,0.0000368308,0.00034010987,0.00031678003,0.0009773552,0.0006619473,0.0008665863,0.000005899215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020928619,0.000018370863,0.0029787107,0.00015987994,0.000012316347,0.000014931643,0.0017747036,0.09942708,0.008886719,0.026527891,0.0000030582821,0.86017543],"study_design_scores_gemma":[0.00026333856,0.00009166107,0.0020829316,0.000459473,0.000011136027,0.00024931005,8.136393e-7,0.98555523,0.00046356927,0.00993568,0.0004255881,0.00046127252],"about_ca_topic_score_codex":0.000053301617,"about_ca_topic_score_gemma":0.000015982958,"teacher_disagreement_score":0.8861281,"about_ca_system_score_codex":0.00018788087,"about_ca_system_score_gemma":0.00018232675,"threshold_uncertainty_score":0.9999123},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085386,0.00021023302,0.99169034,0.0027930234,0.0017171066,0.00084325456,0.00008397958,0.00010774894,0.0017004478],"genre_scores_gemma":[0.9426202,0.000028842018,0.044428445,0.01012211,0.00050296384,0.000019174198,0.000013610639,0.000069956805,0.002194674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598575,0.00006773973,0.0003983253,0.0020459765,0.00088300894,0.0006191982],"domain_scores_gemma":[0.9835052,0.0150951035,0.00032230065,0.0007052975,0.00028200037,0.00009008108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009935485,0.00049572234,0.00072591123,0.0010705547,0.0004564233,0.0001712154,0.0009078933,0.0002581616,0.000022668979],"category_scores_gemma":[0.00327865,0.00047550682,0.0003883939,0.001367718,0.00097367645,0.00033428503,0.00046787295,0.0005523828,0.000038809154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012260924,0.000044578494,0.0002790259,0.00006076567,0.00016434735,0.000019289559,0.0005316996,0.9242427,0.007377909,0.038556,0.00025491885,0.028346192],"study_design_scores_gemma":[0.0005910622,0.0005124887,0.00045003524,0.00018731707,0.00018742621,0.000019552406,0.0000011562663,0.8119362,0.011306396,0.17161182,0.002102342,0.0010942077],"about_ca_topic_score_codex":0.000034147328,"about_ca_topic_score_gemma":0.00022829794,"teacher_disagreement_score":0.9472619,"about_ca_system_score_codex":0.00039469046,"about_ca_system_score_gemma":0.00039556462,"threshold_uncertainty_score":0.9997697},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021654852,0.0012502763,0.9811714,0.000352648,0.003950603,0.00060182286,0.000009035269,0.00031509093,0.012132576],"genre_scores_gemma":[0.464257,0.00018406971,0.5255155,0.0022565706,0.0010605047,0.000029457613,0.000031004372,0.00012742268,0.0065385057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949139,0.000050436553,0.000576073,0.002158277,0.001202081,0.0010992786],"domain_scores_gemma":[0.9968208,0.00052270916,0.00037134715,0.0017697902,0.0002754811,0.00023988559],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009973312,0.0007886579,0.0007605716,0.0008061943,0.00028862178,0.0011601794,0.004634196,0.0005294922,0.00006247604],"category_scores_gemma":[0.00013794802,0.00065829296,0.00026919678,0.0007927547,0.000692363,0.0009420543,0.0017179934,0.0010997684,0.00021288937],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005935572,0.00004235372,0.00016466893,0.00008562445,0.00002114337,0.00011378358,0.0022121735,0.00617827,0.000035278343,0.021796867,0.000043741366,0.96930015],"study_design_scores_gemma":[0.00058169453,0.00046819533,0.00082665595,0.00063464267,0.00002230495,0.00011151618,6.457702e-7,0.87905365,0.00028600008,0.08444336,0.031897947,0.0016733976],"about_ca_topic_score_codex":0.000032758282,"about_ca_topic_score_gemma":0.00019825595,"teacher_disagreement_score":0.96762675,"about_ca_system_score_codex":0.00037476886,"about_ca_system_score_gemma":0.0011351206,"threshold_uncertainty_score":0.99987674},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026441546,0.0003120445,0.9557235,0.002378362,0.0034013968,0.00041319843,0.000054412267,0.000070268194,0.037382398],"genre_scores_gemma":[0.5168906,0.00023449825,0.26139972,0.040489156,0.003808636,0.000026302561,0.000115371484,0.00021869285,0.17681703],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925148,0.000066847904,0.0008283183,0.0020640832,0.0038870561,0.00063888065],"domain_scores_gemma":[0.9955687,0.0018217647,0.00046857912,0.001611205,0.0003542227,0.00017551625],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.005286808,0.0004781779,0.000705975,0.0011902364,0.00025164097,0.0014193704,0.004439349,0.0002810566,0.00104634],"category_scores_gemma":[0.0010220683,0.00036850956,0.000230239,0.0006717867,0.0011080182,0.00077751745,0.0023251956,0.00073586276,0.0019104971],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013966231,0.00002476852,0.000117277086,0.000026997435,0.000014912284,0.00005090774,0.0016593648,0.0032410026,0.000019741985,0.032672815,0.0027687256,0.9593895],"study_design_scores_gemma":[0.00039172862,0.000229544,0.00037449616,0.00038647722,0.000019318966,0.000041178748,0.0000077346,0.13932736,0.00012812074,0.5166838,0.34130517,0.001105081],"about_ca_topic_score_codex":0.00002951597,"about_ca_topic_score_gemma":0.0001153187,"teacher_disagreement_score":0.95828444,"about_ca_system_score_codex":0.00022540608,"about_ca_system_score_gemma":0.00050370157,"threshold_uncertainty_score":0.9998767},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036122783,0.00027370435,0.9952803,0.00027883498,0.0010314177,0.00046200526,0.000036483245,0.000282933,0.002318185],"genre_scores_gemma":[0.11584182,0.00012744643,0.8826236,0.00033239266,0.00015243236,0.0000052578557,0.000086034976,0.00004628283,0.0007847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950128,0.00006496112,0.000869544,0.0022853545,0.0011029221,0.00066442083],"domain_scores_gemma":[0.9931595,0.0006157711,0.00089639146,0.0048548835,0.00035177628,0.00012169261],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001652821,0.0005296677,0.000746017,0.0009723239,0.00017425924,0.00036283417,0.009906715,0.00040240705,0.000020077498],"category_scores_gemma":[0.00041117662,0.0005152582,0.00009330527,0.00079688977,0.0005869146,0.0013517835,0.0050806818,0.0011935387,0.00009043968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007782583,0.00006231942,0.00030299937,0.00013152914,0.000023819917,0.000028884944,0.0004992628,0.018636717,0.017875254,0.017858418,0.000112993264,0.94446003],"study_design_scores_gemma":[0.00028446355,0.00011245427,0.00018909543,0.000525291,0.000007134399,0.000023600884,2.767332e-7,0.9703043,0.014356524,0.006351488,0.007237617,0.0006077606],"about_ca_topic_score_codex":0.000018958928,"about_ca_topic_score_gemma":0.000023026458,"teacher_disagreement_score":0.9516676,"about_ca_system_score_codex":0.0002478741,"about_ca_system_score_gemma":0.00081960973,"threshold_uncertainty_score":0.9997299},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013493653,0.00019191683,0.99638355,0.0007398718,0.000931591,0.00043011515,0.00009594641,0.00014236917,0.0010711577],"genre_scores_gemma":[0.046849728,0.000029960951,0.9506919,0.00076493295,0.00039328152,0.000007958635,0.0006691398,0.000027907148,0.00056520326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593216,0.00003766958,0.00047828734,0.0022363444,0.0007971495,0.0005183741],"domain_scores_gemma":[0.993223,0.0014766793,0.0003867704,0.0046158414,0.00018990882,0.000107774256],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019263974,0.0003755969,0.0005574711,0.0011179275,0.0002568171,0.00075681123,0.0076203668,0.00022255848,0.000020431944],"category_scores_gemma":[0.00049511966,0.00034148264,0.00014992755,0.0010156679,0.00021596348,0.0008001168,0.0028122424,0.0005501896,0.00003427086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000078353605,0.00002167708,0.0016703716,0.000072775256,0.0000916521,0.0000047248695,0.00027216983,0.068983145,0.000029044857,0.062481232,0.000040187602,0.8663252],"study_design_scores_gemma":[0.00018652357,0.000057321104,0.00077107374,0.000071498565,0.000058688136,0.0000047702833,4.4375525e-8,0.95276225,0.00002473606,0.024661701,0.021000126,0.00040126994],"about_ca_topic_score_codex":0.000090102454,"about_ca_topic_score_gemma":0.0002542161,"teacher_disagreement_score":0.8837791,"about_ca_system_score_codex":0.00014370438,"about_ca_system_score_gemma":0.00057954236,"threshold_uncertainty_score":0.99990374},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21675159,0.028814528,0.7403469,0.0010336911,0.0029871676,0.0010266047,0.000023141492,0.00013747522,0.008878912],"genre_scores_gemma":[0.9808752,0.00012654069,0.017358826,0.0006788231,0.00052211515,0.000007625647,0.000015415691,0.000026251528,0.0003892226],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979174,0.000019830157,0.00033322675,0.00090752577,0.00038131676,0.00044071386],"domain_scores_gemma":[0.99930626,0.000053913784,0.00010619278,0.00040152593,0.000050892893,0.00008119331],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003107356,0.00031863176,0.00034968028,0.00020030008,0.00006498544,0.00008496948,0.00070713053,0.00049658,0.000011619651],"category_scores_gemma":[0.00017106421,0.0002715727,0.00008791756,0.00012154645,0.0006221085,0.0000062643244,0.0005342829,0.00039554306,0.000009586332],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010174813,0.00019208793,0.0028801328,0.00031970494,0.000044207907,0.0001380541,0.0015715912,0.0034399712,0.09370576,0.0008422463,0.00019363589,0.89657086],"study_design_scores_gemma":[0.0064216303,0.006927207,0.018634664,0.009944898,0.0000755046,0.00086657377,0.00008757185,0.09517684,0.79276717,0.025302347,0.035257332,0.008538258],"about_ca_topic_score_codex":0.000016609298,"about_ca_topic_score_gemma":0.00007220364,"teacher_disagreement_score":0.8880326,"about_ca_system_score_codex":0.00008278219,"about_ca_system_score_gemma":0.0004949421,"threshold_uncertainty_score":0.99997365},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60471374,0.004670895,0.36743343,0.0034975451,0.009670773,0.0018839774,0.0000897154,0.0004704191,0.007569517],"genre_scores_gemma":[0.8930753,0.00006963693,0.1001188,0.002116341,0.003978675,0.000006319514,0.00008688953,0.000010568382,0.0005374691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974717,0.00003574894,0.000402494,0.0010198118,0.0005252607,0.0005449715],"domain_scores_gemma":[0.99852145,0.0009151972,0.00022678955,0.00014688825,0.00009338343,0.00009632076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034675887,0.00044064192,0.0005156608,0.00009717945,0.0002427658,0.00031414285,0.00089719956,0.0003475002,0.00027318796],"category_scores_gemma":[0.0001440007,0.0001887665,0.00013907449,0.00046812886,0.00021938061,0.00039648724,0.0004784625,0.0009019569,0.000052494564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024981222,0.00006236026,0.011180407,0.00003954076,0.000023838962,0.00017502176,0.0007687079,0.062120106,0.13037223,0.00021375723,0.00007682776,0.7949422],"study_design_scores_gemma":[0.0010659718,0.001681996,0.08603275,0.006989886,0.00013269947,0.00020594794,0.000027365986,0.7732421,0.019780738,0.089622825,0.014775543,0.0064421557],"about_ca_topic_score_codex":0.00074080535,"about_ca_topic_score_gemma":0.0012504577,"teacher_disagreement_score":0.7885001,"about_ca_system_score_codex":0.00012858731,"about_ca_system_score_gemma":0.000043578533,"threshold_uncertainty_score":0.76976746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036671004,0.001982058,0.9943453,0.00029079977,0.0017180175,0.00073105504,0.0000021766755,0.00038924324,0.0001746353],"genre_scores_gemma":[0.25883448,0.000029624796,0.73974705,0.0009754935,0.00028805443,0.000011064785,0.0000027387248,0.000041778523,0.00006974228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960402,0.000056360353,0.00060622225,0.0017044629,0.000838497,0.00075423834],"domain_scores_gemma":[0.9976727,0.00020633267,0.00050659874,0.0012925956,0.000205029,0.00011675917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010982113,0.0005814976,0.00061219913,0.0016735133,0.00018095419,0.0007412854,0.0030758642,0.0004894875,0.00000840598],"category_scores_gemma":[0.00008280985,0.00055943173,0.00013011193,0.0010492598,0.0003191407,0.001634555,0.0015284274,0.0010641412,0.000023036384],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019233918,0.00004338054,0.00020397942,0.00024562117,0.000011593091,0.00043317836,0.002996151,0.0033944584,0.0073482785,0.015380355,0.0000038798216,0.9699199],"study_design_scores_gemma":[0.00035464295,0.00013928112,0.00014391399,0.0017294056,0.000009501387,0.00022547826,5.517731e-7,0.5764008,0.012872173,0.40697232,0.00007569593,0.0010762162],"about_ca_topic_score_codex":0.0003690169,"about_ca_topic_score_gemma":0.00050079543,"teacher_disagreement_score":0.9688437,"about_ca_system_score_codex":0.0007703595,"about_ca_system_score_gemma":0.00038768534,"threshold_uncertainty_score":0.9996857},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000116314395,0.00061727833,0.95950985,0.0003374718,0.0032729332,0.0005062732,0.0000011624578,0.00030086288,0.035442557],"genre_scores_gemma":[0.5203886,0.00008930091,0.4308647,0.0054760026,0.0038502142,0.000028959532,0.000025609945,0.00019770362,0.039078914],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573714,0.000038930495,0.0005413242,0.0017515738,0.0011138213,0.0008172155],"domain_scores_gemma":[0.99694264,0.00033764215,0.00033561763,0.0019467034,0.00024795666,0.00018945981],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011023401,0.0005687536,0.00065686455,0.0006559664,0.0002077982,0.00084139017,0.0044390704,0.00043925288,0.000058187597],"category_scores_gemma":[0.000071721566,0.00047625205,0.00018973304,0.0005365452,0.00043899418,0.0005314324,0.0015355166,0.00076613703,0.001972261],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003197945,0.000031755848,0.000076437194,0.000065731656,0.000019311672,0.000114679424,0.00067327864,0.004322195,0.00014093831,0.21444184,0.00016279831,0.7799478],"study_design_scores_gemma":[0.00048088774,0.00048114362,0.00007561352,0.00016928006,0.000014531457,0.00023639025,1.4220947e-7,0.45448452,0.0008459415,0.4693232,0.07223791,0.0016504519],"about_ca_topic_score_codex":0.00003182097,"about_ca_topic_score_gemma":0.000022370481,"teacher_disagreement_score":0.77829736,"about_ca_system_score_codex":0.00023961747,"about_ca_system_score_gemma":0.0007431697,"threshold_uncertainty_score":0.9997689},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28482777,0.00023241079,0.70855075,0.00044515,0.0046790717,0.0011630654,0.000011001138,0.000034262688,0.000056489487],"genre_scores_gemma":[0.7953355,0.000014723911,0.20352204,0.00062895025,0.0003096288,0.00015438956,0.0000146062375,0.000016348346,0.000003846143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709606,0.00019766542,0.0004781986,0.0013256426,0.00034081662,0.0005615907],"domain_scores_gemma":[0.99815243,0.0005711575,0.00035551822,0.0007116051,0.00009460022,0.00011468172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018398769,0.00027632486,0.00033898026,0.00030540503,0.00018737234,0.0002486705,0.00061672897,0.00026619493,0.00004378311],"category_scores_gemma":[0.00006530764,0.00024418294,0.00006610316,0.00020234808,0.00019271334,0.00013994338,0.0014677785,0.0009145463,0.00001319132],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038033464,0.00007539304,0.13019942,0.00032845465,0.000013507784,0.000005014429,0.0012063697,0.0058996803,0.00018943919,0.00009707244,0.000040157473,0.8619075],"study_design_scores_gemma":[0.0021804217,0.0005745898,0.39948425,0.0021953296,0.00004420026,0.000051876967,0.000018252664,0.5453492,0.0010738998,0.048025817,0.00016111633,0.00084109843],"about_ca_topic_score_codex":0.00025978274,"about_ca_topic_score_gemma":0.00005892315,"teacher_disagreement_score":0.86106634,"about_ca_system_score_codex":0.0003865589,"about_ca_system_score_gemma":0.00014212064,"threshold_uncertainty_score":0.99574906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001735787,0.0005177875,0.996659,0.000069900125,0.0003152702,0.00034828307,0.00028026212,0.00000717838,0.0000665242],"genre_scores_gemma":[0.052834596,0.000019205467,0.93563116,0.00084285793,0.00017150103,0.0000037785014,0.010456498,0.00001315804,0.000027269602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986227,0.000023640734,0.00043751928,0.00054668647,0.00015606616,0.00021335176],"domain_scores_gemma":[0.99851966,0.0003045519,0.00032123493,0.00065100036,0.00013577128,0.000067802706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065855344,0.00023147457,0.00029683625,0.0002790991,0.00011508379,0.00015101899,0.00058736914,0.0003411379,0.000007341075],"category_scores_gemma":[0.000060231745,0.00021730378,0.00007365489,0.00013190569,0.00018185024,0.000035771493,0.0005474623,0.00016045087,0.0000020670948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068852205,0.000009750415,0.0004992538,0.00004141638,0.00011825711,4.0089986e-7,0.00016312915,0.8239742,0.010196509,0.000033900793,0.000051164297,0.16484316],"study_design_scores_gemma":[0.00043559415,0.000079925914,0.00081181666,0.000046198027,0.000082408646,0.0000023156065,3.6441912e-7,0.98989135,0.0017654287,0.0019238567,0.0046621254,0.00029862748],"about_ca_topic_score_codex":0.000008512196,"about_ca_topic_score_gemma":0.000030366353,"teacher_disagreement_score":0.16591713,"about_ca_system_score_codex":0.000046222962,"about_ca_system_score_gemma":0.0004043605,"threshold_uncertainty_score":0.8861391},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032113012,0.0005115045,0.98990405,0.000008747846,0.0017706213,0.00024001062,0.000029202507,0.00013209721,0.0070826355],"genre_scores_gemma":[0.989793,0.000017220973,0.009512287,0.00003106151,0.00003263614,0.0000027689657,0.000022967124,0.00003630128,0.00055175653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979187,0.000034203695,0.0005328369,0.0005688404,0.00057912775,0.0003662664],"domain_scores_gemma":[0.99872303,0.00018981769,0.00016264275,0.00064437604,0.0001945786,0.000085543026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080652966,0.0003057481,0.00078270043,0.0009317215,0.00006300906,0.000098152304,0.0005622486,0.00027493917,0.00009602708],"category_scores_gemma":[0.000029473113,0.00028808558,0.00018774804,0.00086094043,0.00013320471,0.0001353956,0.00015656032,0.0004623281,0.000023579854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012194571,0.000007919938,0.0011634819,0.00008318827,0.0000960154,0.000002623716,0.00057742,0.99543625,0.000031091033,0.0001133627,0.0000033487725,0.0024840643],"study_design_scores_gemma":[0.00010769691,0.000032059328,0.0004527011,0.00012699395,0.000060405368,0.000003188966,9.684035e-7,0.9975652,0.00006630153,0.000053432173,0.0012438677,0.00028720207],"about_ca_topic_score_codex":0.000013426564,"about_ca_topic_score_gemma":0.00005952738,"teacher_disagreement_score":0.98947185,"about_ca_system_score_codex":0.00021594249,"about_ca_system_score_gemma":0.0000815356,"threshold_uncertainty_score":0.99995714},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027915027,0.000452815,0.93124026,0.00010212797,0.0063914177,0.00027068064,0.000011108284,0.00009826176,0.058641855],"genre_scores_gemma":[0.9410101,0.00002150434,0.048968535,0.0028097106,0.0018252318,0.000007518717,0.000041985113,0.00007366074,0.00524176],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980704,0.000036037105,0.000271055,0.00094657554,0.00035199837,0.0003239312],"domain_scores_gemma":[0.9986036,0.00044896154,0.00019559913,0.0005831397,0.00009090374,0.00007780045],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029792127,0.00026425245,0.0002673169,0.00035000267,0.0001174274,0.00008796692,0.00053737126,0.0004146047,0.0007451121],"category_scores_gemma":[0.00005206806,0.00023703073,0.00008279928,0.00013200015,0.00018022579,0.000107607266,0.00023120992,0.00072781584,0.0011930004],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013470392,0.000016754064,0.0002916935,0.0000096496915,0.0000110727915,0.000025247906,0.00078709255,0.0005153272,0.0005366401,0.000269474,0.000040142237,0.99748343],"study_design_scores_gemma":[0.008063086,0.0015908254,0.037806462,0.009622918,0.00029776775,0.00064295233,0.000015236132,0.1316581,0.03313739,0.70004433,0.069211885,0.007909061],"about_ca_topic_score_codex":0.00009142588,"about_ca_topic_score_gemma":0.00015366917,"teacher_disagreement_score":0.9895744,"about_ca_system_score_codex":0.00008877387,"about_ca_system_score_gemma":0.00009584929,"threshold_uncertainty_score":0.9995847},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009604262,0.00015337404,0.98744047,0.00009542037,0.00094271183,0.00037220793,0.00002647548,0.000054178516,0.0013109075],"genre_scores_gemma":[0.97744846,7.8685287e-7,0.020069873,0.00017607099,0.0020683706,0.0000051577604,0.00007428606,0.0000261109,0.00013088333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976638,0.0000408009,0.00046747428,0.0007505859,0.00059664034,0.0004807067],"domain_scores_gemma":[0.9991239,0.00015275559,0.00025132022,0.0002949243,0.00012195358,0.000055175842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044676798,0.00033855776,0.00044447745,0.00042947097,0.00024754868,0.00008612588,0.00047601736,0.00014859243,0.00021377557],"category_scores_gemma":[0.0000024998615,0.00034362834,0.00021510232,0.00046236708,0.00034056968,0.00015736876,0.00041000967,0.0006915174,0.00000863875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001174315,0.00003224891,0.012974017,0.0000064620667,0.000027973127,0.000004228242,0.000058743444,0.90923566,0.00005176238,0.035964247,0.00019036305,0.041442536],"study_design_scores_gemma":[0.00015124945,0.000028239621,0.0025354638,0.00013374102,0.000016281792,0.0000030390106,8.0264506e-8,0.7137955,0.000012570349,0.2828826,0.00019041223,0.00025083378],"about_ca_topic_score_codex":0.00008710053,"about_ca_topic_score_gemma":0.00004232991,"teacher_disagreement_score":0.9678442,"about_ca_system_score_codex":0.00025529155,"about_ca_system_score_gemma":0.0003478882,"threshold_uncertainty_score":0.9999016},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44748795,0.000546799,0.54855394,0.00014911017,0.0029102014,0.00024117473,0.0000017860792,0.00010462207,0.0000043938558],"genre_scores_gemma":[0.80495703,0.00006906683,0.1943884,0.00019794115,0.00035274285,0.000013486438,0.0000037264654,0.000017250492,3.5312598e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955643,0.00041031966,0.0005662212,0.0021036526,0.0006745319,0.00068099756],"domain_scores_gemma":[0.99702847,0.0012129515,0.0002998546,0.0012146756,0.00013532265,0.00010875109],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024671007,0.00046969234,0.000607675,0.00095426047,0.00018383864,0.0014370453,0.00176616,0.00042188758,0.0000022497352],"category_scores_gemma":[0.00019309406,0.00046343476,0.00010126319,0.0017128361,0.0002528192,0.0011685592,0.0011922852,0.0014297583,0.000007920367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009638424,0.000043339754,0.014847986,0.000047537942,0.000005761876,0.00002344708,0.0015053498,0.2682348,0.0015133874,0.000010698291,4.4917778e-7,0.71375763],"study_design_scores_gemma":[0.00033619636,0.00007012246,0.20375554,0.00033511245,0.0000043588193,0.000026938074,0.000001926454,0.7798044,0.008358307,0.006806806,0.000014794443,0.0004854975],"about_ca_topic_score_codex":0.0007233185,"about_ca_topic_score_gemma":0.0020595258,"teacher_disagreement_score":0.7132721,"about_ca_system_score_codex":0.00036376208,"about_ca_system_score_gemma":0.00039108866,"threshold_uncertainty_score":0.9997817},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007153107,0.000012789372,0.98843944,0.0012034153,0.0018469036,0.0012270631,0.000040835872,0.00006436628,0.000012056094],"genre_scores_gemma":[0.7673541,7.1217926e-7,0.2316456,0.0007522783,0.00011955982,0.00011175502,0.000010239443,0.0000032538833,0.0000025127713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668765,0.00019714804,0.00077969773,0.00089496933,0.0010651805,0.00037537137],"domain_scores_gemma":[0.9949337,0.0026907837,0.00049965084,0.0011937263,0.0005918402,0.00009030425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073895464,0.00022777525,0.00032206846,0.00044883875,0.0003792085,0.0009505436,0.0020131744,0.0002288365,0.00003681873],"category_scores_gemma":[0.0021691304,0.00018154699,0.00011516818,0.0011722209,0.00032077916,0.000755884,0.0010148874,0.00044359232,0.0001539435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011236354,0.000014107357,0.000025398234,0.000010456464,0.0000019143338,6.2326066e-8,0.00078075967,0.8015767,0.00008237337,0.0033851876,0.000017545344,0.19409432],"study_design_scores_gemma":[0.000085686384,0.00002476164,0.000059109283,0.000018447863,0.0000021626313,0.0000018629837,0.0000063037055,0.52772146,0.008144285,0.46370256,0.000109095075,0.00012425885],"about_ca_topic_score_codex":0.000015713551,"about_ca_topic_score_gemma":0.000006238194,"teacher_disagreement_score":0.760201,"about_ca_system_score_codex":0.00015782351,"about_ca_system_score_gemma":0.0006738883,"threshold_uncertainty_score":0.9166114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017273783,0.00038663205,0.9878965,0.0007330317,0.0016142995,0.0009005537,0.000003309803,0.00026500793,0.008027945],"genre_scores_gemma":[0.14347532,0.000048267917,0.8496723,0.0044698077,0.0006836739,0.000025739371,0.0000107104515,0.00008976233,0.0015243635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944946,0.00004674153,0.0005386562,0.002353578,0.0015531405,0.0010132657],"domain_scores_gemma":[0.9962818,0.0003939215,0.00037121528,0.0025442743,0.0001853572,0.00022343775],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011537924,0.00073194434,0.0006510209,0.00090396067,0.00022376058,0.0008126823,0.0049537476,0.00017615939,0.000051197974],"category_scores_gemma":[0.000028188697,0.00062161864,0.00014363969,0.0007282091,0.0005283263,0.00068733544,0.0017769167,0.0009667611,0.00020741743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007242751,0.000019573661,0.000027812433,0.000052953073,0.00002210039,0.00029068234,0.0001467984,0.41579482,0.000019633175,0.024556834,0.000052014617,0.55900955],"study_design_scores_gemma":[0.00051878183,0.0004058634,0.00004992745,0.0007331559,0.000017056323,0.00009880396,1.5325263e-7,0.9597539,0.0006420572,0.029559517,0.0071472423,0.0010735437],"about_ca_topic_score_codex":0.000015266765,"about_ca_topic_score_gemma":0.000051576735,"teacher_disagreement_score":0.55793595,"about_ca_system_score_codex":0.00054373214,"about_ca_system_score_gemma":0.0009956445,"threshold_uncertainty_score":0.99962354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002671707,0.00044414584,0.9934701,0.00026220907,0.0009294992,0.0004319359,0.00001336739,0.00013193028,0.0016451108],"genre_scores_gemma":[0.48450524,0.000009513627,0.51424396,0.00071969646,0.00031770757,0.0000050537465,0.00003398163,0.000033064447,0.00013175073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962265,0.00005630862,0.00053429144,0.0015119285,0.0009508642,0.0007200914],"domain_scores_gemma":[0.997726,0.00062207767,0.00033904138,0.0009997009,0.00016404911,0.0001490813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001029443,0.0005464736,0.000581069,0.0016116361,0.00020308087,0.00059893855,0.0019068167,0.00024030686,0.000012035548],"category_scores_gemma":[0.00007424082,0.00046355327,0.000077566736,0.0009290393,0.00036001127,0.0005802134,0.0004741044,0.0010871047,0.000028189419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014349268,0.000032719647,0.0024226978,0.000057149533,0.000020244637,0.0005676804,0.0014342149,0.7663058,0.00025022976,0.0040432485,0.000031492105,0.22482015],"study_design_scores_gemma":[0.00052647095,0.00030955469,0.00026617406,0.00071864406,0.000006748992,0.00015257653,4.0689844e-7,0.99150735,0.0013159068,0.0038605877,0.0005908396,0.00074474304],"about_ca_topic_score_codex":0.000047181795,"about_ca_topic_score_gemma":0.000060915005,"teacher_disagreement_score":0.48183355,"about_ca_system_score_codex":0.0003558554,"about_ca_system_score_gemma":0.0011594496,"threshold_uncertainty_score":0.9997816},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001541059,0.00001409853,0.9804279,0.0000969346,0.0006715718,0.011078916,0.000010206595,0.00008710189,0.007597826],"genre_scores_gemma":[0.009052256,0.0000021994147,0.9892819,0.00022223177,0.000102977196,0.0010741065,0.0000067673254,0.000019185221,0.00023838594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996458,0.000066915614,0.00077339326,0.0011828296,0.0011071202,0.00041173137],"domain_scores_gemma":[0.99641365,0.00027884977,0.00063759973,0.0021173654,0.00045144692,0.00010111906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014978678,0.0003758806,0.000706544,0.002243684,0.00011489248,0.00021587167,0.0033687446,0.00030307967,0.000046433594],"category_scores_gemma":[0.00017470175,0.00034038446,0.00024306512,0.0026187634,0.0004940924,0.00066427724,0.0010077396,0.0005288976,0.000026299427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008813366,0.000042523814,0.0003132154,0.00008072974,0.00011584607,0.0000063818197,0.0006811315,0.10018013,0.00023598177,0.21308771,0.000007184835,0.6852403],"study_design_scores_gemma":[0.00016078298,0.00015927725,0.0034255423,0.00012815605,0.00006695348,0.0000060984353,6.6333506e-8,0.95560527,0.0020364462,0.036815662,0.0011798528,0.0004159204],"about_ca_topic_score_codex":0.000035964676,"about_ca_topic_score_gemma":0.000042867454,"teacher_disagreement_score":0.8554251,"about_ca_system_score_codex":0.0002704117,"about_ca_system_score_gemma":0.00095709186,"threshold_uncertainty_score":0.9999048},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008207445,0.0006506274,0.99711615,0.000108335924,0.0006224672,0.0005852,0.0000062991467,0.000022369957,0.00006779933],"genre_scores_gemma":[0.50565785,0.000047117963,0.49401826,0.00006125579,0.00008751105,0.000054351858,0.0000031003833,0.000020950665,0.000049580725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892956,0.0000082443885,0.00031385946,0.00031651385,0.00019985533,0.00023196092],"domain_scores_gemma":[0.9989874,0.00053827313,0.000088823814,0.0002625737,0.00010600215,0.000016968117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044115796,0.00018396747,0.0002958972,0.00025986048,0.000068243055,0.0000651493,0.00035803,0.00010604001,0.0000020257175],"category_scores_gemma":[0.00004717806,0.00012680238,0.0001373315,0.00016973777,0.00009623315,0.00019665195,0.0000555654,0.00023522878,9.552716e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010758018,0.00000593295,0.0000019046737,0.00007124846,0.000020896405,1.9792974e-7,0.00018925534,0.92461884,0.00029979835,0.00053132913,0.0000034869486,0.07424634],"study_design_scores_gemma":[0.0001173889,0.00005334195,0.000005580188,0.000307029,0.000026818097,0.0000028802956,0.0000014164293,0.99388236,0.002326572,0.0029964857,0.00013037423,0.00014975302],"about_ca_topic_score_codex":0.00006444171,"about_ca_topic_score_gemma":0.00003215095,"teacher_disagreement_score":0.5048371,"about_ca_system_score_codex":0.00020710983,"about_ca_system_score_gemma":0.00010642347,"threshold_uncertainty_score":0.5170851},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006354481,0.0011165962,0.98652214,0.009191381,0.00059440866,0.0014632457,0.00007976962,0.00006157281,0.0003354438],"genre_scores_gemma":[0.36661398,0.00007992671,0.60320646,0.022445114,0.0020313892,0.00009658327,0.00021906238,0.00011797829,0.005189508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997701,0.000018066616,0.000484915,0.0010695476,0.00028533844,0.0004411233],"domain_scores_gemma":[0.9976184,0.0011597018,0.00014213497,0.0006684458,0.0002553833,0.00015593243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005463163,0.0003587501,0.0006726486,0.00056899496,0.00014097338,0.00005112666,0.00024592623,0.00030137433,0.000006464129],"category_scores_gemma":[0.0004620886,0.00031524434,0.0002626467,0.00021752146,0.00035439638,0.000100203135,0.0002469232,0.00056192867,0.000011826851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019377068,0.00017572154,0.00005156633,0.0010409399,0.000050218052,0.0001490919,0.00035665123,0.84595007,0.0010618875,0.00064747065,0.004243305,0.14433536],"study_design_scores_gemma":[0.0024907738,0.0057977503,0.0003943816,0.004318012,0.000106192376,0.0003777385,3.928613e-7,0.9683072,0.0009439004,0.009108126,0.007446226,0.00070933474],"about_ca_topic_score_codex":0.000007338285,"about_ca_topic_score_gemma":0.000012577355,"teacher_disagreement_score":0.38331565,"about_ca_system_score_codex":0.00012513487,"about_ca_system_score_gemma":0.000313181,"threshold_uncertainty_score":0.99992996},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019444394,0.00016628628,0.9952157,0.00020143136,0.0009601913,0.0005398022,0.000019699055,0.00009330758,0.0008591051],"genre_scores_gemma":[0.8035365,0.0000057497623,0.19613153,0.00012535763,0.00010475151,0.000004177153,0.000009620834,0.000021413034,0.000060947645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734557,0.000060830735,0.0005126109,0.0011405153,0.00061740476,0.0003230986],"domain_scores_gemma":[0.9979055,0.00035089313,0.0004917679,0.00085030386,0.00032791105,0.00007361302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040617143,0.00033503602,0.00046341287,0.00091691164,0.00016696558,0.0002936327,0.0007964573,0.00024360066,0.000004691122],"category_scores_gemma":[0.00007606816,0.00033688225,0.000089711866,0.00065740495,0.0010036635,0.0011412932,0.00027428116,0.00043807813,0.0000040404107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005134653,0.00008681985,0.0023806745,0.00022090241,0.000021930568,0.0000681145,0.0017093157,0.56413436,0.015282684,0.0084848385,0.000021183138,0.40753785],"study_design_scores_gemma":[0.00032574305,0.00036688684,0.0004667882,0.0002106546,0.000012800718,0.00012860906,8.8345587e-7,0.9376566,0.011735453,0.048671633,0.00003674301,0.00038721284],"about_ca_topic_score_codex":0.00015457996,"about_ca_topic_score_gemma":0.00008289357,"teacher_disagreement_score":0.801592,"about_ca_system_score_codex":0.000731632,"about_ca_system_score_gemma":0.0011006173,"threshold_uncertainty_score":0.9999083},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012111464,0.000014123767,0.99462515,0.0012630344,0.00036456902,0.002042894,0.0001123902,0.00012770611,0.00023900441],"genre_scores_gemma":[0.47820008,0.0000018349645,0.5196417,0.0017032132,0.00013419538,0.00016593195,0.00009509369,0.000029487217,0.000028460707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968255,0.000027733264,0.00037570013,0.0012901461,0.00092825474,0.0005526426],"domain_scores_gemma":[0.9975681,0.0006204688,0.00014373852,0.0012705235,0.00026570234,0.00013150251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031837527,0.00039385102,0.00038313097,0.00072394306,0.00038608626,0.00041987014,0.0017463313,0.00015121064,0.000046039342],"category_scores_gemma":[0.000016224154,0.00033389876,0.0001332709,0.0007387513,0.00025821174,0.0003036334,0.00023455697,0.0003504797,0.000026710557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002562407,0.00016360794,0.000013478975,0.0001344317,0.00002976878,0.00000624382,0.0016606566,0.1285358,0.00035448078,0.50003976,0.00010214574,0.368934],"study_design_scores_gemma":[0.00064769754,0.00082057086,0.00021576036,0.00024940076,0.000014226774,0.0000064059877,5.081253e-7,0.89477205,0.0012915845,0.10065198,0.00081973075,0.0005100643],"about_ca_topic_score_codex":0.000029298964,"about_ca_topic_score_gemma":0.00016095245,"teacher_disagreement_score":0.76623625,"about_ca_system_score_codex":0.0001774296,"about_ca_system_score_gemma":0.000533435,"threshold_uncertainty_score":0.9999113},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003165413,0.00006336331,0.99483067,0.0006331434,0.0014764648,0.0008380585,0.0000107360065,0.0003970245,0.0017188998],"genre_scores_gemma":[0.032910265,0.000002245714,0.96455634,0.0019261435,0.00036469116,0.00006244705,0.000026009646,0.000032410524,0.000119426615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684733,0.00002189136,0.00038719748,0.0013817928,0.0006697919,0.00069198234],"domain_scores_gemma":[0.9977202,0.0004442136,0.00020883865,0.0011945,0.00024640912,0.00018583094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012969399,0.00040849042,0.0003928807,0.0007652181,0.0003290782,0.00047726586,0.0023438632,0.00029766528,0.000007388726],"category_scores_gemma":[0.00017660754,0.0003982166,0.00012434188,0.00046711866,0.00013854023,0.0008138224,0.000653517,0.00048296308,0.000011728863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023467524,0.00008382483,0.00006846735,0.00009722107,0.00001964152,0.000007942468,0.0003203522,0.5205856,0.00031847955,0.026172291,0.00015258431,0.4521501],"study_design_scores_gemma":[0.00022909883,0.00047136418,0.00016065685,0.0001497415,0.000009344123,0.000020690319,1.2870142e-7,0.96664304,0.0007239423,0.029216103,0.0018415551,0.0005343366],"about_ca_topic_score_codex":0.000040502167,"about_ca_topic_score_gemma":0.000018430515,"teacher_disagreement_score":0.45161578,"about_ca_system_score_codex":0.00031146727,"about_ca_system_score_gemma":0.00092714315,"threshold_uncertainty_score":0.999847},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016149093,0.00014054755,0.9949415,0.00041647948,0.001777348,0.0006858407,0.000056839253,0.00008357899,0.0017364161],"genre_scores_gemma":[0.0808975,0.00015727221,0.9133462,0.0012866392,0.00058428914,0.00007890493,0.0003853822,0.0000627881,0.0032010488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794304,0.000021388336,0.00044210238,0.0008250596,0.00047552033,0.00029287982],"domain_scores_gemma":[0.9980223,0.00033415004,0.00035377528,0.00068373204,0.0005361343,0.00006991909],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003718328,0.00026443647,0.0003137739,0.0006982573,0.00018144782,0.0001607422,0.00091241585,0.00025867086,0.000032136584],"category_scores_gemma":[0.00009563405,0.0002540984,0.00013410342,0.00044165802,0.00018385827,0.0006649102,0.0002647529,0.0002290496,0.00007652892],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073039,0.000032335865,0.000016475173,0.000082354774,0.000010560226,0.0000011328158,0.00034141302,0.042601377,0.001339629,0.0044008214,0.0002296232,0.950937],"study_design_scores_gemma":[0.000566422,0.00029773553,0.000049400805,0.0009112051,0.000024505636,0.000017239076,7.5608955e-7,0.77998537,0.021010758,0.1930008,0.0034971444,0.00063868175],"about_ca_topic_score_codex":0.000009866669,"about_ca_topic_score_gemma":0.000029081715,"teacher_disagreement_score":0.9502983,"about_ca_system_score_codex":0.00010631828,"about_ca_system_score_gemma":0.00039739106,"threshold_uncertainty_score":0.9999911},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002825218,0.00031535706,0.9916092,0.0012089168,0.003261654,0.00075682293,0.000012042398,0.00013532041,0.0026724427],"genre_scores_gemma":[0.19465274,0.000071380004,0.80194855,0.0011783872,0.0010747308,0.000019326299,0.000025347366,0.00005485519,0.0009746996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620193,0.00002606833,0.0004198124,0.0016769557,0.0008785959,0.0007966614],"domain_scores_gemma":[0.9976282,0.00031571696,0.00016352083,0.0014192928,0.00031763656,0.00015559155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010570529,0.00043850695,0.0004960965,0.0005922322,0.0002668482,0.00051950524,0.003063665,0.00037307828,0.000012837514],"category_scores_gemma":[0.000020850859,0.00037868434,0.00018170917,0.0004893746,0.00061807886,0.00053830724,0.001084328,0.00066815305,0.00010722935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008719768,0.000020118343,0.000010711709,0.000052451327,0.000009017209,0.000016380645,0.00026801333,0.07366827,0.000040206756,0.03680474,0.00012438522,0.888977],"study_design_scores_gemma":[0.00043991217,0.00051861984,0.00005879982,0.00021772241,0.000008044261,0.00010719717,3.2186196e-7,0.8974734,0.0014843348,0.092182,0.0067379377,0.0007716842],"about_ca_topic_score_codex":0.000017389424,"about_ca_topic_score_gemma":0.000010020331,"teacher_disagreement_score":0.8882053,"about_ca_system_score_codex":0.0003730345,"about_ca_system_score_gemma":0.0008058948,"threshold_uncertainty_score":0.9998665},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031633112,0.00022769118,0.9900155,0.0016168638,0.0015607438,0.000830434,0.000028056513,0.0025524914,0.0000049119935],"genre_scores_gemma":[0.44976276,0.000002577875,0.5486687,0.0009821662,0.000486328,0.000025226254,0.000054392596,0.000017390495,4.6232637e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951863,0.00013579191,0.00053038273,0.0025628041,0.00080356473,0.00078110024],"domain_scores_gemma":[0.9898111,0.004850256,0.0002798582,0.0045135287,0.00042163554,0.0001236027],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0037943022,0.00043269567,0.00048742065,0.00066825974,0.00034098816,0.001806975,0.0076889326,0.0002689332,0.0000012942847],"category_scores_gemma":[0.005104656,0.00040955198,0.00009606963,0.0011446106,0.00027234596,0.000663816,0.006752377,0.0008930711,0.0000068780964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020818877,0.00003831836,0.006524108,0.00017402731,0.0000036781707,0.000006986098,0.00022857964,0.29289812,0.0008393793,0.00003237216,0.00017274628,0.69907963],"study_design_scores_gemma":[0.00016980815,0.0000977124,0.00037465512,0.0006934525,0.000006661329,0.000015167858,4.8271126e-8,0.9807246,0.003925843,0.013460666,0.00004552987,0.00048587786],"about_ca_topic_score_codex":0.00010480513,"about_ca_topic_score_gemma":0.0000068787012,"teacher_disagreement_score":0.69859374,"about_ca_system_score_codex":0.00024036475,"about_ca_system_score_gemma":0.001199547,"threshold_uncertainty_score":0.9998356},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00816613,0.000008711681,0.98893607,0.00015539814,0.00050456123,0.000704067,0.00028942322,0.000030837607,0.0012047875],"genre_scores_gemma":[0.9762768,0.000012626955,0.02201976,0.0005043667,0.000110515924,0.00001103018,0.00003705034,0.000021741034,0.0010060675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818087,0.0000082220295,0.00035479962,0.00078259624,0.00036662526,0.00030687187],"domain_scores_gemma":[0.9988397,0.00044814058,0.00026700457,0.00027690476,0.00011628405,0.000051997664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016484623,0.0002344416,0.0002754579,0.00032365095,0.00013619098,0.00014172871,0.00045617082,0.00013442276,0.000029299184],"category_scores_gemma":[0.000106568,0.00019385765,0.0001110347,0.0002131978,0.00030266886,0.0003045522,0.00022293278,0.00018803854,0.000010812218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054728116,0.000036747268,0.00046880456,0.00007133768,0.000006128346,0.0000026987955,0.00019057625,0.519159,0.08308999,0.03204887,0.000034574463,0.3648365],"study_design_scores_gemma":[0.0002629784,0.00029709004,0.00008560411,0.000045734294,0.000004665821,0.000008497457,2.3486788e-7,0.94885325,0.009648608,0.04019696,0.0003684358,0.00022796338],"about_ca_topic_score_codex":0.0000045085108,"about_ca_topic_score_gemma":0.00004495273,"teacher_disagreement_score":0.9681107,"about_ca_system_score_codex":0.000111648835,"about_ca_system_score_gemma":0.00029456502,"threshold_uncertainty_score":0.7905286},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006094092,0.00050824246,0.9924979,0.0009593115,0.0036675679,0.00090239587,0.00002090104,0.00039321455,0.00044105522],"genre_scores_gemma":[0.20532408,0.000028216098,0.78934354,0.0022947344,0.0019487437,0.000030271305,0.000026451116,0.00016520718,0.0008387732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944859,0.00003346919,0.0007313178,0.0024440826,0.0010637186,0.0012414674],"domain_scores_gemma":[0.99629897,0.00095166155,0.0005044749,0.0015800006,0.00043228842,0.00023262139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001223826,0.0008363558,0.0008769218,0.000997304,0.0005501068,0.00092293654,0.004564053,0.0004621781,0.000007631733],"category_scores_gemma":[0.0001405444,0.00074658904,0.00029919253,0.0007047986,0.0004018812,0.00052728824,0.0015378321,0.0011337392,0.000037730024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008488926,0.000020500689,0.000022663446,0.00022445305,0.000018500794,0.000039031875,0.0015647972,0.60762376,0.000039642702,0.013208842,0.000031151096,0.3771982],"study_design_scores_gemma":[0.00033850278,0.0002537801,0.00001623327,0.0008482376,0.000009704248,0.00007138811,4.1648298e-7,0.92116654,0.00030926184,0.073709816,0.0023946564,0.0008814416],"about_ca_topic_score_codex":0.000013308559,"about_ca_topic_score_gemma":0.00001654831,"teacher_disagreement_score":0.37631673,"about_ca_system_score_codex":0.00023644396,"about_ca_system_score_gemma":0.0010823434,"threshold_uncertainty_score":0.9994985},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06511858,0.00012540455,0.92435306,0.0025459079,0.0067713577,0.0007107138,0.000010391458,0.00032677443,0.00003781195],"genre_scores_gemma":[0.56281334,0.0000108628055,0.43567806,0.001065123,0.00035393564,0.000051907977,0.0000065674003,0.000016115042,0.0000040791742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99496716,0.0001929768,0.0005355965,0.0023628052,0.0011703214,0.0007711473],"domain_scores_gemma":[0.9964743,0.00068109954,0.00028096026,0.0020469117,0.00027005593,0.0002466373],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00086058135,0.000472449,0.00046552328,0.00095304457,0.0004155858,0.0011284869,0.0044239764,0.00029382334,0.000015104631],"category_scores_gemma":[0.00023315866,0.00047959152,0.00013564577,0.0025800723,0.00018806421,0.0005680969,0.0063302834,0.001602787,0.00017075367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022583433,0.000022793487,0.0005846752,0.000010898963,0.0000052061714,0.0000059244585,0.0033685337,0.6275564,0.00044021587,0.00002782655,0.000023338178,0.36795193],"study_design_scores_gemma":[0.00018690852,0.0001778446,0.010355128,0.0003282839,0.000006427716,0.000007451565,0.0000032008181,0.96626264,0.009006147,0.012675241,0.00038330426,0.0006074149],"about_ca_topic_score_codex":0.0007760644,"about_ca_topic_score_gemma":0.00029922652,"teacher_disagreement_score":0.49769476,"about_ca_system_score_codex":0.0009809699,"about_ca_system_score_gemma":0.0010192195,"threshold_uncertainty_score":0.99990845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021532902,0.0013224665,0.98777086,0.00015661433,0.006576221,0.0006591964,0.0000024873061,0.00021821889,0.0011406486],"genre_scores_gemma":[0.9702674,0.000056969955,0.027075645,0.00046221746,0.0019333988,0.000009067067,0.0000012284199,0.00004261782,0.00015144666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995914,0.00010930735,0.00077341474,0.0016755391,0.00074730866,0.00078047265],"domain_scores_gemma":[0.9970174,0.0010492493,0.00069378584,0.0008291736,0.00024434045,0.00016606865],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025204814,0.0005342638,0.00070199167,0.0006352013,0.0005704752,0.0013557104,0.0016436371,0.0005741366,0.00001246178],"category_scores_gemma":[0.0004123365,0.0005257848,0.00011354279,0.00050652213,0.00036207735,0.0009674668,0.00081444,0.0017200797,0.00002062048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015504234,0.000011548591,0.0003257957,0.00008301887,0.000019083378,0.00003867976,0.001013898,0.07426249,0.0005286679,0.004857255,0.000023498065,0.91882056],"study_design_scores_gemma":[0.00064025656,0.00022602103,0.000035583795,0.0014058027,0.000011742662,0.00013088931,0.0000012143403,0.98461497,0.0009809432,0.007497014,0.0036392638,0.00081628514],"about_ca_topic_score_codex":0.000052044776,"about_ca_topic_score_gemma":0.00003971617,"teacher_disagreement_score":0.96811414,"about_ca_system_score_codex":0.00024544523,"about_ca_system_score_gemma":0.00034565822,"threshold_uncertainty_score":0.9997194},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007925843,0.000091782946,0.9885757,0.00095970643,0.001168704,0.0006314128,0.0000063516695,0.00017103598,0.008316028],"genre_scores_gemma":[0.5308461,0.00007877481,0.44153115,0.019433094,0.006610666,0.00015621643,0.00006702476,0.00015216954,0.0011247634],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978151,0.000002988411,0.000483166,0.000698288,0.0004507394,0.00054974516],"domain_scores_gemma":[0.9980516,0.00024248,0.00058019377,0.00058642385,0.0005210816,0.000018242237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044756348,0.00046166597,0.0004852547,0.00090006803,0.00027466958,0.00047278387,0.0013171881,0.0005237752,0.00006551591],"category_scores_gemma":[0.00032752453,0.00039574143,0.00013047317,0.0006435144,0.0005483095,0.0005640337,0.00044376188,0.00076723704,0.000110101166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057106787,0.000011397266,0.000026388427,0.00016739985,0.000012853161,0.000008815305,0.00011417423,0.019769777,0.000003644206,0.45661584,0.00009201193,0.5231206],"study_design_scores_gemma":[0.00016763082,0.00004457902,0.0000519598,0.0007680576,0.000020612946,0.000008566662,0.0000013222148,0.11838072,0.00008670886,0.86126614,0.01867454,0.0005291384],"about_ca_topic_score_codex":0.00004307722,"about_ca_topic_score_gemma":0.00009269276,"teacher_disagreement_score":0.5470446,"about_ca_system_score_codex":0.00010636155,"about_ca_system_score_gemma":0.00015958832,"threshold_uncertainty_score":0.99984944},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06522818,0.0014278742,0.9277835,0.00019490716,0.0015343167,0.0012057608,0.000041758867,0.000696576,0.0018871502],"genre_scores_gemma":[0.919261,0.00013740516,0.08022447,0.00006464291,0.00021340173,0.000008159288,0.000005766234,0.000069712034,0.000015449592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795777,0.000020391446,0.0004029708,0.00073548756,0.00050866423,0.00037474342],"domain_scores_gemma":[0.99829733,0.0006456725,0.00020221178,0.0006337917,0.00012673996,0.00009425173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003043393,0.0005092233,0.0006282534,0.0007214607,0.00007909241,0.00016725907,0.00060528715,0.00046053715,0.000007439939],"category_scores_gemma":[0.00010764198,0.00049534545,0.00008404617,0.00032377688,0.00021804185,0.00039189623,0.00033781756,0.0010434022,0.0000027475155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013990907,0.00004414834,0.016753055,0.0034632424,0.00007591132,0.00012535966,0.00083539827,0.76616627,0.01391972,0.0029817445,0.00015692555,0.19546424],"study_design_scores_gemma":[0.0003128846,0.000173075,0.0028577088,0.005500605,0.000071046576,0.00020034243,9.191851e-7,0.9562294,0.030266857,0.0022325064,0.0010507707,0.0011038795],"about_ca_topic_score_codex":0.0000755159,"about_ca_topic_score_gemma":0.00008448755,"teacher_disagreement_score":0.8540328,"about_ca_system_score_codex":0.0002726807,"about_ca_system_score_gemma":0.00009129497,"threshold_uncertainty_score":0.99974984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08710202,0.00006702948,0.9040394,0.0021326146,0.0048458055,0.001055065,0.000007937412,0.00016254271,0.0005875953],"genre_scores_gemma":[0.87115854,0.000030152316,0.12711589,0.0008506034,0.000759491,0.000024629,0.000008479616,0.000025399733,0.000026802096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968462,0.00008210853,0.00044135045,0.0012772444,0.00083099294,0.00052211114],"domain_scores_gemma":[0.9980494,0.00031708146,0.00019669984,0.0011236509,0.00013526167,0.00017790427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071188685,0.00040611837,0.00063214934,0.0007438496,0.00013034925,0.00021804291,0.00066163036,0.00032859662,0.00021352552],"category_scores_gemma":[0.00033426078,0.0003515673,0.00021183638,0.0006368279,0.0004243329,0.0000952643,0.0014358743,0.0008689849,0.00012179169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031881707,0.00024463458,0.0006922291,0.00066636567,0.00005913133,0.0008277938,0.0008597947,0.060968194,0.011655165,0.000040842682,0.00013951898,0.92352754],"study_design_scores_gemma":[0.0021759365,0.0005963621,0.0069307205,0.0024539127,0.00022779102,0.0010666484,0.000016153357,0.8979249,0.08227669,0.0034283013,0.001565716,0.001336887],"about_ca_topic_score_codex":0.000094460855,"about_ca_topic_score_gemma":0.000033063,"teacher_disagreement_score":0.9221906,"about_ca_system_score_codex":0.0004422895,"about_ca_system_score_gemma":0.00056316145,"threshold_uncertainty_score":0.9998936},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021417848,0.0007143898,0.9920148,0.0012448952,0.0040008263,0.0009840076,0.000019945288,0.0003217517,0.00048516435],"genre_scores_gemma":[0.0530071,0.000022166061,0.9437495,0.0013395699,0.0009673782,0.00002122395,0.000014434361,0.00009122314,0.00078742515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99490005,0.00004122211,0.00069902063,0.002199153,0.001013857,0.0011467107],"domain_scores_gemma":[0.9959195,0.0012862507,0.00043525416,0.00178106,0.00035914537,0.00021877923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013048049,0.00079539104,0.00096676085,0.00084713724,0.00039283902,0.00087562914,0.0043641888,0.00041273725,0.000010908058],"category_scores_gemma":[0.00018299687,0.00068054686,0.00039009552,0.0006455186,0.00047548919,0.00038581615,0.0015446064,0.00096043246,0.000067322006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010968709,0.000033342345,0.0000044671056,0.000119392345,0.00003191268,0.000029483195,0.00041270765,0.06361641,0.00013799405,0.0440225,0.000026118647,0.8915547],"study_design_scores_gemma":[0.00046905724,0.000265044,0.000031761698,0.0004158535,0.000015611193,0.00004823883,1.1083289e-7,0.8447657,0.0005442335,0.14840804,0.0042464337,0.0007898817],"about_ca_topic_score_codex":0.000017755317,"about_ca_topic_score_gemma":0.000022800223,"teacher_disagreement_score":0.89076483,"about_ca_system_score_codex":0.00018662162,"about_ca_system_score_gemma":0.0010416284,"threshold_uncertainty_score":0.9995646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31906775,0.000061074934,0.67807347,0.00018191442,0.0021414673,0.00033894542,0.000007716989,0.00011715165,0.000010515627],"genre_scores_gemma":[0.6981218,0.0000072552275,0.30147678,0.00018430111,0.0001737538,0.000009124513,0.000014627611,0.00001198704,3.9095312e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572,0.00017041173,0.00062267814,0.0017561975,0.0010767136,0.0006539656],"domain_scores_gemma":[0.9963592,0.00019323308,0.00047063048,0.0025028558,0.00032765506,0.00014637568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012859781,0.0004357027,0.00060942216,0.0010617481,0.00016169068,0.0006269913,0.00536252,0.00025240052,0.000004966936],"category_scores_gemma":[0.00007864294,0.0004212535,0.00015800934,0.0020794047,0.0005316467,0.0005251365,0.003183532,0.0007754614,0.0000061284913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043526848,0.00016160063,0.0015230478,0.00009889405,0.00000667019,0.000011029323,0.0022026037,0.6581351,0.012927315,0.0011683943,3.118199e-7,0.32376066],"study_design_scores_gemma":[0.00017912863,0.0001377226,0.025926845,0.0004019552,0.000004124785,0.000011558393,5.3550116e-7,0.9338801,0.029105933,0.009911696,0.000009945497,0.00043047406],"about_ca_topic_score_codex":0.00006525268,"about_ca_topic_score_gemma":0.000013619423,"teacher_disagreement_score":0.37905404,"about_ca_system_score_codex":0.00014097699,"about_ca_system_score_gemma":0.0005329454,"threshold_uncertainty_score":0.9998239},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056792618,0.00029620432,0.9910463,0.001585714,0.0017589327,0.00041422484,0.0000046194546,0.00020343016,0.0046337973],"genre_scores_gemma":[0.51884073,0.00003465817,0.3287735,0.0027014383,0.0012069206,0.000010903599,0.000011019398,0.00009468383,0.14832614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954723,0.00005191951,0.00046816404,0.0017935493,0.0014905197,0.0007235302],"domain_scores_gemma":[0.9973152,0.00044941207,0.00034211404,0.0013296196,0.0003962902,0.00016733515],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007288718,0.0006031163,0.0006060176,0.00052939437,0.00028044265,0.0012888206,0.0022829864,0.00043294212,0.000020381034],"category_scores_gemma":[0.000110294786,0.00052448374,0.00022982196,0.0003259163,0.00021221761,0.0007730194,0.0013115722,0.0010682665,0.00009674604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028480783,0.000013978985,0.000015190055,0.00003083209,0.000008864521,0.000054770717,0.00074777025,0.74446726,0.00008775926,0.19711578,0.000013438977,0.05744154],"study_design_scores_gemma":[0.0001300433,0.000106428124,0.000015013571,0.00028458997,0.000007494361,0.000027482987,5.8428583e-7,0.9440655,0.00036645422,0.032341756,0.022054147,0.00060046633],"about_ca_topic_score_codex":0.000008465925,"about_ca_topic_score_gemma":0.000008641257,"teacher_disagreement_score":0.66227275,"about_ca_system_score_codex":0.0003822725,"about_ca_system_score_gemma":0.0006717162,"threshold_uncertainty_score":0.99974793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004974363,0.000042008593,0.99189335,0.00006653977,0.00088535633,0.0014378806,0.000035457073,0.00011554052,0.0005495281],"genre_scores_gemma":[0.79705167,0.000008883203,0.20231724,0.0001290178,0.0002170478,0.00001555859,0.00007500362,0.0000495294,0.00013608356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807966,0.000034692548,0.00050772616,0.0006031868,0.0004907282,0.00028399032],"domain_scores_gemma":[0.99815595,0.0007395236,0.00023628485,0.00056344736,0.00025189406,0.000052880092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005572268,0.00036356674,0.00040849642,0.00055918103,0.00013277696,0.00013492799,0.000505217,0.0003703684,0.0000149143525],"category_scores_gemma":[0.0002163751,0.00033988757,0.00009744948,0.00022051795,0.00020002469,0.00035740988,0.00009985119,0.00045837808,0.000010654112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073817224,0.000020316742,0.00013243142,0.00011767787,0.0000287231,8.348564e-7,0.0016213306,0.991632,0.000034134104,0.0013367364,0.0000046917685,0.004997327],"study_design_scores_gemma":[0.0007643316,0.00021471303,0.00028203535,0.00044855225,0.00002572789,2.4529982e-7,0.000001052912,0.9873199,0.0010270963,0.009476802,0.00010140662,0.00033817935],"about_ca_topic_score_codex":0.000015279824,"about_ca_topic_score_gemma":0.000050140236,"teacher_disagreement_score":0.7920773,"about_ca_system_score_codex":0.00029458202,"about_ca_system_score_gemma":0.00006506573,"threshold_uncertainty_score":0.9999053},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009893037,0.00016556714,0.99343175,0.00062299805,0.0027975508,0.00040629285,0.000005361877,0.0008323644,0.001728203],"genre_scores_gemma":[0.007357981,0.000053923908,0.98765564,0.0013583796,0.0014413708,0.000041058003,0.0000024212673,0.00004717729,0.0020420316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953042,0.00006705415,0.0006858718,0.0019708672,0.0010607532,0.0009111975],"domain_scores_gemma":[0.996715,0.00047650994,0.00034123886,0.0019442021,0.00032056635,0.00020248772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008585252,0.00056950725,0.0005147457,0.0011663203,0.00026427364,0.00047111008,0.005116214,0.0003948138,0.000026796813],"category_scores_gemma":[0.0002103748,0.00047394074,0.0001496461,0.0013690249,0.00091210706,0.0010626134,0.001947802,0.0008220301,0.00014893814],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031462846,0.000016691156,0.0000031484897,0.000012743075,0.0000031060451,0.000055227032,0.00011794038,0.0032331818,0.00050355773,0.014574758,0.00010945363,0.98136705],"study_design_scores_gemma":[0.000041674393,0.00019787978,0.000010351502,0.00027454214,0.0000029268733,0.00009673184,3.4815812e-8,0.09809808,0.09251908,0.79909647,0.008856112,0.00080615235],"about_ca_topic_score_codex":0.000008147625,"about_ca_topic_score_gemma":0.000033407312,"teacher_disagreement_score":0.9805609,"about_ca_system_score_codex":0.00092825666,"about_ca_system_score_gemma":0.0012518064,"threshold_uncertainty_score":0.99977124},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010637853,0.00041645695,0.99258065,0.0037990978,0.00076120166,0.0007483888,0.0000049828654,0.00003399218,0.0005914466],"genre_scores_gemma":[0.80169564,0.000043251643,0.19621113,0.0007483809,0.00052869326,0.000031366802,0.000011470333,0.000027606166,0.000702477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741066,0.00005491766,0.0005040934,0.00103604,0.0006001225,0.00039417815],"domain_scores_gemma":[0.9969639,0.0010355134,0.00048554066,0.0012971782,0.00014741573,0.00007044184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017360316,0.0003137992,0.00042723812,0.00061997876,0.00031942507,0.0002894473,0.002466372,0.00020293922,0.0000035560988],"category_scores_gemma":[0.00032215499,0.000247291,0.0001618486,0.0003537499,0.0005236844,0.0005301714,0.00058200397,0.00041300876,0.000003852318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031219406,0.000058071368,0.00004928673,0.000071758725,0.000010765971,0.000021229465,0.0022697246,0.10226253,0.00041466008,0.022816947,0.00008446688,0.8719093],"study_design_scores_gemma":[0.0003881439,0.00020260044,0.00070162467,0.00034550374,0.00000633363,0.000050505383,3.3156263e-7,0.84470004,0.0018587477,0.15035477,0.0010612741,0.00033013403],"about_ca_topic_score_codex":0.000017533845,"about_ca_topic_score_gemma":0.00008901537,"teacher_disagreement_score":0.87157923,"about_ca_system_score_codex":0.00021382916,"about_ca_system_score_gemma":0.00053562556,"threshold_uncertainty_score":0.9999979},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009519292,0.0004223043,0.98856556,0.00001216436,0.00057018106,0.0005796187,0.000023899598,0.000182962,0.00012400735],"genre_scores_gemma":[0.9504575,0.0002598362,0.048989087,0.000051898645,0.000099011224,0.000019649035,0.00004201063,0.00005408876,0.000026881658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998359,0.000012081736,0.0004102379,0.00054402533,0.00034665363,0.00032799848],"domain_scores_gemma":[0.999258,0.000060665585,0.00013463775,0.00038600698,0.000110437184,0.00005026196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016939311,0.00034700413,0.00031371092,0.00081999035,0.00008718134,0.000079884456,0.0003268318,0.0003088251,0.0000109868],"category_scores_gemma":[0.000026307242,0.0003236247,0.000026543783,0.00050925976,0.00018276808,0.00013779745,0.00011366542,0.00035197008,0.0000039148745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069754924,0.000013478969,0.008293319,0.00019795101,0.000004493227,0.000008100982,0.0001334424,0.9726233,0.000038929345,0.00035163792,0.0000052064674,0.018323174],"study_design_scores_gemma":[0.00035581662,0.00010487838,0.002029135,0.00012933646,0.000021851192,0.0000064244623,8.892818e-7,0.9949062,0.00051108754,0.0014325727,0.000098868,0.00040292912],"about_ca_topic_score_codex":0.000014279078,"about_ca_topic_score_gemma":0.00018629897,"teacher_disagreement_score":0.94093823,"about_ca_system_score_codex":0.00032826833,"about_ca_system_score_gemma":0.00019378396,"threshold_uncertainty_score":0.99992156},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017432362,0.0005736526,0.9225178,0.0019576352,0.07312947,0.00063187926,0.000055204655,0.00035470224,0.0006053719],"genre_scores_gemma":[0.0099505,0.00007726806,0.974609,0.0076460214,0.005644703,0.00013694643,0.00006975802,0.00009814101,0.0017676564],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99367315,0.00012314931,0.00073676795,0.0024769777,0.0015324043,0.001457552],"domain_scores_gemma":[0.99528253,0.0003019678,0.00036156742,0.003234282,0.00035945745,0.00046021372],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011064275,0.0008636583,0.0009726389,0.0011503457,0.0005601171,0.0007720128,0.0045919395,0.00067435554,0.000027755059],"category_scores_gemma":[0.0005390061,0.00074458617,0.00017947094,0.004031225,0.0007795128,0.0017233072,0.003088569,0.0024545542,0.000074667194],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006815803,0.00041203015,0.00084384,0.00072361203,0.00007341329,0.0012159867,0.013883637,0.010292212,0.004709585,0.07484,0.23460665,0.65833086],"study_design_scores_gemma":[0.0008144287,0.0005069398,0.002374179,0.0014202575,0.000014947862,0.00023789932,0.0000031210245,0.20604838,0.002483566,0.011642154,0.7713412,0.0031129378],"about_ca_topic_score_codex":0.00035942782,"about_ca_topic_score_gemma":0.003359488,"teacher_disagreement_score":0.65521795,"about_ca_system_score_codex":0.00031097606,"about_ca_system_score_gemma":0.0013406927,"threshold_uncertainty_score":0.9998468},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001629175,0.00020546427,0.9925053,0.0020683133,0.0014424877,0.0013513973,0.0000060977122,0.0007721417,0.000019628107],"genre_scores_gemma":[0.31977376,0.00000919717,0.6785387,0.0013508532,0.00021077797,0.000084016174,0.0000072866123,0.000024443298,9.675786e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948457,0.00011316634,0.0006621617,0.0026072306,0.0008599025,0.0009118538],"domain_scores_gemma":[0.99582565,0.00031541483,0.00030242454,0.0027461876,0.0005945143,0.00021578855],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001418314,0.00055212015,0.00057626615,0.0009052666,0.00024304586,0.00111424,0.0056402357,0.00034374755,0.0000022708239],"category_scores_gemma":[0.00039851523,0.0005419531,0.00011293541,0.0020042288,0.00054274156,0.0010883277,0.0064737303,0.001208003,0.00009211137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003444437,0.00012794,0.00026833723,0.00017735938,0.0000065730014,0.000017540802,0.0013941311,0.19794156,0.3317495,0.00028186958,0.000049137514,0.4679516],"study_design_scores_gemma":[0.00019304435,0.00008424543,0.00012735355,0.00018583762,0.0000033293375,0.000027418766,1.8535891e-7,0.82786566,0.1346503,0.03621556,0.00014154673,0.0005055094],"about_ca_topic_score_codex":0.00011347908,"about_ca_topic_score_gemma":0.0000167093,"teacher_disagreement_score":0.6299241,"about_ca_system_score_codex":0.00064329436,"about_ca_system_score_gemma":0.0008773321,"threshold_uncertainty_score":0.9999227},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013050462,0.000057264544,0.9968392,0.000043467684,0.0016778838,0.0004906496,0.00001542912,0.000055063898,0.0006904887],"genre_scores_gemma":[0.6460616,0.0001653727,0.3449621,0.0032269692,0.0010804214,0.000029810819,0.00015665275,0.00015627944,0.0041607968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975308,0.000013406824,0.00045609538,0.00089848845,0.00078692153,0.00031426593],"domain_scores_gemma":[0.99807525,0.0002560592,0.0003604992,0.00087793556,0.00035639424,0.00007383878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003997152,0.00029365058,0.00035048113,0.0006524621,0.00008924239,0.00020067517,0.0017524557,0.00016727588,0.00000896439],"category_scores_gemma":[0.000102204256,0.00027585265,0.000093,0.00041355647,0.00012519734,0.0003966382,0.00047629053,0.00015503076,0.00001639974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024492965,0.00015187621,0.00038007856,0.0003829212,0.000028057124,0.0000057199886,0.001462489,0.03825327,0.00012386338,0.5321906,0.000088631845,0.426908],"study_design_scores_gemma":[0.0006647754,0.0003025346,0.00015144766,0.0016128722,0.0000060528923,0.0000015551982,3.262488e-7,0.9589339,0.0052044378,0.032154743,0.0005404854,0.0004268531],"about_ca_topic_score_codex":0.0000038058515,"about_ca_topic_score_gemma":0.000002897882,"teacher_disagreement_score":0.92068064,"about_ca_system_score_codex":0.00012281381,"about_ca_system_score_gemma":0.00024738384,"threshold_uncertainty_score":0.99996936},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37149233,0.00047741662,0.6243821,0.0024227297,0.00053643883,0.0004951503,0.000005026842,0.00007447202,0.00011436776],"genre_scores_gemma":[0.95914644,0.00006046305,0.040088966,0.00031111768,0.00004140448,0.0000017462868,0.0000073614774,0.000016378792,0.00032614896],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968781,0.00009046869,0.00095200137,0.00078312523,0.0008829949,0.00041332332],"domain_scores_gemma":[0.99782246,0.0007761676,0.0005516026,0.00060228806,0.00013561037,0.00011186635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019905327,0.00034063912,0.00049113896,0.000718282,0.00017429814,0.00020355958,0.0023678897,0.00024035842,0.0000040379414],"category_scores_gemma":[0.0005717706,0.00025755295,0.00011885212,0.0007620065,0.00044250317,0.00036525773,0.0022267029,0.0021876632,0.000003686242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005156397,0.000101786456,0.42939922,0.00026827157,0.00004244628,0.000010935297,0.009401548,0.16937438,0.00010548062,0.005113489,0.0000050718227,0.38617224],"study_design_scores_gemma":[0.0003326111,0.00033985637,0.06377254,0.0038479255,0.000017644665,0.000009942618,0.000029843346,0.91221595,0.000109059256,0.018627627,0.0002385275,0.00045847878],"about_ca_topic_score_codex":0.000049406048,"about_ca_topic_score_gemma":0.00013471294,"teacher_disagreement_score":0.7428416,"about_ca_system_score_codex":0.00011635771,"about_ca_system_score_gemma":0.00031553002,"threshold_uncertainty_score":0.99998766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04293117,0.0003667159,0.9537547,0.0007987013,0.00060179166,0.0009141557,0.000013200583,0.000030650466,0.00058888545],"genre_scores_gemma":[0.9911269,0.000024925423,0.0069608474,0.0014856444,0.00023095132,0.000004602572,0.0000057673733,0.000011505009,0.00014888046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978625,0.00003764991,0.0003565299,0.00078192074,0.00052612554,0.00043524403],"domain_scores_gemma":[0.9991506,0.00024738652,0.00014042176,0.00024207775,0.000071200186,0.00014836149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010376235,0.00021943472,0.0003290285,0.00037713154,0.00028393394,0.00027124982,0.00032532844,0.00015112967,0.000011301861],"category_scores_gemma":[0.000045130808,0.0002103221,0.00003249001,0.00021599335,0.0004324562,0.00029984183,0.00011841226,0.00026085548,0.0000011174902],"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.000034071174,0.000018378942,0.010318229,0.00015920198,0.0000031683733,0.000005921442,0.012760854,0.19758452,0.000020076923,0.0013250858,0.0000012871552,0.7777692],"study_design_scores_gemma":[0.00065693125,0.00024422313,0.0040196767,0.0006198233,0.000006773077,1.5451376e-7,0.000012033001,0.9252039,0.00006367884,0.06751609,0.0010453545,0.0006113479],"about_ca_topic_score_codex":0.004348414,"about_ca_topic_score_gemma":0.018122412,"teacher_disagreement_score":0.9481957,"about_ca_system_score_codex":0.00026402448,"about_ca_system_score_gemma":0.0009909933,"threshold_uncertainty_score":0.9997943},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007185571,0.0008816129,0.9873773,0.00053514645,0.0027769718,0.00063248206,0.000012104836,0.00039585435,0.0073166564],"genre_scores_gemma":[0.06895236,0.0000569562,0.9276145,0.0016824829,0.0012417862,0.000029290051,0.00001609653,0.00006510987,0.0003414043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99483347,0.000057935027,0.00082976336,0.0017666967,0.0012510881,0.0012610421],"domain_scores_gemma":[0.99599934,0.00086470164,0.0004791261,0.0020164493,0.0002874776,0.00035290828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013391026,0.000756795,0.0007770144,0.0011125946,0.0005315674,0.00077712163,0.004881083,0.00041708088,0.00008002095],"category_scores_gemma":[0.0001795857,0.000725149,0.00023814003,0.0011152384,0.0010278164,0.0010043235,0.0024200159,0.0012995154,0.00013243523],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030203923,0.000053272634,0.000040322866,0.00005143563,0.000016185762,0.000051092567,0.0010855122,0.0018217954,0.00013060498,0.094887964,0.000031706895,0.9018271],"study_design_scores_gemma":[0.00042354394,0.00013501059,0.00014463488,0.0005170791,0.00001495475,0.00020171635,4.3307452e-7,0.70517206,0.0012686441,0.2845777,0.006208533,0.001335731],"about_ca_topic_score_codex":0.000022820095,"about_ca_topic_score_gemma":0.000052993262,"teacher_disagreement_score":0.90049136,"about_ca_system_score_codex":0.00028132685,"about_ca_system_score_gemma":0.0004601554,"threshold_uncertainty_score":0.99951994},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029073823,0.000049202376,0.99464524,0.00017698715,0.0007136122,0.00076158595,0.000019116414,0.000013108543,0.00071375945],"genre_scores_gemma":[0.93123066,0.000026196776,0.067063704,0.0008368854,0.00022402605,0.00002866617,0.000025651858,0.000022590686,0.000541641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768746,0.00004353026,0.00040497122,0.000773441,0.0007193705,0.0003712553],"domain_scores_gemma":[0.997805,0.0005898903,0.00044287715,0.0009409187,0.0001868217,0.00003450457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016120572,0.00027601587,0.00030545585,0.00019164075,0.00022871592,0.00009925303,0.0020187285,0.0001552928,0.0000070575284],"category_scores_gemma":[0.000072349445,0.0002049656,0.00012421179,0.00017121539,0.0002619385,0.00060958514,0.0007394637,0.0004069826,0.00001304673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010273272,0.0001253318,0.00023437881,0.0002154613,0.000055951623,0.0000044073477,0.003411295,0.022534909,0.07430873,0.106516905,0.000055782464,0.7924341],"study_design_scores_gemma":[0.0002302067,0.00130426,0.00033775024,0.00046893023,0.000012113337,0.000012462315,6.614047e-7,0.85760766,0.13073307,0.00791624,0.0010320586,0.00034458333],"about_ca_topic_score_codex":0.0000051336633,"about_ca_topic_score_gemma":0.0000020990053,"teacher_disagreement_score":0.92832327,"about_ca_system_score_codex":0.00019299172,"about_ca_system_score_gemma":0.00026442416,"threshold_uncertainty_score":0.83582544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046598534,0.0009019047,0.99240375,0.00027740677,0.0009139023,0.0004070968,0.0000035160276,0.00012781502,0.0003047866],"genre_scores_gemma":[0.32716033,0.000017408438,0.6716866,0.0004994489,0.0004306689,0.0000034996133,0.0000013245826,0.000027597795,0.00017310299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969811,0.000025484396,0.0003493769,0.0014736498,0.00058513,0.0005852944],"domain_scores_gemma":[0.99788845,0.0005051249,0.00026852926,0.0010364699,0.00015041848,0.00015099875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078687276,0.00042183336,0.0004909819,0.000453621,0.00036278454,0.0004641676,0.0015802636,0.00026030125,0.000002636895],"category_scores_gemma":[0.000060805425,0.00039799183,0.00009747536,0.00020936033,0.000268426,0.00045481225,0.0017653704,0.0003523266,0.0000034908094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014387086,0.000012998572,0.00013495532,0.0002847628,0.00002187462,0.00006902533,0.0039084023,0.4568029,0.0021410284,0.10835126,0.000012150591,0.42824626],"study_design_scores_gemma":[0.00017949894,0.00004207196,0.000014509025,0.00024459904,0.000010652046,0.00007639172,2.2003515e-7,0.928688,0.0013310958,0.068866655,0.000121360936,0.0004249424],"about_ca_topic_score_codex":0.000066262306,"about_ca_topic_score_gemma":0.00012693983,"teacher_disagreement_score":0.47188511,"about_ca_system_score_codex":0.0003327118,"about_ca_system_score_gemma":0.00018616255,"threshold_uncertainty_score":0.9998472},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006264286,0.0003095366,0.9803907,0.0026832016,0.0033064727,0.0008376845,0.0025870346,0.000102552374,0.009720135],"genre_scores_gemma":[0.052551236,0.0002448047,0.8968768,0.019680785,0.0031959452,0.00001546358,0.004959987,0.00017141434,0.022303531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98454285,0.00038193402,0.0023482433,0.0057082395,0.0061176587,0.0009011055],"domain_scores_gemma":[0.9727358,0.0040671355,0.0012083309,0.021253863,0.00048478672,0.0002500763],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.039560933,0.00068451517,0.0012904822,0.0010778289,0.00035237035,0.0021355061,0.031405266,0.0003983438,0.00007898422],"category_scores_gemma":[0.0066046556,0.0005411217,0.00012739259,0.0010216347,0.0012195876,0.0024681552,0.034709774,0.0011211113,0.0005962455],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027044181,0.00005735486,0.00008901255,0.00009290673,0.00002513983,0.00001559363,0.00030669617,0.023997057,0.000037372156,0.04619346,0.0014053066,0.92775303],"study_design_scores_gemma":[0.00026512262,0.000036302965,0.000057499736,0.0001614134,0.000019653293,0.0000045818238,0.000003941423,0.64696336,0.00003948657,0.31625083,0.035467703,0.00073011126],"about_ca_topic_score_codex":0.0002381147,"about_ca_topic_score_gemma":0.001486263,"teacher_disagreement_score":0.92702293,"about_ca_system_score_codex":0.00018813269,"about_ca_system_score_gemma":0.0017870524,"threshold_uncertainty_score":0.999704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005448688,0.00013766442,0.9961935,0.00014159844,0.0008671498,0.00049133645,0.00007529766,0.00021682966,0.001331736],"genre_scores_gemma":[0.3284161,0.00004615949,0.6668519,0.0020799048,0.0010055725,0.00005567751,0.00043032414,0.000198312,0.0009160634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981528,0.000011966874,0.0003276155,0.0007089832,0.00035461623,0.00044403298],"domain_scores_gemma":[0.9989848,0.00024842293,0.000082008075,0.00041109277,0.00016879314,0.00010488545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023199989,0.00044709767,0.00044683157,0.0007919452,0.00009190837,0.00014737241,0.00046064323,0.00033062528,0.00022117046],"category_scores_gemma":[0.00004474647,0.0004172094,0.00026484762,0.00023627082,0.00015379972,0.00009811562,0.000055406395,0.0005844013,0.00015950295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008189568,0.000015974489,0.000011530589,0.00017231255,0.000023218694,0.00000466498,0.00011372928,0.3942163,0.0027265537,0.000009257501,0.00005571792,0.60264254],"study_design_scores_gemma":[0.00065632304,0.00009189888,0.00011644018,0.0004315673,0.00005168187,0.000008841248,2.6102674e-7,0.98800635,0.0028393222,0.0036656554,0.003435532,0.000696127],"about_ca_topic_score_codex":0.000005860059,"about_ca_topic_score_gemma":0.00014259755,"teacher_disagreement_score":0.6019464,"about_ca_system_score_codex":0.00018328706,"about_ca_system_score_gemma":0.000112402246,"threshold_uncertainty_score":0.999828},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032656757,0.00023533816,0.9939719,0.00044077836,0.0021086878,0.00049078465,0.0000036935865,0.0005110519,0.0022051327],"genre_scores_gemma":[0.2226852,0.00018391704,0.76732594,0.005299147,0.0010314273,0.000024901425,0.000018138178,0.00015025213,0.0032810473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996107,0.000026432657,0.0006024138,0.0017988342,0.00078415393,0.0006811557],"domain_scores_gemma":[0.99697345,0.00016316863,0.0003389557,0.0020432225,0.00031231283,0.00016888337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007708366,0.00058389717,0.0005761749,0.0013565964,0.00020548204,0.0010254034,0.0044631055,0.0003469349,0.000031328593],"category_scores_gemma":[0.000027671656,0.0005769396,0.000192512,0.00078240794,0.00041011279,0.00074717816,0.0027004513,0.0007160127,0.00006776455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003154063,0.000036372112,0.00018344713,0.00009088817,0.00001740999,0.000038666552,0.00050174515,0.0017254138,0.00045075963,0.24887696,0.000108591856,0.7479666],"study_design_scores_gemma":[0.00015582693,0.00018625187,0.00009795727,0.00029233468,0.0000040384066,0.000036865637,2.7777194e-8,0.903799,0.0014726555,0.08794907,0.0052854144,0.00072055444],"about_ca_topic_score_codex":0.000023352248,"about_ca_topic_score_gemma":0.000023144436,"teacher_disagreement_score":0.9020736,"about_ca_system_score_codex":0.00022476693,"about_ca_system_score_gemma":0.00057922263,"threshold_uncertainty_score":0.9996682},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030766052,0.0005013203,0.9966805,0.000095449446,0.0010312779,0.0006635107,0.0000059043537,0.00014387508,0.0005704845],"genre_scores_gemma":[0.72589386,0.000096623604,0.27325004,0.00046465715,0.0001323373,0.0000121441835,0.000004663308,0.00003537784,0.000110328954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973549,0.000020000301,0.0005021715,0.0011684276,0.00055203715,0.00040242934],"domain_scores_gemma":[0.9977131,0.00054148666,0.00037590077,0.0009148681,0.00035072057,0.00010391878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073677016,0.0003840776,0.0005737352,0.0009061654,0.00013467477,0.0003119718,0.0015917557,0.00023159086,0.0000020562165],"category_scores_gemma":[0.000052659147,0.00036516794,0.00012203202,0.00045321055,0.0004890935,0.00015366459,0.0010998677,0.00027311448,0.000001136486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010345189,0.000040922343,0.00009953024,0.00028250998,0.000023974933,0.0000067697515,0.0016063162,0.009665416,0.00030523923,0.71294737,0.000024223613,0.2749874],"study_design_scores_gemma":[0.0002951197,0.00029744927,0.0000834868,0.00041643548,0.00000579735,0.00001732977,3.171619e-7,0.8921225,0.005042936,0.100923,0.0003626809,0.00043291977],"about_ca_topic_score_codex":0.000010222618,"about_ca_topic_score_gemma":0.0000136133895,"teacher_disagreement_score":0.88245714,"about_ca_system_score_codex":0.00009526865,"about_ca_system_score_gemma":0.00041514682,"threshold_uncertainty_score":0.99988},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012878089,0.0010898114,0.99167424,0.00069239375,0.0007333764,0.00021755206,0.000007843626,0.00028818258,0.005283734],"genre_scores_gemma":[0.2226727,0.0006855087,0.7578271,0.0018538747,0.002656942,0.00010178915,0.000030276284,0.00026910545,0.013902718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888045,0.0000036335705,0.00014751664,0.00037016667,0.00032257175,0.00027565326],"domain_scores_gemma":[0.99907374,0.0002251756,0.000057879235,0.0005106207,0.00008834455,0.000044243694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019610178,0.00023745382,0.00015674438,0.00012306166,0.00022702606,0.00028094105,0.0008201747,0.000213264,0.00001930212],"category_scores_gemma":[0.000021028594,0.00017634449,0.000056315876,0.00016372073,0.0002494727,0.00012392223,0.00014019516,0.00082882016,0.000056777255],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004975961,0.0000064501974,0.000013206318,0.00007940093,0.000015526744,0.000006582326,0.00010811215,0.08017886,0.0014405792,0.004135481,0.0029199289,0.9110909],"study_design_scores_gemma":[0.00009445246,0.000030324863,0.000058392856,0.0002450761,0.000009886363,0.000047810376,1.1546964e-7,0.69325644,0.0062838923,0.060474653,0.23894654,0.00055242446],"about_ca_topic_score_codex":0.0000019642086,"about_ca_topic_score_gemma":0.000016181913,"teacher_disagreement_score":0.9105385,"about_ca_system_score_codex":0.00016377431,"about_ca_system_score_gemma":0.00014043639,"threshold_uncertainty_score":0.719112},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033686473,0.00007248072,0.9946099,0.00031105426,0.001688116,0.0006715778,0.000049402326,0.00025024716,0.0020103399],"genre_scores_gemma":[0.075110205,0.000020751559,0.9191335,0.0013547674,0.0016422126,0.000032355147,0.0004171682,0.000057552363,0.0022315204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996293,0.000054211276,0.00049373804,0.0018596039,0.0007409473,0.00055846974],"domain_scores_gemma":[0.99765784,0.00034663506,0.00044975287,0.0008451358,0.00055474625,0.00014588887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005731246,0.00052403915,0.0006235647,0.0019064813,0.0006892378,0.00086803164,0.001291035,0.0004440625,0.00013118621],"category_scores_gemma":[0.00003903885,0.00052972493,0.0003891768,0.0013621646,0.00015571427,0.0010555332,0.00033235742,0.0008154343,0.00013503876],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002646488,0.00004092456,0.00004768265,0.000013382194,0.00014430705,0.0000063785924,0.00028276176,0.013161904,0.00068374904,0.0019576123,0.00004824719,0.9836104],"study_design_scores_gemma":[0.00048416102,0.00017660699,0.00034650462,0.00017486946,0.00020501897,0.000019411644,5.3520097e-7,0.90625274,0.0023340778,0.08845366,0.0008558628,0.00069654046],"about_ca_topic_score_codex":0.00012724331,"about_ca_topic_score_gemma":0.00040438463,"teacher_disagreement_score":0.98291385,"about_ca_system_score_codex":0.0004066337,"about_ca_system_score_gemma":0.00028150063,"threshold_uncertainty_score":0.99971545},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08278601,0.0005998626,0.90044844,0.00042687927,0.0037708713,0.00052767684,0.000015119641,0.00033735452,0.0110877985],"genre_scores_gemma":[0.93554527,0.0000072464554,0.059621047,0.0010682956,0.0012847944,0.000014666076,0.00013839632,0.00014884806,0.0021714184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938849,0.001341263,0.00061728276,0.0023878368,0.00073552073,0.0010331988],"domain_scores_gemma":[0.99235994,0.005721746,0.0006593119,0.0009383997,0.0001845635,0.00013604907],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025601052,0.00088892377,0.0011305779,0.0009828726,0.0005846326,0.00033981568,0.001420116,0.0009198132,0.00031536358],"category_scores_gemma":[0.00094795873,0.0008431875,0.00028587758,0.0004938,0.00083377387,0.00024618063,0.0008071434,0.0064316248,0.00029639137],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019892187,0.000049086706,0.02825178,0.000021363201,0.00031249094,0.00034480897,0.058998108,0.068121955,0.0038248508,0.00092771335,0.0000233963,0.83892554],"study_design_scores_gemma":[0.00876359,0.0068248515,0.41023612,0.013037796,0.00075410836,0.0002704122,0.00033532982,0.42016712,0.0052723014,0.11330642,0.008379933,0.012652005],"about_ca_topic_score_codex":0.0015712956,"about_ca_topic_score_gemma":0.00006667561,"teacher_disagreement_score":0.8527593,"about_ca_system_score_codex":0.00041593047,"about_ca_system_score_gemma":0.00026308553,"threshold_uncertainty_score":0.99940187},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004489372,0.00036248268,0.990485,0.00068688474,0.00043962704,0.0014179798,0.000016349311,0.000037401303,0.0020649112],"genre_scores_gemma":[0.9612537,0.000025942087,0.036814667,0.0007351646,0.00013237822,0.00008312529,0.000055405024,0.00003544064,0.0008641986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971619,0.00007643354,0.00042221462,0.0009615433,0.0008721111,0.0005057822],"domain_scores_gemma":[0.9982518,0.00036759098,0.00024090479,0.0006290488,0.00029863123,0.00021201145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012153098,0.00026823924,0.00048287987,0.00035433308,0.0001234111,0.000040725536,0.00075579213,0.00024462436,0.00005887114],"category_scores_gemma":[0.000069623056,0.00021218004,0.00006549723,0.0001803589,0.00087763893,0.0001266206,0.00012689848,0.0007161148,0.0000075513435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021213741,0.00028186958,0.0011823695,0.00028126972,0.000021928452,0.0000019434246,0.00842844,0.12683512,0.0000124749695,0.006830894,0.000038992897,0.8558726],"study_design_scores_gemma":[0.00064195454,0.004582798,0.00093018345,0.00081901555,0.0000100706275,0.000028659068,0.00008074781,0.96105987,0.000026580698,0.031110832,0.000287371,0.00042190534],"about_ca_topic_score_codex":0.00034098362,"about_ca_topic_score_gemma":0.0014234888,"teacher_disagreement_score":0.9567643,"about_ca_system_score_codex":0.00019287482,"about_ca_system_score_gemma":0.00695171,"threshold_uncertainty_score":0.99867797},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057866275,0.0007077727,0.93983227,0.000067460875,0.0004475677,0.00017370278,0.0001531501,0.0000036521815,0.0007481348],"genre_scores_gemma":[0.8907686,0.0001579805,0.10815375,0.00023954692,0.0004429418,0.000002338313,0.00013951599,0.000016759592,0.00007859303],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976519,0.0000403573,0.00045911837,0.0011712326,0.00038831658,0.00028911812],"domain_scores_gemma":[0.99742705,0.00007214241,0.00032876045,0.0018775371,0.00023477052,0.0000597635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009491452,0.0002958801,0.000567516,0.00020331626,0.000105051666,0.000041234853,0.001389087,0.00022253394,0.000027923646],"category_scores_gemma":[0.000049878934,0.00026650412,0.00013055868,0.00023896608,0.00070377125,0.0000029622367,0.0017803723,0.00016022396,0.0000017543591],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102424485,0.00019000415,0.025222164,0.00041595873,0.0042834226,0.000038506623,0.0013983006,0.077020444,0.5778718,0.002101967,0.00026689816,0.31108811],"study_design_scores_gemma":[0.0044789463,0.0043566627,0.18438819,0.0007475581,0.003393081,0.00009689325,0.000012542241,0.31068844,0.25922495,0.2035912,0.019969298,0.009052242],"about_ca_topic_score_codex":0.00017739067,"about_ca_topic_score_gemma":0.0008177711,"teacher_disagreement_score":0.8329023,"about_ca_system_score_codex":0.00007576822,"about_ca_system_score_gemma":0.00036150098,"threshold_uncertainty_score":0.9999787},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045636197,0.00059566775,0.98170996,0.0021852131,0.0020899584,0.0005025056,0.0000040475993,0.00015103247,0.012305261],"genre_scores_gemma":[0.24519336,0.000086191496,0.7468573,0.0040286058,0.0010248179,0.000026427204,0.000023233732,0.000051336792,0.0027087044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533856,0.000060294253,0.0006906167,0.0017698575,0.001362279,0.00077836774],"domain_scores_gemma":[0.9974951,0.00044566536,0.0003020873,0.0011946791,0.00032497587,0.00023749757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010250972,0.0005886862,0.00054909574,0.0013260719,0.00020233636,0.00097093283,0.0034864368,0.00035280344,0.000091273345],"category_scores_gemma":[0.00012257976,0.00057520956,0.00013778901,0.0013750264,0.0003586304,0.0011153312,0.0013816062,0.0007806759,0.0003069375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005325299,0.00005270705,0.000090798814,0.000030212674,0.000010099439,0.00010713421,0.00045130518,0.1779006,0.00020736502,0.16606255,0.00024053504,0.65484136],"study_design_scores_gemma":[0.00042968543,0.00017392988,0.0009739462,0.00031384613,0.0000050574326,0.000119068915,1.7393624e-7,0.6960709,0.00071731396,0.29273576,0.007546039,0.00091429806],"about_ca_topic_score_codex":0.00008190601,"about_ca_topic_score_gemma":0.00025109798,"teacher_disagreement_score":0.6539271,"about_ca_system_score_codex":0.0004989768,"about_ca_system_score_gemma":0.00084289897,"threshold_uncertainty_score":0.9996699},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003865866,0.00042000628,0.9950163,0.00060378865,0.0017001824,0.0008332583,0.000016830816,0.00042557516,0.00094541133],"genre_scores_gemma":[0.07985134,0.000055184864,0.91808295,0.0006030063,0.00061567914,0.00008560431,0.000012420745,0.000073742835,0.0006200508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583524,0.000020780524,0.000573526,0.0020121925,0.0008007904,0.00075749273],"domain_scores_gemma":[0.9970673,0.0005491402,0.00022085471,0.0016888662,0.00030674576,0.00016711678],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009623966,0.0005044691,0.0005220357,0.00072197797,0.0002456565,0.0003656132,0.003543906,0.0002951001,0.0000021376438],"category_scores_gemma":[0.00012398988,0.0004795005,0.00019089089,0.0004386525,0.00018694154,0.0006111621,0.0015337602,0.0006530205,0.00003079998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035206626,0.000007575064,3.1592305e-7,0.000027770006,0.000005678511,0.000009120844,0.0016514735,0.58582085,0.000025714002,0.041829508,0.0000041488756,0.37061432],"study_design_scores_gemma":[0.00016141828,0.000060597926,2.769255e-7,0.00022918018,0.0000041189137,0.0000058958694,4.985273e-7,0.6852047,0.00013014127,0.31380075,0.000040376388,0.0003620789],"about_ca_topic_score_codex":0.000027084498,"about_ca_topic_score_gemma":0.000086080516,"teacher_disagreement_score":0.37025222,"about_ca_system_score_codex":0.00030652457,"about_ca_system_score_gemma":0.0003929858,"threshold_uncertainty_score":0.9997657},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031510685,0.0004082094,0.97880733,0.000086237815,0.0054054926,0.0006852541,0.0000022005277,0.00030841067,0.013981756],"genre_scores_gemma":[0.96326065,0.000045387762,0.035005216,0.00026601308,0.00044958558,0.000013496442,0.000016700435,0.0000359172,0.0009070041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630713,0.000050018953,0.0006826216,0.0012252402,0.0011096578,0.0006253113],"domain_scores_gemma":[0.99725777,0.00025522232,0.00056540576,0.0013972629,0.00038448675,0.0001398623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086466386,0.0004940082,0.00068078184,0.0010830329,0.00017062946,0.00037669626,0.0027635472,0.0004104592,0.000019273119],"category_scores_gemma":[0.00006793934,0.000415726,0.00023660062,0.0009395312,0.000508672,0.0007172503,0.0007417401,0.0004888944,0.00006792353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018024604,0.00004963725,0.0004977668,0.00013421976,0.00003187042,0.000027443608,0.0016251111,0.001320326,0.00050352083,0.6872563,0.000030458117,0.30850536],"study_design_scores_gemma":[0.0008629708,0.0008065535,0.0004794529,0.00014966809,0.000025941396,0.00012642794,6.243146e-7,0.04463206,0.008227631,0.93954927,0.0040384913,0.0011009134],"about_ca_topic_score_codex":0.0002050342,"about_ca_topic_score_gemma":0.000081538754,"teacher_disagreement_score":0.9629456,"about_ca_system_score_codex":0.00013776905,"about_ca_system_score_gemma":0.0007569614,"threshold_uncertainty_score":0.9998295},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6486313,0.0014004558,0.34061384,0.0025341026,0.0012267657,0.001962886,0.00018846715,0.000010254939,0.0034319826],"genre_scores_gemma":[0.9985293,0.00015661026,0.0009247038,0.00017666863,0.00015425523,0.000010978621,0.0000027013352,0.000018633818,0.000026145188],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978161,0.00006222445,0.001026422,0.0006382589,0.000095986026,0.00036104475],"domain_scores_gemma":[0.9890243,0.008543424,0.001532175,0.0008357277,0.000040835464,0.000023559605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006090912,0.0003104028,0.0009025451,0.0006479107,0.00044006784,0.00030973816,0.0024217109,0.00017422569,0.000020765827],"category_scores_gemma":[0.00038962136,0.00014616373,0.0004302773,0.0006231305,0.0015117284,0.00021036963,0.0006343662,0.0005213309,0.0000015057336],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005755542,0.000022135804,0.75238025,0.00011191028,0.00059336954,3.3642053e-7,0.015006053,0.13924843,7.095296e-7,0.02095056,0.0000030758163,0.07162562],"study_design_scores_gemma":[0.0007132301,0.00007136775,0.1661441,0.00010503295,0.00018205371,0.0000019963802,0.00008512013,0.73606396,0.000025234009,0.0958317,0.00036763266,0.00040859316],"about_ca_topic_score_codex":0.001456844,"about_ca_topic_score_gemma":0.0017709197,"teacher_disagreement_score":0.5968155,"about_ca_system_score_codex":0.00018956552,"about_ca_system_score_gemma":0.00014012532,"threshold_uncertainty_score":0.59603834},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005406902,0.0003092679,0.98503333,0.0043321257,0.0027978767,0.0007564228,0.000022716848,0.0014410517,0.0047665252],"genre_scores_gemma":[0.24396458,0.000078961755,0.7540349,0.0012639348,0.00024081732,0.00001274241,0.000033302596,0.00006850619,0.00030228175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928654,0.00008586511,0.0008112365,0.0036069916,0.0013705161,0.0012599898],"domain_scores_gemma":[0.9751957,0.00060246256,0.0004905303,0.023043662,0.00042179448,0.00024583665],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001534129,0.0009148871,0.00094895926,0.0013012044,0.00029552323,0.0010791674,0.08128857,0.00085783645,0.000056707806],"category_scores_gemma":[0.0043254634,0.0008693754,0.00015184059,0.0014877488,0.0012797953,0.002383831,0.11746413,0.0018323679,0.00028018135],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018874493,0.000096987475,0.00006615628,0.00008676634,0.000024705283,0.000089298504,0.00040659143,0.0015430204,0.0009966799,0.009018828,0.0012054386,0.9864467],"study_design_scores_gemma":[0.00024182223,0.00024963034,0.0001228229,0.0002760663,0.0000059189847,0.00003196224,1.128665e-7,0.5530413,0.008636941,0.43411782,0.0024823374,0.0007932901],"about_ca_topic_score_codex":0.000033654185,"about_ca_topic_score_gemma":0.000054238048,"teacher_disagreement_score":0.98565334,"about_ca_system_score_codex":0.00047507675,"about_ca_system_score_gemma":0.0014932076,"threshold_uncertainty_score":0.9999578},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035837707,0.0007526533,0.99244773,0.00047674926,0.0011096532,0.00029145207,0.0000028935228,0.00010457166,0.0012305176],"genre_scores_gemma":[0.9504093,0.00019991159,0.04845814,0.00057098124,0.00013511599,0.0000043764503,0.000008770159,0.00001698177,0.00019642871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976045,0.000032806314,0.00037001696,0.0011237421,0.00046260646,0.00040632836],"domain_scores_gemma":[0.9982185,0.00047487763,0.00019447261,0.0009340126,0.00010137381,0.00007681134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007809316,0.00033701034,0.00037237667,0.0007708677,0.00013014398,0.00045653526,0.0014954859,0.00025234974,0.0000055235805],"category_scores_gemma":[0.000080081634,0.00031066767,0.0000442654,0.000532749,0.00053003366,0.0008516471,0.00050469674,0.00047809683,0.000040471634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048939896,0.00003009668,0.00084667467,0.00007684893,0.000005709358,0.00005941777,0.0013627786,0.028628603,0.00088059454,0.49471933,0.000005504119,0.47337955],"study_design_scores_gemma":[0.00033019864,0.000088615685,0.0058789323,0.0004423517,0.000005211043,0.00005636725,4.898408e-7,0.7781983,0.0021366386,0.21115093,0.0009998513,0.0007121024],"about_ca_topic_score_codex":0.000028056036,"about_ca_topic_score_gemma":0.000058672493,"teacher_disagreement_score":0.9468255,"about_ca_system_score_codex":0.0001441443,"about_ca_system_score_gemma":0.00035048864,"threshold_uncertainty_score":0.99993455},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007927391,0.00027760016,0.9878781,0.0003009598,0.005509133,0.0005370811,0.00000772455,0.00026492277,0.005145221],"genre_scores_gemma":[0.014825892,0.00008901215,0.98327446,0.00059844746,0.00059724326,0.000008504204,0.000015462507,0.000043365708,0.00054761284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955098,0.000074485826,0.0006303558,0.0019450937,0.0011448174,0.0006954721],"domain_scores_gemma":[0.99580675,0.00027103667,0.00045387202,0.003022262,0.0002766256,0.00016947492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018705707,0.0005329869,0.00048507986,0.0010018063,0.00027277926,0.00058488786,0.004124789,0.00037530463,0.000026590687],"category_scores_gemma":[0.00021017344,0.00052127766,0.0001196835,0.0008180983,0.00054797094,0.0022961546,0.0017426799,0.0011237351,0.00025440435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010165735,0.000029442721,0.000017789105,0.00010016221,0.000010831828,0.000029620598,0.00062794937,0.019816218,0.0023528503,0.18094397,0.000055004064,0.796006],"study_design_scores_gemma":[0.00035364827,0.00022018718,0.00011052004,0.00066691963,0.000015250131,0.00030005467,3.9254093e-7,0.8843583,0.011677075,0.09362809,0.0073974454,0.0012721433],"about_ca_topic_score_codex":0.000019811352,"about_ca_topic_score_gemma":0.000008336466,"teacher_disagreement_score":0.86454207,"about_ca_system_score_codex":0.0005027709,"about_ca_system_score_gemma":0.00070943026,"threshold_uncertainty_score":0.99972385},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036181067,0.000229102,0.9960819,0.0012167053,0.00074873277,0.00037277673,0.000011958807,0.00027146263,0.0007055397],"genre_scores_gemma":[0.4521841,0.00027280263,0.5418143,0.0021219852,0.0009323548,0.00004636716,0.00011670744,0.0000962839,0.0024150764],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965946,0.00003159949,0.00033918477,0.0015994321,0.00089980464,0.0005353636],"domain_scores_gemma":[0.9982079,0.0002441113,0.00028228643,0.0008242787,0.00028839457,0.00015297256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007308725,0.0004430354,0.0003995888,0.00025759262,0.00048400622,0.00070493453,0.0014289897,0.00024840824,0.000005387947],"category_scores_gemma":[0.0001315909,0.00035286095,0.00005192598,0.0008835783,0.00089163764,0.00076596707,0.0012089452,0.0005813517,0.000011971931],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019602798,0.000034989847,0.0021448967,0.0002732494,0.000021451835,0.00009645657,0.0013156598,0.0172972,0.00012220112,0.05411725,0.00025866547,0.92429835],"study_design_scores_gemma":[0.00067078695,0.00048530026,0.023458095,0.0021086915,0.000041905863,0.0002449065,5.6646184e-7,0.26895973,0.00241238,0.69799006,0.0015222159,0.0021053532],"about_ca_topic_score_codex":0.000028075521,"about_ca_topic_score_gemma":0.00010750979,"teacher_disagreement_score":0.92219305,"about_ca_system_score_codex":0.00022117468,"about_ca_system_score_gemma":0.00048300374,"threshold_uncertainty_score":0.99989235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008041102,0.00035363127,0.9910157,0.00059088593,0.0014512831,0.00033748554,0.000012180271,0.00020253834,0.0052322135],"genre_scores_gemma":[0.534009,0.00015512026,0.45964178,0.0047780583,0.00037696096,0.0000064357173,0.0000078833,0.00007227036,0.0009524948],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964579,0.000038520193,0.00044500202,0.0016345556,0.0007571882,0.00066687306],"domain_scores_gemma":[0.9975677,0.00049511046,0.0002617103,0.0013697275,0.0001125049,0.00019326052],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006983113,0.00054376794,0.00059906807,0.0005900216,0.00020949933,0.00070281595,0.0029626014,0.00021890715,0.000017499411],"category_scores_gemma":[0.00004190496,0.00048246974,0.00009890536,0.00031660197,0.0011611738,0.00071728375,0.0023223737,0.000678591,0.000069715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071020086,0.00002959084,0.00014080844,0.00012724126,0.000016320748,0.00017383751,0.0012837282,0.0006522043,0.0004068181,0.2504204,0.000023839544,0.7467181],"study_design_scores_gemma":[0.00029187909,0.00017482834,0.0005866833,0.0002587849,0.0000048493634,0.0001442295,1.08220426e-7,0.2861033,0.001243825,0.7100332,0.00043528987,0.0007230401],"about_ca_topic_score_codex":0.000026198002,"about_ca_topic_score_gemma":0.000022870892,"teacher_disagreement_score":0.7459951,"about_ca_system_score_codex":0.000098223616,"about_ca_system_score_gemma":0.00039842454,"threshold_uncertainty_score":0.9997627},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019460083,0.000055873505,0.9949228,0.00040864377,0.00076959893,0.0008507944,0.000025769015,0.00013861682,0.0028084],"genre_scores_gemma":[0.21833599,0.00002436951,0.7791092,0.0015597515,0.00026040658,0.000033743963,0.00011176205,0.000031004696,0.0005338062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971889,0.000020279886,0.00039679144,0.0012436096,0.0006655194,0.00048485206],"domain_scores_gemma":[0.997851,0.0004596285,0.0002979594,0.0008783982,0.00037388268,0.000139096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004934466,0.00040985763,0.00041853767,0.0003393431,0.00023921086,0.0004483989,0.0014224092,0.00026137763,0.000053141313],"category_scores_gemma":[0.00003073115,0.000355027,0.000095906566,0.00031813548,0.0005534933,0.0006369722,0.00036858872,0.00048633286,0.000012223006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016150738,0.000013514172,0.00045182282,0.000026002772,0.000013482617,0.000006424476,0.000075006086,0.7771589,0.000002595825,0.07558385,0.00004026624,0.14661194],"study_design_scores_gemma":[0.0004337454,0.00022254823,0.0011151307,0.00015664926,0.0000089934365,0.000054640048,1.03346416e-7,0.96840364,0.000045764707,0.027943645,0.0011050772,0.00051006506],"about_ca_topic_score_codex":0.0000065713825,"about_ca_topic_score_gemma":0.000103226055,"teacher_disagreement_score":0.21831653,"about_ca_system_score_codex":0.00022393173,"about_ca_system_score_gemma":0.00087844545,"threshold_uncertainty_score":0.99989015},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040703084,0.00016044275,0.9893992,0.006314399,0.001313356,0.00058932794,0.00003363302,0.00007012819,0.0017124951],"genre_scores_gemma":[0.9563928,0.000027117485,0.039473727,0.0038803515,0.00019404695,0.000007340313,0.0000021007393,0.000017471462,0.000005018623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966391,0.0001321331,0.0005093706,0.0011607831,0.0011726026,0.00038603865],"domain_scores_gemma":[0.99509776,0.0016162862,0.0003636823,0.0026503874,0.0001722352,0.00009963047],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0013923098,0.0003913502,0.00047611707,0.00020481461,0.00037280368,0.00028617852,0.0063694855,0.00019234829,0.000016635151],"category_scores_gemma":[0.00043982972,0.0002155957,0.00030697836,0.0012161941,0.0015932105,0.00031528485,0.0022543035,0.0011117196,0.000014926525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050524653,0.0000640184,0.000090524874,0.00005139176,0.000014117638,0.000014532069,0.0016618848,0.0020633014,0.00016959522,0.86512756,0.00007322305,0.13061933],"study_design_scores_gemma":[0.00046254703,0.00019306825,0.00048268624,0.00031915397,0.000011426103,0.00001181492,3.7339206e-7,0.25785282,0.003156517,0.7328741,0.004215784,0.0004196904],"about_ca_topic_score_codex":0.00003162557,"about_ca_topic_score_gemma":0.00008046668,"teacher_disagreement_score":0.9559858,"about_ca_system_score_codex":0.00007579878,"about_ca_system_score_gemma":0.00048475078,"threshold_uncertainty_score":0.9990065},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09325347,0.0003377966,0.90155,0.00006738298,0.00044087926,0.00027584707,0.000023115206,0.000016488126,0.0040350403],"genre_scores_gemma":[0.9798705,0.000026740674,0.019025216,0.00049928314,0.00023563321,5.5290514e-7,0.00003988216,0.000015878471,0.00028630334],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984234,0.000018579443,0.000307253,0.0006948607,0.0002352998,0.0003205909],"domain_scores_gemma":[0.99906474,0.00005861336,0.0001995575,0.00049869454,0.00012130106,0.00005706135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003509585,0.00024716932,0.00033344995,0.00010525652,0.00006213368,0.000033465567,0.00068016635,0.0002076139,0.000016628002],"category_scores_gemma":[0.000052849224,0.000198574,0.000104704755,0.000094308605,0.00072153006,0.0000035168719,0.00075941393,0.00024813606,0.000008234049],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090502486,0.000066787,0.0034219888,0.0001977736,0.000052638985,0.00002181947,0.000141476,0.0434618,0.3288253,0.0030917486,0.00006114493,0.620567],"study_design_scores_gemma":[0.0015547499,0.0036817533,0.0068632727,0.0008928034,0.00004132556,0.000095059186,9.1240594e-7,0.102175884,0.5774436,0.28473914,0.01955261,0.0029589115],"about_ca_topic_score_codex":0.000020869264,"about_ca_topic_score_gemma":0.000052129235,"teacher_disagreement_score":0.88661706,"about_ca_system_score_codex":0.000027186508,"about_ca_system_score_gemma":0.00016900411,"threshold_uncertainty_score":0.8097613},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1901201,0.00027224104,0.80243844,0.0020607545,0.0034407375,0.00090569747,0.000036766625,0.0000866671,0.00063861243],"genre_scores_gemma":[0.9813095,0.000114883755,0.017667666,0.00036759878,0.0004846493,0.000022630265,0.000016135637,0.000013304977,0.0000036364545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588865,0.00042896703,0.0004593722,0.0011800668,0.0013428367,0.0007000895],"domain_scores_gemma":[0.9968599,0.00062512344,0.00049434794,0.0014548342,0.00038545465,0.00018031462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036067576,0.00030346322,0.00047502643,0.00086212583,0.00039131715,0.00044931978,0.0036628484,0.00044889768,0.0000439728],"category_scores_gemma":[0.004014166,0.00028445374,0.00012811489,0.0017204245,0.0014083931,0.00054428173,0.0031004178,0.0011101204,0.000031187374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080580285,0.00092119793,0.031132154,0.0005403804,0.00008220438,0.00004080549,0.07671071,0.08792406,0.00068642676,0.027051605,0.0003875191,0.7744424],"study_design_scores_gemma":[0.0008500569,0.0005501723,0.027520549,0.0010328349,0.000033226177,0.0000069920484,0.000058369016,0.06595961,0.009174793,0.8908378,0.0023625728,0.0016130563],"about_ca_topic_score_codex":0.004976999,"about_ca_topic_score_gemma":0.0013349755,"teacher_disagreement_score":0.86378616,"about_ca_system_score_codex":0.0004354686,"about_ca_system_score_gemma":0.0018609917,"threshold_uncertainty_score":0.9999608},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006206244,0.0002549599,0.99457026,0.00046828267,0.0019427557,0.00047733236,0.000007668947,0.00026203337,0.0013960692],"genre_scores_gemma":[0.37237912,0.00004859523,0.62584853,0.00070379087,0.00024180187,0.000017160963,0.000009968237,0.000053939882,0.00069707556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967721,0.00004562721,0.0006238146,0.0011979176,0.0009123499,0.00044816837],"domain_scores_gemma":[0.9978246,0.00032631223,0.0004450881,0.0011271707,0.00020854181,0.00006825565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007572344,0.00037518222,0.0004956714,0.0011994567,0.00007077214,0.00020995185,0.002138826,0.00026985168,0.000014577917],"category_scores_gemma":[0.000050509316,0.0003744027,0.000091238406,0.0009404325,0.00035860253,0.00089026697,0.00079668965,0.00053794816,0.00005613379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001216008,0.000036694306,0.00059774116,0.000135884,0.000011956862,0.000039971852,0.0011992378,0.14468724,0.007291519,0.0015995756,0.000118637174,0.8442694],"study_design_scores_gemma":[0.00046319017,0.00026005303,0.0016683268,0.00060468254,0.0000058163023,0.00003274736,3.8520363e-7,0.93297046,0.037455242,0.02560059,0.0003932591,0.000545266],"about_ca_topic_score_codex":0.00007998761,"about_ca_topic_score_gemma":0.00012809156,"teacher_disagreement_score":0.84372413,"about_ca_system_score_codex":0.0005091441,"about_ca_system_score_gemma":0.00061428087,"threshold_uncertainty_score":0.9998708},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006912016,0.0001830686,0.9859741,0.00043936397,0.007146653,0.0004624985,0.0000039705014,0.00025322833,0.005468017],"genre_scores_gemma":[0.02735437,0.000015040008,0.969778,0.0014249375,0.0004649832,0.0000061314054,0.000008009516,0.00004030705,0.0009082237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956102,0.000058933678,0.0005912053,0.001698157,0.0013454028,0.00069614156],"domain_scores_gemma":[0.99641657,0.0005988273,0.00043076856,0.0020873994,0.0003045204,0.00016194208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018997885,0.00054140727,0.0005188654,0.0010825241,0.00023019458,0.0006882875,0.0043787374,0.0004215172,0.00004796685],"category_scores_gemma":[0.0002349303,0.0005202461,0.00016345864,0.0007104707,0.00051178975,0.00095847086,0.0009197839,0.0009534311,0.00043886193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008745649,0.000022424365,0.0001963469,0.00009562576,0.000009565011,0.000022669828,0.000416533,0.065087594,0.00057892007,0.12549752,0.000050896146,0.80801314],"study_design_scores_gemma":[0.00025529708,0.00012933332,0.0003490811,0.00037438198,0.0000066688926,0.000026161013,7.445623e-8,0.9394962,0.0042862017,0.051061142,0.0033218064,0.000693611],"about_ca_topic_score_codex":0.00001013522,"about_ca_topic_score_gemma":0.000010833663,"teacher_disagreement_score":0.87440866,"about_ca_system_score_codex":0.00057620317,"about_ca_system_score_gemma":0.00090035255,"threshold_uncertainty_score":0.9997249},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118549824,0.0009788669,0.87770736,0.0004132532,0.0015805375,0.00045415797,0.00007341739,0.00011042709,0.00013217528],"genre_scores_gemma":[0.7279627,0.000043254375,0.2713012,0.0005614128,0.00008964384,0.000008887317,0.00001828483,0.0000141026,5.3664826e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954556,0.00012051747,0.00086003984,0.001844638,0.0011559417,0.00056326645],"domain_scores_gemma":[0.99684775,0.00052379107,0.0005571045,0.0015088395,0.00028297032,0.000279553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069312216,0.00044235302,0.00068283983,0.0009872357,0.00010156342,0.0010241136,0.0025698699,0.00023410318,0.000005591757],"category_scores_gemma":[0.00019907451,0.00040348244,0.00022654621,0.001127396,0.0017922341,0.0013957645,0.006252731,0.0008861322,0.0000092026285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019757592,0.000734075,0.0070402473,0.00023325052,0.000054791017,0.00008429467,0.0011367247,0.13750406,0.00017987457,0.006967191,0.00041492065,0.8456308],"study_design_scores_gemma":[0.0004720692,0.00021735833,0.04150832,0.00040441912,0.000012608793,0.000057829835,0.0000010718825,0.75414246,0.003269215,0.19925846,0.000026536312,0.0006296141],"about_ca_topic_score_codex":0.00001908541,"about_ca_topic_score_gemma":0.0000027370122,"teacher_disagreement_score":0.8450012,"about_ca_system_score_codex":0.0000956159,"about_ca_system_score_gemma":0.00076771795,"threshold_uncertainty_score":0.9998417},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059084468,0.00034426316,0.93720084,0.0004928274,0.0002484994,0.0017951573,0.0000039540055,0.000053528976,0.0007764599],"genre_scores_gemma":[0.6170838,0.0000034121347,0.38230965,0.00024979212,0.00009387037,0.00004192845,0.00001836677,0.000045484194,0.00015373217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976313,0.000041763564,0.00042433865,0.0010497124,0.0003916535,0.00046119833],"domain_scores_gemma":[0.99606526,0.0031289947,0.00020946602,0.00031344118,0.00016903735,0.00011381989],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008348719,0.00038256176,0.000704843,0.0008092316,0.00019252083,0.00007076033,0.0001873588,0.00020341636,0.000017692097],"category_scores_gemma":[0.0002796571,0.00029985592,0.000105532425,0.00024913807,0.00061723613,0.00020186845,0.00019908324,0.000757735,0.0000023430873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016791597,0.00021211014,0.072340496,0.003690888,0.00007068078,0.00006024182,0.03683444,0.45363367,0.0010114871,0.0003640631,0.00002575817,0.430077],"study_design_scores_gemma":[0.006225953,0.0051631047,0.041329823,0.02064674,0.00006251906,0.00008342365,0.00036396596,0.91993886,0.00078145217,0.0038784521,0.00036712136,0.0011585793],"about_ca_topic_score_codex":0.000008515087,"about_ca_topic_score_gemma":0.00005955791,"teacher_disagreement_score":0.5579993,"about_ca_system_score_codex":0.00034713664,"about_ca_system_score_gemma":0.00043845174,"threshold_uncertainty_score":0.99994534},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010982482,0.0001828138,0.96090204,0.017910656,0.0021342605,0.0017760665,0.000020465812,0.00023246024,0.005858764],"genre_scores_gemma":[0.8567344,0.000047787646,0.13831589,0.0030124849,0.00090718566,0.00003271883,0.000007572233,0.00005060651,0.0008913832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99650407,0.00022236511,0.00045950746,0.0012420898,0.00072069437,0.00085127866],"domain_scores_gemma":[0.9951451,0.0035865714,0.00047200362,0.0003911201,0.0002582671,0.00014695169],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003183463,0.00038554,0.0007231674,0.0007427823,0.0004576011,0.0004489978,0.0015620157,0.00097235426,0.000060915234],"category_scores_gemma":[0.0029611255,0.00035035357,0.00010598977,0.00065093173,0.001706616,0.0005280089,0.0004212186,0.00083294336,0.000030110044],"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.0006319216,0.00025294657,0.0017749427,0.0003843234,0.00013376994,0.000169898,0.1773305,0.01043187,0.0008249009,0.4707586,0.00088980614,0.33641654],"study_design_scores_gemma":[0.002103415,0.00081585866,0.003094198,0.000622237,0.000059291517,0.000012819542,0.0011006318,0.003585679,0.00062932796,0.95605904,0.029665533,0.002251967],"about_ca_topic_score_codex":0.0003441414,"about_ca_topic_score_gemma":0.018721096,"teacher_disagreement_score":0.8457519,"about_ca_system_score_codex":0.0004854571,"about_ca_system_score_gemma":0.0021212867,"threshold_uncertainty_score":0.99989486},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26970333,0.0006198089,0.017061839,0.004218511,0.0073559685,0.0045226,0.000043906515,0.00028362425,0.6961904],"genre_scores_gemma":[0.98756087,0.00001058416,0.00069661345,0.00035961936,0.00096431863,0.000003640241,0.0000036048552,0.000027163063,0.010373596],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99643594,0.00007962846,0.00030521458,0.0010707582,0.0014919406,0.0006165046],"domain_scores_gemma":[0.99889535,0.0003892009,0.00014080941,0.00030924878,0.00007419744,0.00019119799],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014592834,0.00034072477,0.0004899714,0.0005031165,0.00018996623,0.0006487493,0.0008831681,0.0003237735,0.00006785308],"category_scores_gemma":[0.00020036122,0.0003021598,0.00006540574,0.00028626318,0.00081769767,0.00049146113,0.000368009,0.000734542,0.000026065796],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070474714,0.00039983628,0.08595024,0.000043649678,0.000036889,0.00022716822,0.14475979,0.0012353838,0.0000143276675,0.021100566,0.00014354322,0.7460181],"study_design_scores_gemma":[0.004199779,0.004283193,0.31833747,0.0015531221,0.00018062376,0.00003504778,0.0009968331,0.011879462,0.000118163705,0.09161724,0.5617388,0.005060286],"about_ca_topic_score_codex":0.00008920334,"about_ca_topic_score_gemma":0.0018751654,"teacher_disagreement_score":0.74095786,"about_ca_system_score_codex":0.00016846624,"about_ca_system_score_gemma":0.00033403482,"threshold_uncertainty_score":0.9999431},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28165424,0.0002089986,0.6534764,0.0006941629,0.0051268945,0.00067787454,0.00012601918,0.00007535327,0.057960045],"genre_scores_gemma":[0.99100214,0.0000053537765,0.002535209,0.00015340679,0.00040533522,0.000008019429,0.000033357624,0.000023495859,0.005833684],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99776804,0.00005492144,0.0003285332,0.0008507532,0.000545594,0.0004521729],"domain_scores_gemma":[0.9985304,0.0002696361,0.00013978808,0.00074283715,0.00022083685,0.00009652225],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000408427,0.00030535483,0.00041576006,0.0006348588,0.00010521931,0.000047175854,0.0008429881,0.00036551233,0.0015775725],"category_scores_gemma":[0.000054804786,0.00024396421,0.0001988819,0.00018532008,0.00050434493,0.00007364257,0.00021806557,0.000839267,0.0002965663],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009957735,0.0007425487,0.16171898,0.0001488207,0.0005078038,0.0001104589,0.072665855,0.049057964,0.00042298783,0.045884404,0.0036186748,0.66412574],"study_design_scores_gemma":[0.0022441384,0.004932917,0.9134931,0.0012175812,0.00004386918,0.00043700836,0.000017250451,0.066388555,0.00011060043,0.0093560945,0.00014659775,0.0016122913],"about_ca_topic_score_codex":0.0005093707,"about_ca_topic_score_gemma":0.0012918635,"teacher_disagreement_score":0.75177413,"about_ca_system_score_codex":0.00025283688,"about_ca_system_score_gemma":0.00050250173,"threshold_uncertainty_score":0.9993351},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020470543,0.00077118765,0.9968193,0.0002217003,0.00022417211,0.0012376514,0.000034023284,0.000060167742,0.00042709868],"genre_scores_gemma":[0.014555516,0.000070060196,0.9846255,0.00021820309,0.00016796679,0.00009261775,0.000010360371,0.000029062676,0.00023067238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973846,0.000022613265,0.00038494277,0.0011858619,0.000538848,0.00048313546],"domain_scores_gemma":[0.99749434,0.0005295255,0.00019652832,0.0012738536,0.00036883482,0.00013691743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053618103,0.00032355502,0.00044144446,0.00094732025,0.00022528475,0.00014987456,0.0021491824,0.00019004126,0.0000032837072],"category_scores_gemma":[0.000028312834,0.00031455184,0.00013575854,0.00060837506,0.0008799929,0.00039217476,0.00090241747,0.00038775604,0.0000059979234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007739016,0.00003738877,0.000039790266,0.000102621285,0.000022514818,0.0000038525445,0.00012330581,0.018732013,0.0065872245,0.62216216,0.000003939148,0.35217744],"study_design_scores_gemma":[0.00023762562,0.00012925065,0.000036015135,0.0000834597,0.0000048329634,0.000028520992,7.58524e-8,0.5154938,0.001938855,0.4808867,0.0008878765,0.000273001],"about_ca_topic_score_codex":0.0000045282163,"about_ca_topic_score_gemma":0.0000075800413,"teacher_disagreement_score":0.49676177,"about_ca_system_score_codex":0.00008728703,"about_ca_system_score_gemma":0.00036398385,"threshold_uncertainty_score":0.9999307},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027760486,0.00026028155,0.96505886,0.0041599176,0.0036982717,0.0015744687,0.000028450546,0.0006376478,0.02180604],"genre_scores_gemma":[0.6126719,0.000031848554,0.1415267,0.22098318,0.017898494,0.00012580275,0.00041445016,0.0004905755,0.0058570085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658453,0.000013756793,0.00064195844,0.0013530212,0.0007659347,0.00064078183],"domain_scores_gemma":[0.99703974,0.0005443194,0.0005195436,0.0009993919,0.0008656722,0.000031335774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020757157,0.0005213475,0.00066738046,0.000649206,0.00033840723,0.00053038227,0.00134836,0.00036697456,0.00010792578],"category_scores_gemma":[0.00021191036,0.0004959896,0.0002732614,0.0006317719,0.00021712347,0.001056632,0.00092044915,0.0006007212,0.00029854465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036808284,0.00031493974,0.0036475519,0.012644085,0.00021697953,0.000052808766,0.003229101,0.13402039,0.00019775299,0.36437106,0.0010328807,0.47990438],"study_design_scores_gemma":[0.0011123039,0.000052533072,0.0029135013,0.0011527343,0.00010007446,0.000005218285,0.0000069940043,0.73493516,0.000067574,0.18586257,0.07194006,0.0018512878],"about_ca_topic_score_codex":0.00078239903,"about_ca_topic_score_gemma":0.0017986738,"teacher_disagreement_score":0.82353216,"about_ca_system_score_codex":0.00019160658,"about_ca_system_score_gemma":0.0002631024,"threshold_uncertainty_score":0.9997492},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020308414,0.00046814795,0.9830454,0.000667968,0.004139877,0.0006521288,0.000008153331,0.000111895664,0.010703335],"genre_scores_gemma":[0.81431943,0.00014193675,0.15945767,0.002413911,0.002575779,0.000092062204,0.00012606154,0.00013156822,0.020741595],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755883,0.000054933345,0.00045281192,0.0010896139,0.00049292913,0.00035085515],"domain_scores_gemma":[0.99781895,0.0005015456,0.000334838,0.0009913569,0.0002873615,0.00006597998],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007185015,0.00032006935,0.00028877184,0.0005632594,0.00011985993,0.00014638247,0.0006757631,0.00035147837,0.0003342372],"category_scores_gemma":[0.00010293602,0.00031674473,0.000079460006,0.00030257815,0.00038127234,0.00014065525,0.00008460088,0.00054913206,0.0010174105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005317628,0.0001419207,0.00032545102,0.000046490102,0.00003241537,0.000010401616,0.0036467544,0.016643725,0.0003060749,0.13795842,0.00071343133,0.84012175],"study_design_scores_gemma":[0.0018215536,0.0015216672,0.05179193,0.0012342177,0.00016509631,0.00034648855,0.000017141689,0.2734774,0.0012720352,0.5706815,0.093734324,0.0039366],"about_ca_topic_score_codex":0.000025763333,"about_ca_topic_score_gemma":0.00000962393,"teacher_disagreement_score":0.83618516,"about_ca_system_score_codex":0.0003740786,"about_ca_system_score_gemma":0.00043671948,"threshold_uncertainty_score":0.9999285},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048812333,0.0005548349,0.98810226,0.00077280466,0.002364427,0.0007139048,0.000010912735,0.00016378125,0.0068289735],"genre_scores_gemma":[0.46687737,0.00036461517,0.52717954,0.0036205794,0.00082882046,0.000031731222,0.000021864647,0.0001220822,0.00095340115],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99410087,0.00007300393,0.0007294884,0.0024209674,0.0014698217,0.0012058385],"domain_scores_gemma":[0.9965665,0.0005906224,0.0002145464,0.0021143446,0.00028121937,0.0002327899],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015349374,0.0007304975,0.0008660584,0.0023455517,0.00022614599,0.000582476,0.005411704,0.0005053627,0.000045079254],"category_scores_gemma":[0.000051776562,0.0007042629,0.00025824577,0.0017021231,0.001042591,0.00070502004,0.002567983,0.002000456,0.0001385573],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000188463,0.00012846422,0.001216648,0.00014076241,0.000029705798,0.0007361816,0.0019989312,0.042789,0.00016703093,0.19939665,0.000028690403,0.75334907],"study_design_scores_gemma":[0.0005888621,0.00029548234,0.0020158524,0.0008298939,0.000006175169,0.00018297072,8.4338325e-7,0.4856455,0.000623194,0.5072906,0.001269271,0.0012513656],"about_ca_topic_score_codex":0.00014087062,"about_ca_topic_score_gemma":0.00024980077,"teacher_disagreement_score":0.7520977,"about_ca_system_score_codex":0.00044959178,"about_ca_system_score_gemma":0.0012052149,"threshold_uncertainty_score":0.9999695},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023522847,0.0014612597,0.98972195,0.0005925209,0.0022219263,0.00036765749,0.000004508842,0.00026679313,0.0030110667],"genre_scores_gemma":[0.63281834,0.00017538157,0.36435124,0.0014798582,0.00008345709,0.000005664559,0.00000711831,0.00006564469,0.0010133034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99578804,0.000029219798,0.0005338326,0.0018476045,0.0010906765,0.00071064883],"domain_scores_gemma":[0.9974924,0.0004131701,0.00033131515,0.0012659521,0.0002664893,0.00023067956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011863603,0.0005434368,0.00054457167,0.0008614637,0.00030934092,0.00095559796,0.0022833014,0.0003341217,0.000006943123],"category_scores_gemma":[0.00009162138,0.00048907433,0.000106268126,0.0005152609,0.0006112607,0.00052620354,0.0016899281,0.0010181596,0.000044863285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006734133,0.000041288742,0.0009050179,0.00012006399,0.00002726438,0.00012724899,0.001337529,0.019070502,0.00033320396,0.62540615,0.000050298557,0.3525747],"study_design_scores_gemma":[0.00036450036,0.00017547848,0.00015422053,0.000579729,0.000010827698,0.00007692449,2.257768e-7,0.24552113,0.00031311729,0.7512872,0.0007770249,0.00073958543],"about_ca_topic_score_codex":0.00005388129,"about_ca_topic_score_gemma":0.000049331145,"teacher_disagreement_score":0.63046604,"about_ca_system_score_codex":0.00009973159,"about_ca_system_score_gemma":0.00038778718,"threshold_uncertainty_score":0.9997561},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037682615,0.00038523859,0.97521293,0.00060803007,0.00092154735,0.00096570957,0.0000024800634,0.00033437516,0.021192878],"genre_scores_gemma":[0.14073204,0.000016338636,0.84789234,0.0042018397,0.0011135003,0.000086740554,0.000008607397,0.00012885495,0.005819741],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99480724,0.00003641172,0.00069927465,0.0023722162,0.0010559522,0.0010288784],"domain_scores_gemma":[0.9967809,0.00046810697,0.00036366304,0.0019684264,0.00016527204,0.00025367475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001493023,0.0007168899,0.0006805271,0.000923547,0.0003497912,0.00056187646,0.005268594,0.00030690475,0.000021476011],"category_scores_gemma":[0.00005344504,0.0006506668,0.00035579148,0.0006045953,0.00047617988,0.000077144,0.0034292368,0.0006496822,0.00007083627],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002772909,0.000080186226,0.000004588903,0.00018458476,0.000110381516,0.00018369965,0.0012425043,0.03892091,0.00010294546,0.13662316,0.00020860153,0.8223107],"study_design_scores_gemma":[0.0009940066,0.0003603389,0.000010236692,0.0011010439,0.0001036842,0.00010921069,0.0000015550688,0.45787734,0.005445142,0.4713747,0.060750004,0.0018727345],"about_ca_topic_score_codex":0.000015041502,"about_ca_topic_score_gemma":0.0000039233864,"teacher_disagreement_score":0.82043797,"about_ca_system_score_codex":0.00029872294,"about_ca_system_score_gemma":0.00014594778,"threshold_uncertainty_score":0.99959445},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089637555,0.000050917308,0.89801675,0.006929492,0.001938701,0.000882413,0.000040113115,0.00025170247,0.0022523669],"genre_scores_gemma":[0.8815463,0.000002721336,0.104583465,0.010658458,0.0002481061,0.000013764435,0.0000035793387,0.000059791502,0.0028838045],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9933692,0.00006563317,0.0010038823,0.0021406855,0.002549922,0.00087068224],"domain_scores_gemma":[0.99592006,0.0008764489,0.00038765266,0.0017289562,0.00074158056,0.0003453005],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027765608,0.0005741513,0.00082708563,0.0029158127,0.00054270605,0.0008632313,0.005104334,0.0006416671,0.00016764761],"category_scores_gemma":[0.0012423766,0.0005124445,0.00018439315,0.002030375,0.0005966021,0.0004669009,0.0024869777,0.0012896258,0.0016949499],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027361297,0.000047082292,0.024448678,0.0000076364695,0.000007072742,0.00008918674,0.0031720987,0.024060516,0.0009336617,0.009449425,0.0006875869,0.9370697],"study_design_scores_gemma":[0.0022665346,0.0021521486,0.5597387,0.0031680728,0.0001406979,0.0005348573,0.000063079504,0.018703373,0.004554213,0.23603381,0.16308498,0.00955953],"about_ca_topic_score_codex":0.000039051898,"about_ca_topic_score_gemma":0.00018708361,"teacher_disagreement_score":0.92751014,"about_ca_system_score_codex":0.0004352838,"about_ca_system_score_gemma":0.00044690305,"threshold_uncertainty_score":0.99973273},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020509951,0.0005427187,0.865758,0.00024435157,0.0010229929,0.00027592573,0.000002289711,0.00014956843,0.12995315],"genre_scores_gemma":[0.9473824,0.000017204457,0.006639266,0.0015447204,0.0006409827,0.00001074677,0.00001153813,0.00008323418,0.043669917],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978043,0.00003440458,0.0002048765,0.0010335663,0.00045813466,0.00046474833],"domain_scores_gemma":[0.9988034,0.0003731195,0.00018742277,0.00037102288,0.00019017028,0.00007486706],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002914749,0.00036064937,0.0003682089,0.0003886225,0.00015179238,0.00012941647,0.000651685,0.000248837,0.0006549774],"category_scores_gemma":[0.000050180523,0.0002756478,0.00005689994,0.0002807013,0.0005866535,0.00010979715,0.00018938186,0.0012186929,0.000820593],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006323053,0.000031464744,0.0021821011,0.000043069453,0.00003183388,0.00012393949,0.0027618671,0.009749791,0.000019630123,0.0037802807,0.00001700333,0.9811958],"study_design_scores_gemma":[0.015772766,0.049389858,0.06671078,0.022478146,0.0007142048,0.0034615488,0.00014220556,0.08807979,0.0038302038,0.26739317,0.46033153,0.021695815],"about_ca_topic_score_codex":0.000019915013,"about_ca_topic_score_gemma":0.00005880366,"teacher_disagreement_score":0.95949996,"about_ca_system_score_codex":0.000058794758,"about_ca_system_score_gemma":0.000266902,"threshold_uncertainty_score":0.99996954},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6142292,0.00053008826,0.35680258,0.021936066,0.002597294,0.0026527918,0.0000041686244,0.00031845222,0.00092934567],"genre_scores_gemma":[0.9935715,0.000075229356,0.0053467546,0.0006959507,0.00013640046,0.000020133031,0.0000015324928,0.00002242728,0.0001300341],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975047,0.000119115655,0.00040749618,0.0009098719,0.00047623165,0.0005825666],"domain_scores_gemma":[0.9985567,0.00029526738,0.00017730749,0.0007229654,0.00017710692,0.000070692295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025158452,0.00030201554,0.00029266888,0.0009953175,0.0004810153,0.00029509424,0.0017395035,0.00044385428,0.000011402579],"category_scores_gemma":[0.0003990549,0.00020724883,0.000050570197,0.0007974941,0.0018090785,0.0002980521,0.001027918,0.0011656095,0.000022401082],"study_design_candidate":"design_other","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.0000173762,0.000027206286,0.0043081506,0.000024868616,0.000015663014,0.000017752125,0.026118811,0.0033034242,0.0005512159,0.037797004,0.000005234846,0.9278133],"study_design_scores_gemma":[0.0024740128,0.0020092814,0.030187374,0.009131729,0.00022291772,0.00030104557,0.005212778,0.15979755,0.011780323,0.7574771,0.016508585,0.0048973258],"about_ca_topic_score_codex":0.0006581533,"about_ca_topic_score_gemma":0.03533591,"teacher_disagreement_score":0.922916,"about_ca_system_score_codex":0.0005534835,"about_ca_system_score_gemma":0.0002694973,"threshold_uncertainty_score":0.9822667},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007623535,0.00028778604,0.98497146,0.0009842984,0.00316939,0.00041076538,0.0000037653415,0.0009776755,0.009118633],"genre_scores_gemma":[0.40154886,0.000087770146,0.59416926,0.0025223466,0.00073776394,0.000010324421,0.000026097694,0.00006821845,0.00082936377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960549,0.000045665325,0.000616637,0.0017337314,0.00095949124,0.00058960734],"domain_scores_gemma":[0.99649996,0.00048208845,0.00040576834,0.002148655,0.00032097186,0.0001425344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010239626,0.00047081884,0.00046545002,0.0007467853,0.00030227323,0.00059418584,0.0039249766,0.00040099854,0.00003138935],"category_scores_gemma":[0.000100361765,0.00047849363,0.00013407141,0.00078959524,0.0004076652,0.0006951223,0.0009544639,0.0007720168,0.00042496467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008006532,0.000055112785,0.00007667283,0.00009106864,0.000021511996,0.000031804946,0.0015917135,0.0677839,0.0004965915,0.24617213,0.00015392272,0.6835176],"study_design_scores_gemma":[0.00020602615,0.00006991073,0.0003489684,0.00022029603,0.000005094853,0.00004713226,1.6635113e-7,0.9640194,0.0008099612,0.027994798,0.0056947544,0.00058347324],"about_ca_topic_score_codex":0.0000151113,"about_ca_topic_score_gemma":0.000008078745,"teacher_disagreement_score":0.8962355,"about_ca_system_score_codex":0.00043548143,"about_ca_system_score_gemma":0.00092630606,"threshold_uncertainty_score":0.99976665},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070122816,0.00012918425,0.99282473,0.00072023674,0.0010942405,0.0017950706,0.00004367306,0.00018245562,0.0025092056],"genre_scores_gemma":[0.40536237,0.00005303239,0.5901226,0.0023018592,0.0012252543,0.00017894608,0.000119457676,0.000116707175,0.00051979383],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99379045,0.00010676904,0.0007407042,0.0024151262,0.0016508512,0.0012961006],"domain_scores_gemma":[0.99461305,0.0010859314,0.0002899841,0.0026998203,0.00091367034,0.000397549],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0050788014,0.0005866356,0.00070445036,0.001461228,0.0013707238,0.0029144227,0.010174677,0.00039920927,0.00007131489],"category_scores_gemma":[0.00019237577,0.0005487252,0.00014655218,0.0011683368,0.00096510653,0.0013861164,0.004377406,0.0012959562,0.000024489897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025997673,0.000100760524,0.000032217275,0.000078841374,0.00001826497,0.000014533864,0.006160161,0.0011997347,0.000071633876,0.3830149,0.0004548435,0.6088281],"study_design_scores_gemma":[0.0007697753,0.0010141068,0.000054190426,0.00019650455,0.000007540913,0.00004151252,0.0000034466736,0.39376917,0.00040831082,0.55332667,0.049609512,0.00079928664],"about_ca_topic_score_codex":0.00016099623,"about_ca_topic_score_gemma":0.0014820859,"teacher_disagreement_score":0.6080288,"about_ca_system_score_codex":0.00030256854,"about_ca_system_score_gemma":0.000814315,"threshold_uncertainty_score":0.99992937},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000089550325,0.0003226663,0.98373985,0.002108214,0.0041325274,0.0007735994,0.000015311234,0.0001880327,0.008630235],"genre_scores_gemma":[0.4388536,0.000020355044,0.54968905,0.0053521227,0.0012627556,0.000014739118,0.000016326823,0.000078824705,0.004712213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99491656,0.00007824264,0.0005426655,0.002253,0.0012238844,0.000985647],"domain_scores_gemma":[0.9962871,0.0004560541,0.00031554032,0.0021721916,0.00041844504,0.00035068902],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00067886786,0.0008682151,0.0010340571,0.0008708466,0.00039350058,0.0015794463,0.0049900278,0.00023648697,0.000054745662],"category_scores_gemma":[0.000064503096,0.0007750617,0.00024672836,0.0006725661,0.0004894583,0.0007715136,0.0024120384,0.0007814162,0.0002164273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002750768,0.00008524989,0.00027349993,0.00007428441,0.00007153274,0.00014325054,0.0018293689,0.5717321,0.00089380663,0.016035993,0.002784087,0.4060493],"study_design_scores_gemma":[0.00045364758,0.0002676727,0.0006654015,0.00046962808,0.000019114916,0.000036352543,4.6212472e-7,0.9600875,0.000865097,0.017536739,0.018077215,0.0015212031],"about_ca_topic_score_codex":0.000056885245,"about_ca_topic_score_gemma":0.00046964467,"teacher_disagreement_score":0.43876404,"about_ca_system_score_codex":0.00027248118,"about_ca_system_score_gemma":0.0005468965,"threshold_uncertainty_score":0.99947006},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001656631,0.0003596328,0.99166715,0.0011642305,0.00028809402,0.00053117785,0.0000027795027,0.0009519359,0.0033783917],"genre_scores_gemma":[0.49447995,0.000016810049,0.5038659,0.00041225873,0.0004076814,0.00003290312,0.000031820644,0.00011130356,0.0006413482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939128,0.0002791411,0.0005682864,0.0024407464,0.0017036514,0.0010953848],"domain_scores_gemma":[0.9959734,0.000675042,0.00056650775,0.0016711514,0.0006153887,0.0004985213],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018569162,0.00089111144,0.0007869523,0.0009690173,0.0008317595,0.0010776547,0.004337818,0.000442441,0.000027600696],"category_scores_gemma":[0.00035028296,0.0007672975,0.00013803769,0.0010658447,0.0007491455,0.000813634,0.001378023,0.003783666,0.000083829706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009480142,0.000026051606,0.00074805046,0.000017770444,0.0000138236655,0.00004524261,0.0017516027,0.49241522,0.00007277543,0.0012869872,0.0000021086773,0.5036109],"study_design_scores_gemma":[0.00064204616,0.0010771129,0.0017775476,0.00029006423,0.000022565888,0.0001283121,0.0000020298319,0.95164055,0.00016460387,0.04086651,0.0021171204,0.0012715657],"about_ca_topic_score_codex":0.00023882686,"about_ca_topic_score_gemma":0.0001997927,"teacher_disagreement_score":0.5023393,"about_ca_system_score_codex":0.0004950558,"about_ca_system_score_gemma":0.00068090163,"threshold_uncertainty_score":0.99995935},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002499668,0.00028910625,0.9876518,0.000031700696,0.0061791567,0.00011654241,0.000003864358,0.003957117,0.0015207098],"genre_scores_gemma":[0.70629835,0.00077857677,0.26424757,0.00052479596,0.011944071,0.000091272916,0.00021441786,0.0010925579,0.014808419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985635,0.000006268972,0.00022571834,0.00042811167,0.00032813972,0.00044823164],"domain_scores_gemma":[0.9993831,0.00012143579,0.000028420036,0.00034981908,0.00003645924,0.0000807645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024780154,0.00028394852,0.0002542683,0.00057045504,0.00006767637,0.000118568496,0.00048827747,0.00024716978,0.000005215106],"category_scores_gemma":[0.00003648788,0.00029292333,0.00005266748,0.000803363,0.000112814996,0.000118043805,0.00009560647,0.0005935759,0.00009169229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.5617473e-7,0.0000016161671,0.0000027239578,0.00008166708,0.000006028137,0.000016449587,0.00013945339,0.94154423,0.0002580269,0.00001411655,0.00069122185,0.05724418],"study_design_scores_gemma":[0.00005737914,0.00001280364,0.000047543697,0.00031512717,0.0000049384635,0.000019427449,5.8729892e-8,0.9937384,0.0017237266,0.0020115147,0.0017489862,0.0003200804],"about_ca_topic_score_codex":0.000006705199,"about_ca_topic_score_gemma":0.000014936223,"teacher_disagreement_score":0.7234043,"about_ca_system_score_codex":0.0004067106,"about_ca_system_score_gemma":0.00014196448,"threshold_uncertainty_score":0.9999523},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14106672,0.0022903061,0.7903977,0.0007529979,0.0040627676,0.0013580532,0.00009653851,0.00007949436,0.05989541],"genre_scores_gemma":[0.99481654,0.000009436183,0.003360683,0.00029104296,0.00027947588,0.0000011083757,0.0000036889523,0.00002937675,0.0012086574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979403,0.000038869588,0.0008455213,0.0007054062,0.00010485269,0.00036505554],"domain_scores_gemma":[0.99807304,0.00065078726,0.00064832775,0.0005380952,0.000052113523,0.000037663547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019433459,0.00028940855,0.00077376474,0.0005230299,0.00011594575,0.00013243027,0.0010277344,0.00020915657,0.000092939605],"category_scores_gemma":[0.000072039074,0.00024704737,0.000106018524,0.0003040647,0.00046682282,0.00014561188,0.00035507235,0.00060845603,0.00023581697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011157179,0.00013816907,0.0071163992,0.000354087,0.00012951295,0.00004495412,0.027423497,0.25047386,0.0005139657,0.6169849,0.00010446755,0.096604615],"study_design_scores_gemma":[0.0011333842,0.00029365957,0.0026917146,0.0017582362,0.000009084433,0.00004260235,0.0000064882297,0.77822584,0.0005885088,0.21152559,0.0024953648,0.0012295368],"about_ca_topic_score_codex":0.00014395405,"about_ca_topic_score_gemma":0.00004385113,"teacher_disagreement_score":0.8537498,"about_ca_system_score_codex":0.00016559233,"about_ca_system_score_gemma":0.00012105074,"threshold_uncertainty_score":0.99999815},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016184651,0.0012210803,0.9874264,0.0014434247,0.0024406188,0.000424005,0.00003098308,0.00015305007,0.0068442705],"genre_scores_gemma":[0.09211573,0.00033629988,0.8937009,0.001968523,0.005194157,0.000024114039,0.00009655341,0.00012392622,0.0064397883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586886,0.000068415495,0.0005192817,0.0015426243,0.0012630703,0.0007377499],"domain_scores_gemma":[0.9951144,0.0017043601,0.00042333355,0.002348342,0.00024499735,0.0001645718],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00087636325,0.0005392407,0.00052686327,0.00031553695,0.00063379266,0.0008646553,0.005827371,0.00025795345,0.0000109498305],"category_scores_gemma":[0.000115841845,0.00036680506,0.00014306714,0.0005075552,0.00082382455,0.0011282585,0.0031019973,0.0012305863,0.00015370472],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000489154,0.000011297492,0.00027250868,0.000018311763,0.000023985765,0.00006260727,0.000573907,0.0039651464,0.000027673668,0.13214941,0.00026348582,0.8626268],"study_design_scores_gemma":[0.000722713,0.00030183446,0.0007840846,0.0010566202,0.00002427287,0.000037805286,7.7938097e-7,0.53502953,0.0004141922,0.3106351,0.14946131,0.0015317933],"about_ca_topic_score_codex":0.000027774717,"about_ca_topic_score_gemma":0.000082783234,"teacher_disagreement_score":0.86109495,"about_ca_system_score_codex":0.0002627822,"about_ca_system_score_gemma":0.00056949304,"threshold_uncertainty_score":0.9998784},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015937255,0.00030760025,0.99492526,0.0003306881,0.0032593263,0.0005838901,0.000014759275,0.00010503123,0.0003140728],"genre_scores_gemma":[0.56688714,0.00001666087,0.42756715,0.0014155966,0.0038203148,0.000011876859,0.000010040941,0.00004570836,0.0002254804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959338,0.00010065046,0.00060929963,0.0017428643,0.0008632925,0.00075009454],"domain_scores_gemma":[0.99707353,0.0003744992,0.00037525428,0.0013518911,0.00062758144,0.00019723296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011009213,0.0005963679,0.00064158073,0.00050864817,0.00048729862,0.00095140503,0.0022017562,0.0003126777,0.0000656459],"category_scores_gemma":[0.00031614292,0.00053642364,0.00015689713,0.0005505087,0.0009065728,0.0007877489,0.00070755096,0.0004862723,0.00006427282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088238685,0.000038726663,0.000031213538,0.000033684955,0.000037134156,0.00006175454,0.00042262577,0.8496134,0.0017369497,0.0048391214,0.0002523894,0.14292413],"study_design_scores_gemma":[0.00029760896,0.000144673,0.000028833278,0.00016714353,0.000027134178,0.00004165038,5.2142568e-8,0.9587069,0.00133335,0.03806619,0.0005985066,0.00058795477],"about_ca_topic_score_codex":0.000026963786,"about_ca_topic_score_gemma":0.00008640308,"teacher_disagreement_score":0.5673581,"about_ca_system_score_codex":0.00048014795,"about_ca_system_score_gemma":0.0006626579,"threshold_uncertainty_score":0.9997087},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059081434,0.00032850725,0.986688,0.00022267511,0.0007876085,0.00030666805,0.00007849797,0.0003071161,0.011221804],"genre_scores_gemma":[0.0629592,0.00008147117,0.9186538,0.006889672,0.0024281654,0.000070392234,0.0003519618,0.00016701971,0.008398329],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99650633,0.000094214534,0.0004152878,0.001483254,0.00088734325,0.0006135603],"domain_scores_gemma":[0.99701655,0.000791547,0.00033263324,0.0014950822,0.00021697672,0.00014719299],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012352918,0.0005297166,0.00045317403,0.0003323394,0.00025479402,0.00049131375,0.0031120384,0.00035717493,0.0011726228],"category_scores_gemma":[0.000116307776,0.0004618144,0.00013013961,0.0004480423,0.001076603,0.000814033,0.0011254383,0.0005394091,0.00047010818],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071243044,0.00003358576,0.000003025663,0.000024984132,0.000020526004,0.00005170275,0.0015116604,0.00011649445,0.00034146657,0.07432103,0.0036169156,0.9199515],"study_design_scores_gemma":[0.00020644699,0.000110092406,0.000015715246,0.00036784212,0.000010105721,0.00012270553,0.0000013211597,0.14051154,0.007471907,0.839691,0.010667825,0.0008235101],"about_ca_topic_score_codex":0.0000082868355,"about_ca_topic_score_gemma":0.0000070662,"teacher_disagreement_score":0.91912794,"about_ca_system_score_codex":0.000208123,"about_ca_system_score_gemma":0.00019136122,"threshold_uncertainty_score":0.99978334},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008143626,0.0004884193,0.9964793,0.00006592873,0.0011974358,0.0005591819,0.000025704901,0.0003780771,0.000724555],"genre_scores_gemma":[0.0045997878,0.000028179076,0.9940843,0.00020557771,0.00079578644,0.00003202497,0.00006972668,0.00009293178,0.000091664886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795353,0.000008438634,0.00037626934,0.00072299794,0.0004789284,0.00045980525],"domain_scores_gemma":[0.9987378,0.00020309415,0.00011441285,0.00049743155,0.00031751874,0.00012972181],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004760012,0.00047166253,0.0004181878,0.0006049767,0.00019240235,0.00025126233,0.00058009324,0.0002399685,0.000040612074],"category_scores_gemma":[0.000048246387,0.00041040836,0.000089601366,0.00040873096,0.00036997386,0.00021947507,0.000082986975,0.0004607044,0.0000152256625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009016434,0.0000065513495,0.000003221107,0.00005848017,0.0000216125,0.0000036408,0.00043388145,0.8880228,0.000025604986,0.00019873274,0.000003802395,0.1112127],"study_design_scores_gemma":[0.00065484294,0.00012489663,0.0000015067349,0.00033830255,0.00002232124,0.000027846778,6.0696453e-7,0.99246264,0.0012201159,0.004390599,0.000227503,0.00052882434],"about_ca_topic_score_codex":0.0000042920856,"about_ca_topic_score_gemma":0.000025487023,"teacher_disagreement_score":0.11068387,"about_ca_system_score_codex":0.00013671357,"about_ca_system_score_gemma":0.0001162611,"threshold_uncertainty_score":0.9998348},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012308621,0.00088986766,0.9948867,0.0005230543,0.00065928657,0.000559884,0.000009160294,0.000053117044,0.0011880758],"genre_scores_gemma":[0.6891348,0.00018048467,0.30905303,0.0007768484,0.00019491374,0.0000031324998,0.0000023523517,0.000044987988,0.0006094731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966804,0.00006195724,0.00042874337,0.0012025743,0.0010343587,0.0005920132],"domain_scores_gemma":[0.99675316,0.00088942674,0.0003077419,0.0016678026,0.0002745646,0.00010727895],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008390818,0.00043174913,0.00065450673,0.0005704654,0.00018279743,0.00027318075,0.004097953,0.00023189846,0.000017172011],"category_scores_gemma":[0.00013454187,0.0002900315,0.00011095861,0.0006771187,0.0031138435,0.0004995218,0.0025383453,0.0010139917,0.0000073879773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008864811,0.000013959249,0.000146072,0.00013727124,0.000033876,0.000031291227,0.0015532513,0.064068325,0.0016424971,0.60381144,0.0000093477565,0.328464],"study_design_scores_gemma":[0.0011116964,0.00019417026,0.00017981256,0.00028762943,0.00000832366,0.00013795069,4.463218e-7,0.3140476,0.0043968833,0.6783215,0.0007479872,0.0005660206],"about_ca_topic_score_codex":0.00001284407,"about_ca_topic_score_gemma":0.000017319835,"teacher_disagreement_score":0.6879039,"about_ca_system_score_codex":0.00007395571,"about_ca_system_score_gemma":0.0004140073,"threshold_uncertainty_score":0.9999552},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058966386,0.000018349667,0.9960747,0.00014470497,0.00024643666,0.00022727354,0.0000031299328,0.000056255823,0.0026394986],"genre_scores_gemma":[0.97581863,7.852645e-7,0.02229103,0.00044090356,0.0012786802,0.0000074923455,0.00007312287,0.000027893624,0.00006145999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980641,0.00004545417,0.0004389894,0.0006705352,0.00041298824,0.00036792347],"domain_scores_gemma":[0.9988158,0.00037734455,0.00025607157,0.00042350875,0.00007485788,0.000052442276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045773375,0.00035067936,0.00047721274,0.00055283925,0.0001552644,0.00013717702,0.0005844618,0.00016279292,0.00008823209],"category_scores_gemma":[0.000008509689,0.00034590875,0.00013991508,0.00038097653,0.00021075502,0.000073782416,0.00019718576,0.0008764896,0.0000072219004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000467661,0.00003151448,0.0050541316,0.0000051642046,0.0000058628257,0.0000020643602,0.000057392128,0.7222772,0.000002202505,0.0061047086,0.0000141867595,0.26644084],"study_design_scores_gemma":[0.00017564234,0.000052964275,0.0020412514,0.00031298527,0.000012693705,2.0707141e-7,9.096862e-8,0.9663608,0.000009413578,0.030501649,0.00021099416,0.0003212732],"about_ca_topic_score_codex":0.000080949976,"about_ca_topic_score_gemma":0.00036795135,"teacher_disagreement_score":0.97522897,"about_ca_system_score_codex":0.0001985617,"about_ca_system_score_gemma":0.00013147024,"threshold_uncertainty_score":0.99989927},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000073331685,0.0006734192,0.9947411,0.0014122755,0.0013119174,0.00081345596,0.000011918417,0.00016680459,0.0007958202],"genre_scores_gemma":[0.07764057,0.00017022363,0.92069274,0.0010224972,0.00016355196,0.00003963078,0.0000034739478,0.000037947488,0.00022934163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964291,0.00011903558,0.00072062184,0.0013287142,0.00083717814,0.00056539],"domain_scores_gemma":[0.9963624,0.0010322646,0.00060194446,0.0014127372,0.0004192298,0.00017143041],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015867588,0.0005125259,0.0005615324,0.0007158026,0.00027041635,0.00016007156,0.0024411161,0.00025332777,0.000023198738],"category_scores_gemma":[0.00015204451,0.00034005588,0.00012536516,0.0006332943,0.0020630588,0.00043885622,0.0012386204,0.00044977578,0.0000061861206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009153763,0.000043007003,0.000049921986,0.00006360839,0.000031313215,0.000010807304,0.0009960788,0.00513365,0.0007814504,0.7871828,0.000024332714,0.20567389],"study_design_scores_gemma":[0.00039816985,0.0004960743,0.00026736196,0.0007569331,0.000031857526,0.00015539194,0.0000010576729,0.45967585,0.023067487,0.5138304,0.0005275907,0.0007918123],"about_ca_topic_score_codex":0.000012821197,"about_ca_topic_score_gemma":0.000009078291,"teacher_disagreement_score":0.4545422,"about_ca_system_score_codex":0.00021607817,"about_ca_system_score_gemma":0.00032652833,"threshold_uncertainty_score":0.99990517},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010386271,0.00063038024,0.9894839,0.001226116,0.0025776383,0.00040655542,8.7769854e-7,0.00037983226,0.0051908344],"genre_scores_gemma":[0.06605661,0.00011452828,0.92897373,0.0025461894,0.0010823057,0.000011507321,0.0000050336707,0.00006600428,0.0011440978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537116,0.000043518092,0.00062855735,0.0019773447,0.001160158,0.0008192565],"domain_scores_gemma":[0.99722487,0.00035550713,0.00039770585,0.0013773997,0.00040494796,0.0002395926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060940365,0.0006487646,0.0005314116,0.00090473815,0.0005635412,0.00090279226,0.0032326933,0.00029471886,0.00014736048],"category_scores_gemma":[0.00011928085,0.00056109997,0.00014505627,0.00072761497,0.00064684334,0.0019891495,0.0013501046,0.00081002794,0.00040190623],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006149107,0.000031683463,0.000023353396,0.00003388188,0.000009111897,0.00008179893,0.001427116,0.0027682497,0.0029052577,0.005337957,0.000027478329,0.98734796],"study_design_scores_gemma":[0.00027227483,0.00021723707,0.000053798234,0.0005353201,0.0000078624835,0.00019561319,6.971332e-7,0.77028173,0.024012027,0.19080617,0.012702532,0.0009147152],"about_ca_topic_score_codex":0.000013595585,"about_ca_topic_score_gemma":0.000036412508,"teacher_disagreement_score":0.98643327,"about_ca_system_score_codex":0.00022842933,"about_ca_system_score_gemma":0.0003210506,"threshold_uncertainty_score":0.99968404},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009463439,0.0028332158,0.94036394,0.0006167641,0.0030731368,0.0011124949,0.000039037935,0.000079006815,0.042418946],"genre_scores_gemma":[0.85901064,0.00049468584,0.12383197,0.004207213,0.0030232,0.000044235498,0.00030656415,0.00022065634,0.008860811],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980242,0.00001607058,0.00021992337,0.0008680485,0.00047866127,0.0003930522],"domain_scores_gemma":[0.9989062,0.000025507532,0.000115655195,0.0006524756,0.00017368128,0.00012649871],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039804776,0.00032602242,0.00025223455,0.00028717425,0.000087547785,0.00007614088,0.00074787455,0.0003043226,0.000026085832],"category_scores_gemma":[0.000052758493,0.00030416038,0.000093006616,0.0001457018,0.00036997805,0.0000044115923,0.00041919368,0.0002948848,0.000049413327],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019546285,0.00018708668,0.0003827624,0.00014621307,0.0002260509,0.00022412644,0.00090102217,0.06380818,0.1065477,0.0042052665,0.0034453268,0.8197308],"study_design_scores_gemma":[0.00551861,0.008850598,0.0011191904,0.0016083294,0.00015728462,0.00031402626,0.0000039993947,0.042808726,0.14028937,0.2632594,0.52847415,0.007596278],"about_ca_topic_score_codex":0.0000049819087,"about_ca_topic_score_gemma":0.000030073392,"teacher_disagreement_score":0.8495472,"about_ca_system_score_codex":0.00009071711,"about_ca_system_score_gemma":0.00024750494,"threshold_uncertainty_score":0.99994105},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013175264,0.0005990488,0.96728224,0.0006086345,0.004817851,0.00041819416,0.0000010372156,0.00031372492,0.02594612],"genre_scores_gemma":[0.5940923,0.000078101795,0.3828302,0.0044883797,0.0064148973,0.00004353437,0.000012097983,0.00013859976,0.0119018555],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956006,0.000040860887,0.0005439007,0.0018238664,0.0011266266,0.0008641378],"domain_scores_gemma":[0.99691343,0.00018897567,0.0003380266,0.0019886876,0.00033003133,0.00024082507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010561802,0.0005841562,0.00058080815,0.0006697259,0.00032209072,0.0009869618,0.0048287697,0.00044544204,0.0000770183],"category_scores_gemma":[0.00007045872,0.00047496575,0.00017759677,0.0006319711,0.0007208924,0.0005905925,0.0016529658,0.0006599062,0.000703804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004503632,0.000047203786,0.000069496506,0.00007050614,0.000024167548,0.00024012332,0.002458371,0.00037710267,0.000111416026,0.2691719,0.0007755043,0.7266497],"study_design_scores_gemma":[0.00034916276,0.00051494106,0.000045983994,0.00013277291,0.000011621658,0.00023451506,2.697641e-7,0.06351024,0.002212589,0.7634511,0.16824095,0.0012958774],"about_ca_topic_score_codex":0.000023953453,"about_ca_topic_score_gemma":0.00007600288,"teacher_disagreement_score":0.72535384,"about_ca_system_score_codex":0.00023047414,"about_ca_system_score_gemma":0.00047734025,"threshold_uncertainty_score":0.9997702},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082802516,0.00010881351,0.9959293,0.00003221348,0.00023824666,0.00014107369,0.0000015898833,0.00040710293,0.0023136628],"genre_scores_gemma":[0.26912716,0.000018735178,0.73014927,0.00011764813,0.00043970233,0.0000060719885,0.0000051144107,0.000034336463,0.00010195987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990299,0.0000037275122,0.00018988899,0.00037129992,0.00019486554,0.00021035857],"domain_scores_gemma":[0.99955976,0.000036208396,0.000054256347,0.00022084542,0.000092664755,0.000036288173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018069972,0.00018816916,0.00014797779,0.00023440592,0.00014121227,0.00010720512,0.00030812598,0.00024757578,0.000059581052],"category_scores_gemma":[0.000014502322,0.00017962558,0.000034065397,0.0002461311,0.00025428974,0.00014302184,0.00008846161,0.00040530838,0.000022825847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004624741,0.000020709376,0.0000755385,0.00009441221,0.00001130917,0.000017306662,0.0003353119,0.5173599,0.021094302,0.002428756,0.00023965223,0.4583182],"study_design_scores_gemma":[0.00003188458,0.00002452615,0.000033747136,0.000116992764,0.0000057116295,0.00005991734,1.91018e-8,0.91276705,0.0048735566,0.081078455,0.0007933685,0.00021477349],"about_ca_topic_score_codex":0.000003678665,"about_ca_topic_score_gemma":0.000004596202,"teacher_disagreement_score":0.45810342,"about_ca_system_score_codex":0.00022372036,"about_ca_system_score_gemma":0.000052428135,"threshold_uncertainty_score":0.73249185},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004706195,0.00050153217,0.9971953,0.00015001286,0.0007188238,0.00014552554,0.000010139975,0.00022139678,0.0005866623],"genre_scores_gemma":[0.91111934,0.00007065925,0.08683473,0.00020446282,0.0010528283,0.0000072544776,0.000053279906,0.00007276013,0.00058469514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984562,0.000008247668,0.00021836437,0.00056903705,0.0003113851,0.0004367591],"domain_scores_gemma":[0.9993302,0.00010625369,0.000059458038,0.00029514346,0.00012229086,0.000086630804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003484053,0.00032990146,0.0003496834,0.00044834442,0.00016592779,0.00012219671,0.00042708858,0.0003028972,0.00003569551],"category_scores_gemma":[0.000027020656,0.00030879,0.0001811523,0.00022609305,0.00035050043,0.00010899663,0.000078304256,0.0006876843,0.000022559294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003786743,0.0000021394756,0.000007057655,0.000043869484,0.000021114027,0.000005101259,0.00030766922,0.9420168,0.000088627705,0.00013824047,0.00017885327,0.05718677],"study_design_scores_gemma":[0.00012688401,0.0000834076,0.0000048684565,0.0001924088,0.000025795653,0.000013406485,6.23584e-7,0.96228796,0.00074992934,0.03528225,0.0008796976,0.00035279046],"about_ca_topic_score_codex":0.0000064555893,"about_ca_topic_score_gemma":0.000063034204,"teacher_disagreement_score":0.9106487,"about_ca_system_score_codex":0.00019939936,"about_ca_system_score_gemma":0.00006206836,"threshold_uncertainty_score":0.9999364},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061254073,0.00071300595,0.98875207,0.00016884033,0.0016263196,0.00049087236,0.000008882594,0.0000680529,0.0020465804],"genre_scores_gemma":[0.51451737,0.00055586745,0.46571025,0.0058135153,0.00998828,0.000029619734,0.00043734012,0.00015079176,0.0027969547],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980231,0.000020209613,0.00036002495,0.0007022802,0.0005299121,0.00036445804],"domain_scores_gemma":[0.99851716,0.0002634886,0.00013245027,0.000689985,0.00022778517,0.00016916111],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043921245,0.0002916881,0.00034192618,0.00025254293,0.00015496719,0.00012554872,0.00035551458,0.00021923592,0.0010283783],"category_scores_gemma":[0.00009797539,0.00026148214,0.00013575926,0.00021141121,0.0005650565,0.00015954075,0.00013218945,0.00039326746,0.000080039696],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097832686,0.0003061822,0.0032516352,0.00022073495,0.00012768338,0.00034235252,0.0015469202,0.03454031,0.0009633325,0.0022833927,0.0014555997,0.954864],"study_design_scores_gemma":[0.0073390645,0.019362215,0.042065576,0.014192034,0.0013454536,0.0042077815,0.000013261666,0.28158554,0.012010957,0.5502658,0.06209701,0.005515329],"about_ca_topic_score_codex":0.00002380431,"about_ca_topic_score_gemma":0.000195997,"teacher_disagreement_score":0.9493487,"about_ca_system_score_codex":0.00020528832,"about_ca_system_score_gemma":0.00021667052,"threshold_uncertainty_score":0.9999837},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021255253,0.00027282236,0.99134314,0.0019041452,0.0011980206,0.0010313112,0.000003489128,0.00027285228,0.0039529903],"genre_scores_gemma":[0.024776619,0.000011770698,0.9727923,0.001167797,0.00032247332,0.000056863097,0.000009831078,0.00004968889,0.0008126354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632764,0.0000745898,0.0005536782,0.001881227,0.00052122853,0.0006416413],"domain_scores_gemma":[0.99513423,0.0018287491,0.00046996173,0.0020486645,0.0003737963,0.00014459685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002200134,0.00045520675,0.00051288115,0.00076644536,0.00036677142,0.00060576777,0.003720339,0.00029490152,0.000015734655],"category_scores_gemma":[0.00042271696,0.00044393918,0.0001728632,0.00059478736,0.00029108473,0.0005210874,0.0009059838,0.0009245235,0.00012696533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003314865,0.000015136079,0.000052032756,0.000045022505,0.000007668178,0.0000011199445,0.00020342733,0.066010386,0.0011009956,0.12335434,0.000013834403,0.8091927],"study_design_scores_gemma":[0.00018608356,0.000076588294,0.00031505863,0.000113276146,0.00000784065,0.000015644202,8.795307e-8,0.8424806,0.0006686332,0.14316215,0.012545176,0.000428863],"about_ca_topic_score_codex":0.000062681065,"about_ca_topic_score_gemma":0.0000119386,"teacher_disagreement_score":0.80876386,"about_ca_system_score_codex":0.000364616,"about_ca_system_score_gemma":0.000755832,"threshold_uncertainty_score":0.9998012},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072737696,0.0019510053,0.9866706,0.0009428707,0.003022275,0.0006660673,0.0000050056633,0.0006379626,0.005376802],"genre_scores_gemma":[0.81659114,0.00033398654,0.1721937,0.006429813,0.0016833714,0.00004576882,0.00004424475,0.0002874537,0.002390501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919622,0.00011113361,0.0010200322,0.003120754,0.0018687207,0.0019171892],"domain_scores_gemma":[0.99397814,0.00068344834,0.00061369844,0.003993839,0.00032642172,0.00040442855],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019826803,0.0011222904,0.0011328367,0.0012581088,0.00047571928,0.0011593809,0.008750976,0.00069717364,0.000055180422],"category_scores_gemma":[0.00015414778,0.0010822288,0.00031917574,0.0010339605,0.00093489233,0.00086541823,0.002897973,0.0018094243,0.00059726875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012146491,0.000066011,0.000043302567,0.00013419968,0.00004075991,0.00025102598,0.0006078678,0.01376359,0.002138875,0.5933056,0.00028325472,0.38935336],"study_design_scores_gemma":[0.00032068868,0.00024185331,0.000019318226,0.00019867803,0.0000135047485,0.00017714777,7.3896146e-8,0.6492126,0.0073088706,0.3305462,0.010985573,0.0009754947],"about_ca_topic_score_codex":0.000039787887,"about_ca_topic_score_gemma":0.00008882646,"teacher_disagreement_score":0.8158638,"about_ca_system_score_codex":0.00086681487,"about_ca_system_score_gemma":0.0016254053,"threshold_uncertainty_score":0.9998775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005359889,0.0005356476,0.9840344,0.0012242245,0.0015603555,0.00051244296,0.000005262888,0.00017794548,0.00658981],"genre_scores_gemma":[0.9063551,0.00007949889,0.08958425,0.0019988068,0.00030066672,0.000016155942,0.0000063750654,0.00005607673,0.0016030844],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964854,0.00006762518,0.00056578935,0.0012322661,0.0010698074,0.00057908945],"domain_scores_gemma":[0.99556947,0.0011949557,0.00043462354,0.0024410777,0.00022437985,0.00013549771],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000834313,0.00048791018,0.00053587684,0.00048570693,0.00022398667,0.00041199982,0.0056475555,0.00026215907,0.000109673856],"category_scores_gemma":[0.00018820575,0.0003136767,0.00019607529,0.0006435022,0.0010734192,0.00057129597,0.0020842862,0.00074304244,0.00009453202],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005335506,0.000045719877,0.00012231212,0.0000400444,0.000036480313,0.000046282134,0.0032403017,0.0035107515,0.00039568724,0.09204877,0.00017264804,0.90033567],"study_design_scores_gemma":[0.00029972143,0.0002241363,0.0011048561,0.00059007213,0.000016023218,0.00010340579,0.0000022946715,0.3417449,0.007574593,0.64311236,0.0042923265,0.00093533716],"about_ca_topic_score_codex":0.00014432416,"about_ca_topic_score_gemma":0.000021683672,"teacher_disagreement_score":0.9009952,"about_ca_system_score_codex":0.000103464576,"about_ca_system_score_gemma":0.0003309078,"threshold_uncertainty_score":0.9999315},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011002786,0.00010050008,0.99685097,0.0004441252,0.0007903815,0.0006396226,0.0000058649835,0.00085405825,0.00020444582],"genre_scores_gemma":[0.2230105,0.0000020221319,0.77629673,0.00045351894,0.00018552957,0.000014339201,0.0000029157245,0.00002218295,0.000012242409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973727,0.00003475153,0.0005547466,0.00089827436,0.0006804485,0.00045911086],"domain_scores_gemma":[0.99237895,0.0054757693,0.0006062942,0.0010476678,0.00043470075,0.00005661686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014115212,0.00032876572,0.00040207154,0.00033734573,0.0002649834,0.0004981074,0.0024966658,0.00014256504,0.0000031347972],"category_scores_gemma":[0.00083972636,0.00024093708,0.00011038088,0.0005772704,0.00029049578,0.00050268625,0.00084289344,0.00041149725,0.0000028309096],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.6195023e-7,0.000008751511,0.0007838173,0.000039015056,0.0000053222825,0.0000034237185,0.0003622708,0.0016730035,0.00013426733,0.0021409206,0.000030520074,0.99481815],"study_design_scores_gemma":[0.00018460372,0.00023683457,0.0009564937,0.00044964286,0.000011579764,0.00006352602,3.8050936e-7,0.7377296,0.002588332,0.25719336,0.00019526815,0.00039037174],"about_ca_topic_score_codex":0.000084014806,"about_ca_topic_score_gemma":0.0000037800362,"teacher_disagreement_score":0.99442774,"about_ca_system_score_codex":0.0001570782,"about_ca_system_score_gemma":0.0008993324,"threshold_uncertainty_score":0.9825129},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006392961,0.0002862632,0.99459606,0.00020946316,0.0025027369,0.0008528586,0.000029241546,0.00016712445,0.0007169563],"genre_scores_gemma":[0.0932968,0.000015134986,0.905303,0.0006764291,0.00025906833,0.00001358756,0.000018615536,0.00005025963,0.0003670995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959051,0.00003254105,0.0007585169,0.0015476027,0.001145957,0.00061027426],"domain_scores_gemma":[0.99519134,0.001859241,0.0005218116,0.0019069263,0.00038807592,0.0001325819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001136389,0.00048329702,0.0006892902,0.0008817744,0.00015838629,0.00024885806,0.0038728125,0.0003047289,0.000018559736],"category_scores_gemma":[0.00017965508,0.0004086367,0.00018405255,0.0006552354,0.00038729567,0.0005850937,0.0016557706,0.00042176328,0.000032515727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028850496,0.000087254826,0.000026714206,0.00012354086,0.000023951297,0.000026915426,0.00025450683,0.13940392,0.0023032841,0.120740764,0.0001278642,0.7368524],"study_design_scores_gemma":[0.00065503037,0.00022692386,0.00020836493,0.00068527355,0.00000701485,0.000040789608,2.4150019e-8,0.6526802,0.0006995476,0.34415016,0.00028694145,0.00035970123],"about_ca_topic_score_codex":0.000018537496,"about_ca_topic_score_gemma":0.000017480434,"teacher_disagreement_score":0.73649275,"about_ca_system_score_codex":0.0001517845,"about_ca_system_score_gemma":0.00091105513,"threshold_uncertainty_score":0.99983656},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028256627,0.00016389864,0.9897403,0.0003808223,0.002506538,0.00070844125,0.000004193343,0.0004821889,0.0057310425],"genre_scores_gemma":[0.13016826,0.00006462423,0.8669234,0.0018164279,0.00045943682,0.000009246769,0.000013333889,0.0000844735,0.00046081416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942468,0.00009633642,0.00073804037,0.0020888154,0.0017079167,0.001122108],"domain_scores_gemma":[0.9965451,0.00052908267,0.0004712219,0.0015853343,0.0005807985,0.0002884679],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001284701,0.00070094713,0.0006791378,0.0011469139,0.0006541088,0.0014758065,0.0030382087,0.00038372644,0.0000576782],"category_scores_gemma":[0.0001893895,0.0006967032,0.00016909264,0.0013349581,0.00035592046,0.001193761,0.001602062,0.0011893958,0.00012537121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094232655,0.000071456576,0.000025427657,0.00008920269,0.00003139416,0.00006730477,0.004113558,0.91798365,0.0017920942,0.023180809,0.000016156951,0.052619494],"study_design_scores_gemma":[0.00049036636,0.00022709357,0.00001555161,0.0009764331,0.000010678849,0.000045085224,7.405048e-7,0.98132795,0.007911313,0.0074827615,0.00061088597,0.0009011529],"about_ca_topic_score_codex":0.000017566952,"about_ca_topic_score_gemma":0.000019838797,"teacher_disagreement_score":0.12988569,"about_ca_system_score_codex":0.00081337034,"about_ca_system_score_gemma":0.0013103937,"threshold_uncertainty_score":0.9995608},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007772451,0.00075589895,0.9899961,0.00013856898,0.00036257555,0.00029159072,0.000010835741,0.000024634415,0.00064736244],"genre_scores_gemma":[0.9768493,0.000054332904,0.020130914,0.00047376545,0.0009277416,0.000007106767,0.000636099,0.00007279976,0.0008479389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977148,0.000026228801,0.00030858832,0.0010333867,0.00047562143,0.00044133666],"domain_scores_gemma":[0.99855393,0.000036704994,0.00025065808,0.00089311396,0.00016487656,0.000100715144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027892686,0.00038180672,0.00034787253,0.0001949919,0.00009684855,0.000078191464,0.00066928676,0.00039470074,0.000020852867],"category_scores_gemma":[0.000013183589,0.00034449704,0.00009591262,0.0002469377,0.00032022395,0.000012028692,0.00043848154,0.00036602828,0.0000066647513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016508644,0.00005362791,0.0005683112,0.00004484122,0.00019040216,0.000017345263,0.00005626575,0.8462945,0.06937153,0.00021235416,0.0006414315,0.082384266],"study_design_scores_gemma":[0.0019703172,0.0009210001,0.00034109646,0.0003714827,0.0002117408,0.00014453694,0.0000013978439,0.86424357,0.12108985,0.002699685,0.0060806843,0.0019246185],"about_ca_topic_score_codex":0.000021807731,"about_ca_topic_score_gemma":0.0001406269,"teacher_disagreement_score":0.96986514,"about_ca_system_score_codex":0.00011722617,"about_ca_system_score_gemma":0.0003013322,"threshold_uncertainty_score":0.9999007},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011406639,0.0013252448,0.9938123,0.00004907642,0.0020546815,0.00043483434,0.00016555899,0.000020923684,0.0009966706],"genre_scores_gemma":[0.12475169,0.000078015975,0.87064743,0.00071585586,0.0016815367,0.000004379795,0.00068117527,0.00010046873,0.001339475],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99752736,0.000021300038,0.0003421216,0.0014450772,0.00022294586,0.00044121206],"domain_scores_gemma":[0.99822754,0.00014174868,0.00018619667,0.0012668422,0.00009427908,0.000083380844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039790178,0.0003875307,0.00037091968,0.0001285736,0.00011074992,0.00022065367,0.0016703586,0.00039737803,0.0000139402155],"category_scores_gemma":[0.000038129663,0.0003786635,0.0001259822,0.000068424,0.00015181159,0.00001972411,0.00080978347,0.00032057925,0.000006570485],"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.000059889648,0.000038475035,0.000025344292,0.00010513416,0.00002066093,0.0000036747892,0.00008800365,0.0042464538,0.930409,0.000007657852,0.000034008095,0.064961664],"study_design_scores_gemma":[0.0007878302,0.00036201568,0.000008521953,0.00013469654,0.00005643052,0.000006796917,5.4905763e-7,0.42941263,0.56127757,0.0018796378,0.0053843413,0.0006889831],"about_ca_topic_score_codex":0.00011188509,"about_ca_topic_score_gemma":0.0005330034,"teacher_disagreement_score":0.4251662,"about_ca_system_score_codex":0.000057896257,"about_ca_system_score_gemma":0.00026450952,"threshold_uncertainty_score":0.99986655},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005814331,0.00004601798,0.98897403,0.000836121,0.0004590222,0.003102964,0.000007091616,0.00005498965,0.000705417],"genre_scores_gemma":[0.89014846,0.000001509178,0.10821866,0.0012260866,0.00020514494,0.00005466166,0.000002204706,0.000023175975,0.000120067845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601346,0.00010426936,0.00069223985,0.0015400695,0.00094002904,0.00070990156],"domain_scores_gemma":[0.9959098,0.0014384622,0.00032489657,0.002027024,0.00020085573,0.000098933364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035807828,0.00044597636,0.0005360621,0.00081410544,0.00032901228,0.0009113329,0.003998014,0.00014702656,0.0000034779243],"category_scores_gemma":[0.00033487604,0.00033063625,0.00013499471,0.00139855,0.0004130656,0.00066667,0.00104468,0.0007339399,0.000013400317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003762396,0.000849188,0.0022710504,0.00014058173,0.00003615593,0.000034663608,0.018281829,0.08704772,0.0005369171,0.15920761,0.000024779101,0.73153186],"study_design_scores_gemma":[0.00045546424,0.0005282796,0.0009433845,0.00021309427,0.000011890253,0.000024106314,0.0000061935557,0.931336,0.00004148502,0.06538297,0.0005877064,0.00046943026],"about_ca_topic_score_codex":0.00013487728,"about_ca_topic_score_gemma":0.0005650767,"teacher_disagreement_score":0.88433415,"about_ca_system_score_codex":0.0004094238,"about_ca_system_score_gemma":0.0009038805,"threshold_uncertainty_score":0.9999146},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016639542,0.0011083683,0.977442,0.0025521836,0.0039739227,0.0007321163,0.000020950401,0.00022623538,0.0139275715],"genre_scores_gemma":[0.4771527,0.0007241017,0.49715233,0.008444222,0.0037178602,0.0004521738,0.00007558553,0.00034098708,0.011940056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943842,0.00009681353,0.000863652,0.0018004713,0.0017652619,0.001089576],"domain_scores_gemma":[0.9961538,0.000776549,0.0005142531,0.002137568,0.0002164947,0.00020139125],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002146777,0.0006350722,0.0006012891,0.00040580163,0.0016316114,0.0016144252,0.006850468,0.00023266267,0.00003133088],"category_scores_gemma":[0.00005928939,0.00046964793,0.00022159725,0.00091220834,0.00064501615,0.00072588003,0.0029417207,0.001408407,0.000054071657],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000832735,0.000026200521,0.000017510385,0.00004398425,0.00002023859,0.0001329382,0.0008860069,0.06992212,0.000026076219,0.1500652,0.00031253227,0.7785389],"study_design_scores_gemma":[0.00038274567,0.00016578565,0.000028504843,0.00034242327,0.0000071390164,0.00023855867,7.9916305e-7,0.6568815,0.00009263142,0.070787646,0.27018917,0.000883048],"about_ca_topic_score_codex":0.000056751513,"about_ca_topic_score_gemma":0.00011356052,"teacher_disagreement_score":0.77765584,"about_ca_system_score_codex":0.00056888926,"about_ca_system_score_gemma":0.0006058281,"threshold_uncertainty_score":0.9997755},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021220348,0.00010795047,0.9911219,0.0005409157,0.00038517555,0.0006696192,0.0000056483354,0.000062186155,0.004984582],"genre_scores_gemma":[0.9116016,0.00001861192,0.087263435,0.000751992,0.000069413516,0.000012276837,9.897711e-7,0.000037073718,0.0002445847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960838,0.0000790788,0.0003873676,0.0013179459,0.0015316406,0.000600189],"domain_scores_gemma":[0.99394596,0.00279331,0.00029211922,0.0025682275,0.00029501232,0.00010538048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001643146,0.00042827372,0.0004978405,0.0006401254,0.00018865286,0.0002049543,0.0046900148,0.00016838255,0.00002870468],"category_scores_gemma":[0.0001918624,0.00026403446,0.00014070519,0.0009943008,0.0016744547,0.00044792183,0.0010126047,0.0011375007,0.00002457446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008045721,0.00006832835,0.0001482643,0.00008628115,0.000026871601,0.000041303552,0.00083622144,0.11141734,0.000399163,0.73140156,0.0000063904877,0.15548779],"study_design_scores_gemma":[0.00030747804,0.00079762074,0.00037165952,0.00057191506,0.0000050556782,0.0000391896,3.5762667e-7,0.09493389,0.004831522,0.8974185,0.00018923804,0.0005336046],"about_ca_topic_score_codex":0.000010109735,"about_ca_topic_score_gemma":0.000037277947,"teacher_disagreement_score":0.9094796,"about_ca_system_score_codex":0.00015957761,"about_ca_system_score_gemma":0.00059972523,"threshold_uncertainty_score":0.99998116},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037110187,0.0006797562,0.97911996,0.00026369275,0.0008806547,0.00043331404,0.000002659998,0.00056092016,0.018055331],"genre_scores_gemma":[0.036724117,0.00037416894,0.95982283,0.0017588427,0.0003009053,0.000013902259,0.000002677322,0.0000590058,0.00094355125],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99628216,0.00002034502,0.0005399615,0.0015372656,0.00083655515,0.000783709],"domain_scores_gemma":[0.9976878,0.00022545275,0.00023335815,0.0014398828,0.00021479641,0.00019867747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007058712,0.00058249454,0.0005442866,0.00087051204,0.0002559634,0.00033806777,0.00397293,0.0003589269,0.000037799993],"category_scores_gemma":[0.00006798869,0.000527878,0.00018827195,0.000645076,0.0007320545,0.0016000216,0.0008368524,0.00097360666,0.000053966778],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036257084,0.000013249079,0.000005603674,0.000022489308,0.0000053901963,0.000096142474,0.00061238237,0.00024069274,0.00026444753,0.033495706,0.00001324712,0.965227],"study_design_scores_gemma":[0.00022547027,0.00034171317,0.000016928754,0.00054514105,0.000010274646,0.0001298265,1.2067365e-7,0.049293447,0.047810636,0.8854082,0.015071441,0.001146749],"about_ca_topic_score_codex":0.000020039102,"about_ca_topic_score_gemma":0.000019790728,"teacher_disagreement_score":0.9640803,"about_ca_system_score_codex":0.00026048263,"about_ca_system_score_gemma":0.00049096753,"threshold_uncertainty_score":0.9997173},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007661522,0.00019604719,0.9858472,0.0011441293,0.008639162,0.00057817926,0.000015369664,0.0002811166,0.0025326808],"genre_scores_gemma":[0.6369551,0.000021001702,0.35551974,0.0033253166,0.0016338469,0.0000054068064,0.000008194946,0.00008406333,0.0024473532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951078,0.000120234494,0.000491928,0.002085074,0.0012482133,0.00094669877],"domain_scores_gemma":[0.99689454,0.0005948108,0.00029999274,0.0016715162,0.00027697804,0.0002621706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020270017,0.00071771,0.0007867064,0.0010599798,0.0003984149,0.00094495696,0.003323093,0.000563231,0.000014026552],"category_scores_gemma":[0.00026247077,0.0006559962,0.00021774031,0.0009590184,0.00023974865,0.00071143435,0.0013061868,0.0015124454,0.000174273],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019362204,0.000011427467,0.00021798874,0.00003927328,0.00001629956,0.000057720394,0.0007917418,0.035913516,0.0018748533,0.0012442123,0.000030160878,0.95978343],"study_design_scores_gemma":[0.00287697,0.0018230593,0.030659633,0.0024435392,0.00006258558,0.0008071311,0.0000017426158,0.7047941,0.039701115,0.14125574,0.0681249,0.007449457],"about_ca_topic_score_codex":0.00007139019,"about_ca_topic_score_gemma":0.0004755456,"teacher_disagreement_score":0.952334,"about_ca_system_score_codex":0.00042342852,"about_ca_system_score_gemma":0.00061554514,"threshold_uncertainty_score":0.99958915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007039189,0.00021956999,0.99121195,0.00025131062,0.0029946095,0.000616006,0.0000037376108,0.00037973886,0.004252667],"genre_scores_gemma":[0.007577528,0.00001980747,0.9892375,0.0013596548,0.0006558221,0.0000054628517,0.0000082317465,0.000069467555,0.0010665676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99402773,0.00031226638,0.00075073855,0.0028983837,0.0010787685,0.00093211373],"domain_scores_gemma":[0.9949969,0.000743126,0.00048540247,0.0030251553,0.0005162074,0.00023323327],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0039974237,0.0007578842,0.0008212139,0.0013710763,0.00043418593,0.0017921283,0.0039834552,0.00052801945,0.000032944637],"category_scores_gemma":[0.00014452694,0.0006979591,0.00023233602,0.0009978564,0.00038275495,0.002268348,0.0010800075,0.0013646937,0.00008150089],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025702628,0.00004191329,0.000006553897,0.000052218096,0.000016371572,0.00016501073,0.00092334946,0.0056892424,0.056518864,0.004066486,0.0000116576175,0.93248266],"study_design_scores_gemma":[0.00049770996,0.00035260135,0.00003531458,0.00021945864,0.000014497872,0.0002186542,1.7467839e-7,0.86705416,0.03441218,0.09580473,0.00052612927,0.00086437206],"about_ca_topic_score_codex":0.00008529213,"about_ca_topic_score_gemma":0.000026191954,"teacher_disagreement_score":0.9316183,"about_ca_system_score_codex":0.0004570141,"about_ca_system_score_gemma":0.00098281,"threshold_uncertainty_score":0.9995472},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022933595,0.00035560768,0.9925433,0.00023588083,0.0027136125,0.00039373295,0.000007183623,0.00020855863,0.0012488074],"genre_scores_gemma":[0.18286556,0.000009691492,0.8151268,0.0008350852,0.00056495116,7.199923e-7,0.0000064781034,0.000064154796,0.0005265892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945792,0.00018294611,0.0005981792,0.0020975245,0.0014712411,0.0010708863],"domain_scores_gemma":[0.996577,0.0005953667,0.000490063,0.001662994,0.00045270173,0.00022186016],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011661766,0.0008504191,0.00088173593,0.0009925052,0.0005661258,0.0015208824,0.0039352225,0.00062331604,0.00006747806],"category_scores_gemma":[0.00022717856,0.0007766874,0.00022406106,0.0008690096,0.0007756097,0.0014842363,0.0021247026,0.002641999,0.00002417237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059009275,0.000020727237,0.0012415071,0.00026916142,0.00006378701,0.000719892,0.0027930252,0.35947308,0.027249582,0.009643497,0.00002635388,0.59844035],"study_design_scores_gemma":[0.00047378318,0.00010818408,0.0004552661,0.0002624023,0.000014257546,0.00023741055,2.9193532e-7,0.9079791,0.003287587,0.08589976,0.00032178927,0.0009602173],"about_ca_topic_score_codex":0.000071495226,"about_ca_topic_score_gemma":0.000045325934,"teacher_disagreement_score":0.5974802,"about_ca_system_score_codex":0.00048159435,"about_ca_system_score_gemma":0.0010920912,"threshold_uncertainty_score":0.99965894},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037113058,0.00007048368,0.98773026,0.00002956293,0.0048625907,0.0005713711,0.000015793012,0.000092698414,0.0029159477],"genre_scores_gemma":[0.9805063,0.0000022126371,0.018847082,0.00008707013,0.0003514855,0.000008311197,0.000009150743,0.000037069145,0.00015129629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976299,0.00009050302,0.00042291364,0.00096108456,0.00051757274,0.00037803798],"domain_scores_gemma":[0.99833804,0.00033010947,0.0002843425,0.0007913321,0.00013787286,0.00011830499],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000494439,0.00033769646,0.0003860696,0.0005972611,0.00011266731,0.00006839341,0.00053365086,0.0005767143,0.000124699],"category_scores_gemma":[0.000016187569,0.0003152639,0.00007763665,0.0003062132,0.0002552969,0.0002064135,0.00010553526,0.0006927555,0.00017632666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000995192,0.000045525005,0.000039830444,0.000018480083,0.000046991125,0.000051346746,0.0014887156,0.27516946,0.002855453,0.0017679358,0.0000066238663,0.71841013],"study_design_scores_gemma":[0.0044033276,0.0068146703,0.005916744,0.00667574,0.0005520383,0.0010156947,0.000034063134,0.8967242,0.06223315,0.0096185,0.0006331767,0.0053786933],"about_ca_topic_score_codex":0.00014624045,"about_ca_topic_score_gemma":0.000097919605,"teacher_disagreement_score":0.976795,"about_ca_system_score_codex":0.0002775239,"about_ca_system_score_gemma":0.00012497105,"threshold_uncertainty_score":0.99992996},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0142223025,0.032910943,0.8585427,0.0003390576,0.015668271,0.0038702444,0.000029643144,0.00044589612,0.07397097],"genre_scores_gemma":[0.99719924,0.00020293893,0.0005923317,0.000042087955,0.00027386833,0.000008179419,0.0000013526521,0.00003897788,0.0016410087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986752,0.00001801249,0.00035391806,0.0003745321,0.00031081238,0.00026747692],"domain_scores_gemma":[0.9989268,0.00030093553,0.000114037364,0.00056755205,0.000046634228,0.000044039618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005569011,0.00027444912,0.0005222942,0.0002482413,0.00005455632,0.00012358814,0.0005948078,0.00020739257,0.000005772515],"category_scores_gemma":[0.000013741591,0.00017242943,0.00006741345,0.00009594174,0.0005611746,0.000077725155,0.00011050199,0.00042437945,0.000016574111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001875819,0.0000051056654,0.00003625987,0.0017534465,0.00006316441,0.000014238555,0.0010117713,0.92054385,0.00021388133,0.0066502774,0.000060283528,0.06962894],"study_design_scores_gemma":[0.0013773742,0.0001226232,0.00013615581,0.002974362,0.00004034416,0.00019113283,0.0000011835446,0.97442305,0.0047424543,0.009057007,0.006119041,0.0008152873],"about_ca_topic_score_codex":0.00005776799,"about_ca_topic_score_gemma":0.000017584054,"teacher_disagreement_score":0.982977,"about_ca_system_score_codex":0.00007133557,"about_ca_system_score_gemma":0.00009378054,"threshold_uncertainty_score":0.7031468},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010817463,0.00016586637,0.9956523,0.00043971225,0.0014204233,0.00077663915,0.000036735782,0.0001078202,0.00031873232],"genre_scores_gemma":[0.40136987,0.0000066995676,0.59675145,0.0012619973,0.00034863845,0.000006815905,0.00002313896,0.00002987305,0.00020151581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514526,0.0000676639,0.0007530096,0.001906503,0.0012609379,0.00086662197],"domain_scores_gemma":[0.9964211,0.000608208,0.0005050944,0.0018368975,0.00044754753,0.0001811531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012190198,0.0006404319,0.0009967181,0.0013262304,0.00038847644,0.0010290267,0.0034402627,0.0003317543,0.000021357657],"category_scores_gemma":[0.00006345076,0.0005846013,0.00047078767,0.0009711633,0.00049893674,0.0009430483,0.0018789929,0.00073576515,0.000008258898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004460356,0.00009136526,0.002512431,0.00035795296,0.000558843,0.000109608234,0.0017458054,0.7040269,0.0011183706,0.039673887,0.000028175542,0.24973209],"study_design_scores_gemma":[0.00035753043,0.000105453924,0.0021678277,0.00009511954,0.000104276914,0.000018778414,3.2466633e-7,0.957659,0.0010898386,0.037369452,0.00029505685,0.0007373082],"about_ca_topic_score_codex":0.00009857769,"about_ca_topic_score_gemma":0.00010839408,"teacher_disagreement_score":0.40028813,"about_ca_system_score_codex":0.000578892,"about_ca_system_score_gemma":0.00094254746,"threshold_uncertainty_score":0.99966055},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048824945,0.0003907491,0.98903805,0.00008756557,0.0041249413,0.00045101912,0.0000025058098,0.00016170865,0.00086099096],"genre_scores_gemma":[0.68922055,0.000018778126,0.30994016,0.00037945368,0.0003482892,0.0000023687348,0.000001550874,0.000040212246,0.00004865821],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536616,0.00014156489,0.0007027621,0.0019059947,0.0010047355,0.00087880914],"domain_scores_gemma":[0.9971044,0.00065403094,0.00040330752,0.0015126964,0.00020658788,0.00011894637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020029133,0.00062752556,0.00077793916,0.0015561263,0.00021783856,0.0007112664,0.0025914041,0.0005182091,0.000010974702],"category_scores_gemma":[0.0001811005,0.00060585205,0.00017980633,0.0012299109,0.0003163592,0.0010302162,0.0007800596,0.0013604186,0.000019360388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007835324,0.000012607076,0.0011086563,0.000048436472,0.0000090597605,0.0000957211,0.00064316526,0.11219295,0.0024191835,0.001477243,3.889309e-7,0.8819848],"study_design_scores_gemma":[0.0005800607,0.00016255619,0.007340765,0.0007267349,0.000008948535,0.00021532802,3.5639502e-7,0.8777541,0.012356792,0.09930475,0.00035560312,0.0011940076],"about_ca_topic_score_codex":0.00011035456,"about_ca_topic_score_gemma":0.0009761191,"teacher_disagreement_score":0.88079077,"about_ca_system_score_codex":0.0005373625,"about_ca_system_score_gemma":0.0007599053,"threshold_uncertainty_score":0.9996393},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052583902,0.0003302485,0.9953024,0.00036688425,0.0013603162,0.0009573597,0.000021054642,0.0008180642,0.0007911202],"genre_scores_gemma":[0.020902788,0.000017099128,0.9769502,0.00073860015,0.00058417907,0.000011831462,0.000020841611,0.00011669363,0.00065774086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943753,0.000041123258,0.0007619768,0.0025401667,0.0010893304,0.0011921177],"domain_scores_gemma":[0.99605453,0.0005929412,0.00068242365,0.0016628669,0.00080903753,0.00019818758],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000684232,0.0009793137,0.00088802946,0.000910406,0.00055857643,0.0013097661,0.0051536197,0.00051742257,0.000028485365],"category_scores_gemma":[0.00037799386,0.0009106466,0.00023847481,0.00057985063,0.0006844369,0.002427629,0.0023171909,0.001877363,0.0000261661],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051370753,0.000022369277,0.000050950945,0.0007785638,0.00004648964,0.00026335465,0.0014348415,0.05080996,0.04240722,0.0320903,0.00009970522,0.87194484],"study_design_scores_gemma":[0.00030129863,0.00022517341,0.000010670732,0.00048415636,0.000010927505,0.00014578304,3.0206286e-7,0.7831077,0.011152237,0.20276655,0.0008710353,0.00092414225],"about_ca_topic_score_codex":0.0000065870586,"about_ca_topic_score_gemma":0.000013470101,"teacher_disagreement_score":0.87102073,"about_ca_system_score_codex":0.0004833309,"about_ca_system_score_gemma":0.000872453,"threshold_uncertainty_score":0.99972695},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005622512,0.00025529353,0.9855238,0.00022169332,0.0018769377,0.0005654161,0.0000019319841,0.00027393692,0.010718724],"genre_scores_gemma":[0.6064963,0.000012918601,0.3891933,0.00076655886,0.0004469992,0.000013417641,0.000009148255,0.000056777048,0.003004594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626946,0.000039414346,0.000558,0.0014769968,0.00081166247,0.0008444811],"domain_scores_gemma":[0.9975136,0.0007079262,0.00047473412,0.00080522295,0.00035787883,0.00014066647],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011491672,0.00053275755,0.00054695696,0.0006627638,0.00045081394,0.0014652971,0.0023211343,0.00031810233,0.000017412649],"category_scores_gemma":[0.00013572148,0.00051821704,0.00015615148,0.00038693513,0.00041439684,0.0015120616,0.0007382452,0.0010849074,0.00006533485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012588336,0.000015595318,0.00006461567,0.00011923132,0.0000072507373,0.000008862331,0.0013706007,0.124180436,0.000994336,0.033306684,0.0000061508313,0.83991367],"study_design_scores_gemma":[0.000534819,0.00066153577,0.0001069249,0.00032355616,0.00000747815,0.00003358058,0.0000045093975,0.9752437,0.000551945,0.011527503,0.010255889,0.0007485599],"about_ca_topic_score_codex":0.0000101662135,"about_ca_topic_score_gemma":0.00003226229,"teacher_disagreement_score":0.85106325,"about_ca_system_score_codex":0.000250471,"about_ca_system_score_gemma":0.0010429218,"threshold_uncertainty_score":0.99972695},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14387329,0.00094404054,0.8499517,0.00017298212,0.0026650573,0.00079620036,0.0000038656094,0.00022095139,0.0013719405],"genre_scores_gemma":[0.79260635,0.000043922715,0.2044578,0.0016938312,0.0009868423,0.0000045774327,0.000015557473,0.000081137274,0.00010996605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967911,0.000039790153,0.0005449258,0.0010488646,0.0007385028,0.0008368183],"domain_scores_gemma":[0.9982911,0.0005970287,0.00023696157,0.0005717423,0.00014320819,0.00016000879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005598395,0.00053448294,0.00074225594,0.0015991827,0.00017497702,0.0001916288,0.00041881972,0.00038087094,0.000073547286],"category_scores_gemma":[0.00009963115,0.0004915775,0.0002455774,0.0016502182,0.0006571595,0.0002445246,0.000105115934,0.0015572308,0.000021465843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009225538,0.00017293672,0.21354575,0.00047427687,0.00012409665,0.000054098142,0.001362213,0.58583635,0.00573856,0.00031923817,0.000076998076,0.19220321],"study_design_scores_gemma":[0.0012792037,0.00076461997,0.033743396,0.0037701647,0.00015901659,0.0015144437,0.0000014855599,0.9380944,0.00014493676,0.017406259,0.0018128143,0.0013092658],"about_ca_topic_score_codex":0.00009230318,"about_ca_topic_score_gemma":0.000105949526,"teacher_disagreement_score":0.6487331,"about_ca_system_score_codex":0.00027090168,"about_ca_system_score_gemma":0.000428074,"threshold_uncertainty_score":0.9997536},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022394622,0.0009372283,0.98679113,0.0002863653,0.0017914652,0.00081968185,0.000020942078,0.0002992856,0.006814418],"genre_scores_gemma":[0.9548407,0.00006721878,0.041062497,0.0010144924,0.0008604847,0.000006806449,0.00048552552,0.00013485315,0.0015274136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962415,0.00004776814,0.00046915456,0.001580895,0.001000795,0.00065990404],"domain_scores_gemma":[0.99702525,0.0005854326,0.0003448745,0.0014932215,0.0003522674,0.00019892954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068063795,0.0005697437,0.00078551716,0.00081411214,0.00028567473,0.00047793845,0.00081144215,0.00018579976,0.00004320838],"category_scores_gemma":[0.00012109463,0.00046366666,0.00009855712,0.00052839384,0.0008188712,0.0004820787,0.0003015798,0.0015457055,0.00008622832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009570315,0.00033566286,0.1832461,0.0016879515,0.00083266984,0.00044258608,0.0026348045,0.5617537,0.0157155,0.00094486435,0.0008320364,0.2306171],"study_design_scores_gemma":[0.0041644564,0.002254317,0.011863181,0.011469128,0.00087207556,0.005838536,0.000025209009,0.8935025,0.00018393899,0.0014244252,0.06548657,0.0029156585],"about_ca_topic_score_codex":0.00020789182,"about_ca_topic_score_gemma":0.00006156267,"teacher_disagreement_score":0.95260125,"about_ca_system_score_codex":0.00023778404,"about_ca_system_score_gemma":0.00052874413,"threshold_uncertainty_score":0.9997815},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025969074,0.00005411071,0.995258,0.00041418875,0.0017697586,0.00047872207,0.000003038477,0.00014721123,0.0016152816],"genre_scores_gemma":[0.39438218,0.000019875299,0.60465395,0.0006082023,0.00017168366,0.0000056073472,0.000038717902,0.000023918288,0.0000958621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708927,0.00006609104,0.0005463967,0.0007578304,0.0010533577,0.00048704888],"domain_scores_gemma":[0.9976818,0.00041075147,0.00045868588,0.0010108415,0.0003278712,0.00011003927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011722792,0.00042328727,0.00043056955,0.00065937167,0.00027329748,0.00067450816,0.0014321189,0.00031791406,0.000009246258],"category_scores_gemma":[0.00010115416,0.0003351782,0.00007869326,0.0005285219,0.0002535773,0.0025302994,0.00059649063,0.0007111011,0.000058738377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015658443,0.000012254768,0.00071574084,0.000036047,0.000005166777,0.000010977784,0.0009580842,0.27428767,0.00004301912,0.004988304,0.0000028510142,0.7189242],"study_design_scores_gemma":[0.00042024942,0.00020723228,0.0039111064,0.00039314403,0.000008275177,0.00007663696,3.019477e-7,0.9821134,0.00024384362,0.011589421,0.0005149163,0.00052142754],"about_ca_topic_score_codex":0.00009238866,"about_ca_topic_score_gemma":0.0001860432,"teacher_disagreement_score":0.7184028,"about_ca_system_score_codex":0.00032543755,"about_ca_system_score_gemma":0.0007368206,"threshold_uncertainty_score":0.99991},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027030415,0.0001960383,0.968456,0.0010880255,0.0020159136,0.0005671293,0.00010207746,0.000072795505,0.027231775],"genre_scores_gemma":[0.56292903,0.00015394468,0.25258046,0.044714976,0.0022585774,0.000023293329,0.002090343,0.00025174688,0.13499759],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9922545,0.00008801117,0.0010768969,0.0027877681,0.0031385655,0.0006542784],"domain_scores_gemma":[0.99432164,0.0009660012,0.0006148497,0.0035310274,0.00040816647,0.00015828863],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0065577934,0.00051273213,0.0007756901,0.00095114805,0.00042576695,0.0033203745,0.0075078914,0.00027777356,0.00036434276],"category_scores_gemma":[0.000861646,0.0003981697,0.00009220961,0.0008043811,0.00070577295,0.0016571403,0.0055722347,0.00089480565,0.0007522059],"study_design_candidate":"design_other","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.000013583152,0.000037821945,0.00026047305,0.000055959485,0.000013897369,0.00010090143,0.00072298065,0.005303232,0.000012254752,0.0010027029,0.0016501459,0.9908261],"study_design_scores_gemma":[0.00054606586,0.00013149051,0.0009442326,0.001304718,0.00003548343,0.000033566277,0.0000051041866,0.41564843,0.000045415272,0.10473627,0.47515872,0.0014105112],"about_ca_topic_score_codex":0.0008228503,"about_ca_topic_score_gemma":0.21041156,"teacher_disagreement_score":0.9894155,"about_ca_system_score_codex":0.00025910226,"about_ca_system_score_gemma":0.002177135,"threshold_uncertainty_score":0.999847},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019511167,0.000097951335,0.9679412,0.00023315076,0.0022163133,0.0004917605,0.000013070649,0.00008302833,0.009412347],"genre_scores_gemma":[0.9782899,0.000024352985,0.018595472,0.00065082015,0.000730948,0.000007001811,0.0001790736,0.000045221626,0.0014771846],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818087,0.000040149156,0.00028293498,0.0008480247,0.00035471865,0.00029333268],"domain_scores_gemma":[0.9991255,0.00009517415,0.00024273856,0.00028004948,0.00017872243,0.00007782213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039089343,0.00028507644,0.00026828854,0.000510997,0.00013101759,0.00012364921,0.00016839853,0.00033159458,0.00025219933],"category_scores_gemma":[0.000017687913,0.00025048037,0.00005277025,0.0001359307,0.00030887016,0.00020512551,0.00007964758,0.0004951047,0.00021562711],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055473167,0.00003296362,0.00093714637,0.00004484101,0.000016496982,0.000022823988,0.000459069,0.00012655031,0.00010968747,0.0003319632,0.000012883345,0.9978501],"study_design_scores_gemma":[0.02453849,0.014404315,0.20390624,0.020838883,0.0009787594,0.006030185,0.00006116443,0.1942376,0.0033307208,0.509998,0.008842129,0.012833487],"about_ca_topic_score_codex":0.00009538215,"about_ca_topic_score_gemma":0.00025711875,"teacher_disagreement_score":0.9850166,"about_ca_system_score_codex":0.000089731635,"about_ca_system_score_gemma":0.00010456168,"threshold_uncertainty_score":0.99999475},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008887658,0.000067229324,0.9956353,0.0015160553,0.0016213958,0.00043808258,0.00007275308,0.00006576847,0.00049457076],"genre_scores_gemma":[0.0170896,0.00002932984,0.9806028,0.00064923574,0.00048346794,0.000033551252,0.00012239214,0.000037308262,0.00095231016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975345,0.000018431829,0.00055031315,0.0010823311,0.00042869986,0.0003856928],"domain_scores_gemma":[0.9976027,0.00064075855,0.00042000404,0.0010207115,0.00022421445,0.000091620925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062922545,0.00031088584,0.00045322767,0.00048590318,0.0001509945,0.00018784362,0.002208463,0.00019061343,0.000019941057],"category_scores_gemma":[0.00007297076,0.00030575218,0.00013153956,0.00026743364,0.000121671495,0.00045631506,0.00082310673,0.00028930098,0.000008875398],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033502965,0.000034421937,0.000060156366,0.00005582535,0.000008806615,0.0000016597885,0.00032546342,0.00092382036,0.00012245704,0.010867324,0.0001794764,0.9874172],"study_design_scores_gemma":[0.0005896575,0.00047582336,0.0001241837,0.00051364163,0.000024664861,0.00003512249,7.088915e-7,0.921408,0.0021081737,0.018737627,0.055139773,0.00084264827],"about_ca_topic_score_codex":0.00006290915,"about_ca_topic_score_gemma":0.000033566557,"teacher_disagreement_score":0.9865746,"about_ca_system_score_codex":0.0004345153,"about_ca_system_score_gemma":0.0003819465,"threshold_uncertainty_score":0.99993944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063491627,0.0002565465,0.99163634,0.000084356325,0.00024124788,0.0001720657,0.000005958747,0.000098387194,0.0011559185],"genre_scores_gemma":[0.76349014,0.00009055324,0.23528607,0.0004066603,0.00010288636,0.0000015865668,0.000008182771,0.00002622576,0.00058768294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649155,0.000047632067,0.0004537797,0.0015273895,0.0008504231,0.0006292525],"domain_scores_gemma":[0.9986854,0.00019975548,0.0001441832,0.00058378634,0.00020381098,0.00018305241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007571774,0.0004630972,0.0007674879,0.0016944082,0.00037743902,0.00075339095,0.0010662152,0.00028348636,0.00002954614],"category_scores_gemma":[0.00003446439,0.0004444777,0.00031195878,0.0013253875,0.0003047714,0.0006387521,0.00055558345,0.0007736803,0.000016684078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022324798,0.00000962844,0.00035479967,0.00002390669,0.00008261573,0.000014239996,0.0011755645,0.764379,0.00074721355,0.0012887304,1.9893913e-7,0.23192184],"study_design_scores_gemma":[0.0001721868,0.00003970721,0.000022025171,0.000109750516,0.00014547874,0.000011284845,0.0000011614509,0.992446,0.00086706196,0.0055626035,0.000087833265,0.00053488964],"about_ca_topic_score_codex":0.000027298565,"about_ca_topic_score_gemma":0.00013065588,"teacher_disagreement_score":0.757141,"about_ca_system_score_codex":0.0001864288,"about_ca_system_score_gemma":0.00044188218,"threshold_uncertainty_score":0.9998007},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006121184,0.00039544073,0.9940822,0.0003515781,0.002612439,0.00070114975,0.00002346212,0.00013829836,0.0010832726],"genre_scores_gemma":[0.018526621,0.000018211045,0.97572476,0.0036598116,0.0014072774,0.0000092004175,0.000027178505,0.000121103985,0.0005058233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685544,0.000011948778,0.00048286468,0.001213293,0.00058985467,0.00084659114],"domain_scores_gemma":[0.99833715,0.00029247205,0.00020554336,0.0007732712,0.00021633263,0.00017520858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048369347,0.0005652826,0.00069035846,0.00097367517,0.00024832698,0.00029049025,0.0005100117,0.00019762048,0.000050551218],"category_scores_gemma":[0.000050692805,0.00051817275,0.00026673308,0.00028108346,0.00047784214,0.0002923577,0.00038419926,0.000748173,0.000018206065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006270788,0.000047526093,0.0027802458,0.0005636853,0.0000893331,0.00007017183,0.00092164834,0.04008135,0.013848816,0.000028430846,0.00008224994,0.94142383],"study_design_scores_gemma":[0.00086001324,0.00013795456,0.00035246857,0.0018503605,0.00008988375,0.0009262223,6.563913e-7,0.98080665,0.00049524615,0.0011875908,0.012584421,0.0007085617],"about_ca_topic_score_codex":0.000058968504,"about_ca_topic_score_gemma":0.000013074945,"teacher_disagreement_score":0.94072527,"about_ca_system_score_codex":0.00031451578,"about_ca_system_score_gemma":0.00035658313,"threshold_uncertainty_score":0.999727},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012919147,0.00007309627,0.9961518,0.00011124714,0.0002488656,0.0003285799,0.0000066139196,0.00020099076,0.0015869159],"genre_scores_gemma":[0.68341017,0.000012070627,0.31581202,0.00044100007,0.00014462728,0.0000071776726,0.00000878558,0.00004737798,0.00011674228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981653,0.000007894308,0.00040914587,0.0006117089,0.00040066274,0.00040525076],"domain_scores_gemma":[0.99913466,0.00014641524,0.00007506508,0.00050618575,0.000059789294,0.00007789174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033960422,0.00033470392,0.00041149274,0.00069258106,0.000039736125,0.000072604664,0.0006080092,0.00020961538,0.000015906297],"category_scores_gemma":[0.00005365043,0.00032619835,0.00007970694,0.00052449293,0.000051134317,0.00018242179,0.00029663413,0.00048729187,0.000031377876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031411403,0.0000039715674,0.0001345463,0.000038228645,0.0000047111876,0.000010670352,0.00027299134,0.75675696,0.0007670644,0.000849076,0.000014267698,0.24114437],"study_design_scores_gemma":[0.0001338403,0.00009820393,0.0008367264,0.00051650836,0.0000069550665,0.000008201126,2.6546834e-7,0.9390691,0.0038048003,0.053266715,0.0015891682,0.00066949445],"about_ca_topic_score_codex":0.000023675359,"about_ca_topic_score_gemma":0.00017282939,"teacher_disagreement_score":0.6821183,"about_ca_system_score_codex":0.00047073496,"about_ca_system_score_gemma":0.00005411813,"threshold_uncertainty_score":0.999919},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012500421,0.00034926605,0.9899885,0.0005213018,0.004951032,0.0009457771,0.0000052275072,0.00026209114,0.0017267289],"genre_scores_gemma":[0.17804806,0.00004624662,0.81907904,0.0018968188,0.00062513456,0.0000069581297,0.0000095971045,0.00011111122,0.00017705481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925621,0.00024958057,0.0010306233,0.0028195933,0.0017199318,0.0016181458],"domain_scores_gemma":[0.9955061,0.0014471356,0.0005854989,0.0018284273,0.0002250412,0.00040776335],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018109565,0.0010460663,0.0012260409,0.0020665042,0.0004161953,0.0008258134,0.0051190993,0.0008498908,0.000049141527],"category_scores_gemma":[0.0012584534,0.0010837829,0.00026063988,0.0019477187,0.0003902872,0.0009521171,0.0038786032,0.0038529374,0.0001267513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003936417,0.000023767856,0.0016820516,0.000036561367,0.000015101348,0.0002110349,0.0016841044,0.88347816,0.00013454117,0.008270575,0.0000028257466,0.10442191],"study_design_scores_gemma":[0.0008695441,0.00013656978,0.00021813878,0.0013350699,0.000013427769,0.000043772343,8.4501187e-7,0.97376204,0.000111892594,0.020075101,0.0021632286,0.0012703708],"about_ca_topic_score_codex":0.00015698092,"about_ca_topic_score_gemma":0.00022148679,"teacher_disagreement_score":0.17679802,"about_ca_system_score_codex":0.0012532806,"about_ca_system_score_gemma":0.0012461103,"threshold_uncertainty_score":0.99916124},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005319536,0.00023479604,0.9972039,0.0002670089,0.00054906704,0.00054791325,0.000005057238,0.00017196461,0.0004883559],"genre_scores_gemma":[0.39793247,0.000009639632,0.6016424,0.00020608676,0.00009747571,0.000007619409,6.373092e-7,0.000021368685,0.00008231306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737227,0.00009369113,0.0005797773,0.0010285644,0.0005256048,0.0004000837],"domain_scores_gemma":[0.99678624,0.00064455724,0.0006026688,0.0016438208,0.00025131236,0.000071382594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015493889,0.0003874285,0.00044307538,0.00064301456,0.00041827417,0.0002462137,0.0025573277,0.00029894948,0.000013142079],"category_scores_gemma":[0.000081282946,0.00029798728,0.00019259832,0.0010165414,0.0004743302,0.00036267255,0.0010664364,0.0008682116,0.000008356412],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034837599,0.00001251174,0.000041468833,0.000030439825,0.0000127585445,0.0000034364361,0.00021508816,0.012127257,0.00911633,0.003881251,0.0000015829563,0.9745544],"study_design_scores_gemma":[0.00009422026,0.00014653077,0.000090036105,0.00012926242,0.000015894453,0.00020522007,4.6577756e-7,0.8620007,0.097424604,0.03828663,0.0012173363,0.00038906754],"about_ca_topic_score_codex":0.00012807133,"about_ca_topic_score_gemma":0.00018500962,"teacher_disagreement_score":0.9741653,"about_ca_system_score_codex":0.00022553455,"about_ca_system_score_gemma":0.00034018364,"threshold_uncertainty_score":0.99994725},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021566867,0.00043560987,0.99462503,0.00025509534,0.001331573,0.00070129766,0.0000036267015,0.00012484046,0.00036622083],"genre_scores_gemma":[0.7267326,0.00005632005,0.27254683,0.00033476733,0.00016602156,0.000011169153,0.0000060723505,0.0000325472,0.00011366447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614406,0.000111897636,0.00066846004,0.0017077958,0.00064044987,0.0007273693],"domain_scores_gemma":[0.9970576,0.0013559206,0.0003951909,0.00082863687,0.00024536173,0.00011726496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002175734,0.00053808576,0.00078781915,0.0010127431,0.00021735806,0.00068662583,0.001309849,0.0003486709,0.000007317143],"category_scores_gemma":[0.00060214446,0.0005055555,0.00012798583,0.0005653883,0.0003113487,0.00072522106,0.0007227455,0.0010606572,0.0000057628076],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000091452575,0.0000133572985,0.003851385,0.00011735534,0.000011509944,0.00002429174,0.0010391722,0.08861994,0.00067948713,0.006346934,0.0000011455293,0.89928627],"study_design_scores_gemma":[0.00097119337,0.00029883004,0.023063302,0.000987914,0.00000833305,0.00005525504,8.0127023e-7,0.8089164,0.0032031536,0.16119137,0.00031487967,0.0009885866],"about_ca_topic_score_codex":0.000035406454,"about_ca_topic_score_gemma":0.00018855331,"teacher_disagreement_score":0.89829767,"about_ca_system_score_codex":0.00022765393,"about_ca_system_score_gemma":0.00044977225,"threshold_uncertainty_score":0.9997396},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007011353,0.00015680499,0.988529,0.006042593,0.0013002356,0.0018713867,0.00005800439,0.00033315856,0.0017017927],"genre_scores_gemma":[0.027279561,0.000016476868,0.9669793,0.0046038036,0.00044187103,0.00011379812,0.000052982512,0.000066941015,0.0004452691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99484295,0.000048644455,0.0007326763,0.002320619,0.0011571253,0.00089798705],"domain_scores_gemma":[0.9939875,0.001546478,0.00054223725,0.0032191626,0.00045450145,0.0002501463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012600257,0.00064750813,0.0006827064,0.00071075634,0.00036798403,0.0005310687,0.004712964,0.0006242836,0.000021408501],"category_scores_gemma":[0.0002026275,0.0006279444,0.00026579184,0.00088894746,0.0009255043,0.00039896497,0.0010943459,0.00095168385,0.000089079615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018624616,0.00010490515,0.000023933502,0.00015924718,0.000025666237,0.000010514562,0.00022027419,0.061813626,0.000114434006,0.579489,0.00015353519,0.35786623],"study_design_scores_gemma":[0.0003614471,0.0001399101,0.00004836139,0.0005275594,0.000012765802,0.0000085736165,9.861107e-8,0.62144876,0.0018029528,0.37121567,0.0038451506,0.0005887387],"about_ca_topic_score_codex":0.00004324324,"about_ca_topic_score_gemma":0.00011745421,"teacher_disagreement_score":0.55963516,"about_ca_system_score_codex":0.00065436674,"about_ca_system_score_gemma":0.0016400181,"threshold_uncertainty_score":0.99961716},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000072165625,0.0015611596,0.9869717,0.0031785914,0.0022069765,0.0007141587,0.000053765212,0.0003276877,0.004913819],"genre_scores_gemma":[0.11193204,0.0003063299,0.88059723,0.0050539705,0.000977734,0.0000266528,0.00015526847,0.00011593689,0.0008348598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951598,0.00010098219,0.0006511169,0.0019216823,0.0012995605,0.0008668532],"domain_scores_gemma":[0.99301857,0.00075225905,0.00041751252,0.0052646617,0.00031232243,0.00023466667],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001016417,0.00070712,0.0006627298,0.0011165146,0.00046376494,0.00094445917,0.008914842,0.0005647616,0.000040787447],"category_scores_gemma":[0.00013288615,0.0006918861,0.0002457115,0.0011973492,0.0010546359,0.00067424745,0.004187556,0.002061921,0.00021170829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009934611,0.000091585935,0.000069721806,0.000105032974,0.000040353963,0.000057091936,0.0035708647,0.029757751,0.000114769595,0.6475938,0.00080098026,0.3177881],"study_design_scores_gemma":[0.0005085937,0.0001988624,0.00012973743,0.0007917355,0.000022079814,0.00022973878,4.1424698e-7,0.22398216,0.00023957007,0.72596836,0.046495017,0.0014337484],"about_ca_topic_score_codex":0.00006229933,"about_ca_topic_score_gemma":0.00045579637,"teacher_disagreement_score":0.31635436,"about_ca_system_score_codex":0.00037046536,"about_ca_system_score_gemma":0.0009919569,"threshold_uncertainty_score":0.9995532},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010595787,0.00047179832,0.9872277,0.000038712817,0.00011122565,0.00047303777,0.000010194363,0.000024011264,0.0010475396],"genre_scores_gemma":[0.7731783,0.00034075076,0.22340731,0.0006451243,0.0005572368,0.000021047928,0.00049037836,0.00009724622,0.0012626157],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99851215,0.000014444579,0.00034127155,0.0006706303,0.00023581974,0.00022566882],"domain_scores_gemma":[0.99869496,0.000077843164,0.00025130558,0.00066277944,0.00027374012,0.000039350456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003854204,0.0002493867,0.0003417366,0.00025905517,0.000043665226,0.00003984749,0.00054042495,0.0003039952,0.000019590992],"category_scores_gemma":[0.00010648356,0.00023633784,0.00016757387,0.000114342256,0.00030073538,0.000007087983,0.00025106664,0.00014368244,0.000010543924],"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.000010868701,0.000029322455,0.000021435719,0.00016164509,0.00003522654,0.000003782125,0.0000419698,0.0003030361,0.6891199,0.000036635014,0.00015291989,0.31008327],"study_design_scores_gemma":[0.00016899782,0.00026567202,0.0000063307216,0.00017172602,0.000038433613,0.0000068804584,1.4106332e-7,0.017324386,0.9711844,0.009479227,0.0010580452,0.00029577652],"about_ca_topic_score_codex":0.0000052816063,"about_ca_topic_score_gemma":0.000023654924,"teacher_disagreement_score":0.76382035,"about_ca_system_score_codex":0.000036131692,"about_ca_system_score_gemma":0.00022010777,"threshold_uncertainty_score":0.96375775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038452135,0.00015515235,0.9936916,0.00029600525,0.0015943659,0.0007183923,0.0000048040974,0.00022927579,0.0029258358],"genre_scores_gemma":[0.014334997,0.00001900799,0.9816819,0.0018346772,0.0004145696,0.000014634331,0.000010430753,0.000078254576,0.0016115494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514836,0.00008911258,0.0007101471,0.0019490442,0.0009772406,0.0011261062],"domain_scores_gemma":[0.9946359,0.0025458485,0.00042883272,0.0018063268,0.000398877,0.0001842253],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023085598,0.0007428814,0.000855752,0.0010555848,0.00047485702,0.0012144353,0.0034656723,0.0004167257,0.00003128732],"category_scores_gemma":[0.0002029396,0.00069007656,0.0002949463,0.0005448886,0.00044929984,0.0010835023,0.0008422126,0.0006342327,0.00009557399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057621124,0.00002972043,0.000035324552,0.00021909329,0.000023733384,0.00006423158,0.0006118014,0.23672517,0.01137403,0.0011464765,0.00006173107,0.7496511],"study_design_scores_gemma":[0.0006690211,0.0003316,0.000029103609,0.0009479775,0.000018627441,0.00003661967,7.454314e-8,0.9738459,0.01344746,0.009144498,0.0006340085,0.0008951025],"about_ca_topic_score_codex":0.000012575059,"about_ca_topic_score_gemma":0.0000022191193,"teacher_disagreement_score":0.748756,"about_ca_system_score_codex":0.00035723276,"about_ca_system_score_gemma":0.0009485102,"threshold_uncertainty_score":0.9998224},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009438496,0.0008668955,0.9957909,0.00007668096,0.00046710306,0.00044439163,0.000005900966,0.0001402427,0.0012640536],"genre_scores_gemma":[0.29658055,0.00016097231,0.70269895,0.00034458333,0.00011545768,0.000001934875,0.0000019685447,0.000029698484,0.00006588095],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967098,0.000042073298,0.00061390176,0.0013417902,0.00076411286,0.0005282723],"domain_scores_gemma":[0.9974163,0.00041447574,0.0005297214,0.0012350695,0.00028392937,0.00012046385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010101863,0.00044800667,0.00067191024,0.0008963,0.00016247379,0.00025328895,0.0016818101,0.00025915157,0.0000044931226],"category_scores_gemma":[0.00012582788,0.00041879335,0.00014991238,0.00080965343,0.0008050538,0.0010100828,0.0013449979,0.0005818412,0.000002265942],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014342596,0.000040828414,0.0004912462,0.00025980247,0.000024407282,0.000056799796,0.0009029388,0.001588072,0.00590586,0.008454266,0.000007349929,0.9822541],"study_design_scores_gemma":[0.0007793995,0.00064094807,0.0012941217,0.0028718936,0.00004384003,0.00021061185,0.0000010253898,0.34087166,0.14374319,0.5071329,0.0006027788,0.0018076212],"about_ca_topic_score_codex":0.000037019123,"about_ca_topic_score_gemma":0.000015343889,"teacher_disagreement_score":0.98044646,"about_ca_system_score_codex":0.0001186974,"about_ca_system_score_gemma":0.0003455036,"threshold_uncertainty_score":0.9998264},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019351367,0.00024968822,0.990141,0.0024313128,0.0014383735,0.0005432453,0.000006177152,0.00016284201,0.0030922769],"genre_scores_gemma":[0.80014133,0.00004789126,0.19161932,0.0070863906,0.00070167484,0.000012388568,0.000008486531,0.00007914447,0.00030337303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936047,0.0001426202,0.0008162923,0.0023435445,0.0019139041,0.0011789186],"domain_scores_gemma":[0.99504656,0.0014422032,0.00043326302,0.002779651,0.00014617323,0.00015214736],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0022853361,0.00086661096,0.0009066058,0.001638702,0.00043959625,0.0010757975,0.0074354475,0.00045001827,0.00000826097],"category_scores_gemma":[0.00011431884,0.00061414414,0.00036092685,0.0016062646,0.00049901236,0.00036608297,0.0014726683,0.0024567368,0.000081887236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004929064,0.00003660989,0.000029473988,0.000020865176,0.000011427574,0.00008914312,0.0013074334,0.77991736,0.000015016185,0.04314557,0.000030643612,0.17539153],"study_design_scores_gemma":[0.0002461333,0.0002002929,0.00008472415,0.0003991573,0.000010595463,0.000050170995,4.6723972e-7,0.85702443,0.00005938553,0.1408759,0.00040001882,0.0006487393],"about_ca_topic_score_codex":0.00003144399,"about_ca_topic_score_gemma":0.00006415101,"teacher_disagreement_score":0.79852164,"about_ca_system_score_codex":0.00032816778,"about_ca_system_score_gemma":0.00067680795,"threshold_uncertainty_score":0.9999612},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047499992,0.0004089977,0.994955,0.00025918914,0.0023472535,0.0006283157,0.000009526217,0.0000963409,0.00082039915],"genre_scores_gemma":[0.57246673,0.000015834012,0.42639473,0.0007204547,0.00027819865,0.0000038742965,0.000010555881,0.000032202497,0.00007739998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99448186,0.0001990848,0.0012126042,0.001727092,0.0015685697,0.0008108138],"domain_scores_gemma":[0.99525285,0.0009123174,0.0009754399,0.0021712508,0.00050703035,0.0001810954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002059751,0.00066173595,0.0010409635,0.0006557463,0.0002337309,0.00053830276,0.003477206,0.00036102778,0.00002024388],"category_scores_gemma":[0.000083131614,0.0006131871,0.00029242964,0.00066378963,0.0007758345,0.0010566998,0.001964359,0.0011073115,0.00000440225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018367828,0.00013981367,0.0012503553,0.00017865794,0.00004941552,0.000066562825,0.000540417,0.5900154,0.0007579064,0.014119719,0.000006816639,0.39285654],"study_design_scores_gemma":[0.0005865951,0.00015414829,0.002814267,0.00020251422,0.000018818539,0.00002186325,4.821692e-7,0.98752004,0.0003592844,0.007579332,0.00005474658,0.00068793446],"about_ca_topic_score_codex":0.00017453961,"about_ca_topic_score_gemma":0.00009189787,"teacher_disagreement_score":0.57199174,"about_ca_system_score_codex":0.00055600074,"about_ca_system_score_gemma":0.00083157705,"threshold_uncertainty_score":0.99963194},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016757424,0.0000419428,0.98993033,0.0007848232,0.0057798214,0.0006770419,0.0000063685993,0.00017801266,0.0009259347],"genre_scores_gemma":[0.75424105,0.000018214008,0.24305892,0.0013002199,0.0007554022,0.000013204278,0.000027019996,0.00005347321,0.00053250423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537915,0.00011168629,0.00058685924,0.0017674463,0.0015684392,0.000586437],"domain_scores_gemma":[0.99795586,0.00012853633,0.00039758682,0.0010958699,0.00021949661,0.00020267369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063837017,0.00056350854,0.00043629017,0.0010338618,0.00041848968,0.0005331677,0.0015644792,0.00039621914,0.000081274215],"category_scores_gemma":[0.00004586907,0.00051242515,0.00019660025,0.00076692423,0.00035555998,0.00068979495,0.00043944782,0.0010799553,0.00009182226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049266477,0.00014510241,0.00020762614,0.00009606509,0.000016464379,0.000052566233,0.0006219375,0.4644927,0.009503873,0.008315244,0.000025456522,0.5164737],"study_design_scores_gemma":[0.00037651465,0.0004806607,0.00038051474,0.0004259511,0.000012720459,0.000049017977,3.2391057e-7,0.97988975,0.0060519115,0.01146924,0.00022389441,0.00063948554],"about_ca_topic_score_codex":0.00005959221,"about_ca_topic_score_gemma":0.000047430003,"teacher_disagreement_score":0.7525653,"about_ca_system_score_codex":0.0006889203,"about_ca_system_score_gemma":0.00072742894,"threshold_uncertainty_score":0.99973273},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011710066,0.0007076022,0.9852586,0.00038815365,0.0019324779,0.00085617526,0.000010579709,0.000120152654,0.010714554],"genre_scores_gemma":[0.106527515,0.000094169605,0.8913515,0.0004989038,0.00039439925,0.000012802478,0.000012529188,0.000065663575,0.0010425005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952981,0.000105609,0.00086487544,0.0018542978,0.0010321817,0.0008449321],"domain_scores_gemma":[0.99571735,0.0013057827,0.00080083025,0.001478365,0.0004814588,0.00021622554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019951581,0.0007125419,0.0010074057,0.001928589,0.00025562965,0.00043994797,0.0027296124,0.00075348123,0.00001051611],"category_scores_gemma":[0.00012523815,0.00065372005,0.00035879086,0.0012791702,0.0003642602,0.0012708722,0.0006822794,0.0013695628,0.000010566388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001742342,0.000030424591,0.000014839808,0.00016647977,0.000022756705,0.000010238766,0.00042576506,0.06304027,0.00017933754,0.2413879,0.000017499477,0.69468707],"study_design_scores_gemma":[0.00031279374,0.00027601747,0.000022711532,0.00029079115,0.000017082639,0.00003457087,2.0139986e-7,0.6481953,0.0007609246,0.34857467,0.001000135,0.00051480596],"about_ca_topic_score_codex":0.00002413273,"about_ca_topic_score_gemma":0.000022346103,"teacher_disagreement_score":0.69417226,"about_ca_system_score_codex":0.0002649912,"about_ca_system_score_gemma":0.00085440284,"threshold_uncertainty_score":0.9995914},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015563632,0.0006293536,0.9927233,0.00037469916,0.0015014459,0.00019476961,0.0000047523417,0.0001482287,0.0044079237],"genre_scores_gemma":[0.1765649,0.0016189623,0.8025575,0.011452162,0.00361928,0.000017332928,0.00008113801,0.0001663349,0.003922373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611324,0.00008128097,0.0006289571,0.0014507711,0.00095525326,0.00077049056],"domain_scores_gemma":[0.9978909,0.0005730511,0.00030216516,0.00091074186,0.00016846652,0.00015467363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010349767,0.0004268885,0.0005168518,0.0012245934,0.00015795136,0.00057120464,0.003686198,0.00022043285,0.000013485258],"category_scores_gemma":[0.00018073329,0.0003495058,0.000082510756,0.0018091507,0.0004944427,0.0014976794,0.001726622,0.0005034753,0.000078047306],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016415245,0.000044517685,0.0002784581,0.000043426764,0.000001965472,0.00006365829,0.00031813476,0.009788132,0.000017917715,0.009804968,0.000107723376,0.97952944],"study_design_scores_gemma":[0.00037893007,0.0000942096,0.00012153748,0.0009283399,0.0000022374904,0.000023797254,1.8742712e-7,0.92706734,0.0002566834,0.05736829,0.0131236175,0.0006348235],"about_ca_topic_score_codex":0.0000048368133,"about_ca_topic_score_gemma":0.00007629334,"teacher_disagreement_score":0.97889465,"about_ca_system_score_codex":0.00047947292,"about_ca_system_score_gemma":0.0011205473,"threshold_uncertainty_score":0.9998957},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024341149,0.0002700277,0.9910613,0.000453279,0.0036767165,0.001667499,0.000013771506,0.0007213604,0.0018926383],"genre_scores_gemma":[0.6001123,0.0000055856376,0.39661366,0.0015961375,0.001209674,0.00007849289,0.000026291696,0.000101477315,0.0002563705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99383724,0.00019421558,0.00083042996,0.002636301,0.0013887883,0.0011130477],"domain_scores_gemma":[0.9951415,0.0014169848,0.00053515675,0.0017209924,0.0007298252,0.00045552707],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002551883,0.00081270654,0.00097492355,0.0011828251,0.00053260993,0.0012831885,0.0035156321,0.00066092017,0.00001913904],"category_scores_gemma":[0.00013782995,0.0007463013,0.00025718028,0.0008835533,0.00015860781,0.0007910205,0.0005604043,0.0011306846,0.00019930283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002435984,0.000055031196,0.0002907897,0.00047606687,0.000039767954,0.00007735809,0.002319121,0.11051971,0.0005430138,0.0025905361,0.00002221792,0.88304204],"study_design_scores_gemma":[0.0007409736,0.0006176096,0.00019075914,0.0015070671,0.000028521747,0.000101146616,0.0000027224432,0.9758192,0.0014016125,0.0016088864,0.016760182,0.0012213561],"about_ca_topic_score_codex":0.000017964972,"about_ca_topic_score_gemma":0.00008840094,"teacher_disagreement_score":0.8818207,"about_ca_system_score_codex":0.0006021948,"about_ca_system_score_gemma":0.00082015054,"threshold_uncertainty_score":0.9997536},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022278676,0.000086617845,0.97541857,0.000076228695,0.00029353963,0.0014563274,0.0000052328,0.00018150939,0.0002033081],"genre_scores_gemma":[0.71822804,0.0000028539882,0.28160527,0.00004576652,0.00005364484,0.000003589949,0.0000012785958,0.000018214812,0.000041331077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969521,0.000045118642,0.00061870296,0.0013231949,0.0005695579,0.00049132184],"domain_scores_gemma":[0.9974639,0.00055135076,0.00059035455,0.0011476193,0.00018515627,0.000061623134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007384256,0.00045239116,0.0008605927,0.00086176855,0.00018464738,0.00014118227,0.0021494634,0.00027683208,0.0000036822598],"category_scores_gemma":[0.000049636845,0.00041808066,0.000120416815,0.00037463327,0.00047473772,0.0002330705,0.0010305418,0.00055125455,0.000005040289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007678079,0.0010836122,0.0019587127,0.00027978636,0.00020015023,0.000090017376,0.008827679,0.46605,0.008831386,0.010647783,0.000008001821,0.5019461],"study_design_scores_gemma":[0.00078243075,0.0018803689,0.00022675723,0.00048450253,0.00003329165,0.00002191922,0.0000052273203,0.9620547,0.012479715,0.021101484,0.00023215935,0.0006973958],"about_ca_topic_score_codex":0.000045815792,"about_ca_topic_score_gemma":0.000015381416,"teacher_disagreement_score":0.6959494,"about_ca_system_score_codex":0.00024381482,"about_ca_system_score_gemma":0.00029509986,"threshold_uncertainty_score":0.9998271},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006523748,0.00054049946,0.9914016,0.0028584749,0.0031187595,0.00063469383,0.000063666055,0.00014602616,0.0005839012],"genre_scores_gemma":[0.31954354,0.000044282344,0.6721789,0.0072001517,0.00059892517,0.0000074202635,0.00023776329,0.00004805798,0.00014094157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99397063,0.0001011971,0.000663582,0.003295746,0.0011251374,0.0008437286],"domain_scores_gemma":[0.99035156,0.0007326794,0.00032295776,0.008292499,0.00015094088,0.00014937864],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0019140544,0.00052230456,0.0007499677,0.0013057903,0.00017096769,0.001387072,0.031620767,0.00042751618,0.000023630533],"category_scores_gemma":[0.0006163983,0.0004720528,0.00004964604,0.001008682,0.00050518435,0.0038745266,0.019468946,0.0008026679,0.00005139233],"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.00008486669,0.00012300014,0.016687177,0.00028115415,0.000044038512,0.000505764,0.0011706483,0.16952819,0.00022091853,0.030679582,0.0011634816,0.7795112],"study_design_scores_gemma":[0.00041356919,0.00010380802,0.019110033,0.0003602533,0.000011220885,0.000037350397,3.966326e-7,0.9245658,0.0001844206,0.051591482,0.0028808415,0.00074084825],"about_ca_topic_score_codex":0.00054388813,"about_ca_topic_score_gemma":0.022006694,"teacher_disagreement_score":0.7787703,"about_ca_system_score_codex":0.0002475666,"about_ca_system_score_gemma":0.0012438095,"threshold_uncertainty_score":0.99977314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053824023,0.0015414597,0.98900145,0.00044956,0.0010984038,0.00030563836,0.000004238804,0.00008435681,0.0021324884],"genre_scores_gemma":[0.64453524,0.00021601994,0.3520407,0.0016697532,0.00020860249,0.000009162305,0.000022306507,0.00003959811,0.0012586254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687797,0.000041463012,0.00046129778,0.0014516804,0.0006771422,0.00049044815],"domain_scores_gemma":[0.99838877,0.00048354163,0.00020264307,0.0007024467,0.00010732797,0.00011527147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081009086,0.00034256667,0.00038418625,0.0011302918,0.00021535995,0.00070652907,0.0012745078,0.00021150042,0.000008427552],"category_scores_gemma":[0.00008936745,0.00036915232,0.00007649828,0.0009794023,0.00024170031,0.000731778,0.0009727888,0.0006233035,0.000009602001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041566855,0.000035047444,0.0013625142,0.000043186443,0.000011130816,0.000053364776,0.000643103,0.073745005,0.00096054695,0.030733023,0.0000755891,0.8923333],"study_design_scores_gemma":[0.00037507882,0.00009369097,0.0012108077,0.00035482107,0.000005388174,0.00011615074,3.157585e-7,0.8293495,0.0005780964,0.16589814,0.0013119801,0.0007059815],"about_ca_topic_score_codex":0.0001054259,"about_ca_topic_score_gemma":0.00018491426,"teacher_disagreement_score":0.8916274,"about_ca_system_score_codex":0.000095481555,"about_ca_system_score_gemma":0.00028912057,"threshold_uncertainty_score":0.999876},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029602492,0.0006753543,0.9656298,0.0012248384,0.0023110546,0.0003846849,0.0000075892367,0.000108953645,0.00005521567],"genre_scores_gemma":[0.68859804,0.00004842175,0.309629,0.001378533,0.00030361357,0.000006125324,0.000022730388,0.0000072856624,0.000006258355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997006,0.00009069946,0.00037648535,0.0014148372,0.00069303875,0.0004189456],"domain_scores_gemma":[0.99806935,0.0004344522,0.00019614208,0.0009567457,0.0002095397,0.00013376481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009083942,0.00032441833,0.00037487835,0.00059728563,0.0001450407,0.0008368509,0.0016291791,0.00020879418,0.000009277202],"category_scores_gemma":[0.0001523455,0.0003050147,0.00006010608,0.001471646,0.00018872811,0.00047435454,0.0028113688,0.00065108243,0.000039873157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047519957,0.000028732607,0.0005986072,0.00007218049,0.0000064769774,0.00001563323,0.0004552449,0.78180337,0.00023188701,0.00054218934,0.000050694303,0.21619025],"study_design_scores_gemma":[0.00024697298,0.00007653739,0.002801201,0.00017807673,0.0000042487595,0.00004939187,1.11070975e-7,0.9745637,0.0023734076,0.019045934,0.0002937581,0.00036665966],"about_ca_topic_score_codex":0.000037102127,"about_ca_topic_score_gemma":0.0000104960745,"teacher_disagreement_score":0.6589955,"about_ca_system_score_codex":0.00013149,"about_ca_system_score_gemma":0.0004938725,"threshold_uncertainty_score":0.9999402},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006512156,0.0011703533,0.99304724,0.00077259244,0.0031355936,0.00079061586,0.0000147148,0.00022389501,0.00083847216],"genre_scores_gemma":[0.004828812,0.00006824974,0.9897456,0.0047143605,0.00026257662,0.000011874249,0.000003313776,0.00003713479,0.00032805264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958478,0.000027474985,0.00058046106,0.0019107449,0.0007816113,0.00085189706],"domain_scores_gemma":[0.99668807,0.0007042526,0.00036865368,0.0017728718,0.00026354557,0.00020262595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067477603,0.00062098145,0.00071822264,0.0004119736,0.00029638322,0.0007754571,0.0039793914,0.00031949658,0.000015475529],"category_scores_gemma":[0.00019434416,0.00055850873,0.00024791047,0.00065596646,0.00030688345,0.00095481117,0.0017274576,0.000668321,0.00008355092],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036024069,0.000019108324,0.000035768335,0.0000793217,0.00000811932,0.000013670057,0.00032028358,0.008630046,0.0000084514095,0.08747971,0.000011201049,0.9033907],"study_design_scores_gemma":[0.00028036136,0.000081523904,0.000057159876,0.0011388393,0.0000060156394,0.0000308368,2.3501754e-7,0.55092114,0.0000686136,0.44334683,0.0034761138,0.0005923032],"about_ca_topic_score_codex":0.000009318877,"about_ca_topic_score_gemma":0.000025845009,"teacher_disagreement_score":0.9027984,"about_ca_system_score_codex":0.00039600904,"about_ca_system_score_gemma":0.00054420234,"threshold_uncertainty_score":0.99968666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092221244,0.00016087596,0.99593484,0.00003862328,0.000715725,0.0001367917,0.000045641704,0.0000059408194,0.0020393566],"genre_scores_gemma":[0.9733814,0.00001021961,0.026158812,0.000087694,0.00015904204,0.0000012078606,0.000013343994,0.000011185058,0.00017708531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989774,0.000007004091,0.00019701004,0.0004015623,0.00024235333,0.00017462025],"domain_scores_gemma":[0.9993276,0.00019635359,0.00013352775,0.00021335646,0.00008102107,0.00004814468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013006762,0.00017321327,0.00026458374,0.00018194129,0.000039741823,0.000049008213,0.00029548685,0.0000854061,0.00016125434],"category_scores_gemma":[0.000014163705,0.00014589682,0.000045063196,0.0001173222,0.00019688191,0.000076593875,0.00022818618,0.00029407258,0.00000984225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072160055,0.000010974651,0.000977686,0.000041946838,0.000017769624,0.0000015948717,0.00019409384,0.0018575267,0.00005599398,0.3337541,0.000009353695,0.66307175],"study_design_scores_gemma":[0.00014845475,0.000112082555,0.00028952365,0.00028567066,0.000017557757,0.0000011730975,5.469989e-7,0.55154914,0.00027415316,0.44688693,0.00020466224,0.00023011211],"about_ca_topic_score_codex":0.000032833002,"about_ca_topic_score_gemma":0.0000022826125,"teacher_disagreement_score":0.9724592,"about_ca_system_score_codex":0.000024557914,"about_ca_system_score_gemma":0.00008663643,"threshold_uncertainty_score":0.59494996},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047400836,0.00064734346,0.9397772,0.000017097665,0.010175675,0.0005484385,0.000008710422,0.00026103033,0.0011636725],"genre_scores_gemma":[0.9355583,0.000030799627,0.062150717,0.000061734376,0.0019813224,0.000005064725,0.0000024803026,0.00013587248,0.000073666124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997242,0.000014205454,0.00044634254,0.00090967724,0.00056840444,0.0008193992],"domain_scores_gemma":[0.9983209,0.00046718417,0.000103766746,0.0008014188,0.00012884408,0.00017790681],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040580807,0.00065725244,0.00064255664,0.00063624396,0.00016691143,0.00029946314,0.00087310513,0.00034574347,0.000013812522],"category_scores_gemma":[0.00005757226,0.00068942254,0.00015233278,0.00034968337,0.00016703056,0.0004797494,0.00037695738,0.0010433896,0.00010964193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006670518,0.000007783666,0.013700496,0.00016715095,0.000031162203,0.00008162443,0.0003148394,0.6555177,0.30253947,0.000023089951,0.000006394606,0.027603619],"study_design_scores_gemma":[0.0008192156,0.00017527642,0.0041748723,0.0034381622,0.00003885544,0.00009272266,0.0000012688982,0.6078024,0.37798586,0.0023086104,0.0007373324,0.0024254466],"about_ca_topic_score_codex":0.00009411001,"about_ca_topic_score_gemma":0.00002134944,"teacher_disagreement_score":0.8881575,"about_ca_system_score_codex":0.00083077996,"about_ca_system_score_gemma":0.00022773926,"threshold_uncertainty_score":0.9995557},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019483054,0.000636571,0.966677,0.0010234766,0.010324355,0.0014060591,0.000010987364,0.0004087249,0.000029733543],"genre_scores_gemma":[0.49062347,0.000015971664,0.5070928,0.001082058,0.0010887807,0.00005481387,0.0000089402665,0.00003199144,0.000001221664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926288,0.0004553692,0.0008731624,0.003033661,0.0011962916,0.0018127187],"domain_scores_gemma":[0.9937367,0.002529858,0.0005488025,0.002467767,0.00047694426,0.0002399224],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0055408254,0.0008274139,0.0011335982,0.0006809949,0.0005215734,0.0018711775,0.0057352036,0.00058130064,0.0000027361486],"category_scores_gemma":[0.00038337856,0.0007653956,0.00042359714,0.0025146785,0.00045523542,0.0007782314,0.003934818,0.0014864646,0.000016983213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019423045,0.000067444715,0.0055127004,0.00016905759,0.000023439736,0.00004401573,0.001037098,0.5623478,0.00013291046,0.0007576548,0.000038743372,0.42984968],"study_design_scores_gemma":[0.0006774028,0.00024935542,0.006979778,0.00060055434,0.000009264811,0.00005166133,0.0000014014577,0.84124863,0.0016055831,0.14720306,0.0003332126,0.0010400844],"about_ca_topic_score_codex":0.00006627439,"about_ca_topic_score_gemma":0.00011893648,"teacher_disagreement_score":0.4711404,"about_ca_system_score_codex":0.0004031845,"about_ca_system_score_gemma":0.0014410008,"threshold_uncertainty_score":0.9996442},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004808664,0.0005079906,0.9872536,0.00066979625,0.00078266504,0.00023821024,0.0000018322116,0.00006902077,0.005668239],"genre_scores_gemma":[0.9911949,0.00006179516,0.0030458078,0.0026331164,0.0012658731,0.000008400993,0.000027017713,0.000046940488,0.0017161175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975131,0.0000021334772,0.00035015456,0.0010386357,0.00065308827,0.0004428857],"domain_scores_gemma":[0.9988477,0.000049629194,0.00030821693,0.00043161478,0.00034512163,0.000017697064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041008973,0.00040324606,0.00045179,0.00072567683,0.00022068106,0.00083632435,0.0005833505,0.00016008454,0.000039435134],"category_scores_gemma":[0.000053470358,0.00033709145,0.00007311085,0.0005630393,0.0003271463,0.0015200912,0.0005801755,0.00035406352,0.00006177462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066383844,0.00013677884,0.0032918407,0.0024918846,0.00008361176,0.000050235827,0.0003523498,0.10125116,0.00038097904,0.03379509,0.000049997558,0.8580497],"study_design_scores_gemma":[0.00053348695,0.000028987435,0.0001902126,0.0015709166,0.00012382746,0.0000059097647,0.0000017937398,0.891081,0.00030894185,0.10022475,0.004726412,0.001203801],"about_ca_topic_score_codex":0.0000665392,"about_ca_topic_score_gemma":0.000053076157,"teacher_disagreement_score":0.98638624,"about_ca_system_score_codex":0.000058687358,"about_ca_system_score_gemma":0.00015834428,"threshold_uncertainty_score":0.9999081},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055795744,0.0005430042,0.94158864,0.00034313288,0.00073118246,0.0008963103,0.0000142766885,0.00005068782,0.00003701627],"genre_scores_gemma":[0.723891,0.00017495765,0.27569535,0.00015395536,0.000020319498,0.000022389047,0.00003154767,0.000007654396,0.000002816994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969281,0.0004067564,0.0007912128,0.00073776505,0.00081275735,0.00032341495],"domain_scores_gemma":[0.99649805,0.00041340847,0.0006488326,0.0017967385,0.0005637861,0.00007916739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020933403,0.00023018505,0.0004862065,0.00056983967,0.000071245675,0.00020973849,0.0037970901,0.00022568165,0.00001423671],"category_scores_gemma":[0.00012404927,0.00021289008,0.00011611275,0.0013706717,0.00038292722,0.00052045996,0.0028308148,0.0004823194,0.0000050963877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010826878,0.0001769226,0.002837749,0.00013618953,0.000012975988,7.214752e-7,0.0023268673,0.8210124,0.00093998434,0.00012435285,0.00007472932,0.17234628],"study_design_scores_gemma":[0.00052590406,0.00015798514,0.0016426283,0.00027606823,0.000004208674,0.0000013844262,8.299224e-7,0.9860202,0.0077618863,0.0033863843,0.000027754888,0.00019476698],"about_ca_topic_score_codex":0.00010277616,"about_ca_topic_score_gemma":0.000011120915,"teacher_disagreement_score":0.66809523,"about_ca_system_score_codex":0.00011049586,"about_ca_system_score_gemma":0.00041186306,"threshold_uncertainty_score":0.8681406},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09616904,0.0004568406,0.8980559,0.00022443895,0.0013844096,0.00044138712,0.000005149717,0.000036593723,0.0032262295],"genre_scores_gemma":[0.9766267,0.00008373335,0.020821862,0.001961728,0.00022743203,0.000002491336,0.0000041374606,0.00003280003,0.00023910437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967141,0.000032262367,0.00038230568,0.0015418647,0.0006531162,0.0006763533],"domain_scores_gemma":[0.99823725,0.0002909158,0.00027860713,0.0008687844,0.0001778235,0.00014658726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041170098,0.00058195996,0.00060534687,0.00072000193,0.00039532754,0.00059689564,0.0014395984,0.00022824193,0.000011841466],"category_scores_gemma":[0.000036540234,0.00052544585,0.000078921694,0.00028319453,0.00048197218,0.0010019186,0.001574433,0.0009698773,0.000041205032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015224761,0.00020505632,0.034166746,0.00045616442,0.00021991055,0.00018918444,0.007183455,0.13538799,0.011035654,0.037844047,0.0001370395,0.77302253],"study_design_scores_gemma":[0.0005411246,0.00041494236,0.02635157,0.0011890252,0.000018582397,0.0002592218,3.96227e-7,0.9634871,0.0045404024,0.0018844814,0.0003120767,0.0010011077],"about_ca_topic_score_codex":0.000046693105,"about_ca_topic_score_gemma":0.000013880184,"teacher_disagreement_score":0.8804577,"about_ca_system_score_codex":0.00024959157,"about_ca_system_score_gemma":0.00026807695,"threshold_uncertainty_score":0.99971974},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010480941,0.0016816789,0.9864231,0.00018883181,0.00211171,0.002098099,0.000018560604,0.0002098083,0.0071634105],"genre_scores_gemma":[0.07343715,0.000045035977,0.9238606,0.0005038008,0.00084944774,0.00011708807,0.000012646832,0.00005196819,0.0011222654],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953428,0.000042686544,0.00058745587,0.0021466769,0.0007973671,0.0010830123],"domain_scores_gemma":[0.99518764,0.0022577357,0.00057244586,0.0012391836,0.00054543535,0.00019757116],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013856246,0.0007028971,0.00081601384,0.00052740634,0.00049525965,0.0010840994,0.0038260552,0.0006375488,0.0000148700765],"category_scores_gemma":[0.00055396586,0.0005840028,0.0003025099,0.0003982205,0.00035720025,0.00069161586,0.001117436,0.00087983464,0.000028744656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030273906,0.000050372044,0.00015190161,0.00028776162,0.00005138168,0.000016319867,0.013059336,0.0049538887,0.0000835318,0.43933797,0.00006790732,0.54190934],"study_design_scores_gemma":[0.0006042127,0.0006715546,0.00015173413,0.0020385378,0.000028319055,0.000036742586,0.000005471719,0.29710746,0.0015716611,0.6947598,0.0018744457,0.0011501141],"about_ca_topic_score_codex":0.000017965423,"about_ca_topic_score_gemma":0.00018870411,"teacher_disagreement_score":0.54075927,"about_ca_system_score_codex":0.0003431705,"about_ca_system_score_gemma":0.0012777403,"threshold_uncertainty_score":0.99995285},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019433754,0.00010637613,0.98788095,0.00093502307,0.0018716508,0.0004910274,0.000003825513,0.00025322032,0.008438489],"genre_scores_gemma":[0.08550688,0.000015807513,0.911414,0.00070280716,0.0009868458,0.000007820669,0.00000987552,0.00007223174,0.001283689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955124,0.00005206523,0.00054481736,0.0019555232,0.0011725258,0.00076266844],"domain_scores_gemma":[0.99629444,0.00058997463,0.00048474353,0.0022126576,0.00024532597,0.00017288249],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009104038,0.0005789486,0.0005577253,0.0006420342,0.0004331282,0.00062516873,0.004079711,0.00029404953,0.00006406964],"category_scores_gemma":[0.00013558638,0.00049540744,0.00010936029,0.0007110527,0.00067812554,0.00092199456,0.0016560848,0.0014253099,0.00014369837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016372085,0.000017327287,0.00016865417,0.00002981058,0.000012514691,0.000060158563,0.0004942925,0.43671185,0.00007682171,0.0895634,0.0000069238135,0.4728419],"study_design_scores_gemma":[0.00044454975,0.00018917251,0.00021659347,0.0002726033,0.000013959273,0.00008338757,2.9359444e-7,0.97882116,0.00034558584,0.013157474,0.005577905,0.0008772874],"about_ca_topic_score_codex":0.000037752856,"about_ca_topic_score_gemma":0.00005673951,"teacher_disagreement_score":0.5421094,"about_ca_system_score_codex":0.00044270867,"about_ca_system_score_gemma":0.001230155,"threshold_uncertainty_score":0.9997498},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021890405,0.000089451394,0.96431273,0.00046889964,0.009485382,0.002340282,0.000066474226,0.00021859333,0.022799276],"genre_scores_gemma":[0.8094694,0.000038767477,0.14549756,0.004288571,0.0017062486,0.00065584644,0.00015551226,0.00024618767,0.037941877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960703,0.00009523546,0.0009163673,0.0016906587,0.00054202037,0.0006853929],"domain_scores_gemma":[0.9960293,0.0014128188,0.00075171277,0.0010356419,0.0006141439,0.00015636571],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005492122,0.00068738667,0.0007476611,0.0012180409,0.00029004828,0.0002960037,0.0011735469,0.0006791137,0.0017911141],"category_scores_gemma":[0.00018026853,0.0006569191,0.00029770468,0.00031449174,0.00034755637,0.00070196344,0.0003083724,0.0016130181,0.0007156888],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020032849,0.0011143255,0.00031907702,0.0006236631,0.00053970463,0.00029607245,0.027556641,0.039051227,0.0062511116,0.026063487,0.005346002,0.8908354],"study_design_scores_gemma":[0.0068627135,0.0025232425,0.0013617823,0.0063030473,0.00018409606,0.0020536259,0.00007691042,0.7114801,0.028696897,0.0291658,0.20581888,0.0054729264],"about_ca_topic_score_codex":0.00008975576,"about_ca_topic_score_gemma":0.0002608315,"teacher_disagreement_score":0.8853625,"about_ca_system_score_codex":0.00067345717,"about_ca_system_score_gemma":0.00036165395,"threshold_uncertainty_score":0.9995882},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04045706,0.000028705448,0.956948,0.00046927654,0.0004376601,0.0010995744,0.0000031549669,0.0000675313,0.00048907084],"genre_scores_gemma":[0.9117348,0.0000018384629,0.08752432,0.0004413443,0.00012691079,0.000019727187,0.0000029614123,0.000028147877,0.000119916454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958958,0.00006983366,0.0006142227,0.0017085832,0.0011811719,0.00053035584],"domain_scores_gemma":[0.997487,0.00024735116,0.0002574687,0.0017530299,0.0000775102,0.000177636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091342843,0.00055947027,0.0007489184,0.0012464119,0.00008222731,0.00022793587,0.0030115868,0.00016232983,0.000004751412],"category_scores_gemma":[0.000043991862,0.0004372958,0.00008195559,0.000507182,0.00010610578,0.00025076658,0.0015448282,0.0009570748,0.000011429944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022641767,0.0004406754,0.00046336043,0.000021842692,0.0000066569087,0.000018188104,0.0035113099,0.83926725,0.000013965251,0.0032847507,0.0000010110186,0.15294835],"study_design_scores_gemma":[0.0006484066,0.00347915,0.0006956764,0.0003017531,0.0000046250043,0.000004964207,0.0000015722254,0.9827064,0.00011360225,0.011579575,0.0000047970375,0.00045947538],"about_ca_topic_score_codex":0.000047747104,"about_ca_topic_score_gemma":0.00071280694,"teacher_disagreement_score":0.8712778,"about_ca_system_score_codex":0.00023448783,"about_ca_system_score_gemma":0.00025491344,"threshold_uncertainty_score":0.9998079},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021242938,0.000028083487,0.98964405,0.00093066995,0.0038719303,0.0011831311,0.000027326545,0.000010439406,0.00409195],"genre_scores_gemma":[0.89649904,0.000015643927,0.08023686,0.014382575,0.001029359,0.00007338755,0.0000676231,0.00012246663,0.007573034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672043,0.000032487063,0.0004342917,0.0013797204,0.00073911616,0.0006939601],"domain_scores_gemma":[0.9972607,0.00078602426,0.00030895747,0.0013210749,0.00018410741,0.00013911865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041270608,0.00050762517,0.00041014355,0.000744837,0.00050771545,0.00040801484,0.0024745848,0.00018670007,0.000113430135],"category_scores_gemma":[0.00007014056,0.0004071355,0.0002536658,0.00041924365,0.00021209299,0.0008448365,0.0009372165,0.0005735312,0.0003419342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022133238,0.0003399914,0.00015721204,0.00009786238,0.00031395812,0.00013534521,0.006375783,0.575169,0.11049251,0.27750155,0.0030911404,0.026104271],"study_design_scores_gemma":[0.0008424862,0.0020808363,0.00038696366,0.00065831974,0.000076651995,0.00015757054,0.0000118984435,0.8480825,0.08134711,0.035885267,0.028766131,0.001704289],"about_ca_topic_score_codex":0.000023851477,"about_ca_topic_score_gemma":0.000012749116,"teacher_disagreement_score":0.9094072,"about_ca_system_score_codex":0.00069542235,"about_ca_system_score_gemma":0.00035449618,"threshold_uncertainty_score":0.99983805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003467869,0.0001907115,0.98920447,0.0004230952,0.0016227353,0.00032500265,0.00003699413,0.00009732631,0.00775291],"genre_scores_gemma":[0.047975775,0.00010138213,0.94899285,0.001068845,0.000386968,0.000017205659,0.000035065394,0.000048432004,0.0013734576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678254,0.000016695783,0.0005574377,0.0013204283,0.0008522209,0.0004706485],"domain_scores_gemma":[0.99697095,0.00032329492,0.0003581845,0.001907857,0.0002899799,0.00014974886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059997034,0.0003951971,0.00049251615,0.00061872747,0.00013900308,0.00030910986,0.004099029,0.00021682856,0.00004340525],"category_scores_gemma":[0.00009570565,0.00036304133,0.0001082794,0.0007117238,0.00053053454,0.00063993875,0.0013513137,0.000541523,0.00017722453],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011956154,0.000033012766,0.00006846977,0.000027317345,0.000010440705,0.000014600196,0.00036077554,0.0012820732,0.00016534336,0.0891438,0.0001672439,0.90872574],"study_design_scores_gemma":[0.0009547404,0.001346019,0.0014213399,0.002107929,0.00004455656,0.00035043148,0.000002197464,0.6718776,0.01129023,0.24090202,0.0666158,0.0030871134],"about_ca_topic_score_codex":0.00017740033,"about_ca_topic_score_gemma":0.000039467624,"teacher_disagreement_score":0.90563864,"about_ca_system_score_codex":0.00018689274,"about_ca_system_score_gemma":0.00091560604,"threshold_uncertainty_score":0.99988216},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047517586,0.000068383415,0.98984253,0.00026980252,0.0025969024,0.0018485612,0.0000013721826,0.00015109884,0.00046957296],"genre_scores_gemma":[0.710286,0.000041232637,0.28478727,0.0009852021,0.00081568136,0.0001840778,0.000015800433,0.00012258302,0.0027621607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698365,0.0002096705,0.00062523346,0.0009685215,0.00049263804,0.00072028366],"domain_scores_gemma":[0.9964092,0.0025075427,0.00044176652,0.000326674,0.0002502174,0.000064624015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016489689,0.00037347272,0.000591555,0.0008957128,0.00066436455,0.000044386903,0.00042605572,0.00045878996,0.00003896713],"category_scores_gemma":[0.0005122104,0.00034455612,0.00012123971,0.00033887514,0.00018055904,0.00021980093,0.0004359259,0.0015296822,0.000079308615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009005895,0.000031008723,0.016655175,0.00095304643,0.000028387129,0.000006912965,0.007930051,0.02344291,0.00042583997,0.00015856755,0.000009723096,0.9503494],"study_design_scores_gemma":[0.00092918676,0.00021744215,0.0436775,0.002463573,0.000026752317,0.0000038146043,0.000016049611,0.94665146,0.00005482251,0.0051850164,0.00034595057,0.00042840623],"about_ca_topic_score_codex":0.00007056228,"about_ca_topic_score_gemma":0.003413367,"teacher_disagreement_score":0.94992095,"about_ca_system_score_codex":0.0008300541,"about_ca_system_score_gemma":0.0002825381,"threshold_uncertainty_score":0.99990064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013144119,0.000687495,0.98234916,0.0007925802,0.013236955,0.0013773051,0.0000054245834,0.00023276272,0.00000393144],"genre_scores_gemma":[0.46123362,0.000014897893,0.53752923,0.00057975785,0.0005023403,0.0001159313,0.000007678233,0.00001539416,0.0000011223705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956656,0.00012152351,0.00054852664,0.0020234173,0.00080936536,0.00083156803],"domain_scores_gemma":[0.99676013,0.00078061863,0.00040034187,0.001452901,0.00046981772,0.00013616485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012547276,0.00046069844,0.00043890218,0.000563825,0.0003087628,0.0006946292,0.0033625062,0.0004640672,0.0000032541134],"category_scores_gemma":[0.00015525943,0.00046408255,0.00017986026,0.0012337461,0.0003598342,0.0006865055,0.0023480924,0.0009535956,0.000013748466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010041525,0.00003814369,0.00020181997,0.000052760686,0.00000881952,0.0000029789674,0.00083003804,0.8568591,0.0001929287,0.00031627674,0.000008823057,0.14147826],"study_design_scores_gemma":[0.00062135357,0.000114140916,0.0030224386,0.00015856921,0.000005908135,0.000016404416,8.3604783e-7,0.96025455,0.0006687449,0.034531433,0.00009475273,0.00051088113],"about_ca_topic_score_codex":0.000075601536,"about_ca_topic_score_gemma":0.00020530914,"teacher_disagreement_score":0.4599192,"about_ca_system_score_codex":0.00095490983,"about_ca_system_score_gemma":0.0009721098,"threshold_uncertainty_score":0.9997811},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047273372,0.00016067535,0.99625635,0.0001136647,0.00087606895,0.0011712885,0.0000113638025,0.00005288547,0.00088499225],"genre_scores_gemma":[0.2247301,0.000014769671,0.7750064,0.000047387493,0.00006236605,0.00002212936,0.000007811253,0.000015443426,0.000093575676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997209,0.00006648817,0.0008180992,0.0009303131,0.00069312606,0.0002829685],"domain_scores_gemma":[0.99609137,0.00054204976,0.00088443654,0.0017568171,0.0006785719,0.000046730787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023051081,0.00029028367,0.000520498,0.0005409749,0.00007451408,0.00007801091,0.002153078,0.00026588052,0.0000034061752],"category_scores_gemma":[0.0006836444,0.00025629142,0.00013328773,0.00043119944,0.00064299244,0.0007398094,0.0003810391,0.00027539127,0.0000046287278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046734905,0.000073722375,0.0000751524,0.0009369397,0.000012442151,2.417267e-7,0.0019235164,0.041186888,0.009403478,0.12883532,0.0000030594979,0.8175025],"study_design_scores_gemma":[0.00017667985,0.00028459902,0.00026112952,0.00035290638,0.000007593075,0.0000027072938,3.5718756e-7,0.84477955,0.097222395,0.05641773,0.00023389808,0.00026045783],"about_ca_topic_score_codex":0.000020062871,"about_ca_topic_score_gemma":0.0000056587764,"teacher_disagreement_score":0.817242,"about_ca_system_score_codex":0.00018528731,"about_ca_system_score_gemma":0.0005155033,"threshold_uncertainty_score":0.9999889},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17657277,0.0001902866,0.82182837,0.000054282413,0.0009992413,0.00028907513,0.000015133791,0.000020197873,0.0000306729],"genre_scores_gemma":[0.9642661,0.000015725715,0.035519056,0.000068755486,0.00008314195,0.000002010622,0.0000068361437,0.000022065293,0.00001626153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974759,0.00019082437,0.00067895476,0.00070321903,0.0006427932,0.0003083119],"domain_scores_gemma":[0.99828404,0.00021329997,0.00074659084,0.0005717462,0.00013977836,0.00004456065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011116447,0.00028185497,0.000515138,0.00038409128,0.00011700719,0.00011827299,0.0008269391,0.00024309917,0.000025288593],"category_scores_gemma":[0.00006043514,0.00022484572,0.00006173789,0.00040279166,0.0010227218,0.0002562745,0.0005389242,0.0002637411,4.2218386e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035718214,0.000010723887,0.001205364,0.00006448602,0.0000015718315,0.0000018080732,0.00015894735,0.76771104,0.22668539,0.0024873782,4.015039e-7,0.0016371373],"study_design_scores_gemma":[0.0003297385,0.000061582046,0.0018166989,0.0005283567,0.000011007131,0.000034026252,2.9843068e-7,0.97175753,0.017469613,0.007819063,0.0000021850974,0.0001698881],"about_ca_topic_score_codex":0.00020040202,"about_ca_topic_score_gemma":0.00005247495,"teacher_disagreement_score":0.7876934,"about_ca_system_score_codex":0.00015741681,"about_ca_system_score_gemma":0.00021618923,"threshold_uncertainty_score":0.9168942},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062564947,0.00030269858,0.9917263,0.00013926908,0.00047433868,0.00066567794,0.0000119523975,0.000058429105,0.0003648505],"genre_scores_gemma":[0.7038756,0.000031472464,0.29575965,0.00018155819,0.000057177604,0.000007969515,0.00002554047,0.000028512335,0.000032515934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995743,0.00012667401,0.0009966395,0.0012484299,0.0013629904,0.0005223171],"domain_scores_gemma":[0.99700105,0.0004136012,0.0008526122,0.00093654596,0.0007150665,0.000081135746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010424318,0.00048699218,0.000776898,0.0010195179,0.00008380842,0.0001437242,0.0027950078,0.00022273071,0.0000073310084],"category_scores_gemma":[0.000115083945,0.0004550788,0.00018679218,0.0008980744,0.00082951103,0.0006765633,0.0010455362,0.000546814,0.000009326277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016839494,0.00006822969,0.000010973236,0.00020612968,0.000023542387,0.0000020421621,0.0008786658,0.7057475,0.013292125,0.22178559,2.1019744e-7,0.057968166],"study_design_scores_gemma":[0.000119014614,0.00016538949,0.00017098543,0.00040879412,0.000008438341,0.000024822166,4.779524e-7,0.838149,0.029968143,0.13060434,0.000012446379,0.00036812192],"about_ca_topic_score_codex":0.000013544116,"about_ca_topic_score_gemma":0.0000022788904,"teacher_disagreement_score":0.6976191,"about_ca_system_score_codex":0.00026483074,"about_ca_system_score_gemma":0.0023110292,"threshold_uncertainty_score":0.9997901},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009120716,0.00035636593,0.9955129,0.00018103985,0.0010822405,0.0012837248,0.0000059795857,0.00028973527,0.0011967958],"genre_scores_gemma":[0.10551687,0.0000022575525,0.8930714,0.00065085496,0.00042557353,0.000045125762,0.000055701094,0.0000693595,0.00016283289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943886,0.00016353234,0.0006891338,0.0023980471,0.001402777,0.00095792284],"domain_scores_gemma":[0.99491113,0.0025977425,0.0006194709,0.0010578303,0.0006244007,0.00018943207],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020089494,0.00074690225,0.0007697197,0.0011792012,0.0005269724,0.0013722809,0.003744024,0.00038345496,0.000014897634],"category_scores_gemma":[0.00040219666,0.000724694,0.00027219346,0.0009803566,0.0004573761,0.0010926118,0.0015052996,0.0012622295,0.000012029208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014231315,0.000018798977,0.000022513175,0.00003822397,0.000012749092,0.000015706966,0.0002149379,0.62746835,0.00002233287,0.0069669206,0.0000019565148,0.36520326],"study_design_scores_gemma":[0.0006192891,0.00031604726,0.00007209832,0.00033091044,0.000012749632,0.000039596678,5.899368e-7,0.9833354,0.000613108,0.01340796,0.00041955893,0.0008326923],"about_ca_topic_score_codex":0.0000059162703,"about_ca_topic_score_gemma":0.0000029079858,"teacher_disagreement_score":0.36437058,"about_ca_system_score_codex":0.0003478664,"about_ca_system_score_gemma":0.0011818996,"threshold_uncertainty_score":0.99966437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005838719,0.00021759927,0.99656546,0.00021339845,0.0013391777,0.00083643856,0.000010291789,0.00061008753,0.00014918568],"genre_scores_gemma":[0.017449874,0.000029462344,0.98169684,0.00031149804,0.0002946929,0.00003550634,0.000018194542,0.000049974235,0.00011392718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965857,0.000015932215,0.00049210025,0.0015159805,0.000782845,0.00060743076],"domain_scores_gemma":[0.9974907,0.0003880681,0.00021395207,0.0014785787,0.0003008541,0.00012787215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007359925,0.0005023181,0.00051005074,0.0006990386,0.0001469609,0.000507302,0.0029688883,0.00043818657,0.0000025336649],"category_scores_gemma":[0.0000133818685,0.0004961063,0.00019839488,0.00048992503,0.00022938871,0.000779243,0.0007628122,0.0006638856,0.00001318217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018745919,0.000006830909,0.000004685577,0.000044626013,0.0000046565256,0.00000680435,0.00009874118,0.5112245,0.00006949146,0.16525908,0.000009857781,0.32326883],"study_design_scores_gemma":[0.0001118997,0.00011395403,0.000003815891,0.00030914258,0.0000049754553,0.000024181109,5.717484e-9,0.8503852,0.00082660886,0.14239599,0.0053287777,0.00049544824],"about_ca_topic_score_codex":0.0000055425867,"about_ca_topic_score_gemma":0.0000021931028,"teacher_disagreement_score":0.33916068,"about_ca_system_score_codex":0.00026888156,"about_ca_system_score_gemma":0.00038746928,"threshold_uncertainty_score":0.99974906},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033786844,0.0006496002,0.9464765,0.00015503395,0.0015452655,0.00032426734,0.000021760405,0.000057110447,0.047391776],"genre_scores_gemma":[0.98884803,0.000012610491,0.0065618274,0.00032752161,0.0002497099,0.0000024426042,0.000005564227,0.000039771294,0.0039525153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802333,0.0000089757295,0.00047065242,0.0009888788,0.0001233024,0.0003848392],"domain_scores_gemma":[0.99850965,0.00019475345,0.00041100013,0.00076314405,0.00004817471,0.000073260286],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010565224,0.00031276396,0.0005888393,0.00053163833,0.00010991334,0.00018965328,0.0008557634,0.00022358933,0.000121810386],"category_scores_gemma":[0.000042790012,0.00028048625,0.00008308552,0.00021832164,0.00032312976,0.00020224364,0.00022187625,0.00046076722,0.00081790844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030069887,0.000046370213,0.015740262,0.0001898502,0.000038946408,0.000048408732,0.001335349,0.036883947,0.000020328476,0.87781537,0.00003147124,0.06781961],"study_design_scores_gemma":[0.0010245522,0.00084729906,0.0050494303,0.0015121436,0.000009443412,0.000072426585,8.090882e-7,0.08317455,0.00028676642,0.88589406,0.020156687,0.0019718565],"about_ca_topic_score_codex":0.000031982985,"about_ca_topic_score_gemma":0.000035916284,"teacher_disagreement_score":0.98546934,"about_ca_system_score_codex":0.00014635504,"about_ca_system_score_gemma":0.000086283006,"threshold_uncertainty_score":0.9999647},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009314737,0.0007563952,0.9850661,0.0010298679,0.00159671,0.00042253805,0.0000036199995,0.00008562398,0.0017243744],"genre_scores_gemma":[0.7267802,0.000108256,0.27006543,0.0021836017,0.00025696817,0.0000085890315,0.000014983606,0.00004209671,0.0005398845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653065,0.000044032826,0.00052708155,0.0015155036,0.0008276806,0.0005550419],"domain_scores_gemma":[0.9982523,0.00042781077,0.00024155916,0.0007951916,0.00014780033,0.00013535573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095712615,0.00046792868,0.00048397118,0.0014916984,0.00017899853,0.00059229875,0.0015435079,0.00026972275,0.000012854991],"category_scores_gemma":[0.00005044344,0.00045976855,0.00009145259,0.0008610652,0.00026845865,0.0007044908,0.0011095803,0.00066854025,0.00003382813],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009979118,0.00004157143,0.00063247886,0.00008337701,0.000013034875,0.00010368193,0.0016896884,0.099333696,0.00032551456,0.047442812,0.000025547595,0.85029864],"study_design_scores_gemma":[0.00036852102,0.00011252949,0.0008535064,0.0003314251,0.0000047003778,0.00012024043,2.6013797e-7,0.62307364,0.0003038023,0.37326792,0.0009882321,0.0005752605],"about_ca_topic_score_codex":0.000022225042,"about_ca_topic_score_gemma":0.00010320584,"teacher_disagreement_score":0.84972334,"about_ca_system_score_codex":0.00013707299,"about_ca_system_score_gemma":0.00045544954,"threshold_uncertainty_score":0.9997854},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020332665,0.00090049265,0.9936636,0.00017863078,0.001971914,0.00041408185,0.0000044832823,0.00012894181,0.00070458447],"genre_scores_gemma":[0.58050877,0.000044923796,0.41734752,0.0006296738,0.0009720079,0.0000075311614,0.0000063783696,0.000041321087,0.0004418595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957488,0.00006724872,0.0007560421,0.0014977453,0.0011110108,0.0008191132],"domain_scores_gemma":[0.99669826,0.000837914,0.0007375347,0.0012057711,0.0003289266,0.00019160815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004357424,0.00057693414,0.0006455159,0.0004257622,0.00027286858,0.00023231294,0.003693217,0.00027602637,0.000046255012],"category_scores_gemma":[0.00007435801,0.0005473406,0.0002022622,0.00055441074,0.0009321895,0.0005640351,0.0019296372,0.0014819944,0.000035814053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013401279,0.000008892975,0.00049962034,0.000016011847,0.000009684136,0.000030591396,0.00011270945,0.75804496,0.00031332858,0.041546654,0.000009164604,0.19939496],"study_design_scores_gemma":[0.00024190202,0.00017318127,0.0012853176,0.00019238403,0.000008891961,0.0002266927,1.5370533e-7,0.8097869,0.00049068,0.18674615,0.00036637654,0.00048135014],"about_ca_topic_score_codex":0.000016418187,"about_ca_topic_score_gemma":0.000042544405,"teacher_disagreement_score":0.57847553,"about_ca_system_score_codex":0.00023124476,"about_ca_system_score_gemma":0.00034347887,"threshold_uncertainty_score":0.9996978},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002858793,0.00015934686,0.9901179,0.00074487954,0.0003824278,0.0012835799,0.000026202337,0.00006191093,0.004364938],"genre_scores_gemma":[0.9846853,0.00001643666,0.011648851,0.0019191549,0.0007319378,0.000036286277,0.000011593012,0.000043574553,0.0009068482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965238,0.000054302778,0.00041640285,0.0013800464,0.0008340997,0.0007913342],"domain_scores_gemma":[0.99833184,0.00036060388,0.00023731474,0.0007641183,0.00007365962,0.00023244355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016455918,0.00036683216,0.00052554253,0.00043707245,0.0004534288,0.000773044,0.0032031822,0.00039760917,0.000049462375],"category_scores_gemma":[0.00006700495,0.000346852,0.00010089169,0.00016399943,0.00070926757,0.0009133275,0.00045121255,0.00053616124,0.000010198883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054740784,0.000054151118,0.0019368605,0.00002130987,0.0000072192106,0.000009705814,0.004098027,0.7368519,0.0000294317,0.01541537,0.000003501757,0.24151783],"study_design_scores_gemma":[0.00070515834,0.00010086024,0.00042437142,0.00009031779,0.000012250887,7.104811e-7,0.000002609408,0.925517,0.000012254051,0.07090653,0.0017758685,0.0004520646],"about_ca_topic_score_codex":0.0003407412,"about_ca_topic_score_gemma":0.0039420566,"teacher_disagreement_score":0.98182654,"about_ca_system_score_codex":0.00044826634,"about_ca_system_score_gemma":0.00050132646,"threshold_uncertainty_score":0.9998984},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001387642,0.00017041074,0.9880959,0.0004975289,0.0024424044,0.00048583891,0.0000056016806,0.0002925838,0.0066221366],"genre_scores_gemma":[0.27466783,0.0000058467685,0.7208119,0.00164026,0.0013777702,0.000011685866,0.00002986251,0.00005818785,0.0013966676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99502736,0.00008424339,0.00056580704,0.0023688835,0.0011799656,0.0007737226],"domain_scores_gemma":[0.99728423,0.0004557429,0.00052150944,0.0013183657,0.00019136784,0.0002287743],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009634191,0.0006422301,0.0006447706,0.0008120842,0.0003747909,0.0010971397,0.0031998828,0.0003849175,0.000024546085],"category_scores_gemma":[0.00025800994,0.000597131,0.00015545571,0.0006539727,0.00020749548,0.0006464446,0.0019188601,0.0017975705,0.00022815698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059562385,0.000020660476,0.00035294992,0.000026608099,0.000011305146,0.000021622689,0.0018818165,0.16681716,0.0006534049,0.0025644873,0.000009082423,0.82763493],"study_design_scores_gemma":[0.000294079,0.00045273305,0.00074301375,0.00025526388,0.00000868407,0.000017111723,8.12325e-7,0.98755807,0.0004857066,0.0065923207,0.0027471632,0.0008450276],"about_ca_topic_score_codex":0.00017032042,"about_ca_topic_score_gemma":0.000023642058,"teacher_disagreement_score":0.8267899,"about_ca_system_score_codex":0.00028046806,"about_ca_system_score_gemma":0.00049473817,"threshold_uncertainty_score":0.9999398},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009506463,0.00028363033,0.9961783,0.00013902152,0.00049328903,0.00087545085,0.000021703145,0.00061082403,0.001302667],"genre_scores_gemma":[0.02000561,0.000066753,0.97834194,0.00031533823,0.000106581756,0.000024569264,0.000009984517,0.000068925634,0.0010602929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962219,0.000021079082,0.0004483739,0.0017473772,0.00083010463,0.0007311502],"domain_scores_gemma":[0.99755985,0.00029493027,0.00023552986,0.0014825746,0.00025478765,0.00017235673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011040521,0.00064341864,0.00064597465,0.00080819905,0.00018228315,0.0004224057,0.0021275023,0.00040674035,0.0000034081463],"category_scores_gemma":[0.000022573091,0.0006234576,0.00013724723,0.0003048677,0.00035569636,0.00059864664,0.0015392483,0.0005692284,0.00000932182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033538845,0.0000092304035,0.000003667432,0.000052650474,0.000005696426,0.0000049200708,0.0004530702,0.70763457,0.000084419145,0.20173936,0.000042093918,0.08996695],"study_design_scores_gemma":[0.00020810733,0.00014140895,0.000010584665,0.00046697666,0.000008776028,0.000025324132,2.9724323e-8,0.92848814,0.0003452572,0.06803606,0.00162054,0.0006488131],"about_ca_topic_score_codex":0.000015592894,"about_ca_topic_score_gemma":0.0000042257357,"teacher_disagreement_score":0.22085354,"about_ca_system_score_codex":0.00032092526,"about_ca_system_score_gemma":0.0005474918,"threshold_uncertainty_score":0.9996217},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073224714,0.00047016982,0.9755236,0.00045681302,0.008836134,0.0005237408,0.0000037185875,0.00016437515,0.013289206],"genre_scores_gemma":[0.9196029,0.00014444716,0.073965915,0.0024707196,0.0015269383,0.000024658973,0.000008455582,0.000091829555,0.0021641839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569404,0.00006876085,0.0008242476,0.0017919807,0.00077731884,0.0008436384],"domain_scores_gemma":[0.99742526,0.00042023876,0.00034872215,0.0014868978,0.0001696673,0.00014921911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012695928,0.00057576847,0.000737938,0.0015150493,0.00018263134,0.00072205305,0.003259007,0.00043806565,0.00003985378],"category_scores_gemma":[0.00004393786,0.0005367005,0.00020350752,0.0007676684,0.00029524168,0.0007144586,0.00081720867,0.0010920214,0.00013851144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020210646,0.000071407674,0.0013130348,0.00018090935,0.000038163475,0.00031412646,0.0030199597,0.09390925,0.00058645295,0.1465466,0.00013001094,0.7538699],"study_design_scores_gemma":[0.00050405134,0.0001984276,0.0010883317,0.0016512027,0.00000438949,0.00018238208,6.743459e-7,0.8994063,0.00029041793,0.08970384,0.005795283,0.0011746966],"about_ca_topic_score_codex":0.00010687145,"about_ca_topic_score_gemma":0.0009397132,"teacher_disagreement_score":0.9188706,"about_ca_system_score_codex":0.00036280547,"about_ca_system_score_gemma":0.00042966142,"threshold_uncertainty_score":0.9997085},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000072225455,0.0003579343,0.99595815,0.00015521089,0.0014767275,0.00067643943,0.00011790613,0.0010049003,0.00018048444],"genre_scores_gemma":[0.04017925,0.000039549046,0.95911556,0.00036839288,0.00013968321,0.000013299984,0.000031717926,0.00004826276,0.000064278734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99505925,0.00006148641,0.00066910306,0.0020290562,0.0013056184,0.0008754689],"domain_scores_gemma":[0.9966745,0.00031912926,0.00034201037,0.0021881706,0.00025866364,0.00021755215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072971353,0.00080556783,0.0007263177,0.0003784332,0.00016716233,0.0007004118,0.005048819,0.000343119,0.000010851257],"category_scores_gemma":[0.000025652254,0.00078145793,0.00015034853,0.0005894313,0.00029207574,0.001314455,0.0025351867,0.0006830612,0.000034842327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004710798,0.000014844501,0.000086084554,0.00001802457,0.000018591589,0.00005524485,0.00015561689,0.6450738,0.00006179627,0.0129109835,0.00003123124,0.34156913],"study_design_scores_gemma":[0.0001422163,0.00007288632,0.0000871347,0.00038261537,0.000006390187,0.000013633478,6.380224e-9,0.72781223,0.00042315267,0.27008414,0.00037880818,0.00059679203],"about_ca_topic_score_codex":0.0001366962,"about_ca_topic_score_gemma":0.0000395548,"teacher_disagreement_score":0.34097233,"about_ca_system_score_codex":0.0008959432,"about_ca_system_score_gemma":0.0006308779,"threshold_uncertainty_score":0.9994636},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038626615,0.0007786232,0.9957204,0.00047637144,0.0012955888,0.0005429191,0.0000019473748,0.0001818314,0.0006160567],"genre_scores_gemma":[0.31230447,0.0000699038,0.684731,0.0019950909,0.0006310897,0.000008720143,0.000004333409,0.000059337963,0.0001960562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639535,0.00003477662,0.00047623448,0.0017312123,0.0005647938,0.0007976046],"domain_scores_gemma":[0.9973468,0.0006758522,0.0003298412,0.0013225453,0.00012541078,0.0001995068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042937565,0.00054281356,0.0005835727,0.00048625786,0.0003618977,0.0004811015,0.0023056015,0.00029373958,0.000005625537],"category_scores_gemma":[0.00003527462,0.00051896385,0.00009840207,0.0007504923,0.000676083,0.00073115644,0.0015813117,0.000979173,0.000007538468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031419036,0.000005344924,0.000022622633,0.000009468289,0.0000044091444,0.000023023553,0.0002465964,0.50130564,0.00018571303,0.010680258,0.000002614795,0.48751113],"study_design_scores_gemma":[0.0002210688,0.00007135157,0.00004769374,0.00014440379,0.0000074669197,0.00016140647,1.4377885e-7,0.9549321,0.000050753388,0.043316662,0.0005153928,0.00053155853],"about_ca_topic_score_codex":0.0000071153845,"about_ca_topic_score_gemma":0.000015088337,"teacher_disagreement_score":0.48697957,"about_ca_system_score_codex":0.00017344877,"about_ca_system_score_gemma":0.00026645072,"threshold_uncertainty_score":0.9997262},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020261962,0.00055420655,0.9836812,0.0008969511,0.0013581128,0.00025281447,0.0000019856316,0.00038057723,0.012671506],"genre_scores_gemma":[0.14341761,0.00016107567,0.84378624,0.0017578347,0.00058650755,0.00000709385,0.000015935417,0.00010925539,0.010158459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961637,0.00012207775,0.0005543464,0.0014383058,0.0009579899,0.00076356344],"domain_scores_gemma":[0.99627346,0.0008970214,0.00045981182,0.0020139033,0.0001956833,0.0001601087],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015187388,0.00058643275,0.0006226377,0.0007201029,0.00049156736,0.00083123863,0.005438247,0.00021665482,0.0000302135],"category_scores_gemma":[0.00019295509,0.0005230224,0.00015403655,0.00054873474,0.00043352644,0.0005422906,0.003228846,0.0026224602,0.00020740923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016218335,0.000010561734,0.00035972716,0.000031944248,0.000008039665,0.000029880895,0.0009759782,0.15550238,0.000039868286,0.0040596058,0.000006140985,0.83897424],"study_design_scores_gemma":[0.00020686365,0.00018909472,0.00017533256,0.0003787339,0.0000037901684,0.000060844362,1.3667311e-7,0.9575779,0.00009308962,0.035960376,0.0047047897,0.00064908486],"about_ca_topic_score_codex":0.00009428559,"about_ca_topic_score_gemma":0.000041266678,"teacher_disagreement_score":0.83832514,"about_ca_system_score_codex":0.00017402705,"about_ca_system_score_gemma":0.00046823663,"threshold_uncertainty_score":0.9999428},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004062054,0.000053154155,0.99026906,0.0018447484,0.0023494402,0.0011755828,0.000041801628,0.00018366317,0.000020480995],"genre_scores_gemma":[0.46125272,0.0000027930425,0.5381227,0.00014245223,0.00031381837,0.00011517659,0.000024995912,0.000022888491,0.0000024481428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969024,0.00016717678,0.00072863634,0.0010399806,0.0007052117,0.00045656506],"domain_scores_gemma":[0.9939634,0.0042553125,0.00043028034,0.0007336624,0.00046552115,0.00015182972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091744936,0.00038528096,0.0005654556,0.00037315066,0.0004962189,0.00047524704,0.0009238744,0.00025424812,0.000015241843],"category_scores_gemma":[0.005911094,0.00033409343,0.00018115384,0.001078341,0.00017747174,0.00015764496,0.00088238536,0.00056890125,0.000007219904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014758571,0.0010592781,0.000401421,0.004205344,0.00014011859,0.000017557917,0.008636647,0.14828727,0.006165684,0.022315284,0.00007460477,0.8085492],"study_design_scores_gemma":[0.00031318987,0.000116155556,0.00013110519,0.00054998894,0.000043846292,0.0000015740761,0.0000067074125,0.83884084,0.0003707464,0.15918767,0.00012526341,0.00031290675],"about_ca_topic_score_codex":0.000101276375,"about_ca_topic_score_gemma":0.00008803156,"teacher_disagreement_score":0.8082363,"about_ca_system_score_codex":0.00033762676,"about_ca_system_score_gemma":0.00030234814,"threshold_uncertainty_score":0.9999111},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04856866,0.00054248056,0.94878274,0.00032032788,0.0005204593,0.0003003094,0.0000023439834,0.00008238126,0.00088032626],"genre_scores_gemma":[0.92594725,0.000015261776,0.07300447,0.00017279403,0.00006798473,0.0000024435553,0.0000038830653,0.000016389262,0.00076954137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969207,0.000030028972,0.0007850629,0.0011851725,0.0005457914,0.000533264],"domain_scores_gemma":[0.99841636,0.00027201624,0.00042521686,0.0005814107,0.00023754328,0.0000674356],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008223642,0.00040310243,0.00072388706,0.0016775795,0.000108524604,0.00021753678,0.002019762,0.000369984,0.000010532808],"category_scores_gemma":[0.00010614921,0.00037055215,0.00010448946,0.0008323298,0.0005795771,0.00036155572,0.0013069959,0.001436813,0.000004135293],"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.000011155597,0.00016058759,0.0049658674,0.00008198578,0.00006640877,0.000119080345,0.005039978,0.20219994,0.00013930374,0.6819109,0.0000029243463,0.1053019],"study_design_scores_gemma":[0.0002584215,0.00018793889,0.00062207796,0.0006711971,0.000009253212,0.00008688449,0.000001951645,0.9954092,0.00014985623,0.00072091044,0.0014941117,0.00038818654],"about_ca_topic_score_codex":0.0026337341,"about_ca_topic_score_gemma":0.22250886,"teacher_disagreement_score":0.8773786,"about_ca_system_score_codex":0.00034109878,"about_ca_system_score_gemma":0.00090403133,"threshold_uncertainty_score":0.99987465},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45843908,0.0016678409,0.45269528,0.068640254,0.007948058,0.005458022,0.00041723435,0.00008482172,0.0046494026],"genre_scores_gemma":[0.99592924,0.000054775286,0.0030558072,0.0005440069,0.00033006544,0.000015754506,0.000008483617,0.0000074752443,0.000054411965],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988683,0.000019733026,0.00023051021,0.00031235104,0.00025438258,0.00031475467],"domain_scores_gemma":[0.9985635,0.0010493236,0.0001337875,0.000104531675,0.0000917743,0.000057046458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003009071,0.00010395347,0.00017404996,0.00010578111,0.00015160623,0.00004699593,0.00025023692,0.00011756348,0.000003065798],"category_scores_gemma":[0.0006264834,0.000113344046,0.000015836784,0.00023802769,0.0002055791,0.00011989888,0.000050868704,0.00018870986,4.892541e-7],"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.000008572649,0.000049963764,0.27041075,0.00010700186,0.0000045707066,0.0000039365477,0.02412804,0.01359471,0.00001446994,0.21273343,0.000038492428,0.47890604],"study_design_scores_gemma":[0.0011405731,0.000110420406,0.61734086,0.0013330574,0.000016143958,0.0000015831855,0.000073418574,0.1693994,0.0000708572,0.19199827,0.017409433,0.001105979],"about_ca_topic_score_codex":0.509996,"about_ca_topic_score_gemma":0.9952238,"teacher_disagreement_score":0.5374901,"about_ca_system_score_codex":0.0013489112,"about_ca_system_score_gemma":0.0030600708,"threshold_uncertainty_score":0.5428434},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052290165,0.0038684057,0.9899454,0.0016437296,0.0013450481,0.0016154302,0.0000128270485,0.00009074384,0.0014261075],"genre_scores_gemma":[0.09339613,0.00006191012,0.903642,0.00218769,0.00015811856,0.000020864685,0.00001998306,0.000035570374,0.000477731],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99631435,0.00012457008,0.00051522406,0.0011193505,0.0015823279,0.00034419898],"domain_scores_gemma":[0.9963593,0.00029003946,0.00072329276,0.001979036,0.0005928294,0.00005550868],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002565057,0.0003632039,0.0004711391,0.00037608814,0.00014784271,0.0006513148,0.008500963,0.0002926208,0.000046755307],"category_scores_gemma":[0.00018023822,0.0002602097,0.00012279794,0.00074455066,0.00038929726,0.001239907,0.0041092946,0.0005912772,0.000022713275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000127355115,0.00003630121,0.00011661868,0.00020648116,0.000021833264,0.0000070984042,0.0023230428,0.0023299009,0.0021748997,0.11301806,0.00041824544,0.8793348],"study_design_scores_gemma":[0.0005058989,0.00012195526,0.0003044986,0.0018303077,0.000022467171,0.000028302655,3.0580708e-7,0.21251951,0.0071877036,0.7757871,0.0010885418,0.00060339406],"about_ca_topic_score_codex":0.000067773566,"about_ca_topic_score_gemma":0.00005510846,"teacher_disagreement_score":0.87873137,"about_ca_system_score_codex":0.00044298478,"about_ca_system_score_gemma":0.0015402708,"threshold_uncertainty_score":0.99998504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024045482,0.00007035846,0.9951683,0.00007072747,0.0014421582,0.00045566572,0.000013912599,0.000084902436,0.00028941943],"genre_scores_gemma":[0.95189357,0.0000036658848,0.04780254,0.00004437674,0.00018977807,0.000014169271,0.000021344451,0.000019329185,0.000011214108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988137,0.000016184462,0.0004439538,0.00028701674,0.00028135665,0.00015778844],"domain_scores_gemma":[0.998911,0.00045527998,0.00014906646,0.00026691222,0.00019912964,0.000018616143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038086608,0.00020841323,0.00024427843,0.0004310774,0.000053758944,0.00008342677,0.0002267733,0.00023527848,0.000005400211],"category_scores_gemma":[0.000055937267,0.0001666691,0.00007008501,0.00023589852,0.00026189725,0.0002633275,0.000021417569,0.00033196472,7.9863406e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051948646,0.0000017314012,0.000005515638,0.000034022913,0.0000024403655,8.368062e-8,0.00021355246,0.6838064,0.00023673815,0.023655947,4.76303e-7,0.29203787],"study_design_scores_gemma":[0.0001933869,0.00004583193,0.00004423917,0.00034733358,0.0000067336687,0.0000030478814,0.0000017704489,0.9650358,0.0019709864,0.032165483,0.000029845889,0.00015554295],"about_ca_topic_score_codex":0.000022409866,"about_ca_topic_score_gemma":0.00015741726,"teacher_disagreement_score":0.94948906,"about_ca_system_score_codex":0.00017760175,"about_ca_system_score_gemma":0.0001884723,"threshold_uncertainty_score":0.67965686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034868459,0.000010791266,0.98963386,0.00015748474,0.00092160533,0.0007890709,0.0000012966315,0.00009774418,0.0049012783],"genre_scores_gemma":[0.93456405,0.0000076184097,0.06477718,0.0002744677,0.00011261696,0.000011073191,0.000034566572,0.000020831449,0.00019758972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962549,0.000077384946,0.0013029143,0.00087916077,0.00095783675,0.0005277919],"domain_scores_gemma":[0.9974694,0.00028016773,0.0007922227,0.0010296262,0.00034415253,0.00008439941],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092744996,0.00047677264,0.0006565895,0.0024009333,0.00011531013,0.000337901,0.002213887,0.00041047652,0.00003734487],"category_scores_gemma":[0.00011489346,0.0004893384,0.00010516547,0.00095222367,0.00040652812,0.0027320553,0.0011655067,0.0014263417,0.00004071423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008961287,0.000028213053,0.0012741826,0.00006241843,0.0000069273397,0.000008112547,0.0029125435,0.9519469,0.00048330243,0.0049209795,0.0000029017706,0.038344566],"study_design_scores_gemma":[0.0007010736,0.00051169517,0.01879167,0.0011119547,0.0000048991456,0.000013469208,0.0000029863882,0.97320855,0.00044573823,0.0045843935,0.00012332156,0.0005002407],"about_ca_topic_score_codex":0.00011677415,"about_ca_topic_score_gemma":0.00006787047,"teacher_disagreement_score":0.9310772,"about_ca_system_score_codex":0.001468491,"about_ca_system_score_gemma":0.00064641464,"threshold_uncertainty_score":0.9997558},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000508533,0.00027135655,0.9970335,0.00036504332,0.00051454693,0.0007122677,0.000013384751,0.00013233897,0.0004490598],"genre_scores_gemma":[0.6985162,0.000075346165,0.2990749,0.00018459342,0.00047141383,0.000031862088,0.00003170121,0.00006264604,0.0015513673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959604,0.00006802559,0.0005858885,0.0015046692,0.0012320142,0.00064899493],"domain_scores_gemma":[0.99576396,0.0015893787,0.00036449204,0.001148751,0.0009905626,0.00014284677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001184741,0.0004340134,0.00076988625,0.001008915,0.0002460269,0.0003789807,0.0033806595,0.000417992,0.000027295897],"category_scores_gemma":[0.0004925326,0.00038299244,0.00029484762,0.0010609922,0.0006083583,0.0006135743,0.0012305806,0.0010231668,0.000025284082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004389558,0.0000953551,0.0028410428,0.0004109698,0.00013923066,0.000023773624,0.0016756502,0.41360778,0.00070379395,0.0067337584,0.00007924749,0.57364553],"study_design_scores_gemma":[0.00038259363,0.00054802746,0.00033748776,0.0004691296,0.000018293877,0.000008538829,9.931728e-7,0.9685136,0.0041035344,0.02363367,0.0014836626,0.0005004875],"about_ca_topic_score_codex":0.000023831259,"about_ca_topic_score_gemma":0.000010361835,"teacher_disagreement_score":0.69800764,"about_ca_system_score_codex":0.00024047206,"about_ca_system_score_gemma":0.001049725,"threshold_uncertainty_score":0.9998622},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01677196,0.00020852128,0.96810615,0.000035236415,0.0016843961,0.0005851124,0.0000068261215,0.00042366458,0.01217814],"genre_scores_gemma":[0.9368667,0.00009034702,0.06219818,0.00004668463,0.0005537683,0.000051972584,0.000039285183,0.000056009496,0.00009707387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787134,0.000028277627,0.00030939342,0.0007018568,0.0005614617,0.0005276623],"domain_scores_gemma":[0.99894774,0.00009722245,0.00007680345,0.00058674946,0.00023482995,0.00005664752],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078805827,0.0002742274,0.00024220157,0.0024461837,0.00029733157,0.0001785881,0.0004854089,0.00051717885,0.000044989334],"category_scores_gemma":[0.000017197219,0.00026749953,0.000055611577,0.00094111304,0.00073354767,0.00029863612,0.00012010968,0.0015346837,0.000030574756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004662289,0.0000098822875,0.00020669446,0.00005644905,0.000010233887,0.0000013986985,0.00022460382,0.06400241,0.0022507864,0.020248922,0.000007830264,0.91297615],"study_design_scores_gemma":[0.00037456636,0.00063939614,0.000084384745,0.0003747814,0.0000152360435,0.0001823323,0.000063632644,0.88424975,0.013424324,0.09173906,0.007955866,0.0008967023],"about_ca_topic_score_codex":0.000008631914,"about_ca_topic_score_gemma":0.00008685329,"teacher_disagreement_score":0.9200947,"about_ca_system_score_codex":0.0002633007,"about_ca_system_score_gemma":0.00012051906,"threshold_uncertainty_score":0.9999777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006945644,0.0006331395,0.9766764,0.00023963151,0.010654196,0.00068823254,0.0000016474645,0.00025926039,0.010778014],"genre_scores_gemma":[0.92553335,0.000037042915,0.06607035,0.0010935116,0.0016458842,0.000019257515,0.0000066176226,0.000063242915,0.0055307415],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952436,0.000050488048,0.0005807294,0.0020098574,0.0012063399,0.00090898445],"domain_scores_gemma":[0.9964131,0.00041602657,0.00034197464,0.0023314408,0.0002853704,0.00021207905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013623048,0.0006085883,0.00070824963,0.0005374396,0.00023496998,0.0009723318,0.004039739,0.0004914059,0.000044774108],"category_scores_gemma":[0.000090558395,0.00051185134,0.00020169209,0.00061639555,0.0005377182,0.00075210485,0.0016155107,0.0008248443,0.0003579026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009988214,0.00010347699,0.001272211,0.00023976808,0.000034199555,0.00012619082,0.0012571127,0.023966856,0.00010031288,0.39445046,0.00024613153,0.5781933],"study_design_scores_gemma":[0.00048207384,0.0004204433,0.0002872408,0.00015703677,0.000011238907,0.00006860584,2.3982608e-7,0.29970574,0.0009975869,0.661895,0.034590144,0.0013846968],"about_ca_topic_score_codex":0.0001319425,"about_ca_topic_score_gemma":0.000034433127,"teacher_disagreement_score":0.9254639,"about_ca_system_score_codex":0.0003884385,"about_ca_system_score_gemma":0.0007508173,"threshold_uncertainty_score":0.9997333},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018664313,0.00029993663,0.9893878,0.0003771071,0.005716863,0.0004002567,0.0000012279086,0.00017298284,0.0034571695],"genre_scores_gemma":[0.2914395,0.000036801062,0.70682555,0.0012895792,0.00015145748,0.0000028019101,0.00000974409,0.00004901374,0.00019551851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961351,0.000049811253,0.0006680567,0.0015442776,0.0009382781,0.0006644743],"domain_scores_gemma":[0.9976857,0.0004102391,0.0003168658,0.0012152903,0.0002437557,0.00012816672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012819575,0.0004639529,0.0005676765,0.0012823284,0.00016436777,0.00047965796,0.0024535365,0.00038043622,0.00001257251],"category_scores_gemma":[0.00008831555,0.00045236578,0.00010320591,0.0009966968,0.00034545237,0.0005024053,0.001289414,0.00087725656,0.00005588021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032467146,0.000028298777,0.00012705418,0.000023444489,0.0000033471424,0.000032272797,0.00030788156,0.80587524,0.00002632092,0.1348504,0.0000101517,0.058712337],"study_design_scores_gemma":[0.00050234376,0.00009716422,0.000037714093,0.00039769214,0.0000023766677,0.000017836672,6.16312e-8,0.7960158,0.00013446501,0.20225193,0.000111333335,0.0004313141],"about_ca_topic_score_codex":0.000039256396,"about_ca_topic_score_gemma":0.00001704792,"teacher_disagreement_score":0.29125288,"about_ca_system_score_codex":0.00024577102,"about_ca_system_score_gemma":0.0006594529,"threshold_uncertainty_score":0.9997928},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000104088016,0.00010431519,0.9904688,0.0013863551,0.0016908341,0.00021443069,0.00001950462,0.00038082586,0.0056308354],"genre_scores_gemma":[0.7098486,0.0001981501,0.2739472,0.0092790555,0.0012405367,0.000013865449,0.00006555103,0.00010215188,0.00530489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99489725,0.000045016644,0.00055654556,0.002175227,0.0013952387,0.00093074853],"domain_scores_gemma":[0.99626845,0.0012818619,0.00028569018,0.0017199287,0.0001826528,0.00026141026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009748369,0.0005769856,0.0006772101,0.0018757911,0.000373191,0.0007136379,0.005064568,0.0003115731,0.000043844724],"category_scores_gemma":[0.00040151385,0.00045900437,0.00030880366,0.002660307,0.00069930946,0.00037773285,0.0027314008,0.00097247923,0.0005942728],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038989483,0.00006352754,0.00009733362,0.000019137853,0.000026405205,0.0002785822,0.0002564305,0.021610115,0.000004614963,0.080461904,0.00013333382,0.8970447],"study_design_scores_gemma":[0.00037075582,0.00047566183,0.0006286638,0.0004538762,0.000018524313,0.00006096719,3.5908892e-7,0.70480704,0.000082749364,0.28996238,0.0019925646,0.0011464275],"about_ca_topic_score_codex":0.000025665253,"about_ca_topic_score_gemma":0.00004173738,"teacher_disagreement_score":0.8958983,"about_ca_system_score_codex":0.00023642267,"about_ca_system_score_gemma":0.00017190725,"threshold_uncertainty_score":0.9997862},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17923461,0.00018402601,0.8169542,0.0007611965,0.002408331,0.0003446657,0.000011823304,0.00007864976,0.00002250867],"genre_scores_gemma":[0.7459919,0.000029177854,0.2537452,0.00012234312,0.0000788657,0.000010213857,0.000011600378,0.000009736991,9.878287e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954956,0.00016224069,0.00091970264,0.0015792991,0.0011838952,0.0006592646],"domain_scores_gemma":[0.99638903,0.0003724327,0.0005384318,0.002218035,0.00035045427,0.00013158882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009635756,0.00043100584,0.0007099244,0.0014202213,0.00019426033,0.000708292,0.004339883,0.00028723298,0.00005460061],"category_scores_gemma":[0.00008835151,0.00039294214,0.0003470215,0.003117776,0.00049628667,0.0004760083,0.0043576392,0.0009238557,0.000010481578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024818217,0.0006136192,0.017102608,0.00038438482,0.00023220589,0.000049990565,0.013267296,0.5443178,0.0049575088,0.01708962,0.00005573424,0.40190443],"study_design_scores_gemma":[0.00036129032,0.00012018596,0.0075799646,0.00013041648,0.000029829782,0.000017312093,0.0000016932578,0.9057146,0.001499694,0.08405562,0.000031512725,0.00045789315],"about_ca_topic_score_codex":0.00032721148,"about_ca_topic_score_gemma":0.0003166348,"teacher_disagreement_score":0.56675726,"about_ca_system_score_codex":0.00016841617,"about_ca_system_score_gemma":0.00058540475,"threshold_uncertainty_score":0.99985224},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002588884,0.00040656,0.9936001,0.00016543188,0.00055092823,0.0014778109,0.000008416514,0.00038087627,0.003151005],"genre_scores_gemma":[0.5164386,0.00009140059,0.48227435,0.00046100613,0.00032158784,0.0001823211,0.000043010317,0.00013961099,0.000048120928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963832,0.000017365508,0.0006155179,0.0011906973,0.0008576292,0.0009356046],"domain_scores_gemma":[0.9968555,0.0015017226,0.00014514649,0.0010342567,0.00021160931,0.0002517545],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0004764322,0.00071271416,0.0006579343,0.00065254816,0.00022379686,0.0004751498,0.0013655316,0.00078902097,0.00009164374],"category_scores_gemma":[0.00021129823,0.0007208701,0.00032385418,0.00067636545,0.0007419079,0.00026448196,0.00018963704,0.0025054093,0.00007431704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015627482,0.000027667345,0.000028745088,0.00017275095,0.000059199563,0.000006207732,0.00026360736,0.8416636,0.00087197596,0.041619662,0.000021940918,0.11524904],"study_design_scores_gemma":[0.00034643774,0.0005493791,0.000056814923,0.0011128152,0.000052574083,0.0000092456185,0.0000014476118,0.8834631,0.0046063536,0.106819555,0.0017639225,0.0012183567],"about_ca_topic_score_codex":0.0000046298364,"about_ca_topic_score_gemma":0.000007850992,"teacher_disagreement_score":0.5161797,"about_ca_system_score_codex":0.0002392016,"about_ca_system_score_gemma":0.000111002075,"threshold_uncertainty_score":0.99979585},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033890794,0.00073333073,0.984005,0.0014804497,0.0008411341,0.00048014033,0.0000016702747,0.00009804865,0.008971162],"genre_scores_gemma":[0.61795014,0.000010705375,0.37144363,0.0061457185,0.0013794563,0.0000056395634,0.00004503446,0.00013880029,0.0028808636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674284,0.00003399729,0.00037717717,0.0010640997,0.0009382068,0.0008436491],"domain_scores_gemma":[0.9981942,0.00028805356,0.00026044517,0.0007844239,0.0001796564,0.0002932237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066828076,0.0004929372,0.0006881054,0.00042561797,0.00022273691,0.00018318971,0.0006221374,0.00019787019,0.00011029272],"category_scores_gemma":[0.00006285717,0.00038444786,0.00014003903,0.00034695675,0.0008997475,0.00013154127,0.00021640434,0.002074878,0.00003240814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015805753,0.000052791605,0.008616701,0.00035871708,0.000018106875,0.0012176457,0.00026987196,0.7458614,0.0011356481,0.0002010663,0.00021223702,0.24189772],"study_design_scores_gemma":[0.0012421842,0.00045980597,0.00061545323,0.00054324797,0.00006447141,0.00013604497,3.132911e-7,0.9913526,0.00028298172,0.0006235542,0.0041867355,0.00049256836],"about_ca_topic_score_codex":0.00008332328,"about_ca_topic_score_gemma":0.000019244995,"teacher_disagreement_score":0.6145611,"about_ca_system_score_codex":0.000339347,"about_ca_system_score_gemma":0.00077434204,"threshold_uncertainty_score":0.99986076},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022832768,0.00019875358,0.995708,0.0001833715,0.00031185435,0.000837555,0.000020036603,0.0021027497,0.00040933344],"genre_scores_gemma":[0.11597831,0.0000031610964,0.8829193,0.0005567756,0.00009391554,0.000022390068,0.00001586112,0.00004745667,0.00036282503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969926,0.000027237045,0.00039977542,0.0014022959,0.0006168787,0.00056124],"domain_scores_gemma":[0.9937981,0.004349529,0.00035462374,0.00094584207,0.00042235412,0.00012958232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008971731,0.00050053775,0.00049162377,0.00060261646,0.0002463526,0.0005016203,0.0012940026,0.00018236741,0.0000022732747],"category_scores_gemma":[0.0009830432,0.0004155098,0.000054574877,0.0004698645,0.0003757482,0.00042139506,0.0006196207,0.00045959855,0.000011913869],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025227497,0.000020628087,0.0014269938,0.000108477994,0.000015564872,0.000080523605,0.00058016053,0.02684114,0.00006286579,0.0002564404,0.00005704503,0.9705249],"study_design_scores_gemma":[0.00047801613,0.0006040887,0.00032905684,0.00060290727,0.000010311122,0.0001577819,2.0807562e-8,0.90213996,0.00050967553,0.094492115,0.00014190003,0.00053413725],"about_ca_topic_score_codex":0.000085569525,"about_ca_topic_score_gemma":0.000054018656,"teacher_disagreement_score":0.9699908,"about_ca_system_score_codex":0.00013698127,"about_ca_system_score_gemma":0.00050986843,"threshold_uncertainty_score":0.99982965},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003332279,0.0012344307,0.9920864,0.00085373316,0.0003899063,0.0002998123,0.000005671926,0.00003399741,0.0017637872],"genre_scores_gemma":[0.33902812,0.000061166465,0.65930974,0.0012161417,0.00014382895,7.3591315e-7,0.000004912209,0.00005316036,0.00018221208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997967,0.000018799723,0.00039793696,0.0007266449,0.0005289433,0.0003606511],"domain_scores_gemma":[0.99887586,0.00020859859,0.00021027421,0.0004144526,0.00014868376,0.00014215206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004971514,0.00033967843,0.0006628457,0.000520846,0.00010158728,0.000073519994,0.0003087274,0.00015511557,0.000016150047],"category_scores_gemma":[0.00014686876,0.0002827751,0.00008676592,0.00017107405,0.00078346377,0.00015684575,0.00033002545,0.00088988093,0.0000017199786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006113808,0.000026645701,0.0013438915,0.0006391841,0.00004422216,0.0000817826,0.0028262504,0.7734945,0.007296693,0.002878916,0.0000048647717,0.21130192],"study_design_scores_gemma":[0.00050573575,0.000071341005,0.00021600586,0.0017423106,0.000054453907,0.000114299524,0.0000016892894,0.9882282,0.00014739698,0.008612648,0.000037170452,0.00026876753],"about_ca_topic_score_codex":0.000042840893,"about_ca_topic_score_gemma":0.000010127506,"teacher_disagreement_score":0.33569583,"about_ca_system_score_codex":0.00012339564,"about_ca_system_score_gemma":0.0005052879,"threshold_uncertainty_score":0.99996245},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040522657,0.00020760391,0.99352974,0.0028391448,0.0011312003,0.00037672318,0.0000028311538,0.00042493222,0.0010825715],"genre_scores_gemma":[0.42850128,0.000027741948,0.5679544,0.0023271504,0.000995103,0.0000098347255,0.000013133329,0.000069843336,0.00010152413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954977,0.000048608792,0.0005144532,0.002000177,0.0012384817,0.0007005811],"domain_scores_gemma":[0.99763906,0.00028226228,0.00034790154,0.0012266723,0.00023134012,0.00027276596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051660324,0.00066527375,0.0005896983,0.000645491,0.00035761914,0.00063647877,0.0028468275,0.00029943627,0.000012249996],"category_scores_gemma":[0.000053194377,0.0005335803,0.00013566685,0.0008754324,0.0005397501,0.000428997,0.0010126964,0.0012436751,0.000074278476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021832511,0.000030167565,0.00001947539,0.000050630704,0.000018698232,0.0002533029,0.0010178013,0.15166713,0.00034731018,0.050316036,0.000029035644,0.7962286],"study_design_scores_gemma":[0.00027504284,0.00043479586,0.000088067856,0.0003649879,0.000008349021,0.00014544903,1.3360594e-7,0.8830228,0.0005846165,0.11333202,0.0010671037,0.0006766192],"about_ca_topic_score_codex":0.000017808281,"about_ca_topic_score_gemma":0.00002787997,"teacher_disagreement_score":0.79555196,"about_ca_system_score_codex":0.00020609293,"about_ca_system_score_gemma":0.00054153666,"threshold_uncertainty_score":0.9997116},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058207,0.000489669,0.99364626,0.0003285858,0.0032302856,0.00037291777,0.000002423811,0.0003916127,0.001480021],"genre_scores_gemma":[0.03785128,0.000039193375,0.96094024,0.0003562428,0.00019399993,0.000010317965,0.0000016598315,0.00004208319,0.00056495576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967089,0.000046045894,0.00043522404,0.0014559967,0.00060968276,0.00074414],"domain_scores_gemma":[0.99596536,0.0020824892,0.00023525025,0.001467253,0.00015135386,0.00009828201],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009985662,0.0005385325,0.0005981173,0.0013141393,0.0001302026,0.00030538824,0.0029901443,0.00028155936,0.0000041143326],"category_scores_gemma":[0.00047116957,0.000515638,0.00012819434,0.00081441196,0.00021740764,0.001641034,0.0015709284,0.0018891935,0.000023967643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002278795,0.000005288967,0.000011552157,0.000023403742,0.0000032886155,0.000032155993,0.0004611865,0.68952775,0.0000829197,0.005924723,0.000003761636,0.30392167],"study_design_scores_gemma":[0.0001540297,0.00005278582,0.00004469823,0.00044577444,0.000002372892,0.00007936455,3.8008253e-7,0.68346804,0.000756448,0.31409353,0.00037050789,0.00053205487],"about_ca_topic_score_codex":0.000016462878,"about_ca_topic_score_gemma":0.00012992014,"teacher_disagreement_score":0.3081688,"about_ca_system_score_codex":0.00062349543,"about_ca_system_score_gemma":0.0003860387,"threshold_uncertainty_score":0.9997295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011171701,0.00025378843,0.9922671,0.0003628572,0.0026079223,0.0011106842,0.0000040591544,0.00013703789,0.0021394303],"genre_scores_gemma":[0.84107274,0.000030069928,0.15258867,0.0029920246,0.00068260217,0.00004157553,0.000025073368,0.00007339352,0.002493839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965811,0.00006303908,0.0005576724,0.001345929,0.0010367729,0.00041551358],"domain_scores_gemma":[0.9977352,0.00031744462,0.00042606363,0.0012846334,0.00012529324,0.000111389294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086043053,0.0004373165,0.00044817387,0.0005568603,0.00014532813,0.0004487687,0.0016877387,0.00022041421,0.000032007927],"category_scores_gemma":[0.00008946338,0.00037021743,0.00010177417,0.00038870794,0.00016510682,0.00043371925,0.0003863789,0.00049712893,0.0003563511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018554862,0.00013458273,0.000085639986,0.00061464857,0.000031193988,0.00013073174,0.010171283,0.15764521,0.0014684683,0.13332252,0.00006065867,0.6963165],"study_design_scores_gemma":[0.00057997816,0.0004497998,0.00038711805,0.0018122997,0.000013614206,0.000049602113,7.061652e-7,0.96276677,0.0018409695,0.03067585,0.0005246583,0.00089865335],"about_ca_topic_score_codex":0.00003603271,"about_ca_topic_score_gemma":0.00007696338,"teacher_disagreement_score":0.83995557,"about_ca_system_score_codex":0.00039627345,"about_ca_system_score_gemma":0.00038762644,"threshold_uncertainty_score":0.99987495},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047809025,0.00030655065,0.9856329,0.011532249,0.00009181739,0.0009121728,0.0000055188766,0.00012438266,0.0009163387],"genre_scores_gemma":[0.38217944,0.00009601727,0.6068158,0.009732369,0.00051931455,0.00007402842,0.000016604836,0.000041307914,0.00052510225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983366,0.000005700155,0.00023111347,0.00087354163,0.00034587248,0.00020716531],"domain_scores_gemma":[0.99890214,0.0002067277,0.000096514814,0.0005107139,0.000102574835,0.00018135029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040236794,0.0001943407,0.00025665978,0.0002404282,0.00010610455,0.000099774996,0.00019182022,0.00015117861,0.000009765853],"category_scores_gemma":[0.00015689131,0.00017217846,0.00002128442,0.00019849223,0.00046156862,0.000083769104,0.00021483422,0.0005090206,0.000006486156],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011504404,0.000019329433,0.0022430532,0.00021770666,0.0000044026974,0.0000044489498,0.0003805108,0.00017405563,0.004009749,0.004775383,0.00032151665,0.9878383],"study_design_scores_gemma":[0.0005178304,0.00030913565,0.0048843124,0.004692949,0.00007487442,0.00026843164,0.0000013802562,0.69625807,0.0032276725,0.24775471,0.0412469,0.00076373667],"about_ca_topic_score_codex":0.00001163241,"about_ca_topic_score_gemma":0.0000018424445,"teacher_disagreement_score":0.9870746,"about_ca_system_score_codex":0.00008361609,"about_ca_system_score_gemma":0.0001819723,"threshold_uncertainty_score":0.7021234},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022503072,0.0006838558,0.99463236,0.000037242044,0.0002593445,0.0016102948,0.000007815473,0.000025538078,0.00049322133],"genre_scores_gemma":[0.09412681,0.0000037701245,0.90521055,0.00018534793,0.000091005786,0.000025208758,0.00003840459,0.000029910356,0.0002890072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982559,0.000020223733,0.000415972,0.000671749,0.0003456208,0.00029052244],"domain_scores_gemma":[0.99861825,0.00046081925,0.00027349405,0.00029467145,0.00027416777,0.000078608085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062303955,0.00031831418,0.00063404586,0.00048089595,0.00008687921,0.00002973325,0.0002036114,0.00018968382,0.000017866094],"category_scores_gemma":[0.0000673942,0.0002657098,0.00016133607,0.00014244067,0.00012659017,0.00007310879,0.00012853343,0.0002507467,0.000008445001],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061730685,0.0001740671,0.00569427,0.00064856594,0.00028770533,0.00017231998,0.012175372,0.0054299203,0.013861564,0.0003266161,0.000008089866,0.9606042],"study_design_scores_gemma":[0.0031011722,0.00041980468,0.001040989,0.0015181788,0.00016948898,0.000065876106,0.000002043739,0.86395514,0.12764665,0.00066568196,0.0009316046,0.00048333697],"about_ca_topic_score_codex":0.00000904641,"about_ca_topic_score_gemma":0.000010058493,"teacher_disagreement_score":0.96012086,"about_ca_system_score_codex":0.00028216853,"about_ca_system_score_gemma":0.00085649156,"threshold_uncertainty_score":0.9999795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007976561,0.0002086408,0.9855672,0.0031342458,0.00011380638,0.0012824523,0.0000042974316,0.000024399826,0.0016884061],"genre_scores_gemma":[0.9337883,0.00012051572,0.06318474,0.0011839974,0.0001704345,0.000017923012,0.000056239063,0.000023112732,0.0014547161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983358,0.00004035942,0.00020142384,0.000733422,0.00051018124,0.00017884419],"domain_scores_gemma":[0.99856836,0.0001726361,0.00017451457,0.0009625982,0.00007715856,0.00004474641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007580579,0.00017726076,0.00025608737,0.00030656357,0.000068490226,0.00006276637,0.0005715536,0.00012270127,0.0000032345672],"category_scores_gemma":[0.00004646522,0.00011781305,0.000016444777,0.00037839342,0.00017823774,0.00010092636,0.00030234482,0.0004275023,0.000004569848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004603728,0.00012795976,0.008052661,0.0006701471,0.00003337652,0.00008593772,0.0029912128,0.08876114,0.016761504,0.007631395,0.00059548777,0.8738288],"study_design_scores_gemma":[0.0012045065,0.0011840134,0.022459554,0.001703158,0.00005786354,0.0004993484,0.000027342112,0.8708579,0.0010084462,0.0025620656,0.09781469,0.0006211295],"about_ca_topic_score_codex":0.000044386863,"about_ca_topic_score_gemma":0.00030583318,"teacher_disagreement_score":0.92581177,"about_ca_system_score_codex":0.000088433,"about_ca_system_score_gemma":0.00012549559,"threshold_uncertainty_score":0.48042768},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002847177,0.00009342242,0.99148357,0.00021722316,0.0021867028,0.0020095177,0.000078039804,0.00021004285,0.0008743217],"genre_scores_gemma":[0.92552674,0.0000026812877,0.07235531,0.00049897353,0.00032572923,0.00017776809,0.00003191126,0.0000556123,0.0010252885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954571,0.000051491927,0.00072064524,0.0019188661,0.0010573704,0.00079449185],"domain_scores_gemma":[0.99724656,0.00060553424,0.0002616506,0.0013872117,0.0003173133,0.00018174898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011876071,0.0006101849,0.0007036749,0.0013934753,0.00021052574,0.0005584932,0.0024142389,0.00051198987,0.000015800382],"category_scores_gemma":[0.000052005,0.0006309403,0.00026298538,0.00046171417,0.0003081355,0.0014172929,0.0005447119,0.0008596676,0.000026569714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025362382,0.00013119867,0.0033822975,0.00014410807,0.00001351012,0.000079601195,0.0012676988,0.0949899,0.0003833669,0.0002709166,0.00004116897,0.8992709],"study_design_scores_gemma":[0.0005992884,0.0002651307,0.0017949974,0.000516877,0.000018314528,0.0000744342,4.516516e-7,0.9945549,0.00052464707,0.000968839,0.000045334175,0.00063681084],"about_ca_topic_score_codex":0.000033710687,"about_ca_topic_score_gemma":0.00095050596,"teacher_disagreement_score":0.92267954,"about_ca_system_score_codex":0.00063840253,"about_ca_system_score_gemma":0.0014021886,"threshold_uncertainty_score":0.9996142},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010356042,0.005479892,0.9808805,0.00024465212,0.0012137217,0.0012716529,0.00036710373,0.000032207747,0.00015422262],"genre_scores_gemma":[0.98558533,0.00053143164,0.0117722135,0.00059530296,0.00060531776,0.00004309675,0.00052911486,0.000045405624,0.00029281306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776727,0.000010169271,0.00029067855,0.0011218642,0.0004917979,0.0003182414],"domain_scores_gemma":[0.9980741,0.0003372773,0.00012906826,0.0010532663,0.00012149876,0.000284746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026531852,0.0003355244,0.0005043555,0.00025910512,0.00009242037,0.00005210436,0.0004252299,0.00016119357,0.000052700656],"category_scores_gemma":[0.000058092228,0.0002790496,0.00010519011,0.000095056195,0.00031642226,0.00015344922,0.00053440366,0.00021628462,0.0000031048105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047283628,0.00026042335,0.19415581,0.00055843993,0.00019952643,0.0002578956,0.00005562671,0.004647264,0.000012861415,0.00037701233,0.00023434474,0.798768],"study_design_scores_gemma":[0.0033634733,0.0008234945,0.45550784,0.003108463,0.0011394004,0.00008240329,4.1099614e-7,0.5194652,0.000343448,0.00881037,0.006306262,0.0010492349],"about_ca_topic_score_codex":0.000004507822,"about_ca_topic_score_gemma":0.000025018186,"teacher_disagreement_score":0.97522926,"about_ca_system_score_codex":0.00010182492,"about_ca_system_score_gemma":0.00044575974,"threshold_uncertainty_score":0.99996614},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019332636,0.0001620113,0.9739141,0.0024015335,0.0033057947,0.0006221827,0.000021722451,0.0002164281,0.000023617098],"genre_scores_gemma":[0.68829244,0.000007246728,0.30967197,0.0017187629,0.00024651314,0.000046962028,6.477264e-7,0.000012220343,0.000003268745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967753,0.000044888668,0.0003258625,0.0013059358,0.0007433926,0.00080456183],"domain_scores_gemma":[0.9979964,0.00039003105,0.00016805982,0.0009873327,0.00031839692,0.00013979663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006771925,0.00027905995,0.00028339276,0.00029382526,0.00027604486,0.00048655597,0.0026444395,0.00012720819,0.00001612678],"category_scores_gemma":[0.00005543913,0.000259024,0.00009076151,0.0023334413,0.00022315861,0.0014858516,0.0006896109,0.00030578088,0.000017229588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002664204,0.00002497133,0.02154021,0.000029994513,0.000006053788,0.0000029412784,0.00029975086,0.14575176,0.0017331215,0.0002686077,0.00003407952,0.83028185],"study_design_scores_gemma":[0.0007236145,0.00009328723,0.02787184,0.00015068681,0.0000022684505,0.000037270136,0.0000011358825,0.961357,0.006155666,0.0026750218,0.0005730865,0.00035914942],"about_ca_topic_score_codex":0.00015149667,"about_ca_topic_score_gemma":0.0004214398,"teacher_disagreement_score":0.82992274,"about_ca_system_score_codex":0.0004981892,"about_ca_system_score_gemma":0.00041370408,"threshold_uncertainty_score":0.9999862},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002016915,0.00028383633,0.99241924,0.00075338496,0.0016670444,0.00086713734,0.000032968368,0.0002164732,0.0017429844],"genre_scores_gemma":[0.11471348,0.00003990549,0.88210136,0.0019381376,0.0008725531,0.000026196365,0.000017833616,0.00006130226,0.00022925668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950699,0.00005967965,0.0007294085,0.002379567,0.0009567495,0.0008046808],"domain_scores_gemma":[0.996626,0.0007333394,0.0002911757,0.0019398347,0.00015311963,0.00025653729],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043311671,0.00061370956,0.0006649167,0.0008488342,0.00019541336,0.00033747713,0.003553328,0.0003707022,0.000018331428],"category_scores_gemma":[0.00007479995,0.00061046093,0.00012189905,0.0012921114,0.0004116289,0.000941932,0.0017556772,0.0008554373,0.00007849596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014020018,0.00004291618,0.00032288485,0.000012366724,0.000008130763,0.000054109903,0.00048804245,0.30770507,0.004412811,0.0017793798,0.00007041656,0.6850898],"study_design_scores_gemma":[0.0003273792,0.00009592057,0.0011781218,0.00031944632,0.000009168407,0.000030928124,3.450742e-7,0.94804037,0.0033717807,0.045409538,0.0005734782,0.0006435133],"about_ca_topic_score_codex":0.00010116859,"about_ca_topic_score_gemma":0.0004946098,"teacher_disagreement_score":0.68444633,"about_ca_system_score_codex":0.00064529787,"about_ca_system_score_gemma":0.0004983957,"threshold_uncertainty_score":0.9996347},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017901488,0.00012095101,0.9913797,0.00054201257,0.0024737578,0.0014556454,0.000004339529,0.000067679706,0.002165815],"genre_scores_gemma":[0.3077116,0.00028538084,0.6243699,0.008866352,0.00896523,0.000090114285,0.00041765615,0.00022536163,0.049068365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826765,0.000011293227,0.0002948574,0.0006408171,0.0004790246,0.0003063562],"domain_scores_gemma":[0.99913174,0.0001349427,0.00016490238,0.00036699907,0.00013041792,0.00007097334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003677865,0.0002403302,0.00030549982,0.00032434735,0.00013385814,0.00008261241,0.00017725227,0.00018513309,0.000048852675],"category_scores_gemma":[0.000025478892,0.0002171905,0.000117188,0.0001403556,0.000119155586,0.00007007942,0.00012954036,0.00024749266,0.000057278525],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015900619,0.000030834948,0.00013875276,0.00021443168,0.00003416766,0.00004728086,0.00012241837,0.021231987,0.0017025762,0.0013751588,0.00085551717,0.9740879],"study_design_scores_gemma":[0.0104338555,0.0077861007,0.009044304,0.0063731875,0.0009262812,0.0018267292,0.000007832704,0.74067605,0.01411752,0.0821049,0.123060524,0.0036427337],"about_ca_topic_score_codex":0.00000973032,"about_ca_topic_score_gemma":0.000081478334,"teacher_disagreement_score":0.97044516,"about_ca_system_score_codex":0.0002885353,"about_ca_system_score_gemma":0.0001568631,"threshold_uncertainty_score":0.88567716},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014250108,0.00062747824,0.98193264,0.0004806003,0.0014014279,0.001016523,0.000009019353,0.00005670307,0.00022552501],"genre_scores_gemma":[0.9837379,0.000034025776,0.014608746,0.0005638824,0.00028782978,0.000026602866,0.00003210724,0.000047899073,0.0006610499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794763,0.000027236572,0.00045548505,0.0008330106,0.0003275752,0.00040907072],"domain_scores_gemma":[0.99827534,0.00075515243,0.00021295196,0.00034194125,0.00032502168,0.0000895801],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042448807,0.0003497938,0.00048797348,0.00075805216,0.00013523319,0.00007662632,0.00027224002,0.00024661428,0.000059158556],"category_scores_gemma":[0.00043723697,0.00033377856,0.00016588483,0.00022887789,0.00032128234,0.00023075304,0.00022224098,0.0010906351,0.000016884074],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001069829,0.00011322077,0.0075635677,0.00014348308,0.000018306047,0.00012178088,0.0005581882,0.009383812,0.0002806402,0.00013549569,0.000007507422,0.981567],"study_design_scores_gemma":[0.003800371,0.0013815925,0.03529727,0.003981116,0.0000882515,0.00039857483,0.000027822474,0.94337445,0.0020305112,0.004453589,0.004239947,0.0009264715],"about_ca_topic_score_codex":0.00012866562,"about_ca_topic_score_gemma":0.00051970733,"teacher_disagreement_score":0.98064053,"about_ca_system_score_codex":0.00044912845,"about_ca_system_score_gemma":0.00041551102,"threshold_uncertainty_score":0.9999114},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091153815,0.00025093497,0.90299815,0.0032899186,0.000508073,0.001554824,0.000027916065,0.000092645765,0.00012374809],"genre_scores_gemma":[0.9128183,0.00035150818,0.08546007,0.00040725962,0.0004294668,0.000049577873,0.00017990054,0.000032085438,0.00027179558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983769,0.000017668372,0.0003688686,0.0007337468,0.0002747053,0.00022811546],"domain_scores_gemma":[0.9989881,0.00017881076,0.00020172079,0.00036055606,0.00016031407,0.00011050153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005398407,0.00022831676,0.0003273265,0.00030781302,0.00012717303,0.00008292263,0.00012848774,0.00021075315,0.0000072346706],"category_scores_gemma":[0.00012194502,0.00020615743,0.000042363485,0.00019530472,0.00049333903,0.00020423961,0.000096615215,0.0005365414,0.0000023670038],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014935099,0.000056672627,0.0028910446,0.0005633661,0.000013006196,0.000013079713,0.00045062753,0.00045600958,0.0050401017,0.002411033,0.0001948302,0.9877609],"study_design_scores_gemma":[0.002915024,0.0007392349,0.01108381,0.006724334,0.00015402344,0.002131464,0.000009180525,0.8965604,0.0073522907,0.0675411,0.0037595108,0.0010296811],"about_ca_topic_score_codex":0.00004561042,"about_ca_topic_score_gemma":0.000029320483,"teacher_disagreement_score":0.9867312,"about_ca_system_score_codex":0.00020173375,"about_ca_system_score_gemma":0.00020684674,"threshold_uncertainty_score":0.84068567},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3311396,0.00005797847,0.66476905,0.000045822555,0.0014788719,0.0018907039,0.00013020939,0.00009333474,0.00039442533],"genre_scores_gemma":[0.76560444,0.000009340596,0.23160374,0.0012734324,0.0005730869,0.000015940572,0.0004868755,0.00008418648,0.000348958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961852,0.000039939525,0.0006603056,0.001336432,0.0010504604,0.00072765973],"domain_scores_gemma":[0.9981865,0.00020309168,0.0004948401,0.00067342847,0.00028052655,0.00016155835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002817249,0.0007110478,0.0009667789,0.00047720305,0.00012832198,0.000120669705,0.00052542926,0.00025191173,0.000039677598],"category_scores_gemma":[0.000044850873,0.0006065645,0.000115560404,0.00038613545,0.000422902,0.00031797212,0.0004487564,0.0008133381,0.000014920825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0072130375,0.00071546255,0.3388489,0.0002428375,0.0037333453,0.0020433322,0.009342092,0.47480008,0.03226083,0.000040223313,0.0038970558,0.1268628],"study_design_scores_gemma":[0.019518832,0.0007099405,0.016115488,0.0019037726,0.00052296,0.000027668266,0.0000070666833,0.9560193,0.0039781695,0.00001824222,0.00015942386,0.0010191499],"about_ca_topic_score_codex":0.00033060298,"about_ca_topic_score_gemma":0.00032470585,"teacher_disagreement_score":0.4812192,"about_ca_system_score_codex":0.0011040665,"about_ca_system_score_gemma":0.0008237726,"threshold_uncertainty_score":0.99963856},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000060968364,0.00039152068,0.9805456,0.0034932583,0.0026444292,0.0008183725,0.000008248783,0.00020326562,0.011889198],"genre_scores_gemma":[0.07127261,0.000089975154,0.9223157,0.0032260898,0.0008473337,0.000040671486,0.000028158276,0.00007430983,0.002105134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99430156,0.00007928325,0.0006766511,0.0019210351,0.0022335218,0.0007879689],"domain_scores_gemma":[0.9951525,0.0020211404,0.0005308875,0.001350082,0.00058040273,0.00036501294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023246629,0.00056594086,0.0006465415,0.0014730787,0.00030406946,0.0006304216,0.0040540183,0.0005568082,0.000087498986],"category_scores_gemma":[0.00095605134,0.0005185934,0.00021921695,0.0012289069,0.00076020067,0.00088788697,0.0009249361,0.001128995,0.00021617976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028932773,0.000055083725,0.000021956215,0.000071303744,0.000031998832,0.000051724473,0.001226641,0.0054771956,0.0005174772,0.29134193,0.0003824947,0.70079327],"study_design_scores_gemma":[0.0006183557,0.00029137955,0.00022943971,0.0002613328,0.0000130028975,0.000046004898,0.0000016238666,0.92843115,0.00039005894,0.054103512,0.014909015,0.00070511224],"about_ca_topic_score_codex":0.000011423231,"about_ca_topic_score_gemma":0.000031162395,"teacher_disagreement_score":0.92295396,"about_ca_system_score_codex":0.00042884808,"about_ca_system_score_gemma":0.0020226291,"threshold_uncertainty_score":0.9997266},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07637846,0.00013345965,0.9159957,0.000015199192,0.0052844174,0.0013182971,0.0000049050404,0.00016826425,0.00070126256],"genre_scores_gemma":[0.98707473,0.0000030072054,0.011599538,0.00008457313,0.0011065411,0.00003056468,4.769524e-7,0.00006994405,0.00003059558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764603,0.00004333265,0.0005363246,0.00087273243,0.00041991795,0.00048168795],"domain_scores_gemma":[0.99788135,0.0012032547,0.00011818064,0.00062466785,0.00008477529,0.000087770204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016097964,0.00038676496,0.0005244132,0.0005274931,0.00009291291,0.00013676433,0.0006428424,0.0003283226,0.0000033537035],"category_scores_gemma":[0.00019650672,0.00040134136,0.0001260051,0.00028945427,0.00015861834,0.00026817535,0.00024694836,0.0010800095,0.000020917942],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003442786,0.00006137696,0.024451317,0.0002045098,0.000030579726,0.000064885935,0.00041715035,0.058309987,0.006438937,0.000021096519,0.0000060460807,0.9099597],"study_design_scores_gemma":[0.010930087,0.007882476,0.16250199,0.006387703,0.00018963373,0.00011295832,0.000016092992,0.6138772,0.15255226,0.028409882,0.0072574583,0.009882251],"about_ca_topic_score_codex":0.000011410364,"about_ca_topic_score_gemma":0.000384482,"teacher_disagreement_score":0.9106963,"about_ca_system_score_codex":0.0004972897,"about_ca_system_score_gemma":0.00017534445,"threshold_uncertainty_score":0.99984384},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004219637,0.0003514496,0.99291587,0.00044246402,0.002786082,0.000469562,0.000010260379,0.00011528256,0.0028668211],"genre_scores_gemma":[0.03248563,0.000095037394,0.9663042,0.00021521731,0.00019999185,0.0000101986925,0.00001585271,0.000032942953,0.0006409453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964466,0.00004912553,0.00070890726,0.0013171752,0.0010518668,0.00042631748],"domain_scores_gemma":[0.9965624,0.00037117786,0.00072818424,0.0018739364,0.00036361156,0.00010066383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013198192,0.0003967461,0.0004567153,0.0006651496,0.00015061244,0.00023066413,0.0029138986,0.00039291047,0.0000202281],"category_scores_gemma":[0.00012437064,0.00039072675,0.00011285868,0.00064528215,0.0005106913,0.0011145918,0.00049341377,0.00060285773,0.00007849321],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007029128,0.000050702063,0.000040854822,0.000085491505,0.00000913479,0.0000030630683,0.00045682047,0.008025588,0.002933331,0.033944957,0.00009068255,0.9543523],"study_design_scores_gemma":[0.00022934152,0.00023067485,0.00046387312,0.00035182916,0.000011474839,0.00005637759,2.6381338e-7,0.91205496,0.042041376,0.037317492,0.0065606614,0.0006816591],"about_ca_topic_score_codex":0.00004175605,"about_ca_topic_score_gemma":0.000013888799,"teacher_disagreement_score":0.9536707,"about_ca_system_score_codex":0.000370032,"about_ca_system_score_gemma":0.00037061673,"threshold_uncertainty_score":0.99985445},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015787671,0.00020033322,0.99390113,0.0004669568,0.002212033,0.0010950016,0.000028953551,0.00006991861,0.0018677795],"genre_scores_gemma":[0.60710514,0.00004799683,0.38408923,0.0065143406,0.0010121977,0.00024280549,0.000082711704,0.00014467919,0.0007609026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960863,0.000036971243,0.0005192601,0.0018857099,0.0007516595,0.000720116],"domain_scores_gemma":[0.99715483,0.0007067878,0.00046559545,0.0008932112,0.00059183117,0.00018773315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042141523,0.00069266843,0.00064212305,0.0005825688,0.00036929955,0.0006683607,0.002187763,0.0002474743,0.000028578857],"category_scores_gemma":[0.00008942026,0.00059001957,0.00020203962,0.00048808192,0.00038128055,0.0013629532,0.0007321441,0.00092115573,0.000054839686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016039832,0.0007723145,0.00057971827,0.0009852258,0.00065009255,0.0010028145,0.017013563,0.11726735,0.037839357,0.040448006,0.0017332878,0.7801043],"study_design_scores_gemma":[0.0010632472,0.0012208928,0.0001907269,0.0011486227,0.000036893423,0.00014084928,0.0000047278204,0.96953344,0.007330932,0.0028536986,0.015308915,0.0011670376],"about_ca_topic_score_codex":0.000040133255,"about_ca_topic_score_gemma":0.00013968581,"teacher_disagreement_score":0.85226613,"about_ca_system_score_codex":0.0005992331,"about_ca_system_score_gemma":0.00042335462,"threshold_uncertainty_score":0.9996551},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016812728,0.0013022613,0.99480724,0.0003320667,0.0010059902,0.00052678795,0.0000057317693,0.00014999762,0.00018865001],"genre_scores_gemma":[0.384958,0.0010359638,0.6091702,0.003689121,0.0007730492,0.000015780857,0.000022433984,0.00009359101,0.00024187528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957334,0.00010934289,0.00078243815,0.0016609058,0.0011503712,0.0005635861],"domain_scores_gemma":[0.99800855,0.00028545616,0.00024265112,0.000979873,0.00028126637,0.00020218435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013726266,0.00057924225,0.0007034335,0.0011856172,0.00017186085,0.0008846167,0.002182831,0.00047144727,0.000030336336],"category_scores_gemma":[0.00007710301,0.00054137834,0.000089161775,0.0007372504,0.0006516548,0.0009106197,0.0020651608,0.0008547027,0.000008584371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008260657,0.00009806476,0.0012059793,0.00016041519,0.000022647037,0.000116757226,0.0021149907,0.009301453,0.00046575413,0.081465684,0.00011161813,0.9049284],"study_design_scores_gemma":[0.00033061334,0.00018624484,0.00012259139,0.0007568739,0.0000054677284,0.000107478925,2.5301975e-7,0.9893364,0.001147777,0.005962548,0.0014228816,0.0006208741],"about_ca_topic_score_codex":0.00008655639,"about_ca_topic_score_gemma":0.00025972966,"teacher_disagreement_score":0.98003495,"about_ca_system_score_codex":0.00019992336,"about_ca_system_score_gemma":0.00070974167,"threshold_uncertainty_score":0.99970376},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028263398,0.00069195806,0.9916185,0.00020767805,0.0026363686,0.00059542625,0.000010291665,0.0008631398,0.0005502948],"genre_scores_gemma":[0.37814498,0.000038483613,0.62054324,0.0002936958,0.0005488604,0.000008553967,0.000011942496,0.00008516841,0.00032504278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946863,0.00006901939,0.0004714084,0.001890617,0.0018649269,0.0010176942],"domain_scores_gemma":[0.99622023,0.0011340701,0.00017928438,0.0015873992,0.000671007,0.00020803796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011635079,0.00057552615,0.00052285765,0.0016757746,0.00031900234,0.0006682552,0.0036487016,0.00048330662,0.000029767392],"category_scores_gemma":[0.00019850508,0.0005765139,0.00014551333,0.0013751385,0.00047494625,0.0012539861,0.002148795,0.0014289295,0.00015188547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023069435,0.00008820592,0.0010867796,0.00031470344,0.00006553541,0.00030996717,0.0018145157,0.7683554,0.007891128,0.0035956518,0.00004875608,0.21640624],"study_design_scores_gemma":[0.00021583088,0.00012349857,0.0048199636,0.00043017996,0.0000057793013,0.00023763301,3.542338e-7,0.9842528,0.0041694087,0.0048883962,0.00022585831,0.0006302914],"about_ca_topic_score_codex":0.00025346916,"about_ca_topic_score_gemma":0.000025410156,"teacher_disagreement_score":0.37531865,"about_ca_system_score_codex":0.0016207022,"about_ca_system_score_gemma":0.0025029993,"threshold_uncertainty_score":0.99966866},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035360868,0.000029532732,0.9655368,0.0027466272,0.0015895242,0.00052964926,0.0000020977566,0.000075471224,0.025954252],"genre_scores_gemma":[0.95125705,0.0000028115358,0.039082915,0.0074377465,0.0015102086,0.000008412235,0.00013885208,0.000052872354,0.0005091389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980813,0.000008941488,0.00048689405,0.0006631224,0.00046382364,0.00029587833],"domain_scores_gemma":[0.998877,0.00012527895,0.0002928129,0.0002853897,0.00040986342,0.000009663704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006311263,0.0002876827,0.00024758192,0.0010521264,0.00020489188,0.0004443247,0.0004724333,0.00021769138,0.00017481745],"category_scores_gemma":[0.00019040944,0.0002882293,0.0000327483,0.0016656268,0.00012154431,0.001927948,0.00031973765,0.000561927,0.00050004345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004886416,0.00009547061,0.040276162,0.00043376134,0.000021355116,0.000028036106,0.0013793423,0.26724157,0.0017293282,0.5259191,0.00050639635,0.16232064],"study_design_scores_gemma":[0.0018855896,0.00007109426,0.068704985,0.0035691673,0.00006200944,0.000023685205,0.000021757185,0.32166925,0.0010961213,0.5765603,0.023078645,0.0032573363],"about_ca_topic_score_codex":0.000078379446,"about_ca_topic_score_gemma":0.00021157347,"teacher_disagreement_score":0.94772094,"about_ca_system_score_codex":0.00021472204,"about_ca_system_score_gemma":0.00015913344,"threshold_uncertainty_score":0.99995697},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22898728,0.000104783576,0.76722103,0.00028062615,0.00031157452,0.0008232966,0.000021238515,0.000029530373,0.0022206674],"genre_scores_gemma":[0.994566,0.000011225778,0.0051128464,0.00013164175,0.000050971164,0.0000030933138,0.000013153821,0.000005690785,0.00010532887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981376,0.00012141371,0.00036319997,0.00044809116,0.0007302031,0.00019947109],"domain_scores_gemma":[0.9987236,0.0004977948,0.00025079242,0.0003417156,0.00015116764,0.000034929708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018261623,0.00015569842,0.00034729537,0.00086731697,0.0002128363,0.000105666106,0.0005956724,0.000139999,0.000037617985],"category_scores_gemma":[0.00007498957,0.00012077682,0.00008559569,0.0015129632,0.00040557628,0.00014931189,0.000033377102,0.00026711353,0.0000015470544],"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.000011946802,0.00012281172,0.28232312,0.000018319195,0.00008148325,0.00059576577,0.15047064,0.54474026,6.494537e-7,0.0024398528,0.0000044809326,0.019190643],"study_design_scores_gemma":[0.0019417427,0.0010421551,0.3898294,0.00063698355,0.0015903913,0.00008605211,0.0020440072,0.5839224,0.000026132417,0.015699347,0.0009860568,0.002195338],"about_ca_topic_score_codex":0.006784222,"about_ca_topic_score_gemma":0.13285644,"teacher_disagreement_score":0.76557875,"about_ca_system_score_codex":0.0000792023,"about_ca_system_score_gemma":0.00038708613,"threshold_uncertainty_score":0.9998297},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008662055,0.00018732558,0.99785197,0.0004634106,0.000272322,0.0002726776,9.3894937e-7,0.00019815694,0.00066657027],"genre_scores_gemma":[0.07601693,0.0000315265,0.9219713,0.0012165788,0.00007172197,0.000009762852,0.000017898932,0.000019987296,0.00064428814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673766,0.00005855949,0.0004890639,0.0013136135,0.0010117043,0.00038940192],"domain_scores_gemma":[0.9984662,0.000430254,0.00019248542,0.0005541896,0.00019696928,0.00015992108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010117787,0.0003689565,0.0004690626,0.0013781142,0.00027233758,0.00034290785,0.0012989059,0.00018691014,0.000026083562],"category_scores_gemma":[0.00011228542,0.00033589677,0.00008959281,0.0007852527,0.00036274627,0.0006799327,0.0013266387,0.00074795727,0.000015606898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017605298,0.000012332248,0.00010765447,0.000025654195,0.00005362389,0.000021664355,0.0021688063,0.08516244,0.00013378725,0.0010883501,0.0000037487723,0.9112202],"study_design_scores_gemma":[0.000099036115,0.000067335706,0.00015482427,0.00013771567,0.00002390523,0.000013950554,6.209449e-7,0.9847885,0.0011929214,0.013064168,0.00006851268,0.00038853983],"about_ca_topic_score_codex":0.000018482602,"about_ca_topic_score_gemma":0.000024819597,"teacher_disagreement_score":0.91083163,"about_ca_system_score_codex":0.00028242156,"about_ca_system_score_gemma":0.00039283794,"threshold_uncertainty_score":0.9999093},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019458361,0.000119255055,0.9530041,0.000714369,0.0019123299,0.00079150236,0.000019868854,0.00005991208,0.041432783],"genre_scores_gemma":[0.9872109,0.00000966325,0.009319895,0.0015031357,0.0013880464,0.000010664706,0.00021851514,0.000035359804,0.00030376852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857694,0.0000017879462,0.0003665129,0.000488727,0.0003216344,0.0002444075],"domain_scores_gemma":[0.9985356,0.000055931625,0.0004090219,0.00032030963,0.0006728016,0.0000063510747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040749164,0.0002447517,0.00032910836,0.00058352825,0.000089777976,0.00023684699,0.00051370985,0.00021234358,0.00007286565],"category_scores_gemma":[0.000042205695,0.0002189194,0.00006628144,0.00049142004,0.0002679741,0.00076680916,0.00016092675,0.00020087726,0.00003652374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046042278,0.000037145197,0.00012795781,0.0010311026,0.00001350638,0.0000041700187,0.000026910056,0.016296955,0.0007645239,0.87518626,0.000080683116,0.106384724],"study_design_scores_gemma":[0.00078039157,0.0000998235,0.0008278048,0.001057729,0.000046145116,0.0000057227535,7.92874e-7,0.15173818,0.0009632014,0.8356795,0.008002473,0.00079823966],"about_ca_topic_score_codex":0.000086956126,"about_ca_topic_score_gemma":0.000081495135,"teacher_disagreement_score":0.98526514,"about_ca_system_score_codex":0.000048469472,"about_ca_system_score_gemma":0.00027639154,"threshold_uncertainty_score":0.89272743},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001998264,0.00073708716,0.98957366,0.001780388,0.0013373935,0.0011368273,0.000022210594,0.00006363183,0.0033505526],"genre_scores_gemma":[0.026624573,0.00017234228,0.97039366,0.002023017,0.00037287737,0.000017693035,0.000016785465,0.000052393454,0.00032665176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692863,0.00011236487,0.0005383361,0.0011309875,0.0007766297,0.0005130385],"domain_scores_gemma":[0.9963466,0.0023525013,0.00018707046,0.00081144884,0.0001532689,0.00014912723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016922713,0.00041209036,0.00057281315,0.0012088673,0.00018541205,0.00016956295,0.00056876044,0.00024319981,0.000041004623],"category_scores_gemma":[0.0006447863,0.00029175248,0.00017688796,0.00092591177,0.0007651482,0.00026573087,0.00013193703,0.0011984598,0.00004202664],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031696836,0.00007854252,0.0012637135,0.000093487804,0.000053487554,0.000026043828,0.0062627434,0.012321091,0.0150634395,0.0011048065,0.0002194613,0.9631962],"study_design_scores_gemma":[0.008336354,0.008849273,0.077453874,0.024669696,0.0007036645,0.011780134,0.00020603056,0.44956347,0.008349253,0.30433843,0.099953726,0.0057961154],"about_ca_topic_score_codex":0.00006183262,"about_ca_topic_score_gemma":0.00009943524,"teacher_disagreement_score":0.9574001,"about_ca_system_score_codex":0.00028560092,"about_ca_system_score_gemma":0.0003967506,"threshold_uncertainty_score":0.99995345},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007137325,0.0012936281,0.9898825,0.000018639877,0.0011467544,0.00022513332,0.0000025583518,0.000101896236,0.00019153078],"genre_scores_gemma":[0.98133904,0.00013060415,0.017896282,0.00005674239,0.0005069344,0.000001039635,0.000013539579,0.000036322497,0.000019526655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998789,0.0000103734665,0.0003318742,0.00036410248,0.00023491183,0.00026972647],"domain_scores_gemma":[0.99947727,0.000102397855,0.00010223109,0.00019473236,0.00008013937,0.000043202293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019892985,0.00027700188,0.00031299097,0.0002522641,0.000079679245,0.00009309468,0.00020168602,0.0003203181,0.000005097956],"category_scores_gemma":[0.000006999887,0.00025467938,0.00004583861,0.00018695154,0.00016299462,0.0003174734,0.000049603223,0.0005319626,4.190483e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004400177,0.000001722913,0.000014102511,0.000022052667,0.0000066868874,0.0000027353701,0.00013900173,0.67864805,0.00009629558,0.000024616973,0.0000012107179,0.32103914],"study_design_scores_gemma":[0.00014036018,0.00005323882,0.00016180283,0.00027041975,0.000017733597,0.000030787203,2.88013e-7,0.9980587,0.00063625915,0.00035073195,0.000026685435,0.00025299256],"about_ca_topic_score_codex":0.0000120323275,"about_ca_topic_score_gemma":0.00003562618,"teacher_disagreement_score":0.9742017,"about_ca_system_score_codex":0.000103693805,"about_ca_system_score_gemma":0.000033236433,"threshold_uncertainty_score":0.9999905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27013725,0.00027637772,0.7242401,0.00013690327,0.002054978,0.0008876567,0.0000016973687,0.00009508319,0.0021699124],"genre_scores_gemma":[0.99643177,0.000005723882,0.0028632893,0.00024838885,0.0003272704,0.0000017368853,0.000067925335,0.000022106848,0.00003179217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812806,0.000009388457,0.00040810904,0.0006629084,0.0004895127,0.00030202817],"domain_scores_gemma":[0.9989722,0.000075903255,0.00036086907,0.0003330949,0.0002445996,0.0000133511385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005631447,0.00030397644,0.0004097804,0.00078388647,0.00009687447,0.00016811269,0.00046412245,0.00028977415,0.000024926165],"category_scores_gemma":[0.000051690484,0.0002667447,0.000052510226,0.00036424532,0.000127432,0.0012156346,0.00036181408,0.00042165554,0.000009486615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012251426,0.00022980146,0.01374374,0.0004798119,0.000026819527,0.000015887024,0.002912067,0.7386267,0.0067158504,0.0337294,0.000024400784,0.203373],"study_design_scores_gemma":[0.0007791914,0.000050809904,0.0048748194,0.0008480075,0.000015274622,0.0000010676029,0.000005782995,0.9547202,0.005069958,0.032611344,0.00032506217,0.0006984648],"about_ca_topic_score_codex":0.00006892221,"about_ca_topic_score_gemma":0.00008974974,"teacher_disagreement_score":0.7262945,"about_ca_system_score_codex":0.00017636387,"about_ca_system_score_gemma":0.00011199292,"threshold_uncertainty_score":0.9999785},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001476762,0.00007205099,0.99635845,0.000018918925,0.0011944921,0.00048964476,0.0000063529383,0.00024608555,0.0014663127],"genre_scores_gemma":[0.31123263,0.0000062732297,0.6886081,0.000044171644,0.00005241347,0.0000080022455,0.000005249877,0.000019476038,0.000023698254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668676,0.000037730926,0.0006117112,0.0010854921,0.0010864197,0.0004918908],"domain_scores_gemma":[0.9978281,0.00042698343,0.00032853844,0.0011548304,0.00019185727,0.0000696387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013288133,0.00041180663,0.000605502,0.0006753235,0.00008919206,0.000092857255,0.0020210438,0.00022984229,7.6450397e-7],"category_scores_gemma":[0.000053999724,0.0003742991,0.00012363457,0.00036982328,0.00013596732,0.0007164141,0.00019324044,0.0005683371,0.0000026155758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003158323,0.000013153975,0.000011590201,0.00021430888,0.000008266017,0.000007086578,0.00023507919,0.87772524,0.00010655327,0.063002154,1.6776966e-7,0.058673214],"study_design_scores_gemma":[0.00021651435,0.00019687862,0.00008964189,0.0006692088,0.0000067985006,0.000007900361,5.343821e-7,0.981289,0.00035901458,0.016813098,0.0000052317864,0.00034616477],"about_ca_topic_score_codex":0.000005847184,"about_ca_topic_score_gemma":0.000002122569,"teacher_disagreement_score":0.31108493,"about_ca_system_score_codex":0.00045887326,"about_ca_system_score_gemma":0.00041127735,"threshold_uncertainty_score":0.9998709},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1253252,0.00022280625,0.86488134,0.00008410783,0.0009247089,0.000857858,0.000004480281,0.00006514761,0.007634341],"genre_scores_gemma":[0.8246799,0.0000066320003,0.17410427,0.000040312938,0.00009064187,0.0000017472115,0.00001245868,0.000011389574,0.0010526368],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986917,0.00018592898,0.00021331845,0.00048950646,0.00025293592,0.00016665726],"domain_scores_gemma":[0.9990884,0.00024094325,0.00023835243,0.0002843298,0.00012551917,0.000022433493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009973648,0.00016837909,0.00027413512,0.00049594365,0.00005247485,0.000047673435,0.00039087096,0.00018280887,0.0000144566975],"category_scores_gemma":[0.000031415555,0.00016335658,0.000024904708,0.0003368375,0.0002729197,0.000113446804,0.000115200935,0.0005699269,0.0000019441316],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007304092,0.00044432844,0.0214229,0.000116430914,0.000026490989,0.0000062264394,0.009776017,0.0031628597,0.000075751406,0.045302674,0.0000043502123,0.9195889],"study_design_scores_gemma":[0.003019779,0.0014019003,0.8797452,0.0018985498,0.000054553697,0.000024215828,0.0001448568,0.041209333,0.00005353113,0.055896733,0.015381895,0.0011694853],"about_ca_topic_score_codex":0.00005989951,"about_ca_topic_score_gemma":0.00010104636,"teacher_disagreement_score":0.9184194,"about_ca_system_score_codex":0.00013827163,"about_ca_system_score_gemma":0.00035531507,"threshold_uncertainty_score":0.6661488},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013463164,0.00032485792,0.97386557,0.00148953,0.0021353622,0.00078589364,3.4871795e-7,0.00008890034,0.007846401],"genre_scores_gemma":[0.74763995,0.000010259085,0.2512267,0.0005905816,0.00024665068,0.000007332576,0.000007648476,0.000019740328,0.00025113465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740344,0.000051765994,0.0004154496,0.0010738,0.0006294566,0.00042607324],"domain_scores_gemma":[0.99879193,0.00017750925,0.0002734849,0.00044982758,0.00019195874,0.00011527603],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012554993,0.00029866415,0.00030209273,0.0007992017,0.00040404458,0.00063011673,0.0012170469,0.00019508145,0.00001088808],"category_scores_gemma":[0.00010502814,0.0002968006,0.000039433875,0.00063260744,0.00026407375,0.0009235999,0.0019544028,0.0007122955,0.00001205946],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010971163,0.00004435497,0.00053145934,0.000038055525,0.0000018138767,0.0000023271919,0.021459049,0.0020246394,0.00017196029,0.013065755,7.492292e-7,0.96265876],"study_design_scores_gemma":[0.0002859975,0.00013610182,0.0026782844,0.0018263486,0.0000052775904,0.00013348686,0.000027944803,0.9340702,0.00013788384,0.058637965,0.0013132028,0.0007472547],"about_ca_topic_score_codex":0.000042995503,"about_ca_topic_score_gemma":0.000044876022,"teacher_disagreement_score":0.9619115,"about_ca_system_score_codex":0.0003674771,"about_ca_system_score_gemma":0.002467136,"threshold_uncertainty_score":0.9999484},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000813208,0.0012765853,0.9927721,0.00068654446,0.00022711299,0.0003612579,0.0000025421546,0.00005608656,0.0038045717],"genre_scores_gemma":[0.8529414,0.00056916155,0.14522667,0.00093880977,0.000066572364,0.0000113637825,0.0000065220843,0.000021392623,0.00021809252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766356,0.0000425931,0.00042788978,0.00095161767,0.00050819875,0.00040616313],"domain_scores_gemma":[0.9971862,0.00071451435,0.00021612726,0.0016384642,0.00013072403,0.000113983995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010504345,0.00029917934,0.0003992787,0.0012016193,0.00015111516,0.0005044987,0.0022867704,0.00022510288,0.0000036681017],"category_scores_gemma":[0.00014815222,0.00028359363,0.000043610486,0.0011286399,0.00032903763,0.0006997943,0.001383698,0.0005659381,0.00002609607],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021057876,0.000024136762,0.000313928,0.000041040228,0.0000032878918,0.000004662915,0.00071104977,0.0033904493,0.00013894982,0.076406576,0.0000049362084,0.9189589],"study_design_scores_gemma":[0.00078473444,0.00034330963,0.012431774,0.001637082,0.000010496312,0.0000897917,0.0000017833395,0.65522426,0.004617195,0.3177255,0.0056077335,0.0015262957],"about_ca_topic_score_codex":0.00021449423,"about_ca_topic_score_gemma":0.000577436,"teacher_disagreement_score":0.9174326,"about_ca_system_score_codex":0.00025377556,"about_ca_system_score_gemma":0.00058776286,"threshold_uncertainty_score":0.9999616},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01597138,0.00011531575,0.97645074,0.0034741657,0.0029894656,0.0006197923,0.000006439409,0.0003060569,0.00006667212],"genre_scores_gemma":[0.5144983,0.000011664431,0.48490113,0.0003636464,0.00017996044,0.000034007455,0.0000027534577,0.000008191565,3.3981672e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956207,0.00028813272,0.00069400546,0.0016175047,0.0010756223,0.00070398615],"domain_scores_gemma":[0.99584603,0.0006505736,0.0003651262,0.0025274323,0.0003857032,0.00022514345],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018015284,0.00044048412,0.0005281157,0.00020268053,0.00037488452,0.00125741,0.00994016,0.00022375963,0.000005520244],"category_scores_gemma":[0.00035485358,0.00030852115,0.00022357437,0.0025061844,0.0018473561,0.00053667463,0.007688959,0.001730216,0.000008980156],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007374502,0.00016171292,0.00052583026,0.00005012205,0.000011673937,0.00001718845,0.0015445823,0.0067145685,0.000034879366,0.010157998,0.000008639084,0.9807654],"study_design_scores_gemma":[0.00009014886,0.0001082344,0.0015109128,0.00010702544,0.0000031148484,0.000021326676,0.0000011756435,0.6517712,0.0017889739,0.34416875,0.00016565678,0.00026347526],"about_ca_topic_score_codex":0.0002658335,"about_ca_topic_score_gemma":0.00018731138,"teacher_disagreement_score":0.98050195,"about_ca_system_score_codex":0.0001260181,"about_ca_system_score_gemma":0.0007178959,"threshold_uncertainty_score":0.9999367},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0136282565,0.0004622832,0.9763004,0.0056254785,0.0033640314,0.00031634,0.0000030127287,0.0002724781,0.000027675958],"genre_scores_gemma":[0.56056005,0.000015437272,0.4376645,0.0014075852,0.00031937545,0.000012573988,0.000012009219,0.000008066306,3.7455055e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959539,0.00013266705,0.0004982331,0.0018354148,0.001034571,0.00054519816],"domain_scores_gemma":[0.9978457,0.00038048677,0.00024238694,0.0010581465,0.00024384061,0.00022943204],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00081839104,0.00042698171,0.0004277695,0.0009243837,0.00033015394,0.0011683697,0.0036838015,0.00021568696,0.000004585331],"category_scores_gemma":[0.00023361195,0.00041415653,0.00014581053,0.0033060077,0.00026795085,0.00061526446,0.0026271744,0.000893886,0.000025434218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037667783,0.000039072977,0.00048257588,0.00004740741,0.00000959949,0.000048999296,0.002161529,0.49196923,0.00175021,0.0048043616,0.000037473255,0.49864578],"study_design_scores_gemma":[0.00012344742,0.00006328168,0.002371383,0.0000933769,0.0000034805878,0.000015671149,3.189395e-7,0.6721887,0.004912375,0.31978023,0.00009600086,0.00035171545],"about_ca_topic_score_codex":0.000096307835,"about_ca_topic_score_gemma":0.00014366437,"teacher_disagreement_score":0.5469318,"about_ca_system_score_codex":0.0001981808,"about_ca_system_score_gemma":0.0008128846,"threshold_uncertainty_score":0.9998685},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008007204,0.00013168933,0.99674606,0.00013846564,0.0010990544,0.0009220585,0.0000115626435,0.00004099575,0.00010938524],"genre_scores_gemma":[0.5756556,0.00003839578,0.42351684,0.00020968553,0.00035390686,0.00003223656,0.00008668114,0.000032649274,0.00007403431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651176,0.00008003837,0.0008163285,0.0014108942,0.0006926697,0.000488339],"domain_scores_gemma":[0.9959644,0.0006248785,0.00078127097,0.0024197032,0.00015864092,0.000051101444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003644565,0.0003260262,0.00045759522,0.00043507226,0.00018609969,0.00019043603,0.0046588415,0.00025283336,0.0000021235044],"category_scores_gemma":[0.00014938015,0.0002356013,0.000049885013,0.0008323656,0.00049646007,0.00081941125,0.0012841023,0.0006725214,0.00000581683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034948334,0.000028995357,0.0017610785,0.000051134866,0.00000608207,0.0000013953526,0.0012960058,0.007519299,0.00012990226,0.00041625302,9.901893e-7,0.9887854],"study_design_scores_gemma":[0.00023699588,0.00015172176,0.0032451227,0.00024661893,0.000003978446,0.000006446122,0.0000031849393,0.990647,0.00035400467,0.004293426,0.00052933674,0.00028213908],"about_ca_topic_score_codex":0.000017475177,"about_ca_topic_score_gemma":0.000022822698,"teacher_disagreement_score":0.9885032,"about_ca_system_score_codex":0.00019491372,"about_ca_system_score_gemma":0.0003996053,"threshold_uncertainty_score":0.9607542},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20471159,0.0009853785,0.21679585,0.002538758,0.0034995475,0.003991869,0.00023091557,0.000143982,0.56710213],"genre_scores_gemma":[0.99591905,0.00003501888,0.0025509477,0.00038974037,0.0004798013,0.000004155251,0.0000040671875,0.000025546577,0.0005916886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734336,0.00005548,0.00034839794,0.0005364762,0.0011824854,0.00053378154],"domain_scores_gemma":[0.9965514,0.0018945339,0.00043199759,0.00082392374,0.00019346512,0.000104709936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001153178,0.0003506801,0.0004984962,0.00023668469,0.00027688907,0.00022919718,0.0022451438,0.00020658759,0.00004455829],"category_scores_gemma":[0.00016681569,0.0001723427,0.00023760322,0.000362237,0.0024175658,0.00025863526,0.00044370577,0.00060206535,0.000008688562],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012709272,0.00010023633,0.004426472,0.0000717455,0.00015546131,0.000023200839,0.09950081,0.047571275,0.00019632373,0.046326898,0.00024118148,0.8012593],"study_design_scores_gemma":[0.009013538,0.018956434,0.084057786,0.023420615,0.0006124165,0.00021275438,0.0012589395,0.49057743,0.006120641,0.3086828,0.04611521,0.010971426],"about_ca_topic_score_codex":0.0008831793,"about_ca_topic_score_gemma":0.0010135481,"teacher_disagreement_score":0.79120743,"about_ca_system_score_codex":0.00020654357,"about_ca_system_score_gemma":0.0009783409,"threshold_uncertainty_score":0.8907622},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050154933,0.00053249067,0.99330705,0.0021047005,0.0010726192,0.0002535025,0.000010290525,0.00013137303,0.0025378298],"genre_scores_gemma":[0.09855936,0.000064896594,0.895908,0.004274837,0.000859043,0.0000058614005,0.000026402176,0.00002572578,0.00027588126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972258,0.000028558105,0.00034622668,0.001292178,0.000760365,0.0003468546],"domain_scores_gemma":[0.9985808,0.0002853078,0.00017253506,0.0005597054,0.00018420095,0.00021745084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041444294,0.0003649511,0.000382108,0.0004496424,0.00025535075,0.00056171196,0.0013204714,0.0001708548,0.000019051588],"category_scores_gemma":[0.0000689249,0.00036156358,0.00007413721,0.00060543156,0.0005496322,0.000596797,0.0011752634,0.00047696976,0.000038974747],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005449458,0.000021760023,0.00001920338,0.000030410736,0.000012685247,0.000077070494,0.00050330115,0.025112959,0.0001434284,0.14597085,0.00009739379,0.8280055],"study_design_scores_gemma":[0.00020846087,0.00014622015,0.00016492956,0.000067405825,0.0000045658103,0.000062428175,8.892554e-8,0.69116414,0.00048513536,0.30338648,0.0039248765,0.0003853014],"about_ca_topic_score_codex":0.000012346401,"about_ca_topic_score_gemma":0.000022829765,"teacher_disagreement_score":0.8276202,"about_ca_system_score_codex":0.00013761861,"about_ca_system_score_gemma":0.00037425026,"threshold_uncertainty_score":0.99988365},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082230277,0.000503882,0.99585265,0.0007847527,0.0009884109,0.00017198165,0.000004679193,0.00009477684,0.00077656464],"genre_scores_gemma":[0.7857959,0.00013445114,0.20877565,0.0035297524,0.0010040657,0.0000067474325,0.000032249984,0.000051184423,0.0006699536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996564,0.00004649259,0.00044952787,0.001607712,0.0008604781,0.00047180522],"domain_scores_gemma":[0.9980454,0.00044649377,0.00027370465,0.0009355065,0.00011830703,0.00018060365],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00056394364,0.0004850691,0.000584635,0.00061276933,0.00029044898,0.0012951251,0.001807372,0.00029005093,0.0000106385605],"category_scores_gemma":[0.00008959645,0.00041851736,0.00013115026,0.0004147416,0.00042176567,0.0006754294,0.0015786557,0.00055029587,0.000015017595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008836754,0.000017553657,0.0005035721,0.00003340143,0.00004079254,0.000045298806,0.0013553395,0.04407272,0.0004886989,0.014077609,0.00008392247,0.9392722],"study_design_scores_gemma":[0.0002729261,0.00011316952,0.001306636,0.00032359327,0.000024802812,0.000022165734,3.3416978e-7,0.94806504,0.00069040153,0.047142513,0.0013116072,0.0007268037],"about_ca_topic_score_codex":0.0001967808,"about_ca_topic_score_gemma":0.0004999649,"teacher_disagreement_score":0.93854547,"about_ca_system_score_codex":0.00014319627,"about_ca_system_score_gemma":0.00016468819,"threshold_uncertainty_score":0.99982667},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010342932,0.00022587414,0.99665487,0.000040799867,0.0011025829,0.0004848197,0.00002323535,0.000083304156,0.00035024981],"genre_scores_gemma":[0.48300493,0.00003525774,0.5163139,0.00017286961,0.0002337605,0.000007698566,0.000011506073,0.000062872,0.0001572021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985485,0.000007824538,0.00027964552,0.0005480865,0.0003080595,0.0003078669],"domain_scores_gemma":[0.999132,0.00016876332,0.000078245685,0.00043313587,0.00013052793,0.00005737388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040176258,0.00029349703,0.00027857217,0.00035225565,0.00009911409,0.00008946815,0.0004379758,0.0002534716,0.000005564171],"category_scores_gemma":[0.00002437041,0.0002899491,0.000070080896,0.000117984055,0.0002271005,0.0001889341,0.0000576423,0.00033347224,0.000008368134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044575365,0.000002219057,0.000002489306,0.000029490686,0.000008592262,0.000002224069,0.00023645464,0.9501931,0.0024587412,0.0048407335,0.000006671504,0.042174708],"study_design_scores_gemma":[0.00008676023,0.000061488085,0.000002984934,0.00019547516,0.000009911811,0.000021584327,4.0594614e-7,0.9606361,0.0031182899,0.035455674,0.00009180749,0.00031954763],"about_ca_topic_score_codex":0.000004924974,"about_ca_topic_score_gemma":0.000012773443,"teacher_disagreement_score":0.48197064,"about_ca_system_score_codex":0.00031190776,"about_ca_system_score_gemma":0.00024614786,"threshold_uncertainty_score":0.99995524},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028658475,0.00066343934,0.98971707,0.00013907542,0.0069419206,0.0011501507,0.000008472604,0.00023059061,0.00086270453],"genre_scores_gemma":[0.18227763,0.000059786467,0.81527054,0.00020048035,0.0014755243,0.0000487806,0.0000034920995,0.000053827986,0.00060994906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959635,0.000021504702,0.0006027404,0.0017782591,0.0008670228,0.0007669444],"domain_scores_gemma":[0.99624676,0.0010873476,0.00032942585,0.0017367122,0.00044703265,0.00015270842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001233625,0.0005402802,0.0006592114,0.00054857857,0.0003019747,0.0004179553,0.003177881,0.00041541236,0.0000053466765],"category_scores_gemma":[0.00012571877,0.00046276054,0.000233353,0.00041268245,0.0003125281,0.0008300741,0.0010680101,0.00064527243,0.0000689633],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022622822,0.000025730518,0.0007870595,0.00019521097,0.000020578755,0.000007071352,0.001011871,0.057824455,0.00007694361,0.0049667144,0.000014533325,0.9350472],"study_design_scores_gemma":[0.0010237657,0.0009015222,0.0011339361,0.003098237,0.000026521402,0.00006780924,9.940992e-7,0.8420763,0.0044941567,0.13960922,0.005515398,0.0020521304],"about_ca_topic_score_codex":0.000013605828,"about_ca_topic_score_gemma":0.000008191225,"teacher_disagreement_score":0.9329951,"about_ca_system_score_codex":0.00047655124,"about_ca_system_score_gemma":0.00086358667,"threshold_uncertainty_score":0.9997824},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046585794,0.0007777684,0.9918297,0.00017397826,0.0031066784,0.0011278533,0.0000081320695,0.00022325739,0.002286806],"genre_scores_gemma":[0.3961818,0.00007773613,0.599969,0.0012917457,0.00079463265,0.000022006265,0.000018806017,0.00006977667,0.0015744896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949329,0.00005621587,0.00060456456,0.0024178068,0.0010274628,0.0009610376],"domain_scores_gemma":[0.9952579,0.0011885768,0.00040202562,0.0023878026,0.00047246044,0.00029119797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013965026,0.0006972224,0.0008617033,0.0008443473,0.00034335928,0.0008874845,0.005109317,0.00047004697,0.00002119901],"category_scores_gemma":[0.00028419035,0.00055401924,0.00027572605,0.00067800446,0.00049915037,0.00037422107,0.00113725,0.00068156846,0.00010420921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027256498,0.00013092368,0.000083986786,0.00012387322,0.000013525423,0.0000222653,0.0010031342,0.026705613,0.00038541487,0.107135475,0.000046722347,0.8643218],"study_design_scores_gemma":[0.0006456386,0.0006117875,0.00020238615,0.000431692,0.0000130875,0.000024050967,1.5076708e-7,0.93680453,0.0009036065,0.05677376,0.0027262939,0.0008630007],"about_ca_topic_score_codex":0.000009600438,"about_ca_topic_score_gemma":0.000016010466,"teacher_disagreement_score":0.9100989,"about_ca_system_score_codex":0.00031410868,"about_ca_system_score_gemma":0.00078057783,"threshold_uncertainty_score":0.9996911},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001691699,0.0012951748,0.98168135,0.0011306609,0.0030795974,0.00059239677,0.0000040410077,0.00002659972,0.010498468],"genre_scores_gemma":[0.93085736,0.0005833468,0.06458915,0.0024032698,0.00045664015,0.000043210995,0.000003712771,0.00005386301,0.0010094396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962518,0.00007911659,0.00055482215,0.0013645485,0.0010395622,0.0007101048],"domain_scores_gemma":[0.99678636,0.00089780445,0.0004234782,0.0015325408,0.00028257017,0.00007724424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009886943,0.00051714154,0.0006912408,0.0006675306,0.00017392947,0.0002613171,0.005055941,0.00016791702,0.000013620235],"category_scores_gemma":[0.00013552996,0.00037166983,0.00020355212,0.0008759524,0.00067958294,0.0015911419,0.0011714766,0.0010776198,0.00006839418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081266655,0.00019023681,0.0035039012,0.0005354737,0.000094921226,0.00024272471,0.022823041,0.15824047,0.012324075,0.14626469,0.0002365032,0.6554627],"study_design_scores_gemma":[0.0017874879,0.0016327383,0.0345449,0.012654295,0.00005838975,0.00018101605,0.00005811786,0.70876294,0.1222849,0.10764066,0.005859857,0.0045347246],"about_ca_topic_score_codex":0.00010654595,"about_ca_topic_score_gemma":0.00013090238,"teacher_disagreement_score":0.92916566,"about_ca_system_score_codex":0.00021645363,"about_ca_system_score_gemma":0.00048169403,"threshold_uncertainty_score":0.9998735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01320078,0.000563672,0.9807287,0.00039003073,0.0034678276,0.0010225659,0.000019744062,0.0005666385,0.000040076346],"genre_scores_gemma":[0.5518088,0.000026376803,0.44763502,0.00032941377,0.000112057955,0.000059582326,0.0000028213822,0.000020667952,0.00000527784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944852,0.00016146446,0.00087853184,0.002247058,0.0013877556,0.0008400186],"domain_scores_gemma":[0.994663,0.00042708003,0.0007092436,0.0034201618,0.0006120066,0.00016852176],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011273987,0.0006159625,0.0009085086,0.0012779222,0.00014705517,0.00046354908,0.0070707058,0.00042786813,0.00001963615],"category_scores_gemma":[0.0003281009,0.0005978433,0.0002484333,0.0021878574,0.0006361855,0.00087428896,0.008396052,0.0013033333,0.000019158231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021053189,0.00012941349,0.00053509686,0.00051204854,0.000020876798,0.00007816006,0.002751714,0.45832524,0.0032511197,0.00040559814,0.00009258881,0.5338771],"study_design_scores_gemma":[0.00041516445,0.00032116962,0.0011320628,0.0011066305,0.000009947639,0.00007914526,0.0000035921003,0.65892285,0.28871593,0.048152406,0.0001371772,0.0010039282],"about_ca_topic_score_codex":0.00030333412,"about_ca_topic_score_gemma":0.00010100446,"teacher_disagreement_score":0.538608,"about_ca_system_score_codex":0.00046342012,"about_ca_system_score_gemma":0.0009657848,"threshold_uncertainty_score":0.9996473},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043552496,0.0007317178,0.9904613,0.0019258193,0.004245523,0.001850066,0.000025761537,0.00037843172,0.0003378469],"genre_scores_gemma":[0.0502252,0.0000570041,0.9374742,0.0053153713,0.00087231037,0.000034248238,0.000012463038,0.00012587418,0.0058833617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992874,0.000051786097,0.0011711777,0.003149508,0.0012231161,0.0015303988],"domain_scores_gemma":[0.99353004,0.0023007295,0.0005888739,0.0026464658,0.00046261647,0.00047128435],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009040124,0.0011391719,0.0011504067,0.0010318194,0.00036742995,0.0011944841,0.006703809,0.000768973,0.000056250614],"category_scores_gemma":[0.00056871725,0.0010578048,0.00041506186,0.0006886536,0.00088302564,0.0010773941,0.0015796367,0.0012318797,0.000470952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005042503,0.00014531067,0.000081445745,0.00009666544,0.000053510546,0.00016322128,0.0034193231,0.19997348,0.0008471573,0.020636603,0.00046681953,0.77406603],"study_design_scores_gemma":[0.0004900869,0.00036764436,0.000023315717,0.0003684907,0.000018997605,0.00008568524,7.0667136e-7,0.93006504,0.004858417,0.045370247,0.017081806,0.0012695745],"about_ca_topic_score_codex":0.00014201073,"about_ca_topic_score_gemma":0.00061760255,"teacher_disagreement_score":0.77279645,"about_ca_system_score_codex":0.00047143115,"about_ca_system_score_gemma":0.0021105183,"threshold_uncertainty_score":0.99984235},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04117156,0.00024205478,0.95481884,0.0011652064,0.001931976,0.00041983312,0.0000050757667,0.00019564694,0.000049826544],"genre_scores_gemma":[0.6379907,0.000015352445,0.36156332,0.0002826754,0.00011756623,0.000015507434,0.0000011860797,0.000013395774,2.538551e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951816,0.00023915534,0.00066447526,0.0018944924,0.0012080942,0.000812157],"domain_scores_gemma":[0.9960756,0.0010098651,0.00037419467,0.0019346589,0.00038866885,0.00021701818],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00160342,0.00043900762,0.00067743583,0.0011297357,0.00017421467,0.00041424594,0.008032224,0.0002090412,0.0000039471356],"category_scores_gemma":[0.0009170718,0.0004120542,0.00017743446,0.0037638715,0.0011638135,0.00061655336,0.012501799,0.0016161305,0.000008865108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022278988,0.00006756197,0.0015743388,0.0003312936,0.00001730329,0.000089634115,0.008005346,0.28310966,0.005131216,0.00612833,0.0000038603525,0.69551915],"study_design_scores_gemma":[0.00016963958,0.000104654704,0.0007334117,0.00034692595,0.0000024716387,0.000015190877,0.0000044750295,0.63917005,0.03807091,0.32101136,0.000007992994,0.00036288673],"about_ca_topic_score_codex":0.00009816621,"about_ca_topic_score_gemma":0.000050018578,"teacher_disagreement_score":0.6951563,"about_ca_system_score_codex":0.00020676292,"about_ca_system_score_gemma":0.00076660246,"threshold_uncertainty_score":0.9998331},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003277164,0.0009943651,0.9944842,0.00054883934,0.0015758199,0.00047129687,0.000004569954,0.00054051814,0.0010526801],"genre_scores_gemma":[0.058632627,0.000012747464,0.9384796,0.0021857242,0.00023785146,0.0000058265373,0.0000027275173,0.00004876108,0.0003941462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578357,0.00003573237,0.00050570886,0.0017785296,0.0010311268,0.00086536363],"domain_scores_gemma":[0.9972216,0.0003372262,0.00029785433,0.001684934,0.00022211402,0.00023627123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072728837,0.0006079381,0.00057376275,0.0013027926,0.0003234154,0.00091611495,0.0045740926,0.0003936635,0.000015385105],"category_scores_gemma":[0.00019217149,0.00054417364,0.00012259705,0.00075884187,0.00029881333,0.0011713126,0.003232934,0.0010630991,0.00003104212],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024244995,0.000046662,0.00016789555,0.0002932481,0.00004198014,0.0004416954,0.008361244,0.05901283,0.050962083,0.08611581,0.00016520564,0.79436713],"study_design_scores_gemma":[0.0004449549,0.0004423852,0.00004792561,0.00800478,0.000035329198,0.00035338989,0.0000022005127,0.5193858,0.09708973,0.36124045,0.008951716,0.004001323],"about_ca_topic_score_codex":0.000065165725,"about_ca_topic_score_gemma":0.000047172383,"teacher_disagreement_score":0.79036576,"about_ca_system_score_codex":0.0006028222,"about_ca_system_score_gemma":0.0006772801,"threshold_uncertainty_score":0.99970096},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090684637,0.00054740906,0.9913767,0.00016154032,0.0052067507,0.00033446716,0.0000067414135,0.00021851288,0.001241023],"genre_scores_gemma":[0.1008451,0.00003697729,0.8953591,0.0019416093,0.001510076,0.0000036702183,0.000011323956,0.00006465536,0.00022746481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571335,0.00005323087,0.00054700783,0.0018387784,0.0011171402,0.0007304715],"domain_scores_gemma":[0.9969947,0.000383079,0.00039244865,0.0018503715,0.00020843491,0.00017098995],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013805676,0.00055408286,0.0005127664,0.0010566168,0.00049046223,0.0014362813,0.003147319,0.00032992425,0.00001744944],"category_scores_gemma":[0.00012702419,0.00054304325,0.00015907011,0.00085039635,0.00030182107,0.0018382435,0.0015664848,0.0010855594,0.00004134402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070966853,0.000030635452,0.0001393728,0.00012298941,0.000026481832,0.00016346313,0.0012340457,0.42339718,0.011615811,0.018984338,0.000044699264,0.54423386],"study_design_scores_gemma":[0.00019616248,0.00008133761,0.000015536238,0.00056388543,0.0000106382695,0.00013725992,1.4097581e-7,0.9667419,0.0030628317,0.027913675,0.0005564559,0.00072017236],"about_ca_topic_score_codex":0.000117330004,"about_ca_topic_score_gemma":0.00010031481,"teacher_disagreement_score":0.5435137,"about_ca_system_score_codex":0.00034324214,"about_ca_system_score_gemma":0.0006752659,"threshold_uncertainty_score":0.9997021},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000028880079,0.00032297027,0.994628,0.0003629855,0.0014313513,0.0011014045,2.62411e-7,0.00017748508,0.001972655],"genre_scores_gemma":[0.013244778,0.00023151712,0.9802642,0.0007708147,0.00018768478,0.00002644098,0.00001451136,0.00003933979,0.0052207056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677354,0.000036565172,0.000517704,0.0012467947,0.0007531723,0.0006722165],"domain_scores_gemma":[0.9979774,0.0003672366,0.00030009652,0.00072476774,0.00047799776,0.00015251119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010928805,0.0003969082,0.00040408576,0.00085533486,0.0004633087,0.0007138674,0.001690833,0.0002810185,0.00002212334],"category_scores_gemma":[0.00017013245,0.00038455505,0.00014170409,0.0006106384,0.00021294766,0.00063055387,0.00072807015,0.00072664954,0.00006339675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005405378,0.000009938225,0.000025398018,0.00004627793,0.000007480392,0.0000028199274,0.00057206646,0.83436936,0.000048034275,0.009733742,0.0000020721832,0.15517741],"study_design_scores_gemma":[0.00054022856,0.00025739282,0.000013960327,0.00021356213,0.0000041863577,0.00001011202,3.2320557e-7,0.9904272,0.00039138395,0.0051631546,0.002534619,0.00044390335],"about_ca_topic_score_codex":0.000008631451,"about_ca_topic_score_gemma":0.00003541436,"teacher_disagreement_score":0.15605782,"about_ca_system_score_codex":0.00038578358,"about_ca_system_score_gemma":0.00064514694,"threshold_uncertainty_score":0.99986064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096590355,0.00040052278,0.8950365,0.0048041297,0.0021597354,0.0008021925,0.000017083383,0.00018394458,0.000005526431],"genre_scores_gemma":[0.5222143,0.000017696499,0.47652325,0.0009544061,0.00022929772,0.000041286974,0.000006396362,0.000013161305,2.0710078e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99471223,0.00035931074,0.0005816822,0.0024734277,0.00088064896,0.0009927262],"domain_scores_gemma":[0.99455404,0.0033755924,0.00021191279,0.0013690204,0.00029103228,0.00019840676],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028451283,0.0004938882,0.0007993667,0.00066543743,0.00020735837,0.0011296914,0.0049350555,0.0003439632,0.0000035338708],"category_scores_gemma":[0.001367208,0.00047968715,0.00015400963,0.0022999195,0.00030276304,0.00051264104,0.0029916537,0.0011756544,0.000012886596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024569576,0.00007957536,0.016769804,0.00021510263,0.000015930447,0.000091083624,0.0073718475,0.44256932,0.0039228373,0.0003511955,0.000006285194,0.52858245],"study_design_scores_gemma":[0.00043844944,0.000113965325,0.012915142,0.0005166418,0.000004241389,0.0000036347183,0.0000021130106,0.93245727,0.008417363,0.04460426,0.000014995509,0.0005119248],"about_ca_topic_score_codex":0.001002485,"about_ca_topic_score_gemma":0.00072574324,"teacher_disagreement_score":0.5280705,"about_ca_system_score_codex":0.00030464513,"about_ca_system_score_gemma":0.0012456003,"threshold_uncertainty_score":0.99990726},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012684672,0.00047156803,0.99029744,0.0006007101,0.0022798702,0.00061632734,0.00001525979,0.00022429808,0.005367658],"genre_scores_gemma":[0.86859626,0.000027217713,0.12708466,0.0031346576,0.00047505047,0.000012098303,0.000014649662,0.0000717186,0.0005837073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954225,0.0000326131,0.0004998607,0.0019910492,0.0011982655,0.0008557024],"domain_scores_gemma":[0.99614185,0.0011852153,0.0003142302,0.0019330315,0.00020060805,0.00022506548],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005358213,0.00073910743,0.0006323234,0.0014134194,0.0002480542,0.0012386951,0.0039309263,0.00046457897,0.000025076395],"category_scores_gemma":[0.000107873886,0.00061687845,0.0003353835,0.00080660504,0.00080353813,0.00066091615,0.0008905115,0.0013724178,0.00010151881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057591547,0.00022235447,0.00022421677,0.00017119362,0.000052485222,0.00038834306,0.00059838925,0.1659602,0.0009182479,0.071823314,0.00007924851,0.75950444],"study_design_scores_gemma":[0.00071276457,0.0006310441,0.00022128981,0.0005400304,0.000011646129,0.000032021228,8.902639e-8,0.9375213,0.0018196586,0.05561122,0.0018486499,0.0010503103],"about_ca_topic_score_codex":0.000011570902,"about_ca_topic_score_gemma":0.0000112843545,"teacher_disagreement_score":0.8684694,"about_ca_system_score_codex":0.0001774406,"about_ca_system_score_gemma":0.00063469,"threshold_uncertainty_score":0.9997981},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000602199,0.002263791,0.9878404,0.001237819,0.0041055433,0.00057497615,0.000013367294,0.00015360328,0.0032083036],"genre_scores_gemma":[0.20509282,0.00047043685,0.7819714,0.0055115735,0.0033909224,0.000030275713,0.00009308332,0.00011528378,0.0033241946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99527943,0.00005929516,0.00064611656,0.0020660073,0.0012131601,0.0007359957],"domain_scores_gemma":[0.997222,0.0006037637,0.00032544564,0.0012501639,0.00033433782,0.00026428423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087204046,0.00068829645,0.00065103394,0.0013929652,0.0005031636,0.0009804652,0.0022210067,0.0003668399,0.000038416434],"category_scores_gemma":[0.00006074442,0.00062668667,0.00017774059,0.0010734752,0.00048019926,0.001149559,0.0013952192,0.0007701853,0.00008160103],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002015604,0.000092933,0.00023744088,0.0001868763,0.000073277486,0.00019895477,0.0013868569,0.058766894,0.0008309303,0.17823179,0.00038606857,0.7595878],"study_design_scores_gemma":[0.0010506148,0.00050062547,0.0010504003,0.0006732856,0.000035643156,0.00040905076,4.267756e-7,0.61979896,0.004563657,0.3443499,0.025500609,0.0020668374],"about_ca_topic_score_codex":0.000015328776,"about_ca_topic_score_gemma":0.000051750525,"teacher_disagreement_score":0.757521,"about_ca_system_score_codex":0.00018494033,"about_ca_system_score_gemma":0.00068790064,"threshold_uncertainty_score":0.9996185},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019089406,0.00095005607,0.9914519,0.0017790365,0.0026732348,0.0014939699,0.00004124826,0.00018637019,0.0014050726],"genre_scores_gemma":[0.021859376,0.0003301218,0.972511,0.0023715694,0.0013605142,0.000101272,0.00008484463,0.00009004111,0.0012912671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953604,0.00004726358,0.00064294593,0.0019348098,0.0011924846,0.0008220968],"domain_scores_gemma":[0.9947847,0.0014159564,0.0004988789,0.0027838747,0.00036241207,0.0001541686],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015356762,0.0006264951,0.0005941737,0.00040330758,0.0006999396,0.001281303,0.005540704,0.00036749092,0.000019185078],"category_scores_gemma":[0.0000657895,0.00044171204,0.00020170747,0.00050212286,0.0007554355,0.001197042,0.0018562628,0.0009003403,0.000056714995],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014074795,0.000039095765,0.000030086589,0.000086790125,0.000017781733,0.00003853934,0.0003278428,0.0125735635,0.000113993716,0.0645124,0.0001745491,0.9220713],"study_design_scores_gemma":[0.0003679293,0.00030617422,0.00017026487,0.00058202544,0.000015453954,0.00011376688,2.3357745e-7,0.7668657,0.000674535,0.21812956,0.0120789185,0.00069547474],"about_ca_topic_score_codex":0.000079205915,"about_ca_topic_score_gemma":0.00013357571,"teacher_disagreement_score":0.9213758,"about_ca_system_score_codex":0.0003545298,"about_ca_system_score_gemma":0.0007917273,"threshold_uncertainty_score":0.9998398},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022481035,0.00007373034,0.97304696,0.001381747,0.00048864837,0.0003825791,0.000026312484,0.00003390026,0.0020850908],"genre_scores_gemma":[0.97503895,0.000010193587,0.024132632,0.0003996839,0.00012925174,0.0000045750066,0.000008945131,0.000012875225,0.000262902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978569,0.000048933536,0.00042418414,0.0007296806,0.0006491302,0.00029112792],"domain_scores_gemma":[0.99580276,0.0027191138,0.00023159689,0.0010333556,0.0001409321,0.00007227132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081193727,0.00025935814,0.0002887115,0.0004101612,0.00035220516,0.00017515315,0.0011164043,0.00014720715,0.000036441812],"category_scores_gemma":[0.0001531093,0.000191405,0.0000960472,0.00059037405,0.000564654,0.00023570374,0.0005203129,0.0005943197,0.000032233835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056681083,0.000028306018,0.045082897,0.000043203938,0.00001865834,0.0000024886185,0.0013043962,0.0018401177,0.00001009965,0.874438,0.00011360395,0.077112585],"study_design_scores_gemma":[0.0004051447,0.00027314946,0.0678842,0.00041831052,0.000024369929,0.00002340868,0.0000019617921,0.0292502,0.000168493,0.89945155,0.0015310252,0.000568172],"about_ca_topic_score_codex":0.000031540818,"about_ca_topic_score_gemma":0.00006849305,"teacher_disagreement_score":0.9525579,"about_ca_system_score_codex":0.000053657386,"about_ca_system_score_gemma":0.00021980646,"threshold_uncertainty_score":0.78052694},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001960796,0.00018934828,0.99417007,0.0009136218,0.002553353,0.0003224287,0.00001520741,0.0009031801,0.00093084737],"genre_scores_gemma":[0.008549736,0.000025302803,0.98966736,0.0011686053,0.00042385628,0.000009171082,0.000011382468,0.0000446767,0.00009992273],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955866,0.00008429181,0.0005340961,0.0022306072,0.0008843187,0.00068011077],"domain_scores_gemma":[0.9943139,0.002653627,0.00021908773,0.002395183,0.00018332715,0.0002348947],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014861651,0.0006330195,0.00071199186,0.00048049545,0.00017256102,0.0003584216,0.0057753967,0.00036045618,0.000014074571],"category_scores_gemma":[0.0015346948,0.0006037205,0.00013190952,0.0007569484,0.0006798402,0.00085185515,0.0035192214,0.0013140829,0.00007760554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045970346,0.000015701848,0.000025089921,0.00009908131,0.000014589491,0.00022692668,0.00043509825,0.29263514,0.00010216688,0.058341492,0.000036186375,0.64806396],"study_design_scores_gemma":[0.00015506375,0.0001314668,0.000046098037,0.00018783718,0.0000064952596,0.00006518922,6.198777e-8,0.24581286,0.00067118293,0.74942905,0.0026353586,0.0008593361],"about_ca_topic_score_codex":0.000004134652,"about_ca_topic_score_gemma":0.0000051937363,"teacher_disagreement_score":0.69108754,"about_ca_system_score_codex":0.00034202088,"about_ca_system_score_gemma":0.0005091547,"threshold_uncertainty_score":0.9996414},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00496525,0.00030304922,0.98976827,0.00014164693,0.000999108,0.00048165428,0.000014361242,0.00009307773,0.003233599],"genre_scores_gemma":[0.21854332,0.0000036503147,0.77886134,0.0003884214,0.00028916082,0.0000037820773,0.000008180299,0.00008432807,0.0018178192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993906,0.00028527607,0.000982876,0.001890339,0.0022393186,0.0006961662],"domain_scores_gemma":[0.9899721,0.0074836444,0.0008207337,0.0009450704,0.00057544746,0.00020299303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006650766,0.0006402096,0.0009398791,0.0017242983,0.0006474049,0.0010253288,0.0016345991,0.0003887731,0.0001479667],"category_scores_gemma":[0.0024201495,0.0005414285,0.00016514058,0.00090624945,0.0009030801,0.00084855204,0.0011414295,0.0011892203,0.000020990958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004044524,0.0000058483743,0.0019212279,0.000017000008,0.000006156922,0.000020598365,0.00021874443,0.66226494,0.00012528355,0.00013205333,0.0000030727804,0.33524466],"study_design_scores_gemma":[0.0002500752,0.00016349932,0.000116468014,0.0004388329,0.0000128344345,0.00015421551,4.093343e-7,0.88009524,0.00017755634,0.11789689,0.000174718,0.0005192471],"about_ca_topic_score_codex":0.000047321395,"about_ca_topic_score_gemma":0.000048439306,"teacher_disagreement_score":0.3347254,"about_ca_system_score_codex":0.00029901118,"about_ca_system_score_gemma":0.0007426379,"threshold_uncertainty_score":0.9997037},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002098757,0.0012298981,0.9953931,0.0011346408,0.0009229011,0.00026676568,0.000020559826,0.00011702268,0.000894155],"genre_scores_gemma":[0.007331288,0.0001048332,0.98828316,0.002075256,0.0014520955,0.000010625296,0.000059895858,0.000029332641,0.0006534909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967466,0.000031779822,0.0002917384,0.001747326,0.00070491165,0.00047765602],"domain_scores_gemma":[0.9964519,0.0002631742,0.00015564961,0.0027650697,0.00014364829,0.00022053819],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00068024447,0.0003340272,0.0003387678,0.00027175507,0.00020557735,0.0007700576,0.006567255,0.00018765329,0.0000032841983],"category_scores_gemma":[0.00005093155,0.00027708928,0.000026197258,0.0007928909,0.0005798343,0.00073432067,0.005253292,0.0005962565,0.00001005373],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.380545e-7,0.000008920763,0.000013014927,0.000011680484,0.0000036301203,0.000020781574,0.0001302179,0.0041823965,0.0000102597005,0.0052150288,0.003714503,0.9866889],"study_design_scores_gemma":[0.000105230785,0.000038973012,0.0000852739,0.000050139948,0.0000038944936,0.000073278345,3.603271e-8,0.69957846,0.00003363386,0.28489473,0.014825765,0.0003106081],"about_ca_topic_score_codex":0.000018762186,"about_ca_topic_score_gemma":0.000042997646,"teacher_disagreement_score":0.9863783,"about_ca_system_score_codex":0.00012189159,"about_ca_system_score_gemma":0.00088126963,"threshold_uncertainty_score":0.9999681},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34616256,0.000727997,0.65119576,0.00025295193,0.0012896947,0.00018335073,0.000008421485,0.000048478978,0.00013078345],"genre_scores_gemma":[0.9363022,0.000020222002,0.062963255,0.0004268256,0.00023679614,0.000015591071,0.00001016512,0.000021169404,0.0000038137364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975111,0.000046305868,0.00055928074,0.001266873,0.000111061825,0.00050536485],"domain_scores_gemma":[0.9982887,0.00021306737,0.0004156309,0.0009073106,0.000085646265,0.00008963794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015727297,0.00029554858,0.0006243226,0.00069204,0.0001488361,0.0006012858,0.0010342894,0.00020610307,0.000029181163],"category_scores_gemma":[0.00018526107,0.000287498,0.00009916819,0.0014358893,0.0003061715,0.00018997828,0.0007261258,0.0007615071,0.00002182135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026504014,0.00017570678,0.207337,0.0004172902,0.000065274326,0.00012227491,0.008998112,0.74096096,0.00014467472,0.009542271,0.000007370576,0.032202568],"study_design_scores_gemma":[0.0011744652,0.00037665997,0.08786918,0.002891855,0.000017600887,0.00017001895,0.000017680406,0.65774035,0.0056702024,0.24151261,0.00020772846,0.0023516316],"about_ca_topic_score_codex":0.00028698155,"about_ca_topic_score_gemma":0.00011124262,"teacher_disagreement_score":0.5901396,"about_ca_system_score_codex":0.00015214976,"about_ca_system_score_gemma":0.00014580443,"threshold_uncertainty_score":0.99995774},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024114552,0.0005153385,0.9939677,0.0031445113,0.0011966081,0.00039654432,0.000012047364,0.00021480636,0.00052829034],"genre_scores_gemma":[0.12894557,0.000009395952,0.867263,0.0029345478,0.00070910313,0.000021017888,0.000011106574,0.00003981905,0.000066411936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995752,0.000035037046,0.00073513214,0.0018984805,0.0008422454,0.0007371149],"domain_scores_gemma":[0.99705493,0.00078035105,0.0005652284,0.0010956578,0.00025722742,0.0002465726],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00072598323,0.00061721605,0.00081309397,0.00058196695,0.00043038328,0.0010570817,0.003720719,0.00037311655,0.000030317222],"category_scores_gemma":[0.00026545802,0.0005381841,0.00041562767,0.0010119954,0.0005957864,0.0005535599,0.0010351832,0.0008216384,0.000021487458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019630175,0.00002587051,0.00017213251,0.00017553598,0.000046979523,0.00009689828,0.0007493257,0.07367887,0.00011199712,0.07561343,0.000055485812,0.84925383],"study_design_scores_gemma":[0.00013260156,0.0002555013,0.000013705254,0.0005339782,0.000016271779,0.000012622941,4.6306226e-7,0.8107162,0.00043836303,0.18434408,0.0029675092,0.00056870136],"about_ca_topic_score_codex":0.000023669078,"about_ca_topic_score_gemma":0.000050721024,"teacher_disagreement_score":0.84868515,"about_ca_system_score_codex":0.0002590407,"about_ca_system_score_gemma":0.0007298833,"threshold_uncertainty_score":0.9999799},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06502723,0.0003655115,0.93054646,0.0018797417,0.0012585814,0.00058642036,0.0000046523733,0.00030911094,0.000022272743],"genre_scores_gemma":[0.60072684,0.000003734093,0.39799935,0.0010424305,0.00018070957,0.000019365874,0.000010588026,0.000016752661,2.272137e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559695,0.00024480405,0.0005692252,0.0020058784,0.0008643883,0.00071876706],"domain_scores_gemma":[0.99754506,0.0003122727,0.0002949859,0.0015203817,0.00015848578,0.00016879899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008424454,0.00046975387,0.0004964664,0.00091893063,0.00023964109,0.0008027732,0.0042071263,0.00025489178,0.0000051196866],"category_scores_gemma":[0.000410668,0.00046749527,0.00009410977,0.00396651,0.0003152638,0.00047850612,0.004125145,0.0018721927,0.000017307892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027560648,0.000035261924,0.0047287717,0.000049833572,0.0000032828705,0.000027518376,0.0035433124,0.838903,0.0010286749,0.00015585912,0.000001744966,0.15151998],"study_design_scores_gemma":[0.00023007864,0.000025445888,0.010219611,0.0002505053,0.0000042291167,0.000020860949,0.0000013581854,0.98351914,0.0012885608,0.0039501563,0.00000925461,0.0004808293],"about_ca_topic_score_codex":0.0041901595,"about_ca_topic_score_gemma":0.00075144327,"teacher_disagreement_score":0.5356996,"about_ca_system_score_codex":0.0006901138,"about_ca_system_score_gemma":0.0009248708,"threshold_uncertainty_score":0.9997777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069836614,0.00008128264,0.9838574,0.01167801,0.002287815,0.00093815086,0.00001278112,0.0002726438,0.00017353594],"genre_scores_gemma":[0.45938233,0.000009026539,0.53820884,0.0020270522,0.00025319614,0.000086270105,0.000016149852,0.00001447896,0.0000026887326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955776,0.00019363037,0.00057693024,0.0019415432,0.0010099914,0.00070036046],"domain_scores_gemma":[0.9969851,0.00082420395,0.00054518064,0.001021523,0.0003966722,0.00022731906],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015875264,0.00042596422,0.00048469118,0.00039792838,0.00035885014,0.0013894157,0.0034608287,0.00025594476,0.000007016397],"category_scores_gemma":[0.00079378276,0.00042221262,0.00018508297,0.0013643238,0.00031278285,0.0005875557,0.0022546365,0.00087999157,0.00003304565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002949051,0.00021221017,0.00066694396,0.0001944886,0.00005436196,0.00003099885,0.018567786,0.114139825,0.012823618,0.016830444,0.0003338849,0.83611596],"study_design_scores_gemma":[0.00036328752,0.000103163446,0.0034617493,0.000096778866,0.000007036404,0.000003134744,0.0000052888345,0.9253483,0.003962275,0.06572913,0.00046439425,0.00045550207],"about_ca_topic_score_codex":0.000021138236,"about_ca_topic_score_gemma":0.000014745855,"teacher_disagreement_score":0.83566046,"about_ca_system_score_codex":0.0006676311,"about_ca_system_score_gemma":0.0008141732,"threshold_uncertainty_score":0.999823},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003177833,0.00040272743,0.9831297,0.0003157793,0.013628596,0.0005932537,6.3784734e-7,0.00015467095,0.001456842],"genre_scores_gemma":[0.052150402,0.000010310236,0.94407594,0.0016849617,0.0016928861,0.0000058051087,0.0000040720574,0.00004754173,0.00032809147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607605,0.000024759527,0.00077413465,0.0015337627,0.00081319903,0.00077810406],"domain_scores_gemma":[0.99593705,0.001412805,0.000673017,0.0014787152,0.00037453652,0.00012390081],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011917207,0.0005529024,0.0007858502,0.0007416146,0.00015228901,0.0005040714,0.005673398,0.00046750874,0.000004593142],"category_scores_gemma":[0.00013384534,0.00050944585,0.00024124363,0.000507993,0.00028907147,0.0008456026,0.002892699,0.0008741559,0.000031914635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021935553,0.000046831447,0.0002029719,0.0010546916,0.00004280894,0.000019387919,0.014802059,0.00267356,0.00040007223,0.13718612,0.00007013745,0.8434794],"study_design_scores_gemma":[0.0002002143,0.00023273956,0.000043437587,0.002947459,0.0000103634,0.000021967524,2.847503e-7,0.59995115,0.004748806,0.38909683,0.0021520106,0.0005947345],"about_ca_topic_score_codex":0.000033147542,"about_ca_topic_score_gemma":0.0000055062087,"teacher_disagreement_score":0.84288466,"about_ca_system_score_codex":0.00018283281,"about_ca_system_score_gemma":0.00050434045,"threshold_uncertainty_score":0.9997357},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027438404,0.00013436652,0.9914684,0.005343865,0.001056305,0.00028232593,0.000043828237,0.00028918678,0.001354269],"genre_scores_gemma":[0.11210496,0.000010350143,0.8838986,0.0034170034,0.000393752,0.000018821169,0.00002819584,0.000024617919,0.000103669074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620956,0.000031560012,0.0005198909,0.0018984522,0.000844374,0.00049617596],"domain_scores_gemma":[0.9971694,0.00038943996,0.00026888057,0.0017467875,0.00018243537,0.00024306269],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006556557,0.0004714924,0.00051308144,0.00036525872,0.00026045513,0.0007271526,0.005240754,0.00021612355,0.000040357023],"category_scores_gemma":[0.000100059624,0.00042391717,0.00013179131,0.00074102054,0.0008358332,0.0005550841,0.0014455366,0.00076615444,0.00013482422],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025389893,0.00002761566,0.000020537942,0.00003258213,0.0000070715328,0.000055233755,0.00018825759,0.0037556288,0.00006334602,0.04613771,0.00013004815,0.9495794],"study_design_scores_gemma":[0.00015957044,0.00013803638,0.00009462822,0.00022256112,0.000006945219,0.000014919505,9.536024e-8,0.848032,0.0015237662,0.14379321,0.005471978,0.0005422811],"about_ca_topic_score_codex":0.00006964479,"about_ca_topic_score_gemma":0.000048587757,"teacher_disagreement_score":0.94903713,"about_ca_system_score_codex":0.00016948,"about_ca_system_score_gemma":0.0007716557,"threshold_uncertainty_score":0.99982125},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026086618,0.00014869405,0.99416363,0.00017369844,0.00068163424,0.00058967515,0.000006945933,0.0001437518,0.0014833239],"genre_scores_gemma":[0.82596827,0.00013231115,0.17325996,0.00038482438,0.000079298945,0.0000125312135,0.0000042695333,0.00002744223,0.00013107277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970699,0.000038338872,0.00063805195,0.001080214,0.00072993065,0.00044358158],"domain_scores_gemma":[0.998065,0.00029356236,0.00036687384,0.0008690855,0.00029989224,0.000105603525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009784162,0.00041295248,0.00062851637,0.0012747046,0.0000774176,0.00025312568,0.0016165626,0.0003623645,0.000008506377],"category_scores_gemma":[0.000115917384,0.00039414078,0.00008363959,0.0006799952,0.00048052048,0.0004920926,0.0011407115,0.0007041074,0.000013597801],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000151084805,0.00003728067,0.00017321222,0.00015184113,0.000008449318,0.000054333203,0.00042343684,0.0004444678,0.0007825054,0.0051807654,0.0000052410064,0.99272335],"study_design_scores_gemma":[0.0011622868,0.0011742343,0.0049881805,0.0015353273,0.000020081383,0.00017706754,6.134464e-7,0.5734873,0.08276393,0.33296856,0.00038931693,0.0013331398],"about_ca_topic_score_codex":0.00006852469,"about_ca_topic_score_gemma":0.00012788028,"teacher_disagreement_score":0.9913902,"about_ca_system_score_codex":0.00019373606,"about_ca_system_score_gemma":0.0003878094,"threshold_uncertainty_score":0.99985105},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23259963,0.0005872287,0.7163992,0.0016869952,0.0007816582,0.0011138825,0.0000134191505,0.00023164376,0.046586357],"genre_scores_gemma":[0.97620755,0.00012175234,0.022700608,0.0003238957,0.0002437503,0.0000024456228,0.0000057470515,0.000039655763,0.00035460762],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792707,0.000020362733,0.00023609023,0.0008396352,0.0005884561,0.00038840948],"domain_scores_gemma":[0.99933493,0.0001884425,0.0000963726,0.00020237987,0.000013687452,0.00016419608],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045058885,0.00027677644,0.00030496722,0.00010712437,0.00040019903,0.00032699163,0.00039084436,0.00014141951,0.00017829821],"category_scores_gemma":[0.00012470386,0.000251923,0.000029735147,0.00023083559,0.0009388025,0.00033953757,0.0017011799,0.0009116858,0.0000030903573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012882695,0.0000059442614,0.5496637,0.00010952752,0.0000092307655,0.000094361545,0.0019098624,0.0065585827,0.00040396865,0.000052888514,0.0000029312314,0.44117606],"study_design_scores_gemma":[0.00018139285,0.00017519813,0.0076743276,0.00011846873,0.000014895584,0.000120019635,0.0000020265563,0.98590606,0.00016949707,0.0030021751,0.002184807,0.00045115678],"about_ca_topic_score_codex":0.0012014406,"about_ca_topic_score_gemma":0.00069477584,"teacher_disagreement_score":0.97934747,"about_ca_system_score_codex":0.00013348633,"about_ca_system_score_gemma":0.00004570213,"threshold_uncertainty_score":0.9999933},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011025441,0.0028555905,0.50262624,0.009473866,0.003922815,0.0010024997,0.000037563084,0.00013647613,0.47884244],"genre_scores_gemma":[0.879287,0.002092497,0.10762099,0.0032390475,0.0046876366,0.000023482646,0.000016738693,0.000047306487,0.0029852819],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804544,0.00017430281,0.00024449374,0.0005050335,0.00070208486,0.00032864444],"domain_scores_gemma":[0.9967355,0.0021767647,0.00022174482,0.0002871094,0.0004943047,0.000084574545],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021562867,0.00016636672,0.0002808905,0.00023405722,0.000709038,0.00015824339,0.0005765032,0.00019515153,0.00003777275],"category_scores_gemma":[0.002563697,0.000164409,0.000047707577,0.00060994795,0.0052051987,0.00043383276,0.0004149198,0.0003324378,0.00000890271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046476503,0.0002273848,0.00041265856,0.00019526556,0.000087341075,0.000032671298,0.5011929,0.00014614822,0.000015575088,0.11111228,0.0040889075,0.38244238],"study_design_scores_gemma":[0.00026342453,0.00019817846,0.00019879808,0.0004455788,0.00006148526,0.000017651279,0.00018297025,0.0010195648,0.00005594032,0.6404026,0.35653773,0.0006160882],"about_ca_topic_score_codex":0.0006892702,"about_ca_topic_score_gemma":0.0076596495,"teacher_disagreement_score":0.8781845,"about_ca_system_score_codex":0.00021190324,"about_ca_system_score_gemma":0.0012658845,"threshold_uncertainty_score":0.9975021},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010778153,0.00017156058,0.99134773,0.000108511784,0.0022099726,0.0005418702,0.0000021262583,0.00030749958,0.0042328867],"genre_scores_gemma":[0.49844253,0.00012584991,0.49504587,0.00082265603,0.0019852913,0.000016102658,0.000018982331,0.00017755594,0.003365142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956834,0.00013031434,0.0006123171,0.0016302405,0.0012115729,0.00073216157],"domain_scores_gemma":[0.99728984,0.0006002299,0.0005054524,0.0010478032,0.00036581172,0.00019087641],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011329071,0.0005981783,0.00068708573,0.0010106636,0.0003463555,0.00074160576,0.0019020125,0.00051855965,0.000032608783],"category_scores_gemma":[0.00010151189,0.0005539012,0.00016001567,0.00075919647,0.00027322545,0.0007795774,0.0007767026,0.0012660264,0.00045826865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000701733,0.000018884957,0.00008501818,0.000104888626,0.000026094094,0.00009899186,0.0014477986,0.1272502,0.0041492074,0.0006941552,0.0000027801118,0.866115],"study_design_scores_gemma":[0.00028439332,0.00021081409,0.00014350055,0.0005561089,0.000015908057,0.00028798674,4.3630604e-7,0.98492205,0.0012643735,0.010455148,0.0010744589,0.0007848311],"about_ca_topic_score_codex":0.000046473135,"about_ca_topic_score_gemma":0.000057591074,"teacher_disagreement_score":0.86533016,"about_ca_system_score_codex":0.00054688007,"about_ca_system_score_gemma":0.0005504593,"threshold_uncertainty_score":0.99969125},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027523385,0.00084851356,0.9922955,0.0013989192,0.0020391287,0.00047050818,0.00003448992,0.00022761436,0.002410062],"genre_scores_gemma":[0.30789274,0.00022095353,0.68373835,0.006989561,0.0010075306,0.000019772031,0.0000610903,0.00006577029,0.0000042617853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994362,0.00006821702,0.00080640404,0.0025090775,0.001278444,0.0009758813],"domain_scores_gemma":[0.9967492,0.00055497617,0.0003367367,0.0018042001,0.00021858688,0.00033627063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009899067,0.0007585678,0.00078632304,0.002202378,0.00026917108,0.00086939574,0.0053494764,0.00044405187,0.000042044416],"category_scores_gemma":[0.00011052252,0.00074617006,0.00033099626,0.0025843207,0.0008343838,0.0012042108,0.0025173598,0.0016424585,0.000043773685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020675216,0.000081026184,0.0006727543,0.000097118595,0.000020147269,0.0005049741,0.0019588617,0.0022886351,0.0002369262,0.54604834,0.00007716833,0.44799334],"study_design_scores_gemma":[0.00050839136,0.00044203125,0.0017881964,0.00068798836,0.000010633204,0.00007057405,6.499267e-7,0.2647743,0.0003404267,0.7250178,0.004931111,0.0014279193],"about_ca_topic_score_codex":0.00008463196,"about_ca_topic_score_gemma":0.0002886524,"teacher_disagreement_score":0.44656542,"about_ca_system_score_codex":0.00014695482,"about_ca_system_score_gemma":0.00050278567,"threshold_uncertainty_score":0.9994989},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020141757,0.0003472644,0.97212416,0.0034913307,0.0009994848,0.00061086606,9.546317e-7,0.00024791417,0.02197663],"genre_scores_gemma":[0.46015286,0.000024301875,0.5230657,0.010030671,0.0011884632,0.000025419422,0.000005710189,0.00013166366,0.0053752074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99523884,0.00006918056,0.00067647704,0.0022527787,0.00095382653,0.0008088698],"domain_scores_gemma":[0.9973644,0.00040203257,0.00032141767,0.0015911512,0.000094472496,0.00022650267],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012808796,0.0006148647,0.0007544441,0.00092685776,0.00030718357,0.001729273,0.010277692,0.0002465005,0.000018079962],"category_scores_gemma":[0.00009998885,0.00057599717,0.00013729026,0.0012025577,0.00040870637,0.00018131257,0.012804793,0.0011802111,0.000104632345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005577359,0.000032807508,0.00013599503,0.000041349587,0.000013465013,0.00025462938,0.001878585,0.23048776,0.000023133787,0.015314928,0.00009764475,0.7517141],"study_design_scores_gemma":[0.00041865945,0.00014146428,0.00014122632,0.00067492947,0.0000058114965,0.00003185759,0.0000010228176,0.9382057,0.000102191225,0.046334524,0.013161355,0.0007812668],"about_ca_topic_score_codex":0.00013890986,"about_ca_topic_score_gemma":0.00008861297,"teacher_disagreement_score":0.7509329,"about_ca_system_score_codex":0.0003244012,"about_ca_system_score_gemma":0.0003849752,"threshold_uncertainty_score":0.99966913},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000065055174,0.00033861722,0.9929659,0.0021940935,0.0006715955,0.0004981135,0.000007577446,0.00028158684,0.0029774578],"genre_scores_gemma":[0.056444675,0.00002794996,0.93946475,0.003406239,0.00038703645,0.00001608478,0.0000070422284,0.00005533818,0.00019088858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99479795,0.00006398843,0.0006051451,0.002188963,0.0015329809,0.0008109887],"domain_scores_gemma":[0.99698085,0.00041783502,0.00030705184,0.0016997489,0.00028338848,0.00031112],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009954972,0.00057005376,0.00060043857,0.000841452,0.00039243887,0.0007097639,0.0047588595,0.00028104495,0.000030829822],"category_scores_gemma":[0.000131499,0.0005595598,0.00019104219,0.0010417727,0.0007268594,0.001014689,0.0023952825,0.0012918866,0.0001568217],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013808325,0.000031300355,0.000028298284,0.00010954004,0.00002391711,0.00021606461,0.0014515802,0.030726464,0.0030097547,0.1710898,0.00003561832,0.79326385],"study_design_scores_gemma":[0.0001357425,0.00010583061,0.000016630565,0.00018154239,0.0000029907314,0.000041260268,9.478151e-8,0.5329179,0.0044148494,0.46132466,0.00044517964,0.00041332346],"about_ca_topic_score_codex":0.00000431787,"about_ca_topic_score_gemma":0.000003340124,"teacher_disagreement_score":0.79285055,"about_ca_system_score_codex":0.0003110171,"about_ca_system_score_gemma":0.0003611947,"threshold_uncertainty_score":0.9996856},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040978024,0.003460162,0.9900112,0.00018674257,0.004029443,0.0007848167,0.0000023306502,0.00030375412,0.0008117461],"genre_scores_gemma":[0.20279731,0.0017374266,0.7827668,0.0056423782,0.004270752,0.00030566996,0.000028113824,0.00021781337,0.0022337164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99465257,0.00008571918,0.0006100098,0.0024296877,0.0009948711,0.0012271395],"domain_scores_gemma":[0.99569505,0.0009037815,0.00035382208,0.0024255286,0.00022861965,0.00039321728],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012663051,0.00074489985,0.000781135,0.0005411343,0.00036499673,0.0011355833,0.005241395,0.00093480846,0.000018614182],"category_scores_gemma":[0.00004185826,0.0006940183,0.00012508985,0.0013648021,0.0013650899,0.00079108577,0.0033439714,0.002738614,0.000025410784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035307469,0.00002823312,0.000025733056,0.000028301338,0.000007259441,0.00008257497,0.00037460652,0.049239114,0.00005422097,0.0012320734,0.00030984325,0.9486145],"study_design_scores_gemma":[0.00026997912,0.0002126782,0.00011205258,0.0002684377,0.000007736345,0.00014206473,9.223657e-8,0.9603847,0.0001230141,0.024749164,0.012906986,0.00082303915],"about_ca_topic_score_codex":0.0000079643,"about_ca_topic_score_gemma":0.00018706624,"teacher_disagreement_score":0.94779146,"about_ca_system_score_codex":0.00029866898,"about_ca_system_score_gemma":0.0010291998,"threshold_uncertainty_score":0.99990135},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023541875,0.0005399878,0.9905806,0.0051557845,0.0010149623,0.0017465051,0.000027736625,0.00021923064,0.0007127955],"genre_scores_gemma":[0.006769638,0.00006627032,0.9892376,0.002745822,0.0005278894,0.0001513216,0.0000073083697,0.0000636352,0.0004305093],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99518645,0.00006575336,0.00054768345,0.0019884296,0.0012517535,0.0009599397],"domain_scores_gemma":[0.99380326,0.003393941,0.00028523,0.0019286588,0.00033884216,0.00025007591],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015979832,0.0005991702,0.00061500625,0.00047126485,0.0005655517,0.00085413805,0.0075746933,0.00026008388,0.0000139781105],"category_scores_gemma":[0.00032358177,0.00042444994,0.00026570327,0.00097485527,0.0013989155,0.00057716743,0.0023262168,0.0011396038,0.00004681693],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033826564,0.000015065436,0.0000032748387,0.00006091263,0.00003265257,0.000047809684,0.0007383597,0.014806293,0.00022983452,0.13674669,0.00009000483,0.84719527],"study_design_scores_gemma":[0.00025672073,0.00022733262,0.0000039982206,0.0001060672,0.000006368148,0.000030714786,1.8308968e-7,0.4928971,0.00062706467,0.49797398,0.0074841734,0.0003862823],"about_ca_topic_score_codex":0.0000064376864,"about_ca_topic_score_gemma":0.000013256514,"teacher_disagreement_score":0.84680897,"about_ca_system_score_codex":0.00018662051,"about_ca_system_score_gemma":0.00057950045,"threshold_uncertainty_score":0.9998207},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029057055,0.00036065714,0.9788079,0.00019009673,0.0009516485,0.0004923111,0.0000011266853,0.000071170536,0.018834483],"genre_scores_gemma":[0.34530982,0.000014562654,0.6498813,0.00051886844,0.00039344415,0.00004105298,0.000007124422,0.00008473928,0.0037490723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99389696,0.00027856856,0.0007730071,0.0018003512,0.0026258915,0.00062521215],"domain_scores_gemma":[0.9929516,0.0051595196,0.00053679425,0.0008739385,0.00026435917,0.0002138336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008515133,0.0005164825,0.00066019624,0.0016144182,0.00074731343,0.00061799947,0.0016388941,0.00015023013,0.0008961331],"category_scores_gemma":[0.0010931427,0.00039659897,0.00011355784,0.0011156696,0.00077486486,0.0002862668,0.0011763814,0.001164095,0.000014925408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026259428,0.000010319643,0.0002569262,0.000012827603,0.000009149899,0.000044300592,0.0009591274,0.26518163,0.000022601082,0.00042659196,0.000011380918,0.7330389],"study_design_scores_gemma":[0.000433076,0.00045637772,0.00017545733,0.00019183179,0.000017615845,0.00008483321,0.0000024336514,0.9750156,0.00019097597,0.014210878,0.0087093795,0.0005115408],"about_ca_topic_score_codex":0.000016474763,"about_ca_topic_score_gemma":0.000040928022,"teacher_disagreement_score":0.7325274,"about_ca_system_score_codex":0.00051985105,"about_ca_system_score_gemma":0.0005950989,"threshold_uncertainty_score":0.9998486},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005773643,0.000112704794,0.9931581,0.0016762251,0.0004364856,0.00036005423,0.000015742591,0.00022819557,0.003435148],"genre_scores_gemma":[0.36482695,0.000012054808,0.63253856,0.002237491,0.00019523886,0.000010228317,0.000026795453,0.000026263642,0.0001264244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954359,0.00009197891,0.00084352994,0.0014755348,0.001694102,0.00045895972],"domain_scores_gemma":[0.99722505,0.00044760146,0.0005597095,0.0012357351,0.00031225153,0.00021964354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012230319,0.00049577805,0.0009267397,0.001898101,0.00015048802,0.0003200882,0.0025622793,0.00029098633,0.000099201396],"category_scores_gemma":[0.00005614702,0.00046842036,0.00043066035,0.0020511646,0.00063728745,0.00046653545,0.0011529868,0.00078966276,0.000020470183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045288765,0.00015896189,0.00040703578,0.000060716713,0.0006258829,0.00013901741,0.0032664922,0.3255427,0.0033713917,0.5754989,0.00013793466,0.09074569],"study_design_scores_gemma":[0.00026344074,0.00027606543,0.0024565968,0.000101448226,0.00010915628,0.000019184941,2.9855582e-7,0.7936717,0.004679009,0.1957627,0.0019223066,0.0007380622],"about_ca_topic_score_codex":0.000016320237,"about_ca_topic_score_gemma":0.000058024856,"teacher_disagreement_score":0.46812904,"about_ca_system_score_codex":0.00024437768,"about_ca_system_score_gemma":0.0005949716,"threshold_uncertainty_score":0.9997767},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15972859,0.0002483144,0.83258075,0.0031929235,0.0016985807,0.0011651317,0.000019928217,0.00024119901,0.001124609],"genre_scores_gemma":[0.9541849,0.0000077801415,0.04282395,0.0016010168,0.0011992198,0.000003980786,0.00008569931,0.0000026571815,0.00009081743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838465,0.000018660292,0.00024719295,0.00064016425,0.00046048334,0.0002488591],"domain_scores_gemma":[0.9994115,0.000153532,0.00016274469,0.00007832676,0.000097851036,0.0000960216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018128152,0.0002607937,0.00026578206,0.00003937767,0.00025091632,0.00019895608,0.00041175747,0.00018342557,0.000055085653],"category_scores_gemma":[0.00003448449,0.00010574361,0.00008348903,0.00035479892,0.0001586055,0.00021421295,0.00020372134,0.00028545273,0.000040143488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009126306,0.00001907174,0.00036403604,0.000021825676,0.000008899256,0.000032886215,0.00019170337,0.01036965,0.16027255,0.0003371455,0.000033599204,0.8283395],"study_design_scores_gemma":[0.00035813806,0.00058161403,0.018268358,0.00075269636,0.000098294746,0.00014447808,0.0000035762528,0.86116767,0.0411691,0.07438,0.0012689588,0.0018070871],"about_ca_topic_score_codex":0.00012307028,"about_ca_topic_score_gemma":0.00038757315,"teacher_disagreement_score":0.8507981,"about_ca_system_score_codex":0.00011266179,"about_ca_system_score_gemma":0.0000345786,"threshold_uncertainty_score":0.43120992},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001986,0.00066050375,0.9913954,0.0052141766,0.0011841852,0.0003783788,0.00005569444,0.00026610942,0.00064691185],"genre_scores_gemma":[0.33323517,0.000110468834,0.6502781,0.015138898,0.0010683357,0.000031131112,0.00004092375,0.00006254132,0.000034423396],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950961,0.000033330783,0.0005491525,0.002285022,0.0013301414,0.0007062628],"domain_scores_gemma":[0.9970283,0.00021084164,0.00026791447,0.001886022,0.00024605682,0.0003608964],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042985324,0.0006930517,0.00058645,0.00080249924,0.00025695446,0.0011079953,0.004581252,0.0004726791,0.00010233714],"category_scores_gemma":[0.000044982626,0.0006468607,0.00027543062,0.0012123283,0.00079873746,0.0014979208,0.0023152295,0.0011799957,0.00013076702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007734146,0.000115924864,0.0010880246,0.0002878738,0.000061673265,0.00087484077,0.0077712373,0.0014405448,0.0001816371,0.15218955,0.0012397539,0.8346716],"study_design_scores_gemma":[0.00086003926,0.00052774575,0.002244168,0.0009843931,0.00004540785,0.00019426046,8.5301366e-7,0.23440424,0.002647396,0.71092033,0.044159357,0.003011824],"about_ca_topic_score_codex":0.000026949054,"about_ca_topic_score_gemma":0.00012730157,"teacher_disagreement_score":0.8316598,"about_ca_system_score_codex":0.0001428746,"about_ca_system_score_gemma":0.00039920933,"threshold_uncertainty_score":0.99992895},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031333166,0.0001577462,0.99305815,0.0028257174,0.0009080349,0.00044527117,0.000008396852,0.00018981534,0.0020935219],"genre_scores_gemma":[0.46449563,0.00002869666,0.5282685,0.0056084082,0.0008264248,0.000020591717,0.00009727704,0.000057481746,0.000596963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961544,0.000041032596,0.0004774613,0.0015704818,0.0012916616,0.0004649422],"domain_scores_gemma":[0.99798673,0.00029147541,0.0003127873,0.0008263155,0.00035036303,0.00023229551],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049038173,0.0005201372,0.00046184324,0.0009769564,0.00024235266,0.0005474749,0.0017195228,0.00021700426,0.000024979501],"category_scores_gemma":[0.00006562485,0.00043981173,0.00009692508,0.0012138253,0.000293107,0.0007383395,0.0005878327,0.0005900425,0.00007877016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005574874,0.00006829941,0.000067723035,0.00007784133,0.00005269308,0.0003159726,0.00090602774,0.32135355,0.00033693586,0.21262455,0.00026017445,0.46388048],"study_design_scores_gemma":[0.00075888226,0.000580292,0.00045242166,0.00029134605,0.000022155551,0.00016615335,3.1922798e-7,0.7330269,0.0016731198,0.25805476,0.0039174426,0.0010561969],"about_ca_topic_score_codex":0.00001150944,"about_ca_topic_score_gemma":0.00008525282,"teacher_disagreement_score":0.46478963,"about_ca_system_score_codex":0.00015750423,"about_ca_system_score_gemma":0.00050646043,"threshold_uncertainty_score":0.9998054},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017981239,0.00031954361,0.9759774,0.0018328449,0.00249665,0.00043341998,0.000005590948,0.00089881354,0.000054463813],"genre_scores_gemma":[0.6155624,0.000011519603,0.3835244,0.00056914095,0.0002670257,0.000016368727,0.000014246176,0.000033645436,0.000001314467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99159545,0.00079998415,0.0010059935,0.0036231633,0.0016644502,0.0013109668],"domain_scores_gemma":[0.9949665,0.0012996786,0.00079347397,0.0021118717,0.0004346021,0.00039388423],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.002534533,0.0009602856,0.0012944854,0.0020826904,0.00073283754,0.0019811122,0.008629468,0.0005555971,0.000032855296],"category_scores_gemma":[0.0033919495,0.00094784435,0.00045932076,0.011760102,0.00039762998,0.00082932506,0.011917197,0.006226146,0.000024422106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008882225,0.000024495172,0.017267264,0.00006435129,0.00009811972,0.00009433024,0.0039618732,0.84135324,0.00020238289,0.00010559724,7.6901796e-7,0.1368187],"study_design_scores_gemma":[0.00023212633,0.00011134684,0.0037046415,0.0002713397,0.00008791674,0.000018969746,0.0000024564993,0.98593074,0.0011130135,0.0075567663,0.00002293615,0.00094775984],"about_ca_topic_score_codex":0.0005011303,"about_ca_topic_score_gemma":0.0005686799,"teacher_disagreement_score":0.5975811,"about_ca_system_score_codex":0.0006603023,"about_ca_system_score_gemma":0.0007275797,"threshold_uncertainty_score":0.9992972},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087143655,0.00032006946,0.9940054,0.0007100196,0.0014074616,0.0010372378,0.00002951672,0.0010158379,0.00060305104],"genre_scores_gemma":[0.2954292,0.0000095629675,0.70355505,0.00044521826,0.0003648235,0.00003246267,0.0000054675147,0.000051683382,0.00010652738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937756,0.000048646263,0.0007721748,0.003166146,0.0013172255,0.0009202035],"domain_scores_gemma":[0.99557143,0.0004373504,0.00040262475,0.0030903367,0.00022988945,0.00026838732],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00058371923,0.0009078509,0.00086276967,0.000974897,0.00036586192,0.00076379615,0.0068955054,0.00035990597,0.000015010382],"category_scores_gemma":[0.00022588689,0.00085936155,0.00014299076,0.0011113385,0.0010538157,0.0014327948,0.006172935,0.0016162527,0.0000751158],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008851709,0.00014438994,0.00009665542,0.00003291523,0.000037659083,0.037165675,0.0021816306,0.0075155688,0.00006213494,0.007376457,0.0000626652,0.9453154],"study_design_scores_gemma":[0.0018560486,0.0038695028,0.00012177751,0.00040870032,0.00007477043,0.0166381,0.00004938879,0.8038832,0.0017068643,0.16318817,0.0039706356,0.0042328546],"about_ca_topic_score_codex":0.000050360693,"about_ca_topic_score_gemma":0.00012214966,"teacher_disagreement_score":0.94108254,"about_ca_system_score_codex":0.00046159836,"about_ca_system_score_gemma":0.0006235447,"threshold_uncertainty_score":0.9993857},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036960235,0.00011291035,0.99289566,0.0021007569,0.0004123544,0.0005377645,0.000007665535,0.00016824523,0.00006861635],"genre_scores_gemma":[0.6125999,0.000025715084,0.38690507,0.00032365392,0.00005691784,0.00007635384,0.00000545138,0.000006016673,8.921083e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735355,0.000055758705,0.0005282643,0.0012416493,0.00051872025,0.00030205128],"domain_scores_gemma":[0.99825424,0.00010885811,0.0002576392,0.0010725202,0.00020433226,0.000102420956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004095982,0.00026812422,0.00032849822,0.00026726373,0.00014390198,0.00031841485,0.0025303776,0.00016180541,0.00000539035],"category_scores_gemma":[0.00003841922,0.00026079646,0.00008532619,0.001327305,0.00027905105,0.00029420754,0.0025025099,0.0005438286,0.000005357556],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047926014,0.00012593684,0.0002109544,0.00008983101,0.000011140945,0.0000023778043,0.001816895,0.014612947,0.11721818,0.0012780717,0.000110239336,0.86451864],"study_design_scores_gemma":[0.000041026924,0.000084177576,0.0003133944,0.000086091146,0.0000024662233,0.0000027630454,5.689473e-7,0.76033396,0.23039788,0.008401724,0.00012561084,0.00021035406],"about_ca_topic_score_codex":0.000034856017,"about_ca_topic_score_gemma":0.000010454446,"teacher_disagreement_score":0.8643083,"about_ca_system_score_codex":0.00021045012,"about_ca_system_score_gemma":0.0002457025,"threshold_uncertainty_score":0.99998444},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1947335,0.00012930423,0.8018365,0.001568141,0.0013180563,0.00029314935,0.00001556328,0.000092234375,0.000013559288],"genre_scores_gemma":[0.68779284,0.000019371708,0.31174645,0.00022021926,0.00018492533,0.000014599554,0.000012215111,0.000009127344,2.5013114e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562836,0.00012689395,0.0008494209,0.001628412,0.0011052957,0.00066163694],"domain_scores_gemma":[0.9970873,0.00024770503,0.00045898394,0.0016775057,0.000319938,0.0002085545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006720317,0.0004262549,0.0007310725,0.0010453911,0.00024503877,0.0008421859,0.004241682,0.00018877246,0.00004485769],"category_scores_gemma":[0.00011640387,0.00039462827,0.00030353884,0.0043587326,0.0004900838,0.00047081005,0.0046930294,0.0007963831,0.0000039395854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006095423,0.00118058,0.012050183,0.0008967904,0.00038578062,0.00014254848,0.023190249,0.19230868,0.07544463,0.027631821,0.0001975016,0.6665103],"study_design_scores_gemma":[0.00035552116,0.00013320403,0.005252139,0.000111569934,0.000031534477,0.000009401414,0.0000018178388,0.8389108,0.021784052,0.13291273,0.000031467993,0.00046572497],"about_ca_topic_score_codex":0.00062080385,"about_ca_topic_score_gemma":0.00018837847,"teacher_disagreement_score":0.66604453,"about_ca_system_score_codex":0.0001487311,"about_ca_system_score_gemma":0.0007739898,"threshold_uncertainty_score":0.9998506},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016482886,0.00021632493,0.9936033,0.0004968839,0.0011373515,0.0003551384,0.0000034377763,0.0011909418,0.001348359],"genre_scores_gemma":[0.6585448,0.000017508271,0.34065908,0.00033681255,0.0003470953,0.000012049089,0.0000071924237,0.000069957896,0.000005518903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973303,0.000012234059,0.0004773435,0.001044731,0.0005481062,0.000587253],"domain_scores_gemma":[0.99844253,0.00039912303,0.00006604874,0.00079708756,0.00006951613,0.00022568916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021642857,0.0005174038,0.00050688,0.00043475014,0.00009796687,0.00015617737,0.0010500391,0.00043177608,0.000016340302],"category_scores_gemma":[0.00018421008,0.0004893859,0.00009940704,0.000457533,0.00087139726,0.00013699697,0.0003705197,0.0013320402,0.000055277815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013435523,0.000017060136,0.0000036714866,0.000037124042,0.0000055140813,0.00005638396,0.000043353866,0.8328549,0.000116615534,0.016043147,0.0000031463678,0.15080559],"study_design_scores_gemma":[0.00019516952,0.0002992003,0.000032129858,0.0002894022,0.000009700076,0.000015095688,3.0714452e-7,0.9659084,0.0017775282,0.030478427,0.0004611297,0.00053347286],"about_ca_topic_score_codex":0.0000011670162,"about_ca_topic_score_gemma":0.000030787203,"teacher_disagreement_score":0.6568965,"about_ca_system_score_codex":0.0004928192,"about_ca_system_score_gemma":0.00008844404,"threshold_uncertainty_score":0.9997558},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010274524,0.00051223964,0.97253084,0.0112961475,0.0040101763,0.00093204854,0.000025473419,0.00041542793,0.0000031099935],"genre_scores_gemma":[0.39188653,0.000015509597,0.60581297,0.0013703929,0.0008364238,0.00004268637,0.00000763476,0.000027147757,6.881291e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942483,0.00012702079,0.0006705674,0.0030515094,0.00072230917,0.0011802936],"domain_scores_gemma":[0.9965875,0.0009515664,0.000325114,0.0014417138,0.00024218322,0.00045190912],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011396661,0.0007317615,0.00085321156,0.00050387287,0.0004506396,0.0015358259,0.004320759,0.00042240252,0.000001026624],"category_scores_gemma":[0.00038285094,0.0006402859,0.00022266373,0.0013766239,0.00073793094,0.00030889548,0.0067861914,0.0017337184,0.0000029030657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016634385,0.00008580661,0.00009791197,0.00021971771,0.000021483067,0.000047304355,0.0016385423,0.06822779,0.001274129,0.0019778244,0.000034920708,0.9263579],"study_design_scores_gemma":[0.00047901794,0.00032633686,0.0005489867,0.00017312758,0.000008940029,0.000051617728,4.4708202e-7,0.8895568,0.0018181371,0.10612905,0.00021344084,0.00069407583],"about_ca_topic_score_codex":0.000055541157,"about_ca_topic_score_gemma":0.000023307428,"teacher_disagreement_score":0.9256638,"about_ca_system_score_codex":0.00014530675,"about_ca_system_score_gemma":0.0008272561,"threshold_uncertainty_score":0.9996048},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098284595,0.000056822737,0.8994829,0.0013373398,0.0005494395,0.00020162316,6.3324933e-7,0.00007725898,0.000009397177],"genre_scores_gemma":[0.8322881,0.000001661635,0.16611494,0.0012458457,0.00033172956,0.000006727691,0.0000051076186,0.0000051966463,7.073921e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990988,0.000022198876,0.00022276989,0.0002092582,0.00020506061,0.00024190683],"domain_scores_gemma":[0.9991799,0.00030963146,0.00007931951,0.00015904313,0.0001986763,0.000073456424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006393767,0.000076781595,0.00014554091,0.00020119963,0.00015360344,0.000022228889,0.00015462041,0.000055806246,0.000010716548],"category_scores_gemma":[0.0006398524,0.00006492476,0.000045922683,0.00068356737,0.00057948,0.000099984325,0.000050671242,0.00016953092,0.0000022040617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070032474,0.00007646704,0.0069184196,0.000054416887,0.00001790761,0.0000022080467,0.00065115246,0.3189104,0.03098621,0.00019122216,0.00007911171,0.64204246],"study_design_scores_gemma":[0.0005465561,0.00024926546,0.017644918,0.000054675562,0.000007672479,0.00005554673,5.435703e-7,0.9756004,0.004960141,0.0007165515,0.00010091743,0.00006277917],"about_ca_topic_score_codex":0.000016049957,"about_ca_topic_score_gemma":0.000016797798,"teacher_disagreement_score":0.7340035,"about_ca_system_score_codex":0.00006947046,"about_ca_system_score_gemma":0.00011266972,"threshold_uncertainty_score":0.2647555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002421231,0.0001852246,0.996018,0.0010249639,0.00038472502,0.00064472103,0.00000244797,0.0011680736,0.0003297134],"genre_scores_gemma":[0.06622159,0.000038812042,0.93145686,0.0014872709,0.00052762195,0.000051081453,0.00001379644,0.00006566343,0.00013729582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996454,0.00003989222,0.00036317878,0.001540233,0.0010498778,0.0005528081],"domain_scores_gemma":[0.9982656,0.000112708134,0.00020254863,0.0009502655,0.00027139386,0.0001974573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038167008,0.0005822741,0.00049261726,0.0005814268,0.00021001643,0.0004703256,0.0024473846,0.0002694159,0.000009811021],"category_scores_gemma":[0.000027691769,0.0005096359,0.000086331485,0.0006382634,0.00031378408,0.0008861452,0.0010552611,0.0010347932,0.000028719405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010182724,0.00001461915,0.00011703829,0.00007346367,0.000013448696,0.00020727508,0.0015495573,0.041931715,0.00029880455,0.06716737,0.000012781565,0.88860375],"study_design_scores_gemma":[0.00021249068,0.0007371952,0.000077108765,0.0005211096,0.000009444627,0.00009754032,4.9007827e-8,0.97170794,0.0038400132,0.016827056,0.0051053753,0.0008646874],"about_ca_topic_score_codex":0.000056080597,"about_ca_topic_score_gemma":0.000024713712,"teacher_disagreement_score":0.9297762,"about_ca_system_score_codex":0.00025029134,"about_ca_system_score_gemma":0.00038014038,"threshold_uncertainty_score":0.99973553},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033286773,0.0001524995,0.9916988,0.001358718,0.00085717486,0.00025832345,0.0000072110124,0.00062526716,0.004709149],"genre_scores_gemma":[0.45894495,0.000027074178,0.536478,0.0036997714,0.00059081666,0.000003875624,0.000010822775,0.00007021388,0.00017451488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607134,0.00004506174,0.0004305169,0.0017282492,0.0010703447,0.00065450644],"domain_scores_gemma":[0.99706644,0.00081551075,0.00036544795,0.0013762253,0.00013695793,0.00023943928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005694721,0.0005994698,0.0005555007,0.0006486093,0.00031345003,0.0008655023,0.004496647,0.0002104688,0.000016026685],"category_scores_gemma":[0.0000990067,0.00051072275,0.00011042089,0.0008201608,0.00050141936,0.0010400282,0.0018915052,0.0010113696,0.000054509397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020099995,0.000031167776,0.000080727594,0.00007323391,0.00003955868,0.0009758783,0.0019391637,0.087854125,0.00025409277,0.0921896,0.000021139826,0.8165212],"study_design_scores_gemma":[0.00044514806,0.00023736397,0.00006597832,0.0006784258,0.000009590542,0.00010324457,3.6500532e-7,0.94523406,0.0006126965,0.05108511,0.0008241295,0.00070387375],"about_ca_topic_score_codex":0.00002644313,"about_ca_topic_score_gemma":0.000025893156,"teacher_disagreement_score":0.85738,"about_ca_system_score_codex":0.0002126386,"about_ca_system_score_gemma":0.00046069248,"threshold_uncertainty_score":0.99973446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014936171,0.000092457274,0.9961184,0.0007103278,0.0004935603,0.0007401724,0.00007000629,0.00018742617,0.00009398224],"genre_scores_gemma":[0.6858704,0.0000013469522,0.31242454,0.00049213634,0.0009887576,0.00006254085,0.00014510108,0.000014961788,1.9410194e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712485,0.00006654667,0.00048797,0.0013179838,0.00035478166,0.0006478706],"domain_scores_gemma":[0.9983571,0.00019183203,0.00025296825,0.0007796732,0.00026043976,0.000157984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036755292,0.00044945566,0.0006488807,0.000138502,0.00020103238,0.0005861984,0.0017479091,0.00013820757,0.000031028005],"category_scores_gemma":[0.000011169006,0.00043842423,0.00027601095,0.0014062464,0.00027110052,0.00015056398,0.002060447,0.00061795936,0.0000019612426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000953646,0.000035748555,0.0014791924,0.000014004812,0.000028795546,0.0000013982886,0.00008696685,0.84122676,0.000026026131,0.002170839,0.00018278536,0.15473793],"study_design_scores_gemma":[0.00011799911,0.000026103164,0.00024273816,0.00006345364,0.000017010907,4.5834622e-7,1.7149242e-7,0.6365942,0.00007815371,0.36253726,0.0000506687,0.00027180157],"about_ca_topic_score_codex":0.00022182566,"about_ca_topic_score_gemma":0.000040936146,"teacher_disagreement_score":0.68437684,"about_ca_system_score_codex":0.00018271709,"about_ca_system_score_gemma":0.00028163625,"threshold_uncertainty_score":0.99980676},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013818216,0.00006875809,0.9920674,0.002084004,0.0010238362,0.0021889703,0.0000031829509,0.0003528375,0.002197198],"genre_scores_gemma":[0.2955275,0.000018456836,0.69963735,0.0036589722,0.0006526325,0.00023704564,0.000015360578,0.000055690725,0.00019700655],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633944,0.00003771103,0.0005518284,0.0016917393,0.0009370776,0.00044220535],"domain_scores_gemma":[0.9974196,0.0003092023,0.00041892804,0.0013594102,0.00030510448,0.00018778213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049339957,0.0004383347,0.0004029532,0.000484108,0.00025831486,0.00044865775,0.002829738,0.00027372662,0.000029055935],"category_scores_gemma":[0.00023979011,0.00044637572,0.00010744065,0.00075809064,0.00042012124,0.0010433006,0.001264644,0.00080221554,0.00017328297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061712153,0.000026756681,0.0000575272,0.00004727561,0.000007649642,0.000028850474,0.00067651464,0.011107702,0.000397574,0.43788853,0.000012506184,0.54974294],"study_design_scores_gemma":[0.00019132221,0.000093519426,0.00009620255,0.00012767101,0.0000033897356,0.000023755027,6.7506136e-8,0.3648374,0.0032028498,0.6290573,0.0019547944,0.00041176262],"about_ca_topic_score_codex":0.000004226818,"about_ca_topic_score_gemma":0.00001619345,"teacher_disagreement_score":0.5493312,"about_ca_system_score_codex":0.0003699782,"about_ca_system_score_gemma":0.0003930533,"threshold_uncertainty_score":0.9997988},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046491037,0.00005732237,0.99552,0.0010361216,0.0013327033,0.0005407468,0.00002536202,0.00021471591,0.0012265472],"genre_scores_gemma":[0.099463396,0.0000064296587,0.89658755,0.0032671706,0.00037991744,0.000007280341,0.000012215923,0.000023351771,0.0002527196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967078,0.000010408327,0.00068982685,0.0010697214,0.0009703557,0.00055186416],"domain_scores_gemma":[0.997797,0.00028073863,0.00033459513,0.0010509611,0.00035924333,0.00017747332],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008462281,0.00042867954,0.00042658462,0.0004960509,0.00030665586,0.0012727968,0.0033205806,0.00032259806,0.000003741909],"category_scores_gemma":[0.00018289496,0.0004207707,0.00015320165,0.00034989242,0.0002284128,0.0023142868,0.001378455,0.0006805587,0.00003206069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010152446,0.000003794113,0.0000041840326,0.00006558075,0.0000046112814,0.0000041721887,0.001639865,0.64983535,0.00003710639,0.06515666,0.0000078505545,0.28323066],"study_design_scores_gemma":[0.00020775474,0.00004030462,0.00000792919,0.000096602635,0.0000029273533,0.0000113744845,6.85873e-8,0.7357732,0.00029552932,0.26291516,0.00030822912,0.00034092687],"about_ca_topic_score_codex":0.000008256925,"about_ca_topic_score_gemma":0.000008776612,"teacher_disagreement_score":0.28288972,"about_ca_system_score_codex":0.00028960026,"about_ca_system_score_gemma":0.0007609324,"threshold_uncertainty_score":0.9998244},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068883775,0.003077778,0.9930316,0.0011055568,0.0015629835,0.00022931372,0.00001494039,0.00020351872,0.0007054253],"genre_scores_gemma":[0.009537059,0.00014652446,0.9868911,0.0025298328,0.00029422183,0.000003607947,0.0000310406,0.000028416087,0.00053821044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955519,0.000051036743,0.00044706665,0.0023411824,0.0009401915,0.000668667],"domain_scores_gemma":[0.9958339,0.00034051665,0.0002084123,0.003237836,0.00015268923,0.00022665161],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011495219,0.00046718097,0.00046259095,0.0007303621,0.00028729625,0.00088149414,0.0064120702,0.00029915274,0.0000072392154],"category_scores_gemma":[0.000111875175,0.00039379662,0.000044465305,0.0008947446,0.00087525137,0.00092631235,0.005243961,0.0007820481,0.00001596924],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012137907,0.000016646334,0.000026864976,0.00002692571,0.000008081178,0.000038006605,0.0003086812,0.005905942,0.000039754166,0.010499797,0.00084285607,0.9822852],"study_design_scores_gemma":[0.00022084005,0.00006572011,0.00011024753,0.00014333634,0.0000069171956,0.00012299615,5.9959135e-8,0.600757,0.00017354715,0.39292726,0.00497778,0.00049427047],"about_ca_topic_score_codex":0.000027615946,"about_ca_topic_score_gemma":0.00004727308,"teacher_disagreement_score":0.98179096,"about_ca_system_score_codex":0.00011333338,"about_ca_system_score_gemma":0.0009249176,"threshold_uncertainty_score":0.9998514},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1923139,0.00062707526,0.80162144,0.003966794,0.0010108988,0.00030142255,0.00000661056,0.00013950262,0.000012339197],"genre_scores_gemma":[0.7458874,0.00007433897,0.25332063,0.0006039802,0.00009641375,0.0000041614603,0.0000017764862,0.000011144301,1.7951172e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959001,0.0002524502,0.0007415806,0.0015013801,0.0008725299,0.0007319354],"domain_scores_gemma":[0.9962633,0.0013701341,0.0005166723,0.0014383167,0.00019572896,0.00021579785],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002182566,0.0004465386,0.0006073443,0.0003396411,0.0004973991,0.0011228055,0.005878783,0.00016001312,0.0000012879854],"category_scores_gemma":[0.00025745924,0.0003288821,0.00013600953,0.0020270809,0.003320439,0.00023358512,0.009751638,0.0011755633,0.0000013779061],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024021932,0.00007981293,0.005754062,0.0002086208,0.000039681916,0.00005224258,0.0076187407,0.09989209,0.0007968622,0.022134054,0.000006378051,0.8633934],"study_design_scores_gemma":[0.00014187461,0.00006511009,0.00953507,0.00018694627,0.0000033732147,0.000014505436,0.0000017133179,0.6590692,0.0013726212,0.32933208,0.000007654338,0.000269854],"about_ca_topic_score_codex":0.00022916366,"about_ca_topic_score_gemma":0.00019680079,"teacher_disagreement_score":0.8631236,"about_ca_system_score_codex":0.000062920895,"about_ca_system_score_gemma":0.00041145674,"threshold_uncertainty_score":0.9999163},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007564832,0.0014779769,0.99158716,0.00029864165,0.0019511136,0.0003456725,0.000014177356,0.0005447684,0.003704835],"genre_scores_gemma":[0.80940604,0.0001982363,0.18929812,0.0002648302,0.00066847936,0.000010953414,0.0000072251623,0.00011174582,0.000034354955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770457,0.000010966811,0.00051386666,0.0007985672,0.00050125126,0.00047076133],"domain_scores_gemma":[0.9987681,0.00030748107,0.00006148651,0.00059912057,0.00007882983,0.00018500579],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003617689,0.0005504534,0.00062535127,0.00033054024,0.000092990565,0.00016655777,0.0007784622,0.00046097362,0.000014528827],"category_scores_gemma":[0.00011397812,0.0005654908,0.00008327717,0.00034214705,0.00020052493,0.00015143344,0.0002966431,0.0011950169,0.000017238448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043245,0.0000012633456,0.0000045565503,0.00018804886,0.00001945754,0.000019556104,0.000412295,0.93177825,0.000037103226,0.003287483,0.000004195526,0.06424346],"study_design_scores_gemma":[0.00013971447,0.000026066451,0.000021288806,0.0010177017,0.00000966838,0.00002872332,2.896724e-7,0.9731801,0.00005979846,0.023293676,0.0016500261,0.00057294377],"about_ca_topic_score_codex":0.000017692491,"about_ca_topic_score_gemma":0.000013234428,"teacher_disagreement_score":0.8093304,"about_ca_system_score_codex":0.00040894494,"about_ca_system_score_gemma":0.00021028888,"threshold_uncertainty_score":0.9996797},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067195226,0.0010164345,0.017859276,0.050191317,0.008146097,0.0013485935,0.000039680872,0.00012426234,0.9206024],"genre_scores_gemma":[0.9282779,0.0009192817,0.04515085,0.014789138,0.0059847743,0.000067025554,0.00014020846,0.000067190595,0.0046036122],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975509,0.0000681904,0.0002761674,0.00094507943,0.0008274606,0.00033217052],"domain_scores_gemma":[0.99859715,0.00037590123,0.00018256695,0.00064077415,0.00007528305,0.0001283319],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011040971,0.00021423317,0.00027517477,0.00024229338,0.00025523728,0.0008602865,0.005385582,0.00013519342,0.00040132125],"category_scores_gemma":[0.00012654377,0.00020984783,0.000023990977,0.0005960206,0.00056918705,0.003547216,0.002943876,0.00043537517,0.000037695805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016631078,0.00007804089,0.0026974843,0.000057737285,0.000014072728,0.000020892383,0.024954127,0.0002884365,0.000009692179,0.36041993,0.00021387245,0.61122906],"study_design_scores_gemma":[0.000695908,0.00016605365,0.015289088,0.0019543096,0.000027757907,0.0000019921838,0.00023253469,0.005280896,0.00010224182,0.33528754,0.63898414,0.0019775117],"about_ca_topic_score_codex":0.0018739381,"about_ca_topic_score_gemma":0.0062036403,"teacher_disagreement_score":0.927606,"about_ca_system_score_codex":0.000317102,"about_ca_system_score_gemma":0.0015440568,"threshold_uncertainty_score":0.99999577},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006063108,0.00006279632,0.9950809,0.0018178247,0.0011869064,0.0007907397,0.00017616105,0.0002138987,0.0006101438],"genre_scores_gemma":[0.17810418,0.0000087760145,0.82021433,0.0005083928,0.00026781432,0.000071976974,0.0005716749,0.00004004165,0.00021284334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593467,0.000079298574,0.0006452522,0.0017208069,0.0009399915,0.00068000075],"domain_scores_gemma":[0.9954297,0.0016222877,0.0005491291,0.0016192596,0.0005749831,0.00020463046],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008946581,0.0005327014,0.00046380304,0.0008959722,0.0007927322,0.0014572394,0.002362821,0.00033428925,0.00004784334],"category_scores_gemma":[0.0009034405,0.0005012106,0.00012257803,0.0010544831,0.0005138483,0.0005312381,0.0003615258,0.0008502058,0.00013568382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012774321,0.00009485764,0.000059292128,0.000057451125,0.000011540191,0.0000053402523,0.000075709635,0.0647737,0.00013952676,0.22550741,0.00047805085,0.70878434],"study_design_scores_gemma":[0.00038943588,0.0002704615,0.0015820534,0.00014392736,0.000016169728,0.00000635926,1.0050203e-7,0.9746237,0.00016046528,0.018533483,0.0037273723,0.00054651697],"about_ca_topic_score_codex":0.000032710275,"about_ca_topic_score_gemma":0.000014036918,"teacher_disagreement_score":0.90984994,"about_ca_system_score_codex":0.0003648689,"about_ca_system_score_gemma":0.0008364143,"threshold_uncertainty_score":0.99974394},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029509848,0.0005745608,0.99216187,0.00067325216,0.002019369,0.00031341088,0.000013351026,0.00015827088,0.0011349126],"genre_scores_gemma":[0.8334618,0.000040464885,0.16472892,0.000954555,0.0006779266,0.000003019579,0.000011423171,0.000036988476,0.00008485607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965903,0.00003539364,0.0006807754,0.0012948388,0.00091405516,0.00048461874],"domain_scores_gemma":[0.9976425,0.0006102867,0.00050588936,0.00079558627,0.00022036632,0.00022533596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018949721,0.00053843646,0.00075073243,0.00073919195,0.00015555428,0.00027265353,0.0031300362,0.00024831985,0.00001501328],"category_scores_gemma":[0.00004882661,0.00048072138,0.00021772733,0.00076028943,0.00059203804,0.00054739346,0.0015999274,0.0006009414,0.000029793564],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027279511,0.000066431276,0.0003042913,0.00022425162,0.000054307307,0.0001053803,0.0031848832,0.030351,0.0016185736,0.025447402,0.00019777734,0.93841845],"study_design_scores_gemma":[0.0014013838,0.0013218644,0.0041945875,0.001017698,0.00005266726,0.000096525466,0.0000032696391,0.762697,0.023097381,0.19377033,0.00942741,0.0029198697],"about_ca_topic_score_codex":0.000078113706,"about_ca_topic_score_gemma":0.000019036717,"teacher_disagreement_score":0.93549854,"about_ca_system_score_codex":0.0001694618,"about_ca_system_score_gemma":0.0005834081,"threshold_uncertainty_score":0.99976444},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000113170696,0.0003204568,0.9851876,0.007141526,0.0006395282,0.00039999935,0.0000035563753,0.0006233642,0.005570817],"genre_scores_gemma":[0.7315411,0.00009244431,0.25948223,0.008298033,0.00038905916,0.00003777554,0.00000385696,0.000053941778,0.000101542944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963207,0.000027297598,0.0004514279,0.0018857394,0.00074177585,0.0005730558],"domain_scores_gemma":[0.9971865,0.0003579306,0.0001462246,0.0020053224,0.00012348822,0.00018053294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005416802,0.00051483494,0.0004991715,0.0005166264,0.00035144173,0.00029262865,0.004674901,0.00055771606,0.000016363869],"category_scores_gemma":[0.000066486224,0.00046907022,0.00013605348,0.0007714773,0.00067189767,0.00025396695,0.0015846975,0.0016260451,0.00011807212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002627685,0.000023857132,0.000034674144,0.00001257236,0.000008673282,0.000055645414,0.00022403212,0.0015951707,0.00009857662,0.24083374,0.00004721569,0.7570632],"study_design_scores_gemma":[0.00019091445,0.00029027738,0.00018638956,0.00026229888,0.000010186758,0.00006843223,2.40778e-7,0.28964752,0.0025039923,0.6872678,0.018508038,0.0010639485],"about_ca_topic_score_codex":0.0000075167613,"about_ca_topic_score_gemma":0.000038927636,"teacher_disagreement_score":0.75599927,"about_ca_system_score_codex":0.00019208198,"about_ca_system_score_gemma":0.00024419808,"threshold_uncertainty_score":0.9997761},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000566642,0.00046472496,0.9959919,0.00051064184,0.0003711527,0.0012444862,0.000024689622,0.00011179173,0.0007140053],"genre_scores_gemma":[0.3680412,0.00005123709,0.62920254,0.00074924796,0.000933849,0.0002443838,0.000062216604,0.000049926624,0.0006654291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707913,0.000016174366,0.00052153756,0.001495276,0.0005051102,0.00038274456],"domain_scores_gemma":[0.9966931,0.0003529609,0.0003809387,0.0022416823,0.00022169005,0.00010962864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008921064,0.00029779095,0.00034592065,0.00031896908,0.00031267377,0.00044238355,0.003231683,0.00010559888,0.000005142008],"category_scores_gemma":[0.000033094482,0.0002780938,0.000060356404,0.00026158258,0.00052829325,0.00012536821,0.002915109,0.00024467416,0.000012331303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002658345,0.000037741636,0.00009773608,0.00013005479,0.000018449104,0.0000013339584,0.00012005706,0.041622706,0.0000786204,0.031440903,0.00012881173,0.9263209],"study_design_scores_gemma":[0.00023260506,0.00006373574,0.00008693449,0.00012395353,0.000012686083,0.000011977351,1.4932233e-7,0.9226833,0.00032865955,0.053257212,0.022897946,0.00030084033],"about_ca_topic_score_codex":0.000021327034,"about_ca_topic_score_gemma":0.000012041355,"teacher_disagreement_score":0.9260201,"about_ca_system_score_codex":0.00009116905,"about_ca_system_score_gemma":0.00015784608,"threshold_uncertainty_score":0.9999671},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010447808,0.00031531544,0.9896606,0.0029232355,0.0047296463,0.0010696545,0.000008087599,0.00023905312,0.000009581649],"genre_scores_gemma":[0.4599995,0.0000028902746,0.53548396,0.0038990413,0.0005460422,0.00003252712,0.000009282892,0.000026276428,4.918241e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940114,0.00028829434,0.00081770716,0.0026709002,0.00088561716,0.0013260812],"domain_scores_gemma":[0.995657,0.0014422905,0.0003770764,0.0016949137,0.00042126386,0.00040745072],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023804912,0.0007453376,0.0009218949,0.0005993987,0.00051345077,0.0023154186,0.005590325,0.0005868108,0.0000033635747],"category_scores_gemma":[0.000310321,0.00071971706,0.0003312908,0.0019880047,0.0009478689,0.00046413302,0.0028956176,0.0016939455,0.0000063101797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007477405,0.0000520259,0.00009594542,0.00010371891,0.000010059976,0.00008089559,0.0005511353,0.6331722,0.002162791,0.000074639385,0.000038784052,0.363583],"study_design_scores_gemma":[0.001348543,0.00025043185,0.00015242811,0.0004148083,0.00001607743,0.000019312472,4.7288552e-7,0.9298359,0.046009097,0.021142766,0.000055900757,0.00075427716],"about_ca_topic_score_codex":0.00014661155,"about_ca_topic_score_gemma":0.00004625011,"teacher_disagreement_score":0.45895472,"about_ca_system_score_codex":0.00034369182,"about_ca_system_score_gemma":0.0018659539,"threshold_uncertainty_score":0.9997899},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78714216,0.011097242,0.06975136,0.0761017,0.0066971295,0.005393737,0.00054131926,0.0006630801,0.042612292],"genre_scores_gemma":[0.9946096,0.00011837381,0.003511082,0.0012340392,0.00035536278,0.0000046121577,0.000015849466,0.0000016130153,0.00014948146],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861586,0.000011667835,0.00021413105,0.0006287312,0.00028505662,0.00024454598],"domain_scores_gemma":[0.99953234,0.00019093465,0.00006906443,0.0000758351,0.000028694538,0.00010313662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013956366,0.00019676574,0.00022446841,0.000040431423,0.00010649715,0.0001036152,0.00042980828,0.00014127708,0.00010321444],"category_scores_gemma":[0.000034512625,0.000086343935,0.000042849686,0.000255178,0.00020401108,0.00006620762,0.00034019197,0.00024134538,0.000021520495],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011124574,0.00004793889,0.0031724302,0.000023761084,0.000010058483,0.000081057406,0.00048307108,0.000675633,0.031292018,0.00329304,0.000016036176,0.9608938],"study_design_scores_gemma":[0.0010600352,0.0017100057,0.1926963,0.001565732,0.000052120264,0.0002049371,0.0000049312393,0.05107538,0.005964641,0.712803,0.029904181,0.0029587194],"about_ca_topic_score_codex":0.000068052854,"about_ca_topic_score_gemma":0.0013821243,"teacher_disagreement_score":0.9579351,"about_ca_system_score_codex":0.000051457926,"about_ca_system_score_gemma":0.00003114265,"threshold_uncertainty_score":0.35210034},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43167004,0.0002024335,0.56541723,0.00039772587,0.00081349607,0.001345689,0.0000061418846,0.00014616188,0.0000010968838],"genre_scores_gemma":[0.64679897,0.00000946954,0.35267687,0.00021356563,0.00013053477,0.00015231261,0.000002824212,0.00001540872,7.219097e-8],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948211,0.0005752566,0.00074482185,0.0024506366,0.00060585066,0.00080234924],"domain_scores_gemma":[0.9957428,0.0025119907,0.00020044442,0.001084923,0.00026281257,0.00019702833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002443325,0.00058471196,0.0010104788,0.0009112796,0.00059919764,0.00092805934,0.0025606009,0.00022955923,9.1123974e-7],"category_scores_gemma":[0.0006379749,0.0005611069,0.00015132451,0.0027894448,0.00035018704,0.00059712224,0.00231592,0.0011155695,0.000001412515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050456983,0.000400444,0.02844708,0.00015965378,0.000028755128,0.000049414866,0.049618952,0.5037539,0.0008495838,0.000020501648,8.913977e-7,0.41662034],"study_design_scores_gemma":[0.0015997642,0.0004122563,0.055731993,0.00021444472,0.000009321651,0.000013641057,0.00003725873,0.93514717,0.0018477127,0.004403131,0.000004931169,0.000578396],"about_ca_topic_score_codex":0.00018511162,"about_ca_topic_score_gemma":0.0028945766,"teacher_disagreement_score":0.43139324,"about_ca_system_score_codex":0.00021051038,"about_ca_system_score_gemma":0.0006319795,"threshold_uncertainty_score":0.99968404},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082778593,0.0005738276,0.98062,0.015403849,0.00041387705,0.0002999288,0.000006214042,0.000058212623,0.0017962947],"genre_scores_gemma":[0.7252907,0.00034766583,0.25946945,0.01375351,0.00052463735,0.00003026684,0.000037661852,0.000038746013,0.00050736335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729925,0.00007099578,0.00028350434,0.00120797,0.0007554366,0.00038286205],"domain_scores_gemma":[0.998496,0.00035937852,0.0001655949,0.00079307985,0.00007791638,0.00010802569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005181728,0.0003788681,0.0004720988,0.0007963563,0.00018981479,0.00086360966,0.0020978423,0.00025374856,0.000013131948],"category_scores_gemma":[0.000044906545,0.00023898663,0.0001244433,0.0015705655,0.00036093767,0.00051498465,0.0008391469,0.0008350025,0.000014410367],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025314472,0.00008395633,0.0019728031,0.000118276315,0.00010937769,0.0006159893,0.013807332,0.0041040247,0.00033998516,0.012648439,0.0011909171,0.9649836],"study_design_scores_gemma":[0.0004749536,0.0002379314,0.006585233,0.0005612281,0.00013302379,0.000070429734,0.000006369782,0.84994495,0.0006970863,0.13233778,0.007815971,0.0011350478],"about_ca_topic_score_codex":0.0000413504,"about_ca_topic_score_gemma":0.00032843612,"teacher_disagreement_score":0.96384853,"about_ca_system_score_codex":0.00005690213,"about_ca_system_score_gemma":0.00012172737,"threshold_uncertainty_score":0.9745592},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007998532,0.0002991865,0.996446,0.0013464156,0.0005253113,0.0003513992,0.0000028872385,0.000026975145,0.00020194473],"genre_scores_gemma":[0.7783198,0.000046791534,0.22052138,0.0009293082,0.00016064983,0.0000035565342,0.0000019415716,0.000012329925,0.0000043027726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718106,0.00016563939,0.00051357405,0.001111948,0.00066858233,0.00035918836],"domain_scores_gemma":[0.99805206,0.000709152,0.00021936209,0.00069235,0.00019766277,0.00012943336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030903146,0.00044135514,0.0005584237,0.0003343569,0.0002174037,0.0005074618,0.0015916574,0.00025419172,0.000011809211],"category_scores_gemma":[0.00014165572,0.00029960088,0.000095450785,0.00049219746,0.0023090283,0.0010191795,0.0016603015,0.00083824527,7.653619e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000127280755,0.0000074648665,0.000058105357,0.000010776966,0.000013957473,0.00001808815,0.0044447877,0.63750654,0.0000722588,0.306761,0.000005378286,0.051088944],"study_design_scores_gemma":[0.00011935451,0.00005394596,0.0001376931,0.00005451016,0.000004724891,0.0000028252168,4.3756566e-7,0.598812,0.00039919897,0.4001906,0.000027584676,0.00019717502],"about_ca_topic_score_codex":0.00009373779,"about_ca_topic_score_gemma":0.00053091126,"teacher_disagreement_score":0.7775199,"about_ca_system_score_codex":0.00010218314,"about_ca_system_score_gemma":0.0003662532,"threshold_uncertainty_score":0.99994564},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001039237,0.0017229607,0.9885312,0.0005543531,0.0025947236,0.00057768053,0.000043524713,0.0003752987,0.0045610364],"genre_scores_gemma":[0.052569464,0.00023015734,0.9425833,0.0033661562,0.0006156138,0.000072200404,0.00005055425,0.00013110292,0.00038140925],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99214065,0.00018824532,0.0007946327,0.0030740753,0.0024623754,0.0013400123],"domain_scores_gemma":[0.99493235,0.0012672162,0.00039462748,0.0027931936,0.00022881731,0.00038381756],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015646816,0.0008629287,0.0007932228,0.002037294,0.0010089251,0.0008303762,0.008221413,0.0003287394,0.00029025867],"category_scores_gemma":[0.00013998787,0.0008607968,0.00035700327,0.0020421627,0.0013460097,0.0014235026,0.004572558,0.0027861984,0.000047456717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020319589,0.00005796786,0.0001396317,0.000024523446,0.000044963494,0.0005147911,0.0009352213,0.041153837,0.002135402,0.44153497,0.000042596213,0.5133958],"study_design_scores_gemma":[0.00024605633,0.00019320149,0.00006239025,0.0001099598,0.00000663947,0.00005483498,3.6631502e-7,0.19468243,0.0012384133,0.8003822,0.002160802,0.00086271553],"about_ca_topic_score_codex":0.00009773803,"about_ca_topic_score_gemma":0.0000983237,"teacher_disagreement_score":0.51253307,"about_ca_system_score_codex":0.0003687198,"about_ca_system_score_gemma":0.0008106661,"threshold_uncertainty_score":0.9995144},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30794376,0.00007338441,0.68974704,0.0006950219,0.00096515904,0.00048622346,0.0000054305183,0.000052560463,0.000031458305],"genre_scores_gemma":[0.9557592,0.000012172555,0.043943644,0.00008952654,0.00015187374,0.000028885288,0.0000019866707,0.0000120993445,6.1208243e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664694,0.000321436,0.00051028014,0.001106344,0.0010077772,0.0004071959],"domain_scores_gemma":[0.9969909,0.0010230812,0.00038678857,0.0013039497,0.00023538136,0.000059905473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001836704,0.00032325787,0.000505846,0.00042716894,0.00017255468,0.0003079747,0.003309629,0.00014038583,0.0000013403821],"category_scores_gemma":[0.00029887387,0.00023382012,0.0001136547,0.001483883,0.0009297264,0.00061237364,0.0030565355,0.0010095523,0.0000049563855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008026936,0.000043382148,0.005995572,0.00041943407,0.000009529977,0.000017471919,0.0038611335,0.41907445,0.014233322,0.00005149131,0.000011031683,0.55620295],"study_design_scores_gemma":[0.00022777909,0.0015296937,0.0072871796,0.00017490923,0.000006227162,0.000015371632,0.0000011138948,0.7171179,0.27187902,0.0015551978,0.0000039148467,0.00020168492],"about_ca_topic_score_codex":0.000030387388,"about_ca_topic_score_gemma":0.0000038563785,"teacher_disagreement_score":0.64781547,"about_ca_system_score_codex":0.00035078026,"about_ca_system_score_gemma":0.0003987715,"threshold_uncertainty_score":0.95349073},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005661772,0.0005438698,0.99516886,0.0011531592,0.001076654,0.00040249233,8.167311e-7,0.00028585957,0.0008020887],"genre_scores_gemma":[0.41533977,0.000012793867,0.58242095,0.0017693464,0.00039738225,0.0000044822655,0.00000222664,0.00003186058,0.000021180287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940483,0.0001202682,0.00074493536,0.0020522836,0.002337535,0.00069669355],"domain_scores_gemma":[0.9972741,0.00030953434,0.0005336115,0.000976893,0.00058422633,0.00032163787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019196761,0.00058432843,0.0005502875,0.00056968495,0.0005492817,0.0008525415,0.002662303,0.0003245427,0.000007080862],"category_scores_gemma":[0.0011703889,0.0006113832,0.00014102545,0.0008301773,0.00041893378,0.0008623846,0.001703026,0.0017549656,0.000030669224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018859878,0.000013534136,0.00020032453,0.000109969274,0.000016412318,0.000100392324,0.003760861,0.60322595,0.0038960725,0.014394582,0.0000011508992,0.37427887],"study_design_scores_gemma":[0.00016176804,0.00008897219,0.00004956477,0.00066267006,0.000011424591,0.00004648182,0.0000011980144,0.90899736,0.00071764464,0.08857798,0.00012599389,0.00055894215],"about_ca_topic_score_codex":0.0000858933,"about_ca_topic_score_gemma":0.00006007949,"teacher_disagreement_score":0.4147736,"about_ca_system_score_codex":0.0007494013,"about_ca_system_score_gemma":0.0009250718,"threshold_uncertainty_score":0.9996337},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022231193,0.0006233417,0.96362996,0.011881341,0.00030734538,0.0008889075,0.000005317157,0.00039702147,0.000035553592],"genre_scores_gemma":[0.5730398,0.000016370046,0.42599058,0.00067549606,0.00020638667,0.0000491244,0.0000091553575,0.000012938059,1.3640854e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946683,0.00025462764,0.00073447684,0.002737457,0.0009102348,0.0006949151],"domain_scores_gemma":[0.9964653,0.00052645983,0.00053733983,0.0019301249,0.00022982806,0.0003109021],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001461721,0.00053924206,0.00085908646,0.0009770032,0.0004118241,0.0016114127,0.0037869094,0.00020758109,0.0000032094226],"category_scores_gemma":[0.00051972346,0.00051399175,0.00019907024,0.0051581953,0.00034866994,0.00042914032,0.0076165986,0.0015990908,0.000010113428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003513213,0.000061889245,0.058553647,0.00034354886,0.000104698316,0.0000360776,0.0029546265,0.40022597,0.0010054988,0.0036504427,0.0000017446451,0.53305835],"study_design_scores_gemma":[0.00013629001,0.000036665057,0.045765493,0.0002581152,0.00006204056,0.000014915748,4.8638816e-7,0.93513745,0.00035651482,0.01770965,0.000018821042,0.0005035672],"about_ca_topic_score_codex":0.00033211804,"about_ca_topic_score_gemma":0.000014534116,"teacher_disagreement_score":0.5508086,"about_ca_system_score_codex":0.00022522663,"about_ca_system_score_gemma":0.00037202987,"threshold_uncertainty_score":0.9997312},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042571304,0.00013257418,0.978427,0.013252015,0.0023401058,0.0012579756,0.000012804476,0.00029813795,0.000022267937],"genre_scores_gemma":[0.37102842,0.000008493328,0.62559664,0.0030938368,0.00017023885,0.000049091876,0.000033038512,0.000018482142,0.0000017304302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953032,0.00028649552,0.0006739981,0.0019392933,0.0010661258,0.0007308988],"domain_scores_gemma":[0.9971465,0.0009422529,0.00048840506,0.00092650135,0.00024281832,0.0002535326],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020346788,0.00048111888,0.00046494094,0.00045479837,0.00039750332,0.0013013779,0.0026666871,0.00024356299,0.000005726085],"category_scores_gemma":[0.00035082098,0.0004914522,0.0001796617,0.0017940281,0.00025758316,0.0007436019,0.0015257247,0.0006808186,0.000016426984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018020815,0.000047934634,0.00012765899,0.00008046532,0.00001575137,0.000016568885,0.009806017,0.8253081,0.0063161924,0.005121234,0.00004521404,0.15309685],"study_design_scores_gemma":[0.0006289,0.00014009053,0.00049193803,0.00011409415,0.000005955722,0.000008211617,0.00001558875,0.8530931,0.0036199456,0.14126253,0.0001436569,0.00047601046],"about_ca_topic_score_codex":0.00006732825,"about_ca_topic_score_gemma":0.000056225927,"teacher_disagreement_score":0.36677128,"about_ca_system_score_codex":0.00035509863,"about_ca_system_score_gemma":0.0007757011,"threshold_uncertainty_score":0.9997537},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20000248,0.00004922354,0.7983885,0.0011480195,0.000036951613,0.00032986508,1.5135389e-7,0.000031389915,0.000013420119],"genre_scores_gemma":[0.60268795,0.000006061648,0.3961737,0.001090772,0.000022149243,0.000014390172,8.452376e-7,0.000003876248,2.7064996e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991199,0.000012791267,0.00018738407,0.00029895344,0.0001530576,0.00022793475],"domain_scores_gemma":[0.9995633,0.000060802533,0.000039046572,0.00022998729,0.000061111634,0.00004576813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016256567,0.0000838314,0.00012986075,0.00028234263,0.00004448967,0.000027232418,0.00016632669,0.000057909867,0.000011223549],"category_scores_gemma":[0.00006339824,0.000072658426,0.000013042304,0.0017194499,0.0001550038,0.00020843401,0.00007975138,0.00017805598,0.0000042965453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034985649,0.000089651454,0.053833403,0.000018640658,3.2800654e-7,0.000008218099,0.0007054752,0.768441,0.0074854116,0.00014616597,0.0000069858897,0.16926122],"study_design_scores_gemma":[0.00017693963,0.000029191435,0.013793338,0.0001542971,0.0000010202849,0.000013089304,0.0000030002534,0.9666137,0.010131066,0.00892803,0.000072023446,0.00008428978],"about_ca_topic_score_codex":0.00037356067,"about_ca_topic_score_gemma":0.0002057381,"teacher_disagreement_score":0.40268546,"about_ca_system_score_codex":0.00016017276,"about_ca_system_score_gemma":0.00008274723,"threshold_uncertainty_score":0.29629245},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062028016,0.00018613708,0.98801255,0.0006401209,0.0020634928,0.0009121495,0.0000057557027,0.00019057207,0.0017864077],"genre_scores_gemma":[0.76603776,0.000006210821,0.23317248,0.00025912287,0.00042183185,0.000008996468,0.0000010748256,0.000028705812,0.000063817184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990797,0.00011187227,0.00096372265,0.005752212,0.001658672,0.0007165465],"domain_scores_gemma":[0.9914738,0.00028031974,0.00049675995,0.0069829863,0.0005394674,0.00022664799],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0044412813,0.0005776923,0.00092592865,0.0005469197,0.00024886712,0.00039391758,0.0051073763,0.00025668638,0.000015424159],"category_scores_gemma":[0.000606276,0.0005464867,0.00012669944,0.0013104578,0.00020376686,0.00064688764,0.0042351526,0.0010964099,0.00001683126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005705472,0.0011138361,0.009347188,0.00045433443,0.000122803,0.00026547327,0.06478319,0.24045242,0.0006577897,0.022990836,0.000022439033,0.65973264],"study_design_scores_gemma":[0.00078070187,0.00058617507,0.0013156615,0.00046832362,0.000025336562,0.00003403305,0.0000073039278,0.9356573,0.00075934955,0.059388943,0.0001229934,0.0008538375],"about_ca_topic_score_codex":0.00006917205,"about_ca_topic_score_gemma":0.0005161946,"teacher_disagreement_score":0.75983495,"about_ca_system_score_codex":0.00022757909,"about_ca_system_score_gemma":0.0006211197,"threshold_uncertainty_score":0.99969864},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011631214,0.0012005611,0.99357355,0.0022634377,0.00021822767,0.00039401394,0.0000017793601,0.00034943948,0.00083584915],"genre_scores_gemma":[0.83461964,0.00036856718,0.16415529,0.00040616398,0.00025916693,0.000071924915,0.0000031139477,0.000033146123,0.00008296715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970038,0.000056381086,0.00041398054,0.0016792086,0.00045815305,0.00038848646],"domain_scores_gemma":[0.9986586,0.0002862221,0.00017759221,0.0005558952,0.000085008105,0.00023666894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035567975,0.0003967193,0.00044099474,0.0005825299,0.00030226866,0.00034645628,0.0012548344,0.00029806947,0.000010424145],"category_scores_gemma":[0.00007608629,0.00040637617,0.00007321373,0.00060571736,0.00022327265,0.00031965956,0.0011897815,0.001517214,0.000026347405],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048683833,0.000017683304,0.00025816934,0.0000090928315,0.0000032268072,0.000041334224,0.0006845565,0.0035072202,0.0006773883,0.002303621,5.38767e-7,0.9924923],"study_design_scores_gemma":[0.0003323631,0.0007828654,0.0070801713,0.00022509795,0.000016283404,0.00009713372,0.0000029882824,0.9486837,0.003948498,0.022876117,0.014897878,0.001056939],"about_ca_topic_score_codex":0.00007089943,"about_ca_topic_score_gemma":0.00056487636,"teacher_disagreement_score":0.99143535,"about_ca_system_score_codex":0.00018074813,"about_ca_system_score_gemma":0.00007961377,"threshold_uncertainty_score":0.9998388},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043178306,0.00044774337,0.9938071,0.002480233,0.0012624009,0.0008283222,0.000009509982,0.00004403921,0.0006888895],"genre_scores_gemma":[0.5142752,0.000003885679,0.4835142,0.0012383218,0.00084977027,0.000036542096,0.0000055289456,0.00002851676,0.000048051916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965324,0.00007141649,0.00044848697,0.0010505219,0.0015082072,0.0003889776],"domain_scores_gemma":[0.9973966,0.00050359237,0.0005070175,0.0006195355,0.00087753404,0.000095760195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017153153,0.00035314434,0.00042659996,0.00026137242,0.00039139242,0.00033057437,0.002264372,0.00017321452,0.000016186614],"category_scores_gemma":[0.0002627156,0.00025134592,0.0001665568,0.00055482704,0.00074537337,0.0004857007,0.0010693871,0.00053442596,0.0000016548787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018928511,0.000030734525,0.000037674323,0.00009153596,0.000026679494,0.0000048684115,0.0028897435,0.0519689,0.000677608,0.01547012,0.000040379036,0.9287428],"study_design_scores_gemma":[0.00028467947,0.00012110658,0.0000802055,0.0006959521,0.0000338168,0.000025222396,0.0000013105474,0.8954022,0.005057993,0.09772307,0.0002816788,0.0002927538],"about_ca_topic_score_codex":0.000007784399,"about_ca_topic_score_gemma":0.000016719025,"teacher_disagreement_score":0.92845005,"about_ca_system_score_codex":0.00026706696,"about_ca_system_score_gemma":0.0017958811,"threshold_uncertainty_score":0.99999386},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033205084,0.00004695094,0.9968733,0.000329205,0.0002162034,0.00041737143,0.000036282225,0.000116424555,0.001632183],"genre_scores_gemma":[0.87015724,0.0000021390472,0.1286508,0.00014881026,0.0008226119,0.000017470267,0.00009942811,0.000028955175,0.00007253241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852896,0.00003057037,0.00033814422,0.00051497214,0.00030551356,0.00028184277],"domain_scores_gemma":[0.99885094,0.00016747828,0.00016870958,0.0005671205,0.00015547649,0.0000902576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046414015,0.0003039231,0.00039938986,0.00020724948,0.00033874504,0.00015075796,0.00078214484,0.0000997131,0.000026401625],"category_scores_gemma":[0.000008768014,0.00029454508,0.0001946852,0.00020068994,0.00017085091,0.0001249738,0.00047330267,0.0008390909,0.000003951721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023943727,0.00006669061,0.0018427889,0.000053530905,0.0000828998,0.000002222877,0.0007359107,0.6906712,0.00011428513,0.029144583,0.00019662778,0.27706534],"study_design_scores_gemma":[0.0000906541,0.000071375194,0.0000089792475,0.00010809517,0.000021484646,4.642284e-7,3.1501742e-7,0.73847973,0.00014827841,0.2603597,0.000519699,0.00019124328],"about_ca_topic_score_codex":0.00020965008,"about_ca_topic_score_gemma":0.000056775425,"teacher_disagreement_score":0.8698252,"about_ca_system_score_codex":0.00011325195,"about_ca_system_score_gemma":0.00013726918,"threshold_uncertainty_score":0.99995065},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8272823,0.000046488192,0.058691084,0.037135363,0.0014436652,0.003801882,0.000100529134,0.00008590643,0.07141277],"genre_scores_gemma":[0.9982384,0.00000412855,0.00031051488,0.0011702003,0.00019937087,0.000009959151,5.556478e-7,0.000009373461,0.000057525325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976812,0.00023059052,0.00029156104,0.00046878937,0.0010527117,0.0002751495],"domain_scores_gemma":[0.9952994,0.003365095,0.00028698586,0.000769707,0.00018546797,0.000093326795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023121657,0.00019887646,0.00025682987,0.000075054624,0.0006325405,0.00009321169,0.0022209433,0.00014346876,0.000012070535],"category_scores_gemma":[0.0030409708,0.000096580145,0.00019578081,0.00072563026,0.002185235,0.0000697688,0.00040176473,0.0004957751,0.000011118256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023030548,0.00019927692,0.0062958878,0.000059598737,0.000061847575,0.0000027541407,0.1353112,0.08019876,0.0012201734,0.49957505,0.00055148307,0.27629364],"study_design_scores_gemma":[0.0002978491,0.0012692122,0.06698442,0.0013441087,0.000029267941,9.2897517e-7,0.00013014492,0.0026510889,0.0010771955,0.919917,0.0054329266,0.0008658453],"about_ca_topic_score_codex":0.0008047505,"about_ca_topic_score_gemma":0.0015950475,"teacher_disagreement_score":0.42034194,"about_ca_system_score_codex":0.00026252907,"about_ca_system_score_gemma":0.0006652589,"threshold_uncertainty_score":0.8051589},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012347986,0.00087989133,0.9855792,0.00015941111,0.00032046484,0.00029210458,0.0000026918085,0.000015965346,0.00040226546],"genre_scores_gemma":[0.3980367,0.00006944704,0.6013154,0.0002040565,0.0003267591,0.0000018060596,0.000008089486,0.000019428797,0.000018362374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824333,0.0000149072,0.00034911174,0.0005998337,0.0004892101,0.00030359137],"domain_scores_gemma":[0.99892473,0.00002673321,0.00030262105,0.00043168018,0.00021452969,0.00009970721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055398635,0.00022677999,0.00022466804,0.00016054563,0.00018426558,0.00009477712,0.00065829314,0.00019650179,0.000002115308],"category_scores_gemma":[0.000148081,0.00021535644,0.000037732636,0.00032358416,0.0015050041,0.000012743473,0.00066605094,0.0002665528,0.0000011143284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016492004,0.000012847197,0.0018795043,0.00020431234,0.000016813045,0.0000056007793,0.00032898673,0.14945504,0.0821964,0.0017384406,0.0000063131984,0.76413924],"study_design_scores_gemma":[0.00012670267,0.00023266667,0.0015447813,0.000170622,0.00001625389,0.000051071554,4.0890913e-7,0.9882294,0.004802434,0.0019144783,0.0025738473,0.0003373563],"about_ca_topic_score_codex":0.000006096291,"about_ca_topic_score_gemma":0.000009413443,"teacher_disagreement_score":0.8387743,"about_ca_system_score_codex":0.000048522033,"about_ca_system_score_gemma":0.00055906497,"threshold_uncertainty_score":0.8781981},"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":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15096939,0.0008060772,0.7940971,0.036174472,0.007145898,0.0052162935,0.00038373447,0.00041036683,0.004796674],"genre_scores_gemma":[0.9813382,0.000008176965,0.014356909,0.0031679294,0.0004937861,0.000029875046,0.000016181595,0.00003086894,0.0005580699],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9734653,0.0003931518,0.002542354,0.017462507,0.0054590944,0.0006775919],"domain_scores_gemma":[0.9631228,0.001453734,0.0013364595,0.032630183,0.0011861557,0.00027068346],"candidate_categories":["metaresearch","metaepi_narrow","sts","open_science"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.061214976,0.0006162978,0.0010541717,0.0004759089,0.0005793464,0.000866577,0.008984479,0.00020672401,0.0002465476],"category_scores_gemma":[0.020175893,0.00039654807,0.0003119876,0.0021436529,0.0028718128,0.00067600363,0.004666566,0.0008728793,0.00005398156],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017488358,0.0005268793,0.0075556687,0.00012931164,0.000039267874,0.000012772398,0.009104019,0.008795073,0.0008126025,0.0012566575,0.0007187159,0.97087413],"study_design_scores_gemma":[0.0006899012,0.00082526845,0.024745028,0.000408294,0.00007685531,0.000013836251,0.000040363077,0.19917957,0.047988787,0.71003497,0.014365574,0.0016315344],"about_ca_topic_score_codex":0.00013622474,"about_ca_topic_score_gemma":0.00006782621,"teacher_disagreement_score":0.96924263,"about_ca_system_score_codex":0.00022647712,"about_ca_system_score_gemma":0.0005981151,"threshold_uncertainty_score":0.99984866},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009637071,0.00056129746,0.9845945,0.011587281,0.0006789176,0.0007241106,0.000032658594,0.0001420582,0.0007154425],"genre_scores_gemma":[0.97928673,0.00003716696,0.015064967,0.0040647928,0.0014281241,0.00001824426,0.000043667045,0.000028709701,0.000027597549],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635243,0.00015559181,0.0005831512,0.0011657146,0.001169696,0.0005733848],"domain_scores_gemma":[0.99729097,0.0012370165,0.00044573593,0.00034890897,0.00030444338,0.00037294332],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015019303,0.00043806076,0.0006703813,0.0003914893,0.0010464758,0.0010703322,0.0015572831,0.00044064797,0.00002964206],"category_scores_gemma":[0.00064706383,0.00040206933,0.00011361561,0.0006593136,0.0020873111,0.0008554032,0.0005128684,0.0010017359,0.000009366689],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011079288,0.000050345032,0.00985504,0.00009303948,0.000037166417,0.00013223472,0.0013018668,0.010484856,0.000115842784,0.056144815,0.000023467492,0.9216505],"study_design_scores_gemma":[0.003991042,0.00065163977,0.005069431,0.00072960823,0.00012204058,0.000009830531,0.0000044653125,0.58894354,0.0002586823,0.39078254,0.0074741715,0.0019630147],"about_ca_topic_score_codex":0.00056731934,"about_ca_topic_score_gemma":0.0035976828,"teacher_disagreement_score":0.97832304,"about_ca_system_score_codex":0.0003110001,"about_ca_system_score_gemma":0.0009436413,"threshold_uncertainty_score":0.9999667},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004141792,0.0004093781,0.9915391,0.0028682542,0.0014211669,0.0023162914,0.00003235817,0.00026578986,0.0007334458],"genre_scores_gemma":[0.6303251,0.00011118063,0.3644942,0.0039832722,0.0006167311,0.00012400559,0.0000841833,0.00009043545,0.00017089528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99415636,0.00014476452,0.0010593558,0.002279708,0.0014389179,0.0009208772],"domain_scores_gemma":[0.9951562,0.0018396019,0.000715793,0.0014329099,0.0005041058,0.00035134717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001302152,0.0009148222,0.0015548053,0.0009824993,0.0007537942,0.0009499954,0.0030641058,0.0003860986,0.000023518158],"category_scores_gemma":[0.00009987747,0.00068760774,0.00042842398,0.0009043733,0.0011462647,0.0008242698,0.0015197139,0.0009664965,0.000015160476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005440505,0.00049963826,0.00012073201,0.0007783436,0.00044678213,0.00028032734,0.0111792665,0.22440366,0.0015835736,0.3011513,0.0013519576,0.45276392],"study_design_scores_gemma":[0.026856726,0.00042197827,0.0000814148,0.0009549889,0.000066632725,0.000054192355,0.0000028617214,0.77837086,0.0016314948,0.18812819,0.0021104838,0.0013202014],"about_ca_topic_score_codex":0.000050324492,"about_ca_topic_score_gemma":0.00006720557,"teacher_disagreement_score":0.6299109,"about_ca_system_score_codex":0.00015410055,"about_ca_system_score_gemma":0.0005544312,"threshold_uncertainty_score":0.9995575},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043146554,0.00086412765,0.996808,0.00015264163,0.0010973125,0.00042710238,0.000012216067,0.00008877476,0.00011834422],"genre_scores_gemma":[0.623058,0.00033190617,0.37543955,0.0004328514,0.0006223681,0.000015134778,0.00002915462,0.00003422222,0.000036800153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969867,0.00007257386,0.00079573796,0.0010324009,0.0007285396,0.00038405196],"domain_scores_gemma":[0.9968078,0.0009915199,0.00089026184,0.0006312885,0.0005755655,0.00010354384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006047103,0.00038337125,0.0009795752,0.0011489689,0.00028016578,0.00011858187,0.0014249256,0.00029873583,0.000014017146],"category_scores_gemma":[0.00013869582,0.00036358504,0.0003931155,0.0027310925,0.0004263807,0.0003741788,0.0009867382,0.00069163647,0.0000017445988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035075303,0.000012935249,0.000019581526,0.00006905459,0.00011146994,0.000002839229,0.00061382307,0.3960357,0.000798762,0.002051386,0.0000025158688,0.60024685],"study_design_scores_gemma":[0.00021168092,0.00059792836,0.00010240463,0.00016847182,0.00012339033,0.0000069362845,4.303032e-7,0.96608824,0.0062394473,0.023918854,0.002226471,0.00031576407],"about_ca_topic_score_codex":0.000058123034,"about_ca_topic_score_gemma":0.00016491361,"teacher_disagreement_score":0.62262654,"about_ca_system_score_codex":0.000110430534,"about_ca_system_score_gemma":0.00013300552,"threshold_uncertainty_score":0.9998816},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010218039,0.0000959984,0.9953388,0.0026180733,0.00034376496,0.000853735,0.000013852155,0.00020634552,0.00042726815],"genre_scores_gemma":[0.10908965,0.000008981946,0.8899694,0.0004297697,0.0002442025,0.00007799203,0.0000068635118,0.000055701217,0.00011743167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677193,0.000018652183,0.00044422783,0.0012816577,0.0009530109,0.00053052144],"domain_scores_gemma":[0.99524766,0.002560159,0.00022030964,0.0013519602,0.00042475897,0.00019512529],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005117586,0.0003961078,0.000526194,0.00057089736,0.00010187673,0.00029257062,0.0033172208,0.00016912655,0.000009205008],"category_scores_gemma":[0.000530917,0.00033570323,0.00013537897,0.00071659783,0.0007372366,0.00032047572,0.0006046611,0.0004973072,0.000013983657],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026363423,0.000044139702,0.0006123102,0.00020712106,0.000043098487,0.000048114704,0.00061430485,0.0033331327,0.00014946848,0.0132468,0.000082608596,0.98159254],"study_design_scores_gemma":[0.0022952068,0.0044065043,0.0034353777,0.007017718,0.00013959475,0.00051897485,0.0000029868713,0.8081008,0.032364752,0.11418846,0.022538643,0.0049909707],"about_ca_topic_score_codex":0.000008288042,"about_ca_topic_score_gemma":0.000016629618,"teacher_disagreement_score":0.97660154,"about_ca_system_score_codex":0.00019102555,"about_ca_system_score_gemma":0.0006286863,"threshold_uncertainty_score":0.9999095},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004257218,0.0007387459,0.99550396,0.0006531467,0.00150425,0.0010711508,0.00005253905,0.00002824584,0.000022221982],"genre_scores_gemma":[0.15080437,0.0005943771,0.8349772,0.010461921,0.0028675213,0.00006292873,0.00015932818,0.000055948272,0.000016384327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751586,0.00010747064,0.00030624686,0.0010617274,0.00070493453,0.00030373887],"domain_scores_gemma":[0.9984227,0.00056219724,0.00024617315,0.00054358476,0.00011696109,0.000108374225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016793532,0.0003065992,0.00027158554,0.00021468436,0.00053539814,0.000646908,0.0011409587,0.00014250189,0.0000016361078],"category_scores_gemma":[0.00008234008,0.00023727547,0.00003836032,0.00024066563,0.00046777644,0.00078863953,0.0010170577,0.0004079701,0.000002384852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028600152,0.000013721692,0.0000032400042,0.00003747424,0.000027159525,0.000010069871,0.001366186,0.100668795,0.00037645997,0.009320414,0.00017071882,0.8879772],"study_design_scores_gemma":[0.0002745285,0.00015789953,0.0000036458691,0.00012196435,0.000016050091,0.000019782803,2.4372534e-7,0.83249944,0.00078693905,0.16339475,0.002496096,0.00022867082],"about_ca_topic_score_codex":0.000012238268,"about_ca_topic_score_gemma":0.0000102506565,"teacher_disagreement_score":0.8877485,"about_ca_system_score_codex":0.0001483236,"about_ca_system_score_gemma":0.00021104194,"threshold_uncertainty_score":0.9675813},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007735082,0.0001817643,0.9932901,0.0010345376,0.0003817482,0.002358689,0.00001944652,0.00043184494,0.002224521],"genre_scores_gemma":[0.395665,0.000005481358,0.60123324,0.0010896446,0.0005745606,0.0012587287,0.000023082026,0.00005465879,0.00009558629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952293,0.00008708717,0.000886844,0.0023499927,0.00081088534,0.00063589244],"domain_scores_gemma":[0.99583644,0.0016346663,0.00039784427,0.0015465043,0.00041465124,0.0001698808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015670706,0.0005784391,0.0006384796,0.0012856647,0.0004897024,0.0006166047,0.0025212788,0.00041244426,0.0000069900684],"category_scores_gemma":[0.00033520968,0.0006212678,0.00019880114,0.0015736443,0.00064937124,0.00060039223,0.0005465912,0.0011559278,0.000012552478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034325163,0.00015772702,0.00025401,0.0005423549,0.000016075117,0.0000035882415,0.0028428207,0.5342532,0.0005419632,0.1140585,0.00003050619,0.34726495],"study_design_scores_gemma":[0.00039549163,0.00019066087,0.000020495298,0.000085682615,0.000005945856,0.000016135813,0.000003996864,0.85879105,0.0013104341,0.13635466,0.0022367388,0.0005887045],"about_ca_topic_score_codex":0.000052581378,"about_ca_topic_score_gemma":0.00028132243,"teacher_disagreement_score":0.39558765,"about_ca_system_score_codex":0.0008479603,"about_ca_system_score_gemma":0.0012216485,"threshold_uncertainty_score":0.9996239},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006467061,0.00070197455,0.99320066,0.0023873167,0.0020018804,0.0011437372,0.000057813464,0.00009565306,0.0003462706],"genre_scores_gemma":[0.03833369,0.000026891092,0.9568637,0.0034390613,0.0010146624,0.000055678116,0.000036968966,0.000025910884,0.00020345683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965975,0.000024360861,0.000518996,0.0016752565,0.0006539463,0.000529917],"domain_scores_gemma":[0.9976698,0.00092309946,0.00025504394,0.00054545567,0.00036028892,0.000246321],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059278787,0.00047799925,0.00051220367,0.0005154852,0.0002843255,0.0008856346,0.0014069643,0.00025910774,0.0000026242608],"category_scores_gemma":[0.00020025896,0.00045818093,0.0001777637,0.0009267889,0.00026014616,0.00061961176,0.00075527275,0.0002556518,0.000009126172],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021715237,0.000024340394,0.000010591142,0.000091574526,0.000019926092,0.000010547032,0.0001791965,0.037034582,0.000048295035,0.069197536,0.00014731077,0.8932144],"study_design_scores_gemma":[0.00048287166,0.00039999015,0.00006916063,0.00007569706,0.000014393798,0.00006429119,1.4634033e-7,0.76114166,0.0002605036,0.23150147,0.0055615804,0.0004282416],"about_ca_topic_score_codex":0.000006549194,"about_ca_topic_score_gemma":0.000009946996,"teacher_disagreement_score":0.89278615,"about_ca_system_score_codex":0.00021882154,"about_ca_system_score_gemma":0.00050825457,"threshold_uncertainty_score":0.999787},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056662377,0.00093771773,0.9415459,0.00011014153,0.00029777628,0.00037817913,0.000020385969,0.0000043648433,0.000043165655],"genre_scores_gemma":[0.98378354,0.000018354785,0.015941864,0.00007923022,0.00013786442,0.000003937688,0.000007350755,0.000010391117,0.000017464885],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99881226,0.000026390515,0.00032167893,0.0004926201,0.0002194001,0.0001276564],"domain_scores_gemma":[0.9988398,0.00016428203,0.00031760204,0.00045776577,0.00018193485,0.0000385952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003559929,0.00017033116,0.00023077935,0.000046780016,0.00007320656,0.000037888323,0.00049699994,0.0001448495,0.000004424527],"category_scores_gemma":[0.00052135147,0.00012304522,0.000057262096,0.000056501918,0.0005856485,0.000008699958,0.00029714406,0.00013494506,6.283187e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025174062,0.0000029659534,0.000011481474,0.000058745725,0.000010000786,1.5840163e-7,0.00008145499,0.0014084864,0.7636478,0.00034172766,3.8042907e-7,0.23441164],"study_design_scores_gemma":[0.00021555394,0.00033283725,0.0014247634,0.00019574621,0.000027210548,0.000009392354,7.8448085e-7,0.03265154,0.90726453,0.057503413,0.00005142663,0.00032277612],"about_ca_topic_score_codex":0.000010596494,"about_ca_topic_score_gemma":0.000009866451,"teacher_disagreement_score":0.92712116,"about_ca_system_score_codex":0.000011500092,"about_ca_system_score_gemma":0.000104699466,"threshold_uncertainty_score":0.5017638},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006950997,0.00018907769,0.9874261,0.00068830675,0.0031128952,0.0007149943,0.0000035279659,0.00015384959,0.007641725],"genre_scores_gemma":[0.007137409,0.000052932446,0.98866844,0.00028029297,0.0014622373,0.000026137615,0.0000018949822,0.0001167429,0.0022539306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700195,0.000021856667,0.00065853895,0.0007342559,0.000981526,0.00060186913],"domain_scores_gemma":[0.9947443,0.0028094074,0.000470275,0.0015262595,0.00032853268,0.00012121333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001244731,0.00049342145,0.00051943137,0.00020419418,0.0004918985,0.00028194842,0.002076814,0.00041244435,0.000023321814],"category_scores_gemma":[0.00095298485,0.00033077603,0.00012533175,0.00025551155,0.0010646337,0.00014179936,0.00078655983,0.0016370917,0.00004566994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008653648,0.000044811917,0.0000018912173,0.000113602924,0.000015153858,0.000030504225,0.0005669991,0.00043122683,0.0003175254,0.7789405,0.000058327492,0.21947083],"study_design_scores_gemma":[0.00018127145,0.00007494283,7.4375436e-7,0.00027193132,0.000014767976,0.000040826468,1.5376172e-7,0.0055497154,0.0012930249,0.9822219,0.009967885,0.00038282486],"about_ca_topic_score_codex":0.0000022623462,"about_ca_topic_score_gemma":0.00010910085,"teacher_disagreement_score":0.219088,"about_ca_system_score_codex":0.0001911876,"about_ca_system_score_gemma":0.00032944483,"threshold_uncertainty_score":0.9999144},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031324747,0.0004399805,0.99216455,0.0004240757,0.00086419185,0.00021616048,0.000002697026,0.00010850477,0.0057485183],"genre_scores_gemma":[0.9536845,0.000012386914,0.045255285,0.000591871,0.00023143584,0.000001919949,0.0000060488683,0.000014899476,0.00020164975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996891,0.00003986156,0.0005769269,0.0011758575,0.00090499356,0.0004113511],"domain_scores_gemma":[0.9978701,0.00037236733,0.0003326972,0.0010049,0.00024878333,0.00017117555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005982235,0.00035987352,0.0009135472,0.00089607434,0.00009663825,0.00026391487,0.0026248463,0.0002590544,0.000026782856],"category_scores_gemma":[0.00011638574,0.00029489162,0.00029550615,0.0015617308,0.00065528543,0.000235684,0.0009616003,0.00045003064,0.000048937432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059336776,0.00003225812,0.00033141862,0.00005485546,0.00025379093,0.000102028585,0.0012769694,0.005745806,0.0000724197,0.7339745,0.00002052722,0.25812945],"study_design_scores_gemma":[0.0002559452,0.00037985455,0.00037290217,0.00005083142,0.00022836895,0.000025279545,5.6024777e-7,0.8093815,0.00072390767,0.1845431,0.003301741,0.00073603215],"about_ca_topic_score_codex":0.000044909855,"about_ca_topic_score_gemma":0.000108169086,"teacher_disagreement_score":0.95365316,"about_ca_system_score_codex":0.00008226772,"about_ca_system_score_gemma":0.00032092843,"threshold_uncertainty_score":0.99995035},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021575754,0.00014659308,0.9965139,0.0006017221,0.00034918397,0.0006456268,0.000007191471,0.0012902806,0.0004239052],"genre_scores_gemma":[0.109501265,0.000029846153,0.8898262,0.00048807467,0.00007433769,0.000020795278,0.0000077118375,0.00003419122,0.000017615901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968887,0.00002771896,0.0004906179,0.0012787951,0.00091609044,0.00039810908],"domain_scores_gemma":[0.99774355,0.00016512255,0.00033173672,0.0011692384,0.00045559838,0.00013473244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036820333,0.0005162586,0.00056360924,0.00055755617,0.00013011678,0.00020139475,0.0020919123,0.00026459986,0.000003837191],"category_scores_gemma":[0.000021004618,0.00042138423,0.0001027439,0.00077843573,0.0005961762,0.00053307886,0.0007079019,0.00047430542,0.0000029529363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004870125,0.000016204165,0.0000057829798,0.00006426268,0.000017139702,0.000033639408,0.00040092654,0.6495179,0.00014498325,0.3269421,0.000037147984,0.022815047],"study_design_scores_gemma":[0.00016298078,0.00029250665,0.0000052934392,0.00031922117,0.000010176654,0.000034672932,3.075512e-8,0.91222215,0.0017833442,0.08450784,0.00021867272,0.00044310285],"about_ca_topic_score_codex":0.00001753281,"about_ca_topic_score_gemma":0.0000427238,"teacher_disagreement_score":0.26270425,"about_ca_system_score_codex":0.00018945518,"about_ca_system_score_gemma":0.00051688496,"threshold_uncertainty_score":0.9998238},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006613397,0.00024154421,0.9800105,0.000033567918,0.012895409,0.0003402702,0.000007868283,0.0003590758,0.005450402],"genre_scores_gemma":[0.9087816,0.000061020197,0.07284174,0.00095778925,0.007413967,0.000023587389,0.00018673093,0.00036125284,0.0093723275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787563,0.000024814864,0.0004948472,0.0006702357,0.00044522624,0.00048926345],"domain_scores_gemma":[0.9988504,0.00015462753,0.00012943862,0.0006963704,0.000087701585,0.00008146657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031155962,0.00044342448,0.0005124183,0.00067119976,0.00008181816,0.0004298414,0.0009563737,0.0003127899,0.00003845895],"category_scores_gemma":[0.000007992074,0.00041114987,0.000120930235,0.0003490751,0.00011034942,0.0003434519,0.00025446876,0.0009033282,0.00037736492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.627352e-7,0.000010002169,0.000015532416,0.00012974812,0.000017597977,0.000020871243,0.00025108556,0.92074746,0.00062780944,0.000042789987,0.004269555,0.073866814],"study_design_scores_gemma":[0.000146912,0.00007667771,0.00010364171,0.0010253293,0.000006777903,0.000048337828,1.2260503e-7,0.99004656,0.00050173694,0.00082357536,0.0067177657,0.00050254556],"about_ca_topic_score_codex":0.000014648508,"about_ca_topic_score_gemma":0.000017733728,"teacher_disagreement_score":0.9081202,"about_ca_system_score_codex":0.0006109299,"about_ca_system_score_gemma":0.0001400192,"threshold_uncertainty_score":0.99983406},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004430741,0.00037116028,0.9725338,0.022749012,0.00083125173,0.0014926362,0.000068060544,0.00014466073,0.0017650911],"genre_scores_gemma":[0.2588902,0.00016499149,0.7360591,0.0038030753,0.00024637362,0.00022697684,0.00001130889,0.00020695408,0.0003909482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946829,0.00016746773,0.0007463761,0.0022305916,0.0011625745,0.0010100862],"domain_scores_gemma":[0.9941296,0.0040113945,0.00040812328,0.0011560307,0.000034234883,0.00026060137],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010028371,0.0006549793,0.000926643,0.001001909,0.00030264622,0.00019541502,0.0027120966,0.00036921972,0.00028973713],"category_scores_gemma":[0.0011902477,0.0006134175,0.00033524306,0.001093744,0.0018018382,0.00025931397,0.00093811133,0.001014011,0.000032283733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113158865,0.00024608208,0.0005212901,0.00050031574,0.000021162157,0.00007525672,0.0007656691,0.036542784,0.002889718,0.37845397,0.000052362513,0.5798182],"study_design_scores_gemma":[0.00048712155,0.00041483407,0.000107324035,0.00017763593,0.000015573265,0.000007890846,8.796103e-8,0.4834224,0.057407673,0.45400688,0.003420433,0.00053216214],"about_ca_topic_score_codex":0.00004438242,"about_ca_topic_score_gemma":0.000074770556,"teacher_disagreement_score":0.57928604,"about_ca_system_score_codex":0.00025225533,"about_ca_system_score_gemma":0.0009838359,"threshold_uncertainty_score":0.9996317},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062909955,0.0009014328,0.99352866,0.0019109126,0.001461913,0.0009024627,0.0000036337876,0.0006524327,0.000009466788],"genre_scores_gemma":[0.43895668,0.0000630369,0.55982286,0.000752394,0.00033972814,0.000037118636,0.000010441038,0.000016140479,0.0000015759958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959311,0.00011812468,0.0003920422,0.001961004,0.00087272696,0.00072502194],"domain_scores_gemma":[0.9974226,0.0007451761,0.00039096555,0.00080119737,0.00043739297,0.00020266772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008567578,0.0004974255,0.0005515264,0.0009135976,0.00043391524,0.0009812715,0.003472765,0.00036012632,0.0000020058387],"category_scores_gemma":[0.0016851539,0.00046361022,0.00021270847,0.0038733103,0.00028018912,0.0010505693,0.005000572,0.0015931092,0.0000074104573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012571764,0.00003414636,0.00037598546,0.00009043766,0.000008447383,0.00002863677,0.0007457091,0.07336474,0.0005569456,0.00024151681,0.000024081288,0.9245168],"study_design_scores_gemma":[0.0002577677,0.00032859552,0.000480589,0.00017274113,0.000009568296,0.000011941022,0.0000011106159,0.89168876,0.047038678,0.059087787,0.00038454775,0.00053789],"about_ca_topic_score_codex":0.000020198724,"about_ca_topic_score_gemma":0.000009983619,"teacher_disagreement_score":0.92397887,"about_ca_system_score_codex":0.00034561087,"about_ca_system_score_gemma":0.00038405368,"threshold_uncertainty_score":0.99978155},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059457235,0.0013443809,0.93646497,0.00054995297,0.0011424411,0.0008277682,0.000013596607,0.00019392815,0.0000057446377],"genre_scores_gemma":[0.86348313,0.000003223604,0.13618192,0.000088345696,0.00014208432,0.00007824353,0.0000042965653,0.000018426274,3.4217288e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952269,0.0002925107,0.0008490555,0.001885886,0.0011305682,0.0006150767],"domain_scores_gemma":[0.99646455,0.0002599335,0.000774156,0.0015576442,0.00077136816,0.00017235335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016031719,0.0004932666,0.0009479751,0.0003559142,0.00018293607,0.00078436814,0.003778685,0.00022169361,3.5727797e-7],"category_scores_gemma":[0.0003129898,0.000377133,0.00009312413,0.0024012371,0.00063445617,0.00048159147,0.0022507673,0.00089466956,0.0000037462369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021575563,0.00005246815,0.00004814361,0.00069374143,0.000027436612,0.000021645381,0.018894153,0.96712095,0.0031881076,0.0008055972,5.5624395e-7,0.009125633],"study_design_scores_gemma":[0.0002632059,0.0001361397,0.000104791085,0.004324468,0.00000840405,0.00003109516,0.000036865607,0.9858253,0.007317433,0.0014610293,0.0000023160949,0.0004889469],"about_ca_topic_score_codex":0.0004202055,"about_ca_topic_score_gemma":0.000017267157,"teacher_disagreement_score":0.8040259,"about_ca_system_score_codex":0.0002166496,"about_ca_system_score_gemma":0.0010875874,"threshold_uncertainty_score":0.99986804},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014700492,0.000052098003,0.9963408,0.0009526719,0.0004591961,0.0007818761,0.0000143121815,0.0001364898,0.0011155144],"genre_scores_gemma":[0.0039569717,0.00002514978,0.99439114,0.0006280122,0.00030189,0.000022706428,0.000020743111,0.00008345987,0.0005699172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621123,0.00009237408,0.0006529955,0.00119671,0.0012249663,0.00062173465],"domain_scores_gemma":[0.99749094,0.0010373454,0.0002449145,0.00073707924,0.00029887428,0.00019085669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001034586,0.00047176343,0.0006624381,0.00063510146,0.00011836411,0.00020896601,0.0010280414,0.00029751397,0.00008578065],"category_scores_gemma":[0.0011630434,0.0004249559,0.00011838218,0.0007179706,0.00051567744,0.00018554213,0.00061076274,0.0013416426,0.00004791929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011811015,0.00025663985,0.000034390923,0.00037561968,0.000034033277,0.0005878354,0.0016973062,0.36439383,0.00006549411,0.082068846,0.00006953206,0.5502984],"study_design_scores_gemma":[0.0005385813,0.00011758118,0.0000036686652,0.000375121,0.0000046315386,0.000010626833,4.6456537e-7,0.69646204,0.00049921393,0.3005104,0.0010366314,0.00044101098],"about_ca_topic_score_codex":0.000012063811,"about_ca_topic_score_gemma":0.0001728693,"teacher_disagreement_score":0.5498574,"about_ca_system_score_codex":0.00042348017,"about_ca_system_score_gemma":0.00035291273,"threshold_uncertainty_score":0.99982023},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002560166,0.00009362859,0.9940914,0.00059059705,0.0016585209,0.000683699,0.000017157206,0.00015282487,0.002456155],"genre_scores_gemma":[0.19603576,0.000024329056,0.79978436,0.0032262811,0.0007750352,0.000021390251,0.000008771594,0.000043957923,0.000080126054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962946,0.000029019817,0.000464345,0.0017787341,0.00066909916,0.0007641792],"domain_scores_gemma":[0.9973466,0.0008485137,0.00023911435,0.0012087924,0.00017610248,0.00018090883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086278055,0.0005661469,0.0005700378,0.0005249448,0.00042416554,0.00091899966,0.0019009571,0.0003129768,0.000009862229],"category_scores_gemma":[0.00007507479,0.00049690413,0.00013881888,0.0002446049,0.0003227218,0.0003674888,0.0009289575,0.00047568616,0.000012040409],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000462105,0.00004040247,0.000065260145,0.00018893104,0.000012025413,0.000059414197,0.0009908776,0.06252379,0.000082898776,0.006484667,0.000023207756,0.92948234],"study_design_scores_gemma":[0.00063999236,0.00043759437,0.00009733982,0.0005656603,0.0000061657506,0.000026905938,1.2106358e-7,0.8634814,0.00016961279,0.13307337,0.0008953796,0.00060646713],"about_ca_topic_score_codex":0.00001425657,"about_ca_topic_score_gemma":0.000057437013,"teacher_disagreement_score":0.92887586,"about_ca_system_score_codex":0.00018472123,"about_ca_system_score_gemma":0.0002337094,"threshold_uncertainty_score":0.99974823},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012956163,0.000037893737,0.9743966,0.0004017279,0.000107317224,0.0002324964,0.000021456346,0.0000315002,0.023475401],"genre_scores_gemma":[0.9443694,0.00001952887,0.053833928,0.0012896814,0.00012341952,0.0000053955528,0.000023166907,0.000016386488,0.00031909393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825287,0.000009937175,0.0003241969,0.00044697552,0.00072383217,0.0002422046],"domain_scores_gemma":[0.9992514,0.0000646969,0.00025812007,0.00029283838,0.000048047117,0.0000848493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016300594,0.00028186227,0.00047454305,0.00018605289,0.00014213868,0.00007109171,0.0006224422,0.00016108254,0.00009674378],"category_scores_gemma":[0.000032856624,0.00021561128,0.00012008098,0.00076920586,0.0009722928,0.00036759244,0.00047744092,0.00030773983,0.000026288863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039912215,0.000020923579,0.0076102037,0.00003507535,0.00011966159,0.000008155873,0.0052597974,0.88634783,0.000049617396,0.00049423147,0.0002497067,0.099764876],"study_design_scores_gemma":[0.00039349988,0.00012851911,0.008764056,0.00007117957,0.00020082123,0.000002189358,0.000002436789,0.9798997,0.00021157892,0.007750081,0.0018830674,0.00069283997],"about_ca_topic_score_codex":0.00012861153,"about_ca_topic_score_gemma":0.00046790004,"teacher_disagreement_score":0.9430738,"about_ca_system_score_codex":0.00019914402,"about_ca_system_score_gemma":0.00005817602,"threshold_uncertainty_score":0.87923723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013426464,0.0003917058,0.9964121,0.00003431717,0.001142731,0.00029130626,0.000018228757,0.00014401777,0.00022296872],"genre_scores_gemma":[0.7190801,0.00032203298,0.27943492,0.0003164782,0.0006073623,0.000022561373,0.00002040003,0.00013783603,0.000058317393],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985652,0.000004393544,0.0003606532,0.00044974466,0.00030069743,0.0003193418],"domain_scores_gemma":[0.99934244,0.000065302804,0.00008486279,0.0003453423,0.00006772449,0.00009432579],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013094326,0.0003113525,0.00047475917,0.0001555588,0.00003568337,0.000038781112,0.00057815266,0.00023043982,0.000044533957],"category_scores_gemma":[0.000022588727,0.00030229916,0.000078002195,0.00013404037,0.0001223021,0.00007657692,0.00018921746,0.00038508498,0.000013056236],"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.000013302449,0.000016497223,0.0000010035666,0.00017442157,0.000013454543,0.00006185274,0.000085963286,0.030812822,0.8550281,0.0110526765,0.00001167225,0.102728225],"study_design_scores_gemma":[0.00029160382,0.00024069665,0.000004196417,0.00027269195,0.00003544966,0.00004086143,1.0665998e-7,0.26034397,0.681352,0.055230934,0.0015420623,0.0006454008],"about_ca_topic_score_codex":0.0000022438824,"about_ca_topic_score_gemma":0.000008417108,"teacher_disagreement_score":0.71773744,"about_ca_system_score_codex":0.00010623811,"about_ca_system_score_gemma":0.00008707797,"threshold_uncertainty_score":0.9999429},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018530929,0.00021543537,0.99351853,0.001434361,0.001931606,0.00079521077,0.000016297825,0.0002059343,0.0018640948],"genre_scores_gemma":[0.018666534,0.000035586538,0.9787984,0.0010233128,0.00051062,0.000023301318,0.00002870514,0.000040561634,0.0008729948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611616,0.000022458018,0.00041095333,0.0017383277,0.00075104955,0.00096107693],"domain_scores_gemma":[0.9974254,0.0005170991,0.00017163256,0.001499502,0.00021734944,0.00016905382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010307408,0.0005029685,0.0005177753,0.0010395235,0.00034799086,0.0007853629,0.00463104,0.0002743851,0.000017116274],"category_scores_gemma":[0.00007931166,0.00047838403,0.00016205118,0.0005738923,0.00059088867,0.0009098937,0.0025967842,0.0006118441,0.000045960092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011634016,0.0000501881,0.00002427285,0.00010887996,0.00003144713,0.00014270525,0.0009991111,0.12858719,0.00016045012,0.1082997,0.00006338965,0.76152104],"study_design_scores_gemma":[0.0008689186,0.0003008553,0.000031936805,0.00024270499,0.000011002525,0.00003182566,3.6272246e-7,0.86890984,0.0014919675,0.123926364,0.0033963926,0.0007878574],"about_ca_topic_score_codex":0.000037474376,"about_ca_topic_score_gemma":0.000059756898,"teacher_disagreement_score":0.7607332,"about_ca_system_score_codex":0.00033092604,"about_ca_system_score_gemma":0.00048767228,"threshold_uncertainty_score":0.99976677},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017369905,0.00064446894,0.9880291,0.0024622509,0.0009100523,0.00046176466,0.000005913972,0.00011310834,0.007199616],"genre_scores_gemma":[0.98148763,0.000099100405,0.013650352,0.0019024253,0.0023046474,0.000012765527,0.000008470979,0.000040316834,0.0004943033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967813,0.00009591843,0.00045075337,0.001018616,0.00090691674,0.00074647635],"domain_scores_gemma":[0.99902946,0.0002222385,0.00018707024,0.00021954633,0.00015799407,0.00018370073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000931149,0.00038747457,0.0006183741,0.00036201446,0.00081084337,0.00040651878,0.0014285835,0.00055042387,0.00010639868],"category_scores_gemma":[0.0001770036,0.00038019582,0.00016753697,0.00065651606,0.0012327917,0.00034608282,0.00035896068,0.0011498388,0.000019759173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008137134,0.00005815661,0.0006084635,0.000032479624,0.000030342128,0.00017240505,0.020815972,0.33422896,0.000013924768,0.05656951,0.00002522206,0.5873632],"study_design_scores_gemma":[0.0007020227,0.000021458141,0.00007100638,0.00010573358,0.000011273788,0.0000010847492,0.000008204244,0.975113,0.0000012561657,0.021971626,0.0015385016,0.00045483658],"about_ca_topic_score_codex":0.0006344838,"about_ca_topic_score_gemma":0.0029919886,"teacher_disagreement_score":0.98131394,"about_ca_system_score_codex":0.0004108242,"about_ca_system_score_gemma":0.00067767105,"threshold_uncertainty_score":0.999865},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31306505,0.00003031878,0.68658614,0.00019107215,0.000016241407,0.000059195787,1.8764283e-7,0.000020743564,0.000031026157],"genre_scores_gemma":[0.9080574,0.00000695068,0.09075486,0.0010534641,0.00011086246,0.0000018602942,0.0000059739777,0.00000767368,9.725464e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904734,0.000020811896,0.000105460495,0.00047819715,0.00015257197,0.00019564462],"domain_scores_gemma":[0.99957365,0.0000071339678,0.000042799653,0.00027150114,0.00004804959,0.000056892615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009175268,0.00010650391,0.000096196425,0.000074100055,0.00005491051,0.000089188914,0.00037093819,0.00004036674,0.0000048600336],"category_scores_gemma":[0.000049284354,0.00008925326,0.00002946766,0.0006108843,0.00016285706,0.000015747031,0.0001831491,0.00010084085,5.5223467e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025575726,0.0000104632345,0.0038601346,0.000007375901,0.0000063205252,0.000009842337,0.00018851335,0.04048704,0.9189436,0.00000869755,0.000015890628,0.03643659],"study_design_scores_gemma":[0.00010482124,0.00023990234,0.0010539779,0.0000101112,0.0000047128233,0.000012588633,5.420078e-7,0.07982164,0.91813606,0.00044025716,0.000050980972,0.00012439683],"about_ca_topic_score_codex":0.000009356333,"about_ca_topic_score_gemma":0.00002636802,"teacher_disagreement_score":0.59583133,"about_ca_system_score_codex":0.0000120118775,"about_ca_system_score_gemma":0.00004718216,"threshold_uncertainty_score":0.36396426},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14822848,0.0044106087,0.8094401,0.005432243,0.0033332084,0.0030082865,0.00004631847,0.0007599774,0.025340827],"genre_scores_gemma":[0.98683727,0.00022548405,0.010686778,0.0009005203,0.00087048573,0.000015886124,0.000006112103,0.000044910128,0.00041255195],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966752,0.000092678834,0.0003086021,0.0010470091,0.0012488416,0.00062766386],"domain_scores_gemma":[0.99806,0.00053694064,0.00045199564,0.00040684573,0.00028492088,0.00025929094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005498974,0.00036331563,0.0004166475,0.00035442528,0.00087249203,0.00034250604,0.0011646474,0.00029627085,0.00010289461],"category_scores_gemma":[0.00030107985,0.00031963692,0.00009187865,0.0006475197,0.001307239,0.00037696242,0.00036626632,0.0008387741,0.000021199236],"study_design_candidate":"observational","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.00030697836,0.00013500854,0.5098064,0.00015525383,0.0003171148,0.0028032206,0.21480234,0.009342838,0.00021496807,0.010373468,0.00044771048,0.2512947],"study_design_scores_gemma":[0.012058841,0.014147308,0.33403838,0.070232056,0.003345441,0.0006277272,0.000776348,0.08347157,0.019925153,0.4113731,0.024241993,0.025762063],"about_ca_topic_score_codex":0.0010728032,"about_ca_topic_score_gemma":0.027576199,"teacher_disagreement_score":0.8386088,"about_ca_system_score_codex":0.00020860397,"about_ca_system_score_gemma":0.0010949943,"threshold_uncertainty_score":0.99992555},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000104383085,0.0005404933,0.9951775,0.0016638194,0.00065683835,0.0007494854,0.000013477808,0.00022549107,0.000868495],"genre_scores_gemma":[0.4976604,0.000029685669,0.50032526,0.0015977878,0.00023454752,0.00003670486,0.0000053014473,0.000037833575,0.000072484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957505,0.000026342816,0.0005893168,0.0021179232,0.0007943319,0.0007216111],"domain_scores_gemma":[0.9972328,0.000776525,0.0002568573,0.00102068,0.00038540055,0.00032774938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006660648,0.0006267152,0.00065266533,0.00041895668,0.00032812956,0.00076922943,0.0025342375,0.00032107896,0.0000024034116],"category_scores_gemma":[0.00025336328,0.00057342567,0.000122016754,0.0004512678,0.0008310616,0.0004241502,0.0014174192,0.00075272605,0.0000076090687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000776206,0.000020720736,0.0000037465827,0.00014125202,0.00000805271,0.000020753914,0.001258447,0.54679495,0.000073720636,0.21792826,0.000007896688,0.23373441],"study_design_scores_gemma":[0.00015127978,0.00012900322,0.0000054561424,0.00032512596,0.000008524042,0.00001802637,1.8851378e-7,0.65503246,0.0001260772,0.3437086,0.000058823774,0.0004364474],"about_ca_topic_score_codex":0.00001492362,"about_ca_topic_score_gemma":0.00001326719,"teacher_disagreement_score":0.49755603,"about_ca_system_score_codex":0.00017886101,"about_ca_system_score_gemma":0.0007113056,"threshold_uncertainty_score":0.9996717},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002280839,0.0004948431,0.9756069,0.0023249341,0.0012389831,0.0004233111,0.0000023346045,0.0003356873,0.019550152],"genre_scores_gemma":[0.08900957,0.00009116256,0.8894599,0.013841812,0.0009573017,0.000031315954,0.000016314534,0.00012001451,0.006472603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954637,0.000051000916,0.00056697254,0.001912039,0.0012896074,0.00071667257],"domain_scores_gemma":[0.99759537,0.00033858285,0.00032608464,0.0011851816,0.00019646704,0.0003583296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006841326,0.0005775275,0.0005554625,0.00055337406,0.00039066863,0.00071364397,0.003308308,0.00030703135,0.000108128486],"category_scores_gemma":[0.00012448613,0.0005387489,0.00018307052,0.00065646315,0.00060016336,0.0005817767,0.0022659306,0.0010435272,0.00059351884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015767093,0.000040562038,0.00016969517,0.00011295807,0.000033395932,0.00038236356,0.0053185057,0.09616627,0.0005062781,0.10755631,0.00032357976,0.7893743],"study_design_scores_gemma":[0.00058885285,0.0002907261,0.00015090383,0.00041194318,0.000011976496,0.00016990508,4.485478e-7,0.76767594,0.00052980793,0.15348111,0.07536671,0.001321658],"about_ca_topic_score_codex":0.000008426271,"about_ca_topic_score_gemma":0.000058543534,"teacher_disagreement_score":0.7880527,"about_ca_system_score_codex":0.0004267063,"about_ca_system_score_gemma":0.00049507176,"threshold_uncertainty_score":0.9997064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000090973284,0.00038712422,0.99351466,0.0016429292,0.002458578,0.00083910616,0.000010017611,0.00041626455,0.0006403211],"genre_scores_gemma":[0.053512763,0.000050765204,0.93882805,0.005910213,0.0012739347,0.000027014496,0.00001136733,0.00008870871,0.00029719365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946508,0.000034196648,0.0007497706,0.0024680942,0.0011280031,0.00096915703],"domain_scores_gemma":[0.9964496,0.00093155843,0.00044983558,0.001495849,0.00035488626,0.00031829363],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008133382,0.00072139216,0.00077610096,0.00059875916,0.00045050864,0.0009232334,0.0055613657,0.00044700134,0.000010158761],"category_scores_gemma":[0.00030763182,0.0007074572,0.0003314742,0.0011959379,0.00054191076,0.0021097772,0.002348592,0.001314141,0.000032225056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033934328,0.00003897664,0.00024581508,0.00028367512,0.000047339265,0.00029307982,0.0012680995,0.06860805,0.0012104656,0.2745558,0.00023869249,0.65317607],"study_design_scores_gemma":[0.0004112966,0.00020469615,0.00006207018,0.00038161202,0.000012179799,0.00003012648,1.497764e-7,0.6384748,0.0011376855,0.35597154,0.0024738875,0.0008399543],"about_ca_topic_score_codex":0.000005064543,"about_ca_topic_score_gemma":0.000027841994,"teacher_disagreement_score":0.6523361,"about_ca_system_score_codex":0.00025410345,"about_ca_system_score_gemma":0.00027955987,"threshold_uncertainty_score":0.99981904},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000085190346,0.00018411486,0.9378654,0.0063844216,0.006020365,0.0011893424,0.000016493274,0.00018022823,0.04807448],"genre_scores_gemma":[0.2022858,0.0009267552,0.40404442,0.36657578,0.014275017,0.00044692904,0.000857146,0.00017157456,0.010416567],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9944717,0.00014005555,0.001304457,0.00046412766,0.002308043,0.001311562],"domain_scores_gemma":[0.9960151,0.0005415297,0.00090410496,0.00069330796,0.00110998,0.0007359985],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.012235531,0.00027458512,0.00052212685,0.001557138,0.0018548915,0.000112114736,0.0013456176,0.00038471466,0.00005897786],"category_scores_gemma":[0.0019269795,0.00022633941,0.000035493464,0.0017901186,0.0011713505,0.0019153705,0.00062982336,0.0022475813,0.00081132265],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.000015762966,0.000012477062,0.00027192562,0.0011493659,0.000001529993,0.0000014716718,0.01870939,0.002748212,8.6907477e-7,0.002849024,0.021078823,0.9531611],"study_design_scores_gemma":[0.0016940656,0.0007242178,0.0021853102,0.006494392,0.000007544511,0.00002187091,0.000023873317,0.4017614,0.000015161132,0.074243955,0.5117809,0.001047269],"about_ca_topic_score_codex":0.0001769792,"about_ca_topic_score_gemma":0.00012861799,"teacher_disagreement_score":0.95211387,"about_ca_system_score_codex":0.004456159,"about_ca_system_score_gemma":0.045828223,"threshold_uncertainty_score":0.9999667},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002310031,0.00012753297,0.99344933,0.0020545986,0.0011069446,0.00080483913,0.0000059285117,0.000273775,0.00215395],"genre_scores_gemma":[0.017586065,0.000013269603,0.9789257,0.0024582094,0.00041806936,0.00003541388,0.000033035965,0.00004805674,0.00048219558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965443,0.00005447666,0.00057689357,0.0014131496,0.0008990616,0.00051212724],"domain_scores_gemma":[0.9978475,0.0005820958,0.00043358927,0.0006534612,0.00027323733,0.0002101183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008394906,0.00045802759,0.00042711358,0.0005665972,0.00037961037,0.0007962062,0.0017644736,0.00023480506,0.0000207839],"category_scores_gemma":[0.00016787325,0.00046514653,0.000173215,0.00054690207,0.00035939013,0.00088004535,0.00047109605,0.00056242576,0.000090402464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022048758,0.000019470655,0.000008078768,0.000056924873,0.00001613436,0.00002161439,0.0054908805,0.07139986,0.0017604287,0.046844177,0.00005115265,0.87430924],"study_design_scores_gemma":[0.0006257699,0.00021435085,0.00003095866,0.00011955306,0.000008425133,0.00002004782,0.000004163321,0.8619792,0.0007055574,0.13013083,0.0056297104,0.0005314266],"about_ca_topic_score_codex":0.000008079849,"about_ca_topic_score_gemma":0.000023294655,"teacher_disagreement_score":0.8737778,"about_ca_system_score_codex":0.00029345386,"about_ca_system_score_gemma":0.000438035,"threshold_uncertainty_score":0.99978},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068490364,0.00020666496,0.99527574,0.0011464143,0.0004837235,0.0015262798,0.000033002685,0.00015358138,0.001106086],"genre_scores_gemma":[0.43519595,0.000005701477,0.5628593,0.0006287896,0.0008903713,0.00016327114,0.000019823465,0.00003744043,0.00019934766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617314,0.000041776904,0.0005239941,0.0012374481,0.0016421563,0.00038150622],"domain_scores_gemma":[0.9975469,0.00017553505,0.00035871106,0.0010566188,0.0007490039,0.000113211834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025022605,0.0003164679,0.00037663986,0.00041993643,0.00025598495,0.00016228088,0.002035498,0.00020375314,0.0000030330175],"category_scores_gemma":[0.000068742695,0.00030249672,0.00016637154,0.0005275016,0.00016769834,0.000069286245,0.0010183428,0.0003453192,0.00000686995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002369997,0.000033741224,0.0000045076627,0.000058331334,0.000014418982,4.0557114e-7,0.000886831,0.7001863,0.000029843855,0.016151365,0.000076456454,0.28255543],"study_design_scores_gemma":[0.00037756545,0.00008206123,0.000007923786,0.00013052147,0.000049587186,0.0000032788378,5.231578e-7,0.84922224,0.00015564082,0.14853886,0.0012098749,0.00022191419],"about_ca_topic_score_codex":0.0000023567247,"about_ca_topic_score_gemma":0.00003266652,"teacher_disagreement_score":0.43512747,"about_ca_system_score_codex":0.00027352592,"about_ca_system_score_gemma":0.00053344993,"threshold_uncertainty_score":0.9999427},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047953166,0.00085879344,0.9019494,0.007621168,0.0049405294,0.0023933747,0.000046334888,0.00048254902,0.033754677],"genre_scores_gemma":[0.9726908,0.00010397829,0.013436102,0.009438363,0.0032293054,0.000014460407,0.00033424306,0.00007076819,0.00068193034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983396,0.000005236746,0.00034781103,0.00063830114,0.00044855368,0.00022050503],"domain_scores_gemma":[0.99947554,0.000045487897,0.0002021146,0.00017265306,0.000083784515,0.00002040889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027292612,0.00025392065,0.00024933624,0.00079115236,0.00009979083,0.00032152768,0.00025379873,0.00013806843,0.00010050262],"category_scores_gemma":[0.00003703985,0.0002458989,0.000036735273,0.0004909007,0.0001858086,0.00091601384,0.00024754924,0.0003853846,0.00007312291],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000479495,0.000056141373,0.010170081,0.00029644,0.000012601082,0.000055855893,0.00059638504,0.0071076467,0.001406886,0.0025834602,0.0001583085,0.97750825],"study_design_scores_gemma":[0.0025100792,0.00010043448,0.029977504,0.0010765409,0.000095783944,0.00002537931,0.000015910044,0.91065955,0.00038092426,0.039966032,0.0138076665,0.0013841927],"about_ca_topic_score_codex":0.000081675294,"about_ca_topic_score_gemma":0.00038685036,"teacher_disagreement_score":0.97612405,"about_ca_system_score_codex":0.00013993523,"about_ca_system_score_gemma":0.00004859107,"threshold_uncertainty_score":0.99999934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094570415,0.0005702433,0.98812205,0.00033869964,0.0005611306,0.0002207223,0.000019290692,0.0006844047,0.00002642315],"genre_scores_gemma":[0.500398,0.000014284297,0.49920824,0.0001267803,0.00021330222,0.000007647582,0.000011424649,0.000020293388,4.7991758e-8],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981776,0.00001153272,0.00027663528,0.0008668831,0.00028526987,0.00038207183],"domain_scores_gemma":[0.998394,0.000057355082,0.000060883518,0.0013396733,0.00005898088,0.000089078894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030889237,0.0002689197,0.00025149604,0.00019619435,0.00014057226,0.00044585613,0.0021304465,0.00015377763,0.0000028961776],"category_scores_gemma":[0.00007423514,0.00027517436,0.000032991655,0.0008301217,0.00017884301,0.00025328252,0.0037708797,0.00083936576,0.000004993285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.500387e-7,0.000009363793,0.000045979592,0.00015694114,0.000004544565,0.000010296359,0.00022818676,0.76809895,0.014075859,0.000016518283,0.000021206557,0.2173316],"study_design_scores_gemma":[0.0000386998,0.0000043667724,0.00003793085,0.0002274617,0.000008315834,0.000020075428,1.6108159e-7,0.9700145,0.014333754,0.014895002,0.00012162189,0.00029809162],"about_ca_topic_score_codex":0.000035382396,"about_ca_topic_score_gemma":0.00001284864,"teacher_disagreement_score":0.49094093,"about_ca_system_score_codex":0.00016043767,"about_ca_system_score_gemma":0.00020389234,"threshold_uncertainty_score":0.99997},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033544653,0.00022336088,0.9873477,0.00183857,0.0013570056,0.00029870778,0.0000017566908,0.00023362078,0.008665736],"genre_scores_gemma":[0.091968454,0.000009101792,0.8998681,0.006896888,0.0007759695,0.000010579004,0.000019567897,0.00005450371,0.00039687494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961881,0.00007944307,0.00054998253,0.0015008842,0.0010928514,0.0005887231],"domain_scores_gemma":[0.9977047,0.0005901698,0.00041926058,0.0007397377,0.00023552035,0.00031060723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074888027,0.00051391526,0.0004441606,0.0003965562,0.0003715976,0.0006337046,0.0018774169,0.00022734776,0.0000488551],"category_scores_gemma":[0.00017208046,0.00044738868,0.00008911094,0.0008151665,0.0005729156,0.00083731115,0.0009324674,0.0016796438,0.000030032346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006690741,0.000010764252,0.00008556189,0.000019959174,0.000013694973,0.0000439786,0.00091226585,0.70273477,0.00001053436,0.054999232,0.000041761778,0.24112077],"study_design_scores_gemma":[0.00038741564,0.00019560121,0.00013198276,0.0003480804,0.000007702428,0.000080165235,5.4945156e-7,0.9791101,0.000019647661,0.017617801,0.0015623837,0.0005385507],"about_ca_topic_score_codex":0.000008233197,"about_ca_topic_score_gemma":0.0000136697445,"teacher_disagreement_score":0.27637532,"about_ca_system_score_codex":0.00021316978,"about_ca_system_score_gemma":0.0005250865,"threshold_uncertainty_score":0.99979776},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020710683,0.00072374084,0.9800813,0.0007887168,0.0010075801,0.0002768337,0.000009965186,0.00030603906,0.01659868],"genre_scores_gemma":[0.47925338,0.000020074003,0.5176139,0.002171125,0.0005054374,0.000004998428,0.000011573324,0.000061851475,0.00035765299],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964829,0.000021625705,0.0004390091,0.0016009948,0.0009332921,0.0005221765],"domain_scores_gemma":[0.9977511,0.00018862353,0.00030005362,0.0012688695,0.00021089226,0.00028042955],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00023418367,0.00048642882,0.0004118783,0.0005360853,0.00018087741,0.0011991538,0.0033495913,0.00017424046,0.000011552273],"category_scores_gemma":[0.00008944697,0.00048214826,0.00014914125,0.00070239394,0.0005445051,0.0011793056,0.0013493756,0.00048465971,0.00013337567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015460342,0.0004228233,0.0004338608,0.00035404298,0.0000727993,0.00068901957,0.0010606365,0.046037797,0.006898702,0.13361847,0.00017224687,0.8102241],"study_design_scores_gemma":[0.00036081707,0.00016165483,0.000119196644,0.0003184015,0.000058474376,0.000070767535,1.7921073e-7,0.8566295,0.008183704,0.13130996,0.0017569106,0.0010304179],"about_ca_topic_score_codex":0.000010769097,"about_ca_topic_score_gemma":0.0000040853884,"teacher_disagreement_score":0.8105917,"about_ca_system_score_codex":0.00014960037,"about_ca_system_score_gemma":0.00076512917,"threshold_uncertainty_score":0.9998377},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021258978,0.00034640013,0.9914219,0.0052897073,0.0007235261,0.00022808778,0.0000026991054,0.00068270706,0.0012837555],"genre_scores_gemma":[0.3386806,0.00029413096,0.65485066,0.0031421632,0.0005736637,0.000033936463,0.00005447821,0.00007217635,0.0022981637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971055,0.00003009612,0.00041591743,0.0012722587,0.000748235,0.0004280319],"domain_scores_gemma":[0.9984884,0.00020525444,0.0003157522,0.00074956444,0.000121147816,0.00011987923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025009495,0.00036835822,0.00034360954,0.00037736335,0.00024953837,0.00065410667,0.0026891173,0.0002930983,0.00003161708],"category_scores_gemma":[0.00018481299,0.00035010558,0.000066450215,0.000598119,0.00046331424,0.00061431236,0.0010643763,0.00076419563,0.00011497388],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052115693,0.00002828916,0.00010836656,0.000018600595,0.000009390855,0.00002113256,0.00040692632,0.0046745287,0.0011129513,0.1334756,0.00063185836,0.85950714],"study_design_scores_gemma":[0.00040231593,0.00026320494,0.000021853812,0.0000980524,0.000007551707,0.000010530705,4.3118095e-7,0.84495157,0.0099986475,0.09799845,0.045552164,0.0006952149],"about_ca_topic_score_codex":0.000003947258,"about_ca_topic_score_gemma":0.0000022743764,"teacher_disagreement_score":0.8588119,"about_ca_system_score_codex":0.00017215182,"about_ca_system_score_gemma":0.00022901727,"threshold_uncertainty_score":0.9998951},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02751367,0.0008225014,0.958758,0.0009102173,0.0020048642,0.0009826877,0.000052108793,0.000077237055,0.008878728],"genre_scores_gemma":[0.9015462,0.0000042612537,0.09392333,0.0033219242,0.0006273222,0.000018024111,0.000044217395,0.000051157753,0.00046356762],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99743855,0.000052106305,0.0005799233,0.0010615737,0.00043542834,0.0004324386],"domain_scores_gemma":[0.99819255,0.00056068366,0.0004020117,0.000617728,0.00008174579,0.0001452779],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026923095,0.00026698216,0.0004564358,0.00032300878,0.00010540216,0.00005507418,0.00075882074,0.0001968105,0.00021587624],"category_scores_gemma":[0.00011641684,0.00027625778,0.00007859535,0.00032473754,0.00019761124,0.00008748431,0.0005783513,0.00046310422,0.00011659583],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009812128,0.000058807404,0.003632314,0.0002575062,0.000068030626,0.00039893098,0.028132385,0.0027065487,0.026161313,0.0020636455,0.00029594515,0.9361265],"study_design_scores_gemma":[0.010225618,0.0033429516,0.041206058,0.021796731,0.0005355416,0.0005460728,0.00046069833,0.10758627,0.5148216,0.28897575,0.0025211398,0.00798158],"about_ca_topic_score_codex":0.0006322835,"about_ca_topic_score_gemma":0.00015437925,"teacher_disagreement_score":0.9281449,"about_ca_system_score_codex":0.0001295637,"about_ca_system_score_gemma":0.00008753447,"threshold_uncertainty_score":0.99996895},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006479375,0.00006638745,0.9931109,0.0016617674,0.0014541502,0.0004443734,0.000001889468,0.00027129316,0.0029244286],"genre_scores_gemma":[0.32912347,0.000028140945,0.6682015,0.001524861,0.00081724074,0.000014956303,0.000009125557,0.00004207552,0.0002386292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622583,0.000040516356,0.0005266503,0.001701669,0.0010180468,0.00048725732],"domain_scores_gemma":[0.9981823,0.00025283665,0.00034664903,0.0007916469,0.0002458162,0.00018075739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042591456,0.00045616552,0.00042617126,0.0005600844,0.00023635305,0.00062005216,0.0020730463,0.00031171524,0.000020190984],"category_scores_gemma":[0.0000849854,0.0004565183,0.00011470142,0.0005880829,0.00020133337,0.001021502,0.00090796634,0.0008773226,0.000061109655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008275295,0.000021002254,0.000108097396,0.0000385152,0.000021406768,0.000054123157,0.0011040001,0.20611961,0.00053854065,0.058749363,0.00002440533,0.73321265],"study_design_scores_gemma":[0.00021263295,0.00012493323,0.00011817909,0.00016836161,0.000008225281,0.0000207034,1.2121768e-7,0.84624577,0.0021403136,0.14971188,0.0007411587,0.00050775293],"about_ca_topic_score_codex":0.000045746678,"about_ca_topic_score_gemma":0.00009928906,"teacher_disagreement_score":0.73270494,"about_ca_system_score_codex":0.000624743,"about_ca_system_score_gemma":0.0006431649,"threshold_uncertainty_score":0.99978864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000084901345,0.0007401707,0.98804665,0.007363111,0.0014388278,0.0007384571,0.000014854271,0.0009740424,0.00059895974],"genre_scores_gemma":[0.06970235,0.000008287289,0.9120262,0.016781554,0.0012693629,0.000026024736,0.000006360627,0.000056990386,0.00012286774],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99413097,0.000044159086,0.00062773656,0.0028367252,0.0014196981,0.0009406922],"domain_scores_gemma":[0.9960068,0.0006328112,0.00025721744,0.0021615839,0.00031368178,0.00062789343],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006314773,0.000751937,0.0008195808,0.00093109766,0.00028866873,0.001509624,0.008132805,0.0006021655,0.0000393691],"category_scores_gemma":[0.0005882136,0.0007110647,0.00018276926,0.0016989692,0.00016917272,0.0006042015,0.0052585234,0.0019336662,0.00027117995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024463523,0.000029571289,0.00004281972,0.000057367186,0.000021428812,0.00026112152,0.0058573657,0.0013383349,0.00308122,0.07024435,0.00030863445,0.9187333],"study_design_scores_gemma":[0.00012786218,0.00029951072,0.000028748265,0.0015333636,0.000011114934,0.000019017476,3.3951153e-7,0.035758756,0.012759199,0.9426224,0.005601504,0.0012381325],"about_ca_topic_score_codex":0.0001532912,"about_ca_topic_score_gemma":0.000062038605,"teacher_disagreement_score":0.9174952,"about_ca_system_score_codex":0.00044397303,"about_ca_system_score_gemma":0.00045934174,"threshold_uncertainty_score":0.9995341},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029980546,0.00020897735,0.9955699,0.0005367824,0.001984145,0.0012146431,0.000059966333,0.000102142105,0.000023634875],"genre_scores_gemma":[0.2551586,0.000027829918,0.7381494,0.0032177733,0.0030723822,0.00018909574,0.00010327344,0.000060006583,0.000021641097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968443,0.00004101499,0.000462345,0.001619759,0.00040774996,0.0006248661],"domain_scores_gemma":[0.99808264,0.00059616426,0.00031658422,0.00072216516,0.00014344523,0.00013900788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009079386,0.0004364084,0.0004934879,0.00047973127,0.00040792898,0.0004923745,0.0015458049,0.00040876603,0.00000372894],"category_scores_gemma":[0.00012147354,0.00045160757,0.00013783286,0.0006850735,0.00018475512,0.00052803126,0.0005643229,0.0007816066,0.0000031858465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060238177,0.000027667544,0.0000031859322,0.0000646086,0.000008666363,0.000011762788,0.00017787979,0.104210064,0.0014223437,0.0010520174,0.000116321535,0.8928452],"study_design_scores_gemma":[0.00044851803,0.00046047848,0.000009135719,0.00014042118,0.0000058034175,0.000022040147,7.84188e-8,0.97591764,0.003372225,0.013747039,0.0054032155,0.0004733839],"about_ca_topic_score_codex":0.000032496908,"about_ca_topic_score_gemma":0.00058044086,"teacher_disagreement_score":0.89237183,"about_ca_system_score_codex":0.00030463692,"about_ca_system_score_gemma":0.00024137781,"threshold_uncertainty_score":0.9997936},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000048867314,0.0006761422,0.9950586,0.00047574044,0.002338183,0.00068091817,0.000018861232,0.0002995708,0.0004471082],"genre_scores_gemma":[0.0012008941,0.000031309264,0.99645257,0.0010777229,0.00047400186,0.000047969294,0.000035544792,0.000058822152,0.00062117155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99530464,0.00011381992,0.00062125997,0.0020185031,0.0010660144,0.00087577],"domain_scores_gemma":[0.9963254,0.0009841799,0.00045180588,0.0014477716,0.00057320396,0.00021769006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018666143,0.00064678106,0.0006672369,0.00083258486,0.00044050696,0.00061553804,0.003356664,0.00043709477,0.000031220112],"category_scores_gemma":[0.00047562094,0.0006429026,0.00027073268,0.0009453747,0.00052485784,0.0005335493,0.0007623251,0.0011672963,0.000013388337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008831851,0.000034134973,0.00001548054,0.00007068493,0.00001341505,0.000032623397,0.0001835547,0.02011464,0.00011341927,0.013000927,0.000023604462,0.9663887],"study_design_scores_gemma":[0.00042779068,0.0003241938,0.0000150641,0.00019563895,0.000013180291,0.000034847424,8.6329344e-8,0.9521627,0.0055848677,0.030252695,0.010296398,0.0006925462],"about_ca_topic_score_codex":0.000021125663,"about_ca_topic_score_gemma":0.000039453935,"teacher_disagreement_score":0.96569616,"about_ca_system_score_codex":0.0005174784,"about_ca_system_score_gemma":0.0011337749,"threshold_uncertainty_score":0.9996022},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004253736,0.00034329906,0.9586497,0.0015477589,0.0038317908,0.0006113882,0.000022045366,0.00016060905,0.030579658],"genre_scores_gemma":[0.96920884,0.000008535896,0.024534106,0.0038723846,0.0010744482,0.000023651122,0.000026277752,0.000056659985,0.0011951157],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977002,0.000047460388,0.00042495428,0.0010343422,0.0003879513,0.00040509802],"domain_scores_gemma":[0.9989522,0.00031216224,0.00018176048,0.0003645004,0.000075000105,0.00011437116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046818904,0.00031539967,0.00033929673,0.00055372214,0.000095351534,0.0001025069,0.0005431333,0.0002857487,0.00063521066],"category_scores_gemma":[0.000099161305,0.00030922517,0.000062079744,0.00028523442,0.00023092807,0.000105514184,0.0002473533,0.0009443244,0.00037228133],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023095134,0.00003871075,0.0002164648,0.000035875804,0.000013360009,0.0002027304,0.0016625249,0.0013960107,0.00039304068,0.0012547572,0.00011973052,0.9946437],"study_design_scores_gemma":[0.01196709,0.005196268,0.029322874,0.007031428,0.00019955853,0.0013738197,0.00008032072,0.28256884,0.02475357,0.59585613,0.03152109,0.010129005],"about_ca_topic_score_codex":0.00005560084,"about_ca_topic_score_gemma":0.00042640974,"teacher_disagreement_score":0.9845147,"about_ca_system_score_codex":0.00022035981,"about_ca_system_score_gemma":0.00015819019,"threshold_uncertainty_score":0.999936},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028913288,0.00035185023,0.9953048,0.0010747003,0.00070213136,0.00016257014,0.000008737304,0.000094097224,0.0020119778],"genre_scores_gemma":[0.6884074,0.000017567236,0.31053925,0.00061657163,0.00028495977,0.0000017580188,0.0000053035196,0.00002081126,0.000106349245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964086,0.000039879327,0.0007960539,0.0012789385,0.0009997574,0.00047678628],"domain_scores_gemma":[0.9979044,0.00021683161,0.0006003168,0.00089603115,0.00020837013,0.00017404699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008340486,0.00044891614,0.00078293064,0.00042969012,0.00020020813,0.00035727976,0.0033956997,0.00020909985,0.000039673207],"category_scores_gemma":[0.000071307775,0.00039372005,0.0003006593,0.00068668433,0.0005909665,0.0006959064,0.0018399825,0.0007319472,0.00001574164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017242715,0.000051183557,0.00043891734,0.00021538827,0.0000826753,0.0002701447,0.0028669292,0.09415364,0.0008024917,0.06089583,0.000034081037,0.84017146],"study_design_scores_gemma":[0.00014786386,0.00027338063,0.000084114086,0.0005331694,0.000019268067,0.00004723982,0.0000011314286,0.77948457,0.0017729391,0.21631786,0.000687242,0.0006312501],"about_ca_topic_score_codex":0.0001239507,"about_ca_topic_score_gemma":0.00015453319,"teacher_disagreement_score":0.83954024,"about_ca_system_score_codex":0.00013182384,"about_ca_system_score_gemma":0.00043151522,"threshold_uncertainty_score":0.99985147},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016937609,0.00012563594,0.9943499,0.00068332016,0.00045245583,0.00027369743,8.428622e-7,0.000047784255,0.0023725764],"genre_scores_gemma":[0.8060125,0.000019397869,0.1928278,0.00018966787,0.0007343177,0.0000037297307,0.000013607711,0.000012978483,0.00018598023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982896,0.00008712348,0.0002877393,0.0005687414,0.0005960714,0.00017074552],"domain_scores_gemma":[0.9989418,0.00033583323,0.00028821733,0.00013008267,0.0002210347,0.000083059254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074788375,0.00015646413,0.00019603997,0.0003319036,0.0004841566,0.00023806484,0.00021976174,0.00016103439,0.000024654586],"category_scores_gemma":[0.00031143863,0.0001590787,0.000046431265,0.0004001329,0.00041985212,0.00036593407,0.00008895616,0.00025097994,0.0000047078292],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042505458,0.000005574832,0.0004670051,0.00001884527,0.0000050532826,0.0000025546756,0.0039434643,0.017290223,0.00060082186,0.03389212,7.406816e-7,0.94376934],"study_design_scores_gemma":[0.00007756342,0.000023827562,0.0013116403,0.0000617614,0.000020274028,0.000001741058,0.0000073878646,0.9222462,0.00006142865,0.07582924,0.00016926677,0.00018966438],"about_ca_topic_score_codex":0.00022953727,"about_ca_topic_score_gemma":0.00023448617,"teacher_disagreement_score":0.9435797,"about_ca_system_score_codex":0.00031135642,"about_ca_system_score_gemma":0.0004307885,"threshold_uncertainty_score":0.6487041},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005418985,0.00024534686,0.99539196,0.0008429635,0.00028419585,0.0004995147,0.00000245169,0.0001880428,0.0020035927],"genre_scores_gemma":[0.6243667,0.0000465284,0.37476736,0.0005348796,0.00016792289,0.000010746718,0.0000052624846,0.000044115957,0.00005648338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996169,0.00005298399,0.0005797905,0.0017910379,0.0008984099,0.00050878647],"domain_scores_gemma":[0.9983417,0.00043088014,0.00021281878,0.00059157814,0.00022243196,0.00020058746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005416701,0.00057950045,0.0005792211,0.0004224855,0.00034434424,0.00047264557,0.0011750027,0.00031999862,0.0000037049676],"category_scores_gemma":[0.000037102393,0.0005195414,0.000077506695,0.00050611957,0.00045022802,0.0019443585,0.0002053381,0.0014202636,0.000004818138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021217213,0.000010544903,0.00005019041,0.00006979171,0.0000147314895,0.000057786405,0.002577794,0.5661049,0.0007663511,0.020475714,3.0983125e-7,0.40985072],"study_design_scores_gemma":[0.00034708105,0.00021199265,0.000021463215,0.00042123115,0.000012567613,0.00005301215,9.667704e-7,0.90228945,0.0015324058,0.09445898,0.000044782388,0.0006060486],"about_ca_topic_score_codex":0.000060995306,"about_ca_topic_score_gemma":0.00015162815,"teacher_disagreement_score":0.6238248,"about_ca_system_score_codex":0.0001937846,"about_ca_system_score_gemma":0.0005022274,"threshold_uncertainty_score":0.99972564},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020997585,0.00005856356,0.99666184,0.00033681627,0.00024774126,0.00033287326,0.000012548725,0.00006953922,0.00018030505],"genre_scores_gemma":[0.8777457,0.000024580431,0.12167511,0.00023464047,0.00022706443,0.000020012616,0.000014481774,0.000016693462,0.00004173046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801254,0.00010200108,0.0002955857,0.0009364246,0.00037661794,0.00027681043],"domain_scores_gemma":[0.99878335,0.00041299177,0.00017926276,0.00025785487,0.00021192132,0.00015462033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014184202,0.00022871044,0.00032784155,0.00035213045,0.0008133675,0.00016528768,0.00033676613,0.00021055,0.000013385171],"category_scores_gemma":[0.000059749735,0.00020962858,0.000082738086,0.00041203276,0.0007400305,0.00018103268,0.000017086488,0.00026779153,4.7885516e-7],"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.00003258163,0.000010304503,0.000019278928,0.000019469479,0.0000087440185,0.0000010074633,0.0021709856,0.33467913,0.00028675466,0.0019729917,3.3122223e-8,0.6607987],"study_design_scores_gemma":[0.00018100481,0.00015880978,0.00007622173,0.00008543322,0.000054916007,0.0000036445533,0.000013101286,0.96301913,0.0003395681,0.03553782,0.00024455873,0.00028580055],"about_ca_topic_score_codex":0.0014048051,"about_ca_topic_score_gemma":0.04203591,"teacher_disagreement_score":0.87564594,"about_ca_system_score_codex":0.0002804502,"about_ca_system_score_gemma":0.0005018662,"threshold_uncertainty_score":0.97544444},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007458524,0.00025254968,0.9919775,0.0026968655,0.0015319558,0.00037573316,0.00010638797,0.00033945782,0.0026449605],"genre_scores_gemma":[0.25012392,0.00011446401,0.7372415,0.010702195,0.0014512996,0.0000090011945,0.00024799415,0.00008908859,0.000020518562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940261,0.000064099804,0.00060877827,0.0030751952,0.0014793868,0.00074643915],"domain_scores_gemma":[0.99228156,0.00068745314,0.00033370967,0.0062640673,0.00011789769,0.0003153442],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00096764945,0.0006795879,0.0006135291,0.0007457814,0.00037043836,0.0012290691,0.019130802,0.00030858055,0.000048880655],"category_scores_gemma":[0.00021925772,0.0006348005,0.0001346244,0.0009115448,0.00040199776,0.0016583097,0.016473694,0.0015738991,0.00011362053],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001223594,0.00006378488,0.00009800723,0.00011739126,0.000030767733,0.00038213242,0.0018876898,0.0031421683,0.00013273879,0.06352705,0.00046519144,0.93014085],"study_design_scores_gemma":[0.0003185458,0.00019084621,0.0002100444,0.0007233049,0.000011716248,0.000043993692,3.163003e-7,0.54450345,0.0003185976,0.4451931,0.0074442676,0.0010417955],"about_ca_topic_score_codex":0.000076832606,"about_ca_topic_score_gemma":0.00010865415,"teacher_disagreement_score":0.929099,"about_ca_system_score_codex":0.000119173426,"about_ca_system_score_gemma":0.0003683073,"threshold_uncertainty_score":0.9998078},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01705235,0.00030682568,0.797532,0.0046164836,0.0030508656,0.0006950742,0.000017897664,0.0002290317,0.17649947],"genre_scores_gemma":[0.98589045,0.00007726144,0.0077926693,0.005270622,0.00073956535,0.0000010375372,0.0000106877515,0.000013598172,0.00020408878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762875,0.00008882981,0.00045994506,0.0003307799,0.000960046,0.0005316604],"domain_scores_gemma":[0.9988611,0.00029277668,0.00024152256,0.00030249957,0.0001210139,0.000181111],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012943263,0.00027580105,0.00033000132,0.00036422565,0.0005130041,0.00057625386,0.0010375587,0.00028091113,0.00011285791],"category_scores_gemma":[0.00025621123,0.00027157384,0.00007259218,0.0005885223,0.0009238964,0.00056502625,0.0003384969,0.0006735099,0.000058558377],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011076517,0.000014322354,0.0010676619,0.000052890853,0.000006336999,0.000021120279,0.17397882,0.00797649,0.000007643687,0.01152246,0.000086729364,0.80525446],"study_design_scores_gemma":[0.004552417,0.0009345509,0.022689268,0.014524529,0.00008383507,0.00011103152,0.0060082264,0.5280263,0.00066481746,0.3118792,0.1026618,0.007864055],"about_ca_topic_score_codex":0.0014873615,"about_ca_topic_score_gemma":0.0048219915,"teacher_disagreement_score":0.9688381,"about_ca_system_score_codex":0.0006559654,"about_ca_system_score_gemma":0.0006990855,"threshold_uncertainty_score":0.99997365},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006371103,0.000366782,0.9935996,0.0018714488,0.0006242598,0.00033862694,0.0000058434484,0.00016447714,0.002391836],"genre_scores_gemma":[0.6786068,0.000046860467,0.3204507,0.00049979065,0.00025641095,0.00001076739,0.0000066160987,0.000030594838,0.000091462534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641204,0.000042047803,0.00059806934,0.0017781171,0.0006121517,0.00055758405],"domain_scores_gemma":[0.9981247,0.00049022323,0.00023905293,0.00081447023,0.00012462186,0.00020691601],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007408703,0.00046596673,0.000480204,0.00079129107,0.00024228694,0.00054786156,0.001588424,0.00020163228,0.0000010302842],"category_scores_gemma":[0.00010075151,0.00042319603,0.00004871207,0.0005577637,0.0002943402,0.0014916866,0.0012155775,0.0008242038,0.000006695202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016746373,0.00003537202,0.00021368718,0.00011513869,0.000015352323,0.00018085538,0.009095465,0.5139557,0.00008655165,0.2676163,0.000010209507,0.20865859],"study_design_scores_gemma":[0.0003532708,0.00006828153,0.00011741197,0.0007847926,0.0000045025813,0.00003626834,0.0000011477968,0.88510484,0.00007186815,0.11285828,0.0001268132,0.00047251582],"about_ca_topic_score_codex":0.00006654532,"about_ca_topic_score_gemma":0.00038583516,"teacher_disagreement_score":0.6779697,"about_ca_system_score_codex":0.0002616967,"about_ca_system_score_gemma":0.00038070936,"threshold_uncertainty_score":0.99982196},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008148318,0.00021854395,0.9798281,0.014017193,0.0012506478,0.0030553187,0.00006840982,0.0002595473,0.0012940427],"genre_scores_gemma":[0.44282472,0.00013761742,0.44813445,0.09922947,0.006104875,0.0009746613,0.00027381603,0.00045484968,0.0018655274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667877,0.00001838614,0.00045695767,0.0014761547,0.0008636513,0.0005060879],"domain_scores_gemma":[0.99774706,0.00069811434,0.00022426137,0.00080745236,0.00025300196,0.00027011018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004942772,0.00049750024,0.00074574724,0.0005501101,0.00018577898,0.00014827281,0.0007439768,0.00027953868,0.000012811901],"category_scores_gemma":[0.00014924054,0.0004550075,0.00020083021,0.00039077926,0.0004510935,0.00009287838,0.0005573565,0.00056976196,0.000035792964],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046609825,0.00022824631,0.0002306509,0.012752435,0.000419692,0.0019841378,0.003816459,0.025080932,0.00011847866,0.012302858,0.0047315513,0.9378685],"study_design_scores_gemma":[0.005074949,0.0023375894,0.0009831149,0.024354473,0.0008116126,0.00025532828,0.000008883269,0.71593463,0.002221243,0.013807117,0.23222728,0.001983798],"about_ca_topic_score_codex":0.000015469408,"about_ca_topic_score_gemma":0.000022011565,"teacher_disagreement_score":0.93588465,"about_ca_system_score_codex":0.0014767121,"about_ca_system_score_gemma":0.00057678146,"threshold_uncertainty_score":0.9997902},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012991156,0.00017378313,0.9820809,0.010440336,0.004768451,0.0006100876,0.000004387748,0.00030749312,0.00031548226],"genre_scores_gemma":[0.59947455,0.0000055931855,0.38599604,0.012430954,0.0019300864,0.000012663293,0.000012196588,0.00004969196,0.00008819365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937932,0.00023131576,0.0012819923,0.0025192464,0.0012484925,0.00092574046],"domain_scores_gemma":[0.9962585,0.0014311491,0.00043012804,0.0011503636,0.00024578904,0.0004840527],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025253515,0.0005747927,0.0007920154,0.0007184115,0.0002727743,0.00038062295,0.0028576874,0.00052870676,0.000015853351],"category_scores_gemma":[0.0006995576,0.0005708138,0.00015033188,0.0011376308,0.00027288523,0.0004487354,0.0025801726,0.003182094,0.000049952123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012872736,0.00001237234,0.0025469644,0.000024104136,0.0000034090724,0.00013140668,0.00025638114,0.6207753,0.000004991475,0.0025144832,0.000082415114,0.37363532],"study_design_scores_gemma":[0.00027837415,0.0004445051,0.003763059,0.0004638902,0.0000036540541,0.0000615215,1.1116077e-7,0.9852196,0.0000113094,0.008776558,0.00050554884,0.0004718461],"about_ca_topic_score_codex":0.00014107267,"about_ca_topic_score_gemma":0.00018288242,"teacher_disagreement_score":0.59817547,"about_ca_system_score_codex":0.0003611359,"about_ca_system_score_gemma":0.0005025054,"threshold_uncertainty_score":0.9996743},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011219704,0.0002884173,0.99235815,0.0014711852,0.004416924,0.00052514364,0.0000103457405,0.00032006312,0.0004975649],"genre_scores_gemma":[0.83670723,0.000039828745,0.15686148,0.004195811,0.0020069277,0.00004420666,0.000012537566,0.00008107586,0.000050875184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580854,0.000086267224,0.00052176166,0.0018594066,0.0011008544,0.0006231696],"domain_scores_gemma":[0.9977204,0.00026943188,0.0005286958,0.001030227,0.0002667683,0.00018444657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005290997,0.000550953,0.00042727435,0.00044267206,0.00047371915,0.00053011137,0.0016638712,0.00038504734,0.000017280961],"category_scores_gemma":[0.000055061293,0.0005717467,0.00013553834,0.0010875774,0.000478838,0.0007978465,0.00036439722,0.001067936,0.000023419043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026082413,0.000012743865,0.000026478105,0.00002793111,0.0000063903103,0.000009502879,0.00006303917,0.4885868,0.007041803,0.00042318658,0.00008660479,0.5036894],"study_design_scores_gemma":[0.00025223874,0.000240463,0.00010671231,0.00022502085,0.000013600279,0.000011972187,7.706675e-8,0.9845042,0.006071245,0.0071871593,0.00083430303,0.00055297173],"about_ca_topic_score_codex":0.00009113205,"about_ca_topic_score_gemma":0.0000969307,"teacher_disagreement_score":0.83659506,"about_ca_system_score_codex":0.0017966413,"about_ca_system_score_gemma":0.0005516342,"threshold_uncertainty_score":0.9996734},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019602475,0.000091591326,0.99710035,0.0009091377,0.00079965394,0.00040328703,0.000010086891,0.00018304729,0.00030679058],"genre_scores_gemma":[0.08219323,0.000013546759,0.91517025,0.002134426,0.00042645575,0.000006399275,0.0000063868656,0.000021648371,0.000027627922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659294,0.00002224535,0.0007954317,0.0013779105,0.0008374315,0.00037404473],"domain_scores_gemma":[0.99772596,0.00014881184,0.0004773253,0.0012143106,0.00028329808,0.00015027556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004606154,0.0003853913,0.0006082618,0.00066482654,0.00014797495,0.00013667955,0.0019749077,0.00022091586,0.0000030066954],"category_scores_gemma":[0.00009398036,0.0003886591,0.00015734119,0.0007518513,0.00024919544,0.0006225666,0.00143877,0.00056068535,0.0000019895085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011381286,0.000044872217,0.00019644835,0.00008882315,0.000023858174,0.0003076144,0.00067882775,0.61947197,0.005235881,0.011864377,0.000077480116,0.36199844],"study_design_scores_gemma":[0.00008140344,0.00017498675,0.000019604533,0.00024436568,0.000016341948,0.000040282015,8.287468e-8,0.8794293,0.01323822,0.10558382,0.00085966726,0.000311942],"about_ca_topic_score_codex":0.000055565608,"about_ca_topic_score_gemma":0.000021698263,"teacher_disagreement_score":0.3616865,"about_ca_system_score_codex":0.0003700841,"about_ca_system_score_gemma":0.0003903056,"threshold_uncertainty_score":0.99985653},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001531732,0.0001921184,0.9848402,0.01115096,0.00018145719,0.003004165,0.000008786012,0.00020172758,0.00040526275],"genre_scores_gemma":[0.023849286,0.0000107756,0.97188586,0.0038646348,0.00022526554,0.000107450316,0.0000020929351,0.00002337195,0.000031279764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667394,0.000047944948,0.0005104965,0.0013286317,0.0009963203,0.0004426426],"domain_scores_gemma":[0.9974485,0.0006554385,0.00027183094,0.0012830038,0.00010797396,0.0002332335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005339566,0.00044519966,0.0004240508,0.00044072105,0.00022046706,0.00057310413,0.0027051088,0.0002836971,0.000006039941],"category_scores_gemma":[0.00017928383,0.0003551291,0.00008296803,0.0008457193,0.0008853969,0.0003172802,0.0006615402,0.0012596799,0.000005249343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012586273,0.00002297276,0.000024310437,0.00003565768,0.0000038681897,0.00003974793,0.00395462,0.09288603,0.000012186796,0.41759896,0.000019183217,0.4853899],"study_design_scores_gemma":[0.00017076658,0.00006720501,0.000005292132,0.00028379008,0.000004079006,0.000025649528,6.7818206e-7,0.51460123,0.00043875744,0.48326233,0.00089616986,0.0002440655],"about_ca_topic_score_codex":0.000016941945,"about_ca_topic_score_gemma":0.000021982678,"teacher_disagreement_score":0.48514584,"about_ca_system_score_codex":0.00021470082,"about_ca_system_score_gemma":0.0016128302,"threshold_uncertainty_score":0.9998901},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011129652,0.00015644298,0.9674768,0.018780813,0.0019385372,0.000833837,0.00004144723,0.00009181825,0.009567332],"genre_scores_gemma":[0.9263625,0.00013001083,0.06683218,0.005002511,0.0013303424,0.0000050393824,0.0000034653312,0.0000386301,0.00029529448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696857,0.00019674239,0.0003917174,0.0006942696,0.001256715,0.00049199635],"domain_scores_gemma":[0.99732506,0.0010128499,0.00032288255,0.00031724665,0.0007424718,0.0002795094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003059742,0.00027677143,0.0005489021,0.0002946474,0.00062375225,0.00045836793,0.0007860842,0.00043879997,0.000007955662],"category_scores_gemma":[0.0019884524,0.0002677758,0.00010144798,0.00041746115,0.0012844229,0.00035167756,0.0004079182,0.00089783256,0.000017387329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041964435,0.000040890427,0.0028402712,0.00043069915,0.00011047007,0.00016538105,0.18524563,0.03268901,0.00043312923,0.5548615,0.00061841676,0.22252268],"study_design_scores_gemma":[0.00051874225,0.0005937811,0.0018619845,0.004935129,0.000098218705,0.000010261729,0.00015063946,0.027769992,0.002214392,0.91621715,0.042455558,0.0031741562],"about_ca_topic_score_codex":0.005287369,"about_ca_topic_score_gemma":0.0057233786,"teacher_disagreement_score":0.9252496,"about_ca_system_score_codex":0.00040065366,"about_ca_system_score_gemma":0.0021461714,"threshold_uncertainty_score":0.99997747},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006699663,0.0004027049,0.9878012,0.008402558,0.000990846,0.00020932194,0.000007158903,0.00028119527,0.0018380529],"genre_scores_gemma":[0.4812528,0.00019576526,0.5070837,0.007155032,0.0015760513,0.000009363284,0.000022700666,0.0000813734,0.0026232386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955937,0.000047306912,0.00053041644,0.0017235151,0.0014527651,0.00065227476],"domain_scores_gemma":[0.99742866,0.000485858,0.00031046252,0.0011808925,0.0002824606,0.00031169644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006313833,0.0005771211,0.0006882118,0.0005065225,0.00025782958,0.0008222674,0.004607376,0.00027470337,0.00003101211],"category_scores_gemma":[0.00021181164,0.0005250815,0.00020260223,0.00078483036,0.00064282975,0.00041023977,0.002179238,0.0013895365,0.00019567266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010192838,0.00011671313,0.001306623,0.00011634598,0.00007705153,0.0007491643,0.0036686598,0.06798823,0.00014792079,0.25869647,0.00013758217,0.66698503],"study_design_scores_gemma":[0.0005730052,0.00039762433,0.0004012636,0.0005345627,0.000025513846,0.000053299907,6.298496e-7,0.84994197,0.00017373473,0.13537529,0.0112591665,0.0012639479],"about_ca_topic_score_codex":0.000009123265,"about_ca_topic_score_gemma":0.000015254102,"teacher_disagreement_score":0.78195375,"about_ca_system_score_codex":0.00025173588,"about_ca_system_score_gemma":0.0008188661,"threshold_uncertainty_score":0.9997201},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09385627,0.00034087218,0.89881825,0.00032768754,0.004227199,0.00067553774,0.0000014958963,0.0017210892,0.000031581],"genre_scores_gemma":[0.85195154,0.000011251161,0.1471008,0.00017037934,0.0006561531,0.0000471192,0.000006192524,0.000044498014,0.000012058345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99282944,0.00063198863,0.0011047024,0.0028621017,0.0012789204,0.0012928718],"domain_scores_gemma":[0.9970348,0.00039446726,0.0005778913,0.0012732629,0.0003538178,0.00036577077],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0023816954,0.0007969594,0.0010162586,0.0010873583,0.000404168,0.002129915,0.0047135213,0.00041300818,0.000002839165],"category_scores_gemma":[0.00037327028,0.0007723116,0.00021114027,0.0023880869,0.0002870739,0.0009302466,0.0040570428,0.0028410864,0.00004082486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015239928,0.000073164556,0.0037355726,0.00046049958,0.000018227069,0.00028412326,0.016981844,0.8953494,0.0060507264,0.0075470824,0.0000019248098,0.06948224],"study_design_scores_gemma":[0.0002590374,0.00021828123,0.0025179137,0.0018515994,0.000005384471,0.00003925769,0.000046192636,0.9886999,0.0046730353,0.0006639796,0.00020241871,0.0008229757],"about_ca_topic_score_codex":0.00055158563,"about_ca_topic_score_gemma":0.00006486023,"teacher_disagreement_score":0.75809526,"about_ca_system_score_codex":0.0015068055,"about_ca_system_score_gemma":0.000877911,"threshold_uncertainty_score":0.9994728},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006514638,0.001541481,0.9912753,0.00019249051,0.00020111965,0.00009947129,0.000020771466,0.000009936867,0.00014480832],"genre_scores_gemma":[0.94203854,0.00022334229,0.057112485,0.0002712913,0.00031897248,0.0000057414686,0.0000039083025,0.000013676799,0.000012041266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990083,0.000011559037,0.00015356024,0.0005129962,0.00016355136,0.00015004411],"domain_scores_gemma":[0.9995784,0.000025193402,0.000098129225,0.00018222077,0.000050559076,0.00006548312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011299262,0.00016112524,0.00020736993,0.00008832199,0.000053059855,0.000023461986,0.0002338369,0.00025985893,0.0000037597047],"category_scores_gemma":[0.00003619698,0.00013703236,0.00004279304,0.00009908836,0.00064938527,0.0000027030937,0.00024920158,0.00017314461,1.4700004e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022466504,0.000013256397,0.0010969343,0.000087498156,0.00002032316,0.0000038366034,0.00010523278,0.0012776604,0.021007981,0.00002137006,0.0000048878705,0.97633857],"study_design_scores_gemma":[0.0018506448,0.001858326,0.009296352,0.0018123551,0.0002182172,0.00075075286,0.000006748711,0.68532187,0.27624908,0.013240795,0.0065944646,0.0028003943],"about_ca_topic_score_codex":0.000046595313,"about_ca_topic_score_gemma":0.000042925778,"teacher_disagreement_score":0.97353816,"about_ca_system_score_codex":0.00002307915,"about_ca_system_score_gemma":0.00011534187,"threshold_uncertainty_score":0.5588017},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011941867,0.00035706372,0.99580485,0.0016250584,0.0005093882,0.00022202403,0.0000015705812,0.00005425834,0.0002315904],"genre_scores_gemma":[0.9324204,0.000071046255,0.06656496,0.00065995404,0.00022202183,0.00000587346,0.000008112866,0.000018778188,0.000028855384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978128,0.00003698417,0.00043591898,0.00094756996,0.0004132017,0.00035350674],"domain_scores_gemma":[0.99869335,0.00048045223,0.00024101166,0.0003848644,0.00007815077,0.00012219774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037787817,0.00028754733,0.00038671942,0.0002849543,0.00014840224,0.00015295245,0.0011328197,0.0001534081,0.0000031205448],"category_scores_gemma":[0.00003689144,0.00027082124,0.000062107036,0.0005961159,0.00034271338,0.00024119209,0.0011843833,0.0011981159,0.0000012393591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023510036,0.000009739881,0.00013757216,0.00001556075,0.0000017060488,0.00001892551,0.000099913064,0.49182096,0.000026449025,0.012805379,0.0000032022829,0.49505827],"study_design_scores_gemma":[0.00011461467,0.000098043114,0.00022990364,0.0002648581,0.0000023611137,0.00002199232,9.974403e-8,0.98399186,0.00003311556,0.014946934,0.00004630063,0.00024992562],"about_ca_topic_score_codex":0.000010712937,"about_ca_topic_score_gemma":0.00007798214,"teacher_disagreement_score":0.9312262,"about_ca_system_score_codex":0.000104509825,"about_ca_system_score_gemma":0.00010404669,"threshold_uncertainty_score":0.99997437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036624228,0.0000618455,0.9905375,0.0009290483,0.0007430374,0.00031389663,0.000013687092,0.000077026176,0.0069576725],"genre_scores_gemma":[0.9113209,0.000006536643,0.086041294,0.0014049788,0.00055594277,0.0000056013864,0.000008716393,0.000025192534,0.00063079677],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961094,0.00005506737,0.00075467076,0.001085803,0.0017015467,0.00029348567],"domain_scores_gemma":[0.997272,0.00084941625,0.0005083978,0.00088812876,0.0003194969,0.00016255918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017335169,0.00030087435,0.00038479286,0.00066955603,0.00052366627,0.00056583626,0.0018681833,0.0002135407,0.00017268295],"category_scores_gemma":[0.00055119745,0.00023572131,0.00013983458,0.0009806838,0.0006128113,0.0008358378,0.00073919835,0.00053774146,0.00045606462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008088187,0.00001635816,0.00003471007,0.00000845022,0.0000033139718,0.000005401945,0.0009537698,0.09795336,0.0009280676,0.034554005,0.00016537438,0.8653691],"study_design_scores_gemma":[0.000083626364,0.000044399047,0.000042386124,0.000075150536,0.00000463673,0.00002318172,0.0000019832426,0.38671055,0.0014545448,0.602521,0.008780514,0.0002580035],"about_ca_topic_score_codex":0.0000035798798,"about_ca_topic_score_gemma":0.0000098223745,"teacher_disagreement_score":0.9109547,"about_ca_system_score_codex":0.00017747002,"about_ca_system_score_gemma":0.00022617452,"threshold_uncertainty_score":0.9612436},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013601594,0.00025796023,0.99557906,0.0008973709,0.00086990034,0.00060845003,0.00002834947,0.0009649822,0.0006579025],"genre_scores_gemma":[0.17551182,0.000014145049,0.82252145,0.0009733326,0.00073813443,0.000026082687,0.000060073256,0.00007008135,0.000084882755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950519,0.0000610922,0.00073419895,0.0023698793,0.0009335541,0.0008493743],"domain_scores_gemma":[0.9958953,0.0019204764,0.00051365036,0.0011932226,0.00023660265,0.0002407208],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008933637,0.0007146688,0.00081953034,0.0004702875,0.00048763285,0.0011100183,0.0047796513,0.0003856813,0.000011643803],"category_scores_gemma":[0.000730954,0.0007132372,0.00020795353,0.0004770754,0.00038162703,0.00084954605,0.0027291873,0.0010984088,0.000029032599],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013691664,0.000019117262,0.00019348567,0.00004026378,0.00003164876,0.00008886845,0.001080823,0.015040266,0.001009953,0.011017068,0.00008076204,0.97138405],"study_design_scores_gemma":[0.00040122142,0.00035981688,0.000026420772,0.0008157438,0.00002399494,0.000015205553,5.438546e-7,0.9013393,0.009576868,0.0828817,0.003618296,0.00094090204],"about_ca_topic_score_codex":0.00006871963,"about_ca_topic_score_gemma":0.00010344752,"teacher_disagreement_score":0.9704431,"about_ca_system_score_codex":0.00021983265,"about_ca_system_score_gemma":0.0005804128,"threshold_uncertainty_score":0.9999269},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010044076,0.00013614769,0.9949281,0.00016010067,0.0010457599,0.0009730336,0.00013494173,0.0001171796,0.0015003138],"genre_scores_gemma":[0.024315393,0.00002966674,0.9738915,0.00056522526,0.0005135083,0.000061083265,0.000040101477,0.00007033794,0.0005132166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614567,0.00032554974,0.0010134274,0.0013979712,0.0004955562,0.0006218315],"domain_scores_gemma":[0.9905402,0.008195916,0.00046882895,0.00051198946,0.00011165584,0.00017140723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031257889,0.00048713415,0.0010950711,0.00029781877,0.00018439436,0.00005444367,0.00085858174,0.00060290284,0.00009504175],"category_scores_gemma":[0.005006608,0.0004414244,0.00016592348,0.00022258404,0.0006071676,0.00008462692,0.0007145296,0.0015891158,0.00001501546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014963567,0.0005189794,0.05294149,0.0057235924,0.0003335739,0.0005996447,0.005655309,0.19275934,0.0008980634,0.13719559,0.0017384932,0.60013956],"study_design_scores_gemma":[0.0004592107,0.00024193362,0.0006378998,0.000141511,0.00002966465,0.00006376551,2.6938363e-7,0.5788345,0.00009269641,0.41889256,0.0003014884,0.00030453334],"about_ca_topic_score_codex":0.00007998576,"about_ca_topic_score_gemma":0.00013867424,"teacher_disagreement_score":0.59983504,"about_ca_system_score_codex":0.0005729134,"about_ca_system_score_gemma":0.00017548524,"threshold_uncertainty_score":0.9998038},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018036817,0.000275672,0.9940043,0.0012918701,0.0009830592,0.0005020371,0.0000018093099,0.00026229085,0.0026609052],"genre_scores_gemma":[0.0028389883,0.0000697306,0.9904285,0.00408478,0.0013933557,0.000018271889,0.000008534051,0.0000309013,0.0011269096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616265,0.000033946486,0.00064005656,0.0014754464,0.0009036797,0.0007841882],"domain_scores_gemma":[0.9968893,0.00048093867,0.0003046387,0.0019082999,0.00019089274,0.00022594529],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005841758,0.00053823704,0.00056373497,0.00051535404,0.00026826755,0.00082878507,0.0050090337,0.0002764051,0.000012461515],"category_scores_gemma":[0.000019878818,0.0004664584,0.0001671334,0.0013915142,0.00040866618,0.00041636566,0.0013776034,0.00087907084,0.00013731078],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.487862e-7,0.00008246906,0.0000028830666,0.000025184543,0.000005043964,0.000035840836,0.00034074855,0.05214795,0.000016627986,0.017283928,0.0021413758,0.9279174],"study_design_scores_gemma":[0.00008029784,0.000113992406,0.000026951646,0.00024363294,0.0000047611175,0.00006680625,3.108146e-8,0.78184664,0.00029912623,0.20894055,0.007907162,0.00047001737],"about_ca_topic_score_codex":0.0000044441867,"about_ca_topic_score_gemma":0.000017454751,"teacher_disagreement_score":0.9274474,"about_ca_system_score_codex":0.00035782382,"about_ca_system_score_gemma":0.00061570713,"threshold_uncertainty_score":0.9997787},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062981277,0.0005686619,0.9685661,0.027246572,0.0023604077,0.0003441536,0.000010331858,0.00021361094,0.000060348077],"genre_scores_gemma":[0.4585717,0.000045082594,0.53972095,0.0015051999,0.00013213078,0.000012614189,0.0000057297316,0.00000576794,7.8413706e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628544,0.00009586202,0.00040349475,0.0018161446,0.0008038906,0.0005951797],"domain_scores_gemma":[0.9940047,0.0009896111,0.00018316138,0.0045291665,0.0001688746,0.00012446426],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013748526,0.00030066987,0.00030615376,0.0001717557,0.0005858118,0.0022073614,0.021979677,0.00014541476,7.0815224e-7],"category_scores_gemma":[0.0010255465,0.0002057686,0.000058996884,0.0012810415,0.00066293473,0.00076204946,0.02502072,0.0009021865,0.000019867884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020503535,0.00002060932,0.00012256706,0.000019243485,0.000007726205,0.000021723545,0.0016425415,0.6198604,0.00007349251,0.0069681713,0.00022115116,0.3710403],"study_design_scores_gemma":[0.00006157172,0.000015068429,0.00043577323,0.000040491333,0.000003117946,0.000007145058,8.716476e-7,0.75687104,0.00022827077,0.24207217,0.00006440381,0.00020006977],"about_ca_topic_score_codex":0.000083173116,"about_ca_topic_score_gemma":0.00029406467,"teacher_disagreement_score":0.4579419,"about_ca_system_score_codex":0.00009494823,"about_ca_system_score_gemma":0.0015429057,"threshold_uncertainty_score":0.9988285},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020239699,0.00009640171,0.9962146,0.00014478521,0.0011355756,0.0005705259,0.000019642506,0.00032040378,0.001295668],"genre_scores_gemma":[0.29130286,0.0000031739153,0.70816064,0.00028057655,0.00018341687,0.000011372672,0.0000034177724,0.0000309262,0.00002362843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953888,0.00016774442,0.0008122655,0.0019139944,0.0012023114,0.00051489746],"domain_scores_gemma":[0.996082,0.00012786294,0.0006975196,0.0021753681,0.00058969215,0.00032752944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013294205,0.0005766526,0.000747984,0.0006388163,0.00019564552,0.0003041718,0.0052799275,0.00037846863,0.0000035704704],"category_scores_gemma":[0.00008416442,0.0005416869,0.00014200603,0.00073364447,0.00052917906,0.0019343391,0.00093040656,0.0007186169,0.000018263552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003043817,0.000068793095,0.0000024864514,0.000121175035,0.00001589114,0.000044189946,0.0041944995,0.4191655,0.0045089405,0.22294539,0.0000021273706,0.3489006],"study_design_scores_gemma":[0.00015315964,0.0007520924,0.000026445114,0.00039091764,0.000011159509,0.000035631096,0.000001727174,0.94989556,0.01827038,0.02993028,0.000016498532,0.0005161355],"about_ca_topic_score_codex":0.000012702555,"about_ca_topic_score_gemma":0.000011861867,"teacher_disagreement_score":0.53073007,"about_ca_system_score_codex":0.00046406494,"about_ca_system_score_gemma":0.00078293774,"threshold_uncertainty_score":0.99970347},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021910523,0.002577911,0.95341086,0.008620155,0.0014774299,0.0016431094,0.000036388785,0.00018470912,0.029858407],"genre_scores_gemma":[0.9941012,0.00007355471,0.0037265837,0.0014029072,0.00058676966,0.0000085230295,0.0000018761431,0.000020346368,0.00007819687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729586,0.00006301614,0.0004944138,0.000748264,0.00090761366,0.0004908102],"domain_scores_gemma":[0.99825066,0.0005990496,0.00041429407,0.00031002134,0.0002114601,0.00021453484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006173817,0.00032236168,0.0007729831,0.00030744937,0.00046321,0.0005098002,0.0016635661,0.00028921672,0.000038417475],"category_scores_gemma":[0.0002735225,0.00028880624,0.00009691252,0.00039667916,0.00206119,0.0005149516,0.0005196696,0.00057605904,0.00000556518],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001234347,0.00010045989,0.024220338,0.00031271088,0.0001053109,0.00004687543,0.034541488,0.009377284,0.00032675307,0.10424273,0.00009342206,0.8265092],"study_design_scores_gemma":[0.008072958,0.0017753463,0.017745998,0.003937197,0.0004867983,0.00002735493,0.00013585821,0.45095664,0.0017546867,0.42532182,0.08391739,0.005867957],"about_ca_topic_score_codex":0.0010241662,"about_ca_topic_score_gemma":0.0015852054,"teacher_disagreement_score":0.9919102,"about_ca_system_score_codex":0.00012100615,"about_ca_system_score_gemma":0.0005988598,"threshold_uncertainty_score":0.9999564},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012920702,0.00025356794,0.9964481,0.00010737466,0.0015587977,0.000469788,0.000006022753,0.00015193697,0.00087519625],"genre_scores_gemma":[0.4284636,0.0000025824752,0.5711719,0.00016673977,0.00017068065,0.0000013116019,6.725006e-7,0.000017474435,0.0000050730587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638855,0.00008447482,0.00085015944,0.0011927427,0.0010452349,0.0004388553],"domain_scores_gemma":[0.9975718,0.00017893047,0.00047476965,0.0012620469,0.0003590004,0.00015345404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013710232,0.00041685867,0.0007069652,0.00058256247,0.00014527039,0.00021287308,0.0031491816,0.00026971428,0.0000025335892],"category_scores_gemma":[0.00015039553,0.00040102322,0.00016440853,0.00065453036,0.0003231921,0.0006025177,0.0007526068,0.00059217424,0.0000120863215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008849481,0.0000083727655,0.00000782366,0.0001353677,0.000011330588,0.000020801834,0.00033359602,0.87738025,0.0010553993,0.075174056,3.3351898e-7,0.04586382],"study_design_scores_gemma":[0.0002562897,0.0000826893,0.0000034935806,0.000623921,0.000014224566,0.000057245783,3.7628544e-7,0.9835215,0.0015177029,0.01355053,0.000013247556,0.00035876897],"about_ca_topic_score_codex":0.000031791587,"about_ca_topic_score_gemma":0.0000034851396,"teacher_disagreement_score":0.42833441,"about_ca_system_score_codex":0.00042950953,"about_ca_system_score_gemma":0.00057643524,"threshold_uncertainty_score":0.9998442},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014455296,0.000033739307,0.9923316,0.0031532182,0.0006903185,0.00054185494,0.0000048697407,0.00009184834,0.0017070251],"genre_scores_gemma":[0.99026656,0.000024048895,0.0044710217,0.0047418843,0.00026409636,0.00001700236,0.0000033275944,0.000022433298,0.0001896014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980075,0.00006691098,0.00021939361,0.0008990518,0.0005965976,0.00021058458],"domain_scores_gemma":[0.99889284,0.00046847155,0.0001876069,0.00031159367,0.000054641896,0.00008484007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029647208,0.00025257142,0.00021013846,0.00016224003,0.0003342532,0.0002630098,0.00038585332,0.00011436446,0.000022084598],"category_scores_gemma":[0.000120571145,0.00016575797,0.000042233765,0.00031743405,0.0016992966,0.00024194735,0.00014121814,0.000534015,0.000025492483],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011818989,0.000045461817,0.00011401624,0.00008126815,0.000016121225,0.00007859478,0.0027662336,0.012642845,0.0259253,0.050302133,0.000047492253,0.90679866],"study_design_scores_gemma":[0.004323576,0.00089030433,0.0012330298,0.00020196178,0.000063537904,0.00041658533,0.0000070185697,0.87170386,0.052705295,0.06474753,0.002742839,0.0009644581],"about_ca_topic_score_codex":0.000010357509,"about_ca_topic_score_gemma":0.000044461107,"teacher_disagreement_score":0.988821,"about_ca_system_score_codex":0.00010863263,"about_ca_system_score_gemma":0.00011200639,"threshold_uncertainty_score":0.6759414},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014079446,0.00031996384,0.99311537,0.00023494266,0.0034696262,0.00037222935,0.000013246089,0.00075827184,0.00030841483],"genre_scores_gemma":[0.15169188,0.00001909987,0.8460819,0.0007602763,0.000846183,0.000018478353,0.000037007943,0.00009708682,0.00044806208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936712,0.00006167823,0.00063886185,0.0023465112,0.0021323496,0.0011494099],"domain_scores_gemma":[0.99277526,0.0037262375,0.0002572667,0.0024959533,0.00036153305,0.00038375202],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009702638,0.00075865944,0.0007848765,0.0012515908,0.00030722705,0.00067497377,0.0055913217,0.00046605474,0.00006391668],"category_scores_gemma":[0.0010662808,0.00075494696,0.00018229726,0.0009186713,0.00061381405,0.00045642286,0.0029587492,0.0012626358,0.00026315264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015800888,0.00005643006,0.0043095374,0.00010250591,0.000067760295,0.00037750037,0.0020240115,0.041542917,0.0005568993,0.0037825406,0.00026915816,0.94689494],"study_design_scores_gemma":[0.0012448337,0.00042181357,0.00607227,0.002129308,0.000022382721,0.00010717267,3.2709437e-7,0.93312687,0.0038759976,0.03800178,0.01218195,0.0028153067],"about_ca_topic_score_codex":0.00009667028,"about_ca_topic_score_gemma":0.000034271812,"teacher_disagreement_score":0.94407964,"about_ca_system_score_codex":0.0005318062,"about_ca_system_score_gemma":0.00046084408,"threshold_uncertainty_score":0.9997889},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019817927,0.00023044494,0.99609995,0.00004742825,0.0012078743,0.00020669373,0.0000048713227,0.00011510773,0.00010586621],"genre_scores_gemma":[0.9581691,0.000011994268,0.041408256,0.00015382118,0.00017953193,5.80255e-7,0.00003177248,0.000036687918,0.000008259271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985808,0.000015935198,0.000383766,0.000412927,0.00037448737,0.00023204689],"domain_scores_gemma":[0.9992362,0.0001445736,0.00012431014,0.00029724554,0.000105613995,0.000092035894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000121064004,0.00027679477,0.00036339991,0.00029385643,0.000068914705,0.00006063092,0.0003399873,0.0001878776,0.000020601972],"category_scores_gemma":[0.000024941324,0.00029071848,0.000099388104,0.0003277081,0.00017206899,0.0001412117,0.00012764233,0.0005495723,0.000002819503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072921057,0.000007384988,0.00010123017,0.000032038424,0.0000096215335,0.000016840138,0.00009074828,0.9613311,0.00036118584,0.00030905355,0.0000032332543,0.03773025],"study_design_scores_gemma":[0.0002331655,0.00003034166,0.00037925766,0.00012751826,0.000016017982,0.000030349756,2.0493805e-7,0.9978032,0.00015488398,0.000961952,0.0000058674455,0.00025724075],"about_ca_topic_score_codex":0.000015840851,"about_ca_topic_score_gemma":0.000040150066,"teacher_disagreement_score":0.9561873,"about_ca_system_score_codex":0.0001777906,"about_ca_system_score_gemma":0.000032410746,"threshold_uncertainty_score":0.9999545},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026582569,0.00020523813,0.99686295,0.000491508,0.0003003736,0.00080737536,0.000002140348,0.00039303993,0.00067152525],"genre_scores_gemma":[0.56882316,0.000029501029,0.4299431,0.0006460855,0.00040109712,0.00003648455,0.0000013641031,0.000033730383,0.00008546233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975782,0.000023286218,0.00034146715,0.0012841977,0.00043303275,0.00033979162],"domain_scores_gemma":[0.99883634,0.00006455638,0.0002537621,0.0005305567,0.00016405358,0.00015070417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002753632,0.00037400686,0.00031296955,0.00050998176,0.0004087968,0.00042615912,0.000915853,0.00035754766,0.000007807128],"category_scores_gemma":[0.000025513069,0.0003719919,0.000076475,0.0008875159,0.00028415947,0.0005599834,0.00055564096,0.00079166744,0.000009426425],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017222803,0.000022515673,0.000120468016,0.00006376284,0.000014844983,0.000014113406,0.00024452826,0.0027757066,0.014238468,0.016911425,0.000006305485,0.9655706],"study_design_scores_gemma":[0.00013837162,0.0004599858,0.0002605486,0.00012799488,0.000014452108,0.00022089307,1.0848387e-7,0.8978084,0.024458462,0.072718054,0.003177531,0.0006152084],"about_ca_topic_score_codex":0.000050282906,"about_ca_topic_score_gemma":0.00006696563,"teacher_disagreement_score":0.96495545,"about_ca_system_score_codex":0.00025177837,"about_ca_system_score_gemma":0.00024668247,"threshold_uncertainty_score":0.9998732},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054746077,0.0012350156,0.9937271,0.0011963648,0.0004592648,0.00077629567,0.00011900267,0.00037793303,0.0020543174],"genre_scores_gemma":[0.5537948,0.000053105352,0.44160143,0.00415171,0.00023781284,0.00002038287,0.00006981258,0.00006017135,0.0000107732385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99427634,0.00008400732,0.00055063353,0.0026800209,0.0015650576,0.0008439384],"domain_scores_gemma":[0.9962135,0.0005803265,0.00044552705,0.0020575442,0.0003082229,0.00039486054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006899143,0.00091707293,0.00088428456,0.00096850056,0.00039881747,0.0008243509,0.004835255,0.00048440875,0.000027590315],"category_scores_gemma":[0.000077394325,0.0007603727,0.000269989,0.0017410927,0.0011956673,0.000990211,0.0013755094,0.0019303563,0.00002289898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039278588,0.00033056305,0.00019193953,0.0006077042,0.0002160919,0.002337774,0.0052825143,0.043003473,0.00025748703,0.51034194,0.00047357648,0.43656415],"study_design_scores_gemma":[0.0006873793,0.00073491014,0.00013525778,0.00091696874,0.00003305004,0.000039797975,6.1831224e-7,0.74246734,0.0004318624,0.2505918,0.0026146125,0.0013464147],"about_ca_topic_score_codex":0.000031356587,"about_ca_topic_score_gemma":0.00028042664,"teacher_disagreement_score":0.69946384,"about_ca_system_score_codex":0.00023965456,"about_ca_system_score_gemma":0.0008185898,"threshold_uncertainty_score":0.9994847},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022696979,0.000060429906,0.99341303,0.00088228955,0.0008446118,0.0004399889,0.000002376105,0.0006388529,0.0036957152],"genre_scores_gemma":[0.19485031,0.000020541374,0.8026041,0.0019704276,0.00036022288,0.0000959026,0.000002305702,0.000038094156,0.000058132286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967017,0.00006392917,0.00047170534,0.0016617043,0.00063718157,0.00046375804],"domain_scores_gemma":[0.9976548,0.00029955513,0.00027473015,0.0013965042,0.0001567715,0.00021766937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007105604,0.00048380214,0.00042792805,0.0008071391,0.00039416066,0.00042922967,0.002243535,0.00023389643,0.00001792732],"category_scores_gemma":[0.00007512267,0.00047542754,0.00017864325,0.001093463,0.00027443032,0.0005859268,0.00060703483,0.00089489867,0.000057421577],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035514418,0.000016245069,0.0000017790478,0.000014102809,0.0000037824382,0.000014213991,0.0001048745,0.025600629,0.0014478413,0.008558211,0.0000031443676,0.9642316],"study_design_scores_gemma":[0.000115754076,0.00033117936,0.000064919586,0.00008325535,0.0000065322506,0.000017751307,1.288916e-7,0.89755416,0.065377265,0.031966105,0.0039780955,0.00050482916],"about_ca_topic_score_codex":0.000027194103,"about_ca_topic_score_gemma":0.000026728729,"teacher_disagreement_score":0.9637268,"about_ca_system_score_codex":0.0003391708,"about_ca_system_score_gemma":0.00021753613,"threshold_uncertainty_score":0.99976975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008422712,0.000056317585,0.99025327,0.000041328505,0.00055972347,0.0002025614,0.000043608976,0.00010442672,0.0003160477],"genre_scores_gemma":[0.9850445,0.000017530818,0.0142660225,0.00028682523,0.00028214906,0.000002185641,0.00006592909,0.000025891015,0.000008969658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988239,0.000013628879,0.0002313282,0.00042406292,0.00033897563,0.0001681088],"domain_scores_gemma":[0.9994863,0.00014359308,0.00008049771,0.000086291846,0.00011847863,0.00008481815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016960534,0.00020546268,0.00017821137,0.0001895927,0.000083331186,0.000121838624,0.00010306819,0.0001063382,0.00001930536],"category_scores_gemma":[0.000063676984,0.0002223901,0.000026986112,0.00017264226,0.00021385013,0.0002521438,0.00008661165,0.00035334987,0.0000067619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016768014,0.0000047059984,0.000043016917,0.00007554995,0.000011438385,0.000017511331,0.0009710475,0.13525143,0.0017346914,0.00039260802,0.0000010654032,0.8614802],"study_design_scores_gemma":[0.0002526317,0.00006580747,0.00031279298,0.00031086968,0.000012359473,0.000013997026,6.4993293e-7,0.9872648,0.0022498155,0.009237821,0.000014689371,0.00026373615],"about_ca_topic_score_codex":0.000025259094,"about_ca_topic_score_gemma":0.000035171364,"teacher_disagreement_score":0.9766218,"about_ca_system_score_codex":0.00014527909,"about_ca_system_score_gemma":0.000089942936,"threshold_uncertainty_score":0.90688044},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016145493,0.0001266796,0.99410635,0.00032167128,0.00027138478,0.00051582983,0.000012903546,0.00014873449,0.004334973],"genre_scores_gemma":[0.51222825,0.0000032319474,0.48607284,0.00045445716,0.0010567448,0.00003090471,0.000030943687,0.00004951651,0.000073112686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744534,0.000013762172,0.0004564167,0.0011178813,0.0004338433,0.00053275836],"domain_scores_gemma":[0.9982809,0.00047946375,0.00024171884,0.00067132595,0.00016691905,0.00015971473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031271885,0.00047641416,0.0007743636,0.00038802877,0.00026938732,0.00034073956,0.0013059197,0.00016215439,0.00013467764],"category_scores_gemma":[0.000020457699,0.0004702778,0.000342849,0.0005615624,0.00036136957,0.00014807816,0.00057917077,0.0007764486,0.000014974701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034485653,0.00006604219,0.003327637,0.00009648546,0.00015934372,0.000009309929,0.0006104651,0.036115464,0.00014168608,0.5485757,0.00041181687,0.41045156],"study_design_scores_gemma":[0.00012955195,0.000053652777,0.000022567967,0.00033863253,0.00003439911,6.6634243e-7,3.2059557e-7,0.2938038,0.00054211426,0.7030724,0.0015913084,0.00041053485],"about_ca_topic_score_codex":0.000039089762,"about_ca_topic_score_gemma":0.000013810513,"teacher_disagreement_score":0.5120668,"about_ca_system_score_codex":0.0000903665,"about_ca_system_score_gemma":0.00014978605,"threshold_uncertainty_score":0.9997749},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16522847,0.000050070266,0.8340322,0.000050903207,0.00029548167,0.00012589524,0.0000012899776,0.00018455417,0.000031176907],"genre_scores_gemma":[0.9493883,0.0000381454,0.050264623,0.00010748072,0.00014466397,0.000004426682,0.00003871646,0.000013362212,2.313635e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863434,0.00006341567,0.000317599,0.0003782454,0.00036528407,0.00024108902],"domain_scores_gemma":[0.99936664,0.00017037486,0.00013088477,0.00014615584,0.000116948955,0.00006899851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002928913,0.00022549447,0.00026780507,0.0004867614,0.0001778363,0.00041058447,0.00019589404,0.00015496982,0.0000025186773],"category_scores_gemma":[0.0004722235,0.00023574285,0.00004010764,0.00072514475,0.00008467617,0.00044270206,0.00026065574,0.0009978792,0.0000044836756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053340204,0.0000022815032,0.00095674465,0.000052630385,0.00001012564,0.0000019722622,0.004214435,0.8768591,0.00029383705,0.0000019407103,3.649543e-7,0.11760123],"study_design_scores_gemma":[0.00015838207,0.000039341274,0.00052521063,0.0002190833,0.000016760538,0.000003468574,0.000013146758,0.9970626,0.0013296478,0.0004022883,0.0000027462006,0.00022732062],"about_ca_topic_score_codex":0.00005129695,"about_ca_topic_score_gemma":0.0000086544205,"teacher_disagreement_score":0.7841599,"about_ca_system_score_codex":0.00016285399,"about_ca_system_score_gemma":0.000078036035,"threshold_uncertainty_score":0.9613314},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023149996,0.00014898412,0.9914312,0.0021579526,0.0018593628,0.00054888835,0.000014631259,0.0020109683,0.0015965078],"genre_scores_gemma":[0.6228952,0.0000054944076,0.37306803,0.0024676265,0.0014231784,0.000010671593,0.00002150362,0.00005795659,0.000050321327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948284,0.00006715474,0.0008772037,0.002155049,0.0011482618,0.0009239192],"domain_scores_gemma":[0.99605507,0.00067177013,0.00036162377,0.0011508829,0.001348115,0.0004125621],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011778228,0.00061939453,0.0006608259,0.00079853233,0.0007279552,0.0017745915,0.0032203824,0.000398729,0.000013871595],"category_scores_gemma":[0.0020124824,0.00067476893,0.000100531,0.0018647953,0.0001752166,0.0010263693,0.0024815372,0.0012288964,0.000038419217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012096793,0.000062013125,0.00068777724,0.0002122279,0.000063601634,0.0005920324,0.023750324,0.29967132,0.0054948987,0.320928,0.00012757008,0.34839812],"study_design_scores_gemma":[0.00033476547,0.00008023583,0.00015515955,0.0009566224,0.000011571094,0.00006491462,0.0000033508868,0.9861182,0.0015641556,0.009619762,0.00024253156,0.00084870536],"about_ca_topic_score_codex":0.000017695384,"about_ca_topic_score_gemma":0.000018011804,"teacher_disagreement_score":0.6864469,"about_ca_system_score_codex":0.0007847907,"about_ca_system_score_gemma":0.0010058318,"threshold_uncertainty_score":0.99957037},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064732577,0.0013520789,0.98361045,0.0036009008,0.0037937434,0.0010494455,0.000006139106,0.00010000554,0.000013978356],"genre_scores_gemma":[0.4947365,0.000027219889,0.50377357,0.00091920316,0.00042111246,0.00010604398,0.0000076092447,0.0000072733337,0.0000014640846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966899,0.00011455226,0.0004680277,0.0014719835,0.00070931326,0.0005461848],"domain_scores_gemma":[0.99606186,0.0018428984,0.00028482723,0.001044022,0.0006746977,0.00009168067],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001504789,0.00035168248,0.00035437968,0.0003396394,0.0005716418,0.0015648176,0.0029344633,0.00017270843,0.0000023079124],"category_scores_gemma":[0.00034663567,0.0002739065,0.00016612007,0.002091088,0.0002617053,0.0006074381,0.002227644,0.00071986014,0.0000019118913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003633418,0.000026459007,0.000032279422,0.00003606077,0.0000088386205,0.0000035941546,0.0015216105,0.630451,0.000218326,0.00087346,0.000008532602,0.3668162],"study_design_scores_gemma":[0.000259268,0.00005948283,0.0005244461,0.0001782418,0.000007438032,0.000011223924,0.000001919089,0.92457837,0.0110429535,0.06289596,0.0001307051,0.00030998478],"about_ca_topic_score_codex":0.00004085833,"about_ca_topic_score_gemma":0.00013638887,"teacher_disagreement_score":0.48826322,"about_ca_system_score_codex":0.00023240274,"about_ca_system_score_gemma":0.0013577947,"threshold_uncertainty_score":0.99997133},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011903367,0.0007160275,0.9786434,0.011991566,0.0044757607,0.0027606466,0.000004441892,0.00019264432,0.000025152582],"genre_scores_gemma":[0.5676296,0.00002572614,0.43000212,0.0016591878,0.0004929737,0.00015667186,0.000005552671,0.000019897248,0.000008290818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945221,0.00034143796,0.00075643987,0.0019959696,0.0014252322,0.00095884],"domain_scores_gemma":[0.9961622,0.0004241613,0.00044866538,0.0024115173,0.00027672522,0.00027675292],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0030781054,0.0005314373,0.00044037422,0.00020461697,0.0011156665,0.0027598713,0.007640918,0.00018289346,9.2798115e-7],"category_scores_gemma":[0.00027718747,0.0003084421,0.00018436727,0.0015854713,0.00033403715,0.00031321836,0.00444729,0.0010319104,0.00005889364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011177474,0.00026280034,0.0008319904,0.000100692225,0.00004135153,0.000015560592,0.023923341,0.35526225,0.0006469236,0.0018724633,0.0003851388,0.61664635],"study_design_scores_gemma":[0.00028196294,0.00009090315,0.0028541572,0.00020874373,0.0000072764196,0.000013646031,0.000006996816,0.9898236,0.00084070064,0.0005008155,0.004920207,0.00045102317],"about_ca_topic_score_codex":0.00073443435,"about_ca_topic_score_gemma":0.00057833793,"teacher_disagreement_score":0.6345613,"about_ca_system_score_codex":0.00047667598,"about_ca_system_score_gemma":0.0007761556,"threshold_uncertainty_score":0.99993676},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002920728,0.00030389294,0.9924814,0.00033365688,0.00398893,0.00068693445,0.000014173015,0.00047732436,0.0014215861],"genre_scores_gemma":[0.11562715,0.000040252045,0.88025653,0.0010664174,0.00092718727,0.000037372836,0.000038703474,0.000107708285,0.001898649],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940237,0.00027328735,0.0010315174,0.0020584373,0.0017276556,0.00088545046],"domain_scores_gemma":[0.9940931,0.0029055774,0.00061066734,0.0017486393,0.00044558995,0.0001964257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033168066,0.0006346182,0.00093332987,0.0014686674,0.00022001004,0.00044692153,0.00510573,0.00036838706,0.000015261217],"category_scores_gemma":[0.0003198733,0.00060235173,0.00025314133,0.0029327795,0.0013627232,0.0006347941,0.003523143,0.0008110884,0.000101594254],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007489436,0.00010946499,0.00010277681,0.00016009071,0.000024009161,0.00007741697,0.0012650483,0.11902012,0.00012660766,0.009374169,0.00017810438,0.8695547],"study_design_scores_gemma":[0.00023597703,0.00021287387,0.00062593736,0.00025124307,0.000007690979,0.000030353636,4.734748e-7,0.48049572,0.0007614936,0.5167873,0.00011284573,0.0004781058],"about_ca_topic_score_codex":0.000021451564,"about_ca_topic_score_gemma":0.000035243047,"teacher_disagreement_score":0.8690766,"about_ca_system_score_codex":0.00082553114,"about_ca_system_score_gemma":0.0016990378,"threshold_uncertainty_score":0.9996428},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030583143,0.000428112,0.9918114,0.002144055,0.0004139879,0.00024171281,0.000017243214,0.00006699905,0.0018181838],"genre_scores_gemma":[0.8121818,0.0000142028985,0.18654543,0.0009892216,0.00021643734,0.000002845892,0.000011705749,0.000011907002,0.000026492897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971053,0.000058322144,0.0005047229,0.0010499915,0.00090098934,0.00038065604],"domain_scores_gemma":[0.99787164,0.0004941434,0.00027584375,0.0011882242,0.00010010312,0.00007002735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008381135,0.00033780318,0.00048874697,0.00056303776,0.00012410368,0.00034881907,0.0049195983,0.00014924673,0.0000069703888],"category_scores_gemma":[0.00014798243,0.0002342514,0.00013013124,0.0011806545,0.00047763938,0.00043784772,0.0010742447,0.000747317,0.000010155834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001760363,0.000055572047,0.0063559315,0.00026669164,0.00006952846,0.00044188558,0.009252321,0.06800844,0.0044949073,0.12130966,0.00012423797,0.78960323],"study_design_scores_gemma":[0.0001485144,0.0000979629,0.00023435547,0.00020512535,0.000010790125,0.000028794182,0.0000012302671,0.9551056,0.0010819952,0.042595815,0.000141258,0.00034858313],"about_ca_topic_score_codex":0.000024059756,"about_ca_topic_score_gemma":0.00008286746,"teacher_disagreement_score":0.8870971,"about_ca_system_score_codex":0.00006282143,"about_ca_system_score_gemma":0.00037274955,"threshold_uncertainty_score":0.9552495},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025236815,0.000044638244,0.9878015,0.0012458017,0.0003201496,0.000663618,0.0000024009826,0.000616938,0.0092797475],"genre_scores_gemma":[0.031193918,0.000009154638,0.9653944,0.0026861678,0.00037133697,0.00002522322,0.000024090708,0.000039017294,0.0002566936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533325,0.0001219712,0.0006155144,0.0019751461,0.0014080912,0.0005460055],"domain_scores_gemma":[0.9972948,0.00019939434,0.0002815383,0.0014745952,0.00025842656,0.0004912812],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012058336,0.00048332108,0.00049325125,0.0005922767,0.00027972285,0.0015042961,0.0051086317,0.00023418169,0.00002588377],"category_scores_gemma":[0.00043015697,0.00046515305,0.00009753713,0.0008127528,0.00041441567,0.0018274694,0.0016188375,0.0011458297,0.000038491744],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009033425,0.00007292178,0.000025426536,0.00011002162,0.000010012335,0.00008323471,0.0042964886,0.011735445,0.016884763,0.009357405,0.00018097399,0.95723426],"study_design_scores_gemma":[0.00023093227,0.00040151068,0.000072032344,0.00029018222,0.00000793697,0.000027421534,0.0000016638407,0.94589925,0.019263549,0.032586966,0.00037371423,0.0008448144],"about_ca_topic_score_codex":0.000038565515,"about_ca_topic_score_gemma":0.000020505742,"teacher_disagreement_score":0.9563895,"about_ca_system_score_codex":0.0002265112,"about_ca_system_score_gemma":0.00035543882,"threshold_uncertainty_score":0.99978},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033461107,0.00018469493,0.99517477,0.002000894,0.00026528095,0.00029245124,0.000011511433,0.00020873423,0.0018282245],"genre_scores_gemma":[0.13230313,0.000024672572,0.8660399,0.0010155339,0.0003116355,0.000012946452,0.0000070586125,0.000033497614,0.00025164825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602205,0.00011101368,0.00045770462,0.0019305985,0.0009507862,0.0005278766],"domain_scores_gemma":[0.9961526,0.0012719253,0.0003852684,0.001577169,0.00037680424,0.00023626158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087538105,0.00051883917,0.000558394,0.00088226824,0.0004834956,0.0008313359,0.0034841967,0.00020111208,0.000018588542],"category_scores_gemma":[0.00030822522,0.00043047295,0.00011033974,0.0016521894,0.00063721807,0.0006957857,0.00094029104,0.000939382,0.00010143163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008443176,0.000061336636,0.00007744468,0.000042605574,0.00016101975,0.0008084515,0.007120449,0.12718159,0.0028453218,0.034367863,0.00023988131,0.8270096],"study_design_scores_gemma":[0.00033249284,0.00052213133,0.00006194149,0.00045190557,0.000044314093,0.0001289985,0.0000030624938,0.95693296,0.006376148,0.031705692,0.0023800316,0.0010603218],"about_ca_topic_score_codex":0.00000997611,"about_ca_topic_score_gemma":0.000057329926,"teacher_disagreement_score":0.8297514,"about_ca_system_score_codex":0.00023375648,"about_ca_system_score_gemma":0.001319525,"threshold_uncertainty_score":0.9998147},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031602174,0.00017274138,0.9644215,0.0014508694,0.0011992065,0.0008839634,0.000013710041,0.00025345047,0.00000235036],"genre_scores_gemma":[0.48338628,0.0000032088487,0.5153883,0.00082244724,0.0003046235,0.000070047005,0.000013870271,0.000010933737,3.0080878e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962991,0.00011031543,0.00051004806,0.0018515979,0.0006878096,0.00054113765],"domain_scores_gemma":[0.9977305,0.00043067543,0.00026119698,0.0011271058,0.0003207193,0.00012983575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012992577,0.000358636,0.00036582196,0.00032744877,0.00027436708,0.00074473047,0.0017100293,0.00023543043,6.7994046e-7],"category_scores_gemma":[0.0011351856,0.0003573185,0.00012829567,0.0005712802,0.00011046072,0.00043134167,0.0022102618,0.0005948816,0.000004324469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029223456,0.000025987978,0.00006357756,0.000054019252,0.0000033081699,0.000005756943,0.0026456295,0.8196637,0.008254548,0.00036154015,0.0000024757576,0.16891655],"study_design_scores_gemma":[0.00046943795,0.000054161843,0.000055318847,0.000104885876,0.000006714839,0.00000889509,6.903194e-7,0.9672149,0.006299736,0.025408866,7.2966594e-7,0.00037567143],"about_ca_topic_score_codex":0.00005698181,"about_ca_topic_score_gemma":0.00016222052,"teacher_disagreement_score":0.4517841,"about_ca_system_score_codex":0.00024097049,"about_ca_system_score_gemma":0.00069316395,"threshold_uncertainty_score":0.9998879},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013073661,0.00019280773,0.9850715,0.0019548703,0.001145774,0.00057392614,6.7568476e-7,0.00011703947,0.010930379],"genre_scores_gemma":[0.97754794,0.000011496141,0.019008134,0.0029107078,0.0002760879,0.000025742615,0.000007723582,0.000012250144,0.00019990203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978143,0.00008549747,0.00049960776,0.00056849397,0.00064643344,0.00038566513],"domain_scores_gemma":[0.99820095,0.0005694763,0.00025858657,0.0007473256,0.00013980735,0.0000838224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012179267,0.00028473855,0.00029124678,0.0004197248,0.00023992007,0.0008470674,0.0024803898,0.00014552144,0.000008523394],"category_scores_gemma":[0.00016384883,0.00020148222,0.00008053063,0.0006293323,0.00034558508,0.0010691081,0.0007945838,0.0006210125,0.00006949267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000406612,0.0000072647263,0.00013645428,0.000024604178,0.000006618478,0.000022497292,0.006880418,0.007414026,0.0000051468855,0.66837645,0.00002847518,0.31709397],"study_design_scores_gemma":[0.0003008179,0.00007842362,0.000382756,0.000039107486,0.0000045631436,0.0000333185,0.000005134254,0.2688026,0.000092451446,0.7216252,0.008277399,0.00035822066],"about_ca_topic_score_codex":0.000067752604,"about_ca_topic_score_gemma":0.00006875595,"teacher_disagreement_score":0.9775349,"about_ca_system_score_codex":0.00014550636,"about_ca_system_score_gemma":0.00037400887,"threshold_uncertainty_score":0.82162064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008352546,0.00013655926,0.96766406,0.025408939,0.0044685947,0.001030977,0.000017123934,0.0003900729,0.000048388778],"genre_scores_gemma":[0.32729834,0.000014256174,0.6662455,0.005706451,0.0006475212,0.00005633743,0.0000102722215,0.000020409472,8.7474984e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99324477,0.00024981992,0.0007126765,0.0031236263,0.0016479557,0.0010211527],"domain_scores_gemma":[0.99483246,0.0010165097,0.0003211872,0.0028308125,0.00032108932,0.0006779197],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001135642,0.00065693306,0.00083724456,0.0006764063,0.00034682054,0.0041411677,0.011032592,0.000335095,0.000018070046],"category_scores_gemma":[0.0008781418,0.00055985816,0.0001641107,0.0026856388,0.00030906056,0.0019391386,0.028336493,0.0017508579,0.00008800258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009074,0.00024860384,0.00033923323,0.00013611544,0.000022435815,0.00044262895,0.0015745872,0.33121756,0.001335083,0.00073783303,0.0026539492,0.66120124],"study_design_scores_gemma":[0.0006674783,0.000107280226,0.0016670015,0.00032721472,0.000007293517,0.000042362266,1.8626437e-7,0.95779216,0.007146137,0.030431025,0.0011014234,0.00071045035],"about_ca_topic_score_codex":0.00014059064,"about_ca_topic_score_gemma":0.000028987397,"teacher_disagreement_score":0.6604908,"about_ca_system_score_codex":0.00020979124,"about_ca_system_score_gemma":0.0012524321,"threshold_uncertainty_score":0.9996853},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001686089,0.00031941276,0.9945617,0.0033392666,0.00024196223,0.0003572869,0.00008366434,0.000030421666,0.0008977218],"genre_scores_gemma":[0.7759166,0.000051751726,0.22167142,0.0015643329,0.0004501423,0.0000061761593,0.000112337046,0.00002524544,0.00020199765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791867,0.000031752836,0.00041796043,0.0008296899,0.0005755731,0.00022636249],"domain_scores_gemma":[0.99730974,0.0005907431,0.00026717017,0.001480595,0.00024635476,0.00010540722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097645394,0.00023568174,0.00060006377,0.00016836231,0.000110728935,0.000120936464,0.001404864,0.000087075925,0.000025295136],"category_scores_gemma":[0.00018804075,0.00014955799,0.00013492654,0.00021269503,0.00067780685,0.00017862335,0.00048378308,0.00049641577,0.000001615628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010966226,0.0001649318,0.011051677,0.00088420964,0.0003550876,0.000058770423,0.000745599,0.029749632,0.007250832,0.0026742944,0.0004694287,0.9464859],"study_design_scores_gemma":[0.00028163422,0.00035690473,0.002617113,0.00061369623,0.00024423294,0.000017247881,0.0000018959969,0.9898787,0.000743722,0.003929956,0.001083333,0.00023154773],"about_ca_topic_score_codex":0.00008434754,"about_ca_topic_score_gemma":0.0000266445,"teacher_disagreement_score":0.9601291,"about_ca_system_score_codex":0.00007655839,"about_ca_system_score_gemma":0.0004329997,"threshold_uncertainty_score":0.6098798},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002482703,0.0011022042,0.99344903,0.0008236262,0.002551368,0.0003552073,0.0000010533362,0.00030948393,0.0011597654],"genre_scores_gemma":[0.9109217,0.0002270363,0.08472994,0.0024096628,0.0014231083,0.000015739697,0.000010927375,0.000060639562,0.00020126757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959952,0.0001027906,0.0005965724,0.0017406462,0.0008458247,0.0007189666],"domain_scores_gemma":[0.99818045,0.00048118818,0.00028731217,0.0007224209,0.00012239533,0.00020624333],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00078915723,0.000544483,0.00059945683,0.0008112944,0.000291034,0.0006951471,0.0028488517,0.0005987069,0.000051644063],"category_scores_gemma":[0.00012553262,0.00053933077,0.00015786318,0.0013719389,0.0003361246,0.0007033455,0.0012539622,0.0028312914,0.000032216074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006084773,0.000009751534,0.000006170076,0.000010976246,0.0000032685775,0.000081184,0.0004424947,0.5974243,0.000014997337,0.0020853889,0.00004704052,0.39986834],"study_design_scores_gemma":[0.00025975218,0.00024949832,0.0000934809,0.00036469905,0.0000035722767,0.000018899711,2.2688927e-7,0.9788534,0.00009294662,0.015481334,0.0040029204,0.0005792809],"about_ca_topic_score_codex":0.000012711107,"about_ca_topic_score_gemma":0.00020284872,"teacher_disagreement_score":0.9106734,"about_ca_system_score_codex":0.00026197024,"about_ca_system_score_gemma":0.00026069762,"threshold_uncertainty_score":0.99970585},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010589039,0.0011217488,0.99400866,0.002730586,0.00039958162,0.00036024244,0.000004317189,0.000087664,0.00022828538],"genre_scores_gemma":[0.9460871,0.00008130796,0.048865143,0.004257797,0.00059122,0.000004223214,0.000019557838,0.0000559507,0.000037655165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773973,0.000025354726,0.00040313433,0.0008303098,0.0007381862,0.00026328003],"domain_scores_gemma":[0.99831176,0.000498205,0.00030078867,0.00048041478,0.00024205617,0.00016677841],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021001598,0.0002870439,0.00053178926,0.0005022929,0.000114166214,0.00006237775,0.0003920954,0.00019096328,0.000018332954],"category_scores_gemma":[0.00027847692,0.0002753614,0.00013099276,0.00038827735,0.0004894187,0.00016869788,0.00027834802,0.0006090175,0.000004025359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000615618,0.00008092048,0.0034690453,0.0007953828,0.00004390073,0.00009741758,0.0013945384,0.7341627,0.0034601274,0.0017378721,0.000029425288,0.25466713],"study_design_scores_gemma":[0.00024279737,0.000102047125,0.0009507334,0.0012545413,0.000106171916,0.000014819993,3.7258133e-7,0.9881936,0.00037903147,0.008082661,0.0004348545,0.00023838051],"about_ca_topic_score_codex":0.00002561616,"about_ca_topic_score_gemma":0.000006239164,"teacher_disagreement_score":0.9451435,"about_ca_system_score_codex":0.000460858,"about_ca_system_score_gemma":0.0006480087,"threshold_uncertainty_score":0.99996984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007091543,0.0009939914,0.9917356,0.0016752545,0.0012213547,0.0003363125,0.0000036151343,0.00025669966,0.0030680252],"genre_scores_gemma":[0.65234154,0.00001215313,0.3428075,0.003695117,0.00090494024,0.0000073052306,0.0000074495974,0.000024450854,0.00019952498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963792,0.000042892792,0.00044324066,0.0017139592,0.00091633346,0.0005043819],"domain_scores_gemma":[0.99841464,0.0002171509,0.00020341107,0.0008202258,0.00016430815,0.00018026514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032193883,0.000487694,0.00042278733,0.00037079284,0.00018400926,0.00072208536,0.0029228113,0.00025640344,0.000031021307],"category_scores_gemma":[0.00007491116,0.0003696516,0.00009928765,0.00062539504,0.00066079176,0.00075176416,0.0006382312,0.0010163913,0.0000998699],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009652253,0.000023161007,0.000010962226,0.000010399409,0.0000070678207,0.00041421587,0.0027647733,0.0036070324,0.0012854106,0.017563995,0.000045227494,0.9742581],"study_design_scores_gemma":[0.00015365017,0.00065132906,0.00012114155,0.00024386219,0.000008365547,0.00036340827,7.0632854e-7,0.9232827,0.008690287,0.06479244,0.0006626406,0.0010294694],"about_ca_topic_score_codex":0.0000052372657,"about_ca_topic_score_gemma":0.000045178575,"teacher_disagreement_score":0.97322863,"about_ca_system_score_codex":0.0001344423,"about_ca_system_score_gemma":0.0001941652,"threshold_uncertainty_score":0.99987555},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17206658,0.00051540864,0.82241046,0.0011637008,0.00012852791,0.00038772446,0.0011000524,0.000045601002,0.00218196],"genre_scores_gemma":[0.9811388,0.0000110404335,0.015762633,0.0009972124,0.0000710744,2.0326024e-7,0.0020121536,0.000002671662,0.0000041669455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981441,0.00017076364,0.00033045956,0.0007477244,0.00044955447,0.00015739619],"domain_scores_gemma":[0.9969159,0.0021070328,0.00021647847,0.0006252154,0.00003652977,0.00009889391],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00076453894,0.00018226654,0.0003487171,0.00015308119,0.00024466487,0.00006837083,0.0009125205,0.00007420959,0.0011409709],"category_scores_gemma":[0.00008866359,0.000117037336,0.0000429517,0.00030253755,0.0003560309,0.00020160695,0.0001855298,0.00035660536,0.0000050470708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046315574,0.000015041577,0.11825758,0.0000052054365,0.00009262014,0.0000024100175,0.0008415535,0.67328364,0.00008243425,0.0014489901,0.0000017903255,0.2059224],"study_design_scores_gemma":[0.000065632245,0.00012735277,0.20552796,0.0000059221848,0.00004279852,1.0516741e-7,0.0000014445554,0.71066093,0.000016397758,0.08329548,0.00014307392,0.000112908296],"about_ca_topic_score_codex":0.004509248,"about_ca_topic_score_gemma":0.009846627,"teacher_disagreement_score":0.80907226,"about_ca_system_score_codex":0.000006257618,"about_ca_system_score_gemma":0.000040281146,"threshold_uncertainty_score":0.99977213},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001852954,0.00017970495,0.99550444,0.0011776391,0.0013216449,0.0010851988,0.000022783728,0.00034612027,0.00017719936],"genre_scores_gemma":[0.81532913,0.00005804483,0.18179683,0.0017378638,0.00072112336,0.00022203232,0.00002517902,0.000039035884,0.000070769805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965074,0.00004416461,0.00063631305,0.001616665,0.0006314837,0.000563994],"domain_scores_gemma":[0.9980449,0.00045001996,0.00027635822,0.0006455784,0.00034167818,0.00024146054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005585971,0.00045608153,0.0004295998,0.00087284815,0.0003736896,0.00028360795,0.0017102967,0.0003169551,0.000023252647],"category_scores_gemma":[0.00008701107,0.00047656888,0.00016023248,0.001546675,0.00033748566,0.00038576027,0.00065306254,0.00088866975,0.000016885533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026620917,0.000030542087,0.000036530462,0.0000159715,0.0000064092274,0.000006844884,0.00006573292,0.08633596,0.00029145827,0.011381724,0.000022429398,0.9017798],"study_design_scores_gemma":[0.00021102773,0.00034244792,0.00044280727,0.0002012225,0.000006009736,0.00004610269,1.7843622e-7,0.9514794,0.0024312828,0.040302385,0.004033463,0.00050372],"about_ca_topic_score_codex":0.00005809465,"about_ca_topic_score_gemma":0.00027859438,"teacher_disagreement_score":0.90127605,"about_ca_system_score_codex":0.0004467503,"about_ca_system_score_gemma":0.00031930415,"threshold_uncertainty_score":0.9997686},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027904726,0.0024457239,0.9941233,0.0006878998,0.0011106855,0.000296773,0.000002729102,0.00020709085,0.00084677874],"genre_scores_gemma":[0.742305,0.00030390517,0.25345117,0.0024962819,0.001296793,0.00001626542,0.00001513897,0.000052516603,0.0000629827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968335,0.000046222864,0.00052966294,0.0014592977,0.0005604659,0.00057082344],"domain_scores_gemma":[0.9984668,0.00041977293,0.00016082665,0.00064826134,0.00012523508,0.0001791146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063623674,0.00043033864,0.00047408772,0.00034375058,0.0003264897,0.0005275359,0.0011281422,0.00030338127,0.000004803164],"category_scores_gemma":[0.000092516166,0.00042847267,0.00007361561,0.0010173685,0.00024462224,0.00059901987,0.0011259456,0.00086026674,0.000008663222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000321248,0.000008068859,0.00034871802,0.00002468129,0.000004833773,0.000030072486,0.00080989645,0.8163361,0.000002903876,0.019499728,0.000018050294,0.16291374],"study_design_scores_gemma":[0.00014845392,0.000058892612,0.000042142958,0.00042148642,0.0000044693666,0.000019435498,3.0396293e-7,0.7524617,0.00000579271,0.24641606,0.000090504094,0.00033077892],"about_ca_topic_score_codex":0.000034777997,"about_ca_topic_score_gemma":0.00019635094,"teacher_disagreement_score":0.7420259,"about_ca_system_score_codex":0.0001480939,"about_ca_system_score_gemma":0.0002900603,"threshold_uncertainty_score":0.9998167},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011331386,0.00007403745,0.9738077,0.02313598,0.0011638683,0.0008203339,0.00006750907,0.00072422123,0.00019503695],"genre_scores_gemma":[0.041076362,0.000040336992,0.95787877,0.0005863516,0.00017993778,0.000035223024,0.000099578414,0.000048872866,0.00005456328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619985,0.000027445505,0.0005222441,0.0018447228,0.0007913678,0.00061435293],"domain_scores_gemma":[0.9932061,0.0005416456,0.000391249,0.005457974,0.00025372364,0.00014932605],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00036236213,0.0005555495,0.00051618804,0.0006080141,0.0003154006,0.00069243205,0.026461458,0.00037387796,0.000014599961],"category_scores_gemma":[0.0017619303,0.00047727732,0.000095588024,0.00078246335,0.0006550218,0.00091386517,0.033329755,0.00078661455,0.00001894633],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003207421,0.000055150867,0.00007099297,0.00014343533,0.000054157852,0.000039007005,0.00021591355,0.00772814,0.00033059556,0.07937092,0.0022121808,0.9097474],"study_design_scores_gemma":[0.00026930356,0.0002395559,0.000025594982,0.00021738805,0.000010299605,0.000014363477,1.0741334e-7,0.53011227,0.0020221383,0.46317104,0.0034479261,0.000470025],"about_ca_topic_score_codex":0.000008490216,"about_ca_topic_score_gemma":0.000045247343,"teacher_disagreement_score":0.9092774,"about_ca_system_score_codex":0.00036928564,"about_ca_system_score_gemma":0.00043906938,"threshold_uncertainty_score":0.9997679},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000089238616,0.0006591509,0.9933377,0.0036974396,0.000571531,0.00038429827,0.000004774094,0.00018066147,0.001075212],"genre_scores_gemma":[0.47084892,0.00006868892,0.5229307,0.0053409357,0.00037412703,0.000017831875,0.000009450302,0.00007816311,0.00033121696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559194,0.00009107855,0.0007332917,0.0017942481,0.0010262185,0.00076324237],"domain_scores_gemma":[0.9980485,0.00046116803,0.00028423392,0.0008796024,0.00011273475,0.00021377919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010444224,0.00056773465,0.0006237015,0.0006042156,0.00025550232,0.00072550104,0.002871449,0.0002881484,0.00001735364],"category_scores_gemma":[0.000078389196,0.00054353115,0.00013941065,0.00081684015,0.0002963289,0.0008290444,0.0009780126,0.0012950336,0.000022512753],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063508364,0.0000372905,0.00004370486,0.00011241445,0.000008564179,0.00033390976,0.0024343838,0.006173728,0.0083379,0.001048848,0.00006827083,0.98139465],"study_design_scores_gemma":[0.00083614385,0.00029958205,0.00012726513,0.0014044797,0.000012059106,0.00005300821,0.000001652987,0.88423187,0.061147537,0.04678062,0.0035911165,0.0015146758],"about_ca_topic_score_codex":0.00007029693,"about_ca_topic_score_gemma":0.00005887801,"teacher_disagreement_score":0.97988,"about_ca_system_score_codex":0.00036734281,"about_ca_system_score_gemma":0.00047246172,"threshold_uncertainty_score":0.9997016},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034597333,0.00085932144,0.9938489,0.0023486686,0.0011400641,0.0004716712,0.0000063095868,0.00023558894,0.0007434941],"genre_scores_gemma":[0.7709366,0.00007772773,0.22471136,0.0031628672,0.0009585533,0.000023212788,0.000034069555,0.000056608085,0.000038992977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99547315,0.00009046311,0.0007342009,0.0020465131,0.00074888556,0.000906774],"domain_scores_gemma":[0.997981,0.00052418275,0.0004106574,0.00063031126,0.00021216145,0.00024168074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050055276,0.0006745599,0.0007241546,0.0007698754,0.0005035738,0.00037159384,0.0023309262,0.00040822825,0.000007932888],"category_scores_gemma":[0.000036905367,0.0006946617,0.00017283593,0.0019511495,0.0015577928,0.0007538651,0.0013938494,0.0014318972,0.000014319686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052147923,0.00007718737,0.0015549702,0.00009857755,0.000030768966,0.00013277303,0.0020540429,0.15081263,0.00061802054,0.2914935,0.0005771642,0.5524982],"study_design_scores_gemma":[0.00028951076,0.00006656767,0.007131847,0.0000825868,0.0000052401833,0.00004104353,1.6383424e-7,0.66582847,0.000009588017,0.32551473,0.0005233974,0.0005068695],"about_ca_topic_score_codex":0.0000088200095,"about_ca_topic_score_gemma":0.00011788219,"teacher_disagreement_score":0.77059066,"about_ca_system_score_codex":0.00021746803,"about_ca_system_score_gemma":0.00019820867,"threshold_uncertainty_score":0.99955046},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000099526624,0.00025170654,0.9969847,0.0010731751,0.0007982186,0.00031558215,0.0000014824628,0.00013148463,0.0003440882],"genre_scores_gemma":[0.33057728,0.00007118292,0.66709894,0.0015300818,0.0005592907,0.000020687454,0.000018557566,0.00002601864,0.00009793605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774283,0.00003315651,0.00036309083,0.0011092934,0.00042221887,0.00032942052],"domain_scores_gemma":[0.9985577,0.0005114884,0.0002401307,0.00035053352,0.00020335981,0.00013680581],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095225335,0.00024498763,0.00028148334,0.0006296243,0.00030333985,0.00070047745,0.0009591496,0.00019669114,0.000008431261],"category_scores_gemma":[0.00050564914,0.00024968633,0.00007706685,0.00062560814,0.00026321033,0.0003385243,0.00069591834,0.00055171945,0.000019232048],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002961962,0.0000067928772,0.000021932372,0.00004130971,0.000004243776,0.0000054190796,0.0007934141,0.0008901628,0.000082054976,0.0052397544,0.0000040071423,0.99290794],"study_design_scores_gemma":[0.00017444181,0.0000918777,0.00008942558,0.00009355945,0.0000054817397,0.000015027778,3.0516725e-7,0.9095837,0.00083256775,0.08497744,0.0038058534,0.0003303162],"about_ca_topic_score_codex":0.0000079577185,"about_ca_topic_score_gemma":0.0000114659615,"teacher_disagreement_score":0.9925776,"about_ca_system_score_codex":0.00009594262,"about_ca_system_score_gemma":0.00013044802,"threshold_uncertainty_score":0.9999955},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016080762,0.00039876008,0.9959023,0.00017438829,0.00065633724,0.00024550402,0.000043544605,0.00035392639,0.00061713654],"genre_scores_gemma":[0.94513786,0.00003290086,0.054392718,0.0001337346,0.00022537731,0.000014276818,0.000020993022,0.00003083659,0.000011318765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904484,0.0000029918785,0.00019967595,0.00038474528,0.00015403499,0.00021369144],"domain_scores_gemma":[0.99957734,0.0001501137,0.00004070911,0.00015325566,0.000023974573,0.00005458134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013247052,0.00020590062,0.0002295394,0.00016864245,0.00012846754,0.000031024843,0.00025846247,0.0002899046,0.000006859477],"category_scores_gemma":[0.000018427196,0.00022276648,0.00004003482,0.000077775,0.00020754621,0.00012628995,0.00008532051,0.00047872515,0.0000026578039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012487566,0.000014809653,0.00034933985,0.00020835998,0.00005355153,0.000017499839,0.0006664109,0.3017453,0.000412826,0.01919234,0.000025245134,0.6773018],"study_design_scores_gemma":[0.0002543692,0.00016069566,0.0008734229,0.00017569854,0.000010817105,0.000031163574,2.7882567e-7,0.8849964,0.000669719,0.11207177,0.0004988839,0.00025678196],"about_ca_topic_score_codex":7.359441e-7,"about_ca_topic_score_gemma":0.000004127915,"teacher_disagreement_score":0.9435298,"about_ca_system_score_codex":0.00013213667,"about_ca_system_score_gemma":0.00005370874,"threshold_uncertainty_score":0.9084153},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02309707,0.00039100155,0.97046614,0.00000943542,0.0052683526,0.0003509522,0.000003997549,0.00016410186,0.00024895396],"genre_scores_gemma":[0.9946175,0.0000049256705,0.0036411942,0.000102693586,0.0015713747,0.000004550698,0.000003602901,0.000050489623,0.0000036489262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979885,0.000038382557,0.00054842455,0.0005822338,0.00039249702,0.00044992377],"domain_scores_gemma":[0.99924856,0.00021681604,0.00012627046,0.00024992984,0.0000616069,0.00009680346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052070146,0.0003710156,0.0004960827,0.00048533044,0.00012858155,0.00021554295,0.0003333396,0.00046544272,0.000028146418],"category_scores_gemma":[0.00007589173,0.00037559285,0.00007988013,0.0004337776,0.00012074101,0.0001866652,0.0001684425,0.0008135549,0.000009821261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008989187,0.0000015340869,0.00003630479,0.000032510383,0.000004720407,0.000043859956,0.00007457117,0.95428616,0.0034437426,0.00006822353,0.0000011604428,0.041998245],"study_design_scores_gemma":[0.00023555415,0.00005061448,0.0000690358,0.00030093038,0.000006145557,0.00007334922,2.7225363e-7,0.994206,0.003274426,0.0013522072,0.000053899337,0.0003775707],"about_ca_topic_score_codex":0.000047600053,"about_ca_topic_score_gemma":0.00009690161,"teacher_disagreement_score":0.9715204,"about_ca_system_score_codex":0.0004473172,"about_ca_system_score_gemma":0.00006905398,"threshold_uncertainty_score":0.9998696},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0123057915,0.000926466,0.98588604,0.00012003002,0.00031768793,0.00026202627,0.000013312128,0.0000029076757,0.00016574761],"genre_scores_gemma":[0.9952661,0.00014016403,0.004283878,0.00009411221,0.000097137236,0.0000028742904,0.000025093741,0.000013859057,0.00007682102],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99920976,0.0000241962,0.00020218095,0.0003256554,0.00014512501,0.00009307711],"domain_scores_gemma":[0.99936914,0.000095344396,0.00016570566,0.0002740985,0.00006681586,0.00002886371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025941274,0.00014439053,0.0002249282,0.00008602456,0.00004099385,0.000018014338,0.00028233495,0.00012243487,0.000005703458],"category_scores_gemma":[0.00010028022,0.00009943737,0.000077304794,0.000084682644,0.00028158666,0.0000034391867,0.00026088918,0.00014354185,8.3276615e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000993576,0.000006378004,0.000004283336,0.000083752806,0.000029131845,0.0000011924718,0.00005313193,0.000672858,0.9319084,0.00231094,0.000010821892,0.064819746],"study_design_scores_gemma":[0.00043906903,0.0006711349,0.0000017535024,0.000092406604,0.000026990723,0.000014940226,1.7592292e-7,0.08501285,0.9086687,0.004487634,0.00046759815,0.00011674477],"about_ca_topic_score_codex":0.000009705951,"about_ca_topic_score_gemma":0.000012826356,"teacher_disagreement_score":0.9829603,"about_ca_system_score_codex":0.000010446019,"about_ca_system_score_gemma":0.000053010306,"threshold_uncertainty_score":0.40549383},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002506657,0.00026608445,0.9954042,0.00042973863,0.00083766266,0.00043825328,7.7437517e-7,0.00003894975,0.0000776934],"genre_scores_gemma":[0.86495394,0.000007949947,0.1345508,0.00013221845,0.00032746932,0.0000113724345,6.3640255e-7,0.000013762723,0.0000018580085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735916,0.00007271614,0.0005775808,0.0009834763,0.00059240445,0.0004146566],"domain_scores_gemma":[0.9980684,0.001001054,0.00026462766,0.0004661327,0.00014972128,0.000050084454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014714699,0.00027776582,0.00044840167,0.0004793868,0.00020027501,0.00013468973,0.0018103857,0.000244277,0.0000020172433],"category_scores_gemma":[0.00056679215,0.00023739184,0.00011158849,0.0007267089,0.00035026597,0.00033062033,0.00080736243,0.0008543662,5.2159976e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010213398,0.000011050772,0.00019225544,0.000053268446,0.0000027200758,0.000007718818,0.0063548563,0.2012141,0.00035541126,0.0032521638,7.788703e-8,0.78854614],"study_design_scores_gemma":[0.00022013577,0.000045163775,0.0009929894,0.00009232852,0.0000034440611,0.000005332078,0.0000030815393,0.91514814,0.0007431307,0.0824875,0.00004578912,0.00021298103],"about_ca_topic_score_codex":0.00010368976,"about_ca_topic_score_gemma":0.00096033886,"teacher_disagreement_score":0.86244726,"about_ca_system_score_codex":0.00046287145,"about_ca_system_score_gemma":0.00037612714,"threshold_uncertainty_score":0.96805584},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068323915,0.0010997626,0.99036336,0.0009163161,0.00016820434,0.00018023346,0.0000029982727,0.00006381214,0.00037289655],"genre_scores_gemma":[0.9564189,0.000040577765,0.04243227,0.0005762742,0.00046076422,0.0000016926128,0.0000035760222,0.000020664596,0.000045327997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818933,0.000025224033,0.0002545934,0.00084198144,0.00044637706,0.00024247362],"domain_scores_gemma":[0.9990201,0.00015194612,0.00012223845,0.00035106912,0.00015724005,0.00019742775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023151285,0.0002701095,0.00044717142,0.0002999807,0.00017682687,0.00013437115,0.00017717775,0.00009902044,0.00001534944],"category_scores_gemma":[0.00029555615,0.00022605115,0.0001191329,0.0002647917,0.00079349487,0.0001271097,0.00020157667,0.0004709724,0.0000031977636],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015331675,0.000048636353,0.012893738,0.0005590543,0.000052905205,0.0005507102,0.0004774489,0.004776596,0.0068309624,0.000084849264,0.0000047779963,0.973567],"study_design_scores_gemma":[0.00044663952,0.00039717098,0.008118207,0.0009158599,0.00039565522,0.00048082464,0.0000022475017,0.96164614,0.004593529,0.022212213,0.00019330403,0.00059820304],"about_ca_topic_score_codex":0.000037096346,"about_ca_topic_score_gemma":0.000009251823,"teacher_disagreement_score":0.9729688,"about_ca_system_score_codex":0.00017237218,"about_ca_system_score_gemma":0.00014679703,"threshold_uncertainty_score":0.92180985},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008101733,0.002560824,0.9831793,0.0025662158,0.0024483884,0.00037554296,0.000035109537,0.00005213877,0.0006807913],"genre_scores_gemma":[0.8920847,0.00037384755,0.09859878,0.0040473416,0.004542287,0.000007723446,0.000047514302,0.0000951951,0.00020260594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783015,0.000038419133,0.0004134687,0.0006508361,0.0007741508,0.00029299507],"domain_scores_gemma":[0.99855834,0.0005069633,0.00025835572,0.00039800932,0.00014741592,0.00013088745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048592547,0.0002924707,0.0005512303,0.00019750674,0.00017959924,0.000083098,0.00047834724,0.00018302801,0.000057921567],"category_scores_gemma":[0.0003088659,0.00020005307,0.000110274224,0.00026895112,0.00068361283,0.00008692828,0.00024385689,0.0013160512,9.1448567e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021552727,0.00007584069,0.029650921,0.00089789875,0.0005087043,0.00025467598,0.008725897,0.25037083,0.1105912,0.0009255566,0.00029204675,0.5974909],"study_design_scores_gemma":[0.00045934707,0.00008065692,0.0038940578,0.0024691315,0.00019221882,0.00003433459,0.0000017907824,0.9836674,0.006512141,0.0020177593,0.00043423704,0.00023692855],"about_ca_topic_score_codex":0.0008517137,"about_ca_topic_score_gemma":0.00013151752,"teacher_disagreement_score":0.8845805,"about_ca_system_score_codex":0.0002160701,"about_ca_system_score_gemma":0.0006199665,"threshold_uncertainty_score":0.8157927},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043988814,0.00006190552,0.996634,0.0008786606,0.0005343093,0.0008836273,0.000011265348,0.0004481489,0.00050410547],"genre_scores_gemma":[0.22310695,0.0000062138524,0.77541965,0.00093653926,0.00033484233,0.000060995968,0.000005795087,0.000032792443,0.00009623727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712604,0.000026326652,0.00047783263,0.0014822525,0.000506919,0.00038064524],"domain_scores_gemma":[0.9979304,0.00027163437,0.00036905456,0.0009870183,0.00030416713,0.00013770656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003955171,0.00037682374,0.00036499382,0.00059123675,0.0004287698,0.0004932199,0.0014548209,0.00025984747,0.000009844225],"category_scores_gemma":[0.00007643938,0.0003862442,0.00018977401,0.0007768404,0.00030208076,0.0006131147,0.00040466743,0.00041562266,0.0000118113885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019780064,0.000040878946,0.000039462426,0.00006992171,0.00001450347,0.00001813041,0.00017447739,0.061657686,0.0202638,0.010065139,0.000043824894,0.9075924],"study_design_scores_gemma":[0.0001650386,0.00014681967,0.000051854837,0.000067606146,0.000012214419,0.000021506105,1.11255424e-7,0.8675701,0.066456616,0.063994125,0.0011328388,0.0003811565],"about_ca_topic_score_codex":0.000043557047,"about_ca_topic_score_gemma":0.000027475578,"teacher_disagreement_score":0.90721124,"about_ca_system_score_codex":0.00029694318,"about_ca_system_score_gemma":0.00037737007,"threshold_uncertainty_score":0.999859},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020343614,0.000643012,0.9938956,0.0026752849,0.00063758483,0.00020884257,0.000008312497,0.00021803047,0.001509905],"genre_scores_gemma":[0.3771193,0.000522203,0.61126983,0.0060791797,0.0006867214,0.000035033285,0.00017195295,0.00010451923,0.00401128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600977,0.000074541545,0.00047617633,0.0017949966,0.0010459331,0.0005985898],"domain_scores_gemma":[0.99809426,0.0002283502,0.0003293955,0.0008969991,0.00017004658,0.00028092912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042218066,0.0005301001,0.00072732614,0.0008490093,0.00034728422,0.00070983736,0.0024495977,0.0002923226,0.000069777125],"category_scores_gemma":[0.00008912192,0.00045662234,0.00030755243,0.0015100723,0.00031360186,0.0006027553,0.0012174681,0.0009328945,0.00010777985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026015841,0.00007238011,0.00033842586,0.00008163175,0.00023308708,0.00025951752,0.0035289947,0.12291411,0.006679443,0.009025371,0.0016018348,0.8552392],"study_design_scores_gemma":[0.0003214412,0.00016872729,0.00005707696,0.00018767013,0.00011488512,0.000014719169,7.997686e-7,0.9590148,0.007667944,0.021554742,0.009928592,0.0009686156],"about_ca_topic_score_codex":0.00006600129,"about_ca_topic_score_gemma":0.00005929412,"teacher_disagreement_score":0.8542706,"about_ca_system_score_codex":0.0001507962,"about_ca_system_score_gemma":0.00020643583,"threshold_uncertainty_score":0.9997885},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057727125,0.00023810887,0.9411503,0.00017207158,0.00018902509,0.00043715557,0.0000139772455,0.0000070741803,0.000065154934],"genre_scores_gemma":[0.7218723,0.000075332275,0.27658707,0.0012597138,0.00013414313,3.9205773e-7,0.000022489801,0.00002940971,0.000019136522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985254,0.000023080383,0.00024595833,0.0006387072,0.0002743933,0.0002925035],"domain_scores_gemma":[0.99906754,0.000076939534,0.0001798009,0.00050714426,0.00008995336,0.000078590296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015668558,0.00030103262,0.00032749507,0.000090659065,0.00011942677,0.000041555468,0.00050555734,0.00017743895,3.9624317e-7],"category_scores_gemma":[0.000015656571,0.00020290563,0.00007638322,0.00011160324,0.00044860825,0.000003740317,0.00020127335,0.0003336898,0.0000010662287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004835889,0.000021810667,0.0000094687375,0.000123256,0.000019274821,0.000008153485,0.00013836674,0.9637713,0.03425548,0.00013770434,0.000004802643,0.0014620699],"study_design_scores_gemma":[0.00024266719,0.00062137516,0.0000015535328,0.00041422618,0.000023181638,0.000010323896,2.9603066e-7,0.9503954,0.04735428,0.0006431154,0.0000689549,0.00022459432],"about_ca_topic_score_codex":0.000024792085,"about_ca_topic_score_gemma":0.000015588068,"teacher_disagreement_score":0.66456324,"about_ca_system_score_codex":0.00005914537,"about_ca_system_score_gemma":0.00042915222,"threshold_uncertainty_score":0.8274252},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009803059,0.00014790452,0.9803658,0.0030335274,0.00020813929,0.00039432978,0.000009633466,0.000015171473,0.0060224393],"genre_scores_gemma":[0.9719054,0.0000522128,0.027527796,0.0003981644,0.00008996875,0.0000024211065,0.0000019161955,0.00000713066,0.000014967541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977474,0.00012776359,0.000527244,0.00049866945,0.0008751343,0.00022373909],"domain_scores_gemma":[0.9971522,0.0018504222,0.00033989083,0.0003964024,0.0002006654,0.000060384507],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018305866,0.00015790183,0.00039189195,0.00041548087,0.00026843825,0.0001108417,0.0010291039,0.00019605354,0.000013859653],"category_scores_gemma":[0.00039851016,0.0001244706,0.00009577261,0.0013403876,0.003909786,0.00018123565,0.00016502284,0.00033187208,0.000002002208],"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.000015527316,0.000051440362,0.0021509298,0.000013314469,0.000032846372,0.000011254632,0.040480636,0.00942856,0.00081771036,0.5951789,0.0000041376384,0.35181475],"study_design_scores_gemma":[0.00019808003,0.00016219541,0.007631099,0.00068776595,0.00023514434,0.0000021195722,0.00047542006,0.17853436,0.0028048407,0.8045153,0.003929771,0.0008239256],"about_ca_topic_score_codex":0.013002562,"about_ca_topic_score_gemma":0.33058712,"teacher_disagreement_score":0.96210235,"about_ca_system_score_codex":0.00013397592,"about_ca_system_score_gemma":0.00034275145,"threshold_uncertainty_score":0.998801},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002696597,0.00013882741,0.9919861,0.0029177968,0.00076629693,0.0005195801,0.000005227389,0.0013452852,0.0023181883],"genre_scores_gemma":[0.008590761,0.000031226642,0.9876762,0.0030985437,0.0002779746,0.000024992434,0.000004671681,0.00005203808,0.00024358649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99508053,0.000053551204,0.00071295846,0.00202768,0.0014049695,0.0007202928],"domain_scores_gemma":[0.99679404,0.00043973236,0.0005087554,0.0017024785,0.00032473556,0.00023023988],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00083106867,0.000664987,0.0006764737,0.00069377467,0.0003566752,0.001087709,0.0047798743,0.0002915313,0.000031257146],"category_scores_gemma":[0.00029432276,0.0005657409,0.0001282958,0.0009371401,0.000866475,0.001820842,0.002734583,0.0012176353,0.00006103],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001153695,0.000034944278,0.0000029519813,0.0001713863,0.000010232214,0.00039214315,0.00038320204,0.0013553789,0.0023080239,0.015849251,0.00016110072,0.9793199],"study_design_scores_gemma":[0.00016300066,0.00022418176,0.00004875005,0.0005424146,0.000007793366,0.000095556235,8.213013e-8,0.840066,0.0026745712,0.15459535,0.00095597474,0.0006263306],"about_ca_topic_score_codex":0.000006612818,"about_ca_topic_score_gemma":0.0000117175905,"teacher_disagreement_score":0.97869354,"about_ca_system_score_codex":0.00075369916,"about_ca_system_score_gemma":0.001427452,"threshold_uncertainty_score":0.9999493},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004899089,0.0013539878,0.9963956,0.0006492253,0.0004035838,0.00056439656,0.0000030437868,0.000110495734,0.00002975247],"genre_scores_gemma":[0.39821354,0.000009259088,0.6008315,0.0006117508,0.00028608012,0.000013803291,0.000018112418,0.000011935714,0.000004026622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977011,0.000060759437,0.00036578634,0.0009547684,0.00070181995,0.00021575361],"domain_scores_gemma":[0.99844116,0.0001321761,0.00027133478,0.00053092267,0.0005335832,0.00009083445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014154569,0.00024825503,0.0002897924,0.00033320786,0.00010925074,0.00028968754,0.0009691054,0.00023401086,0.000002801352],"category_scores_gemma":[0.00011394183,0.00021934831,0.00006613512,0.0002709715,0.00024005627,0.0006595498,0.0002940656,0.00030065072,4.5982216e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010938946,0.000021043485,0.00007277265,0.00004209657,0.0000072519624,0.000003968041,0.0003646084,0.009727875,0.0022055719,0.007932957,0.000038472026,0.9795724],"study_design_scores_gemma":[0.00021759287,0.00021786845,0.000050353356,0.000110680005,0.0000168675,0.000012013177,6.324635e-8,0.86129326,0.0027185215,0.13514103,0.000016314176,0.0002054274],"about_ca_topic_score_codex":0.0000038785165,"about_ca_topic_score_gemma":0.000022863202,"teacher_disagreement_score":0.979367,"about_ca_system_score_codex":0.00011138435,"about_ca_system_score_gemma":0.00021838305,"threshold_uncertainty_score":0.8944765},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3099929,0.000096942436,0.6875925,0.00009056882,0.000688153,0.00080299587,0.00012643391,0.0001782256,0.00043128352],"genre_scores_gemma":[0.9911955,0.0000064437577,0.008393411,0.000028934812,0.00020427491,0.000007457365,0.00012488094,0.000029585459,0.00000950111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841326,0.000074405216,0.00045410314,0.00031197415,0.00045793067,0.00028832184],"domain_scores_gemma":[0.9980884,0.0011960516,0.00009820339,0.00036583256,0.00018017105,0.00007129571],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042322028,0.00027673013,0.00043590923,0.0004964709,0.0001040542,0.0001708034,0.00061918533,0.0002619701,0.00004179828],"category_scores_gemma":[0.00024673963,0.00028377533,0.000058573325,0.00044003836,0.00046264965,0.00037066924,0.00021015096,0.0007672047,0.00000683524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028520377,0.000010728882,0.001719306,0.00010807975,0.000008306049,0.000008979485,0.0009404587,0.9759689,0.004309217,0.000019043577,9.435311e-7,0.016877497],"study_design_scores_gemma":[0.0004981617,0.00017509714,0.005070315,0.00023266941,0.0000048518114,2.762481e-7,5.246705e-7,0.96605724,0.026428599,0.0010929898,0.00016159816,0.00027764693],"about_ca_topic_score_codex":0.00011203147,"about_ca_topic_score_gemma":0.00052020565,"teacher_disagreement_score":0.6812026,"about_ca_system_score_codex":0.00021324442,"about_ca_system_score_gemma":0.00017101136,"threshold_uncertainty_score":0.99996144},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010404887,0.00008343548,0.98485816,0.001567692,0.0009863931,0.0013018459,0.0000087493045,0.00040626715,0.00038257363],"genre_scores_gemma":[0.91659725,0.0000026210985,0.082435876,0.00040159523,0.0003847268,0.00005987914,0.000004515682,0.000037922084,0.00007564559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656147,0.00005447893,0.00037338864,0.0018814008,0.00061983935,0.00050941564],"domain_scores_gemma":[0.99766517,0.00058043073,0.0005091438,0.0006573989,0.00048020855,0.00010762162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005668972,0.00055122114,0.0007387769,0.0005320129,0.00041031974,0.00037889573,0.001480895,0.00034494227,0.0000032214446],"category_scores_gemma":[0.00021225071,0.00049857114,0.00015203159,0.0004422611,0.0008179084,0.0007286141,0.0009778481,0.0009505056,0.00001157128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012820681,0.00008109115,0.000011960905,0.0005259407,0.000040557876,0.000055188393,0.010478023,0.000049995182,0.004504435,0.15168647,0.000016973447,0.8324212],"study_design_scores_gemma":[0.0016957376,0.0004916864,0.00007020094,0.0016848217,0.00001936932,0.00014298632,0.000008015322,0.96638006,0.016636834,0.011742518,0.0003818146,0.00074595667],"about_ca_topic_score_codex":0.000008801845,"about_ca_topic_score_gemma":0.000006207157,"teacher_disagreement_score":0.96633005,"about_ca_system_score_codex":0.00044427413,"about_ca_system_score_gemma":0.0002281987,"threshold_uncertainty_score":0.9997466},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4538508,0.0010255802,0.5243752,0.0022773847,0.00081536075,0.00071807567,0.000068255154,0.000026924807,0.016842391],"genre_scores_gemma":[0.9942252,0.000007122314,0.004294042,0.0012049604,0.00023038106,7.349491e-7,0.000014788106,0.0000059479535,0.0000168216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991118,0.000017071403,0.00015880293,0.00035633068,0.00018807275,0.00016793914],"domain_scores_gemma":[0.9996017,0.000048191076,0.000079363934,0.0001871149,0.000040867788,0.00004271316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019013243,0.00013584066,0.00013029485,0.000025050043,0.00006958161,0.000026714097,0.00038799492,0.000115920026,0.00002577107],"category_scores_gemma":[0.00005975709,0.00008363802,0.00005948687,0.000057417587,0.0006500814,0.0000036615625,0.0008060298,0.00016502503,8.2773835e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011883875,0.00005096294,0.0027931374,0.00014918826,0.000071347014,0.000036880094,0.00059662585,0.0022651718,0.14209406,0.47220644,0.000045271456,0.37957206],"study_design_scores_gemma":[0.0014222357,0.0018336233,0.009729352,0.00033586015,0.0000543789,0.00015349333,0.0000053899184,0.0280651,0.5333535,0.42176956,0.0020316506,0.0012458235],"about_ca_topic_score_codex":0.0000019999552,"about_ca_topic_score_gemma":0.000016797796,"teacher_disagreement_score":0.5403744,"about_ca_system_score_codex":0.000009279798,"about_ca_system_score_gemma":0.000087111395,"threshold_uncertainty_score":0.34106597},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012538006,0.0004578774,0.98203886,0.015548204,0.0006113289,0.000786229,0.000003072352,0.000068968424,0.00036010658],"genre_scores_gemma":[0.75816137,0.00012596835,0.2270761,0.012203631,0.0021308095,0.000114666334,0.000014931343,0.000045432655,0.00012709106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977977,0.000032492742,0.00026709225,0.001079116,0.00036668897,0.0004568974],"domain_scores_gemma":[0.9985172,0.0006117156,0.0001690668,0.00054720393,0.00006626706,0.000088536966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054396485,0.00034598736,0.00034126622,0.0002250281,0.00031501174,0.0008360346,0.0017727426,0.00022236454,9.160539e-7],"category_scores_gemma":[0.00003121575,0.00024982344,0.000087864995,0.0007276057,0.00031562024,0.00037087887,0.0004515295,0.00089740806,9.75814e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073532437,0.0000085353,0.000033861328,0.000021665537,0.000004550626,0.000015240167,0.0017953119,0.10527908,0.000016962607,0.026024055,0.00021471037,0.8665787],"study_design_scores_gemma":[0.00017195127,0.0001306693,0.00014342913,0.000082253406,0.0000054303187,0.000059689668,0.0000013449181,0.95904785,0.0000104676665,0.036416046,0.0036479637,0.0002828913],"about_ca_topic_score_codex":0.000009489829,"about_ca_topic_score_gemma":0.00012213166,"teacher_disagreement_score":0.86629575,"about_ca_system_score_codex":0.00005564323,"about_ca_system_score_gemma":0.00009901055,"threshold_uncertainty_score":0.9999954},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014075912,0.00015006923,0.99490976,0.00031571498,0.00016195513,0.0006531386,0.000021305688,0.0002551182,0.0021253293],"genre_scores_gemma":[0.86965585,0.000013565326,0.13014364,0.00004283415,0.000034291654,0.000017576016,0.000060576087,0.000014265298,0.000017379229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968578,0.00004110898,0.0005255762,0.0013216123,0.0009314745,0.00032240557],"domain_scores_gemma":[0.9976259,0.00029016702,0.0005703946,0.0012388149,0.00017632174,0.00009838948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039198168,0.00039579588,0.0005191397,0.0004214283,0.00020540641,0.0003111706,0.0025961376,0.00015574538,0.00000817896],"category_scores_gemma":[0.000037206268,0.00032183455,0.000044673867,0.0007040375,0.00054228125,0.0008911062,0.0007839472,0.0008434749,0.000019135126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043271575,0.0009026081,0.00028196082,0.00009909643,0.00013786896,0.000043672597,0.008813753,0.57726514,0.0013876801,0.14781484,0.00007454087,0.2627461],"study_design_scores_gemma":[0.0009800227,0.001153482,0.00026355643,0.00004501841,0.000017091246,0.000005781003,0.000026932623,0.9863724,0.00065760815,0.009910262,0.00017203014,0.00039582254],"about_ca_topic_score_codex":0.000028522425,"about_ca_topic_score_gemma":0.000044561126,"teacher_disagreement_score":0.8682483,"about_ca_system_score_codex":0.00013555965,"about_ca_system_score_gemma":0.00019312535,"threshold_uncertainty_score":0.99992335},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010170491,0.00038917724,0.9858502,0.001201754,0.0019445893,0.00029956945,0.0000045622824,0.00011967143,0.000019994075],"genre_scores_gemma":[0.54029495,0.000012089165,0.45870376,0.0008277151,0.00014103689,0.0000071574586,0.000004451018,0.0000087976405,5.9707475e-8],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958017,0.00013496737,0.00073942496,0.0016260209,0.00088111317,0.00081676326],"domain_scores_gemma":[0.9974934,0.0009847808,0.00021930282,0.0008771788,0.00018016499,0.0002451668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007910166,0.0004364849,0.00066188915,0.0007350933,0.00012709197,0.00034331344,0.0033161535,0.00022080823,0.0000066469324],"category_scores_gemma":[0.00038257203,0.0004252055,0.0001930316,0.0030500211,0.0008385616,0.0006145152,0.0025244306,0.0016990922,0.0000015861744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070223587,0.00003549846,0.0017715102,0.000022989361,0.0000037701827,0.000023747043,0.0013814806,0.7043487,0.00066353084,0.00021365039,0.0000022673428,0.29152584],"study_design_scores_gemma":[0.00040299402,0.0000736789,0.006876623,0.0002742502,0.0000029604237,0.000040698495,0.0000027816614,0.9767647,0.00069050374,0.014463587,0.000005921588,0.0004013202],"about_ca_topic_score_codex":0.000018778694,"about_ca_topic_score_gemma":0.000019683443,"teacher_disagreement_score":0.5301244,"about_ca_system_score_codex":0.00013280514,"about_ca_system_score_gemma":0.00047357174,"threshold_uncertainty_score":0.99982},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009104095,0.00012530174,0.9901537,0.0009127378,0.0011403935,0.0004024983,0.0000054369243,0.00009697234,0.0070719267],"genre_scores_gemma":[0.28994867,0.000023689796,0.70943695,0.000470492,0.00008050465,0.0000037546454,0.000003180092,0.00002086781,0.000011887025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962283,0.00011178238,0.0007499636,0.0012810219,0.0010872723,0.00054168195],"domain_scores_gemma":[0.9976963,0.00037766414,0.00042352543,0.0012199653,0.00012468213,0.0001579028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016836617,0.00042923994,0.0006485179,0.0010201354,0.00012739995,0.00021676844,0.0032868094,0.00027129863,0.000016071872],"category_scores_gemma":[0.00029457986,0.0004273796,0.00012414661,0.0011448122,0.0018589433,0.0005884893,0.0012903165,0.00085161545,0.000013895005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015376738,0.00001809234,0.000054008582,0.00010949236,0.0000058244686,0.000047956422,0.0023669307,0.0071036927,0.00014406149,0.929222,0.0000057275006,0.06090684],"study_design_scores_gemma":[0.00018618503,0.00014768742,0.00014213411,0.00037856845,0.000003826201,0.000017002954,0.000001289264,0.3812429,0.001258348,0.61621183,0.0000840233,0.00032618488],"about_ca_topic_score_codex":0.000034522516,"about_ca_topic_score_gemma":0.0000761784,"teacher_disagreement_score":0.37413922,"about_ca_system_score_codex":0.00089907617,"about_ca_system_score_gemma":0.0006360145,"threshold_uncertainty_score":0.9998178},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010211732,0.00004643563,0.99100125,0.006122918,0.0005727042,0.000464747,0.0000795503,0.00031139603,0.00037982882],"genre_scores_gemma":[0.35049418,0.00001379096,0.6453599,0.00278586,0.0006560285,0.000008622932,0.000024595392,0.000062764164,0.0005943118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993627,0.00004301713,0.00071228645,0.0029541794,0.0016561813,0.00100732],"domain_scores_gemma":[0.9961034,0.0002366069,0.00033470572,0.002594145,0.00025931626,0.00047183502],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0008904445,0.0006898803,0.0007604048,0.0003930487,0.0004761075,0.0010937823,0.009097119,0.00024292403,0.000003706684],"category_scores_gemma":[0.00017285683,0.0006420688,0.00014027588,0.00069754146,0.00029214323,0.0010454739,0.011072695,0.0015221623,0.00009995288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010317463,0.000036036578,0.00008215422,0.000043509503,0.000027483642,0.00027475558,0.0049465164,0.9084243,0.00013159469,0.0026988229,0.000039416922,0.083285056],"study_design_scores_gemma":[0.00024608066,0.00019862592,0.000094190065,0.00034375023,0.000014108007,0.000044438373,0.0000018861871,0.98368335,0.00014183781,0.013823453,0.0006593182,0.000748972],"about_ca_topic_score_codex":0.000026764947,"about_ca_topic_score_gemma":0.00020166997,"teacher_disagreement_score":0.349473,"about_ca_system_score_codex":0.00037141418,"about_ca_system_score_gemma":0.00090221054,"threshold_uncertainty_score":0.9999432},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023213465,0.00030006882,0.9641947,0.004189572,0.0075051505,0.0003328163,0.00003091016,0.0002044312,0.000028878212],"genre_scores_gemma":[0.58669376,0.000011139841,0.41224873,0.00068261835,0.00032631253,0.000014699189,0.00000894543,0.000013424777,3.8841296e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953498,0.00021172648,0.00074390275,0.0020336155,0.0010777388,0.0005831723],"domain_scores_gemma":[0.996149,0.0011110754,0.00064249337,0.0017034567,0.00024179378,0.00015219652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008655192,0.0004969437,0.0007431619,0.00068948366,0.00014074675,0.00018069701,0.004032309,0.0002981731,0.00000657594],"category_scores_gemma":[0.0005926259,0.000475347,0.0001710569,0.0020542059,0.0007335204,0.00026480336,0.002016724,0.0010228422,0.0000029059397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019367074,0.0001623505,0.00071632426,0.00015027387,0.0000065235467,0.000074025105,0.0014191107,0.5165994,0.0018277778,0.0001074238,0.000019017978,0.4787241],"study_design_scores_gemma":[0.0008061523,0.0007579713,0.0027843008,0.00033706846,0.000009732721,0.000005476839,0.0000014935421,0.9819931,0.007706517,0.005027053,0.0001266097,0.00044451628],"about_ca_topic_score_codex":0.00007656606,"about_ca_topic_score_gemma":0.0002572525,"teacher_disagreement_score":0.56348026,"about_ca_system_score_codex":0.0006191965,"about_ca_system_score_gemma":0.0010735181,"threshold_uncertainty_score":0.9997698},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009339375,0.0006958209,0.9176036,0.016017482,0.0030367288,0.0005067836,0.0000060238626,0.00014270784,0.052651495],"genre_scores_gemma":[0.73638445,0.00030364402,0.25643107,0.0043662507,0.0019862086,0.000010767939,0.0000072014377,0.000034182285,0.00047624664],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970514,0.0004638349,0.00037407412,0.00090050703,0.00072426733,0.00048587096],"domain_scores_gemma":[0.9960991,0.0030128295,0.0002562707,0.0003308252,0.00011925518,0.00018173429],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035706835,0.00027279576,0.0004049692,0.00040228467,0.000525901,0.0005561012,0.0012421948,0.00039568916,0.00021021794],"category_scores_gemma":[0.0022827112,0.00024907163,0.00007944388,0.000595828,0.0014288967,0.0005169725,0.00032811638,0.0010864637,0.000047435926],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008765134,0.00010611022,0.018341845,0.000061808394,0.000018490717,0.0001517883,0.04441239,0.0053148963,0.00012570027,0.078989044,0.000046559897,0.85234374],"study_design_scores_gemma":[0.0009833996,0.00044664627,0.010083669,0.0015265204,0.00005263022,0.000055169137,0.00036849617,0.026376199,0.00025852915,0.7215334,0.23545115,0.0028641955],"about_ca_topic_score_codex":0.002252014,"about_ca_topic_score_gemma":0.0055328384,"teacher_disagreement_score":0.8494795,"about_ca_system_score_codex":0.00035845017,"about_ca_system_score_gemma":0.0013654116,"threshold_uncertainty_score":0.9999961},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033994406,0.0011592837,0.9612944,0.0015369849,0.0011746798,0.0005086604,0.000009399545,0.00031312823,0.000009048869],"genre_scores_gemma":[0.48498353,0.00003088368,0.51423377,0.000444904,0.000259571,0.000021775348,0.000011799797,0.000013658793,9.5822216e-8],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616563,0.00007731517,0.0005319003,0.0018455731,0.0006424464,0.00073712226],"domain_scores_gemma":[0.996495,0.0019663787,0.00041111317,0.0006918495,0.00022243489,0.00021319721],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007702647,0.00048818052,0.0005311262,0.00033543355,0.0005486612,0.002774087,0.0023470637,0.00034953677,0.0000034498282],"category_scores_gemma":[0.0020452177,0.00046561155,0.00010975549,0.0010295195,0.0003279558,0.0013066593,0.0011974109,0.001507956,0.0000036760018],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005543365,0.000023529794,0.0017027203,0.0001427451,0.000011539905,0.000021317024,0.004889567,0.0771297,0.00944932,0.00023908864,0.0000014292218,0.9063835],"study_design_scores_gemma":[0.00014725907,0.000068444875,0.0022644927,0.00045494948,0.000009017205,0.000024545352,0.000002574338,0.52321017,0.09259705,0.3808377,0.0000026587275,0.00038110756],"about_ca_topic_score_codex":0.000084394196,"about_ca_topic_score_gemma":0.000027282016,"teacher_disagreement_score":0.9060024,"about_ca_system_score_codex":0.00016883308,"about_ca_system_score_gemma":0.00036491008,"threshold_uncertainty_score":0.9997796},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29547426,0.00013482802,0.6997553,0.00050268363,0.0008007146,0.0004998727,0.000012320464,0.000057392994,0.0027626199],"genre_scores_gemma":[0.9755362,0.000011373684,0.024164576,0.00008086587,0.00011795938,0.0000022115182,0.0000010266342,0.000019313804,0.00006647392],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99775773,0.000034258563,0.00044397448,0.00064229575,0.00084540015,0.0002763102],"domain_scores_gemma":[0.99844885,0.00053454033,0.0004326938,0.00039550703,0.00011683089,0.00007160362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031258422,0.0002608737,0.00034900027,0.00017746112,0.0002585382,0.00014547909,0.0008014363,0.00012770011,0.000011969682],"category_scores_gemma":[0.00032512684,0.00017244276,0.000084777166,0.0003148653,0.0012597025,0.00014221553,0.00031727718,0.00048853335,0.0000017289041],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015333004,0.00005143822,0.00076932117,0.0005195335,0.000036613048,0.00010666204,0.0025875315,0.006444126,0.15973237,0.005531475,0.0000043025802,0.8240633],"study_design_scores_gemma":[0.0014274344,0.0015236182,0.006312193,0.003527449,0.00008755431,0.0005731461,0.00001862768,0.12722489,0.7839958,0.07415002,0.0000884268,0.0010708174],"about_ca_topic_score_codex":0.000004310017,"about_ca_topic_score_gemma":0.00003518446,"teacher_disagreement_score":0.82299244,"about_ca_system_score_codex":0.000049796105,"about_ca_system_score_gemma":0.0001861618,"threshold_uncertainty_score":0.7032012},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013054248,0.00005497702,0.97707146,0.0031829234,0.0015182045,0.00024939646,0.000003731402,0.0002406809,0.017665539],"genre_scores_gemma":[0.2637127,0.00005863728,0.7256925,0.009083571,0.00077556423,0.0000073646383,0.000009858329,0.00005633822,0.0006034636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970106,0.000025740075,0.00040522483,0.0013396385,0.0008200628,0.00039877478],"domain_scores_gemma":[0.9983443,0.00030904857,0.00020302429,0.0008125742,0.00012582538,0.00020519693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033314948,0.00041281854,0.00036598236,0.00053509383,0.00020713733,0.00054550474,0.0017740554,0.00023463475,0.00010856815],"category_scores_gemma":[0.00009251296,0.0003993084,0.000122293,0.0005346714,0.0003537133,0.000491811,0.00046332297,0.0007966797,0.0002108124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034527498,0.000010440739,0.000018541377,0.000013537785,0.0000052374694,0.000055040804,0.0003890943,0.06747065,0.000060849783,0.0498834,0.000044625907,0.88204515],"study_design_scores_gemma":[0.00035196674,0.0002535011,0.00055303646,0.00035757877,0.000006736532,0.000069896814,1.9525366e-7,0.93158156,0.00056177855,0.061117087,0.004278974,0.0008677096],"about_ca_topic_score_codex":0.0000041291373,"about_ca_topic_score_gemma":0.000039845683,"teacher_disagreement_score":0.8811774,"about_ca_system_score_codex":0.0002348207,"about_ca_system_score_gemma":0.0004291137,"threshold_uncertainty_score":0.99984586},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006428438,0.0001946201,0.99157524,0.00012650076,0.00034804436,0.0003473127,0.0000021446615,0.00011593527,0.00086174835],"genre_scores_gemma":[0.80562955,0.000011972702,0.19356805,0.000061838204,0.00018965376,0.000006340491,0.0000036120243,0.000025979478,0.00050297746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611104,0.000052427273,0.00065849384,0.0014143356,0.0012776413,0.000486044],"domain_scores_gemma":[0.99785626,0.00020671736,0.00064931123,0.0008322978,0.00032475797,0.00013063548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006818792,0.00044513925,0.00081785466,0.0012949478,0.00024935516,0.00044730332,0.0020843023,0.00014431818,0.000009532534],"category_scores_gemma":[0.00002228923,0.0003668137,0.00022191639,0.0016939129,0.00024563205,0.00042194573,0.0009671094,0.00058579614,0.0000068116947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024950066,0.00007200916,0.015403341,0.00029804953,0.000800864,0.00022552672,0.0084281685,0.75664467,0.0029403921,0.11931578,9.0013833e-7,0.09584534],"study_design_scores_gemma":[0.0010749303,0.0012606656,0.07569092,0.008022055,0.0007341281,0.00008436532,0.00002286281,0.8931578,0.0053741997,0.010436589,0.00088479015,0.0032567084],"about_ca_topic_score_codex":0.00006520667,"about_ca_topic_score_gemma":0.000098208315,"teacher_disagreement_score":0.79920113,"about_ca_system_score_codex":0.00030216647,"about_ca_system_score_gemma":0.0002432347,"threshold_uncertainty_score":0.9998784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012708273,0.000093446055,0.98853755,0.0077723055,0.0014747905,0.00039344965,0.000045902947,0.0002866695,0.00012504078],"genre_scores_gemma":[0.31308252,0.000008399307,0.6850271,0.0014867953,0.00032688308,0.00004664645,0.0000089812065,0.000012007288,6.784098e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583554,0.00011506617,0.00044525557,0.0020774866,0.0008488952,0.0006777542],"domain_scores_gemma":[0.9972184,0.0006136917,0.00034380826,0.0013267824,0.00026818505,0.0002291555],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008270574,0.00041641956,0.00050855445,0.00037380855,0.0003133141,0.0013381591,0.005508583,0.00023250007,0.0000041665526],"category_scores_gemma":[0.00034989705,0.0004029049,0.00012196908,0.0023263895,0.0004496289,0.00054626924,0.0077626295,0.0014186027,0.000034503464],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001997531,0.00009611292,0.00030732824,0.00003659887,0.000024492305,0.00004928119,0.0035475171,0.015948605,0.0008195106,0.040057167,0.000075955526,0.9390354],"study_design_scores_gemma":[0.00014322474,0.000048108006,0.0021794392,0.0001831209,0.000005309321,0.000007813125,0.0000012428923,0.87936366,0.0023770414,0.114920326,0.00033898995,0.00043171408],"about_ca_topic_score_codex":0.00008362248,"about_ca_topic_score_gemma":0.000029750556,"teacher_disagreement_score":0.9386037,"about_ca_system_score_codex":0.00042830448,"about_ca_system_score_gemma":0.0008754575,"threshold_uncertainty_score":0.9998721},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025185309,0.0010772365,0.9930303,0.0024646726,0.0005547449,0.00031333827,8.689292e-7,0.0010444884,0.0014891847],"genre_scores_gemma":[0.08090135,0.000033158805,0.9161954,0.001955984,0.00045474942,0.000008407172,0.0000035015457,0.000047066274,0.00040041358],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961937,0.000044498654,0.00038221697,0.0017414294,0.0010757066,0.000562413],"domain_scores_gemma":[0.99793327,0.00029577498,0.0003601225,0.0009549571,0.00026204812,0.00019382023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005257312,0.00054956315,0.00048000045,0.00043182596,0.0002533252,0.00080375484,0.0032010362,0.00033444798,0.000011047377],"category_scores_gemma":[0.0001955622,0.00044705402,0.00008488856,0.00079938,0.00056180573,0.0009495661,0.0012137536,0.0018792048,0.000028252087],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003275401,0.000026890624,0.000019070763,0.0001132516,0.000030890435,0.0004840032,0.0019839178,0.0075274077,0.003526266,0.036365993,0.00010216705,0.9497874],"study_design_scores_gemma":[0.0006685489,0.0015256392,0.000022434788,0.0019119141,0.000047255067,0.001031055,9.4250765e-7,0.28669423,0.039181292,0.6575851,0.008528262,0.0028033264],"about_ca_topic_score_codex":0.000014615549,"about_ca_topic_score_gemma":0.000009556928,"teacher_disagreement_score":0.94698405,"about_ca_system_score_codex":0.00030353438,"about_ca_system_score_gemma":0.00047293646,"threshold_uncertainty_score":0.9997981},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018437278,0.00044087574,0.94395715,0.0008634406,0.00072144705,0.0005533235,0.0000024116143,0.0003836627,0.053059276],"genre_scores_gemma":[0.17314796,0.00003212413,0.8153302,0.005621408,0.00079819263,0.00003754033,0.000007340481,0.00009079832,0.0049344325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950663,0.000056408997,0.000503577,0.002442839,0.0010537812,0.0008771314],"domain_scores_gemma":[0.99766064,0.00022511509,0.0002466537,0.0012824988,0.00021094528,0.00037414595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006836404,0.00072432996,0.0006878126,0.00066279125,0.00039045722,0.0006716063,0.0046849656,0.00038502892,0.000013236944],"category_scores_gemma":[0.00017392065,0.0006461131,0.00021000727,0.0008493513,0.00036921425,0.00051040435,0.0031577896,0.0012714934,0.00022245258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019511786,0.000073741205,0.00002560294,0.00008627568,0.000021517373,0.00010959803,0.014319007,0.56710744,0.000145048,0.038940977,0.00025317742,0.37889808],"study_design_scores_gemma":[0.00020589004,0.0005416857,0.000026652186,0.00019453917,0.000008988862,0.000051730116,7.2916237e-7,0.95740324,0.00022423829,0.03743654,0.003104914,0.0008008739],"about_ca_topic_score_codex":0.0000109741395,"about_ca_topic_score_gemma":0.000008863439,"teacher_disagreement_score":0.39029574,"about_ca_system_score_codex":0.00028446835,"about_ca_system_score_gemma":0.0006200223,"threshold_uncertainty_score":0.99959904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001741237,0.0020077154,0.9032427,0.08254147,0.001867637,0.00065101916,0.000045428245,0.0010492911,0.008577331],"genre_scores_gemma":[0.012274976,0.0009843973,0.9824791,0.0027960758,0.0011292371,0.000019014557,0.00007895409,0.00010580947,0.0001324655],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9839098,0.00032050896,0.0012010287,0.005747023,0.006789749,0.0020319168],"domain_scores_gemma":[0.9528102,0.0042820983,0.00040593548,0.041435182,0.0005685382,0.0004980103],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0095974365,0.000900356,0.001033505,0.0013802355,0.00080235896,0.001831437,0.27828136,0.0012206315,0.00019029033],"category_scores_gemma":[0.11162706,0.00084864756,0.00013045383,0.0030468912,0.0028134345,0.0037614016,0.64829195,0.005993789,0.0002185585],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020109112,0.00006671593,0.00005843683,0.00023436919,0.000051062034,0.001618817,0.0004698192,0.00020311073,0.00009833138,0.016288443,0.03805667,0.94283414],"study_design_scores_gemma":[0.00018446326,0.00006742665,0.000014554139,0.0007733083,0.000004220169,0.00008839376,3.9543585e-7,0.4812674,0.00042971468,0.4859977,0.030628417,0.00054400146],"about_ca_topic_score_codex":0.00011332301,"about_ca_topic_score_gemma":0.00009609407,"teacher_disagreement_score":0.9422901,"about_ca_system_score_codex":0.00061961263,"about_ca_system_score_gemma":0.0027907384,"threshold_uncertainty_score":0.99990034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026896038,0.00085755065,0.9899887,0.0045178304,0.0013604249,0.0004519014,0.0000041245266,0.00015681107,0.002635778],"genre_scores_gemma":[0.0950777,0.00004126861,0.9006187,0.0032170347,0.0008673721,0.000020239175,0.000004337056,0.000046738445,0.000106662694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958023,0.0000967221,0.00054039474,0.0015205464,0.0011019651,0.0009380814],"domain_scores_gemma":[0.99708456,0.0009818597,0.000321346,0.0013035155,0.00012351458,0.00018517915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020568518,0.0005061123,0.00046531245,0.0005812881,0.0008315593,0.00089026766,0.0047137253,0.00019059039,0.000024897841],"category_scores_gemma":[0.00009538439,0.0003530164,0.00027729236,0.001207653,0.00044606676,0.00033382958,0.00316952,0.0010646122,0.00003102746],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025145832,0.0000129508135,0.00012513259,0.00003697783,0.00003192324,0.00010584328,0.001443346,0.0050780154,0.00020292048,0.11752242,0.00005431431,0.8753836],"study_design_scores_gemma":[0.00039693734,0.00024732653,0.0006891471,0.00040163452,0.000044237193,0.00017471335,0.0000013469771,0.52999085,0.0038726088,0.43951404,0.023459248,0.0012078872],"about_ca_topic_score_codex":0.000031395026,"about_ca_topic_score_gemma":0.00015971494,"teacher_disagreement_score":0.8741757,"about_ca_system_score_codex":0.00012307038,"about_ca_system_score_gemma":0.00029188386,"threshold_uncertainty_score":0.9998922},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046268534,0.00045264742,0.96303767,0.0036575098,0.0056362315,0.000461163,0.00006279799,0.00009906947,0.021966077],"genre_scores_gemma":[0.9859445,0.00001526197,0.004649047,0.006882449,0.0019026244,0.000014463084,0.000052433825,0.000042355685,0.0004968344],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792844,0.000036463505,0.00045433838,0.0009594981,0.00037764115,0.00024363615],"domain_scores_gemma":[0.9983627,0.00042441007,0.00026260185,0.000731379,0.0001477762,0.00007112518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015361435,0.0003763642,0.000327497,0.0001874499,0.0002329475,0.00017013989,0.0012596172,0.0002415497,0.00022897313],"category_scores_gemma":[0.00004604607,0.00026103496,0.00009158606,0.00019259634,0.00041013473,0.00011833877,0.000417029,0.0012033436,0.00031901113],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013511175,0.00007081025,0.00009539969,0.000016371328,0.00009976017,0.00006754145,0.01432106,0.022176467,0.0005011527,0.12074014,0.002242977,0.8395332],"study_design_scores_gemma":[0.0009544548,0.0017297519,0.0022642654,0.0020137224,0.000063965934,0.00004235384,0.000036472924,0.3248351,0.0013199504,0.5166953,0.14800026,0.0020443846],"about_ca_topic_score_codex":0.0002656836,"about_ca_topic_score_gemma":0.00052693643,"teacher_disagreement_score":0.9813177,"about_ca_system_score_codex":0.00015791085,"about_ca_system_score_gemma":0.00006561728,"threshold_uncertainty_score":0.9999842},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016083015,0.00041315312,0.9840788,0.005774883,0.004242867,0.00088309206,0.000052025087,0.000113573515,0.004280771],"genre_scores_gemma":[0.30917138,0.00011413218,0.649067,0.034591667,0.0040254495,0.00012792411,0.00011649317,0.00023122634,0.002554735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99453056,0.0000566742,0.0007511738,0.0025120203,0.0010347308,0.0011148431],"domain_scores_gemma":[0.99544525,0.0010478226,0.000468007,0.0020200568,0.00066687854,0.00035198647],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005933771,0.0009559742,0.0009431788,0.00080791663,0.00046405778,0.0007745256,0.0069470475,0.00044317657,0.000038801638],"category_scores_gemma":[0.00046367882,0.00083913247,0.00042549265,0.0007426119,0.00077926595,0.0013594653,0.0033105393,0.0013141116,0.00020009],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035627128,0.00030185975,0.0003064742,0.00043523693,0.0002865553,0.0005989345,0.008378037,0.0053302892,0.011941721,0.15683211,0.009986063,0.8052464],"study_design_scores_gemma":[0.0037084254,0.0028981832,0.0023199273,0.0012712571,0.00009634727,0.0003808163,0.000003508079,0.5587639,0.030663162,0.33934712,0.055927455,0.004619886],"about_ca_topic_score_codex":0.000041539166,"about_ca_topic_score_gemma":0.000065815606,"teacher_disagreement_score":0.8006266,"about_ca_system_score_codex":0.00044216838,"about_ca_system_score_gemma":0.00077247276,"threshold_uncertainty_score":0.9994059},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026744992,0.0018794513,0.64073884,0.005167131,0.00980185,0.0026203329,0.00003763031,0.00032344766,0.3126863],"genre_scores_gemma":[0.98750204,0.00002342178,0.010561331,0.00047285052,0.0012709157,0.00000556783,0.000005106027,0.000018063853,0.00014068786],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976918,0.00007631499,0.00048014123,0.000615167,0.00076821656,0.0003683443],"domain_scores_gemma":[0.9987557,0.00051635137,0.00031927694,0.00015504762,0.00012746955,0.00012618453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009898298,0.00023774493,0.00044571914,0.0006736137,0.00027406935,0.00013325433,0.0009963891,0.00019542573,0.00003864901],"category_scores_gemma":[0.0016246543,0.0002400511,0.000084825115,0.00062178,0.0016023697,0.00009047504,0.0005394851,0.00055584754,0.000009354313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001132958,0.000052526215,0.011533294,0.00015267165,0.000035420562,0.000093547176,0.41970584,0.0008049789,0.00013760806,0.1807168,0.0000535194,0.38670248],"study_design_scores_gemma":[0.0026836672,0.00037359688,0.012029573,0.0048562465,0.00015219665,0.000002015611,0.0004602744,0.07606625,0.0026732902,0.88316876,0.01358644,0.003947698],"about_ca_topic_score_codex":0.00015908452,"about_ca_topic_score_gemma":0.0029786017,"teacher_disagreement_score":0.9607571,"about_ca_system_score_codex":0.00028734663,"about_ca_system_score_gemma":0.0004775712,"threshold_uncertainty_score":0.9789},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008179323,0.0001140047,0.9153981,0.0002452337,0.00036100385,0.000737429,0.000003929642,0.000107262735,0.082215056],"genre_scores_gemma":[0.37621677,0.000015890382,0.62142646,0.0011354167,0.00042947015,0.000012256776,0.0000041966973,0.0001182035,0.00064133137],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975267,0.000013735451,0.00058972556,0.0006250059,0.0009030362,0.0003418166],"domain_scores_gemma":[0.994143,0.0048982906,0.0003649211,0.00035431876,0.00011796836,0.00012149446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003885748,0.0004213728,0.00072414626,0.00027272315,0.00008113671,0.00009941458,0.0007133,0.00018166761,0.000035328052],"category_scores_gemma":[0.0017307354,0.0003456404,0.00014421094,0.00025249275,0.0003570621,0.000089585425,0.0005682824,0.00052145345,0.00007423161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000390259,0.0004597641,0.000012924876,0.004151309,0.00012537654,0.00048839446,0.0038598247,0.00025149054,0.0009095169,0.17880608,0.00011161312,0.8107847],"study_design_scores_gemma":[0.0002448313,0.00017577838,0.000013486676,0.0051169456,0.000029296465,0.000014172109,8.999671e-7,0.0025033914,0.020670952,0.9707563,0.00004540553,0.00042857172],"about_ca_topic_score_codex":6.41103e-7,"about_ca_topic_score_gemma":0.0000033656274,"teacher_disagreement_score":0.8103561,"about_ca_system_score_codex":0.00013244747,"about_ca_system_score_gemma":0.00014567132,"threshold_uncertainty_score":0.99989957},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93327606,0.00048256203,0.059526198,0.0042099776,0.0015547478,0.00067512016,0.00003952953,0.00004990231,0.00018592225],"genre_scores_gemma":[0.99719346,0.000044401462,0.0022112734,0.0004917145,0.000021751239,0.0000062779563,0.000002554746,0.0000070194305,0.000021543632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669445,0.000057339523,0.0007146393,0.00081832835,0.0014862262,0.00022904438],"domain_scores_gemma":[0.99711424,0.0017901271,0.00040881205,0.00042719734,0.0001871223,0.00007248861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011105688,0.00024039522,0.00033715056,0.0005008109,0.00020488075,0.00015790247,0.0010545604,0.00021774844,0.000005513691],"category_scores_gemma":[0.0010329591,0.00015000821,0.000047867747,0.0004839077,0.0014103942,0.00017148441,0.000455808,0.00056980905,0.000004724276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056695302,0.000019450657,0.00038958716,0.0000030214196,0.0000037005484,0.000009617271,0.0077131107,0.22689973,0.00031304604,0.00880459,0.000017323839,0.75577015],"study_design_scores_gemma":[0.0005315617,0.0003692507,0.0026936743,0.00033432248,0.0000062840095,0.000011584612,0.00007298172,0.8321888,0.0018717702,0.1614103,0.00013893009,0.00037056216],"about_ca_topic_score_codex":0.000019439138,"about_ca_topic_score_gemma":0.00015294473,"teacher_disagreement_score":0.7553996,"about_ca_system_score_codex":0.0001431872,"about_ca_system_score_gemma":0.00020762564,"threshold_uncertainty_score":0.61171573},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005894555,0.00015015231,0.9920734,0.004537314,0.0010239757,0.0008339903,0.0000293716,0.00032196718,0.00097086147],"genre_scores_gemma":[0.1986849,0.000011121274,0.79733956,0.0030576566,0.00071976066,0.000033298835,0.000017333748,0.00007178242,0.00006458645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959049,0.00005872976,0.00057241495,0.0015917807,0.0010931636,0.0007789825],"domain_scores_gemma":[0.9971897,0.0010144069,0.0002230138,0.001021459,0.00027446667,0.0002769299],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010848114,0.0005800686,0.0006428423,0.00082162255,0.00047682758,0.0005885166,0.0033352864,0.00031363542,0.00001078661],"category_scores_gemma":[0.00017248117,0.0005428265,0.00030341785,0.0007906401,0.00043046614,0.0004317361,0.00042053885,0.00081623,0.0000305387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008449427,0.000021062282,0.0000022865609,0.00018574011,0.000013587592,0.000025900612,0.0008300809,0.22588392,0.00016728489,0.014944297,0.000028441267,0.757889],"study_design_scores_gemma":[0.0003481402,0.00023916214,0.000011614571,0.00049170793,0.000013951739,0.000020979036,1.8615795e-7,0.9499669,0.0069835195,0.040043097,0.0012690158,0.0006117387],"about_ca_topic_score_codex":0.000011079619,"about_ca_topic_score_gemma":0.000007985704,"teacher_disagreement_score":0.7572772,"about_ca_system_score_codex":0.00024580883,"about_ca_system_score_gemma":0.00095686055,"threshold_uncertainty_score":0.99970233},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013632975,0.00026629632,0.99317193,0.0036731346,0.0014485348,0.0006204895,0.000033144657,0.00022100906,0.00056407985],"genre_scores_gemma":[0.12304485,0.00037279294,0.82910794,0.038160913,0.0054327725,0.00012330047,0.00042594917,0.0002658536,0.0030656578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969497,0.000032201526,0.0005166556,0.0012369892,0.00081233867,0.00045216017],"domain_scores_gemma":[0.99736375,0.0006596608,0.0003299985,0.0011186579,0.0004127779,0.000115151204],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006198057,0.0004600429,0.00042352703,0.00028772742,0.0005350556,0.0013502022,0.0032797847,0.00021628398,0.000020807827],"category_scores_gemma":[0.0007838529,0.00033984144,0.00015379323,0.00090286165,0.00047835254,0.000602318,0.0010425611,0.00038778753,0.00001981834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016832755,0.000030776053,0.000044404464,0.00014516705,0.000039782975,0.000028196408,0.0014524512,0.026954321,0.000079834026,0.6015402,0.000917471,0.3687505],"study_design_scores_gemma":[0.00021085644,0.00014202914,0.000025954338,0.00013979593,0.00002096487,0.000023497236,2.7631356e-7,0.8498424,0.00045373262,0.105844975,0.04280404,0.00049145706],"about_ca_topic_score_codex":0.000005042822,"about_ca_topic_score_gemma":0.000041812375,"teacher_disagreement_score":0.8228881,"about_ca_system_score_codex":0.00013087253,"about_ca_system_score_gemma":0.00049825927,"threshold_uncertainty_score":0.99990535},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001051739,0.00015635409,0.9951786,0.0002524339,0.0014512518,0.0012984461,0.0000052636487,0.00024058779,0.00036536827],"genre_scores_gemma":[0.4869215,0.0000047434332,0.5124803,0.00025554848,0.00026804136,0.000024684961,0.0000036724855,0.000021369111,0.000020114705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957943,0.00012179693,0.0006633818,0.0018889114,0.0010473815,0.0004842353],"domain_scores_gemma":[0.99785596,0.00023454252,0.00043516405,0.00090792903,0.0003709587,0.00019546734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009340954,0.0005512372,0.0006725586,0.00056900375,0.0005701721,0.00067136897,0.0013630291,0.00025349602,0.000015593161],"category_scores_gemma":[0.00005900964,0.00051330484,0.000117954136,0.00059135846,0.00040877156,0.0009476725,0.0018957687,0.0009873117,0.00002127783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087432374,0.00046938434,0.00008131056,0.00022094743,0.00010984447,0.00064659014,0.0140430005,0.12591608,0.06759227,0.0024038116,0.00009176344,0.7883376],"study_design_scores_gemma":[0.00042203613,0.00039596818,0.000031153384,0.00063191226,0.00001668121,0.00024810576,0.000010955313,0.9489666,0.014123467,0.03428462,0.000056690802,0.0008117726],"about_ca_topic_score_codex":0.00007766238,"about_ca_topic_score_gemma":0.000018317023,"teacher_disagreement_score":0.82305056,"about_ca_system_score_codex":0.00036367372,"about_ca_system_score_gemma":0.00050915685,"threshold_uncertainty_score":0.99973184},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001999114,0.001349316,0.9447287,0.01586926,0.009090823,0.0019432112,0.000086642074,0.00020722373,0.024725722],"genre_scores_gemma":[0.89626145,0.00039856433,0.039222986,0.058967113,0.0031999103,0.000048001413,0.000109306304,0.00010631996,0.0016863681],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960622,0.00013384153,0.0008940449,0.000980208,0.001104268,0.00082539377],"domain_scores_gemma":[0.99652064,0.001448653,0.00042885667,0.00056617864,0.00041306936,0.0006226221],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001047781,0.0003827783,0.00080344215,0.00036979004,0.00032556034,0.000014719591,0.0010771019,0.0010524348,0.0001764157],"category_scores_gemma":[0.001123138,0.00031432172,0.00008883555,0.0006758395,0.00037245406,0.000084251296,0.0007293833,0.003681798,0.00016547047],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000216483,0.000057738616,0.00019078466,0.0025442652,0.000052922485,0.00027347432,0.02049288,0.002178387,0.0023001637,0.0078032543,0.005993042,0.9578966],"study_design_scores_gemma":[0.0034617346,0.002996692,0.00187699,0.0328581,0.0001171748,0.000024369341,0.00006701112,0.03313538,0.026374502,0.39438707,0.5005472,0.0041538016],"about_ca_topic_score_codex":0.00013521044,"about_ca_topic_score_gemma":0.00024848199,"teacher_disagreement_score":0.9537428,"about_ca_system_score_codex":0.00031921873,"about_ca_system_score_gemma":0.0015166759,"threshold_uncertainty_score":0.99993086},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021846459,0.00032189288,0.9866222,0.007906719,0.0017753204,0.001276292,0.00013784585,0.0013290691,0.00041221041],"genre_scores_gemma":[0.109906025,0.00007030483,0.8881614,0.0006990501,0.0008102554,0.00005792713,0.00015277385,0.00010249721,0.00003975749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921203,0.000075130425,0.0010036865,0.003930581,0.0014810214,0.0013892748],"domain_scores_gemma":[0.9804665,0.0008493147,0.0006067022,0.017370654,0.00032371792,0.00038313633],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0009324801,0.0010401543,0.0009690934,0.0010273028,0.00057294476,0.0015955011,0.085035495,0.00046247113,0.00004817371],"category_scores_gemma":[0.0070965425,0.0010159113,0.00022097852,0.0009644744,0.0007773487,0.0033852863,0.12704788,0.0015672077,0.000023418803],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000454489,0.00016074812,0.0001220603,0.00046400772,0.00007840186,0.0001934929,0.0007236453,0.007932653,0.002479937,0.041651502,0.0038868918,0.9422612],"study_design_scores_gemma":[0.00033495555,0.00026046872,0.000047997393,0.000312997,0.000014842859,0.000022073098,3.866365e-7,0.6339149,0.0023423373,0.359246,0.0026938797,0.00080915744],"about_ca_topic_score_codex":0.00004416572,"about_ca_topic_score_gemma":0.00004122384,"teacher_disagreement_score":0.941452,"about_ca_system_score_codex":0.00037070693,"about_ca_system_score_gemma":0.0008731209,"threshold_uncertainty_score":0.99944097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007250516,0.00031932478,0.9889816,0.001838448,0.0008050503,0.00041730376,0.000026812642,0.00017268003,0.00018828028],"genre_scores_gemma":[0.7956009,0.00004480356,0.20275919,0.0012363364,0.00022449029,0.00001764026,0.0000059449612,0.000020277808,0.000090447465],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974872,0.0000098078,0.0003153773,0.0013528484,0.0003856425,0.00044914577],"domain_scores_gemma":[0.998867,0.0003075677,0.00014857916,0.0004656583,0.00007350731,0.00013773941],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023503504,0.00042703457,0.0005126483,0.00036415283,0.00045948153,0.0006018492,0.0010407319,0.0003340652,0.0000014974632],"category_scores_gemma":[0.00014173929,0.0003763571,0.000059768627,0.00024664105,0.0008422398,0.00056464307,0.0021798268,0.00057398266,0.0000018629845],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020812198,0.00002184182,0.00031459722,0.00010028982,0.000057562444,0.00006310315,0.002445956,0.00010536352,0.00012234566,0.059235033,0.00007607707,0.937437],"study_design_scores_gemma":[0.00174538,0.0009821721,0.0016034333,0.0009776028,0.00004425657,0.00026071753,0.0000046633745,0.32960948,0.00055553485,0.65806264,0.004431304,0.0017228114],"about_ca_topic_score_codex":0.0000035611874,"about_ca_topic_score_gemma":0.000009278897,"teacher_disagreement_score":0.9357142,"about_ca_system_score_codex":0.00008841596,"about_ca_system_score_gemma":0.00010840481,"threshold_uncertainty_score":0.9998688},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042900283,0.00007715257,0.98026556,0.0011020605,0.001252049,0.0014353622,0.000009574156,0.00036892167,0.015446413],"genre_scores_gemma":[0.28785512,0.000004692277,0.70943564,0.0019473992,0.00057857396,0.00007082823,0.000017401442,0.000043573844,0.000046780337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994292,0.000098600736,0.0011787801,0.0020442696,0.0012553801,0.0011309567],"domain_scores_gemma":[0.9964801,0.00040684,0.0003064053,0.0013840371,0.0006473903,0.0007752245],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016693645,0.0007735711,0.00072191615,0.0017594713,0.00057700824,0.0014216481,0.00454777,0.00038774445,0.000015073029],"category_scores_gemma":[0.00025708994,0.0008144176,0.0001558523,0.002640794,0.00035447185,0.0040247366,0.00092217134,0.00096824166,0.0006262786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027895232,0.00003676357,2.8738407e-7,0.00002558214,0.0000051070683,0.000009867719,0.027075566,0.19987051,0.00013177273,0.14791359,0.0000053977133,0.62489766],"study_design_scores_gemma":[0.000034371453,0.0007406061,0.000003183489,0.00020647288,0.000007142876,0.000020271844,0.00005251123,0.81222355,0.007975871,0.17663679,0.0012564535,0.0008427913],"about_ca_topic_score_codex":0.000057676454,"about_ca_topic_score_gemma":0.00016999016,"teacher_disagreement_score":0.62405485,"about_ca_system_score_codex":0.00059241813,"about_ca_system_score_gemma":0.0010070289,"threshold_uncertainty_score":0.99961495},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082479986,0.0005077165,0.9954022,0.00070218515,0.0009588647,0.00047386988,0.000059043512,0.00019165376,0.0016219841],"genre_scores_gemma":[0.15022218,0.000009829622,0.84822774,0.0011979734,0.00025317975,0.0000052213013,0.00003824009,0.000028135508,0.000017526429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952659,0.00006790611,0.0007165436,0.002077512,0.0011890926,0.00068305153],"domain_scores_gemma":[0.9969465,0.0004496406,0.0005370031,0.0015024242,0.00031306694,0.00025134074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045397345,0.00068855105,0.0010034525,0.0010695446,0.00048453722,0.0009545506,0.0036582795,0.00035542142,0.00004156888],"category_scores_gemma":[0.00009610847,0.00059169525,0.0003667435,0.0030051398,0.0009101049,0.00085012586,0.0014123103,0.0009038466,0.000024761766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007862848,0.000021569047,0.00009492677,0.000030800795,0.00024811507,0.00012091466,0.004481339,0.6767616,0.000056311987,0.15710029,0.000024514124,0.16105175],"study_design_scores_gemma":[0.0001573082,0.00011264726,0.00014259403,0.00005558958,0.000090357426,0.000017884267,8.233371e-7,0.81111723,0.0000883637,0.18749791,0.0001426839,0.0005766005],"about_ca_topic_score_codex":0.000069103706,"about_ca_topic_score_gemma":0.00021602875,"teacher_disagreement_score":0.16047515,"about_ca_system_score_codex":0.00029416019,"about_ca_system_score_gemma":0.00048352164,"threshold_uncertainty_score":0.99965346},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024272753,0.000009238081,0.97309726,0.00089855323,0.000066192944,0.0011035714,0.0000022533,0.00006944938,0.00048071405],"genre_scores_gemma":[0.90722847,0.0000029786486,0.092204064,0.0003791075,0.00004468409,0.000094735624,0.000014869238,0.000022175082,0.000008907588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862593,0.000004051592,0.00028454064,0.00057845464,0.00026659595,0.00024040323],"domain_scores_gemma":[0.99918514,0.000054451342,0.00039662956,0.000117312404,0.00023824077,0.000008204983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003286376,0.0002457702,0.00027598537,0.0005380984,0.00022099119,0.000060823408,0.00034221174,0.00020164656,0.000001615511],"category_scores_gemma":[0.00013055722,0.00022005063,0.000017509723,0.0005665196,0.000690552,0.00045990193,0.00027572145,0.00026828455,5.7635316e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003117473,0.00016374572,0.005890539,0.00086910883,0.00011833889,0.000004937138,0.005549363,0.02896291,0.0008364128,0.10452299,0.000003522501,0.8527664],"study_design_scores_gemma":[0.0006630122,0.00016342683,0.0010725181,0.00035331576,0.00004122792,0.0000010489308,0.000018385823,0.53332525,0.0061991108,0.4576415,0.000030466706,0.0004906922],"about_ca_topic_score_codex":0.0000028647032,"about_ca_topic_score_gemma":0.00001982575,"teacher_disagreement_score":0.88295573,"about_ca_system_score_codex":0.00007232989,"about_ca_system_score_gemma":0.00016259961,"threshold_uncertainty_score":0.8973404},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010124188,0.00013893144,0.9437304,0.042184982,0.002147261,0.0014178402,0.0000058207193,0.00022850593,0.000022047796],"genre_scores_gemma":[0.42490956,0.000016319826,0.5515723,0.022886576,0.00033637977,0.00024132305,0.0000028203222,0.000018095185,0.00001658426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950156,0.00016886188,0.00045327365,0.0024121595,0.0010742676,0.0008758329],"domain_scores_gemma":[0.99501026,0.00072755857,0.00019687046,0.0033985442,0.0003538436,0.00031290445],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0008369973,0.00050534034,0.0004245021,0.00040760773,0.00044061133,0.0015501243,0.006668514,0.00020773603,0.000019929934],"category_scores_gemma":[0.00026988363,0.00034722907,0.00011930094,0.0043034935,0.00022428576,0.0005752023,0.008950748,0.0010225902,0.0000686193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008866184,0.000057987378,0.00028047085,0.00002576879,0.000007980447,0.000031668525,0.003675204,0.61396116,0.0010650468,0.0005281211,0.00057364354,0.37978408],"study_design_scores_gemma":[0.0001856611,0.00017303159,0.008211495,0.0006812344,0.000013164196,0.00009490687,0.0000029169785,0.9040127,0.05689712,0.024633681,0.003924872,0.0011692517],"about_ca_topic_score_codex":0.000077849865,"about_ca_topic_score_gemma":0.00040737144,"teacher_disagreement_score":0.41478536,"about_ca_system_score_codex":0.000304145,"about_ca_system_score_gemma":0.0006036176,"threshold_uncertainty_score":0.99989796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012379003,0.00038926094,0.9952857,0.00087394734,0.00052015117,0.0011400882,0.0000052884748,0.00030507758,0.00024257803],"genre_scores_gemma":[0.5571041,0.000028200744,0.44135675,0.001102785,0.00031213282,0.000042251228,0.0000043453806,0.00003813461,0.000011306094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965897,0.000038551658,0.00050085026,0.0017104476,0.0005726171,0.00058781815],"domain_scores_gemma":[0.99523157,0.0030185014,0.0004673918,0.0008421253,0.00023710227,0.00020330121],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058341096,0.0005077947,0.0005006928,0.00046667008,0.0006198974,0.00057832315,0.0017174201,0.00022824861,0.0000012461619],"category_scores_gemma":[0.00090009515,0.000523765,0.00010529313,0.00077571016,0.00037147602,0.0009297908,0.001262375,0.0006961099,0.000004318459],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017950564,0.000014011094,0.000046584835,0.0001068392,0.0000126755,0.00001869869,0.0011337693,0.013071672,0.0053438344,0.011639994,0.0000034779982,0.9685905],"study_design_scores_gemma":[0.00042836583,0.00017926928,0.00027933257,0.00036196687,0.000012476571,0.00010052963,7.3007897e-7,0.8444714,0.0050907093,0.14809401,0.0003058362,0.00067538966],"about_ca_topic_score_codex":0.00001211113,"about_ca_topic_score_gemma":0.00003456938,"teacher_disagreement_score":0.9679151,"about_ca_system_score_codex":0.00029056863,"about_ca_system_score_gemma":0.00027643316,"threshold_uncertainty_score":0.9997214},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32659245,0.00031186602,0.67082566,0.00011637911,0.0009869928,0.00054536184,0.000009153412,0.00011123806,0.00050092087],"genre_scores_gemma":[0.9986384,0.0000092424425,0.00093882834,0.0001076634,0.0002324522,0.0000053443146,0.00003598723,0.000014379675,0.000017681783],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99843925,0.000017651006,0.0002990443,0.00070188433,0.00038942345,0.00015276353],"domain_scores_gemma":[0.99910545,0.00008688401,0.000256398,0.0003234492,0.00020466147,0.000023131879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050493656,0.00022510372,0.0003781361,0.00084554235,0.00014913756,0.00038995317,0.00040738416,0.00013409148,0.00008506842],"category_scores_gemma":[0.000048625305,0.00020706728,0.00010107242,0.00055801234,0.00028874047,0.00078934117,0.000246981,0.00022355573,0.000009556164],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000715415,0.000046198602,0.02323761,0.0004126642,0.000042540436,0.000009984554,0.00020599486,0.0025637602,0.019386362,0.0013635233,0.0000024240042,0.9526574],"study_design_scores_gemma":[0.0011229188,0.00003454193,0.7756876,0.0013342203,0.0010211584,0.0000023765283,0.0000032854339,0.18840788,0.0076321913,0.021686554,0.001684481,0.0013828304],"about_ca_topic_score_codex":0.00006860021,"about_ca_topic_score_gemma":0.000072064686,"teacher_disagreement_score":0.9512746,"about_ca_system_score_codex":0.000027936538,"about_ca_system_score_gemma":0.000035323348,"threshold_uncertainty_score":0.8443958},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025393318,0.0001236373,0.9946214,0.000096166805,0.00019376281,0.0002465912,0.000016267939,0.0000967171,0.0020661582],"genre_scores_gemma":[0.98518014,0.0000031023421,0.012957761,0.00020121125,0.0015484549,0.000005770044,0.000056059645,0.00004305697,0.0000044215144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774975,0.000049823673,0.00056860334,0.00062350766,0.0004128433,0.0005954655],"domain_scores_gemma":[0.9987038,0.00029502797,0.00035651392,0.00046506024,0.00009932743,0.00008030717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043237218,0.0004823038,0.0007247776,0.00040572754,0.0005252308,0.00036799468,0.0011104154,0.00018562874,0.0000855827],"category_scores_gemma":[0.0000068477684,0.0005190666,0.00021616132,0.00076127,0.00039889256,0.00020362268,0.0010926776,0.0016053589,0.0000016500119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001640703,0.000044041422,0.011097404,0.00002940552,0.000083863306,0.00002708686,0.0014896506,0.68528795,0.000103911414,0.021261966,0.000015913685,0.2805424],"study_design_scores_gemma":[0.0001595969,0.00002575739,0.00036633638,0.00035795485,0.00002506529,0.0000020625457,0.000005325968,0.89433444,0.000059380734,0.10409896,0.00006851919,0.00049660134],"about_ca_topic_score_codex":0.00041256705,"about_ca_topic_score_gemma":0.0003142147,"teacher_disagreement_score":0.9826408,"about_ca_system_score_codex":0.0002948107,"about_ca_system_score_gemma":0.00017084829,"threshold_uncertainty_score":0.9997261},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16921605,0.00014118558,0.8287002,0.0008136497,0.0006892704,0.00006783646,8.20056e-8,0.00021337943,0.000158363],"genre_scores_gemma":[0.72867554,0.0000078567255,0.27086598,0.00042056074,0.000021757742,0.000005908523,3.3247932e-8,0.0000018924054,4.80202e-7],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988379,0.000018053008,0.00014460587,0.0005518305,0.00013487408,0.0003127593],"domain_scores_gemma":[0.999284,0.00007797182,0.000050425617,0.0004942135,0.000057358284,0.000035989346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002999357,0.000119080374,0.00013821511,0.0005984924,0.00022114607,0.00006656913,0.0010356117,0.00010157746,0.00000544558],"category_scores_gemma":[0.000089034074,0.00010035307,0.00001576237,0.0016798417,0.00074468437,0.00047409674,0.00092695374,0.0002700187,0.000008684562],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023327018,0.00003558022,0.008951457,0.0000043290133,0.0000036935944,0.000025411058,0.004766763,0.000058283556,0.00041177394,0.023675336,0.0000069657167,0.96205807],"study_design_scores_gemma":[0.0004660416,0.00042101622,0.037074815,0.000072701434,0.000004449282,0.0004039922,0.00001761548,0.22684179,0.024280766,0.70937586,0.00050384895,0.0005371095],"about_ca_topic_score_codex":0.000026542213,"about_ca_topic_score_gemma":0.00008828754,"teacher_disagreement_score":0.96152097,"about_ca_system_score_codex":0.00003576338,"about_ca_system_score_gemma":0.000042432388,"threshold_uncertainty_score":0.40922794},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034211623,0.00077748497,0.9877972,0.0004464207,0.008588226,0.0010320072,0.0000583491,0.00033697952,0.0006212401],"genre_scores_gemma":[0.5307252,0.00021017545,0.4603753,0.0014550684,0.0063222176,0.00006559291,0.00012988427,0.00012532316,0.0005912651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99392664,0.000027976621,0.0010178859,0.0029990426,0.001140313,0.0008881118],"domain_scores_gemma":[0.99409574,0.00053848856,0.00047049054,0.0041740895,0.0004507915,0.0002704167],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020493579,0.0006964088,0.00086400856,0.0004617478,0.00056728953,0.0010787435,0.009391577,0.00048646372,0.000004869537],"category_scores_gemma":[0.00010101457,0.000594257,0.0001743916,0.0006240122,0.0005138246,0.0015455812,0.0033612847,0.000867297,0.00008359967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025881622,0.000030343102,0.0008933812,0.0008759131,0.000026810565,0.000020845479,0.00066976517,0.2980799,0.000013272835,0.0013298673,0.000091422495,0.6979426],"study_design_scores_gemma":[0.00035867875,0.00019656213,0.000030990057,0.00056531833,0.00000918751,0.000045121553,8.773758e-8,0.97609276,0.00029326996,0.007469841,0.014216787,0.0007214081],"about_ca_topic_score_codex":0.0000417944,"about_ca_topic_score_gemma":0.000055220655,"teacher_disagreement_score":0.6972212,"about_ca_system_score_codex":0.0003503386,"about_ca_system_score_gemma":0.0012167022,"threshold_uncertainty_score":0.9999582},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45926648,0.00018254136,0.536258,0.002245447,0.00010357479,0.0018663175,0.000019211688,0.000036673093,0.000021744818],"genre_scores_gemma":[0.96697676,0.000023054035,0.03251403,0.00014895108,0.00013374777,0.000030622476,0.000039414674,0.00007209146,0.00006132789],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9972471,0.000037344274,0.0004600493,0.0010473655,0.0007499862,0.00045816397],"domain_scores_gemma":[0.99849564,0.00027097168,0.00043263592,0.00051214395,0.00017289865,0.00011569879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049308914,0.00046704448,0.0007081155,0.00037449595,0.00039077166,0.00013952497,0.00028383863,0.0001754515,0.00000614953],"category_scores_gemma":[0.00019353768,0.00034190816,0.00012481943,0.00047731807,0.0004952581,0.00025815866,0.00030086987,0.0006232378,0.0000024653134],"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.001548391,0.0006778649,0.53624165,0.00083086756,0.000520363,0.000029672563,0.0017987825,0.054477043,0.008225299,0.0047842795,0.0000053627323,0.39086044],"study_design_scores_gemma":[0.0049687577,0.0029574193,0.56568897,0.00221244,0.0005634694,0.00067272177,0.00002368156,0.41756582,0.0001321417,0.0029488672,0.0007549617,0.0015107215],"about_ca_topic_score_codex":0.00020034093,"about_ca_topic_score_gemma":0.0006046621,"teacher_disagreement_score":0.5077103,"about_ca_system_score_codex":0.00020166558,"about_ca_system_score_gemma":0.000317809,"threshold_uncertainty_score":0.9999033},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006795434,0.0014059873,0.9336674,0.053217076,0.0027017633,0.00049373467,0.0000616529,0.00020009758,0.008245495],"genre_scores_gemma":[0.0520397,0.0021508934,0.93318516,0.009652555,0.0021859282,0.0001188997,0.00009696606,0.00010810452,0.00046177456],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969129,0.000048028338,0.0004971723,0.0016759962,0.00044605642,0.00041982578],"domain_scores_gemma":[0.99622333,0.0018456671,0.00038036786,0.0008360325,0.00047041266,0.00024418687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037598086,0.00047983634,0.0004839135,0.00055559084,0.00032736154,0.00050520746,0.0017864559,0.00025980923,0.000029675268],"category_scores_gemma":[0.00019966211,0.0005065434,0.00012256492,0.00020464436,0.00032034895,0.0014230631,0.0009040464,0.00089665357,0.000021811937],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012273403,0.000024961324,6.5746656e-7,0.000023372964,0.000042205054,0.00002139446,0.01960951,0.00036168535,0.00004065091,0.14929684,0.00013352881,0.8304329],"study_design_scores_gemma":[0.0003740457,0.0003376648,0.000028949362,0.0005603209,0.000032932865,0.000085677384,0.00018270192,0.32558516,0.0001320657,0.5863409,0.085528605,0.0008109843],"about_ca_topic_score_codex":0.00010313287,"about_ca_topic_score_gemma":0.0005866791,"teacher_disagreement_score":0.8296219,"about_ca_system_score_codex":0.0005543392,"about_ca_system_score_gemma":0.0005496079,"threshold_uncertainty_score":0.99973863},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24543308,0.0037814628,0.23570931,0.43749446,0.018747797,0.011311981,0.00032924907,0.002354805,0.04483787],"genre_scores_gemma":[0.9632188,0.000094445175,0.02934458,0.005925036,0.00060920377,0.000022786615,0.000008730247,0.000062983556,0.0007134361],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950177,0.00014491375,0.00059874385,0.0016901555,0.0015286682,0.0010198357],"domain_scores_gemma":[0.9966717,0.0013151541,0.00056578964,0.00083401334,0.00021219513,0.00040117],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011160675,0.00052135764,0.00064369617,0.00095312356,0.00046432303,0.00029302342,0.00295121,0.0005180728,0.000082082915],"category_scores_gemma":[0.0023714234,0.00053485105,0.00007057683,0.0016059398,0.0010722495,0.0004649237,0.00085466134,0.0015416398,0.00006166541],"study_design_candidate":"design_other","study_design_consensus":null,"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.00019035052,0.00014252224,0.029839344,0.0002476786,0.00009400245,0.004735162,0.1136952,0.013939695,0.00035436972,0.013353585,0.005028755,0.81837934],"study_design_scores_gemma":[0.0047391076,0.0015703925,0.0487156,0.008344748,0.00025141987,0.0002455011,0.0023741757,0.020845668,0.0053924015,0.10485042,0.7888069,0.013863652],"about_ca_topic_score_codex":0.55966395,"about_ca_topic_score_gemma":0.99445456,"teacher_disagreement_score":0.80451566,"about_ca_system_score_codex":0.002256018,"about_ca_system_score_gemma":0.009320543,"threshold_uncertainty_score":0.9997103},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0127385575,0.000067678084,0.982021,0.0030628522,0.00013628896,0.0014592961,0.00009791494,0.00013949073,0.0002769293],"genre_scores_gemma":[0.7067176,0.000004737385,0.29284853,0.0002643317,0.00010033366,0.000027359247,0.000008589613,0.000019549641,0.000008939382],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755925,0.00007010028,0.0005110152,0.000888987,0.00055413216,0.0004165347],"domain_scores_gemma":[0.99528646,0.00254649,0.00054629875,0.00078483537,0.0007127308,0.00012318586],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009395075,0.00028128456,0.0004611569,0.00020585617,0.00050718174,0.000053940454,0.0018236662,0.00033113285,0.00000773947],"category_scores_gemma":[0.0013211429,0.00020109695,0.00008475495,0.00091835187,0.00299947,0.00022591313,0.00028496384,0.0006143799,3.941637e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016210903,0.00045888592,0.016961984,0.00039607572,0.00009275455,0.0000070454194,0.09813593,0.021241367,0.0022529508,0.0296995,0.000031893185,0.8305595],"study_design_scores_gemma":[0.0064852946,0.005344626,0.12581979,0.013694544,0.00065005384,0.00010070303,0.0019272451,0.36744857,0.01597532,0.45606524,0.0016099416,0.0048786704],"about_ca_topic_score_codex":0.00034332892,"about_ca_topic_score_gemma":0.003262153,"teacher_disagreement_score":0.82568085,"about_ca_system_score_codex":0.0001353795,"about_ca_system_score_gemma":0.0013156859,"threshold_uncertainty_score":0.9997138},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018084863,0.00008775468,0.9964152,0.0005272238,0.00089357735,0.0006825988,0.0000048590637,0.00015013063,0.001057795],"genre_scores_gemma":[0.9006332,0.0000031386842,0.094418004,0.003842736,0.000847295,0.000013123873,0.000088991656,0.00007807109,0.00007542482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799377,0.000005946917,0.0003837106,0.00082847296,0.00044476235,0.00034333896],"domain_scores_gemma":[0.99808264,0.00091379683,0.00031836613,0.0003654167,0.00029580423,0.000023982519],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000530717,0.0003710727,0.00035725345,0.00072913937,0.00028909382,0.00059551524,0.00061249774,0.00018463253,0.00010063348],"category_scores_gemma":[0.00036386857,0.00037324068,0.00012731909,0.00052156206,0.00016214082,0.00053859263,0.00024583665,0.00032650834,0.000018425533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002439491,0.000006900075,0.0002351023,0.00012180625,0.0000033004285,0.0000052482214,0.00001837769,0.8043746,0.000018587345,0.000118753764,0.0000029023226,0.19507006],"study_design_scores_gemma":[0.00033339896,0.000013477468,0.0002299405,0.00024183492,0.00005182241,3.872803e-7,1.1655706e-7,0.9928681,0.00001611553,0.0046127094,0.0011963679,0.00043571042],"about_ca_topic_score_codex":0.00003078536,"about_ca_topic_score_gemma":0.000057467252,"teacher_disagreement_score":0.9019972,"about_ca_system_score_codex":0.000119525925,"about_ca_system_score_gemma":0.00015652427,"threshold_uncertainty_score":0.99987197},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003170923,0.0008360897,0.9853585,0.009343199,0.00074701954,0.00031395702,0.000013168049,0.00018481597,0.0032001273],"genre_scores_gemma":[0.006612966,0.0002699267,0.98529726,0.0074747545,0.0002573109,0.00001076432,0.0000057541447,0.000022963435,0.000048295322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609476,0.000048255355,0.0005686103,0.0018292506,0.0010169019,0.00044224132],"domain_scores_gemma":[0.99791396,0.00054034643,0.00029566433,0.0008452201,0.00022095829,0.00018387032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045384606,0.00047293364,0.00056526583,0.00018636291,0.0002951445,0.0005991428,0.0017155651,0.00017767666,0.000033795393],"category_scores_gemma":[0.00037539148,0.000438847,0.000107569045,0.0007816074,0.0004348177,0.0013725116,0.0015251116,0.00045621477,0.000035581095],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059287945,0.00002227138,0.000024275345,0.000043363478,0.00001244076,0.000025883917,0.00045213592,0.007954142,0.00013955827,0.097199604,0.00001864517,0.89410174],"study_design_scores_gemma":[0.00023971125,0.000057522462,0.00029793163,0.0003610034,0.000011970003,0.00009111902,3.2076855e-7,0.75891024,0.00022093584,0.23577699,0.003568482,0.00046380193],"about_ca_topic_score_codex":0.000023741291,"about_ca_topic_score_gemma":0.0000111500885,"teacher_disagreement_score":0.89363796,"about_ca_system_score_codex":0.000259345,"about_ca_system_score_gemma":0.00041804995,"threshold_uncertainty_score":0.99980634},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022160427,0.0050882315,0.72778744,0.25178298,0.0010637391,0.009050267,0.00016958667,0.00041156588,0.0024301757],"genre_scores_gemma":[0.840527,0.03576475,0.081634365,0.034876246,0.0011012668,0.0048176567,0.00024040251,0.00023318703,0.00080516044],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996731,0.00012600704,0.001013742,0.00068189413,0.00037128147,0.0010760996],"domain_scores_gemma":[0.9954915,0.002916935,0.0006342672,0.00051938376,0.00022957071,0.00020834878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017203348,0.00029295488,0.0005886619,0.0005319078,0.0010568906,0.000085580396,0.00088602456,0.00033491463,0.0000024996414],"category_scores_gemma":[0.001134969,0.00019140179,0.000038363392,0.0012589372,0.0008686695,0.0001607245,0.00057076855,0.0014651517,0.000015144669],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030285386,0.00001971674,0.009020263,0.0006166425,0.0000065933314,0.0000023002012,0.001995114,0.0001882368,4.717022e-7,0.013296328,0.0016059335,0.97321814],"study_design_scores_gemma":[0.002438535,0.0017697228,0.05779811,0.006915878,0.0000059135027,0.000024066154,0.00009083239,0.018834388,0.000022614999,0.31297812,0.5976063,0.0015155359],"about_ca_topic_score_codex":0.000089082125,"about_ca_topic_score_gemma":0.0005815513,"teacher_disagreement_score":0.9717026,"about_ca_system_score_codex":0.0018299919,"about_ca_system_score_gemma":0.027064057,"threshold_uncertainty_score":0.9784516},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015559367,0.00058757584,0.9775246,0.003710279,0.0015368637,0.00061124517,0.00003597385,0.0003773184,0.000056814904],"genre_scores_gemma":[0.5745627,0.00001859191,0.42337295,0.0017294605,0.0002740116,0.000017171073,0.0000131256975,0.000011894011,3.5939824e-8],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944202,0.00015687394,0.00046816925,0.002669998,0.0013789929,0.000905766],"domain_scores_gemma":[0.9961504,0.0005232433,0.00029958508,0.0023481844,0.00029207382,0.00038655518],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00095764414,0.0006413622,0.00063818344,0.00067303446,0.00031734843,0.0016476291,0.0071020667,0.00040904834,0.0000078490975],"category_scores_gemma":[0.00019461534,0.0005273287,0.0001755475,0.00375294,0.0007948058,0.0009965622,0.0069567114,0.0024663866,0.000013615942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041886666,0.0010803498,0.006439167,0.0012985399,0.00021238705,0.001473481,0.034864984,0.33812,0.000787525,0.08486338,0.0004994544,0.52994186],"study_design_scores_gemma":[0.0005621502,0.00022950296,0.0013167049,0.00024028095,0.00001548688,0.000032432603,0.0000010098585,0.6490807,0.0028444512,0.3445712,0.000282809,0.00082326814],"about_ca_topic_score_codex":0.00012159193,"about_ca_topic_score_gemma":0.0002767135,"teacher_disagreement_score":0.5590034,"about_ca_system_score_codex":0.00011957286,"about_ca_system_score_gemma":0.0009073248,"threshold_uncertainty_score":0.99983495},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9653657,0.00018530838,0.028920924,0.004842128,0.0002852096,0.00034487713,0.000010856103,0.000029664869,0.000015326046],"genre_scores_gemma":[0.9906951,0.000035730645,0.008067113,0.0009267936,0.00024759254,0.000009893868,0.00001673553,7.013033e-7,3.170801e-7],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99860877,0.00004190893,0.000270708,0.0005618673,0.00028903503,0.00022772518],"domain_scores_gemma":[0.9993376,0.00035480122,0.00011575314,0.00006828322,0.00007409744,0.000049452396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026228031,0.00017367378,0.00025945928,0.000040879848,0.000070519774,0.00015176802,0.0004755548,0.00014600914,0.000021625427],"category_scores_gemma":[0.000106038635,0.000071579096,0.00003754537,0.0008529905,0.00012407273,0.00013966119,0.00058683805,0.0003536996,0.0000014000364],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013732466,0.00006396398,0.14783551,0.000109465174,0.000005231268,0.0000142992485,0.0018949909,0.0040219636,0.39270666,0.000013798765,0.000030439403,0.45328993],"study_design_scores_gemma":[0.0003663225,0.0003832349,0.6969534,0.0006422533,0.000014642568,0.000011066546,0.000054081152,0.060533125,0.2306265,0.009659261,0.00007840447,0.0006777295],"about_ca_topic_score_codex":0.00073457666,"about_ca_topic_score_gemma":0.0011861776,"teacher_disagreement_score":0.54911786,"about_ca_system_score_codex":0.00003432154,"about_ca_system_score_gemma":0.000035537927,"threshold_uncertainty_score":0.2918911},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013236295,0.0003583934,0.98355937,0.0015386267,0.00080413494,0.00026499532,0.000005573858,0.00020199011,0.000030628897],"genre_scores_gemma":[0.7848593,0.00013014585,0.21397705,0.0009114883,0.0000888863,0.000009872972,0.000015273275,0.00000706921,8.921533e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640024,0.00019598364,0.0008273569,0.0009231959,0.0011432064,0.000509994],"domain_scores_gemma":[0.99735975,0.00044390344,0.0006340382,0.0007784241,0.00058479427,0.00019908698],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011051899,0.00037832785,0.0006480163,0.0015147099,0.00022480602,0.0013961556,0.003024175,0.00021646584,0.000020599404],"category_scores_gemma":[0.001099969,0.0003453481,0.00025070045,0.006041049,0.000435856,0.0015192364,0.0031908457,0.0011033755,0.000058413447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072487305,0.00004452785,0.0026757715,0.00030554424,0.000021461616,0.00001151863,0.0018621571,0.4250338,0.00011862169,0.00026321446,0.0000064316773,0.5696497],"study_design_scores_gemma":[0.0002758396,0.00012126556,0.0021221193,0.00028314968,0.000014597911,0.000010519653,0.0000019774657,0.984413,0.0061600204,0.0058955215,0.0003167981,0.00038513512],"about_ca_topic_score_codex":0.00008895265,"about_ca_topic_score_gemma":0.000009985665,"teacher_disagreement_score":0.771623,"about_ca_system_score_codex":0.0001818812,"about_ca_system_score_gemma":0.0007189915,"threshold_uncertainty_score":0.99989986},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019757385,0.00069818937,0.9716038,0.0013817868,0.0011336869,0.00056312047,0.000098853445,0.00005581963,0.024444995],"genre_scores_gemma":[0.35297656,0.000116818504,0.63015085,0.008983218,0.0054419884,0.00009692545,0.00008644366,0.00018858734,0.0019585784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974127,0.000006949041,0.00080784643,0.0010948671,0.000061508945,0.00061616406],"domain_scores_gemma":[0.99840367,0.0004012809,0.00043023936,0.0005678801,0.000037497153,0.00015942415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008810942,0.00035530672,0.0007146437,0.0003464025,0.00030491126,0.00020708218,0.00088770856,0.0003038762,0.000048835725],"category_scores_gemma":[0.00014525557,0.00039427268,0.00018632514,0.00025590643,0.00027159747,0.00031020876,0.000225666,0.0004104507,0.0002874859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035937268,0.000032059594,0.00040200146,0.000065864406,0.000035397385,0.0000048844895,0.0003099098,0.2369104,0.0000019313884,0.7453573,0.0008886745,0.015955644],"study_design_scores_gemma":[0.00017093791,0.00014560061,0.00006481505,0.00004307215,0.0000034231773,0.0000029591706,6.532986e-8,0.3507037,0.000018123817,0.63817555,0.0103502255,0.00032156022],"about_ca_topic_score_codex":0.000031916865,"about_ca_topic_score_gemma":0.000029232415,"teacher_disagreement_score":0.3529568,"about_ca_system_score_codex":0.00030825898,"about_ca_system_score_gemma":0.00014002965,"threshold_uncertainty_score":0.9998509},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025931367,0.0018859219,0.9928159,0.00026904605,0.0028552916,0.00062320277,0.0000074936615,0.0005059367,0.0010112554],"genre_scores_gemma":[0.049374834,0.0049664653,0.9300142,0.012573632,0.002073774,0.0002669089,0.00011389088,0.00021835949,0.00039793755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937164,0.00020746911,0.0009783908,0.002397841,0.00167705,0.0010228436],"domain_scores_gemma":[0.9964705,0.00065448025,0.00045843402,0.0019606922,0.00025259823,0.00020325684],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018090706,0.0007416996,0.0008365075,0.0035976046,0.00039970534,0.0008239912,0.006665586,0.00034371723,0.0000338485],"category_scores_gemma":[0.0000446935,0.0007653608,0.00023417713,0.0052861692,0.00063184527,0.001473571,0.004316917,0.0016471164,0.000007980264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000513485,0.00015575164,0.000487894,0.00010308309,0.0000065825743,0.0001915114,0.0010924952,0.019732265,0.0000026133623,0.22082026,0.00037183674,0.75703055],"study_design_scores_gemma":[0.0002585518,0.00027446603,0.00016110466,0.00024935402,0.0000028104787,0.000045550325,9.2320505e-8,0.7216048,0.00008303421,0.25421545,0.022356864,0.0007478688],"about_ca_topic_score_codex":0.000033508102,"about_ca_topic_score_gemma":0.00018745703,"teacher_disagreement_score":0.7562827,"about_ca_system_score_codex":0.0006504376,"about_ca_system_score_gemma":0.0012998427,"threshold_uncertainty_score":0.9994797},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013555273,0.00022219883,0.9844931,0.012632453,0.0009216718,0.0008200638,0.000009043365,0.00008649308,0.0006794469],"genre_scores_gemma":[0.37412405,0.000023648965,0.6233575,0.0019951412,0.000368561,0.00004318752,0.000018651177,0.000024599452,0.00004467533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967641,0.00018880355,0.00044644007,0.0013414312,0.0008213089,0.00043792024],"domain_scores_gemma":[0.9970747,0.0012822169,0.00027115294,0.0011213644,0.00017028234,0.00008023807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034148127,0.00036317005,0.00039825035,0.0003912962,0.00028629255,0.00071445847,0.002934974,0.00023091574,0.0000029353803],"category_scores_gemma":[0.00032491604,0.00028929347,0.00014503552,0.00082200184,0.00027773678,0.00055826525,0.0002315179,0.00064766145,0.000008267848],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041934898,0.000072883035,0.00049842236,0.00018071308,0.000017391012,0.00007936737,0.028480265,0.038079094,0.000574154,0.1039233,0.00007539684,0.82797706],"study_design_scores_gemma":[0.00041656397,0.0001457161,0.004358448,0.0001854508,0.000007374769,0.000014002194,0.0000099439785,0.6895567,0.00041515956,0.30298948,0.0013985159,0.0005026304],"about_ca_topic_score_codex":0.00003335309,"about_ca_topic_score_gemma":0.00035510308,"teacher_disagreement_score":0.8274745,"about_ca_system_score_codex":0.00018133568,"about_ca_system_score_gemma":0.00032175318,"threshold_uncertainty_score":0.9999559},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018068477,0.00019765642,0.9834847,0.013123308,0.0013027552,0.0011496112,0.0000121899475,0.0005433267,0.000005788352],"genre_scores_gemma":[0.21668981,0.0000064271007,0.7807185,0.0022145659,0.00028451355,0.000054785596,0.000009311273,0.000018732919,0.0000033400008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576247,0.00011532258,0.0005270259,0.0018743167,0.0009592528,0.0007616069],"domain_scores_gemma":[0.9970856,0.00042266655,0.00020360893,0.001371754,0.0005540583,0.00036232604],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010144275,0.00044281868,0.00051249727,0.00047590456,0.00021513541,0.0013386358,0.005141041,0.00027722097,0.0000072649937],"category_scores_gemma":[0.0003061348,0.00039818243,0.00022746577,0.0016554095,0.0005714459,0.000505069,0.0022798262,0.00093183346,0.000016999462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003959642,0.00007318214,0.000060688842,0.00020296415,0.000008443674,0.000024716355,0.0005975149,0.0021648423,0.05280523,0.0013966431,0.000109631736,0.94251657],"study_design_scores_gemma":[0.00028928128,0.00014456303,0.00012227485,0.00012006008,0.0000035923729,0.0000043666487,6.3272836e-7,0.5614461,0.42556113,0.011894959,0.00011749875,0.00029555452],"about_ca_topic_score_codex":0.00018285397,"about_ca_topic_score_gemma":0.00001266712,"teacher_disagreement_score":0.942221,"about_ca_system_score_codex":0.00042221718,"about_ca_system_score_gemma":0.0026238482,"threshold_uncertainty_score":0.999847},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003487783,0.00023512666,0.9928008,0.0007931138,0.0044407123,0.00012114558,0.000002816446,0.00026383947,0.0009937171],"genre_scores_gemma":[0.6898654,0.00009884728,0.29965925,0.005626221,0.004152865,0.000005785677,0.000062479514,0.0001482494,0.00038086213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773574,0.000027673233,0.0004648396,0.0007124743,0.0007241531,0.00033514202],"domain_scores_gemma":[0.9988101,0.00029940985,0.00007798412,0.00026994952,0.00007948996,0.00046306284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005393624,0.00033898265,0.0004725235,0.00041773755,0.00010733601,0.00024554526,0.0005092406,0.0001941818,0.00009187153],"category_scores_gemma":[0.00023987895,0.00032034755,0.000120301906,0.00035875983,0.0003510664,0.00012402594,0.00041321298,0.0009254285,0.000051361385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017702446,0.000011109536,0.000053683452,0.00010444368,0.000030467723,0.000073998155,0.0002462191,0.012402406,0.00015396248,0.000030369516,0.0020590387,0.9848325],"study_design_scores_gemma":[0.00018064198,0.000055479977,0.00024538417,0.0012881251,0.000022348775,0.00007444596,3.043369e-7,0.9959363,0.00019672021,0.0005026856,0.0011672539,0.00033033537],"about_ca_topic_score_codex":0.00003038921,"about_ca_topic_score_gemma":0.00004024004,"teacher_disagreement_score":0.9845022,"about_ca_system_score_codex":0.00015194545,"about_ca_system_score_gemma":0.00006775137,"threshold_uncertainty_score":0.99992484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000033010404,0.00023793794,0.9936664,0.0023706267,0.00057673734,0.00059357524,0.000002848757,0.0005257635,0.0020227795],"genre_scores_gemma":[0.060741372,0.00007951763,0.93597966,0.0016216798,0.00051663833,0.000031520107,0.000015292835,0.00005597351,0.0009583479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968649,0.000035497884,0.00047528232,0.0014116506,0.00072704145,0.00048559983],"domain_scores_gemma":[0.99787223,0.00045632976,0.00033510948,0.0008272522,0.00033883384,0.00017027056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005769335,0.0004340542,0.00049128436,0.00043113035,0.00036149958,0.00064851483,0.002827697,0.0002572198,0.000013270637],"category_scores_gemma":[0.0001969407,0.00038577494,0.00017710813,0.0005013142,0.00045483577,0.00058636605,0.0010897263,0.0008181106,0.000052867505],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013104805,0.000029352379,0.000012591624,0.00017584827,0.000010829956,0.00005103808,0.00051205046,0.00063812215,0.0122998385,0.036950655,0.00010434963,0.94920224],"study_design_scores_gemma":[0.00024819185,0.00028604816,0.000030662824,0.0004087582,0.00000932384,0.00003446924,1.8605942e-7,0.79209137,0.058828693,0.13524954,0.012147601,0.000665146],"about_ca_topic_score_codex":0.000004533649,"about_ca_topic_score_gemma":0.0000020825157,"teacher_disagreement_score":0.94853705,"about_ca_system_score_codex":0.00015911627,"about_ca_system_score_gemma":0.0003137967,"threshold_uncertainty_score":0.9998594},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012879062,0.00011818074,0.992799,0.004969927,0.0006865154,0.0006545072,0.000057275724,0.00036534964,0.0003479451],"genre_scores_gemma":[0.006992198,0.000033772463,0.9762789,0.016017845,0.00027438777,0.000095064584,0.00011707435,0.000050110553,0.000140636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947915,0.00008222011,0.00072420674,0.0017745357,0.0020483485,0.00057918497],"domain_scores_gemma":[0.996768,0.0010477096,0.00044712675,0.0008411571,0.00038849268,0.0005075376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063507055,0.00055794814,0.00056947983,0.00048501266,0.00022997719,0.00040194162,0.003336069,0.00030354722,0.00004919557],"category_scores_gemma":[0.00037739327,0.0005326259,0.00018086427,0.00041730498,0.0009900351,0.0006926751,0.0007393687,0.0006214443,0.000015045194],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018090916,0.000044377037,0.0000029237171,0.00004760332,0.000016894546,0.00018900794,0.0001846272,0.00042210432,0.0010159082,0.003450878,0.005510286,0.9890973],"study_design_scores_gemma":[0.0006764056,0.00041562144,0.0000027973304,0.00033264828,0.000011274803,0.0000406795,2.7494244e-7,0.8759836,0.080260105,0.041022446,0.00063189445,0.00062225957],"about_ca_topic_score_codex":0.00003177788,"about_ca_topic_score_gemma":0.000021609465,"teacher_disagreement_score":0.988475,"about_ca_system_score_codex":0.00042851965,"about_ca_system_score_gemma":0.0012942962,"threshold_uncertainty_score":0.9997125},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051890217,0.0013167718,0.9427726,0.000071159724,0.0027383028,0.000811924,0.000022574952,0.00024057692,0.00013583919],"genre_scores_gemma":[0.7929517,0.00004776329,0.20553519,0.00013509938,0.0011860627,0.00001032854,0.0000032557684,0.00012259105,0.000008020055],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977356,0.000017524146,0.00040150416,0.00089765026,0.0003452256,0.0006024645],"domain_scores_gemma":[0.99859935,0.000573602,0.00010813543,0.00036485505,0.00013398961,0.00022007221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002962885,0.000563958,0.00066081586,0.000499266,0.00020740986,0.0003326529,0.000489308,0.00027628744,0.0000024386727],"category_scores_gemma":[0.000071782575,0.00061189884,0.00013960163,0.00039168235,0.00032208132,0.00029374202,0.00026211733,0.00059758965,0.0000028410404],"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.000027379581,0.000009554293,0.00041127848,0.00039787503,0.00005626558,0.00007501162,0.00057253474,0.060892485,0.89141256,0.00008052745,0.0000040710843,0.04606045],"study_design_scores_gemma":[0.0010404144,0.00053211977,0.00035301739,0.0024824615,0.00008185514,0.000104391096,0.0000030141296,0.37509674,0.6022112,0.015314784,0.0007667469,0.0020133026],"about_ca_topic_score_codex":0.000040933766,"about_ca_topic_score_gemma":0.0000129312375,"teacher_disagreement_score":0.74106145,"about_ca_system_score_codex":0.00037192772,"about_ca_system_score_gemma":0.00009738983,"threshold_uncertainty_score":0.99963325},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05674125,0.004240194,0.93298745,0.002172534,0.00053411437,0.0013682104,0.000022918828,0.00008786043,0.001845466],"genre_scores_gemma":[0.98649526,0.00013971081,0.0124748545,0.0006696039,0.00012533559,0.000037942922,0.000012088113,0.000029844596,0.000015383212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974857,0.00006767834,0.0004136839,0.0009391012,0.00074538175,0.00034843618],"domain_scores_gemma":[0.9983608,0.00044696315,0.00022080737,0.0005834218,0.00011132721,0.00027666005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046148832,0.00035594107,0.00056982663,0.00026864684,0.00013109646,0.00010283483,0.0004456994,0.0001391235,0.00003702319],"category_scores_gemma":[0.00024928027,0.00025243216,0.00017437882,0.00033277264,0.00044086194,0.00022939268,0.000306364,0.0006707014,0.0000050669496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012143167,0.00035500166,0.10094573,0.0004156171,0.0000704135,0.0008773546,0.0014009768,0.09623052,0.00005152445,0.001634818,0.0000030516169,0.7978936],"study_design_scores_gemma":[0.0010398998,0.00023453443,0.09915962,0.0014775418,0.00019236388,0.000013573842,0.0000031595978,0.78690815,0.00040753526,0.108951144,0.0011432946,0.0004692111],"about_ca_topic_score_codex":0.000055862358,"about_ca_topic_score_gemma":0.00004869904,"teacher_disagreement_score":0.92975396,"about_ca_system_score_codex":0.0003254098,"about_ca_system_score_gemma":0.00045631305,"threshold_uncertainty_score":0.9999928},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006977574,0.0001126824,0.9927812,0.0034075656,0.0024308476,0.0004522886,0.000010178558,0.00027669477,0.0004587165],"genre_scores_gemma":[0.69650936,0.000011138419,0.2994211,0.003212765,0.00042657484,0.000016451577,0.000020762363,0.00003785985,0.00034399825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959813,0.0000719942,0.00041209042,0.0018625533,0.0012057893,0.0004663097],"domain_scores_gemma":[0.99741226,0.0003987832,0.0003030953,0.0013398308,0.00030617148,0.00023987117],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000749292,0.00052259007,0.00045407304,0.0016020641,0.0003768653,0.00067595526,0.002713837,0.00049416895,0.000021529726],"category_scores_gemma":[0.00028459588,0.00048031184,0.00020019623,0.0020034956,0.00031766677,0.00029747715,0.00081953575,0.0011642317,0.000092658025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027035068,0.000100121666,0.000019975681,0.00007154946,0.0000073152555,0.00010536863,0.00045868906,0.016774373,0.0015066649,0.003288103,0.000036462607,0.9776043],"study_design_scores_gemma":[0.00043418055,0.00019866928,0.00081465323,0.00018277315,0.0000057329094,0.000017197644,9.295953e-8,0.9835639,0.0062339325,0.0046466785,0.0033445784,0.0005575932],"about_ca_topic_score_codex":0.00002617646,"about_ca_topic_score_gemma":0.00011272878,"teacher_disagreement_score":0.9770467,"about_ca_system_score_codex":0.00040982736,"about_ca_system_score_gemma":0.00044187257,"threshold_uncertainty_score":0.99976486},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005511927,0.000044112432,0.9881945,0.001987711,0.0006767368,0.0004959926,0.00004493663,0.000094908566,0.0029491787],"genre_scores_gemma":[0.39427167,0.000005941182,0.6042077,0.0004659278,0.00035755167,0.0000031353136,0.00007944087,0.000041541083,0.00056708226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997892,0.000016622465,0.00032016393,0.001038711,0.00044539344,0.00028711438],"domain_scores_gemma":[0.99889505,0.00020349474,0.00021630229,0.0005132529,0.000043328673,0.00012855591],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022902068,0.00029021662,0.00028749186,0.000072677954,0.000267959,0.00017844637,0.0005621103,0.00023004123,0.0001295451],"category_scores_gemma":[0.00008591245,0.00028954787,0.00008767606,0.00023086311,0.0005505293,0.00021711344,0.00023216067,0.00035187873,0.00024798946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009362904,0.000009097668,0.00029950484,0.000008219877,0.000005019851,0.0000023286361,0.00027065523,0.1970104,0.0013571947,0.00010522802,0.00015573965,0.80076724],"study_design_scores_gemma":[0.0001696225,0.00007351688,0.0013147161,0.00012030518,0.000019189747,0.00001627736,3.733403e-7,0.9142058,0.0032070288,0.0757101,0.0047561782,0.0004068814],"about_ca_topic_score_codex":0.00036124856,"about_ca_topic_score_gemma":0.0003073888,"teacher_disagreement_score":0.8003604,"about_ca_system_score_codex":0.00035850488,"about_ca_system_score_gemma":0.00006467004,"threshold_uncertainty_score":0.99995565},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47102442,0.00020282158,0.5241649,0.0021782382,0.001891669,0.0003701777,0.0000342702,0.00003881817,0.00009466733],"genre_scores_gemma":[0.9451818,0.00000622664,0.052975364,0.0013469177,0.0004004685,0.00003691633,0.000005975972,0.000027336739,0.0000190154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641526,0.00018111366,0.00071533857,0.001644003,0.00021519311,0.00082906894],"domain_scores_gemma":[0.9974174,0.00030052208,0.00057729013,0.0013748368,0.000113780654,0.00021619341],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005199662,0.00040150277,0.0007680156,0.00041629982,0.00044324753,0.0025576428,0.0021717823,0.00022017834,0.00003509654],"category_scores_gemma":[0.0004105185,0.00036991373,0.00014982258,0.0013192199,0.00015225021,0.00034325258,0.0021763844,0.0008834253,0.000047801477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024788034,0.000117678646,0.026637783,0.000526381,0.000051144976,0.00007589281,0.014368589,0.9396463,0.00028859984,0.014414126,0.000022153787,0.003826554],"study_design_scores_gemma":[0.0005982154,0.00016817811,0.08194278,0.0034710353,0.000025956942,0.00006238903,0.0004102286,0.5890859,0.002372532,0.3190495,0.00028582232,0.0025274835],"about_ca_topic_score_codex":0.00043892305,"about_ca_topic_score_gemma":0.00015442121,"teacher_disagreement_score":0.47415736,"about_ca_system_score_codex":0.00047462876,"about_ca_system_score_gemma":0.00014505834,"threshold_uncertainty_score":0.9998753},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015893944,0.00016287119,0.97829264,0.00076765945,0.002601501,0.00077805715,0.000024060471,0.0007893054,0.016424933],"genre_scores_gemma":[0.9431625,0.000006952947,0.053262185,0.0016397174,0.0014033829,0.000043033957,0.000029948626,0.00008007382,0.00037217772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99449784,0.00011849637,0.0008942819,0.0023599647,0.0014314209,0.00069798727],"domain_scores_gemma":[0.9966137,0.0003974066,0.0006169641,0.0015274315,0.00049691444,0.00034760853],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001005571,0.0007322745,0.00090483873,0.0009751254,0.0004266493,0.0011063231,0.0035614925,0.0004698372,0.00002240209],"category_scores_gemma":[0.00009063636,0.0007465865,0.00025766098,0.00080252375,0.00041414605,0.0011581935,0.0015315702,0.001147883,0.0007215516],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065555487,0.00004603186,0.0000461518,0.00029877728,0.000043256245,0.00043020392,0.0008180268,0.00036318082,0.0008531557,0.012822915,0.00014600104,0.98412573],"study_design_scores_gemma":[0.0029542013,0.0018506742,0.00058557355,0.0097176405,0.00012775985,0.0021789605,0.000005657352,0.70358783,0.011461788,0.24388906,0.01604558,0.0075953025],"about_ca_topic_score_codex":0.00009268902,"about_ca_topic_score_gemma":0.00016118377,"teacher_disagreement_score":0.97653043,"about_ca_system_score_codex":0.00073485356,"about_ca_system_score_gemma":0.00049924734,"threshold_uncertainty_score":0.9999306},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021977337,0.0005937899,0.976191,0.00016474519,0.00025550477,0.00032953534,0.000020070158,0.00042627438,0.00004175583],"genre_scores_gemma":[0.9292406,0.000011358778,0.070461504,0.00013379565,0.00007110464,0.0000063294538,0.00003030629,0.000042701642,0.0000023275393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878746,0.000014681389,0.0002580205,0.0005357899,0.00014828483,0.0002557835],"domain_scores_gemma":[0.999354,0.0002087571,0.00011341015,0.00021144534,0.00004579901,0.000066611916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013483172,0.00030303336,0.00030536027,0.00027649073,0.0002204051,0.00011205705,0.00023402488,0.00032645962,0.0000031515642],"category_scores_gemma":[0.00005152447,0.00032162855,0.000075432814,0.0001713558,0.00022580002,0.00021903559,0.00007610586,0.0005875501,0.0000017712854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033039094,0.00001140053,0.000102470294,0.000075082724,0.000019229961,0.0000145982285,0.0001788628,0.08496104,0.06090669,0.000032222528,0.0000022271627,0.85366315],"study_design_scores_gemma":[0.00036985113,0.00018615516,0.00009196503,0.00016845918,0.00002297469,0.0000102857175,2.938058e-7,0.96802145,0.026930254,0.0038054711,0.00007758718,0.00031525097],"about_ca_topic_score_codex":0.00007363207,"about_ca_topic_score_gemma":0.00008722987,"teacher_disagreement_score":0.9072632,"about_ca_system_score_codex":0.00018540543,"about_ca_system_score_gemma":0.000045592526,"threshold_uncertainty_score":0.9999236},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016093047,0.0004617648,0.99387217,0.0031542592,0.0007757918,0.00043187223,0.00003109128,0.00025695565,0.0009999946],"genre_scores_gemma":[0.11204261,0.0001427034,0.87956387,0.0061231763,0.0008180586,0.00003622232,0.00006995752,0.00007848319,0.0011248874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609864,0.000033962882,0.00058532634,0.0017959315,0.0008379138,0.0006482167],"domain_scores_gemma":[0.99762344,0.0004187694,0.00034780154,0.00095756125,0.00036860412,0.00028383333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064222224,0.0005630955,0.00075107126,0.0013639132,0.0003210446,0.0008515275,0.0028366456,0.00027839848,0.000059150498],"category_scores_gemma":[0.00021793322,0.00051655073,0.00040156746,0.0015330466,0.00036633166,0.0005687533,0.000881374,0.0006231758,0.00007690543],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010878094,0.000038464474,0.00003241618,0.00009868643,0.000094864874,0.00006153653,0.00027778294,0.005090469,0.001562548,0.005896054,0.00037943164,0.9864569],"study_design_scores_gemma":[0.0008309385,0.00023226203,0.00006377147,0.0003962313,0.00007502099,0.000026422305,5.25764e-7,0.9086218,0.009634107,0.07479896,0.004081593,0.0012383612],"about_ca_topic_score_codex":0.000010239589,"about_ca_topic_score_gemma":0.00001668419,"teacher_disagreement_score":0.9852185,"about_ca_system_score_codex":0.00020912028,"about_ca_system_score_gemma":0.00035840893,"threshold_uncertainty_score":0.9997286},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012747051,0.00027047758,0.996185,0.0005669108,0.0010806107,0.0005760176,0.0000098891,0.00013572215,0.0011626482],"genre_scores_gemma":[0.045464747,0.000015419402,0.9524903,0.0017004624,0.00023384082,0.000028591016,0.0000075362213,0.000022321945,0.00003674504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965922,0.00003970806,0.00063955964,0.0014926421,0.00070519064,0.0005306868],"domain_scores_gemma":[0.9982728,0.000118800854,0.00031118258,0.0009403569,0.00023178219,0.00012511751],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011054692,0.00040716177,0.0004323569,0.0003422151,0.00013937491,0.00031351173,0.002968694,0.0003196728,0.0000015502729],"category_scores_gemma":[0.00022290224,0.00042406857,0.000102437545,0.00093877054,0.0003807601,0.0007820179,0.00082398305,0.0003473292,0.000007018913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005137863,0.000006870828,0.000027602691,0.000032477543,0.0000015399218,0.000004479002,0.00017470603,0.5832113,0.000032680924,0.18333311,0.000009420655,0.23316067],"study_design_scores_gemma":[0.00017749223,0.000056952307,0.000058535647,0.0001574629,0.0000023600796,0.0000091425545,5.8720726e-8,0.7509461,0.00055229175,0.24750887,0.00020024061,0.0003305008],"about_ca_topic_score_codex":0.000014826355,"about_ca_topic_score_gemma":0.0000751094,"teacher_disagreement_score":0.23283017,"about_ca_system_score_codex":0.00083563745,"about_ca_system_score_gemma":0.0006064084,"threshold_uncertainty_score":0.9998211},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016268225,0.00020829565,0.99725413,0.00009463953,0.00063202303,0.00028978076,0.0000067164124,0.00029952877,0.001052189],"genre_scores_gemma":[0.06865701,0.00017106082,0.92996943,0.00031399148,0.00075831934,0.000015248998,0.000018167017,0.000058052607,0.00003873187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988978,0.000007068061,0.00020859225,0.00044775035,0.00027254634,0.00016623373],"domain_scores_gemma":[0.9995575,0.000050832692,0.000049258655,0.00022972714,0.000050794082,0.000061879226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116432355,0.00023529743,0.00019909584,0.0001941266,0.00007422571,0.00014388096,0.00022903013,0.00013076527,0.00003256621],"category_scores_gemma":[0.000035070036,0.00023683535,0.000025903732,0.00010391017,0.0002179624,0.00026157722,0.00014352122,0.0003075224,0.000011397855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025816582,0.000002424245,0.0000012974909,0.00005078748,0.0000035853159,0.000020294754,0.00025795872,0.020761114,0.2186464,0.00035919386,0.000058469086,0.7598359],"study_design_scores_gemma":[0.000119107135,0.00006186204,0.000005685871,0.0001123861,0.0000072149164,0.000022654387,1.1194799e-7,0.7469979,0.23616013,0.0155896805,0.00055172585,0.00037155757],"about_ca_topic_score_codex":0.00000165107,"about_ca_topic_score_gemma":0.0000066088933,"teacher_disagreement_score":0.7594643,"about_ca_system_score_codex":0.00012169909,"about_ca_system_score_gemma":0.00003382214,"threshold_uncertainty_score":0.96578646},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030889343,0.00026595689,0.9929858,0.00045107616,0.002756432,0.00035092857,0.000033328088,0.000054702887,0.000012835465],"genre_scores_gemma":[0.42717147,0.000010568557,0.57218796,0.00030382528,0.00028873162,0.000008618381,0.000023021177,0.000004749338,0.0000010784805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980824,0.00004157706,0.0003210214,0.0006029645,0.00041563655,0.00053637964],"domain_scores_gemma":[0.9978585,0.00019744731,0.00016552169,0.0016145133,0.0000794147,0.00008458565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017793622,0.00015952416,0.0002449696,0.00021011061,0.000108039065,0.00032154657,0.0045746868,0.000039097944,0.000008097094],"category_scores_gemma":[0.00014229953,0.00012873604,0.000031696734,0.00075145316,0.00021551203,0.0023318906,0.0024453981,0.00006664711,0.0000085765305],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009131228,0.00010674553,0.0012475731,0.000051575527,0.000006609999,0.0000015916696,0.0004951378,0.00050957897,0.0021876495,0.0019673181,0.000115775074,0.99330133],"study_design_scores_gemma":[0.00054682017,0.00009119451,0.0018935432,0.00005977329,0.000006668478,0.000006456355,4.393611e-7,0.95664155,0.028882362,0.004778715,0.0068273717,0.00026509605],"about_ca_topic_score_codex":0.00009176397,"about_ca_topic_score_gemma":0.000031319407,"teacher_disagreement_score":0.9930362,"about_ca_system_score_codex":0.000032868593,"about_ca_system_score_gemma":0.000074609474,"threshold_uncertainty_score":0.8500982},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000068961504,0.000113402355,0.9917003,0.0012359926,0.0014657956,0.00052461843,0.0016688588,0.00006185108,0.0032223156],"genre_scores_gemma":[0.11544693,0.00007315075,0.8618183,0.0117376605,0.0023795227,0.00003391053,0.0024203502,0.00011426066,0.005975905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937856,0.00006483463,0.0008874905,0.0023707757,0.002196784,0.0006945101],"domain_scores_gemma":[0.99253106,0.0022948973,0.00044392364,0.0042173583,0.0003420022,0.00017074417],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0112347435,0.00037889957,0.0006325504,0.0005654545,0.00041748886,0.0012241151,0.009130902,0.0002241517,0.0000734412],"category_scores_gemma":[0.0013189075,0.00030094179,0.00012152691,0.00047571553,0.00053736457,0.0009873674,0.0060809897,0.00041138465,0.00012148518],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018316954,0.00002938428,0.00001119032,0.000034145603,0.000010982955,0.000007752034,0.00034296268,0.0637655,0.0000026751834,0.09352476,0.0077119996,0.8345403],"study_design_scores_gemma":[0.00016336146,0.000036609963,0.0000055225573,0.00007115337,0.000008033521,0.000002526616,0.0000010843619,0.49455,0.000009837675,0.36852512,0.13640387,0.00022290797],"about_ca_topic_score_codex":0.000015650716,"about_ca_topic_score_gemma":0.0004927431,"teacher_disagreement_score":0.83431745,"about_ca_system_score_codex":0.00010703167,"about_ca_system_score_gemma":0.00019617124,"threshold_uncertainty_score":0.99994427},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.8755372e-7,0.00039751604,0.9884254,0.0047687334,0.0019822852,0.00039159023,0.0000069234056,0.00021841745,0.0038088677],"genre_scores_gemma":[0.0020561735,0.00012264175,0.99228907,0.0032016411,0.0011494145,0.000010778662,0.000014012718,0.000049093214,0.0011072031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949059,0.000059253845,0.0005109311,0.0018094874,0.001793954,0.0009204737],"domain_scores_gemma":[0.9970305,0.0005364054,0.00015631998,0.0018065815,0.00017535868,0.00029485303],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011133846,0.00055325456,0.00045597777,0.00023827009,0.0006194929,0.0016500897,0.008231927,0.00020753709,0.00002330248],"category_scores_gemma":[0.000040533636,0.00040178237,0.00016313794,0.0009704512,0.001547341,0.00078715425,0.004879107,0.0012527879,0.00032679923],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002359076,0.000012382896,0.0000018679273,0.000010567587,0.0000131188035,0.00017395412,0.0001262157,0.005196066,0.0000059397667,0.014301861,0.00017980662,0.9799759],"study_design_scores_gemma":[0.00015933721,0.00015493223,0.000013962532,0.000059224756,0.0000059300987,0.00003162117,3.2008535e-7,0.9004834,0.0001605897,0.06827547,0.030179923,0.000475284],"about_ca_topic_score_codex":0.00003026832,"about_ca_topic_score_gemma":0.000031508844,"teacher_disagreement_score":0.9795006,"about_ca_system_score_codex":0.00023882472,"about_ca_system_score_gemma":0.0003714278,"threshold_uncertainty_score":0.9998434},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006667363,0.00018328342,0.9876081,0.0019026714,0.0028096705,0.0006444382,0.000008162767,0.00015965801,0.000016653603],"genre_scores_gemma":[0.5648912,0.000010687467,0.43474528,0.00013595773,0.00014539309,0.00006095525,9.2168415e-7,0.000009253945,3.4387438e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736446,0.00009435109,0.0004422746,0.0012947392,0.0003495725,0.00045461784],"domain_scores_gemma":[0.99821156,0.0005425336,0.0002772766,0.00064026937,0.00022723226,0.000101122045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085661974,0.00026535438,0.00039348603,0.0007727008,0.0003540565,0.00026326158,0.0014237352,0.00018857892,6.148611e-7],"category_scores_gemma":[0.00028996982,0.00026891,0.00010587233,0.0011198464,0.00083862536,0.00052324176,0.0030009458,0.0009443089,4.847544e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015185153,0.0000325419,0.0005533997,0.0003696003,0.000008784432,0.000008918327,0.0056103934,0.09078558,0.007221776,0.0005923227,0.000010597626,0.8947909],"study_design_scores_gemma":[0.00018676047,0.00024352933,0.0009788212,0.0002273272,0.000008341573,0.00009550463,0.0000075014245,0.9299238,0.018682836,0.049357533,0.00003948552,0.00024861383],"about_ca_topic_score_codex":0.00017701599,"about_ca_topic_score_gemma":0.00019809637,"teacher_disagreement_score":0.8945423,"about_ca_system_score_codex":0.0004799717,"about_ca_system_score_gemma":0.0006848363,"threshold_uncertainty_score":0.99997634},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027045273,0.0003968706,0.9925114,0.0017081914,0.00059437694,0.00056312344,0.000007077128,0.00013329735,0.0038152062],"genre_scores_gemma":[0.72006875,0.00002277524,0.2783627,0.0010774706,0.0003106501,0.0000042200622,0.000002323211,0.000036606027,0.00011453668],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949428,0.00014625664,0.0007491547,0.001735074,0.0017095493,0.00071720785],"domain_scores_gemma":[0.9944683,0.0020654171,0.00044006543,0.0024040074,0.00041983998,0.00020242273],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020355475,0.0004948766,0.00072781945,0.0004397735,0.0003417958,0.000306714,0.007129594,0.00022523676,0.000022979846],"category_scores_gemma":[0.00035695944,0.0003747299,0.00022900329,0.0013174731,0.0024302993,0.00047420096,0.0038007018,0.001404567,0.00003885443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002549887,0.00006449209,0.00040612367,0.00010445637,0.000036989335,0.000053962693,0.0019813855,0.032230724,0.00062232564,0.28278863,0.000022065393,0.68166333],"study_design_scores_gemma":[0.00025588553,0.00021668851,0.00067524274,0.00030489592,0.000007887047,0.000027218812,5.1842034e-7,0.36419418,0.0032727758,0.6300825,0.00045955536,0.00050262245],"about_ca_topic_score_codex":0.000018296378,"about_ca_topic_score_gemma":0.00009502939,"teacher_disagreement_score":0.71979827,"about_ca_system_score_codex":0.00018772898,"about_ca_system_score_gemma":0.00058622874,"threshold_uncertainty_score":0.9998705},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27251786,0.001686099,0.6500415,0.00637041,0.027309423,0.0020030884,0.0009346134,0.0004684463,0.03866852],"genre_scores_gemma":[0.991632,0.0000717145,0.0031893582,0.003758119,0.00088149245,0.0000016029792,0.00031874134,0.000013330803,0.00013366221],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764997,0.00005574094,0.00034060967,0.0009732802,0.00047092818,0.0005094674],"domain_scores_gemma":[0.9985659,0.00076933915,0.00010396,0.0003036681,0.00005147697,0.00020563419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005183584,0.00035351457,0.00042659193,0.0004984091,0.00020178992,0.00030368994,0.0007667312,0.00024458033,0.0008709622],"category_scores_gemma":[0.00021407049,0.0003009801,0.0000750854,0.00050859177,0.00033858154,0.0002395912,0.00016803191,0.00081426115,0.00029178098],"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.00023292226,0.000027687889,0.31287187,0.000058747093,0.000009827188,0.000442875,0.0035364628,0.13916998,0.00021787151,0.000065747576,0.0002589432,0.54310703],"study_design_scores_gemma":[0.00058597483,0.0008449576,0.23647963,0.0013048912,0.000016294885,0.00028014215,0.000014047145,0.74368364,0.00020612475,0.008800305,0.0062282546,0.0015557202],"about_ca_topic_score_codex":0.0051596765,"about_ca_topic_score_gemma":0.08202062,"teacher_disagreement_score":0.7191141,"about_ca_system_score_codex":0.00007005329,"about_ca_system_score_gemma":0.00019234217,"threshold_uncertainty_score":0.9999442},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051956653,0.00013547933,0.9868846,0.0005091635,0.002823427,0.00043797414,0.0000019036182,0.00045747712,0.008698035],"genre_scores_gemma":[0.009991173,0.000008091546,0.98735964,0.0017373962,0.000624218,0.000023686895,0.000006755644,0.000045252043,0.00020377239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939525,0.0002563866,0.0010354525,0.0025452708,0.0013226003,0.00088779797],"domain_scores_gemma":[0.99531156,0.00040565542,0.0006867147,0.0029464099,0.00024281262,0.000406874],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0048710634,0.00066591863,0.000681039,0.00068236695,0.0005711991,0.00081275287,0.0064399666,0.00040061734,0.000015767091],"category_scores_gemma":[0.00082872866,0.00063410733,0.00016353013,0.00063838117,0.0007741241,0.0039987443,0.00250176,0.0017447777,0.000033848897],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050321632,0.00001903594,0.000011693207,0.000025828736,0.0000049422065,0.00022852662,0.003949931,0.0021670999,0.0006760973,0.13162734,0.0000032200203,0.8612813],"study_design_scores_gemma":[0.00013952104,0.00028506466,0.000070814276,0.00015792479,0.0000073294973,0.00082727644,0.0000014595603,0.84128153,0.0065169735,0.14268881,0.007091067,0.0009322336],"about_ca_topic_score_codex":0.000045228717,"about_ca_topic_score_gemma":0.000010977546,"teacher_disagreement_score":0.860349,"about_ca_system_score_codex":0.00036613242,"about_ca_system_score_gemma":0.00057667465,"threshold_uncertainty_score":0.999611},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13129024,0.00024074275,0.8662041,0.00046772667,0.0011788468,0.0005555296,0.0000060213224,0.000025513678,0.00003128461],"genre_scores_gemma":[0.7590708,0.00000623084,0.24074249,0.00010437423,0.000048264203,0.00001727391,0.0000011314163,0.000008587971,8.0637e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563456,0.00025018226,0.0006130954,0.0013467396,0.0015411534,0.00061430293],"domain_scores_gemma":[0.99514025,0.00054529635,0.00029535798,0.0032892139,0.0006213041,0.000108600776],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001875084,0.00032704612,0.00061115646,0.00049176294,0.00014379021,0.00020751037,0.008894666,0.00022598906,0.0000031557713],"category_scores_gemma":[0.00043720807,0.00024127447,0.00024038975,0.0037333022,0.0016320916,0.00037799933,0.012098632,0.0013075916,3.8866472e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014285074,0.00039154373,0.013309471,0.00048360616,0.000030804473,0.000038754242,0.0038001828,0.50671554,0.008853812,0.0014687723,0.0000041028775,0.46488914],"study_design_scores_gemma":[0.00012063467,0.00008863033,0.012775342,0.00057318027,0.0000047305703,0.000024645564,0.000001399888,0.60108566,0.30987543,0.075165555,0.0000029999546,0.00028179344],"about_ca_topic_score_codex":0.00007285767,"about_ca_topic_score_gemma":0.00011087516,"teacher_disagreement_score":0.6277806,"about_ca_system_score_codex":0.0001382729,"about_ca_system_score_gemma":0.0013331535,"threshold_uncertainty_score":0.9964677},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08820933,0.000041634663,0.86921203,0.03191533,0.009549506,0.0008068086,0.000006388438,0.00013436454,0.00012460783],"genre_scores_gemma":[0.9130488,0.0000018720046,0.051696464,0.031614654,0.0033832756,0.00018623486,0.000032755353,0.000022644736,0.000013279113],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99684864,0.00029637947,0.00039134218,0.0013847224,0.00054185203,0.00053708005],"domain_scores_gemma":[0.9984029,0.00023082278,0.00016314049,0.0005636547,0.00026867655,0.00037083743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006319416,0.0003218658,0.00045434985,0.0006213257,0.0004424763,0.00048598045,0.0008786078,0.00040700773,0.00084790157],"category_scores_gemma":[0.00030058651,0.00035773663,0.00014204628,0.0015487435,0.00015204232,0.00017038845,0.0010719413,0.00086502027,0.00023630288],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000138109,0.00031397634,0.0016113584,0.000078167424,0.000031437783,0.00012296202,0.3154316,0.12575318,0.0027926161,0.00034426025,0.0027259907,0.5506564],"study_design_scores_gemma":[0.0023891705,0.000860804,0.8172885,0.0010511526,0.00008501742,0.00055644393,0.0011325071,0.15196432,0.0008718388,0.010931967,0.008703738,0.004164534],"about_ca_topic_score_codex":0.0015993159,"about_ca_topic_score_gemma":0.0009527289,"teacher_disagreement_score":0.8248395,"about_ca_system_score_codex":0.0010517356,"about_ca_system_score_gemma":0.0004303346,"threshold_uncertainty_score":0.99988747},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19097799,0.004800631,0.78477925,0.005294289,0.0014772542,0.0069413967,0.00017175757,0.00007816626,0.0054792794],"genre_scores_gemma":[0.9878214,0.00001937213,0.011659895,0.000213477,0.00008266617,0.000008821266,7.7067017e-7,0.00003070109,0.00016287673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775904,0.00016925982,0.00087353424,0.00037654897,0.0006170576,0.00020457085],"domain_scores_gemma":[0.9924977,0.0047581764,0.0013096354,0.0011362174,0.00024989617,0.00004840012],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014801513,0.0003235199,0.000863317,0.00011595859,0.00016445285,0.00001953595,0.0014427152,0.00017913128,0.000013539491],"category_scores_gemma":[0.0012810502,0.00015857337,0.00022687404,0.00029738684,0.0038306895,0.00006258192,0.00059656124,0.00054718583,4.548417e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038646904,0.0006229717,0.00019278849,0.00857476,0.00060156395,0.00012373131,0.10340747,0.0072224597,0.0010468774,0.7867498,0.0001683923,0.09090274],"study_design_scores_gemma":[0.0012359222,0.00025427717,0.00007317103,0.0014545467,0.0002482419,0.00025896356,0.00000860223,0.03721849,0.0031675752,0.95533216,0.0004177405,0.000330291],"about_ca_topic_score_codex":0.00007580329,"about_ca_topic_score_gemma":0.0002351316,"teacher_disagreement_score":0.7968434,"about_ca_system_score_codex":0.000033705066,"about_ca_system_score_gemma":0.00019012435,"threshold_uncertainty_score":0.9988803},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035003043,0.00032845346,0.9934686,0.0012061131,0.0005585611,0.00081233017,0.0000330953,0.000096736774,0.003146126],"genre_scores_gemma":[0.7935749,0.00002290086,0.20004141,0.004804093,0.0005069562,0.00006273555,0.000019073837,0.00005370607,0.0009141807],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99528366,0.00034978634,0.000788251,0.0016831219,0.0014268461,0.0004683293],"domain_scores_gemma":[0.99236405,0.004402976,0.00060042285,0.0022620475,0.00022281097,0.00014769816],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0038009016,0.0004904571,0.00084740797,0.00048270327,0.0003561771,0.0004337604,0.006970695,0.00014584532,0.00001038281],"category_scores_gemma":[0.0007921882,0.000343527,0.0003062859,0.00085249456,0.0011166388,0.0003988242,0.001967325,0.0007284381,0.0000164156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021033679,0.00021621348,0.00017697577,0.00015580314,0.000171649,0.00005549825,0.011812036,0.0026706962,0.0011846658,0.1637933,0.000056040408,0.8194968],"study_design_scores_gemma":[0.0013363913,0.0016955705,0.0017395046,0.00071372645,0.00015835991,0.000050854964,0.000026295857,0.24881536,0.00063705957,0.74174947,0.0016923986,0.0013850329],"about_ca_topic_score_codex":0.000031389653,"about_ca_topic_score_gemma":0.000064379485,"teacher_disagreement_score":0.8181118,"about_ca_system_score_codex":0.0000943055,"about_ca_system_score_gemma":0.0013849819,"threshold_uncertainty_score":0.99990165},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016004806,0.0003426731,0.98759186,0.0013262988,0.0064913463,0.0011522535,0.00007041033,0.00026151375,0.0011631805],"genre_scores_gemma":[0.19227229,0.0005868341,0.77772254,0.023368848,0.005096471,0.0002496034,0.00019160917,0.00018276344,0.0003290276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943342,0.00011106723,0.00070339715,0.0024704842,0.0013407402,0.0010400707],"domain_scores_gemma":[0.99623656,0.00019303965,0.00037586692,0.0021556783,0.0002996019,0.0007392705],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010999438,0.00069610646,0.0006745806,0.0012958222,0.0005259228,0.0009913234,0.0065937135,0.0003093374,0.00033442586],"category_scores_gemma":[0.000053663403,0.0006405498,0.00018460095,0.0014661413,0.0003157882,0.0016502577,0.0019285416,0.0010070456,0.0001468713],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023969753,0.00015727224,0.00013733048,0.0000627587,0.000014869809,0.000027810238,0.0035876748,0.0041930974,0.000017773189,0.032266017,0.0033031567,0.9562083],"study_design_scores_gemma":[0.0011709032,0.007431088,0.0043089953,0.0013193936,0.00001973413,0.00011673579,0.000004422273,0.55629086,0.00041991813,0.3417618,0.08242161,0.0047345473],"about_ca_topic_score_codex":0.00037154113,"about_ca_topic_score_gemma":0.0007455045,"teacher_disagreement_score":0.9514737,"about_ca_system_score_codex":0.00036051878,"about_ca_system_score_gemma":0.0007052425,"threshold_uncertainty_score":0.9996046},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.3068674e-7,0.00007946673,0.9946568,0.00042288075,0.0007511791,0.00036599228,0.00006325872,0.00015341492,0.0035062933],"genre_scores_gemma":[0.004310078,0.000017821521,0.9914824,0.002322718,0.0006346961,0.00000730484,0.00032692446,0.00003578132,0.0008623218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631864,0.000026763913,0.0004923916,0.0018980296,0.0007243808,0.0005397694],"domain_scores_gemma":[0.9958901,0.0003890281,0.00031193448,0.0030204663,0.00022766335,0.00016084594],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012836058,0.0003970148,0.0004685343,0.0005441521,0.00027958074,0.0009248033,0.00827171,0.00022139783,0.0000062393133],"category_scores_gemma":[0.00023757362,0.0003571078,0.0000862536,0.00046790866,0.0003355153,0.0006375825,0.003646878,0.00036979953,0.000021417905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003854337,0.000055424778,0.000039579747,0.0001791367,0.000029070121,0.000012469357,0.00040577934,0.04106333,0.000031393367,0.25383273,0.0014803291,0.7028669],"study_design_scores_gemma":[0.00018497997,0.00006058272,0.0000040897235,0.00012343854,0.000009894039,0.000015712785,7.773521e-8,0.9500154,0.000052131112,0.018885186,0.030221006,0.00042746324],"about_ca_topic_score_codex":0.0000049836863,"about_ca_topic_score_gemma":0.000022649094,"teacher_disagreement_score":0.9089521,"about_ca_system_score_codex":0.00009492193,"about_ca_system_score_gemma":0.00038440005,"threshold_uncertainty_score":0.99988806},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050568045,0.00040279367,0.99014443,0.0016267954,0.0015422984,0.00040648115,0.0000015357878,0.00065746193,0.004712502],"genre_scores_gemma":[0.4000791,0.000049440237,0.5945619,0.0023571367,0.0016085259,0.000017078766,0.000029526143,0.000104164195,0.0011931728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993397,0.000121740144,0.0009595229,0.0027433096,0.0016416473,0.0011367763],"domain_scores_gemma":[0.99676955,0.0008003329,0.000570765,0.0011094902,0.00020794958,0.0005418869],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001332132,0.00088207744,0.0009084367,0.0008326701,0.00092028605,0.0012510956,0.003883063,0.00031402215,0.00010578431],"category_scores_gemma":[0.0006477139,0.00086911104,0.00023229708,0.0010996074,0.00015978815,0.0006844394,0.0029354785,0.003079321,0.00020856143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008821134,0.000008803956,0.0009303107,0.000035038105,0.000022185803,0.00023332096,0.0026967803,0.48056147,0.0005749204,0.0054163625,0.000019217276,0.5094928],"study_design_scores_gemma":[0.0003210503,0.00034862044,0.000126165,0.0006976458,0.0000116841575,0.000024280736,0.0000023401242,0.9831627,0.00060616696,0.00530231,0.008350198,0.0010468267],"about_ca_topic_score_codex":0.00012348758,"about_ca_topic_score_gemma":0.000026535747,"teacher_disagreement_score":0.508446,"about_ca_system_score_codex":0.00043978184,"about_ca_system_score_gemma":0.00036448403,"threshold_uncertainty_score":0.9997857},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008595687,0.0012660086,0.9941613,0.002096567,0.00044335081,0.00047265188,0.000004285344,0.00012304357,0.00057324226],"genre_scores_gemma":[0.47396648,0.00007787636,0.5249407,0.00047580714,0.0004364583,0.000024867453,0.000012901242,0.000015746109,0.00004911522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806094,0.00003515341,0.00030586528,0.0010634124,0.0002759917,0.00025862368],"domain_scores_gemma":[0.9983118,0.0010996184,0.00012246448,0.00026719086,0.00010112777,0.000097793796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048917084,0.0002495901,0.0003858625,0.00031725556,0.00022211761,0.00029527693,0.00054397585,0.00021323706,0.0000015631788],"category_scores_gemma":[0.00015999303,0.00021339723,0.00006168798,0.00027240126,0.00042164867,0.00046109638,0.00035223804,0.00027338444,0.0000025749962],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011514015,0.000010148532,0.0014554127,0.00008088228,0.000020496642,0.000008101745,0.0012550752,0.00034486465,0.0002817888,0.018053101,0.000013125477,0.9784655],"study_design_scores_gemma":[0.0005042831,0.00033211915,0.0045369416,0.00012782833,0.000033558335,0.000056858542,7.133226e-7,0.5727121,0.0019761804,0.41810033,0.0011324957,0.00048654882],"about_ca_topic_score_codex":0.000012749456,"about_ca_topic_score_gemma":0.00004599774,"teacher_disagreement_score":0.97797894,"about_ca_system_score_codex":0.00004356585,"about_ca_system_score_gemma":0.000144033,"threshold_uncertainty_score":0.8702087},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49450386,0.000045710076,0.5015004,0.0007428335,0.00019501684,0.0013759435,0.000002845304,0.000017835931,0.0016155347],"genre_scores_gemma":[0.93734604,0.000002823104,0.061356917,0.00048987713,0.0000338565,0.00002148245,0.000018111119,0.000010161897,0.000720737],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981309,0.000032685464,0.00036607115,0.00056731224,0.00047857783,0.00042441953],"domain_scores_gemma":[0.99935603,0.000093885625,0.00008854849,0.00038514056,0.000020716681,0.000055663004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014461231,0.00020558819,0.0001898364,0.00013952846,0.00018314553,0.000061851504,0.00074510893,0.00011830352,0.00041309497],"category_scores_gemma":[0.000024757723,0.00013965474,0.000042887004,0.00008656314,0.00071197527,0.00028934333,0.00028242578,0.0002369193,0.00002592997],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009043348,0.00070830813,0.008053569,0.00024716894,0.000006501718,0.00001972928,0.03503674,0.11018763,0.0016427375,0.0024781271,0.00003834392,0.84149075],"study_design_scores_gemma":[0.0023280112,0.0011989122,0.39008942,0.00033532197,0.000030299116,0.00008456958,0.00033073765,0.055579476,0.033975486,0.474951,0.03857972,0.0025170469],"about_ca_topic_score_codex":0.000020948517,"about_ca_topic_score_gemma":0.0001426459,"teacher_disagreement_score":0.83897364,"about_ca_system_score_codex":0.0009257257,"about_ca_system_score_gemma":0.0000838178,"threshold_uncertainty_score":0.5694955},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005012398,0.0011095188,0.99259526,0.00061694905,0.000871175,0.00045916074,0.000017948523,0.00016625242,0.003662479],"genre_scores_gemma":[0.91182905,0.0000768378,0.08443333,0.0012868465,0.00055342104,0.000016258316,0.000012036642,0.000054908774,0.0017372783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601156,0.000044859502,0.00050566025,0.0018388629,0.00087095745,0.0007281143],"domain_scores_gemma":[0.9971509,0.000748078,0.00031568203,0.0012436922,0.00022461495,0.0003170284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010143783,0.0006127329,0.0007265414,0.0004726625,0.0003126016,0.0009025573,0.001800978,0.0003397423,0.000010772506],"category_scores_gemma":[0.00016720498,0.000535328,0.00008521066,0.0004488181,0.0008321241,0.00022063062,0.00139584,0.000614222,0.00008061649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016380314,0.00010856641,0.0007690082,0.00038668796,0.00004662596,0.00042917865,0.0039451197,0.033788648,0.00078460743,0.0668666,0.00042744726,0.89243114],"study_design_scores_gemma":[0.0004657868,0.00028963469,0.00084041373,0.0007687606,0.0000114679515,0.00027784592,2.7964467e-7,0.9798187,0.00034861162,0.013448787,0.0027950509,0.00093464414],"about_ca_topic_score_codex":0.00002478861,"about_ca_topic_score_gemma":0.000018972121,"teacher_disagreement_score":0.9460301,"about_ca_system_score_codex":0.00013497513,"about_ca_system_score_gemma":0.00025603504,"threshold_uncertainty_score":0.99970984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049021505,0.00008986051,0.9936751,0.00034209454,0.00023830509,0.0003953514,0.00019975574,0.000032798478,0.00012457062],"genre_scores_gemma":[0.9332047,0.000017208922,0.064819194,0.00092231936,0.0005408404,0.000014516697,0.00038869018,0.000035406574,0.00005712901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846184,0.000044816265,0.00019426452,0.00080362114,0.00030213885,0.00019332592],"domain_scores_gemma":[0.99920464,0.00009377431,0.00014391085,0.00025426416,0.00014749858,0.00015593863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016294562,0.00025206365,0.00016110177,0.00016550033,0.00017598132,0.000082620645,0.0001814556,0.0002185252,0.000016012547],"category_scores_gemma":[0.00040400395,0.00025979267,0.00007244289,0.00012458966,0.00016658311,0.00001218036,0.0001089809,0.00022765572,0.00000396047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047273177,0.00031886803,0.010948245,0.0001928162,0.000118175514,0.00000963325,0.0005143694,0.60810447,0.18884917,0.0006581567,0.00033892572,0.18947443],"study_design_scores_gemma":[0.00058481935,0.00030915873,0.033182822,0.00010635169,0.000039922536,0.0000015190636,2.0173067e-7,0.95476323,0.007074954,0.0029436222,0.00063048664,0.0003629067],"about_ca_topic_score_codex":0.000014155971,"about_ca_topic_score_gemma":0.000070048474,"teacher_disagreement_score":0.9288559,"about_ca_system_score_codex":0.00017173006,"about_ca_system_score_gemma":0.0002813726,"threshold_uncertainty_score":0.99998546},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001863426,0.00044745702,0.99449104,0.0015355203,0.0017000464,0.0006690548,0.000048131085,0.00041581428,0.00050659984],"genre_scores_gemma":[0.14447913,0.000032761774,0.8531873,0.001098333,0.0009286415,0.000037421487,0.000063923115,0.000047262158,0.00012519106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99551296,0.000047820995,0.0006649792,0.0019807857,0.00094215234,0.0008512818],"domain_scores_gemma":[0.9965042,0.0012643611,0.00042832486,0.0011307517,0.0004507413,0.00022160391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055016536,0.0006627497,0.0007756274,0.00043518507,0.00056488666,0.0006758006,0.0034051226,0.00038193542,0.0000052381056],"category_scores_gemma":[0.0013256603,0.00058051036,0.000219641,0.0008577794,0.0005436461,0.0006438504,0.0015764913,0.00079119037,0.000015945163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010213002,0.00009438852,0.00052847224,0.0002721085,0.00014802479,0.0005308034,0.0036369704,0.18552858,0.0031712556,0.19705169,0.00044961215,0.608486],"study_design_scores_gemma":[0.00035012336,0.00028212363,0.00025190174,0.00029722502,0.000020743022,0.000048984104,0.0000020304362,0.9455226,0.0025367197,0.04885969,0.0010760867,0.0007517517],"about_ca_topic_score_codex":0.00004205246,"about_ca_topic_score_gemma":0.000091764705,"teacher_disagreement_score":0.75999403,"about_ca_system_score_codex":0.0003035172,"about_ca_system_score_gemma":0.0007943276,"threshold_uncertainty_score":0.9996646},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024038198,0.0008742146,0.99282247,0.001323308,0.0017857593,0.00037242507,0.000058020592,0.00019935641,0.0025403954],"genre_scores_gemma":[0.33168787,0.000030049461,0.6657324,0.001659942,0.0006636354,0.000002902686,0.000079021804,0.000038775026,0.00010541118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948435,0.00005866037,0.00095149735,0.0022685397,0.0012215807,0.00065625465],"domain_scores_gemma":[0.9946739,0.00056142826,0.0006969184,0.0031071312,0.0007050549,0.00025556123],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010301146,0.0006086633,0.0009961952,0.00048618927,0.00017395038,0.00042280194,0.009887765,0.000333481,0.000009349364],"category_scores_gemma":[0.0002931102,0.00056617585,0.00016120015,0.00078940426,0.0006349851,0.00075741945,0.004972906,0.0009771099,0.00007705352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026150465,0.000054528333,0.000101506535,0.00032238464,0.000107441876,0.000430889,0.0019478379,0.4125571,0.00021275957,0.092018425,0.00046388787,0.4917571],"study_design_scores_gemma":[0.00030561443,0.00015645562,0.000025131296,0.00069733494,0.000013864793,0.00008388257,5.5240935e-7,0.94974047,0.00013189086,0.04474141,0.0034737855,0.000629608],"about_ca_topic_score_codex":0.000038104525,"about_ca_topic_score_gemma":0.000015929878,"teacher_disagreement_score":0.53718334,"about_ca_system_score_codex":0.00012059316,"about_ca_system_score_gemma":0.00086493994,"threshold_uncertainty_score":0.99967897},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009523805,0.001980037,0.98763967,0.00014617389,0.00030184365,0.00030379766,0.000014167796,0.000011452364,0.00007908107],"genre_scores_gemma":[0.9953328,0.00015284913,0.0036423139,0.0003323201,0.0003467543,0.000007738547,0.000096342694,0.000018322276,0.00007057884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976738,0.000073634015,0.00058992574,0.0010399838,0.00029800597,0.00032462153],"domain_scores_gemma":[0.9987096,0.00006216358,0.00036321796,0.00062294933,0.00014793163,0.000094142524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059194496,0.00032114805,0.0004836582,0.00019427693,0.00005022481,0.00003839389,0.0008896178,0.0003898113,0.000008809959],"category_scores_gemma":[0.00006993891,0.0002885586,0.00014701477,0.0002673611,0.00048502302,0.000006975232,0.0003434891,0.00034045306,0.000004774874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101757476,0.000050209113,0.005018674,0.00004643569,0.000082738916,0.000021617183,0.00017485637,0.8496031,0.055488534,0.00016524819,0.000084648156,0.08916214],"study_design_scores_gemma":[0.0009395819,0.00038471806,0.008538354,0.00019191578,0.00007042746,0.000023679764,7.84904e-7,0.93534744,0.039332315,0.012579825,0.0014567215,0.0011342543],"about_ca_topic_score_codex":0.000009391816,"about_ca_topic_score_gemma":0.000086256754,"teacher_disagreement_score":0.98580897,"about_ca_system_score_codex":0.00005077955,"about_ca_system_score_gemma":0.00013707002,"threshold_uncertainty_score":0.99995667},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034107474,0.0010302145,0.98856294,0.00022250878,0.0029997,0.00048536816,0.000017117647,0.0003835863,0.005957486],"genre_scores_gemma":[0.9399472,0.000041856143,0.05908495,0.00022541686,0.00055228703,0.000017520371,0.00000862629,0.00007848708,0.00004366849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758,0.00001182708,0.00059860095,0.00072153006,0.00053998985,0.0005480497],"domain_scores_gemma":[0.99889696,0.00019938337,0.00008654857,0.00064684113,0.000044435223,0.0001258531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033312626,0.0005332284,0.00059128634,0.00040450357,0.00004969325,0.00012012855,0.0010343126,0.0003056295,0.000026213555],"category_scores_gemma":[0.00004808703,0.00054646295,0.00009029875,0.00036393313,0.00017302275,0.00023161828,0.00023157333,0.0009599018,0.000031227813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024464694,0.0000030052634,0.00006307923,0.00027729233,0.000012404088,0.00005045994,0.00053313875,0.954567,0.00014878566,0.0025660496,0.00002136046,0.041754942],"study_design_scores_gemma":[0.00043859472,0.00006053819,0.002548902,0.0008709414,0.000010645038,0.00005816049,5.251363e-7,0.9624372,0.0030127354,0.014114909,0.015185177,0.0012616715],"about_ca_topic_score_codex":0.000019015479,"about_ca_topic_score_gemma":0.00006926951,"teacher_disagreement_score":0.93960613,"about_ca_system_score_codex":0.0006979049,"about_ca_system_score_gemma":0.00015143659,"threshold_uncertainty_score":0.9996987},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010802377,0.008046805,0.9749053,0.006341897,0.00047560144,0.0011008881,0.000004522512,0.00023149422,0.008882677],"genre_scores_gemma":[0.41001683,0.009434678,0.57449925,0.002256391,0.0025327539,0.00041389145,0.000015039381,0.0001665583,0.00066459004],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99342364,0.00013075057,0.00084899686,0.0027247807,0.0017138727,0.0011579689],"domain_scores_gemma":[0.9950729,0.0015767631,0.00023773314,0.001854556,0.00078285503,0.000475172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002812716,0.00058190105,0.00063719094,0.0012191959,0.00093026244,0.0010006401,0.004545227,0.0004506537,0.000036430814],"category_scores_gemma":[0.0003671487,0.0005774387,0.000106733336,0.0013503213,0.0023326527,0.0009737153,0.0032522709,0.0017831371,0.00037418774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037769976,0.000022818365,7.4235174e-7,0.00004324704,0.000004360481,0.000048424852,0.002053023,0.0012347754,0.00009102057,0.47923562,0.000008761949,0.51725346],"study_design_scores_gemma":[0.000026096153,0.0002681743,0.0000050297963,0.00025785825,0.000004227491,0.000035496985,0.00003089611,0.15261942,0.005756201,0.8322422,0.008196787,0.00055759575],"about_ca_topic_score_codex":0.000027885117,"about_ca_topic_score_gemma":0.00010556876,"teacher_disagreement_score":0.51669586,"about_ca_system_score_codex":0.00036442874,"about_ca_system_score_gemma":0.0008136214,"threshold_uncertainty_score":0.9996677},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058582094,0.00038781977,0.93983686,0.00005818768,0.00017260264,0.00066880364,0.00018219875,0.000015270572,0.000096186915],"genre_scores_gemma":[0.84437025,0.000084615225,0.1546794,0.000070366565,0.00023390331,0.000009785122,0.0005019129,0.0000033256347,0.000046454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987273,0.000017463528,0.00026646437,0.0003565819,0.00048709242,0.00014505057],"domain_scores_gemma":[0.99904937,0.0001872496,0.0003136891,0.000054010947,0.00034843734,0.000047234655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005145605,0.00015765101,0.00024419164,0.000057683967,0.00007055448,0.000039401784,0.00015420656,0.00011065129,0.0000059420963],"category_scores_gemma":[0.000023027642,0.00007317291,0.000029736413,0.00013446536,0.00014815875,0.00025935835,0.000042086704,0.00007129737,2.8850806e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092898415,0.000046025183,0.00032890268,0.00003476046,0.000013008852,4.5879816e-7,0.00026681783,0.06757876,0.26226115,0.00002575668,0.00000798453,0.6693435],"study_design_scores_gemma":[0.0024630202,0.001984525,0.0025503405,0.0009269601,0.00015773928,0.000008236376,0.000009105095,0.68742114,0.2921885,0.007969375,0.0033117598,0.0010092997],"about_ca_topic_score_codex":0.000019254809,"about_ca_topic_score_gemma":0.000011411589,"teacher_disagreement_score":0.7857881,"about_ca_system_score_codex":0.000035891655,"about_ca_system_score_gemma":0.000024574292,"threshold_uncertainty_score":0.29839045},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049192495,0.00021054505,0.9905978,0.0003030224,0.0037842046,0.00031694735,0.000006100125,0.0001827304,0.004549498],"genre_scores_gemma":[0.8403243,0.00017698368,0.09679939,0.026448028,0.032949023,0.00016923617,0.0015119263,0.00029030573,0.0013308089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820364,0.0000021560697,0.00038861576,0.0004491056,0.00058934145,0.0003671577],"domain_scores_gemma":[0.9989951,0.00007330413,0.0002650738,0.00040167244,0.0002453196,0.000019531628],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00027552655,0.00031309348,0.0003132653,0.00066676346,0.00010936938,0.0012019068,0.0011787642,0.00016617411,0.000019487721],"category_scores_gemma":[0.00023817467,0.0002856628,0.000047739097,0.0012040364,0.0001231385,0.0037008785,0.00064259866,0.00044292424,0.0003835066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011854635,0.00001149271,0.00008115718,0.001315844,0.000007811569,0.00001928533,0.00009860282,0.5040516,0.00007251141,0.0071112784,0.0015304941,0.48568803],"study_design_scores_gemma":[0.0000940765,0.0000073639617,0.00007723371,0.0005627794,0.000008727304,0.0000056328913,2.9153145e-7,0.730221,0.000049809412,0.0014100489,0.2671678,0.0003952601],"about_ca_topic_score_codex":0.000044355314,"about_ca_topic_score_gemma":0.000008471025,"teacher_disagreement_score":0.89379835,"about_ca_system_score_codex":0.00014863037,"about_ca_system_score_gemma":0.00018970828,"threshold_uncertainty_score":0.9999595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010206731,0.001851546,0.9711802,0.0010410593,0.0039728167,0.00033556583,0.0000149115385,0.00043615638,0.021157537],"genre_scores_gemma":[0.037014488,0.00024688538,0.95925367,0.0020868606,0.00072744134,0.00001533736,0.000012374343,0.00005901575,0.0005839177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947633,0.000028699893,0.00064042374,0.0023638678,0.0012092139,0.0009944697],"domain_scores_gemma":[0.99692136,0.00047016688,0.00021617113,0.0019415279,0.00019700131,0.00025375962],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008307061,0.00078624714,0.00068196206,0.0011071862,0.0003183407,0.0017754973,0.005015891,0.00045437037,0.00003702527],"category_scores_gemma":[0.000058137637,0.00065642706,0.00025402228,0.0012488712,0.0007153005,0.0008987706,0.002811267,0.0014287735,0.0002615757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003498037,0.000020113592,0.000010084645,0.00008161504,0.00002307482,0.0004604216,0.001883017,0.2048854,0.000015720943,0.08137585,0.00011196501,0.71112925],"study_design_scores_gemma":[0.00009733618,0.00011085958,0.000007745491,0.00038731878,0.000008421748,0.000062193554,1.2534838e-7,0.6200105,0.00006911268,0.37569365,0.0029560635,0.0005967099],"about_ca_topic_score_codex":0.000028326811,"about_ca_topic_score_gemma":0.0000502673,"teacher_disagreement_score":0.71053255,"about_ca_system_score_codex":0.00025954927,"about_ca_system_score_gemma":0.00053561985,"threshold_uncertainty_score":0.99958867},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000464965,0.00014375513,0.998724,0.000053712713,0.00024340214,0.00012161004,0.000017356537,0.0000804274,0.00015079188],"genre_scores_gemma":[0.92505187,0.000011924836,0.074734345,0.00006554895,0.00006273666,0.0000034041766,0.000013523148,0.00003256089,0.000024074123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988107,0.000004722767,0.00035755654,0.00039410198,0.0002412222,0.00019169923],"domain_scores_gemma":[0.9988078,0.00068151875,0.00011413474,0.00021756851,0.00013345138,0.000045533252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022306756,0.00022257821,0.00043654421,0.00040177477,0.000045642453,0.00004435488,0.00028462184,0.00012710333,0.0000024976262],"category_scores_gemma":[0.00008762134,0.00022230801,0.00017494682,0.00017725186,0.0000774315,0.00012448904,0.000079496574,0.0002669151,0.0000014412701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003545506,0.0000022129636,0.0000032771027,0.00008953829,0.000017813518,0.000001194602,0.0003849816,0.8864715,0.00009572922,0.000030550484,0.0000011778374,0.11289847],"study_design_scores_gemma":[0.000047047502,0.000008942881,0.0000012133379,0.00032918778,0.000022224616,6.707682e-7,2.1322235e-7,0.9850692,0.00023959225,0.014073074,0.000004636026,0.00020398069],"about_ca_topic_score_codex":0.0000023908713,"about_ca_topic_score_gemma":0.000012172017,"teacher_disagreement_score":0.9245869,"about_ca_system_score_codex":0.00012654207,"about_ca_system_score_gemma":0.00008647537,"threshold_uncertainty_score":0.9065457},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011221799,0.00010350598,0.9968519,0.0006072871,0.0004215269,0.00069541077,0.000018541306,0.00040374513,0.0008969559],"genre_scores_gemma":[0.012332571,0.00003558219,0.9861922,0.00090398587,0.00014397092,0.000021062006,0.00004630519,0.00006964037,0.00025466998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956136,0.000049902326,0.0005877501,0.0019946853,0.0011801497,0.0005739356],"domain_scores_gemma":[0.9969685,0.00027772994,0.0005966045,0.0011091563,0.0008013731,0.00024661032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037604754,0.00065652997,0.0005924939,0.0006099119,0.00034054634,0.00057135615,0.0020912606,0.00028239438,0.000015213589],"category_scores_gemma":[0.00013759237,0.00061698083,0.00009084471,0.0013614437,0.00046794154,0.001591525,0.0007065423,0.00070577435,0.000024604522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017576614,0.00002019599,0.0000028441746,0.000018507642,0.000011193361,0.000051524687,0.00039042864,0.9248987,0.000025628651,0.008726569,0.0000036331346,0.06583324],"study_design_scores_gemma":[0.00063319673,0.00015797802,0.0000096334015,0.00013735087,0.000012324843,0.00004894982,3.7856717e-7,0.97686404,0.00020919593,0.021146744,0.00007736745,0.0007028295],"about_ca_topic_score_codex":0.000011289732,"about_ca_topic_score_gemma":0.00004295294,"teacher_disagreement_score":0.06513041,"about_ca_system_score_codex":0.0005216667,"about_ca_system_score_gemma":0.001021718,"threshold_uncertainty_score":0.9996281},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018179607,0.000286849,0.9917559,0.0012350051,0.0005113028,0.0003254684,0.0000033085555,0.00032843245,0.0053719245],"genre_scores_gemma":[0.43609416,0.000029409626,0.5605246,0.0016059631,0.00048689023,0.000014680771,0.000013354008,0.000055451124,0.0011755341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686384,0.000040775976,0.00029153915,0.0013908193,0.00095941557,0.00045358017],"domain_scores_gemma":[0.99831384,0.00011678866,0.0002068891,0.0009789912,0.0001564372,0.0002270476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050420896,0.00041218044,0.00037006877,0.00041534458,0.00021565081,0.0005266997,0.001957693,0.0002605802,0.000017205957],"category_scores_gemma":[0.000039083225,0.00034974245,0.00008917869,0.0006565944,0.00039541503,0.00067386444,0.0003558107,0.0007801792,0.00007467097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055786684,0.00003235709,0.00000782436,0.000079105535,0.000028811422,0.00034974157,0.011700155,0.038750805,0.0013800681,0.14014089,0.00003334473,0.8074411],"study_design_scores_gemma":[0.00039859684,0.00033952127,0.000021138832,0.0002818287,0.000013280962,0.00012636402,0.0000014265834,0.85507506,0.004097435,0.13787614,0.000997892,0.00077131344],"about_ca_topic_score_codex":0.000026433383,"about_ca_topic_score_gemma":0.000026691394,"teacher_disagreement_score":0.81632423,"about_ca_system_score_codex":0.00020491345,"about_ca_system_score_gemma":0.0004410379,"threshold_uncertainty_score":0.99989545},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012656489,0.00025835805,0.99037343,0.0038522708,0.003770733,0.0007471515,0.00005530839,0.00023575392,0.0006943532],"genre_scores_gemma":[0.0033083467,0.000012403885,0.98517495,0.007729835,0.0033352477,0.000041551222,0.00004691156,0.0000700255,0.00028073616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99479467,0.00003603826,0.0007280509,0.002376646,0.0011463624,0.00091822137],"domain_scores_gemma":[0.9964138,0.00095732574,0.000396092,0.0016252111,0.00029356897,0.0003139984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071157375,0.00073395297,0.0007465343,0.00056813366,0.00040674774,0.0009893008,0.0045131454,0.00042973398,0.000028145574],"category_scores_gemma":[0.00019058828,0.00063339033,0.00027009207,0.00048234468,0.00042234012,0.0012118561,0.0031762354,0.00095283904,0.00007753035],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007823552,0.00002187197,0.0000211365,0.00006370538,0.000018953844,0.00008237162,0.00038306872,0.0024387122,0.0000945933,0.0027961244,0.0010128123,0.9930588],"study_design_scores_gemma":[0.00043614602,0.00024446158,0.000030360514,0.00036748726,0.000013319421,0.000058922808,1.512096e-7,0.8733267,0.0010275984,0.100459374,0.023242591,0.00079289015],"about_ca_topic_score_codex":0.000010531829,"about_ca_topic_score_gemma":0.00000996256,"teacher_disagreement_score":0.99226594,"about_ca_system_score_codex":0.00020722496,"about_ca_system_score_gemma":0.0003304725,"threshold_uncertainty_score":0.99961174},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003848461,0.0008567549,0.9953496,0.0023167802,0.00037135783,0.00059519487,0.000006885215,0.00012287666,0.00034207813],"genre_scores_gemma":[0.01200389,0.000031321844,0.98413765,0.001681912,0.0010998318,0.00011074211,0.0000030924043,0.00002842732,0.0009031268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974779,0.000018312145,0.00029051767,0.0012571283,0.00038145916,0.0005747116],"domain_scores_gemma":[0.9983596,0.00052250014,0.00017848503,0.00067127415,0.00012572159,0.00014240677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003705962,0.00033487962,0.0003278927,0.0002912936,0.00035554642,0.0005148461,0.0019604205,0.00016576903,0.0000013246672],"category_scores_gemma":[0.00003207129,0.00023877683,0.000068444446,0.00043904618,0.00054163905,0.00016267387,0.0007176855,0.00032017397,0.000003188161],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018927923,0.000009032566,0.000006226141,0.00003515604,0.0000022066124,0.0000035985668,0.00016988101,0.005390809,0.00003870039,0.0018657482,0.0001511205,0.9923256],"study_design_scores_gemma":[0.00021253599,0.00007723052,0.000054877706,0.0002549147,0.000003574089,0.00004151425,2.6379439e-8,0.6637226,0.00015708766,0.33045468,0.004665735,0.00035522608],"about_ca_topic_score_codex":0.0000025092475,"about_ca_topic_score_gemma":0.000013619547,"teacher_disagreement_score":0.9919704,"about_ca_system_score_codex":0.00009716179,"about_ca_system_score_gemma":0.0005160045,"threshold_uncertainty_score":0.9737037},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39535782,0.00004297715,0.58841103,0.000091673624,0.00862688,0.0025478953,0.000009431957,0.00020128019,0.0047109956],"genre_scores_gemma":[0.9994366,6.390486e-7,0.000058594396,0.00007522752,0.00024755936,0.00009691509,0.0000022520865,0.000033265755,0.000048941372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738204,0.00039717703,0.00046373872,0.00081536436,0.0006853898,0.00025627288],"domain_scores_gemma":[0.9966803,0.0022557026,0.00026006918,0.0006594989,0.000061016584,0.000083399646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007491973,0.00040769126,0.0006213533,0.00031725818,0.00022420235,0.00009031983,0.00076445495,0.000104432496,0.00006110709],"category_scores_gemma":[0.000041734213,0.00025951446,0.000165461,0.0001671466,0.00018204033,0.00013533312,0.00029048117,0.0006541152,0.000046676967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012304834,0.0004651716,0.0044247964,0.0008148347,0.0006523555,0.00021725112,0.051358584,0.6069987,0.0004577697,0.036046866,0.000026293845,0.2973069],"study_design_scores_gemma":[0.0030939486,0.0058651986,0.015540068,0.0035429972,0.00011631154,0.00004811781,0.000050745504,0.96552354,0.0032394778,0.0018862366,0.00011733473,0.0009760242],"about_ca_topic_score_codex":0.000015870373,"about_ca_topic_score_gemma":0.000018329081,"teacher_disagreement_score":0.60407877,"about_ca_system_score_codex":0.00036910898,"about_ca_system_score_gemma":0.000029754314,"threshold_uncertainty_score":0.9999857},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011438864,0.00055782724,0.98011965,0.0033932023,0.0036094466,0.0005546495,0.000018742961,0.0002491926,0.000058442834],"genre_scores_gemma":[0.53113985,0.0000055914015,0.4680206,0.00045671393,0.00034213264,0.000013097826,0.0000085717,0.000013075616,3.5819986e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944807,0.00028279392,0.0009186091,0.0023804738,0.0012232605,0.00071410823],"domain_scores_gemma":[0.9953165,0.0011486078,0.0006691402,0.0023692048,0.00022911746,0.00026741935],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009963588,0.00053516816,0.0007368257,0.0005211791,0.00026223942,0.0007732575,0.0076311184,0.00028506847,0.000009399456],"category_scores_gemma":[0.00041154353,0.0005319845,0.00021160756,0.0026509678,0.00068946974,0.00041767105,0.0051748976,0.0016361882,0.000011290404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004607968,0.00017892472,0.0009584189,0.00024967795,0.000040536648,0.000108652814,0.0111933015,0.54595494,0.0052943323,0.0044419123,0.00004448348,0.43148875],"study_design_scores_gemma":[0.00021037768,0.00008459995,0.0034365966,0.0005388067,0.000007714226,0.0000027742635,0.000001133341,0.8253658,0.02500394,0.1446801,0.0001305802,0.0005376052],"about_ca_topic_score_codex":0.00011342482,"about_ca_topic_score_gemma":0.000013731714,"teacher_disagreement_score":0.519701,"about_ca_system_score_codex":0.00022251756,"about_ca_system_score_gemma":0.0010931591,"threshold_uncertainty_score":0.9997132},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004674509,0.0001807459,0.9914241,0.00082530593,0.0010584326,0.00038922252,0.000020493748,0.00009474323,0.001332485],"genre_scores_gemma":[0.9677481,0.00022551497,0.025795357,0.005391512,0.00070667354,0.0000037700336,0.0000052363825,0.000063576066,0.000060244893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702585,0.000082311395,0.00031616664,0.0014010282,0.0007757815,0.00039886156],"domain_scores_gemma":[0.99867547,0.00033426879,0.00018925339,0.0005598726,0.00004692254,0.00019421664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036666184,0.00042410727,0.0004146781,0.00023432045,0.00033970462,0.00032410485,0.00084958255,0.00019580031,0.000025562078],"category_scores_gemma":[0.00015997096,0.0003855112,0.000051566516,0.00029435992,0.001379283,0.00028122825,0.0004971896,0.0007742277,0.000008271422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038866678,0.00008769956,0.0003105818,0.000060808048,0.000013619754,0.0005194206,0.00081252673,0.37476197,0.13791823,0.014159876,0.00005149243,0.4712649],"study_design_scores_gemma":[0.0007705844,0.00084943767,0.00038060645,0.00031712538,0.000018127828,0.00009392979,6.537635e-7,0.9018579,0.018087372,0.07191463,0.0044833515,0.001226279],"about_ca_topic_score_codex":0.000015665217,"about_ca_topic_score_gemma":0.0000069011717,"teacher_disagreement_score":0.9656287,"about_ca_system_score_codex":0.00013204626,"about_ca_system_score_gemma":0.00053954154,"threshold_uncertainty_score":0.9998597},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5160661,0.0001232018,0.47455102,0.006985487,0.001407585,0.0006730077,0.00006860721,0.00011516379,0.000009843875],"genre_scores_gemma":[0.9405495,0.000009485438,0.055122163,0.0018498063,0.0021873435,0.00003944354,0.00024006818,0.0000016820745,5.2989355e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978264,0.000047319354,0.00030516612,0.0009471372,0.00042279306,0.00045120667],"domain_scores_gemma":[0.9989924,0.000481936,0.00015276064,0.00010739353,0.00014982904,0.00011571248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047043612,0.00028410368,0.00032049255,0.00003399447,0.00029662787,0.0004002456,0.0010034667,0.00022277432,0.000011357161],"category_scores_gemma":[0.00013054982,0.0001090984,0.00011355126,0.0008735494,0.00012807008,0.00013378906,0.00060449005,0.0004058904,0.0000075275766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009168398,0.00017938764,0.012398421,0.00018965342,0.000029719826,0.00003563326,0.005764642,0.04155636,0.2605354,0.00023729038,0.00034083563,0.67864096],"study_design_scores_gemma":[0.00092591223,0.00092817156,0.1443767,0.0008431357,0.00004815028,0.000039943967,0.00007331545,0.68829393,0.038869068,0.1157052,0.0075723403,0.0023241513],"about_ca_topic_score_codex":0.00017287997,"about_ca_topic_score_gemma":0.00086684356,"teacher_disagreement_score":0.67631686,"about_ca_system_score_codex":0.00007605209,"about_ca_system_score_gemma":0.00008031281,"threshold_uncertainty_score":0.44489035},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016403913,0.00007455493,0.97856975,0.003549404,0.00053841673,0.00057951675,0.0000021989265,0.00020968428,0.00007256468],"genre_scores_gemma":[0.56017333,0.0000127137355,0.4391263,0.00061998016,0.0000398635,0.000015932745,0.000002013303,0.000009505601,3.6944604e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957882,0.00015767165,0.0004801456,0.0019579728,0.00089786446,0.00071813114],"domain_scores_gemma":[0.9978424,0.00020443174,0.00017443267,0.0013660926,0.00019614937,0.00021650187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001235176,0.00038604464,0.0004658431,0.00065763324,0.00012993149,0.00089154753,0.003831605,0.00016525714,0.0000074754175],"category_scores_gemma":[0.00015158636,0.000320775,0.00007036759,0.0037858027,0.0004391714,0.0005662338,0.0040173605,0.0012998384,0.000008251642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008544428,0.00007920425,0.0074940003,0.00008289283,0.0000039180363,0.000062873776,0.0026023444,0.8667654,0.00022323655,0.0009200227,0.0000016148701,0.12175597],"study_design_scores_gemma":[0.0003438548,0.0001145853,0.006603451,0.00027106865,0.0000011439678,0.00001162637,6.8796663e-7,0.96853834,0.0011805726,0.022538483,0.000012911448,0.00038325493],"about_ca_topic_score_codex":0.00013220852,"about_ca_topic_score_gemma":0.0002480272,"teacher_disagreement_score":0.5437694,"about_ca_system_score_codex":0.00011809588,"about_ca_system_score_gemma":0.00070974434,"threshold_uncertainty_score":0.9999244},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000090455265,0.000037897073,0.9928131,0.0024209954,0.0018475362,0.0005654407,0.0000040135405,0.00017684017,0.0020436968],"genre_scores_gemma":[0.8150576,0.000010926023,0.1824699,0.0019805087,0.00034941325,0.00001385975,0.00003321004,0.00003297364,0.000051619027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968005,0.00007555981,0.0005176688,0.0012248143,0.00096048677,0.00042101057],"domain_scores_gemma":[0.9984987,0.00025208457,0.00017604147,0.0006186529,0.00029410596,0.00016045963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006333132,0.00036887827,0.00037803466,0.0009733971,0.00016181862,0.0005883696,0.0013694643,0.000281737,0.00004225527],"category_scores_gemma":[0.0001045991,0.00037254943,0.000073986004,0.0012757417,0.0003502831,0.00057805475,0.00041217968,0.0008632846,0.00004714971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025754602,0.00005857239,0.00048495657,0.00006087508,0.0000063999646,0.00013454522,0.0008817079,0.34007022,0.00031242485,0.08906576,0.000013825533,0.56888497],"study_design_scores_gemma":[0.00070613076,0.00015965552,0.0004600302,0.00022308993,0.000002424983,0.00001096158,1.1421377e-7,0.9697587,0.0014205185,0.026609348,0.0002302621,0.00041876046],"about_ca_topic_score_codex":0.00002427343,"about_ca_topic_score_gemma":0.00007183523,"teacher_disagreement_score":0.81496716,"about_ca_system_score_codex":0.00042148773,"about_ca_system_score_gemma":0.001176708,"threshold_uncertainty_score":0.9998726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021164558,0.00022067975,0.98583406,0.005418984,0.0022231697,0.00048876187,0.000008205527,0.00022198787,0.005582023],"genre_scores_gemma":[0.42551464,0.00019823862,0.5654872,0.0073294872,0.0007579971,0.000031680313,0.000011729471,0.000071968876,0.0005970317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963695,0.000046728215,0.00056119426,0.0013210321,0.0011145773,0.0005869719],"domain_scores_gemma":[0.9970928,0.0009316641,0.00033897744,0.0010601704,0.00030976487,0.00026666422],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007035371,0.00049047824,0.0004160523,0.00032133752,0.0006108324,0.0011281588,0.0029246663,0.00023673395,0.00005645466],"category_scores_gemma":[0.00033515392,0.00039071334,0.00015207466,0.0005782351,0.0018519863,0.0004935915,0.000924227,0.0009275289,0.000081025166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000497073,0.000004768268,0.0000029067514,0.0000095909245,0.000012272528,0.0000382856,0.0004796052,0.04004697,0.000020987263,0.14264902,0.000047096622,0.81668353],"study_design_scores_gemma":[0.00029807843,0.00012239852,0.000046337973,0.00019456027,0.000010908537,0.00013332325,0.0000015365493,0.9258599,0.00010670001,0.06962634,0.0030084492,0.00059143425],"about_ca_topic_score_codex":0.000020142072,"about_ca_topic_score_gemma":0.00013250938,"teacher_disagreement_score":0.88581294,"about_ca_system_score_codex":0.00027781771,"about_ca_system_score_gemma":0.0015152041,"threshold_uncertainty_score":0.99990875},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016642764,0.00014566771,0.99552435,0.00063266617,0.00077845954,0.00032183397,0.00007898855,0.00016161238,0.0006921416],"genre_scores_gemma":[0.5181662,0.000007713269,0.48118308,0.00035257984,0.00019504358,0.000013677284,0.000023177112,0.000021383843,0.000037198213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961379,0.00003094182,0.0006792937,0.0016916867,0.0009662711,0.0004939161],"domain_scores_gemma":[0.9969932,0.00035423887,0.00041866966,0.0017832514,0.00023813732,0.00021250884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047156907,0.00044865833,0.00060952734,0.0003682131,0.00018325867,0.00025605815,0.003737066,0.00020027951,0.000033482796],"category_scores_gemma":[0.00009371016,0.00041831643,0.00012439679,0.00052607607,0.00047800664,0.00016142787,0.0019118555,0.0005037247,0.000025774834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053751596,0.0000901437,0.00028251857,0.000082455634,0.00002207432,0.000056226192,0.0027428607,0.013933898,0.00013429171,0.011609548,0.00006742457,0.9709732],"study_design_scores_gemma":[0.0002068967,0.0001362427,0.0014350116,0.00034324545,0.00001059397,0.00001649017,0.0000012991169,0.98777866,0.0011934962,0.007925538,0.00044205133,0.00051046914],"about_ca_topic_score_codex":0.000090178706,"about_ca_topic_score_gemma":0.00004728687,"teacher_disagreement_score":0.97384477,"about_ca_system_score_codex":0.0001475386,"about_ca_system_score_gemma":0.00044252945,"threshold_uncertainty_score":0.99982685},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021401676,0.0006375441,0.9823333,0.0081704045,0.0013937,0.00022208724,0.000006289038,0.0001477437,0.006874889],"genre_scores_gemma":[0.9783131,0.00002561726,0.003480166,0.008853481,0.008992873,0.0000054299207,0.00009508185,0.00007306034,0.00016119934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688226,0.000004619234,0.0004200948,0.0013704903,0.00088914216,0.00043341215],"domain_scores_gemma":[0.99790335,0.00011315185,0.00042283844,0.0011913676,0.00034578893,0.00002351418],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00076893583,0.0004421969,0.00044419873,0.00057255116,0.0005528149,0.0013767697,0.00383909,0.00017464072,0.00002503288],"category_scores_gemma":[0.0002494678,0.00030969759,0.00008687252,0.0012663167,0.00050710485,0.0010247201,0.0018944992,0.00070340186,0.000085561085],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012073897,0.000023222783,0.00028259517,0.00047086886,0.000033954544,0.000044352488,0.00018265152,0.044078413,0.00003110514,0.0028885459,0.00015227562,0.9517999],"study_design_scores_gemma":[0.00013305177,0.0000048944435,0.000019301988,0.0005414946,0.000113549635,0.0000060564403,0.0000014865312,0.8925672,0.00003188347,0.09746542,0.0085800905,0.00053553766],"about_ca_topic_score_codex":0.000082166946,"about_ca_topic_score_gemma":0.000110373425,"teacher_disagreement_score":0.97885317,"about_ca_system_score_codex":0.000043135024,"about_ca_system_score_gemma":0.00024397524,"threshold_uncertainty_score":0.9999355},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009221753,0.00097424915,0.99565595,0.00014145678,0.0007363321,0.00016550606,0.0000022343556,0.000022150214,0.0013799254],"genre_scores_gemma":[0.96455544,0.00014008598,0.031465273,0.0008733074,0.0012795718,0.00001468359,0.00006580224,0.000048759015,0.001557089],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985426,0.00002448611,0.0002099139,0.0006286631,0.00028909347,0.00030525113],"domain_scores_gemma":[0.9991476,0.000021488435,0.00015004289,0.00047986815,0.000091394555,0.00010960901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002804084,0.00024482614,0.00017391502,0.00017558268,0.00011639449,0.000053388987,0.0004484531,0.00026480237,0.0000659722],"category_scores_gemma":[0.00003876913,0.00022442733,0.00007455263,0.00009567459,0.00019798397,0.0000059227887,0.000286294,0.00033461076,0.000021934206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004485329,0.00003839045,0.0005218139,0.00006121994,0.000013100309,0.0000054722846,0.00011962488,0.20573314,0.21776122,0.000054006046,0.00010517947,0.575542],"study_design_scores_gemma":[0.00096298085,0.00051826634,0.00070194504,0.00062775373,0.00003089338,0.000029470302,0.000001062711,0.3796891,0.3096828,0.0007338274,0.30557358,0.0014483264],"about_ca_topic_score_codex":0.0000040733944,"about_ca_topic_score_gemma":0.000021041504,"teacher_disagreement_score":0.9641907,"about_ca_system_score_codex":0.000059087793,"about_ca_system_score_gemma":0.00020999007,"threshold_uncertainty_score":0.91518813},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015732108,0.0005205401,0.98857796,0.003274087,0.0027974765,0.0002965633,0.000009969247,0.0002717013,0.004094397],"genre_scores_gemma":[0.22745031,0.00005713128,0.7650314,0.0054903454,0.0015990894,0.000003597147,0.000008635339,0.000047051002,0.00031245238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952185,0.00003150104,0.0005755148,0.002196024,0.0013894163,0.0005890198],"domain_scores_gemma":[0.99719155,0.00035161304,0.00025110648,0.0017829541,0.00014221958,0.00028053296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004915126,0.00053007837,0.00056572753,0.0004020457,0.00017472895,0.0006343034,0.004694686,0.00032486772,0.000051783358],"category_scores_gemma":[0.000106570486,0.00050437695,0.00015065515,0.0004927979,0.00032159017,0.0004846287,0.0024472678,0.0010422113,0.00018444825],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002089169,0.00004136187,0.00008684981,0.00004698983,0.000042937823,0.0005495506,0.0018660341,0.041819766,0.0020215837,0.07687426,0.00013717978,0.87649256],"study_design_scores_gemma":[0.00022099362,0.000081300466,0.00001859655,0.00018471025,0.000006474863,0.000013418464,7.2752954e-8,0.7909113,0.001393497,0.20337085,0.0032718761,0.0005268903],"about_ca_topic_score_codex":0.000021951766,"about_ca_topic_score_gemma":0.000025719202,"teacher_disagreement_score":0.8759657,"about_ca_system_score_codex":0.000360942,"about_ca_system_score_gemma":0.0007882339,"threshold_uncertainty_score":0.9997408},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032243915,0.0008106095,0.9645196,0.0005640938,0.0006132219,0.00071183883,0.0000060627303,0.00025029978,0.00028035234],"genre_scores_gemma":[0.8863706,0.000020291161,0.11288856,0.00021901669,0.00036291758,0.0000107146925,0.0000069355992,0.0000042488464,0.0001167262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832094,0.00002825849,0.00026723745,0.00063106377,0.0003556425,0.0003968878],"domain_scores_gemma":[0.99928254,0.00013661203,0.00017032099,0.00013566528,0.00019387789,0.00008097455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005163766,0.0002681423,0.0002838302,0.00009231784,0.00018903075,0.00013686533,0.00079319335,0.00036656423,0.000077440294],"category_scores_gemma":[0.000062500156,0.00012031609,0.00006370921,0.00027085253,0.0005325149,0.00012623651,0.00029200365,0.00035962428,0.000022530874],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007595569,0.000008926658,0.00005105714,0.000004665972,0.0000037982113,0.000025653742,0.00007545484,0.001293409,0.008250226,0.00013048032,0.0000031401078,0.99014556],"study_design_scores_gemma":[0.0010335183,0.003344664,0.0031839178,0.001655748,0.00015617105,0.00063776853,0.000010929781,0.70954645,0.010608033,0.2527762,0.013441857,0.0036047313],"about_ca_topic_score_codex":0.00002628085,"about_ca_topic_score_gemma":0.00023292186,"teacher_disagreement_score":0.98654085,"about_ca_system_score_codex":0.00016930388,"about_ca_system_score_gemma":0.000060293776,"threshold_uncertainty_score":0.49063477},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035274393,0.0004800607,0.7395011,0.013308929,0.0027501401,0.0018381103,0.00047573925,0.00013069241,0.24116248],"genre_scores_gemma":[0.9471417,0.0006015775,0.022469567,0.025151232,0.0032561542,0.000015976839,0.000086295455,0.00006974876,0.0012077397],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968541,0.00008901445,0.00027499843,0.0015526247,0.0007928333,0.00043638132],"domain_scores_gemma":[0.997596,0.0010756055,0.0002318746,0.0006370973,0.00020548204,0.00025392478],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0013331972,0.00029685872,0.00043482104,0.00024049408,0.00068274466,0.0005286707,0.0043485006,0.00037431787,0.000031749867],"category_scores_gemma":[0.0010606286,0.00029749575,0.00003280048,0.00046224528,0.005268359,0.00050961593,0.002961719,0.0008774662,0.000044496006],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011218054,0.00005590287,0.0007663131,0.000018356588,0.00007684015,0.0001702819,0.015875695,0.00042319339,0.000008918341,0.024319751,0.00044147743,0.95773107],"study_design_scores_gemma":[0.0020185397,0.0016598783,0.0074667023,0.0028552858,0.00021770553,0.000021572227,0.000111139874,0.03188659,0.00010703473,0.9042353,0.046615753,0.002804503],"about_ca_topic_score_codex":0.00028776794,"about_ca_topic_score_gemma":0.0011877591,"teacher_disagreement_score":0.9549266,"about_ca_system_score_codex":0.00018723699,"about_ca_system_score_gemma":0.00093858247,"threshold_uncertainty_score":0.9999477},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044805784,0.00094244187,0.31789634,0.0063585658,0.0034605542,0.011289219,0.00023838696,0.00093778205,0.6140709],"genre_scores_gemma":[0.9884894,0.000003951163,0.00997694,0.00037272353,0.0005081462,0.000077635385,0.00002743337,0.000050665,0.00049311446],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934842,0.00025999435,0.0006046932,0.0015632578,0.003421643,0.00066621345],"domain_scores_gemma":[0.99464315,0.0025828567,0.00044540956,0.0007571624,0.0012948735,0.00027654966],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002323468,0.0005779151,0.00075661566,0.00026312174,0.00069553714,0.0016228056,0.0014164817,0.00020973427,0.0002690742],"category_scores_gemma":[0.0015507843,0.00044283373,0.00010446441,0.000613158,0.008336437,0.0015125707,0.0003895375,0.00067847414,0.00003363623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007879027,0.00028585584,0.016572434,0.0010999287,0.00037159064,0.00006747853,0.19422369,0.22155094,0.000022887943,0.14419328,0.00014023649,0.42068377],"study_design_scores_gemma":[0.00340495,0.005161656,0.0017213852,0.0079470035,0.00050901267,0.000103081285,0.008517368,0.46421102,0.00010262132,0.49732563,0.0054746135,0.0055216504],"about_ca_topic_score_codex":0.0006873888,"about_ca_topic_score_gemma":0.0052859304,"teacher_disagreement_score":0.9436836,"about_ca_system_score_codex":0.0016412135,"about_ca_system_score_gemma":0.00314956,"threshold_uncertainty_score":0.99980235},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033469807,0.00014210174,0.99534196,0.0012442091,0.0013650028,0.00051168253,0.0000033956908,0.00009731363,0.000959636],"genre_scores_gemma":[0.50004715,0.000022121294,0.49923342,0.0004973761,0.00014048259,0.000012135918,0.000009496689,0.000019037825,0.00001880279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964792,0.00009453428,0.0009383405,0.0011845737,0.0008245563,0.00047878007],"domain_scores_gemma":[0.99753493,0.00017610195,0.0006666873,0.001217096,0.0002768312,0.00012837762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012907675,0.00037615534,0.00052659237,0.0009770803,0.00015443844,0.00017500791,0.0025555652,0.0003271233,0.0000070578267],"category_scores_gemma":[0.0001630406,0.0003910793,0.00010348678,0.0009320379,0.00037651815,0.0015276754,0.0007845998,0.0010393896,0.00002117127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025263049,0.000052830077,0.00020362234,0.00023512842,0.0000066238786,0.000018956718,0.0022008624,0.024259998,0.0033733228,0.2194258,0.0000051201177,0.75019246],"study_design_scores_gemma":[0.0004042371,0.0005829996,0.0024895945,0.00079231,0.0000059885488,0.000039739505,0.0000010935408,0.89178723,0.016098859,0.08679584,0.0003212113,0.0006809074],"about_ca_topic_score_codex":0.0001263499,"about_ca_topic_score_gemma":0.00012960778,"teacher_disagreement_score":0.86752725,"about_ca_system_score_codex":0.000546907,"about_ca_system_score_gemma":0.00040607678,"threshold_uncertainty_score":0.9998541},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046501445,0.0006882363,0.9377601,0.05361865,0.0025318826,0.00066993624,0.00013130637,0.00133744,0.003215949],"genre_scores_gemma":[0.051882956,0.00006585908,0.944087,0.002974124,0.0005394127,0.000012849574,0.00032222495,0.00008151128,0.000034031484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99025494,0.00009354999,0.0011611861,0.004630367,0.0025981297,0.0012618403],"domain_scores_gemma":[0.961794,0.00088152447,0.0008328993,0.03575055,0.00037482008,0.00036615873],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0018550187,0.0009548655,0.00090701383,0.0012024456,0.00045636023,0.0049949973,0.19590163,0.0007487082,0.000054281507],"category_scores_gemma":[0.035118196,0.00093353546,0.00013227527,0.0017321289,0.0009282289,0.0093669025,0.5332286,0.0028445662,0.00008859456],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011824272,0.000049244874,0.000327804,0.00012234133,0.000039661503,0.0004793971,0.00047979248,0.0015469117,0.000038815055,0.0064461622,0.042423856,0.94803417],"study_design_scores_gemma":[0.00015992283,0.00010437467,0.00002838407,0.0003650488,0.0000069138923,0.00004148173,2.8470538e-7,0.5815159,0.00035050185,0.39889175,0.017833017,0.0007024203],"about_ca_topic_score_codex":0.00015580573,"about_ca_topic_score_gemma":0.00019921083,"teacher_disagreement_score":0.9473318,"about_ca_system_score_codex":0.0005801626,"about_ca_system_score_gemma":0.0012068851,"threshold_uncertainty_score":0.9994559},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057766152,0.00038913285,0.99324065,0.0014830712,0.0012655843,0.00044275183,0.0000032171852,0.00083926425,0.0022785375],"genre_scores_gemma":[0.40655187,0.000012565657,0.59073335,0.0015890513,0.0006927385,0.00002444923,0.0000044931608,0.00007879417,0.00031266946],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948889,0.00006530037,0.000491378,0.001978154,0.0016405856,0.0009356916],"domain_scores_gemma":[0.9948227,0.0026690105,0.00013438087,0.0018219607,0.00017028474,0.0003816801],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012213587,0.00062369846,0.0005967848,0.00093727163,0.00020363508,0.00068870914,0.0065321717,0.0003733167,0.000026766735],"category_scores_gemma":[0.0011742167,0.00055578025,0.00020098696,0.0010703547,0.00096294325,0.00040019283,0.003336147,0.00208193,0.00013861024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016956872,0.000022083485,0.000050053586,0.00006499527,0.000018416544,0.00044937345,0.00049864367,0.009362145,0.0003619131,0.16306391,0.00003798491,0.8260535],"study_design_scores_gemma":[0.0003957585,0.00039686545,0.0010728465,0.00041405784,0.000009159289,0.00064578035,8.496873e-8,0.18699178,0.0011740826,0.8064414,0.0011724306,0.0012857093],"about_ca_topic_score_codex":0.000009993172,"about_ca_topic_score_gemma":0.000021074571,"teacher_disagreement_score":0.8247678,"about_ca_system_score_codex":0.00047659254,"about_ca_system_score_gemma":0.00071584695,"threshold_uncertainty_score":0.99968934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007582157,0.00939109,0.9848547,0.00002364981,0.0021930584,0.00026696702,0.0000057840684,0.00019117314,0.0023153692],"genre_scores_gemma":[0.9560252,0.000622152,0.04139247,0.00014631398,0.0013942219,0.000012412779,0.00000672067,0.00009012987,0.0003103695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983489,0.000010837209,0.00029956785,0.00047518907,0.00041631784,0.00044922114],"domain_scores_gemma":[0.99917805,0.00012164852,0.000055633784,0.00042732092,0.000060473994,0.00015685066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041182898,0.0003477171,0.00037485812,0.00028073028,0.00008806322,0.00020047721,0.00049552124,0.0002589245,0.000026518044],"category_scores_gemma":[0.000011146026,0.0003112387,0.000052559586,0.0001268022,0.00014347788,0.00017464664,0.0001608067,0.00044782175,0.000040712246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004132254,0.000020438745,0.00008020095,0.0003675696,0.000051219133,0.00007099914,0.001064658,0.37121466,0.0007111511,0.008523282,0.00007965365,0.61781204],"study_design_scores_gemma":[0.00015643467,0.000067087356,0.000104546445,0.00039437355,0.000025252277,0.0001743842,3.253706e-7,0.97845936,0.0020409834,0.004000623,0.013758046,0.00081856793],"about_ca_topic_score_codex":0.000013631792,"about_ca_topic_score_gemma":0.000009761601,"teacher_disagreement_score":0.955267,"about_ca_system_score_codex":0.00014515805,"about_ca_system_score_gemma":0.0000640881,"threshold_uncertainty_score":0.99993396},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.772501e-7,0.0003903068,0.99540126,0.001158879,0.00065621705,0.00035462278,0.000001162686,0.0001761727,0.0018604103],"genre_scores_gemma":[0.00085209205,0.00032893746,0.99668884,0.00061334507,0.00028884897,0.000009356999,0.000011059131,0.00002872315,0.0011788206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627125,0.00014243888,0.00044949824,0.0014515142,0.0011583566,0.0005269275],"domain_scores_gemma":[0.99800843,0.0006000561,0.00020606107,0.0005702672,0.00032220493,0.00029296355],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00097096484,0.0003556186,0.00042229771,0.00077830337,0.00025734204,0.0010397051,0.0020827833,0.0002064583,0.000041337156],"category_scores_gemma":[0.0008065885,0.00034172242,0.00005275001,0.0016211261,0.0004909366,0.00047604126,0.0021324868,0.0010785612,0.000037168367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013686449,0.000008319756,0.000014984953,0.000029243887,0.0000040160016,0.000031432184,0.00042437864,0.62505054,0.000003453171,0.0005718826,0.00003986124,0.37382054],"study_design_scores_gemma":[0.00012600739,0.00015574617,0.000006083742,0.00009852539,0.0000034511431,0.000030628587,1.9834461e-7,0.9910013,0.00015146771,0.005650709,0.0024425094,0.00033336564],"about_ca_topic_score_codex":0.0000042196343,"about_ca_topic_score_gemma":0.000002162098,"teacher_disagreement_score":0.37348717,"about_ca_system_score_codex":0.00029733608,"about_ca_system_score_gemma":0.0011276243,"threshold_uncertainty_score":0.9999973},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042143944,0.00029114218,0.99463356,0.0012798476,0.0018305337,0.00031377908,0.0000017543919,0.00018886001,0.0010391097],"genre_scores_gemma":[0.7158797,0.00004843662,0.2786621,0.0038320776,0.0010005968,0.000015399806,0.000007841683,0.000048136913,0.00050576084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970517,0.00003121031,0.0003920907,0.001471663,0.0007047585,0.00034857407],"domain_scores_gemma":[0.9984409,0.00016173588,0.0002226552,0.0008644932,0.0001503221,0.0001598896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059689954,0.00035593248,0.00029926968,0.00042764904,0.000223895,0.0009455645,0.0015367692,0.0002554894,0.000006998],"category_scores_gemma":[0.00007751961,0.0003350262,0.00007008006,0.00043721043,0.00031767425,0.00069960626,0.00080673693,0.000653212,0.00005707949],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028597326,0.0000608257,0.0012950338,0.0003362934,0.000060979797,0.0001860052,0.007226499,0.007672288,0.009096798,0.14831948,0.00045841045,0.8252588],"study_design_scores_gemma":[0.00038069187,0.00019411277,0.0019872414,0.00015581783,0.000023895798,0.00014877587,3.8077025e-7,0.52390534,0.015314523,0.45247743,0.004241347,0.00117044],"about_ca_topic_score_codex":0.00000698819,"about_ca_topic_score_gemma":0.0000068094682,"teacher_disagreement_score":0.82408834,"about_ca_system_score_codex":0.00012116482,"about_ca_system_score_gemma":0.00019173531,"threshold_uncertainty_score":0.9999102},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08388412,0.00008193196,0.91394126,0.0007567618,0.00071513106,0.0003661623,9.65776e-7,0.00023306384,0.000020581867],"genre_scores_gemma":[0.9454402,3.7509977e-7,0.054040913,0.00037058126,0.00010154638,0.000030035826,4.4459048e-7,0.000012168784,0.0000037712282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887043,0.000032508753,0.00016093103,0.00026912097,0.00025038223,0.00041662695],"domain_scores_gemma":[0.9993688,0.00014475806,0.000021850778,0.00035018433,0.00004718968,0.00006724937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053593813,0.00012387574,0.00013040807,0.00012231809,0.0001746696,0.00013677293,0.000527319,0.000043013915,0.0000080963355],"category_scores_gemma":[0.000044043245,0.00008775915,0.00003387121,0.00083365204,0.00005069711,0.00010997956,0.00008172995,0.000249972,0.00013331765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.71961e-7,0.0000074579443,0.0022862186,0.000015293857,0.0000021974897,9.283249e-7,0.00041481276,0.9365711,0.0048422567,0.00003533536,0.000015313932,0.055808295],"study_design_scores_gemma":[0.00024021187,0.000050603587,0.0026687528,0.00005539723,0.0000013458832,0.0000029090684,0.0000012090154,0.9933865,0.001798226,0.000034736346,0.0016315129,0.00012861683],"about_ca_topic_score_codex":0.000032806372,"about_ca_topic_score_gemma":0.0000747778,"teacher_disagreement_score":0.86155605,"about_ca_system_score_codex":0.00009361915,"about_ca_system_score_gemma":0.00007129019,"threshold_uncertainty_score":0.35787144},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02792282,0.000036483998,0.9666825,0.0015375606,0.0025444091,0.00097301515,0.000010892548,0.00027874214,0.000013564354],"genre_scores_gemma":[0.62108505,0.0000039395472,0.37845066,0.00021249785,0.00016577574,0.000058959187,0.000010414063,0.0000121325,5.572413e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680096,0.000046196943,0.000517016,0.0016489441,0.00056758535,0.00041928355],"domain_scores_gemma":[0.99823993,0.00022363917,0.00025390563,0.0008276325,0.00030172773,0.00015317164],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00075608346,0.0003374014,0.00032438667,0.0005226368,0.00020102673,0.0014678924,0.0012159143,0.00022355083,3.4310713e-7],"category_scores_gemma":[0.00051659276,0.00035449996,0.00008497849,0.000972292,0.00039530438,0.0012986257,0.0012180952,0.00048050343,0.0000041202843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011582002,0.000019198498,0.000024679372,0.00010269407,0.000005442783,0.0000035768126,0.0007752458,0.1811952,0.028144162,0.0004408478,0.000004017274,0.7892734],"study_design_scores_gemma":[0.00019165906,0.0000753857,0.0006532094,0.00006360584,0.000006905238,0.00002173826,6.2400755e-7,0.800893,0.049224634,0.14858703,0.0000035801584,0.00027859988],"about_ca_topic_score_codex":0.000042628348,"about_ca_topic_score_gemma":0.000088338566,"teacher_disagreement_score":0.7889947,"about_ca_system_score_codex":0.00025792266,"about_ca_system_score_gemma":0.00031825042,"threshold_uncertainty_score":0.9998907},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002560117,0.0015033049,0.97578,0.019526662,0.001500752,0.0005253691,0.000008603457,0.00081031595,0.00008898913],"genre_scores_gemma":[0.21994573,0.00010729703,0.778221,0.0013813053,0.00028589898,0.00003474002,0.0000029720295,0.00002047153,5.7953184e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99392796,0.00032538304,0.00074840727,0.0032421316,0.00095427246,0.0008018438],"domain_scores_gemma":[0.9961978,0.0008467112,0.00036160517,0.0020246697,0.00027551595,0.0002937013],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023518517,0.0006211418,0.00063189067,0.00050517474,0.0003564709,0.0009564329,0.004529904,0.0003215861,0.0000011993187],"category_scores_gemma":[0.0013836066,0.00056826486,0.0000987059,0.001900295,0.00082958286,0.00039998256,0.008860965,0.0017720554,0.000008053639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002722761,0.000114523704,0.0000059404697,0.00011196056,0.0000056330587,0.00008907912,0.0026198523,0.12932265,0.0011985245,0.0010210294,0.00004078546,0.8654428],"study_design_scores_gemma":[0.00025481227,0.00030716846,0.000097476935,0.0004139074,0.0000040017244,0.000033236636,4.371889e-7,0.89656836,0.009742605,0.09171278,0.0003240708,0.0005411583],"about_ca_topic_score_codex":0.000021090327,"about_ca_topic_score_gemma":0.000005462107,"teacher_disagreement_score":0.86490166,"about_ca_system_score_codex":0.00031927816,"about_ca_system_score_gemma":0.0005434347,"threshold_uncertainty_score":0.9996769},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044224702,0.00008090956,0.9950238,0.0023056634,0.00114129,0.0007867678,0.000017702498,0.00015156569,0.000050051804],"genre_scores_gemma":[0.32175538,0.000001929187,0.6761115,0.0019473865,0.00013809142,0.000011939329,0.00000953751,0.000016624803,0.000007581501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746454,0.000020971398,0.00046577252,0.0011147,0.00054113165,0.00039291277],"domain_scores_gemma":[0.997631,0.0012215741,0.00020086115,0.0005587553,0.00020412393,0.00018369887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042492192,0.00038365205,0.00047321856,0.00058430363,0.00036471782,0.00060081563,0.0010805704,0.00028963914,0.000005463097],"category_scores_gemma":[0.0003069333,0.00034879695,0.00010302833,0.00044129428,0.0003463527,0.00041504286,0.00021229347,0.0004911712,0.0000038305434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011752982,0.00007423133,0.000679381,0.00026993436,0.000037501577,0.00020803318,0.004674677,0.2417957,0.001992395,0.039051875,0.00014309387,0.7109556],"study_design_scores_gemma":[0.00024042111,0.00034875784,0.00013972503,0.0009800846,0.000017421704,0.0000396083,0.0000017966005,0.86851305,0.0020875274,0.12668946,0.0005195779,0.00042257237],"about_ca_topic_score_codex":0.000019171672,"about_ca_topic_score_gemma":0.000048584836,"teacher_disagreement_score":0.7105331,"about_ca_system_score_codex":0.00014716621,"about_ca_system_score_gemma":0.00058356614,"threshold_uncertainty_score":0.9998964},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027007126,0.00013723418,0.99352866,0.0023491208,0.0019595348,0.00081853796,0.000015904034,0.00019365594,0.00072727667],"genre_scores_gemma":[0.28829396,0.00013200549,0.6969035,0.010629543,0.0034471322,0.000121785146,0.00011261116,0.00010039489,0.00025903876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973084,0.000025840805,0.00038394006,0.0013474241,0.0005014093,0.00043298924],"domain_scores_gemma":[0.9985624,0.00023445123,0.00021305669,0.00044195747,0.00029364644,0.0002545016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046727678,0.00040819708,0.00039723702,0.0005409744,0.00031677028,0.00054197613,0.00080667925,0.00031182793,0.000015711299],"category_scores_gemma":[0.000088125205,0.00039202263,0.000105945226,0.00045158315,0.00017857556,0.00032529913,0.00047811866,0.0005853481,0.000037331854],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017604063,0.00001781044,0.0000012195026,0.000040104405,0.0000082051365,0.000011517993,0.00026821325,0.025236752,0.000118980795,0.0015894278,0.00009876272,0.9725914],"study_design_scores_gemma":[0.00041400507,0.0004266205,0.000068446054,0.0003476581,0.000019916877,0.000057862155,3.438127e-7,0.9395294,0.0015391925,0.053492717,0.0034919,0.0006119351],"about_ca_topic_score_codex":0.000006504185,"about_ca_topic_score_gemma":0.00004759135,"teacher_disagreement_score":0.97197944,"about_ca_system_score_codex":0.00017442834,"about_ca_system_score_gemma":0.00018646645,"threshold_uncertainty_score":0.9998532},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009589321,0.0003830738,0.99315524,0.0038586098,0.0013456544,0.00063522474,0.000003456368,0.00015085939,0.0003720145],"genre_scores_gemma":[0.58967984,0.00006734025,0.4065288,0.0028443814,0.00063900015,0.00007433074,0.000032266555,0.000045426168,0.00008861878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958826,0.0000630112,0.00074252643,0.0018059177,0.00081783463,0.0006881356],"domain_scores_gemma":[0.997943,0.00049853715,0.00031626775,0.0009244917,0.00014221719,0.00017549873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004513094,0.0004980882,0.0004993731,0.0007247615,0.00017429712,0.00023100163,0.0026724432,0.00030442566,0.000014544611],"category_scores_gemma":[0.000048756003,0.0005224942,0.00011337144,0.001680016,0.00038302713,0.00084296556,0.001068548,0.0011950934,0.00003096162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008941992,0.000030199051,0.000165167,0.000013988896,0.0000034440195,0.00011479902,0.00012093688,0.59232193,0.00015655847,0.2826572,0.00002025814,0.12438656],"study_design_scores_gemma":[0.00023864572,0.000050457144,0.001276339,0.00010151683,0.0000018663527,0.000026982236,8.5289464e-8,0.64539444,0.000019591002,0.35241127,0.0001478304,0.00033094524],"about_ca_topic_score_codex":0.000012150001,"about_ca_topic_score_gemma":0.00023454516,"teacher_disagreement_score":0.58958393,"about_ca_system_score_codex":0.00046455,"about_ca_system_score_gemma":0.00021439312,"threshold_uncertainty_score":0.99972266},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001970867,0.00014400479,0.99707943,0.000054158743,0.00023357048,0.00011420158,0.000009949587,0.000073979434,0.00031980855],"genre_scores_gemma":[0.6397743,0.000043480115,0.35995588,0.00006768889,0.00011388927,5.707604e-7,0.0000035320136,0.000028261707,0.000012392945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986822,0.000007667417,0.00020139065,0.0005116616,0.00032743652,0.00026965688],"domain_scores_gemma":[0.999474,0.000054867116,0.000029475563,0.00026066133,0.00007082221,0.00011019762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018056492,0.00025698927,0.000330281,0.00022756754,0.000092531394,0.00022156595,0.00036882368,0.00018256909,0.000013690005],"category_scores_gemma":[0.000030863583,0.0002583754,0.000063691834,0.00034112888,0.000188352,0.00007856447,0.0002495334,0.00032040125,0.000006486095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011565121,0.0000027182223,0.00013456642,0.000044341934,0.000019964207,0.000014769958,0.0000798569,0.9694812,0.0003060103,0.000016802598,2.0960266e-7,0.029898362],"study_design_scores_gemma":[0.0000723205,0.000010921223,0.00024826528,0.000121142,0.000028936847,0.000009861922,2.1558415e-7,0.9988469,0.00019745251,0.0001992373,0.0000041278395,0.0002606499],"about_ca_topic_score_codex":0.00009709078,"about_ca_topic_score_gemma":0.000053715572,"teacher_disagreement_score":0.63780344,"about_ca_system_score_codex":0.00020568128,"about_ca_system_score_gemma":0.000071157156,"threshold_uncertainty_score":0.9999868},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016766714,0.0002852061,0.97071314,0.0022396338,0.0010812631,0.0005532208,0.00005231663,0.00013547023,0.0081730215],"genre_scores_gemma":[0.99691314,0.00001254019,0.0026673297,0.00014351332,0.000046163594,0.0000030069957,0.0000012358648,0.0000067150277,0.0002063896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745816,0.000037328628,0.00065190636,0.00048454799,0.0011561416,0.00021189598],"domain_scores_gemma":[0.99742895,0.0007998056,0.0005436225,0.00081919704,0.0003283013,0.00008012326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014627518,0.00023164277,0.0003623928,0.0005477532,0.00027144293,0.0003897394,0.0016167171,0.00024186424,0.000009469445],"category_scores_gemma":[0.00067527674,0.00012923579,0.00010548383,0.00057509524,0.0009852117,0.00035466815,0.00035556685,0.0004977214,0.000040997584],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020016011,0.000017179726,0.005624699,0.00004985273,0.00002131418,0.000027245505,0.0022512393,0.010220835,0.000038953072,0.1703892,0.0006606675,0.81049865],"study_design_scores_gemma":[0.001980736,0.0016226632,0.16727029,0.0019966222,0.0000470091,0.00015749058,0.00007524487,0.22243366,0.0011370373,0.58770096,0.013613295,0.001965001],"about_ca_topic_score_codex":0.000009264107,"about_ca_topic_score_gemma":0.00003006499,"teacher_disagreement_score":0.9801464,"about_ca_system_score_codex":0.00015689452,"about_ca_system_score_gemma":0.00023286816,"threshold_uncertainty_score":0.52700824},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028382536,0.00250307,0.7563951,0.026849138,0.005240079,0.010140918,0.000012627374,0.0009772659,0.16949928],"genre_scores_gemma":[0.92009926,0.00007823862,0.040448982,0.031923756,0.0040706787,0.00007767597,0.000044711094,0.00019354513,0.0030631314],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966598,0.000026026508,0.0005439411,0.0014330703,0.0007651518,0.0005719996],"domain_scores_gemma":[0.99870074,0.00019910236,0.00034779505,0.00060157955,0.00011461307,0.00003616422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016634702,0.00048031443,0.0005319001,0.0011789076,0.00015295942,0.00060180994,0.00093882624,0.00012558569,0.000058732752],"category_scores_gemma":[0.000459487,0.00046406433,0.000058489415,0.00094232464,0.00039360026,0.0008515275,0.0020744102,0.00053555984,0.000023266204],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013525164,0.00010270131,0.024308983,0.0040594665,0.000061634484,0.00052593986,0.00081477826,0.004582681,0.00008514434,0.04565672,0.0004747003,0.919192],"study_design_scores_gemma":[0.0025209861,0.00009930729,0.07457506,0.0018175078,0.000095413794,0.000010887065,0.000019864956,0.31154582,0.00012900968,0.50047463,0.10553349,0.0031780459],"about_ca_topic_score_codex":0.00091609184,"about_ca_topic_score_gemma":0.00071220426,"teacher_disagreement_score":0.91601396,"about_ca_system_score_codex":0.0002940892,"about_ca_system_score_gemma":0.00011500685,"threshold_uncertainty_score":0.99978113},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009591925,0.00033390758,0.9942738,0.0026119226,0.00083257107,0.00027975283,0.00009638349,0.00036039922,0.00025209374],"genre_scores_gemma":[0.1386029,0.00006272642,0.86060816,0.0005166453,0.00011457434,0.0000021443818,0.00004425723,0.000035974164,0.000012620025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99460965,0.000051580588,0.000914661,0.0024437925,0.0012721979,0.00070808607],"domain_scores_gemma":[0.98455894,0.0005052654,0.0007341944,0.013818892,0.00022035635,0.00016232769],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0006880131,0.0006579646,0.0012522702,0.0024964123,0.00017577734,0.00045555478,0.06420543,0.00046662492,0.00003530898],"category_scores_gemma":[0.003419802,0.00062972907,0.00032544017,0.0036190127,0.0012038487,0.00077976845,0.14741026,0.0010248382,0.000013994737],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003324324,0.00017310998,0.0020568985,0.00032673625,0.0016967858,0.00048584887,0.00055812404,0.058568697,0.023956556,0.024679989,0.00072245294,0.8867416],"study_design_scores_gemma":[0.00012149468,0.000056852958,0.00019564445,0.00016984167,0.00015878127,0.000009406234,5.7156043e-8,0.79898775,0.0070597134,0.19250143,0.00021441505,0.0005246293],"about_ca_topic_score_codex":0.000054472403,"about_ca_topic_score_gemma":0.00005481588,"teacher_disagreement_score":0.88621694,"about_ca_system_score_codex":0.00029493257,"about_ca_system_score_gemma":0.0004036133,"threshold_uncertainty_score":0.99961543},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029729467,0.00014585377,0.991737,0.00074653444,0.0005079615,0.0019148596,0.00007248537,0.00011563235,0.0017867467],"genre_scores_gemma":[0.97513103,0.000028121678,0.021761186,0.0008894867,0.0013689756,0.00004879133,0.00022598587,0.00007177409,0.0004746542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969539,0.00004342897,0.00041399527,0.001042116,0.0010814576,0.00046511792],"domain_scores_gemma":[0.9982479,0.00025744148,0.00017915985,0.00044034282,0.00044635782,0.0004288016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063762726,0.00033531393,0.0004911232,0.00035310615,0.00016292697,0.00014100553,0.00034084378,0.00014118275,0.000046172354],"category_scores_gemma":[0.00013865372,0.00029753163,0.00016505708,0.00028091553,0.0004345176,0.00016700242,0.00026271775,0.00032612885,0.00003770536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039257626,0.00045966535,0.005212805,0.0027598557,0.000585751,0.0018347845,0.0020295228,0.010641751,0.01321516,0.018950526,0.00037708206,0.9400073],"study_design_scores_gemma":[0.0024431406,0.0018137277,0.0042809066,0.0026555057,0.00072567794,0.00008117395,0.000005456795,0.9755988,0.0034832752,0.0072477753,0.00081167766,0.0008528977],"about_ca_topic_score_codex":0.000031178075,"about_ca_topic_score_gemma":0.000003739855,"teacher_disagreement_score":0.9721581,"about_ca_system_score_codex":0.00038927735,"about_ca_system_score_gemma":0.0009745269,"threshold_uncertainty_score":0.99994767},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009618885,0.000060900667,0.99278426,0.0015111065,0.002938145,0.000999395,0.000030414933,0.0003256289,0.0013405395],"genre_scores_gemma":[0.011891617,0.000011459167,0.9811046,0.0019855702,0.00478739,0.000028590874,0.000010286935,0.000082896724,0.00009759535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943506,0.000050748222,0.00059381546,0.0025247114,0.0014040411,0.0010760789],"domain_scores_gemma":[0.9959757,0.0011795223,0.0002745013,0.0017753432,0.00032564643,0.00046930317],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007160239,0.0007094335,0.0007266429,0.000749456,0.0005135641,0.0012708963,0.004977867,0.00045842788,0.000024358642],"category_scores_gemma":[0.00046569336,0.00071303366,0.0001891829,0.00065992074,0.00077924796,0.00083080033,0.0016350107,0.0015917579,0.000042551834],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038110215,0.000025801,0.0000015444707,0.00006944768,0.000009681122,0.00016712042,0.00076768064,0.1040198,0.00014663332,0.03862844,0.000009389316,0.85611635],"study_design_scores_gemma":[0.0003288382,0.0007289062,0.0000066557686,0.000609739,0.0000039295915,0.0000496323,5.624149e-7,0.74895334,0.00097347243,0.24584465,0.0018257278,0.00067452015],"about_ca_topic_score_codex":0.0000036261429,"about_ca_topic_score_gemma":0.000020092213,"teacher_disagreement_score":0.8554418,"about_ca_system_score_codex":0.00054653455,"about_ca_system_score_gemma":0.0006580691,"threshold_uncertainty_score":0.9997659},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010473715,0.0010791527,0.9843593,0.0013501866,0.0015772213,0.00063227967,0.00006272358,0.00016916166,0.0002962526],"genre_scores_gemma":[0.9896146,0.00006855417,0.0051478753,0.0031199385,0.0016920291,0.00003163288,0.00017916612,0.00005519749,0.00009099008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668616,0.000043407847,0.00033804603,0.0015888172,0.0009204057,0.0004231499],"domain_scores_gemma":[0.998046,0.0003088078,0.00022581933,0.0005966725,0.00016107793,0.00066161226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016914248,0.0005504112,0.0005981728,0.0002846583,0.00027762572,0.00011481866,0.0002824149,0.00029446973,0.00013655133],"category_scores_gemma":[0.00008686469,0.00049769157,0.00027325645,0.00025200518,0.00036951836,0.00017213504,0.0002367369,0.0006950109,0.00005020453],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027437988,0.00048379778,0.0057443967,0.00014831901,0.0005179346,0.0028570013,0.000278696,0.03939293,0.0016735919,0.0015515994,0.00019115496,0.94441676],"study_design_scores_gemma":[0.004255623,0.00069547223,0.20149562,0.0012153891,0.0005084864,0.00011878368,9.543985e-7,0.70773154,0.0011675827,0.06406412,0.017380923,0.0013654742],"about_ca_topic_score_codex":0.000041513424,"about_ca_topic_score_gemma":0.00010025322,"teacher_disagreement_score":0.97921145,"about_ca_system_score_codex":0.0005571336,"about_ca_system_score_gemma":0.00063217216,"threshold_uncertainty_score":0.99974746},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012472642,0.0026213895,0.99452597,0.000714173,0.00074176054,0.00010463194,0.000026678921,0.00022123789,0.00091942796],"genre_scores_gemma":[0.17284307,0.0005112245,0.8181057,0.006979758,0.0011813089,0.000006876979,0.00016445048,0.00007184723,0.00013576027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982876,0.000012730473,0.00031201163,0.00061781966,0.0004957787,0.00027406059],"domain_scores_gemma":[0.9993455,0.00006161748,0.000057994595,0.00032058364,0.000039313145,0.00017502895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000114549905,0.00033591624,0.0004027585,0.000121031204,0.00006273235,0.0001566197,0.00055672904,0.0001445734,0.00011597776],"category_scores_gemma":[0.000028135495,0.00030261918,0.00010929375,0.00030525104,0.00025916603,0.0001698618,0.00015355587,0.00049537676,0.0000817432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012861757,0.000025096124,0.0002356635,0.00013536942,0.000115642644,0.00013545566,0.00019043146,0.15526332,0.0034167552,0.00023269896,0.00027354143,0.83997476],"study_design_scores_gemma":[0.00025214246,0.000017527702,0.00044467516,0.0004145328,0.000052686853,0.0000065785885,3.6667856e-7,0.98104495,0.0018663561,0.015051675,0.0004057305,0.00044279837],"about_ca_topic_score_codex":0.00004617794,"about_ca_topic_score_gemma":0.000033133107,"teacher_disagreement_score":0.83953196,"about_ca_system_score_codex":0.00018500538,"about_ca_system_score_gemma":0.00007944658,"threshold_uncertainty_score":0.9999426},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036348667,0.0010786422,0.9970433,0.00016036927,0.00051148294,0.00021539471,0.000015107529,0.00016942139,0.0004427669],"genre_scores_gemma":[0.13266242,0.000085169835,0.86646134,0.00037564177,0.00031497938,0.0000051499073,0.000007956298,0.000048903417,0.000038419068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987928,0.000004313432,0.00021617988,0.00054208725,0.00019835394,0.00024625036],"domain_scores_gemma":[0.99937874,0.0002124213,0.00004518679,0.00018529608,0.00005379346,0.00012458337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022494278,0.00027115515,0.00028122455,0.00020304194,0.00012833904,0.00024230608,0.00024326089,0.00009534594,0.0000032308342],"category_scores_gemma":[0.000040660052,0.0002753326,0.00003535463,0.00009083452,0.00015321479,0.00020599563,0.00015001534,0.0003774635,0.0000011354055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019516112,9.2576823e-7,0.0000021221135,0.00006564928,0.0000060025177,0.0000057309308,0.00023517391,0.8958954,0.000038213057,0.0015280964,7.345609e-7,0.10222],"study_design_scores_gemma":[0.00024764796,0.000024263592,9.2384266e-7,0.00015745856,0.000007842094,0.000015268215,4.3132917e-7,0.97435546,0.00051745865,0.0243036,0.000070713824,0.00029894942],"about_ca_topic_score_codex":0.0000029277965,"about_ca_topic_score_gemma":0.000004393935,"teacher_disagreement_score":0.13229893,"about_ca_system_score_codex":0.000046818965,"about_ca_system_score_gemma":0.000048701517,"threshold_uncertainty_score":0.9999699},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042353812,0.00080609234,0.993409,0.0012687237,0.0021216227,0.0007298694,0.000022288292,0.00008517534,0.0011337309],"genre_scores_gemma":[0.70131654,0.0000067691954,0.29603937,0.0012433558,0.0010722978,0.000013327494,0.0000074480417,0.000059733266,0.00024113365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976604,0.000016113141,0.000690547,0.0010120309,0.00010398798,0.0005169404],"domain_scores_gemma":[0.9981437,0.0005375967,0.00059393875,0.00057905196,0.000056542245,0.00008920735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014254292,0.00034763754,0.0006095541,0.00023703749,0.00038722402,0.00039103575,0.0012861077,0.0002854014,0.000020250754],"category_scores_gemma":[0.00020835445,0.00031108083,0.00020689741,0.00028111943,0.00043284192,0.00010219594,0.00035544875,0.0007354003,0.00008196372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011310709,0.000013507529,0.00014523462,0.000107139305,0.000029462779,0.000007751472,0.0018053784,0.013764532,0.0000065185186,0.7268363,0.0000069929674,0.25726587],"study_design_scores_gemma":[0.0000960334,0.00007537274,0.000038889626,0.00015867298,0.0000038347866,0.000012077572,4.4549262e-7,0.45778087,0.000007761444,0.5377689,0.0037842374,0.00027290848],"about_ca_topic_score_codex":0.000018445211,"about_ca_topic_score_gemma":0.000018991546,"teacher_disagreement_score":0.70089304,"about_ca_system_score_codex":0.00018471666,"about_ca_system_score_gemma":0.000056452653,"threshold_uncertainty_score":0.99993414},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008075563,0.00020140731,0.99406695,0.0009646414,0.0007625359,0.0012274134,0.000043114745,0.00014825819,0.0025775773],"genre_scores_gemma":[0.09701968,0.000020804393,0.9012974,0.0007826101,0.00064363785,0.000040843825,0.000046270623,0.000039586284,0.0001091744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961487,0.000054438857,0.0006381255,0.0016685809,0.0008774508,0.00061267446],"domain_scores_gemma":[0.99688655,0.0005934686,0.00038915774,0.001779679,0.0001869576,0.00016415761],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015693344,0.0005310994,0.00062757125,0.00038524513,0.00033910424,0.00095178187,0.0064357077,0.00016945765,0.0000045928437],"category_scores_gemma":[0.000061729945,0.00039730562,0.00022716976,0.0005671027,0.0007734209,0.00098863,0.0018105615,0.00050224236,0.0000031611576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017440274,0.000049549973,0.000029321152,0.00031371968,0.00006350057,0.00002329234,0.0012450225,0.05078467,0.00019106061,0.03279772,0.00007316299,0.91441154],"study_design_scores_gemma":[0.0003154433,0.0003205782,0.000034825058,0.00013930716,0.000030861986,0.000015421007,0.0000026589146,0.97222525,0.00037405625,0.024208512,0.0018065025,0.00052657677],"about_ca_topic_score_codex":0.000034703495,"about_ca_topic_score_gemma":0.000024718805,"teacher_disagreement_score":0.9214406,"about_ca_system_score_codex":0.000086313725,"about_ca_system_score_gemma":0.00026189638,"threshold_uncertainty_score":0.9998479},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017170851,0.000060421582,0.99507135,0.0013036696,0.00033596245,0.00026492513,0.000010555049,0.000019490366,0.0012165243],"genre_scores_gemma":[0.7487827,0.000016567801,0.25094476,0.00019725639,0.00003182861,0.0000027764431,0.000009924573,0.000006177679,0.00000799259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799037,0.00006139141,0.00073861756,0.00039750856,0.0006515221,0.00016061935],"domain_scores_gemma":[0.9984205,0.00024168467,0.00058518583,0.00044163212,0.0002796983,0.000031345862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007223609,0.00018479336,0.00034827332,0.00046873378,0.00007375554,0.00005765019,0.0010974044,0.00012830754,0.000004130069],"category_scores_gemma":[0.00006432033,0.00013354997,0.000074843185,0.0008467918,0.0005534447,0.0005538792,0.00009679253,0.00032739755,0.0000011627503],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110991794,0.00019628316,0.0001708019,0.0009582742,0.000024988858,0.000026205762,0.01856339,0.007750222,0.0046666055,0.06861033,0.000030508623,0.8988914],"study_design_scores_gemma":[0.0009752322,0.0006536503,0.00074233534,0.0022911509,0.000026686192,0.00026013443,0.000008941033,0.7736013,0.06892149,0.1519811,0.000073319694,0.0004646428],"about_ca_topic_score_codex":0.000021678377,"about_ca_topic_score_gemma":0.000046074518,"teacher_disagreement_score":0.8984268,"about_ca_system_score_codex":0.000048393103,"about_ca_system_score_gemma":0.00046365667,"threshold_uncertainty_score":0.54460096},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048966706,0.00022120588,0.99681866,0.00043789422,0.0011343358,0.0003164075,0.0000020701414,0.000084579166,0.0004951589],"genre_scores_gemma":[0.80029243,0.000026477572,0.19848247,0.00056675664,0.00057949574,0.0000033841377,0.000004065171,0.00003294858,0.000011975163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966422,0.00005237433,0.0006992595,0.0013297815,0.0007147748,0.00056162087],"domain_scores_gemma":[0.99811184,0.00034533528,0.00055869407,0.000719236,0.00014803928,0.00011683477],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000402599,0.0004410939,0.0006203714,0.00070964213,0.00016364842,0.00015219761,0.0026580484,0.0004064632,0.000004201699],"category_scores_gemma":[0.000050264578,0.00044498994,0.00014804208,0.0015863607,0.00064656,0.0006370889,0.0010023462,0.0011196844,0.0000026906305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013387286,0.00002732334,0.00058225536,0.00003584988,0.000008833458,0.00005555238,0.00063252286,0.57043517,0.00073267904,0.041794483,0.0000118700045,0.3856701],"study_design_scores_gemma":[0.00016805522,0.00005888268,0.0013146707,0.00017928156,0.0000041737,0.000009722015,1.5776449e-7,0.92492056,0.00018436629,0.07268246,0.00008683585,0.00039082213],"about_ca_topic_score_codex":0.000009695543,"about_ca_topic_score_gemma":0.000050084007,"teacher_disagreement_score":0.7998028,"about_ca_system_score_codex":0.00031690783,"about_ca_system_score_gemma":0.00027953662,"threshold_uncertainty_score":0.9998002},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025359614,0.00024727237,0.98926383,0.0013271202,0.0032261866,0.00054429617,0.0000038692037,0.00014831625,0.0049855104],"genre_scores_gemma":[0.2880272,0.00015256739,0.70899266,0.0009177441,0.0017125291,0.00002029872,0.000004020505,0.00006408528,0.00010886769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99545336,0.00014212208,0.0007064279,0.0021078787,0.0008265581,0.0007636749],"domain_scores_gemma":[0.9978486,0.00048459918,0.0003457718,0.0009097721,0.00020182198,0.00020947671],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010314997,0.00056065305,0.0007602908,0.001483082,0.00022267867,0.00041078278,0.002227852,0.00060617214,0.000034140343],"category_scores_gemma":[0.000080853344,0.0005583931,0.00013316753,0.0019914985,0.000617346,0.0008490379,0.0011092459,0.0020901065,0.000020031095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018112709,0.00008850619,0.000102147205,0.00010024422,0.000043089603,0.0015656223,0.0022487035,0.07895353,0.019313008,0.0142024,0.000011857988,0.8831898],"study_design_scores_gemma":[0.0005647511,0.00092911493,0.00004960591,0.00019777443,0.0000067948113,0.00029239416,7.9713755e-7,0.9439054,0.010201677,0.04096052,0.0022231606,0.0006679934],"about_ca_topic_score_codex":0.0001230244,"about_ca_topic_score_gemma":0.0005726678,"teacher_disagreement_score":0.88252175,"about_ca_system_score_codex":0.0029702904,"about_ca_system_score_gemma":0.0013819169,"threshold_uncertainty_score":0.9996868},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008717776,0.001614761,0.83414656,0.13583116,0.003096062,0.0017901115,0.000024249552,0.00020649198,0.014572804],"genre_scores_gemma":[0.9951501,0.000008640126,0.0027379002,0.0008009199,0.00080499507,0.000009030344,8.356744e-7,0.000017275708,0.00047033333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974308,0.00019183617,0.0002851509,0.00060745026,0.0008630229,0.0006217281],"domain_scores_gemma":[0.99791795,0.0012409916,0.00026379692,0.00027805442,0.00013234145,0.00016687666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012723173,0.0002572385,0.00037882142,0.0002870776,0.0004874142,0.0006184285,0.0008513099,0.00026705515,0.000023797062],"category_scores_gemma":[0.0009285505,0.0001847183,0.00008786616,0.00088719476,0.00083248166,0.000113961796,0.00018961683,0.0006649041,0.000021208898],"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.0000049244786,0.000016370668,0.0019284236,0.000048513866,0.000012606059,0.00009426606,0.0034788211,0.0012929033,0.000097240074,0.9660751,0.00006437903,0.026886413],"study_design_scores_gemma":[0.00034988901,0.00019750027,0.0028725683,0.0009334959,0.0000392964,0.00000975698,0.000063749205,0.0629631,0.0005288952,0.9231288,0.007818249,0.0010947319],"about_ca_topic_score_codex":0.0030685053,"about_ca_topic_score_gemma":0.027607063,"teacher_disagreement_score":0.9864323,"about_ca_system_score_codex":0.000296609,"about_ca_system_score_gemma":0.0003424164,"threshold_uncertainty_score":0.99013656},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4391105,0.0055200723,0.4712652,0.03418729,0.008453589,0.01045416,0.000021478825,0.00068327907,0.03030442],"genre_scores_gemma":[0.9971296,0.00001901196,0.0007037717,0.0013983967,0.00033810342,0.000065682936,0.0000016516567,0.000043302723,0.0003004804],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99758154,0.000015760193,0.00029234082,0.00073144154,0.0009890938,0.00038983804],"domain_scores_gemma":[0.99812204,0.0006203727,0.00035880314,0.00075177616,0.00013006628,0.000016972364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051095226,0.0004510895,0.00041246295,0.00013475619,0.0005459616,0.00045228435,0.0016366913,0.00007588604,0.000015523668],"category_scores_gemma":[0.00007695922,0.00021828595,0.00010020754,0.00042575656,0.0013327388,0.0002926075,0.00096737203,0.00043601656,0.000042818592],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003552933,0.000033462016,0.097907595,0.00030845118,0.000111203044,0.00010832455,0.0010336484,0.0030221385,0.0003014943,0.0161842,0.0002628748,0.88037133],"study_design_scores_gemma":[0.0055623557,0.0028497926,0.09328359,0.006737574,0.0011823615,0.000061680264,0.00005168854,0.040924065,0.0137716755,0.0054299654,0.8234559,0.006689339],"about_ca_topic_score_codex":0.00006647186,"about_ca_topic_score_gemma":0.0005838897,"teacher_disagreement_score":0.87368196,"about_ca_system_score_codex":0.000078769626,"about_ca_system_score_gemma":0.00004737277,"threshold_uncertainty_score":0.8901442},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016260821,0.0008950625,0.9892259,0.005719767,0.0017374208,0.0008724122,0.000029910698,0.0006381253,0.00071875716],"genre_scores_gemma":[0.36458308,0.000065168315,0.6282792,0.005746703,0.00097436836,0.000063028434,0.000027952101,0.000085262735,0.00017526581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99224955,0.00021335568,0.0008447654,0.0037943935,0.0019527107,0.00094524643],"domain_scores_gemma":[0.9922547,0.0007171895,0.0006465169,0.005280135,0.0005212309,0.0005802553],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013639278,0.000991096,0.0011344375,0.0006427208,0.0004912741,0.009248563,0.013683817,0.0007226203,0.000008799012],"category_scores_gemma":[0.00028617796,0.0007586724,0.00009548865,0.0010335058,0.0009470433,0.009567452,0.004247215,0.0022375083,0.000016535885],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094941,0.00030856885,0.01043618,0.00044328393,0.00024036459,0.0011419401,0.018722698,0.002493422,0.00014018801,0.18543017,0.002283676,0.7782646],"study_design_scores_gemma":[0.0013469746,0.0041121463,0.0010828853,0.006166826,0.00007154278,0.0011676975,0.00007812154,0.6843825,0.0009056975,0.10801209,0.18578476,0.0068887835],"about_ca_topic_score_codex":0.00011651253,"about_ca_topic_score_gemma":0.00011513768,"teacher_disagreement_score":0.7713758,"about_ca_system_score_codex":0.00028203859,"about_ca_system_score_gemma":0.00082766527,"threshold_uncertainty_score":0.99948645},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050262265,0.00011094708,0.99620193,0.0008218471,0.00037311346,0.0007672318,0.000033057804,0.000044358403,0.0016424923],"genre_scores_gemma":[0.17375536,0.000036223635,0.81448036,0.011427838,0.00019595963,0.000015902904,0.000059653834,0.00001948678,0.000009217431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736184,0.00008159494,0.00064856996,0.00080341834,0.0007166135,0.00038798925],"domain_scores_gemma":[0.99634534,0.0010684114,0.00030120485,0.0020516282,0.000108284956,0.00012515194],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016645308,0.00034289688,0.00039976358,0.0006159438,0.000093545445,0.0008855672,0.008168604,0.00013574767,0.000003955549],"category_scores_gemma":[0.00036830836,0.00027037555,0.00004212591,0.00089162943,0.00023451449,0.0039798245,0.0031858145,0.00041676924,0.00006804758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024587582,0.000036470552,0.000018801695,0.000070152164,0.000010858135,0.00004519525,0.009845186,0.07635972,0.00004024401,0.04730638,0.00029935292,0.8659431],"study_design_scores_gemma":[0.00026982688,0.00038173707,0.00009339544,0.00048555405,0.000006129174,0.000041699066,0.0000037526936,0.93146986,0.0006162643,0.06266879,0.0033964117,0.0005665736],"about_ca_topic_score_codex":0.000030039317,"about_ca_topic_score_gemma":0.000013965548,"teacher_disagreement_score":0.8653765,"about_ca_system_score_codex":0.00010751549,"about_ca_system_score_gemma":0.0006287773,"threshold_uncertainty_score":0.99997485},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021448916,0.0009860232,0.97018766,0.0031442074,0.00054415094,0.0015934269,0.00005452937,0.0002781386,0.0017629557],"genre_scores_gemma":[0.94348747,0.000101475845,0.051396653,0.004104648,0.00025971126,0.000010131128,0.0005404846,0.000044935576,0.000054507742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979085,0.00003636486,0.00032441795,0.0007966101,0.0006018128,0.00033232046],"domain_scores_gemma":[0.99921817,0.00019169805,0.00015576066,0.00024505347,0.000044421813,0.00014491603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001410338,0.0003391597,0.0004501698,0.00035298,0.000101309655,0.000075008735,0.00032123225,0.00016626793,0.000095178366],"category_scores_gemma":[0.000087727865,0.0002418591,0.000049103088,0.00053667324,0.0004304425,0.00013138386,0.00017210327,0.0009887198,0.00001672828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002716302,0.0000725103,0.0072870674,0.00049029087,0.00004084707,0.0016242474,0.0012657085,0.25095475,0.0003441502,0.00023106302,0.00005071947,0.73736703],"study_design_scores_gemma":[0.002209372,0.002332181,0.023685027,0.00039776452,0.00010389963,0.00028488637,0.0000035706773,0.9575571,0.00019584647,0.011967075,0.0004650741,0.0007982464],"about_ca_topic_score_codex":0.00004114469,"about_ca_topic_score_gemma":0.0001699821,"teacher_disagreement_score":0.92203856,"about_ca_system_score_codex":0.00008060075,"about_ca_system_score_gemma":0.00016934557,"threshold_uncertainty_score":0.9862728},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085201324,0.00036878214,0.9968553,0.00046356904,0.00032427104,0.00037880644,0.000013540264,0.000052132193,0.00069154496],"genre_scores_gemma":[0.87101823,0.000038168873,0.12808453,0.00047029962,0.00024356726,0.00000863432,0.000094952484,0.000022512419,0.000019093965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792624,0.000015511769,0.00036228786,0.00072977936,0.00075636763,0.00020984064],"domain_scores_gemma":[0.99873203,0.000119775024,0.00026704246,0.0005047975,0.00020719523,0.00016914993],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013866136,0.0002984176,0.0007002457,0.00080996007,0.00008263681,0.00005986415,0.00015778362,0.00027723622,0.000075952485],"category_scores_gemma":[0.00017902773,0.00026527714,0.00088253996,0.001007059,0.00020667202,0.00013768212,0.00010367207,0.0004224569,0.000007513339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120561024,0.000089705594,0.010471127,0.0001558363,0.0010846459,0.00005117938,0.00030051987,0.51690984,0.000013835353,0.000289274,0.0000042268784,0.47050926],"study_design_scores_gemma":[0.00034099957,0.00023554271,0.03971655,0.00040518102,0.002557869,0.0000111640575,0.00000118131,0.94709927,0.00015711933,0.009224242,0.0000150813785,0.00023582925],"about_ca_topic_score_codex":0.000087235465,"about_ca_topic_score_gemma":0.000011270252,"teacher_disagreement_score":0.87016624,"about_ca_system_score_codex":0.00037242897,"about_ca_system_score_gemma":0.00025083413,"threshold_uncertainty_score":0.99998},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01075928,0.0016311618,0.577271,0.010394688,0.008684742,0.0018052619,0.00011961812,0.00052567123,0.3888086],"genre_scores_gemma":[0.91636807,0.00020248197,0.06363941,0.007230695,0.0053746514,0.00001429425,0.000029798819,0.00009285218,0.0070477533],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99659824,0.000046319718,0.0005057917,0.00094892515,0.0011337502,0.00076697126],"domain_scores_gemma":[0.99885124,0.0004339799,0.00022867246,0.0002314874,0.00010987419,0.00014476763],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005853179,0.0004060305,0.00058179756,0.00028632645,0.00023427627,0.0004253901,0.0010831394,0.00041344576,0.00007440509],"category_scores_gemma":[0.0002560824,0.0003920356,0.00014300454,0.00043939982,0.0012758307,0.0006217809,0.0005187301,0.00089994574,0.000039953626],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003225883,0.000072096744,0.0002610259,0.000086980035,0.0000189851,0.00024158206,0.115244985,0.0016507574,0.0001625105,0.033737376,0.00009356205,0.84839785],"study_design_scores_gemma":[0.0021528555,0.00047335427,0.0017919517,0.0034918936,0.000066185305,0.000030470985,0.0008928236,0.012041454,0.0023947319,0.24297822,0.72905797,0.0046280758],"about_ca_topic_score_codex":0.00028605558,"about_ca_topic_score_gemma":0.010414606,"teacher_disagreement_score":0.9056088,"about_ca_system_score_codex":0.00038912924,"about_ca_system_score_gemma":0.0006992633,"threshold_uncertainty_score":0.99985313},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43446892,0.00003136327,0.5574647,0.007209642,0.000533235,0.00018495988,0.0000030190927,0.000095924355,0.000008219292],"genre_scores_gemma":[0.9590237,0.0000010462257,0.019638153,0.020589463,0.0007209526,0.0000068894456,0.0000013005431,0.000018002447,4.493362e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966014,0.00023646854,0.00023516479,0.0013716664,0.0008846539,0.0006706634],"domain_scores_gemma":[0.993084,0.006146198,0.0001517947,0.00033049445,0.00010986415,0.0001776282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045782575,0.0003235687,0.00032694108,0.00016618196,0.0008434046,0.00018839698,0.00051972974,0.00007532314,0.000030194178],"category_scores_gemma":[0.0049839914,0.00024028712,0.00006401366,0.0033951194,0.0009296274,0.0006180317,0.00048293784,0.00046936315,0.0000038778467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023716848,0.0000265228,0.02029133,0.000019041127,0.0000073425745,0.00005288038,0.0006447213,0.87630606,0.08150736,0.0005975234,0.00021127872,0.020098777],"study_design_scores_gemma":[0.00064992014,0.0003277761,0.025362797,0.0000416181,0.0000056250788,0.000107054955,0.0000024665137,0.94365674,0.01840171,0.010963292,0.0000828974,0.00039808208],"about_ca_topic_score_codex":0.000032595308,"about_ca_topic_score_gemma":0.00007281276,"teacher_disagreement_score":0.5378266,"about_ca_system_score_codex":0.00014295915,"about_ca_system_score_gemma":0.00024290456,"threshold_uncertainty_score":0.97986245},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015720585,0.00007719259,0.98278517,0.0037569604,0.00056345755,0.0006950525,0.000012417197,0.00035759344,0.011594984],"genre_scores_gemma":[0.76613307,0.00024124175,0.22281007,0.007181731,0.0020248862,0.00014006466,0.00012627407,0.00015299923,0.0011896667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946329,0.000051210674,0.0007822636,0.0017749305,0.002111331,0.00064737623],"domain_scores_gemma":[0.9961746,0.00039740073,0.000434098,0.0017650593,0.00040456033,0.0008243268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011795216,0.00061493047,0.00070410734,0.0005031959,0.00031146538,0.0006793439,0.0037617586,0.00044069026,0.000037001002],"category_scores_gemma":[0.00022594703,0.00049191946,0.000117178046,0.001050097,0.00069492194,0.0007185972,0.0011831253,0.00089957926,0.00023959369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020431584,0.0000952807,0.000009973909,0.00008629275,0.000022163007,0.000055326265,0.00074075704,0.0029667697,0.000062086634,0.27758574,0.0002599937,0.7180952],"study_design_scores_gemma":[0.00040209325,0.0012246231,0.00013000227,0.0019912296,0.000029065794,0.00063935155,0.000004850816,0.9445066,0.0011706714,0.04471835,0.003808722,0.0013744712],"about_ca_topic_score_codex":0.0002193804,"about_ca_topic_score_gemma":0.00011604825,"teacher_disagreement_score":0.9415398,"about_ca_system_score_codex":0.0008875283,"about_ca_system_score_gemma":0.0053062607,"threshold_uncertainty_score":0.99975324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01098335,0.00013180543,0.9794139,0.0077518607,0.00019831424,0.0011948283,0.000014344004,0.0000798887,0.00023165524],"genre_scores_gemma":[0.7050065,0.00004140695,0.25039297,0.043539792,0.00032730846,0.0001199406,0.00036786846,0.00010001109,0.00010422214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980968,0.000021357582,0.00028084923,0.0008858811,0.00033250687,0.00038256493],"domain_scores_gemma":[0.9987242,0.00058449525,0.0001704766,0.00030882042,0.00010336982,0.00010861843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115813826,0.00034431776,0.00057091756,0.00023358352,0.00010321627,0.00004138641,0.00018293304,0.0001419675,0.000041517884],"category_scores_gemma":[0.00008653996,0.00024444598,0.00013382574,0.00019423239,0.00033489705,0.000051038198,0.000058841062,0.00029239833,0.00001061571],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0052409936,0.0008912832,0.0023870945,0.0010213959,0.00032573714,0.0020662576,0.00029702508,0.007983537,0.093457595,0.0012919977,0.0007156616,0.88432145],"study_design_scores_gemma":[0.026049566,0.048565958,0.016995698,0.0020193323,0.0010112255,0.00025853567,0.0000022290635,0.5651868,0.06535762,0.26767147,0.0024958807,0.004385712],"about_ca_topic_score_codex":0.000007854509,"about_ca_topic_score_gemma":0.00003041632,"teacher_disagreement_score":0.8799357,"about_ca_system_score_codex":0.00014466765,"about_ca_system_score_gemma":0.00029460934,"threshold_uncertainty_score":0.9968218},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4439501,0.00043972695,0.5543514,0.0008450834,0.00020494618,0.00017565877,0.0000019000751,0.000027944212,0.0000032560686],"genre_scores_gemma":[0.7900945,0.000062565385,0.2093437,0.00016516175,0.00022040759,0.000020972948,0.00007696248,0.000012128251,0.0000036011338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817985,0.00008866587,0.00025627352,0.00086429645,0.00034775186,0.00026318576],"domain_scores_gemma":[0.99909765,0.000342997,0.0000747502,0.00021743114,0.00018249215,0.00008469444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057633116,0.00022088361,0.00044922854,0.0002539928,0.00017304065,0.0003684126,0.00013347004,0.000107442145,0.000012508784],"category_scores_gemma":[0.00023824285,0.00018754882,0.00013602698,0.00040007406,0.0002672273,0.00013383383,0.00017797327,0.00063244795,5.992264e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067200203,0.00012481902,0.06581684,0.0007018849,0.0001686295,0.00013474221,0.0048900233,0.0921916,0.1465069,0.0000055661535,0.0000045738107,0.6887824],"study_design_scores_gemma":[0.0017782716,0.00017904378,0.010950557,0.0015383455,0.0004407655,0.000054381973,0.00006368674,0.9465142,0.037212033,0.00092339236,0.000013385878,0.00033192014],"about_ca_topic_score_codex":0.0001224942,"about_ca_topic_score_gemma":0.000014062385,"teacher_disagreement_score":0.8543226,"about_ca_system_score_codex":0.000101840895,"about_ca_system_score_gemma":0.00017394501,"threshold_uncertainty_score":0.7648019},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048024706,0.00012940225,0.9911742,0.0006245464,0.0015976704,0.0005148462,0.0000041258313,0.0002640442,0.00088868843],"genre_scores_gemma":[0.80411404,0.0000022916397,0.19425198,0.0009613626,0.00056698977,0.000009162964,0.0000016108659,0.00004521973,0.00004733697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826014,0.000017741539,0.0003280662,0.0006261504,0.000434038,0.00033383776],"domain_scores_gemma":[0.998958,0.00018627623,0.000051649084,0.00051410776,0.000095925665,0.00019406226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004230355,0.00035191805,0.0002990581,0.00028239025,0.00021331888,0.0003142501,0.0007203897,0.00020876378,0.00004492012],"category_scores_gemma":[0.00009572708,0.0002858237,0.00005508407,0.0004786032,0.00018394874,0.00007739502,0.00029958074,0.0016220487,0.00004442477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.019291e-7,0.000009636438,0.000037071,0.000008976521,0.000013412496,0.0008039441,0.0040550567,0.91411257,0.0000022590805,0.000041832605,0.000008384631,0.08090597],"study_design_scores_gemma":[0.00016062857,0.00006932844,0.000007165896,0.000107924745,0.000013011169,0.0006431001,0.00005556123,0.99800056,0.00005522624,0.00033486492,0.00019267667,0.0003599388],"about_ca_topic_score_codex":0.000020425054,"about_ca_topic_score_gemma":0.00003063806,"teacher_disagreement_score":0.7993116,"about_ca_system_score_codex":0.00014800116,"about_ca_system_score_gemma":0.00017489176,"threshold_uncertainty_score":0.9999594},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080444075,0.0004704432,0.91444343,0.0022075167,0.0015517616,0.00054295437,0.00006324638,0.00022920438,0.000047338253],"genre_scores_gemma":[0.8846307,0.00007308819,0.11221517,0.0022585685,0.00033875994,0.000006851049,0.000031109816,0.000050724448,0.00039503787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940064,0.00005329047,0.0015274552,0.0018969814,0.0020323547,0.0004835142],"domain_scores_gemma":[0.9939218,0.002722396,0.0011491964,0.0013402893,0.0006856025,0.00018069569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014893631,0.00058376766,0.0008823814,0.0012930585,0.00028665006,0.0005044756,0.00311906,0.0006267217,0.00012832602],"category_scores_gemma":[0.0012232047,0.00048823992,0.00024588287,0.00085969444,0.0011503184,0.0016712887,0.0016525879,0.0015305207,0.000056502067],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002294699,0.0002942618,0.012432999,0.00012304283,0.00005010063,0.00018616895,0.0022158802,0.027322114,0.009205924,0.0012824704,0.0033009662,0.9433566],"study_design_scores_gemma":[0.001390552,0.0028296374,0.020324191,0.007603425,0.00012196638,0.00028870313,0.000030913514,0.9156409,0.0076120747,0.029499635,0.011905527,0.0027524978],"about_ca_topic_score_codex":0.000029695328,"about_ca_topic_score_gemma":0.00011093079,"teacher_disagreement_score":0.9406041,"about_ca_system_score_codex":0.00022544092,"about_ca_system_score_gemma":0.00024195632,"threshold_uncertainty_score":0.99975693},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002057168,0.0026311881,0.9810673,0.0019013275,0.0024181607,0.0005105109,0.000013797726,0.0001351935,0.00926535],"genre_scores_gemma":[0.70658785,0.000075110336,0.290183,0.0012279492,0.0007643405,0.000013821807,0.00000573513,0.000044578144,0.0010976264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922197,0.00012711488,0.00131977,0.002205873,0.0033195328,0.00080800796],"domain_scores_gemma":[0.994947,0.0023623263,0.0005213725,0.0012746279,0.00048734678,0.00040731832],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0053690406,0.0005546944,0.0009793662,0.0017064544,0.00035149377,0.0015256201,0.004008783,0.0003523455,0.00029807427],"category_scores_gemma":[0.0028001755,0.00044641097,0.00021787404,0.0021763677,0.00073621864,0.00059860485,0.001190885,0.0016414025,0.00062948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023334507,0.00011873609,0.0034599046,0.000013371192,0.000036096408,0.0001479157,0.0019801839,0.6299652,0.00011325847,0.003591584,0.00010602359,0.3604444],"study_design_scores_gemma":[0.0009936732,0.0002958974,0.0060011097,0.0010762316,0.00007229354,0.000054822736,0.000018915103,0.60253286,0.00039558925,0.38366482,0.0032368286,0.0016569294],"about_ca_topic_score_codex":0.000045885266,"about_ca_topic_score_gemma":0.00020720133,"teacher_disagreement_score":0.70453066,"about_ca_system_score_codex":0.0002589067,"about_ca_system_score_gemma":0.0013995756,"threshold_uncertainty_score":0.9997988},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80554074,0.00017383017,0.18546608,0.0016117048,0.0010369224,0.001124851,0.00001682935,0.000041416213,0.004987616],"genre_scores_gemma":[0.9985922,0.000007770584,0.0011043544,0.00018776514,0.000034285076,0.0000040107407,4.892566e-7,0.000005602854,0.00006350101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651,0.000060378406,0.0007838365,0.0006672407,0.0017660202,0.00021251998],"domain_scores_gemma":[0.9943605,0.004079411,0.00048979704,0.00080376904,0.0001850183,0.00008149442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034732742,0.00023564592,0.0004557794,0.00027277868,0.00020357518,0.0002489311,0.0016225633,0.000073554074,0.000022669672],"category_scores_gemma":[0.0020066209,0.0001344534,0.000119576485,0.000468168,0.0019752153,0.00043028258,0.00075124844,0.00038166536,0.0000076101414],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012036053,0.0000094358065,0.021451028,0.00004874881,0.0000038639255,0.0000038546864,0.0021472943,0.00260729,0.00014289777,0.002462192,0.000015428022,0.9709876],"study_design_scores_gemma":[0.0018741046,0.0050193802,0.17454319,0.0007501534,0.000068857895,0.00002822068,0.000046800375,0.567158,0.025250483,0.21632569,0.0073359874,0.0015991525],"about_ca_topic_score_codex":0.000012314617,"about_ca_topic_score_gemma":0.0000148856125,"teacher_disagreement_score":0.9693884,"about_ca_system_score_codex":0.000051447336,"about_ca_system_score_gemma":0.0000736464,"threshold_uncertainty_score":0.7277762},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002824942,0.00048596883,0.9895546,0.0017884686,0.0030931062,0.0011183871,0.000026590284,0.0003426616,0.0033077544],"genre_scores_gemma":[0.74566877,0.00003012338,0.25094652,0.0024410046,0.00043535986,0.000048230955,0.000006152846,0.00007359145,0.00035027726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942473,0.00021758619,0.0012491283,0.002373362,0.0012182656,0.00069432403],"domain_scores_gemma":[0.99513745,0.00051813445,0.0007636864,0.0021913918,0.00089723,0.0004921004],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016877981,0.0007985847,0.0012132924,0.0010478112,0.00019869121,0.0024075534,0.0062262435,0.00046931073,0.00001712699],"category_scores_gemma":[0.00023259492,0.00073708984,0.00019146953,0.0008320627,0.00028507545,0.004815423,0.0026894286,0.0018727027,0.00006177194],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104133076,0.00023279001,0.00017525637,0.00033831396,0.0001684327,0.00012165438,0.0117064845,0.0054536993,0.0064687817,0.05987256,0.0013884433,0.91396946],"study_design_scores_gemma":[0.0020245279,0.0113611845,0.0004052774,0.014726789,0.000099019664,0.0006527269,0.000059326987,0.41125336,0.26706317,0.10047009,0.18246064,0.0094238855],"about_ca_topic_score_codex":0.00021412395,"about_ca_topic_score_gemma":0.00010987397,"teacher_disagreement_score":0.90454555,"about_ca_system_score_codex":0.00051572203,"about_ca_system_score_gemma":0.00046362728,"threshold_uncertainty_score":0.999508},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008782237,0.00032615813,0.99322695,0.00068388163,0.00044689886,0.0006213386,0.000012319729,0.00043146338,0.004163182],"genre_scores_gemma":[0.09510599,0.00056487153,0.89663917,0.003304716,0.0034588603,0.00012146398,0.00030594863,0.00016826019,0.00033069518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966143,0.00006546897,0.0004830479,0.0015446836,0.0008115831,0.00048093896],"domain_scores_gemma":[0.9980362,0.00017746765,0.0003734247,0.0007077924,0.0003223365,0.0003827901],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036562883,0.0004936998,0.0004204689,0.0006098298,0.00056279113,0.00064675504,0.0014695952,0.00026984382,0.00010506768],"category_scores_gemma":[0.000056470184,0.0005086695,0.00017603699,0.0006678724,0.00030961697,0.00083987514,0.00066303357,0.0009610114,0.0004279983],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069134826,0.0000260967,0.0000083511995,0.00002898904,0.000019204945,0.000059091177,0.0002845987,0.009876136,0.00037176508,0.00094296434,0.0000105541885,0.98836535],"study_design_scores_gemma":[0.00023840272,0.0001094735,0.00015359001,0.00033736043,0.00008733756,0.00005328813,3.8355475e-7,0.8815291,0.0007455038,0.11312575,0.0026656862,0.0009541133],"about_ca_topic_score_codex":0.00001914686,"about_ca_topic_score_gemma":0.000007632713,"teacher_disagreement_score":0.9874112,"about_ca_system_score_codex":0.00022699771,"about_ca_system_score_gemma":0.00051939976,"threshold_uncertainty_score":0.9997365},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001200217,0.00019731757,0.9937126,0.0016785596,0.0004924368,0.0015620089,0.000019888843,0.000200604,0.00201657],"genre_scores_gemma":[0.008496874,0.00012383444,0.986945,0.0021785009,0.001636299,0.00010577019,0.000075843614,0.000049979513,0.00038791363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980983,0.000005973988,0.00038815927,0.0008760901,0.00028116896,0.00035031393],"domain_scores_gemma":[0.9987731,0.00014156319,0.0002148666,0.0004831928,0.00024269076,0.00014459307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023726086,0.00029930606,0.00041912246,0.00015631491,0.00027562826,0.000093191156,0.00034809537,0.00030886618,0.000047370173],"category_scores_gemma":[0.00003783031,0.0002671243,0.00011561083,0.00035622873,0.0004725521,0.00011701938,0.00018386255,0.0005351804,0.000010113533],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001104749,0.000022165306,0.00015484865,0.000076109165,0.000008683867,0.000018171388,0.00008326068,0.031368382,0.0019781475,0.011091675,0.00040661116,0.95468146],"study_design_scores_gemma":[0.0011100624,0.00073796615,0.00026744948,0.0011873259,0.00004485492,0.00030218484,3.8512505e-7,0.2083209,0.006112824,0.6956191,0.08550235,0.0007946088],"about_ca_topic_score_codex":0.000003632824,"about_ca_topic_score_gemma":0.0000125975885,"teacher_disagreement_score":0.95388687,"about_ca_system_score_codex":0.0001920534,"about_ca_system_score_gemma":0.00023719184,"threshold_uncertainty_score":0.9999781},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014111146,0.00004975454,0.99695414,0.00062059576,0.0004118277,0.0006186862,0.000061506726,0.000097171294,0.0010452062],"genre_scores_gemma":[0.22024095,0.00006388222,0.7784161,0.00039436386,0.00033961897,0.000057966492,0.00038998606,0.00005206243,0.00004509396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985793,0.000005182749,0.0004000828,0.0005358174,0.0002657061,0.0002138899],"domain_scores_gemma":[0.9983247,0.00060094596,0.00007323693,0.00086812564,0.00006788451,0.00006510532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022913363,0.00020724509,0.00024602105,0.00023272782,0.00006896608,0.0001476976,0.0009219083,0.000120163706,0.000009666772],"category_scores_gemma":[0.00013830999,0.00021528648,0.000036689904,0.00033283228,0.00009882486,0.00016264048,0.00021753661,0.00034272732,0.0000069918024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.2956142e-7,0.000020615089,0.00012396641,0.000077310615,0.000008869538,0.0000021377741,0.00028800158,0.98222566,0.0007388216,0.0051431516,0.00034511663,0.011025903],"study_design_scores_gemma":[0.00016267301,0.000016332737,0.00076078443,0.00013032905,0.000011755649,0.000007801518,7.197667e-7,0.947252,0.00029854046,0.050672345,0.00044262107,0.00024413997],"about_ca_topic_score_codex":0.000012984279,"about_ca_topic_score_gemma":0.00007860827,"teacher_disagreement_score":0.22009984,"about_ca_system_score_codex":0.00015763503,"about_ca_system_score_gemma":0.00012884926,"threshold_uncertainty_score":0.87791276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004677276,0.000117541116,0.9705663,0.024705857,0.00010869216,0.00042248348,0.0000075278167,0.00014944134,0.0038754367],"genre_scores_gemma":[0.1349594,0.00016209178,0.85680985,0.006531337,0.00081796956,0.000019569134,0.000043181644,0.000034475313,0.00062212546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984487,0.000006175861,0.00025146824,0.0006567549,0.00043910262,0.00019775485],"domain_scores_gemma":[0.9990523,0.00008239216,0.00010615289,0.00044865656,0.00009172028,0.00021878915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020589137,0.0002082713,0.0002894349,0.00014918456,0.00008729913,0.00009024751,0.00026861674,0.00016867692,0.000036996888],"category_scores_gemma":[0.00004950615,0.00017212107,0.00004439401,0.00018437547,0.00071689213,0.00006150208,0.00017429005,0.0005833526,0.000011287357],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001735836,0.000041645984,0.0001937126,0.00016061445,0.000012158762,0.00011143339,0.00017291623,0.00009765362,0.0012650902,0.010004153,0.0013820155,0.9865413],"study_design_scores_gemma":[0.001313014,0.00095191726,0.001965633,0.0031320415,0.00023151137,0.002368605,7.340916e-7,0.6790489,0.0016178782,0.14767486,0.16019355,0.0015013717],"about_ca_topic_score_codex":0.000016584325,"about_ca_topic_score_gemma":0.000007350535,"teacher_disagreement_score":0.9850399,"about_ca_system_score_codex":0.00006321821,"about_ca_system_score_gemma":0.00019407803,"threshold_uncertainty_score":0.7018894},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030561036,0.00050411565,0.9939935,0.0007725785,0.00031202767,0.00047860216,0.000028709474,0.000044320113,0.00081002753],"genre_scores_gemma":[0.5929689,0.000025978543,0.40464845,0.00057418563,0.001158469,0.000011196161,0.00025682934,0.000044657474,0.00031134917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984156,0.00001024775,0.00040690906,0.0004969436,0.00043922788,0.0002310885],"domain_scores_gemma":[0.9990402,0.00020224968,0.0001847163,0.00021539172,0.0002530683,0.00010437824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003014095,0.00021307472,0.0004606206,0.00019785533,0.00010815846,0.000038303595,0.0002495913,0.0001832965,0.000032801818],"category_scores_gemma":[0.0001663273,0.00018385808,0.00013727118,0.0002313405,0.0005202228,0.00009902537,0.00014708043,0.00029436592,0.0000044727403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018240871,0.00061958516,0.004416488,0.0050621605,0.00043162805,0.001182286,0.010204316,0.16867036,0.018196287,0.22697307,0.0016007596,0.560819],"study_design_scores_gemma":[0.0039432007,0.0019393465,0.00025365147,0.0032816161,0.00024947658,0.0003342868,0.000004452672,0.89617795,0.03544947,0.02997287,0.02714928,0.0012444032],"about_ca_topic_score_codex":0.000004032165,"about_ca_topic_score_gemma":0.0000014561168,"teacher_disagreement_score":0.7275076,"about_ca_system_score_codex":0.000059873266,"about_ca_system_score_gemma":0.00040815902,"threshold_uncertainty_score":0.7497515},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021291686,0.000018610941,0.99246424,0.0011759498,0.00043794682,0.0003673306,0.00000489394,0.00037490393,0.0049431846],"genre_scores_gemma":[0.8330685,0.000017764052,0.16507947,0.0014461452,0.00023302133,0.000018659299,0.0000023131977,0.000020110281,0.000114025446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766314,0.000019118717,0.0002390586,0.0011848465,0.0005806716,0.0003131388],"domain_scores_gemma":[0.99836606,0.00019500988,0.00022168268,0.0009675221,0.000109674176,0.00014006205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023485739,0.00032610117,0.00029689976,0.0004008664,0.00029225447,0.00028536975,0.0017369854,0.00021371931,0.000024000805],"category_scores_gemma":[0.000040937164,0.00031385737,0.00010602822,0.0005103185,0.00029414537,0.0003758833,0.0007530586,0.00061975553,0.00013792665],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049114237,0.00003280672,0.000008035339,0.000011657356,0.0000047173958,0.0000225123,0.00014229966,0.0049575334,0.00030004824,0.11323149,0.000037110232,0.88124686],"study_design_scores_gemma":[0.00018487313,0.00055643514,0.00034356624,0.0001412132,0.000008657589,0.000021892563,6.745195e-8,0.6913843,0.01197968,0.29307368,0.0016009591,0.00070469],"about_ca_topic_score_codex":0.000019768147,"about_ca_topic_score_gemma":0.000016650683,"teacher_disagreement_score":0.8805422,"about_ca_system_score_codex":0.0002791844,"about_ca_system_score_gemma":0.00023512899,"threshold_uncertainty_score":0.99993134},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069326547,0.00013714822,0.99259204,0.0010842788,0.0014770734,0.00035936796,0.000010407969,0.000044441247,0.0036020055],"genre_scores_gemma":[0.93186164,0.000020434072,0.061874952,0.005506251,0.0005469991,0.000006547911,0.000011118662,0.000049463626,0.00012256754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559516,0.000088556866,0.00068936765,0.0019077606,0.00091508374,0.0008040676],"domain_scores_gemma":[0.99772567,0.00047011583,0.00034030832,0.0010188264,0.00024402962,0.00020105878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007685361,0.0006090868,0.00072898687,0.00090838317,0.00023937978,0.0005691928,0.0031027584,0.0003250132,0.000028164703],"category_scores_gemma":[0.00019995651,0.0006020465,0.00018289546,0.0010709136,0.0005208487,0.0014357356,0.0015833472,0.0014101625,0.00006029865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016941183,0.00031757526,0.0005148378,0.0002904096,0.000110431865,0.0026300189,0.020699985,0.29055074,0.056681965,0.12222912,0.00021812752,0.5055874],"study_design_scores_gemma":[0.00048380395,0.00025225643,0.00035768654,0.00073662086,0.000010309033,0.00009259322,0.000002256136,0.95573014,0.008691317,0.031560484,0.0010942816,0.0009882787],"about_ca_topic_score_codex":0.0001555002,"about_ca_topic_score_gemma":0.00011901307,"teacher_disagreement_score":0.9311684,"about_ca_system_score_codex":0.000663595,"about_ca_system_score_gemma":0.0008205664,"threshold_uncertainty_score":0.9996431},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006919891,0.00021843563,0.9942288,0.0008829042,0.0025971443,0.0007440833,0.00010227105,0.00038026363,0.00077691756],"genre_scores_gemma":[0.09885784,0.000019000108,0.8958131,0.0037737018,0.0009745658,0.00013528997,0.00006074037,0.000084917534,0.00028082365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596196,0.00010019746,0.0006421826,0.0016673768,0.0010217556,0.0006065356],"domain_scores_gemma":[0.9965308,0.0014627092,0.0006786666,0.00059132697,0.00053577125,0.00020076791],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014116829,0.00055583304,0.00058301416,0.0006952541,0.00039991408,0.000835385,0.0013055714,0.0004642488,0.000017778399],"category_scores_gemma":[0.000544672,0.00057854806,0.00026957906,0.00065025035,0.00013167576,0.0005888258,0.00028474643,0.0006761418,0.00004782994],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036742647,0.00002976472,0.000014088451,0.000079622834,0.000022399636,0.000007215577,0.00019783428,0.0025292109,0.0069557973,0.00016514225,0.00025046468,0.9897117],"study_design_scores_gemma":[0.0007906866,0.0004984046,0.00002189401,0.00018923289,0.00003203115,0.000021931939,2.9773145e-7,0.9100772,0.06452837,0.017623682,0.005488674,0.0007275885],"about_ca_topic_score_codex":0.000024988361,"about_ca_topic_score_gemma":0.00011119629,"teacher_disagreement_score":0.9889841,"about_ca_system_score_codex":0.0009062784,"about_ca_system_score_gemma":0.0003774659,"threshold_uncertainty_score":0.9996666},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094317994,0.00037306768,0.9958911,0.00037222222,0.0010007918,0.00083584717,0.0000032004962,0.000054099826,0.0005264894],"genre_scores_gemma":[0.749346,0.000008207972,0.25020036,0.00023320569,0.00017624363,0.00001868697,0.0000016267246,0.000013022744,0.000002593266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99589735,0.000099101206,0.0006126137,0.0012456415,0.0017757718,0.00036951608],"domain_scores_gemma":[0.9977446,0.000394236,0.00033129044,0.000774283,0.0006717293,0.00008381849],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0042173243,0.00031206044,0.00045946005,0.0006299003,0.000115329785,0.00018367768,0.0015307681,0.00026606378,0.0000035791766],"category_scores_gemma":[0.0006551286,0.00032340412,0.00012373846,0.0005684181,0.00019327278,0.00045876083,0.00043447877,0.0004892574,0.0000011645537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006660939,0.000013856395,0.000058854665,0.000043033917,0.0000071310274,0.0000031405948,0.0007459558,0.13595445,0.0006151099,0.0026601418,8.855147e-7,0.85989076],"study_design_scores_gemma":[0.00029142573,0.0000837528,0.00019851403,0.00020277302,0.000016235275,0.0000056090985,2.2091417e-7,0.74941343,0.0038296294,0.24568021,0.00004847541,0.00022969229],"about_ca_topic_score_codex":0.000048424306,"about_ca_topic_score_gemma":0.00061596686,"teacher_disagreement_score":0.8596611,"about_ca_system_score_codex":0.0004513298,"about_ca_system_score_gemma":0.00080125465,"threshold_uncertainty_score":0.9999218},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019805838,0.00018986472,0.9980667,0.00039913852,0.00033181306,0.0002278099,0.000009365043,0.00031744584,0.00025980355],"genre_scores_gemma":[0.1680392,0.00017388082,0.8300539,0.0011386924,0.00042371926,0.0000068678114,0.000012217202,0.00003659042,0.00011490563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974461,0.000044714525,0.00037230435,0.0011866587,0.00057372014,0.00037646116],"domain_scores_gemma":[0.99916095,0.00009834449,0.0000954727,0.00032501578,0.0001346892,0.00018553616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004345688,0.00037004103,0.0004179734,0.0006009355,0.0003357698,0.00048371902,0.00084641925,0.0002725573,0.000011676853],"category_scores_gemma":[0.00005466489,0.0003524508,0.00012650856,0.00050801097,0.0003951136,0.00056327455,0.00042801275,0.00083983433,0.000009486468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036489998,0.000018264149,0.00016677726,0.00004182112,0.000020472015,0.00003884713,0.0010868304,0.00623438,0.005736541,0.00083852955,0.0000014703672,0.9858124],"study_design_scores_gemma":[0.00018370296,0.00011687723,0.000053116695,0.00023156418,0.000022730055,0.000043013577,4.3534973e-7,0.9860656,0.0070039965,0.00469261,0.0011615643,0.00042473577],"about_ca_topic_score_codex":0.000020455547,"about_ca_topic_score_gemma":0.000026349044,"teacher_disagreement_score":0.9853877,"about_ca_system_score_codex":0.00014061702,"about_ca_system_score_gemma":0.0002096664,"threshold_uncertainty_score":0.9998928},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022157037,0.00037487558,0.99449205,0.00047167347,0.00062559184,0.00068262994,0.000012639972,0.00024245205,0.0008824006],"genre_scores_gemma":[0.7801415,0.000018357303,0.21890013,0.0006107557,0.0002481763,0.000015349713,0.000019282015,0.000039034298,0.000007451719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580765,0.000080000136,0.001071296,0.0014330266,0.00091955846,0.0006884685],"domain_scores_gemma":[0.99759305,0.00047017378,0.000588585,0.0007934389,0.0003597945,0.00019496509],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005545152,0.0006024156,0.0010619566,0.0011069776,0.00018221288,0.0004998727,0.00247287,0.00048684137,0.000023424152],"category_scores_gemma":[0.00010820021,0.00061950623,0.00020544004,0.0010166749,0.00083105924,0.0010253077,0.0011646096,0.0011578813,0.000008010181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026512429,0.00007078655,0.00089997554,0.000102341444,0.000017436118,0.000079692654,0.001578698,0.060954604,0.00018185173,0.0016223879,0.000005578988,0.93446016],"study_design_scores_gemma":[0.00028200084,0.00028902284,0.00012986347,0.0005326849,0.000013054098,0.000038936687,0.000002244924,0.9001858,0.0028740547,0.09503928,0.000020211493,0.0005927934],"about_ca_topic_score_codex":0.00009757241,"about_ca_topic_score_gemma":0.00054892316,"teacher_disagreement_score":0.93386734,"about_ca_system_score_codex":0.00037130364,"about_ca_system_score_gemma":0.00025131917,"threshold_uncertainty_score":0.9996256},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023286624,0.00020654456,0.9931958,0.00024426903,0.002045471,0.00042732936,0.0000033397102,0.0003855017,0.0011631006],"genre_scores_gemma":[0.63792753,0.000016793887,0.3594977,0.0011333534,0.0011114915,0.000008338743,0.000004447868,0.00005966691,0.00024067654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963656,0.000043948814,0.0004634671,0.0015827827,0.0009101045,0.0006340813],"domain_scores_gemma":[0.99816686,0.00018532337,0.00031117877,0.00092739606,0.00017742738,0.00023183743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049956876,0.0005288412,0.00047378519,0.00071510306,0.00039244583,0.0006490245,0.0018967974,0.00035918385,0.000018539838],"category_scores_gemma":[0.00012961762,0.0005224767,0.0001669964,0.0008824991,0.0002828151,0.0007469411,0.000823996,0.0009372702,0.00005014316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017948649,0.000016977481,0.0000080557875,0.000058939826,0.000022890881,0.00030283647,0.0036303091,0.056320824,0.022897506,0.0013053789,0.000003505429,0.9154148],"study_design_scores_gemma":[0.00023847152,0.0002010222,0.000036683632,0.00028999313,0.00001404497,0.00021261536,9.3503445e-7,0.951347,0.032731917,0.013888185,0.00036994138,0.00066920085],"about_ca_topic_score_codex":0.00008873832,"about_ca_topic_score_gemma":0.000110765526,"teacher_disagreement_score":0.9147456,"about_ca_system_score_codex":0.00045326777,"about_ca_system_score_gemma":0.00036893718,"threshold_uncertainty_score":0.99972266},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042118345,0.00024428885,0.9957717,0.0015098756,0.001060298,0.00019586316,0.0000016347636,0.00022279687,0.00057236117],"genre_scores_gemma":[0.819786,0.000013952249,0.17697091,0.0014497779,0.0017195771,0.0000066688444,0.0000026196226,0.000031714855,0.000018733397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714875,0.000027058994,0.00032755735,0.0013225717,0.00065868755,0.00051538297],"domain_scores_gemma":[0.99864036,0.00038920093,0.00018576292,0.0004850207,0.0001240085,0.00017564032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002974734,0.00037990452,0.000386284,0.00028691348,0.0004478851,0.00054535916,0.0014379948,0.00023007067,0.000003521268],"category_scores_gemma":[0.00006292993,0.00033287358,0.000055291053,0.00050656754,0.0004651437,0.0004591687,0.0009685087,0.0010765168,0.0000015772574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010184127,0.000011440455,0.0012414098,0.000030293933,0.000020379497,0.00013971931,0.0029769356,0.28128245,0.00001795252,0.020796834,0.0000114180275,0.693461],"study_design_scores_gemma":[0.00016397878,0.00008221712,0.00037693657,0.00007523348,0.000008926881,0.00010622319,2.0752451e-7,0.9786689,0.000015844449,0.020084886,0.00006985177,0.00034676972],"about_ca_topic_score_codex":0.000018016031,"about_ca_topic_score_gemma":0.00025110334,"teacher_disagreement_score":0.81936485,"about_ca_system_score_codex":0.000115891766,"about_ca_system_score_gemma":0.00022929296,"threshold_uncertainty_score":0.9999123},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009081333,0.00025697006,0.99165845,0.0013377457,0.0007066179,0.0007212316,0.000016862974,0.00018264628,0.0050286343],"genre_scores_gemma":[0.075327255,0.00008364997,0.92221445,0.0016615906,0.00036451852,0.000019332212,0.00001119107,0.00004393944,0.00027404813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959122,0.000042920525,0.0005349411,0.0019832067,0.00093291345,0.00059385016],"domain_scores_gemma":[0.9977193,0.0003876857,0.00032923504,0.0010470861,0.00024089534,0.00027583606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005624688,0.00062028586,0.0006281245,0.00068287423,0.00039885123,0.00079135684,0.002491221,0.00023734962,0.000017007906],"category_scores_gemma":[0.000071707575,0.00060775666,0.00011882354,0.00096438936,0.0010287673,0.0008903319,0.0022147184,0.0009239841,0.000021404738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001729426,0.000058262634,0.00010421651,0.00015888664,0.00004235454,0.000267247,0.0038660285,0.050586484,0.00033322646,0.28601822,0.00002539225,0.65852237],"study_design_scores_gemma":[0.00034383248,0.00014762404,0.00007825557,0.00014346892,0.000006556713,0.000029126502,3.8979462e-7,0.5944229,0.0011665625,0.40280294,0.00034525053,0.0005131056],"about_ca_topic_score_codex":0.00005220048,"about_ca_topic_score_gemma":0.0000730361,"teacher_disagreement_score":0.6580093,"about_ca_system_score_codex":0.00016843,"about_ca_system_score_gemma":0.0003537665,"threshold_uncertainty_score":0.99963737},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27271178,0.0005857136,0.15108119,0.037616324,0.030450158,0.011061432,0.00036985506,0.0006441345,0.4954794],"genre_scores_gemma":[0.99724567,0.000008144898,0.0003813685,0.0015924308,0.00057290297,0.0000013036256,0.0000014194796,0.000011726285,0.00018504115],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792105,0.00007811753,0.00032462657,0.00034050006,0.00092507957,0.00041062845],"domain_scores_gemma":[0.99873155,0.00035812482,0.00022907907,0.00026176203,0.00016909902,0.0002503706],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007389996,0.00019601051,0.00025388208,0.0004349761,0.0015227159,0.00024017705,0.00080391933,0.00019849595,0.000055402255],"category_scores_gemma":[0.0005430174,0.00015526,0.000079597936,0.00075594947,0.00055097305,0.00022550984,0.00013156423,0.00065294246,0.000015612755],"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.0000070687847,0.000051173294,0.00011614206,0.000015537265,0.000025295942,0.00028707733,0.60682786,0.0045111473,0.000010289277,0.010729313,0.0009556532,0.37646347],"study_design_scores_gemma":[0.02194172,0.0076261596,0.047257487,0.010974669,0.0015684305,0.0055647017,0.048029006,0.22022338,0.0017029052,0.35556996,0.25285032,0.026691258],"about_ca_topic_score_codex":0.063059166,"about_ca_topic_score_gemma":0.60772115,"teacher_disagreement_score":0.72453386,"about_ca_system_score_codex":0.0005198821,"about_ca_system_score_gemma":0.0022059903,"threshold_uncertainty_score":0.99977714},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010638136,0.00059217727,0.9869698,0.00023713139,0.0014471615,0.00045767668,0.00014980443,0.00057548616,0.008506943],"genre_scores_gemma":[0.69842654,0.0005632048,0.29388422,0.003949136,0.0023201876,0.000023460676,0.00036903986,0.00035095628,0.00011323414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781495,0.000013295139,0.0003945734,0.0008055321,0.00049411325,0.00047756013],"domain_scores_gemma":[0.9987072,0.00034020242,0.00008594896,0.0005170437,0.00012907865,0.00022057963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012935128,0.00051811425,0.00048912043,0.0004190323,0.00008932881,0.000155843,0.0006098331,0.00028271263,0.00007807185],"category_scores_gemma":[0.00003147136,0.0005446484,0.00009278304,0.0003408061,0.00041276906,0.00028397993,0.00028318368,0.0010789305,0.00026194696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027573256,0.000015992053,0.000009982807,0.0004854574,0.0000766418,0.0010859472,0.0007386805,0.26812288,0.0082729105,0.0010427267,0.00014055519,0.71998066],"study_design_scores_gemma":[0.0005266928,0.000087548295,0.0000230509,0.0008030927,0.00003119974,0.00031121715,5.724277e-7,0.9762032,0.00472752,0.009572682,0.006681567,0.0010316641],"about_ca_topic_score_codex":0.000007907447,"about_ca_topic_score_gemma":0.000032239328,"teacher_disagreement_score":0.718949,"about_ca_system_score_codex":0.00019381373,"about_ca_system_score_gemma":0.00013426408,"threshold_uncertainty_score":0.9997005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012361179,0.00021820265,0.9848075,0.006741336,0.0007946755,0.00033746214,0.000004895051,0.00024860556,0.0068349554],"genre_scores_gemma":[0.289434,0.000046947378,0.69126254,0.016894748,0.0014173648,0.00003706991,0.000014040012,0.00007553289,0.00081779365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670446,0.000021285889,0.00041553983,0.0015760552,0.0007529756,0.0005297132],"domain_scores_gemma":[0.99772394,0.00035375686,0.00021758945,0.0013303019,0.00013271125,0.00024172875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025641738,0.00046129964,0.0004169911,0.00032797497,0.00026859023,0.0005740754,0.0034628,0.0002426261,0.00002883464],"category_scores_gemma":[0.000022800838,0.00041306735,0.00015243966,0.00067209784,0.00032225664,0.00030708374,0.00089836493,0.0007468042,0.00014222725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041165854,0.000028768802,0.000019969326,0.00003258778,0.000007968933,0.00013971978,0.00010171488,0.03341821,0.0004376066,0.244095,0.0004887997,0.72122556],"study_design_scores_gemma":[0.0001603687,0.00009583664,0.000047438833,0.0001482248,0.0000060040306,0.000021654725,2.4323208e-8,0.8368003,0.0012252238,0.14480884,0.016140971,0.0005451398],"about_ca_topic_score_codex":0.000007137112,"about_ca_topic_score_gemma":0.00003227546,"teacher_disagreement_score":0.80338204,"about_ca_system_score_codex":0.00013169232,"about_ca_system_score_gemma":0.0004303025,"threshold_uncertainty_score":0.9998321},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002250831,0.000056229957,0.9949135,0.0018608882,0.00014565344,0.00040649498,0.000011398288,0.000055251472,0.00029973613],"genre_scores_gemma":[0.97242504,0.000022526974,0.026526017,0.0008128625,0.00016469779,0.00000899743,0.0000073749634,0.0000148852905,0.00001762266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976838,0.000042881155,0.0003747634,0.00094760465,0.0006510333,0.00029987752],"domain_scores_gemma":[0.9983051,0.0002511577,0.0003129284,0.0007846766,0.00021470143,0.00013145835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005332075,0.00031886878,0.00036477295,0.00018317287,0.00023303425,0.0003300832,0.0013493614,0.0001374566,0.000005940903],"category_scores_gemma":[0.000068838104,0.0002051023,0.000058749203,0.00036259892,0.00086941064,0.00037872617,0.00096152106,0.00041718502,0.000003423136],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020706819,0.00002739184,0.00017216448,0.00006210639,0.000013262012,0.000005375571,0.0013457156,0.001646088,0.0021929585,0.0023635107,0.000009981214,0.9921407],"study_design_scores_gemma":[0.0004219536,0.00088700576,0.0077312016,0.0004501876,0.000025375271,0.000050264876,0.0000027904807,0.97517633,0.0027611481,0.011611894,0.0003178246,0.0005640209],"about_ca_topic_score_codex":0.00052387465,"about_ca_topic_score_gemma":0.00028677983,"teacher_disagreement_score":0.99157673,"about_ca_system_score_codex":0.00011753698,"about_ca_system_score_gemma":0.00036356697,"threshold_uncertainty_score":0.8363829},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005067933,0.0007132948,0.9919631,0.00010122331,0.0011059507,0.00025486224,0.000035319255,0.00029034013,0.00046797676],"genre_scores_gemma":[0.99218017,0.0002519665,0.00620136,0.0004943622,0.00069699757,0.0000089034675,0.00008912383,0.000063580446,0.00001354811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985462,0.0000144694395,0.0002767849,0.00056261546,0.00028417545,0.0003157608],"domain_scores_gemma":[0.9993763,0.00018959679,0.000074420976,0.00014645413,0.00007772963,0.00013547554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015470372,0.0003257151,0.00026269106,0.00021937763,0.00011007537,0.0001410486,0.00017131095,0.00033716025,0.000023574545],"category_scores_gemma":[0.000022856071,0.00036145115,0.00004628352,0.00019654843,0.00022475874,0.0002765699,0.00009254917,0.0008194353,0.000028681476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015473664,0.0000036202212,0.0000056247986,0.00004488248,0.000014277502,0.000021896609,0.00008435092,0.15155035,0.0017544691,0.000011575567,0.000023713379,0.84646976],"study_design_scores_gemma":[0.00021534928,0.00006769903,0.000056432033,0.00012353486,0.000015338997,0.00012298029,9.383246e-8,0.99123937,0.0012263994,0.0063094823,0.00023340918,0.0003899417],"about_ca_topic_score_codex":0.000007319866,"about_ca_topic_score_gemma":0.00003487129,"teacher_disagreement_score":0.9871122,"about_ca_system_score_codex":0.00016410855,"about_ca_system_score_gemma":0.000021909618,"threshold_uncertainty_score":0.9998838},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009490527,0.00016734813,0.99364316,0.0024525558,0.0010997669,0.00039696696,0.00000988437,0.00009496586,0.0011863055],"genre_scores_gemma":[0.7983616,0.000009975006,0.2001729,0.0013050707,0.00010289435,0.000010429564,0.0000037897921,0.000016164317,0.000017147295],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963745,0.00010559922,0.00069647026,0.0015819917,0.0008474962,0.000393925],"domain_scores_gemma":[0.99774224,0.0009947477,0.00022828022,0.00075583236,0.00016707076,0.000111854526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007190743,0.00039052413,0.0007014906,0.00060882425,0.00008167653,0.00006518868,0.0020589707,0.0003952009,0.000032102656],"category_scores_gemma":[0.00015561597,0.00037263156,0.00009610326,0.0007030453,0.00094387325,0.00024047382,0.00044360934,0.0010142893,0.00002236379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040893705,0.00009092008,0.0001084244,0.00007389696,0.0000068298327,0.00024098062,0.0008975838,0.27204874,0.00041093724,0.115228176,0.000012391306,0.61084026],"study_design_scores_gemma":[0.00044113275,0.000995444,0.0010131451,0.00015433105,0.000003641996,0.00007300381,8.3569276e-8,0.298017,0.002004425,0.696625,0.00022894598,0.00044385841],"about_ca_topic_score_codex":0.000017040742,"about_ca_topic_score_gemma":0.00008644852,"teacher_disagreement_score":0.7974126,"about_ca_system_score_codex":0.000575494,"about_ca_system_score_gemma":0.0005014647,"threshold_uncertainty_score":0.99987257},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000087273744,0.00013827777,0.9944377,0.0016721794,0.0021747013,0.00092300295,0.000011377405,0.00034411458,0.00021139756],"genre_scores_gemma":[0.44726676,0.000030831172,0.5499769,0.0015873912,0.00093725865,0.00007053092,0.000018318158,0.00008315104,0.00002884939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954935,0.000078580226,0.0006254493,0.0022938969,0.00081752025,0.00069109764],"domain_scores_gemma":[0.99757874,0.000329003,0.00032911063,0.0012592737,0.0002602597,0.00024359842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076287694,0.0006552094,0.00059190404,0.0012761491,0.0002633226,0.00053897314,0.0030483129,0.0005469137,0.000008359987],"category_scores_gemma":[0.000062948435,0.00061843265,0.000158412,0.001351573,0.00038584604,0.0007472913,0.0005543338,0.0013919255,0.000014802716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005318385,0.000021886684,0.000017279714,0.000038507143,0.0000051428615,0.000024294766,0.0005774755,0.10275959,0.0014774373,0.00095354026,0.0000044911926,0.89406717],"study_design_scores_gemma":[0.00046729154,0.0005781074,0.00016689167,0.00029303122,0.0000073919055,0.00018676075,5.767749e-7,0.90335095,0.00647638,0.08580309,0.0019594932,0.0007100368],"about_ca_topic_score_codex":0.00008631692,"about_ca_topic_score_gemma":0.001854637,"teacher_disagreement_score":0.89335716,"about_ca_system_score_codex":0.0009654811,"about_ca_system_score_gemma":0.0005149113,"threshold_uncertainty_score":0.9996267},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004489886,0.00025141845,0.98031944,0.0006746617,0.0036424475,0.0005725437,0.000015300706,0.00020231806,0.013872859],"genre_scores_gemma":[0.94712293,0.0000040262944,0.048263874,0.0018012383,0.001835112,0.000063340885,0.0000086333,0.000054074102,0.00084674853],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971932,0.000027976563,0.00040656523,0.0014285166,0.0003747625,0.0005689451],"domain_scores_gemma":[0.99752843,0.0013847192,0.00022458537,0.00058441417,0.000117295676,0.00016052536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005531702,0.0004171977,0.00045544875,0.0002770636,0.00041563655,0.0003424532,0.0008308487,0.00035692911,0.00007449839],"category_scores_gemma":[0.0003643804,0.00035862997,0.0001531323,0.00030672966,0.0006126076,0.00008399322,0.00021471462,0.00081079436,0.00009989215],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035249963,0.00007240666,0.00027617134,0.000043764918,0.000025830848,0.00006500847,0.0008395184,0.00096917053,0.0027049398,0.0012685115,0.00008315742,0.9936163],"study_design_scores_gemma":[0.006117247,0.011111441,0.012768321,0.0027428798,0.00025011066,0.0006675315,0.000008529324,0.16662367,0.023477899,0.7047755,0.06535858,0.006098267],"about_ca_topic_score_codex":0.00002027756,"about_ca_topic_score_gemma":0.000027561151,"teacher_disagreement_score":0.987518,"about_ca_system_score_codex":0.00016333022,"about_ca_system_score_gemma":0.00013140668,"threshold_uncertainty_score":0.9998866},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017341021,0.00010123519,0.9914794,0.001765624,0.0010320455,0.00045395806,0.000012521612,0.00010108962,0.0048807175],"genre_scores_gemma":[0.8165044,0.000010714757,0.17185336,0.010352967,0.0007464219,0.000029735733,0.000035786605,0.000090998954,0.00037557725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957873,0.000052475916,0.00042247568,0.0019142637,0.001104225,0.00071924814],"domain_scores_gemma":[0.99767303,0.0003194134,0.00032117378,0.00088211615,0.00055616983,0.00024807782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027618968,0.00070470234,0.0006465533,0.00070564565,0.00034197175,0.00053163554,0.0023268266,0.0002608919,0.000032246495],"category_scores_gemma":[0.000058411875,0.00059327495,0.00018528642,0.0009988224,0.00054821756,0.00082777324,0.00049235293,0.0011820145,0.00011808633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088477484,0.00048366273,0.0027055615,0.0005849236,0.00047441322,0.0021230713,0.0067074946,0.47371915,0.038510658,0.1151465,0.0018301156,0.35682967],"study_design_scores_gemma":[0.00083515246,0.0013381694,0.00070514623,0.00072071335,0.000035634446,0.00013440792,7.2612465e-7,0.9567281,0.027328344,0.0059679225,0.0048150974,0.001390609],"about_ca_topic_score_codex":0.00008885968,"about_ca_topic_score_gemma":0.00022351646,"teacher_disagreement_score":0.81962603,"about_ca_system_score_codex":0.0005610266,"about_ca_system_score_gemma":0.0010392696,"threshold_uncertainty_score":0.99965185},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029570106,0.00014567231,0.994622,0.0015869794,0.00062834425,0.00038480904,0.000021297,0.000018751674,0.0022964252],"genre_scores_gemma":[0.8628616,0.00013017934,0.13207175,0.0043118284,0.0003363627,0.000015393054,0.000028157778,0.00004080803,0.00020394038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678266,0.00010763972,0.0006532121,0.0013140925,0.000678559,0.00046386497],"domain_scores_gemma":[0.9978662,0.0007633937,0.0004002219,0.0006234097,0.00020929036,0.00013744785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006885198,0.00042387846,0.0005810382,0.0006660823,0.0001001354,0.00020332905,0.0014633524,0.00020018009,0.00004105851],"category_scores_gemma":[0.000107364765,0.0003710061,0.00010518568,0.0005914409,0.0003385511,0.0007461988,0.0011997281,0.0006618275,0.000015359588],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035928217,0.000053607724,0.0006150933,0.000082018145,0.00003483139,0.00009536295,0.0056202295,0.0023840945,0.011050419,0.041172806,0.00014936307,0.9387062],"study_design_scores_gemma":[0.0038020192,0.0025894733,0.015531769,0.001853591,0.00008216189,0.0002758686,0.000082413506,0.6119287,0.18261954,0.17253317,0.005639649,0.0030616121],"about_ca_topic_score_codex":0.00016885133,"about_ca_topic_score_gemma":0.00013679302,"teacher_disagreement_score":0.9356446,"about_ca_system_score_codex":0.00021060935,"about_ca_system_score_gemma":0.00042483382,"threshold_uncertainty_score":0.9998742},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094537507,0.00031150604,0.9962672,0.000093217604,0.0006675563,0.00040648403,0.000015782942,0.00031777687,0.0009751228],"genre_scores_gemma":[0.68755937,0.000029517416,0.31162065,0.00045232783,0.00026352756,0.0000060465222,0.000010990008,0.000037237092,0.000020342475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962296,0.00009091727,0.0007089784,0.0014632189,0.0010475422,0.0004597583],"domain_scores_gemma":[0.99822026,0.00031548442,0.00027567195,0.0007055107,0.00029888962,0.00018416718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043204005,0.00050618296,0.00067679025,0.00065266405,0.00021722261,0.00035052918,0.0020801981,0.00039542376,0.00005869888],"category_scores_gemma":[0.0000731506,0.00051407906,0.00019918765,0.0006210131,0.0005369391,0.0008021928,0.0006788609,0.0010381109,0.000014222939],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012006725,0.000020859874,0.000039993185,0.00004688716,0.000041172058,0.000058546902,0.0022037793,0.008361666,0.014765847,0.0013539835,0.000002741052,0.9730925],"study_design_scores_gemma":[0.00055599125,0.00033878032,0.000054914366,0.00058613345,0.000037096255,0.000042935117,9.966601e-7,0.52606404,0.33829775,0.1325942,0.0004944695,0.0009326936],"about_ca_topic_score_codex":0.00012032818,"about_ca_topic_score_gemma":0.000027678412,"teacher_disagreement_score":0.9721598,"about_ca_system_score_codex":0.0002506758,"about_ca_system_score_gemma":0.00034664193,"threshold_uncertainty_score":0.99973106},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.020314e-7,0.0003995002,0.9895306,0.0058309,0.00037329266,0.00095123914,0.000015236303,0.0008341254,0.0020647089],"genre_scores_gemma":[0.0015033168,0.000026511452,0.9951922,0.0023839683,0.0005827705,0.0001432297,0.000017374388,0.00005329494,0.00009729481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956309,0.000023948432,0.0006035371,0.001886039,0.001199578,0.0006560039],"domain_scores_gemma":[0.9970395,0.00053778023,0.00028286263,0.0012973024,0.00053231,0.00031021898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071789423,0.00051359634,0.0005101619,0.00048532127,0.0003756152,0.00071351876,0.004773598,0.0003657652,0.00001660866],"category_scores_gemma":[0.0005097062,0.0005059547,0.00015697573,0.00067213434,0.001283892,0.0013001916,0.0017941407,0.0008162782,0.000042459484],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072897137,0.000065552,0.0000013026723,0.00013850213,0.000007033132,0.000046109122,0.00022475007,0.00012687888,0.010083543,0.03488712,0.00027668173,0.95413524],"study_design_scores_gemma":[0.0001962078,0.00016556603,0.0000016793573,0.00023658524,0.000007101293,0.00006169059,8.4548766e-8,0.5508388,0.009705001,0.42543054,0.012811235,0.0005454651],"about_ca_topic_score_codex":0.0000040448044,"about_ca_topic_score_gemma":0.000012378678,"teacher_disagreement_score":0.9535898,"about_ca_system_score_codex":0.00037597472,"about_ca_system_score_gemma":0.000833901,"threshold_uncertainty_score":0.9997392},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014426449,0.00046424285,0.99442166,0.00015877423,0.00056618906,0.00022113131,0.000016942058,0.000319477,0.0023889407],"genre_scores_gemma":[0.80916625,0.000012217179,0.18837051,0.0018388896,0.00029795518,0.0000035396388,0.000037394057,0.00006900976,0.00020423223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949144,0.00011084981,0.00054418854,0.0022176746,0.0014406706,0.00077222567],"domain_scores_gemma":[0.9971182,0.000541619,0.00034928485,0.0013047536,0.00028419163,0.00040199864],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006719301,0.0006940272,0.0008479278,0.0013464867,0.00032821635,0.0019457958,0.003591216,0.00019444883,0.000023796521],"category_scores_gemma":[0.00040462968,0.00068374386,0.00039505627,0.0026435032,0.00058805535,0.0008898669,0.0016386253,0.0009697345,0.00004383181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015531283,0.00012510362,0.005004498,0.000033493594,0.00033042787,0.00047227726,0.00068387523,0.7370491,0.00005877009,0.003343892,0.0000065311942,0.25287652],"study_design_scores_gemma":[0.00026274807,0.00026017608,0.003209328,0.00014325486,0.0001676694,0.00002062334,1.5674325e-7,0.98680824,0.00021135822,0.007936095,0.00011691958,0.0008634481],"about_ca_topic_score_codex":0.00011181649,"about_ca_topic_score_gemma":0.00015487705,"teacher_disagreement_score":0.80772364,"about_ca_system_score_codex":0.00023711924,"about_ca_system_score_gemma":0.0004707578,"threshold_uncertainty_score":0.99956137},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001919279,0.000323343,0.9920448,0.00055727415,0.0028146054,0.0004188348,0.000021628657,0.00041484894,0.003212712],"genre_scores_gemma":[0.7641709,0.00002677448,0.23195101,0.0016952431,0.0018509377,0.000026858277,0.00002562296,0.00005965584,0.00019300566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957682,0.000071564435,0.0006493708,0.0017517862,0.0012394817,0.0005195893],"domain_scores_gemma":[0.99763715,0.000448048,0.0004269409,0.0010130213,0.0002179769,0.00025683237],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047789232,0.0005338562,0.0005941125,0.0005295864,0.0002886442,0.0011124908,0.0026089416,0.00036513203,0.000031440337],"category_scores_gemma":[0.00010413382,0.00049635133,0.00014369398,0.000609576,0.00022513229,0.000846119,0.0011646919,0.0008306722,0.00023837633],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031449908,0.000013447717,0.00008243146,0.00004095767,0.000023246354,0.000094366434,0.0008428504,0.0018333949,0.00067744596,0.00056828395,0.000009901556,0.9958105],"study_design_scores_gemma":[0.00092903024,0.00028790595,0.0006307038,0.002230069,0.000029914303,0.00009689174,8.857833e-7,0.8445801,0.024248956,0.12266033,0.0025816287,0.0017235428],"about_ca_topic_score_codex":0.0000886829,"about_ca_topic_score_gemma":0.00019271609,"teacher_disagreement_score":0.994087,"about_ca_system_score_codex":0.00028231886,"about_ca_system_score_gemma":0.00027345217,"threshold_uncertainty_score":0.9999244},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009825156,0.00040600647,0.87809634,0.05719676,0.0012109298,0.0012383313,0.000036034202,0.00017646402,0.05181396],"genre_scores_gemma":[0.9931703,0.000021710654,0.002382645,0.0033355854,0.0009501817,0.0000019039442,0.0000045371253,0.000009759855,0.00012334046],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971429,0.00017655538,0.000416511,0.0007152775,0.0012398819,0.00030888533],"domain_scores_gemma":[0.99780077,0.0011237264,0.0003081936,0.0004068402,0.00030369224,0.00005678209],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012817048,0.00023077107,0.0003819277,0.00013039356,0.001113586,0.00014126176,0.0010046957,0.00023478494,0.00008442807],"category_scores_gemma":[0.00035397924,0.00017727437,0.00020779797,0.0005445646,0.004644255,0.00018140893,0.00014323056,0.0006004669,0.000014862482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000759568,0.00015701578,0.00033149595,0.00014743985,0.00010852769,0.00002368905,0.17118889,0.066370904,0.00010937737,0.27712843,0.00032599596,0.48403227],"study_design_scores_gemma":[0.00036831558,0.00031818388,0.0030467703,0.0005789554,0.000122708,0.0000025951636,0.00016244703,0.031304713,0.00042268154,0.91353506,0.048912212,0.001225358],"about_ca_topic_score_codex":0.0019904647,"about_ca_topic_score_gemma":0.0072377487,"teacher_disagreement_score":0.98334515,"about_ca_system_score_codex":0.00025926737,"about_ca_system_score_gemma":0.0009985801,"threshold_uncertainty_score":0.9980645},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072206196,0.0001390508,0.98759216,0.0014437642,0.0002534204,0.000267979,0.000012971087,0.000072227165,0.009496338],"genre_scores_gemma":[0.97937214,0.000007096164,0.018753208,0.00084000756,0.0007632893,0.0000061403034,0.000020533342,0.000027239046,0.00021031892],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982286,0.000015276142,0.00021454137,0.0008141671,0.00032235924,0.00040505597],"domain_scores_gemma":[0.9991346,0.00008625992,0.00012411144,0.0003440577,0.00007317534,0.0002377709],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018476842,0.00033241915,0.00037079974,0.00040355616,0.0003442885,0.00048720028,0.0004903352,0.000113032176,0.0001281688],"category_scores_gemma":[0.000004304188,0.00032749557,0.00009872424,0.00025663737,0.00021877626,0.00015365238,0.00025007734,0.00059466675,0.000009703908],"study_design_candidate":"design_other","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.000005468904,0.000007161868,0.006807528,0.000010584084,0.000041188967,0.000017542636,0.00028531335,0.0012724574,0.00006691206,0.016739035,0.000248541,0.9744983],"study_design_scores_gemma":[0.0005276462,0.00030925334,0.003775268,0.00060295366,0.00010364076,0.00003158766,0.0000017750252,0.3000664,0.0047846125,0.6570537,0.030234993,0.0025081811],"about_ca_topic_score_codex":0.015794378,"about_ca_topic_score_gemma":0.032521006,"teacher_disagreement_score":0.9786501,"about_ca_system_score_codex":0.00023604662,"about_ca_system_score_gemma":0.0003857738,"threshold_uncertainty_score":0.9999177},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037143828,0.00034384956,0.98822033,0.0005630789,0.00061879697,0.00037866144,0.000008540771,0.00024384134,0.00925144],"genre_scores_gemma":[0.87492377,0.000010381115,0.12363988,0.00092727167,0.00039779465,0.00001283168,0.0000049828045,0.000037616705,0.00004549773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99517506,0.0000410488,0.0009642833,0.0020202606,0.0009941272,0.0008052099],"domain_scores_gemma":[0.99743956,0.0005128456,0.0004965243,0.0011141489,0.00014207636,0.0002948212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008350172,0.0006132285,0.00095070136,0.0007451922,0.0002919458,0.00075076276,0.0030635162,0.00023006306,0.000007724021],"category_scores_gemma":[0.00016521527,0.0005881518,0.0001906904,0.0010276258,0.0003940519,0.0005170558,0.0016190894,0.0011069408,0.000057243844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025905556,0.0000419601,0.0009434106,0.00034895702,0.00004243113,0.0005099753,0.0011376382,0.14529367,0.00032912046,0.10476054,0.000023082783,0.7465433],"study_design_scores_gemma":[0.00040224442,0.000058756643,0.00041915252,0.0006379627,0.0000065925606,0.000048480695,0.0000024690376,0.9881146,0.00030157747,0.00882044,0.0004697551,0.00071796245],"about_ca_topic_score_codex":0.00004683454,"about_ca_topic_score_gemma":0.000117441086,"teacher_disagreement_score":0.8745523,"about_ca_system_score_codex":0.0004306278,"about_ca_system_score_gemma":0.00050093094,"threshold_uncertainty_score":0.999657},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049998154,0.00013905573,0.99463457,0.0027131934,0.0003723245,0.0005300965,0.000001935703,0.00024042565,0.001318417],"genre_scores_gemma":[0.13869585,0.000033562355,0.8579311,0.0026995696,0.0003662048,0.000023153225,0.000009724302,0.000041940137,0.00019889514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969022,0.000020427256,0.00034001935,0.0014887803,0.000825689,0.00042285095],"domain_scores_gemma":[0.9982479,0.00019089604,0.00024464718,0.0010015212,0.00014088937,0.00017410383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016415362,0.0004215299,0.0003492103,0.00026421464,0.00026511797,0.00039427908,0.0020830669,0.00013437179,0.000012628242],"category_scores_gemma":[0.000013568911,0.00035266715,0.00006315371,0.0007911697,0.0004419907,0.00077398226,0.00076924317,0.000589872,0.00005101356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011978179,0.000023075858,0.00003945731,0.000032542226,0.000009131887,0.000095045114,0.0005434451,0.17650555,0.0010045763,0.030738136,0.000038803213,0.7909582],"study_design_scores_gemma":[0.0003178184,0.00041798936,0.00011663442,0.00024697953,0.000008936184,0.00009753038,1.5945984e-7,0.8877329,0.0017643684,0.10724754,0.0013702771,0.0006788588],"about_ca_topic_score_codex":0.00000360577,"about_ca_topic_score_gemma":0.000036227357,"teacher_disagreement_score":0.7902794,"about_ca_system_score_codex":0.00024742846,"about_ca_system_score_gemma":0.00023898175,"threshold_uncertainty_score":0.99989253},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007401451,0.00031131675,0.9946943,0.00013231735,0.00074966176,0.0001444195,0.0000057757456,0.000178772,0.0037094136],"genre_scores_gemma":[0.6876389,0.00011532387,0.31073824,0.0004412469,0.0007891208,0.000005847606,0.000020931437,0.000094159,0.0001562462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866164,0.0000045204915,0.00021132703,0.00049628405,0.00036394058,0.00026229655],"domain_scores_gemma":[0.9994169,0.00006166699,0.000049904218,0.0003239479,0.000048134156,0.00009944586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008515158,0.00030290236,0.00029455603,0.00016575618,0.00007641111,0.00011931696,0.0004457314,0.00013857293,0.000034326134],"category_scores_gemma":[0.000009767948,0.00024690724,0.000036709644,0.00017026911,0.00033270795,0.00010488778,0.000050687213,0.00048030412,0.000029452389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066483635,0.0000024423848,0.00007611281,0.000086328066,0.000014916448,0.000114105336,0.00028002376,0.7782277,0.0002493867,0.0060255583,0.000017718707,0.21489906],"study_design_scores_gemma":[0.00024500804,0.00027488844,0.00016609166,0.0009439974,0.000031538257,0.00035174462,0.0000012271047,0.9368784,0.009358685,0.04394503,0.006301289,0.0015021454],"about_ca_topic_score_codex":0.000008910584,"about_ca_topic_score_gemma":0.00008282553,"teacher_disagreement_score":0.6875649,"about_ca_system_score_codex":0.00011035838,"about_ca_system_score_gemma":0.000069054186,"threshold_uncertainty_score":0.99999833},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001509001,0.0026687405,0.98945206,0.00029132832,0.00053972536,0.00025994433,0.00003398549,0.000025035612,0.0052201664],"genre_scores_gemma":[0.97143143,0.00040304556,0.022889731,0.0011961352,0.00044373417,0.000024851422,0.00009168235,0.00006658221,0.0034527893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711436,0.000007018095,0.00084596407,0.0012775448,0.00013998004,0.00061510765],"domain_scores_gemma":[0.99856293,0.00019761815,0.00048344955,0.00055589684,0.00010080914,0.000099279256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009663883,0.00039497323,0.001056224,0.0018945724,0.00016753541,0.00034492312,0.00073541736,0.00031256312,0.0005391686],"category_scores_gemma":[0.00009020094,0.00042643014,0.00042201421,0.0010037884,0.0002186629,0.00017938807,0.0002873297,0.0008220334,0.000024553932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014305545,0.000031864594,0.017213896,0.00007324757,0.00015383525,0.000029816865,0.0009747808,0.9034706,0.0000042519937,0.015010746,0.0000088478855,0.063013844],"study_design_scores_gemma":[0.00027417787,0.00007403554,0.0022292198,0.0001255599,0.000040332023,0.00000562878,8.384036e-7,0.9349208,0.000025489611,0.04393514,0.017777419,0.0005913444],"about_ca_topic_score_codex":0.00011389444,"about_ca_topic_score_gemma":0.0013201772,"teacher_disagreement_score":0.9699224,"about_ca_system_score_codex":0.0002909801,"about_ca_system_score_gemma":0.00011977256,"threshold_uncertainty_score":0.99981874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17205805,0.0004805104,0.8235768,0.0018178269,0.0014542753,0.00025756433,0.000006680967,0.00011310479,0.00023520242],"genre_scores_gemma":[0.94823456,0.000020974121,0.0501496,0.00092884095,0.00061333884,0.000023051969,0.000014716229,0.0000121566545,0.0000027867407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956257,0.00031345952,0.00042186136,0.0014002215,0.0013738552,0.00086495565],"domain_scores_gemma":[0.9976992,0.0005487873,0.0002610316,0.00090528413,0.0003592042,0.00022646373],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019172597,0.00033268475,0.0006421987,0.0009408985,0.0007866085,0.0018227528,0.0022022105,0.0003422561,0.00015969931],"category_scores_gemma":[0.0004793774,0.00032058984,0.00031400443,0.0048005865,0.0010082091,0.00036094084,0.0011309504,0.00093420263,0.000005344897],"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.000005245721,0.000092016555,0.031485282,0.000043978976,0.000091043956,0.00009060821,0.008473433,0.78174347,0.000036388254,0.0001694488,0.0000029642445,0.17776611],"study_design_scores_gemma":[0.0005198418,0.00003591712,0.037641764,0.0003169302,0.00030126452,0.0000012155655,0.00006199674,0.9471079,0.0015893097,0.011041361,0.00020985647,0.0011726345],"about_ca_topic_score_codex":0.005721494,"about_ca_topic_score_gemma":0.027531916,"teacher_disagreement_score":0.7761765,"about_ca_system_score_codex":0.0003985812,"about_ca_system_score_gemma":0.0022138194,"threshold_uncertainty_score":0.9999246},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02556954,0.000045339646,0.97042364,0.0014809062,0.0018325347,0.0001911808,0.0000018545214,0.00031078263,0.00014423995],"genre_scores_gemma":[0.8612962,3.8312726e-7,0.13546354,0.0029153835,0.0003018356,0.000008346597,0.000002817751,0.000010180542,0.0000013359335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654007,0.00019750536,0.00041526608,0.0011556129,0.0008219708,0.0008696012],"domain_scores_gemma":[0.99753314,0.000618638,0.00015618169,0.0013141871,0.00015438565,0.00022348147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013538741,0.00031471928,0.00033861963,0.00038773016,0.0002875296,0.0007788233,0.0033573527,0.00011167051,0.0000046455757],"category_scores_gemma":[0.00018134867,0.00027260464,0.0000925834,0.0021382647,0.00023767621,0.00045215987,0.00053189765,0.00033291758,0.000079519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027648066,0.000076408454,0.006337628,0.000026543104,0.0000033289296,0.000022762386,0.00049295346,0.48202848,0.00039520973,0.0009633062,0.00005394358,0.50959665],"study_design_scores_gemma":[0.00044275261,0.00014125548,0.005608234,0.00010669118,0.000001429857,0.000028432003,1.3556068e-7,0.9856685,0.0031098803,0.0034841027,0.0010485383,0.0003600785],"about_ca_topic_score_codex":0.00009938671,"about_ca_topic_score_gemma":0.00004166236,"teacher_disagreement_score":0.8357266,"about_ca_system_score_codex":0.0001116998,"about_ca_system_score_gemma":0.00025641875,"threshold_uncertainty_score":0.99997264},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000514953,0.000116708805,0.97809315,0.01097808,0.0008281451,0.0004794411,0.000004988287,0.0002769185,0.00921741],"genre_scores_gemma":[0.03555654,0.00017411006,0.9351536,0.027133372,0.0006773539,0.000016694592,0.000025449113,0.000077196,0.001185709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995478,0.00006515622,0.00045207547,0.0017494848,0.0015842931,0.00067102426],"domain_scores_gemma":[0.99762386,0.00039341298,0.00013269075,0.0012252786,0.00025901294,0.00036574507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081001135,0.000469676,0.00045807546,0.00086009817,0.00026057803,0.0007203381,0.0037424287,0.00024128194,0.000069250804],"category_scores_gemma":[0.000068677036,0.00040923525,0.00012368948,0.001082492,0.00048813527,0.00044569935,0.0015748376,0.0013364593,0.00030840002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015382764,0.00006543517,0.000008057599,0.000040342176,0.000013523606,0.00019785266,0.0007211511,0.13937704,0.00009190271,0.1613699,0.00021814942,0.6978812],"study_design_scores_gemma":[0.0002950213,0.0005984337,0.0000073995016,0.00020963713,0.0000018321477,0.000017318305,5.1972012e-8,0.9438338,0.00048155067,0.04716108,0.006943142,0.00045068355],"about_ca_topic_score_codex":0.000009396026,"about_ca_topic_score_gemma":0.000014391675,"teacher_disagreement_score":0.80445683,"about_ca_system_score_codex":0.00022465702,"about_ca_system_score_gemma":0.0004804929,"threshold_uncertainty_score":0.99983597},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014059826,0.00008524333,0.98442274,0.00039236367,0.00033876105,0.0005538649,0.000006393629,0.00002533224,0.00011549499],"genre_scores_gemma":[0.93731797,0.000010909407,0.062388748,0.000187759,0.000061062805,0.000015669804,0.0000022455083,0.000011156529,0.000004508714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990276,0.000021476735,0.00030517395,0.00027098606,0.00024450876,0.00013022621],"domain_scores_gemma":[0.99952424,0.000113006055,0.00006965467,0.00018139368,0.00006716646,0.000044524462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020044358,0.00016113301,0.00020617664,0.000286042,0.000026400572,0.000044708242,0.00023321807,0.0001059323,0.000012132694],"category_scores_gemma":[0.000012495596,0.0001367946,0.00002452315,0.00044267153,0.00013594764,0.000063718726,0.00004786886,0.00022477798,0.0000011679599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020894322,0.0000021087021,0.0007434713,0.00005404269,0.0000069697917,0.0000026147097,0.0032247985,0.3480281,0.0011949447,0.00073295645,0.000018183697,0.64597094],"study_design_scores_gemma":[0.0050565056,0.005877599,0.06995816,0.0077223373,0.0002494333,0.0009955071,0.0015815827,0.7107092,0.12079281,0.0663376,0.0054398873,0.0052793487],"about_ca_topic_score_codex":0.000023797089,"about_ca_topic_score_gemma":0.00023883022,"teacher_disagreement_score":0.9232581,"about_ca_system_score_codex":0.000069526366,"about_ca_system_score_gemma":0.0000770739,"threshold_uncertainty_score":0.5578322},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009852578,0.00073220377,0.98795044,0.0024748917,0.00039791365,0.00031235328,0.000034104345,0.000055101507,0.007057749],"genre_scores_gemma":[0.9818342,0.000044883192,0.017123617,0.00071281154,0.00019233576,0.000003934262,0.000019102597,0.000011457622,0.00005769369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973875,0.00006100567,0.0005402298,0.0008819154,0.00078701065,0.00034233864],"domain_scores_gemma":[0.99843395,0.00043147063,0.00034437605,0.00038659634,0.00025986,0.00014372877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010169994,0.000257909,0.00067025784,0.0007438114,0.00032164733,0.000119618126,0.0008899204,0.0002791497,0.000019441122],"category_scores_gemma":[0.0003477269,0.0002335752,0.00014052197,0.0009787355,0.0011737646,0.00025688283,0.00025757868,0.00035641395,0.000001293108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040872238,0.000042864187,0.0013852234,0.00007050805,0.00022573763,0.00006618154,0.005825041,0.5050478,0.00001311182,0.01523095,0.0000040393793,0.47167984],"study_design_scores_gemma":[0.0003933972,0.00014195265,0.000341309,0.000117580195,0.00028743452,3.8922332e-7,0.0000025380673,0.98004395,0.0000112413045,0.018206393,0.00018188788,0.00027190038],"about_ca_topic_score_codex":0.0006836979,"about_ca_topic_score_gemma":0.0019535716,"teacher_disagreement_score":0.9808489,"about_ca_system_score_codex":0.00010977994,"about_ca_system_score_gemma":0.00052042486,"threshold_uncertainty_score":0.95249206},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059254846,0.00032607824,0.9578573,0.03127225,0.001018842,0.00030438503,0.0000037542363,0.0002671234,0.008891016],"genre_scores_gemma":[0.4591623,0.000046126646,0.5113359,0.024355069,0.0018921557,0.000028090602,0.000012551425,0.00012140024,0.0030463685],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729156,0.000038950395,0.00030063593,0.0011640828,0.00075486326,0.00044991306],"domain_scores_gemma":[0.998273,0.00036250136,0.00020438443,0.0009142289,0.000079415986,0.0001664439],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00024060771,0.00045384394,0.0003727032,0.00030099656,0.00034086028,0.0012244354,0.0034567823,0.00012914685,0.00003519871],"category_scores_gemma":[0.000024267352,0.00028786488,0.00009398178,0.0006187052,0.0010984511,0.0012855122,0.0014991252,0.00072698697,0.000068497495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030144329,0.000028211525,0.00001935462,0.000041946627,0.000034392007,0.00030983306,0.003936956,0.013147377,0.000043768996,0.450973,0.00061719824,0.5308178],"study_design_scores_gemma":[0.0005891328,0.0013149907,0.00034036455,0.0005315382,0.000023899951,0.00044572126,0.0000014882288,0.2840735,0.0016958513,0.6159245,0.093206204,0.0018527976],"about_ca_topic_score_codex":0.000005023128,"about_ca_topic_score_gemma":0.000016612454,"teacher_disagreement_score":0.528965,"about_ca_system_score_codex":0.0000635164,"about_ca_system_score_gemma":0.0006263532,"threshold_uncertainty_score":0.9999573},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044285445,0.000116962714,0.995187,0.0011945915,0.0015113397,0.0008348062,0.00003160775,0.0003363595,0.0003445001],"genre_scores_gemma":[0.011669891,0.000005840748,0.9861988,0.0010274395,0.0008486815,0.00003299556,0.00008531396,0.000051262927,0.000079773985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635804,0.000042581665,0.00047746795,0.0016899235,0.00082154665,0.00061044376],"domain_scores_gemma":[0.9977608,0.0005781422,0.0004051454,0.0007683361,0.00029115216,0.00019647437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066829135,0.0005416823,0.0005351742,0.0004001157,0.000354891,0.000692015,0.0021255012,0.00031881614,0.0000021316348],"category_scores_gemma":[0.0001066525,0.0004939924,0.00010625202,0.000512452,0.00037007302,0.0007396623,0.00048707429,0.0006747471,0.00003743184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001154395,0.000052779866,0.00004625144,0.00019548858,0.000044213783,0.00020513855,0.0020262736,0.15598674,0.0024111327,0.0020879263,0.00010918565,0.83671945],"study_design_scores_gemma":[0.0009598308,0.0007633179,0.00004388048,0.0010626748,0.000023246494,0.00014090413,3.229721e-7,0.9374961,0.006852712,0.050959896,0.0007782654,0.0009188428],"about_ca_topic_score_codex":0.000025352037,"about_ca_topic_score_gemma":0.000010552881,"teacher_disagreement_score":0.8358006,"about_ca_system_score_codex":0.00026331845,"about_ca_system_score_gemma":0.0006686711,"threshold_uncertainty_score":0.99975115},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009862339,0.00016511318,0.99694145,0.0017776814,0.00047055466,0.00039446392,0.000061304745,0.000039737086,0.000051081064],"genre_scores_gemma":[0.2899854,0.000050464674,0.70914334,0.0004202402,0.00031818094,0.000010003918,0.000039582486,0.000011259084,0.00002157258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977595,0.000039962168,0.00052107946,0.00085757265,0.00047714065,0.00034473653],"domain_scores_gemma":[0.99793965,0.00085098547,0.0004422535,0.00046746765,0.00019071462,0.00010895764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006528536,0.00026784764,0.00039769046,0.00028450714,0.00040133932,0.0003521912,0.0013908306,0.00009756193,0.000005300413],"category_scores_gemma":[0.00015858495,0.00018707605,0.00010128464,0.00064657803,0.00065800856,0.00032334134,0.0009137414,0.00023985005,0.0000018127259],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010994843,0.000013497414,0.00022766179,0.000019667716,0.00003334609,0.0000036206238,0.00056394294,0.0028478852,0.00012138792,0.09281077,0.000016315107,0.9033309],"study_design_scores_gemma":[0.0007560485,0.00026521806,0.001675394,0.00003349748,0.000028289105,0.000006445437,0.0000020316938,0.71621615,0.00045904733,0.2790576,0.0011215606,0.0003787267],"about_ca_topic_score_codex":0.00025860127,"about_ca_topic_score_gemma":0.00018448521,"teacher_disagreement_score":0.9029522,"about_ca_system_score_codex":0.00006535909,"about_ca_system_score_gemma":0.00014347787,"threshold_uncertainty_score":0.76287395},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037039386,0.0007420837,0.98960775,0.0016383864,0.0011986922,0.0005687931,0.0000027154942,0.00021635093,0.0023212847],"genre_scores_gemma":[0.8564705,0.00016392297,0.13682546,0.0022978561,0.0004900641,0.00004804286,0.000030208328,0.000102936414,0.0035710174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955337,0.0001252277,0.000654866,0.0018804101,0.0010203494,0.0007854191],"domain_scores_gemma":[0.9965533,0.00029615036,0.00038523786,0.002211347,0.00032615842,0.00022780018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011267639,0.000582042,0.0006820876,0.00101094,0.00023613578,0.00081714836,0.0040906924,0.00036079352,0.000020538957],"category_scores_gemma":[0.00018602918,0.00051927374,0.00011745698,0.0011662132,0.000418349,0.00066136266,0.0018383013,0.0013716443,0.00003355351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060936385,0.0004064249,0.0036604798,0.00087366014,0.00012068588,0.0020320218,0.3226407,0.027961675,0.002814884,0.01730779,0.00014432274,0.62197644],"study_design_scores_gemma":[0.00076162704,0.00025582488,0.00030629715,0.0013543818,0.000008301424,0.00008836914,0.000005403685,0.9811,0.0008326403,0.003942616,0.010193445,0.0011510854],"about_ca_topic_score_codex":0.000059642796,"about_ca_topic_score_gemma":0.0011041258,"teacher_disagreement_score":0.95313835,"about_ca_system_score_codex":0.00036153066,"about_ca_system_score_gemma":0.00066101155,"threshold_uncertainty_score":0.9997259},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013799098,0.0000936534,0.9929908,0.0030346008,0.0007965489,0.00043446512,0.00005234662,0.00020734317,0.00238887],"genre_scores_gemma":[0.0032838613,0.000022809718,0.9927492,0.0026196188,0.000551139,0.000044423527,0.000036792084,0.000034146655,0.0006579724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969795,0.000007301452,0.0004048687,0.00154083,0.00050417625,0.0005633693],"domain_scores_gemma":[0.9978897,0.00030982762,0.00020900469,0.0012155941,0.00020434053,0.00017153042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005584272,0.00038617893,0.00041793924,0.0002798414,0.00024034585,0.00048410916,0.0034726032,0.00016813158,0.0000111061445],"category_scores_gemma":[0.00015144864,0.00036283088,0.000119582335,0.00047695104,0.0003014438,0.00045968947,0.0010604966,0.00048201345,0.00005594014],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002131083,0.000011271261,0.0000037235725,0.000026730939,0.0000069263206,0.000025757892,0.00024424877,0.0025191752,0.0000340949,0.089410216,0.00075706444,0.90695864],"study_design_scores_gemma":[0.00021234553,0.00016696149,0.000018194758,0.00019093633,0.0000067028227,0.000049577222,9.8466394e-8,0.8731031,0.00040494793,0.06673489,0.05861846,0.00049378205],"about_ca_topic_score_codex":0.0000063844454,"about_ca_topic_score_gemma":0.000008772577,"teacher_disagreement_score":0.9064649,"about_ca_system_score_codex":0.00014746164,"about_ca_system_score_gemma":0.00048492115,"threshold_uncertainty_score":0.99988234},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000117428426,0.00034124465,0.9952165,0.0013176468,0.0016017641,0.00077063777,0.000042444437,0.00020339979,0.00038892843],"genre_scores_gemma":[0.5214359,0.000014617534,0.47694346,0.00076636433,0.00048419792,0.000021363285,0.00003990914,0.00004133032,0.00025283312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571145,0.000075012984,0.00084667216,0.001604242,0.0010084016,0.0007542237],"domain_scores_gemma":[0.99696654,0.00077597855,0.00039841386,0.001030014,0.00052308803,0.00030597695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002092926,0.0005503878,0.00075298775,0.00061392796,0.00032719586,0.00032916706,0.0028617757,0.0005642915,0.000020840223],"category_scores_gemma":[0.0003955839,0.00053863693,0.0002726455,0.00088524935,0.00045561948,0.00063237076,0.0010817432,0.00091140525,0.000022865366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049478298,0.000051304203,0.0004003929,0.0003205956,0.000044793625,0.0000324,0.0018861406,0.01946283,0.0016125336,0.47228572,0.000093104594,0.5037607],"study_design_scores_gemma":[0.00036032722,0.00036079815,0.00021416898,0.0005535161,0.000028602117,0.000033933797,4.903294e-7,0.80631965,0.024439042,0.1602596,0.006469103,0.0009607813],"about_ca_topic_score_codex":0.0000047374847,"about_ca_topic_score_gemma":0.000013509023,"teacher_disagreement_score":0.78685683,"about_ca_system_score_codex":0.0003116817,"about_ca_system_score_gemma":0.0006343873,"threshold_uncertainty_score":0.9997065},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011062053,0.00014258291,0.9949437,0.00035288854,0.00044421759,0.00020359484,0.000014155073,0.000055179862,0.0027374972],"genre_scores_gemma":[0.78619075,0.000037182203,0.21299447,0.0005668337,0.00014933322,0.0000039446263,0.0000073535066,0.000012394176,0.000037722853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821204,0.000027255977,0.0004583105,0.00065869297,0.00044009942,0.0002035738],"domain_scores_gemma":[0.9986139,0.00027343625,0.00034735844,0.0004344942,0.00022621163,0.000104596635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020659152,0.00023600495,0.00038921068,0.0004957628,0.00019814468,0.00013101996,0.0007020614,0.00013900816,0.000016063676],"category_scores_gemma":[0.000039274393,0.00023469848,0.00008830396,0.00038075837,0.00042930007,0.00042400984,0.00044092388,0.0003813254,0.000006087732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001701545,0.00021589991,0.00010657853,0.00047301897,0.00009901165,0.000069255555,0.005555902,0.053663403,0.10891564,0.07769539,0.000107681044,0.7530812],"study_design_scores_gemma":[0.0005315136,0.0006890628,0.00020256045,0.0011011697,0.00004417549,0.00015086483,0.0000016717185,0.76151043,0.09838419,0.1362022,0.00038027094,0.00080186705],"about_ca_topic_score_codex":0.000015142142,"about_ca_topic_score_gemma":0.000028253231,"teacher_disagreement_score":0.78508455,"about_ca_system_score_codex":0.000050942996,"about_ca_system_score_gemma":0.00023294348,"threshold_uncertainty_score":0.9570726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007130079,0.00007261739,0.9933166,0.0011122199,0.00025968582,0.0006030921,0.0000041416124,0.000764371,0.0037959905],"genre_scores_gemma":[0.53189754,0.00002070777,0.46558335,0.0018047827,0.0002587321,0.000062859785,0.0000045400566,0.000048593665,0.00031889096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996711,0.00002419453,0.00043172672,0.0016198875,0.00074636756,0.00046683563],"domain_scores_gemma":[0.99795264,0.000106500054,0.00026136558,0.0012211179,0.00023422933,0.00022415425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026911637,0.00049950177,0.00042101918,0.00058934116,0.00036846948,0.00047090356,0.0021710994,0.00026393135,0.000025463498],"category_scores_gemma":[0.000018137027,0.00043215023,0.00011634795,0.0011633666,0.00044115668,0.0005238883,0.00051627244,0.000748373,0.000055566004],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023966146,0.000056909863,0.00005155764,0.00004820252,0.000030648604,0.000092406975,0.00050771644,0.012849431,0.0030169238,0.016827647,0.000025861653,0.96646875],"study_design_scores_gemma":[0.0003466364,0.00067552674,0.0002210886,0.00017789146,0.000016652339,0.00014815602,2.9518486e-7,0.9302107,0.021020416,0.041682813,0.00465812,0.0008416824],"about_ca_topic_score_codex":0.00003751129,"about_ca_topic_score_gemma":0.0001235897,"teacher_disagreement_score":0.9656271,"about_ca_system_score_codex":0.0002899569,"about_ca_system_score_gemma":0.00039262828,"threshold_uncertainty_score":0.999813},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012806851,0.00059606833,0.9876415,0.0035220662,0.0016952098,0.00093069155,0.000014538761,0.0003243498,0.0052627325],"genre_scores_gemma":[0.071362086,0.000030472931,0.9214533,0.0054732654,0.00088553055,0.000037536796,0.000014007451,0.00006968385,0.0006741227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99482584,0.00002380076,0.0007489099,0.002460178,0.0010890319,0.0008522155],"domain_scores_gemma":[0.9967499,0.00043182157,0.00029978863,0.0018316295,0.00031821572,0.00036865732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007552507,0.00066481176,0.00072579883,0.00054480054,0.00023237438,0.00045433428,0.004793234,0.00043029376,0.000010759572],"category_scores_gemma":[0.00014917814,0.0006411715,0.0002644695,0.00047924253,0.00038512642,0.0010032156,0.0014970044,0.0007529471,0.000021795066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010491292,0.000019715313,0.000003399311,0.000075365846,0.000017133907,0.000056779427,0.001018105,0.13216062,0.0001495577,0.108520634,0.00008727958,0.7578809],"study_design_scores_gemma":[0.00022261027,0.00011812283,0.0000064114006,0.00014266984,0.0000067366327,0.000018407834,7.1250845e-8,0.6552728,0.00022687356,0.34251836,0.0009998253,0.00046711182],"about_ca_topic_score_codex":0.000019012403,"about_ca_topic_score_gemma":0.000038554594,"teacher_disagreement_score":0.7574138,"about_ca_system_score_codex":0.00025835892,"about_ca_system_score_gemma":0.00081582,"threshold_uncertainty_score":0.9996039},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016099294,0.0004549287,0.98426074,0.0019205975,0.001889695,0.0003344917,0.0000031173304,0.00016283599,0.0093636885],"genre_scores_gemma":[0.9871998,0.00004629102,0.012087268,0.00036389136,0.00026175723,0.000007738924,0.000004260261,0.000019311678,0.000009700266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988169,0.00001875957,0.00029022616,0.00038886463,0.00031407,0.00017119937],"domain_scores_gemma":[0.99943334,0.00014444438,0.000050186558,0.00026638678,0.00005705986,0.000048605863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021828007,0.00021348911,0.00017962407,0.0003826174,0.00007361186,0.00012156979,0.0003595514,0.0004684729,0.00002286604],"category_scores_gemma":[0.00004005992,0.00017583856,0.000036376165,0.00041478913,0.0002029955,0.00015685974,0.000047692,0.001140758,0.000020270865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015514898,0.0000012273617,0.000023410006,0.000010390453,0.000002567279,0.0000038919356,0.00050355156,0.54462403,0.000017105393,0.034265302,0.0000015507226,0.42054546],"study_design_scores_gemma":[0.00013619402,0.00005668464,0.000579775,0.00024900268,0.0000063817733,0.000055442168,0.0000075162334,0.87432986,0.00022067761,0.122219004,0.0018143401,0.00032511423],"about_ca_topic_score_codex":0.000003682441,"about_ca_topic_score_gemma":0.00006983075,"teacher_disagreement_score":0.98558986,"about_ca_system_score_codex":0.0001411531,"about_ca_system_score_gemma":0.00006785171,"threshold_uncertainty_score":0.7170488},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001601825,0.00006753749,0.98347306,0.002336543,0.00080753776,0.0003226601,0.0000048150496,0.00029786894,0.0125298],"genre_scores_gemma":[0.3247203,0.000006807949,0.67183256,0.0022931607,0.00048285216,0.000021360393,0.000011542001,0.000042021453,0.00058938423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963388,0.000033289052,0.00045722837,0.0016395223,0.0010288846,0.0005022849],"domain_scores_gemma":[0.99779856,0.00034215243,0.00043946458,0.00082900724,0.00049496745,0.00009582723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041847592,0.0005222996,0.00047020763,0.00081345625,0.00041903643,0.0004580108,0.0022674424,0.00028251574,0.00004515638],"category_scores_gemma":[0.000095846735,0.00044553995,0.00007524477,0.00082254293,0.0008987025,0.000790998,0.0010719124,0.0013350617,0.00009284559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040891307,0.00009508142,0.0009241602,0.000080547354,0.00011433464,0.000552555,0.0017820399,0.02225201,0.00089082844,0.50829417,0.000117562355,0.46485582],"study_design_scores_gemma":[0.0010810527,0.0019425504,0.0036239224,0.0029713374,0.000034366403,0.0007101139,0.000002567966,0.7335444,0.014464482,0.23491985,0.0042585456,0.002446823],"about_ca_topic_score_codex":0.000010807158,"about_ca_topic_score_gemma":0.000033479682,"teacher_disagreement_score":0.7112924,"about_ca_system_score_codex":0.00063086965,"about_ca_system_score_gemma":0.0005589068,"threshold_uncertainty_score":0.9997996},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12188004,0.000008173466,0.8732758,0.0043460354,0.0001640804,0.0002531365,0.000008387532,0.00004997302,0.000014378762],"genre_scores_gemma":[0.748209,0.0000016873175,0.24889955,0.0027833274,0.000040796003,0.000036759287,0.0000043875298,0.000007375558,0.000017114597],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985093,0.000069524,0.0001698489,0.00067213003,0.00033988475,0.0002393227],"domain_scores_gemma":[0.9991282,0.00043282376,0.00009972586,0.00017568706,0.00009907124,0.000064449756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035031207,0.00011913096,0.00009957388,0.00014946728,0.00030785523,0.0002418857,0.00015966885,0.00002756101,0.0000058041237],"category_scores_gemma":[0.0003268193,0.00010604696,0.000023717485,0.00082611677,0.0002447927,0.00043028046,0.00005494327,0.000119464654,0.0000014945747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026327369,0.000045254652,0.00036690553,0.00002095805,0.0000013722882,0.000007990731,0.00064396014,0.458143,0.5228881,0.002636607,0.0000074238424,0.015212093],"study_design_scores_gemma":[0.0005300794,0.000050247527,0.0015404831,0.000016774089,0.0000025922182,0.000070334565,0.0000075278526,0.77937514,0.21425694,0.0040327804,0.000008309727,0.00010878401],"about_ca_topic_score_codex":0.000009921219,"about_ca_topic_score_gemma":0.00009454523,"teacher_disagreement_score":0.62632895,"about_ca_system_score_codex":0.000100467965,"about_ca_system_score_gemma":0.00023717125,"threshold_uncertainty_score":0.43244693},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001998985,0.00027651634,0.9808588,0.0026218097,0.000940516,0.00037213115,0.0000014272838,0.0003014434,0.01462537],"genre_scores_gemma":[0.004477629,0.000054716988,0.98535967,0.0090702195,0.00039422727,0.0000061389687,0.0000034445104,0.000044445806,0.0005894925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99568546,0.00002677369,0.0005298562,0.0019316773,0.0011004613,0.0007257489],"domain_scores_gemma":[0.9976111,0.0002147361,0.00028527805,0.001307597,0.00022848444,0.00035281695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040590725,0.00059725816,0.00056349044,0.0005608597,0.00027246386,0.0006425212,0.003943565,0.00022401284,0.000054687247],"category_scores_gemma":[0.00008277171,0.0005455385,0.000160117,0.0007917552,0.00064041215,0.0012274437,0.0025265305,0.0010957966,0.00037620214],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046353925,0.000022954286,0.00001970321,0.000045552693,0.000009431237,0.0001572637,0.0008117964,0.01789081,0.000273378,0.018033985,0.00015248822,0.962578],"study_design_scores_gemma":[0.00026037614,0.000098003606,0.000017575503,0.000279851,0.0000050163057,0.00003985307,1.9751094e-7,0.813188,0.00062666705,0.1779499,0.006910028,0.0006244977],"about_ca_topic_score_codex":0.000005913682,"about_ca_topic_score_gemma":0.000027390342,"teacher_disagreement_score":0.9619535,"about_ca_system_score_codex":0.0002621631,"about_ca_system_score_gemma":0.00044872062,"threshold_uncertainty_score":0.9996996},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005353839,0.00026115307,0.9948206,0.0013696871,0.0007168662,0.00025464452,0.0000142985955,0.00008663959,0.0019407169],"genre_scores_gemma":[0.48574927,0.000041551244,0.51299125,0.0008544284,0.00025221516,0.000006438856,0.000014536501,0.000022917351,0.00006742051],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963918,0.000036185967,0.0007715341,0.0012791578,0.0010334516,0.00048786862],"domain_scores_gemma":[0.9975507,0.00026872696,0.00040882034,0.0012475476,0.00033798898,0.00018619656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006449398,0.0004373252,0.0006956944,0.0011034864,0.00019453603,0.00036484146,0.003028312,0.00018308664,0.0000893493],"category_scores_gemma":[0.000080818565,0.00039863872,0.0002899018,0.0017991668,0.00065290835,0.00053100876,0.0011736846,0.0006468945,0.000014953302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013670693,0.000091508075,0.0002206692,0.00010262126,0.00010960239,0.00008807371,0.00302781,0.004680774,0.0014963631,0.4352418,0.00015773858,0.5547694],"study_design_scores_gemma":[0.00047066476,0.00040236136,0.0002272426,0.00026405422,0.00005461007,0.00004252062,0.0000017672129,0.42609686,0.0040090033,0.5636778,0.0038545881,0.00089850836],"about_ca_topic_score_codex":0.00014464707,"about_ca_topic_score_gemma":0.00019459502,"teacher_disagreement_score":0.55387086,"about_ca_system_score_codex":0.00015562636,"about_ca_system_score_gemma":0.00050879974,"threshold_uncertainty_score":0.9998466},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003070635,0.00026523962,0.9920297,0.0014317569,0.0015939478,0.0009651895,0.00001698996,0.00029912248,0.0003273706],"genre_scores_gemma":[0.87408364,0.000007970076,0.124067515,0.0008841534,0.00079749816,0.000013763591,0.000016052554,0.000048900372,0.00008050995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773216,0.0000092071405,0.00041305728,0.0009148333,0.00041752908,0.0005132185],"domain_scores_gemma":[0.99768555,0.0012671606,0.00016009518,0.00049171504,0.00017048331,0.00022502134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020752162,0.00036955692,0.0005540047,0.00035924232,0.0001896692,0.00004485187,0.00041402387,0.00051145273,0.000009226743],"category_scores_gemma":[0.0011487015,0.0003481774,0.00012214785,0.00020136018,0.00040878635,0.00007871887,0.00021955579,0.00090390246,0.000016918322],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017479277,0.00006001418,0.0004731446,0.0005328611,0.000040266354,0.000532529,0.0009865854,0.0038342166,0.022527369,0.00036103989,0.000010252579,0.9704669],"study_design_scores_gemma":[0.0037127533,0.011140832,0.000054118755,0.0052018827,0.00019069547,0.00064014696,0.0000060908833,0.8530947,0.0781658,0.024719559,0.020563241,0.0025101558],"about_ca_topic_score_codex":0.000009672804,"about_ca_topic_score_gemma":0.000030317566,"teacher_disagreement_score":0.9679568,"about_ca_system_score_codex":0.00035800095,"about_ca_system_score_gemma":0.00035434455,"threshold_uncertainty_score":0.999897},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032464945,0.0020838503,0.9925159,0.00041111745,0.0034115163,0.0010992866,0.0000053831172,0.0002632379,0.00017719586],"genre_scores_gemma":[0.123325266,0.0008815058,0.863437,0.008411695,0.0032474722,0.00017381272,0.000054137632,0.00018635669,0.00028276845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99470425,0.00009879305,0.0008263708,0.0023197567,0.00094445405,0.0011063914],"domain_scores_gemma":[0.9973978,0.00068406155,0.00038259965,0.0010111188,0.00016689295,0.00035757595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011001097,0.00079761795,0.000883723,0.00049445906,0.000342856,0.0006821186,0.0018806328,0.00049904815,0.000012413986],"category_scores_gemma":[0.00004158852,0.0007541145,0.00013268423,0.0013319983,0.000522083,0.00031439407,0.0020162372,0.0013557037,0.000017397773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017066703,0.000027794937,0.000057730325,0.000011279858,0.00000902779,0.000054767344,0.00019379499,0.51746416,0.000001794519,0.0023669389,0.00004743044,0.4797482],"study_design_scores_gemma":[0.0011731687,0.00026299304,0.0002982686,0.00052783894,0.000013176009,0.00003178818,6.035899e-7,0.9917481,0.000008090671,0.0038437694,0.001306407,0.0007857727],"about_ca_topic_score_codex":0.000031085387,"about_ca_topic_score_gemma":0.00009439449,"teacher_disagreement_score":0.47896242,"about_ca_system_score_codex":0.00036636947,"about_ca_system_score_gemma":0.00032887675,"threshold_uncertainty_score":0.999491},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008873683,0.00033693764,0.99488944,0.0018193149,0.000746314,0.0005404405,0.0000030625874,0.00028196324,0.0012937993],"genre_scores_gemma":[0.19100672,0.000010757133,0.80400306,0.004020464,0.00055210287,0.000027649194,0.0000026986006,0.000049816597,0.00032671628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677026,0.000019573872,0.00039631195,0.0014527679,0.0007794799,0.00058162573],"domain_scores_gemma":[0.99820095,0.00026412084,0.000327685,0.0008062169,0.00020876728,0.0001922499],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045347904,0.00048297303,0.0005050904,0.00033201856,0.00036009192,0.0008713447,0.0021136194,0.00021723536,0.00002411325],"category_scores_gemma":[0.00007489941,0.0003802532,0.0001054102,0.0005373121,0.00038385217,0.0006949027,0.00050531706,0.0005125387,0.000032519594],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006146749,0.000014010848,0.000009582633,0.00020574739,0.000010935258,0.00004230209,0.00058447884,0.004462805,0.0003182297,0.0030545075,0.00004244376,0.9912488],"study_design_scores_gemma":[0.0003849783,0.00029016077,0.00004820733,0.0009824389,0.000013806971,0.00006398214,1.4877843e-7,0.9311255,0.0030399358,0.062215984,0.0012036609,0.0006311584],"about_ca_topic_score_codex":0.000005343757,"about_ca_topic_score_gemma":0.000020750944,"teacher_disagreement_score":0.99061763,"about_ca_system_score_codex":0.0001911152,"about_ca_system_score_gemma":0.00057081296,"threshold_uncertainty_score":0.99986494},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020973948,0.0001235025,0.9894576,0.0046950364,0.0010240924,0.0007922417,0.000023109666,0.00016167536,0.0035129932],"genre_scores_gemma":[0.20897558,0.00018767471,0.7837104,0.0059975074,0.00062150403,0.00007718595,0.00016980618,0.00007941861,0.00018089991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598515,0.000081244674,0.0007226124,0.0016254457,0.0009753762,0.0006101836],"domain_scores_gemma":[0.99828595,0.00031084163,0.00029739903,0.00065073697,0.00022993993,0.0002251064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092415523,0.0005538343,0.0005836229,0.0009629963,0.00020063418,0.00044431066,0.0017758516,0.0005072101,0.000054332348],"category_scores_gemma":[0.000082332954,0.0005346523,0.000138671,0.00084098586,0.00037217618,0.0013168986,0.0004644281,0.0010545488,0.000165531],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024332036,0.000061830295,0.0000075722573,0.00006545107,0.000007833295,0.00022861929,0.0022631942,0.00794838,0.0011830648,0.0017230515,0.000056416517,0.9864302],"study_design_scores_gemma":[0.0012323451,0.00031722666,0.000111793284,0.0011087764,0.0000112032185,0.000107610846,0.0000033380936,0.70360696,0.0061968546,0.2849278,0.0012486716,0.0011274071],"about_ca_topic_score_codex":0.00006674087,"about_ca_topic_score_gemma":0.00039661824,"teacher_disagreement_score":0.98530287,"about_ca_system_score_codex":0.0003838582,"about_ca_system_score_gemma":0.000348309,"threshold_uncertainty_score":0.9997105},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076202874,0.00031988707,0.9954151,0.0008815089,0.0003529857,0.00024703925,0.00004501098,0.00004012291,0.0019363203],"genre_scores_gemma":[0.99017495,0.000032748947,0.008724296,0.00042643497,0.0005508021,0.000016444092,0.000019541365,0.000032391043,0.000022379929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983519,0.000008132463,0.0002657802,0.00077361456,0.0002913216,0.0003092971],"domain_scores_gemma":[0.9991212,0.000120872144,0.00014677261,0.0003854229,0.00007446296,0.00015129874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014679278,0.00032706102,0.0003489951,0.00022744384,0.0002408113,0.00019780555,0.0004966686,0.00008890786,0.00006175068],"category_scores_gemma":[0.0000049003365,0.00029614152,0.000097890814,0.00024924937,0.00037775908,0.00009354761,0.00032364772,0.00045783535,0.000021968723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000234741,0.000011431239,0.0001440921,0.00001324289,0.00001429579,0.0000027357803,0.00017622736,0.00009381753,0.00011165885,0.9424026,0.000042047293,0.0569855],"study_design_scores_gemma":[0.00011269121,0.000060603194,0.00005904468,0.000085791304,0.000013624758,0.000001795956,8.899252e-7,0.10045304,0.0001906318,0.8953158,0.0033820586,0.00032400555],"about_ca_topic_score_codex":0.00007586225,"about_ca_topic_score_gemma":0.000014794145,"teacher_disagreement_score":0.9894129,"about_ca_system_score_codex":0.000021743312,"about_ca_system_score_gemma":0.00014703973,"threshold_uncertainty_score":0.9999491},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059920967,0.00096282543,0.7336092,0.21774794,0.0027811266,0.00150184,0.000028123006,0.000096452466,0.043212593],"genre_scores_gemma":[0.87466586,0.00034139652,0.048217975,0.059006654,0.006783788,0.000122063386,0.00000739578,0.00012561984,0.010729237],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970828,0.0000948964,0.00034508613,0.0007798627,0.0009727161,0.00072458107],"domain_scores_gemma":[0.9938126,0.0048652925,0.0001501137,0.0006871491,0.00026480143,0.00021999396],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019890415,0.00034274993,0.00032893056,0.000071050374,0.00080751063,0.001121376,0.0024791732,0.00023270627,0.000044427274],"category_scores_gemma":[0.0015652766,0.00016490242,0.00024716754,0.00025639974,0.003912023,0.00024717208,0.00046365647,0.0007966418,0.000026846426],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018943689,0.000015138492,0.0000051685283,0.000027663304,0.000022897595,0.00029545958,0.03512542,0.0008622065,0.000004201253,0.25354326,0.0010826662,0.70899695],"study_design_scores_gemma":[0.000104763385,0.00011406992,0.000003077051,0.00010523937,0.000037676902,0.0000967126,0.00003445556,0.024382984,0.00002630989,0.27329373,0.7015111,0.00028990628],"about_ca_topic_score_codex":0.00020088414,"about_ca_topic_score_gemma":0.0029212283,"teacher_disagreement_score":0.87460595,"about_ca_system_score_codex":0.00011837931,"about_ca_system_score_gemma":0.00060154544,"threshold_uncertainty_score":0.99991554},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000029318846,0.0007429618,0.9958753,0.0009331868,0.0015550856,0.00046278886,0.00001027308,0.00028707695,0.0001304069],"genre_scores_gemma":[0.012827865,0.000022519635,0.9860676,0.0007458074,0.0002671456,0.000021943184,0.0000026464081,0.000030310386,0.000014163678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99662614,0.00006724809,0.0006107737,0.0010615615,0.0012205674,0.00041369756],"domain_scores_gemma":[0.99597937,0.0020981662,0.0003421438,0.0008740605,0.0005914459,0.00011481808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014485235,0.00041066852,0.00069173396,0.0003535458,0.00009340549,0.00012525413,0.0022600982,0.00032568467,0.0000039729994],"category_scores_gemma":[0.0042323633,0.0003851186,0.00015757952,0.00048459994,0.0005891173,0.00031231027,0.0007706302,0.0004798617,0.0000024495473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014875474,0.000016706854,0.000011128506,0.00024125028,0.000024067609,0.000007972129,0.0041222484,0.23374236,0.000132474,0.4351513,0.000024160301,0.32651144],"study_design_scores_gemma":[0.00016298224,0.00027670473,0.00002143274,0.00046076617,0.00000828373,0.000005371982,0.0000010092884,0.08560047,0.005229223,0.9069661,0.0008197415,0.00044789718],"about_ca_topic_score_codex":0.0000029540224,"about_ca_topic_score_gemma":0.000003264967,"teacher_disagreement_score":0.4718148,"about_ca_system_score_codex":0.00031761243,"about_ca_system_score_gemma":0.00067589234,"threshold_uncertainty_score":0.99986005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007501188,0.00019282919,0.9962176,0.00006859538,0.0018155846,0.00033153055,0.000006037295,0.00017482192,0.000442866],"genre_scores_gemma":[0.16528907,0.0000106510815,0.8344442,0.000060718983,0.00013415903,0.0000040547375,9.049222e-7,0.000022007052,0.000034182536],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99642867,0.00012954861,0.0007762933,0.001382903,0.0007749938,0.000507564],"domain_scores_gemma":[0.994149,0.0028125946,0.0005274657,0.0021115616,0.0003113984,0.00008793496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030665353,0.00045780168,0.00090665807,0.0006491488,0.00006162835,0.000057232042,0.0032724035,0.00019378291,0.0000030634092],"category_scores_gemma":[0.0024641862,0.00041394864,0.00015019538,0.00061694864,0.0007901788,0.00027579325,0.0015263755,0.00067925017,0.0000020769746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072819703,0.000010747622,0.000052562285,0.00016749464,0.000010617004,0.000005853919,0.00035652827,0.4343807,0.0023604906,0.00709361,6.9824745e-7,0.55555344],"study_design_scores_gemma":[0.0003539006,0.00042812116,0.0028300255,0.0010537951,0.000015766493,0.00008769023,1.2174509e-7,0.23769721,0.020320175,0.7360194,0.00015229222,0.0010415533],"about_ca_topic_score_codex":0.000019665158,"about_ca_topic_score_gemma":0.000004632955,"teacher_disagreement_score":0.7289257,"about_ca_system_score_codex":0.00015927143,"about_ca_system_score_gemma":0.0003777518,"threshold_uncertainty_score":0.99983126},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013097868,0.0005018689,0.9969652,0.000015329313,0.00018755707,0.00065491773,0.00001902202,0.00003364501,0.00031265712],"genre_scores_gemma":[0.7659595,3.8681017e-7,0.23344189,0.000018251907,0.0004536582,0.000051751093,0.00005036861,0.000021478896,0.0000027408282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975703,0.00009909039,0.00049113785,0.00078153214,0.00067942933,0.0003785511],"domain_scores_gemma":[0.9980491,0.000437551,0.00021287252,0.000435892,0.0007774462,0.00008713844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015661141,0.00031520074,0.00049008324,0.00043358578,0.00014048503,0.00006817642,0.0005642538,0.00013463713,0.00006369757],"category_scores_gemma":[0.000049248294,0.00032519005,0.00013276146,0.00029112256,0.0005133075,0.0002359036,0.00023548571,0.00037435885,6.090806e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022967055,0.00020164662,0.0009889437,0.000009125216,0.000022606971,0.0000010600661,0.00054690684,0.6104461,0.0005361372,0.003222018,0.000011200808,0.3839913],"study_design_scores_gemma":[0.0004007268,0.00015151799,0.00044876014,0.00012221915,0.000030880354,0.0000014502461,0.000006049329,0.9195794,0.00086263445,0.07809407,0.0000124833305,0.00028979208],"about_ca_topic_score_codex":0.00014789305,"about_ca_topic_score_gemma":0.00008184921,"teacher_disagreement_score":0.7646497,"about_ca_system_score_codex":0.00046495357,"about_ca_system_score_gemma":0.00030098276,"threshold_uncertainty_score":0.99992},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016914051,0.0005064818,0.9923715,0.0014616799,0.0010597323,0.00032017188,0.000004932978,0.0003213826,0.002262712],"genre_scores_gemma":[0.720572,0.0001297432,0.2745668,0.0042902427,0.00029094255,0.000011044734,0.000007577893,0.000050354258,0.00008132016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608344,0.00006015791,0.00068841997,0.001746102,0.00075350906,0.0006683746],"domain_scores_gemma":[0.9971454,0.0011321534,0.000342086,0.0010919899,0.00006944141,0.00021888629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089864375,0.0005755772,0.0006797968,0.0008214206,0.0001895903,0.0007819006,0.00311722,0.00028883264,0.0000071432514],"category_scores_gemma":[0.00018979167,0.0005589345,0.00008855194,0.0005832445,0.00048240085,0.0007362163,0.0027244033,0.0010337991,0.00002465188],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000782689,0.00003245567,0.00021758363,0.0000783188,0.000012421157,0.0008731735,0.003205472,0.011075474,0.00024033085,0.05945083,0.000009157336,0.92479694],"study_design_scores_gemma":[0.00049647415,0.00013767953,0.00032558455,0.0006063649,0.0000037321192,0.00008289976,3.9531426e-7,0.8397872,0.00023595261,0.15746716,0.0002904758,0.00056609337],"about_ca_topic_score_codex":0.000029096984,"about_ca_topic_score_gemma":0.000028772676,"teacher_disagreement_score":0.9242309,"about_ca_system_score_codex":0.00012453354,"about_ca_system_score_gemma":0.00023899207,"threshold_uncertainty_score":0.99968624},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018666734,0.000049130766,0.9935957,0.0013213813,0.0012357285,0.00052054686,0.000012563708,0.000057828973,0.001340404],"genre_scores_gemma":[0.92704517,0.00000853092,0.06572155,0.0064955046,0.00046187246,0.000028012937,0.000045393586,0.00002358559,0.00017038097],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821866,0.00007611472,0.0004018028,0.00069764396,0.00036465234,0.00024110415],"domain_scores_gemma":[0.9988056,0.00039067696,0.00020623389,0.00038628417,0.00013961214,0.00007162345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030820383,0.00024988473,0.00033507042,0.00029039689,0.00006616245,0.000045449964,0.0005721596,0.00034642097,0.00024052964],"category_scores_gemma":[0.000262547,0.00017612103,0.000098973986,0.00047104235,0.00027446295,0.000090688205,0.00017180384,0.00081909436,0.00013021634],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069385365,0.0001301078,0.0000208667,0.000029178333,0.000012747999,0.000020579082,0.013815244,0.005383088,0.0006677138,0.011628993,0.00036342785,0.9678587],"study_design_scores_gemma":[0.0018245826,0.0061763437,0.023682617,0.0040079923,0.00008204098,0.00007381095,0.00012797912,0.063422896,0.0043832036,0.8902977,0.0035431152,0.0023777026],"about_ca_topic_score_codex":0.00002640034,"about_ca_topic_score_gemma":0.000113756636,"teacher_disagreement_score":0.965481,"about_ca_system_score_codex":0.0000774304,"about_ca_system_score_gemma":0.00012124333,"threshold_uncertainty_score":0.7182007},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016461418,0.00054553786,0.9826673,0.0017499094,0.0011326759,0.0003613986,0.0000029856683,0.0003263843,0.013197332],"genre_scores_gemma":[0.13606676,0.00004846288,0.8580738,0.003526209,0.0009700332,0.000016717731,0.0000049266805,0.00008681602,0.0012062651],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99464196,0.000068858084,0.0005188032,0.0021943836,0.001597086,0.00097889],"domain_scores_gemma":[0.9965017,0.00076869346,0.0002493664,0.0018210822,0.00026180863,0.0003973741],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010953547,0.00060636114,0.0006157499,0.0011496618,0.00035649203,0.0007115585,0.0066403593,0.00020548912,0.00004540474],"category_scores_gemma":[0.00021079542,0.00057137717,0.00017997745,0.0015711588,0.001103105,0.000881128,0.0035499893,0.0018156676,0.0002316762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000086231175,0.000012133686,0.00003500722,0.000025814026,0.000010848589,0.00033655312,0.00051555736,0.027888345,0.00032074447,0.29114583,0.000018245728,0.67968225],"study_design_scores_gemma":[0.00026996015,0.00014027208,0.000018054887,0.0002275577,0.0000033512388,0.000064890235,9.17589e-8,0.31522605,0.0012126825,0.6786699,0.0035302655,0.0006368813],"about_ca_topic_score_codex":0.000007002565,"about_ca_topic_score_gemma":0.000027903887,"teacher_disagreement_score":0.6790454,"about_ca_system_score_codex":0.00030451486,"about_ca_system_score_gemma":0.00067125884,"threshold_uncertainty_score":0.9996738},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005741699,0.00016826259,0.99144626,0.00088147604,0.0002685962,0.0003222792,0.0000020666846,0.00008912046,0.006247744],"genre_scores_gemma":[0.9814034,0.0000357969,0.015902594,0.00072584575,0.00091802893,0.000013052604,0.000013167285,0.000021803216,0.000966298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971602,0.00008392449,0.0003429004,0.0008800481,0.0010984606,0.00043447502],"domain_scores_gemma":[0.9981813,0.0003388879,0.00017680322,0.00061144226,0.000521297,0.00017027602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016945287,0.00027381798,0.00034047218,0.00045458143,0.0007210734,0.00040944197,0.0009667478,0.00027170547,0.00015756355],"category_scores_gemma":[0.00020568473,0.00023942656,0.000078925645,0.0006049882,0.0012569927,0.00026684368,0.000101762955,0.0004574616,0.000036701644],"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.000014127642,0.000021969387,0.00017105824,0.00005022806,0.000017756916,0.000004520661,0.0055841114,0.5542353,0.0000050177046,0.009674538,0.000011190149,0.4302102],"study_design_scores_gemma":[0.0001324856,0.000076005315,0.000029012126,0.00035766163,0.000034083554,0.0000012141188,0.000006039151,0.96700644,0.000008693033,0.030211901,0.0017697278,0.00036675524],"about_ca_topic_score_codex":0.0017389149,"about_ca_topic_score_gemma":0.01831834,"teacher_disagreement_score":0.98082924,"about_ca_system_score_codex":0.00042514343,"about_ca_system_score_gemma":0.0013570124,"threshold_uncertainty_score":0.9995948},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002880322,0.000246896,0.9873352,0.006238423,0.0007006441,0.0014794732,0.000007378323,0.0003159091,0.0007957775],"genre_scores_gemma":[0.7596041,0.00003998052,0.21705699,0.020472813,0.0026272498,0.000050890765,0.000011888325,0.000057738544,0.00007832768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996513,0.000029491544,0.0004742191,0.0013895171,0.0010013389,0.0005924099],"domain_scores_gemma":[0.9987147,0.00007408511,0.00021793021,0.00052387506,0.00018911182,0.0002803136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003923433,0.00046511414,0.00069491734,0.00067482435,0.00025212267,0.0001366884,0.0008543348,0.0003132259,0.000022973543],"category_scores_gemma":[0.00013537351,0.00044654167,0.00013968784,0.0006224122,0.0004087262,0.00017292771,0.0007603057,0.00080567464,0.000015882082],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021435485,0.00012242772,0.002048103,0.0007969835,0.0001064525,0.00036330815,0.020595368,0.00335595,0.008562326,0.0021174704,0.0010111681,0.9607061],"study_design_scores_gemma":[0.011511303,0.019290078,0.037073728,0.0153807495,0.0015827395,0.0007450083,0.00011383855,0.49417165,0.14726686,0.24212848,0.007394109,0.023341456],"about_ca_topic_score_codex":0.00007016938,"about_ca_topic_score_gemma":0.000027950744,"teacher_disagreement_score":0.93736464,"about_ca_system_score_codex":0.00057346275,"about_ca_system_score_gemma":0.00056812406,"threshold_uncertainty_score":0.99979866},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007164706,0.00044992182,0.98230803,0.0015610676,0.003799006,0.00027696832,0.0000073251017,0.00027669643,0.011249346],"genre_scores_gemma":[0.1170186,0.00012772073,0.87114686,0.007976216,0.0017766727,0.000016823658,0.000018677547,0.00009537598,0.0018230213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994408,0.00006376415,0.0006229595,0.0023732644,0.0015151495,0.0010168514],"domain_scores_gemma":[0.9962181,0.00072096934,0.00030226365,0.002217272,0.00027249256,0.00026891238],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010160177,0.0007283372,0.00071702234,0.0009053599,0.00055183197,0.0010552256,0.0045277537,0.00036322515,0.00004681055],"category_scores_gemma":[0.00015382949,0.00070251676,0.00029486927,0.0011615534,0.0007792909,0.00052410964,0.0023355295,0.0015159638,0.00007452992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000577794,0.000055937886,0.000020299254,0.000029571365,0.000017019189,0.00039190298,0.0006460935,0.017279424,0.00003417163,0.268564,0.000062512656,0.7128933],"study_design_scores_gemma":[0.00039575435,0.00038214354,0.00011511013,0.0014225648,0.000010381915,0.00018694488,7.4618805e-7,0.72107184,0.0017531549,0.267232,0.005957327,0.0014720042],"about_ca_topic_score_codex":0.0000301913,"about_ca_topic_score_gemma":0.000051285042,"teacher_disagreement_score":0.7114213,"about_ca_system_score_codex":0.00036390705,"about_ca_system_score_gemma":0.0007297407,"threshold_uncertainty_score":0.99998176},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017630262,0.00005081982,0.9935389,0.0015626001,0.0006561788,0.00049412233,0.000005367962,0.00016260527,0.0035117452],"genre_scores_gemma":[0.18002187,0.000019317215,0.8192377,0.0004542539,0.00016492611,0.0000047850754,0.000026375144,0.000020548154,0.00005023354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972059,0.000033175547,0.00072402036,0.0010109715,0.0007222515,0.00030368974],"domain_scores_gemma":[0.9982198,0.00014920637,0.00052832236,0.00063760416,0.00031437224,0.00015068699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040295196,0.00037842858,0.00045195004,0.0007489803,0.00016801452,0.00024804918,0.0011583451,0.00029163898,0.000047792248],"category_scores_gemma":[0.00008366378,0.00036753644,0.00012128402,0.0007383752,0.0004977116,0.0008335256,0.00050247373,0.00042700933,0.000013071145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009267489,0.000010169701,0.000041388354,0.000036919006,0.00000784229,0.0000065111576,0.00069339765,0.61448616,0.00020793689,0.010123121,0.000006249726,0.37437102],"study_design_scores_gemma":[0.00036946862,0.0001449672,0.00006370697,0.00018804296,0.000008641453,0.000026024145,3.0222884e-7,0.977825,0.00093138526,0.019915432,0.00014288182,0.0003841357],"about_ca_topic_score_codex":0.000024948546,"about_ca_topic_score_gemma":0.00005461707,"teacher_disagreement_score":0.37398687,"about_ca_system_score_codex":0.00030776957,"about_ca_system_score_gemma":0.0007678351,"threshold_uncertainty_score":0.99987763},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028788332,0.00008886262,0.98603696,0.002084722,0.0011785107,0.00054890703,0.000005829309,0.00048129002,0.009546108],"genre_scores_gemma":[0.2739773,0.000035545065,0.7239903,0.0007986613,0.0005354695,0.0000401047,0.000018669896,0.000040132327,0.0005637701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723566,0.000035171637,0.0005375532,0.0012139233,0.0005217734,0.00045591636],"domain_scores_gemma":[0.9982415,0.00043248685,0.00026937414,0.000596107,0.00028072702,0.00017983286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065253436,0.00041456058,0.00044524163,0.0005554277,0.0002757938,0.00045858457,0.0018117947,0.0003012723,0.00003498379],"category_scores_gemma":[0.00032760936,0.0003884865,0.00014739219,0.00034852026,0.00039650808,0.00072732975,0.00037707953,0.0009959188,0.000060759725],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018516017,0.000018420975,0.00015250337,0.000045571498,0.000016718444,0.000014705663,0.00047860396,0.00080912624,0.0008058022,0.050314642,0.00016305757,0.94716233],"study_design_scores_gemma":[0.0004249599,0.0018818716,0.000055441655,0.0012479039,0.000027594142,0.000089200264,0.0000010225101,0.5688214,0.0056922296,0.41345984,0.007164984,0.0011335821],"about_ca_topic_score_codex":0.0000067219453,"about_ca_topic_score_gemma":0.000025324376,"teacher_disagreement_score":0.94602877,"about_ca_system_score_codex":0.00027325863,"about_ca_system_score_gemma":0.00027027412,"threshold_uncertainty_score":0.9998567},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006289174,0.0002491761,0.9962004,0.00039291824,0.0016972475,0.00040797505,8.2318894e-7,0.00014242632,0.00028015513],"genre_scores_gemma":[0.12868372,0.0004207204,0.8688595,0.00052666,0.0009852214,0.00004331167,0.0000149773405,0.00004666295,0.0004192038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99405515,0.00022929789,0.0010235023,0.0023470332,0.0015288598,0.0008161373],"domain_scores_gemma":[0.99364734,0.0039087418,0.00066410424,0.001163582,0.00028626784,0.00032996607],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006641333,0.00047027346,0.0010316273,0.0016624288,0.00060938776,0.00095416565,0.003630531,0.0007709617,0.000021238293],"category_scores_gemma":[0.0037583646,0.0004466799,0.00030267035,0.0012841558,0.0011302881,0.00093585864,0.0021321678,0.0024997655,0.0000111179925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021500844,0.00002510265,0.008081738,0.000027088745,0.000028619543,0.00008821085,0.00037319653,0.034870267,0.0000047932594,0.000024859377,0.000024092054,0.95643055],"study_design_scores_gemma":[0.0007678116,0.00038883262,0.01223352,0.00021843202,0.000039685274,0.00004436056,3.419495e-7,0.9771528,0.00004512467,0.0067979903,0.0018353881,0.00047566803],"about_ca_topic_score_codex":0.000060315957,"about_ca_topic_score_gemma":0.0009454709,"teacher_disagreement_score":0.95595485,"about_ca_system_score_codex":0.00051717414,"about_ca_system_score_gemma":0.0015580169,"threshold_uncertainty_score":0.9998015},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017476282,0.00047724677,0.9934517,0.002783567,0.0003109107,0.00043138044,0.0000071981945,0.00014294579,0.0006474094],"genre_scores_gemma":[0.5233013,0.000073212585,0.4718236,0.003198623,0.0012499191,0.000036379333,0.00004516109,0.00007144614,0.00020037174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972828,0.000036055055,0.00037605906,0.0012034933,0.0006478026,0.00045380098],"domain_scores_gemma":[0.99791205,0.0007261273,0.0002448451,0.00050280715,0.0003022748,0.00031191358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038681514,0.00043489548,0.000764567,0.00043257594,0.00023798602,0.0001744972,0.0005476703,0.0002826292,0.00004513288],"category_scores_gemma":[0.00071788894,0.00036831366,0.00029154948,0.00051828905,0.00047908188,0.00014282629,0.00018470877,0.001331657,0.000022192462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017809798,0.00020640061,0.028756859,0.00027236016,0.00018665731,0.00048247268,0.0013621937,0.008755643,0.00014729581,0.011835701,0.00011473137,0.9477016],"study_design_scores_gemma":[0.00072387134,0.0028000923,0.0011465839,0.003334404,0.00042020893,0.00007097968,0.00000663177,0.89648914,0.0012855126,0.08653128,0.006149569,0.0010417078],"about_ca_topic_score_codex":0.00004625982,"about_ca_topic_score_gemma":0.000014372475,"teacher_disagreement_score":0.94665986,"about_ca_system_score_codex":0.00016874279,"about_ca_system_score_gemma":0.0002481637,"threshold_uncertainty_score":0.99987686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1280325,0.00016215566,0.86964405,0.00014063458,0.0012833962,0.00043036378,6.645445e-7,0.00029333855,0.000012921709],"genre_scores_gemma":[0.7234059,0.000019070818,0.27618778,0.0001586139,0.00017661713,0.000036067064,0.0000019837046,0.0000134008715,5.918973e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960275,0.00021489734,0.0006017292,0.0018149792,0.00064682844,0.000694025],"domain_scores_gemma":[0.9980556,0.00021118425,0.00031420193,0.0010626657,0.0002237526,0.00013260217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009678869,0.00039175875,0.00044443647,0.001189936,0.00036434564,0.00089076534,0.0020901973,0.00040685688,0.0000067661995],"category_scores_gemma":[0.00014518356,0.00042609798,0.00015306138,0.0045189904,0.00030573033,0.00064633426,0.0031645494,0.0017387961,0.0000043279174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035546136,0.00005086649,0.00083969056,0.000020851185,0.0000030995059,0.000033297452,0.00045458303,0.59394497,0.0026801336,0.000039135957,2.1499999e-7,0.40192965],"study_design_scores_gemma":[0.00021084334,0.0000672688,0.0023532491,0.00015571155,0.000004944783,0.00006958546,0.0000030047377,0.94001305,0.05402982,0.002645202,0.00002831636,0.0004190266],"about_ca_topic_score_codex":0.0011821812,"about_ca_topic_score_gemma":0.0005524095,"teacher_disagreement_score":0.5953734,"about_ca_system_score_codex":0.0009928695,"about_ca_system_score_gemma":0.0009121909,"threshold_uncertainty_score":0.9998191},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001834095,0.00014548005,0.97353697,0.002071611,0.0056249793,0.0003727222,0.0000095178575,0.000038617614,0.018016668],"genre_scores_gemma":[0.95668495,0.000012261022,0.02724131,0.00067411683,0.0021374405,0.00003593577,0.000002471394,0.000037173657,0.013174317],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962257,0.00006908903,0.000742574,0.00083259935,0.0018136688,0.0003163655],"domain_scores_gemma":[0.9940518,0.0031363938,0.0004296577,0.0013388891,0.00086301425,0.00018022551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004944475,0.00023578698,0.0003686872,0.00082489004,0.0006390318,0.00044081348,0.002921404,0.00012000021,0.000079526384],"category_scores_gemma":[0.0016410125,0.00015383006,0.000118575714,0.001767489,0.0010861929,0.00022962027,0.0007871541,0.00046882752,0.00024300485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002249216,0.000015156112,0.000057656318,0.0000015073479,0.0000051708835,0.0000015484047,0.00026562478,0.021305291,0.000049630824,0.4487345,0.0010793897,0.52846205],"study_design_scores_gemma":[0.0000952979,0.00004789013,0.00003093554,0.00004193013,0.0000046553264,0.000008394151,0.0000038653893,0.0031802119,0.00042257408,0.88266426,0.1133244,0.00017560173],"about_ca_topic_score_codex":0.000008897673,"about_ca_topic_score_gemma":0.0000811558,"teacher_disagreement_score":0.95650154,"about_ca_system_score_codex":0.00016009685,"about_ca_system_score_gemma":0.000430294,"threshold_uncertainty_score":0.6273008},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030101158,0.0001605114,0.99064606,0.0005172854,0.0059967716,0.0007237126,0.0000048554075,0.00040922116,0.0012405737],"genre_scores_gemma":[0.67508435,0.000023027558,0.31769136,0.0031826678,0.0032780583,0.000064400876,0.0000131782635,0.00008155336,0.000581427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955293,0.0000464435,0.00071882847,0.0019417808,0.0009516585,0.0008119917],"domain_scores_gemma":[0.99781317,0.0003425756,0.00042610554,0.0008408567,0.00034195778,0.0002353271],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001073966,0.0005576532,0.0005279339,0.00046980008,0.0007739992,0.0010637504,0.00204031,0.0003827646,0.000016631837],"category_scores_gemma":[0.00014691643,0.00053418486,0.00031164568,0.00089758023,0.0003672392,0.0007186635,0.0008387743,0.0007668756,0.00005899763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027555872,0.00003092495,0.0001194074,0.00007756392,0.000021599073,0.000028010047,0.00043973545,0.0785974,0.0011175129,0.018522985,0.000035738092,0.90098155],"study_design_scores_gemma":[0.0004151756,0.00055854104,0.00030462543,0.00018759427,0.000011130519,0.00004281929,1.621611e-7,0.8522027,0.004865571,0.13708767,0.0036137816,0.0007101806],"about_ca_topic_score_codex":0.000016471988,"about_ca_topic_score_gemma":0.00009118331,"teacher_disagreement_score":0.9002714,"about_ca_system_score_codex":0.00038379373,"about_ca_system_score_gemma":0.0003021724,"threshold_uncertainty_score":0.99997324},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001767314,0.001193626,0.9947421,0.0014835829,0.00027055177,0.00035156455,0.000019586907,0.00003899794,0.00013268339],"genre_scores_gemma":[0.37206194,0.000060392227,0.62557685,0.00065583846,0.0012882953,0.0000040262553,0.000026870612,0.000030364785,0.00029541488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981239,0.00003115214,0.00030041262,0.00077062484,0.00036877958,0.00040513393],"domain_scores_gemma":[0.99865055,0.00048154968,0.00017451643,0.00025814722,0.00027222195,0.00016298828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004166353,0.00032536674,0.0006170093,0.00020791881,0.00020882234,0.0000898993,0.0002345432,0.00020887768,0.0000053438853],"category_scores_gemma":[0.00029256288,0.0002860239,0.00015893858,0.00023215119,0.00055027386,0.00008718637,0.00017849478,0.00063747994,8.1585847e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008140787,0.00007931004,0.0065588197,0.0007963138,0.00022879257,0.000551976,0.004574079,0.674906,0.024595588,0.00021561893,0.0002976268,0.28638175],"study_design_scores_gemma":[0.00084073923,0.00029899483,0.00020929525,0.00091300544,0.00019502579,0.00014961115,0.00000265706,0.991794,0.00375747,0.0011855104,0.000358139,0.00029557326],"about_ca_topic_score_codex":0.000033571396,"about_ca_topic_score_gemma":0.000027718219,"teacher_disagreement_score":0.37029463,"about_ca_system_score_codex":0.00015797639,"about_ca_system_score_gemma":0.00023708079,"threshold_uncertainty_score":0.9999592},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022811171,0.0013056895,0.99403644,0.0007541858,0.0015726045,0.00018296111,0.000003414194,0.00022960908,0.0018922709],"genre_scores_gemma":[0.7668447,0.00020281575,0.22313051,0.0053319153,0.001474082,0.000020956915,0.00007500668,0.000111412664,0.0028086463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996086,0.000091143746,0.00052940607,0.0018357466,0.0010385095,0.00041921783],"domain_scores_gemma":[0.9979861,0.00035019414,0.0004247267,0.0008081096,0.00022770424,0.0002032066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042057582,0.00049418426,0.0005724938,0.00052605587,0.00026100865,0.00036430047,0.002082333,0.0003554285,0.00007793782],"category_scores_gemma":[0.000103636514,0.00047584414,0.00018852344,0.0004737246,0.0003042654,0.0008724912,0.00085340673,0.0010447572,0.00012665654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020395539,0.000034651926,0.00009000035,0.000016230435,0.00007457633,0.00008671019,0.0018434562,0.05771615,0.0056035,0.009848624,0.00078097614,0.92388475],"study_design_scores_gemma":[0.00019005509,0.00018522138,0.000062430365,0.00009389103,0.000025458432,0.0000042982037,2.5094278e-7,0.93065363,0.002885604,0.018640189,0.046612505,0.000646486],"about_ca_topic_score_codex":0.00018168284,"about_ca_topic_score_gemma":0.00018265747,"teacher_disagreement_score":0.9232382,"about_ca_system_score_codex":0.000990779,"about_ca_system_score_gemma":0.00031792867,"threshold_uncertainty_score":0.99976933},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034825083,0.000086069194,0.9611379,0.0011982754,0.0014708473,0.00056734623,0.000028253096,0.00005198619,0.0006342755],"genre_scores_gemma":[0.8125169,0.00000237227,0.18433516,0.0026007625,0.00039095114,0.000011792743,0.000026084237,0.000024005187,0.000091941525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966945,0.000055215078,0.00058722176,0.0012478179,0.0009789485,0.0004362904],"domain_scores_gemma":[0.9975348,0.0009351185,0.00031143212,0.0007786223,0.00029784406,0.00014219909],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062751764,0.00044537324,0.00044349622,0.00043056096,0.00030965332,0.0005295049,0.0019598117,0.00023742895,0.0000362802],"category_scores_gemma":[0.00007023578,0.00033955192,0.00014543829,0.0007736362,0.0005251357,0.00047432852,0.00039261035,0.000564834,0.000009543441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024287196,0.00047650596,0.00038158143,0.00013442576,0.000040163748,0.00013813571,0.0031975897,0.36157855,0.015967513,0.38667488,0.00034507792,0.2308227],"study_design_scores_gemma":[0.00036672314,0.0003609841,0.0007121571,0.000115333314,0.000006032322,0.000018680548,2.7491424e-7,0.6427134,0.009304822,0.34561437,0.00035538434,0.00043180012],"about_ca_topic_score_codex":0.000017894774,"about_ca_topic_score_gemma":0.000030490282,"teacher_disagreement_score":0.77769184,"about_ca_system_score_codex":0.00014426213,"about_ca_system_score_gemma":0.0007371891,"threshold_uncertainty_score":0.99990565},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.6077426e-7,0.00026697046,0.98896,0.0058875484,0.0007300407,0.0013981849,0.000011441265,0.00014947314,0.0025961632],"genre_scores_gemma":[0.0016153314,0.000085047606,0.99574447,0.0011962806,0.0005133125,0.000056233413,0.000012307599,0.00006057658,0.00071643095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960174,0.00005651489,0.00059449987,0.0014905578,0.0012310569,0.00060996227],"domain_scores_gemma":[0.9966363,0.0012061982,0.0002991738,0.0012368013,0.00042612938,0.00019545038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012516887,0.00046519298,0.00045468472,0.00036915214,0.0004685429,0.0010284529,0.0043103187,0.0002208847,0.000044730372],"category_scores_gemma":[0.00030174432,0.00033723866,0.0001623893,0.0008059626,0.0005644437,0.00044162397,0.0009784504,0.0006697658,0.00002303519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050224016,0.0000068540057,0.0000018505483,0.000030334071,0.000013194508,0.000006677845,0.0003201478,0.68132555,0.000006535773,0.015648339,0.000030559288,0.30260494],"study_design_scores_gemma":[0.00029110748,0.00011769309,0.0000057895145,0.00010796143,0.000012612672,0.000013339315,2.1016983e-7,0.9627813,0.000113149785,0.034681745,0.0014968988,0.0003781823],"about_ca_topic_score_codex":0.00000821759,"about_ca_topic_score_gemma":0.000021220052,"teacher_disagreement_score":0.30222675,"about_ca_system_score_codex":0.00017746942,"about_ca_system_score_gemma":0.00059036684,"threshold_uncertainty_score":0.999908},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000119340575,0.0001511793,0.99376625,0.0026693665,0.001325585,0.0013266479,0.00001689766,0.00026150947,0.00047064948],"genre_scores_gemma":[0.03291728,0.000020299354,0.961469,0.0046919202,0.0006463979,0.00013455619,0.000026619882,0.000043293978,0.000050629507],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965706,0.000030708048,0.00052889774,0.0017285451,0.0006476556,0.000493612],"domain_scores_gemma":[0.996361,0.0016724195,0.00050166965,0.00095644663,0.00034072367,0.00016771581],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029315153,0.0004777692,0.00042971215,0.00043122872,0.00034245392,0.00045503327,0.002186701,0.00021031585,0.000007959526],"category_scores_gemma":[0.00026676833,0.00048331163,0.00014194631,0.0008601943,0.0003096671,0.0011091062,0.00069946167,0.0007922414,0.000047573034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023518143,0.00002126458,0.000007164795,0.000038073053,0.000015213212,0.000013651417,0.0010270522,0.05623858,0.0006905635,0.19553064,0.00006914264,0.74632514],"study_design_scores_gemma":[0.00015742988,0.00015295608,0.000014063997,0.00018665828,0.000007876753,0.00001333889,4.0020467e-7,0.4231433,0.004028215,0.5709177,0.0010006219,0.00037743014],"about_ca_topic_score_codex":0.000003574885,"about_ca_topic_score_gemma":0.000015777277,"teacher_disagreement_score":0.7459477,"about_ca_system_score_codex":0.00041545174,"about_ca_system_score_gemma":0.0003112847,"threshold_uncertainty_score":0.9997619},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063964304,0.0012983631,0.95340675,0.04411002,0.00037588342,0.00051073893,0.00001396031,0.000038276186,0.00018204834],"genre_scores_gemma":[0.22504465,0.00063779653,0.7457503,0.019650258,0.0023886333,0.00012751132,0.00023530643,0.000104366,0.0060611796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798024,0.000028805269,0.0002942262,0.0008666967,0.0005291437,0.00030091577],"domain_scores_gemma":[0.99829566,0.0003981046,0.00017011064,0.0006424107,0.0002989965,0.00019472254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065492623,0.00026947877,0.00038953213,0.00021008786,0.00027513114,0.0003433912,0.000504101,0.000103952516,0.000032419546],"category_scores_gemma":[0.00014916451,0.00018296842,0.00025150282,0.00033746354,0.00036521495,0.00024430602,0.00015604518,0.00043134388,0.000019921801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003736583,0.000112199166,0.0005505159,0.00062239787,0.00018887829,0.00023471584,0.0017855883,0.021462595,0.0017323351,0.010243641,0.0010518547,0.9616416],"study_design_scores_gemma":[0.00030353788,0.00014695802,0.00035607186,0.0006238509,0.0002546264,0.00006009256,0.0000045167994,0.9680074,0.00094482873,0.01771637,0.011298005,0.00028374398],"about_ca_topic_score_codex":0.000006501976,"about_ca_topic_score_gemma":5.8276447e-7,"teacher_disagreement_score":0.9613579,"about_ca_system_score_codex":0.00017970004,"about_ca_system_score_gemma":0.0003664215,"threshold_uncertainty_score":0.74612355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000028738293,0.0003237506,0.9952061,0.0017158891,0.00088457606,0.0006968253,0.000023444692,0.000585866,0.0005606492],"genre_scores_gemma":[0.046471342,0.000013763985,0.9507409,0.002196962,0.00040779557,0.000039685765,0.000022738597,0.000041499672,0.00006531112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960297,0.000023942375,0.00055039366,0.0017924515,0.0009909401,0.00061257964],"domain_scores_gemma":[0.997342,0.00073294586,0.00041964615,0.00089327537,0.0004039042,0.00020823922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004909619,0.0005357037,0.0005544255,0.00053612754,0.00044483264,0.00058729894,0.0033238211,0.0002367136,0.0000111233],"category_scores_gemma":[0.0002516258,0.000503745,0.00015917512,0.0004309034,0.0007032607,0.00054809405,0.0016172816,0.0006916919,0.000020426227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043920674,0.00008829886,0.0000117693935,0.00029637027,0.000021813588,0.00012118766,0.0007257967,0.06309406,0.015707964,0.40374592,0.0004996847,0.51564324],"study_design_scores_gemma":[0.00022170396,0.00011092477,0.000005226902,0.00038302314,0.0000046955897,0.000027732563,4.563409e-8,0.6481101,0.009629805,0.33898896,0.0021155186,0.00040223566],"about_ca_topic_score_codex":0.000001406078,"about_ca_topic_score_gemma":0.0000011791197,"teacher_disagreement_score":0.5850161,"about_ca_system_score_codex":0.00036430708,"about_ca_system_score_gemma":0.000490819,"threshold_uncertainty_score":0.99974144},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039860653,0.00013226144,0.9952692,0.00029017738,0.001177494,0.0004441178,0.000005683524,0.0004164285,0.002224821],"genre_scores_gemma":[0.2867404,0.0000173483,0.7111798,0.0012001886,0.00044071113,0.000016568041,0.000006333734,0.0000469902,0.00035171476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962765,0.00006214373,0.0004255696,0.0016278451,0.0011009631,0.00050698244],"domain_scores_gemma":[0.99819714,0.0002514222,0.0003340433,0.0007037093,0.00027834694,0.00023533552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005152318,0.0005117356,0.00042123164,0.00062158186,0.00038909365,0.00052316044,0.0012569395,0.0002729405,0.000011780341],"category_scores_gemma":[0.000088970824,0.0004504768,0.00008027036,0.000870806,0.00048836746,0.0008724234,0.0005632344,0.001151661,0.000077129596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004163383,0.000037418347,0.000028459886,0.000019748888,0.000025685013,0.000139725,0.0018374629,0.04210943,0.0006012654,0.004484669,0.0000060162556,0.9506685],"study_design_scores_gemma":[0.00074015657,0.00077696925,0.0002598441,0.00019249802,0.000011613907,0.00012203188,0.0000013349742,0.99062264,0.0009591867,0.005195879,0.0006075476,0.00051028084],"about_ca_topic_score_codex":0.000018765297,"about_ca_topic_score_gemma":0.0001231159,"teacher_disagreement_score":0.9501582,"about_ca_system_score_codex":0.0003359032,"about_ca_system_score_gemma":0.0004981145,"threshold_uncertainty_score":0.9997947},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007166332,0.0000719205,0.9931824,0.005035452,0.00041899993,0.0006940127,0.0000684866,0.00012642743,0.00033064536],"genre_scores_gemma":[0.7812269,0.000058687026,0.21683833,0.0013872924,0.00030225885,0.00004654854,0.000034054454,0.000032858792,0.0000730809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972598,0.00002278209,0.00059506734,0.0011598507,0.00052165164,0.00044087655],"domain_scores_gemma":[0.99752337,0.0004696245,0.00037003163,0.0011102437,0.0003500032,0.00017675101],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005794008,0.0003572573,0.0005680006,0.0006260263,0.00015099002,0.0003042967,0.0019342655,0.00038750793,0.0000026459018],"category_scores_gemma":[0.00046909152,0.0003335986,0.00010989545,0.00071507867,0.0005633223,0.0007459955,0.0006565924,0.00047108362,0.000004549815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001540309,0.00003516401,0.0000031737213,0.000053982265,0.000014313165,0.0000057304633,0.002182288,0.011677737,0.002275921,0.33480886,0.000059487124,0.6488679],"study_design_scores_gemma":[0.0003436025,0.0008161695,0.000047797545,0.00024086483,0.000013911435,0.00002897636,0.0000018833883,0.78826225,0.0047953455,0.19701797,0.007831273,0.0005999438],"about_ca_topic_score_codex":0.00007365883,"about_ca_topic_score_gemma":0.000152365,"teacher_disagreement_score":0.7811552,"about_ca_system_score_codex":0.00019341666,"about_ca_system_score_gemma":0.00086499576,"threshold_uncertainty_score":0.9999116},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009943626,0.0003698204,0.99069136,0.0022205103,0.0046775932,0.0010532076,0.000028745086,0.00040744897,0.000541341],"genre_scores_gemma":[0.19294716,0.000054702312,0.7960577,0.0032972514,0.0072555663,0.00005395818,0.000048695132,0.00013283709,0.00015215925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953207,0.00010818711,0.0007886562,0.0021404838,0.0008844348,0.0007575705],"domain_scores_gemma":[0.9970322,0.00074059307,0.000495838,0.0009351885,0.00050818024,0.00028800202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008115285,0.00078017125,0.00076520024,0.0005059065,0.0006935871,0.0007591862,0.0019227155,0.0005291905,0.000021384361],"category_scores_gemma":[0.00024359702,0.0007433959,0.00035651744,0.0006594531,0.00071959506,0.0010072475,0.0005479179,0.00079393614,0.000024495132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024335532,0.000022244009,0.000010659489,0.000009260801,0.000052264862,0.000026052248,0.00048779446,0.8856007,0.00037728305,0.03271889,0.00075205293,0.07991846],"study_design_scores_gemma":[0.00070143654,0.0002784688,0.000016879383,0.000079682635,0.00003225552,0.000017451799,2.940351e-7,0.9643267,0.001258159,0.03054473,0.0019533536,0.0007906227],"about_ca_topic_score_codex":0.000012924354,"about_ca_topic_score_gemma":0.000113141374,"teacher_disagreement_score":0.19463372,"about_ca_system_score_codex":0.00027202454,"about_ca_system_score_gemma":0.0008109013,"threshold_uncertainty_score":0.9995017},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034441329,0.00017807324,0.9893839,0.0029789084,0.0023993666,0.000943409,0.000015726202,0.00038767364,0.00026881433],"genre_scores_gemma":[0.9211259,0.000011055363,0.074254,0.003526674,0.00073559454,0.000042942716,0.0000067022665,0.000083892606,0.00021326992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938548,0.00018688355,0.00060194416,0.0028402547,0.0017323076,0.00078380277],"domain_scores_gemma":[0.9948285,0.00040459918,0.00032798373,0.0039222143,0.0001609362,0.00035574494],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001078987,0.00080452947,0.00088534027,0.0010419176,0.00027339684,0.0012739834,0.007124531,0.00036036866,0.00000720986],"category_scores_gemma":[0.00023048976,0.00067056174,0.00014177362,0.0010787032,0.00030694518,0.0012097831,0.0017248363,0.0012873958,0.000069451795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018085155,0.002443458,0.015341981,0.00042228607,0.00015937698,0.005397864,0.37656304,0.04605121,0.0015942251,0.013276752,0.0031916273,0.5353773],"study_design_scores_gemma":[0.006105145,0.013787097,0.0053903717,0.0052953656,0.000046497993,0.00012456208,0.0001638182,0.8357934,0.006483235,0.108939014,0.008519883,0.009351638],"about_ca_topic_score_codex":0.000025477762,"about_ca_topic_score_gemma":0.00021783885,"teacher_disagreement_score":0.91768175,"about_ca_system_score_codex":0.00046637404,"about_ca_system_score_gemma":0.0005681985,"threshold_uncertainty_score":0.9997628},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008408886,0.0006847014,0.9904335,0.0064680795,0.0013604834,0.0006254891,0.000010618212,0.00012285655,0.00021017704],"genre_scores_gemma":[0.27719584,0.00029397078,0.71653104,0.0045447387,0.0011352544,0.00016296485,0.000018556893,0.00006545188,0.000052186628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966362,0.000027213637,0.00050456764,0.0014715963,0.0009481995,0.00041222834],"domain_scores_gemma":[0.9976065,0.001280817,0.0002323794,0.0004827396,0.00018638758,0.00021118492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006636264,0.00037531863,0.00043679064,0.0006865981,0.00022951385,0.00038520625,0.0014414666,0.00036823357,0.000005704003],"category_scores_gemma":[0.0004508105,0.00038179927,0.000077378754,0.0007898189,0.00042783743,0.00045454976,0.0008041669,0.0006767852,0.0000026068687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011598043,0.000049799113,0.00028058628,0.00014852286,0.000015162407,0.000035925354,0.001740778,0.1362653,0.000085918204,0.023716588,0.00015057054,0.83749926],"study_design_scores_gemma":[0.00053508615,0.00018613134,0.0009913493,0.0007405213,0.000008993223,0.00014393407,2.9882486e-7,0.9326397,0.00066910405,0.06274442,0.0008418342,0.0004986357],"about_ca_topic_score_codex":0.0000661154,"about_ca_topic_score_gemma":0.000353636,"teacher_disagreement_score":0.8370006,"about_ca_system_score_codex":0.00035284317,"about_ca_system_score_gemma":0.0006422982,"threshold_uncertainty_score":0.9998634},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1207501,0.00032488682,0.876031,0.0003786351,0.0021335396,0.00019334957,0.0000049490236,0.00007080674,0.0001127291],"genre_scores_gemma":[0.6703017,0.000009685725,0.32883167,0.00063013757,0.00019303469,0.00000921525,0.000006298345,0.000012761512,0.0000055288147],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787104,0.00015766047,0.0002829688,0.0008948027,0.00032092593,0.00047258983],"domain_scores_gemma":[0.997482,0.0013305409,0.00014666715,0.0008005607,0.00016069341,0.000079506564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007241458,0.00028800525,0.0004317081,0.0002143968,0.00018940977,0.00012865396,0.00085570774,0.00031144966,0.00007069605],"category_scores_gemma":[0.00075048115,0.00025913384,0.0000988868,0.0005191627,0.0006511482,0.00014784242,0.00148917,0.0011353521,0.0000070106594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001004285,0.00074548525,0.0033452748,0.0006602269,0.00015908126,0.0010507645,0.030431818,0.3820436,0.0030023023,0.039468735,0.000076102,0.5389162],"study_design_scores_gemma":[0.00014185837,0.00003956679,0.00037473245,0.0002835059,0.000013169568,0.000037288457,0.000004264229,0.02854937,0.016451675,0.95374745,0.000010854262,0.0003462911],"about_ca_topic_score_codex":0.000024201947,"about_ca_topic_score_gemma":0.000071110204,"teacher_disagreement_score":0.9142787,"about_ca_system_score_codex":0.00017040463,"about_ca_system_score_gemma":0.00040369108,"threshold_uncertainty_score":0.9999861},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017412627,0.00007798976,0.9812868,0.0009266831,0.00093816913,0.00031074023,0.0000064578203,0.00044630488,0.015832732],"genre_scores_gemma":[0.26536837,0.000013610378,0.73277056,0.0011681998,0.0005627731,0.000007725962,0.000015508518,0.000030037845,0.000063227075],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684227,0.000034683257,0.0005159541,0.0014090163,0.0008056437,0.00039242007],"domain_scores_gemma":[0.99833786,0.00011741669,0.0002563016,0.0008453754,0.0002772626,0.00016580673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036551658,0.00043288758,0.0004350052,0.0004683632,0.00021754733,0.00080878194,0.0024533025,0.0003109429,0.00013398496],"category_scores_gemma":[0.0001029083,0.00041030036,0.0001052249,0.00043179872,0.0005289509,0.0011717163,0.0008808371,0.000810276,0.000082268925],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053635854,0.000022804266,0.0001245899,0.000019274637,0.000013521331,0.000028706989,0.00026567624,0.00004290118,0.035109304,0.045944046,0.000024466251,0.91839933],"study_design_scores_gemma":[0.00024498455,0.0004939186,0.00030217573,0.00075017125,0.000017085875,0.000024200923,1.7469058e-7,0.46765268,0.028134193,0.50105757,0.00035401338,0.00096884643],"about_ca_topic_score_codex":0.000038925984,"about_ca_topic_score_gemma":0.000030741227,"teacher_disagreement_score":0.9174305,"about_ca_system_score_codex":0.0002450014,"about_ca_system_score_gemma":0.00020974322,"threshold_uncertainty_score":0.9998349},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019204927,0.00030935486,0.992006,0.0041094795,0.0020091343,0.0008692757,0.00009590521,0.00025432606,0.0001544808],"genre_scores_gemma":[0.2082339,0.000013749794,0.78393215,0.0021352605,0.005199254,0.000043767002,0.0003300102,0.000046313304,0.000065583605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961689,0.000057531488,0.00056272885,0.0020177239,0.00068768737,0.0005054309],"domain_scores_gemma":[0.9973319,0.00043059955,0.00040851315,0.0013277417,0.00031825615,0.0001829766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038920718,0.0005329378,0.0004861421,0.00024156025,0.000536102,0.0008437317,0.002472594,0.0003536239,0.000025999716],"category_scores_gemma":[0.00013447044,0.00052207423,0.00013461446,0.0004859235,0.00022198951,0.0005031342,0.00070739764,0.0007610358,0.000027365366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043113937,0.000009782118,0.00007527173,0.000011752624,0.000016489636,0.0000060220277,0.0002797064,0.5433257,0.005427144,0.029067658,0.0007920994,0.42098403],"study_design_scores_gemma":[0.00019857001,0.00008702354,0.0002862572,0.00004951953,0.0000121870635,0.000005475313,2.7886369e-8,0.8907131,0.003130005,0.10306461,0.0019574782,0.00049577246],"about_ca_topic_score_codex":0.00013379483,"about_ca_topic_score_gemma":0.00023549698,"teacher_disagreement_score":0.42048827,"about_ca_system_score_codex":0.00024650746,"about_ca_system_score_gemma":0.0003853143,"threshold_uncertainty_score":0.9997231},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11242693,0.00064702454,0.88122874,0.00083801075,0.0006521321,0.0011408384,0.00043766678,0.00006661055,0.0025620265],"genre_scores_gemma":[0.8505138,0.00001383819,0.1477914,0.00057917665,0.0005758028,0.000004294149,0.00046062598,0.0000123667105,0.00004868076],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989285,0.000016562333,0.00022037844,0.0005668271,0.00012963277,0.00013809669],"domain_scores_gemma":[0.9994581,0.000080815655,0.00014881349,0.00015592876,0.000116005365,0.000040365794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029277033,0.00015179274,0.00018809413,0.00006376317,0.00006726553,0.00002425222,0.00018093198,0.00015285576,0.0000012767448],"category_scores_gemma":[0.00016076419,0.00012233542,0.000050596092,0.000057236455,0.00035569884,0.0000038562875,0.0002801828,0.00012312489,8.639387e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042297837,0.000049874896,0.00007790599,0.00016768447,0.000032235417,0.000008059937,0.00011261184,0.0018335098,0.1889446,0.00044148986,0.00009537284,0.8078137],"study_design_scores_gemma":[0.005801708,0.007841038,0.0017852797,0.001247097,0.0000891811,0.00020798751,0.0000022209583,0.31435162,0.4296229,0.23316127,0.0037417924,0.002147895],"about_ca_topic_score_codex":0.000010937141,"about_ca_topic_score_gemma":0.000031204116,"teacher_disagreement_score":0.8056658,"about_ca_system_score_codex":0.000012204324,"about_ca_system_score_gemma":0.00006943246,"threshold_uncertainty_score":0.4988694},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000734752,0.000469037,0.99220896,0.00023228474,0.004113717,0.000581989,0.000010589142,0.00027040186,0.0013782877],"genre_scores_gemma":[0.88859755,0.0001672987,0.10853672,0.0006740346,0.0008197892,0.00005902556,0.000021280015,0.000058100944,0.0010661863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607766,0.000051431314,0.0006354288,0.0018308447,0.0008101517,0.00059449207],"domain_scores_gemma":[0.9979414,0.00030131635,0.00030390944,0.00085385656,0.00039714065,0.00020240151],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008118564,0.00049421925,0.00046414824,0.0008270542,0.0005046684,0.0006540712,0.001038588,0.00038499243,0.000012474226],"category_scores_gemma":[0.00021560641,0.00048605067,0.00016717376,0.00071892556,0.00041790714,0.0007828398,0.0005639432,0.0005174613,0.000012945006],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011237172,0.000050654544,0.000069570415,0.00011708347,0.000014935725,0.000023550252,0.0003563297,0.003235997,0.0038830056,0.023482796,0.000011863456,0.96874297],"study_design_scores_gemma":[0.0006875055,0.0008930459,0.0011949581,0.00046287553,0.00003979251,0.00019800752,0.0000012963794,0.8671861,0.010209864,0.11591736,0.002243707,0.00096548186],"about_ca_topic_score_codex":0.000021838343,"about_ca_topic_score_gemma":0.00023267024,"teacher_disagreement_score":0.9677775,"about_ca_system_score_codex":0.00030787865,"about_ca_system_score_gemma":0.00030539872,"threshold_uncertainty_score":0.99975914},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1468162,0.000050230472,0.84643996,0.001331872,0.00440854,0.0007997314,0.000008066525,0.0001311887,0.000014251533],"genre_scores_gemma":[0.7027834,0.0000023207444,0.2926702,0.003887104,0.0005038661,0.00012231847,0.000008476423,0.000019610698,0.0000027153956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996422,0.00021409807,0.00044868264,0.0016557749,0.00063912536,0.00062031456],"domain_scores_gemma":[0.9974644,0.0012802755,0.00032624323,0.00067233667,0.00014382366,0.00011292171],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011586222,0.00030905326,0.00030480648,0.00029726725,0.00047431118,0.00074470503,0.00086611457,0.0001373793,0.000016455067],"category_scores_gemma":[0.0014749548,0.00030956545,0.00012299736,0.0015246682,0.0003480031,0.00010370648,0.0006818935,0.0006190653,0.0000060505777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010960832,0.00004560431,0.000044566284,0.000055192893,0.0000012215825,0.000009280862,0.0006965511,0.81545573,0.0524924,0.000052411826,0.000023948545,0.13111211],"study_design_scores_gemma":[0.00022999612,0.000045143162,0.00039083138,0.00016955295,0.000004688515,0.000033530327,0.0000038319945,0.8675933,0.12946083,0.00174,0.000041791634,0.00028651208],"about_ca_topic_score_codex":0.00001506431,"about_ca_topic_score_gemma":0.00003601555,"teacher_disagreement_score":0.5559672,"about_ca_system_score_codex":0.00039516072,"about_ca_system_score_gemma":0.00044699083,"threshold_uncertainty_score":0.9999356},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044346447,0.00007940783,0.9855922,0.00048064796,0.00037273188,0.0002970919,0.0000068065533,0.00009125545,0.008645254],"genre_scores_gemma":[0.93433684,0.00002750895,0.06495213,0.00033323333,0.00013709026,0.0000026795424,0.0000066362873,0.000021385897,0.00018247351],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982122,0.00002478527,0.0002662955,0.0008891088,0.00036810816,0.0002394783],"domain_scores_gemma":[0.9990161,0.00036009442,0.00019105867,0.00028197368,0.000021896916,0.00012889403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024465582,0.0002570809,0.00020997417,0.00023667695,0.00038051442,0.00015441855,0.0002779316,0.00016212022,0.000020517944],"category_scores_gemma":[0.00010879071,0.00026040556,0.00004128539,0.0005687056,0.0008558892,0.00025624866,0.00015913496,0.00065604225,0.000036415146],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009389641,0.000008259203,0.0031800114,0.000013295155,0.0000065837435,0.0000040950313,0.0005622104,0.0035988246,0.011661261,0.0011269858,0.000049219438,0.97977984],"study_design_scores_gemma":[0.0010440242,0.00061104324,0.04694871,0.0014843608,0.00014080599,0.00044613046,0.000007980165,0.23617466,0.033862744,0.65126115,0.024266306,0.0037520789],"about_ca_topic_score_codex":0.000112404006,"about_ca_topic_score_gemma":0.00035623548,"teacher_disagreement_score":0.9760278,"about_ca_system_score_codex":0.00029765605,"about_ca_system_score_gemma":0.000035463687,"threshold_uncertainty_score":0.9999848},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013337889,0.0009980289,0.9869725,0.0024635852,0.0039542955,0.0020191069,0.00010972549,0.0005387408,0.0029306542],"genre_scores_gemma":[0.9154513,0.00002180473,0.07582658,0.005638864,0.0013195929,0.00029428062,0.000034618115,0.00014901866,0.0012639781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940141,0.00009219922,0.001045886,0.002747966,0.0011437745,0.00095611805],"domain_scores_gemma":[0.99463403,0.001002396,0.0005789537,0.0017949499,0.0015180735,0.0004715879],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001227579,0.0009791654,0.0013573017,0.000844345,0.00040571767,0.0013043131,0.0050199307,0.0006205861,0.00000739954],"category_scores_gemma":[0.0001659441,0.00096460024,0.00034759313,0.0010095082,0.00033779582,0.0011748251,0.0020272313,0.0009718473,0.00019244879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038645354,0.0000972426,0.000016122503,0.0009517035,0.000092972194,0.00006467403,0.0055477414,0.030881032,0.00015157931,0.027669357,0.00055308227,0.9339358],"study_design_scores_gemma":[0.00063824066,0.00016352152,0.00000489465,0.00095100806,0.000021654696,0.00010294934,0.0000015520643,0.96487045,0.00028899903,0.025350595,0.0065839947,0.0010221256],"about_ca_topic_score_codex":0.0001283985,"about_ca_topic_score_gemma":0.0008086028,"teacher_disagreement_score":0.9339894,"about_ca_system_score_codex":0.0006752723,"about_ca_system_score_gemma":0.002403021,"threshold_uncertainty_score":0.99973243},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056485407,0.00022774974,0.9931122,0.0042547127,0.00059898576,0.0006260231,0.000011618183,0.00018839391,0.00041543803],"genre_scores_gemma":[0.29818708,0.000076551565,0.6989749,0.002333331,0.00031322555,0.000026526828,0.000011353102,0.000026770702,0.00005023821],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975603,0.00007216194,0.00041262346,0.0011260075,0.0004790527,0.0003498482],"domain_scores_gemma":[0.9980151,0.00041334442,0.00017890029,0.0009926973,0.00022186777,0.00017808726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013346806,0.00031011598,0.0003810195,0.0003719519,0.00032616433,0.00045511898,0.001327341,0.00021501115,0.0000036467752],"category_scores_gemma":[0.00015852874,0.00030364533,0.00008474098,0.00038222547,0.00026037326,0.000504288,0.00083177915,0.00046511696,0.000016543057],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011252526,0.000012794898,0.00024567146,0.000049686805,0.0000075889893,0.0000033294139,0.001363811,0.0061834827,0.0018791035,0.0053291656,0.00003804236,0.9848761],"study_design_scores_gemma":[0.00035642498,0.00038036602,0.008784026,0.0002948899,0.000008380564,0.000019369536,5.233405e-7,0.86990136,0.00065151457,0.11705355,0.0021153772,0.0004341925],"about_ca_topic_score_codex":0.0000170983,"about_ca_topic_score_gemma":0.00004600069,"teacher_disagreement_score":0.9844419,"about_ca_system_score_codex":0.00016884031,"about_ca_system_score_gemma":0.00015204652,"threshold_uncertainty_score":0.9999416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004356181,0.00048553006,0.9962392,0.00031614432,0.0005236289,0.00025299133,0.0000061820406,0.00021999374,0.001520738],"genre_scores_gemma":[0.9568355,0.000078926096,0.042335518,0.00030808736,0.00029832358,0.000010742441,0.000015156922,0.000044213328,0.00007353457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855304,0.000011049574,0.00028067743,0.0005303121,0.00028582066,0.000339115],"domain_scores_gemma":[0.9993517,0.000119265,0.000060898237,0.00029448478,0.000062264466,0.00011140144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029290986,0.00027181476,0.00028259106,0.00010590472,0.00009159598,0.00020270518,0.00039667814,0.00015791244,0.00004571179],"category_scores_gemma":[0.000057162662,0.00026115458,0.00004943196,0.00017566592,0.00018114551,0.00017146788,0.000084737396,0.0004851068,0.00003490807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026602058,0.0000047779213,0.000011795559,0.000027351425,0.0000072993075,0.000014897441,0.00017915643,0.3417664,0.001390795,0.0014990768,0.000036268393,0.6550595],"study_design_scores_gemma":[0.0000636842,0.00010145016,0.0000051836478,0.00012689804,0.0000054608868,0.000010600617,2.3112138e-7,0.937691,0.03307744,0.02563467,0.0029389416,0.00034444465],"about_ca_topic_score_codex":0.000012712838,"about_ca_topic_score_gemma":0.00007245472,"teacher_disagreement_score":0.95639986,"about_ca_system_score_codex":0.00012888522,"about_ca_system_score_gemma":0.000059946986,"threshold_uncertainty_score":0.9999841},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019488,0.00036750257,0.99440116,0.0012023887,0.0021265955,0.000558732,0.000008345698,0.0002601666,0.0010556362],"genre_scores_gemma":[0.016909167,0.000050731654,0.9796511,0.0025198504,0.00054590014,0.000017119442,0.000008302743,0.000041364037,0.00025649322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960046,0.000030148884,0.0005799702,0.0019139064,0.000798276,0.000673107],"domain_scores_gemma":[0.9977178,0.0005545515,0.00035082028,0.00080807105,0.00031269927,0.00025603102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004837531,0.0005464998,0.000643718,0.0010177603,0.0004094299,0.0007146554,0.0022932256,0.0002532121,0.000043489345],"category_scores_gemma":[0.00029638427,0.0005100047,0.00020339768,0.0011494621,0.00042240985,0.0011326404,0.0012915906,0.0008122279,0.000029234407],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000825202,0.000021206957,0.000028040642,0.000045921537,0.000009797676,0.000011912983,0.00011525871,0.0014619391,0.00016334747,0.0040410925,0.000040683706,0.9940525],"study_design_scores_gemma":[0.00034725183,0.00020256311,0.00004483472,0.00021101032,0.000010685481,0.00004970328,1.988057e-7,0.90181255,0.0009309034,0.09187601,0.0039725997,0.0005416986],"about_ca_topic_score_codex":0.000004579862,"about_ca_topic_score_gemma":0.000007974783,"teacher_disagreement_score":0.99351084,"about_ca_system_score_codex":0.0002774386,"about_ca_system_score_gemma":0.00038200952,"threshold_uncertainty_score":0.9997352},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009342301,0.0006103013,0.99689215,0.0004456925,0.000815763,0.0005989615,0.0000067178526,0.00035127593,0.0002697868],"genre_scores_gemma":[0.015356724,0.0001751171,0.9837297,0.00019847995,0.00030183137,0.000047211157,0.0000028388047,0.000030695523,0.00015735671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976131,0.000017613542,0.0003478939,0.0012350756,0.00032281774,0.00046352806],"domain_scores_gemma":[0.99766845,0.0009793956,0.00015808965,0.0008807339,0.00018014721,0.0001331771],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044222077,0.00041938413,0.00044406785,0.00031787253,0.00025780968,0.00024989908,0.0012064086,0.00019697583,0.0000011925858],"category_scores_gemma":[0.0001964102,0.00037053984,0.000084736756,0.00029393108,0.00028260192,0.0010006267,0.00053992495,0.0002584297,0.0000039358433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075380763,0.0000055546934,0.0000016821152,0.000019713218,0.0000076972965,0.000005338525,0.00035181703,0.35670462,0.000121719626,0.026555099,0.000002176415,0.6162171],"study_design_scores_gemma":[0.00019732019,0.00033593964,0.000010719916,0.000041087867,0.0000056761887,0.000025944528,1.3344373e-7,0.50529826,0.0029539727,0.48999104,0.0008380161,0.00030187753],"about_ca_topic_score_codex":0.000005006311,"about_ca_topic_score_gemma":0.0000184463,"teacher_disagreement_score":0.6159152,"about_ca_system_score_codex":0.00035557133,"about_ca_system_score_gemma":0.0001733316,"threshold_uncertainty_score":0.99987465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033385953,0.0004108008,0.9947155,0.0013121351,0.0024041652,0.00021076598,0.00001853451,0.000043658434,0.0008510148],"genre_scores_gemma":[0.67892814,0.00016555464,0.31695202,0.0010826766,0.00252197,0.000010941015,0.000093058596,0.00002924628,0.00021637235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995546,0.000096735464,0.00064572797,0.0012060214,0.002079777,0.00042576794],"domain_scores_gemma":[0.9975098,0.0005797944,0.00035050022,0.0008574419,0.0004950274,0.00020746919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083938026,0.00041834833,0.0005954324,0.0003961148,0.00019913958,0.00033096914,0.002314493,0.0003767141,0.0003289566],"category_scores_gemma":[0.00032202492,0.00038572156,0.00018522964,0.00046766404,0.00087782944,0.0006699888,0.0012964555,0.0005658728,0.000014553169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000116549145,0.00014153948,0.00011456938,0.00005912405,0.00008416131,0.00034335122,0.00048692644,0.19076341,0.0046640383,0.06013646,0.00042909183,0.74276567],"study_design_scores_gemma":[0.00038690004,0.00009552399,0.000080959464,0.0002256952,0.000014823248,0.000032197942,1.5376071e-7,0.95005065,0.015071853,0.033101834,0.00047695707,0.0004624561],"about_ca_topic_score_codex":0.000034324436,"about_ca_topic_score_gemma":0.000102322476,"teacher_disagreement_score":0.75928724,"about_ca_system_score_codex":0.00015545674,"about_ca_system_score_gemma":0.0012418536,"threshold_uncertainty_score":0.99985945},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17471363,0.00016010462,0.8184468,0.0037787976,0.001657595,0.0010415071,0.0000029905684,0.0001923304,0.000006217998],"genre_scores_gemma":[0.5315014,0.000012984715,0.46621326,0.0019798432,0.00013726304,0.00012767862,0.0000068220356,0.000017833645,0.0000028775937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932806,0.00013727877,0.0006272513,0.0029104562,0.002058754,0.0009856799],"domain_scores_gemma":[0.99555594,0.00032262248,0.00023220314,0.0030605926,0.00037743128,0.0004512227],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0008175995,0.00062673277,0.0006465874,0.0005523329,0.00033910395,0.0018319847,0.008089147,0.00018107933,0.00001000366],"category_scores_gemma":[0.000049760994,0.00054020935,0.000108990665,0.002918908,0.00029992042,0.00057439366,0.012191328,0.0010803578,0.000025507818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008534842,0.00018657005,0.0053291544,0.00003925075,0.000020132,0.000114822404,0.0029188497,0.8096345,0.00069849344,0.00014260378,0.000023310125,0.1808838],"study_design_scores_gemma":[0.0011928421,0.0006498663,0.0422215,0.0015015007,0.000029632283,0.00024079258,0.000019589314,0.924979,0.018943291,0.007467997,0.00032167544,0.0024323673],"about_ca_topic_score_codex":0.000059380884,"about_ca_topic_score_gemma":0.00025264407,"teacher_disagreement_score":0.3567878,"about_ca_system_score_codex":0.00056886516,"about_ca_system_score_gemma":0.00052722346,"threshold_uncertainty_score":0.99970496},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011423022,0.000099609606,0.9936672,0.0006115572,0.0010138963,0.00024874264,0.0000020421976,0.00013468672,0.0030799916],"genre_scores_gemma":[0.9342227,0.000013795792,0.065127626,0.00043025415,0.00013699508,0.000009165407,0.000004049146,0.000012567771,0.000042869513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978225,0.000027043574,0.00054614176,0.00078605313,0.0004735326,0.0003447229],"domain_scores_gemma":[0.9988827,0.00013468995,0.00023181179,0.000505175,0.00012365484,0.0001219746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053967943,0.00029557338,0.00034133845,0.0010447403,0.00019356476,0.00085533934,0.001127558,0.00011188232,0.0000049115765],"category_scores_gemma":[0.00003089248,0.00028408764,0.00006450672,0.00063573447,0.00012489055,0.0015837711,0.0009847202,0.0006558897,0.00003260935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012356896,0.00002655785,0.00047089078,0.0004440305,0.000024381707,0.00018246728,0.017311698,0.0062700203,0.0005788875,0.42519423,0.000014883063,0.5494696],"study_design_scores_gemma":[0.00032444487,0.00004596706,0.0007133476,0.00086560607,0.000007163365,0.00017778002,0.000005762446,0.96380186,0.0015687367,0.03123985,0.0006842036,0.00056526443],"about_ca_topic_score_codex":0.000047083995,"about_ca_topic_score_gemma":0.00021146903,"teacher_disagreement_score":0.95753187,"about_ca_system_score_codex":0.0004053296,"about_ca_system_score_gemma":0.00014320442,"threshold_uncertainty_score":0.99996114},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051527224,0.0029642545,0.99032974,0.0004507666,0.00020046464,0.00035388695,0.00009451637,0.00009586704,0.00035776175],"genre_scores_gemma":[0.3922822,0.0006279033,0.6034699,0.0010568094,0.0016385368,0.00015325319,0.000044171094,0.0000991159,0.00062812294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828434,0.0000068514155,0.00030744984,0.0006007418,0.0004024852,0.00039811886],"domain_scores_gemma":[0.99849296,0.00028715798,0.00024069622,0.0007893824,0.00009898174,0.0000908035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021044219,0.000338733,0.00030155113,0.00008202982,0.00030778363,0.00005369656,0.0008056363,0.00021217258,0.00029226334],"category_scores_gemma":[0.000027744483,0.00023086817,0.000079924146,0.00013223368,0.00050254347,0.00010199513,0.00051400583,0.0006580339,0.000007425512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036912046,0.00014765184,0.0013125737,0.00026808353,0.0000744751,0.000042086805,0.00050579134,0.2322043,0.06705566,0.0185085,0.00003304561,0.67981094],"study_design_scores_gemma":[0.00033868777,0.000039752267,0.00006354623,0.0018414083,0.00013109176,0.000114492126,1.7359085e-7,0.5814369,0.22809958,0.17947558,0.0071379947,0.0013208423],"about_ca_topic_score_codex":0.00022395965,"about_ca_topic_score_gemma":0.00004723951,"teacher_disagreement_score":0.6784901,"about_ca_system_score_codex":0.00025559403,"about_ca_system_score_gemma":0.00018866341,"threshold_uncertainty_score":0.9414531},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002715899,0.0005394129,0.99249804,0.0007711185,0.0019782751,0.00077927375,0.00016018648,0.00014302389,0.0028590949],"genre_scores_gemma":[0.88830805,0.000059577094,0.10111948,0.008036873,0.0019073067,0.000044043427,0.00025020426,0.00012717245,0.0001472691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964845,0.00009487101,0.00045366865,0.0013949155,0.0009654937,0.00060651056],"domain_scores_gemma":[0.9985187,0.00021696473,0.00018534795,0.0007398177,0.00007595666,0.0002631995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066381437,0.00053740735,0.0005120824,0.00036052446,0.000427945,0.00058986974,0.002115196,0.00022485938,0.00005255606],"category_scores_gemma":[0.000027554854,0.0004131892,0.00016040578,0.00041566987,0.00042879398,0.00029174858,0.0004555142,0.00089648116,0.00013867118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002809794,0.00037318826,0.00013234315,0.00019105773,0.00013165717,0.00081604783,0.005495926,0.024686081,0.004777131,0.007016463,0.010201034,0.9458981],"study_design_scores_gemma":[0.000864701,0.000731844,0.0015768022,0.00036176937,0.00007474158,0.0028916998,0.000004970949,0.94600713,0.0006874815,0.01577018,0.029218122,0.0018105404],"about_ca_topic_score_codex":0.00006026373,"about_ca_topic_score_gemma":0.000048377824,"teacher_disagreement_score":0.94408756,"about_ca_system_score_codex":0.00013709503,"about_ca_system_score_gemma":0.00010705181,"threshold_uncertainty_score":0.999832},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001419997,0.0018115457,0.99428785,0.0001633703,0.0020766216,0.00026855594,0.000054702195,0.00015895981,0.0011641887],"genre_scores_gemma":[0.0019793664,0.00016719177,0.9957023,0.00085401745,0.0007915375,0.000004626642,0.00008598459,0.000030888503,0.00038407615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953205,0.000057556364,0.00043583463,0.0025952167,0.0009024704,0.0006884225],"domain_scores_gemma":[0.9946761,0.00030235955,0.0002507814,0.004387595,0.00013534646,0.0002478142],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0008925715,0.00052984076,0.0005190316,0.00058385334,0.00031324115,0.00085216016,0.010229356,0.00033066227,0.000018247845],"category_scores_gemma":[0.00009433498,0.00042935627,0.000042308384,0.0006638051,0.00079507515,0.001795209,0.012691494,0.00084346184,0.000017925408],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021125409,0.000017169437,0.00002649177,0.000029131445,0.000007112194,0.00007355937,0.0003517766,0.0002649112,0.000014365543,0.0032189535,0.0007949498,0.99519944],"study_design_scores_gemma":[0.00025203332,0.00011317175,0.00053732964,0.00022367339,0.0000090882095,0.00017444995,1.1247744e-7,0.7326692,0.00023928905,0.25144893,0.013606607,0.00072611164],"about_ca_topic_score_codex":0.000078292076,"about_ca_topic_score_gemma":0.0000370273,"teacher_disagreement_score":0.99447334,"about_ca_system_score_codex":0.00012553624,"about_ca_system_score_gemma":0.000978766,"threshold_uncertainty_score":0.9998158},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001017,0.00032827075,0.9931002,0.00031054986,0.0007990477,0.00037619178,0.0000057027537,0.000451038,0.0045272703],"genre_scores_gemma":[0.71277165,0.000044532837,0.28529385,0.00076599605,0.0007620632,0.000017403065,0.000052362404,0.00015984631,0.0001323129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980533,0.000013155283,0.0003551414,0.00066471286,0.0005569767,0.00035672562],"domain_scores_gemma":[0.9990301,0.00015115326,0.000121627905,0.0003994126,0.00015939272,0.00013829756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018124258,0.00043248525,0.000360301,0.00039588782,0.00020000464,0.00036390006,0.00053784077,0.00021553095,0.00004961591],"category_scores_gemma":[0.00003420268,0.0003961187,0.00006226052,0.0005854271,0.00018447787,0.00027168682,0.00013619439,0.0007013173,0.00003317626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028141833,0.000003027718,0.00023870316,0.00018183562,0.000011136063,0.000023359597,0.0020794969,0.8902139,0.000035618657,0.0006465649,0.000018059969,0.10654549],"study_design_scores_gemma":[0.00024335195,0.00013375895,0.0000647265,0.0012506064,0.000011682335,0.000024507477,0.0000017702768,0.99169767,0.0003829085,0.003125139,0.0024144833,0.0006493695],"about_ca_topic_score_codex":0.000012841448,"about_ca_topic_score_gemma":0.00009628579,"teacher_disagreement_score":0.71266997,"about_ca_system_score_codex":0.00020520062,"about_ca_system_score_gemma":0.00013158393,"threshold_uncertainty_score":0.9998491},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000052882924,0.00018553443,0.99575615,0.0015029615,0.0006208707,0.00045522096,0.0000075948524,0.0003993995,0.0010669604],"genre_scores_gemma":[0.07078322,0.00002280324,0.9262636,0.002406515,0.00036197432,0.000010562507,0.000016214584,0.00004871731,0.00008641315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662906,0.00006314244,0.0005278384,0.0014274181,0.0008899692,0.00046257916],"domain_scores_gemma":[0.997857,0.00024015464,0.0004092653,0.0009325005,0.0003943535,0.00016675153],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046745836,0.00052657694,0.0004905517,0.00064392475,0.0003163365,0.000884075,0.0022958145,0.00027481053,0.000020452926],"category_scores_gemma":[0.00013396754,0.0004807278,0.00013460388,0.0010259814,0.0005355196,0.0008110297,0.0007912585,0.0006376858,0.000022086548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053560205,0.00013405202,0.00005819509,0.0004486273,0.000054563585,0.00038787792,0.0027419222,0.023406647,0.1664758,0.03627321,0.000070857626,0.76989466],"study_design_scores_gemma":[0.0001572363,0.00009347289,0.000019177802,0.00018832073,0.000008317103,0.000015761536,1.2056506e-7,0.90032244,0.06883077,0.029472848,0.00034027034,0.0005512774],"about_ca_topic_score_codex":0.000020176149,"about_ca_topic_score_gemma":0.0000132308,"teacher_disagreement_score":0.87691575,"about_ca_system_score_codex":0.00038713185,"about_ca_system_score_gemma":0.00063490635,"threshold_uncertainty_score":0.99976444},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033150986,0.00018776984,0.9591896,0.004855783,0.0020299433,0.0001913437,0.000005827727,0.00031226658,0.000076491444],"genre_scores_gemma":[0.68129754,0.0000066348457,0.313074,0.005243734,0.0003607218,0.000005638587,0.0000017966152,0.000009491274,4.769675e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641407,0.0000729597,0.0003896113,0.001480468,0.0008694347,0.0007734635],"domain_scores_gemma":[0.9979496,0.00039237982,0.00010799212,0.001061047,0.00012728122,0.00036172266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044470836,0.00032252708,0.00034948473,0.00027188467,0.00036230372,0.00084040646,0.004229282,0.00011025183,0.000046400866],"category_scores_gemma":[0.00018349843,0.00031146928,0.00012544174,0.0037597667,0.0006412566,0.0011368429,0.00137225,0.0005502696,0.00006564194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021366639,0.00022196345,0.0038984576,0.000019820096,0.000024093035,0.0003040125,0.0073817447,0.21771845,0.00426801,0.006665293,0.000114029834,0.75936276],"study_design_scores_gemma":[0.0003715292,0.00016877642,0.0029946954,0.00003638751,0.0000029979026,0.000011854831,0.0000011019353,0.93806845,0.0049535027,0.052492905,0.00046565963,0.00043213725],"about_ca_topic_score_codex":0.00016480441,"about_ca_topic_score_gemma":0.000053017335,"teacher_disagreement_score":0.7589306,"about_ca_system_score_codex":0.00011215279,"about_ca_system_score_gemma":0.00027454967,"threshold_uncertainty_score":0.9999337},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10649944,0.000025109099,0.8904832,0.00068525673,0.0011721293,0.0008152865,0.000015637821,0.00008813349,0.00021577739],"genre_scores_gemma":[0.574,0.000001261031,0.42498773,0.00068940787,0.0002800717,0.000012692758,0.00000815118,0.000017512848,0.0000031491852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653894,0.00004242271,0.00037372028,0.0016372055,0.0006707039,0.0007370105],"domain_scores_gemma":[0.9980888,0.00023136035,0.0001538218,0.0012343284,0.00006363573,0.00022810356],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007281775,0.00037179483,0.0003382231,0.00020318804,0.0005384321,0.0005295869,0.0017219692,0.0002659461,0.000071295945],"category_scores_gemma":[0.00012163997,0.00034148147,0.00011806782,0.000895262,0.0010811097,0.00019802482,0.0022155805,0.00050504995,0.000051331852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005592829,0.000014022895,0.0001713548,0.000010228233,0.0000027750505,0.0000011761786,0.0016422966,0.7053826,0.002385725,0.000018110148,0.000036245863,0.2903299],"study_design_scores_gemma":[0.00012665497,0.00004677497,0.0026819794,0.000058321086,0.000007903023,0.0000105369145,8.558091e-7,0.8812263,0.010467856,0.104601026,0.00037927544,0.00039251748],"about_ca_topic_score_codex":0.0004628004,"about_ca_topic_score_gemma":0.0007113144,"teacher_disagreement_score":0.4675006,"about_ca_system_score_codex":0.00046412574,"about_ca_system_score_gemma":0.00013751083,"threshold_uncertainty_score":0.99990374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054207875,0.00041560913,0.89239466,0.00585972,0.0006643292,0.00046676106,0.00001701051,0.00009667165,0.09954317],"genre_scores_gemma":[0.99254173,0.0000298752,0.0053981435,0.0007399977,0.00095166545,0.000003440765,0.000004755129,0.000011474417,0.0003189342],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983506,0.000026283857,0.00026565,0.0004161064,0.0006162649,0.00032510227],"domain_scores_gemma":[0.99911344,0.00015838415,0.00020955464,0.00028933666,0.0001194645,0.00010978994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043643638,0.00016204598,0.00027094278,0.00029841845,0.00023114598,0.000110652,0.0009606292,0.00018636034,0.000054341916],"category_scores_gemma":[0.00025208984,0.00014793374,0.00007848902,0.00041618827,0.0008684272,0.00032323724,0.00019673927,0.00028303795,0.000021890333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016519496,0.00001141586,0.000062691244,0.000025769963,0.0000073920364,0.000011274996,0.011511748,0.00046558434,0.00027962076,0.1544248,0.000008176489,0.833175],"study_design_scores_gemma":[0.0030772244,0.0008846641,0.006917418,0.0013328115,0.00014879969,0.00002024352,0.00010879403,0.10543398,0.010965953,0.8025997,0.06461925,0.0038911668],"about_ca_topic_score_codex":0.0010837346,"about_ca_topic_score_gemma":0.0007860828,"teacher_disagreement_score":0.9919996,"about_ca_system_score_codex":0.00014420062,"about_ca_system_score_gemma":0.00082584145,"threshold_uncertainty_score":0.6032563},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036962755,0.0002364432,0.9574862,0.0032994098,0.00061794015,0.00068298937,0.000013396424,0.0006890685,0.000011801478],"genre_scores_gemma":[0.73023033,0.00001767326,0.2683828,0.0007910529,0.00042573758,0.000012289355,0.00001467678,0.00005578766,0.0000696818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952938,0.0001632692,0.00044348792,0.002049997,0.0014605535,0.00058891845],"domain_scores_gemma":[0.9956376,0.00195168,0.00017256057,0.0015614429,0.0001746662,0.0005020665],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006926468,0.00059939706,0.0006698315,0.0006757606,0.00024765945,0.00229709,0.002784776,0.00027496333,0.000009880788],"category_scores_gemma":[0.0005875687,0.00043555407,0.000114038965,0.00080054527,0.0004445771,0.0021682668,0.0023702728,0.0011296101,0.000007660599],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057306184,0.0003542047,0.2869737,0.00022275548,0.00008222147,0.00059732626,0.0073106973,0.016332533,0.0002529078,0.0009089267,0.0001700118,0.6867374],"study_design_scores_gemma":[0.0010402664,0.0028704223,0.3665863,0.00033248967,0.0000209243,0.00010986646,0.0000043570135,0.56186646,0.00057263055,0.06360925,0.00075415464,0.0022328643],"about_ca_topic_score_codex":0.00003494224,"about_ca_topic_score_gemma":0.000055626784,"teacher_disagreement_score":0.6932676,"about_ca_system_score_codex":0.00015761706,"about_ca_system_score_gemma":0.00053395284,"threshold_uncertainty_score":0.9998096},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000047151607,0.000021518072,0.94565386,0.004376013,0.00026895362,0.048172873,0.000004687335,0.0003878133,0.0011095664],"genre_scores_gemma":[0.012320288,0.0000015100678,0.9269336,0.0024074866,0.00047446208,0.057618722,0.0000052656947,0.000053568845,0.00018510174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648,0.000023506576,0.0005977124,0.0017713652,0.0005032827,0.00062412844],"domain_scores_gemma":[0.997117,0.00036947444,0.00039788726,0.0017412995,0.00022707641,0.00014726819],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006804508,0.00047501153,0.00046899045,0.00044672497,0.0003832509,0.00044625482,0.0062007946,0.00040679716,0.000013365623],"category_scores_gemma":[0.00017675536,0.00044062466,0.0001403099,0.0005722751,0.0004285434,0.000381224,0.003610301,0.0008985316,0.000018577623],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011946899,0.00006379294,0.000069908434,0.00021942299,0.000019326555,0.000019241706,0.0008017819,0.001047494,0.00019137382,0.117912464,0.00032026507,0.879323],"study_design_scores_gemma":[0.0004513664,0.00021189982,0.000016623871,0.00034011542,0.0000042937327,0.000017376831,1.1786918e-7,0.56072146,0.0025810548,0.39598054,0.03917731,0.000497836],"about_ca_topic_score_codex":0.0000064010515,"about_ca_topic_score_gemma":0.000013355177,"teacher_disagreement_score":0.8788251,"about_ca_system_score_codex":0.00019129776,"about_ca_system_score_gemma":0.00034710567,"threshold_uncertainty_score":0.99980456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005703608,0.0005541271,0.9929135,0.00247265,0.0006284315,0.00087838876,0.0000091630845,0.00034262484,0.0021441078],"genre_scores_gemma":[0.4678721,0.000029191602,0.5267231,0.0037979498,0.0006236732,0.00007836779,0.000030550975,0.000096387805,0.0007486834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99510306,0.000054213582,0.0006712917,0.0020655363,0.0010603378,0.0010455456],"domain_scores_gemma":[0.9973368,0.0005732714,0.00033627893,0.0009067508,0.00055409246,0.00029279597],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008460571,0.00068997,0.0007147325,0.00052529445,0.0008334944,0.0010722919,0.0026184036,0.00027707705,0.000020910917],"category_scores_gemma":[0.00011463641,0.00063419744,0.00016404584,0.00071382255,0.00084724004,0.0020131385,0.0011801698,0.0011258563,0.00003592864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043186305,0.000031673153,0.000024674697,0.0000878091,0.000024887844,0.000177476,0.0045264154,0.5484955,0.0005061543,0.36838502,0.00001802898,0.077679224],"study_design_scores_gemma":[0.00024431877,0.0007331063,9.353836e-7,0.0002975629,0.0000122668325,0.000058699745,0.0000050668605,0.86901855,0.010512154,0.11628764,0.002115586,0.0007141034],"about_ca_topic_score_codex":0.00006196155,"about_ca_topic_score_gemma":0.00006739993,"teacher_disagreement_score":0.46781507,"about_ca_system_score_codex":0.00037761152,"about_ca_system_score_gemma":0.00067505596,"threshold_uncertainty_score":0.9999647},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000078016514,0.000053034513,0.99026096,0.0018978681,0.0008377611,0.00027982303,0.0000011914689,0.00025186184,0.0063395076],"genre_scores_gemma":[0.45374575,0.000061023176,0.53922653,0.0039451243,0.002528323,0.0000230742,0.000030418301,0.000056567023,0.00038318746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972812,0.00003952495,0.00033539676,0.0011858656,0.00074588583,0.0004121622],"domain_scores_gemma":[0.9985656,0.0002058243,0.00026901814,0.0006262639,0.00016216227,0.00017113732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035464822,0.00034012395,0.00030869394,0.0003564924,0.00035208353,0.0005460557,0.0012187293,0.00022309454,0.000025137102],"category_scores_gemma":[0.000026700667,0.00029494846,0.00006959825,0.000615327,0.0003365687,0.0007531972,0.0003432922,0.0009837305,0.0000921271],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014594551,0.000016711021,0.000036036796,0.000026750029,0.000011971377,0.000047245885,0.0003025548,0.01655083,0.00017398038,0.042244703,0.000069387854,0.94050527],"study_design_scores_gemma":[0.00029855815,0.0003554939,0.00060385343,0.00047500947,0.000013851301,0.00010742871,2.9094446e-7,0.8170296,0.0006055708,0.17357506,0.0062488625,0.000686428],"about_ca_topic_score_codex":0.0000035382322,"about_ca_topic_score_gemma":0.000036877256,"teacher_disagreement_score":0.9398188,"about_ca_system_score_codex":0.00019714558,"about_ca_system_score_gemma":0.00038026384,"threshold_uncertainty_score":0.9999503},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036238052,0.0005601214,0.9947295,0.0005489942,0.0019919397,0.00032146412,9.1502534e-7,0.00016775275,0.0013168993],"genre_scores_gemma":[0.21643388,0.0000755897,0.78140146,0.0013951622,0.0004919449,0.000014056773,0.000004319533,0.000054058677,0.00012950465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651074,0.00011600542,0.0005453865,0.0015929108,0.00070247706,0.00053248013],"domain_scores_gemma":[0.9984663,0.00027943662,0.00037203537,0.00063677697,0.00013311303,0.00011232778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008025284,0.00043631325,0.0004671305,0.0009874946,0.00021480079,0.0003118231,0.0017012705,0.00031091576,0.000021878783],"category_scores_gemma":[0.00011616763,0.00047177888,0.00008725586,0.00087264384,0.00045521578,0.00084185274,0.0011186798,0.0013081105,0.000028232276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012614998,0.000011731525,0.0008350949,0.000047131092,0.0000039434317,0.00025862563,0.00146806,0.14722611,0.0038090013,0.0010777627,0.0000044929466,0.8452454],"study_design_scores_gemma":[0.00031246754,0.00018699701,0.0011767903,0.00022408566,0.000007431914,0.00017111763,6.3502193e-7,0.9551868,0.0025446117,0.039068192,0.00049647,0.0006244348],"about_ca_topic_score_codex":0.000049695085,"about_ca_topic_score_gemma":0.00009751441,"teacher_disagreement_score":0.844621,"about_ca_system_score_codex":0.0013628376,"about_ca_system_score_gemma":0.0003575792,"threshold_uncertainty_score":0.9997734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21369655,0.0006068752,0.78344494,0.0007720436,0.0012489576,0.00016771158,0.0000040321333,0.00004927328,0.000009634606],"genre_scores_gemma":[0.6061254,0.00003219681,0.39340886,0.00030951368,0.000104765335,0.0000062559598,0.00000768594,0.0000046640776,6.3561725e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971375,0.00010727175,0.00046287835,0.0012339322,0.00070307596,0.0003553679],"domain_scores_gemma":[0.9980667,0.00037703212,0.00025151385,0.0008156498,0.00036824567,0.00012085146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009951143,0.0002885361,0.00042119573,0.00060943555,0.00012799019,0.00064319896,0.0014729482,0.00016973747,0.0000052096375],"category_scores_gemma":[0.00022674253,0.00027723325,0.000092275564,0.0016087912,0.00029474174,0.0005361752,0.003493907,0.0004615236,0.0000011333536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003377122,0.00005649955,0.0007905457,0.00009456353,0.000010452905,0.00002913755,0.0044392175,0.5510899,0.0025687688,0.00074915215,0.000010810516,0.44015756],"study_design_scores_gemma":[0.00017664321,0.00008041206,0.006292778,0.00023303044,0.0000050450826,0.000052343094,0.0000023538062,0.9405856,0.023966514,0.02828064,0.000017341497,0.00030726878],"about_ca_topic_score_codex":0.000059430844,"about_ca_topic_score_gemma":0.000057906454,"teacher_disagreement_score":0.4398503,"about_ca_system_score_codex":0.00009112666,"about_ca_system_score_gemma":0.00065430463,"threshold_uncertainty_score":0.999968},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053633784,0.00015338318,0.99133986,0.0032718664,0.0011472096,0.0028123658,0.00007329565,0.0006333239,0.0000323395],"genre_scores_gemma":[0.4080568,0.000040595645,0.58908725,0.0011181488,0.00022354748,0.0012725223,0.0001812063,0.000018724653,0.0000012231658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949814,0.00015276327,0.0007095809,0.002636514,0.00078910287,0.00073060294],"domain_scores_gemma":[0.99388087,0.00080151024,0.00045681177,0.0035071145,0.0011684169,0.00018529235],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012724075,0.00048535256,0.00053648517,0.0007049759,0.00039083257,0.0015062394,0.0048154863,0.0004530985,0.0000033078816],"category_scores_gemma":[0.00033978326,0.0005106222,0.00016825073,0.0024120281,0.000519861,0.0008912623,0.0029232425,0.0009070012,0.000011112116],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005491378,0.00017890899,0.00018728265,0.00013414258,0.000013898707,0.0000062287368,0.0015523691,0.015507465,0.0123127615,0.0050172433,0.00008501108,0.9649992],"study_design_scores_gemma":[0.00021662135,0.00003830107,0.002242751,0.00017012276,0.000008246116,0.000015356725,0.000003941255,0.9036957,0.07006491,0.022437068,0.0005514204,0.00055554905],"about_ca_topic_score_codex":0.00003071331,"about_ca_topic_score_gemma":0.000038238344,"teacher_disagreement_score":0.9644436,"about_ca_system_score_codex":0.0006341061,"about_ca_system_score_gemma":0.0014210202,"threshold_uncertainty_score":0.9997345},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007706627,0.00023210287,0.99549377,0.00020484111,0.0019788567,0.0013161205,0.000005363841,0.0003510759,0.00034078042],"genre_scores_gemma":[0.016904607,0.000048429858,0.98037803,0.00094562396,0.0010040922,0.00008842195,0.000006611996,0.000055083743,0.0005691009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611986,0.0000290364,0.0005451449,0.0019374789,0.00060246594,0.0007660323],"domain_scores_gemma":[0.9967343,0.0006223251,0.00041897607,0.0015551948,0.00049275847,0.00017641074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048939796,0.0005519692,0.00050920324,0.0005590127,0.0005817561,0.00034242138,0.002575487,0.00036133608,0.000014892623],"category_scores_gemma":[0.0001395679,0.00051857595,0.00016628152,0.0006664967,0.00065964827,0.00051503023,0.0009784854,0.0005561203,0.00008064784],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000131085635,0.000030959363,0.0000073735987,0.000022382177,0.0000072203848,0.000010867127,0.00034407378,0.020228945,0.0019138914,0.0017054058,0.000015234279,0.97570056],"study_design_scores_gemma":[0.00039346598,0.00029176218,0.000041909,0.00011282176,0.000009623157,0.00006686332,1.5404368e-7,0.94488174,0.0062232055,0.042904772,0.0044659493,0.0006077243],"about_ca_topic_score_codex":0.00000824189,"about_ca_topic_score_gemma":0.0002718933,"teacher_disagreement_score":0.9750928,"about_ca_system_score_codex":0.00030901586,"about_ca_system_score_gemma":0.00016860943,"threshold_uncertainty_score":0.9997266},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060614773,0.00030962363,0.9954927,0.00051115337,0.0018653644,0.0005093716,0.00003044026,0.00020925069,0.001011494],"genre_scores_gemma":[0.1451394,0.000069711845,0.8533977,0.0007130169,0.00046604025,0.000008741169,0.000039896757,0.000046206223,0.00011929141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961911,0.00003685236,0.0007042499,0.0016239509,0.0008621243,0.0005817528],"domain_scores_gemma":[0.99720293,0.00071793026,0.00047475257,0.0011590798,0.00027179005,0.00017352746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069046055,0.0004934924,0.00065594446,0.0005023744,0.00026442736,0.0002948293,0.002846617,0.00033449594,0.000017588154],"category_scores_gemma":[0.00015954151,0.00047641454,0.00021208345,0.0005337308,0.0004484993,0.0005283922,0.0009751805,0.0006915076,0.000014403008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001860571,0.000026349286,0.00001071505,0.00014938123,0.000013713664,0.000030391822,0.001331067,0.059403066,0.00079410383,0.007523025,0.00015632996,0.93054324],"study_design_scores_gemma":[0.0003694715,0.00025533893,0.00005506794,0.00056778215,0.000012698717,0.000040136412,0.000001866637,0.9615081,0.00032810742,0.035277292,0.0009875769,0.0005965373],"about_ca_topic_score_codex":0.000013695484,"about_ca_topic_score_gemma":0.00003890294,"teacher_disagreement_score":0.9299467,"about_ca_system_score_codex":0.0001968861,"about_ca_system_score_gemma":0.00033683827,"threshold_uncertainty_score":0.99976873},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4546287,0.0000052647365,0.5437853,0.00071187806,0.00069421873,0.00012430451,4.861424e-7,0.00003603847,0.000013845868],"genre_scores_gemma":[0.9922023,0.0000058917203,0.005290514,0.0023900701,0.000095378455,0.0000051553843,7.593646e-7,0.000009221826,7.256862e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983488,0.00004718954,0.00019761818,0.000656746,0.00035383235,0.0003958593],"domain_scores_gemma":[0.9993663,0.0002105785,0.00005512685,0.0002776685,0.00002945871,0.00006088752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025215695,0.00013617947,0.00012341366,0.00034359362,0.00014469247,0.000141776,0.00045960426,0.00002974853,0.0000062175754],"category_scores_gemma":[0.00046998987,0.0001207243,0.000024215138,0.0025058975,0.00025769067,0.0003702914,0.0001532678,0.00024115916,0.000017748507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049780892,0.000054939705,0.001233912,0.0000049490914,1.2855645e-7,0.00004312158,0.00014488194,0.8613119,0.08110948,0.0010519996,1.8018618e-7,0.055039525],"study_design_scores_gemma":[0.000588384,0.00009779979,0.006128505,0.000038789094,8.3139184e-7,0.000044171073,2.0685826e-7,0.91298294,0.051259927,0.028701443,0.0000037633763,0.00015322099],"about_ca_topic_score_codex":0.000088366265,"about_ca_topic_score_gemma":0.00037153257,"teacher_disagreement_score":0.53849477,"about_ca_system_score_codex":0.00022936385,"about_ca_system_score_gemma":0.0001508175,"threshold_uncertainty_score":0.4922994},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026851083,0.00027613607,0.9965102,0.00023303126,0.00019003078,0.00034699772,0.000006346544,0.000059772145,0.0021089609],"genre_scores_gemma":[0.86190635,0.0000049983014,0.13589285,0.00053525623,0.0015028034,0.000008098251,0.000021362877,0.000043190936,0.00008510058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768144,0.000074427946,0.00049335114,0.00065854826,0.00055296527,0.0005392743],"domain_scores_gemma":[0.998669,0.000304039,0.00022892367,0.00054190896,0.000110549474,0.00014557963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005607234,0.00044239173,0.00070127955,0.0007954718,0.0002747351,0.0002939405,0.0013740844,0.00011628817,0.00013236186],"category_scores_gemma":[0.000008795555,0.0004564046,0.00017674261,0.0017085046,0.00023507154,0.00014480119,0.00091636035,0.00093025324,0.000006893225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012534424,0.00001428312,0.001051718,0.000008717522,0.000028261911,0.0000070014717,0.0008519916,0.4331151,0.0000079930505,0.013242673,0.00014055324,0.55151916],"study_design_scores_gemma":[0.00016477639,0.000044780416,0.00016631548,0.0002690491,0.000035091096,8.6450825e-7,0.0000014800493,0.8478143,0.000029798775,0.14958428,0.00135672,0.00053249596],"about_ca_topic_score_codex":0.00090524857,"about_ca_topic_score_gemma":0.00056511856,"teacher_disagreement_score":0.86163783,"about_ca_system_score_codex":0.00033790758,"about_ca_system_score_gemma":0.00033732466,"threshold_uncertainty_score":0.99978876},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072781935,0.00010617446,0.9246916,0.00028342986,0.0013506035,0.00016060389,0.000001049348,0.000060364968,0.0005642191],"genre_scores_gemma":[0.8172208,0.000046031688,0.18211582,0.0005178467,0.00005364116,0.0000043050254,0.0000010190005,0.000008266038,0.000032279837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633116,0.00019482066,0.000555205,0.0009812664,0.0014244348,0.00051311916],"domain_scores_gemma":[0.9980826,0.00051704684,0.00022870823,0.00063643366,0.00039267793,0.00014256148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003662117,0.00019581484,0.0002508579,0.00075387687,0.0003443451,0.00057217706,0.0009933381,0.000107419575,0.00013622994],"category_scores_gemma":[0.0015320565,0.00015419011,0.00006565825,0.006606555,0.0002909971,0.00081416784,0.00010181971,0.00025611927,0.00008460139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048070256,0.00003326921,0.0164706,7.675623e-7,0.000001535204,0.000007979737,0.00046033048,0.6177204,0.0006411505,0.00059281004,0.000057391153,0.3640089],"study_design_scores_gemma":[0.00019944801,0.00006276815,0.008089316,0.000012684687,0.0000025814168,0.00008376385,0.0000023938526,0.907827,0.004377597,0.0776668,0.0014469873,0.00022866472],"about_ca_topic_score_codex":0.000037393325,"about_ca_topic_score_gemma":0.00021595208,"teacher_disagreement_score":0.7444388,"about_ca_system_score_codex":0.00014484725,"about_ca_system_score_gemma":0.00037998505,"threshold_uncertainty_score":0.62876904},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031620296,0.0002410772,0.9875748,0.00021082544,0.0012741635,0.0001376958,0.0000071317813,0.0001858095,0.010052259],"genre_scores_gemma":[0.8450642,0.0002733881,0.1456746,0.003309426,0.0015150058,0.000020254976,0.00020880118,0.00018569043,0.0037486432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856055,0.0000094218185,0.00026547737,0.0004425932,0.00049009104,0.00023184944],"domain_scores_gemma":[0.9991573,0.00015271017,0.000053036725,0.00043950876,0.00012733103,0.00007013176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023045318,0.0002662595,0.00024032968,0.00038589138,0.00006697071,0.00014707117,0.00035938207,0.00023317854,0.000092272945],"category_scores_gemma":[0.000055551292,0.0002616968,0.000067540386,0.000300522,0.00010363876,0.00008955424,0.00008262099,0.0004983427,0.000057106223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017979193,0.00000809009,0.00000515261,0.000027160275,0.000007549772,0.000020673071,0.000085646505,0.59030986,0.00029873653,0.0027183478,0.000019422361,0.4064976],"study_design_scores_gemma":[0.0001421615,0.000054060758,0.00016342576,0.00027878344,0.0000072207763,0.000013753687,8.285285e-8,0.9903226,0.0008526856,0.00650279,0.0013549201,0.0003075054],"about_ca_topic_score_codex":0.0000013335825,"about_ca_topic_score_gemma":0.0000629487,"teacher_disagreement_score":0.844748,"about_ca_system_score_codex":0.00027597728,"about_ca_system_score_gemma":0.00012711126,"threshold_uncertainty_score":0.99998355},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026941515,0.0010803852,0.9730287,0.00014518428,0.004785321,0.0002996541,0.00005264635,0.00017701108,0.02016168],"genre_scores_gemma":[0.7730903,0.00020018831,0.03193101,0.003103259,0.007956385,0.000096845266,0.00008048493,0.00040820593,0.18313332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744505,0.000044212156,0.00068406557,0.0011128103,0.00011976044,0.0005940761],"domain_scores_gemma":[0.99796027,0.0006728818,0.0004238509,0.0008054614,0.00004199027,0.000095545736],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003695579,0.00033277154,0.0006722501,0.00093704043,0.00012474542,0.00023290592,0.0013730419,0.00031399555,0.00007159151],"category_scores_gemma":[0.00032127384,0.00035540343,0.00014597189,0.00078374613,0.00052101904,0.00016700833,0.00036416017,0.0006498349,0.0021751563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002027477,0.00006989142,0.0008492421,0.00031493776,0.00006967794,0.00013710375,0.004122802,0.027437527,0.000012821425,0.67510253,0.00072770147,0.2911355],"study_design_scores_gemma":[0.00016697767,0.000060425784,0.0002513566,0.00023672894,0.0000026149676,0.000017500017,3.5917822e-7,0.0391681,0.00003568057,0.9536754,0.0059336503,0.0004511933],"about_ca_topic_score_codex":0.000017978367,"about_ca_topic_score_gemma":0.000012946992,"teacher_disagreement_score":0.9410977,"about_ca_system_score_codex":0.00037547943,"about_ca_system_score_gemma":0.00020303005,"threshold_uncertainty_score":0.9998898},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012240223,0.58073163,0.4182275,0.0006453076,0.00024092245,0.0001314953,0.0000042594993,0.000014123994,0.0000035296218],"genre_scores_gemma":[0.00009490307,0.91634816,0.08251369,0.0005625195,0.00019809796,0.000004499657,0.00026077803,0.000013693577,0.0000036492931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965157,0.00043630027,0.00082277687,0.0012571135,0.0006222317,0.00034587702],"domain_scores_gemma":[0.996299,0.0013054125,0.00050988124,0.001642781,0.000173009,0.000069880174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015931947,0.0003124626,0.0011877415,0.0007716663,0.00007353619,0.00014527954,0.003968292,0.00012990911,0.000009610426],"category_scores_gemma":[0.0023721429,0.00026183904,0.00011773661,0.006067345,0.0001384849,0.00034707153,0.0015910426,0.00080892426,0.000008846747],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.2590708e-7,0.00014583967,0.00006522167,0.0050499057,0.0000045874244,0.000005700484,0.000048504626,0.0053306166,9.8135565e-8,0.0007716622,0.000015328887,0.9885624],"study_design_scores_gemma":[0.00011060347,0.000110657726,0.000039713585,0.18374704,0.000042408963,0.000053478103,2.5879456e-7,0.70316684,0.0000014142101,0.00076491054,0.11147548,0.00048718546],"about_ca_topic_score_codex":0.000021007483,"about_ca_topic_score_gemma":0.000032099746,"teacher_disagreement_score":0.9880752,"about_ca_system_score_codex":0.00014784801,"about_ca_system_score_gemma":0.0017593472,"threshold_uncertainty_score":0.9999834},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013678624,0.0039959345,0.97893023,0.0014649967,0.0019237525,0.0005683456,0.0000038724656,0.00005463624,0.012921446],"genre_scores_gemma":[0.118185066,0.0010804929,0.8619538,0.0030008908,0.00051976263,0.00006249614,0.000006724758,0.00009134589,0.015099401],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731576,0.00005882596,0.00042394505,0.0011867944,0.0005542463,0.0004604064],"domain_scores_gemma":[0.9976599,0.00028308536,0.00025806512,0.0014203356,0.00027741163,0.00010117079],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00090939994,0.00037219079,0.0005919125,0.0002763631,0.00019670444,0.0007415746,0.0057259826,0.00016922629,0.00001525141],"category_scores_gemma":[0.000114643335,0.00026776898,0.00009329358,0.0006029355,0.0008904295,0.00050885713,0.0091845365,0.00047196524,0.000010289714],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019819836,0.000027967211,0.0000979597,0.00013778171,0.000012420102,0.000025406687,0.001918963,0.00064740406,0.000074033334,0.012990333,0.00013655634,0.9839292],"study_design_scores_gemma":[0.0012137952,0.0005372829,0.004013062,0.0036830516,0.00003719294,0.00038662163,0.0000015094262,0.2081246,0.014217705,0.7065845,0.059173804,0.0020268615],"about_ca_topic_score_codex":0.00005039942,"about_ca_topic_score_gemma":0.0006360559,"teacher_disagreement_score":0.98190236,"about_ca_system_score_codex":0.000099450604,"about_ca_system_score_gemma":0.0009521939,"threshold_uncertainty_score":0.99997747},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022962606,0.0004718855,0.9956166,0.00045773416,0.0011258534,0.00027350674,0.000016198248,0.00014923113,0.0016593378],"genre_scores_gemma":[0.5333256,0.000050357954,0.4651337,0.0009786932,0.00037867273,0.00000758587,0.000021907716,0.000024984794,0.000078479236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574536,0.00008027479,0.0007008265,0.0016565653,0.0011864953,0.0006304527],"domain_scores_gemma":[0.99669474,0.00093609816,0.00042744735,0.0015416632,0.00021413784,0.0001859201],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006004559,0.0005069411,0.0012025952,0.0016030177,0.00016009762,0.0003723407,0.0045598727,0.00026408496,0.000013095329],"category_scores_gemma":[0.00020814991,0.00042485094,0.00040958746,0.0066133463,0.00070368435,0.0004108438,0.0012526518,0.0006394099,0.000014508681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021767537,0.00017734568,0.0045032655,0.00026851118,0.0006755423,0.00036358205,0.0070828414,0.27660027,0.0002564902,0.007005179,0.00034139646,0.70270383],"study_design_scores_gemma":[0.00018574056,0.00019135451,0.0026401698,0.000095711686,0.00014049181,0.000009045563,2.8712805e-7,0.97810334,0.0004175189,0.017300455,0.00040764455,0.0005082334],"about_ca_topic_score_codex":0.000070008275,"about_ca_topic_score_gemma":0.0002487399,"teacher_disagreement_score":0.7021956,"about_ca_system_score_codex":0.00024691853,"about_ca_system_score_gemma":0.0009980196,"threshold_uncertainty_score":0.99982035},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012915888,0.00007462819,0.98894554,0.0010381069,0.0011733961,0.00064504496,0.000054526652,0.00006479241,0.006712365],"genre_scores_gemma":[0.3424372,0.000016010037,0.6137324,0.006754731,0.0035353897,0.0001455655,0.00003933757,0.00014449423,0.033194903],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959788,0.000031331827,0.00067136646,0.0014714249,0.0013580711,0.0004890155],"domain_scores_gemma":[0.9937705,0.0036141297,0.0003471373,0.001724255,0.00036524588,0.0001787766],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003176126,0.00037608197,0.0005344992,0.00061699,0.00039669077,0.0006022552,0.0034009314,0.00040801073,0.00095082255],"category_scores_gemma":[0.0008428201,0.00028424535,0.00022206736,0.0005217645,0.0009843378,0.00030080316,0.00054381456,0.00070587423,0.0009405297],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002843438,0.00004189068,0.000031485735,0.0000084468575,0.0000083774,0.0000074529808,0.000430303,0.006010155,0.004418505,0.058108274,0.00047821229,0.93042845],"study_design_scores_gemma":[0.00016951446,0.000057949186,0.000090222435,0.00004074332,0.0000073833876,0.000014690593,7.9581255e-8,0.07100398,0.0015549532,0.8616674,0.06504361,0.00034945883],"about_ca_topic_score_codex":0.0000034254122,"about_ca_topic_score_gemma":0.00006132643,"teacher_disagreement_score":0.930079,"about_ca_system_score_codex":0.000061251696,"about_ca_system_score_gemma":0.00031286734,"threshold_uncertainty_score":0.99996245},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022027276,0.0005254093,0.99694765,0.00013994085,0.0005773859,0.00095891976,0.000011086382,0.00016383722,0.00045551028],"genre_scores_gemma":[0.64425343,0.000022912494,0.3551017,0.0002448866,0.00017114918,0.000024407587,0.000006043496,0.000034124907,0.00014133507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966123,0.000056630597,0.00071457296,0.0013728816,0.0007797529,0.00046387117],"domain_scores_gemma":[0.9964062,0.00117883,0.0005111986,0.0012340822,0.0005546932,0.000114990056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012807739,0.0004338109,0.0006824237,0.00073073956,0.00015675105,0.00036479608,0.0016677959,0.0003262025,0.00000404724],"category_scores_gemma":[0.00015022214,0.00040672053,0.00013326238,0.0004712855,0.00042852442,0.00031135828,0.00075674045,0.0003412389,0.000002481862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020653779,0.00008260879,0.00006296566,0.0008494455,0.00004334474,0.00007521307,0.0022965462,0.52576405,0.0028802152,0.06176676,0.00004800959,0.40611017],"study_design_scores_gemma":[0.00021641092,0.00017175708,0.000026976342,0.0007274416,0.000008925829,0.000035783974,2.5089346e-7,0.95478207,0.012461584,0.030901905,0.00025444225,0.00041243987],"about_ca_topic_score_codex":0.000012390709,"about_ca_topic_score_gemma":0.000014039187,"teacher_disagreement_score":0.6440332,"about_ca_system_score_codex":0.00015572381,"about_ca_system_score_gemma":0.00041623635,"threshold_uncertainty_score":0.9998385},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031150265,0.00046080854,0.9940394,0.0006181341,0.0008085516,0.00020296781,0.000012759685,0.000102994454,0.0006393176],"genre_scores_gemma":[0.48655534,0.00004320433,0.5119446,0.00095310726,0.00017773079,0.0000057236684,0.000029191935,0.000023099486,0.00026800216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975814,0.00005050301,0.00045224282,0.0009601885,0.0006634751,0.0002921577],"domain_scores_gemma":[0.998134,0.00039788728,0.00014373146,0.00088446,0.00033683443,0.000103077095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050448795,0.00028367422,0.0003855777,0.00050790166,0.00018381349,0.0003183743,0.0012340865,0.0001700794,0.00002309364],"category_scores_gemma":[0.00011815943,0.0002570543,0.00005467168,0.0005452884,0.0004666558,0.0005588792,0.001164248,0.00033428983,0.000005616181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000511099,0.00007931847,0.00003519993,0.000053159758,0.000031308395,0.00018345463,0.00065025565,0.12953877,0.008413506,0.4526904,0.000026022673,0.4082935],"study_design_scores_gemma":[0.00036980375,0.00007256815,0.0007897057,0.00028341962,0.000007682971,0.00013192625,1.1677034e-7,0.9304971,0.0019087802,0.065607525,0.000037471975,0.0002938838],"about_ca_topic_score_codex":0.00004832056,"about_ca_topic_score_gemma":0.000054380125,"teacher_disagreement_score":0.80095834,"about_ca_system_score_codex":0.000085707274,"about_ca_system_score_gemma":0.00063072686,"threshold_uncertainty_score":0.99998814},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096284956,0.0003633486,0.8964603,0.005402478,0.0007596307,0.00046749646,0.00003380025,0.00022173894,0.0000062516856],"genre_scores_gemma":[0.61626005,0.000034631827,0.38132125,0.0020537097,0.00024093769,0.000037645128,0.000039416296,0.000011898572,4.3770746e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561745,0.00035696643,0.0008164087,0.0017243837,0.00071306387,0.0007717524],"domain_scores_gemma":[0.9909409,0.0070094476,0.00042691478,0.0010888706,0.0002764728,0.0002573645],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003527808,0.00049180875,0.0009470451,0.00015490933,0.0004290087,0.00034784485,0.0014916575,0.00036845088,0.000031275602],"category_scores_gemma":[0.023286855,0.0004019312,0.00020346593,0.0010909449,0.00032340232,0.00020515909,0.006270441,0.0012089865,0.000002519057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008799991,0.000082202736,0.0016473199,0.00033938565,0.00001774234,0.000047977617,0.0012506489,0.9793628,0.0000677199,0.0010696121,0.00009739711,0.0160084],"study_design_scores_gemma":[0.00017350014,0.000033146764,0.00039687872,0.00018739025,0.000017012419,0.000011617131,0.0000031764687,0.66356903,0.00048618353,0.33475852,0.000027361226,0.000336163],"about_ca_topic_score_codex":0.00035684428,"about_ca_topic_score_gemma":0.00013337618,"teacher_disagreement_score":0.5199751,"about_ca_system_score_codex":0.0014274674,"about_ca_system_score_gemma":0.0008233717,"threshold_uncertainty_score":0.99984324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007116491,0.0014952407,0.9878026,0.0014953897,0.0007004208,0.0005149799,0.000050053706,0.0003045592,0.00052021956],"genre_scores_gemma":[0.87543947,0.00009572415,0.12285862,0.0010452842,0.00030296834,0.000006904785,0.0002002113,0.000030256704,0.000020552914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982353,0.000045922763,0.00034897553,0.0006045966,0.0005333024,0.0002319284],"domain_scores_gemma":[0.9978676,0.0012235414,0.00022497367,0.00029113636,0.00023747011,0.00015528833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022482728,0.00027354507,0.00056888716,0.000318297,0.00012231947,0.00007834995,0.00016943681,0.00017616742,0.000014683273],"category_scores_gemma":[0.00061188743,0.0002554323,0.00011465663,0.00028960285,0.0005983152,0.00010735578,0.00014845516,0.00049443584,0.0000050540934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000305213,0.00011269462,0.22144319,0.00080624863,0.00035941912,0.0005125893,0.007548594,0.4906864,0.020968007,0.00022755982,0.00042995458,0.25660014],"study_design_scores_gemma":[0.00099249,0.00029895725,0.020739952,0.0010589217,0.00018614282,0.000020973714,0.0000047312396,0.9675816,0.007361983,0.0008345101,0.00052211486,0.00039760408],"about_ca_topic_score_codex":0.00025479225,"about_ca_topic_score_gemma":0.000034466797,"teacher_disagreement_score":0.86832297,"about_ca_system_score_codex":0.00010097515,"about_ca_system_score_gemma":0.00035936205,"threshold_uncertainty_score":0.9999898},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016032891,0.00024393963,0.9809572,0.007299592,0.001403119,0.0004481156,0.0000030970014,0.00017460983,0.009454294],"genre_scores_gemma":[0.12399265,0.00004709687,0.86599004,0.007716339,0.0016924746,0.000010765127,0.000002905993,0.000055198307,0.0004925051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963215,0.000106435364,0.00050772895,0.00148463,0.0010475955,0.00053214026],"domain_scores_gemma":[0.9972098,0.00081621873,0.00034884032,0.0013219024,0.00013136472,0.00017189051],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013577841,0.00053774455,0.0004725311,0.0003401743,0.0003871456,0.00088211586,0.003299596,0.00027837692,0.000025939828],"category_scores_gemma":[0.00022457112,0.0003885549,0.00016347434,0.00048343767,0.00017770556,0.00041458034,0.0013481621,0.001210585,0.0000993426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005115145,0.000004990145,0.000003633039,0.000037249425,0.000008278856,0.00006387907,0.0008489971,0.0033727163,0.0001589378,0.3809169,0.000025483538,0.6145538],"study_design_scores_gemma":[0.00012814642,0.00014050084,0.00002459014,0.00055449846,0.000008630441,0.000053480715,2.863057e-7,0.57951576,0.00081236963,0.4164507,0.0017569877,0.0005540395],"about_ca_topic_score_codex":0.000014471962,"about_ca_topic_score_gemma":0.000005854718,"teacher_disagreement_score":0.6139998,"about_ca_system_score_codex":0.00024887818,"about_ca_system_score_gemma":0.00028921803,"threshold_uncertainty_score":0.99985665},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051013245,0.00086127565,0.9892651,0.00044699048,0.0015938181,0.00029430736,0.00000194399,0.0053085955,0.0021769847],"genre_scores_gemma":[0.22759762,0.0000044959006,0.7703619,0.0013886618,0.00045957006,0.000013570308,0.0000043062428,0.000044233864,0.00012564649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580634,0.000057299818,0.0005753616,0.0014776961,0.0011836815,0.0008996491],"domain_scores_gemma":[0.99455035,0.0023625016,0.00043676113,0.001948145,0.0004408953,0.00026134268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015977477,0.0006398462,0.0005376496,0.00096612755,0.00043436943,0.0005771111,0.0032611047,0.0004161267,0.000013894593],"category_scores_gemma":[0.001428755,0.00054552057,0.00013979364,0.0009072398,0.0004710951,0.0006716503,0.001059239,0.0009818422,0.0000578338],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003062336,0.000041435123,0.0024581093,0.000048503898,0.0000036715994,0.00005236653,0.00018688379,0.0033582433,0.00018673319,0.0016683264,0.00031791907,0.9916747],"study_design_scores_gemma":[0.00024782695,0.00021912374,0.00094345724,0.0019034145,0.000012910598,0.000105079984,1.8516443e-8,0.69269145,0.0033379467,0.298132,0.0013278314,0.001078955],"about_ca_topic_score_codex":0.000045639892,"about_ca_topic_score_gemma":0.0000075251774,"teacher_disagreement_score":0.9905958,"about_ca_system_score_codex":0.00034915737,"about_ca_system_score_gemma":0.0007269879,"threshold_uncertainty_score":0.99969965},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008193399,0.00077175593,0.98678446,0.00042784866,0.003284584,0.00033873526,0.000032925593,0.00013095255,0.000035338617],"genre_scores_gemma":[0.44183773,0.000020555954,0.55772674,0.00022317297,0.00015819368,0.000009975327,0.0000145479835,0.000008775933,3.3130922e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951112,0.00018973285,0.00068250246,0.0020215262,0.0012972687,0.000697715],"domain_scores_gemma":[0.9957457,0.00034414418,0.00044965092,0.0026725272,0.0005873028,0.00020064911],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0010016207,0.00048116597,0.0007861927,0.0005371186,0.00021565582,0.0006365059,0.0058614877,0.00030833986,0.000020149784],"category_scores_gemma":[0.00013871031,0.0004352494,0.00018524867,0.0020005226,0.0012097857,0.00083237834,0.013554051,0.0011836132,0.0000050175545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007408052,0.00027586296,0.00032018076,0.00009966557,0.000020908268,0.0001225163,0.002597393,0.18006523,0.0007154817,0.0016250837,0.00002399616,0.81412625],"study_design_scores_gemma":[0.0002106583,0.000100595506,0.0027925358,0.00045870722,0.0000046610157,0.000027815538,0.0000017574206,0.9329017,0.014446175,0.048588846,0.000021174408,0.00044538194],"about_ca_topic_score_codex":0.0005598704,"about_ca_topic_score_gemma":0.00007243204,"teacher_disagreement_score":0.8136809,"about_ca_system_score_codex":0.00020223229,"about_ca_system_score_gemma":0.0011520686,"threshold_uncertainty_score":0.9998099},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015774791,0.001596636,0.9111723,0.004256788,0.0013518372,0.00048686803,0.00007068844,0.00009326043,0.07939419],"genre_scores_gemma":[0.9843208,0.00008432487,0.012435864,0.00095851347,0.0007109172,0.0000031604561,0.000015138147,0.000015622563,0.0014556384],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726135,0.00005910544,0.00044761843,0.00075893855,0.0009898064,0.00048317778],"domain_scores_gemma":[0.9981071,0.00037970627,0.00036291216,0.0005818922,0.00041707506,0.00015133998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068307127,0.00026839346,0.00078786386,0.0012529419,0.00032723168,0.0002458248,0.0013747588,0.00025589392,0.00019881871],"category_scores_gemma":[0.00024568435,0.00025405848,0.000283023,0.0024139169,0.0017044995,0.00024480492,0.00040498306,0.0003561843,0.000008292087],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021899163,0.000060419807,0.0075497176,0.00005767782,0.0003690885,0.00011825796,0.007109387,0.0070663686,0.000089319845,0.11352443,0.000009662031,0.86402375],"study_design_scores_gemma":[0.0037269956,0.0009855317,0.093708076,0.005090887,0.003414036,0.000046465553,0.000091205155,0.28441212,0.0010850402,0.5068056,0.091796905,0.008837132],"about_ca_topic_score_codex":0.003472371,"about_ca_topic_score_gemma":0.010280154,"teacher_disagreement_score":0.9827433,"about_ca_system_score_codex":0.00029251093,"about_ca_system_score_gemma":0.0016634659,"threshold_uncertainty_score":0.9999912},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014428919,0.0004532817,0.99377096,0.0006179416,0.0028034956,0.0011244364,0.000009805446,0.000353402,0.0008652462],"genre_scores_gemma":[0.0052604675,0.000027791652,0.9925783,0.001203419,0.00046409934,0.00007131538,0.00003169964,0.00004788946,0.00031498805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596196,0.00003604453,0.00060577516,0.001719414,0.0008840361,0.00079275103],"domain_scores_gemma":[0.9969373,0.00058407045,0.0004036364,0.0011922647,0.0007068795,0.00017587494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006882623,0.00054576487,0.0005517593,0.00060832984,0.00035987518,0.0005793509,0.0023360911,0.0002983389,0.00002153428],"category_scores_gemma":[0.0001368638,0.0005503041,0.00017634977,0.0009923079,0.00042057136,0.0004471046,0.0011780624,0.00044162737,0.0000033361775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005473233,0.000021253523,0.0000018596751,0.000012201408,0.000008403665,0.000012869027,0.000142219,0.86732316,0.0000034603383,0.080004305,0.000076519216,0.05238827],"study_design_scores_gemma":[0.0002427536,0.00029276343,0.000002456443,0.0002499013,0.000011042826,0.00002921453,1.7037466e-7,0.95222676,0.00025384966,0.045918368,0.00024405579,0.0005286512],"about_ca_topic_score_codex":0.0000035605522,"about_ca_topic_score_gemma":0.0000068792206,"teacher_disagreement_score":0.084903605,"about_ca_system_score_codex":0.00042695316,"about_ca_system_score_gemma":0.00048786475,"threshold_uncertainty_score":0.9996948},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033470624,0.00018437555,0.9956914,0.0002611257,0.0008543608,0.00025655137,5.259902e-7,0.00022263498,0.00249556],"genre_scores_gemma":[0.019518744,0.000027923961,0.9793889,0.0006013468,0.00023482829,0.000005862231,0.000011505387,0.00003990732,0.00017098841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996137,0.00013767705,0.0006531312,0.0014228306,0.001021265,0.0006280901],"domain_scores_gemma":[0.9980667,0.00044826427,0.00038681558,0.00061759184,0.0003371785,0.00014344743],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011884557,0.0004499766,0.00046078092,0.0011061046,0.00037056804,0.0010836307,0.0014181355,0.00030381442,0.000082461156],"category_scores_gemma":[0.00023754375,0.00049938407,0.0000916343,0.0011336706,0.00017790169,0.001247854,0.001163959,0.001151184,0.000016528136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023176906,0.000020187532,0.00004255837,0.000025277324,0.000006880826,0.00010515035,0.0017715452,0.94308156,0.00017033148,0.0035026951,3.990041e-7,0.05127112],"study_design_scores_gemma":[0.00033627942,0.000041637693,0.000114451264,0.00030523704,0.0000060947295,0.00009433041,0.0000014384897,0.9945223,0.000056767436,0.0037433964,0.0002518113,0.0005262713],"about_ca_topic_score_codex":0.00002432577,"about_ca_topic_score_gemma":0.000055982076,"teacher_disagreement_score":0.051440746,"about_ca_system_score_codex":0.00067921926,"about_ca_system_score_gemma":0.00084995816,"threshold_uncertainty_score":0.9999533},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004339105,0.0005823187,0.99299365,0.00050378504,0.004680634,0.0007074468,0.000003962249,0.00022356599,0.00026124332],"genre_scores_gemma":[0.06515073,0.000042105064,0.93111396,0.0010200529,0.0013834555,0.000047412217,0.000017944643,0.000047615624,0.001176708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958068,0.000066055676,0.0006027815,0.0020611987,0.0007279161,0.00073520787],"domain_scores_gemma":[0.99737895,0.00037196506,0.00032654192,0.0010027696,0.0007588211,0.0001609579],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010101529,0.00054531853,0.00052914274,0.0005641488,0.00038995876,0.0006108719,0.0017114391,0.0005074435,0.000015384181],"category_scores_gemma":[0.00010277333,0.0005491131,0.00023288997,0.0006123426,0.00026135822,0.00079629826,0.00064925523,0.0008353036,0.000010297048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009358323,0.00004658773,0.00011754674,0.00003150949,0.000026056137,0.000022976568,0.00025767423,0.50997037,0.00013602345,0.048551366,0.000034722547,0.44079584],"study_design_scores_gemma":[0.00035483378,0.00013978498,0.00019387595,0.0003948787,0.000015472859,0.000046957975,2.7082345e-7,0.97836304,0.00023485596,0.019017773,0.0006531824,0.000585088],"about_ca_topic_score_codex":0.000042715626,"about_ca_topic_score_gemma":0.0002856368,"teacher_disagreement_score":0.46839267,"about_ca_system_score_codex":0.00048601697,"about_ca_system_score_gemma":0.00050480134,"threshold_uncertainty_score":0.999696},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023324164,0.0016572519,0.98793346,0.00010816292,0.0016139642,0.00016963913,0.0000015592107,0.0002178984,0.005965677],"genre_scores_gemma":[0.9852818,0.00018620914,0.013676377,0.00017338988,0.0003768539,0.00000486725,0.000005580373,0.00004305153,0.0002518537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852616,0.0000049914347,0.00022868808,0.0005141224,0.0003869556,0.0003390743],"domain_scores_gemma":[0.9993973,0.000044779736,0.000022361386,0.00041872595,0.000041756353,0.000075121214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015985049,0.00028670076,0.00029147408,0.00029345788,0.00005051224,0.00008392951,0.0004572886,0.00014628343,0.000012798796],"category_scores_gemma":[0.000011383507,0.00027436196,0.000079489255,0.00015704527,0.0000779729,0.000075620665,0.00026598774,0.00043155937,0.0000051233233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.330631e-7,0.0000023629798,0.000002084313,0.000027941218,0.0000078637595,0.0000341716,0.000093052964,0.7380577,0.00015379708,0.00028853506,0.0000013286019,0.26133025],"study_design_scores_gemma":[0.00013858249,0.000014254551,0.000012078982,0.00025796844,0.000011455449,0.000005493222,2.4536726e-7,0.9967035,0.00014916967,0.0017394038,0.0006633429,0.00030448992],"about_ca_topic_score_codex":0.000025419562,"about_ca_topic_score_gemma":0.00018870254,"teacher_disagreement_score":0.9829494,"about_ca_system_score_codex":0.00021228522,"about_ca_system_score_gemma":0.00005302264,"threshold_uncertainty_score":0.99997085},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033522085,0.0034326357,0.987097,0.0006394681,0.0016264726,0.00032335616,0.0003381869,0.00005501062,0.0031356611],"genre_scores_gemma":[0.9003284,0.00046963716,0.09506859,0.0012310001,0.0023289213,0.000016659267,0.00011286763,0.0000880024,0.00035594899],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969439,0.000018102013,0.0006064191,0.0018006422,0.00014878967,0.0004821303],"domain_scores_gemma":[0.9974154,0.00031132146,0.00037431903,0.0017580059,0.00006881548,0.00007210276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017681699,0.00030429644,0.0005233393,0.0007565449,0.00021109846,0.00024111326,0.0019458074,0.00030657667,0.000058551454],"category_scores_gemma":[0.0005033282,0.00029773705,0.00006388317,0.0007123661,0.0012186562,0.00047346286,0.0012160457,0.00038695117,0.000037002552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019202198,0.00020775224,0.06279372,0.00032538784,0.000025670224,0.000017647655,0.002532472,0.0009826855,0.0000077849145,0.39762956,0.0015017844,0.53395635],"study_design_scores_gemma":[0.00020836302,0.00004762634,0.013383741,0.000110347835,0.0000027203425,0.0000067793644,3.658514e-8,0.02885537,0.000008812172,0.9452882,0.011656588,0.0004314408],"about_ca_topic_score_codex":0.000034858458,"about_ca_topic_score_gemma":0.000120858975,"teacher_disagreement_score":0.8969762,"about_ca_system_score_codex":0.00021569758,"about_ca_system_score_gemma":0.00036425484,"threshold_uncertainty_score":0.9999475},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015979083,0.00024625807,0.9822134,0.0000673217,0.000684798,0.0005782124,0.000009200113,0.00013576604,0.00008600162],"genre_scores_gemma":[0.70522606,0.00002276772,0.29410937,0.000507048,0.000070227026,0.000011459865,0.000013561373,0.000026202146,0.000013272855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961626,0.000109157125,0.0007809353,0.0013580896,0.0010633066,0.00052589626],"domain_scores_gemma":[0.99760336,0.00038754643,0.0004051187,0.0010075322,0.0004960824,0.00010036286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006733005,0.00045741026,0.0005544027,0.001476124,0.00012817202,0.00027848413,0.0013922141,0.00033913396,0.000020797695],"category_scores_gemma":[0.00010764432,0.00048897613,0.00014607134,0.0010258515,0.00028356924,0.0004727984,0.0002839021,0.0005462387,0.000003683065],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008115507,0.000065173175,0.00010729206,0.000119144606,0.0000063252655,0.00024925917,0.00036525974,0.12762658,0.06260722,0.00014359216,2.2606271e-7,0.8087018],"study_design_scores_gemma":[0.00026910673,0.00012276288,0.000074567484,0.0006518641,0.000006818126,0.00004006366,8.884697e-7,0.66272867,0.3315143,0.0042253053,0.000016163853,0.00034946558],"about_ca_topic_score_codex":0.00014123767,"about_ca_topic_score_gemma":0.0006239988,"teacher_disagreement_score":0.80835235,"about_ca_system_score_codex":0.0007238474,"about_ca_system_score_gemma":0.0004042103,"threshold_uncertainty_score":0.9997562},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011928556,0.0024384237,0.9838045,0.00087340776,0.003126813,0.00066040293,0.0000017981362,0.00005585023,0.007845934],"genre_scores_gemma":[0.9149313,0.0019780723,0.07575243,0.0029421567,0.0034458665,0.00006122156,0.000032778833,0.00006790104,0.00078826863],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997277,0.00003537419,0.00074564724,0.00086020847,0.00050410966,0.0005776406],"domain_scores_gemma":[0.9984779,0.00038565532,0.00017202883,0.00056314614,0.00023619822,0.00016510152],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007888244,0.00028814134,0.00045533665,0.0009026083,0.000098196884,0.000056443012,0.00052047794,0.00033616292,0.00011900599],"category_scores_gemma":[0.00038699617,0.00026096718,0.00007300696,0.0010184507,0.0007138236,0.00028938364,0.00012857403,0.0009541307,0.00014599232],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037933434,0.000079876656,0.0006747069,0.00010920563,0.0000011681914,0.00004381934,0.002058838,0.0017337693,0.000021745804,0.0009647983,0.000012619616,0.9942615],"study_design_scores_gemma":[0.000024359646,0.00066523015,0.00037977446,0.002225597,0.000017195718,0.000090152615,0.000012493299,0.05041811,0.020908073,0.9209337,0.0036839577,0.00064132526],"about_ca_topic_score_codex":0.00019517784,"about_ca_topic_score_gemma":0.0013227795,"teacher_disagreement_score":0.9936202,"about_ca_system_score_codex":0.0006550193,"about_ca_system_score_gemma":0.0023064867,"threshold_uncertainty_score":0.99998426},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026673512,0.00012529403,0.9922289,0.00016019329,0.0028744824,0.000520107,0.00003598494,0.000044363424,0.0013433119],"genre_scores_gemma":[0.9279342,0.00002290961,0.0642487,0.00049121544,0.0014646761,0.000063796375,0.0004017882,0.00004257723,0.005330128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812883,0.000040062227,0.00044886535,0.0007124684,0.0003439481,0.0003258203],"domain_scores_gemma":[0.9986778,0.00013426114,0.0003405949,0.00023678938,0.00055554835,0.000055032902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047496444,0.00021714637,0.0002804527,0.00032160405,0.00021430136,0.000060232487,0.0002459993,0.00032966046,0.00017116738],"category_scores_gemma":[0.000046365007,0.0002375605,0.00013842857,0.000257403,0.0002585826,0.0001774318,0.00006872526,0.00030167017,0.000011722302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092960254,0.00011307032,0.00011834415,0.00009596767,0.00004192532,0.0000040789005,0.0010248423,0.6563447,0.0016150901,0.049723882,0.0006004479,0.29022467],"study_design_scores_gemma":[0.0005323526,0.00014791006,0.0007844737,0.00015144325,0.000031539406,0.0000350459,0.0000016530847,0.9111094,0.00063639745,0.08590412,0.0003794648,0.000286225],"about_ca_topic_score_codex":0.000012489677,"about_ca_topic_score_gemma":0.00007304309,"teacher_disagreement_score":0.9279802,"about_ca_system_score_codex":0.00017932316,"about_ca_system_score_gemma":0.00022822282,"threshold_uncertainty_score":0.9687436},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017733566,0.000535045,0.9859775,0.004447547,0.0031279975,0.00055874855,0.0000055719174,0.00014307482,0.0034312117],"genre_scores_gemma":[0.89961433,0.000045763296,0.09228429,0.005560224,0.0006830214,0.000033705583,0.000012208634,0.00006761978,0.0016988243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950067,0.000081086924,0.0008350235,0.0020402635,0.0011908615,0.0008460578],"domain_scores_gemma":[0.99688655,0.00031465152,0.00024499488,0.002053088,0.00022750991,0.00027320915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011244977,0.0005532357,0.0006937055,0.001278525,0.00017028152,0.0010013463,0.0038907072,0.00035537683,0.000053734188],"category_scores_gemma":[0.00011633272,0.0005526372,0.00014783339,0.0012953787,0.00026001307,0.0006485422,0.0013608849,0.00095908117,0.00019765532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027768283,0.00058442267,0.011895493,0.0007985001,0.00013726039,0.003748768,0.18106504,0.024619674,0.0032845878,0.38365602,0.0006389792,0.38954347],"study_design_scores_gemma":[0.001344701,0.00041095403,0.004320511,0.0065672984,0.000023471635,0.0005435064,0.00000549388,0.7826986,0.0037567685,0.18156886,0.014549658,0.0042102253],"about_ca_topic_score_codex":0.000110771,"about_ca_topic_score_gemma":0.0019509813,"teacher_disagreement_score":0.897841,"about_ca_system_score_codex":0.000616278,"about_ca_system_score_gemma":0.0006608224,"threshold_uncertainty_score":0.9996925},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000092640235,0.00016843804,0.99645305,0.0003518621,0.0005071697,0.0004830428,0.00008618354,0.00036765586,0.0014899822],"genre_scores_gemma":[0.13494524,0.000027054879,0.86374795,0.00082312245,0.00017550905,0.000022199732,0.00007258655,0.000029280704,0.00015705261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954817,0.00006611141,0.0005562011,0.0022198018,0.0009948475,0.0006812886],"domain_scores_gemma":[0.9959477,0.0008144886,0.0003314637,0.0023314513,0.0004071744,0.00016771138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017213015,0.00056710787,0.0009085178,0.0013228497,0.00023892755,0.0008070253,0.0027080441,0.00032320607,0.000013305227],"category_scores_gemma":[0.00013897243,0.00056810956,0.00039269822,0.001337763,0.0004526083,0.00096415466,0.002799586,0.00050774036,0.000005534078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018551098,0.000098470955,0.00012540007,0.000068410525,0.00035556644,0.00034244766,0.0007902929,0.09026554,0.0008662246,0.11208121,0.00016146958,0.79482645],"study_design_scores_gemma":[0.0001982962,0.00008589099,0.000043036798,0.00013861543,0.00007715396,0.00003696832,1.3943477e-7,0.8708728,0.004488251,0.12314143,0.0003217947,0.0005956259],"about_ca_topic_score_codex":0.0000879257,"about_ca_topic_score_gemma":0.00026455658,"teacher_disagreement_score":0.7942308,"about_ca_system_score_codex":0.00040575836,"about_ca_system_score_gemma":0.0005574959,"threshold_uncertainty_score":0.99967706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008707906,0.00016483037,0.99507076,0.0005417916,0.00043055532,0.00042295354,0.0000050870635,0.0003385566,0.0021547019],"genre_scores_gemma":[0.43226072,0.00013565537,0.5636028,0.0009897758,0.0003434017,0.00008989329,0.000013280394,0.00007002939,0.0024944523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967227,0.000058235557,0.00058223447,0.0015490714,0.000544612,0.0005431757],"domain_scores_gemma":[0.99776363,0.0002020438,0.00024003022,0.0014432891,0.00021882044,0.00013216647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005748207,0.00047159105,0.00052557804,0.0008891937,0.00025048986,0.00058084924,0.0020592066,0.00040936598,0.000045144465],"category_scores_gemma":[0.0000384749,0.00048682131,0.00014350038,0.0014068594,0.00036802018,0.0008180515,0.0009762337,0.00078740227,0.000051205036],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010672072,0.00006386722,0.00005088013,0.000043392236,0.000013584827,0.00014119,0.00046795767,0.008632686,0.006154975,0.021585017,0.000007724794,0.96282804],"study_design_scores_gemma":[0.00037842983,0.00031808697,0.000511966,0.00044395166,0.000012456201,0.00027785797,7.237039e-7,0.803163,0.054610837,0.13524482,0.00371236,0.0013255434],"about_ca_topic_score_codex":0.000075157426,"about_ca_topic_score_gemma":0.00024109942,"teacher_disagreement_score":0.9615025,"about_ca_system_score_codex":0.00039127725,"about_ca_system_score_gemma":0.00039032634,"threshold_uncertainty_score":0.99975836},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050625985,0.0006135508,0.9951481,0.00036297273,0.0009323444,0.00088482833,0.000004933607,0.00029045792,0.0012565062],"genre_scores_gemma":[0.02270904,0.00009382273,0.9748286,0.0014349325,0.00022626255,0.0000738717,0.000033344142,0.000045353234,0.00055478985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954215,0.000101210695,0.0007323661,0.0018893742,0.0010305593,0.00082495395],"domain_scores_gemma":[0.99713063,0.0008739666,0.0003512797,0.0010480365,0.00042335634,0.00017272138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015400329,0.00054006116,0.00061100564,0.0011952375,0.0002798017,0.000894014,0.0022928196,0.00042271297,0.000051341976],"category_scores_gemma":[0.0005053417,0.00056045747,0.0001865761,0.0011414293,0.00027701314,0.0008674236,0.0010424705,0.0012450642,0.000017400038],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009387986,0.000047208105,0.00009254003,0.000070991104,0.000008886178,0.00018760956,0.0007190118,0.006555022,0.00042597626,0.057931073,0.000004097067,0.9339482],"study_design_scores_gemma":[0.0008525052,0.00029357406,0.00010637677,0.0017139904,0.000010464801,0.000106216634,0.0000021738335,0.659748,0.010198644,0.3217754,0.0040545147,0.0011381209],"about_ca_topic_score_codex":0.00003556372,"about_ca_topic_score_gemma":0.00018361617,"teacher_disagreement_score":0.93281007,"about_ca_system_score_codex":0.0006187669,"about_ca_system_score_gemma":0.0005069316,"threshold_uncertainty_score":0.9996847},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030960757,0.00012818868,0.9944138,0.00075284485,0.0013236185,0.00027485745,0.0000017787455,0.0001977345,0.0025975972],"genre_scores_gemma":[0.42964625,0.000042221207,0.56686866,0.0027674988,0.0005048599,0.0000034617342,0.000005666324,0.000028743725,0.00013265511],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969614,0.00003062931,0.0005875452,0.0009485153,0.0009674224,0.0005044897],"domain_scores_gemma":[0.9977694,0.00029168208,0.0003350412,0.001204502,0.00022809453,0.000171287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011242443,0.00040991843,0.00044067175,0.00072288024,0.00023835518,0.0008339143,0.0020853174,0.0003110555,0.000006859844],"category_scores_gemma":[0.00019378818,0.0003797922,0.0000708453,0.00036846354,0.00036020685,0.0011716674,0.0011976004,0.0006174163,0.00003792855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006212798,0.00000395761,0.000029139806,0.000045066565,0.000005502048,0.000010399185,0.0013314252,0.010694356,0.00004270618,0.18010369,0.000011234837,0.8077163],"study_design_scores_gemma":[0.0002667569,0.000106652515,0.00005921782,0.00019447482,0.0000043160626,0.00003628823,8.703555e-8,0.8569518,0.00024871656,0.1390951,0.0026158257,0.00042076467],"about_ca_topic_score_codex":0.000023141474,"about_ca_topic_score_gemma":0.000017163995,"teacher_disagreement_score":0.84625745,"about_ca_system_score_codex":0.00017718216,"about_ca_system_score_gemma":0.00030223123,"threshold_uncertainty_score":0.9998654},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032315092,0.0023423855,0.9917277,0.000187584,0.0038753732,0.00047492754,0.000014600689,0.000025076237,0.001029221],"genre_scores_gemma":[0.10100289,0.0003191653,0.89542115,0.00039433726,0.00075822877,0.000022556744,0.000009822367,0.000060073224,0.0020118118],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905719,0.00045859575,0.0017160815,0.002300238,0.0038439163,0.0011092646],"domain_scores_gemma":[0.9897674,0.0064220917,0.0007281635,0.0017773103,0.0010428836,0.00026217874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0080579445,0.0005513115,0.0013494496,0.0014374515,0.00017450194,0.00032576342,0.0037123496,0.00041070985,0.00057507254],"category_scores_gemma":[0.0028955892,0.0004571788,0.0002849576,0.0025569191,0.0024903251,0.00044788007,0.002253177,0.0013099203,0.000039869316],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034108467,0.00004134475,0.00047744488,0.000022519467,0.000015522517,0.00024623153,0.00070331927,0.24476694,0.00050605414,0.002877792,0.00010917441,0.75019956],"study_design_scores_gemma":[0.0007078239,0.0002960934,0.0012876041,0.0006999429,0.00001187126,0.000071689596,0.0000057830084,0.38065243,0.01208077,0.595755,0.0074847634,0.00094623317],"about_ca_topic_score_codex":0.000053884647,"about_ca_topic_score_gemma":0.000243016,"teacher_disagreement_score":0.74925333,"about_ca_system_score_codex":0.000363343,"about_ca_system_score_gemma":0.0010145291,"threshold_uncertainty_score":0.999788},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003584969,0.00044658867,0.99674386,0.000530863,0.0011054024,0.00063886633,0.00003263917,0.000057355322,0.00008593486],"genre_scores_gemma":[0.14169642,0.000032353935,0.8576452,0.00018480985,0.0003233639,0.00002376861,0.000035030058,0.000020828318,0.00003822103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706733,0.000042419866,0.0007497149,0.0011128319,0.00058764365,0.00044007797],"domain_scores_gemma":[0.9965855,0.00075804256,0.00066571665,0.0012007765,0.00068584085,0.000104155784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035800584,0.000346915,0.00057561224,0.00033660483,0.00018622131,0.00009133686,0.001641796,0.00022662201,0.000008594568],"category_scores_gemma":[0.00007139321,0.00035330313,0.00019752621,0.0007607549,0.0014944524,0.0006061993,0.0006790277,0.0004579627,6.065845e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010335161,0.000042036114,0.000035980505,0.000042659674,0.0000136797535,0.000004274835,0.000101877566,0.38593325,0.0014604821,0.5358217,0.000023728287,0.07651],"study_design_scores_gemma":[0.00013440741,0.00009083528,0.00013770362,0.00011722466,0.0000062481963,0.00004628762,1.00394196e-7,0.5881864,0.00069231854,0.41022706,0.00012365729,0.00023774931],"about_ca_topic_score_codex":0.000018504637,"about_ca_topic_score_gemma":0.000036404297,"teacher_disagreement_score":0.20225313,"about_ca_system_score_codex":0.0001762218,"about_ca_system_score_gemma":0.0003061007,"threshold_uncertainty_score":0.9998919},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000064914726,0.00022699742,0.99526733,0.000259166,0.00018850376,0.00045215312,0.000005123988,0.000034138244,0.0035016832],"genre_scores_gemma":[0.45251396,0.000026561624,0.5432005,0.00035573912,0.0018754593,0.00014252962,0.00006991201,0.00006115699,0.001754163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986627,0.000014413767,0.00024614867,0.0005721379,0.00025372265,0.0002508832],"domain_scores_gemma":[0.9988882,0.00033153148,0.0001759969,0.00040429752,0.00016135021,0.00003863853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004480881,0.00023624921,0.00029025294,0.000091778544,0.00028088,0.0003246684,0.00045401524,0.000067209694,0.00008162393],"category_scores_gemma":[0.000007435478,0.00017669513,0.00010701665,0.00019337203,0.00025376168,0.000113015376,0.00035185003,0.00032321847,0.0000020407408],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023185755,0.000010827401,0.0005367199,0.000028465507,0.000035429905,8.472862e-7,0.00027448268,0.004813018,0.00003178114,0.05450373,0.000088132365,0.93967426],"study_design_scores_gemma":[0.00016000816,0.000023861268,0.00007073795,0.0003327572,0.00006269772,0.0000057921807,0.0000012543693,0.530831,0.00060481904,0.45404154,0.013452953,0.0004126093],"about_ca_topic_score_codex":0.000023115368,"about_ca_topic_score_gemma":0.000013768987,"teacher_disagreement_score":0.9392616,"about_ca_system_score_codex":0.0000435139,"about_ca_system_score_gemma":0.000103112994,"threshold_uncertainty_score":0.72054183},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12316751,0.00023672756,0.8672504,0.0016823672,0.0066958102,0.00065191544,0.000015326359,0.00029060314,0.000009333775],"genre_scores_gemma":[0.50475246,0.0000032416049,0.49452874,0.00025851675,0.00039321318,0.00003897962,0.000014251412,0.00001044099,1.7661228e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953263,0.00016181584,0.0006673229,0.0023257476,0.00068960903,0.0008292176],"domain_scores_gemma":[0.99573475,0.0010155009,0.00038107118,0.001992478,0.00068890594,0.0001872646],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001571536,0.00047960784,0.00057264784,0.00057399337,0.0005974521,0.0016220644,0.0034759887,0.00031928645,0.0000032010098],"category_scores_gemma":[0.0011496647,0.000466786,0.00024704222,0.001932614,0.00065797474,0.00030787793,0.0038057691,0.0011621615,0.0000018053275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025053585,0.00009361283,0.0010086782,0.00013999757,0.000010027408,0.000011295036,0.0019559013,0.43761376,0.00019137256,0.0014165385,0.0000055313008,0.5575508],"study_design_scores_gemma":[0.00021244283,0.00006969268,0.0037537613,0.00026262717,0.000006218408,0.00006191031,0.0000016254392,0.8917284,0.0016482986,0.10174701,0.0000388709,0.00046913812],"about_ca_topic_score_codex":0.00011744418,"about_ca_topic_score_gemma":0.00008260488,"teacher_disagreement_score":0.55708164,"about_ca_system_score_codex":0.0002964796,"about_ca_system_score_gemma":0.0017299195,"threshold_uncertainty_score":0.9997784},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005299739,0.0004022551,0.9882258,0.00015235369,0.0035116023,0.00034200534,0.0000050704994,0.00005538705,0.0020057405],"genre_scores_gemma":[0.85816884,0.00006297051,0.13699654,0.0016170482,0.0024974088,0.000014610803,0.000044083616,0.00008064415,0.00051784754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829996,0.00004018751,0.00029277414,0.0008032126,0.00016456452,0.0003993189],"domain_scores_gemma":[0.99882895,0.00041698207,0.00016995569,0.00030295548,0.00018345131,0.00009771542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033777533,0.00025648318,0.00027403643,0.00029986975,0.00032093242,0.00015656279,0.00022806025,0.00035313808,0.000060873932],"category_scores_gemma":[0.000055001095,0.0002579328,0.000091083224,0.00021904161,0.00032190693,0.00010589216,0.0001647525,0.000505374,0.000004193376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013756494,0.000021728454,0.00008079976,0.00003566933,0.000021569722,0.00002631713,0.00075081736,0.046850637,0.00020136946,0.0011108293,0.0000054627035,0.95088106],"study_design_scores_gemma":[0.0003817619,0.0001025854,0.0006158179,0.00018747048,0.000035083198,0.00023503344,0.0000035933756,0.99216014,0.000045612403,0.005753617,0.00013393314,0.0003453256],"about_ca_topic_score_codex":0.000040842802,"about_ca_topic_score_gemma":0.00035605626,"teacher_disagreement_score":0.9505357,"about_ca_system_score_codex":0.00008128665,"about_ca_system_score_gemma":0.000050249233,"threshold_uncertainty_score":0.9999873},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053929187,0.0002155762,0.9954825,0.0008649793,0.0006302912,0.00012684209,0.000007692588,0.0000914798,0.0025266944],"genre_scores_gemma":[0.6441341,0.000059278038,0.35375172,0.00090299017,0.00020101978,0.000017568513,0.0000764339,0.000024840203,0.00083204475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680424,0.00005674668,0.0004964228,0.001119965,0.0010795039,0.00044310023],"domain_scores_gemma":[0.99763244,0.00074458396,0.00034055364,0.0009795844,0.00016834568,0.00013450715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000790518,0.0002982162,0.00049804023,0.0016401234,0.00037056016,0.00019517378,0.0032684659,0.00013978433,0.00037712025],"category_scores_gemma":[0.0002811329,0.00025584243,0.00020757246,0.002657582,0.0005927723,0.0003494174,0.0015596253,0.00085051777,0.000024764395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035954047,0.00007800284,0.0002790371,0.000018403067,0.000019493173,0.00007093953,0.00015525467,0.22615321,0.000022368607,0.22872654,0.000021622343,0.54445153],"study_design_scores_gemma":[0.00031484143,0.0005927952,0.00040825774,0.000039336857,0.000033029617,0.00003107045,2.8575306e-7,0.7447442,0.00023130806,0.21441206,0.038467754,0.000725056],"about_ca_topic_score_codex":0.00010487162,"about_ca_topic_score_gemma":0.00003058763,"teacher_disagreement_score":0.64408016,"about_ca_system_score_codex":0.00023261846,"about_ca_system_score_gemma":0.00038874612,"threshold_uncertainty_score":0.9999894},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23363078,0.0002464906,0.76344144,0.00005469125,0.00036779954,0.0018043083,0.000359911,0.000025143607,0.000069441805],"genre_scores_gemma":[0.95663023,0.000016940354,0.042199135,0.00015073606,0.00013375134,0.00027453457,0.000062780164,0.000026828147,0.0005050421],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985517,0.0000262781,0.00032977416,0.00061244925,0.00015877956,0.00032099592],"domain_scores_gemma":[0.99836886,0.00048870273,0.00025220646,0.00031132012,0.0005016393,0.000077278935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025711386,0.00020789105,0.0003144423,0.00028721924,0.00019427818,0.00014532528,0.00028413895,0.00028131512,0.000031900203],"category_scores_gemma":[0.000052731066,0.00019737483,0.0001988916,0.00016173751,0.0005526335,0.00040657405,0.000089532085,0.00022969182,0.0000014909417],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012044201,0.00035529668,0.006273606,0.00046043855,0.0001579021,0.00001631057,0.015473137,0.0086202435,0.008887353,0.11276523,0.00058122334,0.84520483],"study_design_scores_gemma":[0.017894134,0.035787947,0.57642704,0.004236573,0.0010249756,0.0002962241,0.0004475114,0.079829395,0.0065457663,0.23050685,0.0397255,0.007278082],"about_ca_topic_score_codex":0.00023393318,"about_ca_topic_score_gemma":0.00017323377,"teacher_disagreement_score":0.83792675,"about_ca_system_score_codex":0.00015074808,"about_ca_system_score_gemma":0.0006326356,"threshold_uncertainty_score":0.80487114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032053563,0.00017534038,0.95578337,0.0005763512,0.0009247577,0.040488005,0.00002081343,0.00022024561,0.0018078985],"genre_scores_gemma":[0.0004776311,0.0000041096323,0.98232555,0.0011578951,0.001106187,0.014343561,0.0000138391615,0.000054860433,0.0005163632],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952038,0.000046409292,0.0006883699,0.002352485,0.0007952267,0.0009137184],"domain_scores_gemma":[0.9957955,0.0006892944,0.00034484468,0.002401475,0.00038819673,0.00038067484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009317667,0.00071762543,0.00070771895,0.0008351697,0.00037746245,0.0009926232,0.00535861,0.00042987085,0.00004425945],"category_scores_gemma":[0.00019416015,0.0006569903,0.00035410028,0.0011077669,0.0005122872,0.00034233602,0.002666671,0.00079158874,0.000023905732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023623374,0.0001456048,0.000023369148,0.00029152,0.000024597442,0.00005862548,0.0020515472,0.0014337555,0.000080591766,0.2463493,0.0012326435,0.7482848],"study_design_scores_gemma":[0.0013106111,0.000363246,0.000015957483,0.001074594,0.000011088394,0.00007165308,1.9263254e-7,0.2252165,0.0015496479,0.65430236,0.11495687,0.001127289],"about_ca_topic_score_codex":0.00002470984,"about_ca_topic_score_gemma":0.00015668834,"teacher_disagreement_score":0.7471575,"about_ca_system_score_codex":0.00018599912,"about_ca_system_score_gemma":0.002100874,"threshold_uncertainty_score":0.99958813},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020761868,0.00047485012,0.995171,0.00043667367,0.0022962335,0.000757262,0.000012797133,0.00011164423,0.0005318976],"genre_scores_gemma":[0.073760346,0.00028914982,0.9222141,0.0013566017,0.0018750498,0.000065151195,0.00006974961,0.00007159058,0.00029826033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971856,0.0000549456,0.0005529224,0.0012510725,0.0004100924,0.00054540153],"domain_scores_gemma":[0.9976471,0.0005571097,0.0004918057,0.0007385841,0.0004636408,0.00010173443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008344992,0.00038318665,0.0005529864,0.0003864972,0.00029024392,0.00024913772,0.0013223045,0.00036669392,0.00002456046],"category_scores_gemma":[0.00010655349,0.0003771598,0.00021827323,0.0007361278,0.00028588352,0.00053537055,0.0006060712,0.00070456776,0.000004155753],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032277363,0.000024068753,2.5199913e-7,0.000052041767,0.000014899215,0.0000044049007,0.0004114601,0.0443775,0.00033573306,0.0020656283,0.000014560734,0.9526672],"study_design_scores_gemma":[0.00039553412,0.0004111555,0.000003826729,0.00063288875,0.000014800895,0.000034029603,2.5215755e-7,0.89294094,0.005448495,0.097576365,0.0020768698,0.00046481326],"about_ca_topic_score_codex":0.000009497905,"about_ca_topic_score_gemma":0.00013364913,"teacher_disagreement_score":0.9522024,"about_ca_system_score_codex":0.00018146142,"about_ca_system_score_gemma":0.00041368353,"threshold_uncertainty_score":0.99986804},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015322223,0.0014909944,0.9925055,0.00035218906,0.0010648076,0.00025033474,0.0000024459414,0.00005156119,0.0027499306],"genre_scores_gemma":[0.27782285,0.0003412374,0.72044194,0.0007685144,0.0004487552,0.000011674281,0.000027316564,0.000024569921,0.00011314299],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723285,0.00007600635,0.0005253986,0.0011681006,0.000720309,0.00027733884],"domain_scores_gemma":[0.997463,0.00032739784,0.001195137,0.00063050055,0.0003131731,0.00007080816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008048961,0.00029549716,0.0003950803,0.00030565145,0.00018329947,0.00048515043,0.00090310635,0.00020481186,0.000008719094],"category_scores_gemma":[0.00012446998,0.00027730953,0.000049652597,0.00047825012,0.00027878876,0.0034899132,0.00039802724,0.00045892986,0.000002618786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016855081,0.00007002132,0.000052372176,0.0004915944,0.000015521828,0.000017483779,0.008336642,0.008121699,0.0012850873,0.02013894,0.000028242337,0.96142554],"study_design_scores_gemma":[0.00061361725,0.00027324856,0.00023347196,0.0020650888,0.000028749628,0.00025615998,0.000021408378,0.9404299,0.0046963296,0.048749693,0.0019342011,0.00069810863],"about_ca_topic_score_codex":0.00003797088,"about_ca_topic_score_gemma":0.00006381236,"teacher_disagreement_score":0.96072745,"about_ca_system_score_codex":0.00018647495,"about_ca_system_score_gemma":0.0005001165,"threshold_uncertainty_score":0.99996793},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37286952,0.000012854907,0.62377757,0.00013372353,0.0027227565,0.00037536636,0.000008661137,0.000093543495,0.000006019694],"genre_scores_gemma":[0.9152335,0.000012509669,0.0796329,0.004226109,0.0007886321,0.000072066025,0.0000059553768,0.00002557726,0.0000027306123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99543035,0.00008912579,0.00037005288,0.0024954046,0.00085483625,0.00076021097],"domain_scores_gemma":[0.99822086,0.00020063794,0.00022295752,0.0009808711,0.00019009496,0.00018455618],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006844494,0.00036840263,0.00035279538,0.00039607272,0.00058601826,0.0013813981,0.001992525,0.00023370952,0.000005780701],"category_scores_gemma":[0.0005203759,0.00035213545,0.0001084075,0.0009996707,0.0010171053,0.001013591,0.0009400851,0.00073901133,0.0000025892234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005593265,0.00007638253,0.000018426379,0.00005560908,1.763954e-7,0.000010691594,0.001568472,0.4878687,0.42684945,0.000008076998,0.0000036813028,0.083534725],"study_design_scores_gemma":[0.00015103677,0.00007626143,0.00061352993,0.00013544344,0.000005368785,0.000026893877,0.0000020433122,0.9515986,0.032427497,0.014566656,0.0000058922265,0.00039080123],"about_ca_topic_score_codex":0.0000116799065,"about_ca_topic_score_gemma":0.00006975139,"teacher_disagreement_score":0.54414463,"about_ca_system_score_codex":0.00022866589,"about_ca_system_score_gemma":0.0015764589,"threshold_uncertainty_score":0.99989307},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083017204,0.0010204589,0.99285084,0.0022423046,0.0008262681,0.00017343684,0.0000023701975,0.00018290272,0.0018712543],"genre_scores_gemma":[0.19123544,0.000046998823,0.80593693,0.0013828545,0.00033944935,0.000010494116,0.00000841205,0.000024262408,0.0010151443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969281,0.00002234859,0.00031222514,0.0013607901,0.00089080655,0.00048571776],"domain_scores_gemma":[0.99822205,0.0003167897,0.0001822586,0.00090994325,0.00028697003,0.00008200877],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003972364,0.00042175234,0.00045121738,0.00045847628,0.00046336823,0.00040756632,0.0014787625,0.00032847596,0.000024121076],"category_scores_gemma":[0.000024871993,0.00034073924,0.00008005877,0.0005093493,0.00063705066,0.00049877824,0.001032139,0.00076238887,0.00001331725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009873049,0.000030047944,0.00007081713,0.000028737146,0.000036970818,0.00022930454,0.0010957323,0.7039218,0.000046434074,0.20823756,0.00007941823,0.08621334],"study_design_scores_gemma":[0.0001784301,0.00014143888,0.000026091706,0.00030591985,0.000007700451,0.00012428415,4.0396642e-7,0.88677436,0.00040421705,0.11015463,0.001390039,0.00049247144],"about_ca_topic_score_codex":0.000018131428,"about_ca_topic_score_gemma":0.000095232135,"teacher_disagreement_score":0.19040526,"about_ca_system_score_codex":0.00013027083,"about_ca_system_score_gemma":0.00059634424,"threshold_uncertainty_score":0.99990445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020600022,0.00058498443,0.98987085,0.0043378766,0.00058223266,0.00041939638,0.000001393632,0.00042141858,0.0037612412],"genre_scores_gemma":[0.16945697,0.00021263666,0.828846,0.0010404439,0.00029856284,0.000012850136,0.0000062528798,0.000029231245,0.00009709552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686706,0.000030012052,0.0004485544,0.0014207003,0.0008340628,0.0003995867],"domain_scores_gemma":[0.9983925,0.00020964516,0.00030917162,0.00076235726,0.00020089462,0.00012540905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069996144,0.00041445502,0.0003741674,0.00045697813,0.00023392735,0.00050771533,0.0016245923,0.00023033253,0.0000088197085],"category_scores_gemma":[0.00016831077,0.00041310798,0.00005437617,0.00045891365,0.0004004083,0.0010378314,0.0013439485,0.00059168425,0.000029141287],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018518597,0.000011184924,0.000003473034,0.000056516525,0.000003861449,0.000055987708,0.00076651684,0.0010156002,0.00033655422,0.020178502,0.000038009868,0.97753197],"study_design_scores_gemma":[0.00012769418,0.0001888606,0.000034870267,0.00039622208,0.0000053032786,0.000033035914,1.1287105e-7,0.86811745,0.0056311497,0.124470614,0.0005403506,0.00045434703],"about_ca_topic_score_codex":0.0000070889355,"about_ca_topic_score_gemma":0.000010866997,"teacher_disagreement_score":0.9770776,"about_ca_system_score_codex":0.00023465276,"about_ca_system_score_gemma":0.00018930015,"threshold_uncertainty_score":0.9998321},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015027436,0.0008236897,0.98278695,0.00008824797,0.00016837673,0.00023659943,0.0000032410398,0.000029273342,0.0008361755],"genre_scores_gemma":[0.9868094,0.000025874153,0.0126245525,0.00009696128,0.0003347682,0.0000073644765,0.000005743457,0.000019779642,0.000075613374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820584,0.000034072873,0.00033961618,0.0008007725,0.0002830142,0.0003367008],"domain_scores_gemma":[0.99919957,0.00013910033,0.0001562092,0.00036046453,0.00007255839,0.000072077666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005085325,0.00028817472,0.00040924264,0.00043136018,0.00015278466,0.000208658,0.00024701818,0.00010397644,0.00004372829],"category_scores_gemma":[0.000008928014,0.0002822944,0.00007898,0.00035267428,0.00017824631,0.000083913284,0.0004505232,0.0005318859,8.4228054e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000357709,0.000032430107,0.001481075,0.00002060452,0.000012576519,0.000011749561,0.00037481208,0.0454454,0.00021271354,0.00096032495,0.0000021204976,0.9514426],"study_design_scores_gemma":[0.0005228768,0.00009819152,0.003949563,0.0010571004,0.00005121674,0.0000204407,0.0000071518216,0.96202135,0.0036513873,0.026952146,0.0007843418,0.000884232],"about_ca_topic_score_codex":0.00012254859,"about_ca_topic_score_gemma":0.0007701807,"teacher_disagreement_score":0.9717819,"about_ca_system_score_codex":0.000108432025,"about_ca_system_score_gemma":0.000074728334,"threshold_uncertainty_score":0.9999629},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04158288,0.0001878291,0.95333093,0.0014833458,0.002772934,0.00050827925,0.000033077635,0.000092494956,0.000008239606],"genre_scores_gemma":[0.64206237,0.0000046861996,0.35692456,0.00039528075,0.0005185077,0.000060405964,0.000011866343,0.000012986921,0.000009347665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948153,0.00033089236,0.00091870653,0.0020239633,0.0013086888,0.00060246425],"domain_scores_gemma":[0.9942432,0.002190727,0.0005182705,0.002058745,0.0008255886,0.00016343666],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00452732,0.00037764868,0.00057315704,0.0005564039,0.00049373833,0.001410257,0.0033214353,0.00023757195,0.00010447299],"category_scores_gemma":[0.0033433086,0.0003058718,0.0002484219,0.0030844116,0.0008997578,0.00039099486,0.0026104636,0.0011656559,0.0000438874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009262933,0.000095680996,0.00041262666,0.000014810688,0.000007944463,0.000009713661,0.0017116764,0.14579837,0.0020028893,0.00018206608,0.000024117944,0.84973085],"study_design_scores_gemma":[0.00018000868,0.00004096882,0.000258286,0.00014788295,0.000009388956,0.000039124403,0.000018152525,0.7720637,0.014126062,0.21135186,0.0013354475,0.0004291449],"about_ca_topic_score_codex":0.0002802526,"about_ca_topic_score_gemma":0.0007267113,"teacher_disagreement_score":0.8493017,"about_ca_system_score_codex":0.00013910969,"about_ca_system_score_gemma":0.00057953625,"threshold_uncertainty_score":0.9999393},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05901913,0.00058273436,0.93431365,0.001460688,0.003756265,0.0007201137,0.000018066523,0.0001077127,0.000021643526],"genre_scores_gemma":[0.54889023,0.0000071967825,0.45020628,0.00035659855,0.00044669406,0.0000474467,0.000005629417,0.000025076804,0.000014869303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99083304,0.00026426103,0.0010288877,0.0029720794,0.0036398391,0.0012618694],"domain_scores_gemma":[0.98472327,0.010586854,0.0004163158,0.0022959006,0.0017017617,0.00027590655],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006201715,0.00052494986,0.00090019207,0.00088226004,0.00047342508,0.0037100348,0.0052178544,0.00034657726,0.0000843],"category_scores_gemma":[0.022478068,0.00042253072,0.00029831158,0.0033599995,0.0010706031,0.00082224316,0.006136363,0.0011958778,0.000025366046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013273888,0.000061151055,0.0005588515,0.00004203729,0.000006173403,0.00006441199,0.00088954635,0.6448827,0.001080561,0.0000058723704,0.00002019129,0.3523752],"study_design_scores_gemma":[0.00032090707,0.00008299454,0.0012550676,0.00030612876,0.000005167772,0.000036405723,0.00000837326,0.8528789,0.025401566,0.1190525,0.00013930371,0.0005126714],"about_ca_topic_score_codex":0.000075428274,"about_ca_topic_score_gemma":0.00021079488,"teacher_disagreement_score":0.48987108,"about_ca_system_score_codex":0.0005433418,"about_ca_system_score_gemma":0.0013104266,"threshold_uncertainty_score":0.9998227},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8213247,0.00010595384,0.16800407,0.0067698304,0.0014613061,0.00021862313,0.0000060262078,0.00015384587,0.0019556556],"genre_scores_gemma":[0.99608636,0.0000038717244,0.0028196825,0.00080771075,0.0002693915,0.000001997774,5.73506e-7,0.0000027830613,0.0000076210363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991064,0.000014674562,0.000111691625,0.00029344918,0.00020842077,0.00026537548],"domain_scores_gemma":[0.9995478,0.00006433954,0.000038332153,0.00019955385,0.000108984925,0.000041034167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017383453,0.00009783271,0.00011286972,0.00027391277,0.00027389658,0.00019457292,0.000420915,0.00003990231,0.000107112886],"category_scores_gemma":[0.000089051,0.00007798756,0.000021325075,0.00034993488,0.0006461321,0.00027949348,0.00007864795,0.00019526266,0.000026480107],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070591186,0.00009554124,0.0006532298,0.000003065566,0.0000034636369,0.0000142370745,0.015920654,0.00091611245,0.0020015885,0.03129527,0.000052606723,0.9490372],"study_design_scores_gemma":[0.00070324156,0.00060102844,0.029083377,0.00012330819,0.000009886201,0.0000140136535,0.000052183528,0.04183632,0.087507576,0.8273113,0.011988658,0.00076910405],"about_ca_topic_score_codex":0.000026499356,"about_ca_topic_score_gemma":0.0014461592,"teacher_disagreement_score":0.94826806,"about_ca_system_score_codex":0.000058825048,"about_ca_system_score_gemma":0.00007308475,"threshold_uncertainty_score":0.31802404},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.3868718e-7,0.0008559678,0.9951645,0.0007834066,0.0013053106,0.0014150336,0.00001976883,0.00015436487,0.00030122406],"genre_scores_gemma":[0.00026111398,0.00023138465,0.99769354,0.00050517585,0.00036192042,0.00006210414,0.000028939929,0.000065120395,0.00079071306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99458426,0.00006190259,0.00076238264,0.0022906943,0.0013866024,0.0009141343],"domain_scores_gemma":[0.9953987,0.0014872543,0.00037298398,0.0012831454,0.0011396856,0.0003182279],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022897644,0.0006205087,0.0007055079,0.0010171657,0.00051313,0.0017920383,0.0024793032,0.00027796588,0.000040875297],"category_scores_gemma":[0.0007605308,0.00061107933,0.00012188157,0.00083236664,0.0005978388,0.0008805745,0.0016998982,0.00067972083,0.0000061805995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030436931,0.000030101137,0.0000012399672,0.000069678594,0.0000146648,0.000023956518,0.00017152095,0.7598254,0.00008257904,0.0025639588,0.000025675998,0.23718816],"study_design_scores_gemma":[0.00055749976,0.00017203628,0.0000036076158,0.00032504316,0.000012694374,0.00017369949,2.0423036e-7,0.98496115,0.00097340497,0.011733399,0.00043991653,0.0006473683],"about_ca_topic_score_codex":0.000012823194,"about_ca_topic_score_gemma":0.000005778979,"teacher_disagreement_score":0.2365408,"about_ca_system_score_codex":0.0002856601,"about_ca_system_score_gemma":0.0012054337,"threshold_uncertainty_score":0.999634},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31888494,0.00015744101,0.67964387,0.00010297134,0.00071038905,0.00027887177,0.000004856945,0.00021340892,0.0000032389576],"genre_scores_gemma":[0.66044414,0.000018646817,0.33931747,0.00010721474,0.00007628996,0.000017581178,0.0000035517305,0.000015006603,1.1290553e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964459,0.00016775595,0.0005449018,0.0014318922,0.0007613841,0.0006481739],"domain_scores_gemma":[0.99649423,0.001136736,0.00034934958,0.00173934,0.0001928874,0.00008743468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012570784,0.00045156875,0.00059408025,0.0011188689,0.00007069835,0.00079229457,0.0037560482,0.0002861985,0.000004731746],"category_scores_gemma":[0.0006910632,0.00040131676,0.00020164614,0.0024538513,0.00015403017,0.00072039076,0.0032837777,0.0013597652,0.000001350496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004601064,0.00010909454,0.049560804,0.000111770416,0.000009329222,0.00010048958,0.0017841192,0.6602771,0.000107926666,0.0000050412837,0.0000032929167,0.28792644],"study_design_scores_gemma":[0.00021863934,0.0002900844,0.09843456,0.0014425757,0.000004353822,0.000040583967,5.6576374e-7,0.8923361,0.0044138436,0.0022131815,0.000004375855,0.000601159],"about_ca_topic_score_codex":0.002749864,"about_ca_topic_score_gemma":0.00016193558,"teacher_disagreement_score":0.34155917,"about_ca_system_score_codex":0.00041869108,"about_ca_system_score_gemma":0.0010075307,"threshold_uncertainty_score":0.9998439},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009800348,0.0011652291,0.9966558,0.0002648811,0.00087713485,0.00044351985,0.000005706019,0.00021262944,0.0002770581],"genre_scores_gemma":[0.11640271,0.00016573383,0.88269037,0.00039432844,0.00016254674,0.000011342495,0.0000014111694,0.000034923472,0.00013661297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973511,0.000035820452,0.00043096385,0.000950061,0.0007297092,0.00050232443],"domain_scores_gemma":[0.997284,0.0005191335,0.00025701363,0.0017052245,0.000099035555,0.00013559895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005818261,0.0004645727,0.0004780829,0.00035344312,0.000133354,0.0002454517,0.0030684418,0.00033426576,0.0000029343805],"category_scores_gemma":[0.000018916957,0.0003524277,0.00012166244,0.00035845043,0.00074178353,0.00062201294,0.0014913486,0.0008498713,0.0000033312022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002675787,0.000027829463,0.00005301757,0.000031203574,0.000008161393,0.000005989334,0.00085567933,0.27262488,0.000037842416,0.14971612,0.000012263333,0.57662433],"study_design_scores_gemma":[0.00016186175,0.00006009679,0.00012437225,0.001005898,0.000007806238,0.00002301479,4.59756e-8,0.9672388,0.0015488894,0.02521378,0.004098953,0.0005164916],"about_ca_topic_score_codex":0.000006526453,"about_ca_topic_score_gemma":0.0000052787545,"teacher_disagreement_score":0.69461393,"about_ca_system_score_codex":0.00014821102,"about_ca_system_score_gemma":0.00017513597,"threshold_uncertainty_score":0.9998928},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015855933,0.0002967753,0.9138985,0.0005760927,0.0015878127,0.00058453827,0.0000057510297,0.000100293204,0.08136463],"genre_scores_gemma":[0.9833677,0.00004559672,0.015528513,0.00018766016,0.00043230882,0.000011336689,0.00001437645,0.000014477426,0.00039805702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733496,0.000042293865,0.000614703,0.00047404694,0.001125898,0.00040809275],"domain_scores_gemma":[0.99803233,0.0002165759,0.0005332225,0.0004361634,0.0006849802,0.00009673983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017914262,0.00023720312,0.0004108518,0.0006260853,0.00071362476,0.00023628239,0.00075177086,0.00024215408,0.00002743694],"category_scores_gemma":[0.00023501701,0.00022027778,0.00009180506,0.0006580746,0.0010853362,0.0013863199,0.00024924526,0.00030193132,0.000008587718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005463167,0.000028748385,0.0016441054,0.00014641516,0.00002538976,0.000008807887,0.15539777,0.006360417,0.000051703784,0.6758443,0.000014503995,0.16047235],"study_design_scores_gemma":[0.0010881078,0.00066196243,0.00094679033,0.0031683084,0.00007549092,0.000019287072,0.0025465107,0.042747594,0.0020618548,0.93205446,0.011712541,0.0029170855],"about_ca_topic_score_codex":0.0002338502,"about_ca_topic_score_gemma":0.0021257713,"teacher_disagreement_score":0.9817821,"about_ca_system_score_codex":0.00019841357,"about_ca_system_score_gemma":0.00050612475,"threshold_uncertainty_score":0.8982667},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005036758,0.003920118,0.9187953,0.03820704,0.0038549278,0.0018673246,0.00024591814,0.00027005837,0.02780256],"genre_scores_gemma":[0.9375846,0.001549439,0.05289189,0.003125209,0.0022343849,0.000030499219,0.00027070125,0.00006647782,0.0022468169],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605554,0.00017276582,0.00039098915,0.0016389617,0.0010485235,0.00069319934],"domain_scores_gemma":[0.99703777,0.00050285785,0.00020327841,0.0018300943,0.00015349842,0.00027248304],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0027423105,0.00034827742,0.00046249916,0.00080543285,0.0006031562,0.0010474591,0.0034571479,0.00031725882,0.00014512187],"category_scores_gemma":[0.0028230306,0.00035020136,0.00005009584,0.0012170974,0.0015434608,0.0012659273,0.0053869677,0.0010629916,0.00001657014],"study_design_candidate":"design_other","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.000042319138,0.0003076436,0.013431346,0.00016876831,0.000033171436,0.00033377347,0.0152334105,0.000037163813,0.00004785103,0.115405425,0.00075447414,0.85420465],"study_design_scores_gemma":[0.0007963794,0.00017279074,0.0034475795,0.0010605982,0.000025986796,0.000047553716,0.000023120512,0.022096438,0.000074630654,0.57737464,0.39333722,0.0015430806],"about_ca_topic_score_codex":0.0034517886,"about_ca_topic_score_gemma":0.09338867,"teacher_disagreement_score":0.9325478,"about_ca_system_score_codex":0.0003758386,"about_ca_system_score_gemma":0.0016130949,"threshold_uncertainty_score":0.99998957},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005667507,0.0010535672,0.9968488,0.000090133115,0.00083673664,0.0005224176,0.000005846154,0.00040463192,0.00018114551],"genre_scores_gemma":[0.024158794,0.00003952119,0.97522587,0.00021662074,0.00028314465,0.000014094679,0.000005727768,0.000037583777,0.000018617262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639356,0.000034008415,0.0005041249,0.0017035238,0.00057423767,0.0007905586],"domain_scores_gemma":[0.9972045,0.0013506316,0.00018036559,0.0009454224,0.0001418358,0.00017728609],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020900604,0.0005477152,0.0006359899,0.00084400066,0.00026075597,0.00025563326,0.0017632117,0.00037382095,5.5241384e-7],"category_scores_gemma":[0.0005120041,0.000523869,0.0001283221,0.00059413497,0.00041340737,0.0005804225,0.0009360859,0.00085889135,5.053811e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007761226,0.000011415177,0.000009914961,0.00008130403,0.000010557592,0.000012829546,0.0008072336,0.73020107,0.000039766015,0.013380874,0.0000011158961,0.25543615],"study_design_scores_gemma":[0.00021108837,0.000083862986,0.00000578949,0.000108079235,0.000007954073,0.00004565902,3.8314462e-7,0.8509753,0.00022192049,0.14773367,0.00011565059,0.00049068447],"about_ca_topic_score_codex":0.0000055516593,"about_ca_topic_score_gemma":0.0000069507755,"teacher_disagreement_score":0.2549455,"about_ca_system_score_codex":0.00024049732,"about_ca_system_score_gemma":0.00018424873,"threshold_uncertainty_score":0.9997213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007743405,0.000078136974,0.9739264,0.0007531437,0.000680853,0.00037807468,0.000030664647,0.000015347281,0.016393937],"genre_scores_gemma":[0.97135276,0.000013432827,0.027479097,0.00054433313,0.00011138288,0.000011617194,0.0000068480613,0.00002429443,0.00045623744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984662,0.0000059608124,0.00050977635,0.0006607997,0.000108394284,0.00024885839],"domain_scores_gemma":[0.9983535,0.00031030932,0.0005864716,0.00062592776,0.00007712867,0.000046669447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011750229,0.00023080726,0.0003610393,0.00030168483,0.00014243963,0.00007561583,0.00073026295,0.00014923653,0.00027912084],"category_scores_gemma":[0.00009549574,0.00017177835,0.00007251741,0.00012575753,0.0005863146,0.00010937995,0.00013397752,0.0004338949,0.000039050974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017442962,0.000019714631,0.000016683749,0.000008416136,0.000008114443,0.000001465167,0.0001448783,0.0068890573,0.00006800776,0.98885417,0.0000025140507,0.003969555],"study_design_scores_gemma":[0.00019335834,0.00013844138,0.0000722743,0.00009050722,0.0000027439,0.000008390085,2.4804433e-7,0.037182704,0.0021501095,0.9597232,0.00020531427,0.00023274585],"about_ca_topic_score_codex":0.000027070466,"about_ca_topic_score_gemma":0.00006239225,"teacher_disagreement_score":0.96360934,"about_ca_system_score_codex":0.00010060361,"about_ca_system_score_gemma":0.00014676581,"threshold_uncertainty_score":0.7004917},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11279823,0.00036842303,0.8820937,0.0006470097,0.0032904695,0.0005369968,0.0000013316827,0.00025481335,0.000008979319],"genre_scores_gemma":[0.5835584,0.000038645438,0.41593632,0.0001701033,0.00024739103,0.00002804848,0.000005763069,0.000013226911,0.0000021027724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964095,0.00016002638,0.0004299597,0.0017659164,0.00056452845,0.00067008054],"domain_scores_gemma":[0.99836814,0.00018934994,0.0002674238,0.0007758593,0.00023623236,0.00016296623],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001543077,0.0003927285,0.00043164188,0.0006163885,0.00051742786,0.0017173627,0.0009491654,0.00034346187,0.0000030429317],"category_scores_gemma":[0.0004002177,0.00039556585,0.00013730177,0.0012185196,0.00020054242,0.00068721635,0.0018291565,0.0010723298,0.0000028797842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056759063,0.000030465562,0.00016149,0.00013725573,0.000008535093,0.00002538585,0.0011935281,0.12900214,0.010379032,0.000025513908,0.0000013728034,0.8590296],"study_design_scores_gemma":[0.00022669417,0.00017059408,0.0012553112,0.00021871999,0.0000058804167,0.000116343486,0.0000023953162,0.8120017,0.175321,0.01020807,0.000084353844,0.00038890517],"about_ca_topic_score_codex":0.00016562942,"about_ca_topic_score_gemma":0.00011887907,"teacher_disagreement_score":0.85864073,"about_ca_system_score_codex":0.00025941507,"about_ca_system_score_gemma":0.00028388947,"threshold_uncertainty_score":0.9998496},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018505583,0.00052777375,0.9750689,0.0034797979,0.0002322103,0.0017569626,0.0000031256552,0.00012519101,0.00030045587],"genre_scores_gemma":[0.358037,0.000008165531,0.6409292,0.00048732845,0.000093192466,0.00012140097,4.487748e-7,0.000032795433,0.0002904447],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953152,0.0003877358,0.00047224597,0.0023867344,0.0007393721,0.00069869024],"domain_scores_gemma":[0.99324524,0.003977458,0.00011742148,0.0020201132,0.00037572542,0.00026404276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0050370675,0.0003896454,0.00048536126,0.0018747011,0.0004566595,0.00038544074,0.0023903544,0.000347951,0.000013556202],"category_scores_gemma":[0.0007434525,0.00038856926,0.000032707158,0.0019452224,0.0004834283,0.00016323234,0.006152436,0.0014358576,0.000025617132],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042018473,0.00058550254,0.0002674574,0.000016141259,0.00002669958,0.018287394,0.03139058,0.014353406,0.0002947843,0.038021907,0.000016091577,0.896698],"study_design_scores_gemma":[0.0010529724,0.0022302207,0.0005080363,0.0006722674,0.000022024773,0.0039273906,0.0005218956,0.48535192,0.0010344341,0.50140995,0.0015273828,0.0017414988],"about_ca_topic_score_codex":0.00069398875,"about_ca_topic_score_gemma":0.0033412504,"teacher_disagreement_score":0.8949565,"about_ca_system_score_codex":0.00026306722,"about_ca_system_score_gemma":0.00054076227,"threshold_uncertainty_score":0.9998566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025262313,0.0010931473,0.96893466,0.0014154994,0.001935458,0.001202497,0.000010150992,0.00013289701,0.000013380563],"genre_scores_gemma":[0.55082935,0.00006557126,0.4478632,0.0006973315,0.00038069556,0.00012557817,0.000013778488,0.000021454627,0.000003050662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99568677,0.00021987187,0.00045670505,0.0021993292,0.0004939425,0.00094336784],"domain_scores_gemma":[0.99703974,0.0005889874,0.0003262331,0.0014692998,0.00038649898,0.00018923849],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00087476865,0.0006597041,0.00071431213,0.0003560617,0.0004444797,0.001990304,0.0020006788,0.00019260249,0.0000053618523],"category_scores_gemma":[0.00007259779,0.0004938576,0.00018323645,0.0012033812,0.00035899607,0.0006980659,0.00082395604,0.00045439252,0.0000018695634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030761148,0.000084569474,0.0002409795,0.0000326505,0.00003366504,0.00006382927,0.003232839,0.64282525,0.0008842776,0.000015645854,0.000006697364,0.3525488],"study_design_scores_gemma":[0.0008623614,0.000688431,0.0011112692,0.00046215544,0.000013206583,0.000022786766,0.00000335209,0.944068,0.04991463,0.0020225344,0.0001880925,0.0006431473],"about_ca_topic_score_codex":0.00006825272,"about_ca_topic_score_gemma":0.00009507139,"teacher_disagreement_score":0.52556705,"about_ca_system_score_codex":0.0003285089,"about_ca_system_score_gemma":0.0012539641,"threshold_uncertainty_score":0.9997513},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.571668e-7,0.0005734447,0.9932517,0.001233595,0.0018611576,0.0014411147,0.000030184328,0.0002163493,0.0013915051],"genre_scores_gemma":[0.0010351184,0.000096918586,0.9947942,0.0006099602,0.0004881977,0.000037603968,0.000065582215,0.00006069424,0.0028117145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946052,0.00007268382,0.0008759882,0.0021381767,0.0013814472,0.0009265411],"domain_scores_gemma":[0.9952742,0.001106642,0.00044019666,0.001542044,0.001210862,0.0004260559],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010833938,0.00062736886,0.0008317125,0.0010592118,0.0003135167,0.0014511864,0.0031371452,0.00027103222,0.00024210219],"category_scores_gemma":[0.0010005077,0.0006195017,0.00019694232,0.0009702314,0.0005807208,0.00049606676,0.0011309743,0.0006624588,0.000023206385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004660733,0.000029507166,0.0000033041583,0.00007594215,0.000024081042,0.00008926614,0.00013632316,0.61076283,0.000027325817,0.01435178,0.0001838301,0.37431115],"study_design_scores_gemma":[0.00070067553,0.00020816007,0.0000021865224,0.0002826914,0.000016619073,0.00015249646,1.3702734e-7,0.96796066,0.0005053752,0.027611723,0.0019266399,0.0006326586],"about_ca_topic_score_codex":0.000019550687,"about_ca_topic_score_gemma":0.000012789407,"teacher_disagreement_score":0.3736785,"about_ca_system_score_codex":0.00029725122,"about_ca_system_score_gemma":0.002386277,"threshold_uncertainty_score":0.9996256},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023566238,0.00083041284,0.995558,0.00021803527,0.00017223174,0.0005579828,0.000008744394,0.00007321067,0.00022475747],"genre_scores_gemma":[0.41003928,0.000042706415,0.58831584,0.0014806449,0.0000895788,0.000007549559,0.000005625457,0.000013294367,0.000005449538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969441,0.000053090866,0.00043948265,0.0014828135,0.00063233974,0.00044817],"domain_scores_gemma":[0.99790645,0.00047158584,0.000209282,0.0008700326,0.00021879216,0.00032387694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009853453,0.00039459224,0.00047676952,0.00062301185,0.00016719979,0.00015092669,0.0017646716,0.00025376686,0.0000020748023],"category_scores_gemma":[0.00001174927,0.00033511207,0.000038627197,0.0004764991,0.00041352137,0.00057910563,0.0008006754,0.00044978524,0.0000024688934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004684864,0.000042955366,0.000023992514,0.00006554074,0.000015120726,0.000021681892,0.0046737315,0.59164083,0.0028787006,0.103871875,7.2878174e-7,0.29671803],"study_design_scores_gemma":[0.00017336084,0.00027663013,0.000022665834,0.00011267194,0.000012581118,0.000029540966,0.0000022945578,0.9663548,0.004138075,0.028376115,0.00013461105,0.00036665396],"about_ca_topic_score_codex":0.00006183139,"about_ca_topic_score_gemma":0.00013701514,"teacher_disagreement_score":0.40768266,"about_ca_system_score_codex":0.00004874543,"about_ca_system_score_gemma":0.00017222349,"threshold_uncertainty_score":0.9999101},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021552741,0.00041486614,0.9878345,0.001096095,0.0017715627,0.0010648402,0.000046848087,0.00047595013,0.007079772],"genre_scores_gemma":[0.028528197,0.000026291234,0.95590097,0.01417915,0.0009716429,0.000043743465,0.00013484362,0.00009714624,0.00011802955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.991751,0.00008559863,0.00097479514,0.0036613888,0.0020465958,0.001480634],"domain_scores_gemma":[0.99354416,0.000704814,0.00043664422,0.003407138,0.0012662382,0.0006410003],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011388831,0.0012186841,0.0010460085,0.0018822808,0.00042814395,0.00076229614,0.008393005,0.00072285056,0.000019743344],"category_scores_gemma":[0.000024602368,0.0010957565,0.00013221121,0.004129063,0.00029624693,0.001259349,0.0038178298,0.0013623078,0.00016541398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009810976,0.00017797775,0.00001446623,0.00017078576,0.00006204778,0.00021535548,0.015403228,0.6269397,0.00042406665,0.02782404,0.000039788476,0.32863042],"study_design_scores_gemma":[0.00061770447,0.00018321321,0.00012851195,0.00079185347,0.0000320197,0.00008710264,0.0000040025557,0.8179815,0.0012586553,0.17350136,0.003582295,0.0018318305],"about_ca_topic_score_codex":0.0022140027,"about_ca_topic_score_gemma":0.0016115361,"teacher_disagreement_score":0.3267986,"about_ca_system_score_codex":0.00037263156,"about_ca_system_score_gemma":0.0009774907,"threshold_uncertainty_score":0.99914926},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009856108,0.0015186985,0.9928624,0.0012997453,0.0020631088,0.00074093475,0.000044499273,0.00022583017,0.0012349219],"genre_scores_gemma":[0.009378909,0.000043654574,0.9859611,0.0031453671,0.00043053343,0.00001725849,0.00019640337,0.000070274626,0.000756499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942445,0.00015111861,0.00067146664,0.0029849163,0.0010293762,0.0009186353],"domain_scores_gemma":[0.9942886,0.0015141647,0.00037545824,0.002877958,0.00067950436,0.0002642688],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021869019,0.00075317564,0.00087691477,0.0006287039,0.00048691698,0.0009570159,0.0061344714,0.0006245798,0.000023693123],"category_scores_gemma":[0.00036648492,0.00070364616,0.00020809562,0.0007789525,0.00047700846,0.0007214131,0.0021063075,0.0014435296,0.00001147618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029307868,0.000061261075,0.000022397882,0.00011689991,0.000043990516,0.0002077248,0.00041154417,0.023377992,0.0006372489,0.037977554,0.00013372106,0.93698037],"study_design_scores_gemma":[0.00069452374,0.00020722546,0.000030197727,0.00062792294,0.00003237865,0.000057978483,1.0381678e-7,0.94008315,0.0013501638,0.050110884,0.0059498567,0.00085564016],"about_ca_topic_score_codex":0.000021397986,"about_ca_topic_score_gemma":0.00004009632,"teacher_disagreement_score":0.93612474,"about_ca_system_score_codex":0.000305194,"about_ca_system_score_gemma":0.0019774125,"threshold_uncertainty_score":0.99954146},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007007163,0.0003757262,0.9949391,0.0007079417,0.0007552087,0.0009475749,0.000002535624,0.00013204638,0.0014391354],"genre_scores_gemma":[0.38224462,0.000016109096,0.6168576,0.00029805562,0.00028885534,0.000019024377,0.000015209078,0.000032945612,0.00022756826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960542,0.000025123976,0.0005158454,0.0017189685,0.0010340025,0.000651897],"domain_scores_gemma":[0.99812484,0.00028220762,0.00024806973,0.0009510687,0.00023793553,0.00015589841],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087780773,0.0004998435,0.00057893724,0.0004618907,0.0002719705,0.0006823228,0.0018270289,0.00025234633,0.0000060426637],"category_scores_gemma":[0.00005006491,0.0004337136,0.00014206627,0.00051781954,0.00036764765,0.00073381304,0.00036141402,0.00057036214,0.000001927101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044491986,0.000025252859,0.000099318284,0.00020669014,0.000037627782,0.00003480405,0.0018924564,0.19108035,0.00006253057,0.062276747,0.0000027285846,0.744237],"study_design_scores_gemma":[0.0006401199,0.00022870967,0.00003984744,0.0007824539,0.000017663368,0.00005846133,9.1918946e-7,0.9515245,0.002703031,0.043187257,0.00020629524,0.0006107443],"about_ca_topic_score_codex":0.000009189928,"about_ca_topic_score_gemma":0.000088552,"teacher_disagreement_score":0.76044416,"about_ca_system_score_codex":0.0004053269,"about_ca_system_score_gemma":0.00075886294,"threshold_uncertainty_score":0.9998115},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048875842,0.00005875571,0.9459117,0.001806987,0.0011486214,0.0018720779,0.000019025401,0.0003009379,0.000006022282],"genre_scores_gemma":[0.5222091,4.8094535e-7,0.47599792,0.0015172078,0.00006838597,0.00016954099,0.000015859416,0.000020955162,5.3301983e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99509674,0.00023383576,0.00043894927,0.0021483693,0.0010384942,0.001043634],"domain_scores_gemma":[0.9950159,0.002141562,0.00020844032,0.0018705806,0.0005446961,0.00021877974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026020287,0.00056244177,0.00058397395,0.0008576106,0.00058971497,0.0010171152,0.003512014,0.00026661454,0.000006233212],"category_scores_gemma":[0.00025939406,0.0003788368,0.00033105235,0.0022357062,0.00043867476,0.0002732881,0.0009833387,0.000738535,0.0000018777554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093724506,0.000312125,0.00030491146,0.00051170244,0.00001946738,0.00001642777,0.00079027994,0.80200785,0.00032377976,0.0008377227,0.000013117,0.19476886],"study_design_scores_gemma":[0.0012773612,0.0011185684,0.00020242261,0.0012816484,0.000012974273,0.0000022185786,0.0000020407708,0.9683342,0.020689834,0.0064415596,0.0000445836,0.00059256714],"about_ca_topic_score_codex":0.000023122662,"about_ca_topic_score_gemma":0.000050679042,"teacher_disagreement_score":0.47333327,"about_ca_system_score_codex":0.0002138626,"about_ca_system_score_gemma":0.0018956406,"threshold_uncertainty_score":0.99986637},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053278087,0.0016262501,0.9946035,0.00028194298,0.0009888406,0.00026979193,8.4253196e-7,0.00008465051,0.0020908783],"genre_scores_gemma":[0.11734279,0.00078191113,0.8791604,0.0013443817,0.000654397,0.00003855429,0.000021790882,0.000038517188,0.0006172305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640965,0.000067107045,0.00061057956,0.0013848136,0.00090158544,0.00062626385],"domain_scores_gemma":[0.9981303,0.0002840798,0.00020088388,0.0010349108,0.0002214207,0.0001283918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083193893,0.0003827006,0.0005337564,0.0012633232,0.00013221394,0.0005946189,0.003038384,0.0002632356,0.000012953994],"category_scores_gemma":[0.00015203642,0.0003372723,0.00010627421,0.0018016617,0.00020874405,0.001978439,0.00087906397,0.00064133375,0.00005668524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.0023897e-7,0.000014332124,0.00009055429,0.000013545468,0.0000012725527,0.000011171432,0.00033165675,0.48321822,0.000010997424,0.0005456125,0.000012539069,0.51574963],"study_design_scores_gemma":[0.00014722483,0.000029119296,0.000032063523,0.00022552261,0.0000026612543,0.0000042735223,1.3848997e-7,0.93199515,0.00005373565,0.06674233,0.00040398265,0.00036380542],"about_ca_topic_score_codex":0.00006253584,"about_ca_topic_score_gemma":0.00038645702,"teacher_disagreement_score":0.5153858,"about_ca_system_score_codex":0.00040568822,"about_ca_system_score_gemma":0.000759906,"threshold_uncertainty_score":0.9999079},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40412766,0.00050628174,0.5939303,0.0005802747,0.00038461506,0.00043472307,0.000008890489,0.00002054713,0.000006718946],"genre_scores_gemma":[0.80530965,0.0002643173,0.19331414,0.00084065093,0.00021200955,0.000017429615,0.000018799567,0.000022821401,1.8943318e-7],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9945982,0.00014296736,0.0011457398,0.0013235704,0.0010908575,0.0016986548],"domain_scores_gemma":[0.99767256,0.0005108501,0.00025329323,0.0008719523,0.00032381277,0.000367547],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002370412,0.0006530755,0.00064074516,0.0012955067,0.00038227506,0.0004911511,0.0018453122,0.0005968478,0.00001962608],"category_scores_gemma":[0.0024315265,0.0005411861,0.00010318873,0.0033763193,0.0032715958,0.00016472902,0.0016412823,0.0010487608,0.000011161444],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018236283,0.00024800136,0.027503235,0.00025135826,0.000012808986,0.00003664409,0.012073132,0.10227937,0.061533235,0.000019530857,0.0000015538386,0.79585874],"study_design_scores_gemma":[0.00038859656,0.00069638115,0.0104147885,0.00029624847,0.0000051741886,0.000050309205,0.000015615205,0.43849546,0.5377704,0.0111521045,0.000020383111,0.00069455116],"about_ca_topic_score_codex":0.00046922424,"about_ca_topic_score_gemma":0.006332795,"teacher_disagreement_score":0.7951642,"about_ca_system_score_codex":0.00020738562,"about_ca_system_score_gemma":0.0008752504,"threshold_uncertainty_score":0.99970394},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012808258,0.00019060679,0.99725926,0.00029548755,0.000379721,0.00070620736,0.000002536276,0.00010094454,0.0009371599],"genre_scores_gemma":[0.16867574,0.00024039026,0.82844776,0.0016111067,0.00049349345,0.00012084011,0.000044241326,0.000041510215,0.00032490538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734414,0.000045374007,0.00045920047,0.0010503376,0.0007134752,0.0003874856],"domain_scores_gemma":[0.9980272,0.00020008518,0.00036640486,0.0012125327,0.00010903016,0.0000847712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008223549,0.0002696343,0.00030783817,0.0005811822,0.00010457162,0.00019650508,0.0019584212,0.00011002731,0.0000069574467],"category_scores_gemma":[0.0000110671235,0.00026597962,0.000044883127,0.0010470303,0.00030205367,0.00040765168,0.0012973769,0.00021940928,0.000007712065],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012869929,0.000016398317,0.00020101266,0.000054819204,0.0000055734595,0.000007937288,0.00016804521,0.01739896,0.00003921928,0.004528932,0.00022970297,0.9773481],"study_design_scores_gemma":[0.00034663873,0.00014500582,0.00083163223,0.00010536078,0.000010038542,0.000016256621,3.1907126e-7,0.94774604,0.0007402296,0.04384814,0.0058704657,0.00033984697],"about_ca_topic_score_codex":0.00006501585,"about_ca_topic_score_gemma":0.00013766359,"teacher_disagreement_score":0.9770083,"about_ca_system_score_codex":0.0003611823,"about_ca_system_score_gemma":0.00041710524,"threshold_uncertainty_score":0.99997926},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001949895,0.0019028011,0.9950952,0.00096704543,0.00030794914,0.0006807441,0.0000012681136,0.00035629945,0.00049372076],"genre_scores_gemma":[0.031259093,0.0005323294,0.9662406,0.00024181367,0.0003483098,0.00007941524,0.000016508682,0.000075212054,0.0012067504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99441683,0.00014240832,0.00039490047,0.0017146635,0.002499619,0.00083156937],"domain_scores_gemma":[0.995904,0.0020434533,0.00013103467,0.0010651808,0.00060925947,0.000247054],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0031668325,0.0004744872,0.00052694004,0.0011581657,0.00051514246,0.0010736274,0.0015506905,0.00036797635,0.000027296146],"category_scores_gemma":[0.00088300696,0.0003981685,0.00007269475,0.0013942011,0.00059801183,0.000834724,0.0015763685,0.00311378,0.000011976537],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021432857,0.00006369014,0.0015222494,0.00072228315,0.00004698933,0.0004839568,0.0005439309,0.0033778476,0.0021125793,0.002234905,0.000052549836,0.9888176],"study_design_scores_gemma":[0.0005923842,0.0008618312,0.0033736445,0.0072464123,0.000018395582,0.0008177354,8.5472084e-7,0.97124803,0.0031325666,0.0060121175,0.005531714,0.001164325],"about_ca_topic_score_codex":0.000016452756,"about_ca_topic_score_gemma":0.000027248103,"teacher_disagreement_score":0.98765326,"about_ca_system_score_codex":0.0005648544,"about_ca_system_score_gemma":0.00096835935,"threshold_uncertainty_score":0.99996334},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005422636,0.0006557869,0.99076885,0.00021971876,0.004701986,0.000988232,0.00002157905,0.0004063108,0.0021833105],"genre_scores_gemma":[0.006286554,0.000040455958,0.9918566,0.00035538897,0.00034913546,0.00007245499,0.00001713142,0.00003984771,0.0009824412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546486,0.0001285163,0.0008257795,0.0019475177,0.00092099,0.0007123547],"domain_scores_gemma":[0.9948389,0.0012494402,0.00047443778,0.0024245807,0.00082980795,0.00018285759],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027731159,0.0005320251,0.00069831655,0.00063632504,0.0002770623,0.0008125903,0.0032552367,0.00035716555,0.0000060583907],"category_scores_gemma":[0.00093257846,0.0005115759,0.00018172311,0.0008752034,0.0005922372,0.00071585143,0.0010846215,0.00069526955,0.000015605528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013546411,0.000045313387,0.000035743706,0.00026477437,0.00001974807,0.000027004698,0.0008453184,0.03630097,0.00030196688,0.122995414,0.00002911379,0.8391211],"study_design_scores_gemma":[0.00022219736,0.00015513493,0.00011369945,0.0003921364,0.000007763724,0.000043621927,1.7169852e-7,0.91234267,0.0019305797,0.07627179,0.00786328,0.000656952],"about_ca_topic_score_codex":0.00004409031,"about_ca_topic_score_gemma":0.000034156456,"teacher_disagreement_score":0.8760417,"about_ca_system_score_codex":0.0005045718,"about_ca_system_score_gemma":0.00076058815,"threshold_uncertainty_score":0.99973357},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015224943,0.000048414182,0.97850126,0.0008195565,0.0016876138,0.0014425422,0.00010721407,0.00009166818,0.0020768004],"genre_scores_gemma":[0.99154675,0.000003985697,0.005065727,0.002274381,0.00031764782,0.000033496697,0.000630912,0.000036702164,0.00009041331],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9976449,0.00006844354,0.0003979472,0.0009563672,0.0004970984,0.0004352146],"domain_scores_gemma":[0.99859834,0.00014436507,0.00021515987,0.00043137948,0.00038075095,0.00023003259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039655893,0.0003457028,0.00034177955,0.0007894004,0.00014612754,0.00008618344,0.00031770676,0.00023698567,0.00040297143],"category_scores_gemma":[0.000074396754,0.0003157149,0.00006181864,0.0003313748,0.0002373448,0.00012879257,0.00009946957,0.00040051594,0.00035460308],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006108766,0.0003336008,0.009406505,0.000041631054,0.000036931357,0.00003167,0.0007563524,0.00439517,0.0000046686578,0.002487996,0.00022434584,0.98167026],"study_design_scores_gemma":[0.0063998518,0.0019488987,0.9218233,0.0026116928,0.00015253392,0.000014239883,9.690657e-7,0.013591584,0.000053168493,0.04432457,0.0071599497,0.0019192066],"about_ca_topic_score_codex":0.000027854101,"about_ca_topic_score_gemma":0.00031862574,"teacher_disagreement_score":0.97975105,"about_ca_system_score_codex":0.00021749848,"about_ca_system_score_gemma":0.00007084689,"threshold_uncertainty_score":0.9999295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.0107664e-7,0.00031135546,0.98617095,0.0014272298,0.007295246,0.0012637808,0.000013244373,0.00042736583,0.0030902044],"genre_scores_gemma":[0.19680397,0.00008236418,0.7966667,0.0023138484,0.0034204952,0.00015060575,0.000052508112,0.00012141842,0.00038810782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637026,0.000048799688,0.0007141494,0.001590389,0.0007180363,0.0005583651],"domain_scores_gemma":[0.99749225,0.0004688928,0.00045455783,0.001080641,0.00029940644,0.00020427756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074997626,0.00054982834,0.000691348,0.00054206303,0.00026362872,0.0008992983,0.002834524,0.0004434544,0.000006677471],"category_scores_gemma":[0.00008696216,0.00050418824,0.00018867153,0.0004189731,0.00014811364,0.00072203134,0.0008322087,0.00052755064,0.00001609735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001746108,0.000038269896,0.000033468445,0.0002837087,0.000056428216,0.000027464972,0.0013860513,0.008590339,0.00012804917,0.28165084,0.0010371306,0.7067508],"study_design_scores_gemma":[0.00046014108,0.00036986903,0.000010648347,0.00033182674,0.000012625616,0.000031363328,4.5745702e-7,0.80479646,0.0005848829,0.14347462,0.049033582,0.0008935183],"about_ca_topic_score_codex":0.000038062484,"about_ca_topic_score_gemma":0.000026958855,"teacher_disagreement_score":0.7962061,"about_ca_system_score_codex":0.00040963117,"about_ca_system_score_gemma":0.00035239308,"threshold_uncertainty_score":0.99974096},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005894607,0.0026668382,0.9886083,0.00010273191,0.004090688,0.0005204887,0.00012578131,0.00015043328,0.003675805],"genre_scores_gemma":[0.85013056,0.00006650865,0.14454938,0.00025498393,0.0019037875,0.00007076124,0.00015820541,0.00007811763,0.002787677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534297,0.00009797502,0.0010586181,0.0012019691,0.0013444822,0.0009540083],"domain_scores_gemma":[0.996089,0.00039235264,0.0007927364,0.0020159078,0.00045456024,0.00025547258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015500896,0.00054016826,0.0009482695,0.00053142046,0.00015824476,0.00044063793,0.0047107455,0.00041240558,0.000004568879],"category_scores_gemma":[0.0001233408,0.0004685281,0.00016647964,0.0015650718,0.000612059,0.00075713295,0.0013190364,0.00063239137,0.000033749824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017671347,0.000427791,0.0016232562,0.001560644,0.000100083904,0.00015974397,0.0021241277,0.44261044,0.00044984615,0.21005064,0.0011244139,0.33975133],"study_design_scores_gemma":[0.00049777405,0.00017103068,0.00098106,0.0019374304,0.000018236156,0.00015516585,5.1125494e-7,0.91547394,0.00077220844,0.0047357352,0.074064575,0.001192325],"about_ca_topic_score_codex":0.0000539628,"about_ca_topic_score_gemma":0.000016251202,"teacher_disagreement_score":0.8500716,"about_ca_system_score_codex":0.00051572983,"about_ca_system_score_gemma":0.0012954817,"threshold_uncertainty_score":0.99977666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006304136,0.000059307426,0.9975302,0.00018330927,0.0005853721,0.00051500846,0.00009739079,0.00017723371,0.0007890876],"genre_scores_gemma":[0.07849707,0.00007703232,0.912905,0.0027780777,0.0010203016,0.000125639,0.0027565428,0.00017087115,0.0016695152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655706,0.000028072447,0.00046931495,0.0014014663,0.0010470545,0.0004970585],"domain_scores_gemma":[0.9980528,0.00018265398,0.0002446086,0.0009691327,0.00038143172,0.00016939342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066823844,0.0004184996,0.000391019,0.0006926681,0.00053804,0.00081050274,0.0020697296,0.00013591985,0.00013027772],"category_scores_gemma":[0.000067609726,0.0003718084,0.000070308466,0.0008594347,0.00026237592,0.0016499228,0.0006395507,0.00028701307,0.0000027642473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019014056,0.00016859962,0.0002729558,0.00010217966,0.000031277952,0.000051028863,0.00064498803,0.29929608,0.00007026381,0.39767796,0.00009769541,0.30156797],"study_design_scores_gemma":[0.0003236132,0.00044098563,0.00001729722,0.00017080024,0.000016050592,0.000040480223,9.70491e-7,0.9640779,0.00038886588,0.025697535,0.0082814405,0.00054410007],"about_ca_topic_score_codex":0.000022097805,"about_ca_topic_score_gemma":0.00015183642,"teacher_disagreement_score":0.6647818,"about_ca_system_score_codex":0.00027419202,"about_ca_system_score_gemma":0.00094641896,"threshold_uncertainty_score":0.9998734},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011900051,0.0002454629,0.990812,0.00067887566,0.0016908936,0.00087271375,0.0000021647666,0.0001939058,0.00538498],"genre_scores_gemma":[0.027919672,0.00010966752,0.96888983,0.002312287,0.0004769241,0.000053164425,0.000013274156,0.000026914238,0.00019826043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572146,0.00010737109,0.00077519234,0.0014286764,0.0011331246,0.00083417253],"domain_scores_gemma":[0.9974096,0.00045695493,0.00029793702,0.0014890195,0.00016293905,0.00018354885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018429953,0.0005553858,0.0006055321,0.0017986654,0.0001635003,0.00095390104,0.003358573,0.0002938686,0.0000044583185],"category_scores_gemma":[0.00008287572,0.000535257,0.00007733753,0.0017175096,0.0005318994,0.0015509862,0.0033048955,0.0007978152,0.000050699164],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020327764,0.000030813408,0.00009082446,0.00015993048,0.000005274405,0.000062462976,0.00062226225,0.017850488,0.000001538107,0.008688515,0.00006806386,0.9724178],"study_design_scores_gemma":[0.00044261897,0.0001343565,0.0029425162,0.00027343634,0.000004083052,0.00006945638,2.5048715e-7,0.804444,0.000043301345,0.1872277,0.0038404625,0.0005778069],"about_ca_topic_score_codex":0.000040360435,"about_ca_topic_score_gemma":0.00015925203,"teacher_disagreement_score":0.97183996,"about_ca_system_score_codex":0.00087930786,"about_ca_system_score_gemma":0.0005215086,"threshold_uncertainty_score":0.9997099},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021345306,0.0017323012,0.9920653,0.00063940266,0.0024513437,0.0003319754,0.0000059921936,0.00024834432,0.00039078118],"genre_scores_gemma":[0.2624127,0.000084677624,0.7324464,0.0015162932,0.00089523644,0.000011285257,0.00002234318,0.000074263975,0.0025368256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948806,0.00016788462,0.00077876594,0.0020288834,0.0013335906,0.00081023516],"domain_scores_gemma":[0.99666774,0.0008227089,0.00044229793,0.0014272355,0.00042718733,0.00021280386],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010197167,0.0006643164,0.0007765749,0.00045110338,0.00047596986,0.0012229074,0.002785133,0.00041615168,0.000048321846],"category_scores_gemma":[0.0004099682,0.0006453435,0.00016537844,0.00040813896,0.0003789399,0.0004310388,0.0017119655,0.0015072549,0.00001399726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020404255,0.00003191091,0.00017331807,0.00008900141,0.00005430158,0.00035925762,0.0020795946,0.22694717,0.031713437,0.018061366,0.000081288716,0.72038895],"study_design_scores_gemma":[0.0004708781,0.00013847434,0.00002245034,0.00040860806,0.000012060687,0.00009872769,8.449005e-7,0.98143697,0.005077303,0.008494785,0.0029599862,0.0008789319],"about_ca_topic_score_codex":0.000026982118,"about_ca_topic_score_gemma":0.000075588076,"teacher_disagreement_score":0.7544898,"about_ca_system_score_codex":0.00036816296,"about_ca_system_score_gemma":0.000959586,"threshold_uncertainty_score":0.9998139},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000107415886,0.00057388516,0.99549633,0.00053962186,0.0010906284,0.00053102884,0.0000020445427,0.00022682491,0.0014322263],"genre_scores_gemma":[0.08927796,0.000052315612,0.90903664,0.0012974254,0.00015940706,0.000026232809,0.00002748416,0.000017542834,0.00010500907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969919,0.00005669406,0.00062400306,0.0010515341,0.0008268776,0.00044902315],"domain_scores_gemma":[0.997765,0.00016128848,0.00042677877,0.0012125262,0.00031592717,0.00011846337],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001271405,0.00039067282,0.00038001538,0.0010620297,0.00018740704,0.0025811049,0.0037202828,0.0003885527,0.000037008722],"category_scores_gemma":[0.000099902674,0.00037758052,0.00005748501,0.00075549306,0.00014321541,0.009146947,0.0012729265,0.0010349149,0.00001929527],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007124618,0.000043490098,0.00003001838,0.00002928125,0.0000027882218,0.000069501024,0.0006537411,0.004362108,0.00072514475,0.01533386,0.000013712411,0.97872925],"study_design_scores_gemma":[0.000469475,0.00024365284,0.00035198356,0.001049406,0.000007795087,0.00031294092,0.0000016923111,0.603454,0.026142452,0.36369693,0.0030868053,0.0011828872],"about_ca_topic_score_codex":0.00014875963,"about_ca_topic_score_gemma":0.00039453246,"teacher_disagreement_score":0.97754633,"about_ca_system_score_codex":0.00075911306,"about_ca_system_score_gemma":0.000646338,"threshold_uncertainty_score":0.9998676},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007822099,0.00067356444,0.98767775,0.0002162064,0.0009856111,0.00039565135,0.00003527742,0.000015138065,0.0021786976],"genre_scores_gemma":[0.5806397,0.00009357478,0.41688457,0.0010535653,0.00061537605,0.000010167243,0.00011833842,0.00006203139,0.00052266306],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99824136,0.000014547383,0.00031215395,0.0007356873,0.000383224,0.00031302162],"domain_scores_gemma":[0.99867314,0.00003642482,0.00020681738,0.0007884086,0.0002084441,0.00008675808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003383207,0.00029066342,0.00029136162,0.00024230866,0.000070469105,0.00003513443,0.00079418486,0.00039107978,0.000031724718],"category_scores_gemma":[0.000051488776,0.00027473562,0.0001224108,0.00011452559,0.0010766577,0.000003978514,0.0002987033,0.00032494793,0.000007177574],"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.000023032248,0.000033343684,0.0002378562,0.00008308474,0.000030995692,0.000025664138,0.00007349145,0.007878417,0.8680592,0.000105393505,0.000009982927,0.1234395],"study_design_scores_gemma":[0.00090694445,0.00072031,0.00018245116,0.00022816416,0.000041253046,0.000060511396,2.7035094e-7,0.01631268,0.9661192,0.0074182115,0.006995995,0.0010139552],"about_ca_topic_score_codex":0.000011972689,"about_ca_topic_score_gemma":0.00006437603,"teacher_disagreement_score":0.5728176,"about_ca_system_score_codex":0.000041809242,"about_ca_system_score_gemma":0.0005666477,"threshold_uncertainty_score":0.9999705},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012862419,0.022703532,0.9677709,0.005854112,0.001366181,0.00012524812,7.865972e-7,0.00014606751,0.0019045474],"genre_scores_gemma":[0.09849395,0.0009505169,0.89747435,0.00076872826,0.0008272907,0.000009646724,0.000007140947,0.000039529405,0.0014288311],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971666,0.00005817264,0.00028385667,0.0013898723,0.00063504797,0.00046648335],"domain_scores_gemma":[0.9979879,0.00069134997,0.00016396066,0.0008580255,0.00014009271,0.0001586665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007761493,0.00036179484,0.00035232987,0.00043886417,0.0002920211,0.0006769633,0.0015462503,0.00021937722,0.000014498744],"category_scores_gemma":[0.00016756932,0.0003473882,0.000075892305,0.00020686719,0.00032671832,0.00038801064,0.0010505256,0.0008909063,0.000014901919],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.8264806e-7,0.000016665663,0.000029747962,0.000030827814,0.000006404385,0.000022483579,0.0018674602,0.0009648886,0.000010056074,0.07704203,0.0000050738167,0.9200038],"study_design_scores_gemma":[0.0009687234,0.0006474506,0.010060171,0.0038261865,0.000044583805,0.0011954433,0.000008965165,0.25221142,0.00035726404,0.5056977,0.2207757,0.004206379],"about_ca_topic_score_codex":0.00001289625,"about_ca_topic_score_gemma":0.000055453926,"teacher_disagreement_score":0.9157974,"about_ca_system_score_codex":0.00011321521,"about_ca_system_score_gemma":0.00051213155,"threshold_uncertainty_score":0.99989784},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050070025,0.00041252392,0.99232215,0.0003272155,0.0008074633,0.00048338997,0.0000043747855,0.00008902518,0.000546863],"genre_scores_gemma":[0.7943016,0.000014479771,0.20416582,0.0011193373,0.00031652203,0.000011790278,0.0000042495117,0.000028345672,0.00003781069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99415195,0.00017080369,0.0007656459,0.0017078636,0.002673545,0.0005302136],"domain_scores_gemma":[0.9953564,0.00024895175,0.00041260084,0.0029264183,0.0008708363,0.00018478704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017365543,0.0004956361,0.0007080381,0.0005241539,0.00021609853,0.0006211063,0.0052059293,0.00020446788,0.00002215332],"category_scores_gemma":[0.00005446796,0.00045193598,0.00011773084,0.0005481791,0.00023957503,0.000875681,0.0023422176,0.00062702934,0.000007311676],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019839155,0.0023974658,0.0026934429,0.0004581637,0.00015886265,0.00072894816,0.047229424,0.02577254,0.0013117038,0.004714395,0.000026072663,0.91448915],"study_design_scores_gemma":[0.002836704,0.0062080687,0.0101474365,0.0030755748,0.00013426562,0.000106688196,0.00017536205,0.87628317,0.01006933,0.08726925,0.0005493765,0.00314477],"about_ca_topic_score_codex":0.0002699974,"about_ca_topic_score_gemma":0.001748474,"teacher_disagreement_score":0.91134435,"about_ca_system_score_codex":0.00033870482,"about_ca_system_score_gemma":0.0008332853,"threshold_uncertainty_score":0.99979323},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006324293,0.00034479797,0.99477994,0.0006264893,0.0018888972,0.0005526687,0.000008339257,0.00010236597,0.0016332497],"genre_scores_gemma":[0.3071794,0.00005785342,0.6840068,0.0035553449,0.0026338382,0.00007793146,0.000063661755,0.0000875291,0.0023376062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666643,0.00002792334,0.0005121126,0.0013638841,0.0009017671,0.0005278706],"domain_scores_gemma":[0.9982472,0.00016235128,0.00035370432,0.0007774208,0.00036061957,0.0000987273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006905774,0.0003898731,0.00046460755,0.00038167118,0.00040021064,0.00064813497,0.0022160683,0.0002966875,0.000009628779],"category_scores_gemma":[0.000012644453,0.00037422698,0.00017358242,0.00031299336,0.0001334907,0.00097110466,0.0008409518,0.00027061603,0.000012433874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001231123,0.00008831388,0.00004848959,0.0006553554,0.000060277827,0.000055116037,0.0058045443,0.056274123,0.0007222228,0.31015143,0.00015187399,0.62597597],"study_design_scores_gemma":[0.0003150882,0.000052872485,0.000036255853,0.0003164429,0.0000073829056,0.000009262942,2.801404e-7,0.86751187,0.00062713376,0.12891354,0.0017762745,0.0004335934],"about_ca_topic_score_codex":0.000029229312,"about_ca_topic_score_gemma":0.000099315905,"teacher_disagreement_score":0.81123775,"about_ca_system_score_codex":0.00024585635,"about_ca_system_score_gemma":0.000328173,"threshold_uncertainty_score":0.99987096},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46656784,0.00006836628,0.53210366,0.00027227588,0.00055344356,0.00033174147,0.0000017069435,0.000098983015,0.000001989653],"genre_scores_gemma":[0.66713744,0.000006061643,0.3326193,0.00006998065,0.00011540912,0.000015931144,0.00001670598,0.000013548283,0.000005607327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956818,0.00016957828,0.0008328658,0.0016478584,0.0009789634,0.0006889407],"domain_scores_gemma":[0.9961496,0.0013265159,0.00069313264,0.0010375702,0.0006580104,0.00013517526],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013708681,0.0005155812,0.0012586019,0.00077344803,0.0003654703,0.0006518596,0.003080995,0.0002245497,0.000002184721],"category_scores_gemma":[0.00078414375,0.00043872496,0.00023924082,0.0018402557,0.00025877412,0.00041332885,0.0039208354,0.002312503,0.00000124319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005729288,0.00057804276,0.037868083,0.0000762281,0.000046238172,0.00001679436,0.013923223,0.88313615,0.000078544144,0.000051371273,4.7402108e-7,0.06421913],"study_design_scores_gemma":[0.0007231711,0.000838792,0.012963762,0.0002902996,0.000021888362,0.0000074456725,0.00017070555,0.9807132,0.0004674231,0.0033182215,0.000012523986,0.0004725968],"about_ca_topic_score_codex":0.000115012386,"about_ca_topic_score_gemma":0.00026590773,"teacher_disagreement_score":0.2005696,"about_ca_system_score_codex":0.00015065183,"about_ca_system_score_gemma":0.0006553522,"threshold_uncertainty_score":0.9999892},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017862789,0.00064358884,0.9928342,0.0009875415,0.0027546175,0.00077080843,0.0000063296793,0.00021096438,0.000005660686],"genre_scores_gemma":[0.2810517,0.000041426956,0.71792835,0.00070753804,0.00016909548,0.0000705492,0.000011251144,0.00001690792,0.0000031739237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958908,0.000121024364,0.0005488414,0.0018697968,0.00069885753,0.00087068905],"domain_scores_gemma":[0.99688786,0.0005837584,0.00021744797,0.0014821632,0.0006006437,0.00022813227],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012932913,0.00041461736,0.00050049974,0.00056709524,0.00036516512,0.0022466823,0.003867422,0.00026534867,0.000006728709],"category_scores_gemma":[0.0007323595,0.00040282102,0.00016090737,0.0014534829,0.00036015495,0.0005537033,0.0039405925,0.00080339017,0.0000053520353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025590653,0.000095352945,0.00019274048,0.00015364923,0.0000090849335,0.000031933127,0.0016960852,0.53849894,0.000573318,0.00025508364,0.0000050114704,0.45848626],"study_design_scores_gemma":[0.00047260965,0.00006542722,0.00008586231,0.00032745194,0.0000043627365,0.000025046576,9.793301e-7,0.9916436,0.0040754233,0.0026749442,0.00016026082,0.00046401037],"about_ca_topic_score_codex":0.000022438051,"about_ca_topic_score_gemma":0.000032340682,"teacher_disagreement_score":0.45802227,"about_ca_system_score_codex":0.00022097751,"about_ca_system_score_gemma":0.0014307703,"threshold_uncertainty_score":0.99984235},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018216751,0.00043481012,0.99541855,0.0013587764,0.00046841448,0.0012440641,0.000021512224,0.00022060561,0.0006510885],"genre_scores_gemma":[0.32851142,0.00007555262,0.66853446,0.002264249,0.0004095109,0.000047692673,0.000022563294,0.000043541004,0.0000910323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658394,0.000054460314,0.00055816537,0.0013122342,0.0008349493,0.0006562534],"domain_scores_gemma":[0.99748534,0.0009147868,0.0002827003,0.0007453594,0.00034491307,0.00022688268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016454096,0.00051954086,0.00053475035,0.00055800634,0.00034856467,0.00047566535,0.0013715692,0.0004135713,0.000022078226],"category_scores_gemma":[0.00024063651,0.00039495088,0.00016903286,0.0004107688,0.0007769848,0.0003929296,0.0002135669,0.0005575295,0.000012792327],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001416187,0.000103596714,0.00001281002,0.00009558554,0.0000114579925,0.00002208296,0.0005524895,0.00067865726,0.0049548266,0.058682002,0.000010114381,0.93473476],"study_design_scores_gemma":[0.0006469149,0.000703101,0.000331569,0.00022994414,0.000016499243,0.000036021604,2.8679946e-7,0.91792285,0.026871309,0.051872026,0.0006860167,0.0006834667],"about_ca_topic_score_codex":0.0000021228059,"about_ca_topic_score_gemma":0.0000017007387,"teacher_disagreement_score":0.9340513,"about_ca_system_score_codex":0.00023205677,"about_ca_system_score_gemma":0.00030896347,"threshold_uncertainty_score":0.9998502},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014549965,0.00028237308,0.99182546,0.00041514885,0.0033692168,0.00065272633,0.00008660231,0.00007333763,0.003149639],"genre_scores_gemma":[0.035707045,0.000005580791,0.9599285,0.0007342248,0.0008233364,0.000055545854,0.000045995595,0.000044997578,0.002654756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99224275,0.00020796408,0.0012475334,0.0024581961,0.003215846,0.0006277337],"domain_scores_gemma":[0.9877939,0.00813995,0.0007115374,0.0018611772,0.0012815535,0.00021185595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.009397755,0.00051511964,0.0010108902,0.0030870792,0.0003733831,0.0008532507,0.0022335395,0.00035764967,0.0006781964],"category_scores_gemma":[0.0054546627,0.0004260315,0.0007231926,0.00344786,0.0005541763,0.0002597872,0.00063301553,0.00054036087,0.000021362537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025183355,0.000037228234,0.0029221233,0.000018736922,0.00008458037,0.000015766309,0.00015287427,0.15492512,0.000058304588,0.00089320564,0.00017326463,0.8406936],"study_design_scores_gemma":[0.00031106386,0.0001489721,0.0023885432,0.00016437747,0.00018583403,0.00000783433,3.8003185e-7,0.86292225,0.00078127626,0.126648,0.0059853126,0.00045615385],"about_ca_topic_score_codex":0.000009335289,"about_ca_topic_score_gemma":0.00007817371,"teacher_disagreement_score":0.84023744,"about_ca_system_score_codex":0.00038819623,"about_ca_system_score_gemma":0.00084867544,"threshold_uncertainty_score":0.99981916},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06638571,0.0014231215,0.9282493,0.00008360502,0.0031179953,0.00030506848,0.000040431274,0.00038145468,0.00001333697],"genre_scores_gemma":[0.7652712,0.00003252537,0.23435375,0.000026470028,0.00021839522,0.000019303594,0.00004648407,0.00003135233,5.304732e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971253,0.000049011705,0.00079296087,0.00096701854,0.0005799623,0.0004857072],"domain_scores_gemma":[0.9975655,0.00039883636,0.00013512193,0.0015256072,0.0002732322,0.000101683894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067075086,0.00044648044,0.0010243332,0.0012600162,0.000049512033,0.00014744712,0.0011784639,0.00022763916,0.000026736758],"category_scores_gemma":[0.000612394,0.00045173976,0.00027123923,0.00416165,0.00019281305,0.00013027496,0.0008978628,0.0007328353,0.0000016283569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002651808,0.000018406534,0.0009765641,0.0004032399,0.00023740083,0.000037995484,0.00077045365,0.90567636,0.00068169035,0.0000021704348,0.0000017918583,0.091191284],"study_design_scores_gemma":[0.000083782004,0.000016140795,0.013706285,0.00038387053,0.00014556824,0.000020259347,9.054927e-7,0.9605848,0.024524791,0.000055181703,0.00003810157,0.00044031945],"about_ca_topic_score_codex":0.00022900743,"about_ca_topic_score_gemma":0.00018069208,"teacher_disagreement_score":0.6988855,"about_ca_system_score_codex":0.00053002936,"about_ca_system_score_gemma":0.0004478332,"threshold_uncertainty_score":0.9997934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022367767,0.0007643987,0.99511045,0.0006727879,0.0010525807,0.0008599238,0.000007993294,0.00023548413,0.0012740343],"genre_scores_gemma":[0.03728056,0.00007483844,0.9613508,0.00080788694,0.00031301842,0.000021983047,0.000024409783,0.000040758063,0.00008574487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608564,0.00006581181,0.0007021559,0.001710469,0.00070360885,0.0007322963],"domain_scores_gemma":[0.9972128,0.0008497095,0.00032055465,0.0011588566,0.0003239555,0.00013410122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009996417,0.00054362393,0.0006990258,0.0013080182,0.00030544534,0.0006583261,0.0025747663,0.00041677893,0.000009525794],"category_scores_gemma":[0.00009984133,0.0005194209,0.00022768682,0.0010982157,0.0006117349,0.0005033066,0.0013265961,0.00076839066,0.0000017087874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007829882,0.00005006812,0.000040420462,0.000110713416,0.0000138351415,0.00009827097,0.00058383663,0.5544876,0.00011398687,0.010427933,0.000012611549,0.4340529],"study_design_scores_gemma":[0.00039274726,0.00013243173,0.000077390236,0.0008507246,0.00000910394,0.000044676566,6.467413e-7,0.96209913,0.0036890905,0.03170378,0.0003353364,0.00066493324],"about_ca_topic_score_codex":0.00003772085,"about_ca_topic_score_gemma":0.00010783181,"teacher_disagreement_score":0.433388,"about_ca_system_score_codex":0.0001902037,"about_ca_system_score_gemma":0.00040837444,"threshold_uncertainty_score":0.99972576},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010592235,0.00008487,0.9798955,0.005105201,0.0032193065,0.0005190277,0.00001534225,0.000561957,0.0000065740796],"genre_scores_gemma":[0.7490864,0.0000027973076,0.24911886,0.0012720753,0.00038951225,0.000083187784,0.000033158154,0.000010390548,0.0000036539334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709195,0.00014236075,0.00034660456,0.0009873671,0.00064768887,0.0007840347],"domain_scores_gemma":[0.99796015,0.0007461761,0.00012252167,0.00070573564,0.00023655557,0.0002288706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016376706,0.00020016266,0.00018744796,0.00050771114,0.0005429034,0.00030534525,0.0013836167,0.00007768671,0.000006227966],"category_scores_gemma":[0.00035703377,0.00019316663,0.00010764583,0.003732392,0.00022440027,0.000631867,0.00041390845,0.00030181574,0.000021406295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001922777,0.000025801262,0.06546776,0.000064145424,0.000002948659,0.0000074836444,0.00011857915,0.8610008,0.00007787525,0.0018478424,0.00027946918,0.071088076],"study_design_scores_gemma":[0.00027544747,0.000105420644,0.12529081,0.000120607365,0.0000027569488,0.0000034310415,1.6999459e-7,0.8441831,0.000035692527,0.029643161,0.00018368635,0.00015570666],"about_ca_topic_score_codex":0.000042573018,"about_ca_topic_score_gemma":0.000031998876,"teacher_disagreement_score":0.7384941,"about_ca_system_score_codex":0.00017277824,"about_ca_system_score_gemma":0.00046418514,"threshold_uncertainty_score":0.78771067},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008194999,0.0010239834,0.9950669,0.00037342025,0.0018241871,0.0006798468,0.00001801912,0.00016614888,0.0007655555],"genre_scores_gemma":[0.004910566,0.00005689826,0.9929279,0.00055750395,0.0006544186,0.00005122087,0.00001634844,0.000059395185,0.0007657492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99455035,0.000064207685,0.0005851083,0.0023180651,0.0012937102,0.0011885341],"domain_scores_gemma":[0.9959862,0.0009999836,0.0002577501,0.0018338636,0.0006489691,0.00027320097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014781511,0.0006161492,0.0006419034,0.0010113883,0.0005528116,0.0009110195,0.0043735085,0.00032181508,0.000021024623],"category_scores_gemma":[0.00024423082,0.00059753796,0.00028672046,0.001021008,0.00084544823,0.0007743638,0.0019180146,0.0010428061,0.000011548276],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006090478,0.000023913844,0.00002081589,0.00004101261,0.000019299401,0.00009142033,0.00024560478,0.04828983,0.00073056325,0.21398866,0.000015843303,0.73652697],"study_design_scores_gemma":[0.0003171503,0.00020482841,0.000012836496,0.00017493386,0.000004955428,0.00006081511,2.298975e-7,0.6288813,0.0029150217,0.36565498,0.0011499806,0.00062300666],"about_ca_topic_score_codex":0.000008795587,"about_ca_topic_score_gemma":0.00005844755,"teacher_disagreement_score":0.7359039,"about_ca_system_score_codex":0.00028149356,"about_ca_system_score_gemma":0.00087612483,"threshold_uncertainty_score":0.9996476},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026165572,0.0010186973,0.9895966,0.0008847848,0.003931522,0.00051168003,0.000014798726,0.0002588874,0.0035213418],"genre_scores_gemma":[0.058665507,0.00018832074,0.9370964,0.0026817762,0.00072736567,0.000043153148,0.00004454721,0.000120047545,0.0004328438],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99284494,0.000110272405,0.0011082569,0.0029407647,0.0016451093,0.0013506416],"domain_scores_gemma":[0.9958823,0.0005227014,0.00042833498,0.0025661865,0.00025209875,0.00034839366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010120282,0.001038888,0.0011367832,0.0021086137,0.00034023807,0.0009458281,0.0052949935,0.00054367445,0.00004741091],"category_scores_gemma":[0.000077707664,0.0010012711,0.00041062583,0.0020986947,0.0011654696,0.0009178241,0.0029990599,0.0016840135,0.000038824255],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008441216,0.00021756612,0.00037349583,0.000099213095,0.00002714785,0.001276175,0.0011448602,0.0020261281,0.00013748748,0.07627025,0.00003440324,0.91838485],"study_design_scores_gemma":[0.00049196824,0.0002216755,0.00029518286,0.00090188475,0.000011391117,0.00031837708,7.8805084e-7,0.28133774,0.0012338083,0.71100867,0.002748689,0.0014298123],"about_ca_topic_score_codex":0.000069084555,"about_ca_topic_score_gemma":0.00083489035,"teacher_disagreement_score":0.916955,"about_ca_system_score_codex":0.00046290873,"about_ca_system_score_gemma":0.000508109,"threshold_uncertainty_score":0.9992438},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1485879,0.00037580897,0.8483059,0.0010568486,0.0008336299,0.00065117783,0.000010145336,0.00017486588,0.0000037154928],"genre_scores_gemma":[0.518154,0.000013359549,0.48086345,0.0006418744,0.00021871009,0.000088959896,0.0000059991225,0.000012858049,7.6695903e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955311,0.00015314891,0.0005070422,0.0022560847,0.0009051257,0.00064753694],"domain_scores_gemma":[0.99568504,0.0008411752,0.00021518311,0.0025004598,0.00050952064,0.00024863824],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016706476,0.00041849774,0.0004917653,0.0004523985,0.00040640586,0.0015654499,0.0031725145,0.00027266546,0.0000054845914],"category_scores_gemma":[0.00036889568,0.00040622358,0.0001094367,0.00091009086,0.00055396307,0.00095118297,0.0038582624,0.00084688514,9.78284e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013968346,0.00046429853,0.0010267546,0.0005405813,0.000033116048,0.000029416873,0.019338336,0.43226832,0.015096952,0.008863708,0.000040952167,0.5222836],"study_design_scores_gemma":[0.0002881369,0.000069707756,0.0012234165,0.00022871804,0.000006599213,0.000015361202,0.0000064561054,0.9284245,0.02322702,0.045851998,0.00017149122,0.00048663496],"about_ca_topic_score_codex":0.00012234953,"about_ca_topic_score_gemma":0.00007009937,"teacher_disagreement_score":0.52179694,"about_ca_system_score_codex":0.00020833295,"about_ca_system_score_gemma":0.0008293518,"threshold_uncertainty_score":0.99983895},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007735237,0.0004679183,0.98873776,0.00024157138,0.00029253305,0.00035297126,0.0000022980475,0.008631525,0.0004999057],"genre_scores_gemma":[0.17404275,0.000019112955,0.82548803,0.00023481871,0.00008431064,0.000013123004,0.0000040158516,0.00003141787,0.00008244899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650764,0.00005489133,0.00059300184,0.0013752121,0.0008874851,0.0005817559],"domain_scores_gemma":[0.9970687,0.0006088891,0.00034846985,0.001460741,0.00040614308,0.00010707423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010641196,0.00046401634,0.00066150614,0.00092623086,0.00010068493,0.00022673186,0.002018148,0.00029436965,0.0000037392592],"category_scores_gemma":[0.0002972275,0.00039250063,0.00011702685,0.0013519461,0.00059266086,0.00033664334,0.0010798745,0.00072263775,0.0000030411168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018753424,0.0002008607,0.007888875,0.00038482016,0.000040100538,0.0013958897,0.0025320658,0.02666566,0.0001475086,0.0036653567,0.00025235265,0.95680773],"study_design_scores_gemma":[0.00028078395,0.0004095583,0.00050245924,0.0031170116,0.000009155109,0.00017425639,2.2408476e-7,0.9747446,0.0013370189,0.018307285,0.00042482553,0.0006927915],"about_ca_topic_score_codex":0.0000570972,"about_ca_topic_score_gemma":0.00016565679,"teacher_disagreement_score":0.95611495,"about_ca_system_score_codex":0.00017091901,"about_ca_system_score_gemma":0.00093596545,"threshold_uncertainty_score":0.9998527},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010211444,0.00173603,0.98973286,0.0012178451,0.0032745725,0.0003583084,0.0000024362573,0.00020093686,0.0024558417],"genre_scores_gemma":[0.14795049,0.00005529431,0.8466662,0.0019512662,0.0021610393,0.000012470125,0.0000071031154,0.000049811377,0.0011463463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99468774,0.000050646373,0.0006054502,0.0026351286,0.0012367904,0.0007842305],"domain_scores_gemma":[0.99645156,0.00029325555,0.00028614118,0.0023249455,0.00045096275,0.00019313142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008388448,0.0006543904,0.0006466184,0.00055785873,0.00037899023,0.0009198375,0.0035870874,0.0002467105,0.00003696923],"category_scores_gemma":[0.00028933736,0.00058286707,0.00018750169,0.00076016074,0.00033667195,0.00072000327,0.0024317233,0.0010649015,0.000032354495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020338503,0.000031240943,0.00024232957,0.00006792061,0.000020430294,0.00034931288,0.002308537,0.13892521,0.0022642436,0.01427585,0.000020502093,0.8414924],"study_design_scores_gemma":[0.00019543603,0.000060252176,0.00006402249,0.00029211678,0.0000064519563,0.00018351882,3.352885e-7,0.968201,0.0012920857,0.028320625,0.000585143,0.00079902046],"about_ca_topic_score_codex":0.00003429166,"about_ca_topic_score_gemma":0.000088251945,"teacher_disagreement_score":0.84069335,"about_ca_system_score_codex":0.00034652243,"about_ca_system_score_gemma":0.0010544014,"threshold_uncertainty_score":0.9996623},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7683734,0.00011936058,0.23111314,0.00012769438,0.00009525729,0.00015040442,1.4867568e-7,0.000007749601,0.000012820271],"genre_scores_gemma":[0.9996561,0.0000081126045,0.00016137619,0.00011791526,0.00004144078,0.000008169714,5.1402327e-7,0.0000049963355,0.000001422335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875265,0.00002650591,0.0003052792,0.00028702934,0.00043933248,0.00018920259],"domain_scores_gemma":[0.9993081,0.00005757882,0.0002563936,0.00020314052,0.0001680468,0.0000067185892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006005737,0.00010937664,0.00018940712,0.00008797215,0.0003277111,0.00007329597,0.0003360835,0.000018264864,8.7773486e-7],"category_scores_gemma":[0.000070265975,0.00006547656,0.000022918002,0.000919749,0.00013001691,0.00034651076,0.00031626536,0.00011643482,1.0323361e-7],"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.0000059967174,0.000045897134,0.104572885,0.0000659996,0.000004142378,0.0000013649158,0.0012028806,0.8496807,0.00013220088,0.000020674295,3.8128712e-7,0.044266857],"study_design_scores_gemma":[0.00021994529,0.000009133169,0.036743276,0.00009802014,0.000011672857,0.0000013261706,0.00010997176,0.96255064,0.00009670161,0.000084352934,0.0000019464285,0.00007298602],"about_ca_topic_score_codex":0.35448885,"about_ca_topic_score_gemma":0.7605493,"teacher_disagreement_score":0.40606043,"about_ca_system_score_codex":0.00029532993,"about_ca_system_score_gemma":0.0001488372,"threshold_uncertainty_score":0.64980966},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018714357,0.0008220724,0.9902273,0.00077989907,0.00096873345,0.0009385949,0.00007914599,0.0001285051,0.0041843294],"genre_scores_gemma":[0.8715224,0.000081100254,0.12631735,0.0016195779,0.0003495199,0.000038729664,0.000018087187,0.000041392024,0.000011807914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934911,0.00013476245,0.0008579586,0.0025295413,0.0019441533,0.0010424863],"domain_scores_gemma":[0.9955854,0.0007039591,0.00050803507,0.0025520197,0.00044805204,0.00020257784],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024300956,0.00091864186,0.0010389969,0.0009587293,0.00047136814,0.001435481,0.0059360596,0.0004899896,0.000012248958],"category_scores_gemma":[0.00010312964,0.0007227721,0.00035343153,0.0014432264,0.0007866975,0.0018199325,0.0025885943,0.0027966134,0.0000098018845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027230434,0.00044019264,0.0025902956,0.00046013258,0.00015690977,0.0013736526,0.07777041,0.11184709,0.00020753135,0.72103566,0.00037791886,0.08346793],"study_design_scores_gemma":[0.0004972147,0.0002342408,0.000118647295,0.0015309701,0.000016672033,0.000106414285,0.000016925462,0.7784066,0.00031445615,0.21731745,0.0005377204,0.00090268196],"about_ca_topic_score_codex":0.00008471193,"about_ca_topic_score_gemma":0.0010779129,"teacher_disagreement_score":0.869651,"about_ca_system_score_codex":0.00044398077,"about_ca_system_score_gemma":0.00096715044,"threshold_uncertainty_score":0.9996011},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12449667,0.000363839,0.87153405,0.0005840893,0.0023609707,0.00041931588,0.0000051841366,0.00014293997,0.000092947696],"genre_scores_gemma":[0.62053585,0.000028024348,0.37902808,0.0002969917,0.000065550084,0.000026652087,0.0000018755554,0.00001600646,9.796169e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99369204,0.00029437713,0.0006606597,0.0023727447,0.0019096168,0.0010705759],"domain_scores_gemma":[0.9924205,0.0015498201,0.00034333082,0.0049014445,0.0005495158,0.00023536631],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0020798934,0.000527354,0.00073655084,0.0016954298,0.0002309194,0.0006343971,0.011603005,0.00030547564,0.000010881067],"category_scores_gemma":[0.0013003973,0.0004996822,0.00025960797,0.004831138,0.0011297965,0.00064901076,0.01397708,0.0018761716,0.0000056218587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002745114,0.0002413404,0.0008705984,0.00020504088,0.000025775393,0.00020849732,0.0023515595,0.62359065,0.0033707612,0.047636885,0.000008270341,0.3214632],"study_design_scores_gemma":[0.00032343384,0.00019661877,0.0013817762,0.0005521656,0.0000030796882,0.000021022714,0.0000011029712,0.30933416,0.052198824,0.63552827,0.00000440614,0.00045512943],"about_ca_topic_score_codex":0.00006504084,"about_ca_topic_score_gemma":0.000074012925,"teacher_disagreement_score":0.5878914,"about_ca_system_score_codex":0.00027085622,"about_ca_system_score_gemma":0.0011109919,"threshold_uncertainty_score":0.9997455},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029275074,0.0009361482,0.9839897,0.00070643204,0.0024828634,0.0003665614,0.000029635268,0.000320722,0.011138657],"genre_scores_gemma":[0.10500715,0.00033988274,0.8899618,0.0036521219,0.0007675125,0.00004626129,0.000090167756,0.00008093909,0.00005416038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99464285,0.000065042455,0.0006017675,0.00214384,0.0016042716,0.00094221893],"domain_scores_gemma":[0.99637234,0.00050940487,0.00028176428,0.0023696343,0.00016155075,0.00030528425],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010193045,0.00067033735,0.0006740385,0.0016742938,0.0006763125,0.000721835,0.0063188067,0.00028588905,0.00031649522],"category_scores_gemma":[0.000032086373,0.00063625205,0.0003491202,0.0020494047,0.0009350506,0.0010631658,0.0037680855,0.0016362843,0.0000541662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009071682,0.00008143305,0.00012202552,0.000028288485,0.000017576755,0.00020829003,0.00042995845,0.0044820732,0.000027149199,0.839187,0.00023565775,0.15517142],"study_design_scores_gemma":[0.0003136548,0.00027158708,0.00013822732,0.000052964817,0.000011448701,0.00015259458,1.9349389e-7,0.08603103,0.00016613754,0.8513582,0.060492877,0.001011109],"about_ca_topic_score_codex":0.00008255914,"about_ca_topic_score_gemma":0.000052865926,"teacher_disagreement_score":0.15416032,"about_ca_system_score_codex":0.0002443862,"about_ca_system_score_gemma":0.00050413125,"threshold_uncertainty_score":0.9996089},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012717466,0.0001460255,0.9917328,0.0006305162,0.001510009,0.0004838134,0.000012061142,0.00011983438,0.0040932335],"genre_scores_gemma":[0.8945533,0.00005323378,0.10233524,0.0025854139,0.00023055129,0.000021775108,0.000056973164,0.000028584127,0.00013492692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99631166,0.000044080436,0.0006458176,0.0012665914,0.0011304857,0.0006013773],"domain_scores_gemma":[0.99791145,0.0007607164,0.00018732609,0.00080003974,0.00016188665,0.00017858164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007576939,0.0005223299,0.0004541071,0.0046815444,0.0002400763,0.00035526554,0.0018419315,0.0003220041,0.000030674368],"category_scores_gemma":[0.00007796088,0.00049536716,0.00014455574,0.002979654,0.0002947231,0.0004488657,0.00021606729,0.00097684,0.000094635514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010026026,0.00006104444,0.0000035555388,0.000016281412,0.0000040572518,0.000041700445,0.00029796048,0.5741042,0.000010129969,0.14022169,0.000009511539,0.28521982],"study_design_scores_gemma":[0.00095979084,0.00084151106,0.00058157137,0.00052705925,0.0000062170634,0.000059906004,3.2019253e-7,0.39425623,0.0022911425,0.5993873,0.00027457188,0.00081438967],"about_ca_topic_score_codex":0.000026039314,"about_ca_topic_score_gemma":0.00016280745,"teacher_disagreement_score":0.8932816,"about_ca_system_score_codex":0.00064952206,"about_ca_system_score_gemma":0.0006863559,"threshold_uncertainty_score":0.9997498},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4229077,0.00009980578,0.57420194,0.002192648,0.00032715072,0.00024216757,0.0000022772101,0.000021642674,0.000004664451],"genre_scores_gemma":[0.83773917,0.000019172687,0.16167429,0.0004880465,0.00005668451,0.00001297695,0.0000055071405,0.0000040005757,1.4948722e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784714,0.00016671787,0.00037210414,0.0008796398,0.00045837258,0.00027600184],"domain_scores_gemma":[0.9984805,0.000497724,0.00025419015,0.0005734682,0.0001226055,0.00007152837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078193337,0.00023137189,0.00027728992,0.00019813458,0.00021408586,0.0005882411,0.00083449256,0.00009102006,0.000003868159],"category_scores_gemma":[0.00006438431,0.00017855022,0.00004502398,0.00053014536,0.0006173295,0.00032284125,0.0016037893,0.00035473422,4.452946e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029075618,0.000121411824,0.0024299389,0.00020157454,0.000037022153,0.00001629878,0.017284833,0.114071,0.0019782658,0.07681289,0.00002914355,0.78698856],"study_design_scores_gemma":[0.00024430492,0.00014656638,0.032012638,0.00012205315,0.000005101139,0.000018511144,0.000008019986,0.722081,0.0051073898,0.24003457,0.0000023454413,0.00021747084],"about_ca_topic_score_codex":0.00026023944,"about_ca_topic_score_gemma":0.00038783078,"teacher_disagreement_score":0.78677106,"about_ca_system_score_codex":0.00007630677,"about_ca_system_score_gemma":0.00033539193,"threshold_uncertainty_score":0.7281067},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033464737,0.00030080669,0.9905291,0.0020747026,0.0026038634,0.00091766316,0.0000065455642,0.00021342783,0.000007415889],"genre_scores_gemma":[0.32405275,0.00003005498,0.6741552,0.000992857,0.00050588953,0.00019076663,0.000056960293,0.0000149412,6.2665384e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958711,0.00008733166,0.0005462992,0.0019690858,0.0007160474,0.0008100894],"domain_scores_gemma":[0.99688697,0.00082009996,0.00028567715,0.0014311561,0.00035735162,0.00021876709],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007257502,0.00039327366,0.00041291272,0.00034864535,0.00034013792,0.0009149148,0.0030666094,0.00027382447,0.0000038798926],"category_scores_gemma":[0.00014317282,0.0003869383,0.0001549295,0.002206858,0.00049900747,0.0006395208,0.0034604797,0.0008332835,0.0000034982995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033186277,0.00006791863,0.00005425168,0.000030432275,0.0000055458454,0.000017154161,0.0002483043,0.49308005,0.0025682377,0.00069487636,0.00002884871,0.50320107],"study_design_scores_gemma":[0.00024350572,0.00005789465,0.00027363384,0.000110635854,0.000005754489,0.00003515888,5.248552e-7,0.9626201,0.0047148974,0.031490598,0.00005863969,0.0003886812],"about_ca_topic_score_codex":0.000008792673,"about_ca_topic_score_gemma":0.000040273848,"teacher_disagreement_score":0.5028124,"about_ca_system_score_codex":0.0002697901,"about_ca_system_score_gemma":0.00067748927,"threshold_uncertainty_score":0.99985826},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088586356,0.0007371425,0.99578905,0.00042365724,0.0010109907,0.00024454054,0.000050631545,0.00016292626,0.0006951786],"genre_scores_gemma":[0.3476062,0.00016326772,0.65058416,0.0012608919,0.00025365077,0.000008778332,0.00008420844,0.000027962105,0.000010882898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660957,0.000051745417,0.0004527432,0.001579293,0.00082082,0.00048581779],"domain_scores_gemma":[0.9978755,0.0003224907,0.00024530574,0.0012222724,0.00017014281,0.00016427014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007647018,0.00045646465,0.0004423515,0.00071705726,0.0003394732,0.0010041033,0.0017635713,0.0002959812,0.000029787032],"category_scores_gemma":[0.000049570426,0.00046528605,0.00012071451,0.00077101204,0.0005383188,0.0009881078,0.0015005372,0.00066741183,0.0000054246852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020360952,0.000086820255,0.00022981159,0.00022188219,0.00002260632,0.00028656027,0.00070557254,0.006445875,0.0023402593,0.43642232,0.000015446652,0.5532025],"study_design_scores_gemma":[0.00051348953,0.00021660964,0.0005948042,0.00067335356,0.000013804696,0.00010317123,3.949919e-7,0.83932775,0.0009504014,0.15499121,0.001711423,0.00090359367],"about_ca_topic_score_codex":0.000017958771,"about_ca_topic_score_gemma":0.0004910837,"teacher_disagreement_score":0.83288187,"about_ca_system_score_codex":0.00014829363,"about_ca_system_score_gemma":0.00026803874,"threshold_uncertainty_score":0.9997799},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030025064,0.00090874813,0.9904213,0.00038174956,0.0034942033,0.0022531534,0.00001671041,0.00022005712,0.0023010846],"genre_scores_gemma":[0.0020389636,0.000056109206,0.9958312,0.0007014378,0.0006091399,0.00006768529,0.000018802028,0.000042111566,0.00063458533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995358,0.000100648766,0.00087533635,0.0017614753,0.0011286122,0.00077593204],"domain_scores_gemma":[0.99403554,0.003346538,0.0006026615,0.0014573687,0.0004105382,0.00014734226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036929043,0.00062646554,0.00145217,0.002195455,0.00033889638,0.00087164703,0.003416057,0.00037010934,0.000017792949],"category_scores_gemma":[0.00042661472,0.00055065204,0.00061225623,0.0014301373,0.0006836768,0.0008020337,0.0010400402,0.0006634477,0.00003496941],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012624153,0.00002625862,4.9705267e-7,0.00005672122,0.000027730854,0.000007960408,0.00034597065,0.0029708834,0.0000045757065,0.076830864,0.000012336768,0.91958994],"study_design_scores_gemma":[0.01471526,0.00009026807,0.0000012024889,0.00021424975,0.000017163995,0.000022063103,1.2189923e-7,0.6581823,0.0002322449,0.32536447,0.0007045652,0.00045608415],"about_ca_topic_score_codex":0.0000132978375,"about_ca_topic_score_gemma":0.0000088671795,"teacher_disagreement_score":0.9191339,"about_ca_system_score_codex":0.00028184656,"about_ca_system_score_gemma":0.0006300061,"threshold_uncertainty_score":0.9996945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009512685,0.0001998495,0.9854891,0.00080240803,0.00040747982,0.0034655298,0.00003495137,0.00003194064,0.000056069348],"genre_scores_gemma":[0.23289318,0.000017464004,0.7641432,0.0019329963,0.00034944268,0.0005141036,0.000058093356,0.000044170094,0.000047296056],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99777347,0.000048313064,0.00043338264,0.0010200527,0.0002830558,0.00044174783],"domain_scores_gemma":[0.99823016,0.00061838125,0.00018229465,0.0005778362,0.00025251167,0.00013882773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047133406,0.00032034164,0.00046020572,0.00023082679,0.0001337412,0.00006695813,0.00064731616,0.00046487208,0.000003806681],"category_scores_gemma":[0.0020210461,0.00030555358,0.00008821451,0.00035398622,0.0004608459,0.000005390988,0.00063760515,0.00026481776,0.0000011920565],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060901,0.000081163715,0.0011356801,0.0003962579,0.000027272545,0.000040511004,0.00038675332,0.013217316,0.09166542,0.0003282284,0.00009759627,0.8925629],"study_design_scores_gemma":[0.006667196,0.03294033,0.017513786,0.04527668,0.00028559854,0.00052544463,0.000038462193,0.16226088,0.36352524,0.28799313,0.07228256,0.010690684],"about_ca_topic_score_codex":0.0000056483996,"about_ca_topic_score_gemma":0.00014022244,"teacher_disagreement_score":0.88187224,"about_ca_system_score_codex":0.000045703833,"about_ca_system_score_gemma":0.00038158623,"threshold_uncertainty_score":0.9999397},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037630267,0.00082014746,0.99536604,0.00023253997,0.002032223,0.0010048654,0.00013437531,0.00007564321,0.00029653386],"genre_scores_gemma":[0.03106192,0.00012233082,0.9418125,0.0005218766,0.0014354419,0.00009673785,0.00012214493,0.00016679324,0.024660245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98957115,0.00034409759,0.0011704207,0.0032378086,0.004396665,0.0012798334],"domain_scores_gemma":[0.9805433,0.013883475,0.0006067235,0.0015290182,0.0030441093,0.00039335815],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0091466075,0.0007266086,0.0012331953,0.0016824638,0.0006486442,0.0010970052,0.0038745685,0.0005522476,0.00030687926],"category_scores_gemma":[0.013151508,0.0005880591,0.00035354856,0.0018422159,0.0018463774,0.00056883565,0.0016959388,0.0018285982,0.00014722258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008011207,0.00006410952,0.00025345336,0.000013051964,0.00003057053,0.00015592152,0.00052176387,0.14809196,0.000063137406,0.00013521462,0.00013170553,0.850459],"study_design_scores_gemma":[0.0010843282,0.0005100659,0.0016059675,0.0001948685,0.000009269477,0.000045477835,0.0000039616734,0.9393708,0.0007657494,0.046037093,0.009440383,0.00093199767],"about_ca_topic_score_codex":0.00006613248,"about_ca_topic_score_gemma":0.00081429724,"teacher_disagreement_score":0.849527,"about_ca_system_score_codex":0.0005557118,"about_ca_system_score_gemma":0.0016044958,"threshold_uncertainty_score":0.99994},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005296695,0.0011334132,0.9933697,0.00060610555,0.0016100273,0.00039544725,0.00004998238,0.00030533838,0.0020003256],"genre_scores_gemma":[0.06417779,0.000112229114,0.93305415,0.0014109736,0.0009822533,0.00002453558,0.000108999426,0.000050639628,0.00007843149],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504715,0.000043491073,0.00055145216,0.0025254074,0.0011070783,0.00072544446],"domain_scores_gemma":[0.9961709,0.0004747341,0.00031631597,0.0025431623,0.00025943585,0.00023545322],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005233744,0.0005968834,0.00061731896,0.00066627044,0.0003341873,0.0015536798,0.0053013265,0.00042214777,0.00012199496],"category_scores_gemma":[0.00011518218,0.0005723634,0.00020179026,0.0011466043,0.00051313866,0.0010954638,0.0037582456,0.0012667777,0.000036620306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015533957,0.00009639558,0.0006409908,0.00011133753,0.00007442673,0.0008825042,0.002149569,0.0021776222,0.0006626489,0.20962705,0.0000539492,0.783508],"study_design_scores_gemma":[0.0004028137,0.00011980745,0.00076290587,0.0010257706,0.0000206285,0.0000649225,4.4607262e-7,0.28438184,0.0020918772,0.70321524,0.006569925,0.0013437951],"about_ca_topic_score_codex":0.00016575665,"about_ca_topic_score_gemma":0.00050975924,"teacher_disagreement_score":0.78216416,"about_ca_system_score_codex":0.00013922738,"about_ca_system_score_gemma":0.00044168442,"threshold_uncertainty_score":0.9996728},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039392607,0.0008851344,0.99230963,0.00044680663,0.0012562737,0.00025205137,8.815689e-7,0.0003035984,0.000606367],"genre_scores_gemma":[0.25983366,0.0000126899395,0.73853356,0.0008119906,0.00032855998,0.000010432763,0.0000041743533,0.000044506512,0.0004204011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946948,0.00015337294,0.0007377127,0.0019699212,0.0015027839,0.0009413872],"domain_scores_gemma":[0.99725765,0.00070382404,0.00041447947,0.001239065,0.00015355229,0.0002314415],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0031641105,0.00055674696,0.0006855483,0.00092892686,0.000408849,0.0018255473,0.0038325593,0.00034487157,0.0000074121144],"category_scores_gemma":[0.00084836944,0.0005705222,0.00013571492,0.0010663971,0.00041768668,0.0006878435,0.002262197,0.0025722461,0.000016092572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001100354,0.00003702308,0.004698694,0.000059440594,0.00001081191,0.00030659037,0.006285911,0.06980994,0.00006264349,0.008809105,0.0000031756977,0.90991557],"study_design_scores_gemma":[0.0012121953,0.00036891768,0.0076949834,0.012524844,0.00002328016,0.00040414126,0.000009206482,0.9444784,0.0006340387,0.021955514,0.0077421134,0.0029524013],"about_ca_topic_score_codex":0.00015444224,"about_ca_topic_score_gemma":0.00025179054,"teacher_disagreement_score":0.90696317,"about_ca_system_score_codex":0.0005011561,"about_ca_system_score_gemma":0.0008101237,"threshold_uncertainty_score":0.99972886},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033163997,0.00014914713,0.96431357,0.0005094288,0.0038876496,0.0006637918,0.0000044807457,0.00047797826,0.029960819],"genre_scores_gemma":[0.012823127,0.00003963167,0.97907573,0.0016921813,0.003746046,0.000055007058,0.000023424403,0.00009007102,0.0024547593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955188,0.000096116855,0.0006224521,0.0016981373,0.0012007994,0.00086369965],"domain_scores_gemma":[0.99710554,0.0012055829,0.00041139172,0.00082274154,0.00024765922,0.00020709542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019780544,0.0005365017,0.00059824204,0.00084910356,0.0008794029,0.000830542,0.0030341481,0.00024552702,0.00028475537],"category_scores_gemma":[0.00032879255,0.0005728961,0.00023279327,0.00065886194,0.00030276005,0.00077940396,0.0012874573,0.0014931512,0.000031157666],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012075798,0.000023353583,0.000036336387,0.00003505953,0.000019704445,0.000045717326,0.00705609,0.052038908,0.000043056003,0.059616107,0.0001004884,0.8809731],"study_design_scores_gemma":[0.0006120228,0.00034340992,0.00002574477,0.00009933792,0.000009761654,0.000039139748,0.0000038854528,0.7982179,0.00004995797,0.016468825,0.18345083,0.00067920645],"about_ca_topic_score_codex":0.0000060643433,"about_ca_topic_score_gemma":0.000014303032,"teacher_disagreement_score":0.8802939,"about_ca_system_score_codex":0.00040451938,"about_ca_system_score_gemma":0.00070964405,"threshold_uncertainty_score":0.99967223},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045318453,0.00016506623,0.99691296,0.000036846744,0.00022247204,0.00015689738,0.000007224957,0.00040727062,0.0016381054],"genre_scores_gemma":[0.96456593,0.00008829307,0.03508571,0.00017357239,0.00002262017,0.000005914122,0.000022749797,0.000012964539,0.000022259972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889815,0.000009359512,0.0003092961,0.00032062456,0.00028789125,0.00017466818],"domain_scores_gemma":[0.99939626,0.00006553657,0.00006755546,0.0003666302,0.000070049384,0.000033934946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023864374,0.00017368502,0.00028869548,0.0012439508,0.00002123354,0.00004423588,0.00033549187,0.00013484621,0.000018546698],"category_scores_gemma":[0.000021155514,0.00018367397,0.00007305058,0.0009182958,0.00018233908,0.00012639163,0.0000756323,0.00021597622,9.4665955e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013205918,0.0000073458837,0.00018422259,0.00007234778,0.00003002674,0.00004735837,0.0000753307,0.9559233,0.00021143323,0.0015152694,0.00001943615,0.04191258],"study_design_scores_gemma":[0.00009104767,0.000019345292,0.00036028557,0.00020621136,0.00004355097,0.0000027903072,1.6044415e-7,0.99308896,0.005104942,0.0006720666,0.0002262064,0.00018442281],"about_ca_topic_score_codex":0.000015689855,"about_ca_topic_score_gemma":0.0003544492,"teacher_disagreement_score":0.96411276,"about_ca_system_score_codex":0.00014343768,"about_ca_system_score_gemma":0.00008000463,"threshold_uncertainty_score":0.7490007},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39128637,0.0006493497,0.60639423,0.00060326455,0.0007556836,0.00018505976,0.000014530527,0.000038218535,0.00007331073],"genre_scores_gemma":[0.9691517,0.000024969066,0.030390082,0.0002121046,0.00016958917,0.000018082597,0.0000068043287,0.000024621366,0.0000020842072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976652,0.000050381692,0.0004758698,0.0012604637,0.00011488467,0.00043316575],"domain_scores_gemma":[0.9988373,0.00010514282,0.00021180265,0.00066870294,0.000068169495,0.00010886062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013097296,0.00030428456,0.0006713124,0.00042601567,0.0001928984,0.00047900627,0.0007264471,0.00018306312,0.000034827644],"category_scores_gemma":[0.000048963586,0.0003076744,0.00006671789,0.0007664567,0.0004795485,0.00020272483,0.00042606553,0.000661129,0.0000069130847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010324404,0.000444299,0.10814019,0.001800722,0.00019282663,0.00017421723,0.021451384,0.5456978,0.0005873224,0.04899833,0.0000013975692,0.27240825],"study_design_scores_gemma":[0.0030443158,0.0008487951,0.071751505,0.002865683,0.00004803357,0.0003133256,0.000068246074,0.6813536,0.007923748,0.22776368,0.00017562005,0.003843377],"about_ca_topic_score_codex":0.00061319483,"about_ca_topic_score_gemma":0.00030235355,"teacher_disagreement_score":0.5778653,"about_ca_system_score_codex":0.00012252928,"about_ca_system_score_gemma":0.00008806885,"threshold_uncertainty_score":0.99993753},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005499568,0.0023384634,0.9838265,0.004170554,0.004546675,0.0017294718,0.0026106096,0.00012120027,0.000106570675],"genre_scores_gemma":[0.033590276,0.00025445048,0.93476033,0.017218443,0.0052904827,0.00004184193,0.008371549,0.0003107252,0.00016191883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922006,0.00062287645,0.001761468,0.0027566436,0.0009843893,0.0016740327],"domain_scores_gemma":[0.99288243,0.0014450344,0.0007697972,0.0038342488,0.0005578272,0.00051068875],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0035927282,0.00065673725,0.001006848,0.0008880313,0.0015327237,0.00022977527,0.003044561,0.0010554275,0.00014903473],"category_scores_gemma":[0.0007957166,0.00066642923,0.000056046043,0.00082769233,0.0007231177,0.00110522,0.0033427426,0.0042452086,0.000029706544],"study_design_candidate":"design_other","study_design_consensus":null,"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.000018774204,0.000051162657,0.001128071,0.000649091,0.0000069169955,0.00034349793,0.0024004327,0.0015907363,0.00021955644,0.00021652573,0.00004591503,0.99332935],"study_design_scores_gemma":[0.000158642,0.00008580686,0.00007611472,0.005949507,0.000013063957,0.00003625098,0.000029696259,0.977846,0.00012434252,0.012990203,0.0019885462,0.00070180075],"about_ca_topic_score_codex":0.012415105,"about_ca_topic_score_gemma":0.03534795,"teacher_disagreement_score":0.9926275,"about_ca_system_score_codex":0.0015058697,"about_ca_system_score_gemma":0.006732751,"threshold_uncertainty_score":0.9997671},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006704667,0.00025118006,0.99687594,0.0005798944,0.0007371281,0.00043635195,0.00001093737,0.000043539083,0.0003945686],"genre_scores_gemma":[0.27025974,0.000021409129,0.7287594,0.00060249656,0.00017355649,0.000030047942,0.0000072469,0.000028926963,0.00011714668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969852,0.00006981533,0.00057950505,0.0010729971,0.0008234375,0.00046902668],"domain_scores_gemma":[0.9971571,0.0007338695,0.00029361463,0.0015060015,0.00023274224,0.00007667865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001065369,0.00037724548,0.00054873363,0.00044202586,0.00015285851,0.0001388877,0.001647388,0.00016948277,0.0000137165225],"category_scores_gemma":[0.00023762102,0.00027020994,0.000108451095,0.0007378921,0.00097190397,0.0003251711,0.0009898469,0.0007472128,0.00000555097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003087316,0.000038270908,0.00001492222,0.00007237526,0.000008027103,0.00019178228,0.0008237001,0.05252666,0.00010523469,0.61615723,0.0000016827917,0.33005702],"study_design_scores_gemma":[0.0004953175,0.00033918465,0.00008573063,0.0041128406,0.000008826623,0.00018570197,0.000007063023,0.85590506,0.009466731,0.123052344,0.005223326,0.0011178567],"about_ca_topic_score_codex":0.00003742189,"about_ca_topic_score_gemma":0.00014031802,"teacher_disagreement_score":0.8033784,"about_ca_system_score_codex":0.00013226875,"about_ca_system_score_gemma":0.0004748521,"threshold_uncertainty_score":0.999975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027441487,0.0014340625,0.96820396,0.000108155415,0.0007124174,0.00056255073,0.00001871223,0.00005410483,0.0014645561],"genre_scores_gemma":[0.87232816,0.000008803754,0.12692638,0.00014561597,0.00023218738,0.000013600467,0.000010000035,0.00004596945,0.00028927875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99063927,0.00021371583,0.00167522,0.0029518767,0.0037569297,0.0007629803],"domain_scores_gemma":[0.99405617,0.0006528941,0.0007473245,0.0029152108,0.001287235,0.00034115926],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0044835988,0.0006711641,0.0013182559,0.0017185824,0.00028709768,0.0022001944,0.0032718366,0.00044017457,0.0000705351],"category_scores_gemma":[0.00049706275,0.00053838384,0.00022816853,0.0018680589,0.00042114174,0.0012637082,0.0011372144,0.00081158616,0.0000069430826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047652444,0.00015181024,0.00017083959,0.000017415372,0.000008263307,0.000080062826,0.0034143988,0.91507626,0.00022656178,0.0035351042,0.000009067436,0.07726258],"study_design_scores_gemma":[0.00053179276,0.00014313094,0.000037977254,0.0005405262,0.0000066174393,0.00005556339,0.00012089839,0.96526057,0.0001275756,0.032432687,0.00016003432,0.0005826037],"about_ca_topic_score_codex":0.00020730772,"about_ca_topic_score_gemma":0.0004032119,"teacher_disagreement_score":0.84488666,"about_ca_system_score_codex":0.00031521966,"about_ca_system_score_gemma":0.0006896162,"threshold_uncertainty_score":0.99970675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006484254,0.00050624256,0.99163276,0.0024048407,0.0009860368,0.0011392857,0.000030216002,0.00004137113,0.0026108448],"genre_scores_gemma":[0.9493412,0.000050934723,0.042346474,0.0041875714,0.001656532,0.00031157414,0.000038443646,0.0000571405,0.0020101566],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659556,0.00010768174,0.00063617807,0.0012376773,0.0009594024,0.00046350723],"domain_scores_gemma":[0.99157226,0.0062737563,0.0003786405,0.001508039,0.00018079844,0.00008650722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050330535,0.00031596143,0.00041520095,0.00041051648,0.0007216587,0.00072215125,0.003252612,0.00019179352,0.0003284076],"category_scores_gemma":[0.0005222841,0.00020591558,0.00013920502,0.0009794079,0.0009109557,0.00033151114,0.00039319627,0.00066393905,0.000012454917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038988186,0.000024396446,0.00008213071,0.000003361615,0.0000052965856,0.0000026449322,0.0012116228,0.22891143,0.00010909793,0.067067534,0.00011378435,0.7024297],"study_design_scores_gemma":[0.00020533554,0.00016442666,0.00048758113,0.000023743447,0.000009336464,0.0000095033565,0.000003344276,0.2624984,0.0000753683,0.6874039,0.048877466,0.0002415546],"about_ca_topic_score_codex":0.000035223602,"about_ca_topic_score_gemma":0.0009452741,"teacher_disagreement_score":0.9492863,"about_ca_system_score_codex":0.00015785366,"about_ca_system_score_gemma":0.00035688726,"threshold_uncertainty_score":0.8396994},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28607664,0.000011493322,0.71145344,0.0011515362,0.0003059502,0.000119976634,7.673768e-7,0.000009048491,0.00087114953],"genre_scores_gemma":[0.97231895,0.0000015001973,0.027079295,0.00049320696,0.000072457646,0.000008494835,1.1220391e-7,0.0000028583204,0.000023126871],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980322,0.00017389545,0.0003429145,0.00044422664,0.0007766504,0.00023008946],"domain_scores_gemma":[0.9967831,0.0022662517,0.00019095567,0.000540661,0.00018334459,0.00003569029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051047504,0.00009722433,0.00014682207,0.00034916736,0.00041464926,0.00013357584,0.0012002103,0.00004543214,0.00012683435],"category_scores_gemma":[0.00087179156,0.000054848348,0.00003228528,0.0033434618,0.00088744983,0.0004540006,0.0001875639,0.000209372,0.000059265705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012465911,0.00026818935,0.01080379,0.000007298449,0.000008881757,0.0000033906279,0.017932398,0.038524512,0.0091936765,0.43824756,0.00013901619,0.48474663],"study_design_scores_gemma":[0.00011569384,0.00017246924,0.0135473395,0.00004994871,0.0000011261536,0.0000042013653,0.00002288377,0.2016919,0.06723303,0.7167073,0.000353804,0.00010031304],"about_ca_topic_score_codex":0.000010683013,"about_ca_topic_score_gemma":0.000050076313,"teacher_disagreement_score":0.68624234,"about_ca_system_score_codex":0.00005859337,"about_ca_system_score_gemma":0.00011092676,"threshold_uncertainty_score":0.32698458},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01252426,0.0010338707,0.98169684,0.002704243,0.0005579822,0.00024511595,0.0000027236044,0.00005752605,0.0011774334],"genre_scores_gemma":[0.9954618,0.000025691681,0.0015874016,0.0017932566,0.0009173925,0.000011857764,0.000012361815,0.000032595108,0.00015763153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759895,0.000006928628,0.00054282916,0.0007476123,0.00068703975,0.00041666834],"domain_scores_gemma":[0.99835026,0.00012355308,0.00039064107,0.00041891375,0.0006936023,0.000023013728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074632454,0.00033714977,0.0005040196,0.0010157245,0.00027334332,0.0005526322,0.0008733884,0.0001539028,0.00007822718],"category_scores_gemma":[0.00022213317,0.00025801983,0.00011539618,0.0017188772,0.00023763743,0.0006795018,0.0003869237,0.00055050774,0.000027415375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010853914,0.00003796828,0.0041934797,0.00042013143,0.000016443502,0.00017025157,0.00038739922,0.8388665,0.000011523959,0.00084608333,0.000024147428,0.15501526],"study_design_scores_gemma":[0.00045090547,0.00002512394,0.0013363598,0.0065374286,0.00016478328,0.00007079409,0.00003062944,0.9687627,0.00043444356,0.018642867,0.0023011928,0.0012427862],"about_ca_topic_score_codex":0.00029518423,"about_ca_topic_score_gemma":0.0019058215,"teacher_disagreement_score":0.9829376,"about_ca_system_score_codex":0.00006430741,"about_ca_system_score_gemma":0.00022711087,"threshold_uncertainty_score":0.9999872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48889184,0.0003195129,0.50689787,0.0011534666,0.0012003711,0.00069453864,0.000014307702,0.000019283827,0.0008087938],"genre_scores_gemma":[0.9941604,0.00011760925,0.0044282996,0.00090159447,0.00009968292,0.000050628205,0.0000017118781,0.000015717287,0.00022432527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767643,0.000043041437,0.00036618533,0.0009055644,0.0005608743,0.00044791476],"domain_scores_gemma":[0.996606,0.0016043109,0.00026544792,0.000986002,0.00048189366,0.00005633854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005901953,0.0003789474,0.00037296882,0.00020903339,0.00043766614,0.00036500752,0.0027282154,0.00008907358,0.000007287289],"category_scores_gemma":[0.00017791108,0.00022371784,0.000083239414,0.00032866164,0.0007840132,0.00092972186,0.0012018183,0.00061402016,0.0000048345064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015899233,0.000105664716,0.00028621752,0.00046583303,0.00012418655,0.000022297148,0.011454104,0.26875642,0.024723852,0.17297967,0.00007747902,0.5208453],"study_design_scores_gemma":[0.00083839596,0.0015829321,0.022099704,0.0054827766,0.000053883083,0.0001099222,0.000039009956,0.6606958,0.28168395,0.023379972,0.0022943013,0.0017393548],"about_ca_topic_score_codex":0.00002107641,"about_ca_topic_score_gemma":0.000021977095,"teacher_disagreement_score":0.5191059,"about_ca_system_score_codex":0.000095611875,"about_ca_system_score_gemma":0.00025984802,"threshold_uncertainty_score":0.91229486},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028508524,0.0010824573,0.9953798,0.00004646837,0.000018204637,0.0002901274,0.000006566698,0.000017972241,0.0003075554],"genre_scores_gemma":[0.56323314,0.0013827994,0.4315274,0.00071762886,0.0005393897,0.000044534663,0.00028093357,0.00007122892,0.0022029297],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99838305,0.00003202287,0.00021104077,0.0009348859,0.00022654422,0.00021247237],"domain_scores_gemma":[0.9991273,0.000035376488,0.00014553672,0.0003406912,0.00029427678,0.000056801942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021985412,0.00026279842,0.00021785553,0.00019999695,0.0002213391,0.00018288774,0.00028142874,0.00021932271,0.000005513745],"category_scores_gemma":[0.000046726378,0.00026769578,0.000058882208,0.00015147528,0.00024121019,0.000014720214,0.00034410594,0.000330482,0.0000012534454],"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.000009404498,0.000014131334,0.000013221042,0.000018246068,0.00001283305,0.000006081756,0.000054440425,0.09691237,0.878609,0.000091598995,0.000016390004,0.024242286],"study_design_scores_gemma":[0.00006985781,0.000062087456,0.0000010161167,0.000061660714,0.000012824477,0.000008083577,3.511663e-7,0.38456303,0.61399627,0.0006062417,0.00040496947,0.00021359201],"about_ca_topic_score_codex":0.0000034159364,"about_ca_topic_score_gemma":0.00001719034,"teacher_disagreement_score":0.56385237,"about_ca_system_score_codex":0.00007107347,"about_ca_system_score_gemma":0.00024782922,"threshold_uncertainty_score":0.9999775},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025566385,0.001249258,0.99487925,0.0007065427,0.0015295694,0.0004691569,0.00003090079,0.00013517692,0.0009745743],"genre_scores_gemma":[0.0030219678,0.00008439893,0.99501157,0.00089253514,0.00054074737,0.000015518908,0.000034490575,0.000032493946,0.00036627604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619234,0.000032900793,0.00047165214,0.0018955908,0.0007497647,0.0006577463],"domain_scores_gemma":[0.99712646,0.00065321004,0.0002585672,0.0014133905,0.00032113402,0.00022724686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080699637,0.0005164897,0.0006374323,0.00043234986,0.0004917366,0.0008908927,0.0023897935,0.00028428127,0.000013185683],"category_scores_gemma":[0.0001100629,0.00046786288,0.00012142219,0.00036719235,0.00074437883,0.00076577,0.003069363,0.00059768115,0.000005488],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034777981,0.000021168144,0.000015186071,0.000056676614,0.000009735286,0.000055144712,0.0002674374,0.0010302606,0.00009161118,0.04220625,0.000057323698,0.9561857],"study_design_scores_gemma":[0.00037644012,0.00013567998,0.00015254154,0.00044792215,0.000007671952,0.000096477124,2.6810787e-7,0.8393177,0.0005457841,0.15073241,0.007590961,0.0005961376],"about_ca_topic_score_codex":0.000029149607,"about_ca_topic_score_gemma":0.000070859096,"teacher_disagreement_score":0.9555896,"about_ca_system_score_codex":0.00013629791,"about_ca_system_score_gemma":0.00041718007,"threshold_uncertainty_score":0.9997773},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021044216,0.0005406942,0.9949788,0.00031377593,0.0013434392,0.00034108266,0.0000018831457,0.000055614488,0.0003203282],"genre_scores_gemma":[0.098494485,0.000016471915,0.90043133,0.00055850204,0.00036250966,0.0000045094357,0.0000017240251,0.000022958247,0.00010753131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967581,0.000022568198,0.00065861363,0.0012671364,0.0007494761,0.0005441236],"domain_scores_gemma":[0.99759233,0.00044592947,0.00036962534,0.0011487986,0.000334767,0.00010857407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078480574,0.00035517436,0.0005314399,0.0004586758,0.00017401631,0.0005134123,0.002030797,0.0002161269,0.000010762922],"category_scores_gemma":[0.00006055424,0.00034809922,0.00017556544,0.00040246864,0.0002651812,0.00057866215,0.0013062924,0.0003589005,0.0000021104604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004548975,0.000021166159,0.000060199975,0.0001654854,0.000020216257,0.000029629597,0.0013388266,0.17871317,0.0024654896,0.103792585,0.000002934967,0.71338576],"study_design_scores_gemma":[0.00019948576,0.00005902167,0.000004959926,0.00070900924,0.000010204312,0.000029916811,8.8524314e-7,0.80393344,0.006600418,0.18777955,0.00032768864,0.00034541672],"about_ca_topic_score_codex":0.00004729773,"about_ca_topic_score_gemma":0.00005604705,"teacher_disagreement_score":0.71304035,"about_ca_system_score_codex":0.0002832326,"about_ca_system_score_gemma":0.00056850055,"threshold_uncertainty_score":0.9998971},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003423324,0.00077823515,0.99135756,0.0010436435,0.0008708247,0.004275187,0.000023291923,0.00011941878,0.0014976126],"genre_scores_gemma":[0.13105765,0.0010848243,0.85480225,0.0042504673,0.0023054485,0.0045045987,0.00012403732,0.00027613423,0.0015945886],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957299,0.000100825106,0.000720113,0.0014649406,0.0012485264,0.0007356779],"domain_scores_gemma":[0.9955526,0.0005587385,0.00047623858,0.0026931907,0.0005568614,0.000162396],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015258257,0.00050574343,0.0005824696,0.00044457716,0.00049227354,0.00084842596,0.0053741974,0.00028753796,0.000024073726],"category_scores_gemma":[0.00018865852,0.00030033715,0.00022885899,0.0013019267,0.0014002203,0.0005582078,0.002633378,0.0008458025,0.000012281436],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022311615,0.00012700258,0.00007158467,0.00025568137,0.000035839006,0.00009949111,0.0020253314,0.00018288394,0.0003525962,0.21933126,0.00020691048,0.7772891],"study_design_scores_gemma":[0.00079950155,0.000658024,0.00035299532,0.002658111,0.000028207132,0.00012905298,0.0000015239779,0.33855534,0.006485191,0.5246057,0.124098055,0.0016283413],"about_ca_topic_score_codex":0.000033398734,"about_ca_topic_score_gemma":0.00010949712,"teacher_disagreement_score":0.77566075,"about_ca_system_score_codex":0.000088261535,"about_ca_system_score_gemma":0.0006566304,"threshold_uncertainty_score":0.99994487},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017994476,0.0005411187,0.9959179,0.000032698994,0.0017256214,0.00026908887,0.00001022342,0.00015431391,0.0011690473],"genre_scores_gemma":[0.13734272,0.000059429778,0.86030364,0.00029698154,0.0014785407,0.000015674728,0.00011513261,0.00009046861,0.00029742252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983408,0.000012366205,0.0002963126,0.0005678591,0.00036029363,0.00042238235],"domain_scores_gemma":[0.9991862,0.00028094836,0.000091486814,0.00026307444,0.000107164255,0.00007111019],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017306562,0.00034690683,0.00034335215,0.00024451237,0.00023301154,0.0001576559,0.0003652325,0.00016222087,0.000044533008],"category_scores_gemma":[0.00005045836,0.0003640117,0.00009233404,0.0001566793,0.00017370796,0.00024599943,0.00013084867,0.00063250127,0.0000047267836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006558517,0.0000014383288,0.0000042096476,0.00004742763,0.000011601942,0.000011929733,0.00027551354,0.6583947,0.006268411,0.00063267315,0.000006407411,0.3343391],"study_design_scores_gemma":[0.000527564,0.0000901878,0.000016453998,0.0002691412,0.000024062574,0.00003851133,0.0000018167244,0.94924587,0.012818476,0.029023359,0.0073387944,0.00060577097],"about_ca_topic_score_codex":0.0000032577543,"about_ca_topic_score_gemma":0.00002400637,"teacher_disagreement_score":0.33373335,"about_ca_system_score_codex":0.00021128751,"about_ca_system_score_gemma":0.00009436057,"threshold_uncertainty_score":0.9998812},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050415187,0.028495545,0.19076456,0.015583918,0.006408841,0.0037604189,0.00036120732,0.00075478817,0.7488292],"genre_scores_gemma":[0.9825284,0.00036563206,0.006719185,0.0007251208,0.0007377498,0.00007517296,0.000065993656,0.000060220413,0.008722514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981057,0.000068373825,0.00049348676,0.0004482642,0.00057469023,0.00030945483],"domain_scores_gemma":[0.9964973,0.0010013874,0.00036948244,0.0015325219,0.00054479163,0.000054538472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005531884,0.00029643442,0.00035729294,0.00022291589,0.0006243607,0.0008159992,0.00177686,0.000110734196,0.00037694877],"category_scores_gemma":[0.00016473708,0.00019905553,0.00010631191,0.00013861897,0.00245436,0.0002830906,0.0005496741,0.00053456513,0.00002662966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008077773,0.000072247014,0.0000027274107,0.00011729178,0.00005795434,0.000021526781,0.062083565,0.0015359242,0.00019128699,0.8964876,0.0001912874,0.03923049],"study_design_scores_gemma":[0.0013520938,0.00049555383,0.00021807001,0.0069919988,0.0003082524,0.00019316292,0.00267075,0.037257303,0.00162014,0.740777,0.20459798,0.0035176715],"about_ca_topic_score_codex":0.00017032087,"about_ca_topic_score_gemma":0.0027169834,"teacher_disagreement_score":0.9774869,"about_ca_system_score_codex":0.000094111994,"about_ca_system_score_gemma":0.000468136,"threshold_uncertainty_score":0.90431917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1287648,0.00075932464,0.8698756,0.000024879708,0.00006201427,0.000081391445,0.00001392244,0.00000785194,0.00041019855],"genre_scores_gemma":[0.9724328,0.00013368363,0.026665326,0.0002467497,0.00015269089,0.0000017416336,0.00009813906,0.000018705301,0.0002501635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778193,0.00005712605,0.00032081205,0.0011056613,0.00037820154,0.00035627],"domain_scores_gemma":[0.99846095,0.000052357613,0.00022063885,0.00093652605,0.00024193048,0.000087620836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036126087,0.00031783836,0.0006518457,0.0003857202,0.00007024703,0.00003218861,0.000415077,0.00037170804,0.000018035145],"category_scores_gemma":[0.000032496817,0.00029219556,0.0004764046,0.00069585326,0.00043712975,0.0000037247873,0.0005029283,0.00025807208,0.0000011743628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008080764,0.000024320627,0.000042371023,0.000008432343,0.00011028561,0.000011515454,0.00001387304,0.70059025,0.28648332,0.00004268668,0.000004490254,0.012660347],"study_design_scores_gemma":[0.000104387014,0.00014958718,0.00086578174,0.000022145907,0.00038950364,0.000002450972,1.3802567e-7,0.9281354,0.06842344,0.0013709421,0.00013447944,0.0004017443],"about_ca_topic_score_codex":0.000011379762,"about_ca_topic_score_gemma":0.00018657757,"teacher_disagreement_score":0.843668,"about_ca_system_score_codex":0.000054951604,"about_ca_system_score_gemma":0.0003314439,"threshold_uncertainty_score":0.99995303},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004453798,0.0006129853,0.99555063,0.00037210566,0.0018864041,0.00030842065,0.000017384586,0.00014552013,0.00066114176],"genre_scores_gemma":[0.0764744,0.000026762726,0.9220151,0.00058068975,0.000479437,0.000015249378,0.000024906583,0.000036824684,0.00034667872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700344,0.00003120803,0.0005296689,0.0011890352,0.00080389564,0.0004427351],"domain_scores_gemma":[0.99701214,0.0008930771,0.00034669062,0.0012923804,0.00035266095,0.000103064966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008631375,0.00036389724,0.0005067937,0.00059116585,0.00017504604,0.00021707865,0.002204411,0.0002154373,0.000015695845],"category_scores_gemma":[0.00012787516,0.00033180512,0.00018420191,0.0005165348,0.00040910023,0.00044176294,0.0011250316,0.00033828936,0.0000067401907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012045547,0.000064938955,0.000019487474,0.000091908776,0.000023806608,0.000055867342,0.00019740201,0.13129686,0.001999485,0.2784535,0.000096524716,0.58768815],"study_design_scores_gemma":[0.00039252505,0.00016268744,0.00013623283,0.00044834302,0.00000972602,0.000063633386,1.0707358e-7,0.8478768,0.003870499,0.14624001,0.00040495335,0.00039447556],"about_ca_topic_score_codex":0.000023400207,"about_ca_topic_score_gemma":0.000034152217,"teacher_disagreement_score":0.71658,"about_ca_system_score_codex":0.00014121688,"about_ca_system_score_gemma":0.0006283479,"threshold_uncertainty_score":0.9999134},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014159302,0.0049055093,0.99180907,0.0015117801,0.000261346,0.00054027187,0.0000018082933,0.00018013646,0.0007758985],"genre_scores_gemma":[0.0808713,0.00027857293,0.91781217,0.0006482888,0.00014593669,0.00005539414,0.0000039753686,0.00002192216,0.00016245843],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717414,0.00004217344,0.0005712526,0.0010016734,0.0008110535,0.00039968657],"domain_scores_gemma":[0.99749833,0.0004240344,0.00038238565,0.0013574465,0.0002779321,0.000059861155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010448069,0.00032517497,0.00038734978,0.0003837226,0.00014985139,0.00033102086,0.0037719079,0.00025646714,0.0000033519793],"category_scores_gemma":[0.0001004874,0.00024587847,0.000084077714,0.0009049017,0.0007598709,0.00031872094,0.0015910006,0.0007263329,0.0000033187034],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003139152,0.00001922798,0.000035474848,0.000033318618,0.000003044559,0.0000262529,0.00020713732,0.000118407246,0.0013404484,0.082684256,0.000023380453,0.9155059],"study_design_scores_gemma":[0.00017694809,0.00018347322,0.00006191878,0.00108306,0.0000069711577,0.000079399055,8.2993955e-7,0.10633515,0.2106425,0.67402154,0.006632224,0.0007759813],"about_ca_topic_score_codex":0.000069065056,"about_ca_topic_score_gemma":0.0003022016,"teacher_disagreement_score":0.91472995,"about_ca_system_score_codex":0.00035129007,"about_ca_system_score_gemma":0.00046807766,"threshold_uncertainty_score":0.99999934},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010515071,0.9744473,0.022770537,0.0000682838,0.00011242669,0.0021301098,0.000012139379,0.000015820124,0.0004328559],"genre_scores_gemma":[0.0012364394,0.9962101,0.0017156906,0.000101313715,0.000059234106,0.0006569215,0.000010517982,0.000007830961,0.0000019643305],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.997777,0.000565044,0.00064490875,0.00040375465,0.00032134485,0.00028794393],"domain_scores_gemma":[0.996878,0.0022745777,0.00033082932,0.00028549417,0.00015901342,0.000072084644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021483474,0.00019025881,0.0012505999,0.00022192228,0.00019760364,0.00022068786,0.00062731205,0.00009417604,0.000008719184],"category_scores_gemma":[0.0009537796,0.00014721024,0.0001377068,0.0024231945,0.0005808732,0.00021083307,0.00013688943,0.0002232147,0.0000011968867],"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":[9.726808e-8,0.0000260383,0.0000030647832,0.24881795,0.000008691291,0.0000011035147,0.0072755525,0.0000035585497,9.0572335e-8,0.0012033574,9.639871e-7,0.7426595],"study_design_scores_gemma":[0.00007799686,0.000043412612,0.0000063925013,0.97771037,0.00014081167,0.00000741758,0.0023015616,0.000041102776,0.0000010852453,0.0033071802,0.015942644,0.0004200372],"about_ca_topic_score_codex":0.00013568824,"about_ca_topic_score_gemma":0.0010155604,"teacher_disagreement_score":0.7422395,"about_ca_system_score_codex":0.0001725648,"about_ca_system_score_gemma":0.0014906499,"threshold_uncertainty_score":0.600306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008119659,0.0002883611,0.9960779,0.00090071175,0.00042766627,0.000296326,0.000002780387,0.000109029694,0.0010852688],"genre_scores_gemma":[0.2419704,0.00010262521,0.75554276,0.001407387,0.00039880062,0.000025255506,0.00018378615,0.000038492006,0.0003305079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692637,0.00009424327,0.00044703562,0.0013259957,0.0007687653,0.0004375786],"domain_scores_gemma":[0.99806553,0.00036476954,0.00033040126,0.0009260783,0.000199992,0.00011322813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008690321,0.00036710952,0.0003380489,0.0006320948,0.00017560128,0.00065217586,0.0013382101,0.0002247892,0.000010731234],"category_scores_gemma":[0.00005760707,0.0003279296,0.00004095166,0.0010199407,0.00026326085,0.00077030016,0.00044900135,0.0008007973,0.00001542465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007717038,0.000039250124,0.0022711656,0.000030517376,0.0000058993523,0.00007746368,0.00045330427,0.17591761,0.00012706182,0.01049993,0.000013294589,0.81055677],"study_design_scores_gemma":[0.0005023171,0.0001680197,0.0041342704,0.00052047864,0.000006662114,0.000052555843,7.4229314e-7,0.988858,0.0002628635,0.004484085,0.0005213577,0.00048865506],"about_ca_topic_score_codex":0.000068142486,"about_ca_topic_score_gemma":0.00096913404,"teacher_disagreement_score":0.81294036,"about_ca_system_score_codex":0.00030437743,"about_ca_system_score_gemma":0.00047264612,"threshold_uncertainty_score":0.99991727},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026849619,0.123655684,0.8602167,0.001284756,0.0029714399,0.0030552407,0.000033387525,0.00011844317,0.008637505],"genre_scores_gemma":[0.17410077,0.4311667,0.35780787,0.017639965,0.0047087595,0.0011479312,0.0002718539,0.00054856815,0.012607567],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.99470353,0.0012491411,0.0010025525,0.001204946,0.0012284124,0.00061140425],"domain_scores_gemma":[0.99411637,0.0034835532,0.0008979849,0.0006564531,0.0006566911,0.00018892786],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0056113987,0.0005818971,0.0012556594,0.00031487417,0.0005240173,0.0013371826,0.000919989,0.0005743898,0.000038810445],"category_scores_gemma":[0.003380575,0.0004836105,0.0001631985,0.0011015644,0.000703728,0.0009453246,0.00028592275,0.0008839794,0.0000023669631],"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.00017232331,0.00031485027,0.000027381682,0.2894054,0.0002220725,0.0006509909,0.22904444,0.00095945725,0.0002778034,0.042225502,0.0010044825,0.43569532],"study_design_scores_gemma":[0.0004536986,0.00035751046,0.0000067389724,0.9807654,0.00012705717,0.00007035141,0.0002502504,0.00470997,0.00030130058,0.007632203,0.0037656915,0.0015598384],"about_ca_topic_score_codex":0.000039015977,"about_ca_topic_score_gemma":0.000020913587,"teacher_disagreement_score":0.69136,"about_ca_system_score_codex":0.00039853077,"about_ca_system_score_gemma":0.0005843497,"threshold_uncertainty_score":0.9997616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074782205,0.00027778538,0.98892903,0.0042664604,0.004480011,0.00086828286,0.0000024608873,0.00014027162,0.0009609],"genre_scores_gemma":[0.015728448,0.000011029546,0.9683759,0.012941594,0.0018623215,0.000085789594,0.0000042632364,0.00005582919,0.00093481597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963828,0.00011993944,0.00040466164,0.0016471471,0.000790286,0.0006552185],"domain_scores_gemma":[0.99569374,0.0020933775,0.00019759756,0.0016238153,0.00023370131,0.00015776332],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023610496,0.0004987959,0.00052388984,0.00046505855,0.0004995819,0.0012657387,0.0033285029,0.00028791558,0.000010725952],"category_scores_gemma":[0.00035756337,0.00035689765,0.0002575247,0.00080577336,0.0001599537,0.00034044043,0.001251516,0.00080503116,0.000029163606],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010541846,0.000008014419,0.000021791722,0.000054335258,0.000016266593,0.000021042048,0.0014258698,0.015342863,0.00084472325,0.004162282,0.00021913499,0.97787315],"study_design_scores_gemma":[0.00071218645,0.0010148867,0.00018717696,0.0010963572,0.000049568105,0.0002571578,8.2377085e-7,0.7739823,0.04069274,0.112095855,0.06821935,0.0016916347],"about_ca_topic_score_codex":0.00006191981,"about_ca_topic_score_gemma":0.00017754923,"teacher_disagreement_score":0.9761815,"about_ca_system_score_codex":0.00023643982,"about_ca_system_score_gemma":0.0002896027,"threshold_uncertainty_score":0.9998883},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004142529,0.0018798918,0.97371393,0.018817201,0.0032158985,0.00086170936,0.00008181483,0.00063201337,0.0007560915],"genre_scores_gemma":[0.0037479857,0.0002815666,0.994061,0.0009900932,0.00048570725,0.000052738123,0.00008684553,0.000063482286,0.0002305952],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99214166,0.000049748287,0.00088851963,0.0043065315,0.001328333,0.0012852022],"domain_scores_gemma":[0.95555454,0.003069737,0.00045339513,0.040296283,0.0004644008,0.0001616635],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.004249202,0.00071324693,0.000696515,0.00040088018,0.001000404,0.0023768332,0.15006122,0.00053024833,0.000011549055],"category_scores_gemma":[0.02327896,0.0005575618,0.00017700625,0.0009114179,0.0017904284,0.0014054346,0.28400683,0.0014702221,0.000020745489],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008896867,0.000038286937,0.00015986871,0.00011824753,0.000036936013,0.00007000147,0.0000911459,0.00045342557,0.00007764894,0.031698067,0.0041005197,0.9631469],"study_design_scores_gemma":[0.00013263602,0.00004562023,0.000035799516,0.00021715628,0.000007562563,0.000035459718,1.6254114e-7,0.49113068,0.00066867715,0.49509063,0.012209812,0.00042582472],"about_ca_topic_score_codex":0.000034900964,"about_ca_topic_score_gemma":0.0002453759,"teacher_disagreement_score":0.9627211,"about_ca_system_score_codex":0.00052385905,"about_ca_system_score_gemma":0.0010306406,"threshold_uncertainty_score":0.9996876},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39379776,0.0008870934,0.59954196,0.0007454867,0.0012357204,0.0003570935,0.000023216067,0.000017786704,0.0033938866],"genre_scores_gemma":[0.95803934,0.000977197,0.034145463,0.0025535687,0.00050155085,0.00000778548,0.00016879172,0.000053231935,0.0035530622],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852216,0.000025764763,0.00022067744,0.0006908524,0.000256839,0.00028371217],"domain_scores_gemma":[0.99932206,0.000023735096,0.000060179173,0.00042486793,0.00007970906,0.000089474284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035440773,0.00021879523,0.00022766722,0.00013105957,0.000057970905,0.0001667985,0.000354091,0.0002641399,0.00001745399],"category_scores_gemma":[0.00004145231,0.00020673299,0.00004420588,0.00008139497,0.00051018747,0.0000052293094,0.0006048834,0.00024289562,0.0000046082732],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039194696,0.00055895705,0.0041688657,0.00063386443,0.00006723305,0.0011555556,0.0020546517,0.012610558,0.12769906,0.021515911,0.00022392072,0.8289195],"study_design_scores_gemma":[0.008516284,0.0059974175,0.012338906,0.0041015954,0.00013396885,0.0031138796,0.00003168884,0.23029214,0.1441557,0.34368852,0.23679592,0.010833982],"about_ca_topic_score_codex":0.0000099629515,"about_ca_topic_score_gemma":0.00037506287,"teacher_disagreement_score":0.8180855,"about_ca_system_score_codex":0.00003912134,"about_ca_system_score_gemma":0.00021352565,"threshold_uncertainty_score":0.8430327},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008047562,0.00039935886,0.9806555,0.0005519885,0.0059428196,0.00047200333,0.000013392279,0.00022334422,0.0036940405],"genre_scores_gemma":[0.9708511,0.00007395178,0.020615086,0.0050211935,0.0010442971,0.000010439612,0.0000056331046,0.00007344397,0.0023048546],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9957578,0.000087076216,0.0005590966,0.0019466464,0.0010499544,0.00059943664],"domain_scores_gemma":[0.99789333,0.00056001544,0.00035732758,0.0008813701,0.00013664424,0.00017133253],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004719137,0.0005850678,0.00054094516,0.00058830454,0.0002756892,0.0005147587,0.0013917335,0.0004474071,0.00013107737],"category_scores_gemma":[0.00028116564,0.0005100165,0.00016549701,0.000551082,0.0008079132,0.00033594586,0.00090575864,0.0013616873,0.00006419745],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043954657,0.00008031603,0.000015130184,0.00012057514,0.000010212374,0.00062275963,0.0022107388,0.04319492,0.19041944,0.0036444813,0.000025409086,0.7596121],"study_design_scores_gemma":[0.0005197325,0.00045204555,0.0000406227,0.0013695275,0.000019765468,0.0007343014,8.1794553e-7,0.265381,0.69112486,0.03021424,0.0089408,0.0012022513],"about_ca_topic_score_codex":0.0000151423465,"about_ca_topic_score_gemma":0.00012938186,"teacher_disagreement_score":0.96280354,"about_ca_system_score_codex":0.00023161466,"about_ca_system_score_gemma":0.0003494083,"threshold_uncertainty_score":0.9997351},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9845141,0.0017168303,0.0114266025,0.00063419,0.00102408,0.0003516665,0.0000034814882,0.000049856153,0.00027918027],"genre_scores_gemma":[0.9887562,0.0031212703,0.0059552575,0.000755281,0.0011862658,0.000025968282,0.000019595482,0.000035319546,0.00014485982],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99728763,0.00005102524,0.0007361956,0.00094266847,0.0005583173,0.00042413632],"domain_scores_gemma":[0.95567465,0.04308699,0.000207907,0.00059671275,0.00013622441,0.00029749956],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015408315,0.00036147228,0.00066656986,0.00022268714,0.00033707506,0.00015981107,0.0003167889,0.00029331475,0.000013727679],"category_scores_gemma":[0.026329141,0.00025864475,0.00009706554,0.00024328471,0.0014565277,0.00020603533,0.0005718167,0.0016380528,0.000009256596],"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.0000115910625,0.000015191507,0.61233264,0.000036812417,0.000008358359,0.00004049518,0.0005098041,0.00006417059,5.684503e-7,0.000056841578,0.000005450118,0.38691807],"study_design_scores_gemma":[0.00064581755,0.0004623033,0.98040617,0.010821771,0.00011055374,0.00013268662,0.0000035087332,0.0065381527,0.000036783684,0.00035188318,0.00016325629,0.00032712152],"about_ca_topic_score_codex":0.000017394026,"about_ca_topic_score_gemma":0.000009512914,"teacher_disagreement_score":0.38659093,"about_ca_system_score_codex":0.000085211585,"about_ca_system_score_gemma":0.0003202707,"threshold_uncertainty_score":0.9999866},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008827813,0.0013716398,0.9799307,0.0003578342,0.00447979,0.00034551942,0.0000011370824,0.00023930205,0.013265258],"genre_scores_gemma":[0.48069096,0.00008600213,0.5109323,0.00252254,0.0014023816,0.000031579544,0.000010950955,0.000092042836,0.004231208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99554914,0.000096542804,0.0005902881,0.0019512988,0.0010388893,0.0007738577],"domain_scores_gemma":[0.9969037,0.000521329,0.00041271176,0.0015455777,0.00040772484,0.00020893184],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014315369,0.0006146289,0.0007490214,0.0007060045,0.00029624283,0.0011894045,0.003568735,0.00034352124,0.000057961784],"category_scores_gemma":[0.00015743023,0.00053794094,0.00025409478,0.00070088607,0.00039008062,0.0008740552,0.0020540475,0.0009954943,0.00012936913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024434878,0.000023563025,0.0000056059444,0.000036288096,0.00002635882,0.00023132903,0.00085025484,0.0006351344,0.00019409493,0.57389903,0.000013791197,0.42408213],"study_design_scores_gemma":[0.00031695966,0.00023446826,0.00001597233,0.00022645014,0.000022913497,0.00032985848,0.000001674277,0.09859565,0.0063147936,0.87180334,0.020913336,0.0012245773],"about_ca_topic_score_codex":0.000030676918,"about_ca_topic_score_gemma":0.000064925734,"teacher_disagreement_score":0.48068213,"about_ca_system_score_codex":0.00033065875,"about_ca_system_score_gemma":0.0006367579,"threshold_uncertainty_score":0.9998475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035671282,0.00017015067,0.9935699,0.00015624792,0.0015513846,0.00028760688,0.0000033817298,0.00006381173,0.0006304002],"genre_scores_gemma":[0.5167446,0.00009100689,0.48130488,0.00054956134,0.0006429275,0.000021773234,0.00002212083,0.000039623184,0.0005834702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746203,0.000044502478,0.00054998515,0.0010114778,0.00053955143,0.0003924426],"domain_scores_gemma":[0.9981203,0.00071076106,0.00036244365,0.00046240253,0.0002720073,0.00007207077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085261103,0.00029379432,0.0004151573,0.000995363,0.00017063304,0.00025761325,0.000934975,0.00024885393,0.00003369689],"category_scores_gemma":[0.0001958992,0.00031245223,0.00011697787,0.0004952057,0.00018785143,0.0008468334,0.00038681953,0.0007294616,0.000007415498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010967904,0.00004059144,0.00003480291,0.00006234252,0.000008634021,0.000041257812,0.0005522157,0.05767889,0.0049428646,0.00879696,0.000008297424,0.9278222],"study_design_scores_gemma":[0.00095315685,0.0006121197,0.00034531223,0.0021937718,0.000018000961,0.00014388066,0.0000025754982,0.87816507,0.0398637,0.0724473,0.004206381,0.0010487584],"about_ca_topic_score_codex":0.00002001487,"about_ca_topic_score_gemma":0.00006490608,"teacher_disagreement_score":0.9267734,"about_ca_system_score_codex":0.00021606953,"about_ca_system_score_gemma":0.00034082853,"threshold_uncertainty_score":0.99993277},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017466459,0.00089697127,0.9954525,0.000061587954,0.0014099976,0.00039437672,0.0000019001145,0.00078737695,0.0008206036],"genre_scores_gemma":[0.20989116,0.000091696245,0.78884524,0.00033870974,0.00040638854,0.000015446318,0.0000033483022,0.00007108883,0.0003369042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952549,0.00009352317,0.0006060319,0.00216467,0.0010880763,0.0007928419],"domain_scores_gemma":[0.9970691,0.00034955647,0.0005083591,0.0012832566,0.00058976223,0.00019994317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006685386,0.00069406646,0.0006631603,0.0012208816,0.00061730057,0.00060671265,0.0020498715,0.00048111472,0.000030378491],"category_scores_gemma":[0.00019159794,0.0007474659,0.00021131853,0.0011868465,0.00049884844,0.001301494,0.0017284582,0.0018219597,0.000018905605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000811276,0.000014193899,0.000013429751,0.000025518464,0.000012532269,0.0002390003,0.00029020754,0.1060733,0.0019059799,0.0019565276,4.1726932e-7,0.8894608],"study_design_scores_gemma":[0.00022005204,0.00038712297,0.000045697754,0.00044675687,0.000014965991,0.0007871412,0.0000013271091,0.9093614,0.038502615,0.047744982,0.001396439,0.0010914503],"about_ca_topic_score_codex":0.000032543572,"about_ca_topic_score_gemma":0.00015438066,"teacher_disagreement_score":0.8883693,"about_ca_system_score_codex":0.00095630356,"about_ca_system_score_gemma":0.0004027267,"threshold_uncertainty_score":0.99949765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012315807,0.0001627425,0.96977776,0.015184832,0.0015915437,0.00069174246,0.000005059097,0.00020190416,0.00006858665],"genre_scores_gemma":[0.52523607,0.000035358065,0.47002172,0.0045070397,0.00014251132,0.000030137297,0.000010057587,0.000014249346,0.0000028617649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951426,0.00035433733,0.0005372632,0.001760785,0.0013721061,0.00083292637],"domain_scores_gemma":[0.9961138,0.0009057616,0.00024080777,0.002129072,0.00043836175,0.00017223718],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018073767,0.000444676,0.00042074433,0.0005119122,0.00044412375,0.0025660053,0.005542749,0.0002301248,0.000026865358],"category_scores_gemma":[0.00036866203,0.00030431966,0.00014391963,0.0026666378,0.00043272236,0.00042541613,0.005358135,0.001827249,0.000014607614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017946268,0.00012970353,0.000064863554,0.0000351745,0.0000067271794,0.00004014509,0.002355681,0.8475702,0.00013083383,0.0027532277,0.000023115754,0.14688857],"study_design_scores_gemma":[0.00016705772,0.00007440721,0.00023633338,0.00057222793,0.000001988607,0.000017989802,0.0000020741506,0.96547884,0.0013586689,0.03166643,0.00005332878,0.00037068006],"about_ca_topic_score_codex":0.00007854275,"about_ca_topic_score_gemma":0.0001363851,"teacher_disagreement_score":0.51292026,"about_ca_system_score_codex":0.00023803722,"about_ca_system_score_gemma":0.0011206158,"threshold_uncertainty_score":0.9999409},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043790117,0.00065655465,0.99031794,0.0015398035,0.0017926206,0.00030749576,0.000008051605,0.00043963877,0.000558897],"genre_scores_gemma":[0.5823761,0.00006927672,0.41712773,0.00020969383,0.00015603249,0.000002866919,0.000009309335,0.000029071529,0.000019905523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99424875,0.0000728871,0.000688864,0.0024969603,0.0011985127,0.0012940506],"domain_scores_gemma":[0.9908502,0.000684249,0.00036343883,0.0076026935,0.00021595956,0.00028345053],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0004588354,0.000776881,0.00089063845,0.00074639055,0.0003858356,0.0013836417,0.027705578,0.0005842975,0.00004223197],"category_scores_gemma":[0.0028958712,0.0007714266,0.00012369343,0.0007401758,0.0019052833,0.0011605547,0.123600475,0.0017190275,0.0000073527885],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029960776,0.00016498618,0.0066598547,0.00048781236,0.00013319164,0.0010722466,0.0013481395,0.028634062,0.0017416523,0.050491944,0.00036137103,0.9088748],"study_design_scores_gemma":[0.0002685608,0.000051326642,0.00065910164,0.00070451904,0.000014214275,0.0001331579,4.3263123e-7,0.81584793,0.0020071277,0.1794116,0.00016175293,0.00074026996],"about_ca_topic_score_codex":0.00007948608,"about_ca_topic_score_gemma":0.00011280047,"teacher_disagreement_score":0.9081345,"about_ca_system_score_codex":0.0006180809,"about_ca_system_score_gemma":0.0007347477,"threshold_uncertainty_score":0.99965304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011165594,0.00039744534,0.9930326,0.00085227937,0.0022231732,0.0010785313,0.000024584988,0.00020036104,0.0021899552],"genre_scores_gemma":[0.0008682809,0.000088408,0.9957723,0.0006941329,0.0006012836,0.000060512684,0.000061073675,0.00006615112,0.0017878481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99404943,0.000088134315,0.0008249624,0.002375076,0.001695694,0.0009666776],"domain_scores_gemma":[0.9948589,0.0011107939,0.0003652681,0.0019260303,0.0014097657,0.00032920353],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016100167,0.00064052094,0.0007574066,0.0011443162,0.00040556345,0.0012362865,0.00383197,0.00037907672,0.00008425973],"category_scores_gemma":[0.0006876152,0.0006403853,0.00022653925,0.0011256792,0.00054465083,0.00073143933,0.0017172622,0.0008127862,0.00002038078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044402905,0.000030526422,0.0000013422907,0.000028926743,0.00001318809,0.00003703149,0.00011236821,0.7218797,0.000015425017,0.013703566,0.000015734444,0.26415774],"study_design_scores_gemma":[0.00087287405,0.00011071625,0.000003108481,0.00013929879,0.0000107219485,0.00004408235,1.4981444e-7,0.978325,0.00060248695,0.018835148,0.00040399685,0.00065240054],"about_ca_topic_score_codex":0.000023671271,"about_ca_topic_score_gemma":0.000017008508,"teacher_disagreement_score":0.26350534,"about_ca_system_score_codex":0.00042929713,"about_ca_system_score_gemma":0.0014866468,"threshold_uncertainty_score":0.9998005},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105334714,0.0024281426,0.88517976,0.0010013805,0.003819364,0.00021693531,0.000005782378,0.0004044912,0.0016094374],"genre_scores_gemma":[0.8735254,0.000092798604,0.12525846,0.0003886528,0.0007004336,0.0000064647224,0.0000013682597,0.000021810074,0.0000046050172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997087,0.00006003398,0.00043010013,0.00094324985,0.00043157616,0.0010480373],"domain_scores_gemma":[0.9983697,0.00026642738,0.000055208533,0.0010227693,0.00014678786,0.00013910489],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007688631,0.0004201338,0.00040627294,0.0006213763,0.00038072225,0.00019037521,0.0016862886,0.00040135905,0.00018119886],"category_scores_gemma":[0.00018163519,0.00040244556,0.00008157554,0.002595349,0.002545227,0.00051304547,0.00042737022,0.0008121874,0.0002643582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035164227,0.00013628417,0.0032794648,0.0001854367,0.00006465752,0.00019250586,0.008877439,0.1426851,0.010739045,0.008448383,0.00026700995,0.8250895],"study_design_scores_gemma":[0.00043447784,0.00056300306,0.006120316,0.00024048537,0.000017812172,0.000099594436,0.000010771684,0.8701931,0.03798025,0.08289791,0.00066330994,0.0007789253],"about_ca_topic_score_codex":0.00011209909,"about_ca_topic_score_gemma":0.000422781,"teacher_disagreement_score":0.8243106,"about_ca_system_score_codex":0.00016748322,"about_ca_system_score_gemma":0.00018447496,"threshold_uncertainty_score":0.99984276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023929846,0.00048100526,0.9662666,0.00055568747,0.00800371,0.00036470708,0.0000029467712,0.00033306913,0.000062478626],"genre_scores_gemma":[0.39771703,0.000027781653,0.6013677,0.00064829784,0.00019435897,0.000026239391,0.0000045892452,0.000013417647,5.676445e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948095,0.00030694617,0.0006392907,0.0022483908,0.0011365286,0.00085935235],"domain_scores_gemma":[0.9956253,0.00031353475,0.0003384811,0.0031653417,0.00036750187,0.00018984507],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023878214,0.00048176604,0.0005506399,0.00064188556,0.0002923508,0.0018917125,0.0064997366,0.00040782735,0.000009193271],"category_scores_gemma":[0.0007097087,0.00049336586,0.00015021801,0.0026543967,0.00050050596,0.0010827492,0.007052349,0.001562908,0.000016508873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005148118,0.00008251547,0.00036328062,0.00013160572,0.000010237687,0.00008431634,0.0033261294,0.29547954,0.0034202354,0.0022020268,0.000005845305,0.6948891],"study_design_scores_gemma":[0.00016118871,0.00004340378,0.0027069822,0.0002915394,0.000004173272,0.000045660683,0.0000010710487,0.9345693,0.049157888,0.012394441,0.00007575096,0.0005486273],"about_ca_topic_score_codex":0.00007489457,"about_ca_topic_score_gemma":0.000044310225,"teacher_disagreement_score":0.6943405,"about_ca_system_score_codex":0.00049349567,"about_ca_system_score_gemma":0.0012799485,"threshold_uncertainty_score":0.9997518},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95469916,0.00085595046,0.020131174,0.005520279,0.000835801,0.00157957,0.0000066190364,0.00008834968,0.016283123],"genre_scores_gemma":[0.99886966,0.0000089715195,0.00079110125,0.000026844178,0.0001908702,0.0000067760557,0.0000062126787,0.000010274092,0.00008931524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966679,0.00091806543,0.0004117531,0.0005064321,0.001195081,0.00030072706],"domain_scores_gemma":[0.9979011,0.0008888396,0.00057518115,0.00011796121,0.00049324264,0.000023697343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029784646,0.00022653762,0.00069845084,0.0005272981,0.0007683432,0.000055416695,0.0004484007,0.00036015862,0.000041312844],"category_scores_gemma":[0.0006145193,0.0001902413,0.00009937894,0.0007717923,0.00223267,0.00009139509,0.00025901786,0.0015191014,0.0000013728667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010526183,0.000102962644,0.041249283,0.00019155996,0.00007327286,0.000007708497,0.11162962,0.15560389,0.00085201423,0.0575948,0.000009009275,0.63258064],"study_design_scores_gemma":[0.014674972,0.008939505,0.057543915,0.010255164,0.0010885422,0.000036346006,0.011209093,0.7491617,0.028977232,0.08008758,0.03297184,0.005054103],"about_ca_topic_score_codex":0.000052323983,"about_ca_topic_score_gemma":0.0009363503,"teacher_disagreement_score":0.6275265,"about_ca_system_score_codex":0.0002968281,"about_ca_system_score_gemma":0.0009249722,"threshold_uncertainty_score":0.8226366},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014554149,0.00017903028,0.8734354,0.0004951961,0.0015082104,0.00077457004,0.00003212703,0.00013787881,0.121982224],"genre_scores_gemma":[0.52905107,0.0017929423,0.34960753,0.013613132,0.012653385,0.0010511455,0.005890872,0.0006273258,0.08571261],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789983,0.00006955497,0.00041038485,0.00096179184,0.00032446167,0.00033398703],"domain_scores_gemma":[0.9988205,0.00022007752,0.00018578098,0.00047695113,0.0002132005,0.00008349855],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000491642,0.00026095286,0.0002894258,0.0007039181,0.000102861544,0.00008646536,0.00033936225,0.00043207197,0.0010952282],"category_scores_gemma":[0.000031701125,0.00028232133,0.000083211125,0.00047479355,0.00024990263,0.00014009445,0.000115333365,0.00061006926,0.0015044726],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008691011,0.000096687945,0.000047322326,0.00002449925,0.0000088231345,0.000037857324,0.0005807341,0.00022813768,0.00037944922,0.0014543013,0.00006846586,0.997065],"study_design_scores_gemma":[0.007163614,0.0014298802,0.026914973,0.0064875223,0.00025901338,0.0014267333,0.000026318465,0.04294481,0.004654308,0.85237694,0.04943777,0.0068781474],"about_ca_topic_score_codex":0.00006364677,"about_ca_topic_score_gemma":0.00025291872,"teacher_disagreement_score":0.99018687,"about_ca_system_score_codex":0.00021996813,"about_ca_system_score_gemma":0.00015101886,"threshold_uncertainty_score":0.99996287},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044035996,0.0003980616,0.9944323,0.00030502226,0.0025794494,0.00067080505,0.0000127532785,0.000100576406,0.001060696],"genre_scores_gemma":[0.16824189,0.000016310858,0.8305001,0.00038115287,0.0005769716,0.000018311288,0.0000070076253,0.000038973205,0.00021925368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957779,0.000027232092,0.0008855091,0.0017665945,0.0008325612,0.0007102167],"domain_scores_gemma":[0.99668777,0.0008169606,0.00029918455,0.0015741857,0.00046537427,0.00015654776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009793179,0.0005129636,0.00084822025,0.0006434575,0.00024923886,0.00037408844,0.0030058825,0.00036074364,0.000014871796],"category_scores_gemma":[0.00014665931,0.0005186478,0.000270569,0.00046775726,0.00033868366,0.00037885114,0.0019809944,0.0005167719,0.0000032399566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000120689065,0.00002760975,0.00005945088,0.00016699739,0.000026715274,0.000024253335,0.00082589267,0.29291296,0.0018274504,0.009649667,0.000007884109,0.694459],"study_design_scores_gemma":[0.00039287974,0.00011024733,0.00003777196,0.00051663775,0.000013975463,0.00003675065,6.0452953e-7,0.9837217,0.0058133123,0.0074051213,0.0013547064,0.0005962959],"about_ca_topic_score_codex":0.00002923821,"about_ca_topic_score_gemma":0.0001478713,"teacher_disagreement_score":0.69386274,"about_ca_system_score_codex":0.00027440322,"about_ca_system_score_gemma":0.00082317047,"threshold_uncertainty_score":0.99972653},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004828557,0.0005213493,0.9908216,0.0011040956,0.00052386045,0.0008582901,0.000014763159,0.000057965262,0.0012695049],"genre_scores_gemma":[0.8485429,0.000015398398,0.14678238,0.0041020554,0.0003200336,0.000020724283,0.0000030096762,0.000043868164,0.00016960221],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681014,0.000114003335,0.0007841153,0.0011047504,0.0005519081,0.0006350845],"domain_scores_gemma":[0.9896595,0.008372004,0.00038930244,0.0008292062,0.00027485806,0.00047512265],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002262382,0.0004447321,0.0009996502,0.00052182307,0.00041999333,0.000069687994,0.0008459563,0.00026505807,0.00012894953],"category_scores_gemma":[0.013691007,0.00036706752,0.00015283818,0.00047212082,0.0007499344,0.00006735974,0.00091936084,0.000666797,0.000003067431],"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.0000339804,0.0005149314,0.019354515,0.0021692764,0.0004316096,0.10198802,0.040098295,0.2100326,0.00001322985,0.041429512,0.00038180084,0.58355224],"study_design_scores_gemma":[0.0007156098,0.0006406635,0.00012216906,0.0005518406,0.0001383858,0.0027113429,0.00006188043,0.23509601,0.000029821074,0.75587577,0.0027051747,0.0013513593],"about_ca_topic_score_codex":0.04379757,"about_ca_topic_score_gemma":0.5261593,"teacher_disagreement_score":0.8440392,"about_ca_system_score_codex":0.0010660489,"about_ca_system_score_gemma":0.0018479215,"threshold_uncertainty_score":0.9998781},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018577372,0.0009815034,0.9925501,0.0007962993,0.0029124178,0.00064599985,0.0000146400735,0.00024499669,0.001835469],"genre_scores_gemma":[0.0037097286,0.00006369253,0.9939889,0.0009602672,0.0007701167,0.00003983342,0.0000297599,0.000041772742,0.0003959363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953967,0.000037819416,0.0006870464,0.002021227,0.0010196799,0.00083756243],"domain_scores_gemma":[0.996504,0.0008588106,0.00037423134,0.0015605326,0.00052098674,0.00018141422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013206035,0.0005910568,0.00065307325,0.0010158627,0.00053589744,0.0009776711,0.0033309355,0.00035880267,0.000018438916],"category_scores_gemma":[0.00017387493,0.0005996765,0.00034209105,0.0010637471,0.0006013393,0.0007431388,0.0013625191,0.00075095834,0.000010473702],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022223398,0.000028574563,0.0000074242444,0.000069871436,0.000013977875,0.000030882886,0.00036650745,0.002658052,0.00005383528,0.14618133,0.00002071622,0.8505666],"study_design_scores_gemma":[0.00025591438,0.000096449796,0.000021166406,0.00029910923,0.0000078050725,0.000057061916,2.9218285e-7,0.6048854,0.0012373115,0.39001793,0.0025631483,0.00055842556],"about_ca_topic_score_codex":0.000012886675,"about_ca_topic_score_gemma":0.000036986625,"teacher_disagreement_score":0.8500082,"about_ca_system_score_codex":0.00022007998,"about_ca_system_score_gemma":0.00056821766,"threshold_uncertainty_score":0.9996455},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018937117,0.0014596372,0.990493,0.0011189877,0.0006157571,0.0013851649,0.000025911462,0.0001420792,0.0047575743],"genre_scores_gemma":[0.0054527894,0.00010498847,0.9912888,0.0017699002,0.0005865128,0.0002327882,0.000033460063,0.00005753375,0.0004732701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940172,0.000116175375,0.00083536323,0.0027126211,0.0013530577,0.00096558954],"domain_scores_gemma":[0.99615544,0.00080798205,0.00029312688,0.0020025652,0.00034924044,0.00039166945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022676352,0.0007201223,0.0009734719,0.00086124375,0.0002625002,0.0004745655,0.004647828,0.0009603592,0.000015879314],"category_scores_gemma":[0.00010062756,0.0006409521,0.00027782063,0.0009798903,0.00042099832,0.0005913608,0.0015793083,0.0014651519,0.000003990726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048521906,0.00007935762,0.0000048070597,0.00009059342,0.000012717327,0.00003832925,0.00040338043,0.012511836,0.000034633747,0.486404,0.000011348136,0.5004041],"study_design_scores_gemma":[0.00036761537,0.00003156543,0.000008512428,0.00017761302,0.0000069425373,0.000054446413,1.08449825e-7,0.6354785,0.00016488989,0.36217347,0.0010590064,0.00047733012],"about_ca_topic_score_codex":0.000034602377,"about_ca_topic_score_gemma":0.00005462612,"teacher_disagreement_score":0.62296665,"about_ca_system_score_codex":0.00026900074,"about_ca_system_score_gemma":0.0013957417,"threshold_uncertainty_score":0.99960417},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13426553,0.0001334206,0.8607063,0.0024118186,0.00130025,0.001043051,0.000016993787,0.000028904049,0.00009368621],"genre_scores_gemma":[0.8476134,0.000014010651,0.15080562,0.00076314196,0.00051268446,0.00005998164,0.000028916973,0.00003796066,0.00016431989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980965,0.00004970207,0.00042342342,0.0006460729,0.0004996211,0.00028467868],"domain_scores_gemma":[0.9963262,0.002683826,0.00015555866,0.0004338672,0.00034320776,0.000057340807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007642662,0.0002447057,0.00039364336,0.00073972525,0.000113538634,0.00007876883,0.00018478722,0.00014920192,0.000018278339],"category_scores_gemma":[0.0008698514,0.00018537651,0.00019989898,0.0003149395,0.0002486353,0.00017213232,0.00006168356,0.00040914761,0.0000011719617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026014366,0.00020659585,0.035961952,0.0015349486,0.00004910736,0.000061754945,0.0037842507,0.29727393,0.011638987,0.0012394473,0.000011049569,0.6479778],"study_design_scores_gemma":[0.0029509002,0.0012461967,0.04198969,0.0054932176,0.0000897733,0.00005324378,0.00005095371,0.93647486,0.0065134917,0.0027046853,0.0016643157,0.00076866377],"about_ca_topic_score_codex":0.00003521737,"about_ca_topic_score_gemma":0.00009633652,"teacher_disagreement_score":0.71334785,"about_ca_system_score_codex":0.0005723511,"about_ca_system_score_gemma":0.000433937,"threshold_uncertainty_score":0.7559435},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003171246,0.018778615,0.9782785,0.0011943383,0.0009619553,0.00027217297,0.0000043060772,0.000070156486,0.00012281699],"genre_scores_gemma":[0.41835645,0.003611218,0.5746332,0.0001814322,0.0028022563,0.000014745224,0.000013649875,0.000061758896,0.0003253047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751323,0.00004137142,0.00031697025,0.0013243208,0.0004501078,0.00035400604],"domain_scores_gemma":[0.99833375,0.0004716744,0.00022704057,0.00044159568,0.00041599327,0.00010992081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000483411,0.00036868348,0.00044383947,0.00047607525,0.0003475198,0.00077322766,0.0005596918,0.00020157138,7.9002024e-7],"category_scores_gemma":[0.00006406096,0.0003263377,0.00007086808,0.0003213226,0.00029221742,0.00048305598,0.000489918,0.0007094156,7.320972e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056259246,0.00002298377,0.000053849908,0.00016737201,0.0000204827,0.000012201176,0.0047926265,0.45780516,0.000012217288,0.22130473,0.0000034902187,0.31579927],"study_design_scores_gemma":[0.00018016734,0.00010525193,0.000020528663,0.0006257055,0.000013191352,0.000028022214,0.00001598648,0.97981197,0.00001562536,0.016612044,0.002194548,0.00037694376],"about_ca_topic_score_codex":0.000011685044,"about_ca_topic_score_gemma":0.0000065545246,"teacher_disagreement_score":0.5220068,"about_ca_system_score_codex":0.00012122466,"about_ca_system_score_gemma":0.00026199175,"threshold_uncertainty_score":0.9999189},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075224304,0.0008134446,0.9938599,0.00059781823,0.0013294313,0.00032152518,0.0000032178004,0.00008386453,0.002238581],"genre_scores_gemma":[0.858644,0.000057768415,0.13948378,0.0003543802,0.00012226337,0.0000105891495,0.000008467385,0.000021586424,0.0012971301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969582,0.000037044032,0.00060282444,0.0010609672,0.0009984276,0.00034256483],"domain_scores_gemma":[0.997531,0.00013748565,0.00036227016,0.001569335,0.00029281894,0.00010709615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006666122,0.000303498,0.00042102358,0.0005554015,0.000110323635,0.00032410424,0.0027642737,0.0001693701,0.000032989483],"category_scores_gemma":[0.000010489355,0.00029159992,0.00012294705,0.0006581808,0.00030480066,0.00024176536,0.0010332502,0.0002710686,0.00004577401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035520502,0.00012956021,0.00017663396,0.00073744357,0.00008752739,0.00008519663,0.015785698,0.0007370086,0.00026515685,0.4016304,0.000019135252,0.58034265],"study_design_scores_gemma":[0.0005994232,0.00014669559,0.0031243241,0.002897446,0.00005728834,0.00008013548,0.000004303528,0.7899275,0.0029884463,0.1931516,0.00571044,0.0013123896],"about_ca_topic_score_codex":0.000010372148,"about_ca_topic_score_gemma":0.00003325462,"teacher_disagreement_score":0.8578918,"about_ca_system_score_codex":0.00013129259,"about_ca_system_score_gemma":0.00019993052,"threshold_uncertainty_score":0.9999536},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023558938,0.0007606146,0.98594785,0.009415395,0.002243927,0.0011020264,0.0000050214144,0.00015803435,0.00013151747],"genre_scores_gemma":[0.758899,0.00013671945,0.06337676,0.17159963,0.004267129,0.00022538962,0.00009662884,0.00024592466,0.0011528332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656206,0.000037901613,0.0004283031,0.0015101723,0.00075616897,0.0007053907],"domain_scores_gemma":[0.9960943,0.0021672088,0.00021817232,0.00090708706,0.00025105875,0.00036219007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075313257,0.000506318,0.0006387802,0.0007280528,0.0004227055,0.00023293392,0.00048651968,0.00038753246,0.00005191961],"category_scores_gemma":[0.0011951296,0.0004671944,0.0002433875,0.00050401397,0.00049252884,0.000075373595,0.00030944415,0.0008434165,0.000007663263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008688095,0.00006351092,0.000015617778,0.00017340179,0.000012607844,0.0001867208,0.00016841834,0.8005261,0.00013708055,0.00009875196,0.00017727623,0.19835366],"study_design_scores_gemma":[0.0009210366,0.00066798204,0.00005609112,0.00052540074,0.000062162646,0.00013019556,7.018534e-7,0.98028296,0.0031443995,0.0011930778,0.012558734,0.00045725255],"about_ca_topic_score_codex":0.000054565135,"about_ca_topic_score_gemma":0.000120788805,"teacher_disagreement_score":0.9225711,"about_ca_system_score_codex":0.0015150801,"about_ca_system_score_gemma":0.0007275725,"threshold_uncertainty_score":0.999778},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000110297166,0.0002868804,0.98217946,0.0077065793,0.00012152546,0.00038962625,0.000011697382,0.00007145433,0.009122462],"genre_scores_gemma":[0.8575147,0.00023359756,0.121211365,0.018529711,0.00038157418,0.000046408255,0.0000367051,0.000040563482,0.0020053855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974,0.00006152463,0.00036386738,0.0010725914,0.00071919756,0.0003828503],"domain_scores_gemma":[0.9975601,0.0004476674,0.00019160344,0.0013982817,0.0002589269,0.00014342011],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010877075,0.00035026864,0.00043880125,0.0002695592,0.00056218903,0.0011429575,0.0016937553,0.00021172884,0.000010565798],"category_scores_gemma":[0.000106398584,0.0002532456,0.000095159674,0.00040624602,0.0013956089,0.0006704014,0.0008896422,0.0006982206,0.000009331881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004199549,0.000026113225,0.000018622755,0.000017430315,0.000010272342,0.0000069394773,0.0010420731,0.02540703,0.00016680654,0.69830364,0.00012255728,0.2748743],"study_design_scores_gemma":[0.0002799172,0.000033462857,0.00008468285,0.000087570574,0.0000072193575,0.000024598552,1.4183888e-7,0.675255,0.000495143,0.3225695,0.0009301418,0.00023260554],"about_ca_topic_score_codex":0.000102374586,"about_ca_topic_score_gemma":0.00011329679,"teacher_disagreement_score":0.8609681,"about_ca_system_score_codex":0.00016076535,"about_ca_system_score_gemma":0.00051837944,"threshold_uncertainty_score":0.99999195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011915461,0.0116906315,0.90817004,0.008906389,0.00798072,0.002881812,0.00028147278,0.00043926807,0.047734212],"genre_scores_gemma":[0.66292405,0.04489014,0.27383006,0.0026791326,0.0053969766,0.000022097604,0.0002660069,0.00015586897,0.0098356595],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99735624,0.000077881516,0.00036718958,0.0008524657,0.00088050135,0.00046570456],"domain_scores_gemma":[0.99823743,0.0002756426,0.0002658689,0.00059162074,0.00045520693,0.00017422218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007666955,0.00031633468,0.00045687536,0.00024795107,0.00056808733,0.00039873892,0.001329262,0.00044130246,0.00014247476],"category_scores_gemma":[0.000381424,0.00026120024,0.000086056665,0.0005453744,0.0019626988,0.0006276358,0.0011029297,0.0006456813,0.0000066053562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002011381,0.0002496532,0.00051847857,0.0007110863,0.00012136722,0.0004857564,0.13926747,0.0013091702,0.0024348556,0.2654425,0.002818794,0.5864397],"study_design_scores_gemma":[0.0014877771,0.00059171155,0.000197522,0.0021765514,0.00010050379,0.00016234223,0.0004517926,0.009035436,0.0043864907,0.45439434,0.5242925,0.0027230284],"about_ca_topic_score_codex":0.00044957484,"about_ca_topic_score_gemma":0.0036990636,"teacher_disagreement_score":0.6510086,"about_ca_system_score_codex":0.00030902505,"about_ca_system_score_gemma":0.0006221236,"threshold_uncertainty_score":0.999984},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024506138,0.000897541,0.9914581,0.00013578603,0.0026230542,0.0010878573,0.000017048264,0.00028632168,0.0010436696],"genre_scores_gemma":[0.16458395,0.000025148747,0.83450943,0.00015536467,0.00038439178,0.00004106267,0.000012470305,0.000059797254,0.00022835721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938552,0.00036930732,0.0008690912,0.002388818,0.0016616946,0.00085589767],"domain_scores_gemma":[0.99521977,0.00057712273,0.00051377417,0.002518785,0.000939573,0.00023096382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028834057,0.0006942523,0.0008043412,0.00084118405,0.00048055648,0.00094942265,0.0039962362,0.000380312,0.0000046841697],"category_scores_gemma":[0.00022811066,0.00069335266,0.0001932704,0.0011603731,0.0006588476,0.001119639,0.0014338129,0.0010267387,0.000016800266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010471405,0.00006103582,0.000021288604,0.00030120384,0.000034734712,0.00011973074,0.0006748031,0.31952372,0.0053286254,0.017771466,0.000046682133,0.65610623],"study_design_scores_gemma":[0.0002830347,0.00011020289,0.00005712952,0.0007276792,0.000017610557,0.0002805852,0.0000012669833,0.96718717,0.029612549,0.00083275756,0.00019939424,0.00069062714],"about_ca_topic_score_codex":0.0001232559,"about_ca_topic_score_gemma":0.000015381132,"teacher_disagreement_score":0.6554156,"about_ca_system_score_codex":0.0017485721,"about_ca_system_score_gemma":0.0007135888,"threshold_uncertainty_score":0.9995518},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001559782,0.00036414282,0.97886246,0.003587444,0.004249522,0.0003196176,0.0000041110748,0.00041421544,0.012042511],"genre_scores_gemma":[0.82281893,0.000041221327,0.1695537,0.0044361404,0.0012109712,0.000043796088,0.000042022148,0.000099954144,0.0017532855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99545336,0.00006006162,0.00077703927,0.0020881793,0.00089671265,0.00072465953],"domain_scores_gemma":[0.9966673,0.0003238351,0.0005328414,0.0020983974,0.00026438633,0.000113208014],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006579625,0.0006975574,0.00066159817,0.0016981334,0.0004970015,0.0008610463,0.003756319,0.00054183265,0.00020126555],"category_scores_gemma":[0.00007880449,0.00069649785,0.0001888354,0.0011112143,0.0008522909,0.0013884639,0.001978743,0.0023504803,0.00016423731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057332995,0.00006389568,0.00005449363,0.000033963694,0.000039259696,0.0005146014,0.00085161236,0.0017526841,0.00033434224,0.78902954,0.00005219162,0.20726766],"study_design_scores_gemma":[0.00048575303,0.0003885295,0.00028973375,0.0009234976,0.00001690781,0.0008271325,4.9023515e-7,0.11681923,0.0058261845,0.85179,0.02112797,0.0015045471],"about_ca_topic_score_codex":0.00003736169,"about_ca_topic_score_gemma":0.00024511034,"teacher_disagreement_score":0.82266295,"about_ca_system_score_codex":0.00080348615,"about_ca_system_score_gemma":0.00043746948,"threshold_uncertainty_score":0.9999511},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023117532,0.0020307808,0.99268484,0.00064236333,0.0012137131,0.0003953522,0.000009808143,0.00012678586,0.0026651872],"genre_scores_gemma":[0.21545805,0.0006856879,0.778256,0.002676978,0.0006552495,0.000038673636,0.000017754885,0.00014014471,0.0020714395],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942281,0.00007849368,0.00071785547,0.0020760824,0.0018452534,0.0010541712],"domain_scores_gemma":[0.99471855,0.00087894226,0.0005269082,0.0027932257,0.00079004734,0.0002923176],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013968236,0.0006165697,0.00091121893,0.001458028,0.00019577002,0.00038781075,0.0055795955,0.000371998,0.000058267942],"category_scores_gemma":[0.00022932314,0.00058952306,0.00029636212,0.0016934964,0.0013949014,0.0008304133,0.0027535353,0.0012613526,0.000033046294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055957407,0.00028411555,0.0009789389,0.00049564976,0.00014587118,0.0013784616,0.0017610595,0.04568362,0.004287956,0.3966157,0.00011958416,0.5481931],"study_design_scores_gemma":[0.000499382,0.00021536105,0.00024320987,0.001007485,0.000013155669,0.00013293172,9.3875957e-7,0.23533444,0.007061465,0.75209737,0.0023440996,0.0010501693],"about_ca_topic_score_codex":0.000030226147,"about_ca_topic_score_gemma":0.00011884944,"teacher_disagreement_score":0.5471429,"about_ca_system_score_codex":0.00022612822,"about_ca_system_score_gemma":0.000793429,"threshold_uncertainty_score":0.9998007},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008856948,0.00015060353,0.98293287,0.0010841929,0.0030220184,0.00027821717,0.00003209952,0.000042307438,0.011571991],"genre_scores_gemma":[0.6069022,0.00001469976,0.37486964,0.0008618226,0.00074133516,0.000012462516,0.00008972351,0.00004442271,0.016463706],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99320966,0.0000932749,0.001189611,0.0021539708,0.0029197324,0.00043372755],"domain_scores_gemma":[0.99183476,0.0030764898,0.00054904004,0.0033211908,0.0010827938,0.000135722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007768462,0.00032331803,0.0006257204,0.001258993,0.00030075514,0.00082066556,0.0034681829,0.00014896199,0.0006065771],"category_scores_gemma":[0.0056237085,0.00026147327,0.0002270187,0.0018339325,0.0013100082,0.00033638964,0.002499252,0.0003867923,0.00008026275],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005722015,0.000053668544,0.00026837827,0.000021562977,0.000009314707,0.000028592493,0.0004570879,0.022544077,0.000056136498,0.017997235,0.00064913643,0.9579091],"study_design_scores_gemma":[0.00034289202,0.00012932679,0.0015664919,0.0003254758,0.000020014855,0.000020350517,0.0000053097624,0.23276682,0.0006039148,0.71929634,0.04426101,0.0006620863],"about_ca_topic_score_codex":0.000034929883,"about_ca_topic_score_gemma":0.00032022825,"teacher_disagreement_score":0.957247,"about_ca_system_score_codex":0.00017677702,"about_ca_system_score_gemma":0.00068793795,"threshold_uncertainty_score":0.9999837},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055960757,0.00022235284,0.99089783,0.0002558077,0.0014775037,0.0010204994,0.000037158192,0.00012592923,0.00036685588],"genre_scores_gemma":[0.4772264,0.000027288817,0.5190948,0.0009997247,0.00048677815,0.000044225562,0.00035491935,0.000110058085,0.0016557873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971796,0.00008170424,0.00060145924,0.0013223967,0.00039001694,0.0004247821],"domain_scores_gemma":[0.9978301,0.0004252024,0.00030551077,0.0008092294,0.00055677793,0.000073210955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007105662,0.00037288337,0.00046771395,0.000644203,0.00026068292,0.00017755083,0.0005976384,0.0003934254,0.00008970828],"category_scores_gemma":[0.0005536157,0.00031986996,0.00005064482,0.00052179577,0.00018572138,0.00023157963,0.00029059238,0.0005220898,0.000008659866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010886947,0.000047734637,0.000011089311,0.0000899434,0.000020482566,0.000052751835,0.00058558065,0.018631767,0.0026059714,0.0000113549295,0.00004784687,0.9777866],"study_design_scores_gemma":[0.0016763015,0.00019063505,0.00013091475,0.0017220513,0.000024439238,0.00011970479,0.0000034008294,0.9923872,0.0008239966,0.0023164328,0.00019684981,0.00040811606],"about_ca_topic_score_codex":0.000082394006,"about_ca_topic_score_gemma":0.0033211617,"teacher_disagreement_score":0.9773785,"about_ca_system_score_codex":0.00029816115,"about_ca_system_score_gemma":0.00041525986,"threshold_uncertainty_score":0.9999253},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4692842,0.00024281826,0.50698787,0.013699102,0.002307004,0.002339096,0.0000127359235,0.000043366526,0.0050838036],"genre_scores_gemma":[0.99682754,0.000034319142,0.0011717218,0.0016363907,0.0002771869,0.000016678967,0.000011385416,0.000009167664,0.000015631285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822253,0.000052372634,0.0005954036,0.00032114933,0.0005468851,0.00026163933],"domain_scores_gemma":[0.9979935,0.0007627459,0.00020587037,0.00073190074,0.00023260183,0.00007334139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095999555,0.00021500999,0.00025993798,0.0003686064,0.00012969336,0.00009616919,0.00045251704,0.00016590144,0.00021698784],"category_scores_gemma":[0.00037880059,0.00011686075,0.00009671599,0.00040939593,0.000411037,0.00015172917,0.000058005226,0.0006731526,0.000034475142],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012308195,0.00015131875,0.0002350099,0.000025628147,0.00000856871,0.0000070261685,0.012746057,0.051451374,0.00036485202,0.03896988,0.000020946594,0.89589626],"study_design_scores_gemma":[0.000043722113,0.0044027762,0.0024346956,0.002845813,0.00001799264,0.000035706136,0.0003049633,0.5096046,0.27063364,0.20888391,0.00018669116,0.00060550845],"about_ca_topic_score_codex":0.00052953686,"about_ca_topic_score_gemma":0.00012032366,"teacher_disagreement_score":0.89529073,"about_ca_system_score_codex":0.00044882586,"about_ca_system_score_gemma":0.00083513395,"threshold_uncertainty_score":0.4765443},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018748104,0.0007677662,0.979619,0.0002461225,0.0019066349,0.0006392921,0.00003288389,0.00011382777,0.016486958],"genre_scores_gemma":[0.124526516,0.000111645444,0.85583514,0.0016963774,0.0016965221,0.000092275295,0.00017821699,0.0002583727,0.015604962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959742,0.00008919794,0.000505287,0.0014103735,0.0010793387,0.0009416245],"domain_scores_gemma":[0.9977482,0.00030528955,0.0002124045,0.0010823458,0.0003669165,0.0002848179],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007458011,0.00045844252,0.0005736584,0.0005305801,0.0002724616,0.00025215888,0.0011436843,0.00045158694,0.00021385231],"category_scores_gemma":[0.000010084963,0.00039316405,0.000067260204,0.0005648323,0.0005279669,0.00013599735,0.00042745774,0.0014780096,0.00009152526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003859406,0.000054697848,0.00004804402,0.00034198235,0.000043774355,0.0014171624,0.0007471486,0.088518515,0.000002592381,0.024538048,0.000019480609,0.88422996],"study_design_scores_gemma":[0.00036938136,0.00023819321,0.00001621121,0.000978025,0.000009405324,0.0002844694,0.0000044309068,0.9952239,0.000041050826,0.0017554748,0.00065347145,0.0004259937],"about_ca_topic_score_codex":0.00022457601,"about_ca_topic_score_gemma":0.00024534427,"teacher_disagreement_score":0.9067054,"about_ca_system_score_codex":0.0013069928,"about_ca_system_score_gemma":0.000744705,"threshold_uncertainty_score":0.999852},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007342908,0.0017850095,0.99287003,0.0003350996,0.0008692576,0.001833573,0.00003782553,0.000025615813,0.0015093116],"genre_scores_gemma":[0.59505516,0.000057761008,0.39725408,0.0005606613,0.0006011693,0.0011755294,0.0000650713,0.00010650694,0.0051240874],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975043,0.00010181177,0.0005415473,0.00085767964,0.00035028518,0.0006443584],"domain_scores_gemma":[0.9979029,0.0010147612,0.00018277766,0.00053440634,0.00021178836,0.00015334506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00470606,0.0001847464,0.00030402353,0.00036752113,0.0002119977,0.00008242272,0.0005102348,0.00014308754,0.00001942389],"category_scores_gemma":[0.0000534848,0.00018645087,0.000067013665,0.00017735272,0.0006601939,0.00010471581,0.0003044233,0.0002591737,0.0000024268977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004786594,0.00018874409,0.00003346945,0.0021820609,0.000028768278,0.000012602245,0.0004643226,0.00036322873,0.000013017516,0.19554496,0.000030752566,0.80109024],"study_design_scores_gemma":[0.0041691307,0.02970131,0.0018538963,0.02020331,0.00011095778,0.000058869755,0.000059530146,0.16208589,0.0045131743,0.7356892,0.039789785,0.0017649145],"about_ca_topic_score_codex":0.000014250367,"about_ca_topic_score_gemma":0.00018565216,"teacher_disagreement_score":0.7993253,"about_ca_system_score_codex":0.00035723796,"about_ca_system_score_gemma":0.00025326738,"threshold_uncertainty_score":0.7603246},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005102681,0.00027442322,0.9918658,0.0005572711,0.0021188671,0.00035058995,0.0000014181478,0.0001702648,0.0046103173],"genre_scores_gemma":[0.45267695,0.000031708325,0.5441453,0.0012830195,0.0011661069,0.0000306026,0.000045619137,0.00003586933,0.00058482494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666446,0.00007064298,0.0005376769,0.0012782639,0.00091715675,0.0005318229],"domain_scores_gemma":[0.9976188,0.00028754654,0.00041111038,0.001113388,0.000412633,0.00015649834],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011077211,0.0003697808,0.00039631056,0.00033797757,0.0003149033,0.0011851523,0.0013397847,0.00032620272,0.00002942128],"category_scores_gemma":[0.0002033867,0.00033868238,0.00011675449,0.00047031758,0.0002825679,0.0009868977,0.0006717075,0.0006131108,0.00007426862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002572966,0.000038758026,0.000036178833,0.00006131689,0.00001506124,0.00016727071,0.0006192028,0.0015592221,0.0008279749,0.65645623,0.000052841486,0.34016338],"study_design_scores_gemma":[0.0006593564,0.0004705417,0.00012683874,0.00021994072,0.000032775613,0.0008704822,0.0000018800479,0.63923293,0.015723607,0.31076968,0.030161032,0.0017309705],"about_ca_topic_score_codex":0.000015215141,"about_ca_topic_score_gemma":0.000030450918,"teacher_disagreement_score":0.6376737,"about_ca_system_score_codex":0.00025652413,"about_ca_system_score_gemma":0.0009041201,"threshold_uncertainty_score":0.99990654},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014924317,0.00010303623,0.98909014,0.004161916,0.0038847649,0.00086448784,0.00016620265,0.000303377,0.0014111664],"genre_scores_gemma":[0.0040333783,0.00001274494,0.98097855,0.011160896,0.0017832501,0.000024480947,0.00040231628,0.00007639297,0.0015279904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941825,0.000046246096,0.00064067025,0.002979161,0.0011668998,0.0009844918],"domain_scores_gemma":[0.9926824,0.0008585245,0.0004014424,0.0054952973,0.0003198577,0.00024248219],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001957644,0.0007199434,0.0006949783,0.00086152746,0.00035280196,0.0013863245,0.013769126,0.00017534214,0.000016578897],"category_scores_gemma":[0.00012204496,0.0006726858,0.00013792705,0.0005519401,0.00041430746,0.0010483215,0.0053104926,0.0005862159,0.00014546457],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017266182,0.00004436599,0.000014683843,0.00023626791,0.000028347265,0.000068027046,0.00016012492,0.021629205,0.000031961412,0.010171843,0.002442396,0.9651555],"study_design_scores_gemma":[0.00048709655,0.00009352063,0.000009129816,0.000335582,0.000023479657,0.0000133165095,6.571935e-8,0.8880533,0.0004984471,0.032515712,0.07718881,0.00078154047],"about_ca_topic_score_codex":0.000028287706,"about_ca_topic_score_gemma":0.00026826322,"teacher_disagreement_score":0.96437395,"about_ca_system_score_codex":0.00015952173,"about_ca_system_score_gemma":0.00043044577,"threshold_uncertainty_score":0.99965036},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08393407,0.0007855419,0.91480136,0.00009386517,0.000025081255,0.00026979114,0.000010963101,0.000006207653,0.00007310015],"genre_scores_gemma":[0.9692362,0.000073641306,0.03001157,0.00031029485,0.00007174907,0.000007996035,0.000043392934,0.000012550173,0.00023259602],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988267,0.000057113673,0.00024278488,0.00050205697,0.00020448498,0.0001668725],"domain_scores_gemma":[0.99913263,0.000095103314,0.00017651537,0.00045293878,0.000121735495,0.000021055193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000474275,0.00018295561,0.00022402279,0.00014010518,0.00015358887,0.000091451955,0.0003983828,0.00014496833,0.0000022870572],"category_scores_gemma":[0.0001457089,0.00012065467,0.000111735375,0.00014185192,0.00038341785,0.000009507738,0.00038123707,0.00027568883,3.412221e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031101114,0.00008159458,0.0010130756,0.000094819785,0.00008228777,0.000129718,0.000607981,0.14309326,0.8175796,0.0010510581,0.000045374163,0.036190126],"study_design_scores_gemma":[0.00033225573,0.0002316326,0.00016517851,0.00014766437,0.000111727575,0.00024859246,0.0000018708089,0.90799534,0.085807376,0.0039768997,0.0006158785,0.0003655859],"about_ca_topic_score_codex":0.00025274366,"about_ca_topic_score_gemma":0.0017830029,"teacher_disagreement_score":0.8853021,"about_ca_system_score_codex":0.000027465412,"about_ca_system_score_gemma":0.000085066116,"threshold_uncertainty_score":0.49201545},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000033441818,0.55266994,0.44489694,0.0013505408,0.00047323076,0.0004712652,0.0000012802375,0.000112575326,0.000020886451],"genre_scores_gemma":[0.00019576648,0.8904395,0.10762429,0.0015132816,0.00006828964,0.0001313021,0.0000047288922,0.00002111517,0.0000017209153],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954861,0.00024857596,0.0009265233,0.0021375227,0.00042274903,0.0007785622],"domain_scores_gemma":[0.9968397,0.0006291239,0.0005052834,0.0016074958,0.00035390735,0.000064459],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012252313,0.00060790055,0.0020135199,0.002804068,0.00014964084,0.0002814237,0.0033020908,0.0005924037,0.000009254321],"category_scores_gemma":[0.0013020434,0.0005325425,0.0001365886,0.012167684,0.0011349166,0.0007334591,0.0024442351,0.0020237975,0.000016942511],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.526324e-7,0.000038957547,0.000011448097,0.0026597234,0.000012121887,0.00019514475,0.00015277087,0.0000087106955,0.0000030481485,0.0073737986,0.000027378312,0.9895166],"study_design_scores_gemma":[0.0006743241,0.00056252227,0.000043413387,0.16691674,0.0001862523,0.007949172,0.000005516578,0.012252252,0.00022872246,0.014814962,0.7936492,0.0027169227],"about_ca_topic_score_codex":0.000018021083,"about_ca_topic_score_gemma":0.000045831275,"teacher_disagreement_score":0.9867997,"about_ca_system_score_codex":0.00034165534,"about_ca_system_score_gemma":0.0010181703,"threshold_uncertainty_score":0.9997126},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9413142,0.0003463077,0.05382811,0.0017255741,0.0007479078,0.0009220833,0.0001324886,0.000027345575,0.00095597084],"genre_scores_gemma":[0.9790784,0.00007101091,0.020283846,0.0003535296,0.000033583477,0.000006165321,0.000043954515,0.000018288609,0.00011120026],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9983311,0.000020270983,0.00035894074,0.00060552853,0.00042420902,0.0002599503],"domain_scores_gemma":[0.9991278,0.00010872605,0.00009663402,0.00024364615,0.00030361372,0.00011954783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000724488,0.00021533263,0.0004555591,0.0008216756,0.00007049505,0.000030046516,0.00012961288,0.000148385,0.000021289892],"category_scores_gemma":[0.000079652746,0.00020825563,0.000100615296,0.00027638578,0.00020861579,0.000084354215,0.00014202906,0.00029582076,0.0000017529986],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004223359,0.00020921127,0.074929945,0.002617988,0.0000999633,0.00033391843,0.07300178,0.0070569725,0.0048789605,0.00052706606,0.000014801754,0.83590704],"study_design_scores_gemma":[0.024662977,0.010419347,0.85366344,0.043239214,0.0003832237,0.00031946407,0.00117951,0.003964497,0.047742985,0.0014956358,0.008239398,0.0046902937],"about_ca_topic_score_codex":0.000018977817,"about_ca_topic_score_gemma":0.00030453913,"teacher_disagreement_score":0.83121675,"about_ca_system_score_codex":0.00037090262,"about_ca_system_score_gemma":0.0004801712,"threshold_uncertainty_score":0.84924185},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018875448,0.000718663,0.9718957,0.0013159935,0.0037273734,0.00049536844,0.000033285178,0.00027473088,0.002663425],"genre_scores_gemma":[0.83482134,0.00026165502,0.13267381,0.0030554126,0.00074383966,0.000059788414,0.000020068204,0.00006498441,0.028299084],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993487,0.00008708141,0.0010199678,0.0022249578,0.0025262926,0.00065470126],"domain_scores_gemma":[0.99554324,0.00077973306,0.00046451998,0.0022870542,0.00070682634,0.00021862854],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020208608,0.0005719098,0.00084365933,0.0012407304,0.00038051835,0.00080583355,0.0036770215,0.0008414689,0.0011096577],"category_scores_gemma":[0.00055404333,0.0003858245,0.00027661497,0.0010526095,0.0015568599,0.00021437064,0.0018574768,0.0014409712,0.00021015252],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011261029,0.000074435266,0.0044009993,0.000009939387,0.000008848767,0.000244723,0.0005423412,0.0016533125,0.00016860734,0.0087269675,0.00008859955,0.98406994],"study_design_scores_gemma":[0.00095427677,0.0006119271,0.02273537,0.00067568803,0.000051015744,0.0004017636,0.000015545185,0.02086092,0.002058389,0.86909336,0.080200106,0.0023416372],"about_ca_topic_score_codex":0.000015046752,"about_ca_topic_score_gemma":0.00046377882,"teacher_disagreement_score":0.9817283,"about_ca_system_score_codex":0.00023882007,"about_ca_system_score_gemma":0.0005909429,"threshold_uncertainty_score":0.9998594},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048259193,0.0002753367,0.99081534,0.00041684252,0.0062631187,0.00065100746,0.0000128913525,0.00016846193,0.0013487206],"genre_scores_gemma":[0.010991931,0.000035937974,0.9867649,0.00088534824,0.0008970559,0.000094294315,0.0000128227,0.000043973792,0.0002737279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957708,0.000092808536,0.00069014065,0.001801703,0.0009209265,0.00072362367],"domain_scores_gemma":[0.9958285,0.0013256231,0.00049274374,0.0015899844,0.000609464,0.00015368189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022315215,0.0005039295,0.00058175105,0.00063159945,0.00046238938,0.0009116868,0.0024613484,0.00039725265,0.000033428936],"category_scores_gemma":[0.0010945905,0.00050928,0.00021111257,0.000605991,0.0004900546,0.0009646482,0.00073450326,0.0005437701,0.00002299491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024027777,0.000027916507,0.000012524476,0.00009933509,0.000028577862,0.000018579733,0.0005319452,0.005730994,0.0006024492,0.35626844,0.000097845834,0.6365574],"study_design_scores_gemma":[0.00035701177,0.00032432735,0.00008586821,0.00091550016,0.000052230975,0.00012321195,8.682759e-7,0.69594973,0.021560954,0.2613383,0.018132554,0.0011594663],"about_ca_topic_score_codex":0.000013589556,"about_ca_topic_score_gemma":0.000021520276,"teacher_disagreement_score":0.69021875,"about_ca_system_score_codex":0.0006475075,"about_ca_system_score_gemma":0.0007117408,"threshold_uncertainty_score":0.9997359},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035982344,0.0010200915,0.95919013,0.0006598913,0.0013394075,0.001449755,0.000016933649,0.00014230509,0.00019915237],"genre_scores_gemma":[0.9315762,0.0001439239,0.06687836,0.0004835935,0.0002348136,0.00011311326,0.000009940751,0.00003858832,0.0005214717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957629,0.000044214732,0.00079988746,0.0013719468,0.0011158822,0.0009051662],"domain_scores_gemma":[0.99760276,0.00031749447,0.0006888901,0.00068018684,0.0005332775,0.00017741743],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014575773,0.00040647242,0.0007304751,0.00055516214,0.00051101093,0.0000950711,0.0014031348,0.00047716973,0.000027673537],"category_scores_gemma":[0.0002695924,0.00040412258,0.00018027179,0.0005070056,0.0027916976,0.00029635284,0.00038497365,0.00053322164,0.0000012034876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029040637,0.00013163044,0.00028252386,0.00022879381,0.00003373077,0.000011235317,0.26928568,0.015227329,0.000071999064,0.008829566,0.000032488657,0.705836],"study_design_scores_gemma":[0.002128917,0.00090959005,0.00024645898,0.0057651703,0.00004162124,0.000005390598,0.001560439,0.95156306,0.0039344034,0.030490464,0.0014865574,0.0018679418],"about_ca_topic_score_codex":0.0004952572,"about_ca_topic_score_gemma":0.004294782,"teacher_disagreement_score":0.93633574,"about_ca_system_score_codex":0.00057390885,"about_ca_system_score_gemma":0.0021687348,"threshold_uncertainty_score":0.99992216},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038783534,0.0013372649,0.9525787,0.0049036336,0.014702174,0.002865786,0.00038237247,0.0001280404,0.019223658],"genre_scores_gemma":[0.95311606,0.000002882934,0.025555607,0.0115391845,0.0010227858,0.00035763776,0.00010195594,0.00008796405,0.008215917],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99653184,0.000040027433,0.00056176755,0.0013640636,0.0009278621,0.00057443493],"domain_scores_gemma":[0.9980305,0.00016287212,0.00023841979,0.00088210835,0.00043528373,0.000250862],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007757133,0.0003809188,0.00040550722,0.000628179,0.00013970802,0.00019414208,0.0007988063,0.0002825606,0.001079572],"category_scores_gemma":[0.00010893009,0.000401091,0.00015407497,0.00043217553,0.00026356467,0.00018588206,0.00049832487,0.0005504057,0.0005825625],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002603301,0.00039057713,0.00020109155,0.00009054261,0.00003718745,0.00010936199,0.0054752664,0.00023773148,0.00004788254,0.010583425,0.00045287583,0.982348],"study_design_scores_gemma":[0.016734121,0.019468213,0.104986124,0.041945208,0.0016735705,0.0044738227,0.00012276796,0.12415088,0.009643427,0.5911458,0.067645885,0.018010162],"about_ca_topic_score_codex":0.00017492063,"about_ca_topic_score_gemma":0.00025019355,"teacher_disagreement_score":0.9643379,"about_ca_system_score_codex":0.0006028181,"about_ca_system_score_gemma":0.00029596683,"threshold_uncertainty_score":0.9998441},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03506347,0.0016264094,0.95447963,0.004414821,0.002785481,0.0011372466,0.000003410429,0.00037950286,0.00011002563],"genre_scores_gemma":[0.455642,0.000029465265,0.54321784,0.0008115394,0.0002150763,0.000061193634,0.0000042254233,0.000018018382,6.2848386e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99189466,0.0008155624,0.0010022572,0.003398889,0.0015667821,0.0013218608],"domain_scores_gemma":[0.9931137,0.0021152277,0.00055107253,0.0034805203,0.0004501998,0.00028930538],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0061735893,0.00082025427,0.001112088,0.0005587236,0.00074822863,0.0042335065,0.0069235046,0.00038126588,0.000003984115],"category_scores_gemma":[0.0013893244,0.0006064064,0.00025099446,0.002892835,0.0025076682,0.00079515553,0.020433614,0.0023663298,0.0000031784587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014450699,0.00012183708,0.00083330064,0.00027485788,0.000030090836,0.00012662083,0.012616386,0.17303737,0.00006075326,0.005083202,0.0000052644464,0.8077959],"study_design_scores_gemma":[0.00061200163,0.00004207686,0.0011235083,0.000316194,0.000010572587,0.0002032434,0.0000066125845,0.8499961,0.0005654479,0.14652045,0.0000075758,0.0005962405],"about_ca_topic_score_codex":0.00021522284,"about_ca_topic_score_gemma":0.00007044036,"teacher_disagreement_score":0.80719966,"about_ca_system_score_codex":0.00035843,"about_ca_system_score_gemma":0.001030018,"threshold_uncertainty_score":0.99993527},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023117387,0.00030313552,0.9679654,0.011076622,0.0045868694,0.00039775058,0.000048685495,0.00027540608,0.013034346],"genre_scores_gemma":[0.85705924,0.00023449652,0.072718956,0.011480997,0.0010464403,0.00002778814,0.0000410269,0.000114944,0.05727613],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992962,0.00010441069,0.0011255629,0.0022236228,0.002883931,0.0007004819],"domain_scores_gemma":[0.9950746,0.0010233072,0.0005457741,0.0023605814,0.0007643463,0.00023136016],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031390267,0.0005613347,0.0008266284,0.0016974545,0.0003580925,0.0007296281,0.003579851,0.000774225,0.0018628119],"category_scores_gemma":[0.0010031158,0.0003828603,0.00026341673,0.0013668026,0.0015595749,0.00040584893,0.0015194198,0.0014396448,0.0005641001],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021328618,0.00011269401,0.0029675202,0.000017197284,0.000026393756,0.00082511106,0.00091762486,0.0032435684,0.000362164,0.015414475,0.003103022,0.9729889],"study_design_scores_gemma":[0.0014061239,0.0002888013,0.007627022,0.0010848019,0.000091247486,0.00042434072,0.000029805815,0.030780025,0.0045163557,0.5957195,0.3549319,0.0031000944],"about_ca_topic_score_codex":0.000032207987,"about_ca_topic_score_gemma":0.0006766024,"teacher_disagreement_score":0.9698888,"about_ca_system_score_codex":0.00028434783,"about_ca_system_score_gemma":0.00063319545,"threshold_uncertainty_score":0.9998623},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044144606,0.00026667054,0.96535176,0.0020540184,0.0008959918,0.00021627481,0.0000022552313,0.00014471759,0.031024158],"genre_scores_gemma":[0.19934495,0.00011292921,0.78065604,0.0016398147,0.000855517,0.00003946932,0.000016987471,0.00002127687,0.017313022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699694,0.000022492857,0.00029141593,0.001463285,0.00069161475,0.00053425616],"domain_scores_gemma":[0.9980145,0.00019147206,0.00018551224,0.0010981226,0.00039091893,0.00011947177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003951556,0.00039558072,0.00036789273,0.00032252682,0.0003655669,0.0004255333,0.002308636,0.00024056215,0.000086330525],"category_scores_gemma":[0.00008112025,0.0003170798,0.000084096486,0.00077237235,0.00066598196,0.00037761766,0.0012547895,0.0007010074,0.000023867871],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012762814,0.0001378119,0.0010943667,0.00023445993,0.00008432784,0.001566899,0.0020893267,0.133677,0.0005608795,0.10812657,0.0002081341,0.75220746],"study_design_scores_gemma":[0.0007757745,0.00073907163,0.00066206156,0.0019296155,0.00004284302,0.0019131511,0.0000030928702,0.5420141,0.011068024,0.38107184,0.056629352,0.0031510773],"about_ca_topic_score_codex":0.000030320432,"about_ca_topic_score_gemma":0.00012947715,"teacher_disagreement_score":0.7490564,"about_ca_system_score_codex":0.00012285994,"about_ca_system_score_gemma":0.0008157985,"threshold_uncertainty_score":0.9999281},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016465473,0.0011771589,0.9961968,0.0009741662,0.0006757187,0.00053293846,0.00001908282,0.00006146354,0.00019803912],"genre_scores_gemma":[0.0030477338,0.00046986842,0.9945306,0.0007776106,0.00021658099,0.000003973945,0.00004096798,0.000025029603,0.00088759285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976511,0.000020224268,0.00045932175,0.0009557757,0.00051611976,0.00039744],"domain_scores_gemma":[0.99811876,0.00034172248,0.00022729432,0.0006363863,0.0004852026,0.00019060861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004083076,0.0002957699,0.00046738365,0.0005555934,0.0001120655,0.00018192882,0.0012737776,0.00019114502,0.000011804232],"category_scores_gemma":[0.00013056435,0.0002762909,0.000085874315,0.00073491223,0.00033709733,0.00036237147,0.0009342629,0.00038396838,9.072699e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018692925,0.00017764224,0.00014153987,0.00038816687,0.000038229307,0.000028107483,0.0012107075,0.21550429,0.00040779103,0.028736774,0.000092231945,0.75325584],"study_design_scores_gemma":[0.0006993997,0.000542445,0.00013547068,0.00083755405,0.000011155588,0.000034688353,5.667685e-7,0.92379534,0.00036081925,0.06893784,0.004162816,0.0004819191],"about_ca_topic_score_codex":0.000030164043,"about_ca_topic_score_gemma":0.00020220052,"teacher_disagreement_score":0.7527739,"about_ca_system_score_codex":0.00006740643,"about_ca_system_score_gemma":0.00097023655,"threshold_uncertainty_score":0.99996895},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99274343,0.0013884262,0.0034216128,0.0006235236,0.00028139065,0.0014065811,0.00004865642,0.000045851313,0.000040506842],"genre_scores_gemma":[0.99891824,0.0002321529,0.0006040906,0.00011302408,0.00004291857,0.000018551184,0.0000037953766,0.00002114464,0.00004606412],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99537945,0.00038068567,0.0010399368,0.0010799292,0.0013023235,0.00081765105],"domain_scores_gemma":[0.99679464,0.0014879651,0.000616706,0.000666964,0.00029306486,0.00014063332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013101936,0.00044000597,0.0009719342,0.0008368021,0.00025290364,0.00018213043,0.001679429,0.00033769212,0.0000043063606],"category_scores_gemma":[0.0021525952,0.00031982246,0.00010418347,0.0008833834,0.001470348,0.0002018074,0.00076425506,0.0008363114,0.0000010271993],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015858306,0.0035100016,0.23305237,0.00033078538,0.00012239181,0.0001664639,0.2320157,0.10568405,0.00051877036,0.0034773326,0.000012455943,0.41952384],"study_design_scores_gemma":[0.0023354553,0.0036716254,0.9665296,0.011754143,0.000012795888,0.000006379404,0.002835362,0.005243522,0.001294896,0.0052616517,0.000012622268,0.0010419645],"about_ca_topic_score_codex":0.0012399257,"about_ca_topic_score_gemma":0.014697286,"teacher_disagreement_score":0.73347723,"about_ca_system_score_codex":0.00042925376,"about_ca_system_score_gemma":0.00049704354,"threshold_uncertainty_score":0.9999254},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032181165,0.00018722631,0.99287355,0.0008412775,0.001407752,0.0011028574,0.00003272924,0.00009160929,0.0031411748],"genre_scores_gemma":[0.08387139,0.0000018340608,0.9114638,0.00089179585,0.00043534953,0.00007930849,0.000012321209,0.000055041186,0.0031891908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931664,0.00013254964,0.0010480762,0.0022522933,0.0027560964,0.0006445868],"domain_scores_gemma":[0.9886002,0.007890212,0.00068696146,0.0016289116,0.0009874671,0.00020624229],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.009092901,0.0004896464,0.0007469706,0.001329345,0.00038118774,0.00071824505,0.0028465078,0.00041418363,0.00009209878],"category_scores_gemma":[0.008617545,0.00040974814,0.0002976602,0.0010724901,0.0006439831,0.00032465465,0.00046735737,0.0006399516,0.000008664802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029847093,0.00000921313,0.00021688962,0.000030726453,0.000006152141,0.0000067268356,0.0003702153,0.20340149,0.00014250226,0.0018824326,0.00014986347,0.7937539],"study_design_scores_gemma":[0.00023517618,0.000078557016,0.00009804795,0.00025490002,0.000012322711,0.000012111988,1.9911849e-7,0.7546834,0.0005545607,0.24341497,0.00032662312,0.0003291855],"about_ca_topic_score_codex":0.0000035885546,"about_ca_topic_score_gemma":0.000039015275,"teacher_disagreement_score":0.7934248,"about_ca_system_score_codex":0.00039394083,"about_ca_system_score_gemma":0.00184967,"threshold_uncertainty_score":0.99983543},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046354497,0.0002571888,0.9903704,0.0019558333,0.00259679,0.00048819554,0.0000067169167,0.00017126735,0.004107252],"genre_scores_gemma":[0.1346126,0.000077862715,0.858398,0.004111876,0.0015773503,0.000010675036,0.00007009323,0.000038498878,0.0011030363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578667,0.000058224294,0.00051677454,0.0022624915,0.00080406707,0.000571771],"domain_scores_gemma":[0.99451935,0.00038241272,0.00031535554,0.0044513713,0.00019194609,0.0001395499],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013052637,0.00045817337,0.000596601,0.00044189097,0.00023196262,0.0020022246,0.019791462,0.00033680085,0.000022912775],"category_scores_gemma":[0.0002199868,0.00039395166,0.00006238611,0.00035942628,0.0005227885,0.0015219428,0.013376194,0.0005839312,0.000110551024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026937353,0.00001724804,0.000042168936,0.000018331282,0.000012945249,0.00005739008,0.0004026562,0.012575094,0.00019568187,0.057768345,0.0004566085,0.9284508],"study_design_scores_gemma":[0.0002415369,0.00010575318,0.00013151103,0.00014673147,0.000007986191,0.00004500171,6.0691015e-8,0.9247051,0.00024636724,0.062421683,0.011420566,0.0005277041],"about_ca_topic_score_codex":0.000072335766,"about_ca_topic_score_gemma":0.0004363296,"teacher_disagreement_score":0.92792314,"about_ca_system_score_codex":0.00013924166,"about_ca_system_score_gemma":0.0006226146,"threshold_uncertainty_score":0.9998512},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001303484,0.00017385495,0.9924914,0.00012070486,0.0033853727,0.00072585855,0.0000028031013,0.00017652953,0.0016199887],"genre_scores_gemma":[0.21658301,0.000013362844,0.78212476,0.000066163506,0.0005566721,0.0000169722,0.000025938172,0.00007161432,0.00054148684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980542,0.00006416244,0.00038807534,0.0008221173,0.0003840503,0.0002874134],"domain_scores_gemma":[0.99827826,0.0005815943,0.00011797568,0.00071124284,0.00024405491,0.00006689927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010215202,0.0003303512,0.00038928422,0.00033991924,0.00016828382,0.00016890872,0.00025540506,0.0002000767,0.000015085562],"category_scores_gemma":[0.00012741303,0.00033402303,0.000092243055,0.00025725944,0.00015794905,0.00019013503,0.000066152905,0.00055792974,0.000011568701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019449633,0.000092409144,0.0000052259925,0.00006684499,0.000033291697,0.000010966504,0.0003767808,0.41871083,0.05032949,0.0005441379,0.00006766079,0.5297429],"study_design_scores_gemma":[0.0003280166,0.00016083832,0.0004843219,0.00029794686,0.000038125465,0.00007557839,0.0000024178999,0.9315398,0.050456513,0.013029791,0.003042355,0.0005443249],"about_ca_topic_score_codex":0.000006783199,"about_ca_topic_score_gemma":0.0000103848,"teacher_disagreement_score":0.5291986,"about_ca_system_score_codex":0.00051606685,"about_ca_system_score_gemma":0.00010252161,"threshold_uncertainty_score":0.9999112},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057723247,0.00025045508,0.93607837,0.0006247017,0.0038939253,0.0012591347,0.000026900518,0.00014059643,0.0000026734774],"genre_scores_gemma":[0.5202173,0.000055616085,0.47896853,0.00033424393,0.00013312753,0.00009228917,0.00018634358,0.000012283589,2.654061e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565524,0.00021192491,0.00065135886,0.0020210487,0.000888264,0.0005721383],"domain_scores_gemma":[0.9972639,0.00052732293,0.00043002635,0.001382153,0.00029833155,0.00009827249],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018919825,0.00038033663,0.0004214589,0.0009032589,0.00019217274,0.0009940473,0.002158131,0.00030361992,0.00000296164],"category_scores_gemma":[0.00036540997,0.00040013425,0.00008951361,0.0025243592,0.00018167408,0.0012022605,0.0019564105,0.0006820964,0.0000029701212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008459454,0.000039111408,0.0010475173,0.000063171894,0.0000045303773,0.000014301706,0.0010660643,0.52641994,0.00088729203,0.000017384333,0.00000998032,0.47042224],"study_design_scores_gemma":[0.00043066454,0.0000911766,0.00530107,0.00046713682,0.0000066570497,0.000017620967,0.0000031824995,0.9549582,0.03207142,0.006231496,0.000020359144,0.00040100556],"about_ca_topic_score_codex":0.0005779295,"about_ca_topic_score_gemma":0.001288679,"teacher_disagreement_score":0.47002125,"about_ca_system_score_codex":0.0011018339,"about_ca_system_score_gemma":0.001100669,"threshold_uncertainty_score":0.999845},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013789396,0.001469329,0.9870942,0.00010589427,0.00078289147,0.00013385202,0.000017227754,0.000030854586,0.00898676],"genre_scores_gemma":[0.98269236,0.000022626467,0.016423266,0.00021520464,0.00018511442,0.0000020333298,0.00000516584,0.000016000551,0.00043822505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998585,0.000008808337,0.00036353897,0.00071801303,0.00007777671,0.0002469033],"domain_scores_gemma":[0.99925506,0.000095472205,0.00024513944,0.0003098118,0.00004031382,0.000054229582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053704495,0.00022465675,0.00041215445,0.00016654629,0.00011428305,0.00019380201,0.00028468814,0.00017420221,0.000030647854],"category_scores_gemma":[0.000030547937,0.0002212121,0.00004125008,0.0001783416,0.00042807095,0.0001632813,0.00019167883,0.00026405178,0.000029528763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004195574,0.00002475763,0.012546809,0.00020538257,0.00004313837,0.00010822452,0.001113052,0.20639312,0.000003737508,0.5018398,0.0000062199297,0.27767378],"study_design_scores_gemma":[0.00041703097,0.000180074,0.0021247289,0.00081119506,0.0000064018523,0.00023541068,0.0000020400407,0.78656197,0.000018317587,0.20786873,0.0011732707,0.00060086086],"about_ca_topic_score_codex":0.000050689614,"about_ca_topic_score_gemma":0.00020463149,"teacher_disagreement_score":0.9813134,"about_ca_system_score_codex":0.0001658962,"about_ca_system_score_gemma":0.000052992367,"threshold_uncertainty_score":0.9020768},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06004946,0.0002049363,0.93527883,0.0030162043,0.00080978585,0.00046354954,0.0000053680783,0.00009378524,0.000078095974],"genre_scores_gemma":[0.59983367,0.00003362457,0.39842626,0.0015665105,0.000088582055,0.000028060536,0.000012828576,0.000009262475,0.0000011586511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952579,0.00045518272,0.00056175306,0.0016663125,0.0013093825,0.0007494465],"domain_scores_gemma":[0.9965183,0.0008740534,0.00020478675,0.0019999603,0.0002770948,0.00012578716],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021359941,0.00038843456,0.00042035515,0.00046244694,0.00027606398,0.002405589,0.007131781,0.00025410595,0.00001085749],"category_scores_gemma":[0.00022782436,0.00029978922,0.0001029312,0.0027242478,0.00033512636,0.00067753624,0.0051866346,0.0017761936,0.000006500391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012193716,0.00006436087,0.0006817202,0.000018829565,0.0000029245032,0.00003373069,0.009714715,0.88682294,0.00015745328,0.00039720815,0.000003932076,0.10210095],"study_design_scores_gemma":[0.00020862135,0.000020895459,0.0008559962,0.00028783933,0.0000022623813,0.0000057763145,0.000007479051,0.9663175,0.00083550403,0.031107577,0.0000047460394,0.0003458034],"about_ca_topic_score_codex":0.00053719885,"about_ca_topic_score_gemma":0.00065696373,"teacher_disagreement_score":0.53978425,"about_ca_system_score_codex":0.00016804635,"about_ca_system_score_gemma":0.0012207525,"threshold_uncertainty_score":0.9999454},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052932295,0.00036961434,0.985951,0.0021609506,0.0016772698,0.0004799833,0.0000021889641,0.000091758506,0.008737926],"genre_scores_gemma":[0.2646533,0.000049921677,0.73169374,0.0023412644,0.0003146862,0.000036045956,0.0000027256078,0.000050749983,0.0008575553],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951353,0.00030749093,0.00084545417,0.0017662381,0.0012084334,0.00073707843],"domain_scores_gemma":[0.99064213,0.0048130713,0.00045193062,0.003251051,0.0006959773,0.00014582713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0041082045,0.0005717839,0.0007671275,0.0005345386,0.00036400466,0.00041123247,0.0052256295,0.00032694772,0.000080850055],"category_scores_gemma":[0.0013467225,0.0004168595,0.00027146927,0.0014095702,0.0012367696,0.0004909822,0.0018068874,0.0010567189,0.000025800071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006977897,0.0000462735,0.000012027282,0.000033577206,0.00001007873,0.000054120865,0.0010236655,0.016490532,0.0006050612,0.39751944,0.000015648766,0.5841826],"study_design_scores_gemma":[0.00006413291,0.00018787384,0.000048820635,0.00030313988,0.0000076273927,0.000027905198,0.0000022453478,0.23260607,0.09109135,0.6745309,0.0006563635,0.0004735561],"about_ca_topic_score_codex":0.00006494448,"about_ca_topic_score_gemma":0.00022167404,"teacher_disagreement_score":0.58370906,"about_ca_system_score_codex":0.00032398236,"about_ca_system_score_gemma":0.00086971954,"threshold_uncertainty_score":0.99982834},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004152713,0.0004640158,0.99604416,0.00087617215,0.00082123006,0.00058726524,0.000073554824,0.00013462291,0.0005836938],"genre_scores_gemma":[0.071699984,0.000075328346,0.9249966,0.0011664319,0.00050134177,0.00003995021,0.000107585285,0.00006160677,0.0013511428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963552,0.000029844945,0.00038781736,0.0017362143,0.0008876384,0.00060333335],"domain_scores_gemma":[0.99675155,0.00051299605,0.00036066264,0.001302617,0.00085149345,0.00022067523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031871255,0.00050520396,0.00052209315,0.000462707,0.00046476268,0.0007673258,0.0024443436,0.0002474326,0.000025235277],"category_scores_gemma":[0.000127019,0.00041954766,0.000115906754,0.000617546,0.00031681714,0.0009977961,0.0014098427,0.000562395,0.000018776343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007663533,0.00019858852,0.0002639693,0.00021114573,0.0000843387,0.00061261194,0.0022133011,0.13090287,0.00031024855,0.041776285,0.0002839815,0.823066],"study_design_scores_gemma":[0.0011482162,0.00045995347,0.0004864276,0.0012949841,0.00002598342,0.00019873363,0.000006154479,0.97086155,0.001024014,0.015875563,0.0076064253,0.0010120193],"about_ca_topic_score_codex":0.00011048941,"about_ca_topic_score_gemma":0.0003428464,"teacher_disagreement_score":0.83995867,"about_ca_system_score_codex":0.00026808403,"about_ca_system_score_gemma":0.00091602275,"threshold_uncertainty_score":0.99982566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063015083,0.0005399754,0.9886278,0.0015333504,0.0020151779,0.00075353106,0.000014719472,0.00020013517,0.000013793911],"genre_scores_gemma":[0.6536185,0.00001368086,0.34591568,0.00016291461,0.00013109217,0.00013248256,0.0000080683285,0.00001625724,0.0000012992488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553823,0.0003430291,0.0007142213,0.0018545263,0.00093840674,0.00061157387],"domain_scores_gemma":[0.993905,0.0032093972,0.0008205717,0.0011993895,0.0007522706,0.00011333664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002266915,0.00044878782,0.0006730263,0.00046098605,0.00028108744,0.0007336567,0.002431647,0.00034407314,0.0000043145924],"category_scores_gemma":[0.0023334802,0.00046213844,0.00021958169,0.0013128233,0.00063763786,0.0005783132,0.0009636924,0.00082510797,7.8837235e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027385915,0.00007793499,0.00029315334,0.00025907037,0.000019170908,0.000009175722,0.0005107163,0.54919654,0.016161378,0.000043084085,0.00003898762,0.4333634],"study_design_scores_gemma":[0.00018567973,0.00013272229,0.00039429622,0.00058369176,0.000012387216,0.000006085965,0.0000018741055,0.6495067,0.34699023,0.001850169,0.00002080616,0.00031537868],"about_ca_topic_score_codex":0.00019252664,"about_ca_topic_score_gemma":0.000084420775,"teacher_disagreement_score":0.647317,"about_ca_system_score_codex":0.0005246678,"about_ca_system_score_gemma":0.0015525259,"threshold_uncertainty_score":0.99978304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005505302,0.0003733166,0.9904748,0.00343133,0.002109995,0.00033780537,0.0000031528493,0.000035587032,0.0026834423],"genre_scores_gemma":[0.9023873,0.000040530795,0.088082634,0.0058857924,0.0008254622,0.000021717064,0.00000820331,0.00003438686,0.0027139722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733657,0.000086583605,0.00043346648,0.0008576803,0.0009622993,0.00032338177],"domain_scores_gemma":[0.9969932,0.0008197391,0.00035540792,0.001421323,0.0003541199,0.000056253968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009851068,0.00032565065,0.0003065473,0.0003340977,0.0004774303,0.00047373713,0.00281779,0.00015028728,0.000022204162],"category_scores_gemma":[0.00017805365,0.00019316663,0.00021783555,0.001133214,0.0005280918,0.00024957486,0.0010113231,0.0006382308,0.0000049819255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064573173,0.00004802544,0.000023863444,0.000025429632,0.000040582752,0.00001019157,0.0011672354,0.26471803,0.0041326964,0.4432316,0.00008728929,0.28650856],"study_design_scores_gemma":[0.00018634403,0.00014992384,0.00044415818,0.0003298176,0.000014930061,0.000035250454,6.2002687e-7,0.7832732,0.024312304,0.18930458,0.0015339686,0.00041487298],"about_ca_topic_score_codex":0.000009527206,"about_ca_topic_score_gemma":0.00003221705,"teacher_disagreement_score":0.9023922,"about_ca_system_score_codex":0.00010172077,"about_ca_system_score_gemma":0.00074122386,"threshold_uncertainty_score":0.78771067},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009540479,0.0012703886,0.9799912,0.006613729,0.0021676489,0.00017311286,0.00001559615,0.0001536821,0.000074179094],"genre_scores_gemma":[0.5892488,0.00014310723,0.4088973,0.0012959308,0.00036705783,0.000018628602,0.000014288771,0.0000111544705,0.0000037578025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953949,0.00029598872,0.00045765875,0.0020527402,0.0010417731,0.0007569813],"domain_scores_gemma":[0.9950984,0.00077780423,0.0002479323,0.0035167402,0.00019966725,0.00015944694],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015168024,0.00043659072,0.000503761,0.0004479667,0.0004272021,0.0029221459,0.009344541,0.00017935524,0.000014501151],"category_scores_gemma":[0.00028221295,0.000304958,0.00023626194,0.0026621902,0.00069589354,0.00051340857,0.0113355,0.0015101985,0.00002882425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024635558,0.00011150922,0.0023228214,0.0000971037,0.00005281229,0.00020906125,0.0060172654,0.30631396,0.0009474295,0.0006369844,0.00042726085,0.6828613],"study_design_scores_gemma":[0.00010726915,0.000029914396,0.0012528126,0.00038801538,0.000013448128,0.000043088672,0.0000029753626,0.9872886,0.001045728,0.008869788,0.0005311954,0.00042719257],"about_ca_topic_score_codex":0.00020255441,"about_ca_topic_score_gemma":0.0008980446,"teacher_disagreement_score":0.68243414,"about_ca_system_score_codex":0.00013422365,"about_ca_system_score_gemma":0.0013710111,"threshold_uncertainty_score":0.9999403},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033600058,0.00047563264,0.9910609,0.00096097996,0.0058771637,0.0006239999,0.000016126487,0.00020250393,0.00044667115],"genre_scores_gemma":[0.17179975,0.000020751197,0.82408446,0.0017608803,0.0019396322,0.000025896907,0.000018707417,0.000050785216,0.00029914503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963835,0.00006691774,0.0006641023,0.0015158121,0.00063947827,0.0007301959],"domain_scores_gemma":[0.99710345,0.0010792466,0.000397876,0.0009059737,0.00037194428,0.00014152634],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012211249,0.0005669465,0.00053820555,0.0005988778,0.00093772897,0.0012318878,0.0019388866,0.0002475526,0.000008083501],"category_scores_gemma":[0.000107679574,0.00045186677,0.00026845903,0.0006201203,0.00045868332,0.0005969194,0.0017202509,0.00072734157,0.000006866643],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002710936,0.000015264886,0.0000011081148,0.000027665146,0.000020743328,0.00027475297,0.0020502128,0.014663262,0.000057961006,0.015803728,0.00001666172,0.96706593],"study_design_scores_gemma":[0.00034373562,0.00012321668,0.000021208869,0.00024587,0.000015646297,0.0016778148,0.0000049363757,0.9210378,0.0009322945,0.0742916,0.000780844,0.00052503665],"about_ca_topic_score_codex":0.00018174622,"about_ca_topic_score_gemma":0.00019492979,"teacher_disagreement_score":0.9665409,"about_ca_system_score_codex":0.00048352656,"about_ca_system_score_gemma":0.00053215295,"threshold_uncertainty_score":0.9998049},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009730086,0.0003911545,0.9875128,0.00013830577,0.0009996196,0.0003171363,0.0000041483604,0.000012951257,0.000893801],"genre_scores_gemma":[0.9341383,0.00002049354,0.06519097,0.00041576198,0.00016757383,0.000004979949,0.000009555709,0.000019171055,0.000033219865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583745,0.00025063643,0.0006434142,0.0012332331,0.0015613486,0.0004739165],"domain_scores_gemma":[0.9975587,0.0003414843,0.00041556716,0.0005138378,0.0010874161,0.0000829577],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024971091,0.00035857945,0.00054475677,0.0012106888,0.00013586503,0.00016507815,0.0011522734,0.00025483873,0.00005196075],"category_scores_gemma":[0.00040844717,0.00035616453,0.00016073122,0.0015363285,0.00022728342,0.00085198175,0.0006756729,0.0007049934,0.000005247485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026134147,0.00016292346,0.002061758,0.0000631207,0.000048876558,0.000055971166,0.0026416623,0.86208045,0.013995301,0.0045593847,0.000017919165,0.11428652],"study_design_scores_gemma":[0.00027635053,0.000101393205,0.0024243165,0.0002703687,0.000023881768,0.00003802188,0.0000018333689,0.9621476,0.021554021,0.012772647,0.000047442398,0.00034214623],"about_ca_topic_score_codex":0.00012695954,"about_ca_topic_score_gemma":0.00012706988,"teacher_disagreement_score":0.9244082,"about_ca_system_score_codex":0.0012327319,"about_ca_system_score_gemma":0.001447213,"threshold_uncertainty_score":0.999889},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014281773,0.0007388994,0.9943033,0.0004280733,0.0012068806,0.00028428424,0.0000072323487,0.00002503665,0.0015781344],"genre_scores_gemma":[0.455964,0.000012896681,0.54291683,0.00086223375,0.00011295466,0.000004396666,0.00001335308,0.000022800445,0.00009053486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668133,0.00012726699,0.0006657868,0.0013527422,0.00070611143,0.00046673106],"domain_scores_gemma":[0.99667937,0.00096410123,0.0005192276,0.0010383502,0.00066377793,0.00013519434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079920894,0.00046869216,0.0008104768,0.000594426,0.00021087355,0.00036210995,0.0016986959,0.00027858745,0.00002336894],"category_scores_gemma":[0.00015074057,0.0004490831,0.00017598722,0.000547717,0.0006940305,0.0005229034,0.0010852696,0.0007799988,0.000006286255],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051752588,0.00019343909,0.00077464094,0.0003158228,0.00006967452,0.00010257585,0.0034897258,0.046830285,0.06027225,0.0415509,0.000041435047,0.8463075],"study_design_scores_gemma":[0.0004241775,0.00028541635,0.00067422923,0.001199795,0.000021469905,0.000029191162,0.0000027136423,0.6635029,0.31710953,0.015519237,0.00057977065,0.0006516405],"about_ca_topic_score_codex":0.000045932884,"about_ca_topic_score_gemma":0.000020978863,"teacher_disagreement_score":0.84565586,"about_ca_system_score_codex":0.00019599259,"about_ca_system_score_gemma":0.0005531801,"threshold_uncertainty_score":0.9997961},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018034193,0.002233889,0.989081,0.004217238,0.0004949765,0.00042511322,0.0000051729144,0.00005883916,0.0016803476],"genre_scores_gemma":[0.88378316,0.0005656336,0.11141523,0.0037409395,0.00015070626,0.000017868524,0.0000053255776,0.000029383424,0.0002917716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964485,0.000051255447,0.00061651994,0.0015383069,0.00062054454,0.0007248462],"domain_scores_gemma":[0.99774975,0.0003425771,0.0002380131,0.0012667795,0.00012268516,0.00028018208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008645913,0.0004650137,0.0006577093,0.0007294676,0.00017657151,0.00073324423,0.00184146,0.00022164488,0.000013028138],"category_scores_gemma":[0.000089912566,0.00042251594,0.0000680624,0.0007020455,0.00060518825,0.00052225636,0.0015890765,0.0007646257,0.000018813807],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026030486,0.000046729092,0.000081085826,0.000092617025,0.0000068264067,0.000041086594,0.002688815,0.0021240835,0.0001376211,0.014221419,0.000031720418,0.9805254],"study_design_scores_gemma":[0.0012011386,0.0012781165,0.01016254,0.004940765,0.000015138066,0.0003581157,0.000007190216,0.6832459,0.0032944744,0.28382498,0.009052053,0.0026195883],"about_ca_topic_score_codex":0.00016481976,"about_ca_topic_score_gemma":0.0006466944,"teacher_disagreement_score":0.9779058,"about_ca_system_score_codex":0.00032914281,"about_ca_system_score_gemma":0.00076562044,"threshold_uncertainty_score":0.9998227},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75329363,0.0006466782,0.22974958,0.0009531074,0.0027510384,0.0015040379,0.0000040916843,0.000096062526,0.011001754],"genre_scores_gemma":[0.96486056,0.00008414671,0.034470603,0.000040945783,0.00027286797,0.000053824257,0.00000491602,0.000010149989,0.00020196082],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968556,0.0005361329,0.0005499552,0.00075462676,0.00096859573,0.0003350863],"domain_scores_gemma":[0.99768305,0.00068140944,0.00046869993,0.0003266967,0.0007551142,0.000085020605],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019782088,0.00022993742,0.00042834957,0.0001145248,0.00079831085,0.00025854973,0.00052246347,0.0002116944,0.00019305098],"category_scores_gemma":[0.00085283915,0.00018508284,0.00008519936,0.00069610163,0.0054361145,0.0003838235,0.00026052733,0.00064087356,4.0310783e-7],"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.00001951698,0.00027190475,0.012668037,0.00009189161,0.000022408503,0.000002415273,0.82688975,0.005130488,0.0002819636,0.013492873,0.0000066590765,0.1411221],"study_design_scores_gemma":[0.00706605,0.018949056,0.11861275,0.011973368,0.00072400563,0.00008421606,0.2162046,0.09056641,0.06718702,0.29630387,0.15906723,0.013261418],"about_ca_topic_score_codex":0.00069088716,"about_ca_topic_score_gemma":0.0004032467,"teacher_disagreement_score":0.61068517,"about_ca_system_score_codex":0.00024758998,"about_ca_system_score_gemma":0.0019251833,"threshold_uncertainty_score":0.9972705},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024623002,0.00038604194,0.99075365,0.0010791376,0.0029599715,0.00060462655,0.00002092032,0.00004587291,0.003903536],"genre_scores_gemma":[0.4757284,0.00009415887,0.5012554,0.014182538,0.0024246057,0.000093551396,0.00013911637,0.00020080636,0.005881431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954832,0.00005474935,0.0005826489,0.002113318,0.00087552855,0.0008905108],"domain_scores_gemma":[0.99616385,0.0013984154,0.00030556537,0.0013361606,0.0005975776,0.00019845567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007699986,0.0006904838,0.0006806441,0.00076232466,0.00048126362,0.0008413526,0.0023961638,0.00027687312,0.000052625033],"category_scores_gemma":[0.00029676143,0.0006513174,0.0003212132,0.00044966818,0.00031786563,0.00080450345,0.0010651222,0.00084359717,0.000058183545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021023884,0.00032228473,0.00009926463,0.00034998567,0.00016991174,0.0006051978,0.0055090655,0.12786604,0.032427564,0.04161142,0.0021175235,0.7887115],"study_design_scores_gemma":[0.0010432173,0.00067075854,0.00019009328,0.0028023284,0.00003585792,0.00012612209,0.0000021319925,0.88666075,0.06551134,0.03192012,0.009386824,0.0016504591],"about_ca_topic_score_codex":0.000019338053,"about_ca_topic_score_gemma":0.000027676768,"teacher_disagreement_score":0.78706104,"about_ca_system_score_codex":0.0004470284,"about_ca_system_score_gemma":0.00053626567,"threshold_uncertainty_score":0.9995938},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015094242,0.0009624532,0.99370825,0.0016663522,0.0010054008,0.0006699331,0.000023287475,0.000100798585,0.00035410508],"genre_scores_gemma":[0.58388054,0.00004146148,0.4152309,0.00043099088,0.00033601405,0.000017388556,0.000005911925,0.00002413053,0.000032677246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640566,0.00022575032,0.00067751564,0.0014475544,0.00069323624,0.00055027206],"domain_scores_gemma":[0.9955205,0.0020621063,0.0004469456,0.0014023931,0.00039429712,0.00017376],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024565016,0.00048727042,0.000797223,0.00025604575,0.0007188064,0.0010694368,0.001626844,0.00029266658,0.0000060771954],"category_scores_gemma":[0.00027543367,0.0003737774,0.000096967015,0.00036018013,0.001968033,0.00073000434,0.0009119849,0.00094697106,0.0000022726113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021335725,0.000025981193,0.0014435154,0.00011412116,0.00006280267,0.000038656854,0.00069125515,0.023436237,0.0007065365,0.048666235,0.0000031030518,0.9247902],"study_design_scores_gemma":[0.00080729,0.00011115083,0.013133595,0.00026235433,0.000062793675,0.00022998377,0.0000016598225,0.91683125,0.00054945674,0.06674525,0.0005000738,0.0007651364],"about_ca_topic_score_codex":0.00005082168,"about_ca_topic_score_gemma":0.00005900782,"teacher_disagreement_score":0.92402506,"about_ca_system_score_codex":0.00015638227,"about_ca_system_score_gemma":0.00024216004,"threshold_uncertainty_score":0.9999676},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065050493,0.00033573754,0.9878403,0.0018726828,0.0015730404,0.0003072809,0.0000082554125,0.000020316746,0.0015373242],"genre_scores_gemma":[0.9646669,0.000019666537,0.033053033,0.001796525,0.00013367493,0.0000051158418,0.0000024787983,0.000010919363,0.00031169047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972371,0.000102607606,0.0005240526,0.00073414383,0.001125897,0.00027621404],"domain_scores_gemma":[0.99588734,0.0018177496,0.0004450734,0.001331615,0.00045874075,0.00005950443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008931444,0.00029152905,0.00041191338,0.0005503483,0.0002236183,0.000158525,0.0028014819,0.00016659846,0.000045977846],"category_scores_gemma":[0.00051693636,0.00017725979,0.00021396992,0.0019729116,0.00087382976,0.00015701745,0.0010332648,0.0006254623,0.000006523366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010491973,0.00011238816,0.00012863653,0.000057450026,0.000038578215,0.000011289964,0.0010094347,0.21182781,0.0011686343,0.61037296,0.00013833198,0.17512402],"study_design_scores_gemma":[0.00031513945,0.00033598518,0.0019492077,0.0007380049,0.00002343978,0.000065656364,0.0000012802954,0.6962733,0.046774697,0.25211948,0.00082680595,0.0005770008],"about_ca_topic_score_codex":0.000023010267,"about_ca_topic_score_gemma":0.000023528646,"teacher_disagreement_score":0.95816183,"about_ca_system_score_codex":0.00010058757,"about_ca_system_score_gemma":0.00080144714,"threshold_uncertainty_score":0.7228444},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033340838,0.00011669981,0.9683715,0.00044205083,0.001882405,0.0004519192,0.000057293906,0.0000674292,0.025276618],"genre_scores_gemma":[0.97721505,0.000012233319,0.01943656,0.00137511,0.00032910166,0.000041343555,0.000100846,0.000039429986,0.0014503016],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817,0.00009396311,0.00031343778,0.00080062426,0.0003588568,0.00026310887],"domain_scores_gemma":[0.9976724,0.00096126966,0.00027775828,0.00054033194,0.0004570823,0.00009118923],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022176941,0.00025888468,0.00039171064,0.000391713,0.00016585014,0.00005922221,0.00029587196,0.00030976505,0.0022767964],"category_scores_gemma":[0.00010010857,0.00022609261,0.000121856,0.00037532122,0.00073073164,0.0001390243,0.00012350139,0.0006742031,0.00005515058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008393148,0.0023558899,0.0014408897,0.00024854482,0.0009308534,0.00049329456,0.030779755,0.051702052,0.014019673,0.067212395,0.0010811434,0.82889616],"study_design_scores_gemma":[0.008451753,0.004845263,0.10801308,0.013380917,0.0007234131,0.0010055519,0.00039543086,0.013346788,0.0299209,0.81054187,0.0032491102,0.0061259167],"about_ca_topic_score_codex":0.000091369664,"about_ca_topic_score_gemma":0.00041506728,"teacher_disagreement_score":0.973881,"about_ca_system_score_codex":0.00018554837,"about_ca_system_score_gemma":0.0002670311,"threshold_uncertainty_score":0.99863523},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027032387,0.00006173714,0.97367084,0.0006402841,0.00028759072,0.0004358582,0.000044359334,0.00006998855,0.022086076],"genre_scores_gemma":[0.68743664,0.000039065682,0.28460947,0.0049654823,0.00058067375,0.000044288594,0.00012827586,0.000117561605,0.022078538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944231,0.00004760161,0.0006309866,0.001259317,0.0031138333,0.00052518595],"domain_scores_gemma":[0.99696136,0.0007228936,0.0005120219,0.0009710704,0.0006614953,0.00017115843],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002171624,0.00045528193,0.00056854606,0.0011581283,0.00035025395,0.0012759621,0.0015742055,0.00018831696,0.0005229636],"category_scores_gemma":[0.00015701052,0.00031041255,0.00010031094,0.0013596729,0.0007204233,0.0010607201,0.0002771126,0.0006366354,0.000080407546],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035775444,0.00011453694,0.010390344,0.000082313905,0.000112328955,0.00080656767,0.013895249,0.041824017,0.0010247012,0.014358618,0.002143733,0.9148898],"study_design_scores_gemma":[0.015767505,0.016080873,0.08629244,0.02155369,0.0012039986,0.00358141,0.0026852738,0.31127274,0.066137105,0.28287765,0.16235723,0.030190084],"about_ca_topic_score_codex":0.000024929994,"about_ca_topic_score_gemma":0.00049985055,"teacher_disagreement_score":0.88469976,"about_ca_system_score_codex":0.00020755567,"about_ca_system_score_gemma":0.0007129869,"threshold_uncertainty_score":0.9999348},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010706769,0.00038353557,0.9965995,0.00013198676,0.0011144414,0.0006621979,0.000093803515,0.000435297,0.00047217146],"genre_scores_gemma":[0.0052124853,0.00006527121,0.99248785,0.0010273015,0.000690711,0.00001918401,0.00034530426,0.00006310676,0.00008877905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99406993,0.00015194256,0.00081923616,0.002937907,0.0012713387,0.00074963784],"domain_scores_gemma":[0.9954904,0.00032349495,0.00061607285,0.0024904136,0.00081830926,0.00026131095],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015769324,0.0006903521,0.0006713737,0.0011708809,0.00046088157,0.0014564886,0.003918973,0.00047473557,0.00008789829],"category_scores_gemma":[0.00012635902,0.0007215475,0.00012371915,0.00089853536,0.00051953166,0.004215309,0.0024942204,0.0010117823,0.00004497097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004140428,0.000052308093,0.0000017725858,0.00002325901,0.000014775899,0.00011427094,0.0001915862,0.00038415796,0.00092644215,0.00021594907,0.000005221375,0.9980661],"study_design_scores_gemma":[0.00032192637,0.00031206055,0.000011303195,0.0006381971,0.00003597095,0.00026612188,0.0000016348762,0.9307927,0.013951863,0.05262372,0.00010142037,0.00094311545],"about_ca_topic_score_codex":0.00018157654,"about_ca_topic_score_gemma":0.0001581279,"teacher_disagreement_score":0.997123,"about_ca_system_score_codex":0.0005937836,"about_ca_system_score_gemma":0.0010250569,"threshold_uncertainty_score":0.9995801},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054359236,0.00044928456,0.99701655,0.00010835875,0.0011763531,0.00068797235,0.000021494967,0.000089689536,0.00039594984],"genre_scores_gemma":[0.11802361,0.000010560695,0.88131934,0.000244681,0.0003304172,0.0000045077973,0.000023828763,0.000029790095,0.000013280559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540246,0.0000725624,0.0009975563,0.0020258916,0.0007841374,0.0007173802],"domain_scores_gemma":[0.995198,0.0008699369,0.00069657643,0.0027325284,0.00037126773,0.00013167568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027741094,0.00048039068,0.0008922945,0.00044299537,0.00033671464,0.00043179866,0.0050823493,0.00035806085,0.0000026660798],"category_scores_gemma":[0.00024263287,0.00045048803,0.00016574946,0.0005976811,0.00040075733,0.00060272095,0.006040823,0.00062482926,8.668121e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012800411,0.00006439027,0.000039294544,0.00056201767,0.000021818565,0.000062058,0.00042841223,0.049140014,0.013178914,0.01631539,0.000008043798,0.92016685],"study_design_scores_gemma":[0.00022241834,0.000089242814,0.000016335398,0.00026731993,0.000010164106,0.00008593843,4.321436e-7,0.96406955,0.0037720413,0.030859727,0.00008558919,0.00052124687],"about_ca_topic_score_codex":0.00024237625,"about_ca_topic_score_gemma":0.00011775222,"teacher_disagreement_score":0.9196456,"about_ca_system_score_codex":0.00025269884,"about_ca_system_score_gemma":0.00078703277,"threshold_uncertainty_score":0.99979466},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008933132,0.0024211411,0.99433327,0.0011390549,0.00053137867,0.00027135172,3.4730812e-7,0.00032630903,0.0008878132],"genre_scores_gemma":[0.12802568,0.00012382245,0.87057334,0.0006268168,0.00014841645,0.000017173323,0.000012949263,0.000022497421,0.00044928715],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967389,0.00007071873,0.00048432438,0.0014348681,0.0008525355,0.0004186641],"domain_scores_gemma":[0.9981395,0.00026696338,0.0003032192,0.00097587396,0.00023921714,0.00007520731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008952469,0.0003312223,0.00035486894,0.0010850311,0.00014927083,0.0006961225,0.0020387587,0.00026198788,0.00001254342],"category_scores_gemma":[0.00021027273,0.00032423346,0.00008157929,0.0012453696,0.00024272047,0.0009210956,0.0009530827,0.001074206,0.000008304409],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028358138,0.000016118645,0.00016937418,0.000035311947,0.000003697796,0.00014006413,0.0008898115,0.009426343,0.00092995004,0.05721251,0.000007746445,0.93116623],"study_design_scores_gemma":[0.00023440793,0.00009848591,0.00023643946,0.0009772413,0.0000052959185,0.000077898185,6.9247113e-7,0.13222076,0.022238951,0.84265876,0.0004950183,0.0007560417],"about_ca_topic_score_codex":0.000057916717,"about_ca_topic_score_gemma":0.0001051662,"teacher_disagreement_score":0.9304102,"about_ca_system_score_codex":0.0003825635,"about_ca_system_score_gemma":0.00036078627,"threshold_uncertainty_score":0.99992096},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008781705,0.0019947498,0.99316764,0.00028045784,0.001021931,0.00031007847,0.0000035378807,0.00013726897,0.0022061798],"genre_scores_gemma":[0.19365323,0.00004482763,0.80469817,0.0005731151,0.00044496765,0.000007554325,0.000008949985,0.000041432264,0.0005277743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946939,0.00007839777,0.00065720093,0.0025097947,0.0012330349,0.0008277026],"domain_scores_gemma":[0.99620306,0.0003235288,0.00035998487,0.0023829197,0.00047323407,0.00025725723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084804784,0.000709134,0.0010064897,0.0016681656,0.00036106206,0.0009011079,0.003144327,0.00030337746,0.000064967004],"category_scores_gemma":[0.000031009982,0.0006068122,0.00030404443,0.0023239832,0.00050188496,0.0007363832,0.0022462304,0.00080963544,0.000020010495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065599074,0.000056846126,0.0005416673,0.00006614502,0.0003680199,0.00056190894,0.002528358,0.718118,0.00007788615,0.023402844,0.0000073869282,0.25426438],"study_design_scores_gemma":[0.00024720124,0.00010187112,0.000088542176,0.00044586585,0.00019493037,0.00010155986,0.0000010096044,0.9842569,0.0010042995,0.012099677,0.00056802604,0.00089009904],"about_ca_topic_score_codex":0.00006938185,"about_ca_topic_score_gemma":0.00038466786,"teacher_disagreement_score":0.26613894,"about_ca_system_score_codex":0.0005582542,"about_ca_system_score_gemma":0.0011775981,"threshold_uncertainty_score":0.9996383},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004912541,0.0006975986,0.9951996,0.00064264715,0.0020560327,0.00057896995,0.000028547225,0.000098763885,0.00020654686],"genre_scores_gemma":[0.4573582,0.00012389543,0.53998536,0.0016195782,0.00066995685,0.000039562547,0.0001332446,0.000040009618,0.00003016784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638313,0.00004751192,0.0005725952,0.0016723316,0.00060302514,0.0007214183],"domain_scores_gemma":[0.9970646,0.00076262566,0.00026947397,0.0014297027,0.00032737755,0.00014620615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013687863,0.00042949864,0.0004922092,0.0009976814,0.00026817867,0.00075186073,0.0027323633,0.00039299537,0.000013783447],"category_scores_gemma":[0.00018797448,0.00043335345,0.00019767186,0.0011098916,0.00037998657,0.00083406235,0.0011943418,0.000733736,0.000005252253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000239399,0.00010835354,0.0003562731,0.00009721096,0.000015188926,0.00008709496,0.0014823416,0.012965438,0.00022335663,0.66600126,0.000025813455,0.31861374],"study_design_scores_gemma":[0.00035744495,0.0001096439,0.0006645466,0.00035549625,0.000007525685,0.000026321766,4.732744e-7,0.73654455,0.00026206914,0.26024577,0.000879305,0.00054682454],"about_ca_topic_score_codex":0.000028205777,"about_ca_topic_score_gemma":0.00029106854,"teacher_disagreement_score":0.72357917,"about_ca_system_score_codex":0.00018781795,"about_ca_system_score_gemma":0.00044266568,"threshold_uncertainty_score":0.9998118},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034589833,0.00013703118,0.9935486,0.00042230237,0.0005391536,0.00025862892,0.000046740257,0.000052490956,0.0015360804],"genre_scores_gemma":[0.7697778,0.0000704075,0.22858122,0.0012588568,0.00012592562,0.000010797998,0.00007114405,0.000022999626,0.00008088413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958806,0.000054221644,0.00077291386,0.0013838913,0.0013406469,0.00056771346],"domain_scores_gemma":[0.9971205,0.0004950454,0.00027427808,0.001564688,0.00039362645,0.00015184609],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062006054,0.00045142858,0.00080728746,0.0017903221,0.00020755424,0.0003746646,0.0020435762,0.00017615223,0.0001368908],"category_scores_gemma":[0.000049323182,0.00042138484,0.00039631117,0.0026993982,0.00047072925,0.00042447477,0.00081298506,0.00055375247,0.000004101275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010713449,0.00020027309,0.00084026734,0.000060619026,0.0005580748,0.00013271827,0.0026901895,0.16097191,0.00014845876,0.1961689,0.00008029216,0.6381376],"study_design_scores_gemma":[0.00042107352,0.000504467,0.0039663767,0.00028439224,0.0002882105,0.000014199195,0.000004213424,0.96819353,0.0007544578,0.022137746,0.002314907,0.0011163983],"about_ca_topic_score_codex":0.000065627115,"about_ca_topic_score_gemma":0.00075270166,"teacher_disagreement_score":0.80722165,"about_ca_system_score_codex":0.00015576271,"about_ca_system_score_gemma":0.0003680762,"threshold_uncertainty_score":0.9998238},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003165721,0.00038881728,0.9872429,0.00670965,0.0008579755,0.00035152154,0.0000020977072,0.00029938802,0.0038310792],"genre_scores_gemma":[0.38625926,0.000037513735,0.59899074,0.010234188,0.0018414294,0.000019580973,0.000012632813,0.00010019681,0.0025044498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631584,0.000072408584,0.000396976,0.0014341966,0.0010533251,0.00072724355],"domain_scores_gemma":[0.9969111,0.0009279837,0.00031054302,0.0015695208,0.000090557005,0.00019026402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080404826,0.0005481633,0.00046769402,0.00079758296,0.0004751394,0.0009979247,0.004537823,0.0002104488,0.000021492415],"category_scores_gemma":[0.000029658375,0.00035293767,0.00013033662,0.0010923238,0.0009763134,0.0007702795,0.0019679712,0.0009060576,0.0000525038],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006056188,0.000009260751,0.00001689986,0.000025108435,0.000012859389,0.000047033296,0.00049642223,0.017970946,0.000031484386,0.110294186,0.00013003354,0.8709597],"study_design_scores_gemma":[0.0006502379,0.0005610785,0.00053337065,0.00084357016,0.000021674601,0.00031707477,4.5451597e-7,0.62751555,0.001601449,0.3138024,0.052545466,0.0016076831],"about_ca_topic_score_codex":0.000010358796,"about_ca_topic_score_gemma":0.00003585675,"teacher_disagreement_score":0.86935204,"about_ca_system_score_codex":0.000112467606,"about_ca_system_score_gemma":0.0005972878,"threshold_uncertainty_score":0.99989223},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070820365,0.00053858076,0.9950225,0.00028184798,0.0013375779,0.00073078135,0.0000030142537,0.00013813526,0.0012393821],"genre_scores_gemma":[0.063673005,0.000019075562,0.9343735,0.0011527623,0.00048066364,0.000022293143,0.000009752216,0.00003759987,0.00023132165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954032,0.000066069435,0.00051091873,0.0021429926,0.001210464,0.0006663568],"domain_scores_gemma":[0.9973789,0.00036828147,0.00029667036,0.0014559398,0.00032412424,0.00017607008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008445561,0.0005704154,0.0005746083,0.00066117477,0.0003039268,0.00067423464,0.0022464846,0.00031477958,0.000010712522],"category_scores_gemma":[0.00009435467,0.00054623553,0.00017036838,0.00076719775,0.0004440487,0.0008074908,0.0016360905,0.00081408874,0.000010835508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038480457,0.000044197503,0.000104365485,0.00008912833,0.000023878953,0.00013448845,0.0026603527,0.22361104,0.0013259313,0.0059744185,0.000004188729,0.7660242],"study_design_scores_gemma":[0.00023899306,0.00004616355,0.000058604488,0.00039024057,0.000013821991,0.0001813414,0.0000018449706,0.9843735,0.0023962378,0.011674134,0.00005561336,0.00056950015],"about_ca_topic_score_codex":0.00006987053,"about_ca_topic_score_gemma":0.000017541495,"teacher_disagreement_score":0.76545465,"about_ca_system_score_codex":0.0006635214,"about_ca_system_score_gemma":0.00060081837,"threshold_uncertainty_score":0.99969894},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4725567,0.00010441104,0.5268022,0.00006344712,0.0003079094,0.000106789725,6.8712944e-7,0.000028798248,0.000029072608],"genre_scores_gemma":[0.8576769,0.00003477856,0.14082181,0.00031941515,0.001006561,0.0000032801472,0.00012056548,0.000015734895,9.266419e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973604,0.000097927375,0.0003040777,0.0014049747,0.00028028808,0.00055234606],"domain_scores_gemma":[0.99878603,0.00008652111,0.0001886987,0.00063088036,0.00019632108,0.00011156982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005741188,0.00034410518,0.00035256476,0.0000796772,0.00013783606,0.00025100773,0.000775102,0.00048794685,0.0000033183787],"category_scores_gemma":[0.00011486866,0.0002691147,0.000098171535,0.00047673908,0.0003808041,0.000006446506,0.0021826837,0.0007051101,0.0000013163268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003017466,0.000053253523,0.0014162565,0.000021762768,0.000014901889,0.000027775815,0.0000473293,0.62194735,0.2994207,0.0000013179167,0.000006315293,0.077012844],"study_design_scores_gemma":[0.00027747726,0.00023750296,0.0033061467,0.00033929583,0.000013412539,0.00010432105,0.0000013169299,0.9027547,0.09219469,0.0001264274,0.000021086553,0.00062360475],"about_ca_topic_score_codex":0.00005199879,"about_ca_topic_score_gemma":0.00001994489,"teacher_disagreement_score":0.38598034,"about_ca_system_score_codex":0.00007578963,"about_ca_system_score_gemma":0.00025937168,"threshold_uncertainty_score":0.9999761},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005988162,0.0016744781,0.98951226,0.000047055983,0.0022737184,0.00033826122,0.000024250561,0.00019831752,0.0053328644],"genre_scores_gemma":[0.8354136,0.0003653625,0.15960182,0.0007607627,0.0019878182,0.000059258004,0.00006922869,0.00021765544,0.0015244975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984364,0.000007968972,0.00031023743,0.0005399706,0.00029741746,0.00040801326],"domain_scores_gemma":[0.99902254,0.00025906277,0.00007382271,0.000453015,0.000106425956,0.00008511302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004813454,0.0003449526,0.00040080567,0.00035045558,0.0001369317,0.00020960969,0.0006925197,0.00030624875,0.000031440395],"category_scores_gemma":[0.000027942127,0.00033156548,0.00014590858,0.0002773514,0.00017401086,0.00018824606,0.00013297264,0.00042550542,0.000008724347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001622774,0.000023924738,0.00004970201,0.0012940553,0.00007494726,0.000080831705,0.0013241852,0.63001,0.0011295577,0.07772967,0.0002777538,0.2879891],"study_design_scores_gemma":[0.0003837874,0.000121776735,0.000024383695,0.0011993586,0.00003712227,0.00007985067,0.000001530558,0.7531801,0.007650431,0.20106715,0.03503274,0.0012218034],"about_ca_topic_score_codex":0.0000042432434,"about_ca_topic_score_gemma":0.000043935237,"teacher_disagreement_score":0.8348148,"about_ca_system_score_codex":0.00015066897,"about_ca_system_score_gemma":0.00007670898,"threshold_uncertainty_score":0.99991363},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005032649,0.001050752,0.99474365,0.0008978131,0.0022785475,0.0003837965,0.0000035535393,0.00018358527,0.00040796812],"genre_scores_gemma":[0.04669387,0.000020104771,0.9500813,0.001763389,0.00064947916,0.000030539588,0.0000953955,0.0000637005,0.0006022473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951112,0.00007631904,0.00073851296,0.0021617513,0.001075467,0.0008367158],"domain_scores_gemma":[0.9963429,0.0012754344,0.00053981465,0.0011898731,0.00044407317,0.00020790509],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001259115,0.0006490669,0.000785055,0.001189025,0.0005803775,0.0010391837,0.0023990846,0.00035001675,0.000045563847],"category_scores_gemma":[0.00026152006,0.0006425579,0.0004547568,0.00092408585,0.00031711237,0.00039174568,0.0006210718,0.00069195067,0.000018466228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013482455,0.00008955509,0.00054231344,0.00010831647,0.000048380778,0.000050238716,0.0005136088,0.5363036,0.00047079285,0.003705521,0.00008280378,0.45807138],"study_design_scores_gemma":[0.0008594887,0.00020079277,0.00008392733,0.00073896744,0.000018186985,0.00000602914,8.8547074e-7,0.9872337,0.0026130322,0.0008192966,0.0066718874,0.0007538062],"about_ca_topic_score_codex":0.000013381972,"about_ca_topic_score_gemma":0.0000414481,"teacher_disagreement_score":0.4573176,"about_ca_system_score_codex":0.0002906187,"about_ca_system_score_gemma":0.0010263432,"threshold_uncertainty_score":0.99999785},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041893695,0.0050450703,0.9903202,0.0007660091,0.0011084104,0.00046728092,0.0000052338983,0.00048100387,0.0013878525],"genre_scores_gemma":[0.17152567,0.0000754853,0.82540166,0.0016406582,0.00031411395,0.000019093792,0.000017638733,0.000056133274,0.0009495647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952644,0.00013539974,0.00077254715,0.0020524813,0.0009201102,0.0008550338],"domain_scores_gemma":[0.9965678,0.00082424964,0.00037877625,0.001525307,0.000501996,0.00020187614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016381216,0.0006854803,0.0007915144,0.0013246889,0.00019794979,0.0008987629,0.001801713,0.0005133009,0.000031766],"category_scores_gemma":[0.0006078011,0.0006474382,0.00016644552,0.0015196945,0.0005673497,0.0009535891,0.0018525274,0.001345455,0.000029828983],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019401206,0.00008218167,0.000020495412,0.00012196586,0.000010333784,0.0015692797,0.003766994,0.0007312054,0.0019730264,0.04372907,0.00007190005,0.94790417],"study_design_scores_gemma":[0.0010797345,0.00015533663,0.000047614754,0.00380706,0.000017715423,0.0005888949,0.0000021444512,0.6293265,0.024554899,0.33710414,0.0013267099,0.0019892082],"about_ca_topic_score_codex":0.000060758844,"about_ca_topic_score_gemma":0.00043307117,"teacher_disagreement_score":0.9459149,"about_ca_system_score_codex":0.0007380975,"about_ca_system_score_gemma":0.0009187179,"threshold_uncertainty_score":0.99959767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020290398,0.00059884635,0.990762,0.0033308133,0.0010531942,0.0004974884,0.00002392165,0.00015982616,0.0035536245],"genre_scores_gemma":[0.035130054,0.000069024725,0.959442,0.0017288084,0.00052766816,0.00005250183,0.00015104249,0.00004344486,0.0028554494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652296,0.000044516473,0.00051331084,0.0016900774,0.00068459514,0.0005445605],"domain_scores_gemma":[0.99690247,0.00069119036,0.00032598467,0.0015817686,0.00034459852,0.00015398007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091014,0.00042527376,0.00048091685,0.00047067355,0.00027990976,0.00076004636,0.0024802254,0.00026026543,0.000018173369],"category_scores_gemma":[0.00018580271,0.00038765042,0.00016614347,0.0004151224,0.0003900554,0.00038387984,0.0008362169,0.00054110284,0.000024929188],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007329882,0.00004649639,0.000091935595,0.00009950783,0.000017394128,0.00003549297,0.000428193,0.0060286014,0.0003266123,0.12962125,0.0003099563,0.8629872],"study_design_scores_gemma":[0.0006326855,0.00033472505,0.00039686344,0.0006001669,0.000023130418,0.00011624556,4.900229e-7,0.8147749,0.0009234069,0.11331188,0.06779221,0.0010933138],"about_ca_topic_score_codex":0.000015140948,"about_ca_topic_score_gemma":0.00015135607,"teacher_disagreement_score":0.8618939,"about_ca_system_score_codex":0.0001740425,"about_ca_system_score_gemma":0.0007041381,"threshold_uncertainty_score":0.99985754},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056706596,0.0012895071,0.90853214,0.0012929764,0.0016432912,0.00023912812,0.000096198906,0.000048475806,0.086291194],"genre_scores_gemma":[0.7866898,0.001973606,0.16065596,0.006107204,0.002717603,0.000036260142,0.00017450434,0.00023901014,0.041406065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975011,0.000006814701,0.0007586829,0.0012174223,0.0000721849,0.00044383566],"domain_scores_gemma":[0.99827355,0.000105692976,0.0004314127,0.0009843429,0.00008338653,0.00012160248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006615062,0.00034599085,0.0006946788,0.00047820242,0.00019372081,0.0003060235,0.0008781216,0.00028937563,0.0006019574],"category_scores_gemma":[0.00009491123,0.0004062156,0.00015735016,0.00019471977,0.0006125566,0.0003202813,0.00047491808,0.00049383636,0.00030922383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006113483,0.000023183346,0.00023322823,0.000038042042,0.000027893926,0.0000161734,0.000611697,0.036734097,0.000007651326,0.9496309,0.00014773529,0.012523295],"study_design_scores_gemma":[0.0003074976,0.00008233017,0.00006660044,0.00021686542,0.0000066997163,0.000019760806,8.509073e-7,0.11310609,0.00012546775,0.8295782,0.055753097,0.000736501],"about_ca_topic_score_codex":0.000040356714,"about_ca_topic_score_gemma":0.00012338343,"teacher_disagreement_score":0.78612274,"about_ca_system_score_codex":0.00030763942,"about_ca_system_score_gemma":0.00020660977,"threshold_uncertainty_score":0.99983895},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044209108,0.00018933452,0.953463,0.001307252,0.00032699804,0.00033054844,0.0000023529617,0.00016766154,0.0000037036316],"genre_scores_gemma":[0.50170684,0.000006803106,0.4970614,0.001136132,0.00005400549,0.000028885886,6.228456e-7,0.0000046278965,6.568894e-7],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980758,0.00007813646,0.00022403388,0.00082997564,0.0004093491,0.00038272314],"domain_scores_gemma":[0.9987223,0.0003928712,0.0000310704,0.0004707514,0.00015601324,0.0002270025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005061447,0.00016104044,0.00016141836,0.00021421968,0.00022409303,0.00042537562,0.0006348898,0.000047407717,0.00000496727],"category_scores_gemma":[0.00039741327,0.00014423406,0.00005213236,0.0008757007,0.00031590732,0.0002933442,0.00024509817,0.00017511571,0.0000016517293],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009146869,0.00003647942,0.00016133564,0.00003855769,0.000001997923,0.00003256575,0.000601642,0.0003959723,0.07340826,0.000047705646,0.000004163764,0.92526215],"study_design_scores_gemma":[0.0003052019,0.00007155212,0.0049297246,0.00003817899,0.0000035066194,0.000032980737,5.504445e-7,0.39519733,0.58314854,0.016046697,0.0000527065,0.00017305165],"about_ca_topic_score_codex":0.000008986927,"about_ca_topic_score_gemma":0.000052908752,"teacher_disagreement_score":0.9250891,"about_ca_system_score_codex":0.000060892486,"about_ca_system_score_gemma":0.00023553088,"threshold_uncertainty_score":0.58816946},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000161373,0.000070123024,0.993775,0.0007433298,0.0014184243,0.00041096736,0.00001915055,0.00015503608,0.0032465742],"genre_scores_gemma":[0.7168541,0.00001843004,0.27815014,0.004459258,0.0004186029,0.000011084074,0.000036079466,0.000035832913,0.00001645421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99615616,0.000052240885,0.00044319232,0.0018358208,0.00096105394,0.0005515148],"domain_scores_gemma":[0.99705553,0.0009081408,0.00032808914,0.0012319307,0.00023612085,0.00024018614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075977657,0.000607125,0.0005503528,0.0011355787,0.00031123852,0.0007257607,0.0020310527,0.00032997626,0.0000137802845],"category_scores_gemma":[0.00007269386,0.0005569456,0.00015976613,0.0006107146,0.0005854182,0.000562928,0.0008358685,0.00086153345,0.000043600674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046403136,0.0000882221,0.00010387556,0.00009203461,0.000019316676,0.00009293984,0.0013149912,0.070368096,0.000034574998,0.07117706,0.00018564888,0.85647684],"study_design_scores_gemma":[0.0004099339,0.00030805275,0.000384191,0.00043213982,0.000008134269,0.000023300225,1.5601441e-7,0.87072057,0.0003367335,0.12546058,0.0013311836,0.00058501307],"about_ca_topic_score_codex":0.000023310331,"about_ca_topic_score_gemma":0.000054405617,"teacher_disagreement_score":0.8558918,"about_ca_system_score_codex":0.00015400232,"about_ca_system_score_gemma":0.00027277877,"threshold_uncertainty_score":0.9996882},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035254407,0.0021163716,0.9907771,0.00086257665,0.0013874127,0.0002175528,0.000019355573,0.0001658895,0.00410124],"genre_scores_gemma":[0.08707472,0.00065819174,0.908655,0.002110912,0.0009074563,0.00002709862,0.000056542674,0.000055898876,0.00045417337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655056,0.000038738846,0.0003646068,0.0017194689,0.00072112,0.0006055149],"domain_scores_gemma":[0.9973238,0.00026489914,0.00015301892,0.0017671415,0.0002414289,0.00024971733],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006766394,0.00041147985,0.00041607025,0.00073730055,0.00056150765,0.0020727532,0.002538132,0.00027341096,0.00009752784],"category_scores_gemma":[0.000116148025,0.0004089998,0.00011622473,0.001023613,0.0007000091,0.001612791,0.0029770061,0.0008278245,0.00001061469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052599526,0.00007268675,0.0005414862,0.0001345969,0.000039764836,0.00018079068,0.0018637201,0.002400316,0.00020704554,0.52257395,0.00022417857,0.47175622],"study_design_scores_gemma":[0.0004991771,0.00021093457,0.0011108851,0.0006060895,0.000023703984,0.00045813379,0.000001936505,0.35655233,0.0007033525,0.59049493,0.047784347,0.0015541681],"about_ca_topic_score_codex":0.00011758336,"about_ca_topic_score_gemma":0.00032418992,"teacher_disagreement_score":0.47020203,"about_ca_system_score_codex":0.00009937381,"about_ca_system_score_gemma":0.0005784005,"threshold_uncertainty_score":0.9998362},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017960056,0.0010480272,0.9914872,0.0022333497,0.00043060692,0.00036543392,0.0000030122008,0.00039925962,0.0022371218],"genre_scores_gemma":[0.1693426,0.000052614065,0.8272722,0.0018189535,0.00048695775,0.000019508458,0.000008114807,0.000073501724,0.00092558534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952848,0.000035083496,0.0006197134,0.0023752823,0.0008607971,0.0008243331],"domain_scores_gemma":[0.9950771,0.00028718004,0.00033510165,0.0038091512,0.0002744088,0.00021708448],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0009765658,0.00056147174,0.0006071749,0.0009475449,0.0007531572,0.0005902271,0.00788785,0.00065756496,0.000043404263],"category_scores_gemma":[0.0001969144,0.00056545064,0.00016798227,0.0012251182,0.0006154177,0.0003125352,0.009537008,0.001451181,0.000011012736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068182544,0.00014663214,0.00028928454,0.00015196507,0.00005228967,0.00051379565,0.0028810157,0.058615707,0.0034487823,0.27598545,0.00008601669,0.65782225],"study_design_scores_gemma":[0.00015284387,0.000030829626,0.000025361735,0.00043563292,0.000008228135,0.00011903605,6.0234163e-7,0.79858375,0.0022692557,0.19432028,0.0034780141,0.0005761833],"about_ca_topic_score_codex":0.000031151932,"about_ca_topic_score_gemma":0.00003247046,"teacher_disagreement_score":0.739968,"about_ca_system_score_codex":0.00037740916,"about_ca_system_score_gemma":0.00056700193,"threshold_uncertainty_score":0.9996797},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009715716,0.0014409457,0.99134034,0.001159329,0.0017761422,0.00030416832,0.000006313726,0.0002464331,0.0036291778],"genre_scores_gemma":[0.1305405,0.0002692145,0.86206555,0.0008603281,0.0013322234,0.000014475157,0.00005405939,0.00011402022,0.0047496376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534214,0.00025453628,0.00068955333,0.001604717,0.0013851791,0.00072385004],"domain_scores_gemma":[0.9966367,0.00096670806,0.0006409547,0.0012483995,0.0003392024,0.00016806307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016659512,0.00060637464,0.0007229867,0.0004910325,0.0007841041,0.0010012644,0.0029347672,0.0003387815,0.000020533664],"category_scores_gemma":[0.0002576488,0.00047754875,0.00021731034,0.001196721,0.00058112165,0.00047918985,0.0012100451,0.0016315877,0.0000073552123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039155525,0.00008652842,0.00039035676,0.0001583613,0.00007478211,0.00009987988,0.003541644,0.04068274,0.00017636528,0.005956618,0.00009696797,0.94873184],"study_design_scores_gemma":[0.0002567464,0.00015182082,0.000086492306,0.00038232887,0.000025065965,0.000091756825,0.0000010652647,0.97894865,0.0016483665,0.0066728424,0.011104769,0.0006300664],"about_ca_topic_score_codex":0.00012707883,"about_ca_topic_score_gemma":0.000043234024,"teacher_disagreement_score":0.94810176,"about_ca_system_score_codex":0.00025946734,"about_ca_system_score_gemma":0.0006507772,"threshold_uncertainty_score":0.9997676},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030597579,0.004228608,0.8649437,0.006068383,0.0015215775,0.004181035,0.000006950151,0.00024614693,0.08820607],"genre_scores_gemma":[0.9619022,0.00029454476,0.037321795,0.00005637785,0.00009209719,0.000028599174,0.000001104616,0.000014275334,0.00028899458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816275,0.00008748627,0.00043233155,0.00046239202,0.00045671934,0.00039829846],"domain_scores_gemma":[0.9981867,0.0009512516,0.00019841972,0.00035215268,0.00012305977,0.00018841453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002130937,0.000199761,0.00035122284,0.00028852312,0.00056608877,0.0004387991,0.0005514953,0.00017809003,0.000013999131],"category_scores_gemma":[0.0005599649,0.00015994569,0.00003185072,0.00024883225,0.0027064676,0.00014344529,0.00024299043,0.00052444485,6.4816834e-7],"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.0000015993035,0.000031919393,0.0057282476,0.00037825527,0.000012186502,0.000008557303,0.0683493,0.00034859817,0.000018425817,0.53417593,0.000009463955,0.3909375],"study_design_scores_gemma":[0.00012862809,0.00003539006,0.00041029093,0.0026523888,0.000010394478,0.000046002035,0.000119526376,0.020645155,0.000046907804,0.9742274,0.0012715551,0.00040635752],"about_ca_topic_score_codex":0.0088093225,"about_ca_topic_score_gemma":0.2009819,"teacher_disagreement_score":0.93130463,"about_ca_system_score_codex":0.00017367698,"about_ca_system_score_gemma":0.00061697833,"threshold_uncertainty_score":0.9977911},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002042049,0.00041595905,0.99153066,0.0006718653,0.0032605827,0.0004512741,0.000008610989,0.00022176203,0.0034188502],"genre_scores_gemma":[0.03990755,0.000012772058,0.9532779,0.006264,0.0004206245,0.0000128820275,0.000004941125,0.00005178973,0.00004755077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935029,0.00011035822,0.0007748813,0.0028873626,0.0017295775,0.0009949071],"domain_scores_gemma":[0.9937957,0.0026129936,0.00038941856,0.0026306326,0.00034966707,0.0002215802],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020546573,0.00086679665,0.0009502966,0.0011674623,0.0004874872,0.0015749179,0.0049558296,0.0005175934,0.000113113485],"category_scores_gemma":[0.00035107648,0.0007261443,0.000347564,0.0011642213,0.00041402504,0.0005147147,0.0019132104,0.0012251622,0.000059461738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015649646,0.000061004528,0.000020287629,0.000026694077,0.000009293125,0.00045622914,0.00024690665,0.06144576,0.00003225405,0.0058202664,0.00003345307,0.9318322],"study_design_scores_gemma":[0.00048089548,0.0001850521,0.00017356097,0.0013995263,0.00000932392,0.0000722224,1.05577e-7,0.9006999,0.00012085123,0.094765976,0.001302825,0.00078973256],"about_ca_topic_score_codex":0.000017905712,"about_ca_topic_score_gemma":0.000118004034,"teacher_disagreement_score":0.9310425,"about_ca_system_score_codex":0.00035244116,"about_ca_system_score_gemma":0.0006569664,"threshold_uncertainty_score":0.999519},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045026296,0.0012820894,0.9894765,0.0004272048,0.0037433219,0.0005511296,0.000013081972,0.00015893219,0.004302705],"genre_scores_gemma":[0.13958873,0.00015549717,0.8543574,0.002989438,0.0012726786,0.000055748696,0.000027634924,0.00005738719,0.001495464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955228,0.000029909612,0.0006088223,0.001793592,0.0010040759,0.0010408259],"domain_scores_gemma":[0.99691385,0.0008145395,0.00037381882,0.00124689,0.00045917564,0.0001917399],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008081339,0.00054435135,0.00063198403,0.00041638364,0.00058645825,0.000921817,0.0029249487,0.0004090313,0.000042449825],"category_scores_gemma":[0.00016455758,0.00051484664,0.00023506516,0.0005541826,0.000922437,0.0016819581,0.001486817,0.00078213116,0.000025782507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014883225,0.000034633722,0.000031756506,0.00007025136,0.000024603753,0.00010823974,0.0010333628,0.028693065,0.00011641177,0.22886416,0.00017643123,0.7408322],"study_design_scores_gemma":[0.0010711261,0.00032240505,0.00011202943,0.0005944181,0.000015290418,0.00017786167,0.000003415398,0.7170716,0.0014544617,0.23848282,0.03928054,0.0014140626],"about_ca_topic_score_codex":0.000015131513,"about_ca_topic_score_gemma":0.000051466457,"teacher_disagreement_score":0.73941815,"about_ca_system_score_codex":0.00034919532,"about_ca_system_score_gemma":0.000858605,"threshold_uncertainty_score":0.9997303},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031443647,0.00053296733,0.9959146,0.00093539245,0.00066717935,0.00034759787,0.00008625368,0.00037349432,0.0011110773],"genre_scores_gemma":[0.01886744,0.00013540479,0.97627175,0.0020917673,0.00039992912,0.000028201683,0.0011764058,0.00006978809,0.0009593167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955399,0.0001285044,0.0005696001,0.001992098,0.0011335508,0.000636368],"domain_scores_gemma":[0.99695295,0.0005477452,0.00035677126,0.0017978497,0.00021206195,0.00013264747],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008481172,0.00058175175,0.0005677607,0.00046607526,0.0003021541,0.0014538715,0.00318477,0.0003244019,0.00019040234],"category_scores_gemma":[0.00014854057,0.0005652377,0.00009476266,0.00038869126,0.00050925807,0.0015232089,0.0019516331,0.0010670865,0.00012462768],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026617652,0.00013258362,0.000027381155,0.000084665655,0.00006819325,0.0007442363,0.0014504952,0.0030836063,0.12045339,0.005037968,0.009731904,0.859159],"study_design_scores_gemma":[0.0006987095,0.00034563776,0.000029621502,0.0011826978,0.000037769154,0.00005295822,7.8981924e-7,0.46729922,0.35545865,0.113558024,0.058856107,0.0024798044],"about_ca_topic_score_codex":0.00013195432,"about_ca_topic_score_gemma":0.0000845479,"teacher_disagreement_score":0.85667914,"about_ca_system_score_codex":0.00040552893,"about_ca_system_score_gemma":0.00039510784,"threshold_uncertainty_score":0.9996799},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007487572,0.0002444446,0.9942016,0.000095398645,0.001541706,0.0003642685,0.000003650621,0.00021290098,0.0025872886],"genre_scores_gemma":[0.6058083,0.000056958987,0.3928531,0.00057080435,0.00030611217,0.00003675705,0.000033307202,0.000079050886,0.00025556242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99422836,0.0000811476,0.0008469306,0.0019933037,0.0020547956,0.0007954801],"domain_scores_gemma":[0.9950689,0.0017233104,0.00088552583,0.0019022163,0.00024738556,0.0001726298],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016811128,0.00068546995,0.0012210198,0.0033949392,0.00058917195,0.00029307502,0.005233552,0.00066920806,0.00041956297],"category_scores_gemma":[0.00035017089,0.00064793543,0.00045046787,0.0038198885,0.00063194335,0.000690932,0.0030925998,0.0050036875,0.000007641685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009528425,0.00002472091,0.00018795376,0.000015326686,0.00009688633,0.0000485231,0.0007067488,0.69889957,0.000004577297,0.01756656,6.1630396e-7,0.28243896],"study_design_scores_gemma":[0.00018977429,0.00037036932,0.00017671504,0.0001181515,0.000107995416,0.00001127842,0.0000013376927,0.98768634,0.000059798516,0.010227181,0.00039106066,0.00066001335],"about_ca_topic_score_codex":0.00003284335,"about_ca_topic_score_gemma":0.000042968622,"teacher_disagreement_score":0.60505956,"about_ca_system_score_codex":0.0005614428,"about_ca_system_score_gemma":0.0002757304,"threshold_uncertainty_score":0.9995972},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012945013,0.00058626774,0.9880734,0.0008424201,0.0030234854,0.00035804271,0.000004674845,0.000264183,0.0067180735],"genre_scores_gemma":[0.23543456,0.0004440437,0.75400513,0.0059232293,0.0017228732,0.000041473762,0.00005330967,0.00013214961,0.002243195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99487954,0.000085233085,0.0007118948,0.002149998,0.0013512454,0.0008220586],"domain_scores_gemma":[0.9965207,0.0005709992,0.0003761151,0.0018436394,0.0004118393,0.00027672725],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010750932,0.000628653,0.0006295698,0.0007429136,0.00038314072,0.0012589057,0.0029922903,0.00035232038,0.00025182535],"category_scores_gemma":[0.00016779467,0.0006206222,0.000250478,0.00070438016,0.00039666292,0.0007117553,0.001165944,0.0010529356,0.00020795398],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037695445,0.00003822729,0.000047771282,0.000017395061,0.000018928726,0.0002529488,0.00014260176,0.009033263,0.00011044142,0.006198794,0.00008203068,0.98405385],"study_design_scores_gemma":[0.00036569277,0.00009287488,0.00048236523,0.00069943623,0.000024379186,0.00051912206,6.5681866e-7,0.944918,0.0046607335,0.038922634,0.007948338,0.0013657806],"about_ca_topic_score_codex":0.00002173269,"about_ca_topic_score_gemma":0.000063488784,"teacher_disagreement_score":0.98268807,"about_ca_system_score_codex":0.00042232548,"about_ca_system_score_gemma":0.00054853834,"threshold_uncertainty_score":0.99977785},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006794666,0.0018725558,0.988589,0.00009956893,0.0007088983,0.0011167099,0.000014412531,0.00003047424,0.00077374035],"genre_scores_gemma":[0.9397574,0.00018365946,0.059253175,0.00045932492,0.00017989194,0.000058399506,0.000052480493,0.000033893157,0.000021753558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978576,0.000021478088,0.00048102258,0.0007125527,0.0005554849,0.00037190825],"domain_scores_gemma":[0.9984577,0.0003782391,0.0001845514,0.000638511,0.00020475885,0.0001362983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029917073,0.00031857422,0.0008984996,0.0006424461,0.000051070874,0.00005243893,0.00022286283,0.00019147464,0.000022907607],"category_scores_gemma":[0.00004590314,0.00027774682,0.0011099576,0.00051031314,0.0002293924,0.00006118599,0.00016149353,0.00027996593,6.41147e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034298922,0.00027049813,0.217072,0.0006452293,0.0007425702,0.00012785177,0.00012608826,0.096279725,0.000014743937,0.00048105462,0.000011988899,0.68419397],"study_design_scores_gemma":[0.0013495733,0.00035508498,0.2974777,0.0018249801,0.0005836126,0.000007080119,7.375744e-7,0.69425714,0.000030019894,0.00379014,0.000018567684,0.00030535046],"about_ca_topic_score_codex":0.000019816833,"about_ca_topic_score_gemma":0.000009110523,"teacher_disagreement_score":0.9329628,"about_ca_system_score_codex":0.00027433038,"about_ca_system_score_gemma":0.00039732934,"threshold_uncertainty_score":0.99996746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033500776,0.00046377303,0.9912721,0.0028086351,0.0010712476,0.00039104203,0.0000070612095,0.00035456315,0.0032965555],"genre_scores_gemma":[0.4885391,0.00009039786,0.507087,0.0032345844,0.00040371026,0.000037796905,0.000028517472,0.00005572197,0.0005231756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963508,0.000043047785,0.00047796912,0.0017965103,0.00077390444,0.00055776123],"domain_scores_gemma":[0.99720097,0.0004031157,0.00028620593,0.0016667891,0.00031153962,0.00013139952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006048386,0.0004969575,0.0004980356,0.00067187793,0.00036397178,0.00035482485,0.0026110911,0.00067969505,0.000028448121],"category_scores_gemma":[0.0000579359,0.000475216,0.00014695356,0.00080332096,0.00065956026,0.00022056283,0.001153008,0.0014087764,0.00008985865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033681017,0.000102705446,0.000023585746,0.000032279095,0.000021360716,0.0001137189,0.0005554968,0.024978606,0.00013741935,0.29493406,0.00014154082,0.67895585],"study_design_scores_gemma":[0.00030376483,0.00013534405,0.00010598408,0.00025753293,0.0000079253405,0.00007428396,3.7543504e-7,0.65796363,0.002411387,0.33342713,0.0046297656,0.0006828967],"about_ca_topic_score_codex":0.0000135578375,"about_ca_topic_score_gemma":0.00008819227,"teacher_disagreement_score":0.67827296,"about_ca_system_score_codex":0.00022730773,"about_ca_system_score_gemma":0.0003769723,"threshold_uncertainty_score":0.9997699},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013955556,0.0007843735,0.9931704,0.0011745554,0.0020757744,0.00040606895,0.0000062169815,0.00018497364,0.0020580895],"genre_scores_gemma":[0.7394046,0.00005768716,0.2557155,0.0027354525,0.00097639085,0.000015690242,0.000023022933,0.000051256313,0.0010203684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948094,0.000045179124,0.0008462187,0.0022581497,0.0010772323,0.00096382614],"domain_scores_gemma":[0.99718314,0.0007026447,0.0002378932,0.0010417491,0.0005933715,0.00024117895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012171558,0.00069474167,0.0008840897,0.00060152815,0.0004169125,0.00090540556,0.0040332214,0.0004328837,0.00006960877],"category_scores_gemma":[0.00016448568,0.00063697743,0.00050543,0.0006056886,0.00036734962,0.00069551636,0.0014731012,0.0008634706,0.000027012386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001288775,0.00004354045,0.0000068117884,0.000056952744,0.000060993705,0.0001359867,0.0006239929,0.04162036,0.00014058892,0.5711494,0.00007839593,0.3860701],"study_design_scores_gemma":[0.00019523877,0.00029470658,0.000013087735,0.00043781177,0.000032494816,0.00009132929,4.432837e-7,0.9822877,0.0007414706,0.008892487,0.0061170114,0.0008961871],"about_ca_topic_score_codex":0.0000062655245,"about_ca_topic_score_gemma":0.00017062412,"teacher_disagreement_score":0.9406674,"about_ca_system_score_codex":0.00028987648,"about_ca_system_score_gemma":0.0006428456,"threshold_uncertainty_score":0.99960816},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015445915,0.003326756,0.9819572,0.011466463,0.00046736488,0.000992128,0.00007391246,0.000051574676,0.00011998743],"genre_scores_gemma":[0.29873225,0.0010018455,0.6165454,0.08101474,0.0018649949,0.00018333699,0.00020354461,0.00013703489,0.0003168631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972403,0.000035690264,0.00041019666,0.001223075,0.0007263197,0.00036439416],"domain_scores_gemma":[0.9929988,0.005044467,0.00022872201,0.0011982688,0.0002756808,0.00025406416],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008451105,0.0003788454,0.0007121643,0.00030082013,0.0002366094,0.00017169393,0.00070300745,0.00032303884,0.000047338075],"category_scores_gemma":[0.0009078937,0.0002843421,0.0001451085,0.00032135748,0.0011024439,0.00010727039,0.00032901537,0.0004893295,8.932126e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029837294,0.0008100481,0.010236648,0.0020718027,0.00033980075,0.00029963572,0.010986556,0.06478771,0.0020408493,0.0033675532,0.003599091,0.9011619],"study_design_scores_gemma":[0.0054824143,0.002238697,0.0026167182,0.0026628808,0.0011876068,0.0003798846,0.000029227227,0.73824793,0.027089804,0.08842393,0.1294017,0.0022392154],"about_ca_topic_score_codex":0.00049988966,"about_ca_topic_score_gemma":0.00026031764,"teacher_disagreement_score":0.89892274,"about_ca_system_score_codex":0.00031576716,"about_ca_system_score_gemma":0.0013731569,"threshold_uncertainty_score":0.9999609},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017336565,0.0010087822,0.9957249,0.0012923018,0.0005120924,0.00062717265,0.0000042999072,0.00014003678,0.00051703333],"genre_scores_gemma":[0.0861107,0.00018018768,0.91089076,0.0013924172,0.00031836316,0.00006531978,0.00002422316,0.00004151243,0.0009765304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972993,0.000027362168,0.0004002101,0.0014305122,0.00040232795,0.00044024596],"domain_scores_gemma":[0.9977996,0.0007906096,0.00027357478,0.00075114204,0.0002521397,0.00013298732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031630805,0.00036107146,0.000388307,0.0002567552,0.0004895004,0.0004082765,0.0010447856,0.00016098176,0.000007950852],"category_scores_gemma":[0.00011658944,0.0003539835,0.000081405306,0.00043558134,0.00048173443,0.00050743093,0.0008192964,0.0004906149,0.0000063656857],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002719721,0.0000095485275,0.000039788967,0.000028810799,0.000007464755,0.00001181158,0.00050740637,0.0083114905,0.0005195354,0.070350885,0.00000972965,0.9202008],"study_design_scores_gemma":[0.00058430765,0.00029099328,0.00010387751,0.0004314207,0.000023210852,0.000151478,0.0000037028087,0.69906247,0.0050237626,0.28782734,0.0055129607,0.0009844615],"about_ca_topic_score_codex":0.0000052715545,"about_ca_topic_score_gemma":0.000084663145,"teacher_disagreement_score":0.91921633,"about_ca_system_score_codex":0.00015464236,"about_ca_system_score_gemma":0.0002888053,"threshold_uncertainty_score":0.9998912},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001075867,0.00088363345,0.987878,0.0011519055,0.0023110565,0.0002293446,0.0000024530505,0.00011891214,0.0073170653],"genre_scores_gemma":[0.17895603,0.00011125923,0.8072498,0.0069735455,0.0014840041,0.000025671552,0.000053801632,0.000087662986,0.0050582495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948997,0.000048357022,0.00069931167,0.002051547,0.0015614055,0.00073970295],"domain_scores_gemma":[0.9971361,0.00029143848,0.00022911503,0.0018122089,0.00030791134,0.00022318865],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007869188,0.0006001887,0.00072427245,0.00088642567,0.00030194657,0.0010701446,0.002742606,0.0003003829,0.00023177479],"category_scores_gemma":[0.000030345987,0.00055856304,0.000356645,0.0009671782,0.00040008448,0.00044895746,0.0010862306,0.00069190905,0.00008725759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055264845,0.0000936534,0.0004889773,0.00004099138,0.000057439545,0.00029005564,0.00035084388,0.090452075,0.00045845713,0.016010137,0.00025203318,0.8914998],"study_design_scores_gemma":[0.00027579322,0.000081073966,0.00020661991,0.00054199004,0.000022516575,0.000020834095,3.0296945e-7,0.9772066,0.0052625225,0.0050346907,0.010493625,0.0008534665],"about_ca_topic_score_codex":0.0000075199505,"about_ca_topic_score_gemma":0.000029464958,"teacher_disagreement_score":0.89064634,"about_ca_system_score_codex":0.00031761528,"about_ca_system_score_gemma":0.00074297254,"threshold_uncertainty_score":0.99996686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007265054,0.0002568457,0.9860454,0.00080689316,0.0006771725,0.00020208108,0.000001235553,0.00024399631,0.011693732],"genre_scores_gemma":[0.1288085,0.00003904474,0.85617226,0.0017741258,0.00050651253,0.000011585432,0.000026228887,0.00007122626,0.012590485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644536,0.00007608317,0.00041409006,0.0013944232,0.0010890968,0.00058095594],"domain_scores_gemma":[0.9977704,0.00041452696,0.00030523803,0.00088442693,0.00043689768,0.00018848582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006810278,0.00043379847,0.0004523153,0.0006093568,0.00048725924,0.0010304251,0.0013874166,0.00023865503,0.000073468815],"category_scores_gemma":[0.00017673623,0.00039546273,0.000092687085,0.00091641594,0.00058309414,0.00063186244,0.00082032627,0.0011953985,0.000043783406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000078582325,0.000032891276,0.00017695826,0.000026186808,0.00002947209,0.00051283446,0.0024294888,0.2446324,0.0002734966,0.19161245,0.000022585617,0.56024337],"study_design_scores_gemma":[0.00084216875,0.00040992224,0.00052593386,0.0007762486,0.000020608568,0.00048034926,0.0000041141525,0.94211376,0.00057091017,0.02266321,0.03018433,0.0014084341],"about_ca_topic_score_codex":0.000007838315,"about_ca_topic_score_gemma":0.00005554549,"teacher_disagreement_score":0.6974814,"about_ca_system_score_codex":0.00016038376,"about_ca_system_score_gemma":0.0008660391,"threshold_uncertainty_score":0.99984974},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007742043,0.0007236085,0.9910867,0.0014708253,0.002856582,0.0003871599,0.00003411383,0.000155032,0.0032085578],"genre_scores_gemma":[0.84414566,0.00036507912,0.15033522,0.0010757911,0.00064905087,0.000042329615,0.000023539673,0.000103003935,0.0032603282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606603,0.00004793742,0.00070149807,0.0011631238,0.0013397228,0.0006816603],"domain_scores_gemma":[0.9965121,0.00061386963,0.00045776882,0.0018740967,0.00039507815,0.000147048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014020727,0.00041947557,0.0005531634,0.0002807036,0.000498389,0.00048066862,0.0052871276,0.00021166218,0.0000041750354],"category_scores_gemma":[0.00011044015,0.00030381567,0.00034122128,0.0008278103,0.0020558147,0.00030356576,0.0015475451,0.0006112957,0.00006452093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009872105,0.000038326205,0.000060083876,0.00012315382,0.000058415724,0.0000892441,0.0010309727,0.039089352,0.00005975433,0.2846588,0.00023479424,0.67454726],"study_design_scores_gemma":[0.00023126711,0.00018952046,0.00039823735,0.00069753954,0.00001038657,0.00006407317,8.937867e-7,0.8353648,0.00019482493,0.15701443,0.0052273404,0.00060667715],"about_ca_topic_score_codex":0.000049077684,"about_ca_topic_score_gemma":0.00012644344,"teacher_disagreement_score":0.8440682,"about_ca_system_score_codex":0.00018901432,"about_ca_system_score_gemma":0.0004510336,"threshold_uncertainty_score":0.9999414},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017034876,0.0004495185,0.9964007,0.00017601416,0.00014536917,0.00051481096,0.000004287326,0.000052887495,0.0005529379],"genre_scores_gemma":[0.9253369,0.00016068487,0.07082766,0.0016944853,0.0008376358,0.000038737588,0.00019306067,0.000087531436,0.0008232839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972304,0.000032689968,0.0004375118,0.0012577638,0.00042912245,0.00061252405],"domain_scores_gemma":[0.9983176,0.00020291294,0.00030677428,0.00068415847,0.00036450024,0.0001240561],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011481004,0.00040115378,0.0004261026,0.00014795105,0.00022413975,0.00020609314,0.001120786,0.00042688666,0.000017318369],"category_scores_gemma":[0.0011481603,0.00036351467,0.0001875859,0.00014322421,0.00061289023,0.00001664352,0.0010067861,0.00074355333,0.0000038001692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002299043,0.000014559574,0.0002917118,0.00007111125,0.000027716374,0.000013029195,0.00015871626,0.007378832,0.09201549,0.00004018417,0.000020163472,0.8999455],"study_design_scores_gemma":[0.00046636385,0.0002391618,0.00002857601,0.00031402527,0.000026035725,0.000048463207,0.0000019551126,0.8807538,0.10879728,0.0024523686,0.006067555,0.0008044064],"about_ca_topic_score_codex":0.00004812628,"about_ca_topic_score_gemma":0.0003283081,"teacher_disagreement_score":0.925573,"about_ca_system_score_codex":0.00010257763,"about_ca_system_score_gemma":0.00051528367,"threshold_uncertainty_score":0.9998817},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000584839,0.0004766636,0.99147886,0.000866561,0.0015992855,0.00025241156,0.0000057335105,0.000073988456,0.0046616355],"genre_scores_gemma":[0.8720224,0.00026695753,0.12451863,0.0019244358,0.00040906313,0.000008518656,0.0000025934646,0.000040861683,0.00080654694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929843,0.000085714506,0.0008005458,0.0017820781,0.0033805452,0.00096683827],"domain_scores_gemma":[0.99306184,0.0019030571,0.00061802147,0.0029838933,0.0012234208,0.00020977663],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.009165372,0.0004283413,0.00046300242,0.0008658644,0.002542274,0.0028852182,0.012313569,0.00012624284,0.0000130376275],"category_scores_gemma":[0.0019641616,0.00026651827,0.00011570684,0.0050708707,0.011892967,0.0013449634,0.0050822124,0.0006487997,0.000012422736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002491677,0.000038179456,0.000077450255,0.000036629488,0.000013033624,0.000023964105,0.0017058703,0.0072734426,0.0033377663,0.3408824,0.000025097026,0.6465837],"study_design_scores_gemma":[0.00020773362,0.00013464798,0.00092768634,0.0005903294,0.000021043581,0.0000736095,0.000011650951,0.8965236,0.03236393,0.065903686,0.0024299284,0.0008121342],"about_ca_topic_score_codex":0.000018894563,"about_ca_topic_score_gemma":0.000030045405,"teacher_disagreement_score":0.88925016,"about_ca_system_score_codex":0.00036370655,"about_ca_system_score_gemma":0.0042562364,"threshold_uncertainty_score":0.9999787},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007832774,0.00021724947,0.9904232,0.000015677582,0.00058616506,0.00035573146,0.000027109918,0.000017217495,0.0005248841],"genre_scores_gemma":[0.5335792,0.000106139756,0.4641468,0.00019566427,0.0009576234,0.000008061831,0.00027384388,0.00007054901,0.00066217687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831,0.00002670116,0.0003319008,0.0006478905,0.0004113726,0.00027210056],"domain_scores_gemma":[0.998713,0.000051975258,0.0003102335,0.00054441614,0.00030733988,0.00007304264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002832733,0.00033474868,0.0002844796,0.00020569123,0.00015088203,0.00014410567,0.000395331,0.000293011,0.000012350407],"category_scores_gemma":[0.00015913484,0.000274269,0.000066540066,0.00021781908,0.000224642,0.000024058503,0.00035425252,0.0004049378,0.0000020596644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012265936,0.000054782653,0.0014957947,0.00017061734,0.000117181386,0.000016702297,0.0011190644,0.44796064,0.33214658,0.00035257608,0.000008273769,0.21643512],"study_design_scores_gemma":[0.00055619556,0.00057692267,0.0005187796,0.00037688296,0.000037462178,0.00007678533,0.0000011839288,0.7642394,0.2301983,0.0009241045,0.0018913364,0.00060270145],"about_ca_topic_score_codex":0.000014314877,"about_ca_topic_score_gemma":0.000032715798,"teacher_disagreement_score":0.5262764,"about_ca_system_score_codex":0.00007251215,"about_ca_system_score_gemma":0.00047447093,"threshold_uncertainty_score":0.999971},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030102602,0.00028049073,0.98903143,0.0028420682,0.0021477148,0.0011851146,0.000016150467,0.00012938409,0.0013573824],"genre_scores_gemma":[0.49669597,0.00005110525,0.4838571,0.012041221,0.0038250044,0.000108476874,0.00036150977,0.000163546,0.002896057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664503,0.000046354933,0.00047338742,0.0014078872,0.0007077613,0.00071957574],"domain_scores_gemma":[0.9964202,0.0019261583,0.00022808528,0.0006924335,0.0004555639,0.00027757525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000639955,0.0005924574,0.0006932364,0.0004850137,0.0004154018,0.00048411923,0.00035502153,0.00027886592,0.000034545068],"category_scores_gemma":[0.0006769419,0.0004910466,0.00019069258,0.00095419906,0.00074822706,0.00027119677,0.000057042635,0.0009717371,0.000005975192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009520691,0.00021780274,0.0052496716,0.0002495888,0.00025733837,0.00010549914,0.006126743,0.8673593,0.005388059,0.0020399601,0.0034631286,0.108590834],"study_design_scores_gemma":[0.02217329,0.042368416,0.048846256,0.035245825,0.002810756,0.030200765,0.00020411042,0.57279336,0.011521885,0.06548879,0.14979394,0.018552609],"about_ca_topic_score_codex":0.00005786466,"about_ca_topic_score_gemma":0.0008631693,"teacher_disagreement_score":0.50517434,"about_ca_system_score_codex":0.00027881996,"about_ca_system_score_gemma":0.0006469353,"threshold_uncertainty_score":0.99975413},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023237287,0.0003162092,0.99571943,0.00043578108,0.001947605,0.00025117063,0.000010326253,0.0001646479,0.0009224784],"genre_scores_gemma":[0.07080721,0.000044627224,0.92317224,0.004063025,0.0007569782,0.000012270939,0.00001204607,0.00006331287,0.001068298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652255,0.000077627206,0.0004747734,0.0014875381,0.00078380556,0.00065369037],"domain_scores_gemma":[0.99736625,0.0010165739,0.00020212337,0.000745377,0.00039501168,0.00027464537],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006353265,0.0004977408,0.00049864815,0.0006307174,0.00038838966,0.00105378,0.0011428305,0.00029973534,0.0001766876],"category_scores_gemma":[0.00015874636,0.0004890654,0.000073859796,0.0008604219,0.0003198902,0.00047729196,0.0010206908,0.00074322574,0.00005965741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041878325,0.000009786354,0.00001731104,0.000013139449,0.000011989758,0.00018022417,0.00013481935,0.012318789,0.00017791754,0.00073709735,0.000016927179,0.98637784],"study_design_scores_gemma":[0.00017704743,0.000109401604,0.00036410164,0.00021718952,0.000019322493,0.00025526623,1.9823929e-7,0.9890025,0.0008062407,0.006085284,0.0022414066,0.0007220156],"about_ca_topic_score_codex":0.000036249763,"about_ca_topic_score_gemma":0.00016224326,"teacher_disagreement_score":0.9856558,"about_ca_system_score_codex":0.00018498377,"about_ca_system_score_gemma":0.00017906689,"threshold_uncertainty_score":0.99998325},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06420199,0.00045027208,0.9263893,0.0002367113,0.0022961232,0.001532176,0.000032535685,0.000039147635,0.0048217457],"genre_scores_gemma":[0.95055974,0.00004632487,0.04839659,0.0003645317,0.00041346924,0.000023920993,0.00006620833,0.000029314107,0.0000998773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769396,0.00005797516,0.00051237515,0.0006141933,0.0008994214,0.0002220899],"domain_scores_gemma":[0.99727017,0.0011993101,0.00024407571,0.0002849678,0.0009304181,0.000071034614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016723529,0.0002107917,0.00045360817,0.00050003664,0.000057229816,0.00006170991,0.00014022575,0.00015685726,0.00017931266],"category_scores_gemma":[0.0017219991,0.00019390354,0.00011036616,0.00028649025,0.0003681449,0.00016095694,0.00004966869,0.0003112888,0.0000014806337],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044732773,0.000034235884,0.002180633,0.000097600896,0.000018243443,0.00002363442,0.00027124942,0.024342697,0.0011424383,0.00010432006,0.0000023928221,0.9717378],"study_design_scores_gemma":[0.0069155283,0.00018684432,0.015923146,0.0041011134,0.00016397396,0.00027811408,0.000003958193,0.9339152,0.01650164,0.020824106,0.0005550334,0.00063134474],"about_ca_topic_score_codex":0.000009655231,"about_ca_topic_score_gemma":0.000045518696,"teacher_disagreement_score":0.97110647,"about_ca_system_score_codex":0.00022091104,"about_ca_system_score_gemma":0.0005401265,"threshold_uncertainty_score":0.7907157},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026766835,0.0004046279,0.95859194,0.03714899,0.0004353155,0.00043551193,0.0000031282038,0.000058222246,0.00024555568],"genre_scores_gemma":[0.83939207,0.00045248235,0.1434568,0.015825812,0.00040651925,0.000033835924,0.00018647985,0.000058453123,0.00018755224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974125,0.00003631238,0.00044857754,0.0009516803,0.0009070429,0.00024388169],"domain_scores_gemma":[0.9981375,0.00075097,0.00016503182,0.0005781817,0.00022592489,0.00014242105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010334896,0.00023744765,0.0003858372,0.0006288363,0.00007675849,0.00012935612,0.00026174873,0.0003528967,0.000069851514],"category_scores_gemma":[0.0013294809,0.00022558124,0.000045288354,0.00043158335,0.0006562889,0.00015081657,0.0001697121,0.0006510624,0.000012727305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026020232,0.000101761005,0.00070236734,0.00029335628,0.00000860466,0.00019136189,0.00055137736,0.008992414,0.0018342123,0.0035604134,0.00009095714,0.98364717],"study_design_scores_gemma":[0.0004884545,0.00007003902,0.010159249,0.0020059282,0.000021654141,0.00008701315,6.0473207e-7,0.977868,0.0006741786,0.0070690475,0.0013032468,0.0002525918],"about_ca_topic_score_codex":0.000087318556,"about_ca_topic_score_gemma":0.0002724829,"teacher_disagreement_score":0.98339456,"about_ca_system_score_codex":0.0005426148,"about_ca_system_score_gemma":0.0011158393,"threshold_uncertainty_score":0.9198936},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048606336,0.0028121201,0.9895012,0.002174166,0.0018703119,0.00048654305,0.000036514215,0.00021930416,0.0024137713],"genre_scores_gemma":[0.122210994,0.00074440177,0.86294746,0.009808029,0.0015257531,0.00006703186,0.00016679609,0.00016102177,0.0023685156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99469054,0.00017215917,0.000731265,0.0021314665,0.001352341,0.00092220784],"domain_scores_gemma":[0.995463,0.00086126185,0.00034190182,0.002744952,0.0004027278,0.00018615795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011122171,0.00072443933,0.000730269,0.00079233735,0.00045325392,0.00090457615,0.005289309,0.0004421166,0.000054138734],"category_scores_gemma":[0.00023597007,0.0005083119,0.00013931624,0.002049473,0.00074055983,0.00080993737,0.0038479434,0.0016653367,0.0000429588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028616427,0.00018835303,0.0003154179,0.00008762404,0.000041013536,0.0021452764,0.0031773024,0.041069183,0.0022216316,0.021507433,0.0010518491,0.9281663],"study_design_scores_gemma":[0.0011496266,0.00039409724,0.0027358786,0.002101588,0.000024425426,0.00042089418,0.0000058803985,0.9020949,0.003347174,0.044325292,0.041169625,0.0022306156],"about_ca_topic_score_codex":0.00018883745,"about_ca_topic_score_gemma":0.0015285511,"teacher_disagreement_score":0.9259357,"about_ca_system_score_codex":0.00028189248,"about_ca_system_score_gemma":0.00095820933,"threshold_uncertainty_score":0.99973685},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001251017,0.0010468165,0.9975496,0.00006365192,0.00030859525,0.000598602,0.000070023365,0.00005589663,0.0001817043],"genre_scores_gemma":[0.008090504,0.000021072156,0.98778504,0.0015923098,0.0019512873,0.000048454927,0.000107241125,0.00007588336,0.00032818067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998036,0.000031046042,0.0003532197,0.0008624796,0.00034445696,0.00037274463],"domain_scores_gemma":[0.9988025,0.00017561046,0.000267048,0.00038067668,0.0002972043,0.00007696081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029742552,0.0004035592,0.0004644301,0.00023231392,0.00028878992,0.00013883242,0.00040185743,0.00018930188,0.00016547434],"category_scores_gemma":[0.0000062844656,0.00040288537,0.00020194025,0.00015144744,0.00052792154,0.00023799505,0.00007129902,0.00041372824,1.8038563e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011767281,0.00001799681,0.000040913706,0.000008373516,0.000041513296,0.000002452443,0.00014963828,0.91400045,0.0044414285,0.032911066,0.00003611134,0.048338287],"study_design_scores_gemma":[0.00045135024,0.000046762023,0.0000018649815,0.00011158479,0.000010867386,0.000003809281,1.7196392e-7,0.90053916,0.0040574507,0.09343306,0.0009547744,0.00038912176],"about_ca_topic_score_codex":0.000005986458,"about_ca_topic_score_gemma":0.000001884439,"teacher_disagreement_score":0.060521994,"about_ca_system_score_codex":0.000407396,"about_ca_system_score_gemma":0.00046588582,"threshold_uncertainty_score":0.9998423},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000086348125,0.00030042938,0.99380213,0.0008639723,0.001015931,0.0025838085,0.000021778618,0.00019728874,0.0011282857],"genre_scores_gemma":[0.014883315,0.000053890024,0.9804934,0.0025373185,0.0009987799,0.0004478568,0.000093703056,0.00006113078,0.0004305864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99589187,0.000050798455,0.0005847943,0.0018469698,0.0008255056,0.0008000362],"domain_scores_gemma":[0.99709666,0.0006728124,0.00035713403,0.0014257143,0.00026657773,0.00018113245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042458496,0.0005724722,0.0005360458,0.0002713713,0.00053651654,0.0004600303,0.002199366,0.00013189828,0.00002236033],"category_scores_gemma":[0.000036376496,0.00054966996,0.00015604246,0.00075562525,0.00033894205,0.00052816275,0.00071507774,0.00056878576,0.000039390226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024611905,0.000057793597,0.000026797074,0.000032932086,0.00001838244,0.000032293337,0.00009223868,0.49357408,0.0005478447,0.012623444,0.00023979,0.4927298],"study_design_scores_gemma":[0.0006977452,0.00055637513,0.00013220923,0.0005402462,0.000018445575,0.000048030797,1.7810832e-7,0.8496444,0.0070561995,0.13340183,0.0069824476,0.00092187023],"about_ca_topic_score_codex":0.000004035695,"about_ca_topic_score_gemma":0.00002687289,"teacher_disagreement_score":0.49180794,"about_ca_system_score_codex":0.0003193948,"about_ca_system_score_gemma":0.00029782232,"threshold_uncertainty_score":0.9996955},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3869677,0.000029186573,0.61141205,0.00006820744,0.00024048895,0.0010825528,0.000035940513,0.000020343328,0.00014352247],"genre_scores_gemma":[0.7457814,3.8970802e-7,0.25326055,0.00016073209,0.00010522067,0.00035578187,0.000018306266,0.00002871454,0.00028888072],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980048,0.0000193048,0.0003249772,0.0009146073,0.00036006415,0.00037623648],"domain_scores_gemma":[0.9988008,0.00014905357,0.00017532535,0.00050098205,0.00021459062,0.0001592335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025556984,0.0002966014,0.00045593167,0.0003206035,0.00012018502,0.00005527425,0.000520357,0.00009439103,0.00009862704],"category_scores_gemma":[0.00002739493,0.0002563343,0.0001427749,0.0003093693,0.00011588332,0.000048577924,0.0004117306,0.00023556103,0.000009039723],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035490468,0.0006522375,0.00009324386,0.0001441364,0.000029413426,0.000013169202,0.008687785,0.00071279926,0.0006938134,0.0009973092,0.00004213044,0.98757905],"study_design_scores_gemma":[0.088419504,0.13481796,0.17734723,0.15285555,0.003203684,0.00073789805,0.0013111254,0.028805742,0.2316116,0.043942407,0.0940463,0.042901006],"about_ca_topic_score_codex":0.0001257711,"about_ca_topic_score_gemma":0.0016833025,"teacher_disagreement_score":0.94467807,"about_ca_system_score_codex":0.00013189855,"about_ca_system_score_gemma":0.00034560796,"threshold_uncertainty_score":0.9999889},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065603,0.0004045159,0.98507017,0.0006343293,0.0011345099,0.00036930633,0.0000693801,0.000022209468,0.0057352637],"genre_scores_gemma":[0.98432577,0.000007150211,0.014644291,0.0005427688,0.00019235982,0.0000067211226,0.0000103557595,0.00002272158,0.0002478883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846673,0.000021611,0.00059452443,0.0005771524,0.00009529591,0.00024467593],"domain_scores_gemma":[0.99791455,0.0009673477,0.0005838086,0.00041400123,0.00008446053,0.000035817335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015203006,0.00020822132,0.00051837857,0.0002700668,0.0001738827,0.0001279675,0.0005508711,0.00012391683,0.00005127639],"category_scores_gemma":[0.00019089361,0.00018242275,0.00014883887,0.00017460342,0.00067959813,0.00008031206,0.00014103646,0.00027685886,0.000027689248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008032495,0.000015821202,0.000041596315,0.00006816954,0.000013561911,0.0000012030114,0.0006722468,0.034612186,0.000016084337,0.9569106,0.000015112104,0.0076253586],"study_design_scores_gemma":[0.0001374324,0.00008186075,0.00012349208,0.00032161403,0.000002820531,0.0000035503324,9.288253e-7,0.11006682,0.00019719539,0.8882606,0.0006130597,0.00019063716],"about_ca_topic_score_codex":0.0000367285,"about_ca_topic_score_gemma":0.0000338163,"teacher_disagreement_score":0.97776544,"about_ca_system_score_codex":0.00008986029,"about_ca_system_score_gemma":0.000049033024,"threshold_uncertainty_score":0.7438984},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00285004,0.00009201254,0.9948473,0.000040587533,0.00046543195,0.0002605681,0.0000134926695,0.00006663192,0.0013639204],"genre_scores_gemma":[0.96594304,0.000012630521,0.03354018,0.00011583589,0.000248895,0.000012002192,0.000044829067,0.00002371611,0.0000588893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890727,0.000015450076,0.00026597508,0.00042168083,0.00023158397,0.00015804589],"domain_scores_gemma":[0.9994406,0.000080969716,0.00005953981,0.00027109406,0.00009718967,0.000050580777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001439456,0.00022174256,0.00018890451,0.00021035456,0.00014114875,0.00018918242,0.00017384086,0.0001812979,0.000038462433],"category_scores_gemma":[0.000042403077,0.00020928199,0.000018988598,0.00025814897,0.00040848498,0.00031194848,0.00007844252,0.00050111866,0.0000017906384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033265324,0.0000074849177,0.000110331566,0.000016485326,0.000011537813,0.0000045349216,0.0008016022,0.31561303,0.0017536739,0.034582004,8.2204224e-7,0.6470952],"study_design_scores_gemma":[0.00012220677,0.00012474816,0.00025680522,0.00021099087,0.000006019861,0.000022108477,0.0000027790736,0.9762006,0.0024470433,0.019200323,0.0010406558,0.00036574804],"about_ca_topic_score_codex":0.00001040509,"about_ca_topic_score_gemma":0.00030784425,"teacher_disagreement_score":0.963093,"about_ca_system_score_codex":0.0001674801,"about_ca_system_score_gemma":0.00010727804,"threshold_uncertainty_score":0.85342723},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020650205,0.0036222185,0.9891076,0.0005367327,0.005336716,0.00079186866,0.0000150711085,0.000198749,0.00018455755],"genre_scores_gemma":[0.07056958,0.0006105726,0.9232849,0.002961721,0.0017443598,0.00046461498,0.000009839868,0.000092532464,0.00026190354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954126,0.00006240847,0.00062527414,0.0021586064,0.0007502035,0.0009908993],"domain_scores_gemma":[0.9970871,0.00075815705,0.0004476814,0.0010701581,0.00043944662,0.00019743507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009906107,0.0006079841,0.0007391524,0.00046247247,0.0004967731,0.00059469364,0.0021048645,0.0004962779,0.00003430104],"category_scores_gemma":[0.00013834791,0.0005899709,0.00021642192,0.00077544566,0.0006712373,0.00060102163,0.001062018,0.00092025707,0.0000022533634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006912328,0.000013258726,0.00006923729,0.000029710947,0.000008421494,0.0000839395,0.0007912287,0.27786887,0.00005521965,0.0013058587,0.000011817714,0.71975553],"study_design_scores_gemma":[0.00031917414,0.00018971028,0.000037626203,0.00056878256,0.000023988681,0.00010991501,5.796356e-7,0.9730152,0.0006077351,0.020905899,0.003487086,0.0007342882],"about_ca_topic_score_codex":0.000043982687,"about_ca_topic_score_gemma":0.00027739725,"teacher_disagreement_score":0.71902126,"about_ca_system_score_codex":0.0012900269,"about_ca_system_score_gemma":0.0009279944,"threshold_uncertainty_score":0.9996552},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048614788,0.00016855625,0.9972279,0.00004629121,0.0007676556,0.0002474472,0.000025274083,0.00007085853,0.00095986313],"genre_scores_gemma":[0.23891719,0.00088104565,0.7452458,0.0006421273,0.0031729522,0.00007139322,0.0015994107,0.0004508354,0.009019217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860865,0.000009210572,0.0002677545,0.0004553056,0.0003540251,0.00030505995],"domain_scores_gemma":[0.9993823,0.00017310845,0.00004357584,0.00026056496,0.000051923584,0.00008853409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015401053,0.000249827,0.0002733205,0.00016289979,0.00008607911,0.00008577626,0.00026034005,0.00021822721,0.000101335296],"category_scores_gemma":[0.000018378238,0.0002551074,0.00007922326,0.000108804554,0.00020126461,0.00007198285,0.00006837853,0.00020122548,0.000023938906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005126485,0.000009007574,0.000009256449,0.000026026943,0.000012789226,0.000032636908,0.000031180924,0.98548716,0.0021338582,0.0021419704,0.000059788355,0.010051198],"study_design_scores_gemma":[0.00032690977,0.000038536902,0.000031734515,0.00011264872,0.000009069965,0.000017577731,3.615962e-8,0.9890527,0.0018659364,0.0034141084,0.004831449,0.00029928295],"about_ca_topic_score_codex":0.0000035975322,"about_ca_topic_score_gemma":0.0000036309582,"teacher_disagreement_score":0.25198206,"about_ca_system_score_codex":0.00027902075,"about_ca_system_score_gemma":0.000090464586,"threshold_uncertainty_score":0.9999901},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003157362,0.00026874733,0.9955791,0.00083617563,0.00044583756,0.00066420133,0.000008845686,0.00047722858,0.0016882501],"genre_scores_gemma":[0.039968617,0.000042184267,0.95707124,0.0016769242,0.00023335293,0.00008731497,0.00007309002,0.000046849316,0.00080041884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952019,0.00009837569,0.00073349004,0.0021019897,0.0010579723,0.0008062756],"domain_scores_gemma":[0.996054,0.0009777276,0.00043600678,0.0014983821,0.00081078475,0.0002230939],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015102312,0.0006307516,0.0009142048,0.0019403836,0.0003830936,0.0014783205,0.0029234483,0.0003814556,0.00013682489],"category_scores_gemma":[0.00026151034,0.0006277391,0.0005568049,0.0019467054,0.00041046814,0.00073301024,0.0010041263,0.0008670398,0.000025953583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013469525,0.00005917499,0.000060197144,0.00010502237,0.00017282902,0.00017147488,0.00044910706,0.03678847,0.00042087302,0.012401798,0.000024903302,0.94933265],"study_design_scores_gemma":[0.00047578698,0.00029198555,0.000056082274,0.0003075694,0.00016182051,0.000020696152,5.4237955e-7,0.9143375,0.01386668,0.06526912,0.0041229553,0.0010892735],"about_ca_topic_score_codex":0.000024362129,"about_ca_topic_score_gemma":0.00014815938,"teacher_disagreement_score":0.9482434,"about_ca_system_score_codex":0.00042251646,"about_ca_system_score_gemma":0.00061026815,"threshold_uncertainty_score":0.9996174},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013730467,0.0009021057,0.99252564,0.0023741066,0.0012312898,0.0005376535,0.0001757649,0.00032834575,0.00055203645],"genre_scores_gemma":[0.5593046,0.00009869249,0.43500546,0.004198289,0.00066480663,0.0000414531,0.00052421575,0.000099359386,0.00006315358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936369,0.00007010682,0.00063284935,0.0026275434,0.0018486108,0.0011840041],"domain_scores_gemma":[0.99482226,0.00045622818,0.00038209907,0.0029772578,0.0009189741,0.00044314913],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008588315,0.00082619296,0.0007612383,0.0010519869,0.000500591,0.0017453188,0.005060862,0.00042305395,0.000054748918],"category_scores_gemma":[0.00015988311,0.00068662927,0.00024307128,0.002189229,0.0013386302,0.0008047337,0.0026662557,0.0012868175,0.000024497527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057103545,0.00048702952,0.00035837543,0.00023115177,0.00011959645,0.0015512112,0.0030936874,0.05051133,0.0003216393,0.5984091,0.000200124,0.34465963],"study_design_scores_gemma":[0.0013922082,0.0010543097,0.0027148074,0.0013569634,0.0000519343,0.00085633603,0.0000035940031,0.90433884,0.0015396778,0.06945002,0.01393598,0.003305361],"about_ca_topic_score_codex":0.000047758378,"about_ca_topic_score_gemma":0.00014363784,"teacher_disagreement_score":0.8538275,"about_ca_system_score_codex":0.00025722553,"about_ca_system_score_gemma":0.0014434081,"threshold_uncertainty_score":0.9995585},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001107932,0.00020065664,0.99486524,0.0008040668,0.0011515503,0.0009900506,0.0000031892657,0.00036706543,0.0005102403],"genre_scores_gemma":[0.42505443,0.00002273604,0.57325244,0.00054464577,0.000552284,0.000087304616,0.000021225456,0.000065769,0.00039915615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99461734,0.00011542793,0.00062279654,0.0024809726,0.0014698256,0.00069362833],"domain_scores_gemma":[0.9971706,0.00022626306,0.0004888842,0.0013075987,0.00056560396,0.00024101492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010920337,0.000592921,0.0005218357,0.0008216263,0.00050161954,0.0006805807,0.0019251335,0.00038277556,0.000011791205],"category_scores_gemma":[0.000064490356,0.00056543265,0.000121324476,0.0013104122,0.00042506,0.00037329152,0.0010437706,0.0010733842,0.00007170806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026131827,0.000058439615,0.00008292468,0.000047180827,0.000013786725,0.00003514309,0.001390053,0.35579962,0.00600956,0.0051114783,0.000010551515,0.6314151],"study_design_scores_gemma":[0.00056222494,0.00034086042,0.0007780363,0.0005441308,0.000012734415,0.00009591692,0.0000028010847,0.98347956,0.007351211,0.0018323194,0.0041441577,0.00085605175],"about_ca_topic_score_codex":0.000052484687,"about_ca_topic_score_gemma":0.00028809966,"teacher_disagreement_score":0.6305591,"about_ca_system_score_codex":0.0011211577,"about_ca_system_score_gemma":0.0006869913,"threshold_uncertainty_score":0.9996797},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000095073876,0.000851364,0.9909264,0.0016935908,0.0035343994,0.0006813749,0.000007199404,0.00020909036,0.0020015452],"genre_scores_gemma":[0.088747606,0.00009896911,0.90467185,0.0029399886,0.0010591233,0.000052798336,0.000013495593,0.00008126704,0.002334914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994894,0.000037935348,0.0008265064,0.0021908781,0.0010696783,0.0009809472],"domain_scores_gemma":[0.99593806,0.0010680049,0.0003768087,0.0019117319,0.0005035252,0.00020184998],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001287486,0.00062761083,0.0006778999,0.0006729999,0.0004192863,0.0011716767,0.004229,0.0003416588,0.000035723944],"category_scores_gemma":[0.00032333832,0.0006098722,0.00028591507,0.00052330707,0.00071055576,0.0006538056,0.001857546,0.0006883569,0.000051442992],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065389854,0.000043518507,0.000034874643,0.000057583406,0.000019999408,0.0000627569,0.000986519,0.015278479,0.0007219615,0.18383916,0.00007827657,0.7988703],"study_design_scores_gemma":[0.00015134457,0.00026186035,0.00003776176,0.00072801945,0.00001538357,0.000035563902,0.00000173416,0.6652141,0.034266375,0.28415513,0.013985873,0.0011468377],"about_ca_topic_score_codex":0.000029264615,"about_ca_topic_score_gemma":0.0002148336,"teacher_disagreement_score":0.7977235,"about_ca_system_score_codex":0.00034654385,"about_ca_system_score_gemma":0.00080325315,"threshold_uncertainty_score":0.9998652},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015120688,0.00070825685,0.9963678,0.00022241515,0.0005898986,0.0012436446,0.0000048528377,0.00037711588,0.00033478552],"genre_scores_gemma":[0.22420226,0.000004348336,0.77480567,0.00063400524,0.00018024538,0.00007073854,0.00001785352,0.00002532896,0.00005953255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685997,0.000057887,0.0004976537,0.0015455795,0.0005193594,0.0005195244],"domain_scores_gemma":[0.99790615,0.00036064553,0.00036155898,0.00087400037,0.00040420264,0.00009343665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010969227,0.00042964262,0.0004899473,0.0009838613,0.00017066662,0.00042741324,0.0019337649,0.00037047002,9.261767e-7],"category_scores_gemma":[0.00024863565,0.0003935966,0.00007900163,0.0005777402,0.00037346603,0.00053962733,0.0003563589,0.00062284153,0.0000016887368],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023573046,0.000026198783,0.00002198453,0.00007274701,0.000002056525,0.000008678221,0.00083794154,0.0034028264,0.0005961214,0.024459427,0.0000058355517,0.9705426],"study_design_scores_gemma":[0.0004430834,0.00038953262,0.000025629846,0.0002356852,0.0000038220132,0.000038748338,4.907656e-7,0.75176436,0.0034576936,0.24294572,0.00015864019,0.0005366069],"about_ca_topic_score_codex":0.00002872987,"about_ca_topic_score_gemma":0.0002030785,"teacher_disagreement_score":0.970006,"about_ca_system_score_codex":0.00033545124,"about_ca_system_score_gemma":0.0003773735,"threshold_uncertainty_score":0.9998516},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017711743,0.00013676102,0.9897927,0.0020065464,0.00052986713,0.00044583247,0.000002667688,0.0007656901,0.0061427895],"genre_scores_gemma":[0.22494176,0.00005142397,0.7664727,0.004181773,0.00053302775,0.00015766609,0.000008461753,0.00013908486,0.00351409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964011,0.000019843841,0.00037924296,0.001735294,0.000776797,0.00068777986],"domain_scores_gemma":[0.9970542,0.00036444227,0.00023531441,0.0020029203,0.0002187871,0.00012432411],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006748829,0.00050224003,0.00043988047,0.00093710906,0.00043615646,0.00034890775,0.00338376,0.00040888347,0.000011226472],"category_scores_gemma":[0.000051007268,0.00042148438,0.00007069595,0.0010809021,0.00084701454,0.00018988675,0.0013512056,0.001084227,0.00010540354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005885755,0.000048989263,0.000026663822,0.000020350646,0.00002073112,0.00015251043,0.0010260566,0.006853199,0.00009597958,0.5946639,0.00006436123,0.39702135],"study_design_scores_gemma":[0.0005349674,0.0005509931,0.00006222093,0.0006322016,0.00001056031,0.000120763674,0.0000013815118,0.50033313,0.0064556696,0.4843642,0.0054770983,0.0014567706],"about_ca_topic_score_codex":0.000020757814,"about_ca_topic_score_gemma":0.00007266717,"teacher_disagreement_score":0.49347997,"about_ca_system_score_codex":0.00015436548,"about_ca_system_score_gemma":0.0003570083,"threshold_uncertainty_score":0.9998237},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011336282,0.0003719723,0.99538386,0.0012825917,0.0010988984,0.00045900088,0.000002461723,0.0000887689,0.00017880255],"genre_scores_gemma":[0.841773,0.0000064299425,0.1575541,0.00024274741,0.00038903306,0.000009891161,0.0000013856783,0.000013142708,0.000010302413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977253,0.00006547701,0.00038156702,0.0009519457,0.00047031592,0.00040535725],"domain_scores_gemma":[0.99182886,0.006943414,0.00017417324,0.0008473469,0.00011656387,0.000089663576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016368655,0.00027862997,0.0003385795,0.00023974352,0.000768345,0.0005997396,0.000967541,0.0004001886,0.0000035986827],"category_scores_gemma":[0.00078296877,0.00019727684,0.0001051861,0.00046175456,0.0011549391,0.00033488194,0.00050343893,0.00077709166,0.0000023050231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004324697,0.0000046363994,0.007995694,0.00007621209,0.000008461855,0.0000039300517,0.0008735353,0.00073022494,0.0000034333325,0.89171124,7.268027e-7,0.09858759],"study_design_scores_gemma":[0.00009877268,0.00008865491,0.004071853,0.00048486755,0.000012677918,0.000034863875,0.0000015409752,0.08284269,0.00008783933,0.91200924,0.0000245578,0.00024246653],"about_ca_topic_score_codex":0.000003422453,"about_ca_topic_score_gemma":0.000013599689,"teacher_disagreement_score":0.84063935,"about_ca_system_score_codex":0.00034919308,"about_ca_system_score_gemma":0.00025414478,"threshold_uncertainty_score":0.8044716},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017987021,0.00043794958,0.9892363,0.0006760878,0.0019012252,0.00097445986,0.000029540386,0.000093298106,0.0064712525],"genre_scores_gemma":[0.03509999,0.000021485428,0.9560062,0.0011258203,0.00060878124,0.00007593196,0.000012853643,0.00006445452,0.0069844387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992242,0.00015212811,0.0011712146,0.0025346663,0.003168762,0.0007312797],"domain_scores_gemma":[0.987429,0.007976535,0.00081840693,0.002071648,0.0014591616,0.00024522937],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.009833081,0.00054438715,0.00081435306,0.0017048466,0.00042238098,0.00074117584,0.003650653,0.0004914367,0.00009653764],"category_scores_gemma":[0.010530229,0.00045344772,0.0003411875,0.0016967218,0.0008583335,0.00043093064,0.001093751,0.00077019254,0.000018358558],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029084686,0.000026243666,0.000114901035,0.000029119654,0.000011812443,0.000008735169,0.0005980378,0.11459303,0.00010473265,0.0054970114,0.00028638382,0.8787009],"study_design_scores_gemma":[0.0001631566,0.00007176861,0.00014078157,0.0001649853,0.000011562984,0.000023584265,3.0784017e-7,0.64277816,0.000110193425,0.3548658,0.0013505208,0.0003191691],"about_ca_topic_score_codex":0.000004921893,"about_ca_topic_score_gemma":0.000057849982,"teacher_disagreement_score":0.8783817,"about_ca_system_score_codex":0.00028053706,"about_ca_system_score_gemma":0.0014062079,"threshold_uncertainty_score":0.99979174},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060980575,0.00051273336,0.9901415,0.004766594,0.0020316902,0.00036984507,0.0000067352216,0.0007890912,0.00077200454],"genre_scores_gemma":[0.19592842,0.000064656524,0.8017712,0.0016007071,0.00043563166,0.000014126143,0.000024288272,0.00007255022,0.00008836268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99402946,0.00006429978,0.0006393517,0.002647643,0.0013276198,0.0012916309],"domain_scores_gemma":[0.98785776,0.000620057,0.000416009,0.010680866,0.00022024842,0.00020508083],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00069400476,0.000848472,0.00084967026,0.0007563068,0.00032736638,0.0013688371,0.040428,0.0005466614,0.000027168711],"category_scores_gemma":[0.0015013342,0.00072059047,0.00013976006,0.0010384123,0.0012836724,0.0010213581,0.077318765,0.0019686124,0.000009799164],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010308185,0.000031802618,0.00012063883,0.000044597684,0.000041429328,0.00093762355,0.00022069832,0.030162496,0.00008229907,0.005087521,0.00020496201,0.9630556],"study_design_scores_gemma":[0.00027027854,0.00017215264,0.00020002085,0.00061955705,0.000013239114,0.0002806627,1.985269e-7,0.87774754,0.00040412357,0.11905192,0.00038064126,0.00085969595],"about_ca_topic_score_codex":0.00000870652,"about_ca_topic_score_gemma":0.00007730762,"teacher_disagreement_score":0.96219593,"about_ca_system_score_codex":0.00028570637,"about_ca_system_score_gemma":0.0004820935,"threshold_uncertainty_score":0.9996678},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040488885,0.00019118359,0.99732935,0.00016309804,0.0012086094,0.00014614579,0.000018382727,0.000111675916,0.00042664056],"genre_scores_gemma":[0.8012801,0.000058767855,0.19434254,0.0015463718,0.0018324538,0.000023119826,0.00015880723,0.00009039877,0.0006674473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845153,0.000009212057,0.00030429487,0.0005039705,0.00040030188,0.0003306703],"domain_scores_gemma":[0.9992079,0.00031738557,0.000056527577,0.00020485086,0.000092707254,0.00012061341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029376487,0.000255077,0.00038688997,0.00027946188,0.00009933096,0.00013952197,0.0003627515,0.00018602006,0.00010580555],"category_scores_gemma":[0.00008314744,0.00025066297,0.00012652516,0.00019403057,0.0002119899,0.000128355,0.000077845485,0.0004016293,0.0000064734727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028996467,0.00000483142,0.000013254504,0.000044763827,0.00004042808,0.000017514978,0.0005578816,0.16189581,0.00068343006,0.0008265694,0.00007858367,0.835834],"study_design_scores_gemma":[0.00039265185,0.000030664458,0.0000042472952,0.00029661634,0.000034959692,0.000008342891,0.000004293431,0.99276245,0.0019008243,0.0028653608,0.00138139,0.00031818228],"about_ca_topic_score_codex":0.000007559277,"about_ca_topic_score_gemma":0.000049369843,"teacher_disagreement_score":0.83551586,"about_ca_system_score_codex":0.00017372268,"about_ca_system_score_gemma":0.00019628923,"threshold_uncertainty_score":0.9999946},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014120447,0.0009102324,0.99050057,0.00063206383,0.00074671366,0.00015790891,0.00000770685,0.00012611372,0.006777472],"genre_scores_gemma":[0.18219654,0.00021015771,0.8127906,0.0012794222,0.0011752386,0.0000068437953,0.000036005713,0.00007582567,0.0022293977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955101,0.000037497277,0.0005899525,0.0017943239,0.001256457,0.0008116937],"domain_scores_gemma":[0.99719524,0.00030959153,0.00022711206,0.001616568,0.00041054297,0.00024091669],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00081821275,0.0005326596,0.00067107956,0.001063692,0.00033418657,0.0010649449,0.0031321987,0.00028611041,0.0001338684],"category_scores_gemma":[0.000048770515,0.00047993477,0.00034876587,0.0015948288,0.0005923246,0.0006185394,0.001693492,0.0010265668,0.000034105506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020483428,0.00003058709,0.000078967765,0.000023248402,0.000025949255,0.00018375847,0.00039330096,0.029282615,0.00010982766,0.015934087,0.0000104098435,0.9539252],"study_design_scores_gemma":[0.00028250343,0.00023765181,0.00028943588,0.0005102484,0.000024570827,0.0001568827,0.0000011809207,0.9671604,0.0017500508,0.024675269,0.0037662887,0.0011455172],"about_ca_topic_score_codex":0.000047515918,"about_ca_topic_score_gemma":0.00015269956,"teacher_disagreement_score":0.9527797,"about_ca_system_score_codex":0.00013739069,"about_ca_system_score_gemma":0.00050817896,"threshold_uncertainty_score":0.99997205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012694509,0.0005248445,0.9822811,0.0015405695,0.00090703455,0.0003687445,0.0000032795824,0.00020388488,0.014043633],"genre_scores_gemma":[0.22268547,0.00008406413,0.7721775,0.0030145538,0.00035060692,0.000019562047,0.000027099828,0.00007590937,0.0015652253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536216,0.00007396901,0.00055566564,0.0017067122,0.0015130278,0.00078844064],"domain_scores_gemma":[0.9978016,0.00035209284,0.00031008926,0.0009617641,0.00029996835,0.00027448084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008532179,0.0006217592,0.00057247805,0.0008758205,0.00040716174,0.00084682263,0.0019380465,0.00030557407,0.00008513279],"category_scores_gemma":[0.000041633186,0.00055230426,0.00015646806,0.0011346709,0.0006724744,0.00092754705,0.00032119715,0.0010218242,0.00005167313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027937302,0.000042898897,0.000046797326,0.000051140923,0.000036156376,0.0004303882,0.0050202203,0.0851277,0.00041405353,0.07808457,0.0000074114437,0.8307107],"study_design_scores_gemma":[0.0019130865,0.0008025128,0.0006217134,0.0013621816,0.00003572353,0.00067866524,0.00001927885,0.90205675,0.0013368364,0.07509348,0.013495698,0.0025840444],"about_ca_topic_score_codex":0.000031689113,"about_ca_topic_score_gemma":0.00025654584,"teacher_disagreement_score":0.82812667,"about_ca_system_score_codex":0.00031385446,"about_ca_system_score_gemma":0.0012548027,"threshold_uncertainty_score":0.99969286},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042827087,0.00030642646,0.99456584,0.000094695584,0.00023820497,0.00019475944,0.00003014275,0.0000022121583,0.00028500313],"genre_scores_gemma":[0.97226506,0.0010006947,0.025219973,0.00032726768,0.00029701358,0.000008581849,0.0005810805,0.000022315086,0.00027801422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992864,0.0000050092417,0.00021924468,0.00026780326,0.00009325156,0.00012827036],"domain_scores_gemma":[0.9996359,0.000025148525,0.000102281956,0.00011632834,0.000084652354,0.000035730045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017271728,0.00012866105,0.0001713854,0.00008848911,0.000036619476,0.00003122343,0.00011947833,0.0001933491,0.0000033096787],"category_scores_gemma":[0.000006184943,0.000119900935,0.000064697204,0.000050049453,0.00020751527,0.0000061344776,0.000064372645,0.00008972699,1.1921357e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058738577,0.0000090575495,0.00002743311,0.000115873336,0.000020724558,0.0000014970065,0.00019996644,0.0011646196,0.01972005,0.0009005736,0.000004004378,0.9777775],"study_design_scores_gemma":[0.0026591022,0.0016145371,0.0005286293,0.0011023991,0.00009107692,0.00016546134,0.0000033579506,0.8580934,0.08027697,0.020386534,0.03353586,0.0015426977],"about_ca_topic_score_codex":8.669739e-7,"about_ca_topic_score_gemma":0.000014516025,"teacher_disagreement_score":0.9762348,"about_ca_system_score_codex":0.0000102592385,"about_ca_system_score_gemma":0.00008749419,"threshold_uncertainty_score":0.48894182},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021065495,0.0011855218,0.9927798,0.00014672456,0.0019439418,0.00041232936,0.000012924893,0.0002397003,0.0030683866],"genre_scores_gemma":[0.98978865,0.000026815766,0.0082545,0.00086619426,0.0006601032,0.00010643579,0.000018293344,0.00006582255,0.00021321171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982173,0.00002212771,0.00027425156,0.0005648446,0.00057894527,0.00034257467],"domain_scores_gemma":[0.9989959,0.0002633265,0.000073765936,0.00050136854,0.00009381591,0.000071814065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034669865,0.00037716166,0.0003348212,0.00043741177,0.0001992059,0.0002845799,0.0004752262,0.0002560292,0.000022122864],"category_scores_gemma":[0.000069017224,0.00028529554,0.000107663625,0.00072995585,0.00020440719,0.00014487896,0.00006128788,0.0006642072,0.000016281572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011389773,0.000014616867,0.000013969063,0.0000889214,0.000016906084,0.000011211312,0.000118982796,0.39354077,0.00057150115,0.00012977181,0.000020136129,0.60546184],"study_design_scores_gemma":[0.00015785523,0.000093238195,0.00006575782,0.00010819969,0.000009642864,0.000054925342,5.3664183e-7,0.9934495,0.002759524,0.00034746085,0.0026307025,0.00032262932],"about_ca_topic_score_codex":0.000019639387,"about_ca_topic_score_gemma":0.0000640459,"teacher_disagreement_score":0.98957795,"about_ca_system_score_codex":0.00020653507,"about_ca_system_score_gemma":0.000047369867,"threshold_uncertainty_score":0.99995995},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05208729,0.00038152278,0.9367818,0.0018671885,0.0074584302,0.00056623673,0.00010743993,0.0002563012,0.0004937597],"genre_scores_gemma":[0.9919355,0.00011999762,0.0026974995,0.0030830398,0.0017213558,0.00009748789,0.000050582763,0.00006815647,0.00022638941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923239,0.00022838922,0.00081544847,0.0031737138,0.0021923722,0.0012662302],"domain_scores_gemma":[0.988318,0.009472598,0.0004887855,0.00090904767,0.0005243502,0.00028722183],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0011786909,0.0009837314,0.0010414683,0.00061878556,0.00167507,0.00048278266,0.0011450123,0.0004135324,0.00015091554],"category_scores_gemma":[0.0029300617,0.00095794175,0.00038662282,0.0012775749,0.0033124317,0.001110263,0.0015343641,0.0017154458,0.000032658478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008136368,0.0010362942,0.041751515,0.00037913883,0.0004359832,0.0020507392,0.0033257173,0.594065,0.007852573,0.10320405,0.0014876039,0.24359773],"study_design_scores_gemma":[0.0044284165,0.001153903,0.08296825,0.0015265074,0.00012488998,0.00167008,0.000018712837,0.59704745,0.011661481,0.2842274,0.008539133,0.00663379],"about_ca_topic_score_codex":0.00011095868,"about_ca_topic_score_gemma":0.0012457656,"teacher_disagreement_score":0.9398482,"about_ca_system_score_codex":0.0007628464,"about_ca_system_score_gemma":0.0006878363,"threshold_uncertainty_score":0.9996246},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012369491,0.00918418,0.9852047,0.0016095001,0.0008921915,0.0005841106,0.0000048582397,0.00013101415,0.001152525],"genre_scores_gemma":[0.39369544,0.0022755251,0.6005012,0.00094297866,0.000986117,0.000046089117,0.000019525763,0.00007406913,0.0014590493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948953,0.00007858306,0.00038263053,0.002077955,0.001585645,0.0009798799],"domain_scores_gemma":[0.9929059,0.0027534468,0.00016918885,0.0036338298,0.0003834114,0.00015421219],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.003046918,0.00044879995,0.0004928059,0.0004835655,0.0011582046,0.0025151947,0.0078084534,0.00029563834,0.0000035328446],"category_scores_gemma":[0.00032671777,0.00027484333,0.000046744146,0.0008640393,0.0021155798,0.00079617783,0.007620161,0.0016010042,0.000006355852],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013751773,0.000019237381,0.00012715887,0.00006955731,0.00003287398,0.0003707905,0.0010839468,0.0018806052,0.00011767262,0.040575374,0.00015551335,0.95555353],"study_design_scores_gemma":[0.0008583424,0.0008441326,0.0016016425,0.002597791,0.000038797265,0.0016795266,0.000028291657,0.73767424,0.0018487291,0.22266085,0.028323568,0.0018440656],"about_ca_topic_score_codex":0.00007947023,"about_ca_topic_score_gemma":0.00077388925,"teacher_disagreement_score":0.9537094,"about_ca_system_score_codex":0.000112947266,"about_ca_system_score_gemma":0.00080822816,"threshold_uncertainty_score":0.9999704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074070616,0.00030707804,0.99686325,0.0007018935,0.00018651142,0.00071078097,0.000010341345,0.00015080614,0.00032862712],"genre_scores_gemma":[0.08398551,0.000015224253,0.91364455,0.0018327205,0.00030409903,0.000025386653,0.000021010115,0.000064721855,0.00010675153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997748,0.000007727439,0.00037908924,0.0010310138,0.00041112374,0.00042304088],"domain_scores_gemma":[0.9984219,0.0002802671,0.00018362532,0.0007429778,0.00024370839,0.00012753575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023670337,0.0003326503,0.00048384923,0.00022199887,0.0002614543,0.00016133345,0.000464906,0.0001822313,0.000018322686],"category_scores_gemma":[0.0001441193,0.00032569678,0.00013719295,0.00037375547,0.00025445598,0.000114181705,0.00035079572,0.00068146706,8.8982506e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045325643,0.0000846987,0.000115494826,0.0003338401,0.000021645594,0.00014905065,0.00022052004,0.23379746,0.03962184,0.003040898,0.000024819741,0.72254443],"study_design_scores_gemma":[0.00035867118,0.00010008584,0.000013197325,0.0006239036,0.00003135109,0.00008071497,3.3513953e-7,0.9643799,0.017823596,0.014662066,0.0015855788,0.00034062093],"about_ca_topic_score_codex":0.000007850283,"about_ca_topic_score_gemma":0.000005205933,"teacher_disagreement_score":0.7305824,"about_ca_system_score_codex":0.0003097116,"about_ca_system_score_gemma":0.00054977264,"threshold_uncertainty_score":0.99991953},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0311495,0.00022643042,0.9403964,0.004064648,0.0011649838,0.0008605507,0.0000012394169,0.00006446732,0.022071734],"genre_scores_gemma":[0.9953811,0.000048949714,0.0018109425,0.0006800814,0.00011715567,0.000005378538,0.000006071579,0.00001491602,0.0019354118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985972,0.000032535852,0.00026754386,0.00045960504,0.00048359815,0.00015950447],"domain_scores_gemma":[0.9990112,0.00031079486,0.0001469854,0.00040203353,0.000093859075,0.000035106154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004679831,0.00016130807,0.00025942197,0.00041893855,0.00006873553,0.00003612644,0.00022619823,0.0001277792,0.00007136616],"category_scores_gemma":[0.0001531039,0.00011537518,0.000064795524,0.00030654535,0.00020052207,0.00002584631,0.00014610677,0.00061011093,0.000011777666],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077706194,0.00009129105,0.00020097695,0.00014914156,0.000015098102,0.0001925179,0.0008521158,0.02464865,0.0027539465,0.025252562,0.00003460805,0.9457314],"study_design_scores_gemma":[0.0030836768,0.0030205576,0.022196924,0.011518837,0.00014629112,0.00075691903,0.000061598825,0.792364,0.062191162,0.06575448,0.037092842,0.00181271],"about_ca_topic_score_codex":0.000021964739,"about_ca_topic_score_gemma":0.00008941435,"teacher_disagreement_score":0.9642316,"about_ca_system_score_codex":0.0002012444,"about_ca_system_score_gemma":0.00014306908,"threshold_uncertainty_score":0.47048634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006365874,0.000684681,0.99499494,0.00140605,0.0010310668,0.00029742258,0.0000045747715,0.00027505026,0.0006696002],"genre_scores_gemma":[0.0069361846,0.00025012004,0.9903356,0.0015640693,0.00023207889,0.0000059024305,0.000026352158,0.000026165824,0.00062354835],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99672717,0.00012347379,0.0005518712,0.0014580312,0.00076972996,0.00036971227],"domain_scores_gemma":[0.9979744,0.0006324856,0.00037355605,0.0006123231,0.00022843412,0.00017880082],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009006494,0.00039131113,0.00045297138,0.00036220002,0.00023891023,0.0008564516,0.0008074821,0.0002548679,0.00014088993],"category_scores_gemma":[0.00024805547,0.00039390137,0.00007473434,0.00035361396,0.0006374433,0.001071693,0.00084973034,0.0008861743,0.000015720538],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014289477,0.0000073216556,0.000105630985,0.000018980343,0.000009834041,0.00005115275,0.0005247138,0.0011926714,0.013401454,0.000275268,0.00004877748,0.9843628],"study_design_scores_gemma":[0.00087978895,0.00034705704,0.0006690549,0.0017834353,0.000026854781,0.00044595546,0.00000850082,0.39535502,0.49417382,0.10426451,0.0003642263,0.0016817783],"about_ca_topic_score_codex":0.00006888798,"about_ca_topic_score_gemma":0.000033068824,"teacher_disagreement_score":0.982681,"about_ca_system_score_codex":0.0002560556,"about_ca_system_score_gemma":0.0003138031,"threshold_uncertainty_score":0.9998513},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054431614,0.00005193503,0.99296576,0.000427709,0.0005918398,0.0002730477,0.0000027495153,0.00023461765,0.000009202033],"genre_scores_gemma":[0.7739581,0.0000033972065,0.22565708,0.0002661358,0.00007572046,0.000031605527,0.0000015610136,0.000006197152,2.2475075e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771416,0.00013839165,0.0004172417,0.00090219115,0.00042265115,0.00040535722],"domain_scores_gemma":[0.99736047,0.0013429963,0.00010880321,0.00075252634,0.00035377897,0.000081411454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013430633,0.00017393327,0.00026597563,0.00052814523,0.00016908282,0.00045949814,0.001143273,0.000092972106,9.83003e-7],"category_scores_gemma":[0.0004627917,0.00017297531,0.00007235227,0.0033510886,0.00010705449,0.0005636311,0.000540419,0.00013571545,0.0000010756409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054914435,0.00010048019,0.00093144673,0.000055767483,0.000002952026,0.000025139963,0.0006686176,0.4912053,0.00047385623,0.07898588,0.0000029901776,0.4275421],"study_design_scores_gemma":[0.0001811965,0.000056659726,0.0012673801,0.00016343729,0.0000014102898,0.000009044047,9.786514e-7,0.95187736,0.036250044,0.009947308,0.000051181487,0.00019397408],"about_ca_topic_score_codex":0.00003748502,"about_ca_topic_score_gemma":0.000107101085,"teacher_disagreement_score":0.76851493,"about_ca_system_score_codex":0.0002032734,"about_ca_system_score_gemma":0.00030970728,"threshold_uncertainty_score":0.70537287},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027319471,0.00014336099,0.9924298,0.00065550796,0.0044648997,0.0005720128,0.000020459272,0.000383125,0.0013035486],"genre_scores_gemma":[0.0024747474,0.00001589239,0.9947704,0.0009210529,0.0007014796,0.000030932788,0.000018846482,0.00005332892,0.0010133362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960721,0.000026121756,0.00067481067,0.0016175051,0.000823483,0.00078594976],"domain_scores_gemma":[0.99647915,0.0018634109,0.00033420132,0.0008184169,0.0002968605,0.00020798066],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012074454,0.00053842633,0.0006597641,0.0007146962,0.00039098662,0.0017194032,0.0029927122,0.00032504197,0.0000140503025],"category_scores_gemma":[0.0002638403,0.0004739849,0.0002535958,0.0008511299,0.00080921303,0.0012974868,0.0016563298,0.000627094,0.00004468748],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000084381145,0.000015627611,0.000018878067,0.000056947636,0.00001214114,0.000027559165,0.00035421245,0.00826095,0.000021590338,0.055639125,0.000037729274,0.9355468],"study_design_scores_gemma":[0.00019503331,0.00021382471,0.00012022802,0.00017165496,0.000003881702,0.000015472606,1.0556259e-7,0.50020367,0.00031204638,0.49708676,0.0012861147,0.00039120825],"about_ca_topic_score_codex":0.000013800302,"about_ca_topic_score_gemma":0.000009431996,"teacher_disagreement_score":0.9351556,"about_ca_system_score_codex":0.00016869254,"about_ca_system_score_gemma":0.0004302591,"threshold_uncertainty_score":0.9997712},"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":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031770287,0.0012543402,0.990174,0.00303581,0.002778082,0.001070222,0.0000023046641,0.00009672056,0.0015567566],"genre_scores_gemma":[0.015556673,0.000017350578,0.982515,0.0011954966,0.00047700427,0.00007620413,0.0000043526975,0.000021522505,0.00013639007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957807,0.00025300626,0.0005642761,0.0017394318,0.0010827228,0.00057985296],"domain_scores_gemma":[0.99486184,0.0015828103,0.00026502708,0.0022743156,0.00091396674,0.00010204039],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0089996215,0.00040603775,0.00045342554,0.00030801885,0.00047692252,0.0007056829,0.0036098594,0.00026888814,0.000020922129],"category_scores_gemma":[0.0011095413,0.00030855322,0.00020279519,0.00052659574,0.00039326365,0.00048866833,0.0015950801,0.0006573989,0.0000028140607],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014795253,0.000007779719,0.0000035917753,0.00003206339,0.0000066025896,0.0000027558588,0.0008312101,0.040744882,0.000076309654,0.04364672,0.000003538575,0.91464305],"study_design_scores_gemma":[0.00012237759,0.000035194385,0.000020857873,0.00009706109,0.000011366244,0.000016562932,5.324767e-7,0.6675225,0.0012600501,0.3284508,0.0022158572,0.0002468411],"about_ca_topic_score_codex":0.000021798463,"about_ca_topic_score_gemma":0.000052500378,"teacher_disagreement_score":0.9143962,"about_ca_system_score_codex":0.0006347698,"about_ca_system_score_gemma":0.0017336422,"threshold_uncertainty_score":0.99993664},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010807234,0.002160266,0.9956367,0.00010716504,0.0004438263,0.000116181596,0.00003727169,0.000092345974,0.00032554267],"genre_scores_gemma":[0.7958618,0.0001504931,0.20256847,0.00021317918,0.0004954829,0.000010313858,0.00024645033,0.00004789944,0.00040594445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981966,0.0000121594685,0.0004919329,0.0006052195,0.00042576154,0.0002683501],"domain_scores_gemma":[0.99874693,0.0001732717,0.00011786307,0.0005452479,0.00035560023,0.000061106584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004042978,0.00031583547,0.0007531702,0.0010509039,0.00009595428,0.000121617755,0.00047400035,0.00028270762,0.0000371088],"category_scores_gemma":[0.000084994484,0.00029182466,0.0004220238,0.0010311645,0.00013475098,0.0001099679,0.000087057364,0.00027664172,0.0000011363076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.087066e-7,0.000004940549,0.000027647444,0.000051630996,0.0003675472,0.0000028637921,0.00015983163,0.93622303,0.0013350563,0.00022303406,0.000062804786,0.06154071],"study_design_scores_gemma":[0.00007408924,0.000018110297,0.000025002138,0.00012760541,0.00046674782,0.0000010737424,2.2634698e-7,0.992207,0.0050687464,0.0013738701,0.00034291213,0.00029464057],"about_ca_topic_score_codex":0.000019432138,"about_ca_topic_score_gemma":0.00039577432,"teacher_disagreement_score":0.794781,"about_ca_system_score_codex":0.000111523106,"about_ca_system_score_gemma":0.000102281214,"threshold_uncertainty_score":0.9999534},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025747984,0.0031814044,0.9883273,0.002554797,0.0011769936,0.00023857215,0.0000031430707,0.000096605756,0.0018463539],"genre_scores_gemma":[0.5182514,0.000093581555,0.4759697,0.0031251821,0.0005258938,0.000012887376,0.0000070535875,0.000040515588,0.0019737417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652785,0.00012379356,0.00061914057,0.00096126826,0.0012633383,0.00050460413],"domain_scores_gemma":[0.9956456,0.0018888155,0.00036546236,0.0016938888,0.00034493618,0.000061328225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018090145,0.0003814109,0.0006131379,0.0003187247,0.00025218455,0.00048713307,0.0035341186,0.00021072582,0.000030237976],"category_scores_gemma":[0.0006863997,0.000260394,0.0001702386,0.0005239418,0.0012508909,0.0002984673,0.0017776518,0.00057273626,0.000010168013],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010303021,0.00004538072,0.00028532965,0.0002469863,0.000060149112,0.00023105103,0.024703782,0.011157602,0.0012060315,0.16457076,0.00005399419,0.7974286],"study_design_scores_gemma":[0.00053522905,0.00076329336,0.001368926,0.0017332264,0.00006500709,0.0002901782,0.00005780278,0.63871187,0.012054645,0.34227923,0.00070301106,0.0014375872],"about_ca_topic_score_codex":0.000108139684,"about_ca_topic_score_gemma":0.00022173353,"teacher_disagreement_score":0.79599106,"about_ca_system_score_codex":0.00008480204,"about_ca_system_score_gemma":0.0008793599,"threshold_uncertainty_score":0.9999848},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066992204,0.0010056961,0.99224144,0.0021205368,0.00034113775,0.00030697082,0.00000911277,0.00012344834,0.0031817197],"genre_scores_gemma":[0.6421927,0.00020713276,0.3570451,0.00037988354,0.00005585328,0.000018381377,0.000040497674,0.000012120737,0.00004828884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774647,0.000039741986,0.0005648292,0.0008346315,0.00055040256,0.00026389942],"domain_scores_gemma":[0.99664634,0.00039420393,0.00051026396,0.0018805038,0.0005172638,0.000051409712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005873604,0.00026491415,0.00037762505,0.00031864826,0.00026565915,0.00013716183,0.0021024817,0.00042370334,0.000022074726],"category_scores_gemma":[0.000046658675,0.00028468258,0.00009585237,0.0005059576,0.00082078215,0.00048088082,0.00056499965,0.00075817667,0.000014929153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060692723,0.00012939108,0.000028596747,0.000030415918,0.00001861245,0.000007833912,0.0004224295,0.002972081,0.0029955658,0.78435796,0.000026243166,0.20900477],"study_design_scores_gemma":[0.00045519441,0.00015151853,0.0015201339,0.00048986427,0.000021068387,0.00014217937,9.767103e-7,0.14893025,0.05203446,0.7898429,0.005712092,0.00069937756],"about_ca_topic_score_codex":0.00004293092,"about_ca_topic_score_gemma":0.000076696684,"teacher_disagreement_score":0.6415228,"about_ca_system_score_codex":0.00019097769,"about_ca_system_score_gemma":0.00036472574,"threshold_uncertainty_score":0.99996054},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93110144,0.00065902446,0.06670665,0.0009956646,0.00006508581,0.00045520865,0.0000010521287,0.0000061528694,0.000009721986],"genre_scores_gemma":[0.98071504,0.00003943611,0.018868797,0.000309266,0.000021436113,0.000039726146,0.0000022974868,0.0000032258172,7.876388e-7],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99922377,0.000014041449,0.00016669616,0.00026124512,0.00016367486,0.0001705978],"domain_scores_gemma":[0.9996141,0.00008131508,0.000041170733,0.00015253323,0.00005675129,0.000054113596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001431667,0.00007851821,0.00016383496,0.00015091381,0.000022561688,0.000027887121,0.00006238983,0.000026682148,0.000009872933],"category_scores_gemma":[0.00002998472,0.00005566371,0.000012580071,0.00041795298,0.00014133402,0.00012779573,0.0000450332,0.000062164414,0.000002627138],"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.000014073872,0.00009625946,0.88495845,0.00006630087,0.0000032911084,0.000020737496,0.0015200914,0.0010980028,0.003279325,0.000031332125,0.000006433549,0.10890568],"study_design_scores_gemma":[0.00084880117,0.00054528,0.8886807,0.00022750409,0.000005641791,0.00002616386,0.0000024378157,0.06925915,0.038279932,0.0020560562,0.0000024958806,0.00006584056],"about_ca_topic_score_codex":0.00020496915,"about_ca_topic_score_gemma":0.000047804384,"teacher_disagreement_score":0.10883984,"about_ca_system_score_codex":0.00007541863,"about_ca_system_score_gemma":0.000098760676,"threshold_uncertainty_score":0.22699001},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028383638,0.000725187,0.99484617,0.0005930222,0.0013924537,0.0003862379,0.000002469303,0.00008434846,0.0019417094],"genre_scores_gemma":[0.06794036,0.00007652253,0.9280485,0.001287069,0.0022810851,0.00001528983,0.000022418659,0.000035008947,0.00029377732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672425,0.000080726124,0.00043114115,0.0013970239,0.00077503466,0.00059185555],"domain_scores_gemma":[0.99799645,0.00025004052,0.00030815514,0.0008809526,0.000432444,0.00013192996],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00069628534,0.00047595814,0.0005110424,0.00027478303,0.0004081926,0.0012155196,0.0011406633,0.00018547548,0.000029409934],"category_scores_gemma":[0.000041182895,0.0003990783,0.00010583435,0.0006387462,0.00033906917,0.0009103523,0.00045110844,0.00044953582,0.0000138228725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007753764,0.000016693484,0.000018018163,0.000011608628,0.000030649062,0.00014326969,0.00026877705,0.68917656,0.0033896954,0.0076836497,0.00007506164,0.29917827],"study_design_scores_gemma":[0.00040513242,0.00015299015,0.000015304533,0.00023853795,0.000019195817,0.00005626874,3.2113817e-7,0.9828667,0.0085054375,0.006667103,0.00052166934,0.0005513316],"about_ca_topic_score_codex":0.000013510063,"about_ca_topic_score_gemma":0.00018861104,"teacher_disagreement_score":0.29862696,"about_ca_system_score_codex":0.00021381395,"about_ca_system_score_gemma":0.0005007071,"threshold_uncertainty_score":0.9998461},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004281654,0.00269266,0.99160975,0.00016209228,0.00026927283,0.0002186909,0.000073539086,0.000093592615,0.0005987177],"genre_scores_gemma":[0.774918,0.00023277194,0.22411814,0.0005418863,0.00007771065,0.0000036689328,0.00008099398,0.000020103435,0.000006727679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961599,0.00005169296,0.0004981795,0.0017477733,0.0010519385,0.00049048796],"domain_scores_gemma":[0.9970785,0.00036964106,0.0003824832,0.0016114821,0.00037356175,0.00018433224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006314193,0.00052652624,0.00094369176,0.0017489973,0.00019713801,0.00045488923,0.0021438804,0.0004000365,0.000028048826],"category_scores_gemma":[0.000051175335,0.00043898376,0.00018572006,0.0042626555,0.0011014548,0.0007737921,0.0015165771,0.00094752025,7.345907e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007304738,0.00031283425,0.003765415,0.0003580248,0.001268436,0.0005532885,0.003628504,0.006060352,0.0011620312,0.7729435,0.00003123717,0.20984331],"study_design_scores_gemma":[0.001607161,0.0012099108,0.008306474,0.0017830386,0.0009827303,0.00015808432,0.0000043018113,0.74960333,0.0055679847,0.22298637,0.004461697,0.0033289245],"about_ca_topic_score_codex":0.000057917427,"about_ca_topic_score_gemma":0.00085138535,"teacher_disagreement_score":0.7706363,"about_ca_system_score_codex":0.0000585199,"about_ca_system_score_gemma":0.00029979052,"threshold_uncertainty_score":0.99980617},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012177953,0.0010166963,0.9904898,0.00282273,0.00061934657,0.00044663635,0.0000030544277,0.00023741125,0.0031465618],"genre_scores_gemma":[0.73378694,0.0002943868,0.26348054,0.0017565713,0.00024074771,0.000065474,0.000011814186,0.00003517029,0.00032836007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960503,0.000045019755,0.0006231917,0.0019546126,0.000703893,0.00062300666],"domain_scores_gemma":[0.9969051,0.00033374107,0.00015545049,0.0022668007,0.0002208131,0.00011811575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075474405,0.0004370751,0.0005374885,0.0009937027,0.00022270816,0.0002831622,0.003186355,0.00060193153,0.000023341996],"category_scores_gemma":[0.00009606989,0.00044880286,0.00012392431,0.0015225902,0.00063008256,0.00034315654,0.0016189335,0.0011965513,0.000019122983],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019258512,0.00006353718,0.00046750647,0.000016127507,0.000008236209,0.00018419512,0.0005007572,0.005964902,0.00024633837,0.16909644,0.000017048831,0.823433],"study_design_scores_gemma":[0.0003257987,0.000089468194,0.0017711659,0.0003758509,0.000008993044,0.00019287552,0.000001156141,0.50205916,0.0040748324,0.4877292,0.002365233,0.0010062876],"about_ca_topic_score_codex":0.000052472547,"about_ca_topic_score_gemma":0.00072009134,"teacher_disagreement_score":0.8224267,"about_ca_system_score_codex":0.00029684632,"about_ca_system_score_gemma":0.00040276005,"threshold_uncertainty_score":0.9997964},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000067750756,0.0013169497,0.9936215,0.0003962633,0.0024967135,0.0006914241,0.00004923505,0.000192253,0.0011679002],"genre_scores_gemma":[0.044573944,0.00006996911,0.9526991,0.0015294323,0.00081121887,0.000044838234,0.000083667146,0.000050995935,0.0001368399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957503,0.000034863093,0.0005717467,0.002029186,0.00072468707,0.000889206],"domain_scores_gemma":[0.99624264,0.00085598923,0.0002955768,0.0019979656,0.00037912314,0.00022867367],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013035787,0.00057985645,0.0007136496,0.00065740163,0.0004660091,0.0011240675,0.0035960032,0.0003664941,0.000028685441],"category_scores_gemma":[0.000248406,0.0005551515,0.00032482724,0.00082585105,0.0004854261,0.00097801,0.00158851,0.0006841191,0.0000123776845],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000646233,0.00008338868,0.000034853645,0.0002824383,0.0000338894,0.00013859442,0.0007098444,0.004242129,0.0009387058,0.24278487,0.00016093563,0.7505257],"study_design_scores_gemma":[0.0022173193,0.00024106803,0.000035404086,0.00037314778,0.000028719736,0.00009329305,4.624984e-7,0.6089872,0.0054318225,0.36832353,0.012863628,0.001404421],"about_ca_topic_score_codex":0.00004408445,"about_ca_topic_score_gemma":0.00016882208,"teacher_disagreement_score":0.7491213,"about_ca_system_score_codex":0.00016934452,"about_ca_system_score_gemma":0.0008582867,"threshold_uncertainty_score":0.99991286},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083048036,0.0006420486,0.9963251,0.0006333188,0.00055890303,0.00041086852,0.000007916866,0.00016203814,0.0004293765],"genre_scores_gemma":[0.16136155,0.0001618254,0.8375372,0.00035105878,0.00023619957,0.00000899772,0.0000054982147,0.00003853604,0.00029909948],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969243,0.000053597258,0.0005364964,0.0013943316,0.00059804216,0.00049327663],"domain_scores_gemma":[0.99846417,0.00013052851,0.00021812128,0.0008788544,0.00019456932,0.000113766604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006505493,0.00044181838,0.00047556456,0.0009952721,0.0002569512,0.0008172146,0.0011831813,0.00030904807,0.000011038022],"category_scores_gemma":[0.000045089248,0.00043028785,0.00010020895,0.00070541375,0.0006184367,0.0012589005,0.0004987319,0.00076503307,0.0000030319782],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055229057,0.00002855541,0.00005341461,0.0001150435,0.0000063532134,0.00016915207,0.0012827475,0.0011815953,0.027076943,0.00059500086,0.000009842019,0.9694758],"study_design_scores_gemma":[0.00033870255,0.000077145676,0.0010629414,0.00046852528,0.000010421012,0.0002327365,0.0000013575817,0.31453246,0.61512876,0.067169085,0.00022164226,0.00075624743],"about_ca_topic_score_codex":0.0002838258,"about_ca_topic_score_gemma":0.00042354214,"teacher_disagreement_score":0.9687196,"about_ca_system_score_codex":0.00026917615,"about_ca_system_score_gemma":0.0002526563,"threshold_uncertainty_score":0.99981487},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015720728,0.00035440264,0.9946207,0.00040504278,0.0016842891,0.0010699572,0.00025040537,0.00035077138,0.001107219],"genre_scores_gemma":[0.16033968,0.000037581816,0.8386679,0.00054596126,0.00012862963,0.00005339665,0.00017082652,0.00004062319,0.000015364258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99446857,0.00019665097,0.0011734142,0.0019398093,0.0014388724,0.0007826867],"domain_scores_gemma":[0.9951571,0.0011868429,0.000769067,0.0021051697,0.0004978363,0.00028394096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013998052,0.00073271716,0.000963989,0.0017872718,0.00080348784,0.000380452,0.004852084,0.00027824048,0.000106741165],"category_scores_gemma":[0.00007969315,0.00076007453,0.00039230954,0.0021005778,0.0014650414,0.0009861229,0.0029883129,0.0014651793,0.000020023503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016224394,0.00053743605,0.00022890537,0.00016627979,0.00007165043,0.00012887812,0.0020754419,0.29406786,0.0008218585,0.5773074,0.0001963733,0.12438171],"study_design_scores_gemma":[0.0009971936,0.00029523068,0.00041518573,0.0002620898,0.00003191011,0.00012410506,0.000001160387,0.7425513,0.0021936102,0.24826393,0.0037883134,0.0010759732],"about_ca_topic_score_codex":0.00013924624,"about_ca_topic_score_gemma":0.00032231,"teacher_disagreement_score":0.44848347,"about_ca_system_score_codex":0.00026119399,"about_ca_system_score_gemma":0.0008130446,"threshold_uncertainty_score":0.999485},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007704103,0.0017728229,0.99025667,0.00023396895,0.0012495785,0.00027338692,0.000011996928,0.0002535502,0.005177636],"genre_scores_gemma":[0.14355995,0.00013486187,0.8539413,0.0013630693,0.0006963835,0.00001597948,0.000033714074,0.000058163478,0.00019656903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994793,0.0000336074,0.00061169046,0.0024593584,0.0011585233,0.0009438309],"domain_scores_gemma":[0.9963828,0.00036674822,0.00027909488,0.002467317,0.00025474146,0.0002493204],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011416172,0.00060146104,0.00061495363,0.00079788954,0.0005167942,0.0013590943,0.0044747368,0.00035860046,0.00007285607],"category_scores_gemma":[0.00017720813,0.00060082093,0.0002241004,0.0012423663,0.0005086149,0.0010759233,0.0043687494,0.0012550083,0.000025724752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010489182,0.00007804047,0.00060148904,0.00022800364,0.000040338393,0.0005054615,0.0017839273,0.0077867173,0.0018869326,0.3341023,0.00005004538,0.65292627],"study_design_scores_gemma":[0.000580477,0.00022427189,0.00027047755,0.00182174,0.000021838221,0.00022603228,0.0000015939728,0.63354397,0.022012996,0.3278521,0.011360963,0.00208354],"about_ca_topic_score_codex":0.000045806984,"about_ca_topic_score_gemma":0.0001814115,"teacher_disagreement_score":0.6508427,"about_ca_system_score_codex":0.00022855867,"about_ca_system_score_gemma":0.0004928544,"threshold_uncertainty_score":0.9996776},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018369818,0.00009138821,0.99127173,0.002735255,0.0006103455,0.0010569787,0.000029464241,0.00010805819,0.0040783905],"genre_scores_gemma":[0.004580603,0.0000448783,0.9869062,0.006349279,0.00017853182,0.00006716649,0.000021066853,0.00010786569,0.0017444394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963602,0.00013575122,0.0004752536,0.00097337103,0.0014684127,0.0005870574],"domain_scores_gemma":[0.9966435,0.0016135634,0.00033834894,0.0009611254,0.00032772066,0.000115761126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021408957,0.00041076698,0.00042903653,0.00037700118,0.0005556454,0.00034646172,0.0017710163,0.00014545632,0.00062508805],"category_scores_gemma":[0.001245822,0.00030584304,0.000120204844,0.00041511963,0.0022933371,0.00037487614,0.0015058995,0.0020914592,0.000012650673],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041400057,0.00012336271,0.000016664353,0.00014083493,0.000060609837,0.0001703402,0.002894431,0.06755721,0.00015299972,0.1651875,0.0008349443,0.7628197],"study_design_scores_gemma":[0.00040837826,0.00014460349,0.000004715493,0.00015632261,0.00001326074,0.00010676844,0.0000033565232,0.5938992,0.00026886657,0.3980121,0.0064523295,0.0005300974],"about_ca_topic_score_codex":0.000020782642,"about_ca_topic_score_gemma":0.00004954853,"teacher_disagreement_score":0.7622896,"about_ca_system_score_codex":0.00059162674,"about_ca_system_score_gemma":0.0010010457,"threshold_uncertainty_score":0.9999394},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036421363,0.002905418,0.98400253,0.0035057194,0.007105223,0.00033204744,0.000002760795,0.00021848977,0.0018913618],"genre_scores_gemma":[0.09469654,0.002594841,0.8631186,0.027501915,0.002332253,0.000043025622,0.00001055578,0.00018164399,0.009520643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99430925,0.000046523284,0.00072767364,0.0024466172,0.0015342082,0.0009357281],"domain_scores_gemma":[0.99577224,0.0005384908,0.00032697624,0.0025989232,0.0005065831,0.00025676563],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008666144,0.00067526725,0.0006887654,0.0007649722,0.00021829936,0.0026437887,0.0055071907,0.00047591547,0.00023592483],"category_scores_gemma":[0.00011659651,0.000655908,0.00025716313,0.0009615416,0.000709325,0.0021300633,0.0029466976,0.0010507351,0.00035278566],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021464764,0.00002487626,0.000003879089,0.000021826963,0.000013050931,0.00025640658,0.0023462432,0.0035105892,0.00025628685,0.0766407,0.000059276288,0.9168647],"study_design_scores_gemma":[0.00006643121,0.00013065129,0.000003990106,0.0009059546,0.00000856428,0.00013472718,0.0000017567137,0.42335182,0.03243177,0.53264683,0.0093889,0.0009286126],"about_ca_topic_score_codex":0.000025046877,"about_ca_topic_score_gemma":0.00010460206,"teacher_disagreement_score":0.9159361,"about_ca_system_score_codex":0.0003850482,"about_ca_system_score_gemma":0.00093289133,"threshold_uncertainty_score":0.9998735},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010010194,0.0014359569,0.994346,0.0014040911,0.0013029125,0.0007176901,0.000015023624,0.00006416634,0.00061404175],"genre_scores_gemma":[0.40335503,0.00009862664,0.59299505,0.0015468099,0.0006371296,0.00007645722,0.000003849087,0.00008675021,0.0012003292],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960544,0.000097324744,0.00053865736,0.0012910911,0.0012504718,0.00076806673],"domain_scores_gemma":[0.99290013,0.0037224544,0.0004261469,0.0023249243,0.00052528974,0.00010107056],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019455905,0.00043945058,0.0005059363,0.00046546615,0.00080872455,0.00043877107,0.0073792944,0.00018598369,0.0000064285978],"category_scores_gemma":[0.0006834798,0.00026558814,0.00036232825,0.0014724638,0.0019764546,0.00034812326,0.0027366162,0.0009837602,0.0000015126897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016058373,0.000031608415,0.00022953669,0.00009377247,0.000045325283,0.000024663159,0.002003498,0.07672315,0.001605375,0.30817983,0.000026981856,0.6110202],"study_design_scores_gemma":[0.00034647473,0.0001597382,0.00043629875,0.00090598577,0.000019896072,0.00006523522,0.000002733097,0.3708798,0.00918442,0.61553395,0.001897877,0.0005675844],"about_ca_topic_score_codex":0.000021270685,"about_ca_topic_score_gemma":0.0003215799,"teacher_disagreement_score":0.6104526,"about_ca_system_score_codex":0.00011434919,"about_ca_system_score_gemma":0.0005773071,"threshold_uncertainty_score":0.9999796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018323847,0.0001576889,0.9904844,0.0026369658,0.0029926952,0.00069805473,0.0000071956756,0.00019327292,0.0009972986],"genre_scores_gemma":[0.88244635,0.00012859951,0.100455195,0.013459841,0.00054118317,0.00012434465,0.00025864193,0.00009182883,0.0024940067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970605,0.00013920595,0.00071960926,0.0011643041,0.0004659011,0.00045050235],"domain_scores_gemma":[0.9986605,0.00025797513,0.0001774673,0.00046509312,0.0003134809,0.00012546386],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006861707,0.00042120795,0.00049441797,0.001020992,0.00020447961,0.00064290565,0.0004456483,0.00034961104,0.0012969249],"category_scores_gemma":[0.00003705667,0.0004331813,0.0001005698,0.0004168279,0.00019158483,0.00082425313,0.00012859395,0.0007492928,0.00014568215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011956446,0.00032518615,0.00011184151,0.00008334243,0.000048046586,0.00022952288,0.046352327,0.14949138,0.006458075,0.002049571,0.00020221848,0.7945289],"study_design_scores_gemma":[0.0033380326,0.0012352678,0.007526049,0.0067115026,0.00005147164,0.00041047842,0.00034826994,0.89939827,0.053954158,0.0059607164,0.017099394,0.003966365],"about_ca_topic_score_codex":0.00014877945,"about_ca_topic_score_gemma":0.0012562405,"teacher_disagreement_score":0.89002925,"about_ca_system_score_codex":0.00041530607,"about_ca_system_score_gemma":0.00018918734,"threshold_uncertainty_score":0.999812},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003936141,0.0003336905,0.9852469,0.0020834722,0.0040115844,0.00032559322,0.000012011926,0.00010854985,0.003942065],"genre_scores_gemma":[0.7955853,0.00007010581,0.13874222,0.012592917,0.0009183994,0.00011805406,0.00009788665,0.00022093885,0.05165419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971126,0.00014858191,0.00047486438,0.0012051242,0.00055407605,0.0005047864],"domain_scores_gemma":[0.9981189,0.00051791786,0.00031528628,0.000628324,0.00030023645,0.000119369084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069909217,0.00041675597,0.0004751283,0.0005180802,0.00025679756,0.00020596084,0.0006407981,0.00056029466,0.00019543219],"category_scores_gemma":[0.00019231033,0.0004337007,0.0001833387,0.00037171194,0.0003924435,0.00020074625,0.00026848254,0.0011384236,0.00014698121],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019083471,0.00036967194,0.00019317871,0.000085480635,0.0003262792,0.0006394934,0.05048216,0.020069547,0.018944824,0.056152206,0.0023113166,0.8485175],"study_design_scores_gemma":[0.00922452,0.0021039231,0.007153705,0.008714266,0.0004184045,0.0016979123,0.00025791477,0.52900845,0.010093869,0.3786659,0.041153323,0.0115078315],"about_ca_topic_score_codex":0.00005748258,"about_ca_topic_score_gemma":0.0000952218,"teacher_disagreement_score":0.8465047,"about_ca_system_score_codex":0.0007964389,"about_ca_system_score_gemma":0.00074900064,"threshold_uncertainty_score":0.9998115},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025790556,0.0004388248,0.99199677,0.0014072533,0.0017756509,0.00052122725,0.0000031813117,0.00020157648,0.0036297499],"genre_scores_gemma":[0.12031947,0.00004803979,0.87109244,0.0019936173,0.0013802717,0.00005417121,0.00008306147,0.00006840879,0.004960494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634564,0.00008385849,0.00055715337,0.0015501776,0.0007221547,0.00074101577],"domain_scores_gemma":[0.99687064,0.0011750587,0.00046660626,0.0007685898,0.0005504406,0.00016869149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012719132,0.0004502046,0.0005272316,0.00039183427,0.00058133085,0.0008309341,0.001678651,0.00029208144,0.000032803637],"category_scores_gemma":[0.00038676767,0.00045408387,0.00020544129,0.0006879538,0.00037933604,0.0004589254,0.0005246262,0.00090636977,0.000030084864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012604287,0.000020352063,0.00011788496,0.00003408855,0.000024691893,0.000031757427,0.0008698822,0.15519884,0.00032086897,0.14294173,0.00010837993,0.70031893],"study_design_scores_gemma":[0.0005063041,0.00014961683,0.0005414034,0.00032917032,0.000011611813,0.00002526101,0.0000014891109,0.9386202,0.00010791639,0.036977593,0.022137137,0.00059226854],"about_ca_topic_score_codex":0.0000047050257,"about_ca_topic_score_gemma":0.000052294923,"teacher_disagreement_score":0.7834214,"about_ca_system_score_codex":0.00023656138,"about_ca_system_score_gemma":0.0005478327,"threshold_uncertainty_score":0.9997911},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038036896,0.00028204347,0.9870177,0.009546824,0.0009559469,0.00093385077,0.000016286001,0.00022704656,0.0006399539],"genre_scores_gemma":[0.27773094,0.000005656574,0.7189695,0.0026198716,0.00038258993,0.00013202305,0.000009122543,0.000030351766,0.00011990653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956892,0.00003729957,0.00063239917,0.0020046672,0.00080907694,0.0008273412],"domain_scores_gemma":[0.99622494,0.0009822424,0.00035547485,0.0018367878,0.00041972086,0.00018081679],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001203971,0.00055939035,0.0006522591,0.00065495825,0.0005564603,0.00034810408,0.002713,0.0006765345,0.00002235338],"category_scores_gemma":[0.0003507647,0.0005576981,0.00022345487,0.0008290487,0.00092060724,0.00008623019,0.0008188538,0.0010894164,0.000009346505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011956172,0.00015315917,0.000020037362,0.00007758148,0.000017421975,0.000112556874,0.00026902906,0.006921871,0.00019697085,0.69950014,0.00021589539,0.29250336],"study_design_scores_gemma":[0.0004158187,0.00017992193,0.000020290428,0.00019400647,0.00001575877,0.00005868187,2.2648163e-7,0.66988677,0.0033419367,0.32222354,0.0030837443,0.00057926687],"about_ca_topic_score_codex":0.000007436117,"about_ca_topic_score_gemma":0.00006682453,"teacher_disagreement_score":0.66296494,"about_ca_system_score_codex":0.0003367503,"about_ca_system_score_gemma":0.0018884349,"threshold_uncertainty_score":0.99968743},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035070836,0.0006047255,0.9926533,0.0006153329,0.0011563089,0.00028505293,0.000015206934,0.0001927636,0.00444225],"genre_scores_gemma":[0.4630899,0.000492596,0.5302009,0.0031218755,0.00067470304,0.000039680537,0.0003347105,0.000058928636,0.0019866717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962667,0.0000668349,0.0005736755,0.0016094686,0.0009621684,0.0005211492],"domain_scores_gemma":[0.9974949,0.0005441158,0.00041821855,0.00096469885,0.00042029942,0.00015780937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004673532,0.000446115,0.00042677324,0.0003881526,0.00033176606,0.0008334972,0.0017220026,0.00033356753,0.00021962168],"category_scores_gemma":[0.00017090472,0.00044178,0.00010840723,0.00065416074,0.0006037987,0.00077843206,0.000897449,0.0008502147,0.0000158681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033542676,0.000026445727,0.0002862831,0.000020029564,0.000020427615,0.00004201601,0.00019623607,0.22414806,0.0000731909,0.021150704,0.00028201877,0.7537512],"study_design_scores_gemma":[0.00023613404,0.00006065338,0.00030620495,0.00042431377,0.0000068806885,0.000080085825,3.3762097e-7,0.95048004,0.0004530474,0.04644205,0.0009206696,0.00058957783],"about_ca_topic_score_codex":0.000020167014,"about_ca_topic_score_gemma":0.00009063119,"teacher_disagreement_score":0.75316167,"about_ca_system_score_codex":0.0002010454,"about_ca_system_score_gemma":0.000632887,"threshold_uncertainty_score":0.9998034},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005199043,0.00011110488,0.9949297,0.00044031916,0.002337371,0.0002868086,0.0000018693744,0.00026984682,0.0011030863],"genre_scores_gemma":[0.6918309,0.000041396037,0.3022526,0.0011288247,0.00122925,0.000029337834,0.000032148684,0.00008888126,0.0033666783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955516,0.000037670183,0.0006672255,0.0019684732,0.0010857165,0.0006893317],"domain_scores_gemma":[0.99757344,0.00027308374,0.00030672207,0.0013118522,0.00029486665,0.00024002083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013957669,0.00051280286,0.000685048,0.0041741743,0.00046444367,0.00090475334,0.0020171416,0.00022703294,0.000036527897],"category_scores_gemma":[0.000051462102,0.0005049133,0.00043755714,0.00449478,0.00013577113,0.00045335235,0.0015467893,0.0004987991,0.00039189088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031538282,0.000033587912,0.00014799842,0.000018990782,0.00024737365,0.000031626816,0.003350583,0.18074213,0.0004795133,0.002096557,0.000035784946,0.8128127],"study_design_scores_gemma":[0.00014852872,0.00008910202,0.00079742796,0.00018255437,0.00013822936,0.0000062071867,0.0000013933703,0.9853431,0.0033922368,0.008669414,0.0005839782,0.00064782414],"about_ca_topic_score_codex":0.000046343604,"about_ca_topic_score_gemma":0.00024530917,"teacher_disagreement_score":0.8121649,"about_ca_system_score_codex":0.00048345185,"about_ca_system_score_gemma":0.00018372115,"threshold_uncertainty_score":0.99974024},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005059235,0.00067085394,0.98645204,0.005503265,0.0024833085,0.00061275315,0.000008751327,0.00026437864,0.0034986944],"genre_scores_gemma":[0.14121567,0.00014423775,0.8357987,0.020840801,0.0014060737,0.00003788699,0.00002505231,0.00009373798,0.00043786003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941738,0.00013167084,0.0006905121,0.0022564763,0.0014833176,0.0012641815],"domain_scores_gemma":[0.9949668,0.0011256072,0.00071139046,0.002248568,0.00051824626,0.0004293981],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001344634,0.00073332904,0.00065670843,0.0012534382,0.0007835844,0.0017614531,0.0051856665,0.00036004104,0.000050871462],"category_scores_gemma":[0.00016688737,0.00068532984,0.00018268308,0.0014895546,0.0002173814,0.0015518909,0.0036235806,0.0011133603,0.00015644712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033785946,0.00016600006,0.00019084956,0.00028060228,0.00009960735,0.0011046036,0.011583971,0.24772295,0.0021055792,0.082071014,0.00009377504,0.6545473],"study_design_scores_gemma":[0.0013436151,0.0016495502,0.0015202378,0.006490039,0.00016005572,0.0023349668,0.000023505178,0.70196795,0.02958831,0.1996209,0.049293853,0.0060070236],"about_ca_topic_score_codex":0.0004122229,"about_ca_topic_score_gemma":0.0011836913,"teacher_disagreement_score":0.64854026,"about_ca_system_score_codex":0.00024409703,"about_ca_system_score_gemma":0.001160785,"threshold_uncertainty_score":0.99955976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13801563,0.0003439549,0.85496277,0.0004758594,0.002411655,0.0020071494,0.00005014358,0.0001570712,0.0015757581],"genre_scores_gemma":[0.99219227,0.000035864305,0.005195765,0.0015775253,0.00025956222,0.000059062804,0.0000054584507,0.000051017498,0.00062350265],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9964912,0.00012417171,0.00037233948,0.0018182524,0.0006092515,0.0005847982],"domain_scores_gemma":[0.99801964,0.00084463094,0.00021683885,0.00062224246,0.0001633876,0.00013325721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034717412,0.00057985017,0.0006965399,0.0005247691,0.00026831232,0.00022803195,0.0007046558,0.0002739622,0.000039790408],"category_scores_gemma":[0.0003384396,0.00044200596,0.00011377335,0.00043535623,0.0009329335,0.0003938273,0.00044086348,0.0008048882,0.000011076471],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014404946,0.00056189514,0.0012613492,0.00050254585,0.00003875394,0.0008892626,0.01264119,0.06664059,0.12360433,0.0060933405,0.00001684603,0.7863094],"study_design_scores_gemma":[0.012805354,0.023307743,0.025532706,0.0064429333,0.00022321334,0.0012047911,0.000075344775,0.16089804,0.5607775,0.17353249,0.024330141,0.01086974],"about_ca_topic_score_codex":0.000011311558,"about_ca_topic_score_gemma":0.000358793,"teacher_disagreement_score":0.85417664,"about_ca_system_score_codex":0.00035384027,"about_ca_system_score_gemma":0.00024361917,"threshold_uncertainty_score":0.9998032},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009442334,0.003785327,0.9809178,0.00087576616,0.0040295706,0.00054196996,0.000026728763,0.00035211304,0.000028384591],"genre_scores_gemma":[0.3636517,0.000065455744,0.6347298,0.0011976968,0.00025947337,0.000032570228,0.000046632314,0.000016288595,3.935708e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99320465,0.00023408968,0.00066752656,0.003333171,0.0013350028,0.0012255448],"domain_scores_gemma":[0.99464554,0.00040734315,0.00033416713,0.0038731557,0.0003952504,0.00034452698],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016539323,0.00074107636,0.000786651,0.0008890027,0.0004386099,0.0023548247,0.008195901,0.0006804488,0.000026565715],"category_scores_gemma":[0.0003485291,0.00070779875,0.00034353838,0.0045819497,0.0006796218,0.0014750927,0.012034414,0.0027129622,0.000014030617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025353023,0.0014597786,0.0054857056,0.00068746804,0.000097386255,0.00094587007,0.009378486,0.06668444,0.009887226,0.009717566,0.0002556654,0.8953751],"study_design_scores_gemma":[0.00055039115,0.00011162013,0.0035770684,0.00064381317,0.000010882656,0.0000669085,0.000002806638,0.95789033,0.006282111,0.029311942,0.00042252577,0.0011295865],"about_ca_topic_score_codex":0.00035666444,"about_ca_topic_score_gemma":0.001136986,"teacher_disagreement_score":0.89424545,"about_ca_system_score_codex":0.00022390661,"about_ca_system_score_gemma":0.0008681044,"threshold_uncertainty_score":0.99958783},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002755574,0.0013038034,0.9957896,0.0009261806,0.00031516122,0.00037691844,0.0000139008425,0.0000867589,0.00091215107],"genre_scores_gemma":[0.10186005,0.00034909384,0.89195395,0.0051478804,0.0005369871,0.00004972754,0.000017242042,0.000030683583,0.00005437384],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974121,0.000024965808,0.00030012004,0.0014933965,0.00037238622,0.00039703603],"domain_scores_gemma":[0.9980629,0.00033241624,0.000107309614,0.0010950473,0.00013955949,0.00026273067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005551945,0.00032618956,0.00034245744,0.0005283259,0.00032127503,0.00087169476,0.0012930899,0.00016201173,0.0000067691376],"category_scores_gemma":[0.000045056346,0.00031787122,0.000051609073,0.0007526823,0.00046703615,0.0004594121,0.0020745776,0.00044388862,0.0000072257853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021768094,0.000017337823,0.00018136075,0.000045635334,0.000007447261,0.000041427393,0.0005955786,0.00036540715,0.00026062346,0.20732541,0.000024392557,0.7911332],"study_design_scores_gemma":[0.00070566696,0.000402924,0.0063325544,0.00096290576,0.000039271898,0.00048097695,0.0000021941194,0.103822716,0.0026915935,0.7939198,0.08790157,0.0027378194],"about_ca_topic_score_codex":0.000021421823,"about_ca_topic_score_gemma":0.0001394872,"teacher_disagreement_score":0.7883954,"about_ca_system_score_codex":0.000045349956,"about_ca_system_score_gemma":0.00018249813,"threshold_uncertainty_score":0.99992734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06982632,0.0017673145,0.92592907,0.000084513056,0.0006431295,0.0008964247,0.0007374769,0.000016798273,0.000098954406],"genre_scores_gemma":[0.90693253,0.0001879881,0.091074206,0.000045314333,0.00013807397,0.000010557778,0.0015910002,0.000011980194,0.000008336319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712855,0.00013248542,0.00066367805,0.0009153838,0.0010038102,0.00015609685],"domain_scores_gemma":[0.99742466,0.00023760699,0.0006393506,0.0006841284,0.0008430905,0.00017113324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012944299,0.00024135769,0.00060131424,0.00025981854,0.00006284682,0.00003851565,0.0002069719,0.00012373451,0.000029383044],"category_scores_gemma":[0.00021935486,0.00021692543,0.00007830993,0.00024049553,0.00045269326,0.0002736972,0.00024271112,0.00022618764,8.4047116e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012069082,0.00020423821,0.009081925,0.00009635647,0.00013522542,0.000024769912,0.00006359162,0.0020834638,0.00004345954,0.00030267818,0.0000035243402,0.98784006],"study_design_scores_gemma":[0.0028336628,0.00030773255,0.05398155,0.0013932183,0.00079119136,0.000036869737,0.0000023008486,0.9178633,0.0005637079,0.021924498,0.00009585525,0.00020607583],"about_ca_topic_score_codex":0.000020677362,"about_ca_topic_score_gemma":0.000038672053,"teacher_disagreement_score":0.987634,"about_ca_system_score_codex":0.00022251562,"about_ca_system_score_gemma":0.0012533847,"threshold_uncertainty_score":0.8845962},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017303772,0.00017993075,0.97778106,0.00086238177,0.003913822,0.0004189116,0.0000154708,0.00020860454,0.014889442],"genre_scores_gemma":[0.6001918,0.00008963057,0.2876569,0.08309316,0.007773554,0.000051337665,0.000032103537,0.00026319028,0.020848349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639845,0.000084411346,0.00065463583,0.0007735612,0.001071755,0.0010171587],"domain_scores_gemma":[0.9966682,0.0017374149,0.00034532044,0.00093890727,0.00007992185,0.0002302037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008785228,0.00052734016,0.00049745536,0.0007329651,0.0002519994,0.0005244567,0.0027018622,0.0003345756,0.00005928423],"category_scores_gemma":[0.00050737464,0.00044171468,0.0001245804,0.0008667425,0.0011036096,0.0007973054,0.0011778631,0.0011035939,0.00027713645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000152932,0.00012789604,0.00012507377,0.00027717813,0.000007804564,0.00007227279,0.008283426,0.022319507,0.0058539803,0.0021721094,0.007761247,0.9529842],"study_design_scores_gemma":[0.0012066324,0.0007124563,0.00021798539,0.0018525597,0.000030226067,0.0008831833,0.0000019754382,0.42324716,0.23609242,0.09066312,0.24145335,0.003638948],"about_ca_topic_score_codex":0.00000432384,"about_ca_topic_score_gemma":0.000011256058,"teacher_disagreement_score":0.9493453,"about_ca_system_score_codex":0.00034085035,"about_ca_system_score_gemma":0.0006915833,"threshold_uncertainty_score":0.9998035},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029226812,0.0011501559,0.9850326,0.0024170305,0.002168308,0.0003269401,0.0000020912937,0.0001250469,0.0087486],"genre_scores_gemma":[0.11912619,0.00037792342,0.8672969,0.0042089187,0.0020414174,0.00009050026,0.000035164932,0.00008277103,0.0067402227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966984,0.00005694057,0.0004331007,0.0010705797,0.0012224304,0.00051855796],"domain_scores_gemma":[0.99774456,0.0007726451,0.0002680443,0.00092918676,0.00017859822,0.00010697068],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014387529,0.0003349372,0.0002471563,0.0005216473,0.0013019947,0.0008537849,0.0031282112,0.00011307299,0.000045384822],"category_scores_gemma":[0.00006945569,0.0002638482,0.000110049274,0.0008846096,0.00030948984,0.00053496216,0.0017925919,0.00082429405,0.000030039622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025398112,0.0000082570805,0.0000046981168,0.0000062544373,0.0000056459867,0.00001987251,0.00027587498,0.16785973,0.000059005168,0.15958548,0.000047858986,0.6721248],"study_design_scores_gemma":[0.00015787619,0.00016823747,0.000050733004,0.000064965534,0.000004747181,0.0001008061,1.7929415e-7,0.5671863,0.00040830765,0.3358366,0.095536664,0.00048460462],"about_ca_topic_score_codex":0.000013881937,"about_ca_topic_score_gemma":0.000035693756,"teacher_disagreement_score":0.67164016,"about_ca_system_score_codex":0.0003174434,"about_ca_system_score_gemma":0.0006763831,"threshold_uncertainty_score":0.99999815},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013877517,0.0005566516,0.983006,0.00043037735,0.00029626422,0.00037760678,0.000010482048,0.000110651294,0.0013344763],"genre_scores_gemma":[0.9010459,0.000051832907,0.098176494,0.0005250139,0.000104881176,0.0000054916077,0.0000036163408,0.000027449702,0.00005932922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645454,0.000041999254,0.00053075334,0.001529714,0.000905688,0.00053731794],"domain_scores_gemma":[0.9969645,0.0008181532,0.00031442693,0.0013473472,0.00034910988,0.00020643644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005452052,0.0005164863,0.0006935396,0.00061879266,0.00022291225,0.0007281265,0.0018001029,0.00024095712,0.000016534763],"category_scores_gemma":[0.0001285882,0.00045979966,0.00012204543,0.0006240508,0.00050405395,0.0012875055,0.0013871245,0.0008625218,0.000004156312],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006624051,0.00028686645,0.011676008,0.0016541976,0.00016384044,0.0009332851,0.028287692,0.024473667,0.0025718247,0.08285863,0.000013542187,0.8470142],"study_design_scores_gemma":[0.004358247,0.0029678494,0.039039526,0.018509602,0.00021787547,0.0017453321,0.000030074289,0.73085546,0.01206298,0.1805445,0.0025729572,0.0070956014],"about_ca_topic_score_codex":0.00010882395,"about_ca_topic_score_gemma":0.00032742982,"teacher_disagreement_score":0.88716835,"about_ca_system_score_codex":0.00025570055,"about_ca_system_score_gemma":0.00087762147,"threshold_uncertainty_score":0.99978536},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042015244,0.0002488115,0.99067754,0.00066122564,0.0015752445,0.00052081904,0.000007939795,0.000122638,0.005765647],"genre_scores_gemma":[0.391875,0.000037164264,0.60458064,0.0020055997,0.00065882376,0.00006795961,0.000094604926,0.000056316112,0.0006238995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961702,0.00008002936,0.0006954653,0.0013915739,0.001178338,0.0004843943],"domain_scores_gemma":[0.99757797,0.0009747597,0.0002944748,0.0008915278,0.00014757813,0.000113668895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012913723,0.00041427568,0.0004327786,0.0017691138,0.00039607123,0.00037461592,0.0017845978,0.00017759654,0.00012129098],"category_scores_gemma":[0.0001818861,0.00042290115,0.000110666144,0.0018041324,0.00015665659,0.0005318721,0.0007664241,0.00090100284,0.00002650645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051677243,0.00006537255,0.000031104646,0.000013321618,0.00000550643,0.00007658592,0.0005361784,0.45971823,0.000074561845,0.16642173,0.000021546846,0.3730307],"study_design_scores_gemma":[0.0002729473,0.00014531307,0.00011653775,0.00011249764,0.0000032225184,0.00002567026,1.8587932e-7,0.7728683,0.00022043163,0.22427131,0.0015635,0.00040007583],"about_ca_topic_score_codex":0.00001481121,"about_ca_topic_score_gemma":0.000044326058,"teacher_disagreement_score":0.39145485,"about_ca_system_score_codex":0.0004671667,"about_ca_system_score_gemma":0.0005815723,"threshold_uncertainty_score":0.99982226},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006107683,0.00071137125,0.9807034,0.0001734907,0.00097395,0.00017458826,0.0000042061733,0.000117280615,0.017080631],"genre_scores_gemma":[0.41562358,0.0002719654,0.57354313,0.0045741647,0.0017282277,0.00005687706,0.000029875604,0.00026829523,0.0039038956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881434,0.000003069779,0.00020777,0.0003977573,0.00025778843,0.00031929466],"domain_scores_gemma":[0.9991957,0.00013299636,0.00003610464,0.00048426818,0.00006573693,0.000085193984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014783794,0.00025091978,0.00022495408,0.00020882604,0.00013889343,0.00019638352,0.00052243617,0.0001754264,0.00005224784],"category_scores_gemma":[0.000014272377,0.00024869788,0.00004915446,0.00025459874,0.000188897,0.000083712264,0.00008369461,0.00042034755,0.000071998635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.8658197e-7,0.000007115339,0.000020165155,0.00003923421,0.000008416855,0.0000062023164,0.0001595942,0.9255222,0.000333094,0.0047006193,0.00032803038,0.06887495],"study_design_scores_gemma":[0.00021324752,0.00004103728,0.000050271305,0.00024972612,0.000018612885,0.000033884666,2.293185e-7,0.8383269,0.0055830753,0.06267077,0.09193146,0.0008808069],"about_ca_topic_score_codex":0.0000070123547,"about_ca_topic_score_gemma":0.000031659813,"teacher_disagreement_score":0.41556248,"about_ca_system_score_codex":0.00011763987,"about_ca_system_score_gemma":0.000054030315,"threshold_uncertainty_score":0.99999654},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012272281,0.0017760252,0.9757748,0.0007698035,0.0036249885,0.0003550446,0.000018145858,0.00010928951,0.016344631],"genre_scores_gemma":[0.8653422,0.00054899324,0.10081652,0.007817782,0.0032457912,0.00008626162,0.00064403616,0.00022947144,0.021268927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771255,0.00006130076,0.0003610335,0.0010647426,0.000423879,0.00037650502],"domain_scores_gemma":[0.9986362,0.00018820568,0.00015448158,0.00068470894,0.00022578744,0.00011065248],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003414583,0.0003209643,0.00030575064,0.00046494554,0.00016175098,0.00011988216,0.0005128127,0.00047629702,0.0014570792],"category_scores_gemma":[0.000052195028,0.0003081064,0.00012322029,0.0003024749,0.0003948574,0.00012601879,0.00016190739,0.0006934664,0.00033119856],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008576566,0.00008104258,0.00027508126,0.000022483058,0.000017655446,0.000030483934,0.000899813,0.0004261354,0.0005886255,0.0049446234,0.000063476975,0.992642],"study_design_scores_gemma":[0.0066463347,0.001048361,0.034855265,0.0026264337,0.00023140156,0.00063360605,0.000034955745,0.5470284,0.0029000975,0.09413117,0.30396593,0.005898009],"about_ca_topic_score_codex":0.000038387243,"about_ca_topic_score_gemma":0.00014571629,"teacher_disagreement_score":0.986744,"about_ca_system_score_codex":0.00012196882,"about_ca_system_score_gemma":0.0001716648,"threshold_uncertainty_score":0.9999371},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019121177,0.0014477335,0.9939037,0.0014960448,0.0018205087,0.00072183396,0.000043485314,0.00013941046,0.0004081509],"genre_scores_gemma":[0.0063465666,0.000021949201,0.9906985,0.001731241,0.00071902137,0.00004955884,0.000031678337,0.000048646547,0.00035282256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960068,0.000047185804,0.0004960967,0.0017212935,0.00089837564,0.0008302881],"domain_scores_gemma":[0.9960789,0.0019525031,0.00031470926,0.0012476391,0.00022066945,0.00018557577],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011035036,0.00061322574,0.00057366333,0.00033919138,0.0006230273,0.001198662,0.002644328,0.00029108362,0.0000046188698],"category_scores_gemma":[0.000118793665,0.00044859565,0.00014280782,0.00040119025,0.00063478254,0.00042677057,0.0010956014,0.0008552305,0.000004651197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008643316,0.000011180755,0.000069342685,0.00006574974,0.000018707156,0.00019563745,0.0007417103,0.8350994,0.000029261753,0.0023680478,0.00009848109,0.16129382],"study_design_scores_gemma":[0.00043681875,0.00020440578,0.00012996183,0.00079257414,0.000018512968,0.00013332217,6.188586e-7,0.9900419,0.00019894334,0.005625482,0.0018076537,0.00060979486],"about_ca_topic_score_codex":0.000015282534,"about_ca_topic_score_gemma":0.0000035735118,"teacher_disagreement_score":0.16068403,"about_ca_system_score_codex":0.00014660557,"about_ca_system_score_gemma":0.00066289643,"threshold_uncertainty_score":0.9998382},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26385742,0.00021645578,0.735401,0.0003074927,0.000055651017,0.000096917356,1.5556718e-7,0.000046887068,0.000018058776],"genre_scores_gemma":[0.90006846,0.000005723417,0.097287185,0.0024279286,0.00019205085,0.000007232126,0.0000031437846,0.0000081713115,1.2015286e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890643,0.0000056495624,0.00016209352,0.00049682683,0.00016759466,0.00026142906],"domain_scores_gemma":[0.99954575,0.00001087811,0.000052254054,0.00020761183,0.00015025093,0.000033242028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035332248,0.00012014297,0.0001648093,0.00031115726,0.00032614832,0.00030065037,0.00024782226,0.00003267618,0.0000021623425],"category_scores_gemma":[0.000021967777,0.00010890933,0.000011206361,0.0010437515,0.00006766238,0.00079797837,0.00021550096,0.00009393071,0.0000038739745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008154413,0.000017304967,0.0042979056,0.00008713582,0.0000015270142,6.7869763e-7,0.0017577237,0.36600578,0.000115277646,0.00012585589,5.7580456e-7,0.6275821],"study_design_scores_gemma":[0.00010139574,0.000009357908,0.0007431705,0.000058835274,0.00000495957,9.541195e-7,0.000017789858,0.99647427,0.000039926254,0.0023975514,0.00001560146,0.00013617652],"about_ca_topic_score_codex":0.0017876022,"about_ca_topic_score_gemma":0.00054062845,"teacher_disagreement_score":0.63811374,"about_ca_system_score_codex":0.000025692869,"about_ca_system_score_gemma":0.00003424926,"threshold_uncertainty_score":0.44411933},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033863584,0.010910628,0.98229223,0.00063925167,0.0034734367,0.0003176146,0.00001924497,0.00034157693,0.001667387],"genre_scores_gemma":[0.0997196,0.00023705888,0.8943434,0.002416385,0.0016764066,0.000013517685,0.00022044586,0.000082213905,0.0012910026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99375707,0.00014736896,0.0007706938,0.0034241758,0.0009057365,0.0009949378],"domain_scores_gemma":[0.9924222,0.0007013254,0.00033690972,0.0056384755,0.0005574367,0.00034365564],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013495209,0.00088674016,0.00088345126,0.0007946924,0.00046698496,0.002985101,0.010993148,0.00061882386,0.000027745522],"category_scores_gemma":[0.00045350558,0.0007479899,0.00016671671,0.0010349272,0.0008047782,0.0019830007,0.0066349134,0.0014638909,0.00003821081],"study_design_candidate":"design_other","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.0000050612343,0.00007632204,0.000042711497,0.00013084168,0.000023884215,0.0010392098,0.006254468,0.0015350848,0.0003056847,0.020690706,0.000059692546,0.96983635],"study_design_scores_gemma":[0.00039686836,0.00028423412,0.00008862677,0.0029426753,0.00002874853,0.0007332027,0.0000046498126,0.91981626,0.0035107725,0.06289105,0.007486016,0.0018169095],"about_ca_topic_score_codex":0.000515026,"about_ca_topic_score_gemma":0.025967877,"teacher_disagreement_score":0.9680194,"about_ca_system_score_codex":0.00038064938,"about_ca_system_score_gemma":0.001774954,"threshold_uncertainty_score":0.9994971},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045288117,0.00061992556,0.99255407,0.00015035833,0.0009729315,0.0005061119,0.0000013673605,0.00038131513,0.0002850954],"genre_scores_gemma":[0.7810515,0.000029950248,0.21812549,0.00047969504,0.00023361837,0.000014928937,0.000002815379,0.000026479098,0.000035529883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635893,0.000063065236,0.0004825306,0.0017141161,0.00076324726,0.00061809516],"domain_scores_gemma":[0.9974499,0.00044153637,0.0003507924,0.0012872419,0.00029339525,0.00017715292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009487455,0.0005472836,0.0005876912,0.00042120216,0.00038679506,0.00061434193,0.001348402,0.00043158807,0.000003126634],"category_scores_gemma":[0.000026648011,0.0004284491,0.000098712815,0.00064093166,0.00042353207,0.00087550766,0.0006261216,0.000833519,0.0000021377477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015371397,0.00002584448,0.00028982275,0.00011767013,0.000016933927,0.000055265005,0.00066419353,0.80592966,0.00002973112,0.00073084625,6.8624195e-7,0.19212398],"study_design_scores_gemma":[0.00036875304,0.0002753724,0.00054385525,0.0005763595,0.000014142546,0.0001400454,3.0483093e-7,0.98436415,0.00038159548,0.012723136,0.0000510306,0.00056125515],"about_ca_topic_score_codex":0.000058811034,"about_ca_topic_score_gemma":0.0002128559,"teacher_disagreement_score":0.7765227,"about_ca_system_score_codex":0.00026719912,"about_ca_system_score_gemma":0.0006280883,"threshold_uncertainty_score":0.9998167},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001665933,0.00039932958,0.9965422,0.000047689107,0.0007226,0.00006652934,0.00001126877,0.00013349351,0.00041094908],"genre_scores_gemma":[0.9807908,0.00007587323,0.017988198,0.000216139,0.00057103165,0.000002650837,0.0002467374,0.000038732298,0.000069839916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984231,0.0000309443,0.00033913224,0.00043890884,0.00048208013,0.00028585852],"domain_scores_gemma":[0.99925077,0.0001603849,0.00008992557,0.00028275925,0.00009937884,0.00011675397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037758177,0.00023354866,0.00038776518,0.00023857204,0.00009285006,0.00008597823,0.00031458362,0.00019691829,0.00005859358],"category_scores_gemma":[0.000030158362,0.00022767913,0.00008529656,0.00021755262,0.00019560734,0.00009269805,0.000054975288,0.000699448,0.0000025053655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016321616,0.000009218768,0.00008671547,0.000041998475,0.000011323647,0.000010936318,0.00006324166,0.8560114,0.0024349377,0.00002581081,0.00006552643,0.14123724],"study_design_scores_gemma":[0.00015362541,0.00005711184,0.00006730809,0.0002982986,0.000024579822,0.000014300492,2.339722e-7,0.9967662,0.0010877063,0.00029328794,0.0010417535,0.00019556643],"about_ca_topic_score_codex":0.000036495985,"about_ca_topic_score_gemma":0.00002738085,"teacher_disagreement_score":0.97912484,"about_ca_system_score_codex":0.00009309299,"about_ca_system_score_gemma":0.00006636086,"threshold_uncertainty_score":0.92844856},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058800477,0.00069340935,0.99162877,0.003202636,0.0020274557,0.0008484514,0.00004593522,0.00024818967,0.00071714853],"genre_scores_gemma":[0.21527363,0.000038835507,0.7785984,0.004627961,0.0004325238,0.000093858675,0.000027114556,0.00007765,0.0008300091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945462,0.000044990273,0.00079327036,0.0023454241,0.0014551556,0.00081495714],"domain_scores_gemma":[0.99619305,0.0005307152,0.0006203821,0.00219201,0.00028675754,0.00017705534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010954769,0.0006384559,0.0007051326,0.0007979711,0.0009164667,0.0006245655,0.005097104,0.00024368658,0.000076412594],"category_scores_gemma":[0.00013426038,0.00063879066,0.00020079722,0.00045510547,0.00037802992,0.00069579785,0.0024655089,0.0009798793,0.000010671392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009064251,0.00007149073,0.000076629316,0.00015227667,0.000014289751,0.000050651717,0.0021372424,0.26257277,0.00003862313,0.0790121,0.000105834544,0.65575904],"study_design_scores_gemma":[0.00032718055,0.00017037697,0.000041470346,0.00032068725,0.000008558974,0.00003629767,8.597503e-7,0.8146643,0.00027382062,0.17847784,0.0050534843,0.00062512816],"about_ca_topic_score_codex":0.000080938946,"about_ca_topic_score_gemma":0.00018687508,"teacher_disagreement_score":0.6551339,"about_ca_system_score_codex":0.0006044118,"about_ca_system_score_gemma":0.00043409533,"threshold_uncertainty_score":0.9996063},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008020912,0.00012508535,0.9873099,0.0005638171,0.0009620996,0.00044312136,0.000011962735,0.000112923655,0.002450201],"genre_scores_gemma":[0.9943829,0.0000058808855,0.002663171,0.0014926563,0.0012332245,0.000012568029,0.000061075305,0.00005052119,0.0000980094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683475,0.000047981182,0.0005734731,0.00116159,0.00080045185,0.00058174826],"domain_scores_gemma":[0.9975648,0.00083685736,0.00032415814,0.0009781563,0.00027172687,0.0000243328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015485594,0.00054361066,0.0006109047,0.0007137536,0.0004374154,0.00064230454,0.0011100924,0.00027716867,0.000040675677],"category_scores_gemma":[0.00059143064,0.0004205361,0.00019209724,0.0013603971,0.00039219687,0.0006197109,0.0007588162,0.00096880493,0.000046791214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044562697,0.00004935327,0.00034001266,0.00022891602,0.000031538755,0.00029923813,0.00009213825,0.77763444,0.00017398677,0.15731007,0.000010951976,0.06378477],"study_design_scores_gemma":[0.00015623876,0.000012693061,0.0002083844,0.0021244804,0.000068487505,0.00001151929,0.0000031085617,0.9652104,0.0001414646,0.03000869,0.0014346632,0.0006199178],"about_ca_topic_score_codex":0.00013705366,"about_ca_topic_score_gemma":0.00045440512,"teacher_disagreement_score":0.986362,"about_ca_system_score_codex":0.00072046625,"about_ca_system_score_gemma":0.00013213287,"threshold_uncertainty_score":0.99982464},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002900858,0.00016278734,0.9773791,0.0007408525,0.0013629744,0.00046035228,0.0000019455965,0.00036368505,0.019238256],"genre_scores_gemma":[0.3360343,0.0010174551,0.6502518,0.0033155412,0.002410051,0.00007576006,0.00011842385,0.00025144315,0.006525182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950937,0.00014520489,0.00069730013,0.0017453989,0.0014286989,0.0008896665],"domain_scores_gemma":[0.9966003,0.0012393862,0.00054052216,0.0011768035,0.00019727883,0.00024573744],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011077542,0.0006962152,0.00067099906,0.001093725,0.0014035994,0.00066459423,0.0027485765,0.00029946398,0.00018466746],"category_scores_gemma":[0.000513324,0.00071394135,0.00016365448,0.00075305364,0.00077416847,0.0009810366,0.004215036,0.0018291435,0.000035420377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009562177,0.000009906205,0.00006361353,0.000020438696,0.000019518937,0.000055568995,0.0029200516,0.88422626,0.00012768616,0.018159883,0.00001445699,0.094373055],"study_design_scores_gemma":[0.0004444067,0.00024942643,0.00008462732,0.00014119962,0.000019039499,0.000055235385,0.0000024806989,0.984848,0.000035786044,0.007905551,0.005397792,0.000816447],"about_ca_topic_score_codex":0.00015510448,"about_ca_topic_score_gemma":0.000029886305,"teacher_disagreement_score":0.33574423,"about_ca_system_score_codex":0.0007599688,"about_ca_system_score_gemma":0.0006290473,"threshold_uncertainty_score":0.99989647},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033930995,0.00008073696,0.9574443,0.007803645,0.00033299738,0.00014101322,0.0000041839694,0.0001400072,0.00012212597],"genre_scores_gemma":[0.365911,0.000005198435,0.6331862,0.0006814078,0.00019136773,0.000013885048,0.0000017471727,0.0000041483117,0.0000049961695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979434,0.00005236113,0.0002574377,0.0007013393,0.0005609043,0.0004845308],"domain_scores_gemma":[0.99825776,0.0004418388,0.0001572996,0.0008165917,0.00022636238,0.000100137135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010212248,0.00014807943,0.00015825561,0.0002354281,0.00033916434,0.00072052394,0.0021548646,0.00006668767,0.0000073953966],"category_scores_gemma":[0.00045946075,0.00014087821,0.000027173697,0.0029848595,0.00008582936,0.0015579418,0.0012127724,0.00019301623,0.000037777194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.9757544e-7,0.000052177813,0.0023072688,0.0000029176026,0.000003606895,0.0000033120784,0.00341996,0.025884338,0.001080255,0.00042876083,0.00021539586,0.9666013],"study_design_scores_gemma":[0.00017231434,0.00002953436,0.0043249805,0.00002910997,0.0000014518198,0.0000065376,0.0000019792385,0.9804559,0.009487238,0.003401448,0.0019010367,0.00018851452],"about_ca_topic_score_codex":0.00002356766,"about_ca_topic_score_gemma":0.00004538879,"teacher_disagreement_score":0.9664128,"about_ca_system_score_codex":0.0003444571,"about_ca_system_score_gemma":0.0002671275,"threshold_uncertainty_score":0.6948029},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033381166,0.00025323068,0.9914339,0.00044925243,0.0008804797,0.00038439286,0.0000017900727,0.0002615728,0.0063019795],"genre_scores_gemma":[0.15816024,0.00008924139,0.84019953,0.0008153604,0.00016300037,0.000015859454,0.000006967697,0.00003652328,0.00051324785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967118,0.00004769239,0.0006221176,0.0012942234,0.0007329239,0.0005912273],"domain_scores_gemma":[0.9982264,0.00024403185,0.00034052428,0.00086611777,0.00019224842,0.00013070284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090685044,0.00044463365,0.0004662096,0.0008680756,0.00022953923,0.0005888551,0.002531816,0.00035159275,0.000031573334],"category_scores_gemma":[0.000067448746,0.0004231428,0.00011264416,0.00088888354,0.0005574763,0.00077648356,0.0008069536,0.0008194899,0.00007187437],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007269238,0.000046241064,0.0001675692,0.000034130397,0.000005201964,0.00007460923,0.0011376437,0.0030520612,0.0001266247,0.0503132,0.00001438468,0.9450211],"study_design_scores_gemma":[0.00032114793,0.00017893135,0.0014384009,0.0004138095,0.0000045351653,0.0000490724,1.8112948e-7,0.5611562,0.0029818027,0.43165722,0.0009888329,0.0008098128],"about_ca_topic_score_codex":0.000050237897,"about_ca_topic_score_gemma":0.000032019463,"teacher_disagreement_score":0.94421124,"about_ca_system_score_codex":0.00034371123,"about_ca_system_score_gemma":0.0005041154,"threshold_uncertainty_score":0.999822},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003740852,0.0002247043,0.9948905,0.0012022426,0.0019994054,0.00066978397,0.000029708992,0.0002575462,0.0006886636],"genre_scores_gemma":[0.056768015,0.000013899717,0.9400156,0.0025183177,0.00047084785,0.000023084436,0.00003178265,0.00003240774,0.00012604243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960841,0.00006380043,0.00060763344,0.0011938224,0.0012345004,0.0008161733],"domain_scores_gemma":[0.9971917,0.00041056197,0.00030480477,0.00096775213,0.00070897344,0.00041620486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001311103,0.0004986848,0.0004748005,0.0011077822,0.00042989725,0.00041854923,0.0014600618,0.00027412144,0.00018778784],"category_scores_gemma":[0.00014791239,0.0004962869,0.0001505101,0.00093524385,0.00030724637,0.0005263388,0.00057880994,0.0006433725,0.00011638154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024984615,0.000026347054,0.00006152478,0.0000064158207,0.000008822287,0.000010227701,0.00015190596,0.10616995,0.00020511661,0.003783045,0.000031011812,0.8895431],"study_design_scores_gemma":[0.0003745675,0.0001450249,0.0005285112,0.00017421777,0.00001547123,0.000038953774,9.601641e-8,0.98902476,0.0013786525,0.0062377513,0.0014375406,0.00064445834],"about_ca_topic_score_codex":0.000030185032,"about_ca_topic_score_gemma":0.000040308423,"teacher_disagreement_score":0.8888987,"about_ca_system_score_codex":0.00080730347,"about_ca_system_score_gemma":0.0011469653,"threshold_uncertainty_score":0.9997489},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044384702,0.00011814016,0.996064,0.00030369562,0.0017321095,0.0004974546,0.00000624762,0.00019073121,0.0010432235],"genre_scores_gemma":[0.29203823,0.00007237466,0.7034931,0.00069271796,0.0009940682,0.000042540112,0.000032580145,0.000064856526,0.002569501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973071,0.000040785846,0.0003912826,0.0011056539,0.0006691794,0.0004859869],"domain_scores_gemma":[0.99841017,0.00034757418,0.00033559362,0.00042724947,0.00032238162,0.00015704907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000980126,0.00037287184,0.0003477151,0.0007464896,0.0004674088,0.00050648465,0.0009967369,0.0002583666,0.000016077272],"category_scores_gemma":[0.00015548973,0.0003633789,0.00014196229,0.0002773968,0.0002519744,0.0009444404,0.00039920746,0.0006541112,0.000034953864],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000134966685,0.00004385125,0.000011931018,0.00006497195,0.000021162794,0.000014997138,0.0013809965,0.019295108,0.00029195746,0.027132507,0.00006925953,0.95165974],"study_design_scores_gemma":[0.000716157,0.00035927954,0.00006953073,0.000501766,0.0000145771855,0.000045804518,0.0000036747595,0.75981784,0.0017318532,0.23267236,0.0033760516,0.0006910934],"about_ca_topic_score_codex":0.000005892026,"about_ca_topic_score_gemma":0.00006212664,"teacher_disagreement_score":0.9509687,"about_ca_system_score_codex":0.00096610346,"about_ca_system_score_gemma":0.0004552442,"threshold_uncertainty_score":0.9998818},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008104585,0.0014593524,0.9875798,0.00052260485,0.0005022032,0.0005261204,0.0000055772375,0.00016511853,0.009231125],"genre_scores_gemma":[0.015457297,0.0002964181,0.9815444,0.0017247469,0.0004990905,0.000036104768,0.0000045067804,0.000040887146,0.00039659298],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965677,0.000053828713,0.00051684614,0.0017032537,0.0005396325,0.0006187108],"domain_scores_gemma":[0.9975818,0.00015730351,0.000222004,0.0015609545,0.00019125182,0.00028668513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008454744,0.0005760656,0.0005790783,0.00072272244,0.0003234899,0.00046920404,0.0023905328,0.00047062,0.000015259728],"category_scores_gemma":[0.000023980709,0.0005043154,0.000119679404,0.00048488379,0.00045454217,0.0005164253,0.0012040676,0.00086659985,0.000012702162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026995772,0.000011992277,0.0000035683217,0.000028216065,0.000008831835,0.000015921372,0.00052990194,0.0022630005,0.00008475254,0.3008108,0.00000769228,0.6962326],"study_design_scores_gemma":[0.00014014186,0.00003439911,0.000003698579,0.00010148347,0.000008671113,0.000055894307,2.4285166e-8,0.43793476,0.00011571403,0.5590086,0.002176221,0.00042037782],"about_ca_topic_score_codex":0.000027877528,"about_ca_topic_score_gemma":0.00003437193,"teacher_disagreement_score":0.6958122,"about_ca_system_score_codex":0.000091615424,"about_ca_system_score_gemma":0.00033558402,"threshold_uncertainty_score":0.99974084},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001522955,0.00013668604,0.9931193,0.0008371838,0.002043761,0.00033548716,0.0000012928292,0.00010562843,0.0018977136],"genre_scores_gemma":[0.11428674,0.000028845361,0.8793785,0.0022084594,0.0011136961,0.0000102404565,0.000012087558,0.000046816698,0.0029146036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624443,0.00004507488,0.00054805924,0.0013201691,0.0012046279,0.0006376219],"domain_scores_gemma":[0.99788755,0.0002458997,0.0004646652,0.00089559343,0.0003087257,0.00019757167],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010077441,0.00041621318,0.0004980313,0.0009654956,0.00029606096,0.0012637549,0.0017786751,0.00030187136,0.00009253921],"category_scores_gemma":[0.00009632157,0.0003968319,0.00016765196,0.00091885845,0.00009183674,0.0008784706,0.00088605774,0.00044258602,0.00024082992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026118942,0.000037019683,0.0006358468,0.000017223112,0.000038519567,0.00001303186,0.0014147742,0.06869301,0.0013005425,0.007832229,0.00020217779,0.91981304],"study_design_scores_gemma":[0.00022945405,0.00010119948,0.00044070266,0.0004067491,0.00001948327,0.000009523417,6.741756e-7,0.961533,0.0021265976,0.03222756,0.0021563855,0.00074864],"about_ca_topic_score_codex":0.00006664669,"about_ca_topic_score_gemma":0.000037575006,"teacher_disagreement_score":0.91906434,"about_ca_system_score_codex":0.00084746914,"about_ca_system_score_gemma":0.00026207571,"threshold_uncertainty_score":0.99984837},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012756559,0.0003054486,0.9954447,0.00083689427,0.0010746005,0.0005926084,0.00017691505,0.00016693777,0.001400623],"genre_scores_gemma":[0.00016689187,0.00003531675,0.99695694,0.0015075488,0.0004066465,0.000082240425,0.000041734176,0.000040086783,0.0007625717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963667,0.000013282657,0.00051408075,0.0017470982,0.00064762693,0.0007112599],"domain_scores_gemma":[0.99732774,0.0004627295,0.0002705925,0.0014806284,0.00028183314,0.00017647211],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007157284,0.0005048245,0.0004534235,0.00054214016,0.00046667334,0.0005817367,0.0030215967,0.0002588614,0.000014516876],"category_scores_gemma":[0.00007085749,0.0004982128,0.0001535563,0.0004469181,0.0005223915,0.00065884157,0.000997011,0.00052279036,0.00003725099],"study_design_candidate":"design_other","study_design_consensus":null,"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.306704e-7,0.000045779598,0.000002832698,0.000023511075,0.0000113999195,0.000008895599,0.00014399688,0.0028760561,0.0001363676,0.0042578857,0.000455975,0.99203634],"study_design_scores_gemma":[0.00033954476,0.00009386264,0.000047086574,0.00020897118,0.000008410973,0.00010863201,1.947772e-7,0.9406794,0.0005561264,0.025241412,0.03206416,0.00065221917],"about_ca_topic_score_codex":0.000016588023,"about_ca_topic_score_gemma":0.0000076083106,"teacher_disagreement_score":0.99138415,"about_ca_system_score_codex":0.00027582693,"about_ca_system_score_gemma":0.00037504887,"threshold_uncertainty_score":0.999747},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024719149,0.00031809474,0.9693558,0.003980334,0.0009851608,0.00031506363,0.0000017037978,0.0001647019,0.00015994116],"genre_scores_gemma":[0.4933744,0.000015861806,0.50590855,0.00064613676,0.00004637735,0.0000036715187,0.0000014778981,0.0000033678382,1.5385575e-7],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659544,0.00054146606,0.0005473176,0.0010414216,0.0005587488,0.0007156306],"domain_scores_gemma":[0.99726623,0.0008013507,0.00015755133,0.0014467033,0.00014279527,0.00018539024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029183263,0.00031487306,0.00046828025,0.000662566,0.00048406576,0.00058722595,0.0031858836,0.00012448433,0.000006416858],"category_scores_gemma":[0.00023946365,0.00031204283,0.000066684115,0.0033384643,0.001589217,0.0011134046,0.0012812573,0.0007052406,0.000003687832],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011987769,0.00025689605,0.0022292868,0.000010837974,0.0000027724943,0.000010752718,0.0017869748,0.0017697102,0.0006341304,0.21562746,0.0000056728195,0.7776535],"study_design_scores_gemma":[0.00045783512,0.00011381189,0.05457745,0.000042185013,0.0000010310163,0.000026309664,0.0000010815257,0.4335062,0.0012954803,0.5097238,0.000033512333,0.00022134844],"about_ca_topic_score_codex":0.00026045798,"about_ca_topic_score_gemma":0.00029532897,"teacher_disagreement_score":0.7774322,"about_ca_system_score_codex":0.00017920343,"about_ca_system_score_gemma":0.00015310344,"threshold_uncertainty_score":0.9999332},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124629565,0.00006985157,0.8725919,0.0020516375,0.0003190782,0.00022673479,0.0000010080869,0.0000994524,0.000010791939],"genre_scores_gemma":[0.532844,0.0000064161727,0.46562067,0.0015035147,0.000020532068,0.0000027896033,4.0857338e-7,0.0000015397605,1.3236668e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829435,0.00010228382,0.00030677646,0.00045459837,0.00060787745,0.00023411027],"domain_scores_gemma":[0.9988903,0.00022225008,0.00016144419,0.00056294765,0.00008555083,0.000077538796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051290233,0.00013310232,0.0001643946,0.00015239776,0.00011382038,0.0002163575,0.0014492391,0.000051845742,0.0000076462675],"category_scores_gemma":[0.00017723309,0.000091576585,0.00003108732,0.0013029673,0.0003663534,0.00072560995,0.00037177105,0.00016444187,0.0000015213275],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.8573513e-7,0.000025300076,0.0004624318,0.000005414583,0.0000013621825,0.0000022128963,0.0013060599,0.0006083853,0.0146515,0.00006878086,0.000013384738,0.9828545],"study_design_scores_gemma":[0.00021182062,0.00009321112,0.04334537,0.000087281245,0.0000026542884,0.0000094555735,0.0000015675855,0.549749,0.2765911,0.12978749,9.548122e-7,0.000120095516],"about_ca_topic_score_codex":0.000056429944,"about_ca_topic_score_gemma":0.000010295354,"teacher_disagreement_score":0.9827344,"about_ca_system_score_codex":0.000068484165,"about_ca_system_score_gemma":0.00016228436,"threshold_uncertainty_score":0.37343848},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011680377,0.003919518,0.9820989,0.00040003014,0.0006872667,0.00094363396,0.000003244735,0.00010171066,0.0001653605],"genre_scores_gemma":[0.50128067,0.00019166821,0.49798542,0.00019712398,0.00026218,0.000019885605,0.000002258397,0.00003730227,0.000023520513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959041,0.00006811281,0.00063598086,0.0019703312,0.00047269865,0.00094880175],"domain_scores_gemma":[0.9963224,0.0023318052,0.00034771505,0.00065723795,0.00010335011,0.00023750108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001339069,0.0006190456,0.0007902657,0.00062040845,0.0003866115,0.0006615256,0.0012422645,0.00048934267,0.000004720197],"category_scores_gemma":[0.00013657517,0.00061280496,0.00009595147,0.00047397232,0.0007288834,0.0007973853,0.0009976728,0.0009782616,2.9769942e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030787636,0.000018787445,0.00079213746,0.00010716625,0.00000991167,0.00008914226,0.0018683162,0.15914589,0.0003001627,0.0028749595,0.0000023991129,0.8347603],"study_design_scores_gemma":[0.0010501439,0.0002579681,0.0008812561,0.0019036195,0.00001184358,0.00021173368,0.0000027469819,0.96917564,0.00022784213,0.025434066,0.00015315205,0.0006899905],"about_ca_topic_score_codex":0.000017790875,"about_ca_topic_score_gemma":0.00010673334,"teacher_disagreement_score":0.8340703,"about_ca_system_score_codex":0.00024337687,"about_ca_system_score_gemma":0.00030353744,"threshold_uncertainty_score":0.99963236},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007179748,0.00031049587,0.8942119,0.00031472306,0.0021700817,0.0002726011,0.0000039480797,0.00021515526,0.10249393],"genre_scores_gemma":[0.022106024,0.00010457777,0.9722537,0.0020449345,0.0004960312,0.000015013399,0.0000034242144,0.000043600776,0.002932704],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99669075,0.000025578716,0.00042851066,0.0014608008,0.0007147692,0.0006796059],"domain_scores_gemma":[0.9975793,0.0002079752,0.00020807303,0.0016123594,0.00019072558,0.00020157691],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053071557,0.00047304484,0.00045517905,0.0006969739,0.00069249835,0.00095216336,0.0036066412,0.00033838346,0.00009921916],"category_scores_gemma":[0.00004246994,0.00041027323,0.00015125559,0.00111154,0.0008522572,0.00048687324,0.0013325495,0.00076960726,0.00018873469],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046973737,0.00005629674,0.000030668296,0.0000212258,0.000016794798,0.00016268133,0.0011498426,0.007030563,0.000010748236,0.07423852,0.0004917791,0.9167862],"study_design_scores_gemma":[0.00023573115,0.000299904,0.000087918335,0.00015847503,0.000009137826,0.00015377502,6.08457e-8,0.35429364,0.00017337612,0.6175798,0.026129164,0.0008790317],"about_ca_topic_score_codex":0.000062740575,"about_ca_topic_score_gemma":0.000085349726,"teacher_disagreement_score":0.91590714,"about_ca_system_score_codex":0.00022756013,"about_ca_system_score_gemma":0.000702798,"threshold_uncertainty_score":0.9998349},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04301499,0.000062141014,0.9535605,0.00074651337,0.00066479977,0.00061098847,0.000022185017,0.000020049807,0.0012978324],"genre_scores_gemma":[0.99069244,0.000016121516,0.0059855357,0.0029792613,0.00011487953,0.00001293377,0.0000032184269,0.000018734321,0.00017687248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700373,0.00008050785,0.0005234887,0.0011798486,0.0007201191,0.00049232977],"domain_scores_gemma":[0.9975732,0.00070059294,0.00032393573,0.001057148,0.00021180318,0.00013329752],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060069363,0.00043491914,0.00062239775,0.0004402256,0.00012154662,0.00012967258,0.0023879453,0.00013747082,0.000013107752],"category_scores_gemma":[0.00013675338,0.00029338532,0.000112008944,0.00050018687,0.0007806729,0.00049034704,0.0016113712,0.0005886396,0.000014599993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002151285,0.0010985098,0.0069404445,0.00027295953,0.0002578829,0.0006755811,0.06818008,0.006713048,0.07624313,0.42159367,0.00052389444,0.41534954],"study_design_scores_gemma":[0.0046844403,0.0074952566,0.26948127,0.0049390737,0.00011276429,0.00023890901,0.000032394742,0.41927454,0.14968097,0.13411045,0.0046287384,0.0053211893],"about_ca_topic_score_codex":0.00024452066,"about_ca_topic_score_gemma":0.0004631049,"teacher_disagreement_score":0.94767743,"about_ca_system_score_codex":0.00015806513,"about_ca_system_score_gemma":0.0002076459,"threshold_uncertainty_score":0.99995184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009232372,0.00010764298,0.9934374,0.00060515065,0.0022149002,0.0011953212,0.000004215093,0.00025547374,0.0012566267],"genre_scores_gemma":[0.07273468,0.0000068508366,0.92466223,0.0016197112,0.0006148327,0.00003202757,0.0000016352382,0.000049328934,0.00027872637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537003,0.000025332683,0.0008594704,0.0016822544,0.0010135982,0.0010492859],"domain_scores_gemma":[0.9965932,0.0007916806,0.00031432704,0.0013309825,0.0006530176,0.0003167905],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00116089,0.00060996413,0.00066155486,0.0008358314,0.0004924616,0.0011123262,0.0037782597,0.00036362096,0.00004111999],"category_scores_gemma":[0.00023564966,0.0005691089,0.00016019137,0.00063605857,0.0005276129,0.001004863,0.0011985824,0.0006224301,0.00017748293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003155497,0.000011986166,0.000011655932,0.0000614312,0.000007940731,0.000009506985,0.0010906734,0.18323037,0.00060697924,0.010198499,0.000016100299,0.8047517],"study_design_scores_gemma":[0.000064086635,0.00015171536,0.00001793741,0.0007616855,0.000007866273,0.000040209477,5.2472745e-7,0.9369589,0.011144044,0.049553435,0.0006280443,0.00067153573],"about_ca_topic_score_codex":0.000030209554,"about_ca_topic_score_gemma":0.000012204865,"teacher_disagreement_score":0.8040802,"about_ca_system_score_codex":0.0004282118,"about_ca_system_score_gemma":0.0006239298,"threshold_uncertainty_score":0.9999246},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016465267,0.00028789171,0.84620726,0.00070076657,0.0073662275,0.0016021036,0.00006643671,0.00037224812,0.12693182],"genre_scores_gemma":[0.7487925,0.00011387132,0.23730224,0.0017169922,0.004488899,0.0001065835,0.00055236206,0.00021108676,0.0067154574],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99653345,0.0002248508,0.0004894785,0.0012499791,0.00089338946,0.0006088724],"domain_scores_gemma":[0.9980208,0.00040041053,0.00022175723,0.0007030157,0.00050323515,0.00015073984],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016349517,0.00034729578,0.00036128232,0.001191114,0.00024690575,0.00016101234,0.0006901847,0.0006320692,0.0054914234],"category_scores_gemma":[0.00013452041,0.00032312452,0.000107450105,0.00043094362,0.00082482287,0.0002212489,0.0002429845,0.0014010402,0.0032529335],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019480078,0.00009260414,0.000018835543,0.000026076415,0.000017752765,0.000076292774,0.0022336312,0.000004690619,0.00013636147,0.0010718195,0.00018452953,0.99611795],"study_design_scores_gemma":[0.0007515462,0.00058101513,0.0013399433,0.0013247876,0.000033983513,0.0001445235,0.0000043563873,0.007268615,0.001997484,0.9848896,0.0009628537,0.0007012802],"about_ca_topic_score_codex":0.00028602593,"about_ca_topic_score_gemma":0.0002798651,"teacher_disagreement_score":0.99541664,"about_ca_system_score_codex":0.00025468908,"about_ca_system_score_gemma":0.0003134623,"threshold_uncertainty_score":0.9999221},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.365985,0.00011029323,0.6334142,0.000010271327,0.00019742509,0.000104998275,0.000004183393,0.00000821622,0.00016540405],"genre_scores_gemma":[0.96393764,0.0000050765307,0.035878118,0.000055060264,0.000062762105,0.0000038847384,0.0000019204479,0.000018326295,0.000037202004],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9980364,0.00031374075,0.00043690356,0.0005656886,0.000401593,0.00024570327],"domain_scores_gemma":[0.9990603,0.00034159666,0.00016413305,0.00034640505,0.000054830256,0.000032753465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034428826,0.00022055616,0.00040419018,0.00035132896,0.000063860076,0.0000489611,0.00046451,0.00020070781,0.000036489666],"category_scores_gemma":[0.000023706352,0.00020717607,0.00003175405,0.00013493172,0.00074907666,0.00014577083,0.00010256632,0.00049053173,0.0000013808169],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004520013,0.000076087665,0.0043149055,0.00008060081,0.000020496776,0.000009044194,0.13689187,0.051086295,0.0069558388,0.010800257,2.555745e-7,0.78971916],"study_design_scores_gemma":[0.0069460184,0.0066317953,0.77512,0.0046513835,0.00009384986,0.00005471916,0.0019080583,0.06372898,0.01674885,0.11944646,0.00087579247,0.003794055],"about_ca_topic_score_codex":0.000032924425,"about_ca_topic_score_gemma":0.000051063653,"teacher_disagreement_score":0.7859251,"about_ca_system_score_codex":0.000057694808,"about_ca_system_score_gemma":0.000059447077,"threshold_uncertainty_score":0.8448395},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068297406,0.00027278718,0.9920893,0.0006048099,0.0018976401,0.0005403667,0.000008365161,0.0003406497,0.0035631338],"genre_scores_gemma":[0.45116082,0.000019767618,0.5454038,0.0023252575,0.0009425031,0.0000012243631,0.000017031298,0.0000750132,0.000054619282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950903,0.0001123194,0.0006228021,0.0020154894,0.0012766424,0.00088245445],"domain_scores_gemma":[0.9962195,0.00033217136,0.0005060793,0.001683799,0.00092727406,0.00033117106],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014057396,0.0007407761,0.0006760522,0.00076203665,0.00059537415,0.0012427457,0.0033655902,0.0004021896,0.00004990887],"category_scores_gemma":[0.0002576282,0.000648154,0.00012532726,0.0012013696,0.0009232746,0.0015617936,0.0011548784,0.0012070438,0.00018949479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010316503,0.0005801288,0.0002802936,0.00012662829,0.000058417114,0.00091543276,0.050121106,0.011944542,0.0039646374,0.3770983,0.00010059674,0.55470675],"study_design_scores_gemma":[0.0012871734,0.0014494607,0.0009575349,0.0006345427,0.000043219592,0.00047826764,0.000013031019,0.75722116,0.010519912,0.22440258,0.00024809668,0.0027450207],"about_ca_topic_score_codex":0.000056244844,"about_ca_topic_score_gemma":0.000029301204,"teacher_disagreement_score":0.74527663,"about_ca_system_score_codex":0.00076779973,"about_ca_system_score_gemma":0.00046407597,"threshold_uncertainty_score":0.99979407},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013840523,0.00034016205,0.9965426,0.00018304386,0.00057281717,0.0006015785,0.0000069281336,0.00009560387,0.00027322874],"genre_scores_gemma":[0.5577104,0.00001723947,0.4414202,0.00028947298,0.00027153257,0.000035251574,0.000003950712,0.00005430949,0.00019760607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630964,0.000039589624,0.0005085609,0.0012714324,0.0010689561,0.00080183666],"domain_scores_gemma":[0.9951113,0.0030701961,0.00014214998,0.0011892251,0.00033289188,0.00015427737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001170797,0.00038054233,0.0005525319,0.0016381292,0.00008834078,0.00017174963,0.0031808135,0.0002551756,0.000008346692],"category_scores_gemma":[0.0005360144,0.0003624351,0.00011796964,0.0007760904,0.0004777392,0.00019810886,0.0010864959,0.00074390526,0.0000100481075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033024917,0.00004766137,0.0038653025,0.00037320057,0.000024023271,0.00016129126,0.0042271353,0.47633946,0.00041342204,0.0074338047,0.00008307747,0.5069986],"study_design_scores_gemma":[0.0009798679,0.0010995077,0.006904005,0.0009551959,0.000007966145,0.0000868933,8.408634e-7,0.9317543,0.014379101,0.041486163,0.0012123113,0.0011338788],"about_ca_topic_score_codex":0.000034017856,"about_ca_topic_score_gemma":0.00001335243,"teacher_disagreement_score":0.5563264,"about_ca_system_score_codex":0.00027409455,"about_ca_system_score_gemma":0.0007855662,"threshold_uncertainty_score":0.99988276},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012483745,0.00022712006,0.9826062,0.0004580212,0.00052992185,0.0011581294,0.0000016332458,0.00032044132,0.013450214],"genre_scores_gemma":[0.22358122,0.000021213169,0.77430624,0.00030066175,0.0006230174,0.000044063785,0.0000062413733,0.000079314814,0.0010380059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99398065,0.000101217745,0.0008603822,0.0024144985,0.0014776887,0.001165539],"domain_scores_gemma":[0.99631506,0.0006667927,0.0006075318,0.001801584,0.0003413896,0.0002676368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017095705,0.0008191442,0.0010020457,0.0012817025,0.00019058022,0.0008714827,0.0035785334,0.00046834964,0.000012605833],"category_scores_gemma":[0.00009453145,0.0006970156,0.00012771013,0.0012107743,0.0006547587,0.0015134383,0.0010324268,0.0012401342,0.0001374439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038134836,0.00008818801,0.00033038773,0.000060636405,0.000033809192,0.00063961704,0.0036556069,0.031066805,0.001639631,0.009479873,0.0000075790394,0.9529597],"study_design_scores_gemma":[0.0027547025,0.0014330026,0.0029705341,0.004029781,0.000036893092,0.0009554398,0.0000031864533,0.9475073,0.0031067675,0.029756878,0.003156984,0.00428852],"about_ca_topic_score_codex":0.00028603995,"about_ca_topic_score_gemma":0.0003671251,"teacher_disagreement_score":0.9486712,"about_ca_system_score_codex":0.0009509476,"about_ca_system_score_gemma":0.0010458062,"threshold_uncertainty_score":0.9995481},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01618356,0.00020893806,0.9743654,0.00040458402,0.00062640884,0.00029036502,0.0000038239104,0.00007652942,0.007840391],"genre_scores_gemma":[0.9762567,0.000005630229,0.023035683,0.00020897173,0.0002725338,0.0000018188299,0.000011331029,0.000017768238,0.0001895299],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998285,0.000012597225,0.0004848215,0.000477838,0.00050862797,0.00023109448],"domain_scores_gemma":[0.9984372,0.00061457616,0.00021820886,0.00043472392,0.00017566842,0.00011961813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031879032,0.00019864265,0.00055194664,0.0004327584,0.00009595522,0.00003216768,0.00021996743,0.00018471586,0.00011842974],"category_scores_gemma":[0.00016772987,0.00017244575,0.00011855217,0.00021590677,0.00045620368,0.000038452938,0.00009541255,0.00043783674,0.000019554082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005333021,0.00007997042,0.010774244,0.00011953836,0.00002211376,0.000019977711,0.000705971,0.06415631,0.0008786882,0.0019115654,0.0000033199615,0.92127496],"study_design_scores_gemma":[0.0024981974,0.00020805052,0.052535355,0.0018636924,0.000055348217,0.00004774324,0.000001101764,0.91925496,0.011340547,0.0045855273,0.0068462607,0.00076323596],"about_ca_topic_score_codex":0.000007464627,"about_ca_topic_score_gemma":0.000006714955,"teacher_disagreement_score":0.9600732,"about_ca_system_score_codex":0.000079676465,"about_ca_system_score_gemma":0.00013947654,"threshold_uncertainty_score":0.7032134},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023783422,0.0010658323,0.9946077,0.0003077665,0.0004172852,0.000491031,0.0000031750435,0.0003310597,0.0003978108],"genre_scores_gemma":[0.49673885,0.00009651793,0.5024645,0.00045595376,0.00014623335,0.000013071758,0.000008139473,0.00004209579,0.00003467745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598014,0.000096871845,0.0006705272,0.0017642707,0.00072835607,0.0007598106],"domain_scores_gemma":[0.997618,0.0005580313,0.0004542414,0.0010436121,0.00017441162,0.00015170647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012294754,0.0005957069,0.00060876284,0.0016001348,0.00039637703,0.0010358993,0.0024389874,0.00044157731,0.000018123656],"category_scores_gemma":[0.0002799829,0.0005679677,0.00006388179,0.0009932463,0.00046017737,0.0014936028,0.0016678232,0.0017857172,0.000011594359],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044469343,0.000017049018,0.0018034237,0.00009785621,0.00000908973,0.00005912514,0.0018682017,0.013974769,0.008317969,0.003098692,0.0000022804265,0.9707471],"study_design_scores_gemma":[0.00023789688,0.000089975016,0.00038867048,0.00047559864,0.0000053959952,0.00010581503,6.5306324e-7,0.9501142,0.00842049,0.039099295,0.00036191096,0.00070011854],"about_ca_topic_score_codex":0.00038853366,"about_ca_topic_score_gemma":0.00026862847,"teacher_disagreement_score":0.970047,"about_ca_system_score_codex":0.0004395545,"about_ca_system_score_gemma":0.0003299546,"threshold_uncertainty_score":0.9996772},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028290046,0.0002077893,0.9925603,0.0012843284,0.0022150895,0.00063299556,0.000010481247,0.0001834873,0.0028772354],"genre_scores_gemma":[0.12189459,0.000019137493,0.8722855,0.0034659684,0.0012718578,0.000036248828,0.000049580245,0.000037230307,0.0009398708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655795,0.000037007485,0.00055207085,0.0014600751,0.00080317754,0.00058970496],"domain_scores_gemma":[0.99708045,0.00092179043,0.00030866652,0.0010233962,0.00049388834,0.00017180269],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009764894,0.0004973094,0.00053338934,0.0008145444,0.00040116528,0.0006222854,0.0021184052,0.00024649224,0.000022313827],"category_scores_gemma":[0.0001978416,0.00047867795,0.00018415088,0.00052477047,0.00042833012,0.0004586658,0.00077185396,0.0003743452,0.00004227025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010772564,0.000023157525,0.000006562245,0.00007450002,0.000013298546,0.000011637212,0.00050104834,0.096761964,0.00039934047,0.23357539,0.00034167297,0.66828066],"study_design_scores_gemma":[0.00030864117,0.00028289767,0.00007799517,0.00012266006,0.000007082643,0.00004797479,1.0813617e-7,0.66043526,0.0014300642,0.31883246,0.017884826,0.000570073],"about_ca_topic_score_codex":0.0000084028725,"about_ca_topic_score_gemma":0.00007991639,"teacher_disagreement_score":0.6677106,"about_ca_system_score_codex":0.00021837228,"about_ca_system_score_gemma":0.0006127663,"threshold_uncertainty_score":0.99976647},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006117942,0.00012575295,0.9945459,0.0013503364,0.000022484974,0.0011257114,0.000053604468,0.00006908179,0.0026459703],"genre_scores_gemma":[0.015966335,0.00011372346,0.98228633,0.0002468068,0.00017514559,0.000067661924,0.00016636697,0.000028091996,0.00094950455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852926,0.000006771124,0.00035346876,0.0006888904,0.0002683566,0.0001532291],"domain_scores_gemma":[0.99797815,0.000101935155,0.00022250845,0.0013838514,0.00021354551,0.00009999383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036667622,0.00017463428,0.0003375014,0.00024633997,0.00009613591,0.00003617216,0.00044284173,0.000066387154,0.0000072242747],"category_scores_gemma":[0.000038275262,0.00014830672,0.00004445391,0.00022408435,0.00039055748,0.00008963267,0.00035680144,0.00018084282,0.0000039087536],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018288712,0.000044642296,0.00013800306,0.00022910057,0.000014459026,0.0000037885673,0.00011850213,0.0017814408,0.0062173973,0.021528339,0.00040946607,0.96949655],"study_design_scores_gemma":[0.0033245038,0.0030499403,0.006527882,0.02691016,0.0016221581,0.0009559767,0.000006743949,0.5419817,0.030271733,0.16753268,0.21317005,0.004646501],"about_ca_topic_score_codex":0.000037872425,"about_ca_topic_score_gemma":0.000029926676,"teacher_disagreement_score":0.96485007,"about_ca_system_score_codex":0.00006766273,"about_ca_system_score_gemma":0.0001473099,"threshold_uncertainty_score":0.6047772},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019195635,0.00009392901,0.9956946,0.00003816902,0.0006855177,0.000106006206,0.0000055507035,0.00004941028,0.0031348844],"genre_scores_gemma":[0.9128332,0.000024385223,0.08622869,0.00008599213,0.0004606188,0.0000018103959,0.00005561871,0.000035811972,0.00027387065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989024,0.000007966359,0.00034869427,0.0002587773,0.0003400007,0.00014219197],"domain_scores_gemma":[0.9993598,0.000118142416,0.000095758944,0.00027870623,0.00011303488,0.000034546923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026773082,0.00016703006,0.00021268593,0.0002406883,0.00003132484,0.00005636138,0.0002774804,0.00015294958,0.00002632055],"category_scores_gemma":[0.00005559287,0.00016443583,0.00007715683,0.00011789853,0.00015943921,0.00007679146,0.00004285569,0.00021191349,0.000007773849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015679825,0.0000038550493,0.000010019297,0.00007165531,0.000004877762,0.0000020533391,0.00003446035,0.92265743,0.00022300436,0.0059102806,0.000019567626,0.07106121],"study_design_scores_gemma":[0.00008847323,0.00007762471,0.000051877418,0.00032869147,0.000005363779,0.000005088992,3.350085e-8,0.98531586,0.0024994751,0.010840798,0.00061207614,0.00017465986],"about_ca_topic_score_codex":0.0000044861804,"about_ca_topic_score_gemma":0.000030419755,"teacher_disagreement_score":0.9126412,"about_ca_system_score_codex":0.00007752893,"about_ca_system_score_gemma":0.000053552183,"threshold_uncertainty_score":0.67054987},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052398682,0.00034454878,0.9984719,0.00016071716,0.00018221473,0.00038048084,0.000006253546,0.00015450818,0.00024693928],"genre_scores_gemma":[0.23640281,0.000009310094,0.76329947,0.00016679459,0.00005709383,0.000011106,0.0000066513876,0.000020925598,0.000025850246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966995,0.000061964856,0.00068809185,0.0012198539,0.0008462685,0.000484324],"domain_scores_gemma":[0.9956162,0.0025127004,0.00055399636,0.0008258763,0.0003450609,0.00014618755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013491978,0.00042118318,0.0009392519,0.0015986967,0.00020905623,0.00021190003,0.0017627393,0.00026127548,0.000003868874],"category_scores_gemma":[0.00043829405,0.00039172548,0.00013811019,0.0009503125,0.000991425,0.0001920216,0.00061745435,0.0006411768,0.0000012127342],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011823661,0.00003443021,0.00075881317,0.00011672033,0.000016596474,0.0000062593103,0.00026480618,0.030857773,0.00019299709,0.17754954,0.000018402312,0.79017186],"study_design_scores_gemma":[0.00021763553,0.0004319885,0.000057969777,0.00014336119,0.000016168136,0.0000035528012,1.6026111e-7,0.67065716,0.001972927,0.32486734,0.0012783525,0.00035341355],"about_ca_topic_score_codex":0.000008269635,"about_ca_topic_score_gemma":0.00002946699,"teacher_disagreement_score":0.7898184,"about_ca_system_score_codex":0.00012398284,"about_ca_system_score_gemma":0.00021733198,"threshold_uncertainty_score":0.9998535},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008355944,0.00074420695,0.98624617,0.00035399658,0.0016610309,0.00059994793,0.0000012892011,0.00012197793,0.0019154516],"genre_scores_gemma":[0.80617416,0.00003680469,0.19302669,0.00013747315,0.00025057004,0.00001687833,5.74313e-7,0.000024834331,0.00033202016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613,0.000024422203,0.0009142683,0.0012094434,0.0010027725,0.00071908685],"domain_scores_gemma":[0.99774116,0.0002689424,0.00041133858,0.0012121241,0.00024592067,0.00012052831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000726785,0.0005092863,0.0006816968,0.0010544622,0.00009049864,0.00036984135,0.0038516975,0.0003407114,0.000032692285],"category_scores_gemma":[0.00012621183,0.00042027212,0.00012506518,0.000686014,0.0010368619,0.0011795281,0.0015030197,0.00080071506,0.00011097955],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013865931,0.00011168966,0.004251412,0.00013879158,0.000015828342,0.00012031779,0.006110967,0.057599172,0.0014745687,0.03173971,0.0000082342885,0.89841545],"study_design_scores_gemma":[0.00014120791,0.00034802666,0.0008425454,0.001814954,0.0000053033427,0.00004295102,0.000002858015,0.5530645,0.044400938,0.39805475,0.00026723108,0.0010147139],"about_ca_topic_score_codex":0.00026071927,"about_ca_topic_score_gemma":0.00008201214,"teacher_disagreement_score":0.89740074,"about_ca_system_score_codex":0.00030849368,"about_ca_system_score_gemma":0.00045778617,"threshold_uncertainty_score":0.9998249},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011306922,0.0011228139,0.9930574,0.00037574428,0.0015871811,0.00032106062,0.0000059709164,0.00018595671,0.0033325488],"genre_scores_gemma":[0.19277072,0.00020962217,0.80280614,0.0028418018,0.0010728454,0.000007677375,0.00005666698,0.00007458044,0.00015995398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99548376,0.000042335247,0.00042173243,0.0023145163,0.00094239204,0.0007952671],"domain_scores_gemma":[0.9946925,0.0001914279,0.00031964594,0.004433249,0.00013987462,0.0002232991],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00076655555,0.00062910566,0.00056038686,0.00042932344,0.00032506528,0.00059009687,0.00936834,0.00034164003,0.000021599892],"category_scores_gemma":[0.000023173174,0.00041296522,0.00007204082,0.00058052706,0.00080418045,0.0010942728,0.00427916,0.0010505506,0.00001321813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014474847,0.000025550322,0.00010677373,0.000015818436,0.00000649051,0.00037876714,0.00021572923,0.030295763,0.0000018482732,0.0060818554,0.00010374795,0.9627532],"study_design_scores_gemma":[0.00020798092,0.0002403232,0.00010882304,0.0002801482,0.000009700652,0.00016296816,3.745872e-8,0.94859093,0.0000135896635,0.04853326,0.0012582685,0.0005939685],"about_ca_topic_score_codex":0.000041015763,"about_ca_topic_score_gemma":0.00008182394,"teacher_disagreement_score":0.9621592,"about_ca_system_score_codex":0.00008345132,"about_ca_system_score_gemma":0.00023969483,"threshold_uncertainty_score":0.9998322},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044309325,0.00017630364,0.9900988,0.00056592305,0.00023214934,0.00037365485,0.000040099632,0.00003076055,0.004051428],"genre_scores_gemma":[0.9679881,0.000011694374,0.03042322,0.00074161746,0.00056978094,0.000010276189,0.000017059823,0.00002546453,0.000212804],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842674,0.000012199883,0.00024073696,0.00072112744,0.00027922602,0.00031995546],"domain_scores_gemma":[0.99903023,0.00013984677,0.00012057353,0.0004530136,0.00012026405,0.00013606339],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021854643,0.00030730144,0.0003049895,0.00015349015,0.0003568182,0.00032728998,0.0005360431,0.00012066628,0.000044045537],"category_scores_gemma":[0.0000072757207,0.00027680417,0.000067143446,0.00017181995,0.00030797784,0.00014468898,0.00027025843,0.00053666596,0.000019817931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023675666,0.000035055156,0.00016099263,0.00000804773,0.000012739256,0.0000036289416,0.00030959147,0.00009593452,0.00037483944,0.28312108,0.000022439213,0.7158533],"study_design_scores_gemma":[0.00018842147,0.000067882196,0.00054967543,0.00013003577,0.00001390716,0.0000042297015,3.5692102e-7,0.048736013,0.0012933682,0.9461506,0.0024371003,0.0004284133],"about_ca_topic_score_codex":0.00007203334,"about_ca_topic_score_gemma":0.000026128106,"teacher_disagreement_score":0.9635571,"about_ca_system_score_codex":0.00004898414,"about_ca_system_score_gemma":0.00021495763,"threshold_uncertainty_score":0.9999684},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000093925686,0.0005402301,0.98828477,0.00029662537,0.0024446324,0.00035220728,0.000026370119,0.0001771934,0.007784066],"genre_scores_gemma":[0.09275829,0.00013993881,0.8974917,0.0032178035,0.0026183364,0.00002584794,0.00006979318,0.00013059437,0.0035476782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950328,0.000023190469,0.0005234182,0.0020073643,0.0016287768,0.00078449014],"domain_scores_gemma":[0.9965503,0.00025634767,0.00034799485,0.0020400938,0.00043634765,0.0003689225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094073836,0.00064564473,0.0006214055,0.0006968863,0.0002465203,0.00078037067,0.0046521197,0.00038359858,0.000057564408],"category_scores_gemma":[0.0000753946,0.0005592461,0.0001347017,0.00057861925,0.00058852666,0.0013518704,0.0039902497,0.000955791,0.00012256161],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013202836,0.000068213725,0.000110778376,0.0000452199,0.000022141494,0.00039201233,0.0010427457,0.007797536,0.0001503782,0.026124574,0.0018412536,0.962392],"study_design_scores_gemma":[0.00085294864,0.0004109224,0.0007436923,0.001073706,0.000014366717,0.000117554155,2.346163e-7,0.765789,0.0012150779,0.18714927,0.040993724,0.0016395227],"about_ca_topic_score_codex":0.000082209175,"about_ca_topic_score_gemma":0.000038444563,"teacher_disagreement_score":0.9607524,"about_ca_system_score_codex":0.00041005865,"about_ca_system_score_gemma":0.00084730395,"threshold_uncertainty_score":0.9996859},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015789248,0.0011702443,0.9919842,0.0006709633,0.0009765682,0.0007241217,0.00002234608,0.00047094136,0.0039648223],"genre_scores_gemma":[0.0109175565,0.00006736142,0.98509693,0.0016461654,0.000755679,0.00002353666,0.000017700986,0.000063324886,0.0014117351],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99536544,0.000043805518,0.0006211111,0.0018571519,0.0012536045,0.0008588854],"domain_scores_gemma":[0.99649155,0.0006091994,0.0004188835,0.0015513364,0.0006577645,0.00027128827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016774024,0.00065053086,0.0006970777,0.00085194444,0.0004100486,0.0004664735,0.0037401377,0.0004628785,0.0000069858447],"category_scores_gemma":[0.00044119894,0.0005865024,0.00022771959,0.00062570034,0.0005577037,0.0012546858,0.0022424401,0.0008123762,0.000015526573],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002401085,0.000020039402,0.0000059678255,0.000051755997,0.000008313292,0.0000575202,0.00053501985,0.0010438794,0.00037295758,0.013686524,0.0006710827,0.98352295],"study_design_scores_gemma":[0.0008711449,0.00080017885,0.000039652183,0.0012685045,0.000024886669,0.00010759514,0.000001704639,0.1558467,0.042233236,0.71329474,0.08354681,0.001964859],"about_ca_topic_score_codex":0.00003039438,"about_ca_topic_score_gemma":0.00001784544,"teacher_disagreement_score":0.9815581,"about_ca_system_score_codex":0.0005744039,"about_ca_system_score_gemma":0.00090487825,"threshold_uncertainty_score":0.99965864},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015580561,0.00009654651,0.9955606,0.00009123103,0.0007234419,0.00020003461,0.000020359757,0.000058056845,0.0016916661],"genre_scores_gemma":[0.87241554,0.000051854327,0.1270937,0.00022928456,0.00010008909,0.0000054788957,0.000020206504,0.000014183466,0.000069681446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997025,0.000027315173,0.00062633055,0.0010484707,0.0008307177,0.00044216696],"domain_scores_gemma":[0.9976967,0.00020657959,0.00038064795,0.0013413588,0.00025752455,0.00011721928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036983285,0.00035916222,0.0006733243,0.0026646985,0.00015924475,0.00019587127,0.0026489354,0.00019063574,0.00025082182],"category_scores_gemma":[0.000020746975,0.00032242766,0.00036674386,0.0019279249,0.00059493195,0.000316505,0.0010196406,0.00038305798,0.0000066737966],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007448081,0.00011284511,0.0007566017,0.000041043135,0.0003924965,0.000031254618,0.003919939,0.004028867,0.00022773561,0.29770553,0.000017573599,0.6927587],"study_design_scores_gemma":[0.00046272494,0.00029234725,0.0061963564,0.00013978394,0.0004121803,0.000013358729,5.54644e-7,0.5934259,0.0024521174,0.39478043,0.0007455221,0.0010786875],"about_ca_topic_score_codex":0.00013601487,"about_ca_topic_score_gemma":0.0005537699,"teacher_disagreement_score":0.8708575,"about_ca_system_score_codex":0.0000704346,"about_ca_system_score_gemma":0.00020254956,"threshold_uncertainty_score":0.99992275},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4258261,0.000059929178,0.5728907,0.0010035562,0.000088852,0.000091335714,9.416166e-7,0.000035584846,0.0000029845776],"genre_scores_gemma":[0.966479,0.000004806764,0.032883707,0.00059331575,0.000019738762,0.000010015878,0.000004400201,0.0000048381985,1.5206282e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978589,0.00033891172,0.0002715653,0.0007771989,0.00029084628,0.0004626015],"domain_scores_gemma":[0.9981035,0.00126176,0.000052201904,0.00045427307,0.00004983619,0.00007844983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002037989,0.00015673495,0.00018114399,0.0001551854,0.00017423263,0.0004191284,0.001054858,0.000057127494,4.7127344e-7],"category_scores_gemma":[0.0021796757,0.00012570304,0.000025211468,0.0013740247,0.0003745855,0.0008978435,0.00077781477,0.00031918773,0.0000017454126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003897912,0.00007250676,0.047988452,0.000006538757,4.786268e-7,0.000002147818,0.00038809964,0.51400256,0.0015310091,0.00026923593,0.0000019550469,0.4357331],"study_design_scores_gemma":[0.00032555053,0.000040781026,0.028186455,0.000047145215,7.1234115e-7,0.000007068901,0.0000011024138,0.95777315,0.001139206,0.01233114,0.000007195937,0.00014049647],"about_ca_topic_score_codex":0.00032655857,"about_ca_topic_score_gemma":0.00018312607,"teacher_disagreement_score":0.54065293,"about_ca_system_score_codex":0.00012054582,"about_ca_system_score_gemma":0.000052429717,"threshold_uncertainty_score":0.5126021},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024278613,0.000049298513,0.96705896,0.0005291308,0.0067519653,0.0005683492,0.0000056246517,0.00011651678,0.0006415584],"genre_scores_gemma":[0.9935425,0.000020724061,0.0008911575,0.0033793957,0.0019288596,0.000007656331,0.000015541804,0.00006138537,0.00015277311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952721,0.0001262727,0.00081747916,0.0018283931,0.0009160877,0.0010396584],"domain_scores_gemma":[0.99786156,0.00077927153,0.00036877804,0.00071419775,0.000072385534,0.00020380205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069324137,0.00063334807,0.00063837663,0.00068735884,0.0003842633,0.0004916453,0.0013023756,0.00043743828,0.000045270757],"category_scores_gemma":[0.00021912213,0.000599306,0.00016684133,0.00068985886,0.00087290246,0.00024680287,0.00061692914,0.0016503944,0.000053528314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007957252,0.000028901002,0.000040888226,0.0000071521727,0.0000014320809,0.00011533438,0.000035474575,0.7140515,0.0034180202,0.005754639,0.000007323822,0.27645975],"study_design_scores_gemma":[0.00013868781,0.00023282856,0.0002244429,0.00013694735,0.00000627333,0.0000680893,8.192847e-8,0.96356523,0.0011552102,0.0336484,0.00027306197,0.00055074197],"about_ca_topic_score_codex":0.00004820202,"about_ca_topic_score_gemma":0.00034137824,"teacher_disagreement_score":0.9692639,"about_ca_system_score_codex":0.0002551936,"about_ca_system_score_gemma":0.00010108246,"threshold_uncertainty_score":0.9996458},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031370342,0.00019028843,0.9942118,0.00019297127,0.00082161376,0.00032384807,0.000012533712,0.0002539795,0.0039616004],"genre_scores_gemma":[0.07178829,0.00008583587,0.92567927,0.00040708907,0.00044447763,0.00006324691,0.00005026475,0.000056443365,0.0014250606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693435,0.000036638892,0.0005086272,0.0013620094,0.00057236955,0.000586027],"domain_scores_gemma":[0.9978188,0.00032300892,0.0002669854,0.0012822839,0.00015854447,0.00015032613],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006557597,0.0003981469,0.00044944082,0.0008631648,0.00033860875,0.0005932325,0.003156594,0.00024193789,0.000025232512],"category_scores_gemma":[0.00008221564,0.00039115341,0.00007734786,0.00079596933,0.00039900737,0.0006305834,0.0012162331,0.0010526747,0.000116960306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012485835,0.00004001176,0.00016337831,0.000032249693,0.0000071488066,0.00004448235,0.000974031,0.03070766,0.000033277138,0.03470523,0.00007474449,0.9332165],"study_design_scores_gemma":[0.00023681791,0.00015230091,0.00096974586,0.00045848743,0.000006756565,0.00011995954,9.640936e-7,0.93026173,0.000051131457,0.03954106,0.027352605,0.0008484176],"about_ca_topic_score_codex":0.00022170086,"about_ca_topic_score_gemma":0.00011426381,"teacher_disagreement_score":0.9323681,"about_ca_system_score_codex":0.00026287173,"about_ca_system_score_gemma":0.00034303634,"threshold_uncertainty_score":0.999854},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014429597,0.000099120974,0.98691815,0.0025484166,0.001009367,0.000427186,0.0000031359768,0.00022364642,0.008756545],"genre_scores_gemma":[0.034434192,0.00003239171,0.96243554,0.0018155901,0.00021585594,0.000014198759,0.00000961601,0.000028539325,0.0010140709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967517,0.000036911617,0.00041901428,0.0012667761,0.0009600485,0.0005655247],"domain_scores_gemma":[0.99785364,0.000284903,0.00016308449,0.0012204661,0.00027045156,0.00020748776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048202253,0.00041082734,0.0003609931,0.00076960644,0.00024340874,0.0007192634,0.0020333452,0.0002591342,0.0003137737],"category_scores_gemma":[0.000044689852,0.0003723116,0.00012553709,0.00051707675,0.0006017265,0.0006443711,0.0006004529,0.0006625,0.00028043627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023715581,0.000014984294,0.000074352196,0.000018126912,0.0000050385024,0.000024510693,0.00017342782,0.187487,0.000018604851,0.049228773,0.000035201083,0.7629176],"study_design_scores_gemma":[0.00025821512,0.00007232288,0.00033976664,0.0001471461,0.000003129152,0.00002210763,7.5326604e-8,0.9436241,0.00019202028,0.053848617,0.0010158693,0.0004766649],"about_ca_topic_score_codex":0.00003804863,"about_ca_topic_score_gemma":0.000067891146,"teacher_disagreement_score":0.7624409,"about_ca_system_score_codex":0.00024578057,"about_ca_system_score_gemma":0.0008621884,"threshold_uncertainty_score":0.99987286},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084165536,0.00016490322,0.91466284,0.00018783401,0.00013304927,0.00060093077,0.000015993437,0.000009829206,0.000059091217],"genre_scores_gemma":[0.9129454,0.00000536695,0.08653782,0.0003323506,0.00011231955,0.000016049937,0.0000017145238,0.00001246227,0.00003650824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984059,0.000010202799,0.00036967132,0.00036078523,0.00062215794,0.00023129387],"domain_scores_gemma":[0.9987215,0.00012764838,0.00019395893,0.00024817148,0.0006377086,0.00007102642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068771426,0.00019673028,0.0003628957,0.00021466588,0.00009779775,0.000038949544,0.0002690977,0.00011413041,0.0000087550225],"category_scores_gemma":[0.000046019362,0.00013459433,0.00008773982,0.00017622334,0.00021875948,0.00009143953,0.00008057898,0.00016209406,7.417965e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043222582,0.0000066889256,0.00010836864,0.0001558836,0.000030011024,5.5575356e-7,0.005075325,0.56981605,0.025907105,0.00020077798,0.000001626676,0.39826542],"study_design_scores_gemma":[0.00061678403,0.00022688319,0.004036236,0.0014321068,0.000065771914,0.000013566315,0.0000042408496,0.97683644,0.013157736,0.0033551054,0.0000563292,0.00019877752],"about_ca_topic_score_codex":0.00012764706,"about_ca_topic_score_gemma":0.00057713134,"teacher_disagreement_score":0.8287799,"about_ca_system_score_codex":0.00026591183,"about_ca_system_score_gemma":0.0011652723,"threshold_uncertainty_score":0.5488598},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087680976,0.00026503045,0.84274995,0.0010492138,0.0020364732,0.00045361512,0.000018653358,0.00014516569,0.15240507],"genre_scores_gemma":[0.9355205,0.0000740699,0.038222864,0.0018659882,0.0036820716,0.000020208056,0.000060861523,0.000060962968,0.02049247],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99648327,0.00006409797,0.0004565632,0.0011196991,0.0012999787,0.0005763965],"domain_scores_gemma":[0.99801284,0.00042703745,0.00022151523,0.0009066276,0.0002552275,0.00017677412],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019821287,0.0003289533,0.0004169852,0.0003828402,0.00055716437,0.0022303823,0.0022791738,0.00029979277,0.0001889652],"category_scores_gemma":[0.0006574007,0.0003021024,0.00012635534,0.0003936513,0.002757905,0.0020691797,0.0006320605,0.00039175537,0.000073604155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036815209,0.000026820213,0.00035178356,0.000041464453,0.000010020037,0.000004522443,0.0019749745,0.0020014518,0.000029918605,0.21861765,0.00014771408,0.77679],"study_design_scores_gemma":[0.00020969647,0.00011270875,0.00014486533,0.00024718448,0.000028194449,0.0000033730782,0.000004364387,0.017675217,0.00075801986,0.9011854,0.0785168,0.0011141829],"about_ca_topic_score_codex":0.00046967246,"about_ca_topic_score_gemma":0.0078057274,"teacher_disagreement_score":0.9346437,"about_ca_system_score_codex":0.0004612204,"about_ca_system_score_gemma":0.00087600655,"threshold_uncertainty_score":0.999956},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020048192,0.0005241551,0.9933688,0.000050443756,0.0011883756,0.0011340122,0.00022868587,0.000049011745,0.0014516893],"genre_scores_gemma":[0.6130664,0.00001087308,0.38592356,0.0003711618,0.0002603264,0.00007691251,0.000052467556,0.000042326654,0.00019596683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663216,0.00011694436,0.0008941448,0.0011416207,0.0005153028,0.00069980696],"domain_scores_gemma":[0.9975963,0.000105140505,0.00050157704,0.0012935479,0.00019953631,0.00030388485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001367946,0.00036576143,0.000582163,0.00060041726,0.00014515732,0.000046103603,0.0016605181,0.00035579895,0.000060709066],"category_scores_gemma":[0.000057430232,0.0003384239,0.00014845832,0.0002769203,0.0003218624,0.0003250024,0.0009330061,0.0006654373,0.000027085593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015472031,0.00039923037,0.0003552991,0.00015334714,0.00001512468,0.0000046528885,0.0034433624,0.016163623,0.000016182008,0.00080997916,0.00008270996,0.9784018],"study_design_scores_gemma":[0.0005139688,0.0017242449,0.0017304856,0.0014779292,0.0000513259,0.000034977922,0.0000043242903,0.99036163,0.00003585389,0.0035569703,0.00007255674,0.0004357148],"about_ca_topic_score_codex":0.00026228034,"about_ca_topic_score_gemma":0.000064421176,"teacher_disagreement_score":0.97796607,"about_ca_system_score_codex":0.00025541135,"about_ca_system_score_gemma":0.00033461014,"threshold_uncertainty_score":0.9999068},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077106257,0.00023123769,0.9949005,0.00063868775,0.0006078208,0.0023288284,0.000012013678,0.000085761734,0.0004240782],"genre_scores_gemma":[0.2002192,0.0000038698363,0.79676086,0.001601056,0.00093107746,0.0001877318,0.00015681931,0.000039348368,0.00010004753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972947,0.00012684849,0.00073547557,0.0009233472,0.00034056735,0.00057900895],"domain_scores_gemma":[0.9979223,0.00067456736,0.0003133529,0.00034610316,0.00057460624,0.00016906578],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002424294,0.0003228022,0.0004502309,0.000348912,0.0019259746,0.00025163466,0.00025780755,0.000527982,0.000011142892],"category_scores_gemma":[0.00048802127,0.00030301113,0.00005005849,0.00018141593,0.00025979878,0.00012537118,0.00011252018,0.00092702254,0.0000020125765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068310624,0.000011214738,0.0005066026,0.00031018408,0.0000053313297,0.0000014275162,0.0012644128,0.8597838,0.000092890084,0.0031610155,0.000006885811,0.1348494],"study_design_scores_gemma":[0.0005167066,0.00015965823,0.00001862218,0.0007470182,0.000011037786,0.0000037582688,0.000006618894,0.99728376,0.00003928443,0.00036364282,0.00053253415,0.00031733717],"about_ca_topic_score_codex":0.00003647282,"about_ca_topic_score_gemma":0.00009310225,"teacher_disagreement_score":0.19944814,"about_ca_system_score_codex":0.0002636166,"about_ca_system_score_gemma":0.0015619178,"threshold_uncertainty_score":0.9999422},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001446698,0.0002444714,0.97084844,0.00029583278,0.00066654943,0.00065296114,0.000009566646,0.00018571044,0.026951792],"genre_scores_gemma":[0.054470137,0.00005543422,0.9419656,0.0028744733,0.00031979335,0.000036145346,0.00002194587,0.00003995638,0.00021654656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569094,0.000033731456,0.00039876805,0.001969614,0.0011653273,0.0007416323],"domain_scores_gemma":[0.99783695,0.000116121286,0.00020174638,0.0013870258,0.00018745381,0.0002706906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035103972,0.00060204853,0.0005197159,0.00058837206,0.00032327924,0.0004999403,0.0030169773,0.0002735084,0.000008109658],"category_scores_gemma":[0.000020243693,0.00047184984,0.00008980738,0.0007987365,0.0004069724,0.0006571182,0.0010568032,0.0006020704,0.00012704272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022988917,0.00010803988,0.000018470188,0.00003073093,0.000020911966,0.00019824509,0.00642222,0.050261106,0.000024920855,0.0011954098,0.0004041048,0.9412929],"study_design_scores_gemma":[0.001638684,0.002197155,0.00024980385,0.0010391073,0.000024847133,0.0016990366,0.000003493477,0.920892,0.0029837596,0.04678954,0.018014988,0.0044675893],"about_ca_topic_score_codex":0.000027668331,"about_ca_topic_score_gemma":0.0000085696065,"teacher_disagreement_score":0.9368253,"about_ca_system_score_codex":0.00025950963,"about_ca_system_score_gemma":0.0003223879,"threshold_uncertainty_score":0.9997733},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013862031,0.00025315362,0.9783973,0.0026620547,0.0020598583,0.0008290214,0.000009872982,0.00003387078,0.0018928394],"genre_scores_gemma":[0.8475899,0.000033014563,0.14846781,0.002722711,0.00089596113,0.000024778865,0.000021883554,0.000031265972,0.00021267062],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978096,0.00008512816,0.00056082546,0.0005584124,0.00075979874,0.00022624774],"domain_scores_gemma":[0.99458915,0.0042178426,0.00023513346,0.0007069936,0.00019818982,0.000052706113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014613244,0.0002311816,0.00045780427,0.0007776052,0.000050521747,0.00003259389,0.0003485254,0.00038429254,0.00005333814],"category_scores_gemma":[0.0014574822,0.00016164038,0.00019307093,0.00045075867,0.0007038284,0.00007043822,0.00004728911,0.0007335807,0.000011387052],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006157559,0.00034963567,0.029914018,0.0015076912,0.000038255435,0.00002509823,0.005646267,0.12661004,0.0006206864,0.012279119,0.00048098475,0.82191247],"study_design_scores_gemma":[0.003988968,0.011337244,0.19221811,0.02013181,0.00018433215,0.00010464267,0.000022205904,0.23341268,0.0014487669,0.52224433,0.01356332,0.0013435567],"about_ca_topic_score_codex":0.000014363945,"about_ca_topic_score_gemma":0.0000185898,"teacher_disagreement_score":0.8337279,"about_ca_system_score_codex":0.00024978464,"about_ca_system_score_gemma":0.0003678866,"threshold_uncertainty_score":0.6591503},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005027515,0.0003087392,0.8813678,0.00016440783,0.0015177553,0.0004155883,0.0000012376497,0.00017805664,0.11554367],"genre_scores_gemma":[0.94782084,0.000007964187,0.038128573,0.00056550046,0.0006014339,0.000045796314,0.000010737106,0.000053235897,0.012765902],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99809223,0.00005788055,0.00032172014,0.00066270964,0.0004297737,0.00043567168],"domain_scores_gemma":[0.9982292,0.00014090608,0.00014553667,0.0013595232,0.000036212343,0.00008859515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008692481,0.00027715912,0.0002884887,0.00042805602,0.00014271429,0.00014056529,0.0012375897,0.0001857662,0.00009113591],"category_scores_gemma":[0.0000071415325,0.00025952136,0.00007008194,0.0001643227,0.00016836061,0.000056419824,0.0005449411,0.00037416618,0.00027402496],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000134500015,0.00002658881,0.000090436275,0.00013042278,0.00003973259,0.000085990134,0.004410499,0.00047238357,0.000071368944,0.049245857,0.000057935264,0.94535536],"study_design_scores_gemma":[0.01479586,0.00681855,0.019708363,0.037750006,0.0011923272,0.0014818611,0.00037996616,0.3720807,0.0050872248,0.12287203,0.39771432,0.020118771],"about_ca_topic_score_codex":0.00004699553,"about_ca_topic_score_gemma":0.000016554011,"teacher_disagreement_score":0.9473181,"about_ca_system_score_codex":0.00034079253,"about_ca_system_score_gemma":0.000031214862,"threshold_uncertainty_score":0.9999857},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003000038,0.00018209504,0.99414045,0.00027967556,0.002842988,0.0015090213,0.000013316786,0.00023477669,0.0004976629],"genre_scores_gemma":[0.7780324,0.0000020806344,0.22117586,0.00030692565,0.0003308089,0.00007684437,0.000006185389,0.000033441822,0.00003545129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561715,0.0001366828,0.0008940807,0.0014890736,0.001120373,0.00074260874],"domain_scores_gemma":[0.99553037,0.0013905948,0.0007884938,0.0016060476,0.0005481971,0.00013631911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025014072,0.0005993581,0.00092949456,0.00042249166,0.0006248171,0.0007979972,0.003992063,0.00036602607,0.0000022058819],"category_scores_gemma":[0.00012036992,0.0003669182,0.00025322352,0.0007179697,0.0007305129,0.00042789153,0.000689822,0.0004975103,0.000007729857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018891838,0.00013604082,0.00018623896,0.005386623,0.000067069624,0.00009308783,0.0018111262,0.20234737,0.00011549279,0.14302416,0.00005861334,0.6465853],"study_design_scores_gemma":[0.00046416427,0.0003571165,0.000046218574,0.0016562125,0.000025892485,0.00007459429,0.0000022497209,0.9937577,0.00048669038,0.0022577152,0.0003770568,0.00049438066],"about_ca_topic_score_codex":0.00006318316,"about_ca_topic_score_gemma":0.000088779925,"teacher_disagreement_score":0.7914103,"about_ca_system_score_codex":0.0003729584,"about_ca_system_score_gemma":0.0008967641,"threshold_uncertainty_score":0.9998783},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013943979,0.00034830256,0.9947252,0.00037192728,0.0014571607,0.0014469033,0.000010700664,0.00031426054,0.0013115439],"genre_scores_gemma":[0.03767416,0.00003918405,0.96082705,0.00035984584,0.00029297892,0.00012501371,0.000016924581,0.00006571557,0.00059911865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644995,0.000052221276,0.0005811455,0.0015778694,0.0006238041,0.0007150404],"domain_scores_gemma":[0.9970289,0.0005217475,0.00016191821,0.00097284757,0.0011165078,0.0001980855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057097257,0.0005738064,0.0005126475,0.00046140922,0.00032638648,0.00081169803,0.0019209557,0.00030485,0.00007002491],"category_scores_gemma":[0.0001148716,0.00053921505,0.00014226524,0.0007822366,0.0005123655,0.001780729,0.0003633992,0.0004205411,0.00006367852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059351482,0.00004113097,7.486064e-7,0.000024983035,0.000010700249,0.000003420328,0.0008682767,0.84868157,0.00010905837,0.026683856,0.000008759107,0.123561576],"study_design_scores_gemma":[0.0006802052,0.00021336193,0.000012468285,0.00011993924,0.0000123304,0.000012405713,7.8127886e-7,0.9596747,0.0024247838,0.035958763,0.00027971808,0.0006105039],"about_ca_topic_score_codex":0.000008002921,"about_ca_topic_score_gemma":0.000028321821,"teacher_disagreement_score":0.122951075,"about_ca_system_score_codex":0.00040742854,"about_ca_system_score_gemma":0.0009629592,"threshold_uncertainty_score":0.9997059},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000088558154,0.0019990068,0.99086607,0.0013854064,0.0015614381,0.00043833893,0.000019647236,0.00013277848,0.0035087764],"genre_scores_gemma":[0.437617,0.0003282271,0.5607173,0.00054112764,0.0003497384,0.000020118163,0.000026118922,0.000038195576,0.00036216108],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663335,0.0001245086,0.00076097227,0.00081069715,0.0010055332,0.00066492235],"domain_scores_gemma":[0.9941694,0.00156812,0.0005665659,0.0030781142,0.0004491753,0.00016863234],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016706281,0.00044838854,0.0005342251,0.00044661644,0.0011461184,0.00036276312,0.005813181,0.00022840162,0.000026069398],"category_scores_gemma":[0.00009132427,0.00034886427,0.00022859081,0.00075322756,0.004499982,0.0005849877,0.002496548,0.0010200196,0.00003875573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010431632,0.00009949932,0.00010515114,0.000031825493,0.000024682551,0.000002996917,0.00090805255,0.0034117736,0.00013972573,0.2937198,0.00008017246,0.7014659],"study_design_scores_gemma":[0.00041772384,0.00013644216,0.001629408,0.0002902063,0.000019305047,0.000045483233,0.0000010887222,0.48439032,0.0010712402,0.4998891,0.011425922,0.00068374723],"about_ca_topic_score_codex":0.00008413194,"about_ca_topic_score_gemma":0.0004075633,"teacher_disagreement_score":0.7007821,"about_ca_system_score_codex":0.00017776905,"about_ca_system_score_gemma":0.0002995661,"threshold_uncertainty_score":0.99989635},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000093174036,0.0004188919,0.9896028,0.0001044755,0.0050607612,0.00075603754,0.00001190511,0.000054683376,0.00389727],"genre_scores_gemma":[0.819721,0.000019988818,0.16736706,0.00057763443,0.0044823843,0.00030713071,0.000045631037,0.00010971357,0.0073694694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976348,0.00007192216,0.00056155096,0.0009050299,0.00046162558,0.0003650635],"domain_scores_gemma":[0.9985972,0.0005420193,0.0002423016,0.0004179023,0.000091877206,0.00010868456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007932289,0.0003577169,0.00037176695,0.00037505117,0.00034128243,0.0002855952,0.000594391,0.00027053102,0.000174727],"category_scores_gemma":[0.000038645423,0.00033566172,0.0000983339,0.00006420889,0.00022095542,0.00017180714,0.0001364291,0.0004553873,0.00013596076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116766234,0.00009090897,0.000320248,0.000078046265,0.00019230573,0.000019378886,0.015254433,0.55687153,0.00032849965,0.09546637,0.00022417409,0.33103734],"study_design_scores_gemma":[0.0009680601,0.0005356754,0.0002373405,0.0011759216,0.000051302708,0.000081121216,0.000060960036,0.9498419,0.0029203822,0.009244932,0.03345759,0.001424779],"about_ca_topic_score_codex":0.000016004016,"about_ca_topic_score_gemma":0.0000037252807,"teacher_disagreement_score":0.82223576,"about_ca_system_score_codex":0.00045941808,"about_ca_system_score_gemma":0.000100969024,"threshold_uncertainty_score":0.9999095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000100317,0.000056203673,0.971869,0.0012984729,0.0006605418,0.0005983989,0.0000055657647,0.00004424613,0.02536726],"genre_scores_gemma":[0.59271675,0.0000060952166,0.40627852,0.000781447,0.00006703324,0.000014140316,0.0000020955256,0.000020041603,0.00011387813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99568033,0.00021376302,0.0007104207,0.0011962476,0.0015800451,0.0006191864],"domain_scores_gemma":[0.99432933,0.0032877426,0.00029472457,0.0016483068,0.0003071306,0.00013276681],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004217525,0.00038663775,0.0005231334,0.0010710309,0.00015661978,0.00046494338,0.0042137946,0.00023162228,0.0018423576],"category_scores_gemma":[0.0012369475,0.00028716523,0.00010939881,0.0010693617,0.0008142229,0.00034908106,0.0007452373,0.0009906407,0.00001749097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032466076,0.00011105399,0.00005855309,0.00015764666,0.000015921478,0.0000980734,0.0014787514,0.0064607705,0.000108948225,0.026156345,0.0014261672,0.9638953],"study_design_scores_gemma":[0.00019448367,0.000082270824,0.0005784558,0.00038031643,0.0000015772878,0.000006049191,2.010733e-7,0.9219571,0.0004706399,0.07601691,0.00006980405,0.00024221919],"about_ca_topic_score_codex":0.00001997088,"about_ca_topic_score_gemma":0.000011776084,"teacher_disagreement_score":0.9636531,"about_ca_system_score_codex":0.00015938295,"about_ca_system_score_gemma":0.00059157336,"threshold_uncertainty_score":0.99995804},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000559123,0.0003878012,0.98311806,0.00072573713,0.0025100408,0.0005359701,0.0000028438571,0.00015475949,0.012508868],"genre_scores_gemma":[0.3386822,0.00026560551,0.65071523,0.0022800723,0.0017098465,0.000059421443,0.0000029277633,0.00012413858,0.006160572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955598,0.000058307578,0.0006845604,0.0016453499,0.0010725113,0.0009794786],"domain_scores_gemma":[0.99583817,0.0011117401,0.00045495067,0.0018705215,0.000522984,0.00020162553],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013735023,0.0006307155,0.00053624436,0.0004875195,0.0009536379,0.0006350187,0.0059788916,0.0003426074,0.000025610952],"category_scores_gemma":[0.00021655617,0.0004574891,0.00018407834,0.0008428751,0.0019027295,0.00085975457,0.0019990327,0.001143598,0.00024443652],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028277691,0.000033036027,0.000033728906,0.000011531462,0.000038691545,0.0001439309,0.02644034,0.01337758,0.00014106382,0.13204941,0.00014595625,0.82755643],"study_design_scores_gemma":[0.00007478071,0.0003629603,0.000024856732,0.0003956342,0.000009033128,0.00005887421,0.000007691645,0.527301,0.008484472,0.45887697,0.003569974,0.0008337305],"about_ca_topic_score_codex":0.00010318528,"about_ca_topic_score_gemma":0.0002833808,"teacher_disagreement_score":0.82672274,"about_ca_system_score_codex":0.0003948919,"about_ca_system_score_gemma":0.0007495941,"threshold_uncertainty_score":0.9997877},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012165449,0.00017679413,0.99445766,0.00003157092,0.0012965684,0.00021927388,0.000010807422,0.000167681,0.002423104],"genre_scores_gemma":[0.10121343,0.00008111271,0.89747936,0.00030533213,0.00070248696,0.0000046917366,0.0000293391,0.0001020965,0.00008214439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839497,0.000011074791,0.0003072692,0.00050887826,0.00041756086,0.00036026692],"domain_scores_gemma":[0.99930674,0.00009028862,0.0000824234,0.00034023853,0.000100333804,0.00007997499],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025927956,0.00032393247,0.0002636237,0.0003347823,0.000090853726,0.00014348392,0.00028545607,0.00032904788,0.000025967043],"category_scores_gemma":[0.000019159714,0.00035126507,0.000058933318,0.00021122175,0.00016651761,0.00025757222,0.000051159503,0.0005629956,0.00002627543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.512994e-7,0.000004776436,0.000009664642,0.000033331355,0.0000072220355,0.000036508365,0.00010729461,0.27650124,0.0007984178,0.000044819983,0.000006699465,0.7224492],"study_design_scores_gemma":[0.0001331962,0.000021248814,0.000015094253,0.00020937689,0.00000940159,0.00009863734,8.255245e-8,0.98695225,0.0035444484,0.00824786,0.00038079027,0.00038759515],"about_ca_topic_score_codex":0.000034890647,"about_ca_topic_score_gemma":0.000056781017,"teacher_disagreement_score":0.7220616,"about_ca_system_score_codex":0.0003551107,"about_ca_system_score_gemma":0.00007826327,"threshold_uncertainty_score":0.99989396},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008986673,0.0032291182,0.99069816,0.00019563042,0.0013344617,0.00053613883,0.000006625944,0.00009532432,0.0030058557],"genre_scores_gemma":[0.9300533,0.00021069763,0.0683539,0.00050183706,0.0007667428,0.000005499646,0.000010422321,0.000049181,0.000048453792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954419,0.00011727987,0.00092232815,0.0014857884,0.0008570069,0.0011756844],"domain_scores_gemma":[0.99566877,0.002289799,0.0006187618,0.00082181965,0.00036889478,0.00023195596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016791432,0.0006808392,0.0010624689,0.0012199698,0.0001883318,0.00028831506,0.0018173495,0.000449198,0.000037448826],"category_scores_gemma":[0.0002598891,0.0006810553,0.0001989801,0.0012480416,0.0009073031,0.00066793326,0.0011543599,0.001389495,0.000009842562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028840632,0.000056386285,0.0005657063,0.00003786029,0.000030543608,0.0002091781,0.0017055557,0.037655722,0.000069016176,0.008009626,0.000011216372,0.95162034],"study_design_scores_gemma":[0.00085700577,0.00019901367,0.0013363559,0.0022559243,0.000024193729,0.00018710812,0.000001281091,0.9706089,0.00071877235,0.022759039,0.000098499404,0.0009539077],"about_ca_topic_score_codex":0.000051057534,"about_ca_topic_score_gemma":0.00017941107,"teacher_disagreement_score":0.9506664,"about_ca_system_score_codex":0.00033742492,"about_ca_system_score_gemma":0.00036578407,"threshold_uncertainty_score":0.99956405},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0664748,0.000013589966,0.92728925,0.0001369606,0.00016147025,0.00050271215,0.000009464737,0.000028617313,0.0053831665],"genre_scores_gemma":[0.8955567,0.000001802107,0.10404802,0.00025104775,0.000045198467,0.000005867003,0.0000094291645,0.000009821022,0.000072120594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658644,0.00007333838,0.001180554,0.0006159593,0.0012614026,0.00028232974],"domain_scores_gemma":[0.99641657,0.0009821394,0.0010284956,0.00081946707,0.0006858482,0.000067467925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002775306,0.00025047432,0.00045702638,0.0012267445,0.00014997201,0.00036736423,0.0011213514,0.00017705902,0.000070686125],"category_scores_gemma":[0.00065027527,0.00019013973,0.000054664713,0.0014765024,0.00053059123,0.0013961293,0.00031896116,0.00039285928,0.000045961304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028765087,0.000022627219,0.001282656,0.000021848706,0.000006606773,0.0000054821694,0.004205022,0.3920574,0.00055810995,0.0152501855,0.000007194531,0.5865541],"study_design_scores_gemma":[0.0004219624,0.000121396886,0.0027022709,0.0006367376,0.000009316241,0.00004770532,0.000013444505,0.6694643,0.0015593169,0.3241699,0.00041728787,0.00043638458],"about_ca_topic_score_codex":0.00011981029,"about_ca_topic_score_gemma":0.00011986482,"teacher_disagreement_score":0.8290819,"about_ca_system_score_codex":0.00017155173,"about_ca_system_score_gemma":0.00032155524,"threshold_uncertainty_score":0.7753673},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.4103984e-7,0.66746926,0.33182457,0.000046178615,0.000111751004,0.00049523695,9.0491704e-7,0.000024247276,0.000027425689],"genre_scores_gemma":[0.0045978264,0.9897608,0.0032109355,0.0021660028,0.00015508485,0.00007720928,0.0000055350365,0.000026333004,2.7957773e-7],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.9971989,0.000046334186,0.00091984344,0.0007115,0.0008246047,0.00029883333],"domain_scores_gemma":[0.99763227,0.00013646965,0.0011427888,0.00066337,0.00040446097,0.000020634301],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026157296,0.00040557038,0.0020969133,0.0012687145,0.00011762059,0.00017128851,0.0010410519,0.00010468392,0.000009472112],"category_scores_gemma":[0.0007899476,0.00027437214,0.00021571404,0.0039293896,0.0002357283,0.0002641514,0.00024044389,0.00025961926,0.000016086684],"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":[4.9493525e-7,0.000028713972,0.000008019593,0.6773975,0.000012741984,0.0000013629233,0.0000040658697,0.000179331,3.877492e-8,0.000031389285,0.0000013751442,0.32233498],"study_design_scores_gemma":[0.00006569499,0.000007997587,0.0000032490466,0.9431105,0.0006487887,0.0000016121945,9.000195e-8,0.054516826,8.3824045e-7,0.00026422017,0.0010755535,0.00030462744],"about_ca_topic_score_codex":0.000045762143,"about_ca_topic_score_gemma":0.00000635893,"teacher_disagreement_score":0.32861364,"about_ca_system_score_codex":0.000077721576,"about_ca_system_score_gemma":0.00020990634,"threshold_uncertainty_score":0.99997085},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070788604,0.00018967628,0.8151352,0.0045225713,0.0036566628,0.0014520016,0.000018988372,0.00022436798,0.16772172],"genre_scores_gemma":[0.95623845,0.000037439833,0.0381534,0.001083441,0.0012743925,0.0000123025575,0.000010018452,0.000041859046,0.0031487108],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753946,0.00018769004,0.0003922116,0.0004891619,0.00096729555,0.0004241866],"domain_scores_gemma":[0.99799275,0.00096860883,0.00035017804,0.00022847755,0.00030802758,0.0001519529],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017150809,0.00024196313,0.0003988516,0.00028247095,0.000451621,0.0002559889,0.0009852301,0.0003685692,0.00008538174],"category_scores_gemma":[0.00057544117,0.0002450224,0.00010231165,0.00035697385,0.0028552103,0.0003429446,0.00020209541,0.000399941,0.00003621051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003114781,0.000047000245,0.0009714322,0.000091848466,0.000029180364,0.000010438272,0.048691254,0.00048382353,0.00017775009,0.10329891,0.0011141229,0.8450531],"study_design_scores_gemma":[0.0011748415,0.00049785024,0.0073934076,0.001995442,0.00007483363,0.000004164443,0.00009422007,0.0067914873,0.0011653919,0.94713825,0.031182311,0.0024877721],"about_ca_topic_score_codex":0.00034595712,"about_ca_topic_score_gemma":0.00029160935,"teacher_disagreement_score":0.94915956,"about_ca_system_score_codex":0.0002575328,"about_ca_system_score_gemma":0.0008511283,"threshold_uncertainty_score":0.99985844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028147094,0.0028901082,0.9870953,0.0004449998,0.0025798655,0.00039321955,0.000006649197,0.000230922,0.006077467],"genre_scores_gemma":[0.35438547,0.00014598403,0.6428699,0.0016155693,0.0008480063,0.00000650178,0.0000045262186,0.00006396011,0.00006013267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947935,0.00008170402,0.0006436168,0.0017136604,0.0014892665,0.0012782995],"domain_scores_gemma":[0.99690044,0.00033625483,0.00036082356,0.001874235,0.00018783547,0.00034040245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013066733,0.000780755,0.0007447274,0.00070690725,0.0003445628,0.00080475124,0.0043222737,0.0005005869,0.000046239926],"category_scores_gemma":[0.00006468583,0.0006591287,0.00023594844,0.0006891346,0.0010840456,0.0009806673,0.0013764324,0.001032739,0.000089916066],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051093766,0.000044952296,0.000055761582,0.00004037815,0.000015298847,0.00009328561,0.0012735107,0.024523217,0.00007088819,0.02922485,0.000017365184,0.9446354],"study_design_scores_gemma":[0.00028257922,0.00012299661,0.00015099393,0.0003168712,0.000023868224,0.00030301994,1.8959042e-7,0.6807968,0.000374652,0.3139221,0.002605371,0.0011005666],"about_ca_topic_score_codex":0.00003179191,"about_ca_topic_score_gemma":0.000013880681,"teacher_disagreement_score":0.9435348,"about_ca_system_score_codex":0.0003895481,"about_ca_system_score_gemma":0.00051604473,"threshold_uncertainty_score":0.999586},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5494529,0.00019169542,0.4501402,0.00002648122,0.0001297112,0.00005372828,4.3740616e-7,0.0000016219494,0.0000031868626],"genre_scores_gemma":[0.87569433,0.00002337675,0.12410876,0.00008813479,0.000078314384,0.0000027680228,0.0000010132514,0.000003155027,1.4584187e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991853,0.000030938587,0.00013767695,0.00033382824,0.00011091554,0.00020131156],"domain_scores_gemma":[0.99968445,0.000025073849,0.0000516839,0.00016808118,0.00003517837,0.000035504785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036307058,0.000079007084,0.00010540345,0.00011216253,0.000029073199,0.000023301582,0.00017228189,0.000065954664,0.0000013505021],"category_scores_gemma":[0.00008575612,0.000075135256,0.000015999021,0.00033730982,0.0002665392,0.0000055139685,0.00010063354,0.00006417646,2.7361313e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049508762,0.00001248468,0.08866618,0.0000113946935,0.0000014528363,5.054018e-7,0.00010539204,0.0047379397,0.56062603,0.000012805753,1.92738e-7,0.3458207],"study_design_scores_gemma":[0.00056048256,0.00044230156,0.35643235,0.00015397265,0.0000033299962,0.00004913157,0.0000028822283,0.10103853,0.53812027,0.0028975017,0.000051549116,0.00024770782],"about_ca_topic_score_codex":0.000009680159,"about_ca_topic_score_gemma":0.000031732598,"teacher_disagreement_score":0.34557298,"about_ca_system_score_codex":0.000013978142,"about_ca_system_score_gemma":0.000035078418,"threshold_uncertainty_score":0.30639267},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035093778,0.0005500956,0.9746396,0.0005034747,0.005851042,0.001530646,0.000011624107,0.00008234609,0.013321789],"genre_scores_gemma":[0.9727534,0.000027324444,0.019813873,0.001608106,0.00091313553,0.0005038906,0.000005185467,0.00006309229,0.0043119825],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979249,0.000039222017,0.0004295847,0.00080576155,0.00038619747,0.0004143161],"domain_scores_gemma":[0.99841523,0.0003218501,0.00029349877,0.00052921905,0.00035860535,0.00008161918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000423472,0.00032874933,0.0004852802,0.00031895278,0.00014776556,0.00008578822,0.0006012654,0.00023417638,0.0005823052],"category_scores_gemma":[0.000119765224,0.0002781064,0.0001816404,0.00015116167,0.0005699757,0.00024244095,0.00022458514,0.00044128695,0.00007165118],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016064532,0.00021751765,0.00024769458,0.00020726678,0.00015152147,0.000008000039,0.018593403,0.003587816,0.0016581798,0.019311702,0.00046724975,0.955389],"study_design_scores_gemma":[0.009841588,0.0072108842,0.01648881,0.010062952,0.0004209841,0.00007874787,0.0005041815,0.14905319,0.12519814,0.6210323,0.05160886,0.008499395],"about_ca_topic_score_codex":0.00032808757,"about_ca_topic_score_gemma":0.0001165267,"teacher_disagreement_score":0.969244,"about_ca_system_score_codex":0.00022709377,"about_ca_system_score_gemma":0.00014182088,"threshold_uncertainty_score":0.9999671},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002043082,0.0017513189,0.99108917,0.00029560807,0.0010225053,0.0006551284,0.0000074552177,0.00046517502,0.0046932087],"genre_scores_gemma":[0.11191225,0.00020660572,0.8842846,0.0024087352,0.00044703527,0.000012732308,0.0000072918547,0.00007550626,0.00064520433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99442047,0.0000720163,0.0007606911,0.0022425696,0.0014044984,0.0010997731],"domain_scores_gemma":[0.9960209,0.00097432337,0.0005781323,0.0017238171,0.000405507,0.0002973055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011959414,0.00081700174,0.0009461906,0.00144211,0.00047156867,0.0008360686,0.0037341104,0.00047544044,0.0000117816635],"category_scores_gemma":[0.00030590114,0.0008014158,0.00020727937,0.0020496857,0.00088475784,0.0010519743,0.0015249928,0.0011392627,0.000040906838],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012529768,0.000026581341,0.00001575462,0.000027241558,0.000012391085,0.00006209202,0.00018870107,0.0027450328,0.00089149486,0.0062746895,0.00023593481,0.98950756],"study_design_scores_gemma":[0.00069316523,0.0010188475,0.00004489744,0.0017176291,0.000027065787,0.00018061291,3.8272768e-7,0.71044976,0.044947103,0.2140348,0.0244981,0.0023876512],"about_ca_topic_score_codex":0.000019502251,"about_ca_topic_score_gemma":0.000006935681,"teacher_disagreement_score":0.9871199,"about_ca_system_score_codex":0.00074659294,"about_ca_system_score_gemma":0.0004955296,"threshold_uncertainty_score":0.99944365},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001958634,0.00020279876,0.98948634,0.00021752069,0.002258788,0.00042897812,0.0000038375433,0.0003101949,0.0070719873],"genre_scores_gemma":[0.023389991,0.000017974231,0.9751744,0.00089907786,0.00025940745,0.000018426244,0.0000088183215,0.000038297196,0.00019358525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607277,0.00006053964,0.0006312373,0.0016749549,0.00094433717,0.0006161418],"domain_scores_gemma":[0.99615616,0.00027852852,0.00047661902,0.0025688717,0.0003508859,0.00016896184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017085497,0.0005166409,0.0004470757,0.00097460015,0.000269327,0.00041625474,0.0045729806,0.00041668443,0.000052225834],"category_scores_gemma":[0.00020017034,0.000508997,0.0001374821,0.0007354848,0.00072208716,0.0007968486,0.0006674996,0.00076968747,0.00022359799],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008996807,0.000039118488,0.000027844993,0.00004024399,0.0000064583123,0.000010338605,0.0004290462,0.011867726,0.0003211976,0.16751456,0.000010417337,0.819724],"study_design_scores_gemma":[0.00024936142,0.00021040026,0.000624504,0.00029234184,0.00001087542,0.000025861313,4.708323e-8,0.72796875,0.009650641,0.2543347,0.005699767,0.00093279104],"about_ca_topic_score_codex":0.000020865093,"about_ca_topic_score_gemma":0.000010551435,"teacher_disagreement_score":0.8187913,"about_ca_system_score_codex":0.0003736634,"about_ca_system_score_gemma":0.00067248975,"threshold_uncertainty_score":0.9997362},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048814032,0.00023575885,0.9913848,0.0012472614,0.00097628776,0.00021097087,0.000008777631,0.00020026817,0.005687066],"genre_scores_gemma":[0.042974386,0.000034165892,0.9536561,0.0015363862,0.0006962584,0.000017718483,0.000013733605,0.00003607561,0.0010351845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967936,0.000019606197,0.00041038953,0.0014667335,0.00071344274,0.0005961893],"domain_scores_gemma":[0.99725026,0.0005126747,0.0002629253,0.0016172397,0.00016871306,0.00018821009],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007937732,0.0004253537,0.0004555455,0.00050273014,0.0003041316,0.0008195774,0.00391939,0.00021979275,0.000017385302],"category_scores_gemma":[0.000074000134,0.00039047436,0.000090062924,0.00047635526,0.00059051294,0.00039738306,0.0011457928,0.00048565379,0.000095927746],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.8412515e-7,0.000009689851,0.00002097596,0.000011254577,0.0000057263123,0.000016608534,0.00033927566,0.0014501709,0.00005064178,0.051684305,0.00013786454,0.9462728],"study_design_scores_gemma":[0.00024503915,0.00012706894,0.00012444858,0.0003447519,0.000008908682,0.00007655896,2.498675e-7,0.92288303,0.0007091999,0.04902763,0.025644632,0.00080846593],"about_ca_topic_score_codex":0.000020642152,"about_ca_topic_score_gemma":0.00006440466,"teacher_disagreement_score":0.9454643,"about_ca_system_score_codex":0.0001185617,"about_ca_system_score_gemma":0.00031217374,"threshold_uncertainty_score":0.99985474},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2778293,0.0002354289,0.7207523,0.00015031517,0.00043784635,0.0004515474,0.0000037302136,0.00012426284,0.00001529407],"genre_scores_gemma":[0.52661604,0.0000038234007,0.47275805,0.0005013825,0.000076072145,0.0000221815,0.0000037201773,0.000017957484,7.5851176e-7],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997301,0.00006919822,0.0003882724,0.0009103938,0.00043886164,0.000892294],"domain_scores_gemma":[0.99666226,0.0021856914,0.0001654478,0.0004539714,0.00032913356,0.00020349471],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013131045,0.00031079925,0.00041378418,0.0014772922,0.00045883367,0.00026290998,0.000362181,0.000054002954,0.0000032459943],"category_scores_gemma":[0.002130347,0.00026496995,0.00015284213,0.004971532,0.0007541428,0.00036952418,0.00007479061,0.00042580956,0.000005998408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019674041,0.00037578214,0.52319235,0.0002711108,0.0000461128,0.000007630555,0.0042873486,0.04977247,0.129045,0.00004626908,0.000014595664,0.2927446],"study_design_scores_gemma":[0.0023619418,0.00088305905,0.06168203,0.00048174424,0.0000482791,0.000251369,0.000035014677,0.9108188,0.020754112,0.0017267322,0.0003723503,0.00058452226],"about_ca_topic_score_codex":0.00012001176,"about_ca_topic_score_gemma":0.000028105233,"teacher_disagreement_score":0.8610464,"about_ca_system_score_codex":0.00007781292,"about_ca_system_score_gemma":0.0001274432,"threshold_uncertainty_score":0.9999803},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081186155,0.0045766947,0.97288215,0.00010239864,0.00071904453,0.00048228374,0.0000099083445,0.000063666834,0.013045227],"genre_scores_gemma":[0.9767292,0.000106475534,0.017906692,0.0005580443,0.0011041798,0.000008286733,0.00004734626,0.00004447072,0.0034952627],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99796385,0.00003207126,0.0002628161,0.000999463,0.00030144418,0.0004403743],"domain_scores_gemma":[0.9989068,0.000040964725,0.00016487589,0.00064156775,0.00014268776,0.00010311632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003716997,0.00037798742,0.00035606808,0.0001362395,0.000114558534,0.00010173326,0.0007954495,0.0003905857,0.000015771995],"category_scores_gemma":[0.000040313524,0.00024634792,0.00008982648,0.00012051696,0.00051436736,0.0000060715643,0.0004202176,0.00031772078,0.000012537589],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041064378,0.00021926535,0.0009339891,0.00033333822,0.00023835801,0.00070337567,0.00050269853,0.009138308,0.08310112,0.006359266,0.0005057872,0.89755386],"study_design_scores_gemma":[0.007960549,0.022289285,0.006145574,0.0070548723,0.00048510503,0.0038596622,0.000019893712,0.050597895,0.48449934,0.076208726,0.323908,0.016971106],"about_ca_topic_score_codex":0.000021695467,"about_ca_topic_score_gemma":0.000016330901,"teacher_disagreement_score":0.96861064,"about_ca_system_score_codex":0.000035351502,"about_ca_system_score_gemma":0.00013733422,"threshold_uncertainty_score":0.99999887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064658007,0.00035060607,0.99150527,0.001719794,0.0022757768,0.00086183345,0.000024065394,0.00028640483,0.002329687],"genre_scores_gemma":[0.18190734,0.000017912114,0.8041198,0.011427904,0.001768504,0.00005643802,0.00006828801,0.00019098923,0.00044282174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99409324,0.00007542772,0.0010056488,0.0023099266,0.0013820583,0.0011336997],"domain_scores_gemma":[0.99372333,0.0017346774,0.00084400346,0.002499229,0.00087742234,0.00032131985],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000942161,0.00096318434,0.0011428946,0.0013461754,0.00033266062,0.0003134602,0.005693901,0.00055548194,0.000013922511],"category_scores_gemma":[0.00009215376,0.00084558385,0.0003430829,0.001528878,0.00047311367,0.00032192032,0.001811592,0.0009018046,0.000019514915],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008422455,0.0001227025,0.0000366876,0.00078140164,0.00007188925,0.000015915304,0.0054954085,0.076882966,0.0025377187,0.06053657,0.000019571458,0.85341495],"study_design_scores_gemma":[0.002675671,0.0021133958,0.00011278432,0.002635756,0.0001230096,0.00021525825,0.000004514711,0.4836123,0.03956719,0.36262974,0.10314636,0.003164017],"about_ca_topic_score_codex":0.000098484634,"about_ca_topic_score_gemma":0.00049838424,"teacher_disagreement_score":0.8502509,"about_ca_system_score_codex":0.00017313377,"about_ca_system_score_gemma":0.00049024355,"threshold_uncertainty_score":0.99968576},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027309918,0.00012243833,0.99557763,0.00032587216,0.00036065702,0.0011797496,3.3561608e-7,0.0002153015,0.002190682],"genre_scores_gemma":[0.07440785,0.00003991805,0.9240549,0.00062060665,0.0002074843,0.00009004948,0.000022081287,0.000025879715,0.00053123286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962191,0.00008606693,0.0006017115,0.0011898413,0.0014946305,0.00040862733],"domain_scores_gemma":[0.9977623,0.00031879012,0.0005112301,0.00065651815,0.00058603496,0.0001650875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022649502,0.00036472065,0.0003097747,0.00044066555,0.0002570961,0.00081230514,0.0010041674,0.00020381024,0.00010316472],"category_scores_gemma":[0.00065647624,0.0003330588,0.000049404458,0.00028778674,0.0006599786,0.0011286234,0.000703316,0.000667349,0.00002423149],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016482422,0.0000068748973,0.0000032490868,0.000061818144,0.0000034704767,0.000006604677,0.0003121903,0.014840647,0.0024839076,0.0016316728,0.000015901831,0.980632],"study_design_scores_gemma":[0.00019496116,0.0001939125,0.000016274316,0.00019875249,0.000010685871,0.00002410208,2.8198224e-7,0.9364811,0.002940133,0.059545025,0.000055806373,0.0003389378],"about_ca_topic_score_codex":0.00010945023,"about_ca_topic_score_gemma":0.00002685474,"teacher_disagreement_score":0.9802931,"about_ca_system_score_codex":0.00055749,"about_ca_system_score_gemma":0.0004900563,"threshold_uncertainty_score":0.99991214},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005249228,0.0005336345,0.9959064,0.00046095747,0.00059136824,0.000559233,0.000026959617,0.000042186904,0.0013542953],"genre_scores_gemma":[0.8990348,0.000079936275,0.09973579,0.00084925944,0.00006310014,0.000016251495,0.00001332992,0.000024770085,0.00018274998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684507,0.0000647233,0.0009615137,0.0007989419,0.0007677205,0.0005620047],"domain_scores_gemma":[0.99681574,0.00029013222,0.000552138,0.0019888824,0.00026819317,0.00008492695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014030045,0.00036448755,0.00047976073,0.00040299003,0.00023167935,0.00021837652,0.00409833,0.00021171704,0.0000043655195],"category_scores_gemma":[0.000024547035,0.00028816014,0.0001425071,0.00094822416,0.0005386093,0.00044150627,0.0012551814,0.00080511114,0.000004069363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041201106,0.000027160644,0.00022929603,0.000017347587,0.000006479902,0.000005134884,0.0010315899,0.87139744,0.000019580013,0.025483595,0.000026226178,0.10175206],"study_design_scores_gemma":[0.0003012791,0.000018961357,0.0007062107,0.00044762663,0.0000035475725,0.000012664704,4.979045e-7,0.9523796,0.00012790237,0.045264445,0.0004474298,0.000289833],"about_ca_topic_score_codex":0.00016492677,"about_ca_topic_score_gemma":0.0015814048,"teacher_disagreement_score":0.8985099,"about_ca_system_score_codex":0.0002922069,"about_ca_system_score_gemma":0.0004124418,"threshold_uncertainty_score":0.999957},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055890763,0.00008453669,0.9955934,0.0001972883,0.0008675138,0.0003821416,0.000011304435,0.000054003165,0.0027538822],"genre_scores_gemma":[0.18717667,0.00007263768,0.81099254,0.0010538829,0.00021446636,0.000009704279,0.000099833596,0.00002797115,0.0003523168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625355,0.00006613704,0.00064157386,0.0010092403,0.0017174908,0.00031198838],"domain_scores_gemma":[0.99725616,0.00018816326,0.00051810866,0.0010532908,0.0008674313,0.00011685447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017201892,0.0003327341,0.00038934575,0.00079124677,0.00015121614,0.00022954018,0.0021149158,0.00021062828,0.00017572402],"category_scores_gemma":[0.00014527046,0.00030435194,0.00009927306,0.00056567305,0.00040310773,0.0006840046,0.0011058169,0.00035660193,0.000024340197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003671099,0.00018305778,0.0006581189,0.00006293814,0.000026252113,0.000011507704,0.0011033068,0.06438694,0.0001496541,0.07956393,0.00011390237,0.8537367],"study_design_scores_gemma":[0.00034437334,0.00009363956,0.0011277257,0.00028363182,0.000015906302,0.0000122942865,1.2816672e-7,0.97151405,0.0002592352,0.025337134,0.0006874569,0.000324439],"about_ca_topic_score_codex":0.000019804029,"about_ca_topic_score_gemma":0.00008542893,"teacher_disagreement_score":0.9071271,"about_ca_system_score_codex":0.00033309517,"about_ca_system_score_gemma":0.0013827343,"threshold_uncertainty_score":0.9999409},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005059853,0.00018113936,0.9965271,0.00025603073,0.0014884094,0.00032923731,0.000015969857,0.00003669418,0.0006594754],"genre_scores_gemma":[0.7178171,0.0000065824793,0.2816005,0.00030744192,0.00016501971,0.000003161712,0.0000041894164,0.000019668492,0.00007629345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968083,0.0000627146,0.00065879634,0.00091545907,0.001199601,0.00035515902],"domain_scores_gemma":[0.99708354,0.00029973802,0.00070505566,0.0015313312,0.00029640473,0.000083921695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007592216,0.0003541082,0.0005294218,0.00034536654,0.00015060036,0.00011596065,0.0033701716,0.00018866968,0.000005058452],"category_scores_gemma":[0.0000598035,0.0002308629,0.0001865899,0.00047579306,0.0007641548,0.00012344478,0.0024857102,0.00043227425,0.0000056833273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008274109,0.000045453457,0.00007111719,0.00012515209,0.000012744317,0.000008872284,0.0010147378,0.44493034,0.0004026409,0.02507088,0.00004111891,0.5282687],"study_design_scores_gemma":[0.00021542555,0.00012288407,0.00044060423,0.0008251939,0.000007949955,0.00001674217,1.2025318e-7,0.9705687,0.001375782,0.025898974,0.0002570289,0.00027060116],"about_ca_topic_score_codex":0.000031093074,"about_ca_topic_score_gemma":0.000008885721,"teacher_disagreement_score":0.71731114,"about_ca_system_score_codex":0.00008268953,"about_ca_system_score_gemma":0.00027492468,"threshold_uncertainty_score":0.94143164},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037204695,0.00014101525,0.99767,0.00006652273,0.00062378956,0.0009916336,0.000006111289,0.0003392224,0.00015801785],"genre_scores_gemma":[0.0045914343,0.000011094491,0.99362594,0.0009716009,0.00061077194,0.000022629876,0.000025687677,0.000062027,0.000078799894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960797,0.00004806664,0.00057224644,0.0019714553,0.0006292718,0.0006993028],"domain_scores_gemma":[0.997297,0.00033843287,0.0004339643,0.0012187329,0.0005144926,0.00019737985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015793977,0.00059611065,0.00064772204,0.0007722375,0.00035228077,0.00058909506,0.0025538802,0.00042293736,0.0000015547641],"category_scores_gemma":[0.00016064203,0.00055579795,0.00015372776,0.0006785812,0.00031849483,0.0011702332,0.00087567687,0.0005556468,0.0000012835314],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013178539,0.000069348236,0.0000021420867,0.000074563046,0.000009087252,0.0000035751707,0.00022234609,0.017104924,0.025418114,0.010700537,0.0000018313741,0.9463804],"study_design_scores_gemma":[0.0002945003,0.00042176506,0.0000039363617,0.00009606981,0.000013574007,0.00008849035,1.2023739e-7,0.9083611,0.029179761,0.060561772,0.0003474798,0.000631432],"about_ca_topic_score_codex":0.00003595888,"about_ca_topic_score_gemma":0.0000075191733,"teacher_disagreement_score":0.9457489,"about_ca_system_score_codex":0.00030568324,"about_ca_system_score_gemma":0.0005096782,"threshold_uncertainty_score":0.99968934},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032279953,0.0008575326,0.9922038,0.0008056143,0.00392156,0.0005357852,0.00000859488,0.00021182492,0.0014230326],"genre_scores_gemma":[0.030719994,0.000020587242,0.9645872,0.0018033796,0.0021351918,0.000023793384,0.0000131496145,0.000048209225,0.0006484919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996528,0.000019633077,0.0005100756,0.0013207926,0.00072878983,0.0008926703],"domain_scores_gemma":[0.9976661,0.00059714454,0.00028407865,0.0009775101,0.00022626865,0.00024885463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007296367,0.00052458775,0.0004996337,0.0006284518,0.00027376626,0.0005157938,0.002648178,0.0003038804,0.000018887868],"category_scores_gemma":[0.00006814931,0.000482326,0.00020891592,0.00041884548,0.00040644442,0.0008800516,0.001052698,0.00045195932,0.00006416011],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037484197,0.000034114797,0.0000038671815,0.000024233706,0.000008114207,0.0000079410465,0.00036855953,0.002508918,0.00024101739,0.018380739,0.000054409287,0.97836435],"study_design_scores_gemma":[0.00056997506,0.00035833323,0.00006412107,0.00026896325,0.000017988697,0.000077395176,9.9275255e-8,0.55425763,0.0043711225,0.3880999,0.05073405,0.0011803997],"about_ca_topic_score_codex":0.000012114627,"about_ca_topic_score_gemma":0.000022481234,"teacher_disagreement_score":0.97718394,"about_ca_system_score_codex":0.00032969902,"about_ca_system_score_gemma":0.00036371357,"threshold_uncertainty_score":0.99976283},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024351252,0.00021872041,0.9890975,0.00069814204,0.0012017636,0.00030380808,0.0000034135915,0.00038134307,0.007851836],"genre_scores_gemma":[0.3662379,0.00003970924,0.62335175,0.0075566885,0.00095639634,0.000018311894,0.000011608924,0.00010712705,0.0017204678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995723,0.000048292157,0.00048266197,0.0018567103,0.0010812575,0.0008080944],"domain_scores_gemma":[0.9963329,0.0006225393,0.00033457024,0.002286968,0.00018190041,0.00024111127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008595326,0.0006876994,0.00065384485,0.00085176795,0.00027198787,0.00065293594,0.004614451,0.0003531337,0.000030365545],"category_scores_gemma":[0.00004164308,0.0005371981,0.00012954223,0.0006164484,0.0009452718,0.00051083043,0.0014829272,0.0008413811,0.00011357355],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011349236,0.000027733251,0.00003690593,0.000044494096,0.000017150098,0.0003496915,0.0005988873,0.0050700237,0.00015390113,0.07102812,0.00005478586,0.92260695],"study_design_scores_gemma":[0.0006351745,0.0008406629,0.0002421845,0.0009906502,0.000018489913,0.0006068362,2.1488798e-7,0.7434725,0.0019068617,0.24241701,0.0072388,0.0016306094],"about_ca_topic_score_codex":0.000010264401,"about_ca_topic_score_gemma":0.000023121986,"teacher_disagreement_score":0.92097634,"about_ca_system_score_codex":0.00016322716,"about_ca_system_score_gemma":0.00045551287,"threshold_uncertainty_score":0.99970794},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008081984,0.0002665011,0.9925238,0.0009580206,0.001159498,0.0005047148,0.0042556296,0.00015236334,0.00017138982],"genre_scores_gemma":[0.0006136235,0.000050748917,0.99332047,0.0011463574,0.0011183172,0.000020634454,0.0034565842,0.000047410187,0.00022588174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938982,0.00003125602,0.00071388035,0.0036285303,0.00094267906,0.0007854625],"domain_scores_gemma":[0.98789674,0.0012363266,0.00043739064,0.009949345,0.00023124527,0.0002489713],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016772508,0.0005795656,0.000667954,0.00043091743,0.00038902476,0.0013070547,0.019953655,0.00028543174,0.000018489485],"category_scores_gemma":[0.00018365399,0.00054622826,0.00007217445,0.00043968958,0.00033258504,0.0010741109,0.010162798,0.00052693876,0.00002933611],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.5789586e-7,0.00002316188,0.000021469335,0.000017083128,0.000025266856,0.000013801893,0.00010284558,0.0018962126,0.0000059496965,0.0015067632,0.0008220288,0.99556464],"study_design_scores_gemma":[0.00026575537,0.000070181675,0.000025241898,0.0003478715,0.00003454831,0.00001464639,3.4921365e-7,0.95019233,0.000050537885,0.023107762,0.025268741,0.00062201207],"about_ca_topic_score_codex":0.00037834028,"about_ca_topic_score_gemma":0.00032596086,"teacher_disagreement_score":0.99494267,"about_ca_system_score_codex":0.00017974623,"about_ca_system_score_gemma":0.0006679474,"threshold_uncertainty_score":0.9997297},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008886158,0.00015687774,0.9942468,0.00046641193,0.00039529635,0.00022404094,0.000020762742,0.00003891012,0.003562292],"genre_scores_gemma":[0.55381453,0.00008878291,0.4246412,0.0073819226,0.0017408604,0.000031872118,0.0013047287,0.000111113826,0.010885001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984084,0.000027484342,0.00034912105,0.00054135773,0.00039017445,0.00028350286],"domain_scores_gemma":[0.99900746,0.000054848315,0.000121195306,0.0005698755,0.0001540152,0.00009260989],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043476556,0.00029980997,0.00022051424,0.00013963087,0.00018524982,0.00016022056,0.0006776404,0.00032175347,0.0000555903],"category_scores_gemma":[0.00018620923,0.00027576464,0.00007596354,0.00008549292,0.000363574,0.000009456754,0.0003397592,0.0003476253,0.000036607784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003643517,0.00007160958,0.00060176064,0.00016417775,0.00007710252,0.0000088394745,0.00055681163,0.6573034,0.03877659,0.011892362,0.005949242,0.28456166],"study_design_scores_gemma":[0.00044384517,0.00034960633,0.00010969351,0.00012046949,0.000013298695,0.000055467295,1.6023766e-7,0.8976054,0.011607421,0.0029982908,0.08591123,0.00078507466],"about_ca_topic_score_codex":0.000007949885,"about_ca_topic_score_gemma":0.000038893682,"teacher_disagreement_score":0.5696056,"about_ca_system_score_codex":0.00005595085,"about_ca_system_score_gemma":0.000311844,"threshold_uncertainty_score":0.9999695},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041096477,0.0029588398,0.98083276,0.008198198,0.0051776827,0.0006771964,0.0000039127867,0.00073692517,0.001003513],"genre_scores_gemma":[0.6279723,0.00029335072,0.36090022,0.004046764,0.0008748794,0.00004745261,0.0000047871067,0.000070198956,0.0057900576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947272,0.000082357976,0.0007761546,0.0019137659,0.0012041696,0.0012963716],"domain_scores_gemma":[0.9948393,0.0018577365,0.000404222,0.0021186315,0.00057850115,0.00020161938],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00092148804,0.00075847335,0.0007482146,0.0009542384,0.00089556683,0.00082626974,0.00911589,0.0005362134,0.000008764919],"category_scores_gemma":[0.00070571294,0.00050581887,0.00017174102,0.0014362539,0.002434082,0.00054563157,0.0042821434,0.0015908086,0.000092451904],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001002721,0.000033609595,0.00021817687,0.00002113468,0.00010189685,0.0010624168,0.0022890484,0.01566518,0.00025563032,0.08653336,0.012187658,0.8815316],"study_design_scores_gemma":[0.0011408483,0.0009465642,0.0012427679,0.00093546504,0.00002897994,0.0019271976,0.0000032642668,0.7000927,0.0026987693,0.16955274,0.118834905,0.0025958205],"about_ca_topic_score_codex":0.000059885584,"about_ca_topic_score_gemma":0.0009966627,"teacher_disagreement_score":0.8789358,"about_ca_system_score_codex":0.000873018,"about_ca_system_score_gemma":0.00093986996,"threshold_uncertainty_score":0.99973935},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012623581,0.00038605786,0.9405138,0.00022230753,0.0020426793,0.00049946207,0.0000350162,0.00009889867,0.043578193],"genre_scores_gemma":[0.98558086,0.0000045154234,0.011205923,0.0004586605,0.00041143666,0.000008064918,0.0000069645835,0.000040463718,0.0022831238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761,0.000016997787,0.00067171647,0.0010650228,0.00013580549,0.0005004569],"domain_scores_gemma":[0.99824816,0.00029825277,0.0006318248,0.0006346275,0.00006910402,0.000118028736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013100253,0.00037235653,0.0006631917,0.00043316197,0.00018238738,0.0002996382,0.0009025487,0.00023386131,0.00050424924],"category_scores_gemma":[0.00013458604,0.00034444575,0.000100383324,0.00023310092,0.00044304106,0.00026358038,0.00019877624,0.0005168733,0.0006057586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030084366,0.0000636682,0.008081446,0.00025255565,0.00007397407,0.000061788785,0.0017534981,0.028631926,0.000009686992,0.88382643,0.00005918864,0.077155724],"study_design_scores_gemma":[0.0012539541,0.00041752012,0.006132945,0.0014685451,0.00001618104,0.00008560682,0.0000012946971,0.27937496,0.00018519293,0.6991922,0.0096257785,0.0022457906],"about_ca_topic_score_codex":0.00011455167,"about_ca_topic_score_gemma":0.000030881714,"teacher_disagreement_score":0.97295725,"about_ca_system_score_codex":0.00020482163,"about_ca_system_score_gemma":0.00006171567,"threshold_uncertainty_score":0.99990076},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046573707,0.00014831396,0.99563503,0.0005016024,0.0005968312,0.0011070783,0.000011260349,0.00018968427,0.0013444308],"genre_scores_gemma":[0.4671346,0.0000069775174,0.53195703,0.00040341815,0.00019291135,0.00010028987,0.00001529679,0.00002462486,0.00016487142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677163,0.00004137115,0.00062141113,0.0013832634,0.00067544234,0.00050685706],"domain_scores_gemma":[0.9979969,0.00071227906,0.00026595237,0.0006142333,0.00030426236,0.00010634928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006776124,0.00041289386,0.00046700815,0.00090027275,0.00021983267,0.00034169102,0.0015637043,0.00027155888,0.000008436348],"category_scores_gemma":[0.000077111785,0.00041273943,0.00009445732,0.0005067151,0.00016864853,0.0006553687,0.0003225064,0.0004169631,0.000012207816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008940723,0.00007090646,0.000043908403,0.00022310994,0.000017840952,0.000013378976,0.02086657,0.58774066,0.000008114431,0.10420942,0.0000059655745,0.2867912],"study_design_scores_gemma":[0.00032809642,0.00004557709,0.00002710788,0.00092344044,0.0000069753146,0.000021545862,0.0000017520437,0.85065275,0.00002300373,0.14760315,0.000009151538,0.00035746384],"about_ca_topic_score_codex":0.000015359292,"about_ca_topic_score_gemma":0.00012657682,"teacher_disagreement_score":0.46666884,"about_ca_system_score_codex":0.00077221787,"about_ca_system_score_gemma":0.0016389173,"threshold_uncertainty_score":0.99983245},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008716168,0.0008752508,0.99398875,0.00011580235,0.0010159225,0.0009331975,0.000094061994,0.0028434787,0.00004634968],"genre_scores_gemma":[0.00632364,0.00002767613,0.9915872,0.0010143523,0.00054703216,0.0001137266,0.000020406354,0.00007274708,0.00029318134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955425,0.000048295922,0.00069355656,0.0021509717,0.00070514,0.0008594845],"domain_scores_gemma":[0.98871243,0.008568959,0.0004740979,0.0014523894,0.000587172,0.00020492257],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006093111,0.0007848838,0.0006989356,0.00071584806,0.00045335232,0.0011292059,0.003025545,0.00030357507,0.000013284328],"category_scores_gemma":[0.0018315183,0.0007027862,0.00018558998,0.00047073496,0.00049065985,0.0004942969,0.0012832469,0.00068329956,0.000030185667],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001191534,0.000040842704,0.00020919001,0.000016482523,0.000011396902,0.000048453006,0.00060726126,0.005511181,0.00019025498,0.000037307414,0.000084404455,0.993242],"study_design_scores_gemma":[0.0002743693,0.00022850462,0.0006097455,0.00032283162,0.00000963973,0.000036812584,4.043368e-8,0.8111836,0.000931026,0.18562578,0.00007925001,0.00069842604],"about_ca_topic_score_codex":0.00043626444,"about_ca_topic_score_gemma":0.00007198584,"teacher_disagreement_score":0.99254364,"about_ca_system_score_codex":0.00023247108,"about_ca_system_score_gemma":0.00045831813,"threshold_uncertainty_score":0.99990773},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026794718,0.0011019058,0.989875,0.00016639552,0.0028954512,0.00031738222,0.000003798712,0.00016938068,0.005202713],"genre_scores_gemma":[0.7207037,0.00017098372,0.27599528,0.0014495305,0.0009222454,0.000008259515,0.0000048505976,0.00008245429,0.00066269765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944527,0.000084449064,0.00082109484,0.0017957164,0.0016157753,0.0012302623],"domain_scores_gemma":[0.994654,0.0014286685,0.0005892915,0.002650154,0.0003249339,0.00035293863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011766218,0.0007452561,0.0008144018,0.0009891775,0.00023964011,0.00022613199,0.004521768,0.0006062599,0.00004352042],"category_scores_gemma":[0.00014770159,0.0006747714,0.00022590677,0.001011265,0.0013024103,0.0004723797,0.0014287775,0.0012987454,0.00004456165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008598845,0.000033996985,0.000038064303,0.000014256364,0.000007339401,0.000034453835,0.00016225752,0.76085365,0.00008045794,0.048134338,0.000021342317,0.19061127],"study_design_scores_gemma":[0.0002370175,0.00024308462,0.00011637761,0.00064675446,0.000010229137,0.00004967753,1.0761074e-7,0.9805851,0.001977727,0.014617048,0.00068369764,0.0008331965],"about_ca_topic_score_codex":0.000013727568,"about_ca_topic_score_gemma":0.000022945995,"teacher_disagreement_score":0.72043574,"about_ca_system_score_codex":0.00027995874,"about_ca_system_score_gemma":0.0003108832,"threshold_uncertainty_score":0.99957037},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024692396,0.00008089134,0.97147197,0.00034320442,0.0027345873,0.0004290642,0.0000027411443,0.00018369734,0.000061460996],"genre_scores_gemma":[0.7347517,0.000002223236,0.264216,0.0008308499,0.00014424676,0.00004554135,0.0000012345818,0.0000066047533,0.0000016262929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750984,0.00011133246,0.00043333325,0.0008780169,0.00045704635,0.00061042357],"domain_scores_gemma":[0.9978726,0.0007982302,0.00014665972,0.0008005008,0.00022314978,0.00015886119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017160272,0.00021359042,0.00032362944,0.000423779,0.00021962413,0.00023975754,0.0011624569,0.00009442105,0.000011610425],"category_scores_gemma":[0.00028219342,0.00018367187,0.00010385776,0.0017189095,0.00025758287,0.0007697395,0.0003274334,0.0001586738,0.000035103523],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014419483,0.00017200015,0.011215224,0.000056778685,0.000011865876,0.000020320022,0.003384068,0.00046683746,0.0011143264,0.0016998908,0.00006287185,0.9817814],"study_design_scores_gemma":[0.0020120917,0.00080229284,0.07200904,0.00062579813,0.000014714179,0.0001918737,0.0000062601866,0.63054186,0.18122314,0.109087415,0.0016504442,0.0018350523],"about_ca_topic_score_codex":0.000042664913,"about_ca_topic_score_gemma":0.00005754561,"teacher_disagreement_score":0.9799463,"about_ca_system_score_codex":0.000087637105,"about_ca_system_score_gemma":0.00030106783,"threshold_uncertainty_score":0.7489922},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005805606,0.0006177341,0.99530584,0.0012370079,0.001375987,0.00039645736,0.000009256692,0.00027830596,0.00019885795],"genre_scores_gemma":[0.035927083,0.000033004868,0.95954126,0.0032925594,0.00051268213,0.000010139702,0.000010330857,0.000046594003,0.0006263467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582237,0.000109486566,0.0005340391,0.0018981278,0.00084227964,0.0007936759],"domain_scores_gemma":[0.99693155,0.0009749961,0.000284153,0.0011838927,0.00024057903,0.00038483087],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079577055,0.0006463125,0.00073890825,0.00067891023,0.00049660046,0.00080193806,0.0024979976,0.00030363144,0.000017003484],"category_scores_gemma":[0.000307878,0.0005624507,0.00007321511,0.00054620404,0.00045239125,0.00029723154,0.002114644,0.0009391722,0.000029926592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004690035,0.000030768384,0.00015863801,0.00003685316,0.000011751304,0.000026164786,0.0010260487,0.019875344,0.0010906574,0.0109863775,0.00007138249,0.9666813],"study_design_scores_gemma":[0.0007638036,0.000258376,0.00013075175,0.0004481445,0.000007843463,0.00003541299,1.9363897e-7,0.9829445,0.0010923321,0.008602592,0.0049419175,0.00077416317],"about_ca_topic_score_codex":0.0001606364,"about_ca_topic_score_gemma":0.00008302126,"teacher_disagreement_score":0.96590716,"about_ca_system_score_codex":0.00013467428,"about_ca_system_score_gemma":0.00021750575,"threshold_uncertainty_score":0.9996827},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002496479,0.00022934035,0.98738253,0.0006440709,0.0027120875,0.00027523327,0.0000013835456,0.00020100495,0.008304699],"genre_scores_gemma":[0.37851974,0.000034269306,0.61752164,0.0016707915,0.0010293069,0.000014690136,0.000002645124,0.000046258196,0.0011606342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959512,0.000051660485,0.000624984,0.0017387486,0.00085917674,0.00077427574],"domain_scores_gemma":[0.9973863,0.00033405906,0.00018999926,0.001745913,0.00016056058,0.00018322073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011579562,0.0004980217,0.0005339073,0.00089455233,0.0001832493,0.0006143691,0.0036501822,0.00033330466,0.000025134228],"category_scores_gemma":[0.00015771054,0.00049486855,0.00010799867,0.00046763624,0.00036409826,0.00067418383,0.0014368515,0.0010926512,0.0001373347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023689558,0.000018908686,0.00013377004,0.000044015134,0.0000048444135,0.0001350405,0.00052991736,0.16673443,0.00016192974,0.1303474,0.000016854638,0.7018705],"study_design_scores_gemma":[0.00020587083,0.000082929946,0.00019256548,0.00057883706,0.0000029022208,0.00006265222,7.243808e-8,0.9423875,0.00019485485,0.0483648,0.007293332,0.0006336594],"about_ca_topic_score_codex":0.00017689538,"about_ca_topic_score_gemma":0.0002751794,"teacher_disagreement_score":0.7756531,"about_ca_system_score_codex":0.00037861636,"about_ca_system_score_gemma":0.000483815,"threshold_uncertainty_score":0.9997503},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072375922,0.000780239,0.98847735,0.000052848707,0.000064586806,0.00019158899,0.0000012230873,0.000018788422,0.003175759],"genre_scores_gemma":[0.96926373,0.0004278213,0.029214177,0.0005997447,0.00020788636,0.0000059796525,0.000058857182,0.000023100942,0.0001987012],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99861777,0.000027316988,0.00022973078,0.0007195205,0.00020726236,0.00019840362],"domain_scores_gemma":[0.99929446,0.000045363213,0.00011465827,0.00041490878,0.00007536937,0.000055224456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003185745,0.00021984697,0.00023834326,0.00029627356,0.000058292728,0.00006464126,0.0003345806,0.00027714897,0.0000105536],"category_scores_gemma":[0.000047696216,0.00019887766,0.000046302917,0.00008333393,0.00031610185,0.000006526769,0.0005063292,0.00025201417,0.0000026822454],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030368841,0.000026949552,0.00055836415,0.000041584437,0.000008791072,0.000019988966,0.0000536352,0.0013081419,0.25893402,0.0000774637,0.00015797374,0.7387827],"study_design_scores_gemma":[0.0010517201,0.00054599,0.0016147055,0.0017805881,0.000036900594,0.000084159525,3.0751323e-7,0.09793103,0.83728486,0.038131073,0.020135267,0.0014033732],"about_ca_topic_score_codex":0.0000120153245,"about_ca_topic_score_gemma":0.00012076869,"teacher_disagreement_score":0.9620261,"about_ca_system_score_codex":0.000024531146,"about_ca_system_score_gemma":0.000046356137,"threshold_uncertainty_score":0.8109996},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014683606,0.0003351125,0.98078257,0.00055956625,0.0022665332,0.0006896344,0.0000013811258,0.0001389577,0.0005426555],"genre_scores_gemma":[0.98594874,0.00000796092,0.005820933,0.007582958,0.00054258306,0.000009752916,0.0000017720072,0.00002037919,0.000064943546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955678,0.00031279333,0.0005755641,0.0016887349,0.0011492094,0.0007059087],"domain_scores_gemma":[0.9955182,0.002279943,0.00026446235,0.001633125,0.00013975192,0.00016451196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031811572,0.00050314475,0.00050069415,0.00046233102,0.0007741917,0.0009921393,0.002680111,0.00021518892,0.0000068586182],"category_scores_gemma":[0.00024782546,0.00039885216,0.00014818303,0.0011796732,0.0002693111,0.00027484924,0.0011575768,0.0015579982,0.000012035912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001237598,0.00015864961,0.00026913674,0.000025441323,0.000017184966,0.019787338,0.006043494,0.590625,0.000011464459,0.005539707,0.000048223683,0.377462],"study_design_scores_gemma":[0.0006677588,0.0005556367,0.00013065644,0.00024859927,0.000014381183,0.004938359,0.000023384897,0.9751778,0.000013374683,0.017203603,0.00034616643,0.00068027864],"about_ca_topic_score_codex":0.00073658477,"about_ca_topic_score_gemma":0.004769843,"teacher_disagreement_score":0.97496164,"about_ca_system_score_codex":0.000540238,"about_ca_system_score_gemma":0.00060117646,"threshold_uncertainty_score":0.99984634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003390257,0.00050619344,0.9931391,0.0005676407,0.0031655962,0.00031487935,0.0000069803286,0.00022043117,0.0017401511],"genre_scores_gemma":[0.06401144,0.00020007812,0.9306382,0.0027746703,0.0010056345,0.000014836437,0.00004287946,0.00008527265,0.0012270028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99527824,0.000068435475,0.00062679796,0.0019510466,0.0013252711,0.0007502062],"domain_scores_gemma":[0.99679786,0.0003459002,0.0003138904,0.0019921768,0.0003471097,0.00020303729],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00061558344,0.00064616726,0.00064283976,0.00084959535,0.0003362029,0.001158185,0.0038534184,0.00037724065,0.00015124475],"category_scores_gemma":[0.00011330082,0.0006251307,0.00024420614,0.001022873,0.0006633589,0.00081194285,0.002820936,0.0010657483,0.00003513518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065008167,0.00008691274,0.0001225364,0.00007972845,0.000040344737,0.00027528795,0.00051713694,0.012522537,0.00023876935,0.37269294,0.000024531895,0.6133928],"study_design_scores_gemma":[0.00031645646,0.000088058245,0.0006759031,0.00046763677,0.000015434109,0.00007321504,8.342224e-8,0.62708944,0.0012607516,0.36567944,0.0034749478,0.0008586183],"about_ca_topic_score_codex":0.000022101716,"about_ca_topic_score_gemma":0.00008384531,"teacher_disagreement_score":0.6145669,"about_ca_system_score_codex":0.00025496248,"about_ca_system_score_gemma":0.00042387663,"threshold_uncertainty_score":0.9998787},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025720196,0.0010871416,0.9919548,0.00034234,0.0016457135,0.00017993513,0.000008697368,0.00020597452,0.0043181814],"genre_scores_gemma":[0.34654933,0.00013996435,0.65094507,0.0013155208,0.00050105155,0.000006483575,0.000009054947,0.000054526852,0.00047901375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586225,0.000059288544,0.00070238387,0.0014149332,0.0013717368,0.00058939203],"domain_scores_gemma":[0.9961251,0.0009404996,0.0004977984,0.0019687356,0.0003264797,0.00014139296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013401968,0.0004922143,0.0006882694,0.00068267644,0.00016633584,0.00043862418,0.0044296463,0.00024915586,0.000032536973],"category_scores_gemma":[0.00027764114,0.00045230286,0.00019462773,0.0006577042,0.0005848591,0.00057238794,0.0022464532,0.0006296308,0.000018759809],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024775431,0.000032720716,0.000055659955,0.000066471184,0.000021133541,0.00016248258,0.0005448935,0.021431416,0.0006748787,0.061825786,0.000013503941,0.9151686],"study_design_scores_gemma":[0.00030102197,0.000120983335,0.00012942927,0.0011840416,0.000010424185,0.00009471551,2.4708478e-7,0.7777017,0.010149561,0.208655,0.0009700007,0.0006828906],"about_ca_topic_score_codex":0.000030161382,"about_ca_topic_score_gemma":0.000027702928,"teacher_disagreement_score":0.9144857,"about_ca_system_score_codex":0.00014233611,"about_ca_system_score_gemma":0.0005994946,"threshold_uncertainty_score":0.9997929},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8425887,0.0001225321,0.15685529,0.00013751461,0.00013423647,0.00013460686,0.000019069232,0.000002592936,0.000005431901],"genre_scores_gemma":[0.99665546,0.000001615823,0.0030875325,0.00021777759,0.000015335529,0.0000084067005,0.0000068624513,0.0000049120235,0.0000020943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9984386,0.00017224094,0.00018752358,0.00042018315,0.00047762133,0.000303808],"domain_scores_gemma":[0.99923575,0.00024550664,0.000030388046,0.00038683478,0.000051622468,0.000049886174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005754227,0.00008788153,0.00018018468,0.0002841409,0.00011685674,0.000025255425,0.0005764878,0.000034103952,0.00007608547],"category_scores_gemma":[0.00036887915,0.00006928329,0.00010088977,0.0025754115,0.0002919498,0.000005217378,0.0009254908,0.00023433781,0.000001306211],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007004571,0.0002963363,0.3672248,0.000030982243,0.00010845595,0.000057060737,0.00033966606,0.42896968,0.13900779,0.000038404018,0.000024385541,0.063832395],"study_design_scores_gemma":[0.0002456018,0.0004471985,0.5960908,0.0000065016716,0.000028803268,0.00010458856,0.0000018773947,0.392538,0.009943453,0.0003456176,0.00009948603,0.00014803285],"about_ca_topic_score_codex":0.000057888694,"about_ca_topic_score_gemma":0.00033524967,"teacher_disagreement_score":0.22886601,"about_ca_system_score_codex":0.00006953723,"about_ca_system_score_gemma":0.00025393895,"threshold_uncertainty_score":0.28252906},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031547206,0.0003754038,0.9903988,0.00052987377,0.0054534585,0.00022078697,0.0000031339093,0.0006462249,0.0023407335],"genre_scores_gemma":[0.016004194,0.00024488408,0.9820275,0.0006918783,0.0006102964,0.000008964723,0.0000050822805,0.00004617112,0.00036104704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592906,0.00003695944,0.0004923002,0.0016657299,0.0012292502,0.0006467177],"domain_scores_gemma":[0.9966406,0.0013083122,0.00019595704,0.0014432054,0.00026558273,0.00014631292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006618782,0.00058153854,0.00050519634,0.0010971248,0.00020992951,0.0002233437,0.0038985575,0.0003173796,0.000009838589],"category_scores_gemma":[0.00083336007,0.0005527855,0.00014577902,0.0005910716,0.0003660826,0.00061354606,0.0014690346,0.0012523285,0.000042949327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004752109,0.000011263443,0.0000022215424,0.0000046470277,0.000008170772,0.00009578606,0.00031125805,0.7374418,0.00001528885,0.007899255,0.0000123185455,0.25419325],"study_design_scores_gemma":[0.0001892385,0.00007082239,0.000009039519,0.00036916786,0.0000024581784,0.000087322405,1.5304877e-7,0.9169749,0.00032012258,0.079991706,0.0013844969,0.00060056],"about_ca_topic_score_codex":0.0000039164165,"about_ca_topic_score_gemma":0.000005022301,"teacher_disagreement_score":0.2535927,"about_ca_system_score_codex":0.0005794117,"about_ca_system_score_gemma":0.00029473234,"threshold_uncertainty_score":0.9996924},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004497834,0.0011115775,0.9772294,0.00008132074,0.014517591,0.00048450642,0.0000017740726,0.00033781707,0.006191002],"genre_scores_gemma":[0.15777697,0.00019321275,0.61883074,0.0015319971,0.02723706,0.00015211316,0.000021402342,0.00035660298,0.19389991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944395,0.00013722801,0.0008312106,0.0019887148,0.0014740553,0.0011293279],"domain_scores_gemma":[0.9964199,0.00053302885,0.00046665702,0.0018137513,0.00052629394,0.0002403513],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002244063,0.00066686224,0.0007299529,0.001087474,0.00042581066,0.0016456364,0.0048643015,0.00038689125,0.000011473408],"category_scores_gemma":[0.00019787949,0.00060052564,0.00017630578,0.0011575778,0.00045145178,0.00071742723,0.0018054765,0.0011102058,0.00037061545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008962659,0.00009501721,0.00029705314,0.0004572751,0.00007263672,0.00044908348,0.0060075256,0.25495222,0.00028104463,0.20657186,0.0010737736,0.52973354],"study_design_scores_gemma":[0.00017770528,0.0004105412,0.000051002356,0.0031670274,0.000010532875,0.00021282502,0.0000013101043,0.71484935,0.0024387985,0.016376475,0.26077035,0.0015340392],"about_ca_topic_score_codex":0.00008524764,"about_ca_topic_score_gemma":0.000014143659,"teacher_disagreement_score":0.5281995,"about_ca_system_score_codex":0.0013929029,"about_ca_system_score_gemma":0.001311533,"threshold_uncertainty_score":0.99964464},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018675497,0.0005551137,0.98793036,0.002298465,0.0014917376,0.00016018873,0.0000036077754,0.00017082263,0.007387862],"genre_scores_gemma":[0.0041959505,0.0001333011,0.98692137,0.006492489,0.00049718784,0.000003969772,0.000035916935,0.00003627426,0.0016835429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99612033,0.000056310986,0.0005316473,0.0015380783,0.0011670908,0.0005865373],"domain_scores_gemma":[0.9966361,0.0005593076,0.00036240075,0.0015728478,0.00066140865,0.0002079648],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011598925,0.00042390102,0.0004502084,0.00052638236,0.00034301248,0.0017672327,0.0030194,0.00024592187,0.00003865708],"category_scores_gemma":[0.0006329166,0.0004166928,0.00010123201,0.0013564661,0.00037310325,0.0015105408,0.002226176,0.0006769798,0.0000678691],"study_design_candidate":"design_other","study_design_consensus":null,"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.970563e-7,0.00004101619,0.000016611511,0.000042329568,0.000015555177,0.00022969143,0.00074808084,0.0088934265,0.000052217416,0.12189919,0.00019888616,0.867862],"study_design_scores_gemma":[0.00018565377,0.00008101078,0.0000036614165,0.00039625732,0.00001723053,0.00014056607,0.000001021593,0.7992148,0.00071311556,0.067691445,0.13092032,0.0006349256],"about_ca_topic_score_codex":0.00006920709,"about_ca_topic_score_gemma":0.00008439494,"teacher_disagreement_score":0.8672271,"about_ca_system_score_codex":0.00025496876,"about_ca_system_score_gemma":0.0010153985,"threshold_uncertainty_score":0.9998285},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013462424,0.00065160164,0.99529475,0.00024116016,0.0009805091,0.00079350604,0.000018801076,0.00014304413,0.00053035875],"genre_scores_gemma":[0.34811747,0.0000430104,0.6504156,0.00086774887,0.0002745529,0.00006218303,0.000027957609,0.00007970191,0.00011177248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99441284,0.000083814964,0.00065187796,0.0023553395,0.0012859268,0.0012102223],"domain_scores_gemma":[0.99587464,0.0012259352,0.00023767985,0.001939217,0.00046449655,0.00025800825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023921083,0.0005641007,0.000656164,0.0015283073,0.00035990478,0.00073211367,0.004364946,0.00031694467,0.000010932221],"category_scores_gemma":[0.00023619451,0.0005565991,0.00016591161,0.0015968246,0.00075453176,0.0006442821,0.00082341064,0.0010194022,0.000009389059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024984383,0.00016662512,0.00047700305,0.00008393346,0.0000118749285,0.00043761896,0.001147427,0.24374388,0.00093939726,0.28474468,0.0000063354246,0.4682162],"study_design_scores_gemma":[0.00034850082,0.0002481952,0.00020049725,0.00038034577,0.000003446293,0.000049546943,0.0000011791286,0.7308101,0.001125095,0.26576117,0.0004142,0.00065770437],"about_ca_topic_score_codex":0.000020547663,"about_ca_topic_score_gemma":0.0002711595,"teacher_disagreement_score":0.48706624,"about_ca_system_score_codex":0.0003406458,"about_ca_system_score_gemma":0.0007497625,"threshold_uncertainty_score":0.99968857},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017303083,0.0022566065,0.9899216,0.0003291211,0.005690776,0.00044453872,0.000009663749,0.00016975962,0.0010048832],"genre_scores_gemma":[0.557955,0.00007241331,0.43407226,0.0032745565,0.0039197826,0.000023397228,0.00005077685,0.00012096694,0.00051080267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943468,0.00013170278,0.00093585585,0.0021718363,0.0013240613,0.0010897601],"domain_scores_gemma":[0.996385,0.000758678,0.0005068415,0.0012436718,0.0007616673,0.00034416176],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012599186,0.00075843866,0.00087246014,0.0007980253,0.00071646675,0.0016780095,0.002431652,0.00061746035,0.000059564514],"category_scores_gemma":[0.00013748922,0.0007445953,0.00027664212,0.0010481102,0.0008396926,0.00091303856,0.0015344962,0.0013464144,0.00003299539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008018418,0.000059066944,0.00020332038,0.00009616466,0.00006755739,0.0006820879,0.0008077797,0.41624925,0.0011572838,0.0059832856,0.000050576764,0.5746356],"study_design_scores_gemma":[0.00037026356,0.00009773662,0.000050423878,0.00074403605,0.000018711899,0.00073473214,4.6132698e-7,0.98506516,0.00048994384,0.010566021,0.00091783056,0.00094466977],"about_ca_topic_score_codex":0.00002784485,"about_ca_topic_score_gemma":0.000098516095,"teacher_disagreement_score":0.57369095,"about_ca_system_score_codex":0.00047702118,"about_ca_system_score_gemma":0.0010122489,"threshold_uncertainty_score":0.9995005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005827944,0.00040193478,0.99455476,0.00054951257,0.0022616186,0.00087066746,0.00011526716,0.00025924935,0.0009286889],"genre_scores_gemma":[0.0042867786,0.000028698892,0.9927081,0.0006124971,0.0011108461,0.00006312417,0.000092802846,0.000061495,0.0010356489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99447864,0.00005984793,0.0008304856,0.0024527288,0.0010699555,0.0011083286],"domain_scores_gemma":[0.9958374,0.00086616626,0.00037076225,0.0019877395,0.0006347725,0.00030315592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013028611,0.00083267124,0.0010717855,0.00097266067,0.00083278463,0.0008457297,0.0029638952,0.00044850507,0.000039885035],"category_scores_gemma":[0.000118199205,0.0008744735,0.0005692395,0.0011657431,0.0008912478,0.00070900394,0.0017328294,0.0010697107,0.000034974604],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039639704,0.00004935263,0.000005543641,0.00006278211,0.000072508876,0.00014178638,0.0004293539,0.015472828,0.0002717507,0.0039020204,0.000030788233,0.97955734],"study_design_scores_gemma":[0.0005235652,0.00019083434,0.000024752542,0.00048490727,0.00003585698,0.00018739651,0.00000143535,0.9381923,0.0010980269,0.056562617,0.0017663559,0.00093192287],"about_ca_topic_score_codex":0.000049343278,"about_ca_topic_score_gemma":0.000028387829,"teacher_disagreement_score":0.9786254,"about_ca_system_score_codex":0.0003493885,"about_ca_system_score_gemma":0.000928243,"threshold_uncertainty_score":0.9993706},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022889789,0.0010073729,0.9930109,0.0014470186,0.0011175635,0.0009909053,0.000012683001,0.00018825439,0.0019964417],"genre_scores_gemma":[0.32526362,0.0000478579,0.6716136,0.0016286563,0.0008045095,0.000034984252,0.0000123351265,0.00006816262,0.0005262918],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99436975,0.000152398,0.000687087,0.002260076,0.0014023017,0.0011283698],"domain_scores_gemma":[0.99242324,0.0036302106,0.00032471216,0.0027378476,0.00069971004,0.00018426075],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0030009672,0.00061301095,0.00071702816,0.00052525685,0.0008501835,0.0017000799,0.0064154714,0.0002964702,0.00002037999],"category_scores_gemma":[0.00034910414,0.0004768138,0.0002963699,0.0010601046,0.0019133603,0.0009016795,0.0027814615,0.0012658215,0.000013476442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014400692,0.000044262728,0.000028641798,0.00007489823,0.000025611826,0.000033906865,0.0011507788,0.050643194,0.00029121368,0.47177532,0.000018672472,0.4758991],"study_design_scores_gemma":[0.00025956865,0.0001684796,0.00012839508,0.00027049956,0.0000069064267,0.000029507835,0.000003075873,0.32635912,0.00096807745,0.6704283,0.00087682874,0.00050122733],"about_ca_topic_score_codex":0.000017404098,"about_ca_topic_score_gemma":0.0002625693,"teacher_disagreement_score":0.47539788,"about_ca_system_score_codex":0.00031389555,"about_ca_system_score_gemma":0.0015861633,"threshold_uncertainty_score":0.9997684},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021339061,0.0008808991,0.9809516,0.00047056837,0.00404984,0.0009312095,0.000009495027,0.0004502706,0.012234788],"genre_scores_gemma":[0.021382118,0.000019795807,0.9666233,0.0018527071,0.0010984755,0.00007366435,0.000068913076,0.00008496368,0.008796033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932192,0.00021081688,0.0009316372,0.0025449044,0.0015724935,0.0015209576],"domain_scores_gemma":[0.9958619,0.00041963725,0.0005356207,0.0024197092,0.0003912754,0.00037185964],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002055101,0.0008650494,0.0009666083,0.00080384716,0.0004766427,0.0025041387,0.007771978,0.0005197079,0.000024944899],"category_scores_gemma":[0.00015400603,0.00081033586,0.00025663216,0.002111962,0.0005450498,0.0009622302,0.0019011066,0.0012234201,0.000181753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008396969,0.00016145266,0.000076189244,0.00025033773,0.00004654201,0.00047470717,0.0023217758,0.19777913,0.00002977711,0.0055803256,0.0073148054,0.78595656],"study_design_scores_gemma":[0.001135602,0.0003766716,0.000100451565,0.0016341016,0.000020560412,0.00042549192,8.1740734e-7,0.84695673,0.00015188196,0.06389077,0.082724705,0.0025822248],"about_ca_topic_score_codex":0.000026183823,"about_ca_topic_score_gemma":0.000028768347,"teacher_disagreement_score":0.7833743,"about_ca_system_score_codex":0.0006833117,"about_ca_system_score_gemma":0.0027804654,"threshold_uncertainty_score":0.99943477},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006511495,0.00008859906,0.97622573,0.00043376797,0.010568391,0.00058605993,0.00000360808,0.0006972583,0.010745424],"genre_scores_gemma":[0.3251795,0.00002433713,0.6576929,0.005471638,0.0040111,0.00012437189,0.000059991893,0.00020467855,0.0072314595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938176,0.00014963132,0.0011678792,0.0027118837,0.0009899278,0.0011630565],"domain_scores_gemma":[0.995095,0.00035310208,0.0009974322,0.0026001933,0.00080005865,0.00015417863],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011855412,0.0009954287,0.0008859247,0.0034814824,0.0005063088,0.00080400443,0.0065448005,0.00082686136,0.0002771321],"category_scores_gemma":[0.00007612473,0.0009669055,0.0002549138,0.001356339,0.001081733,0.0030172,0.0030541695,0.0031903887,0.0010314466],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023770372,0.00033989266,0.00012951264,0.00010573737,0.00009831991,0.00039787145,0.0033307539,0.0026779738,0.001859712,0.03682567,0.006098791,0.948112],"study_design_scores_gemma":[0.0015005966,0.002480655,0.0018532514,0.0025730168,0.000054822198,0.001573877,0.0000020466575,0.47681296,0.03644898,0.44029182,0.03172237,0.0046856035],"about_ca_topic_score_codex":0.00007843164,"about_ca_topic_score_gemma":0.0001381017,"teacher_disagreement_score":0.9434264,"about_ca_system_score_codex":0.001708285,"about_ca_system_score_gemma":0.00078922947,"threshold_uncertainty_score":0.9997464},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009952065,0.00048315394,0.9869004,0.001489229,0.002929429,0.00039516177,0.0000043939776,0.00028089696,0.0074178437],"genre_scores_gemma":[0.035550665,0.000088021785,0.95892787,0.00290528,0.0008636139,0.00001442299,0.000043680124,0.00006193945,0.0015444955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948716,0.00013595162,0.0007232801,0.0019359061,0.0015487494,0.00078448997],"domain_scores_gemma":[0.996912,0.00054664863,0.0003733273,0.0014245851,0.00044290497,0.0003005035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010642331,0.0006421858,0.0006325401,0.0009558907,0.00044388414,0.0009665682,0.002706272,0.00043712682,0.00014443982],"category_scores_gemma":[0.000108289714,0.00064404693,0.0002260572,0.0011338585,0.000519784,0.00096751546,0.0010592102,0.0010750078,0.00013155816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027407725,0.00006302385,0.00003204012,0.00005016728,0.000034911034,0.00026087987,0.004953657,0.04733115,0.0008223115,0.11166455,0.000041543968,0.83471835],"study_design_scores_gemma":[0.0010325921,0.00014805587,0.00013199268,0.0003722363,0.000011751583,0.000073922776,0.0000039102183,0.86698884,0.00031900313,0.10523794,0.024708403,0.00097135844],"about_ca_topic_score_codex":0.000025320343,"about_ca_topic_score_gemma":0.00007743253,"teacher_disagreement_score":0.83374697,"about_ca_system_score_codex":0.00040955897,"about_ca_system_score_gemma":0.001241136,"threshold_uncertainty_score":0.99960107},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00126894,0.0018499313,0.99478287,0.00006395561,0.00037054534,0.00017006072,0.0000029119105,0.00041979545,0.0010709699],"genre_scores_gemma":[0.34003302,0.00031791165,0.6587284,0.00013414254,0.000499896,0.000007624111,0.000014308065,0.00009999921,0.00016465133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838465,0.000012777422,0.0002482231,0.0006332715,0.00036857266,0.00035253033],"domain_scores_gemma":[0.9993855,0.000094708135,0.000053449086,0.00026773562,0.00011327469,0.00008535673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017130765,0.0003222034,0.00029656402,0.00039877844,0.00021041498,0.00012998332,0.0002954399,0.00021219996,0.000036472913],"category_scores_gemma":[0.0000434137,0.00034381967,0.00004840836,0.00027180393,0.00033269255,0.00039010282,0.00020586907,0.00084592775,0.0000013896608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037934476,0.000008035282,0.0001397376,0.00013883898,0.000011704085,0.00009470967,0.00055216823,0.75238925,0.012779215,0.0004856898,0.0000054125526,0.23339146],"study_design_scores_gemma":[0.000089383146,0.000048327962,0.00006223478,0.0005207206,0.0000114480645,0.00019566619,0.0000014540948,0.9742783,0.01236082,0.011562965,0.00040274602,0.0004659876],"about_ca_topic_score_codex":0.0000064964497,"about_ca_topic_score_gemma":0.000011588527,"teacher_disagreement_score":0.3387641,"about_ca_system_score_codex":0.00028136943,"about_ca_system_score_gemma":0.00010306924,"threshold_uncertainty_score":0.99990135},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001944058,0.0004860985,0.9822695,0.000033446948,0.001689287,0.00025568853,0.0000069059824,0.00039581844,0.014668842],"genre_scores_gemma":[0.5508597,0.000070290655,0.4456982,0.00026900577,0.0013278538,0.000024236278,0.00004681489,0.00033477708,0.0013691133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977777,0.0000069453176,0.00043404353,0.00070174877,0.0005677299,0.0005118246],"domain_scores_gemma":[0.99875146,0.00019219356,0.000081077545,0.0007744893,0.00008829224,0.0001124637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003415438,0.00049269386,0.0004896725,0.00036076817,0.00009150018,0.00015512122,0.00072437694,0.00021993685,0.000061865074],"category_scores_gemma":[0.000024759136,0.00046957677,0.00006970132,0.0003308849,0.00016983713,0.00016793805,0.00021409513,0.00071090367,0.00003280899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015500281,0.000003101687,0.000050969655,0.00012047346,0.000029792003,0.000078283476,0.00019554763,0.92244667,0.00017659624,0.0010155218,0.0000060930447,0.07587542],"study_design_scores_gemma":[0.000546447,0.00008985593,0.00020250052,0.003368481,0.000028612094,0.00026823083,7.0205834e-7,0.97240895,0.0056646103,0.0025449917,0.0132243745,0.0016522403],"about_ca_topic_score_codex":0.0000061909614,"about_ca_topic_score_gemma":0.000021295877,"teacher_disagreement_score":0.5506653,"about_ca_system_score_codex":0.0006332304,"about_ca_system_score_gemma":0.0001674282,"threshold_uncertainty_score":0.9997756},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037603065,0.0006509557,0.99634963,0.0003224104,0.0008111513,0.00028155392,6.313294e-7,0.00031315378,0.0012667321],"genre_scores_gemma":[0.0022330286,0.00020448545,0.99621034,0.00049199513,0.00015011785,0.000013901508,0.000012729,0.00002424237,0.00065917923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971601,0.000068050234,0.00039233817,0.0012881208,0.00065806403,0.00043336285],"domain_scores_gemma":[0.99828994,0.00040934977,0.00022235331,0.00062236056,0.00031973564,0.0001362825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006175936,0.00034747095,0.00036585957,0.00078702,0.0002246373,0.0007452327,0.0013558116,0.00023894847,0.00001648688],"category_scores_gemma":[0.00034282706,0.0003517594,0.00005564257,0.0012387375,0.00039647485,0.0004447502,0.0014995395,0.00065813644,0.0000036395686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.4262164e-7,0.00001406135,0.000030487023,0.00002352985,0.0000040998925,0.0000249434,0.0005928549,0.721302,0.000008397805,0.003956309,0.000023803184,0.2740188],"study_design_scores_gemma":[0.000081558836,0.00012196862,0.0000061783394,0.00028996432,0.0000042813776,0.00006700512,2.8868723e-7,0.9791868,0.0006993093,0.01876607,0.00041489908,0.00036168375],"about_ca_topic_score_codex":0.000004045985,"about_ca_topic_score_gemma":0.0000044078074,"teacher_disagreement_score":0.27365708,"about_ca_system_score_codex":0.0003524229,"about_ca_system_score_gemma":0.00075321354,"threshold_uncertainty_score":0.9998934},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025836342,0.00053266407,0.9943882,0.00014343296,0.0016275861,0.0003805069,0.000003960395,0.0016541411,0.0012436215],"genre_scores_gemma":[0.01368553,0.00015195692,0.98509777,0.00031184388,0.00034719583,0.000018405575,0.000004737872,0.00007020165,0.0003123705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575436,0.000017160792,0.00057068904,0.0016765317,0.0011487207,0.0008325248],"domain_scores_gemma":[0.9969658,0.00019498273,0.0001939319,0.0021642027,0.0002507512,0.0002303326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005013684,0.00070727436,0.0006225725,0.0012654613,0.00019046087,0.00021981553,0.00373464,0.00042230642,0.000009528036],"category_scores_gemma":[0.000030804964,0.0007228641,0.00017146385,0.000845285,0.00039928284,0.00064450654,0.0016630231,0.0011463718,0.000038686594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002918117,0.000024096165,0.000035035882,0.000053740194,0.00001725748,0.000386654,0.0008515672,0.16072771,0.00016870582,0.060964298,0.00016210803,0.7766059],"study_design_scores_gemma":[0.00020484473,0.00016775882,0.00009870833,0.0005859656,0.0000055951145,0.00032626704,1.10418386e-8,0.9297637,0.0027159208,0.010519252,0.05438722,0.0012247688],"about_ca_topic_score_codex":0.000016956674,"about_ca_topic_score_gemma":0.000009079418,"teacher_disagreement_score":0.77538115,"about_ca_system_score_codex":0.0005093942,"about_ca_system_score_gemma":0.00040122736,"threshold_uncertainty_score":0.99952227},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017527022,0.00008006678,0.9959822,0.0012734458,0.00049387757,0.0007435487,0.000006214567,0.000322575,0.0009227804],"genre_scores_gemma":[0.03197448,0.000014866863,0.9662402,0.0010703021,0.00026520187,0.00007346195,0.0001865827,0.000030151943,0.00014470532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967544,0.00012980161,0.0006191434,0.0012546116,0.0007591056,0.00048291677],"domain_scores_gemma":[0.99631774,0.0010085145,0.00041392123,0.0014110071,0.00067044864,0.0001783768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012565863,0.0004029464,0.00042845498,0.00084669807,0.00047265665,0.00096916035,0.0021503828,0.00031337023,0.000017527245],"category_scores_gemma":[0.00049863366,0.00041782888,0.00017162203,0.0008840032,0.0001649055,0.0018122318,0.0006960434,0.0008685595,0.000025239291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043007426,0.000014367227,0.00007946042,0.000027495225,0.000007602035,0.0000020113976,0.0009174494,0.29263994,0.0002651239,0.015536849,0.0000035174878,0.69050187],"study_design_scores_gemma":[0.00033750053,0.00014200155,0.0008691851,0.00010999961,0.000011393384,0.000024066429,8.282012e-7,0.96714413,0.0007889176,0.02766297,0.0024639072,0.00044507894],"about_ca_topic_score_codex":0.0001641099,"about_ca_topic_score_gemma":0.00005004626,"teacher_disagreement_score":0.6900568,"about_ca_system_score_codex":0.00022058803,"about_ca_system_score_gemma":0.00038729972,"threshold_uncertainty_score":0.9998273},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048710333,0.0002086887,0.97759396,0.013591421,0.0012574709,0.00058723846,0.000038261584,0.00088501774,0.0053508193],"genre_scores_gemma":[0.59697336,0.00026179547,0.3626483,0.034851737,0.0014278499,0.00022892622,0.000090436006,0.00014336983,0.0033742392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958245,0.00015441113,0.0004750216,0.001108004,0.0013560739,0.0010819504],"domain_scores_gemma":[0.993369,0.0020532624,0.0001867417,0.0040709013,0.00017598315,0.00014411697],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011769383,0.00065373624,0.00055849145,0.00091331126,0.0006521597,0.001142228,0.015111904,0.00039898013,0.00002762908],"category_scores_gemma":[0.00017207213,0.00046346392,0.00013416864,0.002800148,0.0014515285,0.0003487148,0.0035387943,0.0019262551,0.00023064537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013200406,0.00008955773,0.000053474196,0.000023283059,0.000025141147,0.000115958734,0.0017920425,0.15767547,0.000023377701,0.02400756,0.031478524,0.7847024],"study_design_scores_gemma":[0.00028125994,0.0005514986,0.00025981752,0.0010203038,0.000009692334,0.00009004595,0.0000021135347,0.65142727,0.0008968234,0.23360072,0.11039303,0.0014674531],"about_ca_topic_score_codex":0.000031334002,"about_ca_topic_score_gemma":0.00016617615,"teacher_disagreement_score":0.78323495,"about_ca_system_score_codex":0.000654913,"about_ca_system_score_gemma":0.0010628946,"threshold_uncertainty_score":0.9998947},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021233647,0.0025744834,0.9861777,0.00007568649,0.0032932067,0.00058774,0.00000979911,0.0004207768,0.006648267],"genre_scores_gemma":[0.9639077,0.000055060198,0.02674003,0.00010710241,0.006093254,0.00017247198,0.000045872413,0.00020403713,0.0026744609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977571,0.000020660991,0.0006861752,0.00054807035,0.00047174905,0.0005162434],"domain_scores_gemma":[0.99861056,0.00015946834,0.00010811087,0.0009442443,0.00009684192,0.000080751575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049060653,0.0003561446,0.00045609663,0.00046329168,0.00016289066,0.0002645218,0.0010385539,0.00030065374,0.000014948434],"category_scores_gemma":[0.000027354772,0.00036620203,0.000081078855,0.00064298086,0.00031121096,0.00017835134,0.00017999596,0.0006236447,0.0003261397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.8813474e-7,0.0000101237465,0.0000025943737,0.0000652118,0.000009098467,0.0000055909422,0.00028280684,0.7820905,0.0025927094,0.00088589755,0.0002665622,0.21378812],"study_design_scores_gemma":[0.000043372358,0.00002126942,0.000040879444,0.00033438092,0.000009984382,0.000031489708,4.3160628e-7,0.96486264,0.004200165,0.003925656,0.025936063,0.0005936767],"about_ca_topic_score_codex":0.00004021022,"about_ca_topic_score_gemma":0.000084783365,"teacher_disagreement_score":0.96369535,"about_ca_system_score_codex":0.00072410534,"about_ca_system_score_gemma":0.00030385828,"threshold_uncertainty_score":0.999879},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002540852,0.00024354034,0.99505526,0.0024032965,0.00060268026,0.0004366304,0.0000036360805,0.000027108801,0.0009737614],"genre_scores_gemma":[0.28627354,0.00000926219,0.7123365,0.00094650296,0.00028488762,0.000024370911,0.000005969599,0.0000049052555,0.00011405601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973092,0.00017188367,0.00071190763,0.0009359627,0.00043809597,0.00043296278],"domain_scores_gemma":[0.9971893,0.001409723,0.0004099629,0.0005951789,0.00033236606,0.00006347557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026911495,0.00030941982,0.00062262686,0.00026211923,0.000104137,0.00011179813,0.002321647,0.00038321025,0.000028149045],"category_scores_gemma":[0.0007960121,0.0002273708,0.00017667598,0.0006228854,0.00051136216,0.00016865185,0.0005771644,0.00062700984,5.382898e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009358465,0.00030517532,0.0005470048,0.00044127926,0.000056189805,0.000077419674,0.0035517272,0.59974617,0.022893157,0.12052219,0.0001275884,0.2516385],"study_design_scores_gemma":[0.00050175877,0.00057475606,0.00024885777,0.000211484,0.000012437196,0.00006713266,0.0000017768413,0.658414,0.036015946,0.2996966,0.0038085,0.00044673125],"about_ca_topic_score_codex":0.000030591633,"about_ca_topic_score_gemma":0.00002439527,"teacher_disagreement_score":0.28601947,"about_ca_system_score_codex":0.00006722865,"about_ca_system_score_gemma":0.0008431248,"threshold_uncertainty_score":0.92719114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011214626,0.00038713936,0.992565,0.0004356257,0.0006155835,0.00039345166,0.0000041901676,0.00017860485,0.0042989384],"genre_scores_gemma":[0.6436147,0.000033879165,0.34037355,0.007206814,0.007367171,0.00006076931,0.00017481782,0.00021095763,0.0009573237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964262,0.0000037340287,0.0006714008,0.0014349277,0.00074319914,0.00072051375],"domain_scores_gemma":[0.99729234,0.00013416905,0.0005737605,0.00058649195,0.0013818518,0.000031359228],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008932359,0.000667595,0.0007385089,0.0014703462,0.00052376156,0.0011408635,0.0014939032,0.00036659616,0.00003318728],"category_scores_gemma":[0.00020366492,0.00058516517,0.00016571299,0.0013483363,0.00042950403,0.0012112323,0.0005438543,0.00055505603,0.00002241642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023590648,0.000048264348,0.00026229434,0.0008835489,0.000031511026,0.000007010452,0.000110867615,0.7251327,0.000094906216,0.0015609,0.000035994603,0.27180842],"study_design_scores_gemma":[0.00031423112,0.000009219258,0.000031498148,0.000484681,0.000092702765,0.0000057166085,0.000002081653,0.9834759,0.00007269641,0.013201856,0.001539528,0.00076986325],"about_ca_topic_score_codex":0.00011819468,"about_ca_topic_score_gemma":0.000116809984,"teacher_disagreement_score":0.65219146,"about_ca_system_score_codex":0.00009787209,"about_ca_system_score_gemma":0.00016850031,"threshold_uncertainty_score":0.99989605},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007767281,0.002490257,0.9940889,0.00002594087,0.00089230994,0.0002494586,0.0000027976828,0.00014790686,0.0020946462],"genre_scores_gemma":[0.47443914,0.0010362623,0.51625174,0.00051694346,0.00553198,0.000111921014,0.000056134,0.00025131475,0.0018045838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900305,0.000006155978,0.0002168398,0.00027021123,0.00020643645,0.00029727782],"domain_scores_gemma":[0.9993971,0.00009687561,0.00003745258,0.00033758,0.000036918966,0.00009409356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000191776,0.00019851117,0.00021578057,0.00021523074,0.00006349613,0.00012718278,0.00036906154,0.00016162697,0.0000034531063],"category_scores_gemma":[0.0000052658397,0.0001827261,0.000025447385,0.00025367303,0.00016522928,0.00007058485,0.00012595324,0.00030269264,0.000029099576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.467898e-8,0.000004083978,0.00002170546,0.00008557507,0.000004343483,0.0000013280052,0.00011549716,0.8207121,0.000033899927,0.000562597,0.00005794344,0.17840086],"study_design_scores_gemma":[0.000034246288,0.0000110305,0.000044688495,0.00016479622,0.000007832846,0.000024339199,1.1013386e-7,0.98397124,0.00028873127,0.0062619955,0.008902284,0.00028869897],"about_ca_topic_score_codex":0.0000017467859,"about_ca_topic_score_gemma":0.000006109555,"teacher_disagreement_score":0.47783718,"about_ca_system_score_codex":0.00016222929,"about_ca_system_score_gemma":0.00007267904,"threshold_uncertainty_score":0.7451354},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006824104,0.00008295704,0.98952085,0.00067667064,0.0039623724,0.00023866627,0.00001956013,0.000092865805,0.0053378404],"genre_scores_gemma":[0.0050976044,0.00001900396,0.9893514,0.0014656897,0.0006693201,0.000008578616,0.0000051165616,0.00002597462,0.003357322],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973014,0.000055050703,0.00033519248,0.00093441113,0.0009021393,0.00047181235],"domain_scores_gemma":[0.9955991,0.0031860222,0.00020965698,0.00067453546,0.00020351788,0.000127204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015550117,0.00027748576,0.00039795667,0.0004995033,0.00022266209,0.00049113826,0.0017669644,0.0001244184,0.000022208138],"category_scores_gemma":[0.0073639634,0.00023246321,0.000058146372,0.0011410022,0.002356997,0.0002921032,0.00069123245,0.0005548875,0.00003572517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024746558,0.00015947863,0.00017419439,0.0006678539,0.000017520131,0.00011001559,0.008380442,0.0016828334,0.0016173832,0.32752842,0.023215173,0.6364219],"study_design_scores_gemma":[0.00009214739,0.00005881155,0.000105953244,0.00018155739,0.000011055201,0.000018021057,0.0000012221858,0.008939761,0.0030571658,0.9845714,0.0026175457,0.0003453521],"about_ca_topic_score_codex":0.0000036275296,"about_ca_topic_score_gemma":0.00000972941,"teacher_disagreement_score":0.657043,"about_ca_system_score_codex":0.00046354035,"about_ca_system_score_gemma":0.004287273,"threshold_uncertainty_score":0.94795746},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002963995,0.00013839317,0.9748798,0.00012041726,0.0005270394,0.0032786482,0.000014176773,0.00010781517,0.020637298],"genre_scores_gemma":[0.7228566,0.00009807136,0.2728902,0.0008424146,0.0007557501,0.00081333664,0.00001302728,0.000078923345,0.0016516818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965215,0.000021566402,0.00073095446,0.0011420281,0.0010290201,0.0005549658],"domain_scores_gemma":[0.9974944,0.00011755748,0.00038525322,0.0016401113,0.00023225223,0.00013041221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006479767,0.00043653973,0.0006493757,0.00046982663,0.00013597777,0.0002340019,0.0038221052,0.0002758694,0.000040355364],"category_scores_gemma":[0.000019019122,0.00038528972,0.00013011778,0.00062300696,0.00055171334,0.00060693297,0.00055264164,0.0005265202,0.000061651386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012204239,0.00003972067,0.00015764347,0.00016652324,0.000007945865,0.000030941108,0.0002777272,0.021501483,0.000113411625,0.011107982,0.000030735133,0.9665537],"study_design_scores_gemma":[0.0006284097,0.0007020532,0.00058372004,0.0034620191,0.0000062456284,0.00012497975,5.8122332e-8,0.9331673,0.0038352357,0.034040038,0.022277951,0.001172012],"about_ca_topic_score_codex":0.0000132159075,"about_ca_topic_score_gemma":0.000008816583,"teacher_disagreement_score":0.9653817,"about_ca_system_score_codex":0.00013360445,"about_ca_system_score_gemma":0.00053932104,"threshold_uncertainty_score":0.9998599},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030098224,0.00024304303,0.99168915,0.004208361,0.0014848544,0.0005219388,0.0000026694572,0.000075709155,0.0014732934],"genre_scores_gemma":[0.4560297,0.00004656597,0.54055357,0.0019002564,0.0009774199,0.000027390764,0.000004261416,0.000038522678,0.00042231605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627763,0.00005773353,0.00075264834,0.0013214409,0.0010496274,0.00054093276],"domain_scores_gemma":[0.99645877,0.0006174823,0.00032193167,0.0017631807,0.00067397987,0.0001646743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013352489,0.00038129784,0.00042799357,0.00024381647,0.0003767894,0.0006031896,0.0035263728,0.000221009,0.000007926735],"category_scores_gemma":[0.0005126479,0.00029408495,0.00012140069,0.0007595043,0.0008770134,0.00032526095,0.0015198599,0.0005766213,0.00002164643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004061704,0.000030398056,0.00006225172,0.000035207737,0.0000100138,0.000021102116,0.0017304831,0.04997642,0.0020384328,0.15493366,0.00006670469,0.79109126],"study_design_scores_gemma":[0.00004209678,0.0001903391,0.000065023516,0.00027903492,0.000008231046,0.00004801944,0.0000019491263,0.80366385,0.072964415,0.118998416,0.003131836,0.00060675957],"about_ca_topic_score_codex":0.00002651229,"about_ca_topic_score_gemma":0.00061330805,"teacher_disagreement_score":0.7904845,"about_ca_system_score_codex":0.00030753182,"about_ca_system_score_gemma":0.0008175487,"threshold_uncertainty_score":0.9999511},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005496351,0.00035310662,0.9962715,0.0006264046,0.00016754898,0.00020223396,0.00004158584,0.000026630612,0.0017613854],"genre_scores_gemma":[0.9094595,0.00019994547,0.089595206,0.00031095336,0.00008910486,0.000014330402,0.00017277968,0.00002121774,0.00013698716],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977452,0.000009057898,0.0004237205,0.00096643274,0.000591615,0.00026396548],"domain_scores_gemma":[0.9970128,0.00045525862,0.00027716425,0.0020769746,0.00012114182,0.000056673965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059876766,0.0002049602,0.00028774983,0.00046973734,0.00015723791,0.0005556192,0.0035281982,0.00007592089,0.0000016125916],"category_scores_gemma":[0.00006663354,0.00015874098,0.00005861567,0.0014485874,0.0006362277,0.0013783611,0.0035206291,0.0002913483,0.0000014466566],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018462589,0.000008627388,0.00036208372,0.0000050938656,0.000015906851,0.0000021645262,0.00012656752,0.001498282,0.0000054817106,0.08185178,0.000006041327,0.9161161],"study_design_scores_gemma":[0.00012031547,0.00006895276,0.003887685,0.000033396293,0.000028787115,0.000019756155,4.8446555e-7,0.3744664,0.00016051324,0.6173736,0.0035065694,0.00033357108],"about_ca_topic_score_codex":0.000037943642,"about_ca_topic_score_gemma":0.00025389885,"teacher_disagreement_score":0.9157826,"about_ca_system_score_codex":0.00009448642,"about_ca_system_score_gemma":0.00020049604,"threshold_uncertainty_score":0.65563285},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001437876,0.0008594112,0.9648299,0.00015413965,0.004789425,0.0004989407,0.000013748271,0.0003351547,0.028504891],"genre_scores_gemma":[0.0048588007,0.000018071953,0.98892736,0.0012425063,0.00092065404,0.000031367512,0.000017697532,0.000043324646,0.0039401907],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99436915,0.0003010056,0.00079105515,0.0018898875,0.0016761695,0.00097271614],"domain_scores_gemma":[0.99556756,0.00090819155,0.0005256852,0.002286167,0.00053706503,0.00017531912],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00408242,0.00064051565,0.00063403836,0.0009334304,0.00029806537,0.00068581715,0.006363729,0.0004851885,0.000020943999],"category_scores_gemma":[0.0005326585,0.0005991572,0.00016413146,0.001691913,0.001380093,0.0011275109,0.0014142942,0.0011769958,0.00013587312],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040140153,0.000048846712,0.00003966643,0.00005966432,0.0000071530567,0.00004129234,0.00039712552,0.0078010703,0.00006897585,0.18629518,0.0025330137,0.802704],"study_design_scores_gemma":[0.0003715774,0.00019226693,0.00030115878,0.00035559002,0.0000120978375,0.00009354627,1.056068e-7,0.40831065,0.00294402,0.5566133,0.029648272,0.0011573682],"about_ca_topic_score_codex":0.000022259277,"about_ca_topic_score_gemma":0.000018923833,"teacher_disagreement_score":0.80154663,"about_ca_system_score_codex":0.0009645439,"about_ca_system_score_gemma":0.0022654445,"threshold_uncertainty_score":0.999646},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005983163,0.00083012995,0.9925289,0.0006916767,0.0009087156,0.0005674573,0.0000073924048,0.00011577748,0.0037516484],"genre_scores_gemma":[0.25531015,0.000008909886,0.7415598,0.0006001325,0.0010016568,0.000037292084,0.000019983201,0.000052653028,0.0014093948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99415773,0.00011243746,0.0008858834,0.0020687866,0.0018832621,0.0008919165],"domain_scores_gemma":[0.9933529,0.0032674642,0.00051791966,0.0016269904,0.0010266555,0.0002080924],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008434647,0.00047065094,0.0006585843,0.0007731252,0.0014411822,0.0020714367,0.0034726188,0.0003556135,0.000051787345],"category_scores_gemma":[0.0026686704,0.00031670407,0.00031343315,0.001251592,0.00083421747,0.00047812163,0.0003385468,0.001431109,0.00002490019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005918723,0.000028789847,0.000113662136,0.000009747479,0.000012092632,0.0000036973677,0.00094508997,0.78095996,0.00032291675,0.010473122,0.000009385824,0.20711562],"study_design_scores_gemma":[0.0001836657,0.00010450905,0.000044804823,0.00014411501,0.000026137908,0.000047658177,0.00001907214,0.89858216,0.00031201835,0.09864862,0.0014618736,0.00042534282],"about_ca_topic_score_codex":0.00002380238,"about_ca_topic_score_gemma":0.000034967474,"teacher_disagreement_score":0.25471184,"about_ca_system_score_codex":0.00015462817,"about_ca_system_score_gemma":0.0009891621,"threshold_uncertainty_score":0.9999285},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020107161,0.0003018708,0.9940301,0.0009909954,0.00053999864,0.00039667403,0.0000016356278,0.00006492558,0.0034727152],"genre_scores_gemma":[0.18345669,0.00007093338,0.8121303,0.003771468,0.0003567691,0.000015584697,0.000004074989,0.000025993888,0.00016823421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690145,0.000039295348,0.00045908743,0.0011725288,0.00092352676,0.00050408224],"domain_scores_gemma":[0.99796534,0.0006364293,0.00019564302,0.0009973148,0.00014058636,0.00006468484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020438926,0.00033874623,0.00031646996,0.0008735524,0.00025345394,0.000694627,0.0025876507,0.00019700006,0.000003451636],"category_scores_gemma":[0.00009032995,0.000260348,0.00007335032,0.00094276085,0.0007242247,0.00065267144,0.001060212,0.0009551067,0.0000053653926],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050489266,0.000034900873,0.00020540191,0.000038015056,0.0000052763107,0.00011017726,0.005144103,0.042174295,0.000039051683,0.19407932,0.000015892734,0.7581485],"study_design_scores_gemma":[0.00009981799,0.00003002468,0.00015528487,0.00014389252,0.0000020052605,0.00006555848,7.188697e-7,0.64778405,0.00006614268,0.35129344,0.00014273172,0.00021631653],"about_ca_topic_score_codex":0.00006136745,"about_ca_topic_score_gemma":0.00028443345,"teacher_disagreement_score":0.7579322,"about_ca_system_score_codex":0.00010958901,"about_ca_system_score_gemma":0.00019899668,"threshold_uncertainty_score":0.99998486},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003856888,0.0001715899,0.98988116,0.0007121821,0.006041956,0.0005014931,0.000011891366,0.00031955392,0.0019744798],"genre_scores_gemma":[0.18717828,0.000012901383,0.80821913,0.0011864883,0.002369848,0.000061989886,0.000045830177,0.00006618191,0.00085933285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961102,0.00007267469,0.00061953807,0.001788788,0.0007927548,0.00061603135],"domain_scores_gemma":[0.99623924,0.00045490894,0.00037776097,0.0019134548,0.0007933824,0.00022126596],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009550162,0.0004933081,0.0004891777,0.0006918803,0.0006696234,0.0018136702,0.0036876309,0.00035461035,0.000020096657],"category_scores_gemma":[0.00009314517,0.00049385923,0.00014368175,0.00075442326,0.0001876965,0.0022107665,0.0012650224,0.0007398729,0.000020783998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008549964,0.00009905921,0.00005284244,0.00035774807,0.00004060559,0.00012263133,0.0019095094,0.15295471,0.004907003,0.17107898,0.00011458019,0.6683538],"study_design_scores_gemma":[0.0001717337,0.00013663447,0.000032155964,0.0004747415,0.000014124432,0.00011341001,0.0000017987912,0.975337,0.009992313,0.010474756,0.0026564684,0.00059484225],"about_ca_topic_score_codex":0.000049815277,"about_ca_topic_score_gemma":0.00045012968,"teacher_disagreement_score":0.82238233,"about_ca_system_score_codex":0.00071234384,"about_ca_system_score_gemma":0.000876885,"threshold_uncertainty_score":0.9997513},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018049998,0.00017008926,0.99487364,0.000009256214,0.0010108728,0.00015885792,0.000008350709,0.0001283164,0.0018356068],"genre_scores_gemma":[0.8459101,0.000109755994,0.14969681,0.000256609,0.0031127173,0.000028045824,0.00007827548,0.000108996515,0.0006987215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887455,0.000014576236,0.00023499207,0.00038881466,0.00027211508,0.00021492783],"domain_scores_gemma":[0.9994973,0.00009194688,0.000051343504,0.00023174073,0.000066826324,0.000060852733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035285632,0.00019520416,0.0003086569,0.00096251006,0.00007326862,0.00019488919,0.00015629217,0.00026343277,0.000016943932],"category_scores_gemma":[0.00003173003,0.00018200946,0.00007654663,0.0011637291,0.00013025965,0.0001570602,0.000055121116,0.00039649662,0.000016560914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034549255,0.000005064244,0.000022820428,0.0000823847,0.00005957814,0.00002469386,0.0003878201,0.13200966,0.000595685,0.0000028667175,0.00004298202,0.866763],"study_design_scores_gemma":[0.0007044462,0.00018952381,0.00066170347,0.00076272956,0.00024289159,0.000083178675,4.867846e-7,0.95574886,0.009595984,0.029075023,0.0017637849,0.0011713692],"about_ca_topic_score_codex":0.00004102442,"about_ca_topic_score_gemma":0.00008780216,"teacher_disagreement_score":0.86559165,"about_ca_system_score_codex":0.00050243665,"about_ca_system_score_gemma":0.00018560166,"threshold_uncertainty_score":0.7422131},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029427933,0.0000677551,0.9986102,0.00014135291,0.00047571317,0.00035670746,0.000008438217,0.00007281272,0.00023757789],"genre_scores_gemma":[0.47114077,0.00002072699,0.52576846,0.0025177537,0.00015259892,0.000025169275,0.000101757614,0.00006366164,0.0002090918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974523,0.00007971897,0.0005862066,0.0008647241,0.0007057938,0.00031124646],"domain_scores_gemma":[0.99789804,0.00067231955,0.00029093595,0.00066645973,0.00037183333,0.00010041343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009824197,0.00033266773,0.0004989385,0.0015152781,0.00006199565,0.00027528682,0.0012334309,0.00016909225,0.00001736333],"category_scores_gemma":[0.00035825613,0.000359432,0.000058128495,0.0012856984,0.0001277424,0.00041068532,0.00043655434,0.00028014876,0.0000067208925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009059732,0.00004198328,0.000014946497,0.00007922286,0.000007750542,0.000011988265,0.0025036337,0.788147,0.0006127396,0.18014956,0.000017941848,0.028404184],"study_design_scores_gemma":[0.0002803545,0.00008626761,0.000032348657,0.00068623904,0.0000046762366,0.0000021862513,0.0000032834025,0.98483545,0.010273677,0.0028898737,0.0005025226,0.00040310796],"about_ca_topic_score_codex":0.000012327428,"about_ca_topic_score_gemma":0.000045478664,"teacher_disagreement_score":0.47284174,"about_ca_system_score_codex":0.0003240511,"about_ca_system_score_gemma":0.00059560634,"threshold_uncertainty_score":0.99988574},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037002985,0.00021623634,0.99394673,0.0003539588,0.0015765975,0.0005640752,0.000006060117,0.000055499706,0.0029108166],"genre_scores_gemma":[0.77981144,0.00006274894,0.21598014,0.0018202027,0.0005843069,0.00011278839,0.00001607674,0.00010411368,0.0015081605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684536,0.00011411126,0.0005766939,0.0010081632,0.0010404108,0.00041526376],"domain_scores_gemma":[0.9978154,0.00026227525,0.0004373325,0.0012397802,0.00017869807,0.00006655443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001163038,0.00036142746,0.00046411535,0.0008722876,0.00023857052,0.00019902177,0.0027111366,0.00015845406,0.000056197638],"category_scores_gemma":[0.000023567864,0.00024863164,0.00015156082,0.0016687899,0.00047699528,0.0004663482,0.00091685547,0.0007743606,0.000006107615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028463635,0.0001318608,0.0003743581,0.000113487855,0.000035011817,0.000082498824,0.0045977007,0.4002974,0.00019213003,0.09814158,0.00010605001,0.49589944],"study_design_scores_gemma":[0.0003663146,0.0002669014,0.0001758809,0.0005302582,0.000005939557,0.00014250092,9.661065e-7,0.9529213,0.0004012285,0.043691445,0.0010421342,0.00045515498],"about_ca_topic_score_codex":0.00010595732,"about_ca_topic_score_gemma":0.00013609532,"teacher_disagreement_score":0.7794414,"about_ca_system_score_codex":0.00020484472,"about_ca_system_score_gemma":0.00030518565,"threshold_uncertainty_score":0.9999966},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019051982,0.00026107035,0.99626184,0.0005565747,0.00064512726,0.0015654607,0.000023967776,0.00019443088,0.00030102767],"genre_scores_gemma":[0.044958863,0.00009497493,0.953548,0.0005372561,0.00017340994,0.00040209497,0.00005812027,0.000051822743,0.00017541712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964295,0.0000797431,0.0004564823,0.0015464568,0.0008299725,0.00065781595],"domain_scores_gemma":[0.99737483,0.0010065308,0.00028893168,0.000928164,0.00025206618,0.00014948864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013800624,0.0003977067,0.00048296785,0.0007235243,0.0004589881,0.00042974163,0.0016877127,0.00017672135,0.000026005613],"category_scores_gemma":[0.00021326513,0.00038630486,0.000094629584,0.000673016,0.0006265198,0.0008621464,0.0010631698,0.0005987791,0.000003865256],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043935648,0.000044892087,0.000018724735,0.00016261001,0.000020776843,0.000018363593,0.0008245933,0.02484482,0.0020093129,0.19220558,0.000008164641,0.7797982],"study_design_scores_gemma":[0.00046259628,0.0002761661,0.000019387115,0.000075705546,0.000003622553,0.000027236878,1.6333013e-7,0.53143495,0.0007821019,0.46558502,0.0010114544,0.0003215772],"about_ca_topic_score_codex":0.0000053548138,"about_ca_topic_score_gemma":0.000009692721,"teacher_disagreement_score":0.77947664,"about_ca_system_score_codex":0.00023565094,"about_ca_system_score_gemma":0.00023234637,"threshold_uncertainty_score":0.99985886},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017944056,0.00018000558,0.9921138,0.0010905245,0.001920971,0.0002553922,0.0000010764185,0.00005781174,0.0043624346],"genre_scores_gemma":[0.015300506,0.00009148702,0.98323846,0.0005651602,0.00022738769,0.0000072388602,0.000001006879,0.000018990952,0.00054974697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720347,0.000058261718,0.0005761116,0.00077034946,0.0009755829,0.0004162309],"domain_scores_gemma":[0.9966733,0.0004989942,0.00048084173,0.002038167,0.00023286424,0.00007582612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024671326,0.0002986221,0.00034152417,0.00025522243,0.0002560422,0.00021941825,0.0040787784,0.00017757752,0.000009203049],"category_scores_gemma":[0.00022642918,0.00021441259,0.00009434285,0.00041203294,0.0008751132,0.00018392662,0.0014041034,0.0004669943,0.00003744136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022423158,0.0000065417908,0.000012171928,0.000022916816,0.0000046355854,0.0000021925855,0.00020035371,0.003707877,0.00011648343,0.27979076,0.000047781417,0.71608603],"study_design_scores_gemma":[0.00014782824,0.00022370876,0.00020287161,0.0002519022,0.000007646837,0.00002553257,9.223757e-8,0.78554684,0.007584599,0.17382368,0.03174387,0.00044139827],"about_ca_topic_score_codex":0.000007656848,"about_ca_topic_score_gemma":0.000019586747,"teacher_disagreement_score":0.781839,"about_ca_system_score_codex":0.00014041952,"about_ca_system_score_gemma":0.00019757141,"threshold_uncertainty_score":0.8743492},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009993747,0.010251837,0.5131559,0.01652015,0.0041085808,0.00094974,0.000042555253,0.00012813095,0.45384377],"genre_scores_gemma":[0.8697932,0.0051579163,0.114242196,0.004118827,0.0030717212,0.000027723161,0.000035178608,0.00005058584,0.0035026881],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980147,0.00019509571,0.00024487753,0.0005206626,0.00071723765,0.00030742146],"domain_scores_gemma":[0.9966228,0.0023336974,0.00019237262,0.0002819605,0.00048723622,0.000081948245],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016178924,0.00016031748,0.00031027873,0.00019312272,0.00060326623,0.00019240538,0.00046549714,0.00018642844,0.000036893893],"category_scores_gemma":[0.0026686648,0.00016598312,0.000057012014,0.0007236564,0.0028490813,0.00038905937,0.00045011018,0.0004115103,0.000002873013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002245095,0.00024117617,0.0003677816,0.00022984174,0.00009077297,0.000099276076,0.40207103,0.0004749269,0.000023937158,0.12802018,0.0012251457,0.4671335],"study_design_scores_gemma":[0.00043818267,0.00015355067,0.0003382985,0.0009695799,0.0001129557,0.00004752207,0.00063282286,0.0014947919,0.00012342635,0.5788466,0.41581064,0.0010316318],"about_ca_topic_score_codex":0.0007098192,"about_ca_topic_score_gemma":0.008510699,"teacher_disagreement_score":0.8687938,"about_ca_system_score_codex":0.00021808106,"about_ca_system_score_gemma":0.0019036059,"threshold_uncertainty_score":0.9998646},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025503274,0.00025461006,0.9923607,0.0012480732,0.0025140094,0.00070864795,0.000013639537,0.00027222923,0.0026026003],"genre_scores_gemma":[0.013299212,0.000016297634,0.9828586,0.0029772632,0.0004058146,0.00003726264,0.000019559797,0.000056358756,0.00032964765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947408,0.00019050951,0.00074072595,0.002141354,0.0013404705,0.0008461324],"domain_scores_gemma":[0.99660504,0.00049814436,0.00046725714,0.001976364,0.00016802404,0.00028518404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018206489,0.00073179684,0.0007671854,0.0010646409,0.0005708883,0.00062029815,0.0038337018,0.00035739207,0.00019541719],"category_scores_gemma":[0.00014598884,0.00069762766,0.00025837636,0.0007937858,0.00044071747,0.0007119018,0.0014685331,0.0011361368,0.000022373695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014722097,0.000041248863,0.0000082586785,0.000031121876,0.000008808116,0.00011958266,0.00034385987,0.08685603,0.00012061379,0.055137426,0.000053945925,0.8572644],"study_design_scores_gemma":[0.00061129883,0.00012908642,0.000030640556,0.00009508521,0.000013216663,0.00004197366,2.3660977e-8,0.8800528,0.0007392856,0.114140876,0.0034235613,0.0007221435],"about_ca_topic_score_codex":0.000050748586,"about_ca_topic_score_gemma":0.000035969828,"teacher_disagreement_score":0.8565422,"about_ca_system_score_codex":0.0005265579,"about_ca_system_score_gemma":0.0010601042,"threshold_uncertainty_score":0.9995475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008557044,0.00030763118,0.9951684,0.0007233198,0.0011619673,0.00047714481,0.000017591326,0.0001541746,0.0011341022],"genre_scores_gemma":[0.6731956,0.000035419424,0.32349148,0.0012027423,0.00094845955,0.000045894372,0.000096586366,0.00008937221,0.0008944253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564934,0.000082920145,0.00055086106,0.0020101657,0.0009518667,0.0007548252],"domain_scores_gemma":[0.9964072,0.0013341177,0.0003470335,0.0016734828,0.00011113506,0.00012701147],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016048503,0.00049051153,0.00059902755,0.0011748635,0.0007488988,0.00057477324,0.0061464724,0.00019463294,0.000039425202],"category_scores_gemma":[0.0003968452,0.00047583753,0.000109215,0.00058500865,0.00031531372,0.0008702716,0.0054651676,0.0019355089,0.000007645676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011774572,0.000025024681,0.000136563,0.000022298475,0.000008319986,0.00005275587,0.0026776125,0.1079302,0.000042503314,0.00995314,0.00002005503,0.87911975],"study_design_scores_gemma":[0.0006824093,0.00025700277,0.00046176475,0.0003635286,0.000006365615,0.000052641964,0.000003555988,0.9345199,0.00013140179,0.0455092,0.01729329,0.0007189646],"about_ca_topic_score_codex":0.0005676799,"about_ca_topic_score_gemma":0.0007859472,"teacher_disagreement_score":0.8784008,"about_ca_system_score_codex":0.00039226798,"about_ca_system_score_gemma":0.00038729963,"threshold_uncertainty_score":0.99976933},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013570624,0.0026063756,0.99439126,0.0003878708,0.0002784246,0.00041622767,0.000038293594,0.00059832534,0.001147543],"genre_scores_gemma":[0.10324138,0.0004174533,0.8938415,0.0007205858,0.00027813416,0.000026237643,0.0010104041,0.00008940977,0.00037490917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993933,0.00013367295,0.0006021127,0.002930091,0.0016353581,0.00076575374],"domain_scores_gemma":[0.9948298,0.0010571302,0.00052203715,0.0031977016,0.00017458556,0.00021878406],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011810054,0.0008416976,0.00096266816,0.0007454019,0.0007066298,0.001196134,0.0072379922,0.00024381219,0.00018928034],"category_scores_gemma":[0.000310142,0.00069675304,0.000096718264,0.0006321313,0.0005566388,0.00201352,0.012003917,0.0025238777,0.000003768597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002136922,0.000053881096,0.00039370288,0.00005231382,0.00037793067,0.00033224715,0.002268879,0.24061586,0.000116103074,0.0023161378,0.00010850428,0.75334305],"study_design_scores_gemma":[0.00031543177,0.00057360186,0.0001301557,0.0002961312,0.00019059704,0.0001456129,0.000003662706,0.9880997,0.00022828569,0.0046170643,0.0044469535,0.0009527962],"about_ca_topic_score_codex":0.0005889677,"about_ca_topic_score_gemma":0.00042000765,"teacher_disagreement_score":0.75239027,"about_ca_system_score_codex":0.00027255647,"about_ca_system_score_gemma":0.0004070257,"threshold_uncertainty_score":0.99984074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101469835,0.0001990804,0.99727094,0.00011864246,0.0004083288,0.0006842928,0.0000026562118,0.000095246454,0.0011193681],"genre_scores_gemma":[0.21029538,0.00010498998,0.7880674,0.0009423742,0.00026897353,0.000097148775,0.000024774225,0.000031558975,0.00016738586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754393,0.000044741613,0.00044364258,0.0010179625,0.0005899374,0.00035977922],"domain_scores_gemma":[0.9980258,0.00015306693,0.00038410252,0.0012448281,0.00010926612,0.000082943545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008231426,0.00026278006,0.00029710727,0.00054797594,0.00009317268,0.00013988045,0.0020818096,0.0001096294,0.000008076071],"category_scores_gemma":[0.000009700854,0.00025521373,0.0000440143,0.00074890454,0.000332832,0.00041011345,0.0014470842,0.00021023734,0.000009442942],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015071083,0.000017476792,0.00014424314,0.000065718574,0.000006271302,0.0000045833226,0.0003488082,0.003795904,0.00004486271,0.011484605,0.00014071898,0.9839453],"study_design_scores_gemma":[0.00040637475,0.0002275302,0.0014664227,0.00013667405,0.000015038673,0.000012258316,3.855327e-7,0.8998798,0.0024764063,0.09105968,0.0038580822,0.00046132517],"about_ca_topic_score_codex":0.00008569604,"about_ca_topic_score_gemma":0.00012110912,"teacher_disagreement_score":0.98348397,"about_ca_system_score_codex":0.00026431482,"about_ca_system_score_gemma":0.0004197038,"threshold_uncertainty_score":0.99999},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032419272,0.0005091929,0.9945632,0.001061594,0.001425918,0.001049269,0.000029035424,0.00029379482,0.0007437543],"genre_scores_gemma":[0.038546853,0.000083141545,0.9588167,0.0010955373,0.0005801052,0.00036014584,0.000028566506,0.00004835989,0.00044058976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961607,0.000032062588,0.00054330076,0.0018449798,0.0007284025,0.0006905414],"domain_scores_gemma":[0.99730825,0.00056514714,0.00044472888,0.0013460175,0.00022281743,0.00011305312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009025018,0.00047474937,0.00049679825,0.00058209716,0.0006620087,0.0002224253,0.0041283225,0.00028471212,0.000030468522],"category_scores_gemma":[0.00006866749,0.000468286,0.00018248988,0.00059063616,0.00044119032,0.00031712517,0.0025799468,0.00080141856,0.000006098933],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032478877,0.000086466585,0.00001578164,0.00003732591,0.00003263886,0.000019016617,0.0013278696,0.018112851,0.000034312372,0.08592276,0.00011653617,0.89429116],"study_design_scores_gemma":[0.00037858344,0.0002224215,0.000054771965,0.00010650937,0.000014428766,0.000050277173,9.315664e-7,0.8586054,0.00061309646,0.12456403,0.014768261,0.00062131055],"about_ca_topic_score_codex":0.00001684971,"about_ca_topic_score_gemma":0.000035572357,"teacher_disagreement_score":0.8936699,"about_ca_system_score_codex":0.00045865856,"about_ca_system_score_gemma":0.0002828529,"threshold_uncertainty_score":0.9997769},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036322823,0.0003109642,0.9933547,0.0009984444,0.0022150648,0.00046025641,0.000001915451,0.0001291975,0.0021662232],"genre_scores_gemma":[0.027997565,0.000022410615,0.9680297,0.0031329265,0.0005344008,0.000016629809,0.000003374086,0.000021483442,0.00024153238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929405,0.00023376556,0.0007572417,0.0030374886,0.0017190729,0.0013119635],"domain_scores_gemma":[0.99572587,0.0017881041,0.0003470346,0.0013102773,0.0004730262,0.00035571464],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007661421,0.00060457713,0.0007086113,0.0028924267,0.00061616953,0.0011714024,0.0045059226,0.00029710797,0.000010758794],"category_scores_gemma":[0.0005382366,0.0005639338,0.00010315877,0.004720515,0.0038194754,0.0022050303,0.0039020863,0.001174812,0.000034893226],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022581476,0.000028190514,0.00036606204,0.000033332195,0.0000030975548,0.000033017466,0.0011061877,0.0070690652,0.0004097941,0.013013346,0.00003959894,0.97789603],"study_design_scores_gemma":[0.00034448135,0.00014421885,0.0051523573,0.00047210764,0.0000041604662,0.000111464535,2.567166e-7,0.8175723,0.00061403913,0.17347737,0.0013920115,0.00071522105],"about_ca_topic_score_codex":0.000024402718,"about_ca_topic_score_gemma":0.00007405179,"teacher_disagreement_score":0.97718084,"about_ca_system_score_codex":0.00067309814,"about_ca_system_score_gemma":0.0030785012,"threshold_uncertainty_score":0.9998655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044469514,0.0004796077,0.98226,0.0018581746,0.0021082333,0.0002588266,0.0000010193241,0.00031250482,0.012677169],"genre_scores_gemma":[0.1939823,0.0001111146,0.8017446,0.001957648,0.00069381465,0.000015864387,0.0000066843286,0.000038608185,0.0014493613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961323,0.000049065024,0.0005253982,0.0016691042,0.000939801,0.0006843454],"domain_scores_gemma":[0.99682134,0.00046625405,0.00036270724,0.0019651507,0.00022269852,0.00016185973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010264106,0.00050342036,0.0005581099,0.00060294906,0.00026965205,0.0005331725,0.004193111,0.00039681906,0.000019973415],"category_scores_gemma":[0.0002300623,0.00043311875,0.00014443806,0.00044878566,0.0006710474,0.00040125067,0.0010319684,0.00065723056,0.00014825477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000440735,0.000016926428,0.00017999916,0.000027408565,0.000010301448,0.000036447283,0.0004279494,0.004562938,0.00009001633,0.37074432,0.00018110413,0.6237182],"study_design_scores_gemma":[0.00027229777,0.00015074802,0.0016967264,0.00030289462,0.000010621237,0.000072717245,2.7825317e-7,0.7781736,0.00033878328,0.2071043,0.011052372,0.00082464947],"about_ca_topic_score_codex":0.000025778605,"about_ca_topic_score_gemma":0.000072552284,"teacher_disagreement_score":0.77361065,"about_ca_system_score_codex":0.00019761515,"about_ca_system_score_gemma":0.00038487918,"threshold_uncertainty_score":0.99981207},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014282967,0.00013357488,0.9837185,0.00011942704,0.004906229,0.0004929536,0.000004362678,0.0005333336,0.0086632995],"genre_scores_gemma":[0.6141231,0.0000070279184,0.3840825,0.00081982824,0.0005645205,0.000018904471,0.000005240197,0.00009059015,0.000288304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941355,0.000054912784,0.0008055517,0.0022325502,0.0015610977,0.0012103834],"domain_scores_gemma":[0.99657536,0.0005988075,0.0005640018,0.0015847399,0.0003389109,0.00033818386],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013672856,0.0008572772,0.0007589422,0.0017783913,0.0004133022,0.0011677399,0.0036521954,0.0005212863,0.000025621941],"category_scores_gemma":[0.00037691873,0.00084339123,0.00026502408,0.0012834172,0.0008090944,0.001380224,0.0018093497,0.0013611794,0.00009709353],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001081068,0.000028247503,0.00003455662,0.000043498436,0.000011943123,0.0001545667,0.000531819,0.0046761557,0.00013645619,0.0025323664,0.0000047768917,0.9918348],"study_design_scores_gemma":[0.0007493966,0.0008950572,0.00014638876,0.0015535837,0.000026790201,0.0002391319,8.4973476e-7,0.9237584,0.019623123,0.049611058,0.0014906554,0.0019055828],"about_ca_topic_score_codex":0.00008621469,"about_ca_topic_score_gemma":0.00017210991,"teacher_disagreement_score":0.9899292,"about_ca_system_score_codex":0.00081425183,"about_ca_system_score_gemma":0.0011841573,"threshold_uncertainty_score":0.99986917},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000066793045,0.0003017063,0.9744268,0.0009276242,0.0018189609,0.00044368036,0.0000030435554,0.00020622948,0.021865273],"genre_scores_gemma":[0.016511459,0.00019391903,0.97244203,0.0045902827,0.00028989327,0.000010113341,0.000011166538,0.00006299155,0.005888142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633974,0.000034747198,0.00040917078,0.0014319447,0.0011069529,0.0006774425],"domain_scores_gemma":[0.99741167,0.0002858199,0.00019413997,0.0016375389,0.0002752635,0.0001955421],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076736056,0.00042480687,0.00043126143,0.0010053767,0.00018729079,0.00070148683,0.0038601519,0.0002882886,0.00006354423],"category_scores_gemma":[0.000054157874,0.00038316502,0.00013019372,0.00075869146,0.00047473767,0.0006770635,0.0014409492,0.00078836066,0.00030945346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025401641,0.000025563178,0.000051398023,0.00004022543,0.000009860077,0.00006135382,0.0005797636,0.0805116,0.000051202172,0.18603712,0.00011747655,0.7325119],"study_design_scores_gemma":[0.00034316347,0.00021870389,0.000046397956,0.0002661818,0.0000039258694,0.00006142836,6.744174e-8,0.7477298,0.00026424773,0.2387975,0.011460217,0.000808419],"about_ca_topic_score_codex":0.000011959667,"about_ca_topic_score_gemma":0.000028382,"teacher_disagreement_score":0.73170346,"about_ca_system_score_codex":0.0001789281,"about_ca_system_score_gemma":0.0007536914,"threshold_uncertainty_score":0.999862},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027492406,0.0008621172,0.984128,0.0076312325,0.00036194164,0.00044925272,0.000016425718,0.00022309399,0.0063004307],"genre_scores_gemma":[0.022800462,0.00027668718,0.9667912,0.0018056085,0.0045109126,0.00004772244,0.000043185526,0.00006193933,0.0036622875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712604,0.000015718244,0.0003312467,0.0013775552,0.00069983955,0.0004495886],"domain_scores_gemma":[0.9984053,0.00018796783,0.00022723092,0.0008389038,0.00018582314,0.00015478052],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018697821,0.00042552865,0.00033402396,0.000372092,0.000383241,0.0002669867,0.0017374622,0.00021127542,0.000011197512],"category_scores_gemma":[0.0000025953796,0.00038611842,0.00008329993,0.00043548516,0.00039288736,0.00052715983,0.0018529684,0.0004334461,0.000019895326],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056572394,0.00004260784,0.00002609035,0.0000393301,0.000010888027,0.00006211716,0.00034037323,0.043750603,0.00008799629,0.14052586,0.00222244,0.812886],"study_design_scores_gemma":[0.00024066184,0.00012444849,0.0003669135,0.0001244701,0.000008568945,0.00010253728,1.7210745e-7,0.4225661,0.00060657755,0.33461684,0.24041745,0.0008252531],"about_ca_topic_score_codex":0.0000070607243,"about_ca_topic_score_gemma":0.0000054431725,"teacher_disagreement_score":0.8120608,"about_ca_system_score_codex":0.00027172582,"about_ca_system_score_gemma":0.0001386696,"threshold_uncertainty_score":0.9998591},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016004115,0.00054684706,0.9693844,0.00038862074,0.020714205,0.00026013146,5.077943e-7,0.000110545494,0.0084347455],"genre_scores_gemma":[0.0297929,0.000049981776,0.95060307,0.0047048773,0.006830807,0.00002603459,0.000030454177,0.00011529771,0.0078465855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952987,0.000111869944,0.00074104476,0.0016011713,0.0014112255,0.0008359984],"domain_scores_gemma":[0.99681723,0.0007293135,0.00052019116,0.0015674955,0.00021976976,0.000146013],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016674096,0.00050612865,0.0007140406,0.0011172147,0.00023769602,0.0004062676,0.0071082087,0.00023986005,0.000057260935],"category_scores_gemma":[0.00014823058,0.00049279805,0.00021215012,0.0018426607,0.00056119735,0.00073268736,0.005956291,0.0013700277,0.0000331397],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062869176,0.000076866694,0.00016704701,0.00011044494,0.000021415548,0.00014225747,0.006752889,0.0058241677,0.00012380998,0.0023578284,0.0047898684,0.97962713],"study_design_scores_gemma":[0.0003447021,0.00039906145,0.00013161429,0.00056873047,0.000011859217,0.000121428144,4.0220752e-7,0.8899343,0.0025117064,0.07048637,0.0344614,0.0010284517],"about_ca_topic_score_codex":0.000076415556,"about_ca_topic_score_gemma":0.0000037527013,"teacher_disagreement_score":0.97859865,"about_ca_system_score_codex":0.0006122383,"about_ca_system_score_gemma":0.001629108,"threshold_uncertainty_score":0.99975234},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051327366,0.00053400005,0.9800682,0.00056456454,0.0030816426,0.0003010023,0.0000034227091,0.0003121868,0.015083666],"genre_scores_gemma":[0.24115337,0.00012010885,0.74862975,0.0037350343,0.0014496925,0.000023799907,0.000012633144,0.00011257719,0.004763005],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952585,0.0000438826,0.0007247519,0.0020170303,0.0011087254,0.0008470915],"domain_scores_gemma":[0.9963942,0.00048771038,0.00041702253,0.0021803938,0.0002653482,0.0002552914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013319874,0.0006450898,0.00063837005,0.001146141,0.00042650383,0.0007171132,0.004108087,0.0003404518,0.00005121806],"category_scores_gemma":[0.00013652416,0.00059287314,0.00026672945,0.0009894328,0.001016154,0.0008453984,0.0012379154,0.0010359555,0.00009150546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037155123,0.000067042856,0.0001432382,0.000042397438,0.000030233115,0.0043669464,0.0010480307,0.0076012276,0.00013821342,0.206789,0.00007121247,0.7796987],"study_design_scores_gemma":[0.00032198246,0.00018517251,0.00012133233,0.0005198359,0.000012189704,0.0019004905,1.5536534e-7,0.18257365,0.0009650795,0.8079891,0.004198219,0.0012127704],"about_ca_topic_score_codex":0.000010623536,"about_ca_topic_score_gemma":0.000010699768,"teacher_disagreement_score":0.77848595,"about_ca_system_score_codex":0.00014174187,"about_ca_system_score_gemma":0.00023666254,"threshold_uncertainty_score":0.99965227},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014202583,0.000583789,0.9883428,0.00057437416,0.008625266,0.00033273085,0.00006128771,0.00015153934,0.0013140166],"genre_scores_gemma":[0.00687247,0.00015789871,0.98884654,0.0022842905,0.0009385923,0.000012196603,0.000121393634,0.00004838802,0.00071820157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99560803,0.000038830458,0.00038057897,0.0023786104,0.0010895416,0.00050440384],"domain_scores_gemma":[0.9960021,0.00040951,0.0001883678,0.0030572277,0.00010154918,0.0002412769],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.000798676,0.0004435003,0.00040925213,0.0006944746,0.00053265033,0.0007498723,0.0061322097,0.00013960105,0.00008190354],"category_scores_gemma":[0.00013036374,0.00039985095,0.000040790626,0.00057514606,0.00028313737,0.0012665486,0.0135206245,0.00091857364,0.000013410048],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036764811,0.000009679119,0.000014643792,0.000009025259,0.0000053502495,0.00005076916,0.00024732904,0.00672262,0.00002718748,0.005365634,0.0010736198,0.98647046],"study_design_scores_gemma":[0.00016188933,0.0001980936,0.0003271223,0.0001286773,0.000006663995,0.00020336297,2.4218107e-7,0.8951168,0.00011831292,0.04904944,0.054070998,0.0006183759],"about_ca_topic_score_codex":0.00015315111,"about_ca_topic_score_gemma":0.00007604728,"teacher_disagreement_score":0.98585206,"about_ca_system_score_codex":0.00018824934,"about_ca_system_score_gemma":0.00036588477,"threshold_uncertainty_score":0.9998453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000048396855,0.00006842475,0.9769999,0.00013885455,0.0007680804,0.0050489362,0.000002642629,0.00024705025,0.016721293],"genre_scores_gemma":[0.005027597,0.000010444976,0.9927413,0.0008304999,0.00019027242,0.0007405195,0.0000019146578,0.000037840367,0.00041964263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594,0.000052893305,0.00066242,0.0015667502,0.001072129,0.0007057543],"domain_scores_gemma":[0.9964731,0.00013084346,0.00046019646,0.0024827363,0.00027070192,0.00018242492],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018386976,0.0005579087,0.0005183867,0.00069070817,0.00027512954,0.00046184123,0.0054868483,0.00036803566,0.000018701223],"category_scores_gemma":[0.00009802729,0.0005163118,0.00013546349,0.00047546695,0.0006261178,0.00096214016,0.0018910568,0.00091113,0.00007091061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062655818,0.000040878924,0.000016503363,0.000058803973,0.000006985025,0.000017137429,0.0011226069,0.029242724,0.00013322289,0.2758086,0.00001472779,0.6935316],"study_design_scores_gemma":[0.00013086347,0.000108802786,0.000028030528,0.00033636956,0.0000031532782,0.000022556716,2.7399418e-8,0.6845908,0.0033105914,0.31003904,0.0009835262,0.0004462427],"about_ca_topic_score_codex":0.000010453641,"about_ca_topic_score_gemma":0.000011687549,"teacher_disagreement_score":0.6930853,"about_ca_system_score_codex":0.00047664903,"about_ca_system_score_gemma":0.0006050007,"threshold_uncertainty_score":0.99989396},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003325177,0.00042414176,0.98207676,0.0007736233,0.0015110178,0.0007116558,0.00008032555,0.00010070028,0.013989238],"genre_scores_gemma":[0.41518125,0.000027289185,0.52194315,0.0066185463,0.0036724133,0.0001690555,0.0002611999,0.00012540664,0.052001663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98820007,0.00007545913,0.001015882,0.0033601092,0.0065190583,0.0008294475],"domain_scores_gemma":[0.9928666,0.0026960624,0.0005001981,0.0018301224,0.0018279166,0.00027914066],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0124295745,0.00042482562,0.0005020705,0.002952013,0.0012457693,0.0033135372,0.005596613,0.0001522744,0.00003744092],"category_scores_gemma":[0.0021696198,0.00035209316,0.00007919784,0.0067176567,0.0032016353,0.0008827083,0.0033340387,0.000518579,0.00027624748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030866754,0.000066433,0.00015733004,0.00002122499,0.0000037537452,0.000014643762,0.00016629903,0.26162142,0.000030770207,0.00808081,0.01703106,0.7128032],"study_design_scores_gemma":[0.00016736507,0.000035543813,0.0011116816,0.00007310812,0.0000073080337,0.000027353062,6.494993e-7,0.68775016,0.00004275019,0.21945935,0.09090963,0.00041511565],"about_ca_topic_score_codex":0.000027576063,"about_ca_topic_score_gemma":0.000055928824,"teacher_disagreement_score":0.71238804,"about_ca_system_score_codex":0.0005649388,"about_ca_system_score_gemma":0.0026472388,"threshold_uncertainty_score":0.9998931},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006565275,0.0020525584,0.98628306,0.0025239813,0.0015923227,0.00015728544,0.000011092337,0.000059856986,0.00075454806],"genre_scores_gemma":[0.95309424,0.0007260035,0.04405844,0.0013764966,0.0005572191,0.000016114649,0.0000078606345,0.0000151978265,0.00014843483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974736,0.00006223527,0.00039724106,0.00093011156,0.00064038904,0.00049642514],"domain_scores_gemma":[0.99740154,0.0012195368,0.00023654857,0.0009801302,0.0000719565,0.00009027639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096363784,0.00028300725,0.0004999169,0.00070327264,0.0003590006,0.00016556536,0.0030742914,0.00008967469,0.00009140224],"category_scores_gemma":[0.00012078697,0.00018478755,0.000115420684,0.0019819895,0.00079760194,0.00046592727,0.0036564528,0.0006718221,0.0000033443805],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058945725,0.000017794437,0.0010861171,0.00001756019,0.000029617484,0.00008332681,0.00031261,0.09365594,0.000003823049,0.10300647,0.000022876568,0.801758],"study_design_scores_gemma":[0.0005826035,0.0010818185,0.012428654,0.0001304196,0.000089078116,0.00047805955,0.000003097947,0.5203363,0.00017537604,0.43219343,0.030938827,0.0015623572],"about_ca_topic_score_codex":0.000077883735,"about_ca_topic_score_gemma":0.000060722676,"teacher_disagreement_score":0.946529,"about_ca_system_score_codex":0.000047720372,"about_ca_system_score_gemma":0.00007372404,"threshold_uncertainty_score":0.75354177},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000672949,0.00025174246,0.99112284,0.00006564675,0.0048975497,0.00058483984,0.000032120723,0.0005781836,0.0017941069],"genre_scores_gemma":[0.51863337,0.000018974602,0.47993758,0.00004490782,0.0010103475,9.3017195e-7,0.0000751569,0.00010715158,0.00017160024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974105,0.000028751183,0.0005862327,0.0010086619,0.00045312656,0.00051275035],"domain_scores_gemma":[0.99775255,0.0006089084,0.0002654074,0.00097296236,0.00028533998,0.00011482573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045674318,0.0005064271,0.00048573397,0.0005626757,0.00020796525,0.0002459474,0.00040620228,0.0005390987,0.0000054092957],"category_scores_gemma":[0.00016725794,0.0005314132,0.00013737236,0.00020355362,0.00030489377,0.00038401084,0.0000930423,0.0006769921,0.00003266864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042177046,0.0000067551114,0.000007920564,0.00019005197,0.000032891014,0.000048882313,0.00040747112,0.07263652,0.049479704,0.00012838528,0.00024380544,0.87677544],"study_design_scores_gemma":[0.00024996852,0.000027816532,0.00027058568,0.0009390855,0.00003446209,0.00004408281,6.607886e-7,0.97319084,0.017703846,0.005819614,0.0011853668,0.000533645],"about_ca_topic_score_codex":0.00018967685,"about_ca_topic_score_gemma":0.0001400076,"teacher_disagreement_score":0.90055436,"about_ca_system_score_codex":0.0011737263,"about_ca_system_score_gemma":0.00011775792,"threshold_uncertainty_score":0.9997137},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022907823,0.0010735015,0.9775866,0.00018352667,0.014874134,0.0003447185,3.2944536e-7,0.0003459994,0.005362089],"genre_scores_gemma":[0.07627432,0.00009814463,0.9130244,0.0023197418,0.007366911,0.0000064749106,0.0000054420575,0.000088374836,0.0008161647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99485093,0.00008941893,0.0007551481,0.0021928991,0.0008571217,0.0012544587],"domain_scores_gemma":[0.99676764,0.00078853394,0.0003913376,0.0014806045,0.00026655558,0.00030533524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001585487,0.00071801373,0.00073049136,0.0010522688,0.00052676065,0.00093491835,0.0047743535,0.0004134829,0.0000033764454],"category_scores_gemma":[0.0001509599,0.0006852025,0.0001232383,0.0013909867,0.0010100126,0.0006999799,0.0046072453,0.0012960908,0.00006251374],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026156351,0.000030032226,0.00011936554,0.00007372933,0.000008771891,0.00011445322,0.0030966708,0.002167082,0.00002008178,0.0020773245,0.00024342632,0.9920465],"study_design_scores_gemma":[0.00017009022,0.0002796644,0.00035537765,0.00087397156,0.000011319429,0.00036546457,3.869683e-7,0.8055762,0.0016173347,0.18521504,0.0041973745,0.0013377621],"about_ca_topic_score_codex":0.00004522038,"about_ca_topic_score_gemma":0.000012251481,"teacher_disagreement_score":0.9907087,"about_ca_system_score_codex":0.00036463165,"about_ca_system_score_gemma":0.0011132889,"threshold_uncertainty_score":0.99955994},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009734861,0.00008101423,0.9967941,0.000081508486,0.0005829132,0.00092025317,0.000009079411,0.0005782477,0.0009431712],"genre_scores_gemma":[0.030540753,0.000017167993,0.96835196,0.00033340612,0.00031892935,0.00010935969,0.0000357084,0.00004485476,0.00024786283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969785,0.000016837012,0.0004694472,0.001450876,0.0005914217,0.00049291825],"domain_scores_gemma":[0.99780697,0.00007582273,0.00024467355,0.0013023671,0.00044502795,0.00012515337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005656082,0.0004917862,0.00043708365,0.0006492633,0.00018701146,0.00034274926,0.0023831814,0.00041051404,0.000003502679],"category_scores_gemma":[0.000016399212,0.000485506,0.00013853254,0.00025154173,0.00024068197,0.0007197449,0.00050504704,0.00045712473,0.0000051981274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021764965,0.000017304701,0.0000018742243,0.000029209892,0.0000061340525,0.000002422676,0.00041396002,0.48589158,0.00047470172,0.26111445,0.000050359802,0.25199583],"study_design_scores_gemma":[0.00012970033,0.00010639768,0.0000020273928,0.00006672004,0.000006849709,0.000013454169,7.274843e-9,0.9204467,0.0031125834,0.0748717,0.00074871414,0.0004951336],"about_ca_topic_score_codex":0.000011967907,"about_ca_topic_score_gemma":0.000013745326,"teacher_disagreement_score":0.43455514,"about_ca_system_score_codex":0.0002851329,"about_ca_system_score_gemma":0.00038643528,"threshold_uncertainty_score":0.9997597},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032900552,0.00029575307,0.99517953,0.00032253173,0.0012120683,0.000923266,0.000010795544,0.0007425233,0.0012806025],"genre_scores_gemma":[0.29551905,0.000010269403,0.70226014,0.0010918281,0.0006647061,0.000027409662,0.000015194885,0.000084190484,0.00032717388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946827,0.00004586663,0.00080259715,0.0021861305,0.0010946484,0.001188033],"domain_scores_gemma":[0.99560446,0.0011192245,0.0004920166,0.002183624,0.00039618363,0.00020451048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002250559,0.00072009204,0.000781044,0.00094677135,0.000493716,0.00080288807,0.004970514,0.00049417175,0.000008712709],"category_scores_gemma":[0.00015663904,0.0007102624,0.00025611816,0.0005218896,0.000334426,0.0006226988,0.0017191209,0.00081604044,0.000032387823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022114004,0.000024538096,0.000006946497,0.00013953558,0.000012362802,0.00003331413,0.0005415852,0.33919245,0.00020618971,0.13822499,0.000024439165,0.5215914],"study_design_scores_gemma":[0.0001867475,0.00012342623,7.6281947e-7,0.00043462033,0.000008032133,0.0000281071,5.1924005e-8,0.81204396,0.00279652,0.17902724,0.0046758577,0.0006746587],"about_ca_topic_score_codex":0.000012904883,"about_ca_topic_score_gemma":0.000014994577,"teacher_disagreement_score":0.52091676,"about_ca_system_score_codex":0.00029147865,"about_ca_system_score_gemma":0.0004342989,"threshold_uncertainty_score":0.99953485},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011744351,0.00028037888,0.9959111,0.0007712324,0.0011002781,0.00036605127,0.0000055949063,0.0006487104,0.0009048707],"genre_scores_gemma":[0.0139584765,0.00005110301,0.9846732,0.0004533999,0.0002191574,0.000020120244,0.000001734934,0.000046330624,0.0005765047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632466,0.000019004729,0.00045584884,0.0013562621,0.001130598,0.0007136568],"domain_scores_gemma":[0.99642813,0.00034915018,0.0002092535,0.0025748352,0.00026725838,0.00017134898],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011378058,0.0005421703,0.00038509394,0.0004669825,0.0005059345,0.0008261264,0.006359954,0.00048312833,0.000003271261],"category_scores_gemma":[0.00003224454,0.00040356474,0.00014705332,0.00037498263,0.0006982315,0.00057775294,0.0024341387,0.0016338456,0.000026578902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016830492,0.000009168782,0.000002138738,0.0000070539636,0.0000035784772,0.000012304929,0.00025779035,0.090120845,0.0005639135,0.15659495,0.000023082843,0.7524035],"study_design_scores_gemma":[0.000056148812,0.000052003095,0.000010506697,0.00010726373,0.0000021844428,0.000027643351,6.2297576e-9,0.7202668,0.0017917703,0.26594502,0.011379468,0.00036120255],"about_ca_topic_score_codex":0.000014069511,"about_ca_topic_score_gemma":0.000079309786,"teacher_disagreement_score":0.7520423,"about_ca_system_score_codex":0.00021655197,"about_ca_system_score_gemma":0.00050234486,"threshold_uncertainty_score":0.99984163},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008050058,0.00025329468,0.99726963,0.00004914847,0.0008033642,0.000582417,0.000015430178,0.00041352375,0.00053267385],"genre_scores_gemma":[0.009031582,0.000008993724,0.990201,0.00011456573,0.00038012804,0.00007922018,0.00003701618,0.000090796275,0.000056704695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981778,0.000005741951,0.0003348815,0.00066620513,0.0004042883,0.0004110864],"domain_scores_gemma":[0.9988193,0.0003780124,0.00013105711,0.00033555328,0.00025110523,0.00008497288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043418884,0.00037002045,0.00032064997,0.00042408664,0.0002777504,0.0001945862,0.0005286065,0.00016231544,0.000018985616],"category_scores_gemma":[0.00015058646,0.0003476999,0.00005056116,0.0004717386,0.00014780124,0.0002522608,0.00011151077,0.00056902773,0.0000019144134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004268342,0.000004942788,0.000004252342,0.000082442864,0.000007899457,0.0000023742316,0.00017055769,0.74832356,0.0000880891,0.000078850826,2.8511025e-7,0.2512325],"study_design_scores_gemma":[0.00042187015,0.00011603223,0.000002636672,0.00017769629,0.000013752782,0.000020359874,9.2675435e-7,0.99591976,0.0011522601,0.0016181086,0.00009449648,0.00046210244],"about_ca_topic_score_codex":0.000005387939,"about_ca_topic_score_gemma":0.0000069764546,"teacher_disagreement_score":0.2507704,"about_ca_system_score_codex":0.00024809653,"about_ca_system_score_gemma":0.00020213122,"threshold_uncertainty_score":0.9998975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009737094,0.0012398382,0.9948599,0.00065110525,0.0011176401,0.0009485305,0.000016367647,0.00004037739,0.00015257437],"genre_scores_gemma":[0.9462153,0.00018445177,0.051200822,0.00067209173,0.0016058738,0.000016800423,0.000014228263,0.00003963009,0.00005085715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964598,0.000116981006,0.000719667,0.001181377,0.0007288338,0.0007933474],"domain_scores_gemma":[0.9960007,0.0018879347,0.0005892818,0.0010315673,0.00040676325,0.00008376018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001907236,0.00049793936,0.00066913164,0.00028227025,0.000498835,0.0003183917,0.002521075,0.00027632984,0.0000023880914],"category_scores_gemma":[0.0001790158,0.00033128407,0.00024065874,0.0010658209,0.00087396137,0.00022443663,0.00096649124,0.0011288887,9.106335e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010791274,0.0000066263274,0.00009001386,0.000017996219,0.000013217675,0.000007939073,0.00019177473,0.15732478,0.0000057945595,0.0016174128,0.000004205898,0.84070945],"study_design_scores_gemma":[0.00061893737,0.00011913877,0.0007374844,0.001670675,0.000021123296,0.0000725469,4.937165e-7,0.99090266,0.00025665588,0.0048941253,0.00029724627,0.00040892445],"about_ca_topic_score_codex":0.000015982216,"about_ca_topic_score_gemma":0.000041031326,"teacher_disagreement_score":0.9452415,"about_ca_system_score_codex":0.00023425442,"about_ca_system_score_gemma":0.0002805323,"threshold_uncertainty_score":0.99991393},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035187672,0.0014638968,0.98847115,0.0025163193,0.0033600181,0.00047724522,0.00014643176,0.0003715155,0.00284152],"genre_scores_gemma":[0.24803828,0.0005066019,0.74369895,0.0057890755,0.0011584938,0.000050499646,0.0005777982,0.00011701979,0.000063265055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99342984,0.00011213309,0.0007158626,0.0024744777,0.00205069,0.0012169984],"domain_scores_gemma":[0.9958135,0.00027306387,0.0003300787,0.0027640993,0.0004637267,0.00035553408],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016835529,0.0007885661,0.000709774,0.0018094332,0.0010327516,0.001563711,0.0066276523,0.0003819792,0.00054638356],"category_scores_gemma":[0.000150127,0.0007891396,0.00034186326,0.0017524395,0.0010040908,0.0033144325,0.004673099,0.0014660397,0.00006311218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018286508,0.000120944176,0.0000836547,0.00007073332,0.00003806766,0.00017934467,0.0024641645,0.0012932005,0.00061921077,0.73647964,0.0001633558,0.2584694],"study_design_scores_gemma":[0.0005370689,0.0007173002,0.00025950937,0.00016722197,0.000030855466,0.00037908496,0.000003002178,0.21537904,0.0010724375,0.67092204,0.10857886,0.0019535937],"about_ca_topic_score_codex":0.0002746765,"about_ca_topic_score_gemma":0.00018351499,"teacher_disagreement_score":0.2565158,"about_ca_system_score_codex":0.00044327968,"about_ca_system_score_gemma":0.0010584876,"threshold_uncertainty_score":0.99947274},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003113323,0.0013335418,0.9898106,0.00025523006,0.003093894,0.0046978123,0.0000018830359,0.0003220395,0.00045390276],"genre_scores_gemma":[0.51249695,0.00067135575,0.47132856,0.005861547,0.0027119012,0.005122623,0.00011356252,0.00034853505,0.0013449652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99382687,0.00013427727,0.001017774,0.0022576984,0.0012671924,0.0014961753],"domain_scores_gemma":[0.99393576,0.003942009,0.0006577752,0.0009885763,0.0002521201,0.00022376883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021661187,0.0008925707,0.0011256279,0.0010541745,0.00075185514,0.0005383857,0.0027930073,0.0003762588,0.00004644305],"category_scores_gemma":[0.00025952506,0.00088426576,0.0002986011,0.001015282,0.00032958426,0.0005360985,0.002208375,0.0017164022,0.000011277782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006361918,0.000024044328,0.00018324835,0.000030054829,0.00002024231,0.000031151038,0.00052880566,0.5889366,0.0000040699742,0.0024746158,0.000021066597,0.40768248],"study_design_scores_gemma":[0.0025114596,0.00062876946,0.000090891095,0.00046239517,0.000017014856,0.00002023338,8.7777136e-7,0.9692616,0.000036054014,0.009054791,0.016956719,0.00095919333],"about_ca_topic_score_codex":0.00006188107,"about_ca_topic_score_gemma":0.00013519486,"teacher_disagreement_score":0.51848197,"about_ca_system_score_codex":0.0014411735,"about_ca_system_score_gemma":0.0004661672,"threshold_uncertainty_score":0.9993608},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016796641,0.0011131505,0.9947823,0.00030580917,0.0024507751,0.0007653847,0.00003134545,0.0002227931,0.00016047106],"genre_scores_gemma":[0.7962208,0.0007641208,0.19572362,0.0039520287,0.0020952187,0.00022218202,0.0004624352,0.00018076511,0.00037885125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957264,0.0001227651,0.0006856581,0.001799418,0.0008199308,0.0008458437],"domain_scores_gemma":[0.99778235,0.0005862862,0.00037108155,0.0010093639,0.00010336173,0.0001475656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016870439,0.0005514838,0.0005735135,0.0011431099,0.000743873,0.00044506285,0.0024817185,0.00039662214,0.000041515912],"category_scores_gemma":[0.000058757894,0.0005786621,0.00015736492,0.0011250752,0.00025104685,0.0005830492,0.0013010731,0.0021027655,0.000007860279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001848732,0.0000170033,9.935675e-7,0.000011634701,0.0000036892131,0.000018093495,0.00018937883,0.56926525,0.000009808486,0.0014068987,0.000013362187,0.4290454],"study_design_scores_gemma":[0.0004170585,0.000464652,0.0000041593366,0.00011122693,0.000007658142,0.0000886962,2.1233978e-7,0.9553646,0.000120680204,0.023556564,0.019277407,0.0005870715],"about_ca_topic_score_codex":0.00013930131,"about_ca_topic_score_gemma":0.001569548,"teacher_disagreement_score":0.7990587,"about_ca_system_score_codex":0.0005611703,"about_ca_system_score_gemma":0.00019561406,"threshold_uncertainty_score":0.99966645},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005220244,0.00017683649,0.98440915,0.0032419164,0.0015541095,0.00088501134,0.0000050749195,0.00009779065,0.009577881],"genre_scores_gemma":[0.26582173,0.00027243487,0.7031081,0.015591416,0.0037428818,0.00035549118,0.00017059168,0.00020182726,0.010735529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974993,0.000014261182,0.0003718801,0.0008055621,0.0009971525,0.000311853],"domain_scores_gemma":[0.99874246,0.00023923775,0.00015178745,0.0005552897,0.00014343034,0.00016779263],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00064114155,0.00024300275,0.00033316057,0.0004060341,0.00019577288,0.00006115602,0.0004750223,0.00018418678,0.00092134794],"category_scores_gemma":[0.00029862885,0.00022430668,0.00012777334,0.00017918521,0.00037308948,0.000068710986,0.0003010252,0.0005433767,0.00002695179],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011397101,0.00007228257,0.000028206252,0.00016741217,0.000025301386,0.00025861565,0.0002171624,0.0013034411,0.0006920876,0.005440472,0.0002535195,0.99142754],"study_design_scores_gemma":[0.0009835712,0.0004964379,0.0002653134,0.00021682827,0.00004251232,0.00046043773,8.963052e-7,0.87860036,0.00034505277,0.0068178955,0.111391135,0.00037957443],"about_ca_topic_score_codex":0.000012863169,"about_ca_topic_score_gemma":0.00006872933,"teacher_disagreement_score":0.991048,"about_ca_system_score_codex":0.00045034965,"about_ca_system_score_gemma":0.00032679157,"threshold_uncertainty_score":0.99999195},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019821867,0.00034125015,0.99032575,0.0045954105,0.0025301098,0.0011019781,0.000020601296,0.00022209188,0.0006645857],"genre_scores_gemma":[0.57915574,0.00006519655,0.4149804,0.0027666641,0.0009608685,0.00017797909,0.000019147388,0.00010181325,0.0017721661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953407,0.000036161317,0.00048463326,0.0019879984,0.0012598087,0.00089071906],"domain_scores_gemma":[0.99768126,0.0005289731,0.00032721646,0.0011170477,0.00015413998,0.00019138106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069208053,0.00065033184,0.0007036097,0.00072244526,0.0004962621,0.00083041814,0.0037214134,0.0002680172,0.000033672895],"category_scores_gemma":[0.00007964214,0.0005777072,0.00031425376,0.00037812252,0.00033368688,0.00068991777,0.00086804334,0.0008862795,0.0000019884505],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017074984,0.000034329627,0.000033286364,0.00012185014,0.000022487655,0.000031286956,0.0015575155,0.017655142,0.00014576239,0.025122048,0.000019932573,0.9552393],"study_design_scores_gemma":[0.0007703704,0.0002793508,0.00011166605,0.0002593814,0.000017941586,0.000043912336,8.6531236e-7,0.88597697,0.0006647345,0.10161648,0.009299382,0.000958924],"about_ca_topic_score_codex":0.000010480152,"about_ca_topic_score_gemma":0.000082212704,"teacher_disagreement_score":0.9542804,"about_ca_system_score_codex":0.0004802722,"about_ca_system_score_gemma":0.00034687677,"threshold_uncertainty_score":0.99966747},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009173863,0.0004640471,0.9953138,0.00081995974,0.0010098815,0.0003413769,0.0000035568703,0.000049990405,0.0019056196],"genre_scores_gemma":[0.025956612,0.00017984523,0.97234344,0.001201375,0.0001295604,0.000018174578,0.0000047631,0.00001869917,0.0001475267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977575,0.00011472909,0.00043330964,0.0007201079,0.0007135984,0.0002607376],"domain_scores_gemma":[0.9980182,0.0003695723,0.00037294638,0.0010605117,0.00013415169,0.00004460234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019020953,0.0002471248,0.00033689357,0.0003832303,0.00025026276,0.00019906762,0.002195576,0.00010843839,0.000028063205],"category_scores_gemma":[0.0001224678,0.00017865242,0.000067871384,0.00043968394,0.0011620374,0.000509686,0.0014182776,0.00039729447,0.000002615188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012208569,0.000008709105,0.000026863365,0.000038314945,0.000008056117,0.000004217844,0.0015704053,0.024884779,0.00014904374,0.6174965,0.000009090757,0.3557918],"study_design_scores_gemma":[0.00031813333,0.000060750703,0.0001687055,0.00005559433,0.0000076484075,0.00004027013,1.4616232e-7,0.81897014,0.0014888253,0.1768394,0.0018101073,0.00024026661],"about_ca_topic_score_codex":0.000029946787,"about_ca_topic_score_gemma":0.0000069843354,"teacher_disagreement_score":0.7940854,"about_ca_system_score_codex":0.000097840624,"about_ca_system_score_gemma":0.0001350078,"threshold_uncertainty_score":0.72852343},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25819373,0.001844288,0.71924603,0.0028775963,0.004097048,0.008008629,0.00096830726,0.00007330416,0.0046910676],"genre_scores_gemma":[0.99909914,0.0000011813089,0.00018533022,0.00018056997,0.000083284554,0.0002757556,0.000019361769,0.000019142366,0.0001362632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9981934,0.00027442357,0.00031229787,0.0005893984,0.00037177367,0.00025869944],"domain_scores_gemma":[0.9964288,0.002843524,0.00025181216,0.00031165287,0.00008505343,0.000079198355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016248692,0.0002128229,0.00032027115,0.00014600146,0.00027813003,0.00006688194,0.00058416085,0.000071055765,0.000052574964],"category_scores_gemma":[0.00012994639,0.0001345097,0.0001790554,0.00017489708,0.0013810109,0.00012105561,0.00025629162,0.00030685816,8.7243666e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0056908987,0.00043717504,0.0109529765,0.0017108602,0.00021822519,0.000039194045,0.01704311,0.006346069,0.000008481179,0.55307496,0.000016625378,0.4044614],"study_design_scores_gemma":[0.0021859526,0.0006115374,0.6173274,0.0008723047,0.0001071694,0.00003075568,0.000018173587,0.014089377,0.000018760195,0.36398637,0.00031629973,0.00043593065],"about_ca_topic_score_codex":0.0005497692,"about_ca_topic_score_gemma":0.00023015286,"teacher_disagreement_score":0.7409054,"about_ca_system_score_codex":0.00018864538,"about_ca_system_score_gemma":0.00010575928,"threshold_uncertainty_score":0.5485146},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000094619696,0.00035514103,0.9931712,0.0002806373,0.0037013623,0.0012880089,0.000015146318,0.00019086518,0.00090300216],"genre_scores_gemma":[0.25541902,0.00004291996,0.73891276,0.001399031,0.0014239377,0.000492527,0.000116395386,0.00009812944,0.0020952716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664325,0.00003699648,0.0005601929,0.001413502,0.00083254324,0.0005135284],"domain_scores_gemma":[0.9978028,0.00037579256,0.00042028338,0.0010973845,0.00018443333,0.00011930388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010077007,0.00039750157,0.00042754487,0.000515822,0.00048071484,0.00041856727,0.0023100767,0.00021143424,0.000057755442],"category_scores_gemma":[0.000033675566,0.00039162725,0.00017004104,0.00039893336,0.0001606033,0.0007063667,0.0008321103,0.00045969288,0.000027530768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006000079,0.000044917153,0.00002778454,0.00010409644,0.0000136441795,0.0000248209,0.001493611,0.24770239,0.00049559324,0.040240936,0.000078166224,0.70976806],"study_design_scores_gemma":[0.00037616587,0.00033633018,0.00006966398,0.0001699851,0.000008150219,0.000050146133,2.6275904e-7,0.9366174,0.0010989687,0.031694293,0.028939206,0.00063947926],"about_ca_topic_score_codex":0.000057036566,"about_ca_topic_score_gemma":0.000027761185,"teacher_disagreement_score":0.70912856,"about_ca_system_score_codex":0.0005807129,"about_ca_system_score_gemma":0.00044730902,"threshold_uncertainty_score":0.99985355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006997859,0.00021678736,0.98972595,0.00095424027,0.00059907575,0.00046297183,0.0000253452,0.00065930816,0.0072863204],"genre_scores_gemma":[0.0269416,0.00004522851,0.9710503,0.0012272155,0.0002003626,0.00007028768,0.000059675407,0.00004669795,0.00035860352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504286,0.000049264632,0.0005574897,0.0021285764,0.0014412814,0.0007805369],"domain_scores_gemma":[0.9956839,0.00091128284,0.00047458956,0.0024987485,0.0002579514,0.00017350815],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009702725,0.00065096456,0.00061176915,0.0009649648,0.00053003285,0.00071252766,0.0055858023,0.0002237359,0.00009376991],"category_scores_gemma":[0.00013537283,0.000575256,0.00008860485,0.0009616001,0.0009876258,0.001051956,0.0022989467,0.0009427145,0.000017397906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020301724,0.00007201035,0.00047778166,0.00010405863,0.000033770953,0.00025362888,0.0011019883,0.03328325,0.0005146262,0.22029206,0.00035054237,0.743496],"study_design_scores_gemma":[0.0005511907,0.0007750031,0.0005488696,0.00054419384,0.000029564804,0.00038081376,0.000001486075,0.8038399,0.0047190674,0.1312369,0.05508389,0.002289106],"about_ca_topic_score_codex":0.00008737321,"about_ca_topic_score_gemma":0.00012674618,"teacher_disagreement_score":0.7705567,"about_ca_system_score_codex":0.0006488796,"about_ca_system_score_gemma":0.00083905243,"threshold_uncertainty_score":0.9997945},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042517193,0.00056373724,0.9882652,0.0032215216,0.0056237867,0.00077509665,0.000024723842,0.00036672017,0.0011166557],"genre_scores_gemma":[0.05837441,0.00011079915,0.93431896,0.0030179538,0.0016588615,0.00016082978,0.00002768936,0.00010824483,0.0022222253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99490154,0.00005970719,0.0006819477,0.0022445288,0.0012088825,0.00090338296],"domain_scores_gemma":[0.99661726,0.00053418515,0.00033297035,0.0019923062,0.0003306152,0.0001926501],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012741232,0.0006601926,0.00066366646,0.0007035074,0.0006480817,0.00057387847,0.00411455,0.00031972997,0.0001415171],"category_scores_gemma":[0.00012500664,0.0006572895,0.00023921268,0.0005482366,0.00055321836,0.0012491478,0.0019138858,0.00091015716,0.00001848348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021296817,0.00005541954,0.000109169734,0.00016848547,0.00003217562,0.00012132851,0.0023682576,0.1865568,0.000051976032,0.20506364,0.00031781787,0.60513365],"study_design_scores_gemma":[0.00041846742,0.0004406693,0.000045616784,0.00030168617,0.000017269384,0.00014743037,0.0000014235317,0.71773547,0.00042790084,0.22997329,0.049244083,0.0012466927],"about_ca_topic_score_codex":0.00006228604,"about_ca_topic_score_gemma":0.00012415025,"teacher_disagreement_score":0.60388696,"about_ca_system_score_codex":0.0005647457,"about_ca_system_score_gemma":0.00088619994,"threshold_uncertainty_score":0.99958783},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53227746,0.0037471293,0.4365966,0.0020024655,0.004829285,0.012089583,0.00014592631,0.00030282736,0.00800872],"genre_scores_gemma":[0.9925448,0.000007737388,0.005145649,0.0008980121,0.00015897791,0.00034911427,0.000010988406,0.00004471394,0.00084002985],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976343,0.0000580734,0.0005163825,0.00098753,0.0003571812,0.00044651292],"domain_scores_gemma":[0.9984204,0.00059311115,0.0002666819,0.0005255074,0.00004734909,0.00014693063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007202923,0.00030803494,0.00038322186,0.0005547622,0.0003700542,0.00020573319,0.0005340738,0.000110797686,0.000052973624],"category_scores_gemma":[0.00012328474,0.00031406406,0.00008362634,0.00018011048,0.0003005266,0.00021232173,0.00090623496,0.00043640434,0.000006185206],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013800019,0.00074578816,0.002552143,0.00029032538,0.000078004,0.000025343845,0.012585775,0.0006862182,0.00001896651,0.019022688,0.00006170507,0.96379507],"study_design_scores_gemma":[0.009076015,0.05214405,0.10044231,0.007389527,0.0002585536,0.00045212393,0.00025014498,0.008698215,0.00027415113,0.77904886,0.037659995,0.004306052],"about_ca_topic_score_codex":0.00007602527,"about_ca_topic_score_gemma":0.000073727824,"teacher_disagreement_score":0.959489,"about_ca_system_score_codex":0.00022191675,"about_ca_system_score_gemma":0.000107208674,"threshold_uncertainty_score":0.99993116},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08336274,0.00017360567,0.9112356,0.0006626461,0.0016176865,0.0007972056,0.0000085907905,0.00018282354,0.0019591372],"genre_scores_gemma":[0.9249344,0.00007292264,0.07416617,0.00045512937,0.000116119074,0.000091849404,0.0000069245125,0.00002656832,0.00012991647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680525,0.000062097926,0.0004792621,0.001393809,0.00075786567,0.0005017177],"domain_scores_gemma":[0.99837726,0.00021010653,0.00035606822,0.00071721035,0.00028282378,0.00005649971],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075101625,0.00044543485,0.00047436584,0.0016644475,0.00039138025,0.00036072353,0.001608074,0.0003034255,0.000057977475],"category_scores_gemma":[0.000052592928,0.00045928225,0.00004723753,0.0012679269,0.00053967757,0.0018141994,0.0018448299,0.001565555,0.000011610395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051677183,0.00009872397,0.0005459184,0.000091801405,0.000026719033,0.00022420102,0.0173255,0.11184204,0.0023442507,0.056587204,0.000022656717,0.8108393],"study_design_scores_gemma":[0.0008790502,0.0012776845,0.001965464,0.00057738525,0.000011248873,0.00030140887,0.000025687774,0.9357406,0.0056228074,0.049397934,0.002777727,0.0014230149],"about_ca_topic_score_codex":0.00006343733,"about_ca_topic_score_gemma":0.00030974825,"teacher_disagreement_score":0.8415716,"about_ca_system_score_codex":0.0010924469,"about_ca_system_score_gemma":0.0006192004,"threshold_uncertainty_score":0.9997859},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014866979,0.0021281743,0.98398316,0.0024046167,0.0055849887,0.00049033493,0.000008106539,0.00034610438,0.005039673],"genre_scores_gemma":[0.16655914,0.00084673805,0.79498947,0.024798777,0.005466353,0.0001601458,0.000049170827,0.00018854614,0.006941656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994342,0.00017297256,0.00083097356,0.0020025705,0.0016455929,0.0010058527],"domain_scores_gemma":[0.9962439,0.0009374871,0.0004811303,0.0018580358,0.00020987976,0.00026958817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022390338,0.00065561297,0.0008262093,0.00045096767,0.00068556913,0.0005786399,0.0045326035,0.00030634092,0.00027845273],"category_scores_gemma":[0.00006631056,0.000607646,0.00024061526,0.0010123894,0.00043442895,0.00065383856,0.0025332319,0.0014382043,0.00007935598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065417607,0.000018880079,0.000019162864,0.000017655895,0.000011346911,0.000067240944,0.00013450354,0.07943942,0.0000040182554,0.12126957,0.00020982209,0.79880184],"study_design_scores_gemma":[0.0005938607,0.00022605028,0.0001320851,0.0004961896,0.000017933231,0.00009875622,1.5550587e-7,0.72825885,0.000011819801,0.14210126,0.12682052,0.0012425063],"about_ca_topic_score_codex":0.000030729163,"about_ca_topic_score_gemma":0.000101420635,"teacher_disagreement_score":0.7975593,"about_ca_system_score_codex":0.00039260025,"about_ca_system_score_gemma":0.0009625321,"threshold_uncertainty_score":0.9996375},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018260453,0.00012937962,0.98055154,0.0053544864,0.0011796356,0.00071134476,0.0000064373316,0.00019793621,0.011686645],"genre_scores_gemma":[0.7050223,0.00004350511,0.2927947,0.0014805732,0.00038785578,0.00006996859,0.000010835983,0.00005108217,0.00013919608],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969609,0.00012840168,0.0006460182,0.0010087938,0.0008421788,0.00041371046],"domain_scores_gemma":[0.9963935,0.0014085798,0.0006530022,0.0012999623,0.00016456051,0.000080370475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015150968,0.00038714643,0.00042960426,0.0005297673,0.0006246761,0.0005189923,0.0035463038,0.00013332069,0.000032873624],"category_scores_gemma":[0.0001645911,0.00028717925,0.00014689982,0.000660644,0.0004992271,0.0005946791,0.001551429,0.0010456162,0.0000038221838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016131297,0.000048243146,0.00003260652,0.000059075126,0.00002225684,0.000011248788,0.009014255,0.0071370825,0.00015563714,0.35265604,0.00012080137,0.6307412],"study_design_scores_gemma":[0.0007080015,0.0017591274,0.0003510469,0.0026598012,0.000026837797,0.00016837096,0.000041033363,0.33776328,0.0069105267,0.62933177,0.018518796,0.0017614149],"about_ca_topic_score_codex":0.00008626874,"about_ca_topic_score_gemma":0.000043487416,"teacher_disagreement_score":0.7048397,"about_ca_system_score_codex":0.0002409711,"about_ca_system_score_gemma":0.00061426853,"threshold_uncertainty_score":0.99995804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029626157,0.00060982484,0.98990226,0.0009672561,0.0016307794,0.0005983134,0.000005645214,0.00017037446,0.005819312],"genre_scores_gemma":[0.66415304,0.000054495595,0.33091882,0.0035431422,0.00058119046,0.00009280964,0.000024096398,0.00008977101,0.0005425995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957576,0.00006950414,0.000651162,0.001624316,0.0009681464,0.0009292689],"domain_scores_gemma":[0.9974178,0.0010890425,0.00031825225,0.00086023775,0.00012326002,0.00019139508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013988594,0.0005061384,0.00051546376,0.0012832268,0.00040903492,0.0005587506,0.0026693125,0.00021148105,0.00009555997],"category_scores_gemma":[0.00023189277,0.0005019663,0.00017734323,0.00089290243,0.00023983291,0.00077306275,0.0007892768,0.0010847417,0.000009334774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024829262,0.000031540105,0.000060892802,0.0000366614,0.000011697429,0.00021222231,0.003310478,0.5193333,0.00014668009,0.05119659,0.000038510338,0.4255966],"study_design_scores_gemma":[0.0007509871,0.0002533099,0.00028316467,0.00013727463,0.0000057871252,0.00006887131,0.0000036371835,0.94632363,0.000095736,0.044821344,0.00657021,0.00068604713],"about_ca_topic_score_codex":0.00002084666,"about_ca_topic_score_gemma":0.00007796201,"teacher_disagreement_score":0.6638568,"about_ca_system_score_codex":0.0003483917,"about_ca_system_score_gemma":0.00076290505,"threshold_uncertainty_score":0.9997432},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004439143,0.0005005251,0.9932363,0.0007300679,0.0011383989,0.00033347757,0.00006429798,0.00010300535,0.003449997],"genre_scores_gemma":[0.6397709,0.00014768669,0.35625952,0.0023958595,0.00037325858,0.000023816792,0.00008214375,0.000071522714,0.0008752906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967908,0.00005585305,0.0006547647,0.0012100266,0.00084314257,0.0004453866],"domain_scores_gemma":[0.99756825,0.0004741665,0.0005043228,0.0010975703,0.00021626765,0.00013944105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008037705,0.0003829324,0.0005139643,0.00075381575,0.0004604453,0.0003215256,0.0023412572,0.00017258868,0.00043260262],"category_scores_gemma":[0.000056689412,0.0004057625,0.000087354274,0.00072504097,0.00043096862,0.0006526328,0.0016756477,0.00081340596,0.00000981335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022014518,0.00023695502,0.00053824316,0.0003129582,0.00008174943,0.00009129034,0.0069187935,0.024212118,0.0066005685,0.42283177,0.000039927974,0.5381136],"study_design_scores_gemma":[0.00050534954,0.00022293624,0.0016622443,0.00019089748,0.000014877941,0.00024104599,8.420602e-7,0.9296972,0.0009741268,0.045168538,0.020394769,0.0009271645],"about_ca_topic_score_codex":0.000045544308,"about_ca_topic_score_gemma":0.00004678767,"teacher_disagreement_score":0.9054851,"about_ca_system_score_codex":0.00015550636,"about_ca_system_score_gemma":0.00045974873,"threshold_uncertainty_score":0.9998394},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016745502,0.000521591,0.98400295,0.0010728237,0.0021127118,0.00062006176,0.0000051958596,0.00046535433,0.011182547],"genre_scores_gemma":[0.09678072,0.00012651898,0.8943572,0.0050145346,0.00098247,0.00010289438,0.000023546054,0.00006673357,0.002545371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958237,0.000059643473,0.00053550565,0.0016204396,0.0013116708,0.0006490813],"domain_scores_gemma":[0.9974339,0.00021785412,0.00031938605,0.0016881205,0.00022894041,0.00011179761],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012123105,0.000482665,0.00049610814,0.0008284797,0.00043325094,0.0007181206,0.0037112464,0.0001969564,0.00027266704],"category_scores_gemma":[0.00008608835,0.00048592957,0.00012036326,0.000637947,0.00031422862,0.0011534515,0.0020146193,0.00078266644,0.000052945197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008710127,0.000054494438,0.000012794314,0.00002750247,0.000020846572,0.0001842841,0.0005375284,0.030747168,0.010979359,0.08807619,0.0010949691,0.86825615],"study_design_scores_gemma":[0.0004552792,0.0003367882,0.000008410892,0.00009324494,0.00000783318,0.000052577252,5.6984018e-8,0.8442086,0.031788453,0.08680362,0.0353171,0.00092801504],"about_ca_topic_score_codex":0.000035502067,"about_ca_topic_score_gemma":0.000051847055,"teacher_disagreement_score":0.8673281,"about_ca_system_score_codex":0.0006410793,"about_ca_system_score_gemma":0.0005759433,"threshold_uncertainty_score":0.99975926},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94793856,0.013038961,0.021201888,0.012057578,0.0021165127,0.0019931493,0.000040610532,0.00007224032,0.0015405115],"genre_scores_gemma":[0.9638271,0.001496314,0.03111708,0.0025165358,0.00026977144,0.000025905865,0.000020442943,0.000053687738,0.00067321747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983499,0.000047821854,0.00040858777,0.00048466198,0.0005097907,0.00019920792],"domain_scores_gemma":[0.99918896,0.00020715044,0.00020054124,0.00029789645,0.000030589643,0.000074833675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063492585,0.00020763764,0.0004247861,0.0002564172,0.00012822307,0.000034672685,0.00020770381,0.000020529755,0.00011989132],"category_scores_gemma":[0.00016052728,0.00015075949,0.000055425207,0.00016834235,0.0004517393,0.00010028822,0.00044981146,0.0006596113,9.653759e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006310883,0.000175326,0.20966686,0.0035414216,0.000067575886,0.0009650625,0.0030318897,0.0036478376,0.002138218,0.000669996,0.00012808725,0.7759046],"study_design_scores_gemma":[0.0031378225,0.00072881195,0.20826179,0.004666607,0.00013888668,0.0031723685,0.000006491645,0.770788,0.00037139346,0.0056990325,0.0024726233,0.0005561763],"about_ca_topic_score_codex":0.00007533605,"about_ca_topic_score_gemma":0.000052962252,"teacher_disagreement_score":0.7753484,"about_ca_system_score_codex":0.00024113744,"about_ca_system_score_gemma":0.00010447084,"threshold_uncertainty_score":0.61477935},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025696723,0.0026527685,0.96842176,0.00013166395,0.0009726636,0.0001996142,0.000017678787,0.0000334696,0.0018736878],"genre_scores_gemma":[0.99069995,0.00023569072,0.0083389655,0.00019895087,0.0002067999,0.000002454083,0.000010982964,0.000033260247,0.00027297775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982873,0.000006499218,0.000532445,0.00073573744,0.0001106886,0.00032730593],"domain_scores_gemma":[0.99903786,0.00012915596,0.0005042174,0.0002475154,0.00002942187,0.00005183265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008435629,0.0002375812,0.0003902156,0.0010843658,0.00039564472,0.00029735055,0.00026043484,0.00013557683,0.00031398894],"category_scores_gemma":[0.000066049564,0.00027743384,0.00006397477,0.00032340872,0.00015766083,0.00038044073,0.00032221928,0.00080762233,0.0000031890906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003106498,0.000007626209,0.03617849,0.000024196777,0.000005290957,0.0000086657155,0.00038004236,0.89602363,0.0000088989755,0.0028524054,2.58811e-7,0.064507395],"study_design_scores_gemma":[0.00014723201,0.000030458814,0.0020005892,0.000081087754,0.0000043090618,0.000007219752,6.9830185e-7,0.98014885,0.0000064211245,0.008258431,0.009000195,0.000314525],"about_ca_topic_score_codex":0.0007767073,"about_ca_topic_score_gemma":0.0003455648,"teacher_disagreement_score":0.9650032,"about_ca_system_score_codex":0.00037672964,"about_ca_system_score_gemma":0.00007602345,"threshold_uncertainty_score":0.99996775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024324348,0.00025184956,0.9800957,0.0010015154,0.005690235,0.0006625772,0.0000132561345,0.0005073753,0.011534249],"genre_scores_gemma":[0.25595394,0.00011755443,0.73211604,0.0067929355,0.0030885506,0.0000722327,0.00016745216,0.00022671327,0.001464562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99233437,0.0002109327,0.0010047841,0.0027858631,0.0023825762,0.00128149],"domain_scores_gemma":[0.995453,0.00086678733,0.00079244084,0.0022030969,0.00036448447,0.00032020846],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024917496,0.0009451436,0.0009063428,0.0013370949,0.0012373585,0.0008311705,0.0062533114,0.00051377405,0.00032534558],"category_scores_gemma":[0.00060321053,0.0010089104,0.00034133394,0.001389091,0.00069386204,0.0015341565,0.0063944217,0.002861159,0.0001626371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026483254,0.000029025809,0.00008905219,0.000029414792,0.000029857132,0.0005439375,0.0011971107,0.6809713,0.00010346097,0.0633647,0.000087934226,0.2535277],"study_design_scores_gemma":[0.0011438956,0.00031807105,0.000059985025,0.0003652125,0.000030946216,0.00029638494,9.721304e-7,0.90189266,0.00021938434,0.059118964,0.03488421,0.0016692886],"about_ca_topic_score_codex":0.00011099222,"about_ca_topic_score_gemma":0.00003369483,"teacher_disagreement_score":0.2557107,"about_ca_system_score_codex":0.0015794139,"about_ca_system_score_gemma":0.0014798283,"threshold_uncertainty_score":0.9994393},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013143335,0.0004437074,0.98220587,0.0004096299,0.0018513788,0.0009774088,0.0000026218106,0.013115752,0.00098048],"genre_scores_gemma":[0.0071623344,0.000009860425,0.99057555,0.0012922046,0.00052253145,0.00016792382,0.000010380384,0.000050372397,0.00020882925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606,0.000040621315,0.0005477078,0.0015956147,0.000895103,0.0008609558],"domain_scores_gemma":[0.996201,0.0012985367,0.0003369953,0.0018339092,0.00018696676,0.00014258915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001900121,0.00049303495,0.00054146786,0.00046926196,0.00056633423,0.00045312635,0.0036071257,0.00022091754,0.000025453945],"category_scores_gemma":[0.0003008198,0.0004709446,0.0002695676,0.0007838422,0.00039351408,0.00036260483,0.0019143322,0.0006899435,0.000008195686],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000203482,0.000025206104,0.0001371841,0.00006661921,0.000010089024,0.000037196834,0.00024931153,0.005845368,6.159247e-7,0.020351993,0.0010857397,0.97218865],"study_design_scores_gemma":[0.00008472868,0.00029839834,0.000024241945,0.00026022622,0.000006217636,0.00005755316,9.183897e-9,0.52286774,0.000008752194,0.4664484,0.009557915,0.0003858459],"about_ca_topic_score_codex":0.000023612874,"about_ca_topic_score_gemma":0.000012749789,"teacher_disagreement_score":0.9718028,"about_ca_system_score_codex":0.0003601394,"about_ca_system_score_gemma":0.00056675513,"threshold_uncertainty_score":0.9997742},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017081985,0.0013193456,0.99132645,0.00013700595,0.0013860848,0.00030839536,0.000011162935,0.00006364903,0.0037397083],"genre_scores_gemma":[0.9759448,0.00012671598,0.022626039,0.00078903424,0.0001478909,0.00001681593,0.000009040418,0.000014258045,0.00032539843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787307,0.000075440454,0.00043624413,0.0006456416,0.00066325354,0.0003063283],"domain_scores_gemma":[0.9986026,0.00025735845,0.0002997059,0.0006139053,0.00011739583,0.00010902379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010716087,0.00024988997,0.0003913235,0.0004927839,0.00013154434,0.00040328325,0.001524782,0.00014418499,0.000011312355],"category_scores_gemma":[0.00004805565,0.00023275154,0.000039567825,0.00050958066,0.0005190363,0.0005979827,0.0022666228,0.0006112931,0.0000021720791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022592329,0.00013246982,0.001645307,0.0015613344,0.000054650824,0.000099306184,0.059926037,0.009566149,0.000029317986,0.28234133,0.001657134,0.64296436],"study_design_scores_gemma":[0.00028621772,0.00017821149,0.0004517339,0.00019860487,0.0000050549693,0.00015662155,0.0000023116122,0.9539822,0.00014974864,0.03719287,0.0069938763,0.00040258776],"about_ca_topic_score_codex":0.00013091923,"about_ca_topic_score_gemma":0.000032784617,"teacher_disagreement_score":0.9742366,"about_ca_system_score_codex":0.00015137855,"about_ca_system_score_gemma":0.00040668892,"threshold_uncertainty_score":0.9491333},"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":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033300777,0.00059067213,0.99334615,0.00053084036,0.0006224572,0.0002514731,0.0000027839017,0.000047997684,0.0012775642],"genre_scores_gemma":[0.567528,0.000101680205,0.43112838,0.00032077622,0.0002731945,0.0000046600726,0.0000040437294,0.000030433705,0.00060881185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969221,0.000033107077,0.00051792245,0.0015980108,0.00070289586,0.00022599312],"domain_scores_gemma":[0.9970088,0.0001771042,0.00049400557,0.0021316689,0.00014677546,0.00004162575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016062915,0.00020438613,0.00037161732,0.00043768945,0.00012225911,0.000042446794,0.0011746353,0.00012423894,0.000029506522],"category_scores_gemma":[0.0001763519,0.00020608144,0.00006140753,0.00039030542,0.00041012815,0.00030927177,0.0011499784,0.00032068393,8.6026756e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017782051,0.00001974106,0.00016612707,0.000088698784,0.000011851993,0.0000069740354,0.0048603234,0.027853088,0.0066973204,0.025776073,0.0000075996268,0.93449444],"study_design_scores_gemma":[0.00052260887,0.00051998586,0.00048941025,0.0004331413,0.00002194652,0.00024469916,0.0000018744157,0.8034599,0.04850119,0.13998492,0.0050047343,0.00081563566],"about_ca_topic_score_codex":0.000020582072,"about_ca_topic_score_gemma":0.000008629913,"teacher_disagreement_score":0.9336788,"about_ca_system_score_codex":0.00018481674,"about_ca_system_score_gemma":0.0002263395,"threshold_uncertainty_score":0.8403758},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003118994,0.0005821465,0.97815967,0.00041689424,0.0016092652,0.00037497593,0.000012859449,0.000059052047,0.01566617],"genre_scores_gemma":[0.97973466,0.000026795546,0.018640282,0.00041395304,0.00013882785,0.0000076136894,0.0000037297184,0.000020394406,0.0010137422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968778,0.0001318938,0.0004991297,0.00090592244,0.0011962297,0.00038901865],"domain_scores_gemma":[0.9965322,0.00043814367,0.00072210206,0.0020242836,0.00022299557,0.00006030262],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011680751,0.00031903078,0.00059128384,0.00055240764,0.0004172707,0.00011708198,0.0055230255,0.00016780813,0.00008913821],"category_scores_gemma":[0.00020698969,0.00019634275,0.00050057925,0.0029281562,0.00079899153,0.00026005897,0.0032332768,0.00063090114,0.00000508173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001805114,0.00017808612,0.0064245095,0.00009359644,0.00044999976,0.000016784597,0.011841454,0.43775335,0.0015601102,0.2243261,0.00010988857,0.31722805],"study_design_scores_gemma":[0.00015832171,0.000096267235,0.008516469,0.00023592803,0.00018340135,0.000017328546,7.052591e-7,0.96110773,0.0027071885,0.025416413,0.0011692785,0.00039096316],"about_ca_topic_score_codex":0.00008821519,"about_ca_topic_score_gemma":0.00009118927,"teacher_disagreement_score":0.97661567,"about_ca_system_score_codex":0.00024746504,"about_ca_system_score_gemma":0.00045619757,"threshold_uncertainty_score":0.99985754},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010460087,0.0019531304,0.9452537,0.0006741705,0.014501535,0.0052485466,0.00007355759,0.00020664887,0.031042702],"genre_scores_gemma":[0.8007836,0.00045596683,0.039058026,0.004201875,0.004242088,0.014469781,0.0005067511,0.0002566902,0.13602526],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974344,0.000025753796,0.00032748358,0.0011821433,0.0006753506,0.00035491845],"domain_scores_gemma":[0.99865717,0.0001645397,0.0002727389,0.00060634385,0.00024369966,0.00005552431],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003669373,0.00032434677,0.00027021175,0.00046376343,0.0005618086,0.00011343873,0.00097505905,0.00014215268,0.00039720017],"category_scores_gemma":[0.00000880885,0.00034506916,0.00009832928,0.00027587108,0.00027078242,0.00013331199,0.00048326398,0.00032640065,0.000040196606],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049798244,0.00054684404,0.0032544718,0.00020354895,0.00017889062,0.0000051569536,0.004827597,0.008960132,0.000018446484,0.048968203,0.0011161715,0.93187076],"study_design_scores_gemma":[0.0028388032,0.0015737497,0.067839384,0.0004883325,0.00039596506,0.000052852312,0.00012932881,0.00400181,0.00018527689,0.17446752,0.7451903,0.0028366505],"about_ca_topic_score_codex":0.000042425272,"about_ca_topic_score_gemma":0.0000495426,"teacher_disagreement_score":0.9290341,"about_ca_system_score_codex":0.00067373103,"about_ca_system_score_gemma":0.00013376972,"threshold_uncertainty_score":0.9999001},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023254571,0.0014105756,0.9015556,0.0055686287,0.0015725996,0.00083080464,0.000013121173,0.00017620162,0.0656179],"genre_scores_gemma":[0.99653316,0.0002137752,0.0016143569,0.0006942536,0.0007093412,0.000009260299,0.0000010082744,0.00001537237,0.00020949323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979837,0.000052020616,0.00026553217,0.00061015744,0.000604461,0.0004841154],"domain_scores_gemma":[0.99929756,0.00019679009,0.00010868165,0.00023042853,0.0000658094,0.00010072177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008083108,0.00021878534,0.00028607438,0.0009967481,0.0006864569,0.00028481276,0.00067190715,0.00018474335,0.000041028285],"category_scores_gemma":[0.00015679344,0.00021860376,0.00005165273,0.00062241446,0.00069308194,0.0004354978,0.00042784665,0.0005660848,0.000002998106],"study_design_candidate":"design_other","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.000012323271,0.000013515696,0.00064064754,0.000013739147,0.0000052856585,0.000023623801,0.008328169,0.05204659,0.000038333954,0.05461392,4.540738e-7,0.8842634],"study_design_scores_gemma":[0.0005664656,0.00014898366,0.0015726403,0.00015839917,0.000014200983,0.000019581006,0.0000237489,0.5448639,0.00005685468,0.44737768,0.00424886,0.00094867963],"about_ca_topic_score_codex":0.017505692,"about_ca_topic_score_gemma":0.026907539,"teacher_disagreement_score":0.9732786,"about_ca_system_score_codex":0.0004505438,"about_ca_system_score_gemma":0.00059295044,"threshold_uncertainty_score":0.99084884},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19406477,0.00041594237,0.8021964,0.00020062632,0.0010909783,0.0007602605,0.0000021150415,0.0001877296,0.0010812088],"genre_scores_gemma":[0.98680043,0.000010255765,0.012191178,0.0006982103,0.00014278808,0.000007931745,0.0000011480927,0.000017086324,0.00013099327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716306,0.00030579208,0.00032952195,0.0011646143,0.0006714002,0.00036560372],"domain_scores_gemma":[0.99664783,0.0022275029,0.00027700435,0.0006348749,0.00008870525,0.0001241076],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015155299,0.00036494393,0.00050886563,0.00066117395,0.00083247357,0.00018176835,0.0012172738,0.00013086449,0.000015170799],"category_scores_gemma":[0.0001190392,0.00035144918,0.0000749814,0.00024033559,0.00019556783,0.0003375484,0.0013709116,0.0026513455,0.0000027160431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014893896,0.000053316566,0.0002578114,0.000027773858,0.000021809825,0.0020618408,0.0042645736,0.020906461,0.00001585296,0.0019858691,0.0000023537893,0.97038746],"study_design_scores_gemma":[0.003676263,0.008374783,0.00055880955,0.0005368055,0.00009070111,0.004262602,0.000052746487,0.973924,0.000024707973,0.0049317344,0.0020810172,0.0014858514],"about_ca_topic_score_codex":0.00021630981,"about_ca_topic_score_gemma":0.00015051143,"teacher_disagreement_score":0.9689016,"about_ca_system_score_codex":0.00015001834,"about_ca_system_score_gemma":0.00027503312,"threshold_uncertainty_score":0.9998937},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049753636,0.00080530334,0.9849275,0.00043233746,0.0032066929,0.0004709027,0.00012799609,0.000052962303,0.0050009456],"genre_scores_gemma":[0.9942192,0.00006329194,0.003714189,0.00055922795,0.0004347376,0.000014935143,0.000018845532,0.000031504216,0.0009440813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983373,0.0000018840365,0.00047625168,0.00074626325,0.00012730995,0.00031095676],"domain_scores_gemma":[0.99924433,0.00008116193,0.0001937706,0.00038312605,0.000031828717,0.000065765016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005484748,0.00022841348,0.00035368124,0.0010004861,0.00008612232,0.00014185451,0.00041140098,0.00014903526,0.00039254955],"category_scores_gemma":[0.00005210453,0.0002602102,0.000072749695,0.0003601562,0.00004837737,0.0002361251,0.00022568819,0.0005026119,0.000034131983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041674743,0.000008019465,0.0021220027,0.000017099657,0.0000047729527,0.0000058300197,0.00031752491,0.9642001,0.0000054740963,0.009586997,0.000017034456,0.02371098],"study_design_scores_gemma":[0.00013099461,0.0000692722,0.012292932,0.00005600769,0.0000020936184,0.0000020458792,1.8478532e-7,0.9485686,0.000020579466,0.010716383,0.027836634,0.00030426963],"about_ca_topic_score_codex":0.00012549525,"about_ca_topic_score_gemma":0.000081387625,"teacher_disagreement_score":0.9892438,"about_ca_system_score_codex":0.0004128683,"about_ca_system_score_gemma":0.000049763876,"threshold_uncertainty_score":0.99998504},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055461507,0.00060811994,0.9746884,0.0019014286,0.004043281,0.000723853,0.000010415605,0.0003940719,0.017574947],"genre_scores_gemma":[0.27028444,0.000398239,0.7160314,0.0071480735,0.0022889362,0.00022165957,0.000039803366,0.00027983802,0.003307643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916561,0.00010974205,0.0012646349,0.0030320755,0.002258546,0.00167887],"domain_scores_gemma":[0.99474293,0.0009564738,0.0005336764,0.002956659,0.00042492055,0.00038531373],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002396277,0.0009392804,0.0008536713,0.0018013237,0.0011844311,0.001304697,0.008531939,0.0004073023,0.0008474376],"category_scores_gemma":[0.00031529897,0.0009932262,0.00028305795,0.0021077807,0.0012546047,0.0020302918,0.004684505,0.0019611954,0.00049703295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008779994,0.000056210072,0.0000046981722,0.00002758329,0.0000090709655,0.0003496517,0.001171118,0.05888021,0.0001700394,0.4693819,0.000026135296,0.46991462],"study_design_scores_gemma":[0.000030044097,0.00030352833,0.0000030355325,0.00011504366,0.0000077866525,0.00009721271,0.000003571759,0.28160322,0.014516983,0.69567,0.006693518,0.0009560597],"about_ca_topic_score_codex":0.00017288029,"about_ca_topic_score_gemma":0.00024862238,"teacher_disagreement_score":0.46895856,"about_ca_system_score_codex":0.0011421493,"about_ca_system_score_gemma":0.0013093993,"threshold_uncertainty_score":0.999732},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78108114,0.0014410208,0.21607699,0.00048648386,0.00029820803,0.0005017673,0.000014456642,0.000020573238,0.0000793652],"genre_scores_gemma":[0.97358745,0.0007856782,0.02504142,0.0003424695,0.00014573795,0.000009444601,0.000038956292,0.000018591982,0.00003025703],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863523,0.000026338752,0.00025485916,0.0004915057,0.0004093438,0.00018272935],"domain_scores_gemma":[0.9994356,0.00010643319,0.0001913109,0.00012598623,0.000046596906,0.000094073854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040152235,0.00017924342,0.00031086046,0.00025008418,0.00011852352,0.000044645243,0.00007640294,0.000025079398,0.0000147029705],"category_scores_gemma":[0.00005096576,0.00014467977,0.000016192544,0.00014560898,0.000774925,0.000117568976,0.00011462001,0.00076630746,2.7873094e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011540931,0.000014415976,0.49314457,0.0001387351,0.000023357776,0.00021670808,0.0004001653,0.1548583,0.000024078601,0.00005623529,0.000010758769,0.35099727],"study_design_scores_gemma":[0.00090604357,0.0005072166,0.09575895,0.00044653518,0.000038637314,0.00090771116,0.0000016939423,0.90081584,0.000005482579,0.0004053627,0.00009232537,0.00011418565],"about_ca_topic_score_codex":0.000421589,"about_ca_topic_score_gemma":0.00032818172,"teacher_disagreement_score":0.74595755,"about_ca_system_score_codex":0.00013571716,"about_ca_system_score_gemma":0.0001990045,"threshold_uncertainty_score":0.589987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004779774,0.0014110497,0.9796563,0.00049574376,0.004556995,0.0005554869,0.0000067211986,0.0002470612,0.012592675],"genre_scores_gemma":[0.66597974,0.0001497682,0.32766363,0.0036660575,0.00081274094,0.00007360089,0.000012442124,0.00013909808,0.0015029568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934284,0.00011644887,0.0010195588,0.0024203898,0.0019041987,0.0011109757],"domain_scores_gemma":[0.9962258,0.00072358164,0.00046008566,0.0021973064,0.00017543648,0.00021783863],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0022182202,0.00071027887,0.00094547827,0.0023826908,0.00030152308,0.0006232139,0.0066224025,0.00035179695,0.00008317708],"category_scores_gemma":[0.00015330444,0.00073307427,0.00017776048,0.0021034926,0.00041630407,0.0009053111,0.0035501996,0.001677993,0.00006408678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013147602,0.00007556796,0.0007800968,0.000064792606,0.000018485665,0.0013727099,0.0025391392,0.39334396,0.00008307635,0.04945772,0.0001590349,0.55209225],"study_design_scores_gemma":[0.000648171,0.0002548736,0.00013982864,0.00048914197,0.000006005393,0.00032596427,6.0613763e-7,0.9147577,0.00023813611,0.054842085,0.02686287,0.0014345655],"about_ca_topic_score_codex":0.00008105865,"about_ca_topic_score_gemma":0.00014003277,"teacher_disagreement_score":0.6655017,"about_ca_system_score_codex":0.0011702606,"about_ca_system_score_gemma":0.0010113559,"threshold_uncertainty_score":0.999512},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008133739,0.0002302041,0.9829293,0.0014886366,0.00041637363,0.00062515674,0.000006746263,0.00025409446,0.014041359],"genre_scores_gemma":[0.07940688,0.00019530051,0.91426766,0.0016448433,0.00025446867,0.00007446407,0.00006585631,0.00010159816,0.0039889463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955536,0.00008192673,0.00044044526,0.0015637774,0.0016422435,0.00071796915],"domain_scores_gemma":[0.99817747,0.00019867385,0.00029434267,0.00094081444,0.00017319946,0.00021551028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090531784,0.00050230493,0.00044672098,0.0007863322,0.000637939,0.00090729527,0.002939467,0.00013215531,0.0002826013],"category_scores_gemma":[0.000031261927,0.00040709053,0.00009614542,0.0009237084,0.0006508328,0.00089804805,0.0020625961,0.0015679988,0.000027952494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021818829,0.00007082664,0.00020864062,0.00005716209,0.000020428182,0.00018873287,0.00181682,0.70170915,0.000032259093,0.07908471,0.000018379811,0.2167711],"study_design_scores_gemma":[0.00054233207,0.000651813,0.000027203901,0.00021841137,0.000005772612,0.00013354246,4.0328354e-7,0.95668304,0.00005485433,0.02273536,0.018250527,0.0006967601],"about_ca_topic_score_codex":0.000055083354,"about_ca_topic_score_gemma":0.00007742434,"teacher_disagreement_score":0.2549739,"about_ca_system_score_codex":0.00042188744,"about_ca_system_score_gemma":0.00072740397,"threshold_uncertainty_score":0.9998381},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008787218,0.0002824996,0.9938064,0.0007607204,0.0029554602,0.0010125793,0.000028842062,0.00021345115,0.0009312322],"genre_scores_gemma":[0.015325739,0.000069544054,0.98036104,0.002213239,0.00092144846,0.000112566806,0.00004256285,0.00006730819,0.00088657025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99615425,0.000051280298,0.0005423708,0.001634483,0.00091142213,0.0007061747],"domain_scores_gemma":[0.9973719,0.0005117309,0.0003649438,0.0013473766,0.00023970408,0.00016430437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014028619,0.0005224834,0.0005581963,0.0006843602,0.0005744328,0.00047680235,0.0034908555,0.0001744225,0.00013838266],"category_scores_gemma":[0.00014130813,0.0005147646,0.00023569171,0.0004126229,0.00027102977,0.00066075835,0.0013807532,0.000592671,0.000025382304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011991935,0.000026985897,2.5329442e-7,0.00003912183,0.0000129889995,0.00008130606,0.0002499187,0.031032331,0.000025436404,0.7288202,0.00003271161,0.23966676],"study_design_scores_gemma":[0.00033704328,0.00017083652,3.1377064e-7,0.00005132862,0.000008522568,0.000061948245,8.974389e-8,0.49008167,0.00046650472,0.5058496,0.0026032412,0.00036894303],"about_ca_topic_score_codex":0.000008977219,"about_ca_topic_score_gemma":0.000007181112,"teacher_disagreement_score":0.4590493,"about_ca_system_score_codex":0.00035989992,"about_ca_system_score_gemma":0.0006129973,"threshold_uncertainty_score":0.9997304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023399354,0.00022940642,0.99413896,0.00013066754,0.0035651415,0.0011153001,0.000091277376,0.00012300505,0.0005828267],"genre_scores_gemma":[0.07438031,0.00002072192,0.92486924,0.00012096377,0.00019671331,0.00014379805,0.000037613318,0.000042513733,0.0001881457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996502,0.00007117611,0.00086247106,0.0011670291,0.0009312788,0.0004660793],"domain_scores_gemma":[0.9956089,0.0013561689,0.0008807023,0.0015914796,0.00045757944,0.000105160056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001779946,0.00037855958,0.00052078435,0.00090528326,0.0003800728,0.0002536043,0.0028802287,0.00016650074,0.000019929235],"category_scores_gemma":[0.0003202095,0.00040086187,0.00014818784,0.0005846335,0.00047498805,0.0007078927,0.0005552862,0.0006113899,0.000014097892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011292107,0.000025850455,7.288908e-7,0.00009547729,0.000012570583,0.0000031556779,0.00038664968,0.82775784,0.00032573496,0.09769032,0.000007989967,0.07368238],"study_design_scores_gemma":[0.00019769381,0.00023364897,0.000032092048,0.00013132907,0.000014054853,0.000035043635,4.989998e-7,0.96015656,0.00035222963,0.03672833,0.0017256914,0.00039282467],"about_ca_topic_score_codex":0.000043670276,"about_ca_topic_score_gemma":0.000010491289,"teacher_disagreement_score":0.13239872,"about_ca_system_score_codex":0.00043718013,"about_ca_system_score_gemma":0.00050148397,"threshold_uncertainty_score":0.9998443},"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":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005552616,0.0006394873,0.9689062,0.00054625684,0.00931578,0.00028338525,0.000029117926,0.00013295056,0.02009126],"genre_scores_gemma":[0.3041273,0.00048609602,0.26282406,0.06320966,0.34364608,0.00007982555,0.0119528,0.00083477667,0.012839391],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961747,0.000008142086,0.00044162545,0.0015720631,0.0011472777,0.0006561956],"domain_scores_gemma":[0.9967277,0.00014907031,0.00035729882,0.0022832497,0.00045002354,0.000032625576],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016182672,0.00046659607,0.0004509774,0.0009624829,0.00023780855,0.0014264836,0.0056898897,0.0002808174,0.00010581152],"category_scores_gemma":[0.00040055966,0.00040301596,0.000047995873,0.0017221365,0.00065838726,0.0022038708,0.0058589205,0.0006740188,0.0003502741],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065744775,0.000027715063,0.00032815093,0.00016522878,0.000006192295,0.00004396518,0.000027481701,0.0020313894,0.000009800591,0.00047326292,0.019709429,0.9771708],"study_design_scores_gemma":[0.00017488202,0.000013847013,0.00021846943,0.0008290174,0.00003771548,0.000019936759,2.9524927e-7,0.33318126,0.000025814817,0.067877255,0.596716,0.000905536],"about_ca_topic_score_codex":0.00025303126,"about_ca_topic_score_gemma":0.0005969258,"teacher_disagreement_score":0.97626525,"about_ca_system_score_codex":0.00019365159,"about_ca_system_score_gemma":0.0008584962,"threshold_uncertainty_score":0.99984217},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023419062,0.00027448396,0.9504211,0.0008241054,0.0011355078,0.00019773425,0.0000014907813,0.00015451961,0.04675688],"genre_scores_gemma":[0.78090376,0.0001014786,0.14371039,0.049483296,0.018894538,0.000021959984,0.000058716116,0.00028310635,0.00654278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970574,0.0000018700649,0.00042120618,0.0010786401,0.00083953055,0.0006013983],"domain_scores_gemma":[0.99850535,0.00007160735,0.00023850916,0.00061736355,0.0005260535,0.000041117117],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008428647,0.0004485359,0.0004576813,0.0016419508,0.00025252832,0.00065213576,0.0012094255,0.00024815073,0.00014611408],"category_scores_gemma":[0.00010647955,0.0003991872,0.00012074691,0.001121474,0.00023593167,0.0009751087,0.0006682296,0.00048650723,0.00056918187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020749889,0.00003628954,0.00030861277,0.00022162838,0.00002054004,0.00006283482,0.00008175398,0.23717321,0.00003925294,0.011326929,0.00021559864,0.7504926],"study_design_scores_gemma":[0.00046125264,0.00003205385,0.00029799578,0.0015360451,0.00013792921,0.00001304961,7.233378e-7,0.67732906,0.00017317683,0.10350894,0.21425034,0.0022594337],"about_ca_topic_score_codex":0.00023705873,"about_ca_topic_score_gemma":0.00024999218,"teacher_disagreement_score":0.8067107,"about_ca_system_score_codex":0.00010716582,"about_ca_system_score_gemma":0.000111618974,"threshold_uncertainty_score":0.999846},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008000932,0.0015022367,0.99592173,0.00058171194,0.00013394335,0.00011556105,0.0000014415143,0.00003522037,0.00090805866],"genre_scores_gemma":[0.9935347,0.000086153406,0.004111549,0.0014975484,0.0006717584,0.000005061817,0.00001725254,0.00001613681,0.00005984478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879235,0.000005119893,0.00023208611,0.0005504098,0.0002638911,0.00015614508],"domain_scores_gemma":[0.99924123,0.000110735455,0.000253015,0.00019146127,0.0001896656,0.000013905583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038089594,0.00018743258,0.0003133348,0.0004011895,0.00009899641,0.00020316313,0.00035132768,0.000098264376,0.0000045771017],"category_scores_gemma":[0.000107013046,0.0001620585,0.000030394642,0.00074647565,0.00041666726,0.00035853346,0.00036995398,0.0002109758,0.0000036689255],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067795313,0.000012226081,0.0009637163,0.0005597,0.0000084315025,0.0000022082597,0.000111326066,0.003660463,0.000077321245,0.0056239334,0.000039827908,0.98893404],"study_design_scores_gemma":[0.00017451981,0.000008721947,0.00046542828,0.00025859903,0.000057554465,0.0000021799412,7.2013967e-7,0.79825383,0.000036832193,0.19841246,0.00205772,0.00027144962],"about_ca_topic_score_codex":0.0000324359,"about_ca_topic_score_gemma":0.000009681886,"teacher_disagreement_score":0.9927346,"about_ca_system_score_codex":0.00001596897,"about_ca_system_score_gemma":0.00009916774,"threshold_uncertainty_score":0.6608554},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002003135,0.0006752402,0.99646336,0.00037860632,0.0011545242,0.00076104264,0.000015086895,0.00008331943,0.00046680614],"genre_scores_gemma":[0.01500834,0.00004708325,0.9840569,0.00043034804,0.00022046463,0.00011847907,0.0000035619169,0.000046286565,0.00006852138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998688,0.00004926372,0.0003455317,0.00029029994,0.00035846987,0.00026843112],"domain_scores_gemma":[0.9968782,0.00234508,0.00013661379,0.00053705904,0.00008109943,0.000021945458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016808722,0.00023482062,0.0002101534,0.00010488844,0.00019785206,0.00006114335,0.0008399472,0.000135128,0.000009094365],"category_scores_gemma":[0.00024167626,0.00013232155,0.00010518955,0.00026274397,0.00024124079,0.0000917524,0.0001294168,0.0004822599,5.1915146e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.9330323e-7,0.0000021210387,0.0000012427605,0.000034566023,0.000011718449,5.909979e-8,0.00014054208,0.5899949,0.0018170428,0.0010101512,0.00006339348,0.40692344],"study_design_scores_gemma":[0.00005141082,0.000031751733,0.00000785715,0.00017559146,0.000021224325,0.000003979882,3.6473256e-7,0.88205045,0.07743223,0.03381468,0.0062382687,0.00017216502],"about_ca_topic_score_codex":0.0000043088207,"about_ca_topic_score_gemma":0.0000036168065,"teacher_disagreement_score":0.40675128,"about_ca_system_score_codex":0.00019648887,"about_ca_system_score_gemma":0.000031069805,"threshold_uncertainty_score":0.53959167},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009645666,0.0011087388,0.98128843,0.0069731767,0.0003482887,0.00052514346,0.000007683191,0.000020475192,0.00008236837],"genre_scores_gemma":[0.9781397,0.00040014932,0.019383676,0.0014878563,0.0002690439,0.000019412855,0.00024540766,0.000017745811,0.000037022557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771655,0.0000686552,0.00069194735,0.0006110569,0.000610367,0.00030144583],"domain_scores_gemma":[0.9984838,0.0007952378,0.00017313269,0.00018477788,0.00017667378,0.0001864062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012884018,0.00017631616,0.0005658006,0.0015402234,0.000052436702,0.00002559912,0.00024081285,0.00022252311,0.00004869549],"category_scores_gemma":[0.0019018807,0.00015475613,0.00007909884,0.0023657538,0.000734993,0.00008071819,0.00010377917,0.0006932701,8.2093993e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008366759,0.000097116645,0.07044571,0.00041922872,0.000019076448,0.000045847904,0.0032101367,0.0037761438,0.00009097241,0.00008825008,0.000051140323,0.9216727],"study_design_scores_gemma":[0.00013740151,0.00016784466,0.0036483507,0.00052297156,0.000047813588,0.000010880039,0.0000094271245,0.98535013,0.00028361284,0.009156267,0.0005318173,0.00013350933],"about_ca_topic_score_codex":0.00094945345,"about_ca_topic_score_gemma":0.0019805331,"teacher_disagreement_score":0.98157394,"about_ca_system_score_codex":0.00024392824,"about_ca_system_score_gemma":0.0015526899,"threshold_uncertainty_score":0.6310771},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000105003644,0.00041545954,0.9876189,0.0011409308,0.0043809125,0.0009343869,0.000004317383,0.00053395174,0.0048661153],"genre_scores_gemma":[0.015399339,0.000023490606,0.9798587,0.0018482754,0.0010224376,0.00003267382,0.000020153462,0.00005392408,0.0017410193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932087,0.0001694639,0.0008641498,0.0027681284,0.0017649729,0.0012245497],"domain_scores_gemma":[0.9951977,0.0011482143,0.0004629398,0.0021808273,0.00066653185,0.00034380276],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015116087,0.00080789445,0.00087465026,0.0013523014,0.00038554883,0.0013854562,0.006323547,0.0005136184,0.000045521716],"category_scores_gemma":[0.0002126769,0.00077465625,0.00023179388,0.0025411292,0.00094297447,0.0015102623,0.0036583038,0.001278049,0.00043244672],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002321566,0.00009670705,0.00007289996,0.00009252551,0.000013297952,0.00009041246,0.00065368594,0.10194183,0.00004728225,0.0024013198,0.0020726554,0.89251506],"study_design_scores_gemma":[0.00026880018,0.0001791578,0.0003268043,0.00018129864,0.000006241538,0.00007654505,1.4088499e-7,0.7510139,0.00024751434,0.2452601,0.0016869352,0.0007525716],"about_ca_topic_score_codex":0.0000819652,"about_ca_topic_score_gemma":0.000046236957,"teacher_disagreement_score":0.8917625,"about_ca_system_score_codex":0.0014574364,"about_ca_system_score_gemma":0.002227916,"threshold_uncertainty_score":0.9996512},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049751496,0.0005096404,0.99365735,0.0003748868,0.00093643676,0.0005071137,0.0000036188712,0.00025314896,0.0037080476],"genre_scores_gemma":[0.026870875,0.00005235619,0.971335,0.00045311995,0.00044663847,0.000048069982,0.0000063605844,0.000033784494,0.0007538243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996565,0.000022571987,0.00046449035,0.0015477149,0.00073052605,0.0006696895],"domain_scores_gemma":[0.9976085,0.00013857397,0.00024000477,0.0015343111,0.00028090086,0.00019772265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039729843,0.00044989938,0.00035837898,0.00057851226,0.0003794543,0.00029362988,0.0029315099,0.00023991415,0.000041982614],"category_scores_gemma":[0.000027098753,0.00042113202,0.0001314611,0.0008552103,0.0006247827,0.0004463244,0.0011733419,0.00061652844,0.00012015964],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013141762,0.00004768002,0.000042787873,0.00001529746,0.000007981109,0.00004398533,0.0004978405,0.0018152518,0.000031226453,0.064905465,0.000021673652,0.9325695],"study_design_scores_gemma":[0.00038446175,0.000356669,0.0013298454,0.00037608488,0.000020127178,0.00028573492,2.6839845e-7,0.5014369,0.00059331045,0.46225327,0.03152866,0.0014346696],"about_ca_topic_score_codex":0.00003482088,"about_ca_topic_score_gemma":0.000041388408,"teacher_disagreement_score":0.9311348,"about_ca_system_score_codex":0.0002188279,"about_ca_system_score_gemma":0.0005552451,"threshold_uncertainty_score":0.99982405},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000062806066,0.0010284806,0.9965494,0.00009640939,0.0003800868,0.00061967556,0.0000054776465,0.00028965186,0.0009679892],"genre_scores_gemma":[0.11352105,0.00035573015,0.88560706,0.00014105193,0.00014584033,0.00001560742,0.00007264244,0.000028780145,0.000112255846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973965,0.000052129046,0.0006649794,0.0008653672,0.0006843884,0.00033660402],"domain_scores_gemma":[0.9979801,0.00014781875,0.00053774635,0.00068420713,0.00055243296,0.000097702316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005279516,0.00033772577,0.00043999744,0.00070423953,0.00021820175,0.00023077561,0.0009625466,0.00018898897,0.0000045424285],"category_scores_gemma":[0.000031765598,0.00032840078,0.00005563127,0.0006512961,0.0004220062,0.00042157882,0.0005132304,0.00026274615,0.0000015385768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037716839,0.00003258802,0.0007827169,0.00006180983,0.000015551663,0.000015235049,0.0014027213,0.81171733,0.000016280967,0.011735716,0.00008055365,0.17413574],"study_design_scores_gemma":[0.0002816411,0.00019778452,0.00015448476,0.00025091428,0.000006393648,0.000072492185,0.0000012238883,0.99672866,0.00029990758,0.0011759571,0.0004648248,0.00036570887],"about_ca_topic_score_codex":0.00007184751,"about_ca_topic_score_gemma":0.000021644042,"teacher_disagreement_score":0.18501136,"about_ca_system_score_codex":0.00012379973,"about_ca_system_score_gemma":0.0002875344,"threshold_uncertainty_score":0.9999168},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010043198,0.00078268687,0.97982013,0.00009781305,0.0012982448,0.00020809045,0.0000064516566,0.00018283224,0.017503308],"genre_scores_gemma":[0.4627362,0.00012898397,0.53352547,0.0017637402,0.00047038854,0.000009507065,0.000005704603,0.00007739577,0.0012826272],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969255,0.00005297356,0.00055707904,0.0011928981,0.00073626055,0.00053530454],"domain_scores_gemma":[0.99656296,0.00059061515,0.0003904792,0.0021502431,0.00017166173,0.00013406297],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015667889,0.00045185423,0.00057643274,0.00075412507,0.0001151877,0.00015670968,0.0054025324,0.00028592953,0.00010703379],"category_scores_gemma":[0.00008048323,0.0003843721,0.00016373106,0.0004572482,0.0010749274,0.00054689695,0.001982384,0.00051759207,0.000069370864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003982323,0.000019351735,0.000011191553,0.000026951118,0.000008390839,0.00003240273,0.00060220883,0.00021810562,0.0001296121,0.44490245,0.000012754841,0.5540326],"study_design_scores_gemma":[0.00014782924,0.00013056406,0.00012599087,0.00035992463,0.000007633083,0.000061484505,1.4042233e-7,0.03443045,0.005258683,0.9583758,0.00062692794,0.00047454267],"about_ca_topic_score_codex":0.000013107108,"about_ca_topic_score_gemma":0.0000080923655,"teacher_disagreement_score":0.55355805,"about_ca_system_score_codex":0.00008951897,"about_ca_system_score_gemma":0.00037080987,"threshold_uncertainty_score":0.9999787},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030348916,0.00028324284,0.9957241,0.000007723064,0.0004022453,0.0001372621,0.0000011664251,0.00019021143,0.0029505987],"genre_scores_gemma":[0.64913785,0.00005343544,0.35040486,0.00007075176,0.0001938973,0.000004644503,0.000014958827,0.000059505044,0.00006008253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987881,0.0000069024686,0.0003127138,0.00032904846,0.0003116098,0.00025158632],"domain_scores_gemma":[0.99939644,0.00009867202,0.000114466784,0.0002831625,0.000060520546,0.000046725185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019769212,0.00025266752,0.00030762114,0.00043710798,0.00005200755,0.000058636728,0.000395806,0.00018416856,0.00004509684],"category_scores_gemma":[0.00002380832,0.0002469697,0.000044706503,0.0001482016,0.00011122736,0.00010114795,0.000050054594,0.00029229943,0.0000023308169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.2496157e-7,0.0000018717097,0.000010017564,0.00018669672,0.000005162646,0.0000015409341,0.00017086067,0.8884521,0.000023830686,0.00008875014,0.000003401999,0.11105481],"study_design_scores_gemma":[0.000088315646,0.00003983164,0.000050883795,0.0003913656,0.0000085990005,0.000006554511,3.690363e-8,0.99440414,0.0036532609,0.0010596039,0.00005231936,0.00024511304],"about_ca_topic_score_codex":0.0000018348329,"about_ca_topic_score_gemma":0.0000050569447,"teacher_disagreement_score":0.64883435,"about_ca_system_score_codex":0.00010533054,"about_ca_system_score_gemma":0.000066498425,"threshold_uncertainty_score":0.9999983},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006297417,0.00018721077,0.9704391,0.0007756341,0.0013389444,0.0003275581,0.0000013102206,0.00017141525,0.02675258],"genre_scores_gemma":[0.024015656,0.00012017912,0.9658035,0.0029052994,0.0003701363,0.000006666583,0.000004333187,0.000056623867,0.006717606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704665,0.000022019598,0.00033953987,0.0011658976,0.0008620355,0.00056386454],"domain_scores_gemma":[0.9979857,0.00022001604,0.00015026327,0.001307335,0.00018767329,0.0001489765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006926534,0.00034230502,0.00034631015,0.0006313659,0.00014733015,0.00061527116,0.0031677769,0.00021559463,0.00007590197],"category_scores_gemma":[0.000045427103,0.00031201044,0.000093929186,0.0004704614,0.00030257943,0.00060471223,0.0013854969,0.00064567244,0.00031143194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017445698,0.000016270757,0.00003681562,0.000039468956,0.00000704629,0.000040244202,0.0006293608,0.22477278,0.00009925784,0.10275544,0.000032924276,0.67156863],"study_design_scores_gemma":[0.00018214765,0.00009516854,0.000026665628,0.0002193761,0.0000015507145,0.000027447706,4.1234784e-8,0.91779435,0.0002971344,0.07468617,0.006207171,0.00046278606],"about_ca_topic_score_codex":0.000006684389,"about_ca_topic_score_gemma":0.000014475294,"teacher_disagreement_score":0.69302154,"about_ca_system_score_codex":0.00019115764,"about_ca_system_score_gemma":0.0006506368,"threshold_uncertainty_score":0.9999332},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084543496,0.0019623355,0.99162465,0.0032296272,0.00031947918,0.00017125145,0.00001601302,0.000084888416,0.0017463187],"genre_scores_gemma":[0.36688203,0.002701645,0.58325624,0.007881101,0.0013287595,0.0000018179818,0.000070163376,0.000093728115,0.03778452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975289,0.000041197913,0.00031212482,0.0010932445,0.00060733344,0.00041717428],"domain_scores_gemma":[0.99786973,0.00027989855,0.0002654131,0.0012963902,0.00014921927,0.00013932228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065592385,0.00034658614,0.00048016643,0.00041579545,0.0003457583,0.00018968446,0.0029373367,0.0002356154,0.000030229814],"category_scores_gemma":[0.00003135136,0.0002738368,0.00012821994,0.0004369054,0.0009527286,0.0004715322,0.001467462,0.0005142765,0.000022655568],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007165314,0.000016029227,0.00006730782,0.000021935342,0.000021916056,0.00008454624,0.0023875758,0.0031301165,0.00015527707,0.0014346037,0.00028532848,0.9923882],"study_design_scores_gemma":[0.0012288459,0.0007925546,0.0020522196,0.0010910481,0.00016188619,0.00030843078,0.0000033351412,0.80470747,0.0039262003,0.03784256,0.14570823,0.002177208],"about_ca_topic_score_codex":0.00015136757,"about_ca_topic_score_gemma":0.00033571338,"teacher_disagreement_score":0.990211,"about_ca_system_score_codex":0.000115604365,"about_ca_system_score_gemma":0.00020518735,"threshold_uncertainty_score":0.9999714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003636024,0.0012361618,0.9915053,0.000028493523,0.0047867037,0.0011829218,0.000019578862,0.0010860625,0.00015109165],"genre_scores_gemma":[0.028242473,0.000015622323,0.9709624,0.00003322841,0.00035631642,0.0001444041,0.0000038415365,0.00007052385,0.0001711911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960647,0.00004384992,0.0006709251,0.0017806691,0.00072220265,0.0007176213],"domain_scores_gemma":[0.9957294,0.0013622856,0.0004654308,0.0014915983,0.0008110437,0.00014022888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001517126,0.000626829,0.00068646553,0.0009562973,0.00021337876,0.0003565541,0.0029347595,0.0003452393,9.020134e-7],"category_scores_gemma":[0.0009884274,0.0006307196,0.00016124961,0.0004878338,0.0002399465,0.00093363,0.000816575,0.00053821376,0.000015894075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012620533,0.000013614021,0.0000033177473,0.00031162085,0.000046064455,0.00003435322,0.0014712319,0.6709527,0.00015400733,0.26791775,0.000006597054,0.059076168],"study_design_scores_gemma":[0.00042883633,0.0003600788,0.000054875643,0.002129531,0.00003682344,0.00011202825,0.0000059565104,0.82416487,0.0019028714,0.16907081,0.00024919203,0.0014841385],"about_ca_topic_score_codex":0.000023824517,"about_ca_topic_score_gemma":0.0000037902832,"teacher_disagreement_score":0.1532122,"about_ca_system_score_codex":0.0018155846,"about_ca_system_score_gemma":0.0003228598,"threshold_uncertainty_score":0.9996144},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035133775,0.00021079702,0.9843767,0.000029428144,0.009827256,0.00032783966,0.000004055038,0.0003487869,0.004523761],"genre_scores_gemma":[0.8426676,0.000085989646,0.120269656,0.0017562556,0.030466635,0.000049022063,0.00006787674,0.00041943497,0.0042175646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755305,0.000052111704,0.0004888936,0.0007339187,0.0006582596,0.00051377906],"domain_scores_gemma":[0.99865407,0.00028959493,0.00011100501,0.00069800054,0.0001125762,0.00013476548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088527537,0.0004355761,0.00054696033,0.00067940704,0.00015121714,0.00031766677,0.00068464753,0.00060687854,0.000038462542],"category_scores_gemma":[0.000022904702,0.00038203894,0.00013299247,0.00046767897,0.00018235891,0.00019814505,0.00021795406,0.0008796251,0.0003336199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044624358,0.000006259071,0.000007326664,0.000072214985,0.0000069038597,0.000015835669,0.00008521125,0.41809377,0.00019725096,0.000032797918,0.011314362,0.5701636],"study_design_scores_gemma":[0.00030672443,0.00028008607,0.00006423814,0.0005670546,0.0000071606028,0.00006405314,3.9341707e-8,0.9170697,0.0009895725,0.002313081,0.077754885,0.00058342644],"about_ca_topic_score_codex":0.000013118916,"about_ca_topic_score_gemma":0.00003091078,"teacher_disagreement_score":0.8641071,"about_ca_system_score_codex":0.00044358082,"about_ca_system_score_gemma":0.00015784291,"threshold_uncertainty_score":0.99986315},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076887687,0.0004891764,0.9889803,0.0052109435,0.0019280209,0.00070871157,0.00003974434,0.0008785591,0.0009956991],"genre_scores_gemma":[0.47619534,0.000009694798,0.5203226,0.0027989806,0.00015601824,0.000046786696,0.0000647573,0.00006619796,0.00033958585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930449,0.00005009912,0.000959445,0.0025440564,0.0018465905,0.0015548787],"domain_scores_gemma":[0.9957245,0.0005690957,0.00038686403,0.002547074,0.00054081535,0.00023162583],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014444,0.0008790765,0.0009426626,0.0019084484,0.00020927165,0.0013031523,0.0077880863,0.00067038473,0.0000074545596],"category_scores_gemma":[0.00047952047,0.0008572548,0.00017812056,0.002673603,0.0007618879,0.0009709388,0.002545017,0.0015846437,0.000050375795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021652198,0.0001251235,0.0015130296,0.00007638192,0.000017550845,0.00085737265,0.00023545894,0.4124996,0.0006866978,0.008151554,0.001216688,0.57459885],"study_design_scores_gemma":[0.0007274179,0.00019694211,0.0026018193,0.00088380236,0.000007286056,0.000047420188,4.332197e-7,0.9544705,0.0010983801,0.035696104,0.0029118396,0.0013580292],"about_ca_topic_score_codex":0.00026467213,"about_ca_topic_score_gemma":0.0023455392,"teacher_disagreement_score":0.5732408,"about_ca_system_score_codex":0.0023639228,"about_ca_system_score_gemma":0.0012597885,"threshold_uncertainty_score":0.99973357},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021564838,0.0005822821,0.9914877,0.0005655548,0.002279619,0.0009997862,0.00019033479,0.00021157096,0.003661578],"genre_scores_gemma":[0.083422154,0.000021696975,0.90765005,0.0025492976,0.0015442177,0.00012597896,0.00018544398,0.00009304415,0.0044081104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954698,0.000027805496,0.00072574714,0.0019545322,0.0008695168,0.0009525882],"domain_scores_gemma":[0.9964538,0.0007598692,0.00035880264,0.0018643307,0.00037857945,0.00018458244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009208706,0.00062585936,0.0007097903,0.00051570765,0.00036757192,0.00072341575,0.0032868637,0.00026857806,0.000008968921],"category_scores_gemma":[0.00012657503,0.00056005636,0.00021295433,0.0005338727,0.00045417223,0.00088822417,0.0011336001,0.0004939458,0.000050158575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003928914,0.00018160783,0.0003137637,0.0004117819,0.000039040613,0.000117382624,0.00033278498,0.14427373,0.000248779,0.050780796,0.009636038,0.793625],"study_design_scores_gemma":[0.0007245398,0.000104017665,0.00005580983,0.00050345634,0.000008527973,0.000052260704,7.748918e-8,0.8662693,0.00060561096,0.016152114,0.11472757,0.00079670455],"about_ca_topic_score_codex":0.00014916103,"about_ca_topic_score_gemma":0.00027126106,"teacher_disagreement_score":0.7928283,"about_ca_system_score_codex":0.0002540644,"about_ca_system_score_gemma":0.00043709003,"threshold_uncertainty_score":0.9996851},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010239459,0.0011541696,0.9953488,0.00012385599,0.001209839,0.0004768128,0.0000045251554,0.0004760542,0.00018199508],"genre_scores_gemma":[0.09661957,0.000083570936,0.9027179,0.000118539516,0.00019380618,0.000036248304,0.0000071606746,0.00007814884,0.00014507101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950578,0.000033657932,0.0005745878,0.0018322598,0.0014212277,0.0010804513],"domain_scores_gemma":[0.9953531,0.0026483897,0.00014271557,0.0014369737,0.00019624595,0.00022256456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008948062,0.00065806735,0.00066375773,0.0022704299,0.000141164,0.00026908153,0.003347764,0.00037865908,0.0000071880177],"category_scores_gemma":[0.0017708385,0.0006689628,0.00013367811,0.0018183239,0.00046604287,0.00071547757,0.0015582395,0.0016244778,0.000049694543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001632979,0.0000877763,0.0026238712,0.00019683396,0.000032971715,0.0010008389,0.0050265132,0.77419806,0.00007404421,0.01521724,0.000047198442,0.20147835],"study_design_scores_gemma":[0.00043034213,0.00026933,0.0038629703,0.00076132285,0.0000030440438,0.00016096975,4.055091e-7,0.9887272,0.00077511027,0.002997754,0.00085097563,0.0011605667],"about_ca_topic_score_codex":0.000035105906,"about_ca_topic_score_gemma":0.00004091375,"teacher_disagreement_score":0.21452917,"about_ca_system_score_codex":0.00071735046,"about_ca_system_score_gemma":0.0006989361,"threshold_uncertainty_score":0.99957615},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009518522,0.007636007,0.9809852,0.0002514189,0.00055099005,0.00011011721,0.000002033958,0.000022096021,0.00092359993],"genre_scores_gemma":[0.9677129,0.00022610281,0.030686008,0.0005546189,0.0003209123,0.00000385303,0.000033495104,0.00001704501,0.00044508462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895483,0.000044732904,0.00015278188,0.00044878785,0.00013846192,0.0002604159],"domain_scores_gemma":[0.9996393,0.00007505124,0.00006607853,0.0001448191,0.000023117314,0.00005164413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038556155,0.00015455135,0.00016143416,0.00017469925,0.00004751444,0.00004729449,0.00024298477,0.00018322433,0.0000026679018],"category_scores_gemma":[0.00023437096,0.00013589227,0.000023393066,0.00013176235,0.0004231879,0.000004945383,0.00034452925,0.0004153078,0.0000015626943],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109710345,0.000009529434,0.0059374096,0.000027714039,0.00000252287,0.000007857754,0.0002733324,0.0007461162,0.0031000932,0.0000055453434,0.000014515355,0.9898644],"study_design_scores_gemma":[0.0018152391,0.0014255367,0.016115742,0.0014607466,0.000036081332,0.00038352355,0.000004581341,0.8425785,0.013328464,0.01077035,0.1099054,0.0021758834],"about_ca_topic_score_codex":0.000011515933,"about_ca_topic_score_gemma":0.000054138512,"teacher_disagreement_score":0.9876885,"about_ca_system_score_codex":0.000032893062,"about_ca_system_score_gemma":0.000119656484,"threshold_uncertainty_score":0.5541526},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030761334,0.00007341141,0.96959305,0.022072837,0.0021960319,0.0035541933,0.000060083832,0.00097183575,0.001170918],"genre_scores_gemma":[0.30309924,9.857274e-7,0.66153216,0.033913836,0.0003280821,0.00029567187,0.000004178535,0.00010513944,0.00072072184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9896036,0.00009541258,0.0010104792,0.0037995952,0.0031700383,0.0023208773],"domain_scores_gemma":[0.99246687,0.0014060943,0.000234653,0.00323309,0.0013503344,0.0013089718],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0025228206,0.0014303791,0.0015813889,0.0033236996,0.00027719958,0.0013509175,0.0092761805,0.00063259254,0.000015547621],"category_scores_gemma":[0.0030656806,0.001266552,0.00024349305,0.0041163857,0.00036552385,0.00039051694,0.0020678148,0.0013732732,0.00030140742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001263941,0.00007107408,0.000024844216,0.00003581342,0.000037978396,0.00012668488,0.0014818257,0.9100286,0.00043054495,0.017484419,0.002037129,0.068114705],"study_design_scores_gemma":[0.00212515,0.002666573,0.0002975115,0.0015781607,0.00005870343,0.00011553276,0.0000027911851,0.89968216,0.0045512263,0.011467697,0.07322575,0.004228755],"about_ca_topic_score_codex":0.000026475873,"about_ca_topic_score_gemma":0.000060403338,"teacher_disagreement_score":0.30806094,"about_ca_system_score_codex":0.0011685293,"about_ca_system_score_gemma":0.000674069,"threshold_uncertainty_score":0.9998446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004238051,0.00027514322,0.9934095,0.0013375332,0.0008680649,0.0004455001,0.000003152828,0.00039742427,0.003221309],"genre_scores_gemma":[0.0028174764,0.00010915331,0.99145347,0.0046612173,0.0005603558,0.00001138665,0.000007929316,0.000028300496,0.00035070282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944965,0.000077820536,0.00078950904,0.0014714279,0.0024547842,0.0007099306],"domain_scores_gemma":[0.9974914,0.00044653693,0.0003618343,0.0010185156,0.00028863605,0.00039306656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015647691,0.0005051551,0.00053264777,0.0006855917,0.00026268052,0.0005982482,0.0035213472,0.00048923295,0.000717038],"category_scores_gemma":[0.0003503793,0.00043956572,0.00012568798,0.0005465086,0.0012805758,0.0012814504,0.0014222778,0.0009687874,0.00006434605],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032264172,0.000042070293,0.000013461384,0.00002444817,0.000008245612,0.00019142855,0.00028210852,0.0011119936,0.0026799801,0.003991178,0.00008187305,0.99157],"study_design_scores_gemma":[0.0005454405,0.00029105254,0.00004101716,0.00063767313,0.000016668726,0.0003157711,7.83802e-7,0.8840569,0.038736377,0.073400095,0.00081745855,0.0011407521],"about_ca_topic_score_codex":0.000040951898,"about_ca_topic_score_gemma":0.000045437508,"teacher_disagreement_score":0.9904292,"about_ca_system_score_codex":0.0005359673,"about_ca_system_score_gemma":0.0009779201,"threshold_uncertainty_score":0.9998056},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005210405,0.00020702924,0.9969506,0.0002483844,0.0007842241,0.00028931373,0.000047173027,0.00026369066,0.0006884914],"genre_scores_gemma":[0.03420764,0.000014889115,0.96456546,0.000472507,0.00023716368,0.0000057027814,0.00010497843,0.00004572081,0.00034596265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952925,0.000031715397,0.00066432275,0.0024251875,0.00088837865,0.00069789676],"domain_scores_gemma":[0.9945025,0.0005193002,0.0004381826,0.004137026,0.00019856311,0.00020443935],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011785025,0.00052867195,0.0005289564,0.0006325232,0.00053010276,0.00066231494,0.007406285,0.00031667677,0.0000061666756],"category_scores_gemma":[0.00020769534,0.0005051285,0.00007836073,0.00078435463,0.0006048727,0.0008836917,0.005152666,0.0006960083,0.000027931444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022489903,0.00003081977,0.00008023818,0.000024531631,0.000020421561,0.000021172373,0.0011743857,0.2644558,0.00022353687,0.010995593,0.00007131029,0.7229],"study_design_scores_gemma":[0.00022066849,0.00003740406,0.0000138127225,0.00028340612,0.0000140280845,0.000054521424,3.117447e-7,0.9860438,0.00018661366,0.010691501,0.0018743838,0.0005795255],"about_ca_topic_score_codex":0.000049189257,"about_ca_topic_score_gemma":0.000045966663,"teacher_disagreement_score":0.72232044,"about_ca_system_score_codex":0.00016501576,"about_ca_system_score_gemma":0.00058400095,"threshold_uncertainty_score":0.99974},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014167053,0.0029613287,0.98875827,0.00037076641,0.0029493186,0.00035118978,0.0000014505505,0.00022187602,0.0042441133],"genre_scores_gemma":[0.079648666,0.0010923247,0.90738404,0.0065749465,0.004951653,0.00005322293,0.000023384573,0.00007232,0.00019942473],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99567926,0.000097637545,0.0004999167,0.0019189168,0.0009010795,0.00090318],"domain_scores_gemma":[0.99743545,0.0005401567,0.00025783115,0.0013339057,0.0001837992,0.0002488484],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011133011,0.0005363435,0.00064458896,0.00056864996,0.00053252326,0.0011484043,0.0021565408,0.0005397476,0.000022758373],"category_scores_gemma":[0.000045635967,0.0005316832,0.00014008429,0.003012961,0.00075189886,0.0005189108,0.0023121338,0.0014762965,0.000011331159],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000926033,0.00004273308,0.000045418208,0.000065309934,0.000019200479,0.00007168422,0.0012096602,0.02210777,0.00002401686,0.03625504,0.0013099893,0.9388399],"study_design_scores_gemma":[0.00032927332,0.000118521326,0.0001792548,0.00054226187,0.000012571646,0.00011183852,3.6958244e-7,0.3123863,0.00030903387,0.6648458,0.020198703,0.0009660402],"about_ca_topic_score_codex":0.000008293733,"about_ca_topic_score_gemma":0.00012303416,"teacher_disagreement_score":0.9378739,"about_ca_system_score_codex":0.00018937871,"about_ca_system_score_gemma":0.0006576498,"threshold_uncertainty_score":0.9998885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007059587,0.0025435989,0.9848194,0.00015373003,0.0044988645,0.00057103793,0.0000056061212,0.0002472855,0.006454519],"genre_scores_gemma":[0.7862057,0.00024783175,0.21239209,0.00029655045,0.00054359675,0.000029598239,0.000004917069,0.00005325381,0.00022645717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941864,0.0002700326,0.0010515027,0.0022296675,0.0011525543,0.001109847],"domain_scores_gemma":[0.9953653,0.0014473727,0.0006285275,0.0020496019,0.00031272566,0.00019646714],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0038177138,0.0007432942,0.0010385878,0.0011585004,0.0002237737,0.001062305,0.005210824,0.000462927,0.000011668087],"category_scores_gemma":[0.00041986004,0.00067076634,0.00013359862,0.0011272869,0.000514922,0.0010264561,0.0015967487,0.0012443372,0.00004779891],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014122022,0.00006683331,0.01703064,0.00019880451,0.000025833442,0.00023676959,0.002676759,0.08780049,0.000059026243,0.036327142,0.000022639259,0.85554093],"study_design_scores_gemma":[0.00093068246,0.00043562878,0.02633857,0.0021512203,0.000009306045,0.00020461221,0.0000010577048,0.68891436,0.00036183276,0.27409932,0.0037236596,0.0028297715],"about_ca_topic_score_codex":0.0004596484,"about_ca_topic_score_gemma":0.00033862097,"teacher_disagreement_score":0.8527112,"about_ca_system_score_codex":0.0003021581,"about_ca_system_score_gemma":0.00070081657,"threshold_uncertainty_score":0.99997467},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33914673,0.00004613063,0.66005945,0.00004377902,0.00041726127,0.00022008305,0.0000054872976,0.000034996363,0.000026088654],"genre_scores_gemma":[0.9130599,0.000019263169,0.08674563,0.00007891412,0.000049776147,0.0000029945259,0.000008761607,0.000013106656,0.00002169043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782926,0.00004749433,0.00040331835,0.0008351437,0.0006227514,0.00026205977],"domain_scores_gemma":[0.99851406,0.0002913565,0.00042416388,0.00055184326,0.00015689971,0.0000616538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044966658,0.00032459054,0.00046709244,0.0015789225,0.00020053754,0.0002301719,0.0009613008,0.00045101944,0.00000852241],"category_scores_gemma":[0.00002700356,0.00022370464,0.0001337739,0.001564917,0.00017495936,0.0004847423,0.0005953245,0.00081788556,3.138626e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019143716,0.00008537908,0.07227026,0.00007963365,0.000051961633,0.0000057106154,0.0027680951,0.01457636,0.16360672,0.00018575329,0.0000058822648,0.7463451],"study_design_scores_gemma":[0.000190617,0.0000846293,0.056513514,0.00051435316,0.00009319866,0.000005640062,0.0000012643369,0.7846986,0.1517105,0.005713939,0.000026527388,0.00044724802],"about_ca_topic_score_codex":0.00012904085,"about_ca_topic_score_gemma":0.0020353624,"teacher_disagreement_score":0.77012223,"about_ca_system_score_codex":0.00014274048,"about_ca_system_score_gemma":0.00019793831,"threshold_uncertainty_score":0.91224104},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016526639,0.0017084817,0.9943184,0.00010878667,0.001272385,0.00031999656,0.000007529927,0.0019891388,0.000109964276],"genre_scores_gemma":[0.37474182,0.000027620601,0.6242001,0.00039093112,0.00054488296,0.000007704754,0.000007489814,0.000025016885,0.000054452845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963906,0.00005067556,0.0005934392,0.0013945338,0.00085929723,0.0007114559],"domain_scores_gemma":[0.99664783,0.0008739816,0.00045569788,0.0014234291,0.00036851846,0.00023053143],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011577622,0.0005536687,0.000668669,0.001389742,0.0003448515,0.00062296935,0.0022559257,0.0003419496,0.000013964938],"category_scores_gemma":[0.000373364,0.0005252962,0.00022199521,0.0014866951,0.00050129875,0.00062277965,0.0009645324,0.00067097787,0.000020634152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.782969e-7,0.000086543216,0.0035163462,0.000025070603,0.00005141856,0.00003245336,0.0006870477,0.035455238,0.00051833864,0.0014239866,0.000060078764,0.958143],"study_design_scores_gemma":[0.00013635837,0.00007339864,0.00042473222,0.00014583493,0.00008888514,0.00005260383,1.8825105e-8,0.99054176,0.0012421826,0.0062714536,0.00038098014,0.000641818],"about_ca_topic_score_codex":0.00010203603,"about_ca_topic_score_gemma":0.00007143486,"teacher_disagreement_score":0.9575012,"about_ca_system_score_codex":0.00049518066,"about_ca_system_score_gemma":0.0004707281,"threshold_uncertainty_score":0.99971986},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006183788,0.00026239577,0.988638,0.0011529465,0.0012059913,0.0007617448,0.0000068443546,0.0003423799,0.007567852],"genre_scores_gemma":[0.15482466,0.000016941158,0.8412031,0.0028704042,0.0003233503,0.000049524893,0.0000036227984,0.000056194043,0.0006521997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958053,0.000083621104,0.00053341984,0.0017425115,0.001027666,0.0008074361],"domain_scores_gemma":[0.9972839,0.00031176562,0.00020326815,0.0014366863,0.00046672975,0.00029764566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001283367,0.0005943936,0.0006886134,0.001242889,0.00032430905,0.0007973392,0.0036493305,0.00026044974,0.000056631332],"category_scores_gemma":[0.000043113218,0.00054761226,0.00013987022,0.0009986046,0.0003507662,0.00049896707,0.0014766185,0.0007129304,0.000053374966],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002785289,0.00006423387,0.000113584945,0.00015619214,0.00004159439,0.00031215095,0.013723219,0.008052638,0.0013685653,0.044349317,0.00038620178,0.9314045],"study_design_scores_gemma":[0.0017657441,0.0019622399,0.00029977446,0.005140343,0.000027873759,0.00022563025,0.0000059839067,0.6506787,0.09299369,0.16175944,0.07959703,0.005543533],"about_ca_topic_score_codex":0.00011569687,"about_ca_topic_score_gemma":0.000047411195,"teacher_disagreement_score":0.92586094,"about_ca_system_score_codex":0.00045376972,"about_ca_system_score_gemma":0.00089078146,"threshold_uncertainty_score":0.99969757},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028379813,0.00047670497,0.99520844,0.00000898902,0.00037763178,0.00021644402,0.0000055814794,0.0000529369,0.00081530656],"genre_scores_gemma":[0.03894484,0.00008638138,0.96079534,0.000037494396,0.000074290256,9.8141e-7,0.0000028005127,0.000014392651,0.000043503365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973214,0.00006241981,0.0005829314,0.001008742,0.0006699616,0.00035450788],"domain_scores_gemma":[0.9979247,0.00039679013,0.00043835794,0.0008881939,0.00023293555,0.00011905034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024805758,0.0003097347,0.00066569966,0.0017702708,0.0001400902,0.00027972585,0.0010215829,0.0002677509,0.000001917949],"category_scores_gemma":[0.00004623204,0.00029394188,0.000075339645,0.0012066826,0.0006119022,0.0004985097,0.0006343534,0.00031090973,0.0000010464299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041077733,0.000006286332,0.000039144823,0.000043541633,0.000049921455,0.000007929189,0.00073214056,0.8840743,0.00040065995,0.015524274,1.5278984e-7,0.09911758],"study_design_scores_gemma":[0.00006883319,0.00004652775,0.000050651044,0.00016772718,0.00008137892,0.000028126948,1.8562841e-7,0.9942168,0.0003904069,0.004656512,0.000009245389,0.0002836329],"about_ca_topic_score_codex":0.00013270459,"about_ca_topic_score_gemma":0.000006934432,"teacher_disagreement_score":0.110142514,"about_ca_system_score_codex":0.00013249203,"about_ca_system_score_gemma":0.0001377364,"threshold_uncertainty_score":0.99995124},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009503279,0.00070837414,0.98952174,0.0011119929,0.0011326622,0.00040551132,0.000007486602,0.00005755595,0.0061043254],"genre_scores_gemma":[0.88666975,0.0001031399,0.103581525,0.009089131,0.00027806588,0.000018970286,0.0000053488534,0.000057698446,0.00019639383],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630654,0.000102612656,0.00062289205,0.0011407137,0.0012039577,0.00062328257],"domain_scores_gemma":[0.99646676,0.0006552756,0.000269911,0.0024063291,0.00011717538,0.000084528336],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018062054,0.00044695535,0.0005339693,0.00070706476,0.00012493864,0.00026142763,0.007998153,0.00026527958,0.000020007192],"category_scores_gemma":[0.00010603985,0.00033104132,0.00015703557,0.0010371989,0.00074487703,0.0004728051,0.00063009036,0.00074015156,0.0000145488675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004129772,0.000120547316,0.00010968711,0.00008566694,0.000014206409,0.00016352786,0.0055702105,0.00430979,0.00030393197,0.19843411,0.00015654138,0.7907277],"study_design_scores_gemma":[0.0008602057,0.00023887225,0.001245555,0.000715544,0.000011501252,0.00018088911,0.0000015853674,0.0612101,0.0020642655,0.93096024,0.0016452696,0.0008659933],"about_ca_topic_score_codex":0.000020967303,"about_ca_topic_score_gemma":0.000054991997,"teacher_disagreement_score":0.88594025,"about_ca_system_score_codex":0.00011409391,"about_ca_system_score_gemma":0.00026464625,"threshold_uncertainty_score":0.99991417},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000078606194,0.00014656683,0.9331011,0.00008057637,0.00092617975,0.00010742267,0.0000060380007,0.00026405812,0.065289415],"genre_scores_gemma":[0.89400244,0.00027589247,0.09713949,0.00143637,0.0013127907,0.0000074470913,0.000017172324,0.00014497546,0.005663432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902993,0.0000034898467,0.00018387519,0.0003053389,0.00026895464,0.0002083911],"domain_scores_gemma":[0.99957234,0.000038458176,0.00003076755,0.00026280692,0.00003805019,0.000057584108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011669426,0.00019338458,0.0001634607,0.00029601986,0.00008096978,0.000061383216,0.00033127796,0.00014421227,0.00030499627],"category_scores_gemma":[0.000011500495,0.00019166696,0.00004500083,0.000113956565,0.00012016973,0.00011944798,0.000060929524,0.00034007672,0.00023746892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.7096634e-7,0.0000064100154,0.0000036438262,0.000061063256,0.0000057639704,0.000024240218,0.00024380599,0.21754123,0.00031627016,0.00720576,0.0002833685,0.77430785],"study_design_scores_gemma":[0.00013075181,0.000038970058,0.00007836449,0.00027475998,0.0000043073014,0.000021933794,3.1865817e-8,0.92816436,0.0008148028,0.035458677,0.034548968,0.00046405965],"about_ca_topic_score_codex":0.0000010322806,"about_ca_topic_score_gemma":0.000008394205,"teacher_disagreement_score":0.8939238,"about_ca_system_score_codex":0.00014784487,"about_ca_system_score_gemma":0.000009911581,"threshold_uncertainty_score":0.7815952},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010190367,0.00016828928,0.8677908,0.0010039248,0.0013239358,0.00021253034,8.8950867e-7,0.00018868009,0.12930076],"genre_scores_gemma":[0.003658696,0.000026079906,0.9885478,0.001288789,0.00093054003,0.000011710915,0.0000058965857,0.000019075553,0.005511394],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736243,0.0004808315,0.00032226933,0.0005692918,0.00071587804,0.0005493063],"domain_scores_gemma":[0.9978134,0.0011690989,0.00019242804,0.0005447555,0.00014153837,0.00013879706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008224119,0.00021798394,0.00033109565,0.0004237813,0.0009439217,0.00051139825,0.0013492416,0.00028260646,0.00013216864],"category_scores_gemma":[0.001740023,0.00020869693,0.00010113325,0.00041209869,0.0006995137,0.00033137758,0.00042351987,0.0011296364,0.000008756808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.4886474e-7,0.000035306028,0.000010256798,0.000035418736,0.000003863051,0.0000055432147,0.023278464,0.00006926789,0.000018117316,0.13314776,0.0010011641,0.8423944],"study_design_scores_gemma":[0.00005990444,0.000028223703,0.000007376465,0.00047867512,0.00001002728,0.000009965928,0.000011256,0.009004266,0.0004198445,0.8012147,0.18829896,0.00045680194],"about_ca_topic_score_codex":0.00020955596,"about_ca_topic_score_gemma":0.00039505598,"teacher_disagreement_score":0.8419376,"about_ca_system_score_codex":0.000628087,"about_ca_system_score_gemma":0.0029669798,"threshold_uncertainty_score":0.8510414},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028788767,0.00054891186,0.9955358,0.0013889449,0.0016210568,0.0004334961,0.000008587105,0.00020925356,0.00022516989],"genre_scores_gemma":[0.29731598,0.00012811934,0.6979866,0.0020439702,0.0020179816,0.000071265364,0.000028114371,0.000080635764,0.00032730988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968777,0.00004200258,0.00045371384,0.0016042149,0.00047426962,0.0005481337],"domain_scores_gemma":[0.9981158,0.00080071384,0.00024412325,0.00053968217,0.00014588222,0.00015379439],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005397566,0.0003848287,0.0004350263,0.0004339081,0.0002956078,0.0008592995,0.0018447562,0.0002665963,0.000002866656],"category_scores_gemma":[0.00039488994,0.00037763422,0.000086918764,0.0007963408,0.00065227045,0.0006877048,0.0013339642,0.00091026456,0.000015660115],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010109484,0.000009796701,0.000027282404,0.00004406549,0.000004181855,0.00003453516,0.0006223479,0.0200147,0.000060008046,0.001955294,0.000016114554,0.9772016],"study_design_scores_gemma":[0.000043236665,0.00045054607,0.000010280526,0.00008717984,0.0000041609774,0.00010273879,2.0363656e-7,0.7678774,0.0017232187,0.22691579,0.0024299196,0.0003553391],"about_ca_topic_score_codex":0.0000043223367,"about_ca_topic_score_gemma":0.000026146543,"teacher_disagreement_score":0.9768462,"about_ca_system_score_codex":0.0003110453,"about_ca_system_score_gemma":0.00061441277,"threshold_uncertainty_score":0.99986756},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021358408,0.0039120745,0.98655057,0.0008841959,0.0025925322,0.00048595,0.000047657268,0.00030179898,0.005011638],"genre_scores_gemma":[0.012763197,0.00012192078,0.9834297,0.0025675753,0.0007657963,0.000004022511,0.00014312819,0.000054294534,0.00015041525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928389,0.00016233996,0.0007726924,0.0033168346,0.0016303585,0.0012788355],"domain_scores_gemma":[0.9939785,0.00064262596,0.0004604803,0.0041869837,0.00028785312,0.0004435737],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0030854733,0.00083344907,0.00094654085,0.0006917246,0.0005022943,0.0016437556,0.010044868,0.0004965929,0.0000037738455],"category_scores_gemma":[0.0002309247,0.0007284978,0.00008338393,0.0014423016,0.0010455512,0.0014258815,0.010558011,0.00096604065,0.00002592076],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004052231,0.000041563046,0.00022307654,0.000076410055,0.000013648683,0.00024262637,0.001646071,0.0047764205,0.0000021173787,0.000649582,0.0075696795,0.98475474],"study_design_scores_gemma":[0.000469927,0.00019440932,0.00020493216,0.0003798982,0.000017404434,0.00030692673,8.4249444e-7,0.91901404,0.000008300721,0.06605999,0.012365427,0.0009779205],"about_ca_topic_score_codex":0.00005787865,"about_ca_topic_score_gemma":0.000093618095,"teacher_disagreement_score":0.9837768,"about_ca_system_score_codex":0.0003523992,"about_ca_system_score_gemma":0.0018243961,"threshold_uncertainty_score":0.9995166},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044821613,0.00033061573,0.9934412,0.00026828048,0.0006812051,0.00033391052,0.0000033184683,0.00022325106,0.00023605993],"genre_scores_gemma":[0.31842834,0.00014542803,0.6810953,0.00016573876,0.00006937937,0.0000144205205,0.000001759134,0.000020045678,0.0000596056],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970792,0.000080819846,0.00035181217,0.0014365774,0.0005515799,0.00050000387],"domain_scores_gemma":[0.9972707,0.001354352,0.00016394915,0.0010228681,0.00007552269,0.00011257521],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007893887,0.00040434164,0.0004856006,0.00061547646,0.00010249372,0.00025639567,0.0013446021,0.00025472548,0.000004461873],"category_scores_gemma":[0.00033472417,0.00040068428,0.00006192615,0.0005347747,0.0006524006,0.000766059,0.0007718595,0.0007862173,0.0000047574927],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005416227,0.000014871792,0.0006367913,0.000017196526,0.0000029575053,0.0001675094,0.0004990371,0.107991666,0.00025864976,0.002198659,7.348368e-7,0.8882065],"study_design_scores_gemma":[0.0006150624,0.00027767813,0.015788853,0.0007429938,0.000012583044,0.0003296042,6.001416e-7,0.34051535,0.006060724,0.63394725,0.000087472115,0.0016218438],"about_ca_topic_score_codex":0.00007736985,"about_ca_topic_score_gemma":0.00012531094,"teacher_disagreement_score":0.88658464,"about_ca_system_score_codex":0.00031255346,"about_ca_system_score_gemma":0.00020403172,"threshold_uncertainty_score":0.9998445},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014168254,0.00024511802,0.99280643,0.0012724971,0.00037070524,0.0004169844,0.000005424462,0.00022001598,0.0045211166],"genre_scores_gemma":[0.12365104,0.00018956976,0.8742513,0.0008703965,0.00023124492,0.0000089272025,0.000017155371,0.000044798435,0.0007355649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956826,0.00006561452,0.0008755488,0.0012663953,0.0013763253,0.0007335091],"domain_scores_gemma":[0.99713236,0.00038812982,0.0005739015,0.0013217033,0.00037258747,0.00021129011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014367071,0.00041455566,0.0005209435,0.0011857521,0.00030274276,0.00030512534,0.0032248783,0.00027223455,0.000024005329],"category_scores_gemma":[0.00017310145,0.00040496618,0.00014174943,0.0009581106,0.00070677284,0.00069595664,0.0013875109,0.00072648376,0.000018126453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000964701,0.00006043361,0.000041842613,0.0000905048,0.000017743583,0.0000799893,0.0030856093,0.6070144,0.00059594715,0.01873957,0.00015276548,0.37011153],"study_design_scores_gemma":[0.00030239235,0.0001599497,0.00001903113,0.0003258897,0.0000037992058,0.00008224543,3.5524027e-7,0.9902055,0.0014058748,0.0035314676,0.0035502655,0.00041317602],"about_ca_topic_score_codex":0.000016582628,"about_ca_topic_score_gemma":0.000011760543,"teacher_disagreement_score":0.3831911,"about_ca_system_score_codex":0.00019772485,"about_ca_system_score_gemma":0.0011604654,"threshold_uncertainty_score":0.9998402},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009780968,0.000309373,0.9953047,0.0002835467,0.0014587232,0.00036939204,0.0000034770903,0.0010657314,0.0011952922],"genre_scores_gemma":[0.0036552877,0.000015045795,0.9948416,0.00037771752,0.00038181554,0.000026499822,0.000011512249,0.000036432815,0.0006541258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996316,0.000044268094,0.00042866293,0.0014305087,0.0011776458,0.0006029159],"domain_scores_gemma":[0.9968425,0.00013969836,0.0002072846,0.00221739,0.00039352255,0.00019957687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012303242,0.00045880175,0.00044876023,0.00085301604,0.000110883084,0.0004637517,0.0049435794,0.00036434113,0.0000049658775],"category_scores_gemma":[0.00004138397,0.0004544044,0.00008688365,0.001192547,0.00034124564,0.00075587636,0.001353589,0.0007617232,0.000083622064],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017543344,0.00003109816,0.000019005725,0.000038825678,0.000006248704,0.00004141162,0.00067243434,0.048261743,0.00009292869,0.026804239,0.0019486245,0.9220817],"study_design_scores_gemma":[0.00013580827,0.000115990704,0.00006283934,0.00025275513,0.0000044322815,0.00004689957,8.860809e-9,0.83270293,0.0012094527,0.10480215,0.05998205,0.0006846572],"about_ca_topic_score_codex":0.000012404282,"about_ca_topic_score_gemma":0.0000064068095,"teacher_disagreement_score":0.92139703,"about_ca_system_score_codex":0.000995718,"about_ca_system_score_gemma":0.0016395793,"threshold_uncertainty_score":0.9997908},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.09501e-7,0.00050166534,0.990771,0.0009633013,0.00094114477,0.00037051976,0.0000018116143,0.00019587846,0.006253751],"genre_scores_gemma":[0.002940835,0.00023682175,0.993506,0.00046333135,0.00018751924,0.0000070306637,0.000003042992,0.000038027272,0.002617381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996389,0.00006713718,0.00059056777,0.0010193273,0.0012644372,0.0006695388],"domain_scores_gemma":[0.9971602,0.00052973226,0.00039449366,0.0013445171,0.0003052625,0.00026580444],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013870241,0.0004039899,0.00043328514,0.00049471855,0.0004901078,0.0007108674,0.0054285442,0.00023398847,0.000023757824],"category_scores_gemma":[0.00016859092,0.0003014252,0.00012752901,0.00068024,0.0007877776,0.00053959625,0.0017648312,0.0008971847,0.000039972776],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002334874,0.0000128359325,0.00000977801,0.000011663283,0.000009850635,0.000016200844,0.0006269933,0.030772738,0.000022847527,0.029721742,0.00008884966,0.9387042],"study_design_scores_gemma":[0.0002060324,0.0001875995,0.000052616902,0.00019732417,0.0000041922367,0.000023902912,2.4444174e-7,0.88854855,0.0001541932,0.10421575,0.006088164,0.00032142043],"about_ca_topic_score_codex":0.00006718778,"about_ca_topic_score_gemma":0.00002092513,"teacher_disagreement_score":0.93838274,"about_ca_system_score_codex":0.00011525901,"about_ca_system_score_gemma":0.0012515577,"threshold_uncertainty_score":0.99995255},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039135304,0.0028070377,0.56678385,0.01631791,0.0026752555,0.0007809679,0.000044367047,0.0001073093,0.41009197],"genre_scores_gemma":[0.93563706,0.003656509,0.050388258,0.0027125296,0.0032640211,0.000026942087,0.000008978672,0.000045571353,0.0042601065],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809456,0.00015894006,0.00024154747,0.00048664192,0.00068422244,0.00033406474],"domain_scores_gemma":[0.99620616,0.0028423823,0.00021978696,0.00027507695,0.00037075946,0.00008584264],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017857698,0.00016452775,0.0002809168,0.00022917535,0.0005795281,0.000121807054,0.0005475962,0.00018461763,0.000033813063],"category_scores_gemma":[0.0022389973,0.00013972529,0.000050117895,0.000444027,0.0037818714,0.00047916436,0.00037868993,0.00028740612,0.000007946602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027615713,0.000112636866,0.00028091582,0.000106754196,0.0000516319,0.000024341958,0.1812949,0.000056132125,0.000022118913,0.1362874,0.0010873075,0.6806482],"study_design_scores_gemma":[0.00028986397,0.00010439915,0.000156648,0.0005738696,0.00004283127,0.0000140164475,0.00009262797,0.00023384308,0.00005163612,0.7020048,0.29590616,0.00052930927],"about_ca_topic_score_codex":0.0004306723,"about_ca_topic_score_gemma":0.0040947995,"teacher_disagreement_score":0.93524575,"about_ca_system_score_codex":0.00024200989,"about_ca_system_score_gemma":0.0012751535,"threshold_uncertainty_score":0.99892926},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010082994,0.0015752903,0.9922666,0.00045178135,0.0035199434,0.00045554645,9.2170586e-7,0.00013620833,0.0014928696],"genre_scores_gemma":[0.0482855,0.000031186522,0.94943905,0.0010985729,0.0006771313,0.000019890727,0.0000071826,0.000025903268,0.00041556373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99367905,0.00028288178,0.0007834992,0.0026683568,0.0014934847,0.0010927372],"domain_scores_gemma":[0.99638575,0.001092607,0.00034977097,0.0014635475,0.00041424873,0.0002940748],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005010828,0.0005701085,0.0007620766,0.0015585078,0.00045549124,0.0014639751,0.0035355038,0.00039109171,0.000011704943],"category_scores_gemma":[0.0002977127,0.000511915,0.00011502168,0.0037541029,0.002102504,0.0012566264,0.0031255635,0.0011023147,0.0000205673],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021977896,0.000056719433,0.00075045397,0.00007738633,0.00000849544,0.00016297222,0.0017466117,0.007498151,0.0001536654,0.09000378,0.000052019634,0.89948756],"study_design_scores_gemma":[0.00043577832,0.00017405313,0.0025293673,0.00017955272,0.0000063567495,0.000327458,4.886275e-7,0.7043474,0.0006257085,0.28704107,0.0034696944,0.00086310314],"about_ca_topic_score_codex":0.00005272837,"about_ca_topic_score_gemma":0.00009567043,"teacher_disagreement_score":0.8986244,"about_ca_system_score_codex":0.00068644044,"about_ca_system_score_gemma":0.0033989917,"threshold_uncertainty_score":0.99973327},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014462693,0.0011069695,0.9964091,0.00033576338,0.00022370783,0.00018836193,0.000072462,0.00005814312,0.0014608403],"genre_scores_gemma":[0.009445207,0.00015819073,0.9872443,0.00030925206,0.00079527614,0.00006433081,0.00021123281,0.000029068553,0.0017431165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710953,0.00003100174,0.0003308174,0.0018562367,0.00027175358,0.00040064458],"domain_scores_gemma":[0.99692386,0.00057297584,0.00013603408,0.0021911075,0.000057785986,0.000118232914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081758294,0.00029667903,0.00032453972,0.0008224104,0.0002430041,0.0009865167,0.003765695,0.00015103644,0.0000014225471],"category_scores_gemma":[0.000053537828,0.0002691655,0.000018114577,0.0015598404,0.0008422177,0.0013628975,0.0049169944,0.00033566388,0.000004626711],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.0561397e-7,0.000030346728,0.00021683867,0.000020784535,0.0000026264534,0.0000028734403,0.000671152,0.000033572844,0.0000059843187,0.0019083259,0.0004289003,0.9966782],"study_design_scores_gemma":[0.00025085974,0.00007789227,0.0037502574,0.0003291721,0.000009639494,0.000047696445,0.0000013106604,0.94935185,0.000036283054,0.017427342,0.0281151,0.0006025894],"about_ca_topic_score_codex":0.00002446834,"about_ca_topic_score_gemma":0.00030589037,"teacher_disagreement_score":0.9960756,"about_ca_system_score_codex":0.000102435726,"about_ca_system_score_gemma":0.00049224735,"threshold_uncertainty_score":0.99997604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000077659424,0.0006269409,0.99368066,0.000284548,0.0017237633,0.00019045424,0.000048869348,0.00006261569,0.0033044643],"genre_scores_gemma":[0.5424796,0.00006805106,0.45340872,0.00049769547,0.00095355033,0.000016562972,0.00007644647,0.000020134867,0.0024792685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963235,0.00006020596,0.00059473753,0.0010960991,0.0012668291,0.0006585746],"domain_scores_gemma":[0.9965892,0.00034072003,0.0006198292,0.001940652,0.00034420687,0.00016539462],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013394139,0.00034933788,0.00075357134,0.0011103887,0.00039537126,0.00067427335,0.007215608,0.00026487227,0.00002056134],"category_scores_gemma":[0.00027469973,0.0002727927,0.00019381396,0.0011820879,0.002208324,0.0012208199,0.002767054,0.00053136924,0.000031662166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015277199,0.00020664585,0.0006143014,0.0002137459,0.00007463784,0.00012778018,0.00031945927,0.041230433,0.00005389508,0.2621927,0.00092293037,0.6940282],"study_design_scores_gemma":[0.00031294694,0.00033876227,0.0029718904,0.0002903333,0.000021569236,0.00008696708,1.8267875e-7,0.7289635,0.00014481739,0.26052606,0.0056714304,0.0006715096],"about_ca_topic_score_codex":0.00015932765,"about_ca_topic_score_gemma":0.00005118919,"teacher_disagreement_score":0.6933567,"about_ca_system_score_codex":0.00024355676,"about_ca_system_score_gemma":0.0008250092,"threshold_uncertainty_score":0.9999724},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088673025,0.000093492796,0.9032765,0.000023593291,0.0009199372,0.0002332456,0.000008595669,0.00004136901,0.0067302515],"genre_scores_gemma":[0.87323004,0.0000029287191,0.12635994,0.00008642475,0.00011408765,0.0000035754213,0.000007849102,0.000027955748,0.00016722258],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977337,0.0003666746,0.00044244292,0.0007503959,0.00043110733,0.00027567463],"domain_scores_gemma":[0.99777305,0.00041778627,0.00075266865,0.00066893577,0.00032595385,0.00006161523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028784508,0.0002776979,0.00053073006,0.0009543468,0.000109491666,0.000027104355,0.0007037457,0.00044843444,0.00010977619],"category_scores_gemma":[0.000113347225,0.00026410274,0.000056424335,0.0007880529,0.00077874196,0.00015604489,0.00012315983,0.0009376776,0.000009741351],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004118345,0.00048074048,0.0014113836,0.00015966089,0.00012665881,0.000024779898,0.027961418,0.045218855,0.007413416,0.16625154,0.000013998471,0.7505257],"study_design_scores_gemma":[0.0026621069,0.0070263473,0.009105606,0.0018842081,0.0001835323,0.0000818083,0.000027347387,0.44019395,0.056279104,0.47786567,0.0017150375,0.0029752858],"about_ca_topic_score_codex":0.0003952148,"about_ca_topic_score_gemma":0.000017613764,"teacher_disagreement_score":0.784557,"about_ca_system_score_codex":0.00010427903,"about_ca_system_score_gemma":0.0003018226,"threshold_uncertainty_score":0.9999811},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003899756,0.00061585516,0.99188876,0.00023525285,0.0028108733,0.00031857178,0.0000051639704,0.0010538899,0.003032647],"genre_scores_gemma":[0.010637436,0.000023738909,0.9874149,0.00067025784,0.00060446403,0.000008801318,0.000007881737,0.00006398485,0.0005685617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99523294,0.00007165896,0.0005915301,0.0021014044,0.0010412958,0.000961153],"domain_scores_gemma":[0.9955207,0.0011830447,0.00026865068,0.002507434,0.0003064778,0.00021370489],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011936801,0.0007427275,0.0007647366,0.0009916298,0.00026904696,0.00051494874,0.0045732604,0.0004092001,0.00001644067],"category_scores_gemma":[0.0002584469,0.00070873764,0.00014376156,0.0007397572,0.000820232,0.0011618378,0.0015320412,0.0011535062,0.000054363947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025393927,0.000021808273,0.000016461301,0.00002031703,0.0000054212933,0.00014616016,0.00015799298,0.66853344,0.00017213295,0.016859313,0.00005843116,0.31400594],"study_design_scores_gemma":[0.00025521626,0.0002660491,0.0004267036,0.00023594889,0.00000761046,0.00015111,1.0390738e-7,0.3538081,0.0018450822,0.63917434,0.0025743076,0.0012553988],"about_ca_topic_score_codex":0.000026191334,"about_ca_topic_score_gemma":0.00003829745,"teacher_disagreement_score":0.62231505,"about_ca_system_score_codex":0.0003896995,"about_ca_system_score_gemma":0.0003908632,"threshold_uncertainty_score":0.9995364},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016898237,0.0011626193,0.9946486,0.00081044395,0.0004212168,0.001315385,0.0000042128427,0.00073453464,0.0008860975],"genre_scores_gemma":[0.10410736,0.00037378265,0.8906207,0.0023282117,0.00063592516,0.00083804235,0.000022368082,0.000067339846,0.0010062536],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99616665,0.00003464851,0.00042140938,0.0019868468,0.00072734006,0.00066311704],"domain_scores_gemma":[0.9968008,0.00031355128,0.00022070722,0.0024263416,0.00013468403,0.00010391206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007458761,0.00045339932,0.00041648318,0.0006982307,0.000303602,0.00055025355,0.004274005,0.00029611276,0.0000038403164],"category_scores_gemma":[0.000040911378,0.00042158566,0.00007394103,0.0016044591,0.001222535,0.0004357145,0.00360636,0.00070665526,0.000018943769],"study_design_candidate":"design_other","study_design_consensus":null,"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.5066574e-7,0.00003810768,0.00003624781,0.000094827905,0.0000062228937,0.000025382029,0.00010792946,0.07455898,0.0000039087154,0.009519472,0.00008283529,0.91552526],"study_design_scores_gemma":[0.0003662043,0.00018570582,0.00019853436,0.0004065175,0.00001448131,0.000043079282,8.866791e-7,0.41199112,0.0005845314,0.558296,0.026911626,0.0010013038],"about_ca_topic_score_codex":0.000017839513,"about_ca_topic_score_gemma":0.00007717677,"teacher_disagreement_score":0.91452396,"about_ca_system_score_codex":0.0015820987,"about_ca_system_score_gemma":0.001786384,"threshold_uncertainty_score":0.9998236},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019931234,0.000007735666,0.9748575,0.000071846334,0.00084185286,0.00016926874,0.000002504334,0.0001823867,0.003935682],"genre_scores_gemma":[0.96386445,0.000010300263,0.035234462,0.0003309281,0.0003732518,0.0000063913726,0.000024793355,0.00003546337,0.00011994013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989368,0.000005253405,0.0002077819,0.0003281777,0.00032557885,0.00019642271],"domain_scores_gemma":[0.99949986,0.00004731496,0.00007918608,0.00025185914,0.0000825202,0.00003925626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014205731,0.00024152278,0.00017386787,0.00026445862,0.000102859165,0.00015482996,0.00024004528,0.00017614824,0.00015135975],"category_scores_gemma":[0.0000076740735,0.00020847333,0.000031957406,0.0001272392,0.00015035077,0.0006360011,0.000029262217,0.0006722431,0.00008070674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028809309,0.000026042573,0.00008014472,0.0001747444,0.000012942227,0.000010691782,0.0016234156,0.40636483,0.012613238,0.0016163082,0.000014591147,0.57743424],"study_design_scores_gemma":[0.00020620861,0.00019253716,0.000673509,0.00041517627,0.0000057734273,0.00001752645,1.7849477e-7,0.9852619,0.009453541,0.0006584251,0.0027776943,0.00033753025],"about_ca_topic_score_codex":0.0000015156145,"about_ca_topic_score_gemma":0.000037669153,"teacher_disagreement_score":0.94393325,"about_ca_system_score_codex":0.00014276752,"about_ca_system_score_gemma":0.000054914766,"threshold_uncertainty_score":0.8501296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011211144,0.0003502207,0.98150027,0.0019675556,0.0012576545,0.00061513716,0.0000130506405,0.00015503325,0.0029299427],"genre_scores_gemma":[0.88845694,0.000019404897,0.10841795,0.0026090457,0.00021947302,0.000010721962,0.000004474285,0.000034437777,0.00022755732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944152,0.00013926551,0.0012227207,0.0019253221,0.0014350342,0.0008624264],"domain_scores_gemma":[0.99635834,0.00058986206,0.0005789217,0.0018290371,0.0003946839,0.0002491664],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021024896,0.000662116,0.0011205425,0.0014147712,0.00018757243,0.00030832432,0.0055279452,0.00030066218,0.000033273427],"category_scores_gemma":[0.00016171696,0.0006253113,0.00021223389,0.0015794984,0.0003870287,0.0001465615,0.0035591004,0.0009794438,0.000026126452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038149796,0.00008496048,0.00020626295,0.0002055782,0.000030270636,0.00015075557,0.006899848,0.600983,0.00018833319,0.0032373145,0.00003118565,0.38794434],"study_design_scores_gemma":[0.0010681967,0.0002943195,0.0034923733,0.0016318165,0.000009397469,0.000030343112,0.0000030275294,0.98356545,0.000541016,0.0074789776,0.00075532374,0.0011297651],"about_ca_topic_score_codex":0.00088318414,"about_ca_topic_score_gemma":0.00093364954,"teacher_disagreement_score":0.8772458,"about_ca_system_score_codex":0.00053468806,"about_ca_system_score_gemma":0.00057490036,"threshold_uncertainty_score":0.9998526},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012465009,0.00091736234,0.45401594,0.006967012,0.0022573946,0.00045255886,0.000016540875,0.00047971052,0.5347688],"genre_scores_gemma":[0.92612064,0.0012117251,0.062496837,0.0016418764,0.0013047144,0.0000142285435,0.000024305133,0.000056133664,0.007129565],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794424,0.000025147012,0.00028141311,0.00056180975,0.0007323413,0.00045507896],"domain_scores_gemma":[0.9980077,0.0007164445,0.0001653421,0.0008156748,0.00014818544,0.00014662404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048604966,0.00022161282,0.00027730686,0.0005675797,0.00041263204,0.0004077263,0.0027158945,0.00045157084,0.00072530936],"category_scores_gemma":[0.00051333883,0.00021189448,0.00007080177,0.00044934367,0.0026872742,0.00040523705,0.0006496526,0.00069927314,0.00025695868],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010341874,0.000018000701,0.00015548756,0.0000031609009,0.0000033071137,0.000010998196,0.0028723574,0.00006449076,0.0000028146078,0.04252047,0.00008630268,0.9542616],"study_design_scores_gemma":[0.0004312704,0.000063899235,0.00024027392,0.00031115496,0.00001194043,0.000012571045,0.0000051586676,0.020622097,0.00015889305,0.57725984,0.39975443,0.001128451],"about_ca_topic_score_codex":0.000089699104,"about_ca_topic_score_gemma":0.0009126825,"teacher_disagreement_score":0.9531331,"about_ca_system_score_codex":0.00022019049,"about_ca_system_score_gemma":0.00035056492,"threshold_uncertainty_score":0.99013746},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016620394,0.0001282461,0.9810757,0.000043101976,0.00045168237,0.0014148041,0.000023109289,0.00004674369,0.00019620759],"genre_scores_gemma":[0.8377168,0.000007133416,0.161979,0.000049368115,0.00013698952,0.000037904803,0.0000029031632,0.000029991988,0.000039880633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641633,0.000039061386,0.00094216544,0.0013276369,0.0006139645,0.0006608391],"domain_scores_gemma":[0.9974064,0.0006873155,0.00051369716,0.0010056692,0.00026611594,0.00012078805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012692262,0.0004943698,0.00079574453,0.00084836216,0.00015311719,0.0003057729,0.0019701147,0.00018391218,0.000008086105],"category_scores_gemma":[0.0002358059,0.00043672285,0.00018609803,0.0005979456,0.00031108025,0.00051185413,0.0011312221,0.00047130007,0.0000014205642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001813215,0.00039381505,0.0105497055,0.00027041597,0.00006250264,0.002337039,0.019457404,0.023287328,0.000030440613,0.005278421,0.0000016409858,0.9383132],"study_design_scores_gemma":[0.0011079009,0.0022862698,0.0012165578,0.0014519743,0.0000866367,0.00075515016,0.00003518986,0.95575005,0.00054888945,0.035329454,0.00009254609,0.0013393532],"about_ca_topic_score_codex":0.00037376484,"about_ca_topic_score_gemma":0.0026528274,"teacher_disagreement_score":0.9369738,"about_ca_system_score_codex":0.00012523466,"about_ca_system_score_gemma":0.0003142487,"threshold_uncertainty_score":0.99980843},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038122103,0.00025339794,0.9952608,0.0005086456,0.0012319199,0.0019514271,0.000025669311,0.00033875296,0.000048167258],"genre_scores_gemma":[0.015579412,0.00009823338,0.9819494,0.00026573846,0.0017476091,0.00017473049,0.000033233762,0.00005503804,0.00009659006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959349,0.000032912965,0.00051123067,0.0016792377,0.001025155,0.00081658724],"domain_scores_gemma":[0.9972593,0.0005670792,0.00017261771,0.001161239,0.00060302677,0.00023671394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019553078,0.00048288127,0.0005219299,0.0010920913,0.0005378313,0.00074988586,0.0024508466,0.00065304484,0.0000017360368],"category_scores_gemma":[0.000121369754,0.00046395633,0.00011739735,0.0004396578,0.00060044846,0.001272339,0.00089077186,0.0009202315,0.0000013872191],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015993084,0.000024078829,0.0000035209962,0.000033215423,0.0000095640535,0.000011399918,0.0015615727,0.007151028,0.00036093043,0.043089744,0.00039458432,0.94734436],"study_design_scores_gemma":[0.0005496351,0.0009163896,0.000007770413,0.00015912874,0.000005431726,0.00005908281,1.07608955e-7,0.9170254,0.0047834227,0.045627497,0.030291814,0.0005743399],"about_ca_topic_score_codex":0.000042824744,"about_ca_topic_score_gemma":0.000041438343,"teacher_disagreement_score":0.94677,"about_ca_system_score_codex":0.00041342113,"about_ca_system_score_gemma":0.0007925145,"threshold_uncertainty_score":0.9997812},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009450692,0.00025683132,0.99235237,0.000989988,0.0007813359,0.0002941062,0.0000052126397,0.0002455879,0.005065103],"genre_scores_gemma":[0.0088920975,0.00004968361,0.98720413,0.0014439046,0.0008966095,0.00003628811,0.000013740656,0.000025462656,0.0014380884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972025,0.000011568678,0.00033766602,0.0012324383,0.00066553475,0.0005502814],"domain_scores_gemma":[0.9975408,0.00016464709,0.00012292307,0.0019596384,0.000084329964,0.00012770998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006063538,0.00033424524,0.0002843016,0.0007704542,0.00012709048,0.0007010251,0.0046655517,0.00014750937,0.000013796973],"category_scores_gemma":[0.000035122794,0.0003211312,0.00006878704,0.0011747618,0.00015250877,0.00070508616,0.0021654328,0.00046803456,0.00015282471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.1050535e-7,0.000029561183,0.00000766232,0.000031329884,0.0000058082896,0.00002218948,0.00010242345,0.09623055,0.000065674336,0.030700961,0.0014179102,0.8713855],"study_design_scores_gemma":[0.00011000132,0.000025789672,0.00007735794,0.000089162146,0.0000029671576,0.000014844109,1.46772186e-8,0.8419498,0.00014402145,0.0080795465,0.14913493,0.0003715333],"about_ca_topic_score_codex":0.0000052175587,"about_ca_topic_score_gemma":0.00002035422,"teacher_disagreement_score":0.871014,"about_ca_system_score_codex":0.00044851194,"about_ca_system_score_gemma":0.00070601085,"threshold_uncertainty_score":0.99992406},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012689028,0.0003004446,0.986689,0.0010522327,0.00081397366,0.00033447883,0.000021164135,0.000050345807,0.0094695045],"genre_scores_gemma":[0.83942807,0.00016088212,0.157367,0.0016900382,0.0001476443,0.000014710615,0.000003639886,0.000039053582,0.0011489582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727297,0.00014003874,0.000692502,0.0007365824,0.0007583158,0.00039956454],"domain_scores_gemma":[0.99234617,0.005279103,0.00055164634,0.0015412165,0.00020386775,0.00007802086],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018393758,0.00035712897,0.0005241949,0.00011407199,0.0004061355,0.00027914645,0.0025332249,0.00022227655,0.000037476566],"category_scores_gemma":[0.00043673528,0.00021691353,0.00015173294,0.00041298187,0.0032818476,0.0003144973,0.0011419052,0.00054904225,0.000023421748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061982464,0.00008292121,0.0016514997,0.0001136056,0.000073628566,0.0000349605,0.0025058587,0.0050160876,0.00003724179,0.79141176,0.00026964772,0.19874084],"study_design_scores_gemma":[0.0006019886,0.000037466853,0.00080404675,0.00022523505,0.000027499822,0.00014484512,6.5539894e-7,0.5116752,0.00019542495,0.48447007,0.0014957227,0.00032185524],"about_ca_topic_score_codex":0.000015433216,"about_ca_topic_score_gemma":0.00000886417,"teacher_disagreement_score":0.83815914,"about_ca_system_score_codex":0.000052506333,"about_ca_system_score_gemma":0.00029049558,"threshold_uncertainty_score":0.99943066},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080577994,0.002097478,0.99129957,0.00031811206,0.0012124488,0.0006151211,0.000010505412,0.00017189777,0.0034690676],"genre_scores_gemma":[0.73434556,0.0008339469,0.24821433,0.005975654,0.0026266193,0.0000810595,0.00007081647,0.00013757682,0.0077144126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960206,0.00014199948,0.00056409737,0.0015664282,0.0010083024,0.0006985338],"domain_scores_gemma":[0.99777997,0.00036448266,0.0002675573,0.0012647887,0.000086881795,0.00023634042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008746392,0.0005596459,0.0005326932,0.00074860005,0.00028415275,0.0006844549,0.002373913,0.0002904072,0.000051065646],"category_scores_gemma":[0.00006900411,0.00046409375,0.00011044544,0.00067846157,0.00043716904,0.00025969645,0.0009508607,0.0006512143,0.00005511204],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007738002,0.00005242801,0.00015182559,0.000108548884,0.000021684997,0.00012831167,0.003593999,0.014589477,0.000057766614,0.0042792545,0.00040511024,0.97660387],"study_design_scores_gemma":[0.0011229916,0.0005743123,0.004386464,0.00197564,0.000041893927,0.0004914336,0.0000034620105,0.78319603,0.004174346,0.14421377,0.056844972,0.0029746701],"about_ca_topic_score_codex":0.00009993832,"about_ca_topic_score_gemma":0.00009982341,"teacher_disagreement_score":0.9736292,"about_ca_system_score_codex":0.0003571642,"about_ca_system_score_gemma":0.0005164403,"threshold_uncertainty_score":0.9997811},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002858869,0.00018003954,0.9952002,0.00066721754,0.0014687295,0.00043856868,0.00001029075,0.00016143819,0.0015875848],"genre_scores_gemma":[0.038610235,0.00004466335,0.96040446,0.0003730589,0.00021354797,0.000017240827,0.000008433371,0.000046218345,0.0002821273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533343,0.000100465535,0.00081314874,0.0015728527,0.001505216,0.00067487964],"domain_scores_gemma":[0.99593055,0.001304684,0.00041512767,0.0018676665,0.00026125502,0.0002207232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007286563,0.00045602204,0.0005996617,0.0010530507,0.00023224857,0.00032427922,0.0028116445,0.0003020854,0.000052031854],"category_scores_gemma":[0.00026763455,0.00046063281,0.0001534375,0.0007846955,0.000818199,0.0008884198,0.0016344396,0.0011224748,0.000024497025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064667825,0.000039292165,0.000020723515,0.000065385626,0.000022074533,0.000096228534,0.0008742849,0.16849391,0.00084836944,0.0012244217,0.000012112645,0.8282967],"study_design_scores_gemma":[0.00028401692,0.000099099736,0.0001644526,0.0003773059,0.000006783099,0.000077159566,5.24834e-7,0.92206126,0.0016567917,0.0746761,0.00019305521,0.0004034753],"about_ca_topic_score_codex":0.000082394414,"about_ca_topic_score_gemma":0.000080845355,"teacher_disagreement_score":0.82789326,"about_ca_system_score_codex":0.0004660099,"about_ca_system_score_gemma":0.00040744952,"threshold_uncertainty_score":0.9997845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009165244,0.00015830447,0.99611706,0.00011758439,0.00068364566,0.000421302,0.0000027815643,0.000018807856,0.00156397],"genre_scores_gemma":[0.6770094,0.000012437014,0.32253113,0.00038471955,0.000033568518,0.000004016149,0.000001345772,0.000010659669,0.000012708003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713594,0.00014500329,0.0007127337,0.0006915396,0.0009961639,0.0003186192],"domain_scores_gemma":[0.9972982,0.0007472445,0.00046382,0.0012176842,0.00023302973,0.000040054318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002298433,0.00026452084,0.00039540787,0.00067755743,0.00006137477,0.0000716438,0.0028846387,0.00020975345,0.0000053140393],"category_scores_gemma":[0.00024497847,0.0002103948,0.00009442918,0.0010332506,0.00053859287,0.0004787854,0.00016949157,0.0004419667,0.0000029106402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028734185,0.000038781225,0.00005818511,0.00006256849,0.0000037153104,0.0000050682324,0.0028897752,0.6285298,0.00022444662,0.040413614,8.70382e-7,0.32777032],"study_design_scores_gemma":[0.00021286767,0.00013530045,0.00089694205,0.00026728926,0.0000052249993,0.000009094761,3.6908085e-7,0.8889503,0.0036577666,0.10547709,0.00014462198,0.000243173],"about_ca_topic_score_codex":0.000010453764,"about_ca_topic_score_gemma":0.000011550171,"teacher_disagreement_score":0.67609286,"about_ca_system_score_codex":0.00009748634,"about_ca_system_score_gemma":0.00018356898,"threshold_uncertainty_score":0.8579651},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042881517,0.00077724527,0.99288785,0.00077018916,0.002733437,0.00048317134,0.0000025757731,0.00012184975,0.0017948898],"genre_scores_gemma":[0.039992273,0.000034713525,0.9569362,0.0021548702,0.000643888,0.000017760765,0.000003529111,0.000021490945,0.00019531196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932373,0.0002009445,0.0007265636,0.0025763332,0.0017087106,0.0015501274],"domain_scores_gemma":[0.9961157,0.0014778211,0.0003312889,0.0012203616,0.00042848068,0.00042638427],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0073905056,0.0006032997,0.0006538763,0.0028262385,0.0006082534,0.001017975,0.0041201673,0.00030143917,0.000016721682],"category_scores_gemma":[0.00041622022,0.00056079915,0.00010056138,0.004987378,0.0036296865,0.0033936084,0.0041805804,0.0012036974,0.000040474093],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022326662,0.000042534717,0.0007693473,0.000030733707,0.0000035350356,0.000029295728,0.0018040147,0.0029133814,0.0004960419,0.011230415,0.000027225155,0.98265123],"study_design_scores_gemma":[0.00044834067,0.00014464959,0.014553057,0.00057573896,0.000007792084,0.00019886308,5.9646084e-7,0.81660795,0.0010692944,0.163738,0.0015786052,0.0010771069],"about_ca_topic_score_codex":0.000027095519,"about_ca_topic_score_gemma":0.00004645851,"teacher_disagreement_score":0.9815741,"about_ca_system_score_codex":0.00078012806,"about_ca_system_score_gemma":0.0030985817,"threshold_uncertainty_score":0.99968433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005575552,0.00018031972,0.9974945,0.00028171937,0.00059732754,0.00034163753,0.0000067834753,0.00019553912,0.000344612],"genre_scores_gemma":[0.106464066,0.00003721906,0.892411,0.0008179611,0.00009326173,0.000007155187,0.0000012547622,0.00003400998,0.0001341025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720544,0.00008284083,0.00036645468,0.0011273662,0.0007557991,0.00046209723],"domain_scores_gemma":[0.9924592,0.005041975,0.00023952554,0.0019709799,0.00020018917,0.00008816202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008203786,0.00046852787,0.000488324,0.00041230387,0.00018161678,0.00018347274,0.001874966,0.00020010902,0.000013693692],"category_scores_gemma":[0.0005449679,0.000293013,0.00008498359,0.000527558,0.0010980368,0.00045878702,0.00057947205,0.0007947861,0.000010813046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015612677,0.000012461557,0.0000033573497,0.000014117856,0.000007912474,0.0011646599,0.0004072325,0.5920876,0.000051890012,0.046878293,0.000011446266,0.3593454],"study_design_scores_gemma":[0.0005791059,0.001278176,0.00011483429,0.0017643021,0.000021755875,0.0042045237,7.009709e-7,0.2012863,0.0063744113,0.78157914,0.0012430381,0.0015536988],"about_ca_topic_score_codex":0.000018859413,"about_ca_topic_score_gemma":0.000021480215,"teacher_disagreement_score":0.73470086,"about_ca_system_score_codex":0.000121658646,"about_ca_system_score_gemma":0.00020258865,"threshold_uncertainty_score":0.9999522},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013437516,0.00013103896,0.9947237,0.0015898495,0.0015032393,0.00075592153,0.00009043438,0.00018519489,0.00088626647],"genre_scores_gemma":[0.015574199,0.000019580883,0.9798584,0.0030730912,0.00062835345,0.0000959547,0.00012397286,0.000053663658,0.00057277083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623305,0.00003257484,0.00057847146,0.0017561442,0.0006901041,0.00070963986],"domain_scores_gemma":[0.9972416,0.00039709726,0.00034766996,0.001449566,0.0003878393,0.00017621116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070916134,0.0005212175,0.00047232988,0.00050121924,0.00042721708,0.0008280846,0.0028033238,0.000357191,0.00001650223],"category_scores_gemma":[0.00006979797,0.0005091581,0.00014279256,0.0005500585,0.00040088026,0.0006225271,0.0007861682,0.0004912558,0.00002338603],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044089434,0.000047835572,0.00002005468,0.000041464715,0.000019246834,0.000019259685,0.0005542451,0.0034277805,0.00065619434,0.0048363823,0.00041071084,0.9899624],"study_design_scores_gemma":[0.0005388414,0.00021686779,0.00008625733,0.0002962631,0.000022319533,0.0000797897,2.7912427e-7,0.96433604,0.0008695157,0.025532207,0.007266605,0.0007550007],"about_ca_topic_score_codex":0.000018754652,"about_ca_topic_score_gemma":0.00009405538,"teacher_disagreement_score":0.9892074,"about_ca_system_score_codex":0.00022212017,"about_ca_system_score_gemma":0.0005184613,"threshold_uncertainty_score":0.999736},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015378228,0.00053672673,0.994691,0.0010953378,0.0019086472,0.00026306647,0.0000046955383,0.00020804013,0.0011386741],"genre_scores_gemma":[0.08108317,0.000014942446,0.91550225,0.0008186391,0.00058858196,0.000036016943,0.000026248044,0.000044651388,0.0018854955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99502546,0.0001250156,0.0008429595,0.0019857902,0.00089091435,0.0011298467],"domain_scores_gemma":[0.9971321,0.00070294604,0.00031243166,0.0014752559,0.00015336122,0.00022389753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014897708,0.0006249834,0.00062868174,0.0022939446,0.000300169,0.00083592575,0.004866583,0.00047614248,0.00004839235],"category_scores_gemma":[0.00009996988,0.0005818336,0.00013835196,0.0029420315,0.00059328467,0.000902059,0.0018675763,0.0015819041,0.0001616074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038108908,0.0000722482,0.00013685404,0.000031237603,0.0000037650289,0.00014689539,0.0021930907,0.12925456,0.000057260793,0.001254029,0.0001973256,0.8666489],"study_design_scores_gemma":[0.00008066523,0.00014920237,0.0004407634,0.00055323687,0.0000029283733,0.000037935362,5.431921e-7,0.918554,0.00041396453,0.07884297,0.00023551962,0.00068827916],"about_ca_topic_score_codex":0.00010044334,"about_ca_topic_score_gemma":0.0002570884,"teacher_disagreement_score":0.86596066,"about_ca_system_score_codex":0.00055996334,"about_ca_system_score_gemma":0.0010224357,"threshold_uncertainty_score":0.9996633},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047471112,0.00019777426,0.9962069,0.000095166964,0.0010755986,0.0015255723,0.000009912671,0.0007386465,0.000102996324],"genre_scores_gemma":[0.05310726,0.000013529163,0.9457395,0.000649122,0.00026606463,0.000065613436,0.0000063450257,0.00007605556,0.00007653022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944424,0.00006127909,0.001201768,0.0018151836,0.0015300635,0.0009492944],"domain_scores_gemma":[0.9954463,0.0006612225,0.0006710098,0.0023791308,0.0005779541,0.0002643878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019443672,0.0009285396,0.0014447321,0.0019497279,0.00010954554,0.00028098273,0.004780406,0.0006576882,0.000012141397],"category_scores_gemma":[0.000022999517,0.00087461143,0.0003639456,0.000648252,0.00064564263,0.0005657406,0.0010450298,0.0010962064,0.000013099103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032051696,0.00007818415,0.000017074664,0.00004155545,0.00001366517,0.00008900316,0.00017797928,0.5454857,0.0003229114,0.014237408,0.00000815946,0.4394963],"study_design_scores_gemma":[0.0010357094,0.0003242685,0.000051456922,0.00046094166,0.000026817124,0.000032105057,4.5306656e-9,0.9838788,0.0032283345,0.00989133,0.00024401346,0.000826223],"about_ca_topic_score_codex":0.000009269302,"about_ca_topic_score_gemma":0.0000051365255,"teacher_disagreement_score":0.4386701,"about_ca_system_score_codex":0.00041910293,"about_ca_system_score_gemma":0.000835943,"threshold_uncertainty_score":0.99937046},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000436554,0.0010005939,0.9924401,0.00006616483,0.004697694,0.00074164185,0.0000337135,0.00075136055,0.00026435425],"genre_scores_gemma":[0.009503466,0.000042220847,0.9896918,0.00008617485,0.00037179576,0.000045814013,0.000016061329,0.00005434543,0.00018832505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617153,0.000039352002,0.00060621713,0.0016744187,0.00064228236,0.00086617045],"domain_scores_gemma":[0.9957537,0.0017150588,0.00032823326,0.0016067041,0.00042424415,0.0001720445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012205633,0.0006244242,0.00073189096,0.000651051,0.00023520624,0.00028747067,0.003159581,0.0003863631,0.000002366245],"category_scores_gemma":[0.0004094981,0.00058788614,0.00016613949,0.0005533395,0.00040764545,0.0005999987,0.0009750323,0.0006885574,0.000011573632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005567635,0.000009042191,0.000001959298,0.00005663979,0.000010848803,0.00002055526,0.00022798277,0.86033505,0.000017835686,0.08757098,0.000007787508,0.051735755],"study_design_scores_gemma":[0.0001685832,0.00011470278,0.0000024204476,0.00024780666,0.0000069585913,0.000029938376,9.8454855e-8,0.7114132,0.00037607597,0.28541332,0.001692543,0.00053436356],"about_ca_topic_score_codex":0.000015863525,"about_ca_topic_score_gemma":0.000003756484,"teacher_disagreement_score":0.19784233,"about_ca_system_score_codex":0.0004162714,"about_ca_system_score_gemma":0.00030858626,"threshold_uncertainty_score":0.9996573},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005501431,0.0018088324,0.9953685,0.00003830746,0.00095853454,0.0006926398,0.000002528887,0.00009326675,0.00048724306],"genre_scores_gemma":[0.40631825,0.00004775626,0.593365,0.00004780407,0.00004720526,0.000018550183,4.3888977e-7,0.000018824298,0.00013616553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971056,0.00006005311,0.0006860714,0.0011120315,0.00062763,0.00040863844],"domain_scores_gemma":[0.9977471,0.000086065906,0.0004958229,0.0012390855,0.00032199355,0.00010988258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014750748,0.0003947493,0.00052960566,0.0004883683,0.00013856251,0.00021800872,0.0021574798,0.00025484306,8.726581e-7],"category_scores_gemma":[0.00018576872,0.0003275081,0.00006521702,0.00027169366,0.0009861524,0.0005478695,0.0010744561,0.0004471581,0.000004620456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015895743,0.00008297715,0.000059913993,0.0015129307,0.000023712631,0.000013883409,0.007260352,0.3741222,0.0058476743,0.28205487,0.0000014949794,0.32900408],"study_design_scores_gemma":[0.00011924582,0.0000741329,0.00003281948,0.0010430882,0.00000793445,0.000048140053,2.501551e-7,0.96261466,0.002954897,0.032736473,0.00001704678,0.00035132948],"about_ca_topic_score_codex":0.000041975367,"about_ca_topic_score_gemma":0.000010407576,"teacher_disagreement_score":0.58849245,"about_ca_system_score_codex":0.00022612096,"about_ca_system_score_gemma":0.00036889839,"threshold_uncertainty_score":0.9999177},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011528507,0.0012318179,0.9947802,0.00046007967,0.00050046796,0.0013873331,0.000039010112,0.00012537773,0.0014641784],"genre_scores_gemma":[0.029438453,0.000060401293,0.96700037,0.0013188455,0.00039050507,0.00023208595,0.00003690968,0.000037547445,0.0014848879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664295,0.000014991476,0.00056774885,0.0017578366,0.0004884883,0.00052799686],"domain_scores_gemma":[0.9969489,0.00030669355,0.0003230181,0.0017930756,0.0004400065,0.0001883243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012555275,0.00037320887,0.00043514272,0.00036831587,0.00035586613,0.00045383483,0.0015658134,0.0003104873,0.000002750062],"category_scores_gemma":[0.000070809205,0.00034783946,0.0000992284,0.000433011,0.0005131262,0.00034343355,0.00048551767,0.00035668293,0.000015255742],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044040207,0.00004348359,0.00006786672,0.00009463316,0.000012289507,0.0000054609936,0.00020666834,0.0016746996,0.00013637236,0.071113855,0.00008420904,0.92655605],"study_design_scores_gemma":[0.0006470285,0.000121303914,0.00029925405,0.00030070503,0.000015678614,0.00009583513,4.5424278e-7,0.8662304,0.0008088353,0.031005893,0.09968589,0.0007886816],"about_ca_topic_score_codex":0.0000250147,"about_ca_topic_score_gemma":0.000069220965,"teacher_disagreement_score":0.92576736,"about_ca_system_score_codex":0.00021387875,"about_ca_system_score_gemma":0.00027512107,"threshold_uncertainty_score":0.99989736},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003074428,0.0006690637,0.9940339,0.00012226793,0.002580219,0.0005327674,0.0000063014004,0.00051874894,0.0015337123],"genre_scores_gemma":[0.00976792,0.0001076457,0.9892837,0.00025577514,0.00025729663,0.000032972537,0.0000030933224,0.000050445957,0.00024118788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963848,0.000027554312,0.0005394837,0.0016875585,0.0005608126,0.00079978025],"domain_scores_gemma":[0.9958815,0.0015136941,0.00026262505,0.001631167,0.00056618574,0.00014484944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011056525,0.0006279679,0.0006292112,0.0007416082,0.0001788419,0.00029978278,0.0047030393,0.00037455343,0.000006444608],"category_scores_gemma":[0.0003091421,0.0005830685,0.00013122238,0.0007281366,0.0006215459,0.0009991152,0.0011952798,0.00062852394,0.000014777963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035127814,0.0000072222565,3.1207313e-7,0.000042606298,0.000004367828,0.000014349546,0.00020401717,0.54652673,0.000018916819,0.1774361,0.0000011915275,0.27574065],"study_design_scores_gemma":[0.0000512661,0.00007193271,0.0000027519884,0.00015577632,0.0000036256426,0.000024424871,8.240816e-8,0.352811,0.0007256419,0.64563644,0.000075635246,0.00044142964],"about_ca_topic_score_codex":0.00001173333,"about_ca_topic_score_gemma":0.000014717795,"teacher_disagreement_score":0.46820033,"about_ca_system_score_codex":0.00023134793,"about_ca_system_score_gemma":0.00055427675,"threshold_uncertainty_score":0.9996621},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002774419,0.00055043807,0.99182755,0.00007170263,0.001180045,0.00056779996,0.00001888292,0.00021988289,0.0027892813],"genre_scores_gemma":[0.9978581,0.00008406479,0.00080105604,0.000095260206,0.00091182505,0.00011800437,0.000028011185,0.00003459876,0.000069090966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877167,0.0000083066925,0.0002971167,0.0004406443,0.00027799906,0.00020424751],"domain_scores_gemma":[0.99951035,0.00009835615,0.00007482223,0.00019325783,0.00004629184,0.00007691758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017687591,0.00024304476,0.00023961208,0.000341335,0.000071184724,0.00013393332,0.00020831742,0.0002964231,0.000012911327],"category_scores_gemma":[0.00002330138,0.00023484498,0.000038361235,0.00020582422,0.0001224051,0.00011528773,0.00003374973,0.0003912974,0.000014256177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032082962,0.0000053994077,0.00004089882,0.000036267676,0.000005467965,0.0000020495943,0.0000971765,0.06574357,0.000052224386,0.000013647819,0.00003438671,0.9339657],"study_design_scores_gemma":[0.0004133575,0.000093053386,0.0000458794,0.0004184196,0.0000210091,0.000029983094,7.0423425e-7,0.9723251,0.0047510606,0.009721891,0.011576315,0.0006032435],"about_ca_topic_score_codex":0.00003228478,"about_ca_topic_score_gemma":0.0002248915,"teacher_disagreement_score":0.9950837,"about_ca_system_score_codex":0.00014529088,"about_ca_system_score_gemma":0.000033639782,"threshold_uncertainty_score":0.95767003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023374174,0.0038514384,0.98737985,0.0013334381,0.0019682595,0.00048182864,0.00004043673,0.0003118416,0.004399174],"genre_scores_gemma":[0.013891068,0.00022636636,0.9808996,0.003584768,0.0010606676,0.0000038987373,0.00010784823,0.000051934097,0.0001738809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99284893,0.00013777231,0.00082502316,0.0034599588,0.0013719574,0.0013563803],"domain_scores_gemma":[0.99417394,0.00074489374,0.00046290597,0.004108608,0.00016680827,0.00034281044],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0021328977,0.0008647681,0.0009196616,0.0007314023,0.0006275336,0.0016554852,0.009971104,0.00050403154,0.0000074044874],"category_scores_gemma":[0.00014234765,0.0007702482,0.00010064356,0.0013648774,0.0010089909,0.0015148635,0.009178725,0.0010264172,0.000027428472],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027679446,0.00004027056,0.00017662128,0.00005986785,0.000011673426,0.0001532999,0.0010742219,0.006220824,0.0000026449527,0.000599216,0.0025157013,0.9891429],"study_design_scores_gemma":[0.00042207795,0.0001472577,0.0004348276,0.00040726736,0.000017503116,0.00030948027,5.393779e-7,0.95889,0.0000137961915,0.022161387,0.016170213,0.0010256008],"about_ca_topic_score_codex":0.00004115858,"about_ca_topic_score_gemma":0.00012220876,"teacher_disagreement_score":0.9881173,"about_ca_system_score_codex":0.0003136737,"about_ca_system_score_gemma":0.0011391835,"threshold_uncertainty_score":0.9994748},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010145618,0.0006120179,0.9936817,0.0009906751,0.0017613113,0.00040539372,0.0000041160793,0.00019152544,0.0022517834],"genre_scores_gemma":[0.08239976,0.00022400633,0.9128965,0.0029975944,0.00076159096,0.000025348578,0.000007571865,0.00006002251,0.0006275602],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961953,0.000041721632,0.00053321494,0.0016712929,0.0008975054,0.0006609746],"domain_scores_gemma":[0.9977165,0.00030590553,0.0002460356,0.0013307479,0.00017939648,0.00022144013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010602678,0.0005673795,0.00058610237,0.0009192687,0.00030680696,0.00055401144,0.003015729,0.00024298367,0.000020153528],"category_scores_gemma":[0.000043417174,0.0005131816,0.0001584382,0.0005377355,0.0011223741,0.00036186495,0.002229749,0.0008391599,0.00002857614],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029255273,0.000024469822,0.00005118304,0.00008527209,0.00001730805,0.00003059881,0.00082615274,0.003095485,0.000036446534,0.11431808,0.000029307417,0.8814828],"study_design_scores_gemma":[0.00027254442,0.0002802204,0.000096577074,0.00048556778,0.000007831865,0.000071587696,9.8093665e-8,0.4788992,0.00017828208,0.509915,0.009156105,0.00063698797],"about_ca_topic_score_codex":0.000025838011,"about_ca_topic_score_gemma":0.00008940394,"teacher_disagreement_score":0.8808458,"about_ca_system_score_codex":0.00010003882,"about_ca_system_score_gemma":0.00013738399,"threshold_uncertainty_score":0.99973196},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017015351,0.000604141,0.9915009,0.0003423682,0.00087303703,0.00026763172,0.000007447263,0.00012351458,0.0061108177],"genre_scores_gemma":[0.15420902,0.000055763023,0.8442361,0.0010809085,0.00016077119,0.000010171135,0.000005471417,0.000035236728,0.00020654958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707544,0.000071454735,0.00051654375,0.0011265253,0.00072129886,0.0004887425],"domain_scores_gemma":[0.9972002,0.00041883547,0.00032343002,0.0016727847,0.00024250896,0.00014222211],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009364874,0.00041913372,0.00052972196,0.00093879714,0.00024247017,0.00022720321,0.003012218,0.00025441026,0.000027701748],"category_scores_gemma":[0.00004612257,0.00039871444,0.00022841121,0.00083405006,0.0010070782,0.00041137368,0.0007453681,0.00051110884,0.00001353355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009870208,0.00008782648,0.00005800411,0.000056929857,0.000034539975,0.00003827578,0.0006446263,0.0051936056,0.0018178156,0.61091393,0.00004933607,0.38109523],"study_design_scores_gemma":[0.00023265788,0.00027645825,0.00009239878,0.0005042677,0.000017976003,0.00008920255,1.13980235e-7,0.027890595,0.019334573,0.94823223,0.0026903183,0.00063921727],"about_ca_topic_score_codex":0.000004913211,"about_ca_topic_score_gemma":0.0000121184885,"teacher_disagreement_score":0.380456,"about_ca_system_score_codex":0.000098818295,"about_ca_system_score_gemma":0.00024061126,"threshold_uncertainty_score":0.99984646},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004540206,0.0011457116,0.981795,0.0007243264,0.002416208,0.00020689603,0.0000025574573,0.00028959764,0.013415161],"genre_scores_gemma":[0.32779416,0.00011873688,0.6653244,0.0035225751,0.0017316059,0.000013313838,0.000011495539,0.00008674356,0.001396974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576485,0.000037644564,0.00053303724,0.001696419,0.0011192396,0.00084882707],"domain_scores_gemma":[0.99690145,0.00021803718,0.00023978048,0.0018279143,0.00041975136,0.00039303608],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013109897,0.0005844966,0.00056500896,0.0005918927,0.00021157152,0.00075517845,0.004701215,0.00047937044,0.000026416297],"category_scores_gemma":[0.00007255015,0.0005368057,0.00012264933,0.00062532444,0.0006209596,0.0006212256,0.0016294932,0.0012214963,0.000112508875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028005238,0.000015110978,0.000009468567,0.0000095932355,0.000006661322,0.00008909624,0.00028155863,0.16639422,0.000007082474,0.063546166,0.0001846885,0.7694536],"study_design_scores_gemma":[0.00012469577,0.000105623934,0.00001026931,0.00019399097,0.0000041426797,0.000055748165,3.714098e-8,0.7178391,0.000028107992,0.2787829,0.0023375857,0.0005177747],"about_ca_topic_score_codex":0.000020847037,"about_ca_topic_score_gemma":0.000039876126,"teacher_disagreement_score":0.7689358,"about_ca_system_score_codex":0.00029796196,"about_ca_system_score_gemma":0.0010041769,"threshold_uncertainty_score":0.99970835},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000061205006,0.0002201998,0.9717587,0.00006659653,0.00088914944,0.0001238311,0.000009069613,0.0001745692,0.026696641],"genre_scores_gemma":[0.7812465,0.0009333301,0.21189767,0.00245833,0.0015630451,0.000007900883,0.000068120724,0.00029741062,0.0015276883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874365,0.0000047048607,0.00023237919,0.0004056762,0.00032586098,0.00028774576],"domain_scores_gemma":[0.9993845,0.00006955175,0.000029448154,0.0003967342,0.000045351462,0.000074377676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011385194,0.00025623516,0.0002273608,0.00031157982,0.00008666019,0.00006779368,0.00040180376,0.00021392068,0.0000895669],"category_scores_gemma":[0.000009835141,0.0002512874,0.000052986732,0.00018367259,0.00016126993,0.00008372416,0.00005123729,0.00034659842,0.00006592713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.2423264e-7,0.000001959218,0.0000015263024,0.000013548753,0.0000026517225,0.00001595814,0.00002898916,0.7938384,0.00005107495,0.0015074786,0.000024406627,0.20451319],"study_design_scores_gemma":[0.000083676554,0.000029991475,0.000011589357,0.00015283865,0.000004901299,0.000013514362,1.4036129e-8,0.94961447,0.0009049879,0.037444502,0.011399277,0.00034022742],"about_ca_topic_score_codex":0.000006811958,"about_ca_topic_score_gemma":0.00002209353,"teacher_disagreement_score":0.78118527,"about_ca_system_score_codex":0.00015341879,"about_ca_system_score_gemma":0.000034816083,"threshold_uncertainty_score":0.9999939},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015273904,0.000023737808,0.9789155,0.00022380608,0.0011819524,0.0004130836,0.0000057157044,0.00012298953,0.0038393175],"genre_scores_gemma":[0.8666047,0.0000058978485,0.13279702,0.00027200193,0.0000930721,0.000017514161,0.0000041334392,0.000022853359,0.00018282316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679345,0.00010109514,0.00066192367,0.0014214647,0.000536572,0.00048547014],"domain_scores_gemma":[0.9970136,0.00030320193,0.00055789616,0.001334949,0.00072021,0.00007009055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071199774,0.00048606622,0.0006072088,0.002254939,0.00016147712,0.00012779112,0.0028504988,0.00045137558,0.00009582507],"category_scores_gemma":[0.00010962284,0.0004716048,0.00009947033,0.0009683418,0.0013635478,0.002339307,0.0011025859,0.0016655657,0.00003275088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009511356,0.0005528881,0.0018595745,0.000050478324,0.000054963795,0.00018119415,0.072160505,0.005038584,0.0075429603,0.2949713,0.000025514884,0.6174669],"study_design_scores_gemma":[0.0010692992,0.0025599517,0.021623768,0.0018005372,0.000019554678,0.00021645175,0.00005256171,0.20528457,0.02392484,0.7407562,0.00039981832,0.0022924303],"about_ca_topic_score_codex":0.00009866838,"about_ca_topic_score_gemma":0.0014383859,"teacher_disagreement_score":0.85133076,"about_ca_system_score_codex":0.00058425067,"about_ca_system_score_gemma":0.00040515195,"threshold_uncertainty_score":0.99977356},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040143947,0.0020539556,0.9837288,0.00814006,0.00049260893,0.0006878727,0.000014415054,0.00031444393,0.00055341533],"genre_scores_gemma":[0.26924226,0.0004594776,0.72926223,0.0008439677,0.00006129626,0.000016040565,0.000028207818,0.00003003529,0.00005646969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960748,0.00018576528,0.000587876,0.0017814646,0.0007387188,0.0006313587],"domain_scores_gemma":[0.9900426,0.0014171932,0.0003418841,0.0078852195,0.0001965203,0.0001165752],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0019146188,0.000482993,0.0006217795,0.001106067,0.00023550192,0.0008622165,0.026789792,0.00046649558,0.000002601167],"category_scores_gemma":[0.0040281666,0.00049138506,0.000036806185,0.0014324717,0.0014739482,0.0014138654,0.12144816,0.0014229766,0.000009152692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026091915,0.00033273947,0.020029219,0.0009988324,0.000050079292,0.0002637083,0.0063585774,0.012329754,0.000110011235,0.010770228,0.032265164,0.9164656],"study_design_scores_gemma":[0.00029796208,0.000052464067,0.0024407795,0.00031553456,0.0000023920802,0.00004922204,3.854808e-7,0.5046477,0.000058770507,0.49128476,0.0004800188,0.00037004094],"about_ca_topic_score_codex":0.00008133809,"about_ca_topic_score_gemma":0.00020579287,"teacher_disagreement_score":0.91609555,"about_ca_system_score_codex":0.00048012572,"about_ca_system_score_gemma":0.0007988423,"threshold_uncertainty_score":0.9997538},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022496661,0.0001246844,0.9977372,0.000023613491,0.0005120687,0.00016874657,0.0000020303478,0.00030048276,0.0009061786],"genre_scores_gemma":[0.8750717,0.000019991277,0.12472322,0.00004175551,0.00007882654,0.000003053008,0.00002441709,0.000022584214,0.00001444216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895203,0.0000042192,0.00030374332,0.0002625214,0.0003104932,0.00016696408],"domain_scores_gemma":[0.999285,0.000048806087,0.000084867774,0.00037519704,0.00017759991,0.000028521348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026866025,0.00017810373,0.00017930655,0.00064999866,0.000046569774,0.000043274395,0.00037249058,0.00025767644,0.0000102999775],"category_scores_gemma":[0.000042285013,0.00017896306,0.000023816438,0.00036549522,0.000235008,0.00066961424,0.0000358564,0.00021415841,0.000008912881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014708766,0.0000030178771,0.0000050617546,0.000035495796,0.0000012866499,9.355699e-7,0.00022219517,0.65986025,0.00012031322,0.0027291253,0.0000014490182,0.3370194],"study_design_scores_gemma":[0.00006291624,0.000055099776,0.00004041758,0.00013213172,0.000004025205,0.0000021044345,6.9191145e-7,0.9183222,0.030787759,0.05035906,0.000053110023,0.00018050117],"about_ca_topic_score_codex":0.0000038421313,"about_ca_topic_score_gemma":0.00004587823,"teacher_disagreement_score":0.87484676,"about_ca_system_score_codex":0.00013985402,"about_ca_system_score_gemma":0.000056000463,"threshold_uncertainty_score":0.7297902},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045272772,0.00017518926,0.9954545,0.00033120005,0.0006188051,0.0012002243,0.0000041633934,0.0008992081,0.00086400093],"genre_scores_gemma":[0.4933533,0.000014477174,0.5056601,0.00054015155,0.0002049128,0.00010934882,0.0000012189422,0.00004995164,0.000066519606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959872,0.00007498174,0.0004557113,0.0016751585,0.001079083,0.00072786794],"domain_scores_gemma":[0.99609864,0.00037082742,0.00025619668,0.0027684732,0.0003099397,0.00019594819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010000896,0.0007428636,0.0005653557,0.000594223,0.0004138952,0.0006293016,0.0040165912,0.00028036596,0.000011188372],"category_scores_gemma":[0.000016570079,0.00049770146,0.00012638657,0.00080264086,0.00079224765,0.00054646865,0.0016165408,0.001299356,0.00002350682],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069396688,0.0001337959,0.00015630212,0.000024561627,0.000034407207,0.0057176505,0.004194644,0.006416338,0.0000023555574,0.07515382,0.00004189067,0.9081173],"study_design_scores_gemma":[0.0013800695,0.005731465,0.00054706185,0.0010495734,0.00014448825,0.018143784,0.0000026472128,0.77147967,0.00036675882,0.18359154,0.012959826,0.0046031433],"about_ca_topic_score_codex":0.00018500604,"about_ca_topic_score_gemma":0.0005740544,"teacher_disagreement_score":0.90351415,"about_ca_system_score_codex":0.00024111014,"about_ca_system_score_gemma":0.00037085215,"threshold_uncertainty_score":0.99974746},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036001205,0.000102273916,0.99135286,0.00038831128,0.0026372818,0.00045805273,0.0000038333014,0.00033872563,0.0046826596],"genre_scores_gemma":[0.0020984125,0.000041692136,0.99584,0.00096371013,0.00045975673,0.000024585883,0.000017314069,0.000024835439,0.00052968005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603355,0.000113223745,0.00058796874,0.0014058073,0.0011463985,0.00071305427],"domain_scores_gemma":[0.9970862,0.00024271439,0.00037186538,0.0019489089,0.00021100318,0.0001392946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018621337,0.00040857476,0.00037371853,0.00091150816,0.00024126077,0.0006547248,0.004685937,0.00025911714,0.000030344907],"category_scores_gemma":[0.000112837624,0.00039941288,0.00008939323,0.0017474857,0.00039572467,0.0013398639,0.0012879957,0.0006107451,0.0000973964],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000150932,0.000019780531,0.000042605803,0.00002360812,0.0000038661688,0.000023224797,0.0004663308,0.0033043977,0.000056271452,0.012141004,0.0002971708,0.9836202],"study_design_scores_gemma":[0.00036054463,0.00018621283,0.0006789988,0.0001514978,0.000006678968,0.00012271905,2.8681058e-7,0.8315805,0.0029091893,0.15146928,0.011820104,0.00071394915],"about_ca_topic_score_codex":0.00002633868,"about_ca_topic_score_gemma":0.000045990164,"teacher_disagreement_score":0.9829063,"about_ca_system_score_codex":0.00088080857,"about_ca_system_score_gemma":0.0013470228,"threshold_uncertainty_score":0.9998458},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021803828,0.00017142284,0.9948171,0.0019517435,0.00058960833,0.000739115,0.00004735832,0.00031854998,0.0013629217],"genre_scores_gemma":[0.03250258,0.000027679233,0.9622292,0.0041280403,0.0003272754,0.000092762304,0.000042869036,0.00004982277,0.0005997713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642575,0.000015674688,0.00047332863,0.0019529543,0.00057248614,0.00055979163],"domain_scores_gemma":[0.9953761,0.00068600534,0.00024623552,0.0032584954,0.00025590215,0.00017727836],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00069351745,0.0004439936,0.00041524245,0.00060315675,0.000385371,0.00044316894,0.00545389,0.00033360464,0.000013045132],"category_scores_gemma":[0.00013859067,0.00040760543,0.00013585284,0.00075744407,0.00050330564,0.00041817152,0.00094149116,0.00053268584,0.000022888482],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007686996,0.00018324336,0.000075395896,0.000061910585,0.000015213519,0.000026046717,0.00007703852,0.004279451,0.00033201216,0.111487344,0.0022911131,0.88116354],"study_design_scores_gemma":[0.00027594378,0.00026799043,0.000035505378,0.000058991805,0.000015034126,0.000046239093,5.2893725e-8,0.7124498,0.002367777,0.18095627,0.102759905,0.0007664934],"about_ca_topic_score_codex":0.000013110508,"about_ca_topic_score_gemma":0.000028598404,"teacher_disagreement_score":0.880397,"about_ca_system_score_codex":0.00017201857,"about_ca_system_score_gemma":0.00047591628,"threshold_uncertainty_score":0.9999271},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027707836,0.00011750599,0.9803775,0.00032285906,0.0020571882,0.0006932896,0.00010931183,0.00018297197,0.016136598],"genre_scores_gemma":[0.0559843,0.000023993063,0.94063383,0.0025124315,0.00038438122,0.000014768024,0.0002511878,0.00004063846,0.00015448222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952283,0.00007897991,0.0005088181,0.00229144,0.0012841721,0.000608301],"domain_scores_gemma":[0.9960822,0.00032607524,0.00032151118,0.0027896308,0.00028899536,0.0001916035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084910216,0.00057703984,0.0004800542,0.00055449485,0.0003992232,0.00056294387,0.0049527977,0.00036470767,0.000033681423],"category_scores_gemma":[0.00010443914,0.00049193547,0.00009268229,0.0014131241,0.00052241556,0.00060334156,0.0016663293,0.00048614127,0.000052456693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016670883,0.00009728509,0.00008144742,0.000011421832,0.000008100295,0.000050773477,0.00032413081,0.20401974,6.032147e-7,0.009862681,0.000096614174,0.78543055],"study_design_scores_gemma":[0.00040503743,0.0003698088,0.00043043555,0.00021056544,0.0000115121065,0.000015856891,1.213955e-7,0.9379262,0.000010700571,0.059560027,0.0005284566,0.00053130236],"about_ca_topic_score_codex":0.000050528044,"about_ca_topic_score_gemma":0.00005806492,"teacher_disagreement_score":0.78489923,"about_ca_system_score_codex":0.0007619192,"about_ca_system_score_gemma":0.0012331777,"threshold_uncertainty_score":0.99975324},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035133775,0.00021079702,0.9843767,0.000029428144,0.009827256,0.00032783966,0.000004055038,0.0003487869,0.004523761],"genre_scores_gemma":[0.8426676,0.000085989646,0.120269656,0.0017562556,0.030466635,0.000049022063,0.00006787674,0.00041943497,0.0042175646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755305,0.000052111704,0.0004888936,0.0007339187,0.0006582596,0.00051377906],"domain_scores_gemma":[0.99865407,0.00028959493,0.00011100501,0.00069800054,0.0001125762,0.00013476548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088527537,0.0004355761,0.00054696033,0.00067940704,0.00015121714,0.00031766677,0.00068464753,0.00060687854,0.000038462542],"category_scores_gemma":[0.000022904702,0.00038203894,0.00013299247,0.00046767897,0.00018235891,0.00019814505,0.00021795406,0.0008796251,0.0003336199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044624358,0.000006259071,0.000007326664,0.000072214985,0.0000069038597,0.000015835669,0.00008521125,0.41809377,0.00019725096,0.000032797918,0.011314362,0.5701636],"study_design_scores_gemma":[0.00030672443,0.00028008607,0.00006423814,0.0005670546,0.0000071606028,0.00006405314,3.9341707e-8,0.9170697,0.0009895725,0.002313081,0.077754885,0.00058342644],"about_ca_topic_score_codex":0.000013118916,"about_ca_topic_score_gemma":0.00003091078,"teacher_disagreement_score":0.8641071,"about_ca_system_score_codex":0.00044358082,"about_ca_system_score_gemma":0.00015784291,"threshold_uncertainty_score":0.99986315},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019993688,0.0008701809,0.99657166,0.001108611,0.00048311043,0.00059911545,0.000016068905,0.00005272111,0.00009857874],"genre_scores_gemma":[0.07557431,0.00024313643,0.9233695,0.0005590005,0.00013344231,0.000010180767,0.000019572497,0.000014794023,0.00007601316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735725,0.00015834304,0.00046296048,0.0008363183,0.0009547692,0.000230332],"domain_scores_gemma":[0.99754226,0.0013600683,0.0002935862,0.00051873235,0.00019834508,0.00008699317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083951786,0.00023183992,0.00033338767,0.0002747063,0.00012883346,0.00021268084,0.00085468113,0.00014847929,0.0000037701752],"category_scores_gemma":[0.00015678779,0.00017862351,0.000048540194,0.00030839886,0.0009943072,0.00047843938,0.0006720949,0.00030856553,0.0000019893716],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012335493,0.00003797982,0.00010634292,0.0002851123,0.000019951305,0.0000031335485,0.0017299157,0.042830776,0.000585971,0.03276362,0.0002973149,0.92132753],"study_design_scores_gemma":[0.00031745862,0.00013530802,0.00092594454,0.00023476571,0.000011436589,0.000027289683,0.0000010677876,0.7751007,0.0023145517,0.22068684,0.000023315912,0.00022131516],"about_ca_topic_score_codex":0.00001611575,"about_ca_topic_score_gemma":0.000011166211,"teacher_disagreement_score":0.9211062,"about_ca_system_score_codex":0.00011679562,"about_ca_system_score_gemma":0.0005735145,"threshold_uncertainty_score":0.72840554},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014473295,0.00066989363,0.9942433,0.0009262617,0.00091048284,0.00049945334,0.000004088007,0.00015692576,0.001142234],"genre_scores_gemma":[0.7018437,0.00010956684,0.2958058,0.00090475305,0.0007457357,0.000037181733,0.000015884725,0.000063618805,0.00047379022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951978,0.0000534321,0.0006443513,0.0014647846,0.0017048789,0.000934788],"domain_scores_gemma":[0.9950685,0.0028498196,0.00023678356,0.001388513,0.00030847208,0.00014790917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003237823,0.00048318482,0.00043802353,0.0007994503,0.00025978073,0.00066242716,0.004805679,0.00035502427,0.0000128633155],"category_scores_gemma":[0.00077468454,0.00037752246,0.00008720018,0.0013096278,0.0005262138,0.00057471293,0.0012805654,0.0016003463,0.000046598136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010012415,0.000029272043,0.0016129082,0.00007352628,0.00001309328,0.00009616122,0.0037503464,0.06293071,0.00025237992,0.0016972919,0.0001467698,0.9293875],"study_design_scores_gemma":[0.00041929242,0.00020436593,0.008725281,0.0007183769,0.0000049601495,0.000043657208,0.0000018114658,0.9538456,0.001182766,0.03106237,0.0027511548,0.0010403737],"about_ca_topic_score_codex":0.00036633192,"about_ca_topic_score_gemma":0.00029959416,"teacher_disagreement_score":0.9283472,"about_ca_system_score_codex":0.0004979536,"about_ca_system_score_gemma":0.00046359954,"threshold_uncertainty_score":0.9998677},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019158765,0.00006696265,0.9947503,0.0006916495,0.0016425258,0.0006019291,0.000034500095,0.00015641905,0.0001398434],"genre_scores_gemma":[0.373208,0.0000029849805,0.6260986,0.0004668982,0.000113344635,0.000011111736,0.0000062924923,0.000030820265,0.00006197857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958877,0.00006929216,0.00056205527,0.0017336304,0.0009048914,0.00084246247],"domain_scores_gemma":[0.99621415,0.0013270815,0.00011434385,0.0018615981,0.00021930331,0.0002635047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011164009,0.0004956632,0.00049202016,0.0016711665,0.00014139079,0.0004032321,0.0034016818,0.00024693477,0.00006378945],"category_scores_gemma":[0.00070099236,0.00048428617,0.000099571764,0.0013478884,0.00035415872,0.00061251735,0.00136593,0.001026505,0.000026942518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015522588,0.00006159118,0.00323797,0.00010285263,0.000010571103,0.0000726525,0.0026093798,0.61443424,0.00049028214,0.0038768265,0.000024958576,0.37506315],"study_design_scores_gemma":[0.00053608336,0.0002842047,0.0043812986,0.00084663194,0.0000054813927,0.000028183129,2.2980807e-7,0.82070726,0.00342528,0.1668506,0.001404393,0.0015303685],"about_ca_topic_score_codex":0.00025628912,"about_ca_topic_score_gemma":0.0004093324,"teacher_disagreement_score":0.37353277,"about_ca_system_score_codex":0.0010250051,"about_ca_system_score_gemma":0.0008887275,"threshold_uncertainty_score":0.99976087},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088696554,0.0020099662,0.9939511,0.0000452828,0.001011096,0.00025476588,0.000002748996,0.00013915257,0.0016989518],"genre_scores_gemma":[0.22746189,0.000043814678,0.7719078,0.00030172043,0.00014310173,0.000007907679,0.0000049469954,0.000025416437,0.000103393504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652123,0.00009170511,0.00056996243,0.0015805895,0.00047936483,0.00075711525],"domain_scores_gemma":[0.99717027,0.0014011003,0.00021943098,0.00088499463,0.00018911061,0.00013511509],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018176956,0.000502264,0.00054552895,0.0013131477,0.000245148,0.0005294351,0.0025295308,0.00039917615,0.000005898956],"category_scores_gemma":[0.0001112722,0.00044303839,0.00006562721,0.0015478961,0.00036401188,0.0005677767,0.0012336241,0.001290089,0.000015533953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000783739,0.000016338174,0.00012524276,0.000031605803,0.0000022756183,0.000046655874,0.0023453718,0.43769526,0.0000033635324,0.0007984341,0.00003153548,0.55889606],"study_design_scores_gemma":[0.00017800221,0.000074307434,0.00003871111,0.002421229,0.0000027765386,0.000032723445,3.2963666e-7,0.8252978,0.000027686701,0.17102645,0.0004749076,0.0004251244],"about_ca_topic_score_codex":0.00010663374,"about_ca_topic_score_gemma":0.00028008595,"teacher_disagreement_score":0.55847096,"about_ca_system_score_codex":0.00048714608,"about_ca_system_score_gemma":0.001362311,"threshold_uncertainty_score":0.9998021},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008625876,0.0015208124,0.9900922,0.001126284,0.0005667072,0.00020207647,0.0000021138192,0.00015334453,0.0063277953],"genre_scores_gemma":[0.19400328,0.00036270233,0.7981426,0.0022396862,0.0018844182,0.000046256155,0.000067907014,0.000072637136,0.003180514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979842,0.00004673351,0.00026565578,0.001028666,0.000394537,0.00028023578],"domain_scores_gemma":[0.99857414,0.0005909806,0.00017099672,0.0003658924,0.00014422524,0.0001537657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003322293,0.000272842,0.000269294,0.00031187947,0.00018828368,0.0003297823,0.0010758666,0.00011465634,0.000009201375],"category_scores_gemma":[0.000050275885,0.0002724869,0.000057175705,0.0007157916,0.00023506492,0.0003755161,0.0010004804,0.0007926125,0.000054287902],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017380979,0.00003258719,0.0000401655,0.000037497564,0.0000062823337,0.000010928387,0.00092975085,0.012366815,0.00014879188,0.045667086,0.0002254818,0.94053286],"study_design_scores_gemma":[0.000095656,0.000052556177,0.000108614964,0.00004908812,0.0000031469974,0.000025023322,4.2949463e-8,0.79332274,0.00006644028,0.14702038,0.059007097,0.0002492265],"about_ca_topic_score_codex":0.000012759999,"about_ca_topic_score_gemma":0.000017903023,"teacher_disagreement_score":0.94028366,"about_ca_system_score_codex":0.00029644617,"about_ca_system_score_gemma":0.0010780573,"threshold_uncertainty_score":0.99997276},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000104295126,0.00038948067,0.97689974,0.0003769951,0.0027415673,0.000254325,0.0000053493804,0.00031865752,0.018909575],"genre_scores_gemma":[0.2251122,0.0015586151,0.5222812,0.012125729,0.032748085,0.00013575781,0.00010190855,0.00045802942,0.20547843],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969951,0.00006879169,0.00025730152,0.0007680183,0.0010095862,0.0009011922],"domain_scores_gemma":[0.9982617,0.000724408,0.00009999986,0.0005181982,0.00015060657,0.00024508094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011406316,0.00030173178,0.00033490753,0.0005089673,0.00039610462,0.0002861102,0.0014180646,0.00039054177,0.00018212646],"category_scores_gemma":[0.00046912066,0.00030185762,0.000094298724,0.0010106872,0.0008372013,0.0002028393,0.00018080196,0.00062957767,0.00011329252],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008181903,0.00007575761,0.0036522113,0.00008296182,0.000019194082,0.00041622794,0.013075914,0.055173885,0.000015173339,0.0007797741,0.0127316825,0.91396904],"study_design_scores_gemma":[0.0010557096,0.00040995458,0.0016845822,0.002928183,0.000059471113,0.00010489174,0.000012095579,0.04691374,0.00028105653,0.20502326,0.73714876,0.0043782704],"about_ca_topic_score_codex":0.00042574582,"about_ca_topic_score_gemma":0.0010682658,"teacher_disagreement_score":0.9095908,"about_ca_system_score_codex":0.00079233095,"about_ca_system_score_gemma":0.0018856621,"threshold_uncertainty_score":0.9999434},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005791605,0.0002491162,0.9936015,0.00045125332,0.002620091,0.0004296768,0.0000049692258,0.0006522968,0.0019331817],"genre_scores_gemma":[0.123473346,0.000059939983,0.8719635,0.0033645236,0.0007161877,0.00001934312,0.000012539647,0.00007411963,0.00031650867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99522656,0.00004267142,0.0006885917,0.0019259099,0.0013671726,0.0007491222],"domain_scores_gemma":[0.9959623,0.0004877129,0.00039146523,0.0023718327,0.00051326153,0.00027341282],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001316299,0.0006669166,0.00061759126,0.0029023106,0.00036662997,0.0010916755,0.00560979,0.000645769,0.000051683695],"category_scores_gemma":[0.000107768916,0.0006479103,0.0002464694,0.0024264343,0.0006941399,0.0005306524,0.0017360048,0.0014637224,0.000039103652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003142651,0.00007269058,0.00024107094,0.000048606624,0.000009917974,0.000071906994,0.00021111465,0.0009638528,0.00014613298,0.25071815,0.00007294836,0.74744046],"study_design_scores_gemma":[0.00020603025,0.00019351413,0.00022009938,0.0001718475,0.0000057849775,0.000026743633,1.3006812e-8,0.76039165,0.0042164554,0.22343902,0.010363829,0.0007649836],"about_ca_topic_score_codex":0.00002787687,"about_ca_topic_score_gemma":0.000072612595,"teacher_disagreement_score":0.75942785,"about_ca_system_score_codex":0.0001814572,"about_ca_system_score_gemma":0.0008322814,"threshold_uncertainty_score":0.9999453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000105993924,0.000098669494,0.9914527,0.0006674832,0.002432544,0.0002712049,0.00000595264,0.00022868205,0.0047368035],"genre_scores_gemma":[0.075715885,0.00012179323,0.89770305,0.019475011,0.003724614,0.0001019142,0.00019429172,0.00012277089,0.0028406896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965613,0.00008811832,0.00043294756,0.001403774,0.0008865655,0.0006273305],"domain_scores_gemma":[0.99782574,0.00039481485,0.0002564589,0.0011123933,0.00023937882,0.00017123918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008256506,0.00041263973,0.00041086282,0.0007612896,0.00021262295,0.0005774681,0.0025688347,0.00036355542,0.000045192104],"category_scores_gemma":[0.00008963785,0.0003726609,0.00011918721,0.0007238766,0.0002891649,0.00072979525,0.00090812077,0.00073046057,0.000665881],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012676192,0.000020472507,0.000016305507,0.000035458,0.0000027749975,0.000022375441,0.00020858797,0.0008868712,0.00006792025,0.00002760712,0.0011038162,0.9976065],"study_design_scores_gemma":[0.0005484398,0.00028167985,0.00014644157,0.001598743,0.00001080252,0.00010166757,1.3136905e-7,0.730841,0.0055665486,0.24746047,0.012144286,0.0012997916],"about_ca_topic_score_codex":0.00001488193,"about_ca_topic_score_gemma":0.000044596578,"teacher_disagreement_score":0.9963068,"about_ca_system_score_codex":0.0002562084,"about_ca_system_score_gemma":0.0005518142,"threshold_uncertainty_score":0.9998725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19366986,0.010896524,0.77476525,0.00049954734,0.0017120385,0.0006743778,0.000009037499,0.00015792885,0.017615447],"genre_scores_gemma":[0.9985958,0.000036042184,0.0005658609,0.00018887546,0.00038329352,0.0000030590359,0.000004683276,0.0000071518016,0.00021525788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885,0.000006264976,0.00030048605,0.0005228588,0.0001499156,0.00017048998],"domain_scores_gemma":[0.9992789,0.00009423331,0.00028386843,0.00024166075,0.00009018452,0.000011165706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004650483,0.00016928937,0.000455708,0.00034402646,0.000047919908,0.00037175987,0.00034380544,0.00018975497,0.0000131727265],"category_scores_gemma":[0.00007447396,0.00013685957,0.00004082303,0.00032991043,0.00040172128,0.00022795866,0.0007822256,0.00024038796,0.0000033329177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021102074,0.00016057801,0.17767854,0.0073870947,0.00028899827,0.00021103192,0.00068608596,0.0067700194,0.00013809644,0.15712562,0.0016459489,0.6478869],"study_design_scores_gemma":[0.00038283528,0.00003556867,0.0034404788,0.0016799386,0.00008155872,0.000029116925,0.0000062790637,0.8679859,0.000060602124,0.1127452,0.012847086,0.00070545415],"about_ca_topic_score_codex":0.00094327296,"about_ca_topic_score_gemma":0.00023333097,"teacher_disagreement_score":0.86121583,"about_ca_system_score_codex":0.000045074088,"about_ca_system_score_gemma":0.000037768536,"threshold_uncertainty_score":0.5580971},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002253671,0.00015045468,0.98142344,0.0022879234,0.0033439226,0.00041078043,0.000008625428,0.00043945902,0.011912836],"genre_scores_gemma":[0.07816982,0.00006405713,0.8764222,0.040654264,0.0038547185,0.0000311951,0.00006538176,0.00007868819,0.0006596648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995391,0.00008342232,0.0007300765,0.0015031706,0.0014238517,0.00086847995],"domain_scores_gemma":[0.99714893,0.00028430184,0.00035320962,0.0015394764,0.0003044733,0.00036961876],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00081819406,0.0006195292,0.00065897324,0.00065772515,0.00031509626,0.0011733826,0.0056709666,0.00040408748,0.0000342974],"category_scores_gemma":[0.00006159194,0.0005876062,0.00020528627,0.0016219108,0.0005542701,0.0014802031,0.0028040505,0.0014547973,0.00042217135],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000933131,0.00009818389,0.000050069473,0.00021556536,0.00002660694,0.00024755823,0.013558247,0.010844042,0.00001079193,0.07144069,0.009403769,0.8940951],"study_design_scores_gemma":[0.000317982,0.00014721337,0.00007269538,0.00015416737,0.000004637262,0.0000702181,1.5056416e-7,0.85696954,0.00031270421,0.106173225,0.03499568,0.0007818197],"about_ca_topic_score_codex":0.000012677569,"about_ca_topic_score_gemma":0.000034772434,"teacher_disagreement_score":0.89331335,"about_ca_system_score_codex":0.00050784677,"about_ca_system_score_gemma":0.0018008557,"threshold_uncertainty_score":0.9998635},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001765319,0.00014047652,0.8651355,0.0007457734,0.008699356,0.00017009654,0.000006048547,0.00008510605,0.1248411],"genre_scores_gemma":[0.9238407,0.000022278253,0.047557,0.008234869,0.004917901,0.000017205166,0.000029302484,0.000104519306,0.015276203],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825925,0.000015537687,0.00026537885,0.00068216363,0.00042709787,0.000350603],"domain_scores_gemma":[0.99910307,0.00021606272,0.00014701745,0.0003525947,0.00009355287,0.00008772713],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00024584588,0.00024497547,0.00024533554,0.00044178823,0.00017813257,0.00010977828,0.0005385849,0.00031043,0.004370752],"category_scores_gemma":[0.0000404632,0.00024147522,0.00011412803,0.00017333913,0.00038930282,0.00009900066,0.00014144475,0.00072177337,0.00081147236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019040846,0.000063575375,0.00020309458,0.000013789924,0.00003134739,0.00017938124,0.0042201835,0.0070887012,0.00005831358,0.3365168,0.00023434857,0.6513714],"study_design_scores_gemma":[0.0011340507,0.00032388727,0.0063199303,0.001011291,0.00002528438,0.0002891257,0.0000036411038,0.0027996593,0.00022381157,0.96611965,0.020338146,0.0014115099],"about_ca_topic_score_codex":0.000045687175,"about_ca_topic_score_gemma":0.00004404899,"teacher_disagreement_score":0.9236642,"about_ca_system_score_codex":0.00038619412,"about_ca_system_score_gemma":0.00024653206,"threshold_uncertainty_score":0.9999665},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016949947,0.0028233319,0.97184825,0.00030547343,0.0019460983,0.00010703519,8.465853e-7,0.00009596792,0.021177998],"genre_scores_gemma":[0.08821354,0.0000706672,0.7996294,0.003927924,0.002424971,0.00002218618,0.000027534037,0.00011495113,0.10556882],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969952,0.00077380403,0.00026920694,0.0010973222,0.00031215814,0.0005522782],"domain_scores_gemma":[0.99785215,0.001295872,0.00019008505,0.00046082746,0.00013668077,0.00006438256],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0035425315,0.00030113262,0.00041630416,0.0002777893,0.0003276573,0.00018720227,0.00053231406,0.0003012492,0.00016067197],"category_scores_gemma":[0.0006981286,0.00028344282,0.000049175764,0.0006390589,0.00074515777,0.00007334332,0.00034768583,0.0029488297,0.000031146705],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006155535,0.000017491533,0.0013776573,0.000033623677,0.000016289743,0.00010957212,0.0069489726,0.003385576,0.00011289515,0.0011484178,0.00031300273,0.98653036],"study_design_scores_gemma":[0.0028413876,0.0017926998,0.08299045,0.0057469597,0.00010133189,0.0013053016,0.00004355961,0.08656729,0.001020913,0.09240944,0.71945614,0.0057245004],"about_ca_topic_score_codex":0.000025406724,"about_ca_topic_score_gemma":0.000008172027,"teacher_disagreement_score":0.9808059,"about_ca_system_score_codex":0.00014041898,"about_ca_system_score_gemma":0.00035465922,"threshold_uncertainty_score":0.9999618},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.7559377e-7,0.00010218386,0.95081717,0.0013742592,0.00022675261,0.04469342,0.000006091547,0.0002784315,0.0025012325],"genre_scores_gemma":[0.003248605,0.000015790913,0.9751307,0.0034893833,0.0005381734,0.015924603,0.000010121169,0.00007403801,0.0015685952],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99530196,0.00003796359,0.0006835045,0.0019557434,0.00085588626,0.0011649639],"domain_scores_gemma":[0.9964978,0.00048878184,0.0004056097,0.0021070384,0.00023771042,0.00026306766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000744766,0.0006409848,0.0006533262,0.0005523465,0.00031151474,0.000560285,0.0053541865,0.00035285376,0.00009176293],"category_scores_gemma":[0.00009054637,0.00060795277,0.000204748,0.0006152317,0.00039951756,0.0007817603,0.00081802,0.0009232984,0.00009562588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014043222,0.000026991554,0.0000029233584,0.000038509963,0.000005256033,0.0000046696628,0.00022203386,0.0029988356,0.000033113494,0.465669,0.000023940496,0.5309607],"study_design_scores_gemma":[0.0005309135,0.00037967958,0.000009199792,0.00029817567,0.0000045866154,0.000033176675,3.550352e-8,0.12921691,0.0006961125,0.8445759,0.023668123,0.00058723846],"about_ca_topic_score_codex":0.0000072243574,"about_ca_topic_score_gemma":0.000040081533,"teacher_disagreement_score":0.53037345,"about_ca_system_score_codex":0.0005370251,"about_ca_system_score_gemma":0.0017895385,"threshold_uncertainty_score":0.9996372},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006091629,0.0006026047,0.98871404,0.00010524333,0.00041041485,0.00020003114,0.0000045035213,0.00042153345,0.008932451],"genre_scores_gemma":[0.56343377,0.000026426917,0.43392143,0.00037363128,0.0010749584,0.000008955068,0.00001236345,0.00013531413,0.0010131905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974352,0.000009254867,0.00042896866,0.0010293239,0.0004795757,0.0006176423],"domain_scores_gemma":[0.9986305,0.00027253313,0.00016929305,0.00073402957,0.00009064466,0.00010296378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002471392,0.00049824466,0.000558521,0.00067703886,0.0001637958,0.00017183954,0.0012432707,0.00048334015,0.000012045654],"category_scores_gemma":[0.00020898583,0.00044119643,0.0001660056,0.00043676546,0.00036619074,0.0001231476,0.0006391828,0.0011859775,0.0000077364675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066777197,0.000023971108,0.00008778608,0.00007786226,0.0000143332945,0.000051209598,0.0000661427,0.8010424,0.020001374,0.0016734978,0.000028213974,0.17692652],"study_design_scores_gemma":[0.00021498445,0.000034624893,0.000022612989,0.0002588975,0.00002220297,0.000049635837,2.3235472e-7,0.9819009,0.0033620638,0.01294659,0.0006101938,0.0005770987],"about_ca_topic_score_codex":0.00006397693,"about_ca_topic_score_gemma":0.0000055500955,"teacher_disagreement_score":0.56282455,"about_ca_system_score_codex":0.00023934575,"about_ca_system_score_gemma":0.00011085866,"threshold_uncertainty_score":0.99980396},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012037055,0.0033931695,0.98680544,0.000047909467,0.0075122206,0.0009728602,0.000005777696,0.00017914642,0.00096309173],"genre_scores_gemma":[0.4612836,0.00015677603,0.53006756,0.00042501153,0.0022191491,0.000052734744,0.000008058182,0.00015751133,0.0056296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563485,0.000046800556,0.0007756956,0.0017105456,0.00089520676,0.0009368867],"domain_scores_gemma":[0.99773335,0.00022197269,0.00036093677,0.0010781989,0.0004105891,0.00019494779],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012412599,0.0006974326,0.00071847666,0.0008312231,0.0005436375,0.00091358734,0.0028612972,0.0003988363,0.000006468883],"category_scores_gemma":[0.00005999965,0.0006293413,0.00026688183,0.0003334764,0.0002029496,0.0005806792,0.0010139648,0.0008435256,0.000022453907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011789093,0.000021432477,0.000011660827,0.00010269787,0.000034036897,0.000028016164,0.002482385,0.7376864,0.00019034251,0.112786956,0.0000072055645,0.14663708],"study_design_scores_gemma":[0.00012920343,0.00014497405,0.0000019622978,0.0020842794,0.000012396159,0.00010805677,0.000002313158,0.9747951,0.0005782505,0.01882692,0.0025600283,0.00075651956],"about_ca_topic_score_codex":0.00024442567,"about_ca_topic_score_gemma":0.000033472905,"teacher_disagreement_score":0.46116322,"about_ca_system_score_codex":0.00066704006,"about_ca_system_score_gemma":0.0003980927,"threshold_uncertainty_score":0.9996158},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001741345,0.00030142374,0.9804094,0.011322988,0.0024627845,0.0017242538,0.000023279936,0.0010480478,0.00269043],"genre_scores_gemma":[0.009178254,0.000016308517,0.97615904,0.013002102,0.0007103038,0.00010999969,0.000012476659,0.00007030782,0.00074121816],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930924,0.000024165814,0.0008154394,0.0026421305,0.001639747,0.0017860846],"domain_scores_gemma":[0.99431336,0.001029876,0.00039602566,0.0032715339,0.0006122423,0.00037694772],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015271062,0.00091149594,0.00082053675,0.0037303898,0.0003796415,0.001467486,0.009895663,0.0008265032,0.000007767299],"category_scores_gemma":[0.0006276783,0.0008724757,0.00029835178,0.0026384364,0.000787444,0.00066469243,0.00324855,0.0011716584,0.00005030994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014315291,0.00003238357,0.00002128469,0.00006888918,0.00002123175,0.00009285797,0.0001421904,0.006770579,0.0000089698215,0.37716466,0.00020534827,0.6154573],"study_design_scores_gemma":[0.00069493585,0.00050149835,0.00014494207,0.0015302058,0.000022030546,0.000035161625,0.0000014421386,0.12134148,0.0016734729,0.8537555,0.018631356,0.0016680245],"about_ca_topic_score_codex":0.000034620505,"about_ca_topic_score_gemma":0.00012210433,"teacher_disagreement_score":0.61378926,"about_ca_system_score_codex":0.00094896974,"about_ca_system_score_gemma":0.0006412454,"threshold_uncertainty_score":0.99956906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007860135,0.00020146674,0.99482733,0.00016577356,0.0010811184,0.00060383946,0.0000060265497,0.0001715612,0.0021568697],"genre_scores_gemma":[0.1451075,0.000026808424,0.8542624,0.00013887922,0.00014601,0.000016320753,0.0000034830712,0.000043617198,0.00025495284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576664,0.00007254153,0.0007512377,0.0015398102,0.0010545162,0.0008152481],"domain_scores_gemma":[0.99703175,0.0003932947,0.0005725293,0.0015440639,0.00029632606,0.00016206155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015616377,0.0005901129,0.0005903408,0.0014620993,0.0002730691,0.00073686603,0.0023064888,0.0003098068,0.0000043843634],"category_scores_gemma":[0.00013377772,0.0005394542,0.0000803262,0.0012654493,0.0004773897,0.0013285897,0.0005737419,0.001163337,0.00001406221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088156485,0.000020829642,0.00004783909,0.000041468615,0.0000056114636,0.000109901135,0.0006245235,0.9451845,0.00014233198,0.01253377,0.000001345915,0.041279055],"study_design_scores_gemma":[0.00024616177,0.000095325646,0.00007546329,0.0007394354,0.0000061940814,0.00017570105,5.476717e-7,0.97689486,0.0003157215,0.020640468,0.00019199858,0.000618147],"about_ca_topic_score_codex":0.00021088058,"about_ca_topic_score_gemma":0.00034298736,"teacher_disagreement_score":0.14432149,"about_ca_system_score_codex":0.0008004372,"about_ca_system_score_gemma":0.00079813576,"threshold_uncertainty_score":0.9997057},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014513957,0.00049047987,0.99035084,0.0012626076,0.0011943987,0.0001957562,0.000004795309,0.0001850674,0.0061709383],"genre_scores_gemma":[0.34004042,0.000035385798,0.65725166,0.0015350076,0.0002738287,0.000006520103,0.000006575587,0.000038547285,0.00081206206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965607,0.000046235404,0.00051736255,0.0015123514,0.000729883,0.0006334528],"domain_scores_gemma":[0.9979312,0.00038538122,0.00024780986,0.00096689846,0.00021358178,0.00025517098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009327464,0.00049951515,0.00045369656,0.00050737493,0.00044231038,0.0009203205,0.0016671019,0.00037195842,0.000014462772],"category_scores_gemma":[0.00022597144,0.00047768725,0.0000735466,0.00045770252,0.0006700733,0.00067940826,0.00089438976,0.0011400166,0.000027887454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055438936,0.000049108316,0.001237319,0.00006475366,0.000026837206,0.000265597,0.0018854544,0.020745417,0.00011097438,0.36715245,0.00024536013,0.6082112],"study_design_scores_gemma":[0.000194177,0.000121758,0.00020201923,0.00037365223,0.000011318469,0.00016605578,1.8909869e-7,0.5808106,0.0000957573,0.4154393,0.0017852226,0.00079995685],"about_ca_topic_score_codex":0.000045509303,"about_ca_topic_score_gemma":0.000076949014,"teacher_disagreement_score":0.60741127,"about_ca_system_score_codex":0.00018365309,"about_ca_system_score_gemma":0.00045932212,"threshold_uncertainty_score":0.9997675},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014463734,0.0006046028,0.9586045,0.0010975429,0.0038971694,0.00032204247,0.0000055312153,0.00021017567,0.035243966],"genre_scores_gemma":[0.019577611,0.000093447874,0.9740867,0.003202776,0.0012447883,0.000017856364,0.000012221175,0.00004508602,0.001719537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953669,0.000055261346,0.00045178717,0.0019594752,0.0011669531,0.0009996317],"domain_scores_gemma":[0.99534935,0.00031661463,0.00041450615,0.0035091848,0.00018296402,0.00022740776],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010171679,0.0005856559,0.0006374775,0.0005643409,0.0006544285,0.0019599434,0.010135844,0.00043067598,0.0000131821025],"category_scores_gemma":[0.00013304563,0.00048949354,0.00017185215,0.00055347,0.0009078247,0.001100202,0.002972413,0.00099344,0.00017682518],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017514718,0.000028146971,0.000035888603,0.00002744497,0.0000064391293,0.00022718143,0.000410863,0.0054862066,0.000003457098,0.0020931684,0.0013169837,0.99036247],"study_design_scores_gemma":[0.0003041964,0.00018283592,0.00038167287,0.00033314695,0.000006483484,0.00013723428,3.4094537e-8,0.67455834,0.0000938116,0.2995231,0.023531822,0.00094732165],"about_ca_topic_score_codex":0.00003216463,"about_ca_topic_score_gemma":0.000050417137,"teacher_disagreement_score":0.98941517,"about_ca_system_score_codex":0.00042956695,"about_ca_system_score_gemma":0.0017513641,"threshold_uncertainty_score":0.9997557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018527408,0.00017696098,0.9559364,0.0015182574,0.0023460854,0.00061400107,0.0000057476764,0.00015464607,0.037395187],"genre_scores_gemma":[0.9012083,0.00015300374,0.09324232,0.0011454574,0.0024433464,0.000020927804,0.000017836353,0.000039820072,0.0017290068],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977304,0.000065052525,0.00027558173,0.00071867247,0.0008131585,0.00039718143],"domain_scores_gemma":[0.99842376,0.00027657795,0.00029188726,0.00033933128,0.0005306169,0.00013782154],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005760785,0.00027153656,0.00026101895,0.00042301934,0.00072443474,0.0003639493,0.0006192136,0.00020700211,0.00009974889],"category_scores_gemma":[0.00020917006,0.00025326046,0.000040493112,0.0005832748,0.0012264554,0.00069054245,0.000108855325,0.0005035267,0.000025484054],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037858666,0.000050274208,0.00048097945,0.00002346428,0.000011282687,0.00002541435,0.034711752,0.005509233,0.00021492063,0.006131723,0.00023510969,0.952568],"study_design_scores_gemma":[0.00392114,0.0028809432,0.022147313,0.0060562543,0.00020719854,0.00029729807,0.0008119345,0.24769257,0.0035571258,0.08181102,0.6198358,0.01078143],"about_ca_topic_score_codex":0.0005605151,"about_ca_topic_score_gemma":0.005303638,"teacher_disagreement_score":0.9417865,"about_ca_system_score_codex":0.0007756885,"about_ca_system_score_gemma":0.0016081601,"threshold_uncertainty_score":0.99999195},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078223017,0.0007782922,0.98998535,0.00075751945,0.0058437106,0.0008597352,0.0000076256338,0.00030992602,0.0006755996],"genre_scores_gemma":[0.23370521,0.000019090037,0.76355064,0.0011995529,0.0007594096,0.000015510153,0.00008208806,0.000048679394,0.00061984727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940484,0.0001841549,0.00082511076,0.0024770712,0.0016303419,0.00083493243],"domain_scores_gemma":[0.9963558,0.0014529516,0.00048772097,0.00090506667,0.0005845444,0.00021392936],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014296122,0.0007219183,0.00079285796,0.0011438715,0.0003288843,0.0011225371,0.0023661868,0.00037585013,0.000007657451],"category_scores_gemma":[0.00013975537,0.0007056053,0.00017837995,0.0014704048,0.0008938844,0.001184949,0.0023436786,0.0011639926,0.0000725817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007710848,0.00008080148,0.00031932845,0.00015698154,0.000020472355,0.000052658514,0.0005517244,0.20781574,0.000044356933,0.0033477978,0.00019177215,0.7874107],"study_design_scores_gemma":[0.00049414,0.00017710573,0.0026606836,0.00019431165,0.000008344407,0.00013845244,2.456534e-7,0.8185423,0.000056626297,0.1768543,0.0002278698,0.0006456203],"about_ca_topic_score_codex":0.00002717129,"about_ca_topic_score_gemma":0.000048016187,"teacher_disagreement_score":0.78676504,"about_ca_system_score_codex":0.00095114374,"about_ca_system_score_gemma":0.0016426183,"threshold_uncertainty_score":0.9999144},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7333556,0.0008764302,0.23981014,0.0006740525,0.022679847,0.0022098487,0.0000039681404,0.000020520554,0.00036962293],"genre_scores_gemma":[0.9900713,0.0000052495598,0.00907504,0.00012935184,0.0006058344,0.000015522177,0.0000024488647,0.000014611043,0.000080627055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663997,0.00025474094,0.00067450857,0.00044890027,0.001696509,0.00028538945],"domain_scores_gemma":[0.99781644,0.0004268209,0.00048512296,0.00054234645,0.00065104535,0.00007821706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022554796,0.0002344268,0.0007903223,0.00059643696,0.00009954741,0.00004760961,0.0004721927,0.00024942379,0.000012741773],"category_scores_gemma":[0.0004440584,0.0001364764,0.00018389036,0.001282724,0.00044494326,0.000084248044,0.00015951166,0.0004887734,0.0000027024182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002173618,0.00023325045,0.027260937,0.008486194,0.000120235025,0.0000049783202,0.003707851,0.85873526,0.004197333,0.00001257331,0.0015977595,0.09542623],"study_design_scores_gemma":[0.0011797065,0.0002806452,0.027763974,0.007963689,0.00014510885,0.000071405615,0.000005242658,0.961386,0.0009501464,0.00003043324,0.00007813203,0.00014546199],"about_ca_topic_score_codex":0.000027431637,"about_ca_topic_score_gemma":0.000015073142,"teacher_disagreement_score":0.25671574,"about_ca_system_score_codex":0.00036024326,"about_ca_system_score_gemma":0.0010425883,"threshold_uncertainty_score":0.5565346},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028025784,0.01038351,0.9603264,0.00007697679,0.00041886288,0.0003390495,0.00017284886,0.000029903376,0.00022669397],"genre_scores_gemma":[0.7478906,0.00033684072,0.24722789,0.0006439832,0.001386436,0.00000678926,0.0020286841,0.00010951941,0.0003692619],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974537,0.000028225311,0.00034998584,0.0014701321,0.00029809723,0.00039985852],"domain_scores_gemma":[0.9983584,0.000042330863,0.00027182885,0.001119633,0.00010269646,0.00010509918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000401043,0.0003857098,0.00025877738,0.00016619623,0.00021566615,0.00016511483,0.0010813707,0.0004184472,0.0000068252375],"category_scores_gemma":[0.000056216573,0.000380213,0.000049678547,0.000100699624,0.00044285262,0.000024221068,0.0015326494,0.0003140485,0.0000028350807],"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.000009671634,0.000008425429,0.00013257476,0.000036572852,0.000007509852,0.000010871674,0.000017833236,0.000998291,0.9456914,0.0000016951454,0.0002535018,0.052831654],"study_design_scores_gemma":[0.00027117736,0.00006022316,0.00007843733,0.000393727,0.000017596747,0.00008259838,9.4878544e-8,0.009961336,0.976604,0.0012360949,0.010705212,0.0005895313],"about_ca_topic_score_codex":0.000018886334,"about_ca_topic_score_gemma":0.000031032014,"teacher_disagreement_score":0.7198648,"about_ca_system_score_codex":0.00007156178,"about_ca_system_score_gemma":0.00019236602,"threshold_uncertainty_score":0.999865},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011000133,0.000836956,0.9950653,0.00013289176,0.00258111,0.0007787695,0.000089357505,0.0002633491,0.00024130038],"genre_scores_gemma":[0.010295287,0.000030390507,0.98911464,0.00019174689,0.000217925,0.00003391509,0.000019401048,0.00003552979,0.00006117091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630845,0.000053191998,0.0006342998,0.0016356464,0.00085218047,0.00051624485],"domain_scores_gemma":[0.99104846,0.0036733109,0.00042705232,0.004581576,0.00019321998,0.00007639435],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023725023,0.00050162215,0.00082498044,0.00033374727,0.00021306903,0.00025266685,0.010923514,0.00025153012,0.000003216722],"category_scores_gemma":[0.00029084197,0.0003518885,0.00018361642,0.00034912734,0.00046857898,0.00082449696,0.0062443474,0.00067164045,0.000005587128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076817705,0.00001709933,0.000009150659,0.00018611297,0.00033648167,0.000018869167,0.00046558256,0.7091187,0.000118077936,0.06164133,0.000015687157,0.22806522],"study_design_scores_gemma":[0.00022621045,0.00004738539,0.000029979497,0.0003431491,0.00017670765,0.000009169582,5.0645866e-7,0.7084408,0.0012350972,0.2880838,0.00092635996,0.0004808259],"about_ca_topic_score_codex":0.000024487554,"about_ca_topic_score_gemma":0.00002535109,"teacher_disagreement_score":0.2275844,"about_ca_system_score_codex":0.0001247724,"about_ca_system_score_gemma":0.00012077796,"threshold_uncertainty_score":0.9998933},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005573432,0.0002608563,0.9957011,0.0018062865,0.0005420227,0.00064857944,0.0000027144224,0.0005505344,0.00043217448],"genre_scores_gemma":[0.20139496,0.00016248027,0.7968208,0.00044643253,0.00030024938,0.000059361737,0.000022491442,0.000044249384,0.000748964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720967,0.000011845366,0.00031151416,0.0012991487,0.00066246244,0.00050533586],"domain_scores_gemma":[0.998315,0.00013034449,0.0002661474,0.00080276653,0.00040764466,0.00007813687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023569781,0.00043058593,0.0003495031,0.00080174796,0.0004288919,0.0004630553,0.0018505312,0.000391934,0.000004568636],"category_scores_gemma":[0.000049207243,0.00035461184,0.00008290538,0.00074312947,0.00031358548,0.000817481,0.00032322327,0.0005327918,0.000011303389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002809788,0.00003885617,0.000090458765,0.00004843606,0.00001813225,0.000009660719,0.00061100733,0.23454972,0.0004519168,0.12087428,0.00023617383,0.6430433],"study_design_scores_gemma":[0.0002875994,0.00022613567,0.000012920328,0.00008452001,0.0000067328333,0.000059482678,2.901019e-7,0.8805625,0.0021889508,0.11372919,0.002402408,0.00043931569],"about_ca_topic_score_codex":0.000009668761,"about_ca_topic_score_gemma":0.000036960362,"teacher_disagreement_score":0.6460127,"about_ca_system_score_codex":0.00034627682,"about_ca_system_score_gemma":0.00046032676,"threshold_uncertainty_score":0.99989057},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063348166,0.004212797,0.98368865,0.00090278627,0.00038020103,0.00020545928,6.6722043e-7,0.000041398358,0.00423324],"genre_scores_gemma":[0.99790716,0.0001781599,0.00085455895,0.00047131308,0.0005068054,0.000005542765,0.0000020962618,0.000025291696,0.000049085855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982999,0.0000057633356,0.00037888857,0.0005216651,0.0003925561,0.00040120544],"domain_scores_gemma":[0.99885577,0.00012414803,0.00027383812,0.00039210872,0.0003448236,0.000009330987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010218157,0.00027654646,0.00032703672,0.00073797605,0.00042783748,0.0003356419,0.00092950504,0.000107558015,0.0000060072894],"category_scores_gemma":[0.00007473704,0.00017080439,0.000054222153,0.0009839623,0.00088117464,0.0004961776,0.0007681038,0.00036726496,0.000003329938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012326316,0.000009397095,0.0003345072,0.00009699495,0.000013296327,0.0000054018215,0.0010802964,0.278164,0.00002142413,0.036473725,4.613615e-7,0.6837882],"study_design_scores_gemma":[0.000081466904,0.0000017370544,0.000023330751,0.00037609655,0.000022731672,0.0000017603802,0.000023606572,0.8093329,0.000011289682,0.1896723,0.00026901864,0.0001837323],"about_ca_topic_score_codex":0.00049665506,"about_ca_topic_score_gemma":0.00032408527,"teacher_disagreement_score":0.9915723,"about_ca_system_score_codex":0.00002721436,"about_ca_system_score_gemma":0.00006283367,"threshold_uncertainty_score":0.69652003},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042736684,0.00015407878,0.9900793,0.00021740518,0.0005661609,0.0005275361,0.0000035560604,0.00009672378,0.004081602],"genre_scores_gemma":[0.84511155,0.000006726762,0.1517505,0.00032736763,0.0001531422,0.00001171496,0.000001157671,0.000038332808,0.002599539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618864,0.000040991596,0.00066993927,0.0012098977,0.0012013088,0.0006892082],"domain_scores_gemma":[0.9972478,0.00035748677,0.0005220469,0.0012672617,0.0004457741,0.00015962945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000831748,0.0005624883,0.00072422996,0.0005218719,0.0003187232,0.00027543638,0.0035200405,0.00021304753,0.00000537451],"category_scores_gemma":[0.00002626972,0.00037088993,0.00013689225,0.00052173494,0.00042304434,0.0006090586,0.0008608396,0.00082072715,0.000016881982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010190468,0.000055584253,0.0001521254,0.000045096916,0.00001529982,0.000005826324,0.006649838,0.81645876,0.00017114989,0.038415864,0.000009856842,0.13801041],"study_design_scores_gemma":[0.00012250309,0.00055618136,0.00012530002,0.0009663315,0.000010482636,0.000022532136,9.734309e-7,0.98887426,0.0029130948,0.0052821697,0.0006076152,0.0005185595],"about_ca_topic_score_codex":0.000039516035,"about_ca_topic_score_gemma":0.00003749127,"teacher_disagreement_score":0.84083784,"about_ca_system_score_codex":0.00022238636,"about_ca_system_score_gemma":0.00031162228,"threshold_uncertainty_score":0.9998743},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006055471,0.00023335367,0.9973993,0.00021565001,0.0008332611,0.0007065625,0.0000056693407,0.00044117525,0.00010449094],"genre_scores_gemma":[0.06883917,0.000028474256,0.93048596,0.00029443653,0.00022574651,0.000041798652,0.000009017654,0.000045233635,0.000030179213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971332,0.000017850773,0.00049665576,0.0011689521,0.00061672647,0.00056660647],"domain_scores_gemma":[0.99783033,0.00038070627,0.00021911506,0.0013075115,0.00016609117,0.00009624765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079138257,0.00043452726,0.0004678172,0.0008472748,0.00012960493,0.000315335,0.002628659,0.000580244,0.0000045412],"category_scores_gemma":[0.000038918424,0.000448979,0.00008864643,0.00046694838,0.00020930056,0.00053282507,0.0007511141,0.0010733726,0.0000043751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029723903,0.000020310701,0.000057920162,0.00006451644,0.000004214914,0.000022287382,0.0006006557,0.37583336,0.000070339745,0.20671576,0.0000022462693,0.41660544],"study_design_scores_gemma":[0.000092250666,0.000058927057,0.0000074041973,0.0006013463,0.0000025312252,0.0000073815077,2.1351816e-8,0.70829326,0.0010174422,0.28888723,0.00068828557,0.00034389526],"about_ca_topic_score_codex":0.0000319454,"about_ca_topic_score_gemma":0.000074151096,"teacher_disagreement_score":0.41626152,"about_ca_system_score_codex":0.00035584669,"about_ca_system_score_gemma":0.00021830946,"threshold_uncertainty_score":0.9997962},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029365096,0.00068703125,0.99552405,0.00004118504,0.0010699579,0.0006319385,0.0000216588,0.00042128196,0.001573516],"genre_scores_gemma":[0.11483455,0.00004281463,0.8847077,0.00016915068,0.0001465193,0.000020133828,0.0000029408873,0.00003707867,0.000039106217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643975,0.000017190763,0.00072222634,0.0014085855,0.00074162235,0.000670599],"domain_scores_gemma":[0.9972186,0.00019826608,0.00041886614,0.001615845,0.0003980629,0.00015037465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006223758,0.0005749429,0.00074967707,0.00044245413,0.0001327383,0.00016686773,0.0034589388,0.00038226292,0.00000544266],"category_scores_gemma":[0.000023002343,0.0005834665,0.0002753267,0.00036811453,0.00048486498,0.0005437504,0.0013220073,0.0003902425,0.0000024929286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006124495,0.00002105494,0.000018719255,0.00010548056,0.0000176292,0.000028004462,0.00032936851,0.11458184,0.000057263613,0.4447069,0.0000059750337,0.44012165],"study_design_scores_gemma":[0.00013814126,0.00014979,0.000008534262,0.00044968075,0.000008965174,0.000075637305,1.2045893e-8,0.5510794,0.0025045348,0.4442904,0.0008211906,0.0004737116],"about_ca_topic_score_codex":0.000024762974,"about_ca_topic_score_gemma":0.000020234796,"teacher_disagreement_score":0.43964794,"about_ca_system_score_codex":0.00040946083,"about_ca_system_score_gemma":0.00042528793,"threshold_uncertainty_score":0.9996617},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013595396,0.00055308,0.99366194,0.0006114558,0.0015986363,0.00040316692,0.0000037724956,0.00071672886,0.0024376155],"genre_scores_gemma":[0.030710598,0.0005572042,0.95377034,0.011017374,0.00208956,0.000052080704,0.00003299017,0.00011453453,0.001655331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952239,0.00007606582,0.0006979767,0.0018567806,0.00130904,0.0008362461],"domain_scores_gemma":[0.9965452,0.0003614844,0.00033870505,0.0021021105,0.00041230186,0.00024021034],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012618453,0.00062641484,0.0005959236,0.0022349118,0.00031816488,0.0010939817,0.005880862,0.00046095572,0.000012417405],"category_scores_gemma":[0.000060120656,0.00060997193,0.00022544547,0.0029576244,0.0006551895,0.0008618141,0.0022588025,0.001010519,0.000029272716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017326674,0.00008222714,0.00011480973,0.000045829358,0.000012287306,0.000051963267,0.0005853336,0.0011452158,0.0000112299795,0.322992,0.0013972052,0.67356014],"study_design_scores_gemma":[0.00016728435,0.00015052919,0.00014428524,0.00026173604,0.0000050221797,0.000050662115,2.0902586e-8,0.6928761,0.00067833095,0.27286366,0.032041624,0.0007607354],"about_ca_topic_score_codex":0.000019471583,"about_ca_topic_score_gemma":0.000087998495,"teacher_disagreement_score":0.6917309,"about_ca_system_score_codex":0.00036635355,"about_ca_system_score_gemma":0.0014382313,"threshold_uncertainty_score":0.99994296},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003554788,0.0005292255,0.9889435,0.000064929016,0.00082653266,0.00019147732,0.000015841792,0.000013081739,0.005860615],"genre_scores_gemma":[0.43741527,0.00042612414,0.51602834,0.006907134,0.007865582,0.000028450548,0.0007625786,0.0001332264,0.03043331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847436,0.000029570867,0.00021098355,0.00072980137,0.0002298589,0.00032544034],"domain_scores_gemma":[0.99903655,0.000025829366,0.00010907215,0.00057438767,0.00016716635,0.000087006556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026789532,0.00024699545,0.0002399023,0.00013689506,0.00010606041,0.00006465813,0.00074691675,0.0002889974,0.00001545825],"category_scores_gemma":[0.000032649918,0.00023842115,0.00006894587,0.00016810941,0.0008922483,0.0000028364846,0.00046362542,0.00021767322,0.000046221612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002674102,0.0004410419,0.00088456203,0.00024582498,0.00028574074,0.000061017072,0.004123855,0.51723725,0.18421598,0.0010767118,0.065115206,0.22604539],"study_design_scores_gemma":[0.0012207469,0.0017965959,0.001252514,0.00023396104,0.000042082822,0.00015437992,0.0000016550822,0.5690975,0.060768172,0.039222382,0.32377574,0.002434286],"about_ca_topic_score_codex":0.0000028313161,"about_ca_topic_score_gemma":0.00017952867,"teacher_disagreement_score":0.47291517,"about_ca_system_score_codex":0.0001396868,"about_ca_system_score_gemma":0.0010054128,"threshold_uncertainty_score":0.97225326},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029371255,0.0029956335,0.9693668,0.0003668522,0.0016210576,0.00029933368,0.0000047260846,0.00013403842,0.02518218],"genre_scores_gemma":[0.1372903,0.0008714249,0.8532203,0.005722015,0.0020049857,0.000018441446,0.000041786432,0.00006660892,0.0007641438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959815,0.000040511008,0.0007224933,0.0017317611,0.0006213269,0.00090241525],"domain_scores_gemma":[0.997618,0.00051505666,0.00027086568,0.0013103244,0.00009892662,0.00018679896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008381718,0.00049837254,0.000582296,0.0010991886,0.00012662481,0.00086829334,0.0048809065,0.0002562764,0.000010174988],"category_scores_gemma":[0.000088507346,0.00047984917,0.00010237193,0.0013594503,0.0005044107,0.0026263855,0.002322959,0.000858575,0.000116490046],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016027245,0.000037913596,0.000111560454,0.000030575797,0.0000013783441,0.00004843896,0.000351588,0.04844261,0.0000014757514,0.004466657,0.000055288037,0.9464509],"study_design_scores_gemma":[0.00031006784,0.000126505,0.00019306019,0.00085369934,0.000002217329,0.000079685866,3.326808e-7,0.8292521,0.00036656077,0.104836784,0.06296257,0.00101637],"about_ca_topic_score_codex":0.0000131750585,"about_ca_topic_score_gemma":0.0002763005,"teacher_disagreement_score":0.9454346,"about_ca_system_score_codex":0.00075520773,"about_ca_system_score_gemma":0.0011574603,"threshold_uncertainty_score":0.99976534},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028201866,0.0019713321,0.96594846,0.0010124076,0.0026220668,0.0003449702,0.000001582532,0.00031117894,0.02775981],"genre_scores_gemma":[0.31583327,0.00017341043,0.67960453,0.0017381894,0.0008680664,0.000020072419,0.0000026406556,0.000054319924,0.0017054934],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646044,0.000019599483,0.00045482317,0.0016362047,0.00066699623,0.0007619196],"domain_scores_gemma":[0.99744296,0.00030606144,0.00022709687,0.0016666071,0.00021316226,0.00014409084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005760067,0.00053074356,0.00055333116,0.0006294978,0.00022098194,0.00048051475,0.0046087266,0.00033974324,0.000018213752],"category_scores_gemma":[0.00011003051,0.00045274443,0.00014791124,0.00058663386,0.0008550874,0.0006020715,0.0016306437,0.0007180058,0.00018468779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002280564,0.000035816807,0.000030911666,0.000052910847,0.000007069118,0.00012753221,0.0008335948,0.004110628,0.000053585336,0.3118614,0.00003340467,0.68285084],"study_design_scores_gemma":[0.00038394355,0.00020630461,0.00030501618,0.0007953103,0.00000684173,0.00010891547,1.3018595e-7,0.07863836,0.0022953956,0.91157514,0.0047594914,0.00092512224],"about_ca_topic_score_codex":0.00002395867,"about_ca_topic_score_gemma":0.00008644411,"teacher_disagreement_score":0.6819257,"about_ca_system_score_codex":0.00041839978,"about_ca_system_score_gemma":0.0013335085,"threshold_uncertainty_score":0.99979246},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006978378,0.000050261508,0.98447907,0.000634889,0.0024212936,0.0004088851,0.000009087293,0.00016940136,0.011757313],"genre_scores_gemma":[0.11412919,0.00020467956,0.8528973,0.012242632,0.003125103,0.000046526755,0.00025126906,0.00009069162,0.017012643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964649,0.000033939166,0.0005980833,0.00048489342,0.0017167021,0.0007014466],"domain_scores_gemma":[0.99667907,0.00019023422,0.0004974272,0.00185771,0.00056870066,0.00020683232],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014880843,0.00037151913,0.00038590195,0.0010764296,0.0006123137,0.0025735667,0.005841761,0.0003527534,0.00001967254],"category_scores_gemma":[0.00038786643,0.00032461443,0.00012217714,0.00072669913,0.00061116926,0.0059070657,0.001704371,0.00093875517,0.00042553313],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010440118,0.000016225613,0.000032215514,0.000059327318,0.0000042511588,0.000024754983,0.0017476062,0.0020152528,0.000018211133,0.0053591393,0.0006068712,0.9901057],"study_design_scores_gemma":[0.0010801724,0.00048272044,0.0016510879,0.00061896007,0.000012705889,0.00017711903,5.247463e-7,0.8073009,0.0040293084,0.091737114,0.0911239,0.0017854606],"about_ca_topic_score_codex":0.000012807085,"about_ca_topic_score_gemma":0.0000063867524,"teacher_disagreement_score":0.98832023,"about_ca_system_score_codex":0.0005954842,"about_ca_system_score_gemma":0.0027179532,"threshold_uncertainty_score":0.9999206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000091708454,0.00056996,0.9964623,0.00011475548,0.00090172235,0.00053764373,0.000006250317,0.0010384719,0.00027721314],"genre_scores_gemma":[0.017724892,0.000040450108,0.98175806,0.00012870197,0.00011573343,0.00004054814,0.0000055416826,0.00006857009,0.00011750833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559593,0.000031052063,0.000668476,0.0018325357,0.0009823702,0.00088961516],"domain_scores_gemma":[0.99738663,0.0005077579,0.00021736037,0.0015540357,0.00015719465,0.00017704006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000755825,0.0007671255,0.0007415669,0.0018647398,0.00010149386,0.00028586664,0.0031104784,0.00045412703,0.000010785462],"category_scores_gemma":[0.00012266573,0.0007929912,0.00014919908,0.001237314,0.000310251,0.00078968407,0.0013499949,0.0013599496,0.000026706255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004690783,0.000055019635,0.00021427563,0.00011630053,0.00001675713,0.00022352676,0.0019554282,0.4323499,0.0000377796,0.24847834,0.000017790706,0.3165302],"study_design_scores_gemma":[0.00019084933,0.00017426156,0.00018859407,0.000748828,0.000004133976,0.00004729406,6.833088e-8,0.9843897,0.0005845727,0.010550092,0.002216802,0.000904769],"about_ca_topic_score_codex":0.000023288538,"about_ca_topic_score_gemma":0.000025878006,"teacher_disagreement_score":0.55203986,"about_ca_system_score_codex":0.00063779636,"about_ca_system_score_gemma":0.00021180259,"threshold_uncertainty_score":0.9994521},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006442284,0.000095001626,0.9870678,0.00023854553,0.0015193687,0.00034184288,0.00014951688,0.00005478172,0.009888925],"genre_scores_gemma":[0.9033267,0.00003506723,0.079945885,0.0003328434,0.0007768101,0.000024436844,0.00001589181,0.00003260893,0.015509787],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629897,0.000044015065,0.0007573032,0.0011481715,0.0014615922,0.00028997465],"domain_scores_gemma":[0.9934077,0.00285818,0.0008137957,0.0022047828,0.0005875023,0.00012798615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002011048,0.0002840526,0.00046087962,0.00070564245,0.0005209641,0.0005296064,0.0028601023,0.00026012803,0.00037607367],"category_scores_gemma":[0.0027285356,0.00021920666,0.00016828933,0.0002745516,0.0020707862,0.00068794965,0.0005986156,0.00046884333,0.00023205974],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020404752,0.000039338993,0.002457282,0.000009661658,0.0000125177085,0.000008126582,0.00061496015,0.011023379,0.00049452676,0.032705106,0.0004898556,0.95212483],"study_design_scores_gemma":[0.00029039467,0.00010289886,0.004491671,0.00021300011,0.0000143228035,0.00003426359,0.0000013382466,0.091231145,0.003801578,0.8463342,0.05306672,0.00041844795],"about_ca_topic_score_codex":0.000018881836,"about_ca_topic_score_gemma":0.000039298753,"teacher_disagreement_score":0.9517064,"about_ca_system_score_codex":0.00006638282,"about_ca_system_score_gemma":0.00029943712,"threshold_uncertainty_score":0.89389884},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011482877,0.00022696082,0.99529034,0.000091637674,0.001965729,0.00035045602,0.000004350963,0.0004652277,0.0014904517],"genre_scores_gemma":[0.047914814,0.00002149176,0.9515136,0.00015596874,0.00025610265,0.000022569073,0.000006342429,0.000045267723,0.000063853346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957434,0.000106579435,0.00053350936,0.001918922,0.0007036642,0.0009939297],"domain_scores_gemma":[0.9963833,0.0014033123,0.00025586507,0.001591525,0.000179394,0.00018656804],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001980975,0.0006124942,0.00064989715,0.0013330257,0.0002858463,0.0004398008,0.0038558762,0.0005274706,0.0000038458634],"category_scores_gemma":[0.0006852086,0.00061293994,0.000114245166,0.00079364947,0.00060640695,0.0024433746,0.0020255845,0.002709771,0.0000080279315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004326776,0.000024262112,0.0000088226125,0.000015525413,0.000004641598,0.000034177316,0.0018664596,0.8065178,0.00018727935,0.020767428,7.3433154e-7,0.17056857],"study_design_scores_gemma":[0.00014011069,0.00006766007,0.000054834698,0.00022790415,0.000002799126,0.000069589085,0.0000010075755,0.71976256,0.0003183083,0.27877966,0.00004769412,0.00052786764],"about_ca_topic_score_codex":0.000030473728,"about_ca_topic_score_gemma":0.00008818573,"teacher_disagreement_score":0.25801224,"about_ca_system_score_codex":0.0005759926,"about_ca_system_score_gemma":0.00042787244,"threshold_uncertainty_score":0.9996322},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001905595,0.0003724293,0.99356,0.00025685577,0.0022888617,0.0012724309,0.0000073156616,0.00030722647,0.001915793],"genre_scores_gemma":[0.19090295,0.000010577445,0.80708414,0.0012265604,0.00036666708,0.00007835874,0.0000148409335,0.00003753463,0.0002783373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697596,0.000025810172,0.0006509942,0.0011308256,0.00069540326,0.0005209992],"domain_scores_gemma":[0.99721843,0.00087713124,0.00042911482,0.0009046311,0.00044466386,0.000126006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013566358,0.00041245026,0.00044970095,0.000877703,0.00027209194,0.00048064775,0.0016090927,0.00033790176,0.0000071391314],"category_scores_gemma":[0.000058151047,0.0003826554,0.00017627455,0.00037587606,0.00022641342,0.0004848955,0.00026149387,0.0004177122,0.000009299941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007793308,0.000026673015,0.000046966972,0.000055211145,0.000008157692,0.000012427579,0.00041120022,0.062490057,0.00011457891,0.022296166,0.000058313788,0.91447246],"study_design_scores_gemma":[0.0003250387,0.00027881813,0.000022247188,0.00040531272,0.0000056096533,0.0000162279,3.9259157e-7,0.9684603,0.0011072032,0.02189594,0.007030018,0.0004528572],"about_ca_topic_score_codex":0.000045997287,"about_ca_topic_score_gemma":0.00015350952,"teacher_disagreement_score":0.9140196,"about_ca_system_score_codex":0.0003911357,"about_ca_system_score_gemma":0.0006009384,"threshold_uncertainty_score":0.99986255},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000793093,0.00022306704,0.9907913,0.0043874662,0.0012705087,0.0017544281,0.00006998958,0.00064224616,0.000781682],"genre_scores_gemma":[0.08499984,0.000022702412,0.9111803,0.0027274038,0.00053732755,0.00022572263,0.00004803034,0.00005994984,0.00019873101],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951957,0.000014831632,0.00067671534,0.0021197598,0.0010160949,0.0009769013],"domain_scores_gemma":[0.99638003,0.00040077942,0.000389005,0.002180817,0.00042908755,0.00022025421],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005034293,0.0006990633,0.0006007443,0.0012184591,0.00043510925,0.00061561656,0.005251536,0.0005038908,0.000017468938],"category_scores_gemma":[0.00012073585,0.00066401943,0.00018842095,0.0012918656,0.00039295075,0.0006391117,0.0018484797,0.0007004114,0.0000407501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074444692,0.000023284672,0.000087933826,0.00005405092,0.000023626895,0.00001616885,0.0007225613,0.07025979,0.00027092517,0.20569187,0.00071498466,0.7221274],"study_design_scores_gemma":[0.0005547399,0.00031805164,0.00040248182,0.000303395,0.000019091476,0.00004904434,7.6859214e-7,0.09998512,0.0025515384,0.8588907,0.03581973,0.0011053437],"about_ca_topic_score_codex":0.00003570399,"about_ca_topic_score_gemma":0.00019430334,"teacher_disagreement_score":0.721022,"about_ca_system_score_codex":0.0010882398,"about_ca_system_score_gemma":0.0009408118,"threshold_uncertainty_score":0.9995811},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018057385,0.00023292928,0.9949978,0.00052487344,0.00050249655,0.0004187093,0.000004512579,0.00010036647,0.0014125603],"genre_scores_gemma":[0.8380481,0.000009405235,0.161625,0.00017543304,0.0000628028,0.000012567205,0.0000025890342,0.000019965306,0.000044158714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732727,0.00013402638,0.0006896766,0.0008403787,0.000632667,0.0003759986],"domain_scores_gemma":[0.99666876,0.0012636061,0.00065621233,0.000871006,0.00046373555,0.00007667536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015933035,0.00036321863,0.0005438298,0.0007617503,0.0002336749,0.00016259254,0.0017909413,0.00017260376,0.0000063020543],"category_scores_gemma":[0.00016039993,0.00026652965,0.000098469565,0.000742558,0.00041204115,0.00034178793,0.00049831544,0.00092290406,0.0000013218579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007350431,0.00026038053,0.004796028,0.0005961042,0.0001394391,0.001909478,0.08200739,0.2428356,0.0012935562,0.071619906,0.000077680685,0.5943909],"study_design_scores_gemma":[0.0008488997,0.0012294338,0.00035365298,0.0054783537,0.00004614724,0.00047613055,0.000072170624,0.8834516,0.06038711,0.04429146,0.001838603,0.0015264847],"about_ca_topic_score_codex":0.002362495,"about_ca_topic_score_gemma":0.0014386418,"teacher_disagreement_score":0.8362423,"about_ca_system_score_codex":0.00017792238,"about_ca_system_score_gemma":0.00048779615,"threshold_uncertainty_score":0.99997866},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016421305,0.0006357264,0.9952331,0.00027131214,0.0013441809,0.00025640166,0.000031937016,0.000077500285,0.0019856081],"genre_scores_gemma":[0.37675855,0.000053799533,0.61941355,0.00081329484,0.00074732536,0.000029309804,0.00007733516,0.000020734276,0.0020860692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961967,0.000071796705,0.00068514596,0.0010712293,0.0012820525,0.00069306913],"domain_scores_gemma":[0.9973324,0.00041826238,0.00041881774,0.0012509982,0.0003991634,0.00018035882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009896837,0.0003600263,0.00072173495,0.0012869358,0.00018662483,0.00046182482,0.0047865976,0.0002641777,0.000058833346],"category_scores_gemma":[0.00015336793,0.00027484001,0.00017762886,0.0026455175,0.0015749459,0.0011861506,0.0021974742,0.00052605296,0.00007860997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008845929,0.00023903808,0.0004166933,0.00021961631,0.00007249674,0.0000563217,0.0003641434,0.068300225,0.000087859844,0.34443182,0.0017670505,0.58403593],"study_design_scores_gemma":[0.00020153903,0.00027104796,0.0014985007,0.00015497918,0.000013255405,0.00005487968,2.409657e-7,0.7960169,0.00011558853,0.19857606,0.0025902062,0.0005068282],"about_ca_topic_score_codex":0.00020831297,"about_ca_topic_score_gemma":0.000025058276,"teacher_disagreement_score":0.7277166,"about_ca_system_score_codex":0.0002650048,"about_ca_system_score_gemma":0.0006280068,"threshold_uncertainty_score":0.9999704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004430992,0.00037445955,0.9876609,0.00014781443,0.0007331855,0.00049634743,0.000007995342,0.00023881545,0.005909501],"genre_scores_gemma":[0.3787826,0.000017776913,0.61970526,0.0012038822,0.0002034515,0.0000065123454,0.000034745513,0.000030761923,0.000015034629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952552,0.00007618939,0.0008925878,0.0014958469,0.0014967924,0.0007834277],"domain_scores_gemma":[0.99692696,0.0005173478,0.0006085623,0.0013884671,0.00033179665,0.00022687783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011274208,0.0006235843,0.0008568947,0.0011801035,0.00023935645,0.00028972482,0.0037993575,0.0003762874,0.00001828904],"category_scores_gemma":[0.000012205302,0.00053395826,0.00018178366,0.0010453019,0.0006163592,0.00050639047,0.0014726535,0.00092153176,0.000016484766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033153658,0.00028990302,0.00014371326,0.000576743,0.00006098945,0.0001739289,0.0050767143,0.049922887,0.0014787909,0.079088144,0.000004239462,0.8631508],"study_design_scores_gemma":[0.00047225258,0.00023343961,0.00053322775,0.0010526029,0.000019362606,0.00018469531,0.0000014478929,0.9561136,0.002410791,0.038013373,0.00023067376,0.0007345781],"about_ca_topic_score_codex":0.00008376161,"about_ca_topic_score_gemma":0.00004438101,"teacher_disagreement_score":0.9061907,"about_ca_system_score_codex":0.00020111837,"about_ca_system_score_gemma":0.00023807444,"threshold_uncertainty_score":0.9997112},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035133775,0.00021079702,0.9843767,0.000029428144,0.009827256,0.00032783966,0.000004055038,0.0003487869,0.004523761],"genre_scores_gemma":[0.8426676,0.000085989646,0.120269656,0.0017562556,0.030466635,0.000049022063,0.00006787674,0.00041943497,0.0042175646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755305,0.000052111704,0.0004888936,0.0007339187,0.0006582596,0.00051377906],"domain_scores_gemma":[0.99865407,0.00028959493,0.00011100501,0.00069800054,0.0001125762,0.00013476548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088527537,0.0004355761,0.00054696033,0.00067940704,0.00015121714,0.00031766677,0.00068464753,0.00060687854,0.000038462542],"category_scores_gemma":[0.000022904702,0.00038203894,0.00013299247,0.00046767897,0.00018235891,0.00019814505,0.00021795406,0.0008796251,0.0003336199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044624358,0.000006259071,0.000007326664,0.000072214985,0.0000069038597,0.000015835669,0.00008521125,0.41809377,0.00019725096,0.000032797918,0.011314362,0.5701636],"study_design_scores_gemma":[0.00030672443,0.00028008607,0.00006423814,0.0005670546,0.0000071606028,0.00006405314,3.9341707e-8,0.9170697,0.0009895725,0.002313081,0.077754885,0.00058342644],"about_ca_topic_score_codex":0.000013118916,"about_ca_topic_score_gemma":0.00003091078,"teacher_disagreement_score":0.8641071,"about_ca_system_score_codex":0.00044358082,"about_ca_system_score_gemma":0.00015784291,"threshold_uncertainty_score":0.99986315},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000065049324,0.0029966347,0.98701274,0.00038073532,0.0054320307,0.00029345512,0.0000019002391,0.00014761442,0.0036698133],"genre_scores_gemma":[0.349396,0.00020842114,0.62831247,0.0043413527,0.0041693076,0.00004327989,0.000009496238,0.00010537502,0.013414329],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695575,0.000043978787,0.00043702294,0.0011170426,0.00068232534,0.0007638981],"domain_scores_gemma":[0.9981425,0.00025624342,0.00024410294,0.0009877258,0.00013614706,0.00023330966],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010466281,0.0004292998,0.0004719697,0.00055649836,0.00017081304,0.00119474,0.00307576,0.0002734153,0.0000063654843],"category_scores_gemma":[0.000047258534,0.0003650601,0.000079258454,0.000400336,0.00045170027,0.0007168521,0.0020956844,0.0007063252,0.000062718165],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024000915,0.00004735644,0.00007153757,0.00014579754,0.000016567801,0.000070974944,0.0025395402,0.009773575,0.000042608972,0.036879927,0.00061591965,0.9497938],"study_design_scores_gemma":[0.00016488649,0.00020952265,0.000090215144,0.00076086546,0.000010855651,0.00038123183,3.3601373e-7,0.9104654,0.0007179049,0.030610492,0.05560224,0.0009860081],"about_ca_topic_score_codex":0.000059371716,"about_ca_topic_score_gemma":0.000011440859,"teacher_disagreement_score":0.9488078,"about_ca_system_score_codex":0.0004619004,"about_ca_system_score_gemma":0.0005635102,"threshold_uncertainty_score":0.99988014},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012990489,0.0006006842,0.989836,0.0005853399,0.0027162314,0.00021668444,9.925288e-7,0.00031882044,0.005595383],"genre_scores_gemma":[0.22706486,0.000029738716,0.7661669,0.0041058753,0.0013581396,0.000013888266,0.0000056471185,0.000038942722,0.0012159478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960738,0.000068544745,0.0004830073,0.0015723888,0.0009649132,0.00083734834],"domain_scores_gemma":[0.99724704,0.00058203563,0.00018336279,0.0016279448,0.00020680644,0.00015278417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009816396,0.000474775,0.0006111768,0.000586984,0.00023122404,0.0005514755,0.005355933,0.00036284368,0.0000080259615],"category_scores_gemma":[0.00019903551,0.0004100682,0.00013074513,0.00070211274,0.00093292445,0.0005391891,0.0016741538,0.0007649052,0.000088626155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035137268,0.000030957664,0.000055295488,0.00003780093,0.000011777428,0.00009501709,0.0020246522,0.38399187,0.000042822612,0.061569065,0.00045778975,0.55167943],"study_design_scores_gemma":[0.00016588501,0.00008622762,0.000011367452,0.0001660764,0.0000038185085,0.000041027088,2.6425454e-7,0.8667634,0.00019385415,0.13024345,0.0018636778,0.00046091145],"about_ca_topic_score_codex":0.000023964893,"about_ca_topic_score_gemma":0.00006661339,"teacher_disagreement_score":0.5512185,"about_ca_system_score_codex":0.00029935577,"about_ca_system_score_gemma":0.0012505548,"threshold_uncertainty_score":0.99983513},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035827658,0.03875133,0.9559004,0.0003316176,0.00042586977,0.0008954501,0.0000059890876,0.00008042247,0.000026202488],"genre_scores_gemma":[0.64306855,0.010771568,0.32925257,0.009593424,0.0057572536,0.00011110296,0.0005578965,0.000480924,0.00040670874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972928,0.000059712485,0.00035113932,0.0010023222,0.00079093355,0.00050305016],"domain_scores_gemma":[0.9986862,0.00031492126,0.00009303968,0.00034648168,0.000100171936,0.0004592011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012784794,0.0003720901,0.00091844617,0.00037673776,0.00019059033,0.00019553065,0.00016389517,0.0001466565,0.0000042701904],"category_scores_gemma":[0.0002118448,0.0003298081,0.00027914767,0.00017705356,0.00032169264,0.00011817658,0.00041387044,0.00064584723,5.33848e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012057761,0.000024100467,0.015697313,0.0020631137,0.00030425383,0.00003738118,0.00045490006,0.002157718,0.000012474547,0.00003619463,0.000016077214,0.9791844],"study_design_scores_gemma":[0.0022643732,0.00027561298,0.0053282757,0.0025345439,0.00020780208,0.0013392147,0.0000030980964,0.9808218,0.000013458958,0.00009080182,0.0066529624,0.0004680588],"about_ca_topic_score_codex":0.000027509383,"about_ca_topic_score_gemma":0.000006980966,"teacher_disagreement_score":0.9787164,"about_ca_system_score_codex":0.00013493175,"about_ca_system_score_gemma":0.00063544157,"threshold_uncertainty_score":0.9999154},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000099345625,0.000070205046,0.9971809,0.00006046031,0.0010743515,0.00045451682,0.000008462935,0.0005085958,0.00063257327],"genre_scores_gemma":[0.12702495,0.000017620969,0.8724519,0.00028120365,0.000060697585,0.000017156628,0.0000075786756,0.0000453456,0.00009356317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996722,0.000029178893,0.00054674124,0.0012491882,0.0009662216,0.00048668255],"domain_scores_gemma":[0.997172,0.00018444067,0.0003504938,0.0018093638,0.00035236272,0.00013133479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065816514,0.0005302305,0.000570366,0.001396442,0.00010383116,0.00011854707,0.0032034072,0.00037342144,0.000008939467],"category_scores_gemma":[0.00003092572,0.0005151578,0.0001605541,0.00078488985,0.00044094055,0.0003700946,0.00055952085,0.00060432433,0.0000052970236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054266525,0.000029581926,0.000013949914,0.00003925013,0.0000034056459,0.000009647654,0.00015675928,0.6042739,0.000021631424,0.07094485,0.000015641357,0.3244859],"study_design_scores_gemma":[0.00015534168,0.00019517142,0.00001074038,0.0004419531,0.000005855559,0.0000066154366,5.1470153e-9,0.86852133,0.0020624446,0.12800908,0.0001531356,0.0004382991],"about_ca_topic_score_codex":0.000023191402,"about_ca_topic_score_gemma":0.000013025225,"teacher_disagreement_score":0.32404763,"about_ca_system_score_codex":0.0002654805,"about_ca_system_score_gemma":0.00055347855,"threshold_uncertainty_score":0.99973},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012710077,0.0004592065,0.9904765,0.0033421698,0.0016416874,0.0005943539,0.0000065763,0.0007009891,0.0015075384],"genre_scores_gemma":[0.3103954,0.000040692277,0.68590075,0.002971315,0.0002604641,0.000027058972,0.0000030964904,0.000036974907,0.0003642756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994581,0.000057482204,0.0007411883,0.0021657017,0.0011604935,0.0012941393],"domain_scores_gemma":[0.9966547,0.00071491423,0.00033380825,0.0018665885,0.00026449328,0.00016551191],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008003274,0.0007627185,0.0008642003,0.0016993126,0.0002601418,0.00036919175,0.0060168765,0.00057302247,0.0000062682498],"category_scores_gemma":[0.00035606002,0.00071157014,0.00016863293,0.0013912757,0.0012044428,0.00055879506,0.00289422,0.0013430301,0.000041580188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002634245,0.000057429566,0.0007290538,0.000015942127,0.000016983713,0.00092764315,0.0010131971,0.23431864,0.00030648318,0.032559786,0.00032098847,0.7297075],"study_design_scores_gemma":[0.0007093043,0.0005216809,0.0017283468,0.00072157633,0.0000058023616,0.00011718272,0.0000018344012,0.9544859,0.0057672877,0.032769855,0.00150323,0.0016680037],"about_ca_topic_score_codex":0.00016719392,"about_ca_topic_score_gemma":0.00054684613,"teacher_disagreement_score":0.7280395,"about_ca_system_score_codex":0.0008584195,"about_ca_system_score_gemma":0.0007377223,"threshold_uncertainty_score":0.99953353},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038581935,0.002894253,0.98867947,0.0010027639,0.0023217401,0.0006242846,0.00003179681,0.00029873406,0.0037611332],"genre_scores_gemma":[0.0142823495,0.00017427048,0.9813903,0.003101853,0.0006673961,0.000007002133,0.0001104267,0.0000543317,0.00021204456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99295694,0.00014653677,0.0008046578,0.0034150693,0.0013214494,0.0013553228],"domain_scores_gemma":[0.9938788,0.00080234976,0.00047639207,0.004270797,0.00020987309,0.00036182906],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001833627,0.0008650415,0.00093046325,0.00069418125,0.0006137681,0.0021322519,0.010228471,0.00050833396,0.000010742793],"category_scores_gemma":[0.00015592953,0.0007447516,0.0000947941,0.0013007502,0.0010672023,0.001716446,0.010170476,0.0009926845,0.000050757677],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018570634,0.000036763842,0.00022783663,0.00008519568,0.00001341353,0.00013165687,0.0010892585,0.002801507,0.000004114306,0.000788978,0.0049647223,0.9898547],"study_design_scores_gemma":[0.00035993842,0.00015441288,0.00051055854,0.00040919968,0.000015082827,0.00023695703,6.2961385e-7,0.94502443,0.000013291274,0.04481068,0.00747833,0.0009865079],"about_ca_topic_score_codex":0.000095055344,"about_ca_topic_score_gemma":0.00006522744,"teacher_disagreement_score":0.9888682,"about_ca_system_score_codex":0.00024859412,"about_ca_system_score_gemma":0.0010153077,"threshold_uncertainty_score":0.99950033},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005549271,0.0008302531,0.99077445,0.00020898189,0.0011656203,0.00016614929,0.000020229445,0.00013873684,0.0011463088],"genre_scores_gemma":[0.17706768,0.00037365008,0.821592,0.0002720333,0.0003798171,0.000005874115,0.000035671845,0.000031788255,0.00024148246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960269,0.00005559881,0.0007367163,0.0014097831,0.0012941508,0.00047687313],"domain_scores_gemma":[0.99669725,0.00050815614,0.00058039016,0.0018822663,0.00018962169,0.0001423012],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005685133,0.00046111207,0.00071448734,0.0009218386,0.00022429,0.00031054445,0.0032405697,0.00026854995,0.00009807832],"category_scores_gemma":[0.000028162358,0.0004235386,0.00018357564,0.0008394179,0.0005470251,0.0008323549,0.0008830786,0.0005886424,0.00007184635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053308236,0.00008038662,0.00013613101,0.000027577049,0.00006076199,0.00016442213,0.0017613623,0.0035974397,0.0017812194,0.0035397406,0.00031331295,0.9885323],"study_design_scores_gemma":[0.0017207268,0.00049799297,0.002765621,0.0022035276,0.00007830363,0.00022989298,0.000002212671,0.7865798,0.008852035,0.15589213,0.038453843,0.0027239088],"about_ca_topic_score_codex":0.000096492025,"about_ca_topic_score_gemma":0.000036439942,"teacher_disagreement_score":0.98580843,"about_ca_system_score_codex":0.00024159605,"about_ca_system_score_gemma":0.00033572415,"threshold_uncertainty_score":0.99982166},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006967185,0.0010472022,0.99512196,0.00043707044,0.0010455246,0.0014078481,0.0000042259708,0.000169431,0.000070034825],"genre_scores_gemma":[0.6354019,0.00007346398,0.3625853,0.0012283301,0.00059292535,0.000042031847,0.000003793944,0.000042783806,0.000029429646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957283,0.000058823833,0.0008050318,0.001820031,0.0005861367,0.0010016336],"domain_scores_gemma":[0.9978985,0.0005013199,0.000292803,0.0007630308,0.0003203817,0.00022391637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001323263,0.00066497293,0.00084587646,0.000743744,0.00032907416,0.0006441402,0.0014371201,0.0005213617,0.000002114179],"category_scores_gemma":[0.000041651972,0.0006685873,0.00013134559,0.00052848057,0.0003143202,0.00078303175,0.0005041754,0.00092271826,0.0000015898542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022011494,0.000015337268,0.000020591948,0.000021982856,0.000008756005,0.000018145178,0.00017197113,0.63990885,0.000007787488,0.0045628683,0.0000014902603,0.35524023],"study_design_scores_gemma":[0.0014684105,0.00013244263,0.00000941837,0.0006697084,0.000020811814,0.00007502296,1.3315298e-7,0.97786605,0.0000015333876,0.019014243,0.00004520033,0.00069704436],"about_ca_topic_score_codex":0.000026242726,"about_ca_topic_score_gemma":0.00010729087,"teacher_disagreement_score":0.6347052,"about_ca_system_score_codex":0.00038272116,"about_ca_system_score_gemma":0.0004998624,"threshold_uncertainty_score":0.9995765},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026482616,0.00004939212,0.9822913,0.00057839474,0.0039341697,0.0005695229,0.000013304642,0.00008725757,0.009828433],"genre_scores_gemma":[0.9865365,0.0000035122073,0.0058886297,0.0013145291,0.00043133838,0.00005968468,0.000032021882,0.000037641403,0.0056961295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976675,0.00005396593,0.0006396569,0.00092012313,0.000302871,0.00041587983],"domain_scores_gemma":[0.99845743,0.00033874283,0.0003497296,0.00057317136,0.00021661581,0.000064317304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007273016,0.00032858847,0.00042433792,0.000743419,0.00016617542,0.00013933449,0.0007699468,0.00029216972,0.0006567848],"category_scores_gemma":[0.000083774714,0.00031091453,0.0000994207,0.0001601291,0.0003146699,0.00015092123,0.0001386052,0.00047309394,0.00014508331],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001832951,0.0001865742,0.0009070369,0.00019676058,0.000055431425,0.000035227295,0.012115054,0.01921275,0.0007020554,0.11854776,0.0018789415,0.8459791],"study_design_scores_gemma":[0.009778254,0.0017566637,0.02906996,0.0059219487,0.000064538355,0.00019081749,0.00003192767,0.48766246,0.00261481,0.33871192,0.11979267,0.0044040373],"about_ca_topic_score_codex":0.00005726581,"about_ca_topic_score_gemma":0.00095526315,"teacher_disagreement_score":0.98388827,"about_ca_system_score_codex":0.0003063735,"about_ca_system_score_gemma":0.00009277542,"threshold_uncertainty_score":0.9999343},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018898363,0.0035088286,0.9859128,0.000686927,0.0025842974,0.0004919104,0.000034738845,0.00024065634,0.006350885],"genre_scores_gemma":[0.007596626,0.00019042633,0.98762,0.003789791,0.0004391154,0.000004153866,0.00009218146,0.000053630876,0.00021407279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99283415,0.00018989788,0.0007992486,0.003496965,0.0013228576,0.0013568782],"domain_scores_gemma":[0.9941296,0.00072860933,0.00045783355,0.0041669947,0.00017597894,0.00034100015],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023708458,0.0008685186,0.00093173457,0.00069306744,0.0006502269,0.0016267198,0.008717818,0.0005050902,0.0000068531826],"category_scores_gemma":[0.0001879604,0.0007738881,0.00009869626,0.0015451647,0.0010144536,0.0012635819,0.006568459,0.0009968571,0.000021509308],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028892055,0.000050328938,0.0003101843,0.00009652544,0.00001604034,0.00025506062,0.0010542376,0.004375335,0.0000035084672,0.0012343439,0.004985194,0.98761636],"study_design_scores_gemma":[0.0004871436,0.00018280486,0.0002859198,0.0004342757,0.000020466534,0.0004175203,6.547032e-7,0.92116475,0.00002054478,0.06284342,0.012945418,0.0011970991],"about_ca_topic_score_codex":0.000030145551,"about_ca_topic_score_gemma":0.000051790266,"teacher_disagreement_score":0.98641926,"about_ca_system_score_codex":0.00027265624,"about_ca_system_score_gemma":0.0013608803,"threshold_uncertainty_score":0.9994712},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001563732,0.000077007535,0.98165154,0.00016934166,0.0012424103,0.0004911706,0.000008475149,0.00016841498,0.016035287],"genre_scores_gemma":[0.23362406,0.000019788402,0.76388913,0.00046278947,0.00082172896,0.00002052801,0.0000107609,0.00015116193,0.0010000371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973149,0.000015244128,0.0005642956,0.0007823436,0.0008201795,0.0005030941],"domain_scores_gemma":[0.99710333,0.0011652058,0.00033347632,0.0010275482,0.00023754495,0.00013287966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038455552,0.00047293224,0.00056397275,0.00041445444,0.00021605504,0.00014031451,0.001121641,0.0002996906,0.00017427249],"category_scores_gemma":[0.0005090604,0.00044455144,0.00013460522,0.00032015,0.00054690434,0.00020619754,0.00044180983,0.0007005539,0.00012399572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036269066,0.000067754605,0.0000045750407,0.00018044696,0.00001353183,0.00006247586,0.0010026846,0.0147467805,0.000049501185,0.96162707,0.00003816477,0.022203414],"study_design_scores_gemma":[0.0002843613,0.00007858442,0.000003415289,0.00035168653,0.00002190141,0.000028542485,4.1157315e-7,0.0084343925,0.00069552497,0.9889694,0.00066797447,0.00046384538],"about_ca_topic_score_codex":0.000005572461,"about_ca_topic_score_gemma":0.00003439572,"teacher_disagreement_score":0.23346768,"about_ca_system_score_codex":0.0005621887,"about_ca_system_score_gemma":0.00049007905,"threshold_uncertainty_score":0.9998006},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010122654,0.000708011,0.9803931,0.0010691289,0.00040039886,0.00055190286,0.0000010146082,0.00037458,0.015489566],"genre_scores_gemma":[0.426351,0.00008092498,0.56522775,0.0023176267,0.00028228544,0.000020991713,0.0000043535897,0.00010547374,0.0056095785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954024,0.000030603747,0.0004379178,0.0020896872,0.0011890638,0.0008503367],"domain_scores_gemma":[0.99765563,0.00015032587,0.00025976147,0.001641101,0.00007940654,0.0002137588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008446546,0.0006570507,0.0005126221,0.0010626471,0.00045568866,0.0008265637,0.0027191115,0.00018720834,0.000009329747],"category_scores_gemma":[0.000008244703,0.0005410087,0.00009365882,0.00079327694,0.00062671193,0.00011543878,0.0033642766,0.0006886644,0.00002125726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010752001,0.000034390923,0.000028032135,0.00017864538,0.000043792174,0.0004989051,0.00067353743,0.25968912,0.0000046068635,0.07539201,0.000010324964,0.6634359],"study_design_scores_gemma":[0.0015155985,0.0005986087,0.0009243865,0.003859131,0.000059857124,0.00039135525,0.0000032004054,0.78180844,0.00010664873,0.20003419,0.008686262,0.0020123348],"about_ca_topic_score_codex":0.000022070955,"about_ca_topic_score_gemma":0.000033347704,"teacher_disagreement_score":0.66142356,"about_ca_system_score_codex":0.00050975534,"about_ca_system_score_gemma":0.00014669559,"threshold_uncertainty_score":0.9997041},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054581997,0.00074829184,0.9680273,0.0011001365,0.0037502702,0.0002797055,0.0000016485983,0.00024468487,0.025793357],"genre_scores_gemma":[0.18686305,0.0001419277,0.7991134,0.0060898867,0.0010282986,0.000007976981,0.000005039534,0.000068151065,0.006682303],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996457,0.000020948131,0.00040249593,0.0015255787,0.00089708186,0.0006969176],"domain_scores_gemma":[0.99704224,0.00051086163,0.00020866057,0.0019581725,0.00015921921,0.00012085727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006183211,0.00047133747,0.00054900046,0.00067314075,0.00015055513,0.00055830705,0.0047333483,0.0003392051,0.000038294293],"category_scores_gemma":[0.000084743835,0.00040082145,0.00014278009,0.00042009016,0.0005505359,0.000567023,0.0018011671,0.00067028846,0.00043477502],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031750155,0.000018814348,0.00020478512,0.000043677206,0.0000114248905,0.00013016953,0.0004271092,0.0055751028,0.00007291674,0.14873935,0.00010958409,0.8446639],"study_design_scores_gemma":[0.0004965379,0.0003641069,0.0010909052,0.00056211586,0.000012886037,0.00021290187,2.515021e-7,0.41710734,0.0015864653,0.5585219,0.018435616,0.0016089292],"about_ca_topic_score_codex":0.000021828639,"about_ca_topic_score_gemma":0.00006733975,"teacher_disagreement_score":0.84305495,"about_ca_system_score_codex":0.00019085109,"about_ca_system_score_gemma":0.00074669387,"threshold_uncertainty_score":0.9998444},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005231484,0.0002486308,0.9791465,0.0009402701,0.001592984,0.00038006442,0.0000019830984,0.00017264078,0.017511686],"genre_scores_gemma":[0.029310925,0.0001420266,0.9626302,0.0032385662,0.00042328506,0.000006372755,0.0000066239854,0.000050263847,0.0041917446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966544,0.000028304112,0.00040530114,0.0012870469,0.001006151,0.0006188231],"domain_scores_gemma":[0.9977533,0.00029794118,0.00018475481,0.0013485147,0.00025028884,0.00016519144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084129523,0.0003724052,0.00040388163,0.00076939975,0.0001765059,0.0006912844,0.003275943,0.00025316904,0.00006372318],"category_scores_gemma":[0.00005547174,0.00033594336,0.00011607649,0.0005286975,0.00030427813,0.0006417318,0.0012508399,0.00075091375,0.00031200473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024209967,0.000016542665,0.000046145018,0.000035188943,0.0000074995964,0.00003899605,0.00044975252,0.34650677,0.00005113752,0.07991805,0.000036736248,0.57289076],"study_design_scores_gemma":[0.00022009226,0.00010303259,0.000015857606,0.00018322853,0.0000020176205,0.000019947984,3.5376384e-8,0.91288936,0.0001928102,0.081781164,0.004158939,0.00043349477],"about_ca_topic_score_codex":0.0000069321977,"about_ca_topic_score_gemma":0.000013977633,"teacher_disagreement_score":0.57245725,"about_ca_system_score_codex":0.00019204227,"about_ca_system_score_gemma":0.0008172381,"threshold_uncertainty_score":0.9999093},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009926477,0.00018445279,0.9964742,0.00069529976,0.0013087542,0.0006656053,0.000013164598,0.00036548235,0.00019374171],"genre_scores_gemma":[0.07771588,0.000048230722,0.9189751,0.0015174821,0.0015289459,0.000024548948,0.00005148945,0.000044945562,0.000093347306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693394,0.000023903714,0.0005508754,0.0014265771,0.00054918247,0.0005155326],"domain_scores_gemma":[0.9979712,0.00017505477,0.00035939994,0.0008174349,0.0005241631,0.0001527683],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00090375595,0.00047603252,0.0004710258,0.0009620696,0.00057525525,0.0011711096,0.0016271044,0.0004322065,0.000010621184],"category_scores_gemma":[0.000071681236,0.00047271996,0.00010339987,0.0005428249,0.00042814823,0.0005577107,0.0010341434,0.00062380865,0.0000024579172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028598486,0.000033523615,0.00014336957,0.0001285103,0.000016893602,0.000017572544,0.0010259941,0.0004634355,0.010711516,0.16624561,0.00029944247,0.8209113],"study_design_scores_gemma":[0.00018315483,0.00012243772,0.00015476106,0.00016441432,0.0000046731284,0.000050028157,1.0101883e-7,0.9183675,0.0021845563,0.07014537,0.008140597,0.000482408],"about_ca_topic_score_codex":0.00001011306,"about_ca_topic_score_gemma":0.000057568122,"teacher_disagreement_score":0.9179041,"about_ca_system_score_codex":0.00008585084,"about_ca_system_score_gemma":0.00019278679,"threshold_uncertainty_score":0.9998658},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043201013,0.0013960815,0.9965912,0.0012337207,0.00020251278,0.00024237116,0.000005526905,0.000063961874,0.00022140366],"genre_scores_gemma":[0.07765168,0.000113635266,0.9210692,0.0010471122,0.000077151344,0.0000061462965,0.0000023899627,0.000012243601,0.00002041405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755436,0.0001137,0.00038842997,0.00081723306,0.0008352222,0.00029105254],"domain_scores_gemma":[0.99770635,0.0013246619,0.0001861408,0.0004918909,0.0001701136,0.00012086503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081202155,0.00024660616,0.0003544725,0.00025728438,0.00015434648,0.00020603334,0.0010484629,0.00009301897,0.0000017806894],"category_scores_gemma":[0.00008578966,0.00018607195,0.00003523202,0.00023169655,0.001458044,0.0003637231,0.0010858662,0.00038582957,5.612685e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024059952,0.000022483266,0.000047562033,0.00019168189,0.000007591662,0.000006788343,0.0011399307,0.3129178,0.000038177746,0.033121686,0.00018090717,0.652323],"study_design_scores_gemma":[0.00008122697,0.000026291407,0.00006649122,0.00021446486,0.000003276512,0.000032320535,2.222241e-7,0.6629666,0.00026343213,0.33620223,0.000017475184,0.00012595045],"about_ca_topic_score_codex":0.000012295856,"about_ca_topic_score_gemma":0.0000052243117,"teacher_disagreement_score":0.65219706,"about_ca_system_score_codex":0.00007330432,"about_ca_system_score_gemma":0.0003745492,"threshold_uncertainty_score":0.75877935},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007944226,0.0004986905,0.94319624,0.00047679892,0.00087442365,0.00035525288,0.0000023924863,0.0007938688,0.053794373],"genre_scores_gemma":[0.025223687,0.000028440214,0.9691784,0.0017158265,0.0002570948,0.000025449812,0.0000040320742,0.000051575873,0.0035154973],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99602574,0.000014644004,0.00047386382,0.0016522976,0.0010164899,0.000816945],"domain_scores_gemma":[0.997074,0.00019114575,0.00026545103,0.0018396174,0.00041758068,0.00021217037],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00053440727,0.0005685614,0.00050817174,0.0007286586,0.0001951867,0.0027190596,0.0054984884,0.00031220625,0.000038684062],"category_scores_gemma":[0.00009351351,0.0005161359,0.000108165616,0.0008116628,0.0008738191,0.0023509122,0.0024988437,0.00073915976,0.00026049378],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.993306e-7,0.000019843208,0.000009752342,0.000028757242,0.0000041760686,0.000051077503,0.00014503623,0.00047218116,0.000116134506,0.023376523,0.00024129158,0.9755346],"study_design_scores_gemma":[0.00012001171,0.00016252547,0.000014931067,0.0005228331,0.0000048638435,0.00010888367,4.0411095e-8,0.22430484,0.0067750863,0.75297546,0.014039389,0.000971154],"about_ca_topic_score_codex":0.000049189857,"about_ca_topic_score_gemma":0.000022126957,"teacher_disagreement_score":0.9745635,"about_ca_system_score_codex":0.00019168788,"about_ca_system_score_gemma":0.0005880025,"threshold_uncertainty_score":0.9998822},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024250534,0.0027392593,0.9860172,0.0003449953,0.004340603,0.00072686584,0.000004611682,0.00031806497,0.0054841083],"genre_scores_gemma":[0.039403856,0.00014676907,0.9371954,0.006312373,0.0049079573,0.00015293555,0.000052245814,0.00014680845,0.011681644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942204,0.000115510724,0.0006084825,0.0019204154,0.0015688443,0.0015663758],"domain_scores_gemma":[0.995585,0.00046124138,0.00036600797,0.0029971765,0.00019982242,0.0003907333],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015146028,0.00075465266,0.0006416244,0.001090131,0.00027214605,0.00070990913,0.007109173,0.00035186068,0.00012858487],"category_scores_gemma":[0.00004248118,0.00066744577,0.00025116096,0.0018810376,0.00052872126,0.001460766,0.0038433417,0.0009713142,0.0004687343],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031418417,0.000066447436,0.00013437502,0.0000742393,0.000022664512,0.000101148726,0.00034935912,0.085751526,0.000008610097,0.003605843,0.00684846,0.9030342],"study_design_scores_gemma":[0.0006185042,0.00033661484,0.00077460543,0.0007621303,0.00003728327,0.00009584063,1.2738947e-7,0.8052257,0.0003621811,0.06762566,0.12188377,0.002277601],"about_ca_topic_score_codex":0.000022861717,"about_ca_topic_score_gemma":0.000058139507,"teacher_disagreement_score":0.9007566,"about_ca_system_score_codex":0.0016544642,"about_ca_system_score_gemma":0.0014006969,"threshold_uncertainty_score":0.9995777},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020933372,0.00097080047,0.99497557,0.00013819856,0.0010464857,0.00022055101,0.000006877723,0.00011478174,0.00043338057],"genre_scores_gemma":[0.62155247,0.0000872493,0.37766874,0.0003394128,0.00030582683,4.929194e-7,0.0000035787118,0.000017263368,0.00002495948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968892,0.000030076497,0.00057116704,0.0010818845,0.00096029043,0.00046742384],"domain_scores_gemma":[0.9969305,0.00092737674,0.00038837787,0.0013904151,0.00027237594,0.00009095067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066036923,0.000387604,0.00054503215,0.003915657,0.00014957115,0.00022420156,0.0023680252,0.00020518778,0.00001240532],"category_scores_gemma":[0.00019113439,0.00033573102,0.0001491394,0.002588416,0.0007575007,0.00095432886,0.0010195107,0.00039306114,0.000007649561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012120304,0.000035677895,0.00055936264,0.000053424505,0.000015966581,0.00004669317,0.0002387199,0.7128641,0.0007264521,0.0042847637,0.0000042279753,0.28115848],"study_design_scores_gemma":[0.00017190649,0.00008230314,0.00042680698,0.00032928042,0.000012971395,0.000030771753,1.22157e-7,0.97926944,0.001945118,0.01699689,0.00034663125,0.0003877447],"about_ca_topic_score_codex":0.000040569288,"about_ca_topic_score_gemma":0.000044952398,"teacher_disagreement_score":0.61945915,"about_ca_system_score_codex":0.00008393492,"about_ca_system_score_gemma":0.00031670873,"threshold_uncertainty_score":0.99990946},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000034222303,0.0008038709,0.99729675,0.0008833953,0.00032875928,0.00022210064,0.000007873833,0.00012583632,0.0003279831],"genre_scores_gemma":[0.001972953,0.00004053865,0.995911,0.0011231157,0.00080750283,0.000022582824,0.000037832448,0.000023017237,0.00006142571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986389,0.000026414966,0.0003692786,0.0005257515,0.00021822729,0.00022140665],"domain_scores_gemma":[0.9986746,0.0008403879,0.000053982956,0.00019620378,0.0000757118,0.00015915596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007476347,0.00018380125,0.00035824295,0.00018786624,0.00008640262,0.00011372044,0.0003741306,0.00008450127,0.0000048527922],"category_scores_gemma":[0.00016583838,0.00017200432,0.000092012044,0.00035340767,0.00043715644,0.00006510518,0.00012256866,0.0004414948,0.0000036615054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.5708727e-7,0.000005230548,0.00008282697,0.000083448394,0.000015286381,0.0000018514704,0.000036221667,0.11584775,0.000013458896,0.00011997998,0.0003455536,0.8834481],"study_design_scores_gemma":[0.0001297364,0.000008968548,0.000079685065,0.000064283515,0.000029438608,0.0000058819687,8.273672e-8,0.9527759,0.00002432932,0.03409511,0.01261303,0.00017353224],"about_ca_topic_score_codex":9.827074e-7,"about_ca_topic_score_gemma":9.456089e-7,"teacher_disagreement_score":0.8832746,"about_ca_system_score_codex":0.00006949436,"about_ca_system_score_gemma":0.00017393725,"threshold_uncertainty_score":0.7014133},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035800633,0.00045290744,0.99601823,0.0009798225,0.00067769655,0.00082826416,0.0000149214975,0.00027308046,0.00039704284],"genre_scores_gemma":[0.10128689,0.000014745408,0.8876629,0.010664276,0.00017086722,0.0000288643,0.000018269391,0.000049582704,0.0001036054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995876,0.000020819569,0.00053737924,0.0019193819,0.0007361482,0.0009102641],"domain_scores_gemma":[0.9968822,0.00078889803,0.0003400016,0.001181331,0.0005641787,0.0002433911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006592379,0.00065429456,0.0006526608,0.0008845879,0.000381718,0.00029464194,0.002723517,0.00044842294,0.0000023749803],"category_scores_gemma":[0.00003856558,0.0005621069,0.00012701805,0.0005560007,0.00056535593,0.00039514742,0.00070910854,0.00068921625,0.000003902588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011953851,0.000073410876,0.000114688904,0.000675156,0.00002282771,0.00007562409,0.0032326707,0.41263348,0.00013390741,0.031012181,0.000014405305,0.5518921],"study_design_scores_gemma":[0.0005758402,0.00016996425,0.000046669473,0.00049282674,0.000011310701,0.00003964039,4.4538837e-7,0.8192263,0.00045518583,0.1779641,0.0004700165,0.0005476459],"about_ca_topic_score_codex":0.000025206255,"about_ca_topic_score_gemma":0.0007545086,"teacher_disagreement_score":0.55134445,"about_ca_system_score_codex":0.00012418687,"about_ca_system_score_gemma":0.00066533795,"threshold_uncertainty_score":0.999683},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013769845,0.0003403473,0.99089915,0.0018363935,0.004383784,0.0003240547,0.0000108431595,0.00015636235,0.00067209615],"genre_scores_gemma":[0.051644318,0.000032395612,0.9410857,0.0024708905,0.0016328734,0.000017546676,0.000033520773,0.00007299969,0.003009755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923433,0.00011891892,0.0011828286,0.0023899053,0.0032187237,0.0007463185],"domain_scores_gemma":[0.9909876,0.004543904,0.0009863733,0.0030389903,0.00023596302,0.00020719865],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.008644797,0.00042631733,0.0006224836,0.0022666794,0.0001948138,0.0020285582,0.008115126,0.00017665695,0.000057393187],"category_scores_gemma":[0.038379677,0.00036298702,0.00011942047,0.0048959567,0.0002914464,0.0008691754,0.0053546266,0.0010308283,0.00022010204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009422841,0.000037900187,0.0017541066,0.000048129008,0.0000071481904,0.00023820667,0.002547691,0.48716974,0.00003302405,0.000097485594,0.007926621,0.50013053],"study_design_scores_gemma":[0.00025216315,0.00006703613,0.0013438886,0.00047278492,0.000008423896,0.00001861803,0.0000054567317,0.8722346,0.00008442902,0.018530278,0.106323786,0.00065855286],"about_ca_topic_score_codex":0.000045111276,"about_ca_topic_score_gemma":0.00012829666,"teacher_disagreement_score":0.49947196,"about_ca_system_score_codex":0.00039578613,"about_ca_system_score_gemma":0.0008183672,"threshold_uncertainty_score":0.9998822},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007557873,0.00038999264,0.992097,0.0010825634,0.003062851,0.00082897267,0.00005498708,0.00014141838,0.0023346513],"genre_scores_gemma":[0.05350469,0.000030435725,0.9430206,0.0030151268,0.00028792743,0.000031378306,0.000011767875,0.000021495001,0.00007658751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668133,0.00006527706,0.00052977283,0.0013396877,0.0007986349,0.0005852846],"domain_scores_gemma":[0.9971407,0.000517986,0.00027796667,0.0013759654,0.00048111155,0.00020624514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012847217,0.0004575094,0.0004278838,0.00020841746,0.0007038479,0.0008932867,0.0018856905,0.0002593273,0.000027099679],"category_scores_gemma":[0.0000894082,0.0003595975,0.00021557623,0.0005065794,0.0016318299,0.00027676535,0.0002749666,0.00041782114,0.0000074942645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018498993,0.000021276712,0.000041689134,0.00000832307,0.000014813613,0.000009991379,0.00013960821,0.0938897,0.000002412974,0.06781745,0.00001568283,0.8380372],"study_design_scores_gemma":[0.00031503817,0.00012417621,0.00021499366,0.000056702516,0.000019969064,0.00017624114,9.598488e-7,0.95199186,0.000043143813,0.044068266,0.0025385597,0.0004500673],"about_ca_topic_score_codex":0.000028799126,"about_ca_topic_score_gemma":0.00008122605,"teacher_disagreement_score":0.8581022,"about_ca_system_score_codex":0.00057130004,"about_ca_system_score_gemma":0.0010092444,"threshold_uncertainty_score":0.9998856},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000465947,0.00030803037,0.99526703,0.0004903808,0.00086679927,0.00056961726,0.000005273103,0.00026449905,0.0017624258],"genre_scores_gemma":[0.5083268,0.000021201517,0.49061692,0.00066221575,0.0002622203,0.000010659347,0.0000044307217,0.000043515716,0.00005201047],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950356,0.00009163636,0.0005225856,0.0020425455,0.0013833923,0.0009242727],"domain_scores_gemma":[0.9974041,0.00047304682,0.00039127382,0.0011719158,0.00034139544,0.00021826218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015599811,0.0007389038,0.00071066583,0.000685872,0.0003497007,0.00075446605,0.0026750856,0.00028470744,0.000021675418],"category_scores_gemma":[0.000086694825,0.00061524374,0.00013005201,0.00085076614,0.000983806,0.0009978298,0.00091971504,0.0010685254,0.0000425878],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005736953,0.00010828362,0.0004304946,0.00008509769,0.000053176824,0.0006349212,0.0012916822,0.09052288,0.00018027793,0.066346526,0.0000036235215,0.84028566],"study_design_scores_gemma":[0.0022233315,0.002338968,0.0024688516,0.0028289221,0.000054220345,0.00068155705,0.0000015629788,0.36480275,0.007747196,0.6126807,0.00052157114,0.0036503896],"about_ca_topic_score_codex":0.000055076525,"about_ca_topic_score_gemma":0.0003532202,"teacher_disagreement_score":0.8366353,"about_ca_system_score_codex":0.0006897432,"about_ca_system_score_gemma":0.0012112346,"threshold_uncertainty_score":0.9996299},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007266261,0.0019497492,0.99587274,0.001323562,0.00019464004,0.0003276294,0.000006093424,0.00006366628,0.00018925453],"genre_scores_gemma":[0.056263253,0.00019139801,0.9425427,0.0008864441,0.00006321914,0.000010424928,0.000002363989,0.000012379624,0.000027845095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975741,0.00009272178,0.00039253192,0.0008065767,0.0008314211,0.00030265495],"domain_scores_gemma":[0.9978994,0.0011125832,0.00018051875,0.00047790585,0.00020191383,0.00012765244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057057623,0.000251424,0.0003376352,0.00026096584,0.00015057944,0.0002669307,0.0010564183,0.00009435204,0.000003836308],"category_scores_gemma":[0.000073602954,0.00018657286,0.00003387978,0.00024567873,0.0014714974,0.0005454835,0.0011808327,0.0003955625,0.0000010096568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017924638,0.000028712278,0.000047245943,0.00018636417,0.000009308663,0.000008184536,0.0014863403,0.23555714,0.00005625243,0.028698415,0.0003008178,0.7336194],"study_design_scores_gemma":[0.00007288142,0.00002240203,0.00008457093,0.00019636106,0.000002901791,0.000031280622,3.6818574e-7,0.6566265,0.00027491452,0.34255314,0.000009193406,0.00012544861],"about_ca_topic_score_codex":0.000025964244,"about_ca_topic_score_gemma":0.0000035705036,"teacher_disagreement_score":0.733494,"about_ca_system_score_codex":0.00008042533,"about_ca_system_score_gemma":0.0004181516,"threshold_uncertainty_score":0.760822},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013344902,0.00044747154,0.9958796,0.00011967774,0.00046784175,0.0004748589,0.000002033284,0.00094630144,0.0015287944],"genre_scores_gemma":[0.0074144984,0.00002248003,0.9916703,0.00040034828,0.00020996583,0.00001751407,0.0000059787008,0.000056642,0.0002022436],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957897,0.000017069971,0.0005558593,0.0015732232,0.0012603968,0.0008037259],"domain_scores_gemma":[0.99734,0.00025811282,0.00022536793,0.0016979182,0.00027256677,0.000206039],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009509579,0.0006602519,0.00052396633,0.0010566086,0.00020467292,0.0003634294,0.0034586224,0.00032565807,0.0000124154385],"category_scores_gemma":[0.000007023999,0.00056099077,0.00007849434,0.0006153837,0.0004330777,0.00040452223,0.0011799679,0.0007633811,0.000035720514],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060463794,0.000025286814,0.00012903698,0.000034928085,0.0000148199,0.00037555347,0.0013708371,0.01520507,0.00013145055,0.072037786,0.00006569634,0.91060346],"study_design_scores_gemma":[0.0013073238,0.00049755,0.0012629643,0.0024703457,0.000010814153,0.00076253014,4.2593075e-7,0.12553807,0.02841785,0.035925556,0.7993876,0.0044190083],"about_ca_topic_score_codex":0.000011390535,"about_ca_topic_score_gemma":0.00007619924,"teacher_disagreement_score":0.9061845,"about_ca_system_score_codex":0.00057104626,"about_ca_system_score_gemma":0.00043652108,"threshold_uncertainty_score":0.99968415},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044690263,0.0001644739,0.996337,0.00022852574,0.00043951874,0.00044820664,0.000017967634,0.0009249467,0.001394689],"genre_scores_gemma":[0.11506524,0.000057336143,0.88402605,0.0005768186,0.00008849709,0.000022469085,0.000025180656,0.000044765442,0.00009362829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969807,0.000019676525,0.0005315192,0.0010926473,0.0007837106,0.0005917172],"domain_scores_gemma":[0.99824184,0.00007830522,0.00021215256,0.0011218,0.00018213024,0.00016378377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005591359,0.0005367773,0.0004460741,0.00070310995,0.00022146331,0.0003016189,0.0026225904,0.00039044683,0.000006869631],"category_scores_gemma":[0.0000037981247,0.0005512025,0.00012631693,0.00034077163,0.00026113045,0.001167918,0.000519012,0.0007570242,0.00001863736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033546191,0.000028544395,0.000002765776,0.000056457644,0.000007642767,0.00001011954,0.0017713162,0.18544054,0.001056519,0.19445087,0.000045766006,0.6171261],"study_design_scores_gemma":[0.00011735386,0.00006515685,0.0000037548498,0.00024278495,0.000005110016,0.000026884769,1.2160606e-8,0.8792013,0.0060514156,0.11290733,0.0008354627,0.00054344087],"about_ca_topic_score_codex":0.000017265906,"about_ca_topic_score_gemma":0.0000053772283,"teacher_disagreement_score":0.69376075,"about_ca_system_score_codex":0.000388616,"about_ca_system_score_gemma":0.00020521795,"threshold_uncertainty_score":0.99969393},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000049648415,0.00008680615,0.9955524,0.0004890474,0.0016563323,0.0005360651,0.000004872438,0.0002007218,0.0014687821],"genre_scores_gemma":[0.0022275592,0.0000078835465,0.9941754,0.0029604698,0.0003989527,0.000010714598,0.000012213031,0.00003996831,0.0001668789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956491,0.000074424584,0.0004724872,0.0018825684,0.0011494579,0.00077193946],"domain_scores_gemma":[0.99700356,0.00056460354,0.00031091447,0.0016512257,0.00029097902,0.00017874599],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016086125,0.0006374747,0.0006729066,0.00089833693,0.0003387764,0.0012441394,0.0031834422,0.0001998552,0.000016342165],"category_scores_gemma":[0.000100411125,0.0005314795,0.00012879354,0.00066751527,0.0003571691,0.00077908486,0.0012806954,0.00071087014,0.000022062042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003085428,0.00002689155,0.000028039069,0.00006650768,0.000024983461,0.00016351684,0.00015602756,0.14402042,0.000035516136,0.0025357106,0.00002357606,0.8528879],"study_design_scores_gemma":[0.001295509,0.0001871144,0.000025447936,0.00046473488,0.000023217819,0.000038744813,1.2082516e-7,0.97514546,0.0008876749,0.016328216,0.004767988,0.00083575107],"about_ca_topic_score_codex":0.00007281151,"about_ca_topic_score_gemma":0.0002854317,"teacher_disagreement_score":0.8520522,"about_ca_system_score_codex":0.00019991638,"about_ca_system_score_gemma":0.00033217622,"threshold_uncertainty_score":0.99979264},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018749326,0.00043288223,0.9830422,0.00074729254,0.00223403,0.00043858984,0.0000018643622,0.00052299997,0.012561421],"genre_scores_gemma":[0.0191161,0.00018598454,0.9719118,0.0026051297,0.001360488,0.000043039763,0.0000073151905,0.000068130365,0.004702028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99538314,0.000076118304,0.0006704474,0.0017592106,0.001044139,0.0010669278],"domain_scores_gemma":[0.9970081,0.00022246392,0.00024758762,0.0020408842,0.00025050304,0.00023045937],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014367863,0.00058130507,0.0006581945,0.0010269309,0.0002604847,0.00096715306,0.0054156403,0.00044330378,0.000017914723],"category_scores_gemma":[0.00005181189,0.00051689026,0.00016785711,0.0013663861,0.00021681318,0.0009835043,0.0017778694,0.0009498588,0.00004954977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028572772,0.00007842191,0.00012928342,0.000082596525,0.000019092146,0.0002559654,0.0007006259,0.08506459,0.000042800297,0.006643062,0.0062278043,0.9007529],"study_design_scores_gemma":[0.0001290291,0.00008046857,0.0000058080564,0.00037090716,0.00000324056,0.00014059478,7.688504e-8,0.877351,0.00020792705,0.105821215,0.015291614,0.00059812685],"about_ca_topic_score_codex":0.00012063956,"about_ca_topic_score_gemma":0.00012532035,"teacher_disagreement_score":0.90015477,"about_ca_system_score_codex":0.0006574213,"about_ca_system_score_gemma":0.0011923437,"threshold_uncertainty_score":0.99996555},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003056797,0.0007141968,0.99597096,0.00015871695,0.0008346714,0.00075756694,0.000023481727,0.00012924681,0.001105465],"genre_scores_gemma":[0.39348364,0.00037843987,0.6050647,0.00042087294,0.00018485873,0.000058149748,0.000013606406,0.00008851233,0.00030726191],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952907,0.000051811137,0.0006769899,0.0016668672,0.0012943778,0.0010192754],"domain_scores_gemma":[0.9956095,0.0015226802,0.0003592142,0.0017588754,0.0004950196,0.00025466635],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010894892,0.0005766409,0.0007602987,0.0019855998,0.00037411094,0.00013424744,0.0051756673,0.0003368539,0.000006502128],"category_scores_gemma":[0.00013509383,0.0005373391,0.00031336249,0.0015028004,0.0027762763,0.0006433471,0.0009707789,0.00086376944,0.00000838911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000760936,0.00007015275,0.00026841162,0.00016469818,0.00004491073,0.00013199293,0.0010472359,0.034013435,0.00040138225,0.3842227,0.000036112368,0.5795229],"study_design_scores_gemma":[0.00058850297,0.0006041056,0.00018403349,0.00038187418,0.000009170193,0.00009852927,5.781243e-7,0.14435446,0.0068618082,0.8443078,0.0018021554,0.00080699776],"about_ca_topic_score_codex":0.000018888297,"about_ca_topic_score_gemma":0.00007113987,"teacher_disagreement_score":0.5787159,"about_ca_system_score_codex":0.00014881084,"about_ca_system_score_gemma":0.00056495215,"threshold_uncertainty_score":0.9999376},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038304157,0.009526456,0.19186148,0.010673428,0.0061452165,0.0010265365,0.00011561445,0.0013044237,0.7789638],"genre_scores_gemma":[0.70418864,0.00064355385,0.030377712,0.027560087,0.017441856,0.000030867046,0.00008644112,0.0002452505,0.2194256],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99830955,0.000007416527,0.00023942917,0.00068036705,0.00036510508,0.00039811572],"domain_scores_gemma":[0.9990217,0.0000408443,0.00016880485,0.0005533623,0.0001498005,0.0000655031],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014929187,0.00035490474,0.00035299707,0.0002587659,0.00042616777,0.0002951769,0.0009847531,0.00031050184,0.00046110092],"category_scores_gemma":[0.0000228659,0.00027579942,0.00010395331,0.00004022085,0.001396903,0.00018406012,0.00020760315,0.00076513336,0.00011473697],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057877414,0.00003358405,0.000028711125,0.000032773383,0.000016266984,0.00012030664,0.009140756,0.00048992684,0.0000106566995,0.176163,0.0021647324,0.8117935],"study_design_scores_gemma":[0.00012822528,0.00013813161,0.000027101387,0.0003102319,0.00001424789,0.000025179259,0.000012638523,0.00088234595,0.00007602466,0.31063735,0.687221,0.0005275239],"about_ca_topic_score_codex":0.000021972546,"about_ca_topic_score_gemma":0.0020543707,"teacher_disagreement_score":0.81126595,"about_ca_system_score_codex":0.00009057023,"about_ca_system_score_gemma":0.000078342295,"threshold_uncertainty_score":0.9999694},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37575278,0.00059701246,0.6194566,0.00073172525,0.0007939665,0.00071839534,0.00026185918,0.00026277654,0.0014249125],"genre_scores_gemma":[0.9823944,0.000069303605,0.015936123,0.0012770282,0.0000362838,0.000023608576,0.00020302387,0.000026277294,0.00003394666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987633,0.000017848233,0.0003874316,0.00027941636,0.00034384633,0.00020814325],"domain_scores_gemma":[0.99916947,0.00033992075,0.00008361492,0.0003067514,0.000072596646,0.00002767478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035535617,0.00018634158,0.00018744123,0.00040123033,0.000087609005,0.0000466091,0.00064067397,0.00008093265,0.00008127635],"category_scores_gemma":[0.000022982287,0.00016789437,0.000034469937,0.000793652,0.0003362223,0.0001451761,0.00005139112,0.0005597645,0.0000014937807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.920373e-7,0.000014368058,0.0007436949,0.00005242388,0.000007466437,0.0000045644088,0.004829207,0.9594426,0.00095806504,0.0028543547,0.000086360626,0.031005861],"study_design_scores_gemma":[0.00064138486,0.00013385902,0.013732537,0.00041354244,0.000024631909,0.000012058889,0.000050249448,0.90551037,0.005430312,0.019770822,0.05322142,0.0010587933],"about_ca_topic_score_codex":0.00012612807,"about_ca_topic_score_gemma":0.00056361576,"teacher_disagreement_score":0.60664165,"about_ca_system_score_codex":0.00011451182,"about_ca_system_score_gemma":0.00010534807,"threshold_uncertainty_score":0.68465334},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005454392,0.0001878978,0.9897395,0.0004898648,0.0014139912,0.0018818558,0.000044770044,0.00014759113,0.0006401414],"genre_scores_gemma":[0.5523067,0.00001392877,0.44198743,0.0027220317,0.0007200148,0.00031866823,0.00075602485,0.00010800387,0.0010672199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818593,0.000013839321,0.0002838659,0.0006798499,0.00052476884,0.00031171643],"domain_scores_gemma":[0.99916905,0.00009988352,0.00014832943,0.00036402137,0.00012030109,0.000098420765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024381671,0.00028435586,0.0003225553,0.00041536323,0.0002777908,0.00007782307,0.00016508793,0.00014573008,0.00013005346],"category_scores_gemma":[0.000013173032,0.00028056587,0.00015964241,0.00014028333,0.000082130515,0.0001456862,0.00010891294,0.00023343977,0.000011356778],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035872345,0.00028126745,0.00017661764,0.0004385058,0.000041241085,0.00024903356,0.00057250296,0.018610986,0.03219897,0.0013909611,0.000024662284,0.94565654],"study_design_scores_gemma":[0.022404613,0.028034778,0.00046880386,0.002595226,0.0009819794,0.000528583,0.0000049058294,0.79802465,0.11135937,0.028308053,0.0047876523,0.0025014034],"about_ca_topic_score_codex":0.0000051166826,"about_ca_topic_score_gemma":0.000078471836,"teacher_disagreement_score":0.9431551,"about_ca_system_score_codex":0.0005811648,"about_ca_system_score_gemma":0.0002705384,"threshold_uncertainty_score":0.99996465},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013070153,0.00018569204,0.9839471,0.007058228,0.0016071404,0.00044650768,0.000008408397,0.00026767404,0.006348548],"genre_scores_gemma":[0.34829283,0.000052620304,0.6371866,0.013061971,0.00073308643,0.00009514037,0.000017568915,0.00017884477,0.00038135677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99202776,0.00027926278,0.00096156355,0.0025707032,0.00302241,0.0011382886],"domain_scores_gemma":[0.99470496,0.00269261,0.00045065433,0.0015786041,0.00022278569,0.00035039597],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028538255,0.00082997984,0.0009850719,0.0014750543,0.0005849461,0.0007759567,0.0063734166,0.0005560515,0.0018691401],"category_scores_gemma":[0.0016095722,0.00082162675,0.00022573832,0.0017597425,0.0009332249,0.0008060812,0.0019308119,0.0029600088,0.00011065155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004246515,0.00014655474,0.00046500246,0.00015097614,0.000030603842,0.0024815183,0.0011656873,0.3814963,0.00008297277,0.0057367585,0.00023885214,0.6079623],"study_design_scores_gemma":[0.0005048019,0.000103105325,0.00012827961,0.0005602096,0.000009497902,0.00007446206,4.4718504e-7,0.9875506,0.0007009142,0.00617954,0.0032526874,0.00093543995],"about_ca_topic_score_codex":0.00014258317,"about_ca_topic_score_gemma":0.00028518282,"teacher_disagreement_score":0.6070269,"about_ca_system_score_codex":0.0009896698,"about_ca_system_score_gemma":0.003239048,"threshold_uncertainty_score":0.99942344},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001882792,0.0003180333,0.9898992,0.0011061275,0.0019824938,0.00050454075,0.000020039179,0.0002399536,0.0059107663],"genre_scores_gemma":[0.0447294,0.000082102866,0.94933265,0.0026580226,0.00072384736,0.000046881138,0.00021833232,0.00008965864,0.0021190832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99548024,0.00008322946,0.0005281868,0.0019367104,0.0013003962,0.0006712135],"domain_scores_gemma":[0.9959832,0.00083741196,0.00041941073,0.0024514478,0.00013649305,0.00017206052],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0020260336,0.00044436828,0.0004330473,0.0006686637,0.00088119134,0.00065076555,0.008494324,0.00019485826,0.00016041884],"category_scores_gemma":[0.0003485795,0.0004380658,0.00011383888,0.00046062752,0.00032204197,0.0012138988,0.008682263,0.0013186282,0.000020417941],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017824937,0.000026254593,0.00003971953,0.00003810096,0.000014791428,0.00003636192,0.00084357016,0.047134083,0.00039055804,0.032453194,0.00034383163,0.9186617],"study_design_scores_gemma":[0.0005072145,0.00021190717,0.000018869236,0.00009608274,0.0000073037427,0.000030680258,0.0000011392189,0.8281438,0.00014767598,0.026499696,0.14384788,0.00048779242],"about_ca_topic_score_codex":0.000027918539,"about_ca_topic_score_gemma":0.000033152155,"teacher_disagreement_score":0.9181739,"about_ca_system_score_codex":0.00035028587,"about_ca_system_score_gemma":0.0005119091,"threshold_uncertainty_score":0.9998071},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044958422,0.00012051995,0.9956302,0.00022709904,0.0006350573,0.0021727206,0.000042772765,0.00019650973,0.00093013694],"genre_scores_gemma":[0.033873454,0.0000029290893,0.96415603,0.0012449546,0.00022283963,0.0001162801,0.000020198888,0.00006365447,0.00029964515],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99410886,0.0002290819,0.0006305574,0.0023754565,0.0017798701,0.00087620225],"domain_scores_gemma":[0.9938885,0.003095344,0.00033755568,0.00167708,0.00073797215,0.00026354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003841298,0.00068771705,0.0006379953,0.0011411601,0.0005003343,0.00030551892,0.0037445338,0.00025606426,0.000028172208],"category_scores_gemma":[0.00011516655,0.0005954888,0.00021176688,0.0007260262,0.001018128,0.00045535175,0.0011052178,0.00093968207,0.000046652454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044068955,0.00033733516,0.00003343516,0.000024622308,0.000023957697,0.00007171076,0.0004706334,0.039512362,0.00000542388,0.21375762,0.000009921999,0.7457089],"study_design_scores_gemma":[0.0005498195,0.0009887532,0.00017853534,0.00014227262,0.0000064064884,0.000010411805,2.697084e-7,0.38023648,0.000109257926,0.61717016,0.00015612395,0.0004515354],"about_ca_topic_score_codex":0.000006559235,"about_ca_topic_score_gemma":0.000009286959,"teacher_disagreement_score":0.7452574,"about_ca_system_score_codex":0.00031371842,"about_ca_system_score_gemma":0.0009323349,"threshold_uncertainty_score":0.99964964},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049904513,0.0010301153,0.963004,0.0003726312,0.0023552347,0.0004608636,0.0000030627455,0.00029638567,0.032427803],"genre_scores_gemma":[0.15182267,0.0000459619,0.8444974,0.0023679053,0.0009451605,0.00000797977,0.000005498842,0.00005077758,0.00025666007],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952851,0.000040994528,0.0006290487,0.0020264017,0.0010012947,0.001017186],"domain_scores_gemma":[0.9968884,0.00028950346,0.0004574757,0.001835519,0.00027210635,0.0002569668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008249206,0.00068611966,0.0006720191,0.0007339181,0.0003957347,0.00073803775,0.005151652,0.0004093611,0.00006228966],"category_scores_gemma":[0.000055838413,0.0005702129,0.00019001719,0.0006573198,0.00089377945,0.00059191696,0.0026812903,0.0010363043,0.0001498574],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033652382,0.000032065174,0.000066837994,0.000026007763,0.000010921045,0.00029661536,0.0010952338,0.0019262003,0.0000073936094,0.04018353,0.000042275202,0.95630956],"study_design_scores_gemma":[0.00043619296,0.0004899374,0.00035203286,0.00072311814,0.000014775851,0.0003579116,2.4998366e-7,0.4879362,0.00054798956,0.50277936,0.00473014,0.0016320852],"about_ca_topic_score_codex":0.000026200838,"about_ca_topic_score_gemma":0.000013891897,"teacher_disagreement_score":0.95467746,"about_ca_system_score_codex":0.00021984051,"about_ca_system_score_gemma":0.00052651204,"threshold_uncertainty_score":0.9996749},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060643863,0.0022106164,0.9877975,0.0074958205,0.00047048298,0.00065432966,0.0002112853,0.00049831724,0.00060103234],"genre_scores_gemma":[0.0065837796,0.00058414397,0.9910443,0.0011496997,0.00029171343,0.00008558118,0.00015227133,0.000034093784,0.00007441558],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99517983,0.00007447403,0.0004099388,0.0028495998,0.0008640698,0.0006220773],"domain_scores_gemma":[0.9791388,0.0008581021,0.00025194115,0.019527692,0.000078067875,0.00014540993],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015272785,0.00042308265,0.00043518672,0.0006704682,0.0005534264,0.0008245353,0.074048005,0.00026142626,0.000012493706],"category_scores_gemma":[0.0036140347,0.00042459884,0.000026620834,0.0013970175,0.0014144094,0.0013587992,0.41680774,0.0013843761,0.000005604158],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002290659,0.000053540203,0.00029477323,0.00013263378,0.000014972954,0.000051803683,0.00038551717,0.000119220385,0.000019547928,0.0039704535,0.015343357,0.9796119],"study_design_scores_gemma":[0.00010962438,0.000042220774,0.00007623001,0.000049254046,0.000005306825,0.000096767006,2.777816e-7,0.393556,0.000035901714,0.55234754,0.053330753,0.00035013087],"about_ca_topic_score_codex":0.000021400458,"about_ca_topic_score_gemma":0.000034311008,"teacher_disagreement_score":0.97926176,"about_ca_system_score_codex":0.00029641826,"about_ca_system_score_gemma":0.0008380154,"threshold_uncertainty_score":0.9998206},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008794865,0.00014872893,0.981124,0.010662649,0.0029112967,0.0003947931,0.00001769765,0.00093693566,0.0037159445],"genre_scores_gemma":[0.09928868,0.000047082256,0.89886856,0.0013875662,0.00020362705,0.000026152105,0.000040804225,0.000053395263,0.000084152576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929797,0.00012270211,0.0008040558,0.0026343784,0.0023741454,0.0010850165],"domain_scores_gemma":[0.98806095,0.0015912083,0.00063489005,0.009313549,0.00021783503,0.00018157589],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016041951,0.0007798469,0.0006701814,0.0013777236,0.00072169246,0.0021743386,0.051410932,0.0004943855,0.0003987048],"category_scores_gemma":[0.00499144,0.000783426,0.00016520554,0.0012496541,0.001049719,0.003023479,0.11761887,0.0022511433,0.000034841283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008816862,0.000113059235,0.0002807949,0.0000945777,0.00007997263,0.0002045172,0.00036080697,0.11337738,0.0002573743,0.5310433,0.0005172392,0.3536622],"study_design_scores_gemma":[0.00013997187,0.000047580786,0.0003753332,0.000121812416,0.000007299175,0.000026590971,1.880006e-7,0.45525953,0.00014384504,0.5427956,0.0005659885,0.0005162274],"about_ca_topic_score_codex":0.000043934713,"about_ca_topic_score_gemma":0.00005527096,"teacher_disagreement_score":0.35314596,"about_ca_system_score_codex":0.0011475472,"about_ca_system_score_gemma":0.0015343329,"threshold_uncertainty_score":0.99946165},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027796317,0.00028248804,0.9912367,0.0012284073,0.0016788791,0.0010230958,0.0000091650845,0.00013115033,0.0043823477],"genre_scores_gemma":[0.37024716,0.000141206,0.6158391,0.005501911,0.0021886816,0.00006354521,0.00010443605,0.00015571072,0.005758254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544615,0.000096644566,0.00090320077,0.0017641691,0.0011080892,0.0006817627],"domain_scores_gemma":[0.99668366,0.0010456062,0.00063628855,0.0011928357,0.00028688094,0.00015471295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023607907,0.0005413886,0.0009698409,0.001102914,0.00027530766,0.00081832963,0.0026389896,0.00021447419,0.00015602638],"category_scores_gemma":[0.0003752421,0.00049765914,0.00047880405,0.00075140473,0.0002618149,0.0007168798,0.001156949,0.00060642604,0.00004363538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007635428,0.000070462636,0.00008887626,0.00007195626,0.000075611984,0.00006587222,0.0009858797,0.26009905,0.00026295375,0.06960812,0.00011593152,0.66847897],"study_design_scores_gemma":[0.0011845706,0.00021533054,0.000012619907,0.00012424332,0.00003325692,0.000022845314,2.4823103e-7,0.9079541,0.00019945111,0.08296242,0.0067866724,0.00050422194],"about_ca_topic_score_codex":0.000025939642,"about_ca_topic_score_gemma":0.00007858884,"teacher_disagreement_score":0.6679747,"about_ca_system_score_codex":0.00049990165,"about_ca_system_score_gemma":0.0003722457,"threshold_uncertainty_score":0.9997475},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96389276,0.00011931498,0.027462326,0.00021003372,0.0012659479,0.0006864048,0.0000026567084,0.00009989356,0.006260656],"genre_scores_gemma":[0.9981341,0.000050740193,0.0009579454,0.00007135206,0.000110749286,0.000027777476,0.00000494065,0.000014082436,0.0006283498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953888,0.00023962802,0.00071895425,0.00084371545,0.0023836233,0.00042528758],"domain_scores_gemma":[0.9968616,0.0016220544,0.00060395844,0.00065934,0.00015968438,0.000093412695],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0037316862,0.0003559745,0.00045825922,0.00059927156,0.0013044438,0.00055825565,0.0022172593,0.00011697717,0.00037992865],"category_scores_gemma":[0.00044529056,0.0002145776,0.00015087893,0.00046500374,0.0005477314,0.000605619,0.00091395807,0.0012344265,0.00004374847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030901164,0.000023003131,0.002542511,0.000026140624,0.000011419389,0.000013649311,0.0025403409,0.3855056,0.002004824,0.0016248972,0.0000071429354,0.6053915],"study_design_scores_gemma":[0.0013849026,0.006102418,0.01622288,0.00047758757,0.000024924044,0.000017482816,0.000058789312,0.9586103,0.0068362206,0.0042870855,0.004904202,0.0010732404],"about_ca_topic_score_codex":0.0000061611154,"about_ca_topic_score_gemma":0.0000039882634,"teacher_disagreement_score":0.60431826,"about_ca_system_score_codex":0.0001648139,"about_ca_system_score_gemma":0.00006551161,"threshold_uncertainty_score":0.9999957},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32984224,0.0059005274,0.29128894,0.34708974,0.0017369436,0.017118571,0.00024363628,0.0026382136,0.0041411715],"genre_scores_gemma":[0.99816805,0.00013177986,0.00075727544,0.00084143755,0.000018631112,0.00005577527,0.000005199379,0.000009042442,0.000012814747],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99808836,0.00013590456,0.00028089283,0.0003414623,0.0008935401,0.00025985905],"domain_scores_gemma":[0.99769074,0.00093189126,0.00049102015,0.0007085572,0.00014713017,0.000030680047],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0009010562,0.00019782562,0.00023712413,0.00025949892,0.001814739,0.00013830193,0.0025013203,0.00023278652,0.00000742322],"category_scores_gemma":[0.00050117297,0.00012417707,0.00002443428,0.00069953664,0.0040899697,0.00037417276,0.0013374666,0.0008364269,3.9706234e-7],"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.00004029169,0.0001249085,0.0054063997,0.00010700179,0.000040671053,0.0000030771612,0.638248,0.0012603087,0.0000042302204,0.01810303,0.001023883,0.33563817],"study_design_scores_gemma":[0.025281068,0.004524327,0.044638027,0.0055326144,0.0008145299,0.000163525,0.13704985,0.010187123,0.0016353799,0.31249106,0.44754946,0.010133016],"about_ca_topic_score_codex":0.00091794773,"about_ca_topic_score_gemma":0.016326701,"teacher_disagreement_score":0.6683258,"about_ca_system_score_codex":0.00027901717,"about_ca_system_score_gemma":0.00045850096,"threshold_uncertainty_score":0.9994848},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004361427,0.00027103434,0.98808974,0.0011017821,0.0040134736,0.00059932424,0.000020813666,0.00005812011,0.0058021126],"genre_scores_gemma":[0.25561002,0.000099605044,0.7276202,0.0092177605,0.0016063018,0.00019874875,0.0000776757,0.00015744533,0.0054122964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964399,0.000037343463,0.00038963158,0.0015497446,0.00086011074,0.0007232809],"domain_scores_gemma":[0.9975964,0.0005129355,0.00029909765,0.0010619295,0.00039665852,0.0001330229],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072974403,0.0004932524,0.00045859773,0.00077611796,0.0005337604,0.00050665607,0.003067338,0.00019871304,0.000118465556],"category_scores_gemma":[0.00013185659,0.0004893681,0.00025535215,0.0004480251,0.00035530824,0.001289154,0.0013819091,0.00076390046,0.000041995925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010326733,0.00015217326,0.000098023345,0.00015493775,0.00008418684,0.00016301339,0.0038759212,0.036733747,0.010987255,0.45718947,0.0015666863,0.4888913],"study_design_scores_gemma":[0.0009415934,0.0011667657,0.0003079784,0.00038932983,0.000038906317,0.00016447275,0.0000022394177,0.6034816,0.014595077,0.280185,0.09675162,0.001975422],"about_ca_topic_score_codex":0.000032808162,"about_ca_topic_score_gemma":0.000031982494,"teacher_disagreement_score":0.56674784,"about_ca_system_score_codex":0.00067544833,"about_ca_system_score_gemma":0.00057745114,"threshold_uncertainty_score":0.9997558},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13697146,0.013869219,0.80191195,0.009253953,0.006818402,0.014368694,0.0015319972,0.0050905296,0.010183768],"genre_scores_gemma":[0.9586377,0.0001110619,0.03982625,0.00026560956,0.00052426104,0.00010756676,0.00015272583,0.000072709314,0.00030211403],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957957,0.000026455045,0.00047059634,0.0017741193,0.0009390017,0.0009940872],"domain_scores_gemma":[0.99785286,0.00078415946,0.00028039134,0.00062875665,0.00022365704,0.00023019256],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00032748264,0.0005455285,0.0005701024,0.0005356543,0.000947957,0.0013759852,0.0015471474,0.00056784344,0.000029141775],"category_scores_gemma":[0.0003647183,0.0005367455,0.00016419702,0.00055888854,0.0017002685,0.0010846579,0.0009209656,0.0007955132,0.0000022741388],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023340754,0.000025198977,0.00064690056,0.000020039244,0.00001568159,0.000026395897,0.09106044,0.000020326324,0.0000017131938,0.00021842362,0.000016254084,0.9079253],"study_design_scores_gemma":[0.00860496,0.0020958225,0.0024712728,0.012068935,0.00020328487,0.00017826956,0.0038851197,0.014833704,0.00022976307,0.23177111,0.7149093,0.008748425],"about_ca_topic_score_codex":0.0001814124,"about_ca_topic_score_gemma":0.0004905727,"teacher_disagreement_score":0.89917684,"about_ca_system_score_codex":0.00058586616,"about_ca_system_score_gemma":0.0006029207,"threshold_uncertainty_score":0.9997084},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.0964373e-7,0.81783026,0.17339052,0.00013493332,0.0010709342,0.0068766796,0.0006519696,0.000013667331,0.000030387717],"genre_scores_gemma":[0.0008760632,0.9948245,0.0011751442,0.0002130769,0.000082869534,0.0026969768,0.000076821176,0.000029180579,0.000025360634],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.9929568,0.0017954151,0.0038183685,0.0005809398,0.00046257256,0.0003859065],"domain_scores_gemma":[0.9813442,0.014729565,0.0028677355,0.0008095371,0.00016893125,0.000079979334],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.012910989,0.00035306558,0.0047565885,0.00035521388,0.0001788876,0.00015166005,0.0011872603,0.00012362043,0.00005212946],"category_scores_gemma":[0.011093677,0.000194287,0.0020367685,0.001101305,0.00046755452,0.0001330053,0.0003719634,0.00033894475,0.0000016681005],"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.000010573773,0.00012630144,0.000001272806,0.48976946,0.00013318901,6.449106e-7,0.00006854879,0.000002087619,1.02185185e-8,0.00018455162,0.000035729594,0.50966763],"study_design_scores_gemma":[0.0008675866,0.000774995,0.0000010672385,0.9831655,0.001139297,0.000057821308,0.0000109535,0.00021239289,0.0000010417122,0.0019951889,0.011524882,0.00024924474],"about_ca_topic_score_codex":0.0000043524255,"about_ca_topic_score_gemma":0.0000103357725,"teacher_disagreement_score":0.50941837,"about_ca_system_score_codex":0.00013271731,"about_ca_system_score_gemma":0.0002224102,"threshold_uncertainty_score":0.9972363},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0099499915,0.00031436817,0.80502576,0.16593447,0.0068223844,0.0035710447,0.00013915611,0.0009363736,0.0073064705],"genre_scores_gemma":[0.4888924,0.00024926776,0.14951149,0.33860523,0.002293073,0.00039829468,0.000030817675,0.00035483303,0.019664587],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933392,0.00012036179,0.00059228326,0.0023175047,0.0021516874,0.0014790066],"domain_scores_gemma":[0.99656427,0.0006359114,0.0002516658,0.0015870519,0.00036886788,0.000592256],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012609359,0.0007064498,0.00078563526,0.0016738579,0.0011753367,0.0006630589,0.0036421665,0.00065077835,0.00097524637],"category_scores_gemma":[0.00074032263,0.00071994844,0.00022324592,0.0023476696,0.0010272991,0.00063230103,0.002180405,0.001346006,0.00023338101],"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.00013458647,0.00031154067,0.005300466,0.0001129248,0.00012582963,0.00049974705,0.49576107,0.0076505993,0.00027826458,0.013506861,0.07798325,0.39833486],"study_design_scores_gemma":[0.0005874681,0.00046517362,0.005464782,0.0007570391,0.000041490122,0.000041070823,0.000048586386,0.0009251687,0.00035040645,0.013756628,0.9755316,0.0020306208],"about_ca_topic_score_codex":0.0054759285,"about_ca_topic_score_gemma":0.0675417,"teacher_disagreement_score":0.8975483,"about_ca_system_score_codex":0.0010289246,"about_ca_system_score_gemma":0.0010535087,"threshold_uncertainty_score":0.999938},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011439808,0.00021208773,0.9953963,0.000367591,0.0015173808,0.0004477622,0.0000067775622,0.0010498915,0.0009907323],"genre_scores_gemma":[0.005028294,0.000039234536,0.9937048,0.0006959785,0.00017753232,0.00006594748,0.000018182973,0.000035526682,0.00023453595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650383,0.000055633296,0.00046540794,0.0011327055,0.001233375,0.00060906337],"domain_scores_gemma":[0.99795264,0.00017682584,0.00016650237,0.0014625255,0.00011633393,0.00012514337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009942434,0.0004352477,0.0004076881,0.001330697,0.00025804862,0.00035738098,0.0047051096,0.00022183539,0.00002870998],"category_scores_gemma":[0.000011229712,0.0004476406,0.00014494525,0.0016618625,0.00025035042,0.00093973667,0.0010853611,0.0010923285,0.000012205764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014181397,0.000022328351,0.0000062357544,0.000049552094,0.000005255871,0.000036834088,0.0013997776,0.13798478,0.000036315196,0.049985286,0.00025345595,0.81021875],"study_design_scores_gemma":[0.00016458574,0.00017974287,0.000034317723,0.00015958885,0.0000050416547,0.00008444278,3.1916375e-8,0.77618647,0.0011359886,0.1527799,0.06850916,0.0007606988],"about_ca_topic_score_codex":0.000012835546,"about_ca_topic_score_gemma":0.000007914267,"teacher_disagreement_score":0.8094581,"about_ca_system_score_codex":0.00078898674,"about_ca_system_score_gemma":0.00083881884,"threshold_uncertainty_score":0.9997975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003546805,0.0004886114,0.9897337,0.0005799524,0.0036052235,0.0010296887,0.0000047375056,0.00025458555,0.00075668877],"genre_scores_gemma":[0.19945142,0.00003460018,0.79585296,0.0013040063,0.0027592399,0.00011033038,0.000014866455,0.0001423147,0.00033024687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582416,0.000029802637,0.0004948974,0.0019895365,0.00085485744,0.0008067443],"domain_scores_gemma":[0.99745196,0.0008266908,0.000292287,0.00105036,0.0001395651,0.00023911771],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001066089,0.00064374466,0.0006750484,0.0006146562,0.00079288345,0.00065687485,0.001686249,0.00021894397,0.0000013974974],"category_scores_gemma":[0.00004036215,0.00051543454,0.00008563425,0.0004068646,0.0006275565,0.00030129164,0.0021796264,0.0008931076,0.0000013747158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070030175,0.000034711684,0.00032026658,0.00053848105,0.000042100386,0.00012429677,0.004836874,0.035190415,0.000041111583,0.013152594,0.00007212084,0.945577],"study_design_scores_gemma":[0.001626561,0.0018161539,0.0004915077,0.0014662181,0.00005298027,0.0013065046,0.0000042300567,0.9263043,0.0005216104,0.03664993,0.027710982,0.0020490652],"about_ca_topic_score_codex":0.000036573587,"about_ca_topic_score_gemma":0.000027617914,"teacher_disagreement_score":0.94352794,"about_ca_system_score_codex":0.0004169016,"about_ca_system_score_gemma":0.00044121212,"threshold_uncertainty_score":0.99972975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016780471,0.00062723045,0.8860665,0.0009712904,0.07387747,0.007885033,0.000103997496,0.00034158968,0.028448869],"genre_scores_gemma":[0.712429,0.000041722273,0.06516634,0.007667405,0.0031279468,0.013023206,0.00052818167,0.0002768633,0.19773932],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971581,0.000025500238,0.00035644407,0.0012733297,0.0008081222,0.0003784653],"domain_scores_gemma":[0.998373,0.00028714738,0.0002931079,0.0008057856,0.00015575162,0.00008520856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037238115,0.0003177809,0.00025073203,0.0006374569,0.00032932116,0.00008119386,0.0015125365,0.00019093727,0.00061488483],"category_scores_gemma":[0.000017476139,0.00033081975,0.00008259764,0.00034825335,0.00015390906,0.00010043602,0.0008634471,0.0005568966,0.000059152422],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000523471,0.00023475007,0.00064912497,0.00005333604,0.00003259742,0.0000050017948,0.0012291374,0.004233705,0.000031530908,0.020635441,0.0037868859,0.9690561],"study_design_scores_gemma":[0.001821826,0.0017989266,0.02012996,0.0020136493,0.00021227884,0.00004284661,0.000107306936,0.0036288302,0.0011665983,0.14606065,0.8201488,0.0028682943],"about_ca_topic_score_codex":0.00005791483,"about_ca_topic_score_gemma":0.00002604285,"teacher_disagreement_score":0.96618783,"about_ca_system_score_codex":0.0007216997,"about_ca_system_score_gemma":0.00012344023,"threshold_uncertainty_score":0.9999144},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044206074,0.0013101583,0.9904845,0.0007004907,0.0013114548,0.0007765067,0.000047509136,0.00018188212,0.00076693716],"genre_scores_gemma":[0.39262393,0.000057053017,0.6012641,0.0050024255,0.0006618272,0.000070442344,0.000034566136,0.000072174036,0.00021344032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561906,0.00011881029,0.000795639,0.0013923314,0.0012103232,0.000863843],"domain_scores_gemma":[0.99778265,0.00046314317,0.0003533545,0.0009084424,0.00030369492,0.00018874453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001039631,0.0005354933,0.0007794257,0.0014127743,0.00029117783,0.00029764167,0.0028185262,0.0002572024,0.00018479368],"category_scores_gemma":[0.000121774436,0.000566916,0.00017461319,0.0014033671,0.0006030455,0.0007711895,0.00216396,0.0010238024,0.000007912383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000752475,0.00017556058,0.0011703509,0.00019343944,0.00004603342,0.0006443601,0.0067805746,0.19817975,0.0019905262,0.018395673,0.00047693483,0.77187157],"study_design_scores_gemma":[0.00070646545,0.0005358473,0.0009837501,0.0016389554,0.000021115513,0.00021675939,0.0000066991206,0.8807455,0.0038900513,0.10788403,0.0018236531,0.0015472203],"about_ca_topic_score_codex":0.00017081515,"about_ca_topic_score_gemma":0.00034145304,"teacher_disagreement_score":0.77032435,"about_ca_system_score_codex":0.00054976007,"about_ca_system_score_gemma":0.00057771645,"threshold_uncertainty_score":0.99967825},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01239178,0.0014764366,0.9816807,0.0009715262,0.0011507766,0.0014335942,0.00007127004,0.0000756656,0.0007482486],"genre_scores_gemma":[0.99257267,0.00024172376,0.0064228144,0.0003476766,0.00012232001,0.00014351569,0.000011541601,0.000056252855,0.00008148653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955619,0.00008944388,0.0006075939,0.001628274,0.0012917088,0.0008210955],"domain_scores_gemma":[0.9963823,0.0025140718,0.00026248823,0.0006258196,0.00004869976,0.00016662496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009789862,0.00046733237,0.0005773651,0.0008907276,0.00063170784,0.0001726163,0.0014624072,0.00022310723,0.00015483357],"category_scores_gemma":[0.00034991078,0.00044741074,0.00018206664,0.00066783745,0.0021915599,0.00017780019,0.0014905522,0.001160383,0.0000014786001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106482556,0.00026258585,0.005039454,0.00033772393,0.000030696003,0.00018215938,0.0016524397,0.34383148,0.0018672203,0.27926257,0.000029731287,0.36739746],"study_design_scores_gemma":[0.00062834297,0.0005934573,0.0037648634,0.0005453983,0.000029196985,0.00012964536,0.0000011357245,0.90505,0.006505757,0.08166546,0.0001589745,0.00092781405],"about_ca_topic_score_codex":0.000031835316,"about_ca_topic_score_gemma":0.000102553684,"teacher_disagreement_score":0.98018086,"about_ca_system_score_codex":0.0002843461,"about_ca_system_score_gemma":0.00038135436,"threshold_uncertainty_score":0.99979776},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023415089,0.902759,0.021775128,0.0064476677,0.0022206441,0.012548704,0.00033244042,0.00033511143,0.030166203],"genre_scores_gemma":[0.9956289,0.00044083598,0.0035553062,0.00010058542,0.00012933367,0.00005805713,0.00003435693,0.000029320365,0.000023328266],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746776,0.000038035327,0.00030016695,0.00057444535,0.0011698183,0.00044978087],"domain_scores_gemma":[0.9985438,0.00030114787,0.00013841581,0.00062258047,0.0001031004,0.00029095972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034915077,0.00025406363,0.0003241233,0.00034735305,0.00020492008,0.000046435285,0.0005247209,0.00006994363,0.00009448838],"category_scores_gemma":[0.00007285946,0.00016338196,0.00011905358,0.00027933167,0.00075340626,0.00009477957,0.0005269251,0.00053141615,0.000009086074],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006262856,0.00027452598,0.01877627,0.000036994417,0.00044188125,0.0005257311,0.0001544694,0.00072948047,0.00002722745,0.0017112092,0.000008335316,0.9766876],"study_design_scores_gemma":[0.017559951,0.011859985,0.1678854,0.013262807,0.00369966,0.0003942884,0.000023883262,0.2886693,0.031487517,0.4128243,0.04759148,0.0047414717],"about_ca_topic_score_codex":0.000025605,"about_ca_topic_score_gemma":0.000025016425,"teacher_disagreement_score":0.9722138,"about_ca_system_score_codex":0.00017690344,"about_ca_system_score_gemma":0.0010923564,"threshold_uncertainty_score":0.66625226},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4131541,0.00011479681,0.5839597,0.00010471819,0.0012423554,0.0012760673,0.000038094306,0.00001851507,0.00009165337],"genre_scores_gemma":[0.882578,0.0000013419209,0.11633654,0.00069319544,0.00008319181,0.00005200717,0.000018972005,0.00002873118,0.0002079897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943342,0.00007394735,0.0010646684,0.0016588009,0.002364589,0.00050379947],"domain_scores_gemma":[0.9959477,0.0018027031,0.0005453203,0.001275188,0.0003200391,0.00010900411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076860394,0.0003634546,0.0005279414,0.000748471,0.0012545226,0.0008299473,0.0021926446,0.0000753978,0.000045193985],"category_scores_gemma":[0.00048348578,0.00023379059,0.00008363195,0.0007935442,0.00053196674,0.00036820132,0.0033328622,0.00027980524,0.0000012209055],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002701796,0.00029722237,0.0036316654,0.00003442678,0.000051876727,0.00007253573,0.018803991,0.0075203143,0.00009343806,0.00033346663,0.001038918,0.9680951],"study_design_scores_gemma":[0.0047069266,0.0015534342,0.00063041045,0.00046750586,0.00012631548,0.00016586845,0.0014515014,0.73697776,0.0010739377,0.09933891,0.15065002,0.00285738],"about_ca_topic_score_codex":0.00004094051,"about_ca_topic_score_gemma":0.00014027786,"teacher_disagreement_score":0.96523774,"about_ca_system_score_codex":0.00018774507,"about_ca_system_score_gemma":0.00029341385,"threshold_uncertainty_score":0.96489006},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024684472,0.0008381651,0.9958424,0.00026511366,0.00092689384,0.0010559302,0.000018242923,0.00057880883,0.00044974772],"genre_scores_gemma":[0.18246433,0.0000029494608,0.81629866,0.0007189392,0.00024931037,0.0001226364,0.00001736471,0.000042314983,0.00008349577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99610275,0.000048999802,0.0004200523,0.0018826794,0.0009120268,0.00063349813],"domain_scores_gemma":[0.9973703,0.0006998576,0.00036938844,0.0011278425,0.00030990876,0.00012270611],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010566287,0.00054337096,0.0005015661,0.0009500141,0.0005533226,0.00044906707,0.003273458,0.0003008916,0.0000131897405],"category_scores_gemma":[0.0002774694,0.00049824547,0.00020296482,0.0006465536,0.00056979037,0.0006180712,0.0010606282,0.0010618952,0.0000016333928],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033521603,0.0000648601,0.0000038475955,0.000086516266,0.000011895322,0.000031886153,0.00076644146,0.02346851,0.00068585767,0.014186464,0.000005596214,0.9606546],"study_design_scores_gemma":[0.00038286357,0.00035304538,0.0000017917333,0.000100620455,0.00001305518,0.000042952113,6.4399995e-7,0.86389935,0.029734991,0.10432853,0.0004653689,0.00067678175],"about_ca_topic_score_codex":0.0000454638,"about_ca_topic_score_gemma":0.000050192364,"teacher_disagreement_score":0.9599778,"about_ca_system_score_codex":0.0006487465,"about_ca_system_score_gemma":0.00070604775,"threshold_uncertainty_score":0.9997469},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019940107,0.00021966307,0.99454737,0.0005808461,0.0019383272,0.0012573326,0.00003036156,0.0003314225,0.0010747119],"genre_scores_gemma":[0.1494015,0.000060223218,0.84601986,0.0016909182,0.0016135671,0.00047193916,0.000021718497,0.000058011152,0.000662244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681187,0.000040317496,0.00048179794,0.0015174599,0.0005557914,0.00059276656],"domain_scores_gemma":[0.9978526,0.00046354433,0.00039281798,0.0008812593,0.00027841958,0.00013135336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067748985,0.00044484518,0.0004517356,0.0004188095,0.0009759158,0.00032035113,0.0018776477,0.00026629324,0.000050216582],"category_scores_gemma":[0.00004788207,0.00045540516,0.00021474257,0.0007095845,0.00037565376,0.0004933213,0.00082927966,0.000692533,0.000009121651],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037442416,0.000034213794,0.000005633706,0.000014176738,0.000030712814,0.000013068682,0.00036398362,0.058894765,0.00076957885,0.071426935,0.00013037979,0.8682791],"study_design_scores_gemma":[0.0004815642,0.00082658615,0.00005784329,0.000054638786,0.00002290915,0.000056508445,4.031472e-7,0.7052785,0.008133233,0.23268491,0.051563445,0.000839447],"about_ca_topic_score_codex":0.000030718697,"about_ca_topic_score_gemma":0.00012360734,"teacher_disagreement_score":0.8674397,"about_ca_system_score_codex":0.00054752367,"about_ca_system_score_gemma":0.0004252106,"threshold_uncertainty_score":0.9997898},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008387687,0.003727742,0.9680625,0.024039317,0.0012900132,0.0006205284,0.000006652359,0.00027170067,0.0019731384],"genre_scores_gemma":[0.07046175,0.00085216697,0.90131825,0.026486216,0.0003712591,0.0000517713,0.000005745576,0.00005472258,0.0003981059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99578637,0.00018035196,0.0004435843,0.0020373524,0.00081667694,0.00073567766],"domain_scores_gemma":[0.9963444,0.0016141993,0.00026788018,0.0012369336,0.00018611616,0.0003505073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014909442,0.0005117775,0.00067405996,0.00077301526,0.0007810081,0.0003179977,0.002954483,0.00029801554,0.00005853481],"category_scores_gemma":[0.000436793,0.00046912822,0.000094383046,0.0005391378,0.0011694299,0.0004461968,0.0023239327,0.0010351947,0.000009458073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064248576,0.000037103768,0.0001886624,0.00009395563,0.000032556047,0.0007750398,0.011583907,0.017645253,0.000014739757,0.6843633,0.00010647124,0.28509474],"study_design_scores_gemma":[0.0006760819,0.0007408816,0.00030669835,0.00010653516,0.000014705945,0.00087160285,0.000011477933,0.14140007,0.00005770981,0.84528255,0.009496617,0.001035048],"about_ca_topic_score_codex":0.00061500387,"about_ca_topic_score_gemma":0.0006253238,"teacher_disagreement_score":0.2840597,"about_ca_system_score_codex":0.0013792028,"about_ca_system_score_gemma":0.0023147878,"threshold_uncertainty_score":0.99977607},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040421,0.00024803594,0.994218,0.0010554212,0.0022984508,0.0014944047,0.000037177888,0.00016136095,0.00044671076],"genre_scores_gemma":[0.033229347,0.0000140463035,0.9634276,0.0019523366,0.0008701675,0.00016728722,0.000077905286,0.00003686663,0.0002244535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633706,0.000073047435,0.00048134784,0.0014711034,0.0010746577,0.0005627691],"domain_scores_gemma":[0.9971463,0.000873545,0.00028695705,0.0011408016,0.00041297966,0.00013943516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015189062,0.0004167314,0.00034108816,0.00051682856,0.0009328378,0.0006433019,0.003108821,0.00011368908,0.000046689485],"category_scores_gemma":[0.00004634949,0.0003236352,0.00014855996,0.0007896077,0.000312882,0.0005052548,0.00093910843,0.00059395155,0.0000076162837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036761483,0.00005632695,0.0000022345314,0.000008427794,0.00000845543,0.0000058016954,0.00028291697,0.41192776,0.000028590548,0.03322112,0.000015996648,0.5544387],"study_design_scores_gemma":[0.0004945916,0.00026926928,0.00002950626,0.000035754987,0.000009029814,0.000055582175,2.2171524e-7,0.9427136,0.00032594,0.047065713,0.008605837,0.0003949601],"about_ca_topic_score_codex":0.000018068318,"about_ca_topic_score_gemma":0.000036991754,"teacher_disagreement_score":0.5540437,"about_ca_system_score_codex":0.00030953978,"about_ca_system_score_gemma":0.00064745726,"threshold_uncertainty_score":0.99992156},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029912696,0.0005164859,0.9884394,0.00055754115,0.00481265,0.0020660767,0.000027379287,0.0001283174,0.00046091227],"genre_scores_gemma":[0.27306688,0.0005419626,0.71765137,0.004245214,0.0013842972,0.0022274482,0.0001416123,0.000119329285,0.0006218889],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954604,0.00006206201,0.00096861133,0.0018214309,0.0009608371,0.00072667876],"domain_scores_gemma":[0.9966561,0.00090534275,0.00045782252,0.001237951,0.00046405868,0.00027869723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014654702,0.0004738073,0.00052829826,0.0010288332,0.0008043261,0.00067333545,0.002152826,0.00028807073,0.00011239892],"category_scores_gemma":[0.00033073715,0.0004859455,0.00017266539,0.00058911333,0.0004032478,0.0017204786,0.0017659866,0.00066719466,0.000019579782],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098381215,0.00013568319,0.00063655374,0.00003146158,0.000004914438,0.0000458939,0.0016247131,0.00033680513,0.000012567676,0.011964034,0.000046125464,0.9851514],"study_design_scores_gemma":[0.0023388495,0.010732395,0.020517262,0.002929782,0.00030424644,0.0014627789,0.00007278314,0.4072433,0.008165436,0.44093913,0.09632084,0.008973206],"about_ca_topic_score_codex":0.00008208708,"about_ca_topic_score_gemma":0.0002463221,"teacher_disagreement_score":0.9761782,"about_ca_system_score_codex":0.00047677426,"about_ca_system_score_gemma":0.0011327203,"threshold_uncertainty_score":0.9997592},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012214337,0.00084633206,0.986018,0.00014919625,0.00013850603,0.00017551478,0.000010612641,0.0000096790245,0.0004378086],"genre_scores_gemma":[0.9810017,0.00037194035,0.017622048,0.0003995958,0.00022195072,0.000015675858,0.00008057841,0.00002714664,0.0002594046],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99907774,0.0000057982425,0.00011757218,0.00048580818,0.0001691704,0.00014391217],"domain_scores_gemma":[0.9996344,0.000014516148,0.000023787543,0.00024811729,0.000035347257,0.000043842036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014700547,0.00015345884,0.00010715168,0.00007726339,0.00007957398,0.000031163454,0.00019083213,0.00008664114,0.000022855338],"category_scores_gemma":[0.000006658305,0.00014429104,0.000022295746,0.0000615761,0.0001557026,0.0000042826578,0.00009918229,0.00014484575,6.7130503e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091927875,0.00003971349,0.0012675545,0.000121234334,0.00005319676,0.000028445418,0.0008038362,0.19286305,0.10968817,0.001223318,0.00003891713,0.69378066],"study_design_scores_gemma":[0.004120721,0.0044474844,0.0043578986,0.0004941697,0.0001224582,0.001181466,0.000006541534,0.1165789,0.7578775,0.009676921,0.09682388,0.004312023],"about_ca_topic_score_codex":0.000006087225,"about_ca_topic_score_gemma":0.00006227946,"teacher_disagreement_score":0.9687873,"about_ca_system_score_codex":0.000038319562,"about_ca_system_score_gemma":0.00008607073,"threshold_uncertainty_score":0.5884018},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043600205,0.000058691065,0.95505404,0.00043656834,0.0002523294,0.00044187164,0.000009181872,0.00004373338,0.000103389066],"genre_scores_gemma":[0.9246525,0.000038720573,0.075063445,0.00011469845,0.000063764004,0.000020796246,0.000024031991,0.000013838611,0.000008168106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978561,0.000054884014,0.0003863823,0.0008123847,0.0006305968,0.00025965238],"domain_scores_gemma":[0.9987477,0.0001610271,0.00029476843,0.0005382337,0.00017153361,0.00008670179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004782979,0.0003067285,0.00031405006,0.0005691377,0.0003093304,0.00019805362,0.0008101384,0.00007668964,0.000057512425],"category_scores_gemma":[0.00000423708,0.000233146,0.00008492874,0.0006353338,0.00035506504,0.00072086096,0.00024357409,0.00031541628,6.777498e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012677771,0.00008607557,0.00045305194,0.0000559107,0.000023670978,0.000004040079,0.030088639,0.0005487482,0.0057337587,0.07567816,0.000010286822,0.88730496],"study_design_scores_gemma":[0.0020728041,0.0019311467,0.0049436814,0.00048488355,0.00009585123,0.000060687016,0.00011048272,0.4604466,0.107714534,0.41697633,0.0034368837,0.0017261304],"about_ca_topic_score_codex":0.00032200065,"about_ca_topic_score_gemma":0.00085110194,"teacher_disagreement_score":0.8855789,"about_ca_system_score_codex":0.00013760524,"about_ca_system_score_gemma":0.0002488249,"threshold_uncertainty_score":0.9507418},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008377137,0.00030198033,0.98331916,0.00045590432,0.006194591,0.0008103975,0.0000027920755,0.00014778669,0.00039023408],"genre_scores_gemma":[0.97679955,0.00012029922,0.021162027,0.0005873499,0.0009197765,0.00005807437,0.0000021394872,0.000036466186,0.00031431107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996688,0.00009022475,0.00048535448,0.0011070054,0.0011570565,0.00047235118],"domain_scores_gemma":[0.99796456,0.00025927127,0.0004244562,0.0009619379,0.0002876114,0.00010215374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013815836,0.00038148955,0.00039468944,0.0008015643,0.0008858919,0.00034810617,0.002168924,0.00026707788,0.00002132818],"category_scores_gemma":[0.000060103113,0.00030174942,0.000113973634,0.0015692993,0.00020320901,0.0006934008,0.0015265365,0.0013409008,0.000011792938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028814737,0.000015437356,0.000023758179,0.0000655732,0.000009468105,0.000003429426,0.0007483925,0.2190495,0.0051499186,0.0027449767,0.000023209212,0.7721375],"study_design_scores_gemma":[0.00014801857,0.0010586387,0.000112185,0.0002642367,0.000010204552,0.00012100838,6.0291813e-7,0.96439636,0.018359706,0.0022521417,0.012828825,0.00044809206],"about_ca_topic_score_codex":0.00010544668,"about_ca_topic_score_gemma":0.00012161625,"teacher_disagreement_score":0.9684224,"about_ca_system_score_codex":0.0005383734,"about_ca_system_score_gemma":0.00023429602,"threshold_uncertainty_score":0.99994344},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14277984,0.0005239356,0.8503927,0.00012199956,0.0010091622,0.0004533043,0.00011064623,0.00006943657,0.004538969],"genre_scores_gemma":[0.97662055,0.000037704835,0.022456575,0.0003665854,0.00019451516,0.0000030090046,0.00014725505,0.0000177278,0.00015604365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982795,0.000044649198,0.00034021478,0.0007325903,0.00030794294,0.00029506435],"domain_scores_gemma":[0.99908835,0.00007289812,0.00023380133,0.0004188038,0.00012374485,0.00006240238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037194713,0.00025342853,0.0003094436,0.00014369024,0.00012612896,0.000031068736,0.0006009868,0.00016402095,0.0000718936],"category_scores_gemma":[0.00009187979,0.00022225305,0.00010559841,0.00014993497,0.0008044001,0.0000036835922,0.0008365777,0.00031250028,0.0000035907058],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002438666,0.0001744512,0.0016050938,0.00018998249,0.000063601685,0.00010899621,0.0002366548,0.03166975,0.3305245,0.0018553183,0.00006932699,0.63325846],"study_design_scores_gemma":[0.0032642826,0.012237557,0.012625085,0.0009710185,0.00014111487,0.0004666131,0.0000014052328,0.38074094,0.30852973,0.2022939,0.07245563,0.006272716],"about_ca_topic_score_codex":0.00001996973,"about_ca_topic_score_gemma":0.000051063744,"teacher_disagreement_score":0.8338407,"about_ca_system_score_codex":0.00004899899,"about_ca_system_score_gemma":0.00015550843,"threshold_uncertainty_score":0.90632164},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89462334,0.0049617076,0.08201914,0.006358509,0.0044786283,0.0016587846,0.000097740856,0.00021966214,0.005582473],"genre_scores_gemma":[0.9970671,0.000022368084,0.0015783198,0.0009789397,0.00019304657,0.0000059638646,0.000014151126,0.000026829137,0.00011328021],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978727,0.00000564625,0.0004219159,0.0006665459,0.000704659,0.00032853495],"domain_scores_gemma":[0.9989548,0.00017763043,0.0003680857,0.0003575976,0.00010690409,0.00003502847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026204102,0.0003080348,0.00052356237,0.0005604064,0.00047988226,0.00013759425,0.0006448583,0.000064024825,0.00020966693],"category_scores_gemma":[0.00016846166,0.0003098703,0.00004849301,0.00030797848,0.0004402804,0.00026236687,0.0014720014,0.00046392973,0.0000012913623],"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.000024252531,0.0000640496,0.7979167,0.0009257684,0.00003985438,0.00017524823,0.00032466956,0.008415011,0.00019203585,0.0020739373,0.000045501005,0.18980299],"study_design_scores_gemma":[0.00447408,0.00017590188,0.4643034,0.002488767,0.0007955379,0.00017574124,0.00007791868,0.22389367,0.00027153597,0.007821648,0.2883467,0.007175088],"about_ca_topic_score_codex":0.22129543,"about_ca_topic_score_gemma":0.8343597,"teacher_disagreement_score":0.6130643,"about_ca_system_score_codex":0.00037124672,"about_ca_system_score_gemma":0.00052866543,"threshold_uncertainty_score":0.9999353},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066047313,0.00012393175,0.99457693,0.0008633308,0.0022197843,0.00068519276,0.0001365247,0.00018660123,0.00054725504],"genre_scores_gemma":[0.90240324,0.000013451951,0.08554031,0.010397068,0.0011719327,0.00010413934,0.00003957098,0.0000983286,0.00023193241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555546,0.000173804,0.00055065955,0.001909434,0.0011669276,0.00064369576],"domain_scores_gemma":[0.99414265,0.0046192547,0.0002856918,0.0006874929,0.000080535334,0.00018434523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013707548,0.0005125152,0.0005241818,0.0007851859,0.00044722465,0.00031065944,0.0019033953,0.0003010052,0.00020956267],"category_scores_gemma":[0.0004115766,0.00046323772,0.0002334876,0.0004501477,0.0008310348,0.00031633236,0.00049445877,0.00080778816,0.000009910842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061356324,0.000068485126,0.0000016008606,0.000035693403,0.0000061513706,0.000046618687,0.0002868007,0.15844615,0.04700863,0.00058943516,0.000069518355,0.79337955],"study_design_scores_gemma":[0.0003667293,0.00053760485,0.0000011480821,0.00013591455,0.000008734295,0.000006971924,2.2123885e-7,0.78923434,0.10284139,0.10110871,0.005319882,0.00043837473],"about_ca_topic_score_codex":0.000049199785,"about_ca_topic_score_gemma":0.000071910385,"teacher_disagreement_score":0.9090366,"about_ca_system_score_codex":0.0002584061,"about_ca_system_score_gemma":0.00037193735,"threshold_uncertainty_score":0.9997819},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012151972,0.00008968461,0.9925063,0.0009571359,0.0018992068,0.0011470744,0.000005595348,0.0009492412,0.0023242226],"genre_scores_gemma":[0.43769,0.000052880863,0.5563279,0.0035392537,0.00056099874,0.0002366968,0.0000049483556,0.00013697318,0.001450385],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947298,0.000082852166,0.00041206682,0.002343965,0.001735594,0.00069571857],"domain_scores_gemma":[0.9962992,0.000449233,0.00036242136,0.002533365,0.00017067486,0.00018508302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093827856,0.00067471486,0.00058196625,0.0015630679,0.0005054235,0.0006143403,0.0049768873,0.00020308275,0.000039977745],"category_scores_gemma":[0.00014011492,0.0006583345,0.0001573075,0.0011436387,0.00038306115,0.0009190823,0.0028352544,0.0016555242,0.000029833449],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013939632,0.00015945558,0.000042912397,0.000013397927,0.000017603832,0.0005150915,0.0014001773,0.013035102,0.00006043135,0.014613567,0.00007075463,0.97005755],"study_design_scores_gemma":[0.0036692042,0.015042884,0.0018268937,0.0010768949,0.00007322147,0.0009828825,0.000018427383,0.14344352,0.018512195,0.6291226,0.17670701,0.009524232],"about_ca_topic_score_codex":0.000012791626,"about_ca_topic_score_gemma":0.000028807039,"teacher_disagreement_score":0.9605333,"about_ca_system_score_codex":0.0008104926,"about_ca_system_score_gemma":0.00034328015,"threshold_uncertainty_score":0.99958676},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000121382305,0.0013617027,0.97700757,0.00055360614,0.002446318,0.00044798097,0.000003068217,0.000070002854,0.017988387],"genre_scores_gemma":[0.7289995,0.0011160605,0.25962391,0.00041730562,0.0014188767,0.00022158022,0.000012699319,0.00018887447,0.0080011645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671584,0.00019999617,0.00031045888,0.0005261973,0.0016509797,0.0005965415],"domain_scores_gemma":[0.99493885,0.0037858845,0.00006614483,0.0008408582,0.0002697849,0.000098491975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010074159,0.0001821471,0.00019191217,0.0008102431,0.00095902954,0.0002635429,0.0028132005,0.00008850254,0.000064814194],"category_scores_gemma":[0.00037479616,0.00014423112,0.00004158501,0.0030412101,0.0024369587,0.0003262188,0.00035711902,0.0014423562,0.000012984965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002451391,0.000047567923,0.000004425881,0.00009905308,0.000009747756,0.000016773483,0.013035283,0.5573702,0.0025058992,0.0013821764,0.0032528976,0.42225146],"study_design_scores_gemma":[0.00026362925,0.00047756048,0.0003115074,0.0002843998,0.000016688538,0.000107746775,0.000042745985,0.81396645,0.01298519,0.11073519,0.060000993,0.0008078809],"about_ca_topic_score_codex":0.0000059381437,"about_ca_topic_score_gemma":0.000008725237,"teacher_disagreement_score":0.72887814,"about_ca_system_score_codex":0.00071630516,"about_ca_system_score_gemma":0.0031500421,"threshold_uncertainty_score":0.89790756},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2358207,0.02223486,0.7316629,0.00034762427,0.0034124427,0.0008997802,0.00016155963,0.000014350083,0.0054457905],"genre_scores_gemma":[0.98923075,0.00045757697,0.009698924,0.00014901097,0.00018854579,0.000005712675,0.000014589962,0.000020650432,0.00023423044],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878067,0.000013642825,0.00023239967,0.0005560719,0.0002004036,0.00021683918],"domain_scores_gemma":[0.9992141,0.000033808636,0.00013892114,0.00048807065,0.000084310224,0.00004078416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020860341,0.0001939582,0.00022362848,0.00015176384,0.00012841113,0.000011168473,0.00048268642,0.000119982215,0.000028927252],"category_scores_gemma":[0.000026146454,0.00016945213,0.00009997707,0.000069791546,0.00037126237,7.654794e-7,0.0008930981,0.00017127288,0.0000032115786],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003668857,0.000041818876,0.0008392538,0.000038573962,0.00008380843,0.000008946142,0.00018901592,0.06354578,0.87978745,0.0031657466,0.00006090522,0.052202046],"study_design_scores_gemma":[0.0040115523,0.008487191,0.04080067,0.0007112013,0.00048806355,0.00059601344,0.0000104806295,0.049833972,0.24506474,0.34432507,0.2979339,0.0077371616],"about_ca_topic_score_codex":0.00002260937,"about_ca_topic_score_gemma":0.000047945472,"teacher_disagreement_score":0.75341004,"about_ca_system_score_codex":0.00007674102,"about_ca_system_score_gemma":0.0002540556,"threshold_uncertainty_score":0.69100577},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26393571,0.0018690716,0.6591079,0.0015319164,0.018137846,0.005212963,0.00034245304,0.00022619146,0.049635913],"genre_scores_gemma":[0.9921083,0.000053094293,0.005625017,0.0006268246,0.00063470175,0.000052013176,0.0005268204,0.00005357899,0.00031969175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718994,0.00048382508,0.00046326694,0.0009412918,0.00062554434,0.00029612702],"domain_scores_gemma":[0.9969466,0.0015359729,0.00033872863,0.0010614017,0.00008158178,0.000035712113],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0047946675,0.00025805942,0.00033517258,0.000540161,0.00015874204,0.000046378707,0.0011075084,0.0001994457,0.0009367853],"category_scores_gemma":[0.00040402755,0.00019568074,0.000073510564,0.0004366831,0.0003086901,0.00019990785,0.0006012284,0.0009326605,0.0000724342],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006379936,0.000022995928,0.00020246058,0.000049426708,0.000012381431,0.000010402581,0.0007828228,0.001327267,0.00027574063,0.00008378762,0.000019778288,0.9971491],"study_design_scores_gemma":[0.015517898,0.028906064,0.028812556,0.0072194766,0.00082469016,0.0013848917,0.000032202854,0.74399966,0.009760762,0.15247843,0.0059288237,0.005134565],"about_ca_topic_score_codex":0.0001573688,"about_ca_topic_score_gemma":0.00019247366,"teacher_disagreement_score":0.9920146,"about_ca_system_score_codex":0.00015015432,"about_ca_system_score_gemma":0.00010405842,"threshold_uncertainty_score":0.9999765},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000961253,0.00016767248,0.99640334,0.0004320489,0.00093288254,0.00074148923,0.00005059255,0.00012275144,0.00018794902],"genre_scores_gemma":[0.030207176,0.000010920423,0.96819425,0.00043695202,0.0005490588,0.000301413,0.000016108443,0.00005757132,0.00022655776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739784,0.000021952777,0.0004380101,0.0010242903,0.0005570481,0.0005608626],"domain_scores_gemma":[0.99839556,0.0005603701,0.00023543755,0.0005657806,0.00013208843,0.00011076028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010192473,0.00031398478,0.0003767075,0.00030009093,0.0005040759,0.00026540938,0.0010957908,0.00012860497,0.00025068055],"category_scores_gemma":[0.00009043901,0.0002818228,0.00012021569,0.00031723134,0.0005098351,0.00019317353,0.0005514531,0.0003294853,0.000045476092],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062681634,0.00004512142,0.000004005278,0.000026248716,0.000004667636,0.000007757067,0.0002914512,0.006401047,0.02577032,0.0041141436,0.000031178068,0.9632978],"study_design_scores_gemma":[0.00042471377,0.00031020577,0.0000065358504,0.00033447274,0.000036410613,0.000040568357,0.00000257294,0.6239651,0.23825738,0.02436708,0.111274526,0.0009804476],"about_ca_topic_score_codex":0.000019982524,"about_ca_topic_score_gemma":0.00001840152,"teacher_disagreement_score":0.96231735,"about_ca_system_score_codex":0.00019524094,"about_ca_system_score_gemma":0.0002615519,"threshold_uncertainty_score":0.9999634},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024163146,0.00006862454,0.95908815,0.00039304854,0.002688426,0.000782896,0.000015448251,0.00029737127,0.03424973],"genre_scores_gemma":[0.9772058,0.000016769865,0.01874843,0.0018626428,0.00068699406,0.000013195964,0.000021567366,0.000035667334,0.0014088998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968141,0.00012580058,0.00044278053,0.0006212948,0.0013724152,0.0006236638],"domain_scores_gemma":[0.99836767,0.00023186911,0.0003243478,0.00052944425,0.00023388055,0.00031278562],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015343388,0.0003093735,0.0003433759,0.0006472181,0.0014088223,0.0005477566,0.001044729,0.0002673496,0.00039786063],"category_scores_gemma":[0.0002203913,0.0002999935,0.000106235835,0.00045902946,0.0005646307,0.0010923004,0.00016415247,0.00057875674,0.00004026356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053362175,0.000052012514,0.00004155181,0.00011601093,0.000009989869,0.000045989484,0.024881238,0.054466,0.0003150139,0.017055882,0.000021022795,0.90294194],"study_design_scores_gemma":[0.0025314407,0.0012707775,0.00031763545,0.0009002273,0.00004827117,0.00005412552,0.0015383925,0.8463028,0.005769496,0.004117277,0.13435206,0.0027974828],"about_ca_topic_score_codex":0.0025374077,"about_ca_topic_score_gemma":0.0048179184,"teacher_disagreement_score":0.9747895,"about_ca_system_score_codex":0.0012917988,"about_ca_system_score_gemma":0.0009917998,"threshold_uncertainty_score":0.9999452},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016273261,0.000033607692,0.9795246,0.00074627413,0.004911435,0.00077050173,0.00004899841,0.00022804886,0.012109213],"genre_scores_gemma":[0.9095058,0.000019062592,0.07821094,0.0055522635,0.0019002166,0.00010190051,0.000021709566,0.00015211402,0.0045359945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965517,0.000045871475,0.00044356787,0.0015144941,0.0007700289,0.0006743652],"domain_scores_gemma":[0.99786687,0.0010459829,0.00030867016,0.0005050152,0.00014296298,0.00013048034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022733063,0.00044123677,0.0004017679,0.0007804389,0.0009581098,0.0003416468,0.00097641355,0.00016465814,0.00055483525],"category_scores_gemma":[0.00045799822,0.0004502753,0.00019385332,0.0005278938,0.00035892977,0.0005653469,0.00032227772,0.0010732451,0.000042026975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015358467,0.00021742136,0.00008386052,0.00008567334,0.000020593041,0.00012510153,0.0018013059,0.36815268,0.3375849,0.017210618,0.00041728347,0.27414697],"study_design_scores_gemma":[0.00072236493,0.0009218105,0.000014089813,0.00022044637,0.000033434048,0.0005191272,0.0000018133701,0.38791636,0.36949116,0.05545193,0.18336365,0.0013438227],"about_ca_topic_score_codex":0.000033975997,"about_ca_topic_score_gemma":0.00005694088,"teacher_disagreement_score":0.90787846,"about_ca_system_score_codex":0.00063727435,"about_ca_system_score_gemma":0.0003352072,"threshold_uncertainty_score":0.9997949},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057669673,0.00011051741,0.96705806,0.014752633,0.0027910667,0.00163011,0.0000042193424,0.0001342583,0.013461485],"genre_scores_gemma":[0.62131506,0.000042824297,0.23974986,0.120482944,0.009427092,0.0010047458,0.0005282487,0.0002836065,0.0071656355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969656,0.000019629319,0.000701848,0.0010452748,0.00055731303,0.000710332],"domain_scores_gemma":[0.9979579,0.000618826,0.0006291198,0.00030329076,0.00046627116,0.000024631188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031921046,0.00042386877,0.00039224813,0.0004744669,0.0009444202,0.0007475305,0.0009664922,0.00019715616,0.0004126946],"category_scores_gemma":[0.00095720874,0.00045714414,0.0001458104,0.00043025834,0.00041999677,0.0009989177,0.0004899197,0.00070767757,0.00010628503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009187041,0.000053870197,0.000030130408,0.0003779167,0.00003900057,0.000006321093,0.0012368339,0.04331965,0.000008726141,0.5435697,0.00025132758,0.41101465],"study_design_scores_gemma":[0.00036536687,0.00015130025,0.000012932431,0.00024931077,0.000058187965,0.000007889692,0.00035083364,0.12086234,0.00005864585,0.3948141,0.4820155,0.0010535934],"about_ca_topic_score_codex":0.000059009417,"about_ca_topic_score_gemma":0.00011218483,"teacher_disagreement_score":0.72730815,"about_ca_system_score_codex":0.0007405608,"about_ca_system_score_gemma":0.00048713712,"threshold_uncertainty_score":0.99978805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002656741,0.00047023382,0.9478179,0.001933841,0.0015411143,0.00029542574,0.000044976598,0.000098721604,0.047532067],"genre_scores_gemma":[0.6717065,0.000020744734,0.30863678,0.004504644,0.0012460416,0.000027376944,0.000028174773,0.000094545016,0.013735171],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935082,0.00012849788,0.0008387032,0.0017467154,0.0031354171,0.0006424251],"domain_scores_gemma":[0.9928433,0.0046423473,0.00045442508,0.0014793702,0.00036584528,0.00021474845],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005526299,0.00040015066,0.00061824167,0.0016134328,0.00073624053,0.000579536,0.0029035276,0.00021957507,0.0018779708],"category_scores_gemma":[0.0028743537,0.00032901263,0.00024748888,0.0014012046,0.0018381198,0.00024794025,0.001292994,0.0012437196,0.00024572926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018515138,0.00004070428,0.0001258778,0.00000419682,0.000021507776,0.0001232074,0.0018117797,0.28386372,0.000037285314,0.047496088,0.00033171964,0.66612536],"study_design_scores_gemma":[0.00032420468,0.00017297623,0.00015506112,0.00011567245,0.000020383928,0.00012753255,0.000004707819,0.21142441,0.00011605639,0.63294923,0.15387201,0.00071774115],"about_ca_topic_score_codex":0.000033835182,"about_ca_topic_score_gemma":0.0000540477,"teacher_disagreement_score":0.67144084,"about_ca_system_score_codex":0.0003338351,"about_ca_system_score_gemma":0.0009105184,"threshold_uncertainty_score":0.9999162},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22954431,0.0020547262,0.6615358,0.032959208,0.015857706,0.007027639,0.000048153965,0.0012291792,0.04974327],"genre_scores_gemma":[0.82396644,0.00036126957,0.1125206,0.053784363,0.0070731733,0.00008582774,0.00015692801,0.0004296843,0.0016217108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617904,0.00001928698,0.000551121,0.0014147823,0.0013198043,0.00051596394],"domain_scores_gemma":[0.99840677,0.000121058285,0.00038918367,0.0005951907,0.00042321015,0.00006457775],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00089208497,0.0005290746,0.00048283412,0.0013719146,0.0007264883,0.0006065872,0.0011015169,0.00016432945,0.001152361],"category_scores_gemma":[0.000102723825,0.000529873,0.00014824035,0.001564172,0.00016224963,0.0013922541,0.0011153658,0.00072576944,0.000065102395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045161578,0.0033143102,0.0062091574,0.0021734464,0.00068354,0.0011580096,0.0049966704,0.76073384,0.009285521,0.019472675,0.00023047913,0.19129074],"study_design_scores_gemma":[0.0059701516,0.0005657165,0.000867466,0.0014178753,0.0026918005,0.00021721497,0.0000125055485,0.8306595,0.0033652007,0.013424235,0.13545668,0.005351653],"about_ca_topic_score_codex":0.0004668826,"about_ca_topic_score_gemma":0.00082317536,"teacher_disagreement_score":0.5944221,"about_ca_system_score_codex":0.00013848423,"about_ca_system_score_gemma":0.00022480224,"threshold_uncertainty_score":0.99976075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005096199,0.00011640875,0.99311835,0.0034241443,0.0011002464,0.00063029275,0.000017139086,0.00010037616,0.0009834114],"genre_scores_gemma":[0.77915496,0.0000032181154,0.21925242,0.001302867,0.00014106625,0.00008894355,0.000009831745,0.000018709025,0.000027968623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783045,0.000054156393,0.00044738583,0.00068492786,0.00061312405,0.0003699718],"domain_scores_gemma":[0.9974632,0.0012834964,0.00030329768,0.00075589,0.00015599845,0.000038118185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013954662,0.00026983075,0.00032667545,0.000618833,0.00032779266,0.00013979783,0.00327443,0.00013016106,0.000016729125],"category_scores_gemma":[0.000096906086,0.00019378283,0.000099108205,0.0006288833,0.00048610885,0.00020618876,0.0006413387,0.0007083345,0.0000024984295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014851544,0.00004233291,0.00002512701,0.00012095993,0.000031238178,0.000016934815,0.009617475,0.060544632,0.00054515526,0.5603798,0.000034954814,0.36862653],"study_design_scores_gemma":[0.0005700744,0.0003685138,0.00078067696,0.00036953224,0.000017063636,0.0006017163,0.000039070797,0.96294683,0.00032389266,0.02572744,0.0076716184,0.00058359053],"about_ca_topic_score_codex":0.00006040066,"about_ca_topic_score_gemma":0.000039495648,"teacher_disagreement_score":0.90240216,"about_ca_system_score_codex":0.00040986977,"about_ca_system_score_gemma":0.0005701638,"threshold_uncertainty_score":0.7902235},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004835101,0.0013651347,0.98378557,0.0016787172,0.0022403486,0.00060483697,0.000004596096,0.00009100295,0.0053946716],"genre_scores_gemma":[0.95693064,0.00076122675,0.032840546,0.004291064,0.0014505998,0.000041189065,0.00033121576,0.00007290394,0.003280599],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99809474,0.00002704071,0.0003716026,0.0005980242,0.0005987205,0.0003098475],"domain_scores_gemma":[0.99881077,0.00047803673,0.00016645985,0.00028680934,0.00013785691,0.000120063625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005010455,0.00020454875,0.00024709586,0.00029802494,0.00036634423,0.00008141513,0.00024093836,0.00015012256,0.0008715366],"category_scores_gemma":[0.000198846,0.00020205032,0.000058589423,0.00025934906,0.0002873895,0.00013481345,0.00008441535,0.0009359926,0.00005133608],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002013646,0.00003221922,0.001809203,0.00005958108,0.0000074634318,0.0000163717,0.0026198502,0.006465804,0.0012591188,0.00028343406,0.00010542647,0.9873214],"study_design_scores_gemma":[0.00089117576,0.009061172,0.0027772624,0.0030565273,0.00045011198,0.0020035584,0.00028413837,0.2948541,0.14041612,0.24183424,0.29849842,0.0058731777],"about_ca_topic_score_codex":0.00023612408,"about_ca_topic_score_gemma":0.00007912347,"teacher_disagreement_score":0.98144823,"about_ca_system_score_codex":0.0006087045,"about_ca_system_score_gemma":0.00035915436,"threshold_uncertainty_score":0.95427144},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010278457,0.006759743,0.29171124,0.01888114,0.0056236237,0.0015886127,0.00009364655,0.00019871924,0.6741154],"genre_scores_gemma":[0.92694443,0.0034352748,0.05883494,0.00453396,0.002342953,0.00006766046,0.00003827422,0.000058908176,0.0037435866],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782956,0.00023210283,0.00024104219,0.0005005643,0.00088623003,0.0003105182],"domain_scores_gemma":[0.99671996,0.0024808259,0.00022086472,0.00027137448,0.00023380422,0.00007319725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022036065,0.00015564557,0.0002764375,0.00026218174,0.0010530062,0.00012944815,0.0006355585,0.00012053812,0.00013410288],"category_scores_gemma":[0.0018665869,0.00016512601,0.00005323549,0.00075774675,0.0027130095,0.00038004015,0.0006884207,0.0005261952,0.0000025611157],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036971393,0.00022824002,0.00033007626,0.00014467139,0.00006834593,0.00005345831,0.46831757,0.0011221207,0.000008534394,0.14388552,0.0017280686,0.38407642],"study_design_scores_gemma":[0.00022987285,0.00014590498,0.00013284589,0.00014152151,0.000050776463,0.00001943538,0.00038911356,0.0008871231,0.000013340068,0.40362284,0.5938491,0.0005181222],"about_ca_topic_score_codex":0.0010069592,"about_ca_topic_score_gemma":0.0048970478,"teacher_disagreement_score":0.9259166,"about_ca_system_score_codex":0.00034909963,"about_ca_system_score_gemma":0.0014946221,"threshold_uncertainty_score":0.9996196},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001366585,0.0001501785,0.9935416,0.000055417524,0.00067293155,0.0009343614,0.000026970592,0.00023635698,0.0030155831],"genre_scores_gemma":[0.8925847,0.000008301023,0.10577506,0.000079563084,0.00037973555,0.00025834536,0.000041116353,0.00013160236,0.0007416092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978689,0.000016296623,0.0003425736,0.0006107935,0.00055520516,0.00060621137],"domain_scores_gemma":[0.99873734,0.00040299684,0.000083078994,0.0005358882,0.00014694557,0.00009373476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008164122,0.00029779173,0.00033481568,0.0004669053,0.0003399494,0.00020028629,0.0006763947,0.00013156427,0.00003340359],"category_scores_gemma":[0.00005509868,0.0002719301,0.00006088843,0.00046482013,0.00020462889,0.00017996813,0.00018738415,0.00061845634,0.0000044517114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014552721,0.000013434456,0.00012513102,0.00031320544,0.00004144436,0.000011372315,0.0010821729,0.95818555,0.0017651586,0.002239094,0.000032586697,0.03617627],"study_design_scores_gemma":[0.00031554778,0.00013273474,0.000026832793,0.0001834527,0.0000075949674,0.000018538853,0.000001003423,0.9922933,0.0013536885,0.0013875397,0.0039353287,0.0003444318],"about_ca_topic_score_codex":0.000036382382,"about_ca_topic_score_gemma":0.00009026106,"teacher_disagreement_score":0.89121807,"about_ca_system_score_codex":0.0005650962,"about_ca_system_score_gemma":0.00019207432,"threshold_uncertainty_score":0.9999733},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13806105,0.0013276078,0.82085055,0.007882389,0.002782395,0.0068531344,0.007687966,0.00035933577,0.014195591],"genre_scores_gemma":[0.9515297,0.00027292484,0.04201639,0.0038749736,0.0002548124,0.000032060372,0.0008821769,0.000068417416,0.0010685832],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826753,0.000019434514,0.00045900952,0.0005314851,0.00046444184,0.00025810226],"domain_scores_gemma":[0.99865633,0.00053546607,0.00021750382,0.00022353572,0.000074790994,0.00029236882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046389317,0.00024915565,0.0005516687,0.00025903806,0.0001495599,0.00002738227,0.00017648925,0.00010282239,0.00008681648],"category_scores_gemma":[0.00015465985,0.00020263973,0.00011748822,0.00010743077,0.00024944864,0.00008083839,0.000049792594,0.00025683228,9.971529e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049848375,0.0007709734,0.5273688,0.027736932,0.0024736903,0.00078203913,0.02289827,0.011867975,0.039494917,0.016837016,0.000108687,0.3446759],"study_design_scores_gemma":[0.03426408,0.007170276,0.028354071,0.03651249,0.0025161703,0.0013331379,0.000007541252,0.79117066,0.067011975,0.021395473,0.0060997307,0.004164371],"about_ca_topic_score_codex":0.00013667435,"about_ca_topic_score_gemma":0.0000167059,"teacher_disagreement_score":0.81346864,"about_ca_system_score_codex":0.00009742556,"about_ca_system_score_gemma":0.00047441697,"threshold_uncertainty_score":0.8263408},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000069162434,0.0002668669,0.99205416,0.0019655316,0.0019572838,0.00050177285,0.000046328263,0.000101138074,0.0030999924],"genre_scores_gemma":[0.14267783,0.00006083311,0.8492686,0.004266957,0.0016777613,0.00008501077,0.00009097008,0.000065757304,0.0018062736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968031,0.000047567977,0.00041416028,0.0013546946,0.00077330257,0.00060714287],"domain_scores_gemma":[0.9977979,0.00079444435,0.00024157143,0.00082476233,0.00020945532,0.00013187891],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008713783,0.0004260974,0.00044766255,0.0004520072,0.0006128498,0.00046198242,0.0024460722,0.00014188814,0.00015617006],"category_scores_gemma":[0.000101474,0.00040909665,0.00019510752,0.00037560408,0.00035561484,0.0006205898,0.0011107721,0.0005014443,0.000014275425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000797503,0.000034089535,0.000032383432,0.00003688106,0.00003846966,0.00005912173,0.0007629509,0.6907572,0.00023964857,0.06533719,0.0014919571,0.24120215],"study_design_scores_gemma":[0.00037030186,0.00012737562,0.000045820427,0.00007823204,0.000011460526,0.000047217123,3.2150518e-7,0.8275111,0.0011312083,0.13207532,0.03796784,0.00063384796],"about_ca_topic_score_codex":0.000015572068,"about_ca_topic_score_gemma":0.000031254618,"teacher_disagreement_score":0.2405683,"about_ca_system_score_codex":0.00028328234,"about_ca_system_score_gemma":0.00046863325,"threshold_uncertainty_score":0.9998361},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006319378,0.0020511234,0.7625534,0.023089333,0.010685881,0.008986002,0.00023856864,0.0003586063,0.1857177],"genre_scores_gemma":[0.9476857,0.00040153498,0.021042043,0.018522715,0.003524663,0.0004987088,0.00032797453,0.00018551254,0.0078111584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953749,0.00025378447,0.0007603797,0.0008616203,0.0016307805,0.0011185355],"domain_scores_gemma":[0.9953322,0.0030656368,0.000328131,0.0008694735,0.00021426838,0.000190289],"candidate_categories":["sts","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020717538,0.0003575507,0.00041740527,0.00037525964,0.0045726667,0.000056163142,0.0016343774,0.000260423,0.0021874828],"category_scores_gemma":[0.00019750299,0.00024226592,0.0001077192,0.0005384265,0.0005290699,0.00021666531,0.0013390497,0.0031850783,0.00008979704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014944628,0.00017285965,0.062337734,0.0013451952,0.00008315258,0.00009238757,0.033429556,0.017603757,0.00010143522,0.53730553,0.0033204937,0.34405845],"study_design_scores_gemma":[0.0012789018,0.0009959611,0.022865418,0.0012620788,0.00002980383,0.000010521617,0.000045823464,0.01581433,0.00011678892,0.4373947,0.51877594,0.0014096902],"about_ca_topic_score_codex":0.0016099599,"about_ca_topic_score_gemma":0.0012353286,"teacher_disagreement_score":0.9413663,"about_ca_system_score_codex":0.0012759727,"about_ca_system_score_gemma":0.0019583653,"threshold_uncertainty_score":0.99911463},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011080607,0.00013944035,0.9955966,0.00018428864,0.00042738122,0.002473495,0.000030603813,0.00058764307,0.00054948684],"genre_scores_gemma":[0.013317693,0.00006152885,0.9853673,0.0002012879,0.00012809783,0.00068711414,0.000035725094,0.000040466708,0.00016076039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695826,0.000031174088,0.0005851273,0.0013231423,0.00067971507,0.0004225883],"domain_scores_gemma":[0.9967819,0.00024223918,0.0005700002,0.0018408853,0.00045305854,0.00011195025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073620275,0.00035268223,0.00044748813,0.0006985084,0.000349042,0.00018340746,0.0026443822,0.00020637726,0.000014522041],"category_scores_gemma":[0.000059777834,0.0003821287,0.0001232531,0.0008655998,0.00040314996,0.0008409362,0.00087019766,0.00044497504,0.0000025056052],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009735318,0.00010286254,0.0000037874668,0.0001050729,0.0000070192254,0.000003290014,0.00024806446,0.00955942,0.0012116269,0.06539625,0.000016346334,0.9233365],"study_design_scores_gemma":[0.000426329,0.0014975998,0.000019356834,0.00014989839,0.000026770842,0.000076133336,0.0000011441962,0.44106677,0.037449032,0.390704,0.12755342,0.0010295252],"about_ca_topic_score_codex":0.000011798768,"about_ca_topic_score_gemma":0.000014315818,"teacher_disagreement_score":0.922307,"about_ca_system_score_codex":0.00029006513,"about_ca_system_score_gemma":0.0003760795,"threshold_uncertainty_score":0.9998631},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030138455,0.0005642066,0.9776789,0.000494097,0.012024256,0.0010666777,0.0000031974732,0.0005756121,0.0075629298],"genre_scores_gemma":[0.0027422614,0.00001758837,0.9910609,0.0014958656,0.0043118927,0.000050274637,0.00002535229,0.00008139826,0.0002144656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99396944,0.000038881546,0.00078346016,0.002442381,0.001354904,0.0014109479],"domain_scores_gemma":[0.9964628,0.0009134925,0.00044699336,0.0017068706,0.00020391562,0.00026593232],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018472264,0.0008256266,0.0008106161,0.0012406891,0.001121516,0.0007650811,0.005648623,0.00037511525,0.000008107416],"category_scores_gemma":[0.00008758753,0.0007918758,0.0003418765,0.0009639412,0.0003516637,0.0004024489,0.0031826885,0.0016781633,0.000010027507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016294602,0.00008203503,0.000018153587,0.00027977108,0.00004064873,0.00004638654,0.0029999323,0.13778105,0.00003417154,0.028770775,0.0001819952,0.8297488],"study_design_scores_gemma":[0.0004030676,0.00026592822,0.000009300598,0.00009838007,0.000014941838,0.00015230123,2.5333776e-7,0.8450449,0.00023301112,0.108807795,0.043990433,0.0009796692],"about_ca_topic_score_codex":0.000020146475,"about_ca_topic_score_gemma":0.0000056920776,"teacher_disagreement_score":0.8287691,"about_ca_system_score_codex":0.0006901845,"about_ca_system_score_gemma":0.0010776046,"threshold_uncertainty_score":0.9997313},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006402056,0.0004824859,0.9956953,0.0006313563,0.0013206728,0.0002268437,0.0000028151878,0.00007413686,0.0009261691],"genre_scores_gemma":[0.9369201,0.000020721056,0.061310258,0.0011791729,0.00033368426,0.0000061275364,0.0000041838684,0.000022604305,0.00020314516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996627,0.000056715588,0.0006007955,0.0010846286,0.0011687123,0.00046215474],"domain_scores_gemma":[0.9977334,0.00039860854,0.0005798808,0.0010082104,0.00019121173,0.00008869652],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012968396,0.0003667301,0.00046094146,0.00043815383,0.0003536048,0.00037499037,0.0058687604,0.00013784121,0.000081985716],"category_scores_gemma":[0.00005626918,0.0002616766,0.00022315735,0.0005723845,0.00033622203,0.00047169565,0.0030287125,0.0008187434,0.000009075456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056614413,0.00003753528,0.00002604401,0.00011512965,0.000037528636,0.00003733483,0.006357893,0.13607697,0.00017416825,0.2853253,0.00001651485,0.5717899],"study_design_scores_gemma":[0.000095692914,0.00011771382,0.000020064317,0.0001494823,0.000013813993,0.000024774195,0.0000012297202,0.99411774,0.00037025783,0.0020339494,0.0027459257,0.0003093676],"about_ca_topic_score_codex":0.00009407256,"about_ca_topic_score_gemma":0.00011128872,"teacher_disagreement_score":0.9362799,"about_ca_system_score_codex":0.00019439911,"about_ca_system_score_gemma":0.00038698027,"threshold_uncertainty_score":0.99998355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053089694,0.000060090144,0.99677455,0.00021113777,0.0010239924,0.000725977,0.000011335918,0.00011368878,0.0005483395],"genre_scores_gemma":[0.43637523,0.0000150333235,0.5621499,0.00023470963,0.0006109384,0.00014408526,0.00015759298,0.000037067864,0.0002754387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760324,0.000021366923,0.0004777166,0.0010920546,0.0005662624,0.00023934052],"domain_scores_gemma":[0.9981845,0.00009216943,0.0004754945,0.0009344506,0.00026296303,0.000050418515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069732906,0.00023387073,0.0002788413,0.0006791694,0.00037095352,0.00013063809,0.0010031087,0.00013501226,0.000041328465],"category_scores_gemma":[0.000027333206,0.0002541144,0.00009516654,0.00035672664,0.00020592981,0.0006893044,0.0003351807,0.0003221782,0.000007591756],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004702341,0.000062266285,0.0000098267155,0.000036476064,0.0000037619407,0.0000016293042,0.00030759926,0.018914158,0.0014090405,0.019898258,0.00001662622,0.9593357],"study_design_scores_gemma":[0.00041259616,0.0006605105,0.00014788956,0.00010950175,0.000028847822,0.00004579593,3.3525808e-7,0.6993715,0.011531575,0.28277293,0.004337316,0.0005811833],"about_ca_topic_score_codex":0.000037298814,"about_ca_topic_score_gemma":0.000022238808,"teacher_disagreement_score":0.9587545,"about_ca_system_score_codex":0.00023889176,"about_ca_system_score_gemma":0.00014986222,"threshold_uncertainty_score":0.9999911},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026845222,0.00032374318,0.9656719,0.0016041521,0.0032469332,0.00081734423,0.000038568214,0.00012361133,0.0013285084],"genre_scores_gemma":[0.78839326,0.000071561546,0.2093481,0.0014472605,0.0005468664,0.00002752024,0.000013750343,0.000055573822,0.00009613725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917391,0.00035353296,0.0022147049,0.0024714351,0.0022264759,0.0009947439],"domain_scores_gemma":[0.9892511,0.0066631185,0.0010646881,0.0023251192,0.00031326845,0.00038273368],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0073062936,0.00067659415,0.0011341216,0.000843711,0.00046043098,0.00049570017,0.0065918597,0.00038440776,0.000054699518],"category_scores_gemma":[0.0020213013,0.0005556912,0.0003136914,0.0015898186,0.0008100626,0.0014505716,0.003471509,0.0022179103,0.000012126064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012974357,0.00014577297,0.020024054,0.000026010348,0.000030477117,0.00038673068,0.009360828,0.6122783,0.000213039,0.019630764,0.000110595705,0.33766374],"study_design_scores_gemma":[0.000302646,0.00029690732,0.0023901898,0.00073512056,0.000011633869,0.000018663264,0.000031687898,0.7786322,0.0013977241,0.2146493,0.00075523375,0.0007786395],"about_ca_topic_score_codex":0.0018901373,"about_ca_topic_score_gemma":0.009843014,"teacher_disagreement_score":0.76154804,"about_ca_system_score_codex":0.00033183824,"about_ca_system_score_gemma":0.001100682,"threshold_uncertainty_score":0.99968946},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023394676,0.000052421423,0.99492633,0.0005297686,0.00039323073,0.00070158846,0.0000045318047,0.000053481945,0.0009991952],"genre_scores_gemma":[0.3466479,0.000025021365,0.6520729,0.0006624977,0.00012512298,0.000020278932,0.000022918439,0.000039807164,0.0003835519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977888,0.000038737773,0.00034139206,0.00092754513,0.0005020243,0.00040149433],"domain_scores_gemma":[0.9988362,0.00044890353,0.00019200362,0.00043290717,0.000014783415,0.00007520707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071127975,0.00026506654,0.00026445507,0.00021409322,0.0003515709,0.00010837879,0.00057189737,0.00017026626,0.00022380087],"category_scores_gemma":[0.00011841961,0.0002687865,0.00008363305,0.00041830895,0.00038563702,0.0001405286,0.0004517278,0.0008394828,0.00005566321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011340873,0.00005037149,0.00077748817,0.000023574017,0.000005020428,0.000013005364,0.0030061314,0.5562302,0.0028702565,0.0009417322,0.000016321314,0.43605456],"study_design_scores_gemma":[0.0004771118,0.00020786106,0.0023445436,0.00025484787,0.00001672511,0.000033073145,0.0000064894366,0.8892878,0.0009320366,0.098837145,0.006869534,0.00073280185],"about_ca_topic_score_codex":0.00020067359,"about_ca_topic_score_gemma":0.00026330998,"teacher_disagreement_score":0.43532178,"about_ca_system_score_codex":0.0006524826,"about_ca_system_score_gemma":0.0000647457,"threshold_uncertainty_score":0.99997646},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044877824,0.0009588195,0.9941185,0.0006817177,0.002658983,0.0006609618,0.00000347677,0.00024312464,0.00022560266],"genre_scores_gemma":[0.05559518,0.0001193873,0.9294004,0.012980856,0.0015986603,0.00006812058,0.000059586273,0.000118502096,0.00005933276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514085,0.00016744419,0.0007699273,0.0017542139,0.0011052401,0.0010623493],"domain_scores_gemma":[0.9970282,0.00091076863,0.00049382425,0.0011515346,0.00026597572,0.00014974106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021375765,0.00062422507,0.00057853485,0.000779643,0.00055598415,0.0005776282,0.002476254,0.0002767097,0.00014944014],"category_scores_gemma":[0.000030119067,0.0006664699,0.000095238196,0.002939083,0.000096106225,0.001018969,0.0019454214,0.0010460493,0.000022945864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015017144,0.00001289234,0.00032344897,0.000033619017,0.0000124394355,0.000020780792,0.0011232649,0.81048745,0.000027229042,0.0040510725,0.000048291444,0.18384449],"study_design_scores_gemma":[0.00045190667,0.00013831191,0.00038918928,0.00035146798,0.000019303692,0.000053154377,0.0000017411111,0.92433184,0.000027942937,0.06991511,0.00353032,0.0007896918],"about_ca_topic_score_codex":0.0006724055,"about_ca_topic_score_gemma":0.002233418,"teacher_disagreement_score":0.1830548,"about_ca_system_score_codex":0.0006767214,"about_ca_system_score_gemma":0.00078097574,"threshold_uncertainty_score":0.99957865},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010260802,0.0010188605,0.99126333,0.0002002247,0.0028216182,0.0005997542,0.000040598425,0.00029140757,0.0027380993],"genre_scores_gemma":[0.62391734,0.00005835368,0.3720173,0.00038140133,0.0015200608,0.00004450209,0.00015852103,0.00014322106,0.0017593005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928315,0.000297481,0.0009909833,0.0030622385,0.0017484634,0.0010692914],"domain_scores_gemma":[0.99622405,0.00071830273,0.0006541835,0.0020539393,0.00017219574,0.00017736031],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0027257667,0.0007925111,0.0008989264,0.0011361393,0.0007825578,0.0009373301,0.0073943962,0.00027434566,0.00010579691],"category_scores_gemma":[0.00021986543,0.00078645744,0.00012927216,0.0008201293,0.0003102929,0.0017544847,0.0079231,0.003498461,0.000039304654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002955397,0.00013247928,0.002481953,0.000046372985,0.00003285778,0.0008464801,0.008180736,0.17417039,0.00045201572,0.082253024,0.000014914272,0.73135924],"study_design_scores_gemma":[0.0005365847,0.0009474915,0.00090561924,0.0019522584,0.000024865853,0.00007628196,0.000022189059,0.95396256,0.0007051355,0.012982329,0.025880672,0.002003998],"about_ca_topic_score_codex":0.0024501455,"about_ca_topic_score_gemma":0.00036196114,"teacher_disagreement_score":0.7797922,"about_ca_system_score_codex":0.0009092538,"about_ca_system_score_gemma":0.0008186358,"threshold_uncertainty_score":0.9994586},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062300125,0.000082538914,0.9898966,0.00028964557,0.0002293234,0.002491791,0.0000058676305,0.00033045682,0.00044375204],"genre_scores_gemma":[0.8455858,0.0000019177041,0.15393212,0.00028388496,0.000034013352,0.0001339155,0.0000036668748,0.000017320031,0.0000073101387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634737,0.00024328084,0.00067673926,0.0010454388,0.001263905,0.00042326],"domain_scores_gemma":[0.9975139,0.00035873454,0.0003498183,0.0015148887,0.00019729462,0.00006538721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002616897,0.00036996958,0.00044520423,0.000987755,0.00022002497,0.00023611829,0.0028388628,0.00013334461,0.0000075272355],"category_scores_gemma":[0.000025907833,0.00026731548,0.000064017324,0.0014788768,0.00018165626,0.000700038,0.0003960719,0.00057838025,0.00000248037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012507071,0.0007799014,0.00097298244,0.0003258843,0.000060971543,0.012166631,0.15491256,0.22181368,0.0014130299,0.043843176,0.00004685653,0.56353927],"study_design_scores_gemma":[0.001012203,0.0047424887,0.0008919753,0.00051941385,0.00003239466,0.005917563,0.000064182765,0.9701604,0.0016278989,0.013362689,0.00036998233,0.001298789],"about_ca_topic_score_codex":0.00039070984,"about_ca_topic_score_gemma":0.000872582,"teacher_disagreement_score":0.8393558,"about_ca_system_score_codex":0.0003589392,"about_ca_system_score_gemma":0.0003836698,"threshold_uncertainty_score":0.9999779},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010004141,0.004924281,0.991204,0.0006668856,0.0011680456,0.0005588277,0.00007027714,0.000053445125,0.00035379533],"genre_scores_gemma":[0.08847853,0.000075758035,0.905961,0.0027275563,0.0018580747,0.00017749835,0.00037073228,0.00008545045,0.0002654434],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99740434,0.000058002173,0.00041333414,0.0012822036,0.00033968466,0.0005024622],"domain_scores_gemma":[0.99874485,0.0003618941,0.0001821701,0.0004348992,0.00015103485,0.00012517888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012567645,0.00038542243,0.00042074115,0.00035142215,0.00048980094,0.00026747613,0.0006764764,0.00043466935,0.0000070704627],"category_scores_gemma":[0.00029290773,0.0003533795,0.00016852033,0.0003416243,0.00028661045,0.000010445071,0.0005197774,0.0007508698,4.0369574e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017507744,0.000046798137,0.000105318155,0.0003004232,0.000042325206,0.000009230036,0.0013510488,0.040956993,0.095011726,0.0003206487,0.00034114043,0.8613393],"study_design_scores_gemma":[0.0030285819,0.0016932801,0.00020226778,0.005625651,0.00020678103,0.00006344666,0.000016500857,0.26248646,0.2996898,0.020901065,0.40195292,0.0041332697],"about_ca_topic_score_codex":0.000019457826,"about_ca_topic_score_gemma":0.00004829181,"teacher_disagreement_score":0.857206,"about_ca_system_score_codex":0.00014323939,"about_ca_system_score_gemma":0.0004274217,"threshold_uncertainty_score":0.9998918},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033288874,0.001514539,0.9908425,0.003991436,0.001791779,0.0012182078,0.000007979059,0.00011029405,0.00019032635],"genre_scores_gemma":[0.023310512,0.00018105829,0.97455436,0.000679095,0.0004565155,0.00016494314,0.0000029842454,0.00009480096,0.000555745],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99362916,0.00026375003,0.0005147679,0.0013621281,0.0032548364,0.00097538193],"domain_scores_gemma":[0.97765267,0.018300986,0.0002449102,0.002828953,0.0008585314,0.00011397922],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.008005141,0.00036886567,0.00036703024,0.00078763056,0.0011382329,0.0006117735,0.0096648075,0.00012504093,0.000020376987],"category_scores_gemma":[0.0028781458,0.00024249102,0.00018566435,0.0019726248,0.0014888815,0.00063461706,0.006161692,0.0023000462,0.000009456245],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033590542,0.000061417784,0.00009295547,0.00013016425,0.00003543164,0.000052752966,0.0137859695,0.13697895,0.00020729986,0.049565054,0.00032185216,0.79873455],"study_design_scores_gemma":[0.00042291242,0.0004853008,0.00029318646,0.00046760333,0.000008359443,0.0001186317,0.000006583235,0.04449583,0.0023029372,0.63070923,0.31986362,0.00082579395],"about_ca_topic_score_codex":0.00007280809,"about_ca_topic_score_gemma":0.000043789838,"teacher_disagreement_score":0.7979088,"about_ca_system_score_codex":0.0007719229,"about_ca_system_score_gemma":0.0010979297,"threshold_uncertainty_score":0.99926835},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045324937,0.00007040229,0.953101,0.000017003707,0.00010116013,0.00018697498,0.000021365819,0.0000070509213,0.0011701176],"genre_scores_gemma":[0.9984828,0.0000018420296,0.0013158916,0.000013487123,0.00007474078,0.0000021708609,0.000028219984,0.000015287495,0.00006554335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990411,0.000014061726,0.00021328211,0.00029720474,0.00030413517,0.00013020782],"domain_scores_gemma":[0.99931526,0.000072495284,0.00028129318,0.00020629991,0.00010039157,0.00002423916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084867934,0.00016180854,0.00023456883,0.00010537603,0.00005094267,0.000015909854,0.0001777288,0.000045727007,0.000029200108],"category_scores_gemma":[0.0000015856477,0.00014616591,0.00005968085,0.00012307934,0.00012879346,0.00012940424,0.00006174115,0.0002375251,4.0984057e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033305416,0.000024160065,0.00019347882,0.0000143548095,0.000028847084,4.591815e-7,0.0003594355,0.9045877,0.0017609328,0.0018586768,0.0000031405905,0.0911355],"study_design_scores_gemma":[0.00069579465,0.00045952114,0.00017660494,0.0002496232,0.00008816791,0.0000020195796,0.0000023388156,0.9197333,0.062152814,0.014591807,0.0013315176,0.0005164994],"about_ca_topic_score_codex":0.00016106588,"about_ca_topic_score_gemma":0.00001149432,"teacher_disagreement_score":0.9531579,"about_ca_system_score_codex":0.00006521328,"about_ca_system_score_gemma":0.00013890333,"threshold_uncertainty_score":0.5960473},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005743011,0.0004675617,0.9858855,0.0063574235,0.00036737317,0.0009015777,0.0000031765544,0.00032558732,0.0051174993],"genre_scores_gemma":[0.6152292,0.0010196632,0.380084,0.00284941,0.00006335346,0.00023436364,0.000011907066,0.000043738757,0.00046436564],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713105,0.00005823752,0.00044166553,0.0012018569,0.00072259724,0.0004446147],"domain_scores_gemma":[0.9972634,0.00030033733,0.00024150536,0.0020509637,0.000073544266,0.00007025188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006481414,0.00036759613,0.00034533092,0.0013675197,0.00028577208,0.00035777967,0.0039410368,0.00023725007,0.000022653832],"category_scores_gemma":[0.00007026593,0.0003531242,0.000051758514,0.0008776186,0.00053214264,0.00038830918,0.0031125194,0.0011062156,0.000015150007],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006494793,0.000048951002,0.000084251624,0.00004802675,0.000007951011,0.000031565316,0.0006996203,0.003233122,0.000016638032,0.17032605,0.000027311973,0.82547003],"study_design_scores_gemma":[0.00084746315,0.0005268574,0.0027698833,0.0010352355,0.000012804517,0.000046444864,0.0000053804997,0.42870486,0.0018133635,0.54423326,0.0185394,0.0014650172],"about_ca_topic_score_codex":0.000021337237,"about_ca_topic_score_gemma":0.00006608162,"teacher_disagreement_score":0.824005,"about_ca_system_score_codex":0.00027660799,"about_ca_system_score_gemma":0.00011817976,"threshold_uncertainty_score":0.99989206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000104317485,0.00007888126,0.9898605,0.0009414451,0.0032212653,0.00043625096,0.000004960234,0.00034138054,0.005011037],"genre_scores_gemma":[0.7090381,0.00012213351,0.27877516,0.009998342,0.0012779789,0.000068462774,0.000015859829,0.00010897805,0.0005950108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951514,0.00008492972,0.00054509804,0.0018861671,0.0016724495,0.0006599696],"domain_scores_gemma":[0.9972422,0.00040628336,0.000340204,0.0016538593,0.00016907122,0.00018838535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011276406,0.0005792485,0.00045865742,0.0014311253,0.00087536254,0.0004602692,0.0027526468,0.0003897495,0.00016899063],"category_scores_gemma":[0.000083686,0.0005711645,0.00020265009,0.0010607047,0.0003260282,0.0007400395,0.001506181,0.0017646997,0.00005716827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018968733,0.000027549546,7.1544576e-7,0.000010582798,0.0000021523997,0.00001981868,0.0001359926,0.46299383,0.00018187687,0.007350798,0.000021971604,0.5292358],"study_design_scores_gemma":[0.00025454164,0.00051066483,0.000006289571,0.00013707641,0.000005336374,0.000027405176,5.5677532e-8,0.9027303,0.002398633,0.08592539,0.007446217,0.00055811275],"about_ca_topic_score_codex":0.000032146723,"about_ca_topic_score_gemma":0.00009302426,"teacher_disagreement_score":0.7110853,"about_ca_system_score_codex":0.0009118786,"about_ca_system_score_gemma":0.0005076449,"threshold_uncertainty_score":0.99967396},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031344427,0.0004274627,0.99436456,0.00061774894,0.000747648,0.00042749624,0.0000022679799,0.00035764964,0.002741731],"genre_scores_gemma":[0.21488452,0.000106074156,0.78248,0.0015040603,0.0003284832,0.00004257146,0.00000951484,0.00009166458,0.00055313006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99452025,0.00007350322,0.0004519757,0.002314871,0.0016187682,0.0010206297],"domain_scores_gemma":[0.99747705,0.00044938354,0.00043257952,0.0012199867,0.00019822146,0.00022279895],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006138419,0.00073337357,0.0006178011,0.0014135533,0.00091436773,0.00048242585,0.0035635603,0.0002980307,0.000017881668],"category_scores_gemma":[0.000047626367,0.0006335911,0.00020173981,0.0019808924,0.0010398135,0.0011512698,0.0024913219,0.0036756722,0.000002748302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000131535835,0.000017713584,0.0001465714,0.0000109007115,0.000017803528,0.00013631037,0.0005059796,0.765316,0.000049236696,0.048497748,0.0000074767786,0.1852811],"study_design_scores_gemma":[0.0003257541,0.0004137834,0.00012376907,0.00020878958,0.000012423015,0.00017696818,6.890363e-7,0.6639096,0.00017417756,0.33308908,0.0005448457,0.0010201155],"about_ca_topic_score_codex":0.000015704203,"about_ca_topic_score_gemma":0.00006348311,"teacher_disagreement_score":0.28459135,"about_ca_system_score_codex":0.00023198694,"about_ca_system_score_gemma":0.00032807232,"threshold_uncertainty_score":0.99961156},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004364196,0.00035807097,0.9873958,0.00014435353,0.001952679,0.00037498242,0.000009952183,0.00017787602,0.009542648],"genre_scores_gemma":[0.14849707,0.000076276374,0.8330724,0.002746195,0.0025459116,0.00008062611,0.0001019237,0.00025059917,0.012628945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958801,0.00008094777,0.00046432606,0.001862789,0.0009531457,0.0007586553],"domain_scores_gemma":[0.99715114,0.0006597252,0.00032715255,0.001547071,0.0001405754,0.00017435588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010610566,0.00060790055,0.0005440369,0.00086323905,0.0005986785,0.00057368004,0.0034650748,0.00017072797,0.00006218653],"category_scores_gemma":[0.00006164108,0.0005045608,0.00011206259,0.0005989666,0.0002600451,0.00045256066,0.0013634288,0.001478285,0.00010032383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009640383,0.00008511656,0.000041572497,0.000058303234,0.000023141372,0.0003857214,0.0023459005,0.25737077,0.000028526743,0.15862338,0.00001555771,0.58101237],"study_design_scores_gemma":[0.0008979342,0.0025510243,0.00026270465,0.0035115497,0.000032146185,0.000624125,0.0000025933819,0.623051,0.0020398903,0.019996302,0.3435958,0.0034349274],"about_ca_topic_score_codex":0.000046383244,"about_ca_topic_score_gemma":0.00015275713,"teacher_disagreement_score":0.5775774,"about_ca_system_score_codex":0.0005219929,"about_ca_system_score_gemma":0.00042873365,"threshold_uncertainty_score":0.9997406},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013975392,0.00020326383,0.9966196,0.0012850132,0.000882096,0.00030500308,0.000010340004,0.00010777141,0.00044717191],"genre_scores_gemma":[0.24769434,0.0005064567,0.73348254,0.013376943,0.0035811737,0.0003335719,0.00015079221,0.0001196678,0.0007544832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974525,0.000048005877,0.0003543077,0.0011869916,0.0005395392,0.00041866326],"domain_scores_gemma":[0.99852467,0.00038096093,0.00016874028,0.00073374045,0.00007802706,0.00011387943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050511444,0.00026936503,0.0002495666,0.00035315775,0.00037076973,0.0005158115,0.0018782853,0.00011411034,0.000054649714],"category_scores_gemma":[0.00002569251,0.00026335547,0.000053373788,0.0009749835,0.00035943167,0.00035543944,0.001531913,0.0007174707,0.00003664273],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.3682526e-7,0.000018116989,0.000005280166,0.00000993957,0.0000016127148,0.000017668452,0.0002089547,0.0043255403,0.000019125455,0.00094738073,0.000069488524,0.9943762],"study_design_scores_gemma":[0.000021707587,0.00008436121,0.000026075022,0.00006103095,0.0000031323038,0.00005170569,1.5553117e-7,0.557672,0.00027761486,0.44002506,0.0014521647,0.0003249827],"about_ca_topic_score_codex":0.000020412814,"about_ca_topic_score_gemma":0.000050220984,"teacher_disagreement_score":0.99405116,"about_ca_system_score_codex":0.00018009926,"about_ca_system_score_gemma":0.0003199142,"threshold_uncertainty_score":0.9999819},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01375229,0.00023596453,0.9831578,0.0008651446,0.0005870573,0.0005624196,0.000013596847,0.00007613835,0.0007495569],"genre_scores_gemma":[0.9916891,0.00008886015,0.007286389,0.00057473575,0.00013779633,0.000054629,0.000012728127,0.000015664978,0.00014009546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971548,0.00005607082,0.0004996691,0.0011140291,0.00076034886,0.00041511565],"domain_scores_gemma":[0.998764,0.00019600919,0.00030770586,0.00052465353,0.00010731009,0.00010034077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005878434,0.0003434437,0.00046815618,0.00053817435,0.0002877396,0.00021784625,0.001420409,0.00023680423,0.00003588939],"category_scores_gemma":[0.00005696953,0.00028925747,0.00008002699,0.00068982266,0.0005302182,0.0007342623,0.0010414461,0.00062424643,0.0000032637693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041730415,0.00015891936,0.00016119696,0.0000817541,0.000015100694,0.000023685563,0.2005068,0.0026260575,0.00029429002,0.05677129,0.00009049553,0.73922867],"study_design_scores_gemma":[0.0069635,0.0048107863,0.00976654,0.0029305208,0.000061410756,0.0006558422,0.0017438936,0.8075974,0.0037783952,0.12237805,0.03301472,0.006298966],"about_ca_topic_score_codex":0.00006260267,"about_ca_topic_score_gemma":0.0001867674,"teacher_disagreement_score":0.9779368,"about_ca_system_score_codex":0.00019433838,"about_ca_system_score_gemma":0.00026001703,"threshold_uncertainty_score":0.99995595},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013975392,0.00020326383,0.9966196,0.0012850132,0.000882096,0.00030500308,0.000010340004,0.00010777141,0.00044717191],"genre_scores_gemma":[0.24769434,0.0005064567,0.73348254,0.013376943,0.0035811737,0.0003335719,0.00015079221,0.0001196678,0.0007544832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974525,0.000048005877,0.0003543077,0.0011869916,0.0005395392,0.00041866326],"domain_scores_gemma":[0.99852467,0.00038096093,0.00016874028,0.00073374045,0.00007802706,0.00011387943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050511444,0.00026936503,0.0002495666,0.00035315775,0.00037076973,0.0005158115,0.0018782853,0.00011411034,0.000054649714],"category_scores_gemma":[0.00002569251,0.00026335547,0.000053373788,0.0009749835,0.00035943167,0.00035543944,0.001531913,0.0007174707,0.00003664273],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.3682526e-7,0.000018116989,0.000005280166,0.00000993957,0.0000016127148,0.000017668452,0.0002089547,0.0043255403,0.000019125455,0.00094738073,0.000069488524,0.9943762],"study_design_scores_gemma":[0.000021707587,0.00008436121,0.000026075022,0.00006103095,0.0000031323038,0.00005170569,1.5553117e-7,0.557672,0.00027761486,0.44002506,0.0014521647,0.0003249827],"about_ca_topic_score_codex":0.000020412814,"about_ca_topic_score_gemma":0.000050220984,"teacher_disagreement_score":0.99405116,"about_ca_system_score_codex":0.00018009926,"about_ca_system_score_gemma":0.0003199142,"threshold_uncertainty_score":0.9999819},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80725276,0.013688064,0.15732351,0.0013897144,0.012776363,0.0043607582,0.00023509489,0.00097434595,0.0019993633],"genre_scores_gemma":[0.8590335,0.00012491508,0.1377785,0.0010993321,0.0014233516,0.00004565449,0.00006714593,0.00015766405,0.00026987676],"study_design_codex":"design_other","study_design_gemma":"case_report","domain_scores_codex":[0.99650896,0.000057984642,0.00041209208,0.0013846911,0.0008998344,0.0007364546],"domain_scores_gemma":[0.9986003,0.0001900702,0.00020101013,0.00058243505,0.00012690738,0.00029927873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004990102,0.000640996,0.0008083886,0.00069484813,0.0005198567,0.00037769778,0.00014486653,0.00039870638,0.00027651736],"category_scores_gemma":[0.000051304647,0.0006315691,0.0001274059,0.00039775422,0.00040102654,0.00047001842,0.00094499905,0.0010679199,0.000011635606],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008888238,0.000098967284,0.00042536814,0.00016427708,0.0000422397,0.0021177616,0.0008726125,0.000035889014,0.0066457405,0.00028115133,0.0000021201956,0.989225],"study_design_scores_gemma":[0.09821249,0.14120002,0.012545414,0.054098044,0.0072932933,0.16738592,0.00031598724,0.12792641,0.12419042,0.14149125,0.08850581,0.03683496],"about_ca_topic_score_codex":0.000016113623,"about_ca_topic_score_gemma":0.00011550983,"teacher_disagreement_score":0.95239,"about_ca_system_score_codex":0.0005036199,"about_ca_system_score_gemma":0.0004510637,"threshold_uncertainty_score":0.9996136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015249089,0.000070311755,0.97389954,0.002414557,0.0006492664,0.0006188426,0.000028708046,0.00007676624,0.022089502],"genre_scores_gemma":[0.9780114,0.000053711505,0.012816935,0.0025024803,0.002860959,0.00012732724,0.00014119413,0.00003967941,0.0034463075],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99771714,0.000070306975,0.00033705708,0.0005766856,0.0008839773,0.000414806],"domain_scores_gemma":[0.9987089,0.00047743056,0.00021924778,0.00028466666,0.00022441443,0.00008532339],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019734849,0.00019583809,0.00028521492,0.00045531723,0.002175937,0.00024434534,0.00094258005,0.00019795047,0.00062477303],"category_scores_gemma":[0.00020622491,0.00020766474,0.00018393723,0.0004433598,0.0008578107,0.00034549,0.00015234496,0.00039089896,0.000013641838],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010332286,0.00004059701,0.000048598456,0.0000538844,0.000015413916,0.000001991059,0.024965908,0.013388862,0.000012397692,0.078592226,0.00034167405,0.8825281],"study_design_scores_gemma":[0.0004782452,0.0001973775,0.00015924158,0.00010305739,0.00008255057,0.0000021151882,0.000060052902,0.1437559,0.00010291114,0.32474664,0.5292325,0.0010793918],"about_ca_topic_score_codex":0.0010077924,"about_ca_topic_score_gemma":0.011754511,"teacher_disagreement_score":0.9778589,"about_ca_system_score_codex":0.0008428482,"about_ca_system_score_gemma":0.0008484685,"threshold_uncertainty_score":0.9991231},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24162532,0.0019773645,0.7474796,0.000049042603,0.0014157406,0.0005007949,0.00018834947,0.000021495382,0.006742251],"genre_scores_gemma":[0.9920685,0.00009530556,0.007023148,0.00015498597,0.00010111399,0.0000020164944,0.0003989207,0.000017143479,0.00013881523],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980328,0.000049206537,0.00038255219,0.000946693,0.0003339416,0.0002547756],"domain_scores_gemma":[0.9986096,0.00007090109,0.00017852041,0.00096887565,0.00011757673,0.000054527085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034770093,0.0002704146,0.00048828166,0.000566489,0.00007564733,0.000041311883,0.0011749546,0.00022126784,0.00005957628],"category_scores_gemma":[0.000021526,0.00027492543,0.000107681924,0.0007523267,0.00027902858,0.000013919334,0.0005641809,0.0003633405,0.0000016081577],"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.00012479883,0.00019406383,0.0004925642,0.0000490536,0.000087752414,0.000011322464,0.00046528768,0.0849215,0.8892419,0.000012367856,0.00000912066,0.02439032],"study_design_scores_gemma":[0.0007904932,0.0010023519,0.0003005582,0.000049253147,0.00024687685,0.000004196618,0.000003185233,0.24576542,0.74709827,0.00034566972,0.003648905,0.00074482197],"about_ca_topic_score_codex":0.00016936165,"about_ca_topic_score_gemma":0.001833246,"teacher_disagreement_score":0.7504432,"about_ca_system_score_codex":0.0000809913,"about_ca_system_score_gemma":0.00020971884,"threshold_uncertainty_score":0.9999703},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030597445,0.00013347258,0.9967437,0.00005501658,0.000450612,0.00019839017,0.000013393625,0.000022819186,0.002076628],"genre_scores_gemma":[0.9865724,0.000020954423,0.012112514,0.00003943485,0.0008961913,0.0000067666797,0.0002596667,0.000014750488,0.00007732103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986213,0.000036935282,0.00032404254,0.0006185743,0.00026362404,0.00013552478],"domain_scores_gemma":[0.99868786,0.00019081775,0.00029164276,0.0007379958,0.00006276493,0.000028936436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042643226,0.00015886265,0.00030084403,0.00032300848,0.000119041506,0.000082847575,0.0005447257,0.000049143608,0.0001332892],"category_scores_gemma":[0.000010957354,0.000162137,0.00005472656,0.00033674052,0.00017632723,0.0002079221,0.0008828346,0.00031581408,3.9629697e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008398438,0.000013426811,0.0007569158,0.000004586692,0.000022588243,8.7691456e-7,0.00011487812,0.03977686,0.000048804453,0.003934112,0.00005394581,0.9552646],"study_design_scores_gemma":[0.0001785505,0.000087536195,0.00017097314,0.000083754705,0.000044385106,0.0000025748636,0.0000010699209,0.9306521,0.00038352053,0.06644427,0.0017102901,0.00024098573],"about_ca_topic_score_codex":0.00026815175,"about_ca_topic_score_gemma":0.000103870385,"teacher_disagreement_score":0.98626643,"about_ca_system_score_codex":0.000056674817,"about_ca_system_score_gemma":0.00006667423,"threshold_uncertainty_score":0.6611755},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16267663,0.00025446966,0.66884476,0.005694846,0.009196067,0.002406757,0.00024808053,0.00017462713,0.15050374],"genre_scores_gemma":[0.9919505,0.0000063103057,0.006218674,0.0007512853,0.00006870032,0.000008534822,0.000012857754,0.000021577745,0.0009615258],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984323,0.000029738789,0.00035922468,0.00050606584,0.00042526133,0.00024745622],"domain_scores_gemma":[0.9987948,0.00027626366,0.00025554822,0.0006091776,0.000013905166,0.00005028658],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026215127,0.00022906845,0.00026697907,0.00013666991,0.00036314354,0.00006817169,0.0009193639,0.00008658304,0.012431359],"category_scores_gemma":[0.000039241764,0.00017170396,0.00010851077,0.00025489624,0.00066585577,0.00015431736,0.0007509332,0.0006514075,0.00013323939],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061179955,0.00042164145,0.0011384042,0.000033465927,0.000033128777,0.000037388792,0.0039155576,0.25884223,0.07785088,0.03892691,0.0015208216,0.6172184],"study_design_scores_gemma":[0.0016884297,0.0038304797,0.14354903,0.0015612713,0.00024485058,0.0002875287,0.000015009925,0.21908306,0.055912938,0.2849442,0.2832025,0.005680682],"about_ca_topic_score_codex":0.00018745502,"about_ca_topic_score_gemma":0.0003883261,"teacher_disagreement_score":0.8292739,"about_ca_system_score_codex":0.00032137174,"about_ca_system_score_gemma":0.000035940557,"threshold_uncertainty_score":0.9884714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000121834506,0.0005359262,0.98122793,0.00118087,0.003084123,0.00038255678,0.000016727716,0.00068127573,0.012768752],"genre_scores_gemma":[0.13084504,0.00025563498,0.8530641,0.010668046,0.0014479898,0.00005958198,0.00005509109,0.00021023808,0.0033942822],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99451214,0.000073009,0.0006240315,0.0021405956,0.0017114616,0.0009387432],"domain_scores_gemma":[0.99581665,0.000587154,0.00036084082,0.0028737355,0.0001302748,0.00023131975],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014894773,0.0006753488,0.0006571519,0.0009913705,0.0005973461,0.0010348937,0.007467657,0.00026472227,0.00039782308],"category_scores_gemma":[0.00007237812,0.0006464321,0.00020780557,0.0009140537,0.0006686637,0.0011251954,0.004895163,0.0011887365,0.00015035261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005927738,0.00005091656,0.000011939652,0.00003674242,0.000017863658,0.00030514537,0.00071179203,0.005915066,0.000108216234,0.32379118,0.00016061566,0.6688846],"study_design_scores_gemma":[0.00036682986,0.00023774791,0.00006536194,0.00016111814,0.000008751089,0.0001864084,2.698853e-7,0.47832945,0.00045752796,0.4848647,0.034319803,0.0010020144],"about_ca_topic_score_codex":0.000035540175,"about_ca_topic_score_gemma":0.000024827386,"teacher_disagreement_score":0.66788256,"about_ca_system_score_codex":0.00058854575,"about_ca_system_score_gemma":0.0007930222,"threshold_uncertainty_score":0.9995987},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002297011,0.0003708994,0.9907694,0.003118105,0.0016010191,0.000977408,0.000027358628,0.00020280058,0.0027033219],"genre_scores_gemma":[0.096206285,0.000072950366,0.8973313,0.0038140602,0.00064580643,0.00035012802,0.000037548845,0.000059880025,0.0014820477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963414,0.000026190315,0.0005192365,0.0016861232,0.0007816514,0.00064539124],"domain_scores_gemma":[0.99739087,0.00046849428,0.00020994237,0.0014234598,0.0002925891,0.00021467658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006468695,0.00041073494,0.00042778492,0.0005445678,0.0006837881,0.00045006297,0.0037128034,0.00015664166,0.00011023887],"category_scores_gemma":[0.00009446725,0.000402442,0.00015256251,0.00097116415,0.000365866,0.00043974194,0.0016800101,0.0004324636,0.000060158654],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010724485,0.00007063903,0.000019259276,0.000042377433,0.000017930663,0.000040638268,0.0010365547,0.025418656,0.0008777304,0.21241497,0.0003653063,0.7596852],"study_design_scores_gemma":[0.00050219893,0.0005345901,0.00010008321,0.00019075928,0.00003093832,0.00011453283,0.0000010171019,0.6399837,0.0038190428,0.18329148,0.16984141,0.0015902186],"about_ca_topic_score_codex":0.000049994716,"about_ca_topic_score_gemma":0.000054316097,"teacher_disagreement_score":0.758095,"about_ca_system_score_codex":0.00021066607,"about_ca_system_score_gemma":0.0009792207,"threshold_uncertainty_score":0.99984276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018193254,0.00022177088,0.9898486,0.00050289376,0.0019301545,0.0014966889,0.0001505938,0.0004878255,0.0035421194],"genre_scores_gemma":[0.977056,0.000017085782,0.019822117,0.0021937804,0.00020850949,0.00017184844,0.00012114494,0.00007309723,0.00033640064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979926,0.000008714808,0.00044465347,0.00065863354,0.0005236149,0.00037178837],"domain_scores_gemma":[0.9990933,0.000116316114,0.000056448633,0.00047881715,0.0001411971,0.00011392307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023160217,0.0003524407,0.00034151718,0.00079940725,0.00011203753,0.00009057662,0.0006279261,0.00016355976,0.0003807282],"category_scores_gemma":[0.0000371999,0.0003527905,0.00008330111,0.00071925623,0.00012562684,0.0001521006,0.00007975345,0.0006538215,0.000023512843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051280298,0.000052714928,0.000040712588,0.00016162082,0.000039787425,0.000081088525,0.01232324,0.41591582,0.000097044125,0.0072919633,0.0006199488,0.56332475],"study_design_scores_gemma":[0.004592952,0.0011545882,0.0031002914,0.0026449554,0.000102373444,0.0001558758,0.000048341735,0.52045757,0.0022695765,0.005971218,0.45427355,0.005228673],"about_ca_topic_score_codex":0.000058465113,"about_ca_topic_score_gemma":0.00036387745,"teacher_disagreement_score":0.9752367,"about_ca_system_score_codex":0.0002469895,"about_ca_system_score_gemma":0.0002706676,"threshold_uncertainty_score":0.9998924},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030148876,0.0003778844,0.9919919,0.000063468724,0.00020484702,0.000764581,0.00014402303,0.00014541781,0.006277748],"genre_scores_gemma":[0.53421813,0.000033636203,0.4608623,0.00065901503,0.001879329,0.00020576245,0.0011666934,0.00013884125,0.0008362884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697804,0.00003850915,0.00052600045,0.0011938451,0.0004995112,0.0007640859],"domain_scores_gemma":[0.9983088,0.0003081157,0.00035501446,0.00079929666,0.00011244277,0.00011638141],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077347696,0.00053260213,0.00073668826,0.00033089772,0.0004718003,0.00027818428,0.0013837251,0.00013235913,0.0005293004],"category_scores_gemma":[0.0000057914986,0.0005464158,0.00033709695,0.00037350212,0.00026477597,0.0001745274,0.0011091839,0.00079850445,0.0000020367454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005264264,0.00026746106,0.0014630083,0.00007810709,0.00019893177,0.0000074196973,0.0003090386,0.576355,0.00010318274,0.12969486,0.0068402886,0.28463003],"study_design_scores_gemma":[0.00024507826,0.00009348235,0.000010371446,0.00004690365,0.000039155464,0.0000022992704,4.8463636e-7,0.8906439,0.00006293927,0.04415065,0.06411054,0.0005941826],"about_ca_topic_score_codex":0.00007919971,"about_ca_topic_score_gemma":0.000013722503,"teacher_disagreement_score":0.534188,"about_ca_system_score_codex":0.00021860654,"about_ca_system_score_gemma":0.00012867327,"threshold_uncertainty_score":0.99969876},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024524285,0.00022807623,0.9929302,0.00014897647,0.0016120583,0.002142435,0.000020761949,0.000023431638,0.00044167638],"genre_scores_gemma":[0.71441174,0.000010749682,0.28138337,0.003372464,0.00018153885,0.00041423974,0.000013860393,0.000046094738,0.00016593632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613804,0.00021633081,0.00073840655,0.0015729031,0.0007916704,0.0005426677],"domain_scores_gemma":[0.9965819,0.001132535,0.00051938574,0.0012288438,0.00040528906,0.00013201425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016997226,0.0004997481,0.0007507736,0.00063786947,0.00029226183,0.00022498684,0.0034328478,0.000116341194,0.000111430796],"category_scores_gemma":[0.00005856685,0.00043318837,0.0001675005,0.00036322206,0.00024524424,0.0007959743,0.0014210226,0.0005329934,0.0000036174174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043465768,0.003242478,0.0015545214,0.00023617569,0.00046292905,0.00005349298,0.034576684,0.16273107,0.010445132,0.012039443,0.0000984089,0.77412504],"study_design_scores_gemma":[0.0031195122,0.01779168,0.0008943501,0.0002517896,0.00011005463,0.000013074305,0.00008924849,0.9294097,0.01687811,0.022467127,0.007522157,0.0014532171],"about_ca_topic_score_codex":0.00005580482,"about_ca_topic_score_gemma":0.00008343749,"teacher_disagreement_score":0.7726718,"about_ca_system_score_codex":0.00040081466,"about_ca_system_score_gemma":0.00029610717,"threshold_uncertainty_score":0.999812},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93541306,0.0005650015,0.037040427,0.012652399,0.0025718198,0.003641265,0.00019246928,0.00009102878,0.0078325365],"genre_scores_gemma":[0.99805963,0.0000026670446,0.00053445017,0.0009781319,0.000052011168,0.00026863324,0.0000125470615,0.000016557793,0.0000753757],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850583,0.00019284849,0.0002521311,0.0003786271,0.00030150174,0.00036907193],"domain_scores_gemma":[0.9973232,0.0019289302,0.00011447727,0.000588179,0.000022394684,0.000022822967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001010665,0.00021815866,0.00029606107,0.00042064418,0.0004922305,0.00011194316,0.0014147636,0.00009540405,0.000026298314],"category_scores_gemma":[0.000034197485,0.00014054652,0.000048256512,0.0004557772,0.0010069357,0.0001339605,0.00054578885,0.0012606132,0.0000027119954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017948585,0.0020194862,0.011658912,0.0004250028,0.00004263427,0.00011176055,0.27388534,0.0003945817,0.000007904436,0.30483916,0.0002034603,0.40623224],"study_design_scores_gemma":[0.0027062416,0.008373716,0.09063759,0.0028059524,0.00004542312,0.001601555,0.0045526978,0.0069121383,0.00006139518,0.8733894,0.007172175,0.0017417143],"about_ca_topic_score_codex":0.0004378257,"about_ca_topic_score_gemma":0.006559077,"teacher_disagreement_score":0.5685502,"about_ca_system_score_codex":0.000165785,"about_ca_system_score_gemma":0.00005666092,"threshold_uncertainty_score":0.57313204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008041229,0.00032465847,0.9900578,0.00074860256,0.0035653429,0.0015611302,0.0000130056105,0.00017819509,0.0035431914],"genre_scores_gemma":[0.003167935,0.00009779556,0.9947676,0.0005467631,0.00044077475,0.0002994311,0.000016199692,0.000039459046,0.0006240135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618256,0.00007227209,0.00061812473,0.0012763067,0.0010562148,0.0007945376],"domain_scores_gemma":[0.996256,0.00084736507,0.00050182745,0.0020125962,0.0003009812,0.00008124438],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0035170966,0.00040936627,0.00031587976,0.0004968251,0.0015311047,0.00075168075,0.0053742267,0.00021198968,0.00001099601],"category_scores_gemma":[0.00039083144,0.00032514107,0.00014942113,0.00074982125,0.0006466053,0.0013130029,0.0014492099,0.000784652,0.000012655427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013020282,0.000011084477,0.000002009955,0.000023472221,0.00000485962,0.0000019436825,0.00042247793,0.0035158882,0.00003305274,0.35974374,0.0000529018,0.6361755],"study_design_scores_gemma":[0.00025684026,0.00032641212,0.000070387476,0.00006022316,0.000009795035,0.000049789156,8.223491e-7,0.7123403,0.0009369436,0.09286129,0.19251518,0.0005720423],"about_ca_topic_score_codex":0.000016473237,"about_ca_topic_score_gemma":0.000019369874,"teacher_disagreement_score":0.7088244,"about_ca_system_score_codex":0.00056614086,"about_ca_system_score_gemma":0.0009289351,"threshold_uncertainty_score":0.99992007},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050796483,0.0002550088,0.99208707,0.001976567,0.0010799235,0.0004455759,0.0000040642967,0.00021311943,0.0038878801],"genre_scores_gemma":[0.09728325,0.000020299272,0.90157956,0.00077603845,0.00018090729,0.000021972268,0.000014946953,0.00002928309,0.00009373253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591476,0.00006832852,0.0006430891,0.0014302615,0.001030227,0.0009133415],"domain_scores_gemma":[0.99750257,0.0009241433,0.00036984126,0.0008947072,0.00014561498,0.00016315005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025146315,0.00045343768,0.00045204262,0.0009716498,0.00046587817,0.00067853386,0.0023224433,0.00026765722,0.000057414858],"category_scores_gemma":[0.00021944034,0.0004636938,0.00010321536,0.00085982314,0.0004655571,0.00088723784,0.0014479888,0.001879732,0.00001528239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007086776,0.000033713768,0.00013170158,0.000043909997,0.0000067014275,0.00019573943,0.0012993395,0.087928824,0.000053496788,0.051061828,0.000005995026,0.85923165],"study_design_scores_gemma":[0.00036143625,0.00032818038,0.00008511766,0.0007578695,0.00000815748,0.00028170538,0.0000013428833,0.8904999,0.000097717675,0.09289511,0.013724181,0.00095930835],"about_ca_topic_score_codex":0.0000971535,"about_ca_topic_score_gemma":0.00014912037,"teacher_disagreement_score":0.8582724,"about_ca_system_score_codex":0.0007231736,"about_ca_system_score_gemma":0.0012188524,"threshold_uncertainty_score":0.9997815},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039756298,0.00039886902,0.99633956,0.0005871925,0.0011423721,0.00026607612,0.00003864108,0.00021913569,0.0006105882],"genre_scores_gemma":[0.53006315,0.0000757308,0.4679044,0.00067095907,0.0003900247,0.00003718557,0.000051184496,0.00009969213,0.0007076611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99492055,0.000051254894,0.00061862933,0.0015778792,0.0020980455,0.00073365914],"domain_scores_gemma":[0.9945258,0.0024256615,0.00026962365,0.0023002943,0.0002900117,0.00018859831],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014884077,0.00047083263,0.0008886373,0.0037603148,0.00019005121,0.0002126279,0.0056814514,0.00020314906,0.00022872663],"category_scores_gemma":[0.0006626542,0.0004678015,0.00034220464,0.0043696635,0.0005122058,0.00036358606,0.0029485198,0.0010123453,0.000010871981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008783704,0.00005657167,0.0014282605,0.000072770505,0.0003105341,0.00026120536,0.000925868,0.8134513,0.00022480608,0.018198313,0.000084458174,0.16497712],"study_design_scores_gemma":[0.0002460393,0.00023235052,0.0022771861,0.00010721815,0.00008985839,0.0000228083,9.0296695e-8,0.97708815,0.0009106952,0.014093377,0.0041916454,0.00074060407],"about_ca_topic_score_codex":0.000038797974,"about_ca_topic_score_gemma":0.00012571122,"teacher_disagreement_score":0.5296656,"about_ca_system_score_codex":0.00039265605,"about_ca_system_score_gemma":0.0006155658,"threshold_uncertainty_score":0.9997774},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04540339,0.00009378113,0.95267713,0.0007472843,0.00014278604,0.0006648065,0.000120748955,0.0000125229535,0.00013753233],"genre_scores_gemma":[0.98846275,0.0000061302712,0.011028954,0.00043758797,0.000035330104,0.0000057111138,0.0000013318083,0.000013614574,0.000008603089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974647,0.0005922299,0.0007236916,0.00039834698,0.000595517,0.00022547564],"domain_scores_gemma":[0.9737267,0.024035683,0.0012880014,0.0007693594,0.00014659295,0.000033677927],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00285596,0.00025971944,0.0007547275,0.00014419525,0.00018572372,0.0000034604354,0.00089080667,0.00015531905,0.00004776752],"category_scores_gemma":[0.005211853,0.00011208504,0.00028170372,0.00033954738,0.0031600525,0.000047682584,0.00059274916,0.00045556258,5.940689e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007915894,0.000029759469,0.0081001595,0.00014294301,0.000042728057,4.198852e-7,0.00050162413,0.97971725,0.000037636797,0.009373634,0.000009416576,0.0019652417],"study_design_scores_gemma":[0.00015886743,0.00030953647,0.004293887,0.000289701,0.000041795523,0.0000016878145,0.0000035156372,0.7448299,0.00017968356,0.24980222,0.000005629775,0.00008360902],"about_ca_topic_score_codex":0.00055793807,"about_ca_topic_score_gemma":0.0000616594,"teacher_disagreement_score":0.9430593,"about_ca_system_score_codex":0.00051387714,"about_ca_system_score_gemma":0.00066490803,"threshold_uncertainty_score":0.9995528},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044625992,0.00020198303,0.9970626,0.0009048562,0.0005426117,0.0006040316,0.000086374326,0.000026687077,0.00012454424],"genre_scores_gemma":[0.05154566,0.00005339312,0.9435547,0.0035872997,0.00031115775,0.00003791561,0.0006924756,0.000035316614,0.00018206201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809045,0.000011774839,0.00035426658,0.0006916449,0.00054137124,0.0003105203],"domain_scores_gemma":[0.99924994,0.00019868933,0.0001206892,0.0002795386,0.000045162826,0.000105986095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079161953,0.00023712714,0.00034751496,0.00049728784,0.00020733933,0.00005333314,0.00035175725,0.00007660514,0.00004388963],"category_scores_gemma":[0.00016050453,0.0002095904,0.00007595068,0.00015616941,0.0003545828,0.00013444413,0.00016071409,0.00086892204,0.0000022445593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031413972,0.00004741629,0.00013547824,0.00009865785,0.000007649283,0.00010970866,0.0005720896,0.88974875,0.00067895744,0.000879953,0.000026065654,0.10766385],"study_design_scores_gemma":[0.0010760764,0.0000660963,0.00007971718,0.00028469795,0.000017318649,0.00009124208,4.5254515e-7,0.9931944,0.00012459593,0.0036384468,0.0012244507,0.0002025063],"about_ca_topic_score_codex":0.000039911338,"about_ca_topic_score_gemma":0.00004061814,"teacher_disagreement_score":0.10746135,"about_ca_system_score_codex":0.000403982,"about_ca_system_score_gemma":0.00059875054,"threshold_uncertainty_score":0.8546849},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008716576,0.00014831079,0.9934386,0.0029039271,0.0015081866,0.00068978476,0.000020945106,0.0006988219,0.0005042605],"genre_scores_gemma":[0.014127794,0.0000062702215,0.98411727,0.0013376352,0.00017019111,0.000040583865,0.00004672292,0.000057336176,0.00009619349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540824,0.000089794834,0.0006105266,0.0019590352,0.0009913411,0.00094105705],"domain_scores_gemma":[0.99498844,0.0013824487,0.0004757119,0.0028496503,0.00019337032,0.00011034831],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002240612,0.0005366105,0.00056059,0.00092531164,0.0011230552,0.00091831334,0.017607424,0.0002628141,0.000059705366],"category_scores_gemma":[0.0056538214,0.0005801809,0.00010426498,0.0011081155,0.0005800118,0.0012530029,0.04040782,0.0014371901,0.0000048534343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001516284,0.000022617916,0.000013407316,0.00007188154,0.00002468615,0.00007826758,0.00046711433,0.22571649,0.0019253878,0.008714173,0.00046277783,0.762488],"study_design_scores_gemma":[0.0002870177,0.00017382797,0.0000018805497,0.00015800522,0.000006690928,0.00009416245,0.000002441979,0.7639233,0.0011917311,0.23169053,0.0019824922,0.00048793585],"about_ca_topic_score_codex":0.000066165645,"about_ca_topic_score_gemma":0.00002384887,"teacher_disagreement_score":0.7620001,"about_ca_system_score_codex":0.0010848172,"about_ca_system_score_gemma":0.0011288222,"threshold_uncertainty_score":0.99966496},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010160069,0.00065010635,0.9875915,0.00015761668,0.00014256104,0.00017445216,0.000045972905,0.00002321367,0.0010545113],"genre_scores_gemma":[0.67870486,0.00011435418,0.3193357,0.0007216861,0.00036862274,0.0000079793435,0.0004627717,0.000038650403,0.0002453641],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998103,0.00003707818,0.00037014406,0.0008917585,0.00039035172,0.00020761912],"domain_scores_gemma":[0.99810076,0.00017801135,0.00034638043,0.0010469407,0.00028299887,0.00004490661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031016246,0.00027106603,0.00034562085,0.0002242891,0.00009515251,0.000099590885,0.0007216146,0.00026553648,0.000027629781],"category_scores_gemma":[0.0001750498,0.00025438517,0.00012468714,0.00016685555,0.00041378595,0.000010776616,0.00024639026,0.00023795711,0.0000011789319],"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.000009683667,0.000022083594,0.00022598241,0.000026598014,0.000012159341,0.000007628558,0.00008777355,0.0016422177,0.92379856,0.000015106941,0.00015399868,0.073998176],"study_design_scores_gemma":[0.0001826979,0.0000937286,0.0004814343,0.0005445857,0.000023543827,0.0000014671554,0.0000015531721,0.013211729,0.9828426,0.0015754971,0.00077013957,0.0002709748],"about_ca_topic_score_codex":0.00003280488,"about_ca_topic_score_gemma":0.00007931773,"teacher_disagreement_score":0.6685448,"about_ca_system_score_codex":0.00004678996,"about_ca_system_score_gemma":0.0002741796,"threshold_uncertainty_score":0.9999908},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000061854815,0.0029135123,0.98980075,0.00008709941,0.0032847126,0.0009665404,0.000004222443,0.000166593,0.00271471],"genre_scores_gemma":[0.20682183,0.003515689,0.76969826,0.0104825925,0.0028918157,0.0008920742,0.00019444055,0.00013132433,0.005371981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643284,0.000092598566,0.0006578964,0.0010896408,0.0010888964,0.00063813064],"domain_scores_gemma":[0.99743146,0.00028857056,0.00032958272,0.0015057139,0.00025284398,0.00019182438],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010705821,0.0004483515,0.00047718006,0.0008362631,0.00019851212,0.0018632679,0.002464985,0.00022169786,0.000008487653],"category_scores_gemma":[0.000047206147,0.00042397124,0.00007917496,0.0013018927,0.0003175825,0.0012666088,0.0026894226,0.0005687971,0.00005555898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017075736,0.000018306231,0.000017088569,0.00019945651,0.000013001913,0.000059390823,0.0007428014,0.2812425,0.000006544955,0.0047252118,0.0012066861,0.7117673],"study_design_scores_gemma":[0.0001660698,0.00015600238,0.000010654885,0.00046255297,0.000007448366,0.000047426583,0.0000010074702,0.8983122,0.00012494819,0.0024388852,0.097815454,0.000457319],"about_ca_topic_score_codex":0.000020338683,"about_ca_topic_score_gemma":0.000021523636,"teacher_disagreement_score":0.71131,"about_ca_system_score_codex":0.000841442,"about_ca_system_score_gemma":0.001309752,"threshold_uncertainty_score":0.9998212},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022567296,0.0006423503,0.9849844,0.009360256,0.0014751042,0.00035960614,0.0000028115116,0.00014390254,0.0007748574],"genre_scores_gemma":[0.1866248,0.00019923893,0.77581936,0.028035391,0.008375911,0.0000073590904,0.00019929584,0.00016875975,0.0005698547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961841,0.00010753695,0.0006784116,0.0012168437,0.0012724807,0.0005406062],"domain_scores_gemma":[0.9980394,0.00054290507,0.00026321926,0.00040026644,0.00015325221,0.00060094206],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013373869,0.00043500526,0.0008565347,0.00035898734,0.0001752987,0.00027216776,0.00066395925,0.00036650588,0.00008133395],"category_scores_gemma":[0.0008129207,0.00037543397,0.00018033145,0.0005379405,0.0012509036,0.0001305724,0.0010091418,0.0024437278,0.00002323369],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026543194,0.000073745476,0.00079361245,0.00048191764,0.000041365976,0.0011210497,0.00049417483,0.00029698273,0.00017010336,0.00004714529,0.0022615714,0.99419177],"study_design_scores_gemma":[0.0013826232,0.0003409312,0.003588866,0.0029244944,0.000054359174,0.0012788131,5.001302e-7,0.9851738,0.000059520014,0.0011008459,0.003715274,0.00037994268],"about_ca_topic_score_codex":0.00002659312,"about_ca_topic_score_gemma":0.00000935025,"teacher_disagreement_score":0.99381185,"about_ca_system_score_codex":0.00027681846,"about_ca_system_score_gemma":0.0007684714,"threshold_uncertainty_score":0.99986976},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022567296,0.0006423503,0.9849844,0.009360256,0.0014751042,0.00035960614,0.0000028115116,0.00014390254,0.0007748574],"genre_scores_gemma":[0.1866248,0.00019923893,0.77581936,0.028035391,0.008375911,0.0000073590904,0.00019929584,0.00016875975,0.0005698547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961841,0.00010753695,0.0006784116,0.0012168437,0.0012724807,0.0005406062],"domain_scores_gemma":[0.9980394,0.00054290507,0.00026321926,0.00040026644,0.00015325221,0.00060094206],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013373869,0.00043500526,0.0008565347,0.00035898734,0.0001752987,0.00027216776,0.00066395925,0.00036650588,0.00008133395],"category_scores_gemma":[0.0008129207,0.00037543397,0.00018033145,0.0005379405,0.0012509036,0.0001305724,0.0010091418,0.0024437278,0.00002323369],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026543194,0.000073745476,0.00079361245,0.00048191764,0.000041365976,0.0011210497,0.00049417483,0.00029698273,0.00017010336,0.00004714529,0.0022615714,0.99419177],"study_design_scores_gemma":[0.0013826232,0.0003409312,0.003588866,0.0029244944,0.000054359174,0.0012788131,5.001302e-7,0.9851738,0.000059520014,0.0011008459,0.003715274,0.00037994268],"about_ca_topic_score_codex":0.00002659312,"about_ca_topic_score_gemma":0.00000935025,"teacher_disagreement_score":0.99381185,"about_ca_system_score_codex":0.00027681846,"about_ca_system_score_gemma":0.0007684714,"threshold_uncertainty_score":0.99986976},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022567296,0.0006423503,0.9849844,0.009360256,0.0014751042,0.00035960614,0.0000028115116,0.00014390254,0.0007748574],"genre_scores_gemma":[0.1866248,0.00019923893,0.77581936,0.028035391,0.008375911,0.0000073590904,0.00019929584,0.00016875975,0.0005698547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961841,0.00010753695,0.0006784116,0.0012168437,0.0012724807,0.0005406062],"domain_scores_gemma":[0.9980394,0.00054290507,0.00026321926,0.00040026644,0.00015325221,0.00060094206],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013373869,0.00043500526,0.0008565347,0.00035898734,0.0001752987,0.00027216776,0.00066395925,0.00036650588,0.00008133395],"category_scores_gemma":[0.0008129207,0.00037543397,0.00018033145,0.0005379405,0.0012509036,0.0001305724,0.0010091418,0.0024437278,0.00002323369],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026543194,0.000073745476,0.00079361245,0.00048191764,0.000041365976,0.0011210497,0.00049417483,0.00029698273,0.00017010336,0.00004714529,0.0022615714,0.99419177],"study_design_scores_gemma":[0.0013826232,0.0003409312,0.003588866,0.0029244944,0.000054359174,0.0012788131,5.001302e-7,0.9851738,0.000059520014,0.0011008459,0.003715274,0.00037994268],"about_ca_topic_score_codex":0.00002659312,"about_ca_topic_score_gemma":0.00000935025,"teacher_disagreement_score":0.99381185,"about_ca_system_score_codex":0.00027681846,"about_ca_system_score_gemma":0.0007684714,"threshold_uncertainty_score":0.99986976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087365997,0.00013603858,0.9879654,0.0008881219,0.006254033,0.0003514232,0.0000064956366,0.00023138507,0.0032934565],"genre_scores_gemma":[0.20559973,0.00013689509,0.78841865,0.003530539,0.0016502594,0.000029080722,0.00004877284,0.000050819883,0.000535236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542797,0.00012968839,0.0009902787,0.0018511893,0.0011027041,0.0004981773],"domain_scores_gemma":[0.9971131,0.0005610374,0.0004719158,0.0014543409,0.00023602089,0.00016360282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026332485,0.00038926385,0.0005044971,0.000673227,0.00028781506,0.0004016072,0.0031179271,0.00031367998,0.00018631211],"category_scores_gemma":[0.00019262833,0.0003993542,0.00022537503,0.0004670844,0.00039362465,0.00088774774,0.0023278634,0.0015195587,0.00009056732],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053152585,0.000035127687,0.00010601989,0.000016704847,0.000008383286,0.00004335555,0.0003368991,0.0053370777,0.000010779154,0.007145871,0.000017462831,0.986937],"study_design_scores_gemma":[0.0003477617,0.00021243794,0.00010960156,0.00017668537,0.00001064965,0.000050786108,3.483183e-7,0.83042216,0.000112295216,0.16284996,0.0051334877,0.0005738359],"about_ca_topic_score_codex":0.00004270864,"about_ca_topic_score_gemma":0.00011617537,"teacher_disagreement_score":0.9863632,"about_ca_system_score_codex":0.00054591306,"about_ca_system_score_gemma":0.0007503868,"threshold_uncertainty_score":0.99984586},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012329427,0.0012239415,0.9903282,0.0019367946,0.0023277202,0.00060804695,0.000016727676,0.0003868626,0.0030484248],"genre_scores_gemma":[0.15458375,0.000042696196,0.84114593,0.0027803539,0.00059040583,0.000104784485,0.000021405885,0.00005475542,0.00067593483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963369,0.000036144247,0.00044953218,0.0015609864,0.000832231,0.00078423874],"domain_scores_gemma":[0.9965147,0.0014718429,0.00027172477,0.0015260443,0.000106741376,0.00010894755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077095366,0.00050833105,0.0006145325,0.00067268964,0.00044328213,0.00050324557,0.004418101,0.00020417437,0.00007094767],"category_scores_gemma":[0.00027258167,0.00044240654,0.00024138784,0.00042758588,0.00059012184,0.00045187722,0.0014666253,0.0005875993,0.000014929014],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029006307,0.00005992547,0.00020131047,0.00013878252,0.000021184118,0.00028113672,0.0019823837,0.024224814,0.00013086271,0.093406215,0.00015077821,0.8793736],"study_design_scores_gemma":[0.0011604581,0.0007581304,0.0006692916,0.00039702796,0.00003321007,0.00008147659,0.000006127852,0.74391776,0.002581875,0.22615603,0.022284508,0.0019541103],"about_ca_topic_score_codex":0.000039953644,"about_ca_topic_score_gemma":0.00020275573,"teacher_disagreement_score":0.8774195,"about_ca_system_score_codex":0.00034128374,"about_ca_system_score_gemma":0.00046792752,"threshold_uncertainty_score":0.99980277},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003615059,0.00075265643,0.993519,0.00048699323,0.0015887032,0.0007456668,0.000009398324,0.00017595298,0.0023601206],"genre_scores_gemma":[0.5830869,0.00005184135,0.41523573,0.0006109136,0.00039711467,0.000092567294,0.000025773303,0.0000929085,0.0004062206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952017,0.0001159637,0.0005050104,0.0013557789,0.0022905017,0.0005310669],"domain_scores_gemma":[0.9957323,0.0016368418,0.00024363752,0.0018705819,0.00037803466,0.00013857757],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0031358365,0.00037333064,0.0005101391,0.00097165967,0.00024084946,0.0010810358,0.00892903,0.0001769232,0.00043419024],"category_scores_gemma":[0.0009069599,0.00038287273,0.000092551156,0.0010948717,0.0005455933,0.0016859644,0.00911124,0.0008992229,0.000011619809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021391515,0.000095912845,0.0003962334,0.0001830595,0.000034018525,0.000062616506,0.004369892,0.11103277,0.0002586316,0.06919098,0.00035864583,0.81399584],"study_design_scores_gemma":[0.00038639086,0.00026681772,0.00046332175,0.0002394313,0.000008918508,0.000044158325,3.1114095e-7,0.7628745,0.0020933964,0.22394143,0.009056188,0.00062517263],"about_ca_topic_score_codex":0.0000740584,"about_ca_topic_score_gemma":0.000014299037,"teacher_disagreement_score":0.8133707,"about_ca_system_score_codex":0.000397079,"about_ca_system_score_gemma":0.0014238905,"threshold_uncertainty_score":0.99995595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021536208,0.0015342789,0.9892237,0.0020581519,0.0007266469,0.00017747347,0.0000032569644,0.0002732899,0.0038495837],"genre_scores_gemma":[0.5484264,0.00042725887,0.44344977,0.0012703731,0.00096195214,0.000012019398,0.000020068861,0.00010020564,0.005331951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966967,0.000098557684,0.0004188901,0.001315726,0.000804202,0.00066588446],"domain_scores_gemma":[0.9982198,0.0005330044,0.0002644233,0.0006412529,0.0001445137,0.00019701954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010607874,0.0004910282,0.00056976837,0.0008707835,0.0007739216,0.0006079522,0.0019315401,0.00017150537,0.000045510023],"category_scores_gemma":[0.000111384725,0.0004787935,0.00013420073,0.0005678195,0.0008071927,0.0003993921,0.0025827743,0.0017595608,0.000017887012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000092978735,0.000047827885,0.0003112611,0.000118286036,0.000042401713,0.00022240447,0.015159486,0.40517458,0.00043777333,0.1275504,0.000022344544,0.45090392],"study_design_scores_gemma":[0.00027958446,0.0002840624,0.0000638075,0.00022278492,0.000013168218,0.00019362415,0.0000044456033,0.9723929,0.0000697316,0.012908711,0.012919397,0.0006477516],"about_ca_topic_score_codex":0.000061291954,"about_ca_topic_score_gemma":0.000017115311,"teacher_disagreement_score":0.56721836,"about_ca_system_score_codex":0.00051475543,"about_ca_system_score_gemma":0.0007026258,"threshold_uncertainty_score":0.99976635},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035824737,0.00083258486,0.9876854,0.0013061054,0.0028301715,0.00086455856,0.00007399968,0.00010617356,0.0059427484],"genre_scores_gemma":[0.4666156,0.0001628998,0.4673901,0.014424819,0.003695172,0.00062676985,0.0004011359,0.00019997754,0.04648356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9857778,0.00013802708,0.0009763491,0.0037597707,0.008502409,0.0008456723],"domain_scores_gemma":[0.99168396,0.004075142,0.00052746857,0.0021388875,0.0012398179,0.000334722],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.018721327,0.0004194488,0.0005141074,0.00329292,0.0022267043,0.0029567576,0.007595229,0.00011436055,0.00040227527],"category_scores_gemma":[0.003499832,0.00036828202,0.00009103313,0.010169228,0.002629552,0.0008480483,0.008085874,0.00090252125,0.00016107685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042137594,0.000048640188,0.000056626082,0.000012142594,0.0000042837673,0.00001587393,0.0003767791,0.21496353,0.000017496766,0.0077842404,0.0047353227,0.7719809],"study_design_scores_gemma":[0.00016747619,0.00005021935,0.0004964285,0.000045148667,0.0000079107685,0.000039747407,0.000004914883,0.701027,0.000017497665,0.17875499,0.11895116,0.00043756058],"about_ca_topic_score_codex":0.000007806622,"about_ca_topic_score_gemma":0.000022048325,"teacher_disagreement_score":0.7715433,"about_ca_system_score_codex":0.0009080712,"about_ca_system_score_gemma":0.003475347,"threshold_uncertainty_score":0.9999365},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16415104,0.009313511,0.5366518,0.031796966,0.0069394787,0.0060716253,0.000053547647,0.0013497248,0.2436723],"genre_scores_gemma":[0.97291994,0.0007006622,0.023979971,0.00039171596,0.00057741755,0.000013213664,0.000019754814,0.000049963575,0.0013473614],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956812,0.00035655327,0.0003925815,0.0011369885,0.0016754771,0.0007571559],"domain_scores_gemma":[0.9983017,0.00081014406,0.00035400453,0.00034648334,0.000044074204,0.00014362209],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0023381105,0.00036372017,0.0004951147,0.0008493157,0.0015805073,0.00026004226,0.0013410999,0.0001955175,0.00084097823],"category_scores_gemma":[0.00026318865,0.00036816762,0.00011916062,0.0005065239,0.0015567616,0.00033479903,0.0011320342,0.0021172704,0.00003053314],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018718141,0.00031675925,0.031300455,0.00003072234,0.000056456924,0.0003640896,0.19865876,0.24258502,0.00024244499,0.020407706,0.000017280247,0.5060016],"study_design_scores_gemma":[0.0028787395,0.0013478189,0.07467643,0.002223901,0.00015343279,0.000056973135,0.01913751,0.08977317,0.00014915355,0.067617744,0.736023,0.0059621055],"about_ca_topic_score_codex":0.000263094,"about_ca_topic_score_gemma":0.00061613333,"teacher_disagreement_score":0.80876887,"about_ca_system_score_codex":0.0010411592,"about_ca_system_score_gemma":0.0005727479,"threshold_uncertainty_score":0.99987704},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033188802,0.0014837706,0.99055105,0.0013484403,0.0011408965,0.0006908,0.0000060011307,0.0001583504,0.0013017912],"genre_scores_gemma":[0.83352274,0.000010001781,0.1657979,0.00039200313,0.00017302246,0.000035156376,0.000008152936,0.00002638506,0.00003464423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996682,0.00018449215,0.0005462646,0.00094776775,0.0011301773,0.00050933496],"domain_scores_gemma":[0.99798214,0.0005289302,0.0004952259,0.00084237213,0.00008518157,0.000066130684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025819354,0.00035376806,0.00032458338,0.00041657552,0.0007874086,0.00041961472,0.002907278,0.00012441384,0.000008324723],"category_scores_gemma":[0.00012817905,0.00023878358,0.00012155456,0.0008350788,0.0007323072,0.0005960743,0.0016656038,0.0018875129,0.0000014200848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002112498,0.000018713523,0.0003877918,0.0000140299435,0.0000063067814,0.0000022026463,0.0058524446,0.14516905,0.00007123801,0.015477707,4.0831168e-7,0.832998],"study_design_scores_gemma":[0.00020428281,0.00010492369,0.00033785094,0.00017162958,0.0000065468394,0.00005880105,0.000007100727,0.9708738,0.00015968888,0.023090396,0.0046758964,0.00030909386],"about_ca_topic_score_codex":0.001153852,"about_ca_topic_score_gemma":0.00026408123,"teacher_disagreement_score":0.8326889,"about_ca_system_score_codex":0.00028733685,"about_ca_system_score_gemma":0.0003819926,"threshold_uncertainty_score":0.9737312},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014555853,0.00019059352,0.99369067,0.0029894442,0.001333766,0.0005035236,0.00014845292,0.00017698236,0.00082101405],"genre_scores_gemma":[0.003271604,0.00004210124,0.9929347,0.003025506,0.00029030436,0.000089983885,0.00004948731,0.000043337466,0.0002529787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953701,0.0000406808,0.00056037476,0.0020196494,0.0012571026,0.00075208856],"domain_scores_gemma":[0.99697274,0.0004778831,0.00012389812,0.0018575169,0.0001969787,0.00037096828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068363664,0.000523563,0.00051477953,0.0008013538,0.00041585494,0.00056717393,0.0044837524,0.00015194643,0.0001390224],"category_scores_gemma":[0.00008516423,0.00050185405,0.00013212716,0.0009624089,0.00034017314,0.0005649889,0.0030843904,0.00083314214,0.00015656804],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024626506,0.00007087556,0.000020509,0.000013872294,0.00001381599,0.00012265665,0.00097244466,0.004501467,0.00007552728,0.04917092,0.00013701212,0.9448984],"study_design_scores_gemma":[0.00028630823,0.00062769995,0.00026153657,0.0002351131,0.000014427552,0.00009452767,0.0000011834578,0.941259,0.00054896995,0.028627302,0.02697274,0.0010711406],"about_ca_topic_score_codex":0.00017710567,"about_ca_topic_score_gemma":0.00008591486,"teacher_disagreement_score":0.9438273,"about_ca_system_score_codex":0.00044434855,"about_ca_system_score_gemma":0.00045028277,"threshold_uncertainty_score":0.9997433},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009822517,0.00015388802,0.988787,0.00097294716,0.002029666,0.0004983772,0.00021503247,0.000019481195,0.0072254064],"genre_scores_gemma":[0.561445,0.00028799498,0.39798102,0.011343303,0.0010344511,0.00014905531,0.00022867597,0.00013544367,0.027395027],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952286,0.000055287517,0.0008207253,0.0012132,0.0023382804,0.00034391033],"domain_scores_gemma":[0.9951382,0.0026203112,0.0005127086,0.0014688717,0.00020290042,0.00005698891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005158552,0.00025854833,0.00053871755,0.0011075482,0.00021537469,0.00042764263,0.0037487962,0.000099883444,0.00022261533],"category_scores_gemma":[0.00088482955,0.00020305996,0.00024208766,0.0007055175,0.0008141176,0.0007268924,0.0020566478,0.00030360062,0.000015769388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027434331,0.000040420895,0.000039105693,0.000041545,0.000014496712,0.00001048778,0.00043297067,0.0089349,0.00004274214,0.40141767,0.0011355166,0.5878627],"study_design_scores_gemma":[0.000176252,0.00018396536,0.00007323898,0.000052549345,0.000010139135,0.00000275302,0.0000016757293,0.0074543,0.00028062734,0.9173114,0.0741903,0.0002628262],"about_ca_topic_score_codex":0.000037091435,"about_ca_topic_score_gemma":0.00012622112,"teacher_disagreement_score":0.59080595,"about_ca_system_score_codex":0.00009226978,"about_ca_system_score_gemma":0.00024661832,"threshold_uncertainty_score":0.8280545},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000865903,0.002006942,0.99204844,0.00022802099,0.0013946162,0.0003098214,0.000001391262,0.00012316053,0.0030217203],"genre_scores_gemma":[0.90075004,0.00006919188,0.096966155,0.00023924084,0.00029839584,0.000017439734,0.0000012017023,0.000046161986,0.0016121491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663216,0.00022747972,0.0005522702,0.0014056923,0.0005552169,0.00062719965],"domain_scores_gemma":[0.99727315,0.0015808592,0.00021617739,0.0007122671,0.00008075067,0.00013680763],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022228495,0.00044241652,0.0005326327,0.0011929491,0.0005583935,0.0004983464,0.0013600404,0.00016367338,0.000029161256],"category_scores_gemma":[0.00028928302,0.0004453125,0.00008352101,0.0005255832,0.00030882264,0.0005546977,0.0014465312,0.0016224127,0.000008194997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022393295,0.000044827768,0.0015021603,0.00016575432,0.000017854518,0.0008729828,0.018586146,0.05896002,0.00043130098,0.19554606,0.0000024368326,0.72384804],"study_design_scores_gemma":[0.00066177075,0.00038186798,0.0018327005,0.0021295324,0.000011301274,0.00049595995,0.000013946677,0.9185502,0.0010879642,0.050830606,0.022044001,0.0019601618],"about_ca_topic_score_codex":0.000060756698,"about_ca_topic_score_gemma":0.00023679453,"teacher_disagreement_score":0.89988416,"about_ca_system_score_codex":0.00042567818,"about_ca_system_score_gemma":0.00036829553,"threshold_uncertainty_score":0.99979985},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018002553,0.0040542614,0.33966756,0.5369798,0.013640567,0.0025539997,0.0001245855,0.0001906019,0.10260863],"genre_scores_gemma":[0.4042193,0.004255894,0.049817238,0.46878663,0.02023018,0.00024602952,0.00004282113,0.00033046817,0.05207143],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969895,0.00008637776,0.00030909546,0.0007260048,0.0012116937,0.00067731505],"domain_scores_gemma":[0.9967837,0.0015950507,0.00019949085,0.0005554801,0.0006832306,0.000183099],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0026009216,0.00029316355,0.0003239833,0.00023713241,0.0027508053,0.0015643922,0.0021477556,0.00035288357,0.00076747575],"category_scores_gemma":[0.000678079,0.00023101662,0.00022710463,0.00044319854,0.00198851,0.0008452793,0.00044418414,0.0014785979,0.000014053792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010266694,0.000036718942,0.00010164745,0.000052879845,0.000024584133,0.000008518311,0.12557517,0.00048269122,0.000004248912,0.40074152,0.006205034,0.46675673],"study_design_scores_gemma":[0.00006735481,0.000067466506,0.0000149550715,0.00009375427,0.000009801656,0.0000011361516,0.000014731728,0.00072843075,0.000011635045,0.4611028,0.5376268,0.00026110583],"about_ca_topic_score_codex":0.001136008,"about_ca_topic_score_gemma":0.002212228,"teacher_disagreement_score":0.5314218,"about_ca_system_score_codex":0.0004588659,"about_ca_system_score_gemma":0.0026987973,"threshold_uncertainty_score":0.9994721},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0602967,0.0030459329,0.87985694,0.0030005348,0.0026642664,0.0012575979,0.000031418556,0.00013102478,0.04971557],"genre_scores_gemma":[0.9895881,0.00048476338,0.008808943,0.0005706306,0.00021465852,0.000008368569,0.0000065595623,0.000014365681,0.0003036572],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974223,0.000071867784,0.00037549814,0.0006451887,0.001126429,0.00035874223],"domain_scores_gemma":[0.9983818,0.00082002423,0.00033012358,0.00025178812,0.00012407426,0.00009219433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009847401,0.00022887367,0.0003045521,0.0002807613,0.00049585983,0.0001699629,0.0008594523,0.00011619142,0.0004355861],"category_scores_gemma":[0.00012481953,0.00022766148,0.0000491988,0.0004339567,0.0017911392,0.00066345045,0.00047943095,0.00031557688,0.0000024741182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003296902,0.000049902475,0.0049206265,0.000143674,0.000035600435,0.00003300674,0.36331543,0.003988019,0.0005655526,0.056061886,0.000012137369,0.5708412],"study_design_scores_gemma":[0.0010260356,0.0016748239,0.0032609205,0.0037486865,0.00015948617,0.000041025665,0.008699797,0.11243795,0.03546859,0.7937717,0.034666654,0.005044352],"about_ca_topic_score_codex":0.0030482474,"about_ca_topic_score_gemma":0.0056725196,"teacher_disagreement_score":0.92929137,"about_ca_system_score_codex":0.00025573382,"about_ca_system_score_gemma":0.00032842145,"threshold_uncertainty_score":0.9283766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026410094,0.00058574363,0.97464764,0.00054873683,0.0026545299,0.00056482817,0.00007097768,0.000095613126,0.018190913],"genre_scores_gemma":[0.9123153,0.0000131085435,0.07993776,0.0004888831,0.0002537214,0.00002112636,0.000037529197,0.00004995191,0.00688262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923132,0.000082260514,0.001237451,0.0020632592,0.0037963707,0.00050743774],"domain_scores_gemma":[0.9952272,0.0011665355,0.000997654,0.0019487509,0.0005505873,0.00010927845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0057223206,0.0003702239,0.0005834316,0.0016306837,0.0006271913,0.00070426014,0.0031355836,0.00011809278,0.0005521114],"category_scores_gemma":[0.0015611837,0.0002994919,0.00015572709,0.0025333976,0.0012712249,0.00041557627,0.0024527407,0.00060305314,0.000046540797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000126111845,0.000052862637,0.00020872569,0.000022160528,0.000005803007,0.000020093888,0.0011556915,0.5824188,0.000049255876,0.009800447,0.00043723985,0.40581632],"study_design_scores_gemma":[0.000261334,0.00013391378,0.0010622876,0.00036247936,0.000015579575,0.000014219334,0.000006442483,0.84568405,0.00018006662,0.101185925,0.05055087,0.0005428447],"about_ca_topic_score_codex":0.000048489183,"about_ca_topic_score_gemma":0.000031026342,"teacher_disagreement_score":0.9096743,"about_ca_system_score_codex":0.00026954024,"about_ca_system_score_gemma":0.0007182461,"threshold_uncertainty_score":0.9999457},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024081446,0.002566109,0.9882709,0.0022841021,0.00116691,0.00053418864,0.000003179334,0.00023624428,0.0049143126],"genre_scores_gemma":[0.03979102,0.00060075853,0.95063955,0.0061848303,0.00162523,0.000125303,0.000014094731,0.000103324775,0.00091588526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959003,0.000041178875,0.000474619,0.0019167997,0.0008259398,0.0008411795],"domain_scores_gemma":[0.9973134,0.00035319463,0.0003005513,0.0016894628,0.00010379768,0.00023960572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050603406,0.0005306589,0.00049515377,0.0003805159,0.00072183873,0.00036463502,0.0032072347,0.00019457193,0.00006544545],"category_scores_gemma":[0.000030402702,0.00052371435,0.00009459164,0.0010679588,0.0004971206,0.0006218108,0.0032748955,0.0010701494,0.000030184892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031292973,0.000019749326,0.00002137956,0.0000165194,0.000010515971,0.000089553236,0.00045287996,0.1981685,0.000104968974,0.14918803,0.00018263486,0.65174216],"study_design_scores_gemma":[0.00021663505,0.00015511001,0.00009126415,0.00009005241,0.000009825043,0.00019786193,1.07942206e-7,0.5122147,0.00018518021,0.41855568,0.06743776,0.0008458237],"about_ca_topic_score_codex":0.000009079508,"about_ca_topic_score_gemma":0.000069747686,"teacher_disagreement_score":0.6508963,"about_ca_system_score_codex":0.00025966731,"about_ca_system_score_gemma":0.0002222375,"threshold_uncertainty_score":0.99972147},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005746935,0.000794697,0.98666686,0.0025673702,0.0025218157,0.00046421756,0.0000032602154,0.00011000432,0.0011248334],"genre_scores_gemma":[0.19734566,0.00026646804,0.7694582,0.019843446,0.0073685576,0.000007788326,0.0003320354,0.00024841586,0.005129466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961548,0.00010387462,0.0006620598,0.0011714288,0.0012990874,0.00060875627],"domain_scores_gemma":[0.99788105,0.0006766481,0.00029024226,0.0005761737,0.0001865358,0.00038935337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00197853,0.00043926304,0.0008708394,0.00064420234,0.00014695311,0.00026320035,0.0006771563,0.0004418535,0.000081167826],"category_scores_gemma":[0.00048287588,0.00036940345,0.0001821354,0.00039908197,0.0011296878,0.00015713244,0.0009136457,0.0022200383,0.000047948393],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023212418,0.000095256764,0.0015535435,0.0004719191,0.00004055993,0.00033954563,0.00031900458,0.0005758296,0.00015582323,0.000067781766,0.002424519,0.993933],"study_design_scores_gemma":[0.0017378572,0.0003428956,0.0073579075,0.0043233484,0.0000515188,0.0012213285,3.6810206e-7,0.9803883,0.000053081498,0.00088506786,0.0032074556,0.00043087127],"about_ca_topic_score_codex":0.000050035018,"about_ca_topic_score_gemma":0.0000093931885,"teacher_disagreement_score":0.99350214,"about_ca_system_score_codex":0.0003418039,"about_ca_system_score_gemma":0.0008546401,"threshold_uncertainty_score":0.9998758},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003061454,0.00052035664,0.9746068,0.0041496404,0.00373003,0.00041744148,0.000017933884,0.00030143134,0.016225746],"genre_scores_gemma":[0.08175945,0.0002630405,0.8733921,0.03695103,0.001981977,0.000078206154,0.000017448925,0.00020149423,0.0053552156],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938846,0.000058049347,0.000789961,0.0023569772,0.0018897131,0.0010206532],"domain_scores_gemma":[0.99587196,0.00067137805,0.00039042762,0.002579797,0.00024499794,0.00024145607],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011034518,0.00068849727,0.00065652444,0.0010786895,0.000617823,0.000779074,0.008029155,0.00027701797,0.0009193845],"category_scores_gemma":[0.000117177864,0.0006892173,0.0002528234,0.0010287197,0.0010774949,0.0009545197,0.0042873,0.0014426658,0.00044164553],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005817236,0.0000390981,0.000052329084,0.000024629579,0.000017412758,0.00023722224,0.0026172008,0.018104108,0.00020554781,0.1303149,0.00070209446,0.8476796],"study_design_scores_gemma":[0.00007683728,0.00022944412,0.00002087449,0.00010609743,0.000007700212,0.00009726538,3.761063e-7,0.33399498,0.0024489567,0.54638374,0.115594715,0.0010390305],"about_ca_topic_score_codex":0.000097161304,"about_ca_topic_score_gemma":0.00006637443,"teacher_disagreement_score":0.8466406,"about_ca_system_score_codex":0.000565352,"about_ca_system_score_gemma":0.0006961414,"threshold_uncertainty_score":0.9999939},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002250707,0.00020642881,0.9799568,0.0034539944,0.0035788207,0.0009447296,0.0000073511073,0.0002491916,0.009351958],"genre_scores_gemma":[0.8154882,0.000050812272,0.15731844,0.02322468,0.0011648195,0.0002610146,0.0000080108,0.00014018337,0.0023438304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99397796,0.00018472598,0.00068719947,0.0020583957,0.0021845163,0.0009072184],"domain_scores_gemma":[0.9944749,0.0024198012,0.00034813254,0.0022345881,0.00031591827,0.00020668616],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002923218,0.0006519624,0.00051207514,0.0008471773,0.0011908384,0.00097646395,0.0058641005,0.00019291052,0.00027789566],"category_scores_gemma":[0.0009263417,0.0005117917,0.00019747278,0.0013408154,0.0006055762,0.00057440303,0.0029148425,0.0015110796,0.00019847817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065967374,0.000028232967,0.00001338231,0.0000081544695,0.0000091452475,0.00003077524,0.0014497666,0.3489779,0.00027512098,0.04200754,0.00011951725,0.60707384],"study_design_scores_gemma":[0.000071950584,0.0006936329,0.00004938601,0.00037992976,0.000010602967,0.000036020094,0.000002124013,0.8542352,0.0062594665,0.13223372,0.0051020184,0.000926004],"about_ca_topic_score_codex":0.00009839445,"about_ca_topic_score_gemma":0.000098094766,"teacher_disagreement_score":0.8226384,"about_ca_system_score_codex":0.00078449305,"about_ca_system_score_gemma":0.0007185711,"threshold_uncertainty_score":0.9997334},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012366155,0.0008415526,0.9835942,0.0006788896,0.0009905435,0.00016405471,0.000004101455,0.00007600024,0.0012845219],"genre_scores_gemma":[0.98265034,0.00003128585,0.0154778315,0.0009769074,0.000692326,0.000005942244,0.000036427104,0.00003483382,0.00009413215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981695,0.000005093749,0.00036945456,0.00064926443,0.0005348872,0.0002718093],"domain_scores_gemma":[0.9988889,0.000067048255,0.0004211263,0.00035754492,0.00024964116,0.000015722102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032504878,0.0002895938,0.00039629848,0.00079266925,0.00043223694,0.00032585076,0.0005935774,0.00012051491,0.00013877265],"category_scores_gemma":[0.000052799995,0.0002681957,0.00008352671,0.0007275417,0.0003440716,0.0007435854,0.000616369,0.00038312696,0.0000029086473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014344581,0.000012099745,0.0014900453,0.00027433748,0.000030067278,0.0000150316255,0.0002078427,0.5238668,0.00017929602,0.006690522,0.000010322507,0.4672093],"study_design_scores_gemma":[0.00019006534,0.000006654879,0.000350176,0.0001649958,0.00005928843,0.0000058621135,5.1550626e-7,0.881056,0.000017957855,0.11666495,0.0011052242,0.0003782868],"about_ca_topic_score_codex":0.00033946533,"about_ca_topic_score_gemma":0.00011519438,"teacher_disagreement_score":0.97028416,"about_ca_system_score_codex":0.000055449913,"about_ca_system_score_gemma":0.00008057826,"threshold_uncertainty_score":0.99997705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044716624,0.00044651196,0.9794261,0.00019638664,0.0024080037,0.0003263068,0.0000017211851,0.0001491656,0.017001122],"genre_scores_gemma":[0.89375824,0.000023101318,0.10438109,0.00037657592,0.00034201954,0.0000120109435,0.000009637099,0.000026252903,0.0010710503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968453,0.000047420577,0.0005388957,0.0010021785,0.0011242635,0.00044192167],"domain_scores_gemma":[0.997901,0.00023019711,0.00044530898,0.0011529122,0.00017571093,0.000094828276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010803596,0.00034007136,0.00046845997,0.00067359384,0.00020944371,0.00030195017,0.0028081562,0.00018506814,0.00011604433],"category_scores_gemma":[0.00004788604,0.00030087656,0.00014015895,0.00062827236,0.00042778856,0.0004978436,0.0012650472,0.0005033673,0.000047031597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029283847,0.00003403201,0.00014811616,0.000086522115,0.00001314814,0.000049953916,0.0013241451,0.007921781,0.000050156337,0.5849235,0.000035161294,0.40541053],"study_design_scores_gemma":[0.0002543339,0.000330629,0.00013522049,0.000036241792,0.000008722406,0.000100072866,3.616193e-7,0.21108706,0.0003604873,0.7764015,0.0107554,0.00052996556],"about_ca_topic_score_codex":0.000041857536,"about_ca_topic_score_gemma":0.000030694042,"teacher_disagreement_score":0.89371353,"about_ca_system_score_codex":0.00024396287,"about_ca_system_score_gemma":0.00033178966,"threshold_uncertainty_score":0.9999443},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015776593,0.00083435205,0.98813456,0.0003166333,0.0057270727,0.00079673086,0.000027799302,0.00022816782,0.0037769077],"genre_scores_gemma":[0.45811167,0.00008598688,0.53908193,0.00068488985,0.00087565184,0.00006587745,0.000016555055,0.00012155646,0.00095589895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99340135,0.00015286497,0.0011046341,0.0023633733,0.0020467294,0.00093107735],"domain_scores_gemma":[0.9940993,0.001393615,0.00077150244,0.0030389326,0.00045049938,0.0002461136],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018952595,0.0007531234,0.0012490586,0.0013194984,0.00040063995,0.0004552385,0.007299326,0.00029708102,0.0000924192],"category_scores_gemma":[0.00018942682,0.00074787484,0.00028277756,0.0013660749,0.0010792089,0.00060445844,0.005211458,0.0010608876,0.000027678472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002501192,0.00023040135,0.0003281326,0.0007714867,0.00006492509,0.00077567156,0.0014818213,0.44913876,0.0003350116,0.11146864,0.00009097606,0.43528917],"study_design_scores_gemma":[0.00038405368,0.0005538695,0.00021638493,0.0003545113,0.00002130837,0.00031770227,7.713688e-7,0.9091641,0.00024299102,0.082595125,0.0050790613,0.0010701607],"about_ca_topic_score_codex":0.00014464298,"about_ca_topic_score_gemma":0.00004279013,"teacher_disagreement_score":0.4600253,"about_ca_system_score_codex":0.000779482,"about_ca_system_score_gemma":0.0011314929,"threshold_uncertainty_score":0.99949723},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000117804804,0.00020022999,0.9920104,0.0008482566,0.001159035,0.0011246046,0.000008569246,0.000608629,0.0039224527],"genre_scores_gemma":[0.023724379,0.00005118008,0.974112,0.0016121351,0.00019061695,0.00013656334,0.000026444552,0.00004683779,0.000099853736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954054,0.000112806454,0.0005963946,0.001816583,0.0013965643,0.00067228876],"domain_scores_gemma":[0.9967226,0.00031411822,0.000502196,0.0019832018,0.00030182741,0.0001760887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013299838,0.000567648,0.0004884172,0.00081442465,0.000469138,0.00061366236,0.0036784254,0.00026612217,0.00007985645],"category_scores_gemma":[0.00013983752,0.0005055976,0.00009866608,0.0013549025,0.0012751453,0.0013004991,0.00087500317,0.0010840055,0.000022467664],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019744883,0.00006959324,0.000026317515,0.000037532733,0.000015318103,0.0000417709,0.0005437992,0.0075875786,0.00028229674,0.10033706,0.00002132324,0.8910177],"study_design_scores_gemma":[0.0009959714,0.002430039,0.000813503,0.00045373873,0.000041765306,0.00047730206,0.0000018079801,0.82073724,0.005183704,0.094717726,0.07180491,0.0023422712],"about_ca_topic_score_codex":0.000021044501,"about_ca_topic_score_gemma":0.000028341545,"teacher_disagreement_score":0.8886754,"about_ca_system_score_codex":0.0004841248,"about_ca_system_score_gemma":0.0006031108,"threshold_uncertainty_score":0.9997396},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021344114,0.00012968956,0.9922703,0.0000062983668,0.0008913312,0.00014722772,0.000011190458,0.00012892712,0.0042806566],"genre_scores_gemma":[0.7961513,0.00007270517,0.19458818,0.00028111305,0.0059783417,0.000043743665,0.00021205559,0.00016486808,0.002507686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988684,0.000017912416,0.00024839022,0.00038131778,0.00027002496,0.00021394242],"domain_scores_gemma":[0.99948984,0.000116442345,0.000054617078,0.00022511443,0.00006783133,0.000046156594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035929692,0.00019337144,0.0003080848,0.0009928582,0.00007238952,0.00020384352,0.0001469154,0.00025896757,0.00001179944],"category_scores_gemma":[0.00002252507,0.0001808193,0.000075592645,0.0011521475,0.000113893315,0.00014459113,0.0000511738,0.00035923757,0.000016507616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028755992,0.0000051752204,0.00006490658,0.00006763079,0.000046338202,0.000020585354,0.00011236835,0.065522686,0.0006488331,0.0000016791337,0.00065000844,0.9328569],"study_design_scores_gemma":[0.00027642646,0.00007587149,0.0007972361,0.00023314005,0.00013140525,0.00003066239,1.2896338e-7,0.9844598,0.003225215,0.0075740153,0.0025641154,0.0006319741],"about_ca_topic_score_codex":0.00007049453,"about_ca_topic_score_gemma":0.00013362772,"teacher_disagreement_score":0.9322249,"about_ca_system_score_codex":0.00019730355,"about_ca_system_score_gemma":0.000054027714,"threshold_uncertainty_score":0.73735976},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019847047,0.00012220813,0.9789205,0.0010993154,0.0019279445,0.00040951115,0.0000039209895,0.0001468992,0.017171236],"genre_scores_gemma":[0.4360488,0.000045843008,0.55299556,0.0051894877,0.0010566926,0.00004881923,0.000042645162,0.00004691312,0.0045252303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681455,0.00003366675,0.00043133274,0.0013443696,0.00094245595,0.0004336278],"domain_scores_gemma":[0.99745417,0.00071097765,0.00022836652,0.0011548665,0.00029285793,0.00015875888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041249464,0.0003852823,0.0003395198,0.00091027777,0.0002713002,0.0006125399,0.0018495125,0.00019634502,0.00013044581],"category_scores_gemma":[0.00013480977,0.00035937663,0.00011632182,0.00067356107,0.00016526124,0.00069422944,0.000519209,0.00053445454,0.00042679714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039722395,0.000035102,0.000009679866,0.000011186626,0.000009996588,0.000028244269,0.00023034634,0.17826186,0.0002743188,0.31704074,0.00035698374,0.50373757],"study_design_scores_gemma":[0.00025124958,0.00020359675,0.00048220655,0.00014196707,0.000003860663,0.000029332848,5.4426877e-8,0.5595749,0.0012023213,0.43625706,0.001388862,0.00046456163],"about_ca_topic_score_codex":0.000017128086,"about_ca_topic_score_gemma":0.000018162178,"teacher_disagreement_score":0.503273,"about_ca_system_score_codex":0.00023309565,"about_ca_system_score_gemma":0.00041504911,"threshold_uncertainty_score":0.9998858},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.458608e-7,0.0002652473,0.99449164,0.00034607388,0.002145578,0.0011697845,0.000041507585,0.00035643278,0.0011829877],"genre_scores_gemma":[0.0030932191,0.00004406053,0.99506867,0.0007732639,0.00022620984,0.000121538826,0.0000759641,0.000069876114,0.000527175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954885,0.00007071747,0.0006232197,0.00203603,0.0011105721,0.00067094585],"domain_scores_gemma":[0.9968832,0.000579461,0.0005577239,0.0010278444,0.0007912608,0.00016047854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007517888,0.00059881073,0.00051861774,0.0011012888,0.0008974214,0.00025689576,0.0018840227,0.00028039873,0.00003021575],"category_scores_gemma":[0.00017697676,0.00065534597,0.00020031529,0.0010153833,0.00038747024,0.0017505136,0.0012669278,0.00072490313,0.000006188551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027484377,0.000033457138,0.0000014352596,0.000013240914,0.000015734007,0.000007292216,0.00020005897,0.8640445,0.000014209658,0.03036807,0.000009699036,0.10526484],"study_design_scores_gemma":[0.0005630794,0.00024902975,0.000014727782,0.00009374011,0.000017430017,0.000033321987,4.4043034e-7,0.9197772,0.000041997122,0.07830168,0.00026846092,0.0006388553],"about_ca_topic_score_codex":0.000012031435,"about_ca_topic_score_gemma":0.0000099017425,"teacher_disagreement_score":0.10462599,"about_ca_system_score_codex":0.0015676145,"about_ca_system_score_gemma":0.0010040207,"threshold_uncertainty_score":0.9995898},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027155358,0.0013904627,0.9846276,0.011953234,0.00094868924,0.00059280265,0.000030838884,0.0001233737,0.00006146787],"genre_scores_gemma":[0.09086482,0.0020969298,0.5618342,0.3404308,0.0028262145,0.00015225065,0.00014630346,0.00032722225,0.0013212694],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99705255,0.000038490376,0.0003458287,0.0012446165,0.0008830167,0.00043550433],"domain_scores_gemma":[0.9979985,0.00066745287,0.00017078005,0.00063153246,0.00008323665,0.0004485242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003790509,0.00038967567,0.0004783805,0.00064950733,0.00032549407,0.00011984863,0.00039386825,0.00023069428,0.00035091865],"category_scores_gemma":[0.00041176652,0.00038234444,0.00008703339,0.000356384,0.0006496043,0.00008545542,0.0005257156,0.0008412541,0.000009886473],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021456208,0.000043407006,0.0000747115,0.00014329633,0.000019805984,0.0003677046,0.00036727876,0.0025109728,0.0012661847,0.000048055546,0.0005895613,0.99454755],"study_design_scores_gemma":[0.0020668341,0.001409875,0.0004945676,0.000301407,0.00015536617,0.0014888805,6.0038866e-7,0.3798116,0.004389721,0.01338016,0.59535384,0.001147136],"about_ca_topic_score_codex":0.00023430093,"about_ca_topic_score_gemma":0.00004602079,"teacher_disagreement_score":0.99340045,"about_ca_system_score_codex":0.0014358135,"about_ca_system_score_gemma":0.00095741183,"threshold_uncertainty_score":0.99986285},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002943438,0.0015009831,0.99236643,0.00021959984,0.002662832,0.0025687367,0.000002043419,0.00007429285,0.00031076107],"genre_scores_gemma":[0.40100014,0.00005238145,0.5945151,0.0024220676,0.0008083447,0.00032422537,0.000001935662,0.0001258131,0.0007499858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961152,0.0002570716,0.0006477521,0.0011509391,0.001294923,0.0005341295],"domain_scores_gemma":[0.9875428,0.010005047,0.00045272146,0.0017263584,0.00020025745,0.00007282072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003282237,0.00046022976,0.00084975513,0.00069545547,0.0005606724,0.00045980455,0.003930069,0.000103724655,0.000005537757],"category_scores_gemma":[0.000875348,0.0003175454,0.00027785197,0.00063860934,0.00036065868,0.00032651733,0.0009953562,0.0006994149,0.0000039375386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029677103,0.0013667797,0.00005069869,0.0253795,0.0007386351,0.0017155458,0.0376879,0.08818516,0.012241867,0.11297646,0.00012959821,0.71923107],"study_design_scores_gemma":[0.0043395427,0.010263203,0.0002697143,0.016775927,0.0005628718,0.0004033972,0.000016886774,0.7257156,0.0265576,0.21204384,0.00018700997,0.002864455],"about_ca_topic_score_codex":0.000022444308,"about_ca_topic_score_gemma":0.0000065780855,"teacher_disagreement_score":0.71636665,"about_ca_system_score_codex":0.0002865213,"about_ca_system_score_gemma":0.00034906418,"threshold_uncertainty_score":0.99992764},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004709632,0.00015903758,0.99168074,0.0006069137,0.0032711667,0.00040866056,0.00003383008,0.00017087196,0.0031978043],"genre_scores_gemma":[0.08512664,0.00022515746,0.90965503,0.002867634,0.0010165875,0.00007928021,0.00029575726,0.00009339195,0.00064052833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996306,0.00008101497,0.00048530777,0.0013940461,0.0012370232,0.00049661694],"domain_scores_gemma":[0.9983065,0.00027460954,0.00035285854,0.00067238655,0.0002491914,0.0001444604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008933435,0.00041105106,0.0003437807,0.0010858877,0.00062763534,0.0003985025,0.0013973959,0.00022877546,0.00023477706],"category_scores_gemma":[0.00008701876,0.00041568562,0.00013375576,0.000724176,0.00028263676,0.0011645235,0.0011000246,0.0007805932,0.00007085715],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011949427,0.00007566213,0.000012840901,0.000038577127,0.000014669887,0.00009433092,0.0010964033,0.037706986,0.0013384962,0.0041785683,0.00010508609,0.95532644],"study_design_scores_gemma":[0.00045413434,0.00023649291,0.00007284866,0.000536731,0.000019593565,0.00032806766,0.0000016915668,0.7640858,0.005361439,0.22038768,0.0073959073,0.0011196097],"about_ca_topic_score_codex":0.00006716076,"about_ca_topic_score_gemma":0.0000360858,"teacher_disagreement_score":0.9542068,"about_ca_system_score_codex":0.0006954622,"about_ca_system_score_gemma":0.00041860697,"threshold_uncertainty_score":0.9998295},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041381872,0.002305637,0.98914206,0.00059230323,0.002173878,0.00021553026,0.0000033060035,0.00013952932,0.0050139246],"genre_scores_gemma":[0.19690436,0.00053260685,0.79841083,0.002323356,0.001352361,0.000013641509,0.000034153785,0.00006951213,0.00035914037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954639,0.000094231844,0.00062551326,0.0019426065,0.00084887515,0.0010248814],"domain_scores_gemma":[0.9979644,0.00037987175,0.00026009875,0.0011047267,0.00008906871,0.00020186084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010474814,0.000585813,0.0006791205,0.0015712997,0.00022872246,0.00078587263,0.0029451202,0.0002866621,0.000007626804],"category_scores_gemma":[0.000040710023,0.0005160473,0.00009771001,0.0026088012,0.0005285486,0.00061223586,0.0021314332,0.0012011154,0.000012783498],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018245197,0.000043993463,0.00045978616,0.000026361731,0.0000023867326,0.0001245536,0.000842399,0.013655606,0.0000011037694,0.0006954454,0.00020219001,0.98394436],"study_design_scores_gemma":[0.00043864237,0.00013360576,0.0036190795,0.000485305,0.0000038354474,0.00014752422,1.5598329e-7,0.93812853,0.000009775426,0.051517934,0.0047888877,0.000726732],"about_ca_topic_score_codex":0.00004145295,"about_ca_topic_score_gemma":0.00013242644,"teacher_disagreement_score":0.9832176,"about_ca_system_score_codex":0.0004513788,"about_ca_system_score_gemma":0.0004631568,"threshold_uncertainty_score":0.9997291},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033844637,0.00015590867,0.99488974,0.0014748261,0.00070194533,0.0011231991,0.000040130348,0.00033866483,0.0012417171],"genre_scores_gemma":[0.09795065,0.000056796696,0.89789003,0.0024859859,0.00035436728,0.00023172227,0.000034814453,0.00007735851,0.00091825734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598795,0.000028671018,0.00059496437,0.0019418487,0.0006622108,0.00078434905],"domain_scores_gemma":[0.99705845,0.0009737765,0.00040124138,0.0011484239,0.0002504466,0.00016766675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004931569,0.0005384051,0.0005364586,0.00044712867,0.0011610044,0.00033549298,0.003034721,0.00021435958,0.000017212378],"category_scores_gemma":[0.000071871815,0.00055023725,0.00016072036,0.0006703329,0.00037702036,0.00081627263,0.0017886952,0.00090202474,0.000011954288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014886504,0.000016383809,4.994361e-7,0.000010738881,0.0000073270385,0.0000070344017,0.00048408244,0.5988409,0.00039579233,0.045044668,0.000013635262,0.35516408],"study_design_scores_gemma":[0.00020782616,0.00009256087,0.000005592402,0.000047138205,0.0000062025724,0.00002176947,1.8136228e-7,0.82698745,0.002115308,0.16712055,0.002901622,0.0004938119],"about_ca_topic_score_codex":0.000008604867,"about_ca_topic_score_gemma":0.00016801796,"teacher_disagreement_score":0.35467026,"about_ca_system_score_codex":0.0008965742,"about_ca_system_score_gemma":0.00085805013,"threshold_uncertainty_score":0.9996949},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030036528,0.00014736764,0.9894367,0.00009759824,0.0016653361,0.0008781521,0.00000830248,0.00022649266,0.0075100344],"genre_scores_gemma":[0.03745609,0.000027391912,0.96142375,0.0006790277,0.00009795789,0.000072044844,0.000024652743,0.000030189782,0.0001889189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592406,0.00008106998,0.00074183126,0.0009084394,0.0017685883,0.0005760021],"domain_scores_gemma":[0.9970883,0.00014617754,0.0006492394,0.0016644053,0.0003033396,0.00014851063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017996114,0.00049868634,0.00047529273,0.000992423,0.0004373915,0.0008066804,0.0036859247,0.000205723,0.000015341187],"category_scores_gemma":[0.00007534785,0.00044033382,0.000079746846,0.0007724218,0.00036492335,0.0025133642,0.0015345982,0.0009416385,0.000041837426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012140862,0.000017048478,0.000008973482,0.000052081366,0.0000124826565,0.0000075625794,0.0014095544,0.68709636,0.000010658864,0.123210356,0.000008625448,0.18815419],"study_design_scores_gemma":[0.00021024524,0.00018623835,0.000012726914,0.00020891553,0.000008796146,0.00005845124,7.464972e-7,0.985415,0.0003743313,0.010628847,0.0023847306,0.00051100604],"about_ca_topic_score_codex":0.000034427492,"about_ca_topic_score_gemma":0.0000061888036,"teacher_disagreement_score":0.29831862,"about_ca_system_score_codex":0.0010322707,"about_ca_system_score_gemma":0.0006103607,"threshold_uncertainty_score":0.99980485},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002695173,0.00087993447,0.99419075,0.0011160827,0.00049502595,0.00028573585,0.0000017298311,0.0005682032,0.0021930088],"genre_scores_gemma":[0.15626462,0.00036102583,0.84156656,0.0011191997,0.0002985139,0.0000050519425,0.00000851511,0.000021907694,0.00035461292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970224,0.00008705402,0.0005532334,0.0011517601,0.00059117057,0.0005943829],"domain_scores_gemma":[0.99643916,0.00054608326,0.0003280309,0.0023000168,0.00023974027,0.0001469506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010928533,0.00043212777,0.00048231613,0.0007706618,0.00060021994,0.00065983995,0.0052779997,0.00026599175,0.0000025790412],"category_scores_gemma":[0.00006630957,0.00042850478,0.000054809665,0.0010209037,0.0008949694,0.00064125104,0.0039525162,0.00091902365,0.000016024795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010687268,0.000027406475,0.00008672941,0.000030303203,0.000005071145,0.00000430569,0.0005056912,0.119552575,0.0000075785656,0.0044954014,0.00014871998,0.8751351],"study_design_scores_gemma":[0.00016882124,0.00008643903,0.0003582962,0.00033882257,0.0000041118406,0.00005868418,6.4075735e-8,0.98592806,0.00029839412,0.010412627,0.0018595746,0.00048608083],"about_ca_topic_score_codex":0.000014976639,"about_ca_topic_score_gemma":0.000013360185,"teacher_disagreement_score":0.87464905,"about_ca_system_score_codex":0.0003389426,"about_ca_system_score_gemma":0.0006956642,"threshold_uncertainty_score":0.99981666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01911412,0.00028820403,0.97709715,0.00016803759,0.0023636532,0.00060611166,0.0000060327757,0.0002746184,0.00008208415],"genre_scores_gemma":[0.90455014,0.000015696003,0.09451957,0.00044064093,0.0003460001,0.000072537674,0.0000051340357,0.000038374088,0.000011908116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956012,0.00005495431,0.0006035343,0.0018456676,0.0012259218,0.00066873187],"domain_scores_gemma":[0.9977479,0.00031020417,0.00029670534,0.0012458706,0.00022725234,0.00017209],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009894588,0.00057289907,0.00053404504,0.00065207784,0.0008251178,0.00048167695,0.0018935155,0.00043415368,0.000038188573],"category_scores_gemma":[0.00006282678,0.00052535755,0.00013708624,0.0006258967,0.0003769021,0.00084293506,0.001040501,0.0011484151,0.000007039031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000096174845,0.00003828155,0.0033606705,0.00014558743,0.000008938898,0.00007145314,0.001233841,0.078626424,0.0001421014,0.000059715836,3.2943788e-7,0.91630304],"study_design_scores_gemma":[0.00022973647,0.00021531495,0.0005572156,0.0003796245,0.000022236703,0.00008767743,8.5954287e-7,0.989905,0.0008911212,0.0070408457,0.000028125574,0.0006422662],"about_ca_topic_score_codex":0.000104195635,"about_ca_topic_score_gemma":0.00012438982,"teacher_disagreement_score":0.9156608,"about_ca_system_score_codex":0.00037380875,"about_ca_system_score_gemma":0.00042780637,"threshold_uncertainty_score":0.9997198},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008506729,0.004604711,0.99157447,0.000334734,0.0006808721,0.00026364397,0.00003047896,0.00006468397,0.0023613484],"genre_scores_gemma":[0.005059923,0.00075856666,0.99234456,0.00037782133,0.00044952775,0.000035347686,0.00007642075,0.000023399165,0.00087444886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679077,0.000036370537,0.0003858858,0.0018951333,0.00037781915,0.0005140099],"domain_scores_gemma":[0.9966255,0.0006501769,0.0001634044,0.0023830305,0.000066823355,0.00011107853],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007860122,0.00032903586,0.00037951066,0.0005417723,0.00016149804,0.0012023171,0.0060868845,0.00014783784,0.000002218932],"category_scores_gemma":[0.00011355641,0.0002920011,0.000022417735,0.0010934259,0.0005481337,0.004357978,0.00555246,0.00046795537,0.000021008422],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.5124538e-7,0.000026380734,0.00008155277,0.000031368538,0.0000012227786,0.0000084644835,0.00050097797,0.00037520047,0.000005782072,0.0013414869,0.0003160623,0.9973112],"study_design_scores_gemma":[0.00016507343,0.000045651657,0.00039562146,0.00050082646,0.0000029279095,0.00003025225,6.926754e-7,0.9596035,0.000029690125,0.020555986,0.018216241,0.00045356498],"about_ca_topic_score_codex":0.000029118019,"about_ca_topic_score_gemma":0.00024841976,"teacher_disagreement_score":0.9968576,"about_ca_system_score_codex":0.00014563161,"about_ca_system_score_gemma":0.000797875,"threshold_uncertainty_score":0.9999532},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016408552,0.00020068263,0.99631125,0.00094246946,0.0008066503,0.00034719103,0.000005154496,0.00015022479,0.00121999],"genre_scores_gemma":[0.0007827906,0.00007486677,0.996061,0.0013324546,0.0004965309,0.0000072524135,0.000022425382,0.000017569402,0.0012050546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997228,0.000062604384,0.000341051,0.001127219,0.0007621802,0.0004789014],"domain_scores_gemma":[0.9983285,0.0002308364,0.00016097545,0.00080867,0.00030301505,0.00016796707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000891871,0.00029543374,0.00029954177,0.0006598905,0.0002188073,0.00069906854,0.001893482,0.00021841426,0.0000120666855],"category_scores_gemma":[0.000112432295,0.00026169393,0.000040899085,0.00096191856,0.00070906617,0.0007322001,0.0012188285,0.0004725032,0.000024051473],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012033427,0.00004822646,0.000018027928,0.00005065728,0.0000048952875,0.000013564779,0.0009735563,0.0113382675,0.000020228304,0.0030626252,0.00039217703,0.98407656],"study_design_scores_gemma":[0.00017971145,0.00013096958,0.00005166844,0.00013600504,0.0000017735798,0.000031355754,9.1596185e-8,0.9322285,0.00012439187,0.06430838,0.0025152003,0.00029197577],"about_ca_topic_score_codex":0.000006668618,"about_ca_topic_score_gemma":0.000024257788,"teacher_disagreement_score":0.9837846,"about_ca_system_score_codex":0.00019874667,"about_ca_system_score_gemma":0.00076037593,"threshold_uncertainty_score":0.99998355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005114376,0.0008777425,0.98870075,0.0012786112,0.001875322,0.00036356156,0.0000021861374,0.00013864401,0.0016488256],"genre_scores_gemma":[0.19974847,0.00024370365,0.7852788,0.008547442,0.004523069,0.000008748731,0.00012563658,0.0001687232,0.0013553813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634093,0.000105039995,0.0007006068,0.0011527322,0.0010740509,0.0006266249],"domain_scores_gemma":[0.99800557,0.00043519787,0.000310005,0.00054861006,0.00019341373,0.0005071887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019449623,0.0004551426,0.0008263336,0.00067670055,0.00019551822,0.00018012743,0.0007395483,0.0004308609,0.00018639311],"category_scores_gemma":[0.00038695347,0.00038770444,0.00017647582,0.00029827468,0.0016189947,0.00015263385,0.00092459196,0.002106072,0.000037139027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024108685,0.000131614,0.001051374,0.00035449848,0.000035659992,0.00051896356,0.000549893,0.00006671566,0.00009493483,0.00010092666,0.0008082029,0.9962631],"study_design_scores_gemma":[0.0019414702,0.00056813227,0.009743091,0.004473743,0.00008208948,0.0021507002,6.469559e-7,0.9740052,0.00014901604,0.0037368573,0.002552445,0.00059656997],"about_ca_topic_score_codex":0.00011839486,"about_ca_topic_score_gemma":0.000023325667,"teacher_disagreement_score":0.99566656,"about_ca_system_score_codex":0.00027437037,"about_ca_system_score_gemma":0.0007245329,"threshold_uncertainty_score":0.9998575},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023486665,0.00015530993,0.9861471,0.001010942,0.000245877,0.0010343657,0.00004879881,0.0002936483,0.008715305],"genre_scores_gemma":[0.74831104,0.00016766302,0.24746495,0.0009145423,0.00018017199,0.0003501723,0.00013226336,0.000119670294,0.0023595502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946878,0.00027797997,0.00075066293,0.0019834188,0.0014784687,0.00082165765],"domain_scores_gemma":[0.99555,0.002027323,0.00066540315,0.0013787905,0.0002458923,0.0001326215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001513151,0.00063679216,0.00079901755,0.00090185413,0.000733923,0.00045278366,0.002531183,0.00023215932,0.000107369146],"category_scores_gemma":[0.00019115697,0.000607047,0.000095390475,0.0026195296,0.0011483812,0.0012341139,0.0016976286,0.0016532909,0.00002449924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007414729,0.00023373171,0.00026749755,0.00016653808,0.00010917838,0.00020356981,0.04944892,0.5467711,0.00077852834,0.08329144,0.000048683123,0.31860664],"study_design_scores_gemma":[0.0014187655,0.0009731838,0.00048410945,0.00094658334,0.000034820958,0.00009322982,0.00019700256,0.91723794,0.0010128792,0.0713757,0.0042409007,0.00198487],"about_ca_topic_score_codex":0.0007931118,"about_ca_topic_score_gemma":0.00066154124,"teacher_disagreement_score":0.7459624,"about_ca_system_score_codex":0.0013787405,"about_ca_system_score_gemma":0.0011110483,"threshold_uncertainty_score":0.9996381},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010968472,0.00076868245,0.97223276,0.002331108,0.0012057367,0.00037836726,0.0000028278937,0.00054567715,0.022523848],"genre_scores_gemma":[0.074405804,0.000180073,0.9158455,0.007050903,0.00024371796,0.00003468957,0.0000057070115,0.00006263375,0.002170938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961691,0.00007575265,0.00056648784,0.0014389638,0.0011158161,0.00063390355],"domain_scores_gemma":[0.997032,0.000419515,0.00032700226,0.0018971367,0.00020545283,0.00011888441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013899975,0.00050334213,0.00045036734,0.00060344575,0.0009862818,0.0005875721,0.005254861,0.00019742205,0.000045079818],"category_scores_gemma":[0.000059155387,0.00040778163,0.00017241719,0.00068556605,0.00072072254,0.0004987759,0.003251059,0.0012227285,0.000012936901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016065725,0.000011744723,0.0000013724293,0.000009199622,0.000006978975,0.000016909282,0.00044503046,0.8296643,0.000016400296,0.09379477,0.0001072608,0.075924456],"study_design_scores_gemma":[0.000097086544,0.000052070383,0.0000037759544,0.00006819653,0.0000052465316,0.000055482484,4.4078755e-7,0.80269474,0.00017856818,0.19514978,0.0012781463,0.00041644258],"about_ca_topic_score_codex":0.000029115217,"about_ca_topic_score_gemma":0.000022824284,"teacher_disagreement_score":0.10135501,"about_ca_system_score_codex":0.0003683116,"about_ca_system_score_gemma":0.00088121434,"threshold_uncertainty_score":0.9998374},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016925408,0.0002490057,0.99440557,0.00014868038,0.00077706215,0.0008766702,0.000020994314,0.00044834008,0.0029044296],"genre_scores_gemma":[0.076467454,0.000012376887,0.9225786,0.0005072482,0.00021120414,0.000023367205,0.000039675506,0.00012209723,0.00003802044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704236,0.00001712624,0.000585752,0.000879381,0.0006885554,0.0007868489],"domain_scores_gemma":[0.9988749,0.00016427609,0.0001695592,0.00044957735,0.00013033467,0.00021133981],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006544575,0.0005361567,0.0004949004,0.00060761033,0.00043014812,0.0004994805,0.0007879992,0.00020263801,0.00017438155],"category_scores_gemma":[0.000044515527,0.0005947609,0.00010323119,0.00063112867,0.00027205434,0.0002177363,0.0004939256,0.0010077213,0.000008428876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016611805,0.000008287247,0.00002746542,0.00009213043,0.000014761518,0.000012196391,0.0009950054,0.81085324,0.0007587871,0.00074430066,0.000015513224,0.18647663],"study_design_scores_gemma":[0.0001960954,0.000079060475,0.0000019016068,0.00059720466,0.000014112187,0.000060830644,0.0000022403908,0.9829354,0.0003146219,0.0015156359,0.013521436,0.0007614203],"about_ca_topic_score_codex":0.000024029667,"about_ca_topic_score_gemma":0.000019648292,"teacher_disagreement_score":0.1857152,"about_ca_system_score_codex":0.00057681213,"about_ca_system_score_gemma":0.00020513014,"threshold_uncertainty_score":0.99965036},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014726285,0.00016798974,0.9961101,0.0003669687,0.0012624214,0.001047538,0.00028771025,0.00018725327,0.00042279015],"genre_scores_gemma":[0.007017218,0.00003515379,0.9909174,0.0013769284,0.00036909597,0.00004535093,0.00009492399,0.00005782279,0.000086103966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99516696,0.00015139511,0.0005063649,0.0026014706,0.0007800923,0.00079374824],"domain_scores_gemma":[0.9962033,0.00063726964,0.0004609035,0.0022390415,0.00025383878,0.00020562393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002428623,0.00060999015,0.00075737457,0.0007509772,0.0005713981,0.00042021475,0.0047433493,0.00034205877,0.000013476653],"category_scores_gemma":[0.0002123988,0.0006072783,0.00016689753,0.0006240876,0.0003471072,0.0013062101,0.003373288,0.00097527815,0.0000011503519],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003821429,0.000033222703,9.462285e-7,0.000039137227,0.000029432682,0.000018130644,0.0015327573,0.07134252,0.00046696572,0.004887852,0.000019314582,0.9215915],"study_design_scores_gemma":[0.00040214136,0.00009786981,0.0000016017847,0.00011305086,0.000030180578,0.0000368578,1.0648e-7,0.7135531,0.00018141516,0.2849109,0.00017213935,0.0005006897],"about_ca_topic_score_codex":0.00005237563,"about_ca_topic_score_gemma":0.00009235439,"teacher_disagreement_score":0.92109084,"about_ca_system_score_codex":0.00044055603,"about_ca_system_score_gemma":0.001434181,"threshold_uncertainty_score":0.99963784},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067038657,0.0002493433,0.9909335,0.000067917805,0.00084694347,0.00056387467,9.707821e-7,0.00035754667,0.00027604526],"genre_scores_gemma":[0.65180457,0.000017337261,0.34760585,0.0001785805,0.00013931678,0.000044277767,0.0000038076291,0.00006386074,0.00014242472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942522,0.00013177842,0.00065249245,0.0020732542,0.0016779405,0.001212353],"domain_scores_gemma":[0.9957808,0.0021338493,0.000234444,0.0014553844,0.00015843693,0.00023702996],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024182529,0.0005693279,0.00053503877,0.0020616644,0.00050655514,0.0010185112,0.0030584724,0.00025808573,0.00003917518],"category_scores_gemma":[0.0018830452,0.00060671166,0.00011597571,0.0017670278,0.00029573304,0.0014277161,0.0036859065,0.0030174218,0.00002002891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050409603,0.00003455082,0.0016863256,0.000048813028,0.000009268228,0.0036503982,0.0021619643,0.65438217,0.000056713772,0.00047854683,9.387277e-7,0.33748528],"study_design_scores_gemma":[0.00031829823,0.00017162682,0.0003034802,0.00019877347,0.0000036680578,0.001683351,0.0000014750616,0.99426335,0.00015383498,0.0016637436,0.00052536314,0.00071305875],"about_ca_topic_score_codex":0.00024599428,"about_ca_topic_score_gemma":0.00017996841,"teacher_disagreement_score":0.6451007,"about_ca_system_score_codex":0.001320972,"about_ca_system_score_gemma":0.00041010874,"threshold_uncertainty_score":0.99963844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013797272,0.0019952417,0.99333835,0.00087772415,0.0017964004,0.00052682747,0.000044535776,0.00010528082,0.0011776943],"genre_scores_gemma":[0.42648217,0.00038086798,0.569042,0.0031356115,0.00043985105,0.00011744184,0.00013348118,0.000053450243,0.00021511958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971455,0.000061230094,0.00069931184,0.00081693573,0.00078100356,0.0004960531],"domain_scores_gemma":[0.99831355,0.00021389965,0.00038031713,0.00084817363,0.00012043175,0.00012361133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009850074,0.0003793298,0.0005083177,0.0010235581,0.00033979822,0.0004035117,0.0009773079,0.00015716896,0.0000042526567],"category_scores_gemma":[0.00004937768,0.00036175072,0.000043348617,0.000555608,0.00031543628,0.003267357,0.0015368442,0.00068783894,0.000005568247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007915874,0.000009611765,0.0013813982,0.00035105017,0.0000050986428,0.000099246645,0.0026854607,0.023660164,0.000007488896,0.6736083,0.000014546877,0.29816973],"study_design_scores_gemma":[0.001074105,0.00065562397,0.0011845622,0.0017102807,0.0000073003134,0.00077619066,0.000023415714,0.77644765,0.00008926348,0.06021791,0.1553055,0.0025081565],"about_ca_topic_score_codex":0.0009069105,"about_ca_topic_score_gemma":0.00048627198,"teacher_disagreement_score":0.75278753,"about_ca_system_score_codex":0.00038061416,"about_ca_system_score_gemma":0.0004488465,"threshold_uncertainty_score":0.9998835},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9567759,0.0008755231,0.019363035,0.011487881,0.004004406,0.0020739995,0.00010348146,0.000033522854,0.0052822246],"genre_scores_gemma":[0.99922895,0.000004988238,0.00010190201,0.00014735262,0.0002485366,0.000007711338,0.000004854687,0.000006312952,0.00024939774],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762267,0.00026393024,0.0003777261,0.0003050886,0.0011390656,0.0002915421],"domain_scores_gemma":[0.9930824,0.0060997554,0.0003102342,0.0003310128,0.000110232264,0.000066363595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015438715,0.00015359957,0.00025391113,0.00004269879,0.00059933035,0.0000604688,0.00085980864,0.00008765671,0.0001496758],"category_scores_gemma":[0.00072017766,0.00009043346,0.00006228377,0.00018036993,0.0006384691,0.00006433526,0.00010507373,0.0004262347,6.499131e-7],"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.0014454463,0.00024752328,0.08480732,0.00035916123,0.0002726158,0.00014842948,0.054875884,0.082927935,0.0020469755,0.2926353,0.0009220655,0.47931138],"study_design_scores_gemma":[0.003114654,0.040961247,0.22527613,0.018647619,0.0008526645,0.000042850963,0.00015948547,0.1174103,0.11073771,0.31021348,0.16433752,0.008246355],"about_ca_topic_score_codex":0.9476819,"about_ca_topic_score_gemma":0.9967284,"teacher_disagreement_score":0.471065,"about_ca_system_score_codex":0.0007837195,"about_ca_system_score_gemma":0.0032938735,"threshold_uncertainty_score":0.584319},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003608885,0.009455044,0.98442906,0.0021127935,0.0010894483,0.000477731,0.000011052384,0.00015931143,0.0022294964],"genre_scores_gemma":[0.6459634,0.01831086,0.29210088,0.037483588,0.002215351,0.00013434823,0.00039190432,0.00018972912,0.003210003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569166,0.0001315586,0.000997582,0.0015001018,0.0010329797,0.0006461001],"domain_scores_gemma":[0.9979897,0.00036148186,0.00050494785,0.0007541463,0.00025631595,0.00013339684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014714266,0.0005366086,0.0008021182,0.0010521652,0.00029621337,0.00041829553,0.0032726405,0.00020373304,0.00031597106],"category_scores_gemma":[0.00013803973,0.00050337566,0.0002482883,0.0011276449,0.00021786836,0.000772628,0.0010814812,0.0014378821,0.000029603432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063820894,0.000215076,0.00006028856,0.00061747746,0.0000704665,0.00019800535,0.0027879549,0.121310644,0.0000316617,0.2208338,0.0006303465,0.6532379],"study_design_scores_gemma":[0.00022150727,0.0001409684,0.000060987317,0.0025269953,0.00002936016,0.00014108054,9.422448e-7,0.955023,0.00001434157,0.00416394,0.036983043,0.00069385296],"about_ca_topic_score_codex":0.00012866771,"about_ca_topic_score_gemma":0.0021089276,"teacher_disagreement_score":0.83371234,"about_ca_system_score_codex":0.0005028993,"about_ca_system_score_gemma":0.00048366058,"threshold_uncertainty_score":0.9997418},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003465871,0.0007253461,0.9876166,0.0032240814,0.002286962,0.00035815127,0.0000027850394,0.000103539955,0.0022166832],"genre_scores_gemma":[0.27075645,0.00030773925,0.70670164,0.009877998,0.009017041,0.000009826006,0.00018423909,0.00018351898,0.0029615464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630475,0.00008954161,0.00060593657,0.0011554371,0.001235605,0.0006087027],"domain_scores_gemma":[0.99757636,0.00047906803,0.0004364714,0.0008333426,0.0002006743,0.00047409284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022822744,0.00044012058,0.0008616109,0.00054688717,0.00042321117,0.0005175446,0.0010437913,0.0004424028,0.000048216163],"category_scores_gemma":[0.0010326889,0.00037085544,0.00018367631,0.00016927494,0.0021218616,0.00020466125,0.001131726,0.0022353004,0.000019579606],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018041274,0.00007640706,0.0010416198,0.0003393278,0.000035100365,0.00083367655,0.00028596338,0.00013169642,0.00008297219,0.000043558237,0.001730576,0.99538106],"study_design_scores_gemma":[0.0017497606,0.00027927908,0.012162779,0.0057057333,0.00006232981,0.0020831758,2.9912232e-7,0.97127247,0.000051277555,0.0018596784,0.00431397,0.0004592685],"about_ca_topic_score_codex":0.00006399525,"about_ca_topic_score_gemma":0.000023136634,"teacher_disagreement_score":0.9949218,"about_ca_system_score_codex":0.00029244728,"about_ca_system_score_gemma":0.0008508462,"threshold_uncertainty_score":0.99987435},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008094613,0.00014052753,0.9793757,0.0014066971,0.00225224,0.0005316093,0.000007965112,0.0004785641,0.015725702],"genre_scores_gemma":[0.19179466,0.0000455742,0.8014861,0.0025187565,0.0014244962,0.000039458777,0.000058905065,0.00015629866,0.0024757963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937823,0.0001774509,0.0007523705,0.0023853541,0.0019185678,0.0009839999],"domain_scores_gemma":[0.99644166,0.0005316918,0.0005052651,0.0021310311,0.00017542823,0.00021490917],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001830683,0.000785322,0.00077037024,0.0012659278,0.0014020306,0.00057564926,0.0057139276,0.00039313122,0.0006062874],"category_scores_gemma":[0.00017889056,0.00078450015,0.00025837467,0.0010347258,0.00067981606,0.00088487926,0.003822447,0.0029957239,0.000058935908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010127093,0.000023067189,0.0000512741,0.00002861772,0.0000132753785,0.00017425985,0.0011669344,0.56837,0.0002753411,0.023402061,0.000018084475,0.406467],"study_design_scores_gemma":[0.0009197097,0.00049549766,0.0006760874,0.00035779743,0.000028558978,0.0003984905,0.0000010386584,0.7543168,0.000081248116,0.21166751,0.029041521,0.00201574],"about_ca_topic_score_codex":0.00013079647,"about_ca_topic_score_gemma":0.00009764644,"teacher_disagreement_score":0.40445125,"about_ca_system_score_codex":0.0011683977,"about_ca_system_score_gemma":0.00061402324,"threshold_uncertainty_score":0.999898},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011315407,0.00017762085,0.9709808,0.0013394225,0.0014356585,0.000204427,0.000039421517,0.00013280561,0.025678534],"genre_scores_gemma":[0.046131313,0.0005509439,0.89345944,0.028911173,0.0019942834,0.000039164643,0.0008943452,0.00018695141,0.027832415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996113,0.000041447314,0.00047862277,0.0013789972,0.0015312225,0.00045669414],"domain_scores_gemma":[0.997543,0.000456959,0.00026881107,0.0013642515,0.00020863555,0.00015834052],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00072169676,0.0003559128,0.00035005462,0.00075057585,0.000321116,0.001100637,0.0037706557,0.00013404948,0.0012094846],"category_scores_gemma":[0.00023087424,0.00035503687,0.00011213918,0.0008667308,0.00039066063,0.0013416867,0.0024908732,0.00055042224,0.00018292312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040508917,0.000047453297,0.00007748361,0.000020394056,0.000016554357,0.00017358767,0.0004883411,0.03978802,0.00004860479,0.72018194,0.00086095306,0.23829265],"study_design_scores_gemma":[0.00035391666,0.00019598774,0.000096698706,0.0001314823,0.000011218553,0.00017199312,7.884947e-7,0.4655002,0.00048189118,0.34017518,0.19189347,0.0009871703],"about_ca_topic_score_codex":0.000032782686,"about_ca_topic_score_gemma":0.000028234359,"teacher_disagreement_score":0.4257122,"about_ca_system_score_codex":0.00024364324,"about_ca_system_score_gemma":0.00086689566,"threshold_uncertainty_score":0.99993634},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042978977,0.00027484834,0.98380005,0.0023268284,0.0033987968,0.0024740587,0.0001649651,0.00016024805,0.0031022758],"genre_scores_gemma":[0.9468336,0.000010140311,0.044336636,0.0058717537,0.00093436486,0.000491188,0.00016672557,0.00013167744,0.0012238796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947828,0.00016903403,0.0007962963,0.0022145782,0.0009621478,0.0010751617],"domain_scores_gemma":[0.9968638,0.00085851277,0.0005028031,0.0013165079,0.00015438079,0.000304009],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001429986,0.00077709125,0.00083242176,0.0007601888,0.00066229113,0.00037731972,0.0022171626,0.00044546727,0.0011039859],"category_scores_gemma":[0.00019406603,0.0006885764,0.00046635722,0.0007207882,0.00071312964,0.0004293262,0.0009749176,0.0011421419,0.00003293242],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064632454,0.0005799588,0.0013134168,0.00017263026,0.00019121483,0.0002032784,0.018215567,0.050541777,0.00011640365,0.0047490904,0.0006070172,0.92266333],"study_design_scores_gemma":[0.01565095,0.009005678,0.0984469,0.0015682089,0.0012595791,0.00025996985,0.00023944055,0.6187194,0.0013736768,0.14378913,0.09537007,0.0143169705],"about_ca_topic_score_codex":0.00016365272,"about_ca_topic_score_gemma":0.0001708381,"teacher_disagreement_score":0.94253576,"about_ca_system_score_codex":0.0003575579,"about_ca_system_score_gemma":0.0003211984,"threshold_uncertainty_score":0.99980915},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018247689,0.000117512354,0.99090195,0.0006290593,0.0005363579,0.00049947755,0.00008287255,0.0002832319,0.0069313105],"genre_scores_gemma":[0.21275997,0.000042275322,0.7866608,0.00023658757,0.00010355798,0.000026267451,0.00007791744,0.000037723188,0.000054902277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946107,0.00007212,0.000690994,0.0022089987,0.0018658442,0.00055132364],"domain_scores_gemma":[0.9911161,0.0005961807,0.00070691743,0.007158237,0.0003039795,0.00011858522],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0020377217,0.00047792587,0.0006679896,0.00081992795,0.00027198603,0.00038438188,0.016736642,0.0001614846,0.00005847755],"category_scores_gemma":[0.00014296571,0.000422477,0.000057526355,0.0009010111,0.00064901833,0.0026889157,0.011448628,0.0010051671,0.0000010391963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009628536,0.0001029004,0.00009981136,0.000198104,0.00004701722,0.00011716579,0.0018044745,0.17702761,0.00035237236,0.24386948,0.000117757074,0.57625365],"study_design_scores_gemma":[0.00013673103,0.0001253494,0.00012842855,0.00039347785,0.000010304559,0.000057161807,5.050352e-7,0.90404063,0.00023098638,0.09328539,0.0011371437,0.00045388658],"about_ca_topic_score_codex":0.000034153956,"about_ca_topic_score_gemma":0.000028580644,"teacher_disagreement_score":0.727013,"about_ca_system_score_codex":0.00030739498,"about_ca_system_score_gemma":0.0015552663,"threshold_uncertainty_score":0.9998227},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.079455e-7,0.0008683381,0.9579582,0.03583527,0.0027093606,0.00093012454,0.0005052143,0.0007248874,0.00046779567],"genre_scores_gemma":[0.0008394156,0.000162202,0.9963423,0.0016090475,0.00035179866,0.000069820504,0.0004912912,0.00004956727,0.000084555446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936408,0.000052109743,0.0006703304,0.0034292901,0.0013204537,0.00088703877],"domain_scores_gemma":[0.97340685,0.00089220627,0.00047640072,0.024827404,0.0002526579,0.00014449203],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0021483859,0.00054348493,0.00055123284,0.0009580215,0.0006157105,0.0006006856,0.108274534,0.0004171678,0.000034187065],"category_scores_gemma":[0.0038482996,0.0005564745,0.00009486169,0.00092951284,0.00068983773,0.0016620248,0.1954747,0.0013457135,0.00001946825],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019797458,0.000019642623,0.0000069662506,0.0000398592,0.000008746364,0.000020055013,0.000046457535,0.0001381577,0.000012437285,0.017800782,0.004088611,0.9778163],"study_design_scores_gemma":[0.00012167634,0.00010132058,0.000015042214,0.000071812225,0.000004125884,0.000028321749,1.6015211e-7,0.594978,0.000060169612,0.37954518,0.024710327,0.00036387745],"about_ca_topic_score_codex":0.00005545266,"about_ca_topic_score_gemma":0.00006843897,"teacher_disagreement_score":0.97745246,"about_ca_system_score_codex":0.00074873044,"about_ca_system_score_gemma":0.0010428573,"threshold_uncertainty_score":0.9996887},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022558595,0.00016811736,0.9915831,0.001494622,0.000865106,0.00079853577,0.000015808842,0.0004525808,0.0045995396],"genre_scores_gemma":[0.27097377,0.00015324363,0.72267073,0.0029895594,0.0010953642,0.0005550434,0.000018050021,0.00008843548,0.0014557879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962075,0.00002921963,0.0005418449,0.0015052283,0.0011827121,0.00053349853],"domain_scores_gemma":[0.99763846,0.00041520662,0.00029506194,0.0012227453,0.00021386913,0.00021464177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010614851,0.00039117996,0.00041104032,0.00073684816,0.0006778228,0.00035571863,0.003183262,0.00032870157,0.00018339601],"category_scores_gemma":[0.000103003644,0.00040433405,0.00020168301,0.0007069323,0.00045870786,0.0005085351,0.0013615944,0.000842965,0.000016414007],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007901968,0.00004766528,0.000007639585,0.00003145555,0.000010358131,0.00001068074,0.00009725753,0.0010367794,0.0006161851,0.03222156,0.000083400395,0.96582913],"study_design_scores_gemma":[0.0005803351,0.0010319188,0.00014664713,0.00019018642,0.000025846977,0.0002648939,3.8903372e-7,0.6113327,0.031155229,0.2578892,0.09592932,0.0014533232],"about_ca_topic_score_codex":0.000038815793,"about_ca_topic_score_gemma":0.00008001909,"teacher_disagreement_score":0.9643758,"about_ca_system_score_codex":0.000378321,"about_ca_system_score_gemma":0.0005396156,"threshold_uncertainty_score":0.99984086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19921704,0.00006374427,0.7996554,0.00070937065,0.00008272186,0.0002101071,0.00000374192,0.000054931992,0.0000029407463],"genre_scores_gemma":[0.5401074,0.0000038206713,0.4595075,0.00034922594,0.000018278773,0.000005307492,0.0000018717361,0.0000062643635,2.677077e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986302,0.00004612449,0.00025063634,0.0004010034,0.00043526743,0.0002367682],"domain_scores_gemma":[0.9992398,0.00012526967,0.00010528781,0.00035680403,0.00010222711,0.000070588954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032938868,0.00011488265,0.00019358136,0.00052871916,0.00034411298,0.000019931942,0.00027979986,0.000018236591,0.000004726271],"category_scores_gemma":[0.00013696704,0.0000946203,0.000045245582,0.0019410293,0.00018792959,0.00013736481,0.00060070393,0.0004904101,1.960326e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039813942,0.00022335145,0.043047655,0.000036273024,0.0000019602367,0.000037107537,0.0017645846,0.6988843,0.14286327,0.000040104853,0.0000026232606,0.11305892],"study_design_scores_gemma":[0.00029849357,0.00005069513,0.0010388988,0.00008695348,0.000006293539,0.000103764476,0.0000042724005,0.9907333,0.0061864206,0.0013857227,0.000011997457,0.000093187344],"about_ca_topic_score_codex":0.000040417337,"about_ca_topic_score_gemma":0.0000010699569,"teacher_disagreement_score":0.3408904,"about_ca_system_score_codex":0.00015624348,"about_ca_system_score_gemma":0.000096781725,"threshold_uncertainty_score":0.38585037},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001048609,0.0005136137,0.9787501,0.0065103094,0.00071369566,0.00029116313,0.0000053503663,0.00011283535,0.012054301],"genre_scores_gemma":[0.28162217,0.0003361661,0.59236574,0.086961105,0.010591728,0.00013566285,0.0011234031,0.00052418787,0.026339805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945414,0.000106220396,0.00053953304,0.001202785,0.0029568858,0.000653198],"domain_scores_gemma":[0.99761397,0.000658133,0.00019655557,0.00092577346,0.00010111879,0.00050445396],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026994792,0.00035735808,0.0008846146,0.0017338045,0.00028356994,0.00012784736,0.0011789469,0.0002482942,0.001817392],"category_scores_gemma":[0.0013880252,0.00029818833,0.00034675872,0.002594593,0.0012541246,0.00003796166,0.0009764474,0.0029323047,0.000021085301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053296342,0.00029043452,0.0015987656,0.0002001289,0.0003623309,0.0033093758,0.0013198752,0.23385112,0.000086915235,0.00025252072,0.00448977,0.75418544],"study_design_scores_gemma":[0.0004889886,0.00013524805,0.0006467588,0.00021550045,0.00029527888,0.00023811523,6.3301604e-7,0.9538311,0.000025673426,0.00073721755,0.043065026,0.00032050474],"about_ca_topic_score_codex":0.000036096673,"about_ca_topic_score_gemma":0.000009473777,"teacher_disagreement_score":0.75386494,"about_ca_system_score_codex":0.00077353156,"about_ca_system_score_gemma":0.0021087443,"threshold_uncertainty_score":0.999947},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017589463,0.0016720471,0.9739454,0.00012339542,0.0022748264,0.00047404887,0.000008052799,0.00017985348,0.0037329597],"genre_scores_gemma":[0.8693597,0.00010554336,0.12600733,0.0024219735,0.0009878433,0.00004814006,0.00012526725,0.00017661563,0.00076759205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676603,0.00017712906,0.0004541758,0.0015067777,0.0006208818,0.00047500012],"domain_scores_gemma":[0.9980937,0.00023066504,0.00045363244,0.0009679893,0.000094810646,0.000159154],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039107015,0.00052083115,0.0005490228,0.00058398145,0.00045392438,0.0002480807,0.0012951505,0.000309901,0.0013172353],"category_scores_gemma":[0.000022191392,0.00042225304,0.00007963818,0.00040114354,0.0004493537,0.00037049755,0.0004030129,0.0011711044,0.00003204003],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010621394,0.00018337485,0.0035515106,0.000038596805,0.00010591117,0.0007777339,0.08790567,0.08436079,0.0012568469,0.0016554764,0.00011908496,0.8199388],"study_design_scores_gemma":[0.017498761,0.012240297,0.036105294,0.022268645,0.0010178089,0.0023740483,0.00055404764,0.40863287,0.008474505,0.17196138,0.29608983,0.02278251],"about_ca_topic_score_codex":0.00032786935,"about_ca_topic_score_gemma":0.0004429647,"teacher_disagreement_score":0.8517702,"about_ca_system_score_codex":0.00021166765,"about_ca_system_score_gemma":0.00021172082,"threshold_uncertainty_score":0.9998229},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31731257,0.004618712,0.6582628,0.015762908,0.0015881952,0.0021181062,0.0000072088346,0.00013541807,0.00019411845],"genre_scores_gemma":[0.99449176,0.00004279929,0.0036133307,0.0015106384,0.00023259477,0.00003448522,0.0000073833417,0.000036001922,0.000031035073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967026,0.00012641553,0.00037691285,0.0011421539,0.00120497,0.00044694604],"domain_scores_gemma":[0.9984583,0.00050608744,0.00013207205,0.00044710175,0.00004478259,0.00041162985],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013625519,0.00039834477,0.0006461634,0.001108663,0.00019202454,0.00011355459,0.0004125941,0.00015598013,0.00007470484],"category_scores_gemma":[0.0003675786,0.0003345593,0.0000653062,0.00050483405,0.00072765443,0.00011205846,0.00039135496,0.0026342254,4.28809e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008830903,0.00028255928,0.15984787,0.000099753204,0.00001946044,0.05972493,0.0011857026,0.016889572,0.0000073579017,0.000017109836,0.000007022238,0.76183033],"study_design_scores_gemma":[0.0017259315,0.00019059483,0.013586476,0.0005286696,0.00006469391,0.0020255917,0.000014077571,0.9809759,0.0000052218425,0.00034764365,0.00018068973,0.00035447354],"about_ca_topic_score_codex":0.0004767076,"about_ca_topic_score_gemma":0.00091638917,"teacher_disagreement_score":0.96408635,"about_ca_system_score_codex":0.00024304361,"about_ca_system_score_gemma":0.0007093447,"threshold_uncertainty_score":0.99991065},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020345255,0.00017689068,0.98836994,0.0071166586,0.0011521059,0.00062998245,0.0000067604833,0.00007458704,0.002269625],"genre_scores_gemma":[0.019210927,0.0001409564,0.9683827,0.009592428,0.0010586154,0.0000736667,0.00033314258,0.000085870066,0.0011216727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728644,0.000017429189,0.000412562,0.00069715397,0.0012299911,0.0003564176],"domain_scores_gemma":[0.99865156,0.0004565221,0.00017606397,0.00036918945,0.00013647077,0.00021016122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014552776,0.0002485637,0.0004024567,0.00037946156,0.00025995827,0.00009256535,0.000414435,0.0001740481,0.0006585421],"category_scores_gemma":[0.00097623706,0.00021848641,0.00010946139,0.00019513212,0.0004699465,0.0001475863,0.00022371404,0.0010552295,0.000009022807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055823806,0.000041580326,0.00006649995,0.00022242208,0.000019279238,0.00010756777,0.00032588368,0.07671959,0.0002947651,0.0023028294,0.00071208895,0.9191317],"study_design_scores_gemma":[0.0008199749,0.00025373112,0.00003366311,0.00036740204,0.000038858845,0.00013108876,4.6061263e-7,0.9666054,0.00016877317,0.022373209,0.00898972,0.00021771176],"about_ca_topic_score_codex":0.00006449469,"about_ca_topic_score_gemma":0.000007864409,"teacher_disagreement_score":0.91891396,"about_ca_system_score_codex":0.00045800925,"about_ca_system_score_gemma":0.0007485574,"threshold_uncertainty_score":0.89096177},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034074482,0.00021072368,0.9945505,0.002171295,0.00067661674,0.00075217074,0.000006830943,0.00021322619,0.0010778585],"genre_scores_gemma":[0.13222921,0.000061812934,0.86331344,0.003648112,0.00023632363,0.00019243946,0.00007535097,0.00005907152,0.00018422487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995902,0.00007993765,0.0006556487,0.0017466253,0.0009909957,0.00062478567],"domain_scores_gemma":[0.99707747,0.0009315762,0.0003036104,0.0014162967,0.00014468943,0.00012635058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006646795,0.00043164205,0.00038998845,0.0010754333,0.00049987994,0.0003008654,0.0025685572,0.00013284452,0.000068589594],"category_scores_gemma":[0.00006924638,0.00047853577,0.00010104004,0.0018212,0.00027670767,0.0007542886,0.0010528045,0.0010155538,0.000016252658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032122623,0.00002120842,0.00011910142,0.00001222938,0.0000027019084,0.000032467262,0.0005501636,0.8251259,0.00049412856,0.0059629367,0.0000071828626,0.16766882],"study_design_scores_gemma":[0.00040989346,0.000045908964,0.000076635384,0.00012731501,0.0000046396976,0.000014738022,0.0000012059351,0.9334088,0.0007219911,0.06397567,0.0007375351,0.00047569687],"about_ca_topic_score_codex":0.00007133514,"about_ca_topic_score_gemma":0.00013063184,"teacher_disagreement_score":0.16719311,"about_ca_system_score_codex":0.0008903122,"about_ca_system_score_gemma":0.0005529279,"threshold_uncertainty_score":0.99976665},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032164897,0.00036499952,0.98845315,0.0008105351,0.0012594515,0.0013786432,0.000091572976,0.00023709536,0.004188055],"genre_scores_gemma":[0.30490273,0.00014824969,0.68725157,0.005160642,0.0012507038,0.00015321946,0.00032679818,0.00020466033,0.0006013909],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629486,0.00003015247,0.0005534147,0.0013913363,0.0009792042,0.00075103977],"domain_scores_gemma":[0.99723077,0.0010412353,0.00022629708,0.0009608267,0.00026580854,0.0002750655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061241776,0.00061553257,0.000901373,0.0012086908,0.00042694728,0.00016559444,0.00072750426,0.00024523676,0.00020122837],"category_scores_gemma":[0.00022238806,0.0005687627,0.00062633626,0.00080928364,0.0020160922,0.00016398875,0.00018089847,0.0010969929,0.000007635798],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001459525,0.0011349198,0.0048986934,0.0011311598,0.00095382927,0.00015570704,0.004585162,0.0077180224,0.1499075,0.02196083,0.0003615375,0.8057331],"study_design_scores_gemma":[0.028411066,0.012852426,0.01049402,0.0054972824,0.0020494242,0.0037167633,0.000023099665,0.048993178,0.008790226,0.46851906,0.4012138,0.009439644],"about_ca_topic_score_codex":0.000021476053,"about_ca_topic_score_gemma":0.000012465062,"teacher_disagreement_score":0.79629344,"about_ca_system_score_codex":0.00020393908,"about_ca_system_score_gemma":0.0005898829,"threshold_uncertainty_score":0.9996764},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005083155,0.000025317757,0.99331796,0.0013695372,0.0012385629,0.00092049915,0.0000046094274,0.00055328244,0.0020618886],"genre_scores_gemma":[0.05015275,0.0000060591456,0.9377165,0.011082231,0.0003037551,0.00014818109,0.000024975314,0.000060471193,0.0005051173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995292,0.00011135978,0.00076522713,0.0014350468,0.0016962914,0.0007000474],"domain_scores_gemma":[0.99745154,0.0005443823,0.00045542105,0.0010028528,0.00022139882,0.0003243767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016679737,0.00048510556,0.00043996744,0.0013440778,0.00066993746,0.0007895027,0.002897869,0.000111726185,0.00017987071],"category_scores_gemma":[0.00047026257,0.00050165696,0.00011952647,0.001083749,0.00020559363,0.0015263932,0.0024702891,0.001432923,0.00008214593],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004286546,0.000026975375,0.000027162047,0.00004621431,0.000009979764,0.0000977502,0.0029533461,0.015869802,0.02136957,0.0033723211,0.000079664635,0.9561429],"study_design_scores_gemma":[0.0008726184,0.0017658327,0.0001623022,0.0005956501,0.00002157544,0.0002882997,0.000013207035,0.7447763,0.20818937,0.03848532,0.0025111532,0.0023183713],"about_ca_topic_score_codex":0.00007525443,"about_ca_topic_score_gemma":0.000026595575,"teacher_disagreement_score":0.9538246,"about_ca_system_score_codex":0.0009645946,"about_ca_system_score_gemma":0.0005988975,"threshold_uncertainty_score":0.9997435},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40295315,0.025074758,0.5539379,0.0020804678,0.008619413,0.0052737035,0.00054339244,0.00019092982,0.0013262947],"genre_scores_gemma":[0.98266125,0.001873342,0.014458318,0.00045663188,0.00029711123,0.00005718491,0.000032810825,0.000040942952,0.00012239219],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978837,0.000020054971,0.00039987505,0.0007094219,0.00066062884,0.00032635918],"domain_scores_gemma":[0.9988575,0.000102352315,0.0003097541,0.0004102559,0.00022618884,0.00009395526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029127745,0.00029521293,0.00048569328,0.00039874818,0.00015889834,0.00004366738,0.00020141798,0.00012794553,0.00015827117],"category_scores_gemma":[0.000032063395,0.0002604156,0.000109122804,0.00028113739,0.00041549242,0.00010931337,0.00018983377,0.00041702736,0.0000015248133],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042267307,0.00023533375,0.0048014177,0.0005765522,0.00021537123,0.00022837582,0.0020667382,0.075456984,0.08014982,0.0007641966,0.000015085766,0.83506745],"study_design_scores_gemma":[0.005823594,0.004803822,0.024667844,0.0058742366,0.0009012771,0.0007823593,0.000005486662,0.036000133,0.88022804,0.027238091,0.011719091,0.0019559993],"about_ca_topic_score_codex":0.0022625278,"about_ca_topic_score_gemma":0.00030937087,"teacher_disagreement_score":0.83311146,"about_ca_system_score_codex":0.0018605832,"about_ca_system_score_gemma":0.00086409185,"threshold_uncertainty_score":0.9999848},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075679953,0.00027426268,0.9945396,0.00021135197,0.0019464149,0.00049447,0.0000014617231,0.00014242464,0.0016332103],"genre_scores_gemma":[0.9657148,0.00026094617,0.030284872,0.0014295727,0.0012897024,0.000043545348,0.00015854299,0.000098895696,0.00071910594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784076,0.000028737715,0.00024613942,0.0007314097,0.00084693753,0.00030599762],"domain_scores_gemma":[0.9989583,0.000098433,0.00016098993,0.00052509544,0.00014446808,0.00011273083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041902458,0.00030524272,0.00040967483,0.000709829,0.0003530349,0.00009640057,0.00015764563,0.00020813108,0.00022868106],"category_scores_gemma":[0.00003334968,0.0002443259,0.00020095528,0.0005663287,0.00023170882,0.00029294525,0.00010274403,0.0010616289,0.0000059691342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009911991,0.000020265117,0.0013170142,0.00002695067,0.000038610386,0.0000814948,0.000055379296,0.711357,0.000009960865,0.00012054376,0.00002267005,0.28685102],"study_design_scores_gemma":[0.00072541734,0.0006376644,0.002641456,0.00016922831,0.00012836538,0.0006559661,0.0000016681182,0.9864034,0.00010039379,0.001630523,0.0065067564,0.00039915924],"about_ca_topic_score_codex":0.0000856769,"about_ca_topic_score_gemma":0.000043432738,"teacher_disagreement_score":0.964958,"about_ca_system_score_codex":0.0005204362,"about_ca_system_score_gemma":0.00015818911,"threshold_uncertainty_score":0.99633217},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009765496,0.00017717553,0.9898526,0.0028393718,0.0031524138,0.0005440039,0.0000092682285,0.00024771123,0.0030798032],"genre_scores_gemma":[0.15319751,0.000018905404,0.84111935,0.0047382335,0.0004419066,0.00004392673,0.000004916399,0.000039875795,0.00039534664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994503,0.000033296234,0.0006387718,0.0025289687,0.0015230051,0.00077295594],"domain_scores_gemma":[0.9959683,0.0005426077,0.00030550847,0.002716267,0.00020464811,0.000262683],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010460804,0.0005359915,0.00050214626,0.0008650259,0.00041013912,0.00057716545,0.005705787,0.00021678473,0.00008410488],"category_scores_gemma":[0.00024289456,0.0005620471,0.0001340996,0.0008742957,0.00024560824,0.00060103554,0.0028547833,0.0014316501,0.00008721463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005846354,0.0000445898,0.00001395191,0.000026371361,0.000007944444,0.000045175242,0.0011016253,0.09900872,0.0016271169,0.18714455,0.000050464303,0.7109237],"study_design_scores_gemma":[0.0001006296,0.00016762562,0.00006780646,0.00034212897,0.000006359532,0.00009701773,2.0805541e-7,0.7352719,0.0024052744,0.24754944,0.01301674,0.0009749222],"about_ca_topic_score_codex":0.000035552996,"about_ca_topic_score_gemma":0.000018411003,"teacher_disagreement_score":0.7099487,"about_ca_system_score_codex":0.00066832843,"about_ca_system_score_gemma":0.0006383496,"threshold_uncertainty_score":0.9996831},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023649617,0.0010894501,0.9493912,0.036513366,0.00519381,0.0014070035,0.000012282492,0.00006913277,0.003958813],"genre_scores_gemma":[0.9813841,0.00002416982,0.006580161,0.010751825,0.0004890952,0.000043243064,0.0000012460358,0.000015624857,0.0007105069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967637,0.00016049498,0.0005636071,0.0006894963,0.0013772118,0.00044547685],"domain_scores_gemma":[0.9965299,0.0008774504,0.0004232561,0.0019410517,0.00015244512,0.0000759184],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0026840782,0.00029674053,0.00027227023,0.00025536076,0.0016625061,0.0012302422,0.0090201795,0.000097750795,0.000029437304],"category_scores_gemma":[0.00019251408,0.00012254526,0.00011260037,0.0023760227,0.0010240023,0.0018148241,0.0046298346,0.00086157623,0.000018181552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014283831,0.000027264086,0.001971938,0.00006349043,0.000043866043,0.0000072289654,0.08411865,0.21182771,0.000245246,0.22385758,0.0029312177,0.47489154],"study_design_scores_gemma":[0.00058519316,0.00054087304,0.00791832,0.0012526237,0.000025283378,0.0005174876,0.00037546793,0.6289506,0.0017886399,0.07345974,0.28278112,0.0018046789],"about_ca_topic_score_codex":0.00012764933,"about_ca_topic_score_gemma":0.000029316414,"teacher_disagreement_score":0.97901917,"about_ca_system_score_codex":0.00019906714,"about_ca_system_score_gemma":0.0006237143,"threshold_uncertainty_score":0.9998066},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002571448,0.00013847355,0.98934036,0.0011326583,0.0018840913,0.00083322776,9.23585e-7,0.000043916876,0.006369213],"genre_scores_gemma":[0.993376,0.000013474195,0.005294016,0.0008644529,0.00012159662,0.00003496059,0.000002212433,0.0000143791885,0.00027889063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773765,0.00009945164,0.00039462541,0.00062426465,0.00083623943,0.0003077826],"domain_scores_gemma":[0.9983683,0.00027764737,0.00024038879,0.0009832191,0.00009926763,0.000031132375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012306195,0.00023279106,0.00024746312,0.00029860012,0.00028236638,0.00017985143,0.0024864194,0.00012415464,0.000025030042],"category_scores_gemma":[0.000058306698,0.00013300311,0.00009167803,0.00080479507,0.00036408982,0.0003220426,0.00087688473,0.00057522167,0.000005404665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003177542,0.000026725931,0.00011811659,0.000031724492,0.000004168001,0.0000047343287,0.0017688113,0.048422374,0.00007631375,0.8914021,0.000027921184,0.05811379],"study_design_scores_gemma":[0.00025337242,0.00035062662,0.00019684988,0.00013102726,0.00000552856,0.00006032554,0.0000016966512,0.20636864,0.002123174,0.7818717,0.008221113,0.00041597255],"about_ca_topic_score_codex":0.000111079564,"about_ca_topic_score_gemma":0.00011661009,"teacher_disagreement_score":0.9931189,"about_ca_system_score_codex":0.0002205543,"about_ca_system_score_gemma":0.00025515017,"threshold_uncertainty_score":0.5423709},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9677978,0.0001679241,0.031073837,0.00034246623,0.00019031552,0.00025655783,0.000006505153,0.000027477432,0.00013711066],"genre_scores_gemma":[0.9823125,0.0000025669153,0.01672175,0.0008934484,0.00004152017,0.000010750446,0.0000055889273,0.0000101772175,0.0000017194673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834824,0.000043567663,0.00018267395,0.00042787177,0.00069089205,0.00030676965],"domain_scores_gemma":[0.9992443,0.00018916954,0.000068915295,0.00033045548,0.00004768376,0.000119479606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014783037,0.00014041104,0.00024164231,0.00023534107,0.00018412551,0.000019382203,0.00019937675,0.000026701602,0.00006141407],"category_scores_gemma":[0.000017671238,0.00009892922,0.000044037028,0.0008320951,0.00022320791,0.000042950523,0.0001363771,0.00027442235,0.0000018715654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032839873,0.0020047908,0.18614809,0.00006368913,0.00007183988,0.011919159,0.012937677,0.39389804,0.0030182013,0.0005622227,0.00007325997,0.38601905],"study_design_scores_gemma":[0.021926668,0.06516701,0.31175312,0.0015199718,0.0002028328,0.0901363,0.0001913265,0.43867978,0.03744262,0.0053681154,0.02491739,0.002694861],"about_ca_topic_score_codex":0.000027070071,"about_ca_topic_score_gemma":4.4083833e-7,"teacher_disagreement_score":0.3833242,"about_ca_system_score_codex":0.00015966699,"about_ca_system_score_gemma":0.00014796953,"threshold_uncertainty_score":0.40342164},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1214207,0.020946164,0.82419384,0.00081229425,0.01336718,0.002506889,0.0001243457,0.0012168598,0.015411723],"genre_scores_gemma":[0.90272826,0.000002991767,0.09592839,0.0009184086,0.00020974707,0.00000710533,0.000016264614,0.000037803555,0.00015101128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775827,0.000052956526,0.0005237163,0.00069008116,0.0005249036,0.00045009426],"domain_scores_gemma":[0.998723,0.00026656364,0.00043814786,0.00040349396,0.000105432024,0.00006340695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058612996,0.0002534928,0.000361022,0.0004938575,0.00030678723,0.000051530908,0.00061981415,0.00013845299,0.00040602547],"category_scores_gemma":[0.000039418977,0.0002688431,0.00005491893,0.00043846483,0.00037972434,0.00017591869,0.00030137756,0.00078847056,0.000009273756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005579129,0.00008937918,0.0011432748,0.0008798484,0.000037224174,0.00031434884,0.03355473,0.037307784,0.0073778913,0.0023960432,0.00001998929,0.9168237],"study_design_scores_gemma":[0.0005991071,0.000095120566,0.00035150186,0.0012364432,0.000021274975,0.0001770025,0.000025461344,0.99498504,0.0008718414,0.00091630104,0.00019038553,0.0005304867],"about_ca_topic_score_codex":0.00021822329,"about_ca_topic_score_gemma":0.00004514873,"teacher_disagreement_score":0.9576773,"about_ca_system_score_codex":0.0003912599,"about_ca_system_score_gemma":0.00030652134,"threshold_uncertainty_score":0.9999764},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011609179,0.0002536902,0.9710358,0.0008499556,0.0014681314,0.0005662463,0.000008095429,0.00027363363,0.025428353],"genre_scores_gemma":[0.3191405,0.0003349552,0.66485065,0.0065906,0.0007217202,0.00017071668,0.000030631607,0.00033465927,0.00782554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99304086,0.00015047588,0.00048124036,0.0023702818,0.0026021716,0.0013549774],"domain_scores_gemma":[0.99546933,0.0011642259,0.00022371346,0.0026344224,0.00019285099,0.00031542577],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002246678,0.00063603424,0.0005884645,0.0024976854,0.0009912429,0.000686351,0.007697783,0.00019721405,0.00017207529],"category_scores_gemma":[0.00015073108,0.0006143205,0.00023174266,0.0017852616,0.0010761194,0.00097295985,0.0046883556,0.0027463243,0.0001091649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012763157,0.000039678056,0.000017498014,0.000022023562,0.000009474608,0.0002421835,0.00041781837,0.06276718,0.00007945055,0.551832,0.000017033637,0.38454285],"study_design_scores_gemma":[0.0002895118,0.00052919635,0.00003408409,0.00016190148,0.0000026087869,0.00007316765,3.5133954e-7,0.111718185,0.0007086557,0.88153344,0.0042598154,0.0006890557],"about_ca_topic_score_codex":0.000024220391,"about_ca_topic_score_gemma":0.000017407903,"teacher_disagreement_score":0.3838538,"about_ca_system_score_codex":0.0006150597,"about_ca_system_score_gemma":0.0006413715,"threshold_uncertainty_score":0.9996308},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038712972,0.00016138892,0.9950498,0.00012216596,0.00036674677,0.0001430232,0.000015693064,0.00011638781,0.00015353598],"genre_scores_gemma":[0.8892707,0.00006907007,0.11017231,0.00021317472,0.00015045362,0.000016564485,0.00003744179,0.000030787036,0.000039488175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862486,0.000025784579,0.00026579056,0.00050825754,0.0003559187,0.00021940749],"domain_scores_gemma":[0.9995159,0.00007298076,0.000045992503,0.00023847782,0.000039663402,0.00008696615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054622965,0.00022300321,0.00024791833,0.0002267147,0.00011245857,0.00010614037,0.00017754323,0.00007807386,0.000090734495],"category_scores_gemma":[0.000018724291,0.00018590462,0.000037219314,0.00017210838,0.00024429895,0.00017671444,0.00006629156,0.00054246525,0.0000016781328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000460601,0.000024276065,0.00089443545,0.00017294315,0.00004366186,0.000025532314,0.0014276489,0.47988647,0.0028552578,0.00003419218,0.0000064806486,0.5146245],"study_design_scores_gemma":[0.00026953156,0.00006965267,0.000680163,0.00019270329,0.00003980117,0.000015399732,9.3363377e-7,0.99692476,0.00044867166,0.0008020466,0.00032853358,0.0002277995],"about_ca_topic_score_codex":0.000030769348,"about_ca_topic_score_gemma":0.000025904246,"teacher_disagreement_score":0.8853994,"about_ca_system_score_codex":0.00015093111,"about_ca_system_score_gemma":0.000041437208,"threshold_uncertainty_score":0.75809705},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16253845,0.024132192,0.6758647,0.0014873571,0.010272636,0.007540629,0.00048146027,0.00048167506,0.11720089],"genre_scores_gemma":[0.9952926,0.0001460278,0.0031393475,0.000868555,0.00037858423,0.000010775755,0.000026020847,0.000040034967,0.000098062774],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9976664,0.000019313975,0.00033512485,0.00071803504,0.00093085057,0.00033025476],"domain_scores_gemma":[0.9986862,0.00018655322,0.00015498488,0.0007107447,0.0000897899,0.0001717469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024026413,0.0003187645,0.0007013605,0.00056172995,0.00010948692,0.000030285022,0.00022064504,0.00012402485,0.000267025],"category_scores_gemma":[0.00003329184,0.00026714333,0.0011841266,0.00026311475,0.00030558743,0.000055602617,0.00028158925,0.0004623392,0.000015628655],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007761666,0.0008834991,0.24782105,0.0004808762,0.0016554014,0.0018759387,0.0007656013,0.02095812,0.00015675991,0.00498803,0.00022460072,0.71941394],"study_design_scores_gemma":[0.014514236,0.007900293,0.8296601,0.0056841774,0.0036214152,0.0006715631,0.0000032777268,0.022760423,0.0029784888,0.07081258,0.037416756,0.0039766403],"about_ca_topic_score_codex":0.000033166107,"about_ca_topic_score_gemma":0.0000070647993,"teacher_disagreement_score":0.83275414,"about_ca_system_score_codex":0.00020998051,"about_ca_system_score_gemma":0.00017087282,"threshold_uncertainty_score":0.99997807},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002645197,0.00033194147,0.986372,0.0003228986,0.0010776035,0.00046874813,0.000008495528,0.00051425275,0.010877622],"genre_scores_gemma":[0.11252629,0.00013435374,0.8854398,0.00092362455,0.00017505806,0.000024800818,0.000027663156,0.000058106732,0.0006903137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611306,0.0000892887,0.00076959224,0.0012519625,0.0012973658,0.0004787181],"domain_scores_gemma":[0.99720013,0.0002401004,0.00059144327,0.0015086037,0.00033573894,0.00012401164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010736035,0.00048757668,0.0006617143,0.0011192271,0.00031482193,0.00028661903,0.0043491726,0.00023050005,0.00020600526],"category_scores_gemma":[0.00009151181,0.00046906364,0.0001596479,0.0010853844,0.00044163992,0.0006187703,0.0026605933,0.000633356,0.00001411674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025011032,0.000041158517,0.00001159207,0.0000856916,0.000011466565,0.000029195822,0.0008957476,0.19723672,0.000020581287,0.014303861,0.00011043677,0.78725106],"study_design_scores_gemma":[0.0001768482,0.00018805124,0.000053417454,0.0002808824,0.0000075958224,0.000044376666,4.0654908e-7,0.965374,0.0017802536,0.03048878,0.001106936,0.0004984576],"about_ca_topic_score_codex":0.00004225195,"about_ca_topic_score_gemma":0.000011154264,"teacher_disagreement_score":0.7867526,"about_ca_system_score_codex":0.0003219377,"about_ca_system_score_gemma":0.00089518714,"threshold_uncertainty_score":0.9997761},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056556986,0.0006305627,0.97527534,0.00040958758,0.0019220492,0.00043130183,0.000004258511,0.00024169778,0.021028677],"genre_scores_gemma":[0.15648596,0.00030264255,0.81914055,0.021315506,0.002119121,0.00015519393,0.000071855095,0.000081828315,0.00032735296],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962816,0.000068536036,0.0005135803,0.001192775,0.0011130035,0.0008304569],"domain_scores_gemma":[0.99779826,0.00036282244,0.00029444764,0.0012259505,0.00010459018,0.00021394822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013835022,0.0004702315,0.0005010156,0.00068294327,0.00069719297,0.000889193,0.003199238,0.0002642115,0.00006251997],"category_scores_gemma":[0.000026656973,0.0004664716,0.000113751536,0.0023266305,0.0006069737,0.0006947797,0.0030602412,0.0014253104,0.000015943493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000113601845,0.000052638257,0.00011546781,0.00008570779,0.000020610094,0.000040492818,0.0083603775,0.02743222,0.000002374763,0.30492607,0.0032404969,0.6557122],"study_design_scores_gemma":[0.00041721854,0.000097640506,0.00037181846,0.00010470966,0.000008329448,0.000068503425,0.0000012989401,0.29135403,0.0000352093,0.6529881,0.0535558,0.0009973695],"about_ca_topic_score_codex":0.000007424915,"about_ca_topic_score_gemma":0.0000387663,"teacher_disagreement_score":0.6547148,"about_ca_system_score_codex":0.00025925602,"about_ca_system_score_gemma":0.0007446364,"threshold_uncertainty_score":0.9997787},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017249625,0.00010829663,0.9888076,0.0045541716,0.0030108527,0.001281842,0.000013659102,0.0001561657,0.0018949114],"genre_scores_gemma":[0.013595244,0.0000055383402,0.97945887,0.0056294035,0.00058107876,0.00007896649,0.000010585779,0.00005310911,0.00058721896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99547476,0.000050620252,0.0006076221,0.0021220106,0.0009818296,0.00076316606],"domain_scores_gemma":[0.99712086,0.0004137353,0.00025031628,0.0018015493,0.00020099085,0.0002125327],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020680635,0.0005019546,0.0005710185,0.0007480348,0.00046955183,0.0009482829,0.0065299086,0.00021984376,0.00006543432],"category_scores_gemma":[0.00013576851,0.0005154263,0.00012364246,0.0006765162,0.00018047173,0.0009993437,0.005137896,0.00076182344,0.00001983354],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024535331,0.000029691242,0.00003411331,0.000048760932,0.000013476547,0.00007169553,0.0011013494,0.083278865,0.0005098951,0.109306075,0.0001660788,0.80541545],"study_design_scores_gemma":[0.00057908735,0.00036812626,0.00002926173,0.00031797335,0.000007965913,0.00005896523,2.0083655e-7,0.6234103,0.00094893394,0.3245964,0.048686247,0.0009965431],"about_ca_topic_score_codex":0.00005724643,"about_ca_topic_score_gemma":0.0000866836,"teacher_disagreement_score":0.8044189,"about_ca_system_score_codex":0.00061548717,"about_ca_system_score_gemma":0.00046393153,"threshold_uncertainty_score":0.99972975},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011293649,0.00021314272,0.98594594,0.0018818596,0.0038620175,0.0004907618,0.0000019371043,0.00067575666,0.0068156696],"genre_scores_gemma":[0.08923832,0.000090257316,0.90658015,0.0026653802,0.0009747686,0.00007371672,0.000008716539,0.00010198903,0.0002667211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919471,0.0001691981,0.000719985,0.0022741763,0.0039666053,0.0009229106],"domain_scores_gemma":[0.9967926,0.0006764177,0.00038086178,0.0015435371,0.00024536185,0.00036121713],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0026681025,0.00064615457,0.0006192144,0.0009725971,0.0008082678,0.0005547148,0.005023886,0.00038070788,0.00068473263],"category_scores_gemma":[0.000114758295,0.00064234115,0.00021175809,0.00110846,0.0005534555,0.00039474384,0.004196377,0.0030381286,0.00006648852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053029116,0.00008148606,0.000035892735,0.00005720254,0.00002426243,0.00033463043,0.0010180568,0.19766067,0.00019244512,0.0056166076,0.000027960232,0.7949455],"study_design_scores_gemma":[0.00035587492,0.00033457807,0.00006732547,0.00013190307,0.000010280718,0.00020866327,2.476479e-7,0.98213965,0.00022392863,0.009638271,0.006202611,0.0006866747],"about_ca_topic_score_codex":0.00006121854,"about_ca_topic_score_gemma":0.000026621503,"teacher_disagreement_score":0.79425883,"about_ca_system_score_codex":0.0020762305,"about_ca_system_score_gemma":0.0019614443,"threshold_uncertainty_score":0.9996028},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027135116,0.00027795066,0.9957626,0.00083857967,0.0014131056,0.0009456549,0.000009332521,0.00021122383,0.0002702199],"genre_scores_gemma":[0.10110365,0.00008117902,0.8970333,0.00086389406,0.00050890533,0.000118738346,0.000019273335,0.00005978069,0.00021131047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968877,0.00003594911,0.0004623664,0.0015041534,0.00058727385,0.0005225487],"domain_scores_gemma":[0.9974563,0.00058951875,0.0003713418,0.0012426525,0.00020641866,0.00013377873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042232106,0.0004140711,0.0003515984,0.0007010567,0.0011131425,0.00022206786,0.0018638823,0.00017854197,0.000012427534],"category_scores_gemma":[0.000059064605,0.0003972469,0.00014872458,0.00092993275,0.00023058167,0.00071062625,0.0010952326,0.00060503196,0.0000056133986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010531131,0.000024331079,0.000004646266,0.000016749644,0.00000404639,0.000008273881,0.00020794173,0.28881198,0.0029451356,0.024628216,0.0000065545782,0.6833316],"study_design_scores_gemma":[0.00020728819,0.00016032062,0.000022285638,0.00012581932,0.000008483181,0.00006936627,1.3695426e-7,0.8124149,0.0028766738,0.17604607,0.0076492704,0.00041939298],"about_ca_topic_score_codex":0.00001122475,"about_ca_topic_score_gemma":0.00005289822,"teacher_disagreement_score":0.6829122,"about_ca_system_score_codex":0.00061471504,"about_ca_system_score_gemma":0.0003049311,"threshold_uncertainty_score":0.99984795},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010055767,0.00047049436,0.97349155,0.021308407,0.00079265854,0.0026916002,0.000028793505,0.00016469433,0.0000462354],"genre_scores_gemma":[0.24525306,0.0015184584,0.67923236,0.069949046,0.0011600449,0.0011489785,0.0005539819,0.00035545597,0.0008286253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963246,0.000045707744,0.0006145398,0.0013893647,0.0011453308,0.00048047875],"domain_scores_gemma":[0.9965461,0.001806475,0.0003665659,0.0007140943,0.00029657723,0.0002702138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009980912,0.00046962156,0.0007698948,0.0009290618,0.00036989537,0.00006664559,0.0005699898,0.00033419218,0.00022696343],"category_scores_gemma":[0.0006576648,0.00044126468,0.00033933346,0.0005654138,0.00031507184,0.00021366784,0.00023278758,0.0009466587,0.0000026998384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036155875,0.00062927813,0.0024950977,0.0024127946,0.00014698811,0.00009207806,0.007276229,0.13380787,0.022460582,0.00009248716,0.0006642404,0.8295608],"study_design_scores_gemma":[0.00795391,0.0052605583,0.0009477454,0.0014072346,0.0005213238,0.00006701224,0.000008230395,0.78827477,0.035099473,0.0028298274,0.15627098,0.0013589552],"about_ca_topic_score_codex":0.00021994536,"about_ca_topic_score_gemma":0.00009840144,"teacher_disagreement_score":0.82820183,"about_ca_system_score_codex":0.0012878111,"about_ca_system_score_gemma":0.0010888648,"threshold_uncertainty_score":0.9998039},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008700632,0.00012932028,0.9965977,0.0010508506,0.00076483947,0.00096217333,0.000033436718,0.00005720409,0.00031748702],"genre_scores_gemma":[0.36802292,0.000034171408,0.6289226,0.0020755753,0.00030668738,0.00018630257,0.00010049485,0.000047111305,0.00030414315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769753,0.000048955488,0.0003560713,0.0006879072,0.0008551496,0.00035438052],"domain_scores_gemma":[0.99766546,0.0009278143,0.00045725467,0.00058962044,0.00029753594,0.000062307896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007531115,0.0002614601,0.0002531336,0.00037910874,0.00063012086,0.00027282772,0.0012996187,0.00008275616,0.000052436593],"category_scores_gemma":[0.000085422376,0.00019454134,0.000081765334,0.0005726817,0.00033389547,0.0005361151,0.00028681968,0.00039361804,0.0000022334902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032480417,0.000025113897,0.000052000203,0.000038152775,0.000023294186,0.0000056965305,0.0035238897,0.49457607,0.0001951028,0.12672023,0.000039635437,0.37476835],"study_design_scores_gemma":[0.0007737831,0.00030113157,0.000519043,0.00006916641,0.000020453474,0.000017684073,0.000008608242,0.9652783,0.0012553402,0.022271289,0.009133005,0.00035216848],"about_ca_topic_score_codex":0.000010901185,"about_ca_topic_score_gemma":0.00006378136,"teacher_disagreement_score":0.47070226,"about_ca_system_score_codex":0.000139824,"about_ca_system_score_gemma":0.00042882768,"threshold_uncertainty_score":0.7933166},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017691054,0.00018536711,0.9608809,0.00095951615,0.0028156275,0.00046645547,0.000057929163,0.00020357213,0.03425375],"genre_scores_gemma":[0.14498717,0.000019581898,0.84443754,0.00139096,0.0010765529,0.000084972235,0.00003375812,0.00016769451,0.0078017833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9889155,0.00033968058,0.001489565,0.0027491509,0.0055108527,0.0009952664],"domain_scores_gemma":[0.99154073,0.0049277483,0.000788174,0.0017367882,0.0006092138,0.0003973738],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008640081,0.0008321915,0.0011862079,0.0029142378,0.0011333199,0.0005418738,0.0034717927,0.00041013723,0.0021961275],"category_scores_gemma":[0.0020320488,0.0006496301,0.00037243825,0.0032296448,0.0012594423,0.0007732567,0.0008013977,0.0021627375,0.00001362998],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013667352,0.000067363006,0.000612385,0.000016635018,0.000031750737,0.00012921097,0.0019580969,0.04283662,0.00007137423,0.0004079669,0.00042648282,0.9533054],"study_design_scores_gemma":[0.0023835327,0.004531421,0.0026249052,0.0007142609,0.00024869546,0.0007874682,0.000014717683,0.5608176,0.0007690145,0.20388305,0.21886708,0.0043582367],"about_ca_topic_score_codex":0.00007040055,"about_ca_topic_score_gemma":0.0009857892,"teacher_disagreement_score":0.9489472,"about_ca_system_score_codex":0.0015784225,"about_ca_system_score_gemma":0.001495751,"threshold_uncertainty_score":0.9995955},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041328,0.0005196044,0.6064125,0.0022545995,0.013062122,0.0009157935,0.00002036446,0.0004505758,0.37595117],"genre_scores_gemma":[0.09573517,0.0005529531,0.037937853,0.007971022,0.014442217,0.000038268965,0.000101546466,0.0002229961,0.84299797],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963932,0.00006240143,0.00035202282,0.00088002277,0.0013834198,0.0009289372],"domain_scores_gemma":[0.99822813,0.00078808726,0.00017659069,0.00041932677,0.00012426784,0.0002636221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015576654,0.00029176733,0.00037711053,0.00043185728,0.00026664976,0.0005845861,0.0015354074,0.00025411163,0.00004050918],"category_scores_gemma":[0.0003909593,0.00027940844,0.00012684913,0.0010767368,0.001295187,0.00022915142,0.00068486825,0.0005162105,0.00028037615],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002203391,0.00002233793,0.00008997148,0.000028620902,0.0000073060305,0.000071663686,0.0069849864,0.0029832944,0.0000034942116,0.0010261491,0.0014918166,0.9872882],"study_design_scores_gemma":[0.0005995742,0.0002239604,0.0005919971,0.0018220199,0.000023622228,0.000008922134,0.00003800248,0.0273986,0.00006743431,0.058399186,0.90939766,0.0014290162],"about_ca_topic_score_codex":0.00014784995,"about_ca_topic_score_gemma":0.001943709,"teacher_disagreement_score":0.98585916,"about_ca_system_score_codex":0.00083872746,"about_ca_system_score_gemma":0.001793595,"threshold_uncertainty_score":0.9999658},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055195026,0.0007190802,0.94040054,0.00005019753,0.0013075918,0.00035817435,0.0000049454206,0.0003802189,0.0015842482],"genre_scores_gemma":[0.99258035,0.0000248928,0.0066070226,0.00037850975,0.00023571207,0.000008145094,0.000011701555,0.000068957896,0.00008472491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756867,0.000038835864,0.00045117707,0.00085007946,0.00045786856,0.00063336705],"domain_scores_gemma":[0.99905694,0.00027017685,0.000111529866,0.00040243077,0.000035108613,0.00012380186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026174067,0.0005038958,0.0005625145,0.0004721744,0.00024810372,0.00010958831,0.0008164786,0.00015820225,0.00005033194],"category_scores_gemma":[0.000040536015,0.0005132119,0.00009013691,0.00023517256,0.00022649988,0.00037589367,0.00046128707,0.0021224995,0.0000024346548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064628703,0.0000057659277,0.000031730036,0.000022061446,0.0000024276465,0.0000589272,0.0013395676,0.788852,0.0007427831,0.00076892076,4.4228375e-7,0.20816892],"study_design_scores_gemma":[0.0002800478,0.00012130617,0.000024862076,0.00018822147,0.0000043953764,0.000028952449,0.0000028715074,0.98709565,0.0015390514,0.010034877,0.00013355998,0.00054618187],"about_ca_topic_score_codex":0.000008158088,"about_ca_topic_score_gemma":0.000111938745,"teacher_disagreement_score":0.9373853,"about_ca_system_score_codex":0.00039862472,"about_ca_system_score_gemma":0.0000569176,"threshold_uncertainty_score":0.99973196},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007384081,0.00016870367,0.9973987,0.0004643499,0.00042780756,0.000659584,0.000004522682,0.0000936177,0.00070888666],"genre_scores_gemma":[0.23779719,0.0001853495,0.7592084,0.0015635206,0.00061890145,0.0001464281,0.00002538356,0.000046336685,0.00040848492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974402,0.00004604155,0.00043515943,0.0010303784,0.00067554624,0.00037266128],"domain_scores_gemma":[0.9979442,0.00026482702,0.0003727538,0.0012256238,0.00011073329,0.00008187482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008380493,0.00025641188,0.00029011315,0.00052490504,0.00009390098,0.00015438646,0.0019528315,0.00010347803,0.000006799773],"category_scores_gemma":[0.000012705445,0.00021470971,0.000043412492,0.0006307114,0.0003447011,0.00043343526,0.0014008097,0.00015567767,0.000011443345],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012800324,0.000010413434,0.00011811871,0.000051993084,0.000005396561,0.0000037282098,0.00012414274,0.0023963552,0.000109417684,0.009161191,0.00021429676,0.98780364],"study_design_scores_gemma":[0.0007071783,0.00024477052,0.0012143478,0.00030301744,0.000014629786,0.000014621672,2.8509976e-7,0.864297,0.0032548863,0.12061025,0.008746397,0.0005926479],"about_ca_topic_score_codex":0.000027174268,"about_ca_topic_score_gemma":0.00006484503,"teacher_disagreement_score":0.987211,"about_ca_system_score_codex":0.00036437757,"about_ca_system_score_gemma":0.00044866235,"threshold_uncertainty_score":0.87556076},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013276453,0.0007130206,0.99610794,0.00062264135,0.00029425288,0.00054370525,0.000050278497,0.0001555151,0.0014993869],"genre_scores_gemma":[0.00046459155,0.000086503635,0.99735826,0.0006872165,0.00039730914,0.000111957954,0.0001153517,0.000020085643,0.00075869175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967076,0.000019930225,0.0003576517,0.001950562,0.00048710415,0.0004771483],"domain_scores_gemma":[0.99539083,0.00045439962,0.00020476033,0.0036426107,0.00013122857,0.00017616068],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005437922,0.0003222741,0.00032311017,0.00037120207,0.00032849232,0.0008864329,0.0068729855,0.0001566301,0.000005404572],"category_scores_gemma":[0.000061537554,0.0003030749,0.000024254054,0.00095797563,0.00053799985,0.0013348825,0.0049539357,0.00035965213,0.000041441122],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.741545e-7,0.00001484452,0.000007835268,0.000016738164,0.0000030471497,0.0000024768235,0.0001435772,0.00032187277,0.000019084287,0.0017258043,0.0006756678,0.9970689],"study_design_scores_gemma":[0.00014497602,0.000039201037,0.00009251352,0.00014750838,0.000006376551,0.000044432123,3.7544143e-7,0.9155863,0.000052940904,0.02528962,0.058124166,0.00047161887],"about_ca_topic_score_codex":0.000014705982,"about_ca_topic_score_gemma":0.000026244257,"teacher_disagreement_score":0.99659723,"about_ca_system_score_codex":0.00011330349,"about_ca_system_score_gemma":0.00069727475,"threshold_uncertainty_score":0.9999421},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008506729,0.004604711,0.99157447,0.000334734,0.0006808721,0.00026364397,0.00003047896,0.00006468397,0.0023613484],"genre_scores_gemma":[0.005059923,0.00075856666,0.99234456,0.00037782133,0.00044952775,0.000035347686,0.00007642075,0.000023399165,0.00087444886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679077,0.000036370537,0.0003858858,0.0018951333,0.00037781915,0.0005140099],"domain_scores_gemma":[0.9966255,0.0006501769,0.0001634044,0.0023830305,0.000066823355,0.00011107853],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007860122,0.00032903586,0.00037951066,0.0005417723,0.00016149804,0.0012023171,0.0060868845,0.00014783784,0.000002218932],"category_scores_gemma":[0.00011355641,0.0002920011,0.000022417735,0.0010934259,0.0005481337,0.004357978,0.00555246,0.00046795537,0.000021008422],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.5124538e-7,0.000026380734,0.00008155277,0.000031368538,0.0000012227786,0.0000084644835,0.00050097797,0.00037520047,0.000005782072,0.0013414869,0.0003160623,0.9973112],"study_design_scores_gemma":[0.00016507343,0.000045651657,0.00039562146,0.00050082646,0.0000029279095,0.00003025225,6.926754e-7,0.9596035,0.000029690125,0.020555986,0.018216241,0.00045356498],"about_ca_topic_score_codex":0.000029118019,"about_ca_topic_score_gemma":0.00024841976,"teacher_disagreement_score":0.9968576,"about_ca_system_score_codex":0.00014563161,"about_ca_system_score_gemma":0.000797875,"threshold_uncertainty_score":0.9999532},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029099,0.0005669764,0.981902,0.0005351475,0.0024872045,0.00071946095,0.0000346083,0.00009559152,0.013368034],"genre_scores_gemma":[0.30786458,0.00006396003,0.65304476,0.010582258,0.004037755,0.00008884557,0.00011608577,0.00011254967,0.024089187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9871216,0.000063773674,0.0010640144,0.0033995477,0.0073910234,0.000960054],"domain_scores_gemma":[0.9911057,0.0038534128,0.0004979657,0.0018945222,0.002232002,0.0004164486],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.022847872,0.00042541674,0.00050023984,0.0037796793,0.0011972389,0.0027498214,0.0059437235,0.00017747747,0.000081866194],"category_scores_gemma":[0.0036278323,0.0003532144,0.00007862473,0.007362326,0.0037304424,0.0008605355,0.0036581587,0.0006201482,0.00042528822],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047985777,0.0000501658,0.000098475786,0.000018231645,0.000004192984,0.000019198469,0.00027381376,0.07694158,0.00002286379,0.008752969,0.0044480716,0.90936565],"study_design_scores_gemma":[0.00020417201,0.000052258783,0.0009799154,0.00009852224,0.000008180425,0.000046975132,0.000002015642,0.7012517,0.00007446819,0.20626232,0.090516075,0.00050340703],"about_ca_topic_score_codex":0.000010404781,"about_ca_topic_score_gemma":0.000027093689,"teacher_disagreement_score":0.90886223,"about_ca_system_score_codex":0.000627641,"about_ca_system_score_gemma":0.002767341,"threshold_uncertainty_score":0.999892},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004933118,0.00057290186,0.99174094,0.0015036039,0.0025584707,0.00033893593,0.0000074280274,0.00007901197,0.0027054136],"genre_scores_gemma":[0.80648184,0.000028203829,0.19008791,0.0025504672,0.0004958714,0.000007331774,0.000020937207,0.000030556588,0.00029685334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965491,0.000088235276,0.0006312536,0.0010202538,0.0012599739,0.00045116048],"domain_scores_gemma":[0.99717915,0.0009509909,0.00045450567,0.0010391767,0.0002818666,0.000094321374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001394748,0.0003796668,0.00044895447,0.0006946407,0.00046557962,0.00026316525,0.0032947934,0.00013949933,0.00010663358],"category_scores_gemma":[0.000095641364,0.0003036748,0.00016876712,0.0010178126,0.0005865165,0.00041509297,0.0022282607,0.00086191634,0.000015555248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065846953,0.0000329934,0.000043315165,0.00002973489,0.000019566973,0.000027884586,0.0014830303,0.30702212,0.0001497037,0.10873199,0.000075224656,0.58237785],"study_design_scores_gemma":[0.00021414102,0.00018233898,0.00026290817,0.0001031896,0.000008757505,0.00010543801,6.365491e-7,0.9150147,0.00096444646,0.07826328,0.0044554826,0.00042471787],"about_ca_topic_score_codex":0.000033178956,"about_ca_topic_score_gemma":0.000020909998,"teacher_disagreement_score":0.80598855,"about_ca_system_score_codex":0.0002065393,"about_ca_system_score_gemma":0.0007009337,"threshold_uncertainty_score":0.9999415},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003325177,0.00042414176,0.98207676,0.0007736233,0.0015110178,0.0007116558,0.00008032555,0.00010070028,0.013989238],"genre_scores_gemma":[0.41518125,0.000027289185,0.52194315,0.0066185463,0.0036724133,0.0001690555,0.0002611999,0.00012540664,0.052001663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98820007,0.00007545913,0.001015882,0.0033601092,0.0065190583,0.0008294475],"domain_scores_gemma":[0.9928666,0.0026960624,0.0005001981,0.0018301224,0.0018279166,0.00027914066],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0124295745,0.00042482562,0.0005020705,0.002952013,0.0012457693,0.0033135372,0.005596613,0.0001522744,0.00003744092],"category_scores_gemma":[0.0021696198,0.00035209316,0.00007919784,0.0067176567,0.0032016353,0.0008827083,0.0033340387,0.000518579,0.00027624748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030866754,0.000066433,0.00015733004,0.00002122499,0.0000037537452,0.000014643762,0.00016629903,0.26162142,0.000030770207,0.00808081,0.01703106,0.7128032],"study_design_scores_gemma":[0.00016736507,0.000035543813,0.0011116816,0.00007310812,0.0000073080337,0.000027353062,6.494993e-7,0.68775016,0.00004275019,0.21945935,0.09090963,0.00041511565],"about_ca_topic_score_codex":0.000027576063,"about_ca_topic_score_gemma":0.000055928824,"teacher_disagreement_score":0.71238804,"about_ca_system_score_codex":0.0005649388,"about_ca_system_score_gemma":0.0026472388,"threshold_uncertainty_score":0.9998931},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070783,0.00022889888,0.99616474,0.00031020975,0.00035603196,0.0003477324,0.0000142470935,0.00009112997,0.0017791892],"genre_scores_gemma":[0.005988479,0.000023681177,0.9908475,0.00040889057,0.0006589384,0.000011356259,0.00004169894,0.000036074416,0.0019833301],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815845,0.000057850226,0.000323003,0.0005829251,0.00059131364,0.00028646126],"domain_scores_gemma":[0.99852955,0.0004947584,0.00023281144,0.0004302098,0.00020328427,0.00010936302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013280993,0.0002756655,0.00036962313,0.0003261559,0.000118377146,0.00015046446,0.00052370713,0.00024120715,0.00001242833],"category_scores_gemma":[0.0004742286,0.00022888473,0.00003513502,0.00034776665,0.0007019975,0.000306523,0.00025576956,0.00044725044,0.000007618001],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013815346,0.0001376272,0.000021608594,0.00045127957,0.000018537201,0.000034702694,0.0070109535,0.0026465952,0.00007766438,0.068224505,0.0008045597,0.92055815],"study_design_scores_gemma":[0.00013776647,0.000056261393,0.0000037860086,0.0001812297,0.000008171766,0.0000332945,0.0000017617731,0.18035878,0.00021217062,0.81842536,0.00035273063,0.00022870259],"about_ca_topic_score_codex":0.0000030073288,"about_ca_topic_score_gemma":0.000022565357,"teacher_disagreement_score":0.92032945,"about_ca_system_score_codex":0.00023702651,"about_ca_system_score_gemma":0.0005455814,"threshold_uncertainty_score":0.93336487},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026963823,0.0006834785,0.9862405,0.0012732251,0.0010747018,0.0007398042,0.000033926444,0.00010497688,0.009579755],"genre_scores_gemma":[0.39372826,0.00008662015,0.5692685,0.013133682,0.0029172115,0.00009332428,0.00012082495,0.00008771197,0.020563813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9882316,0.00008058609,0.0009675,0.003382835,0.006503045,0.00083440606],"domain_scores_gemma":[0.9928826,0.0024908416,0.00047974827,0.0019214189,0.001858959,0.00036642692],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.013916843,0.0004271853,0.00052278105,0.003005593,0.0012014866,0.0032646025,0.006068272,0.00015404703,0.000042963864],"category_scores_gemma":[0.0032672544,0.0003514913,0.00007973296,0.006960617,0.00250839,0.00093742437,0.0025602335,0.0005628145,0.00029652214],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027322892,0.000044406086,0.000028678629,0.000009268837,0.0000024979524,0.000010698723,0.00019837926,0.10115423,0.000022060583,0.005516735,0.004902598,0.8881077],"study_design_scores_gemma":[0.0001643618,0.00006307465,0.0009875015,0.00008587009,0.0000069549155,0.00003484517,9.702426e-7,0.65378,0.000047889105,0.2930493,0.051372785,0.00040646273],"about_ca_topic_score_codex":0.000006448287,"about_ca_topic_score_gemma":0.000019272058,"teacher_disagreement_score":0.8877013,"about_ca_system_score_codex":0.00050787063,"about_ca_system_score_gemma":0.0029178283,"threshold_uncertainty_score":0.9998937},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007564223,0.00012225946,0.9912306,0.00056591874,0.005208264,0.00021144339,0.0000029194891,0.0002031167,0.0023798004],"genre_scores_gemma":[0.059388608,0.000012238104,0.93933433,0.000260879,0.00035913047,0.000005543553,0.0000033662336,0.000028974899,0.00060689845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672806,0.00003614116,0.0005875058,0.0010973557,0.0011699122,0.00038103055],"domain_scores_gemma":[0.99659574,0.0009644097,0.00038263857,0.0017132174,0.00029223098,0.00005176017],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094870926,0.00037892314,0.0003943894,0.00051068614,0.0001207852,0.00011194001,0.0037363584,0.00021674724,0.000003357621],"category_scores_gemma":[0.0010079914,0.00028635896,0.00015589861,0.0005768504,0.00039149198,0.0002981005,0.0015580922,0.0008433993,0.0000029980947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026017622,0.00001117016,0.00001636313,0.0000068430977,0.0000070558817,0.00006466916,0.00009610517,0.9185096,0.000038763068,0.010144812,0.000013193806,0.07108884],"study_design_scores_gemma":[0.00011488363,0.000032586366,0.00006064865,0.00045977763,0.0000039994875,0.00011445649,1.117769e-7,0.8441913,0.0012504127,0.15291968,0.0005140319,0.0003380963],"about_ca_topic_score_codex":0.000010849766,"about_ca_topic_score_gemma":0.000009433366,"teacher_disagreement_score":0.14277487,"about_ca_system_score_codex":0.00032042628,"about_ca_system_score_gemma":0.00026910758,"threshold_uncertainty_score":0.9999589},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023981553,0.00093040377,0.99510515,0.0003123337,0.0012956923,0.00014291052,0.0000041158487,0.0002536828,0.0017159109],"genre_scores_gemma":[0.90137494,0.00034934044,0.09447731,0.00021635075,0.0013476396,0.000027180797,0.000010431074,0.000116439915,0.0020803984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992212,0.0000046498603,0.0001528576,0.00027082113,0.00015175501,0.00019873088],"domain_scores_gemma":[0.99957496,0.00005575355,0.000032367418,0.00023631932,0.00006927301,0.000031336498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012832311,0.00014718273,0.00018321395,0.00044930202,0.000045959485,0.00011660721,0.00026536197,0.00023744398,0.0000023173209],"category_scores_gemma":[0.000018841838,0.000115656505,0.000008666419,0.00051245536,0.00020526203,0.00009033834,0.000080374055,0.00016751899,0.000012445682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.3645856e-7,0.000005181458,0.00010692664,0.00019284687,0.00001413409,0.00003803547,0.0003138776,0.25104135,0.0056134523,0.0017657506,0.0011696704,0.73973805],"study_design_scores_gemma":[0.00015543697,0.000045288387,0.000025052312,0.0006041028,0.0000036909614,0.00003680656,1.638723e-7,0.95520717,0.0035453923,0.0331957,0.0068153664,0.0003658506],"about_ca_topic_score_codex":5.094849e-7,"about_ca_topic_score_gemma":0.00001205949,"teacher_disagreement_score":0.9011351,"about_ca_system_score_codex":0.00015182942,"about_ca_system_score_gemma":0.0001457348,"threshold_uncertainty_score":0.47163352},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000383446,0.0011637812,0.9958202,0.0007581863,0.0002606507,0.00022629258,0.000001378602,0.00011328018,0.0016178595],"genre_scores_gemma":[0.065180704,0.00003791457,0.93140525,0.0016209814,0.0011900404,0.00002267932,0.0000038166277,0.00002588092,0.00051275664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977865,0.000022450085,0.00025334585,0.00091401296,0.00045666358,0.00056700164],"domain_scores_gemma":[0.998788,0.00019487727,0.00015481155,0.0005801048,0.000105692,0.00017652825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042627912,0.00029066487,0.000266933,0.00025351666,0.00029669318,0.0007528941,0.0017735575,0.00014759188,0.0000069961857],"category_scores_gemma":[0.000007962551,0.00024839203,0.00004215748,0.00075329136,0.0005609504,0.0008559037,0.0010672981,0.0005327748,0.000018173487],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.875867e-7,0.000014924383,0.000021850141,0.000028457915,0.0000011541568,0.0000080399295,0.00021683199,0.00058353995,0.00021666582,0.0012627147,0.00016793697,0.9974774],"study_design_scores_gemma":[0.000101764694,0.000040963627,0.00021021122,0.00018819222,0.00000498222,0.00008487829,4.0820815e-8,0.93263346,0.00031341356,0.061428737,0.0045565115,0.0004368606],"about_ca_topic_score_codex":0.0000039232586,"about_ca_topic_score_gemma":0.0000069124185,"teacher_disagreement_score":0.9970405,"about_ca_system_score_codex":0.000110389155,"about_ca_system_score_gemma":0.00044681027,"threshold_uncertainty_score":0.99999684},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005114376,0.0008777425,0.98870075,0.0012786112,0.001875322,0.00036356156,0.0000021861374,0.00013864401,0.0016488256],"genre_scores_gemma":[0.19974847,0.00024370365,0.7852788,0.008547442,0.004523069,0.000008748731,0.00012563658,0.0001687232,0.0013553813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634093,0.000105039995,0.0007006068,0.0011527322,0.0010740509,0.0006266249],"domain_scores_gemma":[0.99800557,0.00043519787,0.000310005,0.00054861006,0.00019341373,0.0005071887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019449623,0.0004551426,0.0008263336,0.00067670055,0.00019551822,0.00018012743,0.0007395483,0.0004308609,0.00018639311],"category_scores_gemma":[0.00038695347,0.00038770444,0.00017647582,0.00029827468,0.0016189947,0.00015263385,0.00092459196,0.002106072,0.000037139027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024108685,0.000131614,0.001051374,0.00035449848,0.000035659992,0.00051896356,0.000549893,0.00006671566,0.00009493483,0.00010092666,0.0008082029,0.9962631],"study_design_scores_gemma":[0.0019414702,0.00056813227,0.009743091,0.004473743,0.00008208948,0.0021507002,6.469559e-7,0.9740052,0.00014901604,0.0037368573,0.002552445,0.00059656997],"about_ca_topic_score_codex":0.00011839486,"about_ca_topic_score_gemma":0.000023325667,"teacher_disagreement_score":0.99566656,"about_ca_system_score_codex":0.00027437037,"about_ca_system_score_gemma":0.0007245329,"threshold_uncertainty_score":0.9998575},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003276387,0.0006756138,0.98555905,0.0008073235,0.0043960055,0.0006162367,0.0000047656886,0.00073956215,0.007168687],"genre_scores_gemma":[0.01525614,0.00010401474,0.9693225,0.0019130297,0.003522324,0.000056890975,0.00001002447,0.00013022308,0.009684838],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920824,0.0004503676,0.00086098886,0.0032274334,0.0017942005,0.0015845996],"domain_scores_gemma":[0.9930605,0.0029648223,0.00047614498,0.0026891425,0.00044869326,0.0003606589],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0038332972,0.0009517165,0.00096015265,0.001319519,0.0005263172,0.0009366425,0.008527652,0.0005732017,0.000062544656],"category_scores_gemma":[0.00061207195,0.00075800635,0.00030041026,0.0017670987,0.0015203096,0.0010606922,0.0049679973,0.0018832313,0.00030121038],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004305356,0.000045645425,0.00005493216,0.000037214773,0.000013398865,0.00014714868,0.0005820006,0.010871713,0.00005624638,0.008012282,0.00009306179,0.98008204],"study_design_scores_gemma":[0.00039356778,0.000283377,0.00018706235,0.0003753929,0.000008533445,0.00016365063,1.9903909e-7,0.41997847,0.00041651112,0.5693615,0.007720907,0.0011108248],"about_ca_topic_score_codex":0.000011280464,"about_ca_topic_score_gemma":0.000015446607,"teacher_disagreement_score":0.97897124,"about_ca_system_score_codex":0.0015400199,"about_ca_system_score_gemma":0.0024642174,"threshold_uncertainty_score":0.9994871},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019165343,0.0001613081,0.99228454,0.0000032362568,0.0011147666,0.00014722103,0.0000075929256,0.00012274251,0.0042420877],"genre_scores_gemma":[0.82568115,0.00017431886,0.16951005,0.00023344207,0.0031821928,0.00003615358,0.00006785034,0.00012680177,0.0009880256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989411,0.000018773278,0.00023085027,0.00037899512,0.0002212095,0.00020902394],"domain_scores_gemma":[0.9994704,0.00009182969,0.00005522704,0.00025014995,0.00007122326,0.00006116124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039510857,0.00019040513,0.00030462837,0.0009639035,0.000066140135,0.00013893841,0.00017213712,0.00026300506,0.000033741715],"category_scores_gemma":[0.00002934818,0.00017434706,0.00007333018,0.0009720517,0.00012443494,0.00015947306,0.000063787345,0.00037317115,0.000029463206],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036766583,0.000004053412,0.000037810612,0.0000520114,0.00005381809,0.000014191197,0.00035254427,0.0051258407,0.00049786904,0.000002508659,0.00009618819,0.9937595],"study_design_scores_gemma":[0.00050974754,0.00022131723,0.0011526876,0.0005203372,0.0003041746,0.00007165158,5.699424e-7,0.95608693,0.013365231,0.023965634,0.0024975096,0.0013042301],"about_ca_topic_score_codex":0.000047193014,"about_ca_topic_score_gemma":0.00007824795,"teacher_disagreement_score":0.99245524,"about_ca_system_score_codex":0.00014307405,"about_ca_system_score_gemma":0.000058762642,"threshold_uncertainty_score":0.7109667},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005614013,0.00047878982,0.9875262,0.002286631,0.0024676945,0.0003419805,0.0000024212682,0.000126508,0.0011557908],"genre_scores_gemma":[0.10928625,0.0001229354,0.86525613,0.013231818,0.010227115,0.000006861194,0.00014070513,0.00015922962,0.0015689277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961292,0.0001156104,0.000678028,0.0011785668,0.0012707626,0.0006278175],"domain_scores_gemma":[0.9979014,0.0005632051,0.00028754905,0.00055065216,0.00022900749,0.00046821655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002334185,0.00043881286,0.0007820093,0.0006250512,0.00023021213,0.000276094,0.00068260863,0.00043742676,0.00012051727],"category_scores_gemma":[0.0007050235,0.0003675221,0.00016368288,0.00043700618,0.0023567106,0.00015005372,0.00094944425,0.0017876044,0.000034681358],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025562595,0.00010566808,0.00089718716,0.00036891567,0.000042340558,0.00040702286,0.00041711004,0.00009105732,0.00012971701,0.00004415167,0.0045002997,0.99297094],"study_design_scores_gemma":[0.0015396618,0.0005061781,0.004979487,0.0045214603,0.000057923335,0.0015530402,4.2181986e-7,0.97914976,0.000095754694,0.0019714944,0.0051787305,0.00044609688],"about_ca_topic_score_codex":0.000042960404,"about_ca_topic_score_gemma":0.00001938014,"teacher_disagreement_score":0.99252486,"about_ca_system_score_codex":0.00035814903,"about_ca_system_score_gemma":0.0007202379,"threshold_uncertainty_score":0.9998777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000118445525,0.00013797682,0.994458,0.00038274506,0.003263709,0.00063813274,0.000025434145,0.0002748769,0.0007006838],"genre_scores_gemma":[0.10539196,0.00001008286,0.89233136,0.0010062333,0.001015726,0.000016352882,0.00006106228,0.00004531977,0.0001219045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605745,0.000059715825,0.0006573716,0.0017141316,0.00085218815,0.0006591681],"domain_scores_gemma":[0.9974847,0.0006596932,0.00042593773,0.0010170076,0.00022531585,0.00018735939],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012332231,0.00048109758,0.00047936646,0.0008466803,0.00062182714,0.0006414477,0.0031002443,0.00019251651,0.000023509243],"category_scores_gemma":[0.0000694674,0.00048983184,0.00014676857,0.00062210177,0.00025174962,0.0010992477,0.0012390689,0.00064325647,0.000009599775],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062831505,0.00002983397,0.00000497232,0.0000132479345,0.000006625886,0.000013787672,0.00076246826,0.02011297,0.00016420576,0.012893047,0.0000142165545,0.9659783],"study_design_scores_gemma":[0.000353825,0.00039526355,0.00009255774,0.000108629465,0.00000571504,0.000031824726,3.1187096e-7,0.8991295,0.00026906148,0.097460695,0.0016337987,0.0005188192],"about_ca_topic_score_codex":0.000039650586,"about_ca_topic_score_gemma":0.000029634464,"teacher_disagreement_score":0.9654595,"about_ca_system_score_codex":0.0004203246,"about_ca_system_score_gemma":0.0004828413,"threshold_uncertainty_score":0.9997553},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005040522,0.0026708131,0.9945646,0.0006621964,0.00035981843,0.0003103724,0.0000034974112,0.00016477468,0.0007598815],"genre_scores_gemma":[0.14321035,0.00014957876,0.8552279,0.0011202476,0.00019361108,0.000004790547,0.000012205489,0.000030092471,0.000051229257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996526,0.00024484203,0.0007135447,0.0011674147,0.00080509076,0.0005431131],"domain_scores_gemma":[0.99601823,0.0014388938,0.0005278231,0.0014668993,0.00038716488,0.00016101704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001797082,0.00048964546,0.0006732019,0.001194097,0.0003496072,0.00037321227,0.003348559,0.00026266222,0.0000024649007],"category_scores_gemma":[0.00012381234,0.000440552,0.00013877975,0.0016584933,0.0014220676,0.00034742436,0.0012966839,0.00087455777,0.0000029554571],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049362734,0.00006130121,0.000050238632,0.00006600197,0.000015966185,0.000014213221,0.001863754,0.076321855,0.000021603557,0.06993107,0.00016276276,0.8514863],"study_design_scores_gemma":[0.00016427158,0.00013464014,0.0006174281,0.00032557984,0.0000055574183,0.00004795428,2.6471355e-7,0.50723535,0.000091549984,0.49088234,0.00020706785,0.00028797405],"about_ca_topic_score_codex":0.000011870302,"about_ca_topic_score_gemma":0.000007147835,"teacher_disagreement_score":0.8511983,"about_ca_system_score_codex":0.0000884734,"about_ca_system_score_gemma":0.000709561,"threshold_uncertainty_score":0.9998046},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006159745,0.00085030013,0.9921567,0.0006332013,0.0024366807,0.0003306437,0.000008449382,0.00023065304,0.0027374094],"genre_scores_gemma":[0.3813571,0.00019469815,0.6115982,0.003501745,0.0020668174,0.000020991632,0.000022679927,0.000111634676,0.0011261321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995782,0.00005066294,0.00059390196,0.0015960088,0.0012457772,0.0007316479],"domain_scores_gemma":[0.99776584,0.00042187914,0.0003998416,0.0010835996,0.00014014912,0.00018870861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008608002,0.0005215601,0.00051102374,0.0011138981,0.0005677792,0.0006090562,0.003677381,0.00018176727,0.00007062654],"category_scores_gemma":[0.00006181327,0.0005005038,0.0001618987,0.001100024,0.0003722492,0.0008198206,0.002668751,0.00083571067,0.000029361949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000086850905,0.000038566282,0.000024532066,0.000039365757,0.000015225635,0.00021982215,0.0011828264,0.15381487,0.0003143559,0.08217392,0.0000255067,0.7621423],"study_design_scores_gemma":[0.00024426763,0.00012707296,0.00005490551,0.0001374818,0.000008567602,0.00013077068,1.792404e-7,0.91250587,0.0003872833,0.081165716,0.0045608133,0.00067710294],"about_ca_topic_score_codex":0.00012118066,"about_ca_topic_score_gemma":0.000049976767,"teacher_disagreement_score":0.7614652,"about_ca_system_score_codex":0.0006366169,"about_ca_system_score_gemma":0.0009022221,"threshold_uncertainty_score":0.99974465},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030895096,0.0010410842,0.9914983,0.00030873696,0.0007337623,0.003375692,0.000008471003,0.00025194898,0.0027789115],"genre_scores_gemma":[0.008347908,0.00035997512,0.9795219,0.002700857,0.00076659984,0.00313649,0.00007481525,0.000061873754,0.0050296295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961886,0.00006965764,0.00059139926,0.0016090843,0.00077167695,0.00076960423],"domain_scores_gemma":[0.9951756,0.00057480315,0.0003916015,0.003454461,0.00024132336,0.000162219],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009493862,0.0004590752,0.00042635112,0.00072861515,0.00043096763,0.0005688281,0.007281035,0.00023580284,0.000016831105],"category_scores_gemma":[0.00003226952,0.00047101965,0.00016514678,0.001466546,0.0003423265,0.00047346548,0.0019583174,0.00050527556,0.00010472265],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012895416,0.00007302307,0.0000065114427,0.00006653906,0.0000109918365,0.0000035749727,0.00019653437,0.13121367,0.00000660602,0.004485214,0.0036577105,0.86027837],"study_design_scores_gemma":[0.0002465171,0.00016650844,0.000009203085,0.0001052617,0.000010737438,0.0000057399525,9.866327e-8,0.6997128,0.00012391829,0.042340998,0.25682795,0.00045026],"about_ca_topic_score_codex":0.000005810176,"about_ca_topic_score_gemma":0.000020088042,"teacher_disagreement_score":0.85982805,"about_ca_system_score_codex":0.0011011268,"about_ca_system_score_gemma":0.0005064208,"threshold_uncertainty_score":0.99977416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070554006,0.00013140959,0.99200857,0.00088238437,0.00475199,0.00056570023,0.0000028546037,0.0002058594,0.0007457095],"genre_scores_gemma":[0.2233582,0.000013123354,0.77426213,0.0012209717,0.0008614874,0.00005854062,0.000041655254,0.000028721022,0.00015515136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962232,0.00008494182,0.0011862497,0.00087927416,0.00090576865,0.0007205455],"domain_scores_gemma":[0.99723184,0.0002812031,0.00062871625,0.0011903966,0.0005115759,0.00015628352],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014931187,0.0004518943,0.00046385342,0.002065019,0.00030439123,0.0015393448,0.003847784,0.00047882952,0.000016839855],"category_scores_gemma":[0.00024379982,0.0004583558,0.00016270683,0.0024256173,0.0005949413,0.003666855,0.0011276985,0.0015715003,0.00013029804],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020057003,0.000095343814,0.00009793205,0.00011748858,0.0000016956269,0.000007162732,0.0040828185,0.02096676,0.000039844123,0.0008337373,0.00006831823,0.9736869],"study_design_scores_gemma":[0.00011774708,0.00012322995,0.0014530008,0.0014176128,0.000005302154,0.000058141894,0.0000020253692,0.94046575,0.0007172657,0.05386024,0.0011678216,0.00061183725],"about_ca_topic_score_codex":0.000087816996,"about_ca_topic_score_gemma":0.00089673826,"teacher_disagreement_score":0.97307503,"about_ca_system_score_codex":0.0009051364,"about_ca_system_score_gemma":0.0023471415,"threshold_uncertainty_score":0.9997868},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005016439,0.000017592374,0.9393261,0.0005635842,0.0024097322,0.0005408345,0.000004848084,0.00025280722,0.056834314],"genre_scores_gemma":[0.023088925,0.00001680042,0.96850294,0.0069137206,0.0004398462,0.000037939677,0.000046085388,0.000016900529,0.0009368287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968332,0.000037071877,0.0006697493,0.0006647723,0.001159953,0.0006352584],"domain_scores_gemma":[0.9974067,0.00018206543,0.00030429562,0.0017520759,0.00019728455,0.00015754903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012459878,0.00041379256,0.0003502898,0.0012267309,0.0002833156,0.0010366339,0.0040145335,0.0003327487,0.000026045927],"category_scores_gemma":[0.00006505045,0.00036190287,0.000119528755,0.0011515747,0.0004764514,0.0023300622,0.0017339505,0.0012320302,0.00028915217],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026614987,0.000016047388,0.000011141581,0.00009900807,0.0000055151645,0.000020741847,0.0013478238,0.0067087743,0.00000870895,0.01260595,0.00040174683,0.97877187],"study_design_scores_gemma":[0.00060932175,0.00012057266,0.000800175,0.00020528476,0.000009343102,0.000083248684,3.0461663e-7,0.5277448,0.00046507595,0.2465901,0.22233723,0.0010345313],"about_ca_topic_score_codex":0.0000059727204,"about_ca_topic_score_gemma":0.00006223406,"teacher_disagreement_score":0.97773737,"about_ca_system_score_codex":0.00036217534,"about_ca_system_score_gemma":0.000797179,"threshold_uncertainty_score":0.9998833},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007767281,0.002490257,0.9940889,0.00002594087,0.00089230994,0.0002494586,0.0000027976828,0.00014790686,0.0020946462],"genre_scores_gemma":[0.47443914,0.0010362623,0.51625174,0.00051694346,0.00553198,0.000111921014,0.000056134,0.00025131475,0.0018045838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900305,0.000006155978,0.0002168398,0.00027021123,0.00020643645,0.00029727782],"domain_scores_gemma":[0.9993971,0.00009687561,0.00003745258,0.00033758,0.000036918966,0.00009409356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000191776,0.00019851117,0.00021578057,0.00021523074,0.00006349613,0.00012718278,0.00036906154,0.00016162697,0.0000034531063],"category_scores_gemma":[0.0000052658397,0.0001827261,0.000025447385,0.00025367303,0.00016522928,0.00007058485,0.00012595324,0.00030269264,0.000029099576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.467898e-8,0.000004083978,0.00002170546,0.00008557507,0.000004343483,0.0000013280052,0.00011549716,0.8207121,0.000033899927,0.000562597,0.00005794344,0.17840086],"study_design_scores_gemma":[0.000034246288,0.0000110305,0.000044688495,0.00016479622,0.000007832846,0.000024339199,1.1013386e-7,0.98397124,0.00028873127,0.0062619955,0.008902284,0.00028869897],"about_ca_topic_score_codex":0.0000017467859,"about_ca_topic_score_gemma":0.000006109555,"teacher_disagreement_score":0.47783718,"about_ca_system_score_codex":0.00016222929,"about_ca_system_score_gemma":0.00007267904,"threshold_uncertainty_score":0.7451354},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002794316,0.00031704444,0.9542407,0.0008454745,0.0070041455,0.0004425916,0.000036401958,0.00014625926,0.03668797],"genre_scores_gemma":[0.20298386,0.000033625216,0.6821182,0.0070857294,0.0034326965,0.00002957086,0.00006878416,0.00012960516,0.10411798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9823329,0.00013531628,0.0014594144,0.004480895,0.0102176815,0.0013738353],"domain_scores_gemma":[0.9906304,0.0031964972,0.00070044305,0.0035905824,0.001432957,0.0004491488],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.016308613,0.0006145375,0.00076263864,0.0046681096,0.0012677992,0.004801693,0.011653333,0.0002174732,0.0009172995],"category_scores_gemma":[0.0044040326,0.0004977767,0.00020455064,0.009728624,0.005468528,0.0012547186,0.0047856024,0.0008995905,0.0024341047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031776488,0.00006415275,0.000113857044,0.000008851346,0.000004234048,0.000050402585,0.00042013795,0.35740387,0.000009643837,0.0009916115,0.029540103,0.61138994],"study_design_scores_gemma":[0.00023129319,0.00007529606,0.00070823036,0.00014265031,0.00000730062,0.000043125492,0.0000011872924,0.8009103,0.000042774773,0.1546523,0.042604096,0.0005814596],"about_ca_topic_score_codex":0.000018517907,"about_ca_topic_score_gemma":0.000033572225,"teacher_disagreement_score":0.6108085,"about_ca_system_score_codex":0.0009445467,"about_ca_system_score_gemma":0.002419917,"threshold_uncertainty_score":0.999996},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026853933,0.0007229735,0.9863691,0.0018956955,0.0015177047,0.0007355591,0.000046760695,0.00010297452,0.008340739],"genre_scores_gemma":[0.2959874,0.00011102555,0.6539756,0.009554438,0.0047933757,0.00014382863,0.00011282604,0.000107591266,0.03521393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9880105,0.000074794836,0.0009993091,0.0034084395,0.006555441,0.0009515148],"domain_scores_gemma":[0.99289936,0.002730391,0.0004808559,0.0019223193,0.0015556337,0.00041141966],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.015210554,0.0004284639,0.00050516054,0.0029796476,0.0012129897,0.0031153315,0.0061416873,0.00015419314,0.000102845],"category_scores_gemma":[0.0027458859,0.00035491408,0.00007930264,0.0051703006,0.0030368129,0.0010664451,0.003691214,0.00057112705,0.00047443158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025802635,0.0000426368,0.00003461459,0.000010600198,0.000003313103,0.0000066025254,0.00021936155,0.15835343,0.000021538084,0.0048727104,0.004497381,0.8319352],"study_design_scores_gemma":[0.00017031502,0.00002954767,0.00048404103,0.00007273084,0.000007053318,0.00003399382,0.0000011846311,0.74842954,0.000047147914,0.099104285,0.15121523,0.00040492453],"about_ca_topic_score_codex":0.0000062501153,"about_ca_topic_score_gemma":0.000055847864,"teacher_disagreement_score":0.8315303,"about_ca_system_score_codex":0.0007322654,"about_ca_system_score_gemma":0.0034141096,"threshold_uncertainty_score":0.99989027},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024567335,0.0008108811,0.98630685,0.0013922916,0.0021399313,0.00074541173,0.000054401597,0.000099793026,0.008204786],"genre_scores_gemma":[0.4353556,0.000055739773,0.5274631,0.007147737,0.003664273,0.00016549921,0.00018046053,0.00012731213,0.025840314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9868759,0.0000922633,0.0009348488,0.0032458212,0.008065417,0.00078577216],"domain_scores_gemma":[0.9912157,0.0023261276,0.00048322807,0.0020131264,0.0034562366,0.00050557405],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.021493506,0.00041174164,0.000526578,0.0027819234,0.00092239166,0.003077709,0.0062367986,0.00015256777,0.00003828915],"category_scores_gemma":[0.004999624,0.00033323903,0.00006422828,0.0064707818,0.0031766873,0.0010116398,0.004460288,0.00053930643,0.00045087526],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000549827,0.00005982734,0.000071944516,0.000019405183,0.000005294113,0.00001503173,0.00058179826,0.15343714,0.000021841495,0.006950427,0.023246506,0.8155853],"study_design_scores_gemma":[0.00018221245,0.00004764624,0.00023290656,0.000063301806,0.0000065960844,0.000031495158,0.0000019473184,0.6388074,0.00002413987,0.28076473,0.07947733,0.0003602365],"about_ca_topic_score_codex":0.000010008985,"about_ca_topic_score_gemma":0.00002765055,"teacher_disagreement_score":0.81522506,"about_ca_system_score_codex":0.00077257183,"about_ca_system_score_gemma":0.005348456,"threshold_uncertainty_score":0.99991196},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007767281,0.002490257,0.9940889,0.00002594087,0.00089230994,0.0002494586,0.0000027976828,0.00014790686,0.0020946462],"genre_scores_gemma":[0.47443914,0.0010362623,0.51625174,0.00051694346,0.00553198,0.000111921014,0.000056134,0.00025131475,0.0018045838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900305,0.000006155978,0.0002168398,0.00027021123,0.00020643645,0.00029727782],"domain_scores_gemma":[0.9993971,0.00009687561,0.00003745258,0.00033758,0.000036918966,0.00009409356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000191776,0.00019851117,0.00021578057,0.00021523074,0.00006349613,0.00012718278,0.00036906154,0.00016162697,0.0000034531063],"category_scores_gemma":[0.0000052658397,0.0001827261,0.000025447385,0.00025367303,0.00016522928,0.00007058485,0.00012595324,0.00030269264,0.000029099576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.467898e-8,0.000004083978,0.00002170546,0.00008557507,0.000004343483,0.0000013280052,0.00011549716,0.8207121,0.000033899927,0.000562597,0.00005794344,0.17840086],"study_design_scores_gemma":[0.000034246288,0.0000110305,0.000044688495,0.00016479622,0.000007832846,0.000024339199,1.1013386e-7,0.98397124,0.00028873127,0.0062619955,0.008902284,0.00028869897],"about_ca_topic_score_codex":0.0000017467859,"about_ca_topic_score_gemma":0.000006109555,"teacher_disagreement_score":0.47783718,"about_ca_system_score_codex":0.00016222929,"about_ca_system_score_gemma":0.00007267904,"threshold_uncertainty_score":0.7451354},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068797475,0.00028632878,0.9887768,0.000266989,0.006143159,0.00028910738,0.000012514531,0.00025089257,0.0039054381],"genre_scores_gemma":[0.10505139,0.00021469769,0.8766607,0.0071612974,0.008535579,0.000053839627,0.00014646976,0.00019095938,0.001985062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99538326,0.000078395875,0.0005369316,0.0017856235,0.0013651022,0.00085070526],"domain_scores_gemma":[0.99702597,0.00038670423,0.00023935335,0.0020048223,0.00011732748,0.00022584651],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007277408,0.00056087045,0.0005723578,0.00064480834,0.0003779347,0.0011221953,0.005392548,0.0003693524,0.000051801006],"category_scores_gemma":[0.000026629312,0.00049539725,0.00013016332,0.00086622057,0.00036697375,0.0011419988,0.0024535013,0.0011243997,0.00015457299],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030993815,0.00004741596,0.000014675851,0.000026187545,0.0000051358143,0.00013635751,0.00051099644,0.0073435465,0.000017608027,0.0020250191,0.0005344207,0.98933554],"study_design_scores_gemma":[0.0005607467,0.00016497992,0.00012666086,0.0006403529,0.000006169409,0.00009577671,7.820548e-8,0.50576144,0.00028904187,0.47764525,0.013725191,0.0009843404],"about_ca_topic_score_codex":0.0000788182,"about_ca_topic_score_gemma":0.00001277515,"teacher_disagreement_score":0.9883512,"about_ca_system_score_codex":0.00039483467,"about_ca_system_score_gemma":0.0011383167,"threshold_uncertainty_score":0.99998873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003661544,0.00038596138,0.9896198,0.0006597397,0.0027113957,0.00034092367,0.000002569485,0.00026213247,0.005980896],"genre_scores_gemma":[0.046404846,0.00007128942,0.9324038,0.0008513027,0.0031306902,0.00011935975,0.000029449453,0.00006674188,0.0169225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966454,0.00005489682,0.00042530926,0.0013761704,0.00086427445,0.00063394365],"domain_scores_gemma":[0.9975468,0.00043512124,0.0002584803,0.00131575,0.00025927756,0.0001845897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083476066,0.00037537742,0.000377483,0.0005616661,0.000524626,0.00077866676,0.0036592192,0.00043524458,0.000009188427],"category_scores_gemma":[0.00007636716,0.00034529128,0.0000978562,0.0011720258,0.0005724902,0.0005810661,0.0011281279,0.0019871956,0.00012489781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015042237,0.00009163483,0.00012689369,0.00007022374,0.000013435542,0.00006391426,0.0008027335,0.19418833,0.0004644153,0.06282383,0.0010544535,0.7402986],"study_design_scores_gemma":[0.000111958405,0.000074958174,0.0001662566,0.00012859177,0.000003408523,0.00009289195,1.7614414e-7,0.9155546,0.00007635889,0.037000623,0.046339963,0.00045022706],"about_ca_topic_score_codex":0.000023974973,"about_ca_topic_score_gemma":0.000019060977,"teacher_disagreement_score":0.7398484,"about_ca_system_score_codex":0.00033281557,"about_ca_system_score_gemma":0.0014345814,"threshold_uncertainty_score":0.9998999},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007103304,0.00021778936,0.99568963,0.00093152706,0.0014962516,0.0004318733,0.0000035869616,0.0001335326,0.00038546883],"genre_scores_gemma":[0.83297485,0.00029403664,0.15183179,0.0091177765,0.0051218397,0.00015920926,0.000102553386,0.00009652802,0.0003013979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658287,0.00007125872,0.0005889986,0.0014049265,0.00057866256,0.00077330536],"domain_scores_gemma":[0.99816084,0.00039440303,0.00022922849,0.00096465094,0.000110752975,0.00014013407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041567965,0.0004043275,0.00041117234,0.00056255405,0.00024039914,0.00039607173,0.0025056186,0.0003003831,0.00000682383],"category_scores_gemma":[0.000024946106,0.0003892673,0.00010605285,0.0017465539,0.000397164,0.0005351635,0.0007776782,0.0011383246,0.000033232824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014311288,0.000031471936,0.00007313517,0.0000053453164,0.0000011797963,0.00007540548,0.00011459144,0.16004774,0.0000065020604,0.00009287169,0.00016076153,0.83938956],"study_design_scores_gemma":[0.00009195285,0.000061513245,0.00037707883,0.00013118461,0.0000019439294,0.00007760452,3.235448e-8,0.96975875,0.00007332381,0.028680436,0.00031252386,0.0004336668],"about_ca_topic_score_codex":0.00004214469,"about_ca_topic_score_gemma":0.00033682134,"teacher_disagreement_score":0.8438578,"about_ca_system_score_codex":0.0002806513,"about_ca_system_score_gemma":0.00033169682,"threshold_uncertainty_score":0.99985594},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013324457,0.00013315427,0.9945317,0.000013761537,0.0011519585,0.00013919374,0.000013223571,0.00011849911,0.002566067],"genre_scores_gemma":[0.8621639,0.00029461333,0.12738432,0.00036776043,0.0071288245,0.000051386625,0.00006366469,0.00017519544,0.002370338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988978,0.00001936088,0.0002261002,0.00038393014,0.00025574936,0.00021706724],"domain_scores_gemma":[0.9994024,0.00016560714,0.000053475225,0.00024596284,0.00007224491,0.000060313432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040274378,0.00018544117,0.0002968888,0.00092029205,0.00006670164,0.00015453513,0.00016066698,0.0002471578,0.00002804505],"category_scores_gemma":[0.000039248025,0.00014473997,0.00007225277,0.0008090228,0.00012920522,0.00016927131,0.000061592014,0.00027019277,0.00003628853],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023398563,0.0000017633199,0.0000229191,0.000030644886,0.00003472694,0.000008613278,0.0000879741,0.0023678532,0.0009831714,0.0000014851895,0.00011466652,0.99634385],"study_design_scores_gemma":[0.001087359,0.00028112627,0.0010983855,0.0014433207,0.00034692476,0.00010171565,4.840592e-7,0.92741907,0.021046996,0.038045816,0.007123129,0.0020056665],"about_ca_topic_score_codex":0.000013721688,"about_ca_topic_score_gemma":0.000039868206,"teacher_disagreement_score":0.99433815,"about_ca_system_score_codex":0.00020233075,"about_ca_system_score_gemma":0.00006331219,"threshold_uncertainty_score":0.5902325},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006752695,0.0006545093,0.9936905,0.00096726016,0.0010579616,0.00032483292,0.000008081453,0.00020670255,0.002414904],"genre_scores_gemma":[0.80236083,0.000097065684,0.19561215,0.0014017898,0.0004373756,0.0000089604555,0.0000126428195,0.00003261078,0.00003654905],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974991,0.00006033057,0.00043011265,0.0009320868,0.00047994335,0.00059843366],"domain_scores_gemma":[0.99810183,0.00032918376,0.00021880986,0.0010308555,0.00010103884,0.00021828014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011352901,0.0004890161,0.00044028895,0.00069989084,0.00037239658,0.00030070083,0.0017174745,0.00023978276,0.000015270716],"category_scores_gemma":[0.000023543336,0.00040705176,0.00014566934,0.0005977566,0.0012416474,0.000965885,0.00060703454,0.0006710957,0.000014254156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000134921,0.000021801634,0.00005112006,0.000041306303,0.000010829066,0.000004893114,0.005428662,0.00027709015,0.00003342271,0.33073238,0.0000030892054,0.66338193],"study_design_scores_gemma":[0.00047098577,0.00020606775,0.0006459912,0.00045035503,0.000013394825,0.000083497136,0.0000014546596,0.17181389,0.00080628676,0.8133068,0.011206415,0.0009948432],"about_ca_topic_score_codex":0.000013859737,"about_ca_topic_score_gemma":0.00006113047,"teacher_disagreement_score":0.8016856,"about_ca_system_score_codex":0.00009067022,"about_ca_system_score_gemma":0.00012328076,"threshold_uncertainty_score":0.9998381},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016881531,0.0011478722,0.97730577,0.0011286273,0.0011867026,0.0008362258,0.000017397411,0.00014940093,0.0013464573],"genre_scores_gemma":[0.92741597,0.0002915084,0.06333719,0.005497812,0.0025025122,0.00006935997,0.00019460595,0.00015826788,0.0005327497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969075,0.00009154853,0.00032509433,0.0013545686,0.0005034724,0.00081782],"domain_scores_gemma":[0.9981158,0.000685747,0.00017058678,0.0006544276,0.0001439697,0.00022949136],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00031962318,0.00054611225,0.001059364,0.0004698531,0.00047073723,0.000057018166,0.00034489215,0.0004290081,0.00007551769],"category_scores_gemma":[0.00017558904,0.00052865833,0.0003062077,0.00056657684,0.0007271513,0.0000783171,0.00047841232,0.0029212905,0.000022804232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041223477,0.000042577,0.0003500433,0.000116847135,0.00011537287,0.00036505473,0.0004238358,0.22489375,0.004555415,0.011011346,0.000011330856,0.7577022],"study_design_scores_gemma":[0.0018456115,0.0125125,0.0038820188,0.0011735365,0.00047130592,0.0006279698,0.0000045448323,0.74527454,0.0032510601,0.21390618,0.01355144,0.0034992867],"about_ca_topic_score_codex":0.000021200944,"about_ca_topic_score_gemma":0.000014824912,"teacher_disagreement_score":0.9139686,"about_ca_system_score_codex":0.0005045749,"about_ca_system_score_gemma":0.00039956445,"threshold_uncertainty_score":0.9997165},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019727342,0.0015537986,0.9773932,0.002026383,0.008428822,0.003103421,0.000016792033,0.0000957973,0.005409012],"genre_scores_gemma":[0.036727816,0.0005380351,0.9546393,0.0014544151,0.002770098,0.00010469731,0.000022872287,0.0001224331,0.003620287],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980873,0.000017334958,0.00038584977,0.0004960854,0.00069555367,0.00031787629],"domain_scores_gemma":[0.9975999,0.0014161083,0.00018662211,0.0005433148,0.00019147787,0.000062564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048737344,0.00023050599,0.00032190993,0.0003096621,0.00037308555,0.00008508739,0.00035015115,0.00011873261,0.000018240113],"category_scores_gemma":[0.0004429043,0.0001502922,0.00016534666,0.0002106337,0.00033093494,0.000056115754,0.00023106935,0.0005068211,0.0000032144667],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044621327,0.000019262248,0.00010063026,0.00017963101,0.00001907914,0.000011667488,0.001117961,0.0035300925,0.00009101339,0.00050252985,0.00006877298,0.99431473],"study_design_scores_gemma":[0.0026238111,0.005513457,0.0011920936,0.0042517814,0.00020687071,0.00036150607,0.000031879572,0.42917505,0.0029043178,0.05345037,0.49861926,0.0016696041],"about_ca_topic_score_codex":0.000012205084,"about_ca_topic_score_gemma":0.0000049560795,"teacher_disagreement_score":0.99264514,"about_ca_system_score_codex":0.00035710513,"about_ca_system_score_gemma":0.00047127655,"threshold_uncertainty_score":0.6128738},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012976598,0.00014209618,0.9939687,0.0008829475,0.0015235671,0.00034956855,0.000005990605,0.00016326325,0.0028340598],"genre_scores_gemma":[0.1674973,0.000027923646,0.8269061,0.004167161,0.0006584417,0.00002573909,0.000034613866,0.00006117219,0.00062156137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571717,0.00006380611,0.00045103393,0.0017411022,0.0013239576,0.00070292846],"domain_scores_gemma":[0.9976893,0.00064923766,0.0002852152,0.0009952805,0.00019227967,0.00018866207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010302089,0.00053617154,0.0004333248,0.0010152924,0.00052697724,0.0004986553,0.002201342,0.00016048457,0.0000591345],"category_scores_gemma":[0.00005237946,0.0004696516,0.00012267487,0.0010146467,0.0004104052,0.00044469818,0.0011862625,0.0009847546,0.000034822755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007572042,0.000020491343,0.0000075011035,0.0000069490675,0.000008940197,0.00008709739,0.00024529896,0.40933752,0.000009315174,0.022912333,0.000008571272,0.5673484],"study_design_scores_gemma":[0.00042228418,0.00088557403,0.00010627115,0.0002006223,0.000011133953,0.00014418924,6.638285e-7,0.95907676,0.00086001237,0.030598154,0.0067988103,0.00089552766],"about_ca_topic_score_codex":0.000032342,"about_ca_topic_score_gemma":0.00006991497,"teacher_disagreement_score":0.56645286,"about_ca_system_score_codex":0.00048314524,"about_ca_system_score_gemma":0.00061184354,"threshold_uncertainty_score":0.9997755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009454603,0.00010787766,0.99464315,0.00008104522,0.0027887446,0.0014963376,0.00001027964,0.00024664577,0.0005314013],"genre_scores_gemma":[0.09253021,0.000009039074,0.90653163,0.00009103831,0.0005339066,0.00007638903,0.000024674853,0.000070543414,0.00013254244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99423987,0.00016228457,0.0007834115,0.0018467447,0.0022529908,0.00071468385],"domain_scores_gemma":[0.9954413,0.0014637087,0.00069162215,0.0013927693,0.00087352353,0.00013707137],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0051788497,0.0005816419,0.0007632365,0.0012360107,0.00029555254,0.00022295657,0.0036186234,0.00045576575,0.000009808125],"category_scores_gemma":[0.0017705329,0.00055771536,0.00025664648,0.0009377037,0.00064732856,0.0005518764,0.0014557997,0.00075309566,0.000007662185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014791413,0.000024996298,0.000029838708,0.00006944708,0.000024591956,0.0000029678254,0.0008584457,0.62946564,0.0001219754,0.0049694288,0.000003909718,0.36441398],"study_design_scores_gemma":[0.0014962085,0.00013380684,0.00013010697,0.00016522856,0.00005364734,0.00000764874,8.7236907e-7,0.96120805,0.00061680033,0.035576217,0.00007873745,0.00053269934],"about_ca_topic_score_codex":0.00006479374,"about_ca_topic_score_gemma":0.000064053354,"teacher_disagreement_score":0.36388126,"about_ca_system_score_codex":0.00049342104,"about_ca_system_score_gemma":0.0011815038,"threshold_uncertainty_score":0.99968743},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029909465,0.00022415916,0.99519783,0.00052310416,0.0015219527,0.00041974662,0.000030056726,0.00013735684,0.0019158748],"genre_scores_gemma":[0.023963371,0.000024034638,0.9744505,0.001122976,0.00014629518,0.000026708864,0.00008319901,0.000038054346,0.00014484112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966589,0.00007345947,0.0006031202,0.0013411866,0.0008252599,0.000498048],"domain_scores_gemma":[0.99782664,0.00037952827,0.00033981798,0.0012154545,0.00013098409,0.000107591244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062791735,0.00042843664,0.00046023712,0.0011560454,0.00022141405,0.00020519875,0.0016879031,0.00016250872,0.00015634754],"category_scores_gemma":[0.00008337151,0.00042881348,0.00009334034,0.0008306011,0.00031776223,0.0011831534,0.0011831309,0.00072375056,0.000019606896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005343779,0.00002061193,0.0001831892,0.00003074556,0.0000027584808,0.000082288905,0.0003330321,0.92933017,0.00002221795,0.0238842,0.000011500169,0.046093952],"study_design_scores_gemma":[0.00025273595,0.00007669576,0.000070505754,0.00028996973,0.0000021939109,0.000021932277,4.016693e-7,0.9859295,0.00006887488,0.009680703,0.0031292255,0.00047727986],"about_ca_topic_score_codex":0.00010442521,"about_ca_topic_score_gemma":0.00023396745,"teacher_disagreement_score":0.056599323,"about_ca_system_score_codex":0.0005028851,"about_ca_system_score_gemma":0.00067561644,"threshold_uncertainty_score":0.99981636},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030972966,0.00050944963,0.98988664,0.0007250376,0.006794444,0.000564411,0.000011337274,0.0003239953,0.00087498303],"genre_scores_gemma":[0.14506288,0.000011888542,0.85125566,0.0015552437,0.0017847229,0.000018066738,0.0000094884335,0.00013323977,0.00016879427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99143755,0.00021621569,0.0010670979,0.0030560137,0.0027564124,0.0014666921],"domain_scores_gemma":[0.9928582,0.002484458,0.00082319905,0.003224502,0.00025589365,0.00035377438],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0028372342,0.0010720905,0.0010966198,0.0016656107,0.0015620621,0.0013761213,0.0089883255,0.0006247129,0.00017248966],"category_scores_gemma":[0.0019889942,0.0011200602,0.00029211678,0.0012931704,0.000695841,0.0015274383,0.008060756,0.0038559576,0.000018190882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010419016,0.000017304494,0.000015421036,0.000021348085,0.00001823943,0.0001910435,0.003946075,0.7844244,0.00008130148,0.017593743,0.000008386634,0.19367231],"study_design_scores_gemma":[0.00035529034,0.00013893099,0.0000073726155,0.00091972837,0.00002363186,0.00018920275,0.00000481581,0.867369,0.000063048814,0.12935215,0.00051752996,0.0010593251],"about_ca_topic_score_codex":0.00007030585,"about_ca_topic_score_gemma":0.00003999713,"teacher_disagreement_score":0.19261299,"about_ca_system_score_codex":0.0017687796,"about_ca_system_score_gemma":0.0014355481,"threshold_uncertainty_score":0.99996185},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034435605,0.00003130587,0.99511915,0.0010028862,0.0012383823,0.0003492895,0.000008909451,0.00023501091,0.0019806013],"genre_scores_gemma":[0.4782122,0.000053788808,0.5092036,0.0103178155,0.000652962,0.000059570906,0.000366935,0.0001073364,0.0010257377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962972,0.00009607899,0.00038326575,0.0014045059,0.0013521225,0.00046682908],"domain_scores_gemma":[0.9981297,0.0004829102,0.0003206349,0.0008213714,0.00012309419,0.0001222605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075209746,0.00041679645,0.00029928057,0.0006478602,0.00064755825,0.00037564087,0.0014038912,0.00012126843,0.00008836564],"category_scores_gemma":[0.00011960086,0.000406615,0.000112115755,0.0006436691,0.00019313236,0.0006871058,0.0005070689,0.0011800235,0.000053239874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008859125,0.000021370437,0.000020405287,0.0000073297974,0.0000014227649,0.000014087031,0.00008552539,0.4052841,0.00017081975,0.0051268274,0.000008848497,0.5892504],"study_design_scores_gemma":[0.00033896815,0.0004607182,0.0001585605,0.0002062045,0.000003527899,0.000008746853,2.584907e-7,0.97699624,0.0010298738,0.013178285,0.0071885185,0.00043009425],"about_ca_topic_score_codex":0.000006828523,"about_ca_topic_score_gemma":0.0000029911903,"teacher_disagreement_score":0.5888203,"about_ca_system_score_codex":0.000891236,"about_ca_system_score_gemma":0.00020596791,"threshold_uncertainty_score":0.9998386},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054066663,0.0001535353,0.9957497,0.00067234354,0.0002133434,0.00047209335,0.0000044771464,0.00013368986,0.002060136],"genre_scores_gemma":[0.1717564,0.00008245057,0.8257685,0.002050003,0.0001615792,0.000022843386,0.000009480564,0.000060775004,0.00008799866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820226,0.000009180246,0.00030591319,0.00076150615,0.00039559897,0.00032554593],"domain_scores_gemma":[0.99908274,0.000104775245,0.00012557223,0.0005692466,0.0000393033,0.00007835366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022637703,0.00025018142,0.00033775475,0.00089919363,0.00013415648,0.000038330483,0.00041511096,0.00009858648,0.000061656414],"category_scores_gemma":[0.000022085367,0.00025342702,0.00009259868,0.000552969,0.00034298294,0.00012181511,0.00035078524,0.0009790197,0.0000012774163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005390413,0.00011885398,0.002589719,0.0001796101,0.0000139874755,0.00059005315,0.0009364227,0.5798075,0.0032779605,0.0032364223,0.000023486184,0.40917206],"study_design_scores_gemma":[0.00038984822,0.00017671296,0.0006958586,0.0005987764,0.000021913746,0.00037429048,6.495192e-7,0.95215774,0.00045370453,0.03815806,0.0064847786,0.00048764973],"about_ca_topic_score_codex":0.000043427164,"about_ca_topic_score_gemma":0.000036174264,"teacher_disagreement_score":0.4086844,"about_ca_system_score_codex":0.0003157902,"about_ca_system_score_gemma":0.00018541422,"threshold_uncertainty_score":0.9999918},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7574513,0.0031720833,0.07092213,0.014053801,0.011920686,0.004533057,0.00006211125,0.00033961522,0.1375452],"genre_scores_gemma":[0.9968392,0.00025206004,0.001961016,0.00022621466,0.00062894047,0.000017619846,0.0000012135353,0.00001842498,0.000055261862],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738044,0.00008237115,0.00040240044,0.0004903446,0.0012586188,0.00038582933],"domain_scores_gemma":[0.9979524,0.0010399508,0.00027008005,0.00030386567,0.00038092126,0.000052773918],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0020170163,0.00019480733,0.0002997762,0.00045777968,0.0014618809,0.00051810493,0.0012340103,0.00015342278,0.000074947224],"category_scores_gemma":[0.0014330082,0.00017181513,0.000054989043,0.0011554098,0.0009398288,0.0010637679,0.00046108442,0.0007851639,0.0000012101784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008357827,0.000085688,0.0010977362,0.00017847175,0.000023842074,0.00007188277,0.27941462,0.062560506,0.00048326777,0.25255528,0.0000063597713,0.40343878],"study_design_scores_gemma":[0.00027937745,0.000113111586,0.00091915944,0.0011406995,0.00001379539,0.0000017695157,0.0005691845,0.0011573586,0.00068905554,0.98851836,0.0060234466,0.0005746987],"about_ca_topic_score_codex":0.00068377604,"about_ca_topic_score_gemma":0.01522964,"teacher_disagreement_score":0.73596305,"about_ca_system_score_codex":0.00044890124,"about_ca_system_score_gemma":0.0011588365,"threshold_uncertainty_score":0.99983805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022392231,0.00039145895,0.99388343,0.00096867024,0.0012668564,0.00044689688,0.0000034852583,0.00017685806,0.0026384399],"genre_scores_gemma":[0.4264969,0.000055928045,0.56988597,0.0022227217,0.0009159318,0.00007468013,0.000005903555,0.00007658455,0.00026539867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624085,0.000073209936,0.00039717855,0.0013777828,0.0012537692,0.00065717945],"domain_scores_gemma":[0.9974792,0.0005936114,0.00028322544,0.0013553202,0.00016402155,0.00012459814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008553989,0.00049818965,0.00037272394,0.00067015557,0.0012484966,0.0009105302,0.003470358,0.0001900175,0.000056001452],"category_scores_gemma":[0.00003101826,0.00032960923,0.00015018399,0.0013567938,0.0006550301,0.0006377565,0.0014310998,0.0015672464,0.000008091196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048484985,0.000019662053,0.000060078222,0.000012396075,0.000018544642,0.00008462914,0.0008592932,0.019730046,0.00004634652,0.006812988,0.0000051615584,0.972346],"study_design_scores_gemma":[0.0005747143,0.0010287616,0.0010825201,0.00026159146,0.000034052795,0.0007753345,0.0000032876662,0.9272463,0.0033093267,0.05943454,0.00484916,0.0014004513],"about_ca_topic_score_codex":0.000117609496,"about_ca_topic_score_gemma":0.00082363863,"teacher_disagreement_score":0.97094554,"about_ca_system_score_codex":0.00015687839,"about_ca_system_score_gemma":0.00037016053,"threshold_uncertainty_score":0.9999156},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012995084,0.00028752122,0.99532723,0.0007164101,0.0020562068,0.00041559807,0.000004240256,0.00015044323,0.000912421],"genre_scores_gemma":[0.3690705,0.000076719436,0.62877816,0.0014987619,0.00025529834,0.000029721072,0.0000038077224,0.000039472758,0.00024757572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967588,0.000103843144,0.0004137247,0.0015115738,0.00073246716,0.00047955097],"domain_scores_gemma":[0.99750084,0.00096767925,0.0001974265,0.0010589899,0.00012312835,0.00015192835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011411669,0.00042827654,0.00040482334,0.00063377764,0.0003462476,0.0006039859,0.0022579508,0.0001880995,0.00012331447],"category_scores_gemma":[0.00014130474,0.00042111878,0.00008040622,0.00036707654,0.000529065,0.00095317216,0.0016520437,0.0010489463,0.000037827387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036460224,0.000065797336,0.000040120834,0.000053149786,0.000018159406,0.00012588997,0.0019212872,0.122345135,0.000206732,0.033274498,0.000051160507,0.8418616],"study_design_scores_gemma":[0.00023273155,0.0003400868,0.000088051216,0.00011889344,0.000009131849,0.00015931223,4.328867e-7,0.846658,0.0007648864,0.14762469,0.0034083633,0.00059545704],"about_ca_topic_score_codex":0.000053422107,"about_ca_topic_score_gemma":0.000027994605,"teacher_disagreement_score":0.84126616,"about_ca_system_score_codex":0.00041652095,"about_ca_system_score_gemma":0.00034325168,"threshold_uncertainty_score":0.99982405},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018595927,0.00062146294,0.99250805,0.0019956543,0.001030458,0.0004271583,0.000007389628,0.00028448334,0.0029393784],"genre_scores_gemma":[0.084052585,0.000053958105,0.9097121,0.0045912806,0.0003670089,0.000050573723,0.00002521325,0.000080846025,0.0010664741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946661,0.00007641038,0.00062540005,0.002238423,0.0015172793,0.0008763607],"domain_scores_gemma":[0.99692965,0.00033735076,0.0006271975,0.0015516191,0.00034456546,0.00020963595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010968394,0.00069398375,0.00061430753,0.0007952779,0.0010245912,0.0010241456,0.003782519,0.00025814402,0.00008943636],"category_scores_gemma":[0.00008000759,0.00058716274,0.00008396087,0.0013468207,0.00089669746,0.0013581815,0.0012927979,0.0012872728,0.000023312763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010174739,0.00007582759,0.00009366252,0.000077992976,0.000014579035,0.00012491283,0.0011767078,0.037372258,0.0005074607,0.021511829,0.00002746931,0.9390071],"study_design_scores_gemma":[0.00071867096,0.00019330512,0.00016734334,0.0005828547,0.000015889009,0.0001033959,0.000001173047,0.96738595,0.00031719924,0.026527252,0.0029755437,0.0010114135],"about_ca_topic_score_codex":0.00006885637,"about_ca_topic_score_gemma":0.0000733683,"teacher_disagreement_score":0.93799573,"about_ca_system_score_codex":0.0007781036,"about_ca_system_score_gemma":0.0016409961,"threshold_uncertainty_score":0.999658},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058931066,0.00026522527,0.9895072,0.00195054,0.0046167662,0.0012202228,0.000014999244,0.00030267087,0.0020634173],"genre_scores_gemma":[0.32814497,0.000023163295,0.66854703,0.0008750527,0.0007728917,0.00032302106,0.00002041618,0.000078736404,0.0012147374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955393,0.000088380504,0.0008390646,0.0015899285,0.0012130307,0.00073031377],"domain_scores_gemma":[0.9963419,0.0011198919,0.00047320625,0.0014661,0.00039681423,0.00020212911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016739568,0.0005185182,0.0005662576,0.0008682262,0.0009968518,0.00054011337,0.0042846124,0.00024032578,0.00011611525],"category_scores_gemma":[0.000307073,0.0005052479,0.00023292078,0.0008331511,0.00051633775,0.00066512986,0.0013665771,0.00076636695,0.000058030957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068261606,0.000037251175,0.0000070286087,0.00012272864,0.00002484498,0.000034955538,0.020292405,0.116517305,0.0000741883,0.53836906,0.00011186585,0.32440153],"study_design_scores_gemma":[0.000057417543,0.00019732448,0.000004516375,0.00021464891,0.0000114647555,0.000027689366,0.000010512187,0.6965166,0.00079031166,0.29902536,0.0026240624,0.00052014145],"about_ca_topic_score_codex":0.000033474804,"about_ca_topic_score_gemma":0.00012062465,"teacher_disagreement_score":0.57999927,"about_ca_system_score_codex":0.00095817214,"about_ca_system_score_gemma":0.00079689285,"threshold_uncertainty_score":0.9997399},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011389756,0.00030873498,0.9875999,0.00848214,0.001605547,0.0009553263,0.000026158918,0.000638848,0.00026945013],"genre_scores_gemma":[0.068078384,0.000018316094,0.93003434,0.0014376191,0.00008659227,0.00009348552,0.00010320815,0.000056122997,0.00009191828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503857,0.00022588807,0.0007420102,0.0023233977,0.00075458933,0.00091554335],"domain_scores_gemma":[0.9941239,0.0018083281,0.000493774,0.0032322556,0.00024843856,0.00009335679],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0024411068,0.00061600166,0.00070234144,0.0016099944,0.0005712249,0.0005016194,0.017520627,0.00050116424,0.000029018303],"category_scores_gemma":[0.0070241704,0.0006429364,0.00013606793,0.0009712059,0.0006923626,0.0008307646,0.034341894,0.0020110104,0.000010495767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070329224,0.00015615077,0.0005553939,0.00019270083,0.00001199612,0.0003562823,0.0005252631,0.56340545,0.0005729892,0.0013330904,0.0024958444,0.43032452],"study_design_scores_gemma":[0.00089534046,0.00024208741,0.0002352592,0.00014583778,0.000005176095,0.000044126227,4.2961085e-7,0.9160091,0.00053038646,0.07896834,0.0022964098,0.00062749936],"about_ca_topic_score_codex":0.00003714868,"about_ca_topic_score_gemma":0.00014735386,"teacher_disagreement_score":0.42969704,"about_ca_system_score_codex":0.0009885988,"about_ca_system_score_gemma":0.00062466215,"threshold_uncertainty_score":0.9996022},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065765594,0.00022095302,0.99436134,0.00094811904,0.00058939116,0.0007652923,0.0000037927484,0.00017916254,0.0022742858],"genre_scores_gemma":[0.49729967,0.000008883276,0.5014739,0.000813862,0.00013666801,0.000036842288,0.000009791543,0.00003439711,0.0001859805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996669,0.00007220263,0.0004947395,0.001561406,0.0007107958,0.0004918533],"domain_scores_gemma":[0.9976104,0.00080164085,0.0003861313,0.0009729954,0.00007941149,0.00014946033],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011883508,0.00040881918,0.00042709458,0.0008104994,0.0007824057,0.0013944623,0.0033441836,0.000092587856,0.000081270155],"category_scores_gemma":[0.000087905915,0.0004218706,0.000053669744,0.00069347775,0.00025471553,0.0009874256,0.0060868203,0.0009498888,0.000014195252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040229866,0.00002053155,0.00017295823,0.00004814543,0.000009481935,0.00004746192,0.0019896268,0.14577377,0.0016613292,0.0045049866,0.0000037523364,0.8457639],"study_design_scores_gemma":[0.00030975402,0.00008074886,0.00060421036,0.00021978677,0.000008052276,0.000091182636,8.822569e-7,0.9885008,0.00020615188,0.0093055405,0.00021721056,0.0004556964],"about_ca_topic_score_codex":0.0004186618,"about_ca_topic_score_gemma":0.00027942285,"teacher_disagreement_score":0.84530824,"about_ca_system_score_codex":0.00031705806,"about_ca_system_score_gemma":0.00016691972,"threshold_uncertainty_score":0.99982333},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016621275,0.0022009031,0.97295445,0.006232278,0.0006912551,0.00084605085,0.00002150874,0.000024013672,0.00040824135],"genre_scores_gemma":[0.98951983,0.0006672294,0.008951404,0.0004710722,0.000301409,0.00003248081,0.000017298791,0.000022331706,0.000016937107],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737537,0.000029600686,0.00081798667,0.0006902402,0.0007520257,0.0003347666],"domain_scores_gemma":[0.99831766,0.00068070006,0.00025277882,0.00036342256,0.00021558818,0.00016983546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016900614,0.00021945644,0.0005751551,0.0010724474,0.000092007685,0.000029002575,0.00030496554,0.00023421214,0.00030732268],"category_scores_gemma":[0.00058481965,0.00019247613,0.00011989354,0.00060161314,0.000715844,0.000111328234,0.00014607629,0.000487267,0.0000019390848],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011838216,0.0001237861,0.0025332032,0.0004074402,0.00004732474,0.00002927984,0.0034581071,0.0013161693,0.00007958497,0.027428959,0.0000014745871,0.96445626],"study_design_scores_gemma":[0.00012234965,0.0014557759,0.005777178,0.0015618266,0.00033606493,0.00009203773,0.00011581436,0.35200295,0.010522222,0.6264238,0.00066818675,0.00092184066],"about_ca_topic_score_codex":0.0004911555,"about_ca_topic_score_gemma":0.0032087157,"teacher_disagreement_score":0.97289854,"about_ca_system_score_codex":0.00020624216,"about_ca_system_score_gemma":0.00067447266,"threshold_uncertainty_score":0.7848949},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048987307,0.00031999135,0.9920957,0.0000507711,0.0015609526,0.0007022234,0.000022621625,0.00029218002,0.00005683935],"genre_scores_gemma":[0.97601974,0.0000036254555,0.023380803,0.00021764946,0.00019208963,0.00002314202,0.000019450508,0.00008901879,0.000054498996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779296,0.0000112411735,0.00038433433,0.00080369523,0.0004912387,0.00051650155],"domain_scores_gemma":[0.9985328,0.0007234356,0.000117546304,0.00043749495,0.00008169441,0.00010703953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025387428,0.0004552329,0.00041433648,0.0004388657,0.0002809396,0.00006827724,0.00063857296,0.00014576637,0.000033908695],"category_scores_gemma":[0.000075679905,0.00045192512,0.00014196924,0.0002667035,0.00015880207,0.0001757318,0.0001621138,0.0006790574,0.0000048254087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016330532,0.000007673678,4.93639e-7,0.00015200692,0.0000050117455,0.000014141205,0.00009368021,0.922732,0.00064641034,0.00004374822,0.000001056208,0.07628743],"study_design_scores_gemma":[0.00030823302,0.00024526246,0.000003326193,0.00028522455,0.000012648097,0.000012880281,2.1426321e-7,0.98719835,0.0020298662,0.00908183,0.00032601188,0.0004961611],"about_ca_topic_score_codex":4.132233e-7,"about_ca_topic_score_gemma":0.0000046584983,"teacher_disagreement_score":0.971121,"about_ca_system_score_codex":0.00038226042,"about_ca_system_score_gemma":0.000120565775,"threshold_uncertainty_score":0.99979323},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044803964,0.00016224019,0.9907924,0.0005370605,0.001974649,0.00051776087,0.000009614199,0.000089718844,0.001436139],"genre_scores_gemma":[0.98873675,0.000014005457,0.009911272,0.00049077725,0.0004407403,0.00002195331,0.0000034806553,0.000049225877,0.00033179077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998071,0.000046897974,0.00034361976,0.00053512095,0.00060263305,0.0004007286],"domain_scores_gemma":[0.9990725,0.000362585,0.000040087278,0.00032137628,0.00001625491,0.00018718476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028806168,0.00029717927,0.00047615636,0.00023076957,0.00010872017,0.00006969539,0.0003740875,0.00013968315,0.00016448379],"category_scores_gemma":[0.000047463516,0.0003023192,0.000100444464,0.00023924473,0.000072437804,0.00010212988,0.00010158559,0.0007713405,0.000036200807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037710302,0.000004643003,0.000030819578,0.0000066336597,0.000022705544,0.000018125416,0.00034815609,0.95946586,0.00228893,0.00013937808,0.000023378807,0.03761363],"study_design_scores_gemma":[0.00050778204,0.00034106532,0.00025362443,0.000111715155,0.000018641076,0.000011915551,0.0000013609863,0.93503106,0.00090788165,0.00015798399,0.062215593,0.00044135595],"about_ca_topic_score_codex":0.0000380341,"about_ca_topic_score_gemma":0.0000847677,"teacher_disagreement_score":0.9842564,"about_ca_system_score_codex":0.00013597877,"about_ca_system_score_gemma":0.000039567218,"threshold_uncertainty_score":0.9999429},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002852557,0.000034873003,0.99391395,0.0009231337,0.0006751594,0.0009308573,0.0000016181424,0.00007288799,0.00059497077],"genre_scores_gemma":[0.9359128,0.000014136506,0.062769964,0.0010183365,0.00011277181,0.000042797834,0.000031365533,0.00003459845,0.000063220505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519396,0.00043544083,0.00069817074,0.0009898941,0.0019956494,0.000686894],"domain_scores_gemma":[0.9972334,0.0012642486,0.000751157,0.0006044458,0.00006819926,0.000078560086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018654705,0.00046662346,0.00049183756,0.0007838093,0.00058410066,0.00034736178,0.0022306072,0.00019890303,0.00003222039],"category_scores_gemma":[0.00045290682,0.00042088603,0.00016618535,0.0006968233,0.00048742938,0.00043713994,0.0007329606,0.0014275133,0.000006618651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011371197,0.000035269844,0.00017519174,0.00008111962,0.000009368593,0.000027169928,0.0033736743,0.944313,0.0006559712,0.01908218,0.000007904492,0.032227773],"study_design_scores_gemma":[0.0012604287,0.0004306799,0.00044876852,0.0004286785,0.00001801411,0.000011133334,0.0000023147022,0.98511153,0.0027113582,0.007826874,0.001283126,0.00046707763],"about_ca_topic_score_codex":0.00011713123,"about_ca_topic_score_gemma":0.0000071384857,"teacher_disagreement_score":0.9330602,"about_ca_system_score_codex":0.0009363362,"about_ca_system_score_gemma":0.00042865696,"threshold_uncertainty_score":0.9998243},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009018402,0.00034462308,0.9937911,0.000008715253,0.0023947414,0.0003236021,0.000008206683,0.00019891272,0.0020282362],"genre_scores_gemma":[0.962265,0.0000122224865,0.037188873,0.00003226633,0.00033850223,0.00001381363,0.000015751632,0.00008475231,0.000048799706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835664,0.0000098332475,0.0004249833,0.00038499085,0.0005265992,0.00029694443],"domain_scores_gemma":[0.9991821,0.00015448882,0.000121366524,0.000419345,0.00007438368,0.000048295227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004032473,0.00029508825,0.00031649283,0.0005110957,0.000092285685,0.000049914834,0.0004672582,0.00014712151,0.000057562498],"category_scores_gemma":[0.000030745512,0.0003119161,0.0000816426,0.00032775517,0.00014872434,0.0002230338,0.0002217496,0.0004248562,0.0000025979573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014721425,0.0000034178747,0.00005153833,0.0001336161,0.000012894883,0.000004364843,0.00021344057,0.9746885,0.0007099959,0.00415087,0.0000021200974,0.020027798],"study_design_scores_gemma":[0.00010591258,0.00002863832,0.0000942963,0.00024070317,0.000009811062,0.00005328979,2.4031897e-7,0.99418014,0.001136514,0.0027036394,0.0011247107,0.00032207364],"about_ca_topic_score_codex":0.000008844057,"about_ca_topic_score_gemma":0.0000056368553,"teacher_disagreement_score":0.9613632,"about_ca_system_score_codex":0.00051462563,"about_ca_system_score_gemma":0.00014644006,"threshold_uncertainty_score":0.9999333},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002647491,0.000583129,0.994129,0.00012789125,0.00094402174,0.001054053,0.000010320337,0.00026716647,0.000236939],"genre_scores_gemma":[0.91872466,0.00011484357,0.07993151,0.00030161216,0.00041900633,0.00026601306,0.000018764253,0.0000795606,0.00014401176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984793,0.000016320071,0.000330772,0.000490917,0.00032822066,0.00035446757],"domain_scores_gemma":[0.99898535,0.00044472335,0.000056847737,0.00037241887,0.00007173509,0.00006889777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049827324,0.00025032824,0.0003232425,0.00060126727,0.00017127367,0.00003978371,0.0005669784,0.00020382993,0.00007771568],"category_scores_gemma":[0.00007534475,0.00023584362,0.00006066748,0.0005493474,0.0002150502,0.00008581058,0.00026107157,0.0007047154,0.0000038581375],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026051353,0.00017807691,0.00007027797,0.0000904677,0.00007876134,0.016603602,0.00068922184,0.07639276,0.0000053013578,0.0111913225,0.0002560409,0.8944181],"study_design_scores_gemma":[0.004074136,0.0016232171,0.000011893884,0.00022670487,0.000077260236,0.008494772,0.000014292789,0.6231885,0.000303586,0.03956808,0.32095128,0.0014662588],"about_ca_topic_score_codex":0.000008856356,"about_ca_topic_score_gemma":0.00001578477,"teacher_disagreement_score":0.9160772,"about_ca_system_score_codex":0.00024068313,"about_ca_system_score_gemma":0.00012190457,"threshold_uncertainty_score":0.96174234},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28932732,0.00015092245,0.7074842,0.0009219037,0.0005324314,0.0008189035,0.00006709313,0.000035781235,0.00066147716],"genre_scores_gemma":[0.73499197,0.000031234416,0.2636275,0.00031764767,0.00041000362,0.000012820658,0.000389588,0.00004748637,0.00017175477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966944,0.00006534955,0.000602548,0.0007432556,0.0014756095,0.00041885057],"domain_scores_gemma":[0.99890196,0.00020702282,0.00015817687,0.0003770828,0.0002215676,0.00013421115],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00064385525,0.00032197553,0.0005663521,0.00073694065,0.0002243432,0.00007048298,0.0003943774,0.0002729996,0.0009480981],"category_scores_gemma":[0.000054388187,0.00029694574,0.00022593228,0.0004197948,0.00047186046,0.00030619558,0.00013428245,0.0013312658,0.000009709374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003138308,0.0001882803,0.0005920315,0.00030140954,0.000031767515,0.00028325687,0.0007136005,0.0010661714,0.10789462,0.0007410097,0.0000019917113,0.88787204],"study_design_scores_gemma":[0.0016961555,0.00057824684,0.0007815605,0.00028437746,0.000090668174,0.00015705025,0.0000035555645,0.96786565,0.00886198,0.019329388,0.000009888406,0.00034150312],"about_ca_topic_score_codex":0.00022537948,"about_ca_topic_score_gemma":0.000033832606,"teacher_disagreement_score":0.96679944,"about_ca_system_score_codex":0.0005394459,"about_ca_system_score_gemma":0.0005562278,"threshold_uncertainty_score":0.9999652},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028875242,0.00022215878,0.9959074,0.00064991234,0.0017744395,0.00044181122,0.0000059859694,0.00011042927,0.0008589442],"genre_scores_gemma":[0.0062821726,0.00002312091,0.99176496,0.0012082529,0.00024420593,0.000020601396,0.000012068949,0.000038880444,0.00040574197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613506,0.00012652672,0.0006401434,0.0016366346,0.0007661779,0.00069547544],"domain_scores_gemma":[0.99707794,0.0009355092,0.00040838582,0.0012462169,0.00020765058,0.00012429485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025724182,0.00043961508,0.0007065025,0.0011321089,0.00061852124,0.00047034764,0.0028939007,0.00026507824,0.00006543963],"category_scores_gemma":[0.00022956755,0.0004347512,0.00025321648,0.0008285277,0.0002394711,0.00076043134,0.0019184314,0.00056742516,0.000004006402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009143282,0.000012895802,0.000022235254,0.000038607584,0.0000295074,0.00002489019,0.00064044603,0.8785632,0.00052299,0.020145027,0.000017329465,0.099973686],"study_design_scores_gemma":[0.0002125238,0.00012754241,0.0000046585033,0.00007356739,0.000024655572,0.000036700818,5.7198093e-7,0.93150866,0.00034105187,0.064392366,0.0028227083,0.00045496828],"about_ca_topic_score_codex":0.000103391765,"about_ca_topic_score_gemma":0.00025159487,"teacher_disagreement_score":0.09951872,"about_ca_system_score_codex":0.0006019356,"about_ca_system_score_gemma":0.0006254643,"threshold_uncertainty_score":0.99981046},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000997456,0.0002206864,0.99663895,0.00028703042,0.0015176869,0.00066728896,0.0000129445825,0.00018731423,0.0003683337],"genre_scores_gemma":[0.20276852,0.000029076708,0.79590636,0.0006862603,0.0003240744,0.000058722464,0.000044620585,0.000036530837,0.00014584721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608636,0.00010367952,0.0006180885,0.0015652848,0.00096108735,0.0006654785],"domain_scores_gemma":[0.99773294,0.0005792166,0.00031698382,0.0009664014,0.00026643893,0.00013804474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019674771,0.00048634424,0.0006352373,0.001954859,0.00080438604,0.00046084024,0.001848759,0.00028444827,0.00003329854],"category_scores_gemma":[0.00005560453,0.00047298477,0.0004963601,0.0016867759,0.00025308714,0.00093600014,0.0003986843,0.00067218527,0.0000070159754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036937276,0.000028026132,0.000004422013,0.000028184819,0.0000671353,0.000022618231,0.00045505652,0.07063109,0.00366893,0.0014653194,0.0000022864572,0.92359],"study_design_scores_gemma":[0.00050452736,0.00033651612,0.00015446878,0.000039488405,0.00012643261,0.000054479216,9.1628834e-8,0.9257841,0.0125032645,0.058656532,0.0012654731,0.000574613],"about_ca_topic_score_codex":0.00008826332,"about_ca_topic_score_gemma":0.0003140876,"teacher_disagreement_score":0.9230154,"about_ca_system_score_codex":0.0007196107,"about_ca_system_score_gemma":0.00021671466,"threshold_uncertainty_score":0.9997722},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019799422,0.00011628385,0.9950983,0.0003968391,0.00052525895,0.000713828,0.000008198309,0.00020777508,0.0027355172],"genre_scores_gemma":[0.7932705,0.00001393129,0.2057516,0.0006185364,0.000121162695,0.00011968943,0.00000911757,0.000028995006,0.0000664469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996393,0.00008349655,0.00051003904,0.0010567065,0.0016545244,0.00030218257],"domain_scores_gemma":[0.99743086,0.00020328259,0.0003694664,0.0013555208,0.0005579399,0.000082926184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020668148,0.00030767333,0.000336392,0.00092324184,0.00034082335,0.0001372701,0.0019556654,0.00021463072,0.00016987209],"category_scores_gemma":[0.00006696337,0.00031918337,0.0001563697,0.0009598159,0.00031756065,0.00035627407,0.00061443704,0.000618776,0.000007921307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004279644,0.000043988864,0.00001577156,0.000020342015,0.0000062513195,0.000002178025,0.00013005506,0.08052877,0.0009890158,0.008770628,0.000004754159,0.90948397],"study_design_scores_gemma":[0.00025716433,0.00018954377,0.00011294057,0.0000453966,0.000020829832,0.000008910514,1.3684372e-7,0.8869611,0.021712692,0.08763061,0.0027243947,0.00033630364],"about_ca_topic_score_codex":0.000039106115,"about_ca_topic_score_gemma":0.000056276993,"teacher_disagreement_score":0.9091477,"about_ca_system_score_codex":0.0005441698,"about_ca_system_score_gemma":0.0007480628,"threshold_uncertainty_score":0.99992603},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050133234,0.0008068838,0.93764853,0.0099956235,0.0030348452,0.0008654158,0.00006481564,0.00025701846,0.04682555],"genre_scores_gemma":[0.9885101,0.00003918734,0.0031499658,0.0062415604,0.0013529524,0.000034731394,0.000012498638,0.00003846221,0.0006205819],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99605185,0.00011659891,0.00042574972,0.00094671437,0.0015634449,0.0008956316],"domain_scores_gemma":[0.9973619,0.0013176966,0.00034322756,0.0005544108,0.00020256359,0.00022019236],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015168564,0.0004016376,0.00058407127,0.00070657156,0.001585421,0.00094503077,0.0032295561,0.00027783532,0.0009107296],"category_scores_gemma":[0.0003364634,0.00038464332,0.00018101824,0.00069476187,0.0018000092,0.00067003956,0.000610826,0.0007391824,0.000016262762],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008970539,0.000105692874,0.015361437,0.000065990556,0.00007183426,0.00027820515,0.0069479216,0.09354203,0.000025587931,0.098626114,0.00029682543,0.78458863],"study_design_scores_gemma":[0.0070932074,0.0008842689,0.011342279,0.0010496265,0.00028901914,0.000028337523,0.000036043613,0.13690706,0.00036898378,0.18372248,0.6519819,0.006296827],"about_ca_topic_score_codex":0.0017991271,"about_ca_topic_score_gemma":0.0028728123,"teacher_disagreement_score":0.98800874,"about_ca_system_score_codex":0.00058240414,"about_ca_system_score_gemma":0.0017183071,"threshold_uncertainty_score":0.9998605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022636862,0.00072257477,0.99638104,0.0005193963,0.0004389341,0.00025790933,0.000016249394,0.00011769587,0.0013197978],"genre_scores_gemma":[0.5753543,0.0011639874,0.41872033,0.0032973925,0.00025342536,0.00003784201,0.00026030862,0.00007803829,0.00083435426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972221,0.000053960306,0.00037394528,0.0011559186,0.00084157696,0.00035244357],"domain_scores_gemma":[0.9987503,0.0002459411,0.00022218196,0.0005067958,0.00013927805,0.00013548452],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042015754,0.00033583393,0.00036335216,0.0011243861,0.00039351528,0.00053135963,0.0011588411,0.00015309246,0.000115909985],"category_scores_gemma":[0.00006785313,0.0003393387,0.00008554468,0.001284076,0.00019017492,0.00070923986,0.0005225755,0.00043403212,0.000017238099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026717648,0.0000324751,0.00019810391,0.000039924013,0.000023974539,0.000021152211,0.0012685341,0.099369265,0.0004153486,0.0037618675,0.000050234106,0.89481646],"study_design_scores_gemma":[0.00022745243,0.000078404475,0.000051208885,0.00008147944,0.000015069031,0.000015446996,0.0000011649421,0.99064106,0.00054100243,0.006505849,0.0014149499,0.0004269247],"about_ca_topic_score_codex":0.0000390462,"about_ca_topic_score_gemma":0.000031855998,"teacher_disagreement_score":0.8943895,"about_ca_system_score_codex":0.00024211082,"about_ca_system_score_gemma":0.0001488019,"threshold_uncertainty_score":0.9999059},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004217643,0.00038195789,0.99669605,0.00023821852,0.0006237395,0.0006792338,0.0000046435616,0.0007635143,0.00019090257],"genre_scores_gemma":[0.06373719,0.0001476506,0.9353469,0.00034116313,0.00020127953,0.00015304399,0.000007858472,0.00003536942,0.00002956398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965617,0.00008013402,0.00051482976,0.0015350156,0.0008184139,0.0004898747],"domain_scores_gemma":[0.99788725,0.0006028485,0.00035887607,0.0007568174,0.00029012284,0.00010406333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015512429,0.00041977476,0.00039656012,0.0007252351,0.0008338924,0.0005275214,0.0014175511,0.00015478728,0.0000054864586],"category_scores_gemma":[0.00021629706,0.00044140007,0.000093444556,0.00055401505,0.00030816297,0.0027409093,0.0010817477,0.0006103902,0.0000019007992],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022533279,0.00002301521,0.0000073060105,0.00012057302,0.0000065891686,0.00000689007,0.0008556452,0.0023465261,0.0039125695,0.0054340092,0.000001434214,0.9872629],"study_design_scores_gemma":[0.00023705084,0.00035470893,0.000040390736,0.00017701213,0.000008312728,0.000044741904,6.800298e-7,0.7531342,0.022376595,0.22259784,0.00048592122,0.00054255186],"about_ca_topic_score_codex":0.000043916854,"about_ca_topic_score_gemma":0.00003797092,"teacher_disagreement_score":0.9867204,"about_ca_system_score_codex":0.0006338975,"about_ca_system_score_gemma":0.00036328757,"threshold_uncertainty_score":0.9998038},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029951498,0.00015431599,0.9634299,0.00027247143,0.00087052054,0.0009292692,0.000034504887,0.00017093011,0.0041865334],"genre_scores_gemma":[0.9882809,0.000011923321,0.009593903,0.0011400149,0.0006128238,0.000023086213,0.000018021987,0.00005064881,0.00026871354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99480885,0.00010434207,0.00061841594,0.0015053818,0.002270198,0.00069279195],"domain_scores_gemma":[0.9976665,0.0009682864,0.00050029176,0.00058046833,0.0000862125,0.0001982838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008189137,0.0005180741,0.000682821,0.00057725434,0.000675442,0.00060845184,0.001977554,0.00013840212,0.00010392751],"category_scores_gemma":[0.00017189556,0.00044798283,0.00010179514,0.00046869667,0.0004941167,0.00069605774,0.0008441473,0.0016490443,0.000011768931],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015234841,0.00020869114,0.05139706,0.00011562494,0.000031322095,0.00047050125,0.0012380766,0.18779936,0.012392385,0.0024647794,0.000011163318,0.7437187],"study_design_scores_gemma":[0.024129877,0.010311468,0.22887263,0.0064546405,0.0006822353,0.0008655504,0.000022856759,0.55527973,0.052360214,0.0605972,0.0438158,0.0166078],"about_ca_topic_score_codex":0.000038886035,"about_ca_topic_score_gemma":0.00004096319,"teacher_disagreement_score":0.9583294,"about_ca_system_score_codex":0.00038622678,"about_ca_system_score_gemma":0.00039605115,"threshold_uncertainty_score":0.99979717},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009831882,0.0011381945,0.9769784,0.003831291,0.0012980786,0.0007766227,0.000010871341,0.00014536828,0.014837955],"genre_scores_gemma":[0.21723646,0.00083033723,0.75104,0.017160231,0.0012271202,0.00007670391,0.00019177447,0.00020116709,0.0120362155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977291,0.000013718848,0.0003155962,0.0008454563,0.0007483005,0.00034777907],"domain_scores_gemma":[0.9987896,0.00010447559,0.000141521,0.00071428454,0.00013175125,0.00011835318],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035088032,0.00028448345,0.00035750077,0.00053003937,0.00019277073,0.00005607511,0.0005314129,0.00019966438,0.00041444923],"category_scores_gemma":[0.0001022625,0.00025949386,0.00008358179,0.00033888707,0.00039773987,0.00014503283,0.00024490734,0.0008651482,0.00007457255],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028534103,0.00017297374,0.0008898035,0.00009924271,0.000022281565,0.00013276773,0.0006386417,0.00055380916,0.003512481,0.0022750474,0.000106109575,0.9915683],"study_design_scores_gemma":[0.004511006,0.0014299578,0.009822729,0.0009162713,0.00017610195,0.00035329905,0.000004863361,0.9016225,0.00091081363,0.027762195,0.05064875,0.001841567],"about_ca_topic_score_codex":0.000026388754,"about_ca_topic_score_gemma":0.000052714277,"teacher_disagreement_score":0.9897267,"about_ca_system_score_codex":0.0003217541,"about_ca_system_score_gemma":0.00051391515,"threshold_uncertainty_score":0.99998575},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005522144,0.00007339014,0.99255955,0.00014509853,0.00043860098,0.00071483944,0.000023904691,0.000056284156,0.00046619255],"genre_scores_gemma":[0.5140677,0.000019493416,0.48502004,0.00048057947,0.00015390826,0.00000769512,0.00004422441,0.000044887485,0.00016143148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691975,0.0000720466,0.00042587178,0.0016614894,0.000551762,0.00036905633],"domain_scores_gemma":[0.99805856,0.0007498481,0.00032082488,0.0006436634,0.00009290759,0.00013417254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006667651,0.00031691758,0.0004007376,0.0005175268,0.00033013476,0.00023118574,0.0016667836,0.0001364943,0.000020761532],"category_scores_gemma":[0.0004234539,0.00029336393,0.00004761406,0.00039534824,0.00036675687,0.00042683867,0.0020179844,0.00052114925,0.0000020229077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007324416,0.00005772743,0.000031690557,0.000120585995,0.0000064578926,0.0000062044546,0.0017755802,0.09422137,0.41215515,0.00096209307,0.000024214534,0.4905657],"study_design_scores_gemma":[0.00031699773,0.00018347609,0.000060838534,0.000108170505,0.000012522291,0.000036358277,0.000002150918,0.97793424,0.018931879,0.0010892194,0.0010096174,0.00031455854],"about_ca_topic_score_codex":0.000064634514,"about_ca_topic_score_gemma":0.000011720627,"teacher_disagreement_score":0.8837128,"about_ca_system_score_codex":0.00012024275,"about_ca_system_score_gemma":0.0002072141,"threshold_uncertainty_score":0.99995184},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86436284,0.012050793,0.118283354,0.00041015574,0.0031710628,0.0008270454,0.00022559844,0.000019233063,0.00064993504],"genre_scores_gemma":[0.99525505,0.00047648768,0.0032489104,0.0003812524,0.0003008379,0.000012725329,0.000093471,0.000029185969,0.00020209448],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984401,0.000023336494,0.00025693094,0.0008311469,0.00018214007,0.00026634568],"domain_scores_gemma":[0.9992506,0.000039625364,0.0002069834,0.0003770742,0.000065494736,0.00006020853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002754761,0.0002706156,0.00024137995,0.00009532198,0.00029285555,0.00015117048,0.00047323716,0.00016251068,0.000016364964],"category_scores_gemma":[0.00003832273,0.00027732932,0.000053829615,0.000046978348,0.00043963676,0.0000032931157,0.00077502715,0.00024095051,0.0000012165909],"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.00001716283,0.0000051762686,0.00007633919,0.000012302436,0.000017919152,0.0000024927429,0.00018808316,0.00027899945,0.88319373,0.00010645357,0.000030100342,0.11607124],"study_design_scores_gemma":[0.0036922556,0.0023939142,0.008258724,0.00024033246,0.00017782918,0.00039632546,0.00002621882,0.008653732,0.8787244,0.019419547,0.07340373,0.0046129953],"about_ca_topic_score_codex":0.00006734335,"about_ca_topic_score_gemma":0.000081637314,"teacher_disagreement_score":0.13089222,"about_ca_system_score_codex":0.0000663695,"about_ca_system_score_gemma":0.00015912724,"threshold_uncertainty_score":0.9999679},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019749182,0.00052110263,0.99497443,0.00015896023,0.000530023,0.00029010553,0.0000051542147,0.00041319392,0.0011321022],"genre_scores_gemma":[0.50432825,0.00004188385,0.49471793,0.00036218378,0.00026900755,0.00000961278,0.000006929842,0.00005567489,0.00020853928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949799,0.000112596535,0.00063285825,0.0018485191,0.001627061,0.00079904095],"domain_scores_gemma":[0.9964444,0.0010584431,0.000587104,0.0015469289,0.0002302304,0.00013286034],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011369128,0.00065417134,0.00067299133,0.0008346963,0.0015177431,0.00080410513,0.004805285,0.00022399481,0.000021190705],"category_scores_gemma":[0.00023579216,0.0005353864,0.0002741538,0.00094058044,0.0004986439,0.00088324596,0.004008303,0.0021161577,0.000004990131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017682265,0.000008197284,0.00008251902,0.0000062570034,0.000018703946,0.000027589118,0.0018720279,0.78405887,0.0014406699,0.0031315684,0.0000013858846,0.20935047],"study_design_scores_gemma":[0.00008357548,0.000035802303,0.000013463985,0.00017227161,0.000019700587,0.000012522996,0.0000022456986,0.8674131,0.004749074,0.1266876,0.0002553755,0.0005552554],"about_ca_topic_score_codex":0.0002936603,"about_ca_topic_score_gemma":0.00015724743,"teacher_disagreement_score":0.5023533,"about_ca_system_score_codex":0.00079214957,"about_ca_system_score_gemma":0.00056639424,"threshold_uncertainty_score":0.99978215},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000097026204,0.00008620152,0.9924162,0.0012358263,0.00035897573,0.00050604844,0.0000045784304,0.000031172964,0.005263987],"genre_scores_gemma":[0.6139482,0.00022838666,0.38023654,0.004378863,0.00015924123,0.000073688694,0.000026891244,0.000044374363,0.0009037798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707574,0.00010831788,0.00046976798,0.00070918805,0.0012999028,0.00033709063],"domain_scores_gemma":[0.9983044,0.0003413438,0.00023921602,0.00092565967,0.00013746967,0.00005185897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002014893,0.00022262476,0.00031353612,0.00072181714,0.00016189525,0.00019486748,0.0035652306,0.00011304321,0.000058114903],"category_scores_gemma":[0.00006326767,0.00017453865,0.000085405176,0.00092138647,0.00024691533,0.00047679947,0.00088699843,0.00059029314,0.000005423315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003419191,0.000037536076,0.000015496196,0.000016312772,0.0000024407743,0.00001151696,0.0024541905,0.8070238,0.0000194924,0.052082717,0.000034427012,0.13829865],"study_design_scores_gemma":[0.00025494088,0.000078469784,0.00003435292,0.000058318456,0.0000017689265,0.000006355393,3.76653e-7,0.9294702,0.00006664193,0.06947665,0.00038275262,0.0001691779],"about_ca_topic_score_codex":0.000025233065,"about_ca_topic_score_gemma":0.000046477388,"teacher_disagreement_score":0.61385125,"about_ca_system_score_codex":0.00018905995,"about_ca_system_score_gemma":0.00053538097,"threshold_uncertainty_score":0.71174794},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005967609,0.0005742905,0.97102636,0.000651053,0.0016858752,0.00037287327,0.0000023568105,0.00044333463,0.025184168],"genre_scores_gemma":[0.029517094,0.00030641255,0.9648368,0.0025139072,0.00033216318,0.000028378236,0.000011327005,0.00006159759,0.0023923258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957193,0.000094297495,0.0007267577,0.0017642432,0.0009596438,0.0007357442],"domain_scores_gemma":[0.99735457,0.0005330191,0.00035183728,0.0014948559,0.00013402604,0.00013169648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001884075,0.0004993812,0.0005925113,0.0015426592,0.0003599255,0.00044518075,0.0040484006,0.00028898413,0.00010740112],"category_scores_gemma":[0.00013275002,0.00053215824,0.00013378939,0.0011673936,0.0002548724,0.0007037747,0.0023288152,0.0014813005,0.000021785008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047848903,0.000029437588,0.00003748695,0.000018750376,0.000004317779,0.00012446413,0.00051820197,0.5357869,0.000019965984,0.004294761,0.00011308806,0.45904782],"study_design_scores_gemma":[0.0002918562,0.0001527229,0.000029509689,0.0003178645,0.0000030099118,0.0000690324,2.0498668e-7,0.87390256,0.000901834,0.11633407,0.0071899313,0.0008074101],"about_ca_topic_score_codex":0.000114636845,"about_ca_topic_score_gemma":0.00007474852,"teacher_disagreement_score":0.45824042,"about_ca_system_score_codex":0.00070252694,"about_ca_system_score_gemma":0.0006415829,"threshold_uncertainty_score":0.999713},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026105976,0.00017164598,0.97850204,0.0012315413,0.0011064353,0.00046912418,0.000009981426,0.00010251242,0.018145686],"genre_scores_gemma":[0.7076031,0.00024261797,0.2837655,0.005814922,0.0003662935,0.00010344112,0.000008374229,0.00014763481,0.0019481236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99515605,0.00015345444,0.0004952264,0.0014148797,0.0020479294,0.0007324567],"domain_scores_gemma":[0.99341655,0.0033501147,0.0003359599,0.0025232937,0.0002438862,0.00013022471],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017285625,0.0004742276,0.00050411903,0.00079496717,0.0004994971,0.00024842692,0.007291546,0.00017406052,0.00037539878],"category_scores_gemma":[0.00027220658,0.00034740666,0.00022147357,0.0015699463,0.0017200281,0.00042105172,0.0029390727,0.0016586386,0.00005496036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012156498,0.000041357212,0.000034781762,0.000017008422,0.000014962476,0.00006548882,0.00034809002,0.014167447,0.0000561885,0.8960905,0.000046642464,0.089105345],"study_design_scores_gemma":[0.00014909863,0.00022554085,0.000042507025,0.00010938086,0.000004000544,0.00006915424,2.5741122e-7,0.023061195,0.00077384536,0.973081,0.0021003007,0.00038372254],"about_ca_topic_score_codex":0.000020837924,"about_ca_topic_score_gemma":0.000021678312,"teacher_disagreement_score":0.707342,"about_ca_system_score_codex":0.00023,"about_ca_system_score_gemma":0.00054629834,"threshold_uncertainty_score":0.9998978},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011700661,0.0005663826,0.98560053,0.002594186,0.00038401855,0.0003682526,0.00023056148,0.000048027312,0.01009105],"genre_scores_gemma":[0.93912196,0.00003857756,0.05571965,0.0035634623,0.0010031566,0.00010250763,0.00007726671,0.00006674076,0.00030665085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788225,0.000003270119,0.0005352092,0.0009954916,0.00016409994,0.00041968882],"domain_scores_gemma":[0.9988007,0.00019331629,0.0001954245,0.0006257221,0.000081212595,0.00010361675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053393486,0.00026481066,0.00043867104,0.0009093244,0.00035537375,0.000121739125,0.0009108914,0.00016969227,0.00040217623],"category_scores_gemma":[0.000094629075,0.0003200696,0.00013040073,0.0007727834,0.00037458053,0.00013797873,0.0001717006,0.00059506425,0.00008272902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009534126,0.00004605592,0.000029028566,0.00004560667,0.000006436018,0.0000052574323,0.00053810555,0.02055602,0.0000106945,0.91150504,0.0000050891763,0.06724314],"study_design_scores_gemma":[0.00020916735,0.00009299464,0.00027337292,0.000036784873,0.0000028452575,0.0000045721217,2.5473472e-7,0.22045127,0.000048995233,0.7724794,0.006017451,0.00038288158],"about_ca_topic_score_codex":0.0004345436,"about_ca_topic_score_gemma":0.000034630168,"teacher_disagreement_score":0.93900496,"about_ca_system_score_codex":0.00048488492,"about_ca_system_score_gemma":0.00064023107,"threshold_uncertainty_score":0.99992514},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015316668,0.018002393,0.9011821,0.05957451,0.0013111285,0.00380127,0.000435501,0.00014389877,0.00023254578],"genre_scores_gemma":[0.88229823,0.005716746,0.06496496,0.039432753,0.002277695,0.00029845437,0.002102256,0.00012745422,0.0027814477],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979611,0.00009873268,0.0003609997,0.00078100426,0.0003281296,0.00047004348],"domain_scores_gemma":[0.99867177,0.00035688607,0.00019571923,0.00015769192,0.00029579553,0.0003221501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007442046,0.00023998896,0.0004548546,0.00016235124,0.001108068,0.00018222744,0.00010649819,0.00017275645,0.000011438538],"category_scores_gemma":[0.00029732074,0.00022665889,0.00002289465,0.00062885415,0.0005259668,0.00010765966,0.00022960939,0.000615434,5.0458357e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019236814,0.000042398962,0.014817839,0.0008089837,0.000013043361,0.000014234059,0.0031544473,0.0008359549,0.0000034485852,0.0003509941,0.0030627858,0.9767035],"study_design_scores_gemma":[0.0016609691,0.01624795,0.006433331,0.0035434843,0.000117974996,0.00092822866,0.0011978666,0.32432044,0.00039420064,0.07688432,0.5661136,0.0021576686],"about_ca_topic_score_codex":0.0006426747,"about_ca_topic_score_gemma":0.0011076205,"teacher_disagreement_score":0.97454584,"about_ca_system_score_codex":0.00089026167,"about_ca_system_score_gemma":0.003282502,"threshold_uncertainty_score":0.9242881},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000941975,0.00004736435,0.99219024,0.00057434617,0.0023615959,0.0005556141,0.000024179622,0.00032876426,0.0029759265],"genre_scores_gemma":[0.75355726,0.00007212809,0.24113965,0.0035751706,0.00094797043,0.000108904416,0.00020241132,0.000093746516,0.00030275734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637884,0.00010602548,0.00044491107,0.0015776335,0.00095725874,0.00053532893],"domain_scores_gemma":[0.99774015,0.00044907382,0.00048493806,0.0009629873,0.00020173371,0.00016113426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092288805,0.0004899049,0.00040126845,0.0013189852,0.0006246281,0.00051023334,0.0014905564,0.0003250123,0.00041600037],"category_scores_gemma":[0.000073582065,0.00051015196,0.00022178158,0.0008130222,0.0002757057,0.0017305937,0.00056231197,0.0012709454,0.00007299774],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022393635,0.0000873133,0.000012361317,0.000035486675,0.000012068286,0.000026447125,0.00018927392,0.0017405504,0.002592774,0.0018763583,0.000023615905,0.9933814],"study_design_scores_gemma":[0.0010211611,0.0007061895,0.00085021905,0.00031488412,0.000032364405,0.000056125453,2.7310057e-7,0.76120627,0.0077600935,0.22131263,0.0051832697,0.0015565502],"about_ca_topic_score_codex":0.000041203602,"about_ca_topic_score_gemma":0.000090276946,"teacher_disagreement_score":0.9918248,"about_ca_system_score_codex":0.00051840366,"about_ca_system_score_gemma":0.0003672526,"threshold_uncertainty_score":0.999735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001162519,0.0006140094,0.9948923,0.0007784956,0.00036242377,0.0002822278,0.000007721985,0.0016904601,0.00020981928],"genre_scores_gemma":[0.22179763,0.000319566,0.7772243,0.00030772242,0.0002574477,0.000024725112,0.000003799522,0.000044820103,0.000019952662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971074,0.000008539724,0.00037946572,0.0013136781,0.00063598255,0.0005549446],"domain_scores_gemma":[0.9974908,0.0011555181,0.00015522669,0.00095013354,0.00008875864,0.00015953631],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005078145,0.00047448042,0.00044153765,0.00082466076,0.00016854423,0.0007271978,0.0010595844,0.00027070148,0.0000028136833],"category_scores_gemma":[0.00030742155,0.00044251495,0.00006733806,0.00037507928,0.00022297767,0.0020084633,0.001900519,0.0012651355,0.0000016560374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011149884,0.000067521265,0.00030956182,0.000094169896,0.0000133995,0.0073978575,0.0034708271,0.08378496,0.0000025253578,0.11574773,0.000039855284,0.7890605],"study_design_scores_gemma":[0.00015603928,0.00014990328,0.00003669693,0.00017719767,0.000003405404,0.004305962,2.5768907e-7,0.8162206,0.0000061822066,0.17797223,0.0004906703,0.00048085864],"about_ca_topic_score_codex":0.000026442069,"about_ca_topic_score_gemma":0.000044121858,"teacher_disagreement_score":0.7885796,"about_ca_system_score_codex":0.00026672054,"about_ca_system_score_gemma":0.0002993416,"threshold_uncertainty_score":0.99980265},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002362537,0.000053218137,0.995438,0.00072265416,0.001809277,0.0006341153,0.000024478699,0.000120690536,0.001173941],"genre_scores_gemma":[0.036650512,0.000025296036,0.96083194,0.0017097692,0.00031218067,0.00002808334,0.000018411689,0.00006285078,0.00036094646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99380565,0.00029762925,0.00063469814,0.0017121859,0.0029440473,0.0006058057],"domain_scores_gemma":[0.9956344,0.0006829951,0.00046100115,0.0024484254,0.00058368227,0.0001895036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022002757,0.0004765816,0.00051239994,0.0011555268,0.00057878566,0.00035935626,0.004977938,0.00023627256,0.000251496],"category_scores_gemma":[0.00025539045,0.00037025168,0.00017648691,0.0019008764,0.0005674896,0.00047471764,0.0013537289,0.0013016285,0.000015152787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007531138,0.00007885556,0.00001696576,0.000018769522,0.00000550072,0.000019086861,0.00016615815,0.5638732,0.00018793813,0.0043541775,0.000040490442,0.43123135],"study_design_scores_gemma":[0.00027138065,0.00046747798,0.00016865403,0.00010792574,0.000006868577,0.00003228413,1.76112e-7,0.98518056,0.0021882318,0.010010624,0.001197522,0.00036832722],"about_ca_topic_score_codex":0.000049087113,"about_ca_topic_score_gemma":0.000016398828,"teacher_disagreement_score":0.43086302,"about_ca_system_score_codex":0.00044205174,"about_ca_system_score_gemma":0.0012141367,"threshold_uncertainty_score":0.99987495},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28572422,0.00023931642,0.7093061,0.0013256794,0.00032978784,0.000958561,0.000018956283,0.00004757663,0.0020497912],"genre_scores_gemma":[0.9980048,0.000026787253,0.0015283601,0.000206057,0.00012269846,0.000018017154,0.0000069768157,0.000010059398,0.000076268545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979506,0.000214115,0.00025346503,0.00043328776,0.00091070967,0.00023783054],"domain_scores_gemma":[0.9980293,0.0009406314,0.00040084397,0.0004232978,0.00015960085,0.000046338057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020887582,0.00017381067,0.0002826442,0.00060952746,0.0006395456,0.00009033301,0.0010929577,0.000092295144,0.000027092037],"category_scores_gemma":[0.00013178511,0.00010454253,0.00020909369,0.0011420855,0.0014322065,0.00013221943,0.00011128575,0.0004296676,1.2219049e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081784936,0.0008195363,0.0063453135,0.0001483901,0.0004437606,0.0000052602322,0.05813652,0.64244694,0.0001616682,0.1561039,0.000024683093,0.13528225],"study_design_scores_gemma":[0.0028421523,0.0073291208,0.07460431,0.004922942,0.0034884107,0.000022821116,0.0006714415,0.6901387,0.010293087,0.20180777,0.0002951514,0.0035841165],"about_ca_topic_score_codex":0.0005788616,"about_ca_topic_score_gemma":0.0017939378,"teacher_disagreement_score":0.7122806,"about_ca_system_score_codex":0.00006923244,"about_ca_system_score_gemma":0.00022863317,"threshold_uncertainty_score":0.52770245},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045653383,0.00038220105,0.99126285,0.0035647668,0.0014654711,0.00056689687,0.0000066881644,0.0007481411,0.0015464537],"genre_scores_gemma":[0.23898251,0.00006052769,0.76023704,0.00047675398,0.0000791472,0.000036716912,0.000028491484,0.00004785306,0.000050956973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99393255,0.00017420645,0.00088764937,0.0024562592,0.0015369091,0.0010124313],"domain_scores_gemma":[0.99303627,0.0011936588,0.00061501237,0.0048476183,0.00017818452,0.00012928252],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0020866606,0.0006964841,0.0007060345,0.00192723,0.0006441543,0.00077557436,0.025071805,0.0004549342,0.00005065962],"category_scores_gemma":[0.006209073,0.0007258266,0.00011531448,0.0019235911,0.0006415802,0.001474351,0.073781654,0.0028897417,0.00003732755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013920443,0.00005145778,0.00022472483,0.000028530816,0.000013098067,0.00030081213,0.0005000032,0.21729453,0.00009042934,0.0040217,0.00017654238,0.77728426],"study_design_scores_gemma":[0.00024653168,0.00024487774,0.00014996408,0.00032522448,0.0000043248588,0.00006230631,9.371414e-7,0.819602,0.00057952217,0.17746834,0.00068930374,0.00062667805],"about_ca_topic_score_codex":0.00017841665,"about_ca_topic_score_gemma":0.00018656076,"teacher_disagreement_score":0.7766576,"about_ca_system_score_codex":0.0011988722,"about_ca_system_score_gemma":0.0006385561,"threshold_uncertainty_score":0.9995193},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002162237,0.000045379325,0.9907347,0.00056138565,0.0022714103,0.0006193917,0.00000614835,0.00017791167,0.0034214426],"genre_scores_gemma":[0.6999048,0.00002190562,0.2953653,0.0022038089,0.0011618435,0.00008441553,0.00014885844,0.00008272929,0.0010263557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628866,0.00007926759,0.000608048,0.0013668411,0.0011567309,0.0005004836],"domain_scores_gemma":[0.9984656,0.00016445958,0.00036711368,0.00072590256,0.00017039612,0.00010650617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008045719,0.00043305903,0.00039254111,0.0015300125,0.0004944299,0.0003920943,0.0012100772,0.00022573736,0.00030614808],"category_scores_gemma":[0.000057225727,0.00045132212,0.000102654805,0.0006904934,0.00024446493,0.0010148289,0.0008280915,0.0009267055,0.000061014227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015996195,0.00017792851,0.00007841577,0.00007669898,0.000012850877,0.0002092218,0.0011626823,0.2637534,0.0008082927,0.013633687,0.00013284657,0.719938],"study_design_scores_gemma":[0.0004801147,0.00026943051,0.0006281845,0.00032863312,0.000006449785,0.0001249038,1.7014175e-7,0.92212164,0.0012291265,0.07342137,0.00076976,0.0006202064],"about_ca_topic_score_codex":0.000359387,"about_ca_topic_score_gemma":0.0005329152,"teacher_disagreement_score":0.71931773,"about_ca_system_score_codex":0.0006912327,"about_ca_system_score_gemma":0.00046186446,"threshold_uncertainty_score":0.9997938},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009871845,0.0014440594,0.9841809,0.00039424349,0.0030278454,0.00051022467,0.00023063233,0.00006048186,0.00027973793],"genre_scores_gemma":[0.7186108,0.0007995254,0.26734093,0.0024576986,0.0059972904,0.0000680055,0.0014891782,0.00023120355,0.003005355],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978734,0.000014794808,0.00024111872,0.0012458011,0.0003311928,0.00029364586],"domain_scores_gemma":[0.99838346,0.000009546083,0.00009845003,0.0013456319,0.00008029897,0.00008261655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005251248,0.00029708995,0.00027746148,0.0002201501,0.00013683995,0.00006436721,0.0009264642,0.00015444125,0.000013860081],"category_scores_gemma":[0.00009588401,0.0002413119,0.000042363263,0.00020164237,0.000111650384,0.000016656177,0.0009793654,0.00036647342,0.0000039672486],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060451344,0.00004498419,0.00022682645,0.000047996607,0.000090440524,0.000012597938,0.00015380848,0.068718895,0.57276136,0.0006902634,0.00009086883,0.35710153],"study_design_scores_gemma":[0.0015748071,0.0022283809,0.0015109185,0.00032538173,0.0001985574,0.0003201126,0.0000016127644,0.01791955,0.3265643,0.0017889548,0.6447352,0.0028322155],"about_ca_topic_score_codex":0.00002396371,"about_ca_topic_score_gemma":0.00004901947,"teacher_disagreement_score":0.71683997,"about_ca_system_score_codex":0.000037424543,"about_ca_system_score_gemma":0.0001678388,"threshold_uncertainty_score":0.98404133},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008007158,0.00039244557,0.991724,0.00154389,0.0015161069,0.00035965574,0.0000033234091,0.000080998696,0.003578876],"genre_scores_gemma":[0.90240633,0.00003651551,0.091629885,0.0048991973,0.0006806582,0.000032032516,0.000021494601,0.000026490034,0.00026742028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967588,0.00011207149,0.0004921925,0.0011011548,0.0010675109,0.00046825083],"domain_scores_gemma":[0.99780434,0.0011867693,0.00022800839,0.00062066835,0.00009311898,0.00006711694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020850296,0.00035215073,0.0003364048,0.0009794277,0.00041031864,0.00053194864,0.002508457,0.00012508858,0.000088163826],"category_scores_gemma":[0.00012450026,0.00029245054,0.00009763325,0.001084033,0.00020920072,0.00059576955,0.0011491913,0.0010667723,0.000015570951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073099413,0.000036296136,0.00006684457,0.000028663262,0.000007497611,0.00024536773,0.0057293978,0.37815166,0.000093149494,0.035366647,0.00005114363,0.580216],"study_design_scores_gemma":[0.00028292762,0.00020119417,0.0004062391,0.00017545685,0.000005387772,0.00028310547,0.0000040406003,0.9215596,0.0001879398,0.0695428,0.0068037836,0.0005475319],"about_ca_topic_score_codex":0.000047678954,"about_ca_topic_score_gemma":0.00017888079,"teacher_disagreement_score":0.9016056,"about_ca_system_score_codex":0.00030543364,"about_ca_system_score_gemma":0.00038661459,"threshold_uncertainty_score":0.99995273},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000094582225,0.00006309156,0.99037296,0.0010562298,0.00033419157,0.00071135524,0.000011576676,0.00014071981,0.007215281],"genre_scores_gemma":[0.72930646,0.0000033358754,0.26913658,0.0012854339,0.0000632883,0.000072318304,0.000033627282,0.000022966755,0.00007597578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952981,0.00012409256,0.0007887916,0.0019216056,0.0012367864,0.0006306348],"domain_scores_gemma":[0.9970829,0.0005397552,0.00030564296,0.0016290956,0.00019656404,0.00024603744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016737854,0.00052462507,0.00069377344,0.0034069116,0.00036630302,0.00056659407,0.002521237,0.00023144686,0.00006591795],"category_scores_gemma":[0.00015628958,0.00051932124,0.0002229143,0.003967474,0.0002240113,0.00036803572,0.0006117198,0.0011033771,0.000023545646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061512133,0.0000654334,0.00018286776,0.000017449576,0.00002013911,0.000015238744,0.0007039198,0.9057456,0.000005766007,0.053095743,0.000004450654,0.040137228],"study_design_scores_gemma":[0.00017772171,0.00015158509,0.0008141213,0.00013237608,0.000043979555,0.000004504319,2.6209418e-7,0.96417546,0.000013361548,0.033767488,0.00017417625,0.0005449522],"about_ca_topic_score_codex":0.00015404158,"about_ca_topic_score_gemma":0.0003646246,"teacher_disagreement_score":0.72921187,"about_ca_system_score_codex":0.00081700203,"about_ca_system_score_gemma":0.0006016732,"threshold_uncertainty_score":0.9997258},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000732479,0.00013025841,0.9916401,0.0006615011,0.00080541754,0.00034904768,0.000016338145,0.0045148325,0.0011500553],"genre_scores_gemma":[0.086246066,0.0000040762716,0.91068375,0.0027029286,0.00019419804,0.000048873902,0.000014892261,0.000046794314,0.000058397967],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99565685,0.0000644495,0.0006394453,0.0018270192,0.0011465049,0.00066571817],"domain_scores_gemma":[0.9922028,0.005363168,0.00030611007,0.0018186101,0.00015956318,0.00014970437],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0009924521,0.0005381168,0.00052609557,0.0011170716,0.00038115325,0.0003913308,0.004256535,0.00064866425,0.000038454746],"category_scores_gemma":[0.003025729,0.00054782926,0.00009415191,0.0017036977,0.00038428433,0.00047544145,0.0024705727,0.0034557509,0.000012826044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009126733,0.00016388667,0.019925592,0.000028791845,0.000009178907,0.0005753759,0.00048246104,0.06585254,0.0000817957,0.027395232,0.00060615083,0.8848699],"study_design_scores_gemma":[0.00017447764,0.00022967007,0.007293069,0.0008511447,0.000004409322,0.000052797914,3.862677e-8,0.10479552,0.00007970812,0.88547194,0.00033245684,0.00071475835],"about_ca_topic_score_codex":0.0004006286,"about_ca_topic_score_gemma":0.00009912672,"teacher_disagreement_score":0.8841551,"about_ca_system_score_codex":0.00074617786,"about_ca_system_score_gemma":0.00080877123,"threshold_uncertainty_score":0.9996973},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002724884,0.000276559,0.9951059,0.00077441795,0.00071781146,0.00039377992,0.00001142293,0.00013607979,0.0023115203],"genre_scores_gemma":[0.25931713,0.00020733319,0.73776317,0.002046299,0.00032898632,0.00007205631,0.000030586198,0.00004500431,0.00018946211],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680436,0.000038361253,0.00052733906,0.0013438364,0.00082001556,0.0004660942],"domain_scores_gemma":[0.9975819,0.00055701996,0.00039663003,0.0011624971,0.0001850051,0.00011697251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004894122,0.00035732644,0.00044421703,0.0006207319,0.00037716975,0.00013972787,0.0028792878,0.00018564418,0.00009831572],"category_scores_gemma":[0.000060658287,0.00033656295,0.00014956415,0.0010966425,0.00095524,0.000508778,0.0015787409,0.00084082433,0.000023897283],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073208525,0.0000483119,0.000021178957,0.000019207366,0.0000070295264,0.000047668113,0.0003236001,0.01924643,0.0010193543,0.041124724,0.000041234125,0.93809396],"study_design_scores_gemma":[0.00026715128,0.00035196528,0.00013716744,0.00013430891,0.000010044958,0.00013799248,1.3275171e-7,0.10094959,0.0051579354,0.8856223,0.0065529807,0.0006784077],"about_ca_topic_score_codex":0.000007912201,"about_ca_topic_score_gemma":0.000011430413,"teacher_disagreement_score":0.93741554,"about_ca_system_score_codex":0.0001613015,"about_ca_system_score_gemma":0.00019265393,"threshold_uncertainty_score":0.9999086},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017124387,0.002581578,0.9843818,0.0073087257,0.002101326,0.0006397277,0.00006020422,0.00017700648,0.0010371933],"genre_scores_gemma":[0.9759633,0.00012451413,0.0133331595,0.00555009,0.000090862246,0.00006652983,0.000021389216,0.000043998192,0.004806183],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916419,0.00022518825,0.0008512955,0.002437986,0.00422404,0.0006196215],"domain_scores_gemma":[0.9933783,0.0017519732,0.0010018488,0.0033236814,0.00039927667,0.00014492922],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0035895584,0.0006788814,0.0017253463,0.0025601748,0.0009428474,0.0021081252,0.007850533,0.00048619165,0.0037439659],"category_scores_gemma":[0.00037552847,0.0003712145,0.0017558588,0.0037586375,0.00181448,0.0012974096,0.0023381917,0.0022015579,0.000055999593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007679329,0.0006151025,0.15570012,0.000031410535,0.03242755,0.00047309443,0.02426882,0.36224273,0.000027309334,0.052299578,0.0022291017,0.3696084],"study_design_scores_gemma":[0.00087524496,0.00038154636,0.08637742,0.000049937025,0.05713438,0.00018302132,0.000936864,0.108929895,0.0005379758,0.67076665,0.06875605,0.005071037],"about_ca_topic_score_codex":0.000026839696,"about_ca_topic_score_gemma":0.00030606033,"teacher_disagreement_score":0.97425085,"about_ca_system_score_codex":0.00022976236,"about_ca_system_score_gemma":0.00023355399,"threshold_uncertainty_score":0.999874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.157543,0.0059229997,0.81638455,0.004315618,0.0021611475,0.006252429,0.00048993476,0.00010351581,0.006826827],"genre_scores_gemma":[0.9984207,0.0001510424,0.0010874056,0.000058290723,0.00017486731,0.000034598,0.0000021924313,0.0000074424347,0.00006345838],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99792904,0.000078883066,0.00025207005,0.0005716046,0.00086723885,0.00030117176],"domain_scores_gemma":[0.9979638,0.0011612775,0.00019262295,0.0002952332,0.00031860903,0.000068470785],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0023262636,0.0001821753,0.00023823457,0.00007981613,0.0020783218,0.0001311694,0.000881581,0.00009327114,0.00003178177],"category_scores_gemma":[0.0001916811,0.00011619653,0.00006554242,0.00024056656,0.0035516357,0.0001890084,0.00027737534,0.00035003023,2.0347682e-7],"study_design_candidate":"observational","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.000051274117,0.000039936112,0.4613247,0.000074861324,0.00008171595,0.000002292884,0.04344535,0.00032337848,0.00008129192,0.015026166,0.000024862433,0.4795242],"study_design_scores_gemma":[0.0003855082,0.00042030518,0.7161949,0.00022435364,0.00013101073,7.317493e-7,0.0003104453,0.00094555184,0.00024708096,0.27764437,0.0028468762,0.0006488152],"about_ca_topic_score_codex":0.0012443961,"about_ca_topic_score_gemma":0.019945003,"teacher_disagreement_score":0.8408777,"about_ca_system_score_codex":0.00021122498,"about_ca_system_score_gemma":0.00048047322,"threshold_uncertainty_score":0.99922085},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068751884,0.0016180157,0.9732465,0.0036032496,0.003189563,0.0009829069,0.00006113777,0.00020175384,0.017028108],"genre_scores_gemma":[0.7064074,0.0015563862,0.22304316,0.00494538,0.012814029,0.0005628278,0.00026618727,0.00036290273,0.050041683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977575,0.000047526733,0.00019839295,0.00065914536,0.0007368701,0.00060059555],"domain_scores_gemma":[0.9985448,0.0007481112,0.00014952075,0.00034175508,0.00011963272,0.000096182965],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017434314,0.00025281074,0.0002616567,0.00025270815,0.0033169454,0.00034584114,0.0012378865,0.00019686238,0.00032144625],"category_scores_gemma":[0.0002524119,0.00020574608,0.0001358611,0.00041918416,0.0006365503,0.0002815512,0.00042924576,0.0013376243,0.0000036939614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055332657,0.000046638128,0.0017059298,0.0001476412,0.00009122641,0.000035652418,0.08007278,0.5943567,0.00030255318,0.09573724,0.00073239114,0.22671592],"study_design_scores_gemma":[0.00036366534,0.00024720808,0.0001076408,0.00023120208,0.0000471976,0.000018251605,0.00004478696,0.3299334,0.00010220513,0.023449764,0.6446625,0.00079215673],"about_ca_topic_score_codex":0.0008411747,"about_ca_topic_score_gemma":0.002221201,"teacher_disagreement_score":0.7502034,"about_ca_system_score_codex":0.00043205332,"about_ca_system_score_gemma":0.00045546965,"threshold_uncertainty_score":0.9979806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059588626,0.00005370641,0.99049455,0.0036472944,0.0008204432,0.0014281564,0.0000071820823,0.00020597063,0.0027467937],"genre_scores_gemma":[0.94848764,0.000012076303,0.04863129,0.0021617967,0.00025560617,0.00015557664,0.000022347633,0.000041637668,0.0002320091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943075,0.00018337996,0.0010265285,0.002035367,0.0016530474,0.0007941323],"domain_scores_gemma":[0.9964237,0.0007795939,0.00061851804,0.0018933144,0.00014302022,0.00014182189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029676864,0.00051085424,0.00061339355,0.00092472363,0.00077154004,0.0004400521,0.004557882,0.00021206243,0.00015410843],"category_scores_gemma":[0.00020723663,0.0005215643,0.000117022726,0.0012260253,0.00027752755,0.0006119342,0.0037509552,0.001724402,0.000009476316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034663797,0.00080410455,0.00229096,0.0000743948,0.000062046056,0.0006404308,0.06070674,0.10505338,0.00011797633,0.04424757,0.00012990725,0.7858378],"study_design_scores_gemma":[0.0012100311,0.0010022699,0.0019793496,0.00032422476,0.000021423637,0.000078413614,0.000040101808,0.7453514,0.0004897314,0.2457488,0.0022564281,0.0014978182],"about_ca_topic_score_codex":0.0015263641,"about_ca_topic_score_gemma":0.003980795,"teacher_disagreement_score":0.9478918,"about_ca_system_score_codex":0.000852282,"about_ca_system_score_gemma":0.0007343122,"threshold_uncertainty_score":0.9997236},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037342191,0.00013781371,0.99263585,0.00022874554,0.00026243305,0.0020541467,0.000038958548,0.00017505462,0.0007328102],"genre_scores_gemma":[0.82761437,0.000014325236,0.17130657,0.00022234306,0.000075327065,0.00042952283,0.000028181434,0.00002486347,0.0002845292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711126,0.000093981915,0.00050525233,0.001183044,0.0008421163,0.00026434552],"domain_scores_gemma":[0.9979033,0.0003823477,0.0004817462,0.0008798407,0.00028436474,0.000068436064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005929533,0.0003496095,0.00045549968,0.00051427697,0.00039439768,0.0001384313,0.0015568999,0.000090797235,0.00006268499],"category_scores_gemma":[0.00002189518,0.0003396446,0.00008051914,0.00083478534,0.00041868928,0.0004316539,0.0008324247,0.00047876948,0.000008247917],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009421449,0.0014300601,0.0007428742,0.00015206113,0.00018371537,0.00003307268,0.03158018,0.05463495,0.021511678,0.04243498,0.00068161945,0.8465206],"study_design_scores_gemma":[0.002309163,0.008945273,0.0029839354,0.00039436732,0.00011089088,0.000078109006,0.00010992278,0.46086574,0.3621949,0.15161717,0.006776057,0.0036144848],"about_ca_topic_score_codex":0.00006718243,"about_ca_topic_score_gemma":0.000014890606,"teacher_disagreement_score":0.8429061,"about_ca_system_score_codex":0.00032879206,"about_ca_system_score_gemma":0.0002648293,"threshold_uncertainty_score":0.9999056},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006395537,0.0016841886,0.99426544,0.0010586727,0.0005698802,0.0010110525,0.00002285396,0.00014549535,0.0006028834],"genre_scores_gemma":[0.21422887,0.00055011903,0.781124,0.0020525092,0.00024531578,0.00025312978,0.000018638553,0.00014003563,0.0013873869],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99600583,0.00005965858,0.00041243323,0.0018980886,0.0008454417,0.00077855226],"domain_scores_gemma":[0.9967011,0.0015853214,0.00021150034,0.0010488163,0.00020343557,0.0002497832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012284409,0.00054240995,0.00059404975,0.0012314494,0.00075732585,0.00062377704,0.0023374665,0.00019585153,0.000028977129],"category_scores_gemma":[0.00018579763,0.0005252341,0.00010258089,0.0007797172,0.0019868673,0.0007702322,0.0026137272,0.0006930526,0.0000016327452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006569368,0.000040122413,0.000064509135,0.00016406528,0.000030056968,0.00013075283,0.0018871563,0.0012465941,0.0016068376,0.4619857,0.000037619855,0.5327409],"study_design_scores_gemma":[0.00063779025,0.00065059133,0.00003323191,0.00012224649,0.000009527766,0.000106604515,7.5167833e-7,0.08033832,0.0008277108,0.9098297,0.0067018215,0.0007417549],"about_ca_topic_score_codex":0.000025262565,"about_ca_topic_score_gemma":0.000067572255,"teacher_disagreement_score":0.5319992,"about_ca_system_score_codex":0.00013238762,"about_ca_system_score_gemma":0.00025817062,"threshold_uncertainty_score":0.9997199},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000025984493,0.00015489581,0.9967215,0.0005379915,0.0015809905,0.0003040599,0.000016596,0.00018644777,0.00049494306],"genre_scores_gemma":[0.008276953,0.000039515617,0.9898577,0.0014736018,0.00023177167,0.000013534243,0.000030493444,0.00003171661,0.000044745095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698526,0.00014272514,0.00028900307,0.001295833,0.00090040197,0.00038680845],"domain_scores_gemma":[0.9976094,0.0010597135,0.0002522261,0.00082299986,0.00015348307,0.00010222754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013907264,0.00038562622,0.00035559566,0.0008443676,0.00047048426,0.00045484584,0.0010220651,0.00024411998,0.00004311586],"category_scores_gemma":[0.00023743488,0.00037910638,0.00007433946,0.00081215886,0.0001899993,0.00050272985,0.00045263369,0.00068637024,0.0000023177133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030814767,0.000009867172,0.000018399958,0.00001074753,0.0000023805962,0.00000941131,0.00009064006,0.53736603,0.00001269338,0.0010421216,0.000002688736,0.46143192],"study_design_scores_gemma":[0.00022387975,0.0002432423,0.00006582414,0.00007011661,0.0000038059302,0.000016514541,8.052486e-8,0.96248186,0.0006783698,0.033818197,0.0020004937,0.00039764357],"about_ca_topic_score_codex":0.000025411366,"about_ca_topic_score_gemma":0.000020267804,"teacher_disagreement_score":0.46103427,"about_ca_system_score_codex":0.00026900877,"about_ca_system_score_gemma":0.00023795306,"threshold_uncertainty_score":0.99986607},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003443918,0.00084852,0.9924845,0.0019515238,0.0030714315,0.0008094321,0.0000593849,0.00017853214,0.0005622533],"genre_scores_gemma":[0.101798736,0.00010445747,0.8960608,0.000573417,0.00066619646,0.00017580308,0.000050405048,0.000088790875,0.00048135448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99543,0.00009415948,0.00076104555,0.0019726013,0.0010715566,0.00067064306],"domain_scores_gemma":[0.9960632,0.0006670109,0.0008052487,0.001501693,0.00083052006,0.00013236579],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009201793,0.0005663939,0.0007307349,0.0012320488,0.00047217097,0.00019515712,0.0034702288,0.000431699,0.000033824846],"category_scores_gemma":[0.00010044471,0.00056602573,0.0001967292,0.0012585978,0.0008942414,0.00048945047,0.0010872307,0.00091588584,0.0000044643907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031530188,0.000045801113,0.000019769956,0.000097284945,0.000027593362,0.000015284553,0.0006894282,0.0039000225,0.007112208,0.01698767,0.00024459435,0.97082883],"study_design_scores_gemma":[0.0010370716,0.0013241905,0.002180325,0.00030586863,0.000060826686,0.0007997265,0.0000018795416,0.76556975,0.017191118,0.19469756,0.015182889,0.0016487829],"about_ca_topic_score_codex":0.00013385616,"about_ca_topic_score_gemma":0.00015245212,"teacher_disagreement_score":0.96918005,"about_ca_system_score_codex":0.0014222328,"about_ca_system_score_gemma":0.0011917197,"threshold_uncertainty_score":0.99967915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015493645,0.0004403266,0.9843452,0.0018188878,0.0027508647,0.0005731295,0.000009509136,0.00014449959,0.008368225],"genre_scores_gemma":[0.9467379,0.00006325349,0.04906989,0.0034674811,0.000395918,0.00002241204,0.0000031943293,0.000055581724,0.0001843826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952921,0.000117517506,0.00068153883,0.0014932943,0.0016960071,0.0007195073],"domain_scores_gemma":[0.9933904,0.0030242077,0.00049910805,0.0027527548,0.0002022867,0.00013127338],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015588251,0.0005565532,0.000569152,0.0008211725,0.0005426519,0.0002927768,0.0061958646,0.0002477346,0.00022064618],"category_scores_gemma":[0.00024495894,0.00042241262,0.0002099133,0.0014156121,0.001163081,0.00030034658,0.0026734362,0.001757522,0.000028819435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008348013,0.00007830096,0.000007854842,0.000023384859,0.000013336968,0.0011118469,0.0018753732,0.2310726,0.000024542302,0.553675,0.00010360235,0.21200581],"study_design_scores_gemma":[0.00022886108,0.0004474103,0.000012378249,0.00028335102,0.000009900478,0.0010816325,9.870697e-7,0.7882826,0.0005726218,0.20629783,0.002048707,0.000733762],"about_ca_topic_score_codex":0.000048441438,"about_ca_topic_score_gemma":0.000051912997,"teacher_disagreement_score":0.9451885,"about_ca_system_score_codex":0.00030507648,"about_ca_system_score_gemma":0.00040119485,"threshold_uncertainty_score":0.9998228},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057590456,0.00036741578,0.9862264,0.00056427217,0.005223498,0.00023314383,0.0000047743483,0.00022815286,0.007094775],"genre_scores_gemma":[0.030330878,0.000070749826,0.966489,0.0018915664,0.000553424,0.000008773819,0.000007556288,0.000043789754,0.00060425466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635446,0.00003762308,0.00046846303,0.0015396065,0.0009933261,0.0006065498],"domain_scores_gemma":[0.9979794,0.0002156639,0.00029177457,0.0012082154,0.00014329555,0.00016162057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046206528,0.00045356114,0.0004149588,0.0008134034,0.0005540305,0.0004095559,0.0026745265,0.00014077789,0.0003235202],"category_scores_gemma":[0.00006314576,0.000432724,0.000111368325,0.0006176791,0.0005460605,0.0013980325,0.0019594347,0.0011527417,0.0000332939],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026084265,0.0000033595747,0.0000365711,0.000008119104,0.0000036979113,0.000056232224,0.0002131372,0.0144910365,0.00008938686,0.013476342,0.00001060868,0.9716089],"study_design_scores_gemma":[0.00023755945,0.00011642399,0.00010345469,0.00012013313,0.0000041376466,0.0006098887,1.888334e-7,0.8497568,0.00032396583,0.14027558,0.0077754674,0.0006764163],"about_ca_topic_score_codex":0.000017456437,"about_ca_topic_score_gemma":0.000017308641,"teacher_disagreement_score":0.9709325,"about_ca_system_score_codex":0.00048258263,"about_ca_system_score_gemma":0.00043289177,"threshold_uncertainty_score":0.9998125},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007965136,0.00014240395,0.99460876,0.0009380331,0.0011283869,0.00049106777,0.00006455872,0.0012004625,0.0013466773],"genre_scores_gemma":[0.052391343,0.000030364512,0.9443988,0.0022595148,0.0002644955,0.00002223603,0.00014863176,0.00007977612,0.00040482415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941815,0.0001524127,0.0006686438,0.0025540038,0.0015068137,0.0009366323],"domain_scores_gemma":[0.9958099,0.0009435397,0.0005264606,0.002180225,0.00031150924,0.00022836158],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012927202,0.00080616167,0.0007528285,0.0014402,0.0005667658,0.00060907565,0.0056830957,0.0003424902,0.0000593611],"category_scores_gemma":[0.00035800654,0.000818413,0.00020968937,0.0010279901,0.0008590145,0.0008377977,0.004307622,0.0024365871,0.00003473505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015433727,0.00017222961,0.00014146646,0.000048904258,0.000024408882,0.0007893531,0.0010629963,0.061711866,0.00035268458,0.014239197,0.00012440453,0.92131704],"study_design_scores_gemma":[0.00046699328,0.0005898488,0.00021076278,0.00045669227,0.000013815133,0.000106829866,7.1590193e-7,0.9679132,0.0029473354,0.010978345,0.015013591,0.0013018596],"about_ca_topic_score_codex":0.0001862045,"about_ca_topic_score_gemma":0.00020903014,"teacher_disagreement_score":0.9200152,"about_ca_system_score_codex":0.0007413871,"about_ca_system_score_gemma":0.0010799034,"threshold_uncertainty_score":0.9998648},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011225997,0.00002303892,0.99421483,0.00049514894,0.0012455017,0.0015281517,0.000013732695,0.00035701387,0.000999967],"genre_scores_gemma":[0.38074073,0.0000061116016,0.6155217,0.0031044378,0.0002819099,0.00016682142,0.000028701872,0.00007213679,0.00007741858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99539155,0.00012713631,0.0005892832,0.0020636055,0.0012383327,0.0005900946],"domain_scores_gemma":[0.99639773,0.0007475256,0.00029064956,0.0020684584,0.00027598525,0.00021965589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014186972,0.00056113617,0.0005607706,0.0011785654,0.00052182295,0.00068946794,0.0033538628,0.00018985882,0.00015638236],"category_scores_gemma":[0.000093784394,0.0005455418,0.00018710364,0.0007647499,0.00016224862,0.0005553966,0.0003856573,0.0005324956,0.000043046224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005633134,0.0008600366,0.00016333991,0.00005622844,0.000049210106,0.0000749119,0.0019718572,0.06861929,0.00019120175,0.0019487818,0.0000141575565,0.92599463],"study_design_scores_gemma":[0.0007754933,0.001347855,0.00037644434,0.000061918756,0.00003040761,0.000015307325,0.0000021118312,0.9901259,0.00044003237,0.0054937084,0.0006674683,0.0006633308],"about_ca_topic_score_codex":0.000015430833,"about_ca_topic_score_gemma":0.00016819719,"teacher_disagreement_score":0.9253313,"about_ca_system_score_codex":0.0005210024,"about_ca_system_score_gemma":0.00043476833,"threshold_uncertainty_score":0.9996996},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014091133,0.00035593627,0.9968248,0.00035054926,0.00044847446,0.00045944416,0.000008467201,0.00003256043,0.00011062445],"genre_scores_gemma":[0.8864786,0.000058655478,0.11243481,0.00045567114,0.00038924476,0.000051747502,0.000014892757,0.000018244702,0.00009814264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853677,0.000021910248,0.0003003582,0.0006077055,0.00034078496,0.00019250202],"domain_scores_gemma":[0.99905056,0.00025531466,0.000151486,0.00035113026,0.00014222224,0.000049316088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005209098,0.00018660318,0.0002168599,0.00031106538,0.00071739376,0.00022291587,0.0005261392,0.00008749623,0.000016830796],"category_scores_gemma":[0.000042290765,0.0001515401,0.000043977798,0.00015538701,0.0002470289,0.00035346957,0.0004229626,0.0002956052,5.7787014e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004628133,0.000022085462,0.0000018440519,0.0000381695,0.000014842501,0.0000018958023,0.0010692157,0.30769503,0.001242704,0.026789336,0.000008658014,0.6631116],"study_design_scores_gemma":[0.00021809811,0.00011975359,0.0000104849,0.000054651115,0.000013907612,0.00002263325,3.5963345e-7,0.95089144,0.00014048329,0.04828961,0.00007867453,0.00015989518],"about_ca_topic_score_codex":0.000014415526,"about_ca_topic_score_gemma":0.00006206025,"teacher_disagreement_score":0.8850695,"about_ca_system_score_codex":0.00005694977,"about_ca_system_score_gemma":0.0001010381,"threshold_uncertainty_score":0.61796254},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005737995,0.00020568982,0.98874027,0.00030515017,0.0034876822,0.0006661957,0.0000016349799,0.00064100616,0.0053785797],"genre_scores_gemma":[0.02564815,0.0000889884,0.97285897,0.000616887,0.00042298783,0.000032025488,0.000006254052,0.00004419884,0.00028154004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99509865,0.000076508215,0.0008399254,0.0018419246,0.0014007823,0.0007421944],"domain_scores_gemma":[0.9973664,0.00013972213,0.0006732287,0.0014272261,0.0002840547,0.000109322245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015555097,0.0005662828,0.000492131,0.0012114416,0.00065964076,0.00061017164,0.0027597013,0.00021781446,0.00016177312],"category_scores_gemma":[0.000049965507,0.0006033942,0.00016064772,0.0008389904,0.00026907068,0.0015593909,0.0023119096,0.00086714595,0.000024475736],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040677683,0.00006834716,0.00005366835,0.00007819518,0.000031602412,0.00009229897,0.0006903561,0.004399052,0.018883409,0.014593708,0.00005117182,0.96105415],"study_design_scores_gemma":[0.00035501053,0.00031003304,0.000024611123,0.0007441793,0.000028990491,0.00045399638,4.4801837e-7,0.85925287,0.067668326,0.06610065,0.00367841,0.0013824971],"about_ca_topic_score_codex":0.000034734687,"about_ca_topic_score_gemma":0.000009515829,"teacher_disagreement_score":0.9596716,"about_ca_system_score_codex":0.0016857765,"about_ca_system_score_gemma":0.000559031,"threshold_uncertainty_score":0.9996417},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009141075,0.0019274716,0.99332213,0.0005767516,0.0015558967,0.00040187815,0.0000064050414,0.0004260126,0.0008693619],"genre_scores_gemma":[0.6332409,0.00006064875,0.3644453,0.0010960941,0.00035416495,0.00005969312,0.00001267932,0.00009187211,0.0006386617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557704,0.000032849,0.00028991603,0.0015272155,0.0017795309,0.00079346925],"domain_scores_gemma":[0.9963328,0.0014329721,0.0001244134,0.0016790725,0.00024804936,0.00018265989],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064573,0.0004930911,0.00042876616,0.0009212049,0.00025203242,0.00043671235,0.004550271,0.00015921395,0.00009243589],"category_scores_gemma":[0.00021400125,0.00042325593,0.00008098206,0.0014168706,0.00035526638,0.00086424017,0.0023236556,0.0015771355,0.000037121707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022549028,0.000052536485,0.00037049828,0.00008905134,0.00003709503,0.0009671418,0.003424894,0.5665096,0.000050016417,0.0116183795,0.00009572218,0.4167625],"study_design_scores_gemma":[0.00034467052,0.0004303693,0.00025726287,0.00026657648,0.000009124842,0.00019443125,6.8784567e-7,0.9860923,0.00045260892,0.008378984,0.0025284397,0.0010445124],"about_ca_topic_score_codex":0.00009183267,"about_ca_topic_score_gemma":0.000072375355,"teacher_disagreement_score":0.6323268,"about_ca_system_score_codex":0.0005246325,"about_ca_system_score_gemma":0.0006815769,"threshold_uncertainty_score":0.9998219},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000488899,0.00042523575,0.99366504,0.001972429,0.0012644257,0.0008566292,0.0000073920046,0.00066748407,0.0006524745],"genre_scores_gemma":[0.32105863,0.000028095765,0.67766774,0.00068406726,0.000248875,0.000084081985,0.000025427504,0.00005215504,0.00015093324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954657,0.0000762011,0.00072846643,0.0020592934,0.00078102725,0.00088928983],"domain_scores_gemma":[0.99710274,0.0007961997,0.00025967974,0.001515622,0.00021715631,0.00010858783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017562415,0.0005197132,0.00061569567,0.001121188,0.00043673368,0.00039791834,0.003348605,0.00035586918,0.00011225183],"category_scores_gemma":[0.00031380737,0.0005679639,0.00016399528,0.0014174223,0.00085482333,0.0008655181,0.0022408126,0.0011699247,0.0000322599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013650828,0.000053242085,0.000041878,0.00008696548,0.000012116029,0.000027469356,0.00017016102,0.31287864,0.000034666387,0.04670943,0.000031813088,0.63993996],"study_design_scores_gemma":[0.00027276177,0.00012769773,0.000055423003,0.00015949333,0.0000063482094,0.000012660087,5.5983855e-7,0.8294386,0.000096533506,0.16824798,0.0011116326,0.00047027622],"about_ca_topic_score_codex":0.0000073968968,"about_ca_topic_score_gemma":0.0000488051,"teacher_disagreement_score":0.6394697,"about_ca_system_score_codex":0.00075027766,"about_ca_system_score_gemma":0.00049872615,"threshold_uncertainty_score":0.9996772},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014966516,0.0005305026,0.9917684,0.0013246861,0.0023553402,0.00021960703,0.0000037229047,0.00028685245,0.0034959132],"genre_scores_gemma":[0.030589892,0.000036357043,0.96113193,0.0072130677,0.00032903414,0.000015462572,0.000009108353,0.000058474918,0.000616693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995934,0.0000424671,0.00046105284,0.0016446867,0.0011525038,0.0007652697],"domain_scores_gemma":[0.99766755,0.00023240274,0.0002508323,0.0015424758,0.00011636158,0.00019039371],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005600037,0.0004966227,0.00044323472,0.0007963116,0.0005276789,0.00051445904,0.003594058,0.00011836959,0.00017462767],"category_scores_gemma":[0.000052942825,0.00048599616,0.00015208195,0.00074522005,0.00035316285,0.0009168062,0.0021426224,0.0009782888,0.000021650276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028255158,0.000014744372,0.000033672983,0.00001659665,0.000002808034,0.00013871338,0.0001589872,0.39349467,0.00015068229,0.007591181,0.00003745266,0.5983577],"study_design_scores_gemma":[0.00022906484,0.00009487288,0.00001722511,0.00008850654,0.0000026726689,0.00004524757,8.9055575e-8,0.94862515,0.0007243049,0.03320462,0.016408894,0.0005593269],"about_ca_topic_score_codex":0.000040821957,"about_ca_topic_score_gemma":0.000022350661,"teacher_disagreement_score":0.59779835,"about_ca_system_score_codex":0.00039486936,"about_ca_system_score_gemma":0.00045206823,"threshold_uncertainty_score":0.9997592},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004043184,0.00021061378,0.99201256,0.00095112214,0.0009914302,0.00020797229,0.00005293097,0.00013474755,0.00539817],"genre_scores_gemma":[0.4340395,0.00043002504,0.5473748,0.011930102,0.0013136979,0.00002867071,0.0013235473,0.00013102233,0.0034286275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934252,0.000069838614,0.0006918897,0.0028744652,0.0022832842,0.0006553351],"domain_scores_gemma":[0.9935822,0.00031192804,0.000435685,0.0053177285,0.0001660369,0.00018640637],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0022672135,0.000505781,0.00081807206,0.0023819732,0.0005386532,0.00065885606,0.0076813013,0.00021062928,0.00043973443],"category_scores_gemma":[0.000090304,0.00046686112,0.00028889705,0.003435912,0.00020779845,0.0010167733,0.0050813276,0.0008352206,0.00002974947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009467379,0.000139045,0.0017425731,0.000019589856,0.00021660967,0.00025680708,0.0008348042,0.41947597,0.000012122422,0.033868525,0.0002616242,0.5431629],"study_design_scores_gemma":[0.00013660699,0.00007801227,0.00063723314,0.000046381625,0.00013801428,0.000007956994,2.3732392e-7,0.9605083,0.00003253284,0.019155502,0.018702341,0.000556899],"about_ca_topic_score_codex":0.00003976012,"about_ca_topic_score_gemma":0.0004860619,"teacher_disagreement_score":0.542606,"about_ca_system_score_codex":0.00028007766,"about_ca_system_score_gemma":0.0004101725,"threshold_uncertainty_score":0.99977833},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044516964,0.0003122718,0.9901158,0.0023684858,0.0022089505,0.00068575185,0.0000332348,0.00014607456,0.0040848874],"genre_scores_gemma":[0.082887456,0.000034436056,0.91361916,0.00254618,0.000617757,0.000018176452,0.000021278545,0.00005577538,0.00019977009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99530894,0.00011070897,0.0006114293,0.0019566098,0.0012464698,0.0007658681],"domain_scores_gemma":[0.99729246,0.00041241033,0.0002217944,0.0015291346,0.00027235286,0.00027185408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068995677,0.00065819174,0.00063262146,0.00087055756,0.00054575136,0.0008665989,0.0032536553,0.00020367914,0.00046496384],"category_scores_gemma":[0.00007871288,0.0006268066,0.00022597432,0.00094670494,0.00044626472,0.0010643983,0.0012669825,0.000842659,0.000047653713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017435483,0.000032534175,0.000009252532,0.000031373056,0.000030841056,0.0001203378,0.0015514337,0.17058349,0.007582563,0.0046055885,0.00017424849,0.8152609],"study_design_scores_gemma":[0.00056623545,0.00036482356,0.00015584704,0.00015376807,0.000030937783,0.00006687525,6.42068e-7,0.9156215,0.007970792,0.05613608,0.017455166,0.0014773017],"about_ca_topic_score_codex":0.00003782547,"about_ca_topic_score_gemma":0.00010904909,"teacher_disagreement_score":0.8137836,"about_ca_system_score_codex":0.00036211306,"about_ca_system_score_gemma":0.0004768604,"threshold_uncertainty_score":0.99961835},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015893254,0.000252251,0.95632553,0.036335837,0.0026660438,0.000684786,0.000015735384,0.0010036277,0.0025572674],"genre_scores_gemma":[0.09092097,0.00006842949,0.89889884,0.007283269,0.00049099996,0.00008824308,0.00009575319,0.0001426317,0.0020108586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9916522,0.00016455025,0.00087441894,0.0030569558,0.002555811,0.0016960748],"domain_scores_gemma":[0.9908491,0.00085600844,0.00035695193,0.007248847,0.00045099435,0.00023809333],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0041987794,0.00081703643,0.0008413474,0.0018594519,0.00072908285,0.0013240285,0.040859107,0.0006745237,0.00013300651],"category_scores_gemma":[0.007578083,0.0008387227,0.00014667053,0.002578294,0.0004523172,0.00114024,0.14890538,0.004372768,0.000071247065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027500872,0.000097615026,0.00091249886,0.00003905327,0.000021586675,0.00043519906,0.0011646039,0.5673111,0.000033006418,0.0021652165,0.0115000885,0.41629255],"study_design_scores_gemma":[0.00039396837,0.0001847203,0.0002051146,0.0002155191,0.000004112967,0.00005918825,0.0000011053172,0.89070594,0.00008546715,0.06790864,0.039349873,0.0008863602],"about_ca_topic_score_codex":0.000071399256,"about_ca_topic_score_gemma":0.0005649899,"teacher_disagreement_score":0.4154062,"about_ca_system_score_codex":0.0010058186,"about_ca_system_score_gemma":0.0005186394,"threshold_uncertainty_score":0.9997127},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013370056,0.0004766932,0.9880873,0.00028580698,0.0017654927,0.00043249782,0.000011585104,0.0010384957,0.006565128],"genre_scores_gemma":[0.8276491,0.00005503131,0.17083098,0.0004627177,0.00044101587,0.000053426327,0.000019098949,0.00013482885,0.0003537696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978507,0.000010013247,0.00042589149,0.0007558996,0.00031047684,0.0006469815],"domain_scores_gemma":[0.9987227,0.00046210867,0.00010985635,0.0005940643,0.000041485102,0.00006982599],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079530576,0.0004104887,0.00048202675,0.00054913375,0.00043545492,0.000079349564,0.0011854038,0.0004697394,0.00010120358],"category_scores_gemma":[0.00006250242,0.00045703622,0.00013550192,0.00023303836,0.00040081667,0.00018735956,0.00038848774,0.0014965563,0.000007173933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029192888,0.0000038096596,0.0000152040775,0.00004243051,0.000019185263,0.000031799635,0.0021762466,0.28048092,0.00016269664,0.012090691,0.0000086595,0.7049654],"study_design_scores_gemma":[0.00023727781,0.00010907544,0.000047857062,0.0001724922,0.000017149407,0.00006433528,8.6900263e-7,0.7885245,0.0008429489,0.19841576,0.010861966,0.00070575497],"about_ca_topic_score_codex":0.0000034886398,"about_ca_topic_score_gemma":0.000051064,"teacher_disagreement_score":0.8263121,"about_ca_system_score_codex":0.00055618206,"about_ca_system_score_gemma":0.00025489606,"threshold_uncertainty_score":0.99978817},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028741268,0.00013224347,0.9686652,0.0012014111,0.0007903108,0.00023538423,0.000008697909,0.00017927005,0.000046249723],"genre_scores_gemma":[0.5543458,0.0000026341588,0.44303602,0.00239808,0.00012861064,0.000039376413,0.000008113446,0.000013446913,0.000027944096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967233,0.00011992717,0.0002516652,0.0011395762,0.0011210452,0.0006445076],"domain_scores_gemma":[0.99816316,0.00025959616,0.000121559795,0.0012578487,0.00007161605,0.00012622554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076610164,0.00024260109,0.00024458938,0.00031624167,0.0009401664,0.0003418955,0.0031819683,0.00004078023,0.000083844],"category_scores_gemma":[0.000027385015,0.00019280198,0.00004755355,0.002301112,0.00027269026,0.00093910255,0.0049734935,0.00039814797,0.0000495252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005423307,0.00024615804,0.001956606,0.000015397576,0.000011735216,0.0004102489,0.0024011084,0.29522833,0.0035674719,0.00051338854,0.0013330997,0.6942622],"study_design_scores_gemma":[0.00044484073,0.0003766382,0.0022665034,0.00002875835,0.000002319394,0.0003045883,6.787301e-7,0.9867721,0.0016847949,0.0022603702,0.00547337,0.0003850436],"about_ca_topic_score_codex":0.00006180158,"about_ca_topic_score_gemma":0.000020339505,"teacher_disagreement_score":0.6938772,"about_ca_system_score_codex":0.0003498943,"about_ca_system_score_gemma":0.0003294839,"threshold_uncertainty_score":0.78622365},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019101019,0.00015935466,0.99497354,0.0005761282,0.0020346271,0.0012582728,0.000015616619,0.00030403456,0.0004874146],"genre_scores_gemma":[0.15150405,0.000067609166,0.8452247,0.0016139788,0.00083378435,0.0002481462,0.000017678743,0.00007822931,0.00041186076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996187,0.000038343635,0.00048014015,0.0018624166,0.0007740123,0.00065814017],"domain_scores_gemma":[0.9972244,0.00072066335,0.00028291202,0.0013953208,0.00021794083,0.00015879209],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005206357,0.0004950833,0.00042086153,0.00062021933,0.0009202651,0.0002897989,0.002615474,0.00021859736,0.000029963701],"category_scores_gemma":[0.00008489666,0.0004861188,0.00017164492,0.00088412495,0.00031666819,0.000640782,0.001544142,0.0008135767,0.000020361196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011200326,0.000023125167,0.0000057909206,0.0000169192,0.0000056642575,0.000014284127,0.00024361104,0.19767134,0.0024878548,0.008375778,0.000012091243,0.79113233],"study_design_scores_gemma":[0.0003510466,0.00028939778,0.00003407116,0.000054265794,0.000008362881,0.000074263655,2.2747022e-7,0.92498094,0.0075983433,0.049425166,0.016479457,0.0007044801],"about_ca_topic_score_codex":0.00001638702,"about_ca_topic_score_gemma":0.00007542656,"teacher_disagreement_score":0.79042786,"about_ca_system_score_codex":0.0005400056,"about_ca_system_score_gemma":0.00028757894,"threshold_uncertainty_score":0.999759},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042689292,0.0007035353,0.99271095,0.0010282854,0.0034086618,0.0004566,0.000016879989,0.00014374337,0.0011044324],"genre_scores_gemma":[0.5989506,0.00025156856,0.39354992,0.0043936647,0.0015113202,0.000105489526,0.000022487196,0.00011027302,0.001104691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954521,0.000062939325,0.0005193721,0.0016794788,0.0017316756,0.0005544458],"domain_scores_gemma":[0.99806184,0.00015616657,0.00025887357,0.00091651035,0.00033051794,0.00027610184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012011423,0.00050445047,0.00046300224,0.00074408686,0.00041110095,0.0007744256,0.0028061268,0.00015328177,0.00009024201],"category_scores_gemma":[0.0001282489,0.0004534102,0.00008843582,0.00038005758,0.00019941585,0.00100412,0.0049404013,0.00083125586,0.000023989129],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006829203,0.000057091103,0.00007769976,0.00007121935,0.000035442896,0.00015654769,0.0019280717,0.008683524,0.001819899,0.025959112,0.00027573717,0.96086735],"study_design_scores_gemma":[0.0010782295,0.0018915581,0.0010126744,0.0017188614,0.00002674613,0.0006814143,0.0000029267114,0.841609,0.0063527087,0.057129562,0.08629289,0.002203401],"about_ca_topic_score_codex":0.00016512381,"about_ca_topic_score_gemma":0.00019682295,"teacher_disagreement_score":0.95866394,"about_ca_system_score_codex":0.0005690764,"about_ca_system_score_gemma":0.0003479253,"threshold_uncertainty_score":0.99979174},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049403966,0.00014375428,0.9907065,0.00010380418,0.00041529656,0.00021458066,0.000014024105,0.00022909204,0.0032325776],"genre_scores_gemma":[0.96672744,0.000026367847,0.032884035,0.00014058336,0.00012461498,0.000011706954,0.000016176004,0.000032966942,0.000036098107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885654,0.00002104157,0.00020402033,0.00037472905,0.00036551568,0.00017812056],"domain_scores_gemma":[0.9994707,0.00015254668,0.000058155325,0.00022398085,0.00003241186,0.0000621649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020466429,0.00021804056,0.00021367634,0.0003603907,0.00019072287,0.00010970156,0.0002656255,0.000112318565,0.00043712792],"category_scores_gemma":[0.000023383702,0.00021978491,0.000044559103,0.00011252792,0.0001662631,0.00017023484,0.00008191783,0.0003642831,0.0000095169435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048971824,0.000013382366,0.000053287367,0.00016635635,0.0000062239765,0.0000089767955,0.000525912,0.8122281,0.0028594055,0.0017179823,0.000034331897,0.18238114],"study_design_scores_gemma":[0.000103052625,0.00003465532,0.00086324726,0.00019070489,0.0000067220553,0.000004852705,2.3661582e-7,0.9936057,0.0014022841,0.0024235111,0.0011072768,0.00025779032],"about_ca_topic_score_codex":0.0000041020066,"about_ca_topic_score_gemma":0.000022695942,"teacher_disagreement_score":0.96178705,"about_ca_system_score_codex":0.00020241785,"about_ca_system_score_gemma":0.000046499117,"threshold_uncertainty_score":0.89625686},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021344376,0.00038969886,0.99107456,0.0011217775,0.0019559178,0.00069646764,0.00003459902,0.000721657,0.0039839856],"genre_scores_gemma":[0.0029165163,0.00003363095,0.9928678,0.003031665,0.0005810216,0.00007068527,0.000021916743,0.00006168643,0.0004150465],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948273,0.00013177472,0.00060636597,0.0023735722,0.0012777869,0.00078324],"domain_scores_gemma":[0.9960984,0.0013271262,0.00037996337,0.0016489837,0.00024785075,0.00029770398],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019965111,0.00068613177,0.00071498484,0.0014685664,0.00056553714,0.0010518404,0.004027377,0.00045621826,0.0001942526],"category_scores_gemma":[0.00033257346,0.0007099293,0.00023149334,0.0011952721,0.00027075873,0.0009812295,0.002708983,0.0019689745,0.000043943553],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057636785,0.00001722412,0.0000017935482,0.000012576927,0.00001153638,0.0001356224,0.00042177955,0.00093527226,0.020436028,0.0016299414,0.00007475169,0.9763177],"study_design_scores_gemma":[0.00089342805,0.00088415155,0.0002845183,0.0013731306,0.000055674605,0.0006845524,0.0000016216449,0.15131387,0.2506444,0.4776451,0.11235076,0.003868801],"about_ca_topic_score_codex":0.00016259633,"about_ca_topic_score_gemma":0.00016378237,"teacher_disagreement_score":0.9724489,"about_ca_system_score_codex":0.0007080697,"about_ca_system_score_gemma":0.00037805914,"threshold_uncertainty_score":0.99998516},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035436468,0.0004347832,0.9592337,0.0013158052,0.002731353,0.0003396357,0.000026799233,0.0001385155,0.03223575],"genre_scores_gemma":[0.7759623,0.0015968147,0.17647052,0.0054683867,0.0021215128,0.00004039269,0.00026519393,0.000086235166,0.037988648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989252,0.000040123276,0.00016477153,0.00042148237,0.00023285052,0.00021557725],"domain_scores_gemma":[0.99944264,0.00021585874,0.00009903455,0.00013300673,0.000038731378,0.00007073282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006248257,0.00011493653,0.0001468493,0.0002597816,0.00028888043,0.00019188589,0.00044408787,0.00011100076,0.00014616153],"category_scores_gemma":[0.00004608049,0.00012540871,0.0000245752,0.00024920597,0.0005574704,0.00017140889,0.000074111296,0.00029268704,0.000003791579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015091502,0.00003148816,0.0047135404,0.00003953239,0.000013142174,0.000030749732,0.04729497,0.46884456,0.0000023479015,0.020172557,0.0014169445,0.4574251],"study_design_scores_gemma":[0.0005957419,0.00017332601,0.0018113387,0.00021622707,0.000025852787,0.000010919077,0.000022155942,0.39111355,0.000024194196,0.06599269,0.53891915,0.0010948374],"about_ca_topic_score_codex":0.00014538012,"about_ca_topic_score_gemma":0.0017983005,"teacher_disagreement_score":0.7827632,"about_ca_system_score_codex":0.00027780744,"about_ca_system_score_gemma":0.0011593474,"threshold_uncertainty_score":0.5114019},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010658179,0.0005745848,0.99073786,0.0033983013,0.0021860958,0.0010610298,0.0008002559,0.00037243028,0.00076286786],"genre_scores_gemma":[0.070417,0.00010372382,0.92216325,0.0047890255,0.0012204166,0.00015399134,0.0009849364,0.000117898635,0.00004978133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99348044,0.00008758533,0.0007585241,0.002663993,0.0016692947,0.0013401818],"domain_scores_gemma":[0.99510854,0.0007509435,0.00048628848,0.0028391741,0.00039437017,0.00042067486],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011322757,0.0009227742,0.0008675143,0.0013904702,0.00091078295,0.001431153,0.0076166326,0.0005354098,0.00021655145],"category_scores_gemma":[0.00024332153,0.00088391843,0.0004649101,0.0019103762,0.0008600059,0.001280712,0.004194894,0.0020319952,0.000010092794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003833204,0.00011120982,0.0001558626,0.00018796865,0.00007520048,0.0000722503,0.0016954506,0.018461186,0.00006359022,0.59833616,0.000728293,0.38007453],"study_design_scores_gemma":[0.0006981827,0.00035619808,0.00038402493,0.00014097037,0.000023736982,0.00011117328,4.822309e-7,0.055559527,0.00014614087,0.7248954,0.21642251,0.0012616633],"about_ca_topic_score_codex":0.000032510772,"about_ca_topic_score_gemma":0.0002773726,"teacher_disagreement_score":0.37881285,"about_ca_system_score_codex":0.0004129406,"about_ca_system_score_gemma":0.000996187,"threshold_uncertainty_score":0.9996055},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031072006,0.00011874871,0.98914564,0.0003319299,0.0010420907,0.0016680564,0.000038087925,0.00017220456,0.0043760263],"genre_scores_gemma":[0.32762054,0.000030793788,0.67060554,0.000821221,0.00034772712,0.00031429855,0.000029648181,0.0000661184,0.00016409022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962498,0.00008471597,0.00037756393,0.0014675529,0.0013261794,0.0004941721],"domain_scores_gemma":[0.997351,0.0007425577,0.00040671218,0.0006913022,0.00064563495,0.00016282422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021961844,0.00046353354,0.00051078975,0.00071543746,0.00053067104,0.00071219023,0.0011668174,0.00021357427,0.00010266922],"category_scores_gemma":[0.0001906726,0.00040785776,0.00009888218,0.0004406235,0.00029712848,0.0012675336,0.00051976764,0.0004938811,0.000023313758],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039626135,0.000016388047,0.000004421893,0.00009836348,0.000017147717,0.000016658943,0.00023363727,0.000110361325,0.00048734457,0.00040347935,0.000009369009,0.99856323],"study_design_scores_gemma":[0.0019369558,0.0010742978,0.00017588181,0.001071467,0.00014122784,0.00091244024,0.00000588352,0.8680178,0.10057294,0.020938346,0.0034048632,0.0017478995],"about_ca_topic_score_codex":0.000047500504,"about_ca_topic_score_gemma":0.00012668838,"teacher_disagreement_score":0.9968153,"about_ca_system_score_codex":0.000654576,"about_ca_system_score_gemma":0.00062298373,"threshold_uncertainty_score":0.99983734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016058965,0.00030575122,0.9923078,0.0013811105,0.00078030094,0.00026692468,0.000002415253,0.00019928643,0.00459585],"genre_scores_gemma":[0.6138784,0.00011302823,0.38259423,0.0008755831,0.000779154,0.000034998524,0.000017298486,0.000096525975,0.0016107765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672455,0.00015823425,0.00048560568,0.0009679478,0.0011303012,0.0005333768],"domain_scores_gemma":[0.9972114,0.0011179858,0.0003341215,0.0011814137,0.00007285334,0.000082224535],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019789902,0.00036362893,0.00038667134,0.0003336421,0.0012169936,0.00042289737,0.004080714,0.000118361175,0.000031602453],"category_scores_gemma":[0.00021566315,0.00024203217,0.00014378734,0.0008690623,0.0005780273,0.00030050537,0.0026104287,0.0028048046,0.000004471557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028909467,0.000030607316,0.000018825715,0.000032145897,0.000021611268,0.000009238016,0.003012984,0.6087129,0.0010065208,0.017981483,0.0000166608,0.36915416],"study_design_scores_gemma":[0.00011860155,0.000097476855,0.000038678983,0.000088791574,0.000007715865,0.00009926635,0.0000026853513,0.98579717,0.00047951416,0.0054610353,0.007508523,0.0003005334],"about_ca_topic_score_codex":0.00010990247,"about_ca_topic_score_gemma":0.000009106606,"teacher_disagreement_score":0.6137178,"about_ca_system_score_codex":0.00014379881,"about_ca_system_score_gemma":0.00028820976,"threshold_uncertainty_score":0.99949574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048144888,0.0003719299,0.97377145,0.0003941231,0.0044734557,0.00040172716,0.0000051899265,0.0002471318,0.02028687],"genre_scores_gemma":[0.30604035,0.001292158,0.638021,0.02460108,0.006981383,0.00036559362,0.00014008796,0.000386142,0.022172201],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996431,0.00006265528,0.00050030596,0.0014466255,0.0009815656,0.0005778515],"domain_scores_gemma":[0.9981271,0.00018980824,0.00031014357,0.0010496823,0.00017273,0.00015052067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008136821,0.00042873065,0.00042091685,0.00078136456,0.00065030047,0.0007741128,0.002190975,0.00020035976,0.000723616],"category_scores_gemma":[0.00004799394,0.00043043462,0.0001362433,0.0007017441,0.00026626664,0.0012853772,0.001331035,0.0009081017,0.0002060884],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029782116,0.000037594105,0.0000012614873,0.000026663765,0.000007636069,0.000059595674,0.00016041682,0.0037819345,0.00030029396,0.0034248438,0.000054773456,0.992142],"study_design_scores_gemma":[0.00062811625,0.00090152735,0.000022699238,0.0006305994,0.00003089857,0.00045856234,4.6339773e-7,0.2876978,0.011879712,0.14874329,0.54710233,0.0019040126],"about_ca_topic_score_codex":0.000025419406,"about_ca_topic_score_gemma":0.00010245622,"teacher_disagreement_score":0.990238,"about_ca_system_score_codex":0.00050285726,"about_ca_system_score_gemma":0.00029887675,"threshold_uncertainty_score":0.99981475},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027846705,0.0013010737,0.9871985,0.0013017184,0.007349785,0.0012323703,0.000044236025,0.00016320767,0.0011306418],"genre_scores_gemma":[0.82822514,0.0017044453,0.14421462,0.018223157,0.0039299903,0.0011450314,0.00013990913,0.00038823785,0.0020294795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951983,0.00014348792,0.00089862937,0.0017571453,0.0009845706,0.0010178671],"domain_scores_gemma":[0.99589723,0.0014860414,0.00044372998,0.0017278267,0.00029700637,0.00014815545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00238318,0.000586716,0.00064974435,0.00086682546,0.0010869823,0.00082505855,0.0040683965,0.00030224098,0.000040126844],"category_scores_gemma":[0.00013859158,0.00046053872,0.00034312363,0.0014019448,0.00044981623,0.0004334723,0.0010548361,0.0010429495,0.0000067858214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000696075,0.000095960466,0.00036637188,0.000109024084,0.000082106395,0.00024686675,0.0057994095,0.03360934,0.00013295405,0.42253682,0.003689717,0.53326184],"study_design_scores_gemma":[0.00059076474,0.00048165148,0.00012921952,0.00024252385,0.000008217558,0.00009984176,0.0000030645588,0.4931536,0.00015720511,0.4015434,0.10268575,0.0009047272],"about_ca_topic_score_codex":0.00022951483,"about_ca_topic_score_gemma":0.0013793997,"teacher_disagreement_score":0.8429839,"about_ca_system_score_codex":0.00039500927,"about_ca_system_score_gemma":0.00041431203,"threshold_uncertainty_score":0.99978465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000523037,0.00026486508,0.99286914,0.000075316326,0.00033754003,0.0002368533,0.000020487792,0.00013810988,0.005534635],"genre_scores_gemma":[0.6955909,0.000010722432,0.30181327,0.00048244404,0.0017904713,0.000015574871,0.00012227318,0.000054693886,0.00011962585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710274,0.000049235827,0.00043122002,0.0013012419,0.00059903495,0.0005165413],"domain_scores_gemma":[0.9979066,0.00024645726,0.0002742149,0.0012937412,0.00014965059,0.00012931626],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005582072,0.00043823902,0.0005452238,0.00027460326,0.0004207516,0.00026364232,0.0014266854,0.00012115014,0.0010305501],"category_scores_gemma":[0.0000054617867,0.00044089463,0.00019536055,0.00034261693,0.00023575727,0.00033585055,0.0009602503,0.0009980969,0.0000069959888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043874697,0.000022680488,0.00040734987,0.0000016660367,0.000016194646,0.0000067773503,0.00011825099,0.7729059,0.00009036281,0.013239863,0.00014591085,0.21304065],"study_design_scores_gemma":[0.00004357168,0.00003415448,0.00006686938,0.00007027529,0.000016571475,5.23698e-7,9.6471936e-8,0.60506994,0.000048036956,0.39375964,0.0005952312,0.0002950867],"about_ca_topic_score_codex":0.00029451156,"about_ca_topic_score_gemma":0.000090982794,"teacher_disagreement_score":0.6950679,"about_ca_system_score_codex":0.00019031952,"about_ca_system_score_gemma":0.00026081532,"threshold_uncertainty_score":0.99988264},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023808017,0.00034810175,0.98366696,0.0012254468,0.0028700603,0.00042871363,0.000027348813,0.0003133917,0.011096184],"genre_scores_gemma":[0.047236342,0.00010230817,0.94551176,0.0053143287,0.00057426316,0.000027721973,0.000037163052,0.00007025436,0.0011258612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951906,0.00007470061,0.00063023064,0.001849337,0.0014599705,0.00079511566],"domain_scores_gemma":[0.99700314,0.00047150374,0.00036780885,0.0017626552,0.00018963494,0.00020526207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010040288,0.00061180384,0.00056381355,0.0011134198,0.0006787424,0.00074081635,0.0043711658,0.00016218719,0.0005563494],"category_scores_gemma":[0.000046060835,0.00062990625,0.00022382586,0.0010529398,0.0011994956,0.0007785041,0.0029541054,0.0012940647,0.000041921587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033823392,0.000032037115,0.00001151852,0.000020871854,0.000012605766,0.00010823517,0.00031759756,0.2006024,0.000040752682,0.56151253,0.000018766515,0.2373193],"study_design_scores_gemma":[0.00039075536,0.00012592056,0.000033474393,0.00009972032,0.0000073025853,0.00014782522,7.636509e-7,0.5682377,0.00020758875,0.4217607,0.008213956,0.0007742626],"about_ca_topic_score_codex":0.00006916915,"about_ca_topic_score_gemma":0.00011152319,"teacher_disagreement_score":0.36763534,"about_ca_system_score_codex":0.0004931728,"about_ca_system_score_gemma":0.0007534679,"threshold_uncertainty_score":0.99961525},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002719159,0.0027331046,0.9936766,0.00021510564,0.00096928433,0.0005298497,0.000029808352,0.00007595937,0.001498357],"genre_scores_gemma":[0.015405065,0.00024354963,0.9814894,0.001264924,0.0005669682,0.00003572252,0.00016552258,0.000046690817,0.0007821645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993481,0.00026751208,0.001064388,0.0027879162,0.0016855231,0.0007136663],"domain_scores_gemma":[0.99643326,0.00029990252,0.0008921049,0.0019658557,0.00019704901,0.00021180147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016416631,0.00079508155,0.0014649825,0.002115583,0.00067461364,0.0009367151,0.0035040393,0.00014118892,0.0005342775],"category_scores_gemma":[0.000045228844,0.0007062371,0.0007749398,0.0024426363,0.00038948076,0.0008623964,0.0028056628,0.00084085617,0.000029093624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015820353,0.00032603467,0.00072699256,0.00006418344,0.0017138553,0.00023842062,0.006908425,0.5745019,0.0008090982,0.01904489,0.00045517276,0.39519525],"study_design_scores_gemma":[0.00021293628,0.0000712219,0.000054814034,0.000102116566,0.0004036684,0.0000108707,0.0000017458758,0.9853718,0.00097643246,0.0051423414,0.006796904,0.0008551032],"about_ca_topic_score_codex":0.00018018491,"about_ca_topic_score_gemma":0.000034839304,"teacher_disagreement_score":0.41087,"about_ca_system_score_codex":0.00068506657,"about_ca_system_score_gemma":0.00031819,"threshold_uncertainty_score":0.9995389},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000116022806,0.00008319896,0.9281537,0.0012006155,0.0037164853,0.0006142603,0.000024402005,0.00015083364,0.0659405],"genre_scores_gemma":[0.9351089,0.00007059315,0.05009902,0.004357111,0.0010533504,0.00015092075,0.000022228298,0.000047622332,0.009090271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99425983,0.00009373872,0.00049281836,0.00082387705,0.0035441562,0.00078554684],"domain_scores_gemma":[0.99774945,0.0008005835,0.0002894714,0.00044003397,0.0005422614,0.00017821597],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0036116878,0.00029319053,0.00034805955,0.001984168,0.0046832124,0.00050182693,0.001987927,0.00014518973,0.00035009845],"category_scores_gemma":[0.0001725904,0.00029577847,0.0001251201,0.0038471397,0.005497126,0.00067057926,0.00016242974,0.00082792906,0.00007558101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000092585005,0.00007439723,0.00011767706,0.00003923263,0.000018386223,0.000015664664,0.049310606,0.70132,0.0000025404386,0.023031723,0.00036436945,0.22569613],"study_design_scores_gemma":[0.0016819858,0.0009430646,0.0028160245,0.0010143393,0.000065335844,0.00008315409,0.00049825484,0.19842294,0.00011643188,0.4889264,0.30147293,0.00395912],"about_ca_topic_score_codex":0.00028922097,"about_ca_topic_score_gemma":0.00060287956,"teacher_disagreement_score":0.93499285,"about_ca_system_score_codex":0.0017619627,"about_ca_system_score_gemma":0.0051836064,"threshold_uncertainty_score":0.99994946},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027782947,0.00023492644,0.9961443,0.0011247685,0.0010206463,0.00027049647,0.000024140105,0.00033086317,0.00057200826],"genre_scores_gemma":[0.3779749,0.00020240984,0.6183221,0.002399426,0.00034048644,0.00008979748,0.00011111265,0.00005024219,0.00050952536],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971894,0.00006465805,0.000348034,0.0012235128,0.0007382152,0.00043617832],"domain_scores_gemma":[0.99806,0.0006833366,0.00021829571,0.00086089765,0.00008234114,0.00009511347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043840872,0.00031238282,0.00031157117,0.0006179782,0.00034601503,0.000704299,0.0020093243,0.00017629264,0.00014130984],"category_scores_gemma":[0.00017063192,0.0002897701,0.00003705206,0.00062507426,0.00060555735,0.00067575485,0.0017646063,0.00079783954,0.000023918095],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001465582,0.000008927791,0.00009763393,0.000024525662,0.0000038972757,0.000033418688,0.00024315821,0.00012889525,0.000016176555,0.0019189983,0.0002280784,0.99729484],"study_design_scores_gemma":[0.0003662569,0.00035004408,0.0018082274,0.00012132815,0.000013452268,0.00019111966,0.0000020826626,0.37813467,0.00055113685,0.61382955,0.003654861,0.000977271],"about_ca_topic_score_codex":0.000018384766,"about_ca_topic_score_gemma":0.000015345258,"teacher_disagreement_score":0.99631757,"about_ca_system_score_codex":0.0003866545,"about_ca_system_score_gemma":0.00045276992,"threshold_uncertainty_score":0.9999554},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010380689,0.00068136014,0.97912693,0.0006743558,0.004255306,0.0007554434,0.0001896998,0.00013724179,0.013141574],"genre_scores_gemma":[0.7921511,0.00006464821,0.20209557,0.0017861108,0.0015417547,0.000013392722,0.0005223371,0.000026716083,0.0017983767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980109,0.00003408445,0.0003088196,0.00079694093,0.00040330985,0.0004459504],"domain_scores_gemma":[0.9988346,0.00046057644,0.00016968638,0.0003554227,0.00007185678,0.00010784222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010783232,0.00027098262,0.00029411563,0.00017298794,0.00046362964,0.0001776595,0.0007279959,0.00014860436,0.0008592376],"category_scores_gemma":[0.000085289306,0.00022375736,0.00010203882,0.00020053762,0.00027766128,0.000227832,0.00005237846,0.00048221473,0.000018288083],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021445388,0.000003869469,0.00028550273,0.00002223585,0.000005425882,0.000005860985,0.0009352827,0.00739651,0.000056950554,0.0003836738,0.000024586507,0.9908587],"study_design_scores_gemma":[0.00033298467,0.00048479592,0.0036053946,0.000097936536,0.000014143755,0.000039281837,0.0000072312714,0.94601905,0.000043634725,0.023430966,0.0251807,0.00074387604],"about_ca_topic_score_codex":0.00013874644,"about_ca_topic_score_gemma":0.0010987986,"teacher_disagreement_score":0.9901148,"about_ca_system_score_codex":0.000043110937,"about_ca_system_score_gemma":0.00022964604,"threshold_uncertainty_score":0.94080496},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002256808,0.00010193484,0.9906448,0.0009995007,0.0018753719,0.00031871305,0.0000036947984,0.00031874265,0.0034804193],"genre_scores_gemma":[0.37698254,0.000011964307,0.619987,0.0014688876,0.000984155,0.000034673816,0.000034288365,0.00008011529,0.000416378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99541056,0.00011195464,0.00058078597,0.0018982415,0.0012659817,0.000732457],"domain_scores_gemma":[0.9969971,0.0004481596,0.00054100296,0.0017229624,0.00014273902,0.00014804091],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014072912,0.00051467645,0.00044521174,0.0007662011,0.001061967,0.00049838645,0.0028941853,0.00022878921,0.000053711585],"category_scores_gemma":[0.00007786648,0.00054206373,0.00018360656,0.0010661826,0.00028374614,0.0005070435,0.0018113309,0.0016371448,0.0000778851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049958126,0.000030683466,0.0009924627,0.00001696335,0.000010676674,0.000026045564,0.00011146797,0.62160826,0.00046870278,0.06618712,0.000011581785,0.31053105],"study_design_scores_gemma":[0.00021502584,0.00017274504,0.005626535,0.00030851658,0.0000123284435,0.000057235007,8.472163e-8,0.9618,0.000018287768,0.028782371,0.0023722707,0.0006346494],"about_ca_topic_score_codex":0.00019203985,"about_ca_topic_score_gemma":0.000043149128,"teacher_disagreement_score":0.37472573,"about_ca_system_score_codex":0.000750008,"about_ca_system_score_gemma":0.00029717817,"threshold_uncertainty_score":0.9997031},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019441537,0.0072789877,0.98854065,0.00059646956,0.00023881104,0.0008291451,0.000071751136,0.00020809291,0.0022166374],"genre_scores_gemma":[0.03188359,0.0027288985,0.9600025,0.0046621826,0.00033087604,0.00016032744,0.000057354737,0.000047708567,0.00012658245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960472,0.00007811577,0.00093248405,0.0014016612,0.0010425501,0.0004980155],"domain_scores_gemma":[0.9967257,0.0010018371,0.0007315679,0.00085699884,0.00056419877,0.00011971015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032185956,0.00040234617,0.000996802,0.0011764033,0.0003156986,0.00016242145,0.0027779595,0.00016622391,0.00016287158],"category_scores_gemma":[0.0004280246,0.00040396952,0.000567062,0.001761656,0.00036008196,0.0005086623,0.0010370641,0.0006146773,0.0000014983481],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000418737,0.000040264094,0.00014966972,0.0028729811,0.00013017743,0.000012526377,0.00048572713,0.00077860913,0.00009964446,0.008149047,0.00005157528,0.9872256],"study_design_scores_gemma":[0.0009142799,0.001135416,0.0006465909,0.028180849,0.0008404081,0.00016207749,0.0000013868744,0.7613172,0.009170051,0.17909223,0.015669374,0.0028701283],"about_ca_topic_score_codex":0.000035601723,"about_ca_topic_score_gemma":0.00004361717,"teacher_disagreement_score":0.98435545,"about_ca_system_score_codex":0.0002571483,"about_ca_system_score_gemma":0.00046404928,"threshold_uncertainty_score":0.9998412},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004804843,0.00013499525,0.9959189,0.0017476734,0.00077984884,0.0008745498,0.000006265134,0.00012694475,0.0003627618],"genre_scores_gemma":[0.010201219,0.00000415246,0.9875656,0.0016121677,0.0004128592,0.000042848536,0.000006577451,0.000029733217,0.00012486364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955861,0.00014185159,0.0006476073,0.0018834823,0.0011635994,0.00057738554],"domain_scores_gemma":[0.9974695,0.00089651725,0.00035075995,0.0007659102,0.0002647581,0.0002525917],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0034495145,0.00043299855,0.00054003875,0.00057291053,0.00053218036,0.0012353875,0.0016166762,0.00014176242,0.000025299787],"category_scores_gemma":[0.00033518753,0.00044549067,0.000112020796,0.0004673242,0.00011577919,0.0011293177,0.0018239802,0.0005157168,0.0000035659932],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022001941,0.000021391297,0.000010938091,0.00012940068,0.000009678139,0.000010861849,0.0028561337,0.018843243,0.0008624585,0.0058658505,0.000014184126,0.9713538],"study_design_scores_gemma":[0.0005827423,0.00039929597,0.00045725144,0.00029733768,0.000017869523,0.00002482993,0.0000023423434,0.91380227,0.0043270346,0.078087546,0.0010825534,0.00091890094],"about_ca_topic_score_codex":0.00067491556,"about_ca_topic_score_gemma":0.00047108252,"teacher_disagreement_score":0.97043496,"about_ca_system_score_codex":0.00038975023,"about_ca_system_score_gemma":0.0009911061,"threshold_uncertainty_score":0.9998014},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059066148,0.00036903642,0.98855865,0.004081785,0.0011297384,0.0004047831,0.000008105953,0.0005700083,0.0048188353],"genre_scores_gemma":[0.19763361,0.00024448373,0.79542166,0.0032327648,0.00022111503,0.000107627115,0.000043156928,0.00005659823,0.0030390003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640495,0.0000376045,0.00048476725,0.001560563,0.0010184306,0.0004936671],"domain_scores_gemma":[0.9973595,0.00020879885,0.00040902704,0.001722374,0.00020523358,0.00009503681],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051058363,0.0004791878,0.00042603715,0.001044245,0.00035938591,0.00052832766,0.0045266435,0.0002842361,0.00009747089],"category_scores_gemma":[0.000097965996,0.00044866002,0.00013532212,0.00075765507,0.00044509047,0.0011624376,0.0023577202,0.0010433769,0.000036626567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009288631,0.000044758603,0.00001193152,0.000015686857,0.000016364864,0.000023093167,0.0010189705,0.09453621,0.00047878796,0.41890186,0.00033667524,0.4846064],"study_design_scores_gemma":[0.00017918783,0.00006997164,0.000014229035,0.00004153335,0.0000054353427,0.000016227352,3.5943748e-7,0.7155934,0.001604473,0.27496833,0.0070579313,0.0004489405],"about_ca_topic_score_codex":0.000017610273,"about_ca_topic_score_gemma":0.000024610563,"teacher_disagreement_score":0.62105715,"about_ca_system_score_codex":0.00063939847,"about_ca_system_score_gemma":0.00049644994,"threshold_uncertainty_score":0.9997965},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035118868,0.000071759634,0.99701345,0.00023307251,0.00048001585,0.00054390344,0.000017904966,0.00043209933,0.00085660437],"genre_scores_gemma":[0.6811066,0.000066027365,0.3183407,0.00016172783,0.00007555463,0.00006921656,0.000022683504,0.000029492994,0.00012798549],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997416,0.000028902452,0.00041423985,0.0010518583,0.00073144835,0.00035751626],"domain_scores_gemma":[0.99819267,0.000089098074,0.00032303116,0.001077357,0.00021713843,0.00010068572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042258293,0.00033519784,0.00033892327,0.00039530415,0.00038480258,0.00015332818,0.0016306087,0.00017814056,0.000027666916],"category_scores_gemma":[0.0000073031633,0.00030649602,0.000112929694,0.0007711541,0.0002967701,0.00037678078,0.0005512618,0.0006036435,0.000009738785],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016458074,0.00011855638,0.00005529866,0.00007590318,0.000023245033,0.000018080853,0.00067600625,0.012623648,0.0020132475,0.0084816525,0.000006173656,0.9758917],"study_design_scores_gemma":[0.00025321209,0.0006845435,0.00021776985,0.00009726575,0.0000203933,0.00007380097,4.0050818e-7,0.9562637,0.015473219,0.021226007,0.005079515,0.00061014533],"about_ca_topic_score_codex":0.000026392681,"about_ca_topic_score_gemma":0.00013426713,"teacher_disagreement_score":0.9752816,"about_ca_system_score_codex":0.00054648024,"about_ca_system_score_gemma":0.0002705738,"threshold_uncertainty_score":0.9999387},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011701681,0.00023099085,0.9812346,0.0012390459,0.0039249132,0.00038963236,0.00001803938,0.00026471948,0.012686369],"genre_scores_gemma":[0.048345957,0.00012237446,0.93507236,0.012686341,0.00072768173,0.000105874686,0.000027884942,0.000089940964,0.0028215921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952354,0.00010827307,0.00045890576,0.0018773092,0.0014653422,0.00085479545],"domain_scores_gemma":[0.9971284,0.00053714094,0.00020976788,0.0018465075,0.00008606931,0.00019208211],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007880952,0.00054473744,0.00051561266,0.0008194453,0.0007401451,0.0006419583,0.0050976737,0.00025819085,0.00017200132],"category_scores_gemma":[0.000024060719,0.00048751014,0.00020770865,0.0017286404,0.00042709502,0.0005385546,0.00048918236,0.0015682018,0.00008853808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000444324,0.00007941224,0.000002127852,0.000016437281,0.000007781687,0.00013764914,0.0007387026,0.17661761,0.0000029146358,0.0015029714,0.0004439239,0.820446],"study_design_scores_gemma":[0.000387263,0.00067967724,0.000054618482,0.00013556838,0.000010088984,0.00014663607,2.9360322e-7,0.83732986,0.00015073449,0.12994155,0.030155202,0.0010085227],"about_ca_topic_score_codex":0.00002299663,"about_ca_topic_score_gemma":0.000030114934,"teacher_disagreement_score":0.8194375,"about_ca_system_score_codex":0.0008195344,"about_ca_system_score_gemma":0.0013216083,"threshold_uncertainty_score":0.99975765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040624995,0.000063626896,0.9824191,0.0011141413,0.0006250625,0.0010081194,0.0000047566955,0.00030631007,0.014052685],"genre_scores_gemma":[0.41932002,0.000003949195,0.5765449,0.0035997888,0.000097456315,0.000107420026,0.00001603806,0.000056585173,0.00025385414],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948057,0.000025357253,0.0008000737,0.0021801777,0.0014722422,0.0007164421],"domain_scores_gemma":[0.9966441,0.00025146012,0.0005041553,0.0019881108,0.00032457247,0.00028763973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008149367,0.00060252496,0.0005986045,0.00059639366,0.00036229767,0.0008874152,0.0029297827,0.00015174324,0.0000144306805],"category_scores_gemma":[0.00011996064,0.0005062025,0.00012412338,0.0011542912,0.000641126,0.0010867326,0.003227726,0.00070239673,0.000027952885],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010438882,0.000033253116,0.0000793781,0.00003688998,0.000012902571,0.00027249308,0.0011834934,0.016468257,0.000059509817,0.15258807,0.00007063579,0.82918465],"study_design_scores_gemma":[0.00022071885,0.0010311444,0.00013914335,0.00080340164,0.000015172371,0.00089117896,0.0000016857201,0.30918872,0.0011738247,0.6741808,0.010831777,0.0015223905],"about_ca_topic_score_codex":0.000062379426,"about_ca_topic_score_gemma":0.0002944801,"teacher_disagreement_score":0.8276623,"about_ca_system_score_codex":0.00045817654,"about_ca_system_score_gemma":0.0007278953,"threshold_uncertainty_score":0.99973893},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005005444,0.00013624536,0.99301434,0.002126511,0.0021507263,0.00046116728,0.00020718553,0.00019311036,0.0012101677],"genre_scores_gemma":[0.12442787,0.00021218961,0.8424107,0.029917292,0.0013782427,0.000100712095,0.001195189,0.00011864528,0.0002392033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99391824,0.00008769446,0.00052627927,0.0022133107,0.0025667779,0.0006877121],"domain_scores_gemma":[0.9967662,0.0004960568,0.0003144004,0.001968016,0.00012996208,0.000325337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012224283,0.00053526124,0.00051527587,0.0005745167,0.00043622838,0.00043340476,0.0042100437,0.00028382186,0.0003155285],"category_scores_gemma":[0.00017494583,0.00047376595,0.00008112508,0.00065356283,0.0005359484,0.00076340424,0.0018158059,0.0015562772,0.00008002445],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042638127,0.00007349116,0.00005878869,0.000052887473,0.000013526128,0.00056059455,0.0003256131,0.025712697,0.0000047767207,0.0043248218,0.0003784824,0.9684517],"study_design_scores_gemma":[0.00080395973,0.00074419845,0.000071856106,0.00068310904,0.000012722752,0.0003763537,2.5262682e-7,0.9260402,0.00014819684,0.041699268,0.028279532,0.001140379],"about_ca_topic_score_codex":0.00012326443,"about_ca_topic_score_gemma":0.00020475635,"teacher_disagreement_score":0.9673113,"about_ca_system_score_codex":0.0004723384,"about_ca_system_score_gemma":0.0010395154,"threshold_uncertainty_score":0.9997714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013537411,0.00019276515,0.97608507,0.021735558,0.00044479678,0.0011989695,0.00003884361,0.00019920265,0.00009124596],"genre_scores_gemma":[0.014489149,0.00007824962,0.958821,0.025516398,0.00043397158,0.000111779525,0.00026194687,0.00011215687,0.00017535196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698395,0.000031283485,0.0004135492,0.0013103958,0.0008400999,0.0004207034],"domain_scores_gemma":[0.99594516,0.0023911828,0.0004167187,0.00072309974,0.00027358666,0.0002502818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007631821,0.0004274704,0.00052452466,0.0008620828,0.0005133124,0.000182271,0.0005291036,0.00026693536,0.00023612603],"category_scores_gemma":[0.002669136,0.00038222678,0.0001073006,0.00066834484,0.00059729046,0.00014817272,0.00026939556,0.0012282911,0.0000045839065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018241264,0.00012192123,0.00039040812,0.00044293204,0.000028641336,0.000054477885,0.0006316399,0.9709191,0.0003526187,0.0042624376,0.00006794226,0.022545474],"study_design_scores_gemma":[0.0010836001,0.00079596083,0.00013205847,0.00062502176,0.00012033972,0.00013141455,7.455356e-7,0.9671149,0.00009616774,0.0052493326,0.024149098,0.00050134776],"about_ca_topic_score_codex":0.00007720425,"about_ca_topic_score_gemma":0.00003396505,"teacher_disagreement_score":0.024081154,"about_ca_system_score_codex":0.001332181,"about_ca_system_score_gemma":0.0015957544,"threshold_uncertainty_score":0.99986297},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030528772,0.00011677475,0.99214184,0.00021584146,0.004216062,0.00058289955,0.000019427322,0.00038187936,0.0022947174],"genre_scores_gemma":[0.043277405,0.000020051766,0.9543289,0.0014028719,0.00067326875,0.00007815962,0.000014880361,0.000051714538,0.00015276216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622214,0.00007522919,0.00053243793,0.0017119566,0.0008346841,0.0006235808],"domain_scores_gemma":[0.9973334,0.00081674935,0.0003546022,0.001043757,0.00027279032,0.00017870463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019913593,0.00044792227,0.00045461228,0.0010481658,0.0008141035,0.0007182961,0.0023979095,0.00021152297,0.00011337889],"category_scores_gemma":[0.00014219701,0.0004680816,0.00018722436,0.000670882,0.00016988078,0.00105696,0.00069624814,0.00086470525,0.00001379357],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090421845,0.00002510814,0.0000051940087,0.00003392909,0.0000073520087,0.000014373538,0.0006368745,0.030450603,0.00049863465,0.0074637374,0.000009272251,0.9608459],"study_design_scores_gemma":[0.0002803449,0.00046583035,0.000008569998,0.00010016822,0.000009851643,0.0001436653,5.6314786e-7,0.92040086,0.0020419378,0.06856453,0.0074317753,0.0005519313],"about_ca_topic_score_codex":0.000034512297,"about_ca_topic_score_gemma":0.00013890602,"teacher_disagreement_score":0.96029395,"about_ca_system_score_codex":0.0004992015,"about_ca_system_score_gemma":0.00048240775,"threshold_uncertainty_score":0.9997771},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001234712,0.00087847514,0.99634105,0.000096254545,0.00044472874,0.0007396062,0.000017516924,0.00008546172,0.0012734409],"genre_scores_gemma":[0.20149116,0.00004894121,0.7977115,0.00029368425,0.0001980553,0.000071836,0.000017501005,0.000031413987,0.00013588158],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963177,0.00023602262,0.0007393661,0.0012752638,0.0010566746,0.0003749992],"domain_scores_gemma":[0.99566466,0.0020885414,0.0005634277,0.001216848,0.0003633449,0.00010315696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024125008,0.0003447271,0.0006462003,0.00091248413,0.00017873941,0.000107601016,0.0029302589,0.00016511489,0.000011496254],"category_scores_gemma":[0.000083056504,0.00034255537,0.000113112204,0.0017058154,0.0011797879,0.00045114613,0.0029944319,0.00054859923,0.0000010704846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004858039,0.00007802033,0.00002215482,0.000120451296,0.000008830725,0.0000034891111,0.00097150775,0.3360485,0.000036253805,0.06297307,0.0000105652425,0.59972227],"study_design_scores_gemma":[0.000110596906,0.000109298766,0.00006656916,0.000039275477,0.000005591288,0.000016972335,5.26116e-7,0.49605188,0.00017544061,0.50316036,0.00008458819,0.00017891092],"about_ca_topic_score_codex":0.000023405253,"about_ca_topic_score_gemma":0.000010581159,"teacher_disagreement_score":0.5995434,"about_ca_system_score_codex":0.0002825626,"about_ca_system_score_gemma":0.0010738332,"threshold_uncertainty_score":0.99990267},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032354114,0.00027528225,0.98999757,0.0013275115,0.00075083395,0.00048602934,0.000012645549,0.00016445802,0.0069533144],"genre_scores_gemma":[0.089111775,0.0003834181,0.9033645,0.0045920224,0.00022931548,0.000026763359,0.00004629022,0.00007717993,0.0021687392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964458,0.00007812466,0.00044006083,0.0013984519,0.0010534956,0.00058406446],"domain_scores_gemma":[0.9981753,0.00022501578,0.00022717715,0.0009649907,0.00018979526,0.00021769706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009618008,0.00041116495,0.00038635219,0.00077254826,0.0004304554,0.0007465682,0.0018700133,0.00016139938,0.00047570604],"category_scores_gemma":[0.000048479036,0.00041277133,0.000073980686,0.0006126113,0.0010177175,0.00079169497,0.0017709248,0.0007650619,0.000022744814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039423135,0.000024483548,0.00004494399,0.000036776426,0.000011598715,0.00006678022,0.0004781504,0.51615447,0.000080864666,0.319135,0.000015711492,0.16394728],"study_design_scores_gemma":[0.00052490714,0.00012843542,0.00005089972,0.00007478383,0.000004727102,0.00009454863,6.968108e-7,0.90482074,0.0001323941,0.09098997,0.002606354,0.0005715336],"about_ca_topic_score_codex":0.000019895248,"about_ca_topic_score_gemma":0.0000289448,"teacher_disagreement_score":0.3886663,"about_ca_system_score_codex":0.00026527754,"about_ca_system_score_gemma":0.0005104062,"threshold_uncertainty_score":0.9998324},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010188193,0.00023584448,0.9825504,0.0001608489,0.004631557,0.00047971413,0.0000089369305,0.00016924729,0.0015752537],"genre_scores_gemma":[0.99158,0.000021953696,0.004025523,0.0033175994,0.000702822,0.000009518151,0.0000016539709,0.00006925665,0.0002716691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957435,0.00012382954,0.00046977925,0.0018047246,0.0010250953,0.000833055],"domain_scores_gemma":[0.9978686,0.00080562715,0.00030578,0.00080302905,0.000057939174,0.0001590256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005346596,0.0005796413,0.00048778087,0.0007277908,0.0007968472,0.0005308953,0.0015134884,0.00024258054,0.00020460968],"category_scores_gemma":[0.00010800308,0.000539676,0.00015999604,0.0006434824,0.0006062497,0.00043242204,0.00085898355,0.0017083517,0.0000126353225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003279107,0.00002271894,0.000009025019,0.000014608726,0.000002737488,0.00010743875,0.00018507983,0.7600231,0.003741852,0.00026109687,0.0000011867796,0.23559836],"study_design_scores_gemma":[0.00023786417,0.00047436642,0.000011588949,0.00010614375,0.0000074529944,0.00014437457,3.1484106e-7,0.96966225,0.025022734,0.002667274,0.0011171028,0.00054853014],"about_ca_topic_score_codex":0.000052380656,"about_ca_topic_score_gemma":0.00009989898,"teacher_disagreement_score":0.9813918,"about_ca_system_score_codex":0.0004668625,"about_ca_system_score_gemma":0.00007817106,"threshold_uncertainty_score":0.9997055},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010699766,0.0006558274,0.9949723,0.0014696312,0.001131519,0.00085704494,0.000039240607,0.000059365575,0.0008043544],"genre_scores_gemma":[0.03252205,0.00006672455,0.9642771,0.0010714626,0.000379142,0.00017654362,0.000019483181,0.00006638456,0.001421142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969522,0.0000575548,0.00046403764,0.0009601158,0.0010411369,0.0005249644],"domain_scores_gemma":[0.9939213,0.003749825,0.00028500406,0.0016849458,0.000268964,0.00008995332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014745619,0.00030234206,0.00039023746,0.00078768533,0.00060932484,0.0001579793,0.0040761163,0.00011410699,0.00006792619],"category_scores_gemma":[0.00031745277,0.00022566464,0.00021051696,0.0010148056,0.0011160759,0.00040095847,0.0010656627,0.000626595,0.0000041322237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037673213,0.00003227388,0.000038821512,0.000029579807,0.000034682518,0.000011420147,0.0009910022,0.028025595,0.00012387957,0.60500365,0.00006111817,0.3656103],"study_design_scores_gemma":[0.0005296321,0.00040054918,0.00009387294,0.00006955854,0.000014920114,0.000025398798,6.786931e-7,0.29142725,0.0005887389,0.66735196,0.03906874,0.00042872096],"about_ca_topic_score_codex":0.00005154255,"about_ca_topic_score_gemma":0.00016601045,"teacher_disagreement_score":0.3651816,"about_ca_system_score_codex":0.00024113593,"about_ca_system_score_gemma":0.0007276535,"threshold_uncertainty_score":0.9202337},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014054874,0.0003954847,0.97179407,0.00027266418,0.018532297,0.00023106486,3.3566153e-7,0.00016399815,0.008469536],"genre_scores_gemma":[0.02757003,0.000025519235,0.95825225,0.0044058585,0.004142286,0.000020054886,0.000018695655,0.00008900149,0.005476309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958747,0.00008639539,0.00065599097,0.0013868596,0.0012668174,0.0007292494],"domain_scores_gemma":[0.9972179,0.0006255474,0.00046267,0.0013895457,0.00017990313,0.00012442804],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015122156,0.00043627742,0.0006147653,0.0010551895,0.00020081048,0.00033411736,0.006895059,0.00020135955,0.000024971507],"category_scores_gemma":[0.00012195607,0.00042244408,0.00018004047,0.0015963601,0.00051408366,0.000712402,0.005453677,0.0011915718,0.000021352376],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005649159,0.000068278714,0.00017938997,0.00012362933,0.0000179646,0.00011436536,0.0072826687,0.0052517825,0.00009033878,0.0030532947,0.0041787713,0.97963387],"study_design_scores_gemma":[0.00029019103,0.0003432137,0.00012962153,0.00043098658,0.000008569938,0.00011530719,2.2046952e-7,0.8709418,0.0019565895,0.09745745,0.027471429,0.0008545998],"about_ca_topic_score_codex":0.00005751344,"about_ca_topic_score_gemma":0.0000023555665,"teacher_disagreement_score":0.97877926,"about_ca_system_score_codex":0.0005520167,"about_ca_system_score_gemma":0.0014418511,"threshold_uncertainty_score":0.99982274},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006455862,0.00023859912,0.99339557,0.00065366365,0.0027084325,0.0010443721,0.000029003204,0.00026592385,0.0015998868],"genre_scores_gemma":[0.14450765,0.00008874181,0.8479153,0.004171373,0.0011442208,0.00022853994,0.00010226752,0.00018706989,0.0016548665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942284,0.000066359076,0.0007401444,0.0022864004,0.0017507465,0.000927918],"domain_scores_gemma":[0.9965925,0.00041819335,0.00043335062,0.0020750149,0.00023498628,0.00024593654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010917847,0.0007503347,0.0007734586,0.0012971514,0.00067643635,0.0007262996,0.0047480376,0.0002974439,0.00025561382],"category_scores_gemma":[0.00006371209,0.00077247806,0.00023744938,0.0015092815,0.0008273314,0.0009433318,0.0034395554,0.0013970332,0.00003841873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002178893,0.00013529893,0.000045228688,0.00013959916,0.000056928093,0.0002804855,0.0029057167,0.5744311,0.00009922322,0.12518916,0.0001844764,0.296511],"study_design_scores_gemma":[0.00036731106,0.00021111632,0.0000728937,0.00017835309,0.000011171807,0.00009080243,2.270855e-7,0.7374082,0.00006857201,0.25816244,0.002708811,0.00072007405],"about_ca_topic_score_codex":0.00007105725,"about_ca_topic_score_gemma":0.00004721612,"teacher_disagreement_score":0.2957909,"about_ca_system_score_codex":0.00048826492,"about_ca_system_score_gemma":0.0007240635,"threshold_uncertainty_score":0.9994726},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074144664,0.000952563,0.9830767,0.0005965955,0.0018055657,0.00053190475,0.000015303527,0.0003162665,0.012630975],"genre_scores_gemma":[0.23870312,0.0007548527,0.74790806,0.0048389616,0.0015107468,0.00016905542,0.00004304832,0.00028656106,0.0057856077],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932061,0.00013587848,0.00058631273,0.0024299384,0.0023747236,0.0012670527],"domain_scores_gemma":[0.9952133,0.001266483,0.0002894554,0.0026641067,0.00023093545,0.0003356748],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020221013,0.00068614125,0.0006372289,0.0022135933,0.0006867566,0.0005807495,0.008536191,0.00026148054,0.00024617728],"category_scores_gemma":[0.00021224427,0.00066601345,0.00026881127,0.0023891693,0.0012119021,0.0011251367,0.0050252466,0.002216478,0.00007231948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002098013,0.000050451512,0.00012904571,0.000032636195,0.000021583817,0.0004198813,0.00056245446,0.03252216,0.00016298526,0.2545164,0.000057380727,0.71150404],"study_design_scores_gemma":[0.00042680674,0.00044666743,0.00014230698,0.0001368862,0.000007303527,0.0002085451,3.048023e-7,0.13937189,0.0008759508,0.82734615,0.029749919,0.0012872887],"about_ca_topic_score_codex":0.000022205917,"about_ca_topic_score_gemma":0.000031953186,"teacher_disagreement_score":0.71021676,"about_ca_system_score_codex":0.0005402119,"about_ca_system_score_gemma":0.0007700633,"threshold_uncertainty_score":0.99957913},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018722069,0.0002939976,0.96972215,0.00040464426,0.025244184,0.00026050454,4.6357061e-7,0.0003435283,0.003543277],"genre_scores_gemma":[0.02574321,0.00008851739,0.9296282,0.005421984,0.011313233,0.00002859489,0.000036107976,0.00023920806,0.027500931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953565,0.00007549489,0.00076170615,0.001592673,0.0012945711,0.0009190814],"domain_scores_gemma":[0.99664414,0.00093761476,0.00047638224,0.0015057935,0.0002789512,0.00015714749],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017801309,0.0005201646,0.00072657334,0.001368963,0.0001607193,0.00043509674,0.006554128,0.00035008462,0.0000052915557],"category_scores_gemma":[0.00022554216,0.00048683595,0.00020394243,0.0023791697,0.00062917947,0.00071287213,0.0043749195,0.0011293526,0.00011807749],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059900785,0.000056520606,0.00020568,0.00021269843,0.0000281844,0.00017622532,0.006609342,0.0038550883,0.00024183298,0.0025990352,0.00933562,0.9766738],"study_design_scores_gemma":[0.0002462139,0.00023050669,0.00023750293,0.000986858,0.000008632368,0.000055633605,2.0006217e-7,0.8777741,0.0028125586,0.11258787,0.0042723757,0.00078751816],"about_ca_topic_score_codex":0.00006306243,"about_ca_topic_score_gemma":0.000007951128,"teacher_disagreement_score":0.9758863,"about_ca_system_score_codex":0.00040646666,"about_ca_system_score_gemma":0.0012960931,"threshold_uncertainty_score":0.9997583},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008785164,0.00061639014,0.9886277,0.0012210822,0.002956609,0.00030466277,0.000008063153,0.00020795922,0.0059697246],"genre_scores_gemma":[0.050957646,0.00010799529,0.94169676,0.005431259,0.0009607977,0.000024835957,0.000048658276,0.00004910945,0.0007229206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957289,0.000049032074,0.0005242774,0.0016141149,0.0014923789,0.00059129647],"domain_scores_gemma":[0.99788976,0.00046589633,0.00030017315,0.0010397873,0.00017781489,0.00012659363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087069185,0.00048452607,0.0004332434,0.0009823998,0.0007196231,0.00060563005,0.0029714527,0.00018702897,0.00015196222],"category_scores_gemma":[0.00006566525,0.0004975627,0.00015879181,0.0012757065,0.0003210884,0.0013361278,0.0012518835,0.0009310699,0.00003977584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065657614,0.000038796763,0.000022130847,0.00003203209,0.000020944204,0.0001859948,0.0017048906,0.40404236,0.00027820637,0.221682,0.00016942064,0.37181666],"study_design_scores_gemma":[0.00029791097,0.0002142828,0.000076952885,0.00013000873,0.000010962844,0.0001998507,2.4346045e-7,0.3860259,0.0007900006,0.57867694,0.03265907,0.000917854],"about_ca_topic_score_codex":0.000047409492,"about_ca_topic_score_gemma":0.00002557722,"teacher_disagreement_score":0.3708988,"about_ca_system_score_codex":0.00032375377,"about_ca_system_score_gemma":0.0005839828,"threshold_uncertainty_score":0.9997476},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000099344936,0.0012891483,0.99528,0.0006376368,0.0013612536,0.00059449044,0.0000057753177,0.0004277471,0.00030458876],"genre_scores_gemma":[0.022036001,0.000044858516,0.97244614,0.0016647559,0.0019515859,0.00007098361,0.000012202663,0.00007806231,0.0016953999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962518,0.000048898895,0.00040301168,0.0017991079,0.0006062256,0.0008909303],"domain_scores_gemma":[0.99714416,0.0015337126,0.0002227247,0.000647146,0.00027351963,0.00017875311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011229813,0.0004958613,0.0005247451,0.0007575856,0.00047776022,0.0008189259,0.002143186,0.00027220408,6.632999e-7],"category_scores_gemma":[0.00020673015,0.00044522752,0.00011109028,0.001105407,0.0006259621,0.00012591561,0.0015708915,0.00072919356,0.000006936539],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004766767,0.00001191095,0.000016144166,0.00009335227,0.0000064354467,0.000024597433,0.0007743931,0.033364963,0.0000043215964,0.00021477234,0.00016366447,0.9653207],"study_design_scores_gemma":[0.00028453997,0.00013892454,0.0001894991,0.00060573575,0.000006714354,0.000048559283,1.621548e-7,0.8213564,0.00004950455,0.17626618,0.00057795236,0.00047579387],"about_ca_topic_score_codex":0.0000052904898,"about_ca_topic_score_gemma":0.000033831297,"teacher_disagreement_score":0.9648449,"about_ca_system_score_codex":0.0001517752,"about_ca_system_score_gemma":0.0009252582,"threshold_uncertainty_score":0.99979997},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005171092,0.0014799538,0.98975515,0.00044551995,0.001262903,0.00042899713,0.0000025518884,0.00027087302,0.0011829361],"genre_scores_gemma":[0.9518429,0.000045723496,0.047109984,0.00030437592,0.00030555762,0.000005348752,0.000005926254,0.000056479174,0.00032368096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961258,0.00020481793,0.00037789234,0.0018459194,0.00078884675,0.00065673183],"domain_scores_gemma":[0.9976036,0.0012797908,0.00026978613,0.00051800784,0.00018943437,0.00013938473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017696669,0.0005450495,0.00057469495,0.0010796543,0.00034352054,0.0006004744,0.0012466917,0.0003115866,0.000002971836],"category_scores_gemma":[0.0013581747,0.00051525893,0.000055630717,0.0008971642,0.00070457236,0.0005899133,0.001646294,0.0022567797,0.000011186443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092124705,0.000025900164,0.003015397,0.000075195894,0.000014020529,0.00057406665,0.019545043,0.24950947,0.00002686307,0.0071142255,0.0000030155907,0.7200047],"study_design_scores_gemma":[0.00065821374,0.00018785878,0.009653941,0.00039176192,0.0000056336135,0.000059671063,0.0000134648335,0.9810411,0.000010647057,0.0072983555,0.000028875802,0.0006504846],"about_ca_topic_score_codex":0.00027541717,"about_ca_topic_score_gemma":0.0013728146,"teacher_disagreement_score":0.94667184,"about_ca_system_score_codex":0.00039272394,"about_ca_system_score_gemma":0.00028275067,"threshold_uncertainty_score":0.9997299},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016983069,0.00019915139,0.9951339,0.0006066046,0.0025253473,0.0003631034,0.000013972827,0.00037655444,0.0006115737],"genre_scores_gemma":[0.14408913,0.000043530807,0.85318094,0.0010008854,0.0008184682,0.000017353965,0.000022738486,0.000056476045,0.0007704683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575347,0.000022709788,0.00057702773,0.0018365753,0.0010034007,0.00080682745],"domain_scores_gemma":[0.9970187,0.00081077067,0.00047544122,0.0011735503,0.00032595076,0.00019558294],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009722539,0.0005362419,0.00072054466,0.0022903313,0.00046315556,0.0011638631,0.0026196798,0.0004381226,0.000014560058],"category_scores_gemma":[0.00025988175,0.0005057673,0.00034609844,0.0026537473,0.00031104908,0.00084660074,0.00069581665,0.0007674495,0.00002827203],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011762718,0.000018805524,0.00019802655,0.00010692708,0.00015921569,0.00007616869,0.0005937746,0.05890631,0.0018797163,0.011324439,0.000054595603,0.92667025],"study_design_scores_gemma":[0.0003182613,0.00011778136,0.0005502234,0.0003154795,0.00013985446,0.00003844055,5.554853e-7,0.6669357,0.020173978,0.30967325,0.00075935514,0.0009771115],"about_ca_topic_score_codex":0.000015543572,"about_ca_topic_score_gemma":0.00013299374,"teacher_disagreement_score":0.92569315,"about_ca_system_score_codex":0.00029456613,"about_ca_system_score_gemma":0.00041211818,"threshold_uncertainty_score":0.99987304},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015209094,0.00018856305,0.9950333,0.00019916115,0.0012826675,0.00053791126,0.000004110303,0.00059494557,0.0020072348],"genre_scores_gemma":[0.32587352,0.000041450432,0.6683499,0.0013226562,0.0011964941,0.000022157488,0.000033548346,0.00022400862,0.0029362151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99425447,0.00008780281,0.00065557414,0.0019904298,0.0019496451,0.0010620926],"domain_scores_gemma":[0.99690974,0.0010238286,0.0005741284,0.0007104738,0.0005467548,0.00023508811],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010515162,0.0007643799,0.00067754416,0.0014243127,0.0006021349,0.0008049942,0.0023457913,0.00044912152,0.000014318099],"category_scores_gemma":[0.00046960913,0.0007268938,0.00017727756,0.0012598062,0.00096656114,0.0007237333,0.0025503887,0.0024994554,0.0000803679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011046183,0.000007873231,0.000059354894,0.000048625898,0.000020528141,0.00014797093,0.0015004901,0.83243847,0.00010411238,0.0008200366,0.0000016509606,0.16483985],"study_design_scores_gemma":[0.0003238394,0.00026810245,0.00010363403,0.00186048,0.000026818447,0.00017178744,0.0000013496481,0.9775553,0.00023538778,0.018521188,0.00017456817,0.00075758225],"about_ca_topic_score_codex":0.000011959019,"about_ca_topic_score_gemma":0.0000065655604,"teacher_disagreement_score":0.32668337,"about_ca_system_score_codex":0.00044947804,"about_ca_system_score_gemma":0.0012785667,"threshold_uncertainty_score":0.9998018},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002958934,0.0004986776,0.9943646,0.00068594184,0.00087067543,0.0005624637,0.000002495374,0.00037204273,0.0023472197],"genre_scores_gemma":[0.0810955,0.00007338304,0.91231245,0.0051042535,0.00096357486,0.000039489772,0.00003869031,0.000074559524,0.0002981169],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941824,0.00016160778,0.00075419724,0.0022176057,0.0014891053,0.0011950914],"domain_scores_gemma":[0.99671984,0.0006054446,0.00034004226,0.0016524934,0.00043244773,0.00024971858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001222297,0.0007258999,0.00072398956,0.0031349277,0.00018576828,0.0007709117,0.0047666295,0.00045820774,0.000016377639],"category_scores_gemma":[0.00024632367,0.00072304765,0.00017755765,0.0075612296,0.00057244394,0.0011601488,0.00078957865,0.0015608934,0.000060102448],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002233669,0.00024224896,0.0005359389,0.000076897304,0.000012900598,0.00046975876,0.0011454452,0.062727965,0.001362187,0.0042814575,0.0011164476,0.9280064],"study_design_scores_gemma":[0.0010164016,0.000528479,0.0077491794,0.0010301992,0.000010116838,0.00014846481,1.4309732e-7,0.69873744,0.0033614747,0.28395396,0.0018041988,0.001659956],"about_ca_topic_score_codex":0.000056262976,"about_ca_topic_score_gemma":0.00022889074,"teacher_disagreement_score":0.9263465,"about_ca_system_score_codex":0.001043144,"about_ca_system_score_gemma":0.0023996942,"threshold_uncertainty_score":0.9995221},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015285253,0.00017617935,0.9943203,0.0008324225,0.0012641412,0.00064705755,0.000004670528,0.00035291776,0.0008737947],"genre_scores_gemma":[0.9729305,0.0000332515,0.025683008,0.00086905155,0.00035641243,0.000030219104,0.000011506521,0.000029151468,0.00005691459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966973,0.000028886858,0.00054688484,0.0015409234,0.0007251061,0.00046091393],"domain_scores_gemma":[0.9978775,0.00046356427,0.00029959448,0.0008736986,0.00028279395,0.00020289187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001055261,0.00038984042,0.00035408826,0.00086394744,0.0003385438,0.00054569624,0.0017398273,0.0002953448,0.00000471132],"category_scores_gemma":[0.00012515455,0.0004219945,0.0000714788,0.00086348207,0.00017796055,0.0006478811,0.00095970463,0.0006042645,0.00018179107],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011815917,0.000035505254,0.00003534556,0.00013573239,0.000014927701,0.000015308839,0.0072059813,0.030013295,0.00092147087,0.13792688,0.00001885553,0.8236649],"study_design_scores_gemma":[0.0000819174,0.000054549382,0.0004762099,0.00017456994,0.0000043013315,0.000026400407,4.1461013e-7,0.7209056,0.00072211673,0.27695468,0.00022037346,0.00037886828],"about_ca_topic_score_codex":0.000025181298,"about_ca_topic_score_gemma":0.000062830695,"teacher_disagreement_score":0.971402,"about_ca_system_score_codex":0.00026264915,"about_ca_system_score_gemma":0.00016604924,"threshold_uncertainty_score":0.9998232},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032017633,0.00003272043,0.9886714,0.00050587027,0.0036691122,0.0008292172,0.0000041662333,0.00045161397,0.00580388],"genre_scores_gemma":[0.002908317,0.0000125162005,0.9951088,0.00041109486,0.00048678584,0.00006262582,0.000009106035,0.00004847756,0.00095231406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954886,0.000096839336,0.0006497253,0.0017819881,0.0012483783,0.00073445647],"domain_scores_gemma":[0.9970838,0.00019416113,0.0003031204,0.0018387722,0.00034907018,0.00023110642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022750548,0.00047902702,0.00046917182,0.0011274242,0.00025816556,0.0006079357,0.0032369995,0.00029441703,0.0000069896146],"category_scores_gemma":[0.0004033401,0.0004521247,0.0000870924,0.0020578974,0.00040510108,0.0008188787,0.0013044553,0.0007614639,0.00027743052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009503521,0.000049438702,0.000002462041,0.000092080176,0.000012714792,0.00001369308,0.0029532963,0.16481665,0.0002375607,0.17048928,0.00009166957,0.66123164],"study_design_scores_gemma":[0.0001482385,0.00017093877,0.000040954572,0.00020275632,0.000007673605,0.00008676342,6.3024004e-7,0.8831805,0.0013033072,0.11228884,0.0019225874,0.00064683316],"about_ca_topic_score_codex":0.000018797231,"about_ca_topic_score_gemma":0.000005922867,"teacher_disagreement_score":0.7183638,"about_ca_system_score_codex":0.00037288354,"about_ca_system_score_gemma":0.0005309684,"threshold_uncertainty_score":0.99979305},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000108345785,0.00023290286,0.9967591,0.00025652978,0.0016585068,0.00017829474,0.000003871469,0.0003323566,0.00056757324],"genre_scores_gemma":[0.028473541,0.0016240742,0.92793274,0.019406987,0.006125108,0.00004271566,0.000443953,0.00033018834,0.01562068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705803,0.000060530536,0.00040940035,0.0011559651,0.000751105,0.0005649933],"domain_scores_gemma":[0.99830246,0.00037037488,0.0002078417,0.0008087626,0.00015885163,0.00015168164],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001011695,0.0003285531,0.00037041286,0.00078592426,0.00033337987,0.0011301629,0.0018748731,0.00020609071,0.000004109623],"category_scores_gemma":[0.00014220022,0.00031708373,0.000058522248,0.003004988,0.0003906627,0.0007056977,0.0015261653,0.00032758072,0.000034433677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031465706,0.000050761417,0.00078705314,0.00020755416,0.000032944223,0.00013683645,0.0019137734,0.20724912,0.000028817738,0.19123466,0.0065708198,0.5917845],"study_design_scores_gemma":[0.00011780155,0.000044975197,0.00017408431,0.00030094484,0.000005824332,0.000013476762,1.2765113e-7,0.83361524,0.00003385224,0.16279292,0.0025339862,0.00036676947],"about_ca_topic_score_codex":0.000006243573,"about_ca_topic_score_gemma":0.000044400946,"teacher_disagreement_score":0.62636614,"about_ca_system_score_codex":0.00013363369,"about_ca_system_score_gemma":0.00056150835,"threshold_uncertainty_score":0.9999281},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040139374,0.000325265,0.9963635,0.00093387475,0.00048147622,0.0006149744,0.000008839989,0.00020130891,0.0006693391],"genre_scores_gemma":[0.021849291,0.000092991475,0.96957403,0.0057517295,0.0008987333,0.00016605921,0.0000751969,0.000088466746,0.0015034752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962092,0.00008908448,0.00043880707,0.0016964282,0.00093955785,0.0006269475],"domain_scores_gemma":[0.9976037,0.0006162964,0.00026372838,0.0012218507,0.00009477344,0.00019964999],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047102882,0.00045024,0.0003943085,0.00051195204,0.0006316398,0.00044230753,0.0029331432,0.0001475189,0.000037846345],"category_scores_gemma":[0.00004033972,0.00045693226,0.00006652025,0.0017199684,0.00054933375,0.00063609245,0.0024329515,0.0008848443,0.000016018068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005490445,0.000033608532,0.00004028968,0.000035638455,0.000005344997,0.00003676207,0.0010836701,0.117019966,0.0012858704,0.00088874606,0.0003087082,0.8792559],"study_design_scores_gemma":[0.00041695396,0.00013992538,0.00009482685,0.00011009185,0.000008968237,0.00015027692,0.0000014980056,0.9663575,0.002177744,0.026632562,0.0032423916,0.00066722813],"about_ca_topic_score_codex":0.000004614427,"about_ca_topic_score_gemma":0.000017215538,"teacher_disagreement_score":0.8785887,"about_ca_system_score_codex":0.0005676906,"about_ca_system_score_gemma":0.0005606442,"threshold_uncertainty_score":0.9997882},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068302674,0.00007149992,0.9913959,0.00048559633,0.0063596405,0.0002212387,0.0000046807672,0.0006165994,0.000776532],"genre_scores_gemma":[0.045376785,0.000056785455,0.9512714,0.001235822,0.0014959779,0.000019924815,0.000011663879,0.00010356423,0.0004280861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951934,0.0003265074,0.0005169302,0.0018206388,0.0013723831,0.0007701258],"domain_scores_gemma":[0.9953312,0.0028279347,0.0004914174,0.00097172323,0.00024025308,0.00013742005],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025711781,0.00057716534,0.00056382845,0.0009980696,0.0010284896,0.0015543087,0.0025371506,0.00050116866,0.000014492845],"category_scores_gemma":[0.0014576087,0.0005630852,0.0002488226,0.0014047094,0.00045652778,0.0010757418,0.0009035883,0.0021238893,0.00007801643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009892508,0.000013708448,0.00007616422,0.000026785721,0.000013980811,0.0000684112,0.005254691,0.11933897,0.000053718493,0.0052626138,0.000044323657,0.86983675],"study_design_scores_gemma":[0.00024755258,0.00012373884,0.0010519653,0.00023291359,0.00001981143,0.0000108736385,7.8263065e-7,0.84376156,0.00092279614,0.15096095,0.0019495186,0.00071755063],"about_ca_topic_score_codex":0.00022426408,"about_ca_topic_score_gemma":0.00049728417,"teacher_disagreement_score":0.86911917,"about_ca_system_score_codex":0.0004282011,"about_ca_system_score_gemma":0.00031198794,"threshold_uncertainty_score":0.99968207},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044605695,0.0005430643,0.9921493,0.0008128021,0.0031740193,0.00038122962,0.0000025874558,0.00042567993,0.0024667347],"genre_scores_gemma":[0.67693776,0.00007908052,0.31401289,0.0028900586,0.0036816644,0.000029006625,0.000010565265,0.000107605905,0.002251369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553907,0.0000883886,0.0007186412,0.0017940523,0.0009671447,0.00089267484],"domain_scores_gemma":[0.9969943,0.001249001,0.00028794637,0.001084484,0.00017384256,0.00021041538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001712026,0.00049971667,0.0006536552,0.00073171046,0.00037994838,0.001022862,0.0033206863,0.00033366872,0.0000015957679],"category_scores_gemma":[0.0002326513,0.00044727625,0.00010525401,0.0014980091,0.00075942813,0.00041733816,0.0022269834,0.00081441784,0.00012724669],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024421633,0.000014997368,0.000028538048,0.000050028804,0.000007479026,0.00010392579,0.0007989491,0.025409516,0.000026321126,0.029215386,0.00006117188,0.9442812],"study_design_scores_gemma":[0.000032092976,0.00008657151,0.000062954976,0.000228711,0.0000032958685,0.0000489493,4.9469526e-7,0.56911826,0.000073585004,0.42983538,0.00013166723,0.00037802203],"about_ca_topic_score_codex":0.000033717566,"about_ca_topic_score_gemma":0.00006957356,"teacher_disagreement_score":0.9439032,"about_ca_system_score_codex":0.00027706914,"about_ca_system_score_gemma":0.0008830476,"threshold_uncertainty_score":0.9997979},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2914092,0.0009439571,0.68138564,0.0065300856,0.0018502825,0.006015099,0.0002038965,0.00024128307,0.011420559],"genre_scores_gemma":[0.9978593,0.000119560355,0.0014218558,0.00022788582,0.00009235658,0.000024763262,0.0000021009132,0.000049523067,0.00020265073],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957489,0.0000953346,0.00041596201,0.0012257546,0.0017556088,0.00075847795],"domain_scores_gemma":[0.99746364,0.0012833553,0.00026681222,0.00087337464,0.000023917335,0.000088926274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068823196,0.00038912776,0.00041139868,0.00064558454,0.0005465207,0.00020548729,0.0027080355,0.00012943026,0.00018590086],"category_scores_gemma":[0.0003072182,0.00024216152,0.00007455878,0.0011863251,0.0021899263,0.0002376282,0.0013621661,0.0013369208,0.000009837328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007802289,0.0003187575,0.01948469,0.000060788552,0.000038187143,0.00031595433,0.00530713,0.041239064,0.00048238097,0.26832557,0.0000076045008,0.66363966],"study_design_scores_gemma":[0.0031707454,0.004333902,0.036052354,0.00055018155,0.000044138014,0.00079741166,0.000007965983,0.045958236,0.015044569,0.8884053,0.0025658372,0.0030693244],"about_ca_topic_score_codex":0.00013591447,"about_ca_topic_score_gemma":0.0016158934,"teacher_disagreement_score":0.7064501,"about_ca_system_score_codex":0.00032892212,"about_ca_system_score_gemma":0.0008247503,"threshold_uncertainty_score":0.98750603},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34885174,0.0023022282,0.62946963,0.0041692667,0.0010166434,0.0050687306,0.000085285545,0.00034355212,0.008692904],"genre_scores_gemma":[0.99200684,0.00011491465,0.0069716275,0.00062953384,0.000071049224,0.000037537662,0.0000035999985,0.000054050703,0.000110844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555635,0.00012528336,0.00034402192,0.0018644354,0.0013197348,0.0007901768],"domain_scores_gemma":[0.9983821,0.00050627557,0.00019801126,0.0007741541,0.000019864683,0.00011958822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008297306,0.000461145,0.0004344235,0.0007297059,0.00039392567,0.00028966294,0.0018112765,0.00012300292,0.0001771305],"category_scores_gemma":[0.00021965444,0.0003689643,0.00004357122,0.00088168716,0.0010419795,0.0003894699,0.0016598646,0.0014686795,0.000008814938],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006721248,0.000101652055,0.03179461,0.000038096794,0.000010932884,0.00008976633,0.0023628918,0.09005205,0.002622221,0.008764518,0.0000014092187,0.8640946],"study_design_scores_gemma":[0.0038108767,0.002763643,0.11229265,0.0011071843,0.000021998801,0.0010169556,0.000004120435,0.5431746,0.022571716,0.30929366,0.00033801942,0.0036045508],"about_ca_topic_score_codex":0.00008139417,"about_ca_topic_score_gemma":0.0002580523,"teacher_disagreement_score":0.8604901,"about_ca_system_score_codex":0.0003125036,"about_ca_system_score_gemma":0.00043912677,"threshold_uncertainty_score":0.9998762},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005805082,0.000018520092,0.9912703,0.003996618,0.00038417135,0.00055669475,0.000013665799,0.00009947505,0.0030800148],"genre_scores_gemma":[0.91253096,0.000030624025,0.07939166,0.0057195565,0.0005257793,0.00004854797,0.000017723203,0.000042362186,0.0016928008],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976346,0.00003949569,0.00042374476,0.0007667745,0.0008133365,0.00032207626],"domain_scores_gemma":[0.99761784,0.00023015708,0.00020767076,0.0013790474,0.00042263,0.00014263357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010257756,0.00025393922,0.00028337887,0.00055432,0.00031304677,0.00043468375,0.0024224478,0.00016351057,0.00001120855],"category_scores_gemma":[0.00016073436,0.00019290198,0.00006812553,0.0014912847,0.00036342972,0.00043339405,0.00089892116,0.00035664442,0.000096625576],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043014184,0.000035972822,0.000012423119,0.000029117904,0.00000862401,0.0000058407986,0.003188135,0.030693553,0.0035329745,0.15818283,0.00049081555,0.8038154],"study_design_scores_gemma":[0.0004127993,0.0009891519,0.005098861,0.00073871197,0.000028047227,0.00003403674,0.000007650097,0.41476393,0.0021143835,0.5616253,0.012900907,0.0012862063],"about_ca_topic_score_codex":0.00020541094,"about_ca_topic_score_gemma":0.0003711454,"teacher_disagreement_score":0.91195047,"about_ca_system_score_codex":0.00021101681,"about_ca_system_score_gemma":0.0004620728,"threshold_uncertainty_score":0.78663146},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017531152,0.00003653069,0.9943459,0.0004685132,0.00038145104,0.0007074957,0.000008989382,0.0003125765,0.0035632162],"genre_scores_gemma":[0.27818933,0.000013534401,0.7103842,0.0015584677,0.00075731415,0.00012356916,0.000011436206,0.000105489766,0.008856685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671924,0.000020844547,0.00054650044,0.0012920778,0.000921257,0.00050010683],"domain_scores_gemma":[0.99751925,0.00031847844,0.00025816818,0.0015472053,0.00017827626,0.0001786426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007399659,0.000366615,0.00044581472,0.0009799323,0.00019446881,0.0001898761,0.003183154,0.00017224356,0.0000030350698],"category_scores_gemma":[0.000055519282,0.00035002636,0.0001263865,0.0009830861,0.00030764152,0.000041687275,0.0023521106,0.0003463766,0.0001673869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002306096,0.000020176014,0.0000034965676,0.000042958694,0.00000787013,0.000011786439,0.00041377216,0.73515224,0.00007384626,0.0087750675,0.000058416583,0.25543806],"study_design_scores_gemma":[0.00009499431,0.00011624831,0.00003403446,0.00030563647,0.000010450928,0.0000099334375,9.8712576e-8,0.9331783,0.00013060542,0.065314464,0.0004815495,0.0003236861],"about_ca_topic_score_codex":0.0000086223,"about_ca_topic_score_gemma":0.000007791578,"teacher_disagreement_score":0.28396174,"about_ca_system_score_codex":0.00017545313,"about_ca_system_score_gemma":0.0002825161,"threshold_uncertainty_score":0.99989516},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024203512,0.0012910711,0.97699594,0.00017709675,0.0030273625,0.00041482772,0.0000072492753,0.00009862966,0.01774576],"genre_scores_gemma":[0.094015196,0.0014436583,0.88992536,0.0043175416,0.003744979,0.000464043,0.00008152169,0.00034795736,0.0056597646],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972681,0.00009742257,0.0004879689,0.00088614324,0.00069454976,0.00056585274],"domain_scores_gemma":[0.99801147,0.0009414616,0.00025733619,0.0006602364,0.000061962004,0.000067517096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087159936,0.00034091843,0.000547373,0.0007579349,0.00020573464,0.00007558376,0.0010853416,0.00029616395,0.0003655678],"category_scores_gemma":[0.0002761541,0.00032804615,0.00009760687,0.0010336606,0.000450906,0.00030867,0.0006026206,0.0013297618,0.000014052426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030460189,0.00010194996,0.00015985,0.00019552521,0.000006362285,0.00015042014,0.00092027476,0.009018729,0.000042103624,0.046437044,0.0004882152,0.9424491],"study_design_scores_gemma":[0.00029672263,0.00021655462,0.0000415906,0.00011602156,0.000007941664,0.00008552454,0.000001084001,0.01805615,0.0001947787,0.9347689,0.045784865,0.00042988002],"about_ca_topic_score_codex":0.000013435825,"about_ca_topic_score_gemma":0.0006870335,"teacher_disagreement_score":0.94201916,"about_ca_system_score_codex":0.0007056495,"about_ca_system_score_gemma":0.00059422036,"threshold_uncertainty_score":0.99991715},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019484296,0.0043200445,0.98774743,0.0002932971,0.0015709493,0.0004829472,0.000025289588,0.0002177252,0.005147458],"genre_scores_gemma":[0.66148466,0.00044266338,0.33560586,0.0015839753,0.00057948596,0.000049550952,0.000045681292,0.000068450536,0.00013969152],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960156,0.00006210877,0.0004291688,0.0019697326,0.0008621824,0.00066122593],"domain_scores_gemma":[0.9974678,0.00049205264,0.0001474212,0.0015125985,0.00014480934,0.00023532377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009121773,0.0005696392,0.0005215424,0.000984274,0.0005603683,0.0006526674,0.0036693339,0.0002962266,0.000050651764],"category_scores_gemma":[0.00005837866,0.000533124,0.00014596042,0.0008447407,0.0009048759,0.00083357404,0.0040999446,0.0014104438,0.000009685803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008931309,0.000065138476,0.000102475555,0.00006375089,0.000017786964,0.000115204646,0.0019917537,0.0014497493,0.000100639656,0.21352679,0.00012369921,0.7824341],"study_design_scores_gemma":[0.0004551285,0.0004931674,0.0009861581,0.00030431664,0.00002558903,0.00016384522,5.841956e-7,0.14544725,0.0006783983,0.79738253,0.052214246,0.0018487751],"about_ca_topic_score_codex":0.000014708827,"about_ca_topic_score_gemma":0.00007356506,"teacher_disagreement_score":0.7805853,"about_ca_system_score_codex":0.00014358143,"about_ca_system_score_gemma":0.00034736717,"threshold_uncertainty_score":0.99971205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004196063,0.0002837348,0.9932852,0.00043518498,0.00083602377,0.0005083146,0.00006958792,0.00013173452,0.0040306533],"genre_scores_gemma":[0.57003886,0.00018051568,0.4290643,0.00047752514,0.00014072043,0.00002073347,0.0000341723,0.000028335948,0.000014858736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995557,0.00006646155,0.0007954342,0.0015461353,0.0014733538,0.0005616072],"domain_scores_gemma":[0.99711144,0.00047624105,0.00032610996,0.0017233952,0.00019077222,0.00017203215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017608695,0.00047155586,0.00072092155,0.00083068927,0.00029722758,0.00019714386,0.0035827227,0.00029134072,0.00007658005],"category_scores_gemma":[0.00007858489,0.0004222919,0.00034513694,0.0010247654,0.0011977482,0.0012293903,0.0012341461,0.0011665636,0.000004572282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006662226,0.00013068583,0.00004738661,0.00008849128,0.000013499421,0.000020709025,0.0010827761,0.026070887,0.00027393358,0.5480212,0.000010269548,0.4241735],"study_design_scores_gemma":[0.00059393124,0.0001734526,0.000050736224,0.000072465366,0.0000095388095,0.000016774628,2.0022003e-7,0.50781345,0.00065966754,0.48873472,0.0014792606,0.00039581736],"about_ca_topic_score_codex":0.000026373951,"about_ca_topic_score_gemma":0.00009575207,"teacher_disagreement_score":0.56961924,"about_ca_system_score_codex":0.00021298329,"about_ca_system_score_gemma":0.000725273,"threshold_uncertainty_score":0.9998229},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024203512,0.0012910711,0.97699594,0.00017709675,0.0030273625,0.00041482772,0.0000072492753,0.00009862966,0.01774576],"genre_scores_gemma":[0.094015196,0.0014436583,0.88992536,0.0043175416,0.003744979,0.000464043,0.00008152169,0.00034795736,0.0056597646],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972681,0.00009742257,0.0004879689,0.00088614324,0.00069454976,0.00056585274],"domain_scores_gemma":[0.99801147,0.0009414616,0.00025733619,0.0006602364,0.000061962004,0.000067517096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087159936,0.00034091843,0.000547373,0.0007579349,0.00020573464,0.00007558376,0.0010853416,0.00029616395,0.0003655678],"category_scores_gemma":[0.0002761541,0.00032804615,0.00009760687,0.0010336606,0.000450906,0.00030867,0.0006026206,0.0013297618,0.000014052426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030460189,0.00010194996,0.00015985,0.00019552521,0.000006362285,0.00015042014,0.00092027476,0.009018729,0.000042103624,0.046437044,0.0004882152,0.9424491],"study_design_scores_gemma":[0.00029672263,0.00021655462,0.0000415906,0.00011602156,0.000007941664,0.00008552454,0.000001084001,0.01805615,0.0001947787,0.9347689,0.045784865,0.00042988002],"about_ca_topic_score_codex":0.000013435825,"about_ca_topic_score_gemma":0.0006870335,"teacher_disagreement_score":0.94201916,"about_ca_system_score_codex":0.0007056495,"about_ca_system_score_gemma":0.00059422036,"threshold_uncertainty_score":0.99991715},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024203512,0.0012910711,0.97699594,0.00017709675,0.0030273625,0.00041482772,0.0000072492753,0.00009862966,0.01774576],"genre_scores_gemma":[0.094015196,0.0014436583,0.88992536,0.0043175416,0.003744979,0.000464043,0.00008152169,0.00034795736,0.0056597646],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972681,0.00009742257,0.0004879689,0.00088614324,0.00069454976,0.00056585274],"domain_scores_gemma":[0.99801147,0.0009414616,0.00025733619,0.0006602364,0.000061962004,0.000067517096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087159936,0.00034091843,0.000547373,0.0007579349,0.00020573464,0.00007558376,0.0010853416,0.00029616395,0.0003655678],"category_scores_gemma":[0.0002761541,0.00032804615,0.00009760687,0.0010336606,0.000450906,0.00030867,0.0006026206,0.0013297618,0.000014052426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030460189,0.00010194996,0.00015985,0.00019552521,0.000006362285,0.00015042014,0.00092027476,0.009018729,0.000042103624,0.046437044,0.0004882152,0.9424491],"study_design_scores_gemma":[0.00029672263,0.00021655462,0.0000415906,0.00011602156,0.000007941664,0.00008552454,0.000001084001,0.01805615,0.0001947787,0.9347689,0.045784865,0.00042988002],"about_ca_topic_score_codex":0.000013435825,"about_ca_topic_score_gemma":0.0006870335,"teacher_disagreement_score":0.94201916,"about_ca_system_score_codex":0.0007056495,"about_ca_system_score_gemma":0.00059422036,"threshold_uncertainty_score":0.99991715},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053430627,0.0002509285,0.99294657,0.0006841913,0.0023642497,0.0008161622,0.000010934357,0.0007519035,0.0021216508],"genre_scores_gemma":[0.0026160378,0.000049270187,0.9947566,0.00061484374,0.0007935279,0.00004530604,0.0000109875045,0.00007879687,0.0010346349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936191,0.000051673233,0.0008346641,0.0027033803,0.0016030939,0.0011880934],"domain_scores_gemma":[0.9950109,0.0016576297,0.00036439416,0.0024172186,0.00021001189,0.00033984103],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018253176,0.00084121735,0.0009998106,0.0010435974,0.00036760405,0.0012356477,0.005099504,0.00045468507,0.000006813077],"category_scores_gemma":[0.00019974308,0.000749447,0.00014940629,0.002257267,0.0013187295,0.00050103746,0.005817109,0.0011458166,0.00011197347],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022971185,0.00007322475,0.00001984583,0.00024132071,0.000022379274,0.0001636668,0.002211919,0.013319365,0.0000791052,0.012305647,0.00017620708,0.971385],"study_design_scores_gemma":[0.00021261288,0.000095013886,0.00015888679,0.0001630681,0.000008453132,0.00007349569,5.099445e-7,0.6557604,0.00016431588,0.34236646,0.00032191325,0.0006748921],"about_ca_topic_score_codex":0.000015278349,"about_ca_topic_score_gemma":0.00004551195,"teacher_disagreement_score":0.97071016,"about_ca_system_score_codex":0.00054750056,"about_ca_system_score_gemma":0.0010347331,"threshold_uncertainty_score":0.99980116},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010474561,0.00030010383,0.9724104,0.0002603895,0.0004683311,0.000622468,0.0000050295234,0.00034827882,0.025574569],"genre_scores_gemma":[0.07214716,0.00038010196,0.9232848,0.0010234709,0.0002935792,0.00012616212,0.000054311455,0.0002444346,0.0024459409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983488,0.000017231147,0.00042037756,0.000532287,0.00030887302,0.00037243497],"domain_scores_gemma":[0.9981608,0.00023735399,0.000065196575,0.0013964977,0.000057833524,0.0000823246],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039973223,0.00029418705,0.00029376533,0.0009946015,0.0000891437,0.00008934337,0.0015627578,0.00015864847,0.000005112905],"category_scores_gemma":[0.000027290615,0.0003296724,0.00003667273,0.00095501804,0.00012975265,0.0001442586,0.0007908937,0.0004862404,0.00014437232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.8543055e-7,0.000003357758,0.000009028624,0.000068760535,0.0000060248663,0.0000146333405,0.00035271436,0.88141596,0.000013738273,0.0018749863,0.000026806822,0.11621308],"study_design_scores_gemma":[0.0001960891,0.00002162424,0.000103085644,0.0012728639,0.000009281766,0.000007418404,0.0000022502738,0.97055435,0.00007487791,0.008419042,0.01874733,0.00059178274],"about_ca_topic_score_codex":0.000011563939,"about_ca_topic_score_gemma":0.00049967435,"teacher_disagreement_score":0.1156213,"about_ca_system_score_codex":0.00045536645,"about_ca_system_score_gemma":0.000030032032,"threshold_uncertainty_score":0.99991554},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018664161,0.00011818397,0.9941232,0.0009825459,0.00074054446,0.0006080273,0.000008220965,0.00037561278,0.0028570227],"genre_scores_gemma":[0.055052962,0.00035709687,0.93410504,0.0025187542,0.00069074996,0.00007183067,0.000054179833,0.00020258606,0.0069467756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99568295,0.00007096665,0.0005695129,0.0017066419,0.0010930556,0.0008768612],"domain_scores_gemma":[0.99731654,0.000680043,0.00021326543,0.0013153047,0.00025565582,0.00021918956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011855561,0.00050290354,0.0005749986,0.0012350256,0.00019161525,0.0005820081,0.0024655191,0.00029520752,0.000039487146],"category_scores_gemma":[0.00018514368,0.0004298549,0.000077918776,0.0017100034,0.0004943886,0.0006277353,0.0009742871,0.0010963884,0.00011146106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040646115,0.00007518033,0.00040515556,0.00008614177,0.00001949209,0.00044725437,0.0022242095,0.4173543,0.000055324177,0.008294031,0.00013013853,0.57086813],"study_design_scores_gemma":[0.00061672635,0.00042233284,0.0002624068,0.00041290754,0.0000036768743,0.00007489408,9.787068e-7,0.96595913,0.0005963897,0.02729639,0.0036181621,0.00073599484],"about_ca_topic_score_codex":0.00013670653,"about_ca_topic_score_gemma":0.0013047777,"teacher_disagreement_score":0.57013214,"about_ca_system_score_codex":0.0002879764,"about_ca_system_score_gemma":0.0007911677,"threshold_uncertainty_score":0.99981534},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7938296,0.00012830243,0.20534854,0.00027848038,0.0001842228,0.00019877814,0.000018118137,0.000009034992,0.0000049007654],"genre_scores_gemma":[0.9961561,6.596489e-7,0.0030864438,0.0007189953,0.000010723783,0.000012890695,0.00000768955,0.0000056577996,8.6204443e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850047,0.00006599672,0.00020618214,0.00037064133,0.00060994126,0.00024679702],"domain_scores_gemma":[0.9992036,0.00019940006,0.00005746575,0.00042887466,0.000042451036,0.00006816661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026898872,0.00011383569,0.00035072648,0.0006171512,0.000113810784,0.000015920457,0.0002511381,0.00002166768,0.000030189989],"category_scores_gemma":[0.00008473546,0.00008036332,0.0007447424,0.0037185987,0.00016379038,0.00004993845,0.00020526595,0.00018321759,8.332413e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012532427,0.0001577095,0.3375304,0.000007017708,0.000075425,0.00001145168,0.00007535293,0.660077,0.00009758225,0.000002812279,0.0000010849203,0.0019516707],"study_design_scores_gemma":[0.0003919458,0.000091824935,0.48240724,0.000011396277,0.00026061537,0.000012165127,6.1234937e-7,0.51655024,0.00010541137,0.00012175612,0.0000010920438,0.000045676843],"about_ca_topic_score_codex":0.00007359826,"about_ca_topic_score_gemma":0.000022259384,"teacher_disagreement_score":0.20232646,"about_ca_system_score_codex":0.00023052703,"about_ca_system_score_gemma":0.00033803246,"threshold_uncertainty_score":0.32771212},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020181289,0.0014323649,0.99643034,0.0004932961,0.000056773813,0.0009842953,0.0000044944777,0.000082511186,0.00031410035],"genre_scores_gemma":[0.16648178,0.00012766464,0.8309887,0.0014051604,0.0002161062,0.0003953785,0.00010685012,0.00006628079,0.00021209325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872875,0.000014630803,0.00018927273,0.00059088384,0.00029423434,0.0001822012],"domain_scores_gemma":[0.9992355,0.00015364448,0.00014410139,0.00027933717,0.00012828392,0.00005913989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002955864,0.00017063094,0.00019654394,0.00023796583,0.0002557288,0.000043166234,0.00010276532,0.00005933051,0.00001859798],"category_scores_gemma":[0.000035175864,0.00015854402,0.000033681757,0.00017539994,0.00024086857,0.00011911935,0.000052129457,0.0003384727,6.7087973e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032058815,0.000010501817,0.0010015417,0.000034531502,7.254247e-7,0.000002947464,0.00008264081,0.016517492,0.0024671059,0.000813303,0.0000023617013,0.9790348],"study_design_scores_gemma":[0.000828506,0.00084700366,0.010453923,0.0004022586,0.00006691689,0.000019712892,0.0000039447004,0.9389549,0.004504961,0.006900702,0.03654283,0.00047437105],"about_ca_topic_score_codex":0.000003421777,"about_ca_topic_score_gemma":0.000004882493,"teacher_disagreement_score":0.97856045,"about_ca_system_score_codex":0.0002414495,"about_ca_system_score_gemma":0.00011735145,"threshold_uncertainty_score":0.6465237},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043674876,0.002732425,0.9944954,0.00013335951,0.00044349144,0.0010098272,0.000024726916,0.00059956755,0.00012449131],"genre_scores_gemma":[0.8522456,0.00017624046,0.14261188,0.0005865001,0.0012458422,0.00028444375,0.0019834766,0.00056423014,0.00030176694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966441,0.000055289747,0.00059841835,0.0011053223,0.0006150652,0.0009818422],"domain_scores_gemma":[0.9982613,0.00061795383,0.00015164494,0.00069447415,0.00010985009,0.00016479834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012994582,0.0006432776,0.0006507046,0.00067868276,0.0001836967,0.00017181359,0.0009696121,0.0006261879,0.0000048122065],"category_scores_gemma":[0.00012525321,0.00067674374,0.0001774301,0.00096890645,0.00024370392,0.00004803949,0.00022147031,0.0017176593,0.0000059571307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018255801,0.000013144524,0.000031870382,0.00011260228,0.00001885129,0.00003559735,0.00010385722,0.934871,0.000026922213,0.00008450649,0.00002437364,0.06465898],"study_design_scores_gemma":[0.0005747711,0.00009090304,0.000045019522,0.0004455796,0.000021022213,0.00001175759,3.750497e-7,0.9931771,0.000055665627,0.0009174234,0.0039893775,0.0006709885],"about_ca_topic_score_codex":0.000008881176,"about_ca_topic_score_gemma":0.00018576797,"teacher_disagreement_score":0.8518835,"about_ca_system_score_codex":0.00058521074,"about_ca_system_score_gemma":0.0001259368,"threshold_uncertainty_score":0.9995684},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007154102,0.00015739193,0.99278027,0.0033894302,0.0010284673,0.001231489,0.000041238407,0.0003213425,0.0009788556],"genre_scores_gemma":[0.049281564,0.000019043355,0.94738513,0.0019026364,0.00049401843,0.00019615705,0.00015586261,0.0000748669,0.0004907129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99551845,0.00007599416,0.00072925526,0.0020067226,0.0009661289,0.0007034273],"domain_scores_gemma":[0.9961076,0.0006778033,0.00055506895,0.0021672023,0.00027858483,0.0002137661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017837656,0.00051464356,0.00047310165,0.0005609637,0.0007439438,0.000625507,0.0044692727,0.00024506022,0.000046921956],"category_scores_gemma":[0.000108364184,0.00053481583,0.00016482553,0.00067674427,0.00043551825,0.001123875,0.0020015398,0.000923777,0.000035339814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009210232,0.000090858644,0.000010744215,0.0000808904,0.000022589822,0.000008930559,0.0027216126,0.39157227,0.001822355,0.091984816,0.00012835623,0.5115474],"study_design_scores_gemma":[0.00031814442,0.00025821046,0.000027951062,0.00026313838,0.000016502088,0.000101730155,0.0000012837014,0.7470198,0.0026838926,0.22537056,0.023059892,0.00087886775],"about_ca_topic_score_codex":0.000053882894,"about_ca_topic_score_gemma":0.0001150212,"teacher_disagreement_score":0.5106685,"about_ca_system_score_codex":0.00071861374,"about_ca_system_score_gemma":0.0005188189,"threshold_uncertainty_score":0.9997103},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32962066,0.004391539,0.5344384,0.017160218,0.005630028,0.010016534,0.00013340809,0.00070096337,0.09790827],"genre_scores_gemma":[0.9937415,0.000018811133,0.0040482352,0.00091495615,0.0004580609,0.00013818809,0.000040425573,0.00003579099,0.00060403533],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99755144,0.00013857767,0.0002810425,0.00080754206,0.00069482456,0.0005265952],"domain_scores_gemma":[0.9989457,0.00028107828,0.00014040679,0.00055766595,0.00003442432,0.000040699033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006528434,0.00028227147,0.0002966651,0.00035600105,0.00032253674,0.00015945041,0.00090911495,0.00012698962,0.0004671349],"category_scores_gemma":[0.000023067687,0.00019408489,0.00006471074,0.00029870414,0.00044575593,0.00012081126,0.00035992035,0.0008045865,0.000054241053],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003174662,0.0006384204,0.0039697024,0.00007455827,0.00009835606,0.016008193,0.11851064,0.0030136122,0.00026343393,0.0047250465,0.0002494282,0.8521311],"study_design_scores_gemma":[0.05031348,0.0370816,0.58098656,0.004637402,0.0006017208,0.006299162,0.0026487233,0.008967761,0.0023649358,0.25722137,0.031631652,0.017245663],"about_ca_topic_score_codex":0.00020452887,"about_ca_topic_score_gemma":0.000745581,"teacher_disagreement_score":0.8348855,"about_ca_system_score_codex":0.0002567385,"about_ca_system_score_gemma":0.00009570513,"threshold_uncertainty_score":0.7914552},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005445447,0.00084988744,0.7708234,0.0050085457,0.014019335,0.002572439,0.00018267677,0.0003000556,0.20079821],"genre_scores_gemma":[0.93861663,0.00008618988,0.03285558,0.012551922,0.0017555789,0.00040576965,0.00014664042,0.00025487627,0.013326834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973098,0.000082501705,0.00038255117,0.0010448642,0.0006704755,0.00050980534],"domain_scores_gemma":[0.9982363,0.0006891379,0.0002883888,0.00050439325,0.0001508652,0.0001309053],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034388865,0.00040830905,0.00051933044,0.00080347474,0.00015393559,0.00013927965,0.0008113965,0.00031334005,0.0026480241],"category_scores_gemma":[0.000083640836,0.000376157,0.000071943476,0.000899261,0.0005713836,0.00016992351,0.00027160975,0.0014687623,0.0001590055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019408804,0.00082064903,0.005402329,0.00007358144,0.00035934686,0.0051428284,0.15502357,0.119273886,0.00006939115,0.44132563,0.0015316784,0.26903623],"study_design_scores_gemma":[0.024261434,0.01818191,0.016898394,0.0042950395,0.00035681808,0.003571599,0.0016276918,0.30975667,0.00050674553,0.29364613,0.3108578,0.016039783],"about_ca_topic_score_codex":0.00032808122,"about_ca_topic_score_gemma":0.0056106485,"teacher_disagreement_score":0.93317115,"about_ca_system_score_codex":0.0013034362,"about_ca_system_score_gemma":0.0008286128,"threshold_uncertainty_score":0.99986905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024586264,0.00039245348,0.9700074,0.00011350557,0.00086441316,0.00029176657,0.0000017290231,0.00016007712,0.0035823644],"genre_scores_gemma":[0.98993677,0.000019755504,0.00971772,0.00014517215,0.000089518515,0.0000012316694,0.000004484865,0.00003392877,0.000051394647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987942,0.000019680312,0.00024070255,0.0003516365,0.00037506327,0.0002187362],"domain_scores_gemma":[0.999212,0.00032458015,0.00008876397,0.00028363644,0.000021026479,0.000069976326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002898117,0.0002325522,0.0002721745,0.00045664908,0.00013846558,0.00007552151,0.0003147092,0.00009853187,0.00008966671],"category_scores_gemma":[0.000092797585,0.00021185767,0.000045317913,0.00013619907,0.00011189599,0.00014959625,0.00017514318,0.00078983844,0.000002443544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003637402,0.000005798411,0.0007221356,0.00003821237,0.0000039141837,0.00001067923,0.00048367784,0.96167445,0.00041133992,0.0005813502,0.0000029483076,0.036061853],"study_design_scores_gemma":[0.00022211495,0.000066762,0.007070278,0.00040335703,0.0000052857476,0.000020214402,3.7753287e-7,0.99032193,0.00012574531,0.0009225107,0.00057565735,0.0002657541],"about_ca_topic_score_codex":0.000035291963,"about_ca_topic_score_gemma":0.0000166717,"teacher_disagreement_score":0.9653505,"about_ca_system_score_codex":0.00011040735,"about_ca_system_score_gemma":0.000036715293,"threshold_uncertainty_score":0.8639305},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44100407,0.000077227945,0.53915185,0.0063840817,0.0009292745,0.0073881294,0.000058318114,0.00017773222,0.0048293285],"genre_scores_gemma":[0.9299877,0.0000074239065,0.067759186,0.0008353256,0.00012643372,0.00080098497,0.000042010462,0.000028975413,0.0004119089],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9969554,0.00031808243,0.00057935016,0.00061281695,0.0012130287,0.0003213002],"domain_scores_gemma":[0.9969804,0.001459893,0.0004109089,0.00047320625,0.0006454643,0.000030122428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038075594,0.00019834272,0.00040560582,0.0004381283,0.00079449336,0.000016146761,0.0009215313,0.00027642937,0.0003296115],"category_scores_gemma":[0.0012909316,0.00019482574,0.00005079755,0.00034085193,0.0007218895,0.00012639783,0.0010326463,0.001409944,0.0000060130856],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082320167,0.0006587869,0.2364309,0.0009010052,0.00014011086,0.000001327886,0.03317218,0.08262356,0.00023433167,0.11231501,0.00008379436,0.5326158],"study_design_scores_gemma":[0.009051863,0.0024784368,0.54880303,0.0036996517,0.00024133422,0.000009793524,0.0005464241,0.033267472,0.00022538203,0.3828144,0.016855136,0.0020071005],"about_ca_topic_score_codex":0.000057146506,"about_ca_topic_score_gemma":0.00063744007,"teacher_disagreement_score":0.5306087,"about_ca_system_score_codex":0.0012423801,"about_ca_system_score_gemma":0.001146947,"threshold_uncertainty_score":0.7944763},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019043393,0.00028666444,0.99427587,0.00096898054,0.00022429938,0.0015567779,0.00010102663,0.000035820376,0.00064620876],"genre_scores_gemma":[0.65380114,0.0003321744,0.3350724,0.00760199,0.00047955455,0.00012280335,0.0019010642,0.00009245296,0.0005963899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782574,0.000018647266,0.00028381843,0.0010013374,0.0005368007,0.00033363275],"domain_scores_gemma":[0.9989871,0.00013273729,0.0001712879,0.00049953023,0.00011341,0.00009594214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004164169,0.0003173201,0.0006079061,0.00082283065,0.0003341581,0.00008259921,0.0003984585,0.00011755553,0.0000816688],"category_scores_gemma":[0.000054091546,0.00025685778,0.00009898767,0.00059417944,0.00032002467,0.00020311784,0.00049706467,0.00033788066,4.6056834e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049154684,0.0003298371,0.046633728,0.0002423908,0.0077550006,0.000103300874,0.0030203513,0.041756265,0.000056234174,0.0028592714,0.00029426388,0.8920339],"study_design_scores_gemma":[0.025316065,0.0129777165,0.17534502,0.0011201842,0.006707706,0.00035345985,0.000025230638,0.7541893,0.00036329607,0.016340375,0.0038215145,0.003440148],"about_ca_topic_score_codex":0.00018223735,"about_ca_topic_score_gemma":0.000575217,"teacher_disagreement_score":0.88859373,"about_ca_system_score_codex":0.00027065817,"about_ca_system_score_gemma":0.00073211174,"threshold_uncertainty_score":0.9999884},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046861067,0.0011574617,0.9907831,0.0061005284,0.0005113497,0.0006744309,0.000020033596,0.00023032901,0.000054160275],"genre_scores_gemma":[0.19356374,0.00009299863,0.70404273,0.10040286,0.0009789969,0.000046925023,0.00018557043,0.0003216711,0.00036451375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99538976,0.00013253312,0.0005481554,0.0017922915,0.0013882791,0.0007489872],"domain_scores_gemma":[0.9960045,0.0022594586,0.0004823868,0.0005387051,0.00022687606,0.00048805462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012881553,0.0006797109,0.00092106016,0.0008294441,0.0012075056,0.00031535502,0.000609859,0.00043660874,0.000126708],"category_scores_gemma":[0.0012766118,0.00071440166,0.00018689108,0.0005316575,0.0012385664,0.00023014746,0.0007821183,0.0020244217,0.000002628393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075089665,0.00008255325,0.0035205698,0.00022278483,0.0000589175,0.0005084191,0.0014087973,0.90669596,0.0003603465,0.000068951274,0.00004088812,0.0869567],"study_design_scores_gemma":[0.0019477495,0.00039122032,0.0007727539,0.00088151434,0.00016165258,0.00018071833,0.0000022062015,0.9893169,0.00013600593,0.00035227835,0.005062672,0.0007943678],"about_ca_topic_score_codex":0.0008097991,"about_ca_topic_score_gemma":0.00014466024,"teacher_disagreement_score":0.2867404,"about_ca_system_score_codex":0.002314348,"about_ca_system_score_gemma":0.0026363884,"threshold_uncertainty_score":0.99953073},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007611919,0.000012425914,0.9716312,0.0012530726,0.015793264,0.00075817906,0.000022627319,0.00019632628,0.009571693],"genre_scores_gemma":[0.6481203,0.00010856365,0.19684887,0.007897425,0.0044963695,0.00014641401,0.00021914659,0.00034122085,0.1418217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99199563,0.00006768253,0.00086362695,0.0026663302,0.0037746,0.00063210033],"domain_scores_gemma":[0.9952449,0.0015643839,0.00017064204,0.0020795777,0.00060177565,0.0003386811],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0058331247,0.00044107216,0.0004974449,0.0025992326,0.00044504317,0.0015099414,0.0025714627,0.00013100277,0.00006989886],"category_scores_gemma":[0.0012664254,0.00032498402,0.000105192965,0.003586347,0.00030629823,0.00041808691,0.0008504907,0.0005129332,0.0011085866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053591517,0.000017805032,0.000054372133,0.000005373884,0.0000051512625,0.000021183687,0.00093498745,0.15275455,0.000037567086,0.001111397,0.007815674,0.83718836],"study_design_scores_gemma":[0.00075935887,0.0027952832,0.0052354713,0.00238925,0.000051949468,0.000046765443,0.000019169547,0.7673566,0.00066658633,0.0836253,0.13448355,0.002570758],"about_ca_topic_score_codex":0.00014058163,"about_ca_topic_score_gemma":0.003464008,"teacher_disagreement_score":0.8346176,"about_ca_system_score_codex":0.00036198302,"about_ca_system_score_gemma":0.00038966603,"threshold_uncertainty_score":0.99992025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019274725,0.0002793341,0.9824371,0.000506192,0.0011925758,0.0009668817,0.00017672432,0.0001121289,0.012401625],"genre_scores_gemma":[0.9616986,0.000026675954,0.03507485,0.0005209141,0.00036460653,0.000112497146,0.000036203746,0.00004984194,0.0021158364],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99478513,0.00008068192,0.0009559713,0.0017371336,0.0018632045,0.00057790463],"domain_scores_gemma":[0.99070686,0.0059166322,0.0010982786,0.0015076775,0.00061567314,0.00015489795],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0049415743,0.00043781113,0.0006280035,0.00073046505,0.00081794104,0.0009545387,0.0029691919,0.00020956343,0.0009797154],"category_scores_gemma":[0.0014889105,0.0003464076,0.00022677467,0.0007378026,0.000983523,0.0006135169,0.0007543554,0.0007512795,0.000050099807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011537434,0.000083301435,0.00004508653,0.00002704541,0.000027732003,0.000077464,0.0026043989,0.10892231,0.0009432281,0.1635912,0.00030554904,0.7232573],"study_design_scores_gemma":[0.0003657141,0.00013108198,0.0002782649,0.00010581243,0.000012259768,0.000029292292,0.00001859354,0.03525825,0.0006263707,0.9444942,0.018161878,0.0005183108],"about_ca_topic_score_codex":0.000026596543,"about_ca_topic_score_gemma":0.00022149445,"teacher_disagreement_score":0.9597711,"about_ca_system_score_codex":0.00020214633,"about_ca_system_score_gemma":0.0008097826,"threshold_uncertainty_score":0.99993354},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15691747,0.000025523408,0.838568,0.0020486347,0.0012701355,0.00042977033,0.000030918687,0.00017567686,0.00053388934],"genre_scores_gemma":[0.9920429,0.000009356536,0.0057221707,0.001935433,0.0001121051,0.000006384296,0.0000035197852,0.000032360495,0.00013576499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970453,0.00006846186,0.00040769737,0.0012876053,0.0007834502,0.00040747915],"domain_scores_gemma":[0.99390066,0.0052989344,0.00020169374,0.00044738426,0.000078363104,0.00007294235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006917822,0.0003226552,0.00042459217,0.0008734302,0.00016895986,0.00008689333,0.00075568137,0.00019153555,0.000008445044],"category_scores_gemma":[0.0038756419,0.00029050058,0.00007853703,0.0007424489,0.00060358737,0.00043052447,0.00060987554,0.0005710665,0.000006828546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019488556,0.00006441465,0.004222704,0.000045102734,0.0000036726474,0.00012290008,0.0024679583,0.9377328,0.041158795,0.006397304,0.000011855327,0.0077529964],"study_design_scores_gemma":[0.00015601137,0.00010842442,0.0019084906,0.00015256916,0.0000034374173,0.000008584279,9.901064e-7,0.8667084,0.007044903,0.12360892,0.000004920195,0.00029435512],"about_ca_topic_score_codex":0.000033086944,"about_ca_topic_score_gemma":0.00027402208,"teacher_disagreement_score":0.83512545,"about_ca_system_score_codex":0.00027148644,"about_ca_system_score_gemma":0.00018472623,"threshold_uncertainty_score":0.9999547},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034036162,0.00029757112,0.98783594,0.0006715594,0.0061851866,0.0019587616,0.000010044972,0.0006765728,0.0023303116],"genre_scores_gemma":[0.092887774,0.000051808893,0.8990543,0.0009079953,0.002177683,0.00033755696,0.00003386497,0.00025099757,0.004298051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937883,0.000060291048,0.00097326026,0.0024977392,0.0014249305,0.0012555062],"domain_scores_gemma":[0.99527615,0.0014589742,0.00051771605,0.00195332,0.0004832012,0.00031061622],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020456451,0.0008180372,0.0009978947,0.00089549413,0.00034534096,0.0014149896,0.004971235,0.00047044596,0.00001113726],"category_scores_gemma":[0.00020414863,0.0007318256,0.00035615507,0.00085930043,0.0007141885,0.00065237645,0.0016327697,0.0007760627,0.00027363765],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061925666,0.000045078712,0.000034348108,0.00023531089,0.000037337682,0.000071564755,0.0007126996,0.012558183,0.00013038589,0.052929834,0.00009438682,0.9331447],"study_design_scores_gemma":[0.0005746478,0.00038849527,0.00006195991,0.0019620443,0.000022193879,0.000082734616,5.935892e-7,0.8987287,0.00077416847,0.08804546,0.007937737,0.0014212116],"about_ca_topic_score_codex":0.000025258449,"about_ca_topic_score_gemma":0.00006046804,"teacher_disagreement_score":0.9317235,"about_ca_system_score_codex":0.00039071846,"about_ca_system_score_gemma":0.00073961815,"threshold_uncertainty_score":0.9996216},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026088697,0.0008031373,0.57215846,0.013926537,0.0062724673,0.0010854932,0.000017023862,0.0005056979,0.4049703],"genre_scores_gemma":[0.8123222,0.0052003544,0.019143354,0.03755573,0.010671437,0.000020934518,0.000057440604,0.00023281784,0.11479571],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974757,0.00004347133,0.0003496662,0.0003968994,0.0011589082,0.000575366],"domain_scores_gemma":[0.9982815,0.00068182865,0.00021490034,0.00046464126,0.00019379353,0.00016337229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022425684,0.0002458921,0.0002576701,0.00035915358,0.0009888543,0.000653621,0.0014047236,0.00022741327,0.00019398275],"category_scores_gemma":[0.00059645146,0.00017150535,0.00008932275,0.0005707327,0.001512322,0.00038381323,0.00027350703,0.0005479857,0.00025241455],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046003365,0.00000674656,0.000014135653,0.000024559955,0.000015043256,0.000017087641,0.110527374,0.0040685004,0.00001731464,0.20510934,0.0011859667,0.6790093],"study_design_scores_gemma":[0.00049531314,0.00013059861,0.00069368,0.00065264344,0.000029265882,0.000017640059,0.00012581263,0.03518668,0.0002924089,0.1340108,0.82701147,0.001353703],"about_ca_topic_score_codex":0.00047935452,"about_ca_topic_score_gemma":0.0014478579,"teacher_disagreement_score":0.8258255,"about_ca_system_score_codex":0.00020211418,"about_ca_system_score_gemma":0.00082651677,"threshold_uncertainty_score":0.76055676},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002232655,0.00014117434,0.9942591,0.00046203798,0.0010788203,0.0032293133,0.000024161,0.0004675691,0.00011453813],"genre_scores_gemma":[0.05180371,0.00002002535,0.9446354,0.000613911,0.0006881454,0.0012986528,0.000031282474,0.00008683625,0.00082207075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648523,0.000024380197,0.00056183914,0.0016012884,0.0007454379,0.0005818368],"domain_scores_gemma":[0.9968003,0.00058207416,0.0002971465,0.0014984164,0.000644928,0.00017713907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010315066,0.00045455917,0.00051843195,0.00061219174,0.00036949417,0.0007135831,0.0024682696,0.00027879642,6.360648e-7],"category_scores_gemma":[0.00004400782,0.0003507561,0.00009725474,0.0009296421,0.00023547729,0.0006061319,0.0006177567,0.00029976544,0.00006882052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020581445,0.000052799212,0.00027696483,0.0011139998,0.000028538112,0.000007028402,0.0017201666,0.8247287,0.00013580661,0.00864854,0.000037326583,0.16322955],"study_design_scores_gemma":[0.00037144704,0.0001946198,0.00021148783,0.00084056833,0.0000115136945,0.000020943582,0.0000015554841,0.99094456,0.00042303884,0.0045354124,0.0018296394,0.00061520067],"about_ca_topic_score_codex":0.00012603663,"about_ca_topic_score_gemma":0.00040449173,"teacher_disagreement_score":0.16621587,"about_ca_system_score_codex":0.0003078229,"about_ca_system_score_gemma":0.00035454685,"threshold_uncertainty_score":0.99989444},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041125197,0.00008245336,0.99033934,0.00046270504,0.0072967294,0.0005868268,0.00001444176,0.0005821729,0.00022407745],"genre_scores_gemma":[0.062623285,0.00005621307,0.9323475,0.0015553288,0.002368847,0.000051262876,0.00003837097,0.00009418889,0.00086499844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960894,0.00011775574,0.000547104,0.0019167201,0.0006258738,0.0007031413],"domain_scores_gemma":[0.99647444,0.0013158211,0.00033822906,0.001358568,0.0003251689,0.00018775999],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015801794,0.00051015633,0.0005756281,0.0010662203,0.00035780767,0.0004378468,0.0025182555,0.0005621474,0.0000072494186],"category_scores_gemma":[0.00040605688,0.00049469335,0.00018413688,0.00088944566,0.00030581435,0.0007318005,0.00058697676,0.00075357256,0.000032331103],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018924107,0.000022078128,0.0000028441784,0.000031325464,0.000010379728,0.000010290336,0.0005427836,0.01024067,0.0046270606,0.0028581943,0.000009197997,0.9816263],"study_design_scores_gemma":[0.00049948203,0.0010437798,0.00016551401,0.00018639378,0.000020289639,0.000059788636,7.223126e-7,0.6292289,0.03279015,0.33261672,0.0024912374,0.0008970559],"about_ca_topic_score_codex":0.00013526654,"about_ca_topic_score_gemma":0.0039802473,"teacher_disagreement_score":0.9807292,"about_ca_system_score_codex":0.000254246,"about_ca_system_score_gemma":0.00029121316,"threshold_uncertainty_score":0.9997505},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005860264,0.00006465857,0.9912575,0.00023595468,0.0003959649,0.00074412965,0.0004244173,0.0003309744,0.0006861724],"genre_scores_gemma":[0.38520643,0.000017199869,0.6026692,0.0001228976,0.000484421,0.00012052175,0.00006721918,0.00012632499,0.011185819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947378,0.00003947713,0.0011960381,0.001675483,0.0015513818,0.00079983356],"domain_scores_gemma":[0.9957279,0.0017205289,0.0005845058,0.0010864893,0.0007338419,0.00014673133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002660927,0.00051197776,0.00095581065,0.0015758921,0.0007781428,0.00075482944,0.0018191483,0.00023974158,0.000030745134],"category_scores_gemma":[0.00060560706,0.0004119902,0.00046227782,0.0019020638,0.00080889644,0.00040117148,0.00046005615,0.00035434435,0.000028740495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010565251,0.000028367876,0.00015801704,0.00034157903,0.00019964113,0.00006947803,0.0031625153,0.90517175,0.0011502468,0.006117045,0.00022805869,0.08326764],"study_design_scores_gemma":[0.000124543,0.00009983914,0.000050233164,0.00045817991,0.00007280432,0.000045613062,0.000011340745,0.9420675,0.0010549679,0.054528095,0.0010061474,0.0004807605],"about_ca_topic_score_codex":0.00008115454,"about_ca_topic_score_gemma":0.00018807354,"teacher_disagreement_score":0.3885883,"about_ca_system_score_codex":0.00042727953,"about_ca_system_score_gemma":0.00022081315,"threshold_uncertainty_score":0.99983317},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013885612,0.00021912623,0.9951046,0.00040720106,0.0011066012,0.00025428567,0.000009435203,0.00009827508,0.0014119215],"genre_scores_gemma":[0.50401574,0.00014243516,0.49321258,0.0004875328,0.0003790247,0.00001526838,0.000027902903,0.000036562196,0.0016829798],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749047,0.00003375392,0.00045481432,0.0010453076,0.0007057739,0.00026987877],"domain_scores_gemma":[0.9979209,0.0006734493,0.00021514368,0.00079394697,0.00028986137,0.00010670819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077956973,0.00024487826,0.00031812713,0.0007675267,0.00016710504,0.00019253633,0.0010006777,0.00014477367,0.000014103903],"category_scores_gemma":[0.00016202172,0.00024068654,0.000087037166,0.0009121265,0.0004625348,0.00043063442,0.0008130707,0.00028386936,0.000012046813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067165065,0.000041481093,0.00039768638,0.0000744364,0.000019473588,0.000024843444,0.000933342,0.08618454,0.0006584306,0.20467329,0.000050091643,0.70693564],"study_design_scores_gemma":[0.000210585,0.00013821208,0.0047456753,0.00011275202,0.000007694557,0.00002591767,3.4004682e-7,0.35018554,0.0015900908,0.6424047,0.0002297397,0.0003487819],"about_ca_topic_score_codex":0.00003417965,"about_ca_topic_score_gemma":0.000087058215,"teacher_disagreement_score":0.7065869,"about_ca_system_score_codex":0.00006692889,"about_ca_system_score_gemma":0.0003133867,"threshold_uncertainty_score":0.9814912},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044605695,0.0005430643,0.9921493,0.0008128021,0.0031740193,0.00038122962,0.0000025874558,0.00042567993,0.0024667347],"genre_scores_gemma":[0.67693776,0.00007908052,0.31401289,0.0028900586,0.0036816644,0.000029006625,0.000010565265,0.000107605905,0.002251369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553907,0.0000883886,0.0007186412,0.0017940523,0.0009671447,0.00089267484],"domain_scores_gemma":[0.9969943,0.001249001,0.00028794637,0.001084484,0.00017384256,0.00021041538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001712026,0.00049971667,0.0006536552,0.00073171046,0.00037994838,0.001022862,0.0033206863,0.00033366872,0.0000015957679],"category_scores_gemma":[0.0002326513,0.00044727625,0.00010525401,0.0014980091,0.00075942813,0.00041733816,0.0022269834,0.00081441784,0.00012724669],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024421633,0.000014997368,0.000028538048,0.000050028804,0.000007479026,0.00010392579,0.0007989491,0.025409516,0.000026321126,0.029215386,0.00006117188,0.9442812],"study_design_scores_gemma":[0.000032092976,0.00008657151,0.000062954976,0.000228711,0.0000032958685,0.0000489493,4.9469526e-7,0.56911826,0.000073585004,0.42983538,0.00013166723,0.00037802203],"about_ca_topic_score_codex":0.000033717566,"about_ca_topic_score_gemma":0.00006957356,"teacher_disagreement_score":0.9439032,"about_ca_system_score_codex":0.00027706914,"about_ca_system_score_gemma":0.0008830476,"threshold_uncertainty_score":0.9997979},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014506106,0.00043867237,0.996763,0.00043268892,0.001433935,0.00024145449,0.0000021250878,0.0001468488,0.00039623547],"genre_scores_gemma":[0.72949016,0.0013012153,0.26591927,0.0012280804,0.0008068406,0.00003942896,0.000018857958,0.00008526136,0.001110856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977612,0.000014627385,0.00039065437,0.0009968313,0.00046125182,0.00037544893],"domain_scores_gemma":[0.99816793,0.00050960766,0.0002971147,0.0007874157,0.00011268456,0.0001252536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003795267,0.0003155824,0.0003624864,0.00032160795,0.00021616972,0.00017316692,0.0012301513,0.00023487494,0.0000048323673],"category_scores_gemma":[0.000028096947,0.0002589026,0.00006826781,0.0006735888,0.00067021407,0.00032381553,0.0008958508,0.00047459928,0.000011669524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007630538,0.000013395825,0.00028990555,0.000045637375,0.000010857492,0.000017046514,0.00012219588,0.10448881,0.00029130798,0.05875983,0.00017208706,0.8357813],"study_design_scores_gemma":[0.000084713465,0.000089537985,0.00058481115,0.00035677606,0.0000076028787,0.000013287801,7.750501e-8,0.88596684,0.0002004737,0.11214081,0.00030749274,0.00024757563],"about_ca_topic_score_codex":0.000013560202,"about_ca_topic_score_gemma":0.000024126846,"teacher_disagreement_score":0.83553374,"about_ca_system_score_codex":0.00004769474,"about_ca_system_score_gemma":0.000113556875,"threshold_uncertainty_score":0.9999863},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028393964,0.000961734,0.9834375,0.0032278833,0.0056935037,0.00041433237,0.000008751657,0.00054029084,0.005687622],"genre_scores_gemma":[0.54270285,0.0039814855,0.43697512,0.0032698945,0.0059518665,0.0000985191,0.000036174166,0.00040971057,0.006574377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939882,0.00018249612,0.0008606943,0.002110806,0.0016819327,0.0011758794],"domain_scores_gemma":[0.9931915,0.0038200899,0.00046787533,0.0020171157,0.00032096158,0.00018245568],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0058709546,0.00065267144,0.00061919785,0.0006821357,0.0010305699,0.001411286,0.005211144,0.00035504936,0.000002972263],"category_scores_gemma":[0.00076407386,0.00047800416,0.00025555716,0.0011923964,0.0008100413,0.0005880626,0.0019395903,0.0014493366,0.00011696108],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013644313,0.000018564326,0.000022704397,0.000018635064,0.000018986002,0.0001770104,0.00076511083,0.0052000396,0.000021092406,0.0122878365,0.000038487946,0.9814179],"study_design_scores_gemma":[0.0011938069,0.00091611745,0.0021945597,0.0011312624,0.000021744036,0.0001696608,0.0000019521983,0.59041995,0.0011960984,0.37457684,0.025822021,0.002356011],"about_ca_topic_score_codex":0.00003239615,"about_ca_topic_score_gemma":0.00044937246,"teacher_disagreement_score":0.9790619,"about_ca_system_score_codex":0.00025128835,"about_ca_system_score_gemma":0.00061857275,"threshold_uncertainty_score":0.9997672},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054060576,0.00014095737,0.986283,0.00046249662,0.003736078,0.00039508168,0.0000022363542,0.00060726877,0.008318788],"genre_scores_gemma":[0.5517881,0.0003677291,0.42995247,0.0016984058,0.0027176745,0.00008435832,0.000023139726,0.00024491976,0.01312322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958069,0.00006518185,0.0004923277,0.001824014,0.0011674032,0.00064422947],"domain_scores_gemma":[0.99723476,0.00088349753,0.00041264694,0.0010191391,0.00030474056,0.00014522148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008559774,0.00045560062,0.0004466424,0.00092764193,0.00035860503,0.0005581252,0.0022200823,0.0003291902,0.000016827402],"category_scores_gemma":[0.00016689951,0.0004681805,0.00013386793,0.0011277833,0.00047075909,0.00078013656,0.0011681585,0.0012710936,0.00024242775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010116136,0.000015357318,0.00011180357,0.00003976364,0.0000127098465,0.00012386219,0.0014305309,0.19589183,0.0006062008,0.005645021,0.000066986395,0.79604584],"study_design_scores_gemma":[0.00042808347,0.00031944746,0.00035938187,0.00031262042,0.000011870792,0.0000455712,8.872764e-7,0.8415986,0.009701907,0.14497308,0.0014187199,0.00082986796],"about_ca_topic_score_codex":0.00005656015,"about_ca_topic_score_gemma":0.000068933135,"teacher_disagreement_score":0.79521596,"about_ca_system_score_codex":0.00055095955,"about_ca_system_score_gemma":0.0004671556,"threshold_uncertainty_score":0.999777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.8144137e-7,0.00027102907,0.992992,0.0015148745,0.0018061724,0.0018205422,0.00004508143,0.00029136214,0.0012585638],"genre_scores_gemma":[0.000080292,0.00014534142,0.99563205,0.0006231451,0.00051293377,0.000110203655,0.00012342993,0.00007760969,0.0026949667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99427265,0.000109440305,0.00062285963,0.0021936381,0.001889775,0.0009116619],"domain_scores_gemma":[0.99664736,0.0006062984,0.000450457,0.001184914,0.0008637834,0.00024720366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017523046,0.000628498,0.00062845513,0.0016789647,0.0007218688,0.0008929928,0.0034446307,0.00040108024,0.00022164031],"category_scores_gemma":[0.00021583798,0.0006330128,0.00018795638,0.0019666916,0.00053730956,0.0010342295,0.0016139433,0.0012673633,0.000020161024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003107409,0.000032955744,0.0000018593914,0.00003457467,0.000012185874,0.000011894672,0.00015994445,0.67874223,0.000010627029,0.0023228684,0.00018635807,0.31848136],"study_design_scores_gemma":[0.00045067907,0.0004492029,0.0000055790165,0.0000841812,0.000012036298,0.00005413716,1.5159175e-7,0.97736424,0.00012692354,0.012870996,0.007934925,0.00064695574],"about_ca_topic_score_codex":0.000015228749,"about_ca_topic_score_gemma":0.0000087675835,"teacher_disagreement_score":0.3178344,"about_ca_system_score_codex":0.00080845907,"about_ca_system_score_gemma":0.0011560837,"threshold_uncertainty_score":0.9996121},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018183881,0.000056230063,0.9951873,0.00005950123,0.00037262758,0.0004795386,0.0000029845762,0.00045664958,0.0032033701],"genre_scores_gemma":[0.023092687,0.000002831038,0.9759554,0.00015399462,0.0002086873,0.0000331245,0.000008043961,0.00013709127,0.0004081211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978088,0.000018348195,0.00030189462,0.000709801,0.0006452085,0.0005159123],"domain_scores_gemma":[0.9990106,0.0002690434,0.00008169551,0.00040459583,0.000091723414,0.00014229692],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006615876,0.0003910215,0.0003791695,0.0006057976,0.00022202008,0.00016434454,0.0006699218,0.000117242715,0.00016268532],"category_scores_gemma":[0.000076640965,0.00038762423,0.000046458877,0.00063530303,0.00012205724,0.0001656937,0.00043276005,0.0010637123,0.000036258058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005246932,0.0000030058338,0.0000069588345,0.000027966638,0.000010052808,0.000017783823,0.0011833652,0.92925763,0.00016095051,0.00016874363,0.000003004307,0.0691553],"study_design_scores_gemma":[0.00015766406,0.00020878915,0.000007133879,0.00029775826,0.000010238207,0.000046844496,4.74343e-7,0.99683356,0.0001340148,0.0006416142,0.0011658361,0.0004960939],"about_ca_topic_score_codex":0.0000047692315,"about_ca_topic_score_gemma":0.000006793859,"teacher_disagreement_score":0.06865921,"about_ca_system_score_codex":0.00045046443,"about_ca_system_score_gemma":0.00013705407,"threshold_uncertainty_score":0.99985754},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000212226,0.000501333,0.99508417,0.00043260763,0.000990899,0.00037281675,0.0000016888047,0.00015101157,0.0024633477],"genre_scores_gemma":[0.0005910326,0.00037734467,0.99472225,0.00037752758,0.00019202179,0.000025063993,0.000018525743,0.000032184773,0.0036640659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587923,0.00021358312,0.00044545316,0.0014194845,0.001469251,0.00057299936],"domain_scores_gemma":[0.9978559,0.00074145454,0.00022287597,0.00072499795,0.00025629599,0.00019849217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017918559,0.00033575844,0.0003805877,0.001237132,0.0004974354,0.0008766271,0.0023816046,0.00015073761,0.00026469186],"category_scores_gemma":[0.0005653447,0.00033742702,0.00005403505,0.0017914743,0.00045430253,0.00045959995,0.0034063559,0.0012857886,0.000014486818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011408041,0.000012238931,0.000017032738,0.000017297867,0.000003374452,0.000026783304,0.000352735,0.66526,0.0000014401189,0.00059820904,0.000032202188,0.3336775],"study_design_scores_gemma":[0.00012486722,0.00016732661,0.000006677215,0.000048533915,0.0000031060908,0.000052376752,3.7745028e-7,0.98793536,0.000054164975,0.005959639,0.0053119594,0.000335621],"about_ca_topic_score_codex":0.000007990025,"about_ca_topic_score_gemma":0.0000029404641,"teacher_disagreement_score":0.33334187,"about_ca_system_score_codex":0.0005778056,"about_ca_system_score_gemma":0.0012555227,"threshold_uncertainty_score":0.9999078},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010536051,0.041519918,0.6739026,0.006002342,0.031963363,0.0029389798,0.00018660273,0.00044952502,0.23250063],"genre_scores_gemma":[0.7308853,0.042287547,0.12110733,0.06861862,0.011774069,0.0017162743,0.00080858177,0.000576302,0.022225935],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974192,0.0001797234,0.00043709687,0.000916027,0.00036379634,0.000684164],"domain_scores_gemma":[0.99788857,0.0013607189,0.0001774599,0.0003713862,0.00005781492,0.00014406287],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008433894,0.0003385592,0.0004881869,0.00061522087,0.00025620998,0.00003768925,0.0011370211,0.0004901815,0.0030663684],"category_scores_gemma":[0.00020907942,0.00033084012,0.00009988579,0.0009497203,0.0008970741,0.00022704093,0.0006746451,0.0031949994,0.000047437003],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007863236,0.00021013654,0.0010930231,0.00006340243,0.00001163015,0.00022272259,0.00045424618,0.028438505,0.001867276,0.0020070542,0.0012718673,0.9642815],"study_design_scores_gemma":[0.0006585336,0.00016682973,0.00013440607,0.000051354382,0.000017446939,0.000090586356,0.0000013154881,0.021649687,0.0030836146,0.07110798,0.90253025,0.00050797744],"about_ca_topic_score_codex":0.000011731013,"about_ca_topic_score_gemma":0.0001577118,"teacher_disagreement_score":0.96377355,"about_ca_system_score_codex":0.0007765671,"about_ca_system_score_gemma":0.0007902754,"threshold_uncertainty_score":0.99991435},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029811356,0.00033104245,0.9918066,0.0020322949,0.001961959,0.0014400163,0.000060105285,0.0002063355,0.0018635318],"genre_scores_gemma":[0.7413163,0.00012487306,0.25495824,0.0010007557,0.0015528987,0.0002228441,0.000031083935,0.00013247575,0.0006605192],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963847,0.000099043995,0.00050656364,0.0010335189,0.0012700689,0.0007061425],"domain_scores_gemma":[0.9964785,0.0021410652,0.00045782916,0.00045745884,0.0003658938,0.00009925419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018396238,0.00034719074,0.00057090336,0.00067875395,0.00083514734,0.00007765887,0.0021422543,0.00054560555,0.00018875714],"category_scores_gemma":[0.0008122542,0.00035412156,0.00015645816,0.00062398677,0.0024378852,0.00022461843,0.00049300154,0.0007051763,0.0000063746434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001618942,0.00013180391,0.00004499783,0.00014568733,0.000047185993,0.000047544643,0.12677625,0.0016388408,0.00010179669,0.06487517,0.0004304582,0.8055984],"study_design_scores_gemma":[0.008375809,0.0015012476,0.002772154,0.002800953,0.00033346596,0.00004746149,0.00039884658,0.044965364,0.0033742439,0.7714377,0.15772633,0.0062663956],"about_ca_topic_score_codex":0.0001095026,"about_ca_topic_score_gemma":0.0014892168,"teacher_disagreement_score":0.79933196,"about_ca_system_score_codex":0.00051696564,"about_ca_system_score_gemma":0.0013210622,"threshold_uncertainty_score":0.9998911},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018517416,0.00042917335,0.99659985,0.00005745861,0.00007266884,0.00027163452,0.000008411318,0.000022154934,0.000686922],"genre_scores_gemma":[0.6564511,0.00059886795,0.3387375,0.00048786023,0.00041016898,0.00003628599,0.00029583563,0.00009662471,0.0028857247],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99879557,0.000010717027,0.00024442846,0.00057912595,0.00018883059,0.00018131905],"domain_scores_gemma":[0.9992084,0.000075650285,0.00016823337,0.00037316568,0.00013841505,0.00003615072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003427796,0.00019274122,0.0002426538,0.00021647457,0.000060545997,0.00005368243,0.00033204356,0.00017234423,0.0000025566737],"category_scores_gemma":[0.000059208593,0.00018959609,0.00008617229,0.000100182726,0.00034133077,0.00000777662,0.00033635847,0.00011022113,9.911378e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011888936,0.000009292427,0.000121757934,0.0000844053,0.000028013415,0.0000059917334,0.00006998176,0.00040233354,0.8122024,0.00010110162,0.00014646465,0.18681638],"study_design_scores_gemma":[0.00017939266,0.00023503308,0.000054881704,0.000100298,0.00002928108,0.000003872593,4.9346085e-7,0.005662012,0.9840757,0.009027729,0.0004029599,0.00022831553],"about_ca_topic_score_codex":0.000010392611,"about_ca_topic_score_gemma":0.000032851298,"teacher_disagreement_score":0.65786237,"about_ca_system_score_codex":0.000019022817,"about_ca_system_score_gemma":0.000063194355,"threshold_uncertainty_score":0.77315044},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031614112,0.000033329725,0.9927144,0.0011400806,0.0011132566,0.0005616924,0.000007014993,0.0007625709,0.0036360528],"genre_scores_gemma":[0.06173897,0.000014560439,0.9367412,0.0004972134,0.00045262516,0.000050439958,0.000045922538,0.00007439424,0.0003846966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957835,0.00006582428,0.000629845,0.0019062024,0.0009659451,0.0006486561],"domain_scores_gemma":[0.99670947,0.00068573054,0.00045530824,0.0015896977,0.00037223674,0.00018753562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010391171,0.0005387054,0.00046061593,0.00089793355,0.0005670371,0.0007346213,0.003116718,0.000296629,0.000031845655],"category_scores_gemma":[0.00028785263,0.00054374535,0.00013651112,0.0011895575,0.0005968287,0.00073741266,0.0016956595,0.0010339655,0.00026066127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021610947,0.000020908015,0.000080307924,0.000021510223,0.000009644907,0.000027794275,0.00042965333,0.7851023,0.00018484068,0.023291383,0.000016702108,0.19081278],"study_design_scores_gemma":[0.00018431059,0.000060411992,0.0009307068,0.00015135515,0.000008242938,0.000036417354,1.0001115e-7,0.92423165,0.00007242405,0.07368872,0.00010665588,0.0005290293],"about_ca_topic_score_codex":0.0002665897,"about_ca_topic_score_gemma":0.00006982936,"teacher_disagreement_score":0.19028375,"about_ca_system_score_codex":0.00044312546,"about_ca_system_score_gemma":0.00024174046,"threshold_uncertainty_score":0.9997014},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012036695,0.0001204437,0.9849087,0.0044312165,0.001896602,0.0009769902,0.000002707267,0.00020956928,0.0062500783],"genre_scores_gemma":[0.9906928,0.000045837976,0.0026259117,0.0024973676,0.00027623144,0.000024015742,0.000019922743,0.000054672764,0.0037632233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977143,0.000029084642,0.00042221975,0.00081996847,0.0005277581,0.00048670656],"domain_scores_gemma":[0.99914235,0.00019241907,0.0001299794,0.00032814688,0.00007998569,0.00012711177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024329526,0.00033242258,0.0005442432,0.00090258813,0.00010877105,0.00006520236,0.00026081712,0.00019336685,0.00009123033],"category_scores_gemma":[0.00006705349,0.00030103518,0.0001032675,0.00034571305,0.00036194385,0.000067762245,0.00039291912,0.0009105716,0.00013491053],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020994044,0.00013641406,0.003842829,0.0003061695,0.00012819261,0.010148572,0.0019488987,0.01891297,0.000968216,0.0037391768,0.00019620433,0.9594624],"study_design_scores_gemma":[0.008856694,0.0029010673,0.018941319,0.005317884,0.0003935351,0.007140676,0.000044858138,0.7956827,0.0051054982,0.0963369,0.055458646,0.0038202044],"about_ca_topic_score_codex":0.00004718959,"about_ca_topic_score_gemma":0.0006203422,"teacher_disagreement_score":0.98948914,"about_ca_system_score_codex":0.0004290967,"about_ca_system_score_gemma":0.0001519293,"threshold_uncertainty_score":0.99994415},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019781953,0.000019525512,0.9932805,0.00092310365,0.0009830559,0.0010802377,0.0000045274305,0.00010057888,0.0016303054],"genre_scores_gemma":[0.95683527,0.000055304616,0.034297474,0.0004337276,0.0004229559,0.000056324126,0.00009225793,0.000057202666,0.007749513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984405,0.00001916303,0.0003671012,0.00056508154,0.00041579138,0.00019233461],"domain_scores_gemma":[0.9986166,0.00046558303,0.0002611079,0.000372332,0.00021684224,0.00006754478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004456543,0.00015351767,0.00031127495,0.00061948906,0.00012564365,0.00004023787,0.00018892046,0.00015647196,0.000023850338],"category_scores_gemma":[0.0003957814,0.0001540011,0.00009910352,0.0003686556,0.0002059485,0.000047025762,0.0001102664,0.00028985122,0.00001527883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014573743,0.0000547794,0.00011920232,0.0002632845,0.00004302432,0.00005634706,0.00058892946,0.021842455,0.011502698,0.003501245,0.0001356171,0.9617467],"study_design_scores_gemma":[0.0017332921,0.0013584952,0.01211196,0.0012224098,0.00017433378,0.00014004979,0.0000122448455,0.9471856,0.011630227,0.01747844,0.0064137,0.00053928525],"about_ca_topic_score_codex":0.000027943734,"about_ca_topic_score_gemma":0.00010083443,"teacher_disagreement_score":0.9612074,"about_ca_system_score_codex":0.0001691718,"about_ca_system_score_gemma":0.00020064843,"threshold_uncertainty_score":0.62799823},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012369212,0.000044508073,0.99445033,0.00040800407,0.002825963,0.00060506066,0.0000122795045,0.0004715428,0.0010585928],"genre_scores_gemma":[0.2069098,0.00009492291,0.78551173,0.002022307,0.002560179,0.0001693484,0.000100366124,0.0001690871,0.002462263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697036,0.000041569827,0.0005014397,0.001301231,0.00063216814,0.000553256],"domain_scores_gemma":[0.99759454,0.0009446568,0.00038980975,0.00049656926,0.00043789804,0.00013650644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007734966,0.00040832895,0.00044394992,0.0009124496,0.0005535833,0.00057131675,0.0010553723,0.00025978393,0.00003116625],"category_scores_gemma":[0.00024583103,0.00041192508,0.00017745164,0.0005219796,0.00044194973,0.0007553851,0.00031292712,0.00071944704,0.00015098238],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118286225,0.000017797302,0.000031996973,0.000045512115,0.000022617314,0.000021873648,0.00057265745,0.024274739,0.00015667318,0.027142448,0.000046750243,0.9476551],"study_design_scores_gemma":[0.00068310584,0.00026171294,0.00010702449,0.000357926,0.000017505978,0.000066030174,0.0000018304759,0.7092636,0.0018462433,0.28503153,0.0016753593,0.0006881435],"about_ca_topic_score_codex":0.000022659084,"about_ca_topic_score_gemma":0.00005378065,"teacher_disagreement_score":0.94696695,"about_ca_system_score_codex":0.00023139044,"about_ca_system_score_gemma":0.00030744873,"threshold_uncertainty_score":0.9998333},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032960933,0.00007130489,0.9940857,0.00049144635,0.0011649932,0.00048051556,0.0000034607115,0.00017189381,0.0002345888],"genre_scores_gemma":[0.8250301,0.000018135488,0.17326333,0.00043254188,0.0003206965,0.0000425768,0.0000072230505,0.000046894183,0.00083850103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677837,0.00018096721,0.000608614,0.0010924782,0.0008117647,0.0005277932],"domain_scores_gemma":[0.99633396,0.0021743733,0.00038107956,0.00086318085,0.00019931945,0.000048115722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0043017436,0.00034424965,0.00044981504,0.00064004865,0.00035001268,0.00034656105,0.0022160574,0.00018551403,0.0000022678348],"category_scores_gemma":[0.0006776432,0.00026637904,0.00015851732,0.0010107377,0.00029949305,0.0003531159,0.0005717622,0.001374494,0.000006512256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008175113,0.000020275143,0.00013969348,0.00008850936,0.000006028933,0.000013081831,0.0027614573,0.15963264,0.000178478,0.0009270332,0.000001681116,0.83622295],"study_design_scores_gemma":[0.00028756683,0.0002789265,0.0022664953,0.00031453493,0.0000054090046,0.000025285692,0.0000014517594,0.93504286,0.00063072395,0.060421158,0.0003714189,0.0003541515],"about_ca_topic_score_codex":0.00012857138,"about_ca_topic_score_gemma":0.00024182975,"teacher_disagreement_score":0.8358688,"about_ca_system_score_codex":0.00015768588,"about_ca_system_score_gemma":0.00026182435,"threshold_uncertainty_score":0.99997884},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063350926,0.00027236142,0.971254,0.0015527222,0.023921823,0.00036976254,0.0000088190645,0.00063366134,0.0019235198],"genre_scores_gemma":[0.027347745,0.0017209555,0.91154754,0.014883766,0.029212255,0.0001455664,0.00021263535,0.000338469,0.014591075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99418765,0.00011546173,0.000740557,0.002090605,0.001910061,0.0009556736],"domain_scores_gemma":[0.9966499,0.00078217284,0.00038317323,0.0015496535,0.00039117972,0.00024391171],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015100908,0.0006240431,0.0005849727,0.0016115333,0.00042540533,0.0013203572,0.0062582465,0.000595215,0.000053581094],"category_scores_gemma":[0.00011878092,0.000626758,0.00023268712,0.0031923032,0.000518741,0.0011182121,0.004107796,0.0019220833,0.00040697693],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009020971,0.00006564826,0.000029176563,0.000035506608,0.000026114974,0.00019435646,0.0012434664,0.04730897,0.000011782614,0.006104746,0.007999748,0.9369715],"study_design_scores_gemma":[0.0002448656,0.00012831505,0.00006939513,0.0003054611,0.000005298215,0.000079213794,1.7695082e-7,0.8004522,0.00011384593,0.16500281,0.032968286,0.00063013996],"about_ca_topic_score_codex":0.000016954691,"about_ca_topic_score_gemma":0.00014369193,"teacher_disagreement_score":0.93634135,"about_ca_system_score_codex":0.0008783772,"about_ca_system_score_gemma":0.00088213984,"threshold_uncertainty_score":0.99971634},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002823108,0.00006934411,0.9924032,0.00029980516,0.004518054,0.00040885716,0.00000885912,0.00043454583,0.0015750302],"genre_scores_gemma":[0.283974,0.00011237431,0.7121111,0.0015870185,0.00105428,0.00002704059,0.00006701667,0.00009620243,0.00097093225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632746,0.00009165689,0.0007528744,0.001060709,0.0011365562,0.000630725],"domain_scores_gemma":[0.9968179,0.00053198,0.0006310232,0.0014892191,0.00038995667,0.00013995243],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0026556097,0.00046423834,0.0004891723,0.0016097099,0.00032871272,0.0013005466,0.0027373177,0.00034370148,0.000009950122],"category_scores_gemma":[0.00038857487,0.00045795445,0.00015243248,0.0012306133,0.00034960374,0.0026117417,0.00079898955,0.0007488946,0.0001622362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000899159,0.000014281528,0.00018531467,0.00012629051,0.00002164385,0.000041244075,0.003683418,0.0377745,0.00045889406,0.0053067547,0.000053996417,0.9523247],"study_design_scores_gemma":[0.00029418434,0.00008471331,0.002449719,0.0005991122,0.000010192469,0.00003247986,0.000001337465,0.924453,0.0018446463,0.068854295,0.00064800994,0.0007282889],"about_ca_topic_score_codex":0.000026605905,"about_ca_topic_score_gemma":0.000045881603,"teacher_disagreement_score":0.9515964,"about_ca_system_score_codex":0.00038712446,"about_ca_system_score_gemma":0.0005249855,"threshold_uncertainty_score":0.9997872},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001574545,0.00018474752,0.9926941,0.00025938582,0.003633039,0.00034591983,0.0000050864855,0.0005002787,0.0008029363],"genre_scores_gemma":[0.27699214,0.00005761208,0.7203004,0.0006349512,0.0012569593,0.000012821939,0.0000068682434,0.0001120551,0.00062621146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99567217,0.00013026637,0.0005049723,0.0016989348,0.0011393497,0.0008543226],"domain_scores_gemma":[0.9967424,0.0006404895,0.00037970443,0.0017596645,0.00031253247,0.00016519119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019871327,0.00054563617,0.0005527748,0.0012529388,0.00053043664,0.0007636273,0.0033093193,0.00042695506,0.000010225023],"category_scores_gemma":[0.000370264,0.0005480424,0.00018648061,0.0013972361,0.00036345638,0.0010977128,0.0017316065,0.0010003427,0.000048926813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000120022505,0.0000210673,0.00030447895,0.000117805335,0.000025969128,0.00014676084,0.0016127398,0.17836949,0.002753401,0.0012255132,0.000012918067,0.81539786],"study_design_scores_gemma":[0.00020167248,0.000064695705,0.0014320262,0.0005715166,0.000007821951,0.000116330004,4.0285587e-7,0.93882614,0.0020003722,0.055989694,0.00014789199,0.0006414386],"about_ca_topic_score_codex":0.00015232337,"about_ca_topic_score_gemma":0.00015574139,"teacher_disagreement_score":0.8147564,"about_ca_system_score_codex":0.00056160963,"about_ca_system_score_gemma":0.0004790695,"threshold_uncertainty_score":0.9996971},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000069527905,0.0011090883,0.99591315,0.0011943856,0.0003905708,0.0003508749,0.00016778815,0.00029147195,0.0005757181],"genre_scores_gemma":[0.0019975083,0.00060449116,0.9967928,0.00034193735,0.000092284026,0.000011386987,0.0000454194,0.000036962047,0.00007723355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961893,0.00010716716,0.0006722081,0.0018365681,0.0007112852,0.00048346864],"domain_scores_gemma":[0.99632883,0.001347343,0.00042095073,0.0015472805,0.00021589731,0.0001397261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020687357,0.00048254817,0.0006055107,0.00085368764,0.00023476567,0.00031027745,0.002059706,0.00024844395,0.0000018012564],"category_scores_gemma":[0.0005247876,0.00044913383,0.000046937377,0.0005230756,0.001379389,0.0009231713,0.0028077774,0.00076844153,0.0000037508216],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040830408,0.00004674972,0.0000017435975,0.00018861298,0.000011178787,0.00007164994,0.0006693914,0.00076852523,0.005338141,0.011544186,0.0002612818,0.9810577],"study_design_scores_gemma":[0.0004553945,0.0005455055,0.000048692054,0.0008619786,0.000010606043,0.000045039433,3.491523e-7,0.72041136,0.010033574,0.2639402,0.003025191,0.0006221147],"about_ca_topic_score_codex":0.000026250285,"about_ca_topic_score_gemma":0.000021714732,"teacher_disagreement_score":0.9804356,"about_ca_system_score_codex":0.00009634876,"about_ca_system_score_gemma":0.00018248717,"threshold_uncertainty_score":0.99979603},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.5880373e-7,0.00016279556,0.9959399,0.000494556,0.0011562812,0.0011754483,0.000010465535,0.00049847283,0.0005612301],"genre_scores_gemma":[0.0006609633,0.000075578384,0.9958241,0.00022677261,0.0005185655,0.00014726119,0.000029762528,0.000084280415,0.002432713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947181,0.000069708854,0.00072501163,0.0020678453,0.0015181364,0.0009012448],"domain_scores_gemma":[0.9953442,0.0018632283,0.0003991078,0.0013197797,0.000816502,0.00025714654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002737419,0.0005250312,0.00065264606,0.0015956041,0.0005032582,0.0008599952,0.0034530994,0.00032727377,0.000012145951],"category_scores_gemma":[0.0010204274,0.00052415865,0.00018671837,0.0015177903,0.00043991904,0.0004468087,0.0014130982,0.0010768047,0.00017721498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015663259,0.000012199648,0.000002007962,0.000038467748,0.000014430431,0.000017740567,0.00014546791,0.19969909,0.00002048185,0.010199851,0.000005708031,0.78984296],"study_design_scores_gemma":[0.00027680316,0.00014355319,0.0000062437666,0.00012243711,0.000012447877,0.000021367154,1.9400979e-7,0.9055358,0.00015002061,0.091993235,0.0012604743,0.00047738853],"about_ca_topic_score_codex":0.00001309033,"about_ca_topic_score_gemma":0.00000761417,"teacher_disagreement_score":0.7893656,"about_ca_system_score_codex":0.00031074756,"about_ca_system_score_gemma":0.00079027936,"threshold_uncertainty_score":0.999721},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059957546,0.000078659396,0.9969976,0.00021640155,0.00023804583,0.0008133671,0.000006774613,0.00040058303,0.00064901257],"genre_scores_gemma":[0.3250813,0.00020807706,0.6734229,0.00016967647,0.00019485793,0.00013199456,0.000074799675,0.000092006274,0.000624448],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722636,0.00008770031,0.00060779444,0.0010088672,0.0006508047,0.0004184957],"domain_scores_gemma":[0.9965937,0.0019807445,0.0004050871,0.00029404834,0.0006108108,0.000115586605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014493787,0.0003711275,0.0005960293,0.0008813412,0.00028951865,0.00028381697,0.0007412766,0.0003545794,0.00001560908],"category_scores_gemma":[0.00077497185,0.0003561524,0.000116576106,0.0003852628,0.00047230546,0.0005554433,0.00058667763,0.00072687556,0.000015139483],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020992135,0.000044098677,0.00004927264,0.00026370853,0.00001346841,0.000011523789,0.0011559927,0.00032444985,0.0049773697,0.0047374736,0.000009076704,0.9883926],"study_design_scores_gemma":[0.0007634997,0.0006378684,0.00005813952,0.0020646749,0.000016843389,0.000028323911,0.0000027553822,0.45998585,0.050531656,0.48534104,0.000080436366,0.00048889156],"about_ca_topic_score_codex":0.0000038127246,"about_ca_topic_score_gemma":0.000003723838,"teacher_disagreement_score":0.98790365,"about_ca_system_score_codex":0.00009673321,"about_ca_system_score_gemma":0.00014326499,"threshold_uncertainty_score":0.999889},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056611333,0.0146785965,0.5816912,0.0011588119,0.0054076137,0.0033682822,0.0008889566,0.0010993358,0.33509585],"genre_scores_gemma":[0.9855008,0.001538804,0.009687416,0.0004518524,0.00059314957,0.00002370719,0.00042973016,0.000052813353,0.0017217111],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982789,0.000021664793,0.00046893588,0.0005499394,0.00048819304,0.00019236724],"domain_scores_gemma":[0.9976595,0.0008610944,0.00032453742,0.0007958591,0.00030189584,0.00005712388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003052274,0.00024738023,0.00046779323,0.00097023806,0.00016243375,0.000421947,0.00074768596,0.00013159028,0.0000729363],"category_scores_gemma":[0.00013354137,0.00022235898,0.00011784553,0.00027871426,0.0010386598,0.00028462269,0.00036945654,0.00028861215,0.000053513988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115914816,0.00027064214,0.0028278641,0.00047672953,0.001539943,0.00003726675,0.14703521,0.051285695,0.0005431726,0.14683463,0.0018538382,0.6471791],"study_design_scores_gemma":[0.0004026322,0.00028583276,0.0011672017,0.0009179612,0.0005537805,0.0000018746547,0.000004915725,0.19324811,0.00025035773,0.7821475,0.020014182,0.0010056522],"about_ca_topic_score_codex":0.00031946631,"about_ca_topic_score_gemma":0.000738474,"teacher_disagreement_score":0.9288895,"about_ca_system_score_codex":0.00006832619,"about_ca_system_score_gemma":0.00009656373,"threshold_uncertainty_score":0.9067536},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014322449,0.00097585446,0.99147,0.0043775435,0.0006516412,0.0006301893,0.000030959996,0.0010908112,0.0006298086],"genre_scores_gemma":[0.022169393,0.0005155365,0.9744172,0.0008737741,0.00027421096,0.00013521306,0.000044736804,0.000059904614,0.0015100134],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956462,0.000030819334,0.00046501277,0.0025170948,0.00056710833,0.00077379216],"domain_scores_gemma":[0.9941688,0.00030933256,0.00023667271,0.0050589396,0.00012087208,0.00010535704],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011455875,0.00046030496,0.00048432878,0.0022405705,0.00041198372,0.00034532568,0.0118449945,0.00058055477,0.000002435912],"category_scores_gemma":[0.00012993035,0.00044676324,0.000037768452,0.0037721335,0.001741239,0.00025161039,0.016781444,0.001101133,0.000050002287],"study_design_candidate":"design_other","study_design_consensus":null,"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.253148e-7,0.000040068124,0.00006940206,0.000086167405,0.00002115753,0.00008674509,0.00021005761,0.0005151509,0.00001425894,0.113129586,0.00085332047,0.88497317],"study_design_scores_gemma":[0.0001599898,0.00004605826,0.00006926595,0.00015964307,0.0000089381265,0.000059459802,5.6308033e-7,0.4117317,0.00009071797,0.57545805,0.011798798,0.00041680963],"about_ca_topic_score_codex":0.0000048595516,"about_ca_topic_score_gemma":0.0000548356,"teacher_disagreement_score":0.88455635,"about_ca_system_score_codex":0.00016384044,"about_ca_system_score_gemma":0.00040806417,"threshold_uncertainty_score":0.9997984},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031306838,0.0002843332,0.96627265,0.021237532,0.0046057794,0.0005629124,0.000040177183,0.0031868464,0.0037784453],"genre_scores_gemma":[0.008643063,0.000326755,0.9879038,0.0008717265,0.0010986802,0.000037863025,0.00003975334,0.00012651083,0.0009518475],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930043,0.00005245457,0.00087313086,0.0029634708,0.0018608291,0.0012457835],"domain_scores_gemma":[0.97898436,0.0009800848,0.00044277165,0.019071752,0.0003100522,0.00021099692],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0018947975,0.0007836666,0.00069621496,0.0019289631,0.0004380485,0.0010402505,0.085353754,0.0008780695,0.000028909772],"category_scores_gemma":[0.013604576,0.00077215675,0.00018029229,0.0018828898,0.00096325984,0.001739945,0.22867891,0.00207333,0.00030258726],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006056899,0.000026812068,0.0001868314,0.000120475954,0.00003594225,0.00029616448,0.0002757233,0.0054048942,0.00024809115,0.01179096,0.008965187,0.97264284],"study_design_scores_gemma":[0.00013146996,0.00008013195,0.00015987027,0.00042067922,0.00000530169,0.00003606126,6.906735e-8,0.46301675,0.00063952646,0.53286433,0.0022051684,0.0004406538],"about_ca_topic_score_codex":0.000035676298,"about_ca_topic_score_gemma":0.000046258803,"teacher_disagreement_score":0.9722022,"about_ca_system_score_codex":0.00060274865,"about_ca_system_score_gemma":0.00063023873,"threshold_uncertainty_score":0.9999968},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001495426,0.0005355702,0.9942092,0.00096403033,0.0013555776,0.0005685847,0.0000048254897,0.0005372569,0.00032954535],"genre_scores_gemma":[0.7388014,0.0008791104,0.25826856,0.00020609751,0.00016776331,0.00011742314,0.000034331097,0.00006138554,0.0014638954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963607,0.000042580315,0.00070840574,0.0017318128,0.00069923454,0.0004572625],"domain_scores_gemma":[0.9975938,0.00025784026,0.00039127603,0.0014940517,0.00016574563,0.00009727092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007296642,0.0004005864,0.0003481254,0.0017142728,0.00027995824,0.0007068734,0.002113332,0.00037714597,0.000007276624],"category_scores_gemma":[0.00013449536,0.00039246175,0.000050319926,0.0011277095,0.0005697095,0.0010524709,0.0010162456,0.00057919294,0.00010952145],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035559606,0.00009355096,0.0010250544,0.000025181229,0.0000049286173,0.000015287831,0.000865158,0.00035639273,0.006272244,0.030083062,0.00005243748,0.96120316],"study_design_scores_gemma":[0.0011143553,0.000081039485,0.05361016,0.00064622477,0.0000071677946,0.000018816474,0.000010798624,0.7862521,0.0087490715,0.14782673,0.00062167377,0.0010618957],"about_ca_topic_score_codex":0.000011932537,"about_ca_topic_score_gemma":0.000045631805,"teacher_disagreement_score":0.96014124,"about_ca_system_score_codex":0.0003508509,"about_ca_system_score_gemma":0.00013759611,"threshold_uncertainty_score":0.9998527},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000065011314,0.00010180532,0.9917603,0.0003721693,0.0061935256,0.00036832597,0.0000016964767,0.0006241047,0.00051305705],"genre_scores_gemma":[0.84284174,0.00007849438,0.15161145,0.0016435641,0.002904807,0.00005656019,0.000029156025,0.00016123537,0.00067300483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643385,0.00004410435,0.0003889905,0.001525791,0.001000792,0.0006064964],"domain_scores_gemma":[0.9976822,0.00042094852,0.00030437854,0.0011884392,0.00024842884,0.00015556869],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084896904,0.00048726302,0.000376232,0.00097212446,0.0004292868,0.0007432322,0.0017835428,0.0003955888,0.0000062817758],"category_scores_gemma":[0.00004956708,0.00042989367,0.00013011522,0.0013338001,0.00036264633,0.00058081554,0.00040326198,0.0009225302,0.00006726785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019156654,0.000018032282,0.00013152834,0.00003477449,0.000012946064,0.00003960072,0.00008950382,0.4390243,0.00010227976,0.0018635876,0.000016729377,0.5586476],"study_design_scores_gemma":[0.000304437,0.00039534635,0.0007523886,0.00049017783,0.000007687156,0.000042434578,7.195693e-8,0.9774377,0.00057119166,0.018845303,0.00058134337,0.0005719457],"about_ca_topic_score_codex":0.000069424896,"about_ca_topic_score_gemma":0.0003241359,"teacher_disagreement_score":0.8427767,"about_ca_system_score_codex":0.00031311956,"about_ca_system_score_gemma":0.00031702316,"threshold_uncertainty_score":0.9998153},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030286472,0.00093087263,0.9936204,0.00025707268,0.0025266255,0.00024794677,0.0000032054384,0.00038807135,0.0019955365],"genre_scores_gemma":[0.21640772,0.00013198468,0.775087,0.0023934324,0.0036625583,0.000016328308,0.000032024232,0.00010252764,0.0021664284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963328,0.00005916406,0.0005053576,0.0015484696,0.0008615502,0.0006926449],"domain_scores_gemma":[0.99684566,0.001533841,0.0002519299,0.0005365228,0.0006355687,0.00019646419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010432495,0.00046055738,0.00046009372,0.0007999671,0.00041875176,0.0009661468,0.0018534039,0.00024617778,0.0000022765714],"category_scores_gemma":[0.0006608855,0.00044819672,0.000074977375,0.0014981929,0.000710795,0.00012445991,0.0021658004,0.00092898187,0.00004807945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019625486,0.000018993633,0.00004928287,0.00006536899,0.0000059623476,0.00006553157,0.0006218079,0.13257366,7.895594e-7,0.0020171825,0.0002682658,0.8643112],"study_design_scores_gemma":[0.00011541336,0.00007623685,0.00019139078,0.0007785654,0.000005918444,0.000034643323,1.8701508e-7,0.8322302,0.000025324567,0.16440596,0.0017032927,0.0004328776],"about_ca_topic_score_codex":0.0000056287045,"about_ca_topic_score_gemma":0.00001952893,"teacher_disagreement_score":0.8638783,"about_ca_system_score_codex":0.0003058109,"about_ca_system_score_gemma":0.001597174,"threshold_uncertainty_score":0.999797},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028480272,0.0005150907,0.9928991,0.0004987094,0.0011264124,0.00034806962,0.000009122363,0.00058198813,0.0037366974],"genre_scores_gemma":[0.12762293,0.000029939725,0.86934125,0.0011118185,0.0003844442,0.000011870218,0.0000068426807,0.000063986525,0.0014269024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579215,0.00003530206,0.00055237615,0.0017425886,0.0011453031,0.00073227205],"domain_scores_gemma":[0.9976185,0.00030775915,0.00026432535,0.0015383164,0.00014288162,0.0001282134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081980875,0.0005450047,0.0005408311,0.00067595183,0.00022023435,0.0005413858,0.003211037,0.00034345314,0.000011598586],"category_scores_gemma":[0.00008139754,0.0005259386,0.00018648632,0.0005654116,0.0003208479,0.0013614362,0.001772138,0.0008609385,0.000041399475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035458672,0.000008861492,0.000001427039,0.000036130165,0.000010312173,0.00008304507,0.013321831,0.5931866,0.0008216431,0.24190086,0.000010599464,0.15061513],"study_design_scores_gemma":[0.0001592839,0.00002066917,6.349529e-7,0.00026381816,0.000005247996,0.000018590617,0.000001782214,0.6860974,0.00029968837,0.3127344,0.00001894465,0.00037956273],"about_ca_topic_score_codex":0.000103185084,"about_ca_topic_score_gemma":0.000069812784,"teacher_disagreement_score":0.15023556,"about_ca_system_score_codex":0.00031634208,"about_ca_system_score_gemma":0.0003957196,"threshold_uncertainty_score":0.9997192},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030286472,0.00093087263,0.9936204,0.00025707268,0.0025266255,0.00024794677,0.0000032054384,0.00038807135,0.0019955365],"genre_scores_gemma":[0.21640772,0.00013198468,0.775087,0.0023934324,0.0036625583,0.000016328308,0.000032024232,0.00010252764,0.0021664284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963328,0.00005916406,0.0005053576,0.0015484696,0.0008615502,0.0006926449],"domain_scores_gemma":[0.99684566,0.001533841,0.0002519299,0.0005365228,0.0006355687,0.00019646419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010432495,0.00046055738,0.00046009372,0.0007999671,0.00041875176,0.0009661468,0.0018534039,0.00024617778,0.0000022765714],"category_scores_gemma":[0.0006608855,0.00044819672,0.000074977375,0.0014981929,0.000710795,0.00012445991,0.0021658004,0.00092898187,0.00004807945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019625486,0.000018993633,0.00004928287,0.00006536899,0.0000059623476,0.00006553157,0.0006218079,0.13257366,7.895594e-7,0.0020171825,0.0002682658,0.8643112],"study_design_scores_gemma":[0.00011541336,0.00007623685,0.00019139078,0.0007785654,0.000005918444,0.000034643323,1.8701508e-7,0.8322302,0.000025324567,0.16440596,0.0017032927,0.0004328776],"about_ca_topic_score_codex":0.0000056287045,"about_ca_topic_score_gemma":0.00001952893,"teacher_disagreement_score":0.8638783,"about_ca_system_score_codex":0.0003058109,"about_ca_system_score_gemma":0.001597174,"threshold_uncertainty_score":0.999797},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047234542,0.00016594835,0.991317,0.002428632,0.003919789,0.000802902,0.000017169974,0.0003702717,0.00093108224],"genre_scores_gemma":[0.14080912,0.000088774745,0.8507567,0.0031759336,0.0015521316,0.00011058128,0.000047992275,0.00014402498,0.0033147547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603146,0.00007440132,0.0005667835,0.0017741051,0.00082855823,0.00072470336],"domain_scores_gemma":[0.995903,0.0017273567,0.00031267054,0.0015053911,0.00040890317,0.00014269017],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030468795,0.00047756275,0.0005688373,0.000796173,0.00034952073,0.0008451508,0.0028987776,0.0003550986,0.000008154303],"category_scores_gemma":[0.0003811779,0.00045118548,0.0002249355,0.00068333634,0.00037899625,0.0006018614,0.00044329427,0.0005222201,0.00008390881],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017368378,0.00002369664,0.00008824573,0.00012531327,0.000026161488,0.00002837317,0.0014750353,0.013129595,0.000486555,0.015977127,0.00019771498,0.9684248],"study_design_scores_gemma":[0.0007863788,0.00018766432,0.0011981934,0.0004365257,0.000016404743,0.000025342535,8.557078e-7,0.8104825,0.0020530599,0.18195789,0.001897669,0.0009575441],"about_ca_topic_score_codex":0.000017155373,"about_ca_topic_score_gemma":0.0001443638,"teacher_disagreement_score":0.96746725,"about_ca_system_score_codex":0.00020622143,"about_ca_system_score_gemma":0.00036345847,"threshold_uncertainty_score":0.999794},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006914239,0.00032015613,0.9967459,0.00043588292,0.0012951939,0.00017491769,0.000015104805,0.00018706005,0.00013439478],"genre_scores_gemma":[0.54740244,0.0002997467,0.449289,0.0010895575,0.0011191356,0.000009411817,0.000053307114,0.00007594279,0.00066144136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972751,0.00003484155,0.0004061326,0.0012852718,0.00057633227,0.00042232178],"domain_scores_gemma":[0.9981131,0.00075791095,0.00024947096,0.0006058692,0.00013374104,0.00013992134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046215212,0.00037903155,0.0004946199,0.00069863454,0.00027552023,0.0006266731,0.0011074062,0.00022217659,0.000011341137],"category_scores_gemma":[0.00011263215,0.00034901436,0.00010723504,0.00054501573,0.00029138615,0.00043495858,0.0011576285,0.00050277385,0.000020852245],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000161555,0.000026598022,0.00037449575,0.000016527258,0.00008809448,0.000077851626,0.0012220177,0.00649677,0.0038721794,0.0012515815,0.000004642925,0.9865531],"study_design_scores_gemma":[0.00033531725,0.00007676586,0.0018975191,0.00033666348,0.000022334947,0.000013020019,9.750127e-7,0.97215104,0.00088688894,0.023725176,0.00012109039,0.00043319107],"about_ca_topic_score_codex":0.00019268777,"about_ca_topic_score_gemma":0.0008374365,"teacher_disagreement_score":0.98611987,"about_ca_system_score_codex":0.00012121631,"about_ca_system_score_gemma":0.00011583054,"threshold_uncertainty_score":0.99989617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007541417,0.000025693536,0.9864952,0.0007674785,0.0011864019,0.0018909575,0.00031394023,0.00029638695,0.0014825307],"genre_scores_gemma":[0.81400704,0.000020671974,0.17475621,0.01049187,0.00015793904,0.000046183708,0.0004562415,0.000023745975,0.00004008147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933891,0.00033661726,0.0037048042,0.00053875457,0.0012488402,0.00078185135],"domain_scores_gemma":[0.99483174,0.0006466944,0.0021013184,0.00096006313,0.0011531949,0.00030696427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0066098394,0.00033444221,0.0009948707,0.002137003,0.00078754843,0.00007635899,0.0007343228,0.0002942028,0.00013723862],"category_scores_gemma":[0.00027449845,0.00029246998,0.00016449201,0.002082847,0.00010609564,0.0009918313,0.00069554534,0.00088918884,0.000047894024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005781456,0.00006292404,0.14017753,0.011109869,0.0002652568,0.0000029550624,0.07620389,0.3457632,0.000029484776,0.009277038,0.00018746046,0.41686255],"study_design_scores_gemma":[0.00030011157,0.000096720934,0.07329358,0.00071175845,0.00003401052,3.1715868e-7,0.00004574225,0.9232786,0.0000031698987,0.0005832272,0.0013644114,0.00028830647],"about_ca_topic_score_codex":0.0017088699,"about_ca_topic_score_gemma":0.004022406,"teacher_disagreement_score":0.81173897,"about_ca_system_score_codex":0.002092729,"about_ca_system_score_gemma":0.005464677,"threshold_uncertainty_score":0.99995273},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011689594,0.00011370799,0.99619126,0.00092170935,0.00050394307,0.00045789342,0.000006351786,0.0010854239,0.0007080424],"genre_scores_gemma":[0.008378276,0.00003745155,0.99021244,0.00037956622,0.00018611058,0.000029423009,0.000024377758,0.00006303927,0.0006893411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608743,0.000030463796,0.00045606052,0.0016290329,0.001184031,0.00061300583],"domain_scores_gemma":[0.9972991,0.00033210707,0.0003310965,0.0012597457,0.00064719655,0.00013078077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006277718,0.00052666443,0.00039921727,0.001088814,0.00037448033,0.0008099596,0.0025895436,0.0002530989,0.0000062945205],"category_scores_gemma":[0.0001306006,0.00046610108,0.00007028368,0.0012534624,0.0007623799,0.0022233978,0.00087899156,0.0007464477,0.00006008732],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027449267,0.00003652077,0.000019925697,0.00009453681,0.000013652529,0.00018270547,0.0010488172,0.026385643,0.00079962704,0.015627556,0.000067799476,0.95569575],"study_design_scores_gemma":[0.00025619293,0.0001780654,0.000034907902,0.000511295,0.0000074781074,0.000059868617,4.4139367e-7,0.838465,0.0017680824,0.15790777,0.00022950575,0.00058141246],"about_ca_topic_score_codex":0.000027090473,"about_ca_topic_score_gemma":0.00015601264,"teacher_disagreement_score":0.95511436,"about_ca_system_score_codex":0.0003743507,"about_ca_system_score_gemma":0.0007823571,"threshold_uncertainty_score":0.99977905},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000051652078,0.00018502264,0.9871026,0.0002848995,0.0066371295,0.00041472152,0.0000030408155,0.00065709476,0.0047103013],"genre_scores_gemma":[0.00016854014,0.000028553184,0.9957033,0.00081307144,0.000573756,0.000032245323,0.000006305696,0.000045827717,0.002628398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949701,0.00027326593,0.0007027032,0.0017270981,0.0011607924,0.0011660351],"domain_scores_gemma":[0.9956453,0.0010989044,0.0003755331,0.0024135248,0.00026374552,0.00020299449],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0063919425,0.00052736205,0.0005842479,0.0014057321,0.000343467,0.0006911331,0.0068797222,0.00045643203,0.000008586002],"category_scores_gemma":[0.00074237713,0.0004930138,0.00016552268,0.0030446646,0.00069525506,0.0017967151,0.0031241698,0.0011588293,0.00023187796],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021434155,0.000013412891,0.0000056521603,0.00004549007,0.000005760675,0.000024843046,0.0005603227,0.008959003,0.000103464736,0.025977071,0.0001538653,0.964149],"study_design_scores_gemma":[0.00012948652,0.0001110778,0.00016234376,0.00016148225,0.000004793786,0.000050007613,1.0387084e-7,0.7538961,0.0033195273,0.23754779,0.0040688356,0.00054843654],"about_ca_topic_score_codex":0.000009139598,"about_ca_topic_score_gemma":0.000012243424,"teacher_disagreement_score":0.9636005,"about_ca_system_score_codex":0.00072551606,"about_ca_system_score_gemma":0.0015420127,"threshold_uncertainty_score":0.99975216},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014796578,0.00008075453,0.9940391,0.0010307158,0.0021046137,0.0002086869,0.000011802223,0.00029111767,0.0020852056],"genre_scores_gemma":[0.03991845,0.00028988443,0.9532315,0.001555502,0.0013845206,0.000021787548,0.000059396763,0.000076496406,0.0034624804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706453,0.000023631752,0.00044093042,0.0013245983,0.0007121516,0.00043418098],"domain_scores_gemma":[0.9983519,0.0002947506,0.00029482823,0.00060811016,0.00028804666,0.00016237846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006092534,0.00037708014,0.00040173825,0.0010522424,0.00031669196,0.0005225733,0.00085003587,0.00027076007,0.000021521468],"category_scores_gemma":[0.00016304523,0.0003641147,0.00010116991,0.0010080428,0.0005286775,0.00070044486,0.00060780154,0.0005257707,0.00007135364],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017863354,0.000012332615,0.000056361005,0.000023422235,0.000015538555,0.000013169392,0.0003998601,0.0060021672,0.00019042534,0.0061236923,0.000012354277,0.9871489],"study_design_scores_gemma":[0.00030192218,0.000076635726,0.00015085792,0.0004412093,0.00001955321,0.00013525455,0.0000016116239,0.9736327,0.0006196636,0.023252824,0.0008582723,0.00050948124],"about_ca_topic_score_codex":0.000031597,"about_ca_topic_score_gemma":0.000094687406,"teacher_disagreement_score":0.9866394,"about_ca_system_score_codex":0.00015757563,"about_ca_system_score_gemma":0.00019448789,"threshold_uncertainty_score":0.9998811},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04508546,0.0021636868,0.85983336,0.0007956189,0.021727994,0.0010515284,0.00014611367,0.0013882164,0.067807995],"genre_scores_gemma":[0.965671,0.00007988156,0.03104259,0.00041486108,0.0009367825,7.5585837e-7,0.000034795026,0.000021332677,0.0017979749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764174,0.000026690004,0.00027946074,0.0008603028,0.0006409707,0.0005508175],"domain_scores_gemma":[0.99885064,0.00042265237,0.000107893575,0.00040559954,0.00006713898,0.00014607994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008616668,0.00031631268,0.00031577304,0.00029322904,0.00029233407,0.0002650633,0.0009219546,0.0002077007,0.00032860762],"category_scores_gemma":[0.000102742466,0.00025763136,0.00008764492,0.00040047022,0.00033431716,0.00021035582,0.000115036244,0.0006186454,0.0006353521],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056943845,0.0000026591345,0.010519059,0.000032347707,0.000008691715,0.00013982355,0.00038035226,0.045437336,0.00008140486,0.00038519793,0.000015568401,0.94299185],"study_design_scores_gemma":[0.00070449297,0.00050870253,0.18217559,0.0028374915,0.00004146531,0.00020869706,0.0000034660004,0.46060917,0.0015812892,0.33956656,0.007832003,0.0039310567],"about_ca_topic_score_codex":0.00027089386,"about_ca_topic_score_gemma":0.0014790167,"teacher_disagreement_score":0.9390608,"about_ca_system_score_codex":0.000032150467,"about_ca_system_score_gemma":0.00013108012,"threshold_uncertainty_score":0.9999876},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036793802,0.00025789134,0.99343926,0.0011630378,0.0029783787,0.0004932525,0.000003543347,0.00023333286,0.0010633747],"genre_scores_gemma":[0.011945406,0.000050965653,0.98473,0.0021012798,0.0005170263,0.000024541918,0.0000050031776,0.000031481737,0.000594265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99278355,0.0001830503,0.0007500114,0.0030817175,0.0018230935,0.0013786099],"domain_scores_gemma":[0.9956488,0.0020577079,0.00030079804,0.0012147509,0.00044467975,0.0003332544],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007253451,0.0005815231,0.00065727317,0.00361545,0.0006377798,0.0012158079,0.004410336,0.00028610879,0.000008312578],"category_scores_gemma":[0.00066152675,0.00055224914,0.00010413601,0.007820741,0.0035044646,0.002313145,0.0048255427,0.0011859874,0.00006687356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022675663,0.000027223798,0.00035897785,0.000036564128,0.000004136021,0.00009245458,0.0015717397,0.009180422,0.00042791586,0.00960671,0.00005283731,0.97863877],"study_design_scores_gemma":[0.00029699472,0.00011356463,0.0076236348,0.0005145234,0.0000038811104,0.00008457777,5.3139007e-7,0.76837003,0.0004588535,0.22142828,0.0004306643,0.00067446445],"about_ca_topic_score_codex":0.000031008858,"about_ca_topic_score_gemma":0.00009602194,"teacher_disagreement_score":0.9779643,"about_ca_system_score_codex":0.0007417437,"about_ca_system_score_gemma":0.0037095738,"threshold_uncertainty_score":0.999821},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014373251,0.000076595825,0.963287,0.0034468735,0.0017512366,0.0006496333,0.000013266684,0.00023774603,0.030523265],"genre_scores_gemma":[0.11428015,0.00016548396,0.85960585,0.01673283,0.003466677,0.00022880697,0.00007376944,0.00014635078,0.00530008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959757,0.000067349625,0.0004133124,0.0015355028,0.0013073689,0.0007008022],"domain_scores_gemma":[0.9963643,0.0015265775,0.00022351896,0.0015715732,0.00015968308,0.00015435825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011708722,0.00047670145,0.00034417564,0.00034980298,0.0007850554,0.00042442683,0.0050331787,0.00022283976,0.000011307785],"category_scores_gemma":[0.00015193806,0.00027673072,0.00015946876,0.0013704562,0.00085596397,0.00046294753,0.0020177606,0.0011157121,0.00027845768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033502333,0.000013054188,0.000008238493,0.00000456297,0.000011523778,0.000016752643,0.0015334617,0.04531955,0.0000030632202,0.7260937,0.00026236835,0.22673036],"study_design_scores_gemma":[0.00016987571,0.00013155019,0.0012070088,0.00011590417,0.000010192566,0.000072013114,0.0000022661352,0.23115817,0.000020936937,0.7544136,0.012014534,0.00068392337],"about_ca_topic_score_codex":0.000027787437,"about_ca_topic_score_gemma":0.00012115429,"teacher_disagreement_score":0.22604644,"about_ca_system_score_codex":0.00022535006,"about_ca_system_score_gemma":0.0002989418,"threshold_uncertainty_score":0.99996847},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027452526,0.00026001933,0.9911898,0.00031798257,0.0017801836,0.00043773762,0.000018749777,0.00019058432,0.00577753],"genre_scores_gemma":[0.0038193008,0.000016846248,0.9886621,0.00020221947,0.00032760313,0.000023778111,0.000016002432,0.000041459985,0.006890685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968231,0.000053358468,0.00056252035,0.0013659672,0.0006134973,0.0005816039],"domain_scores_gemma":[0.99648374,0.0015611544,0.00041511154,0.0010834535,0.00032966924,0.00012684858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014854809,0.0003696561,0.00053541723,0.00051749527,0.0003280031,0.00028153267,0.0023698353,0.00030279253,0.000009282109],"category_scores_gemma":[0.0004929193,0.00033397612,0.00022926215,0.0007753431,0.00030903402,0.00033974578,0.0011243286,0.00044863045,0.000017650005],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009130148,0.00006387856,0.000249814,0.00014560406,0.00006558989,0.000031814587,0.0027485192,0.03461026,0.0013735499,0.17640503,0.0031900506,0.78110677],"study_design_scores_gemma":[0.00022197161,0.00010999479,0.00007972822,0.00017145839,0.000013181934,0.000017247436,1.7926135e-7,0.74601865,0.0025754445,0.24733157,0.0030426204,0.00041795062],"about_ca_topic_score_codex":0.00007037725,"about_ca_topic_score_gemma":0.00006457436,"teacher_disagreement_score":0.7806888,"about_ca_system_score_codex":0.00013328846,"about_ca_system_score_gemma":0.00038187925,"threshold_uncertainty_score":0.99991125},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035792746,0.00044046307,0.9929445,0.000675456,0.0019034595,0.00024344279,0.000019042745,0.00022875088,0.0035091154],"genre_scores_gemma":[0.23450431,0.006331362,0.6182138,0.034009345,0.04581858,0.00010349713,0.009961565,0.0012380842,0.049819507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964252,0.000006737478,0.00034025512,0.0016836893,0.00097009836,0.00057401706],"domain_scores_gemma":[0.9978481,0.00016385883,0.0002801667,0.0012786731,0.0003981001,0.00003111977],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018758399,0.00035250792,0.00031906174,0.0013960837,0.00066523574,0.0019398774,0.004166859,0.00014842906,0.000085277075],"category_scores_gemma":[0.001044108,0.0003073651,0.000021727128,0.0034883094,0.0020480694,0.0038366916,0.006534226,0.0006049309,0.00013588795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011800615,0.000049551723,0.0037044543,0.00049602735,0.0000108779495,0.00006399298,0.00010514348,0.48266026,0.000047444737,0.003824854,0.0020493786,0.5069762],"study_design_scores_gemma":[0.00008588719,0.00000802923,0.0002270218,0.00026834317,0.000014704161,0.000009764914,2.4686062e-7,0.96035284,0.00001622696,0.007893812,0.030730091,0.00039300718],"about_ca_topic_score_codex":0.00019643382,"about_ca_topic_score_gemma":0.0001878498,"teacher_disagreement_score":0.5065832,"about_ca_system_score_codex":0.000097308446,"about_ca_system_score_gemma":0.0005761771,"threshold_uncertainty_score":0.99993783},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023339218,0.00031532295,0.97171175,0.0015154986,0.002074032,0.00060426455,0.000044724606,0.000073502095,0.00032171153],"genre_scores_gemma":[0.95648897,0.00010784053,0.034263514,0.00478138,0.00054363,0.000119704164,0.000053470798,0.000097448166,0.0035440414],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975054,0.00002755827,0.00031303387,0.0012679789,0.0004757603,0.00041023482],"domain_scores_gemma":[0.99855816,0.00004926841,0.000117544274,0.00086242374,0.0001909141,0.00022165924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030291424,0.0003397814,0.0002527259,0.00037901482,0.00013179946,0.00012559895,0.0008409613,0.0004837694,0.00007924507],"category_scores_gemma":[0.00014152094,0.00031727023,0.00010535467,0.00039123424,0.00014542384,0.0000059426943,0.0004276322,0.000389307,0.00010965345],"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.0000790486,0.000033978515,0.00064904086,0.000051940515,0.000024414629,0.000016926506,0.00094742386,0.1623781,0.61657006,0.00030867968,0.0012654179,0.21767496],"study_design_scores_gemma":[0.0019283463,0.001966308,0.037837964,0.005316986,0.00009348511,0.000016373378,0.00001457144,0.04245112,0.76785076,0.031875294,0.105303966,0.0053448034],"about_ca_topic_score_codex":0.000020703035,"about_ca_topic_score_gemma":0.00009507318,"teacher_disagreement_score":0.9374482,"about_ca_system_score_codex":0.0001396569,"about_ca_system_score_gemma":0.00040515242,"threshold_uncertainty_score":0.99992794},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009911313,0.00001536504,0.98570347,0.00091266533,0.003143529,0.00064431404,0.00002071566,0.00018892373,0.008379886],"genre_scores_gemma":[0.96885955,0.0000022411957,0.021733703,0.0016299578,0.00069290533,0.0001298155,0.00020474762,0.000078346995,0.006668715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975813,0.0000410518,0.000765382,0.00084253,0.0003757656,0.00039395926],"domain_scores_gemma":[0.9982535,0.0006740476,0.00037127687,0.00044745306,0.0001917422,0.00006195844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010189645,0.00029549352,0.00032949736,0.0010244853,0.00026492804,0.00019676864,0.0004644422,0.00023286705,0.00031694034],"category_scores_gemma":[0.00025487028,0.00030390866,0.00009997408,0.00024378304,0.00018131193,0.00030828014,0.00010468915,0.00059870933,0.00019991197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092415234,0.000076609125,0.00018467646,0.00015749324,0.000036012527,0.00009960176,0.007589587,0.11937778,0.00023948401,0.07804036,0.0015709565,0.792535],"study_design_scores_gemma":[0.00064392947,0.00017070983,0.0012192854,0.0004931886,0.0000085785705,0.00005986899,0.0000019680413,0.7985362,0.0001664099,0.19598658,0.002236352,0.00047695608],"about_ca_topic_score_codex":0.00004041488,"about_ca_topic_score_gemma":0.00043878244,"teacher_disagreement_score":0.96786845,"about_ca_system_score_codex":0.00033497316,"about_ca_system_score_gemma":0.00010546689,"threshold_uncertainty_score":0.9999413},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000150887,0.000045751873,0.9888236,0.0036293236,0.0020919358,0.0026290237,0.000029449402,0.00059442164,0.0020056413],"genre_scores_gemma":[0.02765599,0.0000017989481,0.96917427,0.0007749345,0.0008900552,0.00028888875,0.000021455882,0.00009641811,0.0010962095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943878,0.00012243568,0.00077919505,0.0021802897,0.001568538,0.00096172816],"domain_scores_gemma":[0.9963536,0.001081114,0.0003954643,0.001309932,0.000551201,0.00030865805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019124616,0.0006725646,0.0006491567,0.0017448756,0.00066384807,0.00095331756,0.0030654517,0.00028871608,0.000014943652],"category_scores_gemma":[0.00083991844,0.00068438414,0.0002653106,0.0014433814,0.00038935788,0.0007747167,0.002074634,0.0011795232,0.00007555847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020957115,0.000021915394,0.0000011807189,0.00006904924,0.000017803744,0.000016443217,0.00051598117,0.6762012,0.00074705394,0.05833213,0.000022721606,0.26403356],"study_design_scores_gemma":[0.00018180383,0.00025041096,0.000020052186,0.0005726686,0.000006594444,0.00003107457,7.823867e-7,0.6373335,0.0011369477,0.3578707,0.0021096375,0.00048582102],"about_ca_topic_score_codex":0.000055104105,"about_ca_topic_score_gemma":0.00039377852,"teacher_disagreement_score":0.29953855,"about_ca_system_score_codex":0.00055029726,"about_ca_system_score_gemma":0.0008444928,"threshold_uncertainty_score":0.9995607},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006000554,0.00012711581,0.99604887,0.00047972956,0.0007902598,0.0008317203,0.000029377808,0.0010057075,0.000627229],"genre_scores_gemma":[0.12639329,0.00020750519,0.86562,0.00086087076,0.00056566973,0.00033674057,0.00023858677,0.0001382103,0.0056390837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628204,0.000053393334,0.00066765293,0.0016045746,0.00067827007,0.0007140617],"domain_scores_gemma":[0.9974565,0.00087122555,0.0003460808,0.0010582074,0.00017331316,0.00009469186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002509882,0.00041847603,0.00044410594,0.0013106469,0.00029979122,0.00040802115,0.0025564004,0.00027750625,0.0000057875427],"category_scores_gemma":[0.0003799425,0.0004245918,0.0000929968,0.0008878272,0.00023712886,0.0009106626,0.0010497167,0.0010957394,0.000021652242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016447868,0.000041815798,0.004501858,0.00022283343,0.000013448479,0.000074409065,0.002382775,0.05785351,0.0010203603,0.025408627,0.00030803555,0.90815586],"study_design_scores_gemma":[0.00023549474,0.00008377825,0.00038996863,0.00044798115,0.0000035692826,0.00002025912,6.326041e-7,0.9175177,0.0011897188,0.076647244,0.0030409945,0.0004226225],"about_ca_topic_score_codex":0.000044612276,"about_ca_topic_score_gemma":0.00018004791,"teacher_disagreement_score":0.90773326,"about_ca_system_score_codex":0.00052660605,"about_ca_system_score_gemma":0.00034900315,"threshold_uncertainty_score":0.9998206},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039055884,0.000024362762,0.013587623,0.000621426,0.0045003607,0.0017854493,0.00023910042,0.00014922222,0.9400366],"genre_scores_gemma":[0.990936,0.000004252139,0.00039771773,0.00048764134,0.00041967648,0.000013768392,0.000008379363,0.000025377292,0.007707194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833584,0.000010063975,0.00030699157,0.00049233343,0.0006023201,0.00025243],"domain_scores_gemma":[0.9989318,0.00038242,0.00017116527,0.00040898213,0.000050745344,0.0000548743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016695833,0.0002559883,0.0002524036,0.00032226325,0.0003666555,0.0002684266,0.00080857216,0.00002270483,0.000048745384],"category_scores_gemma":[0.000016558739,0.00016759698,0.00011643856,0.00007718895,0.0011882593,0.00018161471,0.000722146,0.00033861253,0.000048214835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012506516,0.00018446479,0.000008641927,0.00006314509,0.00007875313,0.0011111278,0.086408556,0.003172228,9.800722e-7,0.67992854,0.00010437948,0.22892666],"study_design_scores_gemma":[0.00029171663,0.00059284864,0.00014278776,0.0003394553,0.00003319205,0.00015814754,0.00024012799,0.0027737706,0.000010191239,0.99006474,0.0050021177,0.00035088288],"about_ca_topic_score_codex":0.0002940758,"about_ca_topic_score_gemma":0.0024720193,"teacher_disagreement_score":0.9518801,"about_ca_system_score_codex":0.000042589803,"about_ca_system_score_gemma":0.000109340624,"threshold_uncertainty_score":0.6834406},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54722875,0.0010870482,0.09437535,0.1530102,0.010868297,0.0042076684,0.00014061588,0.00039836738,0.18868369],"genre_scores_gemma":[0.9937328,0.0016391911,0.00024524206,0.0011003935,0.00038273938,0.000007774279,0.000004111106,0.000018850464,0.0028688717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985087,0.000025496925,0.00032381035,0.00023876222,0.00045512765,0.00044813956],"domain_scores_gemma":[0.99909514,0.00025870762,0.00024869796,0.00029758527,0.00004176546,0.0000581275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010445599,0.00019768944,0.00019195503,0.00019213732,0.0010433052,0.0005856245,0.0009571292,0.00016771481,0.00000384258],"category_scores_gemma":[0.00021337981,0.000115520066,0.00004823864,0.0003955223,0.0017746725,0.00044937246,0.0004500098,0.00044527912,0.000010630846],"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.000004269951,0.0000038095955,0.0034273067,0.0000074930904,0.000006121218,0.0000011301026,0.040894534,0.001909454,3.4449803e-7,0.51909983,0.000022431132,0.4346233],"study_design_scores_gemma":[0.0003822839,0.00007010845,0.11595655,0.0003074666,0.000004820107,0.000007987199,0.00019682938,0.06756106,0.000004717056,0.8070495,0.007891546,0.00056712993],"about_ca_topic_score_codex":0.0066465195,"about_ca_topic_score_gemma":0.035971608,"teacher_disagreement_score":0.44650406,"about_ca_system_score_codex":0.00084810745,"about_ca_system_score_gemma":0.0005712549,"threshold_uncertainty_score":0.9999683},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05908665,0.00027529913,0.8668023,0.015555654,0.0062073306,0.003056943,0.030568598,0.000727626,0.017719626],"genre_scores_gemma":[0.6443468,0.00072883966,0.23868024,0.08184136,0.0032678382,0.000058122176,0.028232131,0.0003336268,0.0025110822],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9958789,0.000029748056,0.0003527263,0.0021345979,0.0010029981,0.0006010588],"domain_scores_gemma":[0.9965116,0.00031448735,0.00015130673,0.0028467518,0.000019488894,0.00015640912],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0007601159,0.00035685318,0.00039675817,0.00023700813,0.00019640883,0.00026117454,0.0062620225,0.00023373983,0.004142483],"category_scores_gemma":[0.00017080305,0.00036557222,0.000035283625,0.0007590303,0.0006854753,0.0005644419,0.014932752,0.00050712615,0.0031180324],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037898275,0.000980407,0.14733016,0.0002611587,0.00017723761,0.0026097558,0.00926795,0.023382993,0.0066202786,0.0009555358,0.13526852,0.672767],"study_design_scores_gemma":[0.0029853608,0.000592954,0.39274156,0.0025271543,0.00016873778,0.000029357238,0.00014125223,0.23344864,0.00088832155,0.009663907,0.3502928,0.006519949],"about_ca_topic_score_codex":0.0009880466,"about_ca_topic_score_gemma":0.017350616,"teacher_disagreement_score":0.66624707,"about_ca_system_score_codex":0.0009797569,"about_ca_system_score_gemma":0.00005911202,"threshold_uncertainty_score":0.9998796},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037780108,0.0010151537,0.9965261,0.000048676597,0.0004852262,0.00014329443,0.000041858697,0.0011625105,0.0005733854],"genre_scores_gemma":[0.0025797542,0.0011444081,0.9952893,0.00011267343,0.00022126125,0.000006148244,0.0002250889,0.00008071059,0.00034061557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977262,0.000009664437,0.00023787587,0.001045099,0.000546658,0.00043450334],"domain_scores_gemma":[0.998402,0.00017971854,0.000071176575,0.0011465035,0.0001050865,0.00009551082],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094522873,0.0002798135,0.0002475709,0.00073044474,0.00026800766,0.0003802183,0.0027783131,0.00013086195,0.0000052121686],"category_scores_gemma":[0.00047072096,0.00027388398,0.000009867961,0.0014982258,0.0013431819,0.0012574359,0.002311057,0.0007089713,0.000007250629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.3318587e-7,0.0000020496966,0.000029112807,0.000057705503,0.0000015770422,0.000009074045,0.00007459378,0.86891466,0.000053708824,0.000046547033,0.0001379752,0.13067254],"study_design_scores_gemma":[0.000050054823,0.00002036384,0.0000100528705,0.0002364368,0.0000030985855,0.00001915109,5.445271e-8,0.98742145,0.00040328645,0.007866167,0.0036706864,0.00029916666],"about_ca_topic_score_codex":0.000005246409,"about_ca_topic_score_gemma":0.000017867453,"teacher_disagreement_score":0.13037337,"about_ca_system_score_codex":0.00024198715,"about_ca_system_score_gemma":0.00044816555,"threshold_uncertainty_score":0.99997133},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005474187,0.00022678362,0.9948717,0.0005343257,0.0011081398,0.00084399787,0.000021747366,0.00027018308,0.001575711],"genre_scores_gemma":[0.5894923,0.000014660768,0.40930375,0.00033063025,0.00027079362,0.00003654464,0.00002144532,0.00004264811,0.00048717367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960796,0.000032684173,0.0008626313,0.0014959624,0.00093842763,0.0005906554],"domain_scores_gemma":[0.9966638,0.00068887405,0.00054200087,0.0016638811,0.00031142737,0.0001299959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009897568,0.00044419838,0.0007108561,0.0007872834,0.00017591674,0.0002498446,0.0032860464,0.00036288504,0.0000026848522],"category_scores_gemma":[0.0001378315,0.00042489558,0.00018785248,0.000572022,0.00035293397,0.00051103585,0.0008309868,0.0005244319,0.000010863255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000841631,0.00003591517,0.000020442076,0.00013182856,0.000013401437,0.0000060325197,0.0051115723,0.3209484,0.0015056517,0.056494962,0.000030051924,0.61569333],"study_design_scores_gemma":[0.00025662646,0.0001035276,0.000048652662,0.0003405471,0.000008265691,0.000003134676,0.0000020491036,0.9157642,0.0013099398,0.0816825,0.0000956537,0.00038486367],"about_ca_topic_score_codex":0.000023740828,"about_ca_topic_score_gemma":0.000084203675,"teacher_disagreement_score":0.61530846,"about_ca_system_score_codex":0.00020691346,"about_ca_system_score_gemma":0.0004593104,"threshold_uncertainty_score":0.9998203},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029560745,0.0012622819,0.6979461,0.17130192,0.051304113,0.00509414,0.000340556,0.0027807413,0.040409412],"genre_scores_gemma":[0.9220518,0.00009223104,0.0035308583,0.05985466,0.0027929756,0.000046184,0.0000068619047,0.00018698005,0.01143746],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959476,0.000078839184,0.0003458436,0.0016358802,0.0013399018,0.0006519262],"domain_scores_gemma":[0.9834282,0.015282292,0.00020112372,0.00091993436,0.000087431785,0.00008103231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073822285,0.0004991559,0.00039389235,0.00046939845,0.00081174297,0.00033801643,0.0018279759,0.00019150518,0.000072682014],"category_scores_gemma":[0.00665082,0.0003409542,0.00015602262,0.00078230235,0.0021979269,0.00029905338,0.0013929255,0.0009783024,0.00015410394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007771079,0.000047344216,0.0011166175,0.00016755685,0.000058611535,0.00070742064,0.0049338522,0.068950675,0.01481461,0.21441177,0.0095847435,0.6851291],"study_design_scores_gemma":[0.0005276693,0.00035331954,0.0121831335,0.0003744367,0.000022093533,0.00020191389,0.0000010404739,0.068595484,0.0075548575,0.89417714,0.014435721,0.0015731737],"about_ca_topic_score_codex":0.00003707929,"about_ca_topic_score_gemma":0.00024895297,"teacher_disagreement_score":0.89249104,"about_ca_system_score_codex":0.00022127407,"about_ca_system_score_gemma":0.00022279282,"threshold_uncertainty_score":0.9999043},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011857335,0.00009721325,0.9954872,0.00040558682,0.0009575036,0.00024221673,0.000008257891,0.00012734471,0.0014889009],"genre_scores_gemma":[0.38115752,0.000042189724,0.61564887,0.0008536254,0.0005194888,0.000012097893,0.000025065221,0.000061117746,0.0016800266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971756,0.000025686913,0.0004263747,0.00094858935,0.0010441493,0.00037960408],"domain_scores_gemma":[0.99791396,0.0005711537,0.00028590817,0.00076305424,0.00035788518,0.00010801353],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005916664,0.00034015198,0.00039182344,0.0010311826,0.00014818257,0.0002277189,0.0016866883,0.0001525769,0.000011026735],"category_scores_gemma":[0.00007347753,0.00029978695,0.00007706372,0.001203227,0.0003505295,0.00046573495,0.0007343046,0.00035624532,0.000034321958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024686005,0.00004097162,0.00015478863,0.00012319957,0.000033607223,0.00011820926,0.0010157444,0.49577686,0.0004597556,0.0850475,0.000035669706,0.417169],"study_design_scores_gemma":[0.00055261893,0.0006125324,0.0011202917,0.0008479338,0.00001383292,0.00008170129,5.3174506e-7,0.7951556,0.006418858,0.19335249,0.0010239814,0.0008196605],"about_ca_topic_score_codex":0.000016515723,"about_ca_topic_score_gemma":0.000067494904,"teacher_disagreement_score":0.41634935,"about_ca_system_score_codex":0.000084178435,"about_ca_system_score_gemma":0.0005922497,"threshold_uncertainty_score":0.9999454},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010645238,0.00028939501,0.9958442,0.0011187458,0.0017239492,0.0005657437,0.000022599685,0.00019148736,0.00013747092],"genre_scores_gemma":[0.00710908,0.00006830939,0.9890975,0.0014538672,0.00090881065,0.00004521008,0.00006360372,0.00004294189,0.0012106956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723434,0.000024886194,0.0004299805,0.0013114454,0.0005086326,0.0004907352],"domain_scores_gemma":[0.99817675,0.0006501835,0.0002202385,0.00054709415,0.00024966733,0.00015608128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010167578,0.00038695082,0.0004096973,0.0008120607,0.00033512822,0.00056324096,0.0010922248,0.00021520203,0.000003619686],"category_scores_gemma":[0.00012295655,0.00036704575,0.000103515296,0.00054137246,0.0002040389,0.0004276884,0.00055478566,0.00033871442,0.000008511964],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015282998,0.000013619003,0.000005473028,0.00007488306,0.000027961689,0.000037235135,0.0010101928,0.056373063,0.0011684545,0.053708326,0.00013026441,0.88743526],"study_design_scores_gemma":[0.00039892644,0.00016407673,0.000025960826,0.00009195777,0.0000067631986,0.000047267466,1.6931543e-7,0.8157662,0.00070736586,0.18120858,0.0012031592,0.00037954046],"about_ca_topic_score_codex":0.000016972588,"about_ca_topic_score_gemma":0.000038720376,"teacher_disagreement_score":0.8870557,"about_ca_system_score_codex":0.00012004622,"about_ca_system_score_gemma":0.00034362526,"threshold_uncertainty_score":0.99987817},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003547188,0.0007165068,0.9917508,0.0021212464,0.00034847367,0.0006821753,0.0000019986276,0.00007218317,0.0007594608],"genre_scores_gemma":[0.5825767,0.0066650435,0.38305807,0.0071585546,0.0065004304,0.0005757979,0.0006131992,0.00032766882,0.012524531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985975,0.00002608352,0.00024014662,0.00052103173,0.00037591404,0.00023929817],"domain_scores_gemma":[0.99826235,0.001311407,0.0000654396,0.000213961,0.000036000045,0.000110821966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005769171,0.00014961208,0.00027081053,0.0004723051,0.00007233887,0.000059495233,0.00017052119,0.00012605423,0.000005458314],"category_scores_gemma":[0.00037004126,0.00012806596,0.000028561351,0.0005389209,0.00037082072,0.000053361087,0.00016131892,0.0006929612,0.000013538692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005649491,0.000028703413,0.004025177,0.00012829603,0.0000030322203,0.00023708398,0.00023150553,0.0047917217,0.00008637927,0.00014328079,0.000070332986,0.99024886],"study_design_scores_gemma":[0.0028402142,0.00034917032,0.03306852,0.0037072215,0.00006512035,0.0006679498,0.0000020252296,0.8951105,0.00021381142,0.04804334,0.0151644135,0.0007677064],"about_ca_topic_score_codex":0.000022016915,"about_ca_topic_score_gemma":0.00001943524,"teacher_disagreement_score":0.98948115,"about_ca_system_score_codex":0.00021394652,"about_ca_system_score_gemma":0.00032026536,"threshold_uncertainty_score":0.52223784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022451697,0.000100238,0.9970676,0.00015562697,0.0009654732,0.0006440323,0.00002015177,0.0003343188,0.00048806405],"genre_scores_gemma":[0.018417504,0.00006719012,0.9801781,0.0007540365,0.00023112312,0.000016316635,0.000020004842,0.000046545574,0.00026915444],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9957574,0.0000922451,0.00084052345,0.0013055066,0.0014580112,0.0005463211],"domain_scores_gemma":[0.9970337,0.00087956525,0.00052853714,0.0009387583,0.00044589926,0.00017355333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011181826,0.00050469855,0.000609935,0.001024249,0.00019429557,0.00048014562,0.0022586084,0.00027826818,0.0000584429],"category_scores_gemma":[0.00031141017,0.00047000125,0.000116316456,0.0010012737,0.0013776908,0.0010276993,0.0008831346,0.00067924167,0.000027611923],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012477039,0.00007968269,0.0000742514,0.00017587769,0.000068046815,0.00015578914,0.0037481051,0.015865313,0.16641659,0.0037313045,0.000085496256,0.80958706],"study_design_scores_gemma":[0.0005475649,0.00034913083,0.00014619982,0.00093294465,0.000041082574,0.00010211465,0.0000030783442,0.29092333,0.64708936,0.05885774,0.000016198272,0.0009912791],"about_ca_topic_score_codex":0.00007190911,"about_ca_topic_score_gemma":0.00003054503,"teacher_disagreement_score":0.8085958,"about_ca_system_score_codex":0.0003635557,"about_ca_system_score_gemma":0.0006248794,"threshold_uncertainty_score":0.9997752},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008548502,0.000018107534,0.991661,0.0016742663,0.0014489254,0.0007474823,0.000015688733,0.00013011375,0.004218921],"genre_scores_gemma":[0.26803946,0.00017837231,0.7267731,0.0018955653,0.0004778145,0.00004752472,0.00004048614,0.00006908491,0.0024785788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99469274,0.000049471586,0.0006588897,0.0011184808,0.0027819213,0.00069847814],"domain_scores_gemma":[0.9964236,0.000542612,0.00048395616,0.0020643224,0.0002734141,0.0002120707],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0025441686,0.00036472396,0.00039384133,0.0013286407,0.00017267452,0.0021249156,0.006775309,0.00014308379,0.0000075839803],"category_scores_gemma":[0.0009558743,0.00033915354,0.00008079202,0.0015215034,0.00048451696,0.018083103,0.005710208,0.0006053886,0.0001575196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021398168,0.00003140052,0.00012530686,0.0002301017,0.000039739483,0.000050260336,0.0013046347,0.11805879,0.00015642983,0.053978853,0.0002543278,0.82574874],"study_design_scores_gemma":[0.0007999113,0.0008455031,0.002934764,0.001720941,0.000030111612,0.000025749005,0.0000065702334,0.93070215,0.0057879016,0.031611647,0.023975968,0.0015587683],"about_ca_topic_score_codex":0.0001255278,"about_ca_topic_score_gemma":0.00008080681,"teacher_disagreement_score":0.82418996,"about_ca_system_score_codex":0.0005751063,"about_ca_system_score_gemma":0.0004742816,"threshold_uncertainty_score":0.99990606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025917152,0.00007440837,0.99300236,0.0023225616,0.0025360794,0.0006718158,0.000007755859,0.00035335636,0.0010057379],"genre_scores_gemma":[0.16883199,0.000056849614,0.8262121,0.0010504761,0.0009947167,0.000104602834,0.00004509889,0.00007821326,0.0026259553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643254,0.00002260804,0.00055507926,0.0017373129,0.0007280796,0.00052440364],"domain_scores_gemma":[0.9967588,0.00071151915,0.00031929323,0.0017404868,0.0003609227,0.00010897699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012827272,0.00035707204,0.00035274477,0.00071990024,0.00027727464,0.00049271836,0.002899956,0.00030874548,0.0000043608184],"category_scores_gemma":[0.00021531065,0.00034470708,0.0001270819,0.000570031,0.00028502112,0.0004405195,0.0005366912,0.00041826718,0.00009389311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027572726,0.000008945109,0.000008245934,0.00003512343,0.000004584962,0.0000030544768,0.0002982052,0.08396426,0.00029361935,0.23916349,0.000036721707,0.676181],"study_design_scores_gemma":[0.00011262592,0.000041025192,0.0000807766,0.00011855094,0.000003899382,0.0000049699033,1.7309128e-7,0.75850266,0.0002303704,0.23899375,0.0016119884,0.00029918805],"about_ca_topic_score_codex":0.000020420148,"about_ca_topic_score_gemma":0.00007816456,"teacher_disagreement_score":0.6758818,"about_ca_system_score_codex":0.0003294909,"about_ca_system_score_gemma":0.00049505464,"threshold_uncertainty_score":0.9999005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002950982,0.0002064258,0.99498653,0.0007020688,0.001578394,0.00074612215,0.000008860636,0.00016886159,0.0013076365],"genre_scores_gemma":[0.040052485,0.000021900207,0.9582224,0.00038903515,0.00040921924,0.00003394231,0.0000037076732,0.000051185227,0.00081614655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966257,0.000038917202,0.0006252678,0.0014392646,0.00072280783,0.0005479953],"domain_scores_gemma":[0.9972359,0.0006388096,0.00037947696,0.0013862636,0.0002462328,0.000113297676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001975722,0.00037266946,0.00056256313,0.0007069996,0.00022389342,0.0005480354,0.0052218973,0.0002549614,0.0000042303154],"category_scores_gemma":[0.00018370873,0.00036234088,0.000118735654,0.00057365495,0.00035236374,0.00061331247,0.0026512993,0.00041485604,0.000009030248],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018097095,0.000031191317,0.000049844384,0.00019504128,0.000018413535,0.000037112208,0.0030556147,0.07727223,0.0008843045,0.16199125,0.000040097173,0.7564068],"study_design_scores_gemma":[0.0003125331,0.00017537255,0.000051969433,0.00087217963,0.000005056722,0.000018158938,5.7321625e-7,0.55298615,0.0010814986,0.4426089,0.0014607572,0.00042684906],"about_ca_topic_score_codex":0.00007409795,"about_ca_topic_score_gemma":0.00012375259,"teacher_disagreement_score":0.75597996,"about_ca_system_score_codex":0.00017567087,"about_ca_system_score_gemma":0.00037291943,"threshold_uncertainty_score":0.9998829},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000107384854,0.00015526704,0.9929759,0.0020449979,0.002834715,0.001161642,0.000006897073,0.000388084,0.00032511578],"genre_scores_gemma":[0.020521171,0.000013418527,0.9752003,0.0024078095,0.00077137357,0.00007318905,0.000011515378,0.00008482891,0.00091641577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99560225,0.000033025743,0.00069272966,0.0021517398,0.0006855446,0.0008346847],"domain_scores_gemma":[0.9972472,0.00039138334,0.00048149072,0.0014177506,0.00027625446,0.00018590792],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018687373,0.0005658214,0.0006021898,0.0006635051,0.00041681636,0.0018590408,0.005564408,0.00033936847,0.0000040226264],"category_scores_gemma":[0.000095024705,0.00056181266,0.00011913301,0.00055274414,0.00031578753,0.0014085256,0.002902152,0.0006342897,0.000017230821],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017649543,0.000019880545,0.00003909809,0.0001916679,0.000010851184,0.00004481749,0.0016615203,0.031297345,0.000953558,0.026663758,0.000043811022,0.93905604],"study_design_scores_gemma":[0.00032272234,0.00010282645,0.000044629833,0.0006280005,0.000006204741,0.000026533215,4.0736057e-7,0.7557103,0.00035842022,0.24173188,0.0005073099,0.0005607804],"about_ca_topic_score_codex":0.0000728317,"about_ca_topic_score_gemma":0.00015837229,"teacher_disagreement_score":0.9384953,"about_ca_system_score_codex":0.00035188693,"about_ca_system_score_gemma":0.0006899587,"threshold_uncertainty_score":0.99981594},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000702947,0.000062834595,0.9945877,0.00022505158,0.0013569248,0.00046395737,0.000006934259,0.00016150583,0.0024320972],"genre_scores_gemma":[0.9444815,0.00013428679,0.053657968,0.0009812865,0.00029181325,0.000012526,0.00002989854,0.000041299405,0.00036945858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684244,0.00004000297,0.00074121443,0.00052973913,0.0012776203,0.0005689624],"domain_scores_gemma":[0.99835587,0.00051012955,0.00029987257,0.00049509207,0.0001900658,0.00014899678],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021330134,0.00032064063,0.00035686427,0.0016686862,0.0002587993,0.001364525,0.0011062528,0.0002843175,0.0000034232237],"category_scores_gemma":[0.00023636637,0.0002936444,0.00005351334,0.0011905221,0.0003320991,0.002476136,0.00086620013,0.00077524467,0.000049744187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034439905,0.000024913576,0.0017291929,0.0008087496,0.000024287088,0.00022265632,0.02055355,0.10427216,0.00010932326,0.65830564,0.00006201575,0.21385309],"study_design_scores_gemma":[0.00035818756,0.00008233953,0.00074486656,0.00052077905,0.0000032965945,0.00006136498,0.000008930146,0.94564694,0.00012136265,0.05180643,0.00016033502,0.00048514587],"about_ca_topic_score_codex":0.000031797947,"about_ca_topic_score_gemma":0.000018002567,"teacher_disagreement_score":0.9437785,"about_ca_system_score_codex":0.0006198774,"about_ca_system_score_gemma":0.00041324628,"threshold_uncertainty_score":0.99995154},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028601648,0.00038653152,0.9923408,0.0013356637,0.0017010197,0.0003046065,0.0000024400501,0.0007023911,0.0031979342],"genre_scores_gemma":[0.16093746,0.0042216424,0.82248765,0.0046597524,0.0010153549,0.00013990686,0.00012060557,0.0001083941,0.006309245],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973144,0.000027714354,0.00054458977,0.0007289505,0.00086526724,0.00051911187],"domain_scores_gemma":[0.99807113,0.0003943428,0.00028439425,0.001059126,0.00013294037,0.00005803732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084053294,0.00028995692,0.0003169416,0.0019287794,0.00011707083,0.0006179182,0.00362444,0.00030123064,0.0000041706753],"category_scores_gemma":[0.00037927032,0.00026711528,0.0000567943,0.0032574306,0.0004240106,0.0038951002,0.0011931716,0.0006715202,0.00020552296],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033309104,0.0000103197,0.00009167994,0.000037717804,9.225093e-7,0.000011655057,0.00045356626,0.0071284403,0.000010975355,0.014438877,0.00016251334,0.97765],"study_design_scores_gemma":[0.00039152827,0.0001386987,0.0009093247,0.0003928367,0.0000018923287,0.000012360451,0.0000013221074,0.33980167,0.0012870021,0.6325015,0.02386153,0.0007003275],"about_ca_topic_score_codex":0.000004471214,"about_ca_topic_score_gemma":0.000043669945,"teacher_disagreement_score":0.9769497,"about_ca_system_score_codex":0.00055489683,"about_ca_system_score_gemma":0.00079187524,"threshold_uncertainty_score":0.9999781},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010391362,0.00031922513,0.99178135,0.0008010294,0.0029815182,0.00075234025,0.0000016763983,0.0010190929,0.002342719],"genre_scores_gemma":[0.00277483,0.00005795884,0.99490345,0.0005642082,0.0004682178,0.00007475516,0.000010562653,0.00006329404,0.001082722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632245,0.00013136108,0.00066320045,0.0015896861,0.0005759231,0.0007173997],"domain_scores_gemma":[0.99647063,0.0015710763,0.000403828,0.0011066668,0.00030103992,0.00014676251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033311967,0.0005141921,0.00072105695,0.0010184048,0.00043132494,0.0007087879,0.0028154473,0.00039752314,0.000006864415],"category_scores_gemma":[0.00020578418,0.00047833045,0.00023922983,0.0006193015,0.0002644824,0.0004938557,0.0012792081,0.00082856603,0.000030436708],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001994921,0.000008274737,0.000013317987,0.000064121996,0.000011424413,0.000010584253,0.0004042848,0.004636964,0.00012826249,0.063168325,0.000053734268,0.9314987],"study_design_scores_gemma":[0.00012218478,0.00017912805,0.00004420959,0.00026502536,0.0000051953466,0.00003347708,1.8636608e-7,0.730689,0.0005818308,0.24759361,0.020010801,0.00047536395],"about_ca_topic_score_codex":0.00004673595,"about_ca_topic_score_gemma":0.000058718997,"teacher_disagreement_score":0.93102336,"about_ca_system_score_codex":0.00031186067,"about_ca_system_score_gemma":0.00022810881,"threshold_uncertainty_score":0.9997668},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028601648,0.00038653152,0.9923408,0.0013356637,0.0017010197,0.0003046065,0.0000024400501,0.0007023911,0.0031979342],"genre_scores_gemma":[0.16093746,0.0042216424,0.82248765,0.0046597524,0.0010153549,0.00013990686,0.00012060557,0.0001083941,0.006309245],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973144,0.000027714354,0.00054458977,0.0007289505,0.00086526724,0.00051911187],"domain_scores_gemma":[0.99807113,0.0003943428,0.00028439425,0.001059126,0.00013294037,0.00005803732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084053294,0.00028995692,0.0003169416,0.0019287794,0.00011707083,0.0006179182,0.00362444,0.00030123064,0.0000041706753],"category_scores_gemma":[0.00037927032,0.00026711528,0.0000567943,0.0032574306,0.0004240106,0.0038951002,0.0011931716,0.0006715202,0.00020552296],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033309104,0.0000103197,0.00009167994,0.000037717804,9.225093e-7,0.000011655057,0.00045356626,0.0071284403,0.000010975355,0.014438877,0.00016251334,0.97765],"study_design_scores_gemma":[0.00039152827,0.0001386987,0.0009093247,0.0003928367,0.0000018923287,0.000012360451,0.0000013221074,0.33980167,0.0012870021,0.6325015,0.02386153,0.0007003275],"about_ca_topic_score_codex":0.000004471214,"about_ca_topic_score_gemma":0.000043669945,"teacher_disagreement_score":0.9769497,"about_ca_system_score_codex":0.00055489683,"about_ca_system_score_gemma":0.00079187524,"threshold_uncertainty_score":0.9999781},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007004266,0.000048387454,0.99171925,0.0005015717,0.005950299,0.00064895046,0.000017183243,0.00030101894,0.000743293],"genre_scores_gemma":[0.041513152,0.000025279409,0.95564425,0.00057663425,0.0013683306,0.000047492387,0.000047063226,0.000042328284,0.0007354811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673706,0.000026485777,0.00048059665,0.0014369186,0.00079705246,0.0005218793],"domain_scores_gemma":[0.99780107,0.00058734446,0.00026635203,0.0008813237,0.0003516462,0.00011225241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001018629,0.00034720823,0.00035866577,0.00069158315,0.00024981963,0.00041432804,0.0018904384,0.0003223874,0.000011098991],"category_scores_gemma":[0.00027741838,0.00035952678,0.00014711476,0.00044123546,0.00020054482,0.0006804082,0.00064464676,0.0004575255,0.00007513444],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004380709,0.0000108285385,0.00000561674,0.000039170583,0.000008616478,0.00001248398,0.00081179006,0.035490975,0.00004147998,0.008204111,0.000030307974,0.95534027],"study_design_scores_gemma":[0.0002566508,0.00007166065,0.000019758354,0.00015389734,0.0000066623556,0.0000059471836,1.4604956e-7,0.6754804,0.00019070989,0.3231317,0.0003847885,0.00029765832],"about_ca_topic_score_codex":0.00008660311,"about_ca_topic_score_gemma":0.00033179423,"teacher_disagreement_score":0.9550426,"about_ca_system_score_codex":0.00027985827,"about_ca_system_score_gemma":0.0005235263,"threshold_uncertainty_score":0.9998857},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024790997,0.00016131515,0.99359185,0.000645561,0.0024996845,0.00043094787,0.000038849048,0.00009361231,0.0000590822],"genre_scores_gemma":[0.36934045,0.000033807963,0.6255346,0.0034503366,0.0010563814,0.000011428425,0.00002060194,0.000102107675,0.00045030235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609894,0.00014142267,0.00065881055,0.0013664063,0.0011747482,0.00055965036],"domain_scores_gemma":[0.9952575,0.00049237086,0.00046926053,0.0034648022,0.00023348197,0.000082564984],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0022161356,0.0004024427,0.00040386905,0.00024341085,0.000447273,0.00036627892,0.0056194076,0.0002552766,0.0000058193564],"category_scores_gemma":[0.0003415933,0.00024653523,0.00015398972,0.0011085485,0.00079978834,0.00037717933,0.004163748,0.0008116437,0.00000528424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008225684,0.000033598964,0.0007901562,0.00013522897,0.000039319544,0.000077697056,0.0013468816,0.600347,0.009516094,0.021263333,0.000099052566,0.36634344],"study_design_scores_gemma":[0.00011339222,0.00001726311,0.00016265157,0.00012925049,0.000012214912,0.000030223817,2.0843316e-7,0.9660224,0.004216684,0.028852152,0.0001452246,0.00029837596],"about_ca_topic_score_codex":0.00032802386,"about_ca_topic_score_gemma":0.00012255232,"teacher_disagreement_score":0.36805728,"about_ca_system_score_codex":0.00026156363,"about_ca_system_score_gemma":0.0007991861,"threshold_uncertainty_score":0.9999987},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028942797,0.00005661137,0.99326414,0.0013914834,0.0031543013,0.00063319237,0.00002404728,0.00028442696,0.0011628503],"genre_scores_gemma":[0.08599586,0.000044435907,0.9060178,0.0052535255,0.0012888504,0.00003156672,0.000103499544,0.00006619505,0.0011983081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968127,0.000017244045,0.00066380156,0.0008875761,0.0010584877,0.0005601868],"domain_scores_gemma":[0.99728537,0.00095923647,0.00035679466,0.0008426523,0.0004243844,0.00013154867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011775878,0.0003710247,0.0003916179,0.00079734315,0.0002773424,0.0006459048,0.0021926423,0.0003290427,0.00000992092],"category_scores_gemma":[0.00036520467,0.00037655278,0.00012969163,0.0004588677,0.00029596436,0.0015678848,0.00077688025,0.0005115464,0.000103307735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026644519,0.0000097787915,0.000024302408,0.00013738875,0.000024458306,0.000018982248,0.0023811387,0.07042521,0.000076732686,0.4725101,0.00017641198,0.45418885],"study_design_scores_gemma":[0.0004240702,0.000076185526,0.000028832232,0.00021400546,0.000005741173,0.000022001761,5.06301e-7,0.8435523,0.00043518306,0.15089728,0.0039322753,0.00041161524],"about_ca_topic_score_codex":0.000012109002,"about_ca_topic_score_gemma":0.00001584848,"teacher_disagreement_score":0.7731271,"about_ca_system_score_codex":0.00035407467,"about_ca_system_score_gemma":0.0007103181,"threshold_uncertainty_score":0.99986863},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058760314,0.0001842618,0.9932772,0.0009174336,0.0032074384,0.0005696316,0.0000040778255,0.00040895064,0.0013722836],"genre_scores_gemma":[0.03281131,0.000039379815,0.9629582,0.0019154886,0.0007952558,0.000031056607,0.0000038280577,0.00006980662,0.0013756566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99581695,0.000024922672,0.0005551521,0.0017555471,0.00088342564,0.0009639996],"domain_scores_gemma":[0.9969788,0.0009731919,0.00027873187,0.001398025,0.00022855081,0.00014268573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015966729,0.00045736466,0.00047205447,0.00069804233,0.00037231718,0.00073773024,0.003612163,0.00027999026,0.0000045818965],"category_scores_gemma":[0.00033982538,0.00047032087,0.00016318631,0.0005273369,0.0002491763,0.00059820234,0.001423225,0.0005976602,0.000034122488],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003951727,0.000007870072,0.00002726518,0.00007161346,0.000010186997,0.000039350223,0.0006856257,0.088567406,0.00013265299,0.03988776,0.000031113734,0.8705352],"study_design_scores_gemma":[0.00022248241,0.000047160695,0.000022423732,0.00045434633,0.000005358134,0.000016648175,1.1046757e-7,0.68173385,0.00043660862,0.3149882,0.0016771385,0.00039567854],"about_ca_topic_score_codex":0.00001495804,"about_ca_topic_score_gemma":0.000034816934,"teacher_disagreement_score":0.87013954,"about_ca_system_score_codex":0.0004630939,"about_ca_system_score_gemma":0.0005334925,"threshold_uncertainty_score":0.9997749},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012558917,0.00008515984,0.9904273,0.004072155,0.0032263289,0.0006907624,0.0000041264034,0.00046301642,0.0009055239],"genre_scores_gemma":[0.074546516,0.00006919023,0.91462743,0.0007342217,0.0010798357,0.00003691826,0.000018336565,0.000082732404,0.008804822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546707,0.00005044149,0.0006094631,0.0019938326,0.0011073713,0.0007718421],"domain_scores_gemma":[0.99635196,0.0013372451,0.00033007658,0.0014613156,0.00033969138,0.0001797357],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014316319,0.0004586228,0.0004996695,0.0007811508,0.0004412696,0.0007432061,0.0028352877,0.00031555546,0.000011936683],"category_scores_gemma":[0.0004890739,0.00045482308,0.0001647001,0.00072065805,0.0002948299,0.0005945049,0.0015598064,0.0009150182,0.00006709295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013722379,0.00001491888,0.000037548278,0.000067424495,0.000024673665,0.000060984898,0.001508842,0.44265264,0.00027090937,0.26446474,0.00008886487,0.29079473],"study_design_scores_gemma":[0.0003105585,0.00017513674,0.000052957592,0.00023462546,0.000009711127,0.000016311356,5.3691394e-7,0.5818459,0.00094274204,0.41473994,0.001157714,0.00051390973],"about_ca_topic_score_codex":0.00007854403,"about_ca_topic_score_gemma":0.000066009205,"teacher_disagreement_score":0.29028082,"about_ca_system_score_codex":0.0003785347,"about_ca_system_score_gemma":0.00052533427,"threshold_uncertainty_score":0.9997904},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000105669285,0.0001266064,0.98893046,0.0021590895,0.0045778244,0.0005889732,0.000004178972,0.00034028248,0.0031669235],"genre_scores_gemma":[0.11605091,0.00020182799,0.8759257,0.0045694057,0.00094442326,0.000022635875,0.00003545129,0.00008339604,0.0021662472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963615,0.000035792724,0.0006840515,0.0011235763,0.0012042769,0.0005907959],"domain_scores_gemma":[0.9973304,0.00033122147,0.00040702344,0.0014906327,0.00027927247,0.00016144295],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013449166,0.00042109902,0.00041667838,0.00087032566,0.00031163188,0.001981336,0.005460309,0.00033881338,0.00001681563],"category_scores_gemma":[0.00018243352,0.0004060577,0.00009848929,0.0007999044,0.0002086438,0.0045356625,0.003352771,0.0008864111,0.00020913861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001156823,0.000007095115,0.000004832454,0.000024853158,0.0000055471373,0.000037331556,0.00075900863,0.051738176,0.00005917435,0.013140628,0.00004139106,0.93417037],"study_design_scores_gemma":[0.00025366482,0.00011002325,0.000102842234,0.00019224928,0.0000046978325,0.00006586649,2.8342814e-7,0.92288214,0.00031232936,0.06940809,0.0061757825,0.00049204804],"about_ca_topic_score_codex":0.000028499362,"about_ca_topic_score_gemma":0.000058228812,"teacher_disagreement_score":0.9336783,"about_ca_system_score_codex":0.0003586452,"about_ca_system_score_gemma":0.00050502346,"threshold_uncertainty_score":0.9999206},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010344726,0.00017432649,0.98833174,0.0015298899,0.0055166697,0.0007784515,0.000007037208,0.0005871569,0.0020402374],"genre_scores_gemma":[0.28330866,0.000101212194,0.6919429,0.0054688565,0.0040475586,0.00006133426,0.000015900501,0.0002490205,0.014804605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927569,0.00006411275,0.00096337026,0.0029368082,0.0018782401,0.0014005468],"domain_scores_gemma":[0.9962507,0.00046653443,0.00048816815,0.0019606657,0.000348836,0.00048513463],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018951583,0.00084792316,0.0008074479,0.0013672737,0.000506825,0.0011223245,0.004849002,0.00045964523,0.000024597946],"category_scores_gemma":[0.00044312794,0.0008506944,0.00020832762,0.0011798809,0.00024196458,0.0009059973,0.0042264857,0.0017754609,0.0005319566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013329032,0.000028057255,0.00020635939,0.00006878218,0.00003624158,0.00015091838,0.0048769508,0.20111242,0.0012599846,0.0049443543,0.0000426865,0.78725994],"study_design_scores_gemma":[0.0006600428,0.00033904656,0.00016499283,0.0008346917,0.00001954337,0.000047355275,0.0000035188232,0.9561848,0.0024311135,0.030032232,0.00773415,0.0015484793],"about_ca_topic_score_codex":0.00008825209,"about_ca_topic_score_gemma":0.00007032216,"teacher_disagreement_score":0.78571147,"about_ca_system_score_codex":0.00083702145,"about_ca_system_score_gemma":0.00063620665,"threshold_uncertainty_score":0.9999146},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008687947,0.0004044873,0.97375315,0.013807988,0.0037777368,0.0006108406,0.000018058236,0.0031365992,0.004404231],"genre_scores_gemma":[0.023611149,0.0002052037,0.97343224,0.0011688208,0.00060744636,0.000033291934,0.000020527936,0.00015112392,0.0007702156],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99168456,0.00006875569,0.0009818192,0.003444407,0.002190032,0.0016304196],"domain_scores_gemma":[0.97578454,0.0021091904,0.00054854836,0.021013536,0.00031575654,0.00022843618],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0023540237,0.0009801557,0.0009366254,0.0022440662,0.0005464475,0.0014533758,0.11415775,0.0008367891,0.00003476822],"category_scores_gemma":[0.01991398,0.00096026616,0.00024127314,0.0022984007,0.0011030855,0.001904681,0.2912556,0.002242142,0.00030573123],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000901045,0.000039856764,0.00027888978,0.00020285319,0.000054310996,0.0007686651,0.0005424868,0.004521318,0.00037222414,0.023888486,0.007730937,0.96159095],"study_design_scores_gemma":[0.00017820754,0.00005757475,0.000106088126,0.00064608693,0.000005758772,0.000048848116,1.6330013e-7,0.43170935,0.000916681,0.56393087,0.0017050747,0.0006953017],"about_ca_topic_score_codex":0.000049149603,"about_ca_topic_score_gemma":0.00007859163,"teacher_disagreement_score":0.96089566,"about_ca_system_score_codex":0.00064764806,"about_ca_system_score_gemma":0.00067521114,"threshold_uncertainty_score":0.9995832},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042808682,0.00065160205,0.9919459,0.0016546837,0.003014355,0.0013726554,0.000017408594,0.0006565113,0.00064407964],"genre_scores_gemma":[0.012085082,0.000077772536,0.98360044,0.0025701225,0.000979468,0.000040143477,0.000021028476,0.000094670184,0.00053127215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99450433,0.00006370958,0.00089386204,0.0022889269,0.0012650067,0.0009841871],"domain_scores_gemma":[0.9938903,0.0030785934,0.00040162008,0.0017255532,0.00064611924,0.00025782865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020395103,0.0007145278,0.00092659995,0.00084730424,0.00045000413,0.0005452419,0.003834302,0.00044414675,0.0000124223325],"category_scores_gemma":[0.0008210701,0.00066278235,0.0003135808,0.0009827777,0.00029091883,0.00045198828,0.0011527429,0.0008684901,0.0000443035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044642864,0.00005554767,0.000071158334,0.0006436746,0.00004835768,0.00015887248,0.0013720812,0.049670696,0.0004250724,0.027201496,0.00010449169,0.9202039],"study_design_scores_gemma":[0.0006033439,0.00018166706,0.000019811285,0.0011619702,0.000020932719,0.0000132995765,1.5958129e-7,0.9640191,0.00043728907,0.030901885,0.0019281454,0.0007123691],"about_ca_topic_score_codex":0.0000120711775,"about_ca_topic_score_gemma":0.000039882696,"teacher_disagreement_score":0.9194915,"about_ca_system_score_codex":0.0004209107,"about_ca_system_score_gemma":0.0012050514,"threshold_uncertainty_score":0.99958235},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068517445,0.001070734,0.99668515,0.00030202523,0.00059081434,0.0002026216,0.00003804351,0.00016827353,0.0008738255],"genre_scores_gemma":[0.011697286,0.0009515758,0.97092396,0.0005379643,0.00083354424,0.00008700953,0.00027897276,0.00009009258,0.014599595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735993,0.000053924407,0.0003399825,0.0013818069,0.00036426578,0.000500117],"domain_scores_gemma":[0.9980144,0.0008814388,0.00012765879,0.0008236824,0.00005174899,0.0001010652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009247768,0.0003143946,0.0003571639,0.0008108452,0.00021544879,0.00070763077,0.0019422111,0.000101557496,0.0000017225843],"category_scores_gemma":[0.00017778033,0.00028842728,0.000036929207,0.0017345825,0.00039848278,0.0010233358,0.003079719,0.0008117182,0.00003912171],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001072509,0.000041407562,0.0005310568,0.000056560344,0.0000036663682,0.00005269102,0.0006771062,0.0024756668,0.000023207807,0.005756995,0.00014411577,0.99023646],"study_design_scores_gemma":[0.00018190185,0.00005143241,0.00059353583,0.00046542461,0.0000030209437,0.000028841241,3.616452e-7,0.97265404,0.00006762282,0.013422031,0.012118812,0.0004129429],"about_ca_topic_score_codex":0.00011415836,"about_ca_topic_score_gemma":0.0004980564,"teacher_disagreement_score":0.9898235,"about_ca_system_score_codex":0.00017427973,"about_ca_system_score_gemma":0.0007124778,"threshold_uncertainty_score":0.9999568},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068517445,0.001070734,0.99668515,0.00030202523,0.00059081434,0.0002026216,0.00003804351,0.00016827353,0.0008738255],"genre_scores_gemma":[0.011697286,0.0009515758,0.97092396,0.0005379643,0.00083354424,0.00008700953,0.00027897276,0.00009009258,0.014599595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735993,0.000053924407,0.0003399825,0.0013818069,0.00036426578,0.000500117],"domain_scores_gemma":[0.9980144,0.0008814388,0.00012765879,0.0008236824,0.00005174899,0.0001010652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009247768,0.0003143946,0.0003571639,0.0008108452,0.00021544879,0.00070763077,0.0019422111,0.000101557496,0.0000017225843],"category_scores_gemma":[0.00017778033,0.00028842728,0.000036929207,0.0017345825,0.00039848278,0.0010233358,0.003079719,0.0008117182,0.00003912171],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001072509,0.000041407562,0.0005310568,0.000056560344,0.0000036663682,0.00005269102,0.0006771062,0.0024756668,0.000023207807,0.005756995,0.00014411577,0.99023646],"study_design_scores_gemma":[0.00018190185,0.00005143241,0.00059353583,0.00046542461,0.0000030209437,0.000028841241,3.616452e-7,0.97265404,0.00006762282,0.013422031,0.012118812,0.0004129429],"about_ca_topic_score_codex":0.00011415836,"about_ca_topic_score_gemma":0.0004980564,"teacher_disagreement_score":0.9898235,"about_ca_system_score_codex":0.00017427973,"about_ca_system_score_gemma":0.0007124778,"threshold_uncertainty_score":0.9999568},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068517445,0.001070734,0.99668515,0.00030202523,0.00059081434,0.0002026216,0.00003804351,0.00016827353,0.0008738255],"genre_scores_gemma":[0.011697286,0.0009515758,0.97092396,0.0005379643,0.00083354424,0.00008700953,0.00027897276,0.00009009258,0.014599595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735993,0.000053924407,0.0003399825,0.0013818069,0.00036426578,0.000500117],"domain_scores_gemma":[0.9980144,0.0008814388,0.00012765879,0.0008236824,0.00005174899,0.0001010652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009247768,0.0003143946,0.0003571639,0.0008108452,0.00021544879,0.00070763077,0.0019422111,0.000101557496,0.0000017225843],"category_scores_gemma":[0.00017778033,0.00028842728,0.000036929207,0.0017345825,0.00039848278,0.0010233358,0.003079719,0.0008117182,0.00003912171],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001072509,0.000041407562,0.0005310568,0.000056560344,0.0000036663682,0.00005269102,0.0006771062,0.0024756668,0.000023207807,0.005756995,0.00014411577,0.99023646],"study_design_scores_gemma":[0.00018190185,0.00005143241,0.00059353583,0.00046542461,0.0000030209437,0.000028841241,3.616452e-7,0.97265404,0.00006762282,0.013422031,0.012118812,0.0004129429],"about_ca_topic_score_codex":0.00011415836,"about_ca_topic_score_gemma":0.0004980564,"teacher_disagreement_score":0.9898235,"about_ca_system_score_codex":0.00017427973,"about_ca_system_score_gemma":0.0007124778,"threshold_uncertainty_score":0.9999568},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068517445,0.001070734,0.99668515,0.00030202523,0.00059081434,0.0002026216,0.00003804351,0.00016827353,0.0008738255],"genre_scores_gemma":[0.011697286,0.0009515758,0.97092396,0.0005379643,0.00083354424,0.00008700953,0.00027897276,0.00009009258,0.014599595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735993,0.000053924407,0.0003399825,0.0013818069,0.00036426578,0.000500117],"domain_scores_gemma":[0.9980144,0.0008814388,0.00012765879,0.0008236824,0.00005174899,0.0001010652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009247768,0.0003143946,0.0003571639,0.0008108452,0.00021544879,0.00070763077,0.0019422111,0.000101557496,0.0000017225843],"category_scores_gemma":[0.00017778033,0.00028842728,0.000036929207,0.0017345825,0.00039848278,0.0010233358,0.003079719,0.0008117182,0.00003912171],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001072509,0.000041407562,0.0005310568,0.000056560344,0.0000036663682,0.00005269102,0.0006771062,0.0024756668,0.000023207807,0.005756995,0.00014411577,0.99023646],"study_design_scores_gemma":[0.00018190185,0.00005143241,0.00059353583,0.00046542461,0.0000030209437,0.000028841241,3.616452e-7,0.97265404,0.00006762282,0.013422031,0.012118812,0.0004129429],"about_ca_topic_score_codex":0.00011415836,"about_ca_topic_score_gemma":0.0004980564,"teacher_disagreement_score":0.9898235,"about_ca_system_score_codex":0.00017427973,"about_ca_system_score_gemma":0.0007124778,"threshold_uncertainty_score":0.9999568},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090329116,0.00015496195,0.99645925,0.0002579395,0.0014116925,0.00026159445,0.000013302912,0.00014376557,0.0003941958],"genre_scores_gemma":[0.9817159,0.0007353628,0.012495174,0.001436254,0.0010614009,0.00006660128,0.0011623374,0.00008173608,0.0012451964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986502,0.000018426972,0.00031025824,0.00046187273,0.00033708703,0.00022214768],"domain_scores_gemma":[0.9990708,0.000016434187,0.00024593677,0.00036411884,0.00024507436,0.000057613935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002141747,0.00021501853,0.00015111444,0.00035309495,0.00012928515,0.00011463186,0.0003477808,0.00030934543,0.00001958435],"category_scores_gemma":[0.000066322165,0.0002113459,0.000047550016,0.00032422948,0.00013457444,0.000033603912,0.00016547217,0.00015722125,0.000037554364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007253086,0.000019562529,0.00039893246,0.00012167312,0.000030143327,0.0000025541165,0.0004897099,0.28942755,0.12002699,0.0010248784,0.0008860281,0.58749944],"study_design_scores_gemma":[0.0004351877,0.00013092901,0.0023347242,0.0003186841,0.000016702026,0.000008484878,8.855456e-7,0.9245443,0.059359185,0.002059043,0.010149,0.0006429229],"about_ca_topic_score_codex":0.000018818713,"about_ca_topic_score_gemma":0.00007159515,"teacher_disagreement_score":0.9839641,"about_ca_system_score_codex":0.0001049441,"about_ca_system_score_gemma":0.00031910985,"threshold_uncertainty_score":0.8618436},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028601648,0.00038653152,0.9923408,0.0013356637,0.0017010197,0.0003046065,0.0000024400501,0.0007023911,0.0031979342],"genre_scores_gemma":[0.16093746,0.0042216424,0.82248765,0.0046597524,0.0010153549,0.00013990686,0.00012060557,0.0001083941,0.006309245],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973144,0.000027714354,0.00054458977,0.0007289505,0.00086526724,0.00051911187],"domain_scores_gemma":[0.99807113,0.0003943428,0.00028439425,0.001059126,0.00013294037,0.00005803732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084053294,0.00028995692,0.0003169416,0.0019287794,0.00011707083,0.0006179182,0.00362444,0.00030123064,0.0000041706753],"category_scores_gemma":[0.00037927032,0.00026711528,0.0000567943,0.0032574306,0.0004240106,0.0038951002,0.0011931716,0.0006715202,0.00020552296],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033309104,0.0000103197,0.00009167994,0.000037717804,9.225093e-7,0.000011655057,0.00045356626,0.0071284403,0.000010975355,0.014438877,0.00016251334,0.97765],"study_design_scores_gemma":[0.00039152827,0.0001386987,0.0009093247,0.0003928367,0.0000018923287,0.000012360451,0.0000013221074,0.33980167,0.0012870021,0.6325015,0.02386153,0.0007003275],"about_ca_topic_score_codex":0.000004471214,"about_ca_topic_score_gemma":0.000043669945,"teacher_disagreement_score":0.9769497,"about_ca_system_score_codex":0.00055489683,"about_ca_system_score_gemma":0.00079187524,"threshold_uncertainty_score":0.9999781},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010355655,0.0002757043,0.9951253,0.0023211872,0.0009895358,0.00043984363,0.00000840305,0.00026099195,0.00047549402],"genre_scores_gemma":[0.8083383,0.00020235126,0.18557175,0.0026886847,0.0011501486,0.00006227673,0.000050155977,0.00011190855,0.0018244454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695206,0.000037300604,0.00030110072,0.0013232231,0.0006961905,0.0006901107],"domain_scores_gemma":[0.99781203,0.0006826538,0.00020825461,0.00073468126,0.00037671308,0.00018564679],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057407,0.00044285486,0.00040080564,0.0005857195,0.00044356397,0.00069781387,0.001453764,0.00030110884,0.000004628008],"category_scores_gemma":[0.00008016922,0.00037396635,0.00005548631,0.0010040057,0.00078118587,0.00082371687,0.0007035322,0.0009030298,0.00001967077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017557075,0.000018233297,0.0001839393,0.000019519868,0.000021565189,0.0003098961,0.0008703503,0.46847674,0.000036648882,0.12969664,0.000064608466,0.4002843],"study_design_scores_gemma":[0.00011391992,0.0002164512,0.0004164951,0.00019675144,0.000008871008,0.00009474391,9.4285457e-7,0.9611377,0.00033114542,0.03675369,0.0002662727,0.00046302498],"about_ca_topic_score_codex":0.00003341132,"about_ca_topic_score_gemma":0.00048257996,"teacher_disagreement_score":0.80955356,"about_ca_system_score_codex":0.00020502153,"about_ca_system_score_gemma":0.0002227523,"threshold_uncertainty_score":0.99987125},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0880011,0.0005733813,0.90521204,0.003092247,0.0017618154,0.0006058479,0.0000081101225,0.00019110847,0.00055435946],"genre_scores_gemma":[0.43051794,0.00078573346,0.5235237,0.02317475,0.00578415,0.00006491203,0.00025131018,0.00028255407,0.01561498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984866,0.000018937275,0.00026888936,0.0005621478,0.00041626993,0.0002471587],"domain_scores_gemma":[0.9993143,0.00020584042,0.00008634941,0.00019705847,0.000046287445,0.00015017204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053782563,0.00018579893,0.0003170784,0.00036580605,0.00011863226,0.00010916255,0.000117996846,0.000096568154,0.000004679155],"category_scores_gemma":[0.00028044562,0.00015455167,0.000028254295,0.00026966314,0.00044885752,0.0000971905,0.00017335759,0.0006732354,0.0000048163365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028764882,0.00003089007,0.12640482,0.00058233313,0.000022869322,0.00024981232,0.0011709438,0.00277496,0.000678633,0.00007756122,0.0004567735,0.86752164],"study_design_scores_gemma":[0.0015946053,0.00047772517,0.116377234,0.0015130399,0.000066025714,0.00059953466,0.0000013792527,0.86885846,0.00011594992,0.008717683,0.0013378141,0.00034058056],"about_ca_topic_score_codex":0.000025541847,"about_ca_topic_score_gemma":0.000011322007,"teacher_disagreement_score":0.86718106,"about_ca_system_score_codex":0.00015789465,"about_ca_system_score_gemma":0.00021351149,"threshold_uncertainty_score":0.6302434},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008552449,0.0007309643,0.9862674,0.002442743,0.0005205157,0.0005492871,0.0000014771632,0.0006121436,0.0003230407],"genre_scores_gemma":[0.3161074,0.001105363,0.67499286,0.0060107135,0.0008204556,0.00007725386,0.00007279574,0.00016998094,0.0006431731],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809176,0.000028897104,0.00033968396,0.00069395005,0.0004938291,0.00035189933],"domain_scores_gemma":[0.9991132,0.00029198587,0.00015927269,0.00022344809,0.00008801194,0.00012408286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005529054,0.0002754457,0.00041796223,0.0006826764,0.00012687643,0.00006861202,0.00020389128,0.00018811168,0.0000218474],"category_scores_gemma":[0.00021671037,0.00024551916,0.000042989534,0.00041144557,0.00038024623,0.00009585481,0.00014472542,0.0011437823,0.00000443334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025774627,0.00001606742,0.0077594197,0.00015857948,0.0000059367094,0.00015723358,0.00032490047,0.042991135,0.003791117,0.000027006548,0.0000062303006,0.9447366],"study_design_scores_gemma":[0.00058038573,0.00017993516,0.004617302,0.0023896438,0.000013858996,0.000028185179,4.3568858e-7,0.98785746,0.0016982259,0.0018195806,0.00054962886,0.0002653706],"about_ca_topic_score_codex":0.0001994934,"about_ca_topic_score_gemma":0.00018734358,"teacher_disagreement_score":0.9448663,"about_ca_system_score_codex":0.00028483197,"about_ca_system_score_gemma":0.00021100097,"threshold_uncertainty_score":0.9999997},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9858536,0.0005205072,0.008682303,0.004331812,0.00032600795,0.00024886426,0.0000013845244,0.000029653322,0.00000583278],"genre_scores_gemma":[0.9915686,0.000103615545,0.0074791764,0.000786628,0.000043467957,0.0000061001206,0.0000017168777,0.0000060768702,0.0000045890542],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989811,0.000048398142,0.00023353825,0.00026446566,0.00029400378,0.0001784857],"domain_scores_gemma":[0.9995281,0.00016320418,0.000065667286,0.00016799197,0.000018641897,0.000056372162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065023825,0.00008700967,0.00018858036,0.00017479877,0.000080226826,0.000022827087,0.00011539966,0.000008368008,0.0000072925045],"category_scores_gemma":[0.0002747719,0.000058888763,0.000021685086,0.00071088836,0.0002377641,0.000082808794,0.00019617447,0.00021782897,0.0000013578192],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008678758,0.000043296786,0.8237127,0.0004700528,0.000005043343,0.000095924086,0.0015226939,0.002272238,0.0041796877,0.000018876612,0.000018502215,0.16765228],"study_design_scores_gemma":[0.00045724146,0.00005795034,0.4472579,0.0002943044,0.0000047883736,0.00018294343,0.0000029834725,0.5511243,0.00031245383,0.0002570389,0.000012806841,0.000035338908],"about_ca_topic_score_codex":0.00006332104,"about_ca_topic_score_gemma":0.000049874758,"teacher_disagreement_score":0.548852,"about_ca_system_score_codex":0.00008272983,"about_ca_system_score_gemma":0.000045359797,"threshold_uncertainty_score":0.2401414},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54311186,0.0013530074,0.4514171,0.0024188492,0.0006206257,0.00075022207,0.00010274656,0.00018143353,0.000044202836],"genre_scores_gemma":[0.8284417,0.00012967057,0.16983151,0.00096358755,0.0003919678,0.000019361267,0.00007687212,0.00004257053,0.00010278871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998531,0.000016539305,0.00026425594,0.0005444664,0.00036803377,0.0002757353],"domain_scores_gemma":[0.9988276,0.00060140045,0.00018209382,0.00015126672,0.00012083795,0.00011683881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025808837,0.00023059404,0.00042640825,0.00014694325,0.00012033595,0.000063875625,0.00013534035,0.000028904551,0.00000554577],"category_scores_gemma":[0.00009490159,0.00017780378,0.000033684297,0.00014397527,0.0009702202,0.00008841762,0.000114088514,0.00027772205,3.4469173e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063032977,0.00007749015,0.23944639,0.0011498278,0.00027602797,0.0011484702,0.0010140543,0.47231933,0.0026897937,0.0005397425,0.00020331501,0.28050524],"study_design_scores_gemma":[0.0015510828,0.00012797772,0.06363514,0.0014856444,0.00006170523,0.00026370556,9.1424454e-7,0.9310614,0.00011489954,0.0014934893,0.000023088543,0.00018099489],"about_ca_topic_score_codex":0.0004770328,"about_ca_topic_score_gemma":0.000058035508,"teacher_disagreement_score":0.45874202,"about_ca_system_score_codex":0.00008356844,"about_ca_system_score_gemma":0.00021986607,"threshold_uncertainty_score":0.7250628},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09327521,0.002754927,0.8984742,0.002088834,0.0007725354,0.0014020524,0.0000101108,0.0008634749,0.000358622],"genre_scores_gemma":[0.7350256,0.0056120246,0.25580603,0.00084812817,0.0007606262,0.00010933197,0.00017793098,0.00018928004,0.0014710987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840677,0.000037813596,0.00029949215,0.0006579466,0.00030677073,0.00029123528],"domain_scores_gemma":[0.9992029,0.0003841565,0.00013824069,0.0000943608,0.0000658046,0.00011452894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008861487,0.00025233233,0.00041363953,0.0005189672,0.0002006894,0.00011747312,0.00008205625,0.000058026326,0.0000059730824],"category_scores_gemma":[0.0003300121,0.00022720115,0.000027423317,0.00019092763,0.00034808353,0.00011780393,0.00015834572,0.0009940478,3.775385e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059808506,0.000013499593,0.09128561,0.00044403627,0.00002452004,0.00017205946,0.00061594025,0.0104049295,0.0011846296,0.000102308404,0.00000464573,0.895688],"study_design_scores_gemma":[0.00084548874,0.0003299042,0.01033629,0.0012070953,0.000031473,0.00028713414,0.000002395539,0.98501676,0.000156394,0.0010439929,0.00054093724,0.0002021025],"about_ca_topic_score_codex":0.000248682,"about_ca_topic_score_gemma":0.00022080923,"teacher_disagreement_score":0.9746119,"about_ca_system_score_codex":0.00012733795,"about_ca_system_score_gemma":0.000081043705,"threshold_uncertainty_score":0.9264994},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4538906,0.001493164,0.53285986,0.0056107813,0.0027691205,0.0022902621,0.00006525633,0.00034281696,0.00067814684],"genre_scores_gemma":[0.68420684,0.00061127095,0.31208012,0.0015048854,0.0006366896,0.00006886098,0.0001187707,0.00012227216,0.00065027084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982747,0.000027812182,0.00035547052,0.0006661911,0.0003811914,0.0002946474],"domain_scores_gemma":[0.99877703,0.0006645316,0.00014073591,0.00022912593,0.000055462933,0.00013310603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010349775,0.00024865032,0.00044977257,0.00046621737,0.00013775408,0.00015559456,0.0001610197,0.00003405192,0.0000040025507],"category_scores_gemma":[0.00062404096,0.00022203063,0.00002808765,0.00017807765,0.00054105173,0.00015348564,0.00023883897,0.0005823801,7.2275316e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049984632,0.000039750023,0.03298215,0.0012391803,0.0000311461,0.00048812007,0.0013654109,0.0014058219,0.00036785923,0.0007378933,0.0001381995,0.96115446],"study_design_scores_gemma":[0.0020635175,0.0004173329,0.03913657,0.0024329142,0.000038966875,0.00068858196,0.0000041861717,0.9358759,0.000053585198,0.018963676,0.00008356473,0.00024120267],"about_ca_topic_score_codex":0.00007025377,"about_ca_topic_score_gemma":0.000053112013,"teacher_disagreement_score":0.9609133,"about_ca_system_score_codex":0.00008489635,"about_ca_system_score_gemma":0.0001346117,"threshold_uncertainty_score":0.9054147},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1385784,0.00039983305,0.8580869,0.0011720668,0.00070864946,0.000588136,0.0000070162437,0.00013605255,0.0003229585],"genre_scores_gemma":[0.6976422,0.00019781875,0.29708925,0.0029581855,0.001378483,0.000017277242,0.00006789767,0.000110177716,0.00053872366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983087,0.000018439678,0.00020504599,0.00065108837,0.00050587306,0.00031086194],"domain_scores_gemma":[0.99920106,0.00023563043,0.0001243552,0.00021463844,0.000071818846,0.00015251883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035608513,0.00025724331,0.0003511429,0.00017029379,0.00016854376,0.00011722154,0.00011265603,0.00007677512,0.0000027208564],"category_scores_gemma":[0.00005963741,0.0001821242,0.000015907626,0.00024845838,0.000670177,0.0001394678,0.000104015046,0.00069171505,8.283353e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041115118,0.00002682006,0.24868791,0.000292048,0.000055244032,0.00049807393,0.0009130008,0.2050523,0.00013961719,0.00027587588,0.00004703231,0.5436009],"study_design_scores_gemma":[0.00182766,0.00084487145,0.056480438,0.0015156806,0.000044976267,0.00040412077,0.0000013211032,0.9375107,0.000016772237,0.0006475373,0.00044714348,0.00025873256],"about_ca_topic_score_codex":0.00006590783,"about_ca_topic_score_gemma":0.00027170766,"teacher_disagreement_score":0.7324585,"about_ca_system_score_codex":0.00006715291,"about_ca_system_score_gemma":0.00012571401,"threshold_uncertainty_score":0.7426809},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021343127,0.00016542296,0.97762775,0.00008918258,0.000051450912,0.00020863727,0.000003248312,0.000006840768,0.00050433684],"genre_scores_gemma":[0.9729903,0.0000531992,0.025993098,0.00053437654,0.00013108898,0.000008830142,0.00006191923,0.000015112236,0.00021212957],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989918,0.000010944316,0.00018174958,0.00043540902,0.00022970689,0.0001503843],"domain_scores_gemma":[0.9991493,0.000025954841,0.00015374788,0.000399804,0.00021766456,0.00005352093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020052008,0.00016605092,0.00017262567,0.00018126963,0.000050314873,0.000027154296,0.0002911268,0.00014708184,0.000009859515],"category_scores_gemma":[0.00003226533,0.00012228996,0.000041599156,0.00018320698,0.00022900772,0.0000129732,0.00016379917,0.00009074696,0.000013130099],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016638254,0.00005282358,0.0006814964,0.000114580886,0.000057872232,0.000004323201,0.0004570725,0.22001602,0.36848995,0.010583501,0.000024671994,0.39935133],"study_design_scores_gemma":[0.0005205658,0.0024853826,0.00056203216,0.00075881655,0.00009345877,0.000031351807,0.0000036469944,0.3017535,0.62233514,0.062700845,0.00737741,0.001377879],"about_ca_topic_score_codex":0.00003169154,"about_ca_topic_score_gemma":0.000048978964,"teacher_disagreement_score":0.9516471,"about_ca_system_score_codex":0.000016621369,"about_ca_system_score_gemma":0.00008450826,"threshold_uncertainty_score":0.498684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41134515,0.000045762725,0.5880778,0.000015550428,0.00029224632,0.00018558666,3.638224e-7,0.00003683611,7.367535e-7],"genre_scores_gemma":[0.68212223,0.0000032810374,0.3177334,0.00010001761,0.000026362195,0.000003238724,0.0000015202892,0.000009799803,1.6601943e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887264,0.00006357403,0.000246432,0.00032091528,0.00021039307,0.00028604004],"domain_scores_gemma":[0.9995756,0.00009793638,0.00003267024,0.00019041487,0.000050031198,0.00005333229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030290495,0.00015214333,0.00015963674,0.0002458197,0.00008676194,0.00010228375,0.00020172432,0.000055559976,0.0000033485132],"category_scores_gemma":[0.000083259205,0.00014062876,0.000018492663,0.00085597794,0.00008842912,0.00010043273,0.000049372447,0.00015102704,0.0000036428937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.336232e-7,0.000029030154,0.0038390663,0.000026299107,0.000001194118,0.0000015005085,0.0019761617,0.9362077,0.03302754,0.000007396869,8.069082e-8,0.024883168],"study_design_scores_gemma":[0.0004594686,0.000026845248,0.009646251,0.000118115066,0.0000020753478,0.0000016741388,0.000002021288,0.94096845,0.04862467,0.000014857778,0.000001288844,0.00013427049],"about_ca_topic_score_codex":0.000062098865,"about_ca_topic_score_gemma":0.0001595429,"teacher_disagreement_score":0.27077705,"about_ca_system_score_codex":0.0002277139,"about_ca_system_score_gemma":0.000041458214,"threshold_uncertainty_score":0.57346743},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013287178,0.00013694588,0.9880436,0.0015559063,0.0024322702,0.0008844127,9.017525e-7,0.00092587963,0.0060067917],"genre_scores_gemma":[0.36324877,0.00016581791,0.5993195,0.00377364,0.0027888035,0.00011088895,0.00007816938,0.00044621178,0.030068196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920106,0.000087734385,0.0009655756,0.0023908324,0.0028117918,0.0017334833],"domain_scores_gemma":[0.99533087,0.00068400294,0.00083132216,0.0022767654,0.00045143263,0.00042561605],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00162027,0.0010901091,0.00093892193,0.0023495196,0.00077892246,0.0012110254,0.0057797236,0.0006739221,0.000028237844],"category_scores_gemma":[0.000499665,0.0010215571,0.00031140854,0.0021929848,0.00079792115,0.00040791903,0.003896101,0.0025788338,0.0003945629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007393078,0.000014042945,0.000021718406,0.0000819732,0.000027061715,0.00010345385,0.0008159119,0.90009314,0.00005866151,0.02206216,0.000019762023,0.076694734],"study_design_scores_gemma":[0.0004198753,0.00029745468,0.000069666865,0.00041053558,0.000015118531,0.00007088158,5.830062e-7,0.9862104,0.00032459953,0.009909145,0.00121244,0.0010593124],"about_ca_topic_score_codex":0.000047061996,"about_ca_topic_score_gemma":0.00002325286,"teacher_disagreement_score":0.38872412,"about_ca_system_score_codex":0.0010655695,"about_ca_system_score_gemma":0.000986351,"threshold_uncertainty_score":0.99982584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003563872,0.0004237395,0.9945787,0.00052830094,0.0017008753,0.00044473985,0.00021260403,0.00007928332,0.0016753784],"genre_scores_gemma":[0.9449239,0.00030401335,0.029527122,0.00327888,0.0022815045,0.00004398442,0.00018299482,0.00022321222,0.019234408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973193,0.0000033295998,0.00079857395,0.001185327,0.00015842728,0.0005350866],"domain_scores_gemma":[0.9980821,0.0004092905,0.00053482933,0.0007288253,0.00012567498,0.00011927343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012083647,0.00038074006,0.00062876823,0.0008146422,0.00027579546,0.00027579704,0.00072223035,0.00031572714,0.00023093834],"category_scores_gemma":[0.00013622444,0.00041006965,0.00021917254,0.0003583164,0.00026060702,0.00026136762,0.00022355164,0.0004184779,0.0002476225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093770395,0.0000132754185,0.0011161539,0.00005456043,0.000014612301,0.0000064300702,0.0001881982,0.9463757,0.0000018499425,0.019341897,0.000116519055,0.032761384],"study_design_scores_gemma":[0.00026098662,0.00006738206,0.0004213778,0.000104247316,0.000007659966,0.0000020338105,2.3157202e-7,0.89536655,0.000031093503,0.0764748,0.02678446,0.00047920542],"about_ca_topic_score_codex":0.00008694438,"about_ca_topic_score_gemma":0.00022670334,"teacher_disagreement_score":0.9650516,"about_ca_system_score_codex":0.00022132484,"about_ca_system_score_gemma":0.00011709096,"threshold_uncertainty_score":0.99983513},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068517445,0.001070734,0.99668515,0.00030202523,0.00059081434,0.0002026216,0.00003804351,0.00016827353,0.0008738255],"genre_scores_gemma":[0.011697286,0.0009515758,0.97092396,0.0005379643,0.00083354424,0.00008700953,0.00027897276,0.00009009258,0.014599595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735993,0.000053924407,0.0003399825,0.0013818069,0.00036426578,0.000500117],"domain_scores_gemma":[0.9980144,0.0008814388,0.00012765879,0.0008236824,0.00005174899,0.0001010652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009247768,0.0003143946,0.0003571639,0.0008108452,0.00021544879,0.00070763077,0.0019422111,0.000101557496,0.0000017225843],"category_scores_gemma":[0.00017778033,0.00028842728,0.000036929207,0.0017345825,0.00039848278,0.0010233358,0.003079719,0.0008117182,0.00003912171],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001072509,0.000041407562,0.0005310568,0.000056560344,0.0000036663682,0.00005269102,0.0006771062,0.0024756668,0.000023207807,0.005756995,0.00014411577,0.99023646],"study_design_scores_gemma":[0.00018190185,0.00005143241,0.00059353583,0.00046542461,0.0000030209437,0.000028841241,3.616452e-7,0.97265404,0.00006762282,0.013422031,0.012118812,0.0004129429],"about_ca_topic_score_codex":0.00011415836,"about_ca_topic_score_gemma":0.0004980564,"teacher_disagreement_score":0.9898235,"about_ca_system_score_codex":0.00017427973,"about_ca_system_score_gemma":0.0007124778,"threshold_uncertainty_score":0.9999568},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029014837,0.0008483136,0.9880033,0.0020432973,0.004369192,0.00083837414,0.00003491092,0.0004659045,0.0031065512],"genre_scores_gemma":[0.63783616,0.00094565976,0.31919992,0.017099379,0.0040860795,0.00045937626,0.00012828666,0.00041633463,0.019828815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555224,0.000052956675,0.0006321764,0.002033472,0.0005828569,0.0011462722],"domain_scores_gemma":[0.99669605,0.0013145978,0.00010984393,0.0013483226,0.0003377312,0.00019342499],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010162768,0.00074307906,0.0009188802,0.00091601297,0.00061488186,0.00027321477,0.0034873015,0.0005420518,0.000015860354],"category_scores_gemma":[0.00011393406,0.00068250817,0.00031810827,0.00078781554,0.0011329678,0.00040401856,0.0006095755,0.0007908065,0.000256276],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052626365,0.00008842691,0.00015517155,0.000253274,0.00012755927,0.00013287824,0.0054603457,0.016749805,0.00023037108,0.049189948,0.0013145261,0.9262451],"study_design_scores_gemma":[0.0021012614,0.00080120197,0.0010709041,0.0007024965,0.000050879986,0.00009721179,0.0000015443699,0.6352763,0.0030664746,0.31772655,0.036896285,0.0022088964],"about_ca_topic_score_codex":0.00001871108,"about_ca_topic_score_gemma":0.00012833097,"teacher_disagreement_score":0.92403615,"about_ca_system_score_codex":0.00016512435,"about_ca_system_score_gemma":0.0006945711,"threshold_uncertainty_score":0.9995626},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014650342,0.00009342267,0.99231505,0.000075033735,0.00057543087,0.00024173826,0.000011611843,0.0022376252,0.004435441],"genre_scores_gemma":[0.82647556,0.00057188165,0.1719172,0.00025775158,0.00015708111,0.000018345343,0.00003885002,0.00010029707,0.0004630675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893934,0.0000031537586,0.00021062257,0.00035860963,0.0002565799,0.00023168103],"domain_scores_gemma":[0.9996658,0.000047927806,0.000031381926,0.00017002861,0.00002682126,0.000058032165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024876258,0.00022961445,0.00020324449,0.0005156035,0.00006367776,0.00011693068,0.00025154316,0.0001645118,0.000005538603],"category_scores_gemma":[0.000017243186,0.00022761642,0.000039787326,0.00016453244,0.00024350514,0.00015842482,0.0000687411,0.00029613922,0.000012144472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.877265e-7,0.0000020416715,6.7210505e-7,0.00009471641,0.000007467067,0.000008044133,0.00013058295,0.048023965,0.00013182797,0.0024660898,0.00011162032,0.949022],"study_design_scores_gemma":[0.00008325713,0.000042816308,0.00008275233,0.00014056185,0.000013048187,0.000006974459,1.6486895e-7,0.9770718,0.00041284433,0.021772506,0.00013652875,0.00023669902],"about_ca_topic_score_codex":0.000010316416,"about_ca_topic_score_gemma":0.000018915733,"teacher_disagreement_score":0.9487853,"about_ca_system_score_codex":0.00008144547,"about_ca_system_score_gemma":0.000032350305,"threshold_uncertainty_score":0.9281928},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026779066,0.00015437901,0.98701805,0.0053758994,0.0015048397,0.0012565439,0.00002131134,0.0013871586,0.0032550152],"genre_scores_gemma":[0.04444487,0.0003526079,0.94068974,0.004394154,0.0009276902,0.0002845681,0.000073457326,0.00023003091,0.008602882],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99377155,0.00012004772,0.0008059946,0.002448355,0.0017753908,0.0010786807],"domain_scores_gemma":[0.9941364,0.00070494384,0.000663041,0.0038177192,0.0003963759,0.00028150532],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019699065,0.0007925854,0.0006982921,0.001061617,0.0006697348,0.0009352158,0.007372392,0.00046572587,0.000017772594],"category_scores_gemma":[0.00039108886,0.0005301938,0.00016704094,0.0020068637,0.0006329737,0.0007834108,0.0036956756,0.0015326659,0.0004392321],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021290185,0.000037802154,0.00009967433,0.000074261516,0.000012676112,0.00010972119,0.0014552163,0.003796098,0.0053655608,0.034008253,0.003096433,0.951923],"study_design_scores_gemma":[0.0010654185,0.00106196,0.0025170464,0.010008579,0.000029542703,0.00021560462,0.0000029598145,0.32271737,0.050087888,0.54741,0.060825437,0.0040581934],"about_ca_topic_score_codex":0.000017653072,"about_ca_topic_score_gemma":0.000038878152,"teacher_disagreement_score":0.94786483,"about_ca_system_score_codex":0.00047118776,"about_ca_system_score_gemma":0.0005229719,"threshold_uncertainty_score":0.999715},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053972984,0.0007491712,0.99434394,0.000447574,0.0007416874,0.00039345416,0.0001323066,0.000053578944,0.003084319],"genre_scores_gemma":[0.7877708,0.00046295367,0.19302534,0.0007286179,0.0009704935,0.0001650589,0.00006201191,0.0001677032,0.016646989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977724,0.000004678063,0.0006751577,0.0010267637,0.00011594827,0.00040503612],"domain_scores_gemma":[0.9988496,0.00016355062,0.00037019156,0.0004497615,0.0000906116,0.00007633163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006316314,0.00031872327,0.00068906473,0.000761239,0.00026352954,0.00022429354,0.00055582175,0.00020775823,0.00010060318],"category_scores_gemma":[0.000041655214,0.00032572917,0.00028462903,0.0003465886,0.00027203787,0.00023680017,0.00007136504,0.00023767997,0.00009823882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001210156,0.0000147769115,0.00002682218,0.00009320499,0.00007882621,0.0000052802707,0.0013171459,0.68573564,0.000018365672,0.17730159,0.00002147699,0.13537477],"study_design_scores_gemma":[0.00008336353,0.00004905749,0.000006404699,0.000048734793,0.000008603254,0.0000036165227,4.6829143e-7,0.6805673,0.000028813967,0.3181261,0.0008126909,0.00026483464],"about_ca_topic_score_codex":0.00014001774,"about_ca_topic_score_gemma":0.00098408,"teacher_disagreement_score":0.8013186,"about_ca_system_score_codex":0.00024825422,"about_ca_system_score_gemma":0.00009411802,"threshold_uncertainty_score":0.9999195},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068517445,0.001070734,0.99668515,0.00030202523,0.00059081434,0.0002026216,0.00003804351,0.00016827353,0.0008738255],"genre_scores_gemma":[0.011697286,0.0009515758,0.97092396,0.0005379643,0.00083354424,0.00008700953,0.00027897276,0.00009009258,0.014599595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735993,0.000053924407,0.0003399825,0.0013818069,0.00036426578,0.000500117],"domain_scores_gemma":[0.9980144,0.0008814388,0.00012765879,0.0008236824,0.00005174899,0.0001010652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009247768,0.0003143946,0.0003571639,0.0008108452,0.00021544879,0.00070763077,0.0019422111,0.000101557496,0.0000017225843],"category_scores_gemma":[0.00017778033,0.00028842728,0.000036929207,0.0017345825,0.00039848278,0.0010233358,0.003079719,0.0008117182,0.00003912171],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001072509,0.000041407562,0.0005310568,0.000056560344,0.0000036663682,0.00005269102,0.0006771062,0.0024756668,0.000023207807,0.005756995,0.00014411577,0.99023646],"study_design_scores_gemma":[0.00018190185,0.00005143241,0.00059353583,0.00046542461,0.0000030209437,0.000028841241,3.616452e-7,0.97265404,0.00006762282,0.013422031,0.012118812,0.0004129429],"about_ca_topic_score_codex":0.00011415836,"about_ca_topic_score_gemma":0.0004980564,"teacher_disagreement_score":0.9898235,"about_ca_system_score_codex":0.00017427973,"about_ca_system_score_gemma":0.0007124778,"threshold_uncertainty_score":0.9999568},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004078506,0.000053973334,0.9370717,0.059948176,0.0006422367,0.00036702724,0.00001529166,0.00086619455,0.000994656],"genre_scores_gemma":[0.0066454937,0.0001372464,0.9916813,0.001037667,0.00012551881,0.000013043141,0.00003508066,0.000049019214,0.00027562957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624413,0.000055492634,0.00037509756,0.0018780814,0.00081486657,0.0006323572],"domain_scores_gemma":[0.99492246,0.0009417931,0.00028788342,0.0034976664,0.00021228501,0.00013792858],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0010342296,0.00050249224,0.00046651313,0.00070309086,0.00035655213,0.0011024511,0.009883313,0.00044322698,0.000025417128],"category_scores_gemma":[0.0037684236,0.00041930057,0.000044301087,0.0009276184,0.0010798053,0.0011446645,0.03726865,0.0012791458,0.000040999046],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006001564,0.00006475988,0.00015561665,0.00014852102,0.00008503506,0.0007225914,0.0007427173,0.00032364563,0.00012838376,0.05459795,0.010387912,0.93258286],"study_design_scores_gemma":[0.00038019623,0.0002204502,0.000053824577,0.00032026344,0.000010033874,0.00027499543,9.1047934e-7,0.5597356,0.0003210805,0.43631238,0.001775289,0.00059497025],"about_ca_topic_score_codex":0.000017318145,"about_ca_topic_score_gemma":0.000099461715,"teacher_disagreement_score":0.9319879,"about_ca_system_score_codex":0.00024364461,"about_ca_system_score_gemma":0.00064606144,"threshold_uncertainty_score":0.9999345},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040804246,0.00012647797,0.99323463,0.00028408307,0.001328947,0.00042907035,0.000105368155,0.00035628193,0.00005468747],"genre_scores_gemma":[0.38301182,0.000037358663,0.61584085,0.0006464315,0.00024175408,0.000020606272,0.00011154602,0.000051793068,0.000037858954],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963716,0.00010590568,0.0006780483,0.0013203865,0.0010381804,0.00048587637],"domain_scores_gemma":[0.9970956,0.00077319104,0.00052522076,0.0012096651,0.0002746165,0.000121720164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010122522,0.00047527085,0.0005567288,0.0012013267,0.0002543751,0.00027462773,0.0022693507,0.00026184204,0.00006985275],"category_scores_gemma":[0.00005579092,0.0004705478,0.00023226724,0.0010993695,0.0003767495,0.00045472052,0.00077863404,0.0003793751,0.000019412802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004258461,0.000057651898,0.0002748057,0.0000889634,0.00006136739,0.000070889284,0.0027686,0.033394467,0.0065865978,0.26804698,0.000033205655,0.6885739],"study_design_scores_gemma":[0.0005713965,0.00024803926,0.000490868,0.00030665062,0.000021975842,0.0000033353833,0.000001033117,0.24710037,0.0138424225,0.7367848,0.00010911247,0.0005199768],"about_ca_topic_score_codex":0.00013918402,"about_ca_topic_score_gemma":0.00023794874,"teacher_disagreement_score":0.6880539,"about_ca_system_score_codex":0.00013214714,"about_ca_system_score_gemma":0.00048531237,"threshold_uncertainty_score":0.99977463},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005696497,0.00028483325,0.9833778,0.0067248815,0.003247649,0.00037736847,0.0000066459656,0.0034518745,0.0024719827],"genre_scores_gemma":[0.010250108,0.00017503885,0.9823971,0.0012093346,0.0007041357,0.000045166016,0.0000608627,0.000129058,0.0050292388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936826,0.0001301676,0.00065711595,0.0026789864,0.0014810343,0.0013700592],"domain_scores_gemma":[0.9890141,0.0012801666,0.00038841885,0.008881105,0.00026279624,0.0001734458],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0019444444,0.00069249887,0.00071595603,0.0016589116,0.00063103694,0.0016469125,0.060322106,0.0007033639,0.000016540682],"category_scores_gemma":[0.016321521,0.00067079905,0.0001376969,0.0043044933,0.00095532014,0.0010974915,0.14007555,0.0027163732,0.0004758805],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004146962,0.000031160307,0.00018483488,0.00007176969,0.000023204486,0.00045966866,0.00016075834,0.018180769,0.00007929114,0.0006871192,0.030860791,0.9492565],"study_design_scores_gemma":[0.00014925821,0.00009671956,0.00007763236,0.0002882998,0.0000035115756,0.00003934191,1.3247042e-7,0.6450007,0.0005133597,0.34976146,0.0034987084,0.0005709133],"about_ca_topic_score_codex":0.000025212374,"about_ca_topic_score_gemma":0.00008267186,"teacher_disagreement_score":0.9486856,"about_ca_system_score_codex":0.0008546818,"about_ca_system_score_gemma":0.0017189524,"threshold_uncertainty_score":0.9995844},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014200924,0.00039158395,0.99631745,0.0006425515,0.0011288541,0.000904209,0.000007081398,0.00032270094,0.00027134936],"genre_scores_gemma":[0.007447601,0.00006534301,0.9896384,0.00032508932,0.001382234,0.00010662405,0.000016905708,0.00005552496,0.00096230424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678564,0.00001986669,0.00041264234,0.001380228,0.0006405579,0.0007610675],"domain_scores_gemma":[0.9978156,0.0005069935,0.00013297927,0.0010504439,0.0003220557,0.00017191589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068312144,0.00036882216,0.00033817897,0.00047090737,0.00046032353,0.00031532397,0.0026124048,0.00027369655,0.0000059429562],"category_scores_gemma":[0.00003079374,0.00035901298,0.00014999264,0.00085904193,0.00046042612,0.0002480169,0.00081647147,0.00061714154,0.00004359783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001916325,0.000020324635,0.000007355496,0.00002555633,0.000007684505,0.000010895881,0.00018457085,0.28541014,0.000012381847,0.019742908,0.000027335123,0.6945489],"study_design_scores_gemma":[0.00014632125,0.0001344109,0.0001738847,0.000109278946,0.000006168044,0.000014490544,1.5232939e-7,0.94381493,0.000028728375,0.05287381,0.0023078667,0.00038995693],"about_ca_topic_score_codex":0.000014512957,"about_ca_topic_score_gemma":0.000041885865,"teacher_disagreement_score":0.694159,"about_ca_system_score_codex":0.0001812429,"about_ca_system_score_gemma":0.0005260726,"threshold_uncertainty_score":0.99988616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009580288,0.000047621437,0.985752,0.0005183551,0.0007235903,0.00046567724,0.000007857153,0.00042294402,0.011966143],"genre_scores_gemma":[0.017663082,0.000005943646,0.98030376,0.0007535575,0.000516765,0.000030730436,0.00001023495,0.000038809965,0.00067713263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962468,0.000026583128,0.00046451096,0.0017705043,0.0008022056,0.000689363],"domain_scores_gemma":[0.99749935,0.00036063313,0.00019557022,0.0014021238,0.00024722583,0.00029509852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008370516,0.0004015408,0.00037978883,0.0006893595,0.000485051,0.00058015686,0.0030076518,0.00020182646,0.0000033615177],"category_scores_gemma":[0.00008876488,0.0004018765,0.00008138093,0.0012056357,0.00035108207,0.00063933514,0.0015574573,0.00062903337,0.00010156592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014269142,0.000042024225,0.000029702054,0.000026862715,0.000007558895,0.00002306504,0.0012026271,0.07679608,0.00028630553,0.24866953,0.00004272751,0.67287207],"study_design_scores_gemma":[0.00011683918,0.00009884441,0.00008342915,0.00015788732,0.0000041411117,0.000119219345,0.0000017021649,0.8270217,0.00026188424,0.17058031,0.000941275,0.0006127361],"about_ca_topic_score_codex":0.000027981863,"about_ca_topic_score_gemma":0.000024823652,"teacher_disagreement_score":0.75022566,"about_ca_system_score_codex":0.00020587324,"about_ca_system_score_gemma":0.00048739905,"threshold_uncertainty_score":0.9998433},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012280897,0.0039248634,0.5176848,0.026720922,0.008189876,0.0018650589,0.00009199113,0.00050340267,0.439791],"genre_scores_gemma":[0.90166473,0.0064541744,0.07019731,0.003954951,0.004918401,0.000061966224,0.000042633863,0.00011629422,0.012589514],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802005,0.00014910888,0.00024763984,0.00049658655,0.0007471825,0.00033944316],"domain_scores_gemma":[0.99590385,0.0032299357,0.00019450243,0.00026087838,0.00033075185,0.000080064165],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021179812,0.00016039668,0.00028626333,0.0002978543,0.00064390956,0.00015410729,0.0005431552,0.00018445656,0.000014678193],"category_scores_gemma":[0.0029737065,0.0001624231,0.0000516898,0.0009403698,0.0030488835,0.00037240557,0.00045797293,0.00039329822,0.000013261745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002922102,0.00015320028,0.00036233923,0.0002369582,0.00008685311,0.000067709785,0.43071732,0.00077938667,0.000012308944,0.1273165,0.0023860119,0.4378522],"study_design_scores_gemma":[0.00026357116,0.000121270336,0.00036793842,0.00052458333,0.00006221386,0.000012474773,0.00031170822,0.0016896717,0.000025536838,0.8594113,0.1365657,0.0006440325],"about_ca_topic_score_codex":0.0008669025,"about_ca_topic_score_gemma":0.010356199,"teacher_disagreement_score":0.9004367,"about_ca_system_score_codex":0.00021002698,"about_ca_system_score_gemma":0.0012241544,"threshold_uncertainty_score":0.99966425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009760021,0.00025910002,0.99229395,0.0015030152,0.0026636755,0.0015123906,0.00002409749,0.00084521883,0.000800948],"genre_scores_gemma":[0.2020678,0.0002001109,0.7951707,0.0006583777,0.0007159115,0.00052921794,0.000031544543,0.00012265457,0.0005036789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995544,0.000024987616,0.0007037588,0.0020062067,0.0006953902,0.0010256266],"domain_scores_gemma":[0.9964119,0.000608375,0.0003685765,0.0020732696,0.00033954548,0.0001983319],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010362994,0.0006025033,0.00073747436,0.00095236045,0.00052262563,0.0003710161,0.0051233657,0.0007410008,0.0000071598115],"category_scores_gemma":[0.00008553725,0.000573214,0.00025483206,0.001023864,0.00067059,0.00024697187,0.0014543746,0.00087320345,0.00014362745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001182853,0.000051536095,0.000015305699,0.00021703326,0.000029619945,0.00005224819,0.00052809785,0.0016225859,0.000109328335,0.43672854,0.00024795253,0.56038594],"study_design_scores_gemma":[0.000929688,0.0002039809,0.000049672,0.00056319666,0.000021536844,0.00007056302,5.1676e-7,0.67908716,0.0009425447,0.31122193,0.0059341597,0.0009750601],"about_ca_topic_score_codex":0.000018532395,"about_ca_topic_score_gemma":0.00007991955,"teacher_disagreement_score":0.67746454,"about_ca_system_score_codex":0.000450824,"about_ca_system_score_gemma":0.00070142053,"threshold_uncertainty_score":0.99967194},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013770268,0.0002560255,0.9824761,0.0019892973,0.00022260161,0.0005508233,0.000011848246,0.00023664688,0.00048639398],"genre_scores_gemma":[0.8541189,0.00007478856,0.14481042,0.00066648406,0.000048513724,0.00003650828,0.000004009621,0.000033539363,0.0002068789],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703693,0.00004620151,0.0004088868,0.0014650122,0.00042967557,0.0006132796],"domain_scores_gemma":[0.9976472,0.00091043464,0.00023871349,0.00092890154,0.00014944162,0.00012529497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008516355,0.00046215995,0.0005428292,0.0009152715,0.0002595611,0.00029929765,0.0017940857,0.00047154963,0.0000023946],"category_scores_gemma":[0.00010190321,0.00039419893,0.00004834482,0.0009492098,0.0013918257,0.00035608787,0.0009894916,0.0011092753,0.000013113328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029782384,0.00012673506,0.0013870744,0.0000910223,0.000052955897,0.00034438306,0.0068360115,0.004475417,0.0013369127,0.3553949,0.0000144773085,0.6299103],"study_design_scores_gemma":[0.0010445694,0.00034906124,0.011413293,0.0014205674,0.000012956299,0.00013538143,0.0000037208176,0.19338141,0.004973501,0.7856963,0.000240623,0.0013286019],"about_ca_topic_score_codex":0.000076293734,"about_ca_topic_score_gemma":0.00070963544,"teacher_disagreement_score":0.8403486,"about_ca_system_score_codex":0.00014378909,"about_ca_system_score_gemma":0.00030927267,"threshold_uncertainty_score":0.999851},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006263836,0.00018858112,0.9892224,0.00040345814,0.0026227771,0.00022082178,0.000007918766,0.00028403633,0.0069873836],"genre_scores_gemma":[0.135831,0.000117401694,0.8516567,0.00151757,0.0012398955,0.000016244081,0.000014546174,0.00013145655,0.009475189],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701947,0.000032012213,0.0004776704,0.0011532927,0.0007700888,0.0005474568],"domain_scores_gemma":[0.9974399,0.00053179235,0.00024090456,0.0014323997,0.00015605032,0.00019894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078987767,0.00039585505,0.00047910825,0.0011879831,0.0002170702,0.00025563993,0.0030056136,0.00026976975,0.000054396365],"category_scores_gemma":[0.000057100973,0.00037468402,0.0002509621,0.0016830944,0.00049480394,0.0004354005,0.000872993,0.0006155257,0.00009191591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012860322,0.00002349241,0.000020847909,0.000037037153,0.000028485734,0.000045106437,0.0006497491,0.013415415,0.0002859037,0.2777915,0.00034842276,0.7073412],"study_design_scores_gemma":[0.00036650614,0.00042261314,0.00009895024,0.0004645952,0.00002275497,0.000056339017,4.607378e-7,0.117876336,0.0014316424,0.87070054,0.007825976,0.0007332862],"about_ca_topic_score_codex":0.0000352237,"about_ca_topic_score_gemma":0.000068154295,"teacher_disagreement_score":0.70660794,"about_ca_system_score_codex":0.00008323553,"about_ca_system_score_gemma":0.00071250985,"threshold_uncertainty_score":0.99987054},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060280945,0.00009338676,0.98607785,0.00097350404,0.002309032,0.0002954603,0.000002768419,0.0004317895,0.009755948],"genre_scores_gemma":[0.24859767,0.0003274072,0.7224623,0.0063923667,0.0011601899,0.000038587914,0.00003843393,0.00018954853,0.02079351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595845,0.000029152316,0.0005159559,0.0014676128,0.0013814196,0.00064740086],"domain_scores_gemma":[0.99800736,0.00030967948,0.0002257539,0.0011173474,0.00012170911,0.00021813306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009396116,0.0004567187,0.0004305158,0.0008141215,0.00029529372,0.0003086969,0.002635172,0.00026195828,0.00004621298],"category_scores_gemma":[0.000044007185,0.0004238997,0.00015569336,0.0007121118,0.0003758976,0.00041602785,0.00069635385,0.00069916813,0.00029331737],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052506393,0.000030506724,0.000100720084,0.000033881806,0.000011695216,0.00028322218,0.0020689946,0.03988648,0.00025599726,0.07738536,0.00003756427,0.87990034],"study_design_scores_gemma":[0.0006233375,0.00023465682,0.0015578951,0.0006148998,0.000012316697,0.00006195335,8.4182557e-7,0.7803226,0.0005074575,0.19579262,0.018971512,0.0012999041],"about_ca_topic_score_codex":0.000017800674,"about_ca_topic_score_gemma":0.0000481456,"teacher_disagreement_score":0.8786004,"about_ca_system_score_codex":0.0002299539,"about_ca_system_score_gemma":0.0003477966,"threshold_uncertainty_score":0.9998213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00097061,0.0007622968,0.9865582,0.00014105452,0.0077987947,0.00028876265,0.000011776639,0.0009207677,0.0025477463],"genre_scores_gemma":[0.74564207,0.0037912354,0.22718929,0.0018986422,0.013141508,0.00006843915,0.00006759392,0.001109785,0.007091436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794906,0.000005093351,0.0003066116,0.00062365795,0.00054997153,0.0005655975],"domain_scores_gemma":[0.9989375,0.00025402135,0.000041151005,0.00057426904,0.000049493567,0.00014356358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033186874,0.0004069959,0.00037095134,0.0006027482,0.000092275164,0.00012629406,0.0009313166,0.0003158337,0.000027009837],"category_scores_gemma":[0.000068301226,0.00040243933,0.00010245436,0.00049248245,0.00029548674,0.00019249867,0.00024448207,0.00089764036,0.00019282012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013115622,0.0000027701483,0.000012402506,0.00011424249,0.00001109523,0.00013350362,0.0003846498,0.9764741,0.00028357067,0.0010333123,0.0002083524,0.02134067],"study_design_scores_gemma":[0.00013773983,0.000033634424,0.00010942189,0.0006665838,0.0000094967045,0.000055603097,2.1825066e-7,0.9835868,0.0016661589,0.0045826286,0.008454544,0.0006971978],"about_ca_topic_score_codex":0.000008669013,"about_ca_topic_score_gemma":0.00003529615,"teacher_disagreement_score":0.7593689,"about_ca_system_score_codex":0.0002223583,"about_ca_system_score_gemma":0.000094633244,"threshold_uncertainty_score":0.99984276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032439586,0.00025929927,0.9935559,0.00040311817,0.0037277292,0.0008105086,0.00000993741,0.000605894,0.00030320708],"genre_scores_gemma":[0.82237977,0.000006557646,0.17320374,0.0018812529,0.001984035,0.000041060677,0.000026812055,0.00010143736,0.00037530882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994043,0.00008281952,0.00087177765,0.002399504,0.0012826676,0.0013202444],"domain_scores_gemma":[0.99641615,0.0014115938,0.00052668556,0.0010191404,0.0003909994,0.00023545188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015880454,0.0009063117,0.0009157174,0.00114984,0.0005296621,0.00081317045,0.0032928758,0.00067761895,0.000025005902],"category_scores_gemma":[0.00014334465,0.0008035674,0.00061602634,0.0014677894,0.00041543867,0.0003155078,0.0005950206,0.0016468188,0.000039268496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017934195,0.000016435255,0.000001774777,0.000033863336,0.000034968074,0.000033876775,0.00025367533,0.7499107,0.000072654286,0.012834299,0.00006984075,0.23671998],"study_design_scores_gemma":[0.000608997,0.0002766093,0.000019687794,0.00042332138,0.000041790143,0.000018576939,2.0186124e-7,0.9889068,0.00041120723,0.006873056,0.0015233103,0.0008964623],"about_ca_topic_score_codex":0.000009516732,"about_ca_topic_score_gemma":0.0009688282,"teacher_disagreement_score":0.8220554,"about_ca_system_score_codex":0.0003381838,"about_ca_system_score_gemma":0.0004759176,"threshold_uncertainty_score":0.9994415},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003192696,0.0005756709,0.9866392,0.0005917293,0.0006571879,0.00035837255,0.000009741223,0.00035559837,0.010493252],"genre_scores_gemma":[0.9804111,0.00040399365,0.017766953,0.00019558864,0.00015530562,0.000025158679,0.00002809373,0.00007768397,0.0009360844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983675,0.000030225016,0.0004957672,0.0003882021,0.00035337603,0.00036495586],"domain_scores_gemma":[0.9979806,0.00023091232,0.00006531467,0.0015879247,0.00006627233,0.00006897544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044965433,0.00027941994,0.00033445662,0.00063383207,0.000108852764,0.00023021766,0.0022280728,0.00023623138,0.000021971024],"category_scores_gemma":[0.0000036407391,0.00027853058,0.0000683915,0.00034201698,0.00040180117,0.00015747303,0.0007890862,0.00072780636,0.00021037045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009919152,0.00006496528,0.0007023745,0.00030344952,0.000091601825,0.000096702286,0.0068068802,0.36732376,0.004040079,0.01111009,0.00009305943,0.6093571],"study_design_scores_gemma":[0.00065782655,0.0000568874,0.00048035025,0.0011759754,0.000015918145,0.000065237284,0.0000042443107,0.8368968,0.0030747787,0.13221212,0.024094645,0.0012652256],"about_ca_topic_score_codex":0.00010433727,"about_ca_topic_score_gemma":0.0019008773,"teacher_disagreement_score":0.98009187,"about_ca_system_score_codex":0.00024457613,"about_ca_system_score_gemma":0.00007976598,"threshold_uncertainty_score":0.9999667},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016499551,0.00077749224,0.9896083,0.0000638619,0.007703283,0.0008066921,0.00019536527,0.00017260994,0.0005074418],"genre_scores_gemma":[0.964789,0.00088008336,0.024318546,0.0006251575,0.00787854,0.00015694277,0.00028784148,0.00033867595,0.0007252127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977898,0.00001724849,0.00044620913,0.0008111733,0.00042363125,0.00051191833],"domain_scores_gemma":[0.9979245,0.00092416076,0.00007170033,0.00093798526,0.00005612659,0.00008553938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095952826,0.00032224754,0.00048674666,0.00056031905,0.00007641377,0.00019173384,0.0015986954,0.00048699314,0.000001957252],"category_scores_gemma":[0.00015612593,0.00030647367,0.000059925045,0.00032125163,0.00021278851,0.000396253,0.00032228974,0.00072331214,0.0000136008075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015447298,0.0000041967573,0.000009083889,0.00007290821,0.000009946703,0.000028039167,0.00010587834,0.9650096,0.00001191642,0.0010038421,0.00018027739,0.03354886],"study_design_scores_gemma":[0.0005148519,0.00004756481,0.0000034508626,0.0005633626,0.000008628896,0.000012213342,2.8027e-7,0.97760576,0.000017525505,0.01990442,0.0009793289,0.0003425831],"about_ca_topic_score_codex":0.000053111806,"about_ca_topic_score_gemma":0.00030336535,"teacher_disagreement_score":0.9652897,"about_ca_system_score_codex":0.00018616834,"about_ca_system_score_gemma":0.00021577188,"threshold_uncertainty_score":0.9999387},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032882697,0.00060312083,0.9666677,0.0027698262,0.0019650282,0.0014422259,0.000039694194,0.00019914922,0.023024946],"genre_scores_gemma":[0.97914857,0.00035921077,0.017042827,0.00052633765,0.0011290568,0.000073256044,0.000064555556,0.000030998744,0.0016251839],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978779,0.00003241147,0.00030328173,0.00083546777,0.00057462265,0.00037630115],"domain_scores_gemma":[0.99876744,0.0002877042,0.00016352312,0.00053342123,0.000119018645,0.00012889244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009695847,0.00021879487,0.000329628,0.0013636563,0.0003154159,0.0007142415,0.0010502621,0.00024445812,0.000025212286],"category_scores_gemma":[0.0007943352,0.00022246355,0.00008275646,0.0014628043,0.0007737365,0.0008215402,0.00079935027,0.00043815578,0.0000304611],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007742223,0.000052220978,0.0050012,0.00003287762,0.00003566841,0.0000124778935,0.0059064073,0.00048500075,0.0000036439183,0.017867118,0.00007776282,0.9705179],"study_design_scores_gemma":[0.00026109625,0.00008230743,0.004896909,0.0002944811,0.00009358342,0.0000058725545,0.00002422489,0.013323303,0.00002353318,0.9374723,0.04258637,0.0009360387],"about_ca_topic_score_codex":0.0014259388,"about_ca_topic_score_gemma":0.0061415224,"teacher_disagreement_score":0.9758603,"about_ca_system_score_codex":0.0003326694,"about_ca_system_score_gemma":0.000942985,"threshold_uncertainty_score":0.90718},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003718385,0.00015915938,0.991564,0.0014254081,0.0029753065,0.00047876575,0.000012155859,0.0026059926,0.0007420633],"genre_scores_gemma":[0.003890112,0.00018987544,0.99180716,0.0026006736,0.00063342147,0.000039070357,0.000008864894,0.00010076921,0.000730063],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950692,0.00004885348,0.00074430864,0.0019174278,0.0013251546,0.0008950422],"domain_scores_gemma":[0.9954617,0.0005542303,0.001336192,0.0020274979,0.00040164785,0.0002187037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012354072,0.0007113652,0.00065669196,0.0014498518,0.0003888858,0.0009148713,0.0046589277,0.00045852928,0.000024215597],"category_scores_gemma":[0.000714037,0.0006981343,0.00017424363,0.0012367031,0.0005333418,0.0014174769,0.0030176747,0.001402444,0.000242546],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005444656,0.000013402475,0.00001141661,0.00004949797,0.000011213439,0.00016271706,0.00030052065,0.0014286817,0.00030904554,0.0071846372,0.000028309647,0.9904951],"study_design_scores_gemma":[0.0005422105,0.0006865825,0.00048214337,0.0017530358,0.00003451445,0.0005959113,8.843648e-7,0.13039126,0.044334073,0.7449015,0.072490916,0.0037870225],"about_ca_topic_score_codex":0.000029530309,"about_ca_topic_score_gemma":0.000058850066,"teacher_disagreement_score":0.9867081,"about_ca_system_score_codex":0.00042994187,"about_ca_system_score_gemma":0.0006561948,"threshold_uncertainty_score":0.999547},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046413083,0.00023532612,0.99077135,0.0029184564,0.0038716693,0.0010325935,0.000014017675,0.00046508657,0.0006450879],"genre_scores_gemma":[0.36963698,0.000037707523,0.6159349,0.008099932,0.0033491957,0.00011576383,0.000030821393,0.00014057987,0.0026541047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99291635,0.00006598101,0.0010103708,0.0024806717,0.001725947,0.0018006882],"domain_scores_gemma":[0.9951185,0.0020278147,0.0005558598,0.0014705516,0.0003777067,0.00044955485],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021518404,0.000999333,0.0012647394,0.0018655843,0.00057082664,0.0011761361,0.0051614596,0.0006247831,0.00006748438],"category_scores_gemma":[0.00032585266,0.00089973153,0.00067405455,0.0022386648,0.00035696034,0.00034080568,0.0014429528,0.0010882239,0.00020427426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002773395,0.000037248985,0.000013633564,0.00006972883,0.00007176981,0.000043023036,0.0014605754,0.45098522,0.0000036790225,0.4085719,0.0007243545,0.13799113],"study_design_scores_gemma":[0.000460892,0.00038491908,0.000014945673,0.0011686407,0.000033649874,0.000008688706,7.859293e-7,0.9200206,0.0001375872,0.06748234,0.009185378,0.0011016106],"about_ca_topic_score_codex":0.00006460338,"about_ca_topic_score_gemma":0.00016402392,"teacher_disagreement_score":0.46903533,"about_ca_system_score_codex":0.0006446851,"about_ca_system_score_gemma":0.0010919315,"threshold_uncertainty_score":0.99986076},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030814936,0.00007398755,0.99409693,0.0005373024,0.0015597418,0.0009718869,0.000019513811,0.00023347976,0.002504078],"genre_scores_gemma":[0.0076307305,0.000018742341,0.9854786,0.0015297353,0.0010563124,0.00006570719,0.0000965156,0.000058861082,0.0040647984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964508,0.000020946649,0.0004975967,0.0016400462,0.00075352006,0.0006371351],"domain_scores_gemma":[0.9974185,0.00034106357,0.00031334735,0.0015800394,0.00021183539,0.00013521644],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013674648,0.0004899216,0.00046931583,0.00061363063,0.00024403186,0.0010453156,0.003952049,0.00022337004,0.000016500657],"category_scores_gemma":[0.00008657085,0.00044635,0.00013637773,0.00030707195,0.00025835817,0.0008105131,0.0015645261,0.00036719267,0.00008355722],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032252037,0.000020291902,0.0000023422324,0.00004268632,0.000010425706,0.0000075660437,0.00010119123,0.0028529656,0.00024042056,0.019984903,0.00012166071,0.9766123],"study_design_scores_gemma":[0.00029443443,0.00019367792,0.000006586304,0.00010744016,0.000011086234,0.0000089633395,4.3503338e-8,0.92444193,0.0008255822,0.068634495,0.004937103,0.0005386433],"about_ca_topic_score_codex":0.0000067322912,"about_ca_topic_score_gemma":0.000014770865,"teacher_disagreement_score":0.9760737,"about_ca_system_score_codex":0.00017546723,"about_ca_system_score_gemma":0.00019627267,"threshold_uncertainty_score":0.9999917},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000075556134,0.0019242067,0.98754543,0.0039234897,0.0029062463,0.00036226533,0.000011001174,0.0004236691,0.002828137],"genre_scores_gemma":[0.13566014,0.0047493055,0.82889146,0.01916517,0.0032150045,0.00006535512,0.00007056272,0.00039317732,0.0077898433],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958381,0.00003730204,0.00045735567,0.0016510384,0.001187875,0.00082833896],"domain_scores_gemma":[0.9974129,0.0003498483,0.00016136913,0.0016457618,0.00019519545,0.00023491202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008518779,0.00053671526,0.0005436813,0.0013107117,0.0003707602,0.00048243423,0.0039260266,0.00030471917,0.000020073177],"category_scores_gemma":[0.0000979307,0.00048078096,0.00025032897,0.0015498174,0.0010175309,0.00035373663,0.0013248093,0.0008613335,0.00006591225],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005658754,0.000067106725,0.00036647526,0.0003882433,0.00006123327,0.00087458827,0.0022430606,0.008834584,0.00019779276,0.100004315,0.00040801414,0.88654894],"study_design_scores_gemma":[0.0007580814,0.0005296375,0.0014419161,0.005069393,0.00006123604,0.00036392699,0.0000011628539,0.2580448,0.0025770161,0.7202864,0.007890635,0.002975758],"about_ca_topic_score_codex":0.00008099595,"about_ca_topic_score_gemma":0.00018311999,"teacher_disagreement_score":0.8835732,"about_ca_system_score_codex":0.00014189184,"about_ca_system_score_gemma":0.0005306132,"threshold_uncertainty_score":0.9997644},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014079892,0.00036215893,0.99707997,0.00006280009,0.0001334853,0.00044017512,0.0000025418801,0.000014922532,0.0004959317],"genre_scores_gemma":[0.27661234,0.0035276632,0.71082634,0.00052715087,0.0006694084,0.00009681762,0.00093153765,0.00016365982,0.0066451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908495,0.000006411533,0.00021884979,0.0003415252,0.00016735742,0.00018093002],"domain_scores_gemma":[0.999439,0.000043567215,0.00018751537,0.00018495075,0.000115968876,0.000028985318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026375154,0.00019191278,0.00014932708,0.00014496248,0.00014598988,0.0001205919,0.00019056065,0.00015126179,0.0000042491283],"category_scores_gemma":[0.000025307523,0.00015376901,0.00003342517,0.000080660655,0.00008481631,0.0000158049,0.00012158053,0.00011840298,0.0000013652768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008859313,0.000005586623,0.000015915894,0.000059043396,0.000014706365,2.5099942e-7,0.00032256494,0.8741549,0.00490822,0.00007283758,0.000015513524,0.120341845],"study_design_scores_gemma":[0.0012105895,0.0019459925,0.00002148845,0.00024789004,0.000014350259,0.00001433753,0.000005515525,0.9635104,0.027045134,0.0008237471,0.004607009,0.0005535418],"about_ca_topic_score_codex":0.0000056150907,"about_ca_topic_score_gemma":0.0000049750265,"teacher_disagreement_score":0.2862537,"about_ca_system_score_codex":0.00002513316,"about_ca_system_score_gemma":0.00008819368,"threshold_uncertainty_score":0.62705183},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000096432195,0.00011251638,0.99289674,0.00039376825,0.003079559,0.00061555713,0.0000069552357,0.00043176435,0.0023667153],"genre_scores_gemma":[0.663438,0.000036618574,0.32569292,0.0019091079,0.004066177,0.00007779899,0.000056673696,0.00018476405,0.0045378953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571055,0.00006585892,0.000629242,0.0017620658,0.001005028,0.000827233],"domain_scores_gemma":[0.99690706,0.00052890053,0.00050443213,0.0014015555,0.00041471244,0.00024336165],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010652075,0.0006029803,0.00065101904,0.00067067053,0.00054584147,0.0011668693,0.0028821412,0.00037066062,0.000012931633],"category_scores_gemma":[0.00016878975,0.00051438744,0.000116664705,0.001180456,0.0005289114,0.00053501496,0.0011410401,0.0009253089,0.000049997794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013071024,0.0002668048,0.00123715,0.00039065361,0.00041220448,0.0009722004,0.1430023,0.15283951,0.00062813266,0.16892983,0.00044609222,0.53074443],"study_design_scores_gemma":[0.00044163343,0.00020441927,0.00009827918,0.00041266336,0.000012666863,0.00004029227,0.000001091115,0.9778201,0.00018904635,0.019686824,0.00041520156,0.0006777984],"about_ca_topic_score_codex":0.00012035445,"about_ca_topic_score_gemma":0.00045390075,"teacher_disagreement_score":0.82498056,"about_ca_system_score_codex":0.00027297484,"about_ca_system_score_gemma":0.0007212743,"threshold_uncertainty_score":0.99987},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028040344,0.00041197185,0.99722594,0.00015883149,0.0007964456,0.00084518536,0.000033191758,0.0003054236,0.00019496297],"genre_scores_gemma":[0.46208468,0.00081441575,0.5228217,0.0012666835,0.005720792,0.000474844,0.00030190832,0.0005349091,0.005980063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979133,0.000014268783,0.00038069926,0.0007936879,0.00039378938,0.0005042617],"domain_scores_gemma":[0.99877864,0.000306429,0.00010344481,0.0005460593,0.00015808255,0.00010734927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045958397,0.0004488026,0.0005071797,0.00055839785,0.00015771024,0.00016321633,0.0005908915,0.00036467938,0.000018652532],"category_scores_gemma":[0.000028237504,0.00038982485,0.00020530891,0.0005364538,0.00019214077,0.00013843716,0.000051926057,0.00041361016,0.000059754948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009625308,0.000045827885,0.000015345335,0.0006756818,0.00023948278,0.00007621224,0.0012008437,0.05624219,0.07941151,0.0008279995,0.00058282143,0.8605858],"study_design_scores_gemma":[0.00022562343,0.00009194658,0.00001718311,0.0001924602,0.00004044125,0.000008685961,6.92443e-7,0.98145086,0.0075381594,0.009487267,0.00044332238,0.000503352],"about_ca_topic_score_codex":0.0000023749078,"about_ca_topic_score_gemma":0.000014015899,"teacher_disagreement_score":0.9252087,"about_ca_system_score_codex":0.0001441816,"about_ca_system_score_gemma":0.000082936385,"threshold_uncertainty_score":0.99985534},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066534796,0.00032150748,0.99259865,0.0005437033,0.0010799492,0.00078987156,0.0000014885645,0.00037732275,0.0036221414],"genre_scores_gemma":[0.8951306,0.00016480379,0.09886557,0.0015724216,0.00070742413,0.00015955417,0.000044183867,0.0002567211,0.0030987225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973614,0.000039329367,0.0005179925,0.00071651227,0.0005575466,0.0008071714],"domain_scores_gemma":[0.9978057,0.00032763623,0.00006720519,0.0014683175,0.00009808695,0.00023305522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090644084,0.00042851403,0.00043773622,0.00082441984,0.00022222746,0.00022449435,0.001889538,0.00026967624,0.000023491937],"category_scores_gemma":[0.00012804272,0.00046574394,0.00007731122,0.00090925384,0.0001360922,0.00018660029,0.0012789462,0.0018155593,0.00031472847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002339239,0.0000031274635,0.000028353208,0.000023048451,0.000011682817,0.000020438843,0.0007521763,0.8764704,0.00023761594,0.00029401007,0.000025267764,0.122131534],"study_design_scores_gemma":[0.00017144688,0.0000813315,0.00012162254,0.00040756454,0.0000063431626,0.000005269356,9.34703e-7,0.9912324,0.00021478717,0.0010618924,0.006188639,0.00050778466],"about_ca_topic_score_codex":0.00009240111,"about_ca_topic_score_gemma":0.0015184559,"teacher_disagreement_score":0.89446527,"about_ca_system_score_codex":0.0006447026,"about_ca_system_score_gemma":0.000100567246,"threshold_uncertainty_score":0.9997794},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044473057,0.00007898905,0.9924236,0.00047404502,0.0029538313,0.00042497288,4.2279044e-7,0.00058581185,0.0026135978],"genre_scores_gemma":[0.9128615,0.00014659367,0.08327641,0.0009107526,0.0010535924,0.000020215457,0.000015230326,0.00013979037,0.0015758695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928717,0.00014003224,0.0011612161,0.0024077254,0.0016491194,0.0017702151],"domain_scores_gemma":[0.99560356,0.001823363,0.0005298024,0.0015193573,0.0002292212,0.00029471715],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002011122,0.00085655914,0.0009361511,0.0013757019,0.00041132173,0.0007914175,0.003395591,0.0007259083,0.000013093592],"category_scores_gemma":[0.0002463274,0.00086287444,0.00020202741,0.0019800714,0.0006156957,0.0005613228,0.002637707,0.003043331,0.00007369113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009802859,0.000015766549,0.00012300098,0.000016375438,0.000009232355,0.0003855169,0.00037207492,0.86722,0.00002532433,0.02251386,0.0000059711433,0.1093031],"study_design_scores_gemma":[0.00039092283,0.00013401543,0.00013695254,0.0009368638,0.0000064753503,0.000052940817,7.955739e-7,0.9941545,0.00015202138,0.0029811722,0.00015402962,0.0008993141],"about_ca_topic_score_codex":0.00007681592,"about_ca_topic_score_gemma":0.00019130897,"teacher_disagreement_score":0.9124168,"about_ca_system_score_codex":0.00075726915,"about_ca_system_score_gemma":0.00038621854,"threshold_uncertainty_score":0.9993822},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006681158,0.0005921378,0.97769123,0.00050427066,0.011705822,0.00033220535,0.0000032506505,0.00066543586,0.008498983],"genre_scores_gemma":[0.17404151,0.0008221918,0.74268186,0.015378515,0.026325826,0.00010120636,0.000100155536,0.00041851128,0.040130243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946118,0.000072413204,0.00067549484,0.001964045,0.0013344664,0.0013417971],"domain_scores_gemma":[0.9962329,0.0010575292,0.00033269136,0.0018665743,0.00019385935,0.00031643666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014533662,0.00062217936,0.00070889556,0.00082161074,0.00039269737,0.0009825174,0.005178587,0.000510267,0.000009868443],"category_scores_gemma":[0.000021250566,0.00058513536,0.00017674408,0.0022717833,0.0006280991,0.0004846623,0.0026096145,0.0012783773,0.000213318],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026065968,0.000016724758,0.000021732154,0.00002821801,0.000009416186,0.0005524336,0.0003288827,0.018190674,0.0000028187499,0.0018086286,0.0024973277,0.97654057],"study_design_scores_gemma":[0.00015382378,0.00008923556,0.000018691342,0.00044388793,0.0000070354135,0.00008620245,8.030018e-8,0.8738557,0.000013166798,0.11883205,0.0058845943,0.00061549695],"about_ca_topic_score_codex":0.000013469923,"about_ca_topic_score_gemma":0.000048800553,"teacher_disagreement_score":0.975925,"about_ca_system_score_codex":0.00045352033,"about_ca_system_score_gemma":0.0020644462,"threshold_uncertainty_score":0.99966},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088106754,0.00005510248,0.99608916,0.0007336834,0.0006387149,0.0006830984,0.0000048857178,0.00028863773,0.00062562054],"genre_scores_gemma":[0.17484583,0.000031216106,0.8217568,0.0006711541,0.00066665135,0.00006288513,0.000010853118,0.00013634666,0.0018182873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963662,0.000032000546,0.00037137096,0.0017167837,0.0007567902,0.0007568379],"domain_scores_gemma":[0.99723893,0.0011227888,0.00033142522,0.0007497349,0.00039979306,0.00015731296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056129025,0.0005243581,0.0005218926,0.0008106804,0.0003827724,0.00044138575,0.0012128684,0.0003154494,0.0000011364847],"category_scores_gemma":[0.00007197675,0.0004600407,0.00006981216,0.00094124593,0.00048517526,0.00036868267,0.00080874347,0.00061335426,0.0000058668093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023195615,0.00001076924,0.000032882348,0.000048950107,0.00002122085,0.00003899096,0.0006021029,0.83723617,0.00013066299,0.005877701,0.000009408605,0.15596795],"study_design_scores_gemma":[0.00038620757,0.0003124323,0.00012809756,0.00054888433,0.000011196403,0.00005587572,5.2935985e-7,0.9813845,0.001377218,0.0150539875,0.00015679224,0.0005842658],"about_ca_topic_score_codex":0.00006877675,"about_ca_topic_score_gemma":0.00043301235,"teacher_disagreement_score":0.17433241,"about_ca_system_score_codex":0.0003220313,"about_ca_system_score_gemma":0.00028397967,"threshold_uncertainty_score":0.9997851},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043613763,0.0005355011,0.9959825,0.00004494999,0.0011781448,0.00069967087,0.000015756708,0.00023262968,0.0012672065],"genre_scores_gemma":[0.44954017,0.00077442627,0.54387957,0.0003247044,0.002273534,0.0008040594,0.00024257261,0.0003720031,0.0017889669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846923,0.0000074958857,0.00039029148,0.0004985105,0.00024119184,0.00039329825],"domain_scores_gemma":[0.9990774,0.00033798063,0.000065703454,0.00036215372,0.0001027956,0.000053968422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051382446,0.0002616899,0.00031746668,0.00041181053,0.00009441392,0.00017733102,0.00047245965,0.0002570989,0.0000041927187],"category_scores_gemma":[0.000047755275,0.00026155118,0.000053760996,0.00048984005,0.000085546715,0.00012502768,0.000106644344,0.00034549102,0.000009253461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011869653,0.0000020701077,0.000006474004,0.000083647865,0.000004361,0.0000020941186,0.00020272244,0.92436284,0.000009514898,0.0022657928,0.000027309123,0.07303197],"study_design_scores_gemma":[0.00013633235,0.000021237487,0.000025403227,0.00026387448,0.000004441721,0.0000027009426,8.103257e-7,0.99053496,0.000017089624,0.007948088,0.0007762785,0.00026875615],"about_ca_topic_score_codex":0.000048224585,"about_ca_topic_score_gemma":0.00012873014,"teacher_disagreement_score":0.45210296,"about_ca_system_score_codex":0.00024894634,"about_ca_system_score_gemma":0.00007263871,"threshold_uncertainty_score":0.99998367},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042588688,0.0000641207,0.9788274,0.0002528342,0.0010798414,0.0004529317,0.000005017132,0.00013559221,0.014923359],"genre_scores_gemma":[0.99816567,0.000009812378,0.0015507962,0.00016642896,0.00003087507,0.000003317862,0.000008841451,0.000012826769,0.000051427363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974215,0.000048140824,0.0006744665,0.00053654634,0.0009312122,0.00038811343],"domain_scores_gemma":[0.9983835,0.0003324555,0.00040090043,0.00069954444,0.0001256813,0.000057902103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011866037,0.00028006066,0.0003088275,0.00082892325,0.0002605744,0.00022902293,0.0019938224,0.00022302024,0.000011511663],"category_scores_gemma":[0.00006699107,0.00022001115,0.000091331596,0.0010069453,0.00041175177,0.0007670066,0.0005446648,0.0006265241,0.000016594362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027881479,0.000027609416,0.0010546573,0.000038466966,0.00001512578,0.000008533941,0.03989121,0.008030604,0.0001718596,0.9296605,0.0000079989895,0.021090647],"study_design_scores_gemma":[0.00018342133,0.000057124376,0.00095135055,0.00021500034,0.000003033076,0.0000023480522,0.000017970397,0.2430845,0.0008981667,0.75429267,0.000045785117,0.00024864622],"about_ca_topic_score_codex":0.00007718955,"about_ca_topic_score_gemma":0.00036457815,"teacher_disagreement_score":0.9939068,"about_ca_system_score_codex":0.00043290135,"about_ca_system_score_gemma":0.00019572666,"threshold_uncertainty_score":0.8971794},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013839428,0.000088797584,0.9935944,0.00036827778,0.003553896,0.0006030775,0.000007647337,0.0017188501,0.000051197927],"genre_scores_gemma":[0.0009844669,0.000022505701,0.99716365,0.0003263569,0.00053601526,0.0000942052,0.00003213397,0.000053484855,0.0007871585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968171,0.000030941923,0.0005229833,0.0012036194,0.00079509785,0.0006302712],"domain_scores_gemma":[0.9956836,0.0024057513,0.00029028353,0.001248394,0.00025458718,0.00011734723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021279096,0.0004066181,0.00041696223,0.00071172044,0.0001734711,0.00067688094,0.0028732507,0.0002881759,0.0000035930075],"category_scores_gemma":[0.00166963,0.00041466163,0.00013112836,0.0011069814,0.00010790745,0.0010039669,0.000898087,0.00049867755,0.00003092238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000081942235,0.00003757955,0.00009455175,0.00043401253,0.000027873113,0.000023087903,0.00042617333,0.12068488,0.000092601236,0.008646954,0.00082668883,0.8686974],"study_design_scores_gemma":[0.00032850687,0.0002609544,0.00045081592,0.00056431664,0.0000125055885,0.000016808635,5.976348e-8,0.8125156,0.00091450027,0.15834084,0.025504459,0.0010906282],"about_ca_topic_score_codex":0.00001470007,"about_ca_topic_score_gemma":0.000011853291,"teacher_disagreement_score":0.86760676,"about_ca_system_score_codex":0.0005587959,"about_ca_system_score_gemma":0.0006988592,"threshold_uncertainty_score":0.99983054},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064636447,0.00035625836,0.9961609,0.00013652816,0.0017946425,0.00041620995,0.0000030080803,0.00023974676,0.00024632813],"genre_scores_gemma":[0.37562653,0.00043712094,0.6186513,0.0005485845,0.0012163135,0.000043131688,0.000036078996,0.00021411615,0.0032268525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957187,0.00002951868,0.00065968145,0.0013794116,0.0015715464,0.0006410981],"domain_scores_gemma":[0.9972133,0.0008915255,0.00029310648,0.0010484484,0.00031149446,0.00024214789],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010419845,0.00044275544,0.00048342568,0.001327107,0.00016961819,0.00038529452,0.001861999,0.00023554692,0.000016764765],"category_scores_gemma":[0.00075321336,0.0004460847,0.000071945986,0.0010716881,0.00039582152,0.0009374445,0.0018298398,0.00046065383,0.000028837874],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018140296,0.000025570787,0.0014782869,0.00022892555,0.000040275136,0.000116963834,0.0006577838,0.026579564,0.0031812936,0.003565888,0.000100656114,0.96400666],"study_design_scores_gemma":[0.0024083564,0.0012994881,0.013226901,0.004753939,0.000044003395,0.00017487993,6.2424743e-7,0.8779107,0.014901495,0.08237161,0.00056228065,0.002345739],"about_ca_topic_score_codex":0.000037140933,"about_ca_topic_score_gemma":0.00003408772,"teacher_disagreement_score":0.9616609,"about_ca_system_score_codex":0.00027954482,"about_ca_system_score_gemma":0.0009911478,"threshold_uncertainty_score":0.9997991},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012087773,0.0009092249,0.99503833,0.00012650751,0.0017564152,0.00068004534,0.000014119218,0.0002104446,0.000056142613],"genre_scores_gemma":[0.6632785,0.000011996093,0.33588785,0.00020465924,0.00032540635,0.00002046928,0.000007050254,0.000067122586,0.0001969379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963767,0.000034267,0.0005468102,0.0010401629,0.0012603465,0.0007417244],"domain_scores_gemma":[0.99509746,0.0027469012,0.00024716582,0.0015102347,0.0003090619,0.000089162255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017172883,0.0003941875,0.0004997002,0.0007223694,0.00023812438,0.00028604007,0.004091102,0.00016749202,0.000002883509],"category_scores_gemma":[0.0005371832,0.00030588158,0.00015838128,0.0008620772,0.00041658815,0.00046948018,0.0017366586,0.00060630735,0.000005726306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010851963,0.000020739753,0.00002149183,0.00036423097,0.00004899082,0.00008976169,0.006942444,0.6808459,0.016087765,0.009526756,0.000009968783,0.2860311],"study_design_scores_gemma":[0.00019344491,0.000054425174,0.000033154625,0.0005472112,0.000007211091,0.000019264593,0.0000017662675,0.96898586,0.010501492,0.019300502,0.000012915529,0.00034275392],"about_ca_topic_score_codex":0.000090340625,"about_ca_topic_score_gemma":0.000115685274,"teacher_disagreement_score":0.66206974,"about_ca_system_score_codex":0.00028122115,"about_ca_system_score_gemma":0.00041039984,"threshold_uncertainty_score":0.9999393},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018349482,0.00028535767,0.9912167,0.0015292806,0.0022605248,0.0005158728,0.0000031601658,0.00037621538,0.0036293732],"genre_scores_gemma":[0.57023543,0.000070901435,0.41969928,0.006977547,0.0007516504,0.000035699595,0.000005558525,0.00012470983,0.0020992374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946714,0.00006838467,0.0008569131,0.0021003834,0.0011295805,0.0011733396],"domain_scores_gemma":[0.99710655,0.00080211123,0.00043662312,0.0012550127,0.00019132816,0.00020835709],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015380154,0.0006955503,0.0009263549,0.0014935362,0.0003259202,0.00090373063,0.0036358153,0.0004260719,0.000021596363],"category_scores_gemma":[0.00016580106,0.00065484195,0.00017295429,0.0015240753,0.00062815734,0.0008625668,0.001068621,0.0011639433,0.00009640601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023264058,0.00003833582,0.00008367234,0.00011942723,0.000023234645,0.00033593673,0.0026163848,0.17711447,0.0012208152,0.008750598,0.000066465494,0.8096074],"study_design_scores_gemma":[0.001282586,0.0001032133,0.00014520607,0.0012203093,0.000009669716,0.000028376931,8.954015e-7,0.9132848,0.0011949153,0.081367224,0.000402861,0.00095995533],"about_ca_topic_score_codex":0.000046128345,"about_ca_topic_score_gemma":0.00028803054,"teacher_disagreement_score":0.80864745,"about_ca_system_score_codex":0.0004528022,"about_ca_system_score_gemma":0.0010641669,"threshold_uncertainty_score":0.9995903},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006360584,0.00014077533,0.990047,0.002009674,0.0023695924,0.000648871,0.000008010754,0.00079828134,0.0033417556],"genre_scores_gemma":[0.53402007,0.0000833592,0.4474435,0.011697736,0.0018292136,0.0001413213,0.000036716694,0.00018036655,0.004567752],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99598885,0.000036194804,0.0005440558,0.0017281432,0.00076397567,0.0009387598],"domain_scores_gemma":[0.9968731,0.0010176153,0.00023801162,0.0015054578,0.00024442226,0.00012138607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014444453,0.0005517264,0.0006715917,0.0012967834,0.001114685,0.00050704245,0.004176484,0.00044421104,0.000004834064],"category_scores_gemma":[0.00020764615,0.00050335017,0.00022442857,0.00077424117,0.0011299265,0.00036382812,0.002324575,0.0011747323,0.00004894047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004298864,0.000025650932,0.000034473713,0.00008324257,0.00003868793,0.000100889076,0.0023293786,0.0049805986,0.0003069819,0.35560888,0.00025206598,0.6362349],"study_design_scores_gemma":[0.00041965552,0.00021312636,0.000121773715,0.0003778848,0.000008699325,0.000015989473,6.2482974e-7,0.16173051,0.00043922622,0.82951975,0.006383319,0.000769452],"about_ca_topic_score_codex":0.000021997477,"about_ca_topic_score_gemma":0.00033941015,"teacher_disagreement_score":0.6354654,"about_ca_system_score_codex":0.00019867954,"about_ca_system_score_gemma":0.00033350903,"threshold_uncertainty_score":0.9997418},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019909025,0.00003418323,0.9948812,0.00065270445,0.001080963,0.00022266636,0.000005622647,0.00009555407,0.0010362144],"genre_scores_gemma":[0.42441168,0.000036090194,0.56695414,0.0080021685,0.0003254545,0.000014773193,0.000025239351,0.000051181392,0.00017928817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746907,0.000028339286,0.00039633884,0.000992107,0.0007843375,0.00032980213],"domain_scores_gemma":[0.9987193,0.00024688497,0.00027642964,0.00047665657,0.00016591331,0.00011482518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049165706,0.00030848966,0.00032140317,0.00067258277,0.00018607968,0.00027656273,0.00090342545,0.00017633017,0.00001456897],"category_scores_gemma":[0.00007233783,0.00028541137,0.00006067427,0.00052368874,0.0004276929,0.00041233562,0.00042629978,0.00035824033,0.00001778847],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063527873,0.00002115404,0.0000667971,0.000071487775,0.0000052843125,0.000020117233,0.00048191505,0.0032538928,0.00026313547,0.00063962326,0.000030049727,0.9951402],"study_design_scores_gemma":[0.0005898848,0.00030534316,0.0010434483,0.001174044,0.000014201948,0.000016587672,6.639133e-7,0.91025317,0.0076360763,0.07824682,0.00012695907,0.0005927854],"about_ca_topic_score_codex":0.000009827129,"about_ca_topic_score_gemma":0.000014009302,"teacher_disagreement_score":0.9945474,"about_ca_system_score_codex":0.00011338747,"about_ca_system_score_gemma":0.00024509773,"threshold_uncertainty_score":0.9999598},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028836855,0.000057520017,0.99575627,0.0010840956,0.0010206435,0.0005926903,0.00001045164,0.00033811058,0.0008518219],"genre_scores_gemma":[0.10125791,0.000033663266,0.89505804,0.0014343993,0.0014391192,0.00006686636,0.000034288834,0.00007060047,0.0006051327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709165,0.000031636395,0.00042034272,0.0013678452,0.00056647725,0.0005220462],"domain_scores_gemma":[0.9982727,0.00048347167,0.00030440904,0.00055105536,0.00024748844,0.00014083885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084648916,0.0003870087,0.00046860776,0.00046765542,0.00047315581,0.0007725497,0.0009804288,0.00025849085,0.0000019935753],"category_scores_gemma":[0.000035535028,0.00034713067,0.00008770273,0.00038444126,0.00036926047,0.00054548704,0.0006531009,0.00030445974,0.000022073273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015888756,0.000022809865,0.0000044622775,0.0003833112,0.000021569242,0.000048090136,0.0022622128,0.0069140876,0.011371294,0.066711456,0.00015509773,0.9120897],"study_design_scores_gemma":[0.00031846715,0.00015891604,0.000038660306,0.00057762244,0.000013567539,0.000059143378,4.479831e-7,0.96222574,0.0028214678,0.033183765,0.00013207449,0.00047015728],"about_ca_topic_score_codex":0.000015522517,"about_ca_topic_score_gemma":0.000010438596,"teacher_disagreement_score":0.9553116,"about_ca_system_score_codex":0.00032588004,"about_ca_system_score_gemma":0.00043072522,"threshold_uncertainty_score":0.9998981},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007364134,0.000072403345,0.95771646,0.0024193167,0.0025460706,0.0006333459,0.000017461722,0.00020864069,0.035649866],"genre_scores_gemma":[0.9807404,0.000025349269,0.017530872,0.00043447045,0.0004978386,0.0000073876117,0.0000045571796,0.000037862526,0.00072125444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702394,0.00007859645,0.0005719047,0.0007681782,0.0010683957,0.0004889744],"domain_scores_gemma":[0.99710727,0.0013263808,0.00035272178,0.0006616165,0.00041902738,0.0001329797],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0019098116,0.00025116463,0.00036070694,0.0004083822,0.00057665235,0.00015557172,0.0010201191,0.00037361943,0.00007457799],"category_scores_gemma":[0.00046550203,0.00024720113,0.0001191575,0.0006480294,0.0045234393,0.0002079354,0.0001727438,0.00046685178,0.00012074534],"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.000009744949,0.00003146907,0.000052313986,0.000049549664,0.000007281515,0.00050443626,0.0040596174,0.013560557,0.000324228,0.8119025,0.000023873412,0.16947441],"study_design_scores_gemma":[0.00011868207,0.00019380492,0.000048619273,0.0009436186,0.00003972641,0.000048511076,0.000028805118,0.2298522,0.0058675422,0.7518131,0.0100960545,0.0009493388],"about_ca_topic_score_codex":0.0028686046,"about_ca_topic_score_gemma":0.031592783,"teacher_disagreement_score":0.980004,"about_ca_system_score_codex":0.00029398108,"about_ca_system_score_gemma":0.0008208069,"threshold_uncertainty_score":0.99999803},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024840052,0.0007073548,0.9920237,0.001820789,0.0036390638,0.00088183756,0.0000068770755,0.00020144953,0.0006940986],"genre_scores_gemma":[0.0013524168,0.00016140507,0.99383384,0.0012435634,0.00049484393,0.000029061313,0.00000613117,0.00004427769,0.0028344402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995819,0.00006664611,0.00058645126,0.0019409462,0.00083117094,0.00075582584],"domain_scores_gemma":[0.9970128,0.0010904357,0.0002396791,0.0012636457,0.00017799299,0.00021545192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028104032,0.00049365615,0.0005745501,0.00066935684,0.00031030204,0.0008120865,0.0024528017,0.00027439947,0.0000089902915],"category_scores_gemma":[0.00016694359,0.00046950454,0.00013677616,0.00048040904,0.00036127638,0.0005442328,0.0024654935,0.00060913217,0.000009807],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019424615,0.000010928802,0.0000071786462,0.000071357936,0.000019968664,0.000034278986,0.00043108113,0.0058096126,0.00024920283,0.11050158,0.00008358488,0.8827618],"study_design_scores_gemma":[0.00040470978,0.00024097334,0.0000183398,0.00024126747,0.000013872921,0.000037366408,3.1789557e-7,0.65658176,0.0018068095,0.323426,0.016628997,0.0005995615],"about_ca_topic_score_codex":0.00002983238,"about_ca_topic_score_gemma":0.000035246096,"teacher_disagreement_score":0.8821622,"about_ca_system_score_codex":0.00041119137,"about_ca_system_score_gemma":0.00050710235,"threshold_uncertainty_score":0.99977565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002293142,0.000047957597,0.9948697,0.0002128593,0.0010995598,0.0004360026,0.000019876155,0.00022896551,0.0007919452],"genre_scores_gemma":[0.9108587,0.00007340146,0.08736613,0.00093083025,0.0004761364,0.00003173016,0.000032176486,0.00006484798,0.0001660708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655104,0.000052465537,0.00046487292,0.0012582692,0.0012820165,0.00039135388],"domain_scores_gemma":[0.9978311,0.00028627887,0.0002965251,0.001021623,0.00040566848,0.00015878948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012612211,0.00031632968,0.000340118,0.00075060414,0.00033459408,0.0002762087,0.0014190767,0.0002767418,0.000013633934],"category_scores_gemma":[0.00012955982,0.00033051232,0.00006690759,0.0010245536,0.00018312996,0.00048387237,0.0005279447,0.0004900393,0.000020912836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017407925,0.000048706035,0.0000035837347,0.0000648873,0.0000068031377,0.0000025700958,0.0011905641,0.1914717,0.0015043879,0.042358663,0.000088298875,0.7632424],"study_design_scores_gemma":[0.00012270322,0.0004100077,0.000028093173,0.00051222637,0.000004401456,0.0000073980623,5.5760955e-7,0.7498008,0.0095014,0.23785596,0.0013616331,0.00039481846],"about_ca_topic_score_codex":0.00006958051,"about_ca_topic_score_gemma":0.00012516443,"teacher_disagreement_score":0.9085655,"about_ca_system_score_codex":0.0004952733,"about_ca_system_score_gemma":0.00035168248,"threshold_uncertainty_score":0.9999147},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000250559,0.0006816185,0.99449146,0.000008230957,0.0013677481,0.0018470386,0.0000032682349,0.0003843829,0.00096571364],"genre_scores_gemma":[0.7361137,0.00032552707,0.25830415,0.00033814117,0.0037427612,0.00035906772,0.000027280297,0.00052139594,0.00026791217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980195,0.000019998444,0.0003852032,0.0006034588,0.00034564492,0.0006261816],"domain_scores_gemma":[0.99909186,0.00020879463,0.0000882517,0.00041864012,0.00005681242,0.00013562689],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005349074,0.0004155401,0.0004916992,0.00027404647,0.00020931612,0.00035558324,0.0004315238,0.0003420398,0.000007708985],"category_scores_gemma":[0.00001190064,0.00040166956,0.00007051056,0.0003338261,0.00020042779,0.00013671846,0.00025941632,0.0006036383,0.000007429039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003684687,0.0000010982862,0.000053080665,0.00017571168,0.000013875812,0.00006521496,0.00010616805,0.9320156,0.00002786401,0.00070860214,0.0000066335406,0.066822454],"study_design_scores_gemma":[0.00019876273,0.000024584146,0.00002946409,0.0019523095,0.0000138403275,0.00005355001,2.778156e-7,0.994135,0.00004459715,0.002767119,0.0003680487,0.0004124422],"about_ca_topic_score_codex":0.000024034112,"about_ca_topic_score_gemma":0.00003436145,"teacher_disagreement_score":0.7361873,"about_ca_system_score_codex":0.00026054465,"about_ca_system_score_gemma":0.00006272231,"threshold_uncertainty_score":0.99984354},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006042509,0.000330101,0.9948464,0.0009372913,0.0017339136,0.0014462858,0.0000042274164,0.0004719835,0.00022375882],"genre_scores_gemma":[0.026768701,0.000120959565,0.9673075,0.0020541544,0.0020358886,0.00030369972,0.000023784509,0.00011801093,0.0012672837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99629444,0.00002609536,0.00052884093,0.001591412,0.00058434304,0.00097485905],"domain_scores_gemma":[0.9971332,0.0009242904,0.00029727447,0.0012283546,0.00020042136,0.00021649119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090204907,0.0005145172,0.0004790812,0.0004519723,0.0004330177,0.000782483,0.003104219,0.00029575446,0.000004799612],"category_scores_gemma":[0.00003882871,0.0004647019,0.00020086221,0.0010435047,0.00038428555,0.00042187326,0.0008949543,0.00065276364,0.00001847346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003910632,0.000012332742,0.000006047813,0.000014149359,0.000005802527,0.000031141022,0.000049465798,0.29893282,0.0000070100427,0.016111653,0.0001828651,0.6846428],"study_design_scores_gemma":[0.00016591449,0.00014473658,0.000024789651,0.00013010278,0.000010332544,0.000032681553,4.6695543e-8,0.9354375,0.000042849908,0.060435362,0.0030809466,0.00049472094],"about_ca_topic_score_codex":0.00001108654,"about_ca_topic_score_gemma":0.000047684716,"teacher_disagreement_score":0.6841481,"about_ca_system_score_codex":0.00010514646,"about_ca_system_score_gemma":0.00018986569,"threshold_uncertainty_score":0.9997805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059350755,0.00009481088,0.9963167,0.00012226241,0.0014521566,0.00027529427,0.000024889852,0.00037039956,0.00074998237],"genre_scores_gemma":[0.54282683,0.00013884518,0.45344383,0.0012144601,0.0013061898,0.000017972836,0.00019902822,0.00051932636,0.00033352055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998072,0.000020527583,0.00038226417,0.0006160696,0.00047983538,0.00042925417],"domain_scores_gemma":[0.998857,0.00036294057,0.0000942557,0.0004430706,0.00014391095,0.00009882682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038066827,0.00039373423,0.00034772942,0.0007594883,0.00013084266,0.00021785511,0.00039635866,0.00028605427,0.000038475886],"category_scores_gemma":[0.00010325799,0.00040454784,0.00009315391,0.00042663387,0.00026634912,0.00015894935,0.00008785937,0.0004973458,0.000088467306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003957232,0.0000052665846,0.000005382525,0.000091570895,0.000006470728,0.000038139995,0.000053579966,0.92939913,0.000645517,0.000052994033,0.000017431606,0.069680534],"study_design_scores_gemma":[0.00018741282,0.00004188574,0.000010521947,0.0008045128,0.000018978599,0.00001663859,2.385854e-7,0.982391,0.008230247,0.007766813,0.000057770172,0.0004740009],"about_ca_topic_score_codex":0.000017853154,"about_ca_topic_score_gemma":0.000031884763,"teacher_disagreement_score":0.5428729,"about_ca_system_score_codex":0.00030955952,"about_ca_system_score_gemma":0.00014869316,"threshold_uncertainty_score":0.9998406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017697433,0.000117042706,0.9940451,0.0005060301,0.0006067667,0.00065190805,0.0000019134911,0.00037347744,0.0019280276],"genre_scores_gemma":[0.8440464,0.0000073871593,0.15484963,0.00063010555,0.000049997157,0.000017541628,0.000016585647,0.000044245415,0.00033808325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649376,0.00014107492,0.0005200238,0.0014026987,0.00084783515,0.0005946083],"domain_scores_gemma":[0.9984913,0.0004436381,0.00017778891,0.0005830898,0.00009871338,0.0002054542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014736044,0.0004253536,0.00041570314,0.0014069194,0.00026267715,0.00041109466,0.0015177486,0.00025139912,0.000007992057],"category_scores_gemma":[0.000093559865,0.0004385848,0.000087316024,0.0012303875,0.00015333132,0.00085704133,0.00040717475,0.0013097728,0.00006601373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008002956,0.000009753924,0.00008141385,0.000006007138,0.000002407125,0.000029480914,0.0024622162,0.53523016,0.0005079943,0.0015648508,5.002829e-7,0.46009722],"study_design_scores_gemma":[0.00042307793,0.000284475,0.0007405625,0.00015425628,0.0000031729255,0.000016813465,0.0000010267329,0.98058695,0.00018968043,0.01709615,0.00004262257,0.00046123762],"about_ca_topic_score_codex":0.000055717665,"about_ca_topic_score_gemma":0.00031262258,"teacher_disagreement_score":0.8422767,"about_ca_system_score_codex":0.00031008996,"about_ca_system_score_gemma":0.00016857308,"threshold_uncertainty_score":0.9998066},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00935412,0.000024513449,0.9870658,0.00064022554,0.0014231523,0.0011468389,0.000027157115,0.00007779929,0.0002403908],"genre_scores_gemma":[0.7146711,8.4977705e-7,0.28102326,0.0009654563,0.001582784,0.00013156768,0.000015310436,0.000095341566,0.0015143497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777144,0.000056769077,0.0002160392,0.0010851761,0.00041042262,0.0004601337],"domain_scores_gemma":[0.9968334,0.002032527,0.00020783697,0.0005133111,0.00029573234,0.00011722692],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048266654,0.0003473433,0.00036266923,0.00042475807,0.0001517796,0.00011843748,0.000530215,0.00022912835,0.000029840896],"category_scores_gemma":[0.0002620999,0.00032982984,0.000121901314,0.00029516057,0.00021317447,0.00008449774,0.00011081823,0.00039416648,0.00007706509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027386573,0.0003055224,0.0001536347,0.00009829702,0.000078537836,0.000023019575,0.0110864965,0.56678814,0.005079466,0.0052083964,0.00021329914,0.41069135],"study_design_scores_gemma":[0.0006012071,0.00046114434,0.0021890304,0.00049967045,0.00004275523,0.000011722984,0.0000079083065,0.98405564,0.0023360893,0.007969636,0.0010197957,0.00080539356],"about_ca_topic_score_codex":0.000049538216,"about_ca_topic_score_gemma":0.000021200234,"teacher_disagreement_score":0.7060425,"about_ca_system_score_codex":0.00029580228,"about_ca_system_score_gemma":0.00037316774,"threshold_uncertainty_score":0.99991536},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012622765,0.000068511465,0.9955327,0.00037608124,0.0023176055,0.0008652948,0.000006585734,0.0005223941,0.00029821382],"genre_scores_gemma":[0.002021499,0.00006194911,0.99555993,0.0009077543,0.00064726826,0.000076747056,0.00005437732,0.000044601504,0.0006258649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684733,0.00002762746,0.00058040285,0.0009917574,0.0008441304,0.00070875004],"domain_scores_gemma":[0.9978967,0.00042303148,0.0004445421,0.00070591853,0.0003970722,0.00013275936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007255032,0.0004618797,0.00039982787,0.0011889576,0.00043304922,0.0005973402,0.001915302,0.00030577226,0.0000018529372],"category_scores_gemma":[0.00011285131,0.00043627748,0.00016987008,0.0011895498,0.0003301821,0.0021401693,0.0007660434,0.00084606674,0.0000362972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002076993,0.000003411707,0.000004009253,0.000018514102,0.000004976757,0.0000070542833,0.00022255407,0.18959199,0.000016550244,0.013536433,0.000021603586,0.79657084],"study_design_scores_gemma":[0.0002178965,0.00017022125,0.00003341381,0.00013207264,0.0000043425393,0.000020539926,1.0519099e-7,0.8003513,0.0002479734,0.19692071,0.0014888889,0.00041250724],"about_ca_topic_score_codex":0.000006700994,"about_ca_topic_score_gemma":0.00001659812,"teacher_disagreement_score":0.7961583,"about_ca_system_score_codex":0.00017919065,"about_ca_system_score_gemma":0.00023977464,"threshold_uncertainty_score":0.9998089},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008563001,0.0001668503,0.9954066,0.00086281786,0.0009765019,0.001051203,0.000019327174,0.0010166793,0.00041439215],"genre_scores_gemma":[0.23552571,0.00008689471,0.7585643,0.0012558268,0.00070430065,0.00065097114,0.000014336345,0.00011701429,0.0030806416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622184,0.000032710268,0.0007083179,0.0017251092,0.0006350306,0.0006769803],"domain_scores_gemma":[0.9969563,0.00051638123,0.00043257762,0.0015361287,0.00039351507,0.00016511249],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010387616,0.00056933163,0.0007115116,0.00078138505,0.00056259945,0.0005775528,0.0024295165,0.00040789315,0.000017271996],"category_scores_gemma":[0.000058064452,0.00052565493,0.0004221554,0.0010165378,0.00041117307,0.00061753776,0.0008888692,0.00048591598,0.000055852917],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016424921,0.00006034907,0.00002962899,0.000103265906,0.00024966468,0.000025276897,0.00028083017,0.008499466,0.0068822126,0.057943746,0.000051123232,0.925858],"study_design_scores_gemma":[0.0002702331,0.00050371804,0.00022864704,0.0000846419,0.00017274969,0.000057822523,1.8715438e-7,0.54446095,0.051943496,0.3966047,0.004631039,0.0010418538],"about_ca_topic_score_codex":0.00005383893,"about_ca_topic_score_gemma":0.000370402,"teacher_disagreement_score":0.92481613,"about_ca_system_score_codex":0.0001677914,"about_ca_system_score_gemma":0.00026604184,"threshold_uncertainty_score":0.9997195},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039068822,0.0021349099,0.98850393,0.00060411124,0.004005443,0.00035298232,0.000021158403,0.00031775,0.0040206476],"genre_scores_gemma":[0.01268672,0.004018683,0.9759042,0.004570847,0.0019705512,0.000117249445,0.00012532953,0.00014406464,0.00046233297],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99484533,0.00012942428,0.0006719526,0.002220946,0.00097033853,0.0011620155],"domain_scores_gemma":[0.9964274,0.0011578407,0.00026326557,0.0018207795,0.00014044654,0.00019024913],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001229063,0.0005686052,0.0007127185,0.0022708562,0.00020471451,0.00044754436,0.0059076454,0.00041320972,0.000015971164],"category_scores_gemma":[0.00026104331,0.00055218907,0.00015694504,0.005069825,0.00092054077,0.001533905,0.0025972936,0.0013244251,0.00020102756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000124172575,0.0000994765,0.00053019845,0.00014766553,0.0000066729294,0.00073431805,0.0009957545,0.014158275,0.000029952565,0.09553486,0.0010008105,0.8867496],"study_design_scores_gemma":[0.0003972535,0.00017588648,0.00092605787,0.000412716,0.0000038128653,0.00006312585,3.7567827e-7,0.12307408,0.00010844188,0.8533755,0.020600634,0.0008621505],"about_ca_topic_score_codex":0.0000293419,"about_ca_topic_score_gemma":0.0012038624,"teacher_disagreement_score":0.88588744,"about_ca_system_score_codex":0.00026673474,"about_ca_system_score_gemma":0.0010397094,"threshold_uncertainty_score":0.999693},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011020561,0.0009275907,0.99199843,0.000862649,0.0029554674,0.00038719882,0.000009427666,0.00020349298,0.0025455467],"genre_scores_gemma":[0.05202079,0.0035155697,0.9357518,0.0052305316,0.0016575616,0.00021339055,0.000105976185,0.00016109405,0.0013432777],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957897,0.00010630112,0.0006706146,0.0016135211,0.00084021746,0.0009796433],"domain_scores_gemma":[0.9974532,0.0008686469,0.00023813646,0.0011541474,0.00015153135,0.00013430222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010869439,0.00044033548,0.00055157894,0.0022604403,0.00022281703,0.00038544534,0.0035776934,0.00025047996,0.000024266701],"category_scores_gemma":[0.00014571234,0.00043150116,0.00012123049,0.0044912356,0.00061164296,0.00093524944,0.0015021119,0.0008777388,0.00010048843],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052368546,0.00006916221,0.000710111,0.00008539602,0.000005825393,0.00034445495,0.0014924296,0.013544646,0.000024913803,0.05731814,0.00054341834,0.9258563],"study_design_scores_gemma":[0.0005471246,0.00020237124,0.0016641215,0.00027861082,0.000004297468,0.00005704951,0.0000012100359,0.2113777,0.000079900325,0.7687424,0.01622051,0.00082475034],"about_ca_topic_score_codex":0.000041254065,"about_ca_topic_score_gemma":0.002203059,"teacher_disagreement_score":0.92503154,"about_ca_system_score_codex":0.00029955685,"about_ca_system_score_gemma":0.0009986486,"threshold_uncertainty_score":0.9998137},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009349803,0.00040871146,0.98907197,0.001441455,0.001698348,0.00034979035,0.00005943265,0.00063589145,0.0063250368],"genre_scores_gemma":[0.047035534,0.00020485844,0.9396821,0.010007165,0.0021031324,0.00003416434,0.000120144585,0.00014819994,0.0006646946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952323,0.00004230836,0.00050816376,0.0018980844,0.0012824637,0.0010366798],"domain_scores_gemma":[0.9962471,0.00079300284,0.00024876144,0.0021738156,0.00026254318,0.00027478908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000970067,0.0006368701,0.00057140883,0.0022800518,0.00043904452,0.00097303477,0.0051590228,0.0005171344,0.000032242475],"category_scores_gemma":[0.00018358244,0.00060285244,0.00024168247,0.002431981,0.0008373928,0.00072943146,0.0016693504,0.001212764,0.00015375382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103038565,0.000064835665,0.000031742817,0.000117205,0.000020707357,0.00027260528,0.00038358968,0.06960018,0.00014826919,0.6970469,0.000459086,0.2318446],"study_design_scores_gemma":[0.00029003515,0.00014639419,0.000063493215,0.00038077094,0.000007090068,0.000014349938,1.0665926e-7,0.31517857,0.0011204019,0.67296815,0.009029276,0.00080136623],"about_ca_topic_score_codex":0.00015334682,"about_ca_topic_score_gemma":0.00023446754,"teacher_disagreement_score":0.24557838,"about_ca_system_score_codex":0.00022135225,"about_ca_system_score_gemma":0.0016025024,"threshold_uncertainty_score":0.9996423},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014413439,0.00011450448,0.99476707,0.00044303446,0.002133057,0.001349198,0.00004053427,0.00021656298,0.0007918957],"genre_scores_gemma":[0.028266989,0.000030259362,0.97081786,0.00015624154,0.00018212968,0.00009083278,0.00000907545,0.000035717443,0.00041086745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590963,0.000088503526,0.0008409665,0.001611765,0.0009250368,0.00062409125],"domain_scores_gemma":[0.99514985,0.0015938559,0.0005529033,0.001968199,0.00060880545,0.0001263753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036814483,0.0004581526,0.0007031053,0.0005931524,0.0002564544,0.00019058769,0.0036714424,0.0003267678,0.000005206812],"category_scores_gemma":[0.0016135378,0.00041941414,0.00019045247,0.00096846744,0.0012438614,0.0005155267,0.0010604716,0.000493704,0.0000054992875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003642874,0.000073253344,0.00009381821,0.00067772553,0.00001532768,0.000008152537,0.0010963031,0.0077174306,0.000116806295,0.42679226,0.000020794247,0.5633517],"study_design_scores_gemma":[0.0002189197,0.00019419471,0.00027298406,0.00025485223,0.00000863964,0.0000048925713,3.3134015e-7,0.55030185,0.0012102092,0.44658026,0.0005395959,0.0004132333],"about_ca_topic_score_codex":0.0000143356965,"about_ca_topic_score_gemma":0.00009296497,"teacher_disagreement_score":0.56293845,"about_ca_system_score_codex":0.00036617924,"about_ca_system_score_gemma":0.0005922544,"threshold_uncertainty_score":0.9998258},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000935688,0.00016499353,0.9933715,0.001299531,0.0024662293,0.00093430525,0.000023407363,0.00058731774,0.0010591674],"genre_scores_gemma":[0.048816428,0.00013146916,0.9363333,0.005334666,0.0013915376,0.00022159872,0.00006932591,0.00033153026,0.007370119],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99569917,0.000027495522,0.0005022906,0.0018722152,0.0010224823,0.00087632827],"domain_scores_gemma":[0.9967903,0.0008265843,0.00035133093,0.0015553089,0.00030414574,0.00017234359],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012341214,0.00067581766,0.00065781054,0.00077235425,0.00042372005,0.0011283577,0.003976008,0.00028823066,0.0000084056455],"category_scores_gemma":[0.00005922601,0.00053064764,0.0001551682,0.00084039423,0.000951198,0.00077563594,0.00096666557,0.0005531342,0.000040772768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060739512,0.00007562328,0.00008469852,0.0005368749,0.00010139089,0.00020934382,0.0028057026,0.038010865,0.00022587307,0.38815933,0.00035430348,0.5693752],"study_design_scores_gemma":[0.0005520674,0.00032379437,0.00003234222,0.00084354746,0.000015600768,0.00009063417,4.4295058e-7,0.47413844,0.0001959446,0.51987004,0.0031017675,0.0008353355],"about_ca_topic_score_codex":0.000046539793,"about_ca_topic_score_gemma":0.00026050245,"teacher_disagreement_score":0.5685399,"about_ca_system_score_codex":0.00030857982,"about_ca_system_score_gemma":0.00065847917,"threshold_uncertainty_score":0.99990857},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018096552,0.00011415945,0.9855751,0.0040504667,0.0048745354,0.00041032716,0.0000033626754,0.0014886629,0.0033024384],"genre_scores_gemma":[0.10128632,0.00007606184,0.8687744,0.0053996015,0.001955601,0.00022617253,0.000034506753,0.00023751929,0.022009823],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956081,0.000042369575,0.0005547703,0.0020052749,0.0008255574,0.00096390885],"domain_scores_gemma":[0.99642795,0.00046781148,0.00039938852,0.0019957079,0.0006408162,0.00006833181],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007728203,0.00055426476,0.0005698901,0.005165751,0.0003543122,0.0003616579,0.0062322905,0.00089507404,0.000014818849],"category_scores_gemma":[0.0004574896,0.0005441907,0.00010529657,0.0060007954,0.0017140097,0.00077136775,0.0030356895,0.0021762084,0.00067568885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056920185,0.00006344394,0.00010800942,0.000056403966,0.000040985266,0.00064359,0.0012648107,0.003551091,0.0011679253,0.13894244,0.0018066623,0.8523489],"study_design_scores_gemma":[0.00032888644,0.00039895452,0.00011595753,0.000506777,0.000007790926,0.00031663585,0.0000014674683,0.1657089,0.009739167,0.81646264,0.0053896005,0.0010232407],"about_ca_topic_score_codex":0.000006138611,"about_ca_topic_score_gemma":0.000058476264,"teacher_disagreement_score":0.8513257,"about_ca_system_score_codex":0.0012637796,"about_ca_system_score_gemma":0.0014182173,"threshold_uncertainty_score":0.99970096},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003971783,0.00021597413,0.99235475,0.0024168456,0.0015391856,0.0006623007,0.000014721654,0.0012982888,0.0011007785],"genre_scores_gemma":[0.3786128,0.0003368449,0.61917424,0.0006522535,0.0003051451,0.000081733015,0.000022400307,0.000105556246,0.00070905377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99559414,0.00006578998,0.00057267625,0.0020145322,0.00097627856,0.0007765865],"domain_scores_gemma":[0.99678195,0.0007146154,0.00046896437,0.0010080936,0.0009574215,0.000068969246],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008129369,0.00074501877,0.0006135028,0.0024069475,0.00055457326,0.000987568,0.002604359,0.00070650136,0.000015825006],"category_scores_gemma":[0.0002692439,0.00069850346,0.00010743533,0.0012782641,0.0027794093,0.0020573942,0.0019020649,0.0016521602,0.000081153834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002965055,0.00004290979,0.000015448963,0.000054924654,0.00009400548,0.00031226617,0.00548814,0.024392132,0.00035475954,0.49744347,0.00008157926,0.4716907],"study_design_scores_gemma":[0.0002862863,0.0007624567,0.00020437737,0.00056906807,0.000011442377,0.00019077868,0.0001575363,0.26911312,0.0025045485,0.72532374,0.00007577836,0.0008008694],"about_ca_topic_score_codex":0.00003165553,"about_ca_topic_score_gemma":0.00003960725,"teacher_disagreement_score":0.47088984,"about_ca_system_score_codex":0.00066327106,"about_ca_system_score_gemma":0.0011413841,"threshold_uncertainty_score":0.99993443},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020411568,0.0001828534,0.9848923,0.00037108187,0.005734119,0.00032573997,0.0000018649938,0.00027760916,0.008010314],"genre_scores_gemma":[0.7812319,0.0001213455,0.20688784,0.002744202,0.0021907592,0.00005443029,0.000009342082,0.00016923899,0.006590962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960095,0.00004987033,0.0007362537,0.0015699394,0.00083500263,0.00079940713],"domain_scores_gemma":[0.9977005,0.00059466466,0.00026590523,0.0011378713,0.0001673881,0.0001336749],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016021235,0.0004618643,0.00056484295,0.0015793669,0.00019529309,0.0006395694,0.0028149637,0.0003483756,0.000014123119],"category_scores_gemma":[0.00009643084,0.0004345826,0.0001558474,0.0014766471,0.0002896495,0.00050714315,0.001180418,0.0009876718,0.00014110112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062132285,0.000021046444,0.00036545764,0.000066691464,0.000011582156,0.0003467138,0.0014310122,0.085135326,0.00003630259,0.21451269,0.0000969719,0.69797],"study_design_scores_gemma":[0.00020523887,0.00010602472,0.00027667693,0.0009223915,0.000001888921,0.00009294057,3.3660044e-7,0.7851579,0.000053274907,0.21158718,0.0010412663,0.00055484736],"about_ca_topic_score_codex":0.000111390524,"about_ca_topic_score_gemma":0.0005511287,"teacher_disagreement_score":0.78102773,"about_ca_system_score_codex":0.00027594317,"about_ca_system_score_gemma":0.00026424363,"threshold_uncertainty_score":0.9998106},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002644346,0.0001271806,0.9943957,0.0011546767,0.0022699207,0.00064070435,0.00006810812,0.0004284506,0.0006508598],"genre_scores_gemma":[0.7317886,0.00009724365,0.26013517,0.0047785095,0.002459998,0.000106132684,0.00012883492,0.00016207439,0.0003434449],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942841,0.00013252748,0.00051614444,0.0021987932,0.001812593,0.001055877],"domain_scores_gemma":[0.9964812,0.0007409863,0.00024981538,0.0018693793,0.00029131531,0.00036734724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014035531,0.00058627024,0.00053860724,0.0013240289,0.00037008937,0.00065282884,0.004386795,0.0004814297,0.000049820897],"category_scores_gemma":[0.00009111217,0.0005719323,0.00014003062,0.0009264363,0.0015229958,0.0014351213,0.00264429,0.0014431981,0.0001906195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024155077,0.000053872034,0.00004161853,0.000022278235,0.000029877177,0.00046958696,0.0025891417,0.008883812,0.0003688136,0.18224105,0.000010531315,0.80526525],"study_design_scores_gemma":[0.00031183884,0.0002219152,0.00034331743,0.00020854265,0.000005130091,0.000044929267,0.0000011155606,0.26606694,0.0005202666,0.7315509,0.00012313286,0.0006020194],"about_ca_topic_score_codex":0.00015806874,"about_ca_topic_score_gemma":0.0006172248,"teacher_disagreement_score":0.80466324,"about_ca_system_score_codex":0.0004424262,"about_ca_system_score_gemma":0.000648539,"threshold_uncertainty_score":0.9996732},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040484063,0.0010699759,0.9902176,0.0009230298,0.0019536114,0.00026662135,0.000005576534,0.00040478396,0.0047539617],"genre_scores_gemma":[0.19683337,0.0004956024,0.78919744,0.0018766837,0.001523757,0.000090265596,0.000029850084,0.00009822503,0.00985478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997032,0.00009568697,0.00036516238,0.0013413052,0.00055576634,0.0006101047],"domain_scores_gemma":[0.9970947,0.0014553228,0.00017096031,0.0009224088,0.00021460689,0.00014203343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010453153,0.00038664098,0.00046955992,0.00085096294,0.0003810646,0.00071068545,0.0023209725,0.0002727207,0.0000028186646],"category_scores_gemma":[0.00042694435,0.0003419202,0.00006496807,0.001456808,0.00073980977,0.00058935035,0.002067114,0.0006035304,0.000059734743],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062533595,0.000098112374,0.0016668836,0.00021351449,0.00006188415,0.0004499853,0.01584332,0.00581034,0.00011258532,0.13597757,0.003874607,0.8358849],"study_design_scores_gemma":[0.0003409932,0.00014695158,0.0029258917,0.00068578176,0.0000137112675,0.00012239168,0.0000031201976,0.7585012,0.00037647111,0.23374431,0.0023052753,0.0008339599],"about_ca_topic_score_codex":0.000029161978,"about_ca_topic_score_gemma":0.000945383,"teacher_disagreement_score":0.835051,"about_ca_system_score_codex":0.00028359087,"about_ca_system_score_gemma":0.0016202675,"threshold_uncertainty_score":0.99990326},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013264776,0.00043744282,0.99091744,0.00060548895,0.0050905547,0.00027922133,0.000020942593,0.0002403449,0.0022759037],"genre_scores_gemma":[0.7171463,0.0014655935,0.13575093,0.03155769,0.09813097,0.000034439054,0.0035128153,0.00087945326,0.011521849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632305,0.000008633426,0.0005094132,0.0017421839,0.0007503088,0.00066638866],"domain_scores_gemma":[0.99730355,0.00043915282,0.00032583336,0.0016624575,0.00023922708,0.000029756351],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014186228,0.00046892668,0.00046622902,0.0011021809,0.00034502248,0.0014572771,0.0040190066,0.00024659646,0.00002612822],"category_scores_gemma":[0.00056276936,0.00042071333,0.00003848575,0.0021669406,0.000998221,0.0013789509,0.008089325,0.0007015268,0.00035318916],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042144843,0.00001623954,0.0004029482,0.00029212458,0.000006418963,0.00004511192,0.00004488905,0.0034950955,0.000008350325,0.0010111473,0.0013246889,0.9933488],"study_design_scores_gemma":[0.00008583466,0.000013431827,0.0007305656,0.0013080976,0.000033521013,0.000026597158,0.0000012950867,0.86181664,0.00005154722,0.09377589,0.041242804,0.0009137795],"about_ca_topic_score_codex":0.00022034084,"about_ca_topic_score_gemma":0.0004948683,"teacher_disagreement_score":0.992435,"about_ca_system_score_codex":0.00008772321,"about_ca_system_score_gemma":0.00032405966,"threshold_uncertainty_score":0.99993306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071996904,0.00015769711,0.9931752,0.00071089756,0.0020487586,0.00043873288,0.000037514616,0.00035743508,0.0023538033],"genre_scores_gemma":[0.45781842,0.00019482122,0.53808063,0.0026343018,0.0009041213,0.000038455317,0.000078355755,0.00010225051,0.00014865643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99511546,0.00007429843,0.0006674778,0.002259842,0.0009799554,0.0009029706],"domain_scores_gemma":[0.9960948,0.00081513426,0.00023061318,0.0025147994,0.00012490123,0.00021971391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024411206,0.000552789,0.0006012115,0.0014314196,0.00017979988,0.0005632182,0.005073624,0.00041866943,0.00003150114],"category_scores_gemma":[0.0002295279,0.0005302294,0.00017947811,0.002055541,0.0008342682,0.00091924233,0.0027909167,0.0013069869,0.00009833828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019830613,0.00008048435,0.0015125278,0.00016929519,0.000016770839,0.0005876879,0.0025724785,0.008555433,0.000049790087,0.6400813,0.00012702918,0.34622738],"study_design_scores_gemma":[0.00025752382,0.000085209715,0.0019407666,0.0003038556,0.0000035751784,0.000021666832,2.1841484e-7,0.16010399,0.0002517674,0.8352257,0.0011636912,0.00064205524],"about_ca_topic_score_codex":0.00009439181,"about_ca_topic_score_gemma":0.0010674442,"teacher_disagreement_score":0.45709845,"about_ca_system_score_codex":0.00023566533,"about_ca_system_score_gemma":0.00039590595,"threshold_uncertainty_score":0.9997149},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014776744,0.00025280315,0.9961174,0.00011828971,0.002229198,0.0005933119,0.000008531018,0.00042116252,0.000111510475],"genre_scores_gemma":[0.03171909,0.0005635297,0.9667725,0.00027189686,0.00045524194,0.000028330503,0.00003923091,0.000038751125,0.00011143563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957406,0.00013716574,0.0010184895,0.0014116535,0.0012336551,0.00045845783],"domain_scores_gemma":[0.99355656,0.00401175,0.0008424774,0.0008205935,0.0006031753,0.00016545886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026511904,0.00035155745,0.00064508984,0.0019614205,0.0002146155,0.00039596934,0.0019253843,0.0005165309,0.000010682808],"category_scores_gemma":[0.0017000661,0.0003477893,0.00029396766,0.0020348493,0.0005428416,0.00114714,0.0006926127,0.001061283,0.000015574413],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008382861,0.000024959912,0.001832912,0.00003129149,0.000032104457,0.000007998603,0.00017547351,0.0014727626,0.00022410837,0.00033386494,0.000046081124,0.99581003],"study_design_scores_gemma":[0.00044329133,0.00053193077,0.012156758,0.00046759043,0.000044066717,0.0000064901524,4.844055e-7,0.9324555,0.0030206414,0.049828514,0.00044806904,0.00059669913],"about_ca_topic_score_codex":0.00013235417,"about_ca_topic_score_gemma":0.000075231226,"teacher_disagreement_score":0.9952134,"about_ca_system_score_codex":0.0001404579,"about_ca_system_score_gemma":0.00027045634,"threshold_uncertainty_score":0.9998974},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01658806,0.0003291828,0.97870094,0.001113471,0.0022337823,0.0007237193,0.0000038936546,0.00015273488,0.00015420551],"genre_scores_gemma":[0.98478216,0.000025288538,0.013602643,0.00041452446,0.00080800476,2.8196064e-7,0.000016081098,0.000022854983,0.00032813402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881804,0.000017360759,0.00027174872,0.00030426768,0.00042289795,0.00016568995],"domain_scores_gemma":[0.999277,0.00019881457,0.00018341128,0.00020080426,0.00010140663,0.00003858635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025728758,0.0001555248,0.00025165957,0.00022666705,0.00011988522,0.000038303195,0.00015135946,0.000115510986,0.0000131032375],"category_scores_gemma":[0.00004948475,0.00011204729,0.0000826988,0.00023708725,0.00040085896,0.00008243858,0.0002630997,0.0001787684,0.0000012591594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003080533,0.0000018104981,0.03508131,0.00008607237,0.000037352125,0.000008619836,0.00019760123,0.9313138,0.0005582578,0.00088139594,0.000013359436,0.03178961],"study_design_scores_gemma":[0.00030915003,0.00003159005,0.029984826,0.00013542334,0.000051302653,0.000019529625,3.8877792e-7,0.9677784,0.00007040854,0.0014939454,0.000024665076,0.00010039828],"about_ca_topic_score_codex":0.000010184627,"about_ca_topic_score_gemma":0.000017744998,"teacher_disagreement_score":0.9681941,"about_ca_system_score_codex":0.00008729684,"about_ca_system_score_gemma":0.00008010043,"threshold_uncertainty_score":0.45691556},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045777673,0.00024323621,0.98557544,0.0031060504,0.0031388903,0.00045674684,0.0000062338013,0.001513106,0.005914532],"genre_scores_gemma":[0.022029525,0.00015617126,0.97098297,0.0024054584,0.00081282016,0.000015865278,0.000008837713,0.00008962106,0.0034987452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569696,0.00006496466,0.0007448503,0.0015484121,0.0011191798,0.0008256326],"domain_scores_gemma":[0.99635303,0.0006773285,0.00045406737,0.0020730703,0.00027277065,0.00016970755],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00085059484,0.0006337844,0.0005558236,0.0006219909,0.00084872666,0.0011043255,0.0052259355,0.0003486872,0.000021683112],"category_scores_gemma":[0.00014300813,0.0004947157,0.00021985422,0.001416934,0.00066446216,0.0008199211,0.0026385097,0.0012218481,0.00016185694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057995444,0.000037596586,0.000052108982,0.00003434288,0.000041482523,0.00008426152,0.0047695786,0.30357358,0.00004840778,0.5085372,0.0029431644,0.17987254],"study_design_scores_gemma":[0.0002421936,0.000120355464,0.00008709613,0.0004393193,0.000011070754,0.00015683,0.0000017288544,0.6004258,0.00036332195,0.38547668,0.01184796,0.000827655],"about_ca_topic_score_codex":0.00011450287,"about_ca_topic_score_gemma":0.00006343168,"teacher_disagreement_score":0.2968522,"about_ca_system_score_codex":0.0002415138,"about_ca_system_score_gemma":0.0007356839,"threshold_uncertainty_score":0.99993265},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000121471,0.00007185526,0.9974992,0.00020753236,0.000627588,0.0013989793,0.000010667712,0.000023122955,0.00003955345],"genre_scores_gemma":[0.009570953,0.000005387472,0.990165,0.000049484337,0.00008798259,0.00006131636,0.0000020360355,0.00001593361,0.00004193536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701416,0.00013387001,0.0006238594,0.0007668142,0.0011801288,0.00028117112],"domain_scores_gemma":[0.99575263,0.0020751406,0.00045970705,0.001064081,0.00059701543,0.000051406423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033551336,0.00022747176,0.00040700953,0.00045192242,0.000091752074,0.00010153578,0.0018407231,0.00012937342,0.0000023504476],"category_scores_gemma":[0.000709287,0.00016493307,0.00014849102,0.0010217882,0.00037008015,0.00026965883,0.00070314715,0.0003022756,0.0000012243289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013095004,0.000024358094,0.000033093194,0.00002585033,0.000004135235,1.4726743e-7,0.00017682009,0.12868057,0.00012937354,0.003256101,0.0000018246108,0.8676664],"study_design_scores_gemma":[0.0002050694,0.00007624682,0.0006372777,0.0003560577,0.000013051426,0.0000013531509,2.2261402e-7,0.8215513,0.002470474,0.17431942,0.0002208142,0.00014869787],"about_ca_topic_score_codex":0.000026772277,"about_ca_topic_score_gemma":0.000021182715,"teacher_disagreement_score":0.8675177,"about_ca_system_score_codex":0.00018709784,"about_ca_system_score_gemma":0.0005251013,"threshold_uncertainty_score":0.67257756},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006368908,0.000012310001,0.9883128,0.00017835724,0.0014118879,0.008142944,0.0000046094447,0.0006270455,0.0006731754],"genre_scores_gemma":[0.87465304,0.000004011416,0.122399926,0.0003883249,0.0010292694,0.0007845404,0.0000069553894,0.0000839553,0.0006499537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947887,0.000096297044,0.0006879943,0.0022855096,0.0013304311,0.0008110786],"domain_scores_gemma":[0.9972956,0.0006088027,0.0005116983,0.0011042904,0.00028049175,0.00019909181],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011396771,0.0006921808,0.0007405373,0.0009652321,0.00036053767,0.0008285533,0.003268513,0.0005327186,0.0000353322],"category_scores_gemma":[0.00014768908,0.00062744983,0.00032186793,0.0011470051,0.00040317271,0.00063195993,0.0008514444,0.0013629069,0.00018410834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013413539,0.000021473039,0.0000010730386,0.000022108625,0.000026766264,0.00008667183,0.00057245576,0.122000545,0.00022778695,0.0021359534,0.000006966644,0.8748848],"study_design_scores_gemma":[0.0003030109,0.0001552363,0.000060165832,0.00034659673,0.00001489787,0.000018141951,2.2849571e-7,0.9919292,0.0019724725,0.0040062736,0.0005328112,0.0006610088],"about_ca_topic_score_codex":0.00009923868,"about_ca_topic_score_gemma":0.0012235647,"teacher_disagreement_score":0.87422377,"about_ca_system_score_codex":0.00043106612,"about_ca_system_score_gemma":0.00039877972,"threshold_uncertainty_score":0.9996177},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001276387,0.0018747434,0.9845754,0.0015822311,0.0024442854,0.00063407747,0.0000024944597,0.000056049757,0.007554351],"genre_scores_gemma":[0.90470684,0.0008159951,0.08293659,0.0033616927,0.0060727955,0.00007106575,0.0000933207,0.000084131476,0.0018575623],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710435,0.000033858767,0.00079805293,0.0008647012,0.0006090259,0.0005899875],"domain_scores_gemma":[0.99848104,0.00048457808,0.00017065373,0.00051097124,0.0002263894,0.00012637503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007238588,0.00029217216,0.0004602949,0.0009256922,0.00010692799,0.00008140316,0.00044897603,0.00033142703,0.0000438592],"category_scores_gemma":[0.000301981,0.00026966448,0.000075041884,0.001184767,0.00065727736,0.0002642943,0.00010505492,0.00091954274,0.00008502609],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024255116,0.00008107369,0.00091833255,0.00011374385,8.197554e-7,0.000049802584,0.0005619832,0.015438293,0.000022742706,0.0005347562,0.00006397179,0.98219025],"study_design_scores_gemma":[0.00003235007,0.0005721349,0.00063850044,0.002465667,0.000018430885,0.00009479322,0.000007202255,0.14873274,0.012837364,0.82481295,0.009022469,0.000765401],"about_ca_topic_score_codex":0.0002875866,"about_ca_topic_score_gemma":0.0022010482,"teacher_disagreement_score":0.9814248,"about_ca_system_score_codex":0.0008839522,"about_ca_system_score_gemma":0.0021276122,"threshold_uncertainty_score":0.99997556},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057945676,0.000031165204,0.99794847,0.00036757038,0.00022378085,0.00037563787,0.000030463694,0.000080012185,0.00088495185],"genre_scores_gemma":[0.9583679,0.000008780527,0.03847685,0.00023076573,0.0007380654,0.000049566726,0.000039402294,0.00005624485,0.0020324672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829745,0.00001593205,0.00030855692,0.0005943503,0.00035868547,0.000425038],"domain_scores_gemma":[0.9986877,0.00045729126,0.0001407187,0.00048909266,0.0001597711,0.0000654344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057069573,0.00029058257,0.00032205673,0.00017279657,0.00040422988,0.0002804758,0.00080868043,0.00008394956,0.000010731745],"category_scores_gemma":[0.000005242966,0.0002161502,0.00020429137,0.00024202798,0.0004177821,0.00009453328,0.00021294843,0.000409396,0.000006277993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008751097,0.0000119648785,0.000023351466,0.0000050805797,0.00003420047,0.0000018172021,0.00015723167,0.26050338,0.000023571773,0.0173344,0.00010528662,0.72179097],"study_design_scores_gemma":[0.000075881144,0.000020616317,0.000006044504,0.00006853262,0.000013800256,3.498748e-7,1.1410449e-7,0.6862917,0.0001633005,0.31279418,0.0004014955,0.00016399955],"about_ca_topic_score_codex":0.000023434726,"about_ca_topic_score_gemma":0.00012714314,"teacher_disagreement_score":0.95947164,"about_ca_system_score_codex":0.00009981128,"about_ca_system_score_gemma":0.00018083423,"threshold_uncertainty_score":0.881435},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009863224,0.0010824705,0.99342114,0.0013198124,0.0029527713,0.0006848827,0.000021274964,0.00025756544,0.00025023875],"genre_scores_gemma":[0.013035914,0.0007342073,0.9753412,0.0040992266,0.0018330073,0.00025319503,0.000015227796,0.00012325057,0.0045647696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967034,0.000056083554,0.00036470147,0.0014340023,0.000680237,0.0007615614],"domain_scores_gemma":[0.99580014,0.0024257507,0.00016921447,0.0012805769,0.00018077357,0.00014353172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001924415,0.0004489651,0.0004181085,0.0006995401,0.0006492154,0.00079975964,0.004098347,0.00024233302,0.0000012257034],"category_scores_gemma":[0.000082809056,0.00031287974,0.00017069328,0.0016084859,0.001096496,0.00063608796,0.0014224323,0.00062292,0.000009013899],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004124936,0.000017731809,0.0000028495936,0.000049909424,0.000023314951,0.000025111318,0.0010100149,0.07990504,0.000016716634,0.0630809,0.00035553722,0.85550874],"study_design_scores_gemma":[0.00013524132,0.00005846323,0.000008159592,0.000070739065,0.000005928234,0.000020365425,2.313888e-7,0.52533686,0.000043054446,0.47364733,0.00045138432,0.00022221901],"about_ca_topic_score_codex":0.0000058166065,"about_ca_topic_score_gemma":0.000025471265,"teacher_disagreement_score":0.85528654,"about_ca_system_score_codex":0.00008477134,"about_ca_system_score_gemma":0.00065618305,"threshold_uncertainty_score":0.99993235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004212152,0.000017925,0.9923579,0.000068599,0.0002522334,0.00023924962,0.000008243507,0.00014527234,0.002698412],"genre_scores_gemma":[0.98391473,0.0000018856188,0.01559794,0.00012032467,0.0002148391,0.000014900453,0.00002452976,0.00003112311,0.00007971573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982271,0.000095283816,0.00035750706,0.0005557235,0.00039273856,0.00037164462],"domain_scores_gemma":[0.9983587,0.00041007946,0.00015625932,0.00091015414,0.000100282836,0.00006450599],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009805412,0.0003251314,0.00042968694,0.00092499185,0.0002583291,0.00012870703,0.00096264674,0.00014662699,0.000044137578],"category_scores_gemma":[0.000015341564,0.00033366866,0.00017366304,0.00089425733,0.00034798754,0.00011090951,0.00045460078,0.0014999078,0.000013593146],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008206741,0.000083366445,0.004471592,0.000022263988,0.0000211505,0.000009343604,0.00017818664,0.07640299,0.00029733666,0.004291605,0.000009180674,0.9142048],"study_design_scores_gemma":[0.00015856946,0.000056236913,0.0022273792,0.00020254946,0.000013035097,6.183161e-7,3.4161147e-7,0.5395612,0.0020466244,0.45517373,0.0001622488,0.00039747165],"about_ca_topic_score_codex":0.001387278,"about_ca_topic_score_gemma":0.002753997,"teacher_disagreement_score":0.9797026,"about_ca_system_score_codex":0.00015526422,"about_ca_system_score_gemma":0.00012747952,"threshold_uncertainty_score":0.99991155},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007491782,0.00025457414,0.99435854,0.00038573844,0.002989065,0.0008191529,0.000017532133,0.00030503582,0.000121157434],"genre_scores_gemma":[0.07145507,0.000029009132,0.92732936,0.00072324835,0.0002711914,0.000026348142,0.000008423428,0.00007444561,0.00008287824],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949438,0.000039197872,0.0008563696,0.0018804929,0.0013179394,0.00096220855],"domain_scores_gemma":[0.99432063,0.0027129163,0.00062298565,0.001639853,0.000524923,0.00017869429],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009913477,0.0006645782,0.00083064736,0.001033004,0.00033461105,0.0002727139,0.0043415655,0.00048659003,0.000007780149],"category_scores_gemma":[0.0005098663,0.00061260856,0.0003423549,0.0016114017,0.0008075609,0.0006326637,0.0014396858,0.0010494259,0.000007081574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020237265,0.000008009574,0.000085662236,0.00012766285,0.00002476256,0.000023902203,0.0007095131,0.23012134,0.00040909075,0.288005,0.000010307832,0.4804545],"study_design_scores_gemma":[0.00017012077,0.00015452788,0.00007712599,0.0004573191,0.000007774157,0.000009949641,1.627389e-7,0.46746948,0.00061818084,0.5306638,0.00001265542,0.000358878],"about_ca_topic_score_codex":0.0000073497445,"about_ca_topic_score_gemma":0.000015413107,"teacher_disagreement_score":0.48009562,"about_ca_system_score_codex":0.00013311434,"about_ca_system_score_gemma":0.00029742048,"threshold_uncertainty_score":0.99963254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22454199,0.0043073623,0.74976593,0.0007360647,0.0030610254,0.0011896319,0.000017457332,0.00052641355,0.015854113],"genre_scores_gemma":[0.99868315,0.000030648993,0.00024962242,0.00012650693,0.00040955457,0.0000044406024,0.000003884853,0.000010637217,0.0004815761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884886,0.000004888433,0.00030351905,0.0005004523,0.00015561489,0.00018666475],"domain_scores_gemma":[0.9992867,0.0001270129,0.00028688085,0.00022514787,0.00006331329,0.000010937371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005951939,0.00016935338,0.00042328238,0.00051057537,0.000050894494,0.0003031358,0.00039610188,0.00018794024,0.000005667373],"category_scores_gemma":[0.00008218855,0.00013416982,0.000037316542,0.00041891763,0.00042760896,0.00021875414,0.00079492136,0.00023067831,0.000013453559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027977167,0.00011046249,0.18309669,0.007917798,0.00028943922,0.00015497422,0.00076050765,0.0110991495,0.00007825523,0.16279593,0.0031856003,0.6304832],"study_design_scores_gemma":[0.00022865823,0.000027256012,0.0035497032,0.0009097211,0.000044931774,0.000008144935,0.0000031150576,0.8194495,0.000013653986,0.17104909,0.004280373,0.00043585716],"about_ca_topic_score_codex":0.0011413418,"about_ca_topic_score_gemma":0.00028066259,"teacher_disagreement_score":0.8083503,"about_ca_system_score_codex":0.000043598822,"about_ca_system_score_gemma":0.000025202655,"threshold_uncertainty_score":0.5471287},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040921597,0.00004337878,0.9891229,0.00065722683,0.003704806,0.0003558704,0.000006036544,0.00016013558,0.0018574648],"genre_scores_gemma":[0.94703156,0.00001952334,0.052122425,0.00031976518,0.00026200456,0.000007925145,0.0000026361472,0.000025512983,0.00020863082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969256,0.00007344707,0.0005083761,0.0009981721,0.0009588199,0.0005355732],"domain_scores_gemma":[0.99732816,0.00041928663,0.0004214138,0.0015173161,0.00021384751,0.00009996524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014528743,0.0003867476,0.00037472296,0.00080903585,0.00040927943,0.00030004588,0.0043130536,0.00026510903,0.000017000257],"category_scores_gemma":[0.00011344443,0.0002947218,0.00021911219,0.0014042672,0.00060422235,0.0006274576,0.0019560906,0.00064338924,0.000020092979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013034002,0.000033093656,0.00021922318,0.00005823714,0.000024272822,0.0000075229495,0.0013964701,0.007086729,0.0017373976,0.56197417,0.000015388934,0.42743447],"study_design_scores_gemma":[0.0002736386,0.00018547842,0.0019881416,0.00039356665,0.000010521291,0.000018783965,2.0543831e-7,0.5402364,0.005159395,0.4508433,0.00035881047,0.0005317073],"about_ca_topic_score_codex":0.00001551157,"about_ca_topic_score_gemma":0.000027459142,"teacher_disagreement_score":0.9429394,"about_ca_system_score_codex":0.0001111031,"about_ca_system_score_gemma":0.00041985698,"threshold_uncertainty_score":0.99995047},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018262932,0.0005265759,0.98794365,0.0041003968,0.0013084259,0.00028436017,0.000016518732,0.0010787409,0.0045586964],"genre_scores_gemma":[0.2408166,0.0012065426,0.7332635,0.0064270357,0.0017258772,0.0002815568,0.000034369183,0.00026796455,0.015976587],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952725,0.000036978156,0.00061667134,0.0021612942,0.0009351577,0.0009773909],"domain_scores_gemma":[0.99603945,0.00055425667,0.00031020865,0.0026261637,0.0002620553,0.00020787328],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012987135,0.0006403576,0.0006378307,0.0015266815,0.00046281007,0.0003297206,0.005994351,0.00078428537,0.000022711078],"category_scores_gemma":[0.00010861303,0.0006253565,0.00017575879,0.0015829677,0.0012548115,0.00016019972,0.0027352707,0.0014982269,0.00031768452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001868766,0.000031524924,0.00001977749,0.000044603297,0.000013524205,0.00011072658,0.0006569076,0.0039626816,0.00006184485,0.360231,0.0000924708,0.6347731],"study_design_scores_gemma":[0.0002309442,0.00010532248,0.00004166934,0.00031650747,0.000007300441,0.000086089596,3.6019117e-7,0.44259235,0.0008808561,0.5517883,0.0031673412,0.0007829569],"about_ca_topic_score_codex":0.000049418235,"about_ca_topic_score_gemma":0.0002250079,"teacher_disagreement_score":0.6339901,"about_ca_system_score_codex":0.0002737062,"about_ca_system_score_gemma":0.000518499,"threshold_uncertainty_score":0.9996198},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017204179,0.00047630648,0.9897621,0.000025670282,0.006366253,0.00017843532,0.000017992916,0.0006615759,0.00079119566],"genre_scores_gemma":[0.04524846,0.00010297009,0.94897276,0.001405366,0.0021349974,0.0000468364,0.00006838129,0.00033053418,0.0016896796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982866,0.000039684393,0.00031036677,0.0005445029,0.00034604658,0.00047280823],"domain_scores_gemma":[0.9987259,0.0005512416,0.00005973694,0.0005177114,0.00005774551,0.00008768792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072715903,0.0003361656,0.0004113565,0.0004607797,0.00006225811,0.0002610171,0.00081453123,0.00019867645,0.000038905982],"category_scores_gemma":[0.000056313685,0.00030119834,0.000062661034,0.0005547141,0.00021146135,0.000120494864,0.00014862634,0.00036463275,0.00008567668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030186832,0.000006806169,0.00001534455,0.000310053,0.000013963992,0.000056809386,0.000322466,0.7055599,0.014276594,0.000025088088,0.00052400783,0.2788859],"study_design_scores_gemma":[0.00024031848,0.00006549143,0.00011189569,0.0004604427,0.000012571393,0.000011240888,1.4108649e-7,0.8568839,0.091317214,0.04461173,0.0053998153,0.00088526536],"about_ca_topic_score_codex":0.000019605386,"about_ca_topic_score_gemma":0.00004863802,"teacher_disagreement_score":0.27800065,"about_ca_system_score_codex":0.0002764626,"about_ca_system_score_gemma":0.0003215356,"threshold_uncertainty_score":0.99994403},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004042692,0.000057563804,0.9953018,0.00007594117,0.0018090046,0.00049026223,0.000008737637,0.0012374914,0.0009787624],"genre_scores_gemma":[0.01454022,0.000007587472,0.9845977,0.000208312,0.00030034047,0.000020866792,0.000007904278,0.000069457914,0.0002476025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952777,0.0000880173,0.00053320813,0.0019881432,0.0013692629,0.00074363983],"domain_scores_gemma":[0.99629307,0.00035577486,0.0004038423,0.002141128,0.0005738768,0.00023228879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016954149,0.0005902258,0.00055655255,0.0009620625,0.0003755865,0.0006825826,0.004189953,0.00034734138,0.0000027235617],"category_scores_gemma":[0.00008371509,0.00050267635,0.00008538237,0.0011114433,0.00059795333,0.0014228893,0.0009482172,0.00089893385,0.000087807886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005436227,0.000010452207,0.000006841193,0.000069034955,0.00000803287,0.00007539379,0.0008555031,0.7648865,0.0000044075987,0.07796572,0.0000017837817,0.15611087],"study_design_scores_gemma":[0.0001362204,0.00029181904,0.000019114763,0.00074762164,0.000007753051,0.00010731017,8.603875e-7,0.9714338,0.000346861,0.02623686,0.00006959304,0.0006021419],"about_ca_topic_score_codex":0.000047488404,"about_ca_topic_score_gemma":0.000028754064,"teacher_disagreement_score":0.20654732,"about_ca_system_score_codex":0.0005588452,"about_ca_system_score_gemma":0.0006156215,"threshold_uncertainty_score":0.9997425},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024813353,0.000053786473,0.99227893,0.00045685522,0.0030062676,0.0008171279,0.000012526474,0.0005588616,0.0027908245],"genre_scores_gemma":[0.00060719176,0.000056271434,0.9959829,0.0004782186,0.0005026404,0.000043007727,0.0000128587135,0.00006531483,0.002251584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559855,0.000053783515,0.00063055434,0.0019248616,0.0010056383,0.0007865899],"domain_scores_gemma":[0.99598205,0.00091353396,0.00039360832,0.0020970975,0.00043536726,0.0001783689],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025425646,0.0005221564,0.0005714719,0.0010024644,0.00032376483,0.00046107572,0.0036944132,0.00040383774,0.000012010146],"category_scores_gemma":[0.00047412017,0.00049197365,0.0001854482,0.0008818424,0.0005145794,0.0007215862,0.0013910334,0.00053261156,0.00028080356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001423057,0.000020744112,0.0000025435309,0.000065454085,0.0000095559235,0.000030602896,0.0004283473,0.009987832,0.0021323746,0.115589805,0.00018691878,0.8715316],"study_design_scores_gemma":[0.00019838606,0.00024864727,0.000095008065,0.0002982312,0.0000073539713,0.000037848855,7.261584e-8,0.7637393,0.0020571894,0.23095258,0.0018162829,0.0005491195],"about_ca_topic_score_codex":0.0000149997595,"about_ca_topic_score_gemma":0.0000106128655,"teacher_disagreement_score":0.87098247,"about_ca_system_score_codex":0.00030660155,"about_ca_system_score_gemma":0.00046285245,"threshold_uncertainty_score":0.9997532},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000051358056,0.0005987386,0.99495506,0.000066703,0.0009673061,0.00030042007,0.0000042636234,0.00045291393,0.0026494693],"genre_scores_gemma":[0.00028815566,0.000077380784,0.998072,0.00019893446,0.00068019977,0.000077012744,0.000009069289,0.000063505024,0.0005337112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840206,0.000058899634,0.00027040535,0.00058810966,0.00029349822,0.0003870173],"domain_scores_gemma":[0.997664,0.0016279882,0.000042940166,0.00052130496,0.000040791365,0.00010299903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010373646,0.00026962123,0.0003227031,0.00047800943,0.00008586849,0.00011859414,0.00063718425,0.0002011714,0.000009745699],"category_scores_gemma":[0.000117521944,0.00026927536,0.000042602904,0.0010775303,0.00025970105,0.00008541311,0.00024679818,0.00059496996,0.000035703826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.4797048e-7,0.0000031415207,0.000027559649,0.00006741156,0.0000073352107,0.000004067676,0.00012954566,0.096664384,0.000093472554,0.00019798789,0.00015031637,0.9026544],"study_design_scores_gemma":[0.00011360667,0.00003221967,0.0002917548,0.00010893917,0.000013545679,0.00001751358,1.5364637e-7,0.87963426,0.0013957793,0.08793443,0.029947694,0.00051008095],"about_ca_topic_score_codex":0.000002489048,"about_ca_topic_score_gemma":0.00000390264,"teacher_disagreement_score":0.9021444,"about_ca_system_score_codex":0.00021146712,"about_ca_system_score_gemma":0.00013686753,"threshold_uncertainty_score":0.9999759},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013282149,0.00077514903,0.9956646,0.0013865042,0.00075604446,0.00064827304,0.000010146978,0.0004539362,0.0001725308],"genre_scores_gemma":[0.12979525,0.000018159364,0.8680773,0.0009411816,0.0004267408,0.00004154788,0.000008190865,0.00005820931,0.0006334669],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975938,0.00003649021,0.0004351505,0.00097551907,0.0004995559,0.0004594898],"domain_scores_gemma":[0.9970787,0.00088227045,0.00038523925,0.001276085,0.000304784,0.00007287988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00116491,0.00036900252,0.0003894811,0.0006496565,0.00029881592,0.00031939367,0.0029074291,0.00032415017,0.0000029746923],"category_scores_gemma":[0.0002522582,0.00025960698,0.00014874131,0.0008160922,0.00062998204,0.000330118,0.0010323531,0.00068932923,0.0000052379637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074015634,0.000015032785,0.0000018704267,0.00011883689,0.000016622726,0.00031653477,0.0015016056,0.0026172602,0.0007713918,0.1235068,0.00007693901,0.8710497],"study_design_scores_gemma":[0.00022733734,0.00022178558,0.0000064117617,0.0004617956,0.000019849464,0.00089110865,0.000004361212,0.17877595,0.011936583,0.8065532,0.00034462565,0.00055702584],"about_ca_topic_score_codex":0.00014116013,"about_ca_topic_score_gemma":0.00022708839,"teacher_disagreement_score":0.8704927,"about_ca_system_score_codex":0.00015680343,"about_ca_system_score_gemma":0.00026976966,"threshold_uncertainty_score":0.99998564},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000066176246,0.00007215987,0.99125123,0.0030735456,0.0017635837,0.0011749638,0.0000013651226,0.0003088076,0.0022881748],"genre_scores_gemma":[0.009004936,0.000043422868,0.9599958,0.009298513,0.00721173,0.0002551808,0.000036356847,0.00014726355,0.01400677],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953159,0.000014368499,0.00040545058,0.0014505574,0.0014967878,0.0013169047],"domain_scores_gemma":[0.9971736,0.00073620316,0.00023539632,0.00058649096,0.0012414089,0.000026893636],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.011401893,0.00037001184,0.00040743494,0.0010457531,0.0020059769,0.00090851774,0.0030963277,0.0005390266,0.000009887352],"category_scores_gemma":[0.0008325843,0.0003472412,0.00017154886,0.007982832,0.005063098,0.00083784905,0.0026699712,0.0013411046,0.000098627104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031728483,0.00009078444,0.00013142962,0.0006042038,0.0000750767,0.000015482665,0.0046459334,0.0044782306,0.0007878694,0.1130395,0.14905763,0.72704214],"study_design_scores_gemma":[0.00035018031,0.00003654182,0.000111387075,0.0002717442,0.000010720005,0.0000013861273,0.00001220169,0.1288669,0.00092637853,0.84979784,0.019040307,0.00057442934],"about_ca_topic_score_codex":0.000033936733,"about_ca_topic_score_gemma":0.00001602441,"teacher_disagreement_score":0.73675835,"about_ca_system_score_codex":0.0010594336,"about_ca_system_score_gemma":0.0047556018,"threshold_uncertainty_score":0.99989796},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30510604,0.00085088063,0.3461614,0.25053075,0.047736898,0.021018513,0.0005168377,0.001394685,0.02668402],"genre_scores_gemma":[0.994315,0.000020277297,0.0008134455,0.004110728,0.000117415824,0.00003996977,0.0000010415771,0.000026689337,0.00055543106],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969809,0.0002036273,0.00054196996,0.0012459886,0.0006058911,0.000421618],"domain_scores_gemma":[0.9975324,0.0012972187,0.00023747286,0.00074871664,0.00013035529,0.000053788823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009624893,0.0003562785,0.00047454992,0.0005382499,0.00020536287,0.00007427639,0.0017541632,0.0000889113,0.0000065102086],"category_scores_gemma":[0.0003860872,0.00024001356,0.00008471314,0.0009804447,0.0008025141,0.00014104706,0.0006800223,0.0007746965,0.000096973745],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021813485,0.00026893927,0.00041456043,0.00016604092,0.000015971693,0.00032665147,0.015793344,0.0090128295,0.06769665,0.008155628,0.0019872203,0.895944],"study_design_scores_gemma":[0.0064451913,0.013136373,0.016767817,0.016411342,0.00044289924,0.0018630442,0.00063043786,0.081418484,0.75873315,0.0705747,0.02386641,0.009710145],"about_ca_topic_score_codex":0.00005567117,"about_ca_topic_score_gemma":0.00030187634,"teacher_disagreement_score":0.88623387,"about_ca_system_score_codex":0.00011889292,"about_ca_system_score_gemma":0.000073157156,"threshold_uncertainty_score":0.9787469},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036392812,0.00021532556,0.9877676,0.0018491409,0.0012193713,0.00030824915,0.000011829232,0.00023823808,0.008026322],"genre_scores_gemma":[0.9726397,0.00006128333,0.022250673,0.0036187489,0.0003061064,0.000013942795,0.0000034961508,0.00005375398,0.0010523227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706846,0.000048339432,0.00041564647,0.0010098254,0.0009675513,0.00049016863],"domain_scores_gemma":[0.9950818,0.0025867468,0.0003001059,0.0018023623,0.0001424091,0.00008660035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001123095,0.00039482868,0.00042718797,0.0004679697,0.0001742248,0.00026744299,0.0048011844,0.00019484584,0.000034076133],"category_scores_gemma":[0.00028695044,0.00026354243,0.00013649595,0.00069199485,0.0008064932,0.00025737818,0.001271472,0.0006303974,0.00011200478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031783668,0.00001805928,0.000022947963,0.000023656257,0.000011847617,0.000076433826,0.0005484771,0.0055129295,0.00016837049,0.78739333,0.000104679195,0.20611611],"study_design_scores_gemma":[0.00013649827,0.00018741006,0.00019574712,0.0005716499,0.000005823822,0.000013580465,0.0000011981244,0.23646611,0.0033668147,0.7584573,0.00015874235,0.00043911987],"about_ca_topic_score_codex":0.000034423272,"about_ca_topic_score_gemma":0.000047895333,"teacher_disagreement_score":0.97227573,"about_ca_system_score_codex":0.00009000591,"about_ca_system_score_gemma":0.0002824415,"threshold_uncertainty_score":0.9999817},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.0203804e-7,0.000074215895,0.9950556,0.0005981808,0.0007854738,0.00067089027,0.0000058970027,0.0004216695,0.0023876622],"genre_scores_gemma":[0.0006832529,0.0000884773,0.9968844,0.0002098256,0.00017728824,0.000027514918,0.000014603042,0.00005586518,0.0018587823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952988,0.00006942703,0.00047085356,0.0015499777,0.0017390013,0.0008719557],"domain_scores_gemma":[0.9969619,0.0005656913,0.00027255106,0.0012800188,0.0006765632,0.00024329219],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014741052,0.00045206476,0.00042499273,0.00150635,0.0005866203,0.0009077237,0.0028736673,0.00023619013,0.000052268744],"category_scores_gemma":[0.00023684272,0.00039332753,0.00007288697,0.0019276384,0.00072456815,0.0008258764,0.001725087,0.00076099014,0.00012723454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021020126,0.000014363209,0.000008083172,0.000023615341,0.000011237462,0.00006723796,0.00028417123,0.91663533,0.000008560627,0.0068875444,0.000022965454,0.07603479],"study_design_scores_gemma":[0.00025837927,0.00014853351,0.0000099777435,0.00029552582,0.000008594464,0.000040146875,2.8217408e-7,0.9846339,0.00007633634,0.013933365,0.00012763144,0.0004673052],"about_ca_topic_score_codex":0.00002195418,"about_ca_topic_score_gemma":0.000040242376,"teacher_disagreement_score":0.075567484,"about_ca_system_score_codex":0.00032053536,"about_ca_system_score_gemma":0.0009844897,"threshold_uncertainty_score":0.9998519},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010658894,0.00006437819,0.9898393,0.00089117547,0.006656975,0.0013950866,0.000038359656,0.00041037187,0.000703294],"genre_scores_gemma":[0.0017074547,0.000013318394,0.99610937,0.000441659,0.0009935583,0.00010918591,0.00001462216,0.000071882765,0.0005389319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955551,0.00004174532,0.00057701836,0.0017010496,0.0012384065,0.00088669895],"domain_scores_gemma":[0.995939,0.0016727906,0.00041215663,0.0013396256,0.00046384393,0.0001725724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014822953,0.0006433497,0.0005898295,0.00063101755,0.0005661254,0.0008157094,0.0037778148,0.00034202568,0.000004973636],"category_scores_gemma":[0.00008579572,0.0004401172,0.0001513825,0.0008804797,0.0016019375,0.0004723757,0.0010734167,0.0009841584,0.000048034122],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068954528,0.00002219763,0.0000065023382,0.000026010346,0.000043496362,0.000067325964,0.00077148835,0.036721945,0.0000070426927,0.011035769,0.0000824074,0.9512089],"study_design_scores_gemma":[0.0007541684,0.0005011818,0.000044365675,0.0006138171,0.000022848784,0.00019620391,8.678962e-7,0.90573186,0.00010974319,0.09101421,0.00044052888,0.0005701821],"about_ca_topic_score_codex":0.000022329908,"about_ca_topic_score_gemma":0.0000132526275,"teacher_disagreement_score":0.9506387,"about_ca_system_score_codex":0.0003173513,"about_ca_system_score_gemma":0.00090177346,"threshold_uncertainty_score":0.99980503},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007665782,0.00030818363,0.97901535,0.0000821187,0.0017658046,0.0002232194,0.000053097658,0.00007889691,0.010807546],"genre_scores_gemma":[0.99254864,0.000027696373,0.0057575456,0.00007831123,0.0001598056,0.0000029939504,0.000009577323,0.000038026734,0.0013774068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984009,0.000011880458,0.0006615326,0.00058234326,0.000093422954,0.0002499019],"domain_scores_gemma":[0.99866664,0.000279718,0.0005234049,0.00042391894,0.0000645989,0.000041709172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014236363,0.00019809748,0.0004935925,0.0006881842,0.00006866203,0.00007430888,0.000518342,0.00017492988,0.000050634957],"category_scores_gemma":[0.00015642805,0.00021526328,0.00008054992,0.0003483711,0.0003118372,0.00014005108,0.00013571288,0.0002646038,0.00013431876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007528103,0.000018333563,0.0013199213,0.00024740794,0.000023040366,0.000008493666,0.004483572,0.07084124,0.00012601475,0.9040202,0.000008332624,0.018895948],"study_design_scores_gemma":[0.0001275169,0.00005935001,0.00036033572,0.00039654406,0.000002498636,0.0000046726523,0.0000012606097,0.033633877,0.00031763164,0.9644417,0.000353304,0.00030128795],"about_ca_topic_score_codex":0.0000821672,"about_ca_topic_score_gemma":0.00004730483,"teacher_disagreement_score":0.98488283,"about_ca_system_score_codex":0.00010097681,"about_ca_system_score_gemma":0.0000471091,"threshold_uncertainty_score":0.87781817},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012635854,0.00039301367,0.9925368,0.00042852465,0.0025417898,0.000274393,0.0000032014602,0.00039275177,0.0033031972],"genre_scores_gemma":[0.040961064,0.00009289747,0.9568837,0.00072104443,0.00041571792,0.000010377134,0.0000034909363,0.00005052992,0.0008611736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964896,0.00005875791,0.0005012046,0.0014586587,0.0008977659,0.00059402786],"domain_scores_gemma":[0.99723583,0.00076788204,0.0002845373,0.0014011154,0.00015328954,0.00015733587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013718902,0.0004530608,0.00047990927,0.00083859375,0.00037253593,0.00096522114,0.0028391206,0.00030086385,0.0000066817474],"category_scores_gemma":[0.00022689358,0.00042862364,0.000088149616,0.00069589,0.0010464567,0.0009052634,0.0016602427,0.0007439418,0.00007023101],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027160643,0.000008411312,0.000034454613,0.000037396596,0.00000686493,0.000025117382,0.00065559667,0.0072277193,0.00035752862,0.100440145,0.0000096720005,0.8911944],"study_design_scores_gemma":[0.00017058509,0.00008538574,0.0009252818,0.00041664488,0.0000064389055,0.00005226822,1.1968501e-7,0.66260266,0.0016861322,0.33242196,0.0010495909,0.0005829454],"about_ca_topic_score_codex":0.000020876816,"about_ca_topic_score_gemma":0.000046688532,"teacher_disagreement_score":0.8906114,"about_ca_system_score_codex":0.00017415782,"about_ca_system_score_gemma":0.00026173546,"threshold_uncertainty_score":0.99981654},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023951777,0.00023058499,0.990305,0.001042604,0.0031628662,0.00060589536,0.000022505457,0.0015416587,0.0028493386],"genre_scores_gemma":[0.17776838,0.0003032324,0.8130048,0.0015615288,0.0009560025,0.00009223715,0.000035557467,0.00021296575,0.0060653025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99357,0.000120762044,0.0006389847,0.0024479395,0.0018176957,0.0014045854],"domain_scores_gemma":[0.99423444,0.0019448128,0.00028012268,0.0027925633,0.00045756684,0.0002905016],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017801002,0.00073037203,0.00075404695,0.0016921464,0.0005560766,0.0006358276,0.0072788023,0.0004353163,0.000027648766],"category_scores_gemma":[0.0006572328,0.0006541649,0.00023247059,0.0020046816,0.0021559338,0.0006780181,0.0048682215,0.0016381701,0.0002983066],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022338474,0.00009455632,0.000113833376,0.00007002219,0.00003051969,0.00048048387,0.0012144701,0.06803031,0.00029970345,0.15674378,0.00014537733,0.7727546],"study_design_scores_gemma":[0.00026965525,0.00019728848,0.00029585965,0.00024243814,0.0000048668016,0.000040607018,5.0551483e-7,0.51558155,0.002364791,0.4788673,0.0012724409,0.00086270546],"about_ca_topic_score_codex":0.000028823211,"about_ca_topic_score_gemma":0.00019368643,"teacher_disagreement_score":0.7718919,"about_ca_system_score_codex":0.00051021355,"about_ca_system_score_gemma":0.00060635793,"threshold_uncertainty_score":0.99959093},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006151831,0.00015000257,0.9908703,0.0005940686,0.0010326683,0.00075003284,0.0000054865977,0.00027905297,0.00016655779],"genre_scores_gemma":[0.3833566,0.000057903566,0.5921738,0.0011641777,0.001980078,0.00010524436,0.000031942353,0.00020473731,0.020925488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945947,0.00011004233,0.00074685825,0.0019463337,0.0017050663,0.0008970119],"domain_scores_gemma":[0.9976849,0.0008410566,0.0003567573,0.00067069463,0.00028246292,0.00016414378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002775579,0.00059085584,0.0007522112,0.0009777788,0.0005063936,0.0010126708,0.003120596,0.0002444611,0.0000074020118],"category_scores_gemma":[0.000472511,0.0005632328,0.00021809996,0.0009074784,0.0002533428,0.00033227314,0.0015251966,0.0013183213,0.000029611898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003572847,0.00050790183,0.024469396,0.00017492133,0.00012023382,0.0006664871,0.022065919,0.48246455,0.00011924956,0.0048472574,0.00008025936,0.4644481],"study_design_scores_gemma":[0.0010601495,0.00066643686,0.0005715347,0.0003970343,0.000015888247,0.000016270902,0.000011679353,0.99088615,0.000008511954,0.0051976843,0.00053006137,0.0006385806],"about_ca_topic_score_codex":0.000057452868,"about_ca_topic_score_gemma":0.00018475101,"teacher_disagreement_score":0.5084216,"about_ca_system_score_codex":0.00035024338,"about_ca_system_score_gemma":0.00060955837,"threshold_uncertainty_score":0.9996819},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049658325,0.0020411466,0.9377352,0.00017405192,0.031974852,0.0011376565,0.000010665342,0.0003806842,0.021579934],"genre_scores_gemma":[0.99479854,0.000043996133,0.0029927322,0.00017121827,0.0008591209,0.000037829715,0.000009421457,0.00009506374,0.0009920867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682975,0.00005669673,0.0006578352,0.0011736908,0.00055052276,0.0007315311],"domain_scores_gemma":[0.99833196,0.00059651776,0.00022146234,0.00067468407,0.000060787657,0.00011461221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009472308,0.0004394595,0.00046702175,0.001104711,0.00016029962,0.00018144742,0.00096383615,0.0005346787,0.00006623738],"category_scores_gemma":[0.000071043534,0.0004255061,0.000099596204,0.00071682606,0.00029230237,0.000110357745,0.00040730057,0.0013740163,0.00026999717],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018831133,0.000035109555,0.001832335,0.000025431405,0.000056564142,0.00041929993,0.008471087,0.0648008,0.00004801301,0.0065267,0.000029092806,0.9177367],"study_design_scores_gemma":[0.01172252,0.0040802746,0.008515814,0.09416062,0.0004168894,0.0013616241,0.00040899817,0.7581081,0.011107365,0.07601357,0.01210481,0.021999417],"about_ca_topic_score_codex":0.00038012423,"about_ca_topic_score_gemma":0.00031664097,"teacher_disagreement_score":0.9898327,"about_ca_system_score_codex":0.00047665962,"about_ca_system_score_gemma":0.000091461596,"threshold_uncertainty_score":0.9998197},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009069285,0.000032541742,0.99456185,0.00017151155,0.0020485334,0.0010764467,0.00002826706,0.00029052,0.0016996631],"genre_scores_gemma":[0.021763654,0.0000034226432,0.97391456,0.0007522854,0.0012126289,0.00006723997,0.000028799574,0.00006459343,0.002192822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956723,0.00006420995,0.0006694328,0.0017641502,0.0009815156,0.0008483935],"domain_scores_gemma":[0.99727964,0.0004702354,0.00037068618,0.0010576292,0.00056260364,0.00025919313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015310757,0.0005915344,0.000638439,0.00082844123,0.00052606885,0.00083019206,0.0028869237,0.0002497788,0.0000018642202],"category_scores_gemma":[0.000075800934,0.00053195225,0.00016348736,0.0006327674,0.00015012795,0.0008174742,0.0009185173,0.00079152826,0.000027962444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050365047,0.000051133313,0.000005508594,0.000043146498,0.000019208963,0.000009382018,0.002828064,0.5154713,0.00022400463,0.2083684,0.000016451062,0.2729584],"study_design_scores_gemma":[0.00017241329,0.0005887479,0.00006847197,0.0004184778,0.000005914779,0.00001561993,0.0000064018654,0.9816213,0.00032032674,0.014525214,0.001582854,0.0006742466],"about_ca_topic_score_codex":0.000035767924,"about_ca_topic_score_gemma":0.000035185683,"teacher_disagreement_score":0.46615005,"about_ca_system_score_codex":0.00054399925,"about_ca_system_score_gemma":0.00052928133,"threshold_uncertainty_score":0.9997132},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017180802,0.00033965404,0.9681645,0.00031326845,0.0042775096,0.00077797356,0.00005780863,0.0005413173,0.008347187],"genre_scores_gemma":[0.67082477,0.000010041449,0.31787273,0.00053470064,0.0021318006,0.000027481634,0.000115270865,0.00030784382,0.008175374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951373,0.0008228572,0.0005830567,0.0017277311,0.00083420094,0.0008948611],"domain_scores_gemma":[0.9961169,0.0016262706,0.000739892,0.00064831576,0.0007401527,0.00012846854],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0034468127,0.0007385482,0.0009166204,0.0013568148,0.000660198,0.000272809,0.0010774112,0.000642231,0.000081268525],"category_scores_gemma":[0.0007126913,0.00067127694,0.0001464006,0.001527876,0.0010192302,0.00017096088,0.0004932379,0.0030901518,0.00011931185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040091143,0.00030956577,0.0072971815,0.0010279212,0.00074574596,0.0023213995,0.17704046,0.055102248,0.0024931936,0.04659694,0.00021640098,0.706448],"study_design_scores_gemma":[0.009783084,0.009297983,0.027736945,0.034297027,0.0008657747,0.0031842156,0.0037804714,0.81925285,0.0059502614,0.057318076,0.011728122,0.016805172],"about_ca_topic_score_codex":0.00014393365,"about_ca_topic_score_gemma":0.0000392099,"teacher_disagreement_score":0.7641506,"about_ca_system_score_codex":0.00063813163,"about_ca_system_score_gemma":0.0004759643,"threshold_uncertainty_score":0.9995738},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042406037,0.000023318731,0.9751908,0.00020813447,0.005580574,0.00024749825,0.000007708028,0.00012937769,0.014371945],"genre_scores_gemma":[0.9607125,0.0000066234707,0.03472655,0.0004208381,0.00050822296,0.000007129146,0.000016452703,0.000053933614,0.0035477474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978361,0.00005242562,0.0005892518,0.0006647383,0.0005638133,0.00029365002],"domain_scores_gemma":[0.9985605,0.0002576028,0.00040554663,0.00049606204,0.00021970704,0.000060564995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006635502,0.00024786656,0.00035139604,0.00078929454,0.00014616521,0.00008777299,0.00048019478,0.00022287256,0.0007653493],"category_scores_gemma":[0.000032219195,0.0002439151,0.00013289893,0.00029193299,0.00028608472,0.00018045791,0.00015826437,0.000543223,0.00010374369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043302673,0.00027119453,0.006059401,0.00025317178,0.00019383497,0.00018985027,0.006165489,0.12141976,0.006207787,0.072631575,0.00018776812,0.7863769],"study_design_scores_gemma":[0.0012514292,0.00044530223,0.16404194,0.002306965,0.00007835377,0.00010580338,0.0000106795815,0.78779227,0.00041246583,0.03943694,0.0027517457,0.0013660918],"about_ca_topic_score_codex":0.00004104896,"about_ca_topic_score_gemma":0.000051917435,"teacher_disagreement_score":0.9564719,"about_ca_system_score_codex":0.00024201615,"about_ca_system_score_gemma":0.00015817583,"threshold_uncertainty_score":0.9946569},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020718982,0.00019973998,0.9915866,0.0013478537,0.0020157462,0.00038300472,0.0000012994062,0.0003403572,0.0020534922],"genre_scores_gemma":[0.85795766,0.00002427101,0.14074324,0.0006547606,0.00018871322,0.000010162846,7.560499e-7,0.000020259678,0.00040020028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722534,0.000042745505,0.0005041406,0.0008738782,0.00088902854,0.0004648365],"domain_scores_gemma":[0.9976088,0.0007125939,0.00037489968,0.0010967522,0.00015170142,0.0000552932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007787006,0.00031974431,0.0004500795,0.00034256553,0.00022310254,0.00018994915,0.003867453,0.0002431283,0.000006474498],"category_scores_gemma":[0.0006872243,0.00020204046,0.00014497299,0.00068737654,0.0008852907,0.00024406517,0.0017172183,0.0004884478,0.000019757481],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047579906,0.000057598118,0.0011022183,0.0003442619,0.000025698047,0.00007464598,0.002114075,0.011891419,0.00049773697,0.18569902,0.00010999456,0.7980786],"study_design_scores_gemma":[0.00017507933,0.00016538394,0.011048503,0.0011603803,0.000012463164,0.00009132662,8.738831e-7,0.5891628,0.0022008752,0.39546221,0.00006416345,0.00045590964],"about_ca_topic_score_codex":0.00002742253,"about_ca_topic_score_gemma":0.00019432911,"teacher_disagreement_score":0.85588574,"about_ca_system_score_codex":0.00011331805,"about_ca_system_score_gemma":0.0005436078,"threshold_uncertainty_score":0.8238971},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006916228,0.0015774735,0.9873987,0.00014426852,0.00862323,0.00060925016,0.000003063043,0.00053984235,0.0010350083],"genre_scores_gemma":[0.3608612,0.0021512283,0.35061294,0.001524971,0.011795821,0.0003923902,0.00004842545,0.0007349714,0.27187803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944036,0.00013021714,0.0009287691,0.002114653,0.0013162098,0.0011065698],"domain_scores_gemma":[0.9966874,0.00093531853,0.00042612627,0.0013343105,0.0003371269,0.0002796875],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021986354,0.00070436444,0.00077777245,0.0013819152,0.00042157198,0.0016139178,0.0031784892,0.0003554472,0.00000364387],"category_scores_gemma":[0.0002653897,0.0006530903,0.00012660108,0.0016125677,0.00043903317,0.0006631566,0.0023670087,0.0012431663,0.00018000562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005448184,0.00003854725,0.00020675253,0.00039702747,0.00004750865,0.00034782983,0.0034552852,0.31234232,0.00011420727,0.11531877,0.00009293679,0.5676334],"study_design_scores_gemma":[0.000108549924,0.00027666776,0.00010252111,0.0033965257,0.000012034908,0.00016970575,0.000005773098,0.95159286,0.0013159312,0.022090118,0.019680308,0.0012489768],"about_ca_topic_score_codex":0.00013233641,"about_ca_topic_score_gemma":0.00002494645,"teacher_disagreement_score":0.6392506,"about_ca_system_score_codex":0.00096844195,"about_ca_system_score_gemma":0.0007974603,"threshold_uncertainty_score":0.999592},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006797496,0.005020166,0.98711824,0.004378781,0.00048297658,0.00095517264,8.5961636e-7,0.0004586651,0.0015171864],"genre_scores_gemma":[0.53861725,0.019373925,0.36228502,0.009028552,0.0014273337,0.00025024405,0.00005458097,0.0005171269,0.068445936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558395,0.00031083,0.0007618669,0.0014194862,0.0012676022,0.0006562878],"domain_scores_gemma":[0.99723005,0.0011955982,0.0004537086,0.00065784703,0.00032633255,0.00013647717],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0049766772,0.000506237,0.0010847192,0.0010244077,0.00032220315,0.00048818957,0.001568546,0.00021157066,0.000003958498],"category_scores_gemma":[0.0021217435,0.00044956146,0.00011901226,0.0013278513,0.00023305637,0.00033503215,0.0014054753,0.0027918413,0.000063905856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008411292,0.000110073284,0.0014455535,0.13151425,0.00017255117,0.0011354163,0.014562677,0.5613233,0.000049649836,0.0291063,0.00009932795,0.26047248],"study_design_scores_gemma":[0.00020321128,0.0002677693,0.00010130854,0.08256115,0.00005107531,0.00006415166,0.000002751158,0.8971046,0.00001273363,0.018714515,0.00021851345,0.0006982096],"about_ca_topic_score_codex":0.000021459737,"about_ca_topic_score_gemma":0.000043127264,"teacher_disagreement_score":0.62483317,"about_ca_system_score_codex":0.0002721927,"about_ca_system_score_gemma":0.0003590037,"threshold_uncertainty_score":0.9997956},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024673097,0.00007145482,0.97191393,0.00039283338,0.0003867127,0.0006707924,0.000009996344,0.0003168463,0.0015643097],"genre_scores_gemma":[0.73228556,0.0000075595394,0.26689097,0.0006144179,0.000090138,0.000013831629,0.000003870855,0.000028840195,0.00006481694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99483466,0.000097313634,0.00096425484,0.0020894574,0.0010020963,0.0010122076],"domain_scores_gemma":[0.9962104,0.0018033934,0.0004724208,0.0009061065,0.00039284473,0.00021484421],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014482893,0.0006950115,0.0009830209,0.0013528531,0.00021875299,0.00035933565,0.0036040077,0.0004287412,0.0000031987204],"category_scores_gemma":[0.0021181803,0.00056871306,0.00010884463,0.0011193476,0.00057872536,0.0005375701,0.0020160924,0.0015060542,0.00000995671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003985745,0.000058933914,0.0005440799,0.00011892987,0.000010680414,0.00009818431,0.0060764123,0.5711822,0.00092465885,0.012263726,0.0000013523589,0.40868098],"study_design_scores_gemma":[0.00027373616,0.0005431494,0.00092034787,0.0020669922,0.000007918168,0.000026143698,0.000008623333,0.88353395,0.0012264783,0.1107318,0.0000025458426,0.0006582963],"about_ca_topic_score_codex":0.00015043927,"about_ca_topic_score_gemma":0.0033777913,"teacher_disagreement_score":0.70761245,"about_ca_system_score_codex":0.00017631748,"about_ca_system_score_gemma":0.00081181875,"threshold_uncertainty_score":0.9996764},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027116977,0.000059767044,0.97016025,0.00020844328,0.0018706019,0.00015577243,0.0000015074615,0.00033172904,0.00009496416],"genre_scores_gemma":[0.9749073,0.000029521476,0.024741387,0.000023642717,0.000235932,0.0000037915734,7.297089e-7,0.00002258972,0.000035106088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973505,0.00003785528,0.00041227415,0.001234445,0.0004809491,0.00048396713],"domain_scores_gemma":[0.99870276,0.0003004485,0.00023098932,0.00059326773,0.000098942066,0.00007357935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094205403,0.00033580468,0.00036191268,0.0010179519,0.0002476548,0.0003621561,0.0009101032,0.00037242385,6.294551e-7],"category_scores_gemma":[0.00013490519,0.00034814028,0.00005405343,0.0007624018,0.00042531124,0.0006159737,0.00059029553,0.0010350606,0.0000050842377],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042205584,0.000014621851,0.0015962123,0.000022650558,0.0000045144893,0.000091400594,0.0003220456,0.031320482,0.004112289,0.0021055988,1.252612e-7,0.9604058],"study_design_scores_gemma":[0.0002795156,0.0001657389,0.04638662,0.00081766344,0.000008913921,0.00009068482,0.000001846592,0.87188065,0.009864484,0.06976864,0.00003659904,0.0006986324],"about_ca_topic_score_codex":0.0001471556,"about_ca_topic_score_gemma":0.00027766885,"teacher_disagreement_score":0.9597072,"about_ca_system_score_codex":0.00043757271,"about_ca_system_score_gemma":0.00012710785,"threshold_uncertainty_score":0.99989706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007832571,0.00021630811,0.98953706,0.00007220228,0.0009470766,0.00016182054,0.00002903676,0.000810944,0.0003929629],"genre_scores_gemma":[0.8897968,0.00008278224,0.10914136,0.00005571874,0.00030767178,0.0000075423636,0.00012303924,0.00010194467,0.00038316927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986814,0.0000059350436,0.00030526685,0.00046446844,0.00030134246,0.00024156319],"domain_scores_gemma":[0.99882114,0.00024040356,0.00011410543,0.0007545476,0.000036835503,0.00003293944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022070733,0.0002087036,0.00031548337,0.00033370056,0.00006140139,0.000044724748,0.0012128024,0.0002279136,0.000045138662],"category_scores_gemma":[0.000088753935,0.00020882202,0.00003067339,0.0002649679,0.00019810566,0.0001483083,0.0006466253,0.0006017367,0.000055436165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.37063e-7,0.000007868171,0.0008978367,0.00008055919,0.000019802874,0.00003908544,0.00041450388,0.09617251,0.0023565125,0.0006960325,0.000041083313,0.8992737],"study_design_scores_gemma":[0.000090217814,0.00003444693,0.00078818924,0.00038007885,0.000020366884,0.000003503637,5.306942e-7,0.99009967,0.0029137477,0.005126033,0.0002649473,0.00027824743],"about_ca_topic_score_codex":0.000018564997,"about_ca_topic_score_gemma":0.000054409393,"teacher_disagreement_score":0.8989954,"about_ca_system_score_codex":0.00006114178,"about_ca_system_score_gemma":0.000048879472,"threshold_uncertainty_score":0.8515515},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014063476,0.00005091625,0.9950365,0.0002890623,0.0015294966,0.00041029992,0.0000028279867,0.0008080734,0.0017322068],"genre_scores_gemma":[0.21832883,0.000004011368,0.7796957,0.001053761,0.0004655559,0.000028223563,0.000015337466,0.000052170155,0.00035642978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964253,0.00006169067,0.0004538845,0.0015267384,0.00092568016,0.0006067335],"domain_scores_gemma":[0.9977167,0.00034206116,0.00021998832,0.0013016585,0.00017504593,0.0002445411],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014309728,0.00043227948,0.00038531038,0.0012076315,0.00040215775,0.00079097523,0.0025909867,0.000311612,0.000003964194],"category_scores_gemma":[0.0000981715,0.00041007172,0.00008035175,0.0012239473,0.00012240703,0.0007170167,0.0005123203,0.00062487385,0.00016936474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018278367,0.000018998096,0.00002279934,0.00005222239,0.0000060750094,0.000016131171,0.0015433274,0.23931003,0.00025101777,0.0046471525,0.000016604721,0.7541138],"study_design_scores_gemma":[0.00008838649,0.0001744651,0.00023409,0.00026526093,0.000005706799,0.000031101397,1.9818738e-7,0.96129715,0.0010195684,0.036138363,0.00024005136,0.00050564756],"about_ca_topic_score_codex":0.000031593037,"about_ca_topic_score_gemma":0.00004237467,"teacher_disagreement_score":0.75360817,"about_ca_system_score_codex":0.0002891913,"about_ca_system_score_gemma":0.00032485972,"threshold_uncertainty_score":0.99983513},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01663286,0.00055996614,0.9764491,0.0020816543,0.002310622,0.0010521772,0.000007904561,0.00020164595,0.00070409063],"genre_scores_gemma":[0.9594241,0.00003340008,0.03921269,0.00027928906,0.00034501392,0.000050165192,0.000002939068,0.00004297539,0.000609425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961905,0.0001945101,0.0007520276,0.0013844533,0.0010215782,0.0004569306],"domain_scores_gemma":[0.9953982,0.0023200193,0.00058814115,0.0012849392,0.00029152248,0.00011714261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023057368,0.00043987462,0.0005529244,0.0004403022,0.0005167053,0.0005181371,0.0030082245,0.0001738132,0.000011461372],"category_scores_gemma":[0.0002793891,0.00033786343,0.0001080635,0.00075940334,0.0006718309,0.0006299643,0.0018104634,0.0010721044,0.000022903912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017108745,0.00055364403,0.016393859,0.0006153067,0.0002306208,0.000040546664,0.11814819,0.047509376,0.001553851,0.04824802,0.00025388814,0.76643556],"study_design_scores_gemma":[0.001050267,0.0015649825,0.034254856,0.0048370096,0.00013851491,0.00038810438,0.00030193475,0.89664835,0.0012277953,0.051898602,0.0048828633,0.002806712],"about_ca_topic_score_codex":0.00022477894,"about_ca_topic_score_gemma":0.00021291328,"teacher_disagreement_score":0.9427912,"about_ca_system_score_codex":0.0003492344,"about_ca_system_score_gemma":0.00038410365,"threshold_uncertainty_score":0.9999073},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060446553,0.0001207637,0.990506,0.00082950987,0.0045547653,0.000814096,0.000004571227,0.0003081133,0.0028017445],"genre_scores_gemma":[0.0062534176,0.00009318005,0.98958415,0.0010971006,0.0010477698,0.00007814213,0.000022490372,0.000058955487,0.0017647975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957634,0.000079671125,0.0006474698,0.0019714742,0.00081498065,0.00072296883],"domain_scores_gemma":[0.9964669,0.0012135785,0.00031118048,0.0016317108,0.00023188356,0.00014476929],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029035436,0.00054137385,0.00053180906,0.0009507989,0.00045565353,0.00050784776,0.0026864172,0.00034589908,0.0000040708073],"category_scores_gemma":[0.00012931759,0.00051453797,0.00015736959,0.00046936228,0.0001910602,0.00070203247,0.0011866357,0.0007825242,0.000018676372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006328665,0.000013310435,0.000012460351,0.000061701176,0.000009028737,0.000010725014,0.00021198596,0.13641766,0.000307803,0.023935657,0.00007208933,0.8389413],"study_design_scores_gemma":[0.0001923241,0.0004895283,0.000082185165,0.00048575905,0.000009300276,0.000015083696,1.0014438e-7,0.9576527,0.0018518144,0.037358567,0.0013286893,0.00053396815],"about_ca_topic_score_codex":0.00000717733,"about_ca_topic_score_gemma":0.000007457418,"teacher_disagreement_score":0.8384073,"about_ca_system_score_codex":0.0005758914,"about_ca_system_score_gemma":0.00062996335,"threshold_uncertainty_score":0.99973065},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1609135,0.00024030724,0.81747407,0.0008116991,0.0067501194,0.0030670261,0.0007636661,0.00058756664,0.009392027],"genre_scores_gemma":[0.9977219,0.000023996012,0.0007191076,0.0008806719,0.0002662917,0.0000060380044,0.000007560645,0.000041675994,0.0003327475],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971108,0.000053816693,0.00033208425,0.0011239195,0.0009545138,0.00042485696],"domain_scores_gemma":[0.9970287,0.001992127,0.00024960717,0.00041928803,0.00009068517,0.00021961142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030167293,0.00038355848,0.00035941933,0.00059091055,0.00018607224,0.000073026116,0.0007798235,0.00013448403,0.000112734284],"category_scores_gemma":[0.0007694037,0.00031100758,0.00022375572,0.00039046173,0.000652612,0.0001779248,0.00035450107,0.00055212795,0.0001161663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007937679,0.0003563096,0.00016011462,0.00016157208,0.000060289873,0.0017822614,0.0013359933,0.05880277,0.10055899,0.031726502,0.00004465664,0.8042168],"study_design_scores_gemma":[0.0006734554,0.0015736879,0.0022654403,0.003417524,0.00007799404,0.00006407075,2.6854084e-7,0.08449748,0.6456886,0.26060653,0.000009749359,0.0011252313],"about_ca_topic_score_codex":0.0000024324477,"about_ca_topic_score_gemma":0.000002161365,"teacher_disagreement_score":0.8368084,"about_ca_system_score_codex":0.00008645182,"about_ca_system_score_gemma":0.00041042938,"threshold_uncertainty_score":0.9999342},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009939095,0.000090030284,0.99358547,0.0009287585,0.0013386856,0.0005238904,0.0000028919574,0.00033059358,0.002205755],"genre_scores_gemma":[0.339818,0.000016203354,0.65807635,0.00012492349,0.0001075476,0.00007171555,0.000004448749,0.000060173556,0.0017206431],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99719346,0.00061963504,0.00047769755,0.00088101253,0.00033351374,0.00049466675],"domain_scores_gemma":[0.9976524,0.0014492287,0.00029867934,0.00047115432,0.00009689885,0.000031647694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004965489,0.00033268912,0.00047347308,0.0019229507,0.00022450287,0.00005894274,0.000780447,0.00027589634,0.000042626016],"category_scores_gemma":[0.0008165569,0.00032348777,0.000057903675,0.0008795113,0.00035042886,0.00010249026,0.0005606566,0.002100124,0.000019012912],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041678893,0.000036573685,0.000105229075,0.0000137933885,0.00002674117,0.00002334044,0.0349223,0.02516505,0.001140355,0.0042077033,0.000034492732,0.9342827],"study_design_scores_gemma":[0.007246769,0.018104788,0.01201089,0.03593171,0.00014935953,0.00016278881,0.0050896406,0.31770167,0.1105588,0.41008615,0.07055747,0.012399948],"about_ca_topic_score_codex":0.000053939882,"about_ca_topic_score_gemma":0.00002140018,"teacher_disagreement_score":0.9218828,"about_ca_system_score_codex":0.0002914806,"about_ca_system_score_gemma":0.00011677169,"threshold_uncertainty_score":0.99992174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49630833,0.0001036929,0.5002904,0.00005058991,0.00067561126,0.0006343533,0.0000021618514,0.00014175952,0.0017931223],"genre_scores_gemma":[0.9783184,0.0000053780373,0.020982489,0.000029696708,0.00008210277,0.000025593514,0.0000044989556,0.00004054864,0.0005112871],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9974579,0.00047182746,0.00045949957,0.0007949535,0.00040147832,0.00041432184],"domain_scores_gemma":[0.99787647,0.0011529629,0.00034887265,0.000336725,0.00022218876,0.00006276743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048894,0.00030609325,0.00038020662,0.0005135228,0.00036431785,0.00007229718,0.00041140214,0.00015767783,0.0000044048898],"category_scores_gemma":[0.00014023994,0.0002221293,0.000026636373,0.0006653595,0.0004096472,0.000119224074,0.00023574666,0.0017480244,0.000005508391],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034356295,0.00008730154,0.11391989,0.00012799779,0.000116166855,0.00015876332,0.14297627,0.028917728,0.00008904544,0.016934965,0.0000010109917,0.6963273],"study_design_scores_gemma":[0.003064808,0.015175844,0.79236406,0.02070828,0.00026053205,0.0002670293,0.0012788571,0.15556736,0.0012841622,0.004663206,0.001713747,0.003652101],"about_ca_topic_score_codex":0.000052257248,"about_ca_topic_score_gemma":0.00009040392,"teacher_disagreement_score":0.6926752,"about_ca_system_score_codex":0.00024802703,"about_ca_system_score_gemma":0.00010319171,"threshold_uncertainty_score":0.905817},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043163556,0.000008050477,0.98756754,0.00052701274,0.0012635097,0.0002806092,0.000011435531,0.00004174043,0.0059837485],"genre_scores_gemma":[0.9946458,0.0000015092709,0.0043893163,0.00018333182,0.000052385378,0.0000059321524,0.00002532397,0.000014548741,0.00068186753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998644,0.000058509308,0.00045161048,0.0003360102,0.0003955966,0.0001142971],"domain_scores_gemma":[0.99796325,0.0010556092,0.00050988665,0.00030206292,0.00014721698,0.000021997934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007993299,0.00014531091,0.0001865052,0.00048171054,0.00011577593,0.00003381206,0.00018382467,0.0001411534,0.00017755067],"category_scores_gemma":[0.00018571939,0.0001158534,0.00005211621,0.00022222243,0.00025386515,0.00010955398,0.000046314875,0.000273242,0.000035143454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054177402,0.00004428115,0.00075968954,0.00006778682,0.000016510568,0.0000016688067,0.00196569,0.41304895,0.00031528805,0.061783347,0.000054741307,0.52188784],"study_design_scores_gemma":[0.00019832187,0.00010879537,0.052480564,0.0003786347,0.000009322494,0.0000026246155,0.0000018168236,0.9359913,0.00011555422,0.010586646,0.000024134313,0.00010231333],"about_ca_topic_score_codex":0.000022555354,"about_ca_topic_score_gemma":0.00002357991,"teacher_disagreement_score":0.99032944,"about_ca_system_score_codex":0.00006301145,"about_ca_system_score_gemma":0.00005135707,"threshold_uncertainty_score":0.47243646},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.0126287e-7,0.0000988499,0.99275887,0.001480947,0.0030595977,0.0007414006,0.000019413916,0.00031992927,0.0015200786],"genre_scores_gemma":[0.007153848,0.00010156199,0.9883688,0.0023111007,0.0007820578,0.000059414193,0.000016125468,0.000060141683,0.0011469268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997198,0.000019462863,0.00046202753,0.0010610087,0.00072331016,0.00053623365],"domain_scores_gemma":[0.9967864,0.001628393,0.00027757196,0.00085238606,0.00035664343,0.000098602286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010875425,0.00036761287,0.00033170608,0.00051875075,0.00054117024,0.000753975,0.0019232797,0.00022890822,0.000025791234],"category_scores_gemma":[0.00009521982,0.00028840703,0.00015378722,0.0006574575,0.0007749115,0.0003539089,0.000503758,0.0005320798,0.000042185355],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.8848934e-7,0.000004012666,0.000005611095,0.000009498255,0.000012514055,0.0000114432105,0.00024740119,0.006189153,0.000009538427,0.049165856,0.00002444759,0.94431996],"study_design_scores_gemma":[0.00021852615,0.00004022084,0.00005841991,0.0001252901,0.000009613077,0.000053653977,4.686383e-7,0.89968985,0.000075022166,0.09755632,0.0018392104,0.0003334101],"about_ca_topic_score_codex":0.000014781501,"about_ca_topic_score_gemma":0.00006794814,"teacher_disagreement_score":0.94398654,"about_ca_system_score_codex":0.00020414629,"about_ca_system_score_gemma":0.00065969984,"threshold_uncertainty_score":0.9999568},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006596858,0.000037043657,0.99465,0.0009712796,0.0014446292,0.00042611823,0.0000021454437,0.00036229726,0.0020405003],"genre_scores_gemma":[0.17615913,0.00006493854,0.8222684,0.00071001373,0.0003093632,0.000028204096,0.000009906151,0.000050299972,0.00039972187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967922,0.000033899472,0.0005814152,0.0012177107,0.00072798907,0.0006467794],"domain_scores_gemma":[0.9984462,0.0003537658,0.00024314602,0.0006665041,0.00015388742,0.00013644944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008715264,0.00038037178,0.00038876824,0.0012452096,0.00016487649,0.0006351201,0.0013523907,0.00023654563,0.000034926208],"category_scores_gemma":[0.00014376988,0.00039112996,0.00009668361,0.00096363004,0.0005302856,0.0005939944,0.0007077429,0.0007440797,0.000064606415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000132713,0.000009610621,0.00017592844,0.000017432645,0.0000035171736,0.00012543588,0.0007294983,0.033696976,0.0000437301,0.05498111,0.0000026256055,0.9102128],"study_design_scores_gemma":[0.000405518,0.000077592995,0.00037545804,0.000676587,0.0000036732931,0.00009328181,0.0000021790247,0.9126123,0.00027561217,0.08421147,0.000559072,0.00070725044],"about_ca_topic_score_codex":0.000021968575,"about_ca_topic_score_gemma":0.00026999827,"teacher_disagreement_score":0.90950555,"about_ca_system_score_codex":0.00034653748,"about_ca_system_score_gemma":0.000511448,"threshold_uncertainty_score":0.9998541},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000083012106,0.00025315429,0.98670024,0.00033256353,0.0020616301,0.0004577993,0.0000033462688,0.009531766,0.0005764898],"genre_scores_gemma":[0.044574056,0.000010158547,0.9540504,0.00051738846,0.00051273324,0.000016744603,0.000003934729,0.00009985107,0.0002147192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99474275,0.000060463844,0.0006668145,0.0021012907,0.0012513937,0.0011772831],"domain_scores_gemma":[0.9961098,0.0010864642,0.0003951571,0.0018481615,0.00032316105,0.0002372506],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014867489,0.00078987365,0.0007127806,0.0017345153,0.0004986193,0.0012171734,0.004135894,0.00043420226,0.000004282633],"category_scores_gemma":[0.00049058656,0.0007285714,0.00023432533,0.0013035925,0.00078146573,0.00035565213,0.0026352499,0.0013742003,0.00003039223],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003436575,0.00002038877,0.000082856386,0.00006685446,0.000016103799,0.00025640597,0.00086502096,0.116498165,0.000047286565,0.0023792635,0.000086840955,0.87967736],"study_design_scores_gemma":[0.00010070582,0.00011765641,0.000026992264,0.0011935327,0.0000102565655,0.00022127418,1.11916606e-7,0.7011185,0.00052212225,0.29562953,0.00027557556,0.0007836888],"about_ca_topic_score_codex":0.00009513793,"about_ca_topic_score_gemma":0.00003945133,"teacher_disagreement_score":0.8788937,"about_ca_system_score_codex":0.00035271596,"about_ca_system_score_gemma":0.0005840967,"threshold_uncertainty_score":0.99981964},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017341812,0.000018268396,0.995247,0.0013360353,0.0011156418,0.0006601097,0.00018389733,0.00012861898,0.001293072],"genre_scores_gemma":[0.20483617,0.000025688789,0.77527916,0.0025785265,0.0019674073,0.00031627627,0.00029221346,0.00015895924,0.014545613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658746,0.000041848238,0.00064368977,0.0011750435,0.0012237197,0.00032823725],"domain_scores_gemma":[0.9938779,0.00403788,0.00039862285,0.000852004,0.00072448107,0.00010915356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021506562,0.0002942522,0.0003558544,0.0010220221,0.0005939831,0.00038276674,0.0014447147,0.00022744476,0.00017366513],"category_scores_gemma":[0.0013426868,0.00024130849,0.00015635103,0.0009606405,0.0007001966,0.00034153956,0.00019658523,0.00032661445,0.00018592566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015362713,0.0000100936195,0.000007102297,0.0000039964016,0.0000044557564,0.0000011431301,0.0002068601,0.93761265,0.000011375577,0.015828008,0.00009572442,0.0462032],"study_design_scores_gemma":[0.00018843138,0.000071222166,0.000017039643,0.000053532873,0.000008498565,0.0000028063466,0.0000021510862,0.7510137,0.00039234172,0.24364,0.004355361,0.0002549046],"about_ca_topic_score_codex":0.0000044065914,"about_ca_topic_score_gemma":0.00004733379,"teacher_disagreement_score":0.22781199,"about_ca_system_score_codex":0.00016352614,"about_ca_system_score_gemma":0.0004612745,"threshold_uncertainty_score":0.98402745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016356984,0.00019977255,0.99651694,0.000079813966,0.0007937799,0.00034608395,0.000006076551,0.0002090663,0.00021275958],"genre_scores_gemma":[0.8221972,0.00003453956,0.1766443,0.00028044567,0.00040473812,0.000013165733,0.00000824377,0.00012495431,0.00029240994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807143,0.000023545814,0.0003453958,0.00062561856,0.0003229562,0.00061107805],"domain_scores_gemma":[0.9987413,0.00072155497,0.000040484916,0.00031897388,0.00007896924,0.00009871658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009905583,0.000295492,0.00034567906,0.00039890327,0.00011919763,0.00026643704,0.00042744906,0.00030974104,0.0000048900297],"category_scores_gemma":[0.000092240574,0.00029717482,0.00005506791,0.00049704796,0.00034323116,0.0001676299,0.00031392003,0.000712096,0.0000024250019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006895007,0.0000023950215,0.00029408812,0.00003850909,0.000003492261,0.000011160415,0.00023998035,0.82883,0.000012531988,0.0003243149,0.000003201522,0.17023344],"study_design_scores_gemma":[0.00038662972,0.000044313245,0.00065989664,0.00017273036,0.0000035822532,0.000009727913,4.3548883e-7,0.9955424,0.000107485466,0.0027399324,0.00002136891,0.00031146107],"about_ca_topic_score_codex":0.000019600802,"about_ca_topic_score_gemma":0.000076104945,"teacher_disagreement_score":0.8205615,"about_ca_system_score_codex":0.00021397583,"about_ca_system_score_gemma":0.00007199277,"threshold_uncertainty_score":0.999948},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000081994585,0.0004539646,0.9962311,0.0004072278,0.0020635198,0.0006713497,0.000033596363,0.000058530906,0.00007251863],"genre_scores_gemma":[0.03861904,0.00004095575,0.9599033,0.00024450064,0.00031798048,0.000020442574,0.00000535957,0.00003565233,0.00081278814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966468,0.00007650365,0.00063768786,0.0009352064,0.0013357718,0.00036801788],"domain_scores_gemma":[0.9856509,0.01199199,0.00045853984,0.00093777897,0.00089619885,0.0000645853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045899,0.00027502596,0.0004366238,0.0009036224,0.00045440497,0.000302652,0.0020842124,0.0002366171,0.000038239446],"category_scores_gemma":[0.005553894,0.00016830073,0.00018107021,0.0011145344,0.0009357955,0.000178104,0.0003552327,0.0003889803,0.000017306154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012182962,0.0000065886593,0.0000137842835,0.000003728324,0.000014379767,0.0000011926406,0.00033491364,0.9056452,0.000032810032,0.0014544644,0.000036198024,0.09244458],"study_design_scores_gemma":[0.0001601817,0.000062041196,0.00018733335,0.00005379474,0.000019749106,0.0000042129063,0.0000013467946,0.7975034,0.0003029689,0.20149167,0.00005996404,0.00015333114],"about_ca_topic_score_codex":0.000018438297,"about_ca_topic_score_gemma":0.000031933378,"teacher_disagreement_score":0.20003721,"about_ca_system_score_codex":0.00007531149,"about_ca_system_score_gemma":0.00055649586,"threshold_uncertainty_score":0.6863104},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000111882866,0.00005011763,0.9971064,0.0007877479,0.0008034528,0.00054337067,0.000005056928,0.00011995202,0.0004720429],"genre_scores_gemma":[0.17742446,0.00008213052,0.8215942,0.00011875786,0.00023557241,0.000037228594,0.000021620699,0.000022207616,0.00046382478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971443,0.00012013444,0.0005752126,0.00088116387,0.00086776144,0.00041142674],"domain_scores_gemma":[0.99796015,0.0005821977,0.00010090868,0.0005748532,0.00067081366,0.00011105879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020932492,0.00022481423,0.00029264082,0.0015771368,0.00030237116,0.00064168003,0.0009952973,0.00022167852,0.000012369935],"category_scores_gemma":[0.0004789228,0.00021055886,0.000051162904,0.002276582,0.0017752815,0.0004614677,0.0006061815,0.00073122664,0.000016949567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014955697,0.000019364523,0.000008347118,0.000019678373,0.000003480881,0.0000066027574,0.0011516286,0.048394054,0.00016970413,0.07001849,0.000011665273,0.8801955],"study_design_scores_gemma":[0.000038366477,0.00014813407,0.00010196795,0.00025232052,0.0000028552045,0.000023011857,0.0000051265356,0.8893281,0.0016467513,0.10815144,0.00008831397,0.0002135819],"about_ca_topic_score_codex":0.000048484915,"about_ca_topic_score_gemma":0.0009945566,"teacher_disagreement_score":0.87998194,"about_ca_system_score_codex":0.00022661018,"about_ca_system_score_gemma":0.0015243021,"threshold_uncertainty_score":0.8586341},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027857104,0.0003769688,0.99468726,0.0016218661,0.0013139736,0.00020931163,0.000004162655,0.00039458653,0.0013640262],"genre_scores_gemma":[0.09900966,0.00026420283,0.89150876,0.0031718013,0.001398309,0.000026450853,0.000022420902,0.00010640234,0.0044920095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970686,0.000045054116,0.0003660426,0.0012596837,0.0007847554,0.00047590103],"domain_scores_gemma":[0.9977587,0.0009143047,0.00018980583,0.000848876,0.00014508059,0.00014325016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090793724,0.00038062743,0.00036268038,0.0008970047,0.00034308142,0.0007841751,0.0015111035,0.00021210319,0.000011160792],"category_scores_gemma":[0.00020270214,0.00035183187,0.000073931646,0.0006343465,0.0004502398,0.00048161126,0.0011309324,0.0006955341,0.00011403913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012930492,0.000011577737,0.000041703635,0.00003548987,0.000007938272,0.00006652627,0.00042249676,0.01770202,0.000027835613,0.053939838,0.000018751089,0.92772454],"study_design_scores_gemma":[0.00014326638,0.00011547452,0.00027395636,0.0002970427,0.0000062850627,0.000049621172,1.4039931e-7,0.775968,0.00008512034,0.22225332,0.0004051407,0.00040258945],"about_ca_topic_score_codex":0.000040147454,"about_ca_topic_score_gemma":0.000028448729,"teacher_disagreement_score":0.9273219,"about_ca_system_score_codex":0.00010049626,"about_ca_system_score_gemma":0.00022193237,"threshold_uncertainty_score":0.99989337},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011388324,0.00021343211,0.99162054,0.0005354758,0.003496115,0.0005351475,0.000006748957,0.0009089608,0.0026721791],"genre_scores_gemma":[0.04789105,0.00012861965,0.9413759,0.00091981393,0.0011492831,0.00006373769,0.000010150626,0.00025856658,0.008202887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928058,0.000055149223,0.0008703488,0.0026897707,0.0018673555,0.0017115779],"domain_scores_gemma":[0.995515,0.00091369974,0.00032643724,0.0025454299,0.00031555918,0.00038389213],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013946517,0.00089724147,0.00089174137,0.0017981394,0.00048102392,0.0011967004,0.006874169,0.00044875834,0.00003252057],"category_scores_gemma":[0.00021721485,0.0008963079,0.00022712808,0.001369835,0.0007981681,0.0014024551,0.009660272,0.0017022381,0.00026654365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007703464,0.000011795776,0.0000065935337,0.000063713494,0.000015223425,0.00024841016,0.000552229,0.32385975,0.00034422794,0.0002927563,0.000008739163,0.67458886],"study_design_scores_gemma":[0.0002716456,0.00018103087,0.000034942386,0.00080991234,0.0000051913785,0.00017986081,3.5839312e-7,0.95474607,0.00050293066,0.041722376,0.00065748696,0.00088819914],"about_ca_topic_score_codex":0.00007337851,"about_ca_topic_score_gemma":0.00064356206,"teacher_disagreement_score":0.67370063,"about_ca_system_score_codex":0.00083587616,"about_ca_system_score_gemma":0.000480482,"threshold_uncertainty_score":0.99984014},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011436646,0.00032926927,0.9921682,0.0012875128,0.0024603615,0.00036324165,0.000007148456,0.00038198748,0.0018586211],"genre_scores_gemma":[0.078008756,0.0006408956,0.90828705,0.0035102898,0.0008367837,0.000045496683,0.00003556369,0.00015856126,0.008476615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961214,0.000042420215,0.00046233012,0.001712957,0.0009747746,0.00068610185],"domain_scores_gemma":[0.9977912,0.00039639077,0.00023565933,0.0011199587,0.00019752301,0.00025927377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007663146,0.00052095525,0.00049434626,0.0006092494,0.0005076274,0.001031479,0.0017472096,0.0004298965,0.00002608433],"category_scores_gemma":[0.00009727111,0.0004275337,0.00010326195,0.0006061849,0.0006530302,0.0009140497,0.0022932468,0.00077938545,0.00023799721],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022530032,0.0000376321,0.00008969102,0.00011279883,0.000011879638,0.00025396072,0.0011678338,0.015656076,0.00058293995,0.002079386,0.000700661,0.9792846],"study_design_scores_gemma":[0.0004537351,0.00025739273,0.00014074761,0.0018107882,0.000010337536,0.000116245494,7.189543e-7,0.93759996,0.002344638,0.05365761,0.0027597018,0.0008481309],"about_ca_topic_score_codex":0.00002675597,"about_ca_topic_score_gemma":0.000027373902,"teacher_disagreement_score":0.97843647,"about_ca_system_score_codex":0.00012285021,"about_ca_system_score_gemma":0.0003177853,"threshold_uncertainty_score":0.99981767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004688886,0.00004149876,0.9971049,0.00018346254,0.000803355,0.0012317759,0.0000060248403,0.00026131645,0.0003208105],"genre_scores_gemma":[0.0053188084,0.00003540819,0.99245936,0.000015758795,0.00043605437,0.00006212651,0.000043667387,0.00011091612,0.0015178827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632984,0.000049643488,0.00078401563,0.0009642546,0.0012899091,0.0005823427],"domain_scores_gemma":[0.99717885,0.00046806462,0.00046320877,0.00078798115,0.00097508676,0.00012679426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013754896,0.00040098245,0.0005750329,0.0009924979,0.000161202,0.00011772486,0.00073630235,0.00034392922,0.000025492798],"category_scores_gemma":[0.0008262483,0.0003633166,0.000121804005,0.0013820587,0.0007333302,0.00028614185,0.0004944868,0.0007963909,0.000023732082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019552272,0.00015892053,0.0000050463086,0.00044090796,0.000028727518,0.000014507721,0.0007985011,0.12774189,0.00027600265,0.021744281,0.0000073623614,0.8487643],"study_design_scores_gemma":[0.00020746473,0.00022558818,0.0000024250185,0.0007237713,0.00001973203,0.00003694682,0.0000023937835,0.7831269,0.00207562,0.21295671,0.0002765081,0.00034594297],"about_ca_topic_score_codex":0.000019263854,"about_ca_topic_score_gemma":0.00002087053,"teacher_disagreement_score":0.84841835,"about_ca_system_score_codex":0.00033322195,"about_ca_system_score_gemma":0.00037442878,"threshold_uncertainty_score":0.99988186},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009209679,0.00010894922,0.9946528,0.0004870554,0.0021840187,0.0005313177,0.000005096442,0.00024325082,0.0008665193],"genre_scores_gemma":[0.15770568,0.000056073222,0.8393166,0.0011773137,0.0005845951,0.00001238516,0.000005312596,0.00012777673,0.0010142544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99442065,0.00008598469,0.0009406169,0.0019089525,0.0014428014,0.0012010074],"domain_scores_gemma":[0.99656135,0.001198918,0.000269396,0.0015179493,0.00026102856,0.00019134996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002286484,0.0005532028,0.0006252067,0.0016691491,0.00033003645,0.0009508393,0.004254091,0.000341704,0.000019983374],"category_scores_gemma":[0.00031291455,0.0005524004,0.00012562647,0.0017326183,0.0010151633,0.00092973094,0.0026352075,0.0013232814,0.00018640298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008074873,0.000021623095,0.00012882739,0.00006352187,0.000006639079,0.00028864862,0.002799701,0.2618851,0.00042000457,0.022082457,0.0000034406926,0.71229196],"study_design_scores_gemma":[0.00007237569,0.00007114218,0.000057519253,0.00041212438,0.0000030045226,0.0000270007,0.0000013790817,0.83784264,0.001702268,0.15922062,0.00008131498,0.000508572],"about_ca_topic_score_codex":0.000541552,"about_ca_topic_score_gemma":0.0010407794,"teacher_disagreement_score":0.7117834,"about_ca_system_score_codex":0.0010555974,"about_ca_system_score_gemma":0.0014688775,"threshold_uncertainty_score":0.99969274},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019503238,0.00023988473,0.9761288,0.0007715096,0.002257826,0.00046502898,0.000010436699,0.00028378,0.00033946437],"genre_scores_gemma":[0.74025834,0.00016713608,0.25784096,0.0007799144,0.00067096204,0.000026568174,0.000011339355,0.000065942775,0.00017887009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963744,0.000043531,0.00055518583,0.0016134612,0.00083408365,0.0005793311],"domain_scores_gemma":[0.99800456,0.00031796226,0.0002431942,0.0009968408,0.00019675416,0.00024070522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085149234,0.0004922271,0.00042180732,0.0009269233,0.0005485617,0.0009483806,0.0016096389,0.00021135986,0.000022906868],"category_scores_gemma":[0.00007020266,0.00044272878,0.000069213245,0.00085895334,0.0012084255,0.0006402906,0.0011379564,0.00054390077,0.000025315194],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005073528,0.000021573278,0.0013961551,0.000034064997,0.000015377302,0.000051221414,0.0050812326,0.027872443,0.00020774484,0.028884932,0.000014956244,0.9364152],"study_design_scores_gemma":[0.00022591984,0.0002609463,0.0033711242,0.00016849935,0.000014064952,0.00017022151,0.000010665635,0.8523913,0.0010084282,0.14108457,0.0004309272,0.0008633672],"about_ca_topic_score_codex":0.00012681763,"about_ca_topic_score_gemma":0.0005990098,"teacher_disagreement_score":0.9355519,"about_ca_system_score_codex":0.00014044894,"about_ca_system_score_gemma":0.0002966162,"threshold_uncertainty_score":0.9998025},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058131554,0.0011123407,0.6930061,0.003321439,0.011021539,0.0008578201,0.000019293704,0.0005578508,0.2895223],"genre_scores_gemma":[0.1032044,0.0035449432,0.15494038,0.015560202,0.015799839,0.00006963705,0.00007783343,0.0003314142,0.7064713],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99765927,0.000038847145,0.00021079894,0.0007132345,0.00078036817,0.00059745676],"domain_scores_gemma":[0.9985331,0.00075665046,0.00009689527,0.0002861774,0.00008873067,0.00023843993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008678667,0.00022583615,0.00031523473,0.00039393382,0.0001653684,0.00056114537,0.00086151843,0.00021915062,0.000009813667],"category_scores_gemma":[0.0002784935,0.00020972948,0.00006041033,0.00071160996,0.0022581078,0.0002686103,0.0004596302,0.00035859618,0.00004945416],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012639006,0.0000071851646,0.00007327636,0.00002048376,0.0000037485966,0.00003588511,0.005544882,0.00043123608,0.0000014033583,0.0024974586,0.0009026311,0.99048054],"study_design_scores_gemma":[0.0003462169,0.00016469914,0.00094289717,0.0010027837,0.000015923908,0.0000122917145,0.000013947746,0.012398516,0.000026944555,0.12363208,0.8604369,0.0010067928],"about_ca_topic_score_codex":0.000073659576,"about_ca_topic_score_gemma":0.0010425521,"teacher_disagreement_score":0.98947376,"about_ca_system_score_codex":0.00025471018,"about_ca_system_score_gemma":0.001258088,"threshold_uncertainty_score":0.85525197},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013950632,0.000054286924,0.9947682,0.00096438325,0.0010570372,0.00074082473,0.0000069254797,0.00027448256,0.0019943514],"genre_scores_gemma":[0.17004237,0.0002510795,0.82127863,0.0018688039,0.0007091419,0.0000781605,0.00005827428,0.00018818228,0.0055253687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953495,0.00007952821,0.0006279804,0.0016454422,0.0013727614,0.00092473207],"domain_scores_gemma":[0.9975028,0.0007115688,0.00013534556,0.0012004835,0.00023202485,0.00021776557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016406532,0.00043595667,0.00048291095,0.0014931591,0.00021009007,0.0003576972,0.0030375738,0.000291269,0.000018141582],"category_scores_gemma":[0.00030628603,0.0004080996,0.0000985456,0.0019296005,0.00054401316,0.00060521736,0.0020198263,0.0012080461,0.0001216882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008908822,0.000060623555,0.00021906274,0.00010490111,0.0000067851274,0.0001787723,0.0020774743,0.7499063,0.000033206048,0.04842349,0.000013601565,0.1989669],"study_design_scores_gemma":[0.00034695302,0.0001094011,0.00021460322,0.00046561498,0.0000014809384,0.000012100558,3.0005972e-7,0.94112635,0.00006855552,0.056851413,0.00037204663,0.00043120052],"about_ca_topic_score_codex":0.00006783534,"about_ca_topic_score_gemma":0.00028301438,"teacher_disagreement_score":0.1985357,"about_ca_system_score_codex":0.00039772998,"about_ca_system_score_gemma":0.00065592193,"threshold_uncertainty_score":0.9998371},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006364457,0.00008660358,0.99397844,0.0007007599,0.002803717,0.00039176305,0.000014823067,0.00030360522,0.0010838314],"genre_scores_gemma":[0.8200213,0.0004898761,0.15642008,0.008323988,0.0016892384,0.000052593954,0.00034178357,0.00020488922,0.012456254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996312,0.00003727007,0.00054924074,0.0016456998,0.0007783263,0.0006774626],"domain_scores_gemma":[0.9977773,0.0002874252,0.00033147828,0.0011602507,0.00017712223,0.0002664134],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00073154934,0.00058456307,0.0005683885,0.0007746102,0.00043341878,0.0011307659,0.0015456587,0.00041602092,0.000018056588],"category_scores_gemma":[0.000019059895,0.0005282357,0.00011107702,0.0006735361,0.0007804962,0.0005052445,0.000899555,0.00080758217,0.000063885585],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018909186,0.000031290092,0.000204949,0.00004081292,0.000017686922,0.00011046059,0.00077865506,0.00044248524,0.0002631222,0.022569736,0.000066515626,0.9754554],"study_design_scores_gemma":[0.00038117456,0.00029224268,0.00056641456,0.00044197383,0.000012642132,0.00008513906,1.7350983e-7,0.9397766,0.00003211088,0.05179637,0.005712317,0.00090282597],"about_ca_topic_score_codex":0.000020439558,"about_ca_topic_score_gemma":0.00007782958,"teacher_disagreement_score":0.9745526,"about_ca_system_score_codex":0.000120042874,"about_ca_system_score_gemma":0.00045243558,"threshold_uncertainty_score":0.9999062},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015492792,0.000180556,0.9863745,0.0053273453,0.00073553814,0.0045725117,0.0007397195,0.00025114897,0.00026941454],"genre_scores_gemma":[0.9639445,0.00015857657,0.017697047,0.013713091,0.0019486463,0.000106852705,0.0017623516,0.00013148834,0.0005374308],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99715596,0.00011125067,0.000578164,0.00085186306,0.0005151066,0.00078762515],"domain_scores_gemma":[0.9979699,0.00056170154,0.00046262436,0.00041722402,0.0002763325,0.00031219563],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008510758,0.00035913897,0.00053969066,0.00057996344,0.0010923899,0.000040920997,0.00036145735,0.0003424199,0.000022709353],"category_scores_gemma":[0.000060731087,0.00030442033,0.000054935565,0.0003028225,0.00048414405,0.00009203437,0.000108973145,0.0009687207,0.000040290168],"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.0006021976,0.00021136159,0.5517529,0.009986689,0.000064182095,0.000031280037,0.007388876,0.007573924,0.000014813268,0.007791104,0.008430819,0.4061518],"study_design_scores_gemma":[0.008947418,0.002056686,0.8537475,0.02175958,0.00009321472,0.000022892593,0.000011077318,0.07308338,0.000013860231,0.031909022,0.0061397534,0.0022156336],"about_ca_topic_score_codex":0.00016875089,"about_ca_topic_score_gemma":0.00079499336,"teacher_disagreement_score":0.96867746,"about_ca_system_score_codex":0.0003774516,"about_ca_system_score_gemma":0.0022331711,"threshold_uncertainty_score":0.9999408},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000361759,0.00002926545,0.99409926,0.00055291643,0.00030393153,0.00019360546,0.00000128721,0.00015055164,0.0043074503],"genre_scores_gemma":[0.45114702,0.000054390126,0.5412181,0.0006256514,0.0008281345,0.000046366928,0.000035958266,0.000059779857,0.0059846053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866706,0.000012349317,0.0001502815,0.0006368165,0.00036525444,0.000168238],"domain_scores_gemma":[0.99937916,0.00005791972,0.0000669235,0.00035697708,0.00009168192,0.00004734176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025912342,0.00016131441,0.00012697237,0.0002684928,0.00014726107,0.00020811602,0.0003799468,0.00009260982,0.000022916589],"category_scores_gemma":[0.000015532127,0.00013950745,0.000021363023,0.0003052173,0.00010284088,0.00015531726,0.00021725579,0.00027359172,0.00016460528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024412686,0.000017106957,0.0007368108,0.000025100146,0.000013436047,0.00000762753,0.00012778069,0.047222737,0.0012924025,0.032904062,0.0003722821,0.91727823],"study_design_scores_gemma":[0.00007834032,0.00010050893,0.00257352,0.000065475804,0.0000061900996,0.000021771226,2.2447333e-8,0.98850816,0.00020948499,0.005267842,0.0029404513,0.00022822907],"about_ca_topic_score_codex":0.00003524358,"about_ca_topic_score_gemma":0.00006692608,"teacher_disagreement_score":0.94128543,"about_ca_system_score_codex":0.000106768486,"about_ca_system_score_gemma":0.000100830744,"threshold_uncertainty_score":0.56889486},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065519655,0.000030510062,0.99572843,0.00089697924,0.0014675272,0.0006944429,0.0000756511,0.00013297073,0.00031829445],"genre_scores_gemma":[0.2587713,0.000064784916,0.72346526,0.0017263681,0.0014067419,0.00009527603,0.0007753586,0.00013507814,0.013559844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956847,0.000021144113,0.0010326989,0.0010424493,0.0017893105,0.00042972068],"domain_scores_gemma":[0.9972738,0.00056300784,0.00029350296,0.0009275587,0.0008143351,0.00012780783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020559104,0.00034623817,0.00040724647,0.0015593852,0.00043729832,0.0009324258,0.0021168452,0.00023051018,0.00010132826],"category_scores_gemma":[0.0003731448,0.00030188143,0.0001989534,0.00092553685,0.00025873055,0.00096791226,0.0005169906,0.00034182405,0.00013332571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039413003,0.000016258937,0.00014951623,0.0000086891405,0.000004066787,0.0000026934695,0.00021429555,0.82283133,0.0000053117033,0.0008121853,0.000047895923,0.1759038],"study_design_scores_gemma":[0.00010978704,0.00003781236,0.00041120374,0.000085374355,0.00002123194,0.0000033213691,0.0000013709539,0.9760613,0.00001009547,0.022720058,0.0001977547,0.00034070347],"about_ca_topic_score_codex":0.00000812933,"about_ca_topic_score_gemma":0.000095185416,"teacher_disagreement_score":0.27226317,"about_ca_system_score_codex":0.00017423926,"about_ca_system_score_gemma":0.00019622302,"threshold_uncertainty_score":0.9999433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018769602,0.000089670044,0.99448705,0.00011472463,0.00049537094,0.0015049359,0.0000031192287,0.00068208366,0.0026042808],"genre_scores_gemma":[0.30606094,0.00003573077,0.6921839,0.0002427629,0.0001938025,0.00020037976,0.000027653652,0.000072508694,0.00098232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958162,0.000049622144,0.00067538203,0.0017431634,0.0008962726,0.00081936875],"domain_scores_gemma":[0.99759215,0.00041458206,0.00040282874,0.00089413766,0.0005533139,0.00014296561],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014242723,0.00066083163,0.00076349755,0.0008239417,0.00041862737,0.000822757,0.0024625228,0.00032554325,0.0000022500012],"category_scores_gemma":[0.00007929514,0.00050904846,0.00013946787,0.0006791761,0.00023464253,0.0006661381,0.00083690335,0.0010415656,0.0000043121895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026095122,0.00001439936,0.000023008002,0.00010181922,0.000041592648,0.000014414074,0.0011092457,0.80631214,0.000033416294,0.028781857,0.00001291307,0.1635291],"study_design_scores_gemma":[0.00043892668,0.00041296316,0.0000025183192,0.0009808854,0.000012510945,0.000029741384,0.0000016541737,0.9789057,0.00042122003,0.017749049,0.00039863435,0.0006462296],"about_ca_topic_score_codex":0.00010249494,"about_ca_topic_score_gemma":0.00004962289,"teacher_disagreement_score":0.30604216,"about_ca_system_score_codex":0.00034022058,"about_ca_system_score_gemma":0.0005268054,"threshold_uncertainty_score":0.99973613},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015494278,0.00002177957,0.98385936,0.000047086214,0.00008500473,0.00026605613,0.000022359724,0.00007372399,0.00013033386],"genre_scores_gemma":[0.9931333,0.00001529206,0.0066305157,0.000043348347,0.00007434923,0.00000949728,0.00002969339,0.00002305113,0.000040918472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986853,0.000015863068,0.00019914698,0.000557668,0.00030855782,0.00023344382],"domain_scores_gemma":[0.9991048,0.00016325222,0.00019368443,0.0003586863,0.00013000259,0.000049566563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021766611,0.0002585281,0.00037358457,0.0004944603,0.000108025764,0.000052882395,0.00026933366,0.00006849361,0.000007834251],"category_scores_gemma":[0.0000021489489,0.00021441033,0.00006473988,0.0005062103,0.0003739244,0.000077053686,0.00021044126,0.00031896128,0.0000021244211],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018905901,0.000019713685,0.0043051993,0.000020315645,0.000048194775,0.0000054345483,0.0001999134,0.0044114655,0.00013830476,0.0020566813,0.0000018389879,0.98877406],"study_design_scores_gemma":[0.00041765315,0.0008478011,0.019432802,0.0009916334,0.00010617694,0.0000066901566,0.0000016569315,0.5451373,0.007585346,0.4244482,0.00008795225,0.0009368156],"about_ca_topic_score_codex":0.00018628941,"about_ca_topic_score_gemma":0.00066972943,"teacher_disagreement_score":0.9878372,"about_ca_system_score_codex":0.000049113496,"about_ca_system_score_gemma":0.00003167367,"threshold_uncertainty_score":0.87433994},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084229506,0.00003267395,0.9664054,0.005347591,0.0023105294,0.0011977872,0.000075760705,0.00018864156,0.02359936],"genre_scores_gemma":[0.9805213,0.00009661265,0.012456177,0.00131347,0.0016875574,0.000028918097,0.00004023535,0.000075282805,0.0037804095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972263,0.000044635988,0.00028065825,0.0007288476,0.0011400158,0.0005795485],"domain_scores_gemma":[0.99714833,0.0015350729,0.00021394769,0.0003012717,0.00061620947,0.00018516001],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013683303,0.0002665908,0.00036444247,0.00026405577,0.000817333,0.000628754,0.00071625516,0.00037941147,0.000043813587],"category_scores_gemma":[0.00070179877,0.00023594023,0.00008697738,0.0003405645,0.003936268,0.00042823114,0.00013183175,0.0004930925,0.000016425918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001709647,0.00008204579,0.0009211502,0.00013737672,0.0001242117,0.0001918072,0.082817286,0.007059494,0.000104827064,0.47006935,0.0004039264,0.43791756],"study_design_scores_gemma":[0.0013735769,0.000600539,0.00047351734,0.0010421271,0.00008021712,0.0000106704465,0.00018517116,0.007490707,0.00040182596,0.98196065,0.004849942,0.0015310489],"about_ca_topic_score_codex":0.00051551097,"about_ca_topic_score_gemma":0.0071711726,"teacher_disagreement_score":0.97967905,"about_ca_system_score_codex":0.00033025903,"about_ca_system_score_gemma":0.0013296759,"threshold_uncertainty_score":0.99877447},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005785167,0.0001368576,0.993429,0.00052064017,0.003894793,0.00057772,0.0000015184165,0.00043647323,0.00094515044],"genre_scores_gemma":[0.7267002,0.000085612795,0.26638174,0.0025602442,0.0013602584,0.000057567788,0.000030302006,0.00014141988,0.0026826554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99528366,0.0000751982,0.0007933693,0.0015176658,0.001534794,0.00079533586],"domain_scores_gemma":[0.99737155,0.0008316343,0.0002637361,0.001126699,0.00020264281,0.0002037624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013923126,0.000568223,0.0005401437,0.00088953506,0.00047216675,0.00079318887,0.002171439,0.00042935184,0.000040359373],"category_scores_gemma":[0.00018499653,0.0005350671,0.000194235,0.000789489,0.00018696587,0.00063760125,0.00054817623,0.0012247843,0.00017701935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025591398,0.0000094718225,0.000045940782,0.00006051879,0.000010125229,0.000043354597,0.000828961,0.8908569,0.000080715065,0.025796872,0.000010887431,0.08225367],"study_design_scores_gemma":[0.0002377861,0.00013981487,0.00010375163,0.0008890227,0.00000795897,0.000006624839,4.34309e-7,0.98839563,0.0005104836,0.007647859,0.0014654417,0.0005952022],"about_ca_topic_score_codex":0.00006132382,"about_ca_topic_score_gemma":0.000019768753,"teacher_disagreement_score":0.72704726,"about_ca_system_score_codex":0.000374426,"about_ca_system_score_gemma":0.00040634946,"threshold_uncertainty_score":0.9997101},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016966637,0.00049963564,0.9954383,0.00042697217,0.0012428572,0.0014233581,0.000034390043,0.00034684016,0.00041797833],"genre_scores_gemma":[0.2879017,0.00014461261,0.7097691,0.00064002525,0.00030414792,0.00023104995,0.00003514782,0.00010818669,0.00086601987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946843,0.000050271745,0.00072705856,0.002456914,0.0012577167,0.00082378805],"domain_scores_gemma":[0.9957797,0.0018468575,0.0004471236,0.0011546913,0.00053551036,0.00023612462],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018073756,0.00062986667,0.00079139206,0.00077793153,0.00044403266,0.0014038045,0.0025652123,0.00038015228,0.0000032613536],"category_scores_gemma":[0.0005102796,0.00057840033,0.00015230253,0.000864159,0.00036277215,0.0012137941,0.0019174297,0.0005814076,0.000017206847],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041755284,0.000038860962,0.000121802295,0.00065135345,0.000039337447,0.00005134739,0.0011160399,0.008901028,0.00016417146,0.00088057976,0.000039682658,0.987954],"study_design_scores_gemma":[0.0005508385,0.00021558227,0.00020570464,0.0012988982,0.000019803141,0.00013131041,0.0000014587981,0.93756676,0.00017355735,0.058140036,0.0008043036,0.00089175225],"about_ca_topic_score_codex":0.00003198356,"about_ca_topic_score_gemma":0.00053197116,"teacher_disagreement_score":0.9870623,"about_ca_system_score_codex":0.00030092726,"about_ca_system_score_gemma":0.00086279283,"threshold_uncertainty_score":0.99966675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019405934,0.00021280597,0.99098015,0.0005827151,0.0024627817,0.00036131946,0.000003384704,0.00054607564,0.0046567116],"genre_scores_gemma":[0.33444968,0.00004546183,0.66130716,0.0006700462,0.0008429518,0.000021731885,0.000008127893,0.00011237171,0.0025424627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99527705,0.00004590292,0.0006388467,0.0018302947,0.0015204278,0.0006874599],"domain_scores_gemma":[0.99695826,0.0005966391,0.00039193337,0.0016214071,0.00027175693,0.00015998053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013486352,0.00055731914,0.0005747465,0.0012624224,0.00025372446,0.0007397576,0.0038434837,0.00035256546,0.000008060581],"category_scores_gemma":[0.00008674682,0.0004635998,0.00011376009,0.00125095,0.00048455477,0.0010500973,0.0012582216,0.00093912915,0.00015637568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013420747,0.000021744467,0.00012898588,0.00008274852,0.00002957002,0.0003537872,0.0022612705,0.28507257,0.00008026303,0.035456527,0.000041415173,0.6764577],"study_design_scores_gemma":[0.0002690082,0.0002209668,0.00018210795,0.0012085858,0.000008885896,0.0001729142,3.1728146e-7,0.928317,0.00026512324,0.06807083,0.0005640312,0.00072025013],"about_ca_topic_score_codex":0.000020098061,"about_ca_topic_score_gemma":0.00013108719,"teacher_disagreement_score":0.67573744,"about_ca_system_score_codex":0.00038454725,"about_ca_system_score_gemma":0.0005161744,"threshold_uncertainty_score":0.99978155},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012844185,0.00011761206,0.98046887,0.00074031786,0.0036060952,0.00037167472,0.000013493477,0.00051473564,0.014165917],"genre_scores_gemma":[0.00074965775,0.00005407993,0.96775866,0.0019490251,0.00147251,0.000024164949,0.000064712585,0.00007170692,0.02785551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949425,0.000060707385,0.00043068695,0.0019287998,0.0015253929,0.0011119061],"domain_scores_gemma":[0.99675995,0.0005116611,0.00013540476,0.0022186486,0.00017965892,0.00019466404],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017825313,0.00047223974,0.00046990867,0.0012758553,0.00029722156,0.0016803395,0.008150632,0.00023556815,0.000026253336],"category_scores_gemma":[0.00010229428,0.00043836323,0.00009363855,0.0036200003,0.00040149837,0.0013831643,0.005584936,0.0009004392,0.00058362546],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017256482,0.000047426754,0.000031092433,0.000092061506,0.000020270225,0.00022438524,0.00033315225,0.021752413,0.000023959106,0.07559189,0.0031418456,0.89873976],"study_design_scores_gemma":[0.00019318424,0.000089905676,0.000063469015,0.0002076275,0.0000053390245,0.000012274373,1.1103155e-7,0.72714037,0.00011238572,0.266206,0.0054428643,0.00052646874],"about_ca_topic_score_codex":0.0000257261,"about_ca_topic_score_gemma":0.00001629643,"teacher_disagreement_score":0.8982133,"about_ca_system_score_codex":0.0003773475,"about_ca_system_score_gemma":0.0014126449,"threshold_uncertainty_score":0.9998068},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000538018,0.000462362,0.99015445,0.0010501827,0.0061189365,0.00068438635,0.0000092876435,0.00067534635,0.0003070446],"genre_scores_gemma":[0.13786449,0.00003502793,0.8584163,0.0011039117,0.0012281426,0.000033311237,0.00012872842,0.00008509211,0.0011049804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939643,0.00018108133,0.0008485998,0.0024398318,0.001683247,0.0008828964],"domain_scores_gemma":[0.99617475,0.0018053808,0.00043397254,0.00079133693,0.0005538193,0.0002407434],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001694988,0.00069726026,0.00073171663,0.0014147366,0.00044124504,0.0011466397,0.0022972547,0.00035618877,0.0000044914555],"category_scores_gemma":[0.00022507351,0.000692787,0.00017443683,0.002325844,0.001028431,0.0009971765,0.0026430266,0.0011225869,0.00008415493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005673446,0.000061283055,0.00016893973,0.00012620918,0.000020736712,0.00011312635,0.00059081253,0.18391243,0.000030701958,0.002769912,0.00026817142,0.811932],"study_design_scores_gemma":[0.00033918075,0.000119122284,0.0029064347,0.00017078064,0.00000700253,0.00009473446,2.8073654e-7,0.7078289,0.000035606958,0.28787816,0.00009322244,0.0005265639],"about_ca_topic_score_codex":0.000032491254,"about_ca_topic_score_gemma":0.00010659436,"teacher_disagreement_score":0.8114055,"about_ca_system_score_codex":0.00088987034,"about_ca_system_score_gemma":0.0013825028,"threshold_uncertainty_score":0.99989027},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016074286,0.00005577624,0.9917074,0.000104373066,0.0018605853,0.00061165856,0.000020016796,0.0012044618,0.004274999],"genre_scores_gemma":[0.077079855,0.00021777568,0.9130453,0.0009767283,0.001463537,0.0002058903,0.00036513738,0.0006278801,0.006017909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998445,0.000006863739,0.00030632317,0.0005370426,0.00032985723,0.0003749188],"domain_scores_gemma":[0.9991094,0.0002686999,0.00007983175,0.00038095718,0.000085847445,0.00007527579],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029872468,0.0003342315,0.0003052196,0.00071789575,0.00012867917,0.00017847276,0.00043808174,0.00024164858,0.000018486226],"category_scores_gemma":[0.00007842828,0.00033410912,0.00009332854,0.00049114524,0.00011457626,0.00013898585,0.000088429064,0.00036008138,0.00006322735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000882708,0.000008378198,0.000007773054,0.0001304621,0.00001990271,0.0000028465593,0.0004021769,0.9356293,0.0010745191,0.0009114972,0.00033574156,0.06146858],"study_design_scores_gemma":[0.00023515492,0.00005738971,0.0000135914415,0.0004033292,0.0000060686357,0.0000028502784,6.3769924e-8,0.9906532,0.0017631546,0.0044627674,0.0020205798,0.0003818492],"about_ca_topic_score_codex":0.000002601974,"about_ca_topic_score_gemma":0.000007759485,"teacher_disagreement_score":0.0786621,"about_ca_system_score_codex":0.00014124955,"about_ca_system_score_gemma":0.000050496925,"threshold_uncertainty_score":0.99991107},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005122909,0.00028957165,0.97133154,0.0007705918,0.017769802,0.0025848506,0.000019820516,0.0004887112,0.001622219],"genre_scores_gemma":[0.31263527,0.00157308,0.6287519,0.033447117,0.013265953,0.00022535138,0.00016779988,0.0012376007,0.0086959405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9904277,0.00065389165,0.002949826,0.0019671537,0.0016115957,0.0023898797],"domain_scores_gemma":[0.9877787,0.008365209,0.0011133224,0.0016290502,0.00046316863,0.0006505191],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.009118356,0.00071467593,0.0015545385,0.0011063725,0.001045618,0.00008535005,0.0017022124,0.001510306,0.0003955805],"category_scores_gemma":[0.0013221616,0.0006290048,0.0003267214,0.0010284149,0.0006240623,0.00016603393,0.00069679,0.0041064997,0.0010488885],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028622668,0.000109518296,0.023681168,0.0012682185,0.000050975606,0.0004916871,0.00073747634,0.017470479,0.00006775771,0.0013638237,0.0018365514,0.9526361],"study_design_scores_gemma":[0.0035305042,0.00057274214,0.0012366899,0.011417208,0.00006509975,0.000032155698,0.0000016034087,0.9147396,0.000018217417,0.030761382,0.03630795,0.001316816],"about_ca_topic_score_codex":0.00019387345,"about_ca_topic_score_gemma":0.0027998302,"teacher_disagreement_score":0.9513193,"about_ca_system_score_codex":0.0018055324,"about_ca_system_score_gemma":0.012704373,"threshold_uncertainty_score":0.99978596},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009429037,0.000087560584,0.9981358,0.0005236213,0.0001489763,0.00073497085,0.00003597152,0.00006810126,0.00017070373],"genre_scores_gemma":[0.8859276,0.000028356066,0.11280267,0.00010580123,0.00021033287,0.00008140965,0.00015225167,0.000024532565,0.00066702423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980378,0.00005724022,0.00040018553,0.00057816406,0.0006716761,0.00025494865],"domain_scores_gemma":[0.9975314,0.0013875919,0.00032420934,0.00033605742,0.00036596516,0.0000547688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022680461,0.00018939468,0.00029357025,0.00034137978,0.0007413502,0.00009334625,0.0007476871,0.00021036167,0.000014363549],"category_scores_gemma":[0.00036600477,0.0001513057,0.00018706694,0.0005755015,0.0010861678,0.00010247945,0.000015583864,0.00035446673,0.0000016819795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024709836,0.00007029697,0.00017347388,0.000086360094,0.000022780801,2.1902136e-7,0.0053492775,0.86309016,0.0011998072,0.010945431,8.2709727e-7,0.11903666],"study_design_scores_gemma":[0.00030936304,0.000036720936,0.0005794625,0.00006113484,0.00004833192,4.324383e-8,0.000015807427,0.99557364,0.0001068889,0.0027473886,0.00035477124,0.00016642116],"about_ca_topic_score_codex":0.0020388975,"about_ca_topic_score_gemma":0.011142314,"teacher_disagreement_score":0.8858333,"about_ca_system_score_codex":0.00015995036,"about_ca_system_score_gemma":0.00060475204,"threshold_uncertainty_score":0.6217673},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002755092,0.00034574833,0.9825233,0.011204037,0.0036118957,0.0011923839,0.000038794235,0.000682266,0.00037400372],"genre_scores_gemma":[0.050750602,0.00035163245,0.93415505,0.0072534042,0.0013531027,0.00025783989,0.0003532147,0.00024066464,0.005284465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99440765,0.00011732437,0.00090317667,0.0020552888,0.0009911979,0.0015253704],"domain_scores_gemma":[0.995996,0.0010676698,0.0005741591,0.0015407427,0.000501452,0.000320003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024086682,0.0006277707,0.000744235,0.001542763,0.0006505924,0.00046912502,0.0038204584,0.00034683628,0.000015391006],"category_scores_gemma":[0.00043687545,0.00059691735,0.00019237662,0.0015817392,0.00030874583,0.00048594995,0.0007818244,0.0017753864,0.000059681006],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010134662,0.00003068855,0.00037114377,0.00017305733,0.00002047149,0.000020312795,0.001234167,0.013279219,0.0000019324732,0.11629603,0.00067333935,0.8678895],"study_design_scores_gemma":[0.00040561886,0.00093536376,0.00024676797,0.00065359706,0.0000052916107,0.000049387298,8.6924643e-7,0.71777225,0.000017758097,0.24813563,0.030966572,0.00081091025],"about_ca_topic_score_codex":0.0007020697,"about_ca_topic_score_gemma":0.0035582294,"teacher_disagreement_score":0.8670786,"about_ca_system_score_codex":0.0014519328,"about_ca_system_score_gemma":0.003532857,"threshold_uncertainty_score":0.9996482},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013943684,0.0030372366,0.97146744,0.021323672,0.0011849672,0.0025683057,0.000007722973,0.000095179,0.00031409337],"genre_scores_gemma":[0.0060850377,0.0018226693,0.96854466,0.01889305,0.0025656659,0.00041658946,0.000019425752,0.00013094269,0.0015219636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921676,0.00017497782,0.0011251228,0.0013368962,0.0043820045,0.00081339874],"domain_scores_gemma":[0.9933636,0.0028415897,0.00031210715,0.0024484226,0.0007702734,0.000263978],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.013722858,0.00037267394,0.0010942329,0.00072438084,0.000357087,0.0002866504,0.009834318,0.00030082883,0.000024900122],"category_scores_gemma":[0.0011603594,0.00024870047,0.00022279493,0.0013383271,0.0004915532,0.00019284517,0.0033991355,0.0010543626,0.000038908925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000792998,0.00003191378,0.000007782296,0.099010125,0.00006686654,0.00010840617,0.0022733412,0.0066910204,0.00002221755,0.2125962,0.0027459476,0.6764383],"study_design_scores_gemma":[0.00021510503,0.0003238848,0.000011974424,0.10450816,0.00003596671,0.000108101,0.0000021103854,0.83390707,0.000043120952,0.056599557,0.0036892567,0.00055570086],"about_ca_topic_score_codex":0.000028851382,"about_ca_topic_score_gemma":0.00015574427,"teacher_disagreement_score":0.827216,"about_ca_system_score_codex":0.00013623617,"about_ca_system_score_gemma":0.0008623029,"threshold_uncertainty_score":0.99999654},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003137537,0.00014922745,0.9958085,0.0005010632,0.0012147656,0.0005022145,0.000009666583,0.00031576236,0.0011850898],"genre_scores_gemma":[0.8099628,0.0011289589,0.17831317,0.0048573962,0.002290692,0.0007411342,0.00014697928,0.000113526956,0.0024453537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757373,0.00003503563,0.00044038417,0.0007594105,0.000732452,0.00045898923],"domain_scores_gemma":[0.9980431,0.0004053915,0.00019615266,0.0010174817,0.0001793943,0.00015845112],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00073385966,0.00028693205,0.00032897195,0.0009783093,0.00025024966,0.0010996604,0.0020783942,0.00027991447,9.013026e-7],"category_scores_gemma":[0.000033895543,0.00025933833,0.000056455614,0.0017510012,0.00045916493,0.0009858685,0.0011349593,0.00052846206,0.000088254164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019186646,0.000026081952,0.0002577345,0.00021025103,0.000013712029,0.00001690709,0.00075203774,0.0142052695,0.00006914058,0.099987395,0.0011532867,0.88330626],"study_design_scores_gemma":[0.0001575369,0.000054204695,0.0004896862,0.00020984496,0.000004455282,0.000045826237,2.3669664e-7,0.96181756,0.000028695393,0.025909059,0.010911647,0.00037123633],"about_ca_topic_score_codex":0.000031983356,"about_ca_topic_score_gemma":0.00003334896,"teacher_disagreement_score":0.9476123,"about_ca_system_score_codex":0.00013104473,"about_ca_system_score_gemma":0.0007948537,"threshold_uncertainty_score":0.9999859},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024525668,0.00011197234,0.99004006,0.0010119361,0.0011354971,0.0026400315,0.000050327868,0.00012894043,0.0024286723],"genre_scores_gemma":[0.7407866,0.000018619385,0.2564615,0.00029135632,0.00077785953,0.000101073594,0.000023849178,0.000050790957,0.0014883705],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619853,0.000057252477,0.00076128973,0.001315594,0.0009628922,0.0007044307],"domain_scores_gemma":[0.995604,0.0025558525,0.00046913794,0.0008379207,0.0003549637,0.00017813516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0038442998,0.00038581435,0.0006808282,0.0002731671,0.00074854604,0.00032106825,0.0020486207,0.0003651435,0.000037571772],"category_scores_gemma":[0.0004125156,0.00029437887,0.00037170382,0.00053339195,0.0017429772,0.00036461288,0.00020233855,0.0004820195,9.250893e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012728048,0.00019255928,0.0112654865,0.0011960274,0.00014898008,0.000008806071,0.019306349,0.12768677,0.00013825565,0.027339078,0.00049138186,0.81209904],"study_design_scores_gemma":[0.00228908,0.00040402828,0.01352258,0.0008443814,0.0002736245,0.0000022091047,0.0001191511,0.39246002,0.00069417054,0.5818775,0.0053699003,0.0021433365],"about_ca_topic_score_codex":0.00044300238,"about_ca_topic_score_gemma":0.0060792724,"teacher_disagreement_score":0.80995566,"about_ca_system_score_codex":0.0003074433,"about_ca_system_score_gemma":0.0028912316,"threshold_uncertainty_score":0.9999508},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003848026,0.00034581302,0.9847283,0.0077438476,0.004636524,0.00048202657,0.0000019793786,0.000415956,0.0016070865],"genre_scores_gemma":[0.12495728,0.00026992036,0.8541744,0.009088845,0.0063624624,0.0001296406,0.00004665632,0.0002546105,0.0047162375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937357,0.00021060464,0.0011152402,0.002191932,0.0015897722,0.0011568011],"domain_scores_gemma":[0.9952636,0.00203826,0.00034511738,0.0018875088,0.00022526484,0.00024028953],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00327549,0.00057298125,0.00081234664,0.0025245387,0.00021164429,0.0002868662,0.006108374,0.00044035292,0.00002936685],"category_scores_gemma":[0.0012637217,0.0005179893,0.00008538613,0.0048577334,0.000979069,0.00042834465,0.0020636232,0.0023196572,0.0002383703],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035108205,0.000019257,0.00022974076,0.00010709876,0.0000025310476,0.00028733976,0.0022039637,0.08481547,0.000010512633,0.017149778,0.00012517194,0.89504564],"study_design_scores_gemma":[0.00003627425,0.00016061193,0.0004294602,0.00077389105,0.0000015900976,0.000028842354,4.106909e-7,0.6314658,0.00006208841,0.36622944,0.00042569102,0.0003858943],"about_ca_topic_score_codex":0.00032937463,"about_ca_topic_score_gemma":0.0013213727,"teacher_disagreement_score":0.8946597,"about_ca_system_score_codex":0.00093270617,"about_ca_system_score_gemma":0.001876662,"threshold_uncertainty_score":0.99998206},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011037924,0.000089117086,0.9868828,0.0007194622,0.0007244998,0.0003780534,0.00002735299,0.000075255106,0.00006554431],"genre_scores_gemma":[0.73636293,0.000014260181,0.26245028,0.00079903705,0.00014854223,0.000017630598,0.0000321312,0.00004231426,0.00013285055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967302,0.000045547346,0.000576017,0.001242599,0.0009449339,0.00046070086],"domain_scores_gemma":[0.99726087,0.0003238061,0.00040721716,0.0018975445,0.00004644818,0.00006409337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011779912,0.0003326054,0.00035562174,0.0005284437,0.00018706535,0.00013092093,0.0052526193,0.00021300132,0.0000031681132],"category_scores_gemma":[0.00011167288,0.0002758726,0.000052701333,0.00068060844,0.0012848254,0.00038970838,0.0035615666,0.0007935095,0.0000080382815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047193457,0.00025664535,0.09270933,0.00012509625,0.00006719104,0.00023930964,0.003740646,0.24013741,0.015650077,0.05665886,0.00005503123,0.5903557],"study_design_scores_gemma":[0.00031227444,0.00009345814,0.031084955,0.0009048635,0.000018439488,0.000011882326,0.0000018706373,0.89751494,0.003554669,0.06573146,0.00017597839,0.0005952087],"about_ca_topic_score_codex":0.00009563439,"about_ca_topic_score_gemma":0.000095261305,"teacher_disagreement_score":0.72532505,"about_ca_system_score_codex":0.00025341977,"about_ca_system_score_gemma":0.00030715662,"threshold_uncertainty_score":0.99996936},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045244593,0.00007136274,0.99217683,0.000963132,0.00064991135,0.0009808136,0.00070072914,0.00009449597,0.004317494],"genre_scores_gemma":[0.017451553,0.00006217473,0.9801822,0.0006379008,0.00035438596,0.000053571202,0.00018107664,0.000049884966,0.0010272816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99673545,0.000039147362,0.0005381842,0.0007861189,0.0012785618,0.0006225093],"domain_scores_gemma":[0.99668837,0.0013703086,0.0006992838,0.0005943492,0.00053592765,0.00011177809],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003601215,0.0003968877,0.00068158587,0.0007539689,0.0008716294,0.00032596575,0.001630644,0.00032734426,0.000006990213],"category_scores_gemma":[0.00019702951,0.00032108638,0.000095340554,0.0008045088,0.0009488853,0.0005991667,0.0006503924,0.0005986,0.000007341721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013360148,0.000059355647,0.00023650561,0.0012015529,0.00025640917,0.000030156223,0.11627034,0.038442984,0.0005247293,0.5460576,0.00117912,0.29560763],"study_design_scores_gemma":[0.0031434835,0.00090110983,0.000631664,0.014834538,0.00028543253,0.0001373845,0.0013700495,0.020079253,0.0005544553,0.8217805,0.13157624,0.004705891],"about_ca_topic_score_codex":0.0034758493,"about_ca_topic_score_gemma":0.010148529,"teacher_disagreement_score":0.29090175,"about_ca_system_score_codex":0.00014159031,"about_ca_system_score_gemma":0.000521362,"threshold_uncertainty_score":0.9999241},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009868749,0.0001849317,0.9971384,0.00009924913,0.00075691205,0.00015324666,0.000024115887,0.000147816,0.00050849206],"genre_scores_gemma":[0.9408951,0.00014323421,0.058494687,0.00011788891,0.00013166889,0.000028987304,0.00007781704,0.000054371976,0.000056263474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978571,0.000018224851,0.00061466603,0.00063640135,0.00054177357,0.00033185692],"domain_scores_gemma":[0.9989139,0.00019351713,0.00014730365,0.00049006473,0.00018067806,0.000074545016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003780509,0.00034377052,0.00044889766,0.00062582915,0.000059329228,0.00006292807,0.00055287697,0.00030444306,0.000015155911],"category_scores_gemma":[0.000038532402,0.00034834797,0.00006957058,0.0003711751,0.00019203254,0.00012216471,0.00021794748,0.00039277202,0.0000014482398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002501497,0.000014911069,0.000016922444,0.00002070855,0.000007836567,0.0000058133464,0.00010798581,0.50640064,0.012703885,0.0066350745,0.000027473518,0.47405627],"study_design_scores_gemma":[0.00016152076,0.000050194372,0.00018308102,0.000352224,0.000008298882,0.0000036326041,2.9855147e-7,0.9420532,0.02247927,0.034143694,0.00026185255,0.00030275228],"about_ca_topic_score_codex":0.001922443,"about_ca_topic_score_gemma":0.00278965,"teacher_disagreement_score":0.9399082,"about_ca_system_score_codex":0.00033924673,"about_ca_system_score_gemma":0.00018676188,"threshold_uncertainty_score":0.9998968},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006451275,0.00010989638,0.9944941,0.00063287833,0.00075888366,0.0027846203,0.000020821546,0.00049864093,0.00063567533],"genre_scores_gemma":[0.020355187,0.00002824758,0.9772307,0.0008057228,0.0004866254,0.00055057387,0.000076327706,0.000086787,0.00037977414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559915,0.000047365673,0.0005384317,0.0021602488,0.0008211242,0.00083367183],"domain_scores_gemma":[0.99510914,0.0019261491,0.00040396888,0.0021038644,0.00027791367,0.00017897905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007331209,0.00057761424,0.00054061593,0.000653664,0.00050798146,0.0004701243,0.0051734457,0.00027034257,0.0000040144596],"category_scores_gemma":[0.00029376693,0.00056364055,0.00017928696,0.00123879,0.0003623056,0.0008310089,0.0035095,0.0006376835,0.00003003782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013154526,0.000041316744,0.00003551817,0.0001222855,0.00002467078,0.000011408424,0.001025612,0.23739165,0.0007747406,0.023372702,0.00034008655,0.73684686],"study_design_scores_gemma":[0.00026520964,0.00010495693,0.00008338115,0.00008692471,0.000008936374,0.000012301578,2.3600562e-7,0.6659386,0.0015681925,0.3306269,0.0008537623,0.00045058024],"about_ca_topic_score_codex":0.000010959062,"about_ca_topic_score_gemma":0.000016100797,"teacher_disagreement_score":0.73639625,"about_ca_system_score_codex":0.00040099284,"about_ca_system_score_gemma":0.00022288994,"threshold_uncertainty_score":0.99968153},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028916857,0.00008102317,0.9944641,0.0020653328,0.0023324897,0.0005551888,0.000024874182,0.0001914916,0.00025660935],"genre_scores_gemma":[0.10233893,0.00018996235,0.8907545,0.0016656871,0.0029681786,0.00006714071,0.0000682199,0.00009287487,0.0018544714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952311,0.000043753455,0.00058959704,0.0019013758,0.0014777565,0.0007564074],"domain_scores_gemma":[0.99742204,0.00048797094,0.0002552372,0.0010878473,0.00046436035,0.0002825271],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012808392,0.0005605823,0.00056865934,0.00053662236,0.000525501,0.00067722466,0.0027238934,0.0004594233,0.000027463977],"category_scores_gemma":[0.0003038838,0.0004892689,0.00022221306,0.000498499,0.0005969594,0.0008172301,0.0013254189,0.0005993365,0.000041673567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000977368,0.000038684615,0.000017941147,0.00005131388,0.000022401635,0.00011977507,0.0004925739,0.456915,0.0016042523,0.011690908,0.00085543055,0.52818197],"study_design_scores_gemma":[0.00024348535,0.000096431686,0.000016568634,0.00020539704,0.0000103049915,0.00002270078,8.869424e-8,0.9477289,0.0008441372,0.0501705,0.00014159379,0.0005199235],"about_ca_topic_score_codex":0.000020808668,"about_ca_topic_score_gemma":0.00031004954,"teacher_disagreement_score":0.52766204,"about_ca_system_score_codex":0.00026827623,"about_ca_system_score_gemma":0.0010014278,"threshold_uncertainty_score":0.9997559},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004649498,0.00040576365,0.97836035,0.0044039497,0.0025192804,0.0010996549,0.000023961838,0.0005511055,0.007986418],"genre_scores_gemma":[0.8835215,0.00048974983,0.07875129,0.032371085,0.002608632,0.000041260973,0.00023588525,0.0002669559,0.001713651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697906,0.000029710005,0.00043030005,0.0010742729,0.00094122643,0.0005454452],"domain_scores_gemma":[0.9984605,0.0005031637,0.0001223081,0.0005568654,0.00015497307,0.00020224445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004074156,0.0004611482,0.0005180732,0.0007726399,0.00020795118,0.00011471968,0.00049367535,0.00034939495,0.00012256706],"category_scores_gemma":[0.0002746091,0.0003728577,0.00017796547,0.000778024,0.00023153174,0.00011296412,0.00021231422,0.0009469358,0.00020389749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003726903,0.00019428729,0.00146392,0.0005554043,0.00003455703,0.0012033444,0.0004606671,0.47117618,0.0022591436,0.00062789593,0.00024435224,0.5214076],"study_design_scores_gemma":[0.00088477816,0.00067468785,0.00079226843,0.00044011645,0.000047318917,0.000017262751,2.3098222e-7,0.99022686,0.00039818647,0.004628184,0.0014111244,0.0004790052],"about_ca_topic_score_codex":0.000022584421,"about_ca_topic_score_gemma":0.000025873213,"teacher_disagreement_score":0.8996091,"about_ca_system_score_codex":0.00013150748,"about_ca_system_score_gemma":0.00030928143,"threshold_uncertainty_score":0.9998723},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0155698955,0.000017135275,0.9785583,0.0043109036,0.0005452356,0.00044241684,0.000006786814,0.000071088725,0.00047823283],"genre_scores_gemma":[0.99106634,0.000039756043,0.0077334456,0.00032886962,0.00040563452,0.0000133174435,0.00010345864,0.000029601173,0.00027956424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973346,0.00004230989,0.00046419373,0.00063801714,0.0012541498,0.0002667471],"domain_scores_gemma":[0.99635524,0.002195927,0.00025172654,0.0003601335,0.0006819245,0.0001550632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078997127,0.00020042682,0.00034061348,0.00047632068,0.00017230601,0.00003529686,0.00022511755,0.0002747052,0.0000470876],"category_scores_gemma":[0.0014963167,0.00016270994,0.000061567065,0.000474073,0.0007923399,0.00009751342,0.00008605569,0.0008716187,0.000049547943],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039058906,0.00021230183,0.014877193,0.0003772561,0.00006443252,0.0002768855,0.00709235,0.026606416,0.0016107113,0.009012342,0.000066898785,0.9394126],"study_design_scores_gemma":[0.00029530493,0.0014032249,0.025841497,0.003916202,0.00007106298,0.00020246142,0.00008323715,0.9050899,0.025324566,0.03708133,0.000100131736,0.0005910562],"about_ca_topic_score_codex":0.00026209172,"about_ca_topic_score_gemma":0.00044261495,"teacher_disagreement_score":0.9754965,"about_ca_system_score_codex":0.0001647093,"about_ca_system_score_gemma":0.0008970579,"threshold_uncertainty_score":0.66351193},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013016732,0.00020936807,0.9956371,0.000091690585,0.0008677444,0.00030495855,0.000015070019,0.0002828346,0.0012895295],"genre_scores_gemma":[0.48158783,0.000020005247,0.51650864,0.00021186897,0.00017917354,0.000010897667,0.00003325352,0.00021319478,0.0012351221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983036,0.000019835274,0.00034703893,0.00044605724,0.00053590286,0.000347549],"domain_scores_gemma":[0.99854064,0.0007337337,0.00013680608,0.0004630847,0.00006952358,0.0000561965],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027962698,0.00033377795,0.0003144283,0.00029896808,0.000117310214,0.00006142596,0.0005851102,0.00018617099,0.000029444382],"category_scores_gemma":[0.00019241527,0.00028344215,0.00008554055,0.00047203546,0.0002446137,0.00011181798,0.00017185959,0.000775809,0.000032902277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015381655,0.0000021613257,0.000010968302,0.00008038793,0.000007395862,0.000008100707,0.00014456526,0.9521639,0.0003301699,0.00006918541,0.0000056316185,0.047176044],"study_design_scores_gemma":[0.00014150486,0.000021598213,0.000037342445,0.0004605563,0.000015979014,0.000011534241,2.1310805e-7,0.9949414,0.0024625242,0.0013833656,0.00024118499,0.00028277803],"about_ca_topic_score_codex":0.000008590359,"about_ca_topic_score_gemma":0.000013026385,"teacher_disagreement_score":0.48028615,"about_ca_system_score_codex":0.0001999602,"about_ca_system_score_gemma":0.00006249284,"threshold_uncertainty_score":0.9999618},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050227484,0.00007522952,0.99304134,0.0006373243,0.00039179283,0.0006277267,0.0000014913446,0.00016144391,0.000040906853],"genre_scores_gemma":[0.3171146,0.0000025402956,0.68253857,0.00009747541,0.00013883108,0.0000047623967,0.0000043968676,0.000041981664,0.00005683553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962135,0.00018366844,0.0006526728,0.0012156182,0.0010085619,0.0007259569],"domain_scores_gemma":[0.99708194,0.0015119726,0.00048666785,0.00069509784,0.00010565532,0.000118671895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0044492185,0.0004391298,0.0005338519,0.0010631825,0.00060372753,0.0010310843,0.002205903,0.00021166557,0.0000019828542],"category_scores_gemma":[0.00048117968,0.00034756106,0.00023294316,0.0007469199,0.0002147459,0.0005221138,0.0011402913,0.0017365752,0.0000068550853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028655925,0.000009095196,0.00025626962,0.000015328982,0.00000886715,0.0000079231295,0.0019734518,0.6228805,0.000093233895,0.0005208524,0.0000010992395,0.37423047],"study_design_scores_gemma":[0.00023523916,0.00018351866,0.0015155787,0.0009667233,0.000007218172,0.000028999031,0.0000047678936,0.9609866,0.00004307269,0.035477046,0.0001712249,0.00038000342],"about_ca_topic_score_codex":0.0002339482,"about_ca_topic_score_gemma":0.000011893843,"teacher_disagreement_score":0.3738505,"about_ca_system_score_codex":0.00074037194,"about_ca_system_score_gemma":0.00080682413,"threshold_uncertainty_score":0.99989766},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003525161,0.0010069201,0.9672368,0.002276085,0.0051507805,0.0003861382,0.000006359914,0.00015715562,0.020254571],"genre_scores_gemma":[0.91634446,0.00012598676,0.01106215,0.00083394255,0.0011052764,0.00004398815,0.00008019244,0.00013069031,0.070273325],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979189,0.000034746125,0.00037441525,0.00087786117,0.00036912653,0.0004249341],"domain_scores_gemma":[0.9988614,0.00042559148,0.00019656813,0.0003911642,0.000059522885,0.00006578588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006917392,0.00024560082,0.00025391634,0.00063240033,0.00007040353,0.00008202598,0.00058073906,0.0002549002,0.00020929548],"category_scores_gemma":[0.000108640634,0.00025592194,0.00005552179,0.0004568085,0.00020433847,0.000090611305,0.00015319666,0.0008654202,0.0002838807],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014493516,0.00006531275,0.0042217765,0.00004168789,0.000018183715,0.00006310593,0.016202983,0.015056433,0.0003817778,0.027126938,0.0003023634,0.93650496],"study_design_scores_gemma":[0.002650135,0.0010862143,0.07935118,0.0044304426,0.00007025365,0.00028299284,0.00013116903,0.1178923,0.00088615087,0.49659342,0.29045165,0.006174114],"about_ca_topic_score_codex":0.00008511535,"about_ca_topic_score_gemma":0.00010521904,"teacher_disagreement_score":0.9561747,"about_ca_system_score_codex":0.00020605563,"about_ca_system_score_gemma":0.00011593957,"threshold_uncertainty_score":0.9999893},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063033546,0.00027606968,0.98755616,0.0020626292,0.002138962,0.0010087139,0.000016608872,0.00042437288,0.00021313748],"genre_scores_gemma":[0.89224243,0.000012656836,0.10301168,0.0022548356,0.00080084713,0.00003569979,0.000013367017,0.000091504015,0.0015369976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99478257,0.00014858326,0.0008690832,0.001720476,0.0015628265,0.0009164503],"domain_scores_gemma":[0.9962496,0.00050531805,0.0003823875,0.0022870055,0.00030739777,0.000268255],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018584167,0.00062193547,0.00064663653,0.00083715876,0.0006614635,0.0013181941,0.004362474,0.0002935591,0.000008873805],"category_scores_gemma":[0.00018528168,0.00048266008,0.00019004894,0.0016421103,0.0003394286,0.0005282659,0.0016951726,0.00074705714,0.000054675285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043072625,0.00011788671,0.00005748522,0.00037220385,0.00015636851,0.00040330683,0.32815692,0.43660036,0.041865908,0.03846504,0.00033031488,0.15343115],"study_design_scores_gemma":[0.00017860463,0.000071479975,0.0000768496,0.00050186645,0.000014058965,0.000028566717,0.0000052350056,0.97684383,0.0007567806,0.020764176,0.00014663034,0.0006118961],"about_ca_topic_score_codex":0.00021808036,"about_ca_topic_score_gemma":0.0005745774,"teacher_disagreement_score":0.88593906,"about_ca_system_score_codex":0.00031101046,"about_ca_system_score_gemma":0.0005942509,"threshold_uncertainty_score":0.99976254},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007570717,0.00015819473,0.99338895,0.00088081294,0.0018127959,0.0003193659,0.000015650083,0.0002775247,0.003070982],"genre_scores_gemma":[0.039492283,0.00035319565,0.9447342,0.00621038,0.0011136488,0.000040061506,0.00015963278,0.00016994396,0.007726652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599737,0.00003391668,0.00045236564,0.0017344872,0.00094407244,0.00083777006],"domain_scores_gemma":[0.9979593,0.00045712164,0.00020396076,0.0011883511,0.00006457722,0.00012668564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013541549,0.00044630197,0.00041669214,0.0011775012,0.00023260186,0.000865938,0.0041248146,0.00019699833,0.000012807436],"category_scores_gemma":[0.00007127276,0.0004513511,0.000092293856,0.0011878214,0.00030878469,0.001346477,0.0035381687,0.00071702246,0.000094207295],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023752339,0.000021521011,0.00040247617,0.000059371647,0.000012051774,0.00032802473,0.001196327,0.005637301,0.0000627344,0.009879244,0.0008485601,0.98155004],"study_design_scores_gemma":[0.0007192243,0.00015343756,0.0004186794,0.0010011023,0.000011729638,0.00001992659,0.0000034609955,0.87756646,0.0004975727,0.10087143,0.017017614,0.0017193604],"about_ca_topic_score_codex":0.00028779768,"about_ca_topic_score_gemma":0.00017876782,"teacher_disagreement_score":0.9798307,"about_ca_system_score_codex":0.0002669901,"about_ca_system_score_gemma":0.00017942241,"threshold_uncertainty_score":0.9997938},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082680126,0.00033666528,0.9915834,0.0007326476,0.004833929,0.00019264274,0.0000018884793,0.00086477783,0.0013713691],"genre_scores_gemma":[0.039286014,0.00012894724,0.95014775,0.001979394,0.0019212206,0.00003599278,0.00000839672,0.000102780374,0.00638949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996723,0.000021890974,0.0003643912,0.0012706086,0.0008178139,0.00080230105],"domain_scores_gemma":[0.9974855,0.0008018438,0.00012411081,0.0013567337,0.00010761123,0.00012418743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076077844,0.00041046162,0.00046264,0.0010021934,0.00013098637,0.00056714955,0.0045525874,0.00028187252,0.000004380281],"category_scores_gemma":[0.00028658423,0.00036906786,0.00011256319,0.0016234994,0.00027810963,0.0004447277,0.0018574366,0.00067444297,0.00020103603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025195693,0.000036321697,0.00018720354,0.000186719,0.000026231488,0.0007604075,0.0011678315,0.15683158,0.00042544343,0.016299691,0.002115244,0.8219608],"study_design_scores_gemma":[0.00015204528,0.000064410786,0.00040041236,0.00031424928,0.0000037595544,0.000052821546,8.054161e-8,0.9499018,0.0005226028,0.044852212,0.0031878604,0.0005477359],"about_ca_topic_score_codex":0.000009387701,"about_ca_topic_score_gemma":0.000049122456,"teacher_disagreement_score":0.8214131,"about_ca_system_score_codex":0.00031624598,"about_ca_system_score_gemma":0.0012368117,"threshold_uncertainty_score":0.99987614},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023657413,0.00084523467,0.97330856,0.000085693304,0.00066214846,0.00016511379,0.00011434942,0.000017439392,0.0011440428],"genre_scores_gemma":[0.99532723,0.00030994357,0.0035392724,0.00013821982,0.00019232744,0.0000018513673,0.00009317422,0.000025289106,0.00037267493],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989368,0.000009501119,0.00019565428,0.0005442123,0.00014667568,0.00016716565],"domain_scores_gemma":[0.9992406,0.000048157148,0.00011235632,0.0004413712,0.000107026644,0.000050537605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016784914,0.00020181084,0.00032225822,0.00043440677,0.00006038802,0.00004217908,0.00031399168,0.00020206775,0.00001631967],"category_scores_gemma":[0.000039647563,0.00016609594,0.00017493386,0.00031585104,0.00021828304,0.0000039851866,0.0002727689,0.00018188052,0.0000011778047],"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.000029877501,0.000021590795,0.00045155795,0.00006227907,0.001302251,0.000014076105,0.00052807556,0.031401515,0.673373,0.0031765562,0.00006035715,0.28957888],"study_design_scores_gemma":[0.00056829903,0.0008301716,0.0032742298,0.00031805437,0.00082159624,0.00009356477,0.0000072793646,0.22042014,0.7135655,0.043127697,0.015223413,0.0017500482],"about_ca_topic_score_codex":0.000016228096,"about_ca_topic_score_gemma":0.00011962256,"teacher_disagreement_score":0.97166985,"about_ca_system_score_codex":0.000017019524,"about_ca_system_score_gemma":0.00007163834,"threshold_uncertainty_score":0.6773196},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015225538,0.00029145202,0.9919188,0.0013772621,0.004580242,0.0006173946,0.0000024613082,0.00027789365,0.00078226224],"genre_scores_gemma":[0.29540148,0.00046449053,0.5991743,0.02051288,0.012971665,0.00047965805,0.00007833326,0.00042223686,0.07049493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996586,0.000108998356,0.00043622818,0.0011977073,0.0010384825,0.00063258706],"domain_scores_gemma":[0.9973209,0.0006369477,0.0002839913,0.0015431365,0.00011491076,0.00010012941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015305995,0.00033371188,0.00034931028,0.0005005515,0.00028105953,0.00087116065,0.0044651823,0.00026529233,0.000010823822],"category_scores_gemma":[0.00012039049,0.00023794512,0.00011913568,0.0013221141,0.0003801362,0.0005577863,0.00134982,0.0006858386,0.00044772387],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005103169,0.00005339507,0.00020584388,0.00011109511,0.000028843397,0.00015097547,0.005320128,0.030855523,0.0003035365,0.006176432,0.007270089,0.94951904],"study_design_scores_gemma":[0.00033595107,0.00016339339,0.0052881115,0.00042027913,0.0000097242955,0.000066270564,5.631609e-7,0.91063994,0.00024353291,0.056412164,0.025616085,0.00080398005],"about_ca_topic_score_codex":0.000047941438,"about_ca_topic_score_gemma":0.00011628808,"teacher_disagreement_score":0.94871503,"about_ca_system_score_codex":0.00029005267,"about_ca_system_score_gemma":0.00083813927,"threshold_uncertainty_score":0.970312},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058870373,0.0010178728,0.9933919,0.0011258086,0.0011856502,0.0004736604,0.000002677811,0.001057414,0.0016861918],"genre_scores_gemma":[0.032240577,0.00004531584,0.9653207,0.0013050163,0.00046413505,0.000025678044,0.0000080145655,0.000053522857,0.0005370568],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99592465,0.000025040239,0.00060503226,0.0016319195,0.00093119073,0.0008821686],"domain_scores_gemma":[0.9973769,0.0005479274,0.00028219266,0.0015123471,0.00016090505,0.00011970766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013469864,0.0005236211,0.0005682038,0.0018554383,0.00014733773,0.0005542636,0.004494278,0.0004412567,0.000010015811],"category_scores_gemma":[0.0005708982,0.00045834816,0.00009572077,0.0014733584,0.00042987152,0.00087490893,0.0023119978,0.0014641722,0.00007147294],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007599248,0.00001877728,0.00005760806,0.00013597973,0.0000067294213,0.00058461324,0.004081914,0.0037687693,0.0005490899,0.039248686,0.00010532849,0.9514349],"study_design_scores_gemma":[0.00037898828,0.00020856898,0.00007629421,0.0014953547,0.000006029642,0.00013450661,8.88683e-7,0.28782243,0.01127104,0.6969757,0.0003662763,0.0012638916],"about_ca_topic_score_codex":0.0000832846,"about_ca_topic_score_gemma":0.00048964506,"teacher_disagreement_score":0.950171,"about_ca_system_score_codex":0.00052252354,"about_ca_system_score_gemma":0.0007652388,"threshold_uncertainty_score":0.99978685},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004837593,0.0024057701,0.97238797,0.01977299,0.0018551765,0.0016366971,0.0000027589613,0.001401879,0.000053018837],"genre_scores_gemma":[0.026144017,0.0003121747,0.9661363,0.004760657,0.0008716996,0.00011203045,0.000034630753,0.0001472511,0.0014812667],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9922072,0.00017270532,0.0006155235,0.003402945,0.0017195315,0.0018820437],"domain_scores_gemma":[0.9964029,0.000559431,0.00043102234,0.00170905,0.00018266629,0.000714888],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0028275219,0.0011074545,0.00089555955,0.0014767272,0.001179593,0.005724432,0.00392452,0.0005272709,0.000010823789],"category_scores_gemma":[0.00033196303,0.0009812085,0.0002287451,0.0013759219,0.0006875164,0.0015978398,0.0050993045,0.0024562206,0.00008205858],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067900323,0.000039350427,0.0010355512,0.000067498484,0.000032757416,0.00012077664,0.0016766598,0.0026705225,0.000021160546,0.0023367468,0.00010938845,0.9918828],"study_design_scores_gemma":[0.004070471,0.008577445,0.005120993,0.016105426,0.00034249012,0.003129597,0.00011090413,0.1371855,0.00072228315,0.09541575,0.7133092,0.015909895],"about_ca_topic_score_codex":0.00008732287,"about_ca_topic_score_gemma":0.00031617843,"teacher_disagreement_score":0.9759729,"about_ca_system_score_codex":0.0006150326,"about_ca_system_score_gemma":0.00027827802,"threshold_uncertainty_score":0.99984515},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13401768,0.01170044,0.8401823,0.0027255511,0.005504605,0.0037605802,0.00043892986,0.0002607572,0.0014091402],"genre_scores_gemma":[0.98598737,0.00086436153,0.011682724,0.00010517057,0.00096323114,0.000027231572,0.00006815099,0.00005047042,0.00025128838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973014,0.000029876712,0.00068114715,0.0007107588,0.0009827288,0.00029406446],"domain_scores_gemma":[0.9974143,0.00070496707,0.00039124687,0.0011224613,0.00024695855,0.000120094955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000275124,0.00032141915,0.0007497489,0.00026516485,0.00012575781,0.00003268134,0.00034963334,0.00031148817,0.0000068616428],"category_scores_gemma":[0.0002382753,0.00021637464,0.00034797855,0.0003212767,0.0006405897,0.00008014493,0.0005254048,0.0004662638,0.000008757666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006534778,0.00020651423,0.0012492759,0.00042480274,0.000869259,0.00045646058,0.0010937891,0.18179888,0.0010909925,0.0018061165,0.00008780377,0.8102626],"study_design_scores_gemma":[0.0023390816,0.0011320005,0.011537135,0.0030215906,0.00047186125,0.00008351194,6.0129065e-7,0.8840947,0.0037062312,0.09247866,0.00069520186,0.0004394094],"about_ca_topic_score_codex":0.00008504075,"about_ca_topic_score_gemma":0.00007708269,"teacher_disagreement_score":0.8519697,"about_ca_system_score_codex":0.00032805227,"about_ca_system_score_gemma":0.0007341591,"threshold_uncertainty_score":0.88235015},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062678946,0.00017837776,0.99352336,0.002861408,0.0010905159,0.0003244973,0.000048796443,0.00009039803,0.0012558479],"genre_scores_gemma":[0.48876882,0.00086419843,0.4938155,0.0076047163,0.0020065038,0.00004253969,0.00007683905,0.00017504599,0.0066458145],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695987,0.00005123837,0.0004995066,0.0011931102,0.00086747215,0.00042880885],"domain_scores_gemma":[0.995355,0.002827514,0.00029640528,0.0013241956,0.00007665628,0.00012023366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000994811,0.0003688152,0.00041321266,0.0003904055,0.0001561017,0.00031838383,0.0026831452,0.00019402079,0.000008865757],"category_scores_gemma":[0.00040294876,0.00024153579,0.00006497042,0.0006490628,0.0005960405,0.0005012678,0.0017591821,0.0006570457,0.000033643235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040939158,0.000039490078,0.00023802699,0.000064240834,0.0000114506,0.00019802898,0.0018974093,0.022825198,0.00003279486,0.3533825,0.0004387387,0.6208312],"study_design_scores_gemma":[0.0003564389,0.00013143955,0.00092979515,0.0013025892,0.000003071341,0.000018083365,3.7602348e-7,0.366829,0.0001971109,0.6290769,0.0007611303,0.00039405],"about_ca_topic_score_codex":0.00032897602,"about_ca_topic_score_gemma":0.0001067626,"teacher_disagreement_score":0.62043715,"about_ca_system_score_codex":0.00007740166,"about_ca_system_score_gemma":0.00032590498,"threshold_uncertainty_score":0.98495436},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008520039,0.00059480465,0.9931451,0.0009837099,0.0019849723,0.0003035139,0.000008017931,0.000680111,0.0014477677],"genre_scores_gemma":[0.68240774,0.00050656433,0.30685458,0.005864552,0.0012012535,0.00004702956,0.000013614472,0.00016435441,0.002940318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960232,0.000049598755,0.0005385101,0.0016742065,0.000957113,0.00075740844],"domain_scores_gemma":[0.9972319,0.0008352759,0.00028968713,0.0013471593,0.00009457819,0.00020139325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011815401,0.00057604525,0.00059708336,0.0008165349,0.0003033612,0.0009251793,0.0032536378,0.00028456355,0.000024459194],"category_scores_gemma":[0.000083702726,0.0004978089,0.0001023826,0.00074600434,0.0009474688,0.000733824,0.0019144783,0.0007118527,0.00014955002],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.919123e-7,0.000009715068,0.00018080622,0.000081341954,0.000011345372,0.00018442058,0.00089787756,0.0013223616,0.000053837473,0.017614333,0.00003309867,0.97961015],"study_design_scores_gemma":[0.00016220837,0.00009787062,0.0007507856,0.00083070924,0.0000064432547,0.00011722034,5.5523765e-7,0.62695295,0.00022721423,0.3698127,0.00036297148,0.00067836716],"about_ca_topic_score_codex":0.000039088696,"about_ca_topic_score_gemma":0.00008430438,"teacher_disagreement_score":0.9789318,"about_ca_system_score_codex":0.00013784743,"about_ca_system_score_gemma":0.00031652366,"threshold_uncertainty_score":0.99974734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004672739,0.00025661066,0.99468505,0.0007500565,0.0017887256,0.00024295296,0.000016899465,0.000389244,0.0014031979],"genre_scores_gemma":[0.761132,0.00039632522,0.23198867,0.0023255318,0.0010495833,0.00002344388,0.00003184882,0.00013806875,0.0029145377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705416,0.000024364335,0.00038602113,0.0013234623,0.000645137,0.00056683033],"domain_scores_gemma":[0.99780184,0.0005864414,0.00017734292,0.0011225981,0.00012183612,0.00018991572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006058786,0.00043341922,0.00041600547,0.0006998011,0.0003159733,0.0006553032,0.002256308,0.00028882598,0.000014831101],"category_scores_gemma":[0.000091447895,0.00039494692,0.00007828315,0.00067859364,0.0005017183,0.00033800118,0.001693381,0.00055929937,0.0000837636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035577987,0.000059656857,0.0010415205,0.00011250236,0.00004692773,0.0005309541,0.002061143,0.010779118,0.00046979345,0.54186887,0.00010318962,0.44292277],"study_design_scores_gemma":[0.0004022833,0.0001959741,0.0031360728,0.0006011972,0.00001573659,0.00024942087,4.568733e-7,0.398809,0.00052305136,0.59256804,0.0021397758,0.0013590205],"about_ca_topic_score_codex":0.000024330608,"about_ca_topic_score_gemma":0.0000797223,"teacher_disagreement_score":0.7626964,"about_ca_system_score_codex":0.000090115675,"about_ca_system_score_gemma":0.0002574806,"threshold_uncertainty_score":0.9998502},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015574967,0.0007354184,0.9920192,0.00087246916,0.0021243382,0.0003329933,0.000009040021,0.0008841763,0.0028666581],"genre_scores_gemma":[0.3530011,0.00093782763,0.6210155,0.015293518,0.0022032056,0.00006481969,0.000039601466,0.0003641252,0.0070803277],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955257,0.00010306732,0.0005479938,0.0020106726,0.0009453808,0.00086719345],"domain_scores_gemma":[0.9957139,0.0017377961,0.00028372934,0.0019061834,0.00011984147,0.00023854263],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028899563,0.00067241694,0.00065508875,0.00090599386,0.00035748296,0.00076599687,0.0040527396,0.00040272277,0.00003052833],"category_scores_gemma":[0.00016734748,0.0005685493,0.00013788122,0.0007334836,0.0012154382,0.0006756962,0.0034416295,0.0008052605,0.00021026706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005239352,0.00001537928,0.000016934486,0.00003872467,0.000012679196,0.00018521682,0.00039519373,0.0007037781,0.00016997957,0.42961338,0.000035338795,0.56880814],"study_design_scores_gemma":[0.00018774216,0.00011046207,0.00023911774,0.00024603677,0.0000075642206,0.00014307087,2.3957386e-7,0.24463665,0.00029511764,0.7530475,0.0004993401,0.00058711297],"about_ca_topic_score_codex":0.000014518664,"about_ca_topic_score_gemma":0.000024255394,"teacher_disagreement_score":0.56822103,"about_ca_system_score_codex":0.00014929485,"about_ca_system_score_gemma":0.0002453497,"threshold_uncertainty_score":0.9996766},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033983663,0.00009462469,0.9929571,0.0006345323,0.0016030021,0.0003830129,0.0000044170447,0.00018278426,0.00074214675],"genre_scores_gemma":[0.9285385,0.000081897655,0.0707935,0.00029515676,0.00011653224,0.000034542973,0.000005519043,0.00001641578,0.00011792959],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981788,0.000014830683,0.0003180281,0.0008542755,0.00027235085,0.00036172164],"domain_scores_gemma":[0.9989274,0.00039720538,0.0001402112,0.0004124771,0.00008272746,0.000039983395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040664535,0.00027708162,0.00033743124,0.0008013519,0.00022878386,0.00033530997,0.00086133904,0.0002607123,0.0000014197716],"category_scores_gemma":[0.000042143685,0.0002631203,0.00004410808,0.000344056,0.00047700576,0.00061750057,0.0007029608,0.00048229538,0.000006473819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020609541,0.000039239512,0.00023346595,0.00015447744,0.000028377553,0.000052443993,0.0028948525,0.016292885,0.0004242616,0.1980068,0.000036161236,0.7818164],"study_design_scores_gemma":[0.00040557072,0.00021799862,0.0011051772,0.00045368454,0.000007178892,0.00003700758,0.0000046886657,0.36955377,0.0001721831,0.6274426,0.0002225795,0.0003775687],"about_ca_topic_score_codex":0.000020723262,"about_ca_topic_score_gemma":0.00042376047,"teacher_disagreement_score":0.92514014,"about_ca_system_score_codex":0.00016515312,"about_ca_system_score_gemma":0.00014705384,"threshold_uncertainty_score":0.9999821},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93848675,0.0015007604,0.054248396,0.0002137325,0.0018247474,0.0012032338,0.000059439764,0.0003970635,0.002065873],"genre_scores_gemma":[0.9975155,0.0005006974,0.0014102311,0.00010935681,0.00026219906,0.000011853429,0.000008676113,0.000032588217,0.00014891484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823946,0.00002754623,0.00024127583,0.00066933496,0.0003300726,0.00049232156],"domain_scores_gemma":[0.9990144,0.0005279902,0.000028689026,0.00023779066,0.000046122437,0.00014504687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031432454,0.00031076264,0.00038327638,0.00041850036,0.00009293722,0.00017590623,0.000385068,0.00030919653,0.000015114153],"category_scores_gemma":[0.00007203587,0.00025636845,0.000026572816,0.000442332,0.000828725,0.00009182909,0.00049744477,0.00072732806,0.000010067903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009554602,0.000103376835,0.020559309,0.00017696174,0.00010414807,0.0018112464,0.0078112367,0.19359532,0.002534703,0.005084203,0.00042873892,0.7676952],"study_design_scores_gemma":[0.0023797646,0.00088415184,0.0948126,0.0010735863,0.000015767457,0.000040375086,0.000007724514,0.88092947,0.00048434132,0.015099881,0.0025359353,0.0017364174],"about_ca_topic_score_codex":0.000013344683,"about_ca_topic_score_gemma":0.00025283403,"teacher_disagreement_score":0.7659588,"about_ca_system_score_codex":0.00011281335,"about_ca_system_score_gemma":0.000051177525,"threshold_uncertainty_score":0.99998885},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051274203,0.00006469621,0.997394,0.00025896082,0.00048043352,0.00089114736,0.000114091505,0.00022482511,0.00005908034],"genre_scores_gemma":[0.5239131,0.000009748695,0.47509244,0.0004162177,0.0000582656,0.00007697971,0.000040546598,0.00004551064,0.00034722357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634606,0.00003754159,0.00050031464,0.0015930178,0.0009293077,0.0005937622],"domain_scores_gemma":[0.99677825,0.00068361923,0.00045562355,0.0012953102,0.000616261,0.00017094781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055736746,0.00048604954,0.000759436,0.0017936411,0.00017905764,0.00015975775,0.0024461076,0.00018419427,0.000005186053],"category_scores_gemma":[0.00017203204,0.00039838624,0.00020739294,0.001684264,0.0007093214,0.00023360719,0.000714664,0.0003374534,0.0000052703044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017869481,0.0002451524,0.013978459,0.00010091354,0.0005999766,0.000054481075,0.00054398936,0.72306025,0.000019528501,0.018786656,0.00006243149,0.24236946],"study_design_scores_gemma":[0.00060433435,0.0006427923,0.07710432,0.00022711486,0.00031271082,1.1400932e-7,1.8218452e-7,0.868835,0.00023740715,0.051212806,0.0002256675,0.00059756095],"about_ca_topic_score_codex":0.000015819594,"about_ca_topic_score_gemma":0.00004082866,"teacher_disagreement_score":0.52340037,"about_ca_system_score_codex":0.00024229652,"about_ca_system_score_gemma":0.0003888463,"threshold_uncertainty_score":0.9998468},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038362946,0.0002225088,0.98739207,0.004682994,0.003443728,0.0005905987,0.000020988395,0.0003036565,0.0029598],"genre_scores_gemma":[0.72827333,0.00054329465,0.24442911,0.019071357,0.0043631094,0.00014552184,0.00007993119,0.00028372512,0.002810629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954165,0.000068247864,0.0007112006,0.0016147178,0.0012053213,0.000983992],"domain_scores_gemma":[0.99653757,0.0009600925,0.0003603312,0.0017274985,0.0002158633,0.00019862856],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013907119,0.0006022512,0.0005034528,0.0009912543,0.00088227156,0.0012381006,0.00456173,0.00027621016,0.000019443998],"category_scores_gemma":[0.00009566197,0.00047075335,0.00027018416,0.0011679246,0.00089626334,0.0006036942,0.002269514,0.0010960312,0.0001234324],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013602956,0.00006508814,0.00005921026,0.00007281167,0.000077549994,0.00023961382,0.010883283,0.031155244,0.000217478,0.043638892,0.003742867,0.9098344],"study_design_scores_gemma":[0.00067215046,0.00021237906,0.0002481261,0.00043804536,0.000024617757,0.00007573647,0.000005640549,0.8029437,0.00033208585,0.17546214,0.018202912,0.0013824651],"about_ca_topic_score_codex":0.000068569505,"about_ca_topic_score_gemma":0.00073286565,"teacher_disagreement_score":0.9084519,"about_ca_system_score_codex":0.00026227455,"about_ca_system_score_gemma":0.0005704244,"threshold_uncertainty_score":0.9997987},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077800907,0.000116652125,0.99426115,0.00023003071,0.0014219064,0.00016327284,0.000011275728,0.00026663113,0.0027510885],"genre_scores_gemma":[0.49487892,0.00023229551,0.5023518,0.0006565257,0.00058626017,0.000004340658,0.000011323477,0.000084031424,0.0011944642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973092,0.000030039508,0.0004282781,0.0010562835,0.00073737314,0.00043879388],"domain_scores_gemma":[0.99768716,0.0007735841,0.00032969032,0.0009818717,0.000113167356,0.000114521725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008069665,0.0003484402,0.0004451317,0.00079665723,0.0001479862,0.00028317547,0.002504503,0.00018180291,0.000009002185],"category_scores_gemma":[0.00009429457,0.00032825448,0.000092447764,0.00051392906,0.0007067403,0.0005103448,0.0023314096,0.0004087007,0.000016944003],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006008267,0.00001935207,0.00006769982,0.00009506672,0.000022894228,0.0002084711,0.0010445634,0.011324726,0.00029033807,0.14172445,0.0000146975235,0.84518176],"study_design_scores_gemma":[0.00028952895,0.00012376011,0.00018509169,0.00050509296,0.000007759619,0.000042683347,3.3967038e-7,0.81595623,0.00074454676,0.18155582,0.0002086881,0.0003804404],"about_ca_topic_score_codex":0.00004939317,"about_ca_topic_score_gemma":0.00002529398,"teacher_disagreement_score":0.8448013,"about_ca_system_score_codex":0.00007614736,"about_ca_system_score_gemma":0.00022602933,"threshold_uncertainty_score":0.999917},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023881055,0.00034870813,0.99337715,0.00016701553,0.0040701693,0.00030175253,0.00002523065,0.0002925125,0.0011786224],"genre_scores_gemma":[0.44667596,0.000059703507,0.54634833,0.0011483593,0.001972093,0.000052660787,0.00007572461,0.00011149528,0.0035556487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962634,0.00007681097,0.0006465678,0.001033773,0.0012367956,0.0007426383],"domain_scores_gemma":[0.99743426,0.0005501268,0.00037622915,0.0012570162,0.00024852043,0.0001338611],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016899678,0.00038257477,0.0006070074,0.0008373928,0.00020690069,0.00038848032,0.004279553,0.00024754144,0.00000728482],"category_scores_gemma":[0.0000860844,0.00034221986,0.00014727065,0.0013540164,0.0013265554,0.0008892506,0.0020022679,0.0005376018,0.000061947125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000170681,0.0001304712,0.00013513667,0.0005708584,0.000044698758,0.0001526522,0.001644597,0.097772434,0.00049956766,0.5816959,0.0011648149,0.3161718],"study_design_scores_gemma":[0.0001625977,0.00012346458,0.00045011865,0.00044515412,0.0000038748485,0.000060396473,3.3261597e-7,0.72428876,0.000254577,0.27353376,0.0003280194,0.0003489651],"about_ca_topic_score_codex":0.000043101576,"about_ca_topic_score_gemma":0.000024143505,"teacher_disagreement_score":0.6265163,"about_ca_system_score_codex":0.00034004197,"about_ca_system_score_gemma":0.0011203605,"threshold_uncertainty_score":0.99990296},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035287878,0.00037592216,0.9964652,0.00005415271,0.0015998561,0.00018045209,0.0000051899,0.00062316423,0.00066078705],"genre_scores_gemma":[0.034390394,0.00030023593,0.96348476,0.00030376975,0.0009626813,0.000070547285,0.000072676165,0.000120538585,0.00029442075],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985355,0.000009063346,0.00032762092,0.0005075306,0.00028574283,0.00033450042],"domain_scores_gemma":[0.9992181,0.00017508415,0.000048241443,0.00046326552,0.000051322815,0.00004398336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034135173,0.0002295816,0.00021566749,0.00084916805,0.000041457373,0.00011728167,0.00091600075,0.00019318715,0.000004563685],"category_scores_gemma":[0.00013749932,0.0002470163,0.000022233919,0.0012058868,0.00023094096,0.00029753117,0.00022176097,0.00062708807,0.000046737423],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.3472146e-7,0.000007299158,0.0000048828415,0.000054035318,5.77293e-7,0.000006200894,0.00015512029,0.14870864,0.00007838952,0.00033981548,0.000117824,0.8505266],"study_design_scores_gemma":[0.000005873834,0.000015146193,0.000019350719,0.0006281677,0.0000010488018,0.0000055221262,2.734725e-7,0.44254592,0.0055033797,0.550155,0.00082616095,0.00029418195],"about_ca_topic_score_codex":0.0000070527444,"about_ca_topic_score_gemma":0.00014571754,"teacher_disagreement_score":0.85023236,"about_ca_system_score_codex":0.0006498084,"about_ca_system_score_gemma":0.00063055096,"threshold_uncertainty_score":0.9999982},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022113791,0.000098677476,0.9955127,0.00047738227,0.0004359915,0.00040143193,0.0000066579933,0.00039013155,0.00046563326],"genre_scores_gemma":[0.6310422,0.000011614394,0.36864275,0.00008998127,0.00012363578,0.0000145496515,0.0000034581944,0.000029684865,0.00004213289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969672,0.000051672458,0.0003717076,0.00082028867,0.0013679836,0.00042115775],"domain_scores_gemma":[0.99518853,0.0034280526,0.0002207198,0.00090921234,0.00019286096,0.00006061933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013206683,0.00030586257,0.0003259897,0.0003863991,0.00023137477,0.00028636024,0.0018441905,0.00016378192,0.0000033315519],"category_scores_gemma":[0.0002814734,0.00022323804,0.000063000225,0.0010221708,0.0005956664,0.00080988626,0.00035790825,0.0007448353,0.0000037428051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018260263,0.00006192395,0.002130835,0.0007280084,0.00010435612,0.000056822264,0.04012783,0.2510648,0.0005458994,0.019609774,0.00004875185,0.68550277],"study_design_scores_gemma":[0.00016923856,0.00014612853,0.0024149455,0.00060906145,0.000008467778,0.000025455982,0.0000016875236,0.9626861,0.0035962125,0.029913746,0.00009205553,0.00033689878],"about_ca_topic_score_codex":0.000048359765,"about_ca_topic_score_gemma":0.000090069654,"teacher_disagreement_score":0.7116213,"about_ca_system_score_codex":0.00013044903,"about_ca_system_score_gemma":0.00057227095,"threshold_uncertainty_score":0.9103383},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002839512,0.00007823023,0.99351233,0.0032077592,0.0014925493,0.00066548097,0.0000012780677,0.0003653073,0.0003930832],"genre_scores_gemma":[0.31553644,0.000023130842,0.6705537,0.0019502158,0.0005082064,0.00005818261,0.000012081474,0.00013972582,0.0112183485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943238,0.00016919847,0.00055334147,0.0026507135,0.0011534805,0.0011494868],"domain_scores_gemma":[0.9973635,0.00039347683,0.00035021573,0.0015439086,0.000057336576,0.00029156823],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0021537996,0.00064364023,0.00068930886,0.0013731539,0.0005023879,0.003326565,0.006415392,0.00035582748,0.000004464196],"category_scores_gemma":[0.0006597624,0.0006394927,0.0001236524,0.0010008188,0.00026663355,0.0012444488,0.0067427107,0.0027021954,0.00010745941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004247409,0.000021812606,0.00032613034,0.000023159093,0.0000074164204,0.0001924634,0.0025450946,0.09745005,0.00034438688,0.0015820817,0.000012933495,0.8974902],"study_design_scores_gemma":[0.0014255517,0.001200807,0.002588306,0.002714389,0.000019987549,0.0001367377,0.000011862045,0.89984107,0.0008170386,0.0163853,0.07152091,0.0033380631],"about_ca_topic_score_codex":0.00019702835,"about_ca_topic_score_gemma":0.00020371971,"teacher_disagreement_score":0.89415216,"about_ca_system_score_codex":0.000669009,"about_ca_system_score_gemma":0.00029554413,"threshold_uncertainty_score":0.99960566},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01436672,0.0005201466,0.9689304,0.0009049839,0.0075530624,0.00076816377,0.000009432211,0.00047727875,0.0064697643],"genre_scores_gemma":[0.939639,0.00012123874,0.043438748,0.0009235528,0.0031765928,0.00010928124,0.0000072056782,0.00019785011,0.012386546],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9958515,0.00005538493,0.00056658336,0.0016617455,0.0009825772,0.0008821713],"domain_scores_gemma":[0.99732816,0.0011648025,0.00024835416,0.0008358273,0.0002872942,0.00013558038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096833316,0.0005057116,0.00052814075,0.00119414,0.0008641044,0.00032058873,0.0010403211,0.00030796006,0.000102019425],"category_scores_gemma":[0.0005777513,0.00050626695,0.0001499635,0.000921009,0.00027288927,0.00019711474,0.0012543303,0.0008233516,0.0006929592],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012614338,0.000086493965,0.007963524,0.0002663613,0.000120290664,0.0001802729,0.024559733,0.13085024,0.0003459348,0.0030418292,0.00072236283,0.8317368],"study_design_scores_gemma":[0.0041082776,0.0019362657,0.6212902,0.016984023,0.0002308979,0.0012720773,0.00011120408,0.09198696,0.0022672822,0.21391189,0.036664188,0.009236729],"about_ca_topic_score_codex":0.000086782,"about_ca_topic_score_gemma":0.0013066242,"teacher_disagreement_score":0.9254917,"about_ca_system_score_codex":0.0005717495,"about_ca_system_score_gemma":0.00015833203,"threshold_uncertainty_score":0.9997389},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015735199,0.00012752277,0.9953896,0.00014310321,0.0006465636,0.00030328493,0.0000010666328,0.0002767829,0.001538547],"genre_scores_gemma":[0.5130145,0.000073759424,0.48492917,0.0008530722,0.0007154624,0.00003874224,0.000010285532,0.000105099025,0.0002599091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837226,0.00002873703,0.0002456064,0.0005485101,0.00045146042,0.00035341334],"domain_scores_gemma":[0.99925315,0.0003694924,0.00003405041,0.000221049,0.00005240187,0.00006986654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006699227,0.00027177506,0.00024443254,0.00052710675,0.0001566389,0.00023238809,0.00050135085,0.0002617629,0.000004983274],"category_scores_gemma":[0.00014021741,0.00022498117,0.000042986605,0.0009911703,0.00010064437,0.000050769275,0.00011875447,0.0011773392,0.000023829583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016285749,0.0000056556764,0.000039905535,0.000027067697,0.0000036021813,0.0000021851843,0.0027859039,0.9554208,0.000012778834,0.00039755323,0.0000032211376,0.04129973],"study_design_scores_gemma":[0.00008804568,0.000028057018,0.00012507993,0.00022651849,0.000004471135,0.000014969571,0.0000025433562,0.9972074,0.00008576182,0.001875163,0.0000796631,0.00026230232],"about_ca_topic_score_codex":0.000008378878,"about_ca_topic_score_gemma":0.000015152913,"teacher_disagreement_score":0.511441,"about_ca_system_score_codex":0.000115591036,"about_ca_system_score_gemma":0.000045091638,"threshold_uncertainty_score":0.91744655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014692604,0.0000138673895,0.9971294,0.000058002013,0.00036032937,0.00054613146,0.000046173303,0.00024716658,0.00012969717],"genre_scores_gemma":[0.7956154,0.0000062600075,0.2027396,0.00011156858,0.0009552199,0.000054942393,0.0003319872,0.000067061235,0.00011798376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980013,0.00011050502,0.0004391413,0.0006707196,0.00038766026,0.00039070114],"domain_scores_gemma":[0.9980017,0.0005437731,0.0003021345,0.00076126435,0.00029466214,0.00009646458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011426791,0.00036365498,0.00044326848,0.00039883546,0.0007525891,0.00032721795,0.0007173912,0.000186229,0.000038689588],"category_scores_gemma":[0.00006493388,0.0003478956,0.0001528446,0.0004412958,0.00024647405,0.00036886154,0.00033815205,0.0009130622,0.0000027922688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061025414,0.0000840019,0.00015792022,0.000052581236,0.00004548736,0.000005746346,0.00056236086,0.24629955,0.0001649064,0.001339188,0.000020270694,0.751207],"study_design_scores_gemma":[0.00014663344,0.0002133828,0.0001192868,0.00013817863,0.000041538493,0.000002424858,0.0000011910385,0.82675564,0.0014416616,0.17067823,0.00012454992,0.00033727442],"about_ca_topic_score_codex":0.00017930334,"about_ca_topic_score_gemma":0.0003371975,"teacher_disagreement_score":0.7943898,"about_ca_system_score_codex":0.00017714563,"about_ca_system_score_gemma":0.00012702764,"threshold_uncertainty_score":0.9998973},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028270595,0.020889292,0.9711056,0.0009133494,0.00060276315,0.0026945635,0.00021870846,0.0001381178,0.0006105912],"genre_scores_gemma":[0.9679959,0.0017965744,0.028654685,0.00045476246,0.00056305615,0.00006621914,0.00015808188,0.00012770528,0.00018306274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729127,0.000013527688,0.0003627129,0.00086804864,0.0009143367,0.00055010384],"domain_scores_gemma":[0.9979845,0.0003681022,0.00014922037,0.00073758676,0.0003208857,0.00043969718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031230622,0.00037469977,0.0006015738,0.0005649761,0.00013113387,0.000051411906,0.00046284724,0.00015313741,0.000026374222],"category_scores_gemma":[0.000028814113,0.00029357048,0.00028543503,0.00027781588,0.00059624494,0.00010649645,0.00017367316,0.00029663203,0.00002524367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002163494,0.0011423856,0.0052933553,0.0008318467,0.0085165305,0.0012864964,0.0006681935,0.35544077,0.00015443857,0.006636489,0.00018147368,0.61768454],"study_design_scores_gemma":[0.0036616176,0.0011394937,0.0013789983,0.0016927128,0.000819944,0.00001615682,4.279968e-7,0.9022185,0.0032849761,0.08460891,0.00037932454,0.00079891214],"about_ca_topic_score_codex":0.000025829928,"about_ca_topic_score_gemma":0.0000029178802,"teacher_disagreement_score":0.9651688,"about_ca_system_score_codex":0.0000760099,"about_ca_system_score_gemma":0.0010674667,"threshold_uncertainty_score":0.99995166},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036302098,0.00030200815,0.99500316,0.00012473331,0.0034114448,0.00008924955,0.000006196895,0.0005236753,0.00017650535],"genre_scores_gemma":[0.088615105,0.0014715169,0.89776963,0.00080468104,0.0077676247,0.000085928885,0.00030753296,0.0005047319,0.0026732616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988389,0.0000018375114,0.00023907992,0.00023105767,0.00033417897,0.00035495564],"domain_scores_gemma":[0.9994162,0.00016956293,0.000018725994,0.00021590505,0.000019552603,0.00016008405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024334366,0.0002202446,0.00021201083,0.0006025608,0.000031951717,0.000084242274,0.0003209697,0.00025182028,0.0000050657386],"category_scores_gemma":[0.000068862464,0.00020144471,0.000025218938,0.00066358584,0.00021142024,0.00010304987,0.00013192283,0.00047707744,0.000034990873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.3932905e-7,0.0000091872025,0.00000742745,0.0016989156,0.000017443313,0.000019451478,0.00093481597,0.18752162,0.00024034486,0.00009253728,0.002016117,0.8074416],"study_design_scores_gemma":[0.00006240582,0.000020075699,0.00014401771,0.0003817083,0.000003804569,0.000018471357,1.7184999e-7,0.9938336,0.000074640564,0.0013376753,0.0038787643,0.00024464744],"about_ca_topic_score_codex":0.0000017732972,"about_ca_topic_score_gemma":0.0000022618572,"teacher_disagreement_score":0.807197,"about_ca_system_score_codex":0.00018911116,"about_ca_system_score_gemma":0.00012759934,"threshold_uncertainty_score":0.8214677},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036302098,0.00030200815,0.99500316,0.00012473331,0.0034114448,0.00008924955,0.000006196895,0.0005236753,0.00017650535],"genre_scores_gemma":[0.088615105,0.0014715169,0.89776963,0.00080468104,0.0077676247,0.000085928885,0.00030753296,0.0005047319,0.0026732616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988389,0.0000018375114,0.00023907992,0.00023105767,0.00033417897,0.00035495564],"domain_scores_gemma":[0.9994162,0.00016956293,0.000018725994,0.00021590505,0.000019552603,0.00016008405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024334366,0.0002202446,0.00021201083,0.0006025608,0.000031951717,0.000084242274,0.0003209697,0.00025182028,0.0000050657386],"category_scores_gemma":[0.000068862464,0.00020144471,0.000025218938,0.00066358584,0.00021142024,0.00010304987,0.00013192283,0.00047707744,0.000034990873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.3932905e-7,0.0000091872025,0.00000742745,0.0016989156,0.000017443313,0.000019451478,0.00093481597,0.18752162,0.00024034486,0.00009253728,0.002016117,0.8074416],"study_design_scores_gemma":[0.00006240582,0.000020075699,0.00014401771,0.0003817083,0.000003804569,0.000018471357,1.7184999e-7,0.9938336,0.000074640564,0.0013376753,0.0038787643,0.00024464744],"about_ca_topic_score_codex":0.0000017732972,"about_ca_topic_score_gemma":0.0000022618572,"teacher_disagreement_score":0.807197,"about_ca_system_score_codex":0.00018911116,"about_ca_system_score_gemma":0.00012759934,"threshold_uncertainty_score":0.8214677},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000089683395,0.00015114566,0.99449486,0.0027610124,0.0017322566,0.00041117385,0.000056261237,0.0001358373,0.00016777452],"genre_scores_gemma":[0.028870286,0.0001983461,0.9654541,0.0010561446,0.002220686,0.00010145873,0.00028052257,0.00007103226,0.001747393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762475,0.000021423462,0.00043929176,0.0010936318,0.0005181368,0.00030276543],"domain_scores_gemma":[0.99495053,0.0026767163,0.00033556027,0.0017182531,0.00026358338,0.000055331624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000665135,0.00023559506,0.0002584673,0.00019980266,0.00056677085,0.00029643532,0.0041038706,0.0001470358,0.000028545352],"category_scores_gemma":[0.0001831591,0.00018498547,0.00008627366,0.0006272779,0.00035652658,0.0006654347,0.0021697178,0.0005519001,0.000012092262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029601176,0.000007946644,0.000108690896,0.000012315491,0.000019571178,9.611169e-7,0.00011601266,0.41689888,0.00023387004,0.013847076,0.00029604294,0.5684557],"study_design_scores_gemma":[0.00008827275,0.00002640912,0.0011506078,0.00012932719,0.0000120662835,0.0000057007946,3.926201e-7,0.88492936,0.000038958548,0.11177062,0.0016764133,0.00017187651],"about_ca_topic_score_codex":0.00006450687,"about_ca_topic_score_gemma":0.00022848538,"teacher_disagreement_score":0.5682838,"about_ca_system_score_codex":0.000056428813,"about_ca_system_score_gemma":0.00027448937,"threshold_uncertainty_score":0.7626081},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028871975,0.00004960776,0.956675,0.0011383567,0.003088782,0.0004076245,0.0000049941405,0.0002806916,0.038066246],"genre_scores_gemma":[0.8795521,0.00043144764,0.096774235,0.0076572276,0.004152388,0.000010347927,0.000013683434,0.00011545971,0.011293082],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720323,0.000043317865,0.00038365964,0.0005559244,0.0011827205,0.0006311664],"domain_scores_gemma":[0.99826187,0.0006198405,0.00021970512,0.00045209593,0.00018143242,0.00026506142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010139138,0.00029168397,0.00029673302,0.000653151,0.00071762165,0.0005474137,0.00090149307,0.0005763618,0.0002000169],"category_scores_gemma":[0.0011345729,0.00027317624,0.0001127615,0.0007627119,0.00081132306,0.00055294,0.00021727753,0.00081023265,0.00045071798],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006915686,0.000007928056,0.000017288834,0.00001409697,0.0000056026533,0.0000102581325,0.020787165,0.003961596,0.00001342117,0.01249688,0.000048716498,0.96263015],"study_design_scores_gemma":[0.00062039244,0.0002810541,0.0010969845,0.0015630649,0.00002986651,0.000022746653,0.00007805401,0.16416836,0.0007050989,0.76862293,0.06074402,0.0020674404],"about_ca_topic_score_codex":0.00090608775,"about_ca_topic_score_gemma":0.008434371,"teacher_disagreement_score":0.9605627,"about_ca_system_score_codex":0.0003847672,"about_ca_system_score_gemma":0.0006578901,"threshold_uncertainty_score":0.99997205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017713683,0.0002686902,0.99161696,0.00048513446,0.0022117917,0.00025523317,0.000011595669,0.00040569718,0.0047271685],"genre_scores_gemma":[0.05158938,0.00007988592,0.9376752,0.0042494466,0.0016241047,0.00003380051,0.00008040669,0.00007159411,0.00459619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99522966,0.00005984749,0.00055729883,0.0017586178,0.0012484154,0.0011461481],"domain_scores_gemma":[0.99689746,0.00055714924,0.00027490014,0.0018755981,0.00017949658,0.00021541367],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010857207,0.00050641043,0.0007741925,0.0018686168,0.0003479227,0.0009059834,0.0055592693,0.00034929093,0.000018933262],"category_scores_gemma":[0.000075523785,0.00042438222,0.00034728873,0.0064599747,0.0006596689,0.0009109931,0.0025162948,0.0007807297,0.0001596366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020685138,0.000027247956,0.000096173884,0.000020118432,0.00008956052,0.00020032105,0.001137187,0.16482696,0.0000029097387,0.004956934,0.00072158297,0.82791895],"study_design_scores_gemma":[0.0001714715,0.000121934936,0.0006053262,0.000060298415,0.000046460038,0.000016600454,1.5533621e-7,0.92274755,0.000049714417,0.07412365,0.0014539618,0.0006028591],"about_ca_topic_score_codex":0.00003059284,"about_ca_topic_score_gemma":0.00011511231,"teacher_disagreement_score":0.82731605,"about_ca_system_score_codex":0.00038293772,"about_ca_system_score_gemma":0.0010289352,"threshold_uncertainty_score":0.9998211},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000786763,0.0004931384,0.98050386,0.00037254073,0.004906495,0.00043151155,0.000022466918,0.000530818,0.012660507],"genre_scores_gemma":[0.8965474,0.00013509787,0.09879192,0.00095967186,0.0006335214,0.000033479875,0.000024267356,0.00009451548,0.002780168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99443907,0.00004355604,0.000924486,0.0021184932,0.0014326276,0.0010417555],"domain_scores_gemma":[0.99648464,0.0003975473,0.00041479894,0.0019829914,0.00041461634,0.00030538204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001107043,0.00070310215,0.00095870905,0.000701093,0.00040019336,0.00076030643,0.00454213,0.00039249018,0.00001306075],"category_scores_gemma":[0.00006814542,0.000681376,0.00020040039,0.0010602184,0.00082569296,0.001027531,0.0018339137,0.00095152116,0.0002908313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000788306,0.000045265737,0.00023233362,0.00015860445,0.00004225029,0.0005964892,0.0012782139,0.2858585,0.000089110144,0.57502335,0.0003015547,0.13636644],"study_design_scores_gemma":[0.00022920922,0.00006160027,0.00009698274,0.00056898716,0.00000634822,0.000077287004,3.2894266e-7,0.82009184,0.000104323546,0.17723452,0.00081905664,0.0007095154],"about_ca_topic_score_codex":0.000115295785,"about_ca_topic_score_gemma":0.0001626454,"teacher_disagreement_score":0.8964687,"about_ca_system_score_codex":0.00031522103,"about_ca_system_score_gemma":0.0008000342,"threshold_uncertainty_score":0.99956375},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004079141,0.00011645414,0.9969938,0.00043969468,0.0011919534,0.00032020546,9.419947e-7,0.00031175144,0.00058445486],"genre_scores_gemma":[0.29433462,0.000032554548,0.7022806,0.0014715842,0.00081637636,0.000025193483,0.000033799413,0.000100365214,0.0009049278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960778,0.000035003548,0.00062204653,0.0015423166,0.0010481672,0.0006746996],"domain_scores_gemma":[0.99735844,0.0009029541,0.0004486783,0.00081986736,0.00032497136,0.00014511288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001695199,0.00044815324,0.000554441,0.0011329592,0.000601624,0.00080934353,0.0018622086,0.00025574438,0.000009645409],"category_scores_gemma":[0.00040178938,0.00043036995,0.00024128299,0.0009865141,0.00012671205,0.0005301725,0.0006391262,0.00070867373,0.000014973919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017448203,0.000005077735,0.00017197298,0.000026111064,0.000005960849,0.000027664646,0.00025798313,0.46287486,0.000049635593,0.002463884,0.0000023833438,0.53411275],"study_design_scores_gemma":[0.00017227563,0.0000730009,0.00013087939,0.000337881,0.000014672106,0.000007626336,2.91447e-7,0.9676623,0.0001563952,0.030414449,0.00055692444,0.00047332761],"about_ca_topic_score_codex":0.000024338015,"about_ca_topic_score_gemma":0.0000925987,"teacher_disagreement_score":0.5336394,"about_ca_system_score_codex":0.0001897185,"about_ca_system_score_gemma":0.00037013687,"threshold_uncertainty_score":0.9998148},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002347313,0.000021572649,0.99534774,0.00032890282,0.0018475996,0.0008421596,0.000004113221,0.00031052367,0.0012739351],"genre_scores_gemma":[0.265666,0.00002151859,0.72656053,0.00095073454,0.00064423145,0.00004300274,0.00005799258,0.000116807736,0.0059391554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962017,0.000027687345,0.0006723839,0.0013576616,0.0010342622,0.0007062859],"domain_scores_gemma":[0.99707514,0.0010676918,0.00043119604,0.0011597498,0.00012024219,0.00014598026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009240151,0.00048720697,0.0004487447,0.00075502845,0.00037049572,0.0005096957,0.0020828664,0.00031979338,0.000023721412],"category_scores_gemma":[0.00014623054,0.00050297886,0.00015677896,0.00036743298,0.00027884977,0.0005374891,0.00083298696,0.0004967985,0.00012420412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002653021,0.000004832982,0.000013585043,0.000016919323,0.00001115025,0.000009274331,0.001042693,0.8168644,0.000009327033,0.008878052,0.0000064738356,0.17314069],"study_design_scores_gemma":[0.00030925404,0.00012791963,0.0003031998,0.00014093795,0.000010402117,0.0000040079353,2.6064683e-7,0.96572787,0.00004217436,0.028982315,0.0038446211,0.0005070569],"about_ca_topic_score_codex":0.0000057877746,"about_ca_topic_score_gemma":0.000006014735,"teacher_disagreement_score":0.26878718,"about_ca_system_score_codex":0.0005060687,"about_ca_system_score_gemma":0.00034546686,"threshold_uncertainty_score":0.9997422},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.88961e-7,0.000019174122,0.9757414,0.0008913191,0.00087133667,0.021471906,0.000004584265,0.0007359132,0.0002634917],"genre_scores_gemma":[0.006294963,0.0000066589223,0.96900123,0.0019095015,0.0010866272,0.019806495,0.000035219597,0.00010764215,0.0017516321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965487,0.00005951974,0.0005410675,0.001470957,0.0007489534,0.00063076994],"domain_scores_gemma":[0.9977306,0.000758532,0.00035818116,0.0006190253,0.00044532065,0.00008834094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009092168,0.0005037921,0.0004609471,0.00046972217,0.0004960779,0.00059032755,0.0015909349,0.00034689033,0.00002550552],"category_scores_gemma":[0.0001830138,0.00046919502,0.00017116922,0.00088694517,0.00024603345,0.00055995036,0.00028749226,0.0007403538,0.00002897323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022872326,0.000016689874,0.000014349435,0.000037644088,0.000006988687,0.000004844569,0.00006111876,0.70923144,0.000004085569,0.0053758794,0.000028806053,0.28519526],"study_design_scores_gemma":[0.0009465748,0.00044590136,0.0000051460056,0.00023612045,0.00001027857,0.000011185734,2.9960148e-8,0.97729844,0.00011643887,0.014377358,0.0060333414,0.0005192125],"about_ca_topic_score_codex":0.000011141082,"about_ca_topic_score_gemma":0.000046839305,"teacher_disagreement_score":0.28467605,"about_ca_system_score_codex":0.0002521298,"about_ca_system_score_gemma":0.0007653307,"threshold_uncertainty_score":0.99977595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006240444,0.00010201038,0.99097073,0.000029553823,0.0036503605,0.00011854342,0.000008596202,0.0006408922,0.0038552757],"genre_scores_gemma":[0.9841475,0.00009134645,0.013733806,0.000109134,0.0014701012,0.0000067487836,0.000015188866,0.00007118952,0.0003549983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839926,0.0000041130434,0.00026196663,0.0005277284,0.0003925296,0.00041442577],"domain_scores_gemma":[0.9992624,0.00007485367,0.000054114007,0.00046281883,0.00007734354,0.00006845338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002128331,0.00030826541,0.00036741153,0.0011872615,0.00011045282,0.00013360973,0.00047455516,0.00021238154,0.000010525134],"category_scores_gemma":[0.000023514402,0.0002949279,0.0001456299,0.0010752432,0.0001827291,0.00013631715,0.00014648904,0.0005843123,0.000049091712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015996998,0.0000015140347,0.00019511976,0.00003321777,0.00009445525,0.000055000182,0.00037148801,0.8390368,0.00027107995,0.00069885683,0.0000562974,0.15918455],"study_design_scores_gemma":[0.00016308489,0.00004987789,0.008857875,0.00028130753,0.00015358688,0.0000234539,2.848269e-7,0.9521313,0.0016016972,0.033985496,0.0018617806,0.00089028326],"about_ca_topic_score_codex":0.000030338513,"about_ca_topic_score_gemma":0.0002044302,"teacher_disagreement_score":0.9835234,"about_ca_system_score_codex":0.0003227803,"about_ca_system_score_gemma":0.00005339027,"threshold_uncertainty_score":0.9999503},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074026184,0.000058823196,0.98910403,0.00084237754,0.0004206046,0.0004406066,0.0000104511255,0.00010803267,0.0016124436],"genre_scores_gemma":[0.9896136,0.000021600452,0.00972862,0.0003527241,0.00016852129,0.000015548829,0.0000040494615,0.00001950887,0.000075841745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782175,0.000045093584,0.0003530457,0.00075592916,0.0007266346,0.00029753163],"domain_scores_gemma":[0.99776846,0.00072453823,0.0002910067,0.00089596695,0.00021088461,0.000109152206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076316297,0.0002511195,0.00025520325,0.00039845108,0.00029385166,0.0003336996,0.0015458807,0.00016730092,0.0000012959874],"category_scores_gemma":[0.00029121822,0.00018730297,0.00004345636,0.0008219698,0.00054250704,0.0003621438,0.00076418614,0.00048409426,0.000008018747],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015476562,0.000023590099,0.0001236542,0.000028124437,0.0000075455614,0.0000014313132,0.0018252551,0.013172977,0.0016564551,0.15976991,0.0000042115803,0.8233853],"study_design_scores_gemma":[0.00012633149,0.00027558836,0.004250042,0.0005339572,0.000006516347,0.0000121649255,0.0000031402376,0.5593489,0.013372042,0.4216231,0.00011540902,0.00033285358],"about_ca_topic_score_codex":0.000100643454,"about_ca_topic_score_gemma":0.000087630884,"teacher_disagreement_score":0.982211,"about_ca_system_score_codex":0.00006931188,"about_ca_system_score_gemma":0.0002447937,"threshold_uncertainty_score":0.76379937},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027177103,0.00027118766,0.96447474,0.0028468622,0.00110214,0.0006642771,0.00007432818,0.0007542823,0.0026350918],"genre_scores_gemma":[0.95603627,0.001386289,0.041286528,0.00028217657,0.00058565626,0.000007045906,0.000042066466,0.00005418516,0.00031977874],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971994,0.00007703489,0.00039420195,0.0010169189,0.0007483312,0.0005641154],"domain_scores_gemma":[0.99845135,0.0005375012,0.00030853396,0.00040886345,0.00016417945,0.00012958332],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00083528575,0.0003470081,0.00034601154,0.0007406013,0.0015507322,0.00076064933,0.0010044879,0.0005744754,0.000048914273],"category_scores_gemma":[0.00009922691,0.00034304374,0.00006520039,0.0005159299,0.002360721,0.0009932533,0.0004649218,0.00088522414,0.000013627611],"study_design_candidate":"theoretical_or_conceptual","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.00003503219,0.000069180365,0.014454608,0.0003704011,0.00007783732,0.00006610029,0.21002623,0.0066751246,0.00004659064,0.06964434,0.000034999703,0.69849956],"study_design_scores_gemma":[0.0007447643,0.00009228521,0.028722912,0.004198585,0.00007832361,0.000013298463,0.0027699287,0.046906248,0.000019150082,0.91492856,0.0003787665,0.001147175],"about_ca_topic_score_codex":0.0013102427,"about_ca_topic_score_gemma":0.067179166,"teacher_disagreement_score":0.9288592,"about_ca_system_score_codex":0.0005442999,"about_ca_system_score_gemma":0.0004883301,"threshold_uncertainty_score":0.9999021},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002371538,0.00014400214,0.96663386,0.0010496936,0.0019653044,0.00064270693,0.00007937336,0.00020176086,0.026911784],"genre_scores_gemma":[0.9702944,0.0004266882,0.02676723,0.0007784032,0.00067711534,0.0000022198174,0.0001031176,0.000044665634,0.0009061585],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645597,0.000073226984,0.00053160184,0.0006884455,0.0015039184,0.0007468289],"domain_scores_gemma":[0.9977129,0.0005086925,0.00042965676,0.0009763722,0.00023877484,0.00013359352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017798302,0.00029019988,0.00046426783,0.0003800133,0.0004893738,0.0003093972,0.0022724476,0.00028331578,0.00013316511],"category_scores_gemma":[0.0003493158,0.00027326096,0.00008312513,0.0007549976,0.0011154164,0.0011172751,0.00080813875,0.00067557633,0.000030378851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015181085,0.000054755754,0.00011971613,0.00011557377,0.000051396895,0.000020173664,0.07023863,0.01947971,0.00003201653,0.12806647,0.0003695711,0.7814368],"study_design_scores_gemma":[0.0014611463,0.00023371907,0.0023038364,0.0026523557,0.00010974849,0.000019186456,0.00027374265,0.19732921,0.0003441345,0.7478757,0.044775695,0.0026215324],"about_ca_topic_score_codex":0.0011180303,"about_ca_topic_score_gemma":0.0060565155,"teacher_disagreement_score":0.96792287,"about_ca_system_score_codex":0.000524256,"about_ca_system_score_gemma":0.0037413351,"threshold_uncertainty_score":0.999972},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012780897,0.008709071,0.80333483,0.10567898,0.02316756,0.008508858,0.0006640529,0.002649595,0.03450615],"genre_scores_gemma":[0.97995573,0.0020566438,0.010718271,0.0028896711,0.0031489606,0.00005370725,0.000039853065,0.00009258572,0.0010445595],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970967,0.000055137894,0.00031368455,0.0010985698,0.0005379141,0.0008980006],"domain_scores_gemma":[0.99812126,0.00032584413,0.0001725596,0.00077377836,0.00021474696,0.00039183506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010513671,0.0003320928,0.00036916972,0.0015026886,0.0010390225,0.0002444844,0.0019666953,0.00072057545,0.000033151468],"category_scores_gemma":[0.0007446428,0.00031592033,0.000047761543,0.0010829497,0.0021560923,0.00033038983,0.000942045,0.00095715735,0.00006447097],"study_design_candidate":"design_other","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.000008950589,0.000012023745,0.0005544802,0.00006945625,0.0000102983995,0.00004246124,0.014062712,0.00002749824,0.000007987316,0.02260046,0.00027762362,0.96232605],"study_design_scores_gemma":[0.0008059071,0.0002927741,0.0030362408,0.0015963246,0.000020984011,0.000051737454,0.000080489,0.00857439,0.00019072705,0.7852488,0.1984878,0.0016137981],"about_ca_topic_score_codex":0.094741166,"about_ca_topic_score_gemma":0.5636069,"teacher_disagreement_score":0.9671748,"about_ca_system_score_codex":0.00059145456,"about_ca_system_score_gemma":0.0021153307,"threshold_uncertainty_score":0.9999293},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021106983,0.00004092903,0.997761,0.00013788264,0.0007149087,0.00063211494,0.000033090713,0.00022200847,0.00024696885],"genre_scores_gemma":[0.6842556,0.000006804904,0.31440383,0.00070803455,0.00020976602,0.000016936658,0.00006852432,0.00007509337,0.00025537703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962306,0.00011032999,0.0006653853,0.0012774208,0.0012283088,0.0004879359],"domain_scores_gemma":[0.99646866,0.0014296392,0.00055696955,0.00077608024,0.0006371642,0.00013145724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019175188,0.0004194657,0.00068146037,0.0016187867,0.0003710665,0.00071042444,0.0022827704,0.00017048042,0.00000693353],"category_scores_gemma":[0.00076323526,0.00039979888,0.0001651594,0.0022131652,0.00047021182,0.0005987086,0.001202368,0.00057635474,0.000008178374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049719183,0.001211827,0.008269524,0.00056524365,0.0001955712,0.00014354345,0.0043480536,0.37081915,0.0003236012,0.06716793,0.000053621385,0.54685223],"study_design_scores_gemma":[0.000557182,0.00044109428,0.0005937287,0.00017738601,0.000022649934,0.0000017300684,0.000003477412,0.98112303,0.00042657118,0.016097924,0.00014594504,0.0004092768],"about_ca_topic_score_codex":0.000039596747,"about_ca_topic_score_gemma":0.00010527503,"teacher_disagreement_score":0.68404454,"about_ca_system_score_codex":0.00021768645,"about_ca_system_score_gemma":0.0006689127,"threshold_uncertainty_score":0.9998454},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033501146,0.000039645773,0.99432856,0.000058297766,0.002812685,0.00042288247,0.000013527729,0.00007840758,0.0019109908],"genre_scores_gemma":[0.98560774,8.6887974e-7,0.013601583,0.00015874764,0.00048146272,0.000021115753,0.000023328688,0.00003150048,0.00007365111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978499,0.000073504234,0.0007002637,0.0006431253,0.00046268755,0.00027054656],"domain_scores_gemma":[0.99808156,0.0008048036,0.000461352,0.0003598254,0.00022910642,0.00006336991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006143766,0.00024947585,0.00038842938,0.0009850317,0.0001077872,0.00005727583,0.00036320975,0.00032909284,0.000096542986],"category_scores_gemma":[0.000058607948,0.00026109864,0.00008468974,0.00054329226,0.0003003207,0.00013136442,0.000059137546,0.0005330315,0.000015955919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002316105,0.000011117452,0.00008505449,0.000012829955,0.00001015747,0.000004006637,0.000971861,0.83449244,0.0000063857983,0.010678457,0.0000010888331,0.15370345],"study_design_scores_gemma":[0.00029715023,0.000038918348,0.0018314784,0.00028523285,0.0000066836265,0.00000673871,0.00000714144,0.9924351,0.0000046614246,0.0047200955,0.00014998323,0.00021683858],"about_ca_topic_score_codex":0.00021086891,"about_ca_topic_score_gemma":0.00013845412,"teacher_disagreement_score":0.9852727,"about_ca_system_score_codex":0.0003426942,"about_ca_system_score_gemma":0.00030521528,"threshold_uncertainty_score":0.99998415},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8557921,0.000111423455,0.1346184,0.0006140722,0.001855261,0.0013604559,0.000033289238,0.000069565096,0.0055454434],"genre_scores_gemma":[0.99480283,0.000007579493,0.0047332784,0.00021474148,0.000059601633,0.0000029764967,0.00000633952,0.000016008547,0.00015661465],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.997907,0.00016593843,0.0004934111,0.0005744751,0.0006401115,0.00021909566],"domain_scores_gemma":[0.9988666,0.00019908905,0.00023173279,0.00047953328,0.00017475939,0.00004824157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011211714,0.00020185186,0.00041107798,0.00033499658,0.00009266079,0.00003018131,0.00052845647,0.00018452699,0.00019586184],"category_scores_gemma":[0.00006943161,0.00016117809,0.000079488666,0.00039037692,0.0013763492,0.00007173639,0.00034142082,0.00034861962,0.000016577033],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007129096,0.0009315532,0.13811953,0.00078206026,0.00009846079,0.000022187967,0.03706876,0.0106532015,0.04894842,0.0075473855,0.0002958394,0.7548197],"study_design_scores_gemma":[0.0012838206,0.00038247483,0.9260353,0.0011386571,0.000025612997,0.000010770248,0.000010332213,0.029834857,0.0027504633,0.038020134,0.000055084176,0.00045253232],"about_ca_topic_score_codex":0.00019856753,"about_ca_topic_score_gemma":0.0005730104,"teacher_disagreement_score":0.7879157,"about_ca_system_score_codex":0.00010881874,"about_ca_system_score_gemma":0.000086580476,"threshold_uncertainty_score":0.6572652},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10301654,0.0033458841,0.30961728,0.28085572,0.08267287,0.055762146,0.0006552346,0.0040360936,0.16003826],"genre_scores_gemma":[0.95780987,0.0004618014,0.010210206,0.0022056033,0.025685664,0.00024592597,0.000033469172,0.00022825993,0.0031192207],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943708,0.00045544727,0.00046081896,0.0011668195,0.002315861,0.0012302614],"domain_scores_gemma":[0.996788,0.0012919774,0.00015577742,0.0004585502,0.0010412523,0.00026441342],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.012644403,0.00034180612,0.00055192056,0.0010722006,0.0024176391,0.00096535473,0.0020422281,0.0008439812,0.000018111165],"category_scores_gemma":[0.00090660574,0.0003418512,0.00012523163,0.0013256834,0.0024053245,0.00088496314,0.00054478494,0.0020916008,0.000019448837],"study_design_candidate":"theoretical_or_conceptual","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.000063905405,0.00034115344,0.0008768773,0.00007227864,0.000026355174,0.00016430493,0.4900731,0.0018278847,0.000014326498,0.33816907,0.000499616,0.16787112],"study_design_scores_gemma":[0.0006043531,0.00076412334,0.0011592364,0.00018982483,0.0000102185095,4.0299767e-7,0.0016647766,0.0014095157,0.000008497084,0.98859084,0.0048539806,0.0007442598],"about_ca_topic_score_codex":0.00093322486,"about_ca_topic_score_gemma":0.10536413,"teacher_disagreement_score":0.8547933,"about_ca_system_score_codex":0.0007474226,"about_ca_system_score_gemma":0.0024291533,"threshold_uncertainty_score":0.9999033},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010372704,0.0002691625,0.9920884,0.004752672,0.0018407784,0.00022263428,0.000037899874,0.0006062633,0.00007851291],"genre_scores_gemma":[0.2315893,0.0004307126,0.7532707,0.002708914,0.0024264583,0.00001650949,0.0005153931,0.00035488617,0.008687155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99419695,0.000056518653,0.00061404664,0.0024706325,0.0017208875,0.0009409398],"domain_scores_gemma":[0.9954398,0.00038023846,0.00045220443,0.0032914286,0.00018806543,0.000248245],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016735782,0.00060362404,0.00062201556,0.00062203617,0.0005495823,0.0014737025,0.011305917,0.00032115314,0.000004194562],"category_scores_gemma":[0.00014171067,0.0004432375,0.000117260126,0.001059332,0.00028975794,0.0010579169,0.009197652,0.0011963213,0.00006484222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035718583,0.00014938347,0.005626144,0.000110538516,0.000068193265,0.0001989418,0.0006255137,0.019506486,0.0001318752,0.002086391,0.0006413245,0.97085166],"study_design_scores_gemma":[0.0002403571,0.00009720342,0.0001714483,0.0004641555,0.00003540361,0.000017191856,0.0000010592091,0.9834504,0.00006511368,0.013021183,0.0017185677,0.00071790756],"about_ca_topic_score_codex":0.00006257255,"about_ca_topic_score_gemma":0.00012947754,"teacher_disagreement_score":0.9701337,"about_ca_system_score_codex":0.00021112837,"about_ca_system_score_gemma":0.0008043005,"threshold_uncertainty_score":0.99980193},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01827858,0.00007506137,0.97295296,0.0033326661,0.0011856264,0.00152767,0.000016104697,0.00007436504,0.0025569594],"genre_scores_gemma":[0.95135033,0.000067292676,0.044783387,0.0027473753,0.0003947334,0.000051251995,0.000047561894,0.000055032775,0.00050306105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852574,0.000013884067,0.0002227409,0.00060928235,0.00032771923,0.00030060948],"domain_scores_gemma":[0.99847585,0.0011178928,0.000084772444,0.00016649955,0.00008063253,0.00007433931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027867782,0.00020763744,0.00035402636,0.0005841941,0.00006148115,0.000026526346,0.00014072719,0.00019725213,0.000012500866],"category_scores_gemma":[0.00021446677,0.00015155016,0.000101042926,0.0002654008,0.00050803646,0.00006309502,0.000048858987,0.00044204056,0.000006703654],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005320344,0.000072909555,0.0036262127,0.00024731035,0.00003624031,0.00013677441,0.0041130846,0.01672604,0.0002727263,0.0009389063,0.000019036785,0.9732787],"study_design_scores_gemma":[0.018549971,0.023178525,0.13833845,0.009139251,0.0004155288,0.0006713954,0.00015717527,0.50672406,0.00082187186,0.2903344,0.007861261,0.003808101],"about_ca_topic_score_codex":0.000004598846,"about_ca_topic_score_gemma":0.000103771636,"teacher_disagreement_score":0.9694706,"about_ca_system_score_codex":0.00006221292,"about_ca_system_score_gemma":0.00023410545,"threshold_uncertainty_score":0.6180036},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007225469,0.00009174763,0.98907363,0.0000416692,0.0022052266,0.00077038497,0.000018074606,0.00028655256,0.0002872197],"genre_scores_gemma":[0.95228404,0.000017338183,0.046249945,0.000030042844,0.000566136,0.0000352982,0.000013479685,0.000059309044,0.0007443919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970246,0.000041947886,0.0004599223,0.0012751787,0.0006976227,0.00050074595],"domain_scores_gemma":[0.997627,0.00097241503,0.0003468966,0.00034065775,0.0005961129,0.00011689101],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044624045,0.00047269423,0.0004652943,0.00094160094,0.0005634296,0.00089802174,0.00057603314,0.0002113724,0.0000015481775],"category_scores_gemma":[0.00009428602,0.00041975762,0.00006973501,0.0005936919,0.00047123086,0.0015320701,0.00030172474,0.00061175745,0.0000063044495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022728596,0.0000047131152,0.000059923856,0.000051957333,0.000039490842,0.000014409078,0.0010313554,0.73410505,0.000017629525,0.20495342,2.4749485e-7,0.059699047],"study_design_scores_gemma":[0.00060102454,0.00050911045,0.00019697557,0.0017634883,0.00002207842,0.000076841956,0.00006372969,0.9771746,0.00012910935,0.01824083,0.00053122075,0.0006909863],"about_ca_topic_score_codex":0.000092489325,"about_ca_topic_score_gemma":0.000053803993,"teacher_disagreement_score":0.9450586,"about_ca_system_score_codex":0.00026266195,"about_ca_system_score_gemma":0.00050523225,"threshold_uncertainty_score":0.9998254},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000600151,0.00003399682,0.9898154,0.0010304318,0.0034082127,0.00084232294,0.000025016068,0.00024426042,0.0040002004],"genre_scores_gemma":[0.97090685,0.0000013072474,0.022002628,0.0036722247,0.00080231344,0.00010843839,0.000015576376,0.00007233539,0.0024183397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702275,0.00005973779,0.00082181615,0.001052416,0.0003973966,0.0006459081],"domain_scores_gemma":[0.9969486,0.0018417153,0.00042943071,0.00050995604,0.00017496523,0.000095325704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010944931,0.0003810044,0.0005603407,0.0010245299,0.0002658033,0.00008363059,0.000697486,0.00050540053,0.00046116437],"category_scores_gemma":[0.00025592023,0.0003801195,0.00018378154,0.00033602148,0.00032898056,0.00016591956,0.000105248364,0.0012888175,0.0001784836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017252512,0.00013341078,0.00017789037,0.00008661406,0.000098491546,0.00020205099,0.02073943,0.12109484,0.00005418751,0.316954,0.00040122497,0.53988534],"study_design_scores_gemma":[0.003013892,0.00086582825,0.00444443,0.0023125056,0.00004540936,0.00007944169,0.00005011203,0.5739814,0.0000756207,0.40846336,0.004940154,0.0017278669],"about_ca_topic_score_codex":0.000023323078,"about_ca_topic_score_gemma":0.00031237677,"teacher_disagreement_score":0.9703067,"about_ca_system_score_codex":0.000282862,"about_ca_system_score_gemma":0.00016712054,"threshold_uncertainty_score":0.99986506},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017209599,0.008777485,0.98877734,0.00044599286,0.00035856033,0.0002502314,4.1993857e-7,0.00032525478,0.0010475069],"genre_scores_gemma":[0.012677003,0.03308913,0.9494004,0.0015786742,0.00061803724,0.000019992038,0.00003842442,0.000119988916,0.0024583002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969158,0.00008544941,0.0005488891,0.001249921,0.00076678203,0.0004331128],"domain_scores_gemma":[0.9984075,0.00032216086,0.00046773022,0.00051906303,0.00016953633,0.00011404432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016242312,0.00039754895,0.0005636281,0.0009397187,0.00044123118,0.00046469588,0.0010994857,0.00019526332,0.000024109522],"category_scores_gemma":[0.00015465065,0.00036462166,0.00012452813,0.0010056391,0.00027835753,0.00046381884,0.001024808,0.00097380846,0.000041256913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011652014,0.000007756631,0.0008317562,0.00019744046,0.000019731475,0.000024880503,0.00026342954,0.0017814107,0.0007315819,0.004473865,0.0000041402914,0.99166286],"study_design_scores_gemma":[0.00007360638,0.00005954674,0.00008441966,0.002640877,0.000032436717,0.000038090937,4.3132488e-7,0.9837505,0.0005590089,0.003191689,0.009034812,0.00053457805],"about_ca_topic_score_codex":0.000020483032,"about_ca_topic_score_gemma":0.000017179404,"teacher_disagreement_score":0.99112827,"about_ca_system_score_codex":0.00014755258,"about_ca_system_score_gemma":0.00009615954,"threshold_uncertainty_score":0.99988055},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1662771,0.000044447137,0.8248877,0.002071369,0.0021641243,0.0009764979,0.0005076634,0.00058413227,0.0024869826],"genre_scores_gemma":[0.18418238,0.000010638519,0.8017638,0.0069627296,0.0031479076,0.000012228108,0.00022092948,0.000016685679,0.0036827244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971193,0.00005868475,0.00045976957,0.0011485949,0.00066819735,0.00054547016],"domain_scores_gemma":[0.9976571,0.0014871528,0.000120369135,0.000242983,0.00021775023,0.00027464083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093200227,0.0003502435,0.00048899197,0.000106451786,0.00026369776,0.00025222174,0.0009400142,0.0002339766,0.00026203174],"category_scores_gemma":[0.0007817313,0.00014971693,0.00011263878,0.0008897528,0.00024321249,0.00013056037,0.00038855153,0.00043731605,0.00010151525],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000520803,0.000025848953,0.000342193,0.0000051636207,0.0000056825156,0.00006664357,0.00004296663,0.0034413221,0.004608312,0.0014018541,0.000021145266,0.9900337],"study_design_scores_gemma":[0.0005284953,0.007147183,0.19240026,0.0010383029,0.00020266733,0.00017731516,0.00000787261,0.43443328,0.0033493675,0.3106709,0.043913048,0.0061312756],"about_ca_topic_score_codex":0.00010698476,"about_ca_topic_score_gemma":0.0011903362,"teacher_disagreement_score":0.9839024,"about_ca_system_score_codex":0.000072669616,"about_ca_system_score_gemma":0.00005338719,"threshold_uncertainty_score":0.6105279},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10502999,0.00035572593,0.87040454,0.014926333,0.0037995689,0.0023609025,0.000017338853,0.0014433876,0.0016622251],"genre_scores_gemma":[0.90362704,0.000031444637,0.09387176,0.0005085319,0.00028391802,0.00004170542,0.0000020746368,0.00009161719,0.001541885],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953342,0.000067623005,0.00055234943,0.0018453131,0.0009769157,0.0012236179],"domain_scores_gemma":[0.9981314,0.00030707326,0.00026513037,0.0008618062,0.00025856987,0.00017600245],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016649053,0.00049989903,0.000640013,0.003515151,0.0005934934,0.00027333805,0.002493054,0.0008833345,0.00001569063],"category_scores_gemma":[0.00089276343,0.00053224235,0.000081808554,0.0033150583,0.0028035867,0.00027063396,0.0018091728,0.0015866869,0.00010077542],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004162602,0.00014297542,0.0061591724,0.00013256243,0.00006140782,0.0010029239,0.052385464,0.064335786,0.0029419372,0.014421697,0.00013117348,0.8582433],"study_design_scores_gemma":[0.004213058,0.0018373926,0.00611959,0.03018407,0.00017509206,0.00037619294,0.0005081722,0.24590832,0.033460844,0.60226816,0.06410335,0.010845753],"about_ca_topic_score_codex":0.0007491894,"about_ca_topic_score_gemma":0.017416066,"teacher_disagreement_score":0.8473975,"about_ca_system_score_codex":0.0018020818,"about_ca_system_score_gemma":0.00119627,"threshold_uncertainty_score":0.99991024},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17705923,0.010106404,0.6427361,0.1127695,0.017662456,0.0068312115,0.00019781345,0.006352827,0.026284477],"genre_scores_gemma":[0.9897128,0.00019479384,0.0076390966,0.0008777659,0.0005481311,0.000053754495,0.0000039230044,0.00005852356,0.0009112206],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619323,0.00008089945,0.0003654484,0.0015344347,0.00095052825,0.00087548525],"domain_scores_gemma":[0.9972135,0.0012098567,0.0001936645,0.0010010928,0.00029935496,0.00008254608],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006201417,0.00041586018,0.0004413264,0.0010202348,0.0007376296,0.00021524166,0.0037315765,0.000847465,0.000033528377],"category_scores_gemma":[0.0010105304,0.00035264433,0.000083339924,0.001866694,0.0054922337,0.0003095253,0.0012895343,0.001732004,0.00007525228],"study_design_candidate":"theoretical_or_conceptual","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.000018204428,0.000030376423,0.009655047,0.000009329633,0.000026305712,0.0003923373,0.5088485,0.005215056,0.00009438428,0.23702298,0.00008229061,0.2386052],"study_design_scores_gemma":[0.0020460056,0.00047369947,0.007594725,0.0038859358,0.000056564466,0.000036173074,0.027315125,0.007030344,0.0026449757,0.9044592,0.040334832,0.0041224314],"about_ca_topic_score_codex":0.00401024,"about_ca_topic_score_gemma":0.066645,"teacher_disagreement_score":0.81265354,"about_ca_system_score_codex":0.001316141,"about_ca_system_score_gemma":0.000942154,"threshold_uncertainty_score":0.99989253},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00400366,0.000080188176,0.99257404,0.00033346354,0.001390408,0.0005079402,0.0000038705693,0.00048397973,0.00062244426],"genre_scores_gemma":[0.8654948,0.000023912131,0.13377269,0.00036815993,0.000093256785,0.000048690887,0.000014750439,0.000031992342,0.0001517408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696064,0.000060725302,0.0005977189,0.0010661184,0.0010199946,0.0002947887],"domain_scores_gemma":[0.9976184,0.0002251191,0.00029590182,0.00076238276,0.0010555814,0.000042631586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009934325,0.0003341204,0.00035308258,0.001358274,0.00017026946,0.00024804095,0.0013965465,0.0003210342,0.000028283197],"category_scores_gemma":[0.0004393111,0.0003220442,0.000047282785,0.0010199146,0.000748292,0.0010301447,0.0009185191,0.00042905036,0.00001776673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016703421,0.000027488995,0.00021071841,0.00007952862,0.000041195522,0.000025971938,0.006063713,0.028130548,0.012007879,0.12626952,0.00005586225,0.8270709],"study_design_scores_gemma":[0.00018988065,0.00014802538,0.0007500935,0.0003546921,0.000007045425,0.00003893865,0.0000011239938,0.907012,0.02603658,0.0650813,0.00006692055,0.00031342314],"about_ca_topic_score_codex":0.00002606622,"about_ca_topic_score_gemma":0.000081167505,"teacher_disagreement_score":0.87888145,"about_ca_system_score_codex":0.0003406015,"about_ca_system_score_gemma":0.0004547528,"threshold_uncertainty_score":0.99992317},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008386223,0.00009157957,0.99495023,0.00010263069,0.0013039157,0.000103053986,0.000021715587,0.00035539322,0.002232861],"genre_scores_gemma":[0.9624965,0.00035749527,0.03180243,0.0003313321,0.0007474881,0.0000069596585,0.00019672578,0.00016962399,0.0038914315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836683,0.000009175689,0.00030234174,0.00054405135,0.00043993726,0.00033763572],"domain_scores_gemma":[0.999066,0.000048214286,0.0000534128,0.00062442536,0.00008370815,0.00012424658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002236877,0.00029117367,0.00030572838,0.0006882071,0.00007964052,0.00009304974,0.0006703885,0.00021026834,0.00022639282],"category_scores_gemma":[0.000015492375,0.00028432978,0.00013568874,0.0009895527,0.00009942137,0.0001517516,0.000095755924,0.00037480614,0.000106575346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.33939e-7,0.000005997358,0.0010226587,0.00002093551,0.000059340655,0.000013600483,0.00047312383,0.929141,0.00008012033,0.0009003853,0.00003961295,0.068242624],"study_design_scores_gemma":[0.00004299018,0.000011265502,0.0011819028,0.000027375574,0.000059148595,7.790417e-7,3.4873048e-7,0.986415,0.000033881828,0.011583035,0.0003066167,0.00033763304],"about_ca_topic_score_codex":0.000016426597,"about_ca_topic_score_gemma":0.0014420738,"teacher_disagreement_score":0.9631478,"about_ca_system_score_codex":0.00012869126,"about_ca_system_score_gemma":0.000051506926,"threshold_uncertainty_score":0.9999609},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011048761,0.002282364,0.9638171,0.002376023,0.0032343103,0.0031195574,0.000025089601,0.0005558975,0.013540903],"genre_scores_gemma":[0.98008513,0.00015627874,0.018461788,0.00082448736,0.0002282521,0.000031284657,0.000014435381,0.000028244196,0.0001701121],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691206,0.000056677465,0.00058352575,0.0008492725,0.000918478,0.0006800103],"domain_scores_gemma":[0.9982633,0.0001766455,0.00033241967,0.0009098084,0.00019567256,0.00012214345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016183456,0.00041804175,0.0004739145,0.0008159825,0.00027020567,0.00037696218,0.0017827009,0.00034042096,0.0000045527822],"category_scores_gemma":[0.00006172054,0.0003184323,0.00011533352,0.0012699836,0.00071366463,0.0007654682,0.0014733822,0.00094589964,0.000015255347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000899438,0.000062844076,0.00040600245,0.00010953761,0.000014305796,0.00003829432,0.112603545,0.00061640056,0.00003210237,0.20714651,0.000012133271,0.6789493],"study_design_scores_gemma":[0.00075684284,0.00031630413,0.0010967035,0.0014406367,0.0000136526505,0.00014836855,0.00011233731,0.46470135,0.0018182917,0.5200808,0.008219306,0.0012953675],"about_ca_topic_score_codex":0.00009627831,"about_ca_topic_score_gemma":0.0006413166,"teacher_disagreement_score":0.96903634,"about_ca_system_score_codex":0.00012782907,"about_ca_system_score_gemma":0.000223552,"threshold_uncertainty_score":0.99992675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037923732,0.00013745994,0.99308425,0.0005847735,0.00027956514,0.00066664297,0.0000074156737,0.00014857017,0.0012989318],"genre_scores_gemma":[0.9210077,0.00014655906,0.078189105,0.00011032295,0.0001443735,0.000010714397,0.0000050133813,0.000032711298,0.00035352045],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776036,0.000103615384,0.00035285254,0.00063148094,0.00071691006,0.0004347952],"domain_scores_gemma":[0.9985737,0.00075618085,0.0003550345,0.00017943865,0.000067177374,0.00006847209],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001210707,0.00023812187,0.00032411783,0.0005404791,0.0006263327,0.00007442948,0.0005333095,0.00024323828,0.000026201275],"category_scores_gemma":[0.0001437956,0.00025655093,0.00004139954,0.00027390895,0.0023298431,0.00023565715,0.0006855598,0.0004958487,0.000009975917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001682362,0.000016083983,0.001205987,0.0000521496,0.000040508134,0.00004946761,0.09048304,0.017959349,0.0009038001,0.076123595,0.000012432796,0.81313676],"study_design_scores_gemma":[0.0016551318,0.0011425366,0.004683089,0.0020056108,0.000080331374,0.000022993234,0.0018103443,0.04732634,0.01653302,0.92057216,0.0021873233,0.0019811278],"about_ca_topic_score_codex":0.0004819637,"about_ca_topic_score_gemma":0.0017423071,"teacher_disagreement_score":0.9172153,"about_ca_system_score_codex":0.00027400625,"about_ca_system_score_gemma":0.00029345788,"threshold_uncertainty_score":0.9999887},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12360047,0.000017060847,0.87075746,0.0020688204,0.0006616676,0.0011530117,0.000023937808,0.0002415894,0.0014759606],"genre_scores_gemma":[0.9765378,0.0000017943697,0.020584386,0.0016604556,0.0008416922,0.000036144927,0.000029792607,0.00005303214,0.000254872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976041,0.000022676832,0.00036103334,0.0008212516,0.00053164846,0.0006593026],"domain_scores_gemma":[0.9976033,0.0013510052,0.00012518378,0.0004219915,0.0004651419,0.00003339484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030963006,0.00030464126,0.00035929814,0.0010944447,0.0011718139,0.000827873,0.0010345486,0.0002801837,0.0000065723093],"category_scores_gemma":[0.0013749746,0.00031557438,0.000045897028,0.0010928619,0.0003910255,0.00055079244,0.0038242151,0.001170031,0.000032727432],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010220589,0.000077639575,0.0035757215,0.00041405702,0.000057363708,0.00004565334,0.021624776,0.0027215302,0.00003591438,0.04393904,0.00023630908,0.9271698],"study_design_scores_gemma":[0.0018444194,0.00028580494,0.035448946,0.025357492,0.00005851051,0.000010367554,0.0014289567,0.46178257,0.0002550774,0.45879084,0.010102396,0.0046346174],"about_ca_topic_score_codex":0.0004950076,"about_ca_topic_score_gemma":0.00046838305,"teacher_disagreement_score":0.9225352,"about_ca_system_score_codex":0.00020939285,"about_ca_system_score_gemma":0.00007607859,"threshold_uncertainty_score":0.9999296},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050445175,0.0004208347,0.96052974,0.0017832457,0.0014907725,0.0008627656,0.000070522154,0.0004079272,0.033929717],"genre_scores_gemma":[0.98655415,0.00007580036,0.010500317,0.00036863162,0.00036273737,0.0000055790433,0.0000045381917,0.00004899541,0.0020792664],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964283,0.00004737607,0.00047619236,0.00088683655,0.0013535067,0.0008077581],"domain_scores_gemma":[0.9975491,0.000813337,0.00046769212,0.00079023204,0.00030566257,0.00007396193],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009197816,0.000409453,0.0005344723,0.00047652246,0.0005734276,0.0012366842,0.002542226,0.00044536497,0.000025717676],"category_scores_gemma":[0.0012547757,0.00031466997,0.00019518458,0.0012254759,0.004553773,0.0012340107,0.0007722605,0.00089410733,0.000053525055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006685801,0.00014611836,0.010810757,0.00008574633,0.0001451133,0.000245021,0.041024826,0.003997672,0.00003342842,0.06729211,0.0009824665,0.8751699],"study_design_scores_gemma":[0.00036237837,0.00036710087,0.0024987052,0.0017089751,0.0000339072,0.000030517132,0.000057883793,0.0037803254,0.00035599704,0.98596305,0.003839344,0.0010018109],"about_ca_topic_score_codex":0.000062426814,"about_ca_topic_score_gemma":0.000060261184,"teacher_disagreement_score":0.9860497,"about_ca_system_score_codex":0.00052299106,"about_ca_system_score_gemma":0.00060412637,"threshold_uncertainty_score":0.99993056},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008892661,0.0018195716,0.9404001,0.00075751013,0.025806388,0.001241184,0.00006186092,0.00026442928,0.028759642],"genre_scores_gemma":[0.8453984,0.00038040234,0.09572227,0.00025804827,0.0011415791,0.000040564908,0.00004577357,0.00014965255,0.05686328],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98700374,0.00013725537,0.0017320333,0.0042188102,0.0060707987,0.00083733024],"domain_scores_gemma":[0.9899725,0.002249018,0.00082960597,0.0057848897,0.0009459525,0.00021807372],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.02316016,0.00053487904,0.0009609635,0.0036183374,0.0004648157,0.0019653973,0.006124656,0.00022683432,0.00005462791],"category_scores_gemma":[0.001214727,0.00042250217,0.00026025815,0.0029127593,0.0023216284,0.0003858913,0.004569245,0.000479264,0.00056151545],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009117607,0.000044908564,0.00005821076,0.0001169512,0.000021700107,0.000081665756,0.00035322917,0.05398013,0.00000976566,0.037460256,0.0006677316,0.90719634],"study_design_scores_gemma":[0.0003477521,0.00012359544,0.0023782782,0.0015087079,0.000036603196,0.000016708005,0.000016894011,0.31479594,0.00006748093,0.66319805,0.016633024,0.0008769395],"about_ca_topic_score_codex":0.00002242629,"about_ca_topic_score_gemma":0.00012192849,"teacher_disagreement_score":0.9063194,"about_ca_system_score_codex":0.00022200051,"about_ca_system_score_gemma":0.0002409682,"threshold_uncertainty_score":0.9998227},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014752397,0.001650743,0.94615996,0.026202103,0.0023202742,0.006083182,0.0002982512,0.00024224792,0.0022908552],"genre_scores_gemma":[0.9408779,0.0003887004,0.050312426,0.0068594133,0.00055387773,0.0000803967,0.000086842556,0.00011005364,0.0007303897],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744403,0.000054676784,0.00050291896,0.0008920405,0.00037125594,0.00073505566],"domain_scores_gemma":[0.99816436,0.0010364205,0.00018256347,0.00028285995,0.000017459699,0.0003163187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014095067,0.0003002756,0.0004086408,0.00045798335,0.00042149506,0.000104612,0.00031087603,0.0002470188,0.000049787697],"category_scores_gemma":[0.0003506101,0.0002917033,0.00004124388,0.00060770573,0.00066223094,0.00017391,0.00025800327,0.00070162426,0.000048119346],"study_design_candidate":"design_other","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.00015691022,0.000072331255,0.0017679107,0.0005414138,0.00000802537,0.0009582897,0.034787007,0.022750862,0.00001509414,0.0018918712,0.0002628861,0.9367874],"study_design_scores_gemma":[0.00038509202,0.001590694,0.0031893437,0.0017009481,0.000017594555,0.0011837744,0.0001490574,0.32621437,0.000106046915,0.66417986,0.00017156795,0.0011116286],"about_ca_topic_score_codex":0.0006087311,"about_ca_topic_score_gemma":0.01905326,"teacher_disagreement_score":0.9356758,"about_ca_system_score_codex":0.0009611279,"about_ca_system_score_gemma":0.00040450948,"threshold_uncertainty_score":0.9999535},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.755519,0.0025129258,0.12094594,0.0024213204,0.009677877,0.0016508241,0.000025946147,0.0013804092,0.10586579],"genre_scores_gemma":[0.9957004,0.00036386657,0.0019020704,0.00012813252,0.000783949,0.00001310375,0.000004247192,0.00002398932,0.001080228],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735975,0.00007647818,0.00033908398,0.00077119673,0.0008640454,0.0005894357],"domain_scores_gemma":[0.99759173,0.001666272,0.00018181062,0.00023995039,0.000104060215,0.00021619226],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0017448855,0.00027926988,0.00046874303,0.00035977268,0.0006980626,0.00069328706,0.0007485968,0.0002783586,0.000020935244],"category_scores_gemma":[0.00071613496,0.00027491778,0.0000706286,0.00032191144,0.0035801427,0.00035893155,0.0003782526,0.00043231205,0.000038767426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009394162,0.000013632493,0.056774322,0.00008728785,0.000023325641,0.000029117582,0.083106704,0.0002656735,0.000005503313,0.015005234,0.000042342584,0.84463745],"study_design_scores_gemma":[0.0015376179,0.0006419619,0.07015349,0.007864631,0.00016028604,0.000022942488,0.0016173627,0.013874381,0.00031898657,0.8762166,0.021599542,0.005992225],"about_ca_topic_score_codex":0.0003725131,"about_ca_topic_score_gemma":0.0017033544,"teacher_disagreement_score":0.86121136,"about_ca_system_score_codex":0.00019193778,"about_ca_system_score_gemma":0.00035926755,"threshold_uncertainty_score":0.9999703},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009060038,0.00021651099,0.97372305,0.0025139118,0.0033251122,0.0006919478,0.000069645896,0.0002725886,0.018281246],"genre_scores_gemma":[0.9097285,0.0007240479,0.07969567,0.0011576569,0.0038714572,0.000024821979,0.000067350404,0.00012112839,0.004609328],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761105,0.000058315392,0.00034257633,0.0006426762,0.0009299305,0.00041544158],"domain_scores_gemma":[0.998348,0.0004360581,0.00023694539,0.0006144084,0.00025981283,0.00010480283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012056023,0.00022070805,0.00029533484,0.00062658393,0.0005745372,0.00019051955,0.0014762108,0.00034988543,0.000066519606],"category_scores_gemma":[0.0009498107,0.00022232924,0.00009138275,0.00084192335,0.0012472323,0.00046106023,0.00074371626,0.0005668958,0.000039662547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030678057,0.0001398626,0.00191236,0.00031812105,0.000065648805,0.00006492669,0.03687108,0.008912859,0.0012502201,0.3908666,0.00157882,0.5579888],"study_design_scores_gemma":[0.0003891175,0.00012858644,0.0008744129,0.0011125378,0.000031596144,0.000007095636,0.000016687773,0.017786771,0.0010896149,0.9263659,0.051228847,0.0009688392],"about_ca_topic_score_codex":0.0006247341,"about_ca_topic_score_gemma":0.003919824,"teacher_disagreement_score":0.90882254,"about_ca_system_score_codex":0.0002236024,"about_ca_system_score_gemma":0.0008540127,"threshold_uncertainty_score":0.9066323},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021778066,0.0001153133,0.9637467,0.006357456,0.0005521684,0.0021353308,0.0000070109268,0.00045714696,0.0048507554],"genre_scores_gemma":[0.9561008,0.000050899587,0.04100986,0.002077665,0.00021344007,0.00010673297,0.000012670177,0.00006745016,0.0003604883],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961531,0.00016258714,0.0004702379,0.0009780684,0.0014217686,0.0008142377],"domain_scores_gemma":[0.998107,0.000718838,0.0002478115,0.0006883113,0.00013256275,0.0001054845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016889548,0.00048782714,0.0004958647,0.0007523635,0.000565875,0.00043402216,0.0022103258,0.00044818778,0.000015696123],"category_scores_gemma":[0.00010897645,0.0003345123,0.000061522405,0.0009438405,0.002460548,0.0005814032,0.00019767451,0.0012913264,0.00005962895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005632443,0.00029305473,0.0023023894,0.00021776056,0.00019604398,0.003812106,0.45613927,0.2393275,0.0003343286,0.01260327,0.0007418432,0.28346917],"study_design_scores_gemma":[0.026799032,0.024141418,0.047674768,0.03953065,0.00093793106,0.0013823707,0.004429778,0.13341436,0.009360642,0.45104843,0.23696631,0.024314301],"about_ca_topic_score_codex":0.00071582483,"about_ca_topic_score_gemma":0.0073559606,"teacher_disagreement_score":0.9343227,"about_ca_system_score_codex":0.00025910043,"about_ca_system_score_gemma":0.00049274095,"threshold_uncertainty_score":0.9999107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23646533,0.003197417,0.6390973,0.08615003,0.012037351,0.011300899,0.00028209115,0.00089408655,0.010575551],"genre_scores_gemma":[0.98270065,0.0007656368,0.010143451,0.0027602713,0.0017664976,0.000037551985,0.0000154568,0.000054709384,0.0017557585],"study_design_codex":"design_other","study_design_gemma":"randomized_trial","domain_scores_codex":[0.997235,0.00014836893,0.0004848611,0.00059869594,0.0008565532,0.0006765202],"domain_scores_gemma":[0.99627125,0.00279804,0.00036178296,0.00018048531,0.00013690174,0.00025156452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015773772,0.00024381935,0.0008511837,0.00023024995,0.0006680927,0.00017267956,0.00041491204,0.0002737059,0.00004627461],"category_scores_gemma":[0.0009868452,0.00019602024,0.0000891327,0.00026601556,0.0013197599,0.0001279711,0.00018810137,0.00059493806,0.0000027540887],"study_design_candidate":"design_other","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.017717833,0.00036314406,0.014683549,0.0005807656,0.0003554073,0.0002572246,0.12674691,0.009773889,0.000025091853,0.10591191,0.00007323391,0.72351104],"study_design_scores_gemma":[0.4760143,0.0035249877,0.02977748,0.012692826,0.00088322785,0.000008650758,0.0012377622,0.083755255,0.00008796058,0.35818428,0.027816776,0.006016512],"about_ca_topic_score_codex":0.004356452,"about_ca_topic_score_gemma":0.022601787,"teacher_disagreement_score":0.7462353,"about_ca_system_score_codex":0.00015780397,"about_ca_system_score_gemma":0.0019745952,"threshold_uncertainty_score":0.9952332},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030351536,0.0003608062,0.96576935,0.00058306084,0.001591995,0.00056625745,4.7053982e-7,0.00006819248,0.00070833066],"genre_scores_gemma":[0.9620037,0.000008699989,0.037643123,0.00010383592,0.00017193242,0.000008381936,0.0000035054725,0.000013853356,0.00004297534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700296,0.00016949684,0.00080035283,0.00077094627,0.0009013005,0.0003549299],"domain_scores_gemma":[0.99756265,0.0009048951,0.00051136594,0.0007997156,0.00018045239,0.00004092212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045063356,0.0002711177,0.0003523184,0.0004860194,0.00040431254,0.00021885658,0.0025591538,0.00012176277,7.5789995e-7],"category_scores_gemma":[0.00011330555,0.00018000985,0.000061550636,0.0010014169,0.00042740838,0.00014652242,0.0011668062,0.00078921707,0.000002365958],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037893676,0.000094458694,0.014047312,0.00015906338,0.000022583517,0.000007440939,0.017598642,0.021154912,0.0011177416,0.008579267,0.000009774644,0.937205],"study_design_scores_gemma":[0.0003033483,0.000116036324,0.09785974,0.00038714803,0.000014311829,0.000014486707,0.000010176514,0.8456822,0.0028347299,0.05103337,0.0012549531,0.0004894885],"about_ca_topic_score_codex":0.000056336576,"about_ca_topic_score_gemma":0.00013942242,"teacher_disagreement_score":0.93671554,"about_ca_system_score_codex":0.00015195574,"about_ca_system_score_gemma":0.00037958426,"threshold_uncertainty_score":0.7340589},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003279123,0.000012953094,0.99125016,0.001857292,0.0027071638,0.0004025857,0.0000084583635,0.00073630095,0.002697181],"genre_scores_gemma":[0.68935955,0.000030691146,0.3050799,0.002858281,0.00052984926,0.00004941385,0.00008825617,0.000090831265,0.001913217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664414,0.00002929841,0.0006400297,0.00095990003,0.0010619874,0.00066462526],"domain_scores_gemma":[0.99718577,0.0002948707,0.00031528747,0.0013232848,0.0007949178,0.000085900036],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009527251,0.00043856507,0.00037933065,0.0027046576,0.00033230722,0.0006084326,0.0033672121,0.00050782284,0.000029973598],"category_scores_gemma":[0.00017902609,0.00043718473,0.0000836816,0.0015426542,0.00080314255,0.0020038215,0.0016702303,0.0015674727,0.0009978008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010824314,0.00003558329,0.00022354808,0.000053448806,0.00002714431,0.00016764285,0.0018513999,0.0062181526,0.00034068807,0.48278147,0.00022283662,0.50806725],"study_design_scores_gemma":[0.0005547522,0.00045814482,0.0022212535,0.0005860888,0.00001678455,0.00021090575,0.0000014925542,0.6556506,0.007524417,0.3291524,0.0021327655,0.001490355],"about_ca_topic_score_codex":0.00002755231,"about_ca_topic_score_gemma":0.000039206883,"teacher_disagreement_score":0.68903166,"about_ca_system_score_codex":0.0006132265,"about_ca_system_score_gemma":0.0004817044,"threshold_uncertainty_score":0.999808},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070607495,0.00009670695,0.70422006,0.000523283,0.0021615424,0.0018131196,0.00023533701,0.00050635816,0.28338286],"genre_scores_gemma":[0.97849476,0.00015055247,0.0139118675,0.0040756436,0.0015742242,0.000015218084,0.00019766747,0.00006787862,0.0015121842],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939472,0.000090578134,0.00060110533,0.0012022117,0.002989087,0.0011698396],"domain_scores_gemma":[0.99596626,0.0015516449,0.00044043895,0.0004902394,0.00086149236,0.0006899029],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.0027700625,0.00054194685,0.0006456331,0.0016289857,0.0015129579,0.0014123431,0.002016445,0.00048352397,0.00017214623],"category_scores_gemma":[0.0030020159,0.00048049772,0.00013796949,0.0019115073,0.0072866334,0.0019681498,0.00062915386,0.0012402907,0.00018911346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007659993,0.00005788944,0.00004536083,0.00004124876,0.0000316783,0.000027675202,0.283485,0.0011247874,0.000014876707,0.01616937,0.000033930162,0.6988916],"study_design_scores_gemma":[0.0046717906,0.0009873521,0.0030518142,0.0053634583,0.00022217366,0.000054696044,0.0036328475,0.10579465,0.0016019513,0.8627348,0.006069849,0.0058146305],"about_ca_topic_score_codex":0.0005987295,"about_ca_topic_score_gemma":0.0022694054,"teacher_disagreement_score":0.971434,"about_ca_system_score_codex":0.0004719835,"about_ca_system_score_gemma":0.0052214246,"threshold_uncertainty_score":0.9997869},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023073071,0.00019568171,0.99340206,0.00075973786,0.0026295295,0.00035144165,0.000016586762,0.00040157716,0.002012665],"genre_scores_gemma":[0.4155125,0.00015447079,0.57976663,0.0011973932,0.0016570194,0.00003401378,0.0000078110525,0.0002224552,0.0014477266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952051,0.000053245432,0.0008125185,0.0018463815,0.0011710783,0.0009116794],"domain_scores_gemma":[0.9951292,0.0018596884,0.00052229076,0.0019701398,0.0002987088,0.0002199284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012154962,0.0006754466,0.000939831,0.0012637981,0.00024390187,0.00033506114,0.004887236,0.0003969099,0.0000102065],"category_scores_gemma":[0.0003996524,0.00060346734,0.0002981154,0.0011953114,0.0007129512,0.0002813381,0.002261621,0.000946443,0.000040483872],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002227269,0.000023147295,0.000010794908,0.00008606602,0.00002327082,0.00007894832,0.00038998705,0.029017098,0.00046358988,0.008475695,0.000017493969,0.96141165],"study_design_scores_gemma":[0.00016493685,0.00017556167,0.00013210232,0.0007793099,0.000013700947,0.000062078165,1.3877212e-7,0.90555507,0.0055725733,0.08638086,0.00042220618,0.0007414417],"about_ca_topic_score_codex":0.000045793488,"about_ca_topic_score_gemma":0.000039080365,"teacher_disagreement_score":0.96067023,"about_ca_system_score_codex":0.00015274843,"about_ca_system_score_gemma":0.0006998385,"threshold_uncertainty_score":0.99964166},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000092029,0.0020880203,0.9944132,0.00028667366,0.0012583853,0.0016344369,0.000010876957,0.000062946376,0.00015345255],"genre_scores_gemma":[0.82688075,0.0031778836,0.16441181,0.0006545996,0.0009226722,0.0010316983,0.00005542065,0.000099697885,0.0027654779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970168,0.00021623229,0.00065318204,0.0009726764,0.0007671047,0.000374017],"domain_scores_gemma":[0.996907,0.0016232026,0.00051898626,0.00059198646,0.00027335004,0.00008547701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014389285,0.0002896912,0.0004257109,0.00065649214,0.00024248891,0.00028058904,0.00091033056,0.00020444828,0.0000014725264],"category_scores_gemma":[0.00025823503,0.0002217155,0.000057237925,0.0018363982,0.00043292792,0.00052686146,0.00055033294,0.00046827487,0.000015021653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041294803,0.000713033,0.004873181,0.0017291504,0.00009418167,0.00011074561,0.012936133,0.07869741,0.00020832625,0.010929805,0.00077527756,0.88889146],"study_design_scores_gemma":[0.0005391642,0.00010878386,0.003589788,0.000828412,0.000020516514,0.000045906305,0.000010386671,0.9902885,0.00021396825,0.0024162924,0.0015856549,0.00035260734],"about_ca_topic_score_codex":0.00009239748,"about_ca_topic_score_gemma":0.00037349793,"teacher_disagreement_score":0.9115911,"about_ca_system_score_codex":0.00025873398,"about_ca_system_score_gemma":0.0005809577,"threshold_uncertainty_score":0.90412956},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052157935,0.0010853343,0.9877828,0.008458176,0.0005401836,0.00061967934,0.00017037481,0.00094263436,0.0003486697],"genre_scores_gemma":[0.004712732,0.000805,0.9928423,0.000781655,0.0004402342,0.00006116175,0.00013009313,0.00004883752,0.00017798097],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952519,0.00005196916,0.00042459177,0.0028485793,0.0007454896,0.0006774751],"domain_scores_gemma":[0.97942686,0.001125829,0.00022700077,0.018953782,0.0001076598,0.0001588922],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015128279,0.00043890593,0.00045367904,0.0007582579,0.000368155,0.0010002028,0.06503148,0.0003897888,0.0000017180632],"category_scores_gemma":[0.0055855857,0.00042235875,0.000026208649,0.0017084754,0.0015955844,0.0013436469,0.33455354,0.0010749007,0.000024807217],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016570903,0.000033246994,0.00024401379,0.0001838823,0.000016470627,0.00005555712,0.00031500903,0.000074326264,0.000024355655,0.003394085,0.01816041,0.977497],"study_design_scores_gemma":[0.00009205035,0.000026598904,0.00012536706,0.00011816557,0.0000047126828,0.00004708848,1.70342e-7,0.41562542,0.000046878355,0.57267386,0.010926017,0.00031363525],"about_ca_topic_score_codex":0.000016442711,"about_ca_topic_score_gemma":0.00006802559,"teacher_disagreement_score":0.97718334,"about_ca_system_score_codex":0.00018607266,"about_ca_system_score_gemma":0.000704938,"threshold_uncertainty_score":0.9998228},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017560216,0.000007700001,0.9849761,0.00022453988,0.0000855795,0.011206978,0.0000024487738,0.00012772126,0.003351355],"genre_scores_gemma":[0.80550927,0.000011560155,0.12444426,0.001824191,0.012449964,0.051726945,0.0003338892,0.00053608866,0.0031638418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977147,0.000047628713,0.0004811485,0.00079160626,0.0004457682,0.0005191788],"domain_scores_gemma":[0.99897325,0.00018833464,0.00025481966,0.00043621287,0.00008523929,0.00006214513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061752327,0.00034193773,0.00045423055,0.0005033273,0.00018008443,0.0001860477,0.0008452952,0.00016879871,0.00009080459],"category_scores_gemma":[0.000007886134,0.00033959936,0.00015002991,0.0007949348,0.00027961604,0.00009779927,0.0004375746,0.000692167,0.000012564073],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003397336,0.00006105941,0.0014295595,0.000024344972,0.000032654665,0.000014624823,0.00041063718,0.13123012,0.000020872028,0.04845905,0.00059050764,0.8176926],"study_design_scores_gemma":[0.00055878685,0.000050441493,0.0006324117,0.00041577205,0.000018107932,7.826661e-7,4.260517e-7,0.6601462,0.000104096725,0.3234434,0.013950056,0.00067955465],"about_ca_topic_score_codex":0.000074823416,"about_ca_topic_score_gemma":0.0001354318,"teacher_disagreement_score":0.86053187,"about_ca_system_score_codex":0.00018704982,"about_ca_system_score_gemma":0.00016889363,"threshold_uncertainty_score":0.9999056},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029088525,0.000027817821,0.99214566,0.0006969583,0.0038203395,0.0020650574,0.000110831985,0.000239668,0.0006027818],"genre_scores_gemma":[0.20462143,0.000013696342,0.7908579,0.0020866215,0.0011128192,0.00058156543,0.0005548954,0.000040179413,0.00013086101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968005,0.000040880917,0.00086526934,0.0007331177,0.0010628194,0.00049742556],"domain_scores_gemma":[0.9962923,0.0010441903,0.00052482216,0.0009032264,0.0011445058,0.00009094363],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0031054767,0.00035733514,0.00035336005,0.00057738676,0.0006279798,0.0011329994,0.0015215526,0.00031508738,0.000020960037],"category_scores_gemma":[0.00081236847,0.0003579375,0.00020960635,0.0004327423,0.00018446059,0.0036784464,0.00042293503,0.00042638593,0.00005226422],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017760358,0.000020340958,0.000009631909,0.00007827903,0.000014892188,4.8128214e-7,0.0038161858,0.025709923,0.000061267485,0.037171666,0.00011812997,0.93298143],"study_design_scores_gemma":[0.000464164,0.00005711041,0.00014496745,0.00010057258,0.000016453874,0.0000030155215,0.0000012223576,0.7650508,0.0005107182,0.2310178,0.0022981751,0.00033494568],"about_ca_topic_score_codex":0.000033439333,"about_ca_topic_score_gemma":0.00011774643,"teacher_disagreement_score":0.9326465,"about_ca_system_score_codex":0.00042544643,"about_ca_system_score_gemma":0.0008115583,"threshold_uncertainty_score":0.9999039},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48471692,0.006456316,0.50256425,0.0003384964,0.0020589652,0.0006716832,0.000063863416,0.000023042678,0.003106457],"genre_scores_gemma":[0.9920709,0.0006912246,0.006637566,0.00023154955,0.00013816041,0.00000342186,0.0000065402496,0.000024099487,0.00019652711],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998846,0.0000094098195,0.00022552289,0.0005406389,0.0001443426,0.00023409355],"domain_scores_gemma":[0.99944836,0.00003875781,0.00009059774,0.0003116348,0.00006313817,0.00004753004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002007373,0.00021285357,0.00026168875,0.00014286855,0.000066447064,0.000021692238,0.00030259814,0.00019093785,9.580883e-7],"category_scores_gemma":[0.000029352577,0.00019757735,0.000061308296,0.000069193935,0.0005832417,9.051733e-7,0.0003471343,0.00014061725,0.0000011740399],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097551965,0.00004209607,0.0077106585,0.00032399452,0.00020068423,0.0001012948,0.002022558,0.05589246,0.28546113,0.0014148597,0.000044441236,0.6466883],"study_design_scores_gemma":[0.009127807,0.01203258,0.16426928,0.0032369357,0.0006318526,0.0013780171,0.000023726503,0.0566763,0.39668155,0.31518877,0.028741818,0.0120113455],"about_ca_topic_score_codex":0.000014176559,"about_ca_topic_score_gemma":0.00015501777,"teacher_disagreement_score":0.63467693,"about_ca_system_score_codex":0.000010937444,"about_ca_system_score_gemma":0.00008595358,"threshold_uncertainty_score":0.805697},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07024292,0.002910318,0.920271,0.00024076801,0.003749224,0.00049351365,0.000060126567,0.000028361972,0.002003784],"genre_scores_gemma":[0.9190022,0.0012851947,0.07464193,0.00092044956,0.00233744,0.000018987403,0.00007006698,0.00010043439,0.0016233216],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979358,0.000015593287,0.00031230948,0.0010293399,0.00025337396,0.0004536168],"domain_scores_gemma":[0.99897116,0.00003072269,0.00015362151,0.0005750836,0.00018049075,0.00008892259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024861417,0.00037670278,0.00031104745,0.00018920157,0.00018265744,0.00006980643,0.0005767126,0.00033501626,0.00001439634],"category_scores_gemma":[0.000023042121,0.00036071579,0.00013655426,0.00020440029,0.0006060263,0.000002241134,0.00047331722,0.00024989736,0.00002669732],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003265707,0.000021625254,0.00040198877,0.000036464982,0.00015767381,0.000022985256,0.00013023287,0.07886861,0.62422234,0.00027576686,0.000017055087,0.2958126],"study_design_scores_gemma":[0.00430244,0.0037570829,0.048454937,0.0005974189,0.00037148406,0.0018235963,0.00000901865,0.027284632,0.3504611,0.52954495,0.023468085,0.009925239],"about_ca_topic_score_codex":0.000017669934,"about_ca_topic_score_gemma":0.0001680821,"teacher_disagreement_score":0.84875923,"about_ca_system_score_codex":0.00006045407,"about_ca_system_score_gemma":0.0002550125,"threshold_uncertainty_score":0.9998845},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008900913,0.00015570546,0.80868024,0.0070570754,0.008410695,0.0024589237,0.00007072106,0.00053745473,0.16372825],"genre_scores_gemma":[0.886364,0.00039471142,0.06406652,0.006113003,0.0012184373,0.00007502476,0.00009329722,0.00020761031,0.04146743],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981838,0.000024961215,0.0003012977,0.0007214857,0.00038726738,0.00038120378],"domain_scores_gemma":[0.9989998,0.00021899462,0.00018221769,0.00050566235,0.000026146125,0.00006718929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004944797,0.00028097504,0.00020190579,0.00014832754,0.00036050545,0.00026287953,0.001002836,0.00012527673,0.00043399123],"category_scores_gemma":[0.00003033869,0.00020515417,0.00009391156,0.00037782858,0.0006808377,0.0003248297,0.0007521104,0.00061600195,0.00075660856],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049139685,0.000032596643,0.00004232279,0.000011461785,0.000009554543,0.000031658332,0.0007044402,0.03230106,0.015761781,0.00087018555,0.0004323685,0.94979763],"study_design_scores_gemma":[0.0030281802,0.001068397,0.016569998,0.0027019111,0.00016751004,0.00038013197,0.0000122859665,0.26238847,0.034031536,0.4989548,0.17474994,0.0059468364],"about_ca_topic_score_codex":0.0001530214,"about_ca_topic_score_gemma":0.00096646603,"teacher_disagreement_score":0.9438508,"about_ca_system_score_codex":0.00037422602,"about_ca_system_score_gemma":0.00005140306,"threshold_uncertainty_score":0.9724925},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12845546,0.00061787164,0.86838686,0.00025179956,0.00097616034,0.0004436001,0.000013287995,0.00001836906,0.00083656906],"genre_scores_gemma":[0.965684,0.0002341614,0.03315049,0.0002955215,0.00021641154,0.0000100100615,0.000020802974,0.000032085376,0.00035650976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99810535,0.000032175027,0.00030133378,0.0008892016,0.0002840697,0.00038787987],"domain_scores_gemma":[0.999161,0.00015142788,0.00013541353,0.00037754633,0.00010522265,0.00006940191],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040373256,0.00030311587,0.00028803156,0.00025368662,0.00013383452,0.000067583656,0.0005151312,0.00026940525,0.000004523023],"category_scores_gemma":[0.00021367587,0.00030822665,0.000076289536,0.00018095564,0.000332882,0.0000015353899,0.00059468095,0.00036323187,0.000011106399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050407783,0.00004577389,0.035348,0.00006671874,0.00008147374,0.00006308103,0.0007271691,0.5972578,0.05266034,0.0011459976,0.000011703966,0.31254154],"study_design_scores_gemma":[0.0028733567,0.0023906392,0.3781716,0.0009904978,0.000108373635,0.00011380247,0.0000054788266,0.31177545,0.046268277,0.24781261,0.004215483,0.00527444],"about_ca_topic_score_codex":0.000035855024,"about_ca_topic_score_gemma":0.0005006216,"teacher_disagreement_score":0.83722854,"about_ca_system_score_codex":0.000060594874,"about_ca_system_score_gemma":0.00033997826,"threshold_uncertainty_score":0.999937},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17381348,0.013281485,0.8015046,0.0028290036,0.0031128353,0.0013514204,0.00010865261,0.00003322095,0.0039652954],"genre_scores_gemma":[0.99126273,0.001034457,0.006328592,0.0004862363,0.0004000283,0.000011223792,0.000020694995,0.000029036004,0.0004269922],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989045,0.000012046659,0.00022058949,0.000477646,0.00017889701,0.0002063041],"domain_scores_gemma":[0.9990713,0.00006557867,0.00015024944,0.0005262461,0.0001591088,0.000027533852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025369725,0.00018443564,0.0001791959,0.00008608556,0.00011923181,0.000029397357,0.0006073763,0.00015289188,0.000001595767],"category_scores_gemma":[0.000040262705,0.00013363645,0.0000791853,0.000094287505,0.0004748752,7.5964385e-7,0.00046637733,0.00012823564,0.0000056975105],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022205737,0.0000145959375,0.0010031122,0.00005243339,0.00007018446,0.0000048241172,0.0003700984,0.029379748,0.45342755,0.0014950538,0.000036115467,0.5141241],"study_design_scores_gemma":[0.0015479132,0.0026737435,0.058417868,0.0006848751,0.00022073276,0.00017359262,0.0000112779,0.047305852,0.6757066,0.16504532,0.044525176,0.003687039],"about_ca_topic_score_codex":0.00001841845,"about_ca_topic_score_gemma":0.000100576835,"teacher_disagreement_score":0.8174493,"about_ca_system_score_codex":0.00001533164,"about_ca_system_score_gemma":0.00012460865,"threshold_uncertainty_score":0.5449536},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5170042,0.016888672,0.33881882,0.020088103,0.023516161,0.008825094,0.00059148454,0.002463665,0.0718038],"genre_scores_gemma":[0.994541,0.0005149434,0.0010994611,0.0005513283,0.001705392,0.00001284502,0.000026467613,0.000004867084,0.0015437173],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9975349,0.000021263233,0.0003725841,0.00087219634,0.00047431394,0.0007247564],"domain_scores_gemma":[0.9991051,0.00052957656,0.00014803116,0.0000692225,0.00005432727,0.00009374912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006336578,0.0003818501,0.00044319706,0.00009564851,0.00027299934,0.00016953857,0.0008707741,0.0003121357,0.00006415118],"category_scores_gemma":[0.000038125338,0.00017070693,0.00010620236,0.00065707345,0.00027117177,0.00009999376,0.0006246905,0.0006633763,0.000048236645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027527884,0.000035183253,0.0031248436,0.0000141328,0.000022825316,0.00018266366,0.0002745465,0.027318599,0.003443686,0.0009666989,0.00014649496,0.9644428],"study_design_scores_gemma":[0.0008473601,0.0011944568,0.6113912,0.0042178123,0.000055518365,0.000066346765,0.000010741714,0.30105272,0.00063446764,0.06679471,0.009330524,0.0044041546],"about_ca_topic_score_codex":0.00014081292,"about_ca_topic_score_gemma":0.013370801,"teacher_disagreement_score":0.96003866,"about_ca_system_score_codex":0.00014851264,"about_ca_system_score_gemma":0.000027035787,"threshold_uncertainty_score":0.74612206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011807153,0.000066779896,0.9966049,0.000037204765,0.0014959525,0.00036688763,0.0000012952382,0.00013274107,0.00011352822],"genre_scores_gemma":[0.89572656,0.000027685921,0.103815585,0.000032762597,0.00019801647,0.00008187158,0.000008450474,0.00004714394,0.00006194049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987367,0.0000065896447,0.00022765619,0.00044055286,0.00031899166,0.00026955982],"domain_scores_gemma":[0.9995087,0.00017213989,0.00005270791,0.0001454461,0.0000838622,0.00003717278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003772269,0.0002183097,0.0001722634,0.00039904128,0.00012210086,0.00013071205,0.00016145443,0.00010928436,0.0000020632672],"category_scores_gemma":[0.0000576413,0.0002484639,0.00002589366,0.00022521763,0.000073804964,0.00021712486,0.00008677955,0.00030623827,0.0000063988387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004815447,0.0000015259304,0.000044594828,0.000044652817,0.000003878301,0.0000029236983,0.00015667621,0.8329809,0.00044246332,0.000024746827,6.7838624e-7,0.16629218],"study_design_scores_gemma":[0.00022986991,0.00004361806,0.0014923712,0.0002186368,0.0000036636404,0.0000013005366,3.1844587e-7,0.9936756,0.0020806564,0.0019407134,0.00007820202,0.00023505701],"about_ca_topic_score_codex":0.000017484921,"about_ca_topic_score_gemma":0.00016288532,"teacher_disagreement_score":0.89454585,"about_ca_system_score_codex":0.0005854914,"about_ca_system_score_gemma":0.000042987387,"threshold_uncertainty_score":0.9999968},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032835663,0.00014448822,0.99110264,0.00022213225,0.0021123802,0.0009862155,0.000043900516,0.00015086145,0.0019537911],"genre_scores_gemma":[0.029666003,0.000016299193,0.96596724,0.00033074882,0.000583816,0.000028906617,0.0000061808673,0.000098654,0.003302169],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99258536,0.00011947672,0.0014605385,0.0023527276,0.002453603,0.0010282861],"domain_scores_gemma":[0.984639,0.01185525,0.0010324537,0.0011806572,0.001028528,0.0002641028],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.011760364,0.00070771633,0.0010725365,0.0018464308,0.00073644944,0.0010749978,0.0025258216,0.00052044314,0.000021189151],"category_scores_gemma":[0.014584034,0.0005729564,0.00023711198,0.0015049109,0.0013017289,0.0006621514,0.0014695041,0.0008459758,0.000007892603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042120355,0.0000031794216,0.00010960115,0.00006029029,0.000013308106,0.000022895363,0.00087892916,0.32375216,0.0006174555,0.0041541983,0.000041334133,0.67030454],"study_design_scores_gemma":[0.000201145,0.000085627704,0.000007249716,0.00037112166,0.000014396031,0.000050000202,0.0000010022566,0.62038416,0.0002628078,0.3781256,0.00008871715,0.00040813754],"about_ca_topic_score_codex":0.000021941076,"about_ca_topic_score_gemma":0.00007882306,"teacher_disagreement_score":0.66989636,"about_ca_system_score_codex":0.00031659496,"about_ca_system_score_gemma":0.0010575146,"threshold_uncertainty_score":0.999962},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071605586,0.0002051703,0.99115384,0.0018212881,0.00091307884,0.00013743511,0.0000013848427,0.00021353192,0.0048382035],"genre_scores_gemma":[0.97250056,0.00011810105,0.015817855,0.004553156,0.0036918614,0.000011786202,0.00004897029,0.00011030501,0.0031474314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828625,0.0000018522935,0.00025070918,0.0007182549,0.00045085966,0.0002920764],"domain_scores_gemma":[0.9992015,0.00006746097,0.00019464301,0.0002854921,0.0002361441,0.000014788725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040058215,0.0002808108,0.00029553846,0.0010201866,0.0002272182,0.0007546893,0.0004716945,0.00016658736,0.000018952458],"category_scores_gemma":[0.00007174693,0.00025116035,0.000055573342,0.00070698734,0.00026437524,0.0006750001,0.00047110522,0.000291953,0.00008017438],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023959578,0.0000058795467,0.0002518098,0.00010824626,0.000005807316,0.000020517107,0.000037538048,0.031224001,0.000012977831,0.00192054,0.000023156243,0.96638715],"study_design_scores_gemma":[0.00011467293,0.0000042034635,0.00043940765,0.0004913674,0.000031710842,0.0000032140154,2.3591562e-7,0.844132,0.000008452166,0.15305062,0.0013581886,0.00036593105],"about_ca_topic_score_codex":0.00007032757,"about_ca_topic_score_gemma":0.00013298033,"teacher_disagreement_score":0.975336,"about_ca_system_score_codex":0.000033735734,"about_ca_system_score_gemma":0.00004779384,"threshold_uncertainty_score":0.99999404},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000965121,0.000081501166,0.9937045,0.0002052538,0.0023927528,0.00053097535,0.000006982783,0.00023207162,0.0018808529],"genre_scores_gemma":[0.24036752,0.000015743819,0.7591068,0.000131444,0.00016053217,0.000014993473,0.000004320035,0.000033501856,0.00016513678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954923,0.00009947395,0.00093511195,0.0016108984,0.0012763286,0.0005859214],"domain_scores_gemma":[0.9957294,0.00047083074,0.00073677674,0.002442025,0.0004918832,0.00012909825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025440368,0.00046066835,0.0006160677,0.0006945161,0.00024378118,0.00038411884,0.003852961,0.00034126654,0.000008105146],"category_scores_gemma":[0.00034622723,0.00047792812,0.000149834,0.0012474951,0.0012016903,0.00088621886,0.0009897676,0.00078725355,0.000066805624],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012312411,0.000035167315,0.0002288236,0.00016712052,0.000013215608,0.000012258421,0.00088548224,0.0059583993,0.002679782,0.2354276,0.0000033642386,0.7545765],"study_design_scores_gemma":[0.0002154544,0.00019022055,0.012049863,0.00050457515,0.000008839413,0.00002537882,1.7412299e-7,0.68044066,0.010021907,0.29553688,0.0003474299,0.0006586224],"about_ca_topic_score_codex":0.00012035587,"about_ca_topic_score_gemma":0.000038845577,"teacher_disagreement_score":0.7539179,"about_ca_system_score_codex":0.00042312255,"about_ca_system_score_gemma":0.00047583226,"threshold_uncertainty_score":0.99976724},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008751801,0.00017019433,0.9902378,0.00047533764,0.0042503653,0.0024218245,0.0000055370338,0.00070311717,0.0017270742],"genre_scores_gemma":[0.6678165,0.000028393324,0.3264609,0.0005096969,0.0012376956,0.00069582317,0.00006550723,0.00010700728,0.0030784563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641687,0.00005276325,0.000538415,0.0013969544,0.00085999275,0.000734993],"domain_scores_gemma":[0.997327,0.0006873181,0.00040886682,0.0010219801,0.0004028913,0.0001519259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015657082,0.0004874189,0.0005521558,0.0005675175,0.00034318963,0.0008574745,0.002663241,0.0003140448,0.0000026576633],"category_scores_gemma":[0.00016908102,0.00041736854,0.00018530444,0.00059007766,0.0005777293,0.0004921321,0.00094936875,0.0005292907,0.00005420715],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017125432,0.00004883135,0.000026364665,0.00011721796,0.00000872903,0.00002022904,0.00053082063,0.0003713748,0.000009226904,0.13432851,0.000040988376,0.864496],"study_design_scores_gemma":[0.00046701575,0.00079197215,0.00013252132,0.00013554675,0.000012526085,0.000041113897,2.9886004e-7,0.50395596,0.00047580272,0.47525856,0.017949635,0.0007790258],"about_ca_topic_score_codex":0.000018307686,"about_ca_topic_score_gemma":0.00013513015,"teacher_disagreement_score":0.86371696,"about_ca_system_score_codex":0.00026078083,"about_ca_system_score_gemma":0.00045750834,"threshold_uncertainty_score":0.9998278},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023611191,0.000072744304,0.996112,0.0014316592,0.0002538981,0.0012568576,0.000060074628,0.00031063205,0.00026604862],"genre_scores_gemma":[0.047475256,0.0002073463,0.95012295,0.0005187997,0.00024907268,0.00019389999,0.00014043019,0.000080677506,0.0010115473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979305,0.0000061023575,0.0003884162,0.00088018365,0.00042103403,0.0003737183],"domain_scores_gemma":[0.99804175,0.00070720457,0.00021277052,0.00061654154,0.00029991145,0.000121843455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039124972,0.0003154446,0.0004523993,0.00052160525,0.00025291546,0.00006778543,0.00036250468,0.0002859758,0.000018033095],"category_scores_gemma":[0.00035937954,0.00028929824,0.00014167471,0.00043933984,0.00027725875,0.0002160015,0.00021412715,0.00031519902,0.00003140835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017786694,0.00008860171,0.000270796,0.00032184992,0.000025904812,0.000024614561,0.0001006705,0.16815725,0.009081033,0.0011296393,0.0014828425,0.81913894],"study_design_scores_gemma":[0.00056796824,0.0003874992,0.00055431813,0.002645616,0.00010766887,0.000023038758,6.9211467e-7,0.91614413,0.031464245,0.045882545,0.0016404217,0.0005818623],"about_ca_topic_score_codex":0.00004591624,"about_ca_topic_score_gemma":0.000048972197,"teacher_disagreement_score":0.8185571,"about_ca_system_score_codex":0.00035133545,"about_ca_system_score_gemma":0.00026290512,"threshold_uncertainty_score":0.9999559},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012078335,0.00000807045,0.9848459,0.0009634585,0.0008706563,0.00058563607,0.000016784748,0.00021687048,0.0004142917],"genre_scores_gemma":[0.86969036,0.000015151473,0.12551962,0.0026181643,0.00031437105,0.000025113693,0.00000596095,0.00011091797,0.0017003424],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969057,0.000056729157,0.0003823092,0.0012815156,0.0008832101,0.0004905317],"domain_scores_gemma":[0.9984482,0.0007083521,0.0002305943,0.00039154003,0.00009352988,0.00012781289],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045219515,0.00040467706,0.00030260746,0.00042123935,0.00037394202,0.00028366086,0.0006324129,0.000195206,0.000041426472],"category_scores_gemma":[0.00021617366,0.00035056937,0.00008545335,0.0007221505,0.0007079696,0.00039518665,0.000057930552,0.0006531415,0.000052453706],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006482765,0.000050360417,0.00004843686,0.00005243482,0.000005669293,0.000108134795,0.0013135347,0.061598796,0.82312864,0.000464166,0.000008739573,0.11315629],"study_design_scores_gemma":[0.0009268576,0.00027494467,0.0006843365,0.00027921802,0.00001734265,0.00023491558,0.0000039796446,0.6727868,0.32188597,0.0019977363,0.0001286512,0.0007792458],"about_ca_topic_score_codex":0.00003334453,"about_ca_topic_score_gemma":0.00013658643,"teacher_disagreement_score":0.8593263,"about_ca_system_score_codex":0.00030229337,"about_ca_system_score_gemma":0.0003390361,"threshold_uncertainty_score":0.9998946},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003056716,0.000050447936,0.9925185,0.00035643918,0.002016803,0.00035646153,0.0000070755755,0.00019749276,0.004466242],"genre_scores_gemma":[0.019140111,0.000027984675,0.9798156,0.00012782402,0.00014356295,0.000014651114,0.000009339638,0.000028843127,0.0006920535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969395,0.000049509526,0.0006441012,0.000979739,0.0010079201,0.00037922116],"domain_scores_gemma":[0.99714977,0.00041813165,0.00048026512,0.0014468239,0.00042528854,0.00007970889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016861489,0.00030970512,0.00038207736,0.001219943,0.00016037114,0.00020722435,0.0027223388,0.00027007004,0.000008834439],"category_scores_gemma":[0.00033852848,0.0003028274,0.000106872416,0.0011859391,0.00059358357,0.00075770996,0.0008228191,0.00047217333,0.00007849779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016568979,0.000015951557,0.00000651259,0.000054429802,0.0000048222937,0.000004064634,0.00071066426,0.015597221,0.00030931813,0.43729085,0.000008837005,0.5459957],"study_design_scores_gemma":[0.00009488067,0.00008253149,0.00038158672,0.0002346379,0.0000056447884,0.0000125150755,3.1293243e-7,0.79243684,0.005982385,0.20027651,0.00017438484,0.000317791],"about_ca_topic_score_codex":0.000010320808,"about_ca_topic_score_gemma":0.000016296714,"teacher_disagreement_score":0.7768396,"about_ca_system_score_codex":0.00016795956,"about_ca_system_score_gemma":0.00032045887,"threshold_uncertainty_score":0.99994236},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005634531,0.00012708185,0.98853767,0.0068052243,0.0012789547,0.0012836681,0.000008137548,0.0009522107,0.00095069804],"genre_scores_gemma":[0.4670009,0.00031083392,0.5258436,0.0011457594,0.00046206033,0.0006546789,0.00010740074,0.00011756206,0.0043571643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99607533,0.000028388937,0.00065228075,0.0017413811,0.00087671453,0.0006258818],"domain_scores_gemma":[0.9969337,0.0005346711,0.0004045327,0.0015068024,0.0005102267,0.00011009606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000951001,0.00048335895,0.00045617294,0.0012335451,0.00035934075,0.00065716996,0.0029863354,0.00041258815,0.0000095175],"category_scores_gemma":[0.00014512084,0.00044785847,0.0001726618,0.0010990674,0.000424973,0.00078522495,0.00076161505,0.00047182068,0.000113183036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009641351,0.000033467408,0.000049407026,0.000050721763,0.000025501857,0.0000034051359,0.0005024795,0.00291819,0.0008902133,0.37385234,0.0002561769,0.62140846],"study_design_scores_gemma":[0.00055180467,0.00031695835,0.00103291,0.00019599994,0.00001840894,0.000006590604,0.0000013893349,0.42826012,0.008812909,0.5574574,0.002539144,0.0008064136],"about_ca_topic_score_codex":0.000016078797,"about_ca_topic_score_gemma":0.000055203735,"teacher_disagreement_score":0.620602,"about_ca_system_score_codex":0.0006552235,"about_ca_system_score_gemma":0.00050369865,"threshold_uncertainty_score":0.99979734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012292288,0.00024665295,0.9934306,0.00009476608,0.004284228,0.00080456695,0.000065886015,0.00043038858,0.0005199844],"genre_scores_gemma":[0.13691264,0.000017718212,0.86181,0.00044963942,0.00063795835,0.000027970855,0.000055605033,0.000059891252,0.000028558958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641305,0.00003576229,0.0005843657,0.0013298361,0.0007970992,0.00083987345],"domain_scores_gemma":[0.99708176,0.001044622,0.00036477004,0.0009856268,0.00031119402,0.00021203379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014516896,0.00047921092,0.000593416,0.0009482667,0.000446266,0.0007752549,0.001983713,0.0003300312,0.000001609303],"category_scores_gemma":[0.00012512598,0.00047633031,0.00020757613,0.0009286966,0.00034365166,0.0010772172,0.0007729451,0.0004603325,0.000023798613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050117407,0.00010720162,0.00012066317,0.00093109347,0.000088234534,0.00014831912,0.0021265952,0.21310894,0.00053235586,0.49765885,0.00028523777,0.2848424],"study_design_scores_gemma":[0.00038407528,0.00011329771,0.000040416846,0.00077452505,0.000015887135,0.000060204668,7.439354e-7,0.91128933,0.00052609097,0.08508711,0.0011318594,0.0005764395],"about_ca_topic_score_codex":0.00007628882,"about_ca_topic_score_gemma":0.00005075543,"teacher_disagreement_score":0.6981804,"about_ca_system_score_codex":0.00033440255,"about_ca_system_score_gemma":0.00048598944,"threshold_uncertainty_score":0.99976885},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017639172,0.0006369993,0.9909802,0.004825759,0.0021549657,0.00031870703,0.000064794745,0.00042467113,0.00041752853],"genre_scores_gemma":[0.061957292,0.0013936502,0.92768544,0.004974492,0.0025093914,0.00015204132,0.00043251264,0.00010239111,0.0007927909],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961536,0.000037535912,0.00040829575,0.0021246872,0.00072961795,0.0005462484],"domain_scores_gemma":[0.99626344,0.00044406764,0.00020834236,0.0028252178,0.00015985564,0.000099048004],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012222141,0.00036918314,0.0003740579,0.0012362578,0.0003360556,0.000509277,0.009787682,0.000521118,0.000007473002],"category_scores_gemma":[0.00023469901,0.0003712591,0.00006185255,0.0023461957,0.0010752837,0.00053584477,0.008678406,0.0012919381,0.000037943664],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004629937,0.00006809254,0.00021787392,0.0000313449,0.000019578205,0.0000757126,0.0007171138,0.0004073771,0.0000118602475,0.095829196,0.004919414,0.8976978],"study_design_scores_gemma":[0.00014480755,0.000039476025,0.00031632764,0.00009538378,0.00000451181,0.00003693206,2.294816e-7,0.36970985,0.000029151031,0.61637217,0.012898662,0.00035252294],"about_ca_topic_score_codex":0.000011318511,"about_ca_topic_score_gemma":0.00023789078,"teacher_disagreement_score":0.8973453,"about_ca_system_score_codex":0.00012701152,"about_ca_system_score_gemma":0.00072372047,"threshold_uncertainty_score":0.99987394},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023520915,0.00019891607,0.9936772,0.0007956887,0.0030938676,0.00076945324,0.00020974831,0.0003892411,0.00063065474],"genre_scores_gemma":[0.23800617,0.00024494057,0.7540479,0.0035790256,0.0025089055,0.00013843464,0.0005171406,0.000261399,0.00069610897],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99530894,0.00002098759,0.0006412273,0.0019369589,0.0011553484,0.0009365246],"domain_scores_gemma":[0.99587125,0.00091312063,0.00032629134,0.0022795328,0.00037079566,0.00023903172],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008909471,0.0005760367,0.00056932966,0.0010461672,0.00042402805,0.002781414,0.0073343534,0.00032224206,0.00001770856],"category_scores_gemma":[0.00046410528,0.000542283,0.00032011923,0.0008439283,0.0004651182,0.0024367196,0.005636275,0.00053888094,0.00007202725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000362969,0.00012223437,0.00011217529,0.00026888357,0.00007759782,0.00016427753,0.0017738509,0.0020650623,0.000312896,0.23811898,0.00074386183,0.7562039],"study_design_scores_gemma":[0.00042227635,0.00028414401,0.00021631485,0.00045301105,0.0000128535285,0.000030439856,5.140778e-7,0.17791253,0.00067697355,0.8125475,0.0065355045,0.0009079535],"about_ca_topic_score_codex":0.000022514685,"about_ca_topic_score_gemma":0.000039939383,"teacher_disagreement_score":0.75529593,"about_ca_system_score_codex":0.00011396539,"about_ca_system_score_gemma":0.00037515297,"threshold_uncertainty_score":0.9997029},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042484564,0.0004133305,0.98992825,0.0006759246,0.0043086717,0.00070951437,0.000048103866,0.0003490497,0.0035246576],"genre_scores_gemma":[0.005287066,0.00009620666,0.99053574,0.0021909927,0.0014773416,0.000016218764,0.00003643111,0.00009132374,0.00026868194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939102,0.000073266645,0.0007336046,0.002595619,0.0013096672,0.0013776486],"domain_scores_gemma":[0.9940905,0.0006683479,0.00040504168,0.00424549,0.00023851471,0.000352129],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0021157798,0.00075874827,0.0008475004,0.0008069995,0.00083196006,0.0028466557,0.016683266,0.0004948889,0.000020984613],"category_scores_gemma":[0.000143905,0.0007241005,0.00023950808,0.0024988058,0.00091004855,0.0020241654,0.017578816,0.0012701089,0.000060751212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026406316,0.00008001961,0.00035465788,0.00010173129,0.000060538958,0.0004661574,0.00064809306,0.13819155,0.000051466886,0.48123336,0.0023147678,0.37647128],"study_design_scores_gemma":[0.0002946791,0.00008595367,0.00013613651,0.0005097797,0.0000119473625,0.00004983042,9.182922e-8,0.44176275,0.00006946427,0.5524933,0.0038408719,0.0007452455],"about_ca_topic_score_codex":0.00032763722,"about_ca_topic_score_gemma":0.00097089575,"teacher_disagreement_score":0.375726,"about_ca_system_score_codex":0.00022570438,"about_ca_system_score_gemma":0.00073718035,"threshold_uncertainty_score":0.999521},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011833147,0.00013502494,0.99128175,0.0037937656,0.0010157999,0.0005661994,0.00001928669,0.00042346108,0.0015813891],"genre_scores_gemma":[0.90916693,0.00007061229,0.088351786,0.0017763849,0.00015260675,0.000038477392,0.0000046225296,0.00004555347,0.00039303274],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963252,0.000041750547,0.00065189775,0.0015527927,0.00082070177,0.0006076869],"domain_scores_gemma":[0.9955102,0.0011037119,0.00039875275,0.0025949858,0.00027635324,0.00011597514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015222955,0.00044965837,0.0006603607,0.00076778734,0.00028229057,0.00017576694,0.0040457873,0.00065892626,0.000011977513],"category_scores_gemma":[0.00022002196,0.00041117956,0.00014992616,0.0010093225,0.0016744884,0.00018120298,0.0012439123,0.001274695,0.000070685164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013064666,0.00010147762,0.00005835235,0.000046229696,0.00002004997,0.000029235096,0.00046080636,0.0032966363,0.00044848293,0.45457438,0.000037777998,0.5409135],"study_design_scores_gemma":[0.00037878766,0.0004407386,0.00080978894,0.00034685194,0.00001091799,0.000030053452,2.7564045e-7,0.19170049,0.019214956,0.7824978,0.0038108493,0.0007584644],"about_ca_topic_score_codex":0.000061914994,"about_ca_topic_score_gemma":0.0001165505,"teacher_disagreement_score":0.9079836,"about_ca_system_score_codex":0.00017241338,"about_ca_system_score_gemma":0.00054187054,"threshold_uncertainty_score":0.999834},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1339848,0.0031424405,0.8385461,0.0036704664,0.007612318,0.0028278294,0.00012273104,0.00058727735,0.009506014],"genre_scores_gemma":[0.9877048,0.00025436352,0.009859729,0.0002342596,0.00010643991,0.000029651354,0.0000075069847,0.00003108429,0.0017721301],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611765,0.00006824147,0.00089098467,0.0008354936,0.001700944,0.00038669232],"domain_scores_gemma":[0.9956352,0.002456981,0.00048349856,0.0011166772,0.00024394631,0.00006369442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035317063,0.000251213,0.0004517138,0.0012871383,0.00019611629,0.00017774107,0.0027696842,0.00033069748,0.00006828144],"category_scores_gemma":[0.00069063785,0.00016767725,0.0001014832,0.0012702974,0.0010093119,0.00022464756,0.00075779995,0.00072625466,0.0001498237],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015869316,0.000039461687,0.017833797,0.000005317305,0.0000041485196,0.000030282043,0.0012518342,0.01673335,0.0004229404,0.009580758,0.00007869385,0.9540036],"study_design_scores_gemma":[0.00059242256,0.0002873271,0.0288961,0.00021676309,0.000008379408,0.000017762279,0.0000411483,0.11807256,0.0020854322,0.8325842,0.016572554,0.00062533317],"about_ca_topic_score_codex":0.000020032545,"about_ca_topic_score_gemma":0.0010619503,"teacher_disagreement_score":0.9533782,"about_ca_system_score_codex":0.00011425606,"about_ca_system_score_gemma":0.000223389,"threshold_uncertainty_score":0.68376803},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016044694,0.000047997197,0.9936301,0.0012160431,0.0012520351,0.0009732483,0.00008780412,0.00038385796,0.0008044062],"genre_scores_gemma":[0.80037045,0.000053156866,0.17782517,0.003624987,0.00022748776,0.00053332443,0.000024083256,0.00011029248,0.017231075],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954969,0.0000388189,0.00073947775,0.0015441683,0.0017080815,0.00047251664],"domain_scores_gemma":[0.9952881,0.0017176885,0.00025283,0.0018188633,0.0006944831,0.00022806246],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017512818,0.00033790336,0.00043849123,0.00248159,0.00037002124,0.0006406119,0.002875961,0.00040866833,0.0001451843],"category_scores_gemma":[0.0010798699,0.0002891635,0.0001718122,0.0021019378,0.000980473,0.0003148558,0.0012502389,0.00076553616,0.0018965806],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010228612,0.00007598193,0.005433643,0.0000060579996,0.000019703517,0.000031789852,0.0005442528,0.006979627,0.00027272513,0.0429106,0.00079730793,0.94291806],"study_design_scores_gemma":[0.0005397705,0.0006810861,0.025856664,0.00031112056,0.000052753716,0.00010767045,0.000012301135,0.009493106,0.0007235014,0.76985157,0.19060771,0.0017627702],"about_ca_topic_score_codex":0.000013048808,"about_ca_topic_score_gemma":0.0005626551,"teacher_disagreement_score":0.9411553,"about_ca_system_score_codex":0.0001532355,"about_ca_system_score_gemma":0.00032039493,"threshold_uncertainty_score":0.9999561},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015169519,0.00009467612,0.9952476,0.0005480223,0.0018644308,0.0012833186,0.000019948227,0.0003798173,0.00041048988],"genre_scores_gemma":[0.008021589,0.00004271749,0.98873186,0.0008573453,0.00038069155,0.00020006848,0.00003275397,0.00009130739,0.0016416749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950981,0.000074050084,0.0006112713,0.0019021396,0.0012748528,0.0010395662],"domain_scores_gemma":[0.9961013,0.001348703,0.00029594888,0.0016634415,0.00036987165,0.00022073388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017152451,0.00055347383,0.0006719271,0.001016937,0.0003429577,0.00064245897,0.0035100956,0.00035363808,0.000020079136],"category_scores_gemma":[0.0004945535,0.00051819644,0.0002577484,0.0010190932,0.00075883867,0.0008217028,0.0014028909,0.0006398806,0.00014395156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015122238,0.000056180506,0.00001133027,0.00018053253,0.000052946125,0.000069631955,0.0006214861,0.034158196,0.004372443,0.48395294,0.00013128073,0.47624183],"study_design_scores_gemma":[0.0005850269,0.00013167105,0.0000052249006,0.00010133741,0.0000048157226,0.000010257578,4.3340624e-8,0.5646953,0.002416507,0.43069997,0.00096579426,0.0003840396],"about_ca_topic_score_codex":0.0000053358685,"about_ca_topic_score_gemma":0.0000073871124,"teacher_disagreement_score":0.5305371,"about_ca_system_score_codex":0.00026650884,"about_ca_system_score_gemma":0.00051947276,"threshold_uncertainty_score":0.99972695},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033350012,0.00070193096,0.9943467,0.00035185553,0.0025854697,0.00045052485,0.000017069264,0.0002570898,0.0009558731],"genre_scores_gemma":[0.314659,0.00084129383,0.6808369,0.0013125507,0.00085591,0.00004668751,0.00002317433,0.00017487427,0.001249617],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99603164,0.00003823912,0.00064282207,0.0015852593,0.0010396299,0.0006624154],"domain_scores_gemma":[0.9973989,0.00039071447,0.00035926676,0.0014156443,0.00024282726,0.00019265966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076303736,0.0005636833,0.0007870491,0.0015135088,0.000257246,0.0003667366,0.0033024224,0.0003273033,0.000008727712],"category_scores_gemma":[0.00007326377,0.0005182405,0.00017419666,0.0014717748,0.0016389202,0.00045514037,0.0021019205,0.00076240173,0.000011177877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004795235,0.00003010218,0.00014551808,0.00028817175,0.000044442222,0.00005463976,0.0018111798,0.005300386,0.00031953148,0.26956967,0.000042879215,0.7223887],"study_design_scores_gemma":[0.00027851455,0.00015393022,0.00093300914,0.00058128254,0.000011389093,0.000090833775,2.5366805e-7,0.1110839,0.0008438065,0.8849406,0.00044037573,0.00064205815],"about_ca_topic_score_codex":0.000044325283,"about_ca_topic_score_gemma":0.00012769918,"teacher_disagreement_score":0.7217466,"about_ca_system_score_codex":0.00006131732,"about_ca_system_score_gemma":0.00030481853,"threshold_uncertainty_score":0.9997269},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012444417,0.00009582119,0.9860406,0.0025543026,0.0024171053,0.00029067803,0.000017039494,0.0004351462,0.008136865],"genre_scores_gemma":[0.0013898287,0.000056545337,0.96476847,0.0013638223,0.0015493245,0.000015156482,0.00009415803,0.00007494067,0.030687774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960015,0.000029063309,0.0004586179,0.0015658317,0.0012650427,0.00067998125],"domain_scores_gemma":[0.99789673,0.0002964134,0.00022541072,0.001313867,0.00011357328,0.00015397566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007928284,0.00050700805,0.0004423724,0.00094769977,0.0003046835,0.00074563816,0.0033837508,0.00024228253,0.0000653201],"category_scores_gemma":[0.000048758327,0.00047918296,0.00014152029,0.0008738677,0.0005962642,0.0013782055,0.0021524695,0.00062130357,0.0007206974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040672508,0.00002585799,0.000036017096,0.00003255027,0.000032802767,0.00024046536,0.00038711086,0.018832363,0.00013982951,0.34094602,0.0009878164,0.6383351],"study_design_scores_gemma":[0.00017537503,0.000083350984,0.00027433343,0.00011657253,0.0000078630765,0.000027531547,4.283373e-8,0.7283059,0.00018465721,0.25906834,0.011119393,0.0006366805],"about_ca_topic_score_codex":0.000019595162,"about_ca_topic_score_gemma":0.000024940831,"teacher_disagreement_score":0.7094735,"about_ca_system_score_codex":0.00017407951,"about_ca_system_score_gemma":0.00027283945,"threshold_uncertainty_score":0.999766},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021748435,0.004075181,0.98632467,0.0055655865,0.0020210147,0.00033202145,0.000035809484,0.00044472882,0.0009835325],"genre_scores_gemma":[0.054506496,0.006451306,0.92084295,0.010457961,0.004625983,0.0001535856,0.00029053667,0.0003458042,0.0023253786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575907,0.00005449849,0.00048822945,0.0020246482,0.0010430188,0.000630548],"domain_scores_gemma":[0.99776584,0.00050902914,0.00027223522,0.0007458945,0.00042455297,0.00028245992],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006521891,0.0005664456,0.00047910603,0.0009885927,0.00024519605,0.0028998163,0.002330077,0.00019360456,0.0000059141985],"category_scores_gemma":[0.00014166943,0.00052784214,0.00007919858,0.0007502841,0.0010661152,0.0023806943,0.0033261217,0.00055113307,0.000057584683],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034598118,0.000059923816,0.00006763471,0.00016043511,0.000014131319,0.0001598541,0.00053171266,0.00014062627,0.000005360925,0.000053128075,0.00072784023,0.9980759],"study_design_scores_gemma":[0.00088251,0.00034050978,0.0054652854,0.0029221433,0.000029853509,0.0004725188,0.0000023862858,0.8307653,0.00009332398,0.15250033,0.0048677367,0.001658127],"about_ca_topic_score_codex":0.0000061985224,"about_ca_topic_score_gemma":0.000034243076,"teacher_disagreement_score":0.99641776,"about_ca_system_score_codex":0.00015631778,"about_ca_system_score_gemma":0.00049051305,"threshold_uncertainty_score":0.9997173},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020948055,0.00023038262,0.99383336,0.000017670965,0.0036124252,0.00037843036,0.0000076596325,0.00045698,0.0014421258],"genre_scores_gemma":[0.7102754,0.00021335724,0.2861683,0.00007012006,0.0017455266,0.000023197965,0.000012631261,0.00035940725,0.0011320477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981315,0.00001931195,0.0005316533,0.0004288004,0.0005288806,0.0003598664],"domain_scores_gemma":[0.9989757,0.00026393004,0.0001304211,0.0004313646,0.00012366376,0.000074917654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005434157,0.00032561098,0.00052961876,0.00044142522,0.00006177945,0.00009078244,0.0006478138,0.0002901327,0.000004280135],"category_scores_gemma":[0.000022243545,0.00030486332,0.00009516285,0.00028716604,0.00016650782,0.00005509694,0.00013400333,0.00033161548,0.00007089259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010021217,0.000002394835,0.0000023128543,0.0003010599,0.00002102053,0.000038850838,0.00021862253,0.9731955,0.00060249225,0.0021058628,0.00002119622,0.023489695],"study_design_scores_gemma":[0.00005646271,0.00004217231,0.00001152961,0.0011581028,0.000009842644,0.000014885806,5.3891347e-7,0.9932353,0.0025712813,0.0025543976,0.000041123036,0.00030437316],"about_ca_topic_score_codex":0.000010239586,"about_ca_topic_score_gemma":0.0000074147183,"teacher_disagreement_score":0.7102545,"about_ca_system_score_codex":0.0002994729,"about_ca_system_score_gemma":0.00017490148,"threshold_uncertainty_score":0.99994034},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016021721,0.00021020566,0.9526554,0.0007338713,0.014637471,0.0021801197,0.000025040265,0.00016433334,0.013371835],"genre_scores_gemma":[0.9948511,0.000004461533,0.0033381812,0.00045403058,0.0006436412,0.000041693365,0.000014495261,0.000039246188,0.00061314355],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983705,0.00004890316,0.00041712713,0.0005777146,0.00030310728,0.00028259077],"domain_scores_gemma":[0.9986189,0.00047504556,0.0002828777,0.00046599793,0.00011688117,0.000040295698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005042482,0.00022464772,0.00030439612,0.0004888422,0.00016470862,0.00009070988,0.00067395513,0.00021867851,0.00019075238],"category_scores_gemma":[0.000031248448,0.00018081654,0.0001015478,0.00024598266,0.00024103429,0.00013087904,0.00014328137,0.0006295315,0.000017187183],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010636938,0.00014368807,0.0018282748,0.000033817367,0.000080571626,0.000014301076,0.0307235,0.08563053,0.004147057,0.03306904,0.00012873684,0.8440941],"study_design_scores_gemma":[0.0027881195,0.0019511586,0.04481445,0.0014860821,0.000119887896,0.00007354986,0.0007530757,0.13514428,0.006667968,0.79027027,0.013970371,0.0019607726],"about_ca_topic_score_codex":0.00014671654,"about_ca_topic_score_gemma":0.00046785068,"teacher_disagreement_score":0.9788294,"about_ca_system_score_codex":0.00018434483,"about_ca_system_score_gemma":0.000065605025,"threshold_uncertainty_score":0.73734844},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002486412,0.00007532992,0.99056375,0.004867899,0.0011255123,0.00026769543,0.000017456767,0.000117635194,0.00047833603],"genre_scores_gemma":[0.9078436,0.00001684307,0.0792633,0.012439278,0.00031011546,0.000006827353,0.000014483574,0.000040231993,0.00006534597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947336,0.000084971776,0.0007536073,0.0018763001,0.0012174214,0.0013341403],"domain_scores_gemma":[0.9960744,0.0014432346,0.00023263022,0.0015129399,0.00010340857,0.000633425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076251087,0.0005867424,0.0008028819,0.0014732457,0.00020083171,0.0003208898,0.0031351664,0.00025531894,0.000025409121],"category_scores_gemma":[0.0002866275,0.0005308081,0.0001680264,0.0008835257,0.0003641694,0.00030177407,0.0010864896,0.0010867779,0.000022548924],"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":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.000007762749,0.000018775148,0.007919881,0.000035040044,0.000037700134,0.00085379556,0.0003573474,0.9145057,0.000008937961,0.017194374,0.000046964222,0.059013702],"study_design_scores_gemma":[0.00022784378,0.00008841559,0.0009992137,0.0001893959,0.00001162934,0.00004459175,0.0000022259358,0.9112888,0.000043592467,0.086492546,0.00008491728,0.00052680494],"about_ca_topic_score_codex":0.576346,"about_ca_topic_score_gemma":0.85853195,"teacher_disagreement_score":0.9113004,"about_ca_system_score_codex":0.00714245,"about_ca_system_score_gemma":0.008450669,"threshold_uncertainty_score":0.9997144},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006699408,0.00011276942,0.99196297,0.0010181464,0.004518473,0.0008396486,0.00002102605,0.0007491726,0.0007711069],"genre_scores_gemma":[0.014084327,0.000014750595,0.9824779,0.0007201598,0.0007562643,0.000055542532,0.00005551048,0.00010165509,0.001733902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536145,0.00003294456,0.0006170098,0.0020535067,0.0009708015,0.00096427195],"domain_scores_gemma":[0.99646044,0.0009899557,0.0003230292,0.0015400378,0.00046418852,0.00022234474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012439229,0.0006287236,0.00065264886,0.0011234928,0.00036817955,0.0006150445,0.003649654,0.00047128389,0.0000049345745],"category_scores_gemma":[0.00031460173,0.0006139795,0.00018687632,0.0011036721,0.0004155305,0.000577379,0.0010673819,0.0007226722,0.00011477482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037396676,0.000023619054,0.00005949008,0.000053439966,0.000014920957,0.0001337705,0.00035579133,0.47785422,0.00005330057,0.010441862,0.00013388968,0.51087195],"study_design_scores_gemma":[0.00028326816,0.00021215357,0.0003062435,0.00047587688,0.000010454837,0.00005821487,1.2609713e-7,0.91520095,0.00028409789,0.08229715,0.00021332904,0.00065816654],"about_ca_topic_score_codex":0.000019354951,"about_ca_topic_score_gemma":0.00001765415,"teacher_disagreement_score":0.5102138,"about_ca_system_score_codex":0.00036006325,"about_ca_system_score_gemma":0.0004542048,"threshold_uncertainty_score":0.99963117},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024100086,0.0004838337,0.99214447,0.00052801904,0.0010732084,0.0007939101,0.000018304749,0.00029313433,0.0022551443],"genre_scores_gemma":[0.335166,0.0011029742,0.6596296,0.0007630947,0.00027684486,0.00013116196,0.000017974678,0.00027408884,0.0026382508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945538,0.000071102884,0.00064809923,0.0020733767,0.001467553,0.0011860356],"domain_scores_gemma":[0.9960761,0.0011139167,0.00039932632,0.0017027796,0.00039963482,0.00030826303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020553626,0.0006546539,0.0008932089,0.0023826149,0.00032310243,0.00037019755,0.0040291185,0.00038323036,0.0000084171115],"category_scores_gemma":[0.00017691379,0.0006212939,0.00019696723,0.0023229478,0.002669967,0.0008285621,0.0029887017,0.0010667907,0.00002021287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084513165,0.00008252465,0.00074909796,0.00043432476,0.00007004604,0.00030039318,0.0012469806,0.0059779505,0.002429758,0.68665814,0.000040873572,0.3019254],"study_design_scores_gemma":[0.00041915735,0.00035599573,0.0002572226,0.00032619096,0.00000898364,0.000053688804,7.799734e-7,0.06963929,0.0044298046,0.9235482,0.00030255856,0.00065811776],"about_ca_topic_score_codex":0.000023839388,"about_ca_topic_score_gemma":0.000049623824,"teacher_disagreement_score":0.33275598,"about_ca_system_score_codex":0.00012075241,"about_ca_system_score_gemma":0.00039204938,"threshold_uncertainty_score":0.99962384},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019285524,0.00005374741,0.9937969,0.0019502186,0.0011186991,0.0003327258,0.0000113646975,0.0005275692,0.0021895224],"genre_scores_gemma":[0.01290031,0.000084748455,0.98293614,0.0011410406,0.00042629195,0.0000129594855,0.000024006213,0.000057027795,0.0024174666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967767,0.00002741018,0.00040051364,0.0012180145,0.0010005402,0.00057682494],"domain_scores_gemma":[0.99798054,0.00027489688,0.00016657166,0.0010274617,0.0003444909,0.000206043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058952597,0.0003704676,0.00035377525,0.0009842465,0.0002812795,0.00059507764,0.0025110256,0.00020127428,0.00002221883],"category_scores_gemma":[0.00008020505,0.00030550826,0.00008135752,0.0010949922,0.000549615,0.0006328954,0.0012416985,0.00093731727,0.000079421894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042404713,0.00004773519,0.0000362548,0.000030497364,0.000017395905,0.00008124152,0.0005798994,0.80469847,0.000011509938,0.025256937,0.0000216413,0.1692142],"study_design_scores_gemma":[0.00022628269,0.00023150715,0.00006581821,0.0004963737,0.000004515405,0.000046871603,2.9373314e-7,0.97000307,0.00004256686,0.0279435,0.00057684386,0.00036235267],"about_ca_topic_score_codex":0.000013627876,"about_ca_topic_score_gemma":0.00016640461,"teacher_disagreement_score":0.16885185,"about_ca_system_score_codex":0.00017940965,"about_ca_system_score_gemma":0.0006648138,"threshold_uncertainty_score":0.9999397},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010950412,0.00021161092,0.99422324,0.0012963136,0.0011426396,0.0004405673,0.000003269427,0.00014167128,0.0014456357],"genre_scores_gemma":[0.71463406,0.000039014434,0.28179884,0.0017546188,0.0009133871,0.00003914264,0.000029168123,0.000056920882,0.0007348417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651283,0.00006488039,0.00063321827,0.0012160274,0.00094457524,0.0006284414],"domain_scores_gemma":[0.99753976,0.0010384781,0.0002820836,0.0009125073,0.00013257437,0.000094605835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001721667,0.00040580053,0.0003746872,0.00094579416,0.00043818977,0.00076941063,0.0024509965,0.00018426382,0.000010077916],"category_scores_gemma":[0.00020404426,0.00032032613,0.00010792016,0.0016837183,0.00031859666,0.00044882618,0.0013441736,0.00077045156,0.0000420859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029628377,0.000017734044,0.00010435096,0.000029404584,0.00000613582,0.000049460057,0.001099221,0.42062274,0.00017045623,0.04769746,0.00002134291,0.5301787],"study_design_scores_gemma":[0.00013517514,0.00004572525,0.000557161,0.00019558129,0.000003137232,0.000030007783,6.1795447e-7,0.7635109,0.0002990492,0.23469783,0.00018809835,0.0003367322],"about_ca_topic_score_codex":0.000065837405,"about_ca_topic_score_gemma":0.00036864207,"teacher_disagreement_score":0.71353906,"about_ca_system_score_codex":0.00025638044,"about_ca_system_score_gemma":0.00049308426,"threshold_uncertainty_score":0.9999249},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018092882,0.00051964517,0.99376935,0.00035497136,0.0034871595,0.0008638139,0.00031574134,0.00027656974,0.00039468365],"genre_scores_gemma":[0.010841115,0.00009801691,0.986146,0.0008380988,0.0012568379,0.0000359784,0.00015903545,0.00007828348,0.0005466523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994778,0.000031116044,0.0005984563,0.0026336354,0.0011048025,0.000854031],"domain_scores_gemma":[0.99445957,0.0012440148,0.00047990063,0.0033055525,0.00035516365,0.00015577863],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013524024,0.00060986175,0.00069634744,0.0005578864,0.0005428113,0.0007972967,0.009240088,0.00036056203,0.0000075279368],"category_scores_gemma":[0.00025579584,0.000528725,0.000109718756,0.0006347238,0.00061006733,0.0014636806,0.0063916133,0.00067751826,0.000029663895],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004508357,0.000020970561,0.000022044183,0.000084681335,0.000027397926,0.00010460226,0.0005250984,0.010700884,0.000060322538,0.054173347,0.0010869442,0.9331486],"study_design_scores_gemma":[0.000461313,0.00014504966,0.00016884485,0.00037759397,0.000012193262,0.00002568641,3.806615e-7,0.8180952,0.00015723148,0.17495361,0.0049801585,0.0006227506],"about_ca_topic_score_codex":0.000056836765,"about_ca_topic_score_gemma":0.00015223133,"teacher_disagreement_score":0.9325259,"about_ca_system_score_codex":0.00018179369,"about_ca_system_score_gemma":0.00062523206,"threshold_uncertainty_score":0.9997164},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019496533,0.00015280841,0.99241364,0.0001159473,0.0015309392,0.00074722525,0.0000015753645,0.00059860724,0.0024895775],"genre_scores_gemma":[0.069747746,0.0000028326003,0.92863095,0.0006408503,0.0005274718,0.000016147384,0.0000029217874,0.00012734234,0.00030371558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928739,0.00054702436,0.0007572763,0.0029361148,0.0017646841,0.0011210063],"domain_scores_gemma":[0.99493504,0.0015675417,0.0004317054,0.0024248136,0.0003239072,0.00031701912],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005023301,0.0009582247,0.00092450716,0.0015162947,0.00090450386,0.0024706111,0.0042444975,0.00027297394,0.000008283738],"category_scores_gemma":[0.0001763044,0.00081660924,0.00014528695,0.0013607987,0.0007109037,0.0014671641,0.0013429092,0.0013434379,0.00005045986],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010822211,0.00082292495,0.0000734991,0.000045636778,0.00006381379,0.003066703,0.0143401455,0.033045232,0.049113486,0.0059505263,0.000011106527,0.8933587],"study_design_scores_gemma":[0.003904609,0.013332897,0.00046126914,0.0025909392,0.00009598854,0.0006705407,0.000052844563,0.61010295,0.2809973,0.08276369,0.0001908818,0.004836077],"about_ca_topic_score_codex":0.000051814146,"about_ca_topic_score_gemma":0.00003150688,"teacher_disagreement_score":0.8885226,"about_ca_system_score_codex":0.0004828985,"about_ca_system_score_gemma":0.00047786592,"threshold_uncertainty_score":0.99942845},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008126073,0.00018169194,0.9933008,0.0005939922,0.0015420134,0.00041925584,0.0000034110878,0.00043827112,0.0034393135],"genre_scores_gemma":[0.0068866964,0.000026202619,0.9882584,0.0012980145,0.0006143906,0.000009732764,0.000004683498,0.000098063094,0.0028038155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951514,0.00007453693,0.0005517655,0.002029691,0.0011919299,0.0010006791],"domain_scores_gemma":[0.9963877,0.00079229963,0.00032593773,0.0018317546,0.00042726335,0.00023504999],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018222351,0.0006966575,0.00068117067,0.001225676,0.00041610218,0.0015954074,0.003875053,0.00033641187,0.000011267248],"category_scores_gemma":[0.00015371558,0.0005710461,0.00014975546,0.0013480445,0.00090512884,0.0011112985,0.0015478297,0.0011642028,0.000110801775],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005870337,0.000047073467,0.000009774762,0.00008804914,0.000033783446,0.0010430824,0.001058345,0.004566956,0.007731193,0.006589632,0.00004329566,0.9787301],"study_design_scores_gemma":[0.0028134799,0.0011161079,0.00009892435,0.0013631404,0.000043576343,0.00048668488,4.911308e-7,0.73712736,0.024384135,0.22920673,0.00096620707,0.002393169],"about_ca_topic_score_codex":0.000038093,"about_ca_topic_score_gemma":0.000064349544,"teacher_disagreement_score":0.97633696,"about_ca_system_score_codex":0.00024164385,"about_ca_system_score_gemma":0.0008166641,"threshold_uncertainty_score":0.9996741},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021748435,0.004075181,0.98632467,0.0055655865,0.0020210147,0.00033202145,0.000035809484,0.00044472882,0.0009835325],"genre_scores_gemma":[0.054506496,0.006451306,0.92084295,0.010457961,0.004625983,0.0001535856,0.00029053667,0.0003458042,0.0023253786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575907,0.00005449849,0.00048822945,0.0020246482,0.0010430188,0.000630548],"domain_scores_gemma":[0.99776584,0.00050902914,0.00027223522,0.0007458945,0.00042455297,0.00028245992],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006521891,0.0005664456,0.00047910603,0.0009885927,0.00024519605,0.0028998163,0.002330077,0.00019360456,0.0000059141985],"category_scores_gemma":[0.00014166943,0.00052784214,0.00007919858,0.0007502841,0.0010661152,0.0023806943,0.0033261217,0.00055113307,0.000057584683],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034598118,0.000059923816,0.00006763471,0.00016043511,0.000014131319,0.0001598541,0.00053171266,0.00014062627,0.000005360925,0.000053128075,0.00072784023,0.9980759],"study_design_scores_gemma":[0.00088251,0.00034050978,0.0054652854,0.0029221433,0.000029853509,0.0004725188,0.0000023862858,0.8307653,0.00009332398,0.15250033,0.0048677367,0.001658127],"about_ca_topic_score_codex":0.0000061985224,"about_ca_topic_score_gemma":0.000034243076,"teacher_disagreement_score":0.99641776,"about_ca_system_score_codex":0.00015631778,"about_ca_system_score_gemma":0.00049051305,"threshold_uncertainty_score":0.9997173},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007129959,0.00024011095,0.99756044,0.00034209352,0.0004873743,0.00020576286,0.0000019604015,0.00018211929,0.0002671641],"genre_scores_gemma":[0.5715812,0.0002593086,0.42308813,0.0010992874,0.0010667767,0.0000125060915,0.000093847884,0.00011141408,0.002687579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962101,0.000043566266,0.00050061377,0.0016666988,0.000997178,0.0005818269],"domain_scores_gemma":[0.99801743,0.00026871226,0.00038238,0.0009739296,0.00019284619,0.00016472655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010446702,0.0004562312,0.0006223891,0.0017770284,0.00033631272,0.0009774776,0.0012119848,0.00021473518,0.00001582633],"category_scores_gemma":[0.000021186808,0.0003768929,0.00014627664,0.0024538108,0.0003376932,0.0004643488,0.0010652363,0.0004929206,0.000012777554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000108477725,0.00002493471,0.0020379133,0.000033650886,0.00043902994,0.00013487261,0.0009875445,0.5287652,0.00005030215,0.004897579,0.00003262319,0.4625855],"study_design_scores_gemma":[0.00021267672,0.00011762669,0.0012247028,0.00017960077,0.00017300593,0.000012347302,8.737759e-7,0.9949448,0.00014995053,0.0024526508,0.000053693293,0.00047806665],"about_ca_topic_score_codex":0.000058905192,"about_ca_topic_score_gemma":0.00014926404,"teacher_disagreement_score":0.5744723,"about_ca_system_score_codex":0.00013434075,"about_ca_system_score_gemma":0.0001490634,"threshold_uncertainty_score":0.9998683},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023837807,0.00017508405,0.9883478,0.0010057125,0.0026867508,0.0005876625,0.000008227507,0.00012056856,0.0046844045],"genre_scores_gemma":[0.86918426,0.0007585007,0.108168855,0.0010185424,0.0026649283,0.0000619396,0.000009140208,0.00033414405,0.017799707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979157,0.00002640787,0.00042609882,0.00049519155,0.00072054676,0.00041608905],"domain_scores_gemma":[0.99636084,0.002201891,0.0003354377,0.0009541226,0.000103317434,0.00004441863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006744472,0.00027546939,0.00033721796,0.00025508553,0.00037006912,0.00008001977,0.0014557189,0.00014240059,0.000010097279],"category_scores_gemma":[0.00042801097,0.00015533743,0.00013667671,0.00079828023,0.0007256165,0.00007586693,0.00087922683,0.0005649226,0.000009444554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010551518,0.00003654286,0.00015772277,0.0002648282,0.00005720561,0.000020278627,0.0013350444,0.004867054,0.0006844362,0.7575049,0.00012896484,0.23493251],"study_design_scores_gemma":[0.000105074825,0.00004458536,0.0002541554,0.00039542452,0.000011537568,0.000011216951,0.0000012403776,0.008898433,0.00025683237,0.98950243,0.000324195,0.00019489772],"about_ca_topic_score_codex":0.0000044517715,"about_ca_topic_score_gemma":0.00016245682,"teacher_disagreement_score":0.8801789,"about_ca_system_score_codex":0.00013594014,"about_ca_system_score_gemma":0.000119437645,"threshold_uncertainty_score":0.63344765},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06307858,0.00008288579,0.9320734,0.00055773795,0.0023698986,0.00094675424,0.0000026364385,0.00015407492,0.00073401973],"genre_scores_gemma":[0.74338454,0.000008116356,0.2550356,0.0008178456,0.0003280819,0.000030083193,0.0000011483615,0.000046638106,0.00034797358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965549,0.000061286315,0.0005972514,0.0014715382,0.0008526922,0.0004623376],"domain_scores_gemma":[0.99698186,0.0006221016,0.0004128928,0.0013836921,0.00042297906,0.0001764889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077244616,0.00040589078,0.00044374564,0.0010838246,0.0002603648,0.00042522923,0.0029225475,0.00009296986,0.000007996374],"category_scores_gemma":[0.0001711366,0.00041675518,0.00004020921,0.0012247493,0.00015561444,0.00095945015,0.0022064256,0.0006354849,0.0000182369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022881355,0.0006487107,0.0007867388,0.00019136054,0.000052282972,0.000026318945,0.043502018,0.09832106,0.007913899,0.0014855487,0.00003176847,0.8470174],"study_design_scores_gemma":[0.00059008336,0.0048128837,0.0062057804,0.0045571346,0.00007988725,0.00014764619,0.00012539368,0.93064165,0.0058271824,0.044056747,0.00041330841,0.0025422918],"about_ca_topic_score_codex":0.0010858397,"about_ca_topic_score_gemma":0.0018339605,"teacher_disagreement_score":0.84447515,"about_ca_system_score_codex":0.00028086256,"about_ca_system_score_gemma":0.00059928774,"threshold_uncertainty_score":0.99982846},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029579896,0.002352678,0.99280447,0.000029194418,0.0033654205,0.00021639462,0.0000075676617,0.00027722956,0.00065124314],"genre_scores_gemma":[0.8925604,0.0029552882,0.08839027,0.0005870017,0.00422166,0.000087015695,0.000061822,0.0005434538,0.010593064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848896,0.000011824198,0.0002555358,0.0005274576,0.0003284621,0.0003877314],"domain_scores_gemma":[0.9992249,0.00017885183,0.000035417554,0.00042273477,0.00004341167,0.00009466306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003398354,0.00027506836,0.00031521844,0.000495859,0.0000709667,0.0002564167,0.0005584302,0.00016156842,0.0000047775907],"category_scores_gemma":[0.00003066848,0.0002455906,0.00003469181,0.00050072913,0.00029662214,0.00008405069,0.00019954132,0.0003557759,0.0000709181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.800353e-7,0.00000350036,0.000022567974,0.0002895205,0.0000123794325,0.00007698792,0.00020890658,0.7487344,0.0002836368,0.00025367294,0.00038296584,0.24973075],"study_design_scores_gemma":[0.000044712702,0.000031890097,0.000041774096,0.00040234876,0.0000058162964,0.000047612662,1.2897452e-7,0.9915967,0.001123944,0.0050061033,0.0013358541,0.000363105],"about_ca_topic_score_codex":0.00001900661,"about_ca_topic_score_gemma":0.000015437567,"teacher_disagreement_score":0.9044142,"about_ca_system_score_codex":0.00016421545,"about_ca_system_score_gemma":0.000108270266,"threshold_uncertainty_score":0.99999964},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029579896,0.002352678,0.99280447,0.000029194418,0.0033654205,0.00021639462,0.0000075676617,0.00027722956,0.00065124314],"genre_scores_gemma":[0.8925604,0.0029552882,0.08839027,0.0005870017,0.00422166,0.000087015695,0.000061822,0.0005434538,0.010593064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848896,0.000011824198,0.0002555358,0.0005274576,0.0003284621,0.0003877314],"domain_scores_gemma":[0.9992249,0.00017885183,0.000035417554,0.00042273477,0.00004341167,0.00009466306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003398354,0.00027506836,0.00031521844,0.000495859,0.0000709667,0.0002564167,0.0005584302,0.00016156842,0.0000047775907],"category_scores_gemma":[0.00003066848,0.0002455906,0.00003469181,0.00050072913,0.00029662214,0.00008405069,0.00019954132,0.0003557759,0.0000709181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.800353e-7,0.00000350036,0.000022567974,0.0002895205,0.0000123794325,0.00007698792,0.00020890658,0.7487344,0.0002836368,0.00025367294,0.00038296584,0.24973075],"study_design_scores_gemma":[0.000044712702,0.000031890097,0.000041774096,0.00040234876,0.0000058162964,0.000047612662,1.2897452e-7,0.9915967,0.001123944,0.0050061033,0.0013358541,0.000363105],"about_ca_topic_score_codex":0.00001900661,"about_ca_topic_score_gemma":0.000015437567,"teacher_disagreement_score":0.9044142,"about_ca_system_score_codex":0.00016421545,"about_ca_system_score_gemma":0.000108270266,"threshold_uncertainty_score":0.99999964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000527274,0.00011869266,0.99614507,0.00036043394,0.001482179,0.0002719433,0.000020348925,0.00022264544,0.0008513862],"genre_scores_gemma":[0.73350877,0.0001578688,0.26071218,0.00034937882,0.0044380706,0.000038862992,0.000035095065,0.0003018524,0.00045790855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986654,0.0000042315505,0.00025580294,0.00037282906,0.00039214847,0.00030956964],"domain_scores_gemma":[0.9987999,0.00018471404,0.0000777609,0.00083816395,0.000049599763,0.00004985184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017490081,0.00028560244,0.00027231156,0.00018864484,0.00012538352,0.00010004605,0.0011762836,0.00015595916,0.000012703006],"category_scores_gemma":[0.000006321878,0.00019795998,0.000053942724,0.00017539301,0.00027676346,0.00007239884,0.00034606626,0.00043032123,0.000011097617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017797188,0.000002310885,0.000012561871,0.00006062854,0.00001440292,0.0000069121006,0.00021001784,0.9597235,0.00010230313,0.0019657908,0.00001839734,0.03788144],"study_design_scores_gemma":[0.0004925874,0.0001243176,0.0009823482,0.0010809217,0.00008118636,0.000081325445,0.0000049920413,0.8247479,0.019843487,0.14935115,0.0018765981,0.001333167],"about_ca_topic_score_codex":0.0000064647024,"about_ca_topic_score_gemma":0.000058292822,"teacher_disagreement_score":0.7354329,"about_ca_system_score_codex":0.00006945531,"about_ca_system_score_gemma":0.00005509855,"threshold_uncertainty_score":0.80725735},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1157622,0.00056738104,0.8755817,0.0012246061,0.002124331,0.0012144584,0.000029183966,0.00029218494,0.003203994],"genre_scores_gemma":[0.9900833,0.00022021862,0.003953408,0.005389647,0.00021823816,0.000005631342,0.0000024404128,0.00003127978,0.00009586583],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974983,0.00007791789,0.00032393026,0.0010247891,0.0006605198,0.00041456238],"domain_scores_gemma":[0.9982137,0.0012867403,0.0001524292,0.00022111494,0.00003519518,0.000090785536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007713899,0.00034490286,0.0003482624,0.00049571245,0.0003895026,0.0006557447,0.00063459884,0.00023092938,0.000031677344],"category_scores_gemma":[0.0002187031,0.00025211513,0.000038486618,0.00039051403,0.0005924997,0.00027741786,0.00035543027,0.00084269996,0.0000069616462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000509529,0.000029785933,0.0002577819,0.00023537963,0.000004085814,0.0002898113,0.008716692,0.0006813439,0.161817,0.021339694,0.000012785829,0.8065647],"study_design_scores_gemma":[0.0017140853,0.001387946,0.012365769,0.0028196217,0.000042418746,0.0008486357,0.000044198438,0.3343886,0.024338858,0.6188745,0.00069344055,0.002481906],"about_ca_topic_score_codex":0.000011737724,"about_ca_topic_score_gemma":0.000044529137,"teacher_disagreement_score":0.8743211,"about_ca_system_score_codex":0.00007454105,"about_ca_system_score_gemma":0.00017022737,"threshold_uncertainty_score":0.9999931},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035363499,0.000033447963,0.9953851,0.000015265125,0.00026075006,0.00034158118,0.0002266763,0.000039543855,0.00016127482],"genre_scores_gemma":[0.38571778,0.0000017814037,0.61403686,0.00008104467,0.00007649503,0.000005993807,0.000014163349,0.000024317318,0.00004153243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977298,0.000029870787,0.00060224824,0.0007339292,0.0005372177,0.0003669611],"domain_scores_gemma":[0.9956229,0.0031963433,0.00038232005,0.0004886989,0.00020803377,0.000101747755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007942514,0.0002874128,0.0008025354,0.0016695258,0.00012543205,0.00007529734,0.00057907,0.00017473854,0.000071144284],"category_scores_gemma":[0.0008865204,0.00023587824,0.00025158457,0.0019423987,0.00030252256,0.000050768653,0.00030103876,0.00027527133,0.0000049744194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014022081,0.0011305944,0.0046983785,0.003410911,0.0019116648,0.0004904705,0.0007512719,0.4649076,0.002871441,0.4044048,0.00015924018,0.11512341],"study_design_scores_gemma":[0.00015027341,0.000117985095,0.000864489,0.00009950267,0.0005675059,0.0000037987816,1.721598e-7,0.8606784,0.0003146464,0.13692023,0.000015999081,0.00026701868],"about_ca_topic_score_codex":0.000015203067,"about_ca_topic_score_gemma":0.000044469027,"teacher_disagreement_score":0.3957708,"about_ca_system_score_codex":0.000116908916,"about_ca_system_score_gemma":0.0001396888,"threshold_uncertainty_score":0.96188354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038610426,0.0020057634,0.9858959,0.0002891189,0.0009829039,0.00031144594,0.00002892492,0.00010496461,0.010342413],"genre_scores_gemma":[0.6440862,0.001441662,0.33387408,0.002402598,0.0040009962,0.0002704592,0.00013847966,0.0004314666,0.013354103],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974016,0.000003296879,0.0006634051,0.0012448786,0.00015684855,0.0005299462],"domain_scores_gemma":[0.9984217,0.0003439326,0.00048737112,0.0005058967,0.00012565231,0.000115390365],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006988837,0.00036579696,0.0006018782,0.0015309575,0.00033561012,0.00019598642,0.0009132376,0.0003074325,0.00009419435],"category_scores_gemma":[0.00034473714,0.0004128904,0.00012703567,0.0015454338,0.00034523022,0.00017236434,0.00043908905,0.0007218238,0.0009980121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007305822,0.000025540287,0.00023074733,0.000051940813,0.000023255314,0.000023091707,0.0003646762,0.01587452,0.000008061687,0.4010965,0.000013255823,0.5822811],"study_design_scores_gemma":[0.00016773405,0.00008568469,0.0012145484,0.00006912486,0.000005124425,0.000011708782,2.4065426e-7,0.15933411,0.000033920787,0.8343547,0.00417056,0.00055252947],"about_ca_topic_score_codex":0.000051026094,"about_ca_topic_score_gemma":0.00006486053,"teacher_disagreement_score":0.65202177,"about_ca_system_score_codex":0.00027152096,"about_ca_system_score_gemma":0.0000988797,"threshold_uncertainty_score":0.9998323},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026280037,0.00018558436,0.99300575,0.00038342774,0.00096226466,0.00035755755,0.000013694257,0.00019431603,0.0022693984],"genre_scores_gemma":[0.3845643,0.0008532516,0.5788155,0.002808874,0.002585023,0.000058631427,0.000056819048,0.00040255528,0.029855046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981303,0.000014921043,0.00029642842,0.0006632689,0.000512935,0.00038211094],"domain_scores_gemma":[0.99837774,0.0008121086,0.00013562228,0.00049050077,0.000084573716,0.000099475656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004318334,0.0003130743,0.00038137124,0.000399163,0.00013232458,0.00017968193,0.0005843847,0.00015752473,0.00009640136],"category_scores_gemma":[0.00010437678,0.0002664014,0.000059243717,0.00024431708,0.00035516985,0.00007950414,0.00058922474,0.00039724822,0.00005821239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025214842,0.00008629306,0.0003719213,0.00059990294,0.00007859524,0.0002996557,0.0024354493,0.0035488359,0.000228691,0.6031284,0.0007528664,0.38844422],"study_design_scores_gemma":[0.00014113841,0.00010535534,0.00011368407,0.0002256974,0.00001320141,0.000024693283,5.281456e-7,0.021737378,0.00022125446,0.9760361,0.0010676553,0.00031334528],"about_ca_topic_score_codex":0.000011955214,"about_ca_topic_score_gemma":0.00010563985,"teacher_disagreement_score":0.41419026,"about_ca_system_score_codex":0.00006916198,"about_ca_system_score_gemma":0.00007947322,"threshold_uncertainty_score":0.99997884},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018150754,0.00026819648,0.97960824,0.00002616258,0.0013261054,0.00022343821,0.0000023325897,0.00018247747,0.00021228078],"genre_scores_gemma":[0.9939816,0.00020622698,0.0055556274,0.0000420591,0.00014427409,0.0000031128823,0.000001936763,0.00003738201,0.000027797947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901354,0.00000833327,0.00020913233,0.00034923287,0.00023522107,0.0001845546],"domain_scores_gemma":[0.9996965,0.000079508296,0.0000361381,0.00010445613,0.000022855356,0.000060551833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020655646,0.00020217935,0.00018295464,0.00040326032,0.00014705054,0.000120872624,0.00008077138,0.00016894373,0.0000025569766],"category_scores_gemma":[0.0000074189775,0.00019906099,0.000028179886,0.00019056675,0.00015459243,0.00020798857,0.00003293185,0.00023558924,0.0000032266826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044428693,0.0000010464504,0.000027427108,0.000104252824,0.000007658398,0.0000053557287,0.00074944797,0.08730226,0.009418619,0.000014496371,3.3271425e-7,0.9023647],"study_design_scores_gemma":[0.0001508118,0.00006314388,0.0005802481,0.00021125935,0.000008355456,0.00005771322,0.0000017337619,0.99482405,0.0025315443,0.0012431964,0.000095991076,0.00023193302],"about_ca_topic_score_codex":0.00004415196,"about_ca_topic_score_gemma":0.00038221048,"teacher_disagreement_score":0.97583085,"about_ca_system_score_codex":0.0001309867,"about_ca_system_score_gemma":0.000015487893,"threshold_uncertainty_score":0.81174713},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033127633,0.000090658425,0.99367416,0.004150393,0.00047989705,0.0002760777,0.000009261764,0.00030327137,0.0006849937],"genre_scores_gemma":[0.064251505,0.00025799352,0.930716,0.0025521782,0.00062200526,0.000032920336,0.00013222401,0.00010066422,0.0013345301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622726,0.000059455226,0.00038071806,0.0014338065,0.0014362563,0.00046252884],"domain_scores_gemma":[0.99782014,0.000540893,0.00020500134,0.000989838,0.00018830504,0.00025581167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011478413,0.00039960828,0.00036268125,0.00053841004,0.0002800104,0.0007091864,0.0019089546,0.00025858972,0.000029649498],"category_scores_gemma":[0.00020083829,0.00032246267,0.000041352938,0.00062042044,0.0007744175,0.0007744443,0.00093466963,0.0008093873,0.00007434359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016208498,0.00003751349,0.0007636109,0.00012307292,0.000018317542,0.00028171606,0.0011845382,0.008696948,0.0004305475,0.01303305,0.00007624573,0.9753382],"study_design_scores_gemma":[0.00056889333,0.0002214666,0.0019117846,0.0005029179,0.000012832115,0.00016681277,8.316481e-7,0.9831129,0.00027266025,0.012138132,0.00044896672,0.00064184703],"about_ca_topic_score_codex":0.00005284895,"about_ca_topic_score_gemma":0.00016161462,"teacher_disagreement_score":0.9746964,"about_ca_system_score_codex":0.00010646267,"about_ca_system_score_gemma":0.0005140569,"threshold_uncertainty_score":0.99992275},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021748435,0.004075181,0.98632467,0.0055655865,0.0020210147,0.00033202145,0.000035809484,0.00044472882,0.0009835325],"genre_scores_gemma":[0.054506496,0.006451306,0.92084295,0.010457961,0.004625983,0.0001535856,0.00029053667,0.0003458042,0.0023253786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575907,0.00005449849,0.00048822945,0.0020246482,0.0010430188,0.000630548],"domain_scores_gemma":[0.99776584,0.00050902914,0.00027223522,0.0007458945,0.00042455297,0.00028245992],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006521891,0.0005664456,0.00047910603,0.0009885927,0.00024519605,0.0028998163,0.002330077,0.00019360456,0.0000059141985],"category_scores_gemma":[0.00014166943,0.00052784214,0.00007919858,0.0007502841,0.0010661152,0.0023806943,0.0033261217,0.00055113307,0.000057584683],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034598118,0.000059923816,0.00006763471,0.00016043511,0.000014131319,0.0001598541,0.00053171266,0.00014062627,0.000005360925,0.000053128075,0.00072784023,0.9980759],"study_design_scores_gemma":[0.00088251,0.00034050978,0.0054652854,0.0029221433,0.000029853509,0.0004725188,0.0000023862858,0.8307653,0.00009332398,0.15250033,0.0048677367,0.001658127],"about_ca_topic_score_codex":0.0000061985224,"about_ca_topic_score_gemma":0.000034243076,"teacher_disagreement_score":0.99641776,"about_ca_system_score_codex":0.00015631778,"about_ca_system_score_gemma":0.00049051305,"threshold_uncertainty_score":0.9997173},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005058267,0.0007930815,0.99146396,0.000092350565,0.004238079,0.0012301899,0.000005884918,0.00040801492,0.0017178522],"genre_scores_gemma":[0.2752691,0.0057602883,0.6725679,0.013379244,0.0059795333,0.0025270386,0.00030908748,0.00038205003,0.023825753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963891,0.00007184274,0.0006648425,0.0010419659,0.0011316484,0.00070061267],"domain_scores_gemma":[0.9975102,0.00039277578,0.00033327957,0.0014004098,0.00017552785,0.00018780165],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013807154,0.00044856145,0.00044224656,0.0012584598,0.00021111552,0.0015115949,0.0028505137,0.00021948315,0.0000035558633],"category_scores_gemma":[0.00005229963,0.0004153849,0.00007217975,0.0016668758,0.00033861937,0.0012154503,0.002733627,0.00054500636,0.00023536562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019537028,0.000010641584,0.000015031487,0.00018313833,0.0000111259105,0.000036921596,0.00070763426,0.36235696,0.0000031166792,0.004191009,0.00201802,0.63046443],"study_design_scores_gemma":[0.00015380628,0.00018682267,0.000017258111,0.00038765097,0.000006347838,0.00002008158,7.727246e-7,0.9408664,0.000042259748,0.006112322,0.051767595,0.00043867226],"about_ca_topic_score_codex":0.000024561234,"about_ca_topic_score_gemma":0.000025947364,"teacher_disagreement_score":0.6300258,"about_ca_system_score_codex":0.0008120706,"about_ca_system_score_gemma":0.0008632061,"threshold_uncertainty_score":0.99982977},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006972291,0.0004292669,0.990819,0.00055498263,0.0011894519,0.0008555206,0.00009351879,0.005947781,0.00004075463],"genre_scores_gemma":[0.1752596,0.000029477389,0.8233934,0.00031062288,0.000680378,0.00007114879,0.000021237227,0.00008171045,0.00015241039],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99565744,0.000050754083,0.0007304127,0.0018884474,0.00088542956,0.0007875223],"domain_scores_gemma":[0.97979456,0.017967343,0.00020513855,0.0013813743,0.00040415596,0.0002474497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022149773,0.0005604803,0.00075646123,0.0005902547,0.00052884745,0.00073833903,0.0020569914,0.00038815907,0.0000011163739],"category_scores_gemma":[0.007974178,0.00052525953,0.0001270673,0.0004927418,0.0010076729,0.00047384694,0.0011604519,0.00056415773,0.000008166692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015258132,0.00008270671,0.027037598,0.0010658881,0.00002222808,0.00030816562,0.00058467954,0.0010236269,0.000013242768,0.013321531,0.0005444014,0.95598066],"study_design_scores_gemma":[0.00039773967,0.0009179166,0.003435804,0.0022302486,0.000046627083,0.00023714297,1.4863535e-7,0.16417377,0.00012319951,0.8263777,0.0007484513,0.0013112595],"about_ca_topic_score_codex":0.000070494425,"about_ca_topic_score_gemma":0.000014506078,"teacher_disagreement_score":0.9546694,"about_ca_system_score_codex":0.00025239986,"about_ca_system_score_gemma":0.0003347662,"threshold_uncertainty_score":0.9997199},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012805585,0.00034567184,0.9930706,0.0011013048,0.002962567,0.0008140034,0.0003809213,0.0005242269,0.0006726205],"genre_scores_gemma":[0.07058792,0.00010525074,0.9243895,0.002495777,0.0017176935,0.000045189296,0.00030542017,0.00012703799,0.0002262115],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951173,0.00003431196,0.0006006767,0.0022712986,0.001070818,0.0009055744],"domain_scores_gemma":[0.99571,0.0011418471,0.0003169683,0.0023059095,0.00025230527,0.00027298316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085902144,0.0006746638,0.0007429338,0.0010810336,0.00040154307,0.00092727493,0.0051634414,0.00042627755,0.000023889908],"category_scores_gemma":[0.00012085155,0.0006266772,0.00035040878,0.0011519963,0.00064972485,0.0008999684,0.0013954228,0.000788937,0.00007821964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024889257,0.00008068725,0.000112120375,0.00007761717,0.0000590807,0.00007419712,0.0013591738,0.0073454375,0.00010476166,0.18414982,0.001093538,0.8055187],"study_design_scores_gemma":[0.00037471816,0.00016338892,0.00048437243,0.00025821815,0.000015364874,0.000009722919,2.0349326e-7,0.34256113,0.00065506186,0.6484804,0.006225407,0.0007719806],"about_ca_topic_score_codex":0.00021315833,"about_ca_topic_score_gemma":0.00054223055,"teacher_disagreement_score":0.8047467,"about_ca_system_score_codex":0.00017024636,"about_ca_system_score_gemma":0.00035435017,"threshold_uncertainty_score":0.9996185},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034244065,0.0008032958,0.99145526,0.0012353837,0.0027067792,0.000607117,0.00004454756,0.0004514901,0.002353712],"genre_scores_gemma":[0.47945336,0.000536729,0.51048654,0.0061352295,0.0025847678,0.00009091738,0.00012230917,0.00024539916,0.00034475647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99392414,0.000049051927,0.0007638473,0.0025498117,0.001573166,0.0011399655],"domain_scores_gemma":[0.99530447,0.0007540148,0.00029358547,0.0032008917,0.00018025153,0.00026679],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018613884,0.00077781675,0.00076555274,0.002655616,0.00025919196,0.0008794705,0.008865793,0.00079421606,0.000022134844],"category_scores_gemma":[0.00020776362,0.0007343952,0.00026770766,0.0028586416,0.0007668393,0.0011509196,0.004907445,0.0024545828,0.00007872739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006591269,0.00020256954,0.0006034051,0.0001921826,0.000039381168,0.0015559362,0.00352479,0.021771308,0.00013922695,0.62965643,0.00074819376,0.34150064],"study_design_scores_gemma":[0.0009805481,0.00017734285,0.00049281126,0.000636595,0.0000074700374,0.000047436737,4.592483e-7,0.14834292,0.00022841431,0.8469003,0.0011530631,0.0010326656],"about_ca_topic_score_codex":0.00005240529,"about_ca_topic_score_gemma":0.0018525627,"teacher_disagreement_score":0.48096868,"about_ca_system_score_codex":0.0002051326,"about_ca_system_score_gemma":0.0004878898,"threshold_uncertainty_score":0.9998468},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005493732,0.0007748341,0.993184,0.0007681008,0.0024274893,0.00043713668,0.00018894751,0.0005122904,0.0011578649],"genre_scores_gemma":[0.4466505,0.0005908493,0.54259145,0.0058815912,0.0027330243,0.000057464644,0.00044725498,0.00021780854,0.00083003554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946959,0.00006296995,0.00061809097,0.0023782565,0.0014452981,0.0007994653],"domain_scores_gemma":[0.99556565,0.0009729242,0.00033031803,0.002530889,0.0002686673,0.0003315254],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007353204,0.0006721808,0.00064379926,0.0012824538,0.00043028037,0.0009797503,0.0055827443,0.00053089263,0.000061216946],"category_scores_gemma":[0.00018261702,0.00063273526,0.00026060443,0.0016111368,0.0008268198,0.0009414909,0.0020644045,0.0013011503,0.00019116052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013198351,0.000080156555,0.00025496713,0.00006164331,0.000060063976,0.00027962174,0.0044482886,0.0015837392,0.00022102216,0.56963,0.00031759648,0.4230497],"study_design_scores_gemma":[0.00032395526,0.00012253382,0.0025268968,0.0006219872,0.000023549524,0.000022571052,6.0294826e-7,0.22352827,0.00019071087,0.76759106,0.0040203114,0.0010275417],"about_ca_topic_score_codex":0.00013640532,"about_ca_topic_score_gemma":0.00051527616,"teacher_disagreement_score":0.4505925,"about_ca_system_score_codex":0.00016550951,"about_ca_system_score_gemma":0.0008736169,"threshold_uncertainty_score":0.9997975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025168783,0.00032580385,0.99532855,0.00071948546,0.0014999465,0.00077734195,0.00008213087,0.0006043509,0.00041069355],"genre_scores_gemma":[0.27407992,0.000012614446,0.72303116,0.0020646793,0.0005156109,0.000024056151,0.000077822406,0.00010343197,0.000090727866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938868,0.000080616875,0.00063938135,0.0024698542,0.0019117252,0.0010116055],"domain_scores_gemma":[0.9943143,0.0013693613,0.0004185878,0.0031510412,0.0004317512,0.00031493913],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001206565,0.0008779466,0.00068717427,0.0014962621,0.00053102075,0.001052153,0.0051654717,0.00049194205,0.000019235631],"category_scores_gemma":[0.00015516237,0.0007343768,0.00024101026,0.002212641,0.001034831,0.0006695922,0.0013221789,0.001476622,0.00005726858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003318638,0.00011746321,0.000051048275,0.000067774105,0.000023377854,0.00019253661,0.0006529075,0.89250696,0.000034576362,0.036155622,0.00002795995,0.070136584],"study_design_scores_gemma":[0.001446727,0.0002744937,0.0003402725,0.00043063,0.000025624331,0.000020310968,3.0463215e-7,0.94688535,0.00027182407,0.048612386,0.0007231431,0.0009689524],"about_ca_topic_score_codex":0.000039593702,"about_ca_topic_score_gemma":0.00044847454,"teacher_disagreement_score":0.2738282,"about_ca_system_score_codex":0.00022963448,"about_ca_system_score_gemma":0.0006813293,"threshold_uncertainty_score":0.99998486},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034450743,0.0008021595,0.987685,0.0006058181,0.0027258643,0.00042003766,0.00004446189,0.00064800814,0.0070341765],"genre_scores_gemma":[0.19233847,0.00033684165,0.8002082,0.0044887313,0.0017843331,0.00004359164,0.000058183967,0.00015637954,0.00058526354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947633,0.000028985924,0.0005317155,0.0022600999,0.0014688587,0.0009470191],"domain_scores_gemma":[0.9963687,0.00054627,0.0002759894,0.002272422,0.00027735755,0.0002592615],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009738028,0.0007065267,0.00061312644,0.0015275918,0.000410694,0.00083457323,0.0060431655,0.0005795799,0.000021685639],"category_scores_gemma":[0.00008692598,0.0006450113,0.0002663411,0.0017117917,0.0010674755,0.0010273195,0.0030162784,0.0016936179,0.00017483927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011546607,0.00003067058,0.000025382184,0.000027286087,0.000021514437,0.00026475696,0.0005226985,0.00874848,0.000061406725,0.74486536,0.00023890325,0.24518198],"study_design_scores_gemma":[0.00022919882,0.00023592575,0.00016024137,0.00034466764,0.000009842687,0.0000311225,2.947829e-7,0.21291381,0.00044914457,0.7822505,0.002467469,0.0009077278],"about_ca_topic_score_codex":0.000030060273,"about_ca_topic_score_gemma":0.00023854448,"teacher_disagreement_score":0.24427424,"about_ca_system_score_codex":0.0001508265,"about_ca_system_score_gemma":0.00053872226,"threshold_uncertainty_score":0.9996001},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009938377,0.00018539792,0.981526,0.00034376778,0.0015027918,0.0006918674,0.000015304662,0.00067707314,0.0051193964],"genre_scores_gemma":[0.84828395,0.00033946813,0.13852605,0.0032644572,0.0008657546,0.000035498015,0.000056259745,0.00030318275,0.008325378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967985,0.000028648266,0.00039665957,0.001230656,0.0009811944,0.000564314],"domain_scores_gemma":[0.9987703,0.00016069644,0.00026921273,0.00064933154,0.000036175155,0.00011430264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006714387,0.00043826774,0.00041080924,0.00019875377,0.00039870365,0.00023214755,0.0011461551,0.00027455486,0.0003845068],"category_scores_gemma":[0.000049595,0.00041226318,0.000105308674,0.0006847013,0.00086721237,0.00032597172,0.0021341054,0.0006356088,0.0005959463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011571942,0.00003479195,0.0008216434,0.0001233899,0.000026828237,0.00017433077,0.0009781083,0.46950066,0.0024109678,0.00024888152,0.0005629232,0.5251059],"study_design_scores_gemma":[0.00018209222,0.00006284172,0.006527644,0.00048519368,0.00003419243,0.000072653,0.0000019603717,0.9760038,0.0017940289,0.010605,0.0033315679,0.0008990245],"about_ca_topic_score_codex":0.0011888953,"about_ca_topic_score_gemma":0.0030672606,"teacher_disagreement_score":0.843,"about_ca_system_score_codex":0.00089225324,"about_ca_system_score_gemma":0.00006706269,"threshold_uncertainty_score":0.9998329},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003359303,0.00002749288,0.9931124,0.00045279722,0.0006238899,0.00060799497,0.00044379395,0.00013891788,0.004256769],"genre_scores_gemma":[0.49801412,0.00008161083,0.48280117,0.0038910368,0.0025543377,0.00008013649,0.002391902,0.00041866308,0.009767032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973382,0.000016907126,0.00033502394,0.0012037997,0.00055052264,0.000555559],"domain_scores_gemma":[0.9984538,0.00027546083,0.00016364863,0.00093966554,0.000026415972,0.00014101442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005674575,0.00034128444,0.0003055263,0.00022826249,0.00039133593,0.00016524766,0.0007931578,0.00025060933,0.0000614117],"category_scores_gemma":[0.00006460131,0.00032267626,0.00010798,0.0004931722,0.0005658149,0.00017525374,0.0004927433,0.00036346714,0.00041575124],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014352682,0.00005747451,0.000017601827,0.000021241623,0.0000067091823,0.000010162256,0.00040201336,0.0123421,0.005581675,0.000054359723,0.00069979345,0.9807925],"study_design_scores_gemma":[0.0010212954,0.0006933138,0.0012860096,0.00029257458,0.00007950718,0.00011008008,0.0000030208162,0.5717036,0.023420978,0.068537235,0.3311112,0.0017412031],"about_ca_topic_score_codex":0.000107122956,"about_ca_topic_score_gemma":0.004108456,"teacher_disagreement_score":0.9790513,"about_ca_system_score_codex":0.0003731073,"about_ca_system_score_gemma":0.000047958743,"threshold_uncertainty_score":0.9999225},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050032237,0.0018905762,0.6985783,0.028933747,0.017751137,0.0020335175,0.00024362747,0.0009363926,0.24462947],"genre_scores_gemma":[0.93852127,0.003681219,0.029645499,0.007363598,0.004072977,0.000007217345,0.000029811426,0.00016675908,0.016511653],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665946,0.00005451505,0.00041916134,0.0006286201,0.001627757,0.000610473],"domain_scores_gemma":[0.9962647,0.0017592091,0.00033651548,0.00042652688,0.0010007732,0.0002122681],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0031813656,0.00025542922,0.00046407813,0.00135885,0.0005130036,0.00028515552,0.0015400468,0.000709797,0.00006209489],"category_scores_gemma":[0.0032363068,0.00025064958,0.00015753988,0.0019314926,0.0030979305,0.0003210481,0.0004319133,0.0008819568,0.00004353501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012374369,0.000047864352,0.00068226113,0.00010185497,0.000041773746,0.00006132273,0.02371032,0.0012591993,0.0002949908,0.20094725,0.00025512808,0.7725857],"study_design_scores_gemma":[0.0003161464,0.00035031102,0.0013064635,0.0006759274,0.000031786676,0.000003901615,0.000016532733,0.0013936212,0.00022796409,0.97747093,0.017250774,0.0009556502],"about_ca_topic_score_codex":0.0022248088,"about_ca_topic_score_gemma":0.004764464,"teacher_disagreement_score":0.93351805,"about_ca_system_score_codex":0.0003282162,"about_ca_system_score_gemma":0.0024051426,"threshold_uncertainty_score":0.9999946},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013121447,0.000021101174,0.9900837,0.00096398836,0.003086334,0.0005601815,0.000006301393,0.00013974494,0.0038264836],"genre_scores_gemma":[0.24718937,0.00012999761,0.74871707,0.0022652708,0.0009799494,0.0001267723,0.000044416538,0.00008021007,0.00046696156],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963268,0.000071226874,0.0005546319,0.0015862794,0.0008853144,0.00057573826],"domain_scores_gemma":[0.99799955,0.00057983294,0.00021673548,0.00095340196,0.00012364084,0.00012686166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018617559,0.00036745507,0.0004188741,0.0010186153,0.00021977782,0.0007567042,0.0041372124,0.00019132116,0.000029233057],"category_scores_gemma":[0.00015156849,0.00038298327,0.00007673744,0.0007342562,0.00020303064,0.0019029195,0.0029582542,0.0007991432,0.00017081897],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008139573,0.000025571437,0.00027396512,0.000033442542,0.000010114781,0.00022286052,0.00287805,0.032081198,0.000041863248,0.018929303,0.000016077654,0.9454794],"study_design_scores_gemma":[0.0005242528,0.000058731304,0.0011636032,0.00063198886,0.0000028499717,0.000020179306,7.2339395e-7,0.38368845,0.00021681354,0.6127528,0.00032956447,0.0006100498],"about_ca_topic_score_codex":0.00013031102,"about_ca_topic_score_gemma":0.00028159065,"teacher_disagreement_score":0.94486934,"about_ca_system_score_codex":0.00047583197,"about_ca_system_score_gemma":0.00052373257,"threshold_uncertainty_score":0.9998622},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008686649,0.00006775747,0.99636984,0.00059584045,0.00086223584,0.00019820555,0.00005145594,0.00017433742,0.0008116724],"genre_scores_gemma":[0.124260075,0.000054957723,0.8736715,0.00066938024,0.00055041345,0.00002883804,0.00004014103,0.00007303423,0.00065167696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967652,0.00001759349,0.00056136533,0.0012745719,0.00084406725,0.0005371796],"domain_scores_gemma":[0.9974356,0.0005899619,0.00016376867,0.0014664144,0.00017602369,0.00016821214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005311558,0.0003631718,0.00046793057,0.0006355455,0.00014759167,0.00027101667,0.0034139329,0.000221874,0.000015423102],"category_scores_gemma":[0.00010426391,0.00034040105,0.00011939856,0.00072744285,0.000493668,0.00037649416,0.0018860738,0.00043738476,0.00006101578],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003062302,0.00004076515,0.00023671363,0.00006459607,0.000014933659,0.00009898025,0.0009512599,0.0015810821,0.00016935961,0.0203251,0.00010583749,0.9764083],"study_design_scores_gemma":[0.00032669218,0.0002622642,0.0015971799,0.0009674883,0.000017417082,0.0000623101,0.0000011050573,0.9644718,0.0023160207,0.027950812,0.0011953359,0.00083157985],"about_ca_topic_score_codex":0.000025706076,"about_ca_topic_score_gemma":0.000035808283,"teacher_disagreement_score":0.97557676,"about_ca_system_score_codex":0.00008560818,"about_ca_system_score_gemma":0.00036880505,"threshold_uncertainty_score":0.9999048},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000061016017,0.00035272766,0.99630815,0.00034215898,0.0014171563,0.0002821186,0.0001313535,0.00023847618,0.0008668701],"genre_scores_gemma":[0.045542687,0.0003672051,0.9500513,0.0017059362,0.0011790869,0.000015331745,0.00012221897,0.000096533586,0.0009196727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616563,0.000028985345,0.00045348404,0.0020127546,0.00080107036,0.00053804845],"domain_scores_gemma":[0.9966492,0.0004721676,0.00017850727,0.0024062796,0.00011974681,0.00017411797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007130247,0.00045758244,0.0005191186,0.00046884012,0.00030205908,0.00027757455,0.0026575162,0.00019619752,0.0000043192167],"category_scores_gemma":[0.00012060234,0.0003946328,0.000044434106,0.00034253867,0.0008057924,0.0011011949,0.004068426,0.0006185335,0.000059394748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066661446,0.000012167218,0.000010280693,0.000051086805,0.000017340613,0.00019899115,0.00095690886,0.3602773,0.000033836444,0.4411615,0.00007942936,0.19719449],"study_design_scores_gemma":[0.00017231594,0.000096279444,0.0000044515928,0.00044375216,0.0000041341677,0.00003913125,7.278162e-7,0.9590343,0.00002952801,0.03618424,0.0035266632,0.00046445566],"about_ca_topic_score_codex":0.00002231788,"about_ca_topic_score_gemma":0.00011094878,"teacher_disagreement_score":0.598757,"about_ca_system_score_codex":0.00008189844,"about_ca_system_score_gemma":0.00028888744,"threshold_uncertainty_score":0.9998506},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021837636,0.00034515077,0.99732214,0.00036735673,0.00046078197,0.0003057554,0.000005266996,0.00024542125,0.0007297558],"genre_scores_gemma":[0.4588737,0.00042985607,0.53874344,0.0006062851,0.0005860454,0.00007274855,0.000009804531,0.000065004526,0.0006131111],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980557,0.00001947171,0.00037622292,0.00079368294,0.0004859576,0.00026899728],"domain_scores_gemma":[0.99850863,0.00037994626,0.00020493867,0.0007419465,0.00008940384,0.00007515691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064953876,0.00024307746,0.0003333245,0.00056967145,0.00013245,0.00016155394,0.0014591936,0.00015200334,0.000008966889],"category_scores_gemma":[0.000021441896,0.00021669855,0.000062024155,0.0005996076,0.0007542972,0.0003739247,0.00037425428,0.00026172912,0.000016332919],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.7210366e-7,0.000008789678,0.000015900243,0.00009454185,0.0000064993574,0.0000066381226,0.0004866271,0.0025346694,0.00037598505,0.120241225,0.000002331973,0.8762263],"study_design_scores_gemma":[0.00008878767,0.000069239264,0.00023732417,0.00030536563,0.0000069422654,0.00004976314,4.4927359e-7,0.3562998,0.0015263526,0.6409202,0.00021202806,0.00028371817],"about_ca_topic_score_codex":0.00001445937,"about_ca_topic_score_gemma":0.000016643311,"teacher_disagreement_score":0.8759426,"about_ca_system_score_codex":0.000054369742,"about_ca_system_score_gemma":0.0001941854,"threshold_uncertainty_score":0.88367105},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021748435,0.004075181,0.98632467,0.0055655865,0.0020210147,0.00033202145,0.000035809484,0.00044472882,0.0009835325],"genre_scores_gemma":[0.054506496,0.006451306,0.92084295,0.010457961,0.004625983,0.0001535856,0.00029053667,0.0003458042,0.0023253786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575907,0.00005449849,0.00048822945,0.0020246482,0.0010430188,0.000630548],"domain_scores_gemma":[0.99776584,0.00050902914,0.00027223522,0.0007458945,0.00042455297,0.00028245992],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006521891,0.0005664456,0.00047910603,0.0009885927,0.00024519605,0.0028998163,0.002330077,0.00019360456,0.0000059141985],"category_scores_gemma":[0.00014166943,0.00052784214,0.00007919858,0.0007502841,0.0010661152,0.0023806943,0.0033261217,0.00055113307,0.000057584683],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034598118,0.000059923816,0.00006763471,0.00016043511,0.000014131319,0.0001598541,0.00053171266,0.00014062627,0.000005360925,0.000053128075,0.00072784023,0.9980759],"study_design_scores_gemma":[0.00088251,0.00034050978,0.0054652854,0.0029221433,0.000029853509,0.0004725188,0.0000023862858,0.8307653,0.00009332398,0.15250033,0.0048677367,0.001658127],"about_ca_topic_score_codex":0.0000061985224,"about_ca_topic_score_gemma":0.000034243076,"teacher_disagreement_score":0.99641776,"about_ca_system_score_codex":0.00015631778,"about_ca_system_score_gemma":0.00049051305,"threshold_uncertainty_score":0.9997173},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017805686,0.0001857897,0.9841274,0.0010931458,0.0014848979,0.0018586109,0.00070954324,0.00023193762,0.008528121],"genre_scores_gemma":[0.70260954,0.003854888,0.27773404,0.0032072926,0.0019742008,0.00021838151,0.003684532,0.00035741285,0.0063596964],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99737215,0.000028669438,0.00033949912,0.0013412818,0.00056525815,0.0003531193],"domain_scores_gemma":[0.9984244,0.00045194797,0.00017660206,0.0008073116,0.000045739092,0.00009397756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011431117,0.00030068285,0.00033327547,0.00011219851,0.00021865769,0.00012354553,0.001181569,0.00016784198,0.00012880193],"category_scores_gemma":[0.00028194062,0.00027335403,0.000037707337,0.00030157462,0.00059229374,0.00031725108,0.0045253593,0.00028000597,0.000059631046],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002763965,0.00001947074,0.060939144,0.00010625588,0.000020224974,0.000007910669,0.00015115154,0.0026097985,0.000029054967,0.0004084208,0.0009002032,0.9347807],"study_design_scores_gemma":[0.00023266255,0.00017028658,0.5458825,0.000087837754,0.000024217556,0.000009500832,3.1289613e-7,0.4308305,0.000009878954,0.011988025,0.010375173,0.00038904586],"about_ca_topic_score_codex":0.0010283256,"about_ca_topic_score_gemma":0.012052391,"teacher_disagreement_score":0.9343917,"about_ca_system_score_codex":0.00027031166,"about_ca_system_score_gemma":0.00004315444,"threshold_uncertainty_score":0.99997187},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042217035,0.000042553642,0.9502838,0.0009756359,0.00079232303,0.0005701558,0.0001997255,0.000050184237,0.004868548],"genre_scores_gemma":[0.97332066,0.0000456625,0.025553023,0.00056261214,0.00009323923,2.9320142e-7,0.0001855451,0.000008812465,0.00023017108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810314,0.00003711993,0.00034100338,0.00072305725,0.00045621442,0.00033945643],"domain_scores_gemma":[0.9987762,0.00044236446,0.00017360646,0.00041569435,0.000094024326,0.0000981016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081163924,0.0002447806,0.0004704968,0.0007220586,0.00022671478,0.00020566008,0.00078673015,0.00015191225,0.00016023024],"category_scores_gemma":[0.000041150586,0.00017352845,0.00008473689,0.0005941393,0.00061227806,0.0002374775,0.00019023841,0.00031444285,0.000016209988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049174858,0.000013049223,0.026558787,0.000057620964,0.00014577156,0.000047995567,0.0009210587,0.61835337,0.00006587123,0.00048715205,0.0000042975284,0.3532959],"study_design_scores_gemma":[0.000082344595,0.00007358726,0.013578667,0.00011823355,0.00013106693,0.0000072482885,0.000002786813,0.9761845,0.000031516098,0.009493957,0.00005694695,0.00023913725],"about_ca_topic_score_codex":0.0020001035,"about_ca_topic_score_gemma":0.0016898317,"teacher_disagreement_score":0.9311036,"about_ca_system_score_codex":0.00003336675,"about_ca_system_score_gemma":0.00015622198,"threshold_uncertainty_score":0.7076285},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037422773,0.000014597073,0.98996,0.0004823321,0.0007412379,0.0006396693,0.000014214417,0.000099503006,0.0076742307],"genre_scores_gemma":[0.25808218,0.000033593602,0.73237276,0.0015741959,0.0007805294,0.000025180349,0.000096988144,0.00011944406,0.0069151474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980229,0.000011845014,0.00029999355,0.0008185834,0.0004990916,0.00034754275],"domain_scores_gemma":[0.99895316,0.000289337,0.00015294434,0.00048928836,0.00003131293,0.000083944615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003886362,0.00024978895,0.0002381238,0.0001613646,0.00029132937,0.00011419222,0.00045797403,0.00016103675,0.00008099747],"category_scores_gemma":[0.000056618614,0.00023520601,0.00008281943,0.00024388726,0.00069808593,0.00009523928,0.00027604532,0.00023275267,0.0003903696],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049388655,0.000013239262,0.00015698695,0.000020435478,0.0000057645802,0.0000067046794,0.00044963992,0.027227521,0.00085462956,0.00036830685,0.00012386907,0.970768],"study_design_scores_gemma":[0.00037452727,0.00015259409,0.0013690569,0.00019486478,0.000039191727,0.00003021766,9.915325e-7,0.9066421,0.001402077,0.084439225,0.004648572,0.00070658396],"about_ca_topic_score_codex":0.0002512561,"about_ca_topic_score_gemma":0.00083397725,"teacher_disagreement_score":0.97006136,"about_ca_system_score_codex":0.0002434899,"about_ca_system_score_gemma":0.00007751081,"threshold_uncertainty_score":0.95914227},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006502829,0.0003127213,0.99471366,0.00091904146,0.0021318858,0.0004706689,0.00003339061,0.0003259141,0.0004424131],"genre_scores_gemma":[0.54542565,0.00010499164,0.44705904,0.006380316,0.0006679138,0.000050655442,0.00015345377,0.00010738975,0.00005060457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956303,0.000070933755,0.00061550585,0.001775501,0.0011716601,0.0007360496],"domain_scores_gemma":[0.9971038,0.00075449917,0.00028084777,0.001470455,0.0002219879,0.00016839233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011337001,0.0005532238,0.00051080424,0.0020591477,0.00021327216,0.00055902975,0.0033293916,0.00046564292,0.000025004432],"category_scores_gemma":[0.00011052816,0.00053674704,0.00016956472,0.0015113439,0.00042627385,0.0009328958,0.0008890387,0.00119915,0.000054615008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054949323,0.00019640588,0.0003618658,0.0002211409,0.000024638743,0.0009518689,0.0021799658,0.11695968,0.002705802,0.3468246,0.00011557047,0.5294035],"study_design_scores_gemma":[0.0003993105,0.0002081588,0.0011655744,0.00043000738,0.0000057736765,0.000010201466,3.3232564e-7,0.5777139,0.0014695468,0.41756114,0.0002911843,0.00074486446],"about_ca_topic_score_codex":0.00018928286,"about_ca_topic_score_gemma":0.0009019986,"teacher_disagreement_score":0.5476546,"about_ca_system_score_codex":0.00022262886,"about_ca_system_score_gemma":0.000523952,"threshold_uncertainty_score":0.9997084},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010321973,0.00076155766,0.99007654,0.00036832903,0.005816233,0.00034296256,0.0000024172614,0.00065988017,0.0018688731],"genre_scores_gemma":[0.38856637,0.00088153157,0.5755821,0.00799136,0.021009045,0.00015251162,0.0000376508,0.00030836312,0.005471077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963255,0.000104978215,0.00045225437,0.0014968566,0.0008267713,0.00079367275],"domain_scores_gemma":[0.9977782,0.0005644528,0.0002319667,0.0010893146,0.00014437831,0.00019169995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015546926,0.00041453628,0.00050246174,0.0005176436,0.0004852216,0.0007597505,0.002179333,0.00040620432,0.0000030346316],"category_scores_gemma":[0.000057350026,0.0003920375,0.00007982952,0.002003254,0.00046397737,0.00056845794,0.002195838,0.0009797976,0.000073543895],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012168852,0.000027351998,0.00006520343,0.00039795775,0.000019990523,0.00028561754,0.0019630636,0.063787684,0.000011769651,0.05518087,0.0041386792,0.8741096],"study_design_scores_gemma":[0.00014439135,0.00012144209,0.00006493303,0.0006952439,0.000005316567,0.00012038491,1.8951208e-7,0.7701721,0.000045518547,0.22424558,0.0039169756,0.00046790746],"about_ca_topic_score_codex":0.000024174497,"about_ca_topic_score_gemma":0.00012633002,"teacher_disagreement_score":0.8736417,"about_ca_system_score_codex":0.00043605923,"about_ca_system_score_gemma":0.0005281212,"threshold_uncertainty_score":0.99985313},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005137924,0.00012076118,0.99455726,0.00030441256,0.0024242233,0.0018164708,0.00008571025,0.0006244136,0.000061592866],"genre_scores_gemma":[0.0027830412,0.0000211881,0.9949578,0.00012528179,0.0004820544,0.00011897092,0.000038667404,0.00013027288,0.0013427193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934358,0.00007085139,0.0006528588,0.003316471,0.0011599327,0.0013640873],"domain_scores_gemma":[0.9940539,0.0011219878,0.00032163347,0.0035877405,0.00061039807,0.00030433043],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0017875845,0.00074496237,0.0007296997,0.0014616337,0.0007608847,0.0007101475,0.0073141796,0.0005248633,0.0000027093372],"category_scores_gemma":[0.0006189643,0.0007435839,0.0001549736,0.0015419632,0.0007836796,0.0012917357,0.009865188,0.001515809,0.000037595655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003087067,0.00013300804,0.000019685112,0.00025303115,0.00006960675,0.00036819413,0.0008135913,0.64378464,0.002528592,0.0015337389,0.000035172103,0.35042986],"study_design_scores_gemma":[0.000519464,0.00014068092,0.000029853718,0.00026862297,0.000012086122,0.00020274297,0.0000011708877,0.9921186,0.0008636048,0.0046543474,0.0004007683,0.00078806747],"about_ca_topic_score_codex":0.00013201286,"about_ca_topic_score_gemma":0.0006564335,"teacher_disagreement_score":0.3496418,"about_ca_system_score_codex":0.0011879934,"about_ca_system_score_gemma":0.0010802349,"threshold_uncertainty_score":0.9995015},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004382742,0.00015249437,0.9935304,0.0002271454,0.0017161488,0.0003758382,0.0000072185444,0.00024038464,0.0033120865],"genre_scores_gemma":[0.30610198,0.00010692345,0.6924583,0.00048486065,0.00033253487,0.0000073847377,0.0000031790617,0.00008631589,0.0004185312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946174,0.000054093474,0.001043982,0.0017966751,0.0015046685,0.0009831664],"domain_scores_gemma":[0.99475276,0.0018188745,0.00049243495,0.0021186452,0.00057002064,0.00024725831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015842513,0.0005924,0.0007727483,0.001704231,0.00036383566,0.00044854905,0.005052792,0.00039274307,0.000020159154],"category_scores_gemma":[0.00043881484,0.00058366754,0.00022724348,0.0018055453,0.0011577087,0.0013950383,0.002811837,0.0008226008,0.00009811613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045002275,0.000018823237,0.000006509983,0.00001915619,0.000010650906,0.00011504133,0.0022148213,0.733806,0.0007014671,0.13126987,0.000010640877,0.13182253],"study_design_scores_gemma":[0.00005252841,0.000067807094,0.0000027432252,0.000535708,0.0000057048214,0.000019253284,0.0000019674367,0.6301944,0.0056934026,0.36301994,0.000034163284,0.00037238223],"about_ca_topic_score_codex":0.00010501826,"about_ca_topic_score_gemma":0.00012497736,"teacher_disagreement_score":0.3056637,"about_ca_system_score_codex":0.00033414926,"about_ca_system_score_gemma":0.00092877087,"threshold_uncertainty_score":0.99966145},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007597399,0.00047569003,0.9813338,0.0020235023,0.0050126254,0.0016707635,0.00003467164,0.00035416675,0.0014973627],"genre_scores_gemma":[0.9396922,0.00029320872,0.05827521,0.0004383201,0.0010810128,0.00003723628,0.000011454291,0.000041613763,0.00012972868],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960834,0.00009999675,0.00056037947,0.0013146724,0.0012635572,0.00067799253],"domain_scores_gemma":[0.99734867,0.0014261472,0.00034838176,0.0005169482,0.00019940046,0.0001604393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004224629,0.0003494702,0.00044727442,0.0004643276,0.0012720625,0.00038224802,0.00080708286,0.00031019372,0.00001004463],"category_scores_gemma":[0.00054033345,0.00031341132,0.00014920512,0.00058602245,0.0018714569,0.00038607235,0.0005159524,0.00052883266,0.000004222794],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044638873,0.000029657333,0.03923037,0.00019164625,0.00001431464,0.000015305523,0.006642359,0.0027556648,0.0000013083313,0.0070782765,0.00008318246,0.9439133],"study_design_scores_gemma":[0.0008439765,0.0004900159,0.048092008,0.004488842,0.000065418,0.0000073216843,0.000060876286,0.09457594,0.000010759534,0.82726294,0.022724332,0.00137755],"about_ca_topic_score_codex":0.00028703242,"about_ca_topic_score_gemma":0.0021221326,"teacher_disagreement_score":0.9425357,"about_ca_system_score_codex":0.00044853537,"about_ca_system_score_gemma":0.00027407325,"threshold_uncertainty_score":0.9999318},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011782678,0.00038292518,0.9920679,0.0016802477,0.0025329557,0.002612019,0.000053888896,0.00033506978,0.00021716664],"genre_scores_gemma":[0.26147106,0.00041304997,0.73323554,0.001446271,0.0006230996,0.0004485828,0.00038229828,0.0001774351,0.001802668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949438,0.00012875798,0.0013050085,0.0021390917,0.0006532566,0.00083005946],"domain_scores_gemma":[0.9962079,0.00097612245,0.0009465433,0.0014366593,0.00027132448,0.00016146827],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0034873816,0.0006093113,0.00089088944,0.00092096726,0.00029792023,0.0011786325,0.002984957,0.0003620004,0.000004547572],"category_scores_gemma":[0.00034600374,0.0005380258,0.00009583715,0.0004506432,0.00018884575,0.0010012258,0.0034521774,0.0009284776,0.000008739728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002677316,0.00006389907,0.0053867674,0.00065722433,0.00008805431,0.00007533102,0.0009788919,0.000868265,0.00010690806,0.055716004,0.00011987365,0.935912],"study_design_scores_gemma":[0.0006547039,0.00029261687,0.00063217233,0.002469621,0.000016868518,0.00004235264,0.00001496073,0.9660363,0.00015195661,0.024942737,0.0039461832,0.00079949596],"about_ca_topic_score_codex":0.0005630336,"about_ca_topic_score_gemma":0.00024498586,"teacher_disagreement_score":0.96516806,"about_ca_system_score_codex":0.0003078199,"about_ca_system_score_gemma":0.000117217474,"threshold_uncertainty_score":0.99985826},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065546355,0.000036295973,0.9942691,0.0020665054,0.000586834,0.00048802854,0.000006819962,0.0007806741,0.001110326],"genre_scores_gemma":[0.36944106,0.0000018319915,0.62910026,0.0010065596,0.00020240946,0.000039844093,0.000008915236,0.00006387538,0.00013525729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955934,0.00004340553,0.00046785144,0.001903497,0.001234331,0.0007574796],"domain_scores_gemma":[0.99642336,0.00090648734,0.00032099767,0.0018800624,0.0002555931,0.00021350564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009189797,0.000568093,0.00047665514,0.0010374049,0.00053656014,0.0007448134,0.003145352,0.0002814564,0.000017411365],"category_scores_gemma":[0.00014534855,0.00051281694,0.00011235635,0.0011914239,0.0005717149,0.00016474938,0.0011216732,0.0014367314,0.00016155654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035096432,0.000019152341,0.00012674383,0.0000336287,0.0000066767657,0.000046169454,0.0002985006,0.9260166,0.00015218229,0.009276878,0.0000030769118,0.06401683],"study_design_scores_gemma":[0.00024935327,0.000113983115,0.0010702827,0.0005177561,0.000007660852,0.000025060062,9.878221e-8,0.98400795,0.00030903207,0.012844149,0.00024575417,0.00060894265],"about_ca_topic_score_codex":0.00016906182,"about_ca_topic_score_gemma":0.000096185315,"teacher_disagreement_score":0.3687856,"about_ca_system_score_codex":0.0003413929,"about_ca_system_score_gemma":0.000604713,"threshold_uncertainty_score":0.9997323},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007250082,0.0002945227,0.9974863,0.0003711285,0.00060711685,0.0005892899,0.00014066916,0.0003253494,0.00011314866],"genre_scores_gemma":[0.10267394,0.00010917961,0.89634323,0.00024632097,0.00025984386,0.000022930006,0.00016880804,0.000051662173,0.00012406976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996449,0.000029920011,0.00046049588,0.0018844106,0.0006774837,0.0004987193],"domain_scores_gemma":[0.99662215,0.0007046264,0.0003787261,0.0020095338,0.00018840922,0.00009653378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013514872,0.00042497175,0.00047027168,0.0008987365,0.00017364195,0.000550536,0.0033383635,0.00035095413,6.017595e-7],"category_scores_gemma":[0.0005260985,0.00042199733,0.00004579074,0.0007740538,0.00039465172,0.0011540591,0.0017971224,0.0006183044,0.0000015078285],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000527334,0.000010368245,0.00016558975,0.000029306291,0.000008846096,0.000033072527,0.00051969895,0.00310336,0.00007691019,0.003290867,0.00006966649,0.99268705],"study_design_scores_gemma":[0.00022484372,0.00014088863,0.00071225676,0.0003676889,0.000012258179,0.000024446637,0.0000012517353,0.94562477,0.00073812995,0.050968267,0.0007026443,0.0004825668],"about_ca_topic_score_codex":0.000069113274,"about_ca_topic_score_gemma":0.0025971516,"teacher_disagreement_score":0.9922045,"about_ca_system_score_codex":0.00020420231,"about_ca_system_score_gemma":0.00032682592,"threshold_uncertainty_score":0.9998232},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020721032,0.00009908026,0.99142134,0.0010477471,0.002812799,0.00038696648,0.000003977687,0.0008074685,0.0033999234],"genre_scores_gemma":[0.049294725,0.00008162338,0.945357,0.0017940778,0.0010225329,0.000026611646,0.00002391527,0.00010231107,0.0022972028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953675,0.000034905188,0.0006572205,0.0019316252,0.0012836715,0.0007250685],"domain_scores_gemma":[0.99686563,0.0004975412,0.0002591585,0.0019168634,0.0002774155,0.00018340533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010417082,0.0004983504,0.0004927605,0.0010631906,0.0002483246,0.00044107836,0.0034609037,0.0004853131,0.000011467243],"category_scores_gemma":[0.00028295116,0.00047939416,0.00013725777,0.0011890373,0.00044552467,0.00060623884,0.0021639832,0.00096734473,0.00013506628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003839665,0.000027848873,0.00011763259,0.00004797337,0.0000099888175,0.00014230369,0.00043639579,0.06900692,0.00030017656,0.29250264,0.00005836484,0.6373459],"study_design_scores_gemma":[0.00017521376,0.00008217526,0.00010164579,0.0003887157,0.0000058312976,0.000040411745,9.986745e-8,0.79347146,0.00036688472,0.20329133,0.0014688832,0.0006073928],"about_ca_topic_score_codex":0.00003959483,"about_ca_topic_score_gemma":0.00016112805,"teacher_disagreement_score":0.7244645,"about_ca_system_score_codex":0.0003903945,"about_ca_system_score_gemma":0.00059913425,"threshold_uncertainty_score":0.99976575},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00809328,0.0000103039465,0.9885533,0.0003045967,0.0006529418,0.00044780225,0.000030783536,0.000060593156,0.0018464233],"genre_scores_gemma":[0.9851841,0.0000031899442,0.0133385025,0.00009841961,0.00069587404,0.000097073265,0.000050118164,0.000024082268,0.00050864887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983489,0.000004775641,0.00030219616,0.0007592578,0.00028818188,0.00029672452],"domain_scores_gemma":[0.99895203,0.00019083143,0.0001317061,0.00045181235,0.00020395097,0.000069655915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031735207,0.0002325384,0.00020328761,0.00034463088,0.00032967085,0.0003212999,0.00062488427,0.00009099909,0.000026565038],"category_scores_gemma":[0.0000134918855,0.00020472959,0.00014240872,0.0004380295,0.00020241254,0.0003021902,0.00014866868,0.00030395077,0.00004197488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011997288,0.000047300106,0.0017119852,0.000021033646,0.000016623804,5.581975e-7,0.00053212605,0.5556084,0.0012552767,0.044524867,0.00002306042,0.39624676],"study_design_scores_gemma":[0.00009312333,0.00002292153,0.00029152964,0.000045565794,0.0000052950545,4.0192944e-7,9.3086817e-7,0.8394172,0.00013946257,0.15946063,0.00032260118,0.00020033673],"about_ca_topic_score_codex":0.000060763985,"about_ca_topic_score_gemma":0.00006558922,"teacher_disagreement_score":0.97709084,"about_ca_system_score_codex":0.000067482506,"about_ca_system_score_gemma":0.00014458313,"threshold_uncertainty_score":0.83486307},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005817886,0.0008108944,0.98962104,0.00014528306,0.0022636498,0.00017372331,0.000008737643,0.0013080118,0.005086864],"genre_scores_gemma":[0.90977705,0.003074543,0.058956876,0.0013518945,0.0039209775,0.00016594061,0.00004010195,0.0005490736,0.022163542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839586,0.0000032275846,0.00016147907,0.00037357793,0.0004918843,0.0005739961],"domain_scores_gemma":[0.99933016,0.00015222377,0.000026511498,0.00044507525,0.000015506688,0.000030502504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017352159,0.00023336196,0.00022014462,0.00017132903,0.000056216762,0.00008968177,0.00082228315,0.00020728684,0.000010952663],"category_scores_gemma":[0.00003338689,0.0002185063,0.00005020587,0.00045478978,0.00022386586,0.00006828321,0.00030472237,0.00060726784,0.00006433344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001275624,0.000005436006,0.00004965246,0.00009882564,0.000021531316,0.000044646098,0.0001657438,0.32917643,0.000102058606,0.0018663725,0.0029014254,0.6655666],"study_design_scores_gemma":[0.00022267857,0.00017920704,0.00025667518,0.00042204282,0.000012741556,0.000027245922,0.0000010073768,0.6928521,0.0054401187,0.24172871,0.05779959,0.0010578814],"about_ca_topic_score_codex":0.000002968933,"about_ca_topic_score_gemma":0.000089165405,"teacher_disagreement_score":0.9306642,"about_ca_system_score_codex":0.0011431364,"about_ca_system_score_gemma":0.00016649916,"threshold_uncertainty_score":0.8910428},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000107417516,0.000031978292,0.9955546,0.00016459354,0.001704877,0.00029733696,0.000029136268,0.00060810556,0.0015018994],"genre_scores_gemma":[0.4383181,0.00003345928,0.5586205,0.0006786618,0.0007370283,0.00012363955,0.00004504646,0.00016388738,0.0012796881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974716,0.0000072083917,0.00030860282,0.00075671636,0.0009538316,0.0005020529],"domain_scores_gemma":[0.9986767,0.00040418858,0.000047369755,0.0005601032,0.00018219471,0.00012941145],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044335236,0.00029423088,0.00023515504,0.0010004803,0.00035478885,0.00020471765,0.0012484284,0.0001561108,0.00001658565],"category_scores_gemma":[0.00003125898,0.00030923783,0.00006283637,0.00190907,0.0009450516,0.00017997655,0.000055442226,0.0007040966,0.00024413422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.1250373e-7,0.000009388086,8.888882e-7,0.000018349532,0.0000029838247,0.000002641658,0.00017017692,0.8803342,0.000051515803,0.00022207244,0.000058685586,0.119128615],"study_design_scores_gemma":[0.00007277739,0.000029288947,0.000062984975,0.00014130509,0.0000048400098,0.0000064424917,8.75273e-8,0.93935394,0.00045943537,0.059383463,0.00019487279,0.00029054767],"about_ca_topic_score_codex":0.000008798506,"about_ca_topic_score_gemma":0.000046942154,"teacher_disagreement_score":0.43821067,"about_ca_system_score_codex":0.000784542,"about_ca_system_score_gemma":0.0009501467,"threshold_uncertainty_score":0.999936},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027913552,0.00015598691,0.9171144,0.0018831333,0.012980515,0.0018249049,0.00020985068,0.0012471515,0.036670543],"genre_scores_gemma":[0.97345436,0.000075928365,0.005634806,0.011337447,0.0012705558,0.000021610549,0.000021864043,0.00011675698,0.008066663],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99638844,0.0000751042,0.00042134256,0.0017838356,0.0006564134,0.0006748462],"domain_scores_gemma":[0.9969878,0.0019998646,0.00023254163,0.00054670085,0.00009835348,0.0001347475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005498267,0.00048687315,0.00048572154,0.00062901643,0.0003045889,0.00019657194,0.001246721,0.00033663548,0.00009205781],"category_scores_gemma":[0.00051287713,0.00042125935,0.00013590908,0.0004045157,0.0016474316,0.00017534812,0.00088092155,0.0011784574,0.0003063764],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004554937,0.00014281954,0.00006997952,0.00005800375,0.000023045915,0.015797384,0.0026878528,0.004351695,0.040145345,0.013871536,0.00008241459,0.92272437],"study_design_scores_gemma":[0.005510921,0.0069058053,0.0009774489,0.004316719,0.0002583657,0.0075688544,0.000015269377,0.13687247,0.36787546,0.4514855,0.00816019,0.010052977],"about_ca_topic_score_codex":0.000011514008,"about_ca_topic_score_gemma":0.000048439615,"teacher_disagreement_score":0.94554085,"about_ca_system_score_codex":0.00017469832,"about_ca_system_score_gemma":0.00060956227,"threshold_uncertainty_score":0.9998239},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002705685,0.0005747705,0.99138457,0.00013644848,0.0017177504,0.0005358785,0.0000131177885,0.0011942453,0.0017375128],"genre_scores_gemma":[0.9572231,0.00008797381,0.04083814,0.0005423928,0.00082967867,0.000009094134,0.00007454831,0.00010331526,0.00029172248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947391,0.00020551945,0.0007225136,0.0025141423,0.00082228525,0.0009964018],"domain_scores_gemma":[0.99622786,0.0018480583,0.0005230304,0.0005753233,0.0004894302,0.00033630995],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015885996,0.000756707,0.00079081516,0.0008845402,0.00082449394,0.0012580788,0.0014589906,0.0004455944,0.000004001069],"category_scores_gemma":[0.00017355186,0.00078626035,0.00012353892,0.0008860886,0.0005993889,0.00055556523,0.0014171562,0.0015955679,0.0000906123],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000631898,0.000020135027,0.00014286267,0.0000871921,0.000021988575,0.0001320753,0.00085309206,0.0035238606,0.000046436602,0.00043812988,0.000013487099,0.99471444],"study_design_scores_gemma":[0.00044505132,0.0004310004,0.00017006276,0.0029305827,0.00003710251,0.00021623974,0.000007807758,0.98720765,0.00031119,0.0070842146,0.00012144594,0.0010376406],"about_ca_topic_score_codex":0.00006520848,"about_ca_topic_score_gemma":0.00007062019,"teacher_disagreement_score":0.9936768,"about_ca_system_score_codex":0.00023682858,"about_ca_system_score_gemma":0.00029728253,"threshold_uncertainty_score":0.9997787},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016184258,0.00012295326,0.9949735,0.0005447567,0.0006816373,0.0007463006,0.000027308337,0.00055381673,0.000731338],"genre_scores_gemma":[0.9862637,0.0000054935804,0.012612873,0.0003621967,0.00030857648,0.000108723965,0.000086288754,0.00010504956,0.0001471217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980171,0.000014589589,0.000313217,0.0007530243,0.0004346824,0.00046743648],"domain_scores_gemma":[0.99901426,0.00025673854,0.00012481428,0.0003657794,0.00016404956,0.000074342344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025760123,0.0005212226,0.00043416338,0.0011551545,0.00030659066,0.00013328153,0.00037587527,0.00014510963,0.000016883308],"category_scores_gemma":[0.00002172217,0.00042641195,0.00015731048,0.0005183501,0.0001852553,0.00013286444,0.000043831787,0.0005591057,0.0000020493342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029095213,0.000069645066,0.00012822577,0.0006407596,0.00032247967,0.000023897534,0.0006988113,0.57007843,0.01854324,0.00077385735,0.00025351022,0.40817618],"study_design_scores_gemma":[0.0039092195,0.0031282867,0.004942114,0.0021455293,0.00022177245,0.00001789098,0.0000035486037,0.8782254,0.060178045,0.04195929,0.002680073,0.0025888365],"about_ca_topic_score_codex":0.000008432222,"about_ca_topic_score_gemma":0.00030317553,"teacher_disagreement_score":0.98464525,"about_ca_system_score_codex":0.0001799355,"about_ca_system_score_gemma":0.00008069094,"threshold_uncertainty_score":0.99981874},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012729952,0.000075752825,0.9921496,0.00021059939,0.00090648874,0.005691536,0.000011380189,0.0008412609,0.000100651196],"genre_scores_gemma":[0.0021317971,0.000007937933,0.99550176,0.00018746113,0.00029390582,0.0012153703,0.000006050701,0.000060333092,0.000595363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969032,0.000033410037,0.00044990104,0.001494941,0.00047242807,0.0006461648],"domain_scores_gemma":[0.9965933,0.0017572391,0.00024069038,0.0011014409,0.00017609271,0.00013126843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010777891,0.00050030276,0.00059928634,0.0005784802,0.00028945357,0.00043311896,0.0022874114,0.00030952954,0.0000011665804],"category_scores_gemma":[0.00044148375,0.00047000006,0.000093897645,0.00031928005,0.00052319566,0.00045902064,0.0013342758,0.00057558465,0.0000053014905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057407333,0.000014528943,0.000037590948,0.00019846458,0.000012351076,0.000043693602,0.0005163528,0.2977642,0.00048670697,0.047068615,0.000008921352,0.6538428],"study_design_scores_gemma":[0.000581432,0.00057125516,0.00027973237,0.000989241,0.000007940233,0.00004152902,3.3455888e-7,0.15805848,0.0043393313,0.8332071,0.0008562052,0.0010674681],"about_ca_topic_score_codex":0.000011546077,"about_ca_topic_score_gemma":0.000042139203,"teacher_disagreement_score":0.7861384,"about_ca_system_score_codex":0.0002447655,"about_ca_system_score_gemma":0.00023994916,"threshold_uncertainty_score":0.9997752},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043697414,0.0003367169,0.9954341,0.00080100104,0.0016952924,0.000616938,0.00007343272,0.00014700566,0.0004585556],"genre_scores_gemma":[0.31111696,0.001108737,0.66237944,0.010318879,0.006046348,0.00009258305,0.006632776,0.00055824325,0.0017460304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655384,0.000026500817,0.00056799024,0.0011912602,0.0009481319,0.00071227096],"domain_scores_gemma":[0.9908083,0.007861225,0.00025263,0.00064670114,0.00011582194,0.00031534102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016890145,0.00044470126,0.00071128656,0.0006834579,0.00039344904,0.00028147406,0.00067327486,0.00030302655,0.00010463383],"category_scores_gemma":[0.0075885444,0.00038432216,0.00016058901,0.00033302605,0.0006678026,0.00015961482,0.00034869183,0.0017258069,0.000060778784],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048852497,0.000024377458,0.0014570061,0.00017326268,0.000027548023,0.00041657742,0.00036209225,0.031893734,0.000056754525,0.00028513325,0.00065366377,0.964601],"study_design_scores_gemma":[0.0033570887,0.001291871,0.005906473,0.0064427117,0.00035742891,0.0008957408,0.0000021973913,0.8172978,0.00018433081,0.077722296,0.084840365,0.0017016506],"about_ca_topic_score_codex":0.000018260527,"about_ca_topic_score_gemma":0.00003792175,"teacher_disagreement_score":0.9628993,"about_ca_system_score_codex":0.00018295224,"about_ca_system_score_gemma":0.00036549807,"threshold_uncertainty_score":0.9998609},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056572584,0.0036739674,0.89239943,0.0060246782,0.0018232716,0.00058345514,0.000005647606,0.00021847885,0.09470537],"genre_scores_gemma":[0.99352765,0.0032731667,0.0020098046,0.00020308609,0.00060550525,0.0000069283383,0.0000013733335,0.000033359403,0.00033912293],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733335,0.000044707383,0.00032761728,0.00093520747,0.0007336601,0.000625475],"domain_scores_gemma":[0.99892974,0.00046058348,0.000111290785,0.0002957885,0.00006132263,0.00014125499],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015661572,0.00029184704,0.00042156532,0.0007508909,0.0004975865,0.0003269889,0.00079630536,0.0003576488,0.000018959512],"category_scores_gemma":[0.00017695277,0.00027879252,0.000058603848,0.00039468677,0.0009213059,0.00039951096,0.0003493036,0.00061390037,0.000012075094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000124337785,0.00001247087,0.0005059049,0.00004857333,0.000010518716,0.0000972,0.011367536,0.026421057,0.0000024584367,0.38150203,0.0000018479882,0.580018],"study_design_scores_gemma":[0.00029101907,0.000032879278,0.00017938881,0.00040071944,0.0000080009095,0.000003399415,0.00006253928,0.34208727,0.0000014826868,0.65620327,0.0003140155,0.00041599158],"about_ca_topic_score_codex":0.00044868686,"about_ca_topic_score_gemma":0.013808331,"teacher_disagreement_score":0.99296194,"about_ca_system_score_codex":0.00048046955,"about_ca_system_score_gemma":0.0003487427,"threshold_uncertainty_score":0.99996644},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010410594,0.00021198792,0.9957079,0.00095262897,0.0005800928,0.0002867037,0.000010410076,0.00006973268,0.0011394641],"genre_scores_gemma":[0.9092241,0.00038500602,0.08773121,0.001949902,0.0001211555,0.000013797249,0.000012346379,0.000032628024,0.00052984874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968734,0.000059725433,0.0006490435,0.0010248966,0.00096437236,0.0004285823],"domain_scores_gemma":[0.9969294,0.0015826524,0.0003062102,0.00088254653,0.00020441122,0.00009478748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021258327,0.00034062358,0.0005901357,0.0029259964,0.00014076133,0.00044620386,0.002414666,0.00022561538,0.000025194357],"category_scores_gemma":[0.00032174928,0.00024081336,0.00014320148,0.0036088855,0.0005624698,0.00038315865,0.0008350373,0.0004688185,0.000046473277],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037985794,0.00002873512,0.00025731733,0.000028044797,0.000009889081,0.0000843314,0.0010358102,0.00089908094,0.00003013266,0.0071849814,0.00003820687,0.99039966],"study_design_scores_gemma":[0.0010836881,0.00041453476,0.0024541563,0.00069379166,0.000034122473,0.00013494189,0.000013643096,0.81820357,0.0012770765,0.172126,0.002558682,0.0010058226],"about_ca_topic_score_codex":0.000083797866,"about_ca_topic_score_gemma":0.00027942227,"teacher_disagreement_score":0.98939383,"about_ca_system_score_codex":0.000101937076,"about_ca_system_score_gemma":0.00036017038,"threshold_uncertainty_score":0.98200834},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38522854,0.00093524146,0.5244837,0.004393475,0.031895168,0.010396668,0.00004645398,0.0009595821,0.041661225],"genre_scores_gemma":[0.9974628,0.000024989627,0.001078897,0.000069523725,0.0005570027,0.000037705413,0.0000018429062,0.000018615703,0.00074859965],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735874,0.00014907811,0.0005290735,0.00063763914,0.0009941474,0.000331295],"domain_scores_gemma":[0.99823326,0.0006253308,0.00025809728,0.00043327257,0.00035959025,0.000090425725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002078699,0.00020308382,0.0003810113,0.0006955981,0.0002819377,0.00018950866,0.0007612716,0.00032302953,0.00001673606],"category_scores_gemma":[0.00033846148,0.00020197868,0.00004196183,0.0013560689,0.00079483585,0.00021371337,0.00020189004,0.0004563782,0.000013722091],"study_design_candidate":"theoretical_or_conceptual","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.000043864646,0.0014741691,0.012175284,0.00032133568,0.0000445698,0.003796893,0.46853164,0.070385106,0.000050768158,0.17015623,0.0004264388,0.2725937],"study_design_scores_gemma":[0.012073723,0.00677581,0.017333688,0.01042011,0.0004895478,0.0016319877,0.072293445,0.15282874,0.0001709765,0.68726397,0.024761988,0.013955988],"about_ca_topic_score_codex":0.0038504866,"about_ca_topic_score_gemma":0.04640011,"teacher_disagreement_score":0.6122343,"about_ca_system_score_codex":0.0005316024,"about_ca_system_score_gemma":0.0015188464,"threshold_uncertainty_score":0.9710006},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037550644,0.00027233458,0.99141026,0.00016805143,0.006662806,0.0004711096,0.0000032933804,0.0003182179,0.00031844116],"genre_scores_gemma":[0.6368324,0.000032596705,0.35928628,0.0005331098,0.0025474718,0.000015092321,0.000038628597,0.00007605913,0.00063836825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967095,0.00004500947,0.000579573,0.0012092981,0.00096211367,0.0004944911],"domain_scores_gemma":[0.99801224,0.0005418527,0.0003990009,0.00065069424,0.00026189914,0.0001343324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009381187,0.00039704744,0.0004000319,0.001363323,0.00038186935,0.00074711465,0.0012878171,0.00026693114,0.000011823283],"category_scores_gemma":[0.00012602062,0.00040199258,0.00012120912,0.001215588,0.00022427893,0.0009103922,0.0008000304,0.000562221,0.00015566584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006684235,0.000014118565,0.000043629192,0.000038145365,0.000014564463,0.000023852708,0.00031861794,0.72191983,0.0002452747,0.015570838,0.000023198349,0.26178125],"study_design_scores_gemma":[0.00015575245,0.00008706297,0.00020203502,0.00034345666,0.000009673661,0.000038355618,2.630065e-7,0.9340855,0.000039300994,0.064438164,0.000207256,0.00039317246],"about_ca_topic_score_codex":0.000102212914,"about_ca_topic_score_gemma":0.000050715586,"teacher_disagreement_score":0.6364569,"about_ca_system_score_codex":0.00033204848,"about_ca_system_score_gemma":0.00055127766,"threshold_uncertainty_score":0.9998432},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02193027,0.00017093343,0.9744327,0.000025981648,0.0016991985,0.0002032771,0.00003554174,0.00010821907,0.0013938941],"genre_scores_gemma":[0.9851682,0.00008683744,0.014410548,0.000022028995,0.00012247985,0.0000018342239,0.000007846333,0.000044343,0.00013585748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987571,0.0000013881904,0.00033461017,0.00031395332,0.00036247438,0.00023045627],"domain_scores_gemma":[0.9993209,0.0000733109,0.00009753206,0.00039070885,0.00007417446,0.000043372347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022772033,0.00020943553,0.0003659903,0.0004163928,0.000020365442,0.000019540363,0.00052957697,0.00019465825,0.000011612514],"category_scores_gemma":[0.000010453245,0.00020270066,0.00009065763,0.00031091817,0.0002222836,0.000050973642,0.00020601669,0.00023020766,0.00000516815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013179146,0.000035390436,0.00037393044,0.0010119173,0.00007458242,0.000090144575,0.0012453797,0.4160034,0.020604,0.0063005267,0.000019619236,0.55422795],"study_design_scores_gemma":[0.00012855887,0.00005796849,0.00066755933,0.0005664161,0.000010748735,0.000010974647,2.697694e-7,0.95957667,0.013258915,0.02521748,0.0001619526,0.00034247965],"about_ca_topic_score_codex":0.00001766311,"about_ca_topic_score_gemma":0.000119274446,"teacher_disagreement_score":0.96323794,"about_ca_system_score_codex":0.000054393735,"about_ca_system_score_gemma":0.00007468191,"threshold_uncertainty_score":0.8265893},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022509017,0.000098073564,0.99142754,0.0003759401,0.0029235973,0.0004601546,0.0000138531295,0.00017013586,0.0022797883],"genre_scores_gemma":[0.85864073,0.000015199329,0.13973492,0.0004891975,0.00038884455,0.000012446636,0.00000906188,0.000056120076,0.00065345684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960343,0.000045376662,0.00081657997,0.0013106838,0.0011337048,0.0006593084],"domain_scores_gemma":[0.9970181,0.00082630257,0.0005603339,0.00113792,0.00027561642,0.00018174479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009674685,0.0005158813,0.00074557343,0.0012796697,0.00019806526,0.00021371318,0.0032611142,0.00024698934,0.000009514631],"category_scores_gemma":[0.000117045834,0.0004761697,0.00020809195,0.0010991709,0.00071869505,0.00020744829,0.0020208072,0.0005609448,0.00012831266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011232204,0.00006421836,0.000027819018,0.00006609576,0.000025786954,0.00005436899,0.002588124,0.36286172,0.0005810997,0.012721062,0.000037039354,0.6209614],"study_design_scores_gemma":[0.00040746795,0.0002326222,0.000703578,0.0005410504,0.000009049938,0.0000157183,3.9304905e-7,0.91372055,0.00410941,0.079615414,0.00007228989,0.00057245203],"about_ca_topic_score_codex":0.00007097293,"about_ca_topic_score_gemma":0.000035205427,"teacher_disagreement_score":0.8563898,"about_ca_system_score_codex":0.00026845885,"about_ca_system_score_gemma":0.00067069277,"threshold_uncertainty_score":0.999769},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00147327,0.0003433387,0.97905445,0.0009470118,0.015164546,0.0011830528,0.000010920255,0.001157871,0.0006655481],"genre_scores_gemma":[0.06390085,0.000019288573,0.92917186,0.0018635921,0.0029181277,0.000037606766,0.000056644745,0.00018848448,0.001843522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9865605,0.00037216346,0.0018020148,0.005658597,0.0029592442,0.0026474567],"domain_scores_gemma":[0.99142396,0.0027406313,0.00063639786,0.004094894,0.00061868713,0.0004854227],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.0060901847,0.001331425,0.0016024183,0.004461628,0.0007782317,0.003673761,0.01178862,0.0007490047,0.00001790478],"category_scores_gemma":[0.00035195192,0.0013384438,0.00038658173,0.009527972,0.002433345,0.0013315784,0.010306208,0.0025611368,0.00045025928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000490003,0.00019009707,0.0006212873,0.00016253103,0.000016351414,0.0007094705,0.0022677872,0.21949196,0.00004107358,0.0032060116,0.0007288097,0.7725597],"study_design_scores_gemma":[0.000528825,0.00018655726,0.0025398307,0.00067031244,0.0000060998245,0.000102077014,4.4898513e-7,0.8581975,0.00014350102,0.13550328,0.0008591017,0.001262454],"about_ca_topic_score_codex":0.000084656065,"about_ca_topic_score_gemma":0.00055016926,"teacher_disagreement_score":0.7712973,"about_ca_system_score_codex":0.0021967278,"about_ca_system_score_gemma":0.0035853272,"threshold_uncertainty_score":0.9999437},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067833876,0.000060022317,0.9891236,0.0006960238,0.001699467,0.0005543757,0.000011518547,0.000328296,0.00074333115],"genre_scores_gemma":[0.8360821,0.000011711556,0.16213214,0.00065195264,0.00043020985,0.000006864245,0.000012955133,0.000061512714,0.000610524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955489,0.00007405428,0.0008689761,0.0016035242,0.0010992368,0.00080527726],"domain_scores_gemma":[0.99569005,0.0018519751,0.00061299914,0.0012782863,0.00034037657,0.00022629557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007412988,0.00063554285,0.0008533725,0.0007173687,0.0002987092,0.00029729755,0.00236858,0.00036350585,0.000019932271],"category_scores_gemma":[0.00022875614,0.00053376507,0.00019850965,0.0011088233,0.000626199,0.00053966045,0.001959934,0.0007894569,0.000051035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009350044,0.0002062564,0.0015543855,0.00022054881,0.00016518103,0.00034905196,0.0033493359,0.2829904,0.0019342108,0.04078043,0.0002722747,0.66808444],"study_design_scores_gemma":[0.00095989427,0.00019570791,0.0050445287,0.00090854056,0.000019822108,0.000066291184,4.2989942e-7,0.9483403,0.0020837684,0.041330047,0.000259748,0.0007909052],"about_ca_topic_score_codex":0.0003293309,"about_ca_topic_score_gemma":0.0003029251,"teacher_disagreement_score":0.82929873,"about_ca_system_score_codex":0.00014610695,"about_ca_system_score_gemma":0.00059174,"threshold_uncertainty_score":0.9997114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045052075,0.00009452405,0.9926769,0.002624032,0.001957563,0.0006425634,0.0000039651613,0.0015267594,0.00042865064],"genre_scores_gemma":[0.02485238,0.000025744983,0.9708958,0.0020286639,0.00021338307,0.00003406904,0.000009226698,0.000060257626,0.0018804639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504817,0.00008700144,0.0005879644,0.0021561068,0.0010997754,0.001020981],"domain_scores_gemma":[0.9967393,0.0009355605,0.0003412255,0.0015157608,0.00020607485,0.00026203817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011050694,0.0006843565,0.00056773925,0.0018587848,0.0005227719,0.00080776104,0.0035183553,0.00046111544,0.000020321912],"category_scores_gemma":[0.0002097946,0.0006354794,0.00017091211,0.0031911691,0.00042265875,0.00054410927,0.0009580213,0.0010514456,0.0001324548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009980472,0.000029159264,0.000027574237,0.000014898476,0.000007880673,0.00001650912,0.00016585628,0.21962106,0.00031447018,0.010216754,0.00013901548,0.76943684],"study_design_scores_gemma":[0.0003814813,0.00037669274,0.0002880146,0.00022661172,0.0000089029845,0.000014678221,3.039604e-7,0.85917,0.00070318475,0.13784124,0.00041216402,0.0005766937],"about_ca_topic_score_codex":0.000070374306,"about_ca_topic_score_gemma":0.00046728546,"teacher_disagreement_score":0.76886016,"about_ca_system_score_codex":0.0004907563,"about_ca_system_score_gemma":0.00056963577,"threshold_uncertainty_score":0.99960965},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031821325,0.00019157106,0.99345005,0.0008369302,0.0015877596,0.00057538174,0.000008792292,0.00011679282,0.00005057488],"genre_scores_gemma":[0.37313586,0.000010159883,0.625863,0.00045601404,0.00038051096,0.0000109986695,0.0000074408586,0.00003495831,0.00010106816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740255,0.000040040934,0.0005025377,0.0009969742,0.000650118,0.0004078011],"domain_scores_gemma":[0.99773455,0.0010828485,0.0003284658,0.00054681586,0.00021659855,0.00009073568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010669561,0.00033682951,0.00045418597,0.00036449844,0.000305499,0.00021234216,0.0012252907,0.00015362204,0.0000011032394],"category_scores_gemma":[0.000060775343,0.0002703667,0.00013933193,0.00043647317,0.0005030817,0.00024116949,0.0011469343,0.0003900453,0.000004781194],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069547027,0.00003123064,0.0000028411398,0.000038292976,0.000023905093,0.000005278553,0.00097625586,0.0423143,0.00065237895,0.011148053,0.000005704255,0.94479483],"study_design_scores_gemma":[0.0003033431,0.00023610603,0.00020176802,0.00032972023,0.000010619955,0.000034797846,6.928079e-7,0.8932541,0.00066351343,0.10464189,0.00006166393,0.00026176497],"about_ca_topic_score_codex":0.0000732023,"about_ca_topic_score_gemma":0.000036613455,"teacher_disagreement_score":0.94453305,"about_ca_system_score_codex":0.00016002858,"about_ca_system_score_gemma":0.0002617869,"threshold_uncertainty_score":0.99997485},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021978343,0.0004233353,0.91916317,0.003907079,0.0072295913,0.003608861,0.00004710221,0.0007285348,0.042914003],"genre_scores_gemma":[0.9529929,0.00028313804,0.038593635,0.0010294806,0.0008048648,0.00014384624,0.000020478854,0.00014776214,0.005983887],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99523044,0.000037121536,0.00049209007,0.0013749447,0.0016686558,0.0011967531],"domain_scores_gemma":[0.9983677,0.00012504947,0.00022150678,0.00079978845,0.000014331434,0.00047157667],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012398433,0.00057255646,0.0005361993,0.00041362137,0.0004274199,0.0002830271,0.0012452726,0.00025709855,0.00017363485],"category_scores_gemma":[0.000031238476,0.00050459075,0.00011094027,0.0004185581,0.00055131956,0.00062027754,0.0013909359,0.0005817513,0.0012155207],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012963956,0.00029175647,0.059739355,0.00071834156,0.00007443586,0.00035278522,0.008783962,0.17067446,0.002383686,0.004388845,0.0010572276,0.7514055],"study_design_scores_gemma":[0.0031258028,0.005048305,0.6996656,0.011331557,0.00021052771,0.00025537313,0.000022583714,0.06929499,0.008199294,0.06847882,0.12170918,0.01265795],"about_ca_topic_score_codex":0.00077399175,"about_ca_topic_score_gemma":0.0008672137,"teacher_disagreement_score":0.93101454,"about_ca_system_score_codex":0.0017550348,"about_ca_system_score_gemma":0.0001269674,"threshold_uncertainty_score":0.9997406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021175251,0.0000359356,0.9951673,0.001176568,0.00094222795,0.00082739687,0.000011081302,0.00017841243,0.0014493024],"genre_scores_gemma":[0.5583961,0.00008200317,0.43490502,0.0037214456,0.0004987552,0.00024238991,0.000010802255,0.00007279414,0.0020706898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959501,0.00004346494,0.0008459061,0.0012053051,0.0012628841,0.00069235935],"domain_scores_gemma":[0.9962995,0.0009252954,0.00042348178,0.0016732671,0.00036636696,0.00031208768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018090676,0.00044118098,0.00066775345,0.0010635253,0.00029782,0.00061108026,0.004486733,0.00026752998,0.000016761018],"category_scores_gemma":[0.00039213005,0.000386127,0.00011325252,0.0021564355,0.0005680219,0.0010686613,0.0017382447,0.0004225252,0.0000731979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020003443,0.00004779203,0.00001779985,0.00004546212,0.000023637214,0.000018011497,0.015057619,0.15283877,0.0009038863,0.081808366,0.00027730165,0.74894136],"study_design_scores_gemma":[0.0007141127,0.0012274446,0.00080137805,0.0011069037,0.000011116399,0.000031733463,0.000031658703,0.8279866,0.0077191503,0.1509864,0.007639933,0.0017435523],"about_ca_topic_score_codex":0.00009181758,"about_ca_topic_score_gemma":0.000043560063,"teacher_disagreement_score":0.7471978,"about_ca_system_score_codex":0.000210957,"about_ca_system_score_gemma":0.0008321508,"threshold_uncertainty_score":0.99985904},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011374162,0.00003519429,0.98021436,0.0022031013,0.0011749892,0.0003904457,0.00000660623,0.00045025107,0.0155136585],"genre_scores_gemma":[0.096764535,0.00028213655,0.8872159,0.006554846,0.0008340615,0.000037629754,0.000029423443,0.00015956633,0.008121875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595636,0.0000612305,0.00042282772,0.0014268165,0.0013667163,0.0007660205],"domain_scores_gemma":[0.9973783,0.000849392,0.0001556666,0.0011649613,0.00020221862,0.0002494925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012821615,0.00043023232,0.0004071286,0.001624649,0.00035515366,0.0008263681,0.003138728,0.00022961231,0.000031683147],"category_scores_gemma":[0.00016199287,0.00038170765,0.00013982944,0.001104313,0.00082247186,0.000427201,0.0010890218,0.0010267958,0.00021449557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042214847,0.000023555875,0.00001181717,0.000023066232,0.000011649241,0.00013327166,0.00072604185,0.24674174,0.00006691754,0.21104738,0.0000644843,0.54114586],"study_design_scores_gemma":[0.00027459572,0.00024101687,0.00006435836,0.0003803693,0.0000021042586,0.00002194147,1.9496404e-7,0.7295316,0.00020898491,0.268203,0.00057568157,0.00049619493],"about_ca_topic_score_codex":0.000013553241,"about_ca_topic_score_gemma":0.000068271984,"teacher_disagreement_score":0.54064965,"about_ca_system_score_codex":0.00014310675,"about_ca_system_score_gemma":0.00056487985,"threshold_uncertainty_score":0.9998635},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015653532,0.010369601,0.9366641,0.0049477816,0.00599347,0.0029114562,0.0009857677,0.00054397533,0.021930322],"genre_scores_gemma":[0.9649742,0.00015116924,0.03133762,0.0009235124,0.000620114,0.0000071144177,0.00016838545,0.000024905605,0.0017929386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975488,0.00004474811,0.0003322668,0.0009994649,0.0004920658,0.000582613],"domain_scores_gemma":[0.9982748,0.0011051527,0.000093126546,0.00030285394,0.000039552244,0.00018448893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007151515,0.0003956283,0.00041066983,0.00014215615,0.00051888765,0.0003391196,0.0006077463,0.00027038145,0.00008747826],"category_scores_gemma":[0.0002730729,0.00030235713,0.00009322743,0.00014755236,0.00113166,0.0003879072,0.00018621224,0.00044476462,0.000050276434],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005380978,0.000016738508,0.0037449228,0.00020780099,0.000032740852,0.00010353852,0.004702603,0.009742338,0.00005368247,0.0019790037,0.0001094797,0.97925335],"study_design_scores_gemma":[0.001764049,0.0017527622,0.02873325,0.0019599607,0.0001258849,0.00018542379,0.00032075436,0.6825554,0.00044982,0.26009193,0.017352125,0.0047086403],"about_ca_topic_score_codex":0.00016156535,"about_ca_topic_score_gemma":0.0028107374,"teacher_disagreement_score":0.9745447,"about_ca_system_score_codex":0.00003114391,"about_ca_system_score_gemma":0.00006106685,"threshold_uncertainty_score":0.99994284},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028950209,0.00008070763,0.9916136,0.00091790233,0.001192049,0.000474087,0.000014469878,0.000060488717,0.0027516312],"genre_scores_gemma":[0.9585901,0.00033865977,0.038009953,0.00039419878,0.00079443527,0.00005248681,0.000041022802,0.000049330443,0.0017298523],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983476,0.000030068786,0.00027827715,0.0005583918,0.0003460237,0.0004396339],"domain_scores_gemma":[0.99854195,0.0009833941,0.00017112387,0.00013812754,0.000084902196,0.000080524886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012519687,0.00015702928,0.00022721825,0.00026857603,0.0001339158,0.00034618608,0.00024889622,0.00013689497,0.00001198842],"category_scores_gemma":[0.000578345,0.00016040419,0.000043547294,0.0002133504,0.00013857159,0.0003691987,0.0001861004,0.00023233138,0.0000044622343],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046340115,0.0000062125214,0.000045670968,0.000010730499,0.0000038664402,0.0000034404018,0.00817213,0.0012822958,0.00013754693,0.007673048,0.0000021250933,0.9826583],"study_design_scores_gemma":[0.00066636613,0.00016377865,0.0003774058,0.001872132,0.000043401775,9.3603546e-7,0.00019271366,0.24706881,0.0010568495,0.71509945,0.03262835,0.0008297911],"about_ca_topic_score_codex":0.00029428554,"about_ca_topic_score_gemma":0.01034821,"teacher_disagreement_score":0.9818285,"about_ca_system_score_codex":0.00018298025,"about_ca_system_score_gemma":0.0001891029,"threshold_uncertainty_score":0.65410936},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49442017,0.0029077071,0.091101386,0.014473088,0.015493503,0.0101911,0.0007775454,0.0031481832,0.3674873],"genre_scores_gemma":[0.9828472,0.00009856432,0.00394652,0.0010814468,0.0005435821,0.000037254584,0.00001270647,0.00007440407,0.011358317],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992227,0.00025791113,0.0011953595,0.0027420155,0.0022556481,0.0013220431],"domain_scores_gemma":[0.99420524,0.0027290094,0.0003591501,0.0019488478,0.0004269438,0.00033083916],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0069562905,0.00065474835,0.0009565831,0.0010616309,0.0004736803,0.0011349261,0.0033809924,0.00069645455,0.0003230783],"category_scores_gemma":[0.0041332915,0.00063605874,0.00030116277,0.0016053388,0.0069432175,0.002071765,0.0016229514,0.0011561635,0.00017660104],"study_design_candidate":"theoretical_or_conceptual","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.00030172055,0.0005919065,0.08628984,0.00057054043,0.000040328694,0.00017552322,0.06391142,0.0012845952,0.000053062882,0.027353399,0.00034211474,0.81908554],"study_design_scores_gemma":[0.0003076576,0.00010837786,0.038294226,0.00061231334,0.000010111347,0.000001837317,0.000037018195,0.0018169517,0.00024548726,0.9554928,0.0021074747,0.0009657377],"about_ca_topic_score_codex":0.0016628038,"about_ca_topic_score_gemma":0.028086618,"teacher_disagreement_score":0.9281394,"about_ca_system_score_codex":0.0018419406,"about_ca_system_score_gemma":0.0025554798,"threshold_uncertainty_score":0.999902},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041882248,0.00015975554,0.9959749,0.00016978884,0.0014416156,0.0007978931,0.0000041278677,0.00018942663,0.00084365305],"genre_scores_gemma":[0.012288786,0.000044463246,0.9868193,0.00031573584,0.00023242182,0.000082397484,0.000003424401,0.00005292169,0.00016053944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957811,0.00009322363,0.000755319,0.002061123,0.0004976783,0.00081150857],"domain_scores_gemma":[0.9960192,0.0020027258,0.0004381921,0.0012200653,0.00018102396,0.00013881609],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005427681,0.00050394656,0.0006701624,0.0015642205,0.00026597898,0.0006191151,0.0031513763,0.00032407328,0.0000021889055],"category_scores_gemma":[0.0009090357,0.00050983037,0.00010441668,0.0010018015,0.000276979,0.0009493814,0.0022223338,0.0008083132,0.0000061811547],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073770175,0.0000059811264,0.00005285646,0.00005997989,0.000009185817,0.000013071524,0.0035545724,0.011070091,0.0008912078,0.21167856,8.886156e-7,0.7726562],"study_design_scores_gemma":[0.0001913176,0.000083414714,0.000099923636,0.00036312905,0.0000037398918,0.000019056053,0.000001135328,0.6261229,0.0058816294,0.36680079,0.000069340065,0.00036362174],"about_ca_topic_score_codex":0.000030774758,"about_ca_topic_score_gemma":0.00002968891,"teacher_disagreement_score":0.7722926,"about_ca_system_score_codex":0.00039050274,"about_ca_system_score_gemma":0.00018479589,"threshold_uncertainty_score":0.99973536},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027231037,0.00013174838,0.99198455,0.0003510359,0.0051675853,0.0007367514,0.000010465957,0.0004556044,0.0011350034],"genre_scores_gemma":[0.2798489,0.00006146171,0.7090302,0.0011373184,0.0049821045,0.00006732226,0.00037606334,0.00017617644,0.0043204157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631876,0.00003686033,0.00044332398,0.0018675528,0.0007401137,0.0005934053],"domain_scores_gemma":[0.996349,0.00019831907,0.00028391826,0.0027195371,0.00028624095,0.00016298369],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016234227,0.0003946181,0.0004352995,0.0005299221,0.00028690026,0.0007765783,0.005576374,0.00035280446,0.000004554813],"category_scores_gemma":[0.00018287831,0.00033485997,0.000074901676,0.00063539227,0.00030633918,0.0011231796,0.0021369425,0.00042340954,0.00005755109],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044667054,0.000024735164,0.000022822753,0.0000623064,0.000013473776,0.00002245389,0.000546438,0.00198696,0.00003424704,0.23229887,0.000043233253,0.76494],"study_design_scores_gemma":[0.00026606536,0.000391629,0.00016066471,0.000058406127,0.00001428885,0.00006247872,4.958949e-7,0.5311479,0.0002800805,0.43985057,0.027077489,0.00068993523],"about_ca_topic_score_codex":0.00008518343,"about_ca_topic_score_gemma":0.00031304508,"teacher_disagreement_score":0.76425004,"about_ca_system_score_codex":0.00014503846,"about_ca_system_score_gemma":0.000682924,"threshold_uncertainty_score":0.99991035},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025441046,0.00011469456,0.99087834,0.00018200841,0.0045204954,0.0005598867,0.000063108426,0.00031275477,0.00082461425],"genre_scores_gemma":[0.95384634,0.0001304611,0.04009458,0.0025728603,0.0024655452,0.000015318103,0.00027247978,0.00020023517,0.0004021556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949805,0.00016751942,0.00058118365,0.0024958837,0.0009808016,0.0007940941],"domain_scores_gemma":[0.99727,0.0010910559,0.00037840003,0.0009986483,0.00009683204,0.00016509846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009531757,0.00065094867,0.00054693257,0.00075527624,0.00043292934,0.00064004055,0.0024585368,0.00028697113,0.000014492967],"category_scores_gemma":[0.00045822666,0.00056113634,0.00012723138,0.0006549997,0.0006464585,0.00050904445,0.0021813076,0.0022777095,0.00003916707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033180233,0.000048955582,0.000011576976,0.000034137265,0.0000058223955,0.00008810207,0.00022219066,0.49526635,0.00060811307,0.000077310644,0.000019765559,0.5035845],"study_design_scores_gemma":[0.00021926584,0.0003901842,0.0000064258475,0.0005970152,0.000014587322,0.00014829669,5.062837e-7,0.9942737,0.0013422378,0.0022084613,0.00018732097,0.0006120059],"about_ca_topic_score_codex":0.00002253208,"about_ca_topic_score_gemma":0.00001885011,"teacher_disagreement_score":0.95130223,"about_ca_system_score_codex":0.00022520318,"about_ca_system_score_gemma":0.00010612103,"threshold_uncertainty_score":0.99968404},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011619962,0.0006480328,0.97773844,0.0011850907,0.0027763345,0.000499518,0.0000025271204,0.00073660136,0.01629728],"genre_scores_gemma":[0.7486246,0.00031876093,0.23841456,0.0054726447,0.002509675,0.00005061506,0.0000058734104,0.00017479238,0.004428428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937785,0.00008689476,0.0005311402,0.003041497,0.0014207714,0.0011411574],"domain_scores_gemma":[0.9950013,0.0013643953,0.00038693353,0.0022384971,0.00064178987,0.0003670806],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017434502,0.0008156525,0.000726656,0.0012879687,0.00062216795,0.0012774655,0.0061784093,0.00047766994,0.000023967998],"category_scores_gemma":[0.0007387605,0.0006952263,0.00023227374,0.0012791704,0.000850805,0.0015975557,0.0015090611,0.0015029181,0.00044649176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021386997,0.00007106086,0.00011334288,0.000053128595,0.000022081807,0.00043332536,0.0065010376,0.026726518,0.0003100224,0.75877106,0.000085655905,0.20689136],"study_design_scores_gemma":[0.00025369678,0.0010496713,0.00038492586,0.0015282555,0.0000127662815,0.00007588049,0.0000032549437,0.3654046,0.0008726864,0.628997,0.00027517093,0.0011420688],"about_ca_topic_score_codex":0.00009669889,"about_ca_topic_score_gemma":0.00016236703,"teacher_disagreement_score":0.74850845,"about_ca_system_score_codex":0.001035691,"about_ca_system_score_gemma":0.0008190816,"threshold_uncertainty_score":0.9997593},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014830893,0.00035802115,0.9948175,0.0010837361,0.0014795015,0.00023660854,0.0000029338041,0.0004169179,0.0014565062],"genre_scores_gemma":[0.05074912,0.00017783289,0.94032323,0.006554613,0.000647196,0.0000257927,0.00005470448,0.00003568591,0.001431839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789506,0.0000362963,0.00039055018,0.00063615077,0.0006059737,0.00043598993],"domain_scores_gemma":[0.9983766,0.000603246,0.00020614683,0.000558713,0.0001667865,0.00008850005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070032384,0.00028614522,0.00033427155,0.0007915896,0.0001827506,0.0007884427,0.0015775049,0.00021271662,0.0000020016234],"category_scores_gemma":[0.00024169337,0.00024545068,0.000045492216,0.0009743972,0.00042620584,0.0011655372,0.0011670017,0.0003806015,0.00010140919],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017169996,0.000008299985,0.000100178695,0.00007610978,0.0000062790823,0.000050737937,0.0030681263,0.012777341,0.000009427457,0.006713364,0.0007519406,0.9764365],"study_design_scores_gemma":[0.00029634943,0.00011897046,0.002462719,0.00021114276,0.000005596821,0.00008183984,0.0000028198408,0.7246821,0.0001563407,0.2705241,0.0009150841,0.0005429223],"about_ca_topic_score_codex":0.00003608013,"about_ca_topic_score_gemma":0.00007350455,"teacher_disagreement_score":0.97589356,"about_ca_system_score_codex":0.00015385967,"about_ca_system_score_gemma":0.0005835247,"threshold_uncertainty_score":0.99999976},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025454327,0.00006776711,0.9959854,0.0013123563,0.0008132124,0.00036153928,0.000002317148,0.00019875621,0.0012332284],"genre_scores_gemma":[0.0015631415,0.000027233553,0.9965593,0.0007553755,0.00030319326,0.000016891014,0.000001419,0.00004614831,0.0007272954],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579567,0.000111189365,0.0006576321,0.0015723018,0.0010977953,0.00076543237],"domain_scores_gemma":[0.99729806,0.0010730171,0.00019916135,0.0011921969,0.00003145489,0.00020611653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023642713,0.00050342374,0.00071476493,0.00076699746,0.00016439702,0.00025562383,0.0028450114,0.00028838147,0.000033744498],"category_scores_gemma":[0.00021330162,0.00042749254,0.00014808874,0.00049297424,0.00031705925,0.00032217984,0.0021388135,0.0013975278,0.0002767604],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022837826,0.0000468539,0.000002460317,0.00003313969,0.000006139191,0.00021008187,0.0005774764,0.0037209077,0.00019841843,0.1283442,0.0000022838126,0.86685574],"study_design_scores_gemma":[0.0001489784,0.00007589762,0.0000074413515,0.00020950712,0.000002433179,0.000021234719,1.4210016e-7,0.49720198,0.00025727277,0.5014173,0.00033923352,0.00031862638],"about_ca_topic_score_codex":0.000025005638,"about_ca_topic_score_gemma":0.000004774419,"teacher_disagreement_score":0.86653715,"about_ca_system_score_codex":0.00027038064,"about_ca_system_score_gemma":0.00015974276,"threshold_uncertainty_score":0.99981767},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017867934,0.000263537,0.9882565,0.0013209328,0.0015614261,0.0004306464,0.000016710623,0.00077714375,0.007194388],"genre_scores_gemma":[0.22006609,0.00020414071,0.76705503,0.0036085397,0.00161659,0.00005159266,0.00003067732,0.00019253933,0.0071748076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99484605,0.000044537857,0.00062173273,0.0021867515,0.0013749432,0.0009259835],"domain_scores_gemma":[0.9964074,0.0008404621,0.00042253017,0.0018987498,0.0002266069,0.0002042479],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015678538,0.0006430896,0.0005900066,0.00087599905,0.00038238958,0.0010385455,0.0047662724,0.00029972417,0.000007783798],"category_scores_gemma":[0.00014188705,0.0004867509,0.000114846305,0.0011024623,0.0010192705,0.0009291793,0.0015878718,0.0008598869,0.00013299863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025004447,0.000024232435,0.000038012404,0.000088430024,0.000025882626,0.0007138642,0.002037084,0.019866837,0.00016357841,0.07298739,0.00009743361,0.9039323],"study_design_scores_gemma":[0.0007468824,0.00063018245,0.00036098948,0.0027272338,0.000017573999,0.00029861552,0.0000012405723,0.6092213,0.0024020658,0.37907335,0.0026936783,0.0018269035],"about_ca_topic_score_codex":0.00008160618,"about_ca_topic_score_gemma":0.00019048914,"teacher_disagreement_score":0.90210533,"about_ca_system_score_codex":0.0002410065,"about_ca_system_score_gemma":0.00082868023,"threshold_uncertainty_score":0.99999845},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031257896,0.0009683252,0.98287046,0.00032514238,0.0053951,0.00036340771,0.0000041055437,0.00075424055,0.009287955],"genre_scores_gemma":[0.6251538,0.00014571706,0.361336,0.0026447996,0.0028586192,0.00005379731,0.000042264946,0.00020926712,0.0075557544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956133,0.00008980452,0.0006035703,0.001830422,0.00104258,0.0008203229],"domain_scores_gemma":[0.9957648,0.0018406337,0.0004191165,0.0016268697,0.00014867137,0.00019991398],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014385858,0.00059188035,0.0006158237,0.000763799,0.00042588412,0.001660298,0.004303987,0.00043696433,0.00003477529],"category_scores_gemma":[0.00021295549,0.00049854163,0.00021345272,0.0008371914,0.00077368633,0.0011227005,0.0018395457,0.0009453252,0.00027182486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003430486,0.000011856325,0.000065639084,0.000019530913,0.000019140967,0.00015170536,0.0011910205,0.00059995765,0.00003485522,0.57786655,0.00003486862,0.42000145],"study_design_scores_gemma":[0.00014401965,0.00008336308,0.00011712424,0.00009274463,0.000009104182,0.00002751072,0.0000010433622,0.03205236,0.0005034831,0.9626236,0.0037437833,0.00060187036],"about_ca_topic_score_codex":0.00011041685,"about_ca_topic_score_gemma":0.00009447977,"teacher_disagreement_score":0.62512255,"about_ca_system_score_codex":0.000104428866,"about_ca_system_score_gemma":0.00045940946,"threshold_uncertainty_score":0.9997466},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030749306,0.0001569152,0.992052,0.000034130255,0.002213186,0.0001970652,0.0000024278236,0.0006821785,0.004354564],"genre_scores_gemma":[0.07348085,0.0004065802,0.9029193,0.00026119742,0.0026533965,0.00012165122,0.000073031835,0.0004682198,0.019615788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845296,0.000009944869,0.0002377664,0.0004383585,0.0004797474,0.00038124368],"domain_scores_gemma":[0.9991877,0.0001683273,0.000027320348,0.00045731082,0.00009215787,0.000067152236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042704106,0.00027230827,0.00026125813,0.00067110243,0.000055165485,0.00013681735,0.00076473004,0.00015897337,0.000007717543],"category_scores_gemma":[0.000042151394,0.00026404328,0.000037927355,0.001555519,0.00009377227,0.000121724544,0.00014243473,0.0003707516,0.000045611396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.9491305e-7,0.0000021116953,0.000008079844,0.00040452727,0.0000070702117,0.000029961207,0.000095323194,0.8977941,0.000004562574,0.000032058644,0.0000897381,0.10153182],"study_design_scores_gemma":[0.000119333046,0.0000061652895,0.00031072993,0.0003578901,0.0000048989878,0.0000036319439,8.679305e-8,0.9809752,0.00011342878,0.016508805,0.0012926983,0.00030714125],"about_ca_topic_score_codex":8.5367645e-7,"about_ca_topic_score_gemma":0.0000030926196,"teacher_disagreement_score":0.101224676,"about_ca_system_score_codex":0.0002230885,"about_ca_system_score_gemma":0.000087947985,"threshold_uncertainty_score":0.99998116},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048830863,0.000066644294,0.9927058,0.0006595518,0.00031525563,0.00029393408,0.0000057406096,0.000159241,0.00091070205],"genre_scores_gemma":[0.99738586,0.000008848134,0.0012185713,0.00045094738,0.00070230226,0.0000090373405,0.000027415765,0.00005987994,0.00013712276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660504,0.000010479676,0.00079446443,0.0008744336,0.0013281524,0.00038745228],"domain_scores_gemma":[0.99615794,0.0003012022,0.000832541,0.0006422979,0.0020485749,0.000017414488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015167502,0.00042932548,0.00059085945,0.0009204796,0.00040771218,0.00043671564,0.0010836521,0.00023292258,0.000006423485],"category_scores_gemma":[0.00036715655,0.00032710697,0.00013783535,0.0018472681,0.00035942325,0.0011893812,0.00039241204,0.0003984559,0.000006973174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015299516,0.000014665841,0.00010614209,0.00045870832,0.000013261736,0.0000010820003,0.00023852487,0.94576985,0.000012363037,0.0025047378,3.4739028e-7,0.050865006],"study_design_scores_gemma":[0.00012506238,0.0000016634639,0.00009969881,0.00032595935,0.00004495763,1.4586313e-7,0.0000013693167,0.73337746,0.00001060882,0.26571935,0.0000045699567,0.0002891612],"about_ca_topic_score_codex":0.00041694526,"about_ca_topic_score_gemma":0.00029540365,"teacher_disagreement_score":0.9925028,"about_ca_system_score_codex":0.00008866846,"about_ca_system_score_gemma":0.00025171632,"threshold_uncertainty_score":0.9999181},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024243876,0.0005291535,0.9948326,0.00031651682,0.0032234236,0.00037904264,0.00013502661,0.00019117515,0.00015064662],"genre_scores_gemma":[0.58730674,0.00057233486,0.32465172,0.006753991,0.060634114,0.00028472047,0.012206712,0.0009941636,0.006595512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964256,0.0000053077256,0.0005668552,0.0016809709,0.0008065729,0.0005146753],"domain_scores_gemma":[0.997683,0.00013108643,0.00041815735,0.0014333887,0.0002967831,0.000037614554],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008591204,0.0004875569,0.000593467,0.00071831036,0.00031815752,0.0014998803,0.002403158,0.00019327877,0.000013123169],"category_scores_gemma":[0.00007815621,0.0004240361,0.00012520548,0.0005321088,0.00016105468,0.001441452,0.0016859809,0.00029194402,0.000055171287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052022797,0.00003258292,0.000035280853,0.00022998515,0.00004839945,0.000030519484,0.000055905588,0.30475742,0.000021014666,0.0006474727,0.00010130612,0.69403493],"study_design_scores_gemma":[0.00019966783,0.000009437231,0.000023597751,0.0006713147,0.00011827652,0.0000012336045,0.000001920647,0.97517574,0.0000054659326,0.017240537,0.0060214936,0.00053131266],"about_ca_topic_score_codex":0.0019342253,"about_ca_topic_score_gemma":0.00054202776,"teacher_disagreement_score":0.6935036,"about_ca_system_score_codex":0.00010587716,"about_ca_system_score_gemma":0.00012095444,"threshold_uncertainty_score":0.9998211},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060527993,0.0002607284,0.9961532,0.0011571686,0.0009391745,0.0003899153,0.000022767126,0.00018128174,0.0008352857],"genre_scores_gemma":[0.13025437,0.00010631508,0.86053973,0.0013444157,0.0009532724,0.000034044824,0.000011129607,0.000085133484,0.006671609],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958371,0.00008378588,0.0006732188,0.0015758881,0.0014059781,0.00042402916],"domain_scores_gemma":[0.9948324,0.0033411004,0.00033171297,0.0010205616,0.00027451132,0.00019968887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037763733,0.0003853448,0.00049185473,0.00093782035,0.00057934975,0.00058671646,0.0017759025,0.00027909217,0.00009268793],"category_scores_gemma":[0.00074533484,0.00030171606,0.000107861546,0.0010987477,0.001192015,0.00027988123,0.00082254235,0.0007114688,0.00046219252],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052482897,0.000010467008,0.00000926254,0.0000034015013,0.0000056018907,0.000020519949,0.000285976,0.058614243,0.000047567115,0.010780429,0.000027344042,0.93018997],"study_design_scores_gemma":[0.00012799805,0.000056135235,0.000046486013,0.000059436457,0.0000063261746,0.00004973515,0.000001330022,0.41098976,0.0003187785,0.58631253,0.0017371888,0.0002943095],"about_ca_topic_score_codex":0.000006317681,"about_ca_topic_score_gemma":0.00001637414,"teacher_disagreement_score":0.92989564,"about_ca_system_score_codex":0.00007870903,"about_ca_system_score_gemma":0.00020796478,"threshold_uncertainty_score":0.9999435},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013581457,0.00011792607,0.9908291,0.0006634151,0.0011950826,0.00026125362,0.000005267762,0.000088572655,0.0054812324],"genre_scores_gemma":[0.9890929,0.000031597796,0.0059836935,0.0009421359,0.00041610998,0.0000058240107,0.000003087188,0.000025657973,0.0034990322],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959693,0.00006980284,0.00060102466,0.0013582408,0.0014757941,0.0005258449],"domain_scores_gemma":[0.99502766,0.0032549507,0.00027742263,0.0011294432,0.00018677289,0.00012373958],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004118064,0.00030972017,0.000476782,0.0013374854,0.0006753009,0.0003482412,0.0034669805,0.0002768013,0.0001134804],"category_scores_gemma":[0.00058560446,0.00025932107,0.00013116316,0.0018382883,0.0009003124,0.00028711048,0.0043268586,0.0008382662,0.00034369028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011167688,0.000021787338,0.0026709887,0.000005619703,0.000005655566,0.00008475105,0.0021838653,0.32567936,0.000025643087,0.038328264,0.00012878461,0.6308541],"study_design_scores_gemma":[0.000114536364,0.00002758975,0.0028576166,0.00015222467,0.0000041222956,0.000007985417,0.0000018264944,0.20242052,0.000027827346,0.79246247,0.00160786,0.00031542234],"about_ca_topic_score_codex":0.000029505936,"about_ca_topic_score_gemma":0.00036475304,"teacher_disagreement_score":0.98773474,"about_ca_system_score_codex":0.00013443355,"about_ca_system_score_gemma":0.000142791,"threshold_uncertainty_score":0.9999859},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07684007,0.000017472645,0.92170405,0.0007950375,0.000042772077,0.0004870713,0.00004844823,0.00005501185,0.0000100833495],"genre_scores_gemma":[0.9564318,0.000012380134,0.042498425,0.00066179736,0.000023144003,0.000049377104,0.00031579594,0.000005346528,0.000001932386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872476,0.000031190026,0.00025990314,0.0004042521,0.00031829887,0.00026159734],"domain_scores_gemma":[0.9990717,0.00015143058,0.000068487825,0.00056570035,0.000088461406,0.00005421367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005741883,0.00010309148,0.00029412005,0.0005904145,0.000101870246,0.000024997125,0.0003557975,0.000043149124,0.0000050461285],"category_scores_gemma":[0.00007466948,0.000078201054,0.000056947854,0.0077107656,0.00016684411,0.00008123689,0.000103662096,0.00012245195,0.0000028958239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011158464,0.000061668936,0.003701709,0.000015560847,0.000012366383,0.0000064383757,0.000572101,0.93738264,0.022412064,0.000142108,0.00007153541,0.03561066],"study_design_scores_gemma":[0.00022069605,0.000119548255,0.013857095,0.00006442678,0.00006655105,0.0000010572106,0.0000113618335,0.9634135,0.019526659,0.0023575907,0.00023551635,0.00012605097],"about_ca_topic_score_codex":0.00028522252,"about_ca_topic_score_gemma":0.00061251724,"teacher_disagreement_score":0.8795917,"about_ca_system_score_codex":0.00010627793,"about_ca_system_score_gemma":0.00006862913,"threshold_uncertainty_score":0.37047672},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050050025,0.00019968447,0.9890464,0.0008970477,0.0013694408,0.00043780304,0.000021919546,0.00062964985,0.007393075],"genre_scores_gemma":[0.01088863,0.000023310156,0.9835996,0.0036683274,0.00055044325,0.000026817277,0.000033383454,0.00011693709,0.0010925691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937368,0.00012226262,0.00067913986,0.002879586,0.0014568707,0.0011253506],"domain_scores_gemma":[0.9952201,0.0006339964,0.00035210533,0.0030576799,0.00028487286,0.0004512205],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001910354,0.00089306675,0.00080627436,0.0012081062,0.00039279502,0.0009738348,0.006059755,0.0008562116,0.00001099355],"category_scores_gemma":[0.00008627736,0.0008238269,0.00029803117,0.0012331059,0.0006922138,0.0009081239,0.0014095154,0.0016099755,0.0000482302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007438656,0.000053520755,0.0000031773043,0.000070602975,0.000012323399,0.000078451754,0.0006233314,0.44814947,0.000048983355,0.16269194,0.00006618905,0.38819456],"study_design_scores_gemma":[0.00020691908,0.00011994211,0.0000043108666,0.00014823605,0.000011469515,0.00001766106,5.2141516e-8,0.6955863,0.00040911778,0.30254525,0.00028156393,0.00066911994],"about_ca_topic_score_codex":0.000016844135,"about_ca_topic_score_gemma":0.000038312417,"teacher_disagreement_score":0.38752544,"about_ca_system_score_codex":0.00015738503,"about_ca_system_score_gemma":0.0011685529,"threshold_uncertainty_score":0.99942124},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000914612,0.00017355965,0.99273396,0.0012253853,0.0041835266,0.00056678755,0.000018102397,0.00030380752,0.00070339785],"genre_scores_gemma":[0.01563171,0.00003351158,0.9792724,0.0008037314,0.0016429281,0.000031110536,0.000014928363,0.000046050405,0.0025235824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962635,0.000014384576,0.00058098533,0.0017638236,0.0007548259,0.00062249746],"domain_scores_gemma":[0.9972254,0.00076606136,0.00025200332,0.001386512,0.00023206948,0.00013796601],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005499564,0.0004576583,0.0004788805,0.0004605127,0.00023582665,0.00044336735,0.002571154,0.0004688227,0.0000060160955],"category_scores_gemma":[0.00012194012,0.0004511383,0.000175836,0.00026602892,0.00017965298,0.00070560345,0.0008953154,0.0007066015,0.000022762359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041750095,0.000017323217,0.0000035576738,0.000019771926,0.000009625659,0.000013962652,0.00064124155,0.37115803,0.00015493664,0.042434648,0.000008190159,0.5855345],"study_design_scores_gemma":[0.00027910684,0.000039916933,0.00002208178,0.00012452387,0.0000059186455,0.000008446872,2.323167e-7,0.7183104,0.00029165897,0.27975327,0.0008142239,0.00035018957],"about_ca_topic_score_codex":0.00014634931,"about_ca_topic_score_gemma":0.00021580154,"teacher_disagreement_score":0.58518434,"about_ca_system_score_codex":0.00021012426,"about_ca_system_score_gemma":0.0004002473,"threshold_uncertainty_score":0.99979407},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014820798,0.00036637014,0.99212044,0.00026960555,0.0041980334,0.00039190124,0.000025340149,0.00017217749,0.0023079473],"genre_scores_gemma":[0.6934147,0.006323997,0.09057694,0.06789738,0.09156187,0.0007079778,0.01629927,0.001162343,0.032055553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799055,0.0000049770865,0.00044432268,0.0005411719,0.00062776706,0.00039122946],"domain_scores_gemma":[0.99869984,0.00014699624,0.0002910106,0.0005698607,0.0002709105,0.000021378133],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007794268,0.0003096688,0.00029534602,0.0011663574,0.00019190824,0.0017230025,0.0009947813,0.00017086316,0.000023633444],"category_scores_gemma":[0.00025605544,0.00026497632,0.00003220469,0.0012537062,0.00038515482,0.003372942,0.0014076517,0.0003922538,0.00061095227],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000179539,0.000025746496,0.000482221,0.0020797793,0.00001361915,0.000039531296,0.0001641342,0.019833032,0.000020619951,0.01112673,0.007682579,0.95851403],"study_design_scores_gemma":[0.00015664686,0.000014955331,0.00028694732,0.0017693058,0.000029874103,0.00002364722,0.000002626071,0.7553085,0.00005887546,0.019943008,0.22158755,0.0008180466],"about_ca_topic_score_codex":0.00032717735,"about_ca_topic_score_gemma":0.0001226059,"teacher_disagreement_score":0.957696,"about_ca_system_score_codex":0.0001158191,"about_ca_system_score_gemma":0.00021061489,"threshold_uncertainty_score":0.9999803},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014820798,0.00036637014,0.99212044,0.00026960555,0.0041980334,0.00039190124,0.000025340149,0.00017217749,0.0023079473],"genre_scores_gemma":[0.6934147,0.006323997,0.09057694,0.06789738,0.09156187,0.0007079778,0.01629927,0.001162343,0.032055553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799055,0.0000049770865,0.00044432268,0.0005411719,0.00062776706,0.00039122946],"domain_scores_gemma":[0.99869984,0.00014699624,0.0002910106,0.0005698607,0.0002709105,0.000021378133],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007794268,0.0003096688,0.00029534602,0.0011663574,0.00019190824,0.0017230025,0.0009947813,0.00017086316,0.000023633444],"category_scores_gemma":[0.00025605544,0.00026497632,0.00003220469,0.0012537062,0.00038515482,0.003372942,0.0014076517,0.0003922538,0.00061095227],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000179539,0.000025746496,0.000482221,0.0020797793,0.00001361915,0.000039531296,0.0001641342,0.019833032,0.000020619951,0.01112673,0.007682579,0.95851403],"study_design_scores_gemma":[0.00015664686,0.000014955331,0.00028694732,0.0017693058,0.000029874103,0.00002364722,0.000002626071,0.7553085,0.00005887546,0.019943008,0.22158755,0.0008180466],"about_ca_topic_score_codex":0.00032717735,"about_ca_topic_score_gemma":0.0001226059,"teacher_disagreement_score":0.957696,"about_ca_system_score_codex":0.0001158191,"about_ca_system_score_gemma":0.00021061489,"threshold_uncertainty_score":0.9999803},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011351122,0.00007168924,0.9956511,0.00039204137,0.00051264034,0.0017601477,0.000052920284,0.00022410612,0.0012218232],"genre_scores_gemma":[0.63220346,0.000006175706,0.3495724,0.0005859954,0.010548058,0.0007940934,0.00057917926,0.0001995194,0.0055110916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672496,0.000050385614,0.00063853426,0.0010555778,0.0006510008,0.0008795412],"domain_scores_gemma":[0.99773943,0.00056507636,0.00063752156,0.0005605908,0.00037908793,0.00011826162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014084997,0.0005107558,0.0006583543,0.00039447617,0.00041324212,0.00026949763,0.0008690865,0.00030503428,0.00007875667],"category_scores_gemma":[0.000042341984,0.00052118197,0.00040908385,0.0007097155,0.0003309727,0.00014623711,0.0004077249,0.000763013,0.00001353335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004550836,0.000054622607,0.0010446603,0.00004364002,0.00029021254,0.0000052150876,0.00007738046,0.54204416,0.00010380996,0.2267867,0.0015923359,0.22791177],"study_design_scores_gemma":[0.00026727456,0.00006973337,0.000055490644,0.00036425845,0.000033808657,5.6008105e-7,1.18560145e-7,0.42882678,0.000054535867,0.5689813,0.00091160386,0.00043451926],"about_ca_topic_score_codex":0.000055465363,"about_ca_topic_score_gemma":0.00013490803,"teacher_disagreement_score":0.6460787,"about_ca_system_score_codex":0.00034610965,"about_ca_system_score_gemma":0.0003325253,"threshold_uncertainty_score":0.999724},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011971067,0.000013236105,0.9960095,0.001501114,0.0008872649,0.0010174918,0.0000058350006,0.00034458126,0.00021973855],"genre_scores_gemma":[0.35455987,0.0000033658412,0.6427855,0.0012344106,0.00042453417,0.000055064884,0.00003980728,0.00007598224,0.00082147226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964967,0.000030510799,0.00051623856,0.001186056,0.001017698,0.00075279735],"domain_scores_gemma":[0.9968965,0.0010165519,0.0003954096,0.0011028037,0.0004206031,0.00016812877],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003489279,0.0005288715,0.00051060016,0.0012106075,0.00039690326,0.00076642865,0.0023052294,0.00024604317,0.0000059925937],"category_scores_gemma":[0.0002546618,0.00046121582,0.00014542002,0.00078749936,0.00044835982,0.000473662,0.0003677889,0.0005281125,0.0000109077355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013312975,0.000015547994,0.0000050575954,0.00003325493,0.000013650092,0.000005930549,0.000113192495,0.9644946,0.000011439756,0.025336908,0.0000039932497,0.009953125],"study_design_scores_gemma":[0.0009060277,0.0004092178,0.000007710353,0.00016960452,0.000026478496,0.0000044857256,4.93909e-8,0.9896081,0.000035966943,0.008316916,0.000006502275,0.00050894223],"about_ca_topic_score_codex":0.000010792681,"about_ca_topic_score_gemma":0.000021296637,"teacher_disagreement_score":0.35455868,"about_ca_system_score_codex":0.0003433249,"about_ca_system_score_gemma":0.001214238,"threshold_uncertainty_score":0.99978393},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000061040926,0.0011612859,0.98392606,0.00044358996,0.009432488,0.00034678553,0.0000026893194,0.00110887,0.00351721],"genre_scores_gemma":[0.11707906,0.0005277242,0.8229282,0.004123002,0.006618598,0.00017669833,0.00003206209,0.00030697818,0.048207685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565333,0.00006294599,0.0005425036,0.0016537992,0.0010921069,0.0009953303],"domain_scores_gemma":[0.99675155,0.0008901502,0.00023442559,0.0017952402,0.00017498893,0.00015365955],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012437096,0.0004990377,0.0006627973,0.0011021629,0.00027015698,0.0012191631,0.005204234,0.00036628117,0.0000026327205],"category_scores_gemma":[0.00019939925,0.00044063354,0.00012887018,0.0018413786,0.0005155071,0.00069321133,0.0020939775,0.00072935113,0.0002047631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006219681,0.00005560212,0.00039845973,0.0005056256,0.000041221254,0.00093600305,0.0021065385,0.27186638,0.00022289545,0.029169204,0.00290804,0.69178385],"study_design_scores_gemma":[0.00024914593,0.00015665186,0.0005596102,0.001185382,0.000008736507,0.00016211426,0.0000011279838,0.90361905,0.0010473272,0.087190025,0.004732179,0.0010886359],"about_ca_topic_score_codex":0.00010146831,"about_ca_topic_score_gemma":0.00007812993,"teacher_disagreement_score":0.69069517,"about_ca_system_score_codex":0.00046780784,"about_ca_system_score_gemma":0.0014327965,"threshold_uncertainty_score":0.99981767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021221764,0.0003985501,0.972125,0.00045794176,0.0025199924,0.000410833,0.000005717716,0.00034316524,0.023526575],"genre_scores_gemma":[0.5025165,0.00036200776,0.47809917,0.0029243007,0.0018490823,0.000089454195,0.000043506938,0.00022906583,0.013886911],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99481326,0.00016283696,0.000705221,0.0021142599,0.0011209043,0.0010835129],"domain_scores_gemma":[0.9963639,0.0013952842,0.00035366113,0.0013858163,0.00027139272,0.00022994628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002793113,0.000663517,0.0007670742,0.0013257241,0.00026466785,0.00055597216,0.0040925005,0.00041237063,0.000024734722],"category_scores_gemma":[0.0006139093,0.00059477816,0.0001884907,0.0016474909,0.000740953,0.0006197197,0.002055988,0.0012085672,0.00030018456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014999322,0.00007368309,0.00018924901,0.00009040298,0.000029754256,0.0006962023,0.05124705,0.043915633,0.00004317295,0.4185114,0.00015561243,0.48503286],"study_design_scores_gemma":[0.0005576738,0.0002094428,0.00050050433,0.0010878056,0.000007361575,0.000043183012,0.000009409561,0.4881972,0.00015035478,0.5064574,0.0015742292,0.0012054084],"about_ca_topic_score_codex":0.000171916,"about_ca_topic_score_gemma":0.0010022015,"teacher_disagreement_score":0.50230426,"about_ca_system_score_codex":0.00065661536,"about_ca_system_score_gemma":0.00076018437,"threshold_uncertainty_score":0.99965036},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002623951,0.00005035457,0.9927163,0.00036985776,0.0012244284,0.0005568345,2.2039823e-7,0.0005631367,0.004256434],"genre_scores_gemma":[0.6191608,0.00019760214,0.3716422,0.0011043282,0.0007873236,0.000063938984,0.000030274046,0.00020331256,0.0068102395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99487156,0.0000734806,0.00083808805,0.001566872,0.001598723,0.0010512754],"domain_scores_gemma":[0.9971562,0.00069377007,0.0006441565,0.001117127,0.0002237154,0.00016503042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014305,0.0006804811,0.0006912414,0.0015368273,0.00039250185,0.0007773743,0.002454758,0.00031198186,0.000014676283],"category_scores_gemma":[0.00026168654,0.0006110641,0.000110736364,0.0012489271,0.00042683756,0.0009494318,0.0014307499,0.0018218203,0.00008156888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109279945,0.000005778495,0.0006427105,0.0000475105,0.000011961455,0.0001772359,0.0011658667,0.8598932,0.000038926126,0.0040142704,0.0000026324353,0.13398899],"study_design_scores_gemma":[0.00052812893,0.00043785994,0.00030101143,0.00090099144,0.000008691947,0.00006487283,0.0000028806726,0.99140847,0.00018044809,0.0050163674,0.00040276657,0.00074749143],"about_ca_topic_score_codex":0.00007933777,"about_ca_topic_score_gemma":0.00027690205,"teacher_disagreement_score":0.62107414,"about_ca_system_score_codex":0.0006432075,"about_ca_system_score_gemma":0.00038777868,"threshold_uncertainty_score":0.9996341},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012380104,0.000013430428,0.984719,0.00016824219,0.0007448636,0.0012862717,0.000003778894,0.009953564,0.0029870553],"genre_scores_gemma":[0.058342844,0.000003894262,0.9396712,0.0006818273,0.00038652937,0.00020651656,0.000013227855,0.000089328925,0.00060459424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957344,0.00006533949,0.0006189506,0.0018882897,0.00090633787,0.0007866915],"domain_scores_gemma":[0.9963238,0.00061509723,0.00028943122,0.0021921392,0.00030163553,0.00027788998],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0026812102,0.0005016983,0.00054969103,0.0008449458,0.0007140328,0.0023442665,0.0069909557,0.0002740594,0.0000027724218],"category_scores_gemma":[0.00026887126,0.00048802444,0.000059424878,0.0010544632,0.00016291784,0.0014680824,0.004187761,0.00052748737,0.00016756066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040679856,0.000017569271,0.000048050704,0.000064355874,0.0000056114404,0.000047794947,0.0012078257,0.030128269,0.0006828535,0.01301117,0.00015480845,0.95462763],"study_design_scores_gemma":[0.00013448496,0.00035720543,0.00009054257,0.0013933652,0.000005818377,0.00010698448,4.1845112e-7,0.971405,0.0009081396,0.024294086,0.000471645,0.0008322704],"about_ca_topic_score_codex":0.0002687535,"about_ca_topic_score_gemma":0.000018918794,"teacher_disagreement_score":0.9537954,"about_ca_system_score_codex":0.00044869128,"about_ca_system_score_gemma":0.00042920373,"threshold_uncertainty_score":0.9997572},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009273985,0.0012764758,0.9911352,0.0002159481,0.002498854,0.0003533667,0.000006999062,0.0015520975,0.0020336893],"genre_scores_gemma":[0.8800611,0.00051408476,0.11781374,0.00019781262,0.0010344175,0.000031359832,0.0000058151813,0.00015919436,0.00018248736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965499,0.00003818977,0.00092553266,0.0009970799,0.00086601055,0.00062329305],"domain_scores_gemma":[0.99450475,0.0044538244,0.00013010085,0.00061629823,0.000082948456,0.00021208127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022529676,0.0005296453,0.0007951325,0.00043489583,0.00013312671,0.00015153323,0.0009879504,0.0009623798,0.00001526506],"category_scores_gemma":[0.0018580417,0.000502692,0.00010592949,0.00049910217,0.00084282673,0.0001634312,0.0003991487,0.0017475833,0.000051012772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060465427,0.000013262248,0.0015289844,0.0005614422,0.00008885064,0.0014920891,0.00015289738,0.39699787,0.00017755615,0.0015860677,0.00013623245,0.5972587],"study_design_scores_gemma":[0.00025964758,0.00007312183,0.0013668089,0.0027184682,0.000016209482,0.0005466857,4.9691755e-7,0.98996985,0.00018058938,0.0019290671,0.0021259265,0.00081311085],"about_ca_topic_score_codex":0.00000711521,"about_ca_topic_score_gemma":0.000070865804,"teacher_disagreement_score":0.8791337,"about_ca_system_score_codex":0.00020499706,"about_ca_system_score_gemma":0.00027051708,"threshold_uncertainty_score":0.99974245},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031503144,0.000621027,0.99122226,0.00024057299,0.003993843,0.0014678899,0.00002218672,0.0005763655,0.001540803],"genre_scores_gemma":[0.99727833,0.000017106924,0.0017539752,0.00006974239,0.00049095845,0.0001448754,0.0000044469207,0.000091376365,0.00014919651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979773,0.000045277782,0.00045572975,0.0005231546,0.0005004182,0.00049811776],"domain_scores_gemma":[0.9985626,0.00035928885,0.000095410986,0.0008965635,0.000044372206,0.00004176738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013869981,0.00040820419,0.00033789212,0.00037933947,0.00018734587,0.00019581763,0.0011455492,0.00022295541,0.000003828582],"category_scores_gemma":[0.000046899517,0.0002728933,0.00008082268,0.00062090723,0.00011142333,0.00012992298,0.0001792252,0.0010879901,0.000071106035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020789205,0.0000075638445,0.000024888079,0.0005494334,0.000020659232,0.00068050745,0.001245633,0.9681276,0.00003124938,0.0010593982,0.00002009654,0.02823088],"study_design_scores_gemma":[0.00020963677,0.000023324603,0.00018936074,0.0010317694,0.0000082446895,0.001560143,0.0000034841564,0.9925764,0.00006862707,0.00053958583,0.003436349,0.00035306645],"about_ca_topic_score_codex":0.000093125615,"about_ca_topic_score_gemma":0.00039917522,"teacher_disagreement_score":0.99696326,"about_ca_system_score_codex":0.0005438282,"about_ca_system_score_gemma":0.000054883123,"threshold_uncertainty_score":0.99997234},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041412935,0.00016420288,0.9954127,0.00006597788,0.0025414543,0.00084773754,0.0000012703765,0.00022896523,0.00032354146],"genre_scores_gemma":[0.757369,0.000014860307,0.24176951,0.0000820544,0.00055371644,0.000067705754,0.0000043430978,0.00005736831,0.00008146595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625915,0.00006220421,0.0005288804,0.0017150168,0.000527703,0.00090702134],"domain_scores_gemma":[0.99802685,0.0006691668,0.00026802253,0.00075556606,0.00013125701,0.00014912002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012717072,0.0005335446,0.00057193695,0.00088539097,0.00034157676,0.0007952929,0.0019094277,0.00040866458,0.0000014939675],"category_scores_gemma":[0.00013862818,0.00053129235,0.00009896375,0.0009830474,0.0003415803,0.00086492306,0.0013535019,0.0014166121,0.000002363248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011944314,0.000009529998,0.00012423315,0.000051305502,0.0000044190556,0.000016074291,0.00027078515,0.72131294,0.000026380969,0.0008444939,1.5414393e-7,0.27732775],"study_design_scores_gemma":[0.00036721764,0.000098287586,0.00013762654,0.00024462465,0.0000071002673,0.000031903564,0.0000019804643,0.9774721,0.00013925291,0.020999605,0.000005200673,0.00049509096],"about_ca_topic_score_codex":0.000057589004,"about_ca_topic_score_gemma":0.00012903889,"teacher_disagreement_score":0.75695485,"about_ca_system_score_codex":0.00034126884,"about_ca_system_score_gemma":0.00012413759,"threshold_uncertainty_score":0.99971384},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023486714,0.00014653725,0.99403644,0.00026455708,0.0021608532,0.0004742561,0.000010729728,0.00028497612,0.00027295455],"genre_scores_gemma":[0.054539487,0.000029823033,0.9433223,0.0008139382,0.00070654356,0.000002277647,0.000008933279,0.00006021393,0.0005164955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968641,0.000020584155,0.0007433346,0.00096601044,0.00079650123,0.0006094766],"domain_scores_gemma":[0.99743,0.0006229133,0.0005070973,0.00076815527,0.00049995177,0.00017187811],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001270838,0.0004566716,0.00050389423,0.0007851289,0.0006705739,0.0011901516,0.0014784941,0.0002962326,0.0000043154523],"category_scores_gemma":[0.0004690835,0.00041726377,0.000109923996,0.00065453583,0.00051171787,0.0011210591,0.00097368815,0.0005146171,0.000009889852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064873406,0.000032613763,0.00007103182,0.0014987029,0.000070059425,0.00007616592,0.01312764,0.06763572,0.0008863293,0.5919454,0.00007335621,0.32451808],"study_design_scores_gemma":[0.00019244717,0.000061950595,0.000027250106,0.0003975498,0.000009829859,0.00011306199,5.962345e-7,0.7619684,0.00042235304,0.23626393,0.00015979321,0.00038284276],"about_ca_topic_score_codex":0.0000061899736,"about_ca_topic_score_gemma":0.000006498098,"teacher_disagreement_score":0.69433266,"about_ca_system_score_codex":0.0002071368,"about_ca_system_score_gemma":0.0005764929,"threshold_uncertainty_score":0.9998467},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029981553,0.00033276106,0.99386805,0.002505817,0.0013848516,0.0005007663,0.000012571623,0.0005260337,0.0005693294],"genre_scores_gemma":[0.08145567,0.0016508629,0.90252566,0.0045657596,0.0039911573,0.000088969515,0.00008469746,0.00022837566,0.005408825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99280024,0.00025992846,0.0008205183,0.0029461836,0.0019945155,0.001178607],"domain_scores_gemma":[0.99326664,0.0031098705,0.00021662845,0.0025277934,0.0004764753,0.00040258587],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004120884,0.0006291769,0.0009411347,0.0013162411,0.00048553705,0.0012173681,0.0048728925,0.00052289973,0.0000148595245],"category_scores_gemma":[0.000593982,0.0005645637,0.00023891333,0.0032022963,0.0017490921,0.00078268844,0.0066226847,0.0016497938,0.00014516905],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001198677,0.00011427235,0.00093204255,0.00035300382,0.000034064895,0.0001910015,0.0015417845,0.038562883,0.000008582994,0.0033694422,0.00092449645,0.9539564],"study_design_scores_gemma":[0.00022675058,0.00015052066,0.0006832096,0.0002711,0.00000782207,0.000036691195,1.3622103e-7,0.70848936,0.00005231302,0.28718692,0.002325047,0.0005701012],"about_ca_topic_score_codex":0.00007872117,"about_ca_topic_score_gemma":0.00014240276,"teacher_disagreement_score":0.95338637,"about_ca_system_score_codex":0.00072679453,"about_ca_system_score_gemma":0.001636938,"threshold_uncertainty_score":0.99981946},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013876714,0.0000147278815,0.99573374,0.00013155903,0.00019532461,0.0005820815,0.000018392604,0.00051948125,0.0026659458],"genre_scores_gemma":[0.41163486,0.000008500431,0.58727014,0.0009156891,0.000042165164,0.000019914882,0.000038096252,0.0000391777,0.00003146838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958509,0.00008025989,0.00068993453,0.0018017482,0.0011086935,0.00046842828],"domain_scores_gemma":[0.9961227,0.0009134409,0.00065761723,0.0015385009,0.0006370311,0.00013066431],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072941626,0.00053519435,0.0007384297,0.0018635951,0.0001650651,0.00014373162,0.0023763222,0.00041196047,0.0000048423626],"category_scores_gemma":[0.00017408501,0.0005031169,0.00015717116,0.001136178,0.00073537516,0.0006637916,0.00043288118,0.0007538704,0.000016225213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012829819,0.00015421721,0.0000104829305,0.000034001885,0.000012374334,0.000011762496,0.0003697708,0.641971,0.00069010054,0.0069423504,0.0000043051637,0.3497868],"study_design_scores_gemma":[0.00023655966,0.00034266643,0.00017335928,0.00043282812,0.000017102848,0.0000044062854,3.2935526e-7,0.870701,0.0015556215,0.12612925,0.0000019963554,0.00040485474],"about_ca_topic_score_codex":0.000007191013,"about_ca_topic_score_gemma":0.00001749794,"teacher_disagreement_score":0.41149607,"about_ca_system_score_codex":0.00018179278,"about_ca_system_score_gemma":0.0003665603,"threshold_uncertainty_score":0.99974203},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020839709,0.0000619287,0.99613047,0.00041645428,0.0009787343,0.00052436674,0.00006499625,0.00038229176,0.0012323462],"genre_scores_gemma":[0.007896792,0.000007782446,0.99008995,0.00040573042,0.00038936347,0.00003369229,0.00012551161,0.000058954738,0.0009922172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957206,0.000034830708,0.00057759456,0.0016597087,0.0013401521,0.0006670976],"domain_scores_gemma":[0.9971676,0.00041431494,0.0005749284,0.0013549217,0.00033598923,0.00015222961],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012226704,0.00047005407,0.0004524141,0.0009424715,0.0004632677,0.00091459736,0.0025224364,0.00035769015,0.0000064488167],"category_scores_gemma":[0.00008944047,0.000462653,0.00013117766,0.0012964144,0.00023061152,0.00027201814,0.0009773356,0.0005588088,0.000067949775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036622218,0.000057208996,0.000023365861,0.000041787684,0.000010866887,0.000010223285,0.00038034515,0.9032569,0.000050229257,0.014442254,0.000027392121,0.081695795],"study_design_scores_gemma":[0.0004000406,0.00003882906,0.00004376985,0.00016581325,0.000013775374,0.000005274559,3.802843e-7,0.9944539,0.00021565908,0.0034226289,0.00073952804,0.0005003711],"about_ca_topic_score_codex":0.00006865806,"about_ca_topic_score_gemma":0.000018794888,"teacher_disagreement_score":0.091197066,"about_ca_system_score_codex":0.00080677815,"about_ca_system_score_gemma":0.0007506327,"threshold_uncertainty_score":0.9997825},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021128715,0.00028503817,0.989631,0.000530015,0.0036971723,0.00045786132,0.000007885436,0.0006537361,0.004716162],"genre_scores_gemma":[0.088437796,0.00009638152,0.88624424,0.004358665,0.0029792248,0.00007494193,0.00006807028,0.00018199,0.017558707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99459225,0.00012951408,0.00065868197,0.0022052047,0.0013809275,0.0010334242],"domain_scores_gemma":[0.99445885,0.00323706,0.0003176512,0.001039567,0.0007124983,0.00023437174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014679915,0.0006234435,0.00064212334,0.001482162,0.0005141167,0.0008018958,0.004293857,0.0003573222,0.000011384786],"category_scores_gemma":[0.0003486449,0.0006266212,0.0001869092,0.004387381,0.00087553036,0.00042092268,0.0027548885,0.0013239057,0.00032981328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039658003,0.000030417017,0.000026587393,0.000020883941,0.000014153477,0.00011311009,0.0007990098,0.4200545,0.0000013299551,0.002718593,0.0007496794,0.57546777],"study_design_scores_gemma":[0.00009562349,0.00010729432,0.00017766688,0.00036319805,0.0000040763903,0.0000391379,1.6096651e-7,0.6281722,0.00006783079,0.37027726,0.00023720313,0.0004583168],"about_ca_topic_score_codex":0.000009630416,"about_ca_topic_score_gemma":0.00004004995,"teacher_disagreement_score":0.57500947,"about_ca_system_score_codex":0.0011567498,"about_ca_system_score_gemma":0.00415546,"threshold_uncertainty_score":0.99961853},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050732137,0.000055618744,0.98970646,0.002111942,0.005542968,0.0007424361,0.000023028088,0.00052385346,0.0012886275],"genre_scores_gemma":[0.04602026,0.000020176745,0.95060337,0.00084207923,0.0014799854,0.00002888517,0.000013316926,0.00009752183,0.0008943996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99457765,0.00006666719,0.00094939815,0.0022337225,0.0011576281,0.0010149669],"domain_scores_gemma":[0.9948082,0.002457624,0.00043836737,0.0016544063,0.00043533498,0.00020607664],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002869013,0.00069443835,0.0007567774,0.00102526,0.00058682554,0.0006726096,0.0056220223,0.0005599403,0.00002865005],"category_scores_gemma":[0.0012582657,0.0006687669,0.00022355434,0.001092406,0.00086852285,0.0007273257,0.0025956032,0.0020584897,0.00014025555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010558612,0.0000102342365,0.000004513572,0.000029241328,0.000008809842,0.000028476517,0.00038403284,0.14565498,0.000023723527,0.27223495,0.000007298254,0.58160317],"study_design_scores_gemma":[0.000053526113,0.00010115634,0.000024051353,0.00018884185,0.0000058453543,0.000013471451,2.863699e-7,0.5303106,0.0003479363,0.46800786,0.00048847863,0.00045795913],"about_ca_topic_score_codex":0.00003086603,"about_ca_topic_score_gemma":0.0001363385,"teacher_disagreement_score":0.5811452,"about_ca_system_score_codex":0.0005150967,"about_ca_system_score_gemma":0.00093466614,"threshold_uncertainty_score":0.99975806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0157365,0.00011834771,0.9709452,0.000058765072,0.0044616302,0.0009229199,0.00007084856,0.0006296855,0.0070561497],"genre_scores_gemma":[0.99022883,0.0000052746905,0.009526217,0.000027104528,0.00012644366,0.000012334517,0.00001716964,0.000049744347,0.0000069049374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979993,0.000015581776,0.0005862648,0.0004905076,0.000498444,0.00040991028],"domain_scores_gemma":[0.99871373,0.00045641907,0.00013604524,0.00056492945,0.000069787886,0.000059083613],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069113745,0.0003336456,0.00041819038,0.0007670204,0.00003979457,0.000042224492,0.00053770683,0.00024465262,0.0000087330345],"category_scores_gemma":[0.00012463306,0.0003735753,0.00006896602,0.00041324695,0.00019287837,0.00020149568,0.000092528884,0.0005526022,0.000009965842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006727236,0.000010034136,0.0005823735,0.00040827022,0.00000947513,0.000046252462,0.00057414436,0.975251,0.00017372219,0.0018750734,0.0000033323342,0.021059595],"study_design_scores_gemma":[0.0002484129,0.0000527673,0.00032212742,0.00113978,0.0000043918963,0.00001513141,0.0000013090552,0.99332684,0.002699955,0.0017648531,0.00008082713,0.00034357663],"about_ca_topic_score_codex":0.00003663557,"about_ca_topic_score_gemma":0.00011218085,"teacher_disagreement_score":0.9744923,"about_ca_system_score_codex":0.00059698464,"about_ca_system_score_gemma":0.00012611011,"threshold_uncertainty_score":0.9998716},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026153273,0.001178889,0.9947769,0.000580738,0.0016141934,0.000871464,0.0000069586054,0.0007276773,0.00021704315],"genre_scores_gemma":[0.40448588,0.00026867056,0.592847,0.00044038726,0.000617104,0.0001182395,0.000007996483,0.000107956075,0.0011068062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967745,0.000025218696,0.000610436,0.0012742433,0.0006421771,0.000673425],"domain_scores_gemma":[0.9965208,0.0010270142,0.0004913467,0.0012294796,0.000663327,0.00006803425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007099743,0.0004683961,0.00063977763,0.0007741006,0.00024580045,0.00025630897,0.003395561,0.00038013537,0.0000041172925],"category_scores_gemma":[0.0005923912,0.00041434457,0.00014307356,0.0011086237,0.0010762834,0.0005084285,0.001487206,0.00048316937,0.00001279188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006467507,0.000020856874,0.000012674836,0.00017363325,0.000022468492,0.000034711167,0.00031494428,0.4871215,0.00005988327,0.011780071,0.00013206329,0.50032073],"study_design_scores_gemma":[0.00018839349,0.00021003388,0.000015319112,0.0013882291,0.000008646688,0.000032176813,4.294746e-7,0.94509053,0.0062195896,0.04605568,0.0003006553,0.00049031887],"about_ca_topic_score_codex":0.000011243345,"about_ca_topic_score_gemma":0.00005382718,"teacher_disagreement_score":0.49983042,"about_ca_system_score_codex":0.00021111619,"about_ca_system_score_gemma":0.0005169428,"threshold_uncertainty_score":0.99983084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021836172,0.00011606202,0.9920309,0.0013085895,0.0030105703,0.0008411997,0.000058247537,0.00041348118,0.0020025438],"genre_scores_gemma":[0.7939623,0.00006710665,0.19861637,0.005435793,0.0010402204,0.00013222374,0.000062414285,0.00007978368,0.00060377776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599576,0.00004490276,0.0008570079,0.0012969524,0.0009901371,0.000815261],"domain_scores_gemma":[0.99577224,0.0016993568,0.0005041669,0.0012716586,0.00054633734,0.00020621442],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014290148,0.00062511786,0.000695606,0.00064712286,0.000599549,0.0011808248,0.0033382522,0.00036134766,0.000013332059],"category_scores_gemma":[0.0005301481,0.00056851085,0.00025764437,0.00055758975,0.00036593564,0.0011708334,0.0010597011,0.00087724323,0.00007121472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026410862,0.000055548004,0.00025408145,0.00045800194,0.000043065073,0.00018523882,0.010541654,0.0035071603,0.00006302919,0.32102498,0.0003184928,0.66352236],"study_design_scores_gemma":[0.0007176226,0.00029139526,0.00015285637,0.0008643406,0.000012422869,0.00011065508,0.0000033932686,0.70611435,0.00094088825,0.28377494,0.005885958,0.001131208],"about_ca_topic_score_codex":0.00014773506,"about_ca_topic_score_gemma":0.0018728443,"teacher_disagreement_score":0.79374397,"about_ca_system_score_codex":0.00030509758,"about_ca_system_score_gemma":0.00061652437,"threshold_uncertainty_score":0.99985605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038633085,0.00021661507,0.99414104,0.0012674108,0.0010010928,0.00026231605,0.000016319136,0.00027846108,0.002430418],"genre_scores_gemma":[0.7891895,0.000024026947,0.20788133,0.001193063,0.0003082674,0.000015042799,0.000016731809,0.000048065405,0.0013239647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951217,0.000052828418,0.0006592246,0.0020085443,0.0011926597,0.000965051],"domain_scores_gemma":[0.9970382,0.0003275676,0.00023551747,0.0020876275,0.0001264562,0.00018462888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001241521,0.00051169697,0.0007812025,0.0025559291,0.00016386501,0.00054909504,0.0039428053,0.00034793705,0.000013558014],"category_scores_gemma":[0.00007379016,0.0004952686,0.00024223301,0.0025261608,0.00021152526,0.00052201457,0.0019772477,0.000983164,0.000037036207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023517937,0.0000311693,0.00062408095,0.000033541837,0.0000556222,0.00066987314,0.0037412085,0.7415388,0.000018436267,0.09389719,0.000008888952,0.1593788],"study_design_scores_gemma":[0.00017621832,0.000021696853,0.00030975998,0.00012941356,0.000019224832,0.00001028264,6.446823e-7,0.85440737,0.000050640665,0.14437811,0.000039023867,0.0004576119],"about_ca_topic_score_codex":0.00022246057,"about_ca_topic_score_gemma":0.00873057,"teacher_disagreement_score":0.78880316,"about_ca_system_score_codex":0.0004288201,"about_ca_system_score_gemma":0.00051123777,"threshold_uncertainty_score":0.9997499},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066002477,0.00063916564,0.98532677,0.00006508775,0.0053493227,0.00061467517,0.00011316923,0.00087870174,0.0004128632],"genre_scores_gemma":[0.7879521,0.000030964988,0.2099265,0.00011812317,0.0013546132,0.00003476079,0.000029411136,0.00025959234,0.00029393288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970045,0.00002472404,0.0007399292,0.00092501706,0.00061286637,0.00069293653],"domain_scores_gemma":[0.99786156,0.0009701467,0.00010035484,0.0007946439,0.00010223823,0.00017107339],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006011625,0.0006170987,0.0006662747,0.00055257056,0.00015191305,0.00020462407,0.0009204744,0.00030417237,0.000029783037],"category_scores_gemma":[0.00019995334,0.000669415,0.00012743684,0.00039798414,0.00015104466,0.00022135676,0.00036030827,0.00070690527,0.00006071473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023569667,0.0000048895477,0.0000939616,0.00009824939,0.000020070578,0.00010625563,0.00064929517,0.9861275,0.0006388043,0.00010165878,0.000021326196,0.0121356165],"study_design_scores_gemma":[0.00017799201,0.000064730535,0.0007492518,0.002526434,0.00003394495,0.00008590959,0.000002898479,0.9860119,0.0041949875,0.0027503604,0.0018178831,0.0015837093],"about_ca_topic_score_codex":0.00034053574,"about_ca_topic_score_gemma":0.00021205294,"teacher_disagreement_score":0.78135186,"about_ca_system_score_codex":0.0010029573,"about_ca_system_score_gemma":0.00017183465,"threshold_uncertainty_score":0.99957573},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044605695,0.0005430643,0.9921493,0.0008128021,0.0031740193,0.00038122962,0.0000025874558,0.00042567993,0.0024667347],"genre_scores_gemma":[0.67693776,0.00007908052,0.31401289,0.0028900586,0.0036816644,0.000029006625,0.000010565265,0.000107605905,0.002251369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553907,0.0000883886,0.0007186412,0.0017940523,0.0009671447,0.00089267484],"domain_scores_gemma":[0.9969943,0.001249001,0.00028794637,0.001084484,0.00017384256,0.00021041538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001712026,0.00049971667,0.0006536552,0.00073171046,0.00037994838,0.001022862,0.0033206863,0.00033366872,0.0000015957679],"category_scores_gemma":[0.0002326513,0.00044727625,0.00010525401,0.0014980091,0.00075942813,0.00041733816,0.0022269834,0.00081441784,0.00012724669],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024421633,0.000014997368,0.000028538048,0.000050028804,0.000007479026,0.00010392579,0.0007989491,0.025409516,0.000026321126,0.029215386,0.00006117188,0.9442812],"study_design_scores_gemma":[0.000032092976,0.00008657151,0.000062954976,0.000228711,0.0000032958685,0.0000489493,4.9469526e-7,0.56911826,0.000073585004,0.42983538,0.00013166723,0.00037802203],"about_ca_topic_score_codex":0.000033717566,"about_ca_topic_score_gemma":0.00006957356,"teacher_disagreement_score":0.9439032,"about_ca_system_score_codex":0.00027706914,"about_ca_system_score_gemma":0.0008830476,"threshold_uncertainty_score":0.9997979},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044605695,0.0005430643,0.9921493,0.0008128021,0.0031740193,0.00038122962,0.0000025874558,0.00042567993,0.0024667347],"genre_scores_gemma":[0.67693776,0.00007908052,0.31401289,0.0028900586,0.0036816644,0.000029006625,0.000010565265,0.000107605905,0.002251369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553907,0.0000883886,0.0007186412,0.0017940523,0.0009671447,0.00089267484],"domain_scores_gemma":[0.9969943,0.001249001,0.00028794637,0.001084484,0.00017384256,0.00021041538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001712026,0.00049971667,0.0006536552,0.00073171046,0.00037994838,0.001022862,0.0033206863,0.00033366872,0.0000015957679],"category_scores_gemma":[0.0002326513,0.00044727625,0.00010525401,0.0014980091,0.00075942813,0.00041733816,0.0022269834,0.00081441784,0.00012724669],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024421633,0.000014997368,0.000028538048,0.000050028804,0.000007479026,0.00010392579,0.0007989491,0.025409516,0.000026321126,0.029215386,0.00006117188,0.9442812],"study_design_scores_gemma":[0.000032092976,0.00008657151,0.000062954976,0.000228711,0.0000032958685,0.0000489493,4.9469526e-7,0.56911826,0.000073585004,0.42983538,0.00013166723,0.00037802203],"about_ca_topic_score_codex":0.000033717566,"about_ca_topic_score_gemma":0.00006957356,"teacher_disagreement_score":0.9439032,"about_ca_system_score_codex":0.00027706914,"about_ca_system_score_gemma":0.0008830476,"threshold_uncertainty_score":0.9997979},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016120548,0.00010717104,0.9877672,0.005872761,0.0012755374,0.00057664234,0.000012883365,0.0026559331,0.0015706556],"genre_scores_gemma":[0.04722562,0.00018180527,0.95067984,0.00078711356,0.00013820904,0.000026933436,0.00003741502,0.00011954233,0.0008035213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939765,0.00007375219,0.0006412345,0.0025264975,0.0014706354,0.0013113985],"domain_scores_gemma":[0.99213856,0.00078935066,0.00045646084,0.006057326,0.00033673487,0.00022153748],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012471458,0.00083248067,0.0008152228,0.0011787835,0.00060274836,0.0013762094,0.030474257,0.0006333525,0.000038225848],"category_scores_gemma":[0.0048115477,0.00072041433,0.00011191861,0.0017309698,0.0013842576,0.0008428343,0.0468725,0.0020200904,0.00012384824],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053419837,0.00006948168,0.00015594639,0.0001382134,0.00013605297,0.002067917,0.00037986558,0.013482333,0.0011355315,0.10691429,0.0010099108,0.87445706],"study_design_scores_gemma":[0.00049142295,0.00021964534,0.000015214339,0.00044465467,0.000009600939,0.00013456655,5.014259e-7,0.57010007,0.0029109078,0.4246216,0.00033417434,0.0007176263],"about_ca_topic_score_codex":0.000034056324,"about_ca_topic_score_gemma":0.000098622746,"teacher_disagreement_score":0.8737394,"about_ca_system_score_codex":0.0004015989,"about_ca_system_score_gemma":0.0009487091,"threshold_uncertainty_score":0.99966043},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001323207,0.00023298372,0.99077296,0.0015695665,0.0015775745,0.00061060576,0.000022819806,0.00036333947,0.0048369328],"genre_scores_gemma":[0.05304282,0.000116966345,0.9426708,0.0022267692,0.0003257443,0.000029940784,0.000011569845,0.000095138574,0.001480247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931688,0.0001376171,0.0010707575,0.0028369701,0.0014049339,0.0013809708],"domain_scores_gemma":[0.99502903,0.0014945559,0.00043444877,0.002373943,0.00029412765,0.00037386944],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0022375192,0.0010482189,0.0011347374,0.002114491,0.00025572267,0.00071868475,0.0055128955,0.000918824,0.000014311618],"category_scores_gemma":[0.00031194466,0.00096731924,0.00025463558,0.0018056325,0.00062445505,0.0010221009,0.002708204,0.002306356,0.00007096805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010180613,0.000043675504,0.00005558108,0.00006887633,0.000016092697,0.0002699088,0.001816043,0.1921928,0.00018650698,0.22120416,0.000025470274,0.5841107],"study_design_scores_gemma":[0.00025363872,0.000048222824,0.00008017887,0.00041502065,0.0000054769703,0.000012169497,5.4530872e-8,0.5677502,0.00016716361,0.43051717,0.00012298246,0.0006276939],"about_ca_topic_score_codex":0.000095818286,"about_ca_topic_score_gemma":0.00049666397,"teacher_disagreement_score":0.583483,"about_ca_system_score_codex":0.00035369332,"about_ca_system_score_gemma":0.0012696355,"threshold_uncertainty_score":0.99999535},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011251552,0.0060937135,0.9907403,0.00014731876,0.0011015955,0.00037169072,0.0000033616036,0.0010835157,0.00034599987],"genre_scores_gemma":[0.23254167,0.0125138005,0.7465857,0.0011663416,0.001314739,0.0001942369,0.000060792227,0.0005563347,0.0050663645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801546,0.00001301137,0.00035636773,0.000693175,0.00042493345,0.0004970314],"domain_scores_gemma":[0.9985282,0.000709527,0.00011222973,0.00036792204,0.00020489808,0.00007724611],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038886743,0.0004315851,0.00061173673,0.0005321977,0.00018824483,0.00006004258,0.0006220226,0.00020179873,0.000006247162],"category_scores_gemma":[0.00036648643,0.0003940645,0.00014099677,0.00054634747,0.00039837084,0.00021854567,0.00034563182,0.000737815,0.000016383457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015064534,0.0000077147815,0.0001425651,0.0010653622,0.00014025875,0.000033714543,0.00052755274,0.47863242,0.0007228432,0.0003241827,0.0006786532,0.5177097],"study_design_scores_gemma":[0.00026401487,0.0010105179,0.0001577759,0.006828574,0.00018886174,0.000021818227,0.000005698159,0.84788716,0.010163681,0.11828803,0.013009901,0.002173949],"about_ca_topic_score_codex":0.0000015857838,"about_ca_topic_score_gemma":0.000010263396,"teacher_disagreement_score":0.5155357,"about_ca_system_score_codex":0.00030133565,"about_ca_system_score_gemma":0.00004790973,"threshold_uncertainty_score":0.9998511},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11417586,0.0042068604,0.8786496,0.00038365074,0.0017546907,0.0005126685,0.000015957956,0.00018869818,0.00011198919],"genre_scores_gemma":[0.9757242,0.000097919816,0.023643287,0.000085258376,0.00040966662,0.0000021197868,0.000012499085,0.000018751733,0.000006248701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818057,0.00003266845,0.00030588597,0.00073613273,0.0004597154,0.00028500767],"domain_scores_gemma":[0.9991631,0.00030294995,0.00023497613,0.00017986225,0.00006617378,0.000052952255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049547746,0.00024599428,0.0002893552,0.0006930451,0.00024657423,0.00015477557,0.0005032362,0.00016852604,7.335447e-7],"category_scores_gemma":[0.00017756558,0.00023016283,0.00002874463,0.00043886455,0.00034754755,0.00041692817,0.00035278173,0.00080530025,4.7808896e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003714708,0.0000126006635,0.0015502794,0.000033244192,0.000002871638,0.000006355278,0.010971808,0.0036662559,0.00015859082,0.0002695815,2.2089628e-7,0.98332447],"study_design_scores_gemma":[0.00027501432,0.000058034333,0.03933478,0.0018460037,0.0000071408826,0.00004910703,0.0000039982624,0.9536315,0.0006185183,0.003907313,0.0000017866405,0.00026675282],"about_ca_topic_score_codex":0.000053537915,"about_ca_topic_score_gemma":0.00006453025,"teacher_disagreement_score":0.98305774,"about_ca_system_score_codex":0.00009731912,"about_ca_system_score_gemma":0.0001261924,"threshold_uncertainty_score":0.93857676},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013753174,0.0000058621863,0.98213214,0.0017948899,0.0008977261,0.0007434306,0.0000051331417,0.0001698673,0.0004977531],"genre_scores_gemma":[0.9904159,0.000018666984,0.00335653,0.0024497975,0.00023512624,0.000020445865,0.000021986512,0.000049497034,0.0034321079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975558,0.000024448296,0.00022539322,0.0010201432,0.0007996802,0.00037454764],"domain_scores_gemma":[0.9990671,0.00030862252,0.00019098127,0.0003080773,0.000024350395,0.000100863326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002532493,0.00031146244,0.00021448047,0.000519284,0.00029515047,0.00018432077,0.00037680968,0.00011861929,0.00001328943],"category_scores_gemma":[0.00013361081,0.00026648864,0.000038880135,0.00033057772,0.00022483186,0.00022005827,0.00027505486,0.0003830209,0.000055875335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002292278,0.0000047764192,0.000007722479,0.000009991049,0.0000015600239,0.000015153155,0.00043634718,0.60786986,0.0944892,0.00047299222,0.0000020248929,0.29666746],"study_design_scores_gemma":[0.00019878687,0.00089317595,0.00039926625,0.00014214664,0.000004889691,0.000014324995,0.0000010892629,0.98355544,0.010790082,0.0030455189,0.0005606119,0.00039466686],"about_ca_topic_score_codex":0.000016843316,"about_ca_topic_score_gemma":0.000117680276,"teacher_disagreement_score":0.9787756,"about_ca_system_score_codex":0.00025523797,"about_ca_system_score_gemma":0.00006134659,"threshold_uncertainty_score":0.9999787},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09679333,0.00005899924,0.88682926,0.003312407,0.007792065,0.0020478924,0.00011135464,0.0007978413,0.002256844],"genre_scores_gemma":[0.94004667,0.000001949505,0.056593526,0.0016039516,0.0010308684,0.000006453045,0.00019655246,0.00014929571,0.00037076333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966424,0.000053591084,0.00047132545,0.0009572194,0.0011337334,0.0007417196],"domain_scores_gemma":[0.9979992,0.00064042734,0.00025075374,0.00044261222,0.00021676814,0.0004502242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007399209,0.00046236403,0.0005870797,0.001588401,0.0004790406,0.0002797493,0.00040492998,0.00048343407,0.00003326887],"category_scores_gemma":[0.0021159202,0.0004479758,0.00009842555,0.0007164818,0.00036125764,0.00025112313,0.0001100766,0.0013561711,0.000041121082],"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.000035718862,0.000013896606,0.006172288,0.000074020856,0.000016626576,0.00048738177,0.0076122843,0.67763406,0.000043342945,0.0004914518,0.000030136423,0.3073888],"study_design_scores_gemma":[0.000373337,0.00012633618,0.012122971,0.00076549884,0.000052309464,0.000026512605,0.000009004733,0.9838989,0.00006404166,0.0018135126,0.00019922302,0.00054836564],"about_ca_topic_score_codex":0.020939762,"about_ca_topic_score_gemma":0.18836775,"teacher_disagreement_score":0.8432533,"about_ca_system_score_codex":0.0017033024,"about_ca_system_score_gemma":0.0017776542,"threshold_uncertainty_score":0.9997972},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012255628,0.0001918039,0.9914603,0.0046241074,0.0013944373,0.0006412626,0.000028976681,0.00013354197,0.00029998098],"genre_scores_gemma":[0.86507595,0.00011563357,0.11387891,0.016088292,0.0009076536,0.000083350365,0.000009370763,0.00024334578,0.0035974956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968672,0.000044945566,0.0003783565,0.0015168271,0.00069499045,0.00049771636],"domain_scores_gemma":[0.98665637,0.012367528,0.0002511853,0.00047075213,0.00016463283,0.00008954977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008423629,0.0004067052,0.0004942386,0.000645211,0.00043357344,0.00012359036,0.00070917833,0.0001476079,0.0000053977237],"category_scores_gemma":[0.006440362,0.0003785871,0.00012363713,0.00040566426,0.0013859359,0.0002346219,0.0010631348,0.00041640422,0.000008076257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010310554,0.000081607795,0.0006046475,0.0003755479,0.000020363937,0.000060138824,0.0026000708,0.02597403,0.09582235,0.006724051,0.00038084004,0.86725324],"study_design_scores_gemma":[0.0011593092,0.0003259096,0.0020308855,0.00054503896,0.000024745774,0.0000918472,0.0000032672745,0.90955716,0.024744354,0.05646952,0.0040680952,0.0009798511],"about_ca_topic_score_codex":0.000025211057,"about_ca_topic_score_gemma":0.00014256735,"teacher_disagreement_score":0.8835831,"about_ca_system_score_codex":0.00011829561,"about_ca_system_score_gemma":0.00014514991,"threshold_uncertainty_score":0.9998666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000112571885,0.00001219163,0.99373364,0.00051471865,0.00090383284,0.0011621002,0.00003567348,0.00057347736,0.0029518118],"genre_scores_gemma":[0.0047483384,0.000037607806,0.99217474,0.0013185473,0.0003304431,0.00010156347,0.00011787867,0.00007629378,0.0010945956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593556,0.000058661826,0.00058889616,0.001985872,0.0008233433,0.0006076784],"domain_scores_gemma":[0.99711967,0.00077269156,0.0003274551,0.0010323927,0.0005325122,0.00021529935],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015564376,0.0004717804,0.0005223377,0.0008794047,0.0004631105,0.0015874449,0.0032953927,0.00034195543,0.000023728617],"category_scores_gemma":[0.0003284315,0.0004759702,0.00014253236,0.0007236769,0.00017283863,0.0018418385,0.0012055306,0.00057643437,0.00011420641],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018273993,0.00006686422,0.0000052548853,0.000033384364,0.000017845396,0.000012844131,0.0016176325,0.026194094,0.0007087876,0.002128051,0.000052812084,0.96914417],"study_design_scores_gemma":[0.0005368145,0.00019393233,0.000016384196,0.00019656845,0.000014796966,0.000037185604,0.0000011526078,0.8656634,0.0009753248,0.13162956,0.00017726616,0.00055763003],"about_ca_topic_score_codex":0.000043614968,"about_ca_topic_score_gemma":0.00020128097,"teacher_disagreement_score":0.9685865,"about_ca_system_score_codex":0.00021452665,"about_ca_system_score_gemma":0.0004889421,"threshold_uncertainty_score":0.9997692},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013215684,0.0012962779,0.99579734,0.0004989556,0.00050840585,0.00032901738,0.000042828982,0.00014876953,0.0012462384],"genre_scores_gemma":[0.024747355,0.0018570451,0.94493544,0.00042078245,0.0014695346,0.00020224784,0.00036293833,0.00015253879,0.025852146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607337,0.00016875795,0.0004074203,0.0017885948,0.00076717895,0.0007946695],"domain_scores_gemma":[0.9964794,0.0020233241,0.000104694336,0.0011151339,0.00013477622,0.00014267379],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003504139,0.00031435033,0.00038566912,0.0014915583,0.00039802463,0.0010986825,0.0028568064,0.00014184341,0.0000025768961],"category_scores_gemma":[0.00040142552,0.00028965832,0.000039677932,0.0034369035,0.0007971975,0.0011902184,0.0041673733,0.0018175906,0.00007205623],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021678068,0.00007159849,0.00035360028,0.000084044106,0.000004151238,0.000083892104,0.0015632426,0.0019342643,0.00004296436,0.007070813,0.00037407593,0.9884152],"study_design_scores_gemma":[0.00022502428,0.000092970295,0.0005295747,0.0006192347,0.0000021387616,0.000029698864,0.0000013571631,0.95733225,0.000085106665,0.023312883,0.017353902,0.00041586003],"about_ca_topic_score_codex":0.0001870724,"about_ca_topic_score_gemma":0.0008947801,"teacher_disagreement_score":0.9879993,"about_ca_system_score_codex":0.00031067166,"about_ca_system_score_gemma":0.0012932689,"threshold_uncertainty_score":0.99995553},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001069821,0.00024236758,0.9905905,0.00036905418,0.0009376677,0.00037481554,0.0000023755274,0.00094043306,0.005472931],"genre_scores_gemma":[0.8547546,0.0002422631,0.13638316,0.0002862988,0.0013728664,0.000052704938,0.00003103751,0.00022462883,0.006652417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99477214,0.00013307763,0.00043403666,0.0022815422,0.0013778014,0.0010014339],"domain_scores_gemma":[0.99685955,0.0011071675,0.0005093095,0.0007133853,0.00062441325,0.00018615255],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007051446,0.0008106305,0.00069956726,0.0010588724,0.0008995333,0.0016628486,0.0025260984,0.0002757668,0.000016567656],"category_scores_gemma":[0.00020337828,0.0006675376,0.000120163255,0.0018051055,0.0008637468,0.001418529,0.0011856947,0.0033653886,0.00009022931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021540842,0.000018957591,0.00023042454,0.000076817305,0.000029206703,0.00026763944,0.005182871,0.51833016,0.000042360265,0.003101989,0.0000033734398,0.47269467],"study_design_scores_gemma":[0.00074045925,0.001909971,0.0018916051,0.0013443225,0.000021661948,0.000242724,0.00004689598,0.96230775,0.00062858383,0.026746765,0.002092317,0.0020269142],"about_ca_topic_score_codex":0.00004887684,"about_ca_topic_score_gemma":0.00008808868,"teacher_disagreement_score":0.8542074,"about_ca_system_score_codex":0.00023855515,"about_ca_system_score_gemma":0.0009751303,"threshold_uncertainty_score":0.9995776},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002017606,0.0010448697,0.9960108,0.00030766384,0.00043504243,0.00039897638,0.00013128863,0.00016365404,0.0013059346],"genre_scores_gemma":[0.039846092,0.0013511326,0.9551281,0.0006645164,0.0006117492,0.00007272279,0.00047006618,0.000090760994,0.001764875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994984,0.000043849235,0.00045397005,0.0029278498,0.00084463635,0.0007457085],"domain_scores_gemma":[0.99641573,0.00097206264,0.00018938661,0.0021050835,0.00011250997,0.00020522947],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.003556811,0.0004154435,0.00046345405,0.0011637076,0.00056146603,0.0016408485,0.0056306603,0.000113124705,0.000001105076],"category_scores_gemma":[0.0004733512,0.0003819911,0.000017164293,0.0035626988,0.0020157753,0.0029549166,0.011673408,0.0009792083,0.000017149858],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021234637,0.000044895507,0.00022884959,0.00007408799,0.0000035817388,0.000025490413,0.0007117011,0.0006050618,0.0001681507,0.0065018227,0.000117052616,0.9915172],"study_design_scores_gemma":[0.00027654515,0.000042134518,0.00071237516,0.00031045752,0.000006472174,0.000045239285,0.0000016364538,0.9833667,0.000108630666,0.00604542,0.00856636,0.00051797344],"about_ca_topic_score_codex":0.000090533475,"about_ca_topic_score_gemma":0.00041892438,"teacher_disagreement_score":0.9909992,"about_ca_system_score_codex":0.00023978532,"about_ca_system_score_gemma":0.0021695844,"threshold_uncertainty_score":0.9998632},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000794929,0.00020621213,0.9919582,0.0007612507,0.0040938878,0.001146116,0.000018503611,0.0010336965,0.0007741585],"genre_scores_gemma":[0.010732511,0.00015463338,0.98675686,0.0007557102,0.00066900474,0.00010475123,0.000017211201,0.00008618655,0.00072310644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995586,0.000049375085,0.00088427105,0.001983891,0.00063414034,0.00086235785],"domain_scores_gemma":[0.997262,0.00043702874,0.00036721886,0.0014314606,0.00035753133,0.00014473629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018787513,0.0006258701,0.0006962494,0.0007118808,0.00049134507,0.0008832252,0.002887675,0.000497678,0.0000022632798],"category_scores_gemma":[0.00008980689,0.00058079103,0.0002514212,0.00056715,0.00019976633,0.001154893,0.00130493,0.00075394247,0.000018859688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012581691,0.000053981712,0.000019739367,0.00021599597,0.000049801038,0.000054980068,0.0027249,0.62189823,0.00025563338,0.03881242,0.00024130856,0.3356604],"study_design_scores_gemma":[0.00032570644,0.00015208722,0.0000034023528,0.00060749095,0.000008490002,0.00002981754,4.3970678e-7,0.91336113,0.0006947274,0.08288958,0.001398274,0.0005288535],"about_ca_topic_score_codex":0.00011055071,"about_ca_topic_score_gemma":0.00009313035,"teacher_disagreement_score":0.33513156,"about_ca_system_score_codex":0.0003808416,"about_ca_system_score_gemma":0.00038771747,"threshold_uncertainty_score":0.99966437},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040953382,0.0012606449,0.991936,0.00032199742,0.003439035,0.00039271498,0.0000026494106,0.0019686252,0.00026875274],"genre_scores_gemma":[0.29110542,0.0004359064,0.706191,0.00065936655,0.0009997316,0.000057843787,0.000005987576,0.00011457638,0.00043016698],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99531585,0.000038361068,0.00057604525,0.0018864778,0.001297751,0.00088554417],"domain_scores_gemma":[0.997229,0.0004156498,0.00034714045,0.0015285464,0.0002890954,0.00019057425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010042985,0.00069175917,0.00056684593,0.0024834322,0.00039397558,0.0008314222,0.004224918,0.00032003867,0.0000067274227],"category_scores_gemma":[0.00026504535,0.0005911276,0.00018968734,0.0032905014,0.0003920295,0.0018316659,0.0020602206,0.001321666,0.00006382559],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004803368,0.000015009799,0.00003877596,0.00006209544,0.000009349227,0.00020338106,0.0005501908,0.0012066393,0.0010570759,0.004550826,0.0000053052913,0.9922966],"study_design_scores_gemma":[0.00031585013,0.0001967029,0.0002892553,0.0009930789,0.000013761226,0.00017341305,2.755596e-7,0.18937199,0.018182917,0.7884851,0.00034734767,0.001630299],"about_ca_topic_score_codex":0.000049946284,"about_ca_topic_score_gemma":0.0001427909,"teacher_disagreement_score":0.9906663,"about_ca_system_score_codex":0.00036366822,"about_ca_system_score_gemma":0.0002491398,"threshold_uncertainty_score":0.999654},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006195152,0.0002167645,0.9935183,0.0008099436,0.0019951162,0.0004801225,0.000004867574,0.00046569563,0.0018896614],"genre_scores_gemma":[0.3671512,0.000019452831,0.62890214,0.0028846588,0.0006560935,0.000027758791,0.000021829912,0.00013658186,0.00020030217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943133,0.00013965752,0.00063236774,0.0023012147,0.0016126264,0.0010008636],"domain_scores_gemma":[0.99631613,0.0009825043,0.0003840463,0.0017771518,0.000274208,0.00026594184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015642901,0.00076575327,0.0007029297,0.0011174859,0.00034907574,0.00092550705,0.003921979,0.000287503,0.0000060284556],"category_scores_gemma":[0.00010382798,0.0006696107,0.00022520247,0.0020685212,0.000823862,0.0009024525,0.0021581976,0.0012951539,0.000019800651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068176473,0.000012369181,0.000029254436,0.000020109024,0.000015541058,0.00023417895,0.0001498827,0.76531833,0.000013344023,0.055669308,0.0000028164625,0.17852807],"study_design_scores_gemma":[0.00018288702,0.00012417589,0.0005288546,0.00020037538,0.000008847789,0.00009053431,8.1707405e-8,0.73598576,0.000118500815,0.2621281,0.000024445555,0.0006074062],"about_ca_topic_score_codex":0.000033128388,"about_ca_topic_score_gemma":0.00007347959,"teacher_disagreement_score":0.36653167,"about_ca_system_score_codex":0.00022383072,"about_ca_system_score_gemma":0.00047254318,"threshold_uncertainty_score":0.9995755},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019151541,0.00015709273,0.99472165,0.0014477748,0.0017299714,0.0009177892,0.000011426665,0.0005305518,0.0002922215],"genre_scores_gemma":[0.0714634,0.00016875251,0.92459863,0.0018790246,0.00079658296,0.000100742596,0.0000642948,0.00015092935,0.00077762856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537617,0.000032321783,0.0005355503,0.0021382123,0.0010635863,0.000854186],"domain_scores_gemma":[0.9962384,0.0011123843,0.0003298013,0.001671415,0.0004431025,0.00020491598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060980604,0.00062569825,0.0005358827,0.0011970795,0.00039645296,0.00046601932,0.0026359141,0.00038383747,0.0000028739712],"category_scores_gemma":[0.00008321686,0.0005142036,0.0001699788,0.0018129587,0.0006897795,0.00084470713,0.0007858224,0.00077266723,0.00002566841],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005267685,0.000041549014,0.00007875391,0.00007409482,0.000025691916,0.00010473146,0.0006282848,0.08540117,0.000541118,0.062181536,0.00012063897,0.85074973],"study_design_scores_gemma":[0.0005402148,0.00059939234,0.0005184209,0.0005064081,0.000014366809,0.000068410096,2.8166488e-7,0.76504654,0.00054327346,0.22967854,0.0015876238,0.00089650863],"about_ca_topic_score_codex":0.000005135287,"about_ca_topic_score_gemma":0.00010291455,"teacher_disagreement_score":0.8498532,"about_ca_system_score_codex":0.00015246504,"about_ca_system_score_gemma":0.00026012136,"threshold_uncertainty_score":0.99973094},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013215684,0.0012962779,0.99579734,0.0004989556,0.00050840585,0.00032901738,0.000042828982,0.00014876953,0.0012462384],"genre_scores_gemma":[0.024747355,0.0018570451,0.94493544,0.00042078245,0.0014695346,0.00020224784,0.00036293833,0.00015253879,0.025852146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607337,0.00016875795,0.0004074203,0.0017885948,0.00076717895,0.0007946695],"domain_scores_gemma":[0.9964794,0.0020233241,0.000104694336,0.0011151339,0.00013477622,0.00014267379],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003504139,0.00031435033,0.00038566912,0.0014915583,0.00039802463,0.0010986825,0.0028568064,0.00014184341,0.0000025768961],"category_scores_gemma":[0.00040142552,0.00028965832,0.000039677932,0.0034369035,0.0007971975,0.0011902184,0.0041673733,0.0018175906,0.00007205623],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021678068,0.00007159849,0.00035360028,0.000084044106,0.000004151238,0.000083892104,0.0015632426,0.0019342643,0.00004296436,0.007070813,0.00037407593,0.9884152],"study_design_scores_gemma":[0.00022502428,0.000092970295,0.0005295747,0.0006192347,0.0000021387616,0.000029698864,0.0000013571631,0.95733225,0.000085106665,0.023312883,0.017353902,0.00041586003],"about_ca_topic_score_codex":0.0001870724,"about_ca_topic_score_gemma":0.0008947801,"teacher_disagreement_score":0.9879993,"about_ca_system_score_codex":0.00031067166,"about_ca_system_score_gemma":0.0012932689,"threshold_uncertainty_score":0.99995553},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013215684,0.0012962779,0.99579734,0.0004989556,0.00050840585,0.00032901738,0.000042828982,0.00014876953,0.0012462384],"genre_scores_gemma":[0.024747355,0.0018570451,0.94493544,0.00042078245,0.0014695346,0.00020224784,0.00036293833,0.00015253879,0.025852146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607337,0.00016875795,0.0004074203,0.0017885948,0.00076717895,0.0007946695],"domain_scores_gemma":[0.9964794,0.0020233241,0.000104694336,0.0011151339,0.00013477622,0.00014267379],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003504139,0.00031435033,0.00038566912,0.0014915583,0.00039802463,0.0010986825,0.0028568064,0.00014184341,0.0000025768961],"category_scores_gemma":[0.00040142552,0.00028965832,0.000039677932,0.0034369035,0.0007971975,0.0011902184,0.0041673733,0.0018175906,0.00007205623],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021678068,0.00007159849,0.00035360028,0.000084044106,0.000004151238,0.000083892104,0.0015632426,0.0019342643,0.00004296436,0.007070813,0.00037407593,0.9884152],"study_design_scores_gemma":[0.00022502428,0.000092970295,0.0005295747,0.0006192347,0.0000021387616,0.000029698864,0.0000013571631,0.95733225,0.000085106665,0.023312883,0.017353902,0.00041586003],"about_ca_topic_score_codex":0.0001870724,"about_ca_topic_score_gemma":0.0008947801,"teacher_disagreement_score":0.9879993,"about_ca_system_score_codex":0.00031067166,"about_ca_system_score_gemma":0.0012932689,"threshold_uncertainty_score":0.99995553},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019650483,0.00029972472,0.95476013,0.009912701,0.005247344,0.00095583976,0.000008573208,0.00042201104,0.026428636],"genre_scores_gemma":[0.98352945,0.0004109345,0.008822417,0.0014521724,0.00069124304,0.000008344744,0.000009775305,0.00007806565,0.00499758],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963234,0.00015979185,0.0004291173,0.0009180508,0.0012437991,0.0009258519],"domain_scores_gemma":[0.99797934,0.0009442069,0.00021751379,0.00033571653,0.00027801,0.00024522867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003349182,0.00035678793,0.0004858427,0.00074509945,0.0008119549,0.0005763749,0.0014162281,0.00069407135,0.00003198025],"category_scores_gemma":[0.0010809378,0.000368152,0.00014018576,0.0008266756,0.0017685897,0.0005456926,0.00045519823,0.0019821534,0.000080206555],"study_design_candidate":"theoretical_or_conceptual","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.000038850158,0.00015596113,0.0060480903,0.00017254714,0.000057552068,0.0007543474,0.17200725,0.08366419,0.00039324755,0.06515792,0.0000682388,0.6714818],"study_design_scores_gemma":[0.0023968567,0.00059839775,0.0054649,0.0042049917,0.000052657902,0.0000104267365,0.00035410715,0.19205712,0.00026647764,0.77176124,0.018321928,0.004510887],"about_ca_topic_score_codex":0.0034415384,"about_ca_topic_score_gemma":0.029869258,"teacher_disagreement_score":0.9815644,"about_ca_system_score_codex":0.00065652886,"about_ca_system_score_gemma":0.0008979067,"threshold_uncertainty_score":0.99987704},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00132335,0.000021057442,0.9955331,0.00067418185,0.00015182319,0.00095247105,0.000010833241,0.0011643068,0.00016887394],"genre_scores_gemma":[0.44065323,0.000028275317,0.5582873,0.0002723249,0.00017962385,0.00018825202,0.000012418078,0.000054846347,0.00032370578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973367,0.000024419649,0.0003674477,0.0013837318,0.00053472864,0.00035299477],"domain_scores_gemma":[0.9984036,0.00009611998,0.00019385506,0.0009023088,0.00023419944,0.00016988625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043528894,0.00037789665,0.0002992115,0.00078194245,0.00047113423,0.0004002612,0.0009050155,0.00027423806,0.0000028420582],"category_scores_gemma":[0.000014712649,0.00033510663,0.000056154877,0.0012509753,0.00021033398,0.0007633317,0.0005822199,0.00040998514,0.000053953263],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039477854,0.00006292368,0.0005043042,0.000069177375,0.000030252088,0.000015285681,0.001080039,0.008230102,0.016459975,0.011214496,0.00003355856,0.9622604],"study_design_scores_gemma":[0.0003438026,0.0011433208,0.0035957806,0.00024267843,0.000022833641,0.00011383395,0.0000011770884,0.9150026,0.013981001,0.06106603,0.0036327383,0.0008542074],"about_ca_topic_score_codex":0.000093551454,"about_ca_topic_score_gemma":0.00025602168,"teacher_disagreement_score":0.9614062,"about_ca_system_score_codex":0.000158593,"about_ca_system_score_gemma":0.00011447852,"threshold_uncertainty_score":0.9999101},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002017606,0.0010448697,0.9960108,0.00030766384,0.00043504243,0.00039897638,0.00013128863,0.00016365404,0.0013059346],"genre_scores_gemma":[0.039846092,0.0013511326,0.9551281,0.0006645164,0.0006117492,0.00007272279,0.00047006618,0.000090760994,0.001764875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994984,0.000043849235,0.00045397005,0.0029278498,0.00084463635,0.0007457085],"domain_scores_gemma":[0.99641573,0.00097206264,0.00018938661,0.0021050835,0.00011250997,0.00020522947],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.003556811,0.0004154435,0.00046345405,0.0011637076,0.00056146603,0.0016408485,0.0056306603,0.000113124705,0.000001105076],"category_scores_gemma":[0.0004733512,0.0003819911,0.000017164293,0.0035626988,0.0020157753,0.0029549166,0.011673408,0.0009792083,0.000017149858],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021234637,0.000044895507,0.00022884959,0.00007408799,0.0000035817388,0.000025490413,0.0007117011,0.0006050618,0.0001681507,0.0065018227,0.000117052616,0.9915172],"study_design_scores_gemma":[0.00027654515,0.000042134518,0.00071237516,0.00031045752,0.000006472174,0.000045239285,0.0000016364538,0.9833667,0.000108630666,0.00604542,0.00856636,0.00051797344],"about_ca_topic_score_codex":0.000090533475,"about_ca_topic_score_gemma":0.00041892438,"teacher_disagreement_score":0.9909992,"about_ca_system_score_codex":0.00023978532,"about_ca_system_score_gemma":0.0021695844,"threshold_uncertainty_score":0.9998632},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057224872,0.00020981063,0.99163085,0.0013610616,0.0024275642,0.0006432632,0.000020148125,0.0006583817,0.0029916798],"genre_scores_gemma":[0.010598407,0.00005208567,0.9833729,0.0030084131,0.0005746898,0.00004897095,0.000031086645,0.00015968103,0.0021537105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99246323,0.00018988887,0.0009077628,0.002914511,0.0023414546,0.0011831627],"domain_scores_gemma":[0.99492925,0.0013718954,0.0004589502,0.0022632747,0.00055185874,0.00042475606],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0022929432,0.0010409239,0.00096382055,0.0008653511,0.00032860207,0.00091205694,0.0058900937,0.0006276412,0.000084325584],"category_scores_gemma":[0.00040854202,0.0010644494,0.00035058332,0.0015766639,0.0010512633,0.0008521403,0.0035029957,0.0014382275,0.00026991538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000894097,0.000029742092,0.000004289586,0.00009208287,0.00003406483,0.0005624677,0.0004936935,0.81516314,0.00040656564,0.0072501465,0.00014335843,0.17581153],"study_design_scores_gemma":[0.00027855366,0.000073622745,0.000033347675,0.00030881367,0.000014433604,0.00009413859,4.0570973e-7,0.77059966,0.004970249,0.22217391,0.0005421421,0.0009106914],"about_ca_topic_score_codex":0.000049506885,"about_ca_topic_score_gemma":0.000016943683,"teacher_disagreement_score":0.21492377,"about_ca_system_score_codex":0.0006958428,"about_ca_system_score_gemma":0.0030734672,"threshold_uncertainty_score":0.99948853},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017610044,0.00008436086,0.9920442,0.0008384676,0.005434927,0.00028967098,0.0000030382748,0.0004593246,0.00082839734],"genre_scores_gemma":[0.16051553,0.00007200324,0.8318306,0.0015625546,0.0040926165,0.000037013084,0.00012365269,0.00019498494,0.0015710184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960548,0.00006331469,0.00044288207,0.001507708,0.0012682655,0.0006629885],"domain_scores_gemma":[0.9978713,0.00040481557,0.00033608402,0.00093936134,0.00026114902,0.00018730237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008245068,0.0005380922,0.00046695638,0.0007992877,0.00041827152,0.00076329935,0.0023066655,0.00028887752,0.000020917492],"category_scores_gemma":[0.000051672654,0.00044758234,0.00013474778,0.0011449201,0.0004927038,0.0005628323,0.00082882424,0.0012067518,0.000017238384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006706594,0.000017623765,0.00012936146,0.000011459609,0.000011770176,0.000092013506,0.00006984982,0.90449905,7.6656823e-7,0.01320144,0.000025646712,0.081934296],"study_design_scores_gemma":[0.00042665922,0.0002554186,0.00017784841,0.00018265538,0.000007929546,0.000071476425,6.995608e-8,0.9640653,0.000004966472,0.03415157,0.00012145457,0.00053465925],"about_ca_topic_score_codex":0.00003396597,"about_ca_topic_score_gemma":0.000014593041,"teacher_disagreement_score":0.16049792,"about_ca_system_score_codex":0.00011848824,"about_ca_system_score_gemma":0.00026540572,"threshold_uncertainty_score":0.9997976},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013136538,0.0002027605,0.9966243,0.0006159873,0.0011589582,0.00069221563,0.000009196666,0.0002238087,0.00034141372],"genre_scores_gemma":[0.54932123,0.0004875474,0.4476366,0.0017335559,0.00024130152,0.000058265763,0.00002803606,0.00007947858,0.00041395155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971768,0.00007505813,0.0006308027,0.00093897345,0.0008265059,0.00035181837],"domain_scores_gemma":[0.99673814,0.0014926757,0.00052399177,0.0008947831,0.00026946474,0.00008095171],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001211708,0.00035462563,0.0005287242,0.0007112667,0.00023358829,0.00028582418,0.0015871513,0.0002130927,0.000011075316],"category_scores_gemma":[0.0002956047,0.00027542654,0.00009775631,0.0008548772,0.0017348904,0.00044008307,0.0008752075,0.000376362,0.000005154505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008067068,0.00002004919,0.000045754943,0.000090852045,0.00003483312,0.000011652124,0.0019116601,0.17651972,0.00042920504,0.7612475,0.000023372417,0.05958472],"study_design_scores_gemma":[0.00085779454,0.0000741503,0.000103693965,0.00033915314,0.000013560865,0.000019880394,5.2892824e-7,0.726687,0.0014308306,0.27019867,0.000013390385,0.00026133918],"about_ca_topic_score_codex":0.00003303121,"about_ca_topic_score_gemma":0.000016286283,"teacher_disagreement_score":0.55016726,"about_ca_system_score_codex":0.00009742312,"about_ca_system_score_gemma":0.00021313352,"threshold_uncertainty_score":0.9999698},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001348565,0.000029658186,0.9939578,0.0008852174,0.0026449794,0.00035663942,0.0000056444874,0.0002653795,0.0005060839],"genre_scores_gemma":[0.77293915,0.00013261504,0.22425269,0.0003500436,0.00093999394,0.00007388368,0.000076976066,0.000104794526,0.00112986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955786,0.000095015064,0.00086211675,0.0011225536,0.0015704172,0.00077131134],"domain_scores_gemma":[0.996152,0.0015904682,0.0006562525,0.0010753223,0.00040230725,0.00012364578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021168357,0.00050688774,0.000552244,0.0006152714,0.00081490964,0.00035585972,0.0035860643,0.00013008788,0.000006204459],"category_scores_gemma":[0.00070766214,0.00042358227,0.00018152414,0.0014028178,0.00076891936,0.0011351663,0.0022409165,0.0016921501,0.000011534905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033574356,0.000004957021,0.00005522511,0.000025676907,0.00001656457,0.000013494638,0.0017838617,0.8350669,0.00005108309,0.017740913,0.0000025207733,0.14523542],"study_design_scores_gemma":[0.00020592818,0.00006819784,0.000689171,0.0005011032,0.000009171203,0.000007816937,0.0000038078717,0.98744625,0.0001955997,0.010010722,0.00040270106,0.00045951307],"about_ca_topic_score_codex":0.000025345358,"about_ca_topic_score_gemma":0.00003267579,"teacher_disagreement_score":0.7715906,"about_ca_system_score_codex":0.000368844,"about_ca_system_score_gemma":0.0007549087,"threshold_uncertainty_score":0.9998216},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013215684,0.0012962779,0.99579734,0.0004989556,0.00050840585,0.00032901738,0.000042828982,0.00014876953,0.0012462384],"genre_scores_gemma":[0.024747355,0.0018570451,0.94493544,0.00042078245,0.0014695346,0.00020224784,0.00036293833,0.00015253879,0.025852146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607337,0.00016875795,0.0004074203,0.0017885948,0.00076717895,0.0007946695],"domain_scores_gemma":[0.9964794,0.0020233241,0.000104694336,0.0011151339,0.00013477622,0.00014267379],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003504139,0.00031435033,0.00038566912,0.0014915583,0.00039802463,0.0010986825,0.0028568064,0.00014184341,0.0000025768961],"category_scores_gemma":[0.00040142552,0.00028965832,0.000039677932,0.0034369035,0.0007971975,0.0011902184,0.0041673733,0.0018175906,0.00007205623],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021678068,0.00007159849,0.00035360028,0.000084044106,0.000004151238,0.000083892104,0.0015632426,0.0019342643,0.00004296436,0.007070813,0.00037407593,0.9884152],"study_design_scores_gemma":[0.00022502428,0.000092970295,0.0005295747,0.0006192347,0.0000021387616,0.000029698864,0.0000013571631,0.95733225,0.000085106665,0.023312883,0.017353902,0.00041586003],"about_ca_topic_score_codex":0.0001870724,"about_ca_topic_score_gemma":0.0008947801,"teacher_disagreement_score":0.9879993,"about_ca_system_score_codex":0.00031067166,"about_ca_system_score_gemma":0.0012932689,"threshold_uncertainty_score":0.99995553},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013215684,0.0012962779,0.99579734,0.0004989556,0.00050840585,0.00032901738,0.000042828982,0.00014876953,0.0012462384],"genre_scores_gemma":[0.024747355,0.0018570451,0.94493544,0.00042078245,0.0014695346,0.00020224784,0.00036293833,0.00015253879,0.025852146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607337,0.00016875795,0.0004074203,0.0017885948,0.00076717895,0.0007946695],"domain_scores_gemma":[0.9964794,0.0020233241,0.000104694336,0.0011151339,0.00013477622,0.00014267379],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003504139,0.00031435033,0.00038566912,0.0014915583,0.00039802463,0.0010986825,0.0028568064,0.00014184341,0.0000025768961],"category_scores_gemma":[0.00040142552,0.00028965832,0.000039677932,0.0034369035,0.0007971975,0.0011902184,0.0041673733,0.0018175906,0.00007205623],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021678068,0.00007159849,0.00035360028,0.000084044106,0.000004151238,0.000083892104,0.0015632426,0.0019342643,0.00004296436,0.007070813,0.00037407593,0.9884152],"study_design_scores_gemma":[0.00022502428,0.000092970295,0.0005295747,0.0006192347,0.0000021387616,0.000029698864,0.0000013571631,0.95733225,0.000085106665,0.023312883,0.017353902,0.00041586003],"about_ca_topic_score_codex":0.0001870724,"about_ca_topic_score_gemma":0.0008947801,"teacher_disagreement_score":0.9879993,"about_ca_system_score_codex":0.00031067166,"about_ca_system_score_gemma":0.0012932689,"threshold_uncertainty_score":0.99995553},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005328317,0.00022022852,0.99600196,0.00035595387,0.00126742,0.0010029187,0.000015042567,0.00057810155,0.0005530653],"genre_scores_gemma":[0.01564148,0.00009657686,0.9807486,0.0018863648,0.0004007438,0.00008070277,0.000025092282,0.00006285188,0.001057605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968847,0.000023478098,0.00050882425,0.0013214735,0.00073105836,0.0005304616],"domain_scores_gemma":[0.9974887,0.00080532243,0.0003487134,0.0008381046,0.00041193076,0.00010725776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076058495,0.0004299835,0.00042597813,0.0007663357,0.00026967164,0.00046313507,0.0017809587,0.00020063626,0.000005068264],"category_scores_gemma":[0.0002324635,0.00041165896,0.00015396134,0.0006819994,0.00031229857,0.0011597556,0.0005674456,0.00040516292,0.000043507454],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009027045,0.000008382385,0.000003020027,0.00003470776,0.0000066194248,0.000017662405,0.0005852329,0.004489113,0.00034041388,0.014687632,0.0000513191,0.97976685],"study_design_scores_gemma":[0.00039869704,0.0004510036,0.000021061729,0.0004042525,0.000010454256,0.000024082945,0.0000016238757,0.53222674,0.029034968,0.43467274,0.002067355,0.0006870323],"about_ca_topic_score_codex":0.000017716138,"about_ca_topic_score_gemma":0.000084104424,"teacher_disagreement_score":0.97907984,"about_ca_system_score_codex":0.00031207138,"about_ca_system_score_gemma":0.0003879572,"threshold_uncertainty_score":0.9998335},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052487456,0.00016136398,0.99436134,0.0009017786,0.0015483447,0.00070388993,0.000018473249,0.00048658848,0.0017657337],"genre_scores_gemma":[0.03352448,0.000015346208,0.9577221,0.0018814136,0.0006971239,0.00005601867,0.000011307136,0.00007785378,0.006014351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588394,0.000016821203,0.00052620337,0.0018446557,0.00089631736,0.00083203666],"domain_scores_gemma":[0.99712825,0.00053589116,0.00020557955,0.0017435908,0.00021397976,0.00017273164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009253746,0.0005163667,0.0005091298,0.0006995786,0.00022348283,0.00044071418,0.0037238973,0.00036639225,0.0000091955635],"category_scores_gemma":[0.00015599576,0.00047863164,0.00019487513,0.0004199065,0.00027701608,0.00051214854,0.001316648,0.00058217585,0.000034962577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052705054,0.000014081338,0.0000029571922,0.00006710987,0.000012622289,0.00003450367,0.003260057,0.5585279,0.00024513123,0.050404273,0.00007937426,0.3873467],"study_design_scores_gemma":[0.0002153748,0.000050533905,0.000004994667,0.00015478567,0.000005821398,0.000011479627,2.4351763e-7,0.78967094,0.0003477811,0.20895648,0.00014607552,0.0004354868],"about_ca_topic_score_codex":0.000017438435,"about_ca_topic_score_gemma":0.000096838616,"teacher_disagreement_score":0.3869112,"about_ca_system_score_codex":0.00019241072,"about_ca_system_score_gemma":0.00065314514,"threshold_uncertainty_score":0.9997665},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029402576,0.00022970502,0.9921176,0.0008745641,0.0029378615,0.00029753806,0.000032018634,0.00054766843,0.0029336633],"genre_scores_gemma":[0.038980383,0.00029836656,0.95082515,0.0028922004,0.00085534743,0.000012597709,0.00012004669,0.0001988802,0.005817012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953317,0.000027739861,0.0005503395,0.0018947871,0.001325336,0.0008700931],"domain_scores_gemma":[0.99675417,0.0005168054,0.000307488,0.0019899334,0.0001630964,0.00026849663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007833118,0.00063220924,0.00063857983,0.0010697196,0.00037460242,0.00081332505,0.005250479,0.00035227658,0.000023993853],"category_scores_gemma":[0.000066256034,0.0005512676,0.00015919618,0.0008329293,0.00051955733,0.0009093304,0.0016304153,0.0010056879,0.0003820645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010218136,0.000046868052,0.000041286457,0.00007511614,0.00002907337,0.0006373897,0.0008255409,0.03060995,0.0002740444,0.042009976,0.0009690662,0.9244715],"study_design_scores_gemma":[0.00020121768,0.00011451985,0.00024796266,0.00049475854,0.0000054848633,0.0000792836,1.23608e-7,0.8338043,0.00012433811,0.16068771,0.003557427,0.0006828568],"about_ca_topic_score_codex":0.00005320068,"about_ca_topic_score_gemma":0.00006432948,"teacher_disagreement_score":0.9237886,"about_ca_system_score_codex":0.0003188704,"about_ca_system_score_gemma":0.0004313941,"threshold_uncertainty_score":0.9996939},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5692277,0.00007666617,0.42954051,0.0006755265,0.0002804285,0.00012657761,0.000043477103,0.000008049276,0.000021039978],"genre_scores_gemma":[0.9872986,0.000018916537,0.011706267,0.00071360613,0.0001831523,0.0000025495451,0.00007224038,0.0000023863686,0.0000022865686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999164,0.000021209908,0.00008329429,0.00036220302,0.00012922063,0.00024007767],"domain_scores_gemma":[0.9994741,0.000076594966,0.000022991131,0.00038679,0.000018982795,0.000020506848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006196424,0.00007064007,0.000063943546,0.00008444311,0.00013218743,0.00008166082,0.0010325789,0.000045996105,0.0000016218412],"category_scores_gemma":[0.00015051785,0.00004904035,0.000017061555,0.00038750548,0.00009572692,0.00000490434,0.0003793552,0.00006058669,0.0000017595635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093182825,0.000103819955,0.06819068,0.000116039206,0.00002556642,0.000050956256,0.003330674,0.17053147,0.27675053,0.00058038096,0.00732167,0.47290504],"study_design_scores_gemma":[0.002390024,0.0009068913,0.25003296,0.0001420453,0.000022495366,0.0001077366,0.00014991962,0.5797471,0.08992751,0.030889053,0.044480916,0.0012033677],"about_ca_topic_score_codex":0.000016462667,"about_ca_topic_score_gemma":0.00007535168,"teacher_disagreement_score":0.47170168,"about_ca_system_score_codex":0.000004149346,"about_ca_system_score_gemma":0.000049780345,"threshold_uncertainty_score":0.19998075},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032544374,0.00013378335,0.989986,0.004996129,0.0011319335,0.00033284503,0.000008838315,0.00014167091,0.000014351387],"genre_scores_gemma":[0.5388335,0.000017249127,0.46032548,0.00052121904,0.00025745816,0.000023073097,0.000003195701,0.0000102848935,0.000008537682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787444,0.00004601063,0.00027528786,0.0006779576,0.0005891096,0.000537222],"domain_scores_gemma":[0.9974022,0.0012333986,0.000116878,0.001083737,0.00008058937,0.000083198596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011239497,0.00018026587,0.00022830314,0.00027444016,0.0003267021,0.00025071614,0.0030450288,0.000067383065,0.0000061154265],"category_scores_gemma":[0.00015147353,0.000115491275,0.00008601955,0.0025968745,0.00034880434,0.0006043283,0.0007155592,0.00018749473,0.000024938223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010238218,0.00006278394,0.0002778202,0.000029215182,0.000010114631,0.000008079708,0.0022250914,0.110226884,0.03028598,0.0022964336,0.00097803,0.8535893],"study_design_scores_gemma":[0.00022894063,0.00010014502,0.0039864643,0.000046323636,0.000002623297,0.000008954006,9.516461e-7,0.95725423,0.029122131,0.0076827407,0.0014044432,0.00016207369],"about_ca_topic_score_codex":0.0000323752,"about_ca_topic_score_gemma":0.000009957317,"teacher_disagreement_score":0.85342723,"about_ca_system_score_codex":0.00003781904,"about_ca_system_score_gemma":0.00017115907,"threshold_uncertainty_score":0.56584716},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06280087,0.000029582832,0.93490565,0.0006795682,0.00075483863,0.0003969605,0.000010123351,0.00041725053,0.000005176305],"genre_scores_gemma":[0.74964523,0.0000019766749,0.24966826,0.00049204373,0.000121305784,0.000039005175,0.000019880776,0.000011601452,6.960871e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708086,0.000045376004,0.000333636,0.0010292918,0.00062847213,0.0008823474],"domain_scores_gemma":[0.9977611,0.00084175955,0.0001318438,0.0009838705,0.000118157004,0.0001632792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001179464,0.00025493288,0.00028353083,0.00066095847,0.0005083552,0.0007137397,0.002765317,0.0001067818,0.0000024601213],"category_scores_gemma":[0.00015563224,0.000222607,0.000078888435,0.0038373603,0.0002258821,0.00086729607,0.0011099128,0.00026517684,0.000017304157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016843516,0.000075892094,0.012405543,0.000056926638,0.000003386864,0.000046949102,0.00048655362,0.19230959,0.0010696558,0.0009207394,0.00012781935,0.7924801],"study_design_scores_gemma":[0.0004972806,0.00011400463,0.013175308,0.000060670583,0.000001476899,0.000008476748,6.9417257e-7,0.9588229,0.0089589,0.017746704,0.00032867354,0.00028492938],"about_ca_topic_score_codex":0.00010446276,"about_ca_topic_score_gemma":0.000071477014,"teacher_disagreement_score":0.79219514,"about_ca_system_score_codex":0.00011278019,"about_ca_system_score_gemma":0.00021986794,"threshold_uncertainty_score":0.90776503},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036079993,0.00008970743,0.99084306,0.0003199539,0.003964966,0.000260803,0.0000079275005,0.0004548081,0.0040226853],"genre_scores_gemma":[0.21829145,0.00034895513,0.76105165,0.006022486,0.004210267,0.000073521485,0.000064267384,0.00033230783,0.00960509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996067,0.000029616102,0.0004065617,0.0016981148,0.0011884884,0.0006102308],"domain_scores_gemma":[0.99707866,0.00061035214,0.0002171401,0.0017757809,0.0001437735,0.00017432559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006644186,0.00048832543,0.00040945434,0.0010216187,0.0003378798,0.00056371675,0.0032516597,0.0003286305,0.000015122288],"category_scores_gemma":[0.000108395856,0.00041774914,0.00012745475,0.000789875,0.00031008225,0.0005877229,0.0017372138,0.0008794617,0.0003930739],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052132136,0.000017454504,0.0000017783423,0.00001144446,0.0000045170755,0.00009038752,0.00012264623,0.0089869425,0.00011928798,0.020477438,0.00007353088,0.9700894],"study_design_scores_gemma":[0.00022934025,0.00033462615,0.0001356318,0.0003564598,0.000004021396,0.00003557958,5.264959e-8,0.6907585,0.0019312465,0.30354714,0.0020742593,0.0005931182],"about_ca_topic_score_codex":0.00003029538,"about_ca_topic_score_gemma":0.00013746537,"teacher_disagreement_score":0.96949625,"about_ca_system_score_codex":0.00024435416,"about_ca_system_score_gemma":0.00024246557,"threshold_uncertainty_score":0.99982744},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009854211,0.00015915564,0.985028,0.0011538219,0.0078005185,0.00063948974,0.000009572189,0.0009136025,0.0041972813],"genre_scores_gemma":[0.12420021,0.00007222639,0.8662532,0.0025546143,0.0035688414,0.000051949097,0.000021419759,0.00020730819,0.0030702457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99317455,0.00006232595,0.0008082506,0.0028510555,0.0018434555,0.0012603574],"domain_scores_gemma":[0.9948088,0.0013125505,0.00033930384,0.0028010786,0.00038878145,0.00034950476],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015731573,0.0008372424,0.0008645357,0.0013176682,0.00035682516,0.00094691163,0.0071122493,0.0005145246,0.000032624903],"category_scores_gemma":[0.00028613946,0.0007917943,0.00029770585,0.0015211245,0.0011264622,0.00070238125,0.0051743644,0.0012710466,0.00047445635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053293234,0.00003994272,0.00022894247,0.000043472643,0.000014955137,0.00041836835,0.00040562617,0.03404765,0.000019447958,0.040457707,0.000109870154,0.9242087],"study_design_scores_gemma":[0.00023718597,0.00021018503,0.0012470451,0.00015738029,0.0000061132105,0.000082248895,5.8043415e-8,0.5246454,0.0001352974,0.47137514,0.0011204052,0.00078352285],"about_ca_topic_score_codex":0.00005991755,"about_ca_topic_score_gemma":0.00057492784,"teacher_disagreement_score":0.92342514,"about_ca_system_score_codex":0.0005342109,"about_ca_system_score_gemma":0.0009787775,"threshold_uncertainty_score":0.9994533},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010765104,0.00011179516,0.9933352,0.0019049989,0.0022379067,0.0009432368,0.00002779011,0.00035307402,0.000978349],"genre_scores_gemma":[0.0055996645,0.0000387748,0.9822529,0.001634729,0.000544757,0.00007497093,0.00005261441,0.00007462649,0.009726957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961849,0.00004830707,0.0005471611,0.0014454392,0.00095040206,0.0008238024],"domain_scores_gemma":[0.9977183,0.00054009014,0.00022161542,0.0008244857,0.0004412296,0.00025428683],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011082146,0.00044259644,0.0004720474,0.0010889925,0.0005945814,0.0010688487,0.0021199312,0.0002848841,0.00006118702],"category_scores_gemma":[0.00027849065,0.00044917775,0.00016158605,0.00062162813,0.00034825085,0.00072782784,0.0015579464,0.00038834402,0.00020382422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000319125,0.000047279937,0.000035045992,0.00021955145,0.000047830024,0.00013732606,0.0029458127,0.82303905,0.004022761,0.036500856,0.0012224666,0.1317501],"study_design_scores_gemma":[0.0003013741,0.00018964855,0.00004264802,0.0003811282,0.000007015161,0.000025766836,3.730597e-7,0.8977257,0.00069663284,0.09917514,0.0008255225,0.0006290733],"about_ca_topic_score_codex":0.000027310576,"about_ca_topic_score_gemma":0.00006254494,"teacher_disagreement_score":0.13112104,"about_ca_system_score_codex":0.00046051884,"about_ca_system_score_gemma":0.0005621862,"threshold_uncertainty_score":0.9999681},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003901983,0.00016394713,0.9980396,0.00028843276,0.0006055325,0.00013878605,0.0000028860402,0.00007672777,0.00029388964],"genre_scores_gemma":[0.93196183,0.00021022026,0.06651227,0.00033203687,0.00018951793,0.0000046719724,0.000011836876,0.000032350803,0.000745264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755967,0.000022540526,0.00056159205,0.0009101672,0.0006904447,0.00025557508],"domain_scores_gemma":[0.9982714,0.00030285123,0.00039056534,0.00073877646,0.00023539258,0.000060982187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010243182,0.00023103885,0.00035151,0.0008543983,0.00015088826,0.00038794914,0.0013055833,0.00017291527,0.0000026497685],"category_scores_gemma":[0.00015861807,0.00021972295,0.00007990143,0.0008031701,0.00029258634,0.0005779079,0.0005432514,0.00026657069,0.0000117952395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018938305,0.000010758007,0.0002552174,0.000054178676,0.000016512467,0.0000137452735,0.0010566028,0.040637523,0.001250918,0.035378378,0.000009244909,0.921315],"study_design_scores_gemma":[0.00009957317,0.000040651696,0.0012205883,0.00017797448,0.000013785769,0.0000062120616,3.722978e-7,0.9357134,0.0025035986,0.059852943,0.00009250191,0.00027839578],"about_ca_topic_score_codex":0.000024838751,"about_ca_topic_score_gemma":0.00007904654,"teacher_disagreement_score":0.93157166,"about_ca_system_score_codex":0.00007056569,"about_ca_system_score_gemma":0.00013825216,"threshold_uncertainty_score":0.89600414},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004484316,0.00006180276,0.99391514,0.00022396546,0.0010474365,0.0004540709,0.000006162853,0.00039621672,0.003446794],"genre_scores_gemma":[0.78957164,0.0001206116,0.20827949,0.0004939013,0.00024004577,0.000043304335,0.000008742227,0.00006832039,0.0011739217],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964708,0.0000533164,0.0007418029,0.001225839,0.00097407267,0.00053413527],"domain_scores_gemma":[0.99787766,0.00035235623,0.00036778266,0.0010206915,0.00027723805,0.00010427462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010540074,0.00039801517,0.0005308073,0.0022092953,0.00009082896,0.00029636195,0.002384204,0.000379371,0.000016584621],"category_scores_gemma":[0.00016128556,0.00039826546,0.000120104785,0.0015711429,0.00041741182,0.0009360622,0.0010603953,0.00081672927,0.000053433854],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006366131,0.000028840992,0.000035073554,0.000043176795,0.000006842232,0.00008871326,0.00022124442,0.00051209045,0.003351016,0.0041624154,0.000010873093,0.99153334],"study_design_scores_gemma":[0.00093178323,0.0007289239,0.001584632,0.0022870747,0.000013567249,0.00015148237,5.113486e-7,0.22954243,0.2293874,0.5319121,0.0018255903,0.001634546],"about_ca_topic_score_codex":0.00016032731,"about_ca_topic_score_gemma":0.00042436225,"teacher_disagreement_score":0.9898988,"about_ca_system_score_codex":0.00034134963,"about_ca_system_score_gemma":0.0003492032,"threshold_uncertainty_score":0.99984694},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036172316,0.00007162397,0.89465916,0.0012645863,0.0025255152,0.0016776519,0.00039260485,0.00019891092,0.0988482],"genre_scores_gemma":[0.7753618,0.0000699627,0.074451186,0.0068366844,0.005483517,0.00045963583,0.00042105935,0.00027489476,0.13664128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998478,0.000003655996,0.0002496579,0.00061119633,0.00028633772,0.00037117844],"domain_scores_gemma":[0.9990056,0.00054381875,0.00012215808,0.0001852585,0.000089607114,0.000053555166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002299625,0.000257858,0.00026057963,0.00036608728,0.00044632895,0.0009690266,0.0005006499,0.00003705406,0.00002823867],"category_scores_gemma":[0.00002882635,0.00021841351,0.00011569951,0.000043440617,0.0005176538,0.0004492126,0.0003040678,0.00012419451,0.000012658773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034869427,0.00002494043,0.0000059362883,0.00029061857,0.00004012504,0.0000066060265,0.0019603348,0.0021169875,0.0000041455796,0.7341451,0.00043235204,0.260938],"study_design_scores_gemma":[0.0002888822,0.00027213717,0.00015863102,0.00044660154,0.000021284957,0.0000019529082,0.000002254302,0.036274616,0.00001767072,0.9021066,0.06003752,0.000371878],"about_ca_topic_score_codex":0.000007535383,"about_ca_topic_score_gemma":0.00017014271,"teacher_disagreement_score":0.820208,"about_ca_system_score_codex":0.000049631366,"about_ca_system_score_gemma":0.000100367644,"threshold_uncertainty_score":0.9344346},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015422604,0.00032150315,0.9780643,0.00057555124,0.0022073525,0.00053159904,0.00024244384,0.00012411196,0.0025105537],"genre_scores_gemma":[0.879586,0.0000812028,0.1142267,0.00080125174,0.0007463391,0.0000126974455,0.00019089386,0.00010330883,0.00425165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99118304,0.0002688609,0.0017246824,0.0027458093,0.0034473313,0.00063029176],"domain_scores_gemma":[0.9883553,0.0059643183,0.0016201409,0.0025211615,0.0013016433,0.00023745968],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.015436731,0.00046819224,0.0008136839,0.0017776391,0.0004408657,0.0030579714,0.006247127,0.0005142566,0.00016853769],"category_scores_gemma":[0.030179119,0.0003884916,0.00021105914,0.0027556513,0.00083072274,0.004903849,0.0044771205,0.0017220966,0.000049640348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001992832,0.00016514427,0.036451798,0.0004169807,0.00009716404,0.00009804603,0.0085138595,0.1359161,0.013570558,0.013529446,0.0075379186,0.7835037],"study_design_scores_gemma":[0.0008619854,0.000064705215,0.0064412975,0.0037589318,0.000052940442,0.000035193407,0.000029010776,0.6692381,0.008134804,0.30676708,0.0027932886,0.0018226405],"about_ca_topic_score_codex":0.0004955934,"about_ca_topic_score_gemma":0.0001379181,"teacher_disagreement_score":0.86416334,"about_ca_system_score_codex":0.00028405883,"about_ca_system_score_gemma":0.000749959,"threshold_uncertainty_score":0.9998567},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012829377,0.0003421583,0.99512345,0.00045072663,0.0020793672,0.00022198558,0.0000014000282,0.00053139107,0.0011212503],"genre_scores_gemma":[0.92179745,0.00003192123,0.068456694,0.0014669768,0.0015376635,0.000014347868,0.000014870251,0.000080784725,0.0065992833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99428135,0.00008492301,0.00071705226,0.0020254382,0.0013220693,0.0015691678],"domain_scores_gemma":[0.9976905,0.0006823389,0.00036944757,0.00084304553,0.00024789496,0.00016674762],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020123946,0.0005924121,0.0007029172,0.0011885049,0.00033409076,0.00096719054,0.0055397986,0.00035545937,0.000015123151],"category_scores_gemma":[0.00019912557,0.0005409648,0.0002909477,0.0024523502,0.0003679471,0.00052971544,0.0018223921,0.001577683,0.00029565333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026151706,0.00003919092,0.00002700907,0.000062248815,0.000051909243,0.00019638719,0.0016098289,0.3497455,0.00002048671,0.20668079,0.0006705441,0.44089347],"study_design_scores_gemma":[0.0001275561,0.000100893936,0.000022757578,0.00030629613,0.000011301798,0.000039661365,2.2647718e-7,0.99028164,0.000083098486,0.0071476568,0.0012869309,0.00059196976],"about_ca_topic_score_codex":0.000012033131,"about_ca_topic_score_gemma":0.00036982904,"teacher_disagreement_score":0.92666674,"about_ca_system_score_codex":0.00090148894,"about_ca_system_score_gemma":0.0018354227,"threshold_uncertainty_score":0.9998407},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009670518,0.47662815,0.5221114,0.0001022454,0.00059383054,0.00041877254,0.0000086933915,0.00012089451,0.000006341812],"genre_scores_gemma":[0.0028394856,0.8983643,0.09613543,0.0021282726,0.00030658173,0.00007533635,0.000057725654,0.00007111313,0.000021731345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99274796,0.00049564114,0.0018462539,0.0019885406,0.0016866636,0.0012349463],"domain_scores_gemma":[0.9963562,0.0013377527,0.0006752972,0.001134563,0.00031604795,0.00018017093],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0056849336,0.0007927574,0.0026590254,0.0014744224,0.0001940296,0.00059757044,0.0057452996,0.00028587677,0.000027571581],"category_scores_gemma":[0.00073610473,0.0006362275,0.0006331942,0.006646959,0.00029382776,0.0004307161,0.0014632635,0.0019147994,0.00002843606],"study_design_candidate":"design_other","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":[7.359021e-7,0.00008669053,0.0000111446325,0.007799458,0.00002316773,0.0001789042,0.0011071558,0.03238561,1.4264187e-8,0.001259866,0.000022709071,0.95712453],"study_design_scores_gemma":[0.00016858176,0.00007762474,0.000006277819,0.123620935,0.000053291184,0.00003220307,0.0000014236642,0.8166592,3.6842928e-7,0.00005090718,0.058587246,0.0007419463],"about_ca_topic_score_codex":0.0065262765,"about_ca_topic_score_gemma":0.29970533,"teacher_disagreement_score":0.9563826,"about_ca_system_score_codex":0.0021502718,"about_ca_system_score_gemma":0.0055951374,"threshold_uncertainty_score":0.9996341},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010881389,0.00009439836,0.98435235,0.0003464643,0.0027165476,0.00026829547,0.0000029642522,0.00021421685,0.0011233587],"genre_scores_gemma":[0.9479182,0.000016891512,0.048738386,0.00050870766,0.00028711685,0.000027504644,0.000014310294,0.000031032472,0.0024578504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953097,0.00005766466,0.0008118911,0.0019443323,0.0010704978,0.0008059069],"domain_scores_gemma":[0.9981136,0.00041429896,0.00025301878,0.00087689504,0.00019473996,0.00014748905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012326229,0.0005086885,0.00065830763,0.0011753137,0.0002539101,0.00047822413,0.0032827305,0.00031371927,0.00012925103],"category_scores_gemma":[0.00013498966,0.00047122166,0.00022471488,0.0013847558,0.00054916186,0.0005389394,0.001147627,0.0015924774,0.000051734376],"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.000020483616,0.00038581833,0.0013946862,0.000058909616,0.00006909071,0.00078634336,0.054411262,0.45044866,0.000057029818,0.1336072,0.0001314012,0.3586291],"study_design_scores_gemma":[0.00016130017,0.00014725701,0.0007609238,0.00022288432,0.00000652744,0.000036043584,0.000007846584,0.9900148,0.0000542604,0.007141231,0.00081500446,0.00063192577],"about_ca_topic_score_codex":0.003283586,"about_ca_topic_score_gemma":0.32068524,"teacher_disagreement_score":0.9370368,"about_ca_system_score_codex":0.0009635448,"about_ca_system_score_gemma":0.0011365071,"threshold_uncertainty_score":0.9997739},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053569954,0.00008431556,0.99686426,0.0008146246,0.00076800404,0.00065222953,0.000023162831,0.00007206968,0.00018563938],"genre_scores_gemma":[0.3511752,0.00020996263,0.6454283,0.0008434668,0.0017141307,0.00024836487,0.000077817036,0.000054226362,0.00024855707],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982453,0.000033966397,0.0003144218,0.00064660626,0.000498542,0.00026118982],"domain_scores_gemma":[0.99581546,0.0031911042,0.00024437148,0.00037006385,0.00032726472,0.000051716805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082643866,0.00021336226,0.00028377795,0.00031265826,0.00028492772,0.00016438054,0.0005588985,0.000110544264,0.0000043111563],"category_scores_gemma":[0.00008844399,0.00016492503,0.00013052506,0.000390051,0.0006048403,0.0003538725,0.00024286372,0.00027822456,0.0000058368173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011994805,0.000041612122,0.000045768462,0.00008866977,0.0000210735,0.0000019231777,0.0006767181,0.013966975,0.000076115335,0.04049543,0.00016351441,0.9444102],"study_design_scores_gemma":[0.00018694323,0.00026796936,0.0012598089,0.00026677205,0.000017543509,0.000005190146,7.1688845e-7,0.36453795,0.000080758844,0.6330694,0.0001359123,0.0001710472],"about_ca_topic_score_codex":0.000008369581,"about_ca_topic_score_gemma":0.000025285732,"teacher_disagreement_score":0.94423914,"about_ca_system_score_codex":0.00007880463,"about_ca_system_score_gemma":0.00021730916,"threshold_uncertainty_score":0.6725448},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020036513,0.0010863061,0.990855,0.0027516708,0.0036839836,0.00040535934,0.000004287754,0.00064189674,0.00037114782],"genre_scores_gemma":[0.5926361,0.00060398836,0.36247572,0.010691965,0.012456769,0.00015470646,0.00022574916,0.00060517876,0.020149827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945511,0.00029830268,0.0006899841,0.0021394647,0.0010966961,0.0012244153],"domain_scores_gemma":[0.9963312,0.0015959521,0.00037310974,0.001176963,0.0001853816,0.00033737198],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019639565,0.00062762573,0.0006856794,0.0010260722,0.0006775142,0.0009579775,0.003129735,0.00045680642,0.000012611634],"category_scores_gemma":[0.0005951942,0.00060027867,0.00011228097,0.002265946,0.00067030767,0.0004472445,0.0029505095,0.00339487,0.000047646845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037343261,0.0000073678334,0.00092093303,0.000053360294,0.000004815831,0.00013016856,0.00030496842,0.4926092,0.000003493371,0.0007763819,0.00007889706,0.5051067],"study_design_scores_gemma":[0.00009101592,0.00021282147,0.0009215031,0.0001977352,0.0000051718453,0.0000855281,1.6208183e-7,0.9799713,0.000010702583,0.016868366,0.001066497,0.00056921283],"about_ca_topic_score_codex":0.00023230405,"about_ca_topic_score_gemma":0.0005668237,"teacher_disagreement_score":0.6283793,"about_ca_system_score_codex":0.000336351,"about_ca_system_score_gemma":0.0006686277,"threshold_uncertainty_score":0.9996449},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020036513,0.0010863061,0.990855,0.0027516708,0.0036839836,0.00040535934,0.000004287754,0.00064189674,0.00037114782],"genre_scores_gemma":[0.5926361,0.00060398836,0.36247572,0.010691965,0.012456769,0.00015470646,0.00022574916,0.00060517876,0.020149827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945511,0.00029830268,0.0006899841,0.0021394647,0.0010966961,0.0012244153],"domain_scores_gemma":[0.9963312,0.0015959521,0.00037310974,0.001176963,0.0001853816,0.00033737198],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019639565,0.00062762573,0.0006856794,0.0010260722,0.0006775142,0.0009579775,0.003129735,0.00045680642,0.000012611634],"category_scores_gemma":[0.0005951942,0.00060027867,0.00011228097,0.002265946,0.00067030767,0.0004472445,0.0029505095,0.00339487,0.000047646845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037343261,0.0000073678334,0.00092093303,0.000053360294,0.000004815831,0.00013016856,0.00030496842,0.4926092,0.000003493371,0.0007763819,0.00007889706,0.5051067],"study_design_scores_gemma":[0.00009101592,0.00021282147,0.0009215031,0.0001977352,0.0000051718453,0.0000855281,1.6208183e-7,0.9799713,0.000010702583,0.016868366,0.001066497,0.00056921283],"about_ca_topic_score_codex":0.00023230405,"about_ca_topic_score_gemma":0.0005668237,"teacher_disagreement_score":0.6283793,"about_ca_system_score_codex":0.000336351,"about_ca_system_score_gemma":0.0006686277,"threshold_uncertainty_score":0.9996449},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004687977,0.000102788494,0.9936252,0.0004889085,0.003394365,0.0005327487,0.0000044275757,0.0003870484,0.0009956984],"genre_scores_gemma":[0.14352396,0.000016854518,0.8544722,0.0004199672,0.0009931562,0.00001126252,0.000009013657,0.00006839641,0.0004851436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949796,0.00012566552,0.00073259434,0.0021506068,0.0011393445,0.00087215734],"domain_scores_gemma":[0.99725044,0.0007184643,0.00049656857,0.0010521553,0.0002762003,0.00020618142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017094215,0.0006040007,0.00062590325,0.00091778475,0.0005452113,0.0006243172,0.002615714,0.0004787542,0.000012841409],"category_scores_gemma":[0.00022163939,0.0006099538,0.00016812963,0.0007677193,0.0006261231,0.0007397055,0.0014088972,0.0014029414,0.000084817824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022965058,0.0000457808,0.00022064314,0.00005826371,0.00004683573,0.0002623854,0.0048205634,0.38222328,0.0039373874,0.08652216,0.000008485391,0.5218313],"study_design_scores_gemma":[0.0005891684,0.00007005993,0.00015276496,0.00033465476,0.000008524383,0.000040380346,0.0000032453027,0.9338001,0.00013814982,0.063787945,0.00044802867,0.0006269782],"about_ca_topic_score_codex":0.00005371625,"about_ca_topic_score_gemma":0.000076103104,"teacher_disagreement_score":0.5515768,"about_ca_system_score_codex":0.0006830213,"about_ca_system_score_gemma":0.000788369,"threshold_uncertainty_score":0.99963516},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017733974,0.0003402523,0.95823264,0.026422791,0.0014889543,0.0009921464,0.00002782814,0.0009323256,0.009789684],"genre_scores_gemma":[0.9693034,0.0006235047,0.019946836,0.003014057,0.0010226226,0.000046255333,0.000060235197,0.00009753985,0.0058855377],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732363,0.00006778524,0.00038266214,0.00081027794,0.0007151621,0.0007004908],"domain_scores_gemma":[0.9987069,0.0004654082,0.00015159306,0.00043571705,0.000073072704,0.00016735941],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015213217,0.00024744816,0.00035137907,0.00034617077,0.0007956008,0.00048769984,0.0009877288,0.00026978593,0.0000052947335],"category_scores_gemma":[0.00031959065,0.000245998,0.000055893765,0.0010418318,0.0036329909,0.0007133286,0.00029701766,0.00061459333,0.000020600351],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016686254,0.000015187378,0.0015460562,0.00008805542,0.000004339454,0.00001137573,0.016457671,0.00023041789,2.8728047e-7,0.001615827,0.00016555081,0.9798636],"study_design_scores_gemma":[0.00084868964,0.00030620207,0.020265998,0.0019317961,0.00001759781,0.000028018721,0.00011954103,0.024056977,0.00002836224,0.8894368,0.06122657,0.0017334385],"about_ca_topic_score_codex":0.00040969026,"about_ca_topic_score_gemma":0.010959094,"teacher_disagreement_score":0.9781301,"about_ca_system_score_codex":0.0007850037,"about_ca_system_score_gemma":0.0010652593,"threshold_uncertainty_score":0.9999992},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047571667,0.00015193645,0.946784,0.0003717485,0.0011884175,0.0012046552,0.00000204677,0.0001157404,0.0026097703],"genre_scores_gemma":[0.97109735,0.000008410951,0.01071649,0.000507759,0.00011981084,0.0000238792,0.000007035014,0.000030660467,0.017488606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789375,0.000023125385,0.00045119048,0.00067184033,0.0007406158,0.00021948309],"domain_scores_gemma":[0.9985326,0.0001539627,0.00031056872,0.0006348214,0.0002588865,0.00010917146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066012586,0.0002522048,0.00047192132,0.0004557121,0.00004603348,0.000043741962,0.00045849444,0.00009309982,0.00014609058],"category_scores_gemma":[0.00008400071,0.0001880071,0.000093173185,0.00038136402,0.0003849283,0.00013265085,0.0002428822,0.0005268136,0.00009306678],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002901951,0.00054654985,0.007892073,0.00078737666,0.00023004452,0.009844412,0.023847055,0.00035643362,0.00006395667,0.0008641308,0.0005574994,0.95472026],"study_design_scores_gemma":[0.04207614,0.0348728,0.009102946,0.09964041,0.0020655089,0.03931118,0.0013551387,0.6600758,0.008475541,0.091683,0.004379812,0.006961724],"about_ca_topic_score_codex":0.00034445332,"about_ca_topic_score_gemma":0.00031305203,"teacher_disagreement_score":0.94775856,"about_ca_system_score_codex":0.000093921066,"about_ca_system_score_gemma":0.00025316002,"threshold_uncertainty_score":0.76667076},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016300306,0.000104885505,0.99324065,0.0014868755,0.0017058409,0.0027443948,0.000072218405,0.0002564059,0.0003724399],"genre_scores_gemma":[0.13478328,0.000048119786,0.8544043,0.0021235882,0.0020871912,0.0017752837,0.000059230726,0.00016883214,0.0045501976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957325,0.000041252464,0.00062461954,0.0020571442,0.00089287985,0.00065159803],"domain_scores_gemma":[0.99532807,0.002505647,0.0005286989,0.0012509247,0.00023513053,0.00015153972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013479072,0.00051192223,0.00061333255,0.000702481,0.0003709378,0.00039535816,0.0026331332,0.0003519771,0.000003820229],"category_scores_gemma":[0.00019808993,0.0005023815,0.00023680541,0.0004532313,0.0004465192,0.00057290605,0.00075888215,0.00035988947,0.00008562108],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026254573,0.000026649188,0.000013534456,0.00006731132,0.000030428659,0.000006317832,0.0005416606,0.004114879,0.0005214164,0.01577184,0.00012323757,0.9787565],"study_design_scores_gemma":[0.000633058,0.0004797037,0.000084272884,0.00046583527,0.0000240397,0.000026354732,0.0000016166008,0.6209603,0.003134745,0.35988778,0.013332433,0.00096987624],"about_ca_topic_score_codex":0.000035349043,"about_ca_topic_score_gemma":0.00034778262,"teacher_disagreement_score":0.9777866,"about_ca_system_score_codex":0.00039977476,"about_ca_system_score_gemma":0.0005122289,"threshold_uncertainty_score":0.9997428},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002597662,0.000049594895,0.9949476,0.001173074,0.00017329931,0.00026261652,0.000012915853,0.0003234062,0.00045984142],"genre_scores_gemma":[0.18727249,0.00013364002,0.8095219,0.0020713552,0.0005528722,0.000011586028,0.00019926709,0.000034533587,0.00020234904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985661,0.000012641326,0.00031296635,0.00040382743,0.00044425737,0.00026023903],"domain_scores_gemma":[0.9990625,0.00022258135,0.00015842101,0.00034223672,0.000102235535,0.00011202396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003043874,0.00022447141,0.00034485018,0.00026982365,0.00016411058,0.00009836191,0.00032567274,0.00012569505,0.000072540126],"category_scores_gemma":[0.0002869608,0.00017528415,0.00007538859,0.0002254766,0.0004024595,0.00017753942,0.00039981486,0.0009128786,0.000044676326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003609841,0.00008287076,0.0017749455,0.00030190113,0.000060844246,0.0003197196,0.0008439381,0.012360567,0.058136377,0.002631549,0.0004772683,0.92297393],"study_design_scores_gemma":[0.00020041216,0.00008987748,0.0007664156,0.00091910135,0.000030572075,0.00007170985,3.147149e-7,0.9580921,0.0021772357,0.035268694,0.0020884818,0.0002950942],"about_ca_topic_score_codex":0.00012752693,"about_ca_topic_score_gemma":0.0000052334194,"teacher_disagreement_score":0.9457315,"about_ca_system_score_codex":0.00011366851,"about_ca_system_score_gemma":0.00013611231,"threshold_uncertainty_score":0.71478796},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27593842,0.000096915275,0.7201181,0.00015786877,0.0017535146,0.00097468944,0.00007258133,0.0003749267,0.0005129752],"genre_scores_gemma":[0.98297155,0.000031823118,0.015726965,0.0005482088,0.00027072654,0.000005414001,0.000014906616,0.00009093384,0.0003394921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995946,0.000059202703,0.00043200795,0.0020577319,0.0008333475,0.0006716933],"domain_scores_gemma":[0.9979403,0.0003348789,0.00023417326,0.0013135056,0.000070773865,0.00010634322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059463055,0.0004751274,0.00042797765,0.0010376842,0.00023715521,0.0004603647,0.0025810932,0.0002447537,0.000012020235],"category_scores_gemma":[0.00014047258,0.00040349958,0.000044061293,0.0011448589,0.00073338277,0.0007213949,0.0013772928,0.0010140587,0.000038229442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007874499,0.00016369198,0.005576522,0.00006900154,0.000027193264,0.0005246873,0.0010763984,0.29639563,0.071558386,0.00012577526,0.00003024749,0.62437373],"study_design_scores_gemma":[0.0009462739,0.0005623242,0.0052035,0.001899163,0.000041866253,0.00082895963,9.3131524e-7,0.84403455,0.13857664,0.0060881646,0.0001301396,0.0016874607],"about_ca_topic_score_codex":0.00024560565,"about_ca_topic_score_gemma":0.0005993464,"teacher_disagreement_score":0.7070331,"about_ca_system_score_codex":0.00020773386,"about_ca_system_score_gemma":0.0002696601,"threshold_uncertainty_score":0.9998417},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23586224,0.000042003736,0.74427086,0.0015645705,0.0010963327,0.0074040447,0.00011107602,0.0013226086,0.00832626],"genre_scores_gemma":[0.99161136,0.000009200936,0.0075469,0.000054183263,0.00006334099,0.00047282758,0.000040834828,0.000038316197,0.00016305695],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99766284,0.00030430438,0.00038799198,0.00077449606,0.0004825582,0.00038778572],"domain_scores_gemma":[0.99116665,0.006533852,0.00031754174,0.0015507393,0.0003645877,0.00006665253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013188369,0.0003070725,0.00060122425,0.00034835207,0.00039364162,0.000014068733,0.0009738545,0.00034884113,0.000011361137],"category_scores_gemma":[0.00046891227,0.0002294934,0.00008280779,0.0005120035,0.0015543973,0.00007594271,0.0004843641,0.001295429,0.00006423251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001166264,0.0015848656,0.09276991,0.004035065,0.00014115646,0.0000077039795,0.01294244,0.0051137274,0.0006491285,0.21611136,0.000037959468,0.66544044],"study_design_scores_gemma":[0.002665039,0.0045662094,0.45984474,0.010199637,0.000106429296,0.000004773467,0.00005525908,0.065530285,0.0027310224,0.45218349,0.0004266563,0.0016864687],"about_ca_topic_score_codex":0.000086292566,"about_ca_topic_score_gemma":0.00032316337,"teacher_disagreement_score":0.7557491,"about_ca_system_score_codex":0.00040275315,"about_ca_system_score_gemma":0.000514637,"threshold_uncertainty_score":0.9358469},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019156463,0.000093176175,0.9924461,0.00034287255,0.0027449375,0.00064656616,0.0000201834,0.0006468327,0.0028677403],"genre_scores_gemma":[0.08019818,0.00012033991,0.9154555,0.0005363264,0.0012899508,0.000055762146,0.000019068193,0.00015194024,0.0021728883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953351,0.000089107816,0.0006392323,0.0019079904,0.00096461776,0.001063967],"domain_scores_gemma":[0.99318993,0.004549393,0.00041162595,0.0014386326,0.0002553267,0.0001551163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029209016,0.0006619215,0.0008702015,0.0010275634,0.0005402963,0.0009135301,0.003006745,0.0004016994,0.000008865856],"category_scores_gemma":[0.00053129945,0.00064239284,0.00030205533,0.00076838414,0.0004884959,0.0008979972,0.00094470434,0.00069951743,0.000052823303],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018582821,0.000021760623,0.0001763571,0.00010814133,0.000033433113,0.000086287626,0.0012529952,0.021972526,0.0025014365,0.006751812,0.000043053165,0.9670336],"study_design_scores_gemma":[0.00081409526,0.00033844457,0.0008222932,0.001110694,0.000020121402,0.00007591864,8.455506e-7,0.79125196,0.010816957,0.19111629,0.0019167998,0.0017155816],"about_ca_topic_score_codex":0.00004289727,"about_ca_topic_score_gemma":0.00015453764,"teacher_disagreement_score":0.965318,"about_ca_system_score_codex":0.00030249511,"about_ca_system_score_gemma":0.000613245,"threshold_uncertainty_score":0.99960274},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020036513,0.0010863061,0.990855,0.0027516708,0.0036839836,0.00040535934,0.000004287754,0.00064189674,0.00037114782],"genre_scores_gemma":[0.5926361,0.00060398836,0.36247572,0.010691965,0.012456769,0.00015470646,0.00022574916,0.00060517876,0.020149827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945511,0.00029830268,0.0006899841,0.0021394647,0.0010966961,0.0012244153],"domain_scores_gemma":[0.9963312,0.0015959521,0.00037310974,0.001176963,0.0001853816,0.00033737198],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019639565,0.00062762573,0.0006856794,0.0010260722,0.0006775142,0.0009579775,0.003129735,0.00045680642,0.000012611634],"category_scores_gemma":[0.0005951942,0.00060027867,0.00011228097,0.002265946,0.00067030767,0.0004472445,0.0029505095,0.00339487,0.000047646845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037343261,0.0000073678334,0.00092093303,0.000053360294,0.000004815831,0.00013016856,0.00030496842,0.4926092,0.000003493371,0.0007763819,0.00007889706,0.5051067],"study_design_scores_gemma":[0.00009101592,0.00021282147,0.0009215031,0.0001977352,0.0000051718453,0.0000855281,1.6208183e-7,0.9799713,0.000010702583,0.016868366,0.001066497,0.00056921283],"about_ca_topic_score_codex":0.00023230405,"about_ca_topic_score_gemma":0.0005668237,"teacher_disagreement_score":0.6283793,"about_ca_system_score_codex":0.000336351,"about_ca_system_score_gemma":0.0006686277,"threshold_uncertainty_score":0.9996449},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020036513,0.0010863061,0.990855,0.0027516708,0.0036839836,0.00040535934,0.000004287754,0.00064189674,0.00037114782],"genre_scores_gemma":[0.5926361,0.00060398836,0.36247572,0.010691965,0.012456769,0.00015470646,0.00022574916,0.00060517876,0.020149827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945511,0.00029830268,0.0006899841,0.0021394647,0.0010966961,0.0012244153],"domain_scores_gemma":[0.9963312,0.0015959521,0.00037310974,0.001176963,0.0001853816,0.00033737198],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019639565,0.00062762573,0.0006856794,0.0010260722,0.0006775142,0.0009579775,0.003129735,0.00045680642,0.000012611634],"category_scores_gemma":[0.0005951942,0.00060027867,0.00011228097,0.002265946,0.00067030767,0.0004472445,0.0029505095,0.00339487,0.000047646845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037343261,0.0000073678334,0.00092093303,0.000053360294,0.000004815831,0.00013016856,0.00030496842,0.4926092,0.000003493371,0.0007763819,0.00007889706,0.5051067],"study_design_scores_gemma":[0.00009101592,0.00021282147,0.0009215031,0.0001977352,0.0000051718453,0.0000855281,1.6208183e-7,0.9799713,0.000010702583,0.016868366,0.001066497,0.00056921283],"about_ca_topic_score_codex":0.00023230405,"about_ca_topic_score_gemma":0.0005668237,"teacher_disagreement_score":0.6283793,"about_ca_system_score_codex":0.000336351,"about_ca_system_score_gemma":0.0006686277,"threshold_uncertainty_score":0.9996449},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020036513,0.0010863061,0.990855,0.0027516708,0.0036839836,0.00040535934,0.000004287754,0.00064189674,0.00037114782],"genre_scores_gemma":[0.5926361,0.00060398836,0.36247572,0.010691965,0.012456769,0.00015470646,0.00022574916,0.00060517876,0.020149827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945511,0.00029830268,0.0006899841,0.0021394647,0.0010966961,0.0012244153],"domain_scores_gemma":[0.9963312,0.0015959521,0.00037310974,0.001176963,0.0001853816,0.00033737198],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019639565,0.00062762573,0.0006856794,0.0010260722,0.0006775142,0.0009579775,0.003129735,0.00045680642,0.000012611634],"category_scores_gemma":[0.0005951942,0.00060027867,0.00011228097,0.002265946,0.00067030767,0.0004472445,0.0029505095,0.00339487,0.000047646845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037343261,0.0000073678334,0.00092093303,0.000053360294,0.000004815831,0.00013016856,0.00030496842,0.4926092,0.000003493371,0.0007763819,0.00007889706,0.5051067],"study_design_scores_gemma":[0.00009101592,0.00021282147,0.0009215031,0.0001977352,0.0000051718453,0.0000855281,1.6208183e-7,0.9799713,0.000010702583,0.016868366,0.001066497,0.00056921283],"about_ca_topic_score_codex":0.00023230405,"about_ca_topic_score_gemma":0.0005668237,"teacher_disagreement_score":0.6283793,"about_ca_system_score_codex":0.000336351,"about_ca_system_score_gemma":0.0006686277,"threshold_uncertainty_score":0.9996449},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020036513,0.0010863061,0.990855,0.0027516708,0.0036839836,0.00040535934,0.000004287754,0.00064189674,0.00037114782],"genre_scores_gemma":[0.5926361,0.00060398836,0.36247572,0.010691965,0.012456769,0.00015470646,0.00022574916,0.00060517876,0.020149827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945511,0.00029830268,0.0006899841,0.0021394647,0.0010966961,0.0012244153],"domain_scores_gemma":[0.9963312,0.0015959521,0.00037310974,0.001176963,0.0001853816,0.00033737198],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019639565,0.00062762573,0.0006856794,0.0010260722,0.0006775142,0.0009579775,0.003129735,0.00045680642,0.000012611634],"category_scores_gemma":[0.0005951942,0.00060027867,0.00011228097,0.002265946,0.00067030767,0.0004472445,0.0029505095,0.00339487,0.000047646845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037343261,0.0000073678334,0.00092093303,0.000053360294,0.000004815831,0.00013016856,0.00030496842,0.4926092,0.000003493371,0.0007763819,0.00007889706,0.5051067],"study_design_scores_gemma":[0.00009101592,0.00021282147,0.0009215031,0.0001977352,0.0000051718453,0.0000855281,1.6208183e-7,0.9799713,0.000010702583,0.016868366,0.001066497,0.00056921283],"about_ca_topic_score_codex":0.00023230405,"about_ca_topic_score_gemma":0.0005668237,"teacher_disagreement_score":0.6283793,"about_ca_system_score_codex":0.000336351,"about_ca_system_score_gemma":0.0006686277,"threshold_uncertainty_score":0.9996449},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020036513,0.0010863061,0.990855,0.0027516708,0.0036839836,0.00040535934,0.000004287754,0.00064189674,0.00037114782],"genre_scores_gemma":[0.5926361,0.00060398836,0.36247572,0.010691965,0.012456769,0.00015470646,0.00022574916,0.00060517876,0.020149827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945511,0.00029830268,0.0006899841,0.0021394647,0.0010966961,0.0012244153],"domain_scores_gemma":[0.9963312,0.0015959521,0.00037310974,0.001176963,0.0001853816,0.00033737198],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019639565,0.00062762573,0.0006856794,0.0010260722,0.0006775142,0.0009579775,0.003129735,0.00045680642,0.000012611634],"category_scores_gemma":[0.0005951942,0.00060027867,0.00011228097,0.002265946,0.00067030767,0.0004472445,0.0029505095,0.00339487,0.000047646845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037343261,0.0000073678334,0.00092093303,0.000053360294,0.000004815831,0.00013016856,0.00030496842,0.4926092,0.000003493371,0.0007763819,0.00007889706,0.5051067],"study_design_scores_gemma":[0.00009101592,0.00021282147,0.0009215031,0.0001977352,0.0000051718453,0.0000855281,1.6208183e-7,0.9799713,0.000010702583,0.016868366,0.001066497,0.00056921283],"about_ca_topic_score_codex":0.00023230405,"about_ca_topic_score_gemma":0.0005668237,"teacher_disagreement_score":0.6283793,"about_ca_system_score_codex":0.000336351,"about_ca_system_score_gemma":0.0006686277,"threshold_uncertainty_score":0.9996449},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020036513,0.0010863061,0.990855,0.0027516708,0.0036839836,0.00040535934,0.000004287754,0.00064189674,0.00037114782],"genre_scores_gemma":[0.5926361,0.00060398836,0.36247572,0.010691965,0.012456769,0.00015470646,0.00022574916,0.00060517876,0.020149827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945511,0.00029830268,0.0006899841,0.0021394647,0.0010966961,0.0012244153],"domain_scores_gemma":[0.9963312,0.0015959521,0.00037310974,0.001176963,0.0001853816,0.00033737198],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019639565,0.00062762573,0.0006856794,0.0010260722,0.0006775142,0.0009579775,0.003129735,0.00045680642,0.000012611634],"category_scores_gemma":[0.0005951942,0.00060027867,0.00011228097,0.002265946,0.00067030767,0.0004472445,0.0029505095,0.00339487,0.000047646845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037343261,0.0000073678334,0.00092093303,0.000053360294,0.000004815831,0.00013016856,0.00030496842,0.4926092,0.000003493371,0.0007763819,0.00007889706,0.5051067],"study_design_scores_gemma":[0.00009101592,0.00021282147,0.0009215031,0.0001977352,0.0000051718453,0.0000855281,1.6208183e-7,0.9799713,0.000010702583,0.016868366,0.001066497,0.00056921283],"about_ca_topic_score_codex":0.00023230405,"about_ca_topic_score_gemma":0.0005668237,"teacher_disagreement_score":0.6283793,"about_ca_system_score_codex":0.000336351,"about_ca_system_score_gemma":0.0006686277,"threshold_uncertainty_score":0.9996449},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020036513,0.0010863061,0.990855,0.0027516708,0.0036839836,0.00040535934,0.000004287754,0.00064189674,0.00037114782],"genre_scores_gemma":[0.5926361,0.00060398836,0.36247572,0.010691965,0.012456769,0.00015470646,0.00022574916,0.00060517876,0.020149827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945511,0.00029830268,0.0006899841,0.0021394647,0.0010966961,0.0012244153],"domain_scores_gemma":[0.9963312,0.0015959521,0.00037310974,0.001176963,0.0001853816,0.00033737198],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019639565,0.00062762573,0.0006856794,0.0010260722,0.0006775142,0.0009579775,0.003129735,0.00045680642,0.000012611634],"category_scores_gemma":[0.0005951942,0.00060027867,0.00011228097,0.002265946,0.00067030767,0.0004472445,0.0029505095,0.00339487,0.000047646845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037343261,0.0000073678334,0.00092093303,0.000053360294,0.000004815831,0.00013016856,0.00030496842,0.4926092,0.000003493371,0.0007763819,0.00007889706,0.5051067],"study_design_scores_gemma":[0.00009101592,0.00021282147,0.0009215031,0.0001977352,0.0000051718453,0.0000855281,1.6208183e-7,0.9799713,0.000010702583,0.016868366,0.001066497,0.00056921283],"about_ca_topic_score_codex":0.00023230405,"about_ca_topic_score_gemma":0.0005668237,"teacher_disagreement_score":0.6283793,"about_ca_system_score_codex":0.000336351,"about_ca_system_score_gemma":0.0006686277,"threshold_uncertainty_score":0.9996449},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020036513,0.0010863061,0.990855,0.0027516708,0.0036839836,0.00040535934,0.000004287754,0.00064189674,0.00037114782],"genre_scores_gemma":[0.5926361,0.00060398836,0.36247572,0.010691965,0.012456769,0.00015470646,0.00022574916,0.00060517876,0.020149827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945511,0.00029830268,0.0006899841,0.0021394647,0.0010966961,0.0012244153],"domain_scores_gemma":[0.9963312,0.0015959521,0.00037310974,0.001176963,0.0001853816,0.00033737198],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019639565,0.00062762573,0.0006856794,0.0010260722,0.0006775142,0.0009579775,0.003129735,0.00045680642,0.000012611634],"category_scores_gemma":[0.0005951942,0.00060027867,0.00011228097,0.002265946,0.00067030767,0.0004472445,0.0029505095,0.00339487,0.000047646845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037343261,0.0000073678334,0.00092093303,0.000053360294,0.000004815831,0.00013016856,0.00030496842,0.4926092,0.000003493371,0.0007763819,0.00007889706,0.5051067],"study_design_scores_gemma":[0.00009101592,0.00021282147,0.0009215031,0.0001977352,0.0000051718453,0.0000855281,1.6208183e-7,0.9799713,0.000010702583,0.016868366,0.001066497,0.00056921283],"about_ca_topic_score_codex":0.00023230405,"about_ca_topic_score_gemma":0.0005668237,"teacher_disagreement_score":0.6283793,"about_ca_system_score_codex":0.000336351,"about_ca_system_score_gemma":0.0006686277,"threshold_uncertainty_score":0.9996449},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090704835,0.00025928702,0.9895025,0.00047898586,0.0067772176,0.0006705206,0.000009167783,0.0005063166,0.0008889734],"genre_scores_gemma":[0.35007066,0.00014058332,0.6414792,0.004860128,0.0019152728,0.00009574427,0.000021742311,0.0001742065,0.0012424679],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907381,0.00023378331,0.0009949992,0.0035971226,0.002324799,0.002111218],"domain_scores_gemma":[0.9946647,0.0013684202,0.00040315834,0.0027031077,0.00041101474,0.00044957848],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.005172697,0.0009353693,0.0009968448,0.0043598423,0.00066851353,0.0014685787,0.011316549,0.0004406307,0.000017091279],"category_scores_gemma":[0.0002469325,0.00086851406,0.00026171768,0.010870881,0.0072069047,0.0016167714,0.0040313387,0.0017214792,0.00021481137],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012210158,0.00014865655,0.00026073877,0.00013438515,0.000015292826,0.00079965254,0.004473942,0.09972322,0.00021512434,0.113954134,0.00014103374,0.7801216],"study_design_scores_gemma":[0.00039665384,0.00019831174,0.00047046295,0.00057423505,0.000004674221,0.00007480212,4.6876383e-7,0.45959675,0.0007449962,0.5370045,0.000106028354,0.0008281427],"about_ca_topic_score_codex":0.000021167845,"about_ca_topic_score_gemma":0.00005873931,"teacher_disagreement_score":0.7792935,"about_ca_system_score_codex":0.00071597233,"about_ca_system_score_gemma":0.0028378658,"threshold_uncertainty_score":0.999568},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003333863,0.00018930912,0.9942599,0.0013683335,0.001377821,0.00029500906,0.0000046780115,0.0002857582,0.0018857922],"genre_scores_gemma":[0.27214718,0.000106063744,0.7176151,0.0038670488,0.0011648887,0.000033224198,0.000047690315,0.00010874155,0.0049100164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637765,0.000026376449,0.0003696571,0.0014271028,0.0012463856,0.0005528086],"domain_scores_gemma":[0.9980337,0.00045186828,0.00020363694,0.0008642402,0.0002770185,0.00016952032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006042992,0.00045596602,0.00038123273,0.0011254622,0.00035126385,0.00069784233,0.0021408265,0.00020208699,0.000016327054],"category_scores_gemma":[0.000042896867,0.0003838595,0.00009688507,0.001216387,0.0003995621,0.000798354,0.0006603196,0.00054149993,0.00017482939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016427302,0.000035197794,0.000080317885,0.00006310669,0.00003760355,0.00018308459,0.0017053061,0.5293467,0.00024951767,0.052909598,0.00011892945,0.4152542],"study_design_scores_gemma":[0.0005541304,0.00054175657,0.0008161101,0.00052070955,0.000024796671,0.00017370214,8.2617856e-7,0.774473,0.0018094027,0.21515712,0.004509073,0.001419381],"about_ca_topic_score_codex":0.000019969739,"about_ca_topic_score_gemma":0.00010782761,"teacher_disagreement_score":0.4138348,"about_ca_system_score_codex":0.0001294574,"about_ca_system_score_gemma":0.00052371883,"threshold_uncertainty_score":0.99986136},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028448233,0.00086376077,0.99404794,0.00005231495,0.0010082992,0.0009197909,0.000004896666,0.00017656336,0.00008159986],"genre_scores_gemma":[0.95549494,0.00007813103,0.043562416,0.0001172072,0.00061013125,0.000034768334,0.000027002467,0.00007135537,0.0000040547447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979837,0.000023180537,0.00037951343,0.0006505291,0.00048253997,0.00048053186],"domain_scores_gemma":[0.9986299,0.0007706626,0.00006080549,0.00034274015,0.00011718942,0.000078645724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013988743,0.00032824138,0.00034933785,0.00041865133,0.00008574429,0.00014717555,0.00030695126,0.00052995834,0.0000044672124],"category_scores_gemma":[0.00014284498,0.00035871408,0.00006287773,0.00036385976,0.0000992377,0.00018413199,0.00011010256,0.00082422426,0.0000018697682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004318756,0.0000023276712,0.000007101058,0.000042690073,0.0000058315654,0.0000038714275,0.00045214698,0.85729194,0.0000017652432,0.00071815366,0.000001368561,0.14146851],"study_design_scores_gemma":[0.0001746221,0.000021237196,0.000019606276,0.00045800422,0.0000111974705,0.0000023866496,1.9135831e-7,0.74063003,0.000002164966,0.2584017,0.000016414973,0.00026245438],"about_ca_topic_score_codex":0.0000065521704,"about_ca_topic_score_gemma":0.0002878019,"teacher_disagreement_score":0.9526501,"about_ca_system_score_codex":0.0003071011,"about_ca_system_score_gemma":0.00007878143,"threshold_uncertainty_score":0.9998865},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006511261,0.000063859676,0.9919815,0.0030480358,0.00248252,0.00075486605,0.000030558895,0.00039038138,0.0011831656],"genre_scores_gemma":[0.35778353,0.00001726908,0.63566136,0.0012071563,0.0013963123,0.000074126314,0.000042952684,0.00017925698,0.0036380438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919592,0.00017854443,0.0006773083,0.002860452,0.0032721483,0.001052359],"domain_scores_gemma":[0.9947019,0.0012499312,0.00024295278,0.00216124,0.0012233545,0.00042058114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015341407,0.0007217476,0.00072913646,0.0016393075,0.00053198135,0.00068068405,0.003328082,0.00044191006,0.00011696946],"category_scores_gemma":[0.0008126486,0.00066479744,0.00026907772,0.001590432,0.0009995289,0.00039203864,0.0017260482,0.0015376881,0.00026271195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025739455,0.00012661405,0.000009336367,0.0000348177,0.000014620003,0.00006716945,0.00014595625,0.8651715,0.000022102768,0.12756254,0.000028685314,0.0067909337],"study_design_scores_gemma":[0.00041893046,0.00020468299,0.00004988879,0.0002506464,0.0000067633728,0.000009270908,2.8864625e-7,0.8218262,0.0001689089,0.17652191,0.0000135055525,0.00052895653],"about_ca_topic_score_codex":0.00006112791,"about_ca_topic_score_gemma":0.000059488248,"teacher_disagreement_score":0.3577184,"about_ca_system_score_codex":0.002301428,"about_ca_system_score_gemma":0.0019071585,"threshold_uncertainty_score":0.9995803},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022589891,0.00013793445,0.9964295,0.00019717476,0.0006114161,0.00041688184,0.0000050611125,0.00005794099,0.0019181933],"genre_scores_gemma":[0.36280814,0.0004410103,0.6346838,0.00033770694,0.00012468944,0.000021402,0.0000128282645,0.000055474495,0.0015149814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972417,0.00003533708,0.0006138516,0.0008248468,0.0008946417,0.00038964677],"domain_scores_gemma":[0.9981937,0.00031981283,0.00029022535,0.0008631123,0.00024028569,0.00009289401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008644139,0.000254719,0.00048454234,0.0011904621,0.000050507442,0.000060626342,0.0021951527,0.00020130402,0.00001512972],"category_scores_gemma":[0.00007521001,0.00022993668,0.00009758926,0.0012250959,0.00046646333,0.00037226814,0.0011782241,0.00041488523,0.000017347023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047535837,0.000042425556,0.00019701135,0.00009887552,0.0000041443645,0.000023314562,0.0011925627,0.7572099,0.00036546835,0.012234797,0.000010032937,0.2286167],"study_design_scores_gemma":[0.00032688142,0.00026445606,0.00037650968,0.000811232,0.000001908427,0.000005387319,4.2349063e-7,0.96528083,0.001930115,0.03055327,0.0001459493,0.00030306022],"about_ca_topic_score_codex":0.000045900833,"about_ca_topic_score_gemma":0.00009034209,"teacher_disagreement_score":0.36258224,"about_ca_system_score_codex":0.00010097552,"about_ca_system_score_gemma":0.0003195635,"threshold_uncertainty_score":0.93765455},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004875743,0.0005419632,0.9957681,0.00038422886,0.0016301547,0.00041767504,0.000020895515,0.00025003398,0.00049940293],"genre_scores_gemma":[0.9332342,0.0002557845,0.060476422,0.0005703192,0.0014593895,0.000028840957,0.00009753624,0.0001384591,0.003739042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966867,0.00009909858,0.00064335746,0.0011625892,0.0009147388,0.00049350277],"domain_scores_gemma":[0.9974318,0.0006786742,0.00036215252,0.001139703,0.00026226274,0.00012536543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014330583,0.00034381702,0.0005618986,0.000617603,0.00021159361,0.00036572406,0.0022669754,0.00019606535,0.0000010505532],"category_scores_gemma":[0.00016267848,0.00030703863,0.00007045265,0.0018445287,0.00056472595,0.00006206645,0.0027862845,0.0003999134,0.0000064690253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059634913,0.000047788362,0.00025295364,0.0005176965,0.000025127585,0.000043807948,0.0018334663,0.88107973,0.000008458029,0.012978134,0.00032310214,0.10288376],"study_design_scores_gemma":[0.00020300968,0.00008950592,0.00035066513,0.00054803456,0.000007462072,0.0000163496,8.728993e-7,0.9662454,0.000029749555,0.030454682,0.0017227749,0.00033146262],"about_ca_topic_score_codex":0.000046837235,"about_ca_topic_score_gemma":0.000028953827,"teacher_disagreement_score":0.93529165,"about_ca_system_score_codex":0.00028597953,"about_ca_system_score_gemma":0.00044394296,"threshold_uncertainty_score":0.9999382},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000033564654,0.00030779335,0.98422724,0.0031593693,0.0017236102,0.00072705536,0.0000042078,0.00040862997,0.009438747],"genre_scores_gemma":[0.03211727,0.0015142389,0.93931687,0.0029452627,0.0014912429,0.0001436145,0.000024754285,0.000225536,0.022221232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955182,0.00005016344,0.0007210325,0.0013631172,0.001391488,0.00095600204],"domain_scores_gemma":[0.99635607,0.0012475002,0.000346481,0.0014747531,0.00036221233,0.00021296213],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024932602,0.000464733,0.00045262527,0.0006270084,0.0008646703,0.0017216526,0.0045738914,0.00028111896,0.000019394616],"category_scores_gemma":[0.00018263642,0.000331367,0.00019063472,0.0010201068,0.0006256103,0.0005887426,0.0013911774,0.0010193628,0.0002335793],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061695728,0.0000202281,0.0000042935603,0.000028616121,0.00001511552,0.00006663336,0.0005766226,0.10650472,0.00004573837,0.063634336,0.00012121196,0.82897633],"study_design_scores_gemma":[0.0004061744,0.000143029,0.000045274275,0.00029083353,0.0000045323623,0.00002082719,3.6190676e-7,0.66209376,0.00020153557,0.32893845,0.0073104696,0.0005447634],"about_ca_topic_score_codex":0.000017183242,"about_ca_topic_score_gemma":0.00010855441,"teacher_disagreement_score":0.82843155,"about_ca_system_score_codex":0.00020718567,"about_ca_system_score_gemma":0.0008123415,"threshold_uncertainty_score":0.9999138},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065174705,0.00010533189,0.9883095,0.005594083,0.0033846735,0.00074615754,0.00007998659,0.00040357193,0.0007249377],"genre_scores_gemma":[0.89572364,0.000077104734,0.037611715,0.04303219,0.008523251,0.00018368853,0.0002614554,0.00046405906,0.014122896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99444896,0.00011478477,0.0005416798,0.0025663944,0.0013505653,0.0009776269],"domain_scores_gemma":[0.9764486,0.022091059,0.00032036443,0.00070808624,0.00027814516,0.00015377827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010792926,0.0006997005,0.00087229797,0.0017127093,0.0012249837,0.00033880046,0.0010594213,0.00040004996,0.000097567325],"category_scores_gemma":[0.007401126,0.0006642492,0.000546191,0.0034357877,0.0010772375,0.00029379033,0.00072943146,0.0012248339,0.000028699544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055062632,0.000012129703,0.00044745288,0.00004018431,0.00014306836,0.000029602403,0.0002555349,0.9590079,0.0017290124,0.010673086,0.00091991236,0.02668702],"study_design_scores_gemma":[0.0009365155,0.00048472086,0.004456082,0.00022209607,0.00027995888,0.000046366196,0.0000013464971,0.39537695,0.0018715361,0.5842575,0.010342659,0.0017242805],"about_ca_topic_score_codex":0.000013726948,"about_ca_topic_score_gemma":0.00050212524,"teacher_disagreement_score":0.9506978,"about_ca_system_score_codex":0.00026427186,"about_ca_system_score_gemma":0.0003419273,"threshold_uncertainty_score":0.99958086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092116813,0.00020571376,0.9965487,0.0009635888,0.0004480711,0.0005111293,0.0000022578968,0.0002760016,0.00012334986],"genre_scores_gemma":[0.2321415,0.000019884015,0.7665534,0.0008543171,0.00024210285,0.000041429168,0.000008741193,0.000048927806,0.00008970532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99462384,0.00012267557,0.0008409175,0.0018468298,0.0015710176,0.0009946984],"domain_scores_gemma":[0.98698914,0.011140322,0.00036983064,0.0008809036,0.00036324267,0.00025657433],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004670706,0.00047843167,0.0007636704,0.0022218802,0.0004327795,0.00077498215,0.0022173405,0.0004700581,0.000034543402],"category_scores_gemma":[0.00991434,0.00047057765,0.00020629262,0.0032890013,0.0007081854,0.0005051556,0.0010949062,0.0012182916,0.000020110505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006791698,0.000014677119,0.00033389797,0.00003933702,0.000017778724,0.000061200946,0.00071379245,0.6928622,0.000024856918,0.008312373,3.6336218e-7,0.29761276],"study_design_scores_gemma":[0.00011623426,0.00019494935,0.00010976906,0.00061058206,0.000026248927,0.0000033465174,0.000001986006,0.8033789,0.000793763,0.19435315,0.000013072836,0.00039801837],"about_ca_topic_score_codex":0.00011219304,"about_ca_topic_score_gemma":0.0009344465,"teacher_disagreement_score":0.29721472,"about_ca_system_score_codex":0.000255956,"about_ca_system_score_gemma":0.0008036808,"threshold_uncertainty_score":0.9997746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003653987,0.00009731598,0.9975611,0.00019858833,0.00038456274,0.00031361807,7.463069e-7,0.0002550347,0.0008236448],"genre_scores_gemma":[0.81433606,0.000051810846,0.18384017,0.0005718706,0.00013729314,0.0000137370325,0.00003438204,0.000059735383,0.0009549545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972334,0.000086314845,0.00046103116,0.0011802699,0.00060369837,0.00043528163],"domain_scores_gemma":[0.9988445,0.00022815364,0.00031924076,0.00024736044,0.00026205686,0.00009865821],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091730524,0.0003633295,0.000326845,0.0012041031,0.0004002623,0.0007893211,0.00056115654,0.00026999405,0.000004315572],"category_scores_gemma":[0.00019938234,0.00038983283,0.000047715617,0.0010792144,0.00017300482,0.0009372759,0.00047630616,0.000764946,0.000011480468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069551493,0.0000082296765,0.000333399,0.000033214124,0.000004982266,0.000012138177,0.0040854593,0.7133743,0.0014722116,0.007904419,0.0000020715252,0.2727626],"study_design_scores_gemma":[0.00026566588,0.000073159084,0.00033206152,0.00019032726,0.0000036324063,0.000015103936,0.000001961094,0.9714724,0.00013963848,0.02709509,0.000019995407,0.00039096933],"about_ca_topic_score_codex":0.00006509188,"about_ca_topic_score_gemma":0.0002834326,"teacher_disagreement_score":0.8139706,"about_ca_system_score_codex":0.00034039668,"about_ca_system_score_gemma":0.0003140426,"threshold_uncertainty_score":0.99985534},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002781339,0.00015597817,0.9816991,0.010949639,0.0046916655,0.0005329157,0.00002724931,0.001123262,0.00054206525],"genre_scores_gemma":[0.4628183,0.00021536257,0.53369623,0.0020247963,0.0007615262,0.00006104815,0.000073639065,0.00016073241,0.00018838156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99187577,0.000115426024,0.0011008683,0.0029705842,0.002495914,0.001441454],"domain_scores_gemma":[0.99077654,0.0013631254,0.0004149835,0.0069021713,0.00023252518,0.0003106462],"candidate_categories":["metaresearch","metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016154178,0.0008789758,0.0009142914,0.0022672531,0.00028565986,0.0007874325,0.050992668,0.0007569997,0.000057742498],"category_scores_gemma":[0.009727402,0.0008282728,0.00016390094,0.001675242,0.0018418126,0.0011787231,0.15090375,0.0029894651,0.00014032237],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017140688,0.0000737537,0.00037659364,0.00004092131,0.000022533006,0.001454507,0.00033505698,0.00024558904,0.00010804886,0.002739511,0.0013924912,0.99319386],"study_design_scores_gemma":[0.0003794596,0.000056865516,0.0007125968,0.00083180773,0.0000038541843,0.000087865556,3.6409565e-7,0.6648688,0.00042550708,0.3319404,0.00008080268,0.00061171636],"about_ca_topic_score_codex":0.00010402046,"about_ca_topic_score_gemma":0.0003596359,"teacher_disagreement_score":0.99258214,"about_ca_system_score_codex":0.00076490757,"about_ca_system_score_gemma":0.0010367387,"threshold_uncertainty_score":0.9994168},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001963539,0.00006868038,0.9773921,0.009639072,0.0049320497,0.0018280146,0.00031829296,0.00045527777,0.0034030129],"genre_scores_gemma":[0.9850491,0.000082326376,0.0036805794,0.0071167876,0.00052067713,0.00022668659,0.00003576156,0.00014973393,0.0031383417],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966407,0.000120758166,0.0005143412,0.001240517,0.00079302635,0.0006906856],"domain_scores_gemma":[0.9861051,0.012864487,0.00015576453,0.0006774143,0.00010437361,0.00009288156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014327425,0.00049336476,0.00057652633,0.0011717071,0.0007455545,0.00015213926,0.0011270128,0.0003427143,0.00002431696],"category_scores_gemma":[0.002744782,0.00048503658,0.00016222602,0.0008431291,0.001056666,0.00040360258,0.00031824972,0.001518477,0.000059619317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006036985,0.000663671,0.0010197888,0.0016298613,0.000102053986,0.00036038746,0.017324924,0.18522593,0.02936195,0.11684421,0.002598318,0.64426523],"study_design_scores_gemma":[0.0026484276,0.001561496,0.0035510994,0.0016591633,0.000038979586,0.00013449717,0.000008021124,0.23302552,0.01922195,0.72543156,0.010863508,0.0018557596],"about_ca_topic_score_codex":0.000076477285,"about_ca_topic_score_gemma":0.0013035743,"teacher_disagreement_score":0.9830856,"about_ca_system_score_codex":0.00047607828,"about_ca_system_score_gemma":0.0003048802,"threshold_uncertainty_score":0.99976015},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016713459,0.00017707837,0.97906137,0.0018951498,0.00082053547,0.0011555712,0.0000045796096,0.0001222958,0.000049962593],"genre_scores_gemma":[0.82569194,0.00012471472,0.17252062,0.00048534464,0.00045665543,0.000040316896,0.000044915574,0.00008732463,0.00054813805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958432,0.00009474905,0.0008943329,0.0011431574,0.0015628823,0.00046169368],"domain_scores_gemma":[0.9960623,0.0021856478,0.00045381032,0.00054276275,0.0004963202,0.00025916426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0040794974,0.00036197156,0.0007840846,0.000446597,0.00024022353,0.00009141154,0.0005526687,0.0002598143,0.000029062718],"category_scores_gemma":[0.007925198,0.00030259715,0.00020656324,0.00031111465,0.0011518508,0.00025087115,0.00042671463,0.0013134516,0.0000039532647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019333862,0.00018046731,0.0020252776,0.0027978348,0.000036560556,0.00012764108,0.0019657277,0.35571545,0.011321761,0.00025875756,0.000021707663,0.6253555],"study_design_scores_gemma":[0.0007603812,0.00024995976,0.00095601036,0.003850572,0.00007478607,0.00005054203,0.0000019656459,0.9574807,0.0010932441,0.03521121,0.000009463709,0.0002611128],"about_ca_topic_score_codex":0.00016203153,"about_ca_topic_score_gemma":0.000020120999,"teacher_disagreement_score":0.8089785,"about_ca_system_score_codex":0.00036331522,"about_ca_system_score_gemma":0.0006662672,"threshold_uncertainty_score":0.9999426},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020538974,0.000091036614,0.9950956,0.0006245445,0.00094556826,0.0010525589,0.00004725686,0.000063115134,0.000026389642],"genre_scores_gemma":[0.6828521,0.00010623834,0.31473005,0.00081951724,0.00088893087,0.000048495764,0.00027604096,0.00006386267,0.00021475935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801636,0.000031884956,0.000502167,0.00074708695,0.0004043782,0.00029815402],"domain_scores_gemma":[0.9983327,0.00063200085,0.00035367138,0.00031323463,0.00025586228,0.00011254889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012220971,0.0002746599,0.00046020205,0.00027852505,0.00019292193,0.00006492914,0.00020128579,0.00016045348,0.0000035812761],"category_scores_gemma":[0.0004465416,0.00022889905,0.00008942241,0.00020663634,0.00045716472,0.00009127481,0.00008508313,0.0006542596,0.0000019931545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019553314,0.00013883559,0.00433513,0.0009056363,0.000074456744,0.000029215746,0.0019614478,0.28888282,0.0067525813,0.00075007684,0.00014289616,0.69583136],"study_design_scores_gemma":[0.0010574501,0.0002766095,0.009524757,0.0016369799,0.00005093368,0.000015537858,0.000003105672,0.9858187,0.00046593693,0.0009257931,0.000060258382,0.00016395135],"about_ca_topic_score_codex":0.00013708997,"about_ca_topic_score_gemma":0.00010416079,"teacher_disagreement_score":0.69693583,"about_ca_system_score_codex":0.00018309172,"about_ca_system_score_gemma":0.00018387746,"threshold_uncertainty_score":0.9334232},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008387147,0.000043928307,0.9947836,0.0028150245,0.00020381004,0.00055181334,0.000011395866,0.00031956978,0.0004321553],"genre_scores_gemma":[0.058122147,0.00017575915,0.9338483,0.0051170588,0.0004085535,0.000022421753,0.00004114939,0.000116211515,0.0021483894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979947,0.000008256403,0.0002917809,0.00084726536,0.00049779797,0.0003602059],"domain_scores_gemma":[0.99884254,0.00011854422,0.00011232223,0.0006860595,0.000119708464,0.00012083055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022237269,0.00028874876,0.00032631852,0.00048424627,0.0001947302,0.00004749461,0.00035162337,0.0001907028,0.000008027235],"category_scores_gemma":[0.000059840895,0.000261358,0.000091922964,0.00035776143,0.00041419847,0.00010878572,0.00048735677,0.00061345095,0.000015430584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044452874,0.000106085936,0.00028521405,0.00017026436,0.000014625672,0.00019148947,0.00064435357,0.7981474,0.02423851,0.01152166,0.0004738726,0.16416211],"study_design_scores_gemma":[0.0001888538,0.00007044265,0.000044511355,0.00047806103,0.000018071192,0.000067746936,8.4821856e-8,0.9402157,0.0004659534,0.0574491,0.00077112473,0.00023033984],"about_ca_topic_score_codex":0.00002560459,"about_ca_topic_score_gemma":0.000014616689,"teacher_disagreement_score":0.16393177,"about_ca_system_score_codex":0.0003062672,"about_ca_system_score_gemma":0.0002459327,"threshold_uncertainty_score":0.99998385},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008316443,0.000097058684,0.9945664,0.00075466424,0.0025881995,0.0010537443,0.00000900005,0.00059623556,0.00025155154],"genre_scores_gemma":[0.74217796,0.00019446533,0.2509117,0.003005468,0.002806563,0.00020924176,0.000043564993,0.00018434557,0.0004666793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959236,0.000044565077,0.00049775135,0.0018485097,0.0007568711,0.00092874217],"domain_scores_gemma":[0.996398,0.0014855136,0.00025213856,0.0014683253,0.00016186517,0.00023420739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005992215,0.0005408434,0.00050483487,0.00083369634,0.00054015184,0.00040063326,0.0025920984,0.00036670742,0.0000021857359],"category_scores_gemma":[0.000086988104,0.0005081053,0.0003137827,0.0013228916,0.00042557166,0.0003563593,0.00077617966,0.001171123,0.000025589497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013588382,0.000013095154,0.0000149562175,0.000007822507,0.000007801255,0.000017528115,0.000039323506,0.4415217,0.00002287122,0.0056189336,0.000023118024,0.55269927],"study_design_scores_gemma":[0.00026268803,0.00028176178,0.00014934519,0.000079251906,0.000008615382,0.000038222755,3.8531947e-8,0.8311473,0.00033676953,0.16606106,0.0011798528,0.00045509107],"about_ca_topic_score_codex":0.0000048876946,"about_ca_topic_score_gemma":0.000058464044,"teacher_disagreement_score":0.74365467,"about_ca_system_score_codex":0.00022339559,"about_ca_system_score_gemma":0.00008411318,"threshold_uncertainty_score":0.9997371},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002374919,0.0005273047,0.9901044,0.004235642,0.00044077073,0.0011637661,0.00003775538,0.0000630004,0.0010524481],"genre_scores_gemma":[0.784975,0.0021750676,0.20492202,0.0028962197,0.0030696623,0.00026051886,0.000095429874,0.000188045,0.0014180251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979394,0.0000104859455,0.0002897494,0.0007270855,0.0006210383,0.00041224874],"domain_scores_gemma":[0.9991345,0.0003606155,0.00006879081,0.00014957598,0.00014745981,0.0001390863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042322386,0.00031769372,0.00054498384,0.00027252213,0.00025306686,0.000110129426,0.0001392406,0.00011406222,0.000022835886],"category_scores_gemma":[0.000015113886,0.00023337774,0.00010492817,0.00018059394,0.0005321001,0.000102805934,0.000068800626,0.00036268277,0.0000011433369],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009965539,0.00022308315,0.0015018374,0.0009815373,0.0005346784,0.0012917153,0.0030254694,0.003992394,0.00043662262,0.023706542,0.00036033086,0.9629492],"study_design_scores_gemma":[0.092748426,0.038811624,0.034918368,0.0571907,0.0030709214,0.0076202764,0.00020294441,0.38963085,0.010298671,0.25494885,0.09774302,0.012815362],"about_ca_topic_score_codex":0.00001956026,"about_ca_topic_score_gemma":0.00014506883,"teacher_disagreement_score":0.95013386,"about_ca_system_score_codex":0.00014064323,"about_ca_system_score_gemma":0.00025056105,"threshold_uncertainty_score":0.9516868},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037628538,0.00040468486,0.98825854,0.0035260387,0.002700058,0.00036619403,0.0000038243957,0.00022306023,0.00075477],"genre_scores_gemma":[0.13016644,0.0004759094,0.8224913,0.02004883,0.014571458,0.000025512094,0.0005271959,0.00047789636,0.011215461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960376,0.000102428705,0.0006847912,0.0011643888,0.0013633107,0.0006474838],"domain_scores_gemma":[0.99777496,0.0008710771,0.00024878155,0.00048672454,0.0001741921,0.0004442728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002382033,0.00042132114,0.00079794344,0.0008092448,0.00020665085,0.00027234736,0.00064674625,0.0004139859,0.0000648494],"category_scores_gemma":[0.00090347975,0.0003636013,0.00017925526,0.0007377372,0.0013123566,0.00012375372,0.001057074,0.0021754673,0.00005761343],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001627238,0.00006967587,0.00074458326,0.00045159028,0.00004295915,0.00093463075,0.00030432036,0.00052044436,0.00010231812,0.000051293275,0.0023085023,0.99445343],"study_design_scores_gemma":[0.0012587548,0.00024895705,0.0076582567,0.004453863,0.00004756607,0.00088827085,6.352238e-7,0.98126143,0.000033195556,0.0022424122,0.0015200878,0.0003865521],"about_ca_topic_score_codex":0.000058041696,"about_ca_topic_score_gemma":0.000032114327,"teacher_disagreement_score":0.99406683,"about_ca_system_score_codex":0.00032683986,"about_ca_system_score_gemma":0.00069638,"threshold_uncertainty_score":0.99988157},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07215745,0.00068859704,0.9194655,0.00017629254,0.0011276416,0.00066694396,0.00001796549,0.00020837555,0.005491223],"genre_scores_gemma":[0.9280026,0.00012941212,0.07089097,0.00048616005,0.00028842982,0.000008685307,0.000023764622,0.000084791594,0.00008520274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680495,0.000028010601,0.00064504164,0.0009583846,0.00097584835,0.0005877669],"domain_scores_gemma":[0.99807656,0.00049179106,0.00020117676,0.0006904142,0.00033014588,0.00020991264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060975994,0.00048836967,0.0008632166,0.0023150179,0.000089045345,0.00009326968,0.00057359296,0.0002803409,0.00000806567],"category_scores_gemma":[0.00018006761,0.00044146,0.00024790844,0.002120353,0.0012606159,0.00027968115,0.00019732173,0.0009647827,0.000011077949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027011553,0.00061898294,0.02464341,0.0007311527,0.00025249514,0.00017069862,0.012576248,0.5636062,0.029592209,0.003977373,0.00005308482,0.36350802],"study_design_scores_gemma":[0.007657971,0.0034607383,0.023391299,0.015858969,0.0004616124,0.00059376436,0.000030215839,0.4892848,0.0069622137,0.4449255,0.002487774,0.004885135],"about_ca_topic_score_codex":0.000106803185,"about_ca_topic_score_gemma":0.00014634356,"teacher_disagreement_score":0.85584515,"about_ca_system_score_codex":0.0001521675,"about_ca_system_score_gemma":0.00048436364,"threshold_uncertainty_score":0.9998037},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007257474,0.00007565374,0.99728954,0.00046633006,0.00038373683,0.00084785797,0.000019988527,0.00010082574,0.00009030421],"genre_scores_gemma":[0.75173354,0.000042104046,0.24781208,0.000101740945,0.000056130546,0.00019785698,0.000014806919,0.000022069436,0.000019675253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699086,0.00007320088,0.00055480364,0.0013378563,0.00065330666,0.00038999302],"domain_scores_gemma":[0.9980495,0.0003637575,0.000640759,0.0006193479,0.00027233153,0.000054318236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089318753,0.00031041322,0.00042877762,0.0007260816,0.00010262579,0.000084209445,0.00084916817,0.00023164345,6.492622e-7],"category_scores_gemma":[0.000054503736,0.00030525232,0.00007585477,0.0010989051,0.00047400055,0.00039757637,0.00021826135,0.0005223954,7.6594e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027907801,0.000016262995,0.0071244584,0.000041610514,0.000002826266,0.0000047020526,0.00019647233,0.7700302,0.000081492806,0.0018251758,0.0000014199655,0.22064747],"study_design_scores_gemma":[0.00053318206,0.0001886877,0.013709282,0.00020142803,0.000011131614,0.0000046619857,5.7390264e-7,0.9108591,0.00025383563,0.073959626,0.00001037111,0.00026813013],"about_ca_topic_score_codex":0.00083365897,"about_ca_topic_score_gemma":0.0038619144,"teacher_disagreement_score":0.7510078,"about_ca_system_score_codex":0.0015626763,"about_ca_system_score_gemma":0.00071170396,"threshold_uncertainty_score":0.99994},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001790894,0.0004219804,0.9930532,0.0025202166,0.0007142581,0.00057695,0.000011855124,0.00019392745,0.00071673957],"genre_scores_gemma":[0.96559244,0.00035372764,0.024260245,0.0015655834,0.0012698198,0.00009690979,0.00008025391,0.00013647777,0.0066445386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753165,0.000024286588,0.00037404883,0.0009716836,0.00059737125,0.00050093746],"domain_scores_gemma":[0.9974256,0.0014621011,0.00020072165,0.0003818166,0.0003624673,0.00016729992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065739756,0.00036262124,0.00071422156,0.0006473277,0.00024164082,0.00012057778,0.00035495355,0.00020609741,0.00002831983],"category_scores_gemma":[0.00084798504,0.00030256994,0.00026163837,0.00041577558,0.0005310343,0.00006922572,0.00019178618,0.00079095014,0.000046307872],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007458047,0.000055859025,0.016689464,0.00043500678,0.000106306674,0.00038505145,0.00080124964,0.015552065,0.00037503854,0.00030340362,0.00019476509,0.9650272],"study_design_scores_gemma":[0.002252959,0.0021597124,0.0073247943,0.011661829,0.00086609053,0.00013383807,0.0000073388205,0.92074907,0.006726379,0.041327003,0.0048967903,0.0018941864],"about_ca_topic_score_codex":0.00001808687,"about_ca_topic_score_gemma":0.000010202594,"teacher_disagreement_score":0.9687929,"about_ca_system_score_codex":0.00016445432,"about_ca_system_score_gemma":0.00023999812,"threshold_uncertainty_score":0.99994266},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037628538,0.00040468486,0.98825854,0.0035260387,0.002700058,0.00036619403,0.0000038243957,0.00022306023,0.00075477],"genre_scores_gemma":[0.13016644,0.0004759094,0.8224913,0.02004883,0.014571458,0.000025512094,0.0005271959,0.00047789636,0.011215461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960376,0.000102428705,0.0006847912,0.0011643888,0.0013633107,0.0006474838],"domain_scores_gemma":[0.99777496,0.0008710771,0.00024878155,0.00048672454,0.0001741921,0.0004442728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002382033,0.00042132114,0.00079794344,0.0008092448,0.00020665085,0.00027234736,0.00064674625,0.0004139859,0.0000648494],"category_scores_gemma":[0.00090347975,0.0003636013,0.00017925526,0.0007377372,0.0013123566,0.00012375372,0.001057074,0.0021754673,0.00005761343],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001627238,0.00006967587,0.00074458326,0.00045159028,0.00004295915,0.00093463075,0.00030432036,0.00052044436,0.00010231812,0.000051293275,0.0023085023,0.99445343],"study_design_scores_gemma":[0.0012587548,0.00024895705,0.0076582567,0.004453863,0.00004756607,0.00088827085,6.352238e-7,0.98126143,0.000033195556,0.0022424122,0.0015200878,0.0003865521],"about_ca_topic_score_codex":0.000058041696,"about_ca_topic_score_gemma":0.000032114327,"teacher_disagreement_score":0.99406683,"about_ca_system_score_codex":0.00032683986,"about_ca_system_score_gemma":0.00069638,"threshold_uncertainty_score":0.99988157},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010631686,0.000044750563,0.9943715,0.0025017099,0.00078986224,0.0010540202,0.000047919104,0.0004583972,0.0007212102],"genre_scores_gemma":[0.041412484,0.000015394302,0.9540251,0.0029965222,0.00049197854,0.00013774456,0.0000469624,0.00007922291,0.0007945893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996253,0.000018387054,0.00054970017,0.0016980369,0.00074139686,0.0007394752],"domain_scores_gemma":[0.99702823,0.0007832663,0.0003547113,0.0013709862,0.00025330798,0.00020950663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004971519,0.00050685136,0.00045223022,0.00061314,0.00040469802,0.0004438381,0.0029092191,0.00029578732,0.00000778348],"category_scores_gemma":[0.00010006569,0.0004974115,0.0001717642,0.00077350065,0.0008143533,0.00063831,0.00056092365,0.0005633693,0.000029377741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044060566,0.000012644715,0.0000040934256,0.000020095933,0.0000037304485,0.000007730655,0.00008515694,0.7149581,0.00013073345,0.11602733,0.000053856038,0.16869214],"study_design_scores_gemma":[0.00021406672,0.000056128356,0.0000052222094,0.000098946,0.000005242672,0.000007831377,5.72915e-8,0.68353647,0.0005818195,0.31494996,0.00018516261,0.000359117],"about_ca_topic_score_codex":0.000002605051,"about_ca_topic_score_gemma":0.000025543259,"teacher_disagreement_score":0.19892262,"about_ca_system_score_codex":0.00023910368,"about_ca_system_score_gemma":0.0009401006,"threshold_uncertainty_score":0.99974775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012986283,0.0016431321,0.98258704,0.0010891205,0.00015100736,0.0010557565,0.000005985653,0.0002024129,0.00027925867],"genre_scores_gemma":[0.9558068,0.00020733812,0.042511873,0.00063483237,0.0003857062,0.000033360982,0.00005592537,0.00007897645,0.00028518323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970628,0.00005451768,0.00022143555,0.0012004714,0.0009209024,0.0005398815],"domain_scores_gemma":[0.9985724,0.0002994021,0.00007311239,0.0003146802,0.00036402364,0.0003763677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004775235,0.00038247896,0.0003976127,0.00041917304,0.00028158573,0.00019449943,0.0002597077,0.0001623922,0.000023860837],"category_scores_gemma":[0.00012834306,0.0002873086,0.00007124838,0.00031158215,0.00043827546,0.00016172753,0.0004382502,0.001070993,0.000010128118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011331342,0.0004865955,0.05645545,0.00023049508,0.0006173908,0.0026334762,0.0073776054,0.22080071,0.0002372979,0.00038552875,0.000012433797,0.7096299],"study_design_scores_gemma":[0.0013347699,0.0005370505,0.00434374,0.0015142108,0.00013319033,0.000012259397,0.000009603429,0.9901379,0.000021820153,0.001601906,0.000022043296,0.0003315337],"about_ca_topic_score_codex":0.00006094727,"about_ca_topic_score_gemma":0.00004691067,"teacher_disagreement_score":0.94282055,"about_ca_system_score_codex":0.00016340651,"about_ca_system_score_gemma":0.00043501495,"threshold_uncertainty_score":0.9999579},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058586703,0.00006376643,0.99498814,0.0014431095,0.000677133,0.0017380642,0.000035081688,0.00034209213,0.00012671763],"genre_scores_gemma":[0.04795899,0.000010728936,0.95054144,0.0007149815,0.0002577482,0.00020101243,0.0000894344,0.000058564387,0.0001670761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605775,0.000038524595,0.00056770886,0.0016958448,0.0010301496,0.00061004714],"domain_scores_gemma":[0.99709177,0.00078135036,0.0004038977,0.0010737713,0.0004928759,0.00015634441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007262071,0.00047859948,0.00039693573,0.00057347346,0.0005085587,0.00032009254,0.001545292,0.0001426195,0.0000036176932],"category_scores_gemma":[0.00005484727,0.00042522643,0.00010003354,0.0011637115,0.0003697766,0.0005436319,0.0004205182,0.0003766672,0.000030767915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018983135,0.000027394073,0.000013742625,0.0000321729,0.000006674984,0.000012972554,0.0009888536,0.874226,0.0004185324,0.033585824,0.000008906198,0.09065997],"study_design_scores_gemma":[0.00033815304,0.0001782935,0.00014140717,0.00011917205,0.0000059566332,0.000016886584,0.0000017829022,0.7576641,0.001095155,0.23987697,0.00015529564,0.00040683593],"about_ca_topic_score_codex":0.000012180415,"about_ca_topic_score_gemma":0.00007331198,"teacher_disagreement_score":0.20629115,"about_ca_system_score_codex":0.00037062165,"about_ca_system_score_gemma":0.00040912878,"threshold_uncertainty_score":0.99981993},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020380594,0.00009296737,0.99235266,0.0022203026,0.003586917,0.0010866843,0.00012427053,0.0003422568,0.0001735636],"genre_scores_gemma":[0.0014519441,0.00010712525,0.99516416,0.0019833534,0.00067429204,0.00009830498,0.00017235523,0.000087193795,0.00026126942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950277,0.00004969241,0.00069145655,0.0019157445,0.001552121,0.0007632668],"domain_scores_gemma":[0.9974267,0.00075987884,0.000273386,0.0010673084,0.0001986909,0.00027404798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019980299,0.0005483803,0.000490476,0.00083489215,0.00037523353,0.00050558156,0.0030153212,0.0004993851,0.000028722201],"category_scores_gemma":[0.00014428656,0.00051439187,0.00018119259,0.0007010262,0.00061869004,0.0012375365,0.0006154589,0.0007691121,0.00008665174],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020324846,0.00003911521,0.0000044366825,0.00012050752,0.000016384125,0.000071747316,0.00053573784,0.0017508991,0.0014766541,0.0025188872,0.00021013648,0.9932352],"study_design_scores_gemma":[0.0015040245,0.00053860404,0.000080501515,0.00071029906,0.000018204728,0.00009873728,7.298761e-7,0.90090895,0.009092381,0.08064355,0.0053733694,0.00103067],"about_ca_topic_score_codex":0.000042988966,"about_ca_topic_score_gemma":0.00067946437,"teacher_disagreement_score":0.9922045,"about_ca_system_score_codex":0.0005271811,"about_ca_system_score_gemma":0.00071379583,"threshold_uncertainty_score":0.99973077},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037628538,0.00040468486,0.98825854,0.0035260387,0.002700058,0.00036619403,0.0000038243957,0.00022306023,0.00075477],"genre_scores_gemma":[0.13016644,0.0004759094,0.8224913,0.02004883,0.014571458,0.000025512094,0.0005271959,0.00047789636,0.011215461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960376,0.000102428705,0.0006847912,0.0011643888,0.0013633107,0.0006474838],"domain_scores_gemma":[0.99777496,0.0008710771,0.00024878155,0.00048672454,0.0001741921,0.0004442728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002382033,0.00042132114,0.00079794344,0.0008092448,0.00020665085,0.00027234736,0.00064674625,0.0004139859,0.0000648494],"category_scores_gemma":[0.00090347975,0.0003636013,0.00017925526,0.0007377372,0.0013123566,0.00012375372,0.001057074,0.0021754673,0.00005761343],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001627238,0.00006967587,0.00074458326,0.00045159028,0.00004295915,0.00093463075,0.00030432036,0.00052044436,0.00010231812,0.000051293275,0.0023085023,0.99445343],"study_design_scores_gemma":[0.0012587548,0.00024895705,0.0076582567,0.004453863,0.00004756607,0.00088827085,6.352238e-7,0.98126143,0.000033195556,0.0022424122,0.0015200878,0.0003865521],"about_ca_topic_score_codex":0.000058041696,"about_ca_topic_score_gemma":0.000032114327,"teacher_disagreement_score":0.99406683,"about_ca_system_score_codex":0.00032683986,"about_ca_system_score_gemma":0.00069638,"threshold_uncertainty_score":0.99988157},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15807557,0.00003804661,0.83997005,0.00076160533,0.0007947375,0.00014984595,0.0000044848434,0.00019509248,0.000010557839],"genre_scores_gemma":[0.6930798,0.000014684443,0.30661055,0.00015586907,0.00012035293,0.000008129417,0.0000013240364,0.000008204102,0.0000010140037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975894,0.000046982277,0.00027447034,0.0009221939,0.00059390673,0.0005730119],"domain_scores_gemma":[0.9978207,0.0014491462,0.00009831297,0.00038648327,0.000100064724,0.00014534095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044808147,0.00024544334,0.0002648648,0.00048933737,0.0003443212,0.0005785618,0.0011007695,0.00009917336,0.000008435402],"category_scores_gemma":[0.00035277987,0.00021121258,0.000041406085,0.003415996,0.0002649604,0.0011544676,0.0002363969,0.0002383407,0.000045504483],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009775102,0.000030918054,0.0044198325,0.00003046573,0.000010723467,0.000055225904,0.0038393468,0.016902288,0.0791746,0.000013121192,0.000012686227,0.895501],"study_design_scores_gemma":[0.00019340677,0.000043138018,0.01591362,0.000093951225,0.000004299538,0.00001055248,0.0000018462287,0.5243023,0.44733247,0.011860882,0.000007567044,0.00023596805],"about_ca_topic_score_codex":0.00008384739,"about_ca_topic_score_gemma":0.00006363567,"teacher_disagreement_score":0.89526504,"about_ca_system_score_codex":0.000091617134,"about_ca_system_score_gemma":0.00018172135,"threshold_uncertainty_score":0.86129993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012512779,0.000052718467,0.9940584,0.0023761631,0.0009893525,0.0008283944,0.000008750235,0.0001571003,0.00027788983],"genre_scores_gemma":[0.9590575,0.00002875102,0.035963025,0.0028347648,0.00077671086,0.00006198051,0.00015651993,0.00007898875,0.0010417744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997339,0.000026339909,0.00059257745,0.00091805006,0.00068009715,0.00044390996],"domain_scores_gemma":[0.9985834,0.00047218017,0.00022733973,0.00041358548,0.00013968466,0.00016381431],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011952723,0.0003060598,0.00065946893,0.0015283328,0.00014358574,0.00015228816,0.00033269747,0.00020879581,0.000053911943],"category_scores_gemma":[0.00055875786,0.00028025956,0.00020447094,0.0011168123,0.0002318524,0.000119820106,0.00028132292,0.00052631256,0.0000038220455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007597871,0.000043484117,0.0064387983,0.00034505766,0.00022099064,0.00049114146,0.000737914,0.0159579,0.0006130471,0.00064750266,0.000026165462,0.974402],"study_design_scores_gemma":[0.0007099998,0.0000724301,0.0013359275,0.00042624568,0.00016081503,0.000063062274,0.0000029086964,0.9938387,0.0003839003,0.0025097867,0.00019799017,0.00029818976],"about_ca_topic_score_codex":0.0001083128,"about_ca_topic_score_gemma":0.0011397402,"teacher_disagreement_score":0.97788084,"about_ca_system_score_codex":0.00034455713,"about_ca_system_score_gemma":0.00026602153,"threshold_uncertainty_score":0.99996495},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056835383,0.00022443748,0.9943833,0.0014979416,0.001767144,0.00064175256,0.0000063332486,0.00021918329,0.0012030994],"genre_scores_gemma":[0.0067835357,0.00016416014,0.98677933,0.0022387677,0.0005988972,0.000047414283,0.00001045452,0.000059550483,0.003317869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952981,0.00006567101,0.00060305465,0.0016977419,0.0015631038,0.0007723467],"domain_scores_gemma":[0.9967989,0.0014477477,0.00021322606,0.0009966169,0.0002485118,0.00029501037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027084043,0.0005206596,0.0006176198,0.00063074264,0.0003558085,0.0006098275,0.0027851076,0.00040526703,0.000017559609],"category_scores_gemma":[0.00032420902,0.00043984366,0.00015715505,0.00042146505,0.00066588435,0.0006552104,0.001850361,0.0006429459,0.000017189534],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027968948,0.000038319708,0.0000012228078,0.00010663292,0.000016415015,0.00013615294,0.0013934918,0.0031773446,0.002067444,0.031712707,0.00011286977,0.9612094],"study_design_scores_gemma":[0.0004956278,0.00017719966,0.000012590884,0.00037383728,0.000007592748,0.000033238615,6.9273256e-8,0.67813444,0.0021803975,0.3178612,0.00033441823,0.000389369],"about_ca_topic_score_codex":0.000019793737,"about_ca_topic_score_gemma":0.000019924628,"teacher_disagreement_score":0.9608201,"about_ca_system_score_codex":0.00014731973,"about_ca_system_score_gemma":0.0006665764,"threshold_uncertainty_score":0.99980533},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06028718,0.0018517572,0.8889907,0.001387152,0.002357172,0.042622313,0.0004250311,0.00045417988,0.0016245248],"genre_scores_gemma":[0.99517125,0.00016287113,0.0029233028,0.00022006441,0.000085196894,0.0010901693,0.0001087886,0.000056181838,0.00018217409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998019,0.00001679619,0.0003400185,0.00088930636,0.00037376568,0.00036115356],"domain_scores_gemma":[0.9989764,0.00016627976,0.00012701016,0.00045303057,0.00015342917,0.00012385863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024490818,0.00032969937,0.0005507567,0.00079420535,0.00007511959,0.00009977273,0.00018663848,0.00019452718,0.0000051330057],"category_scores_gemma":[0.000050249702,0.00027704076,0.00040711174,0.00042709432,0.0002744451,0.000097053766,0.00013113103,0.00027625068,0.0000062377303],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005758891,0.00021340752,0.20782007,0.0016329092,0.00055764685,0.000054744232,0.00067455554,0.004080966,0.00014744236,0.0004153772,0.000024218458,0.78380275],"study_design_scores_gemma":[0.0041400143,0.0017936131,0.46700665,0.006363456,0.00075496547,0.000014607296,0.000008270433,0.46703005,0.000104523584,0.051357184,0.00027087415,0.0011558094],"about_ca_topic_score_codex":0.000046918114,"about_ca_topic_score_gemma":0.000039005696,"teacher_disagreement_score":0.9348841,"about_ca_system_score_codex":0.00027755566,"about_ca_system_score_gemma":0.00024592134,"threshold_uncertainty_score":0.9999682},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037628538,0.00040468486,0.98825854,0.0035260387,0.002700058,0.00036619403,0.0000038243957,0.00022306023,0.00075477],"genre_scores_gemma":[0.13016644,0.0004759094,0.8224913,0.02004883,0.014571458,0.000025512094,0.0005271959,0.00047789636,0.011215461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960376,0.000102428705,0.0006847912,0.0011643888,0.0013633107,0.0006474838],"domain_scores_gemma":[0.99777496,0.0008710771,0.00024878155,0.00048672454,0.0001741921,0.0004442728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002382033,0.00042132114,0.00079794344,0.0008092448,0.00020665085,0.00027234736,0.00064674625,0.0004139859,0.0000648494],"category_scores_gemma":[0.00090347975,0.0003636013,0.00017925526,0.0007377372,0.0013123566,0.00012375372,0.001057074,0.0021754673,0.00005761343],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001627238,0.00006967587,0.00074458326,0.00045159028,0.00004295915,0.00093463075,0.00030432036,0.00052044436,0.00010231812,0.000051293275,0.0023085023,0.99445343],"study_design_scores_gemma":[0.0012587548,0.00024895705,0.0076582567,0.004453863,0.00004756607,0.00088827085,6.352238e-7,0.98126143,0.000033195556,0.0022424122,0.0015200878,0.0003865521],"about_ca_topic_score_codex":0.000058041696,"about_ca_topic_score_gemma":0.000032114327,"teacher_disagreement_score":0.99406683,"about_ca_system_score_codex":0.00032683986,"about_ca_system_score_gemma":0.00069638,"threshold_uncertainty_score":0.99988157},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037628538,0.00040468486,0.98825854,0.0035260387,0.002700058,0.00036619403,0.0000038243957,0.00022306023,0.00075477],"genre_scores_gemma":[0.13016644,0.0004759094,0.8224913,0.02004883,0.014571458,0.000025512094,0.0005271959,0.00047789636,0.011215461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960376,0.000102428705,0.0006847912,0.0011643888,0.0013633107,0.0006474838],"domain_scores_gemma":[0.99777496,0.0008710771,0.00024878155,0.00048672454,0.0001741921,0.0004442728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002382033,0.00042132114,0.00079794344,0.0008092448,0.00020665085,0.00027234736,0.00064674625,0.0004139859,0.0000648494],"category_scores_gemma":[0.00090347975,0.0003636013,0.00017925526,0.0007377372,0.0013123566,0.00012375372,0.001057074,0.0021754673,0.00005761343],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001627238,0.00006967587,0.00074458326,0.00045159028,0.00004295915,0.00093463075,0.00030432036,0.00052044436,0.00010231812,0.000051293275,0.0023085023,0.99445343],"study_design_scores_gemma":[0.0012587548,0.00024895705,0.0076582567,0.004453863,0.00004756607,0.00088827085,6.352238e-7,0.98126143,0.000033195556,0.0022424122,0.0015200878,0.0003865521],"about_ca_topic_score_codex":0.000058041696,"about_ca_topic_score_gemma":0.000032114327,"teacher_disagreement_score":0.99406683,"about_ca_system_score_codex":0.00032683986,"about_ca_system_score_gemma":0.00069638,"threshold_uncertainty_score":0.99988157},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000028560823,0.00007407223,0.9940804,0.001700312,0.0015965269,0.0011006364,0.000013605908,0.0006668316,0.0007647506],"genre_scores_gemma":[0.0011020944,0.00007081783,0.9953717,0.0023973791,0.00034320264,0.00010366529,0.000063687316,0.00004466052,0.00050277356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948967,0.0000553115,0.0008025465,0.0013717614,0.002268949,0.0006047299],"domain_scores_gemma":[0.99611276,0.0018312294,0.00040879942,0.0008643139,0.00046453942,0.0003183508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025647106,0.00044061147,0.0004969161,0.00143501,0.00023742439,0.00058935303,0.0027518559,0.00040873754,0.000048389244],"category_scores_gemma":[0.0017836574,0.00040812188,0.00014761422,0.0011651377,0.00063327077,0.00090418616,0.00078588864,0.0006107741,0.00008533432],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004184522,0.000019097952,0.0000021677054,0.00006606374,0.000009068061,0.000040500217,0.00018253339,0.0021239188,0.00015782737,0.0056024403,0.00045743046,0.9913348],"study_design_scores_gemma":[0.0004634225,0.00018266229,0.00001955913,0.00031048874,0.000009186846,0.000022431099,2.6353396e-7,0.8528315,0.0067685237,0.13886921,0.00011052376,0.00041225587],"about_ca_topic_score_codex":0.00003479364,"about_ca_topic_score_gemma":0.00004700374,"teacher_disagreement_score":0.9909225,"about_ca_system_score_codex":0.00050009927,"about_ca_system_score_gemma":0.0008813292,"threshold_uncertainty_score":0.99983704},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037628538,0.00040468486,0.98825854,0.0035260387,0.002700058,0.00036619403,0.0000038243957,0.00022306023,0.00075477],"genre_scores_gemma":[0.13016644,0.0004759094,0.8224913,0.02004883,0.014571458,0.000025512094,0.0005271959,0.00047789636,0.011215461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960376,0.000102428705,0.0006847912,0.0011643888,0.0013633107,0.0006474838],"domain_scores_gemma":[0.99777496,0.0008710771,0.00024878155,0.00048672454,0.0001741921,0.0004442728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002382033,0.00042132114,0.00079794344,0.0008092448,0.00020665085,0.00027234736,0.00064674625,0.0004139859,0.0000648494],"category_scores_gemma":[0.00090347975,0.0003636013,0.00017925526,0.0007377372,0.0013123566,0.00012375372,0.001057074,0.0021754673,0.00005761343],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001627238,0.00006967587,0.00074458326,0.00045159028,0.00004295915,0.00093463075,0.00030432036,0.00052044436,0.00010231812,0.000051293275,0.0023085023,0.99445343],"study_design_scores_gemma":[0.0012587548,0.00024895705,0.0076582567,0.004453863,0.00004756607,0.00088827085,6.352238e-7,0.98126143,0.000033195556,0.0022424122,0.0015200878,0.0003865521],"about_ca_topic_score_codex":0.000058041696,"about_ca_topic_score_gemma":0.000032114327,"teacher_disagreement_score":0.99406683,"about_ca_system_score_codex":0.00032683986,"about_ca_system_score_gemma":0.00069638,"threshold_uncertainty_score":0.99988157},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017829607,0.00003527776,0.9945734,0.0022954447,0.0011386609,0.0011873969,0.00002340037,0.00052926753,0.00019932583],"genre_scores_gemma":[0.0102830455,0.00006813977,0.9862663,0.0017171805,0.00077237503,0.0002760279,0.00005958692,0.00007768198,0.00047964547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960813,0.000023114213,0.00057096663,0.001520946,0.0012288174,0.0005748703],"domain_scores_gemma":[0.99746853,0.0008131613,0.00031354668,0.0010135428,0.00018225578,0.00020894296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000528941,0.00041304267,0.00032409173,0.0005384766,0.0004500268,0.00035230222,0.001977395,0.0003066636,0.0000063639536],"category_scores_gemma":[0.0001649776,0.00039881983,0.000116789066,0.00054469216,0.00029857617,0.0007610027,0.0006633911,0.0006262805,0.000029326593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009016598,0.000023395069,7.979067e-7,0.00002626014,0.0000052341516,0.0000141220435,0.00014538779,0.56989974,0.0006584295,0.041936297,0.00008391241,0.3871974],"study_design_scores_gemma":[0.00020492691,0.00011968161,0.0000017686148,0.000099093144,0.0000057030215,0.00002207112,1.03697836e-7,0.7222491,0.001041599,0.27595437,0.000043494187,0.0002581013],"about_ca_topic_score_codex":0.000005109313,"about_ca_topic_score_gemma":0.00003885962,"teacher_disagreement_score":0.38693932,"about_ca_system_score_codex":0.00039117507,"about_ca_system_score_gemma":0.00054235,"threshold_uncertainty_score":0.99984634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021591166,0.000024955569,0.9964206,0.00043085442,0.00091869413,0.001059544,0.000008035774,0.0007429151,0.00017846371],"genre_scores_gemma":[0.10296832,0.000016313586,0.89425504,0.001386716,0.00048019688,0.00013988849,0.000024310071,0.000082438884,0.00064674596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616486,0.000098779376,0.0005321731,0.0015069044,0.0010495486,0.00064772414],"domain_scores_gemma":[0.9966572,0.0017293247,0.0003580445,0.000553042,0.0004851595,0.00021724479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001668458,0.0004680116,0.00050289684,0.0008539348,0.00038737903,0.00053658517,0.0013828829,0.0002764635,0.000009433172],"category_scores_gemma":[0.0014047597,0.00039992508,0.00012058381,0.00076930266,0.0006768019,0.0006166312,0.00037582946,0.0010516348,0.000014317412],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015071766,0.000070731425,0.00013021867,0.00015293946,0.00006190623,0.00016181715,0.0014053306,0.0108352285,0.013564405,0.0022423223,0.00018966522,0.9710347],"study_design_scores_gemma":[0.0016664914,0.0014103521,0.00060849835,0.0006130976,0.000020136311,0.00036494082,0.0000021755902,0.86496437,0.104322016,0.024830373,0.00022017183,0.0009774026],"about_ca_topic_score_codex":0.00008162275,"about_ca_topic_score_gemma":0.00032838347,"teacher_disagreement_score":0.9700573,"about_ca_system_score_codex":0.00051895366,"about_ca_system_score_gemma":0.0005228245,"threshold_uncertainty_score":0.99984527},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019823316,0.00012073853,0.9735166,0.00020971408,0.004015261,0.0015223218,0.00009784843,0.0001560794,0.00053814414],"genre_scores_gemma":[0.97442144,0.000008321729,0.024196489,0.00043598583,0.0006714734,0.0000369531,0.00004701817,0.00008392326,0.00009838299],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997716,0.000013608889,0.00036495796,0.0007784651,0.0007322751,0.00039468912],"domain_scores_gemma":[0.9982023,0.00067991344,0.00014152302,0.0006114472,0.00022580661,0.00013896123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040324344,0.0003573545,0.0005465287,0.0004603021,0.0001222706,0.000072856354,0.00034017727,0.00012850083,0.000049106657],"category_scores_gemma":[0.00016518509,0.00031096776,0.00038000342,0.0002216158,0.00038782132,0.00009048527,0.00012800063,0.00024511272,0.000006611514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089516165,0.0005769378,0.45910516,0.0016229838,0.0005063388,0.000028451454,0.0007850809,0.20741929,0.05103674,0.0003745786,0.0001337545,0.2775155],"study_design_scores_gemma":[0.005820879,0.001257774,0.15078956,0.012088163,0.0005572931,0.00008366622,0.0000034251586,0.7714597,0.04854543,0.0074924855,0.00015429675,0.0017473046],"about_ca_topic_score_codex":0.000029292292,"about_ca_topic_score_gemma":0.00003288648,"teacher_disagreement_score":0.9545981,"about_ca_system_score_codex":0.00017058112,"about_ca_system_score_gemma":0.00031263355,"threshold_uncertainty_score":0.99993426},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011221358,0.000060618317,0.9960939,0.00054346473,0.0011475972,0.00035126024,0.000022605818,0.00020546559,0.00045290316],"genre_scores_gemma":[0.9673656,0.000030475925,0.030819822,0.00058370095,0.00083339034,0.0000454409,0.000050937688,0.00007553178,0.00019508283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976673,0.000014228951,0.00038546577,0.00072374096,0.0006843216,0.00052495825],"domain_scores_gemma":[0.99869543,0.00050621585,0.0000792522,0.00040467156,0.00013397174,0.00018043857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004761894,0.00039028897,0.0004911172,0.0004951301,0.0001756888,0.00018816962,0.00056939037,0.00020827388,0.00003274435],"category_scores_gemma":[0.00010493857,0.00034752136,0.00015438675,0.00033684322,0.0003124941,0.00013343652,0.00006864845,0.0007637243,0.000022533468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001196128,0.000023575218,0.00035635376,0.00019226602,0.00007925456,0.000049714115,0.0002670361,0.6130534,0.00043122005,0.0006504576,0.00009975327,0.384785],"study_design_scores_gemma":[0.00037743672,0.00007319719,0.0008525882,0.00076450274,0.000055864726,0.0000051884845,8.912447e-7,0.99120516,0.00070335186,0.0054345946,0.00014400747,0.0003832328],"about_ca_topic_score_codex":0.00002461259,"about_ca_topic_score_gemma":0.000023467752,"teacher_disagreement_score":0.9662435,"about_ca_system_score_codex":0.00037706606,"about_ca_system_score_gemma":0.00020270738,"threshold_uncertainty_score":0.99989766},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014701778,0.000061044666,0.9957596,0.0006420242,0.0012851174,0.00032122547,0.0000023059724,0.001067403,0.0007142315],"genre_scores_gemma":[0.121295795,0.00018373378,0.87294567,0.002086822,0.0007623765,0.0000586021,0.000041608895,0.00016680938,0.0024586064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663097,0.00006645164,0.0005090351,0.001543092,0.00067399285,0.00057648204],"domain_scores_gemma":[0.9978376,0.00032994815,0.00029804787,0.0009645229,0.0004259108,0.00014396908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077002397,0.000501018,0.0005415014,0.0016804485,0.00034908848,0.0006126789,0.0019294135,0.00036676577,0.000014239578],"category_scores_gemma":[0.000056535166,0.000434019,0.000108122214,0.0015910607,0.00055880734,0.0005550194,0.0009387688,0.0011394034,0.000044210225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008741749,0.000021933043,0.00040456816,0.000035364807,0.00002228016,0.000071797054,0.00073925505,0.00556163,0.00016733448,0.3124601,0.00007539735,0.6804316],"study_design_scores_gemma":[0.00029231512,0.0007850207,0.00022693528,0.0008495118,0.000009246765,0.00038079935,0.0000010487851,0.8020084,0.0016185843,0.1830825,0.009755329,0.0009903398],"about_ca_topic_score_codex":0.000046258807,"about_ca_topic_score_gemma":0.00008342101,"teacher_disagreement_score":0.79644674,"about_ca_system_score_codex":0.00017136599,"about_ca_system_score_gemma":0.00043544208,"threshold_uncertainty_score":0.9998112},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042928476,0.00009115377,0.9970025,0.00029505612,0.0009641433,0.00011730295,0.00002018593,0.00041505336,0.0006653123],"genre_scores_gemma":[0.8543709,0.000042917974,0.14127614,0.001693245,0.0014148729,0.00001224952,0.00006661513,0.0001367538,0.0009863338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998272,0.0000090437325,0.00028585002,0.00062337687,0.0004644111,0.00034533234],"domain_scores_gemma":[0.99909294,0.00017860663,0.00003376675,0.0004844432,0.00008976012,0.000120471756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025574368,0.00030671,0.00038662532,0.0005818508,0.00009974149,0.00019664333,0.0006655529,0.0001897702,0.00005052629],"category_scores_gemma":[0.00003254199,0.00030172252,0.00010204991,0.00041688714,0.000096844306,0.00008424139,0.00017329739,0.00040515012,0.0002897162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017574746,0.0000021699086,0.0000042861666,0.000011550172,0.000016845803,0.000016881135,0.0003296406,0.9063875,0.00071392814,0.00007800522,0.00021185783,0.09222555],"study_design_scores_gemma":[0.000067093424,0.000023180337,0.000035916844,0.0002436488,0.000017650194,0.0000014526327,1.2861379e-7,0.97482526,0.0008356909,0.023195952,0.0003808594,0.00037316806],"about_ca_topic_score_codex":0.00007682176,"about_ca_topic_score_gemma":0.000108086104,"teacher_disagreement_score":0.85572636,"about_ca_system_score_codex":0.00015732442,"about_ca_system_score_gemma":0.0000622932,"threshold_uncertainty_score":0.9999435},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019145317,0.00011964145,0.9735238,0.002441821,0.0024930884,0.0016713786,0.000009248507,0.00020070096,0.00039499017],"genre_scores_gemma":[0.39769483,0.0002187454,0.5806533,0.00902119,0.0051127006,0.00024987597,0.00041940057,0.00021462675,0.0064153606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997677,0.000018422948,0.0004761959,0.00082418945,0.00053130434,0.00047285916],"domain_scores_gemma":[0.99818116,0.0006821644,0.00013040981,0.00035507418,0.00043919362,0.0002120159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007068123,0.0002795472,0.00033629767,0.0005655003,0.00034294356,0.00014648923,0.00028135773,0.00023352604,0.00002277629],"category_scores_gemma":[0.00036258376,0.00026299772,0.00009219747,0.00047903555,0.00015373228,0.000085883745,0.00007914595,0.00046973967,0.00011336492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010054988,0.000073456424,0.0011347443,0.00052929495,0.00003525602,0.000026265048,0.018591452,0.11961971,0.0046954975,0.0004119788,0.00020787152,0.8545739],"study_design_scores_gemma":[0.00032990193,0.0021425812,0.0006161104,0.0016097061,0.00016795774,0.00009875385,0.000099387755,0.9160616,0.058275383,0.013517531,0.0057801404,0.0013009676],"about_ca_topic_score_codex":0.00007143552,"about_ca_topic_score_gemma":0.00008638448,"teacher_disagreement_score":0.853273,"about_ca_system_score_codex":0.00045376146,"about_ca_system_score_gemma":0.00059350574,"threshold_uncertainty_score":0.99998224},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002625516,0.0020178638,0.93306047,0.015797924,0.0062281,0.0029171454,0.00033562878,0.00039873307,0.038981583],"genre_scores_gemma":[0.11452253,0.017140688,0.55410886,0.08378028,0.016594667,0.00020880399,0.0050105136,0.0010061357,0.20762755],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977072,0.000025438148,0.0002752724,0.00097557897,0.0006270972,0.0003894467],"domain_scores_gemma":[0.9964914,0.000805137,0.00010930958,0.002337461,0.00010279422,0.00015393278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015551264,0.00026947292,0.0003892418,0.00015425424,0.0003131155,0.0004895434,0.003977844,0.00017776078,0.000021958198],"category_scores_gemma":[0.001223987,0.00015313624,0.000072683695,0.00027684285,0.000917144,0.00018470609,0.0036774664,0.0006561151,0.00012395479],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008777446,0.00003861167,0.00063826976,0.00017837476,0.00015131386,0.001070335,0.0008326157,0.00086328987,0.00065912347,0.005907855,0.013113483,0.97645897],"study_design_scores_gemma":[0.002471803,0.0010625899,0.0056487555,0.004685484,0.0002810954,0.002785637,0.0000045405563,0.042928,0.002090684,0.36768177,0.5683247,0.00203492],"about_ca_topic_score_codex":0.000045243574,"about_ca_topic_score_gemma":0.00009579143,"teacher_disagreement_score":0.974424,"about_ca_system_score_codex":0.000067284025,"about_ca_system_score_gemma":0.0006752932,"threshold_uncertainty_score":0.739189},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037628538,0.00040468486,0.98825854,0.0035260387,0.002700058,0.00036619403,0.0000038243957,0.00022306023,0.00075477],"genre_scores_gemma":[0.13016644,0.0004759094,0.8224913,0.02004883,0.014571458,0.000025512094,0.0005271959,0.00047789636,0.011215461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960376,0.000102428705,0.0006847912,0.0011643888,0.0013633107,0.0006474838],"domain_scores_gemma":[0.99777496,0.0008710771,0.00024878155,0.00048672454,0.0001741921,0.0004442728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002382033,0.00042132114,0.00079794344,0.0008092448,0.00020665085,0.00027234736,0.00064674625,0.0004139859,0.0000648494],"category_scores_gemma":[0.00090347975,0.0003636013,0.00017925526,0.0007377372,0.0013123566,0.00012375372,0.001057074,0.0021754673,0.00005761343],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001627238,0.00006967587,0.00074458326,0.00045159028,0.00004295915,0.00093463075,0.00030432036,0.00052044436,0.00010231812,0.000051293275,0.0023085023,0.99445343],"study_design_scores_gemma":[0.0012587548,0.00024895705,0.0076582567,0.004453863,0.00004756607,0.00088827085,6.352238e-7,0.98126143,0.000033195556,0.0022424122,0.0015200878,0.0003865521],"about_ca_topic_score_codex":0.000058041696,"about_ca_topic_score_gemma":0.000032114327,"teacher_disagreement_score":0.99406683,"about_ca_system_score_codex":0.00032683986,"about_ca_system_score_gemma":0.00069638,"threshold_uncertainty_score":0.99988157},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021063175,0.00015729757,0.9770555,0.00026927577,0.0004371014,0.0005650184,0.00012655843,0.000030867563,0.00029522754],"genre_scores_gemma":[0.95859724,0.000026340478,0.039699856,0.00019213217,0.0002972911,0.0000056134304,0.00020643903,0.000026693811,0.00094841793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833167,0.00000911033,0.00044589306,0.0004950899,0.0005027339,0.00021551762],"domain_scores_gemma":[0.99794185,0.0009783576,0.000275657,0.00036574507,0.0003610414,0.00007732841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023684248,0.00020113535,0.000679558,0.00088341767,0.000063963824,0.000018254354,0.00024619012,0.00021405904,0.000055896646],"category_scores_gemma":[0.00020124705,0.00015943182,0.00038733098,0.0010507688,0.00032985132,0.00006458278,0.000097968834,0.0001994893,0.0000010217846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012708541,0.000050783943,0.0016687055,0.00019820784,0.0004010098,0.000010496994,0.000966476,0.91794914,0.0012065615,0.0046905293,0.0000118312155,0.07271917],"study_design_scores_gemma":[0.00092877797,0.00057008193,0.01306096,0.0004939972,0.0012329954,0.00000504014,0.0000034613981,0.96459293,0.007386443,0.010785863,0.0005642513,0.0003751663],"about_ca_topic_score_codex":0.000015300162,"about_ca_topic_score_gemma":0.00005019546,"teacher_disagreement_score":0.93753403,"about_ca_system_score_codex":0.000056274534,"about_ca_system_score_gemma":0.00014729807,"threshold_uncertainty_score":0.65014404},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013292204,0.00018957088,0.9962446,0.0006689885,0.0016542712,0.00048490768,0.0000037915265,0.00023831728,0.0003825922],"genre_scores_gemma":[0.20198148,0.0000417168,0.79574275,0.0014241538,0.0003846202,0.000017466,0.000009307784,0.000055237815,0.00034329368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974311,0.000016083317,0.00040275705,0.0010363611,0.00056088896,0.00055282266],"domain_scores_gemma":[0.9984361,0.0004463062,0.0002159534,0.0006250768,0.0001337947,0.00014274872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060230476,0.000357252,0.0003379467,0.00064256566,0.00033436503,0.00057228946,0.0011520705,0.0001331633,0.0000018795276],"category_scores_gemma":[0.00012301325,0.0003195588,0.00006706522,0.00042589646,0.00028281662,0.00067200116,0.0007600451,0.00039041313,0.000018810644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026258595,0.0000059594317,0.000008195141,0.000029722481,0.000001945819,0.000015697482,0.0005474686,0.062377468,0.00014450507,0.0040998063,0.0000073469655,0.9327593],"study_design_scores_gemma":[0.000235119,0.0000893107,0.00013856309,0.00020670272,0.000003925717,0.000068466485,4.342673e-7,0.962223,0.0014326243,0.03420877,0.0010257459,0.00036735204],"about_ca_topic_score_codex":0.0000054317043,"about_ca_topic_score_gemma":0.00002832486,"teacher_disagreement_score":0.9323919,"about_ca_system_score_codex":0.000121920486,"about_ca_system_score_gemma":0.000114770766,"threshold_uncertainty_score":0.9999257},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037628538,0.00040468486,0.98825854,0.0035260387,0.002700058,0.00036619403,0.0000038243957,0.00022306023,0.00075477],"genre_scores_gemma":[0.13016644,0.0004759094,0.8224913,0.02004883,0.014571458,0.000025512094,0.0005271959,0.00047789636,0.011215461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960376,0.000102428705,0.0006847912,0.0011643888,0.0013633107,0.0006474838],"domain_scores_gemma":[0.99777496,0.0008710771,0.00024878155,0.00048672454,0.0001741921,0.0004442728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002382033,0.00042132114,0.00079794344,0.0008092448,0.00020665085,0.00027234736,0.00064674625,0.0004139859,0.0000648494],"category_scores_gemma":[0.00090347975,0.0003636013,0.00017925526,0.0007377372,0.0013123566,0.00012375372,0.001057074,0.0021754673,0.00005761343],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001627238,0.00006967587,0.00074458326,0.00045159028,0.00004295915,0.00093463075,0.00030432036,0.00052044436,0.00010231812,0.000051293275,0.0023085023,0.99445343],"study_design_scores_gemma":[0.0012587548,0.00024895705,0.0076582567,0.004453863,0.00004756607,0.00088827085,6.352238e-7,0.98126143,0.000033195556,0.0022424122,0.0015200878,0.0003865521],"about_ca_topic_score_codex":0.000058041696,"about_ca_topic_score_gemma":0.000032114327,"teacher_disagreement_score":0.99406683,"about_ca_system_score_codex":0.00032683986,"about_ca_system_score_gemma":0.00069638,"threshold_uncertainty_score":0.99988157},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021724158,0.0004642742,0.9821508,0.012264759,0.0014306268,0.00090824254,0.00012311777,0.00014954248,0.0022914305],"genre_scores_gemma":[0.42103115,0.00029948266,0.5041832,0.05850995,0.0075165685,0.0003446821,0.00048901304,0.00083037425,0.0067955875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99404925,0.00008190037,0.0029004836,0.0017859559,0.00046311758,0.00071929925],"domain_scores_gemma":[0.9936466,0.002557058,0.0020915922,0.0011870721,0.00026017334,0.0002574838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.012199656,0.0005320496,0.0014967154,0.0014779205,0.0003144954,0.0002095025,0.0011200455,0.00037371772,0.00014964749],"category_scores_gemma":[0.0013162988,0.0005184976,0.0001053678,0.0004767876,0.0008104844,0.0006057547,0.0002569507,0.00070982275,0.00040195117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059713886,0.000042176165,0.00035663103,0.0008622305,0.00004790508,0.000050730214,0.0024713455,0.9076661,0.000008857592,0.048983797,0.0011106376,0.03833988],"study_design_scores_gemma":[0.00063702394,0.00025278598,0.00008031872,0.0010071897,0.000006915812,0.00000805726,0.000003487574,0.82311153,0.000007130869,0.17370148,0.0006449566,0.0005391337],"about_ca_topic_score_codex":0.0012397962,"about_ca_topic_score_gemma":0.00076865725,"teacher_disagreement_score":0.47796756,"about_ca_system_score_codex":0.0012365998,"about_ca_system_score_gemma":0.0009231564,"threshold_uncertainty_score":0.99972665},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037628538,0.00040468486,0.98825854,0.0035260387,0.002700058,0.00036619403,0.0000038243957,0.00022306023,0.00075477],"genre_scores_gemma":[0.13016644,0.0004759094,0.8224913,0.02004883,0.014571458,0.000025512094,0.0005271959,0.00047789636,0.011215461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960376,0.000102428705,0.0006847912,0.0011643888,0.0013633107,0.0006474838],"domain_scores_gemma":[0.99777496,0.0008710771,0.00024878155,0.00048672454,0.0001741921,0.0004442728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002382033,0.00042132114,0.00079794344,0.0008092448,0.00020665085,0.00027234736,0.00064674625,0.0004139859,0.0000648494],"category_scores_gemma":[0.00090347975,0.0003636013,0.00017925526,0.0007377372,0.0013123566,0.00012375372,0.001057074,0.0021754673,0.00005761343],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001627238,0.00006967587,0.00074458326,0.00045159028,0.00004295915,0.00093463075,0.00030432036,0.00052044436,0.00010231812,0.000051293275,0.0023085023,0.99445343],"study_design_scores_gemma":[0.0012587548,0.00024895705,0.0076582567,0.004453863,0.00004756607,0.00088827085,6.352238e-7,0.98126143,0.000033195556,0.0022424122,0.0015200878,0.0003865521],"about_ca_topic_score_codex":0.000058041696,"about_ca_topic_score_gemma":0.000032114327,"teacher_disagreement_score":0.99406683,"about_ca_system_score_codex":0.00032683986,"about_ca_system_score_gemma":0.00069638,"threshold_uncertainty_score":0.99988157},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037628538,0.00040468486,0.98825854,0.0035260387,0.002700058,0.00036619403,0.0000038243957,0.00022306023,0.00075477],"genre_scores_gemma":[0.13016644,0.0004759094,0.8224913,0.02004883,0.014571458,0.000025512094,0.0005271959,0.00047789636,0.011215461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960376,0.000102428705,0.0006847912,0.0011643888,0.0013633107,0.0006474838],"domain_scores_gemma":[0.99777496,0.0008710771,0.00024878155,0.00048672454,0.0001741921,0.0004442728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002382033,0.00042132114,0.00079794344,0.0008092448,0.00020665085,0.00027234736,0.00064674625,0.0004139859,0.0000648494],"category_scores_gemma":[0.00090347975,0.0003636013,0.00017925526,0.0007377372,0.0013123566,0.00012375372,0.001057074,0.0021754673,0.00005761343],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001627238,0.00006967587,0.00074458326,0.00045159028,0.00004295915,0.00093463075,0.00030432036,0.00052044436,0.00010231812,0.000051293275,0.0023085023,0.99445343],"study_design_scores_gemma":[0.0012587548,0.00024895705,0.0076582567,0.004453863,0.00004756607,0.00088827085,6.352238e-7,0.98126143,0.000033195556,0.0022424122,0.0015200878,0.0003865521],"about_ca_topic_score_codex":0.000058041696,"about_ca_topic_score_gemma":0.000032114327,"teacher_disagreement_score":0.99406683,"about_ca_system_score_codex":0.00032683986,"about_ca_system_score_gemma":0.00069638,"threshold_uncertainty_score":0.99988157},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010736553,0.00004414866,0.99619234,0.00034767832,0.0016174723,0.00031767928,0.000011268839,0.0002560895,0.00013968769],"genre_scores_gemma":[0.9679669,0.000020979065,0.030551532,0.00026797134,0.00063798734,0.000034607692,0.00021538475,0.00006934131,0.00023526499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997739,0.000024106615,0.00063791586,0.0006616599,0.00046825656,0.00046903064],"domain_scores_gemma":[0.99846375,0.0008176062,0.00013510423,0.00038587098,0.00009658112,0.000101104415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081651664,0.00034151023,0.00043496158,0.00051550276,0.00009767077,0.00016129737,0.00037639504,0.00026231247,0.000009104649],"category_scores_gemma":[0.0003475814,0.00034216308,0.00013473335,0.0005710705,0.00021750155,0.00021048065,0.000056308643,0.00052011345,0.000008772033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027821793,0.0000045402135,0.00015942531,0.00006738971,0.000007828968,0.000009652352,0.00009233142,0.8684337,0.000039885188,0.0001286415,0.00030622794,0.1307476],"study_design_scores_gemma":[0.00015755928,0.000024743302,0.0003794371,0.00050263957,0.0000143733,0.000012385832,2.8827876e-7,0.96713924,0.000038804057,0.031314366,0.00010448163,0.00031165848],"about_ca_topic_score_codex":0.000048158065,"about_ca_topic_score_gemma":0.00031923,"teacher_disagreement_score":0.96689326,"about_ca_system_score_codex":0.000268683,"about_ca_system_score_gemma":0.00010273352,"threshold_uncertainty_score":0.999903},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5201907,0.0010084292,0.46685213,0.0036768736,0.001563532,0.0026346792,0.000025341806,0.00025478404,0.0037935383],"genre_scores_gemma":[0.9856828,0.000028203662,0.013531345,0.00044887283,0.00016201583,0.000011080508,0.000008530546,0.000029515579,0.00009767798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982716,0.000009595505,0.00033150427,0.00056504324,0.0005086737,0.00031359968],"domain_scores_gemma":[0.9990188,0.00021783807,0.00015811174,0.0003046157,0.00019932893,0.000101293655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001979264,0.00028700073,0.00051638635,0.00034903636,0.00008355961,0.000056193207,0.00017571026,0.000147713,0.00004651902],"category_scores_gemma":[0.00009137663,0.00019318846,0.00007572754,0.0003953394,0.00031173136,0.000081911334,0.00013814625,0.00037167934,0.000004190675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000324366,0.00037562527,0.023953773,0.00055909186,0.0005183567,0.0030509306,0.005390308,0.1871875,0.0010224495,0.0034205467,0.000045475288,0.77415156],"study_design_scores_gemma":[0.0015443476,0.0027968257,0.009890544,0.0055671977,0.00017243614,0.00022112408,0.0000028964255,0.96341574,0.012969998,0.0029018833,0.000017926808,0.00049904967],"about_ca_topic_score_codex":0.00002294179,"about_ca_topic_score_gemma":0.00010628417,"teacher_disagreement_score":0.7762283,"about_ca_system_score_codex":0.0001554769,"about_ca_system_score_gemma":0.0001780789,"threshold_uncertainty_score":0.7877997},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010680605,0.0001985201,0.97868717,0.016956855,0.0010553533,0.0017678761,0.00001807966,0.00018389357,0.00006421313],"genre_scores_gemma":[0.9362798,0.00023277977,0.05409706,0.0073688,0.0011646345,0.00022290806,0.00007180179,0.00017809302,0.0003841435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715185,0.0000237337,0.00041529437,0.0011321242,0.0007713649,0.0005056322],"domain_scores_gemma":[0.99817926,0.0009464853,0.00010727241,0.00037051341,0.00012525871,0.0002712348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007619639,0.00036809914,0.00046677596,0.0011359518,0.00015362278,0.0001050114,0.00030761014,0.0002903717,0.000010149627],"category_scores_gemma":[0.0004066489,0.00030896123,0.0001752146,0.00053146016,0.00059774524,0.00016681034,0.00013711552,0.00077773444,0.000011963302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002603855,0.000089127556,0.00018470694,0.00048454475,0.000005875502,0.0001295097,0.00021650664,0.0027425308,0.0016910605,0.000023945062,0.00003891279,0.9941329],"study_design_scores_gemma":[0.005478171,0.0032115194,0.034362905,0.019102788,0.00021456665,0.00004471899,0.0000012079812,0.86186373,0.017783608,0.039760336,0.01630972,0.0018667151],"about_ca_topic_score_codex":0.00001743305,"about_ca_topic_score_gemma":0.000109597844,"teacher_disagreement_score":0.9922662,"about_ca_system_score_codex":0.0004391279,"about_ca_system_score_gemma":0.0006247582,"threshold_uncertainty_score":0.9999362},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011551014,0.0007918564,0.99119896,0.0003950093,0.0038294736,0.0004496498,0.0000020321086,0.0005512874,0.0026661968],"genre_scores_gemma":[0.10316242,0.0017463482,0.875677,0.008140105,0.01000735,0.00014795765,0.000036147594,0.0002067511,0.0008759287],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956561,0.000075543474,0.0005051789,0.001833752,0.00093677733,0.0009926821],"domain_scores_gemma":[0.9973908,0.000738669,0.00026076756,0.0012393631,0.00012685914,0.00024352827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014413795,0.0005366256,0.00059676316,0.00086210994,0.0005666438,0.0009292145,0.002498775,0.0005342318,0.000009409812],"category_scores_gemma":[0.00005066446,0.0005207582,0.00012754094,0.0038727664,0.0008023119,0.0004980279,0.0023503157,0.0014134954,0.000049213242],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011849856,0.000027493948,0.000044430213,0.000066816465,0.000018281735,0.000049363567,0.0012865694,0.0351057,0.000012624264,0.03585418,0.0024487826,0.9250739],"study_design_scores_gemma":[0.00020076204,0.000093806375,0.00019208719,0.00029894098,0.000007045371,0.000030803767,1.8643152e-7,0.30765444,0.000067692854,0.6841501,0.006693695,0.0006104304],"about_ca_topic_score_codex":0.000009991189,"about_ca_topic_score_gemma":0.00014838723,"teacher_disagreement_score":0.92446345,"about_ca_system_score_codex":0.0001825199,"about_ca_system_score_gemma":0.00043057953,"threshold_uncertainty_score":0.9997244},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055519573,0.00014585842,0.99725336,0.000045493012,0.0012859063,0.0003937027,0.00000490591,0.0002635846,0.000051972573],"genre_scores_gemma":[0.62367994,0.000024065617,0.37600535,0.00007825812,0.000120994904,0.000006171365,0.0000039085503,0.00003847657,0.00004283414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968724,0.00003833209,0.0008972675,0.0010007793,0.00075851695,0.00043270632],"domain_scores_gemma":[0.9968694,0.00036869722,0.0008962749,0.0012909203,0.000496491,0.00007821269],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071350764,0.0003527753,0.00056564057,0.0009972105,0.00012549156,0.00011181897,0.0019051629,0.0002622891,0.0000023776774],"category_scores_gemma":[0.00011282539,0.00035940582,0.00015151048,0.0011528104,0.00065112393,0.0006102692,0.0008237955,0.00047167728,0.0000016430275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073339584,0.000011944423,0.000014186347,0.000041887582,0.00000817411,0.000013906353,0.0002539134,0.43228048,0.0054545957,0.0066549233,0.0000013002142,0.5552574],"study_design_scores_gemma":[0.00010544643,0.00012828568,0.000052640087,0.00011957015,0.000008230526,0.00003653668,2.6591917e-7,0.8589714,0.05082469,0.089475624,0.00000922848,0.00026807206],"about_ca_topic_score_codex":0.000020614185,"about_ca_topic_score_gemma":0.00006953414,"teacher_disagreement_score":0.6231247,"about_ca_system_score_codex":0.00017691798,"about_ca_system_score_gemma":0.0001248129,"threshold_uncertainty_score":0.9998858},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013221513,0.000176021,0.9899393,0.003271336,0.002186384,0.0027351128,0.00005635897,0.0005503227,0.0010838407],"genre_scores_gemma":[0.0046433033,0.0000801492,0.98865294,0.0038519169,0.0010577694,0.0007450681,0.00005625627,0.00007362775,0.0008389431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953619,0.000024472734,0.00064537016,0.0021267787,0.0008119297,0.0010295074],"domain_scores_gemma":[0.99515533,0.001226978,0.00023903356,0.0027926664,0.00024829197,0.0003376658],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009471564,0.0005693686,0.0005854438,0.00096454326,0.0005591519,0.00081706373,0.0055700266,0.00041911023,0.000010702115],"category_scores_gemma":[0.00012621265,0.00059798337,0.00020476714,0.0020076663,0.00038602445,0.00029813632,0.0024338635,0.0007949906,0.00014782071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075324124,0.000024792475,0.000004673087,0.000033455206,0.000022394514,0.000017619494,0.00021282607,0.04673366,0.000002907134,0.65607536,0.00032769013,0.2965371],"study_design_scores_gemma":[0.0002688689,0.00009495425,0.000052166386,0.0004154242,0.000019298648,0.000009850963,4.538274e-7,0.41716266,0.0000147436085,0.5550293,0.026262745,0.0006695776],"about_ca_topic_score_codex":0.000010653519,"about_ca_topic_score_gemma":0.00011513725,"teacher_disagreement_score":0.370429,"about_ca_system_score_codex":0.00041449806,"about_ca_system_score_gemma":0.00020886105,"threshold_uncertainty_score":0.99981034},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014134584,0.00015187006,0.9974156,0.000064162865,0.0010859484,0.00053691503,0.000008309724,0.00022148917,0.00037436842],"genre_scores_gemma":[0.85875404,0.00005791182,0.14055327,0.000065276035,0.0001820822,0.00002509011,0.00002642017,0.00008260665,0.00025327952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985867,0.0000025647614,0.00039511715,0.00039564073,0.0003063943,0.00031355766],"domain_scores_gemma":[0.99914384,0.0002230824,0.00009501475,0.0003119947,0.00017150289,0.00005458397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003031731,0.00024847174,0.00036157173,0.00050649134,0.00007884562,0.00005754191,0.0003825168,0.00020335338,0.0000046799596],"category_scores_gemma":[0.000044704517,0.0002484719,0.000111509726,0.0002429254,0.00005280852,0.00014426926,0.00006637232,0.00025030825,0.000007160605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005485166,0.000003051733,0.0000017800371,0.00008718169,0.000012053477,0.0000011921654,0.00015172584,0.96346205,0.00020678504,0.003504725,0.0000015074776,0.032562427],"study_design_scores_gemma":[0.00029320642,0.000041734187,0.0000052529326,0.00037272653,0.000013282088,0.0000020699008,2.665912e-7,0.9160817,0.000238391,0.08271984,0.000008996202,0.00022252301],"about_ca_topic_score_codex":0.0000059085883,"about_ca_topic_score_gemma":0.00003749706,"teacher_disagreement_score":0.8586127,"about_ca_system_score_codex":0.00019664518,"about_ca_system_score_gemma":0.00009049605,"threshold_uncertainty_score":0.9999968},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015012079,0.00027709265,0.99197143,0.00038989287,0.001719421,0.00034204728,0.000003826682,0.00021881043,0.0035762466],"genre_scores_gemma":[0.98266864,0.0001456123,0.016157327,0.00033464248,0.0002917517,0.000010954464,0.0000027291628,0.000047097827,0.00034125577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826103,0.000013874953,0.00041434565,0.0003822542,0.00056104065,0.00036742663],"domain_scores_gemma":[0.9989501,0.00025354174,0.000110133136,0.0005302233,0.000097409975,0.000058572852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004438923,0.00028503136,0.00038745554,0.000295335,0.00014437539,0.000105037805,0.0010707707,0.00014534814,0.000020527199],"category_scores_gemma":[0.000025241561,0.00021543914,0.000086857435,0.00035056158,0.00045688733,0.00015681138,0.00015411162,0.0005565802,0.000054867203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021895291,0.000003049773,0.00009426596,0.000079544756,0.000017046304,0.000004101606,0.00020560883,0.93110436,0.0005312923,0.0009068026,0.0000067893434,0.06704492],"study_design_scores_gemma":[0.00017529826,0.00005369921,0.0023600885,0.0006896687,0.000013051369,0.0000071148957,4.75437e-7,0.99070036,0.00092776126,0.004651921,0.00012223591,0.00029832005],"about_ca_topic_score_codex":0.00000984676,"about_ca_topic_score_gemma":0.000027999664,"teacher_disagreement_score":0.98116744,"about_ca_system_score_codex":0.00009127095,"about_ca_system_score_gemma":0.00008756656,"threshold_uncertainty_score":0.87853533},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011381904,0.00009283175,0.9933651,0.0007362836,0.0013319713,0.00044778676,0.000007448594,0.00043815988,0.0024421937],"genre_scores_gemma":[0.8255775,0.00006187438,0.16845527,0.000557214,0.00023613997,0.000016692338,0.00002850877,0.00008337887,0.004983445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632,0.000041771193,0.0005789062,0.0013329381,0.0012126482,0.0005137178],"domain_scores_gemma":[0.9976606,0.00030426332,0.00046297716,0.0012556168,0.00020154237,0.000115036964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010861862,0.00043950515,0.00047347348,0.0011004764,0.00021973508,0.00021514231,0.0019296508,0.00028751334,0.0000041452363],"category_scores_gemma":[0.00006002353,0.00042533546,0.0001581547,0.00068852707,0.0005444072,0.00012592234,0.0012759968,0.00047682555,0.00005230704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037435184,0.000019790814,0.000013203744,0.00004873,0.000018114537,0.000012626454,0.0005877886,0.8669997,0.00020117426,0.0056929337,0.00007984133,0.12632236],"study_design_scores_gemma":[0.00017417,0.000091965405,0.000112461006,0.0004371406,0.000015743228,0.000014073062,4.916503e-7,0.9293483,0.00036847492,0.06902804,0.000071615,0.0003375269],"about_ca_topic_score_codex":0.000024378445,"about_ca_topic_score_gemma":0.00001907459,"teacher_disagreement_score":0.82490987,"about_ca_system_score_codex":0.00037263084,"about_ca_system_score_gemma":0.00032327257,"threshold_uncertainty_score":0.9998199},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022620585,0.00012887642,0.9700187,0.002365954,0.000335451,0.00086951826,0.00012736744,0.000055724777,0.0034778477],"genre_scores_gemma":[0.9418342,0.0009194705,0.054414026,0.0009985134,0.00096342986,0.00006909469,0.00018919907,0.00007708157,0.00053495925],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981622,0.00003876507,0.00032487247,0.000534572,0.0006259827,0.00031357683],"domain_scores_gemma":[0.999062,0.00010264756,0.00015233064,0.0004904663,0.00013820812,0.000054350898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066448055,0.00020266451,0.00023089594,0.0002241319,0.00005633053,0.000047731686,0.00088247756,0.00032259268,0.000081678845],"category_scores_gemma":[0.00009022644,0.00013577768,0.00006542172,0.00040183647,0.0008274952,0.0000059095655,0.00018052745,0.00034044596,0.0000029792573],"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.00010874027,0.00003614324,0.00010000905,0.00006713338,0.0000071084064,0.000007653202,0.00004728524,0.00047208345,0.9728203,0.00026391682,0.000084613595,0.02598503],"study_design_scores_gemma":[0.00045327534,0.0004166984,0.0017097912,0.0007103148,0.000017030703,0.000022785229,0.0000011639216,0.19388787,0.7913748,0.0104285395,0.00051009393,0.00046763165],"about_ca_topic_score_codex":0.00015341864,"about_ca_topic_score_gemma":0.000067644185,"teacher_disagreement_score":0.91921365,"about_ca_system_score_codex":0.00015531783,"about_ca_system_score_gemma":0.0006808064,"threshold_uncertainty_score":0.5536853},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030684748,0.000046619134,0.9959049,0.0004982602,0.00024945757,0.0005515969,0.000008171494,0.0007120297,0.0017221149],"genre_scores_gemma":[0.12861028,0.000083149534,0.8682179,0.0011347062,0.00028060333,0.00018966277,0.000005883651,0.00007851722,0.0013992762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970034,0.000025266902,0.00038797618,0.0013673045,0.0007529478,0.00046310254],"domain_scores_gemma":[0.9978084,0.00038101876,0.00025206103,0.0012027491,0.00021543345,0.00014031948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043876274,0.0004289359,0.00036964653,0.0007753263,0.0003461812,0.00046417,0.002120537,0.00016986129,0.000034188404],"category_scores_gemma":[0.000028952487,0.0003678689,0.000102541344,0.0010592155,0.00043027065,0.00053982995,0.00062331744,0.00044313254,0.00014679943],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011455112,0.000050237522,0.00012522569,0.00006826896,0.000026366632,0.00019164951,0.00052395207,0.0063242326,0.0008849146,0.03687162,0.00006911346,0.95485294],"study_design_scores_gemma":[0.00039062937,0.0006047901,0.0012769308,0.0007806132,0.000048340666,0.00034214536,0.0000014444004,0.87670743,0.040417444,0.07615155,0.001398831,0.0018798361],"about_ca_topic_score_codex":0.00006765342,"about_ca_topic_score_gemma":0.00010665792,"teacher_disagreement_score":0.9529731,"about_ca_system_score_codex":0.00023675904,"about_ca_system_score_gemma":0.00032988156,"threshold_uncertainty_score":0.99987733},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57941383,0.00036174827,0.41237205,0.0016795764,0.0018405521,0.003824292,0.000033947315,0.00006899135,0.00040503673],"genre_scores_gemma":[0.98367167,0.00003613417,0.0149292685,0.0009822801,0.00021331299,0.000025394993,0.000014909483,0.000046433284,0.00008059439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975943,0.00008006138,0.0003669101,0.0009680209,0.00072915625,0.00026157952],"domain_scores_gemma":[0.990763,0.0072842645,0.00036919344,0.0012514333,0.00027487977,0.000057202742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003214133,0.00025741762,0.00056470657,0.00019285284,0.0001472142,0.00002891217,0.0006089115,0.00006900623,0.0000035934459],"category_scores_gemma":[0.006266608,0.00012555465,0.000104455416,0.0003125001,0.001392716,0.000042066567,0.00021654027,0.0007261975,7.880643e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011188536,0.000469337,0.019701067,0.0032039536,0.00047971625,0.00011597419,0.0049648695,0.015176277,0.0016246979,0.0068083587,0.00022217662,0.9461147],"study_design_scores_gemma":[0.012966212,0.023915906,0.20625287,0.025941586,0.0022629702,0.00033341916,0.000020766453,0.6285437,0.059486236,0.035573173,0.002066987,0.0026361772],"about_ca_topic_score_codex":0.000036565652,"about_ca_topic_score_gemma":0.000008158471,"teacher_disagreement_score":0.9434785,"about_ca_system_score_codex":0.000072920324,"about_ca_system_score_gemma":0.00024090808,"threshold_uncertainty_score":0.7502168},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006312948,0.00014496516,0.99646455,0.0014957989,0.00088371296,0.0006397237,0.0000381615,0.00020174895,0.00006823482],"genre_scores_gemma":[0.64804846,0.000026606667,0.34986743,0.001124911,0.0005207944,0.00006814343,0.00009112698,0.000044853397,0.0002076446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958311,0.00004447059,0.0008051388,0.0016789498,0.0008545757,0.00078577985],"domain_scores_gemma":[0.99391764,0.0034421026,0.0005779757,0.0013765784,0.00048666698,0.00019900828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005194446,0.0005277319,0.0008459236,0.000902764,0.00031501258,0.00017968453,0.0033763528,0.00029355244,0.000010527177],"category_scores_gemma":[0.00021080417,0.0004893415,0.00038360705,0.0029852015,0.00092407723,0.00041972214,0.0009831493,0.0006959162,0.0000048236857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008121267,0.000006410117,0.00014131685,0.000012676043,0.00004575602,0.000004459391,0.00006384542,0.8695169,0.00001194165,0.052976627,0.00002909265,0.077182844],"study_design_scores_gemma":[0.00016881284,0.00009818845,0.0005718049,0.000038993174,0.00003534762,0.00000776181,6.896274e-8,0.8464445,0.000032369404,0.15207052,0.00012698135,0.00040467843],"about_ca_topic_score_codex":0.000029312489,"about_ca_topic_score_gemma":0.0001105313,"teacher_disagreement_score":0.64798534,"about_ca_system_score_codex":0.00022944192,"about_ca_system_score_gemma":0.00031122216,"threshold_uncertainty_score":0.9997558},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3662655,0.00005048986,0.6292263,0.002531932,0.00053814356,0.0012908883,0.0000013911501,0.00006885686,0.000026484484],"genre_scores_gemma":[0.99248,0.0000066412717,0.006492099,0.00046825953,0.0002320571,0.000056062385,0.000011158894,0.000030883417,0.00022288153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978918,0.0000847383,0.00036226292,0.0009268273,0.00039696766,0.00033739812],"domain_scores_gemma":[0.99812734,0.0007727957,0.00014987616,0.00041725856,0.00032540676,0.0002073352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093119714,0.0002928845,0.00036562036,0.00045022278,0.00024535586,0.00017793877,0.0001505187,0.00016743244,0.000013864116],"category_scores_gemma":[0.00034608596,0.00023041615,0.000036088666,0.0004747094,0.00029365442,0.00012294448,0.00009068008,0.0006491118,0.000013494259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022588274,0.00014668018,0.04979809,0.0002963464,0.00003087154,0.0013111916,0.013978393,0.050443616,0.000091368645,0.000039864775,0.0000036214108,0.8836341],"study_design_scores_gemma":[0.001040757,0.026151242,0.011415345,0.004410579,0.00055516034,0.0033351842,0.0016452818,0.92408985,0.002179805,0.022530038,0.00030571336,0.0023410255],"about_ca_topic_score_codex":0.0010244001,"about_ca_topic_score_gemma":0.0025341082,"teacher_disagreement_score":0.88129306,"about_ca_system_score_codex":0.00046539496,"about_ca_system_score_gemma":0.0004022696,"threshold_uncertainty_score":0.93960977},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013178408,0.00020311546,0.9918324,0.006497441,0.00019164754,0.00060091447,0.0000074087525,0.00012659261,0.00040870984],"genre_scores_gemma":[0.35388196,0.0008934356,0.62778085,0.008610204,0.0017474577,0.00033283056,0.0009580541,0.00020991595,0.0055853077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979543,0.00002509718,0.00046034018,0.0005294708,0.00072389,0.00030691188],"domain_scores_gemma":[0.99851704,0.0007196648,0.00015195309,0.00032345418,0.0001576233,0.00013025463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013232089,0.00017568759,0.00042106086,0.00053663587,0.00006143751,0.00001968751,0.00043845968,0.00017059443,0.000042375483],"category_scores_gemma":[0.0014799424,0.00014840892,0.00007207033,0.0008164227,0.0005351468,0.000042305375,0.00022658166,0.00073578866,0.0000027229032],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023248846,0.000074032425,0.001999187,0.0004313293,0.0000059940667,0.00004258911,0.00024068881,0.005248647,0.00029208747,0.00067615794,0.0010807415,0.9898853],"study_design_scores_gemma":[0.00042031988,0.000059946775,0.00023417585,0.0015468285,0.000011793498,0.000023877317,3.0954718e-7,0.9751145,0.00042261777,0.015385896,0.006649442,0.00013027198],"about_ca_topic_score_codex":0.00006513651,"about_ca_topic_score_gemma":0.000068356974,"teacher_disagreement_score":0.98975503,"about_ca_system_score_codex":0.00022739127,"about_ca_system_score_gemma":0.0011580554,"threshold_uncertainty_score":0.605194},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008590768,0.00003974929,0.99368215,0.003400951,0.0005486546,0.001478971,0.000007138053,0.0005396955,0.00021679219],"genre_scores_gemma":[0.04924213,0.000033194337,0.94807893,0.0010804533,0.00031900275,0.00024214006,0.00009523982,0.00009861158,0.00081032416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996402,0.000045150522,0.00053795765,0.0017700958,0.00057141273,0.00067334925],"domain_scores_gemma":[0.99654555,0.0015374817,0.00047449293,0.00093109644,0.00035875908,0.00015261542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069594267,0.000503386,0.0004347518,0.00058034796,0.0006216666,0.00046974726,0.0019519405,0.00021412903,0.000002767099],"category_scores_gemma":[0.0001268216,0.00046941522,0.00009246891,0.0009993126,0.00037048146,0.0007857979,0.00053687557,0.00076591497,0.000028028659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026760837,0.000031306583,0.0000416581,0.000054755576,0.000019036706,0.000008526746,0.0008242181,0.3337189,0.023325576,0.017810017,0.0000459401,0.6240933],"study_design_scores_gemma":[0.00056544837,0.00030457223,0.00015700815,0.00019936719,0.000010674305,0.000015945914,0.0000014857718,0.9698506,0.0020864161,0.025684362,0.0005651389,0.00055900635],"about_ca_topic_score_codex":0.000008340606,"about_ca_topic_score_gemma":0.000078944424,"teacher_disagreement_score":0.6361317,"about_ca_system_score_codex":0.00031012722,"about_ca_system_score_gemma":0.0003189183,"threshold_uncertainty_score":0.99977577},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022417178,0.000108913235,0.9764307,0.000050478306,0.00012619414,0.00059141376,0.000007746695,0.000035055094,0.00023228418],"genre_scores_gemma":[0.39838827,0.00014772851,0.5993979,0.00052528403,0.0003080053,0.00010788244,0.0004127347,0.00009257203,0.00061965385],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822575,0.0000177355,0.00035023122,0.00085939077,0.00024864188,0.00029824846],"domain_scores_gemma":[0.9991612,0.00005092293,0.00013821173,0.00041692908,0.00019360663,0.0000391163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005746237,0.00025186478,0.00023261699,0.00045129439,0.00007603953,0.00011324231,0.00040430194,0.00016096637,0.0000034430477],"category_scores_gemma":[0.00007471227,0.00026372774,0.00008761653,0.00023068373,0.0001581077,0.000010579233,0.00022103153,0.00017535553,0.0000044722215],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027766608,0.00002600235,0.000019164056,0.000042023185,0.000009663928,0.000006535346,0.000157692,0.101747155,0.8756651,0.0000528574,0.000021007972,0.022224989],"study_design_scores_gemma":[0.00032029673,0.00008223829,0.000004807383,0.00009241615,0.000010588627,0.0000020729697,7.280844e-7,0.6644551,0.32835394,0.006403687,0.000035355642,0.00023871369],"about_ca_topic_score_codex":0.000042895685,"about_ca_topic_score_gemma":0.00026686507,"teacher_disagreement_score":0.562708,"about_ca_system_score_codex":0.00012455674,"about_ca_system_score_gemma":0.0001298937,"threshold_uncertainty_score":0.9999815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00894498,0.00022083319,0.9891837,0.00007467302,0.00024715235,0.0002123243,0.000015161474,0.000015824206,0.0010852987],"genre_scores_gemma":[0.8790111,0.00021152428,0.118537016,0.00015381297,0.00036122964,0.000008825439,0.000109314366,0.00005936944,0.0015478346],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998572,0.0000046042974,0.0003968787,0.0004571399,0.00032797453,0.00024140358],"domain_scores_gemma":[0.9988692,0.000031074833,0.00031271137,0.00059551076,0.00015101233,0.000040516443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037128726,0.00024105636,0.00025446716,0.00026722875,0.000068226014,0.000079831036,0.0006220574,0.00019806135,0.000003429058],"category_scores_gemma":[0.00004832914,0.00019532433,0.00007244927,0.000255174,0.00027138385,0.000012903163,0.00022969901,0.00019910788,0.0000051595],"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.00008413958,0.00010479262,0.0009955304,0.0003693848,0.00018896862,0.000009568508,0.00055645587,0.05826777,0.86692125,0.0039075008,0.00007627796,0.06851835],"study_design_scores_gemma":[0.0023314732,0.0022013127,0.005908644,0.0011085453,0.000120602854,0.00019371457,0.000015684263,0.18163896,0.7820592,0.020444073,0.0016310115,0.0023467778],"about_ca_topic_score_codex":0.0000053071735,"about_ca_topic_score_gemma":0.000017808637,"teacher_disagreement_score":0.8706467,"about_ca_system_score_codex":0.00003338312,"about_ca_system_score_gemma":0.00017097173,"threshold_uncertainty_score":0.7965095},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035355083,0.0010276729,0.9962142,0.0006156484,0.00042000212,0.00030980192,0.0000027425865,0.00068658404,0.00036977377],"genre_scores_gemma":[0.26914883,0.000017600723,0.7286436,0.0009263132,0.00045008992,0.000014210867,0.000014246292,0.00003528125,0.0007498444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973605,0.000024818148,0.00035270903,0.0011971444,0.0005843135,0.00048046763],"domain_scores_gemma":[0.99840385,0.00049734546,0.00022122545,0.00061404286,0.00015728307,0.00010623452],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046340592,0.0003660687,0.00034720736,0.0005476826,0.0003601494,0.00054343016,0.0018726647,0.00015281588,6.650959e-7],"category_scores_gemma":[0.000083634535,0.00031885225,0.000057975954,0.0016790297,0.0003686731,0.0005064348,0.001634802,0.0007487135,0.000012486402],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.809756e-7,0.000011328589,0.000031090556,0.00005289249,0.0000026578516,0.000036678673,0.0010408711,0.016445847,0.00010167119,0.0019414133,0.00003298666,0.9803018],"study_design_scores_gemma":[0.00009480815,0.000026548343,0.00055032555,0.00023192496,0.0000019090958,0.0000628865,2.8622497e-7,0.88454473,0.00006883501,0.11390892,0.00015564116,0.00035318706],"about_ca_topic_score_codex":0.0000055504183,"about_ca_topic_score_gemma":0.000015745149,"teacher_disagreement_score":0.9799486,"about_ca_system_score_codex":0.00020871412,"about_ca_system_score_gemma":0.0004788476,"threshold_uncertainty_score":0.9999263},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025384687,0.001643105,0.934731,0.017218294,0.014894793,0.0014732208,0.0000036893575,0.00051324506,0.0041379533],"genre_scores_gemma":[0.9265261,0.0012423623,0.035392344,0.01350056,0.008183569,0.000036170364,0.00012254965,0.00018457694,0.01481175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974302,0.000090208116,0.00077007164,0.0007932628,0.00044787134,0.00046838282],"domain_scores_gemma":[0.9978571,0.0013146,0.00015524247,0.00039214545,0.00013603916,0.0001448949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001955907,0.00020345168,0.0004371051,0.00074671744,0.00010900036,0.00006739467,0.00034635497,0.00024125002,0.00002034111],"category_scores_gemma":[0.0016259706,0.0001871178,0.000085756445,0.001015203,0.00040182177,0.000095119554,0.00019365168,0.0020917573,0.00013757966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016098367,0.00003722027,0.06105092,0.000085728774,0.000002115523,0.00014228116,0.0007347306,0.0074929353,0.000010092604,0.00002198056,0.000087947825,0.93031794],"study_design_scores_gemma":[0.00012908124,0.00058190717,0.023850173,0.0020128407,0.000018777167,0.000099030636,0.000003357165,0.9329188,0.000275858,0.03427096,0.0053663896,0.0004728408],"about_ca_topic_score_codex":0.0002907019,"about_ca_topic_score_gemma":0.00045724222,"teacher_disagreement_score":0.9298451,"about_ca_system_score_codex":0.00036462463,"about_ca_system_score_gemma":0.0019957805,"threshold_uncertainty_score":0.9087761},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030981079,0.0035848715,0.9447854,0.0010281543,0.0051384917,0.0027489136,0.00029381027,0.00044738431,0.010991866],"genre_scores_gemma":[0.7591571,0.00042540973,0.23276013,0.0021676735,0.0016845866,0.00007815101,0.00026543406,0.00021069321,0.003250793],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9965895,0.00012595791,0.000736216,0.0009819212,0.00090986415,0.0006565727],"domain_scores_gemma":[0.9968637,0.0011750964,0.0008536286,0.0007428249,0.00024074176,0.00012396635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012250297,0.00041535092,0.0006454888,0.000494981,0.00047503476,0.000055197586,0.0009290538,0.0005813455,0.000043087864],"category_scores_gemma":[0.00012822454,0.000341251,0.000116086514,0.00038808267,0.0003595156,0.00025548937,0.0005528999,0.0016105812,0.00007200235],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025654864,0.0005259295,0.10004769,0.001986726,0.0011734432,0.00034764124,0.020330522,0.0032475526,0.01699353,0.01195361,0.0023381077,0.8407987],"study_design_scores_gemma":[0.0036000821,0.00064203585,0.60160375,0.018559542,0.00049323303,0.0000214982,0.000034963483,0.012260815,0.0006579784,0.3545471,0.0052112313,0.0023677777],"about_ca_topic_score_codex":0.00037980668,"about_ca_topic_score_gemma":0.0008286695,"teacher_disagreement_score":0.83843094,"about_ca_system_score_codex":0.00012932974,"about_ca_system_score_gemma":0.0005057678,"threshold_uncertainty_score":0.999904},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007513205,0.00014531118,0.9736614,0.0007875383,0.008363805,0.00037337712,0.000011468874,0.00033152863,0.015574214],"genre_scores_gemma":[0.82599413,0.0002613393,0.0361083,0.029205378,0.0475928,0.00011780102,0.00044938302,0.0005857971,0.059685063],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99554396,0.000004022989,0.00041735938,0.0015570105,0.0015507832,0.0009268801],"domain_scores_gemma":[0.9979558,0.00018980907,0.00029261273,0.0011073956,0.0004280248,0.000026331489],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014682179,0.00045352324,0.00040818783,0.002171565,0.00054366584,0.0033131756,0.0039963783,0.000194487,0.000049785063],"category_scores_gemma":[0.0005657078,0.00038418281,0.000088216766,0.0056026797,0.002825993,0.0051606004,0.0030242074,0.0006238538,0.0010463996],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026603511,0.00011368971,0.0020605596,0.0008032501,0.000011398526,0.0002300209,0.0001481192,0.017788446,0.0009844773,0.028013453,0.0073159826,0.942504],"study_design_scores_gemma":[0.00042873307,0.000045776796,0.0068461006,0.0029296684,0.00006656552,0.000040362367,0.0000016820211,0.37499887,0.0018848154,0.52880454,0.08087061,0.0030822773],"about_ca_topic_score_codex":0.00014830624,"about_ca_topic_score_gemma":0.00022810018,"teacher_disagreement_score":0.9394217,"about_ca_system_score_codex":0.00032601182,"about_ca_system_score_gemma":0.0012277875,"threshold_uncertainty_score":0.99988776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001279862,0.00014602664,0.98606324,0.001219663,0.0013653164,0.0012602214,0.000009462228,0.00024791787,0.0084082885],"genre_scores_gemma":[0.3677783,0.00026531456,0.56500417,0.006863128,0.005431311,0.00027523225,0.00068316696,0.0005220468,0.053177334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723715,0.000011476244,0.00041140697,0.0010403618,0.0007625143,0.0005371114],"domain_scores_gemma":[0.99859583,0.0003705269,0.00023056491,0.00050159893,0.00017262415,0.00012885897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005159731,0.00040424024,0.0005005077,0.0006186365,0.00018190757,0.000118664095,0.0004974404,0.0002465595,0.00005018404],"category_scores_gemma":[0.00018144562,0.00038069175,0.00014658931,0.0003311424,0.00030943638,0.00013090517,0.00041518736,0.00069093856,0.000048035894],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022296843,0.0001803786,0.0024723238,0.0014561644,0.0005238761,0.00047697668,0.0031404023,0.033973984,0.01662119,0.0026131964,0.0044529717,0.93386555],"study_design_scores_gemma":[0.016749604,0.0059942305,0.004159196,0.009041409,0.00263253,0.00071018323,0.00003297453,0.6814665,0.17049792,0.036476076,0.06664569,0.005593635],"about_ca_topic_score_codex":0.000007886485,"about_ca_topic_score_gemma":0.000006752561,"teacher_disagreement_score":0.92827195,"about_ca_system_score_codex":0.000226543,"about_ca_system_score_gemma":0.00023567719,"threshold_uncertainty_score":0.9998645},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004853194,0.000110107576,0.99614704,0.00041851433,0.0010442236,0.0005904837,0.00005682109,0.0002429484,0.0009045386],"genre_scores_gemma":[0.75482905,0.000058452646,0.2445135,0.00016266367,0.0002443318,0.000027560925,0.000078049416,0.00004466209,0.000041713913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950721,0.00011987709,0.00071445823,0.0016456957,0.0019817548,0.00046611065],"domain_scores_gemma":[0.9942415,0.00095624075,0.0004970531,0.0038763375,0.00036832193,0.000060581908],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0065157306,0.0003897012,0.00043855928,0.0009708488,0.00012086521,0.00031035978,0.008180296,0.00027029408,0.000006145775],"category_scores_gemma":[0.00084480294,0.00031092524,0.00006096168,0.0013122574,0.00052508846,0.0009806284,0.004803549,0.0007861022,0.000012672626],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002750571,0.00001699537,0.000046970785,0.000017191996,0.0000072772796,0.00001004277,0.0005623476,0.0066883587,0.00008392819,0.0017923184,0.000016100423,0.99075574],"study_design_scores_gemma":[0.00020989246,0.00009720414,0.00054885336,0.00048473175,0.000017988748,0.00001943388,0.0000010319922,0.9024707,0.0032420645,0.09248538,0.00010758116,0.00031510167],"about_ca_topic_score_codex":0.00026835484,"about_ca_topic_score_gemma":0.0016946024,"teacher_disagreement_score":0.9904406,"about_ca_system_score_codex":0.0003426685,"about_ca_system_score_gemma":0.0008206501,"threshold_uncertainty_score":0.99993426},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018279439,0.00017783575,0.9940381,0.00041452117,0.0033744234,0.0007497906,0.00000841917,0.0010207534,0.000033353892],"genre_scores_gemma":[0.62797743,0.00008690607,0.36625963,0.0015997079,0.002465452,0.00018574952,0.000028985194,0.00031115746,0.0010849665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955691,0.000037858514,0.00046165875,0.0017588821,0.0010827333,0.00108973],"domain_scores_gemma":[0.9945263,0.0032309745,0.00013962059,0.0015030211,0.00035274585,0.00024728404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014134615,0.0005453671,0.0005021456,0.0011690493,0.00039829852,0.0006947645,0.0037375484,0.0004751069,0.0000037964444],"category_scores_gemma":[0.0006724515,0.0005460216,0.00023297273,0.0014087439,0.0004411652,0.00045812837,0.0014013366,0.0012747918,0.000014506572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070354067,0.000008724459,0.00008151827,0.000042529733,0.000010087951,0.00002243253,0.00013578025,0.594348,0.00004385691,0.0005526378,0.00001948394,0.40472794],"study_design_scores_gemma":[0.0002773469,0.00018306002,0.0004104027,0.00011332461,0.000006061917,0.0000276976,6.8471124e-8,0.9731603,0.0004332516,0.024368733,0.00047620008,0.00054351264],"about_ca_topic_score_codex":0.000025082132,"about_ca_topic_score_gemma":0.00014724954,"teacher_disagreement_score":0.6277946,"about_ca_system_score_codex":0.0002872832,"about_ca_system_score_gemma":0.00021371707,"threshold_uncertainty_score":0.9996991},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047029653,0.000182222,0.98925734,0.00018945878,0.0043854727,0.00052108243,0.000004573792,0.00049172604,0.00026516107],"genre_scores_gemma":[0.87230897,0.00004427446,0.12601094,0.000640032,0.0006878053,0.000015277557,0.0000034894447,0.00007933279,0.00020986226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957551,0.000044055592,0.0006659383,0.0016816162,0.0010066616,0.0008466429],"domain_scores_gemma":[0.99791026,0.00027711506,0.00021705216,0.0011790633,0.00022275069,0.00019374055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001096262,0.00056654366,0.00061690796,0.0009312565,0.00046153093,0.0004252886,0.0018604163,0.0004927969,0.00000937241],"category_scores_gemma":[0.000046494068,0.00050431106,0.00026457777,0.0010299904,0.0005643203,0.000734192,0.000529287,0.0007425893,0.000107200576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010570208,0.000023463948,0.00034597862,0.0001554992,0.000021249247,0.000091507434,0.00057887606,0.56792605,0.0004782592,0.00017073027,0.0000031437746,0.4301947],"study_design_scores_gemma":[0.00023139396,0.00024065694,0.0002977464,0.00036794101,0.000012405128,0.00038115872,2.1046725e-7,0.9838298,0.0040203305,0.009524684,0.0003419422,0.0007517482],"about_ca_topic_score_codex":0.0001167766,"about_ca_topic_score_gemma":0.0002685895,"teacher_disagreement_score":0.86760604,"about_ca_system_score_codex":0.0005413162,"about_ca_system_score_gemma":0.0005254503,"threshold_uncertainty_score":0.99974084},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009721058,0.0008436212,0.95385104,0.028878309,0.0026845504,0.0020398789,0.000029860905,0.00017762253,0.0017740645],"genre_scores_gemma":[0.9766247,0.0001086979,0.011141838,0.011281553,0.00033916018,0.000015142183,0.000010451233,0.00005304034,0.00042539064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997529,0.00003957335,0.0004839817,0.0006469333,0.00095424446,0.00034626902],"domain_scores_gemma":[0.994591,0.004132107,0.00021205258,0.0008353984,0.00017206298,0.0000573907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010589269,0.00026224225,0.00045652312,0.0007629222,0.0001007144,0.00008159579,0.0007872736,0.00021132702,0.000022478383],"category_scores_gemma":[0.0011071049,0.00019793879,0.00009046791,0.0007302446,0.0007663142,0.000107709864,0.0002736112,0.00077066035,0.000029157864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001240441,0.0004360766,0.011959905,0.0010273815,0.00008142876,0.0012843837,0.03546992,0.42477646,0.0012770807,0.0055598053,0.0021927787,0.5158107],"study_design_scores_gemma":[0.0029220309,0.0014640429,0.052623805,0.025496569,0.0003052938,0.0006778131,0.000015319427,0.7728004,0.004032572,0.11861053,0.019009696,0.0020419303],"about_ca_topic_score_codex":0.00018082456,"about_ca_topic_score_gemma":0.00038903093,"teacher_disagreement_score":0.9669037,"about_ca_system_score_codex":0.00025409562,"about_ca_system_score_gemma":0.0006980532,"threshold_uncertainty_score":0.8071709},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009447853,0.00018899262,0.9828943,0.0019425142,0.0037425954,0.000881625,0.0000038527974,0.00030999992,0.00058826036],"genre_scores_gemma":[0.97803897,0.000032847285,0.018305616,0.0022740576,0.00042243197,0.00002267529,0.0000038894736,0.00008089337,0.0008186271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952884,0.00020232308,0.0007939441,0.0015215186,0.0014110447,0.00078280416],"domain_scores_gemma":[0.99080735,0.0069531077,0.00048153507,0.0014529526,0.00018779794,0.00011727814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020504347,0.00056575116,0.00060395553,0.0010158282,0.0006099915,0.00060178956,0.0036496285,0.00022789996,0.0000047019466],"category_scores_gemma":[0.0011141042,0.00043266412,0.00016910385,0.0014582915,0.0010754579,0.0006097405,0.0014494039,0.0010343299,0.000026471134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013828603,0.000114234754,0.0009025146,0.000266134,0.000079422076,0.000689177,0.019945223,0.12090427,0.013167831,0.044509094,0.000084364256,0.7993239],"study_design_scores_gemma":[0.00015210346,0.00031629455,0.00052671495,0.0014489415,0.00001434789,0.000031018662,0.00000744667,0.843465,0.011067812,0.1424344,0.000054747543,0.00048119016],"about_ca_topic_score_codex":0.00013434282,"about_ca_topic_score_gemma":0.00006829414,"teacher_disagreement_score":0.9685911,"about_ca_system_score_codex":0.00030390074,"about_ca_system_score_gemma":0.00030763113,"threshold_uncertainty_score":0.99981254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074213906,0.00017218711,0.8977063,0.08953342,0.0019199871,0.002170555,0.000017696304,0.000050578943,0.0010079357],"genre_scores_gemma":[0.9892743,0.000034129916,0.0053931014,0.0045718206,0.00062150933,0.00003372371,0.000010504691,0.000017338101,0.000043570042],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964255,0.000046383233,0.00078829523,0.0009925273,0.0011104221,0.0006368797],"domain_scores_gemma":[0.99378294,0.004926075,0.00020696645,0.0005412587,0.00022546109,0.00031728914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007959329,0.00023139865,0.0003970942,0.00046399713,0.0006535278,0.0003403498,0.0015096156,0.00017353384,0.000018497605],"category_scores_gemma":[0.0071693272,0.00017474279,0.000043577988,0.0011146409,0.0019593572,0.0002100704,0.0010231552,0.00083337835,0.000023559332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023874707,0.000017336934,0.011675004,0.000045574034,0.0000012198315,0.000006104166,0.0006791281,0.0002014281,7.6028584e-7,0.17379865,0.000027676764,0.81352323],"study_design_scores_gemma":[0.000023984001,0.00020176078,0.013652158,0.0013472624,0.0000052401283,0.000016824659,0.000014247703,0.042326555,0.00009382839,0.9421044,0.000044789274,0.00016896463],"about_ca_topic_score_codex":0.00069920364,"about_ca_topic_score_gemma":0.0016647918,"teacher_disagreement_score":0.9818529,"about_ca_system_score_codex":0.0010886062,"about_ca_system_score_gemma":0.0055986363,"threshold_uncertainty_score":0.9931741},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047754098,0.0044693695,0.25707543,0.68594056,0.0029023981,0.0014750694,0.0000070363435,0.00015166232,0.00022434615],"genre_scores_gemma":[0.96492606,0.0008145568,0.0063311574,0.02590717,0.0018793422,0.000029554092,0.000026899948,0.000050243194,0.000035022935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946567,0.00025234986,0.0014895746,0.0012035496,0.001797597,0.0006002606],"domain_scores_gemma":[0.99547386,0.003070915,0.00018512204,0.00041219837,0.000320004,0.000537903],"candidate_categories":["metaresearch","metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0055884672,0.000336927,0.00095108734,0.0009558818,0.000074902695,0.00006983254,0.0005357468,0.0010366006,0.00004387048],"category_scores_gemma":[0.010360809,0.00028963253,0.000073915595,0.00092800177,0.003997679,0.00011463763,0.00038309462,0.0046272893,0.0000060876396],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001585693,0.00026037125,0.1906507,0.0014361092,0.000006674657,0.0013202527,0.0016678547,0.000048274283,0.000020253377,0.00055524654,0.0007376403,0.803138],"study_design_scores_gemma":[0.00080645236,0.00030927366,0.047096748,0.013737665,0.000031502866,0.00045535815,0.000020558497,0.7432675,0.00031565435,0.19287507,0.0004387042,0.0006455586],"about_ca_topic_score_codex":0.0006766277,"about_ca_topic_score_gemma":0.0016114516,"teacher_disagreement_score":0.91717196,"about_ca_system_score_codex":0.00022703517,"about_ca_system_score_gemma":0.008126746,"threshold_uncertainty_score":0.9999556},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5895144,0.0005428887,0.39425135,0.008329521,0.0009540417,0.0017553461,0.00011018065,0.000205114,0.0043372046],"genre_scores_gemma":[0.97630733,0.00016195615,0.019796386,0.0011202372,0.001628007,0.00005291041,0.000054114418,0.000029748526,0.0008493313],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696034,0.00042169046,0.0003734896,0.0009461349,0.0007138783,0.0005844844],"domain_scores_gemma":[0.99418724,0.0048693325,0.00016446227,0.00022988826,0.00037736216,0.00017170867],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008067242,0.00017540429,0.00035314876,0.0020990865,0.0010048045,0.0010511697,0.00038943565,0.00019570658,0.0000065980344],"category_scores_gemma":[0.0030799126,0.0002055752,0.00003970317,0.002375857,0.000709179,0.0003588078,0.00021023968,0.00065020105,0.0000058050214],"study_design_candidate":"design_other","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.00013870955,0.00028612115,0.03500354,0.00017447556,0.000251836,0.00010127752,0.08926383,0.0026602729,0.0059436243,0.0011762782,0.00033718444,0.8646628],"study_design_scores_gemma":[0.0044891024,0.0013169177,0.1772168,0.008736021,0.0007511925,0.000013028058,0.0035825477,0.13696174,0.0016841333,0.65884984,0.002159473,0.0042391983],"about_ca_topic_score_codex":0.012423467,"about_ca_topic_score_gemma":0.015803142,"teacher_disagreement_score":0.8604237,"about_ca_system_score_codex":0.0005049012,"about_ca_system_score_gemma":0.00049848255,"threshold_uncertainty_score":0.9999858},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023673812,0.000021068647,0.9748039,0.0026053886,0.0047604837,0.0027213963,0.00012160035,0.00043043774,0.012168347],"genre_scores_gemma":[0.97722095,0.000017848843,0.0024014115,0.016653126,0.00095155375,0.00004503302,0.000009348853,0.00009936862,0.002601345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601173,0.00012997988,0.00044704985,0.0017790191,0.0010159516,0.0006162527],"domain_scores_gemma":[0.9973363,0.0010565142,0.00027808003,0.0010083324,0.000093456874,0.00022727741],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000834693,0.00047186032,0.0005324119,0.0005182808,0.00035091332,0.00085327995,0.0030487338,0.00022931129,0.00005500325],"category_scores_gemma":[0.0005504748,0.00040901828,0.00008679471,0.0003791549,0.0005424413,0.00068396557,0.0006058578,0.0007744965,0.00022615775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031006185,0.00019210529,0.000053011114,0.00004865729,0.000010960653,0.0009628206,0.0005581229,0.08734234,0.048034955,0.057707578,0.000023212433,0.80475616],"study_design_scores_gemma":[0.003730049,0.0034105808,0.00342251,0.0006256444,0.00003929945,0.00011180296,3.329988e-7,0.73552185,0.008913023,0.23609239,0.0060713845,0.002061122],"about_ca_topic_score_codex":0.00005257657,"about_ca_topic_score_gemma":0.000117404954,"teacher_disagreement_score":0.9748536,"about_ca_system_score_codex":0.00011835625,"about_ca_system_score_gemma":0.0003086186,"threshold_uncertainty_score":0.99983615},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018382426,0.00012131062,0.9934824,0.0022570365,0.0008873776,0.0004061899,0.000007916077,0.00011644808,0.002537505],"genre_scores_gemma":[0.46923494,0.00024787892,0.51944983,0.009764691,0.00068543066,0.00007839674,0.000021991187,0.00007823266,0.0004386219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653786,0.000050663497,0.0005722434,0.0011299937,0.0010675862,0.00064165785],"domain_scores_gemma":[0.9975876,0.000662722,0.00017531516,0.0013750012,0.00011890835,0.00008043592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018936507,0.00036837332,0.00034475198,0.0009133855,0.00026301056,0.00060078315,0.0042164116,0.00020884717,0.000013465193],"category_scores_gemma":[0.000057651723,0.00027918938,0.00014619133,0.0014235729,0.0004394631,0.000403171,0.0010743231,0.0009165235,0.000042153802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038027906,0.000049753962,0.00013629184,0.000025754382,0.000009656787,0.00013352178,0.007752822,0.08746074,0.0000149805055,0.52254266,0.00027035447,0.3815997],"study_design_scores_gemma":[0.00014841148,0.00004356292,0.00021082167,0.000060780603,0.0000025143665,0.000012906743,8.298816e-7,0.5656756,0.000009101908,0.4330685,0.0005211664,0.00024574256],"about_ca_topic_score_codex":0.00008561446,"about_ca_topic_score_gemma":0.0011749993,"teacher_disagreement_score":0.4782149,"about_ca_system_score_codex":0.00010578865,"about_ca_system_score_gemma":0.0004532229,"threshold_uncertainty_score":0.999966},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0092592705,0.002488132,0.98239815,0.00092406204,0.0010285156,0.0006274003,0.00003642176,0.0002452543,0.0029928205],"genre_scores_gemma":[0.8637228,0.00070642715,0.11209722,0.0043395497,0.0037116373,0.000036347315,0.00018711414,0.00015849089,0.015040386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777865,0.000022495697,0.00027439755,0.0009021895,0.0006027124,0.0004195725],"domain_scores_gemma":[0.99860346,0.000379969,0.00011093503,0.00060724,0.00011033799,0.00018803014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004112332,0.0003106397,0.0006215312,0.0016114323,0.000119791985,0.00016453161,0.0003884646,0.00026556157,0.000043212163],"category_scores_gemma":[0.00020589434,0.0002458953,0.0001666017,0.0020949747,0.0006253479,0.000119776865,0.00037732974,0.00066178734,0.000031299867],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010617063,0.00010369874,0.029362254,0.0013120414,0.000741236,0.0027188808,0.0050627566,0.0049716844,0.0005565673,0.0000651331,0.00217651,0.95282304],"study_design_scores_gemma":[0.003408316,0.0020503257,0.34914756,0.0015240641,0.0052520297,0.000773985,0.0000033710098,0.5865322,0.0019874866,0.030994337,0.01453058,0.0037957802],"about_ca_topic_score_codex":0.000015673137,"about_ca_topic_score_gemma":0.00004550282,"teacher_disagreement_score":0.9490273,"about_ca_system_score_codex":0.0001652805,"about_ca_system_score_gemma":0.00050149986,"threshold_uncertainty_score":0.99999934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029231354,0.00007314278,0.98898405,0.0020011726,0.0035345578,0.0009936808,0.000017085124,0.00022222477,0.0012509817],"genre_scores_gemma":[0.40521985,0.00009436739,0.59209734,0.0016793567,0.000487729,0.000021402086,0.000035514797,0.00008639421,0.00027800188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926665,0.00026593244,0.0011937062,0.0025246004,0.0023519949,0.0009973109],"domain_scores_gemma":[0.99531233,0.00071631203,0.0009057413,0.0014109509,0.0010830562,0.000571623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002437191,0.0007750783,0.00080297707,0.0024079536,0.00055807247,0.0008778843,0.0035926837,0.00037375314,0.000060992774],"category_scores_gemma":[0.0003151694,0.0008342715,0.00018388526,0.0032502976,0.00094304467,0.001563702,0.001192934,0.00087919465,0.00036548843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036891128,0.00004729384,0.00010999165,0.000032506905,0.000020734537,0.000065148786,0.018890062,0.6981603,0.00041932272,0.060032297,0.000003898111,0.22218159],"study_design_scores_gemma":[0.00057721644,0.00088510965,0.00095020357,0.0006777392,0.00001460122,0.00003151749,0.00004600288,0.92454916,0.0014489483,0.068905614,0.0010442488,0.0008696252],"about_ca_topic_score_codex":0.0005086957,"about_ca_topic_score_gemma":0.00043714425,"teacher_disagreement_score":0.40229672,"about_ca_system_score_codex":0.0004531824,"about_ca_system_score_gemma":0.0009702398,"threshold_uncertainty_score":0.9994108},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009740205,0.0002225151,0.9647421,0.030021382,0.0020239484,0.0013716595,0.000027928345,0.00021354285,0.00040288933],"genre_scores_gemma":[0.5933965,0.0009719272,0.33173904,0.058899976,0.008194602,0.00050904107,0.00067468535,0.0007827262,0.0048314915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578536,0.000029341552,0.0007655502,0.0012436418,0.0016436212,0.00053250085],"domain_scores_gemma":[0.9958212,0.0017986473,0.00040324614,0.0010284322,0.00065339997,0.0002951232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013007072,0.00042901098,0.00082789944,0.00093341124,0.0001147891,0.00007579242,0.0009307122,0.0006005353,0.00009297691],"category_scores_gemma":[0.0024160717,0.00037343035,0.00027009123,0.00064342556,0.0012530241,0.00012963006,0.000380216,0.0007849653,0.000056808884],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021270923,0.000876458,0.008492864,0.0037034948,0.00018646494,0.000676441,0.0010999925,0.0019861506,0.0033120362,0.008525934,0.009546157,0.9613813],"study_design_scores_gemma":[0.004515352,0.0014115957,0.014134692,0.010958975,0.0003858496,0.00015843041,0.0000019619306,0.90764415,0.0044397013,0.033350784,0.021421665,0.001576863],"about_ca_topic_score_codex":0.000038937313,"about_ca_topic_score_gemma":0.00016061745,"teacher_disagreement_score":0.9598044,"about_ca_system_score_codex":0.00046286304,"about_ca_system_score_gemma":0.0016428041,"threshold_uncertainty_score":0.9998718},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016442222,0.00017786284,0.99459684,0.0017222083,0.001050211,0.0011026651,0.00007372295,0.00086432823,0.00039573503],"genre_scores_gemma":[0.05560696,0.00018480435,0.9413133,0.00047982673,0.00079477124,0.00018477546,0.00089581264,0.000115853516,0.00042387107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99426216,0.00005357031,0.0008450967,0.002652165,0.0014805855,0.00070640986],"domain_scores_gemma":[0.99245745,0.0020739725,0.0005495282,0.0040118317,0.00064566114,0.00026152885],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023464607,0.00057600706,0.000583442,0.00080893934,0.0003831714,0.00065785646,0.0073889764,0.0004793725,0.00001495907],"category_scores_gemma":[0.0015029918,0.00049574324,0.0000755449,0.0009187296,0.0008112906,0.0016501811,0.0023309847,0.00064676197,0.000066030356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003109683,0.00008591709,0.00019250276,0.00016896558,0.000028909977,0.0000377218,0.000732242,0.0002823857,0.0015844611,0.016227877,0.00075229903,0.9798756],"study_design_scores_gemma":[0.0004475878,0.00011545788,0.00080635026,0.0007256056,0.000009700978,0.000031747382,6.450359e-7,0.98014,0.0035581912,0.0108573055,0.002631212,0.0006762499],"about_ca_topic_score_codex":0.000021236267,"about_ca_topic_score_gemma":0.0014691422,"teacher_disagreement_score":0.97985756,"about_ca_system_score_codex":0.00044529338,"about_ca_system_score_gemma":0.0013856913,"threshold_uncertainty_score":0.9997494},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012610828,0.000032262826,0.9938596,0.0030281078,0.0012385901,0.0007307526,0.000038774262,0.00030841306,0.0006374266],"genre_scores_gemma":[0.41969848,0.000044075336,0.5444904,0.0151096,0.0009909662,0.0002436497,0.00004257287,0.00029054753,0.019089729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636346,0.00004371665,0.00038641205,0.0017126484,0.000874385,0.0006193476],"domain_scores_gemma":[0.9852067,0.013826809,0.00023436446,0.0004791932,0.00015796724,0.00009491855],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009149288,0.00047355794,0.00045984672,0.00071677734,0.0007016012,0.00025566516,0.0008662754,0.00024921287,0.0000062379677],"category_scores_gemma":[0.016784657,0.0004672075,0.00016238107,0.00047760588,0.0007606741,0.00035617308,0.0006651886,0.0007635232,0.00007405753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016804415,0.000012921784,0.0000045269007,0.000049730254,0.000005029363,0.000026420636,0.0006931611,0.7861532,0.0020316893,0.005366405,0.00008711824,0.20555301],"study_design_scores_gemma":[0.00026784386,0.00010700006,0.00004391878,0.00014215238,0.00000775136,0.000013787697,3.042779e-7,0.8398669,0.0014351719,0.15738654,0.00031788947,0.00041077542],"about_ca_topic_score_codex":0.000010386917,"about_ca_topic_score_gemma":0.00020774096,"teacher_disagreement_score":0.44936916,"about_ca_system_score_codex":0.0003189149,"about_ca_system_score_gemma":0.00022427419,"threshold_uncertainty_score":0.999778},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020571243,0.00007775681,0.9744664,0.0011206521,0.0008636715,0.0023759913,0.000005741285,0.00047765693,0.000040877014],"genre_scores_gemma":[0.8142014,0.000018603476,0.1825216,0.001834517,0.00038541257,0.0006112688,0.000010124474,0.00014723597,0.0002698586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945468,0.00005823584,0.00071937597,0.0022249706,0.0013512014,0.0010994598],"domain_scores_gemma":[0.99596167,0.0012674374,0.00044855403,0.0014540191,0.0006107881,0.00025756186],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011035276,0.0007929938,0.0007339209,0.0010135095,0.0007409193,0.0012736195,0.0022379414,0.0002536689,0.0000097796155],"category_scores_gemma":[0.0000898045,0.0006197572,0.00012069943,0.0018759554,0.0005383537,0.0013804396,0.0007341072,0.00069010357,0.000020130341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048781778,0.00027964142,0.0030173822,0.00011211856,0.000081091675,0.005167395,0.008943087,0.6283563,0.0000042818756,0.0020485753,0.000094176394,0.35184717],"study_design_scores_gemma":[0.00030503012,0.0023599712,0.0001004648,0.00037390427,0.000044679873,0.0008825938,0.00003878083,0.98688024,0.00026808056,0.007851768,0.000059952854,0.0008345219],"about_ca_topic_score_codex":0.00039035495,"about_ca_topic_score_gemma":0.002183184,"teacher_disagreement_score":0.7936301,"about_ca_system_score_codex":0.00033510136,"about_ca_system_score_gemma":0.00038398115,"threshold_uncertainty_score":0.99976313},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030905395,0.005708106,0.9893425,0.00033405347,0.0013859593,0.002097974,0.00054055435,0.00016888155,0.00011292474],"genre_scores_gemma":[0.14049765,0.003286335,0.84870756,0.0032428813,0.0020248322,0.0011789149,0.00039187958,0.00037277595,0.00029719571],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99628013,0.000020850535,0.00042999658,0.0014632281,0.0010766558,0.00072914583],"domain_scores_gemma":[0.9976236,0.0004973637,0.00008733459,0.0011811316,0.00028069664,0.00032983237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043301762,0.00066487555,0.0012177157,0.0009171882,0.00021665335,0.00011919741,0.00041678737,0.0005180544,0.000019164794],"category_scores_gemma":[0.00009243376,0.0005754944,0.0072481045,0.0006218755,0.0004568464,0.000090301844,0.000050419465,0.0005384613,0.000027633718],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020453265,0.0002943674,0.013818532,0.0008351174,0.0059801964,0.00036643725,0.00022693955,0.057740103,0.000011017963,0.001549706,0.00008123351,0.9188918],"study_design_scores_gemma":[0.051578667,0.007175256,0.23263326,0.03131506,0.052418314,0.00023553857,0.0000065349486,0.18809007,0.0059326943,0.37451097,0.041640956,0.014462672],"about_ca_topic_score_codex":0.000056107834,"about_ca_topic_score_gemma":0.000010934629,"teacher_disagreement_score":0.90442914,"about_ca_system_score_codex":0.00022204785,"about_ca_system_score_gemma":0.0004740204,"threshold_uncertainty_score":0.9996697},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008694098,0.000071377945,0.9922946,0.0012011133,0.0036843298,0.0006891149,0.000013703572,0.00035246924,0.0016846124],"genre_scores_gemma":[0.0033888144,0.0000354575,0.99274474,0.000782767,0.00082781055,0.000079234356,0.000025584677,0.000059687227,0.0020559293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693793,0.000018794595,0.00043392152,0.001298632,0.00085872656,0.00045202064],"domain_scores_gemma":[0.9977237,0.0007335457,0.0002869994,0.0008592662,0.00030598004,0.00009052757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088458176,0.00034197213,0.00029364557,0.00077352393,0.0002799229,0.00042840667,0.0017150941,0.00025114923,0.000012927981],"category_scores_gemma":[0.00010872892,0.0003513671,0.00012161753,0.0006407004,0.00031881165,0.0008813848,0.00057699403,0.00042069567,0.000115076065],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008992568,0.000010745093,0.000016599628,0.000062783976,0.000014802294,0.000019339559,0.0005003471,0.04144935,0.0006130256,0.045249112,0.00031297578,0.9117419],"study_design_scores_gemma":[0.00023591665,0.00013054175,0.00010022967,0.00012737152,0.0000061096803,0.000019789566,8.8843265e-8,0.5745712,0.0021160333,0.4212852,0.0010384807,0.00036900662],"about_ca_topic_score_codex":0.000010364069,"about_ca_topic_score_gemma":0.00004984303,"teacher_disagreement_score":0.9113729,"about_ca_system_score_codex":0.00058707816,"about_ca_system_score_gemma":0.00045528813,"threshold_uncertainty_score":0.99989384},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018381355,0.000050055398,0.9805634,0.00013523054,0.00008790745,0.0005388838,0.000007369649,0.000024506377,0.00021130513],"genre_scores_gemma":[0.6880323,0.0001584501,0.31066427,0.00041538544,0.00009434827,0.00004467185,0.00018816513,0.000058989608,0.0003433888],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983197,0.000019385121,0.00039354802,0.0007344236,0.00026305113,0.00026989583],"domain_scores_gemma":[0.9993639,0.000044109252,0.00013177961,0.00027201892,0.00014834215,0.00003984119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044125857,0.0002478491,0.00028660547,0.0003900518,0.000051594518,0.00006897386,0.00035503702,0.00023895084,0.000011152086],"category_scores_gemma":[0.0000146497805,0.00024718654,0.00013321059,0.0001870987,0.00017543597,0.000021928929,0.00014089327,0.0001739342,0.000003704622],"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.000025176269,0.000028586313,0.0006232948,0.000114962626,0.000016742304,0.0000037705024,0.00012579763,0.00048634873,0.9736721,0.000014996134,0.000033790082,0.024854437],"study_design_scores_gemma":[0.00041158288,0.0002601243,0.00060273753,0.00027503129,0.000032818887,0.0000052983814,0.0000026036619,0.012496805,0.9813185,0.004249695,0.000022813052,0.00032199547],"about_ca_topic_score_codex":0.000013020653,"about_ca_topic_score_gemma":0.000048425143,"teacher_disagreement_score":0.6698991,"about_ca_system_score_codex":0.00007149781,"about_ca_system_score_gemma":0.00009585066,"threshold_uncertainty_score":0.99999803},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042557037,0.000033791835,0.9941802,0.00033041884,0.0002986191,0.00063653203,0.0000072880143,0.00017931435,0.000078116085],"genre_scores_gemma":[0.23126297,0.00015819116,0.7667125,0.00025867522,0.00090906734,0.00008181586,0.0001735229,0.00006569637,0.00037761024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998737,0.000008124908,0.00033738717,0.00049472234,0.00024510227,0.00017769537],"domain_scores_gemma":[0.99886537,0.00020479207,0.00024849863,0.00032158065,0.00027468658,0.00008506549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001999365,0.00019123468,0.00031464658,0.00039856636,0.000106027255,0.000021042613,0.00019062423,0.00018417764,0.000005754941],"category_scores_gemma":[0.00008417802,0.0001640049,0.00006998842,0.00023502907,0.00039451735,0.00009601665,0.000056858407,0.00034039054,0.000001324597],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021463922,0.000014415148,0.00072467246,0.00010775522,0.000004704947,0.0000016064276,0.00025385083,0.017281894,0.0116074495,0.0029993653,0.0000055821297,0.96697724],"study_design_scores_gemma":[0.00041184947,0.00067469047,0.0014346082,0.0010244661,0.0000498808,0.00004618694,0.0000022713969,0.70304483,0.031591654,0.26110965,0.00026824774,0.00034165688],"about_ca_topic_score_codex":0.000004558721,"about_ca_topic_score_gemma":0.00003354139,"teacher_disagreement_score":0.9666356,"about_ca_system_score_codex":0.00009244088,"about_ca_system_score_gemma":0.000080047954,"threshold_uncertainty_score":0.66879255},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016542408,0.000224355,0.9976617,0.00026816307,0.00096717256,0.00033816727,0.0000018804723,0.00009324138,0.0004287723],"genre_scores_gemma":[0.9692942,0.00005116296,0.029671721,0.00040126397,0.00016617794,0.0000083324385,5.0944396e-7,0.00004326265,0.00036339473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900717,0.000018698607,0.00021965792,0.000267959,0.00028023976,0.00020628366],"domain_scores_gemma":[0.9991523,0.00034256288,0.000055975845,0.0003549994,0.000048210826,0.000045947138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032498964,0.00019274431,0.0002736971,0.00015894715,0.000058063244,0.000050809536,0.00048266057,0.0001311204,0.00000990162],"category_scores_gemma":[0.00003365495,0.00013587902,0.000053929292,0.00017330714,0.0002970003,0.000049191796,0.0000953535,0.00029834325,0.000008099769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020519713,0.0000019384606,0.000014147949,0.000022061495,0.00001088685,0.0000031019772,0.00010449531,0.90837663,0.00070572196,0.00072288624,0.0000067685783,0.090029314],"study_design_scores_gemma":[0.00032452296,0.000026079048,0.00029135458,0.00014253997,0.000011952818,0.000007219385,5.8009036e-8,0.9837285,0.00086195936,0.014390311,0.00005740532,0.0001580812],"about_ca_topic_score_codex":0.0000033550905,"about_ca_topic_score_gemma":0.00000861903,"teacher_disagreement_score":0.9692776,"about_ca_system_score_codex":0.000044768494,"about_ca_system_score_gemma":0.00006149293,"threshold_uncertainty_score":0.55409855},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018488448,0.00010254742,0.99313253,0.00007023934,0.0016639726,0.00014490414,0.000003026268,0.000242177,0.0046221246],"genre_scores_gemma":[0.8874198,0.0003107473,0.10761849,0.00042139008,0.0015234111,0.000025898436,0.000051073253,0.00020826301,0.002420906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880326,0.000008509984,0.00029186267,0.00030803675,0.00038650836,0.00020181364],"domain_scores_gemma":[0.9992941,0.00014993349,0.00006931835,0.00034754226,0.00009338116,0.000045739365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025073386,0.00018834783,0.00025452234,0.00048278426,0.000050537896,0.000045229408,0.00041880875,0.0001530528,0.0000371347],"category_scores_gemma":[0.000057997295,0.00018600517,0.00006524942,0.00033880526,0.00012715004,0.00008454565,0.00010168148,0.00023868935,0.000021389384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012877055,0.0000031262387,0.000013035828,0.000035486748,0.000009122703,0.0000046474356,0.00012750969,0.8282362,0.00038589508,0.0043907454,0.000020476467,0.16677245],"study_design_scores_gemma":[0.00017471059,0.00002556833,0.00030077028,0.00029134384,0.000008221823,0.000009658917,1.01359966e-7,0.94776094,0.0007910491,0.050210822,0.0001997869,0.00022704688],"about_ca_topic_score_codex":0.000009910527,"about_ca_topic_score_gemma":0.00005079754,"teacher_disagreement_score":0.88740134,"about_ca_system_score_codex":0.00011748965,"about_ca_system_score_gemma":0.00007292272,"threshold_uncertainty_score":0.7585071},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044739948,0.00023005565,0.996277,0.000022536608,0.00058497244,0.00016017884,2.1737658e-7,0.00026787477,0.0020097902],"genre_scores_gemma":[0.94525135,0.000013748641,0.05430104,0.00012957456,0.00012832815,0.0000033810406,0.0000033522329,0.000069402966,0.00009982265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983675,0.000009291322,0.00027447724,0.000484461,0.00043525198,0.00042905408],"domain_scores_gemma":[0.99917775,0.00033166728,0.00005450581,0.0003514885,0.000033336855,0.000051223098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034956628,0.00027645577,0.00030677073,0.0008368922,0.00008216725,0.0001468448,0.00044781747,0.00016099963,0.00002173004],"category_scores_gemma":[0.000045149467,0.00025220745,0.00004144025,0.0005254567,0.00006689014,0.00023658283,0.00016091859,0.0007119823,0.0000351634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019816991,0.0000021288026,0.00006821011,0.00002762316,0.000003420274,0.000115127565,0.0011543793,0.93882155,0.000009041154,0.0011378921,0.0000017621945,0.058656856],"study_design_scores_gemma":[0.00013632615,0.000016652926,0.0003592373,0.0014673476,0.0000030821316,0.000013111841,0.000001513964,0.9831745,0.000007439681,0.014503707,0.000011043898,0.00030604986],"about_ca_topic_score_codex":0.000007891492,"about_ca_topic_score_gemma":0.00042848557,"teacher_disagreement_score":0.94480395,"about_ca_system_score_codex":0.00017872338,"about_ca_system_score_gemma":0.000053929347,"threshold_uncertainty_score":0.999993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008727004,0.000054410913,0.9946239,0.00082517014,0.0018649843,0.0009771467,0.00011329632,0.0004669392,0.001065424],"genre_scores_gemma":[0.97362334,0.0000069564658,0.020410618,0.003747896,0.0007583087,0.00012014372,0.000025463341,0.00014699437,0.0011602904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974478,0.0000172473,0.0004480136,0.0007979122,0.00061860273,0.00067042734],"domain_scores_gemma":[0.998161,0.0007777491,0.00009853493,0.000650167,0.00014100174,0.00017153248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004708901,0.0005392705,0.0006700309,0.0005005632,0.00014402097,0.0001836902,0.00083831383,0.00034739607,0.000013564074],"category_scores_gemma":[0.000090371934,0.0005049362,0.00021294893,0.00019357493,0.0002225657,0.00012928502,0.000043880922,0.000596639,0.00008375963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036955465,0.000014706438,0.0000053626195,0.000030467041,0.000019702922,0.000011696308,0.00002984728,0.964446,0.0004467655,0.0031428786,0.00010733235,0.031708263],"study_design_scores_gemma":[0.002822939,0.00022284499,0.000028883134,0.00021290325,0.0000244015,0.000002353337,6.83519e-8,0.9867428,0.00009218409,0.009101624,0.00023696087,0.00051202654],"about_ca_topic_score_codex":0.0000020940856,"about_ca_topic_score_gemma":0.000014634946,"teacher_disagreement_score":0.9742133,"about_ca_system_score_codex":0.00023161736,"about_ca_system_score_gemma":0.00021271626,"threshold_uncertainty_score":0.99974024},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026688125,0.00009950805,0.9971849,0.0000749514,0.00051967363,0.00026823668,0.0000033018928,0.00024490827,0.001577831],"genre_scores_gemma":[0.6555301,0.000046091547,0.34358785,0.00013589281,0.00008017698,0.000014123579,0.0000073573497,0.000099335644,0.000499063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983884,0.0000069202138,0.00032725508,0.00046487898,0.00046461404,0.00034791444],"domain_scores_gemma":[0.999227,0.000072824194,0.0000697196,0.0004738674,0.00008372411,0.00007289439],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021292553,0.00032687408,0.0004238658,0.00044385658,0.00006510497,0.00006305489,0.00061563886,0.00017423567,0.000016846423],"category_scores_gemma":[0.0000080252275,0.00027763573,0.00007633837,0.00023573938,0.00014948867,0.00009775027,0.00011413951,0.00042029427,0.000022444621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036628624,0.0000046773243,5.7989047e-7,0.00004762385,0.000016321259,0.000016629621,0.00013219107,0.97034013,0.00021045089,0.005024838,8.267417e-7,0.02420204],"study_design_scores_gemma":[0.00026655348,0.000071230366,0.0000055106634,0.0003343804,0.0000125027,0.000011066031,2.5768983e-7,0.9342721,0.00006622055,0.06466827,0.0000043752284,0.0002875138],"about_ca_topic_score_codex":0.000009705008,"about_ca_topic_score_gemma":0.000121879006,"teacher_disagreement_score":0.65550345,"about_ca_system_score_codex":0.0001199677,"about_ca_system_score_gemma":0.000113641196,"threshold_uncertainty_score":0.9999676},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020923675,0.00032630723,0.99833333,0.000079145066,0.00025279517,0.0003379055,0.000007085958,0.00016267586,0.00029150574],"genre_scores_gemma":[0.89409906,0.000091379305,0.10471984,0.00015124945,0.00010717133,0.000009151487,0.000013917472,0.000071096976,0.00073712104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984721,0.000020845377,0.00030585428,0.00053498475,0.00039218803,0.00027401902],"domain_scores_gemma":[0.9991774,0.00009414892,0.0000919802,0.00042992178,0.0001337744,0.000072761824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019935542,0.00035162072,0.0006146774,0.00081433577,0.00007183624,0.00010101707,0.0004770191,0.00019907502,0.000023498027],"category_scores_gemma":[0.000012728216,0.0002086507,0.000061837156,0.0010187429,0.00035168094,0.000108980355,0.00007522788,0.00045381612,0.0000032305263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009237346,0.0000035793382,0.00003244657,0.00004811938,0.0001814936,0.000014770083,0.00026105435,0.95434076,0.00059362507,0.00034327974,0.0000058425917,0.044165805],"study_design_scores_gemma":[0.000223684,0.00008967456,0.00044530115,0.00034143613,0.00015735095,0.000007200325,2.327105e-7,0.99458784,0.0014399855,0.0023126337,0.000060358256,0.00033427755],"about_ca_topic_score_codex":0.000013545315,"about_ca_topic_score_gemma":0.000113580405,"teacher_disagreement_score":0.89388984,"about_ca_system_score_codex":0.0000724951,"about_ca_system_score_gemma":0.00009776904,"threshold_uncertainty_score":0.85085285},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020702195,0.00017759998,0.99571234,0.00007419239,0.0009500935,0.0013301263,0.00006923459,0.0006981627,0.0007812384],"genre_scores_gemma":[0.8946627,0.0000059466734,0.10407229,0.000120185745,0.00039956692,0.00016006094,0.0000624949,0.00016841784,0.0003483783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749273,0.00007197966,0.0004931027,0.00084506464,0.0004633778,0.00063371926],"domain_scores_gemma":[0.9971333,0.0018391483,0.00020152617,0.00038989075,0.0003294504,0.000106646316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049452134,0.0006068337,0.00078578235,0.0009455787,0.0002626948,0.00037127474,0.00046726465,0.00031701918,0.000006075178],"category_scores_gemma":[0.00029974015,0.0005005262,0.00013038232,0.0007873107,0.0002339884,0.00025362187,0.000051811723,0.0010466295,0.000019063911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056365516,0.000006604384,0.00007694481,0.000031247153,0.000100713565,0.000018658442,0.00029474703,0.9594621,0.00026919288,0.00035566278,0.00002037472,0.03930736],"study_design_scores_gemma":[0.00072826934,0.00047011048,0.00011213145,0.00058415724,0.00005759498,0.00003857596,2.8232537e-7,0.99556357,0.00030503914,0.0014384792,0.00013947635,0.00056234165],"about_ca_topic_score_codex":0.00004480373,"about_ca_topic_score_gemma":0.0003684943,"teacher_disagreement_score":0.8944556,"about_ca_system_score_codex":0.0006290638,"about_ca_system_score_gemma":0.00017955642,"threshold_uncertainty_score":0.99974465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023677858,0.00010458255,0.9925264,0.0005881553,0.0015854785,0.0007882159,0.00002693881,0.0003188536,0.0040376857],"genre_scores_gemma":[0.98548394,0.000008538751,0.01262207,0.0009923966,0.00038524636,0.000036245037,0.000017338461,0.000088684705,0.00036555348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739933,0.000037134087,0.0006626125,0.00064870075,0.00074931514,0.00050289993],"domain_scores_gemma":[0.99796826,0.0008353403,0.00019859096,0.0006908239,0.0001835195,0.00012346057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004856867,0.0005058181,0.0009923652,0.0007713031,0.000118669865,0.00013037283,0.00081550446,0.0002632903,0.000049940914],"category_scores_gemma":[0.00007162604,0.00046201755,0.00024998636,0.0003766814,0.00028600433,0.000109855544,0.000061698534,0.000625758,0.00009528285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056822806,0.00002077706,0.000011663661,0.00006863174,0.000033957527,0.000029690329,0.000054192846,0.9395399,0.0017761076,0.0009239608,0.00001241378,0.0574719],"study_design_scores_gemma":[0.004019841,0.00014068221,0.0003025308,0.00097534043,0.000031588304,0.0000052302057,1.5814686e-7,0.99011666,0.00046287625,0.0034898992,0.000037620695,0.00041756616],"about_ca_topic_score_codex":0.000006259934,"about_ca_topic_score_gemma":0.000018507177,"teacher_disagreement_score":0.9854602,"about_ca_system_score_codex":0.00022279857,"about_ca_system_score_gemma":0.00013019335,"threshold_uncertainty_score":0.99978316},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019222788,0.000062645806,0.99355525,0.001100492,0.0028114277,0.00036706318,0.000007646917,0.0004421963,0.0014610677],"genre_scores_gemma":[0.9268308,0.00022413029,0.063965224,0.0050727613,0.0010988307,0.00019173544,0.00016613242,0.0001083669,0.0023419815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970689,0.00003072744,0.0006482282,0.0007347519,0.001078229,0.00043920695],"domain_scores_gemma":[0.99805075,0.00020252142,0.00031922682,0.0010463601,0.00024190228,0.0001392105],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000823964,0.00034454511,0.00032090463,0.0009110756,0.00024244843,0.001059824,0.0021930102,0.00021589518,0.000008244599],"category_scores_gemma":[0.00009235361,0.00033847574,0.00008462089,0.0008054672,0.00017907754,0.0030458684,0.00070208946,0.0004811229,0.00048073524],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000283164,0.000021714824,0.00006485303,0.000092673195,0.00001301785,0.000010378219,0.02286092,0.0016003888,0.00011664182,0.058887225,0.000392911,0.91593647],"study_design_scores_gemma":[0.00032172762,0.0001288927,0.00018251539,0.00040961592,0.0000063508446,0.0000174753,0.0000011969458,0.8754073,0.0011095395,0.08804908,0.033508193,0.00085812574],"about_ca_topic_score_codex":0.000030244673,"about_ca_topic_score_gemma":0.000058111225,"teacher_disagreement_score":0.92959,"about_ca_system_score_codex":0.0002336324,"about_ca_system_score_gemma":0.000244619,"threshold_uncertainty_score":0.9999772},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000584796,0.00023244803,0.9948305,0.0019212497,0.0008518997,0.00035261372,0.000010480958,0.00036414937,0.0013781763],"genre_scores_gemma":[0.09316877,0.0006905004,0.8976689,0.006665613,0.00067750824,0.000091742084,0.00018356394,0.00006929324,0.0007841096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770945,0.000078774974,0.00047078545,0.00055488985,0.0007506577,0.00043546574],"domain_scores_gemma":[0.9965626,0.00076132634,0.0002693792,0.002002882,0.00026504832,0.00013878109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012095992,0.00030958658,0.00030005435,0.0009749811,0.00033292585,0.00090732466,0.0038328157,0.00021840866,0.0000029423802],"category_scores_gemma":[0.00023121355,0.00031008627,0.000059713966,0.0015555578,0.0007887918,0.002355794,0.003134196,0.0008012824,0.00013517583],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037143536,0.000033202028,0.00005242875,0.00013297016,0.000009428955,0.000012948558,0.0051993644,0.006122912,0.0000804186,0.017622184,0.0008745295,0.9698559],"study_design_scores_gemma":[0.0001934985,0.00006874005,0.0002286095,0.00021230543,0.000004408742,0.000032360098,4.658834e-7,0.7832306,0.00017025838,0.21155,0.0039259493,0.0003828186],"about_ca_topic_score_codex":0.0000426274,"about_ca_topic_score_gemma":0.000101166035,"teacher_disagreement_score":0.96947306,"about_ca_system_score_codex":0.0004450854,"about_ca_system_score_gemma":0.0010387838,"threshold_uncertainty_score":0.99993515},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002315045,0.000071035516,0.99721104,0.00011571601,0.00085398165,0.00015753732,3.3528855e-7,0.0003328876,0.001025964],"genre_scores_gemma":[0.9656907,0.000009973629,0.033759173,0.00011487845,0.00019615689,0.0000030509457,0.000026206704,0.00004812058,0.00015178091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881464,0.000010639734,0.00023428832,0.00038786436,0.0003446449,0.00020793334],"domain_scores_gemma":[0.9993738,0.00024167061,0.000051971885,0.0002224216,0.00004486679,0.000065255736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025065176,0.00021997304,0.00019466414,0.000515735,0.00010843244,0.00016534836,0.00017731443,0.00018367697,0.00002122823],"category_scores_gemma":[0.000052980522,0.00021841051,0.000034268953,0.0002563982,0.000098690405,0.00015544998,0.0000622798,0.00038585186,0.000051187006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012379068,0.0000014359251,0.00003904317,0.000030955805,0.0000017929392,0.000009480032,0.00009080246,0.84473765,0.00003773474,0.0008559973,0.0000076213605,0.15418623],"study_design_scores_gemma":[0.0001051224,0.00003214348,0.0021395897,0.0001073459,0.0000048274374,0.000006982253,7.085669e-8,0.9838001,0.0000560245,0.013452862,0.00006629142,0.00022862558],"about_ca_topic_score_codex":0.000008964501,"about_ca_topic_score_gemma":0.000024698422,"teacher_disagreement_score":0.96545917,"about_ca_system_score_codex":0.00014203122,"about_ca_system_score_gemma":0.000047413352,"threshold_uncertainty_score":0.8906522},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046874375,0.00024406506,0.99364114,0.00053510844,0.0020877153,0.00032443597,0.0000013051354,0.00058750005,0.0025318654],"genre_scores_gemma":[0.00039326004,0.00012263868,0.9967106,0.0006704627,0.00022014073,0.00007260531,0.000014881975,0.000038194634,0.0017571887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995321,0.00014003497,0.0008171625,0.0016970542,0.001160652,0.0008641142],"domain_scores_gemma":[0.9975193,0.00031275098,0.0003075065,0.0015424911,0.00018234763,0.00013560668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031156647,0.00049557135,0.0005156215,0.0032215656,0.0001696382,0.00040690025,0.004760279,0.00040360348,0.000013198286],"category_scores_gemma":[0.00023399125,0.00047813836,0.00007159301,0.0053127096,0.00037328948,0.00070046395,0.0018248714,0.0009766227,0.0000776764],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002063448,0.000027224882,0.000029124778,0.00002078415,0.0000027779781,0.000035629848,0.0010084728,0.00085513794,0.00004829286,0.0021806692,0.0001385773,0.99565125],"study_design_scores_gemma":[0.000662645,0.0004715268,0.009375476,0.00216943,0.000009250043,0.00013204904,7.2293955e-7,0.557175,0.06728665,0.2335389,0.12565604,0.003522355],"about_ca_topic_score_codex":0.000010528635,"about_ca_topic_score_gemma":0.00016938518,"teacher_disagreement_score":0.9921289,"about_ca_system_score_codex":0.0019836542,"about_ca_system_score_gemma":0.0015538952,"threshold_uncertainty_score":0.999767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023659304,0.00012142151,0.9924569,0.0014092239,0.0020742128,0.0016401986,0.000030276682,0.0002579622,0.0019861262],"genre_scores_gemma":[0.5316175,0.000032318552,0.45969614,0.0056428513,0.000623223,0.00034868147,0.000010764109,0.00015750958,0.0018709886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519825,0.000052841307,0.0007496092,0.0017871964,0.0013509836,0.00086112646],"domain_scores_gemma":[0.9939951,0.003233888,0.00036931297,0.001997054,0.0002651553,0.00013952122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021010155,0.00064663694,0.0006001974,0.0006287374,0.00044808077,0.00076608773,0.0049393196,0.00027010037,0.0000053831677],"category_scores_gemma":[0.00017723412,0.00044967342,0.0002046897,0.00043697108,0.00041171248,0.00035733936,0.0014488692,0.00070244656,0.00006356306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016240147,0.00002793758,0.0000015805226,0.00008395007,0.000023032793,0.000055766905,0.0011096362,0.5375957,0.000031370142,0.3033331,0.000070869246,0.15765081],"study_design_scores_gemma":[0.00021056888,0.00015493954,8.4893554e-7,0.0004617094,0.0000059541026,0.000019363693,1.5569822e-7,0.6363477,0.00006804291,0.36218852,0.00020822369,0.00033396517],"about_ca_topic_score_codex":0.000015408626,"about_ca_topic_score_gemma":0.000049599083,"teacher_disagreement_score":0.53276074,"about_ca_system_score_codex":0.0005201284,"about_ca_system_score_gemma":0.00038729084,"threshold_uncertainty_score":0.9997955},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004805922,0.00004483309,0.99005604,0.0008808074,0.0013691455,0.00050637504,0.00007357197,0.00090540346,0.0013579134],"genre_scores_gemma":[0.95423955,0.0000611034,0.04332433,0.00034852952,0.0006115127,0.000023685854,0.00037251684,0.00007959955,0.0009391537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943525,0.00012302326,0.0005904379,0.0024491008,0.0016394227,0.0008454726],"domain_scores_gemma":[0.99609786,0.000542984,0.0004053124,0.0023493513,0.0003668181,0.00023766418],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001592276,0.0005897666,0.00049361336,0.0006062041,0.001093595,0.0009708217,0.0038322366,0.00033055508,0.00001278706],"category_scores_gemma":[0.00029386947,0.0005067359,0.000056435387,0.0012783956,0.0005060804,0.0011484278,0.0020976132,0.0025372882,0.00010846787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033874636,0.000063321255,0.038982622,0.00021810377,0.000054701286,0.00022639812,0.0006913917,0.30073595,0.000024511157,0.008350422,0.000072853385,0.65054584],"study_design_scores_gemma":[0.00020945596,0.0006422388,0.0452704,0.00078800926,0.000011356015,0.000043948843,1.7330794e-7,0.94946533,0.000049027523,0.0023632366,0.0006360818,0.00052073],"about_ca_topic_score_codex":0.00021785694,"about_ca_topic_score_gemma":0.00030164563,"teacher_disagreement_score":0.9494336,"about_ca_system_score_codex":0.00040238583,"about_ca_system_score_gemma":0.00079176575,"threshold_uncertainty_score":0.9997639},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015853572,0.00021054978,0.99354273,0.0019208882,0.0016475572,0.00083621236,0.00004166358,0.00036962834,0.0012722238],"genre_scores_gemma":[0.42268246,0.0003133812,0.56432074,0.0067674546,0.0035028092,0.00025211793,0.00010238554,0.00026523156,0.0017933949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959369,0.000038326187,0.00054450455,0.0018319057,0.0008955614,0.0007528137],"domain_scores_gemma":[0.99621284,0.0014895363,0.00030500855,0.001524053,0.00024068909,0.0002278468],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011078061,0.00047573904,0.00054010504,0.0008280767,0.000426558,0.0017763737,0.0043235533,0.0002805985,0.000010069436],"category_scores_gemma":[0.00068879215,0.0004640032,0.000085872154,0.00092832174,0.0010262955,0.0010424386,0.0047085932,0.00087206945,0.000066723755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010567567,0.000059975097,0.00011182718,0.00018447421,0.000035245128,0.00030506976,0.0012539482,0.023843054,0.00008812585,0.33527693,0.0001933015,0.6386375],"study_design_scores_gemma":[0.00041243635,0.00007577958,0.00032211537,0.00037821248,0.000011506607,0.00008090123,1.140309e-7,0.59817165,0.0000365289,0.39870036,0.0012410296,0.0005693797],"about_ca_topic_score_codex":0.000041660598,"about_ca_topic_score_gemma":0.00038926292,"teacher_disagreement_score":0.6380681,"about_ca_system_score_codex":0.00022689244,"about_ca_system_score_gemma":0.000539232,"threshold_uncertainty_score":0.9997812},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005204561,0.00005795414,0.9931044,0.00018028001,0.0008556076,0.00014253607,0.0000067841934,0.0007143177,0.004417674],"genre_scores_gemma":[0.9413282,0.00006242818,0.054435972,0.00046138518,0.00052475394,0.00001949822,0.00012824697,0.00011170326,0.002927757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986811,0.000004936998,0.00036016016,0.00038941656,0.00031359223,0.0002507871],"domain_scores_gemma":[0.99936223,0.00013937216,0.000054415985,0.00027440357,0.00011788857,0.000051699288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002983622,0.00020691946,0.00019831031,0.00047369773,0.00014442009,0.00010397482,0.00027359658,0.00015667618,0.000025503465],"category_scores_gemma":[0.00004079258,0.00022448336,0.000052963725,0.0004864102,0.00016405203,0.0001241979,0.000036749512,0.0006681439,0.000059181963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.630792e-7,0.0000031067823,0.000056095578,0.00003991863,0.000006234055,0.000024652933,0.0005210418,0.89807636,0.00042470565,0.003109524,0.00002230414,0.09771511],"study_design_scores_gemma":[0.00019953218,0.00004058634,0.00072043977,0.00055063394,0.000014722639,0.000020134763,0.0000011227307,0.97492576,0.0012551202,0.017347127,0.0043884404,0.0005363643],"about_ca_topic_score_codex":0.000009324635,"about_ca_topic_score_gemma":0.000105135274,"teacher_disagreement_score":0.9408078,"about_ca_system_score_codex":0.00011137745,"about_ca_system_score_gemma":0.000076963435,"threshold_uncertainty_score":0.91541654},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020270757,0.00023103124,0.99626094,0.0004908294,0.0011549201,0.0003498637,0.0000013241053,0.00030963492,0.0011994157],"genre_scores_gemma":[0.00038835526,0.00050262676,0.98976517,0.00023253405,0.00028573832,0.000016182552,0.000014607342,0.000045085293,0.008749687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613106,0.00013696984,0.00045784135,0.0014089767,0.0012382988,0.0006268391],"domain_scores_gemma":[0.9975572,0.0009671587,0.0001962737,0.00069761823,0.00036438424,0.00021736193],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017238262,0.00034611498,0.00039426086,0.0014106549,0.00030239703,0.0010453127,0.0020339666,0.00023137612,0.00002806501],"category_scores_gemma":[0.00090654724,0.00033189775,0.000052466286,0.0022310058,0.00051150133,0.0004508411,0.0022607858,0.00095902965,0.000076092045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0175136e-7,0.000007291692,0.00001662021,0.00002531435,0.0000038216635,0.000030244602,0.00028510962,0.6544293,0.0000018634704,0.00047186823,0.00003973501,0.344688],"study_design_scores_gemma":[0.000111802845,0.00010832198,0.000014465493,0.00014145242,0.0000029739267,0.000026154199,2.3544506e-7,0.98726916,0.00008107969,0.011138272,0.0007802168,0.00032589227],"about_ca_topic_score_codex":0.0000067806136,"about_ca_topic_score_gemma":0.0000062564673,"teacher_disagreement_score":0.3443621,"about_ca_system_score_codex":0.0003462119,"about_ca_system_score_gemma":0.0010268169,"threshold_uncertainty_score":0.9999917},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012471316,0.00032163184,0.9922948,0.003140913,0.0014440407,0.0010353647,0.000053062653,0.00024063335,0.00022240703],"genre_scores_gemma":[0.8699223,0.00051205844,0.12341808,0.0019282755,0.0015385678,0.00007948047,0.000009079821,0.00014101085,0.002451175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99447197,0.00008166513,0.0007029896,0.0018723455,0.0014765525,0.0013944821],"domain_scores_gemma":[0.991965,0.0055326945,0.0002029392,0.0015827081,0.00048556406,0.00023110033],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028196138,0.0005821102,0.00063580717,0.00046579525,0.0012270574,0.0016464946,0.00518603,0.0002545978,0.000018220273],"category_scores_gemma":[0.00027271887,0.00042094314,0.00017077301,0.0008173275,0.0018178007,0.0005476315,0.0030863807,0.0012314013,0.000102445985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002069357,0.000031867687,0.0008929744,0.00008451247,0.000030512767,0.000046889825,0.0052460674,0.06711286,0.00005339321,0.0068605435,0.000015492571,0.9196042],"study_design_scores_gemma":[0.00019564792,0.00043548326,0.0009541695,0.00084538414,0.000016202588,0.00005481026,0.0000355465,0.97546226,0.0032077122,0.017219586,0.0007906071,0.00078259106],"about_ca_topic_score_codex":0.00039790297,"about_ca_topic_score_gemma":0.001726947,"teacher_disagreement_score":0.9188216,"about_ca_system_score_codex":0.00020215349,"about_ca_system_score_gemma":0.0004646497,"threshold_uncertainty_score":0.9998242},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010148869,0.00012522883,0.9915702,0.0005930985,0.0021897082,0.000534104,0.00005405469,0.0020441778,0.0028793092],"genre_scores_gemma":[0.003620734,0.00009688181,0.9926985,0.0009178701,0.00037515312,0.00003326097,0.000027418495,0.000088047826,0.0021421707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994362,0.00004730035,0.0006993797,0.0024989045,0.0013839765,0.0010084712],"domain_scores_gemma":[0.99505085,0.00070764066,0.00037386967,0.0033577743,0.00024525015,0.00026464547],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013650474,0.00076715846,0.00070877554,0.0013824056,0.00027111455,0.0008656302,0.008683247,0.00051014154,0.000017765178],"category_scores_gemma":[0.00028168122,0.000719053,0.00018165012,0.0010315353,0.0009662092,0.0009239221,0.0049685426,0.001159888,0.0003001711],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006493404,0.0000657144,0.0000701535,0.00004557212,0.000032355474,0.00044831014,0.0010805117,0.008113429,0.00023245497,0.018904874,0.0009447473,0.9700554],"study_design_scores_gemma":[0.00046111055,0.00030692585,0.00020435586,0.00088841084,0.000016465783,0.000109491615,1.5732084e-7,0.88437843,0.0014146331,0.10578649,0.0050460137,0.0013875137],"about_ca_topic_score_codex":0.000043068303,"about_ca_topic_score_gemma":0.000052409512,"teacher_disagreement_score":0.96866786,"about_ca_system_score_codex":0.0003264003,"about_ca_system_score_gemma":0.00062676636,"threshold_uncertainty_score":0.9995261},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024597826,0.00006168049,0.99380034,0.00020099067,0.0016217255,0.0005156033,0.0000014451666,0.00014191968,0.001196511],"genre_scores_gemma":[0.86041445,0.000107386455,0.13528991,0.0006288311,0.00057997403,0.00006459368,0.000010746014,0.000091524984,0.0028125634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960647,0.000077636556,0.00074128667,0.00088826177,0.0015413637,0.00068672816],"domain_scores_gemma":[0.9968283,0.0009694513,0.0008196232,0.0009034905,0.00039298713,0.00008612705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023771652,0.0003638296,0.00041488753,0.0006393096,0.00055069855,0.00044711807,0.0027750067,0.00025243592,0.00001981711],"category_scores_gemma":[0.00047234417,0.0003065933,0.00014638495,0.00078703207,0.0003111484,0.0006357455,0.0015492648,0.00082871766,0.00007163629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030875383,0.000016677024,0.0006984904,0.000027330316,0.000020341535,0.000053760672,0.0035670083,0.7786071,0.00074367743,0.024944182,0.000009256164,0.19130912],"study_design_scores_gemma":[0.00007142195,0.00011712795,0.0002159552,0.00037676844,0.000019795469,0.000010361429,0.000005220057,0.97045255,0.007383419,0.020650903,0.00030345455,0.0003930068],"about_ca_topic_score_codex":0.00013964598,"about_ca_topic_score_gemma":0.000060463164,"teacher_disagreement_score":0.85851043,"about_ca_system_score_codex":0.00073270826,"about_ca_system_score_gemma":0.00038646447,"threshold_uncertainty_score":0.9999386},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036602367,0.00020833396,0.9926757,0.0009213216,0.0014466762,0.0005908966,0.000007034191,0.00019006665,0.00029970068],"genre_scores_gemma":[0.7807737,0.00042491843,0.21182372,0.0027709857,0.0020403462,0.000029438828,0.000048479124,0.00037856816,0.0017098346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644226,0.000041114028,0.00073437643,0.0012595129,0.0007876338,0.0007351163],"domain_scores_gemma":[0.99768037,0.00085663673,0.0003903108,0.00044514047,0.00032073987,0.00030680955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016419548,0.0004700619,0.00087583094,0.00057745446,0.00036869117,0.00014383161,0.00041631225,0.00026644033,0.000047916983],"category_scores_gemma":[0.00030484397,0.00036928023,0.00019653385,0.00034290683,0.0008154442,0.0001765772,0.0003106028,0.0020952197,0.000005652624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001243152,0.00003217253,0.0037108315,0.00018819518,0.000047579324,0.00025699224,0.00040884933,0.3303974,0.0006113979,0.00013774932,0.0000036151341,0.6640809],"study_design_scores_gemma":[0.0010168914,0.00017125852,0.00052060414,0.0036208946,0.00017017573,0.0007031611,0.0000016396879,0.99062985,0.00005218709,0.0025738792,0.000108825334,0.00043061588],"about_ca_topic_score_codex":0.00009225066,"about_ca_topic_score_gemma":0.000041354484,"teacher_disagreement_score":0.780852,"about_ca_system_score_codex":0.0003331359,"about_ca_system_score_gemma":0.0007410183,"threshold_uncertainty_score":0.9998759},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013294542,0.0004663115,0.9915832,0.0007053241,0.003984863,0.00023584925,0.0000021725348,0.0006836333,0.0022057015],"genre_scores_gemma":[0.13521852,0.00014261118,0.85184354,0.004031694,0.0021596102,0.000037704096,0.000015359621,0.00010547923,0.0064454717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959645,0.00004947539,0.00047322302,0.0015903289,0.0010340427,0.00088839553],"domain_scores_gemma":[0.9973509,0.0006943072,0.00015199593,0.0014725724,0.00019054636,0.000139695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091223,0.00044854174,0.0005507146,0.0007795719,0.00024030644,0.00057518925,0.0051971795,0.0003445184,0.0000056351855],"category_scores_gemma":[0.0002591119,0.00039588826,0.00013106804,0.0013340072,0.0008338222,0.00057354174,0.0021886835,0.00076758856,0.00020758124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035110352,0.000029428425,0.000054383803,0.00004212294,0.000016925876,0.00035383407,0.0031886604,0.5167589,0.00004543285,0.04154398,0.00066567305,0.43729714],"study_design_scores_gemma":[0.0001329682,0.00006140443,0.000018610472,0.00017973711,0.0000033652911,0.00002774113,6.49213e-7,0.8223388,0.0001293227,0.17630105,0.00039173162,0.000414623],"about_ca_topic_score_codex":0.000032513817,"about_ca_topic_score_gemma":0.000092267976,"teacher_disagreement_score":0.4368825,"about_ca_system_score_codex":0.00033528492,"about_ca_system_score_gemma":0.0015791919,"threshold_uncertainty_score":0.9998493},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003072902,0.006070654,0.61494607,0.12642536,0.008907145,0.0030921146,0.000046168105,0.00062349584,0.2368161],"genre_scores_gemma":[0.90111136,0.004422275,0.017934317,0.018067483,0.0051705907,0.000024826602,0.0000277208,0.00015587216,0.053085577],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979828,0.000048741145,0.0002922854,0.00046568108,0.0007880396,0.00042245063],"domain_scores_gemma":[0.9975889,0.0016425698,0.00018122212,0.00023138792,0.00019510443,0.00016086393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013423442,0.00019002434,0.00027709157,0.00014547276,0.0003898938,0.00051650096,0.00075097365,0.00038772685,0.000009387973],"category_scores_gemma":[0.0006530531,0.00014241693,0.00005080565,0.00042111118,0.002704338,0.00017083852,0.0002357442,0.00086156186,0.000004970346],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009076238,0.0000057371144,0.00025549426,0.0000252534,0.000011247733,0.00002182109,0.007786851,0.0014160903,0.000007247595,0.14408259,0.00045914663,0.84591943],"study_design_scores_gemma":[0.00060752936,0.0003418346,0.0013610177,0.0006382257,0.000036106576,0.000010693843,0.000034109027,0.008465898,0.00014086973,0.623412,0.36421207,0.00073964],"about_ca_topic_score_codex":0.00022766343,"about_ca_topic_score_gemma":0.0037723936,"teacher_disagreement_score":0.89803845,"about_ca_system_score_codex":0.000069475595,"about_ca_system_score_gemma":0.0011290606,"threshold_uncertainty_score":0.99642456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050153914,0.00016191415,0.99538714,0.0013241508,0.00061775284,0.00034683078,0.000025504858,0.00042572943,0.0016608274],"genre_scores_gemma":[0.1709061,0.00004048531,0.82448363,0.0034435918,0.00081139663,0.000025126363,0.00006422057,0.00007820972,0.00014725149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962999,0.000031263913,0.0003498487,0.0014840297,0.0011549918,0.0006799498],"domain_scores_gemma":[0.99735683,0.0005045273,0.00022907676,0.0014937189,0.00022979947,0.00018602604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006776957,0.000493581,0.0004061354,0.0016885252,0.0003201197,0.0007303808,0.0029812614,0.00033799888,0.000009662696],"category_scores_gemma":[0.00007432167,0.00040988857,0.00012249574,0.0020633992,0.0006505765,0.00079144986,0.0005603535,0.0008568237,0.00003799821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027120006,0.000057870508,0.00007302302,0.00008762543,0.000021044421,0.00019526054,0.00060363335,0.15922886,0.0001179499,0.49946958,0.00012632788,0.33999172],"study_design_scores_gemma":[0.00046900503,0.00034770562,0.00030278033,0.00044928456,0.00001070556,0.000025348612,1.5669275e-7,0.541011,0.0016086798,0.4523441,0.0025248805,0.00090640655],"about_ca_topic_score_codex":0.00009730874,"about_ca_topic_score_gemma":0.00045952428,"teacher_disagreement_score":0.38178208,"about_ca_system_score_codex":0.0001626717,"about_ca_system_score_gemma":0.0012201229,"threshold_uncertainty_score":0.9998353},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016897435,0.0009377184,0.90971893,0.009910875,0.04874778,0.0027670907,0.00007333359,0.00027034854,0.025884172],"genre_scores_gemma":[0.12395769,0.0014140559,0.43881318,0.036146984,0.080976576,0.0025360717,0.00158396,0.0006220468,0.31394944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811625,0.000028191029,0.00046653132,0.000639472,0.00028626964,0.0004633031],"domain_scores_gemma":[0.99828106,0.0007050452,0.00018280887,0.0004503663,0.00027303753,0.000107674394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064906076,0.00022991672,0.00026912446,0.0006015648,0.0004977209,0.000066121305,0.00047475222,0.00037717586,0.000046405326],"category_scores_gemma":[0.00017637917,0.00021638014,0.00006431109,0.0004109097,0.0001452362,0.00017768824,0.00011416673,0.00069981813,0.00019508218],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005990221,0.00009346111,0.00077386765,0.00019070467,0.0000056093513,0.0000017718121,0.007560268,0.0055879876,0.000009371341,0.023578124,0.0044564297,0.95773643],"study_design_scores_gemma":[0.000574247,0.00017761983,0.004383238,0.0029971462,0.000022064165,0.0000056383014,0.00004681729,0.011988853,0.000074349184,0.5879049,0.39064637,0.0011787998],"about_ca_topic_score_codex":0.000043741573,"about_ca_topic_score_gemma":0.0009891527,"teacher_disagreement_score":0.95655763,"about_ca_system_score_codex":0.00053216156,"about_ca_system_score_gemma":0.0029114992,"threshold_uncertainty_score":0.8823726},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007689279,0.000031912914,0.9947547,0.0018674964,0.0006152706,0.0012918292,0.000042226104,0.00013346216,0.00049423025],"genre_scores_gemma":[0.87836945,0.000025991616,0.120450765,0.0006338853,0.00020679031,0.00011074431,0.000014819582,0.000045655415,0.00014187876],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963133,0.00008319382,0.0005934065,0.0017163145,0.00065497647,0.00063883397],"domain_scores_gemma":[0.99475235,0.0035461895,0.00036099207,0.0008966533,0.00023466065,0.00020917466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009849997,0.0005513893,0.0006067924,0.00082178187,0.00040630443,0.0007885237,0.0013861965,0.00034935988,0.00000318459],"category_scores_gemma":[0.001088361,0.00049858005,0.00010286648,0.0010264025,0.0005576866,0.0012554865,0.0007689198,0.0010644883,0.000010380475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009952461,0.000076053395,0.0000064084616,0.000019895111,0.000025660867,0.000029168677,0.08703471,0.019664193,0.00004793301,0.24508558,0.000020704829,0.64789015],"study_design_scores_gemma":[0.00033384137,0.0008995333,0.0001639383,0.0007222038,0.0000034351347,0.000010965002,0.000022413951,0.24804504,0.0003649183,0.7488882,0.000056023033,0.00048948545],"about_ca_topic_score_codex":0.00004520896,"about_ca_topic_score_gemma":0.00010470977,"teacher_disagreement_score":0.87760055,"about_ca_system_score_codex":0.0004379777,"about_ca_system_score_gemma":0.00047012986,"threshold_uncertainty_score":0.99974656},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032138643,0.00016140813,0.99330765,0.0009733143,0.00020798248,0.00025348293,0.0000040294517,0.00030814754,0.0015701165],"genre_scores_gemma":[0.98391473,0.00001803702,0.012936824,0.0018175512,0.00073043973,0.000019788162,0.000105875064,0.00006582444,0.0003909073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679947,0.000009467122,0.0004999951,0.0014124425,0.00072713976,0.0005514788],"domain_scores_gemma":[0.99860114,0.00007338254,0.0003438346,0.0003896573,0.00054946414,0.000042496966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070849917,0.00048472933,0.0008071806,0.0018550847,0.00047439887,0.0010316615,0.0007574279,0.00022358903,0.000010443388],"category_scores_gemma":[0.00014633175,0.00043887668,0.0001441697,0.003573708,0.00023791513,0.000819367,0.0006993457,0.0006341243,0.000027912776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023481598,0.00002870509,0.0033382985,0.0009077006,0.00017554779,0.000027384882,0.0011279141,0.89599127,0.000019373421,0.0022093179,0.000008804923,0.09614222],"study_design_scores_gemma":[0.00018120291,0.000016695732,0.000168871,0.0004246436,0.00025946146,0.0000035124042,0.000010859304,0.98072505,0.000014596562,0.017068747,0.00044282246,0.0006835483],"about_ca_topic_score_codex":0.0009585245,"about_ca_topic_score_gemma":0.00033388502,"teacher_disagreement_score":0.9807009,"about_ca_system_score_codex":0.000059690585,"about_ca_system_score_gemma":0.00010433614,"threshold_uncertainty_score":0.9998063},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001269666,0.0001171303,0.9914746,0.00042196637,0.0019529533,0.00036628093,0.0000036842355,0.0019879052,0.0036627266],"genre_scores_gemma":[0.016062103,0.000099943296,0.9795529,0.0013675272,0.00061879604,0.000038665825,0.0000037285738,0.000104479324,0.0021518422],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576384,0.000026057276,0.0005610711,0.0018232709,0.0010500924,0.00077565823],"domain_scores_gemma":[0.9970414,0.0005209779,0.00032008073,0.0016668936,0.0002742462,0.00017642442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008243629,0.00054675346,0.000506536,0.0013070975,0.00030739006,0.0005006164,0.0034839457,0.00034193878,0.000015933765],"category_scores_gemma":[0.00020190162,0.00054856244,0.00014725707,0.001095458,0.00048726783,0.0010531401,0.0022030969,0.0010045234,0.00017339429],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024546928,0.0000092500295,0.000008760699,0.000029885357,0.0000060201096,0.00018107991,0.00027485762,0.0066563715,0.00034262709,0.02577355,0.000044953293,0.9666702],"study_design_scores_gemma":[0.00024440995,0.00025920063,0.00004297482,0.00067199377,0.000005975097,0.0001993714,2.7647758e-7,0.15482844,0.021437738,0.815313,0.0056604464,0.0013362175],"about_ca_topic_score_codex":0.000012689282,"about_ca_topic_score_gemma":0.00004410949,"teacher_disagreement_score":0.965334,"about_ca_system_score_codex":0.00034149765,"about_ca_system_score_gemma":0.0003027082,"threshold_uncertainty_score":0.9996966},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002323806,0.00018209705,0.988584,0.0006494243,0.0017080536,0.000488987,0.000054576933,0.00025195346,0.0057571265],"genre_scores_gemma":[0.89383125,0.00006855704,0.10275002,0.0022357965,0.00062594004,0.000033285563,0.000018017414,0.0000926094,0.00034452352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956946,0.00004037379,0.0005929503,0.0016442275,0.0012947306,0.0007331192],"domain_scores_gemma":[0.9948483,0.0019933805,0.0003537564,0.0024739362,0.00019777556,0.00013285711],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001708854,0.00049830816,0.00050345215,0.0005372742,0.00050104724,0.0006867219,0.005416425,0.00026857277,0.00006720322],"category_scores_gemma":[0.0004969177,0.00037681274,0.00022860375,0.0013987337,0.0006632236,0.00048733113,0.0030324915,0.001120553,0.000037705217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007412488,0.00017623063,0.0005579897,0.00041754602,0.00008939833,0.00032584713,0.0064699138,0.032346707,0.0018526814,0.70703846,0.00042752997,0.25022358],"study_design_scores_gemma":[0.00041934784,0.00065518497,0.0010433596,0.002538524,0.000018737963,0.00003683356,0.0000027337283,0.40298462,0.007564533,0.58161247,0.0018167357,0.0013069335],"about_ca_topic_score_codex":0.000057283665,"about_ca_topic_score_gemma":0.00018015878,"teacher_disagreement_score":0.89150745,"about_ca_system_score_codex":0.00013907904,"about_ca_system_score_gemma":0.00026071077,"threshold_uncertainty_score":0.9999648},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011913156,0.00021071672,0.9927704,0.0027596822,0.0018566085,0.00034961416,0.0000016223457,0.0006718372,0.0013676217],"genre_scores_gemma":[0.004393108,0.00017310512,0.9762028,0.016359389,0.0010015238,0.00007785381,0.000020182064,0.00008664681,0.0016854258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99399364,0.00011672893,0.0007450005,0.0016245617,0.0026504488,0.0008696027],"domain_scores_gemma":[0.9970866,0.0010772084,0.00020163057,0.0011553171,0.00014174014,0.0003375385],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002796317,0.00041254127,0.0005120443,0.0017003176,0.00010907618,0.000493781,0.0059789354,0.00031334674,0.00010476751],"category_scores_gemma":[0.0009597799,0.0003857585,0.000090224676,0.0026466197,0.0009201056,0.0007791005,0.0026685675,0.0014365434,0.00015666285],"study_design_candidate":"design_other","study_design_consensus":null,"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.416523e-7,0.00002449291,0.00011301912,0.000035110716,0.0000018145793,0.0008262239,0.00040316244,0.0002508768,0.000037993537,0.00034919457,0.0010678009,0.9968895],"study_design_scores_gemma":[0.00027146764,0.00003536709,0.0003270875,0.0009239358,0.0000016930092,0.00008019479,2.2220624e-7,0.92567974,0.0011475453,0.07072305,0.00032302484,0.000486667],"about_ca_topic_score_codex":0.00003477894,"about_ca_topic_score_gemma":0.000099211,"teacher_disagreement_score":0.9964028,"about_ca_system_score_codex":0.0006776715,"about_ca_system_score_gemma":0.0025100135,"threshold_uncertainty_score":0.99985945},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005392125,0.0002855592,0.9939119,0.0011271863,0.0023403526,0.00036533328,0.0000076190126,0.0006535398,0.00076928246],"genre_scores_gemma":[0.31104037,0.00005715949,0.6840408,0.002728715,0.000544327,0.000018511946,0.000008899051,0.00008185048,0.0014793691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99538285,0.0000436638,0.000508721,0.0019627085,0.001085981,0.0010160584],"domain_scores_gemma":[0.9971786,0.0007396314,0.00024702944,0.0013945112,0.00022226303,0.00021798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056767435,0.000693262,0.000729926,0.000652613,0.00030491053,0.00064501836,0.0039090365,0.00038843206,0.000011661598],"category_scores_gemma":[0.0001433962,0.0005227158,0.0001497481,0.0007942537,0.0015294219,0.00067813584,0.0015392869,0.0009974106,0.000056518507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028378001,0.00007032168,0.000927338,0.00007968112,0.000051364295,0.002238433,0.003014676,0.12747209,0.0002620989,0.024948567,0.00008712893,0.8408199],"study_design_scores_gemma":[0.0008860596,0.0005661213,0.003884401,0.0006054846,0.000017698972,0.00034308975,0.0000035277842,0.9685429,0.0011139269,0.021968335,0.00043087328,0.001637604],"about_ca_topic_score_codex":0.00008955746,"about_ca_topic_score_gemma":0.0004158481,"teacher_disagreement_score":0.8410708,"about_ca_system_score_codex":0.0001776869,"about_ca_system_score_gemma":0.00042747354,"threshold_uncertainty_score":0.9997224},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009498692,0.0024586227,0.9946213,0.0009904522,0.0008870408,0.0005915377,0.000010108962,0.0002761358,0.00006985191],"genre_scores_gemma":[0.25794494,0.000029999252,0.74117666,0.00034241224,0.00033554636,0.000025660629,0.00003621873,0.000031503907,0.00007708467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976615,0.00005450413,0.00052281003,0.00079043483,0.0006556424,0.00031515566],"domain_scores_gemma":[0.9979776,0.0005203363,0.0003583383,0.00073081045,0.00037393457,0.000038987775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011312398,0.0003125597,0.00032838702,0.00048724754,0.0002808874,0.0006375927,0.0016088749,0.00022370092,0.0000013262228],"category_scores_gemma":[0.000096390475,0.0002316623,0.00011427914,0.0004978104,0.00035788256,0.001526357,0.0002739396,0.00034084576,4.8057694e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002361923,0.000008085889,0.0000060599186,0.000099043245,0.000005846174,0.0000024423507,0.001396462,0.29876852,0.0019235647,0.054753117,0.000011552992,0.64302295],"study_design_scores_gemma":[0.00006371791,0.00003810508,0.0000034760274,0.000105079605,0.000006416403,0.0000067184237,1.6745174e-7,0.70710087,0.005517203,0.2869654,0.000013230461,0.00017961205],"about_ca_topic_score_codex":0.000074363874,"about_ca_topic_score_gemma":0.00017071434,"teacher_disagreement_score":0.6428433,"about_ca_system_score_codex":0.00012972075,"about_ca_system_score_gemma":0.00026960034,"threshold_uncertainty_score":0.9446915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023913833,0.0010045525,0.99458903,0.0009622214,0.0020816626,0.0007496675,0.000010220579,0.00029422416,0.000069274254],"genre_scores_gemma":[0.05174882,0.000070893264,0.94480765,0.0021306404,0.00083994394,0.000036504418,0.000010424302,0.00009960959,0.00025552048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954425,0.00004425138,0.0005705104,0.0021149288,0.0006576673,0.0011701201],"domain_scores_gemma":[0.996384,0.0015138277,0.0004759471,0.0011740901,0.00021806001,0.00023402435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006963266,0.00068799045,0.0007995027,0.0005650941,0.000536541,0.00036965887,0.0021365834,0.0004661168,0.0000018180144],"category_scores_gemma":[0.000118152035,0.0005974697,0.00017972563,0.0010100815,0.001117624,0.00052195083,0.0010773321,0.0007834692,0.000003068788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081996586,0.000023416513,0.00053555204,0.00014459217,0.000021256044,0.00029222405,0.00045060547,0.481383,0.00009927823,0.043075405,0.00014101104,0.47375166],"study_design_scores_gemma":[0.00035724876,0.0001456904,0.000050020288,0.000894054,0.0000094167335,0.000052575757,7.265527e-8,0.7116182,0.000105716535,0.28552008,0.00073073065,0.0005162009],"about_ca_topic_score_codex":0.000010708343,"about_ca_topic_score_gemma":0.00019588902,"teacher_disagreement_score":0.47323546,"about_ca_system_score_codex":0.00022831316,"about_ca_system_score_gemma":0.00032558298,"threshold_uncertainty_score":0.9996477},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000096149015,0.00004385937,0.9934762,0.0019216996,0.0014542865,0.0006620311,0.0000038961066,0.0010168408,0.0014115452],"genre_scores_gemma":[0.0094842715,0.000034688077,0.9872373,0.0012239694,0.0005974554,0.00007358318,0.000015423735,0.000058918165,0.0012744091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957921,0.00008527322,0.0006556257,0.0018793121,0.0008894772,0.00069821783],"domain_scores_gemma":[0.9967689,0.0005027944,0.00040389103,0.0017416079,0.00038494985,0.00019789278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016312106,0.00058222155,0.0005599596,0.0010988786,0.0005572669,0.0006594087,0.0030280028,0.00047803583,0.000030067604],"category_scores_gemma":[0.00003740353,0.00054296927,0.00020818306,0.0012995757,0.000445243,0.00084399513,0.0019950422,0.00088966975,0.00013238024],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035987407,0.00002328554,0.0000011463753,0.000031460208,0.000008443644,0.000013508807,0.00017628098,0.02207128,0.00065038505,0.03376808,0.00017535107,0.9430772],"study_design_scores_gemma":[0.000115388284,0.00024135111,0.000043355252,0.000191424,0.0000052667992,0.000026686586,1.6773691e-7,0.6915249,0.008040019,0.28892514,0.010345853,0.0005404451],"about_ca_topic_score_codex":0.00010504781,"about_ca_topic_score_gemma":0.00002221284,"teacher_disagreement_score":0.9425367,"about_ca_system_score_codex":0.00055484957,"about_ca_system_score_gemma":0.00038152598,"threshold_uncertainty_score":0.99970216},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101923695,0.00028659252,0.99261415,0.0010981502,0.00258257,0.0006472085,0.000009389855,0.0013304049,0.001329633],"genre_scores_gemma":[0.081973225,0.00088577025,0.9114462,0.0020563523,0.001173403,0.00007846414,0.00009159145,0.00027953627,0.0020154403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99399537,0.00012203413,0.0008564974,0.0025277215,0.0013175216,0.0011808635],"domain_scores_gemma":[0.99716765,0.0006031389,0.00035950434,0.0014548369,0.00023055384,0.00018429036],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0009224504,0.000825831,0.0007950174,0.00138802,0.00039560208,0.00048344975,0.0036643837,0.00069892075,0.00002053992],"category_scores_gemma":[0.00009997057,0.00081584766,0.00023889195,0.0028792291,0.00048564846,0.0014804379,0.00188376,0.0025630896,0.00014606882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009281464,0.000028298977,0.00009238189,0.000056428067,0.000021614529,0.00050867285,0.0014153523,0.48040324,0.000064641485,0.0043120137,0.000020766769,0.5130673],"study_design_scores_gemma":[0.0003574425,0.00020418226,0.00032354254,0.00054531894,0.000008512813,0.000083050254,3.0235447e-7,0.8277793,0.000045955258,0.16967298,0.00034093834,0.0006385009],"about_ca_topic_score_codex":0.000031317948,"about_ca_topic_score_gemma":0.00010630512,"teacher_disagreement_score":0.5124288,"about_ca_system_score_codex":0.00046869606,"about_ca_system_score_gemma":0.00045489392,"threshold_uncertainty_score":0.99973804},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000115014955,0.0008598879,0.98943585,0.005130974,0.0025888418,0.0006343731,0.00004394488,0.0006816094,0.00050950464],"genre_scores_gemma":[0.09578497,0.000321807,0.89635926,0.003691166,0.00072932104,0.000043017873,0.00016990479,0.00011894519,0.0027816133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99165446,0.0003605803,0.001254389,0.0035498473,0.0020582906,0.0011224265],"domain_scores_gemma":[0.99300224,0.0016216524,0.0010763464,0.0034113105,0.0004511419,0.00043730033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002270109,0.0007473516,0.0012186379,0.0029117696,0.00068071304,0.00066803227,0.0047701625,0.00041644752,0.000024607834],"category_scores_gemma":[0.00030911155,0.0007624926,0.0004213423,0.005539252,0.00055227027,0.00064098975,0.0016381281,0.0017458365,0.00010183223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022388147,0.000047008405,0.004426037,0.0001580081,0.00019145422,0.00013246515,0.0072265216,0.11789749,0.000028307124,0.0034406532,0.00014939881,0.86628026],"study_design_scores_gemma":[0.00037435384,0.000121822246,0.011998364,0.0005378793,0.000049203252,0.0000062867275,0.0000012953589,0.88068634,0.00006934037,0.10458274,0.00060582464,0.0009665182],"about_ca_topic_score_codex":0.004514585,"about_ca_topic_score_gemma":0.009767142,"teacher_disagreement_score":0.86531377,"about_ca_system_score_codex":0.0007351221,"about_ca_system_score_gemma":0.0008980138,"threshold_uncertainty_score":0.99948263},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017516071,0.00046324747,0.97775626,0.00036486844,0.00061821414,0.002560448,0.000060137463,0.00026147306,0.00039926608],"genre_scores_gemma":[0.9843457,0.00015010845,0.008914258,0.00028104917,0.00057743595,0.00007894232,0.0007200017,0.0001049345,0.0048276205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966857,0.000048957674,0.00031596937,0.0011406414,0.0011605466,0.0006481893],"domain_scores_gemma":[0.9980769,0.00034106575,0.00025826765,0.0002444308,0.0007891654,0.0002901632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005379104,0.0004847471,0.00046800205,0.0007436404,0.0005619099,0.00018640835,0.00021435639,0.00029124855,0.00004693262],"category_scores_gemma":[0.00037016068,0.0003858725,0.00012850286,0.00044805394,0.00054053427,0.00032829616,0.00020526993,0.0019546985,0.00002277786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017478659,0.00012531626,0.16461597,0.0008159288,0.00036366665,0.000263118,0.0017966173,0.12638363,0.0006709608,0.00007994566,0.000048551272,0.7030884],"study_design_scores_gemma":[0.0031399524,0.0026834835,0.20210214,0.0043104966,0.0005436769,0.000076973105,0.000009190412,0.78449357,0.0009652057,0.00052893546,0.00054542813,0.00060096214],"about_ca_topic_score_codex":0.0000048585825,"about_ca_topic_score_gemma":0.000016330625,"teacher_disagreement_score":0.968842,"about_ca_system_score_codex":0.00019017649,"about_ca_system_score_gemma":0.0006311184,"threshold_uncertainty_score":0.99985933},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043852633,0.000016340064,0.9977968,0.000097098215,0.0004247564,0.0005205212,0.00007387115,0.00008372411,0.0009430904],"genre_scores_gemma":[0.011724801,0.0000047539656,0.9871773,0.00009882216,0.00019682618,0.00002040716,0.0000052730093,0.000041128373,0.00073070393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980908,0.000023874718,0.0005149649,0.0005629399,0.00054157124,0.00026583273],"domain_scores_gemma":[0.9974056,0.0015577353,0.00013195955,0.00042798306,0.00039247185,0.00008423608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013559425,0.0002165573,0.00042734362,0.0003249593,0.00007337385,0.000039731716,0.00044501704,0.0001719369,0.000029019679],"category_scores_gemma":[0.0026642012,0.00018405328,0.000085683016,0.00021661988,0.00014140083,0.000037592356,0.00018940719,0.00022649944,0.000016430748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004279825,0.00003257978,0.000003954952,0.0002872466,0.000030249592,0.0000054124835,0.000514604,0.2640441,0.00078736624,0.070468165,0.00011045923,0.66367304],"study_design_scores_gemma":[0.00005641563,0.000107632586,0.0000025083054,0.00037330622,0.000011378136,0.0000013286048,5.3915155e-8,0.5250666,0.00029964914,0.47396025,0.000025397288,0.000095468866],"about_ca_topic_score_codex":0.000007729316,"about_ca_topic_score_gemma":0.0000075092694,"teacher_disagreement_score":0.66357756,"about_ca_system_score_codex":0.00008623101,"about_ca_system_score_gemma":0.00014800542,"threshold_uncertainty_score":0.7505475},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028488985,0.00014377358,0.993363,0.002051808,0.0018178133,0.0006856731,0.0000035238313,0.0015045562,0.00040134814],"genre_scores_gemma":[0.0073704277,0.00006868463,0.9778801,0.00038519237,0.00024836222,0.0000677395,0.00002866888,0.000055861175,0.013894955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691826,0.000026867314,0.00042946546,0.0014058861,0.0006503625,0.00056914886],"domain_scores_gemma":[0.9979057,0.00046318775,0.0004231874,0.0007118353,0.00041457015,0.00008154447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078977685,0.0004376589,0.00038361643,0.0010659267,0.0005343476,0.00062119914,0.0020795527,0.0005967399,0.0000048686366],"category_scores_gemma":[0.00046578725,0.00041781386,0.00009188943,0.001115969,0.00031293827,0.00073373807,0.00070126966,0.0009838364,0.00008100412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005448659,0.00003163635,0.00018622952,0.000037557857,0.000012944407,0.0000039695665,0.0002996626,0.013352666,0.00057524734,0.077373914,0.0004689211,0.9076518],"study_design_scores_gemma":[0.0005589723,0.00017434207,0.00012201678,0.00014078527,0.000008000329,0.000014206928,4.1402797e-7,0.9268362,0.0010153328,0.068239056,0.0024434165,0.0004472686],"about_ca_topic_score_codex":0.000009326142,"about_ca_topic_score_gemma":0.000055550612,"teacher_disagreement_score":0.9134835,"about_ca_system_score_codex":0.00035276127,"about_ca_system_score_gemma":0.00030653816,"threshold_uncertainty_score":0.9998274},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000104084116,0.00053832016,0.99439245,0.00017935317,0.0023932043,0.0006096909,0.000004846729,0.0014271666,0.00035085992],"genre_scores_gemma":[0.0865906,0.00006794404,0.90973526,0.0008427667,0.0016116033,0.000028610524,0.000025527921,0.00009040731,0.0010072906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542254,0.00015245099,0.00073484756,0.0018879347,0.0010259879,0.0007762422],"domain_scores_gemma":[0.9969658,0.00080650515,0.00032272007,0.001357582,0.00033331572,0.00021406035],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012705319,0.0006231237,0.0006911253,0.001475715,0.00037739825,0.0012287198,0.002604009,0.0004363481,0.0000012158073],"category_scores_gemma":[0.00011536887,0.00058503903,0.00010575251,0.0013321906,0.00035077517,0.0003268263,0.0019200016,0.00087359117,0.000022462917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002565368,0.000012917141,0.0000081233775,0.00006670498,0.000008475653,0.000027963586,0.00058576395,0.9063475,0.0000020495681,0.0006437143,0.00016203207,0.09213219],"study_design_scores_gemma":[0.00020544083,0.000119692166,0.00001367942,0.00051544845,0.0000063039156,0.000040635437,1.1701103e-7,0.9665239,0.000016542577,0.031706396,0.00023786897,0.00061401946],"about_ca_topic_score_codex":0.000031512438,"about_ca_topic_score_gemma":0.000014204889,"teacher_disagreement_score":0.09151817,"about_ca_system_score_codex":0.00031872332,"about_ca_system_score_gemma":0.0007012235,"threshold_uncertainty_score":0.9998081},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007254623,0.00003687807,0.99531126,0.0003905491,0.0010269429,0.00050271436,0.000017196724,0.00029103874,0.0016979629],"genre_scores_gemma":[0.42172515,0.000110834124,0.5748635,0.0023283556,0.00035171656,0.000075909884,0.00029124913,0.00004950432,0.00020381212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973409,0.00003357173,0.00058430666,0.0006757926,0.0010111106,0.0003543027],"domain_scores_gemma":[0.9979976,0.00034565863,0.00052333,0.0005789844,0.0004797497,0.00007470319],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009885555,0.00035620335,0.0002968071,0.00078548415,0.00057840854,0.0008583513,0.0009028692,0.0002617817,0.000005980255],"category_scores_gemma":[0.00016982295,0.0003372177,0.000077437166,0.0007790853,0.00029033486,0.00428206,0.0005224909,0.0005328165,0.00007010828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002574006,0.000025032774,0.0012181884,0.00016225634,0.000023858829,0.000007530452,0.014846637,0.22916496,0.000012286829,0.43045345,0.000029484207,0.32403058],"study_design_scores_gemma":[0.00029935717,0.00007796564,0.0032248264,0.0001741604,0.000007132656,0.000009462562,0.0000015137443,0.8735847,0.0001977123,0.12181511,0.00024919093,0.00035887578],"about_ca_topic_score_codex":0.00019611615,"about_ca_topic_score_gemma":0.00023912812,"teacher_disagreement_score":0.6444197,"about_ca_system_score_codex":0.00027685252,"about_ca_system_score_gemma":0.0005223492,"threshold_uncertainty_score":0.999908},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008607146,0.00004694366,0.9412749,0.0017934403,0.0033562628,0.00032111836,0.0000060613706,0.00022649563,0.052888736],"genre_scores_gemma":[0.5645431,0.0015001581,0.18428876,0.02812289,0.027889729,0.000036947215,0.00015549394,0.00036186204,0.19310103],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970401,0.00006579865,0.00043443893,0.00048656555,0.0012871376,0.0006859837],"domain_scores_gemma":[0.99842066,0.00058182556,0.00018049024,0.0004041601,0.00018314409,0.00022972681],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021707062,0.00022433512,0.00026217912,0.00067960954,0.0005959427,0.0006000831,0.0013933025,0.00030404222,0.00020106889],"category_scores_gemma":[0.0011168418,0.00021177405,0.00007747208,0.0016533638,0.0013662894,0.00049155875,0.00026753123,0.0005442876,0.00088561163],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026828504,0.000010500504,0.0000037806765,0.000014883691,0.000002438674,0.000011300026,0.024956156,0.006434286,0.0000037361551,0.017496765,0.0009822835,0.95008117],"study_design_scores_gemma":[0.000045136956,0.0001104882,0.00010570015,0.00047778917,0.00000923572,0.0000058049404,0.00005866416,0.07407743,0.0006094981,0.8872288,0.036342163,0.0009293128],"about_ca_topic_score_codex":0.00013621255,"about_ca_topic_score_gemma":0.0016272133,"teacher_disagreement_score":0.9491519,"about_ca_system_score_codex":0.0005745988,"about_ca_system_score_gemma":0.0029969611,"threshold_uncertainty_score":0.9998923},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000074508985,0.00005305255,0.9918552,0.0008083292,0.0009346238,0.00086348556,0.000009410142,0.001132844,0.0043356055],"genre_scores_gemma":[0.0347663,0.000013079274,0.9628156,0.001510843,0.000516134,0.00007459918,0.000012789024,0.00006096853,0.00022971127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950956,0.000032466316,0.0006517055,0.002056196,0.0011015875,0.001062442],"domain_scores_gemma":[0.9972595,0.00053351204,0.00023762569,0.0014029985,0.00025789192,0.00030846026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009373379,0.00058518944,0.0005661923,0.0005424503,0.00029825623,0.0005677642,0.0031647347,0.00031517673,0.0000034095872],"category_scores_gemma":[0.00015040627,0.0005523149,0.000113091475,0.0010661011,0.00039565997,0.00062469894,0.0018585266,0.0010314357,0.00007741339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052620803,0.00002215947,0.0000034780721,0.000036116693,0.0000039399065,0.000039950624,0.00021898006,0.5543237,0.00003014734,0.14157203,0.00018326343,0.303561],"study_design_scores_gemma":[0.000050827755,0.000105263476,0.000033175973,0.00020112676,0.0000029475084,0.00001560909,3.1863895e-8,0.5081724,0.00007776005,0.4906908,0.00026321554,0.00038685347],"about_ca_topic_score_codex":0.000017553866,"about_ca_topic_score_gemma":0.00002946433,"teacher_disagreement_score":0.34911877,"about_ca_system_score_codex":0.00030245516,"about_ca_system_score_gemma":0.00023523804,"threshold_uncertainty_score":0.99969286},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49798656,0.003880653,0.3507313,0.0096401125,0.03574854,0.008862965,0.0005364254,0.0041058543,0.08850758],"genre_scores_gemma":[0.83905476,0.00015732617,0.04405646,0.006309266,0.0017083066,0.00020517378,0.00014926253,0.00041562185,0.10794383],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99638695,0.000045712408,0.0005594573,0.0017287142,0.0004713922,0.0008077535],"domain_scores_gemma":[0.99785435,0.00046883567,0.00016320529,0.0012223388,0.00012624844,0.00016503109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059437024,0.0005221929,0.0006857275,0.0013729412,0.0001162781,0.00012955796,0.0013768006,0.00079715205,0.00035584302],"category_scores_gemma":[0.00016404936,0.00051091646,0.00006484171,0.00071382284,0.0007189645,0.00012509331,0.0011491015,0.0010382608,0.0006640634],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013370202,0.00035283863,0.11905025,0.00021741148,0.0000842646,0.0038213683,0.01357533,0.0007643062,0.0014379414,0.028717538,0.0023992143,0.82944584],"study_design_scores_gemma":[0.009119852,0.009054281,0.33211106,0.0034681049,0.0002571479,0.002489574,0.00008738234,0.0048540225,0.0033015837,0.17154491,0.4519604,0.011751661],"about_ca_topic_score_codex":0.0001173,"about_ca_topic_score_gemma":0.0005167813,"teacher_disagreement_score":0.8176942,"about_ca_system_score_codex":0.000137237,"about_ca_system_score_gemma":0.0001830938,"threshold_uncertainty_score":0.9997342},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046499295,0.000075179574,0.99231315,0.00031405716,0.0027898487,0.000451766,0.0000022537051,0.00027709894,0.003730161],"genre_scores_gemma":[0.042074855,0.000024703022,0.95640826,0.00066531013,0.00026600275,0.000021843265,0.0000031993422,0.000048873615,0.0004869606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956738,0.00008547245,0.0006911439,0.0016717516,0.0010871916,0.00079067034],"domain_scores_gemma":[0.997343,0.0004638767,0.00029033766,0.0016014992,0.00015664414,0.00014462526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026811322,0.00046497287,0.00049521716,0.0015307764,0.00015746531,0.0004672431,0.0043302346,0.00040855753,0.000009260308],"category_scores_gemma":[0.00036796322,0.00045701046,0.00008512742,0.0015924125,0.00069016276,0.0010435644,0.0020340127,0.0011443341,0.0001696899],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029992636,0.000017390226,0.00007302886,0.000044002787,0.0000033438828,0.00011878988,0.00067970966,0.031250898,0.00006873798,0.09771885,0.000008066996,0.8700142],"study_design_scores_gemma":[0.00017965665,0.000116044735,0.00090262474,0.0004647653,0.0000020952864,0.000041157662,2.5079788e-7,0.82404286,0.0009017348,0.17255016,0.00028916975,0.0005095002],"about_ca_topic_score_codex":0.000059221326,"about_ca_topic_score_gemma":0.00017137648,"teacher_disagreement_score":0.8695047,"about_ca_system_score_codex":0.0005677692,"about_ca_system_score_gemma":0.0007445836,"threshold_uncertainty_score":0.99978817},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028362332,0.00034917056,0.99539906,0.00009226225,0.0030967614,0.00028672282,0.0000025632987,0.0005812042,0.00016391036],"genre_scores_gemma":[0.00017923277,0.000035496003,0.9987007,0.00028467132,0.0003027043,0.000021247151,0.0000033393208,0.000037722864,0.00043492045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967305,0.0000971053,0.00045968493,0.0012608117,0.0006525626,0.0007993179],"domain_scores_gemma":[0.9970336,0.0011949122,0.00019669741,0.0012629383,0.00014200633,0.0001698555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003524518,0.00042061397,0.0004460144,0.0009985805,0.00021455684,0.00055036944,0.0028554006,0.00032524244,0.0000020465538],"category_scores_gemma":[0.001263023,0.00040642088,0.00007606398,0.0015923117,0.0003430895,0.0013308134,0.0023907227,0.00083845586,0.00002411055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012915713,0.0000059003128,0.00002332121,0.00009720924,0.0000055998858,0.000018359808,0.00055542093,0.018816462,0.00010154373,0.008558258,0.000028830766,0.9717878],"study_design_scores_gemma":[0.000116075935,0.000084773725,0.00063580176,0.00023649067,0.0000049027553,0.000074022435,8.900802e-8,0.9547754,0.002026315,0.039995782,0.0015394106,0.00051092496],"about_ca_topic_score_codex":0.00000565629,"about_ca_topic_score_gemma":0.0000044772305,"teacher_disagreement_score":0.9712769,"about_ca_system_score_codex":0.00034395757,"about_ca_system_score_gemma":0.00056036725,"threshold_uncertainty_score":0.99983877},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022502807,0.00080808956,0.9935793,0.0005535234,0.0011868686,0.0006501524,0.0000043311643,0.0001942393,0.003000988],"genre_scores_gemma":[0.38232666,0.00033593195,0.5873128,0.0015851918,0.0020646704,0.00024780477,0.000034411754,0.00014185328,0.025950631],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769014,0.000020033569,0.0003040671,0.0010729374,0.000443109,0.0004697341],"domain_scores_gemma":[0.99849015,0.00040285813,0.0001543828,0.000654425,0.00018843383,0.00010977002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007753765,0.00032441987,0.0003846967,0.0003439911,0.00023214513,0.0005499169,0.0011755755,0.00019128689,0.000006149736],"category_scores_gemma":[0.00009802654,0.00025551417,0.000071908435,0.00029568232,0.00029837294,0.00025862403,0.00076589774,0.000248338,0.000034410197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005869599,0.000017432187,0.00004072923,0.00011232294,0.000022582328,0.000036613903,0.0015724141,0.001010365,0.0001136777,0.34467012,0.00016976568,0.6522281],"study_design_scores_gemma":[0.0008776632,0.0009823123,0.00018296084,0.0002590057,0.000028382068,0.00007343285,0.000003058324,0.24042961,0.003312524,0.72839534,0.024068536,0.0013871986],"about_ca_topic_score_codex":0.00004278183,"about_ca_topic_score_gemma":0.00016647506,"teacher_disagreement_score":0.6508409,"about_ca_system_score_codex":0.000096759555,"about_ca_system_score_gemma":0.00020305734,"threshold_uncertainty_score":0.9999897},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000048043876,0.00034902277,0.99436164,0.000023330991,0.0013409471,0.00016437194,0.000018587984,0.002253425,0.0014838732],"genre_scores_gemma":[0.00042015535,0.00007009032,0.99854857,0.00013999773,0.00023962902,0.000017947308,0.00005331056,0.00008109939,0.0004291965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982408,0.000021191421,0.00030562372,0.0005478317,0.00031746796,0.0005670616],"domain_scores_gemma":[0.9987923,0.00035853917,0.000058260295,0.000631093,0.00008681091,0.00007302268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080702186,0.0003523724,0.0003535854,0.0006674962,0.000090906164,0.00016006651,0.0013336719,0.00028665978,0.0000075165176],"category_scores_gemma":[0.00019039906,0.000322641,0.000046990568,0.0011717184,0.00034277112,0.00055360503,0.00050938653,0.00095403974,0.000030667787],"study_design_candidate":"design_other","study_design_consensus":null,"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.87043e-7,0.0000021476726,0.000001320577,0.00007200635,0.0000040041677,0.000016899377,0.00010542267,0.07591614,0.00035704483,0.00008079729,0.0005898485,0.92285335],"study_design_scores_gemma":[0.00006140281,0.000033797587,0.0000071745003,0.0004916161,0.0000041099597,0.000020097545,9.6552995e-8,0.8374925,0.012805989,0.13355651,0.015051827,0.00047483886],"about_ca_topic_score_codex":0.0000029947691,"about_ca_topic_score_gemma":0.000018100138,"teacher_disagreement_score":0.92237854,"about_ca_system_score_codex":0.0005178718,"about_ca_system_score_gemma":0.00032144279,"threshold_uncertainty_score":0.9999226},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00380258,0.00011893673,0.98402464,0.00040229538,0.009489869,0.00037820026,0.000044177028,0.0003079896,0.001431333],"genre_scores_gemma":[0.96721894,0.000029832849,0.019496076,0.0007519748,0.0017968848,0.000008890955,0.000050865357,0.000116141746,0.0105304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99008894,0.000049016784,0.0013729078,0.0030661654,0.0045262063,0.00089679344],"domain_scores_gemma":[0.99254876,0.0031941575,0.0005976517,0.00291697,0.0004987215,0.00024371312],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.011757243,0.00055733783,0.00078762736,0.0026125617,0.00038370895,0.0027782954,0.004805498,0.00023799133,0.00012964805],"category_scores_gemma":[0.0016035375,0.00045075515,0.00022156854,0.0020271963,0.00048880046,0.00044881817,0.0030341423,0.00068917463,0.0009222844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065942595,0.000021969961,0.0008249851,0.000043743552,0.00001678588,0.00023406466,0.0007568941,0.3711115,0.00004214419,0.0028021242,0.00040294198,0.6237362],"study_design_scores_gemma":[0.00019743018,0.00006184308,0.0007451986,0.00083217444,0.000012704779,0.00002450257,0.0000034780048,0.946203,0.0001481251,0.045598168,0.0055281413,0.0006452633],"about_ca_topic_score_codex":0.000052208376,"about_ca_topic_score_gemma":0.00017308578,"teacher_disagreement_score":0.96452856,"about_ca_system_score_codex":0.00028124297,"about_ca_system_score_gemma":0.00025914644,"threshold_uncertainty_score":0.99985564},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017169272,0.000096590105,0.9910286,0.0023179555,0.003408044,0.00063938653,0.000027522741,0.0005885879,0.0017216387],"genre_scores_gemma":[0.15920158,0.000017345546,0.8355148,0.0036198667,0.001131787,0.000019654788,0.00008711276,0.00014218302,0.0002656717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925889,0.00024325025,0.0012364759,0.0027770184,0.001881675,0.0012727113],"domain_scores_gemma":[0.99211806,0.004676518,0.00071312505,0.0018355746,0.00039526095,0.0002614724],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0021500431,0.0010233534,0.0012497375,0.0020764072,0.00043528044,0.0012542341,0.0053522442,0.00056654314,0.000033305132],"category_scores_gemma":[0.0006099304,0.0010050761,0.00026983392,0.0019653058,0.0011165189,0.0010739494,0.0033980329,0.002745142,0.00010214418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011027495,0.000065754146,0.0003494629,0.00005742414,0.000010931714,0.00039897207,0.00037108338,0.5325182,0.00001317312,0.032335617,0.000012780386,0.43385556],"study_design_scores_gemma":[0.0007921192,0.00030776986,0.0034216114,0.0018573264,0.000008631962,0.00002744576,0.0000010426908,0.9655475,0.000054277374,0.026209442,0.00070646586,0.0010663444],"about_ca_topic_score_codex":0.000087847664,"about_ca_topic_score_gemma":0.00056474825,"teacher_disagreement_score":0.4330293,"about_ca_system_score_codex":0.0007569436,"about_ca_system_score_gemma":0.001004115,"threshold_uncertainty_score":0.99978256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023693193,0.000031123505,0.97447425,0.000017567887,0.0005085134,0.00024380416,0.0000090794665,0.00011578568,0.000906686],"genre_scores_gemma":[0.9891517,0.000021738622,0.010338239,0.00004289827,0.00011507796,0.000008631518,0.000021814467,0.00003498363,0.0002648826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883056,0.000006930031,0.00026355937,0.0003005945,0.00040898426,0.00018938594],"domain_scores_gemma":[0.99960893,0.000051189887,0.000057923953,0.00017937805,0.00005676079,0.00004583217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018053343,0.00018587451,0.00020097288,0.0005316855,0.000036447153,0.000045638637,0.0002846873,0.0001170578,0.00012221074],"category_scores_gemma":[0.000016401555,0.00017339851,0.000036831887,0.00023133072,0.00015132863,0.00011015959,0.00008014209,0.00034564047,0.000032832926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061804753,0.000019239456,0.00069434784,0.00005830969,0.000006411743,0.000051159226,0.0012569265,0.80666775,0.0002857608,0.001524678,0.000016456466,0.18941279],"study_design_scores_gemma":[0.00034093068,0.00021905739,0.021236422,0.0020308304,0.0000116408255,0.000024154562,0.0000027187975,0.97230977,0.0009536093,0.0021513123,0.0001650899,0.00055448746],"about_ca_topic_score_codex":0.0000061433425,"about_ca_topic_score_gemma":0.00014843068,"teacher_disagreement_score":0.9654585,"about_ca_system_score_codex":0.00016722937,"about_ca_system_score_gemma":0.00006065297,"threshold_uncertainty_score":0.70709866},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000016505467,0.00010444109,0.9945112,0.0020314013,0.0012013894,0.0011108594,0.0005169027,0.00036457588,0.00015757499],"genre_scores_gemma":[0.002160125,0.000028429718,0.9919484,0.0028502743,0.0005780198,0.00009084422,0.0019778162,0.00006527699,0.0003007936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959056,0.000021242395,0.0004880425,0.0023388907,0.0006283521,0.0006178704],"domain_scores_gemma":[0.99392676,0.0013783217,0.00033392623,0.004057356,0.00014942927,0.00015418873],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00074154034,0.0004489333,0.00036948943,0.00052768446,0.00034929946,0.00042499285,0.0078063956,0.0002114606,0.000004649077],"category_scores_gemma":[0.0001378781,0.0004363151,0.00007210742,0.000834259,0.00038046876,0.00070550985,0.0025055741,0.0004757347,0.00006822903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007967611,0.000023657023,0.0000058475916,0.000046701425,0.00000827624,0.000019331506,0.000048561495,0.122139774,0.00011940694,0.02693655,0.00074092246,0.849903],"study_design_scores_gemma":[0.00029071554,0.00007047643,0.000025203059,0.00012935983,0.000010030145,0.000008060925,3.3850107e-8,0.83630633,0.00044420557,0.15156145,0.010713779,0.00044037122],"about_ca_topic_score_codex":0.000010198733,"about_ca_topic_score_gemma":0.0002541876,"teacher_disagreement_score":0.8494626,"about_ca_system_score_codex":0.00018265957,"about_ca_system_score_gemma":0.00046623973,"threshold_uncertainty_score":0.99980885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048185088,0.00028316118,0.97982174,0.002289332,0.00342361,0.0019729943,0.000081247854,0.00043959194,0.011640117],"genre_scores_gemma":[0.602706,0.053742457,0.29394495,0.009256741,0.026575558,0.0033039788,0.0007804192,0.000915944,0.008773897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977634,0.00010480351,0.00029691984,0.00066242454,0.0005840809,0.0005883985],"domain_scores_gemma":[0.99765253,0.0010720454,0.00021670254,0.00058664114,0.00034211107,0.0001299819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021834993,0.0002664697,0.0003464477,0.00047269682,0.0012076957,0.00029363437,0.0012674101,0.00035225163,0.000044865665],"category_scores_gemma":[0.00015259029,0.00026532632,0.0001216122,0.00039110464,0.000743482,0.00023881021,0.00035367967,0.0002780733,0.00012123436],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043999025,0.000026369076,0.000108867214,0.0004652557,0.000013044257,0.000016828779,0.06868025,0.001958077,0.00003150193,0.092082724,0.00006629748,0.8365068],"study_design_scores_gemma":[0.002766344,0.0011559235,0.0011976194,0.013052944,0.00023616255,0.000043524753,0.0013641163,0.68293,0.00020872985,0.18668973,0.10417981,0.0061751106],"about_ca_topic_score_codex":0.00028460307,"about_ca_topic_score_gemma":0.0022345127,"teacher_disagreement_score":0.8303317,"about_ca_system_score_codex":0.00065802416,"about_ca_system_score_gemma":0.00031419925,"threshold_uncertainty_score":0.9999799},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048778197,0.000070671515,0.9954032,0.00033808232,0.00058480754,0.0003381014,0.0000043791165,0.00057767273,0.0021953045],"genre_scores_gemma":[0.086836986,0.000014075322,0.90848583,0.00041247197,0.0006454542,0.000022599646,0.000030397616,0.00012310971,0.0034290617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542505,0.00005919409,0.0006051714,0.0017472879,0.0012753841,0.0008879178],"domain_scores_gemma":[0.9975596,0.00054858695,0.000596689,0.0006755313,0.00047502562,0.00014453032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010116618,0.00066511985,0.00075041637,0.0005637407,0.00081052264,0.00069869426,0.0015104658,0.00022697065,0.00003370156],"category_scores_gemma":[0.00010320869,0.0005514328,0.0001962179,0.0010953619,0.00052790483,0.00138756,0.0013318289,0.0009939818,0.00011434134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006186283,0.00006384221,0.00008167133,0.000096535376,0.00027219093,0.0008359221,0.0038325184,0.6757709,0.00081012386,0.103889816,0.00001972663,0.21426488],"study_design_scores_gemma":[0.00036310457,0.0004807004,0.000023865996,0.00063362665,0.00004082867,0.00024628825,0.0000015446265,0.92020607,0.00039653102,0.07680847,0.00010147433,0.00069751963],"about_ca_topic_score_codex":0.000036378202,"about_ca_topic_score_gemma":0.00008454197,"teacher_disagreement_score":0.24443515,"about_ca_system_score_codex":0.00024192143,"about_ca_system_score_gemma":0.0003990624,"threshold_uncertainty_score":0.9996937},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063898438,0.00039930773,0.8640278,0.00082690764,0.0029616784,0.0010654373,0.000011058214,0.00062528066,0.12369271],"genre_scores_gemma":[0.96333677,0.000034804027,0.024525892,0.0028096586,0.0012252483,0.00002281708,0.00012002835,0.000098073164,0.007826706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716675,0.0000024179258,0.00035301215,0.00096682896,0.0010066009,0.00050437835],"domain_scores_gemma":[0.9990138,0.00005788249,0.00010551635,0.00047968954,0.000124293,0.00021882182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006034306,0.00036873252,0.00047230616,0.00083126186,0.00019713811,0.00008706827,0.00034528936,0.00024141243,0.00009389335],"category_scores_gemma":[0.000044584478,0.0003055733,0.00012373246,0.0004992311,0.00029143548,0.00012492154,0.00031588972,0.0012565856,0.00011610652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005165864,0.00027350686,0.14282517,0.00048165926,0.00022195923,0.00097054796,0.0061624697,0.5684111,0.00026969233,0.009854155,0.0004916479,0.2695215],"study_design_scores_gemma":[0.002448256,0.0014755415,0.13313058,0.0026600768,0.00013563733,0.001089521,0.0000040615596,0.82749456,0.00019306752,0.010036427,0.019569838,0.0017624456],"about_ca_topic_score_codex":0.000010023303,"about_ca_topic_score_gemma":0.000008574538,"teacher_disagreement_score":0.9569469,"about_ca_system_score_codex":0.0001474826,"about_ca_system_score_gemma":0.00030738875,"threshold_uncertainty_score":0.9999396},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021264066,0.00002800801,0.99099874,0.0018966799,0.002795156,0.0012103731,0.000009397028,0.0002782848,0.0006569651],"genre_scores_gemma":[0.99228436,0.000010223574,0.001945254,0.0044823606,0.0003570032,0.000120521,0.000015262462,0.00007608299,0.000708911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964641,0.00039226026,0.0005819287,0.0012279334,0.00068394013,0.0006498517],"domain_scores_gemma":[0.9524602,0.046314657,0.00033887755,0.0006027996,0.00019738369,0.000086052096],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025728315,0.00049762824,0.0006206623,0.00096728327,0.0011207212,0.00019271263,0.00087765924,0.00039737968,0.00001090419],"category_scores_gemma":[0.02053807,0.00051230437,0.00018647416,0.0010423478,0.0008409735,0.00023817587,0.00039057652,0.0022177466,0.000021373526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001580685,0.000031472726,0.000059068094,0.000041647305,0.0000049463665,0.000008745305,0.00044554452,0.91950375,0.00501633,0.00026023583,0.000043733697,0.07442646],"study_design_scores_gemma":[0.0019060913,0.00038683336,0.00040866307,0.0003472073,0.000008659586,0.000008307753,0.0000013673754,0.9523682,0.016346166,0.027146054,0.000508908,0.0005635264],"about_ca_topic_score_codex":0.00010424811,"about_ca_topic_score_gemma":0.0033423093,"teacher_disagreement_score":0.99015796,"about_ca_system_score_codex":0.0005411181,"about_ca_system_score_gemma":0.00027957754,"threshold_uncertainty_score":0.99973285},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007278219,0.00026804485,0.9969131,0.00029760483,0.0006540965,0.00039914282,0.000015909638,0.00035042933,0.0010288873],"genre_scores_gemma":[0.015015679,0.00005200089,0.9760061,0.00018957998,0.0004995099,0.000012706491,0.000025670204,0.00014387001,0.008054896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957758,0.00003600147,0.0006871965,0.0016444334,0.00081983145,0.0010367183],"domain_scores_gemma":[0.9974109,0.0006174351,0.0005761078,0.00084166357,0.00037454074,0.00017938098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014389204,0.00064163806,0.0008006184,0.0009203763,0.00081321737,0.0009934196,0.0021079325,0.00022078128,0.000012396524],"category_scores_gemma":[0.00018781463,0.0006043067,0.00028355696,0.0010092943,0.00039317808,0.0014439169,0.0018104028,0.00075138727,0.00002403703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000839738,0.0000049448295,0.0000100944535,0.000044955745,0.000023089427,0.000038315076,0.00067335455,0.8103477,0.00011009654,0.006903708,0.0000033885624,0.18183196],"study_design_scores_gemma":[0.00014098725,0.00015046663,0.0000014063462,0.0003178948,0.000016686698,0.0000613381,3.3503142e-7,0.8367972,0.00023914337,0.16133407,0.0003785722,0.00056191935],"about_ca_topic_score_codex":0.000071149436,"about_ca_topic_score_gemma":0.00008032675,"teacher_disagreement_score":0.18127003,"about_ca_system_score_codex":0.00024888513,"about_ca_system_score_gemma":0.0003546005,"threshold_uncertainty_score":0.9996408},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001092528,0.00007013182,0.99711233,0.000348468,0.0004977271,0.00035541246,0.0000038428193,0.00011093165,0.0004086371],"genre_scores_gemma":[0.93967366,0.000025391366,0.05989883,0.000121128636,0.00007867431,0.000016144657,0.000021743044,0.000020910624,0.0001434948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972959,0.00004696131,0.00069589866,0.0008790703,0.00071903365,0.00036314744],"domain_scores_gemma":[0.9985556,0.00019598923,0.000196682,0.0007257211,0.00024809217,0.00007789518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005133444,0.0003114546,0.00049937575,0.00089631864,0.000117900134,0.00024801138,0.0014696949,0.0002148167,0.000007877518],"category_scores_gemma":[0.00008604937,0.00028362637,0.00006368742,0.00083370256,0.0002441892,0.00038734946,0.00054102845,0.00047065885,0.000016629707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047241565,0.000090601825,0.0011494886,0.00008602711,0.000005911528,0.0000119312745,0.0019281508,0.581463,0.0006223336,0.15018204,0.000011571985,0.26444426],"study_design_scores_gemma":[0.00012609237,0.00011158551,0.00066388195,0.0003254999,0.000003328073,0.0000030037052,3.391798e-7,0.8794519,0.0018657664,0.11717707,0.000012918397,0.00025866312],"about_ca_topic_score_codex":0.000056911107,"about_ca_topic_score_gemma":0.0006813177,"teacher_disagreement_score":0.93858117,"about_ca_system_score_codex":0.00019101352,"about_ca_system_score_gemma":0.00034879433,"threshold_uncertainty_score":0.9999616},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006972335,0.00011312608,0.9845981,0.0012211906,0.006493901,0.0003597548,0.000009035819,0.00050560926,0.006002055],"genre_scores_gemma":[0.4802413,0.0002380192,0.17543618,0.173595,0.13464111,0.00012570535,0.003814121,0.0018099031,0.030098649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651176,0.0000073828696,0.0005068761,0.0012459942,0.00094377995,0.00078422384],"domain_scores_gemma":[0.99792475,0.00024201395,0.00036976056,0.00086137943,0.00057572377,0.000026353382],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00084128324,0.00049799966,0.00047910667,0.0012680393,0.00036516692,0.0009037243,0.0021464576,0.00029108574,0.000096824944],"category_scores_gemma":[0.00023338475,0.00045410453,0.00008731786,0.004149305,0.00039164326,0.0010987816,0.0023283958,0.0007245276,0.0015150913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020836736,0.00008177563,0.0013478239,0.0012071178,0.000024257935,0.00017389077,0.00024950513,0.04695154,0.000088296365,0.005146725,0.008038619,0.9366696],"study_design_scores_gemma":[0.00027214622,0.000013812143,0.0012065875,0.0017595999,0.00003585206,0.000016564336,0.0000014177172,0.8525364,0.00010451437,0.056420468,0.08644601,0.0011866569],"about_ca_topic_score_codex":0.0003248252,"about_ca_topic_score_gemma":0.00079826487,"teacher_disagreement_score":0.935483,"about_ca_system_score_codex":0.00019409356,"about_ca_system_score_gemma":0.00037098755,"threshold_uncertainty_score":0.9997911},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079901644,0.00005661538,0.9947997,0.0007366954,0.001156724,0.00053041766,0.000005855317,0.0008960098,0.0010189892],"genre_scores_gemma":[0.053074352,0.00007759354,0.94503087,0.0013668204,0.00020607703,0.00003485501,0.000022119873,0.000064734515,0.0001225579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965718,0.00006804935,0.0005367407,0.0014238397,0.00086693786,0.00053265406],"domain_scores_gemma":[0.99805146,0.00054709177,0.000257238,0.00076886365,0.00018860077,0.00018674598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009577818,0.00046757548,0.00042048024,0.0009829241,0.0003420464,0.0007439449,0.0011820035,0.00025598297,0.000023352028],"category_scores_gemma":[0.00007544667,0.0004767172,0.00010408103,0.0006935995,0.00018283709,0.00059601094,0.00040844735,0.00040027616,0.000074476695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008431377,0.000052666826,0.00006284612,0.00012276319,0.000031734387,0.000054690794,0.0033268097,0.0036345501,0.0003688854,0.0008589694,0.000009735838,0.9914679],"study_design_scores_gemma":[0.00052669446,0.00009722934,0.0003427862,0.00033554042,0.000020599606,0.000037450878,0.000002207173,0.99104726,0.0013498324,0.005291906,0.00039530272,0.000553215],"about_ca_topic_score_codex":0.000014681143,"about_ca_topic_score_gemma":0.00008030272,"teacher_disagreement_score":0.9909147,"about_ca_system_score_codex":0.00031526,"about_ca_system_score_gemma":0.00036492135,"threshold_uncertainty_score":0.99976844},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006972335,0.00011312608,0.9845981,0.0012211906,0.006493901,0.0003597548,0.000009035819,0.00050560926,0.006002055],"genre_scores_gemma":[0.4802413,0.0002380192,0.17543618,0.173595,0.13464111,0.00012570535,0.003814121,0.0018099031,0.030098649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651176,0.0000073828696,0.0005068761,0.0012459942,0.00094377995,0.00078422384],"domain_scores_gemma":[0.99792475,0.00024201395,0.00036976056,0.00086137943,0.00057572377,0.000026353382],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00084128324,0.00049799966,0.00047910667,0.0012680393,0.00036516692,0.0009037243,0.0021464576,0.00029108574,0.000096824944],"category_scores_gemma":[0.00023338475,0.00045410453,0.00008731786,0.004149305,0.00039164326,0.0010987816,0.0023283958,0.0007245276,0.0015150913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020836736,0.00008177563,0.0013478239,0.0012071178,0.000024257935,0.00017389077,0.00024950513,0.04695154,0.000088296365,0.005146725,0.008038619,0.9366696],"study_design_scores_gemma":[0.00027214622,0.000013812143,0.0012065875,0.0017595999,0.00003585206,0.000016564336,0.0000014177172,0.8525364,0.00010451437,0.056420468,0.08644601,0.0011866569],"about_ca_topic_score_codex":0.0003248252,"about_ca_topic_score_gemma":0.00079826487,"teacher_disagreement_score":0.935483,"about_ca_system_score_codex":0.00019409356,"about_ca_system_score_gemma":0.00037098755,"threshold_uncertainty_score":0.9997911},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028300947,0.00013678729,0.99434334,0.0011226225,0.0026915278,0.00066061114,0.000013161606,0.00028382285,0.00071980624],"genre_scores_gemma":[0.048208456,0.00024816341,0.94044155,0.003093911,0.0010188873,0.00012572834,0.000028758466,0.00012863653,0.0067059025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966921,0.00005574668,0.00045932303,0.0013961733,0.00079969567,0.0005969361],"domain_scores_gemma":[0.99618113,0.0019803708,0.00030483492,0.0011500719,0.00026287974,0.00012070252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014534554,0.00042471747,0.0003723795,0.0005228237,0.00058788486,0.0007647174,0.0027339559,0.00028457763,0.000040564788],"category_scores_gemma":[0.0005145677,0.00032467494,0.0002021888,0.00063909066,0.00039140877,0.00043843978,0.00062224973,0.00067764544,0.00025447473],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071342256,0.000024927058,0.000033622913,0.000024286199,0.000027083715,0.000019712517,0.0006612765,0.0050675245,0.0008197479,0.004463671,0.000125724,0.9887253],"study_design_scores_gemma":[0.00035572753,0.00007299677,0.0013794041,0.00019142451,0.000019035624,0.000030193809,6.837724e-7,0.9662025,0.00063302513,0.01857404,0.012013673,0.00052731123],"about_ca_topic_score_codex":0.000029211084,"about_ca_topic_score_gemma":0.00008117255,"teacher_disagreement_score":0.988198,"about_ca_system_score_codex":0.00016641886,"about_ca_system_score_gemma":0.00028679823,"threshold_uncertainty_score":0.99992055},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006952669,0.00014625283,0.992824,0.00060163153,0.0031216037,0.00028572997,0.0000028127317,0.00047899017,0.0018436965],"genre_scores_gemma":[0.3404886,0.00011188783,0.6492437,0.0024948905,0.0020572299,0.000033218002,0.000059480168,0.0001692953,0.005341678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955379,0.000027990396,0.00064483384,0.0018029115,0.0012348564,0.0007515315],"domain_scores_gemma":[0.9977912,0.00014534478,0.00042796906,0.001120522,0.0003317763,0.00018320043],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011024856,0.00050718884,0.00045409275,0.0008948914,0.00043517535,0.0013947831,0.002192108,0.00034430024,0.00002084098],"category_scores_gemma":[0.00011830235,0.0004842075,0.00015572109,0.0011065182,0.00061539287,0.0011271063,0.0010607274,0.0007389992,0.00044584827],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047844974,0.00003098363,0.0002970068,0.00006800801,0.0000121140365,0.000084265965,0.00026902373,0.0061992845,0.0060712835,0.0021478687,0.000035750036,0.98477966],"study_design_scores_gemma":[0.00082786195,0.00039200202,0.013756482,0.001344419,0.0000243393,0.000280434,3.8136287e-7,0.6173516,0.059164558,0.30267853,0.0018403592,0.0023390497],"about_ca_topic_score_codex":0.000017679467,"about_ca_topic_score_gemma":0.000036642658,"teacher_disagreement_score":0.9824406,"about_ca_system_score_codex":0.00032772406,"about_ca_system_score_gemma":0.00044383484,"threshold_uncertainty_score":0.999761},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008038362,0.0013130374,0.98872703,0.00031794474,0.00023398318,0.00053714187,0.0000044576627,0.00041849545,0.00040952937],"genre_scores_gemma":[0.8373159,0.000040372,0.16137592,0.0006387733,0.00014871955,0.000028184022,0.0000033313408,0.00005473538,0.00039405533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652183,0.00006700663,0.00044694205,0.001606888,0.00069461745,0.0006626927],"domain_scores_gemma":[0.9983506,0.00027463795,0.00021515574,0.00096192444,0.000089113535,0.00010854216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012987831,0.00048637716,0.00050698617,0.001510875,0.00012788686,0.00053255114,0.002216134,0.00039863796,0.0000022898944],"category_scores_gemma":[0.00022804017,0.00046067766,0.000055729917,0.001086436,0.00025002484,0.0008947693,0.0016154048,0.0013231547,0.000008784937],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017258346,0.000037351092,0.00007458908,0.00013919431,0.0000052716223,0.00037949072,0.002929045,0.0061313612,0.008694229,0.0010579529,0.0000032847263,0.980531],"study_design_scores_gemma":[0.00043800942,0.00012209058,0.00011063235,0.0010774354,0.0000035212129,0.00003679972,0.0000035385274,0.9080345,0.02788623,0.061515927,0.000031081592,0.0007402138],"about_ca_topic_score_codex":0.0008299559,"about_ca_topic_score_gemma":0.004450364,"teacher_disagreement_score":0.97979075,"about_ca_system_score_codex":0.0003922983,"about_ca_system_score_gemma":0.00024698063,"threshold_uncertainty_score":0.99978447},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010807944,0.000084035346,0.9928921,0.00016881901,0.003914043,0.0004000294,0.0000073896044,0.0006817022,0.0007711129],"genre_scores_gemma":[0.47983426,0.00013399917,0.5164607,0.000963548,0.001335072,0.000043576136,0.000016008535,0.00012978318,0.0010830114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956635,0.00007386849,0.00061064755,0.001641538,0.001245239,0.0007651988],"domain_scores_gemma":[0.99640787,0.0014504798,0.0003176483,0.001138364,0.000451067,0.00023454975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010374535,0.00054517813,0.0005331118,0.0024651797,0.00045155833,0.00058365177,0.002358389,0.00044829093,0.00002820635],"category_scores_gemma":[0.0009828141,0.0005363936,0.00017600233,0.003112957,0.00035376576,0.00062673277,0.001050446,0.0008804662,0.0004606861],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064885844,0.000018207955,0.00005015356,0.000021658674,0.00001460072,0.000114746224,0.00021974585,0.0045525846,0.00044769922,0.00043464394,0.000008392033,0.99411106],"study_design_scores_gemma":[0.00044326772,0.00017265829,0.00043499222,0.00034277345,0.000017812154,0.00012395612,5.5550777e-7,0.94671065,0.024024423,0.025464103,0.0012712309,0.0009935553],"about_ca_topic_score_codex":0.000052222604,"about_ca_topic_score_gemma":0.0003069444,"teacher_disagreement_score":0.9931175,"about_ca_system_score_codex":0.00029086604,"about_ca_system_score_gemma":0.00036676944,"threshold_uncertainty_score":0.9997088},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006746889,0.00008312536,0.9940761,0.0013486614,0.002377424,0.00083443004,0.000019373074,0.00033712908,0.00024910836],"genre_scores_gemma":[0.20758809,0.00003406547,0.7904545,0.0010064153,0.0005046657,0.000081538405,0.000025141733,0.00008597134,0.00021960685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640447,0.000073604155,0.000820322,0.0014442735,0.0004957841,0.000761533],"domain_scores_gemma":[0.99721754,0.0010821752,0.00041539597,0.0009948437,0.00016755692,0.00012251023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013369748,0.0005087553,0.000631048,0.001312672,0.00037629722,0.0006561603,0.002492984,0.00034022832,0.000006940919],"category_scores_gemma":[0.00010630812,0.000510258,0.00018005067,0.0006386567,0.00022796167,0.0006319877,0.0013100713,0.0005315246,0.000007768372],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049597515,0.000039117076,0.0011454244,0.00010776453,0.000024055567,0.000044708082,0.0029939043,0.009472915,0.0006664908,0.0019662743,0.000109702465,0.98342466],"study_design_scores_gemma":[0.0004863288,0.000112572634,0.0001769626,0.0010963944,0.00000799999,0.00004321728,0.000002670463,0.96675694,0.0022544838,0.026238881,0.0020306094,0.0007929419],"about_ca_topic_score_codex":0.00034040908,"about_ca_topic_score_gemma":0.0013883619,"teacher_disagreement_score":0.98263174,"about_ca_system_score_codex":0.00036901966,"about_ca_system_score_gemma":0.00031063467,"threshold_uncertainty_score":0.9997349},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034527013,0.0003230989,0.9836413,0.00039351295,0.0018704449,0.00030017027,0.0000014216192,0.011465756,0.0019697594],"genre_scores_gemma":[0.13594726,0.000092874216,0.8614934,0.0008519901,0.0003379134,0.000021869417,0.000011903905,0.000121163386,0.0011216266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953944,0.000060674643,0.0005775829,0.0018777555,0.0011336163,0.0009559895],"domain_scores_gemma":[0.99621534,0.0015219789,0.000352359,0.0014560875,0.00025001515,0.00020424523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014860865,0.00063618977,0.0006157409,0.0013105955,0.00052351726,0.00077409414,0.0040060575,0.00038906108,0.000007966067],"category_scores_gemma":[0.00054516847,0.00063116377,0.00017118771,0.0011263039,0.00062088866,0.00047930877,0.002239758,0.0016389241,0.00014052694],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021813046,0.000011536782,0.00020342768,0.000047563753,0.000009877727,0.00015828254,0.00070953486,0.04015623,0.000036481182,0.0045851665,0.00006352609,0.9540162],"study_design_scores_gemma":[0.000101499405,0.00012933176,0.0001898878,0.0005948493,0.000005233941,0.00007002943,7.878983e-8,0.66602206,0.000067284804,0.33178934,0.0004098929,0.00062051625],"about_ca_topic_score_codex":0.000042201485,"about_ca_topic_score_gemma":0.00005332157,"teacher_disagreement_score":0.95339566,"about_ca_system_score_codex":0.00045890952,"about_ca_system_score_gemma":0.00034508813,"threshold_uncertainty_score":0.99961394},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004994532,0.00009257572,0.99090016,0.0048970478,0.0012348365,0.0005633916,0.00003797428,0.0005665354,0.0016575515],"genre_scores_gemma":[0.32383043,0.0011587611,0.6274704,0.013284769,0.00593513,0.0006950449,0.00058494543,0.00051806535,0.026522491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949614,0.00016323509,0.00066520734,0.0022258197,0.0011826672,0.0008016651],"domain_scores_gemma":[0.9954888,0.0011314811,0.0003423868,0.0025100145,0.00022535978,0.0003019547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023193057,0.00050765777,0.0005924649,0.0006562685,0.0004452443,0.00063072867,0.0038907633,0.00042544023,0.0000034266382],"category_scores_gemma":[0.00026594923,0.00048824877,0.00010403859,0.0020947864,0.0013878316,0.0005517007,0.0033025406,0.0009835665,0.00007388628],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000498684,0.000076089455,0.000034286535,0.00008546648,0.000024144472,0.000059135196,0.0011040583,0.027762268,0.00008717329,0.045350224,0.0038870343,0.9215251],"study_design_scores_gemma":[0.00029750058,0.00013697098,0.0016515077,0.00024923217,0.000013632445,0.00006222233,5.7976354e-7,0.61356896,0.00052761467,0.3778938,0.004785986,0.000812011],"about_ca_topic_score_codex":0.00014789308,"about_ca_topic_score_gemma":0.0005499847,"teacher_disagreement_score":0.9207131,"about_ca_system_score_codex":0.0006317643,"about_ca_system_score_gemma":0.001388956,"threshold_uncertainty_score":0.99975693},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052806914,0.00045527497,0.99494195,0.0011595148,0.0012823091,0.0007041453,0.000014293247,0.0010157306,0.00037399365],"genre_scores_gemma":[0.0020175963,0.00019897886,0.99515265,0.000907934,0.00077988417,0.00004620614,0.0000145039785,0.00008073632,0.00080148556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957019,0.000036854704,0.00061717577,0.0019550796,0.0006954292,0.0009935222],"domain_scores_gemma":[0.9971406,0.00079982844,0.00034614175,0.001208209,0.00032414624,0.00018107338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011695882,0.00062027975,0.00066847773,0.0006202332,0.00047525592,0.0008025015,0.0021432491,0.00035588478,0.0000041377903],"category_scores_gemma":[0.0002347733,0.0005983198,0.00015083834,0.00068608683,0.0008745248,0.0013181972,0.0019333164,0.00061644806,0.000021520527],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034394256,0.00002484227,0.000036443227,0.00018654703,0.00002040427,0.00011083153,0.00032437462,0.06991926,0.002304375,0.012357645,0.001109608,0.9135713],"study_design_scores_gemma":[0.00014409529,0.00021847377,0.000073954216,0.00038574068,0.0000072042267,0.00006428321,3.3526938e-8,0.63460064,0.00049647223,0.36294344,0.00056467653,0.00050096837],"about_ca_topic_score_codex":0.000027257991,"about_ca_topic_score_gemma":0.000034688743,"teacher_disagreement_score":0.9130703,"about_ca_system_score_codex":0.00028317215,"about_ca_system_score_gemma":0.00034172484,"threshold_uncertainty_score":0.99964684},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000088118744,0.0016226786,0.9873661,0.001465031,0.0033575387,0.0004530615,0.0000051352595,0.00043931208,0.005203026],"genre_scores_gemma":[0.14324269,0.0023906971,0.81882024,0.011546557,0.006171019,0.00020496784,0.00006121565,0.00027630295,0.017286327],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963084,0.00002442511,0.00048697606,0.0016519607,0.0009191816,0.0006090588],"domain_scores_gemma":[0.9974134,0.0003830643,0.0003116184,0.0013555412,0.00033863203,0.00019774925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012892247,0.00045304134,0.00046901958,0.0006404756,0.0003502523,0.0005917836,0.001694637,0.0003165972,0.00000843911],"category_scores_gemma":[0.00026891573,0.00040086385,0.0000938414,0.0007650242,0.0005113033,0.0007338952,0.001965996,0.00057985116,0.00004006263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019135261,0.000031464693,0.0011215106,0.00009223005,0.000016865204,0.00074161787,0.0026280605,0.00041971178,0.000037474612,0.16788967,0.00031304712,0.82670647],"study_design_scores_gemma":[0.0002780653,0.0002653962,0.0079645105,0.0007735578,0.000017931776,0.00051632564,3.7807337e-7,0.15808101,0.0002035232,0.80347353,0.027003475,0.0014223251],"about_ca_topic_score_codex":0.000048701593,"about_ca_topic_score_gemma":0.00020782603,"teacher_disagreement_score":0.8252841,"about_ca_system_score_codex":0.00018515252,"about_ca_system_score_gemma":0.00042362392,"threshold_uncertainty_score":0.9998443},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020532778,0.0010780956,0.9919444,0.0032544087,0.00186482,0.0005040811,0.000023590921,0.0002862609,0.0010238221],"genre_scores_gemma":[0.028775498,0.00077261665,0.9652511,0.003941658,0.0010540193,0.000045028773,0.00002883566,0.00006448356,0.00006677864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953504,0.00020776581,0.0006227761,0.0018405049,0.0012093895,0.0007691366],"domain_scores_gemma":[0.99538755,0.0017614255,0.00028778383,0.001965532,0.0003282668,0.0002694597],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0039712386,0.00059831026,0.00070215523,0.0008946258,0.0006594232,0.0015849025,0.0041431384,0.00038054027,0.000015874273],"category_scores_gemma":[0.00024235925,0.0004146031,0.00022538261,0.0014876934,0.0025853214,0.0009492012,0.002737426,0.0010946566,0.000041394494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017223856,0.000013335584,0.000013862547,0.000030813426,0.000018910288,0.000037477,0.00069366826,0.0008364632,0.000013523656,0.55357087,0.00011974745,0.44463408],"study_design_scores_gemma":[0.0012415217,0.000060233222,0.00007693387,0.00012680299,0.000014243629,0.00009749336,5.2647647e-7,0.3158546,0.00017685286,0.6788359,0.0029529626,0.0005618712],"about_ca_topic_score_codex":0.00007141721,"about_ca_topic_score_gemma":0.0002933829,"teacher_disagreement_score":0.44407222,"about_ca_system_score_codex":0.000095233445,"about_ca_system_score_gemma":0.00047214108,"threshold_uncertainty_score":0.9998306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009655468,0.000054692406,0.99062496,0.0014214098,0.0030450285,0.00033636083,0.00004449202,0.00040518923,0.0039713257],"genre_scores_gemma":[0.3498399,0.00012514308,0.6398734,0.006635153,0.002147837,0.000074604766,0.0003091196,0.00013935879,0.0008555134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995797,0.000041891275,0.00051535637,0.0016993466,0.0013482531,0.00059816864],"domain_scores_gemma":[0.99653316,0.0007161085,0.00029735922,0.002045732,0.00021604326,0.00019160761],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010176845,0.000503179,0.00037496284,0.0013239669,0.0005149699,0.0010478942,0.0027708865,0.0003962473,0.000040352777],"category_scores_gemma":[0.00012899897,0.00048997084,0.00022055449,0.0008647431,0.0007079504,0.0007157458,0.0004841983,0.00094958226,0.00023103176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027533322,0.00019987869,0.0001014301,0.000067439636,0.000023354238,0.0002266496,0.0006288689,0.04651081,0.00015337326,0.6768349,0.00067563733,0.27455017],"study_design_scores_gemma":[0.0004265018,0.0005513585,0.00093520014,0.00057030225,0.000014743764,0.000018728273,1.5248635e-7,0.3876302,0.00043006532,0.60121804,0.007142054,0.001062643],"about_ca_topic_score_codex":0.000036058063,"about_ca_topic_score_gemma":0.00043327047,"teacher_disagreement_score":0.35075158,"about_ca_system_score_codex":0.00022312734,"about_ca_system_score_gemma":0.000642295,"threshold_uncertainty_score":0.9999891},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062064454,0.00019575273,0.982355,0.0013460324,0.0092357835,0.0005182301,0.00029972603,0.00020788383,0.0052209343],"genre_scores_gemma":[0.6791643,0.0003230644,0.24869299,0.010349651,0.0054910495,0.00007171518,0.0015354832,0.00038007673,0.053991675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99085796,0.000081229235,0.0013569668,0.0032415967,0.0035973224,0.00086492323],"domain_scores_gemma":[0.9927951,0.0027328555,0.0004606271,0.0035725213,0.00024498525,0.00019388141],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01004538,0.0005095815,0.00074709684,0.0029739896,0.00026337235,0.0015331794,0.0062966826,0.00022694847,0.000122403],"category_scores_gemma":[0.0032144445,0.00040315025,0.0001393746,0.0030381556,0.00085524755,0.00050534244,0.004124863,0.00071806664,0.0011085],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000117470245,0.000030270548,0.00058254565,0.000013881731,0.0000049092314,0.00024818417,0.00029919954,0.05210276,0.000027305749,0.0018603657,0.0064693303,0.9383495],"study_design_scores_gemma":[0.00054047705,0.000089937064,0.0038757566,0.0005544776,0.000009340565,0.000021599139,0.0000048425263,0.4858554,0.00010971549,0.46344432,0.044508453,0.0009856788],"about_ca_topic_score_codex":0.00011259819,"about_ca_topic_score_gemma":0.0012308103,"teacher_disagreement_score":0.9373638,"about_ca_system_score_codex":0.00019862519,"about_ca_system_score_gemma":0.00034730337,"threshold_uncertainty_score":0.99984205},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014088485,0.00048290472,0.99380165,0.0005837049,0.0010965576,0.0003688377,0.0000030715105,0.00026804756,0.003254355],"genre_scores_gemma":[0.47201896,0.0011527803,0.5172607,0.0049309116,0.0021592863,0.000066639695,0.00005170856,0.00016624441,0.002192773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602133,0.0000656849,0.00060120295,0.0014789236,0.0009356874,0.0008971602],"domain_scores_gemma":[0.99746996,0.00091257354,0.0002499456,0.0010496345,0.00013270341,0.00018519921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013282604,0.0004132728,0.0005177769,0.0012538345,0.00021062593,0.00059467374,0.0034830163,0.00025302725,0.000002857142],"category_scores_gemma":[0.0002435936,0.0003942572,0.00008734094,0.003480968,0.0004415356,0.0010739424,0.001715024,0.0008335998,0.00012408191],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014527909,0.00003897316,0.00006667101,0.000038324437,0.0000015276955,0.000037238966,0.000595379,0.05578484,0.000022224527,0.004920055,0.00006031084,0.938433],"study_design_scores_gemma":[0.00021589581,0.0001338771,0.0008768715,0.0004887896,0.0000017054139,0.00002076962,4.1032806e-7,0.8673194,0.00016911156,0.12736914,0.0028836955,0.00052030483],"about_ca_topic_score_codex":0.000035794987,"about_ca_topic_score_gemma":0.0002945714,"teacher_disagreement_score":0.9379127,"about_ca_system_score_codex":0.00062983896,"about_ca_system_score_gemma":0.001311871,"threshold_uncertainty_score":0.9998509},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004324183,0.00009284582,0.9962584,0.00019325163,0.0019505911,0.00052508723,0.000003214275,0.00029085288,0.00025333278],"genre_scores_gemma":[0.015455409,0.00002490871,0.98319143,0.00039833106,0.00047907443,0.000017319408,0.000036642537,0.000057436355,0.0003394214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971224,0.00009006285,0.00045952055,0.0011631561,0.00062083744,0.0005439961],"domain_scores_gemma":[0.9982053,0.00060907454,0.00033472534,0.0004576148,0.00030930765,0.00008397225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019323096,0.00037576965,0.0003969495,0.0006811001,0.0006259867,0.00095468067,0.0009940896,0.0002527931,0.0000037289567],"category_scores_gemma":[0.00010825337,0.00037045474,0.00011547215,0.0007796055,0.00018286963,0.0006450012,0.00038382923,0.00038401145,0.00000934567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071885324,0.000009208636,0.00020851097,0.00006052515,0.000017632578,0.00002239769,0.0006354483,0.39016968,0.0018753838,0.019695189,0.000007773051,0.58729106],"study_design_scores_gemma":[0.0002967056,0.00010327052,0.00010003104,0.0001807257,0.0000057914845,0.000021239359,3.8042836e-7,0.8216434,0.0014540269,0.1753416,0.00043081463,0.00042196468],"about_ca_topic_score_codex":0.000023295996,"about_ca_topic_score_gemma":0.00008777936,"teacher_disagreement_score":0.5868691,"about_ca_system_score_codex":0.00032022703,"about_ca_system_score_gemma":0.00035538818,"threshold_uncertainty_score":0.9998747},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031968262,0.00008903014,0.965627,0.000055736295,0.00091280113,0.0010037042,0.0000048376646,0.00009230231,0.00024632557],"genre_scores_gemma":[0.90726376,0.000024403602,0.09244646,0.000050190632,0.00010962051,0.000031003983,0.000012987306,0.00003178036,0.000029777342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591917,0.0001639636,0.0008003814,0.0017659465,0.0008185723,0.0005319402],"domain_scores_gemma":[0.99579823,0.0014791609,0.0005458849,0.0018822554,0.00022667022,0.00006782061],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004257923,0.0004354479,0.0006396748,0.0010354156,0.00024157912,0.0003328919,0.0025925739,0.00017971954,0.0000021992553],"category_scores_gemma":[0.00026869273,0.00040662466,0.00006978734,0.000941159,0.00020770016,0.00070689066,0.00095921505,0.00077776675,0.000006349617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022628397,0.0001388572,0.0008997312,0.00014273122,0.000018500074,0.00060428586,0.002911574,0.1144529,0.00012295629,0.0010017452,3.808696e-7,0.87968373],"study_design_scores_gemma":[0.00048675478,0.0013348316,0.0005557625,0.0006540028,0.00001134464,0.00013618938,0.0000154857,0.97918373,0.0008060016,0.01634011,0.000008226366,0.00046756168],"about_ca_topic_score_codex":0.0000693498,"about_ca_topic_score_gemma":0.0006992888,"teacher_disagreement_score":0.87921613,"about_ca_system_score_codex":0.00017957723,"about_ca_system_score_gemma":0.0003886729,"threshold_uncertainty_score":0.9998386},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013371067,0.00013404842,0.9933189,0.0008811944,0.0027459117,0.00096803997,0.00007701938,0.0012666073,0.00047452937],"genre_scores_gemma":[0.1719155,0.00007290524,0.82013524,0.001879272,0.0044632424,0.00043147756,0.00005107847,0.00013565375,0.0009156216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963762,0.000022847224,0.0005895388,0.0018195927,0.0006514624,0.00054034666],"domain_scores_gemma":[0.9972762,0.00046184618,0.00038565218,0.0013999238,0.0003178096,0.0001585876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004985509,0.00048632204,0.00043516114,0.00079690287,0.0005141549,0.0005963529,0.001965038,0.00053352077,0.00001235128],"category_scores_gemma":[0.00007066832,0.0004858809,0.00023536809,0.0009581068,0.00028704244,0.0006550515,0.00063350704,0.0006863372,0.00005548445],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013473509,0.000041374326,0.000019884976,0.000027704134,0.000020745287,0.000009019673,0.00026646408,0.0027380828,0.0049689007,0.008319195,0.00014420657,0.9834309],"study_design_scores_gemma":[0.0002958694,0.0005425933,0.00028538294,0.0002145249,0.000024009369,0.000033315322,6.348989e-7,0.5619169,0.023747837,0.38470864,0.027505318,0.0007249645],"about_ca_topic_score_codex":0.000077813944,"about_ca_topic_score_gemma":0.00026782908,"teacher_disagreement_score":0.982706,"about_ca_system_score_codex":0.00041517627,"about_ca_system_score_gemma":0.00021781136,"threshold_uncertainty_score":0.99975926},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024316019,0.00006625506,0.9955316,0.00065833883,0.002533722,0.00033784838,0.0000071870045,0.00029977076,0.00032210926],"genre_scores_gemma":[0.6344884,0.00007273182,0.35953015,0.0015390085,0.0027022336,0.000025494972,0.00011568765,0.000109523266,0.0014167435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642295,0.00013344879,0.00059288193,0.001405401,0.000876896,0.00056840805],"domain_scores_gemma":[0.997748,0.00028980343,0.00045879802,0.0008856441,0.00045389697,0.00016386967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012288697,0.00043261287,0.00040514275,0.0011014089,0.00061629876,0.0010191861,0.0015924962,0.0003880446,0.000034551053],"category_scores_gemma":[0.00015811258,0.0004530387,0.00021838423,0.0015677431,0.00026450522,0.0008248728,0.0005317748,0.0006879812,0.000047447327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030021026,0.000016376445,0.000031110438,0.000017734732,0.000017322473,0.000013162182,0.00041529204,0.9011028,0.00028064736,0.0009411848,0.000014132442,0.09714724],"study_design_scores_gemma":[0.00022280657,0.000054092117,0.00014735814,0.00027578595,0.000027453076,0.000019019293,0.0000016236838,0.9755814,0.0010294853,0.022170816,0.00002824416,0.00044189495],"about_ca_topic_score_codex":0.000092207054,"about_ca_topic_score_gemma":0.000115644965,"teacher_disagreement_score":0.63600147,"about_ca_system_score_codex":0.00066816487,"about_ca_system_score_gemma":0.0006577716,"threshold_uncertainty_score":0.99979216},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008627337,0.00012872987,0.99513465,0.0010326232,0.00062604214,0.0007247719,0.000005759679,0.0010631435,0.0012756471],"genre_scores_gemma":[0.025254266,0.00021916228,0.97146285,0.00091489946,0.00030348223,0.00025623597,0.000007580898,0.00008726766,0.0014942528],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963146,0.0000268087,0.0005976942,0.0017561921,0.0006963245,0.00060839526],"domain_scores_gemma":[0.996116,0.0004085672,0.0002618498,0.002892776,0.00018597493,0.00013483518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007401399,0.00042885213,0.0004334573,0.0016976575,0.00018202183,0.00031304115,0.0051398794,0.00031702925,0.000006154287],"category_scores_gemma":[0.0001499169,0.00044039005,0.000093372524,0.0017844746,0.00047963735,0.0006282464,0.0022349807,0.00093249464,0.0001490044],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003591902,0.000025607518,0.000018654871,0.000033286404,0.0000036979352,0.000091471346,0.00030341622,0.011837166,0.00049918966,0.029046295,0.00004210322,0.9580955],"study_design_scores_gemma":[0.0001846142,0.00010909327,0.00013958881,0.00027207987,0.000003160013,0.000061860235,1.3475069e-7,0.09808914,0.009341934,0.87834203,0.012633648,0.000822723],"about_ca_topic_score_codex":0.00002225758,"about_ca_topic_score_gemma":0.00014386045,"teacher_disagreement_score":0.95727277,"about_ca_system_score_codex":0.00041460796,"about_ca_system_score_gemma":0.00028733053,"threshold_uncertainty_score":0.9998048},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025150174,0.00018083896,0.9921118,0.0011596002,0.0030074862,0.0009683368,0.000010704845,0.0004738391,0.0018359122],"genre_scores_gemma":[0.24518122,0.00008774246,0.7482339,0.0021370552,0.0012762852,0.00010021263,0.000082707505,0.00014340144,0.0027574908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503016,0.00008704392,0.0008586555,0.0019768116,0.0011520705,0.00089526357],"domain_scores_gemma":[0.9950375,0.0025282134,0.00060938415,0.0011481151,0.000443605,0.00023316602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022195668,0.000605367,0.00065217615,0.0011273895,0.0005865701,0.0009419692,0.002538377,0.0004472008,0.0000126360765],"category_scores_gemma":[0.00053527247,0.00059921684,0.00024089213,0.00086970936,0.00051599415,0.0006611807,0.00077839196,0.00079109066,0.00013706283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027103244,0.000039836337,0.00003297027,0.000073283874,0.000020613512,0.000056523582,0.0026608743,0.011157178,0.0018974033,0.19421355,0.00016706043,0.7896536],"study_design_scores_gemma":[0.0012971289,0.00042587274,0.00092665944,0.00075411116,0.000021069263,0.000052485033,0.000007733663,0.79456484,0.000642557,0.17971158,0.020289375,0.0013065711],"about_ca_topic_score_codex":0.00001158262,"about_ca_topic_score_gemma":0.000079175225,"teacher_disagreement_score":0.788347,"about_ca_system_score_codex":0.00028540724,"about_ca_system_score_gemma":0.00037068516,"threshold_uncertainty_score":0.99964595},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031779264,0.000039169925,0.99525905,0.0006662058,0.0012551369,0.0012674071,0.00005274781,0.0001198986,0.0010225705],"genre_scores_gemma":[0.30108967,0.00088023575,0.662127,0.009772165,0.0039204266,0.00022329974,0.0037316647,0.000511488,0.017744007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981115,0.000010177636,0.0003421902,0.00073792716,0.0004743778,0.00032386152],"domain_scores_gemma":[0.9992012,0.00020646545,0.00012838468,0.0002811451,0.000073043506,0.00010981252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054005213,0.0002681754,0.0003084043,0.00059884443,0.00018402826,0.00008974815,0.00020479075,0.0001736947,0.000024304376],"category_scores_gemma":[0.000045208017,0.00023946255,0.00011319262,0.00021864973,0.00013813778,0.00008971506,0.00012151975,0.00030451178,0.0000332341],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008644615,0.00001917079,0.0000034137279,0.00018646914,0.000014487745,0.00006850336,0.00019570647,0.0020420798,0.0020977277,0.0001411129,0.000105895524,0.995039],"study_design_scores_gemma":[0.005979186,0.005120073,0.0005356219,0.0053868117,0.000455324,0.0007797652,0.000018419307,0.8407016,0.03427633,0.017095814,0.0874346,0.0022164849],"about_ca_topic_score_codex":0.000028998807,"about_ca_topic_score_gemma":0.0003136869,"teacher_disagreement_score":0.9928225,"about_ca_system_score_codex":0.00025549217,"about_ca_system_score_gemma":0.000114856084,"threshold_uncertainty_score":0.9765},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029603292,0.00014856407,0.991219,0.003346333,0.0009888717,0.0011121307,0.000010403149,0.0001412078,0.00007318953],"genre_scores_gemma":[0.4154909,0.0001144208,0.57256097,0.009712216,0.00094071566,0.000115909395,0.00020682416,0.00018685899,0.00067120075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973785,0.00001723724,0.00041425193,0.0010453233,0.0007438953,0.00040079228],"domain_scores_gemma":[0.99757373,0.0012892991,0.00021439049,0.00046295888,0.00032070957,0.0001389071],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007863368,0.00034548854,0.00046523684,0.0014478553,0.00022038899,0.0002543318,0.00028869903,0.00022656696,0.000014051972],"category_scores_gemma":[0.00073651754,0.00033014503,0.00009079376,0.0008760364,0.0003152268,0.00016105552,0.00028071788,0.00035930367,0.000010776096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033536555,0.000044929955,0.00008606099,0.00029026333,0.00002363781,0.000020660895,0.00093062205,0.16425596,0.0006944834,0.0007094038,0.00007268037,0.83283776],"study_design_scores_gemma":[0.00070650515,0.00035977815,0.00027425046,0.00069232297,0.00007606821,0.000021087068,7.3033243e-7,0.9752766,0.0011948922,0.020748606,0.00032203185,0.00032711873],"about_ca_topic_score_codex":0.00006542746,"about_ca_topic_score_gemma":0.000052407973,"teacher_disagreement_score":0.83251065,"about_ca_system_score_codex":0.0006138861,"about_ca_system_score_gemma":0.0005801864,"threshold_uncertainty_score":0.99991506},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003264453,0.0005082396,0.98812795,0.0039424836,0.0028930723,0.00038671837,0.0000033323865,0.00023625583,0.00063748733],"genre_scores_gemma":[0.11514208,0.00048511158,0.8426738,0.017366337,0.013527069,0.000025532034,0.0004781285,0.0004430286,0.009858913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578077,0.00011381786,0.00073409063,0.0012443921,0.0014185978,0.00070832216],"domain_scores_gemma":[0.99747103,0.0010705063,0.00026827317,0.00052877585,0.00018150748,0.00047987374],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025308616,0.00045859104,0.000852654,0.00084565714,0.00022502535,0.00032253243,0.00070609164,0.0004823319,0.000068750065],"category_scores_gemma":[0.0010124844,0.00039735116,0.00019506057,0.0008930719,0.0013769771,0.00013567517,0.0011439933,0.0025503386,0.000053099946],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018051236,0.00006735066,0.00066232774,0.00036879984,0.00004326991,0.0008794101,0.00030211895,0.00077812927,0.00005892906,0.000049184106,0.0023685235,0.9944039],"study_design_scores_gemma":[0.001256899,0.00020427389,0.008885969,0.005807078,0.000052011634,0.0008235857,9.0580386e-7,0.9789853,0.000021700751,0.0022077188,0.0013353884,0.00041914496],"about_ca_topic_score_codex":0.000044764733,"about_ca_topic_score_gemma":0.000035214856,"teacher_disagreement_score":0.99398476,"about_ca_system_score_codex":0.00035081917,"about_ca_system_score_gemma":0.00068664516,"threshold_uncertainty_score":0.9998478},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041051038,0.00009432003,0.9536043,0.003402449,0.0005317771,0.0011079578,0.000004491018,0.00012709903,0.00007661364],"genre_scores_gemma":[0.9418286,0.000029155637,0.057143666,0.00054938963,0.00021699209,0.000028121973,0.000009271224,0.00003559776,0.00015921649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814826,0.0000137975185,0.00036117248,0.0008048022,0.00038688592,0.00028510377],"domain_scores_gemma":[0.99776816,0.0011844806,0.00024358352,0.00043269576,0.0002895557,0.00008151488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010321091,0.00023368643,0.00041180413,0.00042062489,0.00015956837,0.000045973855,0.00024043155,0.0002142648,0.0000035359105],"category_scores_gemma":[0.0010744929,0.00021675935,0.00006917182,0.00022191343,0.0006042152,0.00012495769,0.00021204707,0.0004916251,0.0000021418655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065174325,0.000041570765,0.009292837,0.0021689874,0.000009904043,0.00000520642,0.0012168323,0.022906369,0.004075063,0.00020783536,0.000009019928,0.96000123],"study_design_scores_gemma":[0.00056394126,0.00043070226,0.04751344,0.00088960596,0.000037275688,0.000007354379,0.0000016323528,0.9465469,0.0018990933,0.0011731347,0.00067983876,0.0002570823],"about_ca_topic_score_codex":0.00003345982,"about_ca_topic_score_gemma":0.000018246224,"teacher_disagreement_score":0.9597441,"about_ca_system_score_codex":0.00024510862,"about_ca_system_score_gemma":0.00043570946,"threshold_uncertainty_score":0.88391894},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019494997,0.00022198765,0.8703153,0.1241169,0.0022874381,0.0009843619,0.000041221447,0.0010893029,0.0007485344],"genre_scores_gemma":[0.02237055,0.00020192673,0.96269524,0.012406676,0.00046956807,0.00008785097,0.000008108034,0.000100004356,0.0016600882],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927226,0.00008758239,0.0006295636,0.003156502,0.0021012726,0.0013024908],"domain_scores_gemma":[0.98106265,0.0012062781,0.0002866242,0.016815314,0.0003108288,0.0003182933],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0025726964,0.00078187516,0.00061712135,0.0011995572,0.0005453494,0.0014083036,0.069166884,0.0005146022,0.00002434179],"category_scores_gemma":[0.007120781,0.0006061619,0.00014817991,0.002669285,0.0010127507,0.00092502433,0.115973264,0.0013809442,0.0008513425],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020459145,0.000032176897,0.00034469727,0.00009600027,0.000027535401,0.0002911657,0.0014973473,0.00544853,0.00022613793,0.03284301,0.053921446,0.9052515],"study_design_scores_gemma":[0.00013340042,0.00025355208,0.0008402966,0.0013389488,0.000010391288,0.000071177,0.0000013807932,0.13355565,0.002961473,0.84826887,0.011487157,0.0010776846],"about_ca_topic_score_codex":0.00014419807,"about_ca_topic_score_gemma":0.0004369194,"teacher_disagreement_score":0.9041738,"about_ca_system_score_codex":0.00058884773,"about_ca_system_score_gemma":0.0004874107,"threshold_uncertainty_score":0.9999266},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013040227,0.0005600005,0.993774,0.0024985203,0.0013208211,0.0009515616,0.000003874983,0.00030674433,0.0004540929],"genre_scores_gemma":[0.31484747,0.00047774543,0.64449507,0.009661228,0.015112411,0.00048780476,0.0006125849,0.00064766983,0.01365801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614865,0.000027734723,0.00066587125,0.0012604754,0.0010528952,0.00084436743],"domain_scores_gemma":[0.99765813,0.00082790933,0.00032606692,0.00052883325,0.00028652546,0.00037254614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024224084,0.0004105286,0.00059037737,0.00048050698,0.0006138397,0.0002872037,0.00069926045,0.00032607082,0.00003495494],"category_scores_gemma":[0.0012430296,0.0003768586,0.00023681315,0.00040344492,0.00094414206,0.00014732766,0.0004919524,0.0021272365,0.000038307215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001547221,0.000025183295,0.0044349944,0.0002305939,0.0000234561,0.00007512211,0.00009549021,0.034234654,0.00037595248,0.0006489622,0.000048219634,0.9597919],"study_design_scores_gemma":[0.0010181572,0.00006422727,0.0019127041,0.00094398303,0.000054888882,0.00014182126,4.903545e-7,0.98162013,0.000013396886,0.0038450805,0.010010925,0.0003741906],"about_ca_topic_score_codex":0.00003892143,"about_ca_topic_score_gemma":0.000018367538,"teacher_disagreement_score":0.9594177,"about_ca_system_score_codex":0.00025215943,"about_ca_system_score_gemma":0.0005878276,"threshold_uncertainty_score":0.99986833},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004536336,0.00068931485,0.9900912,0.00048774952,0.002356012,0.0011033681,0.00020157151,0.00009750714,0.00043691194],"genre_scores_gemma":[0.42850518,0.00005163427,0.5611722,0.003739403,0.002081355,0.00008221548,0.0009079352,0.00025551594,0.003204561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969505,0.000028245086,0.00056850206,0.0010395473,0.00062879804,0.0007844287],"domain_scores_gemma":[0.9967909,0.001717614,0.0003992838,0.0006423611,0.0002337669,0.00021607941],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075976836,0.00047973488,0.0008591502,0.000385573,0.00023748052,0.00013811549,0.00071141165,0.00033233874,0.000010069009],"category_scores_gemma":[0.00038488102,0.0004118525,0.00032459438,0.000246493,0.00032569168,0.00010189234,0.00027250187,0.00060319,0.0000058274804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015441885,0.0036224632,0.024260709,0.0059380927,0.00033897246,0.00029248194,0.0025294868,0.084914535,0.024619201,0.0011303879,0.026234748,0.8245747],"study_design_scores_gemma":[0.011993999,0.000638939,0.00088812556,0.0028088752,0.00021825712,0.0000023047144,0.0000013533626,0.93553317,0.009385783,0.012488436,0.025273632,0.0007671188],"about_ca_topic_score_codex":0.00004690506,"about_ca_topic_score_gemma":0.000010202201,"teacher_disagreement_score":0.85061866,"about_ca_system_score_codex":0.00019315863,"about_ca_system_score_gemma":0.0003519324,"threshold_uncertainty_score":0.99983335},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070483913,0.00016129772,0.99073726,0.000007772994,0.0004155237,0.000432436,0.000048566333,0.0000720366,0.0010767367],"genre_scores_gemma":[0.9972389,0.000015055613,0.0025595475,0.000007978949,0.00008191457,0.000020329726,0.000030509706,0.000023383956,0.00002240831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846375,0.000028790686,0.0006607247,0.0002820646,0.00035031978,0.00021432998],"domain_scores_gemma":[0.9989303,0.00041514137,0.00024954253,0.00018899191,0.00018954488,0.000026530088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039444646,0.0002062344,0.00037119523,0.0005507778,0.000025113186,0.000045501878,0.00021812138,0.00017996543,0.0000061488204],"category_scores_gemma":[0.000053332697,0.00020515456,0.000043314514,0.0004475364,0.000059685215,0.00018348661,0.000028762835,0.0002594748,9.717604e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052381793,0.0000034646698,0.0012508968,0.00014489153,0.00001874718,0.0000048762636,0.0002661114,0.98840564,0.0010089242,0.00084355124,0.0000035932383,0.008044033],"study_design_scores_gemma":[0.0003425414,0.00016125817,0.00019957822,0.0006611154,0.000011734652,0.0000049828773,0.000009212391,0.99264044,0.005043583,0.00077580963,9.4395483e-7,0.00014881372],"about_ca_topic_score_codex":0.000886378,"about_ca_topic_score_gemma":0.0013578762,"teacher_disagreement_score":0.9901905,"about_ca_system_score_codex":0.00029789968,"about_ca_system_score_gemma":0.00013209232,"threshold_uncertainty_score":0.836596},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007216207,0.00008473862,0.995428,0.00017599508,0.0018930581,0.0005819503,0.0012076715,0.0001752719,0.00038112345],"genre_scores_gemma":[0.19568685,0.00053815905,0.78218055,0.0033240523,0.0025306642,0.00018906758,0.014472858,0.0002138099,0.000863993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972884,0.00003988132,0.0005541319,0.0011026391,0.0006297018,0.00038522072],"domain_scores_gemma":[0.9976263,0.00043231927,0.00038375283,0.00079424185,0.00065923535,0.00010412116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007237012,0.00034522,0.00040692836,0.0009630588,0.00022157507,0.00019111221,0.0010922313,0.00028039125,0.000019666992],"category_scores_gemma":[0.0000935139,0.00034606227,0.0001298095,0.0005011843,0.00020902342,0.00101814,0.00034403257,0.00039187304,0.000045699922],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014413627,0.000031591826,0.0000010907646,0.0002071034,0.000011556429,0.00001375882,0.0005054177,0.013023132,0.00019345862,0.0018321259,0.00040836714,0.983758],"study_design_scores_gemma":[0.00044015257,0.00025213003,0.000008836732,0.0005017158,0.000025704461,0.000025961986,0.0000018960603,0.7294721,0.0062725884,0.260774,0.001722621,0.0005022987],"about_ca_topic_score_codex":0.00005373134,"about_ca_topic_score_gemma":0.00022914792,"teacher_disagreement_score":0.9832557,"about_ca_system_score_codex":0.00019300854,"about_ca_system_score_gemma":0.0003330159,"threshold_uncertainty_score":0.99989915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056565655,0.00018088064,0.9916307,0.000030505285,0.00039814055,0.00037251174,0.000104268365,0.00017769722,0.0014487555],"genre_scores_gemma":[0.99651396,0.000059061094,0.0029397323,0.000047432488,0.00007303196,0.000043433036,0.00005179136,0.000058973008,0.00021255607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983704,0.000011900994,0.0004127805,0.00054538104,0.0003067705,0.0003527602],"domain_scores_gemma":[0.9986837,0.0005443436,0.00006641161,0.00030314055,0.00033445028,0.00006797055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005575138,0.0003468209,0.00039902993,0.0005454731,0.00008038506,0.00021905387,0.00026034165,0.00036377998,0.0000010450103],"category_scores_gemma":[0.0001353607,0.0003021823,0.000020560929,0.0010039444,0.0003985019,0.0007417489,0.000108791595,0.00037130245,5.005743e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010031845,0.000009615461,0.00011682525,0.0001697092,0.00001094419,0.00006936354,0.00029213127,0.96523815,9.805009e-7,0.00096070336,0.000006843739,0.03311467],"study_design_scores_gemma":[0.00043899615,0.00006388232,0.00013248269,0.00064966374,0.0000070435412,0.0001536483,0.0000029150642,0.9762365,0.000103306535,0.02171827,0.000038954422,0.00045431868],"about_ca_topic_score_codex":0.000046501456,"about_ca_topic_score_gemma":0.0008966625,"teacher_disagreement_score":0.9908574,"about_ca_system_score_codex":0.00020485757,"about_ca_system_score_gemma":0.00013585559,"threshold_uncertainty_score":0.999943},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3872956,0.00047175676,0.59136325,0.005456237,0.0019167225,0.001772123,0.00008232591,0.00016565948,0.011476293],"genre_scores_gemma":[0.89699197,0.00014343354,0.09486607,0.0019046331,0.00023821763,0.000011419437,0.00003610983,0.00005821012,0.0057499413],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99833846,0.000009093348,0.00036742326,0.000560681,0.0004558409,0.0002685174],"domain_scores_gemma":[0.9992311,0.000111471556,0.00014197658,0.00036330326,0.0000919061,0.00006022364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019740226,0.00025686726,0.0004353378,0.0007391304,0.00005843697,0.000026407788,0.00022366375,0.00013651945,0.000045810903],"category_scores_gemma":[0.000024363591,0.00022230975,0.000053652617,0.0001779469,0.0005223344,0.00010174366,0.0006464628,0.0004007945,0.00001133642],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005911924,0.000097537646,0.39670935,0.0036404505,0.00044912574,0.0015360588,0.032049388,0.050067037,0.0392125,0.0024730014,0.004336755,0.4688376],"study_design_scores_gemma":[0.0070546526,0.0015119149,0.48040062,0.01050246,0.0004909677,0.0012561821,0.00018733199,0.45134822,0.028841047,0.013852146,0.001425485,0.0031289672],"about_ca_topic_score_codex":0.00004209337,"about_ca_topic_score_gemma":0.00006070007,"teacher_disagreement_score":0.50969636,"about_ca_system_score_codex":0.00014807867,"about_ca_system_score_gemma":0.00008232426,"threshold_uncertainty_score":0.90655285},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93056965,0.00027698916,0.061727345,0.0016618962,0.0010750071,0.0015300538,0.0005590328,0.0010767562,0.0015232625],"genre_scores_gemma":[0.9989815,0.00009282323,0.00036190954,0.00029485105,0.00019930217,0.000009318914,0.00001598476,0.0000070187443,0.00003728663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974063,0.000029524826,0.000511521,0.00085872435,0.00050613016,0.00068778225],"domain_scores_gemma":[0.99859,0.00057564763,0.00027693762,0.0002865186,0.00016272759,0.00010818486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066580356,0.00044204044,0.0006698693,0.00019324291,0.00020988038,0.0000661229,0.0011340099,0.0005292212,0.00008053498],"category_scores_gemma":[0.00009487412,0.00018080152,0.00031923392,0.00041828194,0.00044025396,0.000105149426,0.00031317136,0.0007316527,0.00009243915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031617182,0.00014525834,0.0054925247,0.000045175297,0.00010211582,0.00013086249,0.00014601607,0.1411963,0.012797394,0.0037490372,0.000014880817,0.83586425],"study_design_scores_gemma":[0.0017389999,0.0048595346,0.02357937,0.0012899459,0.00009225102,0.000057427344,0.0000017995793,0.85518193,0.00097482506,0.110396855,0.000050516344,0.0017765337],"about_ca_topic_score_codex":0.00013409104,"about_ca_topic_score_gemma":0.0007563423,"teacher_disagreement_score":0.8340877,"about_ca_system_score_codex":0.00012907834,"about_ca_system_score_gemma":0.000058378442,"threshold_uncertainty_score":0.73728716},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006938996,0.000046485588,0.99100363,0.0032123593,0.0021042316,0.0006446432,0.0000053841077,0.0004736311,0.0024402572],"genre_scores_gemma":[0.36681208,0.000041057025,0.59577316,0.03369866,0.0021290486,0.00007991973,0.000026921056,0.00028241545,0.001156778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941842,0.000058115325,0.00057488744,0.0023617765,0.0017219966,0.0010990454],"domain_scores_gemma":[0.9965745,0.00069347984,0.00021572814,0.0020193052,0.00022773602,0.00026922204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082591927,0.00073965645,0.00065481354,0.0008968219,0.0003744998,0.0005510485,0.0029367718,0.00033737376,0.000012891186],"category_scores_gemma":[0.00004171856,0.00059423555,0.00016669589,0.0015897241,0.00041075904,0.00051367126,0.00041715387,0.0012997945,0.00007272399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031887277,0.000032071646,0.00005955293,0.000035083005,0.000008771393,0.0002050476,0.00044709706,0.76391965,0.000041341085,0.014913095,0.00006549998,0.2202409],"study_design_scores_gemma":[0.00053348846,0.0006555646,0.00012867671,0.000940998,0.000009371373,0.00003447357,8.234941e-8,0.97576344,0.00017895563,0.018218923,0.0028171118,0.0007189201],"about_ca_topic_score_codex":0.000025102692,"about_ca_topic_score_gemma":0.00014972889,"teacher_disagreement_score":0.39523047,"about_ca_system_score_codex":0.00021897828,"about_ca_system_score_gemma":0.0007314687,"threshold_uncertainty_score":0.9996509},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008481377,0.00003243622,0.95644796,0.00053406344,0.006364339,0.0014254154,0.000040534072,0.00053706067,0.033770032],"genre_scores_gemma":[0.6897083,0.000019086736,0.19500124,0.0022290968,0.0120287575,0.00086886255,0.00023198778,0.0009852563,0.09892743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715114,0.000048088343,0.00047109762,0.0011126453,0.0005439824,0.00067305204],"domain_scores_gemma":[0.99833024,0.00051096483,0.00031379014,0.00042497975,0.00030627887,0.000113741684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006580848,0.00043117144,0.0006116237,0.00045761865,0.00066355505,0.0002720649,0.00069965655,0.00043364335,0.00015391113],"category_scores_gemma":[0.000036179652,0.00037959794,0.00016686395,0.00035057953,0.00033708158,0.0000794996,0.00019256536,0.00055608613,0.00039133817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036544705,0.00024947684,0.0003059794,0.00033711098,0.00025071698,0.00042442014,0.01875498,0.7837094,0.00084101764,0.07323106,0.002706277,0.118824124],"study_design_scores_gemma":[0.009373604,0.0028909796,0.0038081235,0.0062879114,0.0006355849,0.00075998413,0.00018379634,0.95927405,0.0015938969,0.004599498,0.0033832518,0.0072093145],"about_ca_topic_score_codex":0.00022366577,"about_ca_topic_score_gemma":0.00012744953,"teacher_disagreement_score":0.7614467,"about_ca_system_score_codex":0.0005165041,"about_ca_system_score_gemma":0.00028236842,"threshold_uncertainty_score":0.9998656},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006548629,0.00010449431,0.9937625,0.001724335,0.002893398,0.00070277293,0.000013691188,0.00023451023,0.0004988467],"genre_scores_gemma":[0.04982485,0.000039717404,0.94401914,0.0028542944,0.0010453593,0.00006744072,0.000048762773,0.00005595357,0.0020445099],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966405,0.000022426577,0.00048229823,0.0015056522,0.0008335274,0.00051558035],"domain_scores_gemma":[0.99772316,0.00075947534,0.00017214609,0.00091016584,0.0002927063,0.00014232981],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012392824,0.0003789586,0.00036639086,0.000767067,0.00026903668,0.00040598388,0.0018395616,0.00020073912,0.000008582763],"category_scores_gemma":[0.00008695233,0.00036512772,0.00018080446,0.00071091304,0.00023921319,0.00042711638,0.00050996366,0.00033395563,0.00005098496],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071497716,0.000022694336,0.000010109556,0.00006062841,0.000012155978,0.000013427888,0.00035039912,0.15425949,0.00018612394,0.036542136,0.00009236556,0.8084433],"study_design_scores_gemma":[0.00027530568,0.00016176293,0.0001732525,0.00011668433,0.000006555048,0.000011338751,6.544332e-8,0.6441999,0.0014276722,0.35100225,0.0021812401,0.0004439479],"about_ca_topic_score_codex":0.0000064282085,"about_ca_topic_score_gemma":0.00003925361,"teacher_disagreement_score":0.8079994,"about_ca_system_score_codex":0.0003055749,"about_ca_system_score_gemma":0.0005793872,"threshold_uncertainty_score":0.9998801},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028862267,0.00062807545,0.995524,0.00056023477,0.0017067604,0.00041597273,0.0000042006054,0.00028123482,0.0008506672],"genre_scores_gemma":[0.13661118,0.0023326352,0.85170645,0.00123139,0.0023515811,0.00011123258,0.00007311911,0.0002582639,0.0053241253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949484,0.0001885775,0.00080041925,0.0013577363,0.0016941098,0.0010107826],"domain_scores_gemma":[0.99305123,0.0020746163,0.0004446929,0.003633046,0.0005852598,0.00021117758],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0022056657,0.00046146754,0.0007340455,0.0012727255,0.00023548411,0.00043119612,0.011931104,0.00048564127,0.0000052287583],"category_scores_gemma":[0.00013180754,0.00045153682,0.00016308266,0.004330717,0.0012762863,0.00051866216,0.0059989626,0.0016728457,0.000039947594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022325744,0.000029453544,0.000029478213,0.000039879855,0.000010918781,0.000029994919,0.00025270967,0.3288305,0.000014145185,0.0040783803,0.0003443384,0.66633797],"study_design_scores_gemma":[0.00016766693,0.0000787027,0.00012978115,0.00043840782,0.0000029266978,0.0000155416,1.1804609e-7,0.9622504,0.00017737498,0.035892602,0.00044327744,0.0004031881],"about_ca_topic_score_codex":0.000026777885,"about_ca_topic_score_gemma":0.000085721105,"teacher_disagreement_score":0.6659348,"about_ca_system_score_codex":0.00052466337,"about_ca_system_score_gemma":0.0020192885,"threshold_uncertainty_score":0.99979365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022016928,0.000017471395,0.97576433,0.00011155646,0.001125176,0.00046917703,0.00012996331,0.000043064865,0.00032233185],"genre_scores_gemma":[0.98162645,0.00016043795,0.017257255,0.00031919815,0.00018796847,0.000012687827,0.000015997717,0.000035158453,0.00038484146],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975533,0.000020044354,0.00036597264,0.0013172923,0.0004153363,0.0003280609],"domain_scores_gemma":[0.99782044,0.00085130945,0.00019419548,0.0009249837,0.0001323872,0.00007671099],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013007493,0.00026355108,0.000330154,0.00040560137,0.00023168293,0.00008566572,0.0009736378,0.00016110715,0.000016421627],"category_scores_gemma":[0.0006366674,0.00025575358,0.000060111262,0.00019755428,0.00058873603,0.0005179843,0.0005537273,0.00034743795,0.000010956275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047152906,0.000023728075,0.000003690393,0.000070805865,0.000005088346,0.000016548247,0.0043859547,0.08769796,0.8351089,0.0005264293,0.0000070779915,0.07210666],"study_design_scores_gemma":[0.0001695681,0.000077019584,0.000005627222,0.00020549844,0.0000101197365,0.000016264261,0.00001607572,0.89047456,0.105059676,0.0035942951,0.00010655177,0.0002647649],"about_ca_topic_score_codex":0.000030974745,"about_ca_topic_score_gemma":0.000046227095,"teacher_disagreement_score":0.9596095,"about_ca_system_score_codex":0.00006974104,"about_ca_system_score_gemma":0.00010083195,"threshold_uncertainty_score":0.99998945},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023804796,0.00016371286,0.99378157,0.0011733116,0.0012166545,0.0008288608,0.000004677661,0.00071190577,0.002095501],"genre_scores_gemma":[0.018763147,0.000024882773,0.9724668,0.0013165763,0.00044726284,0.00009847631,0.000025134785,0.00014795353,0.006709743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99472207,0.000089753645,0.0007303903,0.0022424762,0.0010202472,0.0011950402],"domain_scores_gemma":[0.9957452,0.001748549,0.0006467474,0.0011451368,0.00043235184,0.00028205698],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0026548263,0.0008160163,0.0011684533,0.0011684088,0.00089347427,0.0012770972,0.0027690341,0.00037463167,0.000028066088],"category_scores_gemma":[0.00048972404,0.0006809567,0.00038781582,0.0010853446,0.00060547,0.0008188266,0.0008897978,0.001414753,0.000032992575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063884516,0.000022843502,0.000008667208,0.000107924774,0.00040357767,0.00010280282,0.0058162897,0.33041427,0.0015656563,0.053741157,0.000025995936,0.60772693],"study_design_scores_gemma":[0.0008371618,0.00038738077,0.000015394817,0.00027423893,0.000118783944,0.00006308146,0.0000048678385,0.9515267,0.0003127614,0.03962925,0.005877062,0.0009532977],"about_ca_topic_score_codex":0.0000114769755,"about_ca_topic_score_gemma":0.000056415207,"teacher_disagreement_score":0.62111247,"about_ca_system_score_codex":0.00022676107,"about_ca_system_score_gemma":0.00076449086,"threshold_uncertainty_score":0.9997597},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005552752,0.000020712356,0.990507,0.00077822607,0.0006910061,0.0007603718,0.000015913334,0.0003149233,0.0013590675],"genre_scores_gemma":[0.9871478,0.000015866632,0.011588478,0.00027458064,0.00026835414,0.000026400832,0.000011729418,0.000032485885,0.0006342948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963936,0.000071512055,0.000630825,0.0015007757,0.00084157696,0.0005617017],"domain_scores_gemma":[0.9968604,0.0009044154,0.00027519753,0.0014822369,0.00018596085,0.0002918241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011927184,0.00046105462,0.0006084354,0.0008121282,0.00045413125,0.0008736751,0.002125547,0.000082290804,0.00000562496],"category_scores_gemma":[0.00014996727,0.00043444647,0.00006011866,0.0009136338,0.00046397324,0.0007710344,0.0023951912,0.000882613,0.000062351566],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003904204,0.0006994471,0.0062650344,0.00006584249,0.00017842618,0.000089544934,0.0049213874,0.016916757,0.0003812079,0.090194814,0.00030417825,0.8799443],"study_design_scores_gemma":[0.0024583426,0.007454497,0.13754545,0.0012799565,0.00012599089,0.00010341406,0.000012719711,0.6773926,0.0003992511,0.16665758,0.0035027522,0.003067426],"about_ca_topic_score_codex":0.00050568394,"about_ca_topic_score_gemma":0.0015505875,"teacher_disagreement_score":0.98159504,"about_ca_system_score_codex":0.00028809396,"about_ca_system_score_gemma":0.00028246408,"threshold_uncertainty_score":0.99981076},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014088485,0.00048290472,0.99380165,0.0005837049,0.0010965576,0.0003688377,0.0000030715105,0.00026804756,0.003254355],"genre_scores_gemma":[0.47201896,0.0011527803,0.5172607,0.0049309116,0.0021592863,0.000066639695,0.00005170856,0.00016624441,0.002192773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602133,0.0000656849,0.00060120295,0.0014789236,0.0009356874,0.0008971602],"domain_scores_gemma":[0.99746996,0.00091257354,0.0002499456,0.0010496345,0.00013270341,0.00018519921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013282604,0.0004132728,0.0005177769,0.0012538345,0.00021062593,0.00059467374,0.0034830163,0.00025302725,0.000002857142],"category_scores_gemma":[0.0002435936,0.0003942572,0.00008734094,0.003480968,0.0004415356,0.0010739424,0.001715024,0.0008335998,0.00012408191],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014527909,0.00003897316,0.00006667101,0.000038324437,0.0000015276955,0.000037238966,0.000595379,0.05578484,0.000022224527,0.004920055,0.00006031084,0.938433],"study_design_scores_gemma":[0.00021589581,0.0001338771,0.0008768715,0.0004887896,0.0000017054139,0.00002076962,4.1032806e-7,0.8673194,0.00016911156,0.12736914,0.0028836955,0.00052030483],"about_ca_topic_score_codex":0.000035794987,"about_ca_topic_score_gemma":0.0002945714,"teacher_disagreement_score":0.9379127,"about_ca_system_score_codex":0.00062983896,"about_ca_system_score_gemma":0.001311871,"threshold_uncertainty_score":0.9998509},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007637326,0.0001288298,0.9904323,0.0003957135,0.0009410379,0.0013596633,0.0000030381282,0.0009632484,0.0057684914],"genre_scores_gemma":[0.007973668,0.0000796168,0.98685265,0.00082157634,0.0003755478,0.00018986865,0.000039183746,0.000101104626,0.0035667864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99459255,0.000051927913,0.000697609,0.0023007651,0.0011916831,0.0011654389],"domain_scores_gemma":[0.9972034,0.000423911,0.0003111584,0.0015045571,0.00039259158,0.00016436006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016229305,0.0007455401,0.0006669253,0.001061509,0.00043592678,0.00095847575,0.0042183762,0.00034874736,0.000026242276],"category_scores_gemma":[0.00010718663,0.0006971804,0.00022658789,0.0007174458,0.0005713882,0.00092194806,0.0020830336,0.0009045433,0.00008791772],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017542767,0.00009784044,0.00000895084,0.00031427282,0.000047265323,0.00006532,0.0015973344,0.013077244,0.0077967453,0.020327117,0.00015126636,0.9564991],"study_design_scores_gemma":[0.0004095093,0.0003790179,0.0000076589395,0.00025035295,0.0000137026545,0.0000144943915,4.669108e-7,0.8602879,0.04454212,0.09153997,0.0015503935,0.001004414],"about_ca_topic_score_codex":0.0000088375955,"about_ca_topic_score_gemma":0.000009490984,"teacher_disagreement_score":0.9554947,"about_ca_system_score_codex":0.00047268166,"about_ca_system_score_gemma":0.00028673667,"threshold_uncertainty_score":0.99954796},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019079377,0.00013662539,0.9955577,0.0013271838,0.0013668019,0.0006712507,0.000028011447,0.00018709239,0.00053449004],"genre_scores_gemma":[0.18091787,0.00018794052,0.8122844,0.0024851498,0.0012709007,0.00030524828,0.00019336658,0.00013622122,0.0022188604],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974371,0.000014743018,0.00037738445,0.0011592743,0.000575361,0.00043608883],"domain_scores_gemma":[0.99813855,0.00055347645,0.00022487756,0.00076949986,0.00014972013,0.00016386778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062953436,0.00032735502,0.00030239226,0.0006449991,0.0003336841,0.0003534294,0.0018016143,0.0002110039,0.0000040221375],"category_scores_gemma":[0.0001126184,0.00031117405,0.00007958985,0.0004923466,0.00034758882,0.0003293357,0.0007847413,0.00035429833,0.000009746446],"study_design_candidate":"design_other","study_design_consensus":null,"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.3454086e-7,0.000026255839,0.000027928289,0.000036237274,0.000016214428,0.0000011703693,0.004645129,0.0034885684,0.000045245222,0.096880235,0.00010996588,0.8947222],"study_design_scores_gemma":[0.0002883188,0.00019239966,0.0013302449,0.0003688683,0.00003451993,0.000028638822,0.000009730629,0.2910734,0.0007104329,0.6967811,0.008146004,0.0010363286],"about_ca_topic_score_codex":0.000017313932,"about_ca_topic_score_gemma":0.00006634393,"teacher_disagreement_score":0.8936859,"about_ca_system_score_codex":0.00014048858,"about_ca_system_score_gemma":0.0007890657,"threshold_uncertainty_score":0.999934},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012467185,0.0003201344,0.6753086,0.0058078957,0.038642675,0.0019651256,0.00020265367,0.0005777233,0.264708],"genre_scores_gemma":[0.98086816,0.000035818008,0.0009162381,0.00039894696,0.003425351,0.000030543684,0.00001550612,0.00007778018,0.014231643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829346,0.00004160278,0.00026933322,0.00052982295,0.00052866724,0.00033708717],"domain_scores_gemma":[0.99789166,0.0012182858,0.00020166727,0.00047628212,0.00012764455,0.00008443961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019683484,0.00026545525,0.00032778364,0.0002723999,0.000328759,0.000088503606,0.00074058684,0.00020779394,0.0003147573],"category_scores_gemma":[0.00011513581,0.00016836435,0.00031342197,0.0002354564,0.0005324928,0.00006366543,0.00019111729,0.0006749575,0.00034579754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030729568,0.00040094327,0.00022224388,0.000014133475,0.00016429945,0.000064295135,0.0132683655,0.101248585,0.0012682357,0.06488826,0.006881465,0.8112719],"study_design_scores_gemma":[0.0027021272,0.0038807443,0.07807482,0.0032560676,0.00012445597,0.00010533658,0.000039927403,0.045033008,0.0036994074,0.84681463,0.012966173,0.0033033127],"about_ca_topic_score_codex":0.00005796882,"about_ca_topic_score_gemma":0.000026924132,"teacher_disagreement_score":0.968401,"about_ca_system_score_codex":0.00014011201,"about_ca_system_score_gemma":0.00018674743,"threshold_uncertainty_score":0.68656987},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19733082,0.23025644,0.2216881,0.19909984,0.074595965,0.013222596,0.00006283967,0.0028572765,0.060886126],"genre_scores_gemma":[0.98669684,0.0044916878,0.0025415407,0.0033332608,0.0004085127,0.00003861534,0.000004780224,0.00007396523,0.0024107941],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9981775,0.000058279154,0.00037633852,0.0008166297,0.00024273452,0.0003285082],"domain_scores_gemma":[0.99863255,0.0006979251,0.00025248693,0.00024014819,0.000082911385,0.00009395859],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043418148,0.00030134537,0.0005593195,0.0005880688,0.00019223585,0.000080762315,0.00018789544,0.00015864245,0.000016954049],"category_scores_gemma":[0.000074800686,0.00024609925,0.000032652068,0.00012611804,0.00049026444,0.00015657695,0.00018587439,0.0006147044,0.000014157127],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012606614,0.00006041799,0.0035495395,0.0003504082,0.00012288375,0.00012650243,0.07209262,0.0006769468,0.000004050488,0.020989861,0.000044303943,0.9018564],"study_design_scores_gemma":[0.019170253,0.012143464,0.6183328,0.048322946,0.00014228892,0.0011302609,0.0065475632,0.010778238,0.00007161285,0.25453976,0.020892845,0.007927988],"about_ca_topic_score_codex":0.0002678567,"about_ca_topic_score_gemma":0.005959009,"teacher_disagreement_score":0.8939284,"about_ca_system_score_codex":0.00015834147,"about_ca_system_score_gemma":0.000057743015,"threshold_uncertainty_score":0.9999991},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008965445,0.00013258557,0.9951405,0.0010922515,0.000839685,0.0008138583,0.000040073206,0.00053280813,0.0013186076],"genre_scores_gemma":[0.05616044,0.000019621271,0.94148153,0.0007438355,0.0006090126,0.000099362864,0.00006262852,0.00007186899,0.00075169664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964741,0.00003251271,0.00045731093,0.00162566,0.0006644436,0.000745967],"domain_scores_gemma":[0.99729025,0.0005190783,0.00026828167,0.0015039548,0.00027705426,0.00014139853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001266573,0.0004381765,0.00041491102,0.0007068659,0.00046930966,0.0007271974,0.0026156357,0.0002632142,0.000009425294],"category_scores_gemma":[0.00014389279,0.00043490122,0.0001386921,0.0005873291,0.00015534056,0.00080218667,0.0011536696,0.0006617069,0.00007055571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003336412,0.0000329451,0.0000052002833,0.000057210502,0.00001405043,0.00002296615,0.0024741478,0.61354303,0.0037286114,0.19192052,0.00009837249,0.18809958],"study_design_scores_gemma":[0.00025172948,0.00005427451,0.000010341807,0.00007897933,0.0000063690695,0.000008752293,3.8175557e-7,0.922767,0.0009109441,0.07527845,0.00020442618,0.0004283814],"about_ca_topic_score_codex":0.000081847626,"about_ca_topic_score_gemma":0.00009217717,"teacher_disagreement_score":0.30922392,"about_ca_system_score_codex":0.0002379413,"about_ca_system_score_gemma":0.00033639438,"threshold_uncertainty_score":0.9998103},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002719386,0.0021630346,0.98300725,0.001403126,0.0064063463,0.0003946003,0.00065638596,0.0001175854,0.0031322553],"genre_scores_gemma":[0.7354241,0.0021798103,0.24047899,0.003446873,0.01048097,0.00009174383,0.0024253651,0.00037852587,0.0050936486],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680734,0.000016653012,0.00068968436,0.0017980263,0.00022639388,0.00046193448],"domain_scores_gemma":[0.99771345,0.00041051194,0.00037684754,0.0013399003,0.000090967056,0.00006832221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018665481,0.0003095699,0.00047746184,0.0012540105,0.00020167789,0.00044591335,0.0025551096,0.0003249207,0.000066825094],"category_scores_gemma":[0.00078306394,0.0003637117,0.00007732743,0.0014573601,0.00083458266,0.00047402928,0.0017841897,0.000592026,0.000127602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005273285,0.00037888702,0.07881616,0.0004113564,0.00010900587,0.00007766251,0.005337119,0.031027185,0.000004286433,0.266049,0.010700953,0.60703564],"study_design_scores_gemma":[0.00019276026,0.00003741683,0.02232525,0.00012806653,0.000003357275,0.0000064870155,2.3851382e-7,0.19513917,0.0000016706723,0.76969844,0.012047743,0.00041938046],"about_ca_topic_score_codex":0.000045031702,"about_ca_topic_score_gemma":0.00039019904,"teacher_disagreement_score":0.7425283,"about_ca_system_score_codex":0.00024992984,"about_ca_system_score_gemma":0.0003042796,"threshold_uncertainty_score":0.9998815},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000077490484,0.00009130914,0.9930726,0.00025849248,0.0043856394,0.00084808684,0.0000043355453,0.00022289588,0.0010391087],"genre_scores_gemma":[0.38341308,0.000041278563,0.6111177,0.0012661171,0.0016918497,0.00022506838,0.000025565632,0.00013491379,0.0020844357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967537,0.00003441817,0.00070514233,0.0013532306,0.0004930762,0.0006604563],"domain_scores_gemma":[0.99785674,0.0006679019,0.0003413001,0.0008003432,0.00024248945,0.00009123631],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017514171,0.0003963621,0.00049412245,0.0011387826,0.0002124775,0.0005537704,0.0018180223,0.0003213288,0.0000025748311],"category_scores_gemma":[0.00014491871,0.00037129692,0.00016175598,0.00092191034,0.00016794198,0.0005330291,0.00055409153,0.0005494302,0.000012949904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012505271,0.000027109605,0.00005125366,0.00017512185,0.000012732359,0.000033085984,0.001743576,0.07286763,0.00031388504,0.13384685,0.00006484861,0.7908514],"study_design_scores_gemma":[0.00026293003,0.00012241329,0.000027320018,0.0004936004,0.0000020690663,0.00002195491,4.0758374e-7,0.8589591,0.00014978772,0.13932198,0.00027870742,0.0003597603],"about_ca_topic_score_codex":0.000052465526,"about_ca_topic_score_gemma":0.00024885283,"teacher_disagreement_score":0.79049164,"about_ca_system_score_codex":0.00025354332,"about_ca_system_score_gemma":0.00025893285,"threshold_uncertainty_score":0.9998739},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048551727,0.00003769478,0.9968494,0.00040863155,0.000492407,0.00084121706,0.000049946015,0.0002905896,0.0009815211],"genre_scores_gemma":[0.25987998,0.000056536395,0.735906,0.0009109695,0.00073075097,0.00052450446,0.0001307003,0.00021339967,0.0016471263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891484,0.0000013875805,0.00023936007,0.00033931222,0.00025225416,0.00025281997],"domain_scores_gemma":[0.99921,0.00026942178,0.000043404652,0.0002995084,0.0001429261,0.000034737684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029457815,0.0002008471,0.00016245218,0.00019492014,0.00013781684,0.00010411702,0.00039418254,0.00009516904,0.000011684137],"category_scores_gemma":[0.000011298476,0.00013993646,0.000041031315,0.0002970962,0.00036095132,0.00008125314,0.000026040638,0.00034266838,0.000009264311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002775271,0.0000027252213,0.000055773024,0.00011321968,0.000031526615,0.0000059082085,0.00050459744,0.7330113,0.000075149896,0.022209173,0.000026836142,0.243961],"study_design_scores_gemma":[0.00042205732,0.000095190924,0.0009008486,0.00052912574,0.00003597927,0.000021484831,0.0000019695,0.9495058,0.0011716546,0.042447984,0.0042824647,0.0005854315],"about_ca_topic_score_codex":0.000006247452,"about_ca_topic_score_gemma":0.00020503688,"teacher_disagreement_score":0.2609434,"about_ca_system_score_codex":0.000072793846,"about_ca_system_score_gemma":0.0001329881,"threshold_uncertainty_score":0.5706443},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010131311,0.00018035632,0.9919426,0.0009408117,0.0025364023,0.0004785121,0.00000843739,0.0004070777,0.002492689],"genre_scores_gemma":[0.82864577,0.00024836086,0.16302833,0.004391628,0.000746822,0.000030812465,0.000007231131,0.00013592918,0.0027651077],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99476516,0.00006124211,0.0006589573,0.0024601421,0.0012112855,0.0008432154],"domain_scores_gemma":[0.9958375,0.0013015133,0.0002638037,0.0020936131,0.00023945638,0.00026412334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011890283,0.00064394966,0.000615287,0.0009738248,0.00027653342,0.00075863674,0.0032397406,0.00040037205,0.000021024181],"category_scores_gemma":[0.00030535748,0.0005775911,0.00015222149,0.00095230335,0.001592926,0.00056480436,0.0018760676,0.0010904195,0.00026647464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011792152,0.000044697797,0.00022435458,0.000049664755,0.000016343223,0.00021787544,0.0018575385,0.028858837,0.00017238804,0.12272517,0.00012497841,0.8456964],"study_design_scores_gemma":[0.000089595575,0.00030046405,0.0005386053,0.00039353527,0.0000070804804,0.00003769928,4.3113974e-7,0.20396107,0.0027748914,0.790139,0.0009346335,0.00082297856],"about_ca_topic_score_codex":0.0000693434,"about_ca_topic_score_gemma":0.00017586927,"teacher_disagreement_score":0.84487337,"about_ca_system_score_codex":0.00022704016,"about_ca_system_score_gemma":0.00031818423,"threshold_uncertainty_score":0.9996675},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019221239,0.00071896054,0.9934654,0.00046974132,0.0027549989,0.0002919187,0.000009507384,0.0003782275,0.0017190088],"genre_scores_gemma":[0.17638071,0.0010604027,0.8150062,0.0019900422,0.002384671,0.000031604282,0.000045234778,0.00018555879,0.0029156154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561137,0.00003183801,0.00051039533,0.0019495693,0.0011045265,0.0007922967],"domain_scores_gemma":[0.99718696,0.0005475732,0.00025017,0.0016309869,0.0001176717,0.00026662732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008959617,0.00057143654,0.0005619538,0.00089200377,0.00039316245,0.00097303133,0.0032309128,0.00034165976,0.0000146835755],"category_scores_gemma":[0.00007875097,0.0005138751,0.0000985193,0.00084801216,0.00053681515,0.0009204221,0.0038503516,0.0009204108,0.000067708235],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038264934,0.000013648459,0.00013787423,0.000042084248,0.000009313563,0.00019285029,0.00067464274,0.0022869168,0.00007616999,0.011715216,0.00007965471,0.9847678],"study_design_scores_gemma":[0.0005416573,0.00019399647,0.0011457183,0.0012743056,0.000011158324,0.0001759481,7.7545576e-7,0.79839426,0.0006853565,0.19166036,0.0045163357,0.0014001312],"about_ca_topic_score_codex":0.00006503761,"about_ca_topic_score_gemma":0.00006677255,"teacher_disagreement_score":0.9833677,"about_ca_system_score_codex":0.00015895345,"about_ca_system_score_gemma":0.0003133111,"threshold_uncertainty_score":0.9997313},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022255667,0.00049422274,0.9938446,0.00080532226,0.0021857964,0.001633543,0.0000780021,0.00053608854,0.00019984842],"genre_scores_gemma":[0.07591718,0.00028314124,0.91677994,0.0016722829,0.0010666021,0.0004914307,0.00008880656,0.00031847705,0.0033821312],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99368364,0.000086222,0.00076366204,0.002536488,0.001384269,0.0015457392],"domain_scores_gemma":[0.995085,0.0017925048,0.0003731767,0.002108983,0.00024781097,0.0003925196],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014468038,0.0007859545,0.0008825185,0.0015241959,0.00069457456,0.00078845373,0.006036965,0.0003737637,0.0000069549837],"category_scores_gemma":[0.00023195773,0.0007182911,0.00035424152,0.0011014789,0.0012776993,0.0011251395,0.0027185888,0.0012085949,0.000038349095],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011365838,0.00017254891,0.00003307531,0.0003817676,0.00012304794,0.00014801165,0.0010802584,0.19489937,0.024929168,0.058144007,0.0011240672,0.71885103],"study_design_scores_gemma":[0.000772488,0.0002772988,0.000015153535,0.00046859027,0.000008386694,0.000025897272,1.4115676e-7,0.36672217,0.005426951,0.62305313,0.0023382206,0.0008915589],"about_ca_topic_score_codex":0.000015572294,"about_ca_topic_score_gemma":0.00001705227,"teacher_disagreement_score":0.71795946,"about_ca_system_score_codex":0.00024161284,"about_ca_system_score_gemma":0.000399013,"threshold_uncertainty_score":0.9995268},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088734436,0.00016376805,0.99458957,0.0006837044,0.0018461177,0.0011827815,0.000024035908,0.00031781316,0.0003048929],"genre_scores_gemma":[0.020711318,0.00026884186,0.97439253,0.0027394837,0.00024321362,0.00018456424,0.000032469467,0.00014883526,0.0012787554],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948194,0.00009388234,0.0005479761,0.0022749752,0.0011819302,0.001081842],"domain_scores_gemma":[0.9958172,0.0018833063,0.00023731815,0.0014587402,0.0003129155,0.00029055832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016148109,0.0006774517,0.0006706304,0.0019218698,0.0004667677,0.0006051903,0.0027162202,0.00040101886,0.0000043212913],"category_scores_gemma":[0.00023213385,0.00060552673,0.00024807695,0.0011204353,0.001164716,0.00057787943,0.0012745368,0.0008596684,0.00002744957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007569662,0.000025098869,0.000017448316,0.000054006676,0.000025749669,0.00003798458,0.00021954972,0.005641418,0.00028086387,0.22816694,0.000045739696,0.7654095],"study_design_scores_gemma":[0.0006047568,0.00045444348,0.00008390347,0.00016089636,0.0000060750303,0.00003096569,9.7461154e-8,0.379209,0.00046099024,0.61824715,0.00026693885,0.00047480417],"about_ca_topic_score_codex":0.000011040767,"about_ca_topic_score_gemma":0.000037874524,"teacher_disagreement_score":0.7649347,"about_ca_system_score_codex":0.00016058181,"about_ca_system_score_gemma":0.00021406899,"threshold_uncertainty_score":0.99963963},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003892621,0.00066524785,0.99515474,0.00020101904,0.0020069599,0.0010842424,0.00008083468,0.00024563962,0.00052239327],"genre_scores_gemma":[0.068804905,0.00019218514,0.92859495,0.00062592665,0.00038350027,0.000066650195,0.000093578354,0.00015772475,0.0010806009],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943296,0.00006856692,0.0006169525,0.0024795174,0.0014152584,0.0010901407],"domain_scores_gemma":[0.9911154,0.0034042767,0.00035058567,0.0044998717,0.00040052284,0.00022932419],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019218448,0.0006032031,0.0008122333,0.0015915342,0.0003191908,0.00031415067,0.011702482,0.00035792345,0.000006301221],"category_scores_gemma":[0.00040725863,0.0005413223,0.00018551438,0.0015944156,0.0017908234,0.00096254924,0.005109735,0.0008309424,0.000020049449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021933041,0.000018599087,0.000019839306,0.00028345516,0.00003332109,0.000056912522,0.0001763648,0.02782175,0.00027377447,0.39750805,0.00012503183,0.57366097],"study_design_scores_gemma":[0.00027023273,0.00019711156,0.0000500999,0.00026258617,0.000008646981,0.000016334108,1.6915722e-7,0.2520166,0.0041908603,0.74180263,0.000743711,0.00044100263],"about_ca_topic_score_codex":0.000023241926,"about_ca_topic_score_gemma":0.00009523151,"teacher_disagreement_score":0.57321995,"about_ca_system_score_codex":0.00012998715,"about_ca_system_score_gemma":0.0006804393,"threshold_uncertainty_score":0.9997038},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004531873,0.00018427527,0.9959904,0.000654494,0.0016381991,0.00087818195,0.000040482933,0.00029028708,0.00027833934],"genre_scores_gemma":[0.0064718784,0.000010200169,0.9914282,0.0006953801,0.0006567052,0.000018781584,0.000024102234,0.00008309046,0.00061163877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955193,0.00006536594,0.00085392705,0.0014770984,0.0011360582,0.0009482725],"domain_scores_gemma":[0.9939988,0.0031890008,0.00062647735,0.0016766828,0.00035041966,0.00015859357],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020364318,0.00059499114,0.0008182476,0.0006790196,0.00044976117,0.00039058845,0.0047383597,0.00031115778,0.0000032927596],"category_scores_gemma":[0.00026550872,0.00046920512,0.00026026636,0.000968588,0.00084417016,0.00030065214,0.0016509116,0.0007365496,0.00006669739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023064538,0.00002533522,0.000010810651,0.00005362492,0.000035548906,0.000047579866,0.001208263,0.08608217,0.00023862718,0.0029750208,0.00013451137,0.9091862],"study_design_scores_gemma":[0.00025935273,0.0001998773,0.00009415333,0.00036826928,0.000018892884,0.000058578364,4.4720002e-7,0.9360777,0.001103605,0.061236735,0.00010740856,0.0004749523],"about_ca_topic_score_codex":0.000040525505,"about_ca_topic_score_gemma":0.000008323119,"teacher_disagreement_score":0.90871125,"about_ca_system_score_codex":0.00018754818,"about_ca_system_score_gemma":0.0006816516,"threshold_uncertainty_score":0.99977595},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041812247,0.0001218391,0.9935401,0.001929848,0.0007704581,0.0003121896,0.0000027318138,0.00021919206,0.0030618382],"genre_scores_gemma":[0.023981012,0.0006111394,0.9707063,0.0022352221,0.00024035005,0.000016851585,0.0000134065085,0.000054486107,0.0021412584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971744,0.00003389326,0.00037441246,0.0010683781,0.0008958843,0.00045302953],"domain_scores_gemma":[0.99756306,0.0009722482,0.0001380646,0.00084439287,0.00029903775,0.00018320345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011807444,0.00026871858,0.0002700747,0.00093269517,0.00035790988,0.0007654999,0.0017349256,0.00020875799,0.000008820241],"category_scores_gemma":[0.00039455964,0.00024775602,0.000047462665,0.0009169529,0.00034712744,0.0007194909,0.0016963694,0.00054452085,0.00006173222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023029093,0.000008674077,0.00008029215,0.000012009112,0.0000051354596,0.00004608834,0.00051742006,0.049647063,0.000040667044,0.09055675,0.00008362593,0.85899997],"study_design_scores_gemma":[0.00015118996,0.00006453144,0.00020421416,0.00031007713,0.0000017475977,0.000019006351,1.4660495e-7,0.84053695,0.00004928545,0.15760553,0.0007739762,0.0002833649],"about_ca_topic_score_codex":0.000021505037,"about_ca_topic_score_gemma":0.00010669434,"teacher_disagreement_score":0.8587166,"about_ca_system_score_codex":0.00018139719,"about_ca_system_score_gemma":0.00032857357,"threshold_uncertainty_score":0.9999975},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000215033,0.00020089434,0.99533755,0.00027041897,0.002602033,0.0006266085,0.00005912846,0.00048523527,0.0003966123],"genre_scores_gemma":[0.0028642407,0.000052081294,0.9953383,0.00068051444,0.0005720935,0.0000523044,0.000054965745,0.00006125162,0.00032424496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598366,0.00003097635,0.00052755815,0.0017384427,0.0009618901,0.0007574577],"domain_scores_gemma":[0.9973116,0.00062053686,0.00027116458,0.0013499733,0.00024423935,0.00020250936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010727493,0.0005220581,0.0005019107,0.0007258885,0.00047410492,0.0010269117,0.0038180246,0.00030149514,0.000006650577],"category_scores_gemma":[0.000065526394,0.0005263974,0.00016496265,0.0007537206,0.00047941692,0.0013214783,0.00083502557,0.00053030107,0.000027590886],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022504273,0.000032645134,0.00000272043,0.000040123516,0.000009961971,0.000012254908,0.0004179546,0.0053793536,0.0001603529,0.019067273,0.00005273455,0.9748224],"study_design_scores_gemma":[0.0002085587,0.00021658691,0.000010829843,0.00014556863,0.000006170963,0.000012520844,2.7145578e-7,0.7529326,0.0012428231,0.2433606,0.0013668899,0.0004965843],"about_ca_topic_score_codex":0.000026744088,"about_ca_topic_score_gemma":0.000033016036,"teacher_disagreement_score":0.9743258,"about_ca_system_score_codex":0.00019811763,"about_ca_system_score_gemma":0.000271893,"threshold_uncertainty_score":0.9997188},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024723596,0.0012633959,0.9950358,0.0003358843,0.0011105193,0.0011686,0.00001437943,0.0005697564,0.00025441925],"genre_scores_gemma":[0.60774964,0.00093119795,0.38471973,0.0010623094,0.002057915,0.0004031212,0.00009910151,0.00068168616,0.0022952792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974576,0.000007687618,0.00040744484,0.00072014873,0.0004789234,0.00092814915],"domain_scores_gemma":[0.9986614,0.0004882113,0.00011006116,0.0005431747,0.00011085004,0.000086317596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004968543,0.00050026434,0.000407604,0.00050237303,0.0003324311,0.00031221408,0.0011873906,0.0002120974,0.000007227566],"category_scores_gemma":[0.00003937834,0.00038021905,0.00016572732,0.0007181008,0.00014534353,0.00016695874,0.00017443755,0.0010158467,0.000014425997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029645169,0.0000023341397,0.0000106565085,0.00010806875,0.000028643115,0.000011905617,0.00011733771,0.23563059,0.00037897818,0.0005283563,0.000046213816,0.76313394],"study_design_scores_gemma":[0.00017560861,0.00009545857,0.000084766165,0.00021697191,0.000026260606,0.0000511362,1.697225e-7,0.9663831,0.0010595345,0.025976537,0.0054439255,0.00048650496],"about_ca_topic_score_codex":0.000008860632,"about_ca_topic_score_gemma":0.000049461243,"teacher_disagreement_score":0.76264745,"about_ca_system_score_codex":0.00039638727,"about_ca_system_score_gemma":0.00017309801,"threshold_uncertainty_score":0.999865},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003615372,0.00072123995,0.990107,0.0020908418,0.002837277,0.0006377348,0.000017548857,0.000597061,0.0029551317],"genre_scores_gemma":[0.05681795,0.0025719404,0.9210651,0.0030726488,0.0027644832,0.00019055087,0.000103992956,0.00033907391,0.013074276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938353,0.00007393962,0.00079767033,0.002263422,0.0017893525,0.0012403564],"domain_scores_gemma":[0.99461025,0.0011089534,0.00046476908,0.0030802025,0.00044985453,0.00028599135],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019159055,0.0007331949,0.00055254204,0.00056602934,0.0011424413,0.0017807785,0.008824321,0.00039681717,0.000010797422],"category_scores_gemma":[0.0001630954,0.00050684105,0.00016722648,0.0014268247,0.0015648311,0.0011168459,0.0036087558,0.0013220948,0.0002805472],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007838567,0.00002115127,0.000050490657,0.000035413534,0.000017788647,0.0004728803,0.00038465147,0.0122895865,0.00024786688,0.09410202,0.00023316777,0.89213717],"study_design_scores_gemma":[0.00028665175,0.00022610194,0.00032266352,0.0008720766,0.0000109844905,0.00020679826,3.5090665e-7,0.5049376,0.0012053397,0.48261198,0.008103632,0.0012158116],"about_ca_topic_score_codex":0.00012685118,"about_ca_topic_score_gemma":0.00030140046,"teacher_disagreement_score":0.89092135,"about_ca_system_score_codex":0.00036734654,"about_ca_system_score_gemma":0.00097294303,"threshold_uncertainty_score":0.99973834},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004724031,0.0002089324,0.9853281,0.00027263898,0.00975656,0.00043776183,0.000005941382,0.000589107,0.0033537222],"genre_scores_gemma":[0.59253234,0.0019679926,0.34884337,0.01788789,0.022892065,0.00056667725,0.00042023722,0.0004168054,0.014472596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967556,0.00008004815,0.0006087397,0.0006983212,0.0012152112,0.00064209924],"domain_scores_gemma":[0.9976495,0.00037425032,0.00034186567,0.0011818807,0.00030017903,0.00015234826],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014131045,0.00037460218,0.00040941316,0.001193835,0.00033718414,0.0014216454,0.002908153,0.00042193508,0.0000049238697],"category_scores_gemma":[0.00013132457,0.0003562934,0.00010255267,0.0023196992,0.00029249323,0.0024619412,0.0014161858,0.0009746146,0.0004506922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066884586,0.00002765937,0.000012790739,0.00022642859,0.000012967897,0.000039198327,0.0040211678,0.1399519,0.000009452912,0.026430395,0.0037018654,0.8255595],"study_design_scores_gemma":[0.00014718845,0.00011070517,0.000025629524,0.00034526273,0.000003103651,0.000050284616,3.293809e-7,0.8730828,0.000100885445,0.095988885,0.029688684,0.0004562201],"about_ca_topic_score_codex":0.000056828063,"about_ca_topic_score_gemma":0.000056948003,"teacher_disagreement_score":0.8251033,"about_ca_system_score_codex":0.0005871386,"about_ca_system_score_gemma":0.00089063897,"threshold_uncertainty_score":0.9998889},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065087137,0.000014777635,0.9901177,0.00084072683,0.0015309307,0.00020567076,0.00006776491,0.00005546103,0.006516096],"genre_scores_gemma":[0.8050728,0.0000062962586,0.16646163,0.0025691641,0.013978145,0.00004619834,0.00007515373,0.00013692713,0.011653723],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838847,0.000009591428,0.00024180049,0.00063619396,0.00037274542,0.00035117829],"domain_scores_gemma":[0.9992736,0.00008807243,0.00008381136,0.0003260892,0.00009708975,0.0001313496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021406774,0.00025510447,0.00026234362,0.00028532578,0.00018597652,0.00017732027,0.00043592497,0.00007499338,0.00014776537],"category_scores_gemma":[0.000007939043,0.00022715493,0.00008844834,0.00027398948,0.00017801416,0.000090259324,0.00026304775,0.00030912878,0.00028551233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000127840185,0.000054762684,0.00061452854,0.000025157087,0.00004271214,0.0000258698,0.0018392849,0.050189164,0.0005002997,0.3210225,0.0014640705,0.62420887],"study_design_scores_gemma":[0.0002380455,0.00029535245,0.00043930067,0.00047101092,0.000020846717,0.0000026043417,0.0000027094566,0.1000754,0.0033532644,0.86820847,0.025545804,0.0013471612],"about_ca_topic_score_codex":0.00004546763,"about_ca_topic_score_gemma":0.000032453012,"teacher_disagreement_score":0.8236561,"about_ca_system_score_codex":0.00007129783,"about_ca_system_score_gemma":0.0002652291,"threshold_uncertainty_score":0.9263109},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000119976714,0.000039941653,0.99442065,0.00018326883,0.0016322403,0.0007465068,0.000011638144,0.00056465267,0.0022811268],"genre_scores_gemma":[0.16643333,0.000004544141,0.83278674,0.00029899835,0.0002253262,0.00006104457,0.000054328033,0.00004372947,0.00009195134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953896,0.0001337842,0.0006714814,0.0020031203,0.0012162458,0.0005857652],"domain_scores_gemma":[0.9963604,0.00036650806,0.00040954252,0.0022391805,0.00042980484,0.00019455659],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017576393,0.00052679394,0.0004619536,0.0009258626,0.00030466323,0.0006335504,0.004238342,0.00036842265,0.000010880612],"category_scores_gemma":[0.0001623686,0.00052562775,0.00011087756,0.000995956,0.0008628374,0.00094493467,0.00046563477,0.0007962631,0.00010758363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022914533,0.00013819023,0.000004796273,0.00012557753,0.000009567231,0.0000075036364,0.00068346283,0.51995176,0.0056395438,0.17042987,0.0000074075965,0.30297938],"study_design_scores_gemma":[0.00019179207,0.00023199362,0.0001914379,0.0001889778,0.0000064388155,0.000013373333,1.8778239e-7,0.89848864,0.012790499,0.08728635,0.000070169976,0.0005401265],"about_ca_topic_score_codex":0.000008213175,"about_ca_topic_score_gemma":0.000007421061,"teacher_disagreement_score":0.37853685,"about_ca_system_score_codex":0.0005612466,"about_ca_system_score_gemma":0.00069071015,"threshold_uncertainty_score":0.9997195},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047121768,0.00036583282,0.99561465,0.0006481036,0.001656672,0.00078737113,0.000017296768,0.00042421333,0.0004387652],"genre_scores_gemma":[0.003560386,0.000011674456,0.9940361,0.0011651132,0.00072495657,0.000023886258,0.000010867293,0.00008061697,0.00038643088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99326664,0.0002227398,0.0010045047,0.0026955393,0.0016352582,0.0011753438],"domain_scores_gemma":[0.99511933,0.0017419208,0.0006770912,0.0015352456,0.00069818343,0.00022822547],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006325172,0.00077657413,0.0009798277,0.0009664523,0.0008054377,0.0020167353,0.0033711044,0.0004535816,0.0000059752992],"category_scores_gemma":[0.00064823416,0.0007449543,0.0003436248,0.0009360793,0.00048878585,0.0015840653,0.0021547587,0.0010591969,0.000013473146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053606662,0.00015779956,0.000054221357,0.0014620841,0.00011922235,0.00019275735,0.0048041563,0.1133723,0.015436433,0.025927551,0.00007708757,0.8383428],"study_design_scores_gemma":[0.00040582163,0.00012759163,0.00014722059,0.0008687955,0.000030914816,0.00006990348,0.0000024026501,0.888878,0.0077677625,0.10045517,0.00018931304,0.0010571195],"about_ca_topic_score_codex":0.00022527784,"about_ca_topic_score_gemma":0.00019862648,"teacher_disagreement_score":0.83728564,"about_ca_system_score_codex":0.0005841139,"about_ca_system_score_gemma":0.0012894982,"threshold_uncertainty_score":0.99950016},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011012587,0.00021761362,0.9955886,0.00024355378,0.0014223077,0.0008990458,0.000032361633,0.0014164206,0.000069950554],"genre_scores_gemma":[0.0055554225,0.000012307998,0.99327534,0.0004403573,0.00022992624,0.00007113303,0.000018373295,0.00010700548,0.00029012634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953398,0.00004421288,0.0005472211,0.0017990948,0.0010525861,0.0012170675],"domain_scores_gemma":[0.994196,0.003406422,0.00031167618,0.0015743569,0.00030517593,0.00020636703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011575283,0.00082528923,0.0009206414,0.0011532502,0.00039158636,0.00037855582,0.0039644847,0.0003122997,0.0000014352252],"category_scores_gemma":[0.0003832991,0.0006761032,0.00021043739,0.0007004697,0.0006919395,0.0005706671,0.0017686146,0.0009318962,0.000014705765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027573906,0.000011383101,0.000014727602,0.000092189395,0.000031262814,0.000050326507,0.00032886458,0.75219434,0.000114078546,0.0046056523,0.0000044749613,0.2425251],"study_design_scores_gemma":[0.00072560506,0.0004609556,0.00025266854,0.00062489853,0.000026885564,0.00014187644,1.4948435e-7,0.51213145,0.001668981,0.48236096,0.0003294968,0.0012760876],"about_ca_topic_score_codex":0.000008829877,"about_ca_topic_score_gemma":0.000031855085,"teacher_disagreement_score":0.4777553,"about_ca_system_score_codex":0.00024296938,"about_ca_system_score_gemma":0.00031716924,"threshold_uncertainty_score":0.999569},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078737864,0.00034541258,0.99237597,0.0021727453,0.0018082398,0.0005537054,0.00007243285,0.00010790981,0.001776182],"genre_scores_gemma":[0.8333706,0.00027869683,0.16300005,0.0022183731,0.0002907481,0.00007767059,0.00004842188,0.00007580084,0.0006396031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99615026,0.00010347653,0.0007244474,0.0011793353,0.0013300698,0.0005124041],"domain_scores_gemma":[0.99611026,0.0015332013,0.00040505372,0.0015995323,0.00024009617,0.000111866306],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018461992,0.00043130558,0.00060592074,0.0012992515,0.0004120803,0.0003957801,0.004022911,0.0002784386,0.000022980208],"category_scores_gemma":[0.0002675695,0.00034017552,0.00017584955,0.0013999428,0.0032214355,0.0005030706,0.002611467,0.0010735585,0.000010353637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013419717,0.00003200074,0.00017360291,0.000029281468,0.000021962453,0.000047627374,0.0026539355,0.0048326086,0.00000539477,0.9777693,0.000053369928,0.014367506],"study_design_scores_gemma":[0.00095552084,0.00007585493,0.0030394185,0.0002620257,0.0000072297594,0.0000683883,0.0000026008724,0.09570495,0.00003811865,0.8993195,0.00016976279,0.00035657236],"about_ca_topic_score_codex":0.00012027684,"about_ca_topic_score_gemma":0.0007951767,"teacher_disagreement_score":0.83258325,"about_ca_system_score_codex":0.000113954506,"about_ca_system_score_gemma":0.00044519073,"threshold_uncertainty_score":0.99990505},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012566026,0.000076625765,0.9929655,0.00037302237,0.0020735227,0.00090401224,0.0000245504,0.00035110675,0.003106008],"genre_scores_gemma":[0.29199395,0.00016572418,0.701315,0.0009602456,0.0009244527,0.00011508162,0.000065448694,0.00013732506,0.004322805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571705,0.000064556865,0.0006300564,0.0015613248,0.0010972936,0.0009297159],"domain_scores_gemma":[0.9973335,0.0007031114,0.00032668433,0.0008328745,0.00058645254,0.00021734432],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013688963,0.00051251345,0.0005299979,0.0011676197,0.00058210583,0.0015028426,0.0025474986,0.000351439,0.000026918575],"category_scores_gemma":[0.00018516398,0.0005031512,0.00020437433,0.00073056365,0.0007884813,0.0011657629,0.0011697793,0.0007251214,0.00003204186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006105371,0.000022097543,0.000044010256,0.000073467294,0.000019682899,0.00012698393,0.0009744682,0.7210213,0.00011593077,0.23125619,0.000026898824,0.046312887],"study_design_scores_gemma":[0.00029617437,0.00018242962,0.000099470766,0.00068240677,0.0000054881375,0.000014717753,0.0000035919488,0.78625596,0.00034519416,0.21155539,0.000050733383,0.0005084706],"about_ca_topic_score_codex":0.00006670337,"about_ca_topic_score_gemma":0.00021189272,"teacher_disagreement_score":0.2918683,"about_ca_system_score_codex":0.00034063903,"about_ca_system_score_gemma":0.0010067752,"threshold_uncertainty_score":0.99974203},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016539092,0.000056113273,0.9928467,0.001994467,0.0019309437,0.0003412738,0.000006360587,0.00052138837,0.0022862002],"genre_scores_gemma":[0.0083142705,0.00015961267,0.9792465,0.0029056652,0.000774582,0.000014163197,0.000033746797,0.00008442234,0.008467042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636304,0.000045510147,0.00049244566,0.0013835749,0.001027226,0.0006881867],"domain_scores_gemma":[0.9979907,0.0002709238,0.00019183691,0.0008295363,0.0005196358,0.00019731386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008281082,0.00041834085,0.00040277722,0.0011688467,0.0002503599,0.0006491166,0.002645167,0.00029518557,0.00005679071],"category_scores_gemma":[0.00015576585,0.00038997194,0.00010765645,0.0016649773,0.00038458893,0.0006732365,0.0014426297,0.00096179923,0.00019141073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052316236,0.000062229214,0.00006049284,0.000048476006,0.000017723038,0.000056976438,0.00071321195,0.2527488,0.000085893065,0.033314697,0.00020043012,0.7126859],"study_design_scores_gemma":[0.00019871714,0.00017308847,0.00010003958,0.00021869502,0.000003023118,0.000036021534,1.2734907e-7,0.93482095,0.0001429689,0.061696243,0.0021707732,0.0004393478],"about_ca_topic_score_codex":0.000025532814,"about_ca_topic_score_gemma":0.00024595505,"teacher_disagreement_score":0.71224654,"about_ca_system_score_codex":0.00026120283,"about_ca_system_score_gemma":0.0006419304,"threshold_uncertainty_score":0.9998552},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013675846,0.00047295552,0.99739444,0.00022477123,0.0011658763,0.00019387514,0.00006379086,0.0003100654,0.00016056921],"genre_scores_gemma":[0.0011349636,0.000080777376,0.9968737,0.00029754697,0.00037151267,0.000008250444,0.000050305855,0.000036157642,0.001146823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687976,0.000014027788,0.00032667324,0.001667545,0.00058372144,0.0005282727],"domain_scores_gemma":[0.99658805,0.00035183114,0.00011971019,0.0027311589,0.000071780625,0.00013749333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008112629,0.00034795896,0.0003859655,0.0004965888,0.00014731791,0.00028401118,0.0033746902,0.00014953811,6.2325125e-7],"category_scores_gemma":[0.00018290489,0.00031751234,0.000027226612,0.0007707643,0.00025963728,0.0014430477,0.006607907,0.0004884134,0.000017700566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014620433,0.000010267214,0.000013041283,0.00019036728,0.0000101717205,0.00012537882,0.00056721026,0.6370105,0.00015033115,0.036284503,0.0006274494,0.3250093],"study_design_scores_gemma":[0.00007821681,0.00001923647,0.00001831337,0.0002987636,0.0000023208522,0.000036863858,5.7698955e-8,0.98011065,0.00003685923,0.015228159,0.0038117378,0.00035880995],"about_ca_topic_score_codex":0.000011944132,"about_ca_topic_score_gemma":0.00007058709,"teacher_disagreement_score":0.34310013,"about_ca_system_score_codex":0.00013224922,"about_ca_system_score_gemma":0.0007106051,"threshold_uncertainty_score":0.9999277},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13738063,0.00014550178,0.84970754,0.0013167633,0.0044935574,0.00053627073,0.000051308994,0.000058814094,0.006309623],"genre_scores_gemma":[0.9822182,0.000016967851,0.016903631,0.00044607988,0.00014154783,0.0000026616722,0.0000028185118,0.000014030336,0.00025404466],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99584574,0.00006688859,0.0008904945,0.0009449522,0.001953656,0.0002982894],"domain_scores_gemma":[0.9929646,0.0051677204,0.0005051154,0.0010147311,0.00029716681,0.0000506649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006949918,0.00022828078,0.00045686364,0.0009660292,0.00013481706,0.0003815521,0.0031439564,0.00019414254,0.00008437096],"category_scores_gemma":[0.002203922,0.00015138875,0.00013271726,0.0010454053,0.0009146334,0.00029645508,0.00053179875,0.0005584184,0.00018860924],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014010635,0.00002823761,0.007019549,0.0000056243575,0.000002694513,0.00007277378,0.0015510176,0.04127976,0.000027439313,0.018668575,0.00012252551,0.9312078],"study_design_scores_gemma":[0.00016302853,0.000078087025,0.013249901,0.00032589096,0.0000035232,0.000026339227,0.0000075424337,0.10059639,0.00005791781,0.88439775,0.0007936181,0.00030000758],"about_ca_topic_score_codex":0.00010324012,"about_ca_topic_score_gemma":0.0006596224,"teacher_disagreement_score":0.9309078,"about_ca_system_score_codex":0.000112007154,"about_ca_system_score_gemma":0.00042511796,"threshold_uncertainty_score":0.61734545},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000816848,0.0003122236,0.99597824,0.0007535703,0.0013790107,0.00031784445,0.0000479905,0.000069505426,0.00032477162],"genre_scores_gemma":[0.8371425,0.00059278833,0.1340735,0.023762306,0.001983628,0.00002965652,0.000033596636,0.0002646474,0.0021173349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964975,0.00019888251,0.0005287294,0.0012643522,0.0009561412,0.00055439444],"domain_scores_gemma":[0.9963104,0.0018250938,0.0002913062,0.0010477435,0.00038546088,0.00013996028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002094094,0.0004936845,0.00056833256,0.0003851118,0.00029513356,0.00044835903,0.0019258286,0.0001937913,0.000037148282],"category_scores_gemma":[0.0003577017,0.00034490624,0.000103530394,0.00069700874,0.00091480266,0.00024686242,0.0010034825,0.0006777568,0.00005354695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010759418,0.00014920026,0.0019625926,0.00013147658,0.0002594661,0.00021012167,0.012089074,0.1281298,0.0024980714,0.008924561,0.004682125,0.84085596],"study_design_scores_gemma":[0.00029977658,0.0002620792,0.003114308,0.00062478025,0.000015114877,0.000007201845,3.1471302e-7,0.96642023,0.0070527494,0.019783918,0.0015712879,0.00084825687],"about_ca_topic_score_codex":0.00017537731,"about_ca_topic_score_gemma":0.00061638904,"teacher_disagreement_score":0.86190474,"about_ca_system_score_codex":0.000074082236,"about_ca_system_score_gemma":0.0002847915,"threshold_uncertainty_score":0.9999003},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022702722,0.00007900082,0.98986036,0.0011208127,0.0014815744,0.00018899476,0.000018159826,0.000076815835,0.004904002],"genre_scores_gemma":[0.64890045,0.00031886483,0.08139359,0.0065441555,0.0035636255,0.00008295671,0.000033247434,0.00013362776,0.2590295],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976906,0.000048756687,0.00047458836,0.0010705403,0.000452971,0.0002625036],"domain_scores_gemma":[0.9966568,0.0021107402,0.00023841352,0.00076100545,0.00012148635,0.000111605616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024113655,0.00020010275,0.00030820572,0.0007109742,0.00015703966,0.0005935187,0.001697738,0.0001698261,0.00008317856],"category_scores_gemma":[0.00054585474,0.00016066016,0.00006152998,0.0008667512,0.0010209824,0.00024662729,0.0008463395,0.00037698366,0.000584343],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051670127,0.000011745218,0.00016111103,0.0000054658194,0.0000050503672,0.000005969417,0.00059976964,0.014159963,0.000017473532,0.02279473,0.00345837,0.95877516],"study_design_scores_gemma":[0.00007609129,0.00002619985,0.00016500459,0.000033157892,0.000002508634,0.000020103795,8.182188e-7,0.1463506,0.000112228896,0.81715786,0.03586491,0.00019047952],"about_ca_topic_score_codex":0.0000032235498,"about_ca_topic_score_gemma":0.00009400686,"teacher_disagreement_score":0.9585847,"about_ca_system_score_codex":0.00012906536,"about_ca_system_score_gemma":0.00051130436,"threshold_uncertainty_score":0.7510742},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038311726,0.00049314793,0.98107153,0.008103609,0.0013565654,0.0024744212,0.00002153085,0.00044892644,0.002199107],"genre_scores_gemma":[0.9091741,0.00063633034,0.074838184,0.0035416407,0.00091576326,0.00010283669,0.00038019533,0.00013662221,0.010274313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872625,0.000011604031,0.00021424475,0.00047751024,0.00033534146,0.00023507114],"domain_scores_gemma":[0.99942905,0.00016520492,0.000074789175,0.00013356018,0.000095775526,0.00010163295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047492355,0.00018065037,0.000267727,0.000529574,0.00008143167,0.00006876394,0.00011907159,0.00015962149,0.000012379976],"category_scores_gemma":[0.00013747788,0.000160388,0.00004223288,0.00022995197,0.00022740511,0.000088987144,0.00005300691,0.00034780614,0.0000054855814],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089098714,0.000030031215,0.0048746085,0.0011837597,0.000016969396,0.00008090052,0.004896384,0.000388922,0.00019475025,0.0010907771,0.00003272658,0.98712105],"study_design_scores_gemma":[0.019835534,0.007113192,0.09544269,0.026454007,0.00039412882,0.00072491117,0.000037239395,0.634849,0.0059026205,0.14744033,0.057646178,0.0041601537],"about_ca_topic_score_codex":0.000018391513,"about_ca_topic_score_gemma":0.00017386978,"teacher_disagreement_score":0.98296094,"about_ca_system_score_codex":0.00008062112,"about_ca_system_score_gemma":0.00023135342,"threshold_uncertainty_score":0.65404326},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047410913,0.0016079583,0.9215185,0.0012585437,0.005850825,0.0034511,0.00010776657,0.00010840284,0.01868599],"genre_scores_gemma":[0.99687624,0.000048306443,0.0023775056,0.000025975462,0.00014138652,0.000014678468,0.0000044557637,0.000022197994,0.00048925495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981281,0.000025869984,0.0009486769,0.00051188417,0.000119968456,0.0002654784],"domain_scores_gemma":[0.997841,0.0007611129,0.00076163764,0.0005187619,0.00008732149,0.000030177747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003040968,0.00016832595,0.00048955425,0.0004594856,0.00006625918,0.00005200458,0.00081142253,0.0001563684,0.0000074341906],"category_scores_gemma":[0.000618798,0.00015252593,0.000066994064,0.0004837886,0.0005285252,0.00009089018,0.00018816923,0.00027857,0.000019287823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032496166,0.000053138436,0.0011928673,0.00047119177,0.000022451062,0.000002081804,0.0027107324,0.12673867,0.00017980479,0.8523383,0.000003367464,0.016254893],"study_design_scores_gemma":[0.00024114372,0.00015173954,0.0018258588,0.0007836768,0.0000027305455,0.0000022085048,9.170235e-7,0.051675275,0.00024966567,0.94465965,0.0001798642,0.0002272808],"about_ca_topic_score_codex":0.00015939465,"about_ca_topic_score_gemma":0.0004122261,"teacher_disagreement_score":0.94946533,"about_ca_system_score_codex":0.00012056965,"about_ca_system_score_gemma":0.0001148249,"threshold_uncertainty_score":0.6219827},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00334773,0.00032312976,0.9361246,0.0013080484,0.0043667736,0.0006703268,0.00012295698,0.0002368723,0.05349955],"genre_scores_gemma":[0.9904543,0.0000149256675,0.0025463786,0.00065880996,0.0008211256,0.000011953868,0.00001843792,0.000046286143,0.0054277782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755454,0.000020658714,0.0007402584,0.0010764248,0.00019384082,0.0004142606],"domain_scores_gemma":[0.99839365,0.00029530673,0.00046919956,0.00069893687,0.00005761318,0.00008530527],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002245705,0.0002986357,0.0005876235,0.00059971743,0.00016814614,0.0001814999,0.0007060978,0.00027352787,0.00013587158],"category_scores_gemma":[0.0001434443,0.00032541927,0.00014002249,0.0002231142,0.00034977155,0.00012144105,0.00015844085,0.00059213414,0.0013906555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020670373,0.000070340546,0.001993726,0.00012718466,0.00004016436,0.000031618714,0.0008429934,0.015727585,0.000011952223,0.95193577,0.000091575464,0.029106429],"study_design_scores_gemma":[0.00021292179,0.00016823938,0.004227002,0.00033367527,0.0000031072236,0.000008113915,2.0455079e-7,0.0125075765,0.000088693116,0.97915554,0.0027390388,0.000555886],"about_ca_topic_score_codex":0.000042318654,"about_ca_topic_score_gemma":0.00002957969,"teacher_disagreement_score":0.98710656,"about_ca_system_score_codex":0.00017864809,"about_ca_system_score_gemma":0.00006619892,"threshold_uncertainty_score":0.9999198},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006175128,0.00046038514,0.992371,0.0032266513,0.0008954675,0.00047636867,0.000053449414,0.0014301562,0.00046896725],"genre_scores_gemma":[0.14981565,0.00027093737,0.8477811,0.00041125517,0.00019375322,0.00002339502,0.0010304297,0.00012741624,0.00034607036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934645,0.00016892713,0.00088559935,0.003313272,0.0011420085,0.0010256856],"domain_scores_gemma":[0.9874168,0.00078798586,0.0005787287,0.010903072,0.00017369933,0.00013973842],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.003134924,0.00065167976,0.00061851746,0.0012478692,0.00052857655,0.001453462,0.050811417,0.0005756085,0.000015281019],"category_scores_gemma":[0.010268437,0.000679202,0.00005264105,0.0020148398,0.000494304,0.0027085997,0.0886176,0.0023872466,0.000061304636],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011178939,0.00007853341,0.0012331706,0.000083339124,0.000024351091,0.00015602213,0.00053285796,0.013461286,0.0024957687,0.0011204529,0.0012674365,0.9795356],"study_design_scores_gemma":[0.00024632234,0.000099328,0.00021365006,0.0005498325,0.0000049103096,0.000024595496,8.0418573e-7,0.9387165,0.0011497604,0.057440866,0.0008778105,0.00067567034],"about_ca_topic_score_codex":0.00025713284,"about_ca_topic_score_gemma":0.0004892261,"teacher_disagreement_score":0.97885996,"about_ca_system_score_codex":0.00041016057,"about_ca_system_score_gemma":0.00040094726,"threshold_uncertainty_score":0.9999143},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023658716,0.00038453966,0.99340045,0.0003275478,0.0033162169,0.00028064378,0.00004239814,0.00021449573,0.0017971442],"genre_scores_gemma":[0.65564185,0.00023158883,0.341794,0.0004275206,0.0010288231,0.000019926209,0.00014411153,0.00007163641,0.00064050755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959646,0.00008079343,0.0006938655,0.0014322146,0.0010781937,0.00075036805],"domain_scores_gemma":[0.99670374,0.00076483865,0.0004940742,0.0016073145,0.00028696161,0.00014305775],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014738773,0.00049808435,0.00080826785,0.0014676526,0.00027715525,0.00025841416,0.0031596047,0.00037204011,0.000028725399],"category_scores_gemma":[0.00009346877,0.00042955275,0.0003856232,0.0029445144,0.0009926553,0.0009331366,0.0016692384,0.00063736096,0.000035780573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000816069,0.000047657442,0.000030233829,0.00004990744,0.0003169991,0.00011443929,0.003223716,0.37694576,0.00006078936,0.08892987,0.000107884676,0.53009117],"study_design_scores_gemma":[0.00080635236,0.0009156635,0.00040347883,0.0002079807,0.00021047205,0.000035286375,0.000004168601,0.8259318,0.00063523394,0.16937223,0.00044424788,0.0010330752],"about_ca_topic_score_codex":0.00003347023,"about_ca_topic_score_gemma":0.000020545198,"teacher_disagreement_score":0.6554053,"about_ca_system_score_codex":0.00021673467,"about_ca_system_score_gemma":0.00037156025,"threshold_uncertainty_score":0.99981564},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030816105,0.00024360717,0.99403006,0.00022977896,0.0005267132,0.00040134077,0.000036899964,0.0002695736,0.003953896],"genre_scores_gemma":[0.94932157,0.000009553024,0.040805377,0.000326874,0.008005946,0.00005566516,0.00013047075,0.00014795223,0.0011966048],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99551475,0.000045747216,0.0007684298,0.0015168969,0.0011941282,0.0009600252],"domain_scores_gemma":[0.997529,0.0004889705,0.0005263641,0.0010630818,0.0002417155,0.00015090265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001363312,0.00070713245,0.0012985236,0.0010023863,0.00075509807,0.00033693053,0.0017968765,0.0002808316,0.0004167786],"category_scores_gemma":[0.0000130559965,0.0006560904,0.00090355467,0.0024897167,0.0006803689,0.00013968446,0.0012777194,0.00089667604,0.000085753534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026264936,0.00003652123,0.013168241,0.00001398869,0.0015340073,0.000025278316,0.0002887427,0.17061569,0.000031498617,0.035632204,0.0012846062,0.777343],"study_design_scores_gemma":[0.00027560367,0.000058316607,0.008534486,0.0001428209,0.000787652,0.00000122869,2.028446e-7,0.19801715,0.000075948614,0.78939635,0.0016743786,0.0010358552],"about_ca_topic_score_codex":0.00022445427,"about_ca_topic_score_gemma":0.0066835308,"teacher_disagreement_score":0.95322466,"about_ca_system_score_codex":0.00030805613,"about_ca_system_score_gemma":0.00023454531,"threshold_uncertainty_score":0.999589},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017453667,0.00031442402,0.98265296,0.0011793615,0.004695619,0.00033578157,0.000006892382,0.0005908516,0.010206666],"genre_scores_gemma":[0.0073132426,0.00012297378,0.9827947,0.00469629,0.0013770125,0.00003197238,0.000024151548,0.00008759695,0.00355205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950905,0.00006371544,0.0005138786,0.0019775033,0.0012824709,0.0010719567],"domain_scores_gemma":[0.99675,0.0005991562,0.00023362564,0.0020435585,0.0001592979,0.000214381],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010821566,0.00056114426,0.00058751914,0.00087258563,0.0003091348,0.0009614182,0.006221309,0.00040230431,0.000010794466],"category_scores_gemma":[0.00011174898,0.00047823283,0.00016608194,0.0023963912,0.0005537886,0.00066763844,0.0027144307,0.0009603817,0.0005223174],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016984093,0.000027313346,0.000027422546,0.00003932252,0.000008256278,0.0003237241,0.0006323759,0.02455348,0.0000044562607,0.0027746363,0.0023986406,0.96920866],"study_design_scores_gemma":[0.00018539203,0.00013451677,0.00022701496,0.0002173684,0.000004213053,0.00006249693,6.310856e-8,0.6953067,0.000048671653,0.29786485,0.005276326,0.0006723708],"about_ca_topic_score_codex":0.00002199511,"about_ca_topic_score_gemma":0.000053322325,"teacher_disagreement_score":0.9685363,"about_ca_system_score_codex":0.0004715952,"about_ca_system_score_gemma":0.001424991,"threshold_uncertainty_score":0.99976695},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037876118,0.00040441597,0.99486184,0.00033358295,0.0009777113,0.0003208794,0.000013633453,0.00012255165,0.0025866237],"genre_scores_gemma":[0.43469828,0.00014690883,0.5646342,0.00034121246,0.00006926351,0.000007943881,0.00000654064,0.000026737882,0.00006889133],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997063,0.00002468007,0.00061364763,0.0010599659,0.00079384196,0.00044488846],"domain_scores_gemma":[0.99628186,0.0019846295,0.0002891602,0.0010723434,0.00023115991,0.00014083102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007302486,0.0003625235,0.00048191077,0.0020038781,0.00023081744,0.0003326477,0.002009723,0.00023412846,0.000014800238],"category_scores_gemma":[0.00031758743,0.00030780202,0.00012064862,0.0020451767,0.00069527316,0.00053024816,0.0014365828,0.00043493084,0.000034824912],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025488387,0.000015220969,0.00005677254,0.000030528274,0.00001024729,0.000027270662,0.0006957454,0.015050931,0.0000033504298,0.11011802,0.00001923783,0.87397015],"study_design_scores_gemma":[0.00011898168,0.00010548211,0.00057032664,0.00020484098,0.0000072651005,0.00003356991,1.3005766e-7,0.4479081,0.00002451645,0.5507322,0.000063503496,0.00023108395],"about_ca_topic_score_codex":0.000013605103,"about_ca_topic_score_gemma":0.00003528723,"teacher_disagreement_score":0.87373906,"about_ca_system_score_codex":0.000095969,"about_ca_system_score_gemma":0.00025052697,"threshold_uncertainty_score":0.9999374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002849432,0.00037039156,0.9968699,0.0005675522,0.00033423436,0.0007173106,0.000025878508,0.00021658701,0.00061317964],"genre_scores_gemma":[0.15999505,0.00011687212,0.8384836,0.0007634047,0.00030046795,0.000064203276,0.00006943248,0.00005837211,0.00014861653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598324,0.000019029303,0.00048721654,0.0018788243,0.0009592516,0.0006724325],"domain_scores_gemma":[0.9971672,0.00075654325,0.0003793686,0.0011682753,0.00037488234,0.00015372758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00113766,0.0005660604,0.0007998731,0.0011537856,0.00045880236,0.00097594265,0.0020513616,0.00030529647,0.000008848259],"category_scores_gemma":[0.00007057762,0.00042443004,0.00014104122,0.0015763601,0.00069890666,0.0005692059,0.0007723445,0.00044097108,0.000009801097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005474502,0.00003276385,0.0016776051,0.00011985942,0.0002831931,0.000057779373,0.0013712139,0.07404909,0.000057750218,0.1398647,0.000032096388,0.7823992],"study_design_scores_gemma":[0.00037148807,0.00028294852,0.0031918688,0.00016536786,0.000101544494,0.000013548414,2.5877753e-7,0.8091589,0.00005071032,0.18577303,0.00032066522,0.0005696609],"about_ca_topic_score_codex":0.0001959866,"about_ca_topic_score_gemma":0.004821662,"teacher_disagreement_score":0.78182954,"about_ca_system_score_codex":0.00010704656,"about_ca_system_score_gemma":0.00026970461,"threshold_uncertainty_score":0.99982077},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22129156,0.00034911066,0.76544553,0.001652825,0.008331449,0.0011631977,0.0005316684,0.0002493332,0.0009853325],"genre_scores_gemma":[0.9553839,0.000023157656,0.041223414,0.0022374364,0.00046642908,0.000012168681,0.000051648745,0.000072333816,0.0005295302],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99205357,0.00018665702,0.0011949502,0.0023812843,0.0036366277,0.0005469375],"domain_scores_gemma":[0.9901027,0.0073974533,0.00049477594,0.0011506756,0.0005714323,0.0002829751],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029698492,0.00060596963,0.0007660481,0.0017017686,0.0005608962,0.0013281859,0.0018563288,0.00041811788,0.0003827702],"category_scores_gemma":[0.0043582,0.00049268047,0.00013249356,0.00090884353,0.0008042252,0.00037966648,0.0011758702,0.0007383417,0.00048544552],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056169825,0.00003596202,0.0033335567,0.000009331604,0.000032882992,0.0003263725,0.001184514,0.03676181,0.00070674304,0.003019118,0.0004894023,0.95404416],"study_design_scores_gemma":[0.0011782167,0.00020030899,0.019479502,0.0014189701,0.000019497993,0.00007278015,0.0000067238284,0.42190418,0.0016205423,0.55091774,0.0018404739,0.0013410652],"about_ca_topic_score_codex":0.00004409247,"about_ca_topic_score_gemma":0.00017251255,"teacher_disagreement_score":0.95270306,"about_ca_system_score_codex":0.00024534558,"about_ca_system_score_gemma":0.00047702328,"threshold_uncertainty_score":0.99975246},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00385935,0.000540097,0.98510605,0.00065365346,0.0015980531,0.00046079393,0.000012203461,0.00019205763,0.007577739],"genre_scores_gemma":[0.96301466,0.000058219317,0.03465839,0.0002939475,0.00052912335,0.000009876595,0.000002454966,0.000054425072,0.0013789273],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939589,0.00004168969,0.0007501251,0.0022875092,0.0023574252,0.0006043819],"domain_scores_gemma":[0.99111956,0.006946125,0.00039148526,0.00072438875,0.00073912763,0.00007933088],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030752216,0.00051187817,0.0007473834,0.0030190253,0.00064519746,0.00088475714,0.0023097296,0.00054145645,0.00016493245],"category_scores_gemma":[0.002967374,0.0003985346,0.00017963607,0.0015076869,0.0022129987,0.00036693196,0.003380911,0.00083341746,0.0005373993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004407946,0.000016025508,0.0005083997,0.0000048118236,0.000011722987,0.00007684382,0.0013042196,0.00008814848,0.0000030304755,0.024496444,0.00009422436,0.9733521],"study_design_scores_gemma":[0.00038907153,0.00015084406,0.005875506,0.00037819077,0.000018839637,0.000017472374,0.000027190288,0.024958353,0.000017341923,0.96660066,0.0010845221,0.0004819911],"about_ca_topic_score_codex":0.0000036670626,"about_ca_topic_score_gemma":0.0006526394,"teacher_disagreement_score":0.97287005,"about_ca_system_score_codex":0.00016784691,"about_ca_system_score_gemma":0.00014598694,"threshold_uncertainty_score":0.99984664},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000317694,0.0007863672,0.9911849,0.00043056783,0.002457366,0.0010603298,0.00006067563,0.00031515048,0.0036728843],"genre_scores_gemma":[0.04504076,0.000053159616,0.9521943,0.0007916135,0.0008434921,0.00007612301,0.000036349204,0.00008419681,0.00088000274],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564487,0.000023757057,0.0004886395,0.0022491456,0.0007774432,0.00081617077],"domain_scores_gemma":[0.9969302,0.0005738609,0.00020201766,0.0017304273,0.00031772268,0.0002457713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084903656,0.0006864699,0.00059615134,0.0009817859,0.00035161607,0.0010005214,0.003669238,0.00038347472,0.000021403928],"category_scores_gemma":[0.00006986159,0.00047411703,0.00018495123,0.0012408186,0.00062282296,0.0008713882,0.0016461745,0.0007644341,0.000052755622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013094998,0.00012922127,0.000027936709,0.00047303067,0.000053995594,0.0002532299,0.001973901,0.00082219404,0.000097578864,0.39755693,0.00058485597,0.59789616],"study_design_scores_gemma":[0.00086145086,0.0013647708,0.00008746145,0.0017993697,0.00005062579,0.00023398464,3.7577732e-7,0.27643797,0.0011063641,0.6884965,0.028123252,0.0014379144],"about_ca_topic_score_codex":0.000012763057,"about_ca_topic_score_gemma":0.00033760874,"teacher_disagreement_score":0.59645826,"about_ca_system_score_codex":0.00018972739,"about_ca_system_score_gemma":0.00091441866,"threshold_uncertainty_score":0.99977106},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009303674,0.00012574958,0.9956038,0.0008239299,0.0014579485,0.0001452931,0.0000021340832,0.00008103389,0.0016670857],"genre_scores_gemma":[0.5112431,0.00020618213,0.4810702,0.0039318707,0.001169912,0.000037895916,0.000032305306,0.00007076034,0.0022378035],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973722,0.000053657397,0.00042840693,0.0008589749,0.0010062824,0.000280468],"domain_scores_gemma":[0.9971958,0.0014188837,0.00027620507,0.00083365623,0.000210211,0.00006526845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057858374,0.0002538945,0.00028433438,0.0005753608,0.00019427773,0.00014145664,0.0016248521,0.00013685327,0.000008353339],"category_scores_gemma":[0.00015677972,0.00019327454,0.00013242643,0.0014243311,0.0003384418,0.0002313127,0.0005618516,0.00030618298,0.000015043005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071559225,0.000018127033,0.0000050975536,0.000008942819,0.000010036942,0.000017003511,0.00031673544,0.31634006,0.00023123476,0.2363474,0.00011488179,0.44658333],"study_design_scores_gemma":[0.00012857257,0.00014627201,0.00013848621,0.00012119372,0.0000048339484,0.000015011036,2.2248078e-7,0.460338,0.0034231732,0.53520274,0.0002621542,0.0002193244],"about_ca_topic_score_codex":0.00002715983,"about_ca_topic_score_gemma":0.00003531649,"teacher_disagreement_score":0.5145336,"about_ca_system_score_codex":0.00007575388,"about_ca_system_score_gemma":0.00026147152,"threshold_uncertainty_score":0.7881507},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010311267,0.0002151511,0.99168193,0.000979852,0.0012343993,0.000403676,0.000007286121,0.0003357947,0.00503879],"genre_scores_gemma":[0.17797028,0.0011299952,0.80237424,0.008423196,0.0009281502,0.00008048629,0.000027878015,0.00036614167,0.008699606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954859,0.00005521662,0.000367773,0.0019102498,0.0013016898,0.0008791496],"domain_scores_gemma":[0.9965805,0.0012535643,0.00015977188,0.0015618984,0.00015806599,0.00028623658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011788114,0.00052743196,0.00048706646,0.0017841214,0.00035622728,0.00047186553,0.0033238714,0.00027796082,0.000009651894],"category_scores_gemma":[0.00014495077,0.00047545752,0.00010592696,0.0012434446,0.0013945919,0.0004735552,0.001198337,0.0011577683,0.00013608746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012873094,0.0000139453205,0.000046415782,0.000027146216,0.000013554456,0.00027028105,0.00036627374,0.007091413,0.00009359034,0.5545599,0.000054872326,0.43744975],"study_design_scores_gemma":[0.00023730085,0.00031142175,0.00014852523,0.0003038487,0.0000032845705,0.000057868,1.9322528e-7,0.062086668,0.00042053385,0.9349821,0.00086955895,0.0005787061],"about_ca_topic_score_codex":0.000010888849,"about_ca_topic_score_gemma":0.00006240751,"teacher_disagreement_score":0.43687105,"about_ca_system_score_codex":0.0001571693,"about_ca_system_score_gemma":0.0002626008,"threshold_uncertainty_score":0.9997697},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000108345785,0.00023290286,0.9967591,0.00025652978,0.0016585068,0.00017829474,0.000003871469,0.0003323566,0.00056757324],"genre_scores_gemma":[0.028473541,0.0016240742,0.92793274,0.019406987,0.006125108,0.00004271566,0.000443953,0.00033018834,0.01562068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705803,0.000060530536,0.00040940035,0.0011559651,0.000751105,0.0005649933],"domain_scores_gemma":[0.99830246,0.00037037488,0.0002078417,0.0008087626,0.00015885163,0.00015168164],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001011695,0.0003285531,0.00037041286,0.00078592426,0.00033337987,0.0011301629,0.0018748731,0.00020609071,0.000004109623],"category_scores_gemma":[0.00014220022,0.00031708373,0.000058522248,0.003004988,0.0003906627,0.0007056977,0.0015261653,0.00032758072,0.000034433677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031465706,0.000050761417,0.00078705314,0.00020755416,0.000032944223,0.00013683645,0.0019137734,0.20724912,0.000028817738,0.19123466,0.0065708198,0.5917845],"study_design_scores_gemma":[0.00011780155,0.000044975197,0.00017408431,0.00030094484,0.000005824332,0.000013476762,1.2765113e-7,0.83361524,0.00003385224,0.16279292,0.0025339862,0.00036676947],"about_ca_topic_score_codex":0.000006243573,"about_ca_topic_score_gemma":0.000044400946,"teacher_disagreement_score":0.62636614,"about_ca_system_score_codex":0.00013363369,"about_ca_system_score_gemma":0.00056150835,"threshold_uncertainty_score":0.9999281},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030777017,0.014624352,0.9781305,0.0004982673,0.0028558215,0.00036108404,0.000006892706,0.00015086234,0.00029447698],"genre_scores_gemma":[0.95686513,0.00039365236,0.041515782,0.00033112464,0.0006863158,0.000011447984,0.0000032976707,0.000047812075,0.00014546113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964264,0.000063271254,0.0006337801,0.0012444302,0.0009812232,0.0006509122],"domain_scores_gemma":[0.99680424,0.0015413857,0.0004361488,0.0008883802,0.00020527473,0.00012458507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002120652,0.00048600868,0.0005087511,0.00024343474,0.00038977567,0.00066529354,0.0019653076,0.00023186287,0.0000024325634],"category_scores_gemma":[0.00011371263,0.00036266612,0.000115572475,0.0006346251,0.0005066558,0.00032498487,0.001685817,0.0014441846,0.0000025039967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075747503,0.000015637695,0.00038010324,0.000114356844,0.000037940208,0.00003528926,0.002846768,0.27269635,0.00011864083,0.0040686443,0.000056525612,0.7196222],"study_design_scores_gemma":[0.00015192764,0.00022853847,0.00015067142,0.0015307964,0.00001748414,0.00004325122,8.1955255e-7,0.89358604,0.00024883045,0.103470445,0.00018462038,0.00038656953],"about_ca_topic_score_codex":0.000031242376,"about_ca_topic_score_gemma":0.000008110506,"teacher_disagreement_score":0.9537874,"about_ca_system_score_codex":0.00013616956,"about_ca_system_score_gemma":0.00022578747,"threshold_uncertainty_score":0.9998825},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006994428,0.00040871886,0.9885957,0.00082036084,0.0027458363,0.0003262755,0.000035992434,0.00038467604,0.006612447],"genre_scores_gemma":[0.11314735,0.0002494241,0.8789809,0.006056203,0.0011415288,0.00001091353,0.00016687332,0.000066309425,0.00018055306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968222,0.000018395334,0.0005787553,0.0009522027,0.0010795951,0.0005488873],"domain_scores_gemma":[0.99755585,0.00024757325,0.00021738549,0.0016178038,0.00019104425,0.0001703687],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008766287,0.00045995225,0.00039208616,0.0013374683,0.00022405898,0.0014777578,0.0035697336,0.00034108464,0.000024086921],"category_scores_gemma":[0.00007288581,0.00041598498,0.00016429929,0.001409381,0.0005610947,0.0023081186,0.0022061698,0.0011369478,0.00028384142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009061338,0.000013963936,0.00001601669,0.00008920746,0.0000140717975,0.00005340669,0.0009129259,0.0009946089,0.00002895471,0.7556596,0.0001422735,0.24206592],"study_design_scores_gemma":[0.0001768273,0.00011355528,0.00008198296,0.00034263477,0.0000092355185,0.000057683814,9.913587e-8,0.20406944,0.0005622993,0.740994,0.05300122,0.00059106894],"about_ca_topic_score_codex":0.000013558387,"about_ca_topic_score_gemma":0.000021679702,"teacher_disagreement_score":0.24147485,"about_ca_system_score_codex":0.00017704541,"about_ca_system_score_gemma":0.00036800868,"threshold_uncertainty_score":0.9998292},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001656221,0.0027764996,0.9902303,0.00020565075,0.003205642,0.00037141802,0.000055660257,0.0004277481,0.002561458],"genre_scores_gemma":[0.49647743,0.000175077,0.5000651,0.0021599063,0.0008682526,0.000019815192,0.000089743626,0.000095683004,0.00004900166],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939086,0.000052117928,0.00080846064,0.0026625681,0.0015070874,0.0010611907],"domain_scores_gemma":[0.9969835,0.0004006373,0.00034131628,0.0018789207,0.00013622978,0.00025934647],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017686058,0.00074042747,0.00060020055,0.002255724,0.0005020547,0.0022584144,0.005096751,0.00036894073,0.00002008723],"category_scores_gemma":[0.0000695138,0.0007064757,0.00021985683,0.0026054808,0.00042889387,0.0018338138,0.0020389415,0.0013472417,0.000058341608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042953843,0.000056904333,0.00010079653,0.000092472816,0.000024012865,0.00016223243,0.00064168614,0.00036098904,0.0003139615,0.39723152,0.0001378334,0.6008733],"study_design_scores_gemma":[0.00021211743,0.00027897212,0.0000592717,0.0007174167,0.000021128522,0.000077829354,7.672597e-7,0.45435542,0.0003434128,0.5295515,0.013266295,0.0011158683],"about_ca_topic_score_codex":0.000035373443,"about_ca_topic_score_gemma":0.00006670313,"teacher_disagreement_score":0.59975743,"about_ca_system_score_codex":0.00029170976,"about_ca_system_score_gemma":0.00018951163,"threshold_uncertainty_score":0.99953866},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018735835,0.00019249182,0.9940499,0.00059935957,0.002079794,0.00022345515,0.0000075284615,0.0001501414,0.002509971],"genre_scores_gemma":[0.24261773,0.00012441086,0.7513873,0.001451144,0.00074975356,0.000015165043,0.000046712095,0.000074217554,0.0035335806],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690247,0.000024042663,0.0005360748,0.0010692932,0.0010564427,0.00041167013],"domain_scores_gemma":[0.99786484,0.0005443911,0.00030338074,0.0008491937,0.0003178025,0.000120377714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007767882,0.00034848382,0.00042799284,0.0015091298,0.00016677738,0.00021389395,0.0021603147,0.00021679323,0.000011257523],"category_scores_gemma":[0.00009244145,0.0003399288,0.00014954951,0.0014054234,0.0003971398,0.00042387185,0.0005626628,0.00040178664,0.000060808354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053551807,0.000034323108,0.000038700535,0.00007126264,0.000020690313,0.00007556867,0.0007361842,0.072771855,0.0007065087,0.29985285,0.00015188333,0.62553483],"study_design_scores_gemma":[0.00020228674,0.00019590156,0.00022425059,0.00026790163,0.00000825827,0.000033181535,1.0745353e-7,0.2535683,0.0030619977,0.74062026,0.0013211626,0.0004964309],"about_ca_topic_score_codex":0.000018700139,"about_ca_topic_score_gemma":0.000039829836,"teacher_disagreement_score":0.6250384,"about_ca_system_score_codex":0.00009060263,"about_ca_system_score_gemma":0.0004793154,"threshold_uncertainty_score":0.9999053},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010172869,0.00038565346,0.9958534,0.0012028033,0.0004291633,0.00054053694,0.000011205102,0.00007886201,0.00048108777],"genre_scores_gemma":[0.76958877,0.00064326474,0.22763719,0.0014110436,0.00015543097,0.000026249818,0.0000057794964,0.00006992134,0.0004623224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692553,0.000108824206,0.00048692554,0.0010882939,0.0008709785,0.0005194471],"domain_scores_gemma":[0.9967213,0.0016050311,0.00026116936,0.0010725823,0.0002095155,0.00013037291],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002062023,0.00036804372,0.0005746222,0.00078686175,0.0002482106,0.00026637764,0.0024428824,0.00012399806,0.000005320618],"category_scores_gemma":[0.0001942429,0.00025949406,0.0001008682,0.0007273361,0.0039369995,0.00038100022,0.0035866664,0.0006712491,0.000004638811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006865115,0.000024440727,0.00020445579,0.00013538323,0.000052507523,0.000047794678,0.0021852984,0.0016520905,0.00015972723,0.5225537,0.000011426132,0.47290456],"study_design_scores_gemma":[0.000798889,0.00020002121,0.00027222285,0.00029061423,0.0000073737783,0.00003427392,0.0000011579606,0.1670046,0.0003111904,0.8306671,0.00012765228,0.00028489612],"about_ca_topic_score_codex":0.00004062008,"about_ca_topic_score_gemma":0.00012156716,"teacher_disagreement_score":0.7685715,"about_ca_system_score_codex":0.00004382984,"about_ca_system_score_gemma":0.00011538472,"threshold_uncertainty_score":0.99998575},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006439401,0.00028322576,0.9794332,0.0067548724,0.001106156,0.00062926736,0.00015044381,0.00003869256,0.010960228],"genre_scores_gemma":[0.99147636,0.00001469704,0.0018739081,0.005394541,0.0009090305,0.000012882672,0.0002079958,0.000020963498,0.00008965297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973478,0.000016814916,0.00051052286,0.0007781256,0.001003783,0.00034295916],"domain_scores_gemma":[0.9970686,0.0009616765,0.00032197993,0.0015430595,0.00009543108,0.000009286744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016869132,0.00031554056,0.00035587407,0.0007982092,0.0002038496,0.0004902439,0.0033675972,0.00015880988,0.00014150389],"category_scores_gemma":[0.0006658706,0.00018125155,0.00011498009,0.0028548755,0.00048724312,0.0005964978,0.0009197795,0.00096713175,0.00005344096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119182994,0.00019907436,0.0075733736,0.0005644902,0.00010962529,0.000102962615,0.00054440193,0.12920853,0.000010927232,0.45568815,0.0012643663,0.40461493],"study_design_scores_gemma":[0.00009127499,0.000019977904,0.008060986,0.00047386155,0.00021117138,0.0000012460079,6.73892e-7,0.8992555,0.000007917212,0.074063964,0.017507644,0.00030578306],"about_ca_topic_score_codex":0.000094261275,"about_ca_topic_score_gemma":0.0013853252,"teacher_disagreement_score":0.9908324,"about_ca_system_score_codex":0.000062042476,"about_ca_system_score_gemma":0.00012302853,"threshold_uncertainty_score":0.7391224},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003481598,0.000097297656,0.9967662,0.00029364045,0.0009260441,0.0013597402,0.00003452589,0.00019236366,0.00032667152],"genre_scores_gemma":[0.00008916239,0.0000094815005,0.9984012,0.0001964635,0.00045734242,0.000028297645,0.000022359476,0.00014469042,0.0006509781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628717,0.00009219108,0.0007158482,0.0014414926,0.00086423283,0.00059906964],"domain_scores_gemma":[0.9964619,0.0014714998,0.00029366204,0.00091947103,0.00065844366,0.00019498724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023050306,0.00051988167,0.00065617554,0.0011508132,0.00023569273,0.00034925112,0.0010185875,0.0003771647,0.000065001375],"category_scores_gemma":[0.0005982435,0.00046916804,0.00017352164,0.00061207556,0.00026211044,0.0002503984,0.0005366496,0.0007459236,0.000004975177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024508263,0.000026413516,5.978133e-8,0.00016117889,0.000015320118,0.000010875413,0.00052446825,0.92533123,0.00022506973,0.012622432,0.00000366567,0.0610548],"study_design_scores_gemma":[0.00025301924,0.0001427757,3.0440187e-8,0.00038565006,0.000033785516,0.00003554631,0.0000012639802,0.82879543,0.0018473273,0.1680302,0.000076701544,0.000398249],"about_ca_topic_score_codex":0.00001071125,"about_ca_topic_score_gemma":0.00000920009,"teacher_disagreement_score":0.15540777,"about_ca_system_score_codex":0.00056115806,"about_ca_system_score_gemma":0.00041571356,"threshold_uncertainty_score":0.999776},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037575928,0.0008784033,0.98025894,0.00046080124,0.0005976984,0.00031867932,0.0000046753817,0.00079218316,0.016684832],"genre_scores_gemma":[0.002860191,0.000027451919,0.995157,0.00060935935,0.00022144923,0.000022796572,0.000003406397,0.000043440396,0.0010548871],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966252,0.000008934259,0.0004233137,0.0015350175,0.00083603617,0.00057150953],"domain_scores_gemma":[0.99813867,0.00029006245,0.00016323476,0.0011499252,0.00010812376,0.00014996198],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006710045,0.00049768004,0.00048092764,0.0007314598,0.00013101111,0.0031677366,0.0032086188,0.00023882337,0.0000015462281],"category_scores_gemma":[0.00006543476,0.00041861064,0.000065730244,0.0010730289,0.0009315727,0.0008769263,0.00338375,0.0007350892,0.0000419789],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.6334017e-7,0.000020565914,7.5861846e-7,0.0002943451,0.0000071717354,0.00008291297,0.00095923326,0.00014294208,0.00013463816,0.01992425,0.00033535276,0.97809726],"study_design_scores_gemma":[0.00004796519,0.000045901135,0.0000020215134,0.00056004623,0.0000061480414,0.00009085538,9.6734354e-8,0.3876682,0.0019336712,0.6082064,0.0010198428,0.00041888026],"about_ca_topic_score_codex":0.00000233499,"about_ca_topic_score_gemma":0.0000036410513,"teacher_disagreement_score":0.97767836,"about_ca_system_score_codex":0.00024415037,"about_ca_system_score_gemma":0.0007343409,"threshold_uncertainty_score":0.99982655},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017122432,0.00085108116,0.9936708,0.0014475394,0.00019291058,0.0013741516,0.000016979857,0.0001324308,0.002142869],"genre_scores_gemma":[0.17400527,0.00002657749,0.82140976,0.0039847135,0.00022997074,0.00027826798,0.000006319418,0.000036643098,0.000022472694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631643,0.000043086573,0.00040288814,0.001830547,0.0008088949,0.00059816486],"domain_scores_gemma":[0.9975466,0.00024983636,0.000074493335,0.0017778304,0.00010979922,0.00024145014],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009512236,0.00049932575,0.0003823805,0.0021909217,0.0003000945,0.0010540138,0.0041154223,0.00021501319,0.0000010498339],"category_scores_gemma":[0.000010247353,0.0003611076,0.00014867357,0.002680202,0.00052134134,0.0002760134,0.000682528,0.00068653264,0.000014040328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005413736,0.00011961594,0.000027811837,0.000066998124,0.00001252932,0.000015353515,0.004043296,0.5185923,0.00019005891,0.27860904,0.000015727008,0.19830184],"study_design_scores_gemma":[0.00009305984,0.00012474503,0.00011063114,0.0000916315,0.000010607915,0.000024155637,0.0000017373922,0.6970005,0.0000903666,0.30138415,0.00064812036,0.00042030396],"about_ca_topic_score_codex":0.000028444121,"about_ca_topic_score_gemma":0.0000947621,"teacher_disagreement_score":0.19788153,"about_ca_system_score_codex":0.000058330697,"about_ca_system_score_gemma":0.0002457975,"threshold_uncertainty_score":0.999983},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006524594,0.00014780059,0.98964703,0.00030434373,0.00059037335,0.00084702286,0.00012506277,0.00009222772,0.008180907],"genre_scores_gemma":[0.97898674,0.00001580029,0.019755013,0.00015717086,0.0003964923,0.00025870753,0.00005335931,0.000060364368,0.00031632322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987942,0.000001842018,0.00038739806,0.00029364467,0.00031620648,0.00020672874],"domain_scores_gemma":[0.99916786,0.00034811647,0.000044016408,0.00032109488,0.000083245235,0.000035649566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023398946,0.00020454713,0.00019507154,0.0003274877,0.000035976216,0.00028352294,0.0005774292,0.00018103888,0.0000080360405],"category_scores_gemma":[0.000019284626,0.00016832225,0.00007890834,0.00037520236,0.00023865425,0.00029557687,0.00008115976,0.00048627795,0.000012197026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024816661,0.000011965663,0.00004195362,0.00028965477,0.000017907398,0.0000014434963,0.0005935473,0.539243,0.000016367392,0.008379539,0.000031927233,0.45137024],"study_design_scores_gemma":[0.00020678889,0.00004723307,0.00004510863,0.000523341,0.000016083693,0.0000153899,0.000001759478,0.77786165,0.004139695,0.20325944,0.013468579,0.00041490677],"about_ca_topic_score_codex":0.000003900043,"about_ca_topic_score_gemma":0.000007295645,"teacher_disagreement_score":0.97892153,"about_ca_system_score_codex":0.00015291815,"about_ca_system_score_gemma":0.00009656742,"threshold_uncertainty_score":0.68639827},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043686223,0.0005640668,0.9867625,0.00048069935,0.00021178299,0.0002506842,0.000012238327,0.00012589933,0.007223511],"genre_scores_gemma":[0.8950985,0.00007828429,0.104258284,0.00014781619,0.0001074815,0.000010254329,0.000005816676,0.000013581664,0.0002799481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982562,0.000015792273,0.00027039353,0.00080129126,0.00041532674,0.00024100041],"domain_scores_gemma":[0.99895877,0.00025124883,0.00015558458,0.00046187537,0.00012793661,0.000044588414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000346258,0.00029296003,0.00034659074,0.00047117108,0.00015522947,0.00018140065,0.0007075394,0.0002394653,0.000004441714],"category_scores_gemma":[0.000029959154,0.0002174053,0.000034200555,0.00033109763,0.0013842286,0.00033659322,0.00022379038,0.0004632291,0.0000032351634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003334349,0.000041026222,0.0016158988,0.00022359504,0.000093879906,0.00014637086,0.009082599,0.0021621243,0.00084366126,0.64865667,0.00007198603,0.33702886],"study_design_scores_gemma":[0.00051959144,0.0014891665,0.005581037,0.0016995943,0.000059559497,0.0002466716,0.000009553624,0.08949243,0.015471286,0.8834322,0.00085789996,0.0011409828],"about_ca_topic_score_codex":0.000025076082,"about_ca_topic_score_gemma":0.0005624749,"teacher_disagreement_score":0.8907299,"about_ca_system_score_codex":0.000060562495,"about_ca_system_score_gemma":0.00025164557,"threshold_uncertainty_score":0.88655305},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010938933,0.0003764656,0.98871076,0.0034679605,0.004315161,0.0012044746,0.00001744182,0.00040546712,0.001501203],"genre_scores_gemma":[0.0003572797,0.000034416335,0.9895949,0.00615186,0.002038005,0.00008183617,0.000040565264,0.000041613992,0.0016595531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961366,0.000044373144,0.00060411735,0.00159368,0.0009956749,0.00062556576],"domain_scores_gemma":[0.9976312,0.00087050063,0.00026084093,0.00080073625,0.000249668,0.00018707394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013156821,0.00048520113,0.00044931998,0.0005271504,0.00025497933,0.00079498475,0.002071225,0.00031204484,0.00004415791],"category_scores_gemma":[0.0001266878,0.0004448923,0.00016733992,0.0005927999,0.0005300879,0.0007161098,0.0006811751,0.0006145323,0.000049349346],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011776694,0.00001931526,0.0000025488434,0.00008573886,0.000033590313,0.000061751045,0.0012171691,0.026085097,0.0009916793,0.05364909,0.0059330524,0.91190916],"study_design_scores_gemma":[0.00032850902,0.0002802546,0.0000023095197,0.00033963873,0.000015449134,0.000021609938,2.8831366e-7,0.56783026,0.016978336,0.4105921,0.0030712013,0.0005399933],"about_ca_topic_score_codex":0.000010620477,"about_ca_topic_score_gemma":0.00003931218,"teacher_disagreement_score":0.9113692,"about_ca_system_score_codex":0.00045187477,"about_ca_system_score_gemma":0.00054649793,"threshold_uncertainty_score":0.99980026},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036150333,0.00010868372,0.9901625,0.00479479,0.00019132589,0.0007207587,0.000008769322,0.000034016703,0.00036413196],"genre_scores_gemma":[0.94605196,0.00003262096,0.052368805,0.0007825699,0.00025086306,0.00008907869,0.000013409853,0.0000254973,0.0003852236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845165,0.000007640283,0.00032630263,0.00064553646,0.00038162046,0.00018727592],"domain_scores_gemma":[0.99864197,0.00024831123,0.00006710612,0.0005344035,0.0004449672,0.00006322179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058641174,0.00019258636,0.00038808782,0.00030254436,0.00008788181,0.000061456616,0.00027610437,0.00005686476,0.0000018215468],"category_scores_gemma":[0.00012782721,0.00013017561,0.0001615712,0.00032508787,0.00029449203,0.00009600224,0.00006713644,0.0003003882,0.0000064001333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009317044,0.000031042407,0.000044993034,0.00044909606,0.000039761617,0.000005763626,0.0028956586,0.09081934,0.012572749,0.001641312,0.000010156585,0.89139694],"study_design_scores_gemma":[0.00011677662,0.00014124399,0.000080399805,0.0005119459,0.00015072222,0.000016602113,0.0000019354459,0.9581791,0.00477149,0.035691123,0.00019027437,0.00014838246],"about_ca_topic_score_codex":0.000026514928,"about_ca_topic_score_gemma":0.000013509845,"teacher_disagreement_score":0.9424369,"about_ca_system_score_codex":0.00013031327,"about_ca_system_score_gemma":0.00016109251,"threshold_uncertainty_score":0.53084075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020823147,0.00029870315,0.99640435,0.00076126214,0.0008476388,0.00040877098,0.0000054999014,0.00014322298,0.0009222953],"genre_scores_gemma":[0.2030963,0.000033794247,0.7947176,0.0006527425,0.000370235,0.00002460882,0.0000374384,0.000037854803,0.0010294429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967405,0.00003732123,0.00047148427,0.0013993402,0.00094303937,0.000408285],"domain_scores_gemma":[0.99852,0.00018774382,0.00024326892,0.00066147454,0.0002709314,0.00011655256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056656526,0.0004328381,0.0004118144,0.00080487167,0.00021955075,0.00084313384,0.0008766526,0.00020680169,0.000013970303],"category_scores_gemma":[0.000026376747,0.00034713303,0.00011161749,0.00080773816,0.00028801616,0.0008734691,0.00037517457,0.00048202433,0.00004841569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022966984,0.00007031737,0.00020923256,0.000092408816,0.00011482535,0.00033023808,0.009208507,0.2990553,0.0013618543,0.06453667,0.000011434882,0.62498623],"study_design_scores_gemma":[0.0003753552,0.00018107655,0.0003435708,0.00031325335,0.000030684172,0.00003419776,0.0000028140457,0.9301887,0.0005827808,0.06726951,0.00020363274,0.0004743835],"about_ca_topic_score_codex":0.00005558133,"about_ca_topic_score_gemma":0.0006392195,"teacher_disagreement_score":0.63113344,"about_ca_system_score_codex":0.000360187,"about_ca_system_score_gemma":0.00038817336,"threshold_uncertainty_score":0.9998981},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067035067,0.0019710676,0.9856199,0.000025522671,0.0029197806,0.0002557241,0.000008566808,0.00043147063,0.002064486],"genre_scores_gemma":[0.98875046,0.00008201701,0.010515607,0.00004630232,0.00035270333,0.0000134785,0.0000056324634,0.000052734784,0.00018104214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983868,0.0000084253215,0.00032519762,0.000523248,0.00031206847,0.00044424096],"domain_scores_gemma":[0.9993699,0.00020428518,0.000047938458,0.0002889278,0.000025275542,0.00006364516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025082674,0.00034992438,0.0004383566,0.0005736986,0.000071513205,0.00015126029,0.00032558988,0.000111293906,0.000018283356],"category_scores_gemma":[0.000023670036,0.00034713923,0.00007348735,0.00033946708,0.00014855473,0.00024179852,0.00010082633,0.00079919025,0.000046835896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002160756,0.0000030818235,0.000022645176,0.00018457427,0.000015993719,0.00008454414,0.00043705967,0.25356156,0.005443186,0.00012423421,0.000002273083,0.7401187],"study_design_scores_gemma":[0.00015991007,0.000031344407,0.000090345406,0.0011035146,0.000015305211,0.000034846995,0.0000011841486,0.9670747,0.018167634,0.012260776,0.00057844754,0.00048198208],"about_ca_topic_score_codex":0.000015241228,"about_ca_topic_score_gemma":0.00015269803,"teacher_disagreement_score":0.98204696,"about_ca_system_score_codex":0.00036945197,"about_ca_system_score_gemma":0.000041722607,"threshold_uncertainty_score":0.9998981},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044323938,0.0025362202,0.9919806,0.00037312342,0.00030806244,0.0006464892,0.0000068381155,0.00036083156,0.0033446108],"genre_scores_gemma":[0.20859526,0.00051410747,0.7864643,0.00057153124,0.00060486543,0.000034551726,0.000055625576,0.0001257025,0.0030340727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762124,0.000010202605,0.00036652098,0.0010256694,0.0005162325,0.00046011142],"domain_scores_gemma":[0.9986631,0.00017908892,0.00015974049,0.00060521817,0.0002403491,0.00015247148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029582862,0.00040409126,0.0005956332,0.001068922,0.00019436891,0.00014237531,0.00038251694,0.0003305186,0.000016078167],"category_scores_gemma":[0.00005256443,0.00036099995,0.0001639061,0.0014540543,0.00032608694,0.0001546217,0.00035021084,0.0012774254,0.0000258667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012769415,0.000026172333,0.00004882199,0.00013296823,0.00002636852,0.000088166315,0.00038753837,0.7520998,0.0022240665,0.009011773,0.0000161486,0.23592538],"study_design_scores_gemma":[0.000121482786,0.00008759533,0.000020424524,0.00067099294,0.000054561635,0.000055785073,8.0854943e-7,0.9137211,0.0011672735,0.07797541,0.005731444,0.0003931512],"about_ca_topic_score_codex":0.00002039664,"about_ca_topic_score_gemma":0.000004041591,"teacher_disagreement_score":0.23553222,"about_ca_system_score_codex":0.00052895345,"about_ca_system_score_gemma":0.00024383044,"threshold_uncertainty_score":0.9998842},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002047045,0.000052662148,0.99236697,0.0036239077,0.0013178475,0.0008833283,0.0000160664,0.0007400608,0.0009970985],"genre_scores_gemma":[0.004393535,0.000020575844,0.9908659,0.003788075,0.0004186587,0.000072493654,0.00003969188,0.000046667883,0.00035439126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942909,0.00006488869,0.0007860339,0.0016513322,0.0025402901,0.00066659006],"domain_scores_gemma":[0.99549717,0.0020107205,0.0004035533,0.001266358,0.00044086343,0.00038134662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029155742,0.00047860638,0.0005425199,0.0013496241,0.00026708323,0.0005902163,0.0037339944,0.00057295494,0.000057968162],"category_scores_gemma":[0.0017086545,0.00044109236,0.00019740555,0.0012165734,0.001013896,0.0006621695,0.00065092253,0.000908417,0.0000395761],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000865008,0.000057471087,0.000010814565,0.0001387655,0.00001009515,0.00015773615,0.00012374652,0.001122941,0.00024613968,0.008178052,0.0005228668,0.98942274],"study_design_scores_gemma":[0.00052435714,0.00020759003,0.00005701222,0.00036650637,0.000009245754,0.00001468994,1.0552104e-7,0.91307575,0.0165731,0.06837235,0.0002584604,0.000540849],"about_ca_topic_score_codex":0.00003446195,"about_ca_topic_score_gemma":0.000079406636,"teacher_disagreement_score":0.9888819,"about_ca_system_score_codex":0.00034239734,"about_ca_system_score_gemma":0.0015768018,"threshold_uncertainty_score":0.9998041},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001352324,0.0008923372,0.99126506,0.00492043,0.00031638326,0.0009271794,0.000008601359,0.000060808103,0.00025686438],"genre_scores_gemma":[0.9573831,0.0004716793,0.029530726,0.011155124,0.0005585487,0.00006489359,0.000028200111,0.00009896054,0.0007087627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858564,0.000013995559,0.00021441533,0.0005757165,0.00038363214,0.0002265813],"domain_scores_gemma":[0.9963114,0.0029139358,0.00021346741,0.00027217198,0.00023430088,0.000054678283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051340304,0.0002081993,0.00036866366,0.00027054994,0.0001748963,0.00005057561,0.00021145324,0.00011219557,0.00000637569],"category_scores_gemma":[0.00019353443,0.00014415232,0.00004799566,0.00020418069,0.0008585615,0.00007724879,0.00012436797,0.00056311686,9.441634e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018964359,0.000015705522,0.0008703015,0.00069381064,0.00009262302,0.000036053876,0.0036532518,0.048041612,0.001155723,0.0004822622,0.000120010875,0.944649],"study_design_scores_gemma":[0.0026014282,0.0012934554,0.07209034,0.00567339,0.00035306878,0.00008821161,0.000014485483,0.90141994,0.0015720811,0.0028282912,0.011359165,0.00070616853],"about_ca_topic_score_codex":0.000096246644,"about_ca_topic_score_gemma":0.00010971466,"teacher_disagreement_score":0.96173435,"about_ca_system_score_codex":0.00044612013,"about_ca_system_score_gemma":0.0012546191,"threshold_uncertainty_score":0.5878361},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003264453,0.0005082396,0.98812795,0.0039424836,0.0028930723,0.00038671837,0.0000033323865,0.00023625583,0.00063748733],"genre_scores_gemma":[0.11514208,0.00048511158,0.8426738,0.017366337,0.013527069,0.000025532034,0.0004781285,0.0004430286,0.009858913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578077,0.00011381786,0.00073409063,0.0012443921,0.0014185978,0.00070832216],"domain_scores_gemma":[0.99747103,0.0010705063,0.00026827317,0.00052877585,0.00018150748,0.00047987374],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025308616,0.00045859104,0.000852654,0.00084565714,0.00022502535,0.00032253243,0.00070609164,0.0004823319,0.000068750065],"category_scores_gemma":[0.0010124844,0.00039735116,0.00019506057,0.0008930719,0.0013769771,0.00013567517,0.0011439933,0.0025503386,0.000053099946],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018051236,0.00006735066,0.00066232774,0.00036879984,0.00004326991,0.0008794101,0.00030211895,0.00077812927,0.00005892906,0.000049184106,0.0023685235,0.9944039],"study_design_scores_gemma":[0.001256899,0.00020427389,0.008885969,0.005807078,0.000052011634,0.0008235857,9.0580386e-7,0.9789853,0.000021700751,0.0022077188,0.0013353884,0.00041914496],"about_ca_topic_score_codex":0.000044764733,"about_ca_topic_score_gemma":0.000035214856,"teacher_disagreement_score":0.99398476,"about_ca_system_score_codex":0.00035081917,"about_ca_system_score_gemma":0.00068664516,"threshold_uncertainty_score":0.9998478},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036953024,0.00044430507,0.98816323,0.0006821289,0.00026108287,0.0002957905,0.000004961289,0.00004332873,0.0064098607],"genre_scores_gemma":[0.9563359,0.00011568802,0.039936606,0.0009878607,0.00039269347,0.000013354776,0.0000071693235,0.000035166886,0.0021755362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817514,0.000012122146,0.00045103583,0.00054216705,0.0005195538,0.000299971],"domain_scores_gemma":[0.9987305,0.00058842875,0.00014321615,0.00040495535,0.0000802436,0.000052659012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011481455,0.00029082707,0.0003942051,0.0008888019,0.00010993662,0.00024669303,0.0005712733,0.00021445155,0.000022667256],"category_scores_gemma":[0.00009923237,0.00019286718,0.00010800144,0.0006605364,0.00041167476,0.00017592974,0.00034308006,0.0007481713,0.000015119884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102023405,0.00010409821,0.00010767437,0.0005095163,0.00013122137,0.00014683737,0.020893848,0.14810021,0.00002047471,0.68932176,0.00030545678,0.14025687],"study_design_scores_gemma":[0.00014230175,0.000043894583,0.0000050785557,0.00014404059,0.000031751657,0.000030956176,0.0000076072,0.5550361,0.000032311254,0.44421008,0.00015380213,0.0001620458],"about_ca_topic_score_codex":0.000080070546,"about_ca_topic_score_gemma":0.000601905,"teacher_disagreement_score":0.95264065,"about_ca_system_score_codex":0.00013615855,"about_ca_system_score_gemma":0.00013438771,"threshold_uncertainty_score":0.78648955},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049812063,0.00054286886,0.9654745,0.023132967,0.0020315289,0.0013086876,0.000019249272,0.0017726722,0.0007363561],"genre_scores_gemma":[0.50238055,0.000044959572,0.49477264,0.0019499211,0.0003462883,0.00008626691,0.00003763024,0.00014867235,0.00023302755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919859,0.00014007844,0.0011096846,0.0035819223,0.0016594649,0.0015229076],"domain_scores_gemma":[0.98847634,0.0011833926,0.00048404722,0.0093928585,0.00024039374,0.00022294879],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0017025513,0.0011622194,0.000988033,0.0027802344,0.000428213,0.0016783588,0.043476325,0.0008721206,0.00007021075],"category_scores_gemma":[0.009537806,0.001057428,0.00022806808,0.0025291066,0.0006333187,0.0010675546,0.10654014,0.005481421,0.00020216245],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021055088,0.00054167066,0.0033608484,0.0022869115,0.00016080897,0.0051459363,0.0055478965,0.043528955,0.00410741,0.020114781,0.00059848366,0.91439575],"study_design_scores_gemma":[0.00038885843,0.00017792753,0.0000957718,0.0011026633,0.0000088542065,0.000060137452,1.8163257e-7,0.6063346,0.0013744077,0.38894853,0.0007592062,0.00074883696],"about_ca_topic_score_codex":0.0003179441,"about_ca_topic_score_gemma":0.00024394291,"teacher_disagreement_score":0.91364694,"about_ca_system_score_codex":0.0008849872,"about_ca_system_score_gemma":0.00093142834,"threshold_uncertainty_score":0.999358},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019780463,0.00055607286,0.9928346,0.00007693624,0.0028954318,0.00043571237,0.0000012104089,0.00036978928,0.0008521847],"genre_scores_gemma":[0.91271126,0.00010643114,0.083570816,0.00014107571,0.00076789444,0.00004694767,0.0000063814236,0.00017054973,0.0024786594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969876,0.000020727844,0.00040764175,0.00090200413,0.0010093885,0.00067267707],"domain_scores_gemma":[0.9986793,0.00027961735,0.00009299643,0.0006561108,0.00013046314,0.00016153773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007342205,0.0006110244,0.00040693316,0.0009095191,0.00016247232,0.00032538807,0.000729298,0.00019168574,0.000029340494],"category_scores_gemma":[0.00005182568,0.0005452519,0.000092383445,0.00055679004,0.00018848824,0.0001712436,0.00043170803,0.00092673,0.00008602825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006542782,0.0000064459846,0.00012440019,0.00014080106,0.000048758644,0.00031346624,0.0003510024,0.9920452,0.00026411103,0.000029577195,0.00001620945,0.0065945615],"study_design_scores_gemma":[0.0005173835,0.00016783465,0.00039620296,0.0012668152,0.00004240857,0.00001097684,8.7493015e-7,0.98634505,0.0037943227,0.000063794425,0.0067560873,0.0006382511],"about_ca_topic_score_codex":0.00001458223,"about_ca_topic_score_gemma":0.000020360836,"teacher_disagreement_score":0.9107332,"about_ca_system_score_codex":0.0016257473,"about_ca_system_score_gemma":0.00023669495,"threshold_uncertainty_score":0.9996999},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029616593,0.0017412557,0.9628925,0.030275056,0.0004686898,0.00075733697,0.0000054114275,0.0004996856,0.0030639237],"genre_scores_gemma":[0.061054084,0.00030827767,0.93811643,0.00027479234,0.00009910197,0.00002900608,0.000014808505,0.000042334468,0.000061192564],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99451435,0.0000873007,0.00057561696,0.0020601342,0.002176695,0.0005858775],"domain_scores_gemma":[0.98368156,0.0020239553,0.00033574906,0.013364126,0.000455488,0.00013912555],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0032223845,0.00053347246,0.0004995274,0.0010135022,0.000349378,0.001776531,0.026938492,0.0004689997,0.000020010957],"category_scores_gemma":[0.010136284,0.00045716038,0.00005597066,0.000986869,0.0010758414,0.0022450606,0.11844998,0.0016157571,0.000035505138],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021116359,0.000049510745,0.00005197937,0.000077985314,0.00003557512,0.000060402344,0.0002781436,0.0012008286,0.000070844544,0.033502042,0.0011551519,0.96349645],"study_design_scores_gemma":[0.00017115755,0.000110566885,0.000108578526,0.00085326284,0.000022266611,0.000089624904,2.5233567e-7,0.48506883,0.00019078451,0.5127239,0.00036289715,0.00029786723],"about_ca_topic_score_codex":0.000036098943,"about_ca_topic_score_gemma":0.00032261884,"teacher_disagreement_score":0.96319854,"about_ca_system_score_codex":0.0006332625,"about_ca_system_score_gemma":0.00085561565,"threshold_uncertainty_score":0.999788},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013995521,0.0012532094,0.9952332,0.0014352028,0.00047942818,0.00061165146,0.00001556373,0.00019372665,0.00063809345],"genre_scores_gemma":[0.80822545,0.000005754195,0.19030207,0.00090946804,0.0001356803,0.00003093687,0.000016186865,0.000023668694,0.00035075494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769413,0.000012564504,0.0002626615,0.0011968594,0.0004699172,0.00036386383],"domain_scores_gemma":[0.99882644,0.00018202045,0.00012383529,0.0006154273,0.00013729034,0.000115003575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002843527,0.00035525762,0.00029283317,0.00023293709,0.00013148204,0.0005113639,0.0011240973,0.00013576701,0.0000035734358],"category_scores_gemma":[0.000019817438,0.00028073738,0.00005337477,0.00034156273,0.00050392386,0.00023027892,0.0006563625,0.0004104656,0.00001670504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000150032565,0.000016496508,0.00012294574,0.000098145836,0.000020127365,0.000034725515,0.0009005725,0.049399257,0.00001724056,0.17412917,0.000023968349,0.77522236],"study_design_scores_gemma":[0.0002805279,0.00017041652,0.0002117397,0.0002989624,0.000010743474,0.0000945538,3.863678e-7,0.9474008,0.0000873925,0.049994975,0.0011147022,0.00033480686],"about_ca_topic_score_codex":0.00013618756,"about_ca_topic_score_gemma":0.00027923303,"teacher_disagreement_score":0.89800155,"about_ca_system_score_codex":0.00031474355,"about_ca_system_score_gemma":0.00017475618,"threshold_uncertainty_score":0.9999645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024901594,0.0009594217,0.9937518,0.00009402828,0.0008656848,0.00036756726,0.00003102665,0.00075649424,0.0006837771],"genre_scores_gemma":[0.9602074,0.000067290224,0.039086524,0.00012413804,0.0002387194,0.00001537433,0.000012336403,0.00007940749,0.00016881034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983328,0.000004178484,0.00031074169,0.00076092634,0.00016996717,0.00042140216],"domain_scores_gemma":[0.9990777,0.00018760006,0.000047144786,0.0005433744,0.00004848951,0.00009573391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028436305,0.00037461764,0.00038853544,0.0004049114,0.00013502083,0.00012493973,0.0005564249,0.00047246186,0.0000066209627],"category_scores_gemma":[0.000020649912,0.0003747172,0.000057069094,0.00015187499,0.00045900315,0.00019223752,0.00021207076,0.00063820864,0.000006723939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031244638,0.0000050025556,0.000026033347,0.0001648886,0.000019770861,0.000044519147,0.00022840546,0.6666367,0.00007725851,0.019484403,0.0000043656146,0.3133055],"study_design_scores_gemma":[0.000100536075,0.000072623974,0.000050372535,0.00022089716,0.000015747877,0.00002347879,1.8095656e-7,0.8495232,0.00015901616,0.1474907,0.0019832524,0.00036000396],"about_ca_topic_score_codex":0.0000050000463,"about_ca_topic_score_gemma":0.00009579269,"teacher_disagreement_score":0.95771724,"about_ca_system_score_codex":0.00025691662,"about_ca_system_score_gemma":0.00010013858,"threshold_uncertainty_score":0.9998705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012822164,0.000046996996,0.99501,0.0024251125,0.00027755616,0.0004362571,0.000008928491,0.00039286655,0.0012740596],"genre_scores_gemma":[0.020607052,0.00010223201,0.96252537,0.005014525,0.0009807937,0.00005509902,0.00018090023,0.00010349796,0.010430517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982423,0.000008549331,0.0002403529,0.00071186206,0.0005180408,0.0002788549],"domain_scores_gemma":[0.9988932,0.0002852828,0.00009760153,0.00049851736,0.00012828714,0.00009710085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017172557,0.00021029293,0.0002811961,0.00042948133,0.0001364909,0.000046959947,0.0003859773,0.0001221906,0.000011624271],"category_scores_gemma":[0.000057879268,0.00018658263,0.00006807891,0.0006939757,0.00042326038,0.000058706384,0.00034803126,0.00055676285,0.000058235742],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034318542,0.00019012827,0.0012009194,0.00029702886,0.000017001104,0.00043894871,0.00050156243,0.20712534,0.0008020266,0.0052516763,0.009649871,0.7744912],"study_design_scores_gemma":[0.00033921184,0.00014613067,0.0018368857,0.00066369487,0.000017261744,0.00017061236,8.705102e-8,0.55624783,0.0003080763,0.42994118,0.009989394,0.00033961757],"about_ca_topic_score_codex":0.0000028184054,"about_ca_topic_score_gemma":0.000002577666,"teacher_disagreement_score":0.77415156,"about_ca_system_score_codex":0.0002508798,"about_ca_system_score_gemma":0.00053092884,"threshold_uncertainty_score":0.7608619},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023804854,0.000018339351,0.9957733,0.00051664433,0.0001864074,0.0005166515,0.000026238376,0.000385215,0.00019667477],"genre_scores_gemma":[0.15162317,0.0000107008145,0.8465664,0.0014139024,0.00019718189,0.000015193858,0.00009547156,0.000027935701,0.00005008836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984384,0.0000057878974,0.00031232586,0.0005617459,0.0004150042,0.00026671804],"domain_scores_gemma":[0.9988238,0.00011910187,0.00026260965,0.0004553376,0.00025438698,0.00008476864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016412142,0.00024544811,0.00025523707,0.0001916814,0.00017718211,0.0001222362,0.00024270646,0.00008587854,0.0000034959949],"category_scores_gemma":[0.000108376735,0.00021252639,0.000046686706,0.0003359272,0.00025992797,0.00044800952,0.00017959366,0.0004245974,0.000019393143],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027655618,0.0000133176,0.005825892,0.00004976317,0.0000060943157,0.00005244452,0.00032790803,0.0022488297,0.00050405954,0.0005490158,0.000008574596,0.9903864],"study_design_scores_gemma":[0.000971527,0.00011919868,0.018464986,0.0009468509,0.00006989836,0.00016608834,0.0000036762442,0.9504084,0.003237654,0.024691263,0.00035303988,0.0005673956],"about_ca_topic_score_codex":0.00012793874,"about_ca_topic_score_gemma":0.000046061894,"teacher_disagreement_score":0.98981905,"about_ca_system_score_codex":0.0002700793,"about_ca_system_score_gemma":0.00017727588,"threshold_uncertainty_score":0.86665744},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036972124,0.000049262588,0.98498964,0.0030133568,0.00015457842,0.0009838261,0.000007178963,0.00021800201,0.01021441],"genre_scores_gemma":[0.022933442,0.00006645451,0.9600336,0.0045195566,0.0002963668,0.000100275356,0.000041351792,0.00008661564,0.011922325],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978203,0.0000044244057,0.0002524432,0.0012697233,0.00036059256,0.00029247443],"domain_scores_gemma":[0.9986926,0.00005319846,0.00009331916,0.00092926144,0.00010478258,0.00012684241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002920026,0.00024280512,0.00029695354,0.00044958605,0.00013054656,0.00009003128,0.00026354165,0.00010518654,0.000016556507],"category_scores_gemma":[0.000032324722,0.00022431208,0.000038457914,0.00046264313,0.00023765532,0.00011321864,0.0003655969,0.00038881757,0.00006985483],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004955302,0.0012634944,0.06463517,0.0034731175,0.00016856726,0.00025841477,0.013263193,0.15081893,0.0181876,0.034330845,0.03354943,0.6795557],"study_design_scores_gemma":[0.0034876151,0.00317222,0.03216255,0.0055621946,0.00037970545,0.0016406988,0.000016305872,0.3455529,0.02896972,0.53091127,0.043129124,0.0050157136],"about_ca_topic_score_codex":0.000016206146,"about_ca_topic_score_gemma":0.0000030077272,"teacher_disagreement_score":0.67454,"about_ca_system_score_codex":0.00012787459,"about_ca_system_score_gemma":0.00009140742,"threshold_uncertainty_score":0.9147181},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009815591,0.002727345,0.9883694,0.004136532,0.0015567099,0.0001936191,0.0000018677072,0.0004316469,0.0025730699],"genre_scores_gemma":[0.002601667,0.000101312944,0.99411666,0.0017283449,0.00024470416,0.000008326974,0.0000012315779,0.000028616638,0.0011691112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969152,0.00001931826,0.00032624652,0.0016318959,0.00051328354,0.00059404277],"domain_scores_gemma":[0.9983042,0.00023009053,0.000105454834,0.0011026576,0.00012970285,0.00012790937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004425581,0.00038586292,0.0003880588,0.0015696436,0.00017565608,0.00081939186,0.0025121304,0.00023003724,0.000006060511],"category_scores_gemma":[0.00012827247,0.0003335689,0.000057675657,0.001843541,0.001095364,0.0007988404,0.0030805864,0.0010333844,0.000103574166],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.698256e-7,0.0000077772775,0.000008549445,0.00004991252,0.0000031203667,0.00016347811,0.00022949,0.00016788248,0.00046234648,0.00540808,0.00037911377,0.9931196],"study_design_scores_gemma":[0.00010018642,0.00006131362,0.000011901127,0.0004168068,0.0000032078112,0.00019172166,1.4626337e-7,0.56891537,0.000889308,0.41703814,0.012007845,0.00036406223],"about_ca_topic_score_codex":0.0000022559957,"about_ca_topic_score_gemma":0.0000061832347,"teacher_disagreement_score":0.99275553,"about_ca_system_score_codex":0.00023444025,"about_ca_system_score_gemma":0.0006328762,"threshold_uncertainty_score":0.9999116},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012441382,0.0017471083,0.990092,0.0006003507,0.0017374998,0.0014347499,0.002046551,0.00038625865,0.0007113343],"genre_scores_gemma":[0.06405623,0.00064068596,0.92566526,0.005287315,0.0011981779,0.00029951645,0.002222997,0.00018419047,0.00044563864],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950483,0.0000438229,0.00086192304,0.0023212195,0.00080428383,0.00092044374],"domain_scores_gemma":[0.9975008,0.0006594488,0.0002596425,0.0010020403,0.00034177015,0.00023633847],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018942846,0.0006666366,0.00069038244,0.0014097956,0.0002595646,0.0012802151,0.0018014032,0.00056163303,0.000027602133],"category_scores_gemma":[0.00023024438,0.0006397248,0.00013201019,0.0006695082,0.0007499844,0.0010046824,0.0015132622,0.0010714872,0.000064979955],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030149666,0.000096280746,0.0000834427,0.00030086015,0.000017957056,0.00015886125,0.0033401982,0.00006341883,0.0003252033,0.0010628868,0.0002706199,0.9942501],"study_design_scores_gemma":[0.00243153,0.0007074232,0.00024043082,0.002659553,0.000056458914,0.0002823597,0.000007714535,0.40127403,0.012135823,0.549844,0.028022846,0.002337826],"about_ca_topic_score_codex":0.000052742995,"about_ca_topic_score_gemma":0.00081724866,"teacher_disagreement_score":0.9919123,"about_ca_system_score_codex":0.00027195798,"about_ca_system_score_gemma":0.00038687678,"threshold_uncertainty_score":0.9997566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018338625,0.0001509218,0.98702306,0.0023850857,0.0019584754,0.002890422,0.00011097108,0.000091542315,0.0052061565],"genre_scores_gemma":[0.7141191,0.00005754566,0.24913172,0.004064763,0.0033976687,0.0012350034,0.0011864873,0.00019362957,0.026614107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685305,0.0000722451,0.0008611739,0.00084293174,0.0006209593,0.0007496337],"domain_scores_gemma":[0.99636704,0.0018836856,0.00032373238,0.00034163293,0.00093723444,0.00014667585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002054447,0.00030059568,0.0003698052,0.0005944961,0.0010981048,0.00007649556,0.0004664331,0.00040621118,0.000088546345],"category_scores_gemma":[0.00081472564,0.000247103,0.00009338609,0.0004047564,0.0002899143,0.000273022,0.00025372807,0.0016333564,0.00011023875],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022148606,0.000036533223,0.00034580918,0.0028048672,0.000026633337,0.000025281253,0.003118462,0.014347075,0.00014031303,0.08314874,0.0009568065,0.89482796],"study_design_scores_gemma":[0.0002885886,0.00019606833,0.00025543632,0.0029350014,0.00000745621,0.0000038959615,0.0000016322007,0.67523736,0.000027616708,0.31707165,0.0037619048,0.00021338653],"about_ca_topic_score_codex":0.00009027799,"about_ca_topic_score_gemma":0.0006218603,"teacher_disagreement_score":0.8946146,"about_ca_system_score_codex":0.0009990555,"about_ca_system_score_gemma":0.0018432642,"threshold_uncertainty_score":0.9999981},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026321335,0.0020753113,0.9867403,0.00087441516,0.0022644561,0.00023323511,0.00002001556,0.00017546774,0.0075905044],"genre_scores_gemma":[0.3213863,0.0045529306,0.5732723,0.029025007,0.03932782,0.000064704196,0.0052377307,0.0007952023,0.026338015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964501,0.0000055454143,0.00033083194,0.0017968809,0.0009019528,0.00051466085],"domain_scores_gemma":[0.9981484,0.00010458456,0.00019681372,0.0011854488,0.0003349286,0.000029853943],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015982876,0.00036894222,0.00030357472,0.0013520836,0.00049373106,0.0029417307,0.0037469424,0.00014750159,0.00012562958],"category_scores_gemma":[0.00056121766,0.00030711587,0.000023903387,0.0028432228,0.0020504778,0.0038376371,0.006487265,0.0007424061,0.0001333006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001214251,0.00005872163,0.0015920366,0.0010737999,0.000015852964,0.00009959225,0.00015176757,0.30523935,0.000062001796,0.009869029,0.0032835472,0.6785422],"study_design_scores_gemma":[0.000055073735,0.0000076139213,0.000044332082,0.0003951719,0.000022591725,0.000018155239,1.8330164e-7,0.89724445,0.000019583582,0.011105119,0.09072188,0.00036583227],"about_ca_topic_score_codex":0.00015829563,"about_ca_topic_score_gemma":0.00011485151,"teacher_disagreement_score":0.67817634,"about_ca_system_score_codex":0.000110640416,"about_ca_system_score_gemma":0.000652799,"threshold_uncertainty_score":0.9999381},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026321335,0.0020753113,0.9867403,0.00087441516,0.0022644561,0.00023323511,0.00002001556,0.00017546774,0.0075905044],"genre_scores_gemma":[0.3213863,0.0045529306,0.5732723,0.029025007,0.03932782,0.000064704196,0.0052377307,0.0007952023,0.026338015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964501,0.0000055454143,0.00033083194,0.0017968809,0.0009019528,0.00051466085],"domain_scores_gemma":[0.9981484,0.00010458456,0.00019681372,0.0011854488,0.0003349286,0.000029853943],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015982876,0.00036894222,0.00030357472,0.0013520836,0.00049373106,0.0029417307,0.0037469424,0.00014750159,0.00012562958],"category_scores_gemma":[0.00056121766,0.00030711587,0.000023903387,0.0028432228,0.0020504778,0.0038376371,0.006487265,0.0007424061,0.0001333006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001214251,0.00005872163,0.0015920366,0.0010737999,0.000015852964,0.00009959225,0.00015176757,0.30523935,0.000062001796,0.009869029,0.0032835472,0.6785422],"study_design_scores_gemma":[0.000055073735,0.0000076139213,0.000044332082,0.0003951719,0.000022591725,0.000018155239,1.8330164e-7,0.89724445,0.000019583582,0.011105119,0.09072188,0.00036583227],"about_ca_topic_score_codex":0.00015829563,"about_ca_topic_score_gemma":0.00011485151,"teacher_disagreement_score":0.67817634,"about_ca_system_score_codex":0.000110640416,"about_ca_system_score_gemma":0.000652799,"threshold_uncertainty_score":0.9999381},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057436796,0.00092077034,0.99221957,0.00008249337,0.00038225602,0.000563414,0.000018855122,0.000036656824,0.000032335454],"genre_scores_gemma":[0.38725042,0.000038695365,0.6103826,0.00022696004,0.0007018598,0.000025324869,0.00028184924,0.00004603368,0.0010462574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981053,0.000032314463,0.0004398508,0.0007339648,0.00031830108,0.00037025203],"domain_scores_gemma":[0.99909866,0.000016399785,0.00024062132,0.00042178688,0.00014236911,0.00008019181],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000523318,0.00032342938,0.0002735348,0.00035083512,0.00020407587,0.00018265781,0.00030083422,0.00029746312,0.000007273441],"category_scores_gemma":[0.00007549292,0.00030166734,0.00012319446,0.0003702146,0.00031106806,0.000017498825,0.0005270482,0.0004410214,0.000004102699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011735455,0.00001669365,0.0038787995,0.00009081623,0.00011197067,0.0000050596905,0.00010278972,0.98158103,0.0016884725,0.000030112731,0.0000035885635,0.012478955],"study_design_scores_gemma":[0.00022347576,0.00016941705,0.0016868594,0.00012749969,0.00014614852,0.000016229575,3.066593e-7,0.996543,0.00011524221,0.0002113022,0.00048054327,0.0002800062],"about_ca_topic_score_codex":0.000028779403,"about_ca_topic_score_gemma":0.00023042086,"teacher_disagreement_score":0.38183695,"about_ca_system_score_codex":0.000089695655,"about_ca_system_score_gemma":0.000076482334,"threshold_uncertainty_score":0.99994355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005063984,0.0011466823,0.9867252,0.0012186915,0.0058454564,0.00063915894,0.00012730698,0.00066751934,0.0035793062],"genre_scores_gemma":[0.44456127,0.00017947872,0.54067993,0.009257695,0.004151916,0.00013155001,0.00010700848,0.00025982547,0.0006713411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99488646,0.000037721486,0.00059066765,0.0024362463,0.0012519676,0.0007969381],"domain_scores_gemma":[0.99668986,0.00040657274,0.00018430501,0.0019293703,0.00038189173,0.00040802636],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00083891774,0.00068569626,0.0006069072,0.0017965337,0.00039695788,0.0011671786,0.0030675037,0.00042683873,0.00006510919],"category_scores_gemma":[0.00008415689,0.0006197066,0.0002589942,0.0019603446,0.0004444909,0.0008098675,0.002214897,0.0012572267,0.00067773403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015502887,0.00004809907,0.000010064369,0.000117013835,0.000037657268,0.00034311484,0.0012512413,0.0033153568,0.00027482084,0.76576495,0.001589593,0.22723258],"study_design_scores_gemma":[0.00022604327,0.0005383953,0.000180013,0.0016587784,0.000038048292,0.00024490536,9.75077e-7,0.10498876,0.00029464546,0.7982258,0.0922486,0.0013550307],"about_ca_topic_score_codex":0.000035647165,"about_ca_topic_score_gemma":0.00023070212,"teacher_disagreement_score":0.4460453,"about_ca_system_score_codex":0.00021877026,"about_ca_system_score_gemma":0.0004593236,"threshold_uncertainty_score":0.9998697},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013573434,0.0033182066,0.99302244,0.00087508926,0.00072272896,0.00059512455,0.000005101357,0.00070325454,0.0007444778],"genre_scores_gemma":[0.0055753323,0.000033687247,0.99197894,0.0009400832,0.00050788384,0.00004817265,0.0000056774884,0.000038376405,0.00087184424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673486,0.00003532056,0.0004268736,0.0016346104,0.0005382761,0.00063003594],"domain_scores_gemma":[0.99837995,0.00042214376,0.00017804025,0.0006836684,0.000193208,0.00014300273],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008693164,0.00047360596,0.0004678212,0.00090947695,0.00031084917,0.0012359566,0.002127916,0.0002783261,8.831389e-7],"category_scores_gemma":[0.00009357952,0.00040860462,0.00010231943,0.0008218386,0.0005009673,0.00016606036,0.001152591,0.0006445283,0.000004250801],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031710886,0.000013585994,0.0000042238207,0.00020910888,0.0000065855984,0.000018140705,0.0009804622,0.10976404,0.000006639932,0.001508228,0.00040758098,0.8870782],"study_design_scores_gemma":[0.000120406396,0.000106924774,0.000008990699,0.00044408458,0.000006052559,0.000059274913,6.9464946e-8,0.7514027,0.00016292761,0.24555095,0.0017536095,0.0003840213],"about_ca_topic_score_codex":0.0000053636495,"about_ca_topic_score_gemma":0.000008360055,"teacher_disagreement_score":0.8866942,"about_ca_system_score_codex":0.00018751796,"about_ca_system_score_gemma":0.0010354378,"threshold_uncertainty_score":0.99983656},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013573434,0.0033182066,0.99302244,0.00087508926,0.00072272896,0.00059512455,0.000005101357,0.00070325454,0.0007444778],"genre_scores_gemma":[0.0055753323,0.000033687247,0.99197894,0.0009400832,0.00050788384,0.00004817265,0.0000056774884,0.000038376405,0.00087184424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673486,0.00003532056,0.0004268736,0.0016346104,0.0005382761,0.00063003594],"domain_scores_gemma":[0.99837995,0.00042214376,0.00017804025,0.0006836684,0.000193208,0.00014300273],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008693164,0.00047360596,0.0004678212,0.00090947695,0.00031084917,0.0012359566,0.002127916,0.0002783261,8.831389e-7],"category_scores_gemma":[0.00009357952,0.00040860462,0.00010231943,0.0008218386,0.0005009673,0.00016606036,0.001152591,0.0006445283,0.000004250801],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031710886,0.000013585994,0.0000042238207,0.00020910888,0.0000065855984,0.000018140705,0.0009804622,0.10976404,0.000006639932,0.001508228,0.00040758098,0.8870782],"study_design_scores_gemma":[0.000120406396,0.000106924774,0.000008990699,0.00044408458,0.000006052559,0.000059274913,6.9464946e-8,0.7514027,0.00016292761,0.24555095,0.0017536095,0.0003840213],"about_ca_topic_score_codex":0.0000053636495,"about_ca_topic_score_gemma":0.000008360055,"teacher_disagreement_score":0.8866942,"about_ca_system_score_codex":0.00018751796,"about_ca_system_score_gemma":0.0010354378,"threshold_uncertainty_score":0.99983656},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012714515,0.009511808,0.5932657,0.0014891891,0.010743565,0.0006565409,0.000013489927,0.00022729907,0.38396528],"genre_scores_gemma":[0.26541814,0.020065978,0.37061486,0.022858394,0.045805365,0.00023598871,0.0001321979,0.00052815274,0.27434093],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965927,0.00006127555,0.0003849357,0.001061155,0.0010661619,0.00083378126],"domain_scores_gemma":[0.9986439,0.0005525179,0.00011068009,0.00038926594,0.000099420155,0.00020421237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010309917,0.0003433663,0.00046641123,0.0006939193,0.00009422294,0.0007218101,0.0014194018,0.0003037162,0.000038616326],"category_scores_gemma":[0.00014743964,0.0003023415,0.00012166888,0.0012989518,0.001759753,0.00074116496,0.00048658793,0.0007511355,0.00012636428],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024294923,0.000021502647,0.000074804186,0.00005718933,0.0000020539474,0.00009660065,0.005750371,0.0039091436,7.330099e-7,0.0031238333,0.0003912989,0.98657006],"study_design_scores_gemma":[0.00014559212,0.00009645321,0.00007730059,0.0012717012,0.0000063281464,0.0000064753126,0.000004249035,0.013152077,0.000016181233,0.099898465,0.8847841,0.000541079],"about_ca_topic_score_codex":0.00006951242,"about_ca_topic_score_gemma":0.0041752164,"teacher_disagreement_score":0.98602897,"about_ca_system_score_codex":0.0006425089,"about_ca_system_score_gemma":0.0019993847,"threshold_uncertainty_score":0.9999429},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101881466,0.001218011,0.9633063,0.0016455087,0.006061099,0.0003836567,0.000004496664,0.00049828354,0.026780726],"genre_scores_gemma":[0.1593992,0.0002086417,0.8200514,0.0069637913,0.0034679684,0.00004112946,0.0000067758756,0.00023779091,0.009623342],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99460477,0.000033728662,0.0006941075,0.0024219893,0.0012891326,0.0009563011],"domain_scores_gemma":[0.99641556,0.0007811773,0.00022322501,0.002101543,0.00024972815,0.00022877168],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011643443,0.00073449843,0.0005970005,0.0012724319,0.00028959961,0.0013385267,0.0051343255,0.00046273004,0.00004892642],"category_scores_gemma":[0.0002172014,0.0006616475,0.00025272454,0.0009032122,0.0008349043,0.00043738683,0.0020755925,0.0015501796,0.0008490491],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005652991,0.000026418556,0.000009610495,0.00005160134,0.000017702288,0.0004811123,0.0015242101,0.024203535,0.00023132983,0.18820637,0.00014373551,0.78509873],"study_design_scores_gemma":[0.000038593334,0.00026112035,0.000007420738,0.0010338186,0.000010018149,0.0000625494,3.5457643e-7,0.45638078,0.008485788,0.5248795,0.00803483,0.00080521574],"about_ca_topic_score_codex":0.00004373063,"about_ca_topic_score_gemma":0.00014024516,"teacher_disagreement_score":0.78429353,"about_ca_system_score_codex":0.00058507425,"about_ca_system_score_gemma":0.0005754214,"threshold_uncertainty_score":0.9999289},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017143824,0.0017283591,0.97977436,0.0012436308,0.004935875,0.0007069662,0.00001868375,0.00068517216,0.010735499],"genre_scores_gemma":[0.43193895,0.0002980848,0.5390119,0.008254617,0.0024901526,0.000115388924,0.000027738077,0.00030680562,0.01755638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929084,0.00005193338,0.0011946678,0.0028118512,0.0017387107,0.0012944229],"domain_scores_gemma":[0.9953273,0.0012186966,0.00043567864,0.002290878,0.00037604745,0.0003514287],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010694074,0.0010155439,0.001095475,0.0013312437,0.00037954442,0.001997678,0.006487866,0.00055847986,0.00008132322],"category_scores_gemma":[0.0002355923,0.00084287225,0.00027571537,0.0014927209,0.0014612727,0.0010849407,0.003130715,0.0017963616,0.0004558395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020117102,0.00008940078,0.00007372199,0.00015083433,0.00004445285,0.00059964246,0.003001931,0.08246739,0.00019902614,0.03827368,0.0008505357,0.87422925],"study_design_scores_gemma":[0.000097447475,0.0003022801,0.000014029778,0.001380614,0.000024570618,0.000085889755,0.0000017567471,0.82663995,0.0071357926,0.14433366,0.018712012,0.0012719829],"about_ca_topic_score_codex":0.00006318882,"about_ca_topic_score_gemma":0.00049114175,"teacher_disagreement_score":0.8729573,"about_ca_system_score_codex":0.0006378861,"about_ca_system_score_gemma":0.0012064239,"threshold_uncertainty_score":0.9994022},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000089666384,0.0010547949,0.98646,0.00008925821,0.0018928777,0.00025383668,0.00000781859,0.001845212,0.008306539],"genre_scores_gemma":[0.9433656,0.00001807014,0.05585374,0.000105464525,0.00033199176,0.000019061867,0.000026109577,0.00009714089,0.00018284914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795496,0.000012956391,0.0004018067,0.00066407246,0.0004790295,0.00048714151],"domain_scores_gemma":[0.99910873,0.00017779018,0.00009063436,0.00042627103,0.00012660354,0.000069992726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022478412,0.00045104185,0.00041542912,0.00090632495,0.0002278469,0.00030054635,0.00065933267,0.00048434324,0.000020679756],"category_scores_gemma":[0.000037508154,0.000433972,0.00010745457,0.0005104699,0.0003128458,0.00015778007,0.00014768599,0.0012009337,0.00010672137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001893276,0.0000026637151,0.00002512823,0.00037793058,0.0000222036,0.00019858574,0.00025436928,0.8974048,0.0009214258,0.0096137,0.000013306229,0.09116403],"study_design_scores_gemma":[0.0001440766,0.000072095194,0.0000065676472,0.0014718433,0.000024116334,0.000071732306,0.0000012522777,0.9655702,0.016661823,0.015030584,0.00038858483,0.00055712525],"about_ca_topic_score_codex":0.000012759411,"about_ca_topic_score_gemma":0.000019659206,"teacher_disagreement_score":0.9432759,"about_ca_system_score_codex":0.000764657,"about_ca_system_score_gemma":0.00014994174,"threshold_uncertainty_score":0.99981123},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023023027,0.00019287887,0.9889561,0.00012296927,0.0021126354,0.0004817497,0.000016357775,0.000029512277,0.008064804],"genre_scores_gemma":[0.9809676,0.0000135028495,0.014041264,0.00019654426,0.0022138276,0.000047052592,0.000029857281,0.000056365523,0.002433977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843854,0.000004285927,0.00031215698,0.00066770526,0.00025341567,0.00032392165],"domain_scores_gemma":[0.9993505,0.000115984956,0.00009822647,0.00031873756,0.0000481456,0.00006844449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025245428,0.0002686572,0.00033795836,0.00033091698,0.00006461094,0.00019790686,0.00041420385,0.00013539431,0.000023468217],"category_scores_gemma":[0.0000018093555,0.00023708005,0.00009748152,0.00024220339,0.00008034442,0.000046167246,0.00015712129,0.0005028221,0.000016164682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054462785,0.000010041443,0.0000036452911,0.00004405273,0.000011600095,0.0000027033054,0.0000766153,0.3999575,0.000030264793,0.49800414,0.00005494157,0.10179903],"study_design_scores_gemma":[0.00009640886,0.000019964042,2.9829783e-7,0.00014845232,0.000009454751,0.0000014377711,4.1423775e-7,0.6962782,0.000089579094,0.29976326,0.0033999966,0.00019248686],"about_ca_topic_score_codex":0.000015460031,"about_ca_topic_score_gemma":0.000010341957,"teacher_disagreement_score":0.9809446,"about_ca_system_score_codex":0.0000940463,"about_ca_system_score_gemma":0.00012520907,"threshold_uncertainty_score":0.9667844},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078298186,0.00066090724,0.98950416,0.00023996727,0.006173091,0.00032786425,0.000027327755,0.00030789262,0.0019757964],"genre_scores_gemma":[0.55269694,0.000065702385,0.44431442,0.0015946131,0.0011640561,0.000007961724,0.00002776135,0.00006280319,0.000065741195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99641067,0.000029560853,0.00050032267,0.0015069889,0.00081083365,0.00074161915],"domain_scores_gemma":[0.99785894,0.00026075504,0.00021653743,0.001311849,0.00012940969,0.00022249609],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00093863066,0.0005393922,0.00046148896,0.001201122,0.00024281119,0.0010617151,0.0023890354,0.00034643998,0.000015406094],"category_scores_gemma":[0.000056289315,0.0004988774,0.00021100427,0.00096730585,0.00055226265,0.0014460721,0.0018468099,0.0011389108,0.00006286093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018893214,0.0000721646,0.00019847768,0.00018413624,0.000068746296,0.00032392307,0.0033573706,0.0073341443,0.0008627688,0.75566196,0.00012527392,0.23179217],"study_design_scores_gemma":[0.00019657175,0.00013665934,0.000099917655,0.0008338858,0.000021527054,0.00027308348,4.208719e-7,0.47613034,0.0014096919,0.5081371,0.011900166,0.00086064055],"about_ca_topic_score_codex":0.000054004777,"about_ca_topic_score_gemma":0.00008730872,"teacher_disagreement_score":0.551914,"about_ca_system_score_codex":0.00033764503,"about_ca_system_score_gemma":0.0002726482,"threshold_uncertainty_score":0.99997526},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022733997,0.00016665083,0.9883511,0.00010702299,0.0003274338,0.00036121192,0.000010752629,0.00013766185,0.010515437],"genre_scores_gemma":[0.4842935,0.00007416511,0.51393986,0.00027048253,0.00030698246,0.00005643911,0.000035981197,0.0001054821,0.00091708556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999103,0.0000024085325,0.00021178085,0.0003241386,0.00020997204,0.0001486998],"domain_scores_gemma":[0.9994739,0.00006238345,0.00004177692,0.00028208178,0.000086246226,0.000053601827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012070769,0.00017260133,0.00017100881,0.00043266322,0.000036612095,0.000091158276,0.0002518503,0.000101014026,0.000025459756],"category_scores_gemma":[0.000005596102,0.00015264745,0.000024808232,0.00037059336,0.00008708344,0.000075596414,0.00004337872,0.00022195658,0.000035562392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.15996e-7,0.000001983137,0.0000070367273,0.000082355466,0.0000054584775,0.0000014930005,0.00035285047,0.8592153,0.00025939578,0.0023835425,0.000008761582,0.13768092],"study_design_scores_gemma":[0.000111899455,0.000076924705,0.000029774417,0.0011428692,0.0000137374345,0.000014871291,2.5783834e-7,0.9721785,0.0050209966,0.012322678,0.008645921,0.00044154597],"about_ca_topic_score_codex":0.0000039579118,"about_ca_topic_score_gemma":0.0000666434,"teacher_disagreement_score":0.48427075,"about_ca_system_score_codex":0.00007794378,"about_ca_system_score_gemma":0.000051290932,"threshold_uncertainty_score":0.62247825},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029108593,0.0014171359,0.9303947,0.0046846997,0.0054476094,0.0020520156,0.00005120219,0.000056808614,0.02678721],"genre_scores_gemma":[0.93400806,0.00011252071,0.057378236,0.0014083221,0.0023591893,0.000029059567,0.00015630794,0.00013308394,0.00441524],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982429,0.000010493119,0.0002108663,0.0008936359,0.00033180867,0.0003102543],"domain_scores_gemma":[0.9992588,0.000021730231,0.00006220051,0.00046847513,0.00009945625,0.00008932607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027073378,0.00028064803,0.00022186575,0.00031661318,0.000025968846,0.00011953828,0.00048027013,0.00024398064,0.000013518316],"category_scores_gemma":[0.00002867219,0.0002458002,0.00004619644,0.00022963251,0.00017775386,0.000006708402,0.00024698622,0.00030161432,0.00006981557],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007541189,0.00036124268,0.0026333223,0.0005744291,0.00032339146,0.0009404657,0.009329271,0.09795691,0.12521917,0.01473162,0.0010845175,0.74609154],"study_design_scores_gemma":[0.011022997,0.017135255,0.0073872176,0.00854825,0.00033128797,0.0008614207,0.000031534724,0.06836746,0.23327419,0.31215617,0.3269156,0.013968627],"about_ca_topic_score_codex":0.000033981087,"about_ca_topic_score_gemma":0.0005018176,"teacher_disagreement_score":0.9048994,"about_ca_system_score_codex":0.00011976198,"about_ca_system_score_gemma":0.00024489235,"threshold_uncertainty_score":0.9999994},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000111959416,0.0011603341,0.9748011,0.0014001187,0.005323828,0.00031785553,0.0000041209596,0.00039818362,0.016482495],"genre_scores_gemma":[0.9434258,0.000047936985,0.04802145,0.0010760934,0.0009739518,0.000013563338,0.0000058922033,0.000067947076,0.006367418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962144,0.000022441003,0.0005656934,0.0015732831,0.0010409366,0.00058327283],"domain_scores_gemma":[0.99769986,0.00028802306,0.0001864056,0.0014668535,0.00014535272,0.00021349116],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00083343644,0.00047404267,0.0004455199,0.0011498574,0.0001888719,0.0013355829,0.0034647102,0.00029961191,0.00002599289],"category_scores_gemma":[0.00004538378,0.00042457628,0.00017847208,0.0007663193,0.00037621552,0.00060475065,0.001030602,0.00087243825,0.0004922327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020083012,0.000039253133,0.0000623688,0.00018532248,0.000033021795,0.0002542651,0.021254318,0.00057394383,0.00024738815,0.6089928,0.00015556473,0.36819977],"study_design_scores_gemma":[0.00009734916,0.000057385456,0.000044443503,0.00056144595,0.000009488313,0.000110424146,2.6539087e-7,0.42387235,0.00034120143,0.5581805,0.01609204,0.00063312624],"about_ca_topic_score_codex":0.00001725473,"about_ca_topic_score_gemma":0.00005466559,"teacher_disagreement_score":0.9433138,"about_ca_system_score_codex":0.00029602365,"about_ca_system_score_gemma":0.00035896563,"threshold_uncertainty_score":0.9998206},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10105187,0.0034835953,0.7647492,0.011073431,0.008950496,0.0035109164,0.0006836454,0.00080488477,0.10569191],"genre_scores_gemma":[0.9936386,0.00037171814,0.0030738816,0.0011106855,0.0008719643,0.000009940477,0.000031452582,0.000029937071,0.00086186954],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966997,0.000067922636,0.00040730461,0.0012095915,0.0011925153,0.00042299388],"domain_scores_gemma":[0.9979226,0.0007280015,0.00022287798,0.000845826,0.00011555631,0.0001651114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011366758,0.0003766162,0.00060552603,0.0016240182,0.0004279459,0.00037576215,0.0013819032,0.0003912859,0.00009130919],"category_scores_gemma":[0.00055942533,0.00032532788,0.00018319598,0.0013672913,0.0013233519,0.00024935193,0.0006351695,0.0007935986,0.00004862589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003577362,0.00037448894,0.0006130073,0.00021460127,0.0006523689,0.00013191557,0.022798482,0.017063448,0.0006041548,0.30077806,0.0006908657,0.6557209],"study_design_scores_gemma":[0.0013731006,0.0040842933,0.004024947,0.0025585578,0.0010158583,0.000015937405,0.0000467307,0.11217738,0.0040947194,0.8059876,0.06154093,0.0030799245],"about_ca_topic_score_codex":0.00022857457,"about_ca_topic_score_gemma":0.00069770234,"teacher_disagreement_score":0.8925867,"about_ca_system_score_codex":0.00022649749,"about_ca_system_score_gemma":0.0002754057,"threshold_uncertainty_score":0.9999199},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015709858,0.0014545893,0.98105186,0.0064058187,0.0015997732,0.0011092746,0.000037958507,0.0021274246,0.0061975773],"genre_scores_gemma":[0.011891536,0.00007285614,0.98514795,0.0005076918,0.00046093104,0.00010945792,0.00008638027,0.00011916789,0.0016040537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99294657,0.000043369975,0.00080763624,0.0035681152,0.0012687558,0.0013655281],"domain_scores_gemma":[0.98869824,0.0010105703,0.00038142,0.009322118,0.00038930282,0.0001983746],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0017153382,0.000930052,0.0008457375,0.0014931574,0.0006539133,0.00272027,0.05928036,0.00081294635,0.000024655128],"category_scores_gemma":[0.011715211,0.000874066,0.0002530196,0.0014873471,0.0007058097,0.0012692491,0.16086459,0.0025325585,0.000061012463],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002898312,0.00010063699,0.000057360387,0.0010850983,0.00014172803,0.00025382606,0.00084080384,0.031196851,0.0006114893,0.034366503,0.015484155,0.9158326],"study_design_scores_gemma":[0.00015834851,0.00011422667,0.000003789766,0.00042185566,0.000009952548,0.000039818653,2.992144e-7,0.59566236,0.000696057,0.39712012,0.0051757772,0.00059741974],"about_ca_topic_score_codex":0.000025681318,"about_ca_topic_score_gemma":0.000018030261,"teacher_disagreement_score":0.91523516,"about_ca_system_score_codex":0.0006273548,"about_ca_system_score_gemma":0.0006740911,"threshold_uncertainty_score":0.9997686},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003278099,0.0011614964,0.96252,0.0020025934,0.02786001,0.00034517222,0.000009983485,0.00045010512,0.0056178803],"genre_scores_gemma":[0.035673305,0.0010972606,0.9143951,0.011472402,0.026778655,0.0000847821,0.00011120147,0.00020878068,0.010178502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944671,0.000087440865,0.0007228204,0.0021917238,0.0016667896,0.00086415774],"domain_scores_gemma":[0.9972441,0.0005211102,0.00026163034,0.0013968374,0.00033931946,0.00023698951],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012187843,0.0006539254,0.0005585553,0.0015301568,0.0002951607,0.0021089984,0.0054771756,0.000615618,0.0000683455],"category_scores_gemma":[0.0000659724,0.00062317064,0.0002545472,0.0026080718,0.00052694103,0.0011049343,0.0037942557,0.0021817917,0.00060930505],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007576846,0.00006238503,0.000009539361,0.00007098681,0.00003394219,0.0002645276,0.0012689241,0.030874943,0.000009522793,0.011631507,0.015006028,0.94076014],"study_design_scores_gemma":[0.00014228911,0.000107445245,0.00001386136,0.00050457363,0.000007571503,0.0001237617,1.12997704e-7,0.7061891,0.000095876276,0.19395362,0.098315634,0.00054614356],"about_ca_topic_score_codex":0.000018285396,"about_ca_topic_score_gemma":0.00011006529,"teacher_disagreement_score":0.940214,"about_ca_system_score_codex":0.0009267498,"about_ca_system_score_gemma":0.00096170104,"threshold_uncertainty_score":0.9999037},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000046780856,0.002211412,0.99124265,0.00050197076,0.0005529943,0.0006482932,0.00002613037,0.00037372485,0.0044381428],"genre_scores_gemma":[0.004352214,0.0006856526,0.9922417,0.0007679987,0.0007245275,0.0001466634,0.000021208602,0.00007362746,0.00098641],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996313,0.00002863693,0.0003757732,0.0018210236,0.00084974116,0.0006118648],"domain_scores_gemma":[0.9976746,0.0005439834,0.00012250857,0.0011869611,0.0002467779,0.00022520256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081692176,0.00043261153,0.00036116963,0.0015800174,0.0002981168,0.000756707,0.0021793435,0.00024656774,0.000011426655],"category_scores_gemma":[0.000034736437,0.00039927504,0.00010424402,0.0013540135,0.0012549924,0.00067322125,0.0016098317,0.0010269975,0.00014210759],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013399483,0.000011165799,0.0000025112708,0.000040043826,0.000008758549,0.00003733003,0.00015096663,0.0002791455,0.000040491737,0.07269315,0.000008213491,0.9267269],"study_design_scores_gemma":[0.00009321214,0.000087219225,0.000009611369,0.00023201392,0.000006446963,0.00009661498,1.7522774e-7,0.15217791,0.00036190197,0.8417521,0.0047745868,0.0004082165],"about_ca_topic_score_codex":0.0000066127914,"about_ca_topic_score_gemma":0.000015512218,"teacher_disagreement_score":0.92631865,"about_ca_system_score_codex":0.00014635721,"about_ca_system_score_gemma":0.00023275895,"threshold_uncertainty_score":0.9998459},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006058659,0.0015301986,0.9825153,0.0014353319,0.0059161303,0.00029853403,0.00006877928,0.0003252382,0.007849926],"genre_scores_gemma":[0.0661059,0.00018475905,0.9253058,0.0021985706,0.001997857,0.00001647119,0.00007577535,0.00010658441,0.0040082815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99547285,0.000021286816,0.0004561204,0.0021490685,0.0012390462,0.0006616465],"domain_scores_gemma":[0.9968229,0.0005038941,0.00018277012,0.0020507292,0.00015985421,0.000279856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044823147,0.0005773475,0.0005083534,0.0007692083,0.0003075839,0.0009362162,0.004046029,0.00034498068,0.00011047375],"category_scores_gemma":[0.00004116263,0.00047922687,0.00017564648,0.0006455732,0.0005687845,0.00042284888,0.004355286,0.0010584646,0.0006646479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010802958,0.00009708593,0.000017328914,0.00006737449,0.000048610396,0.0009317888,0.0020379543,0.07087524,0.00048772013,0.27214625,0.0013076025,0.65197223],"study_design_scores_gemma":[0.00015929113,0.0000683372,0.000025166579,0.0006029544,0.000011954943,0.000027323165,2.3138648e-7,0.8301667,0.000703442,0.14523034,0.022438541,0.0005657439],"about_ca_topic_score_codex":0.00010758998,"about_ca_topic_score_gemma":0.000021814067,"teacher_disagreement_score":0.75929147,"about_ca_system_score_codex":0.00030972718,"about_ca_system_score_gemma":0.0005026775,"threshold_uncertainty_score":0.99976593},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013030939,0.00023369657,0.96498597,0.001015658,0.0033855494,0.00038067653,0.000014491516,0.00038264398,0.029588297],"genre_scores_gemma":[0.036603346,0.00014457016,0.93990237,0.008939238,0.0018979812,0.000047961108,0.00007012738,0.00017168369,0.012222747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957677,0.000013924611,0.00043073145,0.0018936896,0.0011920632,0.0007018793],"domain_scores_gemma":[0.99780303,0.00029000273,0.00019109425,0.0014892014,0.00010506289,0.00012159225],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000992683,0.00054237235,0.0004342963,0.00089773553,0.00022702866,0.0018770656,0.004178868,0.00019692397,0.000021895898],"category_scores_gemma":[0.00004701139,0.0004657421,0.00012127052,0.0007434663,0.00039445906,0.000789707,0.0026723912,0.0008150414,0.0003493916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035554785,0.000026433663,0.0000033897493,0.00009849387,0.000018191138,0.0003629841,0.00026191917,0.0052841865,0.000020105515,0.5013418,0.0004616337,0.4921173],"study_design_scores_gemma":[0.00011612858,0.00012021159,0.000005557834,0.00045339856,0.0000074101513,0.000013881792,7.88758e-8,0.61623836,0.00011310613,0.37546647,0.007010527,0.00045489412],"about_ca_topic_score_codex":0.000008311312,"about_ca_topic_score_gemma":0.000011674484,"teacher_disagreement_score":0.61095417,"about_ca_system_score_codex":0.00023170759,"about_ca_system_score_gemma":0.00018542909,"threshold_uncertainty_score":0.9997794},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004035491,0.0017136943,0.9742312,0.0010201554,0.004458116,0.00023806038,0.00001907131,0.00033046654,0.017985243],"genre_scores_gemma":[0.010964733,0.00021345308,0.973357,0.0028725027,0.0021546355,0.00001793161,0.000036454345,0.00010730799,0.0102759795],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995793,0.00001491943,0.00046066608,0.0019372889,0.0011249796,0.0006691428],"domain_scores_gemma":[0.99731857,0.00022154131,0.00014891362,0.0019494013,0.00015319047,0.00020841652],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005996412,0.0005503794,0.00046110232,0.0008473634,0.00021347258,0.0011623274,0.0043887123,0.00033151775,0.000054445863],"category_scores_gemma":[0.00002741129,0.0004484401,0.00014823253,0.000618626,0.00044919105,0.0008584024,0.0037399738,0.0010611755,0.0005794995],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020474004,0.000016945805,0.000004528809,0.000049590588,0.000010345692,0.00030696456,0.0002965237,0.0032315832,0.000061836334,0.14834043,0.0007406958,0.8469385],"study_design_scores_gemma":[0.000110264766,0.00008416743,0.00001421992,0.0005676918,0.000006406228,0.00009807721,4.3535383e-8,0.4045037,0.0003365436,0.53508353,0.05860212,0.00059320603],"about_ca_topic_score_codex":0.000021126172,"about_ca_topic_score_gemma":0.000023230043,"teacher_disagreement_score":0.8463453,"about_ca_system_score_codex":0.00023102584,"about_ca_system_score_gemma":0.00042299114,"threshold_uncertainty_score":0.99987453},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032135496,0.000375978,0.99101704,0.0030638983,0.0028950067,0.00048350816,0.000030785523,0.000037739086,0.0020638928],"genre_scores_gemma":[0.37985027,0.00025908533,0.60289574,0.003426085,0.0011523953,0.00006366564,0.000014173638,0.00009837208,0.012240239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979617,0.000019940358,0.0004141597,0.00065744953,0.00061972596,0.00032704184],"domain_scores_gemma":[0.9972227,0.001013145,0.00030636878,0.0012881476,0.00013736867,0.000032231248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007318586,0.0002535549,0.00030238286,0.00023073785,0.00020570436,0.0003069697,0.0046866247,0.00007957413,0.0000037313753],"category_scores_gemma":[0.00012303276,0.00014863424,0.00023242868,0.00049072213,0.0009408014,0.00033235445,0.002453645,0.0003008439,0.0000018973808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007031738,0.000028529204,0.000025425983,0.00041613064,0.00007468833,0.000007870144,0.0027501492,0.027132092,0.00021043257,0.8124885,0.00060868653,0.15625049],"study_design_scores_gemma":[0.00018178874,0.00008447183,0.000046156685,0.0012426553,0.000039973977,0.000007654805,0.0000050036547,0.49140805,0.0013446959,0.49729034,0.008035307,0.00031388],"about_ca_topic_score_codex":0.00003870906,"about_ca_topic_score_gemma":0.00006196549,"teacher_disagreement_score":0.46427596,"about_ca_system_score_codex":0.000075783275,"about_ca_system_score_gemma":0.00018083122,"threshold_uncertainty_score":0.87089926},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04631315,0.006528232,0.9418625,0.0018055884,0.0004219212,0.0009423306,0.000008784872,0.000088854875,0.002028592],"genre_scores_gemma":[0.970116,0.00005948288,0.028959753,0.00027437278,0.00015357784,0.0000065371896,0.00003237357,0.000031088064,0.00036681147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801373,0.000026553917,0.0004094406,0.0007320421,0.00055345806,0.00026475612],"domain_scores_gemma":[0.9990265,0.00030238632,0.00011178115,0.00031371583,0.00010512762,0.00014050803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038207672,0.00030128963,0.00050677755,0.0008149133,0.000037420235,0.00004945361,0.00018494815,0.00011153847,0.000018084938],"category_scores_gemma":[0.00014569955,0.00023838932,0.00008241116,0.00027781958,0.0005539787,0.00005307408,0.00015892563,0.0007916554,0.000007547828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028252217,0.00018634845,0.018238697,0.0017537929,0.000057574995,0.005084738,0.00092069706,0.120138235,0.003823679,0.001039904,0.000021728849,0.8484521],"study_design_scores_gemma":[0.00175118,0.0016954335,0.014977508,0.00474101,0.00011619021,0.00063581043,7.0764344e-7,0.941884,0.020290185,0.012735502,0.000572422,0.0006000777],"about_ca_topic_score_codex":0.00005372311,"about_ca_topic_score_gemma":0.000044085496,"teacher_disagreement_score":0.92380285,"about_ca_system_score_codex":0.0002538674,"about_ca_system_score_gemma":0.00036256475,"threshold_uncertainty_score":0.9721234},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016303837,0.0015234735,0.9704554,0.00306956,0.0005869141,0.00049288257,0.000007288638,0.00004830245,0.007512342],"genre_scores_gemma":[0.7621843,0.00027025884,0.23458107,0.0018462877,0.00031204487,0.0000059674485,0.00002298002,0.000051705552,0.0007253897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863964,0.000009386603,0.00024501383,0.00048430127,0.00042364022,0.00019803685],"domain_scores_gemma":[0.9994083,0.00015033584,0.00008718886,0.00020673485,0.0000466906,0.000100717494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037948886,0.00019144795,0.0003476457,0.0005021463,0.000029487735,0.00005679202,0.0001559225,0.000060291684,0.00002337909],"category_scores_gemma":[0.000075050615,0.00014004072,0.000023908213,0.0002581973,0.00055345014,0.00007062223,0.000110699315,0.0006427921,0.0000018353198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054550143,0.00004829913,0.016471146,0.0010399284,0.000050198054,0.0009017124,0.0014151168,0.017915573,0.0015056658,0.0021813181,0.00007003091,0.9583465],"study_design_scores_gemma":[0.001966871,0.00094027485,0.0045699165,0.009807078,0.00014946125,0.0010434592,0.0000039318265,0.9512139,0.002035515,0.024388492,0.0031981529,0.00068294385],"about_ca_topic_score_codex":0.00008553342,"about_ca_topic_score_gemma":0.000043080705,"teacher_disagreement_score":0.95766354,"about_ca_system_score_codex":0.000096311865,"about_ca_system_score_gemma":0.00028399302,"threshold_uncertainty_score":0.5710695},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002127324,0.003115334,0.99153715,0.00040316506,0.00025328988,0.0014205611,0.000008356288,0.000032022912,0.0011027857],"genre_scores_gemma":[0.83342427,0.00004697909,0.16535993,0.00062403927,0.00020781558,0.000058450165,0.0000623567,0.00004260022,0.0001735554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837744,0.00001625855,0.0003258815,0.00063132454,0.0004021805,0.00024689388],"domain_scores_gemma":[0.9990273,0.00035137183,0.00013209577,0.00027391565,0.0000980727,0.00011720923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004077349,0.0002677942,0.00041079748,0.00065441814,0.00007915412,0.00006808047,0.00022507568,0.00009817762,0.0000039352985],"category_scores_gemma":[0.00005264469,0.00017886661,0.0001125523,0.00042401385,0.00048126833,0.000051349576,0.00016222685,0.0004458233,7.4894103e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046065074,0.00027936365,0.0115841385,0.004425658,0.00037920044,0.00045343096,0.009584368,0.29075995,0.0050878017,0.0034164963,0.00004883646,0.6735201],"study_design_scores_gemma":[0.0010302238,0.00070953846,0.0020515316,0.0010439635,0.00014831229,0.00024948904,0.00000573406,0.9885809,0.0019730777,0.0037775838,0.00018355537,0.0002461227],"about_ca_topic_score_codex":0.0000428706,"about_ca_topic_score_gemma":0.000025534402,"teacher_disagreement_score":0.831297,"about_ca_system_score_codex":0.00016239351,"about_ca_system_score_gemma":0.00020349001,"threshold_uncertainty_score":0.7293969},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046034445,0.0002900765,0.99065125,0.0007019484,0.0005294028,0.0006753158,0.00002838471,0.00020898966,0.0068685715],"genre_scores_gemma":[0.062540606,0.00010637777,0.92751247,0.0018519734,0.00068128714,0.00031764593,0.00003681867,0.00009267525,0.006860175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968121,0.000019199548,0.00045871525,0.0015033134,0.0007035661,0.0005031152],"domain_scores_gemma":[0.998189,0.00023167797,0.00019945462,0.0010073461,0.00023295199,0.00013959949],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044817096,0.00043890672,0.00042360328,0.0006504121,0.0004705827,0.0008143871,0.0013955148,0.00018605297,0.000042847383],"category_scores_gemma":[0.000017850227,0.0003681336,0.00014545671,0.00037293776,0.0002524445,0.000555316,0.0004428031,0.000328741,0.00005431306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008191839,0.0000703506,0.0000034389666,0.00023355344,0.00007968158,0.00006212832,0.00081466936,0.60786164,0.0009254207,0.14498453,0.00039527673,0.24456112],"study_design_scores_gemma":[0.00013882731,0.000098250355,0.0000017073596,0.00045737205,0.00003435947,0.000031564246,2.0455323e-7,0.75447893,0.003820622,0.23853415,0.0019590838,0.0004449035],"about_ca_topic_score_codex":0.000025250503,"about_ca_topic_score_gemma":0.0001108416,"teacher_disagreement_score":0.24411622,"about_ca_system_score_codex":0.00025093378,"about_ca_system_score_gemma":0.00031966812,"threshold_uncertainty_score":0.99987704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037889353,0.00042149556,0.9919543,0.0023853306,0.0019449334,0.00032489712,0.000058452493,0.00028707305,0.0025855924],"genre_scores_gemma":[0.18083048,0.000032650176,0.80175793,0.0044778455,0.0031385215,0.000057496174,0.00018975513,0.00013602966,0.0093792705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973403,0.000019562052,0.00033624287,0.001249847,0.0005992403,0.00045476374],"domain_scores_gemma":[0.99826044,0.000685822,0.00016619006,0.00061699847,0.00015872587,0.00011179948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005430552,0.00039488776,0.0003518796,0.0005342003,0.00020487727,0.0005282888,0.0014165519,0.00021140909,0.000023531913],"category_scores_gemma":[0.00008143243,0.0003464431,0.0001431968,0.0002626232,0.00022656129,0.00028606562,0.0006754136,0.0007797117,0.000112076625],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028278707,0.000014203737,0.000042176307,0.000076726385,0.000020089397,0.00013745941,0.0008723417,0.0040410995,0.000026756461,0.03699238,0.000054040862,0.9577199],"study_design_scores_gemma":[0.00014358285,0.00014887386,0.0005498684,0.0005063086,0.0000114292925,0.00009253581,1.1301192e-7,0.88676167,0.00007835131,0.10911367,0.0021176029,0.00047598573],"about_ca_topic_score_codex":0.000018752089,"about_ca_topic_score_gemma":0.000013182461,"teacher_disagreement_score":0.9572439,"about_ca_system_score_codex":0.00015714267,"about_ca_system_score_gemma":0.00023988904,"threshold_uncertainty_score":0.99989873},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013976212,0.0003646709,0.99548936,0.00031966774,0.0009960989,0.00022726071,0.000012110142,0.00012379234,0.002327257],"genre_scores_gemma":[0.83322066,0.00057745003,0.15903087,0.0038524212,0.0004085327,0.000014312435,0.000084221116,0.00012741568,0.002684111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969431,0.000031078063,0.00070444244,0.0010730295,0.0008542742,0.00039404462],"domain_scores_gemma":[0.9981003,0.00037359138,0.00026356993,0.0009316269,0.00022526244,0.00010566645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071073195,0.00035743715,0.00046482697,0.0016079057,0.000061586536,0.00040192273,0.0019996346,0.00023269151,0.000025541576],"category_scores_gemma":[0.00017897054,0.00033449757,0.0001100606,0.0024986868,0.00041809637,0.0005811676,0.00091195543,0.00037023856,0.0000367278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006524522,0.000100154284,0.00078524,0.00023872712,0.000022965025,0.00011189602,0.0015150004,0.03274724,0.0005747959,0.86291397,0.00007648926,0.10090703],"study_design_scores_gemma":[0.00021783881,0.00010425407,0.00030156385,0.00082604116,0.0000099215495,0.000012301104,2.2360508e-7,0.76893824,0.0015730639,0.2259771,0.0016085969,0.00043085834],"about_ca_topic_score_codex":0.000020456262,"about_ca_topic_score_gemma":0.00011526359,"teacher_disagreement_score":0.8364585,"about_ca_system_score_codex":0.0001243035,"about_ca_system_score_gemma":0.0003253028,"threshold_uncertainty_score":0.9999107},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013169684,0.002370167,0.99327695,0.00006806071,0.000818665,0.00016605524,0.000022011962,0.00048583283,0.0026605632],"genre_scores_gemma":[0.81884307,0.00032333843,0.17913574,0.00021988829,0.001085621,0.000015746951,0.00003770394,0.000106476415,0.00023241136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986586,0.0000037297382,0.00024540385,0.0004998896,0.00030554424,0.0002868439],"domain_scores_gemma":[0.9994287,0.00017316506,0.000033912143,0.00024058844,0.00004402635,0.000079618585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002432436,0.00030203242,0.00027285624,0.0004184334,0.00008790869,0.00023318792,0.0003044828,0.0002626677,0.000021616112],"category_scores_gemma":[0.000021415774,0.00028844524,0.000056827786,0.0001980196,0.00021099213,0.00018125647,0.0001556586,0.000797935,0.000018481018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005840602,0.000009541141,0.00007199898,0.00037641506,0.00005539198,0.00019023968,0.00033366316,0.34414062,0.0033055467,0.009303421,0.00010063008,0.6421067],"study_design_scores_gemma":[0.00009873423,0.00004142116,0.00004247771,0.0007583884,0.000018056424,0.00009112509,2.1127674e-7,0.8756948,0.003480269,0.11466939,0.004589477,0.00051564764],"about_ca_topic_score_codex":0.00000381105,"about_ca_topic_score_gemma":0.0000053131607,"teacher_disagreement_score":0.8187114,"about_ca_system_score_codex":0.00017562685,"about_ca_system_score_gemma":0.000063114014,"threshold_uncertainty_score":0.9999568},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000073497445,0.0022696094,0.9679507,0.00036447524,0.00073335116,0.0014886706,0.00001577757,0.0010914298,0.026078643],"genre_scores_gemma":[0.060733624,0.00008096293,0.93246484,0.0022804064,0.0018250003,0.00027645993,0.000031943935,0.00013601303,0.0021707404],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948652,0.0000818848,0.00077205215,0.0025078852,0.00091323094,0.0008597522],"domain_scores_gemma":[0.99618936,0.0010615052,0.00030112156,0.002052808,0.00015721476,0.00023798988],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016301147,0.0006948541,0.0007558826,0.0013322786,0.00031908837,0.001990108,0.00413843,0.00049134716,0.0000047790168],"category_scores_gemma":[0.0000579991,0.00064000755,0.00011220154,0.0016649793,0.00073840655,0.00027084412,0.0014282392,0.0015190471,0.00008133772],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018716677,0.000019605417,0.0000037951593,0.0002725749,0.000014905055,0.000036748388,0.00071862433,0.0028898418,0.00033422996,0.032057315,0.00082704716,0.96282345],"study_design_scores_gemma":[0.00017463064,0.00015670242,0.000029209488,0.0010511373,0.000020821799,0.00043871306,4.328172e-7,0.2121146,0.0060819583,0.7415283,0.03696031,0.0014431985],"about_ca_topic_score_codex":0.000016649688,"about_ca_topic_score_gemma":0.000029804794,"teacher_disagreement_score":0.96138024,"about_ca_system_score_codex":0.00052261015,"about_ca_system_score_gemma":0.0012561873,"threshold_uncertainty_score":0.9996051},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035607108,0.0015025615,0.99211586,0.0005070129,0.002770116,0.00046364847,0.0000029323248,0.00053821714,0.0017435912],"genre_scores_gemma":[0.36644566,0.00082017074,0.6293773,0.0010006375,0.0008233262,0.00007698072,0.000021765687,0.00013875504,0.0012954196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584717,0.000046945974,0.0006306428,0.002079206,0.0007651528,0.00063085696],"domain_scores_gemma":[0.9981019,0.00038425325,0.00020512516,0.0010192911,0.00017391096,0.00011555258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074620737,0.00049655687,0.00051815907,0.0015365311,0.00016121747,0.0009255863,0.0020419364,0.00038599092,0.000009752704],"category_scores_gemma":[0.00011122202,0.0004905681,0.00015753155,0.0015559569,0.0003899034,0.0012636713,0.0013482565,0.0015180425,0.00011221805],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005186223,0.00003440444,0.0004524891,0.00011988234,0.000012357683,0.00048668307,0.0025112578,0.042537723,0.000092918715,0.004559634,0.0000053545236,0.9491821],"study_design_scores_gemma":[0.00034745465,0.00019184845,0.0002323508,0.0005769906,0.000008176041,0.00022317226,7.3569373e-7,0.8737018,0.0003922311,0.12244549,0.0012511885,0.0006285842],"about_ca_topic_score_codex":0.000024332576,"about_ca_topic_score_gemma":0.0001250663,"teacher_disagreement_score":0.9485535,"about_ca_system_score_codex":0.00056956225,"about_ca_system_score_gemma":0.0003743494,"threshold_uncertainty_score":0.9997546},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013573434,0.0033182066,0.99302244,0.00087508926,0.00072272896,0.00059512455,0.000005101357,0.00070325454,0.0007444778],"genre_scores_gemma":[0.0055753323,0.000033687247,0.99197894,0.0009400832,0.00050788384,0.00004817265,0.0000056774884,0.000038376405,0.00087184424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673486,0.00003532056,0.0004268736,0.0016346104,0.0005382761,0.00063003594],"domain_scores_gemma":[0.99837995,0.00042214376,0.00017804025,0.0006836684,0.000193208,0.00014300273],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008693164,0.00047360596,0.0004678212,0.00090947695,0.00031084917,0.0012359566,0.002127916,0.0002783261,8.831389e-7],"category_scores_gemma":[0.00009357952,0.00040860462,0.00010231943,0.0008218386,0.0005009673,0.00016606036,0.001152591,0.0006445283,0.000004250801],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031710886,0.000013585994,0.0000042238207,0.00020910888,0.0000065855984,0.000018140705,0.0009804622,0.10976404,0.000006639932,0.001508228,0.00040758098,0.8870782],"study_design_scores_gemma":[0.000120406396,0.000106924774,0.000008990699,0.00044408458,0.000006052559,0.000059274913,6.9464946e-8,0.7514027,0.00016292761,0.24555095,0.0017536095,0.0003840213],"about_ca_topic_score_codex":0.0000053636495,"about_ca_topic_score_gemma":0.000008360055,"teacher_disagreement_score":0.8866942,"about_ca_system_score_codex":0.00018751796,"about_ca_system_score_gemma":0.0010354378,"threshold_uncertainty_score":0.99983656},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001311921,0.0046569337,0.9718391,0.00016210432,0.00635393,0.0002611705,0.00001064543,0.0003764963,0.016326552],"genre_scores_gemma":[0.17725727,0.0015793369,0.6411308,0.0041630594,0.013931813,0.0001394733,0.00016918685,0.000984789,0.1606443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971694,0.000016430442,0.00044817256,0.00097535463,0.00066340115,0.0007272549],"domain_scores_gemma":[0.9986832,0.00019112081,0.00004766498,0.0008421518,0.00007446449,0.00016140877],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004015944,0.0005501914,0.000495398,0.00096427556,0.00009969621,0.00046156524,0.0014637059,0.00025788948,0.00017674999],"category_scores_gemma":[0.0000298649,0.0004921122,0.00014397338,0.0013452837,0.00034074497,0.00019518416,0.00041719357,0.001337899,0.0005637852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.434434e-7,0.0000056513372,0.000004539407,0.00012705488,0.000013196842,0.000098909084,0.00016621384,0.7630533,0.000093181974,0.00040490524,0.003344784,0.23268743],"study_design_scores_gemma":[0.00005463181,0.000038954397,0.000023231163,0.00093739975,0.000017914184,0.00004137075,8.387563e-8,0.9304729,0.002379604,0.033273015,0.031956956,0.00080391543],"about_ca_topic_score_codex":0.000022322874,"about_ca_topic_score_gemma":0.00036722596,"teacher_disagreement_score":0.33070827,"about_ca_system_score_codex":0.00053326885,"about_ca_system_score_gemma":0.00032279015,"threshold_uncertainty_score":0.99975306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044370256,0.0014584543,0.98831356,0.0017770983,0.0044379393,0.00055632176,0.00002388176,0.0003058194,0.002683209],"genre_scores_gemma":[0.13628374,0.00002761924,0.8554916,0.0048960806,0.0018642307,0.000054407377,0.000024634177,0.00009843495,0.0012592919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947654,0.000031144195,0.0007323262,0.0023950923,0.0010403716,0.0010356744],"domain_scores_gemma":[0.9973128,0.0006221785,0.00038904653,0.0013136232,0.00022815945,0.00013421591],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012938862,0.00073569955,0.0007608011,0.00048110445,0.00071733,0.0026899476,0.0034097028,0.00040191133,0.0000084553085],"category_scores_gemma":[0.00012687265,0.00063440244,0.00030195,0.000863388,0.00076797884,0.0021481786,0.0021475148,0.0008975533,0.000020891672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008286797,0.000045216217,0.00009414322,0.0011481558,0.000038570135,0.00019953056,0.0045513324,0.009342045,0.00032088172,0.5071371,0.00018959286,0.4769251],"study_design_scores_gemma":[0.00021967822,0.00007820782,0.000022644217,0.0021196264,0.000016622975,0.00006485591,0.0000012739246,0.12818764,0.0014544184,0.86348116,0.003514416,0.0008394564],"about_ca_topic_score_codex":0.000051112343,"about_ca_topic_score_gemma":0.00012091685,"teacher_disagreement_score":0.47608566,"about_ca_system_score_codex":0.000327782,"about_ca_system_score_gemma":0.00087889505,"threshold_uncertainty_score":0.9996107},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020413862,0.00019922314,0.99428093,0.00044012113,0.00215129,0.0007891495,0.00011542762,0.0009789631,0.0008407763],"genre_scores_gemma":[0.34155762,0.000065122615,0.6559328,0.00057113694,0.00059812696,0.00012660658,0.00016096415,0.00006815889,0.0009194809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965552,0.000012644828,0.0005566831,0.0016198384,0.000719852,0.0005357482],"domain_scores_gemma":[0.99768394,0.00034061467,0.00024865143,0.0013707199,0.00023905013,0.000117049174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066302525,0.0005235005,0.00043393398,0.00076758006,0.0002581668,0.000898511,0.0027618008,0.00035825206,0.000005721291],"category_scores_gemma":[0.00007410406,0.00046693874,0.00013140266,0.00041168949,0.0004438282,0.0013435803,0.0011525874,0.0006249215,0.000035549285],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061844066,0.000018963337,0.000046418794,0.00018216368,0.000011775345,0.000015451467,0.0004190078,0.003624947,0.00006529451,0.016512364,0.00034401106,0.97875345],"study_design_scores_gemma":[0.00015485015,0.00032455492,0.0002142534,0.0012903087,0.000015808333,0.00007015255,1.2905738e-7,0.93206114,0.002240828,0.061183836,0.0019617598,0.00048238147],"about_ca_topic_score_codex":0.000009417504,"about_ca_topic_score_gemma":0.000023653518,"teacher_disagreement_score":0.978271,"about_ca_system_score_codex":0.00044833668,"about_ca_system_score_gemma":0.0003549495,"threshold_uncertainty_score":0.9997782},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013160579,0.0014663343,0.97970784,0.0005510046,0.004532162,0.00048353968,0.000028505634,0.00044431933,0.012654689],"genre_scores_gemma":[0.020419408,0.00011150949,0.97493017,0.0008831598,0.0008718745,0.000043595912,0.000025947287,0.000058913884,0.0026554125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953798,0.00003908347,0.00086493004,0.0019645751,0.0010274282,0.00072419195],"domain_scores_gemma":[0.99663734,0.0006259258,0.00037589233,0.0019412122,0.00028272838,0.00013691222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007629924,0.0006312015,0.0006896304,0.0005512759,0.00048598013,0.0005625146,0.0019359788,0.00024719935,0.00002375714],"category_scores_gemma":[0.00016409933,0.00055366976,0.00015035707,0.0008804669,0.00077932543,0.0023318662,0.0018448667,0.00096732844,0.00013403283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009863149,0.000030462279,0.000078813304,0.00042794595,0.000043074415,0.00029376504,0.004263808,0.10188037,0.00015014946,0.60634077,0.00019100061,0.28629002],"study_design_scores_gemma":[0.00026793522,0.00011786422,0.00003323439,0.0020015377,0.000016223781,0.00025928806,0.0000018884448,0.8429696,0.00082701555,0.13531432,0.017220978,0.00097014883],"about_ca_topic_score_codex":0.00008887131,"about_ca_topic_score_gemma":0.00009165071,"teacher_disagreement_score":0.7410892,"about_ca_system_score_codex":0.0002893312,"about_ca_system_score_gemma":0.00057827844,"threshold_uncertainty_score":0.9996915},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006833637,0.0007328018,0.9859497,0.0005449488,0.0025864516,0.00042473208,0.000007584681,0.00018154057,0.009503917],"genre_scores_gemma":[0.18224195,0.0029161524,0.7900166,0.014268005,0.0029337413,0.00012165937,0.00027919273,0.00014649077,0.007076201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964714,0.000038280923,0.0007334289,0.0006229417,0.0014710563,0.0006628625],"domain_scores_gemma":[0.9984239,0.00024640822,0.00018675254,0.00075008976,0.0002595259,0.00013332666],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013770293,0.0003524709,0.00036058036,0.0020431106,0.00012312549,0.0012097193,0.002697487,0.00028421715,0.000013800479],"category_scores_gemma":[0.00017178638,0.00030207803,0.00009336788,0.003051177,0.00033631796,0.0063510747,0.0011085573,0.0011705083,0.00040291593],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009543098,0.000014868881,0.000030990097,0.00016190344,0.000001324056,0.00004991298,0.0020739834,0.010156029,0.000008002102,0.008405306,0.00012995432,0.9789582],"study_design_scores_gemma":[0.0004011604,0.00022777992,0.00025513963,0.00083460554,0.0000043126183,0.000069794565,7.983325e-7,0.823492,0.0008908182,0.11906626,0.05394908,0.00080826523],"about_ca_topic_score_codex":0.000007822061,"about_ca_topic_score_gemma":0.000027151093,"teacher_disagreement_score":0.9781499,"about_ca_system_score_codex":0.0008155684,"about_ca_system_score_gemma":0.0018571957,"threshold_uncertainty_score":0.99994314},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023515048,0.0007214287,0.98530346,0.005052608,0.0014458813,0.00029240956,0.0000026768896,0.00039896983,0.006547411],"genre_scores_gemma":[0.2456716,0.0002660889,0.730736,0.0033058883,0.0017106223,0.00003416325,0.00001045617,0.00015006975,0.0181151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661595,0.000027056372,0.00039946774,0.0015830953,0.0007571667,0.0006172684],"domain_scores_gemma":[0.9986121,0.0002890243,0.00009305272,0.00060962315,0.00013561454,0.00026057326],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007265537,0.00053260283,0.0005108616,0.00080103794,0.00034269123,0.0011726152,0.0015391136,0.00022372766,0.000015993312],"category_scores_gemma":[0.00009998709,0.00044036398,0.00010380798,0.0007395949,0.0003938249,0.00036994962,0.000979658,0.0015005535,0.00009369064],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036083818,0.000007371327,0.000014428961,0.00007222443,0.000010207078,0.000101203,0.0040926784,0.021776881,0.000086160304,0.016571203,0.00001996013,0.9572441],"study_design_scores_gemma":[0.00025713065,0.00061271555,0.00012490162,0.000933192,0.00001482026,0.0002287156,0.0000014963442,0.8608212,0.00046380347,0.10421293,0.031245261,0.0010838377],"about_ca_topic_score_codex":0.000044294466,"about_ca_topic_score_gemma":0.00005914115,"teacher_disagreement_score":0.95616025,"about_ca_system_score_codex":0.00012202648,"about_ca_system_score_gemma":0.00021169848,"threshold_uncertainty_score":0.9998643},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0135056265,0.0048696254,0.9385202,0.009846319,0.01344516,0.0011463591,0.00004527608,0.00048246176,0.01813896],"genre_scores_gemma":[0.9339605,0.000116285344,0.036353044,0.0023038946,0.00064890576,0.00001038619,0.0000033886442,0.00007505097,0.02652857],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99632204,0.00003674912,0.0004991729,0.0011744812,0.0016249098,0.00034263954],"domain_scores_gemma":[0.99659866,0.0017083655,0.00030036698,0.0010020895,0.0002826013,0.000107938875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014694079,0.0003702653,0.0005740541,0.0018857293,0.00011212834,0.00028135086,0.0023399116,0.00062618277,0.00009701679],"category_scores_gemma":[0.0007938715,0.0002517737,0.00020044592,0.0009218659,0.00085919903,0.00014630194,0.0006005775,0.0013672604,0.00043130215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040745974,0.00008429938,0.00068854727,0.0000847594,0.000028866833,0.00041461005,0.0006957706,0.0038571819,0.0008166305,0.064440094,0.0022336629,0.9266148],"study_design_scores_gemma":[0.00041839326,0.0005636575,0.0041045984,0.0014314721,0.00005547945,0.000099308425,8.85197e-7,0.009274909,0.01241329,0.94431114,0.026561085,0.000765754],"about_ca_topic_score_codex":0.0000036227223,"about_ca_topic_score_gemma":0.000030123112,"teacher_disagreement_score":0.9258491,"about_ca_system_score_codex":0.00011190714,"about_ca_system_score_gemma":0.00022471404,"threshold_uncertainty_score":0.99999344},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022145102,0.00039132364,0.98867834,0.0042927857,0.00061729364,0.000599731,0.000042186985,0.000983591,0.0041732793],"genre_scores_gemma":[0.15768552,0.000014019294,0.83701855,0.0042333747,0.0002493165,0.000013354538,0.000017586308,0.000049276598,0.0007189928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952151,0.000027535682,0.00058343017,0.0014357885,0.0017432569,0.0009948501],"domain_scores_gemma":[0.9971388,0.00010430437,0.0001601294,0.002040027,0.00021718086,0.00033958975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015171896,0.00051313173,0.00051918573,0.0012215812,0.00025634424,0.0009338974,0.0036870022,0.00022508897,0.000016361326],"category_scores_gemma":[0.00003993508,0.0004205109,0.000089390735,0.00093995786,0.00017924368,0.00078594167,0.0023362227,0.0009438741,0.000083486964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006221505,0.000018383951,0.0000023316888,0.0001781245,0.000014665869,0.00008729341,0.014938634,0.55376375,0.00002906019,0.056820646,0.000105458355,0.37403545],"study_design_scores_gemma":[0.00024036712,0.00016406835,0.0000113890155,0.0006072724,0.000004165767,0.000072085306,0.0000017143545,0.9767984,0.0002411679,0.021094063,0.00031222784,0.00045305965],"about_ca_topic_score_codex":0.0001784789,"about_ca_topic_score_gemma":0.0003903514,"teacher_disagreement_score":0.4230347,"about_ca_system_score_codex":0.00065284513,"about_ca_system_score_gemma":0.0020111469,"threshold_uncertainty_score":0.99982464},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005026416,0.00081378885,0.98452026,0.0020887884,0.004814702,0.0005459111,0.000011404916,0.0003045667,0.0063979416],"genre_scores_gemma":[0.11080104,0.000036227786,0.88359153,0.0026529368,0.0013254305,0.000008848306,0.000011269508,0.00008338359,0.001489309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934987,0.000046566467,0.00076965225,0.0026539934,0.0020350763,0.00099601],"domain_scores_gemma":[0.9968411,0.00029757948,0.00019168263,0.0018255815,0.0004778252,0.00036623454],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002386978,0.00068820396,0.00065681676,0.0012347086,0.00028683202,0.0013282895,0.003801139,0.00038402432,0.00006636224],"category_scores_gemma":[0.00019510934,0.0006384969,0.00016839715,0.0013536926,0.0002815132,0.0005268062,0.0024409348,0.0012642358,0.00010555065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023935196,0.0000087347635,0.000008825386,0.00006413253,0.000029160252,0.0003107719,0.0017822961,0.41752088,0.0008457481,0.031923622,0.00012735924,0.5473545],"study_design_scores_gemma":[0.00017503418,0.00022363168,0.0000055157434,0.00064319745,0.000014585079,0.000053360138,3.050787e-7,0.8981315,0.0018846808,0.094156206,0.003957358,0.0007546468],"about_ca_topic_score_codex":0.000026985388,"about_ca_topic_score_gemma":0.00006258886,"teacher_disagreement_score":0.54659986,"about_ca_system_score_codex":0.0008334798,"about_ca_system_score_gemma":0.0011799338,"threshold_uncertainty_score":0.9997084},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005536362,0.0007515449,0.94811416,0.0024058544,0.003653604,0.0004011595,0.00006892048,0.00011256255,0.04393854],"genre_scores_gemma":[0.37284368,0.0007163431,0.17518537,0.0147904195,0.005183234,0.000041549807,0.00014657485,0.00024690817,0.43084592],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99258983,0.00007135806,0.0007804162,0.0021101495,0.003808564,0.0006396662],"domain_scores_gemma":[0.9961747,0.0013104683,0.00017057233,0.0018480502,0.0002957363,0.00020048427],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007991929,0.000374843,0.0005136773,0.0014276453,0.00038076146,0.0019628287,0.0039356267,0.00023702373,0.000820884],"category_scores_gemma":[0.0004443103,0.0002861687,0.00019093156,0.0011298978,0.0011004613,0.0005747884,0.0059561995,0.0008058933,0.0031184147],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015642141,0.00003495247,0.00012098653,0.00009554261,0.00001957826,0.0002012183,0.0015167774,0.01174295,0.00011710606,0.04329756,0.002439468,0.9403982],"study_design_scores_gemma":[0.00014670822,0.00008186293,0.00010479756,0.00034740832,0.000016849868,0.000025965604,0.000002627414,0.0475149,0.0011086885,0.6809699,0.2690881,0.0005922269],"about_ca_topic_score_codex":0.000084939355,"about_ca_topic_score_gemma":0.0011797321,"teacher_disagreement_score":0.939806,"about_ca_system_score_codex":0.0004327182,"about_ca_system_score_gemma":0.00026493057,"threshold_uncertainty_score":0.99995905},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046101023,0.0015279852,0.98104024,0.0015395865,0.012177884,0.00060077704,0.000007857977,0.00078560994,0.0018590528],"genre_scores_gemma":[0.13307454,0.00014350934,0.84378016,0.0100292945,0.007297898,0.00006653478,0.00007630678,0.00023783678,0.0052939183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935355,0.00009795546,0.00094346947,0.0026004587,0.001596427,0.0012261459],"domain_scores_gemma":[0.995669,0.00080266624,0.00031936142,0.0023908657,0.0005426875,0.0002754022],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021381238,0.0007792756,0.00083666894,0.0010713142,0.00042495492,0.0010957468,0.004985842,0.00065046357,0.000015995518],"category_scores_gemma":[0.00013660974,0.00065662223,0.00023978144,0.004863735,0.0005077422,0.00080305524,0.0036335979,0.0018474194,0.00063147163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072260586,0.000078823505,0.00036291292,0.0009800645,0.000044373774,0.00024308733,0.0039318567,0.06377058,0.000025981199,0.0022432166,0.0030149273,0.92529696],"study_design_scores_gemma":[0.00026042643,0.00010897078,0.00028109972,0.0024294043,0.000016036684,0.00013174258,0.0000010629097,0.9519791,0.00017593095,0.032745656,0.010857749,0.0010128446],"about_ca_topic_score_codex":0.00006523752,"about_ca_topic_score_gemma":0.0001558864,"teacher_disagreement_score":0.9242841,"about_ca_system_score_codex":0.0010310294,"about_ca_system_score_gemma":0.0024287503,"threshold_uncertainty_score":0.99994123},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006833637,0.0007328018,0.9859497,0.0005449488,0.0025864516,0.00042473208,0.000007584681,0.00018154057,0.009503917],"genre_scores_gemma":[0.18224195,0.0029161524,0.7900166,0.014268005,0.0029337413,0.00012165937,0.00027919273,0.00014649077,0.007076201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964714,0.000038280923,0.0007334289,0.0006229417,0.0014710563,0.0006628625],"domain_scores_gemma":[0.9984239,0.00024640822,0.00018675254,0.00075008976,0.0002595259,0.00013332666],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013770293,0.0003524709,0.00036058036,0.0020431106,0.00012312549,0.0012097193,0.002697487,0.00028421715,0.000013800479],"category_scores_gemma":[0.00017178638,0.00030207803,0.00009336788,0.003051177,0.00033631796,0.0063510747,0.0011085573,0.0011705083,0.00040291593],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009543098,0.000014868881,0.000030990097,0.00016190344,0.000001324056,0.00004991298,0.0020739834,0.010156029,0.000008002102,0.008405306,0.00012995432,0.9789582],"study_design_scores_gemma":[0.0004011604,0.00022777992,0.00025513963,0.00083460554,0.0000043126183,0.000069794565,7.983325e-7,0.823492,0.0008908182,0.11906626,0.05394908,0.00080826523],"about_ca_topic_score_codex":0.000007822061,"about_ca_topic_score_gemma":0.000027151093,"teacher_disagreement_score":0.9781499,"about_ca_system_score_codex":0.0008155684,"about_ca_system_score_gemma":0.0018571957,"threshold_uncertainty_score":0.99994314},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045206384,0.00011713415,0.9810276,0.011315834,0.0010537261,0.00086149696,0.00003477839,0.0001421739,0.0009265864],"genre_scores_gemma":[0.950657,0.000034995097,0.043868784,0.0044181705,0.00020550772,0.000111517045,0.0000024551853,0.00004095664,0.0006606221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997862,0.000023546523,0.00035734838,0.00090195076,0.00047940432,0.00037577297],"domain_scores_gemma":[0.9959658,0.0017047066,0.00027072604,0.0019068276,0.00011468541,0.000037271304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069448346,0.00033539522,0.00033837624,0.0003504091,0.00039232275,0.00033877263,0.0037807662,0.00028000015,0.0000032579974],"category_scores_gemma":[0.00013417631,0.00019731892,0.00018517413,0.000595634,0.0011616137,0.00020644123,0.0013595802,0.0008656211,0.0000062939253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031753823,0.000020452879,0.000008577772,0.000037913742,0.000015933312,0.0000025232532,0.0006568295,0.0006187448,0.0012849293,0.92584664,0.00008700985,0.07141725],"study_design_scores_gemma":[0.00008487316,0.00010663522,0.00010696752,0.00046772053,0.0000122234005,0.000022252538,7.290629e-7,0.12792751,0.015892835,0.84796745,0.007076116,0.00033467577],"about_ca_topic_score_codex":0.000014289756,"about_ca_topic_score_gemma":0.000062248946,"teacher_disagreement_score":0.94613636,"about_ca_system_score_codex":0.000114194736,"about_ca_system_score_gemma":0.00023579852,"threshold_uncertainty_score":0.8046432},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006833637,0.0007328018,0.9859497,0.0005449488,0.0025864516,0.00042473208,0.000007584681,0.00018154057,0.009503917],"genre_scores_gemma":[0.18224195,0.0029161524,0.7900166,0.014268005,0.0029337413,0.00012165937,0.00027919273,0.00014649077,0.007076201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964714,0.000038280923,0.0007334289,0.0006229417,0.0014710563,0.0006628625],"domain_scores_gemma":[0.9984239,0.00024640822,0.00018675254,0.00075008976,0.0002595259,0.00013332666],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013770293,0.0003524709,0.00036058036,0.0020431106,0.00012312549,0.0012097193,0.002697487,0.00028421715,0.000013800479],"category_scores_gemma":[0.00017178638,0.00030207803,0.00009336788,0.003051177,0.00033631796,0.0063510747,0.0011085573,0.0011705083,0.00040291593],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009543098,0.000014868881,0.000030990097,0.00016190344,0.000001324056,0.00004991298,0.0020739834,0.010156029,0.000008002102,0.008405306,0.00012995432,0.9789582],"study_design_scores_gemma":[0.0004011604,0.00022777992,0.00025513963,0.00083460554,0.0000043126183,0.000069794565,7.983325e-7,0.823492,0.0008908182,0.11906626,0.05394908,0.00080826523],"about_ca_topic_score_codex":0.000007822061,"about_ca_topic_score_gemma":0.000027151093,"teacher_disagreement_score":0.9781499,"about_ca_system_score_codex":0.0008155684,"about_ca_system_score_gemma":0.0018571957,"threshold_uncertainty_score":0.99994314},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006833637,0.0007328018,0.9859497,0.0005449488,0.0025864516,0.00042473208,0.000007584681,0.00018154057,0.009503917],"genre_scores_gemma":[0.18224195,0.0029161524,0.7900166,0.014268005,0.0029337413,0.00012165937,0.00027919273,0.00014649077,0.007076201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964714,0.000038280923,0.0007334289,0.0006229417,0.0014710563,0.0006628625],"domain_scores_gemma":[0.9984239,0.00024640822,0.00018675254,0.00075008976,0.0002595259,0.00013332666],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013770293,0.0003524709,0.00036058036,0.0020431106,0.00012312549,0.0012097193,0.002697487,0.00028421715,0.000013800479],"category_scores_gemma":[0.00017178638,0.00030207803,0.00009336788,0.003051177,0.00033631796,0.0063510747,0.0011085573,0.0011705083,0.00040291593],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009543098,0.000014868881,0.000030990097,0.00016190344,0.000001324056,0.00004991298,0.0020739834,0.010156029,0.000008002102,0.008405306,0.00012995432,0.9789582],"study_design_scores_gemma":[0.0004011604,0.00022777992,0.00025513963,0.00083460554,0.0000043126183,0.000069794565,7.983325e-7,0.823492,0.0008908182,0.11906626,0.05394908,0.00080826523],"about_ca_topic_score_codex":0.000007822061,"about_ca_topic_score_gemma":0.000027151093,"teacher_disagreement_score":0.9781499,"about_ca_system_score_codex":0.0008155684,"about_ca_system_score_gemma":0.0018571957,"threshold_uncertainty_score":0.99994314},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005100013,0.0027885141,0.74084145,0.0027147937,0.003824332,0.00052786834,0.000060283415,0.00028911373,0.24844366],"genre_scores_gemma":[0.8589071,0.000085008534,0.031218689,0.0029657832,0.0019921307,0.00013252224,0.00003144822,0.00012529087,0.10454205],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974135,0.000020043712,0.00043403512,0.001199732,0.00044868822,0.00048397013],"domain_scores_gemma":[0.9983448,0.0003216576,0.000133316,0.0010246683,0.000070351714,0.00010525284],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004698435,0.00037701742,0.0005514128,0.00093537825,0.00025868908,0.0002145442,0.0009283613,0.00023224596,0.0024065392],"category_scores_gemma":[0.000017425502,0.00031657805,0.0002730548,0.0013533203,0.000536907,0.00003280518,0.0005152155,0.0008732184,0.0017959978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062720287,0.000136801,0.00045077442,0.00016357211,0.0018421271,0.00033131405,0.013695802,0.009091966,0.000038987666,0.34662426,0.006368412,0.62124974],"study_design_scores_gemma":[0.0005345028,0.0003150076,0.006043104,0.0006923014,0.0023224882,0.00011010089,0.000028948043,0.29275104,0.000053935128,0.43982053,0.254587,0.0027410507],"about_ca_topic_score_codex":0.0000766188,"about_ca_topic_score_gemma":0.0003376657,"teacher_disagreement_score":0.85839707,"about_ca_system_score_codex":0.00014731308,"about_ca_system_score_gemma":0.00008370446,"threshold_uncertainty_score":0.99992865},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001801077,0.00011329972,0.94872576,0.00038181292,0.0016921432,0.0005015071,0.0000015622048,0.00035730423,0.04820862],"genre_scores_gemma":[0.2624526,0.000007797261,0.733911,0.001232632,0.00056813855,0.000019620167,0.000010903066,0.000057418536,0.0017399276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604034,0.000021028449,0.0005937121,0.001361634,0.0012032816,0.00078001205],"domain_scores_gemma":[0.9980781,0.00023427999,0.00020732409,0.0011223876,0.00014055686,0.0002173542],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008092747,0.0005280123,0.00044845798,0.0012685782,0.00028459448,0.0013958053,0.0031168028,0.0002400971,0.0000042981883],"category_scores_gemma":[0.00009241093,0.00048619343,0.00013132519,0.0009266498,0.0002226465,0.0010465947,0.0016853152,0.0010635586,0.00010848232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010758463,0.000004557843,0.0000017879481,0.000050716964,0.000005156813,0.000013748974,0.004004006,0.740985,0.000025683463,0.021031016,0.000018465858,0.2338588],"study_design_scores_gemma":[0.00009591738,0.00014580385,0.000009657121,0.0003810976,0.000007713285,0.00010418462,0.0000015866592,0.9836223,0.00011394751,0.0129734175,0.0020218615,0.0005225018],"about_ca_topic_score_codex":0.0000071795157,"about_ca_topic_score_gemma":0.0000071626205,"teacher_disagreement_score":0.2624346,"about_ca_system_score_codex":0.0004384701,"about_ca_system_score_gemma":0.00023906484,"threshold_uncertainty_score":0.99975896},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014601988,0.002747568,0.87408864,0.11545883,0.001442613,0.0006994923,0.000006810376,0.000349282,0.005060741],"genre_scores_gemma":[0.13975629,0.0016368798,0.8522808,0.0043772026,0.0006275245,0.00009964416,0.000019773837,0.00006780261,0.0011340999],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597406,0.00006584274,0.00054138683,0.0019544244,0.00095313205,0.00051114184],"domain_scores_gemma":[0.98997617,0.00091694645,0.0004940028,0.008469277,0.000088691944,0.000054923086],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0029705476,0.00041455106,0.00033394247,0.00080716016,0.00019444703,0.0013690429,0.027599024,0.0003024689,0.000010037042],"category_scores_gemma":[0.00577006,0.00030382923,0.000046612902,0.0010407525,0.000765669,0.0011029447,0.03746033,0.001344088,0.00006086233],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018686915,0.000067917885,0.00028154027,0.00027390604,0.000025538651,0.00023882245,0.0023404567,0.00068765046,0.0001235351,0.04508052,0.009084565,0.9417769],"study_design_scores_gemma":[0.00008770102,0.00009970863,0.0001094108,0.00043099467,0.000008355853,0.00008835297,0.0000016427578,0.36790586,0.00025073704,0.61264706,0.018047664,0.00032252696],"about_ca_topic_score_codex":0.00007782554,"about_ca_topic_score_gemma":0.00011653191,"teacher_disagreement_score":0.94145435,"about_ca_system_score_codex":0.0002693172,"about_ca_system_score_gemma":0.00021840002,"threshold_uncertainty_score":0.9999414},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007086115,0.0010347221,0.98065495,0.00028243617,0.0066208774,0.00041937685,0.0000013035097,0.00040628057,0.009871445],"genre_scores_gemma":[0.9582327,0.00018945444,0.036550954,0.000925945,0.0032886069,0.00002315814,0.00002146833,0.000070249,0.00069746334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99521244,0.00008098129,0.00060759374,0.0019468418,0.0012780449,0.0008740761],"domain_scores_gemma":[0.9977761,0.00054326415,0.00027877916,0.0009992387,0.00020443882,0.00019820778],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011644235,0.00060956774,0.00046954487,0.0009924513,0.0009149933,0.0006340418,0.0015807338,0.00055143615,0.00008970404],"category_scores_gemma":[0.00008618246,0.00057300535,0.00021573126,0.0013898547,0.00034652738,0.00035413113,0.0016309546,0.0023143748,0.00022662523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014228255,0.000016852524,0.0000028903034,0.000021518683,0.0000067289197,0.00004161829,0.0001947457,0.5783369,0.00011324027,0.017018475,0.00008219642,0.40415058],"study_design_scores_gemma":[0.0001169874,0.00049070496,0.000039667382,0.00051136385,0.000008937973,0.00007452483,1.8716595e-7,0.80007905,0.0008324069,0.17905082,0.018277876,0.000517482],"about_ca_topic_score_codex":0.000032392953,"about_ca_topic_score_gemma":0.00010456332,"teacher_disagreement_score":0.95752406,"about_ca_system_score_codex":0.00075979566,"about_ca_system_score_gemma":0.00030746896,"threshold_uncertainty_score":0.9999873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000498682,0.0019592876,0.9924142,0.00091690803,0.00063974474,0.0005978786,0.000026328298,0.00020714494,0.003233548],"genre_scores_gemma":[0.022153437,0.00006400944,0.97511655,0.00028159178,0.0006566886,0.00015800117,0.000064907705,0.00003115244,0.0014736862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969896,0.000031056607,0.00058228127,0.0011926721,0.00082366343,0.00038070386],"domain_scores_gemma":[0.99790126,0.00039322468,0.0002476567,0.000983494,0.00036355687,0.00011079233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040491184,0.00031416496,0.00035380843,0.0009755345,0.00020976977,0.00017183162,0.002324962,0.00022086997,0.0000074105046],"category_scores_gemma":[0.000020134139,0.00030929418,0.00013385018,0.002498707,0.0006782316,0.00044279126,0.001008749,0.0005586162,0.00011289676],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012665691,0.0001263546,0.00001802711,0.00017651767,0.000017347438,0.000010845938,0.00038889764,0.069296815,0.000068868576,0.09927969,0.0020554776,0.8285599],"study_design_scores_gemma":[0.00006469188,0.000041755415,0.00010137415,0.00015055142,0.000007182483,0.000033863344,1.2314634e-7,0.5660153,0.000079252335,0.42453483,0.008740837,0.00023021922],"about_ca_topic_score_codex":0.000014694488,"about_ca_topic_score_gemma":0.000007794738,"teacher_disagreement_score":0.8283297,"about_ca_system_score_codex":0.0004819642,"about_ca_system_score_gemma":0.0018589203,"threshold_uncertainty_score":0.9999359},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013295516,0.00083686743,0.97070557,0.00028918713,0.007760723,0.00041129018,0.00001667203,0.00015149769,0.018498616],"genre_scores_gemma":[0.3790732,0.000023051814,0.61447835,0.0009541905,0.0015648567,0.00000553154,0.0000069017174,0.00010613302,0.0037877762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99257994,0.00010551145,0.0010730822,0.0024123266,0.0031572545,0.0006718908],"domain_scores_gemma":[0.99412405,0.002809458,0.0006142491,0.0016883172,0.00055800856,0.00020588265],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0069168895,0.00058107614,0.0007210252,0.0024910653,0.000392689,0.0012646429,0.0032201516,0.0006847641,0.00016419169],"category_scores_gemma":[0.0027949347,0.00047377712,0.0002681434,0.0018630287,0.0007770191,0.0004888544,0.0021957925,0.0015982675,0.00011361322],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028762737,0.000015892321,0.00035151615,0.000040240644,0.00002179204,0.00020487148,0.0006346836,0.05189579,0.0008077334,0.0026259667,0.00013020042,0.94324255],"study_design_scores_gemma":[0.00013880181,0.00007070878,0.00056606374,0.00058654585,0.000030048699,0.00018609133,0.0000010503134,0.7172216,0.00065880665,0.2750036,0.004934553,0.00060210587],"about_ca_topic_score_codex":0.000038674294,"about_ca_topic_score_gemma":0.000085529486,"teacher_disagreement_score":0.9426404,"about_ca_system_score_codex":0.0006855685,"about_ca_system_score_gemma":0.0005523526,"threshold_uncertainty_score":0.99977213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032444336,0.00030374536,0.9878566,0.0005163433,0.0025881592,0.0002673621,0.0000014472737,0.00022490809,0.0049969596],"genre_scores_gemma":[0.84015673,0.000025033522,0.15839642,0.00075001316,0.000298809,0.000009694435,0.0000031407965,0.000028526083,0.0003316064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973024,0.000034592238,0.00052811357,0.0010128317,0.00058309286,0.0005389349],"domain_scores_gemma":[0.998015,0.00037902538,0.00015528566,0.0012580021,0.00009486316,0.00009783095],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001373741,0.00041862286,0.0004257818,0.0011276163,0.00020234869,0.00059490843,0.0027010115,0.0002593269,0.000007731925],"category_scores_gemma":[0.000088855675,0.00039080973,0.0000908587,0.00053756067,0.00023405932,0.0010912827,0.0016311674,0.0024889738,0.00003291785],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047926846,0.00002985589,0.00015165377,0.00014373286,0.000010900326,0.00019454201,0.008398181,0.10368377,0.00018666025,0.11311092,0.0000023993891,0.7740826],"study_design_scores_gemma":[0.00010304023,0.00005561024,0.00010897391,0.001392761,0.0000026208402,0.000044686658,0.000001316745,0.6567054,0.00043512668,0.34057927,0.00022036953,0.0003508505],"about_ca_topic_score_codex":0.00029298977,"about_ca_topic_score_gemma":0.00072675437,"teacher_disagreement_score":0.83691233,"about_ca_system_score_codex":0.0007857396,"about_ca_system_score_gemma":0.00025030313,"threshold_uncertainty_score":0.9998544},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002408181,0.0011219257,0.9887206,0.0005713737,0.0036302994,0.0006672578,0.00016493085,0.0007173547,0.0041654683],"genre_scores_gemma":[0.017136926,0.00019587077,0.9775538,0.0016055414,0.0011434772,0.00008333126,0.000039401068,0.0000633807,0.0021782788],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957165,0.000016596034,0.0006550944,0.0020148528,0.0009737081,0.0006232535],"domain_scores_gemma":[0.99742454,0.00020250175,0.00018928779,0.0017747132,0.0001694078,0.00023957102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048108332,0.000612573,0.00057994033,0.00076916325,0.00026572013,0.00045514674,0.0019744402,0.00024430343,0.00003484757],"category_scores_gemma":[0.00003265391,0.0005450309,0.000116393436,0.00070339994,0.00038248327,0.001651992,0.0021633476,0.0007250712,0.00020685652],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012097438,0.000017011986,0.000045210167,0.00009929898,0.000018080647,0.00010478929,0.0007303896,0.0050840187,0.0014715205,0.04012092,0.000103031816,0.9521936],"study_design_scores_gemma":[0.00043754256,0.0012978669,0.00027678846,0.00915714,0.000032344167,0.00023972787,0.0000024704898,0.15067925,0.076689556,0.14672147,0.61134726,0.003118553],"about_ca_topic_score_codex":0.00004070069,"about_ca_topic_score_gemma":0.00006582763,"teacher_disagreement_score":0.9490751,"about_ca_system_score_codex":0.0004789313,"about_ca_system_score_gemma":0.00033167176,"threshold_uncertainty_score":0.9997001},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007000613,0.006806853,0.081810765,0.0123485,0.010924349,0.00051280146,0.00000727926,0.00017449837,0.88734496],"genre_scores_gemma":[0.14533424,0.003603095,0.009760055,0.0038418453,0.013429509,0.000024898422,0.000008125366,0.00012575484,0.8238725],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99724793,0.000022262382,0.00021501015,0.00064037286,0.0012135168,0.00066088623],"domain_scores_gemma":[0.99821085,0.0009682112,0.000051576157,0.0004522718,0.00013154514,0.00018556627],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013939064,0.00022835727,0.00020279601,0.00021018997,0.0005031719,0.0014848788,0.0016133727,0.00024148497,0.00004813386],"category_scores_gemma":[0.00019662456,0.00014915547,0.00011761738,0.00043646884,0.0027205478,0.00017728463,0.00051421847,0.00080954883,0.00015385143],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021636063,0.0000030787885,0.0000028690717,0.0000074010295,0.0000050226276,0.000029060313,0.0050739516,0.0004295993,0.0000011910103,0.119362876,0.00021524567,0.87486756],"study_design_scores_gemma":[0.00003463369,0.000026764443,0.000013564069,0.00026769447,0.000005945176,0.0000037058162,0.000018571493,0.001438366,0.000019274195,0.1718167,0.8261094,0.00024534384],"about_ca_topic_score_codex":0.000052661493,"about_ca_topic_score_gemma":0.0038191096,"teacher_disagreement_score":0.87462217,"about_ca_system_score_codex":0.0002296897,"about_ca_system_score_gemma":0.0008417287,"threshold_uncertainty_score":0.9999935},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006833637,0.0007328018,0.9859497,0.0005449488,0.0025864516,0.00042473208,0.000007584681,0.00018154057,0.009503917],"genre_scores_gemma":[0.18224195,0.0029161524,0.7900166,0.014268005,0.0029337413,0.00012165937,0.00027919273,0.00014649077,0.007076201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964714,0.000038280923,0.0007334289,0.0006229417,0.0014710563,0.0006628625],"domain_scores_gemma":[0.9984239,0.00024640822,0.00018675254,0.00075008976,0.0002595259,0.00013332666],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013770293,0.0003524709,0.00036058036,0.0020431106,0.00012312549,0.0012097193,0.002697487,0.00028421715,0.000013800479],"category_scores_gemma":[0.00017178638,0.00030207803,0.00009336788,0.003051177,0.00033631796,0.0063510747,0.0011085573,0.0011705083,0.00040291593],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009543098,0.000014868881,0.000030990097,0.00016190344,0.000001324056,0.00004991298,0.0020739834,0.010156029,0.000008002102,0.008405306,0.00012995432,0.9789582],"study_design_scores_gemma":[0.0004011604,0.00022777992,0.00025513963,0.00083460554,0.0000043126183,0.000069794565,7.983325e-7,0.823492,0.0008908182,0.11906626,0.05394908,0.00080826523],"about_ca_topic_score_codex":0.000007822061,"about_ca_topic_score_gemma":0.000027151093,"teacher_disagreement_score":0.9781499,"about_ca_system_score_codex":0.0008155684,"about_ca_system_score_gemma":0.0018571957,"threshold_uncertainty_score":0.99994314},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031899032,0.00047060414,0.994453,0.0009468988,0.0022535415,0.0004317775,0.00009166363,0.00037796775,0.00065553084],"genre_scores_gemma":[0.19400051,0.000050210034,0.7997096,0.0012788242,0.0014470872,0.000057942078,0.00014261833,0.00010770477,0.0032054808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957475,0.000017286617,0.00061079115,0.0019225057,0.0010183157,0.00068358355],"domain_scores_gemma":[0.99721235,0.0005722619,0.00023763096,0.0015219405,0.00026095702,0.00019488312],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010792699,0.0005652614,0.0005628756,0.0011205798,0.00037218205,0.0010436276,0.0028205307,0.00034864026,0.000011886373],"category_scores_gemma":[0.00014142063,0.0005004644,0.00025943425,0.0009600482,0.00045874357,0.0008720625,0.0007571494,0.00070385134,0.000050516643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007676589,0.0000944784,0.00030074318,0.00077375735,0.00011284878,0.00008043842,0.000762686,0.23022889,0.00032424452,0.017375967,0.00060066493,0.74926853],"study_design_scores_gemma":[0.00024348329,0.00031379107,0.00008720982,0.0008373342,0.0000509632,0.000029552788,7.2454874e-8,0.97753775,0.001457926,0.01524781,0.0036870763,0.0005070529],"about_ca_topic_score_codex":0.000016490329,"about_ca_topic_score_gemma":0.000020825226,"teacher_disagreement_score":0.7487615,"about_ca_system_score_codex":0.00031457847,"about_ca_system_score_gemma":0.0009203042,"threshold_uncertainty_score":0.9999934},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019377627,0.0055193324,0.9826335,0.00074863184,0.0017957083,0.0009350824,0.000069655005,0.00006503348,0.00803931],"genre_scores_gemma":[0.9210915,0.0010902693,0.06420025,0.0034280973,0.006812245,0.0006043256,0.0006935008,0.0001773421,0.0019024776],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985525,0.000026988611,0.0002865684,0.00067370234,0.00020442384,0.00025584252],"domain_scores_gemma":[0.9990272,0.000537853,0.00015753307,0.000111107205,0.00012028346,0.000046047295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052163965,0.00021496588,0.00022842115,0.00047521995,0.00017366357,0.000090547284,0.00017884985,0.00016427277,0.00002801084],"category_scores_gemma":[0.000016640308,0.0002213186,0.00005710158,0.00012154736,0.0003914941,0.00011546772,0.00012292815,0.00044908037,0.000012201626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007113924,0.00002097963,0.000051310606,0.00016722464,0.000009096377,0.0000036986708,0.0019530177,0.00014206785,0.0000042910383,0.09138596,0.000025637235,0.9062296],"study_design_scores_gemma":[0.0017415644,0.00024823606,0.0013687946,0.0019573362,0.000064785585,0.00009449582,0.000057483638,0.04934854,0.00007313354,0.8612165,0.082694165,0.0011349947],"about_ca_topic_score_codex":0.0000036403524,"about_ca_topic_score_gemma":0.00003934901,"teacher_disagreement_score":0.9208977,"about_ca_system_score_codex":0.00015095397,"about_ca_system_score_gemma":0.00013417008,"threshold_uncertainty_score":0.90251106},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002333432,0.018362923,0.97491664,0.0010170552,0.0029884223,0.00060421904,0.000048604055,0.00078972144,0.0012490941],"genre_scores_gemma":[0.038824026,0.000077897435,0.95857185,0.0006096173,0.00082746556,0.00003412556,0.000013929089,0.00007421852,0.00096687383],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99544895,0.000039375103,0.0006267992,0.0021842853,0.00085723377,0.000843348],"domain_scores_gemma":[0.9952428,0.0024055946,0.00021390292,0.0015016372,0.00046643213,0.00016964994],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011708321,0.00067441986,0.0006631388,0.001031544,0.0003105958,0.0019760174,0.0053964993,0.00069428585,0.000031229363],"category_scores_gemma":[0.00051860674,0.000597125,0.00028750935,0.0011291725,0.0008146806,0.0005316251,0.0030331484,0.0019439884,0.000036845606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001729727,0.000024657087,0.000011959844,0.0002785519,0.000038338603,0.00007351792,0.0051418347,0.00019314275,0.00028343388,0.3814607,0.00014238327,0.6123342],"study_design_scores_gemma":[0.00007658873,0.00012408406,0.000001242804,0.0038234422,0.000013039796,0.000013345335,6.538116e-7,0.17212002,0.0067044604,0.81502724,0.0015166656,0.0005792048],"about_ca_topic_score_codex":0.000049968807,"about_ca_topic_score_gemma":0.00006289812,"teacher_disagreement_score":0.611755,"about_ca_system_score_codex":0.00043167622,"about_ca_system_score_gemma":0.0006767919,"threshold_uncertainty_score":0.9999848},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010118653,0.00036155197,0.98832524,0.0044975383,0.0012761385,0.0011037635,0.000026187914,0.00025059067,0.003147114],"genre_scores_gemma":[0.48438564,0.00003409334,0.50643355,0.007440734,0.0005467195,0.00011665433,0.000017556138,0.00009818701,0.00092684565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99368095,0.00007415668,0.0007463442,0.0026500586,0.0018641569,0.0009843165],"domain_scores_gemma":[0.9968401,0.0006207649,0.00011732481,0.0013374458,0.00045213784,0.00063221925],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023488558,0.0007324776,0.000586314,0.0016888964,0.00040016588,0.0015834862,0.003001995,0.00029637577,0.00007125084],"category_scores_gemma":[0.000101353246,0.0006900328,0.0001380535,0.0012754184,0.0004974104,0.0017498726,0.00074532506,0.00070899795,0.00024743838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018429924,0.000029861547,0.0000023021773,0.000052591324,0.000010614638,0.000085917694,0.0043870923,0.48211497,0.0009180076,0.09526249,0.000020025716,0.41709772],"study_design_scores_gemma":[0.00008019485,0.00045594337,0.0000051916595,0.00034823015,0.000012195351,0.000024884459,0.0000027207248,0.7210269,0.0062973993,0.26994404,0.0011536382,0.0006486516],"about_ca_topic_score_codex":0.00008898941,"about_ca_topic_score_gemma":0.00068780803,"teacher_disagreement_score":0.4833738,"about_ca_system_score_codex":0.0005054542,"about_ca_system_score_gemma":0.0011640372,"threshold_uncertainty_score":0.9995551},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006833637,0.0007328018,0.9859497,0.0005449488,0.0025864516,0.00042473208,0.000007584681,0.00018154057,0.009503917],"genre_scores_gemma":[0.18224195,0.0029161524,0.7900166,0.014268005,0.0029337413,0.00012165937,0.00027919273,0.00014649077,0.007076201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964714,0.000038280923,0.0007334289,0.0006229417,0.0014710563,0.0006628625],"domain_scores_gemma":[0.9984239,0.00024640822,0.00018675254,0.00075008976,0.0002595259,0.00013332666],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013770293,0.0003524709,0.00036058036,0.0020431106,0.00012312549,0.0012097193,0.002697487,0.00028421715,0.000013800479],"category_scores_gemma":[0.00017178638,0.00030207803,0.00009336788,0.003051177,0.00033631796,0.0063510747,0.0011085573,0.0011705083,0.00040291593],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009543098,0.000014868881,0.000030990097,0.00016190344,0.000001324056,0.00004991298,0.0020739834,0.010156029,0.000008002102,0.008405306,0.00012995432,0.9789582],"study_design_scores_gemma":[0.0004011604,0.00022777992,0.00025513963,0.00083460554,0.0000043126183,0.000069794565,7.983325e-7,0.823492,0.0008908182,0.11906626,0.05394908,0.00080826523],"about_ca_topic_score_codex":0.000007822061,"about_ca_topic_score_gemma":0.000027151093,"teacher_disagreement_score":0.9781499,"about_ca_system_score_codex":0.0008155684,"about_ca_system_score_gemma":0.0018571957,"threshold_uncertainty_score":0.99994314},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004088731,0.0009450917,0.9949943,0.00069133035,0.00066677405,0.00088464754,0.000024675368,0.00010136537,0.0012829759],"genre_scores_gemma":[0.35622862,0.00007510921,0.64192945,0.00041920217,0.0005168308,0.0002433471,0.000014965059,0.000048485592,0.00052399014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976743,0.000012384614,0.00027141572,0.0012073263,0.00041031826,0.00042424529],"domain_scores_gemma":[0.99865144,0.00050672656,0.00009399261,0.0005305069,0.00012072043,0.00009659401],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053403707,0.0003259956,0.00030145422,0.00061657623,0.00023844201,0.0007741904,0.0013466137,0.00018843984,0.0000037608],"category_scores_gemma":[0.00001930532,0.00030551205,0.00008012792,0.00046845333,0.00051723974,0.0007519401,0.00097153307,0.00048285737,0.0000074485915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035676228,0.00004104781,0.00012309782,0.00007213601,0.000011595209,0.00006667088,0.0014416411,0.010262964,0.000109445944,0.67013747,0.000053843833,0.31767654],"study_design_scores_gemma":[0.00019846343,0.0001271003,0.001203722,0.00027274626,0.000009989905,0.00003280356,0.0000021673522,0.38103986,0.000044335156,0.6162703,0.00045285522,0.00034565575],"about_ca_topic_score_codex":0.000053973952,"about_ca_topic_score_gemma":0.00022765766,"teacher_disagreement_score":0.37077692,"about_ca_system_score_codex":0.0002747075,"about_ca_system_score_gemma":0.00031104576,"threshold_uncertainty_score":0.9999397},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000498682,0.0019592876,0.9924142,0.00091690803,0.00063974474,0.0005978786,0.000026328298,0.00020714494,0.003233548],"genre_scores_gemma":[0.022153437,0.00006400944,0.97511655,0.00028159178,0.0006566886,0.00015800117,0.000064907705,0.00003115244,0.0014736862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969896,0.000031056607,0.00058228127,0.0011926721,0.00082366343,0.00038070386],"domain_scores_gemma":[0.99790126,0.00039322468,0.0002476567,0.000983494,0.00036355687,0.00011079233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040491184,0.00031416496,0.00035380843,0.0009755345,0.00020976977,0.00017183162,0.002324962,0.00022086997,0.0000074105046],"category_scores_gemma":[0.000020134139,0.00030929418,0.00013385018,0.002498707,0.0006782316,0.00044279126,0.001008749,0.0005586162,0.00011289676],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012665691,0.0001263546,0.00001802711,0.00017651767,0.000017347438,0.000010845938,0.00038889764,0.069296815,0.000068868576,0.09927969,0.0020554776,0.8285599],"study_design_scores_gemma":[0.00006469188,0.000041755415,0.00010137415,0.00015055142,0.000007182483,0.000033863344,1.2314634e-7,0.5660153,0.000079252335,0.42453483,0.008740837,0.00023021922],"about_ca_topic_score_codex":0.000014694488,"about_ca_topic_score_gemma":0.000007794738,"teacher_disagreement_score":0.8283297,"about_ca_system_score_codex":0.0004819642,"about_ca_system_score_gemma":0.0018589203,"threshold_uncertainty_score":0.9999359},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003460841,0.00058291975,0.99487394,0.00016372802,0.002433451,0.00034183692,6.748523e-7,0.00018145518,0.001075925],"genre_scores_gemma":[0.29700378,0.0001275523,0.6987929,0.0008935118,0.0006108889,0.000005632332,0.000004119226,0.00007039929,0.0024912641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965783,0.00003416457,0.00044176137,0.0014193269,0.0009030043,0.0006234831],"domain_scores_gemma":[0.9985622,0.00014401856,0.00017974662,0.00069741055,0.00017539259,0.0002412199],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000691447,0.00046843875,0.0003614538,0.0010859456,0.00036108305,0.0010191933,0.0015907607,0.00022078615,0.000016505719],"category_scores_gemma":[0.00009483551,0.00045496243,0.00008313771,0.00070506893,0.0002967458,0.0004671195,0.0030587735,0.0009269796,0.00013782489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017190616,0.000002937641,0.00007055759,0.00003154843,0.000010770794,0.00006178516,0.001136109,0.8740519,0.000104701976,0.009258924,0.000003050243,0.11526597],"study_design_scores_gemma":[0.00006919677,0.00014088553,0.00005091328,0.00039649205,0.000014804344,0.00004940513,8.725848e-7,0.9843608,0.00020930078,0.012744849,0.0014770384,0.00048540186],"about_ca_topic_score_codex":0.000032184165,"about_ca_topic_score_gemma":0.000016919405,"teacher_disagreement_score":0.29665768,"about_ca_system_score_codex":0.0007367555,"about_ca_system_score_gemma":0.00019807776,"threshold_uncertainty_score":0.9997902},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004660187,0.013082854,0.9807999,0.00084611244,0.0015983285,0.00042971995,0.0000036539736,0.00031391063,0.0024594609],"genre_scores_gemma":[0.13873217,0.0009722796,0.8519892,0.0052132923,0.0016056752,0.000034325087,0.000014023891,0.0001780656,0.0012610002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953033,0.00005411565,0.00053624576,0.0019353105,0.0013004346,0.00087062415],"domain_scores_gemma":[0.9974548,0.000557929,0.00018518121,0.0013859721,0.00019114575,0.0002249796],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012015771,0.00071955903,0.00063384516,0.0011177829,0.00042657097,0.0010551931,0.0025416524,0.00026807332,0.000027875161],"category_scores_gemma":[0.000056320347,0.0005646058,0.00022587381,0.0012218617,0.0009515289,0.00059567275,0.0010529313,0.0011829132,0.000035741898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016652599,0.00012293863,0.00018760751,0.0016801367,0.00021738918,0.0029941092,0.0036138417,0.1382838,0.002455318,0.28792584,0.00017577641,0.5623266],"study_design_scores_gemma":[0.00039077413,0.00036978492,0.000038814236,0.0065665175,0.00006261702,0.0004614572,4.195632e-7,0.91209406,0.0015442036,0.073329985,0.0037921926,0.0013491764],"about_ca_topic_score_codex":0.00003627237,"about_ca_topic_score_gemma":0.000114376344,"teacher_disagreement_score":0.77381027,"about_ca_system_score_codex":0.00018954421,"about_ca_system_score_gemma":0.000443762,"threshold_uncertainty_score":0.9999818},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000095276,0.0009065435,0.9940118,0.00031867632,0.0006015336,0.00037021335,0.000010961841,0.0001650535,0.0036056878],"genre_scores_gemma":[0.060500212,0.00011540405,0.93814176,0.00024158497,0.00025535654,0.00008311839,0.00003275844,0.000018002862,0.0006118169],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846715,0.0000174985,0.00047592854,0.0004745236,0.00035720196,0.00020771989],"domain_scores_gemma":[0.99855113,0.00033910366,0.00020771635,0.00053747406,0.00029794945,0.00006664231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040219523,0.00020347463,0.00024697973,0.0007517479,0.00011953569,0.0004463122,0.0011447768,0.00012661237,8.4512925e-7],"category_scores_gemma":[0.000036382557,0.00018820503,0.00004460115,0.0011282644,0.0003327273,0.0009209861,0.0008364471,0.00030769967,0.000023908786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.595561e-7,0.000016042637,0.0000031547563,0.00020739165,0.000005929574,0.0000015071265,0.00068172463,0.036208633,0.000020924359,0.4515805,0.00025396366,0.51101965],"study_design_scores_gemma":[0.000043365504,0.000039389037,0.000018400404,0.00027463195,0.0000037070936,0.000024653622,1.577092e-7,0.63964254,0.000089636254,0.344278,0.015423375,0.00016214538],"about_ca_topic_score_codex":0.000009625993,"about_ca_topic_score_gemma":0.0000057887,"teacher_disagreement_score":0.6034339,"about_ca_system_score_codex":0.0002115078,"about_ca_system_score_gemma":0.0010944499,"threshold_uncertainty_score":0.7674778},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007176911,0.021894472,0.9736281,0.000739561,0.0019481822,0.00075267564,0.00037509616,0.00042596104,0.00016416456],"genre_scores_gemma":[0.17275557,0.000072996685,0.82285273,0.0023967123,0.00064909196,0.00004031635,0.00038950535,0.000076282064,0.00076681416],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962254,0.000016905415,0.0004806075,0.0017195639,0.0006713664,0.00088615785],"domain_scores_gemma":[0.99790174,0.0003409249,0.00023687459,0.0012042774,0.00016489848,0.00015129539],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009118468,0.00067714776,0.0005256229,0.00079666456,0.00028319596,0.0011483058,0.003517818,0.00033074373,0.0000048772567],"category_scores_gemma":[0.00011491292,0.00049881946,0.00012650275,0.00043606118,0.00050023093,0.0017305557,0.0035189493,0.0010833144,0.000010480464],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019416952,0.000017341526,0.0000037333025,0.0003982332,0.00003430554,0.00012534033,0.0014411748,0.000031101525,0.0015619142,0.028801218,0.0004337483,0.96713245],"study_design_scores_gemma":[0.00054408394,0.0003280142,0.000006408994,0.0017699468,0.00002857372,0.0003248297,0.0000012572001,0.3900501,0.015787609,0.5834239,0.006264681,0.0014705785],"about_ca_topic_score_codex":0.000017520111,"about_ca_topic_score_gemma":0.0000466306,"teacher_disagreement_score":0.9656619,"about_ca_system_score_codex":0.0002556954,"about_ca_system_score_gemma":0.00022194558,"threshold_uncertainty_score":0.9998886},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010024782,0.00044095918,0.99287033,0.00047790495,0.004211576,0.0005732129,0.000007996856,0.0012947576,0.00011322858],"genre_scores_gemma":[0.0018822609,0.000021849935,0.99639577,0.0003771295,0.0006249053,0.00007908819,0.000022611353,0.00004612213,0.0005502664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968792,0.000025294286,0.0005079754,0.0012875221,0.0007369947,0.0005630158],"domain_scores_gemma":[0.996806,0.0015119527,0.0002015709,0.0011549275,0.00021306104,0.00011249112],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018040898,0.0004262427,0.00039607682,0.000687301,0.00012739512,0.0010430715,0.0025738664,0.00028633745,0.0000053888025],"category_scores_gemma":[0.0008764939,0.00041431954,0.00014482193,0.0008943254,0.00010806525,0.0010049354,0.00089073094,0.00061625236,0.000030287192],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006778146,0.000035979156,0.000031634365,0.0007755806,0.000033062915,0.000029353005,0.0005010827,0.05822951,0.000098511446,0.018446203,0.001079642,0.9207327],"study_design_scores_gemma":[0.00018248004,0.0002172689,0.00007346074,0.0007420394,0.000017151375,0.00002808028,3.8657554e-8,0.73341435,0.0009809383,0.19156124,0.07189136,0.0008916179],"about_ca_topic_score_codex":0.000011889399,"about_ca_topic_score_gemma":0.0000071703494,"teacher_disagreement_score":0.91984105,"about_ca_system_score_codex":0.0006383178,"about_ca_system_score_gemma":0.00079491874,"threshold_uncertainty_score":0.9999939},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034586138,0.0014224517,0.9898587,0.00029710765,0.0012494847,0.00027769987,0.000013764911,0.000060335064,0.0033618666],"genre_scores_gemma":[0.9780631,0.000008412589,0.01984949,0.00029000966,0.00025692515,0.0000107445085,0.000005769212,0.00003222142,0.0014833391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829763,0.000010406706,0.0005307468,0.00082067045,0.000059191636,0.0002813391],"domain_scores_gemma":[0.99933195,0.00016425087,0.00017979555,0.0002447016,0.000031673466,0.0000476045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011882355,0.0002281732,0.0003585764,0.0009142761,0.00011571222,0.00027118213,0.00025943015,0.00020839373,0.000017567701],"category_scores_gemma":[0.000084863386,0.00024443062,0.000057531543,0.00033807894,0.00019702887,0.00015223428,0.000099114535,0.0005153132,0.000074850366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016233254,0.00008800546,0.008949533,0.0004661918,0.000031264644,0.00006795641,0.0024311882,0.17995057,0.00012605777,0.71689343,0.000014952818,0.09096463],"study_design_scores_gemma":[0.00025319966,0.00005256562,0.00052444794,0.00039643917,0.0000031881143,0.000019319848,3.2604382e-7,0.8521441,0.00008574948,0.14502355,0.001119278,0.00037783102],"about_ca_topic_score_codex":0.00006856114,"about_ca_topic_score_gemma":0.0003301221,"teacher_disagreement_score":0.9746045,"about_ca_system_score_codex":0.00018071984,"about_ca_system_score_gemma":0.000057569177,"threshold_uncertainty_score":0.99675906},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023884288,0.0016481578,0.98887086,0.0005370565,0.0051290537,0.00032481353,0.000007824018,0.0009843833,0.0024739804],"genre_scores_gemma":[0.012431693,0.000049725797,0.98474336,0.00045532102,0.00056009,0.00000956602,0.0000048525785,0.000065041044,0.0016803383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99561316,0.000037691174,0.0004960613,0.0020730288,0.0009847434,0.0007953147],"domain_scores_gemma":[0.9962082,0.001494437,0.00016952746,0.0017757235,0.00017942023,0.0001726719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095637975,0.0007208222,0.0006731359,0.001025464,0.00015287576,0.0005402416,0.003626033,0.0003695946,0.000013770468],"category_scores_gemma":[0.00039666044,0.0006445456,0.00019275957,0.0008798229,0.0007260039,0.00069827016,0.0026434807,0.0013394572,0.0002651879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026384262,0.000007914121,0.0000077974555,0.00006705006,0.000019848274,0.00029866514,0.00084719236,0.5679564,0.00016055121,0.0841746,0.00001883945,0.34643853],"study_design_scores_gemma":[0.00008792038,0.0000917916,0.00005801692,0.0004061986,0.000007785342,0.00008185015,1.2457186e-7,0.20807041,0.0010995916,0.78786904,0.0015260692,0.0007012067],"about_ca_topic_score_codex":0.0000051639427,"about_ca_topic_score_gemma":0.000013831682,"teacher_disagreement_score":0.7036944,"about_ca_system_score_codex":0.0005866732,"about_ca_system_score_gemma":0.0003063714,"threshold_uncertainty_score":0.9996006},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014642163,0.00072307093,0.99220204,0.00037200138,0.0028797113,0.0011904362,0.000024719637,0.00018384907,0.002277738],"genre_scores_gemma":[0.09563411,0.000022580489,0.90348697,0.00016642104,0.00021642247,0.00006137268,0.000004622853,0.00003446205,0.00037304702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962286,0.00005149958,0.00076158857,0.0016164976,0.0008025489,0.00053928746],"domain_scores_gemma":[0.99627674,0.00079675706,0.00036547973,0.0020376488,0.00041929467,0.00010407826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024795916,0.00048420765,0.0006174464,0.00061894825,0.00016189736,0.00036427483,0.0033201436,0.00034519166,0.00000663113],"category_scores_gemma":[0.0003548026,0.0004158105,0.00021380863,0.0006958829,0.0012566313,0.0007121745,0.001122458,0.00059014425,0.000017530152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009355933,0.0000152024195,0.000017680399,0.0002524112,0.000010400399,0.0000026121904,0.00078801555,0.007454159,0.00020484168,0.6467932,0.0000044840067,0.34444764],"study_design_scores_gemma":[0.00007834405,0.00016463408,0.000044178054,0.00020883564,0.000008366314,0.000009122558,1.4388121e-7,0.40426806,0.007613265,0.5868151,0.00051815127,0.00027178522],"about_ca_topic_score_codex":0.000011217873,"about_ca_topic_score_gemma":0.00002919171,"teacher_disagreement_score":0.3968139,"about_ca_system_score_codex":0.00035082348,"about_ca_system_score_gemma":0.0006344633,"threshold_uncertainty_score":0.99982935},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003802812,0.0029009732,0.9907516,0.00094508025,0.0017736409,0.00025262462,0.00004761792,0.00021339883,0.0030770302],"genre_scores_gemma":[0.15633668,0.0007680946,0.83036476,0.0050246036,0.0023901528,0.000035186757,0.000102999285,0.00018696464,0.004790528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965174,0.000014061173,0.00036872932,0.0017636606,0.0008125926,0.00052355585],"domain_scores_gemma":[0.9982446,0.00021557983,0.00005196372,0.0011781893,0.00010213565,0.0002075659],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043971968,0.00049704174,0.00042785722,0.00059858465,0.00021521065,0.0010836282,0.0023980855,0.00029760398,0.00004264207],"category_scores_gemma":[0.000017772983,0.00040086365,0.000096108364,0.00041258844,0.00045762223,0.0007719759,0.00199201,0.0008461437,0.00010803397],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003087622,0.0000135262735,0.000012205022,0.00009725047,0.000011606111,0.000258307,0.0006449246,0.0010793405,0.00012457512,0.067360364,0.0001402818,0.9302545],"study_design_scores_gemma":[0.00023821929,0.00016932728,0.0001021718,0.0011552478,0.000015119695,0.00021276205,1.5441846e-7,0.6346798,0.00053500506,0.3355557,0.02642725,0.0009092604],"about_ca_topic_score_codex":0.00001749046,"about_ca_topic_score_gemma":0.000034389122,"teacher_disagreement_score":0.92934525,"about_ca_system_score_codex":0.00011630347,"about_ca_system_score_gemma":0.00023371942,"threshold_uncertainty_score":0.9999533},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009156897,0.002233407,0.9518792,0.00032769333,0.006671836,0.00034044482,0.0000013102373,0.00039750244,0.038139444],"genre_scores_gemma":[0.9006971,0.00006470373,0.08048447,0.0013372989,0.0018101801,0.000015211757,0.000007211668,0.000085334235,0.015498458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635863,0.000041885032,0.00044470563,0.0015900854,0.0008813956,0.0006833218],"domain_scores_gemma":[0.99768007,0.00031168398,0.00016918921,0.0014458008,0.0002175141,0.0001757328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012662035,0.0005136262,0.0004903007,0.00063927524,0.00018884051,0.0009890922,0.0033808565,0.00037911962,0.00003861684],"category_scores_gemma":[0.00006423433,0.0004069657,0.00015928538,0.00074481335,0.0005277666,0.00038774207,0.0015087578,0.0008464948,0.000641845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003555127,0.000010921675,0.000008014822,0.0000443413,0.000014670455,0.00015108108,0.00053483795,0.0016517087,0.000030460818,0.7288152,0.00004136744,0.26869383],"study_design_scores_gemma":[0.00010170918,0.00016960088,0.000009378283,0.00007211825,0.000008187033,0.000104775136,1.8665885e-7,0.09109912,0.00023682376,0.8908641,0.016832797,0.00050123624],"about_ca_topic_score_codex":0.000022579474,"about_ca_topic_score_gemma":0.000036372978,"teacher_disagreement_score":0.900688,"about_ca_system_score_codex":0.00022069513,"about_ca_system_score_gemma":0.0005182764,"threshold_uncertainty_score":0.99983823},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011254137,0.0004874331,0.99326414,0.0006096727,0.0006138175,0.00046952043,0.000007985417,0.0028070782,0.0006149643],"genre_scores_gemma":[0.82493347,0.000041607003,0.17452529,0.00017406326,0.00013385259,0.000024997167,0.000050340506,0.000029560633,0.00008683864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974442,0.00003467906,0.0003995063,0.001195884,0.0005371712,0.00038854487],"domain_scores_gemma":[0.99844366,0.00034776752,0.00026254918,0.0005685616,0.0002756404,0.00010184372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006839562,0.00041706275,0.00034551232,0.0009312551,0.00027847392,0.00076542766,0.0006234343,0.0002771322,0.0000058006913],"category_scores_gemma":[0.00008962882,0.0003766797,0.000056883207,0.0005029305,0.00041805988,0.0008909946,0.000317941,0.00067021797,0.000016647555],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030518935,0.00005746459,0.00042686352,0.00025543568,0.00003702364,0.00009495825,0.0014609421,0.006556096,0.00074211514,0.21123695,0.00003676519,0.7790649],"study_design_scores_gemma":[0.00014147798,0.0002523521,0.0007074193,0.0016880874,0.00001701931,0.00028525773,1.181631e-7,0.6068713,0.00021209018,0.38934317,0.00010841557,0.00037326902],"about_ca_topic_score_codex":0.000026204476,"about_ca_topic_score_gemma":0.0000798471,"teacher_disagreement_score":0.823808,"about_ca_system_score_codex":0.00042627833,"about_ca_system_score_gemma":0.00019691589,"threshold_uncertainty_score":0.9998685},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5247589,0.0009792796,0.22006872,0.001862894,0.009755578,0.0026916172,0.000027568432,0.0005300329,0.23932542],"genre_scores_gemma":[0.99715215,0.000022481463,0.0009913082,0.0004435989,0.00036252875,0.000044997432,0.0000024452677,0.000029030842,0.0009514297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976555,0.00006281227,0.00041708318,0.00085442996,0.0007408485,0.0002693332],"domain_scores_gemma":[0.9976095,0.0010268684,0.00027878315,0.0006496504,0.00038917508,0.000046004665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074485486,0.00033813497,0.00029807107,0.00053473853,0.00015927784,0.00016441806,0.00082032953,0.00014286244,0.00015260951],"category_scores_gemma":[0.00007910852,0.00024383063,0.000103418795,0.00036153028,0.0007014629,0.00035074184,0.00018013388,0.00072421797,0.000046339024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002336744,0.00007096624,0.00024284176,0.00003293455,0.00004604354,0.000051419065,0.12241609,0.032045994,0.000016056094,0.8123323,0.0000069439993,0.032715075],"study_design_scores_gemma":[0.00071828713,0.0013278092,0.10813323,0.0017203543,0.00012187012,0.000086959146,0.0032183684,0.0012938895,0.00039006016,0.88041294,0.0012350614,0.0013411599],"about_ca_topic_score_codex":0.000020703283,"about_ca_topic_score_gemma":0.000011496268,"teacher_disagreement_score":0.4723933,"about_ca_system_score_codex":0.00035929566,"about_ca_system_score_gemma":0.00019863974,"threshold_uncertainty_score":0.9943124},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024885305,0.00036815973,0.9588,0.025173957,0.005701036,0.0022926754,0.00011269512,0.00069067447,0.004372238],"genre_scores_gemma":[0.6137534,0.000524167,0.31657565,0.059555154,0.0040910356,0.00013029898,0.00016750162,0.0001935179,0.0050093033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946165,0.0000422526,0.0017044881,0.0019252002,0.0011790075,0.0005325607],"domain_scores_gemma":[0.9953382,0.0023128148,0.00041245675,0.0012102727,0.00036823418,0.0003580236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020175434,0.00049773196,0.0010215368,0.0012410692,0.00010882542,0.00020128704,0.0006447983,0.00029745133,0.00020306284],"category_scores_gemma":[0.0009408333,0.00042177286,0.00039287898,0.0014649952,0.0003613249,0.00012236516,0.00068126665,0.0011470388,0.0004640934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022307038,0.00017114825,0.002634842,0.0002830836,0.0010266999,0.00043173626,0.00013449199,0.046281487,0.00008120899,0.0011714859,0.0007839663,0.9467768],"study_design_scores_gemma":[0.0016082447,0.0019504245,0.014898358,0.0029219051,0.003437632,0.00002377391,0.0000014585383,0.9453478,0.00030639995,0.009674591,0.018663108,0.0011663233],"about_ca_topic_score_codex":0.00016621781,"about_ca_topic_score_gemma":0.0005422592,"teacher_disagreement_score":0.94561046,"about_ca_system_score_codex":0.0005471294,"about_ca_system_score_gemma":0.00037005596,"threshold_uncertainty_score":0.9998234},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029395543,0.0014623812,0.29846245,0.06505155,0.0070065083,0.00766187,0.00022703219,0.00061893166,0.5901137],"genre_scores_gemma":[0.9945633,0.000026333022,0.0011035808,0.0026999586,0.0003960193,0.0000333291,0.0000034927805,0.000016181368,0.0011578304],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967821,0.000100885874,0.00054858037,0.00075102795,0.0013202599,0.00049709517],"domain_scores_gemma":[0.996541,0.0019512859,0.00013926695,0.0009333589,0.00025939662,0.0001756737],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004760088,0.00032329993,0.00036690265,0.00022492062,0.00088400714,0.0033608878,0.0019957414,0.00021008305,0.000078342615],"category_scores_gemma":[0.0016636355,0.00017748591,0.00014592161,0.000618627,0.009585947,0.0017383826,0.0013670471,0.00063246436,0.00006609468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058182944,0.000012936048,0.00067327655,0.0001371885,0.000020978061,0.0000015647893,0.06322585,0.0003494637,6.071566e-7,0.4212434,0.00008640157,0.51419014],"study_design_scores_gemma":[0.00014750354,0.000036376998,0.0005136967,0.00014671123,0.000017715598,0.0000018950511,0.0001742759,0.0013196355,0.000009763866,0.980511,0.01685355,0.00026788664],"about_ca_topic_score_codex":0.0004984666,"about_ca_topic_score_gemma":0.008834788,"teacher_disagreement_score":0.96516776,"about_ca_system_score_codex":0.0006890736,"about_ca_system_score_gemma":0.0008223068,"threshold_uncertainty_score":0.9976737},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20394202,0.0025169319,0.7714836,0.00016798684,0.005284411,0.00081697636,0.000013450126,0.000081579026,0.015693035],"genre_scores_gemma":[0.9969866,0.000055202127,0.0016840864,0.0002482947,0.00018055631,0.000016187221,4.326975e-7,0.000024950032,0.0008036412],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983086,0.000046504145,0.0002714334,0.0008075874,0.00029762438,0.00026826994],"domain_scores_gemma":[0.9962291,0.0030213303,0.00008623945,0.0005509029,0.000045609697,0.00006678477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006095438,0.00028746543,0.00030100532,0.00030038867,0.00018096475,0.0002015045,0.00049357326,0.00019782147,0.00012076408],"category_scores_gemma":[0.00007286411,0.00017935275,0.00005914154,0.00016561609,0.0007815114,0.00006131124,0.0003916212,0.0004537857,0.00004811436],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010723502,0.000009444693,0.00176171,0.000038766804,0.000012217968,0.00003898413,0.0047175284,0.00009583398,0.000044318967,0.0047119414,0.0001519893,0.98831004],"study_design_scores_gemma":[0.007295073,0.019572202,0.2558626,0.030569931,0.0004117405,0.0017743568,0.00009542615,0.08800341,0.0023576238,0.42966643,0.15646128,0.007929926],"about_ca_topic_score_codex":0.0000092855735,"about_ca_topic_score_gemma":0.00009147173,"teacher_disagreement_score":0.9803801,"about_ca_system_score_codex":0.000052417745,"about_ca_system_score_gemma":0.000033088156,"threshold_uncertainty_score":0.7313793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056121927,0.00047075385,0.9873467,0.0011016631,0.0028629033,0.0009882404,0.00000493565,0.0005298648,0.0010827293],"genre_scores_gemma":[0.58812165,0.00003424302,0.405707,0.002918918,0.0011006502,0.00008969003,0.000021474525,0.00012754182,0.0018788036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956351,0.00004779813,0.00065164355,0.0020448659,0.0008815624,0.0007390251],"domain_scores_gemma":[0.99779814,0.0001913603,0.00041764104,0.0009732639,0.00048786233,0.0001317509],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084284483,0.0006159318,0.0005399702,0.0023307167,0.00043248944,0.0008455386,0.002276089,0.0004131861,0.000029395675],"category_scores_gemma":[0.00013106322,0.00058890396,0.00011328299,0.0016172661,0.0004415757,0.00107129,0.0016822193,0.0021446042,0.00018930872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059461036,0.0001266323,0.0001232151,0.0003205933,0.00009765166,0.0004786907,0.015036424,0.22339587,0.028338298,0.075919546,0.000021226611,0.6560824],"study_design_scores_gemma":[0.00015568866,0.0009194608,0.000011045494,0.00068884867,0.0000113548085,0.00020228942,0.0000011721141,0.947952,0.0056942063,0.035584018,0.008132295,0.00064764766],"about_ca_topic_score_codex":0.00008388039,"about_ca_topic_score_gemma":0.00018529192,"teacher_disagreement_score":0.7245561,"about_ca_system_score_codex":0.0011284966,"about_ca_system_score_gemma":0.00047806185,"threshold_uncertainty_score":0.99965626},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93936116,0.0006227321,0.057456695,0.0006851398,0.0007022672,0.00038623018,0.00000778353,0.00003890007,0.0007391246],"genre_scores_gemma":[0.9989305,0.00006334584,0.00066856295,0.0001589564,0.000035586883,0.000011963954,1.6642501e-7,0.000012371529,0.000118560325],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997487,0.00012872917,0.0004241218,0.00071068254,0.0010412143,0.0002082147],"domain_scores_gemma":[0.9904795,0.008058849,0.00025378267,0.0008656289,0.0003086073,0.000033627053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003936125,0.00024132348,0.0003963104,0.0006252925,0.000111944086,0.00013659829,0.0016131256,0.00014547748,0.000013460932],"category_scores_gemma":[0.0015675478,0.000119318705,0.000099125165,0.00068217184,0.0023992981,0.00019748675,0.0006675275,0.0007481558,0.000016630938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012903621,0.000056304514,0.008344147,0.00016367035,0.00006674913,0.0000528087,0.00872134,0.075026385,0.0045507955,0.34436634,0.000008546969,0.5585139],"study_design_scores_gemma":[0.00027663895,0.0005605289,0.17489175,0.0036286868,0.00006672141,0.00006111606,0.000054416934,0.011368392,0.020873358,0.78638774,0.0012043582,0.0006262841],"about_ca_topic_score_codex":0.000015046338,"about_ca_topic_score_gemma":0.000012814081,"teacher_disagreement_score":0.55788755,"about_ca_system_score_codex":0.00004213146,"about_ca_system_score_gemma":0.0001106512,"threshold_uncertainty_score":0.8840314},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054451423,0.0023129373,0.98517376,0.0020715664,0.0024438754,0.0018469358,0.000042554777,0.000046580277,0.00061663805],"genre_scores_gemma":[0.95889634,0.00002183854,0.04050603,0.00009471705,0.0002151629,0.00012851917,0.000009465696,0.000024101502,0.000103852966],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982235,0.0000600601,0.00041850956,0.00072418957,0.00032123076,0.00025251647],"domain_scores_gemma":[0.99889374,0.00026232578,0.00020424856,0.00036338394,0.0002316323,0.000044657394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013591785,0.00019043719,0.00021989693,0.00035253091,0.0001604391,0.00008223022,0.0003435891,0.0002212956,0.000013814684],"category_scores_gemma":[0.00006319029,0.000150313,0.00003729986,0.00025434745,0.0012953039,0.00016167208,0.00014701221,0.000340425,0.0000046915034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035567857,0.00004314234,9.10285e-7,0.000098611235,0.000011747451,0.0000012308402,0.001990553,0.0022928133,0.000020409454,0.14273703,0.00000418166,0.8527638],"study_design_scores_gemma":[0.00006901331,0.0011260784,0.000017047176,0.00044494926,0.000048404258,0.00008160509,0.000052284373,0.07749631,0.0018264347,0.91864926,0.000058668757,0.0001299762],"about_ca_topic_score_codex":0.000031425527,"about_ca_topic_score_gemma":0.0000656823,"teacher_disagreement_score":0.95345116,"about_ca_system_score_codex":0.0001471952,"about_ca_system_score_gemma":0.00016551392,"threshold_uncertainty_score":0.61295867},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9503744,0.00021371298,0.04514866,0.000073104646,0.003222764,0.0006959144,0.000022332772,0.000041035582,0.00020805962],"genre_scores_gemma":[0.99795073,0.0000045918578,0.001684136,0.00006008319,0.00017080552,0.000057293695,0.0000036363188,0.000019278868,0.000049435854],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985925,0.000043859054,0.00026531203,0.0005373212,0.00027626287,0.00028472548],"domain_scores_gemma":[0.9988741,0.00057045516,0.00010232922,0.0003239567,0.000053840045,0.00007527503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024678788,0.0002478389,0.00026203666,0.00040940105,0.00015349266,0.00021532623,0.00029397354,0.00010997413,0.000015154214],"category_scores_gemma":[0.000035803383,0.00016691293,0.000071035436,0.00023486887,0.00024293998,0.00030734212,0.00015963567,0.00038243952,0.000006259254],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084085047,0.00028602203,0.08228917,0.0005210835,0.000101876365,0.00009114362,0.031410187,0.0025775174,0.0018094532,0.018055445,0.000017307584,0.8619999],"study_design_scores_gemma":[0.0025517042,0.016069835,0.9421655,0.00683168,0.0003713874,0.00005653639,0.00009618655,0.018213153,0.0034510398,0.008227102,0.00016142392,0.0018044544],"about_ca_topic_score_codex":0.00056766113,"about_ca_topic_score_gemma":0.00045218304,"teacher_disagreement_score":0.8601955,"about_ca_system_score_codex":0.000099112425,"about_ca_system_score_gemma":0.00003506518,"threshold_uncertainty_score":0.6806511},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001154234,0.0014924749,0.98354346,0.00013828129,0.0014754655,0.000122033685,0.000012859822,0.00013837931,0.011922825],"genre_scores_gemma":[0.81880033,0.0009186367,0.17488432,0.0007526927,0.0021953378,0.000038400267,0.0000120777095,0.00011476368,0.0022834337],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998533,0.000005617596,0.00022554574,0.0005235632,0.0002685832,0.0004436673],"domain_scores_gemma":[0.9994136,0.00021791452,0.00001967819,0.00023308159,0.000015704856,0.00010003101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028845563,0.00026771444,0.00035119784,0.0002392807,0.00008883201,0.000141577,0.0004304996,0.0001715556,0.00007384814],"category_scores_gemma":[0.000032280455,0.00019326684,0.000039080765,0.0005249648,0.0015007065,0.00006425141,0.00053756306,0.00044563672,0.00006882976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000087684175,0.000019284309,0.000014077693,0.0010933114,0.000042048057,0.00021206158,0.00076681917,0.09692099,0.0009177007,0.16115941,0.000552085,0.7382934],"study_design_scores_gemma":[0.000045693723,0.00003941043,0.00000813603,0.00018118959,0.000008228654,0.000036399917,4.1133887e-7,0.095041394,0.0003260771,0.9017844,0.0022438762,0.00028478762],"about_ca_topic_score_codex":4.7529002e-7,"about_ca_topic_score_gemma":0.0000011783661,"teacher_disagreement_score":0.8176461,"about_ca_system_score_codex":0.00009106666,"about_ca_system_score_gemma":0.000031139443,"threshold_uncertainty_score":0.7881193},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049235043,0.014895263,0.9695059,0.00023104262,0.0020062116,0.00033133442,0.000014903443,0.000013199152,0.008078616],"genre_scores_gemma":[0.99064666,0.0010628384,0.0044733724,0.00065775233,0.0014090477,0.000009662286,0.000016439946,0.000054566764,0.0016696658],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983395,0.000008641722,0.00021994743,0.00088374125,0.00019564951,0.0003525249],"domain_scores_gemma":[0.9993314,0.000033222444,0.000026897558,0.00046511233,0.00007242964,0.00007094883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023573817,0.00033720816,0.00027081603,0.00012615397,0.00009786832,0.000091645285,0.0005188249,0.00029767086,0.00001654789],"category_scores_gemma":[0.000010978915,0.00029119314,0.00015180088,0.00008951382,0.00037677903,7.6240565e-7,0.00035121778,0.00031606003,0.000014250293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114228016,0.00006184315,0.0003556671,0.00020032194,0.0003893604,0.00014623516,0.0007034418,0.30469447,0.097558275,0.006392082,0.00037781705,0.58900625],"study_design_scores_gemma":[0.002953751,0.0047438317,0.001872491,0.0017332978,0.00047677994,0.00054023176,0.0000019541071,0.30019215,0.07480757,0.2756534,0.3289802,0.0080443695],"about_ca_topic_score_codex":0.0000049299515,"about_ca_topic_score_gemma":0.00009006634,"teacher_disagreement_score":0.98572314,"about_ca_system_score_codex":0.000032686177,"about_ca_system_score_gemma":0.00013448496,"threshold_uncertainty_score":0.99995404},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13875346,0.04151942,0.79863286,0.0010139386,0.007040947,0.0008490162,0.0003407103,0.000055612145,0.011794072],"genre_scores_gemma":[0.98369354,0.00074043655,0.012595333,0.0010425138,0.0009494137,0.000012729707,0.000046090914,0.000067641595,0.000852311],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99764067,0.000014494798,0.00036752052,0.0012335259,0.00028511696,0.0004586671],"domain_scores_gemma":[0.9990877,0.000042728705,0.00007989035,0.000610899,0.00008181927,0.000096996846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002094762,0.0004917499,0.00040625306,0.00021640169,0.00013998269,0.00013313854,0.0007633315,0.0003829554,0.000016302885],"category_scores_gemma":[0.000016917435,0.0004528741,0.00022757312,0.000112088055,0.00066731474,0.0000025363313,0.0003560259,0.00040626375,0.000016227572],"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.00008833895,0.00004353765,0.00069710484,0.00014918968,0.00037295412,0.00013143949,0.002793067,0.024959167,0.77284926,0.0011894869,0.0001155373,0.19661091],"study_design_scores_gemma":[0.002983838,0.0026418904,0.0040597576,0.0016834267,0.00066822016,0.0002580033,0.000018026854,0.022509022,0.3936803,0.33217978,0.23212217,0.0071955626],"about_ca_topic_score_codex":0.00004811494,"about_ca_topic_score_gemma":0.00050316355,"teacher_disagreement_score":0.84494007,"about_ca_system_score_codex":0.00004848854,"about_ca_system_score_gemma":0.00017266413,"threshold_uncertainty_score":0.9997923},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024502676,0.007420776,0.9543991,0.00077236217,0.0033635139,0.0009943319,0.000094266274,0.00006217147,0.008390803],"genre_scores_gemma":[0.97945136,0.00036935808,0.012040469,0.0010154158,0.001536448,0.000037458136,0.000029084013,0.00008855098,0.005431855],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99814165,0.000028262224,0.00020612402,0.0008991036,0.00033733674,0.0003875548],"domain_scores_gemma":[0.99906474,0.00004731588,0.00008762111,0.00056811323,0.00016297823,0.000069252616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040260403,0.00036042964,0.00023529478,0.00007363594,0.0002267873,0.00021736293,0.00079508504,0.0003639961,0.00003760248],"category_scores_gemma":[0.0000531062,0.00024643997,0.00016307321,0.0001392487,0.0005066972,0.00000801402,0.00025653528,0.0003791024,0.000043872333],"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.0000584662,0.00002720261,0.000013640653,0.00006175532,0.00009645733,0.000022586852,0.0037058804,0.001231385,0.92640454,0.004349091,0.000050155573,0.06397886],"study_design_scores_gemma":[0.0005427154,0.0015924221,0.00024438402,0.0006113491,0.00012329426,0.000056414345,0.000042892003,0.0053710267,0.7222344,0.1395776,0.12725924,0.0023442272],"about_ca_topic_score_codex":0.000038463975,"about_ca_topic_score_gemma":0.00015178548,"teacher_disagreement_score":0.95494866,"about_ca_system_score_codex":0.00010648561,"about_ca_system_score_gemma":0.00017975386,"threshold_uncertainty_score":0.9999988},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020464322,0.031308684,0.94548476,0.00018987118,0.0007604327,0.00045501735,0.000034992983,0.000021921682,0.001279975],"genre_scores_gemma":[0.6402041,0.0056496845,0.34933978,0.00056863436,0.0014379804,0.000018678138,0.00010422116,0.00014121298,0.0025357336],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984383,0.000009458852,0.00026587583,0.0007304792,0.0002791007,0.00027681515],"domain_scores_gemma":[0.9992815,0.000047643127,0.00010284921,0.0004066145,0.000095885494,0.00006550449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038860433,0.00027399036,0.00031124725,0.00025293644,0.000056431858,0.00007022258,0.00041621528,0.0001977058,0.00001242242],"category_scores_gemma":[0.000029899289,0.00024361462,0.00008426906,0.00010538279,0.00051193347,0.0000051977013,0.0005624335,0.00018982794,0.0000058390265],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094499796,0.00003680888,0.00050186407,0.0005765253,0.00022674978,0.000045421617,0.0009089186,0.0113968905,0.40965775,0.0009835935,0.000027482236,0.57554346],"study_design_scores_gemma":[0.0054592993,0.0022615313,0.0015928632,0.0023275437,0.00040120137,0.0005280181,0.0000065604536,0.058219884,0.6341539,0.24718067,0.04323894,0.004629605],"about_ca_topic_score_codex":0.0000056159065,"about_ca_topic_score_gemma":0.000016281263,"teacher_disagreement_score":0.6197398,"about_ca_system_score_codex":0.000032509615,"about_ca_system_score_gemma":0.00013455076,"threshold_uncertainty_score":0.99343157},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021964854,0.05727727,0.89196604,0.0006388783,0.010908618,0.00072537095,0.00016479718,0.000029742634,0.01632443],"genre_scores_gemma":[0.9063297,0.0010547523,0.087546624,0.0001599326,0.0012497159,0.000011187843,0.00002884153,0.00004423045,0.0035750517],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875826,0.000007094974,0.00027937934,0.0005811495,0.00019175802,0.00018238377],"domain_scores_gemma":[0.99927765,0.00002391842,0.00011669457,0.0003831281,0.0001689332,0.000029671737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014855298,0.0002072302,0.0002164655,0.00016591302,0.000082847204,0.000018317467,0.00029748023,0.00020708604,0.000009574935],"category_scores_gemma":[0.000038872102,0.0001985256,0.00009943824,0.00009608945,0.0007031987,0.000001742517,0.00033677818,0.00016388009,0.0000045650268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110598485,0.00005973808,0.0019818048,0.00050185435,0.00026998285,0.000024410825,0.0007603466,0.021603994,0.2433596,0.036123443,0.0009587746,0.69424546],"study_design_scores_gemma":[0.0007059316,0.0014998172,0.002445454,0.0010981617,0.00016606014,0.0005742944,0.0000034879602,0.014790001,0.055491786,0.75127774,0.16962835,0.0023189285],"about_ca_topic_score_codex":0.000010276046,"about_ca_topic_score_gemma":0.00002638481,"teacher_disagreement_score":0.8843648,"about_ca_system_score_codex":0.0001044289,"about_ca_system_score_gemma":0.00027058783,"threshold_uncertainty_score":0.8095639},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000038654744,0.02004475,0.97694916,0.00004043382,0.00072714983,0.00015679422,0.000082330065,0.0005649727,0.0014305494],"genre_scores_gemma":[0.014998587,0.0071884943,0.9763946,0.00020379256,0.00045757496,0.000022790186,0.00050741155,0.00009632374,0.0001304153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746054,0.000013282614,0.00043117377,0.0011849392,0.00046578678,0.00044430036],"domain_scores_gemma":[0.9978578,0.00022255135,0.000059359405,0.0017552595,0.000040503903,0.00006449098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056187477,0.0003754936,0.0004971487,0.0017324082,0.000040449635,0.00024189643,0.0030564743,0.00020036871,0.000010428602],"category_scores_gemma":[0.00009570585,0.00035236913,0.000053361222,0.0030618662,0.00032696768,0.0009344629,0.001422768,0.00093013234,0.000022192535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.0211726e-7,0.0000050187277,0.000021992102,0.00013853116,0.000013119045,0.00003947253,0.00010497858,0.39117205,0.000008460886,0.00006148337,0.00013529959,0.6082988],"study_design_scores_gemma":[0.000024423203,0.000014920221,0.000007245163,0.0005851671,0.00003608555,0.0000044794724,1.4545833e-7,0.88381207,0.00072583195,0.07815409,0.03622967,0.0004058639],"about_ca_topic_score_codex":0.0000063868406,"about_ca_topic_score_gemma":0.00049847,"teacher_disagreement_score":0.60789293,"about_ca_system_score_codex":0.00055626594,"about_ca_system_score_gemma":0.00024647315,"threshold_uncertainty_score":0.99989283},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000038654744,0.02004475,0.97694916,0.00004043382,0.00072714983,0.00015679422,0.000082330065,0.0005649727,0.0014305494],"genre_scores_gemma":[0.014998587,0.0071884943,0.9763946,0.00020379256,0.00045757496,0.000022790186,0.00050741155,0.00009632374,0.0001304153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746054,0.000013282614,0.00043117377,0.0011849392,0.00046578678,0.00044430036],"domain_scores_gemma":[0.9978578,0.00022255135,0.000059359405,0.0017552595,0.000040503903,0.00006449098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056187477,0.0003754936,0.0004971487,0.0017324082,0.000040449635,0.00024189643,0.0030564743,0.00020036871,0.000010428602],"category_scores_gemma":[0.00009570585,0.00035236913,0.000053361222,0.0030618662,0.00032696768,0.0009344629,0.001422768,0.00093013234,0.000022192535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.0211726e-7,0.0000050187277,0.000021992102,0.00013853116,0.000013119045,0.00003947253,0.00010497858,0.39117205,0.000008460886,0.00006148337,0.00013529959,0.6082988],"study_design_scores_gemma":[0.000024423203,0.000014920221,0.000007245163,0.0005851671,0.00003608555,0.0000044794724,1.4545833e-7,0.88381207,0.00072583195,0.07815409,0.03622967,0.0004058639],"about_ca_topic_score_codex":0.0000063868406,"about_ca_topic_score_gemma":0.00049847,"teacher_disagreement_score":0.60789293,"about_ca_system_score_codex":0.00055626594,"about_ca_system_score_gemma":0.00024647315,"threshold_uncertainty_score":0.99989283},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003479774,0.012039073,0.9831848,0.00047221844,0.0011648894,0.0001922685,0.000056350447,0.000094883384,0.002760698],"genre_scores_gemma":[0.0060940003,0.0011821509,0.99005216,0.0003918601,0.00072711986,0.000029499934,0.00009868113,0.00003544338,0.0013890817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667436,0.000028657254,0.0003669127,0.002087807,0.00037692316,0.00046532715],"domain_scores_gemma":[0.9970783,0.0005894914,0.00010096422,0.0020949293,0.000043193446,0.00009314406],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000932392,0.00032279172,0.00035073547,0.0006618408,0.00012784259,0.0014265502,0.005293091,0.00013839063,0.0000010452503],"category_scores_gemma":[0.00009069871,0.00028434087,0.000026082755,0.0014717354,0.00049227604,0.002913974,0.006366173,0.00056592777,0.000021784857],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.5085716e-7,0.00002044133,0.000030535946,0.00006994496,0.0000017549153,0.000030237337,0.00071100646,0.00039301676,0.000004572183,0.002610395,0.0003529917,0.9957746],"study_design_scores_gemma":[0.00010286882,0.00004045232,0.00009167772,0.0009153926,0.0000048792117,0.000043953412,6.702474e-7,0.9269667,0.00002515526,0.038729046,0.032674834,0.00040433643],"about_ca_topic_score_codex":0.000013189129,"about_ca_topic_score_gemma":0.00030981225,"teacher_disagreement_score":0.9953703,"about_ca_system_score_codex":0.00016679196,"about_ca_system_score_gemma":0.000985849,"threshold_uncertainty_score":0.9999609},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013899251,0.0016065537,0.9930889,0.0014342988,0.0014036353,0.00038368962,0.000003203792,0.0003332388,0.001732561],"genre_scores_gemma":[0.0040973327,0.00003207175,0.9919201,0.00047491858,0.0009211043,0.000061424274,0.0000048275974,0.000026371103,0.0024618343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685866,0.000021494134,0.00036108482,0.0014476805,0.0007228349,0.000588268],"domain_scores_gemma":[0.9982525,0.0001611079,0.00010418936,0.0011921247,0.00014605492,0.00014402473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003924017,0.00034150868,0.00027227114,0.00058193546,0.00023791735,0.0008744927,0.0032056984,0.0002001685,0.000008173562],"category_scores_gemma":[0.00002049082,0.00031026732,0.00010860694,0.001699394,0.00045595155,0.00035929307,0.001434599,0.00069981563,0.00022086718],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.4330345e-7,0.000029081026,0.000007712856,0.000044247703,0.0000054743427,0.0000692833,0.00035619867,0.010008736,0.000018465644,0.011748888,0.00053785916,0.9771738],"study_design_scores_gemma":[0.000054980494,0.00005666094,0.00010377638,0.00020670907,0.000005644296,0.000108441556,5.6987382e-8,0.6964088,0.000049677918,0.27300155,0.0296279,0.00037578127],"about_ca_topic_score_codex":0.0000096452595,"about_ca_topic_score_gemma":0.000020456515,"teacher_disagreement_score":0.97679806,"about_ca_system_score_codex":0.00041266077,"about_ca_system_score_gemma":0.0014333364,"threshold_uncertainty_score":0.999935},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047111057,0.0031640471,0.98843974,0.0015604335,0.0035817644,0.0004607533,0.000028811919,0.00036730577,0.0019260196],"genre_scores_gemma":[0.57468605,0.0006120179,0.41366813,0.0058142827,0.004528189,0.000059230068,0.0001906427,0.00013664148,0.00030484132],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996041,0.00004473038,0.00046367224,0.0017905779,0.001021754,0.0006382948],"domain_scores_gemma":[0.99693257,0.0006327791,0.00019225644,0.0020073745,0.00009398197,0.00014105826],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00090681616,0.00053381175,0.00040364434,0.0003816931,0.00040238307,0.0020709492,0.0047428007,0.00031407014,0.00002829052],"category_scores_gemma":[0.00003503563,0.0003771665,0.0002518381,0.0008129892,0.00073297584,0.0007791173,0.0021175737,0.0014976693,0.00014268301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037279394,0.000031262665,0.00012702115,0.000031707845,0.000026027068,0.000060400605,0.0016338985,0.0006918153,0.000063559266,0.17221425,0.00006564777,0.8250507],"study_design_scores_gemma":[0.0001625187,0.000095479096,0.00048307155,0.0006917128,0.000022596716,0.000028666234,3.7173646e-7,0.16966905,0.000119612574,0.8111022,0.017012738,0.00061199],"about_ca_topic_score_codex":0.00015561319,"about_ca_topic_score_gemma":0.0009541405,"teacher_disagreement_score":0.8244387,"about_ca_system_score_codex":0.00014416594,"about_ca_system_score_gemma":0.00022030777,"threshold_uncertainty_score":0.99986804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013737714,0.003472052,0.98561174,0.0009160676,0.004107165,0.00028890168,0.00008361628,0.00042102556,0.0049620545],"genre_scores_gemma":[0.28419697,0.00028364145,0.7084962,0.0038277672,0.0023960688,0.000023943248,0.00010986874,0.00013419108,0.00053134054],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99473345,0.00004302463,0.00063968165,0.002575171,0.0010810422,0.00092762196],"domain_scores_gemma":[0.9963744,0.00078129536,0.00022247687,0.0021473519,0.00017147018,0.00030295036],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010697471,0.00073886255,0.0006576607,0.0009154767,0.00035438,0.002370829,0.0050408267,0.0005363194,0.0001255979],"category_scores_gemma":[0.000053934917,0.000675128,0.0002668265,0.0010718451,0.0009496972,0.0017023816,0.002729372,0.0018590154,0.00031503747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013469831,0.000060216214,0.00003365222,0.000092115886,0.00004546146,0.000739097,0.0014981448,0.008452555,0.00034945726,0.3047323,0.0003860315,0.6835975],"study_design_scores_gemma":[0.00018100446,0.000090515205,0.00005430189,0.00059843215,0.000016834032,0.00004210341,6.2619176e-7,0.27550298,0.00077486044,0.70265174,0.019285748,0.00080083805],"about_ca_topic_score_codex":0.0002545722,"about_ca_topic_score_gemma":0.0005502298,"teacher_disagreement_score":0.68279666,"about_ca_system_score_codex":0.00026121232,"about_ca_system_score_gemma":0.0006369821,"threshold_uncertainty_score":0.99957},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005873388,0.014137846,0.31806245,0.023616128,0.006609819,0.0011892786,0.000064878404,0.00025205943,0.6354802],"genre_scores_gemma":[0.93446016,0.0035455637,0.051048387,0.0026178968,0.0032759865,0.0000292345,0.00001665989,0.000056500718,0.004949579],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811494,0.00012062418,0.00024012319,0.000532893,0.00069008506,0.0003013584],"domain_scores_gemma":[0.9972892,0.0019866966,0.00013261937,0.00024050332,0.00027438632,0.0000766119],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017795519,0.00016854663,0.00027118466,0.0002876577,0.00046559816,0.0002426036,0.00048370857,0.00018320329,0.000022368285],"category_scores_gemma":[0.0015153944,0.00016227983,0.000057343274,0.0007525106,0.0030527664,0.00037250126,0.00045437858,0.0004914288,0.000012987536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018868212,0.00011534388,0.00009049091,0.00034355724,0.00008188386,0.00006856167,0.39692685,0.00028106465,0.000010306658,0.21943387,0.0024939384,0.38013524],"study_design_scores_gemma":[0.000105492734,0.00007427834,0.00004041073,0.0005185907,0.00006440226,0.000015889838,0.00014633508,0.0012094826,0.000020329526,0.7160271,0.2813911,0.00038659165],"about_ca_topic_score_codex":0.00068549183,"about_ca_topic_score_gemma":0.0060900827,"teacher_disagreement_score":0.9338729,"about_ca_system_score_codex":0.00024149407,"about_ca_system_score_gemma":0.0014020517,"threshold_uncertainty_score":0.9996604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005714651,0.0014231718,0.9960841,0.000043074502,0.0009490379,0.00051314436,0.000004618265,0.00022003683,0.00019134986],"genre_scores_gemma":[0.6160636,0.00014860426,0.38341108,0.00003877209,0.00016142981,0.000028143038,0.0000026188939,0.000027014918,0.00011872495],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975401,0.000027136364,0.0006013308,0.0009917461,0.0005917034,0.00024798364],"domain_scores_gemma":[0.9984051,0.00014384143,0.0004077669,0.0007051723,0.00027747225,0.00006066204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005080899,0.0003236193,0.00041674898,0.0009850423,0.0001033296,0.00016421087,0.0007946258,0.00027627771,0.0000066741773],"category_scores_gemma":[0.00004536965,0.00032150015,0.00011113556,0.0006570191,0.00039063604,0.0008493837,0.0005778903,0.0004416087,0.0000021366181],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044697495,0.000011458719,0.0000030189258,0.0001772142,0.000008610891,0.0000061458286,0.00040670685,0.008331883,0.02693558,0.005601162,0.0000010280295,0.9585127],"study_design_scores_gemma":[0.00013857253,0.0006382622,0.000019030673,0.0007914237,0.000017728145,0.000059145274,6.2374636e-7,0.35481367,0.38521108,0.25736606,0.0005424454,0.000401986],"about_ca_topic_score_codex":0.000014886854,"about_ca_topic_score_gemma":0.00006832812,"teacher_disagreement_score":0.95811075,"about_ca_system_score_codex":0.00017542198,"about_ca_system_score_gemma":0.0001537773,"threshold_uncertainty_score":0.9999237},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0117825,0.00019219823,0.9842311,0.0001569674,0.0023226095,0.00068030553,0.00006060101,0.0003041757,0.0002695522],"genre_scores_gemma":[0.7208622,0.0000034984002,0.27880386,0.00017346918,0.00008156164,0.000016531478,0.000032563516,0.000016779462,0.000009536033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965314,0.000023541303,0.0011559507,0.0009024693,0.0010352898,0.00035134543],"domain_scores_gemma":[0.9967403,0.00046750024,0.0011663724,0.0011767739,0.00031659298,0.00013246642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079088856,0.00039120036,0.0006226711,0.0010710951,0.00011107071,0.00021198293,0.0013834327,0.000494332,0.000022660282],"category_scores_gemma":[0.000069334405,0.00037190758,0.0002477299,0.0007173799,0.00047771086,0.0005282801,0.00051473826,0.0007006653,0.000004942257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022843595,0.0017521642,0.0025995362,0.0024888085,0.0002527166,0.0007131805,0.04911114,0.06891692,0.0015697731,0.45518953,0.00039423167,0.41678357],"study_design_scores_gemma":[0.00022780205,0.00020755886,0.00043845133,0.00087564305,0.000033351724,0.000024409159,0.0000010482154,0.68630314,0.011846817,0.29920846,0.00041673,0.0004165926],"about_ca_topic_score_codex":0.00018842332,"about_ca_topic_score_gemma":0.000090186346,"teacher_disagreement_score":0.70907974,"about_ca_system_score_codex":0.00023722863,"about_ca_system_score_gemma":0.00066092296,"threshold_uncertainty_score":0.9998733},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085203286,0.001122657,0.9895962,0.00029904788,0.004534111,0.00038415595,0.0000027601095,0.001000392,0.002208672],"genre_scores_gemma":[0.7595109,0.00024959655,0.23772384,0.00077936635,0.0010429607,0.000014793157,0.000012236537,0.000080099046,0.00058625784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591064,0.000040279563,0.0006667023,0.001827267,0.0009924177,0.0005626732],"domain_scores_gemma":[0.99772644,0.00018999964,0.00027698046,0.0013390866,0.0002951492,0.00017234178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055840175,0.0005571702,0.0004423877,0.0011573221,0.00038549321,0.0010079102,0.0023933651,0.000525528,0.00003202534],"category_scores_gemma":[0.00002925859,0.00050280214,0.00015631891,0.0013409556,0.00057229697,0.0009956803,0.0012976325,0.0011300028,0.00021645462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101612395,0.00006755473,0.000050186503,0.00009446418,0.00002733448,0.00023330934,0.0022514726,0.07281417,0.0009704344,0.15233769,0.0000713657,0.77107185],"study_design_scores_gemma":[0.0000434328,0.000088623456,0.00006549962,0.0005132083,0.000014385211,0.00008591109,2.6308172e-7,0.8334862,0.0019323385,0.16232987,0.00095381914,0.0004864629],"about_ca_topic_score_codex":0.00003609725,"about_ca_topic_score_gemma":0.00010335193,"teacher_disagreement_score":0.7705854,"about_ca_system_score_codex":0.0005952708,"about_ca_system_score_gemma":0.00039744005,"threshold_uncertainty_score":0.9997424},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016389271,0.001561778,0.990208,0.00018257652,0.001385532,0.0014430572,0.00002404049,0.0006719166,0.0028841684],"genre_scores_gemma":[0.8571338,0.000017302491,0.14060593,0.0004104978,0.00037879415,0.00006165356,0.0000065031604,0.00008404687,0.0013014746],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938034,0.00008232958,0.000634577,0.0025910728,0.0017536477,0.0011349701],"domain_scores_gemma":[0.99541324,0.0016310498,0.00016657953,0.0022914289,0.0002762077,0.00022146782],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0021153449,0.00074840576,0.0009199283,0.00074499147,0.00034018207,0.002280565,0.008502186,0.00027528752,0.000025681868],"category_scores_gemma":[0.00017164987,0.0006859888,0.00013574396,0.0013672834,0.00034948363,0.0016084235,0.009586319,0.0020435886,0.00015846654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060007762,0.001021471,0.00019799684,0.0005797301,0.00033328257,0.0029619674,0.42264736,0.36806706,0.00030984022,0.14211576,0.00037396478,0.061331563],"study_design_scores_gemma":[0.00053491484,0.00038217526,0.000025095575,0.0007406449,0.000015310705,0.00006812861,0.000024186167,0.87037164,0.0011839506,0.12408588,0.0015822999,0.0009857947],"about_ca_topic_score_codex":0.00017799422,"about_ca_topic_score_gemma":0.00096028333,"teacher_disagreement_score":0.85549486,"about_ca_system_score_codex":0.0005923911,"about_ca_system_score_gemma":0.00065114466,"threshold_uncertainty_score":0.9995591},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000095453106,0.0007350021,0.97428894,0.0002846279,0.011522997,0.000295529,0.0000033113442,0.0009019398,0.011872197],"genre_scores_gemma":[0.9348924,0.000029365614,0.061614394,0.0003570458,0.0017139674,0.00001724508,0.000002043785,0.00006160899,0.0013119321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963211,0.000026056754,0.0004518998,0.0016694122,0.000986302,0.0005452399],"domain_scores_gemma":[0.9980102,0.00020849479,0.00018474956,0.0012698689,0.00016842171,0.00015824987],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009289298,0.0004879894,0.0004056752,0.0011951824,0.00029841723,0.001284482,0.0023264387,0.00042088778,0.0000067480014],"category_scores_gemma":[0.000033651726,0.00044455568,0.00017273641,0.0010030839,0.00029311824,0.0006590633,0.0009326347,0.0010304753,0.00039507504],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055437054,0.000010709369,0.0000068680665,0.00021193501,0.00001890347,0.0001789221,0.00046410997,0.00983458,0.0014828708,0.04239737,0.000024377403,0.9453638],"study_design_scores_gemma":[0.00014319764,0.00018620178,0.000018127053,0.00091526407,0.000015812644,0.00038172855,2.0941287e-7,0.903119,0.006703721,0.08265898,0.005208024,0.00064973225],"about_ca_topic_score_codex":0.0000392638,"about_ca_topic_score_gemma":0.00016123713,"teacher_disagreement_score":0.94471407,"about_ca_system_score_codex":0.000765791,"about_ca_system_score_gemma":0.00034162914,"threshold_uncertainty_score":0.9998006},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003479774,0.012039073,0.9831848,0.00047221844,0.0011648894,0.0001922685,0.000056350447,0.000094883384,0.002760698],"genre_scores_gemma":[0.0060940003,0.0011821509,0.99005216,0.0003918601,0.00072711986,0.000029499934,0.00009868113,0.00003544338,0.0013890817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667436,0.000028657254,0.0003669127,0.002087807,0.00037692316,0.00046532715],"domain_scores_gemma":[0.9970783,0.0005894914,0.00010096422,0.0020949293,0.000043193446,0.00009314406],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000932392,0.00032279172,0.00035073547,0.0006618408,0.00012784259,0.0014265502,0.005293091,0.00013839063,0.0000010452503],"category_scores_gemma":[0.00009069871,0.00028434087,0.000026082755,0.0014717354,0.00049227604,0.002913974,0.006366173,0.00056592777,0.000021784857],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.5085716e-7,0.00002044133,0.000030535946,0.00006994496,0.0000017549153,0.000030237337,0.00071100646,0.00039301676,0.000004572183,0.002610395,0.0003529917,0.9957746],"study_design_scores_gemma":[0.00010286882,0.00004045232,0.00009167772,0.0009153926,0.0000048792117,0.000043953412,6.702474e-7,0.9269667,0.00002515526,0.038729046,0.032674834,0.00040433643],"about_ca_topic_score_codex":0.000013189129,"about_ca_topic_score_gemma":0.00030981225,"teacher_disagreement_score":0.9953703,"about_ca_system_score_codex":0.00016679196,"about_ca_system_score_gemma":0.000985849,"threshold_uncertainty_score":0.9999609},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002738017,0.001482929,0.9900442,0.0003238353,0.004974755,0.0006493491,0.0000015435005,0.00030276392,0.0019468506],"genre_scores_gemma":[0.5957337,0.000099169345,0.39972827,0.0023673282,0.0013729731,0.000035792622,0.0000069612056,0.0001049961,0.00055081554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951936,0.00004193976,0.00058874645,0.0022367649,0.0008290323,0.0011099187],"domain_scores_gemma":[0.9978498,0.00030797496,0.0001599149,0.0013115695,0.00014453965,0.00022620284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006543478,0.00066113786,0.0006103466,0.0014539461,0.00020286124,0.00060886284,0.0029028892,0.00035441265,0.0000032132698],"category_scores_gemma":[0.000044066866,0.0006073964,0.00014307446,0.004338905,0.00034517024,0.00064438075,0.0016743521,0.001485064,0.000046937585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008060134,0.000013710379,0.000030271132,0.000037151312,0.000005604968,0.00007910959,0.00018894096,0.76495284,0.00006170743,0.011306364,0.000025027544,0.22329119],"study_design_scores_gemma":[0.00009178653,0.00015121998,0.00010124682,0.00032905716,0.000005960627,0.000093330804,1.0826242e-7,0.7315737,0.00014358165,0.2662946,0.00064896944,0.0005664332],"about_ca_topic_score_codex":0.00003171754,"about_ca_topic_score_gemma":0.00040090707,"teacher_disagreement_score":0.5954599,"about_ca_system_score_codex":0.00025120017,"about_ca_system_score_gemma":0.00013938872,"threshold_uncertainty_score":0.9996377},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009416672,0.0014204747,0.96842283,0.013688763,0.0013976243,0.0015596537,0.00012247497,0.000058044472,0.0039134556],"genre_scores_gemma":[0.94110936,0.00064335513,0.04853477,0.0025593268,0.0004879239,0.000091851674,0.000026443613,0.000032511864,0.006514464],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958366,0.000033817018,0.00070118293,0.0026534186,0.00049543014,0.00027954503],"domain_scores_gemma":[0.99644035,0.0013816879,0.0001762374,0.0017235597,0.00019572461,0.00008242594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008950124,0.00022648668,0.00036276254,0.00062633515,0.00017895584,0.00067468523,0.0010162641,0.00014331254,0.000011612045],"category_scores_gemma":[0.0016957511,0.00017958898,0.000043324257,0.0005233794,0.0004194511,0.0005282181,0.0011417377,0.00036144062,0.000019445053],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012541578,0.000014234667,0.0009805091,0.00011919058,0.0000039085376,0.0000022190852,0.00052173383,0.00058807945,0.000028315608,0.050527994,0.00012269255,0.9470786],"study_design_scores_gemma":[0.00018006768,0.00017026383,0.013582823,0.00023887049,0.000010483732,0.0000098529445,0.0000014411338,0.15819483,0.00012449543,0.7849451,0.042188007,0.0003538075],"about_ca_topic_score_codex":0.000009753757,"about_ca_topic_score_gemma":0.00045660997,"teacher_disagreement_score":0.9467248,"about_ca_system_score_codex":0.0000896132,"about_ca_system_score_gemma":0.00013646422,"threshold_uncertainty_score":0.73234266},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003479774,0.012039073,0.9831848,0.00047221844,0.0011648894,0.0001922685,0.000056350447,0.000094883384,0.002760698],"genre_scores_gemma":[0.0060940003,0.0011821509,0.99005216,0.0003918601,0.00072711986,0.000029499934,0.00009868113,0.00003544338,0.0013890817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667436,0.000028657254,0.0003669127,0.002087807,0.00037692316,0.00046532715],"domain_scores_gemma":[0.9970783,0.0005894914,0.00010096422,0.0020949293,0.000043193446,0.00009314406],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000932392,0.00032279172,0.00035073547,0.0006618408,0.00012784259,0.0014265502,0.005293091,0.00013839063,0.0000010452503],"category_scores_gemma":[0.00009069871,0.00028434087,0.000026082755,0.0014717354,0.00049227604,0.002913974,0.006366173,0.00056592777,0.000021784857],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.5085716e-7,0.00002044133,0.000030535946,0.00006994496,0.0000017549153,0.000030237337,0.00071100646,0.00039301676,0.000004572183,0.002610395,0.0003529917,0.9957746],"study_design_scores_gemma":[0.00010286882,0.00004045232,0.00009167772,0.0009153926,0.0000048792117,0.000043953412,6.702474e-7,0.9269667,0.00002515526,0.038729046,0.032674834,0.00040433643],"about_ca_topic_score_codex":0.000013189129,"about_ca_topic_score_gemma":0.00030981225,"teacher_disagreement_score":0.9953703,"about_ca_system_score_codex":0.00016679196,"about_ca_system_score_gemma":0.000985849,"threshold_uncertainty_score":0.9999609},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017315574,0.00037602216,0.9947332,0.00065856334,0.00050836586,0.00040506752,0.0000072850353,0.00023254898,0.002905796],"genre_scores_gemma":[0.116417676,0.000044215936,0.83658063,0.00025621013,0.00077125075,0.00004997257,0.00007115134,0.0001607777,0.045648098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996308,0.000020471398,0.0005278246,0.0017620288,0.00072403887,0.00065762457],"domain_scores_gemma":[0.9979265,0.00047294007,0.00041288108,0.00083613175,0.00024867244,0.00010288523],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007033172,0.0005267094,0.0005965639,0.00066126155,0.00045548344,0.0019059221,0.0015082925,0.00019300931,0.000010519614],"category_scores_gemma":[0.000116383904,0.00042532128,0.00021623533,0.0008462589,0.0004670332,0.0019274479,0.0009669546,0.00067664945,0.0000274396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000629978,0.000019633455,0.00007589479,0.00023825228,0.00012047678,0.00020984486,0.0019071901,0.35424575,0.00039797788,0.035898432,0.00002658873,0.606797],"study_design_scores_gemma":[0.000142308,0.00035395037,0.0000138351315,0.0007252908,0.000037237663,0.00016995701,0.0000012782252,0.92470556,0.0002934052,0.07225269,0.00076175807,0.0005427149],"about_ca_topic_score_codex":0.00001986856,"about_ca_topic_score_gemma":0.000088535235,"teacher_disagreement_score":0.6062543,"about_ca_system_score_codex":0.00025265446,"about_ca_system_score_gemma":0.00028445933,"threshold_uncertainty_score":0.9998199},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000462196,0.0012819901,0.99117315,0.0010900995,0.00042715285,0.00027134005,0.000006918747,0.0002189208,0.0050682593],"genre_scores_gemma":[0.16742249,0.000107289714,0.82856303,0.0003090764,0.00037828877,0.000010391746,0.0000060941848,0.00008075651,0.0031225972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588656,0.000014397557,0.00057700585,0.0019421712,0.0008214965,0.00075835176],"domain_scores_gemma":[0.9981005,0.00013577905,0.0002980431,0.0010073317,0.00024267394,0.00021564015],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00063188415,0.0006594047,0.0006778512,0.00070739386,0.00043262614,0.0014937773,0.0015719011,0.00024230736,0.000009377873],"category_scores_gemma":[0.000041419516,0.0005097429,0.00013342788,0.0008389705,0.00076135783,0.0010517753,0.001705545,0.00084800116,0.00000972168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001819311,0.000015280311,0.000016488559,0.0001566079,0.00005972863,0.0002813034,0.0021091949,0.58996797,0.0001232788,0.059796568,0.000016861553,0.34743854],"study_design_scores_gemma":[0.00011691434,0.00022303891,0.000006662199,0.0010239701,0.000033282795,0.00041484946,7.418176e-7,0.9144502,0.000222477,0.08264558,0.00025457036,0.0006076602],"about_ca_topic_score_codex":0.00003600674,"about_ca_topic_score_gemma":0.00020535795,"teacher_disagreement_score":0.34683087,"about_ca_system_score_codex":0.00018153727,"about_ca_system_score_gemma":0.00041128372,"threshold_uncertainty_score":0.9997354},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012800997,0.00023031927,0.9563195,0.00035940524,0.002416807,0.0005990548,0.000002622023,0.00017254677,0.038619604],"genre_scores_gemma":[0.9002198,0.00015130674,0.07457643,0.002022692,0.0037573029,0.000018854445,0.00001686169,0.00008776741,0.019149002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974432,0.00003658665,0.0004070049,0.0005629593,0.0009928358,0.0005574116],"domain_scores_gemma":[0.9985069,0.00056653854,0.00022919,0.00024395011,0.00028822056,0.00016518067],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024384416,0.00025394664,0.00024956733,0.0004914232,0.0011479405,0.001232969,0.0005963999,0.0003157633,0.00011094402],"category_scores_gemma":[0.0012452422,0.00023685288,0.00013300349,0.00041267154,0.0006555894,0.00058173336,0.00016288822,0.00063956063,0.000089537956],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075565563,0.000003088575,0.000011845758,0.000045932662,0.0000054773877,0.0000018911296,0.01669036,0.049361266,0.000058585003,0.0067164516,0.0000050272574,0.9270925],"study_design_scores_gemma":[0.00041346153,0.00035009312,0.00011583155,0.0004988949,0.000026492222,0.000011320776,0.000046785084,0.7738305,0.00050768227,0.16980048,0.053672466,0.00072603335],"about_ca_topic_score_codex":0.000115657436,"about_ca_topic_score_gemma":0.0022861778,"teacher_disagreement_score":0.9263665,"about_ca_system_score_codex":0.0005121405,"about_ca_system_score_gemma":0.00050801167,"threshold_uncertainty_score":0.99980384},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010663147,0.0010805335,0.98159367,0.0011521697,0.00431323,0.00073572015,0.000008853285,0.0006555941,0.010353588],"genre_scores_gemma":[0.19954015,0.000040469655,0.7910065,0.0033441505,0.0015153396,0.00005293096,0.000010832695,0.00013549434,0.0043541095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947945,0.000041672487,0.0004772461,0.0026107065,0.0011940099,0.00088186393],"domain_scores_gemma":[0.99708706,0.00030998245,0.00016727034,0.0018529108,0.00022917995,0.00035357007],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009451715,0.0007896229,0.0006512527,0.0016356361,0.000270227,0.0014832546,0.0040845443,0.00064532034,0.000007754676],"category_scores_gemma":[0.000121514735,0.00070022844,0.00023413092,0.0017152849,0.00032986156,0.0004793708,0.0018447383,0.0017678621,0.00034319353],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016827533,0.000031070816,0.000008438414,0.00014342304,0.000038888174,0.00013627997,0.0038130095,0.036352977,0.0006923356,0.008974525,0.00033194333,0.94946027],"study_design_scores_gemma":[0.00032369097,0.0005640629,0.00010431942,0.001009645,0.00003544966,0.0004632437,6.8698563e-7,0.78489655,0.0066784234,0.17396124,0.030026127,0.0019365666],"about_ca_topic_score_codex":0.000060784674,"about_ca_topic_score_gemma":0.000071906696,"teacher_disagreement_score":0.9475237,"about_ca_system_score_codex":0.00052753557,"about_ca_system_score_gemma":0.0003068225,"threshold_uncertainty_score":0.9995533},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000096653726,0.0023869511,0.9940825,0.0011304754,0.00031907475,0.0002151931,0.000010861938,0.00039342634,0.0013648514],"genre_scores_gemma":[0.47334903,0.00088941236,0.52504057,0.00020826113,0.00010610296,0.000014814135,0.0000022630168,0.000040377476,0.0003491807],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967315,0.000024699699,0.0004489465,0.0017308099,0.00068279955,0.00038120008],"domain_scores_gemma":[0.99771214,0.0003982906,0.0002666142,0.0012163362,0.00028998707,0.000116662435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005706756,0.00042625878,0.00071513123,0.004436416,0.00014047271,0.00031650823,0.0016867942,0.0002603168,0.000011403931],"category_scores_gemma":[0.000085280284,0.00039491314,0.00026568535,0.0033267615,0.0012579258,0.00048280656,0.0012495707,0.00072368013,0.0000039197103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049456467,0.000023996618,0.000046607685,0.00006637402,0.00022505484,0.00004420141,0.0026951677,0.010257616,0.00039333836,0.30581787,0.0000023718858,0.6804224],"study_design_scores_gemma":[0.000100397796,0.00024741064,0.00041062306,0.00033051966,0.00019129754,0.000029217192,0.0000030542708,0.26570675,0.002332972,0.7290993,0.0008619102,0.00068657787],"about_ca_topic_score_codex":0.000024523046,"about_ca_topic_score_gemma":0.000101815735,"teacher_disagreement_score":0.6797359,"about_ca_system_score_codex":0.00014835423,"about_ca_system_score_gemma":0.00017707392,"threshold_uncertainty_score":0.9998503},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012904007,0.0005407868,0.9869766,0.0008831344,0.0020016897,0.0006517409,0.0000052864852,0.0080959555,0.0007157666],"genre_scores_gemma":[0.05183544,0.000016689317,0.9455695,0.00093822915,0.0009804432,0.000032037904,0.00001437844,0.00006506638,0.00054818945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620676,0.000022680939,0.0006313454,0.0018207623,0.0006155759,0.0007028879],"domain_scores_gemma":[0.99729,0.0009779166,0.00022569206,0.0011754793,0.0001903842,0.00014051925],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011866798,0.0005429607,0.00052750256,0.0011416958,0.00019903191,0.0011125817,0.0023303425,0.00042545478,0.000005128664],"category_scores_gemma":[0.0005324347,0.0005091445,0.00012426812,0.0009610297,0.00017074701,0.00062087196,0.0009865974,0.0006895943,0.00003172884],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057275465,0.000040937288,0.00039473485,0.0001551121,0.00001714057,0.00015273316,0.0012088751,0.041356087,0.0004046223,0.015087787,0.0035891952,0.937587],"study_design_scores_gemma":[0.00014648952,0.00009507595,0.00009293497,0.0007137647,0.000006337506,0.000047948433,1.4003032e-8,0.72625667,0.0003509415,0.27145085,0.0004172657,0.00042170344],"about_ca_topic_score_codex":0.000144574,"about_ca_topic_score_gemma":0.0001700217,"teacher_disagreement_score":0.9371653,"about_ca_system_score_codex":0.00035791306,"about_ca_system_score_gemma":0.0008347357,"threshold_uncertainty_score":0.99992436},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005873388,0.014137846,0.31806245,0.023616128,0.006609819,0.0011892786,0.000064878404,0.00025205943,0.6354802],"genre_scores_gemma":[0.93446016,0.0035455637,0.051048387,0.0026178968,0.0032759865,0.0000292345,0.00001665989,0.000056500718,0.004949579],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811494,0.00012062418,0.00024012319,0.000532893,0.00069008506,0.0003013584],"domain_scores_gemma":[0.9972892,0.0019866966,0.00013261937,0.00024050332,0.00027438632,0.0000766119],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017795519,0.00016854663,0.00027118466,0.0002876577,0.00046559816,0.0002426036,0.00048370857,0.00018320329,0.000022368285],"category_scores_gemma":[0.0015153944,0.00016227983,0.000057343274,0.0007525106,0.0030527664,0.00037250126,0.00045437858,0.0004914288,0.000012987536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018868212,0.00011534388,0.00009049091,0.00034355724,0.00008188386,0.00006856167,0.39692685,0.00028106465,0.000010306658,0.21943387,0.0024939384,0.38013524],"study_design_scores_gemma":[0.000105492734,0.00007427834,0.00004041073,0.0005185907,0.00006440226,0.000015889838,0.00014633508,0.0012094826,0.000020329526,0.7160271,0.2813911,0.00038659165],"about_ca_topic_score_codex":0.00068549183,"about_ca_topic_score_gemma":0.0060900827,"teacher_disagreement_score":0.9338729,"about_ca_system_score_codex":0.00024149407,"about_ca_system_score_gemma":0.0014020517,"threshold_uncertainty_score":0.9996604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021950816,0.0016694178,0.9892824,0.0004455853,0.0043014027,0.0003150988,0.000011289405,0.0003459647,0.00340929],"genre_scores_gemma":[0.7115951,0.0012309332,0.28105867,0.002015008,0.0022447316,0.000029698944,0.000023211669,0.00015553868,0.0016471047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645764,0.00003441719,0.0006426167,0.0014065063,0.0009368342,0.000521995],"domain_scores_gemma":[0.998103,0.00021435776,0.00025977823,0.0010695776,0.00020566315,0.0001475886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066411094,0.00048291835,0.00054576545,0.0008247945,0.0002428193,0.00045770762,0.0019988539,0.00042106886,0.000041603467],"category_scores_gemma":[0.000034469056,0.00045836138,0.00017743726,0.0009881376,0.00053232873,0.00069218484,0.0013985627,0.0010196151,0.000065430424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017407403,0.00004412357,0.000010202786,0.00019282164,0.000028099676,0.00004584932,0.0014801756,0.030755445,0.0018993372,0.012623051,0.00023150125,0.952672],"study_design_scores_gemma":[0.0001940234,0.0002796536,0.000013281655,0.00063772855,0.000011360639,0.000063480744,3.5643797e-7,0.92605215,0.0051569585,0.062584266,0.004495065,0.00051165844],"about_ca_topic_score_codex":0.000043665514,"about_ca_topic_score_gemma":0.0002130657,"teacher_disagreement_score":0.9521603,"about_ca_system_score_codex":0.0002987653,"about_ca_system_score_gemma":0.00016962233,"threshold_uncertainty_score":0.9997868},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024284947,0.0022318873,0.9861047,0.00047836723,0.005910324,0.00055815117,0.000021928212,0.0005567272,0.004113592],"genre_scores_gemma":[0.08417285,0.00032873542,0.89688426,0.002404746,0.004333538,0.00003667154,0.00027515728,0.00022228579,0.0113417255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942895,0.00008455363,0.00078645133,0.0027722965,0.0013431406,0.00072405353],"domain_scores_gemma":[0.9946461,0.0009823156,0.00040420436,0.0035119895,0.00025439195,0.00020103824],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025763323,0.00060758373,0.00057893654,0.0008234403,0.0005399087,0.0019660532,0.007582592,0.00042949052,0.000023781999],"category_scores_gemma":[0.00012770269,0.0005956208,0.00010464987,0.000767694,0.00045827116,0.0009653481,0.0060183643,0.0010104666,0.0010575501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001425969,0.000041645097,0.000017826707,0.00029088874,0.000064030784,0.0003529497,0.0019969656,0.5694364,0.00080043054,0.032729093,0.0019948734,0.39226067],"study_design_scores_gemma":[0.00011689737,0.00006101489,0.0000061228657,0.0009951191,0.0000132239875,0.00014460413,1.888603e-7,0.97490776,0.00020923918,0.010764141,0.012134372,0.0006473232],"about_ca_topic_score_codex":0.000011463089,"about_ca_topic_score_gemma":0.0000056962454,"teacher_disagreement_score":0.40547138,"about_ca_system_score_codex":0.00073173374,"about_ca_system_score_gemma":0.00053366186,"threshold_uncertainty_score":0.9997202},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062543777,0.0022575741,0.9929669,0.0010107429,0.001419924,0.00056376756,0.0000022267243,0.0004765417,0.00067691674],"genre_scores_gemma":[0.77257097,0.00015441039,0.22582445,0.00078013336,0.00026930872,0.00006334165,0.0000029912792,0.000052321397,0.00028207307],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967771,0.000044803153,0.0005510084,0.0013911044,0.0007598462,0.00047609874],"domain_scores_gemma":[0.99815714,0.0005669783,0.00024859534,0.0008470196,0.000108432185,0.000071811985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012579822,0.00042457043,0.00036073395,0.0010535221,0.0003183466,0.00093221554,0.0017320234,0.0002817565,0.0000030159943],"category_scores_gemma":[0.00013910327,0.00035722734,0.000113603586,0.0009106845,0.0002959266,0.0010828618,0.0009311854,0.001113734,0.0000068179625],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034270838,0.000011943011,0.000036046993,0.00009502242,0.0000118667695,0.00010083854,0.0039045054,0.016455729,0.0017805594,0.038008034,0.000011656709,0.9395804],"study_design_scores_gemma":[0.0001995003,0.00009859246,0.00026628067,0.001513205,0.000017311426,0.00008753374,0.0000054690972,0.37350407,0.010544665,0.6116743,0.001276619,0.00081246014],"about_ca_topic_score_codex":0.000039396065,"about_ca_topic_score_gemma":0.0003492895,"teacher_disagreement_score":0.9387679,"about_ca_system_score_codex":0.00038516306,"about_ca_system_score_gemma":0.00015813163,"threshold_uncertainty_score":0.99988794},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000088814086,0.0021112408,0.9905349,0.0012382399,0.0023276731,0.00051215413,0.000033389962,0.00033616522,0.0028174354],"genre_scores_gemma":[0.10888901,0.00031811316,0.8829972,0.0028314264,0.0005475196,0.00005369449,0.00004070635,0.00012832122,0.0041939984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688864,0.000021196765,0.00038790578,0.0016700734,0.00043904132,0.00059317343],"domain_scores_gemma":[0.9980283,0.000618262,0.0001325604,0.0009620957,0.00006767058,0.00019114734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057169737,0.0005166046,0.00045148784,0.0011331345,0.00026401514,0.0010243569,0.0024487837,0.00028794605,0.000012237849],"category_scores_gemma":[0.00002444026,0.00044938456,0.0001778069,0.0007989952,0.00079678034,0.0008791817,0.0013999145,0.00064477953,0.000013988715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007707535,0.00001454713,0.00000802563,0.00013416292,0.000021236245,0.00008559502,0.0005008521,0.00095060805,0.000050073937,0.5827654,0.000043996937,0.41541776],"study_design_scores_gemma":[0.00013059139,0.00014113546,0.00002324687,0.00029823472,0.000009692323,0.00005625239,1.5837593e-7,0.29245704,0.00015669364,0.7042388,0.0020821062,0.0004060523],"about_ca_topic_score_codex":0.0000017644306,"about_ca_topic_score_gemma":0.000010225751,"teacher_disagreement_score":0.41501173,"about_ca_system_score_codex":0.000047168378,"about_ca_system_score_gemma":0.0002612407,"threshold_uncertainty_score":0.9997958},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000041680023,0.00025462452,0.95873755,0.00014611785,0.0006404366,0.00024487294,0.00002149811,0.00007700691,0.03987373],"genre_scores_gemma":[0.47948682,0.000037082213,0.4859733,0.0019884247,0.017980581,0.00010345629,0.00022485148,0.00020202351,0.014003473],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987125,0.0000055955893,0.00021949137,0.0005542855,0.00020728422,0.00030088492],"domain_scores_gemma":[0.99919206,0.00019138677,0.00008367752,0.00039850074,0.00008682797,0.0000475663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033357463,0.00023135194,0.0002904117,0.0001386187,0.00009799887,0.00015354964,0.0005177406,0.000102287486,0.00020897236],"category_scores_gemma":[0.0000031584511,0.00021207913,0.0001664197,0.00019119072,0.00017938894,0.00004681047,0.0002629441,0.00040735624,0.000041632753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043002965,0.000014263834,0.00020720904,0.000034921286,0.00005659954,0.0000049638356,0.000050334256,0.0215317,0.0000036794609,0.47490305,0.0062111462,0.49697784],"study_design_scores_gemma":[0.0000287604,0.000021098973,0.0000057771713,0.00013841061,0.000021349902,5.74662e-7,1.6532763e-8,0.14663827,0.00003862618,0.75755125,0.095353626,0.00020225032],"about_ca_topic_score_codex":0.000009927889,"about_ca_topic_score_gemma":0.000019556624,"teacher_disagreement_score":0.49677557,"about_ca_system_score_codex":0.000070487324,"about_ca_system_score_gemma":0.00013452297,"threshold_uncertainty_score":0.8648336},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018554362,0.00014757398,0.9781971,0.0000782157,0.0002351014,0.00025431687,0.000032370695,0.00011445553,0.0023865323],"genre_scores_gemma":[0.9666308,9.968422e-7,0.032749433,0.0000632684,0.0003052048,0.000005294476,0.00015330946,0.000029698347,0.000061950785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971677,0.000045590794,0.00068845815,0.001068587,0.00067390664,0.0003557432],"domain_scores_gemma":[0.99828875,0.0002616358,0.0003340762,0.0006783722,0.00031173512,0.00012540119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047892006,0.00041956644,0.00086671195,0.0015878519,0.00011136189,0.00016473576,0.00078726857,0.000132244,0.00014176228],"category_scores_gemma":[0.0000058506484,0.00038404015,0.00040272847,0.0018023447,0.0005384967,0.000062181054,0.0004437386,0.0005321895,0.000015164174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010365514,0.00015019195,0.002625238,0.00003177968,0.00045914567,0.000009781962,0.000528645,0.8892091,0.00021283013,0.011113776,0.000018080163,0.095631085],"study_design_scores_gemma":[0.000099094636,0.00007845286,0.0008652369,0.00015874235,0.0003728957,0.0000010039388,5.3345735e-7,0.91525793,0.00028522348,0.08243522,0.000097177945,0.000348517],"about_ca_topic_score_codex":0.00012586942,"about_ca_topic_score_gemma":0.000058157064,"teacher_disagreement_score":0.9480765,"about_ca_system_score_codex":0.00014185291,"about_ca_system_score_gemma":0.00013744201,"threshold_uncertainty_score":0.9998612},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006769051,0.00018975417,0.98573416,0.0009427975,0.00043899514,0.00029746557,0.000013615857,0.00013202813,0.012183478],"genre_scores_gemma":[0.85441685,0.0000056045847,0.1339207,0.00080505357,0.002616879,0.000038043967,0.000023607849,0.00008394755,0.008089319],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978959,0.000008057323,0.00023579056,0.0009853301,0.00046008948,0.00041483415],"domain_scores_gemma":[0.99879855,0.00012044338,0.00008953357,0.00074141397,0.00011437435,0.00013570722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024426624,0.00038640955,0.00042231756,0.000764732,0.000106527834,0.0006531529,0.0010272225,0.00009075604,0.00011568849],"category_scores_gemma":[0.0000049673167,0.0003428984,0.00021904417,0.0006822989,0.00024844168,0.00010844474,0.0007207691,0.0005778992,0.00006412845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005083075,0.000020122137,0.0001465709,0.000022857676,0.00006785474,0.00002775444,0.00030538658,0.0071495012,0.00013720806,0.14109804,0.0009854813,0.8500341],"study_design_scores_gemma":[0.000058557514,0.00008426597,0.000021569036,0.00042212635,0.00004271874,0.0000033827407,2.8946783e-7,0.035260335,0.0009390064,0.92258286,0.039941877,0.00064302323],"about_ca_topic_score_codex":0.000042189033,"about_ca_topic_score_gemma":0.000059455684,"teacher_disagreement_score":0.85434914,"about_ca_system_score_codex":0.00009044706,"about_ca_system_score_gemma":0.00011677735,"threshold_uncertainty_score":0.9999023},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012108682,0.00042335203,0.9828892,0.000026183892,0.00025974502,0.00037748856,0.000025682259,0.000055888308,0.014731604],"genre_scores_gemma":[0.9435734,0.0000101976175,0.055231895,0.0000345246,0.0007234487,0.0000035547773,0.0000061130922,0.00004126333,0.00037560464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997757,0.000044315646,0.00040376763,0.0008956021,0.00042995423,0.00046936798],"domain_scores_gemma":[0.99837357,0.00065052684,0.00022568877,0.00057648844,0.000071525894,0.000102176135],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063320005,0.00048970385,0.0006127799,0.00048123085,0.00012706038,0.0001955684,0.0006868749,0.00013975136,0.0007457115],"category_scores_gemma":[0.0000072942134,0.00038691275,0.0002442204,0.00054015114,0.00042585217,0.000083118866,0.00031965427,0.0006912264,0.0000013690868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009648696,0.000057612753,0.003100769,0.00009712588,0.00030086865,0.00002881388,0.00039019977,0.33102027,0.0001653312,0.02007567,0.0032059862,0.64146084],"study_design_scores_gemma":[0.000083856095,0.00023981235,0.0005854963,0.0006880766,0.00004769746,0.000005050913,8.315878e-8,0.62835884,0.00012286857,0.36938828,0.00012077381,0.00035917165],"about_ca_topic_score_codex":0.000028416813,"about_ca_topic_score_gemma":0.0000049194405,"teacher_disagreement_score":0.94236255,"about_ca_system_score_codex":0.00013187487,"about_ca_system_score_gemma":0.00018465934,"threshold_uncertainty_score":0.99985826},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016632002,0.0022591972,0.9910632,0.0016622911,0.0009234157,0.0007001984,0.000037206457,0.000073928,0.0016174036],"genre_scores_gemma":[0.9165456,0.000095018026,0.081975944,0.0010595262,0.00024377818,0.000028178338,0.000007782517,0.000025227197,0.00001892088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557936,0.00016707423,0.00075533614,0.0013096222,0.001618913,0.0005697023],"domain_scores_gemma":[0.9953663,0.0018182987,0.00029099372,0.0022524414,0.00020364369,0.00006836159],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.006245197,0.00045086496,0.00053244206,0.00057730713,0.0002800615,0.00063844403,0.0060413782,0.00023510416,0.000007985895],"category_scores_gemma":[0.00021697015,0.0002650497,0.0002546706,0.0014483215,0.0011213573,0.00057390117,0.0018349745,0.0014974412,0.0000085046095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048782476,0.000095959585,0.00002385007,0.00020307249,0.000021133226,0.000056262765,0.020545503,0.11238364,0.00021632512,0.7860059,0.000067589324,0.08033198],"study_design_scores_gemma":[0.00017580221,0.00007977232,0.000012277035,0.00018723552,0.000008042671,0.000018267789,0.0000015920524,0.52779067,0.000078456025,0.47135615,0.00012334927,0.00016838757],"about_ca_topic_score_codex":0.00008911326,"about_ca_topic_score_gemma":0.0002596203,"teacher_disagreement_score":0.9148824,"about_ca_system_score_codex":0.0000848828,"about_ca_system_score_gemma":0.00054404093,"threshold_uncertainty_score":0.99998015},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050430495,0.0011762055,0.9903613,0.0007678207,0.0017242533,0.0005378729,0.0000574476,0.00043969727,0.0044311145],"genre_scores_gemma":[0.44219843,0.00022806908,0.5519444,0.0036003452,0.0012786285,0.000042694148,0.000055416505,0.00016147499,0.000490544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945617,0.000046224926,0.00056446844,0.0025927827,0.0012040087,0.0010308266],"domain_scores_gemma":[0.99695146,0.00036719893,0.000110269364,0.0020254883,0.00023297503,0.00031260503],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009978402,0.0009096583,0.0007102162,0.0012424908,0.0003314198,0.001859175,0.0042581954,0.00037625327,0.00004128047],"category_scores_gemma":[0.00001548546,0.0007260477,0.00025169132,0.001534049,0.0012052587,0.0011607506,0.0011351873,0.0016738558,0.00010247196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004652167,0.000079876394,0.000045746434,0.00013917727,0.00007665365,0.0014174085,0.0028505097,0.015695969,0.00012986524,0.8659561,0.00006314588,0.113499],"study_design_scores_gemma":[0.001414287,0.0013357844,0.00012464997,0.0017656098,0.00010857825,0.0011246685,0.0000016061408,0.3457122,0.0018001241,0.63359034,0.009823331,0.00319881],"about_ca_topic_score_codex":0.00008303584,"about_ca_topic_score_gemma":0.0006382927,"teacher_disagreement_score":0.44169414,"about_ca_system_score_codex":0.00016571351,"about_ca_system_score_gemma":0.0006047549,"threshold_uncertainty_score":0.99951905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006125361,0.0002122038,0.9523639,0.00037606218,0.0011727425,0.00034170912,0.00020168426,0.000029139113,0.03917716],"genre_scores_gemma":[0.98570406,0.0000112453845,0.013799278,0.0000973612,0.0001079804,0.0000019244014,0.0000035330377,0.000013244539,0.0002613932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990321,0.000011574797,0.00028205017,0.00020005692,0.00031750737,0.00015675029],"domain_scores_gemma":[0.999014,0.00012406676,0.00017641914,0.00051540474,0.00014387757,0.000026222553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022693294,0.00017377731,0.00028025892,0.00010076055,0.000107902415,0.000049576392,0.0009973254,0.00009032475,0.00001548703],"category_scores_gemma":[0.0000021674207,0.00012919882,0.00014907244,0.00015355417,0.00074190093,0.00006436984,0.00062727346,0.00051843456,0.0000014410022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019605877,0.00004018358,0.00141559,0.00014290922,0.000040025137,3.8100043e-7,0.0047971075,0.17301786,0.000034567714,0.8029751,0.0000069766556,0.01752732],"study_design_scores_gemma":[0.000034881617,0.000012515078,0.000047106918,0.00021941427,0.000009354277,1.8450643e-7,0.0000018041392,0.52854025,0.00017145989,0.4707371,0.00012287521,0.000103079445],"about_ca_topic_score_codex":0.00016678027,"about_ca_topic_score_gemma":0.00005915697,"teacher_disagreement_score":0.9795787,"about_ca_system_score_codex":0.00003835523,"about_ca_system_score_gemma":0.0003025697,"threshold_uncertainty_score":0.5268575},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052572217,0.0003204259,0.97916937,0.0001971596,0.0007592739,0.00025259645,0.0000045340507,0.00016918045,0.019074908],"genre_scores_gemma":[0.742449,0.000020191588,0.2425556,0.000564813,0.0099874055,0.000053180684,0.000088825465,0.00012674996,0.0041542584],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775594,0.000013684435,0.00041915377,0.0009014133,0.00045396612,0.0004558587],"domain_scores_gemma":[0.998854,0.00017900101,0.00016530829,0.00063705846,0.00010292876,0.0000617402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004547639,0.00039575482,0.00041932455,0.00035963612,0.00018597927,0.00047280735,0.0007171335,0.00011713587,0.000246458],"category_scores_gemma":[0.0000042654947,0.00037097972,0.00018145415,0.00051239476,0.00022091503,0.0002990959,0.00057378435,0.0006708384,0.00009068464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002959082,0.000010424064,0.00011316289,0.000015427118,0.000036043017,0.0000122693655,0.00020797567,0.2320286,0.000022633427,0.14306864,0.0006051848,0.6238767],"study_design_scores_gemma":[0.000031154614,0.000024708275,0.000003971064,0.00031346316,0.000024297955,0.0000011727789,1.4793937e-7,0.3606394,0.00009116454,0.63350606,0.0050622686,0.0003022393],"about_ca_topic_score_codex":0.000022082006,"about_ca_topic_score_gemma":0.000021950756,"teacher_disagreement_score":0.7423964,"about_ca_system_score_codex":0.00014384942,"about_ca_system_score_gemma":0.00014229462,"threshold_uncertainty_score":0.99987423},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016532108,0.00054572447,0.97706383,0.0041561807,0.003588888,0.00034234155,0.00003340862,0.00023393388,0.013870384],"genre_scores_gemma":[0.6173404,0.00020355001,0.3737563,0.0067677093,0.0012889177,0.00004990512,0.0000607521,0.000086526445,0.00044595177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99571586,0.000033144366,0.00054548046,0.0019629402,0.001008276,0.0007343015],"domain_scores_gemma":[0.9973423,0.0003296357,0.0000808499,0.0018825518,0.00015287905,0.00021177199],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009375168,0.00054149877,0.00044780338,0.0021263487,0.00027343733,0.0023234836,0.0039929976,0.00035242605,0.00004528375],"category_scores_gemma":[0.00008743964,0.00048848055,0.00017478364,0.001884998,0.0006494986,0.0011861257,0.0016842239,0.0014300152,0.0001850718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034424993,0.00007436042,0.000024572226,0.0000258583,0.000007449004,0.00018516995,0.00068002986,0.0070900954,0.00002107727,0.8621283,0.000085947744,0.1296737],"study_design_scores_gemma":[0.00025645443,0.0003367292,0.00015380055,0.00056126545,0.000005417636,0.000054241584,2.4355577e-7,0.34890643,0.00015264103,0.6212556,0.027425718,0.0008914813],"about_ca_topic_score_codex":0.00005981667,"about_ca_topic_score_gemma":0.0015789913,"teacher_disagreement_score":0.6171751,"about_ca_system_score_codex":0.000293609,"about_ca_system_score_gemma":0.000654229,"threshold_uncertainty_score":0.9997567},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024439566,0.00064884935,0.979625,0.001262756,0.0013452095,0.00046327163,0.000014587125,0.00013483167,0.016261104],"genre_scores_gemma":[0.8107357,0.00021251186,0.17971444,0.003617681,0.0005237308,0.000049399732,0.000010861418,0.00016140085,0.0049742605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960031,0.00003642599,0.0004420565,0.0013542622,0.0015323289,0.0006318547],"domain_scores_gemma":[0.9949143,0.0023581763,0.00019525683,0.0022021302,0.00020202887,0.00012811346],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012787821,0.00046336403,0.00045176112,0.0011821935,0.00019676074,0.00026561317,0.0059101596,0.00021805063,0.000037306843],"category_scores_gemma":[0.00016374976,0.00030286747,0.00018943574,0.0013035182,0.0018282941,0.0002385632,0.0018173617,0.0013977905,0.00011176692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009066273,0.000013774452,0.0000065486647,0.00003433207,0.000012895586,0.00008826886,0.00028076206,0.00419215,0.00017788782,0.8759712,0.000051438576,0.119161695],"study_design_scores_gemma":[0.00008392825,0.00025753694,0.000018821465,0.00047197644,0.0000041760763,0.00003863587,1.581406e-7,0.06646458,0.0018729815,0.9299308,0.0005589558,0.0002974393],"about_ca_topic_score_codex":0.0000069001403,"about_ca_topic_score_gemma":0.000040623207,"teacher_disagreement_score":0.8104913,"about_ca_system_score_codex":0.00012254732,"about_ca_system_score_gemma":0.00030333785,"threshold_uncertainty_score":0.99994236},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033989243,0.0015250169,0.9790546,0.001284559,0.0013867402,0.00032011297,0.0000062689573,0.0005715141,0.015817242],"genre_scores_gemma":[0.2614424,0.000281718,0.6945821,0.004536842,0.0026150965,0.00008549155,0.000040926923,0.00025237034,0.036163032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963502,0.000011529408,0.00044288512,0.0017265707,0.0008534273,0.00061538565],"domain_scores_gemma":[0.99744713,0.00023400884,0.00014369357,0.0018635282,0.00011862729,0.00019298035],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004609414,0.00048854284,0.00039874087,0.0008534523,0.0002462255,0.00115938,0.0038432197,0.00027393142,0.000042426178],"category_scores_gemma":[0.000020850024,0.00044800885,0.00017753166,0.00090097665,0.0005497344,0.00037385724,0.0021034668,0.00085380295,0.00089430617],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.9838806e-7,0.000019850997,0.000004783093,0.000036532405,0.0000094813495,0.00007200785,0.0005626788,0.005384482,0.00021314604,0.11576543,0.00012348691,0.8778075],"study_design_scores_gemma":[0.00009626833,0.00006088284,0.000014014239,0.00026962828,0.00001152777,0.00020248916,9.370295e-8,0.61463207,0.0007904993,0.29650697,0.086778566,0.0006369533],"about_ca_topic_score_codex":0.000023225895,"about_ca_topic_score_gemma":0.000030403726,"teacher_disagreement_score":0.87717056,"about_ca_system_score_codex":0.00022441671,"about_ca_system_score_gemma":0.00039712258,"threshold_uncertainty_score":0.9998836},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024243689,0.0011434894,0.9920819,0.0008606267,0.0025276095,0.00053401827,0.0000062861423,0.0005180562,0.0020856084],"genre_scores_gemma":[0.12089235,0.00011559293,0.87199116,0.0040058563,0.0017442475,0.00010560288,0.000056997724,0.00016841978,0.00091975665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941925,0.00012622356,0.00072021864,0.0024279538,0.001437108,0.0010960113],"domain_scores_gemma":[0.9970625,0.00063885615,0.00021557987,0.0015108641,0.00034778684,0.00022443089],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012341976,0.00071286946,0.0006545666,0.003619777,0.00014324447,0.001154906,0.00428934,0.00043316348,0.000021231152],"category_scores_gemma":[0.00019646826,0.0006826681,0.00019363011,0.008919881,0.00064151577,0.000983736,0.0014254868,0.001857975,0.00018494947],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029840168,0.0002710695,0.0005923311,0.0004898201,0.000045424942,0.0016043958,0.0033566803,0.07116165,0.002862248,0.016445622,0.0033038987,0.899837],"study_design_scores_gemma":[0.00042822838,0.00023305872,0.0010167024,0.0013178303,0.0000115833745,0.00012667962,1.566746e-7,0.71049076,0.0021610619,0.2807039,0.002398575,0.0011114422],"about_ca_topic_score_codex":0.000066745844,"about_ca_topic_score_gemma":0.00026867978,"teacher_disagreement_score":0.89872557,"about_ca_system_score_codex":0.0011143911,"about_ca_system_score_gemma":0.002777398,"threshold_uncertainty_score":0.999882},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036309246,0.003377054,0.9884444,0.00060128566,0.003743891,0.00049826957,0.00007746397,0.00081675017,0.002077817],"genre_scores_gemma":[0.26263475,0.00045067703,0.7309052,0.0037362347,0.0018377362,0.00002686631,0.00007235031,0.00025450648,0.000081693084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938681,0.000051328523,0.0008077578,0.002635515,0.0015386312,0.0010986526],"domain_scores_gemma":[0.99677426,0.00030855936,0.0003322774,0.0018361551,0.00041349762,0.00033523358],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009991415,0.0010166082,0.00084017223,0.0019888235,0.0007281812,0.0030093929,0.003641244,0.0006149406,0.000057698726],"category_scores_gemma":[0.000043286003,0.00094277994,0.00039773778,0.0023906264,0.0016031468,0.0013228472,0.0021926728,0.001786054,0.00008844103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027282213,0.00009152854,0.00013043413,0.00032055334,0.00011066405,0.00088585424,0.0022144655,0.006520388,0.0005575261,0.9058378,0.00026573287,0.083037786],"study_design_scores_gemma":[0.00026214006,0.0002122338,0.000041060634,0.0010364256,0.00003866182,0.00029835358,0.0000011827839,0.3307495,0.0007470602,0.65158373,0.013627841,0.0014018016],"about_ca_topic_score_codex":0.00010517794,"about_ca_topic_score_gemma":0.0003900043,"teacher_disagreement_score":0.32422912,"about_ca_system_score_codex":0.0002700498,"about_ca_system_score_gemma":0.0008511076,"threshold_uncertainty_score":0.99930227},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023435482,0.00058680185,0.9951487,0.00017888546,0.0007010108,0.00036808173,0.000025046671,0.000028463099,0.00061945425],"genre_scores_gemma":[0.8473059,0.00005130017,0.1473729,0.0014319705,0.0010953858,0.000029997102,0.00033078316,0.00008278458,0.0022989796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981901,0.000005368008,0.00030186793,0.0009247064,0.0002391427,0.00033881274],"domain_scores_gemma":[0.99914086,0.000033516168,0.00006479461,0.0005186137,0.00016462209,0.000077599405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022879073,0.00031760667,0.00024863094,0.00019404742,0.00013509036,0.00016971726,0.0006228287,0.00032121455,0.000007174779],"category_scores_gemma":[0.000026142974,0.00030412994,0.0001639969,0.00008457583,0.00019346409,0.00000846677,0.00013318892,0.00024154755,0.000007114809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002598396,0.000014846059,0.000004301618,0.000093497074,0.000015175184,0.000002408915,0.00009918348,0.9548498,0.025721457,0.0007066728,0.000004938,0.018461771],"study_design_scores_gemma":[0.00024519616,0.00010494473,5.456683e-7,0.00008787953,0.000019805286,0.0000030954757,1.03372706e-7,0.96139973,0.006112391,0.030999316,0.0006781749,0.00034879203],"about_ca_topic_score_codex":0.000008782376,"about_ca_topic_score_gemma":0.00009844919,"teacher_disagreement_score":0.8477758,"about_ca_system_score_codex":0.000081562524,"about_ca_system_score_gemma":0.000512659,"threshold_uncertainty_score":0.9999411},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028470345,0.0025677173,0.98658705,0.001408326,0.0009599656,0.00048783526,0.000035099332,0.000017003953,0.005089981],"genre_scores_gemma":[0.85229063,0.000580566,0.1388217,0.0022464315,0.0021081308,0.00006327084,0.00082326477,0.000102870785,0.0029631332],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966679,0.00012561075,0.0004563378,0.0009656856,0.00093409925,0.00085034315],"domain_scores_gemma":[0.9987057,0.00019899172,0.000055657856,0.0005438014,0.00031616187,0.00017972523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022527473,0.000271819,0.00028672448,0.0011630404,0.00008553858,0.00016535785,0.0012939385,0.0006122726,0.00001329494],"category_scores_gemma":[0.0002524881,0.00023746124,0.0000894954,0.0009109661,0.0019548365,0.0000055150053,0.0014054755,0.0011298341,0.00009533245],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008618959,0.00022793257,0.00038415112,0.00088684034,0.00007703132,0.00036331208,0.0006205878,0.05847983,0.028983958,0.0040478874,0.0046190913,0.9012232],"study_design_scores_gemma":[0.0008698528,0.0015632485,0.00025164272,0.0008673866,0.000009271037,0.000082994746,0.0000035238884,0.19756056,0.01602849,0.7397278,0.041953936,0.0010813188],"about_ca_topic_score_codex":0.000022317416,"about_ca_topic_score_gemma":0.00009450482,"teacher_disagreement_score":0.9001419,"about_ca_system_score_codex":0.00022315551,"about_ca_system_score_gemma":0.0024469784,"threshold_uncertainty_score":0.96833885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022549304,0.0003832128,0.99232894,0.0020454086,0.0013205584,0.0014930288,0.000006720861,0.000110636334,0.0022889616],"genre_scores_gemma":[0.42067322,0.00023706962,0.53196913,0.013984003,0.012288567,0.00071927404,0.0013554672,0.00021010949,0.018563114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980052,0.000005551694,0.00043800726,0.0006425174,0.00047530985,0.00043340944],"domain_scores_gemma":[0.99863917,0.00009260123,0.0001803549,0.0006028961,0.00045893714,0.000026042235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013151544,0.00031810012,0.0002345366,0.0003505256,0.00038886126,0.00041979802,0.0007753986,0.0001410117,0.00017840145],"category_scores_gemma":[0.000095962976,0.00024387414,0.00008072116,0.00058730727,0.00020508512,0.0010321185,0.00025558885,0.00024798143,0.00020681947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011105392,0.000023694787,0.00004496461,0.00038420843,0.000016713839,1.9407294e-7,0.0002688299,0.10552757,0.000015518184,0.02462122,0.00055202754,0.86853397],"study_design_scores_gemma":[0.00029144096,0.000013718894,0.00030571257,0.000109084045,0.000056005472,6.839969e-7,0.0000023969872,0.8078587,0.000052101237,0.10166901,0.08919498,0.0004461538],"about_ca_topic_score_codex":0.00091530185,"about_ca_topic_score_gemma":0.0006598117,"teacher_disagreement_score":0.86808777,"about_ca_system_score_codex":0.0001711176,"about_ca_system_score_gemma":0.00011192362,"threshold_uncertainty_score":0.99448985},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006337807,0.0005616339,0.97491336,0.0009426027,0.019552033,0.0014379033,0.00003126654,0.0005512503,0.0019465798],"genre_scores_gemma":[0.059526846,0.000019836638,0.9349631,0.00074063183,0.0035626083,0.00012438963,0.000038135542,0.00014037023,0.0008841039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99326634,0.00003871109,0.00093434576,0.0030387766,0.0016407327,0.0010810685],"domain_scores_gemma":[0.9957734,0.0011501951,0.0003337472,0.0018166316,0.0006439131,0.0002821542],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016965072,0.0008696805,0.0008380027,0.001180753,0.00038545538,0.001353072,0.004215552,0.00051618996,0.000014950376],"category_scores_gemma":[0.00016127448,0.00081215694,0.00038377606,0.001080391,0.00077867904,0.00039755716,0.0020494282,0.0010213138,0.00010673554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094269135,0.000094380914,0.000004919442,0.00014090969,0.000024376312,0.000078521385,0.00088316336,0.13254976,0.00004586945,0.22716935,0.00004167552,0.6389576],"study_design_scores_gemma":[0.0003218348,0.0002533647,0.000017870982,0.00016394728,0.000013757653,0.000031952848,2.052402e-7,0.6000017,0.00034393556,0.39701906,0.001268707,0.00056366],"about_ca_topic_score_codex":0.000024329469,"about_ca_topic_score_gemma":0.000031048556,"teacher_disagreement_score":0.638394,"about_ca_system_score_codex":0.0008356599,"about_ca_system_score_gemma":0.00087395904,"threshold_uncertainty_score":0.9996836},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003518503,0.0013066309,0.98895687,0.002251711,0.0047190413,0.0006492409,0.00007466687,0.00038144362,0.0016252236],"genre_scores_gemma":[0.008970366,0.000141142,0.9864017,0.00093449815,0.001736671,0.000029703442,0.000053220323,0.00006280141,0.0016699462],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956031,0.0000152051625,0.00061526464,0.002089673,0.000881119,0.0007956696],"domain_scores_gemma":[0.9973508,0.00046055188,0.0002072392,0.0015223915,0.00026557065,0.00019344036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071395613,0.00061489776,0.00055839616,0.0013600257,0.0003097426,0.00080629624,0.0037739088,0.00032580594,0.000015622038],"category_scores_gemma":[0.000050338334,0.000579991,0.00035051632,0.0010663702,0.0007513263,0.00051496155,0.0009684277,0.0008950284,0.000048910864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035394094,0.00007142938,0.000005312362,0.00007584537,0.000023893132,0.000043182383,0.00030076655,0.0037760674,0.00007247877,0.3264778,0.000067903835,0.6690818],"study_design_scores_gemma":[0.0001290109,0.00013853148,0.000034218818,0.00020204367,0.000011050961,0.000051300263,1.4088114e-7,0.49310988,0.00034069567,0.49973127,0.005819305,0.00043254902],"about_ca_topic_score_codex":0.000018018223,"about_ca_topic_score_gemma":0.00005805338,"teacher_disagreement_score":0.66864926,"about_ca_system_score_codex":0.0002529675,"about_ca_system_score_gemma":0.00040196208,"threshold_uncertainty_score":0.99966514},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000978657,0.0012097886,0.91937804,0.0005601391,0.0039549116,0.00037850626,0.0000062358836,0.00054869696,0.073953874],"genre_scores_gemma":[0.24499096,0.0073743807,0.6783587,0.0035799013,0.0035779006,0.00022694729,0.0000882351,0.0012151356,0.060587883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984055,0.0000059044946,0.0002815221,0.000491527,0.00042368384,0.00039184952],"domain_scores_gemma":[0.9991997,0.00014395564,0.000042891894,0.00048381946,0.0000587105,0.00007093134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032467555,0.00034765282,0.0002096719,0.00030634843,0.00021549329,0.00047695372,0.00068545673,0.00017550075,0.0000192928],"category_scores_gemma":[0.000012242652,0.0002497969,0.0000808936,0.00036974682,0.000282726,0.00013123272,0.00016618421,0.00078792195,0.00008260319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028743502,0.000002084435,0.000002396777,0.000062413346,0.000012259753,0.000012317732,0.00032529997,0.88583523,0.000010401268,0.07223136,0.00009567538,0.041407697],"study_design_scores_gemma":[0.00011817551,0.00011744004,0.0000051911347,0.00090295565,0.000010066166,0.000037180416,2.86942e-7,0.6533978,0.00021851354,0.26303333,0.08158176,0.0005773149],"about_ca_topic_score_codex":0.0000023873379,"about_ca_topic_score_gemma":0.000044453067,"teacher_disagreement_score":0.24498117,"about_ca_system_score_codex":0.00012864749,"about_ca_system_score_gemma":0.000059156464,"threshold_uncertainty_score":0.9999954},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007580603,0.00023069778,0.99767184,0.00048284174,0.0005574488,0.0004928216,0.000017136024,0.00016388208,0.00030752484],"genre_scores_gemma":[0.06526845,0.000014529698,0.9342606,0.00016412907,0.00016319,0.000016575788,0.0000076389115,0.000028629267,0.00007627579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975234,0.000011886042,0.00044146494,0.0010712695,0.00048395322,0.00046800764],"domain_scores_gemma":[0.99864733,0.00035956907,0.00013919668,0.0004510387,0.00024999297,0.00015288872],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005616757,0.00038011762,0.00035941263,0.00046991612,0.00025802126,0.0013698455,0.0008958024,0.00024991526,0.0000115007415],"category_scores_gemma":[0.00006517664,0.00034801188,0.000075691576,0.000272316,0.0006355564,0.00048418142,0.0004957582,0.00044812416,0.0000057764223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026928722,0.000016800137,0.0000011142812,0.00010588093,0.000013516365,0.000019409985,0.0009894005,0.70817685,0.000027769554,0.15914977,0.0000032915277,0.13149348],"study_design_scores_gemma":[0.000111779445,0.000102507234,3.1577068e-7,0.0005268301,0.000017632972,0.00012677853,0.0000012197332,0.9160306,0.00009179428,0.08250884,0.00012681507,0.0003548977],"about_ca_topic_score_codex":0.0000055245077,"about_ca_topic_score_gemma":0.000006690834,"teacher_disagreement_score":0.20785372,"about_ca_system_score_codex":0.00017203893,"about_ca_system_score_gemma":0.0004488425,"threshold_uncertainty_score":0.9998972},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013475609,0.0050989343,0.97896713,0.002591411,0.006052786,0.00044986355,0.000004578695,0.0009251161,0.0045626285],"genre_scores_gemma":[0.9330623,0.000035802932,0.064798295,0.00047560464,0.0003186254,0.000026593794,0.000003063816,0.000034249995,0.0012454396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959791,0.000036966514,0.00064645696,0.0017865014,0.0007062024,0.0008447948],"domain_scores_gemma":[0.99800193,0.00027449237,0.00019804099,0.0013014524,0.000137993,0.00008611601],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007887919,0.00064051047,0.0007813835,0.001495869,0.00033499938,0.00056772394,0.0030614655,0.0004870607,0.000006269493],"category_scores_gemma":[0.000052077085,0.0005564611,0.00014945141,0.0012826287,0.00097063923,0.00067798886,0.002062606,0.0018738202,0.000070741466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025488096,0.00004908664,0.00012921987,0.000629917,0.00010218414,0.002836421,0.014447288,0.0028073664,0.00041295748,0.6468432,0.00026270203,0.3314542],"study_design_scores_gemma":[0.00061462214,0.00037533327,0.00047801682,0.0041013854,0.000029336923,0.00090940436,0.000016976479,0.6528886,0.0005138397,0.3336506,0.0045502475,0.0018716534],"about_ca_topic_score_codex":0.00004398561,"about_ca_topic_score_gemma":0.0009035718,"teacher_disagreement_score":0.9317148,"about_ca_system_score_codex":0.0005606983,"about_ca_system_score_gemma":0.0003340734,"threshold_uncertainty_score":0.9996887},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008245789,0.00074147846,0.9893107,0.0056740483,0.0006495643,0.0026216258,0.00031875013,0.000305553,0.00029586404],"genre_scores_gemma":[0.019800182,0.000039660135,0.973672,0.0050771576,0.00055814016,0.00026581282,0.0001765221,0.00008362888,0.00032690747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99442804,0.00010065667,0.0010437672,0.0029282346,0.0005107169,0.000988606],"domain_scores_gemma":[0.95906395,0.038330406,0.00050856406,0.0016601098,0.00015328347,0.00028370932],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0068399427,0.00081974897,0.0016037155,0.00033302075,0.00046727675,0.00027261156,0.002746388,0.0005037702,0.000015060228],"category_scores_gemma":[0.022430804,0.0005169772,0.00025462033,0.00036802146,0.0018976044,0.00019522234,0.0020253393,0.00088932336,0.0000074236195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004975478,0.00016751366,0.00038800453,0.0048005325,0.0006482966,0.0001473457,0.0009613376,0.14891493,0.00002457664,0.767616,0.0038770225,0.07195689],"study_design_scores_gemma":[0.00039715768,0.00029755713,0.000008926228,0.0002739227,0.00012780588,0.000023138497,0.000001866539,0.29327056,0.000010977029,0.7015593,0.0035050812,0.0005237306],"about_ca_topic_score_codex":0.000067970934,"about_ca_topic_score_gemma":0.00041967354,"teacher_disagreement_score":0.14435561,"about_ca_system_score_codex":0.00057711446,"about_ca_system_score_gemma":0.0005380349,"threshold_uncertainty_score":0.9997282},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023856589,0.00019213803,0.9950219,0.0007395765,0.0010157665,0.00048092043,0.000019732937,0.0002595783,0.0020318127],"genre_scores_gemma":[0.11194318,0.000004766787,0.88563067,0.0007249674,0.00020584482,0.0000169685,0.000007542522,0.00004967442,0.0014164166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953958,0.000029349038,0.00093303714,0.0015543337,0.0014822825,0.00060520007],"domain_scores_gemma":[0.9963207,0.0009198228,0.00041966912,0.0014876885,0.00071899046,0.00013308124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013113164,0.00053887046,0.00059938635,0.0010663914,0.00022661417,0.0004918042,0.004051914,0.000328584,0.000025269328],"category_scores_gemma":[0.00021552684,0.0005279532,0.0001549473,0.0014276817,0.0012509114,0.00087078835,0.002253795,0.0009650893,0.000058387326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027812582,0.000014815576,0.000024364936,0.00002840405,0.000013812145,0.000018637644,0.0013257087,0.5757859,0.00034431808,0.40277252,0.000021332778,0.019647432],"study_design_scores_gemma":[0.00011931425,0.0000883112,0.000014737963,0.0003338047,0.000008676845,0.000022376074,2.7689606e-7,0.7381061,0.0012818323,0.25918326,0.00043320205,0.00040814868],"about_ca_topic_score_codex":0.000009325405,"about_ca_topic_score_gemma":0.0000097894945,"teacher_disagreement_score":0.16232018,"about_ca_system_score_codex":0.0003820967,"about_ca_system_score_gemma":0.0018186831,"threshold_uncertainty_score":0.9997172},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059532,0.0006557894,0.9237469,0.020465206,0.0030904713,0.018217271,0.00015694377,0.00039158823,0.027322672],"genre_scores_gemma":[0.92250466,0.000054782777,0.045798764,0.0011055996,0.000480399,0.0009517868,0.00010855465,0.0001627642,0.028832702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99592406,0.000053856635,0.00072722737,0.0015403528,0.00096173614,0.00079278863],"domain_scores_gemma":[0.998216,0.00031078875,0.00024816208,0.00095466344,0.000073836956,0.00019657785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024036507,0.00050686486,0.0003924436,0.00014169843,0.0004341768,0.00045216884,0.001096802,0.00019424927,0.00034101264],"category_scores_gemma":[0.00006684503,0.00035700318,0.00016398725,0.0003855859,0.0017076029,0.00025652398,0.0010626344,0.00058648933,0.000080995145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012512774,0.0006301732,0.024819436,0.003327169,0.000105048915,0.00011947063,0.018170882,0.7278321,0.00017814398,0.042372108,0.0025699167,0.17975047],"study_design_scores_gemma":[0.00050104025,0.0005079707,0.00051948184,0.0003075193,0.00009587977,0.00004509165,0.00013768916,0.15228425,0.00038820956,0.7121391,0.13174301,0.0013307249],"about_ca_topic_score_codex":0.00014732126,"about_ca_topic_score_gemma":0.00013576768,"teacher_disagreement_score":0.9165515,"about_ca_system_score_codex":0.004499372,"about_ca_system_score_gemma":0.000413022,"threshold_uncertainty_score":0.9998882},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010135803,0.0023022345,0.9838755,0.0020949596,0.0033346373,0.0008979219,0.00011341845,0.000026113868,0.007345053],"genre_scores_gemma":[0.12120855,0.01270623,0.84932536,0.0064507145,0.005096603,0.00032220894,0.0004885017,0.000117367636,0.004284436],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828017,0.00005592607,0.00047819264,0.0003706866,0.0005420336,0.00027296794],"domain_scores_gemma":[0.9975317,0.0016415918,0.00024317189,0.00033169368,0.00018355848,0.00006827845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026612368,0.00019446529,0.00024356028,0.00025001675,0.0004972738,0.00048268324,0.00063390844,0.00017532919,0.00017477089],"category_scores_gemma":[0.00022431237,0.00015041206,0.000082763705,0.0003011316,0.0015379989,0.0009441345,0.00026309644,0.00035720438,0.00001644814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069564544,0.0000069434086,0.0000026753698,0.000090334965,0.000011099594,7.9469424e-7,0.0016601777,0.0012528116,0.000021025815,0.42977345,0.00017220345,0.5670015],"study_design_scores_gemma":[0.0000393831,0.00007670373,0.000016034217,0.00043855817,0.00004844195,0.0000057475595,0.000023144728,0.052487276,0.0007459224,0.2963818,0.64950544,0.00023153973],"about_ca_topic_score_codex":0.00073928403,"about_ca_topic_score_gemma":0.0016420432,"teacher_disagreement_score":0.64933324,"about_ca_system_score_codex":0.00023166183,"about_ca_system_score_gemma":0.00033833896,"threshold_uncertainty_score":0.61336255},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018688297,0.00053563254,0.99053943,0.0006252786,0.0005713377,0.00049106166,0.0000026048226,0.0013250124,0.005890964],"genre_scores_gemma":[0.28660515,0.000029827694,0.7107005,0.00072542316,0.00030523268,0.00009637965,0.000008970425,0.00006428977,0.0014641985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962562,0.000038443457,0.00054629875,0.0017659782,0.00080283737,0.00059029664],"domain_scores_gemma":[0.9976783,0.00035735167,0.00026211506,0.0013588024,0.00017566617,0.00016776155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091746886,0.0005255913,0.00052174815,0.0009212636,0.0003526506,0.00088380324,0.0027703985,0.00032602626,0.0000314839],"category_scores_gemma":[0.00004745857,0.0004801018,0.00020506844,0.0011941706,0.00045512946,0.00033119245,0.00093719084,0.0011901066,0.00016404697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020885996,0.000044473527,0.000053814143,0.00019727618,0.000016794784,0.00004226827,0.00037481665,0.11197999,0.000071174945,0.04026518,0.000035551908,0.84691656],"study_design_scores_gemma":[0.00008866778,0.00010053487,0.0000834791,0.00016047433,0.000005564822,0.000049379192,1.56907e-7,0.92462206,0.00020179522,0.07101094,0.0031402025,0.0005367709],"about_ca_topic_score_codex":0.000015349404,"about_ca_topic_score_gemma":0.000017601235,"teacher_disagreement_score":0.8463798,"about_ca_system_score_codex":0.0003214243,"about_ca_system_score_gemma":0.0003042867,"threshold_uncertainty_score":0.99976504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082953644,0.00022104937,0.9961526,0.0010024904,0.00094090146,0.0005182796,0.0000052697355,0.0000922386,0.0009842366],"genre_scores_gemma":[0.24657927,0.000066204215,0.75268567,0.00011253825,0.00022499642,0.000026230635,0.000012931005,0.000016042795,0.0002761017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972238,0.00009964806,0.00055974413,0.00093766174,0.0008086702,0.00037046854],"domain_scores_gemma":[0.99834013,0.00037822,0.000071929666,0.0005345278,0.0005684882,0.000106728876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017962793,0.00023485016,0.0002790317,0.0015273158,0.0002271733,0.00095774984,0.00089867937,0.00022036575,0.000017997092],"category_scores_gemma":[0.00026357392,0.00021039756,0.000056090536,0.0018690496,0.0017776293,0.00046184007,0.0006016324,0.0008896334,0.000016628546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012526277,0.000018571158,0.0000030230804,0.00003364318,0.000004071102,0.00000823323,0.0013354279,0.02476525,0.00017934691,0.13085026,0.000014919788,0.842786],"study_design_scores_gemma":[0.000025167883,0.00014138024,0.000021465237,0.00036767774,0.0000043269706,0.00004186592,0.00000387225,0.8528624,0.0019858002,0.14407788,0.00026772983,0.00020040262],"about_ca_topic_score_codex":0.000039777682,"about_ca_topic_score_gemma":0.00062404765,"teacher_disagreement_score":0.8425856,"about_ca_system_score_codex":0.00025633827,"about_ca_system_score_gemma":0.0017173566,"threshold_uncertainty_score":0.9235604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027897197,0.00056992273,0.99051565,0.0006689048,0.0011898922,0.0013812257,0.00001883636,0.0006770285,0.004950665],"genre_scores_gemma":[0.013852805,0.000017089871,0.98004735,0.0005245496,0.0010229517,0.00013400856,0.0000576945,0.00010008249,0.004243466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947591,0.000039700335,0.00055374944,0.0025030526,0.0011575734,0.0009868486],"domain_scores_gemma":[0.9973175,0.00031993556,0.0002834476,0.0014935301,0.00030522828,0.00028036724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010331246,0.0008356685,0.00077775,0.0007577746,0.0003650881,0.0010188138,0.0033485126,0.00039314508,0.0000069142257],"category_scores_gemma":[0.000041659732,0.00062173506,0.00022618359,0.00090798875,0.00089015043,0.00041128986,0.001210522,0.0010119961,0.000025125579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004795203,0.00013818812,0.00003903026,0.00034091313,0.00008466379,0.00019734641,0.0022031676,0.2118617,0.00003132997,0.014693282,0.000061751234,0.7703007],"study_design_scores_gemma":[0.00056960975,0.0011351132,0.0000074339277,0.0005840669,0.00003222248,0.00018421745,8.789332e-7,0.9825934,0.00008847733,0.011204263,0.0027831646,0.0008171597],"about_ca_topic_score_codex":0.000028526678,"about_ca_topic_score_gemma":0.0000069161647,"teacher_disagreement_score":0.7707317,"about_ca_system_score_codex":0.00017859861,"about_ca_system_score_gemma":0.00055764493,"threshold_uncertainty_score":0.9996234},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010326037,0.0011090072,0.9873195,0.004452859,0.004535825,0.0007401226,0.000031441377,0.00053515006,0.0011727868],"genre_scores_gemma":[0.26218328,0.000018897648,0.7117626,0.017761348,0.0042997217,0.0001054319,0.000053368105,0.00024071634,0.0035745916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99459463,0.000088562,0.00065345294,0.0026732956,0.00095964124,0.0010303971],"domain_scores_gemma":[0.9964313,0.0005293716,0.00021177644,0.0020436633,0.00028497772,0.00049894745],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009595929,0.0008741848,0.00075303717,0.0013460721,0.0003979118,0.0022743922,0.0043123406,0.000422265,0.00000960683],"category_scores_gemma":[0.00008348162,0.0007492044,0.00015818053,0.0011331644,0.00029514066,0.0005113708,0.0012259157,0.001879171,0.000113222646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011756524,0.000026004807,0.00001886574,0.00014241469,0.000027017337,0.00033476844,0.0038645105,0.70999056,0.0025953022,0.021718733,0.00028698478,0.26098308],"study_design_scores_gemma":[0.00014297645,0.0005988265,0.000016953269,0.00075914577,0.000014333881,0.0001731061,2.5933346e-7,0.9393709,0.0010044329,0.05023872,0.006707029,0.0009733232],"about_ca_topic_score_codex":0.000104905725,"about_ca_topic_score_gemma":0.00013071585,"teacher_disagreement_score":0.27555692,"about_ca_system_score_codex":0.00024176794,"about_ca_system_score_gemma":0.0007394239,"threshold_uncertainty_score":0.9994959},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000097241784,0.0005389867,0.9920875,0.00039294845,0.0038465224,0.0008149285,0.000009901905,0.0003753801,0.0018366147],"genre_scores_gemma":[0.05826735,0.00009542236,0.9365101,0.000579823,0.0008772837,0.00007253741,0.000036669302,0.0000978668,0.0034629593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570006,0.000015748145,0.00047113796,0.0021259913,0.0009456367,0.0007414015],"domain_scores_gemma":[0.9976028,0.0008178131,0.00019780401,0.0010238306,0.00021546103,0.00014227974],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00096708175,0.0005678397,0.00047019165,0.0011375273,0.00040189293,0.00141273,0.0031710188,0.00022257172,0.000009427015],"category_scores_gemma":[0.000161219,0.000497031,0.00020593901,0.0008779779,0.000374557,0.0006019075,0.003192488,0.0008274783,0.00011813472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071706195,0.000026639247,0.0000058052856,0.000059686234,0.000014732763,0.00007213626,0.0004804092,0.17913833,0.000034135453,0.020899082,0.000044741504,0.7992171],"study_design_scores_gemma":[0.00027078335,0.00028063016,0.0000290092,0.0005550998,0.0000137091865,0.000013642253,5.2112523e-7,0.90229744,0.00022772714,0.08396334,0.011765243,0.0005828466],"about_ca_topic_score_codex":0.000014032014,"about_ca_topic_score_gemma":0.000023516646,"teacher_disagreement_score":0.7986343,"about_ca_system_score_codex":0.00030426474,"about_ca_system_score_gemma":0.00019045093,"threshold_uncertainty_score":0.9997481},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006629586,0.00010813373,0.996772,0.00078245864,0.0006596042,0.0010277928,0.000048133836,0.000017287683,0.000518273],"genre_scores_gemma":[0.3540762,0.000020387992,0.6437056,0.00034372375,0.0002619018,0.00006455515,0.000002874258,0.000076585784,0.0014481235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982586,0.00003320502,0.0004624064,0.00037096484,0.0006218219,0.00025303545],"domain_scores_gemma":[0.996583,0.0020877486,0.00024485003,0.0007600585,0.0002930711,0.000031284053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069438067,0.00020396327,0.00026382873,0.000093709,0.00027022624,0.000066388406,0.0012226803,0.00011379042,0.000016029688],"category_scores_gemma":[0.0005883909,0.00010279596,0.00017597561,0.00035125896,0.0018924142,0.00006607775,0.00067661784,0.00052289234,0.0000010175772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008176717,0.000022417928,0.0000036092063,0.0004310826,0.000041629806,0.0000016300935,0.003910739,0.86044675,0.0021018411,0.06911684,0.000024229674,0.06389105],"study_design_scores_gemma":[0.00013467454,0.000029265242,0.0000043188106,0.0007619813,0.00002080945,0.000010178915,0.0000074246486,0.7828594,0.021710051,0.19412675,0.00021041434,0.00012474981],"about_ca_topic_score_codex":0.0000065916797,"about_ca_topic_score_gemma":0.00022295963,"teacher_disagreement_score":0.35400993,"about_ca_system_score_codex":0.00014644918,"about_ca_system_score_gemma":0.00035792796,"threshold_uncertainty_score":0.6972679},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014564152,0.0014600849,0.9840029,0.00085049577,0.004349524,0.00046156114,0.000022837676,0.00049710134,0.00820984],"genre_scores_gemma":[0.91261053,0.00004270774,0.08213382,0.000578531,0.0013142293,0.0000225904,0.000006891322,0.00009393731,0.0031967675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938788,0.00006272352,0.0007567257,0.0024172978,0.0016854845,0.0011990118],"domain_scores_gemma":[0.9960963,0.00092053023,0.000207639,0.0021286285,0.00031954813,0.0003273431],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015181308,0.00082180195,0.00083599763,0.0010683734,0.00034705878,0.0016320959,0.00553518,0.0004935316,0.00002218314],"category_scores_gemma":[0.00006661502,0.000720591,0.00033143925,0.0010666708,0.00064441963,0.0005247596,0.0025134343,0.0013338209,0.000477842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009675585,0.000050928847,0.00018168004,0.00034597534,0.000090635316,0.00088352204,0.0015766411,0.4410608,0.00005766953,0.05290582,0.00039255887,0.5024441],"study_design_scores_gemma":[0.00011790614,0.00011001336,0.00007058756,0.0011486276,0.000019410994,0.0002018516,1.9565698e-7,0.9273592,0.00022141817,0.062641025,0.0072171143,0.0008926123],"about_ca_topic_score_codex":0.00019807693,"about_ca_topic_score_gemma":0.00019521569,"teacher_disagreement_score":0.91246486,"about_ca_system_score_codex":0.00048399842,"about_ca_system_score_gemma":0.00066816126,"threshold_uncertainty_score":0.9998453},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005483436,0.00018064551,0.9964901,0.0000275438,0.00039204492,0.0007006281,0.00005031823,0.0004730404,0.0011372862],"genre_scores_gemma":[0.10350334,0.000010060007,0.89579046,0.00006594682,0.00011506547,0.000054590422,0.00003573102,0.00008727908,0.00033753278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821204,0.000013697447,0.00033823212,0.0006780314,0.0003143799,0.00044362876],"domain_scores_gemma":[0.9992192,0.00019857839,0.00006905804,0.0002978389,0.00012740519,0.0000879367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041601382,0.0004053152,0.00035830418,0.0004839939,0.000109621,0.00028803293,0.00041343397,0.00020819457,0.000006483393],"category_scores_gemma":[0.000023198818,0.00036878485,0.00007662364,0.00027992087,0.00028931984,0.00023306716,0.00011813255,0.0005338966,0.0000040095024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010088889,0.0000071414565,0.000010003126,0.0005012623,0.000031540385,0.0000066360094,0.0019491825,0.972078,0.0004352311,0.00023769928,0.000005902708,0.024727263],"study_design_scores_gemma":[0.00034036936,0.00009252494,0.000009458982,0.00048057167,0.000018959488,0.000024075713,0.0000038712556,0.9942024,0.0013388295,0.0029484797,0.00009996248,0.0004405474],"about_ca_topic_score_codex":0.000010014546,"about_ca_topic_score_gemma":0.000038558817,"teacher_disagreement_score":0.102955,"about_ca_system_score_codex":0.00036287488,"about_ca_system_score_gemma":0.00009118511,"threshold_uncertainty_score":0.99987644},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082953644,0.00022104937,0.9961526,0.0010024904,0.00094090146,0.0005182796,0.0000052697355,0.0000922386,0.0009842366],"genre_scores_gemma":[0.24657927,0.000066204215,0.75268567,0.00011253825,0.00022499642,0.000026230635,0.000012931005,0.000016042795,0.0002761017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972238,0.00009964806,0.00055974413,0.00093766174,0.0008086702,0.00037046854],"domain_scores_gemma":[0.99834013,0.00037822,0.000071929666,0.0005345278,0.0005684882,0.000106728876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017962793,0.00023485016,0.0002790317,0.0015273158,0.0002271733,0.00095774984,0.00089867937,0.00022036575,0.000017997092],"category_scores_gemma":[0.00026357392,0.00021039756,0.000056090536,0.0018690496,0.0017776293,0.00046184007,0.0006016324,0.0008896334,0.000016628546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012526277,0.000018571158,0.0000030230804,0.00003364318,0.000004071102,0.00000823323,0.0013354279,0.02476525,0.00017934691,0.13085026,0.000014919788,0.842786],"study_design_scores_gemma":[0.000025167883,0.00014138024,0.000021465237,0.00036767774,0.0000043269706,0.00004186592,0.00000387225,0.8528624,0.0019858002,0.14407788,0.00026772983,0.00020040262],"about_ca_topic_score_codex":0.000039777682,"about_ca_topic_score_gemma":0.00062404765,"teacher_disagreement_score":0.8425856,"about_ca_system_score_codex":0.00025633827,"about_ca_system_score_gemma":0.0017173566,"threshold_uncertainty_score":0.9235604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001745827,0.00015564951,0.9941957,0.0006186491,0.0023590887,0.00065860193,0.0000051027337,0.00014908178,0.0018406723],"genre_scores_gemma":[0.29981595,0.000021560847,0.6990331,0.00018105206,0.00041684674,0.00006391679,0.000036960333,0.000044852415,0.0003857577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976586,0.000026073798,0.00045525085,0.0009775979,0.00060548604,0.00027695176],"domain_scores_gemma":[0.9986094,0.0002679777,0.0002900403,0.00051208574,0.00024750456,0.000072966934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052420265,0.00028483022,0.00037046967,0.00069782895,0.000121998746,0.00030105188,0.0008945425,0.0002167376,0.000010556192],"category_scores_gemma":[0.00010155611,0.00026935159,0.0001590838,0.00069514604,0.00035932046,0.0002785756,0.00028281676,0.0003824594,0.000004912523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005744986,0.000015503447,0.000024515717,0.00011218828,0.000009489334,0.0000025714385,0.00034742136,0.5885199,0.000047183214,0.057725977,0.0000060080565,0.35318357],"study_design_scores_gemma":[0.00029647574,0.00017606688,0.000026479662,0.00016188694,0.000010998297,0.00000692914,2.13377e-7,0.8526843,0.0014481476,0.14445157,0.000495,0.00024192908],"about_ca_topic_score_codex":0.0000141597875,"about_ca_topic_score_gemma":0.000015971696,"teacher_disagreement_score":0.35294163,"about_ca_system_score_codex":0.00016533736,"about_ca_system_score_gemma":0.000626811,"threshold_uncertainty_score":0.99997586},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004734516,0.00022057476,0.9964899,0.0002828855,0.00027678636,0.001243206,0.00002198997,0.00023346442,0.0011838707],"genre_scores_gemma":[0.81476915,0.00001592685,0.18460938,0.00017572088,0.000087495006,0.00017541749,0.0000125345105,0.000042357096,0.000111990186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985071,0.0000021236015,0.0003271095,0.00045494564,0.00033576562,0.00037294504],"domain_scores_gemma":[0.9992891,0.00021062333,0.00005548095,0.00027067034,0.0001235165,0.000050631872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034658232,0.00028511754,0.00020836505,0.000268188,0.00014137957,0.00020696755,0.00034576928,0.000120989265,0.000007811705],"category_scores_gemma":[0.0000075150865,0.00019962744,0.00006165845,0.00036300503,0.0005133094,0.00007506831,0.000021703006,0.0005040533,0.0000024258088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020037694,0.000005368283,0.0000037494044,0.000086544875,0.000029624367,0.0000047031367,0.0005872967,0.62953484,0.00009648079,0.0221398,0.0000035178903,0.3475061],"study_design_scores_gemma":[0.00015040442,0.000053014246,0.000009270463,0.00032181924,0.000039200255,0.000023164388,0.0000013748964,0.9743701,0.00022387288,0.023530424,0.001005528,0.00027179788],"about_ca_topic_score_codex":0.0000019871181,"about_ca_topic_score_gemma":0.00009730485,"teacher_disagreement_score":0.8147218,"about_ca_system_score_codex":0.00019339801,"about_ca_system_score_gemma":0.000316283,"threshold_uncertainty_score":0.81405705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006022063,0.0009658494,0.9889223,0.00023128728,0.0022861948,0.0009560694,0.000025671494,0.00032789505,0.006224497],"genre_scores_gemma":[0.39479893,0.00016617778,0.6025348,0.0002700251,0.00077000394,0.000084119085,0.000010902759,0.00016747783,0.00119755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973654,0.0000051766233,0.000565997,0.00095750776,0.0003765973,0.000729317],"domain_scores_gemma":[0.9989026,0.00023448549,0.000071866525,0.0004893872,0.00014654778,0.00015507886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077739096,0.00050386204,0.00054794305,0.00035500716,0.000116760246,0.0001597687,0.00077372463,0.00035697006,0.00001541172],"category_scores_gemma":[0.000037070273,0.00044060755,0.00019623163,0.00024402584,0.00061414833,0.00019439946,0.00013743526,0.00070862955,0.00003784496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015170704,0.000011257574,0.0000028418672,0.002696754,0.00003575745,0.000061570754,0.0009370213,0.60743004,0.001996324,0.006175209,0.000047134556,0.38059092],"study_design_scores_gemma":[0.00026806875,0.00007061959,0.000001568046,0.0061357142,0.000016746159,0.000060115606,5.836836e-7,0.9267366,0.002216388,0.053512085,0.010424109,0.0005574212],"about_ca_topic_score_codex":0.0000030993206,"about_ca_topic_score_gemma":0.000011979375,"teacher_disagreement_score":0.39473873,"about_ca_system_score_codex":0.00035185725,"about_ca_system_score_gemma":0.00021123383,"threshold_uncertainty_score":0.99980456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011818174,0.0008845807,0.9902274,0.0016388302,0.0011740399,0.0017497579,0.000023127122,0.000585731,0.003704729],"genre_scores_gemma":[0.049787454,0.00027353867,0.9408294,0.0018210693,0.00084887265,0.0006341285,0.000014552802,0.00009471001,0.0056962864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643993,0.000026806612,0.0007145051,0.0016396743,0.0006167469,0.0005623199],"domain_scores_gemma":[0.9968081,0.0012314041,0.00029085678,0.0012590658,0.0002669082,0.00014364887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00149688,0.0005508018,0.0008511974,0.00078416464,0.00032758684,0.0008923035,0.002526073,0.00035481597,0.000033724333],"category_scores_gemma":[0.00008324541,0.00046173096,0.0003686769,0.00048579823,0.0007150473,0.00041657055,0.0008115586,0.0005641778,0.000060189894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032423896,0.000044416825,9.889355e-7,0.00018020615,0.000059605863,0.000026025895,0.00085807126,0.023540264,0.0005321904,0.5642259,0.00064882793,0.40955928],"study_design_scores_gemma":[0.0030549967,0.0000959511,5.3386236e-7,0.0003055718,0.000024564739,0.000047063622,2.5703216e-7,0.53034145,0.004912914,0.4449709,0.015665852,0.0005799285],"about_ca_topic_score_codex":0.000021323593,"about_ca_topic_score_gemma":0.000031139745,"teacher_disagreement_score":0.5068012,"about_ca_system_score_codex":0.00026956777,"about_ca_system_score_gemma":0.00032392514,"threshold_uncertainty_score":0.99978346},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006507349,0.0000814162,0.99658275,0.00052947673,0.00022857459,0.0003065559,0.000043476746,0.00012499733,0.0014520289],"genre_scores_gemma":[0.7020202,0.000024466259,0.2970231,0.00029122867,0.00020084124,0.00001655634,0.00011966863,0.000054839173,0.00024909317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990385,0.0000028099348,0.0002684319,0.0002638183,0.0002712647,0.00015516691],"domain_scores_gemma":[0.99944454,0.000080835656,0.000051553838,0.0002601544,0.00013695593,0.00002595497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013767646,0.0001884737,0.00017694235,0.00025479431,0.00004086624,0.000056241286,0.00032249407,0.00008960005,0.000029115183],"category_scores_gemma":[0.0000062107965,0.00012331427,0.000039155995,0.00043527826,0.00032773174,0.00009311101,0.0000306451,0.00040685548,0.0000018839035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000265735,0.000008312354,0.000008469479,0.000069928996,0.000011955891,0.000003250492,0.0005238656,0.96345896,0.000046325928,0.0074321027,0.000009672907,0.028424501],"study_design_scores_gemma":[0.00014804328,0.000086597436,0.00018628857,0.0003778476,0.000030582243,0.000012021605,0.0000013445679,0.98675853,0.00053581246,0.009489632,0.0020984528,0.00027482698],"about_ca_topic_score_codex":0.0000108683325,"about_ca_topic_score_gemma":0.00045216977,"teacher_disagreement_score":0.7013695,"about_ca_system_score_codex":0.000070746755,"about_ca_system_score_gemma":0.00013295563,"threshold_uncertainty_score":0.50286096},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007696532,0.0010753733,0.9894894,0.0006323942,0.0028712633,0.00041358493,0.000020345531,0.00036548666,0.004362516],"genre_scores_gemma":[0.68470335,0.00011633437,0.3126272,0.00061019004,0.0010501738,0.000019150668,0.0000039714796,0.00013154981,0.0007381025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948605,0.000043375556,0.00089664216,0.002104833,0.0012212844,0.00087340845],"domain_scores_gemma":[0.9959538,0.0012992467,0.00042065405,0.0018856315,0.0002128387,0.00022780489],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010787222,0.00077827653,0.0009702383,0.0014710965,0.000208618,0.0004927221,0.0045394287,0.0004307554,0.000020151063],"category_scores_gemma":[0.0001606253,0.0006704173,0.00036503162,0.0009615103,0.0008244725,0.00030678118,0.0020639189,0.0013052128,0.00008558969],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002568182,0.000033607943,0.000015380327,0.00019408508,0.000032273674,0.00017089055,0.0006246732,0.049881455,0.00035757085,0.015216411,0.000017026427,0.93345404],"study_design_scores_gemma":[0.0001349481,0.00014372973,0.00008720612,0.0016391455,0.000021557062,0.00015888755,1.3986104e-7,0.8419183,0.006352321,0.14764374,0.0011385265,0.0007615246],"about_ca_topic_score_codex":0.000039865292,"about_ca_topic_score_gemma":0.000025067551,"teacher_disagreement_score":0.9326925,"about_ca_system_score_codex":0.0002352332,"about_ca_system_score_gemma":0.000612569,"threshold_uncertainty_score":0.9995747},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055460434,0.0007739733,0.9852891,0.000092987335,0.002258149,0.00014703997,0.0000081250455,0.00036773816,0.010508271],"genre_scores_gemma":[0.841393,0.00007277091,0.15509392,0.0006115046,0.0015791488,0.0000044359977,0.000052697287,0.00012345292,0.0010690636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863064,0.000004245763,0.00024769924,0.000494277,0.00033641828,0.00028670763],"domain_scores_gemma":[0.99946034,0.00018852175,0.000037431422,0.0001898374,0.00005375664,0.000070095404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001471536,0.00028421424,0.00024063789,0.00038240218,0.00011116259,0.00010962046,0.0003314196,0.00013730883,0.000022646263],"category_scores_gemma":[0.000005985673,0.00028991062,0.00007084286,0.0002437329,0.00019405216,0.00017727308,0.0001720482,0.0006698692,0.000105843974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019796548,0.0000023511243,0.0000012514156,0.000095422765,0.000006759238,0.00006801506,0.000079488666,0.90724325,0.0016321056,0.0024246743,0.000038874656,0.0884058],"study_design_scores_gemma":[0.00009903006,0.00004478725,0.000010419587,0.000674864,0.000010037647,0.00008910291,7.7679104e-8,0.79051363,0.007114893,0.19965008,0.0013711195,0.00042193997],"about_ca_topic_score_codex":6.3809716e-7,"about_ca_topic_score_gemma":0.000003810396,"teacher_disagreement_score":0.8408384,"about_ca_system_score_codex":0.00022828268,"about_ca_system_score_gemma":0.000049077917,"threshold_uncertainty_score":0.9999553},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002500031,0.0019448409,0.98619235,0.0008306813,0.008297589,0.0011808076,0.000023588816,0.0007481229,0.0007570531],"genre_scores_gemma":[0.06018658,0.0001824349,0.9315608,0.0040017636,0.002527031,0.00011661009,0.0000553274,0.00021012456,0.0011593115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935688,0.00003346465,0.0009081718,0.002754162,0.0010030702,0.0017323575],"domain_scores_gemma":[0.99605364,0.0010237021,0.0003811823,0.0018972824,0.00031089998,0.00033331168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009065612,0.0010373236,0.00095116766,0.0011903786,0.0005465661,0.0010185818,0.0047157938,0.00053747837,0.0000070706114],"category_scores_gemma":[0.0000609148,0.0009543685,0.000545244,0.0023219495,0.00079425,0.0009779837,0.002401372,0.0015241185,0.000021939633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016172686,0.0000073766964,0.000011397698,0.00007581602,0.000027672846,0.00011696023,0.00011424509,0.75711495,0.000038648654,0.04558339,0.00016606267,0.1967273],"study_design_scores_gemma":[0.00022651863,0.00017753085,0.000013100179,0.00037242495,0.000016004216,0.00010812974,5.0773373e-8,0.5960579,0.00007705826,0.40054348,0.0017339328,0.0006738598],"about_ca_topic_score_codex":0.000009992617,"about_ca_topic_score_gemma":0.00013777647,"teacher_disagreement_score":0.3549601,"about_ca_system_score_codex":0.00023083847,"about_ca_system_score_gemma":0.00019821752,"threshold_uncertainty_score":0.9992907},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017539277,0.0031426824,0.98659825,0.0028154003,0.0026838214,0.0004596025,0.000022969085,0.00043973658,0.0020835905],"genre_scores_gemma":[0.5446172,0.00027992038,0.44859108,0.0020164014,0.0031938383,0.00001641793,0.000014892701,0.00018895062,0.0010813258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943263,0.000041784035,0.00076066173,0.0026550698,0.001172363,0.0010438508],"domain_scores_gemma":[0.9973939,0.0004699657,0.00020279296,0.0014056328,0.0001607799,0.00036691938],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011683127,0.00092366175,0.0009614303,0.0011414099,0.0003771556,0.0012784457,0.0032304248,0.00051046954,0.000014341646],"category_scores_gemma":[0.000048866274,0.00076746946,0.00024158417,0.00083265355,0.00094150286,0.00043885774,0.0022460104,0.001977895,0.00007398326],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042973165,0.00001843102,0.00003935969,0.00015607793,0.000041733536,0.00031820132,0.0023185988,0.0072713397,0.000055910183,0.05760932,0.00002055718,0.9321462],"study_design_scores_gemma":[0.0002555488,0.00031326126,0.00023085589,0.0010655327,0.000025201876,0.00019316337,2.7134482e-7,0.695745,0.00033997314,0.29376766,0.007037821,0.0010257306],"about_ca_topic_score_codex":0.00007496089,"about_ca_topic_score_gemma":0.000036923193,"teacher_disagreement_score":0.93112046,"about_ca_system_score_codex":0.00015898839,"about_ca_system_score_gemma":0.00063381763,"threshold_uncertainty_score":0.9997583},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7572287,0.0026356787,0.20544088,0.015173527,0.0043874234,0.008828811,0.00029142897,0.0012592811,0.00475431],"genre_scores_gemma":[0.994521,0.00011213758,0.003581755,0.00051396445,0.00053041574,0.000081289174,0.000004226523,0.00007513833,0.000580038],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99543864,0.000095140495,0.0005536009,0.00209791,0.0011445768,0.0006701517],"domain_scores_gemma":[0.9973321,0.0005770288,0.0002601525,0.0010341221,0.0006080164,0.00018857198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014171691,0.0005812481,0.0007596305,0.0010470304,0.00039764182,0.00027801172,0.0015273825,0.00065145834,0.00003714441],"category_scores_gemma":[0.00023368145,0.00053195143,0.00011964374,0.0006922637,0.0023372027,0.0005872377,0.0006372134,0.0008653818,0.000010791319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013394594,0.0005495163,0.0016918557,0.00016204307,0.00010430491,0.00003771516,0.7389282,0.00017089097,0.000063369174,0.028696176,0.0002651072,0.2291969],"study_design_scores_gemma":[0.011416478,0.02021293,0.02959213,0.017440755,0.0010136877,0.00005794655,0.06747846,0.01557638,0.009050281,0.8012272,0.0150409015,0.011892856],"about_ca_topic_score_codex":0.00021748389,"about_ca_topic_score_gemma":0.007990198,"teacher_disagreement_score":0.77253103,"about_ca_system_score_codex":0.00028739052,"about_ca_system_score_gemma":0.00047011007,"threshold_uncertainty_score":0.9997132},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009019862,0.002976959,0.8547797,0.009006,0.006933059,0.0014623243,0.00007997991,0.00020283394,0.123657115],"genre_scores_gemma":[0.95014584,0.00007475064,0.014023646,0.008014841,0.0022841091,0.000107118605,0.000049132428,0.00014803685,0.025152553],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670947,0.00013541461,0.00040715942,0.001450461,0.0007271429,0.00057035557],"domain_scores_gemma":[0.9981849,0.0006545376,0.00026819296,0.00059321517,0.00020054153,0.00009857187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078998605,0.00052955624,0.0004344729,0.0004546183,0.00037150586,0.00035977334,0.00085010263,0.0002598345,0.0007986494],"category_scores_gemma":[0.000045531262,0.00028382512,0.0002044589,0.0004741238,0.0011196176,0.00021767589,0.0004300915,0.0011441048,0.0004996527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010564015,0.00015213057,0.000051091632,0.000055079046,0.0004225924,0.00035979587,0.2043875,0.0010001299,0.00038792615,0.39434713,0.00039317305,0.3983378],"study_design_scores_gemma":[0.00046134787,0.00030162057,0.00049666915,0.00054446247,0.00013458167,0.000078356294,0.0010290174,0.0010723319,0.0009410977,0.9936436,0.0007459604,0.0005509886],"about_ca_topic_score_codex":0.00015584561,"about_ca_topic_score_gemma":0.00018893172,"teacher_disagreement_score":0.94924384,"about_ca_system_score_codex":0.00057255983,"about_ca_system_score_gemma":0.0001619026,"threshold_uncertainty_score":0.9999614},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000327493,0.00040158402,0.9944561,0.0006745555,0.0019451404,0.0011094711,0.00001312686,0.0003288312,0.0010678894],"genre_scores_gemma":[0.18860537,0.000007741488,0.802222,0.0016256467,0.001109029,0.00007064039,0.0000042396473,0.00010439299,0.0062509403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544376,0.00007101986,0.00061321317,0.0020993722,0.0009062837,0.0008663669],"domain_scores_gemma":[0.9967661,0.00096111523,0.00034925583,0.0011280524,0.0005786511,0.00021680919],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002005211,0.00065571204,0.00066907733,0.0007910032,0.00040366678,0.0015961173,0.002598931,0.00036926815,0.000007748641],"category_scores_gemma":[0.00014188442,0.00057642604,0.00021459759,0.00035581607,0.00023290906,0.0014895357,0.00042158787,0.0012527661,0.000062828825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019845205,0.000014589943,0.0000014713229,0.000033785785,0.000023823457,0.00004238036,0.0010165995,0.70106804,0.00025208446,0.24799263,0.00002324039,0.04951153],"study_design_scores_gemma":[0.00021058023,0.00046750347,0.0000015219473,0.00063962716,0.000020967716,0.00003561983,6.759074e-7,0.8564874,0.00046927747,0.13892828,0.0021422154,0.000596339],"about_ca_topic_score_codex":0.000027896136,"about_ca_topic_score_gemma":0.000013338738,"teacher_disagreement_score":0.19223413,"about_ca_system_score_codex":0.0004656055,"about_ca_system_score_gemma":0.000837788,"threshold_uncertainty_score":0.9996687},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0677006,0.0036840066,0.46787822,0.2157145,0.028008943,0.005592781,0.00014950927,0.00066368596,0.21060774],"genre_scores_gemma":[0.9828691,0.0010303777,0.0095279,0.0034180733,0.0016716126,0.00003593562,0.0000053857566,0.000028815246,0.0014128108],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983595,0.00002962343,0.00019433735,0.0005750638,0.00047029255,0.00037116115],"domain_scores_gemma":[0.9989134,0.0004681695,0.000061632796,0.00018849046,0.00021581522,0.00015247114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014599112,0.00018632581,0.00022754728,0.00043167258,0.00082386576,0.00055179716,0.0004610584,0.00025552677,0.000020121137],"category_scores_gemma":[0.0003955447,0.00018897798,0.0000704273,0.00031330955,0.0013013014,0.0007522062,0.00038465773,0.0007700392,0.000008667433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043768837,0.00003135957,0.00018831951,0.00007511819,0.0000059307336,0.0000086626815,0.12599556,0.00079999916,0.000025766843,0.428784,0.000052805946,0.44402808],"study_design_scores_gemma":[0.000103395985,0.00006854353,0.0003206457,0.0005202823,0.000012137813,0.0000014598162,0.0003395842,0.002103371,0.000007979371,0.9840791,0.012059246,0.00038420406],"about_ca_topic_score_codex":0.0012079317,"about_ca_topic_score_gemma":0.012103316,"teacher_disagreement_score":0.91516846,"about_ca_system_score_codex":0.0004873661,"about_ca_system_score_gemma":0.0017013142,"threshold_uncertainty_score":0.7706299},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000065781365,0.0012432866,0.9905022,0.00011152662,0.0046910406,0.0006301897,0.0000353691,0.00019127982,0.0025293538],"genre_scores_gemma":[0.9826697,0.00004403315,0.009114598,0.00004637749,0.0015628554,0.000105766434,0.000040723444,0.00010298014,0.006312983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844915,0.0000039100464,0.00038905023,0.00060098607,0.00030121763,0.0002556943],"domain_scores_gemma":[0.99915874,0.00011090886,0.00007836504,0.00044138843,0.00015831053,0.000052292686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036550165,0.0002613304,0.0002687194,0.00040702737,0.000084098,0.00038467514,0.00047463618,0.00018862615,0.000010252835],"category_scores_gemma":[0.00001678415,0.0002553381,0.00010016109,0.00020031455,0.00012221996,0.00020089348,0.00007215735,0.00026400245,0.0001230555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008257244,0.000007448115,0.000002668772,0.00038011686,0.000041336756,0.00000507217,0.0006512086,0.21712206,0.0049353996,0.020739133,0.00024945915,0.7558578],"study_design_scores_gemma":[0.00012683136,0.00002679231,0.00008572669,0.0004297594,0.000023097833,0.000008104127,5.4748716e-7,0.9285009,0.0012573457,0.06377647,0.0054103113,0.00035410968],"about_ca_topic_score_codex":0.000010588763,"about_ca_topic_score_gemma":0.00011786755,"teacher_disagreement_score":0.9826039,"about_ca_system_score_codex":0.0002783817,"about_ca_system_score_gemma":0.000059025395,"threshold_uncertainty_score":0.99998987},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020351975,0.002729522,0.9826212,0.002180729,0.0026194325,0.00022470648,0.0000018413032,0.0001248212,0.009294222],"genre_scores_gemma":[0.51617223,0.000336946,0.47550097,0.001294927,0.0013709767,0.000039638995,0.00002874996,0.000052912892,0.0052026785],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997911,0.000016325763,0.00030537223,0.0010441233,0.00042496892,0.00029824727],"domain_scores_gemma":[0.99871475,0.00042165178,0.00011373437,0.0005196464,0.0001422891,0.00008793373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040024045,0.00030408165,0.00025521804,0.00078243134,0.00017752546,0.00057916524,0.0010269487,0.00018010683,0.000018416817],"category_scores_gemma":[0.00003854506,0.00026669164,0.000063878775,0.00044858927,0.0005200736,0.0005072919,0.00060026377,0.00033078092,0.00007619977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002570417,0.000027284548,0.0001433438,0.00008417181,0.000014479775,0.000014563736,0.0019274562,0.00084337237,0.00017828544,0.2598308,0.00007927597,0.7368544],"study_design_scores_gemma":[0.00011393537,0.00007849284,0.0011738889,0.0002623684,0.000012050819,0.00007630029,3.8498948e-7,0.19446579,0.00045075576,0.8022697,0.0007527564,0.00034355724],"about_ca_topic_score_codex":0.00002707217,"about_ca_topic_score_gemma":0.00012223661,"teacher_disagreement_score":0.7365108,"about_ca_system_score_codex":0.00015829087,"about_ca_system_score_gemma":0.0003477494,"threshold_uncertainty_score":0.99997854},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038525854,0.0003872785,0.963651,0.00014354868,0.0052946205,0.0005040769,0.000008184728,0.00051069836,0.02946208],"genre_scores_gemma":[0.6245011,0.000013704923,0.36370885,0.0003823459,0.0017747738,0.000040976123,0.000008443553,0.00010940763,0.0094603645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504787,0.00007803583,0.000766037,0.0018872229,0.0013977397,0.0008230872],"domain_scores_gemma":[0.99731743,0.00028170305,0.00039695305,0.0013760884,0.00038048168,0.00024734947],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001499873,0.0007274601,0.00071572955,0.0010467381,0.00037766734,0.0014254004,0.0031361585,0.00032633278,0.000011415371],"category_scores_gemma":[0.0000143679645,0.00061634893,0.00020008703,0.0005416638,0.00031016255,0.00145383,0.0014965762,0.0014615015,0.0002353278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003713573,0.000015429709,0.0000064074843,0.00012488598,0.000028846855,0.00021531369,0.0028036577,0.025913,0.00003543994,0.8251906,0.000005724316,0.14565697],"study_design_scores_gemma":[0.00013383427,0.00076171564,0.000023154063,0.002809686,0.000015807667,0.0001878416,0.000011430237,0.94603,0.0004320045,0.042110685,0.0065653436,0.0009184632],"about_ca_topic_score_codex":0.000059236423,"about_ca_topic_score_gemma":0.00003668026,"teacher_disagreement_score":0.920117,"about_ca_system_score_codex":0.0013514544,"about_ca_system_score_gemma":0.0006477333,"threshold_uncertainty_score":0.9996288},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037850787,0.008768195,0.978389,0.00022842453,0.009504161,0.00054836605,0.0000034880975,0.00031179516,0.002208704],"genre_scores_gemma":[0.29759675,0.0014787351,0.5673536,0.0014427673,0.012644828,0.0002390132,0.000019898662,0.00039282267,0.11883159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947223,0.00012448072,0.00083789637,0.0022771603,0.0011183445,0.0009197876],"domain_scores_gemma":[0.9974231,0.0006040533,0.00028495994,0.00112128,0.0003160551,0.0002505288],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017403684,0.0007353792,0.0007415837,0.0011797905,0.00034224297,0.0026364343,0.002592095,0.00035004414,0.0000045320844],"category_scores_gemma":[0.00013816661,0.0006381494,0.0001334793,0.0011673509,0.00047787538,0.0006853548,0.0021473344,0.0015256567,0.00015030499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029274127,0.000024932866,0.000040231134,0.00041854262,0.000046051482,0.0003580896,0.005832823,0.22104493,0.00012777373,0.31994528,0.00009928017,0.45205915],"study_design_scores_gemma":[0.000048871323,0.00023609589,0.000010804012,0.003100699,0.000014354685,0.00026369395,0.000004277605,0.9068306,0.0024923317,0.045699373,0.040257495,0.0010413703],"about_ca_topic_score_codex":0.00008818634,"about_ca_topic_score_gemma":0.000018415756,"teacher_disagreement_score":0.6857857,"about_ca_system_score_codex":0.0010315559,"about_ca_system_score_gemma":0.0010227426,"threshold_uncertainty_score":0.99960697},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076227053,0.0007025798,0.989891,0.00033647913,0.0008645456,0.00015876704,0.000013059608,0.00009581496,0.00031504862],"genre_scores_gemma":[0.8296519,0.00009916193,0.16943741,0.00022288885,0.00033135855,7.5416455e-7,0.000004899829,0.000029060022,0.00022256104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749637,0.000038020935,0.0004117151,0.0010607234,0.00062417216,0.00036897667],"domain_scores_gemma":[0.99865323,0.00039443947,0.00025355877,0.0004068181,0.00019015065,0.000101826045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000726935,0.0003554317,0.00041290035,0.0008199139,0.00016414578,0.00031624793,0.0007544163,0.00013297005,0.0000035161067],"category_scores_gemma":[0.00013503552,0.00033208667,0.000100756835,0.0004762003,0.00047208494,0.00028902772,0.0010740869,0.0010318857,0.00000629313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000800255,0.000045069974,0.000055784876,0.0002160588,0.000060536608,0.00015746754,0.001312533,0.14860022,0.0018029504,0.005000241,0.000001115446,0.84274],"study_design_scores_gemma":[0.00013499941,0.00016688244,0.000020884905,0.0010603216,0.000036549958,0.000064693886,0.0000029723292,0.9534149,0.0018118683,0.042846106,0.00010658152,0.0003332516],"about_ca_topic_score_codex":0.000028644787,"about_ca_topic_score_gemma":0.000023908106,"teacher_disagreement_score":0.84240675,"about_ca_system_score_codex":0.00016152953,"about_ca_system_score_gemma":0.00027337528,"threshold_uncertainty_score":0.9999131},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023453585,0.00073447835,0.98708475,0.0015526171,0.004996709,0.0007026276,0.000010169607,0.00038301724,0.002190271],"genre_scores_gemma":[0.7996111,0.000036225785,0.19842328,0.00064879423,0.00078158465,0.00007887304,0.0000029096675,0.000052063104,0.00036516433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942272,0.00007346085,0.0009714771,0.0027369082,0.001263317,0.00072766165],"domain_scores_gemma":[0.9966621,0.0006058188,0.00030951347,0.0018206488,0.00031890313,0.0002830121],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010212645,0.00073840807,0.0006689899,0.0007126116,0.00042709292,0.0017660838,0.0036173994,0.00035658746,0.000027971313],"category_scores_gemma":[0.000079991594,0.0006656274,0.00015478802,0.000810911,0.0012513867,0.0010549988,0.0030717452,0.0013117844,0.00014099396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011790978,0.0001295855,0.00014081974,0.00019372636,0.000068205416,0.00042133522,0.10149266,0.013946258,0.0007111784,0.37766513,0.000013988099,0.50520533],"study_design_scores_gemma":[0.00007456462,0.0003338324,0.0001873385,0.0013481071,0.000028615576,0.00038718493,0.00010451071,0.771963,0.004118391,0.21921545,0.0008587465,0.0013802305],"about_ca_topic_score_codex":0.00008331419,"about_ca_topic_score_gemma":0.00029979154,"teacher_disagreement_score":0.79726577,"about_ca_system_score_codex":0.0010524371,"about_ca_system_score_gemma":0.00042007514,"threshold_uncertainty_score":0.9995795},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04956615,0.024215586,0.82402134,0.017013416,0.0109926695,0.0023088169,0.000061731866,0.00082732557,0.07099297],"genre_scores_gemma":[0.97617286,0.0002460877,0.017968385,0.0026229674,0.000490639,0.000004941845,0.000015766143,0.00003142884,0.002446901],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819773,0.0000101864625,0.0003689531,0.00070804375,0.00040095637,0.0003141084],"domain_scores_gemma":[0.9989154,0.00023550336,0.00015723001,0.00038787123,0.00022159796,0.000082444734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002555996,0.00030209945,0.0005201002,0.00048361332,0.0001575165,0.00009384774,0.00030813558,0.0005566095,0.00012909398],"category_scores_gemma":[0.00007939266,0.0002448992,0.000097903205,0.00032896214,0.0011676183,0.00017090187,0.00016057557,0.0016650688,0.000039925664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001398953,0.0005062187,0.002563833,0.0025764552,0.00023189904,0.00037551744,0.019677706,0.00045909872,0.0016515857,0.06354955,0.00060866406,0.9076596],"study_design_scores_gemma":[0.0027413084,0.002546187,0.013917702,0.060251363,0.0006240959,0.0008527652,0.00014235733,0.0033970564,0.02530549,0.87286973,0.014716284,0.002635644],"about_ca_topic_score_codex":0.000008537497,"about_ca_topic_score_gemma":0.000021616705,"teacher_disagreement_score":0.9266067,"about_ca_system_score_codex":0.0001644652,"about_ca_system_score_gemma":0.00093154697,"threshold_uncertainty_score":0.9986699},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041343765,0.0007386049,0.9679561,0.00045278773,0.0045910426,0.00037554224,0.000014277448,0.00019469942,0.021542534],"genre_scores_gemma":[0.98890597,0.00003242444,0.0038657344,0.00037519351,0.00021666824,0.000014479291,0.000015305026,0.000040434825,0.006533808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997959,0.000057862246,0.0005842199,0.0007317624,0.0003748894,0.00029223075],"domain_scores_gemma":[0.99890786,0.0003432994,0.00023892667,0.00036377928,0.0001025205,0.0000436317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045991183,0.0002834102,0.00035914872,0.00071762234,0.0000856593,0.00007188902,0.00040861568,0.00023454947,0.00089443586],"category_scores_gemma":[0.00005141569,0.00025886754,0.000094167066,0.00035224235,0.00029763134,0.00019291457,0.00016683152,0.0011556764,0.00019878357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003257858,0.00023058438,0.0009217193,0.00041730006,0.00012594133,0.00021514221,0.055207107,0.24841656,0.0018357495,0.020863835,0.000093892835,0.67134637],"study_design_scores_gemma":[0.0012684927,0.0012546951,0.007617046,0.0019486672,0.00004459059,0.00023051543,0.000018456854,0.7516798,0.0038432502,0.17933305,0.051421423,0.0013400266],"about_ca_topic_score_codex":0.00030173623,"about_ca_topic_score_gemma":0.0010454082,"teacher_disagreement_score":0.98477155,"about_ca_system_score_codex":0.00020020427,"about_ca_system_score_gemma":0.000068374866,"threshold_uncertainty_score":0.99998635},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038219892,0.0019498699,0.98958105,0.00013644106,0.0047718226,0.00026320908,0.0000022352492,0.00034015146,0.002573039],"genre_scores_gemma":[0.24433042,0.00006875754,0.72503644,0.0006699044,0.005315017,0.000013489846,0.0000061574588,0.00015279895,0.024407038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953461,0.000065492204,0.0007114183,0.0018631774,0.0011616345,0.0008521385],"domain_scores_gemma":[0.998089,0.00041137997,0.00036082114,0.000684964,0.0002857701,0.00016805487],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014912745,0.00064925227,0.0006312695,0.00087315985,0.0006443471,0.0018067484,0.0021537829,0.00033363074,0.00002600054],"category_scores_gemma":[0.00011056852,0.00057896634,0.00019987623,0.000578581,0.00041377867,0.0007248245,0.0012409051,0.001823188,0.00011732302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014260298,0.000006918649,0.00004927137,0.000070956936,0.000028785134,0.0003991491,0.0019433054,0.66112703,0.0012768048,0.10409488,0.0000035274147,0.23099793],"study_design_scores_gemma":[0.000081160295,0.00014654236,0.000003817309,0.0014431056,0.000010637518,0.00022212042,0.0000020751772,0.9712455,0.0007814644,0.017182427,0.008166811,0.0007143202],"about_ca_topic_score_codex":0.00014029829,"about_ca_topic_score_gemma":0.000026946864,"teacher_disagreement_score":0.31011847,"about_ca_system_score_codex":0.0005625822,"about_ca_system_score_gemma":0.0005959046,"threshold_uncertainty_score":0.99966615},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7606494,0.00033283353,0.22868687,0.00078199065,0.0019091584,0.0007029362,0.00006866231,0.00007616001,0.006791973],"genre_scores_gemma":[0.99778986,0.000011022028,0.0005082743,0.0011635536,0.00024156473,0.000021081614,0.000004583496,0.000011912936,0.00024816708],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99832547,0.00008070033,0.00035554456,0.0007029731,0.0003303861,0.00020494591],"domain_scores_gemma":[0.99786776,0.0015118375,0.00013394066,0.00029346652,0.00013550682,0.00005747553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033563457,0.00023657175,0.00027101222,0.00036032408,0.000079034915,0.00008564243,0.00034471843,0.00015984062,0.00043775392],"category_scores_gemma":[0.00024943083,0.00015205765,0.000067273795,0.0002504451,0.0003389911,0.000086418215,0.00015982654,0.0004798465,0.0001055227],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024753711,0.00035318144,0.0007504531,0.000036041012,0.00013179825,0.00015033575,0.43292302,0.016591756,0.012592204,0.0112397885,0.00026468874,0.5224914],"study_design_scores_gemma":[0.0037157843,0.006747494,0.5704198,0.010815402,0.0000533183,0.00015413816,0.0007892309,0.24852116,0.008220042,0.14592472,0.0013225016,0.0033164187],"about_ca_topic_score_codex":0.0005049938,"about_ca_topic_score_gemma":0.00009450065,"teacher_disagreement_score":0.5696693,"about_ca_system_score_codex":0.00021817806,"about_ca_system_score_gemma":0.00010902986,"threshold_uncertainty_score":0.6200731},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015328758,0.07487134,0.91800225,0.0005406998,0.00089710276,0.001443919,0.0000035509509,0.00007010209,0.004155723],"genre_scores_gemma":[0.18043223,0.0056593143,0.79268366,0.012113494,0.00060926034,0.0003345646,0.000029046238,0.00018029414,0.007958104],"study_design_codex":"systematic_review","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965782,0.00006483087,0.00096178066,0.0012215471,0.00077338534,0.00040025066],"domain_scores_gemma":[0.9971949,0.00027564118,0.00037629702,0.0018995585,0.00016685238,0.00008678417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020497967,0.00036816127,0.0009234578,0.00075747166,0.000055067463,0.0003609087,0.005242052,0.00017831588,0.000009161162],"category_scores_gemma":[0.00013150366,0.00031789974,0.00011241296,0.0007339118,0.000110682355,0.00083415804,0.0031563821,0.0005925865,0.00002271811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056306676,0.00019570047,0.000005663754,0.44358742,0.000030018564,0.00012772784,0.009576014,0.050030597,0.000034054698,0.32116714,0.00008094925,0.17515908],"study_design_scores_gemma":[0.0000701011,0.000048200847,0.0000010090375,0.24155569,0.00002010065,0.00004658209,0.0000012206928,0.67229843,0.000047218462,0.08557714,0.000049067265,0.00028525273],"about_ca_topic_score_codex":0.00006938328,"about_ca_topic_score_gemma":0.00004317715,"teacher_disagreement_score":0.62226784,"about_ca_system_score_codex":0.00029361687,"about_ca_system_score_gemma":0.00089598366,"threshold_uncertainty_score":0.9999273},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016418473,0.0048788153,0.9372196,0.0022733249,0.010461894,0.0005928502,0.00005650764,0.0001542471,0.042720877],"genre_scores_gemma":[0.906068,0.00013017656,0.009073107,0.0018171589,0.0026828954,0.00007048434,0.0003746456,0.000120328965,0.079663195],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9976171,0.000034833694,0.00039436462,0.0011640352,0.0004494498,0.0003401994],"domain_scores_gemma":[0.99808407,0.00045811455,0.00016193585,0.0009693958,0.00022701341,0.0000994983],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00085028046,0.0003065939,0.00026198657,0.0005107677,0.000084448504,0.00021504307,0.00089515286,0.00029703663,0.0007557086],"category_scores_gemma":[0.00004587425,0.00028426267,0.000084187894,0.00041626988,0.00050208525,0.000086461056,0.00015283166,0.00059242157,0.0013880174],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024548652,0.00012066973,0.008666761,0.00009734807,0.000060829196,0.00006175597,0.0038152724,0.0006360734,0.00004365699,0.15282157,0.00061964226,0.8330319],"study_design_scores_gemma":[0.00033680032,0.0002236887,0.7908149,0.00081010774,0.000055981858,0.00019710539,0.0000012675507,0.0037002387,0.00009072357,0.18573076,0.016618509,0.0014199576],"about_ca_topic_score_codex":0.000055300632,"about_ca_topic_score_gemma":0.00025005176,"teacher_disagreement_score":0.92814654,"about_ca_system_score_codex":0.00020677973,"about_ca_system_score_gemma":0.00027566127,"threshold_uncertainty_score":0.99996096},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01102457,0.00083744054,0.98384,0.0024307715,0.0004595379,0.00060757285,0.000003414923,0.00012567236,0.00067102665],"genre_scores_gemma":[0.8582418,0.00003958161,0.1401216,0.000571009,0.0008557424,0.00002832232,0.0000043458786,0.000038710154,0.00009892803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736553,0.0000773971,0.00039171075,0.0013198049,0.00039583398,0.00044971693],"domain_scores_gemma":[0.9974625,0.0015716401,0.00015028703,0.0005162581,0.00012418255,0.00017511414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024220536,0.00035508818,0.00036057836,0.00080964266,0.0001395657,0.0008918068,0.00082367106,0.00024653846,9.796272e-7],"category_scores_gemma":[0.0018954481,0.00035586095,0.000031032978,0.00084823987,0.00017167567,0.0006709509,0.001336874,0.0016139256,0.000006284189],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069422235,0.000017870048,0.00007591047,0.00006504098,0.000010170482,0.000009374823,0.0049965694,0.0027092248,0.00044773892,0.028390761,0.0000059808353,0.9632644],"study_design_scores_gemma":[0.0017678437,0.0010637335,0.007028411,0.01439086,0.00022411982,0.001126174,0.00006781531,0.5443864,0.007915038,0.33097747,0.08503158,0.0060205893],"about_ca_topic_score_codex":0.00003885675,"about_ca_topic_score_gemma":0.000008055507,"teacher_disagreement_score":0.9572438,"about_ca_system_score_codex":0.00029832905,"about_ca_system_score_gemma":0.0005305497,"threshold_uncertainty_score":0.9998893},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30584213,0.00028425988,0.6824289,0.007175866,0.0014046886,0.001559047,0.000012361021,0.00041627808,0.00087647664],"genre_scores_gemma":[0.9643602,0.000061819985,0.032375038,0.0013772231,0.00018931476,0.00012521059,4.192645e-7,0.000057822384,0.0014529676],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995927,0.000050303002,0.0005533761,0.0012917744,0.001150166,0.0010273941],"domain_scores_gemma":[0.99698937,0.00047360393,0.00028416506,0.0016400113,0.00047498685,0.0001378842],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00090138655,0.00048304847,0.0005216835,0.00081925245,0.0007692196,0.00036713507,0.0047491244,0.0006974374,0.000028935709],"category_scores_gemma":[0.0006234043,0.00031686644,0.00012262653,0.0019315383,0.0072479853,0.0005801162,0.0017593715,0.0013010795,0.000014787574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038641145,0.000076617194,0.0073363963,0.00009152354,0.00009870459,0.00009017842,0.63924754,0.079838805,0.0010616208,0.14923516,0.00016820773,0.122716606],"study_design_scores_gemma":[0.00072004565,0.0003567454,0.0014286564,0.004268951,0.00012498102,0.000061637096,0.004025859,0.32813853,0.01056658,0.63531065,0.011704356,0.0032930057],"about_ca_topic_score_codex":0.000417567,"about_ca_topic_score_gemma":0.003448301,"teacher_disagreement_score":0.6585181,"about_ca_system_score_codex":0.0006062752,"about_ca_system_score_gemma":0.00063261745,"threshold_uncertainty_score":0.99992836},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0734853,0.00021155087,0.914297,0.0016485967,0.007126892,0.0016547415,0.000016999968,0.00018209184,0.0013768256],"genre_scores_gemma":[0.7741971,0.000017195865,0.20939583,0.002839459,0.002231947,0.00008438709,0.000036625454,0.00012104445,0.011076401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979116,0.000008580404,0.00039291102,0.0008891721,0.0004642941,0.00033346517],"domain_scores_gemma":[0.9987348,0.00051005173,0.00011869859,0.0002758012,0.00022245277,0.00013824768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033082237,0.00031017754,0.00045546237,0.00075899425,0.00013655625,0.0001136679,0.00019604721,0.00023022552,0.000022315578],"category_scores_gemma":[0.00052640715,0.00024304965,0.00021159775,0.00025068515,0.00019465103,0.000114907474,0.00015863245,0.0006794465,0.000032840373],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006341612,0.00001531586,0.0010709306,0.00027974168,0.000028367127,0.000009605324,0.0024062432,0.0052156695,0.00029763367,0.0011095055,0.00001323084,0.98949033],"study_design_scores_gemma":[0.012007489,0.012277933,0.056615304,0.023199491,0.000431939,0.00048438527,0.00014241597,0.81487393,0.0065827635,0.037156846,0.031939473,0.0042880177],"about_ca_topic_score_codex":0.000010077336,"about_ca_topic_score_gemma":0.000012314424,"teacher_disagreement_score":0.9852023,"about_ca_system_score_codex":0.0002724628,"about_ca_system_score_gemma":0.00022725448,"threshold_uncertainty_score":0.9911277},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08476312,0.0035328954,0.6622229,0.0005700784,0.020019455,0.0020315745,0.00050721224,0.0004815811,0.22587118],"genre_scores_gemma":[0.99478257,0.0000044215044,0.0014983753,0.0008937411,0.00038219697,0.000007076073,0.00006968507,0.00006570959,0.002296239],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966798,0.00003837081,0.00062997144,0.0012326156,0.00069841073,0.0007208512],"domain_scores_gemma":[0.99793357,0.0008256433,0.00030390927,0.0006732081,0.00009168275,0.00017200655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000926426,0.00048762356,0.00059283705,0.0007801863,0.00016004934,0.0002985804,0.0008244525,0.0003067204,0.000076425524],"category_scores_gemma":[0.000046736735,0.0004413763,0.000101935075,0.00035958068,0.00045381454,0.0002535458,0.0003915365,0.0010175062,0.00016347959],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001240677,0.000689601,0.022022242,0.0020728796,0.0004693769,0.0028285964,0.06267196,0.03825363,0.00060468144,0.04270602,0.00121961,0.8252207],"study_design_scores_gemma":[0.017260842,0.0274939,0.25622004,0.12041142,0.00059336855,0.0025009054,0.00030417656,0.1616956,0.01462639,0.35459763,0.022081342,0.022214405],"about_ca_topic_score_codex":0.00020654405,"about_ca_topic_score_gemma":0.000036614085,"teacher_disagreement_score":0.91001946,"about_ca_system_score_codex":0.00025174316,"about_ca_system_score_gemma":0.00026376708,"threshold_uncertainty_score":0.9998038},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030629506,0.00020453948,0.9933814,0.0001779954,0.0014595415,0.0006185667,0.000018025512,0.00027941418,0.003554268],"genre_scores_gemma":[0.9481983,0.000007443529,0.05115961,0.00010882731,0.00031634,0.000019351608,0.000006984526,0.000048185902,0.0001349623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983577,0.000018436307,0.00033316744,0.00052299094,0.0005101566,0.0002575574],"domain_scores_gemma":[0.9991916,0.00015149155,0.000065831446,0.00032438277,0.00016841598,0.00009827109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033280862,0.00030674282,0.00037056959,0.00050104834,0.000046497298,0.00011147474,0.0003663441,0.00020482394,0.000021577209],"category_scores_gemma":[0.00004293743,0.0002915923,0.00006474236,0.00040360945,0.00014974964,0.00012328904,0.00013045254,0.00047666527,0.00008051507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069221,0.000026176951,0.000014647859,0.0013793525,0.00005407065,0.000112961825,0.0024722063,0.43544725,0.016161272,0.0076154894,0.00008848857,0.53655887],"study_design_scores_gemma":[0.00013967599,0.0003260152,0.000023162132,0.003572162,0.000030297333,0.000024981917,6.803396e-7,0.79611665,0.18435265,0.0144093605,0.00040024295,0.0006040945],"about_ca_topic_score_codex":0.00004762608,"about_ca_topic_score_gemma":0.0001458491,"teacher_disagreement_score":0.947892,"about_ca_system_score_codex":0.0002849391,"about_ca_system_score_gemma":0.00021100159,"threshold_uncertainty_score":0.9999536},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021073416,0.00019495032,0.97996783,0.009925573,0.0027703338,0.0018818944,0.000013603836,0.00061091396,0.004424147],"genre_scores_gemma":[0.687603,0.00018815394,0.29295388,0.015949082,0.0010324946,0.000096475014,0.000032422246,0.000105659485,0.002038865],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99569976,0.00005895163,0.00075004756,0.0010079676,0.0014319789,0.0010512735],"domain_scores_gemma":[0.9980386,0.00023747706,0.00033400682,0.00078848796,0.00028155185,0.000319873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023801546,0.0004402329,0.00047509544,0.0015011969,0.00066956045,0.0005441751,0.0020985438,0.0004914221,0.00007362317],"category_scores_gemma":[0.00037009857,0.00043966473,0.000093575545,0.00097129564,0.0009112403,0.00094423373,0.00089731853,0.00085666205,0.00048372304],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014750519,0.000019723817,0.000102012295,0.00012352147,0.0000163565,0.00003933625,0.06377901,0.0014939264,0.000006061283,0.008415884,0.0008878004,0.92510164],"study_design_scores_gemma":[0.0030829199,0.0033370287,0.0011766673,0.019161753,0.00010576289,0.0001834131,0.00020070717,0.04153762,0.0012267024,0.5369627,0.38663062,0.0063941143],"about_ca_topic_score_codex":0.00039289126,"about_ca_topic_score_gemma":0.0016637156,"teacher_disagreement_score":0.9187075,"about_ca_system_score_codex":0.0013403929,"about_ca_system_score_gemma":0.0022341034,"threshold_uncertainty_score":0.9998055},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9947486,0.000769226,0.003228028,0.00003052798,0.0003171535,0.00037199236,0.000014443822,0.0000065533536,0.0005134901],"genre_scores_gemma":[0.99956703,0.000013959981,0.00026388254,0.000020284424,0.0000592895,0.000013331243,5.170276e-7,0.0000068283416,0.000054864013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989282,0.00007416794,0.00021221202,0.00042370838,0.0001710673,0.00019064538],"domain_scores_gemma":[0.9990833,0.0005323046,0.00013437652,0.00017566961,0.000035819532,0.00003853847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002879063,0.00018705487,0.00046058843,0.00014235795,0.0000587729,0.000035473127,0.00020828578,0.000121103396,0.0000062400923],"category_scores_gemma":[0.00002784078,0.000105098436,0.00007936143,0.00009188937,0.0012255216,0.00007806514,0.00018120575,0.0004513136,7.4246447e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040812336,0.00008283557,0.00885563,0.0007493729,0.000018148918,0.000053016458,0.030641831,0.000044722106,0.00018019583,0.0051293755,0.0000016499797,0.95383507],"study_design_scores_gemma":[0.007864876,0.006797401,0.3808313,0.013803344,0.00026099756,0.00020752249,0.00009876735,0.52104366,0.0030716478,0.06457135,0.000010219421,0.0014388971],"about_ca_topic_score_codex":0.00027649134,"about_ca_topic_score_gemma":0.00022716289,"teacher_disagreement_score":0.9523962,"about_ca_system_score_codex":0.000024248415,"about_ca_system_score_gemma":0.000025117668,"threshold_uncertainty_score":0.45154852},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004239686,0.010745826,0.94910467,0.0005527986,0.018227948,0.0012670102,0.00004548922,0.000108477,0.015708106],"genre_scores_gemma":[0.91886795,0.000056788125,0.07323812,0.00007726945,0.00037469305,0.000024412064,0.000016037975,0.00004103927,0.0073036687],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9854599,0.00012574426,0.0019335878,0.0066873007,0.0051412717,0.0006521601],"domain_scores_gemma":[0.992155,0.0010567915,0.0005795193,0.0055721034,0.00048249008,0.0001540704],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.025499588,0.0004933177,0.00084260525,0.0036432086,0.00022414258,0.001962848,0.004225959,0.00016821793,0.00007127514],"category_scores_gemma":[0.0006259709,0.00040612856,0.00019607115,0.0020976632,0.0015137297,0.0004169753,0.0035355387,0.0005250798,0.00020844194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017934282,0.00012050449,0.00024216711,0.00017257652,0.000017627652,0.00014427377,0.001218386,0.4127761,0.000026476555,0.04510744,0.00019630636,0.5399602],"study_design_scores_gemma":[0.0002716405,0.000067692294,0.0015292128,0.0019537534,0.000013533563,0.000017937486,0.000014890225,0.41654822,0.00009987051,0.5759099,0.0030989407,0.00047442867],"about_ca_topic_score_codex":0.000034181638,"about_ca_topic_score_gemma":0.00006183162,"teacher_disagreement_score":0.91462827,"about_ca_system_score_codex":0.00041254272,"about_ca_system_score_gemma":0.00024253009,"threshold_uncertainty_score":0.99983907},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042558953,0.008235212,0.59093624,0.019522062,0.035663657,0.0012708168,0.000025756302,0.00046129996,0.34345937],"genre_scores_gemma":[0.81695694,0.0009830737,0.009738208,0.0076703057,0.0073899217,0.000037217556,0.00001195008,0.00010719524,0.15710516],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672216,0.000058038888,0.0003395305,0.00094169955,0.0012480733,0.00069050613],"domain_scores_gemma":[0.99818677,0.0007181257,0.00013607147,0.0006036798,0.0001575581,0.00019778733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016207588,0.00036795367,0.00035821288,0.00031216242,0.00034089136,0.0006548748,0.0023488854,0.00035236264,0.00033063215],"category_scores_gemma":[0.00022537836,0.0002532705,0.00015591888,0.000323717,0.002231775,0.00019636926,0.00066708185,0.0009130072,0.00028138267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013091495,0.000030239476,0.00008952006,0.00012190824,0.000068727146,0.00014936789,0.36717305,0.0004141552,0.00007626329,0.21001038,0.007001277,0.41485202],"study_design_scores_gemma":[0.00011766928,0.000077444914,0.000030375104,0.00047760925,0.000042366144,0.000019892164,0.0001325397,0.0019487578,0.00043218143,0.56370705,0.43242174,0.00059235067],"about_ca_topic_score_codex":0.00044338213,"about_ca_topic_score_gemma":0.0036220485,"teacher_disagreement_score":0.81653136,"about_ca_system_score_codex":0.00025741925,"about_ca_system_score_gemma":0.0010316434,"threshold_uncertainty_score":0.99999195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04169855,0.008625039,0.8713104,0.014131087,0.016443266,0.036527965,0.0008627106,0.00018866391,0.010212306],"genre_scores_gemma":[0.9899817,0.000004539002,0.007827289,0.001141783,0.00017641055,0.00064717996,0.000036374302,0.00003332909,0.00015139607],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977251,0.000102473154,0.0005358157,0.00067075825,0.00052171515,0.00044410222],"domain_scores_gemma":[0.9986738,0.0006764293,0.00020149843,0.00029533004,0.00006739521,0.000085525025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029548313,0.00021819868,0.00032058457,0.00034062372,0.00009951404,0.00011074679,0.0004637939,0.0001627116,0.000053291347],"category_scores_gemma":[0.0000665574,0.00017528914,0.000056701323,0.00027492418,0.00040675275,0.00008990737,0.00021456099,0.000405914,0.000011947516],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000351031,0.00014032332,0.0002597371,0.00018438778,0.000055089327,0.000006257364,0.021109002,0.00032785977,0.000007860253,0.011087352,0.00024591072,0.9662252],"study_design_scores_gemma":[0.0023686842,0.0038062697,0.004633608,0.005041296,0.00003403996,0.000029974914,0.000023851047,0.03587197,0.0001977979,0.94432837,0.0030958024,0.00056836463],"about_ca_topic_score_codex":0.000053975265,"about_ca_topic_score_gemma":0.00010821723,"teacher_disagreement_score":0.9656568,"about_ca_system_score_codex":0.0008571953,"about_ca_system_score_gemma":0.00045654585,"threshold_uncertainty_score":0.7148084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013369511,0.0024715222,0.99225605,0.0008758309,0.0034728004,0.00041233093,0.000025055626,0.0001404096,0.00021228174],"genre_scores_gemma":[0.22013578,0.000059885908,0.7776227,0.00019471742,0.0018306547,0.0000069325833,0.00004671197,0.000045518347,0.00005711385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959031,0.00002822593,0.00056325,0.0021152736,0.00084244326,0.000547729],"domain_scores_gemma":[0.9975464,0.0005356389,0.00016283008,0.0013109448,0.00031001045,0.00013419286],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019462574,0.00039873738,0.00056308805,0.0007334134,0.0003073274,0.0013972971,0.0022428776,0.00018839224,0.000003447824],"category_scores_gemma":[0.0002986354,0.00035499118,0.00008563278,0.0005525887,0.00039704496,0.0009858045,0.0019733133,0.0004079986,0.0000054331394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020672729,0.00002229004,0.000056926503,0.00097613246,0.00009431918,0.00009457499,0.001698243,0.0034875106,0.0014811339,0.112060405,0.000032228974,0.87997556],"study_design_scores_gemma":[0.00021039486,0.000047866706,0.000016815457,0.0024849174,0.000071504364,0.00007791688,0.0000019996228,0.9852128,0.00077216275,0.010294618,0.00038050098,0.00042849727],"about_ca_topic_score_codex":0.00003222926,"about_ca_topic_score_gemma":0.000022560658,"teacher_disagreement_score":0.9817253,"about_ca_system_score_codex":0.00020515465,"about_ca_system_score_gemma":0.0003244321,"threshold_uncertainty_score":0.9998902},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57588476,0.000081837075,0.4154937,0.007175037,0.0004700705,0.00066522404,0.000024268451,0.00009064523,0.00011445194],"genre_scores_gemma":[0.97931325,0.0000019064033,0.018000307,0.0023920983,0.000244833,0.00002284232,0.0000016068781,0.000016185379,0.000006946447],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972167,0.000095192154,0.00035271412,0.00096668577,0.00067723496,0.00069149263],"domain_scores_gemma":[0.99730337,0.0017536499,0.000040558134,0.00057848485,0.0000672307,0.00025669826],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0012114258,0.00022216392,0.00025937965,0.00036898465,0.0005665828,0.058217574,0.0040953597,0.00006095156,0.000007877631],"category_scores_gemma":[0.003050596,0.00017219588,0.00004429238,0.003440702,0.001033524,0.016697934,0.0061860546,0.00028922083,0.0000063835364],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017456505,0.00004603265,0.09691776,0.00004228391,0.000006107544,0.00001708229,0.03671259,0.030367512,0.000042406326,0.0017472005,0.0002389815,0.8338446],"study_design_scores_gemma":[0.0010876245,0.00043422446,0.29878196,0.005642553,0.000022651124,0.00004456158,0.0013024326,0.31969398,0.0018595342,0.35747775,0.010668908,0.0029838074],"about_ca_topic_score_codex":0.0023367854,"about_ca_topic_score_gemma":0.0031591144,"teacher_disagreement_score":0.8308608,"about_ca_system_score_codex":0.00029915356,"about_ca_system_score_gemma":0.00051906204,"threshold_uncertainty_score":0.997055},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015293671,0.0002860026,0.980672,0.0057373317,0.002332964,0.000504255,0.00012572439,0.000113290684,0.010075477],"genre_scores_gemma":[0.47507423,0.000110626366,0.50939304,0.012020977,0.0012330201,0.00004358033,0.0007278504,0.0001349683,0.001261702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952978,0.000067389105,0.00079952984,0.0023839276,0.00096205116,0.00048929715],"domain_scores_gemma":[0.9908691,0.0008578282,0.00043684477,0.0074070487,0.00039496482,0.000034207653],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0022190604,0.00048326136,0.0005037239,0.0015166175,0.00011573393,0.00044868415,0.023774937,0.00032606273,0.00003447165],"category_scores_gemma":[0.00021375368,0.00036722966,0.00004328473,0.0021669297,0.0006943366,0.0031699701,0.012241556,0.0022488697,0.00022805505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003447995,0.0002394832,0.00007284874,0.00034936864,0.00012155308,0.0007806953,0.008031817,0.002585383,0.0010552682,0.27829233,0.0025671462,0.7058696],"study_design_scores_gemma":[0.00018626172,0.00014589427,0.00011566376,0.0012581603,0.000019608955,0.0002940487,0.000004207006,0.7326583,0.0007085093,0.25112483,0.0129255755,0.0005589277],"about_ca_topic_score_codex":0.00006600459,"about_ca_topic_score_gemma":0.0013381473,"teacher_disagreement_score":0.7300729,"about_ca_system_score_codex":0.00024219569,"about_ca_system_score_gemma":0.0004956196,"threshold_uncertainty_score":0.999878},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017435495,0.0005858432,0.97930425,0.00871031,0.0015716649,0.0007666875,0.000002127101,0.00033790147,0.008546857],"genre_scores_gemma":[0.59087485,0.0001516984,0.40199575,0.0041385256,0.001008747,0.00010009605,0.0000032272158,0.00011651069,0.0016106074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950941,0.00020694906,0.00039225383,0.00221532,0.0013189953,0.00077237724],"domain_scores_gemma":[0.9956028,0.0015604503,0.00016122598,0.0017374639,0.0008759146,0.00006214604],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0028863566,0.000514817,0.00037064662,0.0020965692,0.0008995373,0.0012195172,0.0038897397,0.00047629056,0.000012157182],"category_scores_gemma":[0.00020455521,0.0003630787,0.000082101375,0.0022357055,0.0039741956,0.0010802808,0.0016884122,0.003815301,0.00008995332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012147246,0.000030501535,0.0000014052475,0.000014783084,0.00002484399,0.00010999861,0.00947266,0.0022649262,0.00030570917,0.9226026,0.00009567319,0.065064736],"study_design_scores_gemma":[0.00008527423,0.00074409624,0.00001958269,0.00032184034,0.000005050543,0.00010624159,0.000013103162,0.24548829,0.0016951631,0.7496701,0.0015249205,0.0003263404],"about_ca_topic_score_codex":0.0000685865,"about_ca_topic_score_gemma":0.000053931555,"teacher_disagreement_score":0.59070045,"about_ca_system_score_codex":0.00069654593,"about_ca_system_score_gemma":0.00043010482,"threshold_uncertainty_score":0.9998821},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010009476,0.00028245134,0.98755133,0.00021397576,0.0013968848,0.00016852625,0.000008490519,0.00014581266,0.00022307032],"genre_scores_gemma":[0.5666383,0.00009491132,0.43191504,0.00023263566,0.0008501057,0.0000042911583,0.000048204914,0.000035809622,0.00018070788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712276,0.00007148677,0.0004743761,0.0013300221,0.00065360934,0.00034771598],"domain_scores_gemma":[0.99902666,0.0001295474,0.0002011473,0.00044886195,0.00012829041,0.00006550681],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037839808,0.00036095912,0.00036801922,0.00085757155,0.00023403602,0.0006796453,0.00072208233,0.00029229771,0.000036928315],"category_scores_gemma":[0.00007472846,0.00034063228,0.00013859839,0.0007506974,0.00018140298,0.00096692273,0.0005003338,0.0009078839,0.00005191795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031123611,0.00003199082,0.000011040752,0.000023406084,0.000008030206,0.000056775345,0.0013806198,0.19755556,0.102118865,0.0001544108,0.0000010570641,0.6986551],"study_design_scores_gemma":[0.00012678157,0.000040870793,0.00001764204,0.0006108395,0.000013600207,0.000014586873,0.0000016259781,0.94137913,0.028903572,0.028415183,0.00012585164,0.00035030788],"about_ca_topic_score_codex":0.0001523861,"about_ca_topic_score_gemma":0.00038631907,"teacher_disagreement_score":0.7438236,"about_ca_system_score_codex":0.00040642035,"about_ca_system_score_gemma":0.00012754703,"threshold_uncertainty_score":0.9999046},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011775632,0.014161522,0.9812747,0.00018166334,0.0018693715,0.0003669636,0.0000038748017,0.0000677515,0.001956379],"genre_scores_gemma":[0.52470744,0.0034013113,0.4616717,0.0004905198,0.0017555708,0.000067819616,0.000019979863,0.000108999455,0.007776643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760234,0.000038715578,0.0005639651,0.00089763955,0.0006708339,0.00022649326],"domain_scores_gemma":[0.9984964,0.00023389682,0.0003916299,0.0004970369,0.00031957778,0.00006146986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009632516,0.00027889543,0.00043199782,0.00050619326,0.00011052163,0.00024624306,0.0007379941,0.00014200613,0.0000044044546],"category_scores_gemma":[0.000067745954,0.000249981,0.000070711314,0.00041128587,0.00023048017,0.00041770615,0.0003822161,0.00038338025,0.000016502212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029085927,0.00000780006,0.000025545678,0.0013525874,0.000026595493,0.000016844022,0.000768773,0.017075382,0.00018824209,0.7139692,0.000014778136,0.26655138],"study_design_scores_gemma":[0.00026289612,0.0005685993,0.0001830648,0.06651462,0.00007815161,0.00058579387,0.0000050840745,0.8412415,0.0026528505,0.053981144,0.03243918,0.0014871648],"about_ca_topic_score_codex":0.000024469024,"about_ca_topic_score_gemma":0.0000017031432,"teacher_disagreement_score":0.82416606,"about_ca_system_score_codex":0.00018342427,"about_ca_system_score_gemma":0.00024148598,"threshold_uncertainty_score":0.99999523},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06906286,0.00015536528,0.9206597,0.0003957557,0.00244448,0.0009930446,0.0000048407514,0.00084475917,0.0054391674],"genre_scores_gemma":[0.9233037,0.0000063945736,0.07619341,0.000062598854,0.00015974969,0.0000067895053,0.0000031848617,0.000048630187,0.00021553994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945134,0.00007168667,0.0006828446,0.0025775998,0.0012758471,0.00087864435],"domain_scores_gemma":[0.9963856,0.00055038714,0.0006847225,0.0014090328,0.0008780884,0.000092181566],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010034904,0.00085554685,0.00086345186,0.0040933434,0.0008250995,0.0020544853,0.005692137,0.00046446853,0.000019185482],"category_scores_gemma":[0.00010196031,0.00088350166,0.00011556022,0.0024180682,0.0029635462,0.0024173176,0.0040927124,0.003210945,0.00005317578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043597247,0.0005116151,0.021132356,0.00016450883,0.00051273376,0.004532499,0.008832179,0.007332124,0.00079024106,0.8234145,0.000008114177,0.13272554],"study_design_scores_gemma":[0.0022217063,0.005225978,0.0024831865,0.004146844,0.00023194816,0.00083612127,0.0040217955,0.27622163,0.001895381,0.69898546,0.0001451817,0.0035847723],"about_ca_topic_score_codex":0.00008232367,"about_ca_topic_score_gemma":0.0011857196,"teacher_disagreement_score":0.85424083,"about_ca_system_score_codex":0.0016631254,"about_ca_system_score_gemma":0.0007805199,"threshold_uncertainty_score":0.99974984},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27049202,0.010089477,0.63791364,0.031626757,0.021429325,0.002653079,0.00012707015,0.00021357046,0.025455033],"genre_scores_gemma":[0.98985124,0.000013562203,0.004162427,0.00017230363,0.0003137931,0.000017986018,0.000014382133,0.000026423291,0.0054278923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9980886,0.000020516081,0.00027128516,0.0007439979,0.0005914896,0.0002841216],"domain_scores_gemma":[0.9988195,0.00033382094,0.00014701237,0.0005301306,0.00011027324,0.00005930882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005069438,0.00024515265,0.00030080974,0.0006401343,0.000038340568,0.00012324358,0.0006921028,0.00023615727,0.00009469871],"category_scores_gemma":[0.000037069654,0.00021910472,0.000096111326,0.00033031282,0.00028499428,0.00008711141,0.0002276872,0.0005847222,0.000055882967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010754002,0.0009759034,0.06821759,0.00036753298,0.00023955807,0.00032523187,0.054100003,0.015255018,0.0011045352,0.51645267,0.0006781897,0.3421762],"study_design_scores_gemma":[0.0018325575,0.0015420804,0.5921058,0.0045481077,0.00029935996,0.00019080642,0.00010181458,0.015167083,0.00092286576,0.3623708,0.018241242,0.0026774812],"about_ca_topic_score_codex":0.00007926138,"about_ca_topic_score_gemma":0.0005026403,"teacher_disagreement_score":0.7193592,"about_ca_system_score_codex":0.00018770919,"about_ca_system_score_gemma":0.00016384895,"threshold_uncertainty_score":0.8934831},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003613553,0.0028882665,0.9873725,0.0034050513,0.0013205115,0.00035879525,0.0000065286463,0.000057796755,0.0009770023],"genre_scores_gemma":[0.96562463,0.0001846309,0.029547283,0.0034495962,0.00028209726,0.0000067694605,0.0000017224676,0.000044221248,0.00085904065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954759,0.000036277528,0.00041107414,0.0022676603,0.0009269776,0.0008821268],"domain_scores_gemma":[0.9985057,0.0003735985,0.00013648317,0.0007541742,0.00004305714,0.00018695038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007232452,0.0006463196,0.0005582188,0.00071078393,0.00024202839,0.0009828171,0.00201584,0.00027981095,0.000016695907],"category_scores_gemma":[0.000044304314,0.00059037184,0.000109310924,0.00068493804,0.0009950066,0.0013213867,0.0012116001,0.0012283038,0.00002720453],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016093896,0.000068682595,0.00045405616,0.00045192504,0.00003089431,0.0010344936,0.024216706,0.008628074,0.00617961,0.005637825,0.00006685854,0.95321476],"study_design_scores_gemma":[0.00082675484,0.00052989624,0.00085406157,0.0033254256,0.0000366656,0.00049447024,0.0000137896905,0.91232854,0.013069373,0.06376781,0.0023776721,0.0023755191],"about_ca_topic_score_codex":0.000016932196,"about_ca_topic_score_gemma":0.000029859562,"teacher_disagreement_score":0.9620111,"about_ca_system_score_codex":0.00026655878,"about_ca_system_score_gemma":0.00019648614,"threshold_uncertainty_score":0.99965477},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035350517,0.00018481344,0.70109093,0.00003832769,0.001801628,0.00014266372,0.000078948106,0.00024061749,0.29606855],"genre_scores_gemma":[0.9901606,0.000022348055,0.008341228,0.000074410105,0.00029913915,0.0000039263987,0.000018798399,0.00007126923,0.0010083064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987941,7.0196376e-7,0.00041470124,0.0002804976,0.00026808414,0.0002419431],"domain_scores_gemma":[0.9994041,0.00009772841,0.000044340504,0.0003403976,0.00004643405,0.00006705286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008816156,0.00026516215,0.00026247694,0.0004660235,0.000019799307,0.0003216827,0.00059515017,0.00024117455,0.000022180224],"category_scores_gemma":[0.00001000433,0.00026749732,0.00008364987,0.00020048517,0.0003403561,0.00055951416,0.00013548242,0.00054451096,0.000105499355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.8621306e-7,0.0000043015057,0.000012280723,0.00017145276,0.000016666072,0.000011231052,0.00035526187,0.6789611,0.000015021945,0.011701668,0.000029599498,0.30872056],"study_design_scores_gemma":[0.00023549086,0.00011969563,0.00003295245,0.0013956178,0.000020436772,0.000091533155,0.0000010059989,0.7502551,0.0046317712,0.19558635,0.046445098,0.0011849136],"about_ca_topic_score_codex":9.794308e-7,"about_ca_topic_score_gemma":0.0000029835219,"teacher_disagreement_score":0.98980707,"about_ca_system_score_codex":0.00022609578,"about_ca_system_score_gemma":0.00013969556,"threshold_uncertainty_score":0.9999777},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006837117,0.0025913555,0.9910569,0.00045390736,0.0009783925,0.00038715446,0.000017462096,0.0015972663,0.0028491989],"genre_scores_gemma":[0.44435737,0.0008256236,0.55166,0.00022970031,0.00036747876,0.00013645313,0.00004512386,0.00026045772,0.0021177824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842876,0.000004230974,0.000317255,0.00056105235,0.00029264917,0.00039603343],"domain_scores_gemma":[0.99809176,0.00037273252,0.00006837508,0.0013279173,0.00009177106,0.000047467867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019453315,0.00036941603,0.00033716246,0.00062026706,0.00012845686,0.00013178322,0.0022754315,0.00030210533,0.000012463423],"category_scores_gemma":[0.000143954,0.0003609552,0.00009852787,0.00031725038,0.00046685373,0.0001446055,0.0009041624,0.0010083907,0.00003519802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029412452,0.000004093163,0.000004098731,0.00013599497,0.000017791823,0.000008975471,0.000148945,0.5294196,0.0004732087,0.011477859,0.00008243125,0.45822406],"study_design_scores_gemma":[0.00019220209,0.00009623544,0.0000060111124,0.00043944127,0.000008772745,0.000013252702,5.930389e-7,0.6343748,0.0053895125,0.33938283,0.019620499,0.0004758722],"about_ca_topic_score_codex":0.0000018363977,"about_ca_topic_score_gemma":0.000030464866,"teacher_disagreement_score":0.45774817,"about_ca_system_score_codex":0.000260177,"about_ca_system_score_gemma":0.0000476265,"threshold_uncertainty_score":0.99988425},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024359344,0.0016807928,0.9462581,0.00036452402,0.0022335597,0.00021362967,0.000002506314,0.0001615114,0.049061],"genre_scores_gemma":[0.5302931,0.00012389393,0.46252528,0.00090764306,0.00096651335,0.000010253593,0.0000060811744,0.00005320501,0.0051140264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972262,0.000018192615,0.0004577307,0.0011971501,0.0006639746,0.00043675076],"domain_scores_gemma":[0.9980983,0.0003033304,0.00023419516,0.0010192869,0.00023867787,0.00010621488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006553012,0.00038557252,0.00046232535,0.0007657909,0.000104310435,0.00031336435,0.0025060694,0.00029690802,0.000028278411],"category_scores_gemma":[0.0000759219,0.00031153558,0.00016589725,0.0007078786,0.0005153605,0.00038009245,0.0012664048,0.00058438804,0.00014263597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002975551,0.000025744612,0.000039362312,0.000105302606,0.000012952107,0.000067761815,0.0012439422,0.0042425627,0.00022749086,0.7092065,0.00004465356,0.2847807],"study_design_scores_gemma":[0.00008740581,0.00015351099,0.0000479626,0.00031173497,0.000007780921,0.00004289983,7.1909874e-8,0.35909662,0.0006569447,0.6377555,0.0015176939,0.00032184442],"about_ca_topic_score_codex":0.000012225561,"about_ca_topic_score_gemma":0.00003865847,"teacher_disagreement_score":0.5302687,"about_ca_system_score_codex":0.00017733585,"about_ca_system_score_gemma":0.00041123154,"threshold_uncertainty_score":0.99993366},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023827776,0.002310757,0.9850014,0.0023224761,0.007042792,0.00039792195,0.000017519771,0.0008401397,0.0018287254],"genre_scores_gemma":[0.03438487,0.0000817096,0.95433545,0.0061578993,0.0036017387,0.000029187691,0.00002935767,0.00017395821,0.0012058263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993579,0.00008799948,0.000704733,0.0027675391,0.0015294548,0.001331301],"domain_scores_gemma":[0.9963064,0.0006413915,0.00024309993,0.0021588434,0.00032378375,0.00032643232],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011635149,0.00089850643,0.00076698663,0.0024053308,0.00038581475,0.0018156107,0.006353704,0.00046827502,0.000012919589],"category_scores_gemma":[0.00010435397,0.00075558893,0.00041185805,0.0031938138,0.00089506694,0.0004778546,0.003223008,0.0022310866,0.0002325199],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041158796,0.000060780276,0.00001123861,0.00019158497,0.000033789824,0.0005861334,0.0015652225,0.046432264,0.00017115043,0.026765654,0.0008744193,0.92330366],"study_design_scores_gemma":[0.00011918142,0.00022048969,0.00004348338,0.0005916097,0.000009337816,0.00017748977,9.971042e-8,0.68198544,0.00020739953,0.30989102,0.006040523,0.00071390247],"about_ca_topic_score_codex":0.000025056055,"about_ca_topic_score_gemma":0.000022438671,"teacher_disagreement_score":0.9225897,"about_ca_system_score_codex":0.000324749,"about_ca_system_score_gemma":0.0020418672,"threshold_uncertainty_score":0.9994895},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000044743356,0.003258874,0.9685253,0.00095690816,0.009160021,0.00046572046,0.0000014325411,0.0001983327,0.017428936],"genre_scores_gemma":[0.96952444,0.0002580312,0.020968825,0.0010386101,0.002295242,0.000058890342,0.000016790891,0.00005964325,0.0057795327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665105,0.000031530268,0.00052354153,0.001121878,0.0010109289,0.0006610544],"domain_scores_gemma":[0.9978789,0.0004262802,0.00023410129,0.0011191766,0.00020141773,0.00014010743],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013664151,0.0004249117,0.00033295123,0.00031394832,0.00051581004,0.0017229769,0.0030915057,0.000243483,0.000009016392],"category_scores_gemma":[0.000055793058,0.00027160946,0.00016749458,0.0004959554,0.0006899634,0.0004630365,0.0012079751,0.000732351,0.00017317016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.143888e-7,0.000004473121,0.000007251712,0.000025408846,0.0000074439904,0.000023465069,0.0004792526,0.0005245107,0.000003686429,0.556922,0.00007644493,0.44192544],"study_design_scores_gemma":[0.00011450848,0.00014163074,0.000019783829,0.000082513834,0.000009700726,0.00007887611,4.2554464e-7,0.2530643,0.00016753162,0.6051277,0.14073028,0.00046274508],"about_ca_topic_score_codex":0.00003651746,"about_ca_topic_score_gemma":0.00015368943,"teacher_disagreement_score":0.96952,"about_ca_system_score_codex":0.00029469962,"about_ca_system_score_gemma":0.0004062101,"threshold_uncertainty_score":0.9999736},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023827776,0.002310757,0.9850014,0.0023224761,0.007042792,0.00039792195,0.000017519771,0.0008401397,0.0018287254],"genre_scores_gemma":[0.03438487,0.0000817096,0.95433545,0.0061578993,0.0036017387,0.000029187691,0.00002935767,0.00017395821,0.0012058263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993579,0.00008799948,0.000704733,0.0027675391,0.0015294548,0.001331301],"domain_scores_gemma":[0.9963064,0.0006413915,0.00024309993,0.0021588434,0.00032378375,0.00032643232],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011635149,0.00089850643,0.00076698663,0.0024053308,0.00038581475,0.0018156107,0.006353704,0.00046827502,0.000012919589],"category_scores_gemma":[0.00010435397,0.00075558893,0.00041185805,0.0031938138,0.00089506694,0.0004778546,0.003223008,0.0022310866,0.0002325199],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041158796,0.000060780276,0.00001123861,0.00019158497,0.000033789824,0.0005861334,0.0015652225,0.046432264,0.00017115043,0.026765654,0.0008744193,0.92330366],"study_design_scores_gemma":[0.00011918142,0.00022048969,0.00004348338,0.0005916097,0.000009337816,0.00017748977,9.971042e-8,0.68198544,0.00020739953,0.30989102,0.006040523,0.00071390247],"about_ca_topic_score_codex":0.000025056055,"about_ca_topic_score_gemma":0.000022438671,"teacher_disagreement_score":0.9225897,"about_ca_system_score_codex":0.000324749,"about_ca_system_score_gemma":0.0020418672,"threshold_uncertainty_score":0.9994895},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049813646,0.0005923138,0.9910328,0.00017143213,0.0011667357,0.0006257982,0.0000050657536,0.000039234215,0.0013853001],"genre_scores_gemma":[0.98509526,0.00003330887,0.014510181,0.00020556542,0.00007358933,0.000009149165,3.2281446e-7,0.00002340922,0.00004924041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998175,0.000071183626,0.00042127003,0.00027878647,0.00088061276,0.0001731052],"domain_scores_gemma":[0.9967456,0.0023522824,0.0002521873,0.00046905954,0.00015375108,0.000027158601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018529426,0.00022367456,0.0002763721,0.00023325594,0.00008060522,0.00013226694,0.0017118959,0.00011028523,0.00001831769],"category_scores_gemma":[0.0003253588,0.00013249215,0.000070002425,0.00047327534,0.0003465257,0.00020842155,0.00013076006,0.0005331084,0.00000359032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024655237,0.00006138944,0.00003483509,0.0003466708,0.00006155098,0.000003678351,0.015255783,0.89036405,0.0029521203,0.0034100201,0.000027571346,0.08745765],"study_design_scores_gemma":[0.000620699,0.00071829045,0.00044094466,0.0098610055,0.00020783817,0.00003446676,0.000049613645,0.36024874,0.38832128,0.23805778,0.00047343416,0.0009659028],"about_ca_topic_score_codex":0.0000039279817,"about_ca_topic_score_gemma":0.0000015345905,"teacher_disagreement_score":0.98011386,"about_ca_system_score_codex":0.000057866277,"about_ca_system_score_gemma":0.00027034164,"threshold_uncertainty_score":0.5402873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023829072,0.0009205945,0.98940516,0.00021187132,0.007863452,0.0006104365,0.000031155214,0.00009117771,0.0008423454],"genre_scores_gemma":[0.031168655,0.000020116846,0.967862,0.00010661764,0.0003863351,0.0000183162,0.000011575193,0.0000311257,0.00039522228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997092,0.000030402978,0.0007106413,0.0009923924,0.0008255164,0.00034902315],"domain_scores_gemma":[0.9976688,0.0004928271,0.00040130984,0.0008661405,0.00049195735,0.000078951525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010407767,0.00036393263,0.0004752532,0.00055900234,0.00009855019,0.00027309987,0.001991093,0.00028877993,0.00001036359],"category_scores_gemma":[0.00021538734,0.00031782332,0.00013304301,0.0005160442,0.000561143,0.00039075356,0.00090846507,0.00052244193,0.000014351201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036305626,0.000008465508,0.000010325213,0.00025669404,0.000016729344,0.000003601801,0.00036986763,0.055070322,0.00006457932,0.84316254,0.000037986792,0.100995235],"study_design_scores_gemma":[0.00010480671,0.00012496897,0.000025992367,0.0003938104,0.000012599738,0.000032992724,1.2535689e-7,0.76205474,0.0007254142,0.23242994,0.0038258682,0.0002687314],"about_ca_topic_score_codex":0.000008976402,"about_ca_topic_score_gemma":0.0000071486465,"teacher_disagreement_score":0.70698446,"about_ca_system_score_codex":0.00022861117,"about_ca_system_score_gemma":0.00036051715,"threshold_uncertainty_score":0.9999274},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053822536,0.00020779784,0.9377694,0.007918807,0.0025704713,0.0011073088,0.000007119937,0.00012756362,0.05023769],"genre_scores_gemma":[0.122861244,0.00004758596,0.8142167,0.014539461,0.035191398,0.0003418487,0.00039543374,0.00043503632,0.011971311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968861,0.0000059511385,0.0004914416,0.0012198315,0.0008037222,0.000592966],"domain_scores_gemma":[0.99520105,0.0002219121,0.00022831983,0.00054277416,0.0037964098,0.000009543138],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0030504942,0.0003607825,0.000376508,0.0021529377,0.00033571105,0.0014523499,0.00092692795,0.00022884613,0.000037247057],"category_scores_gemma":[0.00047069724,0.00030114956,0.000052021915,0.004384398,0.00047176765,0.0010122531,0.0008413613,0.0007757826,0.00008594369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017900034,0.000014723264,0.0000075536655,0.0007481809,0.000014673983,0.000015346652,0.00007603024,0.0013601338,0.00065354863,0.75979304,0.0026041497,0.23469472],"study_design_scores_gemma":[0.00017801067,0.000030517902,0.000038749946,0.00060234236,0.000012038569,0.000006916819,0.0000010919484,0.1297118,0.00051686424,0.72354996,0.14493042,0.00042129715],"about_ca_topic_score_codex":0.00013316421,"about_ca_topic_score_gemma":0.000059101494,"teacher_disagreement_score":0.23427342,"about_ca_system_score_codex":0.00017452566,"about_ca_system_score_gemma":0.0004187752,"threshold_uncertainty_score":0.9999441},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006208406,0.0005670217,0.9909327,0.0010323126,0.0017665995,0.00027985073,0.000007869193,0.00036564548,0.005041773],"genre_scores_gemma":[0.012198668,0.000065180786,0.98201245,0.0013405319,0.00094558904,0.00006297946,0.000020148414,0.00004644384,0.0033080028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997199,0.000009407115,0.00030930454,0.0013566968,0.0006335596,0.00049201504],"domain_scores_gemma":[0.99782366,0.00015916623,0.00007269701,0.0017663002,0.0000668091,0.00011136432],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006146532,0.0003276497,0.0002629997,0.00091603387,0.00009410527,0.001163535,0.004075424,0.00013868882,0.00000897223],"category_scores_gemma":[0.000029761924,0.0002993032,0.00007626352,0.001558894,0.00014478194,0.00051478716,0.002823228,0.0005592483,0.00034092873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.154234e-7,0.00003027059,0.0000050801164,0.0001855883,0.000015871272,0.00012469167,0.00023661018,0.061240714,0.00013031886,0.13791387,0.0056806942,0.7944358],"study_design_scores_gemma":[0.000055351135,0.000025051604,0.000018195675,0.0001915635,0.000004723931,0.000017781142,1.7648686e-8,0.83193797,0.00011976889,0.04287143,0.124429636,0.0003285189],"about_ca_topic_score_codex":0.0000057596926,"about_ca_topic_score_gemma":0.00001225301,"teacher_disagreement_score":0.79410726,"about_ca_system_score_codex":0.0003962095,"about_ca_system_score_gemma":0.0007797746,"threshold_uncertainty_score":0.99994594},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004877409,0.002707668,0.9899909,0.0019264398,0.0020316318,0.0007965174,0.00011502199,0.00025190625,0.0021311743],"genre_scores_gemma":[0.4814591,0.00073003425,0.51710576,0.00018612802,0.00024329025,0.000034267738,0.000057180023,0.00006369658,0.00012054523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965841,0.000043650212,0.00073215086,0.0017962441,0.0004224263,0.00042144058],"domain_scores_gemma":[0.9966154,0.00067235547,0.00042535117,0.0020201723,0.00016163134,0.00010509722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021823763,0.00046263495,0.00072506943,0.00070847716,0.00015800777,0.00039243433,0.0030759324,0.00022196134,0.0000021156204],"category_scores_gemma":[0.000047329784,0.00041914912,0.00009446614,0.0002088832,0.0002445712,0.0008040561,0.0030187215,0.00045783387,0.0000031044751],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053979506,0.000018085964,0.000009721959,0.0011017115,0.000030296782,0.000016891634,0.00032293846,0.00007091549,0.000068673566,0.061903954,0.00008396556,0.93636745],"study_design_scores_gemma":[0.00022946278,0.00018407972,0.000028674032,0.0020256995,0.000024212517,0.00018715452,0.0000019295776,0.8989353,0.0007347672,0.0903835,0.0067315595,0.00053365657],"about_ca_topic_score_codex":0.00003889217,"about_ca_topic_score_gemma":0.000109274966,"teacher_disagreement_score":0.9358338,"about_ca_system_score_codex":0.00026518138,"about_ca_system_score_gemma":0.00019085282,"threshold_uncertainty_score":0.999826},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18061718,0.0012227143,0.81605756,0.0001979772,0.00019371478,0.0015755876,0.000026062899,0.00003937718,0.00006981006],"genre_scores_gemma":[0.9198797,0.000036566773,0.07950364,0.0003020832,0.00004996609,0.000021519025,0.00006737728,0.000040738887,0.000098420656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979256,0.000016790193,0.00039814087,0.00085127406,0.0004573242,0.00035086952],"domain_scores_gemma":[0.99914217,0.0003498806,0.00011352127,0.0002634494,0.000034119665,0.00009683757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045051443,0.00035023913,0.00046973967,0.00031420335,0.000095993855,0.000100730955,0.00008094612,0.0001545608,0.00003711268],"category_scores_gemma":[0.00004476688,0.0003036808,0.00007992389,0.00015094971,0.00030966982,0.000073762014,0.00006894035,0.0003055984,0.0000082266415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042159934,0.00041893788,0.00062790804,0.0007619573,0.000104809005,0.00034096872,0.0030163801,0.63522846,0.05316443,0.000051763644,0.000004550681,0.30585822],"study_design_scores_gemma":[0.0057513,0.001845926,0.00014274348,0.0019808067,0.00011719017,0.000059507565,0.0000032815828,0.9685648,0.014338979,0.0067722835,0.00005062385,0.00037257434],"about_ca_topic_score_codex":0.000045364424,"about_ca_topic_score_gemma":0.00004266634,"teacher_disagreement_score":0.7392625,"about_ca_system_score_codex":0.0004925414,"about_ca_system_score_gemma":0.00022677283,"threshold_uncertainty_score":0.9999415},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.5947082e-7,0.00211343,0.9842589,0.0097815655,0.0017352531,0.0007094809,0.0002719088,0.00029309496,0.00083601],"genre_scores_gemma":[0.003976262,0.00009548885,0.9897989,0.0014903501,0.0007704391,0.00002658721,0.0024265249,0.00006384556,0.0013515869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944799,0.00017436,0.0005828959,0.0030267094,0.0011992578,0.0005369026],"domain_scores_gemma":[0.987774,0.004410494,0.00039557516,0.0070985104,0.00021036365,0.00011106383],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0094346525,0.0005040504,0.00041118564,0.00057759346,0.00063395716,0.0015775063,0.014947836,0.00024447267,0.000027936821],"category_scores_gemma":[0.0013822113,0.0003639728,0.00008368469,0.0007086281,0.0003003826,0.0010222734,0.006549335,0.0014715266,0.000056235018],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011316653,0.000013736407,0.000019919571,0.00008345524,0.000022026934,0.000007205739,0.00011656682,0.047517918,0.00003648343,0.01819932,0.00025308455,0.933719],"study_design_scores_gemma":[0.00018593766,0.0000628193,0.000074232164,0.00019161258,0.000048316655,0.00001896106,1.4116479e-7,0.83911586,0.000027481834,0.037099514,0.122812316,0.00036281184],"about_ca_topic_score_codex":0.00009679941,"about_ca_topic_score_gemma":0.00020538132,"teacher_disagreement_score":0.93335617,"about_ca_system_score_codex":0.00014517104,"about_ca_system_score_gemma":0.0007820789,"threshold_uncertainty_score":0.9998812},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039908758,0.00025041733,0.9893089,0.0006396792,0.0046750475,0.00086211314,0.000063041705,0.00014123145,0.0036605166],"genre_scores_gemma":[0.33835888,0.0000072249177,0.6498555,0.0007743465,0.0014426225,0.00006467772,0.000017064332,0.00014375921,0.009335934],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99303716,0.0001360561,0.0014771299,0.0024236261,0.0020459758,0.0008800699],"domain_scores_gemma":[0.99146664,0.0064332667,0.00036958678,0.0008955974,0.00059863325,0.00023625315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.013094181,0.0007029107,0.001111219,0.0011582064,0.0003391676,0.0007081971,0.0022270742,0.00052759104,0.00027601368],"category_scores_gemma":[0.004003905,0.0005503646,0.0005270614,0.0010776392,0.0022409684,0.0006526485,0.0007013809,0.0010324627,0.00015196567],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012444101,0.000011668152,0.000050725776,0.000077938326,0.000010370782,0.000025448178,0.0008875822,0.0022274929,0.00026124643,0.00059943757,0.00004580073,0.9956778],"study_design_scores_gemma":[0.00022679477,0.0004615552,0.0000718115,0.0005790934,0.000029030129,0.00008829111,0.0000013410254,0.26037478,0.0055769267,0.7235872,0.008232539,0.0007705981],"about_ca_topic_score_codex":0.00003079057,"about_ca_topic_score_gemma":0.0007765438,"teacher_disagreement_score":0.99490726,"about_ca_system_score_codex":0.0005036236,"about_ca_system_score_gemma":0.0011028302,"threshold_uncertainty_score":0.99969476},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003656059,0.00030671863,0.9965968,0.00005872511,0.00021046869,0.00079272286,0.000027657052,0.00040878405,0.0012325163],"genre_scores_gemma":[0.026738673,0.000030540003,0.9714573,0.00011327654,0.0002561524,0.000025673695,0.000012229055,0.000152429,0.001213723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775594,0.000017110886,0.0003445639,0.0008694377,0.00043058163,0.00058236],"domain_scores_gemma":[0.99843305,0.00077167986,0.00009449165,0.00039792663,0.00017731784,0.00012555804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006524954,0.000468466,0.00047951392,0.0004516788,0.00017380613,0.0003019258,0.00037972673,0.00017532845,0.000010374137],"category_scores_gemma":[0.000024953852,0.00038154528,0.00004675523,0.0005238813,0.00022677843,0.00016067394,0.00018201485,0.0005659356,0.000007476951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066760012,0.0000059580693,0.000027934915,0.00013459013,0.000027310212,0.000037076155,0.0006199002,0.84267044,0.00007620367,0.00007896867,0.0000022412398,0.15631267],"study_design_scores_gemma":[0.00041899353,0.00020328016,0.000008261952,0.00097472075,0.00005371896,0.000056266585,7.298805e-7,0.9957039,0.00033961903,0.001324455,0.00039418353,0.0005218774],"about_ca_topic_score_codex":0.000017352124,"about_ca_topic_score_gemma":0.0002398708,"teacher_disagreement_score":0.1557908,"about_ca_system_score_codex":0.0002242986,"about_ca_system_score_gemma":0.00012772808,"threshold_uncertainty_score":0.9998636},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006276853,0.001039773,0.9958626,0.00022069945,0.00077085395,0.0011150544,0.00002689239,0.0003733807,0.0005279625],"genre_scores_gemma":[0.75779027,0.000015283003,0.24108498,0.00010206543,0.0004845981,0.000069660004,0.00002276327,0.00017499231,0.00025541318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723226,0.000011402131,0.00043281566,0.0008382634,0.000702954,0.00078232464],"domain_scores_gemma":[0.9980306,0.00093743135,0.000091320326,0.00060946617,0.00022792081,0.00010323072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009380264,0.0005548726,0.0004982684,0.00046941577,0.0002571907,0.0003942064,0.00083130185,0.0002319114,0.0000033837941],"category_scores_gemma":[0.00007836395,0.00039164966,0.000107421176,0.00056390354,0.00014446206,0.00019549063,0.00027938787,0.00096503063,0.000008683711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011385409,0.0000068959394,0.000005383687,0.00022839096,0.00005979353,0.00000958094,0.00057676446,0.9821906,0.000057960366,0.0019329931,0.000014532898,0.014905706],"study_design_scores_gemma":[0.000279747,0.00008596214,0.000007132837,0.0011273122,0.00010879276,0.000022348579,0.0000017729731,0.98610485,0.00011111754,0.011655391,0.000029160386,0.00046643766],"about_ca_topic_score_codex":0.000004310051,"about_ca_topic_score_gemma":0.00013198084,"teacher_disagreement_score":0.7577275,"about_ca_system_score_codex":0.00036912097,"about_ca_system_score_gemma":0.0003580889,"threshold_uncertainty_score":0.99985355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009238279,0.00066469586,0.9934634,0.0024509619,0.0009550663,0.0009517469,0.0000024117383,0.00031819261,0.0011011339],"genre_scores_gemma":[0.5032802,0.00021886342,0.49356383,0.00090556324,0.00032083725,0.00029141165,0.000055422643,0.000071086484,0.0012927382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996355,0.000027733673,0.00079754647,0.0015545011,0.00064458395,0.0006206144],"domain_scores_gemma":[0.997392,0.0007022935,0.00028895662,0.0011755843,0.000329181,0.00011196139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011535257,0.0004785889,0.0004935715,0.001356459,0.00034879093,0.000479198,0.002147145,0.00029759115,0.000008881827],"category_scores_gemma":[0.00022829192,0.0004827308,0.00013334236,0.0008403698,0.0004553726,0.0005779979,0.0008865681,0.0010969493,0.000044221575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062333893,0.000030386604,0.00004142865,0.00008317289,0.000016856655,0.000051218198,0.0013236578,0.24568294,0.000016867563,0.46538007,0.00005092893,0.28731623],"study_design_scores_gemma":[0.00013646892,0.0001160997,0.000009887308,0.00013222403,0.000008505586,0.000028851618,0.0000011455868,0.5860949,0.00021255352,0.40862247,0.004319786,0.00031707628],"about_ca_topic_score_codex":0.000022167365,"about_ca_topic_score_gemma":0.0003540867,"teacher_disagreement_score":0.50318784,"about_ca_system_score_codex":0.00033526475,"about_ca_system_score_gemma":0.0006220753,"threshold_uncertainty_score":0.9997624},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007898347,0.0022847059,0.98407483,0.00038957162,0.00312624,0.0012864035,0.000010214974,0.00025530875,0.00067439966],"genre_scores_gemma":[0.85969496,0.00003326813,0.13930704,0.00037938304,0.00034496392,0.000038195365,0.0000011726844,0.000057850404,0.00014319559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99460244,0.000077791534,0.0007908445,0.0025365062,0.0012592934,0.0007331052],"domain_scores_gemma":[0.9971573,0.0005857035,0.000223147,0.0014263857,0.00019199435,0.00041546553],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016281186,0.00074630295,0.0008644681,0.0015933368,0.0003739299,0.0024814554,0.0019578338,0.00025856952,0.0000019526365],"category_scores_gemma":[0.000062123574,0.00064336427,0.00009569439,0.0010289865,0.00035528553,0.0004826989,0.0031263584,0.000840873,0.000020064856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047343772,0.00026468534,0.0020235963,0.0010411581,0.00046556233,0.002176147,0.05399873,0.13479976,0.0009017181,0.13204731,0.00008885232,0.6721451],"study_design_scores_gemma":[0.0006433611,0.00096345757,0.00022736168,0.0025146098,0.000055264212,0.0004935148,0.000016692326,0.95989674,0.00013635449,0.03231491,0.0010536761,0.0016840533],"about_ca_topic_score_codex":0.00004603808,"about_ca_topic_score_gemma":0.000033862427,"teacher_disagreement_score":0.85179657,"about_ca_system_score_codex":0.00018845387,"about_ca_system_score_gemma":0.00017483857,"threshold_uncertainty_score":0.9996018},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005892753,0.00059565966,0.99239224,0.00005872874,0.0047136494,0.00042292493,0.0000038475314,0.00038998094,0.0013640649],"genre_scores_gemma":[0.09175196,0.000009607931,0.90753883,0.00008003303,0.00045650327,0.0000073123265,0.000002888113,0.00004186737,0.00011099829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597657,0.00004986332,0.00068954704,0.0016038122,0.0011173616,0.0005628718],"domain_scores_gemma":[0.9978114,0.00017242316,0.00031235587,0.0013440566,0.00022114157,0.00013865581],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018464664,0.00046437897,0.00045771443,0.000955061,0.00025561254,0.00081668014,0.0024410244,0.00039135217,0.000004684489],"category_scores_gemma":[0.000035763325,0.0004505024,0.00016047191,0.00084076985,0.00022807776,0.000888737,0.0012026477,0.00089671236,0.00005115143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003138936,0.0000054903335,6.417611e-7,0.00015109785,0.0000076292117,0.000036246372,0.00022631399,0.60880315,0.00018674285,0.3459735,0.0000011454135,0.044604883],"study_design_scores_gemma":[0.00006400748,0.00003889737,6.746408e-7,0.0011607769,0.000019089537,0.00013017612,1.8762655e-7,0.91461337,0.0015192343,0.08187962,0.00016643375,0.0004075245],"about_ca_topic_score_codex":0.000020513693,"about_ca_topic_score_gemma":0.0000028339343,"teacher_disagreement_score":0.30581018,"about_ca_system_score_codex":0.0010790552,"about_ca_system_score_gemma":0.00038503078,"threshold_uncertainty_score":0.99979466},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015481912,0.00024642443,0.9916228,0.0011145204,0.00082417764,0.0008463677,0.000010054941,0.00028810464,0.0050320616],"genre_scores_gemma":[0.008508913,0.000032201326,0.9873739,0.0009943376,0.0006196073,0.000013236237,0.0000250092,0.00006791039,0.002364898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960353,0.000032302087,0.0003887563,0.001702933,0.0010480625,0.00079265004],"domain_scores_gemma":[0.9977893,0.00030951775,0.000099088,0.0011221165,0.00039433403,0.00028564603],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012820367,0.0004545072,0.00042354895,0.0009349552,0.00029617664,0.0011172501,0.002839431,0.00023572068,0.000022450004],"category_scores_gemma":[0.000027073704,0.0003611845,0.000100580444,0.0008243317,0.000533255,0.00084242225,0.0008920136,0.00081851275,0.00004446736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016143847,0.00003939538,0.000008806662,0.00016195248,0.000021359618,0.000055329678,0.0016649686,0.6964542,0.0001047655,0.13414529,0.000038548387,0.16728924],"study_design_scores_gemma":[0.0002522812,0.0005597998,0.000002355477,0.00034996032,0.00000465327,0.00003443867,2.783489e-7,0.92708457,0.0009324914,0.06545642,0.0048480006,0.00047476578],"about_ca_topic_score_codex":0.000013333458,"about_ca_topic_score_gemma":0.000042112068,"teacher_disagreement_score":0.23063035,"about_ca_system_score_codex":0.00019536518,"about_ca_system_score_gemma":0.0007923504,"threshold_uncertainty_score":0.9999197},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019090925,0.00075842906,0.97783273,0.00097182946,0.0018849977,0.00095278793,0.000019831947,0.001963917,0.015424553],"genre_scores_gemma":[0.31101465,0.0005226342,0.67707825,0.0026521094,0.0010838554,0.0002631469,0.00007055021,0.0003406298,0.0069741947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99355906,0.000103224964,0.0006409059,0.0027050942,0.0018109397,0.0011807821],"domain_scores_gemma":[0.9961832,0.00086416135,0.00023921001,0.002040664,0.00035023576,0.0003225287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011375704,0.0007906689,0.000650588,0.0021472475,0.00037504255,0.00088341965,0.0038495983,0.00039753888,0.000036336478],"category_scores_gemma":[0.00014265574,0.00068257924,0.00024697944,0.002628155,0.0010319268,0.00073978695,0.0015856506,0.0018172055,0.00031270942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030641357,0.00008724224,0.000032639906,0.00012468046,0.000038867307,0.00041117467,0.00068145123,0.008833796,0.000705856,0.507421,0.00012881125,0.48150384],"study_design_scores_gemma":[0.00019079125,0.00031321667,0.000080543854,0.0008950575,0.000008316737,0.00004271161,8.480028e-8,0.17096415,0.0016380855,0.8230379,0.0021405022,0.00068863714],"about_ca_topic_score_codex":0.000012537151,"about_ca_topic_score_gemma":0.00005076741,"teacher_disagreement_score":0.4808152,"about_ca_system_score_codex":0.00042567038,"about_ca_system_score_gemma":0.00039143066,"threshold_uncertainty_score":0.99956256},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001043189,0.0002495947,0.9886258,0.0035119776,0.001147597,0.000688526,0.000022653461,0.00015920063,0.004551453],"genre_scores_gemma":[0.83987886,0.00005449718,0.15519813,0.003065497,0.0002380121,0.000078454934,0.0000037404293,0.00014814435,0.001334693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944342,0.00009465212,0.0005674717,0.0018059359,0.0021553335,0.000942436],"domain_scores_gemma":[0.98956454,0.00617181,0.00016407788,0.0033898358,0.0004931245,0.00021659055],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001527811,0.0006649848,0.0006714425,0.0012956306,0.0003105554,0.0005297614,0.008416413,0.00032899703,0.00006263296],"category_scores_gemma":[0.00084149017,0.0003754839,0.00019510009,0.0021172443,0.002572126,0.00048202023,0.0029111924,0.0017089674,0.000050870287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089011846,0.000044225257,0.000009431435,0.000107417516,0.000031486612,0.00029291466,0.0005575125,0.0018435267,0.00019847277,0.94465053,0.00005163774,0.052123856],"study_design_scores_gemma":[0.00026646978,0.0011744233,0.00001956469,0.001208743,0.00001358269,0.00011744082,9.951223e-7,0.04492622,0.0035916448,0.9480085,0.00015473922,0.00051767123],"about_ca_topic_score_codex":0.000012668179,"about_ca_topic_score_gemma":0.000081495666,"teacher_disagreement_score":0.83883566,"about_ca_system_score_codex":0.00015963589,"about_ca_system_score_gemma":0.00086867675,"threshold_uncertainty_score":0.9998697},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000090449386,0.00018865791,0.9848039,0.011506289,0.001152675,0.0012423954,0.000013259502,0.00014166281,0.0008606795],"genre_scores_gemma":[0.24465965,0.00015761185,0.7346944,0.016663728,0.0008236752,0.00020819245,0.000052791267,0.00013384513,0.002606109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687,0.000052854743,0.00034300855,0.0013256235,0.0008753034,0.00053325685],"domain_scores_gemma":[0.99737513,0.0011241488,0.000103536564,0.00094373676,0.00030573923,0.00014773443],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018704507,0.0003729203,0.00028390496,0.00052164064,0.00046554682,0.0015011281,0.0017002283,0.00020393346,0.000016246808],"category_scores_gemma":[0.000092152906,0.0002528294,0.00010915784,0.00058047357,0.000608806,0.00034722316,0.00064445316,0.00077612465,0.000017204757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058672504,0.00010518594,0.000018827723,0.00020082992,0.000031870022,0.000020568894,0.0010808946,0.025368502,0.00045615307,0.4005695,0.00021045493,0.57187855],"study_design_scores_gemma":[0.00025604968,0.00041750653,0.000021657825,0.00019882742,0.0000051133184,0.0000033514648,1.2272413e-7,0.89228094,0.00029195868,0.10238884,0.0038525753,0.0002830764],"about_ca_topic_score_codex":0.000012742671,"about_ca_topic_score_gemma":0.000042946765,"teacher_disagreement_score":0.8669124,"about_ca_system_score_codex":0.00022399766,"about_ca_system_score_gemma":0.00048473515,"threshold_uncertainty_score":0.9999924},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049182324,0.0014312068,0.98979115,0.0003139321,0.0008287158,0.0003247553,0.000005385254,0.00012523818,0.00668779],"genre_scores_gemma":[0.41165614,0.00015695469,0.58643067,0.00038945183,0.00026153706,0.000013927882,0.0000026632051,0.00007210731,0.0010165449],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597085,0.000047309906,0.0006650001,0.0014851099,0.0011004538,0.000731255],"domain_scores_gemma":[0.9973128,0.0008770813,0.0001986143,0.0012645625,0.00022064552,0.00012630351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016835182,0.00041480322,0.0005645136,0.002129989,0.00007677265,0.0002591097,0.0037243492,0.00023950402,0.000013583382],"category_scores_gemma":[0.00017202331,0.00038373444,0.00012890795,0.0015288454,0.0010301432,0.00061483163,0.0023885525,0.0012871908,0.000029124201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011119204,0.0000262644,0.00014468117,0.00017595282,0.00000966029,0.00032348736,0.0012915678,0.033031892,0.0006389041,0.29916477,0.000005146489,0.6651766],"study_design_scores_gemma":[0.00011691079,0.00015015466,0.000055894798,0.0010198097,0.0000020721482,0.00003259238,2.5286576e-7,0.25126895,0.0025519975,0.7440645,0.0003761771,0.00036071558],"about_ca_topic_score_codex":0.000028831355,"about_ca_topic_score_gemma":0.0001074163,"teacher_disagreement_score":0.66481584,"about_ca_system_score_codex":0.00029391522,"about_ca_system_score_gemma":0.0005148474,"threshold_uncertainty_score":0.9998615},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037663901,0.0022923376,0.9895913,0.0023508207,0.0020489744,0.00042333713,0.000009256614,0.00013662213,0.0031435646],"genre_scores_gemma":[0.013374907,0.0011873005,0.97491544,0.0017160543,0.0004599829,0.000029200659,0.000007688373,0.00008243832,0.0082270065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961817,0.000044165143,0.00063348445,0.0011936546,0.001278083,0.00066886784],"domain_scores_gemma":[0.99675524,0.0013258131,0.00024702676,0.0012112987,0.0002923833,0.00016824174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012296333,0.0004167998,0.0004159416,0.00035033977,0.00032806213,0.00093065493,0.0037406462,0.00022890912,0.000015413008],"category_scores_gemma":[0.00012064001,0.00030148024,0.00015427491,0.000811173,0.0008500829,0.00036846226,0.001767345,0.00080054416,0.000040603838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021636308,0.000029297695,0.0000026654777,0.00005963841,0.00002303595,0.000035749308,0.00097445765,0.037137866,0.00021749848,0.02151435,0.0003628994,0.9396404],"study_design_scores_gemma":[0.00013462882,0.00014636085,0.0000041285875,0.00036976265,0.0000055285996,0.00002539504,3.825729e-7,0.9060676,0.0006568844,0.087969445,0.0042667193,0.00035316736],"about_ca_topic_score_codex":0.0000216615,"about_ca_topic_score_gemma":0.000024351866,"teacher_disagreement_score":0.9392872,"about_ca_system_score_codex":0.00020242043,"about_ca_system_score_gemma":0.0004380066,"threshold_uncertainty_score":0.99994373},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026697267,0.0003642346,0.97800773,0.00024797482,0.0013877848,0.0004438959,0.000016972008,0.00017036451,0.016691322],"genre_scores_gemma":[0.97401404,0.00007732851,0.023982396,0.00073829276,0.0010234268,0.00003420682,0.000048646834,0.000047013127,0.000034674216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852484,0.000016761183,0.00028584342,0.00043767077,0.000443045,0.00029185723],"domain_scores_gemma":[0.99937063,0.0002637657,0.000053684467,0.00023130134,0.00005559568,0.000025014499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036720646,0.00025218577,0.00018691269,0.0004470019,0.00012903547,0.00018661833,0.00037101272,0.00015770794,0.000039606708],"category_scores_gemma":[0.000042063362,0.00020927706,0.00006247949,0.0006293284,0.00013312139,0.00023499558,0.00010442774,0.0010431932,0.000029412293],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071024833,0.000012927987,0.00009894719,0.00010782711,0.000026595077,0.00006573783,0.0039304355,0.09109095,0.00031973302,0.003018706,0.000053453863,0.9012676],"study_design_scores_gemma":[0.0003411781,0.00013275855,0.0004853096,0.0018899824,0.000042249907,0.000075819524,0.000021731,0.77214015,0.0032986244,0.21742855,0.003370189,0.00077347946],"about_ca_topic_score_codex":0.00020921291,"about_ca_topic_score_gemma":0.0009955177,"teacher_disagreement_score":0.9713443,"about_ca_system_score_codex":0.00034955822,"about_ca_system_score_gemma":0.00007564344,"threshold_uncertainty_score":0.8534071},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010766049,0.0038001025,0.94960797,0.0009469685,0.0063154367,0.0007838971,0.00008833884,0.00035781236,0.03702287],"genre_scores_gemma":[0.9828301,0.0001553537,0.014238679,0.000586547,0.0019189438,0.000023845892,0.000013833019,0.00008562606,0.00014705812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99524075,0.00015642158,0.0006233323,0.0015019769,0.0012542467,0.0012233014],"domain_scores_gemma":[0.99731976,0.0008599496,0.000074546006,0.0010852831,0.00036714892,0.0002933077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015806599,0.0005756804,0.0006581164,0.0005637177,0.00042002427,0.0007866464,0.0014127138,0.00062052865,0.00017299685],"category_scores_gemma":[0.00044836526,0.00050387037,0.00022512239,0.00046350545,0.0013316574,0.00028883014,0.001880505,0.0020520696,0.00011768946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031938973,0.00004420621,0.0001489013,0.0005942506,0.00003588313,0.0007972408,0.00081093423,0.11533059,0.000025561205,0.63129497,0.0000049949977,0.25088054],"study_design_scores_gemma":[0.00007391898,0.00014080633,0.000099366174,0.0018736601,0.00004066626,0.00013639612,0.0000054729394,0.48783028,0.000025121657,0.5032431,0.005876559,0.0006546872],"about_ca_topic_score_codex":0.0012430315,"about_ca_topic_score_gemma":0.00051761465,"teacher_disagreement_score":0.9817535,"about_ca_system_score_codex":0.000920395,"about_ca_system_score_gemma":0.00017361352,"threshold_uncertainty_score":0.9997413},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016565775,0.003855025,0.9775959,0.0009388768,0.00017729148,0.00046266467,0.000042155585,0.000066613546,0.00029567417],"genre_scores_gemma":[0.988119,0.000097451324,0.011006303,0.0004332757,0.00005731896,0.000004683719,0.00011340009,0.00003439694,0.00013417182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810344,0.00001345727,0.00022235693,0.0010609826,0.00030519353,0.00029455713],"domain_scores_gemma":[0.99913394,0.00026190595,0.000071668524,0.00037086918,0.00002985127,0.00013173511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016138096,0.0003236186,0.00039053953,0.00029830195,0.00008233557,0.00011376385,0.0002876095,0.000093612434,0.000007699886],"category_scores_gemma":[0.00004905681,0.00021647631,0.000027671924,0.0001794979,0.00032534607,0.000098732744,0.00047019246,0.0010322429,0.0000024445715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044628102,0.00010820594,0.022488257,0.00034688113,0.000055836183,0.0030955342,0.0002980191,0.73965424,0.000007881433,0.0041072187,0.0000011666331,0.2293905],"study_design_scores_gemma":[0.00047256445,0.00029581456,0.00017828621,0.00080515014,0.000055487286,0.000046962,6.014372e-7,0.97814065,4.7041846e-7,0.019760653,0.00004648513,0.00019689315],"about_ca_topic_score_codex":0.00006669588,"about_ca_topic_score_gemma":0.0005722975,"teacher_disagreement_score":0.9715532,"about_ca_system_score_codex":0.00014310618,"about_ca_system_score_gemma":0.00011491184,"threshold_uncertainty_score":0.8827648},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026819028,0.0005215676,0.9436168,0.0014419727,0.020381587,0.00042185996,0.000055657132,0.00018392701,0.033108443],"genre_scores_gemma":[0.2515538,0.000027795644,0.5396362,0.006952198,0.0055289683,0.000041133328,0.00012067465,0.00017858388,0.19596064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9829768,0.00009868322,0.001349281,0.004869727,0.009511036,0.0011944767],"domain_scores_gemma":[0.9920184,0.0029863266,0.00040235132,0.0030992192,0.0011048776,0.00038884557],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01969173,0.000594837,0.0006852073,0.0056412825,0.00087417074,0.0077767144,0.010115923,0.0002012281,0.00035197436],"category_scores_gemma":[0.0033373954,0.00045689888,0.00022643278,0.011848932,0.0049941237,0.0010183983,0.006781215,0.0011155037,0.0029898193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004292839,0.000039482613,0.00006351994,0.00002864517,0.000007878767,0.00011510688,0.0005803403,0.3217614,0.000015465019,0.004556308,0.042976588,0.629851],"study_design_scores_gemma":[0.00008877578,0.000048326703,0.0001745063,0.00022171877,0.00000919313,0.000035779292,0.000001371926,0.5467705,0.000032856155,0.40241748,0.049809575,0.00038993597],"about_ca_topic_score_codex":0.000020714082,"about_ca_topic_score_gemma":0.000048438855,"teacher_disagreement_score":0.62946105,"about_ca_system_score_codex":0.0010470846,"about_ca_system_score_gemma":0.005405957,"threshold_uncertainty_score":0.9997883},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006899962,0.00048708022,0.9898827,0.000191595,0.0012421738,0.00037664318,9.305845e-7,0.00019147266,0.007558369],"genre_scores_gemma":[0.39006573,0.00010531651,0.60830754,0.00034337732,0.00022535067,0.000016855969,0.000022779746,0.000045208424,0.0008678257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965173,0.000053642456,0.0006918188,0.0010544156,0.0012558326,0.0004269625],"domain_scores_gemma":[0.9983084,0.00026264886,0.00043954485,0.00063593127,0.00023226668,0.000121200035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011868302,0.00040695703,0.0004314831,0.0016275593,0.00020938722,0.0003776458,0.0012435874,0.0002110224,0.000022973212],"category_scores_gemma":[0.000027150445,0.00039965668,0.00022947325,0.0011266777,0.00036257182,0.0006184656,0.0005412,0.00079987367,0.000058695136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049528617,0.0000067517376,0.000046091624,0.0000546609,0.000023050352,0.000022021359,0.0026187724,0.6400697,0.00040683907,0.036450814,0.0000020855034,0.32029423],"study_design_scores_gemma":[0.00026091994,0.00024734894,0.000080759084,0.00039401543,0.00001501215,0.00001895421,0.000005134821,0.885419,0.00073204405,0.10957166,0.0028203235,0.0004347934],"about_ca_topic_score_codex":0.000028166394,"about_ca_topic_score_gemma":0.000013590912,"teacher_disagreement_score":0.38999674,"about_ca_system_score_codex":0.00023704424,"about_ca_system_score_gemma":0.00024656716,"threshold_uncertainty_score":0.9998455},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013501236,0.00023151112,0.9860879,0.00020869637,0.006541805,0.0011745495,0.00000764557,0.00049635145,0.0039014278],"genre_scores_gemma":[0.76108015,0.00005918781,0.23685673,0.0008877822,0.0006678893,0.00022109823,0.000009803499,0.000062977044,0.00015439378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954786,0.000029277766,0.00065158977,0.0019054643,0.0012283035,0.00070681074],"domain_scores_gemma":[0.9978548,0.00061223167,0.00021417739,0.0007592984,0.00031786846,0.00024159023],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009991581,0.000555898,0.000500221,0.0055351453,0.00013116782,0.001410525,0.0017335481,0.00039764078,0.000008596902],"category_scores_gemma":[0.00029550318,0.0005458095,0.00011923618,0.0042823832,0.0002536505,0.0011226934,0.0010887762,0.0008993834,0.00058653514],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047989315,0.000022314063,0.00001264381,0.0000581741,0.000009112036,0.000076907054,0.0008987773,0.0015291654,0.00015881077,0.0012021126,0.0000031811553,0.996024],"study_design_scores_gemma":[0.00035615728,0.00088222016,0.0001711153,0.0016410857,0.000025227386,0.00020563327,0.0000032926612,0.5251313,0.0153268585,0.45019197,0.004555295,0.0015098646],"about_ca_topic_score_codex":0.00009435547,"about_ca_topic_score_gemma":0.0010035814,"teacher_disagreement_score":0.99451417,"about_ca_system_score_codex":0.0008662683,"about_ca_system_score_gemma":0.00043494423,"threshold_uncertainty_score":0.99969935},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015730059,0.00033927913,0.98147696,0.000063716,0.00035444793,0.0012285865,0.0003358144,0.000079624435,0.00039148357],"genre_scores_gemma":[0.8314974,0.000022140473,0.1679535,0.000031990065,0.00009422172,0.00006814288,0.000058740105,0.000035619247,0.00023824321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649507,0.00003343504,0.0010067077,0.0009266847,0.00081898976,0.0007191149],"domain_scores_gemma":[0.9981706,0.0004909902,0.00048057144,0.0004526925,0.00032522844,0.00007990475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016355414,0.00041793895,0.00082090934,0.0006724052,0.00021209792,0.00013241904,0.0009574289,0.0003644079,0.0004295721],"category_scores_gemma":[0.000101438985,0.000371352,0.00013944185,0.0002871604,0.001494977,0.00018293897,0.00051446375,0.00021456463,0.000016238177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001258955,0.00022726865,0.0000026004352,0.00057866424,0.00002113706,0.00005276394,0.00019339913,0.42711467,0.41609043,0.141788,0.00003938089,0.013765786],"study_design_scores_gemma":[0.00059735915,0.0007681803,0.000006313863,0.00027976558,0.00010681702,0.000058028658,0.0000029567557,0.3343178,0.32113445,0.3415124,0.0005687112,0.0006471913],"about_ca_topic_score_codex":0.00006738117,"about_ca_topic_score_gemma":0.000003879363,"teacher_disagreement_score":0.81576735,"about_ca_system_score_codex":0.00034487082,"about_ca_system_score_gemma":0.00038175876,"threshold_uncertainty_score":0.9998738},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000113809445,0.00013363587,0.9906407,0.0021868574,0.00034467928,0.0002518238,0.000003504817,0.0003134481,0.006011528],"genre_scores_gemma":[0.18422928,0.00001268626,0.8009947,0.0009996644,0.00053773064,0.00003174076,0.00003193008,0.00009394487,0.0130683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966926,0.000024190345,0.00040204648,0.0014825056,0.00088906044,0.0005095795],"domain_scores_gemma":[0.9982998,0.00018756441,0.00020301527,0.0008509195,0.00028130627,0.00017742508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056079257,0.00044040548,0.00043161583,0.0009045042,0.000376395,0.0009797895,0.001402812,0.00016905236,0.000044869765],"category_scores_gemma":[0.000034029657,0.0003587994,0.00011471385,0.0012887386,0.00032077177,0.0005934822,0.0005879208,0.0006754252,0.00026454014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034858982,0.000023820361,0.000052964308,0.000065970606,0.000040035855,0.00012477426,0.001304684,0.47615945,0.0010509368,0.034395337,0.00005309203,0.48669407],"study_design_scores_gemma":[0.000099520046,0.0005002057,0.00006347682,0.00047343547,0.000019905634,0.000047294463,8.880006e-7,0.97185546,0.0005658617,0.015488173,0.010348098,0.0005376982],"about_ca_topic_score_codex":0.000013570148,"about_ca_topic_score_gemma":0.000056417783,"teacher_disagreement_score":0.49569598,"about_ca_system_score_codex":0.00027240172,"about_ca_system_score_gemma":0.0004561391,"threshold_uncertainty_score":0.9998864},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03211665,0.0062802876,0.9543053,0.004813133,0.0010923633,0.0006028687,0.000011484664,0.00002402364,0.00075390586],"genre_scores_gemma":[0.91977113,0.00011847034,0.07557023,0.0036317417,0.00044368737,0.0000048531,0.000020353385,0.000019979827,0.00041957872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986651,0.000015396825,0.00043302265,0.0004103068,0.00024128868,0.00023488858],"domain_scores_gemma":[0.9993465,0.000087078704,0.00012125075,0.00021722131,0.00014548285,0.00008247349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044660742,0.00015828782,0.00032853178,0.0005660212,0.00007021504,0.000044998997,0.00010363403,0.00012139418,0.000010196844],"category_scores_gemma":[0.00004100766,0.00014381272,0.000029934543,0.0002098935,0.00025754923,0.0001136627,0.000081410726,0.00040776603,0.000002151542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037780304,0.00020398205,0.00085351197,0.0022839832,0.000015388921,0.000016586684,0.06949693,0.13761376,0.0011242671,0.051995713,0.000061564555,0.73629653],"study_design_scores_gemma":[0.000025074505,0.00009840728,0.00007638978,0.0020341848,0.0000068044183,0.000027553611,0.00005554985,0.8618872,0.0011879498,0.13443239,0.000041730756,0.00012672185],"about_ca_topic_score_codex":0.0009872965,"about_ca_topic_score_gemma":0.0009709505,"teacher_disagreement_score":0.8876544,"about_ca_system_score_codex":0.00035076772,"about_ca_system_score_gemma":0.0021124114,"threshold_uncertainty_score":0.5864513},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002839774,0.00007898565,0.9932864,0.001073789,0.001570026,0.0014932858,0.000009925453,0.0002772221,0.0021820185],"genre_scores_gemma":[0.6371211,0.0000010996085,0.36127064,0.0006812493,0.00024087059,0.00011424311,0.000017709284,0.000028227028,0.00052485184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714917,0.000012833117,0.00050228863,0.0010912201,0.000715013,0.0005294849],"domain_scores_gemma":[0.99839115,0.00021432743,0.00022712088,0.00072703604,0.00031245028,0.00012789754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009166592,0.00037156526,0.00033389233,0.00097118766,0.00030212192,0.0009734923,0.0015000616,0.00023953839,0.0000017498859],"category_scores_gemma":[0.000067607,0.00032716122,0.00013673032,0.00054986763,0.00012096646,0.0008825418,0.00045887032,0.00028641455,0.00003860131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038028852,0.000018346971,0.0000020604648,0.00014137987,0.000006252697,0.0000061148967,0.0017060736,0.17674924,0.00010881064,0.5294564,0.000018288489,0.29178327],"study_design_scores_gemma":[0.00011020273,0.00012456997,0.0000044956378,0.000070801354,0.0000060354973,0.000006727987,1.8470816e-7,0.59454155,0.00033528157,0.40398395,0.00057393673,0.00024228753],"about_ca_topic_score_codex":0.000018355373,"about_ca_topic_score_gemma":0.00015839172,"teacher_disagreement_score":0.6370927,"about_ca_system_score_codex":0.0003693211,"about_ca_system_score_gemma":0.0006825461,"threshold_uncertainty_score":0.99991804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043544057,0.00028638635,0.9952193,0.0007519111,0.00037306634,0.00024408389,0.000012299483,0.00008249848,0.0025949972],"genre_scores_gemma":[0.098481946,0.00007513744,0.8995025,0.0006709284,0.000277359,0.0000057310763,0.0000207923,0.000030130475,0.0009354742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966918,0.00005412434,0.000731091,0.0013485426,0.0008044602,0.0003699524],"domain_scores_gemma":[0.99787855,0.00032316177,0.00028545666,0.0009451807,0.00041848558,0.0001491646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014593132,0.00038006422,0.00061056425,0.00090321695,0.00016308225,0.0008756174,0.001330086,0.00020180896,0.000024870324],"category_scores_gemma":[0.00019789985,0.00034157294,0.000110612724,0.00088665524,0.0004023937,0.00088109507,0.0013798659,0.00039686947,0.00005457391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011658598,0.00005782896,0.00012299478,0.00027276741,0.00007065865,0.000067891495,0.002761414,0.10099523,0.110369116,0.09669684,0.000109454166,0.68846416],"study_design_scores_gemma":[0.00009380223,0.000090404625,0.000119414195,0.00023790452,0.000015488005,0.0000073200663,1.4621843e-7,0.96306247,0.0041658897,0.031671286,0.00011757112,0.00041831832],"about_ca_topic_score_codex":0.00008521157,"about_ca_topic_score_gemma":0.00014878882,"teacher_disagreement_score":0.8620672,"about_ca_system_score_codex":0.00012796704,"about_ca_system_score_gemma":0.00026740646,"threshold_uncertainty_score":0.9999036},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013482368,0.0013618204,0.99410427,0.00019972288,0.0017919022,0.0008422859,0.0000025362235,0.00015048932,0.00019871665],"genre_scores_gemma":[0.5418093,0.000004593134,0.45767215,0.00007436202,0.00023628795,0.000059851696,0.0000029359276,0.000036294474,0.000104216226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965718,0.00026911875,0.00053836626,0.0011603485,0.0008966918,0.0005637208],"domain_scores_gemma":[0.9924092,0.0063094883,0.00030420916,0.000819667,0.00010818748,0.00004920716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.009076971,0.00039996667,0.00062534184,0.00069619034,0.000305674,0.0006639712,0.0026136448,0.00020415832,0.0000011954645],"category_scores_gemma":[0.00039476165,0.00029751763,0.00017747881,0.00056795054,0.00049460615,0.0003346332,0.0009589567,0.0013712896,0.0000028099655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002124774,0.000021702814,0.000068149995,0.00033590457,0.000015772177,0.000008024531,0.0059357644,0.13490912,0.00015545118,0.028327154,7.975834e-7,0.8302009],"study_design_scores_gemma":[0.00027466068,0.00046559327,0.00013499011,0.0027131797,0.000015409718,0.000020188898,0.0000029288296,0.8684911,0.0006847113,0.12611516,0.00071676524,0.00036526786],"about_ca_topic_score_codex":0.00008388902,"about_ca_topic_score_gemma":0.000049718827,"teacher_disagreement_score":0.82983565,"about_ca_system_score_codex":0.00032124555,"about_ca_system_score_gemma":0.00042449217,"threshold_uncertainty_score":0.99994767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006395024,0.0003042249,0.9835546,0.0016145143,0.0011244788,0.00021025962,0.000006295105,0.00030755615,0.012814117],"genre_scores_gemma":[0.39313608,0.00004036838,0.5811617,0.005140698,0.002020464,0.00002314134,0.000035105073,0.00023133132,0.018211104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960939,0.000019989928,0.0005346827,0.0016234139,0.0010093375,0.0007186693],"domain_scores_gemma":[0.99781835,0.00032595362,0.00022989254,0.0013310031,0.00013473137,0.00016004484],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008091835,0.00060451863,0.0006173177,0.0010655546,0.00037970586,0.0012914705,0.0025501978,0.00024517623,0.00006250474],"category_scores_gemma":[0.000056708424,0.00050033064,0.00027731614,0.00083349005,0.0004297958,0.0006791675,0.0010420548,0.00091622805,0.00042594035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014090633,0.00003464876,0.000015125757,0.00016614562,0.000051042553,0.00045302117,0.0008007465,0.31731606,0.00022225367,0.10198448,0.00007864279,0.57886374],"study_design_scores_gemma":[0.00008940731,0.00025768316,0.000010060052,0.0007918292,0.000018912024,0.000048022815,1.0309564e-7,0.8850681,0.0007109999,0.109478675,0.0029448601,0.00058135105],"about_ca_topic_score_codex":0.000022119848,"about_ca_topic_score_gemma":0.00005702053,"teacher_disagreement_score":0.5782824,"about_ca_system_score_codex":0.00026464072,"about_ca_system_score_gemma":0.0003565255,"threshold_uncertainty_score":0.9997453},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013588386,0.0008526981,0.9923817,0.0006413124,0.0024180503,0.001062056,0.00021976286,0.00030905163,0.0019795033],"genre_scores_gemma":[0.47566566,0.00006918126,0.52183217,0.0012880454,0.00080039277,0.00009571711,0.000045517023,0.00008771206,0.00011559449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952933,0.000025455005,0.0005212345,0.0022650692,0.001035897,0.00085901545],"domain_scores_gemma":[0.99685764,0.0011214835,0.00011223119,0.0013583779,0.00032665225,0.00022360079],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006598729,0.0006834527,0.00066716823,0.0011880208,0.00037568127,0.00073623075,0.0030553872,0.00040184575,0.000016792488],"category_scores_gemma":[0.00007754943,0.0006337968,0.00039450487,0.0009902568,0.0009272787,0.0004357572,0.0010213397,0.0009722301,0.000038997478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006694811,0.00011099339,0.0000011592581,0.00009380115,0.000069077,0.0000633442,0.004234724,0.024789548,0.00007217194,0.75879717,0.000029558876,0.21167153],"study_design_scores_gemma":[0.00036546699,0.00046274444,0.000018296954,0.0005667802,0.000040346134,0.000024923125,0.0000012203559,0.44941682,0.0017282206,0.5449088,0.0017058569,0.0007605168],"about_ca_topic_score_codex":0.00003496765,"about_ca_topic_score_gemma":0.00024348927,"teacher_disagreement_score":0.4755298,"about_ca_system_score_codex":0.000290483,"about_ca_system_score_gemma":0.0006244776,"threshold_uncertainty_score":0.9996113},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004332621,0.00016397712,0.94297564,0.0013288251,0.010327907,0.00084998057,0.000058911275,0.0003144084,0.043547083],"genre_scores_gemma":[0.9118436,0.00009974363,0.05331546,0.0067758258,0.0038724386,0.000085746935,0.000013872147,0.000251597,0.023741731],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99640447,0.000020602807,0.0004959355,0.0016923599,0.00065030047,0.0007363064],"domain_scores_gemma":[0.99726623,0.0015471956,0.00019889763,0.0007256348,0.00011897795,0.00014307477],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022487993,0.00050709205,0.00048098576,0.0007963576,0.000554448,0.00066640985,0.0010340933,0.0002706097,0.00017844643],"category_scores_gemma":[0.00055810827,0.00045937492,0.0002605814,0.0004059362,0.00041926416,0.00062591134,0.00038152823,0.00072257407,0.00018331288],"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.00012740225,0.00015215958,0.000026149504,0.00057518727,0.00007683881,0.0011336795,0.0051737716,0.08290878,0.5734053,0.0950833,0.002476454,0.23886093],"study_design_scores_gemma":[0.0002608406,0.00020685942,0.0000023180332,0.0008390015,0.000039618215,0.00028148305,0.000001478634,0.14869724,0.4918015,0.18053585,0.17636798,0.0009658431],"about_ca_topic_score_codex":0.000012241419,"about_ca_topic_score_gemma":0.000027162421,"teacher_disagreement_score":0.91141033,"about_ca_system_score_codex":0.00034809258,"about_ca_system_score_gemma":0.00030101184,"threshold_uncertainty_score":0.9997858},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009834283,0.00050179445,0.81282455,0.121850535,0.011064115,0.002001041,0.000008226965,0.0004046528,0.050361656],"genre_scores_gemma":[0.8507902,0.00027031114,0.114900336,0.0056962566,0.020403622,0.00008751834,0.000019368144,0.00008436512,0.0077480013],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977455,0.000044398337,0.00034864468,0.00070194824,0.0007941503,0.0003653375],"domain_scores_gemma":[0.99867487,0.00023589063,0.00015257191,0.0006760859,0.00016139596,0.000099201374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086295133,0.00023757087,0.00029633119,0.00067494594,0.00046006794,0.00020177892,0.0013577107,0.00026455589,0.0002961389],"category_scores_gemma":[0.00030992867,0.00020533365,0.000076056625,0.00040410648,0.0009327186,0.00011943764,0.0012797152,0.0006324395,0.00014796693],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010989237,0.000034447785,0.000021602798,0.000036141697,0.000014603863,0.000022199341,0.03371224,0.0007782004,0.0002143805,0.15912619,0.00036092845,0.80566806],"study_design_scores_gemma":[0.00045315872,0.00033447036,0.00007445359,0.0028846862,0.000056795205,0.000034984532,0.0003339994,0.031147381,0.0013091442,0.57145613,0.39052323,0.0013915907],"about_ca_topic_score_codex":0.00007382743,"about_ca_topic_score_gemma":0.0011050972,"teacher_disagreement_score":0.8498068,"about_ca_system_score_codex":0.00096482685,"about_ca_system_score_gemma":0.00027858396,"threshold_uncertainty_score":0.8373263},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044764996,0.00033331514,0.94352865,0.00067323993,0.0057406765,0.000509261,0.000029780711,0.00014121011,0.004278858],"genre_scores_gemma":[0.99783397,0.000048036083,0.0007436801,0.00042517754,0.00016774588,0.0000052965165,5.095334e-7,0.000023552137,0.0007520266],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982572,0.000023733473,0.00026627432,0.0007680443,0.00041345958,0.00027124828],"domain_scores_gemma":[0.99871796,0.00063880585,0.00014356492,0.0003890239,0.000053885055,0.00005675117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015858882,0.00023828869,0.00024645033,0.00031380416,0.0002640159,0.00026376316,0.00046814652,0.00012686492,0.000017513166],"category_scores_gemma":[0.0002448952,0.00017395616,0.00007896269,0.0003587509,0.0003929289,0.00022903303,0.0003383953,0.0007582733,0.000014182189],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013431073,0.000012685035,0.000035782257,0.00007591145,0.000005078214,0.000014403843,0.0013774369,0.0016806589,0.39880648,0.00049047184,0.000019555107,0.5974681],"study_design_scores_gemma":[0.00010650521,0.00021864289,0.00014950681,0.00023533775,0.000029896746,0.00044244216,0.0000027212966,0.22217396,0.7649074,0.009291306,0.0020530724,0.00038920066],"about_ca_topic_score_codex":0.0002328632,"about_ca_topic_score_gemma":0.00028310003,"teacher_disagreement_score":0.953069,"about_ca_system_score_codex":0.00011918605,"about_ca_system_score_gemma":0.0000978309,"threshold_uncertainty_score":0.70937264},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027875512,0.00011437298,0.9964481,0.00010820314,0.0015813943,0.000421668,0.000013351367,0.0002925653,0.0007415793],"genre_scores_gemma":[0.8035259,0.00003990485,0.19357032,0.0005035913,0.0018604463,0.00007767545,0.00016760988,0.00011444814,0.0001400697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882644,0.000006325474,0.00023548276,0.00042984754,0.00028735178,0.00021454087],"domain_scores_gemma":[0.9994334,0.00014828608,0.0000418336,0.00019163413,0.0001317468,0.000053107764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028597156,0.00023167113,0.00018267076,0.0003833318,0.000116476396,0.00021385653,0.0002468311,0.0001831694,0.00001558427],"category_scores_gemma":[0.000037005775,0.00023603656,0.000055299617,0.00018681782,0.00009009603,0.0004842354,0.00008320064,0.00029750515,0.00002975876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012906315,0.000008907126,0.0000020560317,0.00017735652,0.000016659704,0.00001678143,0.0022244554,0.3771825,0.007605712,0.004379173,0.000040125433,0.60833335],"study_design_scores_gemma":[0.00014315508,0.00014162684,0.0000041039066,0.00034041356,0.000015564567,0.0000060454763,7.244643e-7,0.8450099,0.016984072,0.136263,0.0007332166,0.00035814787],"about_ca_topic_score_codex":0.0000028250918,"about_ca_topic_score_gemma":0.000041526167,"teacher_disagreement_score":0.80324715,"about_ca_system_score_codex":0.00021525208,"about_ca_system_score_gemma":0.000084667015,"threshold_uncertainty_score":0.9625292},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016920765,0.00022439868,0.99227375,0.00059547625,0.0018246709,0.0005655079,0.000006681188,0.000122205,0.004218112],"genre_scores_gemma":[0.2215069,0.000004713267,0.77421236,0.0018435327,0.00066429324,0.000053421383,0.00001419973,0.00009121157,0.0016093593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678063,0.000014394055,0.00037753553,0.0014805202,0.00067097263,0.00067596784],"domain_scores_gemma":[0.998288,0.0003513841,0.00022048016,0.0005826238,0.00043796655,0.00011954607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042926034,0.00052139285,0.00045119747,0.00089035055,0.00028829207,0.00079533475,0.0016167712,0.00020759567,0.000028243787],"category_scores_gemma":[0.00005167037,0.00042831278,0.00015275739,0.0007026587,0.00029007348,0.0008949099,0.00045557373,0.00064769416,0.000057344052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009412,0.00020309763,0.00013316846,0.0009254318,0.00030809786,0.0003172651,0.007262039,0.11281664,0.019339921,0.1556109,0.0008457151,0.7021436],"study_design_scores_gemma":[0.00022320537,0.0007154587,0.000046412064,0.0010893245,0.000023562341,0.00014563966,7.387575e-7,0.90317386,0.015086323,0.07647307,0.0023682916,0.0006540927],"about_ca_topic_score_codex":0.000012260977,"about_ca_topic_score_gemma":0.000024329396,"teacher_disagreement_score":0.79035723,"about_ca_system_score_codex":0.0005146118,"about_ca_system_score_gemma":0.0004941808,"threshold_uncertainty_score":0.9998169},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060727104,0.00083848013,0.9942589,0.00013537038,0.0027743045,0.0008183173,0.000100285084,0.000025877844,0.00044120572],"genre_scores_gemma":[0.28351885,0.000028305803,0.71258795,0.00082841364,0.0018826157,0.000069535214,0.00005416993,0.00009015354,0.0009399764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984086,0.0000079354995,0.0004233735,0.0005062162,0.0003937635,0.0002600815],"domain_scores_gemma":[0.99832404,0.0008385062,0.00023853668,0.00015895066,0.00038836407,0.00005160063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052074314,0.00025135095,0.00041015077,0.00032114683,0.00023345972,0.00018026424,0.00024234087,0.00007909432,0.000061811996],"category_scores_gemma":[0.000075968936,0.0002159412,0.00018871581,0.00003122142,0.00044624717,0.000112835616,0.00013377416,0.00016176316,0.0000018202584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001713243,0.0001226849,0.000036979283,0.002673632,0.00036259744,0.000008677951,0.035659194,0.0490355,0.0349645,0.6592232,0.000041565403,0.21770018],"study_design_scores_gemma":[0.0013021586,0.00034743187,0.000007794703,0.0054369303,0.00022264067,0.000024114197,0.00010914461,0.8970044,0.008484615,0.051563144,0.034709625,0.00078799325],"about_ca_topic_score_codex":0.0000803331,"about_ca_topic_score_gemma":0.00017237957,"teacher_disagreement_score":0.84796894,"about_ca_system_score_codex":0.00020433925,"about_ca_system_score_gemma":0.00016090725,"threshold_uncertainty_score":0.88058263},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047352067,0.000043798995,0.97636527,0.0095615,0.0088311015,0.0011930864,0.0000083667965,0.00007682041,0.0038727296],"genre_scores_gemma":[0.15550077,0.00014928992,0.717253,0.01571638,0.09279606,0.0007548131,0.000081373975,0.0003280421,0.017420258],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997266,0.000028281469,0.00041501597,0.0012816164,0.0005663449,0.00044274307],"domain_scores_gemma":[0.9979629,0.00043331357,0.00020088568,0.00096939167,0.00034915097,0.000084342726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072593376,0.00041614778,0.00034992452,0.0007462014,0.00031647188,0.00075391325,0.0020188726,0.00017660885,0.000039752766],"category_scores_gemma":[0.0001318492,0.0002858304,0.00020035973,0.0005122025,0.00018965483,0.00087383675,0.00064979034,0.0006756225,0.0001576535],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016889113,0.00010085693,0.0000041170756,0.00029071636,0.00009451693,0.000032481978,0.008160375,0.0076986263,0.024342,0.1800372,0.01837993,0.7606903],"study_design_scores_gemma":[0.00027047173,0.0011879182,0.000028681774,0.0021267775,0.00006423435,0.0001712781,0.000011720941,0.3225617,0.109786175,0.37085065,0.19155414,0.0013862341],"about_ca_topic_score_codex":0.000008951766,"about_ca_topic_score_gemma":0.000041741965,"teacher_disagreement_score":0.75930405,"about_ca_system_score_codex":0.0005529562,"about_ca_system_score_gemma":0.00015853769,"threshold_uncertainty_score":0.9999594},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051143934,0.00033631656,0.99166036,0.0005333065,0.0030752125,0.00042872017,0.00007831347,0.00007776577,0.0032985471],"genre_scores_gemma":[0.46418998,0.000080022124,0.474737,0.0067539713,0.015534864,0.00012896792,0.00012464682,0.0003181249,0.03813243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819016,0.000014018221,0.00033132752,0.00061531697,0.00051004335,0.00033913465],"domain_scores_gemma":[0.99878967,0.00035593187,0.00014674208,0.00042017383,0.00023121221,0.000056282646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005921056,0.00029766673,0.00029896278,0.0001753132,0.00046214013,0.000691542,0.0005652491,0.00012505362,0.00011506205],"category_scores_gemma":[0.00004405665,0.00019066007,0.00014745315,0.000057696387,0.00067090604,0.00019475941,0.0002709914,0.0004676795,0.000013692319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013082901,0.000032036387,0.000010882378,0.00026144378,0.000042160234,0.000009659259,0.009458966,0.11394912,0.00011668601,0.76036686,0.0006398944,0.11509922],"study_design_scores_gemma":[0.00014848652,0.00009962191,0.000006280745,0.00040491074,0.000053051644,0.000004881052,0.0000145324275,0.70606714,0.00004672096,0.2402466,0.052429345,0.00047845583],"about_ca_topic_score_codex":0.000096327,"about_ca_topic_score_gemma":0.0007790863,"teacher_disagreement_score":0.592118,"about_ca_system_score_codex":0.00021733483,"about_ca_system_score_gemma":0.00036313405,"threshold_uncertainty_score":0.7774892},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003298528,0.0005754832,0.9899585,0.0011595417,0.0007518917,0.0003503098,0.000019703562,0.0001694275,0.0066852453],"genre_scores_gemma":[0.6663239,0.00003393581,0.33026743,0.0010422105,0.00051172473,0.000022333661,0.000005767643,0.00005221301,0.0017404993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674034,0.00001116535,0.00052027387,0.0013958586,0.0007706829,0.000561649],"domain_scores_gemma":[0.99784833,0.00026174562,0.0002001738,0.0013416783,0.00018903286,0.00015905929],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002987656,0.00045450087,0.0004968947,0.00040024542,0.00016910069,0.00032132253,0.0029341285,0.00025956138,0.000029631741],"category_scores_gemma":[0.000013846062,0.0003894042,0.00019898215,0.000610721,0.0011897911,0.00036793377,0.0014974449,0.0007653311,0.00006544944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027301805,0.000053626984,0.000008405468,0.000034678662,0.000015482858,0.000019084842,0.0009805918,0.326094,0.0035721774,0.39752695,0.00016753051,0.27152476],"study_design_scores_gemma":[0.00007450776,0.000092475086,0.000006220507,0.00018710032,0.0000097238035,0.000016454702,1.6754157e-7,0.74188364,0.00082364684,0.25574234,0.0008363907,0.000327328],"about_ca_topic_score_codex":0.000017198818,"about_ca_topic_score_gemma":0.00012891844,"teacher_disagreement_score":0.66599405,"about_ca_system_score_codex":0.0001544253,"about_ca_system_score_gemma":0.00030985064,"threshold_uncertainty_score":0.99985576},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029002945,0.05849266,0.52299255,0.026141241,0.027355678,0.0051774294,0.00009966778,0.000894419,0.35594606],"genre_scores_gemma":[0.73081267,0.009900281,0.04446111,0.0021359106,0.00912123,0.00006901343,0.000056104185,0.00019265244,0.20325102],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99669826,0.000045602763,0.0004374649,0.0010830313,0.0009986779,0.0007369778],"domain_scores_gemma":[0.9987832,0.00023750469,0.00018643486,0.00037034057,0.00018950982,0.00023304169],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006190171,0.000548077,0.00051408546,0.00013416645,0.0005780465,0.0009690969,0.0012658513,0.00039964257,0.0006676526],"category_scores_gemma":[0.00017159549,0.00040096696,0.00018314441,0.00040721562,0.0012934561,0.0009299391,0.0005974422,0.00078775897,0.00007021044],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100571204,0.00010276622,0.00048780866,0.0003266246,0.00028365705,0.0012082842,0.21508913,0.01570704,0.00092844345,0.055580232,0.011716291,0.69846916],"study_design_scores_gemma":[0.0012368219,0.00082686846,0.0020941938,0.00863463,0.00015491818,0.00023787109,0.0010140392,0.016122052,0.0011339679,0.24443118,0.71633506,0.0077784145],"about_ca_topic_score_codex":0.002204655,"about_ca_topic_score_gemma":0.0066784467,"teacher_disagreement_score":0.72791237,"about_ca_system_score_codex":0.0015166654,"about_ca_system_score_gemma":0.0006616661,"threshold_uncertainty_score":0.9998442},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014295173,0.05405185,0.8554657,0.0067033046,0.007592857,0.0030339342,0.0011174738,0.0004658999,0.057273813],"genre_scores_gemma":[0.9699336,0.00012066294,0.026659528,0.00079198985,0.00060487434,0.0000051026705,0.000103010214,0.000018306255,0.0017629005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761397,0.0000300095,0.000322937,0.001055682,0.0004502544,0.0005271547],"domain_scores_gemma":[0.9987144,0.0007252758,0.00006755643,0.0002820404,0.000033270382,0.00017747596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005830308,0.0004114221,0.00039094468,0.00013830113,0.00039742512,0.00048714288,0.00054965814,0.0002641224,0.00013152667],"category_scores_gemma":[0.00013550445,0.00030167057,0.00010139447,0.0001229408,0.0011358849,0.00038518317,0.00018429114,0.0005216764,0.000050005576],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054672153,0.000019335712,0.001821649,0.00040914657,0.00004638275,0.0001527226,0.0061131935,0.007132213,0.00007031554,0.005386553,0.0001181466,0.97867566],"study_design_scores_gemma":[0.0008890331,0.0012571916,0.004780461,0.0020731878,0.0001396269,0.000244653,0.00020006999,0.59053814,0.00038967948,0.3576933,0.03847117,0.0033234435],"about_ca_topic_score_codex":0.00012394966,"about_ca_topic_score_gemma":0.0018515063,"teacher_disagreement_score":0.9753522,"about_ca_system_score_codex":0.000037729293,"about_ca_system_score_gemma":0.00005961939,"threshold_uncertainty_score":0.99994355},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004411849,0.00041813613,0.9813237,0.0046036956,0.0044749845,0.00054068485,9.172827e-7,0.0005062096,0.0076904753],"genre_scores_gemma":[0.7549903,0.00028314587,0.17577055,0.0043886555,0.008057177,0.00016413175,0.00005526653,0.00028935916,0.056001406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960107,0.00004345164,0.0005608185,0.0020638802,0.00063636317,0.0006847381],"domain_scores_gemma":[0.9975542,0.00040096327,0.00031099166,0.001224859,0.00043224942,0.000076779936],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010035712,0.00059940043,0.00045157937,0.002636002,0.00048756445,0.0010680183,0.0015454615,0.00051990984,0.000033745866],"category_scores_gemma":[0.00015261193,0.00057219097,0.00008682842,0.0014075405,0.0007960524,0.0014478234,0.001383989,0.002315096,0.00010487161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003113163,0.00004718107,0.000010944659,0.00010064763,0.000037223588,0.00026494637,0.0008162243,0.0049159015,0.00051918224,0.68743736,0.0012813079,0.30453798],"study_design_scores_gemma":[0.00030778846,0.00066983385,0.0000708272,0.0018848296,0.000028456925,0.00029796784,0.000008040373,0.048258435,0.006289555,0.9060987,0.034759283,0.0013262507],"about_ca_topic_score_codex":0.000012518167,"about_ca_topic_score_gemma":0.000023072493,"teacher_disagreement_score":0.80555314,"about_ca_system_score_codex":0.0011157723,"about_ca_system_score_gemma":0.00017065929,"threshold_uncertainty_score":0.9999866},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080264354,0.0029221259,0.99303144,0.0006976805,0.0016792832,0.00048475657,0.000008148392,0.00017181884,0.00020212871],"genre_scores_gemma":[0.9705654,0.00004086105,0.02189706,0.0006305573,0.006286275,0.00006984817,0.00017460911,0.000106352345,0.00022904026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719715,0.000002770698,0.00057292124,0.0011217409,0.0005713845,0.0005340332],"domain_scores_gemma":[0.99817246,0.00009462502,0.00032461222,0.00028584784,0.001102677,0.000019778367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006394436,0.0004673366,0.00050252466,0.0014396516,0.00026121634,0.0009627959,0.0006458413,0.00032744426,0.000012871198],"category_scores_gemma":[0.00010639752,0.00042014467,0.000099392986,0.002938824,0.00048156976,0.001039415,0.00036917505,0.00047317395,0.000008245249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052723808,0.000042631502,0.0047107968,0.0015350236,0.000022326913,0.000019761655,0.000038544804,0.92892194,0.0000018438791,0.0017098843,0.000030363764,0.06291414],"study_design_scores_gemma":[0.0002277066,0.000006054003,0.00031932318,0.0027956914,0.00007971082,0.0000049536916,4.4256052e-7,0.9379425,0.0000018564214,0.056729607,0.0014524995,0.00043967037],"about_ca_topic_score_codex":0.000097159944,"about_ca_topic_score_gemma":0.00018523839,"teacher_disagreement_score":0.97113436,"about_ca_system_score_codex":0.00018326366,"about_ca_system_score_gemma":0.00041777964,"threshold_uncertainty_score":0.99982506},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017756542,0.0012166919,0.9846153,0.0019321542,0.0027072562,0.00029135097,0.000009689203,0.00022668723,0.008823271],"genre_scores_gemma":[0.8816362,0.0005705348,0.11575646,0.0010207122,0.0005467626,0.000031328793,0.0000028464426,0.00005225798,0.0003829091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99544454,0.00004490287,0.000797259,0.001644453,0.001268198,0.00080067216],"domain_scores_gemma":[0.9963364,0.00090330216,0.0003112506,0.002022126,0.00030937698,0.00011755385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008760594,0.0006591856,0.00066394906,0.0004509517,0.00026956594,0.00064328156,0.004779811,0.0002707942,0.000011794569],"category_scores_gemma":[0.00011448552,0.00047490606,0.00020928418,0.0009603057,0.0011246187,0.0014004784,0.0020644022,0.0015023502,0.00009373034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004774681,0.000024846679,0.00001096777,0.000109113316,0.000027762764,0.00006835358,0.0044968,0.0688395,0.00013134265,0.67410576,0.00002412107,0.25215665],"study_design_scores_gemma":[0.000099191224,0.00017543552,0.00003292782,0.0009514075,0.000020029027,0.000043291842,0.0000010861437,0.3107896,0.0010615018,0.684784,0.0014243454,0.0006172304],"about_ca_topic_score_codex":0.00013347021,"about_ca_topic_score_gemma":0.00009099705,"teacher_disagreement_score":0.88145864,"about_ca_system_score_codex":0.00019451376,"about_ca_system_score_gemma":0.00075899233,"threshold_uncertainty_score":0.9997703},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003077201,0.0003349112,0.99485195,0.00062712625,0.0014286872,0.0013834148,0.00004147378,0.000074577074,0.00095017167],"genre_scores_gemma":[0.28285453,0.00005596102,0.71498996,0.00038689704,0.00069486693,0.000082229024,0.00013274844,0.000067207664,0.00073556014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766546,0.000069363894,0.0008603692,0.00066005444,0.00035687932,0.00038784498],"domain_scores_gemma":[0.99598724,0.002003483,0.0003209095,0.00032769435,0.001287127,0.000073568706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013079857,0.00026747445,0.0004417705,0.0005819378,0.0007499397,0.00008084223,0.00024553266,0.00045290482,0.00006641358],"category_scores_gemma":[0.00088848366,0.00024100256,0.00007895334,0.00041585346,0.00016223315,0.00028326147,0.00013605173,0.0007317523,0.000008268897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011107276,0.0000074223394,0.00012469369,0.00029733856,0.000008378376,7.4472194e-7,0.0012603814,0.9661242,0.000021559856,0.019191258,0.0000024061803,0.012950546],"study_design_scores_gemma":[0.000149998,0.00010409772,0.000016874108,0.0012423098,0.0000142841045,4.0962934e-7,0.000004700027,0.98157895,0.000099223966,0.016350115,0.000223202,0.00021585639],"about_ca_topic_score_codex":0.000045500517,"about_ca_topic_score_gemma":0.00015547841,"teacher_disagreement_score":0.28254682,"about_ca_system_score_codex":0.00035998508,"about_ca_system_score_gemma":0.0016143043,"threshold_uncertainty_score":0.98278},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050604654,0.0024785437,0.9817201,0.0008564948,0.004194736,0.00021146347,0.0000023100026,0.00045223677,0.010079056],"genre_scores_gemma":[0.43832144,0.00034647007,0.5502345,0.004469595,0.0027351363,0.000026091879,0.000012743646,0.0001500544,0.0037039947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955788,0.00002245776,0.00055635814,0.0020171602,0.00092713756,0.0008980683],"domain_scores_gemma":[0.99751276,0.00028876463,0.00015778732,0.0015603253,0.00020892793,0.00027143495],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008015258,0.000647828,0.0005393175,0.00074040116,0.00022067064,0.0012610924,0.0038980055,0.00050666445,0.000030278112],"category_scores_gemma":[0.0000339004,0.0005803671,0.00017153492,0.00077837944,0.0006023151,0.00051062246,0.0018529986,0.0016219332,0.00025226493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001988217,0.000011890097,0.000004557742,0.000029946234,0.000012896019,0.0002399691,0.00029706984,0.1838423,0.000014291514,0.23406747,0.00004783908,0.5814298],"study_design_scores_gemma":[0.000053491716,0.00006915679,0.0000052744867,0.00028384113,0.000007170458,0.00007604898,3.178429e-8,0.6426066,0.000047576872,0.35555875,0.0008462513,0.00044578503],"about_ca_topic_score_codex":0.000021958554,"about_ca_topic_score_gemma":0.00008201473,"teacher_disagreement_score":0.580984,"about_ca_system_score_codex":0.00027599596,"about_ca_system_score_gemma":0.000488317,"threshold_uncertainty_score":0.9997757},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014869822,0.0005484727,0.9931726,0.0009797256,0.001834487,0.0006187206,0.00001700705,0.0010463984,0.0016339207],"genre_scores_gemma":[0.48776445,0.00010164813,0.50968975,0.001011476,0.00048488495,0.000041233674,0.000008831071,0.00010906294,0.00078864454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99425036,0.000052242467,0.00084893644,0.0025879876,0.001235523,0.0010249657],"domain_scores_gemma":[0.99678737,0.00051314174,0.00033590329,0.0018871042,0.00024711617,0.0002293669],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0009310134,0.0008571005,0.00079125696,0.001467352,0.00023154446,0.0006773656,0.004013449,0.0005769194,0.000015556669],"category_scores_gemma":[0.00014445104,0.00083578733,0.00019478893,0.0014100492,0.0007600832,0.0007998283,0.0029731228,0.0023936103,0.00008217738],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018843226,0.000094262825,0.0002095524,0.0006867401,0.000033623557,0.0028872944,0.0049218847,0.07435414,0.0022741894,0.05518143,0.000088988,0.85924906],"study_design_scores_gemma":[0.00013199222,0.00017701321,0.0000253816,0.0013994572,0.000008575227,0.00028698798,4.9146587e-7,0.54810804,0.007948742,0.43693203,0.0039210324,0.0010602506],"about_ca_topic_score_codex":0.00013360365,"about_ca_topic_score_gemma":0.00084758044,"teacher_disagreement_score":0.8581888,"about_ca_system_score_codex":0.0010341384,"about_ca_system_score_gemma":0.0004489998,"threshold_uncertainty_score":0.9999079},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015739235,0.00054101076,0.99170154,0.0013729768,0.0012291233,0.0006143123,0.000012761843,0.00034805387,0.0040228423],"genre_scores_gemma":[0.20569217,0.000042610696,0.7903318,0.0016256318,0.000931427,0.00007888212,0.000019260173,0.000088639266,0.0011895902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966857,0.000022235374,0.0003640213,0.0016208182,0.00070098933,0.0006062359],"domain_scores_gemma":[0.9975625,0.00051678915,0.00018416556,0.001312428,0.00026710503,0.0001569933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085572386,0.00052272656,0.00043211455,0.0009638017,0.0003027034,0.00088233553,0.0026424767,0.00024283881,0.00001119068],"category_scores_gemma":[0.000035381745,0.0004198536,0.00019534871,0.00086819555,0.0006053846,0.00053413893,0.0006352376,0.0005417993,0.000034860426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023674289,0.000022388336,0.0000126828645,0.00011596268,0.000027000897,0.000023588007,0.00091499917,0.007022963,0.00012397564,0.6463792,0.000045073863,0.34528852],"study_design_scores_gemma":[0.00021959428,0.00034037977,0.00003771231,0.00063729635,0.00001839831,0.000047480204,2.385963e-7,0.23868579,0.0008884201,0.75538886,0.0031870056,0.0005488632],"about_ca_topic_score_codex":0.0000061279766,"about_ca_topic_score_gemma":0.00006096885,"teacher_disagreement_score":0.34473965,"about_ca_system_score_codex":0.00015560452,"about_ca_system_score_gemma":0.00033425193,"threshold_uncertainty_score":0.99982536},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015910564,0.00059315306,0.9876259,0.00036639333,0.0012259404,0.0004150713,0.000004642871,0.004953212,0.004656612],"genre_scores_gemma":[0.16865754,0.000011097148,0.8285397,0.00075677474,0.00042454022,0.00002286585,0.0000040575696,0.000086026856,0.0014973576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961433,0.00004339857,0.00042771857,0.0018503413,0.00083262846,0.0007026037],"domain_scores_gemma":[0.9969488,0.0007373893,0.00021968018,0.001647123,0.00027316395,0.00017385058],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013318883,0.0006004448,0.0005484895,0.0007868899,0.0007759135,0.0025334323,0.003919101,0.00026028565,0.000012075385],"category_scores_gemma":[0.00015562335,0.0004993553,0.000093979885,0.001152281,0.0006653795,0.001042261,0.0035551921,0.0014654812,0.000031030624],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025531785,0.00009237865,0.0010118001,0.0003318955,0.0000810043,0.00051258074,0.00461648,0.17985407,0.00006527019,0.038963746,0.0010436889,0.77340156],"study_design_scores_gemma":[0.00011974908,0.0001977979,0.000010336558,0.0014694717,0.000017861721,0.000311703,2.2693206e-7,0.510521,0.0003420677,0.4833338,0.0029915697,0.000684401],"about_ca_topic_score_codex":0.00029241526,"about_ca_topic_score_gemma":0.000098989985,"teacher_disagreement_score":0.7727172,"about_ca_system_score_codex":0.0003673792,"about_ca_system_score_gemma":0.00072699145,"threshold_uncertainty_score":0.9997458},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017883716,0.0013725429,0.98418987,0.00056993234,0.00225079,0.0006868902,0.000016624204,0.010036278,0.0006982653],"genre_scores_gemma":[0.21590504,0.000011770768,0.7821957,0.00077965076,0.0005876163,0.000053766318,0.000009343342,0.00008768655,0.00036944263],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954625,0.000028576394,0.00058649713,0.0021273354,0.00086786924,0.0009272516],"domain_scores_gemma":[0.9952256,0.0025430797,0.0002537925,0.0015366732,0.00026660255,0.00017421528],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00095217745,0.0007550332,0.0006752924,0.0014133004,0.00047535976,0.0013361865,0.0030500942,0.00041146355,0.0000041359835],"category_scores_gemma":[0.0008913472,0.0006708308,0.00027053786,0.0008127369,0.0006448323,0.00030766716,0.0018113843,0.00102707,0.000013286366],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022455743,0.000045126457,0.00066571863,0.00033371625,0.00005725818,0.00018458269,0.0022660748,0.026586164,0.0004456859,0.025589349,0.0005829662,0.9432209],"study_design_scores_gemma":[0.0001226253,0.00010978819,0.00010195904,0.00076859136,0.000010842466,0.000052688465,2.4774817e-8,0.48480445,0.0009143779,0.51140743,0.0011789704,0.00052825897],"about_ca_topic_score_codex":0.00009089639,"about_ca_topic_score_gemma":0.000067170724,"teacher_disagreement_score":0.94269264,"about_ca_system_score_codex":0.000296644,"about_ca_system_score_gemma":0.00039735303,"threshold_uncertainty_score":0.99970055},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030337866,0.0005266578,0.9953116,0.0013890342,0.0008431515,0.0010059464,0.000036885613,0.00062382425,0.00023253914],"genre_scores_gemma":[0.022087658,0.00004033603,0.97582376,0.0009290934,0.00027760497,0.00009598343,0.00000746249,0.000052810206,0.00068528287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668366,0.000022697724,0.0004794479,0.0016615558,0.00062163634,0.00053103233],"domain_scores_gemma":[0.99775106,0.00037669874,0.00017343054,0.0011796829,0.0003405683,0.00017854084],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006126174,0.0005155707,0.00043817153,0.0006994574,0.00021965728,0.001283008,0.0018595435,0.0003569814,0.0000043890786],"category_scores_gemma":[0.00019378522,0.00047203247,0.000101557765,0.00041465863,0.0005228953,0.00054821005,0.0015032162,0.0006539868,0.0000073146857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059184025,0.000056542016,0.000030976138,0.0006811855,0.000051643845,0.00018138268,0.0016235292,0.0404357,0.00008420877,0.22213992,0.00047022392,0.7341855],"study_design_scores_gemma":[0.0001572468,0.00022653969,0.000035396424,0.00036339046,0.000011995336,0.000055125387,8.078375e-8,0.74608594,0.0001852281,0.24991119,0.002507262,0.00046060205],"about_ca_topic_score_codex":0.000019122459,"about_ca_topic_score_gemma":0.000037449387,"teacher_disagreement_score":0.7337249,"about_ca_system_score_codex":0.00018646408,"about_ca_system_score_gemma":0.00033024422,"threshold_uncertainty_score":0.99977314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009994551,0.0002461486,0.99278134,0.0014998103,0.0021676843,0.0005791747,0.00003630338,0.00020218085,0.00238741],"genre_scores_gemma":[0.50865763,0.000043795262,0.4883475,0.002047698,0.0006166399,0.00007704785,0.000031664735,0.000034236924,0.00014376179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761444,0.000019127003,0.00043498082,0.0008957419,0.00063046947,0.00040521641],"domain_scores_gemma":[0.9976589,0.0010424367,0.00019884678,0.0007056458,0.00026034098,0.00013385083],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005870699,0.0003836626,0.00030989115,0.0006702949,0.00036619342,0.0011005691,0.0010050578,0.00033081856,0.000012177626],"category_scores_gemma":[0.00015119655,0.00035944668,0.000103747334,0.0004248181,0.00030128192,0.0006530634,0.00023751159,0.00074973865,0.000028569902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009801859,0.000023392739,0.000018227123,0.00015767115,0.000009669506,0.000013121218,0.0048641497,0.009800874,0.000011184452,0.84467465,0.000039266593,0.14037797],"study_design_scores_gemma":[0.000121627716,0.00009816865,0.00004911451,0.0004952632,0.000005953265,0.000006244938,0.0000010605979,0.54403055,0.00068587874,0.45286328,0.0013613227,0.0002815218],"about_ca_topic_score_codex":0.000009999632,"about_ca_topic_score_gemma":0.000026990489,"teacher_disagreement_score":0.5342297,"about_ca_system_score_codex":0.0001833478,"about_ca_system_score_gemma":0.0003605851,"threshold_uncertainty_score":0.9999364},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008093149,0.0010324448,0.9898193,0.00055625767,0.0021348991,0.0006058845,0.000011742223,0.00024279678,0.004787348],"genre_scores_gemma":[0.8637427,0.00006447803,0.13431066,0.00083698786,0.00072748156,0.000023673787,0.000010372257,0.000046734003,0.00023689988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600685,0.000026401382,0.00065421796,0.0017403839,0.0008146283,0.00075753336],"domain_scores_gemma":[0.9979029,0.00057835766,0.00022444707,0.0009922605,0.00015608876,0.00014590666],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014896631,0.0005242875,0.000567876,0.0010071989,0.00025584572,0.0011947954,0.002003511,0.0005143937,0.00001934369],"category_scores_gemma":[0.00007450075,0.00050694036,0.00020190455,0.0007516783,0.00037253927,0.001524217,0.0010330752,0.0014735536,0.000021309606],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014165105,0.0000920453,0.000004248649,0.00027295662,0.000015574533,0.00030422496,0.0042046127,0.07041068,0.0002579604,0.119165555,0.00004736833,0.8052106],"study_design_scores_gemma":[0.00015540521,0.00005872753,0.000033490516,0.0005086482,0.0000063117964,0.000034133765,0.0000011576927,0.61519915,0.00044342934,0.3828446,0.00033674805,0.00037821927],"about_ca_topic_score_codex":0.00010997566,"about_ca_topic_score_gemma":0.0008483146,"teacher_disagreement_score":0.8629334,"about_ca_system_score_codex":0.0003969139,"about_ca_system_score_gemma":0.00041044815,"threshold_uncertainty_score":0.99984205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031423604,0.00050122454,0.9932508,0.000107861306,0.0005565092,0.0002782821,0.0000131779525,0.000034068427,0.0021157565],"genre_scores_gemma":[0.8746528,0.00012129744,0.119705915,0.00030868914,0.0009475535,0.000028478149,0.00018782592,0.000069872425,0.003977537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986648,0.000006148329,0.00030273874,0.0005650218,0.00016103178,0.00030026215],"domain_scores_gemma":[0.99923027,0.00004026112,0.00012175317,0.00042221285,0.00011990327,0.00006561942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031774517,0.0002625577,0.00020546211,0.00017841598,0.00019536217,0.00022739673,0.0005143804,0.00020170052,0.0000033781191],"category_scores_gemma":[0.000048192218,0.00023652165,0.00011028454,0.00007602265,0.00009310312,0.0000249738,0.0002996454,0.00042272217,0.000005348004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028435577,0.000020660753,0.000039865175,0.00012699045,0.000041458763,0.000001818043,0.0008949783,0.7547596,0.027406171,0.0011365154,0.000049632865,0.21549387],"study_design_scores_gemma":[0.00011659008,0.00024962265,0.0000034748577,0.00013743807,0.0000181756,0.000024556788,0.000001957828,0.9787194,0.0062816204,0.010508048,0.0036657513,0.0002733519],"about_ca_topic_score_codex":0.000005814079,"about_ca_topic_score_gemma":0.00004835231,"teacher_disagreement_score":0.8735449,"about_ca_system_score_codex":0.000045149678,"about_ca_system_score_gemma":0.00018307703,"threshold_uncertainty_score":0.9645073},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037510507,0.00013797857,0.98552626,0.00024388258,0.0004753754,0.00032769205,0.000014948211,0.000042991054,0.009479814],"genre_scores_gemma":[0.8756486,0.000019882948,0.11204659,0.0005346286,0.00090302364,0.00002247767,0.00026184824,0.000059672326,0.010503237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982866,0.000008786916,0.0003155802,0.00068871136,0.00042904698,0.00027125864],"domain_scores_gemma":[0.9990887,0.0000347715,0.00017159735,0.00048541382,0.00015673772,0.000062786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000326775,0.00032121254,0.00018676385,0.00020934406,0.00011474909,0.00015603195,0.0005065613,0.00034536354,0.00001935878],"category_scores_gemma":[0.00010371522,0.0002786704,0.00006793076,0.00015188409,0.00027147014,0.000013322357,0.00023282607,0.00059636397,0.00002795488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061731575,0.000026585265,0.000004682495,0.00011002485,0.000023233819,0.0000020821278,0.00011927379,0.6353947,0.30229232,0.009733283,0.00006500959,0.05216706],"study_design_scores_gemma":[0.00014009658,0.00039945956,0.00005816781,0.0002681175,0.000009122199,0.000014806867,2.7328318e-7,0.97112983,0.017336037,0.009151344,0.001129163,0.00036356586],"about_ca_topic_score_codex":0.000003112867,"about_ca_topic_score_gemma":0.00003097687,"teacher_disagreement_score":0.87347966,"about_ca_system_score_codex":0.000069461414,"about_ca_system_score_gemma":0.00044437707,"threshold_uncertainty_score":0.99996656},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54962426,0.009871531,0.43694046,0.00036783476,0.0011391888,0.0006955642,0.0001647736,0.000032473567,0.001163899],"genre_scores_gemma":[0.99782974,0.00010005748,0.0013689985,0.00015341875,0.000241559,0.000006688301,0.000058679812,0.000023077193,0.0002177614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868965,0.00003528612,0.0002626709,0.0005960999,0.0001994311,0.00021688198],"domain_scores_gemma":[0.99929994,0.000101986654,0.00011918366,0.00031739147,0.0001025183,0.000058979753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017938075,0.00021278532,0.00018717046,0.00014540237,0.00012287893,0.00006024357,0.0003634895,0.00012003263,0.0000042398015],"category_scores_gemma":[0.00012477888,0.00016176766,0.000111696245,0.0001467281,0.00035612314,0.0000048080447,0.00033451687,0.0002982596,0.0000020974887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006487181,0.000096984164,0.0023117422,0.000167653,0.00007294294,0.00031629734,0.0017017798,0.6881181,0.21817829,0.00076102174,0.000022283863,0.088188],"study_design_scores_gemma":[0.0013458629,0.0017783663,0.008469794,0.001499111,0.0003995127,0.00055741577,0.000036370857,0.650821,0.22248664,0.10607537,0.0037995393,0.0027310634],"about_ca_topic_score_codex":0.000022507249,"about_ca_topic_score_gemma":0.00012638675,"teacher_disagreement_score":0.4482055,"about_ca_system_score_codex":0.000026796897,"about_ca_system_score_gemma":0.0002650965,"threshold_uncertainty_score":0.6596694},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064432668,0.0001715237,0.990753,0.00008909187,0.00010722631,0.0005134429,0.000009799544,0.00012915193,0.0017834846],"genre_scores_gemma":[0.69428396,0.000121403005,0.3038971,0.000102895036,0.0006032947,0.00010161498,0.000035549383,0.00010330867,0.0007508513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981445,0.000005027983,0.00046497973,0.00069024233,0.00036529056,0.0003299548],"domain_scores_gemma":[0.9985502,0.00015793536,0.00046512537,0.000637114,0.00014497749,0.00004464995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031634813,0.00030180853,0.00027597867,0.00018652981,0.0002851056,0.00019290682,0.0008383022,0.00022381879,0.000019191182],"category_scores_gemma":[0.00006173662,0.00023908154,0.00009063318,0.00022553527,0.00028816672,0.00035548827,0.0007472207,0.0010270865,0.0000019645322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008405194,0.0000082786055,0.000019362278,0.00034873147,0.000008722394,0.0000043627074,0.00081394607,0.08872242,0.39325157,0.00722282,5.6370826e-8,0.50959134],"study_design_scores_gemma":[0.000046345467,0.000018129469,0.0000013743036,0.00079714286,0.000015082943,0.0000204943,9.739906e-7,0.7261029,0.19398664,0.07850271,0.00025545713,0.0002527421],"about_ca_topic_score_codex":0.000022866108,"about_ca_topic_score_gemma":0.0000044967483,"teacher_disagreement_score":0.6878407,"about_ca_system_score_codex":0.00024283797,"about_ca_system_score_gemma":0.00015483129,"threshold_uncertainty_score":0.9749462},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031750584,0.001401437,0.9925677,0.00007606132,0.0016171916,0.00022221872,0.0002253055,0.0004973957,0.00021760333],"genre_scores_gemma":[0.83446676,0.0000504457,0.16415347,0.00035487532,0.00048511106,0.0000074864224,0.0002630673,0.00011762355,0.00010118681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817735,0.0000072137186,0.0003692483,0.0006987782,0.00032085032,0.0004265557],"domain_scores_gemma":[0.9992357,0.00013732954,0.00006548386,0.0004484259,0.00004669109,0.00006635277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045093492,0.0003654977,0.00031458677,0.00059010234,0.00016254935,0.00009716541,0.000488414,0.000381033,0.000041585972],"category_scores_gemma":[0.000021058471,0.00037066694,0.00005631609,0.00027445177,0.0002998721,0.0002380734,0.0002744205,0.0011710124,0.000080445534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007264827,0.000019098172,0.000023464496,0.00045456423,0.000069413,0.00030155905,0.0016032446,0.8933096,0.012442521,0.005042618,0.00003360256,0.08669305],"study_design_scores_gemma":[0.00009757538,0.000015964775,0.000011342152,0.00052378443,0.000018298815,0.0000570031,3.7113466e-7,0.9670476,0.006512764,0.024569934,0.00075366494,0.00039172056],"about_ca_topic_score_codex":0.000022967095,"about_ca_topic_score_gemma":0.00018164229,"teacher_disagreement_score":0.8312917,"about_ca_system_score_codex":0.00042286448,"about_ca_system_score_gemma":0.00016289765,"threshold_uncertainty_score":0.99987453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023630052,0.00023841496,0.9810977,0.0002828609,0.0020633175,0.0002173027,0.0000072751295,0.00045265665,0.015404188],"genre_scores_gemma":[0.4457154,0.000034731325,0.55052364,0.0015065427,0.0006683722,0.000011099638,0.00002749183,0.00004103339,0.0014716636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759054,0.0000127774565,0.0005653717,0.00069672026,0.0007963783,0.00033822685],"domain_scores_gemma":[0.9985546,0.00008331881,0.000226584,0.00080330897,0.0002407886,0.00009140857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005521541,0.00031977613,0.00033514947,0.00076619996,0.000115527706,0.00043053512,0.001768298,0.00025649805,0.00002262604],"category_scores_gemma":[0.000021648411,0.00028806817,0.000110221714,0.0004226254,0.000334246,0.0006468766,0.0008054684,0.0004971021,0.000101512065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000424797,0.000027950186,0.000004208252,0.00014521598,0.000026556343,0.000067891495,0.0050753043,0.13963258,0.0006616812,0.61313534,0.00035017426,0.24086882],"study_design_scores_gemma":[0.0001016655,0.000076226344,0.000010020743,0.00016520476,0.00000497088,0.000041785344,1.03156246e-7,0.97185725,0.0053600366,0.020415723,0.0016668349,0.00030017548],"about_ca_topic_score_codex":0.000010191298,"about_ca_topic_score_gemma":0.00002447814,"teacher_disagreement_score":0.83222467,"about_ca_system_score_codex":0.00015937022,"about_ca_system_score_gemma":0.00046591184,"threshold_uncertainty_score":0.99995714},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042452397,0.0050074076,0.98153955,0.01045786,0.00063595665,0.0005927096,0.00017808359,0.0007239746,0.00082203205],"genre_scores_gemma":[0.009588926,0.0006919464,0.98811626,0.00083768764,0.0004719598,0.000048713464,0.000087081455,0.000039860053,0.00011754222],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950841,0.000041814805,0.00041712067,0.0030504882,0.0006975997,0.00070889405],"domain_scores_gemma":[0.98118615,0.00070264767,0.00016238204,0.017678125,0.000091515576,0.00017918753],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0014615478,0.00046255268,0.00043682553,0.0007405043,0.00028028528,0.0015057444,0.058915816,0.0003900852,0.0000027225087],"category_scores_gemma":[0.0034147252,0.00042544,0.000029058734,0.0014031465,0.0016280873,0.0013483074,0.33277392,0.0013217794,0.000024330593],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013370378,0.00002995583,0.000099983445,0.00029544745,0.000018328732,0.00006551802,0.0003458709,0.000028593835,0.000023892126,0.005780174,0.017520726,0.9757902],"study_design_scores_gemma":[0.00006303613,0.000026029842,0.00003193349,0.00017851713,0.0000074538684,0.00008918047,1.300747e-7,0.39369744,0.000057132816,0.571736,0.03381189,0.00030125972],"about_ca_topic_score_codex":0.000014460779,"about_ca_topic_score_gemma":0.000043706073,"teacher_disagreement_score":0.9754889,"about_ca_system_score_codex":0.00024363073,"about_ca_system_score_gemma":0.0008964003,"threshold_uncertainty_score":0.99981976},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014973164,0.00025163076,0.99013066,0.00064759725,0.00041634327,0.00040161354,0.000052944757,0.00019043397,0.007759058],"genre_scores_gemma":[0.6098104,0.000020730267,0.38817766,0.001398931,0.00012224063,0.00003093483,0.000035727753,0.000042736676,0.00036061788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956917,0.00004505799,0.0008392369,0.0014751524,0.0013605962,0.0005882173],"domain_scores_gemma":[0.99606925,0.00072049955,0.00042265543,0.0016264401,0.0009632417,0.00019791182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001155714,0.0005344841,0.00076478877,0.00429632,0.00023368724,0.000570192,0.0036269908,0.00030986947,0.00003138062],"category_scores_gemma":[0.00019992077,0.0004964498,0.0003010902,0.0035592092,0.0008266287,0.0017817694,0.0007746224,0.0007854853,0.000045422086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041853586,0.000026687929,0.00000487478,0.000016938578,0.00007030958,0.000014985157,0.0057948697,0.63086075,0.00003425002,0.35477993,0.000002274843,0.008389968],"study_design_scores_gemma":[0.00004129432,0.00013161253,0.000009825971,0.00012040193,0.000089778,0.0000020360394,0.000011330765,0.70575666,0.0016538971,0.29179227,0.000026120091,0.00036477277],"about_ca_topic_score_codex":0.00024320363,"about_ca_topic_score_gemma":0.0010629653,"teacher_disagreement_score":0.6096607,"about_ca_system_score_codex":0.0007853989,"about_ca_system_score_gemma":0.0012147614,"threshold_uncertainty_score":0.9997487},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024367025,0.0009823473,0.9959181,0.0007209982,0.0006168456,0.00033159222,0.000015120518,0.0002533946,0.00091793167],"genre_scores_gemma":[0.8156432,0.0000039055976,0.18341579,0.0006440803,0.00013901838,0.000011332816,0.00002636046,0.000031001484,0.00008529527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960957,0.00004673882,0.00067582104,0.0016877163,0.0009674652,0.00052656134],"domain_scores_gemma":[0.9963897,0.00079676183,0.00037362226,0.0020390707,0.00022755376,0.00017332648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062598777,0.0005074555,0.0007847229,0.001970162,0.00015507771,0.0003826804,0.003554343,0.00030192372,0.000033499313],"category_scores_gemma":[0.000033225733,0.0004557157,0.0003778619,0.0029740075,0.00070760463,0.00035297382,0.0011192608,0.0010951975,0.000013157792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017873024,0.000017072833,0.000020636919,0.000013676961,0.000051246043,0.000019126617,0.0004938092,0.7825116,0.00004031678,0.012281091,0.0000027278065,0.20454691],"study_design_scores_gemma":[0.00011308615,0.000085482665,0.00018126336,0.000113111346,0.00011941448,0.0000056631916,1.1617996e-7,0.97199595,0.00009278708,0.02685661,0.00002116844,0.00041532316],"about_ca_topic_score_codex":0.00029373108,"about_ca_topic_score_gemma":0.00008443709,"teacher_disagreement_score":0.8153995,"about_ca_system_score_codex":0.0001747036,"about_ca_system_score_gemma":0.00020401774,"threshold_uncertainty_score":0.9997895},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004426612,0.0015872411,0.98399734,0.00054017815,0.0009759648,0.00032884657,8.56739e-7,0.0006079536,0.007534974],"genre_scores_gemma":[0.8156516,0.00010023601,0.1794585,0.00026632924,0.0011015517,0.000019078348,0.000006043445,0.00013848658,0.0032581605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949779,0.0000849152,0.00046106637,0.0024031675,0.0010805619,0.0009924081],"domain_scores_gemma":[0.997941,0.00047102376,0.0003335162,0.00076738617,0.00019872688,0.00028833942],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001046144,0.00080350717,0.0007381181,0.001214076,0.0007728746,0.0014701046,0.0016640627,0.00032482675,0.000014185089],"category_scores_gemma":[0.00017860506,0.00066250644,0.000109805864,0.0010093182,0.00082600577,0.00038261013,0.0018406408,0.0038287647,0.00005589795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069388616,0.00002101771,0.00053274847,0.00011272421,0.000042568106,0.00025828223,0.006173064,0.4510806,0.00009409673,0.028052755,0.0000023887978,0.5136228],"study_design_scores_gemma":[0.00026490053,0.0004781707,0.00028099853,0.0016019577,0.000023987921,0.00035195926,0.0000033777112,0.98547107,0.00019730795,0.008411653,0.0019957833,0.0009188359],"about_ca_topic_score_codex":0.00010223384,"about_ca_topic_score_gemma":0.000023784427,"teacher_disagreement_score":0.811225,"about_ca_system_score_codex":0.00030498358,"about_ca_system_score_gemma":0.0004908845,"threshold_uncertainty_score":0.9995826},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001931222,0.00014566757,0.99207634,0.00083829084,0.0016168001,0.0012681261,0.000036615667,0.0008848428,0.0012021253],"genre_scores_gemma":[0.69403183,0.000013886142,0.3043465,0.00038076015,0.00029248005,0.000119851,0.000029211165,0.00005451426,0.0007309714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99451554,0.000055724777,0.0007885526,0.0025136082,0.0012960283,0.0008305458],"domain_scores_gemma":[0.99579895,0.00042702333,0.00026865426,0.002859924,0.00038166938,0.0002637811],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001457216,0.0007099869,0.00060700806,0.0013913873,0.000446769,0.0010752195,0.005502158,0.0002455192,0.000017329827],"category_scores_gemma":[0.00012315644,0.00066242425,0.000094855226,0.0015976959,0.00046968178,0.0010589587,0.0039150603,0.0011680613,0.00020107489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002377071,0.00035466798,0.00056892785,0.00018194556,0.000042301996,0.00024214873,0.0038924715,0.049306154,0.0003564246,0.014893371,0.00028353295,0.9298543],"study_design_scores_gemma":[0.0002049921,0.0017918984,0.0027080725,0.0009178537,0.000030521103,0.00017921883,0.0000024346255,0.97660613,0.0022941919,0.011365598,0.0025360964,0.001363016],"about_ca_topic_score_codex":0.000014764047,"about_ca_topic_score_gemma":0.000031328582,"teacher_disagreement_score":0.9284913,"about_ca_system_score_codex":0.0007356129,"about_ca_system_score_gemma":0.0005186526,"threshold_uncertainty_score":0.99996173},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000766929,0.00028852822,0.9451813,0.00082462735,0.00041340655,0.00037681303,0.000012594397,0.00014588288,0.052680124],"genre_scores_gemma":[0.0807944,0.00005845282,0.88682675,0.0004990691,0.0008924203,0.00006485949,0.000009840953,0.00016671391,0.030687474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982821,0.000003931047,0.00036278117,0.00064668985,0.00041343074,0.0002910713],"domain_scores_gemma":[0.99836695,0.0005869461,0.00013038536,0.0007429156,0.00009388686,0.00007891429],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004090427,0.0003073826,0.00036142915,0.00033021462,0.000109262466,0.00022724963,0.00081458106,0.00018362058,0.00012417814],"category_scores_gemma":[0.00007152092,0.00025230175,0.00010221325,0.0002381447,0.0003302768,0.00006132078,0.00042520673,0.0004872306,0.00019835932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.674573e-7,0.000035198267,0.000002166843,0.00035440008,0.000019310664,0.000030123223,0.0005108195,0.00034691414,0.000076930584,0.92884773,0.0015688557,0.0682067],"study_design_scores_gemma":[0.000042887114,0.000021114949,5.9174914e-7,0.00044661682,0.000019444979,0.00002305329,1.2874848e-7,0.056498155,0.00040336724,0.9309742,0.011305315,0.00026511468],"about_ca_topic_score_codex":0.0000038376284,"about_ca_topic_score_gemma":0.000016937202,"teacher_disagreement_score":0.080717705,"about_ca_system_score_codex":0.00010712335,"about_ca_system_score_gemma":0.00012002136,"threshold_uncertainty_score":0.9999929},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3981956,0.0031725068,0.49549657,0.01771268,0.025335139,0.004605645,0.00037010695,0.0011863873,0.053925358],"genre_scores_gemma":[0.89874786,0.00024688937,0.07577995,0.0012479419,0.003787558,0.000029837585,0.000044191398,0.00010152284,0.020014236],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957724,0.00006560081,0.0004552175,0.0012281543,0.0017483183,0.0007303174],"domain_scores_gemma":[0.9985926,0.00025387434,0.00015463281,0.0005207865,0.00017246087,0.00030564464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012480695,0.0004133787,0.0004255204,0.00059926906,0.0007410975,0.00052035693,0.0016923983,0.00025657742,0.00031282174],"category_scores_gemma":[0.00010193969,0.0003719022,0.00013321226,0.00067631435,0.00072038575,0.00023057054,0.0012766545,0.0011305346,0.00011187868],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000227497,0.00017411902,0.003358051,0.00010095514,0.00004009162,0.0005357268,0.037276335,0.012001902,0.000249076,0.039189998,0.00013138064,0.9069196],"study_design_scores_gemma":[0.0005585903,0.00055079936,0.0022933881,0.002357202,0.00013903323,0.000018752518,0.00016743384,0.0038275605,0.0003470527,0.029337468,0.9579375,0.0024652581],"about_ca_topic_score_codex":0.0001732593,"about_ca_topic_score_gemma":0.011157417,"teacher_disagreement_score":0.9578061,"about_ca_system_score_codex":0.0013180886,"about_ca_system_score_gemma":0.0010189237,"threshold_uncertainty_score":0.9998733},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023019836,0.0027433236,0.991243,0.0029782024,0.0008520562,0.00017080043,0.0000068360223,0.00007610417,0.00169945],"genre_scores_gemma":[0.8519683,0.0003288815,0.14611326,0.00096398126,0.0003271343,0.0000037350308,0.0000042230054,0.000019603787,0.0002708717],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980788,0.000022263328,0.00028613702,0.0008974778,0.00049017236,0.0002251529],"domain_scores_gemma":[0.9983814,0.00067811715,0.00013455997,0.00060294825,0.00013237154,0.00007060069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003346778,0.00025580756,0.00027979488,0.00038186804,0.00012645309,0.00033383633,0.0010975512,0.00016629661,0.000049863207],"category_scores_gemma":[0.000080180675,0.00017738927,0.00007675187,0.0005682625,0.00091172755,0.00025097656,0.0007687263,0.00053607515,0.000015916565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028573857,0.000014080503,0.00017432022,0.000019875775,0.000025275334,0.000034134377,0.0047926134,0.006325621,0.000067326546,0.48016807,0.000028078437,0.50834775],"study_design_scores_gemma":[0.00012061505,0.00007614132,0.0013475143,0.00012452091,0.000014882457,0.000058589445,0.0000059892686,0.29826,0.00014124715,0.69922286,0.0003102737,0.00031737608],"about_ca_topic_score_codex":0.000056053683,"about_ca_topic_score_gemma":0.00006762372,"teacher_disagreement_score":0.8517381,"about_ca_system_score_codex":0.000111950765,"about_ca_system_score_gemma":0.00021677176,"threshold_uncertainty_score":0.72337246},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019535387,0.0014925151,0.9743683,0.00009102625,0.0036035886,0.00024757357,0.000017694152,0.00019206542,0.018033728],"genre_scores_gemma":[0.7349888,0.00027350453,0.26362717,0.00020463209,0.00055205706,0.000008592338,0.000004700077,0.00005334794,0.00028720716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974997,0.000029806346,0.00049612595,0.0007654874,0.0007619537,0.0004468954],"domain_scores_gemma":[0.99837816,0.00073289213,0.00008165943,0.00060727244,0.00008707238,0.0001129397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008311106,0.00041684211,0.00057815015,0.0005412592,0.00007643214,0.00010641335,0.0011036968,0.00039117597,0.00010521819],"category_scores_gemma":[0.00009577986,0.00032877142,0.00013859734,0.00043413835,0.0011241536,0.000141445,0.00044183133,0.0011771506,0.000014520098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005963867,0.000011848646,0.00025387833,0.00038217814,0.00003105952,0.0001131138,0.0005292313,0.8829918,0.0024801835,0.024680968,0.00009417981,0.08842562],"study_design_scores_gemma":[0.00015651678,0.00024282525,0.0048789233,0.0011179056,0.000035371457,0.000112135436,7.7256686e-7,0.66231614,0.0077963443,0.3188093,0.003606961,0.00092680025],"about_ca_topic_score_codex":0.000010395184,"about_ca_topic_score_gemma":0.000061434745,"teacher_disagreement_score":0.73303527,"about_ca_system_score_codex":0.0001801,"about_ca_system_score_gemma":0.00018746415,"threshold_uncertainty_score":0.99991643},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62109965,0.0019531104,0.37504295,0.00080697145,0.000343814,0.0006076238,0.000008100396,0.000055016822,0.00008275248],"genre_scores_gemma":[0.9537638,0.000076191434,0.045574885,0.00009026604,0.0003538119,7.3840977e-7,0.00005347421,0.000038934788,0.000047893427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834013,0.00002187169,0.0003403217,0.0005587598,0.0005352943,0.00020359595],"domain_scores_gemma":[0.9993044,0.00013527775,0.00017674037,0.00019175487,0.00006170579,0.00013013191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005210028,0.00023553133,0.0003978059,0.00061788515,0.000067883964,0.00006293661,0.0000811339,0.00009677179,0.000004728542],"category_scores_gemma":[0.00012541369,0.00018044641,0.00005011487,0.00028864137,0.0003208645,0.00013932252,0.000092571674,0.00076874904,2.9624624e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005904939,0.000005674737,0.45907232,0.00035402426,0.000027839042,0.00009537934,0.00022931886,0.508156,0.0004994004,0.00005774086,0.0000011680089,0.03091063],"study_design_scores_gemma":[0.00080300577,0.00025830994,0.027575849,0.0025481053,0.000102849284,0.0002578525,4.4377597e-7,0.96735644,0.000027988299,0.0008144092,0.00009443236,0.00016031065],"about_ca_topic_score_codex":0.00025797405,"about_ca_topic_score_gemma":0.00003677542,"teacher_disagreement_score":0.45920044,"about_ca_system_score_codex":0.00027916764,"about_ca_system_score_gemma":0.00024159529,"threshold_uncertainty_score":0.7358391},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008009693,0.0029606244,0.99133676,0.0021944984,0.0011817494,0.00094081525,0.000015695367,0.0003097742,0.0010520504],"genre_scores_gemma":[0.004512239,0.00019230135,0.99116147,0.0026668024,0.0003024817,0.00011121225,0.000010505288,0.000049797232,0.0009931857],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99591887,0.00005679202,0.0007520667,0.0017739838,0.00081927626,0.0006789973],"domain_scores_gemma":[0.99738544,0.0011718774,0.00023512891,0.00083620055,0.0001927901,0.00017858324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011449412,0.0005012888,0.0005292197,0.0011214708,0.00013172267,0.00079600886,0.0023313824,0.00022815776,0.00006721081],"category_scores_gemma":[0.00026547528,0.00047986,0.00011970592,0.0006718059,0.0008919415,0.0009538829,0.0007092349,0.0006258769,0.000041425017],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047803596,0.000012712029,0.000033601817,0.00009325142,0.0000020039067,0.000302302,0.00063258427,0.000112491405,0.001674476,0.0066999123,0.0001558487,0.99027604],"study_design_scores_gemma":[0.0005268695,0.00027135332,0.00017389093,0.0019895935,0.000024059033,0.0002487044,0.000003805321,0.37721333,0.04248634,0.5748478,0.0010490573,0.0011652082],"about_ca_topic_score_codex":0.00006790116,"about_ca_topic_score_gemma":0.000112498696,"teacher_disagreement_score":0.9891108,"about_ca_system_score_codex":0.00052901875,"about_ca_system_score_gemma":0.0010328847,"threshold_uncertainty_score":0.99976534},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007150667,0.00040627056,0.99539715,0.00065426267,0.00057996623,0.00068160874,0.00006145991,0.000886159,0.0006180801],"genre_scores_gemma":[0.7981233,0.0000052819178,0.20076443,0.00052101584,0.00022737322,0.00007725889,0.000040542767,0.000101979764,0.00013884495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972938,0.000035148612,0.00044055143,0.0011279947,0.0006452156,0.0004573338],"domain_scores_gemma":[0.99562126,0.0027182468,0.000055930213,0.0011764349,0.00019228189,0.00023585492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005277534,0.00047650308,0.00037423748,0.0009868834,0.00019243995,0.00033561204,0.00085141766,0.00070162845,0.000076904944],"category_scores_gemma":[0.0001616805,0.00050399045,0.00021982475,0.0011017852,0.00032439255,0.0001422903,0.0001358103,0.0021776662,0.00012084488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029854687,0.000011410569,0.000007823992,0.000025362298,0.00002401928,0.000010357914,0.00019753732,0.9933377,0.00014574148,0.00027332874,0.000020460719,0.00591639],"study_design_scores_gemma":[0.00012436739,0.0000979588,0.000026543417,0.00051903795,0.000040650808,6.7719463e-7,2.6579897e-7,0.96396184,0.0004872235,0.031746004,0.0025180664,0.0004773506],"about_ca_topic_score_codex":0.000023804341,"about_ca_topic_score_gemma":0.00004119154,"teacher_disagreement_score":0.7974082,"about_ca_system_score_codex":0.000358716,"about_ca_system_score_gemma":0.00027232876,"threshold_uncertainty_score":0.9997412},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001458146,0.0008541285,0.98765016,0.0035942197,0.0002935311,0.0010343977,0.000019365187,0.00020688887,0.006332744],"genre_scores_gemma":[0.013009065,0.00009266095,0.98216003,0.0019270461,0.00080056174,0.00010556443,0.000037407826,0.000069334215,0.001798303],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979726,0.0000028213467,0.00033337518,0.00094210857,0.00036147164,0.00038759323],"domain_scores_gemma":[0.99872637,0.00019431203,0.00009909936,0.000717288,0.00012060544,0.00014232442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027648042,0.00032778582,0.00042814793,0.00045124977,0.00012764416,0.0000794385,0.00044908104,0.0002661462,0.00004615093],"category_scores_gemma":[0.00002244756,0.00026973523,0.00018504525,0.00032194803,0.00045065302,0.00007296607,0.00023235605,0.0005465748,0.000035525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005293117,0.00007396246,0.000037689344,0.00033093547,0.0000361357,0.00013365396,0.00063957967,0.012024964,0.0005711929,0.3447899,0.0003783335,0.6409307],"study_design_scores_gemma":[0.00021431898,0.00018847611,0.000022270338,0.00045889436,0.000055566372,0.000059580583,2.3293738e-7,0.049760617,0.0009796998,0.86865026,0.07927359,0.00033647142],"about_ca_topic_score_codex":0.000003838667,"about_ca_topic_score_gemma":0.000051682568,"teacher_disagreement_score":0.64059424,"about_ca_system_score_codex":0.00022942272,"about_ca_system_score_gemma":0.00018795363,"threshold_uncertainty_score":0.9999755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033692893,0.00094498374,0.9910664,0.00093981024,0.0018426614,0.00027382286,0.00002205015,0.00018911409,0.004384245],"genre_scores_gemma":[0.6328501,0.00018742906,0.35314,0.012307931,0.0009123716,0.000029427632,0.000025187632,0.00009633975,0.00045122093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972827,0.000021298043,0.00033636153,0.0014207055,0.00046889426,0.00047002867],"domain_scores_gemma":[0.9984263,0.00027705322,0.00009639722,0.0009647785,0.00009295677,0.00014247876],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003466934,0.000505374,0.00040509625,0.0005287235,0.00029872256,0.0011528875,0.0016048889,0.0002211038,0.000012667861],"category_scores_gemma":[0.000022391123,0.0003762633,0.00009399189,0.00059200474,0.0003752927,0.00034386665,0.000724057,0.0005595214,0.00003207287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004029522,0.000018947638,0.00002056727,0.000058025827,0.0000118847365,0.00008827876,0.00096175174,0.6226785,0.00003946648,0.15399782,0.00009521513,0.22202551],"study_design_scores_gemma":[0.00013819816,0.00013897823,0.00001563735,0.00034482486,0.0000034287923,0.00002149322,1.0498354e-7,0.8493595,0.0003345019,0.14625955,0.0029506583,0.00043312612],"about_ca_topic_score_codex":0.000017133858,"about_ca_topic_score_gemma":0.000031513686,"teacher_disagreement_score":0.6379264,"about_ca_system_score_codex":0.00016650622,"about_ca_system_score_gemma":0.0003108566,"threshold_uncertainty_score":0.999884},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093233836,0.0001235829,0.98306483,0.00062874996,0.0009860692,0.0005352299,0.0000032356904,0.00014393339,0.013582052],"genre_scores_gemma":[0.864403,0.000010449429,0.1333169,0.0011087158,0.0005306399,0.000002727926,0.0000033857777,0.000030008208,0.0005941528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736446,0.000060354785,0.00039882673,0.0006197023,0.001016506,0.00054012745],"domain_scores_gemma":[0.9987974,0.00041483936,0.00019053515,0.00027191103,0.00017828205,0.00014700854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018502009,0.00031013295,0.00035567873,0.00078497344,0.00038199237,0.00053363206,0.00057425495,0.0002614718,0.00005041936],"category_scores_gemma":[0.00016886547,0.00024880344,0.000066396795,0.0008021206,0.00061951793,0.00042548875,0.00010721568,0.0007317989,0.000028242703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022972315,0.0000127278445,0.0000322308,0.000067311914,0.0000045275883,0.0000228605,0.015121358,0.16113769,0.000042923824,0.0015221603,0.0000040823106,0.82200915],"study_design_scores_gemma":[0.0004854747,0.00015298893,0.00019517711,0.0011119808,0.000010507028,0.000011056358,0.000020456337,0.98227465,0.0017339732,0.009498882,0.003951036,0.00055383076],"about_ca_topic_score_codex":0.00047451825,"about_ca_topic_score_gemma":0.0052058497,"teacher_disagreement_score":0.8634707,"about_ca_system_score_codex":0.000511809,"about_ca_system_score_gemma":0.0010427956,"threshold_uncertainty_score":0.9999964},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022238135,0.001008938,0.99279773,0.00054389675,0.0031980365,0.0004009611,0.000009205277,0.0002212981,0.001597544],"genre_scores_gemma":[0.29194248,0.00012730829,0.7066465,0.00040507034,0.00044556163,0.000021386362,0.000020281464,0.00004354419,0.0003478709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953014,0.000055416254,0.0008028975,0.0022425614,0.0008417315,0.00075596577],"domain_scores_gemma":[0.9980068,0.0001378577,0.00023803585,0.0013437934,0.0001403045,0.0001331745],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014259004,0.000608513,0.0008366938,0.0032798538,0.00018996945,0.001329336,0.002489936,0.00038785118,0.000027060363],"category_scores_gemma":[0.000036101854,0.00053481985,0.00029781726,0.002959448,0.0003924604,0.00080464006,0.0012599889,0.0009481949,0.000041004965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020295556,0.00010648342,0.00007364763,0.0001887173,0.00011170898,0.00047000786,0.004294306,0.060004577,0.00070174236,0.014304285,0.000022709382,0.9197015],"study_design_scores_gemma":[0.00026926375,0.00006837552,0.0002331621,0.0003513587,0.000048498623,0.00006741119,4.5353073e-7,0.92898595,0.00017719105,0.06888482,0.0003107597,0.0006027358],"about_ca_topic_score_codex":0.00008101103,"about_ca_topic_score_gemma":0.00011222253,"teacher_disagreement_score":0.9190988,"about_ca_system_score_codex":0.00043927183,"about_ca_system_score_gemma":0.00022023261,"threshold_uncertainty_score":0.9997103},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002820029,0.0004423858,0.97907555,0.00010679586,0.00048567826,0.0009808764,0.00007352517,0.00007195596,0.018481253],"genre_scores_gemma":[0.061282013,0.0000060790667,0.92466486,0.0003020492,0.00017990614,0.000028643983,0.000011636105,0.000052785028,0.013472051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944969,0.00008595043,0.00072499394,0.0023128928,0.00173215,0.0006471602],"domain_scores_gemma":[0.99700195,0.0014349627,0.00026652133,0.00089452084,0.00020066256,0.00020139819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.009050831,0.00050171814,0.0008154097,0.0027882624,0.00035878643,0.0009973083,0.0015748474,0.00019572876,0.00004591753],"category_scores_gemma":[0.0007932321,0.00031947548,0.00028122,0.00233754,0.00025299247,0.00026609068,0.0022819452,0.00058989483,0.000004444772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007500793,0.000049829545,0.00022987343,0.00011861538,0.00018513916,0.000027529693,0.0025040698,0.47836375,0.0000914612,0.0019594296,0.000043000957,0.5163523],"study_design_scores_gemma":[0.00022262249,0.00006967198,0.0000903362,0.0001759211,0.00016051324,0.00004186452,0.00000716517,0.9656972,0.000020924248,0.031548183,0.001532235,0.0004333512],"about_ca_topic_score_codex":0.000061781495,"about_ca_topic_score_gemma":0.00011185315,"teacher_disagreement_score":0.51591897,"about_ca_system_score_codex":0.00024592152,"about_ca_system_score_gemma":0.00008311057,"threshold_uncertainty_score":0.99992573},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010581293,0.05688849,0.9331711,0.0017869595,0.00481966,0.0011072516,0.000111073285,0.00011566108,0.0019891982],"genre_scores_gemma":[0.009629015,0.010340182,0.9499447,0.013916441,0.0041444064,0.000068596215,0.0000786409,0.00033577936,0.011542244],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9878639,0.000045779867,0.0025947453,0.0031551083,0.0053045684,0.0010358755],"domain_scores_gemma":[0.9851479,0.008332858,0.0011485016,0.0026130262,0.0024232059,0.00033450863],"candidate_categories":["metaresearch","metaepi_narrow","bibliometrics","scholarly_communication"],"consensus_categories":["bibliometrics"],"category_scores_codex":[0.014498858,0.00083863566,0.0015508555,0.022269042,0.0003352095,0.0047412193,0.005364228,0.0005952685,0.00032022817],"category_scores_gemma":[0.014181278,0.00059895543,0.00069037394,0.028166503,0.00058476557,0.0007797659,0.0021112866,0.0014191492,0.00030388476],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007834292,0.000012944266,0.0000388627,0.0005336233,0.000014578163,0.00017132059,0.00013495029,0.0021721974,0.000025795405,0.003798953,0.0038180845,0.98927087],"study_design_scores_gemma":[0.0001604725,0.00010752048,0.00002630671,0.010467159,0.00004988878,0.00013162488,2.4543178e-7,0.36738145,0.000056006,0.50269705,0.11822955,0.00069268927],"about_ca_topic_score_codex":0.0000032803125,"about_ca_topic_score_gemma":0.00006617521,"teacher_disagreement_score":0.98857814,"about_ca_system_score_codex":0.00029235653,"about_ca_system_score_gemma":0.0005229518,"threshold_uncertainty_score":0.9996462},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15465719,0.051961876,0.45130387,0.049636103,0.023622196,0.013749397,0.005898445,0.002600745,0.2465702],"genre_scores_gemma":[0.979096,0.00027689445,0.0068654045,0.0014386779,0.0019075037,0.00002738718,0.00010590716,0.0000105853005,0.010271619],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968185,0.000015392345,0.0004928488,0.0010089836,0.0012030745,0.00046123148],"domain_scores_gemma":[0.99908745,0.00021927315,0.00022028705,0.0002016743,0.00012391934,0.00014739594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003768321,0.0005093923,0.00060796924,0.000050169256,0.00014178824,0.00016727255,0.0010714856,0.0004060604,0.00011013468],"category_scores_gemma":[0.000030606563,0.00017354419,0.00031202607,0.0005748787,0.00022695954,0.00014373167,0.00052617653,0.0006217571,0.000035697965],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118754244,0.00031282156,0.0007782862,0.00029360745,0.00015885638,0.0001369178,0.0016412233,0.044175267,0.1778214,0.026448669,0.0015897963,0.7465244],"study_design_scores_gemma":[0.0012528556,0.0029135377,0.0038737433,0.0037563802,0.00047418167,0.00027172698,0.00001464883,0.4110728,0.05594009,0.43122485,0.08344465,0.0057605337],"about_ca_topic_score_codex":0.00008105923,"about_ca_topic_score_gemma":0.0020308394,"teacher_disagreement_score":0.8244388,"about_ca_system_score_codex":0.00016028738,"about_ca_system_score_gemma":0.000047579582,"threshold_uncertainty_score":0.7076927},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047537658,0.00009356385,0.9775208,0.00036362006,0.0014004896,0.00041333027,0.000049628397,0.0006993189,0.01898383],"genre_scores_gemma":[0.23503514,0.0052816593,0.75460404,0.0007407477,0.0018443236,0.00011930968,0.00019271055,0.00050316355,0.001678941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766314,0.0000032542678,0.00045675944,0.00077677314,0.0005004493,0.0005996401],"domain_scores_gemma":[0.99883825,0.00013521936,0.00006181984,0.0007069881,0.000098110446,0.00015962918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018527351,0.00047030134,0.00037955894,0.0004238813,0.00010552947,0.0002676244,0.00091591047,0.00026163604,0.00003140868],"category_scores_gemma":[0.000009585138,0.0004575116,0.00010773182,0.00030338226,0.00030485028,0.0002115095,0.0002963949,0.00093121093,0.00024213995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016740009,0.0000036218428,0.0000028762795,0.000060224105,0.000012321331,0.000019400362,0.00059470563,0.7103557,0.00011084318,0.001800821,0.000040073926,0.28699774],"study_design_scores_gemma":[0.00011505865,0.00002499009,0.000006935786,0.00024906427,0.00002012878,0.000017709825,1.2210863e-7,0.94083405,0.0005512744,0.048326753,0.009386566,0.0004673544],"about_ca_topic_score_codex":0.00012726673,"about_ca_topic_score_gemma":0.00057149417,"teacher_disagreement_score":0.28653038,"about_ca_system_score_codex":0.00044433406,"about_ca_system_score_gemma":0.00016255694,"threshold_uncertainty_score":0.9997877},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007565862,0.00005237408,0.99287033,0.000010196345,0.00097190833,0.00076909846,0.000017023744,0.0014219083,0.0031305812],"genre_scores_gemma":[0.98547286,0.000017877579,0.014342857,0.00003517664,0.000067205234,0.000019355242,0.000011309338,0.000019309431,0.000014028183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887425,0.000007521545,0.0003238498,0.00029004604,0.00036658085,0.00013773885],"domain_scores_gemma":[0.9995466,0.000024358773,0.00006813797,0.00028843014,0.000032154432,0.000040350515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002061626,0.00021742415,0.00018205377,0.0010073187,0.000071710056,0.00012122223,0.00014970345,0.00009877961,4.7083384e-7],"category_scores_gemma":[0.0000015188696,0.00020920605,0.000029148792,0.00020224425,0.000076220516,0.00022490491,0.00011783287,0.00023800397,0.0000018172367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000504577,0.000024012012,0.000012766372,0.0006506463,0.000028340568,0.0006572471,0.00086747576,0.25443363,9.894109e-7,0.0005567229,0.00013160642,0.74263155],"study_design_scores_gemma":[0.00024227757,0.00022052803,0.000022533766,0.0010398569,0.000041161627,0.0001937194,0.000025424857,0.9976275,0.000026397203,0.00009199218,0.00031609857,0.00015252814],"about_ca_topic_score_codex":0.000044557255,"about_ca_topic_score_gemma":0.000035456083,"teacher_disagreement_score":0.9847163,"about_ca_system_score_codex":0.00028843235,"about_ca_system_score_gemma":0.000011391102,"threshold_uncertainty_score":0.85311747},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011486542,0.0010472666,0.9827632,0.000929174,0.0056813993,0.00065520813,0.000010834068,0.00044208733,0.008356018],"genre_scores_gemma":[0.20930454,0.0005382971,0.7847553,0.0013357445,0.00261526,0.0000794466,0.000036519763,0.00013002689,0.0012048526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952769,0.0000138951755,0.000597143,0.0020915074,0.0010968804,0.00092365424],"domain_scores_gemma":[0.9974942,0.000118162876,0.00024080723,0.0017337329,0.000209865,0.00020322247],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009762828,0.00067042134,0.00057484995,0.00082315324,0.00035577227,0.0010928407,0.0034655423,0.00040156758,0.000021272159],"category_scores_gemma":[0.000019289304,0.0005519809,0.00017136637,0.0010329755,0.00069469435,0.00092166243,0.0017545158,0.001211018,0.00030797592],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052067703,0.000022361071,0.000023887762,0.000106178246,0.000015683652,0.00009336255,0.00029519456,0.01910222,0.000039979208,0.027483879,0.00014892452,0.9526631],"study_design_scores_gemma":[0.00016022153,0.00020382462,0.00008201453,0.00047916468,0.0000124651515,0.00023205405,1.0032177e-7,0.78879803,0.0006408255,0.20368525,0.004946734,0.0007592997],"about_ca_topic_score_codex":0.0000173623,"about_ca_topic_score_gemma":0.00002683716,"teacher_disagreement_score":0.9519038,"about_ca_system_score_codex":0.00042607993,"about_ca_system_score_gemma":0.0003443336,"threshold_uncertainty_score":0.9999441},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021190464,0.0013234012,0.9759085,0.0007239764,0.002009502,0.0003407773,0.000011533154,0.00016172096,0.01949939],"genre_scores_gemma":[0.19760787,0.0001177958,0.7998383,0.0009253974,0.0006503195,0.000020038358,0.000012045718,0.000049788563,0.0007784252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966904,0.000022890032,0.0006132826,0.0012647636,0.0008961626,0.00051250524],"domain_scores_gemma":[0.9978019,0.00025993588,0.00023824442,0.0013583783,0.0002030983,0.00013843058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000643415,0.00042751327,0.000549206,0.0006332559,0.00014947358,0.00040763651,0.002960562,0.00026932664,0.00002932963],"category_scores_gemma":[0.000039509632,0.00035168527,0.0001938376,0.0007451813,0.0009235227,0.0004058619,0.001222323,0.00061714754,0.000091564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026013265,0.0000386402,0.000020140236,0.0001235382,0.000013982906,0.00010170048,0.0013115387,0.024110649,0.0000766592,0.4443537,0.000069306785,0.5297775],"study_design_scores_gemma":[0.000116134375,0.0001229609,0.000025869014,0.00031323297,0.000011625926,0.000031839594,1.3510471e-7,0.51892143,0.00051276706,0.47549808,0.0040665613,0.0003793534],"about_ca_topic_score_codex":0.00001609662,"about_ca_topic_score_gemma":0.00003614657,"teacher_disagreement_score":0.5293982,"about_ca_system_score_codex":0.00011004197,"about_ca_system_score_gemma":0.00041797874,"threshold_uncertainty_score":0.9998935},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023116581,0.00034706923,0.972185,0.00037291282,0.0033884237,0.00045003378,0.000005803786,0.0004857572,0.022741873],"genre_scores_gemma":[0.0148136355,0.000030944637,0.982042,0.00083505694,0.00030794702,0.000020720398,0.000004634598,0.00005626892,0.0018887684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953117,0.000023192699,0.0007477335,0.0018361127,0.0012410168,0.0008402743],"domain_scores_gemma":[0.9970884,0.00019103102,0.00032451638,0.001958532,0.00027901703,0.0001585319],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021610444,0.0005952771,0.0005022024,0.0009640642,0.00027797007,0.0012291095,0.004491909,0.00040100733,0.000008008038],"category_scores_gemma":[0.000116650175,0.0005457764,0.00016091437,0.0007777266,0.0005502226,0.0014473664,0.0020925195,0.0011636259,0.00012921696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044023977,0.000012526384,0.0000027087415,0.00014360253,0.00000949397,0.00003135267,0.00082237605,0.15506242,0.00025677084,0.5053767,0.000017478953,0.33826014],"study_design_scores_gemma":[0.00006125203,0.00003672094,0.0000031460588,0.00023333871,0.0000062378895,0.000040110383,6.7521675e-8,0.6544287,0.001397327,0.34280768,0.0005815605,0.00040382074],"about_ca_topic_score_codex":0.000007681354,"about_ca_topic_score_gemma":0.000011642878,"teacher_disagreement_score":0.4993663,"about_ca_system_score_codex":0.00043528853,"about_ca_system_score_gemma":0.00058786274,"threshold_uncertainty_score":0.9998077},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027360224,0.001811332,0.9781751,0.0100733815,0.0055071865,0.00045483295,0.0000020627285,0.000308565,0.003640167],"genre_scores_gemma":[0.18311857,0.00020014634,0.8001198,0.008084577,0.0057052076,0.000082680235,0.000024742907,0.00016704705,0.0024972004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99390113,0.00017075501,0.0010814884,0.0023493345,0.0014689246,0.0010283545],"domain_scores_gemma":[0.9963464,0.001258902,0.00023631773,0.0017411857,0.0001872295,0.00022997001],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0027593118,0.00060172135,0.0007701205,0.0024366549,0.0001536043,0.00044938052,0.005450703,0.0004374205,0.000044649692],"category_scores_gemma":[0.00064771506,0.0005175425,0.00009464059,0.0038975829,0.0009804517,0.00042864264,0.0020467294,0.0028889496,0.00023337573],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030070037,0.000019197081,0.00007692045,0.00020406321,0.0000031515801,0.00038423843,0.0027167727,0.04224591,0.0000116708125,0.038721927,0.00017238826,0.91544074],"study_design_scores_gemma":[0.000021986405,0.00014821035,0.00007274577,0.0011465192,0.0000024640722,0.0000548555,2.9151067e-7,0.58677983,0.00007441598,0.4099169,0.0014325248,0.0003492702],"about_ca_topic_score_codex":0.00026297785,"about_ca_topic_score_gemma":0.00078226614,"teacher_disagreement_score":0.91509145,"about_ca_system_score_codex":0.0010707172,"about_ca_system_score_gemma":0.002145188,"threshold_uncertainty_score":0.99993026},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049778033,0.019697865,0.9177364,0.0044922573,0.002726599,0.0034508877,0.0001268419,0.00031946047,0.001671615],"genre_scores_gemma":[0.9822447,0.00018151327,0.014536471,0.0017850066,0.00046838072,0.000030274037,0.000071435505,0.00008476834,0.00059749046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971889,0.00003412598,0.0006566543,0.00093165843,0.000709552,0.00047907516],"domain_scores_gemma":[0.99860746,0.00019579488,0.00032092934,0.0004332838,0.00018477633,0.00025777804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008160664,0.00035463335,0.0008679975,0.0007138144,0.00013533531,0.000055512213,0.00028402673,0.00022423702,0.000022535303],"category_scores_gemma":[0.00014909767,0.00030913364,0.00016986129,0.0006011187,0.00018753367,0.000046566536,0.0002076304,0.0007129057,0.0000016292823],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009843252,0.00014182924,0.0028447604,0.0069099856,0.00017945028,0.00001797145,0.026801119,0.022232687,0.0008493278,0.00054075866,0.000027428718,0.93847036],"study_design_scores_gemma":[0.0126365805,0.011234447,0.008863477,0.020987146,0.00034649897,0.00029443635,0.00013277373,0.8973338,0.014631329,0.012224054,0.016439987,0.004875444],"about_ca_topic_score_codex":0.00035246147,"about_ca_topic_score_gemma":0.0002927588,"teacher_disagreement_score":0.93359494,"about_ca_system_score_codex":0.00037524043,"about_ca_system_score_gemma":0.00040271666,"threshold_uncertainty_score":0.9999361},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017402337,0.00059249037,0.9806776,0.000433214,0.002108443,0.0006318663,0.000006343646,0.0003345827,0.015198043],"genre_scores_gemma":[0.73095834,0.00002625823,0.26741424,0.00016852,0.000423692,0.000047012327,0.00002202276,0.00005342472,0.0008864711],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99598736,0.00005010687,0.0007677117,0.0014701423,0.0011440502,0.0005806232],"domain_scores_gemma":[0.99729335,0.00047472533,0.00045656846,0.0012241795,0.00039047762,0.00016067538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011473647,0.00050659373,0.0006530471,0.00074460864,0.0001443248,0.00039045283,0.0024169518,0.00040067115,0.0000154246],"category_scores_gemma":[0.00012610208,0.00041998492,0.00021974524,0.00086034794,0.0012891282,0.00038941763,0.000869037,0.00065323187,0.000089331035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032106454,0.00003344449,0.000030994936,0.000085877,0.000025502484,0.00009707032,0.00048518606,0.00058504735,0.00002898841,0.35950392,0.0000134126085,0.63910735],"study_design_scores_gemma":[0.00019110582,0.00033843517,0.0000715077,0.0004560906,0.00003197076,0.00027096277,7.078884e-7,0.24867353,0.0009047243,0.74345493,0.0049227923,0.0006832272],"about_ca_topic_score_codex":0.00004275427,"about_ca_topic_score_gemma":0.000061114195,"teacher_disagreement_score":0.73094094,"about_ca_system_score_codex":0.00023747046,"about_ca_system_score_gemma":0.00061026285,"threshold_uncertainty_score":0.9998252},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8797509,0.003248536,0.099111795,0.005493057,0.004217899,0.0010085606,0.0000875236,0.00005198911,0.0070297485],"genre_scores_gemma":[0.99548584,0.000427896,0.003115366,0.0006355328,0.00012509548,0.000011384082,0.00001586131,0.000024424922,0.00015857647],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975644,0.00003169246,0.0008664722,0.00078646716,0.00020638165,0.00054461515],"domain_scores_gemma":[0.99892396,0.00033178087,0.00015940152,0.00045029845,0.00003747018,0.000097113196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014217658,0.0003450322,0.0005946642,0.0017682685,0.00015196792,0.000241874,0.0007349233,0.00028920957,0.000008202129],"category_scores_gemma":[0.00011855789,0.0003736343,0.0000729086,0.00068337104,0.0006246345,0.00034095938,0.00035269806,0.0016442866,0.0000171961],"study_design_candidate":"theoretical_or_conceptual","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.00032263924,0.00063844497,0.11854087,0.00045655447,0.000040260493,0.0012231941,0.038720716,0.17673852,0.00007370097,0.28671113,0.00010391799,0.37643006],"study_design_scores_gemma":[0.0013804266,0.00038111082,0.20872481,0.002324899,0.000004252813,0.000079144214,0.000067507965,0.29373625,0.000019555864,0.48963684,0.0021692747,0.0014759368],"about_ca_topic_score_codex":0.0023243874,"about_ca_topic_score_gemma":0.036385998,"teacher_disagreement_score":0.37495413,"about_ca_system_score_codex":0.00091247266,"about_ca_system_score_gemma":0.00029065914,"threshold_uncertainty_score":0.99987155},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05930245,0.00013591925,0.9278696,0.0027842298,0.002974264,0.005760983,0.00029675182,0.00033584677,0.00053995446],"genre_scores_gemma":[0.9264825,0.000011699414,0.06811701,0.0030369414,0.000987858,0.00016715507,0.0009250234,0.00011601397,0.00015582828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966936,0.000049921724,0.0008849938,0.0011622637,0.0008325216,0.00037666346],"domain_scores_gemma":[0.99651825,0.0013692535,0.0003583631,0.0007135255,0.0008813634,0.00015921143],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005998514,0.000433149,0.0005393679,0.00048956025,0.0002193193,0.00020476698,0.00033767894,0.0001372313,0.00005056161],"category_scores_gemma":[0.00037039522,0.00035867453,0.000081470454,0.00050188665,0.00030823096,0.00041453584,0.00017507785,0.0005612455,0.000023453042],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044779377,0.002757779,0.00017048953,0.00032291474,0.0006936963,0.0019403927,0.015289512,0.05613779,0.0013478391,0.0014486263,0.0015521038,0.9138609],"study_design_scores_gemma":[0.024349542,0.09963485,0.00065760606,0.0025216152,0.0029161174,0.0004562636,0.0014609213,0.8222238,0.0017843499,0.008955338,0.03106732,0.003972272],"about_ca_topic_score_codex":0.00005939679,"about_ca_topic_score_gemma":0.0039594877,"teacher_disagreement_score":0.9098886,"about_ca_system_score_codex":0.00040258447,"about_ca_system_score_gemma":0.0007206469,"threshold_uncertainty_score":0.9998865},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027360224,0.001811332,0.9781751,0.0100733815,0.0055071865,0.00045483295,0.0000020627285,0.000308565,0.003640167],"genre_scores_gemma":[0.18311857,0.00020014634,0.8001198,0.008084577,0.0057052076,0.000082680235,0.000024742907,0.00016704705,0.0024972004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99390113,0.00017075501,0.0010814884,0.0023493345,0.0014689246,0.0010283545],"domain_scores_gemma":[0.9963464,0.001258902,0.00023631773,0.0017411857,0.0001872295,0.00022997001],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0027593118,0.00060172135,0.0007701205,0.0024366549,0.0001536043,0.00044938052,0.005450703,0.0004374205,0.000044649692],"category_scores_gemma":[0.00064771506,0.0005175425,0.00009464059,0.0038975829,0.0009804517,0.00042864264,0.0020467294,0.0028889496,0.00023337573],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030070037,0.000019197081,0.00007692045,0.00020406321,0.0000031515801,0.00038423843,0.0027167727,0.04224591,0.0000116708125,0.038721927,0.00017238826,0.91544074],"study_design_scores_gemma":[0.000021986405,0.00014821035,0.00007274577,0.0011465192,0.0000024640722,0.0000548555,2.9151067e-7,0.58677983,0.00007441598,0.4099169,0.0014325248,0.0003492702],"about_ca_topic_score_codex":0.00026297785,"about_ca_topic_score_gemma":0.00078226614,"teacher_disagreement_score":0.91509145,"about_ca_system_score_codex":0.0010707172,"about_ca_system_score_gemma":0.002145188,"threshold_uncertainty_score":0.99993026},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041783176,0.010300603,0.9253134,0.0055113807,0.004955351,0.0026886312,0.000010580288,0.00012250486,0.009314362],"genre_scores_gemma":[0.9976976,0.00006641056,0.0016809282,0.00022834631,0.00014008404,0.000017401573,0.0000026510756,0.000017602366,0.00014895605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987076,0.000008999531,0.00025455223,0.00046021352,0.00039818342,0.00017048194],"domain_scores_gemma":[0.99932957,0.00010722177,0.00010348664,0.00034026374,0.00008760288,0.000031841395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002974308,0.00017882341,0.0002527154,0.00041054524,0.00005488456,0.000057581492,0.0001565293,0.00011448689,0.00001597347],"category_scores_gemma":[0.000022504528,0.000109812856,0.00007993527,0.00037434028,0.00026741976,0.00007541266,0.00008979828,0.0003599761,0.000004896391],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108705724,0.00022488505,0.009442685,0.0014618242,0.00012996844,0.0002788834,0.0049187443,0.013274422,0.0023232133,0.003789037,0.000039491104,0.96400815],"study_design_scores_gemma":[0.0052114697,0.0032056035,0.09898148,0.041150764,0.0010437072,0.0006117554,0.000010059707,0.41141623,0.18371356,0.24941017,0.0029890472,0.0022561639],"about_ca_topic_score_codex":0.000059846094,"about_ca_topic_score_gemma":0.00022922554,"teacher_disagreement_score":0.961752,"about_ca_system_score_codex":0.00044216865,"about_ca_system_score_gemma":0.00018398449,"threshold_uncertainty_score":0.44780383},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006162756,0.0003571083,0.99039733,0.0008284235,0.0052712336,0.0006880495,0.000003910706,0.00046847647,0.0019238502],"genre_scores_gemma":[0.06346667,0.0000069740104,0.93245983,0.0009215215,0.0023076679,0.000036429254,0.00001030463,0.00007759994,0.0007129753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575865,0.000031322797,0.0005880611,0.0019206122,0.0008116132,0.00088975177],"domain_scores_gemma":[0.996487,0.0015168552,0.00032527,0.0012616353,0.00028745664,0.00012174942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014505956,0.00057192077,0.0004971765,0.0005082108,0.0005000379,0.000999463,0.0031951591,0.0003383848,0.000008039174],"category_scores_gemma":[0.00049582165,0.00055632956,0.00017766401,0.0010326515,0.0004352871,0.00072444364,0.0014501888,0.001216066,0.000038808084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044929225,0.000004189911,0.000037288763,0.000055814384,0.000007810567,0.000024391804,0.0002493041,0.6465754,0.000033500706,0.032042313,0.000039103834,0.3209264],"study_design_scores_gemma":[0.00015277465,0.00011177559,0.00005930048,0.0003726325,0.000015661173,0.00003811488,1.0488507e-7,0.83120614,0.000027754239,0.16565114,0.0018463061,0.0005183014],"about_ca_topic_score_codex":0.000013038388,"about_ca_topic_score_gemma":0.0000117951,"teacher_disagreement_score":0.3204081,"about_ca_system_score_codex":0.0004101453,"about_ca_system_score_gemma":0.0005045199,"threshold_uncertainty_score":0.9996888},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009761949,0.0004997279,0.9942336,0.00088330416,0.00091441313,0.0009408565,0.000015173887,0.000109618886,0.00142713],"genre_scores_gemma":[0.73429185,0.0000093344315,0.2645545,0.00052144605,0.0002642292,0.000047850957,0.000001405675,0.000033629043,0.0002757545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977482,0.000036307236,0.0005014573,0.00076224183,0.00062701455,0.00032478414],"domain_scores_gemma":[0.99699014,0.0009787536,0.00030212163,0.0015220423,0.0001699261,0.0000370081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017536929,0.00029241148,0.00039079096,0.0002220591,0.00017029754,0.0002373937,0.0048633125,0.00017608378,0.0000059129825],"category_scores_gemma":[0.00008527591,0.00015882088,0.00025868564,0.000579145,0.0011802843,0.00025736858,0.0018627371,0.00042328672,0.0000010148489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065642707,0.000032831307,0.00005872789,0.00037256698,0.000023277158,0.0000033003464,0.0049442807,0.0009419195,0.0024440002,0.3042861,0.000029363142,0.6868571],"study_design_scores_gemma":[0.000069070746,0.0000941364,0.000056695742,0.0008413643,0.000016710195,0.000014471296,0.0000032987598,0.07728194,0.07014144,0.8506726,0.000540364,0.00026789118],"about_ca_topic_score_codex":0.000028871433,"about_ca_topic_score_gemma":0.000040134004,"teacher_disagreement_score":0.73331565,"about_ca_system_score_codex":0.00011355315,"about_ca_system_score_gemma":0.00035747475,"threshold_uncertainty_score":0.90373254},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000617234,0.0017212739,0.99051887,0.0021319035,0.0017064853,0.00068074255,0.000021253107,0.00036149702,0.0027962306],"genre_scores_gemma":[0.15824437,0.00014439746,0.83400226,0.001706988,0.0020365051,0.000065141016,0.000011926637,0.00012425036,0.003664174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968307,0.000036314494,0.00039010463,0.0014310314,0.00064766273,0.00066420034],"domain_scores_gemma":[0.99531776,0.0030023644,0.00020686528,0.0012189453,0.00015730933,0.00009674696],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021389402,0.00046877644,0.000405734,0.0004632593,0.0004993239,0.0011624539,0.0037928643,0.0002520991,0.000009234782],"category_scores_gemma":[0.00011343749,0.00033440287,0.0002130777,0.0004987051,0.00066015765,0.00059220503,0.0019094449,0.0008158105,0.000045373603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006666269,0.0000117360505,0.0000065410263,0.00009278527,0.000020852498,0.000040958446,0.0006179401,0.0060197967,0.00006358994,0.5204248,0.00008368967,0.47261068],"study_design_scores_gemma":[0.000111291185,0.000080976395,0.000017283852,0.00037563097,0.000014928222,0.000058103782,8.143637e-7,0.49054646,0.00023867554,0.50232506,0.005875823,0.00035498478],"about_ca_topic_score_codex":0.00004180945,"about_ca_topic_score_gemma":0.000051843672,"teacher_disagreement_score":0.48452666,"about_ca_system_score_codex":0.0002740181,"about_ca_system_score_gemma":0.0004387955,"threshold_uncertainty_score":0.9999108},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07488401,0.0007000982,0.91906005,0.0039163395,0.0010848542,0.00016808139,0.0000037586094,0.00017333252,0.00000949832],"genre_scores_gemma":[0.65401745,0.000010681876,0.34535727,0.0004119967,0.00018394916,0.0000061455767,0.000001150908,0.000006677411,0.000004691771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976283,0.000032800617,0.00017204718,0.0011228104,0.0005365245,0.0005075718],"domain_scores_gemma":[0.9987753,0.0002614124,0.00001977099,0.0006833866,0.000059260998,0.00020087694],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005087477,0.00022805596,0.00019987802,0.00039953558,0.00021250693,0.002700519,0.0015559862,0.00007197723,0.0000034610784],"category_scores_gemma":[0.00006003302,0.00017497668,0.000036482816,0.0016625251,0.0002034346,0.001630599,0.0016733028,0.0002596018,0.000011328662],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021854014,0.000017123404,0.0014104779,0.00002690767,0.00000283799,0.0001319209,0.00092391175,0.0025802786,0.0017864718,0.00044581172,0.00006263482,0.99260944],"study_design_scores_gemma":[0.000070069094,0.00014172931,0.026982982,0.0002359415,0.0000026126893,0.00016596388,0.00000160971,0.9565374,0.008040637,0.006819048,0.00065596146,0.00034599184],"about_ca_topic_score_codex":0.000036322646,"about_ca_topic_score_gemma":0.000034643283,"teacher_disagreement_score":0.99226344,"about_ca_system_score_codex":0.000063850144,"about_ca_system_score_gemma":0.00013642009,"threshold_uncertainty_score":0.99833477},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007541774,0.0013667463,0.9881089,0.00010613949,0.0022734285,0.00046120505,0.000039813924,0.000041690455,0.00006033295],"genre_scores_gemma":[0.9965166,0.0000547524,0.0031553914,0.000016867521,0.00021540777,0.000008645858,0.0000069145035,0.000014162011,0.000011296551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876106,0.000013070611,0.0003175133,0.00039508945,0.0003193528,0.00019390328],"domain_scores_gemma":[0.99911875,0.00024125224,0.000070374765,0.00038378703,0.00012902454,0.000056820107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037431554,0.0002180297,0.00029929364,0.00012591234,0.00004421367,0.00007347067,0.0003956228,0.00013007918,8.684032e-7],"category_scores_gemma":[0.00003433646,0.00012807635,0.00003878478,0.00031758673,0.00048618697,0.00007850657,0.00016010036,0.0005133591,3.690532e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008218815,0.0000044736685,0.000022635226,0.00017610982,0.0000065485583,0.0000028733807,0.00046587907,0.95309526,0.00017277044,0.0003766142,0.000007747511,0.04566085],"study_design_scores_gemma":[0.000053327007,0.00016982769,0.0001798154,0.00064060907,0.000013072962,0.000012154262,0.0000013648622,0.9973912,0.00050964404,0.00076345494,0.00011732934,0.00014815787],"about_ca_topic_score_codex":0.000033910674,"about_ca_topic_score_gemma":0.0000640045,"teacher_disagreement_score":0.9889748,"about_ca_system_score_codex":0.00007423996,"about_ca_system_score_gemma":0.000036570593,"threshold_uncertainty_score":0.5222802},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017426042,0.0016609541,0.9949316,0.0008264187,0.0010879176,0.00046759285,0.000006720756,0.000096059455,0.0007484916],"genre_scores_gemma":[0.2770696,0.00015730674,0.7196556,0.00075616373,0.00074881583,0.000024508154,0.0000063007487,0.000057326837,0.0015243895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726593,0.000016148948,0.00028448406,0.0014136685,0.00048997207,0.0005297991],"domain_scores_gemma":[0.99859077,0.0003443147,0.00012685396,0.0006282068,0.00017074977,0.00013909373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000446563,0.00043880296,0.00041421465,0.00038468477,0.00035605812,0.0009324275,0.0009237988,0.00016116782,0.00000675664],"category_scores_gemma":[0.000024598705,0.00032142486,0.000076911914,0.00031861415,0.0004016792,0.00063534273,0.0008381336,0.00039126354,0.000007195913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002183782,0.00001962778,0.000015319963,0.000092228634,0.000021883914,0.0000715354,0.0010176637,0.028580735,0.0018574665,0.013846052,0.00009845073,0.9543572],"study_design_scores_gemma":[0.0002663763,0.00029159506,0.000038689737,0.00061609485,0.000018833007,0.00004829532,6.1837545e-7,0.9192001,0.0024259156,0.07304241,0.003536998,0.0005140557],"about_ca_topic_score_codex":0.000017159655,"about_ca_topic_score_gemma":0.000061542,"teacher_disagreement_score":0.9538431,"about_ca_system_score_codex":0.00010856703,"about_ca_system_score_gemma":0.00019924497,"threshold_uncertainty_score":0.99992377},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016707488,0.00033668714,0.9979716,0.00015948102,0.00045889194,0.00052678474,0.000011521359,0.00025564912,0.00011230326],"genre_scores_gemma":[0.13238905,0.000020142996,0.867284,0.000060835013,0.000082141276,0.000016752143,0.0000045720976,0.000023873097,0.0001186429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981092,0.000012751132,0.00038137205,0.00087272254,0.0003942655,0.00022964187],"domain_scores_gemma":[0.99847645,0.0005074396,0.00018395975,0.00054392946,0.00023361076,0.00005463171],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004120087,0.0002783038,0.00034700453,0.0006279553,0.000072773146,0.0002116174,0.0007359632,0.00013571042,9.714298e-7],"category_scores_gemma":[0.000034249002,0.0002590098,0.00007241748,0.0003435384,0.00021361433,0.00048000773,0.00054280536,0.00027113172,9.554581e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003420728,0.0000035849862,0.000024430776,0.00008783369,0.000007783203,0.000004878146,0.0007570187,0.43230546,0.00017417275,0.056466773,0.0000018266284,0.51016283],"study_design_scores_gemma":[0.000059468995,0.00006942227,0.000030870524,0.0002707928,0.0000048695115,0.000005430484,1.5336056e-8,0.7166595,0.0024879118,0.27996668,0.00026700122,0.00017806413],"about_ca_topic_score_codex":0.000018467656,"about_ca_topic_score_gemma":0.000019228652,"teacher_disagreement_score":0.50998473,"about_ca_system_score_codex":0.00010579505,"about_ca_system_score_gemma":0.000106113934,"threshold_uncertainty_score":0.99998623},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006136238,0.00082594494,0.9908208,0.0005467528,0.0038302676,0.00040058087,0.0000024066767,0.0003832991,0.002576281],"genre_scores_gemma":[0.9594294,0.00018553657,0.03576461,0.0026022454,0.0016429977,0.000016930197,0.0000049302485,0.00006011322,0.00029324778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962235,0.00005452824,0.00047143694,0.0017525323,0.000863258,0.00063475705],"domain_scores_gemma":[0.9981953,0.0003848608,0.0001883359,0.00093530986,0.000107886044,0.00018829665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000944918,0.00056629983,0.00043116885,0.0010325308,0.00046636103,0.0009696436,0.0012026038,0.00049557514,0.000025314457],"category_scores_gemma":[0.000025625686,0.00050968834,0.00013154584,0.0012061817,0.00046538727,0.000458314,0.0006110367,0.0014099248,0.000047963324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014068361,0.000012241069,9.190476e-7,0.000031799576,0.0000037841705,0.000046295714,0.00009031761,0.30803618,0.000043667973,0.006328717,0.00001734615,0.6853747],"study_design_scores_gemma":[0.00016416339,0.00065385055,0.000027755788,0.00058998045,0.0000097960265,0.000049924784,7.75493e-8,0.86055017,0.00035562975,0.13446666,0.0026525105,0.00047945333],"about_ca_topic_score_codex":0.000009847838,"about_ca_topic_score_gemma":0.00018981645,"teacher_disagreement_score":0.95881575,"about_ca_system_score_codex":0.00021409888,"about_ca_system_score_gemma":0.0001913415,"threshold_uncertainty_score":0.9997355},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33518946,0.009555119,0.53023064,0.041342646,0.01349026,0.0056702215,0.0005222517,0.0015009444,0.062498454],"genre_scores_gemma":[0.9945981,0.000035869187,0.002904625,0.0014629845,0.0004188689,0.000014613387,0.000045106353,0.0000045846527,0.0005152538],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708533,0.0000279145,0.00048247038,0.0011452555,0.00063019595,0.00062884897],"domain_scores_gemma":[0.99842846,0.0010786534,0.00010601699,0.00020327242,0.00009568215,0.00008793211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005785824,0.0004097387,0.00042793129,0.000104601764,0.00024302317,0.00028488354,0.00081226963,0.00042311792,0.0002600634],"category_scores_gemma":[0.000101670645,0.00019630599,0.00014599228,0.00062483666,0.00061438605,0.0003040813,0.00041404332,0.0011516657,0.000055785506],"study_design_candidate":"design_other","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.00006582348,0.00017685276,0.0014275644,0.00029478146,0.00004651239,0.0003418193,0.0026230845,0.014680921,0.030642485,0.011156528,0.0004102491,0.93813336],"study_design_scores_gemma":[0.0008128921,0.0024302416,0.014103901,0.0066489107,0.000083921506,0.00031643905,0.000078968194,0.05014622,0.07329668,0.82993054,0.018021753,0.0041295392],"about_ca_topic_score_codex":0.0007075895,"about_ca_topic_score_gemma":0.021043126,"teacher_disagreement_score":0.93400383,"about_ca_system_score_codex":0.00032755354,"about_ca_system_score_gemma":0.000085816515,"threshold_uncertainty_score":0.9968203},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074805524,0.0005415321,0.9678462,0.0037527096,0.0014568733,0.00045778102,0.000007897377,0.00023302952,0.025629146],"genre_scores_gemma":[0.8077915,0.00019553037,0.1781323,0.010529536,0.0011090819,0.00010996194,0.00001100018,0.0001428482,0.001978261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622685,0.00008470471,0.00046459318,0.0016464246,0.00088519795,0.0006922044],"domain_scores_gemma":[0.9957623,0.0023711654,0.00015430956,0.0015256095,0.00007716849,0.00010944212],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002085797,0.0005604653,0.00042934448,0.001175691,0.00025282448,0.001280192,0.0042924355,0.00029210123,0.000030790296],"category_scores_gemma":[0.00011820918,0.00038010074,0.00021764835,0.0015572915,0.0007581605,0.00047075938,0.0016829482,0.0018004831,0.000107251864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008148556,0.000017169627,0.000011352553,0.000032816355,0.000010365646,0.00014790251,0.0010478459,0.010343023,0.000015122222,0.80453634,0.000045284796,0.18378463],"study_design_scores_gemma":[0.000097883676,0.00015830103,0.000020010064,0.00094926736,0.0000050336434,0.00002514768,2.1689317e-7,0.17401825,0.00017702642,0.8223167,0.0018164429,0.0004157184],"about_ca_topic_score_codex":0.000015610865,"about_ca_topic_score_gemma":0.0001036451,"teacher_disagreement_score":0.80771667,"about_ca_system_score_codex":0.0001864599,"about_ca_system_score_gemma":0.00021696153,"threshold_uncertainty_score":0.9998651},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014017396,0.011076766,0.96819276,0.0028761285,0.002051866,0.0013772845,0.00008595759,0.00016081243,0.00016100927],"genre_scores_gemma":[0.3737175,0.00020967591,0.6220874,0.0016386587,0.0009867314,0.00031875842,0.00003268897,0.000093007446,0.0009155764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533904,0.0002238621,0.00079144305,0.0021333362,0.0007734522,0.00073888764],"domain_scores_gemma":[0.9887643,0.009756236,0.00029948764,0.0007156592,0.00027470983,0.0001896286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033746006,0.00075904984,0.00083550945,0.0009655265,0.00024567798,0.00090126554,0.0021512723,0.0003156519,0.00000929451],"category_scores_gemma":[0.0006612639,0.0005887624,0.00024635083,0.00070996635,0.0006685569,0.00054421753,0.0012109875,0.0009696112,0.0000013703617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010853597,0.000104303996,0.0014945372,0.00070194824,0.00004938185,0.00017074138,0.0050858674,0.878972,0.00073698675,0.012634145,0.00065246737,0.09831226],"study_design_scores_gemma":[0.0011241679,0.00010501395,0.0007369625,0.0013931993,0.000020683518,0.000016954747,0.0000017119523,0.93070877,0.0010112268,0.063758455,0.00047787125,0.00064501475],"about_ca_topic_score_codex":0.00015283278,"about_ca_topic_score_gemma":0.0013873068,"teacher_disagreement_score":0.35970008,"about_ca_system_score_codex":0.00058186596,"about_ca_system_score_gemma":0.0015308729,"threshold_uncertainty_score":0.9996564},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044649674,0.00031991772,0.9883343,0.0049661696,0.00064625725,0.0006349385,0.000011266407,0.00042392375,0.0046185683],"genre_scores_gemma":[0.0204596,0.00007806042,0.97511005,0.0030210367,0.0005035883,0.000073335075,0.00001820083,0.000077648285,0.0006584496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99423784,0.000023216007,0.0006118989,0.0021253487,0.0021971774,0.00080453465],"domain_scores_gemma":[0.99686176,0.00041100237,0.00026659458,0.001907198,0.00019203838,0.00036141614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075048534,0.0006518564,0.00051259657,0.00059596094,0.00034392302,0.00069249386,0.0045883227,0.00030318694,0.000027878134],"category_scores_gemma":[0.00006049091,0.00054298085,0.00011368948,0.00092308444,0.00084824325,0.0009866018,0.0021204327,0.0013866093,0.0000485479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000108096665,0.00004036579,0.000002836358,0.00008431781,0.000029300636,0.00033663542,0.0031432786,0.4313622,0.0007142335,0.104536034,0.00015637436,0.4595836],"study_design_scores_gemma":[0.00023323104,0.00009979601,0.000002197373,0.00046185503,0.0000119549495,0.00016615781,6.361933e-7,0.7343612,0.0007361147,0.26320678,0.00023588665,0.00048423262],"about_ca_topic_score_codex":0.0000055308333,"about_ca_topic_score_gemma":0.00010104601,"teacher_disagreement_score":0.45909938,"about_ca_system_score_codex":0.0004739796,"about_ca_system_score_gemma":0.0009366722,"threshold_uncertainty_score":0.99970216},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018976416,0.00042642473,0.9957966,0.0005092437,0.0010966077,0.0012254124,0.000020235795,0.00024663025,0.00048908696],"genre_scores_gemma":[0.10146471,0.00003215339,0.8975049,0.00021646838,0.0005494741,0.000055564564,0.0000041133394,0.000045579818,0.00012698362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945938,0.00006853378,0.00067438505,0.00210487,0.001458196,0.0011002241],"domain_scores_gemma":[0.9945039,0.0028175707,0.0002980281,0.0016721094,0.0004926866,0.00021569249],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0034926995,0.00056070636,0.0006641817,0.0009558504,0.00060675305,0.0018827156,0.0034551306,0.00043898734,0.000014135796],"category_scores_gemma":[0.0009950971,0.00045702886,0.00038753208,0.0010895985,0.0008232711,0.0008769321,0.0023008792,0.0017975129,0.00001731622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075315265,0.000045632663,0.000099485194,0.00036632264,0.00004614079,0.000035993125,0.0005329377,0.07916861,0.000025851823,0.44167423,0.000002686652,0.4779946],"study_design_scores_gemma":[0.00006426011,0.000108145665,0.000017156292,0.00048878376,0.00002213403,0.000014105341,1.9965775e-7,0.5071757,0.000047076624,0.49162474,0.00015650288,0.00028118677],"about_ca_topic_score_codex":0.00003088806,"about_ca_topic_score_gemma":0.000027909911,"teacher_disagreement_score":0.4777134,"about_ca_system_score_codex":0.0008506212,"about_ca_system_score_gemma":0.0015656853,"threshold_uncertainty_score":0.99978817},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000016647343,0.00088484905,0.97713315,0.0018153524,0.0074981195,0.002031876,0.000007018007,0.00033810484,0.010289853],"genre_scores_gemma":[0.9022085,0.0000334239,0.08641032,0.0013221112,0.0036356156,0.0004476562,0.00003141671,0.00013189459,0.005779043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965568,0.000040765743,0.0005690468,0.0015104235,0.0006846794,0.00063824636],"domain_scores_gemma":[0.99716735,0.00078598846,0.0003361464,0.0013178019,0.0002893158,0.000103391256],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002203068,0.0005060386,0.00045207475,0.00040283354,0.00042128266,0.0015717983,0.003175245,0.0003079334,0.000007911875],"category_scores_gemma":[0.00007162135,0.00031348597,0.00022054919,0.00052945764,0.0004322534,0.0004895587,0.00096607505,0.0006310188,0.000075770484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038568974,0.000009546196,0.000002578553,0.0001973922,0.000020186726,0.000010505001,0.0005809861,0.00061892375,0.0000145311815,0.47999477,0.00010872054,0.518438],"study_design_scores_gemma":[0.00022864413,0.00025432205,0.0000034520224,0.00022082942,0.000029049976,0.00010310765,0.0000017551583,0.47630328,0.0010649503,0.44700873,0.074226715,0.00055514975],"about_ca_topic_score_codex":0.000025902798,"about_ca_topic_score_gemma":0.000053714237,"teacher_disagreement_score":0.90220684,"about_ca_system_score_codex":0.00040313313,"about_ca_system_score_gemma":0.00038717108,"threshold_uncertainty_score":0.9999317},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020541974,0.00025719585,0.9713448,0.0002814297,0.0013017808,0.0003852523,0.0000062231074,0.00029478988,0.02592307],"genre_scores_gemma":[0.035126273,0.0000065756044,0.95941126,0.002375666,0.0005277959,0.000006960871,0.000003892641,0.000052498202,0.0024891014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958399,0.000018158093,0.0008925809,0.0011322907,0.0012678578,0.0008492023],"domain_scores_gemma":[0.99788094,0.00016082342,0.0002929547,0.0011789368,0.00020705264,0.0002793191],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011738649,0.0005633803,0.00059522287,0.0010663869,0.0002967824,0.001750893,0.002777642,0.0002748546,0.000054985187],"category_scores_gemma":[0.000053653686,0.00049128826,0.0001548341,0.0006929216,0.00017855302,0.0013969651,0.0025027418,0.0007119684,0.000273071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019826207,0.000041842508,0.0000013588207,0.00046823305,0.000021730846,0.00008799491,0.015107677,0.12690568,0.000109685374,0.7497887,0.00009398544,0.107371114],"study_design_scores_gemma":[0.000081431834,0.00002343738,2.9031605e-7,0.0006229853,0.0000062406725,0.000058883525,0.0000010538954,0.6051819,0.00024443015,0.39304826,0.0003851163,0.00034600677],"about_ca_topic_score_codex":0.000007268265,"about_ca_topic_score_gemma":0.0000069181046,"teacher_disagreement_score":0.4782762,"about_ca_system_score_codex":0.0003816653,"about_ca_system_score_gemma":0.00042160726,"threshold_uncertainty_score":0.9997539},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014683865,0.0017663122,0.82055545,0.0011163059,0.0046204873,0.00080387015,0.000071151524,0.00021416073,0.1693839],"genre_scores_gemma":[0.7006795,0.00014292226,0.2263389,0.0011677904,0.0015570745,0.000041260817,0.000016702783,0.00014687161,0.069909],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9909336,0.00009284416,0.0014904035,0.0030828128,0.0036660496,0.0007342881],"domain_scores_gemma":[0.9902084,0.0061556976,0.0005039547,0.0020697305,0.0007212887,0.00034094142],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0034815543,0.0007274626,0.0009053555,0.0029980035,0.00045400352,0.0029177442,0.003453919,0.00059597654,0.0005707373],"category_scores_gemma":[0.0031168635,0.0005477769,0.00018514108,0.0018046276,0.0013278981,0.00091333664,0.0026427265,0.0015444369,0.0011827997],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016874117,0.000028708992,0.0011056407,0.000033091703,0.000020446649,0.00005454011,0.0009818432,0.0070497976,0.00017257781,0.066504166,0.001035007,0.9229973],"study_design_scores_gemma":[0.00021860839,0.00008680986,0.002753717,0.000686593,0.00002155662,0.00005798266,0.0000012143631,0.10181911,0.000041879837,0.83948976,0.054170743,0.0006520207],"about_ca_topic_score_codex":0.000030605126,"about_ca_topic_score_gemma":0.00039769046,"teacher_disagreement_score":0.9223453,"about_ca_system_score_codex":0.00023220839,"about_ca_system_score_gemma":0.00058244634,"threshold_uncertainty_score":0.9996974},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008675339,0.00027774216,0.99340904,0.00079262187,0.004135736,0.0005231223,0.000008457439,0.0003149684,0.0004515473],"genre_scores_gemma":[0.61133206,0.000008272939,0.38417602,0.0019448412,0.0017152248,0.000061920946,0.000012383913,0.00006196352,0.0006872924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960905,0.000017339418,0.0004502322,0.0017108804,0.00090936624,0.00082173164],"domain_scores_gemma":[0.9984121,0.00027219742,0.00025214246,0.00066677935,0.00024219119,0.00015462536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000817847,0.00054050254,0.000405924,0.00071632944,0.00054591795,0.00074747443,0.0014316074,0.00032505926,0.0000032852531],"category_scores_gemma":[0.000041880663,0.0005169609,0.00024228581,0.0005898095,0.0001966302,0.00051835756,0.00046468107,0.0005800811,0.000022196107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014535068,0.000012092102,0.0000015094387,0.00006915463,0.000007486322,0.000014728288,0.00006704717,0.8605111,0.0007638937,0.008211811,0.000010114611,0.1303165],"study_design_scores_gemma":[0.00019390449,0.00014672583,0.000006675764,0.00044280017,0.0000100899415,0.000018404247,4.6176076e-8,0.6727636,0.0036626554,0.32235107,0.000037315192,0.00036674077],"about_ca_topic_score_codex":0.0000039420606,"about_ca_topic_score_gemma":0.000041750216,"teacher_disagreement_score":0.61124533,"about_ca_system_score_codex":0.0004508922,"about_ca_system_score_gemma":0.0004301872,"threshold_uncertainty_score":0.9997282},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008234323,0.00178789,0.9783911,0.000043980817,0.012569402,0.0005798159,0.0000092695345,0.0011408079,0.0046542883],"genre_scores_gemma":[0.06385623,0.00024924026,0.92764485,0.00030542377,0.0038665885,0.000086273794,0.000056316727,0.00024627266,0.0036888034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718106,0.000048994727,0.00047769913,0.001036057,0.0005362428,0.0007199714],"domain_scores_gemma":[0.9985731,0.0003354315,0.00013902156,0.0006863917,0.000155601,0.000110442845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007911313,0.00066851225,0.0005442976,0.00078234327,0.00024054656,0.00028366814,0.00069235853,0.00088868424,0.00006357475],"category_scores_gemma":[0.00009097194,0.00064954115,0.000199448,0.0007833437,0.00026167248,0.00026021258,0.00035667865,0.0018208154,0.00011104781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015634516,0.0000034197196,0.0000055352816,0.00016621305,0.000028727207,0.000035352263,0.00017073014,0.65609795,0.042826973,0.000093612405,0.00004073725,0.30051512],"study_design_scores_gemma":[0.00021829756,0.00018979423,0.00018832755,0.00075442635,0.000040819057,0.00009306783,5.7297626e-7,0.62091595,0.115858935,0.25501186,0.0055713938,0.0011565377],"about_ca_topic_score_codex":0.000004846636,"about_ca_topic_score_gemma":0.00006169751,"teacher_disagreement_score":0.29935858,"about_ca_system_score_codex":0.0005470291,"about_ca_system_score_gemma":0.000065623404,"threshold_uncertainty_score":0.9995956},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013698239,0.00053075654,0.97788,0.0010755842,0.004105127,0.0007345088,0.000030601357,0.00061967137,0.014886749],"genre_scores_gemma":[0.0078620175,0.000111764566,0.9883542,0.0012523915,0.00084723765,0.000050268158,0.00008456801,0.00008243379,0.0013551133],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99461275,0.0001315125,0.0007992416,0.0024686714,0.0010498023,0.0009380457],"domain_scores_gemma":[0.9971126,0.00078498287,0.00038077947,0.0010568348,0.00038895602,0.00027588487],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017260567,0.0007962309,0.00066293194,0.0012135562,0.0004115609,0.0011199964,0.002048631,0.0006264523,0.00010638556],"category_scores_gemma":[0.00020222987,0.00075351243,0.00028153832,0.0010529434,0.00045387825,0.0013164931,0.0011180695,0.0016295898,0.0010719431],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008041035,0.000027306221,9.051384e-7,0.00008322664,0.000017640466,0.00008779465,0.0011133468,0.0010065202,0.003136154,0.0009651893,0.000055065546,0.9934988],"study_design_scores_gemma":[0.000251539,0.00020604204,0.000005801148,0.0013151594,0.000036568083,0.00024527326,0.0000036572253,0.38296792,0.030428352,0.58179164,0.0016249955,0.0011230215],"about_ca_topic_score_codex":0.00004129526,"about_ca_topic_score_gemma":0.000030895448,"teacher_disagreement_score":0.9923758,"about_ca_system_score_codex":0.0004496552,"about_ca_system_score_gemma":0.00031720943,"threshold_uncertainty_score":0.9999169},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007308624,0.00006940319,0.99329615,0.0005715523,0.0021609245,0.0005955913,0.0000053736926,0.00033726013,0.0028906886],"genre_scores_gemma":[0.75701284,0.00003232288,0.2420113,0.00046340754,0.00028632575,0.000037332604,0.0000021651367,0.00003685197,0.000117437485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975197,0.00007105371,0.00050916936,0.0009177879,0.0007021066,0.00028019398],"domain_scores_gemma":[0.998538,0.00035407947,0.00026344892,0.0005265661,0.00024402999,0.00007387119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010675391,0.00038389384,0.00041387187,0.0017113878,0.00016704638,0.00034713317,0.00057741225,0.00033341837,0.000011176197],"category_scores_gemma":[0.00009747334,0.0003436044,0.00012922763,0.00071688776,0.00028840092,0.0006114111,0.00018469838,0.000861218,0.0000067565647],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014726499,0.000019339353,8.2800733e-7,0.000044427376,0.000009205488,0.000007681322,0.0008746162,0.002976449,0.0006910558,0.0016417066,0.0000062856734,0.9937137],"study_design_scores_gemma":[0.00021254118,0.00068409834,0.000015852378,0.00048563874,0.000015770185,0.000058984784,0.0000019818797,0.6740256,0.26864862,0.055520747,0.000075043725,0.00025512272],"about_ca_topic_score_codex":0.00017063027,"about_ca_topic_score_gemma":0.000050013376,"teacher_disagreement_score":0.99345857,"about_ca_system_score_codex":0.0007081608,"about_ca_system_score_gemma":0.00027894625,"threshold_uncertainty_score":0.9999016},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001067632,0.0009558078,0.9891489,0.00026260666,0.00461501,0.000668059,0.0000073926362,0.0002955144,0.0039399047],"genre_scores_gemma":[0.38291913,0.0005154026,0.6082608,0.003252548,0.002343338,0.00013650877,0.000022434688,0.00009690923,0.0024528918],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966387,0.00005169896,0.00053080515,0.0015240447,0.00061342923,0.0006413083],"domain_scores_gemma":[0.99771446,0.0005893534,0.0002699785,0.0007886273,0.0005123855,0.00012520039],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012437399,0.00050812087,0.0005077142,0.0011543487,0.00069377763,0.00066641526,0.0021871515,0.0004536882,0.000013860533],"category_scores_gemma":[0.0000706779,0.00050668145,0.00024328972,0.00094263285,0.00035378183,0.00074273616,0.00076718075,0.0009037648,0.000014932975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019757017,0.00004617227,0.0000078127505,0.00012969988,0.000020915546,0.0000054198094,0.0012871342,0.0062943213,0.00013003724,0.302351,0.0003171698,0.68939054],"study_design_scores_gemma":[0.00024715188,0.0001667449,0.000017329772,0.00052796496,0.000011899179,0.000029239596,1.6901518e-7,0.37140965,0.0010397303,0.6143867,0.011679615,0.00048382906],"about_ca_topic_score_codex":0.00005272279,"about_ca_topic_score_gemma":0.0008378268,"teacher_disagreement_score":0.6889067,"about_ca_system_score_codex":0.00042520856,"about_ca_system_score_gemma":0.00065110484,"threshold_uncertainty_score":0.99973845},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4328581,0.0029747197,0.5560777,0.0056059575,0.0015278758,0.0005790103,0.00010294251,0.00007768275,0.00019596968],"genre_scores_gemma":[0.9154791,0.00089658896,0.07455347,0.0071109906,0.00091704144,0.0000066623593,0.0007509489,0.00007381796,0.00021138253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774045,0.000020799784,0.00033818814,0.00096780807,0.0006371438,0.00029563298],"domain_scores_gemma":[0.9990315,0.00024249799,0.0000829561,0.00040137372,0.000030659463,0.00021102306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059789006,0.00024196098,0.00035739815,0.00023000466,0.00008653435,0.0001809675,0.00036790848,0.000042944837,0.0000268116],"category_scores_gemma":[0.00031166722,0.00020431778,0.000020833597,0.00017773088,0.0005858819,0.00016288362,0.0006573553,0.00078741706,0.0000034061527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011169794,0.0001086076,0.14387804,0.00066514796,0.000080971084,0.0073977676,0.0029864071,0.0077984976,0.0014519104,0.00032023675,0.00031274278,0.834888],"study_design_scores_gemma":[0.0010873909,0.00006390907,0.005044929,0.0018704883,0.000021612692,0.00067080144,0.0000020099633,0.98821515,0.00006798879,0.0017724965,0.0009768701,0.00020634572],"about_ca_topic_score_codex":0.00068610325,"about_ca_topic_score_gemma":0.0014710273,"teacher_disagreement_score":0.98041666,"about_ca_system_score_codex":0.00011702434,"about_ca_system_score_gemma":0.00018900678,"threshold_uncertainty_score":0.83318377},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031738487,0.0067972406,0.9749363,0.0014814287,0.0071232547,0.00047101354,0.0000059640192,0.000304004,0.008849059],"genre_scores_gemma":[0.021086302,0.0010219319,0.9674999,0.005102222,0.0023633447,0.00012410044,0.000025993666,0.000147066,0.0026291558],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941121,0.00013206081,0.0007993758,0.0025989767,0.0012145926,0.0011429043],"domain_scores_gemma":[0.99696463,0.0008999453,0.00023870796,0.0015022904,0.00019148296,0.00020295258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001305365,0.00072084006,0.0007709895,0.002425911,0.00013802295,0.00078862393,0.004499185,0.0004698609,0.00005689534],"category_scores_gemma":[0.0002066415,0.0006753275,0.00017757756,0.0034181785,0.0009096741,0.0017540614,0.0019667742,0.0018746144,0.00043812173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012726292,0.00007304767,0.000054671294,0.0002856121,0.000007160904,0.0008669723,0.00097254774,0.0584739,0.00035429402,0.024841938,0.001129365,0.91292775],"study_design_scores_gemma":[0.00029757092,0.000211636,0.0000569551,0.00095439475,0.000007271372,0.00014567345,2.5583347e-7,0.46393114,0.00076761405,0.5131413,0.019683206,0.00080298743],"about_ca_topic_score_codex":0.000027823022,"about_ca_topic_score_gemma":0.0003442095,"teacher_disagreement_score":0.91212475,"about_ca_system_score_codex":0.0013048421,"about_ca_system_score_gemma":0.0022347325,"threshold_uncertainty_score":0.9995698},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014554197,0.00042481313,0.9929778,0.00037446112,0.00077518314,0.003751449,0.000027423455,0.0006016011,0.0010527377],"genre_scores_gemma":[0.022745537,0.000019449206,0.9760861,0.00023871927,0.00013559042,0.00038095305,0.000010303206,0.000042368367,0.0003410181],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635094,0.000016512,0.0006311812,0.0015748767,0.00090538815,0.00052111637],"domain_scores_gemma":[0.9968811,0.0002643285,0.00035802487,0.0021733462,0.00023941552,0.000083745595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005217114,0.000515404,0.00060341135,0.0011091073,0.0001289498,0.0003857983,0.004783558,0.00037865288,0.000008195635],"category_scores_gemma":[0.00006711818,0.00046098063,0.00013024849,0.000872172,0.0013270137,0.0009442002,0.0031583088,0.0009491204,0.000065756176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008595967,0.00008322707,0.000016643407,0.00035323363,0.000023057566,0.00026050524,0.0004612077,0.019942353,0.0030796607,0.24886066,0.000034295903,0.72687656],"study_design_scores_gemma":[0.00032414717,0.00035427487,0.000028427534,0.0018508793,0.000010646762,0.00012021183,2.2625092e-7,0.41650364,0.019973474,0.55729455,0.0027290778,0.0008104491],"about_ca_topic_score_codex":0.00000961654,"about_ca_topic_score_gemma":0.00002276726,"teacher_disagreement_score":0.7260661,"about_ca_system_score_codex":0.00037142396,"about_ca_system_score_gemma":0.0003212385,"threshold_uncertainty_score":0.9997842},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031738487,0.0067972406,0.9749363,0.0014814287,0.0071232547,0.00047101354,0.0000059640192,0.000304004,0.008849059],"genre_scores_gemma":[0.021086302,0.0010219319,0.9674999,0.005102222,0.0023633447,0.00012410044,0.000025993666,0.000147066,0.0026291558],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941121,0.00013206081,0.0007993758,0.0025989767,0.0012145926,0.0011429043],"domain_scores_gemma":[0.99696463,0.0008999453,0.00023870796,0.0015022904,0.00019148296,0.00020295258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001305365,0.00072084006,0.0007709895,0.002425911,0.00013802295,0.00078862393,0.004499185,0.0004698609,0.00005689534],"category_scores_gemma":[0.0002066415,0.0006753275,0.00017757756,0.0034181785,0.0009096741,0.0017540614,0.0019667742,0.0018746144,0.00043812173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012726292,0.00007304767,0.000054671294,0.0002856121,0.000007160904,0.0008669723,0.00097254774,0.0584739,0.00035429402,0.024841938,0.001129365,0.91292775],"study_design_scores_gemma":[0.00029757092,0.000211636,0.0000569551,0.00095439475,0.000007271372,0.00014567345,2.5583347e-7,0.46393114,0.00076761405,0.5131413,0.019683206,0.00080298743],"about_ca_topic_score_codex":0.000027823022,"about_ca_topic_score_gemma":0.0003442095,"teacher_disagreement_score":0.91212475,"about_ca_system_score_codex":0.0013048421,"about_ca_system_score_gemma":0.0022347325,"threshold_uncertainty_score":0.9995698},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011139186,0.002548886,0.98916626,0.0006917781,0.0013877717,0.0003251672,0.000022874276,0.00038339882,0.005362501],"genre_scores_gemma":[0.18143982,0.00009675281,0.8144429,0.0027278948,0.0009245148,0.000016944326,0.000023547393,0.0000795961,0.0002480846],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958858,0.000020203744,0.00039468746,0.0019294939,0.0010877406,0.0006820745],"domain_scores_gemma":[0.99750143,0.0004121698,0.0002106514,0.0015454382,0.00016724908,0.00016305105],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006061845,0.00060521136,0.0004757908,0.0010103395,0.00026538727,0.0012827534,0.003445956,0.00033649226,0.000021558255],"category_scores_gemma":[0.000040394443,0.0004662503,0.00014859473,0.0012127925,0.0007933937,0.00084901036,0.0015502449,0.0014273619,0.000055410826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000085346,0.000023792962,0.000021032549,0.000117651914,0.0000282603,0.00047997446,0.0012439443,0.0049395226,0.00009294037,0.4245257,0.00008368553,0.56843495],"study_design_scores_gemma":[0.00033080607,0.0004096796,0.00006880436,0.0020122533,0.000026720969,0.0001970607,5.389433e-7,0.24200925,0.0015731222,0.7416217,0.010346343,0.0014037541],"about_ca_topic_score_codex":0.00004618782,"about_ca_topic_score_gemma":0.00029765215,"teacher_disagreement_score":0.5670312,"about_ca_system_score_codex":0.00012105603,"about_ca_system_score_gemma":0.00039499512,"threshold_uncertainty_score":0.9997789},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031738487,0.0067972406,0.9749363,0.0014814287,0.0071232547,0.00047101354,0.0000059640192,0.000304004,0.008849059],"genre_scores_gemma":[0.021086302,0.0010219319,0.9674999,0.005102222,0.0023633447,0.00012410044,0.000025993666,0.000147066,0.0026291558],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941121,0.00013206081,0.0007993758,0.0025989767,0.0012145926,0.0011429043],"domain_scores_gemma":[0.99696463,0.0008999453,0.00023870796,0.0015022904,0.00019148296,0.00020295258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001305365,0.00072084006,0.0007709895,0.002425911,0.00013802295,0.00078862393,0.004499185,0.0004698609,0.00005689534],"category_scores_gemma":[0.0002066415,0.0006753275,0.00017757756,0.0034181785,0.0009096741,0.0017540614,0.0019667742,0.0018746144,0.00043812173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012726292,0.00007304767,0.000054671294,0.0002856121,0.000007160904,0.0008669723,0.00097254774,0.0584739,0.00035429402,0.024841938,0.001129365,0.91292775],"study_design_scores_gemma":[0.00029757092,0.000211636,0.0000569551,0.00095439475,0.000007271372,0.00014567345,2.5583347e-7,0.46393114,0.00076761405,0.5131413,0.019683206,0.00080298743],"about_ca_topic_score_codex":0.000027823022,"about_ca_topic_score_gemma":0.0003442095,"teacher_disagreement_score":0.91212475,"about_ca_system_score_codex":0.0013048421,"about_ca_system_score_gemma":0.0022347325,"threshold_uncertainty_score":0.9995698},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031738487,0.0067972406,0.9749363,0.0014814287,0.0071232547,0.00047101354,0.0000059640192,0.000304004,0.008849059],"genre_scores_gemma":[0.021086302,0.0010219319,0.9674999,0.005102222,0.0023633447,0.00012410044,0.000025993666,0.000147066,0.0026291558],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941121,0.00013206081,0.0007993758,0.0025989767,0.0012145926,0.0011429043],"domain_scores_gemma":[0.99696463,0.0008999453,0.00023870796,0.0015022904,0.00019148296,0.00020295258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001305365,0.00072084006,0.0007709895,0.002425911,0.00013802295,0.00078862393,0.004499185,0.0004698609,0.00005689534],"category_scores_gemma":[0.0002066415,0.0006753275,0.00017757756,0.0034181785,0.0009096741,0.0017540614,0.0019667742,0.0018746144,0.00043812173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012726292,0.00007304767,0.000054671294,0.0002856121,0.000007160904,0.0008669723,0.00097254774,0.0584739,0.00035429402,0.024841938,0.001129365,0.91292775],"study_design_scores_gemma":[0.00029757092,0.000211636,0.0000569551,0.00095439475,0.000007271372,0.00014567345,2.5583347e-7,0.46393114,0.00076761405,0.5131413,0.019683206,0.00080298743],"about_ca_topic_score_codex":0.000027823022,"about_ca_topic_score_gemma":0.0003442095,"teacher_disagreement_score":0.91212475,"about_ca_system_score_codex":0.0013048421,"about_ca_system_score_gemma":0.0022347325,"threshold_uncertainty_score":0.9995698},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031738487,0.0067972406,0.9749363,0.0014814287,0.0071232547,0.00047101354,0.0000059640192,0.000304004,0.008849059],"genre_scores_gemma":[0.021086302,0.0010219319,0.9674999,0.005102222,0.0023633447,0.00012410044,0.000025993666,0.000147066,0.0026291558],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941121,0.00013206081,0.0007993758,0.0025989767,0.0012145926,0.0011429043],"domain_scores_gemma":[0.99696463,0.0008999453,0.00023870796,0.0015022904,0.00019148296,0.00020295258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001305365,0.00072084006,0.0007709895,0.002425911,0.00013802295,0.00078862393,0.004499185,0.0004698609,0.00005689534],"category_scores_gemma":[0.0002066415,0.0006753275,0.00017757756,0.0034181785,0.0009096741,0.0017540614,0.0019667742,0.0018746144,0.00043812173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012726292,0.00007304767,0.000054671294,0.0002856121,0.000007160904,0.0008669723,0.00097254774,0.0584739,0.00035429402,0.024841938,0.001129365,0.91292775],"study_design_scores_gemma":[0.00029757092,0.000211636,0.0000569551,0.00095439475,0.000007271372,0.00014567345,2.5583347e-7,0.46393114,0.00076761405,0.5131413,0.019683206,0.00080298743],"about_ca_topic_score_codex":0.000027823022,"about_ca_topic_score_gemma":0.0003442095,"teacher_disagreement_score":0.91212475,"about_ca_system_score_codex":0.0013048421,"about_ca_system_score_gemma":0.0022347325,"threshold_uncertainty_score":0.9995698},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081639877,0.0012597106,0.98870385,0.002156442,0.003423441,0.00038259552,0.000004388298,0.00037327432,0.0028798794],"genre_scores_gemma":[0.47019964,0.000112812,0.52409077,0.0027139117,0.001641284,0.000020123185,0.000018692075,0.00013255043,0.0010701779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99524367,0.000053062064,0.0007209365,0.0020803963,0.0010336338,0.0008682809],"domain_scores_gemma":[0.9974686,0.00064354116,0.00021489094,0.0013392457,0.00015286237,0.00018085714],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010938242,0.0006730137,0.0006067761,0.001734225,0.00020884874,0.0010508943,0.0029204683,0.00040329038,0.000009800729],"category_scores_gemma":[0.00010119631,0.0006041693,0.00016447573,0.0015080161,0.00038047272,0.00047236955,0.0015235143,0.0017987668,0.00013527469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052927326,0.00004271566,0.00004545586,0.00009392887,0.000013772433,0.0005159082,0.0016513934,0.16633217,0.00010343874,0.111384995,0.000024364597,0.7197866],"study_design_scores_gemma":[0.00015169264,0.00011630545,0.00015602222,0.0006299162,0.000005557024,0.00009505358,1.2670304e-7,0.7447306,0.00018915822,0.2519386,0.0014631863,0.000523751],"about_ca_topic_score_codex":0.000057371723,"about_ca_topic_score_gemma":0.00026533412,"teacher_disagreement_score":0.71926284,"about_ca_system_score_codex":0.00031979653,"about_ca_system_score_gemma":0.0005142921,"threshold_uncertainty_score":0.9999861},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031738487,0.0067972406,0.9749363,0.0014814287,0.0071232547,0.00047101354,0.0000059640192,0.000304004,0.008849059],"genre_scores_gemma":[0.021086302,0.0010219319,0.9674999,0.005102222,0.0023633447,0.00012410044,0.000025993666,0.000147066,0.0026291558],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941121,0.00013206081,0.0007993758,0.0025989767,0.0012145926,0.0011429043],"domain_scores_gemma":[0.99696463,0.0008999453,0.00023870796,0.0015022904,0.00019148296,0.00020295258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001305365,0.00072084006,0.0007709895,0.002425911,0.00013802295,0.00078862393,0.004499185,0.0004698609,0.00005689534],"category_scores_gemma":[0.0002066415,0.0006753275,0.00017757756,0.0034181785,0.0009096741,0.0017540614,0.0019667742,0.0018746144,0.00043812173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012726292,0.00007304767,0.000054671294,0.0002856121,0.000007160904,0.0008669723,0.00097254774,0.0584739,0.00035429402,0.024841938,0.001129365,0.91292775],"study_design_scores_gemma":[0.00029757092,0.000211636,0.0000569551,0.00095439475,0.000007271372,0.00014567345,2.5583347e-7,0.46393114,0.00076761405,0.5131413,0.019683206,0.00080298743],"about_ca_topic_score_codex":0.000027823022,"about_ca_topic_score_gemma":0.0003442095,"teacher_disagreement_score":0.91212475,"about_ca_system_score_codex":0.0013048421,"about_ca_system_score_gemma":0.0022347325,"threshold_uncertainty_score":0.9995698},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031738487,0.0067972406,0.9749363,0.0014814287,0.0071232547,0.00047101354,0.0000059640192,0.000304004,0.008849059],"genre_scores_gemma":[0.021086302,0.0010219319,0.9674999,0.005102222,0.0023633447,0.00012410044,0.000025993666,0.000147066,0.0026291558],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941121,0.00013206081,0.0007993758,0.0025989767,0.0012145926,0.0011429043],"domain_scores_gemma":[0.99696463,0.0008999453,0.00023870796,0.0015022904,0.00019148296,0.00020295258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001305365,0.00072084006,0.0007709895,0.002425911,0.00013802295,0.00078862393,0.004499185,0.0004698609,0.00005689534],"category_scores_gemma":[0.0002066415,0.0006753275,0.00017757756,0.0034181785,0.0009096741,0.0017540614,0.0019667742,0.0018746144,0.00043812173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012726292,0.00007304767,0.000054671294,0.0002856121,0.000007160904,0.0008669723,0.00097254774,0.0584739,0.00035429402,0.024841938,0.001129365,0.91292775],"study_design_scores_gemma":[0.00029757092,0.000211636,0.0000569551,0.00095439475,0.000007271372,0.00014567345,2.5583347e-7,0.46393114,0.00076761405,0.5131413,0.019683206,0.00080298743],"about_ca_topic_score_codex":0.000027823022,"about_ca_topic_score_gemma":0.0003442095,"teacher_disagreement_score":0.91212475,"about_ca_system_score_codex":0.0013048421,"about_ca_system_score_gemma":0.0022347325,"threshold_uncertainty_score":0.9995698},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031738487,0.0067972406,0.9749363,0.0014814287,0.0071232547,0.00047101354,0.0000059640192,0.000304004,0.008849059],"genre_scores_gemma":[0.021086302,0.0010219319,0.9674999,0.005102222,0.0023633447,0.00012410044,0.000025993666,0.000147066,0.0026291558],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941121,0.00013206081,0.0007993758,0.0025989767,0.0012145926,0.0011429043],"domain_scores_gemma":[0.99696463,0.0008999453,0.00023870796,0.0015022904,0.00019148296,0.00020295258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001305365,0.00072084006,0.0007709895,0.002425911,0.00013802295,0.00078862393,0.004499185,0.0004698609,0.00005689534],"category_scores_gemma":[0.0002066415,0.0006753275,0.00017757756,0.0034181785,0.0009096741,0.0017540614,0.0019667742,0.0018746144,0.00043812173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012726292,0.00007304767,0.000054671294,0.0002856121,0.000007160904,0.0008669723,0.00097254774,0.0584739,0.00035429402,0.024841938,0.001129365,0.91292775],"study_design_scores_gemma":[0.00029757092,0.000211636,0.0000569551,0.00095439475,0.000007271372,0.00014567345,2.5583347e-7,0.46393114,0.00076761405,0.5131413,0.019683206,0.00080298743],"about_ca_topic_score_codex":0.000027823022,"about_ca_topic_score_gemma":0.0003442095,"teacher_disagreement_score":0.91212475,"about_ca_system_score_codex":0.0013048421,"about_ca_system_score_gemma":0.0022347325,"threshold_uncertainty_score":0.9995698},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031738487,0.0067972406,0.9749363,0.0014814287,0.0071232547,0.00047101354,0.0000059640192,0.000304004,0.008849059],"genre_scores_gemma":[0.021086302,0.0010219319,0.9674999,0.005102222,0.0023633447,0.00012410044,0.000025993666,0.000147066,0.0026291558],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941121,0.00013206081,0.0007993758,0.0025989767,0.0012145926,0.0011429043],"domain_scores_gemma":[0.99696463,0.0008999453,0.00023870796,0.0015022904,0.00019148296,0.00020295258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001305365,0.00072084006,0.0007709895,0.002425911,0.00013802295,0.00078862393,0.004499185,0.0004698609,0.00005689534],"category_scores_gemma":[0.0002066415,0.0006753275,0.00017757756,0.0034181785,0.0009096741,0.0017540614,0.0019667742,0.0018746144,0.00043812173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012726292,0.00007304767,0.000054671294,0.0002856121,0.000007160904,0.0008669723,0.00097254774,0.0584739,0.00035429402,0.024841938,0.001129365,0.91292775],"study_design_scores_gemma":[0.00029757092,0.000211636,0.0000569551,0.00095439475,0.000007271372,0.00014567345,2.5583347e-7,0.46393114,0.00076761405,0.5131413,0.019683206,0.00080298743],"about_ca_topic_score_codex":0.000027823022,"about_ca_topic_score_gemma":0.0003442095,"teacher_disagreement_score":0.91212475,"about_ca_system_score_codex":0.0013048421,"about_ca_system_score_gemma":0.0022347325,"threshold_uncertainty_score":0.9995698},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008766644,0.00008619503,0.995157,0.0017473719,0.001105871,0.00050219655,0.00005403414,0.0002291727,0.0011094142],"genre_scores_gemma":[0.081993036,0.000008612966,0.9131442,0.0034462763,0.0005653678,0.00011730849,0.00010260096,0.00006134648,0.0005612531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964868,0.00001918545,0.00043255996,0.0018148434,0.00075930986,0.00048732126],"domain_scores_gemma":[0.99731344,0.0007150544,0.00020156814,0.0015021358,0.00014287866,0.00012490555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007693031,0.0004468104,0.00043733942,0.0015407011,0.00020377226,0.0007584164,0.0024573745,0.00025749518,0.000004730261],"category_scores_gemma":[0.00010108491,0.00039015544,0.00025144266,0.0009774701,0.00028486195,0.00038482973,0.00053795066,0.00061534456,0.000014177334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004152408,0.00012586897,0.000059948,0.00020392238,0.000056745,0.00019915465,0.00058394414,0.41771203,0.00489507,0.050241396,0.0006522304,0.52522814],"study_design_scores_gemma":[0.00016896434,0.00021799792,0.000019394824,0.00045818294,0.00001809671,0.000033381395,1.1870316e-7,0.93993413,0.0029335378,0.054904062,0.00086727337,0.0004448572],"about_ca_topic_score_codex":0.000047535566,"about_ca_topic_score_gemma":0.0000500262,"teacher_disagreement_score":0.5247833,"about_ca_system_score_codex":0.00013422573,"about_ca_system_score_gemma":0.00030610152,"threshold_uncertainty_score":0.99985504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011784121,0.0012692052,0.9821291,0.0025934635,0.006241719,0.00036362273,0.000003150518,0.00043537916,0.0069525633],"genre_scores_gemma":[0.0072333124,0.00003366193,0.98820406,0.0012635892,0.0015619443,0.0000036624717,0.0000020531113,0.000053012383,0.0016446933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948834,0.000043223892,0.0006317755,0.0024548534,0.0010960884,0.0008906603],"domain_scores_gemma":[0.9971373,0.0005547445,0.00022903306,0.0015983874,0.00025736872,0.0002231737],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014759355,0.0006306032,0.0006771834,0.0007966531,0.000246345,0.0010560303,0.003720142,0.00027718602,0.000013299623],"category_scores_gemma":[0.00016499682,0.0005268249,0.0001631733,0.0013973825,0.00063713634,0.00044526017,0.002728028,0.00134017,0.00022569897],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011763394,0.000016070942,0.000003913774,0.00007044297,0.000009735076,0.00017220638,0.0002810955,0.00255295,0.00013135344,0.065713875,0.000025942385,0.9310212],"study_design_scores_gemma":[0.00010045686,0.00013462007,0.000019356246,0.0004966778,0.0000080997725,0.0001009976,6.86741e-8,0.55852485,0.0011372943,0.42986804,0.008945609,0.00066392677],"about_ca_topic_score_codex":0.00001394894,"about_ca_topic_score_gemma":0.000004090466,"teacher_disagreement_score":0.93035734,"about_ca_system_score_codex":0.00024782718,"about_ca_system_score_gemma":0.000515247,"threshold_uncertainty_score":0.999981},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015606082,0.00023081672,0.9914593,0.0032655639,0.001813455,0.0009677554,0.000033288787,0.00018928265,0.00047991148],"genre_scores_gemma":[0.48027423,0.000018902285,0.515164,0.0025070717,0.00078065787,0.000035649195,0.00001287592,0.00007788289,0.0011287014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954376,0.00007162092,0.0008222886,0.0017347515,0.0011978254,0.0007358762],"domain_scores_gemma":[0.99612445,0.0012521914,0.00034457725,0.0016414515,0.00037625938,0.00026105673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007850206,0.0006612146,0.0007476428,0.0005884636,0.0002935619,0.0004996752,0.002975765,0.00027985207,0.000013314536],"category_scores_gemma":[0.00013423323,0.0004365083,0.00020553384,0.0013123873,0.0005652558,0.00040323523,0.002375801,0.00088178343,0.00005838256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000709186,0.0001255462,0.000033388693,0.000092532435,0.00015387087,0.00030340796,0.0034756723,0.26083925,0.0015727738,0.036812916,0.00028527112,0.69623446],"study_design_scores_gemma":[0.00052145944,0.000230689,0.0006931919,0.000780297,0.000027009744,0.000096622476,4.4199862e-7,0.9374263,0.0015723567,0.055646226,0.0024115758,0.0005937728],"about_ca_topic_score_codex":0.00039757925,"about_ca_topic_score_gemma":0.00028600034,"teacher_disagreement_score":0.6956407,"about_ca_system_score_codex":0.00017524003,"about_ca_system_score_gemma":0.00052741845,"threshold_uncertainty_score":0.99980867},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007939751,0.00069453655,0.9931357,0.0018911944,0.00183544,0.0003614821,0.000006081802,0.00009386565,0.0011877373],"genre_scores_gemma":[0.93490356,0.000032451077,0.06299167,0.0012364144,0.00046597706,0.000011471097,0.0000071968807,0.000030171354,0.0003210955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716663,0.000028760813,0.00061497977,0.00090722914,0.00085337413,0.00042904203],"domain_scores_gemma":[0.9980214,0.0006405728,0.00033509807,0.00075479003,0.0001784439,0.000069665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010885765,0.00033733575,0.00035495544,0.0009249803,0.00016667988,0.0005215842,0.0022837592,0.00012581417,0.000027245049],"category_scores_gemma":[0.00006400024,0.00024031573,0.00014436606,0.0013213119,0.00039203162,0.0004209586,0.0012429839,0.0005437159,0.000055577875],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003457123,0.000016540469,0.000045440207,0.00007378345,0.000023904111,0.000021165497,0.0018981885,0.0075731785,0.00010139478,0.08730683,0.000075914184,0.9028602],"study_design_scores_gemma":[0.00018746834,0.00013634183,0.00024606384,0.00037191564,0.000017285882,0.000047471734,0.0000020692717,0.5294374,0.002183571,0.4651327,0.0018350169,0.00040263633],"about_ca_topic_score_codex":0.00012587973,"about_ca_topic_score_gemma":0.000091751135,"teacher_disagreement_score":0.93410957,"about_ca_system_score_codex":0.00021324915,"about_ca_system_score_gemma":0.00042631524,"threshold_uncertainty_score":0.9799791},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025423446,0.0014599283,0.98390406,0.0038666062,0.0013003359,0.0011043575,0.00055634073,0.00013588351,0.0076470776],"genre_scores_gemma":[0.051440146,0.001328216,0.66271377,0.021948721,0.0042192363,0.0008926278,0.0027279793,0.000825516,0.25390378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996582,0.000056505294,0.00036597974,0.0016020243,0.0006889307,0.00070458883],"domain_scores_gemma":[0.99712735,0.0010044489,0.00011096862,0.0015034379,0.000083827836,0.00016994624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011352368,0.00040006844,0.0003916598,0.0004782299,0.00027861242,0.00015698602,0.0015592936,0.00031661,0.00042192847],"category_scores_gemma":[0.00016317795,0.00034947338,0.000085131964,0.00021146935,0.00049621396,0.00015400462,0.00085712416,0.0013590548,0.00023186184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016496447,0.00011199921,0.00041317253,0.0004779381,0.000026572026,0.0000547584,0.0006647317,0.21565428,0.000007684339,0.006545029,0.0010211965,0.7748577],"study_design_scores_gemma":[0.00025551717,0.00032885457,0.000013518934,0.00028411925,0.0000113290425,0.000007640748,2.4061958e-7,0.9317541,0.000019766294,0.019916864,0.047099132,0.00030893224],"about_ca_topic_score_codex":0.00005290017,"about_ca_topic_score_gemma":0.00017877496,"teacher_disagreement_score":0.7745487,"about_ca_system_score_codex":0.00022217302,"about_ca_system_score_gemma":0.00029313765,"threshold_uncertainty_score":0.99989575},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010096908,0.004897304,0.97988594,0.00020172,0.0019307666,0.0006551575,0.00004822734,0.000010622299,0.0022733337],"genre_scores_gemma":[0.9687848,0.0001752657,0.0294583,0.00040181633,0.0007362223,0.000042467433,0.000021591373,0.000046723188,0.00033282884],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982972,0.00001219658,0.0002054601,0.0009513034,0.00019968784,0.0003341301],"domain_scores_gemma":[0.99921256,0.00011909603,0.000078105666,0.00042223703,0.00010989428,0.00005813175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044487478,0.0003139214,0.0002698548,0.00011517499,0.00013665183,0.00014414547,0.00047461604,0.00020742441,0.000002394631],"category_scores_gemma":[0.000034765268,0.00027982972,0.000123985,0.00007175137,0.00035288272,0.0000017596905,0.00049133535,0.00015128092,0.0000044849776],"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.00005890552,0.00004089509,0.00031289845,0.0006431706,0.00019645393,0.00004183312,0.000368051,0.0391156,0.6184991,0.004695736,0.00007233663,0.33595505],"study_design_scores_gemma":[0.0011230691,0.0016763548,0.00082536315,0.0018549504,0.00016898621,0.00007407281,0.0000036475888,0.027873598,0.52199686,0.388339,0.053392347,0.0026717666],"about_ca_topic_score_codex":0.0000062215317,"about_ca_topic_score_gemma":0.000034782777,"teacher_disagreement_score":0.9586879,"about_ca_system_score_codex":0.000092212445,"about_ca_system_score_gemma":0.00022519454,"threshold_uncertainty_score":0.99996537},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004460272,0.001162546,0.9944529,0.00056238886,0.0012594371,0.0009500711,0.0000146759785,0.0009033437,0.00069016544],"genre_scores_gemma":[0.008145676,0.00014017911,0.987501,0.0017585097,0.0005011231,0.000049289472,0.000016408207,0.000070891554,0.0018168688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645275,0.000037785514,0.00047639752,0.001791243,0.0005915878,0.0006502088],"domain_scores_gemma":[0.9974918,0.000815843,0.00022711234,0.001010475,0.00027628202,0.00017850279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008772044,0.0006037492,0.00057506637,0.000726731,0.00039230203,0.0009996651,0.0020372705,0.00040758797,0.000005133906],"category_scores_gemma":[0.00015486676,0.00052576803,0.00013556388,0.00040863882,0.00048392176,0.00027581645,0.00070619636,0.0007084251,0.000014953102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019610596,0.000026787431,0.000010817048,0.00010613655,0.000025197427,0.0000638912,0.0004138009,0.7007673,0.000013891816,0.023054663,0.0022545683,0.27324337],"study_design_scores_gemma":[0.00020139891,0.00043490282,0.000014758248,0.0006419261,0.000010654777,0.000039246395,8.428689e-8,0.8928804,0.0006509699,0.10184765,0.0026886112,0.00058941916],"about_ca_topic_score_codex":0.0000062920585,"about_ca_topic_score_gemma":0.0000044497897,"teacher_disagreement_score":0.27265397,"about_ca_system_score_codex":0.00017438215,"about_ca_system_score_gemma":0.00029058405,"threshold_uncertainty_score":0.9997194},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025486015,0.0027653065,0.94348806,0.00048625763,0.0022237825,0.0005204933,0.000019684874,0.00025007367,0.04769776],"genre_scores_gemma":[0.32570723,0.00042774336,0.56500214,0.0018569767,0.00249886,0.000031554366,0.000015816553,0.0004814412,0.10397821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978466,0.000018844627,0.0004165951,0.0008041921,0.0005506723,0.0003630814],"domain_scores_gemma":[0.99812293,0.0008477101,0.00016592744,0.00066248846,0.00007867176,0.00012226611],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001092345,0.00042609012,0.0005467767,0.00036119742,0.00019096989,0.00017821073,0.0006674369,0.00031461442,0.0001058906],"category_scores_gemma":[0.00014542945,0.00036667252,0.00008979587,0.0001639377,0.0009181952,0.00014299282,0.00041016718,0.00076303404,0.000123801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010790141,0.000051395305,0.000005801396,0.0015129253,0.000046161796,0.00019418124,0.008232339,0.00036533154,0.000108698514,0.8756008,0.00050988334,0.1133617],"study_design_scores_gemma":[0.00009817955,0.000057704096,0.0000018656172,0.000918679,0.000031564,0.00010213702,3.4184603e-7,0.012022214,0.0001968877,0.97459185,0.011579256,0.00039934696],"about_ca_topic_score_codex":0.0000028728837,"about_ca_topic_score_gemma":0.00003512877,"teacher_disagreement_score":0.3784859,"about_ca_system_score_codex":0.00012612541,"about_ca_system_score_gemma":0.00014862485,"threshold_uncertainty_score":0.9998785},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020319512,0.00070927176,0.97576267,0.000036910358,0.00054368837,0.00011129643,0.000019236368,0.00028109792,0.0022163505],"genre_scores_gemma":[0.9707791,0.000035456782,0.028959703,0.00005936969,0.000076955446,0.0000012821902,0.0000065363465,0.000028163997,0.000053420128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985254,0.0000044457606,0.0003668692,0.00045692973,0.00028562854,0.0003607256],"domain_scores_gemma":[0.9992401,0.000073180636,0.00006643344,0.00051558646,0.000058314374,0.000046358127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033204793,0.00028624086,0.00053780933,0.001154382,0.000077452016,0.000039948703,0.0006173999,0.00044689365,0.000046792913],"category_scores_gemma":[0.000009244616,0.0002772131,0.00019947441,0.00090813404,0.00045598936,0.0001610879,0.00032593682,0.0007854337,0.000009021294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013314311,0.0000039630286,0.00014477238,0.00006910187,0.00022392631,0.000039252645,0.00015790848,0.90819055,0.00031518773,0.0023727713,0.0000010552504,0.08848015],"study_design_scores_gemma":[0.0000424236,0.000017832579,0.00051138503,0.00009937556,0.00024583752,0.000013523953,1.1222424e-7,0.9805598,0.0016965157,0.016339323,0.00019770613,0.00027612902],"about_ca_topic_score_codex":0.000011896271,"about_ca_topic_score_gemma":0.000069857466,"teacher_disagreement_score":0.9504596,"about_ca_system_score_codex":0.00021969294,"about_ca_system_score_gemma":0.0000860459,"threshold_uncertainty_score":0.999968},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010853106,0.0014203364,0.99633104,0.0001476197,0.0004272332,0.00028791607,0.000025223855,0.000098215714,0.0011538969],"genre_scores_gemma":[0.49191698,0.00016335462,0.5076214,0.000060408365,0.00006819616,0.000023211109,0.000033837685,0.000040504772,0.00007210754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990321,0.0000035509086,0.00030989223,0.0002740116,0.00018324934,0.00019723435],"domain_scores_gemma":[0.99906826,0.00020358199,0.000047957292,0.00054560235,0.00008730124,0.000047281697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025486387,0.00019727096,0.0002193341,0.00036322864,0.00005123279,0.000046034504,0.00060126866,0.0001500034,0.0000033759984],"category_scores_gemma":[0.000008923505,0.00017773492,0.000104044215,0.00016763707,0.00013842352,0.00018516075,0.000053638916,0.00024146284,0.0000019994668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054117786,0.000005700082,2.1613157e-7,0.00016037426,0.000004963266,3.6846248e-7,0.00012390043,0.7840741,0.00038728002,0.002433524,0.00000806718,0.21279606],"study_design_scores_gemma":[0.00010529068,0.000043711578,0.0000021242358,0.00038601577,0.000013278968,0.0000011199711,6.806027e-8,0.93196917,0.0059467424,0.059271365,0.0020876862,0.00017344546],"about_ca_topic_score_codex":0.0000032275182,"about_ca_topic_score_gemma":0.0000056694325,"teacher_disagreement_score":0.49180844,"about_ca_system_score_codex":0.00006514686,"about_ca_system_score_gemma":0.00008524066,"threshold_uncertainty_score":0.724782},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13510032,0.8336435,0.017047387,0.003908488,0.0046518603,0.0020219467,0.000060708964,0.00009754558,0.003468248],"genre_scores_gemma":[0.82433486,0.16512221,0.008256604,0.00068535295,0.00050556194,0.000026717053,0.0000066994044,0.00006685578,0.0009951212],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99782115,0.000020224763,0.0005608101,0.0007108404,0.00058167096,0.00030532648],"domain_scores_gemma":[0.99898416,0.00019776968,0.00028577453,0.0003610407,0.00011185493,0.00005937296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054558815,0.0003403518,0.0006858195,0.00055831455,0.000048880698,0.000022334127,0.0003603475,0.00024295639,0.00019002474],"category_scores_gemma":[0.000029073348,0.00023574955,0.0001134608,0.0002602494,0.0006723515,0.00010140485,0.00022995903,0.000398991,0.0000014033152],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020270126,0.000085037966,0.00025693703,0.0012291757,0.00010360314,0.00007251606,0.008763637,0.00029997888,0.094943516,0.00022912207,0.00002336327,0.8919661],"study_design_scores_gemma":[0.009868981,0.0068785497,0.011047502,0.08709774,0.00023204043,0.00022125104,0.00012123079,0.010694223,0.7977402,0.035303187,0.03789349,0.0029015702],"about_ca_topic_score_codex":0.00028110054,"about_ca_topic_score_gemma":0.0002563851,"teacher_disagreement_score":0.88906455,"about_ca_system_score_codex":0.00017138716,"about_ca_system_score_gemma":0.0003715682,"threshold_uncertainty_score":0.9613588},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23088051,0.016327811,0.7236365,0.014984208,0.0015821856,0.009077827,0.00055011036,0.0004176835,0.0025431537],"genre_scores_gemma":[0.9883826,0.00033561882,0.010356227,0.00060997426,0.00010316959,0.00004448835,0.00003498562,0.000021170372,0.000111769186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984443,0.0000061776987,0.00024533033,0.000792009,0.00027725223,0.00023490065],"domain_scores_gemma":[0.9991836,0.00025076096,0.00010596987,0.00022864231,0.00010706648,0.0001239654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104511484,0.00027750764,0.00040382284,0.00015595103,0.00007509555,0.000048164035,0.00012569778,0.00014593404,0.000004617171],"category_scores_gemma":[0.000110455876,0.00016480277,0.00008537019,0.0001395857,0.00051965774,0.000044157994,0.00015455107,0.00016809776,0.0000012881787],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073379383,0.0005935446,0.026967192,0.001404381,0.000053366723,0.00043984642,0.000098707154,0.00026872614,0.00004279748,0.0019812626,0.0000038171247,0.9674126],"study_design_scores_gemma":[0.003328738,0.010862472,0.022165343,0.002680904,0.00068582944,0.000071361756,5.696145e-7,0.49400872,0.00048921123,0.46143353,0.0034037267,0.000869594],"about_ca_topic_score_codex":0.000003519201,"about_ca_topic_score_gemma":0.000022859533,"teacher_disagreement_score":0.96654296,"about_ca_system_score_codex":0.00008431173,"about_ca_system_score_gemma":0.00020135948,"threshold_uncertainty_score":0.6720462},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000096507356,0.00042656882,0.99511206,0.00129492,0.0006542628,0.0004171755,0.000012227749,0.0007493503,0.0012369208],"genre_scores_gemma":[0.23353218,0.00012988626,0.76437205,0.0010237815,0.00025390368,0.00006153665,0.0000041929693,0.000055182078,0.00056727853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596125,0.000029345621,0.00052087713,0.0021803407,0.0008013159,0.0005069002],"domain_scores_gemma":[0.9970526,0.00052902853,0.00020439755,0.0017488088,0.00023473737,0.00023038914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071110204,0.00052480976,0.0006175971,0.0026168597,0.00020413817,0.00073984946,0.0020691096,0.0002844847,0.000010431757],"category_scores_gemma":[0.00017448937,0.0005114295,0.00018093763,0.0024356563,0.00037908088,0.0005481747,0.0013599902,0.00061599736,0.000087050656],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057450447,0.000012548542,0.000043248656,0.000041434283,0.0000625265,0.00006245602,0.00043088087,0.008134071,0.0002901495,0.022156185,0.000049433358,0.9687113],"study_design_scores_gemma":[0.00020118791,0.00054858485,0.0047949613,0.0010537042,0.00039768012,0.00024664975,5.096019e-7,0.57806057,0.036808092,0.34379533,0.030712787,0.0033799307],"about_ca_topic_score_codex":0.000036559108,"about_ca_topic_score_gemma":0.00022461826,"teacher_disagreement_score":0.9653314,"about_ca_system_score_codex":0.0003636407,"about_ca_system_score_gemma":0.00016299212,"threshold_uncertainty_score":0.99973375},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020259731,0.0014338995,0.9871644,0.00052862026,0.002611455,0.0005358031,0.00000640716,0.00042119596,0.0070956494],"genre_scores_gemma":[0.17530687,0.00008025215,0.81911933,0.0014369552,0.0008806719,0.00001622202,0.000009462206,0.00012135911,0.0030288883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941671,0.000053881948,0.000815768,0.0024103967,0.0015773467,0.0009755469],"domain_scores_gemma":[0.9965697,0.00079531764,0.00027926543,0.0017432901,0.00034655843,0.00026587103],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017898957,0.00079928845,0.000745281,0.0011247039,0.00038148055,0.0018756305,0.0037097933,0.00044930106,0.000033129632],"category_scores_gemma":[0.00013848158,0.0006919837,0.0002499664,0.0008444442,0.0006733544,0.0011960908,0.0020768626,0.0014965275,0.0001229942],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023466731,0.00007415202,0.0000010626851,0.00027174503,0.000025923622,0.0009747761,0.0018038028,0.048424717,0.0042666825,0.102879636,0.000025556585,0.8412285],"study_design_scores_gemma":[0.00015734856,0.00007517852,0.000016885208,0.00057442853,0.000012821443,0.00007699501,9.135902e-8,0.5033199,0.00043097365,0.4946449,0.00022160592,0.0004688574],"about_ca_topic_score_codex":0.00004054888,"about_ca_topic_score_gemma":0.000040653635,"teacher_disagreement_score":0.84075963,"about_ca_system_score_codex":0.0005746061,"about_ca_system_score_gemma":0.00077064446,"threshold_uncertainty_score":0.99955314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018242263,0.00042998776,0.9922567,0.00061641843,0.0043625673,0.0008449947,0.000039537623,0.00036096637,0.0009064114],"genre_scores_gemma":[0.6294963,0.0000678611,0.36406422,0.004912417,0.000913885,0.000110776484,0.00020073896,0.00007085114,0.00016296694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964742,0.000018911913,0.0010052584,0.0007763144,0.00085856207,0.0008667197],"domain_scores_gemma":[0.9973661,0.00088086183,0.00042666652,0.00078885304,0.00037297254,0.00016458456],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012467767,0.00056369684,0.00047288722,0.0009883838,0.0003665332,0.0024524166,0.0024084966,0.00038927214,0.000008764109],"category_scores_gemma":[0.00023623403,0.0005223014,0.00020366187,0.0007337032,0.0004269344,0.004155609,0.0007952728,0.0008484066,0.000065243796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046763466,0.000003185619,0.0000024615676,0.00004441462,0.000006024374,0.0000012587399,0.0029088731,0.35343933,0.000008773327,0.0067568887,0.00009221995,0.63673186],"study_design_scores_gemma":[0.000080758626,0.00017205866,0.0000043085565,0.00026659408,0.000009089189,0.000030310528,0.000003439773,0.9486049,0.00038522814,0.040017903,0.009886372,0.0005390659],"about_ca_topic_score_codex":0.000021766227,"about_ca_topic_score_gemma":0.000018564706,"teacher_disagreement_score":0.6361928,"about_ca_system_score_codex":0.0003393166,"about_ca_system_score_gemma":0.0003082488,"threshold_uncertainty_score":0.99972284},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010443445,0.0008132611,0.987784,0.00020416953,0.0008051383,0.00024719693,0.00002914466,0.000060644496,0.009951982],"genre_scores_gemma":[0.025151966,0.000027351216,0.97167945,0.0002280301,0.00048360266,0.000009245616,0.000008066894,0.000059425896,0.002352882],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736965,0.00007442287,0.0006361919,0.00089214643,0.0006088772,0.0004186945],"domain_scores_gemma":[0.99620813,0.0021636365,0.00029784153,0.0009966254,0.00019706995,0.00013672459],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024255356,0.0004232462,0.0011063592,0.0032918814,0.00006423672,0.00009159521,0.0008486384,0.000270797,0.00003641276],"category_scores_gemma":[0.0006807223,0.00033616307,0.0004675714,0.0019045691,0.00043473387,0.000052095376,0.00057120796,0.00055853056,2.94596e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000141381115,0.00004671755,0.000010497994,0.00039230374,0.0007281227,0.000042860986,0.002651545,0.034830328,0.00022654954,0.40902206,0.000041911142,0.55199295],"study_design_scores_gemma":[0.00009853454,0.00009304645,0.0000065566787,0.00035247148,0.0007641613,0.000012637591,8.275475e-7,0.4714804,0.0002727714,0.52608067,0.00044784302,0.00039011164],"about_ca_topic_score_codex":0.000035270416,"about_ca_topic_score_gemma":0.00014362292,"teacher_disagreement_score":0.55160284,"about_ca_system_score_codex":0.00019048052,"about_ca_system_score_gemma":0.00030123338,"threshold_uncertainty_score":0.99990904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026839136,0.000056496116,0.99546534,0.0014709427,0.00015290815,0.0005284013,0.00012087721,0.00011437402,0.0018222637],"genre_scores_gemma":[0.13515317,0.0000070692504,0.8595126,0.0005629152,0.00020588688,0.00006925452,0.000026161939,0.00008195953,0.0043809665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829847,0.0000073552605,0.0004146113,0.0005968666,0.00043556502,0.00024715337],"domain_scores_gemma":[0.9984675,0.00053827587,0.00016062689,0.0005349579,0.00022102012,0.00007763165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030060022,0.0002708936,0.00040006358,0.00040362013,0.000098657634,0.000085085114,0.0005860316,0.00022354908,0.000030297753],"category_scores_gemma":[0.00005219802,0.00023261369,0.0001875167,0.0001971903,0.00048206252,0.000068325964,0.00013402096,0.00032539028,0.000022862985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004226628,0.00012744997,0.0000058746996,0.00048240882,0.00004297718,0.00001178305,0.00029955016,0.0866253,0.0039876695,0.89602935,0.00040265633,0.011942693],"study_design_scores_gemma":[0.000090667,0.000054130483,0.0000017620017,0.00017564207,0.00002602292,0.000008145086,7.693361e-8,0.3913463,0.0025155607,0.60531884,0.0002948712,0.00016797525],"about_ca_topic_score_codex":0.000001270401,"about_ca_topic_score_gemma":0.00001897474,"teacher_disagreement_score":0.304721,"about_ca_system_score_codex":0.000076319,"about_ca_system_score_gemma":0.00018124556,"threshold_uncertainty_score":0.9485711},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006194356,0.00059515657,0.9952848,0.0007323726,0.0013612856,0.00037751684,0.00000665487,0.00017182225,0.00085093454],"genre_scores_gemma":[0.9410745,0.000037946586,0.05746321,0.00044416613,0.0005945419,0.0000095946225,0.0000067071605,0.000030132494,0.0003391976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972452,0.000021439779,0.0004741327,0.0012385878,0.00057528354,0.00044535514],"domain_scores_gemma":[0.99748033,0.0009313856,0.0002403432,0.0009931613,0.00023320393,0.00012155897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035728124,0.0003920473,0.00044012038,0.0003579861,0.00015953931,0.00025115337,0.001844026,0.00024576942,0.000009444453],"category_scores_gemma":[0.00004714809,0.0003478619,0.00015123861,0.0007636479,0.00047434663,0.00032066653,0.0008597371,0.0008143492,0.000017110247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019474542,0.000011897596,0.0000049538485,0.000019072671,0.0000048860725,0.000037165966,0.00009810757,0.6834876,0.000052987405,0.022373201,0.000005709065,0.2939025],"study_design_scores_gemma":[0.00007437045,0.0001028818,0.000015072743,0.00013488048,0.000009032911,0.000042828295,5.2074633e-8,0.90946364,0.0002140577,0.089371726,0.00026151421,0.00030993775],"about_ca_topic_score_codex":0.000021005011,"about_ca_topic_score_gemma":0.000044860102,"teacher_disagreement_score":0.9404551,"about_ca_system_score_codex":0.000115934534,"about_ca_system_score_gemma":0.00013341982,"threshold_uncertainty_score":0.99989736},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032050684,0.0011564764,0.9934537,0.0019426545,0.0018593156,0.00067195104,0.000016227687,0.00019203208,0.00067558157],"genre_scores_gemma":[0.031723127,0.00006457095,0.9626279,0.0015833771,0.0005584205,0.000042516156,0.00003990958,0.00006061171,0.0032996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971328,0.000032639116,0.00041600323,0.0013837678,0.00059033115,0.00044449538],"domain_scores_gemma":[0.99851173,0.00024646273,0.00020176513,0.0005786239,0.0003156284,0.00014580843],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00060454593,0.0004301488,0.00035478076,0.0007463938,0.00030487476,0.0012325062,0.00094424793,0.00027887736,0.000009718815],"category_scores_gemma":[0.000097014854,0.000389674,0.00008186429,0.0006179709,0.00032815922,0.00054745347,0.00046999386,0.00051165966,0.000010999498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012882702,0.000026643876,0.000023121816,0.0001516763,0.00003068389,0.000027590133,0.004511235,0.2911292,0.0010557034,0.16036814,0.00015828392,0.54250485],"study_design_scores_gemma":[0.00034118333,0.000114718765,0.000038413524,0.00017580423,0.000013689836,0.000025141835,9.844917e-7,0.9034638,0.00023575377,0.07492191,0.020213287,0.0004553303],"about_ca_topic_score_codex":0.000007954821,"about_ca_topic_score_gemma":0.00015907886,"teacher_disagreement_score":0.6123346,"about_ca_system_score_codex":0.00017764152,"about_ca_system_score_gemma":0.00036776913,"threshold_uncertainty_score":0.9998555},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113454275,0.00032963275,0.5270367,0.032344934,0.024250463,0.050207578,0.00061193574,0.0015339181,0.25023055],"genre_scores_gemma":[0.9885622,0.000016946771,0.0029070564,0.0048514935,0.0010060618,0.000035177593,0.000018711817,0.000031934094,0.002570391],"study_design_codex":"qualitative","study_design_gemma":"randomized_trial","domain_scores_codex":[0.9955581,0.00012930464,0.0010964996,0.0004968532,0.0022106783,0.00050859974],"domain_scores_gemma":[0.9960125,0.002441745,0.00046911204,0.00031090697,0.000479429,0.0002863116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004191953,0.00038539094,0.0013913623,0.0012545375,0.00050423504,0.0006555308,0.0010559558,0.0002661004,0.0005092748],"category_scores_gemma":[0.0050267843,0.00027044988,0.00020791011,0.0009028181,0.00030088812,0.000503668,0.00030144444,0.00049540907,0.00021535538],"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.01695636,0.00007296096,9.3026347e-7,0.00007830644,0.00007682253,0.000013553288,0.74942297,0.0107502425,0.000016376984,0.009906221,0.00086083525,0.21184441],"study_design_scores_gemma":[0.6775193,0.0063967025,0.0007918597,0.014566094,0.0011027395,0.000025615798,0.008526728,0.1839205,0.0016522745,0.049657337,0.046134446,0.009706355],"about_ca_topic_score_codex":0.00007913449,"about_ca_topic_score_gemma":0.0010162906,"teacher_disagreement_score":0.87510794,"about_ca_system_score_codex":0.0003676468,"about_ca_system_score_gemma":0.000713292,"threshold_uncertainty_score":0.9999748},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031984964,0.000668506,0.9877899,0.00042088,0.002884575,0.00080077787,0.00001234383,0.00034462346,0.007046372],"genre_scores_gemma":[0.03559431,0.00014647281,0.9577482,0.0011396192,0.0011310139,0.00008735669,0.000066409644,0.00010845952,0.0039781635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666303,0.00007476774,0.0004958296,0.0015148479,0.00073528406,0.0005162587],"domain_scores_gemma":[0.9977314,0.0007885531,0.00032184363,0.0008083341,0.00020886748,0.00014099033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013824382,0.00048065497,0.0004521593,0.00092281325,0.00036263085,0.0009655998,0.0015034822,0.00030222017,0.000018544413],"category_scores_gemma":[0.00020056624,0.00043342877,0.00018777915,0.00077307766,0.0002581064,0.00051739736,0.00047613017,0.00047716068,0.000068557514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014072781,0.000015209961,0.000043891134,0.00011235116,0.000026496551,0.000024954423,0.0014816938,0.26978216,0.00015702014,0.11843081,0.00015189499,0.60975945],"study_design_scores_gemma":[0.00031363455,0.0002129118,0.00002308648,0.00022523203,0.000018518094,0.000013833358,1.541379e-7,0.8293546,0.0006774714,0.14277902,0.025890592,0.0004909647],"about_ca_topic_score_codex":0.000009647475,"about_ca_topic_score_gemma":0.00003341212,"teacher_disagreement_score":0.6092685,"about_ca_system_score_codex":0.00028203477,"about_ca_system_score_gemma":0.0002611188,"threshold_uncertainty_score":0.99981177},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030014222,0.0041144066,0.96456224,0.017331906,0.0048233382,0.0021211293,0.000060161365,0.0007836193,0.003201764],"genre_scores_gemma":[0.6600448,0.0012414779,0.1891473,0.110574886,0.010060487,0.0003272218,0.001502335,0.0010997914,0.026001697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963381,0.000028415147,0.00063872646,0.0015319345,0.0008569663,0.00060582155],"domain_scores_gemma":[0.9973693,0.0007347237,0.00016421519,0.0009867497,0.0004927506,0.00025226173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060501986,0.0006352071,0.00075017015,0.0013117032,0.00016479877,0.0002678198,0.0006098839,0.00044902044,0.00024839488],"category_scores_gemma":[0.00025376686,0.00056886184,0.00022678117,0.0010100275,0.00051819783,0.00016888132,0.00054452743,0.00096114876,0.0002381808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017631536,0.00080009917,0.0050831535,0.0054075485,0.0006223851,0.0025577918,0.01037114,0.054254215,0.01853932,0.003232986,0.03628445,0.8626706],"study_design_scores_gemma":[0.0035883856,0.001020009,0.002269289,0.012508705,0.0007974095,0.00045419674,8.7275555e-7,0.8752832,0.017537106,0.019701358,0.06449219,0.0023472898],"about_ca_topic_score_codex":0.000048683018,"about_ca_topic_score_gemma":0.00010496007,"teacher_disagreement_score":0.8603233,"about_ca_system_score_codex":0.001523998,"about_ca_system_score_gemma":0.0012860029,"threshold_uncertainty_score":0.9996763},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008914705,0.0005206698,0.99488896,0.00093130866,0.0017060214,0.00035497526,0.000025188514,0.0002492214,0.00043218854],"genre_scores_gemma":[0.747037,0.000027587632,0.24955902,0.002474657,0.00057915226,0.000018402363,0.00006546439,0.00007115497,0.00016756712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952581,0.000051014445,0.0006350204,0.002298946,0.0009650038,0.00079193956],"domain_scores_gemma":[0.9977276,0.00035573743,0.00017850373,0.0014793649,0.00009655287,0.0001622682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009159135,0.00059152156,0.0005241851,0.0021221533,0.00017099413,0.00077187817,0.0025759824,0.00030815095,0.000009761029],"category_scores_gemma":[0.000087862594,0.0005515085,0.00013647339,0.0013023063,0.00019327417,0.00089601724,0.00077631825,0.0012321809,0.000030426561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004756516,0.000021359583,0.000045960507,0.000033250362,0.0000045946813,0.00014453477,0.00014030312,0.8817037,0.00004772304,0.010180504,0.000017460232,0.10765586],"study_design_scores_gemma":[0.00015698702,0.000108736574,0.00001712424,0.000798828,0.000007646724,0.00002427933,8.218065e-8,0.9141233,0.00043776777,0.0835767,0.00023939155,0.0005091738],"about_ca_topic_score_codex":0.00015277909,"about_ca_topic_score_gemma":0.00037142966,"teacher_disagreement_score":0.74614555,"about_ca_system_score_codex":0.0005368884,"about_ca_system_score_gemma":0.00043257463,"threshold_uncertainty_score":0.99969363},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033791973,0.0052798153,0.41397327,0.0018921855,0.0068353303,0.00034362968,0.000015354259,0.00095383846,0.5673274],"genre_scores_gemma":[0.92374015,0.000009496913,0.0016221424,0.00088781794,0.0028617503,0.0000025331485,0.000013574735,0.0000666253,0.07079589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99817353,0.000029798406,0.00025774149,0.0006926261,0.00044515994,0.00040112573],"domain_scores_gemma":[0.99915797,0.00032418818,0.00010788702,0.00028920145,0.00005009907,0.00007066432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006408559,0.00032801402,0.0003155167,0.00043551903,0.00043928073,0.0009599301,0.0005345351,0.00014331292,0.00085203],"category_scores_gemma":[0.000052454536,0.00027373678,0.000113484704,0.000051156454,0.0007372555,0.0001626868,0.00029364805,0.0019570184,0.0003889865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006405643,0.00001494582,0.000030515397,0.00010524347,0.000036379424,0.00018981543,0.15473305,0.021161385,0.000033181954,0.5500469,0.00012089314,0.27352127],"study_design_scores_gemma":[0.00042206247,0.00043666558,0.00005326753,0.002693052,0.000081993494,0.00005156511,0.0001756701,0.050875947,0.00010657078,0.2911318,0.65203035,0.0019410359],"about_ca_topic_score_codex":0.00016256595,"about_ca_topic_score_gemma":0.00075439946,"teacher_disagreement_score":0.920361,"about_ca_system_score_codex":0.00010009504,"about_ca_system_score_gemma":0.00010654117,"threshold_uncertainty_score":0.9999715},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022365742,0.00021829693,0.9923088,0.0008112697,0.0041334396,0.00077095954,0.000017530168,0.00068789785,0.00082813675],"genre_scores_gemma":[0.69378036,0.000027373453,0.30131757,0.0008558027,0.0016818548,0.00017330142,0.000010066794,0.00015107177,0.0020025857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952366,0.000028199322,0.00046302367,0.00217282,0.0012622012,0.00083720405],"domain_scores_gemma":[0.99408334,0.0035332239,0.0001070989,0.0017484179,0.00031786636,0.000210062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018896535,0.0005596994,0.00047781816,0.0012033602,0.00026272878,0.00083357835,0.003011363,0.00039221434,0.000007423692],"category_scores_gemma":[0.0009759073,0.0005097648,0.00020358566,0.00082742865,0.00034051007,0.0004020938,0.0009868286,0.0013535359,0.00010766521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019395555,0.00004034597,0.000022564516,0.00023668604,0.000023592533,0.00007242894,0.00030382205,0.092358075,0.00070894597,0.030943012,0.00008318857,0.87518793],"study_design_scores_gemma":[0.00023748673,0.0005841941,0.000120783465,0.00041638603,0.000007476807,0.00004776536,5.26992e-8,0.8043294,0.013152712,0.17473222,0.0056710914,0.0007004591],"about_ca_topic_score_codex":0.000015536056,"about_ca_topic_score_gemma":0.00008470549,"teacher_disagreement_score":0.87448746,"about_ca_system_score_codex":0.00084084214,"about_ca_system_score_gemma":0.00040468812,"threshold_uncertainty_score":0.9997354},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015269773,0.0003325945,0.9959352,0.000050294588,0.0006494078,0.00032706888,0.000028829612,0.00012899362,0.0010206029],"genre_scores_gemma":[0.96494377,0.000005196311,0.03324096,0.00008830529,0.00058917404,0.0000052280534,0.000038042563,0.00004846508,0.0010408778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863905,0.000008812739,0.00023759229,0.00062698213,0.00018102859,0.0003065307],"domain_scores_gemma":[0.99936765,0.00020323675,0.00010776142,0.00019666349,0.000069750975,0.000054943623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002470786,0.00029578074,0.00027099196,0.00025867572,0.00021094659,0.00030524013,0.00023004475,0.00011955924,0.00006020565],"category_scores_gemma":[0.0000067172646,0.00026849436,0.0000987084,0.00014704658,0.00013945064,0.00009893294,0.0001225807,0.00049754034,0.000012024342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042045307,0.00008380201,0.0008483808,0.00042183316,0.000038703984,0.00001445204,0.00072751165,0.35007766,0.015716737,0.0024621917,0.000015486028,0.6295512],"study_design_scores_gemma":[0.0002902398,0.00016691948,0.000021621827,0.0002051304,0.000030018771,0.000003678664,2.4953673e-7,0.96588403,0.02084391,0.009879777,0.0023286606,0.00034578986],"about_ca_topic_score_codex":0.000032116175,"about_ca_topic_score_gemma":0.000019884164,"teacher_disagreement_score":0.96341676,"about_ca_system_score_codex":0.00007256412,"about_ca_system_score_gemma":0.00011437027,"threshold_uncertainty_score":0.99997675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049569393,0.0004302521,0.96263355,0.0036677457,0.0021525435,0.0010946818,0.00018571015,0.000085703075,0.029700216],"genre_scores_gemma":[0.10840646,0.00027845192,0.7690609,0.010717082,0.0020462256,0.00040261395,0.00027156158,0.00016689874,0.1086498],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949111,0.00005356815,0.0010935501,0.0015715971,0.0017954012,0.00057479896],"domain_scores_gemma":[0.9961008,0.0015404536,0.00024044268,0.0015555256,0.00040840518,0.00015441248],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0068505662,0.00039719758,0.0005942408,0.0010387759,0.000386803,0.0013804905,0.0026160225,0.00022126044,0.0003175428],"category_scores_gemma":[0.0004884089,0.00030523562,0.00030493934,0.0007596487,0.00060674525,0.0008075961,0.0007197311,0.00042727467,0.00028799276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040250754,0.000092651564,0.0000052916885,0.00044153773,0.00002086337,0.00002920025,0.003090765,0.038889308,0.000070485505,0.33148172,0.007802029,0.6180359],"study_design_scores_gemma":[0.00019912746,0.00008111127,0.000004183685,0.00006421796,0.00001550414,0.0000034041614,0.0000027331894,0.07103732,0.00047904297,0.6927362,0.235088,0.0002891298],"about_ca_topic_score_codex":0.000030146375,"about_ca_topic_score_gemma":0.0001984649,"teacher_disagreement_score":0.6177468,"about_ca_system_score_codex":0.0002638089,"about_ca_system_score_gemma":0.00037869692,"threshold_uncertainty_score":0.99994},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013322254,0.00057299115,0.9877276,0.001197611,0.00052242115,0.0006512257,0.000055175835,0.0005121984,0.008627561],"genre_scores_gemma":[0.2334426,0.00032170158,0.7577467,0.00034118403,0.0006183876,0.000030206109,0.0002048591,0.00014467062,0.0071497113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949034,0.000080105354,0.0005365265,0.0024890283,0.0014172792,0.0005736729],"domain_scores_gemma":[0.9958155,0.00064709596,0.0005005482,0.002457984,0.00043020822,0.00014862235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001031994,0.0006314541,0.00075974315,0.000974093,0.00018056027,0.00079224404,0.004006535,0.0005835215,0.0000457663],"category_scores_gemma":[0.00019313536,0.0005179007,0.00011790731,0.0010706239,0.00078152015,0.0011790543,0.0025572302,0.0018617846,0.00001529214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001842297,0.00017730489,0.0005297336,0.00088782195,0.00028714436,0.0013337535,0.0043516327,0.02940264,0.005838529,0.059869647,0.0033628454,0.89377475],"study_design_scores_gemma":[0.00080086617,0.00095574325,0.00035188047,0.0052708834,0.0001353037,0.00048429027,0.000003461704,0.89839584,0.019783063,0.069666654,0.0024530827,0.001698947],"about_ca_topic_score_codex":0.000073322444,"about_ca_topic_score_gemma":0.0001657491,"teacher_disagreement_score":0.8920758,"about_ca_system_score_codex":0.00018035961,"about_ca_system_score_gemma":0.00052796485,"threshold_uncertainty_score":0.99972725},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009505546,0.00012921788,0.98685104,0.0010085437,0.001477845,0.0008098533,0.000044494685,0.00007883182,0.000094642106],"genre_scores_gemma":[0.8612324,0.000007824867,0.13775405,0.0006196006,0.00029052413,0.000018903203,0.000032118696,0.000020632859,0.000023958763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979792,0.00002648606,0.00057092117,0.00072202313,0.0004694,0.00023192477],"domain_scores_gemma":[0.99842256,0.00062364165,0.0002526121,0.0005089893,0.00013370957,0.00005846938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055484526,0.00027717254,0.0002813156,0.00039611134,0.00015651678,0.0003838231,0.00084758236,0.0001483342,0.000006975177],"category_scores_gemma":[0.000020773092,0.00022694413,0.00010698803,0.0003845499,0.00012532179,0.0008395001,0.00043781826,0.00023696115,0.0000051466563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012808009,0.000006448744,0.00006817693,0.00010622969,0.000021126942,0.0000011793837,0.013846162,0.08946166,0.00062806276,0.066702954,0.0000135014625,0.82913166],"study_design_scores_gemma":[0.00019602514,0.000099736186,0.0011767918,0.00048583274,0.000016078757,0.0000047261506,0.000002582651,0.7768889,0.002159457,0.21855031,0.00020632311,0.000213227],"about_ca_topic_score_codex":0.000052530577,"about_ca_topic_score_gemma":0.00009365259,"teacher_disagreement_score":0.85172683,"about_ca_system_score_codex":0.00015628789,"about_ca_system_score_gemma":0.000110566674,"threshold_uncertainty_score":0.92545134},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022486143,0.00028562345,0.9883056,0.0051386124,0.0029314442,0.00087656366,0.000036789876,0.0016322458,0.0007706176],"genre_scores_gemma":[0.022567706,0.00003249038,0.9747451,0.0015273503,0.00043921,0.00006871171,0.00006189128,0.00010254633,0.00045497395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941992,0.000049671205,0.000629896,0.002898591,0.00119298,0.0010296211],"domain_scores_gemma":[0.99398696,0.0008829616,0.00031061287,0.004324684,0.00033862353,0.00015617508],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011299459,0.0007978558,0.00062311534,0.0015022417,0.00060891017,0.001575893,0.018697912,0.0006931463,0.000015174141],"category_scores_gemma":[0.0025506779,0.00074811844,0.00023391267,0.0011596102,0.0005110578,0.00041429838,0.021402424,0.0017916303,0.00009736706],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015367174,0.00005220072,0.000007737575,0.000076930985,0.000026059892,0.00010675334,0.000038740665,0.102366515,0.0001146747,0.0015370913,0.0013979274,0.89426],"study_design_scores_gemma":[0.00022245134,0.0006802366,0.0000025534498,0.0003716472,0.000010473239,0.00005573421,4.972106e-8,0.7584987,0.005132617,0.22668594,0.0077571427,0.000582434],"about_ca_topic_score_codex":0.000016227395,"about_ca_topic_score_gemma":0.00003280625,"teacher_disagreement_score":0.8936776,"about_ca_system_score_codex":0.000956982,"about_ca_system_score_gemma":0.00058953586,"threshold_uncertainty_score":0.999497},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004678341,0.0001936109,0.99069977,0.0018217984,0.0029204437,0.00028513538,0.0000036012166,0.00027692746,0.0037940098],"genre_scores_gemma":[0.16317648,0.000114337076,0.8282014,0.002514279,0.0013225857,0.0000265278,0.00006833475,0.00008618434,0.0044898586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974071,0.000018325423,0.0004261042,0.001055971,0.00076148217,0.00033105366],"domain_scores_gemma":[0.9987666,0.0001494547,0.00015799045,0.0006065778,0.00021030095,0.0001090923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039845877,0.00032986727,0.00025000746,0.00077241607,0.00019000916,0.0007084007,0.00097516505,0.00022962186,0.00015666444],"category_scores_gemma":[0.00003934053,0.00032081627,0.00009482918,0.00069314,0.00032917713,0.00065591757,0.0004299127,0.00042351414,0.00020213521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026075932,0.000009952151,0.00002904015,0.000029870658,0.000010842122,0.00003431507,0.00032739883,0.286584,0.000069507376,0.2908584,0.00005525851,0.42198882],"study_design_scores_gemma":[0.00010499716,0.000035108045,0.000024495743,0.00010280057,0.0000066690463,0.00004849524,5.0463377e-8,0.83414954,0.00022842542,0.16105722,0.0039217495,0.00032045797],"about_ca_topic_score_codex":0.000012025719,"about_ca_topic_score_gemma":0.00006678402,"teacher_disagreement_score":0.5475655,"about_ca_system_score_codex":0.0002532151,"about_ca_system_score_gemma":0.0005012742,"threshold_uncertainty_score":0.99992436},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044733653,0.000720092,0.9911602,0.0014092368,0.0023795087,0.0003770136,0.000041186915,0.0001495247,0.0037184902],"genre_scores_gemma":[0.14214747,0.00023763264,0.75690216,0.0020834825,0.007973533,0.000032567896,0.00005307604,0.00032526164,0.090244815],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915204,0.0000481252,0.0009050429,0.0023101943,0.0043898625,0.00082635117],"domain_scores_gemma":[0.9959714,0.0016346447,0.000249687,0.0011725151,0.0007138847,0.0002579036],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025966158,0.00052053906,0.0006441081,0.0027265328,0.0002901179,0.001201931,0.0030668299,0.00038171088,0.0005579578],"category_scores_gemma":[0.0009726637,0.00039212705,0.00021204705,0.0022969877,0.001077477,0.0005611827,0.0012823897,0.0017814395,0.0009020692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013326846,0.000025182291,0.000034018143,0.00001756269,0.000009911858,0.00014607857,0.00018612298,0.07798156,0.00011588924,0.001838201,0.00021607689,0.91941607],"study_design_scores_gemma":[0.00009405409,0.00012860254,0.000056912904,0.00014190354,0.000004880616,0.00009798406,4.4308933e-7,0.43834868,0.00038274212,0.54687095,0.013534934,0.00033788927],"about_ca_topic_score_codex":0.000019225225,"about_ca_topic_score_gemma":0.00043619107,"teacher_disagreement_score":0.9190782,"about_ca_system_score_codex":0.0006089478,"about_ca_system_score_gemma":0.00072144775,"threshold_uncertainty_score":0.99987584},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006034956,0.00028109268,0.9912436,0.00410697,0.0020001624,0.0009973117,0.00001598823,0.00010825349,0.0006431276],"genre_scores_gemma":[0.29234362,0.000010464198,0.70069164,0.005423661,0.00085359905,0.000028149148,0.0000035884539,0.00006968081,0.0005756035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960678,0.00014426035,0.0007334072,0.0014174598,0.0012388212,0.00039823365],"domain_scores_gemma":[0.9954983,0.0017319772,0.00034009287,0.0020340378,0.00028743304,0.00010818924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013397768,0.0004422032,0.00048569505,0.00044736697,0.00035048657,0.000890957,0.003255725,0.00016883535,0.00001258943],"category_scores_gemma":[0.00023554977,0.00028168692,0.00015266538,0.0013862336,0.000828362,0.00039634563,0.0032210848,0.00054337666,0.000015929128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061131004,0.000045648525,0.00031568468,0.00012345811,0.000043757555,0.000021568745,0.0044684885,0.7548324,0.0006417547,0.106285095,0.00007237959,0.13314365],"study_design_scores_gemma":[0.000099515164,0.00006209307,0.0005224397,0.0003075198,0.000015563668,0.000050101724,6.7132913e-7,0.8380084,0.0006734443,0.15971194,0.0002754076,0.00027287882],"about_ca_topic_score_codex":0.0001117742,"about_ca_topic_score_gemma":0.0002028433,"teacher_disagreement_score":0.29174012,"about_ca_system_score_codex":0.0002104482,"about_ca_system_score_gemma":0.00051897747,"threshold_uncertainty_score":0.9999635},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002909747,0.00064230023,0.99259466,0.0010758425,0.002695433,0.00030918073,0.000081792845,0.00010058552,0.002209256],"genre_scores_gemma":[0.1431465,0.00009575091,0.85253453,0.0014386617,0.0005913928,0.000009974789,0.000012006006,0.00007227131,0.002098921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639076,0.00003459701,0.0005563023,0.0012803642,0.0012384496,0.0004994983],"domain_scores_gemma":[0.9970958,0.0002618385,0.00029320616,0.002027812,0.00020093488,0.00012038522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006469399,0.00043477776,0.000481561,0.0004071723,0.00022241162,0.00039132748,0.005269292,0.00016643025,0.000029875204],"category_scores_gemma":[0.000037841703,0.00028753822,0.00019766526,0.0007090955,0.0015938568,0.00046145378,0.004992608,0.00080971676,0.000036837584],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012945435,0.000064551205,0.000056574972,0.00020658155,0.0000367982,0.000099330755,0.0015202609,0.00828831,0.00044662337,0.13098606,0.00031339237,0.85796857],"study_design_scores_gemma":[0.00012057055,0.000097507334,0.0003481011,0.00062296673,0.000009057397,0.000031756088,1.3329353e-7,0.54382443,0.002633459,0.44784147,0.004082453,0.00038807755],"about_ca_topic_score_codex":0.000074137046,"about_ca_topic_score_gemma":0.00008501911,"teacher_disagreement_score":0.8575805,"about_ca_system_score_codex":0.0001603,"about_ca_system_score_gemma":0.00051328907,"threshold_uncertainty_score":0.9999577},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000049324017,0.00014603903,0.9842208,0.0069440617,0.0016466198,0.0012730624,8.698652e-7,0.00040310362,0.005360494],"genre_scores_gemma":[0.02029405,0.000008970966,0.9358998,0.0028065445,0.0013817346,0.00005228753,0.000017071956,0.000097933276,0.03944161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99420637,0.000026941063,0.00067734974,0.0022834707,0.0015787234,0.0012271302],"domain_scores_gemma":[0.99678403,0.00076334475,0.0002954463,0.0014113628,0.00024463583,0.0005011819],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010141964,0.00080095767,0.00068261696,0.0012657135,0.00037700107,0.0029208185,0.004173579,0.0003467645,0.000011893709],"category_scores_gemma":[0.0005012696,0.0007334244,0.00027446725,0.0008642529,0.00031363463,0.00061339076,0.002939074,0.0018204284,0.00008190775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057133175,0.0000064173196,0.000012563089,0.000110680456,0.000020000567,0.000024650008,0.0008369508,0.8483432,0.00003791574,0.024511477,0.00026651908,0.1258239],"study_design_scores_gemma":[0.0002730063,0.0005006066,0.000007016437,0.00053309515,0.000018725405,0.00005324405,3.569446e-7,0.9327112,0.00014519466,0.029412782,0.035554472,0.00079030625],"about_ca_topic_score_codex":0.000010992964,"about_ca_topic_score_gemma":0.0000040489717,"teacher_disagreement_score":0.1250336,"about_ca_system_score_codex":0.0004975828,"about_ca_system_score_gemma":0.0006945428,"threshold_uncertainty_score":0.99951166},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005061303,0.0012235437,0.9870885,0.0019740835,0.00065098936,0.001281394,0.000017021677,0.000101514044,0.0026016636],"genre_scores_gemma":[0.9916272,0.00006430256,0.0052888296,0.00067460485,0.001077086,0.000064240085,0.000022381406,0.000037050413,0.0011442809],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975728,0.00006343816,0.00031411485,0.0009914176,0.0006075923,0.000450662],"domain_scores_gemma":[0.9982039,0.001121593,0.00010213543,0.00022012969,0.00022099093,0.00013124911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015018818,0.00032121787,0.00037383926,0.0005763918,0.0008084991,0.00040621415,0.00046088596,0.00033174362,0.000043674627],"category_scores_gemma":[0.00012733844,0.00029884395,0.00018969506,0.00042005721,0.0007648251,0.00021323717,0.00004400405,0.0006565293,0.000010873869],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018461757,0.000020761294,0.000067377245,0.00046935372,0.00006897717,0.00000827382,0.051907465,0.04720363,0.00028128637,0.012404433,0.000009284593,0.8875407],"study_design_scores_gemma":[0.001095676,0.00045492643,0.0004553079,0.004290041,0.00046887487,0.000012351018,0.00006624644,0.30384076,0.004465059,0.62786186,0.054534223,0.0024546823],"about_ca_topic_score_codex":0.00015134279,"about_ca_topic_score_gemma":0.0058088903,"teacher_disagreement_score":0.98656595,"about_ca_system_score_codex":0.00035275632,"about_ca_system_score_gemma":0.00044253457,"threshold_uncertainty_score":0.99994636},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000534303,0.0023195965,0.98973167,0.005342481,0.0010191357,0.00038509213,0.00028756668,0.00053877267,0.00032227385],"genre_scores_gemma":[0.14561273,0.00003524652,0.85363394,0.00011660496,0.00025529394,0.000014528843,0.00017647471,0.00003954581,0.0001156584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596024,0.000020848185,0.0006261087,0.0019204018,0.0008387557,0.00063363503],"domain_scores_gemma":[0.99100137,0.0008375266,0.00033776916,0.0075214356,0.00022981378,0.000072106894],"candidate_categories":["metaresearch","metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0018603136,0.00043834082,0.00053822395,0.0005882759,0.0002646328,0.00044724133,0.04418556,0.00027382467,0.000004659313],"category_scores_gemma":[0.015458297,0.00037827872,0.000089014015,0.0006208145,0.000989723,0.00089246314,0.112938076,0.0011545077,0.000007444479],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013819011,0.000035721583,0.00012281924,0.0007209348,0.00006895104,0.000063071486,0.00045461292,0.008505874,0.002149794,0.04130878,0.0007394626,0.94581616],"study_design_scores_gemma":[0.000085644075,0.00007055366,0.0000045136053,0.0009808105,0.000008934002,0.000041649353,2.4141912e-7,0.6763101,0.0013642964,0.31927022,0.0015729022,0.00029011088],"about_ca_topic_score_codex":0.00002225976,"about_ca_topic_score_gemma":0.000026226355,"teacher_disagreement_score":0.94552606,"about_ca_system_score_codex":0.00020429952,"about_ca_system_score_gemma":0.0006191499,"threshold_uncertainty_score":0.9998669},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016117856,0.00036146125,0.978423,0.0005633713,0.0009072642,0.00041290035,0.000006277757,0.00012840358,0.003079452],"genre_scores_gemma":[0.96877867,0.000013373053,0.028867975,0.0014464114,0.00039521675,0.0000049235487,0.00003227782,0.000065192726,0.00039595223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701864,0.000024595382,0.00039137268,0.0011692571,0.00092656293,0.00046955366],"domain_scores_gemma":[0.9986133,0.00017491088,0.00014147599,0.0007268119,0.00016836663,0.00017512399],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033372722,0.000497908,0.00066334126,0.0020431872,0.00019316151,0.00018411587,0.000390599,0.00034712104,0.00012109845],"category_scores_gemma":[0.000051227275,0.0003957576,0.00047912958,0.0014088007,0.00051265804,0.00008293803,0.00016220711,0.0009332654,0.00005822452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008954069,0.00055136665,0.02691584,0.0022493934,0.00160676,0.007110134,0.0012959443,0.1194986,0.015790375,0.0011856791,0.000036688954,0.8228638],"study_design_scores_gemma":[0.00032237,0.00033229345,0.004440576,0.00071487157,0.00078518334,0.000080337086,6.714483e-7,0.9876235,0.001401387,0.0035369052,0.0003310923,0.00043082738],"about_ca_topic_score_codex":0.00008794744,"about_ca_topic_score_gemma":0.00025861672,"teacher_disagreement_score":0.9526608,"about_ca_system_score_codex":0.0004134388,"about_ca_system_score_gemma":0.000240515,"threshold_uncertainty_score":0.99984944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017103,0.0015199559,0.9545515,0.03945481,0.0019484903,0.00073269766,0.0000097866705,0.0003189048,0.0012928221],"genre_scores_gemma":[0.6420718,0.00014169821,0.0362051,0.31795344,0.0019885714,0.000039788774,0.000024238689,0.00016880497,0.0014065856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972704,0.000019093806,0.00025936755,0.0013071923,0.0007803431,0.00036359753],"domain_scores_gemma":[0.99746394,0.0012537511,0.000096439566,0.0006871522,0.00009409177,0.00040462278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051887427,0.00042696623,0.00044269467,0.001226363,0.0001872532,0.00022466433,0.0003076168,0.0003854303,0.00006039419],"category_scores_gemma":[0.00080841075,0.00036019026,0.00011257125,0.00042223476,0.0006354503,0.00006633532,0.00021842432,0.001049686,0.000032525717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024300403,0.000109812005,0.00019713986,0.0017605422,0.00004803473,0.001340148,0.0010842474,0.11169837,0.0010803828,0.0014794945,0.0009841548,0.87997466],"study_design_scores_gemma":[0.001809395,0.0018702444,0.0011692808,0.0039329636,0.00024943994,0.0006607792,5.627414e-7,0.8044928,0.0061830515,0.06408275,0.11421355,0.0013352326],"about_ca_topic_score_codex":0.00008718416,"about_ca_topic_score_gemma":0.00039159125,"teacher_disagreement_score":0.9183464,"about_ca_system_score_codex":0.0010482648,"about_ca_system_score_gemma":0.0010185499,"threshold_uncertainty_score":0.999885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004895271,0.0006265379,0.98645526,0.007283722,0.0044031492,0.0005912429,0.00000656139,0.00017236134,0.00041224016],"genre_scores_gemma":[0.3762092,0.000048808794,0.61549485,0.00584366,0.0017355512,0.00007035754,0.000008222935,0.00009529301,0.00049408514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964834,0.000026608317,0.00061530335,0.0013881415,0.00076842215,0.0007181136],"domain_scores_gemma":[0.99533165,0.0026410404,0.00029660726,0.0013703001,0.00026118613,0.000099229605],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019788593,0.0004826112,0.00046625684,0.0009024418,0.0003203077,0.0011805831,0.0032733877,0.0004119551,0.0000094765655],"category_scores_gemma":[0.00046908762,0.00036946888,0.00017718288,0.0019971142,0.00038766649,0.00037003765,0.00068792386,0.0012594206,0.00002180417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018262166,0.000048276866,0.000121363984,0.00021489031,0.000022256347,0.0000753952,0.0014040306,0.23736528,0.000032757216,0.11113917,0.000039309452,0.649519],"study_design_scores_gemma":[0.00012365115,0.0000784558,0.00024730488,0.0006622566,0.000013961096,0.00001606304,3.3189346e-7,0.7003146,0.0002146106,0.2957368,0.0022389444,0.00035308828],"about_ca_topic_score_codex":0.000071242626,"about_ca_topic_score_gemma":0.00030473302,"teacher_disagreement_score":0.6491659,"about_ca_system_score_codex":0.0003013946,"about_ca_system_score_gemma":0.0005812013,"threshold_uncertainty_score":0.9998757},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017143367,0.00022722383,0.9936639,0.00014340637,0.002775949,0.0006272528,0.000004311817,0.0014439981,0.00094249233],"genre_scores_gemma":[0.6070466,0.000048923193,0.39056897,0.00045880085,0.0007845328,0.00008084503,0.000012866535,0.00010397357,0.00089449703],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959681,0.00004760726,0.0005775764,0.0019250402,0.0009361764,0.00054551015],"domain_scores_gemma":[0.9974953,0.00028869926,0.00029844386,0.0013086814,0.00047971596,0.00012914531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093416416,0.00060252484,0.0004736162,0.001056177,0.0004208543,0.0009241515,0.0012538509,0.00039708134,0.000017677148],"category_scores_gemma":[0.000119779776,0.00052566605,0.00010298295,0.0011836265,0.0005574759,0.0014916274,0.00076540036,0.0009633455,0.000033067157],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000568894,0.00002227399,0.000024147905,0.0001772275,0.000022546263,0.00004325392,0.00039733778,0.025597546,0.0052153384,0.017359342,0.000004160459,0.9510799],"study_design_scores_gemma":[0.00024390857,0.0010399319,0.0001022588,0.0007776048,0.00003644854,0.00016681339,6.408192e-7,0.18663609,0.18068203,0.6242331,0.0048840265,0.0011971046],"about_ca_topic_score_codex":0.000049258637,"about_ca_topic_score_gemma":0.0012824545,"teacher_disagreement_score":0.9498828,"about_ca_system_score_codex":0.0008159293,"about_ca_system_score_gemma":0.00036442207,"threshold_uncertainty_score":0.9997195},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061957084,0.003094118,0.9780386,0.00026143805,0.0015356693,0.00027704937,0.000010945756,0.0003416841,0.015820913],"genre_scores_gemma":[0.937854,0.00049272703,0.05886758,0.00026537923,0.00061100983,0.00003231696,0.000028955455,0.00011923222,0.0017288149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985925,0.0000075059766,0.00026577004,0.00048960804,0.00034564477,0.00029894657],"domain_scores_gemma":[0.998751,0.00017846092,0.000046923476,0.0008560617,0.000084697116,0.00008287164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028032734,0.00032482477,0.00028344063,0.00048032246,0.00009977706,0.00035636555,0.000791831,0.00016287364,0.000020565729],"category_scores_gemma":[0.000012485784,0.000268199,0.000055463486,0.00039101226,0.00024399691,0.00022668391,0.00023354328,0.0007196492,0.000033242937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013600733,0.000025900736,0.000016298465,0.00020062942,0.00006599438,0.00006844675,0.0007617098,0.5919323,0.00013986297,0.019063642,0.00023171234,0.38747993],"study_design_scores_gemma":[0.00038867013,0.00021360368,0.00009260064,0.0015096702,0.00005637236,0.00011049305,0.0000015884049,0.8924706,0.0015263719,0.05175031,0.050781343,0.0010983902],"about_ca_topic_score_codex":0.0000293041,"about_ca_topic_score_gemma":0.00026193616,"teacher_disagreement_score":0.9372344,"about_ca_system_score_codex":0.00043180163,"about_ca_system_score_gemma":0.00013640262,"threshold_uncertainty_score":0.999977},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015480713,0.00045087285,0.9925453,0.0022872484,0.001166493,0.00022690462,0.0000035398803,0.00010559718,0.0016659438],"genre_scores_gemma":[0.99077505,0.000011310184,0.0076824413,0.0007450403,0.0004086337,0.0000059330846,0.0000021458993,0.000023120057,0.00034633916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965365,0.000056257115,0.00053851004,0.0014982073,0.00072874536,0.0006417825],"domain_scores_gemma":[0.9988105,0.000371943,0.0002073553,0.00035568172,0.00013432397,0.00012018989],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011474212,0.0004603888,0.00064178463,0.0011116867,0.00016425522,0.0008625657,0.0018088989,0.00029366484,0.000013012289],"category_scores_gemma":[0.00006912553,0.0004102578,0.00016639465,0.00059997966,0.00034582196,0.00069618656,0.0010988477,0.0012047186,0.00003334777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009916463,0.00007022493,0.00020527696,0.00007280477,0.0000604654,0.00034231273,0.0031743785,0.005433922,0.000031894186,0.44738984,0.000036319,0.54317266],"study_design_scores_gemma":[0.00028691062,0.00007108795,0.00018858346,0.00025322082,0.000011615014,0.00005687928,4.2014364e-7,0.9756055,0.00001322681,0.02220064,0.0008611618,0.00045077063],"about_ca_topic_score_codex":0.000021884212,"about_ca_topic_score_gemma":0.0006117232,"teacher_disagreement_score":0.98922694,"about_ca_system_score_codex":0.00032294792,"about_ca_system_score_gemma":0.00027194573,"threshold_uncertainty_score":0.99983495},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014694012,0.0011969662,0.99009585,0.00093852123,0.0015943273,0.00084214186,0.0000017868929,0.000580859,0.004734852],"genre_scores_gemma":[0.62576836,0.000054576052,0.3711279,0.0013198775,0.0007719322,0.00026434017,0.000013711638,0.000055381035,0.0006239106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687374,0.00007152815,0.0004436535,0.0012335205,0.00077013136,0.0006074514],"domain_scores_gemma":[0.99835837,0.0004352797,0.00015030244,0.00077246776,0.00013076256,0.0001528474],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011094769,0.0004362785,0.000453591,0.0006909008,0.00020242082,0.0015217689,0.0018108436,0.00033802516,0.0000044166127],"category_scores_gemma":[0.00007559455,0.00033725254,0.00011937766,0.0010477502,0.00052751007,0.0005231899,0.0003569751,0.0005663431,0.000055904406],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018932094,0.000036295216,0.00001009039,0.00024051277,0.000007738211,0.00004992477,0.0007124522,0.0012890823,0.000009214438,0.040141895,0.00007133678,0.9574296],"study_design_scores_gemma":[0.00016321677,0.00033334034,0.000035291923,0.00022325016,0.00001966748,0.000076516626,3.6469146e-7,0.7227637,0.000962523,0.25492504,0.019846983,0.0006500964],"about_ca_topic_score_codex":0.000021224738,"about_ca_topic_score_gemma":0.000048466,"teacher_disagreement_score":0.9567795,"about_ca_system_score_codex":0.00026196084,"about_ca_system_score_gemma":0.0008543847,"threshold_uncertainty_score":0.999908},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028490844,0.0009733886,0.9735729,0.00010177234,0.0012468288,0.00010906536,0.0000040557684,0.00032219567,0.02364131],"genre_scores_gemma":[0.6430237,0.0008424954,0.34976047,0.0004394591,0.0014933087,0.000043489763,0.0000133231815,0.00026185907,0.0041218647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874204,0.0000021899239,0.0002055581,0.00046714,0.0003086991,0.00027435416],"domain_scores_gemma":[0.9994287,0.00012942149,0.000029771956,0.00031708277,0.000034416094,0.000060643117],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015460374,0.0002849454,0.00023893507,0.00037091228,0.000054814696,0.00024084511,0.0004900369,0.00020315732,0.00006251423],"category_scores_gemma":[0.000018437782,0.0002559174,0.000058357597,0.00013982614,0.00010373175,0.00012464267,0.00013060302,0.00040539753,0.00008826931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.592849e-7,0.0000014242313,0.0000011203276,0.0001440188,0.0000069749035,0.000017659393,0.00007529019,0.839147,0.000008528052,0.0012696615,0.000021556094,0.15930614],"study_design_scores_gemma":[0.00003176648,0.000012695304,0.000012907134,0.00048170544,0.000013738356,0.000011291091,3.273036e-8,0.95391554,0.0021196145,0.039403703,0.0036170217,0.00038000048],"about_ca_topic_score_codex":0.0000036449999,"about_ca_topic_score_gemma":0.000016420494,"teacher_disagreement_score":0.64299524,"about_ca_system_score_codex":0.0001276164,"about_ca_system_score_gemma":0.000049974413,"threshold_uncertainty_score":0.99998933},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016562204,0.0013332032,0.9931731,0.00019648123,0.0019016069,0.0011158861,0.000033366214,0.00022630356,0.00036383152],"genre_scores_gemma":[0.93529224,0.0000060550406,0.06403759,0.00011623797,0.0002610904,0.000053225784,0.000049641163,0.00004403748,0.00013987595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947043,0.00007987268,0.0011474191,0.0021221957,0.0011817064,0.00076447317],"domain_scores_gemma":[0.9982496,0.00017797647,0.00028789768,0.0008217934,0.00024109398,0.00022163273],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013013182,0.00068403117,0.0008250056,0.0012890128,0.00026221905,0.0016185535,0.0018643023,0.0004064015,0.0000017688141],"category_scores_gemma":[0.000030890962,0.0006605234,0.00014035,0.0005624364,0.00037219637,0.0006007242,0.0010637664,0.0010295792,0.000022229562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051660654,0.00008182732,0.0001817187,0.00013940428,0.000020235128,0.00018453615,0.00094949786,0.90300965,0.000101263024,0.08251004,0.0000041626668,0.012812506],"study_design_scores_gemma":[0.0005290559,0.000069121204,0.0000989368,0.00069360674,0.00001650832,0.00012443484,0.000002318292,0.97463465,0.000012157049,0.023154154,0.00002803763,0.0006370179],"about_ca_topic_score_codex":0.00042828725,"about_ca_topic_score_gemma":0.0001537034,"teacher_disagreement_score":0.933636,"about_ca_system_score_codex":0.0007219066,"about_ca_system_score_gemma":0.00031451718,"threshold_uncertainty_score":0.9995846},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028761873,0.0024193635,0.8477039,0.005483047,0.044530097,0.0016074785,0.00026989717,0.0010955147,0.06812884],"genre_scores_gemma":[0.9704035,0.00034949277,0.0076991287,0.007934363,0.0029837233,0.000016564192,0.000021490616,0.0001693273,0.010422437],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964993,0.000030525818,0.00036330186,0.0017872648,0.00083001255,0.0004896067],"domain_scores_gemma":[0.99825335,0.0007223817,0.00013100408,0.0007226239,0.000046075307,0.00012459244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030658892,0.00047271003,0.0003852403,0.00051704457,0.00021452577,0.0003858896,0.0010968088,0.0002574162,0.00016796327],"category_scores_gemma":[0.00018585601,0.00038818235,0.00017264683,0.00042753504,0.0006426602,0.00024076244,0.0006846692,0.0009741261,0.0003134189],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000338452,0.00004111289,0.000019878295,0.00009573313,0.000016045848,0.00067946955,0.0005069749,0.032224927,0.23316829,0.034807,0.00023558844,0.69817114],"study_design_scores_gemma":[0.00017515579,0.00021948836,0.000049102433,0.00044071765,0.000027095299,0.00006911069,1.5198361e-7,0.41340634,0.0687815,0.5114213,0.004571607,0.0008384223],"about_ca_topic_score_codex":0.00006515447,"about_ca_topic_score_gemma":0.0000593834,"teacher_disagreement_score":0.94164157,"about_ca_system_score_codex":0.00019170028,"about_ca_system_score_gemma":0.00016755234,"threshold_uncertainty_score":0.999857},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003096572,0.00280576,0.9853554,0.000040978666,0.0041958173,0.0012352864,0.000073602416,0.0010409312,0.004942575],"genre_scores_gemma":[0.9787292,0.000026172516,0.01942567,0.0001552571,0.0009947881,0.000162822,0.000031104533,0.0001898884,0.0002850816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970281,0.000007996875,0.0005606783,0.0010793303,0.00062230043,0.0007015942],"domain_scores_gemma":[0.998252,0.00025774675,0.000082203616,0.0009780007,0.00017743657,0.00025266095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023509494,0.0007795688,0.0010934585,0.0024425439,0.00006220645,0.00027311163,0.0009532695,0.0003264121,0.000019167714],"category_scores_gemma":[0.000012237728,0.0007335583,0.0002781194,0.0018581455,0.00013273553,0.00015305502,0.00032255775,0.0007419746,0.00023589026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026620176,0.0000026259227,0.000006969325,0.00024106508,0.0003255477,0.000040361978,0.0009292985,0.9716011,0.00015661359,0.00067526073,0.0000130442,0.026005419],"study_design_scores_gemma":[0.0001172051,0.00007532134,0.00041161253,0.0006736388,0.00013390211,0.000029054963,0.000001098404,0.99236894,0.00014907496,0.0007098433,0.0044245054,0.000905829],"about_ca_topic_score_codex":0.000043625965,"about_ca_topic_score_gemma":0.000020913645,"teacher_disagreement_score":0.97841954,"about_ca_system_score_codex":0.0014028747,"about_ca_system_score_gemma":0.00008518565,"threshold_uncertainty_score":0.99951154},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050627114,0.0016649541,0.99089545,0.00005309034,0.0036881948,0.00065384066,0.000033366105,0.00029317802,0.0022116727],"genre_scores_gemma":[0.8501283,0.000054274726,0.14910078,0.00006587223,0.0002108051,0.00008589482,0.000008258382,0.00011513055,0.00023071135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780434,0.000008629615,0.0005217769,0.00076475117,0.00037698267,0.00052351336],"domain_scores_gemma":[0.99798006,0.0013753751,0.000073753945,0.00041727777,0.00008082661,0.000072722614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005678831,0.00047238078,0.00053062104,0.00084302615,0.000057413803,0.00019177227,0.000705634,0.00023171758,0.000005737162],"category_scores_gemma":[0.00011062914,0.00049353275,0.00009400214,0.00038433677,0.0001971907,0.00026777814,0.00017741893,0.00058104476,0.00002582045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049292707,0.0000034490088,0.00007161418,0.0006247025,0.000028679531,0.00013223644,0.00053624,0.977586,0.00040160443,0.009315578,0.000013686574,0.01128129],"study_design_scores_gemma":[0.00020358937,0.000087042354,0.00012294535,0.0033255755,0.00001247499,0.00005480602,0.0000012226966,0.97594225,0.0010518786,0.016756877,0.0017743002,0.0006670421],"about_ca_topic_score_codex":0.000031242173,"about_ca_topic_score_gemma":0.00016446126,"teacher_disagreement_score":0.849622,"about_ca_system_score_codex":0.0008464905,"about_ca_system_score_gemma":0.00016986427,"threshold_uncertainty_score":0.9997516},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011984349,0.0028814997,0.9684952,0.000099011006,0.006982398,0.0012979251,0.0001782197,0.0015895981,0.0064917994],"genre_scores_gemma":[0.9955882,0.000008447197,0.0010160353,0.00014837802,0.001118699,0.00011421491,0.000081034945,0.00023037104,0.0016946447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960438,0.0000317271,0.0007929118,0.0014618724,0.00066259137,0.0010071087],"domain_scores_gemma":[0.99819666,0.00035770223,0.00018024632,0.0008631187,0.00015262245,0.00024963423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084620627,0.0009330881,0.0009415843,0.0007587801,0.00026960927,0.0007211104,0.0010973769,0.0005678267,0.000022231692],"category_scores_gemma":[0.000020837046,0.0007914409,0.00019687778,0.0002958786,0.00033249764,0.0003763553,0.00011894974,0.00096655416,0.000055340777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012355606,0.000012257211,0.000006704118,0.0044966806,0.000082163955,0.0000806114,0.001340466,0.8253974,0.0003366913,0.0004040924,0.000038255203,0.16779234],"study_design_scores_gemma":[0.00042457267,0.00024874747,0.000010799833,0.002687576,0.000077303055,0.00042052908,0.000008840271,0.946191,0.015979864,0.03175013,0.0006178162,0.0015828114],"about_ca_topic_score_codex":0.0000540008,"about_ca_topic_score_gemma":0.0000930575,"teacher_disagreement_score":0.98360384,"about_ca_system_score_codex":0.00044749165,"about_ca_system_score_gemma":0.00022147741,"threshold_uncertainty_score":0.99945366},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012460255,0.0005169412,0.98046905,0.000014319239,0.0035757232,0.0013707285,0.000028956207,0.0010794476,0.00048460602],"genre_scores_gemma":[0.9578231,0.000003402071,0.041597113,0.00001043973,0.00022061211,0.00006633972,0.0000022390625,0.0000994311,0.00017732309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979049,0.0000069891134,0.0006483615,0.000649361,0.00038335208,0.00040702292],"domain_scores_gemma":[0.99859655,0.00048350118,0.00010412848,0.00062282005,0.00011973856,0.00007324694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046935794,0.00045323002,0.0006501911,0.00058381417,0.00005565414,0.00010849969,0.0005673083,0.00019556195,0.00000386579],"category_scores_gemma":[0.000041944535,0.00045125023,0.00010067207,0.0002872353,0.000105330095,0.00010074636,0.0001731625,0.0003994733,0.000007497814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014854697,0.000022349766,0.00003046329,0.00054943154,0.00008435173,0.0007703563,0.0023559735,0.97147274,0.0002655767,0.00017200419,0.000020309679,0.024254985],"study_design_scores_gemma":[0.00033440132,0.00016801756,0.000043600165,0.0010021925,0.000032902917,0.0008003312,0.0000038457024,0.9955805,0.00044391057,0.0005311239,0.0005927531,0.00046639962],"about_ca_topic_score_codex":0.0000358768,"about_ca_topic_score_gemma":0.00017881452,"teacher_disagreement_score":0.94536287,"about_ca_system_score_codex":0.0003697636,"about_ca_system_score_gemma":0.000104208106,"threshold_uncertainty_score":0.99979395},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009828991,0.0011297966,0.991372,0.00025056506,0.0036875505,0.00048825433,0.000002548588,0.00027557334,0.0018108392],"genre_scores_gemma":[0.8125144,0.000006906865,0.18662702,0.00020107739,0.00041707102,0.000010127106,0.000004736232,0.000043977936,0.00017463887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944657,0.00012632798,0.00082318945,0.0018111473,0.0021381606,0.00063547783],"domain_scores_gemma":[0.9966388,0.0005752534,0.00055923813,0.0015104446,0.0005690367,0.0001472501],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033546353,0.00056047045,0.0005797216,0.00075683807,0.00023636303,0.00052896666,0.0036844113,0.00039082664,0.0000275034],"category_scores_gemma":[0.00027567626,0.0005207498,0.00015338471,0.0010894651,0.00084671035,0.00074293406,0.0017460899,0.0016530115,0.000018447236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038309477,0.0000089473515,0.000042608764,0.00003291475,0.000008074742,0.000035913497,0.00042178776,0.798211,0.000020306992,0.023866246,0.0000014947464,0.17734687],"study_design_scores_gemma":[0.00017262372,0.000118883,0.000061013376,0.00031328364,0.000028034705,0.000035475314,4.8856657e-7,0.79375774,0.00009780701,0.20501144,0.000008919487,0.00039431395],"about_ca_topic_score_codex":0.000044287048,"about_ca_topic_score_gemma":0.000078490164,"teacher_disagreement_score":0.81153154,"about_ca_system_score_codex":0.0005218477,"about_ca_system_score_gemma":0.0011604864,"threshold_uncertainty_score":0.9997244},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024695072,0.0009710284,0.9743296,0.00023262078,0.0016657048,0.0003201369,0.000005129886,0.00019851547,0.02203032],"genre_scores_gemma":[0.1416396,0.00005328976,0.85765874,0.00018161058,0.00017911177,0.000008083522,0.0000022735687,0.000030344818,0.00024694644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995805,0.00006305251,0.0008315956,0.0014895513,0.001198955,0.00061179907],"domain_scores_gemma":[0.99750006,0.00051480054,0.00028494137,0.0012752546,0.00029216087,0.0001327832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002035826,0.00050945394,0.00064703,0.00065909553,0.00017567354,0.00077538,0.0028697345,0.0004206386,0.000015785525],"category_scores_gemma":[0.00013485637,0.0004367758,0.00020986842,0.0007188137,0.0012204978,0.0022915336,0.0005201254,0.0010279872,0.0000145694285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029695414,0.000016996191,0.0000072152757,0.00015364542,0.0000091490065,0.00001838612,0.002125609,0.048729114,0.00026625305,0.5491207,0.0000018064176,0.39954814],"study_design_scores_gemma":[0.000054881988,0.00008055213,0.000018124989,0.00057924207,0.00000831218,0.00007143777,0.0000012384521,0.5722309,0.002248377,0.42427152,0.00012416944,0.0003112423],"about_ca_topic_score_codex":0.000025551903,"about_ca_topic_score_gemma":0.000014982232,"teacher_disagreement_score":0.52350175,"about_ca_system_score_codex":0.000355558,"about_ca_system_score_gemma":0.0008782706,"threshold_uncertainty_score":0.99980843},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075590005,0.014322321,0.978564,0.0037587548,0.0014955869,0.0008782693,0.0000225239,0.00009315251,0.000109467306],"genre_scores_gemma":[0.22994253,0.000512932,0.76450384,0.0028751022,0.0018774723,0.00007075945,0.000027343809,0.000061839535,0.00012818193],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961158,0.00020159334,0.0006719816,0.0008829063,0.0015306465,0.0005970579],"domain_scores_gemma":[0.9938087,0.0035266671,0.00027512133,0.0019574075,0.0003674553,0.00006467336],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.008111875,0.00035221042,0.00037225243,0.00087590475,0.0003061296,0.0010773578,0.011386719,0.00012646728,0.000005715772],"category_scores_gemma":[0.0012187398,0.00020380833,0.000086668035,0.0008812531,0.0006715769,0.0009533878,0.003071955,0.0019082314,0.0000074573472],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005368201,0.00006690486,0.000045716464,0.00028182034,0.000042625084,0.00129434,0.023993384,0.00081421295,0.00026098147,0.01870211,0.0007658427,0.95367837],"study_design_scores_gemma":[0.00024857704,0.00051907747,0.000020958432,0.0032896115,0.000041358067,0.0007107523,0.000057172292,0.08172131,0.002328385,0.9077972,0.0027525108,0.0005130866],"about_ca_topic_score_codex":0.0005551498,"about_ca_topic_score_gemma":0.0006518942,"teacher_disagreement_score":0.9531653,"about_ca_system_score_codex":0.0003250141,"about_ca_system_score_gemma":0.00065943255,"threshold_uncertainty_score":0.99995965},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028131276,0.00024778233,0.9840689,0.0011178218,0.00699352,0.001753836,0.000039550432,0.00007142814,0.0028940411],"genre_scores_gemma":[0.93291616,0.0005226297,0.048824564,0.0034428337,0.0052138385,0.0017002833,0.00011471888,0.00012077662,0.0071441936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977606,0.00004466623,0.0003321783,0.0011261038,0.00042021018,0.00031624618],"domain_scores_gemma":[0.9983502,0.00035665583,0.000098224875,0.0010473464,0.00010471406,0.00004287111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005605439,0.00031578567,0.00022636601,0.00020426192,0.00058106054,0.00041679264,0.0010115337,0.00015879041,0.00019130053],"category_scores_gemma":[0.000060177288,0.00018202269,0.000060782215,0.00025603268,0.00045524575,0.00033567144,0.0004393693,0.00041189397,0.000051752006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012132186,0.000033745764,0.0000127671265,0.000035526275,0.0000425889,0.0000045866245,0.2795623,0.002215372,0.0009818212,0.00092519436,0.0023410146,0.7137238],"study_design_scores_gemma":[0.0008154496,0.0013797357,0.0012620027,0.0006894206,0.00016627357,0.00014472104,0.0059188358,0.88911676,0.00027644524,0.0031891686,0.09583976,0.0012014096],"about_ca_topic_score_codex":0.0005909568,"about_ca_topic_score_gemma":0.000630045,"teacher_disagreement_score":0.9352443,"about_ca_system_score_codex":0.00019898154,"about_ca_system_score_gemma":0.00010869402,"threshold_uncertainty_score":0.742267},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033382614,0.00017223832,0.9920821,0.00014346586,0.0004970541,0.00046898678,0.000004606472,0.00013612193,0.0061615533],"genre_scores_gemma":[0.68293625,0.000008892162,0.3043142,0.0010010316,0.0009890484,0.000075809105,0.00019096005,0.00013077685,0.010353048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978027,0.000015996617,0.00027827924,0.00090461667,0.0005775588,0.0004208946],"domain_scores_gemma":[0.9991058,0.00022236501,0.00013519535,0.0003830127,0.000051640516,0.00010199073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077857886,0.00027109217,0.00021787499,0.00026767937,0.00026344007,0.00032494953,0.00060590735,0.00019134663,0.000049300495],"category_scores_gemma":[0.000043816097,0.00025054291,0.00006585501,0.00022122265,0.00026571885,0.000424561,0.00021737772,0.00026990022,0.000041117353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013177576,0.000008161236,0.0005221264,0.000076037715,0.000004231067,0.00003443511,0.00056800625,0.99203014,0.000024477331,0.0011671865,0.00034712185,0.0052049053],"study_design_scores_gemma":[0.00012968406,0.00015874844,0.00010228574,0.00051801844,0.0000185626,0.00002337038,0.0000037671027,0.9856118,0.00009347134,0.010153705,0.0028750687,0.0003115496],"about_ca_topic_score_codex":0.000040148265,"about_ca_topic_score_gemma":0.0000068514432,"teacher_disagreement_score":0.6877679,"about_ca_system_score_codex":0.0008236781,"about_ca_system_score_gemma":0.000092690345,"threshold_uncertainty_score":0.9999947},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043928514,0.00094103225,0.9926881,0.0001757263,0.00073435355,0.0001986878,0.0000046370374,0.00021791914,0.004995604],"genre_scores_gemma":[0.27269542,0.00014542289,0.7253311,0.0001758483,0.00037180423,0.000013878923,0.000036461563,0.000075307515,0.0011547114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888986,0.000002752176,0.0001748098,0.00045610618,0.0002663534,0.00021012602],"domain_scores_gemma":[0.99955374,0.000093225586,0.000035400553,0.00021181545,0.00004625093,0.00005955237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014155936,0.0002431246,0.00017053298,0.00024234713,0.00006234342,0.00011254624,0.00015936652,0.00011610971,0.000008277262],"category_scores_gemma":[0.000010407659,0.00022453039,0.000023909948,0.00008865189,0.00015321538,0.000098745826,0.00013495889,0.00035153062,0.000014405909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.611574e-7,0.0000023579655,0.0000012187934,0.00005790466,0.0000071439995,0.000009292603,0.0000740704,0.9561529,0.000051920473,0.007882071,0.000011835743,0.035748284],"study_design_scores_gemma":[0.00008144131,0.000028496277,0.000008650162,0.0002116091,0.000011470619,0.00001643732,4.8326495e-8,0.84295243,0.00096931274,0.15481961,0.0006432944,0.00025720792],"about_ca_topic_score_codex":0.0000042110214,"about_ca_topic_score_gemma":0.000020180398,"teacher_disagreement_score":0.2726515,"about_ca_system_score_codex":0.00019801578,"about_ca_system_score_gemma":0.00004125858,"threshold_uncertainty_score":0.91560835},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044114124,0.0010642383,0.8782583,0.003078173,0.0039165476,0.007209467,0.0002368042,0.0010595918,0.061062787],"genre_scores_gemma":[0.9871035,0.000012705384,0.01099854,0.0003714121,0.00030288575,0.000008319523,0.0000087049875,0.000038052927,0.0011558541],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9945061,0.00015806,0.0007568862,0.001750894,0.0018317149,0.0009963103],"domain_scores_gemma":[0.9980928,0.00023023483,0.00033408843,0.000722407,0.00029905667,0.00032141744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023612038,0.0005507579,0.0011742401,0.003151024,0.00036233847,0.00024280217,0.0025275918,0.00093783264,0.00003499407],"category_scores_gemma":[0.00095640984,0.0005533051,0.00033665833,0.006661724,0.0020333729,0.00023227371,0.0008540482,0.0014287019,0.000032708795],"study_design_candidate":"observational","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.0015599614,0.0029124913,0.16925235,0.0012582578,0.001635909,0.00048643159,0.26315984,0.028462805,0.0004890973,0.027445477,0.00217365,0.5011637],"study_design_scores_gemma":[0.006226983,0.0007319087,0.53790396,0.0086428,0.0017027626,0.000025393634,0.0004974069,0.040966418,0.00157087,0.39324185,0.0013035566,0.0071860882],"about_ca_topic_score_codex":0.0021097786,"about_ca_topic_score_gemma":0.02477193,"teacher_disagreement_score":0.9429894,"about_ca_system_score_codex":0.0018598583,"about_ca_system_score_gemma":0.001988945,"threshold_uncertainty_score":0.99969184},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065566506,0.009525032,0.9786324,0.0006588765,0.0020500543,0.0005258906,0.000003383434,0.00027183798,0.0076768794],"genre_scores_gemma":[0.8118617,0.0002301236,0.18532826,0.0006035037,0.0010728863,0.000013367838,0.000009078308,0.00006598917,0.000815073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955597,0.0000702015,0.00054144626,0.0019321499,0.0013805658,0.0005159338],"domain_scores_gemma":[0.9977389,0.00038438762,0.00021078494,0.0011652819,0.00035777193,0.00014287072],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0027868655,0.00047984137,0.000436807,0.00095028605,0.00027917666,0.001110195,0.0017382168,0.00036617898,0.000010984788],"category_scores_gemma":[0.00004738066,0.0004507002,0.00009724668,0.0006291274,0.00036815915,0.0009046991,0.0016487843,0.0008039185,0.000026903048],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008857667,0.000014544252,0.000010535281,0.00012438455,0.000016029147,0.000043102056,0.0040749875,0.10696848,0.00016745606,0.09825066,0.000014979827,0.790306],"study_design_scores_gemma":[0.00013958584,0.000039875726,0.000012386266,0.0005204492,0.000015877184,0.000037457612,1.8418035e-7,0.59118205,0.00013120568,0.40724403,0.00039196073,0.00028494955],"about_ca_topic_score_codex":0.000015320102,"about_ca_topic_score_gemma":0.000032837703,"teacher_disagreement_score":0.81120604,"about_ca_system_score_codex":0.00045356213,"about_ca_system_score_gemma":0.00039207505,"threshold_uncertainty_score":0.99992675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015286865,0.003994099,0.98462147,0.00009886491,0.006101553,0.00057491346,0.000022276869,0.00031081933,0.004260741],"genre_scores_gemma":[0.45674756,0.0009536869,0.5126916,0.0008530761,0.007929284,0.000177737,0.000078524274,0.00086131407,0.019707205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978106,0.000004185454,0.00044583136,0.0007518522,0.0004489654,0.00053853606],"domain_scores_gemma":[0.99888813,0.00020620458,0.000057350884,0.00061093946,0.00012193246,0.00011545812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003741389,0.0004646028,0.00047506747,0.00048225393,0.000094798685,0.00041452143,0.0008908236,0.0003186335,0.000013617013],"category_scores_gemma":[0.00002377012,0.00041310277,0.0001399941,0.0002501076,0.00021964876,0.000105678904,0.00020454975,0.0005859578,0.00013357775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013358376,0.0000038338067,0.0000011664695,0.0003504156,0.000020996233,0.000028559902,0.00015963381,0.93836945,0.00007424641,0.016250243,0.00010063878,0.04463949],"study_design_scores_gemma":[0.000051511346,0.00006225424,9.27875e-7,0.0007097808,0.000021892763,0.00003941916,1.7246363e-7,0.9552311,0.0008407489,0.032706056,0.00984014,0.00049603335],"about_ca_topic_score_codex":0.000011033694,"about_ca_topic_score_gemma":0.000019274801,"teacher_disagreement_score":0.47192985,"about_ca_system_score_codex":0.00023132116,"about_ca_system_score_gemma":0.000098530705,"threshold_uncertainty_score":0.9998321},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01430165,0.00074262987,0.98297817,0.000027426175,0.0010415163,0.00018503948,0.0000045671827,0.000098378696,0.00062062935],"genre_scores_gemma":[0.98360616,0.00006214363,0.016019963,0.00005598661,0.0001750897,0.0000011325943,0.00000291732,0.000039381684,0.0000372105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986255,0.0000069960815,0.0003031965,0.00048530573,0.0002844402,0.00029457296],"domain_scores_gemma":[0.99953204,0.00011782578,0.00004158988,0.00019333868,0.00005438328,0.00006080122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027343413,0.00027078352,0.00026648853,0.0015597666,0.000055195265,0.00015036644,0.00017234066,0.00023809547,0.0000074855166],"category_scores_gemma":[0.000042148702,0.0002718981,0.000035074285,0.0008659291,0.00027025247,0.000053845506,0.000091113354,0.00049412274,0.0000051678085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.339686e-7,0.0000025929066,0.000020253614,0.00007151179,0.000004323611,0.000037880174,0.00008648367,0.8408102,0.00078409613,0.00027618505,3.58189e-7,0.15790522],"study_design_scores_gemma":[0.0001306636,0.000028749377,0.000040452393,0.00033493992,0.000008965008,0.00005306021,2.8557372e-7,0.99156135,0.0037945616,0.0036916458,0.0000741763,0.00028114452],"about_ca_topic_score_codex":0.000024375375,"about_ca_topic_score_gemma":0.00010441995,"teacher_disagreement_score":0.9693045,"about_ca_system_score_codex":0.00013964598,"about_ca_system_score_gemma":0.000045716573,"threshold_uncertainty_score":0.9999733},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010409632,0.0007653418,0.98951674,0.00026779898,0.005437802,0.001708869,0.000026297217,0.00012550909,0.002141227],"genre_scores_gemma":[0.25817645,0.000008516876,0.7378923,0.00035902607,0.0004356959,0.00021503055,0.000012731999,0.00008778937,0.002812417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965343,0.00012631131,0.00078701763,0.0013282142,0.0007148785,0.0005092677],"domain_scores_gemma":[0.9962754,0.0012705954,0.0005923053,0.0011841535,0.0005834647,0.00009406952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016802994,0.00047821127,0.0007424946,0.0005414287,0.00033254322,0.00040451245,0.003075264,0.0003049554,0.000002467789],"category_scores_gemma":[0.000311064,0.00036979263,0.000291499,0.0009752096,0.0005577027,0.0004784575,0.0014221993,0.0006342814,0.000008817751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030925443,0.000119454286,0.0005100244,0.00041567706,0.00020281154,0.000027932221,0.0111369435,0.11352961,0.0014832069,0.2801386,0.0001053735,0.5922994],"study_design_scores_gemma":[0.00035128355,0.00008896866,0.00007893763,0.000803399,0.00006827911,0.000011986051,8.4502824e-7,0.88925195,0.0039680917,0.10309343,0.0018938424,0.00038899865],"about_ca_topic_score_codex":0.000025069588,"about_ca_topic_score_gemma":0.00006358015,"teacher_disagreement_score":0.7757223,"about_ca_system_score_codex":0.0008225709,"about_ca_system_score_gemma":0.000753448,"threshold_uncertainty_score":0.9998754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012380138,0.000090636226,0.9815216,0.0010888726,0.0015739974,0.0016114287,0.000033363503,0.00011223641,0.0015877121],"genre_scores_gemma":[0.9666396,0.0000019229867,0.03180789,0.0008578207,0.0002849405,0.000010725605,0.00001891892,0.000033072047,0.00034510286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772567,0.000013265568,0.0005459953,0.00081229233,0.000527294,0.00037547993],"domain_scores_gemma":[0.9978444,0.0014166068,0.000089068984,0.00032180798,0.00014437072,0.00018373804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005189988,0.00030157098,0.000566413,0.0005589006,0.00006006168,0.000074118856,0.00015142452,0.00023537733,0.000056001],"category_scores_gemma":[0.0003113898,0.0002137699,0.00013870481,0.0003872567,0.00011825444,0.00007477019,0.00015613002,0.00041173608,0.000005511515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026946506,0.0000378845,0.00018120189,0.00007664673,0.000012176657,0.00019230443,0.00037661087,0.46530262,0.000012677012,0.000896626,5.518193e-7,0.53264123],"study_design_scores_gemma":[0.0014939293,0.00039584754,0.0008001472,0.0005362054,0.000022774515,0.000018897219,5.883742e-7,0.98102885,0.00008900696,0.010434791,0.0048966235,0.00028234252],"about_ca_topic_score_codex":0.000032752974,"about_ca_topic_score_gemma":0.00006887652,"teacher_disagreement_score":0.95425946,"about_ca_system_score_codex":0.00039629874,"about_ca_system_score_gemma":0.00023899467,"threshold_uncertainty_score":0.87172836},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014431606,0.002827048,0.99143934,0.0005482925,0.0020501015,0.00023917107,0.000009730548,0.00026540592,0.002476563],"genre_scores_gemma":[0.06824328,0.000246367,0.9283243,0.0010386311,0.0008591869,0.000007517678,0.000005096165,0.000062310035,0.0012133428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962178,0.000016402813,0.0004603601,0.0019320202,0.0007845022,0.00058890047],"domain_scores_gemma":[0.99757844,0.0007504656,0.0001575969,0.001157281,0.00014790331,0.00020831253],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007250054,0.00051505334,0.0004897328,0.0007038123,0.00026812215,0.0011940196,0.0023681144,0.00028687276,0.000012088114],"category_scores_gemma":[0.00011155654,0.00043334631,0.000095235984,0.00044618302,0.00044276804,0.00069739646,0.002953047,0.0009179829,0.00003756649],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027651527,0.000007211494,0.00000516912,0.000057603604,0.000009148722,0.00043002548,0.00036629522,0.0063694497,0.00027603682,0.023185963,0.000017836763,0.9692725],"study_design_scores_gemma":[0.00010070618,0.0000917857,0.00000627851,0.00095092074,0.000008091059,0.0002971107,1.4435774e-7,0.8125879,0.00036198943,0.18059477,0.004525531,0.00047474622],"about_ca_topic_score_codex":0.000030406794,"about_ca_topic_score_gemma":0.000048464983,"teacher_disagreement_score":0.96879774,"about_ca_system_score_codex":0.00019934254,"about_ca_system_score_gemma":0.00028479044,"threshold_uncertainty_score":0.9998428},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028292145,0.0009268984,0.99014604,0.0003816714,0.002040609,0.00023667881,0.000021976091,0.00013111084,0.0060866927],"genre_scores_gemma":[0.12215507,0.00008496489,0.87215626,0.0013629065,0.0009824334,0.000012099274,0.000017327102,0.00009917952,0.0031297633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672246,0.000015011491,0.0005073663,0.0013472652,0.0009629947,0.00044487286],"domain_scores_gemma":[0.9975949,0.0002475777,0.00022442735,0.0016655519,0.00016130236,0.000106252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005256254,0.0004400934,0.0004996706,0.00074960873,0.000103392835,0.00034474625,0.0034843334,0.00028054792,0.00003262003],"category_scores_gemma":[0.000030181141,0.00035077028,0.00014502076,0.0005530292,0.00053213467,0.00056399725,0.0024845726,0.0006222928,0.00008730613],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050134045,0.000029214889,0.00002113594,0.00009827257,0.000015927028,0.00014571278,0.00032559776,0.0044358126,0.0002423351,0.1537329,0.00020320913,0.84074485],"study_design_scores_gemma":[0.00014944772,0.00015389656,0.00009413289,0.0008071594,0.000007211399,0.000054400818,4.9299423e-8,0.59334004,0.0022999484,0.39576483,0.006854495,0.0004743873],"about_ca_topic_score_codex":0.000029708317,"about_ca_topic_score_gemma":0.00005718233,"teacher_disagreement_score":0.8402705,"about_ca_system_score_codex":0.000121630714,"about_ca_system_score_gemma":0.0003552958,"threshold_uncertainty_score":0.99989444},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01981126,0.00086337695,0.9645651,0.00008174474,0.0011585469,0.00058329373,0.000020973375,0.00013755754,0.012778163],"genre_scores_gemma":[0.9221789,0.000018124294,0.0665061,0.0004123374,0.0003712348,0.00004032529,0.00002700805,0.00007329154,0.010372656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977767,0.000011939345,0.00035448698,0.0010354649,0.00031837617,0.00050305825],"domain_scores_gemma":[0.99921757,0.00034368923,0.000109082896,0.0001326212,0.00009570021,0.000101330756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004324917,0.00037761347,0.00035370592,0.00046976045,0.00019909456,0.00020629467,0.00037349106,0.00031761036,0.000045935485],"category_scores_gemma":[0.00008489892,0.0003428048,0.00006947897,0.00015558372,0.0004589635,0.00014822849,0.00036325646,0.00068005465,0.000025802177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028855368,0.000051905976,0.0045277136,0.00016607028,0.0002097419,0.00020453682,0.15312338,0.01276978,0.00014394714,0.023185682,0.00013800147,0.8051907],"study_design_scores_gemma":[0.0019396467,0.0005127507,0.0017734101,0.0008237287,0.000076382596,0.00011249064,0.000087339184,0.89406794,0.00020019751,0.0972664,0.0014815198,0.0016581835],"about_ca_topic_score_codex":0.000020911715,"about_ca_topic_score_gemma":0.000076276054,"teacher_disagreement_score":0.90236765,"about_ca_system_score_codex":0.00010876247,"about_ca_system_score_gemma":0.00042109878,"threshold_uncertainty_score":0.99990237},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000069829225,0.0002472193,0.9888457,0.003602747,0.004406701,0.00043171603,0.0000071863055,0.000152086,0.0022996308],"genre_scores_gemma":[0.048122156,0.00009828318,0.93871963,0.010249311,0.00159988,0.00006115055,0.000047615154,0.000038914466,0.0010630632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968555,0.00000844726,0.0005880784,0.00077205186,0.0013863067,0.00038962538],"domain_scores_gemma":[0.9983896,0.00039643783,0.00014710546,0.0006817912,0.00023558902,0.0001494995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010830568,0.00029632487,0.0002713696,0.0006511801,0.0001191479,0.00055894104,0.0022384804,0.00029274085,0.000053287476],"category_scores_gemma":[0.00016778764,0.0002646946,0.00012781662,0.00024776824,0.00025270597,0.0007540437,0.0010166547,0.000529484,0.00015796018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019972333,0.000005387072,0.0000026527914,0.00007650783,0.000008926657,0.000011981584,0.00076393643,0.019509047,0.0000016466311,0.2892787,0.00008626387,0.69025296],"study_design_scores_gemma":[0.0000937922,0.00004320776,0.000002552602,0.00023874218,0.0000037945617,0.000027132763,1.4289287e-7,0.7374183,0.0001251783,0.239365,0.022461966,0.00022017636],"about_ca_topic_score_codex":0.000009628973,"about_ca_topic_score_gemma":0.000018663392,"teacher_disagreement_score":0.7179093,"about_ca_system_score_codex":0.0003792081,"about_ca_system_score_gemma":0.000951305,"threshold_uncertainty_score":0.9999805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.743861e-7,0.00034124844,0.9932156,0.0028191735,0.0010809746,0.0013793827,0.000058582496,0.00021272815,0.0008916301],"genre_scores_gemma":[0.0019311216,0.000025883242,0.9958134,0.00036399253,0.0003761787,0.00011910014,0.000053519816,0.000034604218,0.0012821798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698997,0.000024463701,0.00047287054,0.001129304,0.000814736,0.00056865456],"domain_scores_gemma":[0.99768907,0.0008564672,0.00019859028,0.000788763,0.000359461,0.00010764409],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014386819,0.00037448565,0.00031096122,0.00040337717,0.00044132874,0.0014472476,0.0021156317,0.00020346609,0.000010120851],"category_scores_gemma":[0.000079355144,0.0002642169,0.00014440306,0.0007574567,0.00039042826,0.0005374469,0.0010879799,0.00064914563,0.000025234376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013455337,0.0000102565145,3.1276227e-7,0.00006455605,0.000013552738,0.0000074811537,0.00077756145,0.14274397,0.00001429129,0.04971327,0.00007001522,0.8065834],"study_design_scores_gemma":[0.00017794553,0.00008580891,0.0000022411336,0.0002132545,0.000007957111,0.00003874676,4.4181968e-7,0.8390442,0.00012193994,0.15869562,0.0013343961,0.00027741003],"about_ca_topic_score_codex":0.000008240728,"about_ca_topic_score_gemma":0.000007682714,"teacher_disagreement_score":0.806306,"about_ca_system_score_codex":0.00024867768,"about_ca_system_score_gemma":0.0003820403,"threshold_uncertainty_score":0.999981},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019466213,0.0004647491,0.995602,0.00035530137,0.00018906136,0.0003331406,0.00001024369,0.0003111534,0.0025396612],"genre_scores_gemma":[0.25854686,0.00002880316,0.7408141,0.00019875822,0.000095207295,0.000017458757,0.000012360409,0.000025709445,0.00026076956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99629265,0.000039039718,0.0006301232,0.0015609107,0.001042979,0.0004343234],"domain_scores_gemma":[0.9974157,0.00033180218,0.00041129143,0.0011278547,0.00058332336,0.00013000007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010562018,0.0004453905,0.0006728193,0.001815082,0.00015490424,0.0004688646,0.0020383021,0.0002843739,0.000026799633],"category_scores_gemma":[0.000057086312,0.0003745792,0.0001981505,0.0022424841,0.0007865216,0.0005241394,0.0006176255,0.00070377043,0.000021422797],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073615784,0.00008817893,0.00041172584,0.00018239027,0.00019648692,0.00006521551,0.0012163286,0.0015050643,0.00084449566,0.029082863,0.000003437463,0.96639645],"study_design_scores_gemma":[0.00018723436,0.00013873128,0.00050186063,0.00048569657,0.00012433497,0.000030125544,7.1013176e-7,0.9609515,0.0036558036,0.033401128,0.000049207727,0.00047367573],"about_ca_topic_score_codex":0.000048402304,"about_ca_topic_score_gemma":0.00039428473,"teacher_disagreement_score":0.9659228,"about_ca_system_score_codex":0.00025462083,"about_ca_system_score_gemma":0.0003190806,"threshold_uncertainty_score":0.9998706},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012585489,0.0011423323,0.9943117,0.0033557925,0.00028828435,0.0005113278,0.000010433575,0.000022509481,0.00023180223],"genre_scores_gemma":[0.39262465,0.00012351989,0.5997515,0.00496914,0.0015887971,0.000059554404,0.00009664413,0.000054283875,0.000731952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982887,0.0000249202,0.00028529853,0.00054744544,0.00063612,0.0002175482],"domain_scores_gemma":[0.99898034,0.00044061657,0.000080803715,0.00022405409,0.00015565136,0.000118530974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006769545,0.00019179212,0.00030213912,0.0002649328,0.00010492215,0.000058722024,0.00026640174,0.000070392685,0.000008178677],"category_scores_gemma":[0.0001282924,0.00012691398,0.00009131188,0.00018082444,0.00067169487,0.00005880695,0.00017920235,0.00040524776,0.0000016565098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020835653,0.000092087575,0.00016765682,0.00042801962,0.0001241365,0.000108622866,0.00042155248,0.68032855,0.00044508683,0.0024311286,0.0013363085,0.31390852],"study_design_scores_gemma":[0.00018497076,0.00016226398,0.00010568572,0.00022975667,0.00009654378,0.00035550245,4.4769882e-7,0.99472135,0.00003934491,0.003843049,0.00014913405,0.0001119261],"about_ca_topic_score_codex":0.0000087251265,"about_ca_topic_score_gemma":9.474986e-7,"teacher_disagreement_score":0.3945602,"about_ca_system_score_codex":0.00006496429,"about_ca_system_score_gemma":0.00019735382,"threshold_uncertainty_score":0.51754016},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008862635,0.0014070091,0.9891927,0.0039526564,0.0025060778,0.00028424128,0.000006019394,0.00019172997,0.0023709333],"genre_scores_gemma":[0.6445637,0.000541275,0.34429756,0.0015451505,0.00080647605,0.000028797353,0.000032960397,0.00005733086,0.008126777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708766,0.00002334385,0.00034062943,0.0014754524,0.00073743676,0.0003354641],"domain_scores_gemma":[0.99832386,0.00020123017,0.00019728833,0.0009487988,0.00019100252,0.0001378211],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00069053646,0.00035163603,0.00028203975,0.0013685882,0.0002056813,0.0012437104,0.0013568908,0.00039731592,0.000022851327],"category_scores_gemma":[0.000042302432,0.00030923987,0.00008164156,0.0010520633,0.00042543365,0.0006190633,0.0006760534,0.00087548373,0.00011477191],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002119538,0.000019627454,0.00003024153,0.00007047483,0.000010134835,0.00002483512,0.00058228266,0.00014045628,0.0011926631,0.050532788,0.00013482147,0.94725955],"study_design_scores_gemma":[0.00013799773,0.000071505354,0.0026699337,0.00021936613,0.000014860634,0.0001701501,5.1468174e-7,0.72031796,0.0017241556,0.23497488,0.039017193,0.0006814778],"about_ca_topic_score_codex":0.000015886082,"about_ca_topic_score_gemma":0.000039370847,"teacher_disagreement_score":0.9465781,"about_ca_system_score_codex":0.0002207449,"about_ca_system_score_gemma":0.00015687897,"threshold_uncertainty_score":0.999936},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003692228,0.0012180561,0.9583688,0.0021244902,0.0019558524,0.00041237392,0.000020529049,0.000545388,0.03531758],"genre_scores_gemma":[0.6480228,0.000058122332,0.33887678,0.005737,0.00090417545,0.00004798215,0.000085875596,0.00019735856,0.006069934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546635,0.000016405107,0.0004975996,0.0019855136,0.0013554196,0.00067868753],"domain_scores_gemma":[0.9974884,0.00027892741,0.00016313086,0.0015924163,0.00020879072,0.0002683849],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004562311,0.0006344496,0.00043968615,0.0012043761,0.00018372104,0.002124402,0.0033219245,0.0002935254,0.000015818716],"category_scores_gemma":[0.00005002221,0.00055895303,0.00027479636,0.00091438915,0.0007693032,0.0013661428,0.00039084716,0.0008347071,0.00025420947],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000963403,0.000051812636,0.000011482449,0.00013955163,0.000014936888,0.00015074437,0.00018304752,0.014590335,0.0004249157,0.08152838,0.00034334772,0.90255183],"study_design_scores_gemma":[0.00035805046,0.0002527628,0.00034046842,0.001203429,0.00003490373,0.000069639056,1.2091348e-7,0.6532933,0.0038240477,0.3296311,0.00991249,0.0010796753],"about_ca_topic_score_codex":0.00001440972,"about_ca_topic_score_gemma":0.000031654483,"teacher_disagreement_score":0.90147215,"about_ca_system_score_codex":0.00073126424,"about_ca_system_score_gemma":0.0014202954,"threshold_uncertainty_score":0.9996862},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003045634,0.00039379176,0.99343175,0.001980596,0.0010274488,0.0012654277,0.000010030335,0.00025770612,0.0016027702],"genre_scores_gemma":[0.45535928,0.000109814515,0.5399998,0.0031380455,0.00055781787,0.00020788384,0.000040176452,0.00011309519,0.00047410582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630183,0.0000188336,0.0006476706,0.0017244264,0.0005814801,0.00072578306],"domain_scores_gemma":[0.99825984,0.00063691934,0.00013521468,0.0006708928,0.00015592005,0.00014123338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056956295,0.00051729137,0.00048171642,0.0009990551,0.00022062327,0.00038585972,0.0017790762,0.00026165246,0.0000078843805],"category_scores_gemma":[0.00004313182,0.0005050046,0.0001604053,0.0014029496,0.00044755297,0.0006715289,0.00033795572,0.0006734555,0.000018891253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008653525,0.000018838922,0.000018152468,0.00010819863,0.000009246601,0.00003197574,0.0010115716,0.30060297,0.00034898895,0.039165042,0.000021842814,0.6586545],"study_design_scores_gemma":[0.00024835562,0.00006661083,0.000007249601,0.00036739884,0.000006687592,0.000023997713,4.9767596e-7,0.7443005,0.0009636328,0.25206944,0.0015153312,0.00043031998],"about_ca_topic_score_codex":0.000014618902,"about_ca_topic_score_gemma":0.00018441748,"teacher_disagreement_score":0.65822417,"about_ca_system_score_codex":0.0004776552,"about_ca_system_score_gemma":0.00052144664,"threshold_uncertainty_score":0.9997402},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013331153,0.00017664427,0.9847214,0.00045693578,0.0040340316,0.0009221421,0.000075219774,0.00007786811,0.00820261],"genre_scores_gemma":[0.822097,0.00010890226,0.17479564,0.0003272382,0.00064211345,0.000039399456,0.0001769325,0.000065944376,0.0017468544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977665,0.00003228248,0.0005191563,0.0008559463,0.00044157548,0.0003845676],"domain_scores_gemma":[0.99880284,0.00028270597,0.00024214848,0.00037468332,0.00021412902,0.00008347606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073504134,0.00031962123,0.00039632365,0.0006606998,0.00011625871,0.000055415094,0.00035584488,0.00043495404,0.00018108531],"category_scores_gemma":[0.000028059105,0.0002909447,0.00020126143,0.0002113279,0.00034351068,0.000101038684,0.00006195855,0.00060110015,0.000031851934],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026653548,0.00006217577,0.0000172068,0.000120459656,0.000048557325,0.000013736256,0.00079616765,0.0048861695,0.00009654232,0.012183625,0.00003872386,0.98170996],"study_design_scores_gemma":[0.0023378767,0.0014265511,0.0035969608,0.0012615655,0.00023194143,0.00010371625,0.0000075848047,0.5855943,0.0027357119,0.39955,0.0021122869,0.0010415405],"about_ca_topic_score_codex":0.00022944785,"about_ca_topic_score_gemma":0.0008450712,"teacher_disagreement_score":0.9806684,"about_ca_system_score_codex":0.0002892727,"about_ca_system_score_gemma":0.00013816454,"threshold_uncertainty_score":0.9999543},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048883026,0.0009359609,0.98826754,0.00038637227,0.002765055,0.00031357628,0.0000013704844,0.00018294004,0.0066583315],"genre_scores_gemma":[0.7661593,0.00011753166,0.23018964,0.0008754884,0.00062912266,0.000035555222,0.000004697267,0.0000657867,0.0019229054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964454,0.000016095311,0.00048815215,0.0015198883,0.00090573065,0.0006247423],"domain_scores_gemma":[0.9986685,0.00006763145,0.0000875366,0.00097179384,0.000071495364,0.00013304834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006321975,0.00043089676,0.0003583455,0.0010395024,0.00012074937,0.0006226759,0.0019844,0.00023622288,0.00001897039],"category_scores_gemma":[0.000019153946,0.0003979839,0.000105302206,0.0006552029,0.00015939008,0.00048865855,0.0012028861,0.0007781615,0.00016851023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066727916,0.000046957517,0.000018592564,0.000062590276,0.00001410248,0.00049102254,0.0020146437,0.26523718,0.0004748461,0.033816937,0.000010209901,0.69780624],"study_design_scores_gemma":[0.00012970276,0.0000799059,0.0000030707142,0.0004990266,0.000002686048,0.000032229338,2.894541e-7,0.8397492,0.0015784774,0.15703407,0.0004956355,0.00039569897],"about_ca_topic_score_codex":0.00007323103,"about_ca_topic_score_gemma":0.000125592,"teacher_disagreement_score":0.7656704,"about_ca_system_score_codex":0.0005267737,"about_ca_system_score_gemma":0.0002555495,"threshold_uncertainty_score":0.99984723},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028165948,0.00085395016,0.96675545,0.0003736667,0.0030797182,0.00035486804,0.000016106971,0.00012445674,0.00027582646],"genre_scores_gemma":[0.95077467,0.0000339746,0.04688072,0.0016814681,0.0004545482,0.000004248239,0.0000025001764,0.0000514593,0.000116396506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641544,0.00004043242,0.00057424564,0.001790511,0.00057994254,0.0005994613],"domain_scores_gemma":[0.9978962,0.0010010741,0.00021061255,0.0006189954,0.0000697256,0.0002034188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036672296,0.0005308603,0.00059754064,0.00063696987,0.00018339304,0.00040566677,0.0013921338,0.0002730661,0.000013339881],"category_scores_gemma":[0.00013342086,0.00046283178,0.00012326372,0.000448585,0.0007675063,0.00026631902,0.0014732195,0.0009822845,0.000012379438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003742058,0.00004516335,0.00022989149,0.00011888302,0.000020657155,0.00029103653,0.0022874463,0.2668355,0.112097725,0.00097084645,0.000025009758,0.6170404],"study_design_scores_gemma":[0.00017001705,0.00016073289,0.00023764807,0.00080106204,0.000014659636,0.00006579986,3.7172293e-7,0.9681785,0.018019324,0.011738173,0.0001270311,0.00048668188],"about_ca_topic_score_codex":0.000079699166,"about_ca_topic_score_gemma":0.00010907536,"teacher_disagreement_score":0.92260873,"about_ca_system_score_codex":0.00009821548,"about_ca_system_score_gemma":0.00006652251,"threshold_uncertainty_score":0.9997823},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.536423,0.020932041,0.42145315,0.006916742,0.006745003,0.0033092177,0.00014739357,0.0011129018,0.0029605108],"genre_scores_gemma":[0.98028064,0.0001782248,0.018071573,0.00029898182,0.00044240998,0.000008163902,0.00005274237,0.000007080728,0.00066017406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769795,0.000013843281,0.0003271326,0.0010248655,0.00043905067,0.0004971808],"domain_scores_gemma":[0.99950427,0.000112689886,0.0000924474,0.000102818834,0.00007390178,0.00011388762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003079498,0.00041887275,0.0003541128,0.000105084,0.0003374261,0.00051785464,0.0004782176,0.0003204657,0.000036621408],"category_scores_gemma":[0.0000077138175,0.00017451035,0.00013836057,0.00044369564,0.00038763238,0.00027075296,0.00014824851,0.00058395596,0.000010159415],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005177228,0.000017485432,0.000043902375,0.0000671109,0.000013356655,0.000046106514,0.00050232676,0.00066892593,0.096716665,0.00040201243,0.0000015833942,0.90151536],"study_design_scores_gemma":[0.0007107165,0.0017557269,0.0068875514,0.007992302,0.00047189934,0.0010260865,0.000045384135,0.7155398,0.0034414986,0.21728846,0.039134603,0.0057059736],"about_ca_topic_score_codex":0.000058738497,"about_ca_topic_score_gemma":0.0025751353,"teacher_disagreement_score":0.89580935,"about_ca_system_score_codex":0.00015314012,"about_ca_system_score_gemma":0.00002937931,"threshold_uncertainty_score":0.71163255},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22750786,0.00208101,0.76691234,0.000032076918,0.0014888705,0.0005666991,0.0000063393422,0.00031315666,0.001091672],"genre_scores_gemma":[0.9846166,0.0005174524,0.0142069785,0.000048012815,0.00048724352,0.0000104985165,0.000020820322,0.00007281427,0.00001958278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998525,0.000021638123,0.00026016947,0.0005717578,0.0003568443,0.0002645374],"domain_scores_gemma":[0.9994615,0.00014995076,0.000073439485,0.000113406284,0.00012702297,0.00007470543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006149432,0.00029559722,0.0002300009,0.00058960577,0.00013163725,0.00028263422,0.00007056647,0.00029240077,0.00002121598],"category_scores_gemma":[0.00004041928,0.00031303923,0.000032318607,0.00017663643,0.00012323436,0.00036829244,0.00009175256,0.0007529761,0.0000257181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000572578,0.000001633856,0.000008928226,0.00011411186,0.000013686277,0.000012266703,0.00040817435,0.024620496,0.007188558,0.000004592207,6.1291075e-8,0.96762174],"study_design_scores_gemma":[0.00017015645,0.000049391216,0.0001606186,0.0006489791,0.00006746572,0.00023509041,6.1120056e-7,0.9843441,0.0028972307,0.010950734,0.00012347677,0.00035211342],"about_ca_topic_score_codex":0.000008896195,"about_ca_topic_score_gemma":0.000084146115,"teacher_disagreement_score":0.96726966,"about_ca_system_score_codex":0.00028575383,"about_ca_system_score_gemma":0.00002708158,"threshold_uncertainty_score":0.99993217},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8218181,0.0035880583,0.12177463,0.013307004,0.006324569,0.0039176713,0.0130036045,0.0023161012,0.013950225],"genre_scores_gemma":[0.9972742,0.00006885277,0.00093863724,0.00066873594,0.00035410444,0.000010621362,0.00049953867,0.000002526957,0.00018274064],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844444,0.0000101627265,0.00026292165,0.000662425,0.00031595194,0.0003040768],"domain_scores_gemma":[0.99915135,0.0005368606,0.0001075137,0.00011200246,0.000024229863,0.000068015266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104341765,0.00028575133,0.0002572627,0.00007267188,0.0002572426,0.00012491875,0.0005431463,0.0003627239,0.00046383528],"category_scores_gemma":[0.000022799402,0.00012646824,0.00008869415,0.00014037262,0.0005943238,0.0001721963,0.00023024163,0.00047067614,0.00019026858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009549233,0.00017186037,0.0027583977,0.000050619296,0.00020787441,0.00065925537,0.001839235,0.0445657,0.18623951,0.050236937,0.00015519561,0.7130199],"study_design_scores_gemma":[0.0003000569,0.0004919254,0.005223103,0.00040070136,0.00007049668,0.00003753683,0.0000051904462,0.25535285,0.006896548,0.7265004,0.0035800233,0.0011411438],"about_ca_topic_score_codex":0.000049728096,"about_ca_topic_score_gemma":0.0007654982,"teacher_disagreement_score":0.7118788,"about_ca_system_score_codex":0.00018393167,"about_ca_system_score_gemma":0.000036246005,"threshold_uncertainty_score":0.51572245},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002232777,0.00055625406,0.98892605,0.0004614191,0.0013752611,0.00044973177,0.000009315783,0.0005047663,0.00749395],"genre_scores_gemma":[0.5578944,0.00019639729,0.43884793,0.001083481,0.0003710893,0.000023198483,0.000025991885,0.00006301019,0.0014945177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961841,0.000038054262,0.00063594343,0.0017212108,0.00076092477,0.00065974233],"domain_scores_gemma":[0.9982836,0.00019604558,0.00020549113,0.0010690552,0.000110290835,0.00013550735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082760316,0.0005539467,0.00050450413,0.0017177018,0.00016079664,0.00088422233,0.0029603832,0.0003363852,0.000018008852],"category_scores_gemma":[0.000032528755,0.0005291394,0.00013628896,0.0009763945,0.00029300447,0.0006028646,0.0019817066,0.00089314085,0.000085173364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014392147,0.00017488905,0.001112835,0.00017700007,0.000036682733,0.0008054364,0.0018850628,0.22803085,0.00021759928,0.08207835,0.0003259057,0.685141],"study_design_scores_gemma":[0.00029287793,0.00018639171,0.0002924616,0.0012388965,0.000007706289,0.00009825545,3.3109427e-7,0.88357186,0.0025585087,0.10981492,0.0010551761,0.00088260206],"about_ca_topic_score_codex":0.00009147604,"about_ca_topic_score_gemma":0.00006638922,"teacher_disagreement_score":0.6842584,"about_ca_system_score_codex":0.00057435205,"about_ca_system_score_gemma":0.00037701183,"threshold_uncertainty_score":0.99971604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023264209,0.00026366595,0.9917544,0.0011892094,0.0018118965,0.0006771377,0.000012149213,0.0011514697,0.0031167977],"genre_scores_gemma":[0.08701501,0.000014611976,0.9105374,0.001341438,0.0004078301,0.000010814425,0.000030211824,0.000052836116,0.00058980536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954091,0.00004705341,0.0008532546,0.002063641,0.00086271414,0.00076424255],"domain_scores_gemma":[0.99736524,0.00036973067,0.00029149785,0.0012645402,0.0004465802,0.00026238622],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012547891,0.0006879006,0.0006248991,0.0012146408,0.00045445893,0.002247325,0.0038717298,0.00034848085,0.000011638345],"category_scores_gemma":[0.00018831312,0.0006395778,0.00015753813,0.0014503354,0.00023518396,0.0006170862,0.0030746623,0.0011515428,0.00010962222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034306206,0.000032463926,0.000017547294,0.000051685693,0.000015381382,0.00007955945,0.0012843698,0.45197657,0.00010989116,0.042452652,0.00020224358,0.5037742],"study_design_scores_gemma":[0.00014162208,0.00012823714,0.000029761417,0.00092530897,0.000006706727,0.00004343954,4.150812e-7,0.9664725,0.0015891291,0.02831159,0.0016194516,0.00073183177],"about_ca_topic_score_codex":0.000037697835,"about_ca_topic_score_gemma":0.000059824502,"teacher_disagreement_score":0.5144959,"about_ca_system_score_codex":0.0005447446,"about_ca_system_score_gemma":0.00042957198,"threshold_uncertainty_score":0.99960554},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015385289,0.023696672,0.96668637,0.0016028102,0.0029397337,0.00033744163,0.000006890019,0.00028064955,0.004434057],"genre_scores_gemma":[0.080354564,0.0002918479,0.9089511,0.0030393992,0.0005916051,0.000012711,0.0000015365745,0.00007472017,0.006682534],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671954,0.0000338019,0.0005093466,0.0011905581,0.0011083196,0.0004384527],"domain_scores_gemma":[0.9973895,0.00029170344,0.00027171004,0.001759444,0.00020943429,0.000078191624],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009005225,0.00043992815,0.0004625367,0.00050049275,0.00015009104,0.00047085388,0.0057611014,0.0003221183,0.000034565386],"category_scores_gemma":[0.000089536305,0.0002835725,0.00024024618,0.001135707,0.0007541046,0.00044524088,0.0028423266,0.0015269812,0.000035419223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002278183,0.000020602854,0.000012630259,0.00041426093,0.000016896362,0.00006439644,0.000983679,0.0004247835,0.0004994765,0.29880118,0.00033417004,0.69842565],"study_design_scores_gemma":[0.000061756116,0.00006156128,0.000017082753,0.0022672804,0.000015833828,0.000085295935,9.364948e-8,0.050152075,0.01172627,0.9307709,0.00440169,0.00044017576],"about_ca_topic_score_codex":0.00002298936,"about_ca_topic_score_gemma":0.000043834338,"teacher_disagreement_score":0.6979855,"about_ca_system_score_codex":0.00019673872,"about_ca_system_score_gemma":0.00046872557,"threshold_uncertainty_score":0.9999616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014130516,0.00073124666,0.99245787,0.0012978739,0.00078034133,0.00047238896,7.9735764e-7,0.00018447315,0.0026619495],"genre_scores_gemma":[0.79868454,0.000046713314,0.19884829,0.0012218087,0.00030498047,0.00003491659,0.0000039469755,0.00005325961,0.0008015535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642485,0.000054426113,0.00045466018,0.0014934818,0.000986157,0.00058639684],"domain_scores_gemma":[0.9982721,0.0003872518,0.0001733551,0.0009629716,0.00011876969,0.00008551429],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010394246,0.0004424432,0.00035250335,0.00076469633,0.00025685292,0.00094799115,0.00257213,0.00016094836,0.000013007344],"category_scores_gemma":[0.000037800055,0.0003109778,0.00007460478,0.0011052124,0.00043223286,0.00059474865,0.00089231017,0.0014194794,0.000034137942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048455986,0.000010579793,0.0005177302,0.00006380558,0.0000108607655,0.00014419864,0.003682666,0.3808968,0.00023385308,0.024552347,0.000004384006,0.5898779],"study_design_scores_gemma":[0.0002097316,0.00010101175,0.00015099673,0.00097600283,0.000007457056,0.00007179611,0.0000023749235,0.9098453,0.00043991054,0.087582655,0.00016557793,0.00044720893],"about_ca_topic_score_codex":0.00011215238,"about_ca_topic_score_gemma":0.0003241881,"teacher_disagreement_score":0.7972715,"about_ca_system_score_codex":0.00027162145,"about_ca_system_score_gemma":0.0003870577,"threshold_uncertainty_score":0.99993426},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048057285,0.001933422,0.9794727,0.0024684563,0.010015672,0.0007166126,0.0000053128642,0.00042628293,0.004913463],"genre_scores_gemma":[0.15154962,0.00004050645,0.83895046,0.0033742993,0.0021464673,0.0000510115,0.000002270247,0.00009698993,0.0037883932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940926,0.000040329316,0.0006975008,0.002473305,0.0017997443,0.0008965465],"domain_scores_gemma":[0.99607384,0.00057960063,0.00017759054,0.002512638,0.0003111519,0.00034514986],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017384684,0.0006518309,0.0006722755,0.0011291528,0.00020970752,0.0018472807,0.0050189216,0.00046809737,0.000020657308],"category_scores_gemma":[0.0001805743,0.00057774613,0.00015958198,0.0009965061,0.00024483397,0.00042413152,0.0027182407,0.001493805,0.0005937876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030479323,0.000010896659,0.0000058291216,0.00012586296,0.000019149826,0.00029045405,0.0015516469,0.41275996,0.00004023013,0.30644807,0.00008745987,0.2786574],"study_design_scores_gemma":[0.000063050255,0.000077961406,0.000004037346,0.0013490682,0.000009368422,0.00008429433,1.7008867e-7,0.7002108,0.000059421003,0.29345423,0.004170268,0.0005173249],"about_ca_topic_score_codex":0.000041379506,"about_ca_topic_score_gemma":0.000018278237,"teacher_disagreement_score":0.28745085,"about_ca_system_score_codex":0.0005490846,"about_ca_system_score_gemma":0.0006957491,"threshold_uncertainty_score":0.9996674},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032999273,0.0009457316,0.9941105,0.0018377308,0.001409979,0.00071136944,0.00006327953,0.0002718678,0.00031954455],"genre_scores_gemma":[0.108213075,0.00006014789,0.89034986,0.0006010678,0.0004095879,0.000016440943,0.000023909768,0.00006584477,0.00026005236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939335,0.000047879712,0.00059192686,0.0031668656,0.0013337862,0.00092605053],"domain_scores_gemma":[0.9953801,0.0007787968,0.00015889334,0.003082634,0.00023058656,0.00036899635],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013113068,0.0006317195,0.0006185465,0.0005717136,0.0003551044,0.0018094061,0.004804259,0.0003351875,0.000012312415],"category_scores_gemma":[0.00027222946,0.00062339386,0.000050307863,0.0009782364,0.00064262544,0.0016263615,0.012084419,0.0014461271,0.00004624552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025101655,0.000041965075,0.000022047172,0.00036343228,0.000024174273,0.00013254448,0.002870025,0.059400767,0.0024481162,0.0018534361,0.000054710774,0.9327637],"study_design_scores_gemma":[0.00008080672,0.00013189694,0.0000166035,0.0009483145,0.000005502766,0.000067876346,6.9772784e-7,0.95219,0.002080182,0.042450033,0.0013726283,0.0006555047],"about_ca_topic_score_codex":0.0000750909,"about_ca_topic_score_gemma":0.0002187171,"teacher_disagreement_score":0.93210816,"about_ca_system_score_codex":0.0005100823,"about_ca_system_score_gemma":0.00038232628,"threshold_uncertainty_score":0.99962175},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002688728,0.0006108862,0.98726875,0.0022172546,0.0016453026,0.0011494644,0.0000071986096,0.00067962206,0.0037328226],"genre_scores_gemma":[0.9206426,0.00003347545,0.07657264,0.001477622,0.0005164772,0.00007506978,0.0000044613416,0.000058677153,0.00061895576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99521995,0.00003623753,0.00057836814,0.0024749262,0.0010092442,0.00068125885],"domain_scores_gemma":[0.99644136,0.0004826427,0.00021291572,0.002442218,0.00024091262,0.00017996495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004980816,0.0006806231,0.00064005854,0.0014898415,0.000516466,0.0004791001,0.004038209,0.00049036666,0.000019951509],"category_scores_gemma":[0.000029291148,0.00059429946,0.00016412638,0.0011861777,0.00067542086,0.00014550048,0.0024784917,0.00180074,0.00012848442],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000942161,0.00036227147,0.000055173485,0.000065526525,0.000062946885,0.0005791136,0.004153734,0.009832517,0.00021493093,0.279939,0.00008041383,0.704645],"study_design_scores_gemma":[0.00038410048,0.00090880226,0.00027470168,0.00050486275,0.000022643782,0.000111449146,0.0000033901456,0.5810983,0.00040957384,0.40853485,0.0067465897,0.0010007418],"about_ca_topic_score_codex":0.000017468154,"about_ca_topic_score_gemma":0.000036355068,"teacher_disagreement_score":0.9179539,"about_ca_system_score_codex":0.00030618955,"about_ca_system_score_gemma":0.00033040522,"threshold_uncertainty_score":0.99965084},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019132342,0.0004511775,0.9747674,0.0028553447,0.0018629926,0.0003392313,0.000016147274,0.00010334673,0.00047200118],"genre_scores_gemma":[0.99210817,0.000028882556,0.0059424466,0.0013492622,0.0004737024,0.0000048467323,0.00001545631,0.000015615922,0.00006159694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726015,0.00003703633,0.00046111873,0.0010199657,0.00076418626,0.0004575118],"domain_scores_gemma":[0.9987626,0.0004305449,0.0001437647,0.00050059165,0.000077994635,0.000084522646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007967986,0.0003822084,0.0003511556,0.0005565395,0.00013164454,0.00090483297,0.0016124161,0.00016197684,0.0000039042775],"category_scores_gemma":[0.000058605197,0.00025656444,0.000100511694,0.00049184903,0.00034993814,0.00032265906,0.00044250392,0.0008049587,0.000012665381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018225557,0.0002624307,0.0022737645,0.00018386035,0.00007433648,0.0006915877,0.019370055,0.16251963,0.00002550022,0.5104576,0.000049778355,0.30407327],"study_design_scores_gemma":[0.00013757627,0.00024519485,0.005073795,0.000834801,0.000014722746,0.00003639131,0.0000018624868,0.98869455,0.000029632383,0.004090089,0.00044488325,0.0003965006],"about_ca_topic_score_codex":0.00020252605,"about_ca_topic_score_gemma":0.013335355,"teacher_disagreement_score":0.97297585,"about_ca_system_score_codex":0.00016035959,"about_ca_system_score_gemma":0.00012760116,"threshold_uncertainty_score":0.9999887},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042962056,0.000721281,0.9942243,0.0005328206,0.0008207042,0.0002011189,0.0000033579108,0.00018387163,0.0028828948],"genre_scores_gemma":[0.9266931,0.000037261456,0.07212223,0.00024459668,0.0002844111,0.0000071172476,0.000005160667,0.0000330998,0.00057305285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965694,0.000026404558,0.000459725,0.0016729728,0.00079172314,0.00047979824],"domain_scores_gemma":[0.99865156,0.00025010816,0.00018617322,0.00060632935,0.00017823784,0.00012760625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006996394,0.00048405168,0.0005069836,0.0005735701,0.00019210202,0.00083968684,0.0015605909,0.00020170506,0.000010239334],"category_scores_gemma":[0.000022981974,0.00036931486,0.00010107584,0.00054451043,0.0003979349,0.00042994457,0.000414225,0.00059604057,0.000020145719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017271403,0.000031789023,0.000057330482,0.00020195622,0.00008980346,0.00020501723,0.0040484495,0.17662968,0.00012067323,0.15502536,0.000018500103,0.6635542],"study_design_scores_gemma":[0.00013412202,0.00014721653,0.000095248746,0.0010418836,0.00003713001,0.00006979002,4.59862e-7,0.9939593,0.0004615051,0.0025815533,0.00090909126,0.0005627099],"about_ca_topic_score_codex":0.000016468455,"about_ca_topic_score_gemma":0.0002743111,"teacher_disagreement_score":0.92626345,"about_ca_system_score_codex":0.00016658967,"about_ca_system_score_gemma":0.00019036938,"threshold_uncertainty_score":0.9998759},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009072662,0.0018799264,0.9917418,0.00059353135,0.0024876462,0.00020976237,0.0000014647719,0.00039196998,0.0026032196],"genre_scores_gemma":[0.92434597,0.000024561223,0.06917243,0.0013595251,0.0014378788,0.000009456176,0.00000811593,0.00005479609,0.0035872555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994449,0.000068512265,0.0006951821,0.0021762024,0.0012195553,0.0013915397],"domain_scores_gemma":[0.9981946,0.00041546996,0.00025030784,0.00077545235,0.00020491265,0.00015930305],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016875301,0.0006229279,0.0006654546,0.0011454422,0.00024043249,0.0015329539,0.00492821,0.00035303825,0.00002327786],"category_scores_gemma":[0.00010015739,0.00054048793,0.00032340226,0.0019545704,0.00036850577,0.00053019874,0.0018067147,0.0019765368,0.00028922752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019974473,0.000034980825,0.000007863049,0.000108052634,0.00005821687,0.00023708533,0.001787988,0.15834342,0.000020445705,0.39213043,0.00083349,0.44643602],"study_design_scores_gemma":[0.00008431211,0.00010265779,0.000004067361,0.00050707505,0.000019575495,0.00008476846,1.7605889e-7,0.98233587,0.00011070066,0.011227876,0.004932324,0.0005906189],"about_ca_topic_score_codex":0.000009579837,"about_ca_topic_score_gemma":0.0002162417,"teacher_disagreement_score":0.92425525,"about_ca_system_score_codex":0.0010387357,"about_ca_system_score_gemma":0.0021052512,"threshold_uncertainty_score":0.99970466},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000038593757,0.0010305097,0.9736469,0.0003237211,0.0019312226,0.00021352406,0.000017891756,0.0020981259,0.020734256],"genre_scores_gemma":[0.8913181,0.0038010732,0.09544245,0.0009780797,0.0020315144,0.000033241227,0.00012866221,0.00023869924,0.006028165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986691,0.0000025961197,0.0002187101,0.00048258176,0.00036094873,0.00026607548],"domain_scores_gemma":[0.9987563,0.00009196862,0.000027707229,0.0010517413,0.000025169053,0.00004711907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038544915,0.00021857522,0.00015170826,0.00026682665,0.000098813485,0.0003450669,0.0017864284,0.00011715022,0.000004148391],"category_scores_gemma":[0.000017298384,0.0001600736,0.00003248013,0.00022662476,0.00027814525,0.00014978363,0.0008049828,0.0005156896,0.0000387144],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001327628,0.0000042238803,0.0000015551866,0.00012454668,0.000044198863,0.0000739008,0.00010109568,0.04881856,0.000019183839,0.021403898,0.008257347,0.92115015],"study_design_scores_gemma":[0.000024555018,0.000012075683,0.000011693703,0.00015845541,0.000013994197,0.000012923067,6.0529246e-8,0.8272637,0.000049762784,0.023792775,0.14847855,0.00018140978],"about_ca_topic_score_codex":0.0000019425308,"about_ca_topic_score_gemma":0.00007522818,"teacher_disagreement_score":0.9209688,"about_ca_system_score_codex":0.00012449017,"about_ca_system_score_gemma":0.000049598613,"threshold_uncertainty_score":0.65276116},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75863916,0.00053656986,0.23015086,0.004362074,0.0006346973,0.0019152127,0.000002549284,0.00008769331,0.0036711867],"genre_scores_gemma":[0.9907436,0.000014441284,0.0076942984,0.0010210052,0.000394822,0.000024374905,0.0000017248346,0.000015690779,0.000090061745],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988429,0.0000026264672,0.00013764358,0.00048810634,0.00026918162,0.0002595732],"domain_scores_gemma":[0.99938464,0.0002688071,0.00006270401,0.0002309084,0.000027267275,0.000025673091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005132682,0.00019603242,0.00027669617,0.00038100645,0.00011345808,0.00014882516,0.0001794271,0.000089584115,0.000002103201],"category_scores_gemma":[0.000030850595,0.00013523875,0.0000869012,0.0002301523,0.00016889998,0.0001591943,0.00013279213,0.00054294977,8.004018e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006169561,0.00003249622,0.0015521285,0.00051333435,0.000022474847,0.00007070928,0.005087048,0.000097065604,0.00014579167,0.005556884,0.0000037704413,0.9868566],"study_design_scores_gemma":[0.0013229483,0.0016756004,0.009946795,0.01001023,0.00026253655,0.00027910256,0.000020913081,0.26161912,0.009299414,0.7027325,0.0017583139,0.0010725058],"about_ca_topic_score_codex":0.0000109849725,"about_ca_topic_score_gemma":0.000014332791,"teacher_disagreement_score":0.9857841,"about_ca_system_score_codex":0.000029311259,"about_ca_system_score_gemma":0.000097694414,"threshold_uncertainty_score":0.5514876},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006123745,0.0020243744,0.9944787,0.00006490717,0.0013904005,0.00026666984,0.000059222188,0.00028029183,0.001374217],"genre_scores_gemma":[0.1630796,0.0003191936,0.8331115,0.00060381193,0.0015933914,0.00003831424,0.00014227333,0.00019766027,0.0009142489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982351,0.000006811639,0.00039183267,0.0006915871,0.00028525703,0.00038938588],"domain_scores_gemma":[0.99921095,0.00018759666,0.000058907164,0.00035887468,0.0001103429,0.000073351046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041997214,0.0003796983,0.00045653232,0.00060554704,0.00013146104,0.00025153652,0.0004146979,0.00021002989,0.00002436735],"category_scores_gemma":[0.000031269108,0.00035370488,0.00021250569,0.0002787359,0.00013067358,0.000113773676,0.0001103333,0.0005032029,0.00009131394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001281439,0.000003816656,7.980292e-7,0.00019817642,0.000025373487,0.000009069083,0.00022961736,0.5284205,0.00034804712,0.00002788432,0.000017871462,0.47071758],"study_design_scores_gemma":[0.00011363108,0.000025781479,9.591955e-7,0.00083702954,0.00005838018,0.000010658135,1.3980123e-7,0.9798278,0.0003450275,0.01599655,0.0023586955,0.00042534884],"about_ca_topic_score_codex":0.000008749565,"about_ca_topic_score_gemma":0.00011548193,"teacher_disagreement_score":0.4702922,"about_ca_system_score_codex":0.00018893275,"about_ca_system_score_gemma":0.00005604463,"threshold_uncertainty_score":0.9998915},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04257062,0.00047936832,0.93449163,0.007946866,0.007237374,0.0015880358,0.000024725721,0.00033435714,0.005327032],"genre_scores_gemma":[0.98620653,0.000036974958,0.005714143,0.0051993662,0.0019615418,0.00003611238,0.0000043538053,0.000073360665,0.0007676002],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99559283,0.00015247652,0.0007189687,0.0018691414,0.0009512709,0.00071529107],"domain_scores_gemma":[0.9879013,0.0107453205,0.00028284424,0.0008802625,0.000065391345,0.00012493266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009781301,0.0006176426,0.0005423811,0.0010179451,0.000408806,0.0009425343,0.0017971409,0.00030185483,0.000016286238],"category_scores_gemma":[0.00081562833,0.00041755164,0.0001693033,0.0009086178,0.0007708737,0.00053122896,0.0010213901,0.002068562,0.000100753925],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002616927,0.00014174462,0.00024896997,0.00017786771,0.000041451116,0.0016647824,0.0123589365,0.12645318,0.013918242,0.058703117,0.0044250446,0.78160495],"study_design_scores_gemma":[0.00047545426,0.00108557,0.00031926844,0.011184833,0.00002799699,0.00021470389,0.0000077467985,0.33331403,0.013664243,0.6074632,0.030590257,0.0016527057],"about_ca_topic_score_codex":0.00002499246,"about_ca_topic_score_gemma":0.00016138572,"teacher_disagreement_score":0.94363594,"about_ca_system_score_codex":0.00037579876,"about_ca_system_score_gemma":0.0002383372,"threshold_uncertainty_score":0.9998276},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061674286,0.00060813414,0.9872357,0.00004530372,0.001829707,0.00067517033,7.754276e-7,0.00016837523,0.0032693988],"genre_scores_gemma":[0.9768119,0.000018652092,0.02279222,0.00003799595,0.00016104557,0.00002638623,6.136496e-7,0.000027622615,0.000123564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613357,0.0000822722,0.0007052004,0.0015958435,0.0010210745,0.00046207037],"domain_scores_gemma":[0.99812424,0.0003672274,0.00034339094,0.00086824043,0.00021408434,0.00008281959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008778174,0.00046970986,0.00070657494,0.0017231003,0.00014874758,0.00027581843,0.0018698104,0.00026484954,0.0000063258153],"category_scores_gemma":[0.000022834036,0.0004584724,0.00009603727,0.0014377577,0.00031023854,0.0008146521,0.0011121588,0.0014743557,0.000020679032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011802766,0.000052342373,0.000043976557,0.000036531503,0.0000163749,0.000045796492,0.0093073975,0.6649181,0.0001674141,0.0018904508,2.9923615e-7,0.3235095],"study_design_scores_gemma":[0.00027414146,0.00089819933,0.00014098475,0.00023574008,0.0000098751325,0.000030517043,0.000007448039,0.87608695,0.0020470184,0.119848326,0.000039402505,0.00038140986],"about_ca_topic_score_codex":0.00017262429,"about_ca_topic_score_gemma":0.0028003918,"teacher_disagreement_score":0.9706445,"about_ca_system_score_codex":0.000745473,"about_ca_system_score_gemma":0.00018566789,"threshold_uncertainty_score":0.9997867},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16817157,0.009720291,0.79022574,0.00089451805,0.0077229575,0.007930581,0.014443338,0.00055473903,0.00033624098],"genre_scores_gemma":[0.9915521,0.00010619669,0.00428994,0.0004666548,0.0013115901,0.00008569058,0.0018434094,0.00007618142,0.00026819643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633926,0.000040759413,0.0005475835,0.0019389559,0.0007372877,0.00039617377],"domain_scores_gemma":[0.99789953,0.0004776241,0.0001769987,0.0008477837,0.00009382402,0.0005042551],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005589006,0.0005318237,0.00065325294,0.00043866513,0.0002658847,0.00016954345,0.00029774557,0.00019468658,0.00005117444],"category_scores_gemma":[0.00015799807,0.0004169798,0.00023592339,0.00016963998,0.0002330039,0.00010722587,0.00031200942,0.0009197138,0.000051750812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002488361,0.0029644158,0.2901377,0.0003528949,0.0009589131,0.11523397,0.0006342211,0.0039271805,0.0000072581115,0.00036348237,0.00033376727,0.58259785],"study_design_scores_gemma":[0.012613044,0.014440515,0.11111218,0.0051982114,0.0048738397,0.0017513977,0.000007651732,0.7241446,0.00004357322,0.043542698,0.080321565,0.0019507377],"about_ca_topic_score_codex":0.00012553306,"about_ca_topic_score_gemma":0.00016198352,"teacher_disagreement_score":0.8233806,"about_ca_system_score_codex":0.00027884843,"about_ca_system_score_gemma":0.00040279908,"threshold_uncertainty_score":0.9998282},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000110647,0.0015837713,0.9877759,0.0028317804,0.0016851499,0.0009974322,0.00011838057,0.00025031454,0.004756125],"genre_scores_gemma":[0.0019447668,0.00005477863,0.9938326,0.0010566574,0.0008919921,0.000039740582,0.00007425791,0.00008582648,0.002019402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939955,0.000029585193,0.0006514929,0.00319003,0.0012611066,0.0008723132],"domain_scores_gemma":[0.99574757,0.00037280386,0.00029709216,0.0029673486,0.00036418473,0.00025101833],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016110742,0.00078847416,0.00078330515,0.0007359642,0.00032983394,0.0010121706,0.005879944,0.0004423201,0.000013705376],"category_scores_gemma":[0.000024919384,0.00059370976,0.00016351102,0.00062441546,0.00055701955,0.0014481941,0.0034362937,0.0010557931,0.000011391935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029815485,0.000045864366,0.0000017114993,0.00032136156,0.00007519617,0.00016392743,0.00046117904,0.24100517,0.000035559082,0.34264624,0.0005601296,0.41465387],"study_design_scores_gemma":[0.00018531865,0.00013568993,9.3437774e-7,0.00047208008,0.000027313217,0.00015711533,6.638216e-8,0.6377426,0.00008395129,0.35757795,0.0030880878,0.00052890246],"about_ca_topic_score_codex":0.000014055308,"about_ca_topic_score_gemma":0.00015696003,"teacher_disagreement_score":0.41412497,"about_ca_system_score_codex":0.00022372224,"about_ca_system_score_gemma":0.0010688168,"threshold_uncertainty_score":0.99965143},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018956722,0.0009001402,0.9847596,0.00076919,0.0021419022,0.00083517993,0.000011167476,0.000909761,0.009671163],"genre_scores_gemma":[0.003752358,0.000058043854,0.9898759,0.0009103166,0.0004982751,0.00004843622,0.0000065868153,0.00005464113,0.00479544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963569,0.000021128279,0.00054084975,0.0018598777,0.00054034486,0.0006808921],"domain_scores_gemma":[0.99745154,0.00061504997,0.00023700816,0.001161889,0.00038523463,0.00014929552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086762663,0.00056935026,0.00056055974,0.0011126577,0.00035138833,0.0009885571,0.0030297122,0.00037200993,0.000008164034],"category_scores_gemma":[0.00011914742,0.00052223646,0.00020825751,0.00083835673,0.00044667633,0.0003825795,0.0013020043,0.0006603354,0.00002156102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022802054,0.000064855456,0.000007917122,0.00023950261,0.00006460327,0.00005489527,0.001542572,0.057278432,0.00032477046,0.17810534,0.0008662515,0.76142806],"study_design_scores_gemma":[0.00014477938,0.00020579794,0.0000027121887,0.00024823038,0.000008005797,0.000023182334,5.3805923e-8,0.73466796,0.0008139811,0.25837952,0.005035295,0.00047051348],"about_ca_topic_score_codex":0.000010892714,"about_ca_topic_score_gemma":0.000020546235,"teacher_disagreement_score":0.76095754,"about_ca_system_score_codex":0.00034120536,"about_ca_system_score_gemma":0.00070415635,"threshold_uncertainty_score":0.9997229},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007750127,0.03203927,0.95355386,0.0019852447,0.002599761,0.00071877864,0.0000023127236,0.0003976909,0.00869532],"genre_scores_gemma":[0.078870155,0.0062608737,0.9041238,0.0063545946,0.0019300297,0.00028611213,0.00000840118,0.00016800105,0.0019980443],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99482423,0.0003435742,0.0007620235,0.0018201127,0.0014220093,0.000828042],"domain_scores_gemma":[0.9963903,0.0010844674,0.0002746482,0.0020145248,0.00015084284,0.000085220425],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0036190024,0.0005830996,0.00058545044,0.0011137829,0.00017168133,0.0016467433,0.007983454,0.0003339856,0.000005702814],"category_scores_gemma":[0.00016642212,0.00040602143,0.00011584873,0.0028075892,0.00057898887,0.0013111988,0.0016740214,0.0017668931,0.000052964864],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002060834,0.000028434704,0.00000986627,0.00013660197,0.0000040033574,0.00024122665,0.004028749,0.0042633982,0.000070258306,0.0064012837,0.0010979358,0.9837162],"study_design_scores_gemma":[0.00017508323,0.00025586688,0.000020687738,0.0040590805,0.000009576563,0.00031358885,0.000002866527,0.25736105,0.003438923,0.5537482,0.17950305,0.0011119974],"about_ca_topic_score_codex":0.000009042787,"about_ca_topic_score_gemma":0.00016156324,"teacher_disagreement_score":0.9826042,"about_ca_system_score_codex":0.0009980332,"about_ca_system_score_gemma":0.0011434046,"threshold_uncertainty_score":0.9998392},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035412994,0.0013034852,0.9869872,0.00082486594,0.0022128944,0.0006324334,0.00046750833,0.00031019608,0.0037201324],"genre_scores_gemma":[0.1403813,0.00017497817,0.8542029,0.0006717634,0.0016158314,0.00006060937,0.00007724216,0.00013352955,0.0026817855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959629,0.00008452241,0.0007859504,0.0016639835,0.0006871457,0.0008154651],"domain_scores_gemma":[0.9957796,0.0024334234,0.00028217144,0.0010600238,0.00018673163,0.00025809903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013914065,0.000766414,0.0010153513,0.00048670865,0.00029579055,0.00038312902,0.0013692472,0.000674519,0.00010686564],"category_scores_gemma":[0.0007056758,0.00061347324,0.00034775393,0.0005114357,0.0006366126,0.00012045601,0.001081059,0.001342935,0.0000037522268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009020743,0.0002225071,0.00028713042,0.0006891574,0.00035278362,0.00046660219,0.00258296,0.004302081,0.0059486004,0.7209306,0.0006021145,0.26352525],"study_design_scores_gemma":[0.00033112176,0.00016985169,0.00008208776,0.0016558925,0.00012904622,0.000043808857,0.0000019759063,0.12276934,0.0011954231,0.86495936,0.007347332,0.0013147666],"about_ca_topic_score_codex":0.00014861092,"about_ca_topic_score_gemma":0.0006068702,"teacher_disagreement_score":0.2622105,"about_ca_system_score_codex":0.0004828133,"about_ca_system_score_gemma":0.00031917627,"threshold_uncertainty_score":0.99963164},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005990673,0.00034588017,0.989467,0.0017632624,0.004605548,0.001374306,0.000049307477,0.0007087131,0.0016799557],"genre_scores_gemma":[0.013341301,0.000050435992,0.9795948,0.0015499515,0.0032007047,0.00030057807,0.00006525707,0.00008560837,0.0018113126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99550354,0.000049592087,0.00060089945,0.0022046396,0.0009786534,0.000662677],"domain_scores_gemma":[0.9964845,0.00097074267,0.00036661891,0.0015013561,0.00053138775,0.00014534804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008794517,0.00063135376,0.00054150424,0.000673548,0.0004974358,0.00059732463,0.0024709802,0.00040815712,0.00002259434],"category_scores_gemma":[0.0002505315,0.00058427826,0.0002552728,0.0007333142,0.0003994233,0.0007607479,0.0011596571,0.0008980226,0.000034344226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010140371,0.000028716107,0.0000025717006,0.00010332486,0.000047408317,0.000027215898,0.00047580348,0.3800107,0.00027127453,0.36124277,0.000557375,0.25713146],"study_design_scores_gemma":[0.00023364028,0.0003023542,0.00000961436,0.000420378,0.000014125115,0.000014543854,2.6260543e-7,0.3940767,0.002560065,0.5942679,0.0075900108,0.00051040686],"about_ca_topic_score_codex":0.000012799749,"about_ca_topic_score_gemma":0.000052606305,"teacher_disagreement_score":0.25662106,"about_ca_system_score_codex":0.00076352083,"about_ca_system_score_gemma":0.00040879156,"threshold_uncertainty_score":0.99966085},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044173954,0.0007897961,0.99408495,0.0035378851,0.00015622842,0.00029833056,0.0000028416773,0.000099469566,0.00058876787],"genre_scores_gemma":[0.6381649,0.000048413225,0.36140588,0.00026484282,0.000048189086,0.000014183466,9.589007e-7,0.000010665569,0.000041948202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833596,0.000018680004,0.0002488862,0.00082059216,0.00034657406,0.00022929684],"domain_scores_gemma":[0.9983249,0.0002845446,0.00012683886,0.0010448608,0.0001733549,0.0000455397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010053881,0.0002219539,0.0002742646,0.00027929546,0.00017693703,0.0001596995,0.0015010772,0.00022045185,0.0000011850902],"category_scores_gemma":[0.000020323452,0.00014522728,0.000037941154,0.0004086878,0.000644617,0.00014783243,0.0005662176,0.00065374014,0.000002901329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037511727,0.0000162873,0.000006046875,0.000039121394,0.000016448173,0.0000074411237,0.00086685154,0.035315167,0.00025478413,0.58989644,0.0000046149557,0.37357306],"study_design_scores_gemma":[0.000051617262,0.00004255203,0.000012323538,0.00007453035,0.000008971066,0.000036035774,2.7733603e-7,0.73923683,0.00094753836,0.2590953,0.00036410202,0.00012991084],"about_ca_topic_score_codex":0.000035402187,"about_ca_topic_score_gemma":0.00009666007,"teacher_disagreement_score":0.7039217,"about_ca_system_score_codex":0.00004795376,"about_ca_system_score_gemma":0.00018177595,"threshold_uncertainty_score":0.59221965},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009070027,0.00036663632,0.99209964,0.00077683723,0.0008790087,0.000676097,0.00001205392,0.0007750084,0.004324044],"genre_scores_gemma":[0.39907202,0.00010424187,0.5979758,0.0013791473,0.0006470943,0.00007624998,0.000010783831,0.00013202304,0.00060268055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951865,0.000029630964,0.000598701,0.0022187456,0.0012509706,0.0007154294],"domain_scores_gemma":[0.9969622,0.00042958028,0.0002350643,0.0016713056,0.0003979338,0.0003039449],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00060932594,0.00072005397,0.00065824995,0.0019606953,0.0003162204,0.001575707,0.0029106922,0.0003102532,0.000027146732],"category_scores_gemma":[0.00005266692,0.0005995749,0.00014257882,0.0020064078,0.0005442996,0.0005905505,0.0016770684,0.00064416975,0.00010187684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000082236,0.000040633047,0.00018689105,0.00011976063,0.000027921491,0.00010634575,0.00047824226,0.009285087,0.000030549294,0.28490826,0.00006642393,0.70474166],"study_design_scores_gemma":[0.000106610874,0.00042385585,0.00026301012,0.0021383732,0.000027554568,0.00011898739,1.1296154e-7,0.8253135,0.0018522078,0.16504475,0.0035832338,0.0011277691],"about_ca_topic_score_codex":0.000043175518,"about_ca_topic_score_gemma":0.00012494318,"teacher_disagreement_score":0.8160284,"about_ca_system_score_codex":0.0003680909,"about_ca_system_score_gemma":0.0005172449,"threshold_uncertainty_score":0.9996456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004591107,0.0001548556,0.989408,0.00009530982,0.0006446494,0.00019025795,0.0000032507312,0.000185969,0.0047265883],"genre_scores_gemma":[0.9915277,0.0000073522083,0.007689173,0.00011514677,0.000358725,0.0000074274717,0.000008089559,0.00003243497,0.0002539473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990033,0.0000069610674,0.00024190715,0.00034615377,0.00021211682,0.00018954088],"domain_scores_gemma":[0.9996692,0.000038142753,0.000038304195,0.00017245513,0.000043699572,0.00003819917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016064123,0.0002095244,0.00018444659,0.0005787394,0.00009001099,0.00023116646,0.00018584546,0.000104831764,0.000065313136],"category_scores_gemma":[0.0000071089753,0.00018566402,0.000033426815,0.00018319376,0.000099410594,0.00020711478,0.00003359982,0.0005047026,0.000043694123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.535599e-7,0.0000054234347,0.00002939551,0.0000561781,0.000005991738,0.000016038945,0.0003671654,0.93943214,0.0022843645,0.0035484063,0.0000071453214,0.054247003],"study_design_scores_gemma":[0.00016514331,0.000044024615,0.00020331578,0.0007512803,0.000006064252,0.00001676073,5.4359987e-7,0.9922638,0.0002923372,0.0057512047,0.00027369347,0.00023183353],"about_ca_topic_score_codex":0.000008429702,"about_ca_topic_score_gemma":0.00051944196,"teacher_disagreement_score":0.98693657,"about_ca_system_score_codex":0.00022882316,"about_ca_system_score_gemma":0.00002853731,"threshold_uncertainty_score":0.7571159},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003626875,0.0009877466,0.9860839,0.002604459,0.0032002442,0.0005051846,0.00002297382,0.00016719992,0.006424628],"genre_scores_gemma":[0.024762133,0.0000436559,0.96913326,0.0022348831,0.0017386449,0.000035369485,0.00001333089,0.00006291871,0.0019758074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657923,0.000017346661,0.00047649635,0.0015582858,0.00071126997,0.0006573947],"domain_scores_gemma":[0.99722433,0.00075841,0.00020782136,0.0013368672,0.0003507513,0.00012181283],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009555238,0.00048647114,0.00045418052,0.0005509473,0.0002572194,0.0011618794,0.0033815217,0.00024252912,0.000013968923],"category_scores_gemma":[0.00019435066,0.00043618123,0.00019984013,0.00046136882,0.00037939678,0.00070177944,0.0013852409,0.0004829185,0.00004691122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008404768,0.00002474567,0.000009568824,0.00012950704,0.000065459346,0.00007515676,0.0010918514,0.14122228,0.0002875614,0.17844918,0.0018740313,0.6767622],"study_design_scores_gemma":[0.00014472094,0.000077455275,0.0000070984634,0.00019621378,0.000014535062,0.000012211479,1.03723735e-7,0.6387646,0.00055619323,0.3436649,0.016170427,0.00039151972],"about_ca_topic_score_codex":0.000016693284,"about_ca_topic_score_gemma":0.000108662425,"teacher_disagreement_score":0.67637074,"about_ca_system_score_codex":0.0002086037,"about_ca_system_score_gemma":0.00035672623,"threshold_uncertainty_score":0.999875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034579294,0.0005966731,0.99497855,0.001255888,0.0021544383,0.00044706528,0.000012824243,0.00010301672,0.00010577823],"genre_scores_gemma":[0.3015787,0.00015151392,0.6937551,0.0014323029,0.0020048579,0.00003641807,0.000073538504,0.000044546436,0.0009230475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967909,0.000024701132,0.00057092955,0.0015449524,0.00067468424,0.00039385672],"domain_scores_gemma":[0.9985156,0.00020880757,0.0002230331,0.00069830957,0.0002327426,0.00012149525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010381491,0.0003858612,0.0004170848,0.00054642215,0.00035246764,0.0010295457,0.0009102246,0.00024004633,0.0000061884457],"category_scores_gemma":[0.000094645846,0.0003328537,0.00011173591,0.00034053918,0.00019976858,0.0005090111,0.0009633066,0.00031983372,0.000008781438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032822265,0.000042609674,0.00009426891,0.00013640468,0.00002905808,0.000026758602,0.0007893127,0.022200866,0.004258306,0.10628834,0.000116974836,0.8660138],"study_design_scores_gemma":[0.00020912325,0.00007577723,0.00008802727,0.00019006441,0.000022802005,0.000008776355,1.8396382e-7,0.91013414,0.0013688074,0.086909726,0.00066154497,0.00033104038],"about_ca_topic_score_codex":0.00004074199,"about_ca_topic_score_gemma":0.0002279762,"teacher_disagreement_score":0.88793325,"about_ca_system_score_codex":0.00023776059,"about_ca_system_score_gemma":0.00013463735,"threshold_uncertainty_score":0.9999123},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006393483,0.00039136602,0.97270536,0.0011566202,0.0009042795,0.00033420158,0.000004601871,0.0005436695,0.023953505],"genre_scores_gemma":[0.11243469,0.00014490714,0.8759328,0.001964539,0.00088081975,0.00007839993,0.000004879918,0.00006953538,0.008489391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742085,0.000009138451,0.00037452363,0.0012844743,0.0005062257,0.00040479325],"domain_scores_gemma":[0.99841917,0.00012868016,0.00013593168,0.0010650326,0.0001318932,0.00011931376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003572874,0.00037246587,0.00031266775,0.00067883584,0.00023676174,0.0007045391,0.002165351,0.00022709183,0.00002878891],"category_scores_gemma":[0.000012508896,0.0003392576,0.00012629286,0.00067399413,0.00035818707,0.00041657154,0.0015931015,0.0007247782,0.00019025952],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012656244,0.000011686411,0.0000023353807,0.00003489875,0.000010793977,0.00005410474,0.00050654553,0.006664249,0.0002292593,0.1790859,0.00007290355,0.81332606],"study_design_scores_gemma":[0.000054800217,0.00010299854,0.000009745439,0.00025655213,0.0000057923767,0.000083280065,1.1570778e-7,0.58667195,0.0028887286,0.3930789,0.01635819,0.00048895687],"about_ca_topic_score_codex":0.00001650751,"about_ca_topic_score_gemma":0.00004737596,"teacher_disagreement_score":0.8128371,"about_ca_system_score_codex":0.000284883,"about_ca_system_score_gemma":0.00022145039,"threshold_uncertainty_score":0.99990594},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007878855,0.00018254046,0.99117774,0.0004672192,0.004046188,0.0003544823,0.0000024008195,0.00047900397,0.0025025425],"genre_scores_gemma":[0.8666681,0.000017321898,0.12932366,0.0007072182,0.0012004048,0.000023010407,0.000008891999,0.000066654065,0.0019847516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572396,0.000022249105,0.0006395114,0.0017843399,0.0011359212,0.0006939899],"domain_scores_gemma":[0.99869907,0.00008878595,0.00018168475,0.000677271,0.00015480536,0.0001983994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082503725,0.0005246072,0.00044587834,0.00083067146,0.0002818398,0.00052852224,0.0017750829,0.00032484578,0.00004930236],"category_scores_gemma":[0.00001693707,0.0004777424,0.00023355978,0.0007628435,0.00042305523,0.0007052242,0.0005720735,0.0009775382,0.00025210617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012834382,0.0000752559,0.00004758096,0.00012499843,0.00002732706,0.0003766431,0.0012876356,0.03235213,0.0013988612,0.02349669,0.000009191752,0.94079083],"study_design_scores_gemma":[0.00017543191,0.00034793036,0.00009119682,0.00033283836,0.000015345287,0.00016570457,1.9171252e-7,0.9570913,0.0031684963,0.036026575,0.0019065331,0.0006785101],"about_ca_topic_score_codex":0.000017215953,"about_ca_topic_score_gemma":0.000031408938,"teacher_disagreement_score":0.94011235,"about_ca_system_score_codex":0.0002316017,"about_ca_system_score_gemma":0.0003172976,"threshold_uncertainty_score":0.9997674},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020984153,0.00026701464,0.9930919,0.00140758,0.000925181,0.0012137824,0.000027688558,0.00036748545,0.0024895447],"genre_scores_gemma":[0.2407322,0.0000233284,0.757759,0.00051173504,0.00029275817,0.00015679149,0.000026275098,0.000058366306,0.00043959386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960909,0.00002864191,0.00055781,0.0018913572,0.0008177826,0.0006134902],"domain_scores_gemma":[0.9977536,0.00056174694,0.00019473002,0.0010809435,0.00024068389,0.00016824828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070445164,0.0005493785,0.00042992595,0.0007377212,0.0003905884,0.00055653515,0.0024540867,0.00030605143,0.000018504701],"category_scores_gemma":[0.000047792215,0.00049916335,0.00017972263,0.00057207205,0.00036234688,0.0007730264,0.00042788155,0.00093038206,0.00007079749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019652396,0.00002916993,0.00001824439,0.00014522634,0.000018331826,0.000016695209,0.0024888595,0.07092346,0.03218238,0.077271484,0.000016058859,0.81687045],"study_design_scores_gemma":[0.00023505367,0.00016341191,0.00005167149,0.00058124564,0.0000143896805,0.000022319351,6.0237466e-7,0.8337447,0.013083926,0.15091358,0.000638739,0.0005503677],"about_ca_topic_score_codex":0.000090487105,"about_ca_topic_score_gemma":0.00005476833,"teacher_disagreement_score":0.81632006,"about_ca_system_score_codex":0.00049460336,"about_ca_system_score_gemma":0.00041572252,"threshold_uncertainty_score":0.999746},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009835711,0.0006317706,0.99446815,0.00014380773,0.00111044,0.00032430634,0.000017747023,0.0001628282,0.0030426066],"genre_scores_gemma":[0.62668866,0.00039985008,0.36149305,0.00088004157,0.0017296411,0.00007197764,0.00015205581,0.0001824309,0.008402299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985743,0.000004093024,0.00028413796,0.00056874065,0.0002832173,0.00028548075],"domain_scores_gemma":[0.9994565,0.00008206715,0.000041018415,0.00028930412,0.00006928835,0.000061784354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027144965,0.00027340034,0.0002808995,0.0006245697,0.00010050953,0.0004628601,0.0006289125,0.00011874091,0.00006505805],"category_scores_gemma":[0.000008009461,0.0002556173,0.00010240728,0.00038709314,0.000072401155,0.00019288262,0.00018457742,0.00030834723,0.00006297738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018817791,0.0000036678837,0.0000057063476,0.00009391167,0.00001661082,0.0000045105194,0.00021778722,0.638859,0.00014716625,0.00022917606,0.000095571115,0.36032507],"study_design_scores_gemma":[0.00011144318,0.000023747014,0.0000047422177,0.00026008073,0.000042484797,0.0000044038484,2.5267778e-7,0.9738823,0.00019967607,0.023768706,0.0014100346,0.00029212405],"about_ca_topic_score_codex":0.000011236524,"about_ca_topic_score_gemma":0.00012260175,"teacher_disagreement_score":0.6329751,"about_ca_system_score_codex":0.00034633087,"about_ca_system_score_gemma":0.00005184978,"threshold_uncertainty_score":0.9999896},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012816072,0.0007013321,0.98906094,0.002834089,0.003139266,0.00031436767,0.00008813783,0.0005367059,0.003312354],"genre_scores_gemma":[0.045466278,0.00002539851,0.949069,0.0012634883,0.001560579,0.000005012563,0.00016966517,0.00007477813,0.0023657905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932428,0.00004417146,0.00060814794,0.0037430846,0.00156759,0.0007941826],"domain_scores_gemma":[0.9927767,0.00071937,0.00022826898,0.0057981685,0.00016256349,0.00031495406],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0020562585,0.0006436777,0.0005723963,0.0008564669,0.00045413047,0.0016555106,0.012518108,0.00033451186,0.000025944697],"category_scores_gemma":[0.0005382223,0.0005675381,0.00007754547,0.0011446488,0.00035164674,0.0005483959,0.015089702,0.0026598389,0.00041983224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013512034,0.000010264495,0.000007475683,0.000028616201,0.000008294158,0.00005367648,0.00041917906,0.688013,0.000004070608,0.032776073,0.00008160193,0.27859634],"study_design_scores_gemma":[0.000055872282,0.00006586272,0.000016082566,0.00059359666,0.000013662229,0.000042294527,1.4201764e-7,0.91545504,0.0000049504592,0.0629302,0.0202001,0.0006222139],"about_ca_topic_score_codex":0.000018487099,"about_ca_topic_score_gemma":0.000016422959,"teacher_disagreement_score":0.27797413,"about_ca_system_score_codex":0.0001916756,"about_ca_system_score_gemma":0.0006037608,"threshold_uncertainty_score":0.9996776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006175153,0.0013847874,0.9834637,0.008255446,0.003388589,0.00034182332,0.000006464271,0.00042676562,0.002726218],"genre_scores_gemma":[0.018938111,0.000034515357,0.9598999,0.0183784,0.0004736792,0.000012583375,0.000004500552,0.000067732275,0.0021905645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955529,0.000026525266,0.00057959877,0.0020971736,0.00087918865,0.00086464355],"domain_scores_gemma":[0.99708664,0.0005601057,0.00020334206,0.001674753,0.00018032677,0.00029480513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005125211,0.0006677724,0.00056197983,0.0010060599,0.00024364342,0.000889961,0.0035204603,0.0002669596,0.00004721065],"category_scores_gemma":[0.00011522503,0.00059508346,0.00024738823,0.0008725541,0.0005208097,0.0009261903,0.0012913294,0.0014439835,0.00020128435],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072748207,0.0000306909,0.000025578242,0.00007002098,0.0000063229763,0.0003316657,0.00033846247,0.022940846,0.00024202577,0.0057166284,0.00020941648,0.9700811],"study_design_scores_gemma":[0.00032354615,0.0001403773,0.00002193205,0.0006356683,0.000005920932,0.00008132754,1.4097297e-7,0.9461975,0.0021173179,0.044414446,0.005382834,0.00067900843],"about_ca_topic_score_codex":0.00001756551,"about_ca_topic_score_gemma":0.000060172155,"teacher_disagreement_score":0.9694021,"about_ca_system_score_codex":0.00025220198,"about_ca_system_score_gemma":0.00041879676,"threshold_uncertainty_score":0.99965006},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026629375,0.0044714995,0.99191254,0.00080893625,0.0012278878,0.00047262374,0.0000063886323,0.00015410097,0.0009193789],"genre_scores_gemma":[0.05732396,0.0002773531,0.9392601,0.0010562458,0.0013130378,0.00001379806,0.00000937734,0.00005938417,0.0006866981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609923,0.000040654868,0.00051268935,0.0020345962,0.00069473445,0.00061807147],"domain_scores_gemma":[0.9980259,0.00029436784,0.0002162472,0.0010003198,0.00027701206,0.00018615938],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00080929097,0.00066300033,0.00058587507,0.0005618245,0.00044968154,0.0015546668,0.001342522,0.00030569427,0.000015972902],"category_scores_gemma":[0.00006629,0.0005075979,0.00009191073,0.00062617235,0.0005145474,0.00070576096,0.0010148155,0.00082060695,0.000026206031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041427634,0.000017333123,0.000031941985,0.00008373262,0.000038260983,0.000093073,0.000712608,0.29146463,0.0009546449,0.0058613615,0.00004441237,0.70069385],"study_design_scores_gemma":[0.00021171155,0.000112916576,0.000042413954,0.00073895,0.0000273183,0.00016243961,2.6930977e-7,0.98484975,0.00074884633,0.00870127,0.0037033593,0.000700768],"about_ca_topic_score_codex":0.000029730338,"about_ca_topic_score_gemma":0.00020142112,"teacher_disagreement_score":0.69999313,"about_ca_system_score_codex":0.00018584191,"about_ca_system_score_gemma":0.00034270703,"threshold_uncertainty_score":0.99973756},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024089919,0.0011590939,0.9887958,0.0029631383,0.002923735,0.00020204282,0.000011278748,0.00026348664,0.0036573391],"genre_scores_gemma":[0.031255994,0.00016868873,0.96336335,0.0018375303,0.0008849669,0.000007709674,0.0000069690495,0.00006459263,0.0024102014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964766,0.000016846121,0.00046055552,0.0016618567,0.00074755994,0.00063656666],"domain_scores_gemma":[0.9984189,0.0001867694,0.00015951268,0.000829668,0.00017414894,0.00023097612],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042199757,0.0004930879,0.0004124776,0.00047493077,0.00037049456,0.0010941213,0.0016525065,0.00018992576,0.000019072191],"category_scores_gemma":[0.000054278455,0.00044006086,0.000088032844,0.0006280317,0.0011431271,0.0012497847,0.0019621197,0.0011042336,0.000067552945],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001041671,0.000008580612,0.00000732099,0.000037636437,0.0000056062013,0.000059027734,0.00036914932,0.0007027783,0.00044319077,0.007878672,0.00022020782,0.9902668],"study_design_scores_gemma":[0.00022217607,0.00008266015,0.000012742281,0.0007062914,0.000008951906,0.0003153305,0.0000022425902,0.8270992,0.0023920452,0.14971069,0.018790904,0.00065678323],"about_ca_topic_score_codex":0.000017848068,"about_ca_topic_score_gemma":0.000012448966,"teacher_disagreement_score":0.98961,"about_ca_system_score_codex":0.00022207844,"about_ca_system_score_gemma":0.00019412828,"threshold_uncertainty_score":0.99994284},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040900606,0.0022671209,0.9904057,0.001854489,0.0023264177,0.00046559537,0.000009805269,0.00096071564,0.001669268],"genre_scores_gemma":[0.057512,0.00001372517,0.93691677,0.0029282994,0.0011144483,0.000027562623,0.000015416981,0.000053058306,0.0014187301],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959706,0.000024048697,0.000491564,0.0018802038,0.0010430962,0.00059048843],"domain_scores_gemma":[0.99794936,0.0001646949,0.00016749957,0.0012542875,0.00026356961,0.00020059592],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006823357,0.0005611908,0.00043890267,0.0014935973,0.0003152017,0.0018462949,0.003265637,0.00038816422,0.000035763955],"category_scores_gemma":[0.000089236986,0.0004974381,0.0001329397,0.0010533441,0.00038416244,0.00078557996,0.0011996496,0.0009983098,0.00016619787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003745522,0.000024376921,0.0000027218327,0.00009260286,0.000016198896,0.00027625702,0.0012590791,0.005488254,0.00748638,0.22912265,0.0005899079,0.7556378],"study_design_scores_gemma":[0.00009952154,0.00017965671,0.000005230591,0.00056386634,0.000011950273,0.000119927456,7.6271284e-8,0.31121585,0.029393071,0.65538156,0.002151289,0.0008779879],"about_ca_topic_score_codex":0.000015426913,"about_ca_topic_score_gemma":0.000075351294,"teacher_disagreement_score":0.75475985,"about_ca_system_score_codex":0.0004840509,"about_ca_system_score_gemma":0.0005601026,"threshold_uncertainty_score":0.99974775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020559876,0.0010197392,0.98992753,0.0016505136,0.00060322357,0.0006277149,0.0000037355874,0.0008298042,0.0051321182],"genre_scores_gemma":[0.1641314,0.0001274946,0.82969177,0.0011262301,0.00068409456,0.00009025731,0.00003302665,0.00016335961,0.0039523677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952251,0.00003250816,0.0005320585,0.002199018,0.0011971067,0.00081420894],"domain_scores_gemma":[0.99746746,0.00056893175,0.00027313858,0.0012822036,0.00019132634,0.00021694935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052773696,0.000656074,0.0005122799,0.0005285504,0.0005122418,0.00082094717,0.0030981237,0.0002597208,0.000021217911],"category_scores_gemma":[0.000040809802,0.00053174165,0.00009536609,0.0011229427,0.0005340126,0.0008191539,0.0017311858,0.0016551664,0.00014797597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051982843,0.000030310539,0.00004780967,0.0001018655,0.000018893475,0.0000796027,0.00073331717,0.13968332,0.0022236044,0.034017,0.0001410372,0.82291806],"study_design_scores_gemma":[0.00017988522,0.00028570674,0.000034123415,0.0009912235,0.000012671052,0.0001635823,3.398093e-7,0.91379446,0.0017811022,0.072154954,0.00973031,0.0008716352],"about_ca_topic_score_codex":0.000008439478,"about_ca_topic_score_gemma":0.000030667998,"teacher_disagreement_score":0.8220464,"about_ca_system_score_codex":0.00030097325,"about_ca_system_score_gemma":0.0002861338,"threshold_uncertainty_score":0.9997134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011552018,0.0019178545,0.9646976,0.0043474096,0.002133416,0.00045892486,0.0003342331,0.00016387993,0.025831185],"genre_scores_gemma":[0.9439427,0.0011748603,0.023987733,0.0053885267,0.007964677,0.000016224856,0.0013899638,0.00012440378,0.016010903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958625,0.00008583341,0.0003752632,0.002113829,0.0011037454,0.00045883542],"domain_scores_gemma":[0.99531496,0.0007064082,0.00012337214,0.0035613128,0.0001350214,0.00015895121],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003586078,0.0003077536,0.00036701938,0.00048357807,0.0007085455,0.00081670494,0.005306958,0.00025482476,0.00037372843],"category_scores_gemma":[0.00044545406,0.000271396,0.00006188244,0.0005368889,0.0017354819,0.00047644702,0.0014928165,0.0006734404,0.00038846853],"study_design_candidate":"design_other","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.0000124230455,0.00009237146,0.00004072738,0.0001417803,0.00009873394,0.000141165,0.004928856,0.04746893,0.000026581445,0.057916865,0.0015471318,0.88758445],"study_design_scores_gemma":[0.00009727823,0.000064792825,0.00001422939,0.0006804276,0.0001294674,0.0000030474575,0.0000041175235,0.7169566,0.00006214114,0.14155,0.13971107,0.0007268177],"about_ca_topic_score_codex":0.0011216543,"about_ca_topic_score_gemma":0.019668877,"teacher_disagreement_score":0.9438272,"about_ca_system_score_codex":0.00024988657,"about_ca_system_score_gemma":0.0010833578,"threshold_uncertainty_score":0.99997383},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017228445,0.0005073189,0.99419874,0.00095149793,0.0014381914,0.0008724682,0.00014176169,0.0003012759,0.0015715337],"genre_scores_gemma":[0.0048521576,0.000042760108,0.9917447,0.0016879098,0.0004856469,0.000062996056,0.00007577025,0.000055395318,0.0009926524],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99578935,0.000026717958,0.00060837355,0.0018731237,0.0007424875,0.0009599525],"domain_scores_gemma":[0.99752015,0.0004510085,0.00019842603,0.0015621239,0.00009723022,0.00017108886],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013204433,0.00058279466,0.00057432527,0.0011537618,0.00013961659,0.0010660231,0.0040580793,0.00030768567,0.00005183017],"category_scores_gemma":[0.000116001196,0.000576194,0.00012049495,0.00078300637,0.00030784434,0.0010200518,0.0018813389,0.0007841654,0.000018806068],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028857788,0.000089987436,0.00010076363,0.0006874469,0.00004744988,0.00080366514,0.0025292865,0.0022965923,0.008899852,0.058997635,0.027427671,0.8980908],"study_design_scores_gemma":[0.00060321786,0.0003197412,0.000024023593,0.0020482843,0.000020850579,0.000060199473,2.3049247e-7,0.35593274,0.054164633,0.5545197,0.031096006,0.0012103376],"about_ca_topic_score_codex":0.00010360278,"about_ca_topic_score_gemma":0.0002398267,"teacher_disagreement_score":0.89688045,"about_ca_system_score_codex":0.00067140814,"about_ca_system_score_gemma":0.0009592237,"threshold_uncertainty_score":0.999971},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010954935,0.002129814,0.9242989,0.059931222,0.006897003,0.0010075244,0.000025507117,0.00015287491,0.005447608],"genre_scores_gemma":[0.8431681,0.004091909,0.052408732,0.056450214,0.017196497,0.0002216054,0.00019554509,0.000342126,0.02592527],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965228,0.000017460607,0.000797957,0.0011055936,0.0009968953,0.000559299],"domain_scores_gemma":[0.9971335,0.0010775735,0.00022425165,0.0006646414,0.00056624477,0.00033381782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011900521,0.00037355773,0.00059937075,0.0007686848,0.00015576571,0.00018696376,0.0006123103,0.00029236058,0.00022599872],"category_scores_gemma":[0.00054263975,0.0003156578,0.00015293251,0.00038877432,0.0007380066,0.00018021248,0.00023475257,0.0011320465,0.00011129207],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008449038,0.000051107694,0.0009232481,0.0012173025,0.000028624196,0.00028334453,0.0019161213,0.00044296272,0.00005850483,0.041311633,0.0030540887,0.9506286],"study_design_scores_gemma":[0.00009798377,0.0002938739,0.00007039096,0.01459059,0.000089681904,0.00022415968,0.000014446947,0.17706728,0.003016257,0.75800574,0.045884766,0.00064482813],"about_ca_topic_score_codex":0.0007216796,"about_ca_topic_score_gemma":0.0023086646,"teacher_disagreement_score":0.9499838,"about_ca_system_score_codex":0.00062750705,"about_ca_system_score_gemma":0.0018562876,"threshold_uncertainty_score":0.99992955},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035932073,0.003966467,0.97601986,0.0016949669,0.006079465,0.0003256594,0.0000022568292,0.00009064925,0.011784762],"genre_scores_gemma":[0.81450135,0.00016927713,0.15446192,0.010842657,0.0034026017,0.000069961585,0.000007995553,0.00009159764,0.01645266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705404,0.00005349815,0.00052718585,0.001082577,0.000843023,0.00043965556],"domain_scores_gemma":[0.99793416,0.0005732672,0.00018445807,0.0011168389,0.00011890981,0.0000723589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011067059,0.00037726626,0.00044944533,0.00061112805,0.000034116034,0.0002083929,0.0040186853,0.00022168615,0.000041524247],"category_scores_gemma":[0.000034263052,0.00027889336,0.0001595643,0.00040737676,0.00072462787,0.00026599117,0.00068899157,0.0010018133,0.00005264325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068903196,0.000030008496,0.0000139520935,0.000044029573,0.0000111714435,0.00014349814,0.0038230342,0.017053584,0.0000096286685,0.12883615,0.0014194425,0.8486086],"study_design_scores_gemma":[0.00021548994,0.00013870014,0.00003479273,0.00048632265,0.000010213192,0.000077784134,3.2657135e-7,0.8952029,0.000012213706,0.031848725,0.071626306,0.00034622423],"about_ca_topic_score_codex":0.000050675982,"about_ca_topic_score_gemma":0.00021348266,"teacher_disagreement_score":0.87814933,"about_ca_system_score_codex":0.0005137587,"about_ca_system_score_gemma":0.0007809059,"threshold_uncertainty_score":0.9999663},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010395722,0.000074796306,0.988984,0.0019798994,0.00046711485,0.0003160148,0.00014064342,0.00016946961,0.0068285177],"genre_scores_gemma":[0.7273978,0.00002242967,0.264258,0.0060750404,0.00029041347,0.00000609776,0.00065787055,0.0000163503,0.0012759768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983144,0.000009189398,0.00025200515,0.00054327236,0.0005918074,0.0002893235],"domain_scores_gemma":[0.9992358,0.00011887411,0.00008109489,0.00029453155,0.0001431192,0.00012655466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025013968,0.00024700206,0.00019142283,0.0006510154,0.0003594359,0.00031984167,0.00046218187,0.00012278072,0.00020017532],"category_scores_gemma":[0.000014159605,0.00018621735,0.000053517433,0.0004149507,0.0003625206,0.00058658945,0.000070015834,0.0003707497,0.000108306085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011368756,0.0000093682565,0.0004713519,0.000035981484,0.000008222777,0.000017447084,0.0006023893,0.72280616,0.000010014947,0.012686122,0.0004249167,0.26291668],"study_design_scores_gemma":[0.00005435934,0.00009053035,0.0004325536,0.00022055737,0.0000078243165,0.00003400073,7.9909285e-7,0.73019457,0.00007891697,0.2668369,0.0018440958,0.00020484228],"about_ca_topic_score_codex":0.00037350904,"about_ca_topic_score_gemma":0.000297302,"teacher_disagreement_score":0.72635823,"about_ca_system_score_codex":0.000053013435,"about_ca_system_score_gemma":0.00019479472,"threshold_uncertainty_score":0.75937235},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066368617,0.0050474727,0.982176,0.00078846666,0.0012378062,0.0031046683,0.00003672495,0.00008689023,0.00088512065],"genre_scores_gemma":[0.88553613,0.0020061294,0.10848858,0.00071959465,0.0011689423,0.0006254405,0.000073492534,0.0001224745,0.001259205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778956,0.000014772589,0.00047286123,0.0010877805,0.00029256786,0.00034245496],"domain_scores_gemma":[0.9983884,0.0006152034,0.00019596945,0.00029465044,0.00036224653,0.00014353699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005751486,0.00039809267,0.00056548655,0.00026396022,0.00018840954,0.00027120093,0.00012502678,0.00020478318,0.000007243811],"category_scores_gemma":[0.000050719194,0.0002735963,0.00010224303,0.00019496043,0.00064558204,0.00023575734,0.00008859496,0.00053839094,0.000003988074],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002815162,0.00007331021,0.0009539234,0.00042113752,0.00012776858,0.000025702328,0.0015424539,0.0025490304,0.00007253362,0.003194638,0.0000086690725,0.9907493],"study_design_scores_gemma":[0.008458994,0.010218038,0.001364426,0.018880619,0.0010744634,0.0005490264,0.00002444213,0.69928694,0.0036255822,0.24288596,0.011733582,0.0018979455],"about_ca_topic_score_codex":0.000086516935,"about_ca_topic_score_gemma":0.0033199007,"teacher_disagreement_score":0.98885137,"about_ca_system_score_codex":0.00076113077,"about_ca_system_score_gemma":0.00074800494,"threshold_uncertainty_score":0.9999716},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010008378,0.0005606905,0.99196905,0.0022116688,0.0016232322,0.0012612251,0.00006891042,0.0009941593,0.0013010585],"genre_scores_gemma":[0.0031382528,0.000051224535,0.99206644,0.0039007596,0.000394116,0.00011625578,0.00004162941,0.00005231532,0.00023898874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99285376,0.00005780189,0.0009819756,0.002339828,0.0029552116,0.00081139914],"domain_scores_gemma":[0.996783,0.00074519706,0.00037073568,0.0011473533,0.00048422563,0.00046946402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001502065,0.00073536305,0.00072630454,0.0006298903,0.0002682263,0.0010322572,0.0032271235,0.0005271474,0.00013049222],"category_scores_gemma":[0.00031956926,0.0006695357,0.0002180422,0.00067310134,0.0012065851,0.0011868423,0.0017085271,0.0009875363,0.00008215979],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005812407,0.00005874335,0.0000019710503,0.00012479363,0.000051230167,0.000158101,0.0030893062,0.007577795,0.00022485618,0.011859044,0.00024722307,0.9766011],"study_design_scores_gemma":[0.00030783098,0.00010663072,0.0000030426593,0.00073861616,0.00002915965,0.00003087222,0.0000036709625,0.73173636,0.0015406404,0.26499116,0.000026881029,0.00048513705],"about_ca_topic_score_codex":0.00012873253,"about_ca_topic_score_gemma":0.000113597955,"teacher_disagreement_score":0.976116,"about_ca_system_score_codex":0.002911399,"about_ca_system_score_gemma":0.0016346985,"threshold_uncertainty_score":0.9995756},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012683634,0.00013396787,0.98942417,0.00072054943,0.0025324991,0.0010074982,0.000008253184,0.000183316,0.004721356],"genre_scores_gemma":[0.9840054,0.0000108069335,0.012377071,0.00047949218,0.0007810644,0.00012259577,0.000014780032,0.00006980324,0.0021390107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711454,0.000056465055,0.00050376245,0.001235027,0.0007026954,0.0003874876],"domain_scores_gemma":[0.9982874,0.0009417287,0.0002483235,0.00029402477,0.00011438206,0.00011415289],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009343248,0.0003206098,0.0002792934,0.00061001093,0.0002099069,0.00028538756,0.0005479754,0.00029197228,0.000051633837],"category_scores_gemma":[0.0011869052,0.00029206392,0.000082754035,0.00059969915,0.00057831453,0.00029228645,0.00019234452,0.00079803047,0.00007200354],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001792884,0.000050752802,0.00006469179,0.0000998028,0.0000019193806,0.000017611756,0.00096752413,0.00035271622,0.012027509,0.00092709827,0.000034559114,0.98543787],"study_design_scores_gemma":[0.0004106521,0.00013619,0.00016034028,0.0006080895,0.000010861543,0.00011431668,0.0000026708271,0.9239162,0.043503135,0.029660763,0.0010319379,0.00044479338],"about_ca_topic_score_codex":0.000006395656,"about_ca_topic_score_gemma":0.000107353306,"teacher_disagreement_score":0.9849931,"about_ca_system_score_codex":0.000499752,"about_ca_system_score_gemma":0.00031561844,"threshold_uncertainty_score":0.99995315},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002557868,0.0003812524,0.9951414,0.0013720834,0.0009581742,0.000439408,0.000026914826,0.00012867727,0.0015265242],"genre_scores_gemma":[0.13629913,0.000010808038,0.8611299,0.0012073554,0.00024023133,0.000025218642,0.000043247474,0.00003308412,0.0010110171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970385,0.000021421087,0.00054849056,0.0011485606,0.0008415027,0.0004015335],"domain_scores_gemma":[0.9983004,0.00042484154,0.00029388187,0.00058223074,0.00027016463,0.00012853656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074432336,0.00036754055,0.00038415208,0.00063411944,0.00022434889,0.00044741106,0.0012543777,0.00022484547,0.000011754112],"category_scores_gemma":[0.000075019576,0.00035001387,0.00018631095,0.00035766093,0.00037526447,0.00058838597,0.00039123106,0.00037693704,0.00000956671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001033736,0.00002770346,0.000004457189,0.00013719722,0.000019938721,0.000013268676,0.0030474595,0.4647388,0.0017933619,0.18626255,0.000052714444,0.34389222],"study_design_scores_gemma":[0.00013742498,0.000037933067,0.0000051560055,0.000159222,0.0000063514194,0.0000119824035,3.3709205e-7,0.5996779,0.0006371227,0.39882022,0.00028532898,0.00022101315],"about_ca_topic_score_codex":0.0000055023684,"about_ca_topic_score_gemma":0.000010837101,"teacher_disagreement_score":0.3436712,"about_ca_system_score_codex":0.00024452695,"about_ca_system_score_gemma":0.00058233144,"threshold_uncertainty_score":0.9998952},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021891543,0.00024870734,0.9932429,0.0026991589,0.0013078433,0.001173016,0.000017929615,0.0006819794,0.00060655014],"genre_scores_gemma":[0.0035803488,0.000085141764,0.9938231,0.0012651318,0.00077054946,0.0001500403,0.000033568853,0.000057878508,0.00023423652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959243,0.000023405511,0.0005396109,0.0017506192,0.001127226,0.0006348589],"domain_scores_gemma":[0.9972028,0.0012521658,0.00018094703,0.0008180803,0.00029675968,0.00024920565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006218205,0.0004862842,0.00040137128,0.00056492875,0.00035962017,0.0005268432,0.002238717,0.00034461473,0.000035648005],"category_scores_gemma":[0.00014984224,0.00045803975,0.00015864831,0.0010165635,0.00029596567,0.0007217108,0.00079969823,0.0007483683,0.0000669598],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012659849,0.00006384361,0.00001629889,0.00022406364,0.000036705904,0.00002143278,0.0008102961,0.017076435,0.0014484377,0.12948361,0.0002619231,0.8505443],"study_design_scores_gemma":[0.00021217923,0.00010952549,0.00000405914,0.00012676367,0.000012365628,0.00004121862,1.2741613e-7,0.73502135,0.0021211216,0.25838706,0.0035933873,0.00037081738],"about_ca_topic_score_codex":0.000010702115,"about_ca_topic_score_gemma":0.000099718505,"teacher_disagreement_score":0.8501735,"about_ca_system_score_codex":0.0005060874,"about_ca_system_score_gemma":0.00058847567,"threshold_uncertainty_score":0.99978715},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002463374,0.00038564872,0.99584943,0.000308096,0.0011195797,0.0012601567,0.0000148942845,0.00028219313,0.00053367927],"genre_scores_gemma":[0.019186491,0.000015819967,0.9793822,0.00038714672,0.00027207282,0.000045899855,0.000020110698,0.000077664845,0.00061259186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958065,0.00016523167,0.00059088616,0.0017209931,0.0010244182,0.0006919799],"domain_scores_gemma":[0.9971204,0.0011193107,0.0004353382,0.0005506362,0.00058964436,0.00018470529],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018106608,0.0006303576,0.00070746423,0.0008429148,0.0005261329,0.0010367458,0.0010049974,0.000264564,0.000008490046],"category_scores_gemma":[0.00013561432,0.0005759012,0.00020627749,0.0008377064,0.00034627208,0.0010432915,0.00032043923,0.00093726604,0.000014799581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008095276,0.000017340342,0.000022633394,0.0001303389,0.00009855256,0.00006651884,0.009632285,0.6790867,0.007984157,0.008855103,0.0000051185766,0.2940203],"study_design_scores_gemma":[0.0009151251,0.0003111538,0.000021866068,0.00052808836,0.000063568186,0.000026754764,0.000036546102,0.98067087,0.0008599152,0.0152063,0.00067039597,0.00068943505],"about_ca_topic_score_codex":0.00007224642,"about_ca_topic_score_gemma":0.00005165798,"teacher_disagreement_score":0.30158415,"about_ca_system_score_codex":0.00061971176,"about_ca_system_score_gemma":0.00072166725,"threshold_uncertainty_score":0.99973637},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10708575,0.0024908816,0.8885779,0.000032690838,0.0007544345,0.00006884204,0.000016679676,0.00018141059,0.00079141656],"genre_scores_gemma":[0.8592234,0.0001327301,0.14028177,0.00003815146,0.00018639422,7.4917364e-7,0.0000060742072,0.000035078872,0.000095630516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811417,0.000015342668,0.000526114,0.0005638691,0.0004714602,0.000309043],"domain_scores_gemma":[0.99914813,0.00019571865,0.0000946547,0.0004230706,0.00008645708,0.00005197713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004893563,0.00033997552,0.0005480657,0.00043195812,0.00009944137,0.00013168747,0.0005017479,0.00024071366,0.000011951201],"category_scores_gemma":[0.000019424382,0.00029534256,0.00014034471,0.00027675385,0.0002750643,0.00017286614,0.00028353182,0.00046489536,0.0000022111385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.5112284e-7,0.0000037835116,0.000012515784,0.00014187203,0.000021516282,0.000009893984,0.00028014465,0.9754219,0.004777442,0.0011738363,0.0000012545638,0.018154887],"study_design_scores_gemma":[0.000038522536,0.00001248354,0.0000034368823,0.00038779608,0.0000239907,0.0000035691503,7.5099416e-7,0.8930675,0.0034025891,0.102772705,0.0000033985305,0.0002832581],"about_ca_topic_score_codex":0.00017968724,"about_ca_topic_score_gemma":0.00007523446,"teacher_disagreement_score":0.75213766,"about_ca_system_score_codex":0.00012774854,"about_ca_system_score_gemma":0.00008450938,"threshold_uncertainty_score":0.9999499},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039998893,0.011528119,0.9853839,0.00010479637,0.0004940536,0.0001395818,0.000008033635,0.0001467753,0.0017947281],"genre_scores_gemma":[0.94723517,0.0023212966,0.04322547,0.0005902314,0.0003585655,0.000016397064,0.000044722583,0.00011695049,0.0060912236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983659,0.000006686767,0.00030663196,0.0006216501,0.00038534394,0.00031379377],"domain_scores_gemma":[0.99939585,0.00010930686,0.000042824744,0.0002906362,0.00007278063,0.00008858446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031346592,0.0003147077,0.00038039286,0.0004952409,0.00008751659,0.0002841192,0.00028550622,0.00020612893,0.00006836524],"category_scores_gemma":[0.000026210484,0.00029013288,0.000059998492,0.00041238673,0.00016153442,0.0000978178,0.00013085977,0.00035192913,0.00004036322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002805764,0.000004281093,0.000011170213,0.000107831365,0.000040227664,0.000011094541,0.00009541566,0.726217,0.0004970917,0.00011058709,0.000075335876,0.2728272],"study_design_scores_gemma":[0.0001701079,0.000030874016,5.1424195e-7,0.00021351414,0.00004338549,0.000004313456,1.786877e-7,0.9876663,0.0010797144,0.008060939,0.0024217346,0.00030844304],"about_ca_topic_score_codex":0.000010731912,"about_ca_topic_score_gemma":0.00005090099,"teacher_disagreement_score":0.94683516,"about_ca_system_score_codex":0.00016154925,"about_ca_system_score_gemma":0.00005107244,"threshold_uncertainty_score":0.99995506},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024850486,0.00051839376,0.9938576,0.000452233,0.00043094848,0.00060178305,0.00010682039,0.00016580235,0.0036178697],"genre_scores_gemma":[0.43389374,0.00019721343,0.5595747,0.0012119098,0.0022378103,0.00012723397,0.00022082588,0.00025317058,0.002283365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792594,0.000014555519,0.0003777986,0.0008291155,0.00039758696,0.00045498932],"domain_scores_gemma":[0.99924296,0.00011566098,0.00010642011,0.0004150914,0.00004215544,0.00007771294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002553866,0.00043546053,0.00044200826,0.0006244988,0.00009488324,0.00018038164,0.00055513514,0.00016130795,0.00033432816],"category_scores_gemma":[0.0000011433596,0.00038235847,0.00013069787,0.000327014,0.00038361657,0.00020695484,0.000030806128,0.00069421815,0.000005335999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008585306,0.00015461304,0.003920613,0.00014190555,0.00008355438,0.000057464196,0.0015773192,0.31868207,0.00892738,0.01937258,0.00015526346,0.64684135],"study_design_scores_gemma":[0.0012767969,0.0005522305,0.0003110308,0.001079888,0.000023343831,0.000010040644,8.522618e-7,0.73284256,0.013098195,0.20350392,0.04615986,0.0011412458],"about_ca_topic_score_codex":0.000105975865,"about_ca_topic_score_gemma":0.00006172981,"teacher_disagreement_score":0.64570016,"about_ca_system_score_codex":0.00034133374,"about_ca_system_score_gemma":0.00021379677,"threshold_uncertainty_score":0.99986285},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007237595,0.0053273975,0.9906002,0.0002547248,0.0018133502,0.0005433954,0.00006375407,0.00031893785,0.00035445712],"genre_scores_gemma":[0.9419676,0.00045227184,0.05408712,0.00026692962,0.0026506542,0.000075363496,0.00009054035,0.000113781214,0.00029571782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979572,0.000006683074,0.00031536233,0.0007749948,0.00037948505,0.000566264],"domain_scores_gemma":[0.99920064,0.00020037763,0.00005673761,0.00035124077,0.000088825414,0.00010220284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021828423,0.00044430673,0.00038203868,0.00036798097,0.0001500348,0.00022228781,0.00047101575,0.000286959,0.000011296315],"category_scores_gemma":[0.000012049007,0.00037912413,0.00023856037,0.00046887275,0.0002586081,0.00015797731,0.000031584772,0.0008234921,0.000019791783],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032394466,0.00000909269,0.000013677498,0.00015635032,0.00004071502,0.000019844038,0.00006669066,0.06082133,0.009827679,0.00013495541,0.00024416044,0.9286331],"study_design_scores_gemma":[0.00020957374,0.00015704262,0.00014806072,0.00040833937,0.0000866833,0.000021738473,9.2897864e-8,0.7459688,0.044477873,0.20324756,0.0046114633,0.0006627649],"about_ca_topic_score_codex":0.00003053949,"about_ca_topic_score_gemma":0.00007925179,"teacher_disagreement_score":0.9412439,"about_ca_system_score_codex":0.0001693963,"about_ca_system_score_gemma":0.000047959275,"threshold_uncertainty_score":0.99986607},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027927777,0.000069339934,0.99225223,0.00022383811,0.0022492544,0.00030372816,0.000009808193,0.00037292976,0.0042396206],"genre_scores_gemma":[0.44779953,0.000040188108,0.548692,0.00017965876,0.00251177,0.0000619836,0.00009526048,0.00015474859,0.00046486486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981852,0.0000095786245,0.0003530525,0.0005297016,0.0006374459,0.0002850231],"domain_scores_gemma":[0.99869716,0.00065806543,0.000047746606,0.00037183712,0.00011061594,0.00011460176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083637144,0.0002812407,0.0002488108,0.0004870873,0.000078482146,0.00021837409,0.00044850024,0.0003135567,0.000022679202],"category_scores_gemma":[0.00023261875,0.00026693864,0.000090782814,0.00020011934,0.00013921013,0.0002462731,0.000060155162,0.0005694205,0.000021598747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023911064,0.0000027508047,9.2358033e-7,0.00012238015,0.0000059801,0.000004135268,0.00008944494,0.8965007,0.00012848304,0.005033586,0.000024151022,0.09808508],"study_design_scores_gemma":[0.00014542058,0.000028849525,0.000010936821,0.00045487183,0.000006946978,0.0000025774502,1.3415656e-7,0.92853737,0.00042497585,0.069350354,0.00080537953,0.00023216127],"about_ca_topic_score_codex":0.0000020294706,"about_ca_topic_score_gemma":0.000007543096,"teacher_disagreement_score":0.44752026,"about_ca_system_score_codex":0.00025452083,"about_ca_system_score_gemma":0.000088801644,"threshold_uncertainty_score":0.9999783},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007567348,0.00077535736,0.9914425,0.0019462932,0.0033061767,0.00041419585,0.0000044790936,0.00027050817,0.0017648272],"genre_scores_gemma":[0.8753739,0.00016482979,0.12210578,0.0010233338,0.0009118565,0.00004350062,0.000021424958,0.00006584586,0.00028954892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935439,0.00008076177,0.00094300235,0.0025580171,0.0020518566,0.00082246255],"domain_scores_gemma":[0.9967042,0.0005733614,0.00031542595,0.0019027421,0.00022486877,0.00027939855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026090879,0.000592363,0.0007470421,0.002862049,0.0001808343,0.00081075996,0.0036327287,0.00058172113,0.00006610915],"category_scores_gemma":[0.0001339046,0.0005499503,0.00029294626,0.0049880524,0.00082868873,0.00036736176,0.0012909326,0.0015945453,0.000076225624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005406979,0.000025067271,0.00004031319,0.000026933498,0.00003517524,0.00016758025,0.00030071347,0.7546275,0.000011123814,0.009080765,0.000014192536,0.23566522],"study_design_scores_gemma":[0.00014337117,0.000061977364,0.0001963141,0.00038477822,0.000050135495,0.000036165693,2.9399757e-7,0.96733123,0.00011039269,0.030759972,0.000385903,0.00053946837],"about_ca_topic_score_codex":0.0002093228,"about_ca_topic_score_gemma":0.0018099545,"teacher_disagreement_score":0.8752982,"about_ca_system_score_codex":0.0012855394,"about_ca_system_score_gemma":0.0007821849,"threshold_uncertainty_score":0.9996952},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015144515,0.00013837207,0.985288,0.0096953055,0.0001916278,0.0007514521,0.000021450656,0.00023660726,0.0021626842],"genre_scores_gemma":[0.43619177,0.00006124303,0.55852616,0.0034063,0.0004994451,0.000060742306,0.000055600776,0.00006571179,0.0011330021],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782795,0.000006098605,0.0002996114,0.00093464373,0.0006091889,0.00032248205],"domain_scores_gemma":[0.99886477,0.00009048377,0.00006376538,0.0006087397,0.00015402406,0.00021821617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002884106,0.00029696088,0.00036118025,0.00037629064,0.00011469458,0.00011795882,0.0003714186,0.00017036722,0.00003597454],"category_scores_gemma":[0.000011161487,0.00021188987,0.00007214676,0.00031705128,0.0005549067,0.00010005239,0.00019394474,0.0007547857,0.000025069294],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021639609,0.00024257987,0.00037329938,0.0008939814,0.000044822733,0.0023314152,0.0032195018,0.02947417,0.0060353647,0.032140028,0.0005996877,0.92442876],"study_design_scores_gemma":[0.0004574673,0.00052055443,0.00012315759,0.0023090013,0.0000633828,0.0007829751,4.2021568e-7,0.8464467,0.0008081449,0.14093775,0.007052889,0.0004975535],"about_ca_topic_score_codex":0.000013324578,"about_ca_topic_score_gemma":0.000021963671,"teacher_disagreement_score":0.9239312,"about_ca_system_score_codex":0.00012335148,"about_ca_system_score_gemma":0.00023801521,"threshold_uncertainty_score":0.86406183},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003221036,0.00059264095,0.9555435,0.03969288,0.00166853,0.0008389657,0.000008152203,0.00028809364,0.0010451173],"genre_scores_gemma":[0.61934346,0.00040904453,0.2672579,0.08986528,0.009450571,0.00025829722,0.00036331633,0.0005732458,0.012478884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964645,0.000021457023,0.0005342404,0.0012799834,0.001211067,0.0004887337],"domain_scores_gemma":[0.99648553,0.002167552,0.00017647604,0.0005640009,0.00034341618,0.00026299935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013171119,0.0003935704,0.0005944561,0.0007837771,0.00015982907,0.00022354949,0.0005666618,0.000512818,0.00012673103],"category_scores_gemma":[0.0022394473,0.00034360428,0.00021021083,0.0003640974,0.00085353194,0.00011118554,0.0002878523,0.0013131959,0.000089503505],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011492543,0.00011995255,0.00024921578,0.0009617551,0.00007315369,0.00050534814,0.0010560919,0.002037488,0.0038383894,0.0048619886,0.0028578977,0.9833238],"study_design_scores_gemma":[0.0013537988,0.0006126857,0.00042049214,0.004928667,0.00017217576,0.00015750351,0.0000010059152,0.81769454,0.0025511105,0.015508646,0.15588786,0.0007115318],"about_ca_topic_score_codex":0.000025402345,"about_ca_topic_score_gemma":0.00006318089,"teacher_disagreement_score":0.98261225,"about_ca_system_score_codex":0.0004978782,"about_ca_system_score_gemma":0.0014163882,"threshold_uncertainty_score":0.9999016},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002703976,0.00024707938,0.98715883,0.001112829,0.00093435944,0.00025459388,0.000009432824,0.0005480767,0.009464409],"genre_scores_gemma":[0.46080095,0.00003123239,0.53131783,0.0008624782,0.0006667173,0.000026034933,0.000058900598,0.00009265886,0.0061431816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634165,0.00003236652,0.0004697321,0.001785326,0.0008612682,0.000509635],"domain_scores_gemma":[0.9971607,0.0003888501,0.00027746856,0.0017391089,0.0002926788,0.00014123623],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010105375,0.0004420379,0.00033994278,0.0008046374,0.00042208927,0.0019500556,0.0024039608,0.00023953746,0.00002187589],"category_scores_gemma":[0.00016843362,0.00035739946,0.00007509415,0.0010796153,0.00048531202,0.0007506652,0.0009368806,0.0011913965,0.00017929502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009902273,0.000030116213,0.00064748724,0.00012667084,0.0000328399,0.00019610039,0.0011391881,0.0648354,0.00053699204,0.09499523,0.000023724542,0.83742636],"study_design_scores_gemma":[0.0002849321,0.00026068446,0.0007838272,0.0008485552,0.00002223925,0.00025259503,2.5655555e-7,0.9100974,0.0018171336,0.076543115,0.0081244605,0.0009647918],"about_ca_topic_score_codex":0.000048994963,"about_ca_topic_score_gemma":0.00011310663,"teacher_disagreement_score":0.845262,"about_ca_system_score_codex":0.00022724994,"about_ca_system_score_gemma":0.00043114094,"threshold_uncertainty_score":0.9998878},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001964406,0.00006747215,0.99376243,0.0009302048,0.00029091086,0.002104472,0.000027653448,0.00017997102,0.0006724531],"genre_scores_gemma":[0.08523854,0.00002119324,0.9131088,0.0003678012,0.0003317374,0.000117784344,0.00005541175,0.000063877356,0.0006948488],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804395,0.000004304663,0.00033100802,0.0009710234,0.00032506246,0.00032463777],"domain_scores_gemma":[0.99890995,0.0001086322,0.00012651426,0.00048521327,0.00024300779,0.00012669043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021914339,0.00029751382,0.00033570017,0.00039411554,0.00021341589,0.00014579688,0.00022808518,0.00018296715,0.0000058834707],"category_scores_gemma":[0.000019432307,0.00023648488,0.000094944284,0.00028503974,0.0004210325,0.00015566667,0.00015651924,0.0003622502,0.0000050264243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003706798,0.00017186746,0.00022676522,0.00091139146,0.00003332058,0.000038911694,0.00076043676,0.15888135,0.0065289307,0.14465728,0.000029184454,0.68738985],"study_design_scores_gemma":[0.00048443532,0.00038223926,0.00004480778,0.0021258444,0.000039857765,0.00024360929,8.7978475e-7,0.22287858,0.00034361123,0.7724037,0.00074601575,0.00030638167],"about_ca_topic_score_codex":0.00000643261,"about_ca_topic_score_gemma":0.00005445146,"teacher_disagreement_score":0.6870835,"about_ca_system_score_codex":0.0005017322,"about_ca_system_score_gemma":0.00016910718,"threshold_uncertainty_score":0.9643574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054449945,0.00070342055,0.993592,0.002207892,0.00056192,0.0008313474,0.000008742802,0.0003667259,0.0016734579],"genre_scores_gemma":[0.064273074,0.00034257717,0.93191886,0.0006039151,0.00037753073,0.000087724984,0.00003696595,0.00007131776,0.0022880428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965954,0.000041235427,0.00053677976,0.0017582999,0.00059547,0.00047282764],"domain_scores_gemma":[0.99784774,0.0005546185,0.00028632354,0.00079463,0.0003882019,0.00012850626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007693534,0.00045574227,0.00046784128,0.000682109,0.0003151176,0.0009403673,0.0010630027,0.00021868678,0.000003974228],"category_scores_gemma":[0.0003730277,0.0004091413,0.00014425733,0.00054005353,0.0005455315,0.0014905186,0.0009588887,0.00077835476,0.000021518006],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001126557,0.000017078422,0.000018173705,0.00018316193,0.000012542959,0.000043299588,0.0018936176,0.00050027424,0.013076607,0.021009682,0.00007550959,0.9631588],"study_design_scores_gemma":[0.00017986374,0.00028297235,0.00015149044,0.00054608803,0.000019514779,0.00003539703,0.0000043900955,0.5266437,0.035989165,0.43213344,0.0034871232,0.0005268677],"about_ca_topic_score_codex":0.000016083544,"about_ca_topic_score_gemma":0.000015817695,"teacher_disagreement_score":0.96263194,"about_ca_system_score_codex":0.00025709756,"about_ca_system_score_gemma":0.00017762685,"threshold_uncertainty_score":0.999836},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04492132,0.003726056,0.9454995,0.00054569164,0.0034513045,0.0013448242,0.000040296247,0.0003207151,0.00015033255],"genre_scores_gemma":[0.94982177,0.000024997598,0.049526203,0.000083629086,0.00038103343,0.000016218986,0.0000072162725,0.0000336605,0.00010525734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971208,0.000067976325,0.00047510007,0.0012998227,0.0006158598,0.00042044552],"domain_scores_gemma":[0.9980485,0.0006042495,0.00017643019,0.0007909924,0.0001543413,0.00022551534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003623167,0.0004735795,0.0005625846,0.0005363152,0.00017503845,0.00032166508,0.0007832882,0.00016618326,0.0000022295787],"category_scores_gemma":[0.00016319726,0.0003846681,0.00010570384,0.00038603935,0.00068399456,0.00031579885,0.0005210211,0.00047263538,0.000001614027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062240724,0.00012349937,0.02210727,0.0032404074,0.00006896346,0.00071657967,0.005129451,0.18269786,0.00023201895,0.03953863,0.0000042718916,0.7460788],"study_design_scores_gemma":[0.00019935511,0.0006500638,0.0033333946,0.00096117466,0.000037145255,0.00006099146,1.8741932e-7,0.94884163,0.000106173546,0.04543337,0.00008447783,0.0002920643],"about_ca_topic_score_codex":0.00022038312,"about_ca_topic_score_gemma":0.00007403853,"teacher_disagreement_score":0.9049005,"about_ca_system_score_codex":0.00037709417,"about_ca_system_score_gemma":0.00054414285,"threshold_uncertainty_score":0.9998605},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002595767,0.0001791879,0.99468005,0.0008105347,0.0005972437,0.00096982584,0.000003150947,0.0005041877,0.0019962308],"genre_scores_gemma":[0.6932499,0.000034136796,0.30409518,0.0003914459,0.00043285717,0.0002758876,0.000008290826,0.00005435954,0.0014579848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710846,0.000017419201,0.0005362625,0.001439124,0.00041789655,0.00048082008],"domain_scores_gemma":[0.9985737,0.00022709412,0.00020980081,0.0006984305,0.00019362928,0.00009733974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069718086,0.0003895547,0.00035781052,0.0011260257,0.0003103603,0.00055920583,0.0013903609,0.00032974352,0.0000074240934],"category_scores_gemma":[0.000044523298,0.0003888265,0.00015552007,0.00096369244,0.00023584727,0.00044792422,0.0005176839,0.0008589977,0.00003734816],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007858507,0.00004894649,0.000045965324,0.00015263437,0.000013054362,0.00003447033,0.00055469706,0.0259242,0.004491095,0.063518815,0.00002245821,0.9051858],"study_design_scores_gemma":[0.00016415736,0.00029206675,0.00018121708,0.0003115127,0.000008931805,0.00009395605,2.7771387e-7,0.7431947,0.017395904,0.23174526,0.006073421,0.00053858175],"about_ca_topic_score_codex":0.000043218068,"about_ca_topic_score_gemma":0.00012294769,"teacher_disagreement_score":0.90464723,"about_ca_system_score_codex":0.00048190783,"about_ca_system_score_gemma":0.00024592233,"threshold_uncertainty_score":0.99985635},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001218436,0.0010826315,0.98222935,0.0031119527,0.008564827,0.0013351017,0.000010006182,0.0007213687,0.0029325734],"genre_scores_gemma":[0.004275644,0.00030062327,0.9871673,0.0027699214,0.0029884463,0.00014748014,0.00003099398,0.00007197094,0.0022476208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99254787,0.00006590374,0.0014434656,0.0026765703,0.002044888,0.0012213308],"domain_scores_gemma":[0.99590147,0.0009552819,0.00045601875,0.0018708736,0.00048116784,0.00033516588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004030781,0.0007456933,0.0008816805,0.0006502665,0.0003237527,0.00063462986,0.004229813,0.00068385364,0.00010032525],"category_scores_gemma":[0.00030474435,0.0006518778,0.00031996064,0.0008942022,0.0010586228,0.0007221851,0.0026689256,0.0013435858,0.00016439229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002506945,0.00011748883,0.000009293224,0.00015883408,0.000058831538,0.00020961896,0.00018473383,0.00036889937,0.0001767813,0.328582,0.004963426,0.66514504],"study_design_scores_gemma":[0.0004689647,0.0007502764,0.000013244922,0.001780361,0.000033027038,0.000028642067,4.6389513e-8,0.476102,0.0060179154,0.47339156,0.04045558,0.00095841417],"about_ca_topic_score_codex":0.0000150895485,"about_ca_topic_score_gemma":0.000054502747,"teacher_disagreement_score":0.66418666,"about_ca_system_score_codex":0.0005213761,"about_ca_system_score_gemma":0.0009452124,"threshold_uncertainty_score":0.99959326},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042619705,0.0010768519,0.98507315,0.000723886,0.0008164886,0.0009029552,0.000005005338,0.00020265923,0.010772805],"genre_scores_gemma":[0.86298376,0.00009166093,0.12136682,0.003472505,0.00093802693,0.00021650792,0.0000110467145,0.00019923982,0.01072041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624985,0.00006191838,0.0005100068,0.001878815,0.00063561165,0.000663764],"domain_scores_gemma":[0.99822384,0.00093479204,0.00018138556,0.0005058607,0.000049863665,0.000104273764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089334615,0.00043205844,0.00042223796,0.00095385854,0.0002583598,0.0004033163,0.0009128594,0.00022688048,0.000022083761],"category_scores_gemma":[0.00073394843,0.00042482105,0.00011670479,0.0009334986,0.0006328351,0.00020882268,0.00024010263,0.0013449598,0.000033351287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012453724,0.00008751413,0.00007657591,0.00042396065,0.0000025530483,0.00016534173,0.0027076865,0.11616527,0.08139905,0.046894334,0.000054100583,0.75189906],"study_design_scores_gemma":[0.00032872852,0.000287809,0.00011349953,0.00040209922,0.000004821516,0.00011851769,0.0000016878192,0.90467376,0.032920573,0.058248688,0.0023735983,0.00052620197],"about_ca_topic_score_codex":0.00000691948,"about_ca_topic_score_gemma":0.000042557345,"teacher_disagreement_score":0.86370635,"about_ca_system_score_codex":0.00044048356,"about_ca_system_score_gemma":0.0001931032,"threshold_uncertainty_score":0.99982035},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002135725,0.0003228619,0.9926375,0.0030409792,0.0002189738,0.0014376456,0.000004129001,0.00018426246,0.000017885397],"genre_scores_gemma":[0.9513989,0.000029799492,0.046680596,0.001283923,0.00022425888,0.00014737542,0.000020184409,0.000068676556,0.00014629091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784535,0.000015855103,0.00026976332,0.0010300792,0.0005583459,0.00028057632],"domain_scores_gemma":[0.9988804,0.00034311885,0.00012479177,0.00028956975,0.00018404296,0.00017808465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036399515,0.00032106417,0.0003480061,0.00062952784,0.00022513585,0.00016231569,0.00010928253,0.0001915535,0.0000029907835],"category_scores_gemma":[0.00015218383,0.00025386372,0.000098008495,0.00036400274,0.00037554235,0.0001562329,0.00003316586,0.00054827484,0.0000015359024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076539087,0.000036500805,0.00007869849,0.0008265541,0.000017318116,0.00003394628,0.00040223257,0.40487748,0.0035108342,0.000016455218,0.000001533099,0.5894331],"study_design_scores_gemma":[0.0011294702,0.0007581041,0.00010996558,0.002475302,0.0002092675,0.000017067352,5.077936e-7,0.9800663,0.011045195,0.0033520807,0.0005588662,0.000277897],"about_ca_topic_score_codex":0.000020112437,"about_ca_topic_score_gemma":0.00012487492,"teacher_disagreement_score":0.94926316,"about_ca_system_score_codex":0.00031692165,"about_ca_system_score_gemma":0.00047154893,"threshold_uncertainty_score":0.99999136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036001308,0.0023649968,0.9722911,0.00051818206,0.0007252507,0.0005609289,0.000018833625,0.0001865336,0.01973406],"genre_scores_gemma":[0.9398723,0.00007526925,0.04881126,0.0005131201,0.0015641573,0.000029478671,0.000036950998,0.00008534952,0.009012064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966486,0.000031546562,0.00033403112,0.0014589748,0.000987191,0.00053963845],"domain_scores_gemma":[0.99854624,0.00023830398,0.000055283515,0.0005469517,0.000321369,0.00029187262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057019736,0.0005379637,0.0009458779,0.00068222923,0.00023316633,0.0003674374,0.00042732892,0.00033752603,0.000009141295],"category_scores_gemma":[0.00007709492,0.00038295815,0.0002549386,0.0007999983,0.00058224855,0.00010894187,0.00015939775,0.0018268973,0.000024345989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004930674,0.0002188358,0.015139694,0.0011185304,0.001055603,0.00066701253,0.011519193,0.2764857,0.0018193693,0.0027644401,0.00003839115,0.6886802],"study_design_scores_gemma":[0.008597204,0.011432211,0.06415159,0.026188115,0.0063809515,0.0016545347,0.000051806193,0.7472074,0.03146594,0.031548724,0.05831678,0.013004711],"about_ca_topic_score_codex":0.00010254951,"about_ca_topic_score_gemma":0.000022304705,"teacher_disagreement_score":0.9362722,"about_ca_system_score_codex":0.00030091938,"about_ca_system_score_gemma":0.00038544502,"threshold_uncertainty_score":0.99986225},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00981867,0.0030544219,0.979392,0.00027759298,0.0011637337,0.0028556334,0.000068310634,0.00020281349,0.003166842],"genre_scores_gemma":[0.9816805,0.00041933512,0.016687643,0.00023087894,0.00022262528,0.00012276131,0.00014700434,0.000050587965,0.0004386573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828756,0.000006912007,0.00030397117,0.0006862386,0.00040912558,0.00030617244],"domain_scores_gemma":[0.9992219,0.000083820574,0.00010345568,0.00032134567,0.00016191619,0.000107539825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025421265,0.0002746606,0.00043435258,0.0006755311,0.00009273538,0.00009871409,0.00011943087,0.0001644985,0.0000056152944],"category_scores_gemma":[0.000023703276,0.000211438,0.0004142098,0.00041501067,0.0001899947,0.00013312626,0.00005901647,0.00041724992,0.000009853104],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046664453,0.00023782151,0.4418307,0.0016868565,0.00082447915,0.0000968955,0.0007389846,0.0576958,0.00006700135,0.0012490719,0.00003052463,0.49507523],"study_design_scores_gemma":[0.0042087478,0.0020286464,0.35664517,0.0070230444,0.0015965266,0.000034993674,0.0000060735347,0.6216792,0.00012041669,0.0033868258,0.0025051576,0.0007652353],"about_ca_topic_score_codex":0.000023980918,"about_ca_topic_score_gemma":0.000005459156,"teacher_disagreement_score":0.97186184,"about_ca_system_score_codex":0.00026602266,"about_ca_system_score_gemma":0.00023863495,"threshold_uncertainty_score":0.86221915},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041971004,0.0013094211,0.97436863,0.020333221,0.001749195,0.0015028141,0.00010659906,0.00016936452,0.000041060575],"genre_scores_gemma":[0.110486425,0.00097361684,0.8257634,0.057507075,0.0027705089,0.0006408033,0.00016170679,0.00028451622,0.0014119447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940408,0.00021733361,0.0013595212,0.0022192874,0.0014081168,0.00075494236],"domain_scores_gemma":[0.9815078,0.016273262,0.00033810182,0.00070221565,0.0004603062,0.0007183319],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.005765689,0.0006137882,0.001377035,0.00089280255,0.00014422482,0.00013486765,0.00068181945,0.00059344096,0.00008363706],"category_scores_gemma":[0.017501494,0.0005295483,0.00046931958,0.00061640993,0.0012382473,0.00013337785,0.00070285215,0.0024005868,0.000026656846],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040196747,0.00072149764,0.019049266,0.0015504698,0.00011829371,0.0013373205,0.00093506713,0.0056552975,0.000025905569,0.0008684656,0.00031270832,0.96902376],"study_design_scores_gemma":[0.005565065,0.00072541565,0.041592404,0.019957373,0.00036116948,0.000029701503,0.0000027965527,0.90001154,0.00037669993,0.015171732,0.014881754,0.0013243316],"about_ca_topic_score_codex":0.00015177854,"about_ca_topic_score_gemma":0.0002802046,"teacher_disagreement_score":0.9676994,"about_ca_system_score_codex":0.0006664702,"about_ca_system_score_gemma":0.00204516,"threshold_uncertainty_score":0.99990094},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042027026,0.0023093906,0.98349595,0.0020616194,0.0050987564,0.00073257496,0.00002024526,0.00046967942,0.005769769],"genre_scores_gemma":[0.17633884,0.00012893348,0.8111888,0.0030195888,0.002194657,0.00017824226,0.000030639476,0.00015290274,0.006767376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953283,0.000038820912,0.00065333006,0.0023845185,0.0008727444,0.0007222572],"domain_scores_gemma":[0.996687,0.0009087653,0.00036402166,0.0016332628,0.00024223412,0.00016469265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013666605,0.0005431042,0.0004988063,0.00075421674,0.00035239072,0.00044363562,0.0028949962,0.00045425943,0.000012352355],"category_scores_gemma":[0.000105007624,0.00052605587,0.0001870169,0.00048217614,0.0006249554,0.00080429064,0.0017599793,0.0007900386,0.000057823967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034746303,0.00002711156,0.000006759131,0.0002461374,0.000019102603,0.00017328608,0.003799398,0.11999189,0.0026051255,0.06705549,0.00044129338,0.80559963],"study_design_scores_gemma":[0.00015715195,0.00023256117,0.00001602561,0.00035230487,0.00001536233,0.0001819583,3.0634428e-7,0.8229963,0.00064681564,0.16824244,0.0067054667,0.0004532853],"about_ca_topic_score_codex":0.000013188869,"about_ca_topic_score_gemma":0.0000811594,"teacher_disagreement_score":0.80514634,"about_ca_system_score_codex":0.001861523,"about_ca_system_score_gemma":0.0004640746,"threshold_uncertainty_score":0.9997191},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040261715,0.0006729458,0.99535835,0.00019892243,0.0015980278,0.0005037696,0.000015052274,0.00022113016,0.0010292106],"genre_scores_gemma":[0.79187447,0.00012324737,0.20540647,0.0004764216,0.0012043698,0.000024286814,0.00007499771,0.00022430274,0.0005914208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829185,0.0000049301966,0.00033873308,0.00059574266,0.00040725205,0.00036146824],"domain_scores_gemma":[0.999165,0.00021787798,0.000065109474,0.00034228593,0.00012709662,0.000082620245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002441562,0.0003548032,0.0003479983,0.000434815,0.000114058945,0.0002605967,0.0003054015,0.00020576261,0.000011979507],"category_scores_gemma":[0.000021507003,0.00030480695,0.00008904507,0.00024038591,0.00017749981,0.000104281135,0.00006750441,0.00037944096,0.000009777493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005951711,0.0000043061427,0.0000027040217,0.0002909947,0.000019390665,0.000037270383,0.00026879113,0.91713285,0.0012739591,0.0021732654,0.000022237058,0.07876829],"study_design_scores_gemma":[0.00021530561,0.00008566962,0.000016639819,0.0011667497,0.000026232286,0.000029195724,9.0404023e-7,0.98525256,0.004713315,0.00670582,0.0013439734,0.00044363286],"about_ca_topic_score_codex":0.000004719323,"about_ca_topic_score_gemma":0.000051068408,"teacher_disagreement_score":0.79147184,"about_ca_system_score_codex":0.00025028698,"about_ca_system_score_gemma":0.000108838576,"threshold_uncertainty_score":0.9999404},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000117027075,0.00064039906,0.983608,0.0009506681,0.004344297,0.0003981599,0.0000037924897,0.00064278394,0.009400182],"genre_scores_gemma":[0.0010344986,0.0001605656,0.99266976,0.0021276458,0.0005436033,0.000022061613,0.000006872768,0.00003896013,0.0033960515],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996002,0.000029852317,0.00067045895,0.0016300721,0.0010971521,0.00057044125],"domain_scores_gemma":[0.9979129,0.00014808195,0.000225419,0.0012529003,0.00022916861,0.00023154104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000915044,0.0004605098,0.0004264804,0.0010839448,0.00017504935,0.00080383266,0.0024993403,0.00028996944,0.00011031613],"category_scores_gemma":[0.00007372523,0.00041275923,0.00014234649,0.0007392115,0.00073425064,0.0007422331,0.0011702065,0.0007545237,0.00017128981],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010010231,0.000012426116,0.0000060879474,0.000058538633,0.000011740135,0.0001239809,0.0003057496,0.0021242732,0.0005693562,0.034889426,0.0007398177,0.9611576],"study_design_scores_gemma":[0.00015523272,0.00013188597,0.0000055951273,0.00071987335,0.000012490817,0.0004618478,1.2601176e-7,0.427239,0.023564953,0.54367924,0.0033501636,0.00067956914],"about_ca_topic_score_codex":0.000036897993,"about_ca_topic_score_gemma":0.000023640418,"teacher_disagreement_score":0.960478,"about_ca_system_score_codex":0.00053263793,"about_ca_system_score_gemma":0.00042218363,"threshold_uncertainty_score":0.99983245},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036358545,0.00081686553,0.98878336,0.0008566936,0.0015622448,0.00052026904,0.000017077251,0.00005406797,0.0037535792],"genre_scores_gemma":[0.9042614,0.00020389356,0.09215344,0.0010029636,0.0009639471,0.00003116813,0.00006690833,0.00009234172,0.0012239263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798095,0.00000803514,0.0004986573,0.00071895774,0.00045691573,0.00033646135],"domain_scores_gemma":[0.9989773,0.00031653602,0.00011636647,0.0003536425,0.00013672646,0.000099438876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006460511,0.00025337626,0.0005633237,0.000730382,0.000042184114,0.00006133157,0.00030071198,0.00024514765,0.0000068078034],"category_scores_gemma":[0.00023839957,0.00021181465,0.0001424129,0.00023598647,0.0005204336,0.00014209335,0.00017696148,0.0007025541,0.0000022871682],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012595831,0.00012468628,0.0007823576,0.00062885846,0.00005511886,0.00043232308,0.0026446858,0.09131159,0.0027899344,0.017576125,0.00020327221,0.8833251],"study_design_scores_gemma":[0.00068556383,0.00028786075,0.000081321945,0.001177309,0.000019513598,0.000177196,7.29504e-7,0.7479476,0.00031083034,0.24849018,0.0006321521,0.00018978603],"about_ca_topic_score_codex":0.000019859248,"about_ca_topic_score_gemma":0.000009411555,"teacher_disagreement_score":0.9006256,"about_ca_system_score_codex":0.00013025188,"about_ca_system_score_gemma":0.00026157586,"threshold_uncertainty_score":0.8637551},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011585347,0.00014827054,0.98549527,0.0037380536,0.00017426793,0.00039090583,0.0000020118039,0.00011055111,0.008782107],"genre_scores_gemma":[0.8762994,0.000010979204,0.11910428,0.002019995,0.00036093662,0.000020110208,0.000054767155,0.000055233097,0.0020743036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977285,0.000014791584,0.0002818795,0.0010079572,0.0006792975,0.0002875433],"domain_scores_gemma":[0.99870706,0.00009680044,0.00008878832,0.00065701216,0.00028610212,0.00016426948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030342967,0.00030470217,0.000401149,0.00089822983,0.00009189283,0.00018345313,0.00031196553,0.00014271912,0.0000056946606],"category_scores_gemma":[0.00007329674,0.00022361153,0.00009011638,0.00092595,0.00036272148,0.00006710786,0.00007304766,0.00049524324,0.000035681045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039146238,0.0004751366,0.014107213,0.0023216445,0.00019131719,0.000701098,0.0040432527,0.20985416,0.0051473873,0.011526061,0.0004073037,0.750834],"study_design_scores_gemma":[0.00028969845,0.00036034477,0.0007298647,0.0021106766,0.00020362162,0.00012394281,0.0000013190697,0.9912143,0.00079477695,0.002762859,0.00095998857,0.00044864966],"about_ca_topic_score_codex":0.00001093172,"about_ca_topic_score_gemma":0.000003906039,"teacher_disagreement_score":0.87514085,"about_ca_system_score_codex":0.0002430823,"about_ca_system_score_gemma":0.00035439964,"threshold_uncertainty_score":0.91186136},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046901562,0.00014837502,0.9938624,0.0019883106,0.0004640755,0.0011205644,0.000041972307,0.0004928698,0.0014124357],"genre_scores_gemma":[0.5090386,0.000043218795,0.48447433,0.0048595304,0.00077869016,0.0001427984,0.00016858314,0.000124436,0.00036978468],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997826,0.0000044359713,0.0003915377,0.0009690798,0.00044343612,0.0003655386],"domain_scores_gemma":[0.9984917,0.00020338819,0.00014247045,0.00075968157,0.00021288007,0.00018990274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002468217,0.00036373522,0.00040827144,0.00075979624,0.0001508739,0.00016647656,0.0004150441,0.00027026254,0.000022583517],"category_scores_gemma":[0.000057969683,0.0003106955,0.00022100116,0.00043806757,0.00052408,0.00019775618,0.0000714529,0.0007364332,0.0000060115635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002078636,0.0001082962,0.00007473548,0.0003689346,0.000023247647,0.000036784822,0.00015658779,0.0015400419,0.0018087864,0.011457298,0.00018648584,0.98403096],"study_design_scores_gemma":[0.0012777193,0.0025098077,0.001284729,0.001523262,0.00028543678,0.00013146651,7.093655e-7,0.25433928,0.0100438995,0.55005705,0.17729123,0.0012553907],"about_ca_topic_score_codex":0.000006538002,"about_ca_topic_score_gemma":0.00001661751,"teacher_disagreement_score":0.98277557,"about_ca_system_score_codex":0.0002001635,"about_ca_system_score_gemma":0.00067308976,"threshold_uncertainty_score":0.9999345},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027250708,0.00030015237,0.9755445,0.015798774,0.0029540795,0.001237592,0.0000908098,0.00024358643,0.001105446],"genre_scores_gemma":[0.9745345,0.00009445886,0.01009531,0.010222564,0.00056067936,0.0009121483,0.000026901658,0.00019643155,0.0033569946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595547,0.000034992103,0.00042645162,0.0020653252,0.0008379459,0.0006798136],"domain_scores_gemma":[0.9906406,0.008441867,0.00015097446,0.000529796,0.0001320686,0.000104715145],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000633658,0.0006476226,0.00054779067,0.00084676984,0.0005270616,0.00037349205,0.0006668881,0.00017010054,0.00006658321],"category_scores_gemma":[0.0013838492,0.0005384359,0.00019777169,0.0007029945,0.0008141603,0.0010271315,0.00021754456,0.0007371955,0.000037791717],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005819201,0.00014383937,0.0004347265,0.00071762514,0.00010191828,0.00008888663,0.0035331587,0.071961544,0.0019356022,0.0172936,0.0007311144,0.9024761],"study_design_scores_gemma":[0.0021751686,0.0050870017,0.0005583925,0.004011287,0.00019538635,0.0001919204,0.000016428947,0.5052496,0.013105975,0.30457452,0.16102213,0.0038121415],"about_ca_topic_score_codex":0.000046314446,"about_ca_topic_score_gemma":0.0032771102,"teacher_disagreement_score":0.97180945,"about_ca_system_score_codex":0.00043365164,"about_ca_system_score_gemma":0.00025694538,"threshold_uncertainty_score":0.99970675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027197844,0.00010873777,0.9949218,0.00057738414,0.0010906259,0.0015562488,0.000030774547,0.00036094512,0.0010814922],"genre_scores_gemma":[0.02531099,0.00008152041,0.97134423,0.0016984654,0.00038436425,0.00010817695,0.00003981044,0.000070938,0.0009615211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957324,0.000026597838,0.00055394985,0.0017644161,0.0013003147,0.00062227924],"domain_scores_gemma":[0.99776185,0.00046214942,0.00030128888,0.0009928633,0.0002594843,0.00022235131],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005055993,0.00061941444,0.0005200272,0.0008659419,0.00028902624,0.00085585844,0.0018269514,0.00017045211,0.000024835797],"category_scores_gemma":[0.000051925963,0.00048465087,0.000111843394,0.0004185995,0.0005701835,0.00075639604,0.0005927499,0.0006776074,0.00006049384],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003417156,0.00010653839,0.000009076235,0.00019632216,0.000020542762,0.00019702956,0.0003933532,0.0006908975,0.024291804,0.0030174784,0.000121636505,0.97092116],"study_design_scores_gemma":[0.0021930113,0.0032570024,0.00009093675,0.0025669471,0.000061563966,0.00014501133,0.0000016195416,0.74593955,0.20773977,0.036325604,0.0002980254,0.0013809652],"about_ca_topic_score_codex":0.000024063123,"about_ca_topic_score_gemma":0.0000342952,"teacher_disagreement_score":0.9695402,"about_ca_system_score_codex":0.00061213534,"about_ca_system_score_gemma":0.00042708468,"threshold_uncertainty_score":0.9997605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006200054,0.0005982375,0.9952186,0.0011089159,0.0010180682,0.0010539064,0.00007660489,0.00015674415,0.00014892565],"genre_scores_gemma":[0.033118516,0.000027878043,0.9638096,0.000748331,0.0012146346,0.000047058933,0.00006649376,0.000070742164,0.00089673384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519616,0.000049728744,0.00061111175,0.002443066,0.0009958977,0.0007040253],"domain_scores_gemma":[0.9972444,0.00068982696,0.00030231517,0.001173308,0.0003799703,0.00021018958],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068303256,0.0007340391,0.00064825243,0.0005174261,0.00060314784,0.00095996633,0.0019958466,0.00035336148,0.000007860545],"category_scores_gemma":[0.00012774473,0.00056017406,0.00017529906,0.00044668958,0.00053168216,0.00054645434,0.0012632627,0.00071583193,0.000011246021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008299781,0.00013840708,0.0000067458636,0.00008041004,0.000033099474,0.000077146535,0.0011156079,0.65850866,0.0042186202,0.008115998,0.00022825599,0.32739407],"study_design_scores_gemma":[0.00094073464,0.0003281113,0.000006262394,0.00068522047,0.00003830321,0.00001826732,5.869588e-7,0.9379345,0.0011474732,0.057837557,0.00036912184,0.00069385424],"about_ca_topic_score_codex":0.000037592097,"about_ca_topic_score_gemma":0.00023603292,"teacher_disagreement_score":0.3267002,"about_ca_system_score_codex":0.00030160317,"about_ca_system_score_gemma":0.0007300128,"threshold_uncertainty_score":0.999685},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000122142355,0.00014977902,0.99511224,0.0015244124,0.0009198188,0.0008099555,0.0000133514195,0.0005217276,0.000936501],"genre_scores_gemma":[0.102092676,0.000020856707,0.89628965,0.0005781321,0.000324972,0.00012724193,0.000015845431,0.000032343105,0.0005183083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973989,0.000009461542,0.0004719835,0.0012664667,0.00048212882,0.00037104482],"domain_scores_gemma":[0.997937,0.00046054675,0.0002110113,0.0010850196,0.00020312458,0.0001032764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046649826,0.00036327317,0.0003015758,0.0004987958,0.0002828088,0.00073529116,0.0015400451,0.0003587649,0.000009025248],"category_scores_gemma":[0.00009872311,0.00034341303,0.00015363136,0.00055901054,0.0002971757,0.0003759879,0.00034940665,0.0005509456,0.000037491136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027656693,0.000010897427,7.6482377e-7,0.000060497146,0.0000050517233,0.000003268786,0.00012581788,0.047571428,0.0000906827,0.59632355,0.000023881626,0.3557814],"study_design_scores_gemma":[0.000037220452,0.0000909745,0.0000034489606,0.00020196466,0.0000057987836,0.000011042167,4.9874437e-8,0.50229603,0.0005762841,0.49564704,0.00093089626,0.00019922553],"about_ca_topic_score_codex":0.0000119572305,"about_ca_topic_score_gemma":0.000019981399,"teacher_disagreement_score":0.45472464,"about_ca_system_score_codex":0.0003133487,"about_ca_system_score_gemma":0.0002750126,"threshold_uncertainty_score":0.9999018},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009634083,0.0006084531,0.9941003,0.00316944,0.0001287689,0.00071815966,0.00015483747,0.00006400379,0.000092675094],"genre_scores_gemma":[0.38334423,0.00021709374,0.6157524,0.0002358705,0.0000720248,0.00002761852,0.00028043368,0.000018990811,0.000051368763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850404,0.00000746335,0.00031320084,0.0006397815,0.00037482483,0.00016066107],"domain_scores_gemma":[0.99884665,0.00038842237,0.00012098992,0.0004754416,0.000102362654,0.00006612028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005585766,0.00016489594,0.00032026984,0.00053240365,0.000042905118,0.00003834408,0.00028836122,0.00009574447,0.000011386392],"category_scores_gemma":[0.0002927915,0.00014982239,0.000042813623,0.00032115483,0.00034830155,0.00015718998,0.00027073818,0.0005053414,0.0000016782361],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010574305,0.00040373675,0.0007739914,0.0057425634,0.000091333524,0.00006148458,0.00023773707,0.07614241,0.0018709381,0.035180748,0.00056627183,0.87882304],"study_design_scores_gemma":[0.00011417105,0.00003874562,0.000072766496,0.0024192247,0.000042042873,0.000038097296,5.443162e-8,0.76753193,0.000028376007,0.2296093,0.000027210015,0.00007811255],"about_ca_topic_score_codex":0.000012786468,"about_ca_topic_score_gemma":0.000003079986,"teacher_disagreement_score":0.87874496,"about_ca_system_score_codex":0.000111023575,"about_ca_system_score_gemma":0.00018977378,"threshold_uncertainty_score":0.610958},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003556058,0.004544498,0.9691264,0.000226543,0.0026259169,0.00038198175,0.0000083569985,0.0007574116,0.018772846],"genre_scores_gemma":[0.96797574,0.00020808991,0.030605296,0.00021214705,0.00064500625,0.0000071803915,0.000009529583,0.00009097836,0.0002460416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979185,0.000008176858,0.00039310436,0.0006517114,0.00058210804,0.00044641073],"domain_scores_gemma":[0.999244,0.00017350879,0.00003138044,0.0004171882,0.000055923425,0.00007800203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053402374,0.00039779392,0.00040923528,0.00093452807,0.000052881824,0.00030979686,0.00064248824,0.00021434532,0.000103184495],"category_scores_gemma":[0.000029912797,0.00037271646,0.00014279714,0.00059918844,0.00011350842,0.00021950726,0.0000973384,0.0007839472,0.000074214004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004057093,0.00003343673,0.0004735584,0.00053137704,0.00011678555,0.000306614,0.0034929977,0.71447647,0.0046177357,0.0013432765,0.000066338005,0.27453732],"study_design_scores_gemma":[0.00020073613,0.00003189054,0.00009777794,0.0010183478,0.000046862555,0.000023112978,7.9846404e-7,0.96538925,0.0020832706,0.029388934,0.0009892462,0.0007297545],"about_ca_topic_score_codex":0.000012767887,"about_ca_topic_score_gemma":0.00026860085,"teacher_disagreement_score":0.96441966,"about_ca_system_score_codex":0.00040844944,"about_ca_system_score_gemma":0.00007434409,"threshold_uncertainty_score":0.9998725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04295527,0.0009662719,0.9247948,0.001764967,0.0070202295,0.0018003997,0.00002593648,0.00019034966,0.0204818],"genre_scores_gemma":[0.9615422,0.000082131446,0.035633314,0.0010748903,0.0012863008,0.0000108585,0.00006162442,0.000057306257,0.0002513604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973515,0.00003512851,0.0003857423,0.0007553693,0.0012281735,0.00024408757],"domain_scores_gemma":[0.9983137,0.00042542734,0.00019324681,0.0005762513,0.00035560274,0.00013576816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016347159,0.0002622381,0.00038808282,0.0006094808,0.00008215104,0.000108048305,0.00032802165,0.00020233307,0.00015772555],"category_scores_gemma":[0.00091822585,0.00021532118,0.00008402528,0.0002430409,0.0005440141,0.00015349474,0.0000589754,0.001101173,0.00002491748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018584693,0.000024923163,0.00017748869,0.00012916328,0.000015720425,0.000019086508,0.0002714436,0.027888697,0.0015055847,0.00047553825,0.000013692761,0.96946007],"study_design_scores_gemma":[0.00065117993,0.0003168974,0.00092073524,0.0043559936,0.00015486359,0.00043808634,9.4996466e-7,0.9557348,0.0028360656,0.03360574,0.00065263454,0.00033205602],"about_ca_topic_score_codex":0.000014669237,"about_ca_topic_score_gemma":0.000008814389,"teacher_disagreement_score":0.969128,"about_ca_system_score_codex":0.0003439093,"about_ca_system_score_gemma":0.0005596037,"threshold_uncertainty_score":0.8780543},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0339124,0.0019339088,0.95576066,0.005778267,0.0007617219,0.0012249616,0.00003651871,0.000041945466,0.00054960314],"genre_scores_gemma":[0.9428893,0.00057547993,0.054137588,0.0012299499,0.000691176,0.00009118439,0.000027769338,0.00005675914,0.00030083337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977264,0.000025429692,0.00043952122,0.00085523527,0.0005706866,0.0003827752],"domain_scores_gemma":[0.99822474,0.00083946215,0.00014446463,0.0005958066,0.00008316388,0.00011236438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007537604,0.0003221482,0.00051952177,0.0004513295,0.00010442137,0.00018658335,0.00056373194,0.00014368368,0.000020330119],"category_scores_gemma":[0.00013498224,0.00022514124,0.00007552176,0.00062041194,0.00044289455,0.00021913653,0.00012141037,0.0010859286,0.000008935069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019341156,0.000035626486,0.0013575667,0.00028095444,0.000051440595,0.00004921544,0.0025809002,0.48366085,0.023641462,0.00024927326,0.00018306941,0.48771623],"study_design_scores_gemma":[0.000724814,0.00019545798,0.015394252,0.006029432,0.00019487344,0.000078934805,0.0000031459888,0.949345,0.015253052,0.010363862,0.001643422,0.0007737524],"about_ca_topic_score_codex":0.0007010311,"about_ca_topic_score_gemma":0.00012602034,"teacher_disagreement_score":0.90897685,"about_ca_system_score_codex":0.00029178662,"about_ca_system_score_gemma":0.00023965475,"threshold_uncertainty_score":0.91809934},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03899096,0.018789696,0.9378151,0.00049657165,0.0016021007,0.0011655815,0.00004511962,0.00013637179,0.00095849234],"genre_scores_gemma":[0.97957295,0.0009481596,0.01732326,0.0014762753,0.00042779697,0.000018932156,0.000024864928,0.00007987571,0.0001279009],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800044,0.0000063076413,0.00028864713,0.00096112996,0.00035118702,0.0003923059],"domain_scores_gemma":[0.9992787,0.00014178475,0.000046622918,0.00029490216,0.00009825417,0.00013972036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002061113,0.0003872662,0.00039317206,0.0006131757,0.00015613541,0.0002408087,0.0001077561,0.00011163587,0.000017370887],"category_scores_gemma":[0.000008512094,0.00031644545,0.000118759526,0.0002945165,0.00050136395,0.00016038441,0.00009176411,0.00048516295,0.0000056932918],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020226045,0.00011184309,0.029568465,0.001314448,0.00028479795,0.0007382043,0.002698596,0.004316094,0.023744134,0.0015987334,0.000025649399,0.9353968],"study_design_scores_gemma":[0.014119102,0.0064383782,0.039522357,0.054669388,0.005942072,0.010090176,0.0000268568,0.18748109,0.07116711,0.56039745,0.041310865,0.008835185],"about_ca_topic_score_codex":0.000029062128,"about_ca_topic_score_gemma":0.000019705183,"teacher_disagreement_score":0.940582,"about_ca_system_score_codex":0.00028885534,"about_ca_system_score_gemma":0.0002089538,"threshold_uncertainty_score":0.9999288},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011813035,0.0010670702,0.97294533,0.0007398085,0.0018943426,0.00086482085,0.000024186129,0.0003298191,0.010321593],"genre_scores_gemma":[0.79472816,0.00015452006,0.20170465,0.0016331868,0.00089385395,0.000011573208,0.00011348401,0.00014593672,0.00061464467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966456,0.000018593344,0.0005426943,0.0012700611,0.0008819777,0.00064105855],"domain_scores_gemma":[0.9983649,0.00042117925,0.000118150245,0.00074699585,0.00015173818,0.00019704067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044844925,0.0005926223,0.00070358685,0.0017344856,0.000120086166,0.00025052382,0.00037801312,0.00030749198,0.000054310163],"category_scores_gemma":[0.000095763084,0.0005327682,0.00031125298,0.0015445091,0.0009915609,0.00024593718,0.00012278411,0.001327658,0.00009564863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003367007,0.00067951565,0.01205985,0.001856865,0.0004087615,0.00066141173,0.01082225,0.120110385,0.025666207,0.006242234,0.00020340142,0.8209524],"study_design_scores_gemma":[0.0035933745,0.0015036744,0.012661909,0.010924933,0.00045340208,0.0011782568,0.000006908179,0.5809275,0.0036768322,0.37607434,0.0060145757,0.0029843065],"about_ca_topic_score_codex":0.0000772852,"about_ca_topic_score_gemma":0.00003359694,"teacher_disagreement_score":0.81796813,"about_ca_system_score_codex":0.00025316075,"about_ca_system_score_gemma":0.0003182415,"threshold_uncertainty_score":0.9997124},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101382,0.0001403855,0.98630655,0.0005350772,0.0013902468,0.0006002198,0.0000038438316,0.00032160163,0.0005638745],"genre_scores_gemma":[0.95693773,0.0001562064,0.04156085,0.00057399616,0.00024171663,0.000015543286,0.000005975587,0.000048708946,0.00045926083],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99710417,0.000058769987,0.00046190273,0.001378147,0.00066209753,0.00033492834],"domain_scores_gemma":[0.9985925,0.00058585056,0.00020766011,0.00039935813,0.00006405794,0.00015054923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050776015,0.00038401745,0.0002870763,0.00063139293,0.00037003768,0.00050036487,0.00039553392,0.00024101748,0.000022553222],"category_scores_gemma":[0.00026109873,0.00034815626,0.00007561509,0.00047580292,0.0002761521,0.00046864958,0.00021469261,0.0006018087,0.00004252816],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007967534,0.000009445951,0.0000026992013,0.000035688183,0.0000013125308,0.0000036745287,0.0020706994,0.0004980752,0.478545,0.0003543421,0.0000021595654,0.5184689],"study_design_scores_gemma":[0.0002363206,0.00013777312,0.00014938654,0.0010035376,0.000019544368,0.00006193298,0.0000051746483,0.48647198,0.49753857,0.013891761,0.00011324593,0.00037076898],"about_ca_topic_score_codex":0.000030447032,"about_ca_topic_score_gemma":0.00015296089,"teacher_disagreement_score":0.9467995,"about_ca_system_score_codex":0.00034815804,"about_ca_system_score_gemma":0.0002090537,"threshold_uncertainty_score":0.99989706},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030764553,0.00044281833,0.9935759,0.0017179418,0.0016873556,0.00082889193,0.000010782294,0.0006729032,0.00075579336],"genre_scores_gemma":[0.099952005,0.0000174952,0.8940292,0.0050119665,0.00044701077,0.000046161837,0.000041814343,0.000073201096,0.00038115305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947126,0.000087393826,0.000749081,0.0018858045,0.0018446198,0.00072050263],"domain_scores_gemma":[0.99740225,0.0005455467,0.0003546944,0.0012143544,0.00017783673,0.00030534156],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013972363,0.00063324725,0.0005403457,0.0012803783,0.00029361207,0.0011377754,0.0025904838,0.00021890558,0.00014032997],"category_scores_gemma":[0.00009223873,0.0005805853,0.00018190937,0.0010661377,0.00071518216,0.00090011983,0.0008551996,0.00093513285,0.00014672053],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001485879,0.00012354039,0.00015582217,0.00018951294,0.000025775924,0.0005271618,0.0011072253,0.001955192,0.024867233,0.008530608,0.00043090567,0.96207213],"study_design_scores_gemma":[0.0007143718,0.00031202915,0.00017740317,0.0008538189,0.000017757464,0.00011860625,5.864728e-7,0.62566674,0.074736506,0.29500207,0.0013383068,0.0010618322],"about_ca_topic_score_codex":0.000046789133,"about_ca_topic_score_gemma":0.000013510987,"teacher_disagreement_score":0.96101034,"about_ca_system_score_codex":0.0007150306,"about_ca_system_score_gemma":0.00045906336,"threshold_uncertainty_score":0.99989915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027187429,0.0010086253,0.9933773,0.000115120216,0.0009497009,0.00029081653,0.0000050164313,0.00033649374,0.0038896818],"genre_scores_gemma":[0.7799485,0.00016001597,0.21759711,0.000559778,0.0013766224,0.000016836577,0.000009401027,0.00008448981,0.0002472785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905586,0.0000036557428,0.00016523675,0.0004057092,0.00013668038,0.00023283121],"domain_scores_gemma":[0.9994685,0.00018475826,0.000033953052,0.00021615895,0.000050750474,0.000045887184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010681511,0.00022437646,0.00021507422,0.00016155164,0.000066027846,0.00014523267,0.00019403145,0.00019381888,0.0000022496795],"category_scores_gemma":[0.000008487816,0.00021143927,0.000043231816,0.000099336656,0.00043007996,0.000089839945,0.00010215841,0.0002986956,0.0000014632059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010063499,0.0000029368732,0.0000071365776,0.000077542514,0.000037438796,0.000077671604,0.00029747654,0.353348,0.00020789537,0.088056535,0.0015067218,0.5563706],"study_design_scores_gemma":[0.00003931709,0.000042492313,0.000002545327,0.0004807099,0.000008785729,0.00003392994,8.374887e-8,0.6948455,0.0007217362,0.3018959,0.0017374251,0.00019156352],"about_ca_topic_score_codex":0.000002013815,"about_ca_topic_score_gemma":0.000017102668,"teacher_disagreement_score":0.7799213,"about_ca_system_score_codex":0.00007061474,"about_ca_system_score_gemma":0.0000475918,"threshold_uncertainty_score":0.86222434},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000089358815,0.00031604417,0.9970673,0.00034626803,0.0006633204,0.00052733504,0.000011435522,0.0002087709,0.0007701888],"genre_scores_gemma":[0.22498529,0.000012307418,0.7738134,0.00082558376,0.00012456151,0.000017178822,0.000014603645,0.000029703304,0.00017734552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963865,0.00004783672,0.0008018322,0.001182647,0.0011781006,0.00040302615],"domain_scores_gemma":[0.9971965,0.0012676144,0.0003253663,0.0008628815,0.0002320542,0.000115586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008498593,0.00039299304,0.000457971,0.0014299862,0.00006436916,0.0003293966,0.0018529507,0.00023630622,0.00006315869],"category_scores_gemma":[0.00021948396,0.00037260016,0.00010016039,0.0009610753,0.0005905916,0.00069377106,0.0005552403,0.0006102484,0.000019883388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072802904,0.00011552365,0.00018580294,0.0003431721,0.000021285763,0.00015665042,0.0010606868,0.44011068,0.0049706604,0.0031631899,0.00001732438,0.5498478],"study_design_scores_gemma":[0.00035658455,0.0001556952,0.000066655964,0.0008135088,0.000017185217,0.0000041228786,2.6251354e-7,0.8535073,0.098248094,0.046428733,0.000020287134,0.00038159746],"about_ca_topic_score_codex":0.00003553023,"about_ca_topic_score_gemma":0.000024328496,"teacher_disagreement_score":0.54946613,"about_ca_system_score_codex":0.00018731195,"about_ca_system_score_gemma":0.00052629755,"threshold_uncertainty_score":0.99987257},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035823796,0.0001912074,0.99362665,0.0017376083,0.00033034303,0.0028758424,0.000009067184,0.00028540925,0.0009080403],"genre_scores_gemma":[0.0025147733,0.000017135435,0.9951239,0.00096353225,0.00036545566,0.000537894,0.000012552997,0.000060579794,0.00040414682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576044,0.000017439941,0.0004983488,0.0017778883,0.0012674195,0.0006784773],"domain_scores_gemma":[0.99811584,0.00027046475,0.00026950115,0.00085373095,0.0002792784,0.00021121623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007197714,0.000506347,0.0004032156,0.00037712377,0.00039713542,0.0004932255,0.0019326257,0.00021934597,0.0000061508576],"category_scores_gemma":[0.00002319528,0.00041110182,0.00009006485,0.0005952788,0.0004537114,0.0007839671,0.0009166799,0.0007028924,0.000015344725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029975721,0.000032579217,0.0000020248242,0.0001263953,0.000023461613,0.00005887003,0.0012117798,0.6933397,0.00087882497,0.1288032,0.000034694436,0.17545846],"study_design_scores_gemma":[0.0002003212,0.0002085538,3.92434e-7,0.00040980172,0.000008171436,0.000048740676,3.6369252e-7,0.70459473,0.0012785294,0.2927143,0.0001808647,0.00035521423],"about_ca_topic_score_codex":0.0000048226266,"about_ca_topic_score_gemma":0.00003762631,"teacher_disagreement_score":0.17510325,"about_ca_system_score_codex":0.00047238468,"about_ca_system_score_gemma":0.00074381556,"threshold_uncertainty_score":0.99983406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07901315,0.00017246981,0.91759336,0.0012577256,0.00016382808,0.0015822243,0.00004574784,0.00015010027,0.000021382026],"genre_scores_gemma":[0.30261034,0.000092735776,0.69659483,0.00041865435,0.00003907219,0.00005522689,0.000015471975,0.00003261274,0.00014107014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809676,0.00001852819,0.00038505948,0.00073507684,0.00048718232,0.00027740555],"domain_scores_gemma":[0.9990836,0.0000665843,0.00014718252,0.00034092652,0.00022592231,0.0001357831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029672208,0.00028726258,0.0004643826,0.0007905179,0.00013043593,0.00009735923,0.00015746639,0.0000820226,0.0000035669968],"category_scores_gemma":[0.000035549114,0.00023418863,0.00005097888,0.0005093543,0.00030170946,0.00017736945,0.00031015076,0.0004505994,4.4596507e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104033716,0.00048653423,0.00041498785,0.0011155297,0.00007780085,0.0001534624,0.0065583866,0.7629462,0.048609752,0.000672683,0.000054593092,0.17880607],"study_design_scores_gemma":[0.00030295254,0.00011957597,0.000034802946,0.0030363223,0.00009073792,0.0000659087,0.000008948262,0.9872496,0.0013386664,0.0075324303,0.0000153489,0.00020469396],"about_ca_topic_score_codex":0.00071397435,"about_ca_topic_score_gemma":0.00014667113,"teacher_disagreement_score":0.22430344,"about_ca_system_score_codex":0.0005209011,"about_ca_system_score_gemma":0.0003149045,"threshold_uncertainty_score":0.9549935},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048231683,0.0015318395,0.99120957,0.0019045598,0.003466719,0.0005294013,0.000019605275,0.00016682992,0.0011232627],"genre_scores_gemma":[0.13625395,0.000054607426,0.86259747,0.00029207795,0.00041591775,0.000029862673,0.000004786246,0.000042985837,0.00030832415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970154,0.000025329382,0.0006120965,0.0013418795,0.0005806195,0.0004246552],"domain_scores_gemma":[0.9978158,0.0005974476,0.00029744126,0.0009200847,0.00029616573,0.00007305082],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009520366,0.00036818616,0.0005122798,0.00075264444,0.000138189,0.00015638568,0.0017203072,0.0003388046,0.00000627222],"category_scores_gemma":[0.000052283976,0.00036278105,0.00018739256,0.0005361479,0.0005869758,0.00034971497,0.00035441443,0.00048817685,0.000007684054],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018455516,0.000017179198,0.00000906178,0.0003218468,0.000022196338,0.000011573365,0.0008585461,0.036136728,0.004492958,0.033950537,0.00002304092,0.9241379],"study_design_scores_gemma":[0.00018010807,0.00016385493,0.000009599991,0.00024639087,0.000016720747,0.00002560269,9.140822e-8,0.5412924,0.009682998,0.44725055,0.0008322163,0.00029946785],"about_ca_topic_score_codex":0.00003719855,"about_ca_topic_score_gemma":0.00007310782,"teacher_disagreement_score":0.92383844,"about_ca_system_score_codex":0.00044358542,"about_ca_system_score_gemma":0.00046915066,"threshold_uncertainty_score":0.9998824},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018874939,0.0017787559,0.9909442,0.00029275494,0.0025788706,0.0004272438,0.000010829001,0.00034647709,0.0017333707],"genre_scores_gemma":[0.91980904,0.0006110325,0.07719304,0.00045863967,0.0009606855,0.00004897297,0.000003178361,0.00010129967,0.0008141361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570125,0.00002397683,0.00048448896,0.001962065,0.001069807,0.00075841317],"domain_scores_gemma":[0.9979604,0.00035396905,0.0002166247,0.0009876209,0.00026620587,0.00021520398],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006927772,0.00065529434,0.00048922864,0.0009325547,0.00046151792,0.0011446623,0.0013629543,0.00036282217,0.000024900282],"category_scores_gemma":[0.000022352955,0.00053513085,0.00008704356,0.0010897716,0.00058841525,0.0014866731,0.00065397023,0.0011394963,0.00003115457],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027090193,0.000012600993,0.000118467695,0.00019587901,0.000032721895,0.000042255,0.00096867105,0.021430835,0.009187587,0.001383058,0.0000058692485,0.966595],"study_design_scores_gemma":[0.00083335047,0.0010429012,0.0009958703,0.0043635825,0.000097199045,0.0055285394,0.0000041127746,0.77888405,0.11206899,0.09042293,0.0031301833,0.0026282822],"about_ca_topic_score_codex":0.0003897362,"about_ca_topic_score_gemma":0.0040924875,"teacher_disagreement_score":0.96396667,"about_ca_system_score_codex":0.0009953884,"about_ca_system_score_gemma":0.0005410282,"threshold_uncertainty_score":0.99989223},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011769753,0.0013414252,0.9949818,0.00024557943,0.0011301091,0.0007223864,0.00004983433,0.000067655834,0.0002842005],"genre_scores_gemma":[0.8286249,0.0002685487,0.17067826,0.000040861243,0.0002834041,0.00003133491,0.00001263082,0.000032896547,0.000027184298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967328,0.000029987197,0.00045182245,0.0014022564,0.0010459219,0.00033726348],"domain_scores_gemma":[0.99805087,0.00017733575,0.0002769588,0.0008450146,0.0005823823,0.000067449175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019279033,0.00031587775,0.00032721506,0.00054107007,0.00022127073,0.0002250788,0.0014203129,0.00022706465,0.000007969428],"category_scores_gemma":[0.000023618953,0.0003004489,0.000052942156,0.0004214875,0.00035953676,0.0016026672,0.0004198102,0.00047177039,9.0634757e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008027619,0.000004459543,0.00002733822,0.000100518795,0.000010459054,2.2462581e-7,0.00034763812,0.31038198,0.00054795766,0.000659145,3.2155447e-7,0.6879119],"study_design_scores_gemma":[0.00026888278,0.00006577478,0.00020135177,0.00048974826,0.000068897614,0.00003577474,6.767372e-7,0.97749764,0.00054491806,0.0204679,0.000048155885,0.0003102707],"about_ca_topic_score_codex":0.000056204277,"about_ca_topic_score_gemma":0.0001189909,"teacher_disagreement_score":0.8274479,"about_ca_system_score_codex":0.0005660293,"about_ca_system_score_gemma":0.0006038374,"threshold_uncertainty_score":0.99994475},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000104690866,0.0014483967,0.98662484,0.00077007816,0.0040795044,0.0002458273,0.0000073450833,0.00023075026,0.006488598],"genre_scores_gemma":[0.3573014,0.0001954081,0.6365456,0.0010598447,0.0015334853,0.000020313073,0.000021062204,0.000098993674,0.0032238853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968038,0.000028035707,0.00068911706,0.0013332324,0.0006459534,0.0004998568],"domain_scores_gemma":[0.997727,0.00045798084,0.0003499326,0.0011432589,0.00020807437,0.00011375677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009912165,0.00038531542,0.00041703982,0.0006535937,0.0002571609,0.0005270042,0.0028724435,0.00026340527,0.000029552735],"category_scores_gemma":[0.00008246562,0.00039077856,0.0001722277,0.0006598946,0.000471784,0.0004642228,0.0014197289,0.0008357868,0.0001046828],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020843258,0.000049587812,0.00003533558,0.00023725443,0.00003275741,0.000019617359,0.004074372,0.008764609,0.0012426683,0.1955245,0.00029322546,0.789724],"study_design_scores_gemma":[0.00011822922,0.00007727183,0.000013780262,0.0013090152,0.000014610981,0.000026416623,6.209157e-7,0.6164071,0.002570371,0.36685085,0.011982865,0.0006288943],"about_ca_topic_score_codex":0.0000123738655,"about_ca_topic_score_gemma":0.000012452569,"teacher_disagreement_score":0.7890951,"about_ca_system_score_codex":0.00019466241,"about_ca_system_score_gemma":0.00033442865,"threshold_uncertainty_score":0.9998544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029891639,0.00022145099,0.9822562,0.0036158694,0.0064970213,0.00068895513,0.000035442205,0.00010934105,0.0035865542],"genre_scores_gemma":[0.5641589,0.000016825552,0.37987646,0.004466643,0.0015685525,0.000023449766,0.000011731633,0.00009663003,0.049780816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99150175,0.000041392854,0.0009662135,0.0036340428,0.0031308613,0.00072575436],"domain_scores_gemma":[0.9946398,0.0018834398,0.00020097525,0.0022436513,0.0005674352,0.00046471282],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0079115555,0.00046490418,0.00054778444,0.0027737485,0.00048810727,0.0033254568,0.0035915673,0.00016712886,0.000078554556],"category_scores_gemma":[0.003435028,0.00037167518,0.00010288611,0.0030749515,0.0005209788,0.00043777333,0.004973651,0.0005590971,0.0004767665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019818926,0.000020206404,0.00001951352,0.00003496892,0.000008800413,0.00008321246,0.0015903664,0.26394865,0.0011730469,0.008031944,0.0008072176,0.72426224],"study_design_scores_gemma":[0.0002933754,0.0005044991,0.0005540218,0.0013265427,0.000037520935,0.000059476028,0.000017901682,0.75552356,0.0043053995,0.19837803,0.037389204,0.0016104376],"about_ca_topic_score_codex":0.0000354416,"about_ca_topic_score_gemma":0.00042934035,"teacher_disagreement_score":0.7226518,"about_ca_system_score_codex":0.00027410957,"about_ca_system_score_gemma":0.00034508653,"threshold_uncertainty_score":0.9998735},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000105765524,0.0029654594,0.989919,0.0005511777,0.0009499954,0.0003878562,0.000011501914,0.000057416328,0.005051822],"genre_scores_gemma":[0.6505137,0.000645247,0.34684724,0.0013644989,0.00041034142,0.000041696294,0.000013578172,0.000038152393,0.0001255686],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709505,0.00004964786,0.0005742791,0.0010285128,0.0007278483,0.00052465947],"domain_scores_gemma":[0.99678093,0.00097600784,0.00025941659,0.0017408319,0.00016859641,0.00007423957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001221174,0.00033792979,0.0004064467,0.00078900484,0.00022661629,0.00034207825,0.0048905914,0.00021394056,0.000003881623],"category_scores_gemma":[0.00015201706,0.00025217168,0.00013646884,0.0012365974,0.0008437603,0.0004734852,0.0018625491,0.00077852805,0.000004958893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051926236,0.000024035988,0.00018956709,0.000020290057,0.0000039912757,0.000009813349,0.00038309203,0.00052913313,0.000032936434,0.42315137,0.000013949143,0.5756366],"study_design_scores_gemma":[0.00013955374,0.00007902557,0.00032120277,0.00033289558,0.0000029564449,0.000007315944,3.8860674e-7,0.24109119,0.0009712364,0.748135,0.008643997,0.00027527654],"about_ca_topic_score_codex":0.00008388265,"about_ca_topic_score_gemma":0.0004667948,"teacher_disagreement_score":0.6504079,"about_ca_system_score_codex":0.0000900915,"about_ca_system_score_gemma":0.0006323919,"threshold_uncertainty_score":0.999993},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020833434,0.00050165853,0.9826489,0.004548732,0.0019959372,0.0002238296,0.000032291668,0.000113616086,0.009932926],"genre_scores_gemma":[0.056688186,0.00025885509,0.9394209,0.0010201185,0.0005175808,0.00000581177,0.00003146989,0.000044125944,0.0020129727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973367,0.000022476368,0.00046938562,0.0010409809,0.0008045515,0.00032591936],"domain_scores_gemma":[0.99585193,0.00045028137,0.00020665546,0.0032106875,0.00019978467,0.0000806621],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009356395,0.00028042062,0.00028997075,0.00034619807,0.00024950074,0.00056278147,0.0065071476,0.00014562983,0.00003188462],"category_scores_gemma":[0.00010503474,0.00020119551,0.0000760079,0.0005080183,0.0022279439,0.0006007185,0.004175206,0.00055810786,0.000036538462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018206824,0.0000055928244,0.000008699258,0.000020679137,0.000010702757,0.0000104688725,0.00015021958,0.0044204304,0.000010820283,0.41556942,0.00014081685,0.57965034],"study_design_scores_gemma":[0.00007622596,0.000026500285,0.0000708044,0.00010894629,0.0000057437555,0.00002597373,1.0468783e-7,0.53826106,0.00007752615,0.45571104,0.0054562134,0.00017990643],"about_ca_topic_score_codex":0.000022692593,"about_ca_topic_score_gemma":0.0004228404,"teacher_disagreement_score":0.5794704,"about_ca_system_score_codex":0.000108390566,"about_ca_system_score_gemma":0.00047617697,"threshold_uncertainty_score":0.9988681},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000309042,0.0009751923,0.9807224,0.005024023,0.009744038,0.0004774828,0.000108062595,0.00071074127,0.0019290198],"genre_scores_gemma":[0.47154605,0.00062864134,0.5034412,0.013010745,0.0072011696,0.00017401396,0.000106752166,0.00029198962,0.0035994346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934459,0.00006293985,0.00075916,0.0027821753,0.0021896816,0.00076019176],"domain_scores_gemma":[0.99673176,0.0006096962,0.00015642011,0.0017442269,0.00027055756,0.00048734955],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007882188,0.0007327795,0.00064310135,0.0010443238,0.00023797198,0.0010997326,0.0045971754,0.000649124,0.000114864415],"category_scores_gemma":[0.00023017485,0.00066892087,0.00015796185,0.0011393859,0.0005844822,0.00059757795,0.0028590942,0.0017066931,0.00029182388],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019574536,0.000031661704,0.00003967158,0.000042841246,0.000045834626,0.00027635487,0.0020709818,0.01372846,0.0020754433,0.0038009598,0.00093022786,0.976938],"study_design_scores_gemma":[0.00024513653,0.00033799294,0.00022680702,0.0014395647,0.000024375544,0.00012077426,3.429143e-7,0.76197,0.010465964,0.22014241,0.004105414,0.00092120125],"about_ca_topic_score_codex":0.00018242934,"about_ca_topic_score_gemma":0.00036105985,"teacher_disagreement_score":0.97601676,"about_ca_system_score_codex":0.0008723592,"about_ca_system_score_gemma":0.0008208281,"threshold_uncertainty_score":0.99993724},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01588936,0.0005156611,0.96509916,0.01681203,0.00054278487,0.0003511951,0.0000036685728,0.00003909849,0.00074703945],"genre_scores_gemma":[0.99097186,0.00002829677,0.007353796,0.0011724709,0.0004003748,0.0000053389426,0.000011768655,0.000017056323,0.000039031853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975431,0.000034046618,0.000648712,0.0005591216,0.00089046784,0.00032453003],"domain_scores_gemma":[0.9980269,0.00093593687,0.00014299423,0.00053095206,0.00022217022,0.00014106554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017425589,0.00022034258,0.0005268977,0.0009778027,0.00007524417,0.00012614802,0.0004864984,0.0004200234,0.00024325037],"category_scores_gemma":[0.0005049626,0.00013367648,0.0003336243,0.001274728,0.0010923509,0.00011902175,0.00012232146,0.0015294772,0.000015315962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004380468,0.00020380202,0.015162467,0.00032450922,0.00018712784,0.00028300285,0.0023467457,0.045409545,0.0006178988,0.0010460992,0.00009947404,0.9342755],"study_design_scores_gemma":[0.00004356094,0.00021888598,0.0049429466,0.001309845,0.0001649278,0.000025538615,0.000003935235,0.9338304,0.0025756825,0.056636997,0.000034128097,0.00021316981],"about_ca_topic_score_codex":0.0009882642,"about_ca_topic_score_gemma":0.0003915121,"teacher_disagreement_score":0.9750825,"about_ca_system_score_codex":0.0005520806,"about_ca_system_score_gemma":0.003553455,"threshold_uncertainty_score":0.6644902},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0116796885,0.0024910332,0.975344,0.006101659,0.0006410035,0.00024853792,0.000026978687,0.00018173883,0.0032853459],"genre_scores_gemma":[0.93739337,0.0002991317,0.05624643,0.0027790575,0.0014618377,0.000008456385,0.0006414877,0.00010280122,0.0010674098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557745,0.000032427914,0.00070782023,0.0014016184,0.0016737544,0.00060689787],"domain_scores_gemma":[0.9977712,0.0009288165,0.00017410716,0.0005905903,0.00013189553,0.00040341506],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0014280439,0.00046985928,0.001044131,0.001449057,0.000105998144,0.00033068663,0.0008002648,0.00045959276,0.00064296694],"category_scores_gemma":[0.0011584985,0.00038731625,0.00028701866,0.0013122552,0.00078888255,0.00011762794,0.0006448993,0.0037601741,0.00006815974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008413794,0.00013859387,0.03326297,0.0002832992,0.0006824701,0.00841989,0.0017579371,0.09858822,0.0009795747,0.004851223,0.00008974494,0.85086197],"study_design_scores_gemma":[0.00058301946,0.00011946007,0.0045966324,0.0016760499,0.0003315392,0.00006746279,0.0000011112902,0.9495595,0.000060104514,0.040615868,0.0019230153,0.00046622963],"about_ca_topic_score_codex":0.0002023769,"about_ca_topic_score_gemma":0.00021713888,"teacher_disagreement_score":0.9257137,"about_ca_system_score_codex":0.00034819022,"about_ca_system_score_gemma":0.00047253133,"threshold_uncertainty_score":0.9998579},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06708491,0.008441285,0.88105094,0.0048648934,0.021100285,0.004109757,0.00005432582,0.00030487598,0.012988724],"genre_scores_gemma":[0.994386,0.00031361447,0.0038703445,0.00019684277,0.00032495867,0.00006755202,0.0000040123505,0.000040668354,0.00079600397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981641,0.000009154245,0.00032560044,0.000685157,0.00053990714,0.00027603624],"domain_scores_gemma":[0.99915403,0.00011384071,0.00009329558,0.000495876,0.00007824735,0.00006469269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023352644,0.00026319892,0.00037600292,0.00043475517,0.00005211157,0.00004311762,0.00027614745,0.00008949367,0.000010992932],"category_scores_gemma":[0.00001700377,0.00018402199,0.00012281977,0.0004515197,0.0002509255,0.0001437132,0.00026582452,0.0005033131,0.000021763779],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023267728,0.000074031836,0.0013937907,0.00030604677,0.000027411235,0.00027481196,0.0005173195,0.0062103854,0.00020760912,0.00011414256,0.00000391153,0.9908473],"study_design_scores_gemma":[0.0038626434,0.0025448801,0.07493985,0.04142373,0.00057319965,0.0011772416,0.0000054338175,0.37049645,0.2949238,0.19278607,0.014366552,0.0029001385],"about_ca_topic_score_codex":0.00009491606,"about_ca_topic_score_gemma":0.00035830535,"teacher_disagreement_score":0.9879471,"about_ca_system_score_codex":0.0007645291,"about_ca_system_score_gemma":0.00021656416,"threshold_uncertainty_score":0.7504199},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012250725,0.00025741055,0.9855002,0.0075571425,0.0013685875,0.0018115818,0.00018036527,0.0002334882,0.0018661438],"genre_scores_gemma":[0.77833307,0.000025684772,0.2084011,0.0062109716,0.0020592825,0.00033318746,0.00037980668,0.00015830081,0.004098594],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695975,0.000010272943,0.0006717567,0.0012849072,0.0005738818,0.000499419],"domain_scores_gemma":[0.99457103,0.0036229445,0.00020712394,0.0008528956,0.0005093544,0.00023663841],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058307656,0.000428647,0.00053913094,0.00054715294,0.00026581594,0.00025761308,0.00049709727,0.0003962577,0.00006315714],"category_scores_gemma":[0.0009829558,0.00039331664,0.0002396275,0.0004557791,0.00085122726,0.00010343366,0.00010063192,0.001095104,0.000028599758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005626928,0.00082617777,0.0069585564,0.0047672545,0.0006778707,0.0001211863,0.0038303607,0.21973334,0.11543801,0.1593198,0.0018639216,0.48590082],"study_design_scores_gemma":[0.002434619,0.0011718908,0.0021781318,0.003870085,0.0007557146,0.00015662919,0.0000019223007,0.479016,0.015828935,0.47920474,0.013658557,0.0017227841],"about_ca_topic_score_codex":0.000038595284,"about_ca_topic_score_gemma":0.00017212407,"teacher_disagreement_score":0.777108,"about_ca_system_score_codex":0.0005746284,"about_ca_system_score_gemma":0.0009870215,"threshold_uncertainty_score":0.9998519},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008693778,0.0012634158,0.99076587,0.0010476146,0.00086641975,0.00027587684,0.00003661928,0.0001028853,0.0047719404],"genre_scores_gemma":[0.9230298,0.00006764949,0.054079346,0.004104406,0.0023385456,0.000045853005,0.000024122975,0.00009593393,0.016214363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967149,0.00003459856,0.0005594528,0.0014143346,0.0009531699,0.00032353716],"domain_scores_gemma":[0.99700147,0.0016605485,0.00019948825,0.00085301447,0.00010217357,0.00018332007],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012015174,0.00031908473,0.000379065,0.00084793655,0.00033122778,0.0011353543,0.0013032204,0.0001953023,0.0004985309],"category_scores_gemma":[0.00027388215,0.0002441998,0.00009468976,0.000853085,0.00095288287,0.00052935997,0.00094482786,0.000548195,0.00022123024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011044459,0.000018355333,0.00003738021,0.000026037613,0.000016089494,0.00003854492,0.0011932008,0.049006533,0.00027204948,0.2566108,0.0010303991,0.69173956],"study_design_scores_gemma":[0.000054242366,0.000037392598,0.000027344564,0.00010579172,0.000008417095,0.000041218114,0.0000020300713,0.10521588,0.0001571004,0.875036,0.019038303,0.00027628045],"about_ca_topic_score_codex":0.0000019764748,"about_ca_topic_score_gemma":0.000008252316,"teacher_disagreement_score":0.9366865,"about_ca_system_score_codex":0.00005070904,"about_ca_system_score_gemma":0.00029222597,"threshold_uncertainty_score":0.99990153},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040378288,0.00050042354,0.9935149,0.00007857559,0.004078406,0.00051053654,0.000051061805,0.00031216614,0.0005501642],"genre_scores_gemma":[0.906771,0.00003334788,0.09211256,0.00010959725,0.00042293294,0.000031646377,0.000020607244,0.00008704194,0.00041126818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981426,0.000009887754,0.0004596287,0.00065801525,0.00041793496,0.0003119553],"domain_scores_gemma":[0.9990836,0.00013473608,0.00011431331,0.0005093001,0.000083400606,0.000074649906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005918231,0.0003385204,0.00031206917,0.0005125356,0.00014762416,0.00030048325,0.0004202905,0.00027206502,0.000004591454],"category_scores_gemma":[0.000019121193,0.00033427103,0.00014956002,0.00024529913,0.00013400553,0.00015936539,0.00006472775,0.000530594,0.000017493283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029644975,0.0000040168416,0.000009315079,0.00021114155,0.000013522103,0.0000023816206,0.00017869369,0.94675845,0.00073695194,0.00021607325,0.000015304417,0.05185119],"study_design_scores_gemma":[0.00014968902,0.000022899778,0.000036441896,0.00035916004,0.000026398116,0.000007717339,1.777868e-7,0.9790796,0.00041346534,0.01891677,0.00064064487,0.00034701],"about_ca_topic_score_codex":0.000016776585,"about_ca_topic_score_gemma":0.000081237355,"teacher_disagreement_score":0.9063672,"about_ca_system_score_codex":0.00058815087,"about_ca_system_score_gemma":0.00020108084,"threshold_uncertainty_score":0.99991095},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032436103,0.0009840444,0.9896956,0.0027110153,0.0016584008,0.00032765968,0.000007341684,0.0007165688,0.0038961256],"genre_scores_gemma":[0.01834827,0.000034481276,0.9736752,0.0032457288,0.00069231284,0.000034699773,0.000024994104,0.000051700023,0.0038926313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630547,0.000044973604,0.0004932502,0.0014916704,0.0011036922,0.0005609551],"domain_scores_gemma":[0.9980151,0.00042709254,0.00018022717,0.0009037968,0.00033657515,0.00013722501],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00087060616,0.00041869545,0.0003770562,0.0009940126,0.00021150899,0.0012898372,0.003250267,0.00018111574,0.000015465504],"category_scores_gemma":[0.00007717329,0.00037494773,0.00013868597,0.0017012096,0.00069035613,0.0006988037,0.0013358062,0.0008249175,0.00023552666],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026943635,0.000043020642,0.000020937245,0.00011564628,0.000010668855,0.00018875368,0.0005140079,0.0050253603,0.00019995873,0.04402753,0.001645522,0.9482059],"study_design_scores_gemma":[0.00006541802,0.000034624514,0.00003443059,0.00023246683,0.000004457144,0.00007837293,6.428497e-8,0.6522538,0.001740077,0.338402,0.0068028653,0.00035138923],"about_ca_topic_score_codex":0.0000059484087,"about_ca_topic_score_gemma":0.0000032310068,"teacher_disagreement_score":0.9478545,"about_ca_system_score_codex":0.0007182721,"about_ca_system_score_gemma":0.0021035927,"threshold_uncertainty_score":0.99987024},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14579299,0.01371359,0.78706074,0.0032306015,0.0062161586,0.0014081047,0.0013964786,0.00085685286,0.04032447],"genre_scores_gemma":[0.9867267,0.0011435907,0.0039826264,0.003665802,0.00021329244,0.000013750262,0.00012757668,0.00010177042,0.0040248735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996711,0.000081977676,0.0003756429,0.0014129588,0.0007317892,0.0006865861],"domain_scores_gemma":[0.9985299,0.0002968212,0.00014982227,0.00078205316,0.0000052077958,0.00023621407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067308353,0.00054843095,0.0004406842,0.00028983495,0.00015036005,0.00030943364,0.00083283347,0.0003343575,0.00045258173],"category_scores_gemma":[0.000039818002,0.00047062777,0.00005765513,0.00026820498,0.000677124,0.0008361557,0.001525324,0.0004245655,0.000093988165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046613237,0.00013919512,0.013264795,0.000060147493,0.000039633553,0.0014127328,0.0022483678,0.5016051,0.0021583484,0.0020283095,0.0017449466,0.47525182],"study_design_scores_gemma":[0.0019428352,0.0009216793,0.0720809,0.0049337726,0.00010032119,0.0006324291,0.00001031886,0.5252045,0.0056030476,0.14808965,0.2328276,0.0076529966],"about_ca_topic_score_codex":0.0027230068,"about_ca_topic_score_gemma":0.012572931,"teacher_disagreement_score":0.84093374,"about_ca_system_score_codex":0.0004897137,"about_ca_system_score_gemma":0.00004302085,"threshold_uncertainty_score":0.9997745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014539986,0.00040987856,0.98643386,0.0036473966,0.00093115,0.0012553142,0.00006422826,0.0000494944,0.00575468],"genre_scores_gemma":[0.9896477,0.00007107665,0.008968835,0.00085261656,0.00007550996,0.00000936613,0.00000809838,0.00002883407,0.00033799463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972558,0.00031305646,0.0005258274,0.0007152649,0.0008109715,0.0003790581],"domain_scores_gemma":[0.99611264,0.0020309456,0.00017517309,0.0011368586,0.00047333908,0.00007102522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026914836,0.00030398183,0.00042112655,0.0006603519,0.00011233923,0.00016245582,0.003156961,0.00016635524,0.000025471823],"category_scores_gemma":[0.00028423764,0.0001637835,0.0001646348,0.0022243687,0.0010279998,0.00019968516,0.0014632669,0.0010581993,0.0000132735095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034894892,0.00022442367,0.0016165721,0.00013144851,0.0000599012,0.000016586137,0.00959362,0.8109746,0.00048162634,0.1244855,0.0001860332,0.052194767],"study_design_scores_gemma":[0.00017609418,0.00027115125,0.007852226,0.00077128026,0.000001950736,0.0000046121363,5.3490976e-7,0.9779721,0.0009005537,0.011769216,0.00007760584,0.00020267381],"about_ca_topic_score_codex":0.00047748623,"about_ca_topic_score_gemma":0.0009440585,"teacher_disagreement_score":0.9881937,"about_ca_system_score_codex":0.0002258445,"about_ca_system_score_gemma":0.00077123067,"threshold_uncertainty_score":0.6678897},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006268156,0.0005454855,0.965895,0.001627733,0.0011457413,0.0002659502,0.000017262435,0.0005085624,0.02993161],"genre_scores_gemma":[0.023325516,0.00035435354,0.95615554,0.0028256027,0.0011774979,0.000020034859,0.00006194285,0.00015258788,0.01592691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99485135,0.0000378371,0.00073475885,0.0022094813,0.0011782162,0.0009883809],"domain_scores_gemma":[0.99742013,0.0003330878,0.00026523988,0.001461455,0.00020365266,0.0003164382],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010613413,0.0007068792,0.00079471216,0.0014308619,0.0003709185,0.0013583053,0.0028383362,0.00035112188,0.00022001042],"category_scores_gemma":[0.00004301758,0.00064095,0.00027847072,0.0014531483,0.0004900178,0.0009410234,0.001531327,0.0010112826,0.0017556143],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064894875,0.000059095553,0.0000273679,0.00021793555,0.00008066943,0.0006092826,0.00073800515,0.0127462065,0.002317896,0.0133929625,0.00030368258,0.9695004],"study_design_scores_gemma":[0.00016697959,0.00012070848,0.000016568336,0.0011554679,0.000034347253,0.00019023062,2.5156646e-7,0.9338588,0.0012626504,0.0582517,0.0040314975,0.00091078144],"about_ca_topic_score_codex":0.00014556453,"about_ca_topic_score_gemma":0.00012640117,"teacher_disagreement_score":0.9685896,"about_ca_system_score_codex":0.00037569003,"about_ca_system_score_gemma":0.00043803095,"threshold_uncertainty_score":0.9996784},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022948896,0.0030984324,0.9844239,0.0060254554,0.002247623,0.00031163968,0.000019020585,0.0004117645,0.0032327117],"genre_scores_gemma":[0.28807268,0.00027824598,0.7019365,0.0055693947,0.0022171687,0.000012518345,0.00007657087,0.00015592748,0.0016810286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941035,0.00005870019,0.0005716869,0.0026092124,0.0018989801,0.00075793616],"domain_scores_gemma":[0.9955996,0.0009930886,0.00019227591,0.0026624182,0.000111683075,0.00044091913],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0024064349,0.000549651,0.0005572915,0.00083635014,0.00026091732,0.00085396686,0.0072610728,0.0005259435,0.00006415554],"category_scores_gemma":[0.00048826647,0.0004802739,0.00006046049,0.0005574084,0.0007501491,0.00069460814,0.009581285,0.0025292851,0.0000612345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026891444,0.000010671497,0.00014117917,0.00028603207,0.000014743429,0.0009664941,0.0035357599,0.0018206298,0.000014133844,0.035606954,0.00004483041,0.9575559],"study_design_scores_gemma":[0.00015694203,0.00006996683,0.00006467827,0.0010500839,0.000008248041,0.0003683621,8.62624e-7,0.9697693,0.000035503992,0.025142249,0.0028140286,0.00051975506],"about_ca_topic_score_codex":0.0002884439,"about_ca_topic_score_gemma":0.00035459897,"teacher_disagreement_score":0.9679487,"about_ca_system_score_codex":0.00019493088,"about_ca_system_score_gemma":0.00089339213,"threshold_uncertainty_score":0.9997719},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019591798,0.0005572085,0.9895849,0.00651833,0.00027470628,0.00050527736,0.000004462626,0.00010638361,0.0004895104],"genre_scores_gemma":[0.5183694,0.000044056338,0.477039,0.00074042287,0.0007571039,0.000054573215,0.00009035091,0.00008266215,0.0028224462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972661,0.000045848978,0.0004326105,0.0010641299,0.0008223349,0.0003689554],"domain_scores_gemma":[0.9984182,0.00076706486,0.00007973876,0.0003265781,0.000212671,0.00019571341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016473026,0.00033378782,0.000564964,0.0006737707,0.00016379221,0.00016493512,0.00024422022,0.00027151534,0.00003201295],"category_scores_gemma":[0.00059098814,0.0002560301,0.00017474142,0.00032753125,0.0006054311,0.00005875966,0.00010584584,0.0009628961,0.000007789828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001486849,0.000081680344,0.00004135594,0.00091056974,0.00013438512,0.0001698772,0.0015144207,0.011920784,0.012790005,0.0035896387,0.000054286604,0.9686443],"study_design_scores_gemma":[0.00050799525,0.0002702418,0.00010528518,0.0011776285,0.0002431189,0.0001326367,0.0000014274202,0.9883168,0.0012514867,0.007110583,0.0006100558,0.00027278025],"about_ca_topic_score_codex":0.000027143155,"about_ca_topic_score_gemma":0.000012807569,"teacher_disagreement_score":0.97639596,"about_ca_system_score_codex":0.00014099899,"about_ca_system_score_gemma":0.0002525526,"threshold_uncertainty_score":0.9999892},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005071004,0.0004592129,0.99680394,0.00015720063,0.0011606787,0.0002476667,0.00005441465,0.00032674,0.00028304296],"genre_scores_gemma":[0.55052894,0.000033346743,0.44850802,0.00014577426,0.00031672616,0.000012626457,0.000092654605,0.000046162757,0.00031573715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951159,0.00003272648,0.00069670315,0.001712696,0.001830445,0.0006115786],"domain_scores_gemma":[0.9948549,0.002389624,0.00022941004,0.00191744,0.0004246422,0.00018395395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010666542,0.0004892875,0.0011239,0.007875138,0.0001150442,0.0006777908,0.0035276795,0.00034498624,0.000058587742],"category_scores_gemma":[0.00030087956,0.00046954138,0.0007477546,0.010054414,0.00048804694,0.0005800837,0.0016433971,0.0008575364,0.000035301728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007407405,0.000028952181,0.0011847506,0.000078651814,0.0020200345,0.0001229332,0.0005464107,0.86037827,0.00011421488,0.008361804,0.000010611911,0.12714595],"study_design_scores_gemma":[0.00013832566,0.0001083911,0.0033038747,0.00018864746,0.0013902973,0.000007909546,1.0089462e-7,0.9788982,0.0006864064,0.014516125,0.00016079746,0.0006008871],"about_ca_topic_score_codex":0.000049410293,"about_ca_topic_score_gemma":0.0000702249,"teacher_disagreement_score":0.5500218,"about_ca_system_score_codex":0.00047398126,"about_ca_system_score_gemma":0.00040882317,"threshold_uncertainty_score":0.99977565},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017469905,0.0003404813,0.969234,0.00046657343,0.008772194,0.0028315457,0.000083083534,0.00013285031,0.017964568],"genre_scores_gemma":[0.8245952,0.000023898016,0.16231303,0.0012082318,0.0030976012,0.0008506852,0.00023338082,0.0001214744,0.00755647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926713,0.00008010803,0.00083161716,0.0026877858,0.0031691957,0.00055996416],"domain_scores_gemma":[0.9920782,0.00487913,0.00038437897,0.0016643598,0.0008578005,0.00013612001],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.012913855,0.00043633973,0.00049170473,0.0018618708,0.0005529968,0.0039438535,0.0022826104,0.00020694287,0.0001319077],"category_scores_gemma":[0.0016953723,0.00034203072,0.00023252892,0.0012924646,0.00064588,0.000815261,0.001144909,0.0005544629,0.0002064856],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008681389,0.00001656722,0.0000074159066,0.00001610878,0.000015724254,0.0000061115506,0.00049504085,0.10788323,0.000022898406,0.027504334,0.00056936394,0.8634545],"study_design_scores_gemma":[0.0001527298,0.000105340245,0.000059416987,0.00018277827,0.000034724202,0.000005942935,0.000011542342,0.49986264,0.000028228309,0.4708457,0.028462263,0.0002487131],"about_ca_topic_score_codex":0.000027795133,"about_ca_topic_score_gemma":0.00044464268,"teacher_disagreement_score":0.8632058,"about_ca_system_score_codex":0.00048416754,"about_ca_system_score_gemma":0.0005931847,"threshold_uncertainty_score":0.99990314},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006539843,0.00073601113,0.99509597,0.0004804895,0.0013566276,0.0007326245,0.00018497114,0.00024572073,0.0005135799],"genre_scores_gemma":[0.6611874,0.000028072867,0.3373808,0.00018923549,0.0005495418,0.00005331033,0.00047184303,0.00005476895,0.00008501281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642706,0.000022269518,0.00055734225,0.0017226202,0.0006477096,0.00062299176],"domain_scores_gemma":[0.9980038,0.00042884107,0.00021302958,0.0009882372,0.0002136166,0.00015251907],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00074801437,0.00052584964,0.0004385386,0.0010730455,0.00020979386,0.0018530905,0.0021454233,0.00044087062,0.000004744264],"category_scores_gemma":[0.0001469569,0.00046543233,0.00016963812,0.001167152,0.00043414996,0.002373639,0.0007541668,0.0009735094,0.0000073391725],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014764261,0.00009637249,0.00009340981,0.00023302755,0.00001359139,0.00005502033,0.00320638,0.002216849,0.00032714105,0.103316054,0.00006897208,0.89035845],"study_design_scores_gemma":[0.00018232309,0.00023461571,0.00017455839,0.001473148,0.000009032396,0.000039259532,0.0000014752977,0.6554909,0.00041803689,0.34033495,0.0010351517,0.0006065944],"about_ca_topic_score_codex":0.00002232718,"about_ca_topic_score_gemma":0.0005196241,"teacher_disagreement_score":0.88975185,"about_ca_system_score_codex":0.00033160654,"about_ca_system_score_gemma":0.00032291803,"threshold_uncertainty_score":0.99977976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043842683,0.0006129656,0.9916844,0.00042818926,0.0023203022,0.00049957837,0.0000045012785,0.0012097002,0.0031965342],"genre_scores_gemma":[0.39434794,0.00004367842,0.6029422,0.0013991519,0.00039655558,0.000021999957,0.0000052525666,0.00006755628,0.00077565206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584675,0.000028294002,0.00060253515,0.0019127021,0.0009519771,0.00065774895],"domain_scores_gemma":[0.99751973,0.0003517956,0.00032636122,0.0012952047,0.0003298844,0.00017702334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000614707,0.0006105387,0.0005234119,0.0011347396,0.0003145426,0.00059997675,0.0024183986,0.0003926532,0.000018222101],"category_scores_gemma":[0.000086386244,0.0006070038,0.00017208255,0.0009715304,0.00053283316,0.0011185096,0.0015102302,0.0011471085,0.000104664694],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044600083,0.000011053363,0.000008651731,0.000059316466,0.000011231572,0.00015768771,0.00063333864,0.008780332,0.0011637688,0.025150212,0.000023469689,0.96399647],"study_design_scores_gemma":[0.00021324858,0.00026069875,0.000021064174,0.0008299665,0.000015039905,0.00024201123,6.5600705e-7,0.58636755,0.018674893,0.3834267,0.0089002345,0.0010479278],"about_ca_topic_score_codex":0.000031584903,"about_ca_topic_score_gemma":0.00011310159,"teacher_disagreement_score":0.96294856,"about_ca_system_score_codex":0.000704116,"about_ca_system_score_gemma":0.0002780263,"threshold_uncertainty_score":0.99963814},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026535013,0.00036597074,0.97479504,0.020716507,0.0011100164,0.000586664,0.000028565475,0.00042243503,0.0017094512],"genre_scores_gemma":[0.40868646,0.00009493428,0.58905023,0.0015475472,0.00020589297,0.000049026035,0.000012678613,0.000079485515,0.0002737605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99522114,0.000035980054,0.000529202,0.0018522528,0.001677309,0.0006841375],"domain_scores_gemma":[0.98571163,0.0012711934,0.00033735365,0.01243379,0.00015934948,0.000086676286],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012758839,0.00060805486,0.0005525861,0.0007045571,0.0001942988,0.0005082012,0.050440494,0.0003104082,0.000017577566],"category_scores_gemma":[0.0016328441,0.00037108717,0.000118134645,0.0011533884,0.0015398714,0.00045217213,0.07705353,0.0012381616,0.00005224217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020391542,0.00009268596,0.000064872096,0.0001904653,0.0000923714,0.00031464238,0.00046945896,0.0041947784,0.00017856086,0.7907541,0.004040044,0.19958764],"study_design_scores_gemma":[0.0001358519,0.0003839797,0.000047776266,0.001148371,0.000011827899,0.0000491547,2.6901907e-7,0.12458274,0.0030140653,0.86871696,0.0014497385,0.0004592681],"about_ca_topic_score_codex":0.000018780085,"about_ca_topic_score_gemma":0.000022380713,"teacher_disagreement_score":0.4084211,"about_ca_system_score_codex":0.00037701087,"about_ca_system_score_gemma":0.0002991519,"threshold_uncertainty_score":0.9998741},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012952866,0.0006284864,0.9855542,0.0038825346,0.0032821763,0.00031923427,0.000007034628,0.00033933998,0.0058574695],"genre_scores_gemma":[0.081962936,0.0005599302,0.91087997,0.00269817,0.0022451598,0.0000214697,0.000012789148,0.00012661536,0.001492972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953387,0.000039032606,0.00047347366,0.0017944705,0.00176361,0.00059071585],"domain_scores_gemma":[0.9982117,0.0002796491,0.00019711327,0.00082962814,0.0001952863,0.0002866566],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010935256,0.0005131952,0.0004330203,0.0009181697,0.00025381416,0.0010591706,0.0020770945,0.00036295652,0.00007703095],"category_scores_gemma":[0.00009804141,0.000490566,0.0001066657,0.00072973646,0.0011856921,0.0013535557,0.0020770254,0.0011600622,0.000086169646],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005420048,0.000009162636,0.0000059399686,0.00009414099,0.00001667386,0.0003527538,0.0009355014,0.00034490682,0.0009873332,0.0066832234,0.00010289871,0.99046206],"study_design_scores_gemma":[0.0003986957,0.00020494428,0.0000804716,0.00082013727,0.000025688996,0.0004764832,0.0000013851933,0.8940752,0.00804599,0.09352183,0.001522305,0.00082684256],"about_ca_topic_score_codex":0.000099656274,"about_ca_topic_score_gemma":0.000110329594,"teacher_disagreement_score":0.9896352,"about_ca_system_score_codex":0.00078077783,"about_ca_system_score_gemma":0.0009106001,"threshold_uncertainty_score":0.9999778},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007915021,0.001928224,0.9879821,0.0013246142,0.0034714427,0.00028150505,0.000005897103,0.0002148912,0.004712162],"genre_scores_gemma":[0.66721314,0.0002788114,0.32936117,0.0010983929,0.00110727,0.000021127433,0.00000782737,0.00008462731,0.00082763896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944688,0.00003104802,0.0006614016,0.001462476,0.0029212285,0.00045505786],"domain_scores_gemma":[0.99762374,0.0004164949,0.00027771725,0.001267012,0.00022243742,0.00019262436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013854007,0.00042584722,0.0004873562,0.0010215692,0.00011527489,0.00034610648,0.0036492713,0.0005231307,0.00005822923],"category_scores_gemma":[0.000072601506,0.00038374745,0.00015779903,0.00088861724,0.0006518259,0.00081890565,0.0016248835,0.0010441995,0.000049757342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049098558,0.000017536755,8.674078e-7,0.00009608061,0.000012337949,0.00010559117,0.0029611052,0.15262775,0.000086352775,0.058695577,0.000027873082,0.78536403],"study_design_scores_gemma":[0.00011820894,0.00015800945,0.0000029866255,0.00072896597,0.00000719583,0.00006831422,9.0705925e-7,0.78260005,0.0008466753,0.21480364,0.00036908526,0.000295984],"about_ca_topic_score_codex":0.00013922378,"about_ca_topic_score_gemma":0.00021490338,"teacher_disagreement_score":0.78506804,"about_ca_system_score_codex":0.00039528174,"about_ca_system_score_gemma":0.0009861116,"threshold_uncertainty_score":0.9998614},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010937912,0.00037454534,0.98889685,0.0035913254,0.0029834667,0.00075914944,0.000022476284,0.0004142732,0.002946954],"genre_scores_gemma":[0.14164996,0.000116873096,0.8523327,0.002198969,0.0010493227,0.00015101818,0.000024284944,0.00010870354,0.0023681591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949914,0.000028863438,0.0006790147,0.0021406233,0.0015116755,0.00064838614],"domain_scores_gemma":[0.9973551,0.00062778604,0.0002875784,0.00096216286,0.00052881584,0.00023852508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012563383,0.00055429724,0.00049185555,0.00074823794,0.00035398526,0.0009869662,0.0027637985,0.00058936863,0.000015596557],"category_scores_gemma":[0.00020776782,0.0005085138,0.0001824436,0.0006698409,0.0007642884,0.00077013916,0.00093137403,0.0011337465,0.000082281804],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026897316,0.00003135171,0.0000017980456,0.00012045519,0.00003552996,0.0000478854,0.0017149821,0.044528972,0.0007528499,0.11018962,0.00045827683,0.8420914],"study_design_scores_gemma":[0.00017209337,0.000111925096,0.000004565838,0.00022548124,0.000009089983,0.000032780776,2.9803363e-7,0.73344487,0.000770345,0.2640735,0.00075301115,0.00040203743],"about_ca_topic_score_codex":0.000014398546,"about_ca_topic_score_gemma":0.00019160048,"teacher_disagreement_score":0.84168935,"about_ca_system_score_codex":0.000897348,"about_ca_system_score_gemma":0.0017685865,"threshold_uncertainty_score":0.99973667},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047986235,0.0017839215,0.94836515,0.00010906754,0.0004939867,0.00006953037,0.000007549862,0.00013905522,0.0010454733],"genre_scores_gemma":[0.9959872,0.000053234096,0.0034482873,0.00005325572,0.00020461249,0.0000010347461,0.000006167668,0.000033744756,0.0002124781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998398,0.000006167837,0.00038990492,0.0005403965,0.00036895368,0.0002965541],"domain_scores_gemma":[0.9992798,0.00016183346,0.000058131613,0.00039323134,0.000042564297,0.0000644643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020205053,0.00026262196,0.00039973285,0.00044915325,0.00006382115,0.00012503038,0.0005030991,0.00023178419,0.000015029688],"category_scores_gemma":[0.00002432729,0.00023441418,0.00015949618,0.00026850597,0.00013066287,0.00007993302,0.00025822004,0.0006114972,0.000004360616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020899283,0.000005956249,0.00008580219,0.000081907696,0.00002449868,0.000021538046,0.000286221,0.78427523,0.004139002,0.00010115702,0.0000370752,0.2109395],"study_design_scores_gemma":[0.00006317185,0.000017168077,0.000013031358,0.00028774858,0.000026273015,0.000009229024,2.745455e-7,0.987684,0.003574704,0.0080411155,0.000054687393,0.00022860865],"about_ca_topic_score_codex":0.000044087577,"about_ca_topic_score_gemma":0.000048932736,"teacher_disagreement_score":0.94800097,"about_ca_system_score_codex":0.00007330028,"about_ca_system_score_gemma":0.000024485147,"threshold_uncertainty_score":0.95591325},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028062833,0.0004196431,0.99498606,0.00036010842,0.00032568874,0.0006888574,0.00005899532,0.0000459214,0.00030845744],"genre_scores_gemma":[0.7453914,0.0023046818,0.2318711,0.0015964386,0.0021758755,0.00056009425,0.0007636379,0.00020834943,0.015128415],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998344,0.000009714587,0.00025024652,0.0007397566,0.00032254198,0.00033373674],"domain_scores_gemma":[0.9994041,0.00008849117,0.0000739625,0.00021707639,0.00013952599,0.00007687764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021293038,0.00021413442,0.00018223077,0.00023695732,0.000058173144,0.00007916408,0.00032000474,0.00030984255,0.000026867341],"category_scores_gemma":[0.00017679686,0.0001899753,0.000059111353,0.0002622335,0.00031691464,0.000010918682,0.00023032603,0.0002879109,0.000004940856],"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.00017327786,0.000041607535,0.000055627006,0.00013456818,0.000011261526,0.00001493519,0.00009243035,0.009908921,0.825912,0.000094182404,0.00019780414,0.16336335],"study_design_scores_gemma":[0.00025184636,0.0003791373,0.000010319249,0.00021372193,0.000009332567,0.0000049227124,3.2587715e-7,0.3648896,0.62214434,0.009027071,0.0028110314,0.0002583779],"about_ca_topic_score_codex":0.000049227652,"about_ca_topic_score_gemma":0.00016848969,"teacher_disagreement_score":0.7631149,"about_ca_system_score_codex":0.000195679,"about_ca_system_score_gemma":0.00024473964,"threshold_uncertainty_score":0.77469677},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027868964,0.19753854,0.15142582,0.059205066,0.09778321,0.007310217,0.00021424271,0.00047955877,0.45817438],"genre_scores_gemma":[0.9697241,0.0025277105,0.007570128,0.0018698246,0.003821241,0.000016479573,0.0000263864,0.00011521337,0.014328924],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998259,0.000013679284,0.00028448063,0.0005348724,0.0006843161,0.00022362662],"domain_scores_gemma":[0.99896795,0.0001662708,0.00011805373,0.00058368617,0.00009947045,0.00006458772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033853768,0.00023585315,0.00041277747,0.00023083534,0.00008092484,0.00002959662,0.00035872575,0.00021568395,0.00006529875],"category_scores_gemma":[0.00003450574,0.00014402803,0.00029211395,0.0002905243,0.00053069845,0.00004334826,0.00040461423,0.0004940574,0.000049724174],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080031314,0.000068525864,0.0004348474,0.0024771143,0.00013193226,0.0001637061,0.0039036665,0.0022741049,0.0015390777,0.014423263,0.00056982675,0.9739339],"study_design_scores_gemma":[0.0040291124,0.001354654,0.044173036,0.051371742,0.0013652897,0.00051008916,0.0000075891767,0.08369878,0.018677361,0.47602242,0.3154864,0.0033035192],"about_ca_topic_score_codex":0.000011302132,"about_ca_topic_score_gemma":0.00011740447,"teacher_disagreement_score":0.9706304,"about_ca_system_score_codex":0.00021366701,"about_ca_system_score_gemma":0.00017122291,"threshold_uncertainty_score":0.58732927},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005607972,0.06285331,0.11996961,0.03598843,0.023386875,0.001416659,0.00002316544,0.0004332437,0.75536793],"genre_scores_gemma":[0.7953519,0.008327256,0.019585691,0.0025164206,0.0105269365,0.00009636111,0.0000534441,0.00031053007,0.16323142],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99708235,0.000008726558,0.00050796417,0.0010331806,0.0008393751,0.00052842795],"domain_scores_gemma":[0.9984229,0.00023035906,0.00011837977,0.00090405374,0.00020498176,0.00011927769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062827556,0.00042291082,0.0005048238,0.0002856568,0.00033118998,0.00010704649,0.00053373666,0.00024238936,0.00006900617],"category_scores_gemma":[0.00009640785,0.00026253564,0.00024336814,0.00029094663,0.0008605631,0.00006152289,0.00036191425,0.00096901844,0.00012496856],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027518521,0.00002478424,0.000043313386,0.00019507181,0.00010401194,0.0024241267,0.0015664274,0.00014696369,0.000042827654,0.006053848,0.0011057621,0.98826534],"study_design_scores_gemma":[0.00070814294,0.00096037716,0.002181857,0.0035682218,0.0003362216,0.0030845734,0.000013607959,0.008536796,0.00056888914,0.20187753,0.7765939,0.0015698506],"about_ca_topic_score_codex":0.000035788304,"about_ca_topic_score_gemma":0.00048385127,"teacher_disagreement_score":0.98669547,"about_ca_system_score_codex":0.00019620995,"about_ca_system_score_gemma":0.0002534153,"threshold_uncertainty_score":0.9999827},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007406715,0.038809262,0.9549443,0.0031494212,0.0013233083,0.0009617423,0.000019354982,0.00006537439,0.0006531343],"genre_scores_gemma":[0.15779617,0.00026507163,0.8023305,0.02671108,0.0075587127,0.00019301036,0.000487801,0.00020672259,0.0044509387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786425,0.00001715919,0.00030581304,0.0009672919,0.00042109803,0.0004243859],"domain_scores_gemma":[0.9984025,0.0009063833,0.00008796883,0.0004541711,0.00007174468,0.00007727306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039042972,0.0003280377,0.00034182338,0.00015738828,0.00020192507,0.000113874215,0.0004770026,0.00015168503,0.000019971472],"category_scores_gemma":[0.000060105416,0.00022162746,0.00013761081,0.0002363183,0.0006666714,0.00009971664,0.00037262088,0.000645355,0.000011537461],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008041523,0.0000072207135,0.00006067838,0.000049517963,0.000004901159,0.0001253088,0.00045826042,0.010281329,0.0002561652,0.00068827707,0.00006871131,0.9879192],"study_design_scores_gemma":[0.00049641146,0.00019888907,0.0005413078,0.0002524896,0.000052460095,0.00031365643,0.0000017911691,0.9405686,0.00010849514,0.05258094,0.0046280767,0.0002568771],"about_ca_topic_score_codex":0.000021111106,"about_ca_topic_score_gemma":0.00003099005,"teacher_disagreement_score":0.9876623,"about_ca_system_score_codex":0.00010936556,"about_ca_system_score_gemma":0.00008848043,"threshold_uncertainty_score":0.9037705},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000067282986,0.0010447793,0.9867679,0.004436603,0.0027354546,0.000868438,0.0000062165623,0.0003332483,0.0038006362],"genre_scores_gemma":[0.01678775,0.00006457199,0.974034,0.004424188,0.0005994851,0.000037956448,0.000011098838,0.00007867447,0.003962281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959128,0.000016645226,0.0005726983,0.0018302936,0.0008312451,0.0008363411],"domain_scores_gemma":[0.99779475,0.00043983228,0.00016421537,0.0010977043,0.00024638686,0.0002571413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007490992,0.00055660075,0.00054119265,0.0011029798,0.00036723842,0.0008781496,0.002383906,0.00021776109,0.000022234788],"category_scores_gemma":[0.00007688804,0.0005061498,0.00022617642,0.00094746833,0.00029864034,0.0010309878,0.0006417235,0.0006992935,0.00015681561],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010095936,0.000011883891,0.0000023821794,0.000074264644,0.000008503125,0.000020409545,0.00088133564,0.04862634,0.00056057225,0.014928664,0.00014210767,0.93473345],"study_design_scores_gemma":[0.00028205157,0.0001697512,0.0000060027246,0.00049276405,0.000008553778,0.000029708477,3.7577075e-7,0.78292763,0.0018268734,0.16205086,0.051631074,0.00057437655],"about_ca_topic_score_codex":0.000012851748,"about_ca_topic_score_gemma":0.00003118616,"teacher_disagreement_score":0.93415904,"about_ca_system_score_codex":0.00028841852,"about_ca_system_score_gemma":0.00043373168,"threshold_uncertainty_score":0.999739},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012346006,0.0004546142,0.98968136,0.0009670207,0.0023518344,0.0007707299,0.000022644139,0.00021598549,0.00552347],"genre_scores_gemma":[0.3524255,0.00001247631,0.6450028,0.0007021665,0.0012097372,0.00003675435,0.000011258238,0.00005200494,0.00054731744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555045,0.00004189441,0.0006373578,0.0020628127,0.00079140655,0.00091609935],"domain_scores_gemma":[0.9969329,0.0011524337,0.00035877302,0.0010084781,0.00037070914,0.00017669472],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012213386,0.0006644103,0.00069783017,0.0006315112,0.00041109,0.0010680528,0.0026632186,0.00030343645,0.0000106584575],"category_scores_gemma":[0.00018092542,0.0006083322,0.00028603766,0.00070568395,0.0005291902,0.0006387909,0.00088767195,0.00069840724,0.000015588741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012521336,0.000007797999,0.0000019282309,0.00006563115,0.000020995005,0.000026902839,0.00085298624,0.35888472,0.00024575574,0.05117932,0.000012426831,0.588689],"study_design_scores_gemma":[0.00017327373,0.00019304732,0.0000050548024,0.0011388628,0.000020259782,0.000008781768,0.0000015011434,0.89575434,0.00355906,0.09792063,0.00058491976,0.0006402524],"about_ca_topic_score_codex":0.000015098199,"about_ca_topic_score_gemma":0.00009697635,"teacher_disagreement_score":0.58804876,"about_ca_system_score_codex":0.00074673974,"about_ca_system_score_gemma":0.0008089184,"threshold_uncertainty_score":0.99996895},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012041051,0.0005984252,0.98742217,0.0034788353,0.002712141,0.00023474477,0.0000031891293,0.0004180792,0.0051203547],"genre_scores_gemma":[0.07181972,0.000089740664,0.9162119,0.0061814473,0.0008761644,0.0000068780605,0.00001040315,0.000086651475,0.004717111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965941,0.000025825766,0.0004754619,0.0015426257,0.0008121137,0.0005499034],"domain_scores_gemma":[0.99791896,0.0003170115,0.00015145789,0.0012796187,0.00014204912,0.0001909207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040593764,0.00045346218,0.00038773165,0.00071586564,0.00019197661,0.0009250213,0.0023622855,0.00020801021,0.000021892669],"category_scores_gemma":[0.00006707348,0.000389656,0.00012876568,0.0007509472,0.00048809982,0.0009857541,0.0015298595,0.0009918585,0.00009278737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037099817,0.000013178805,0.000007655004,0.00003664256,0.000006398604,0.00024067049,0.00030715024,0.036590397,0.0004789221,0.110366285,0.000060526298,0.8518885],"study_design_scores_gemma":[0.0000999008,0.0000569379,0.000009105081,0.00021197092,0.0000039752863,0.00006908415,1.1632328e-7,0.8261787,0.0005379298,0.16717766,0.0052630953,0.00039149297],"about_ca_topic_score_codex":0.000007705275,"about_ca_topic_score_gemma":0.000014084605,"teacher_disagreement_score":0.851497,"about_ca_system_score_codex":0.00019515223,"about_ca_system_score_gemma":0.0002858195,"threshold_uncertainty_score":0.9998555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008923428,0.00049840426,0.9929325,0.0007881345,0.0031268268,0.00058039447,0.000013610963,0.00021381627,0.0017570583],"genre_scores_gemma":[0.2052907,0.00004635935,0.7772325,0.005804264,0.010908232,0.000072663315,0.0001273121,0.00015540938,0.0003625636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965051,0.000010050512,0.0006836535,0.0015199085,0.0006134318,0.0006678644],"domain_scores_gemma":[0.9977349,0.0008716362,0.00035210905,0.0006739024,0.00033708595,0.000030340256],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015626128,0.00058050005,0.00061235187,0.00090126914,0.00040168816,0.001783239,0.002067587,0.0005113479,0.0002388203],"category_scores_gemma":[0.00029924983,0.00048071358,0.0001996677,0.0007528608,0.0006231978,0.00082757405,0.0012647785,0.0008737836,0.00025711584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003500352,0.00003236123,0.00002550063,0.00082538003,0.0000185336,0.000037894253,0.00010505022,0.0029518418,0.00032442767,0.59438306,0.000019054914,0.4012419],"study_design_scores_gemma":[0.000023073646,0.000030241263,0.000009352338,0.0016535525,0.00004769207,0.0000072060056,0.0000017764917,0.096233636,0.0010530832,0.8951616,0.005244307,0.000534463],"about_ca_topic_score_codex":0.000060464346,"about_ca_topic_score_gemma":0.00013522676,"teacher_disagreement_score":0.40070745,"about_ca_system_score_codex":0.000095161224,"about_ca_system_score_gemma":0.00006925799,"threshold_uncertainty_score":0.99976444},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009286185,0.00062833214,0.99361324,0.0011608189,0.0015223102,0.0007215922,0.000008407717,0.0011381775,0.001197845],"genre_scores_gemma":[0.004405647,0.00003209426,0.9936019,0.00087977696,0.00057963456,0.0001041752,0.0000032923458,0.00010204107,0.00029144817],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99523914,0.00002584369,0.00066951104,0.0023665756,0.0008101287,0.00088877766],"domain_scores_gemma":[0.9964016,0.0013341936,0.00036282907,0.0013518033,0.00040632728,0.00014323113],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013609688,0.0007219382,0.00062831014,0.0012906526,0.00048620318,0.0017077674,0.0032065355,0.0003822757,0.000008073498],"category_scores_gemma":[0.00046117508,0.00068757107,0.0002225617,0.0008205103,0.00064079516,0.0016140976,0.00142056,0.0010163905,0.000028788274],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010614755,0.000018768675,0.0000060358925,0.00032016542,0.000020662901,0.00005967889,0.00061246194,0.0015246286,0.019556465,0.0063703544,0.000071948314,0.9714282],"study_design_scores_gemma":[0.00009145331,0.00012223366,0.0000050881017,0.0017103961,0.000028147999,0.000102606165,2.8013824e-7,0.37727937,0.066367224,0.5515212,0.001861847,0.00091017573],"about_ca_topic_score_codex":0.000007183172,"about_ca_topic_score_gemma":0.0000087837725,"teacher_disagreement_score":0.97051805,"about_ca_system_score_codex":0.0006171627,"about_ca_system_score_gemma":0.00046678784,"threshold_uncertainty_score":0.99955755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026779722,0.0015449072,0.9896562,0.000043751836,0.0018338483,0.00015741626,0.000037594724,0.00029125268,0.003757023],"genre_scores_gemma":[0.95477045,0.00014313811,0.043081153,0.00012815579,0.0008814134,0.0000063021994,0.00007194686,0.00008998364,0.00082743325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977281,0.0000094067855,0.00043654637,0.00087766873,0.0005409951,0.00040724495],"domain_scores_gemma":[0.9990449,0.00013363568,0.000096084754,0.00053746876,0.00007816624,0.000109723296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001717521,0.0005037936,0.000536359,0.00051194726,0.000102064194,0.0003261533,0.0005544787,0.00035712868,0.00013906472],"category_scores_gemma":[0.000011762016,0.00044920904,0.00017468874,0.00026155866,0.00013140397,0.00018792145,0.00015318878,0.0009647055,0.00013163709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023502917,0.0000061743644,0.000007877217,0.00005565334,0.00007822449,0.0000327483,0.0002802379,0.79669225,0.0031730956,0.00005758026,0.00003429719,0.19957948],"study_design_scores_gemma":[0.00007930442,0.000019122925,0.00009757847,0.00037636008,0.00009064094,0.000007188068,2.2299089e-7,0.96232563,0.0027280657,0.032976154,0.0008211739,0.000478547],"about_ca_topic_score_codex":0.00008906133,"about_ca_topic_score_gemma":0.0003670534,"teacher_disagreement_score":0.9520925,"about_ca_system_score_codex":0.0002739839,"about_ca_system_score_gemma":0.00006183847,"threshold_uncertainty_score":0.999796},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005042593,0.00067959144,0.9943151,0.00020748307,0.0006606389,0.0004982282,0.0000032760418,0.0003842365,0.0032010388],"genre_scores_gemma":[0.15441895,0.000089843634,0.8443448,0.00047615523,0.0002737415,0.000030005887,0.0000038211874,0.0000802867,0.00028243064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963064,0.000015336742,0.00073478743,0.0014793578,0.0009845049,0.0004796097],"domain_scores_gemma":[0.99769336,0.00018365795,0.00043806856,0.0012405057,0.00032915,0.000115287454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088432414,0.00052738667,0.00060986925,0.0013591881,0.00024354199,0.00061306875,0.0025349434,0.00021146153,0.0000050212625],"category_scores_gemma":[0.000027356782,0.00042346647,0.00014132356,0.00139339,0.00034433347,0.0005170311,0.0016559911,0.0006971501,0.0000043720484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005420871,0.00006209638,0.00004019119,0.0005223883,0.000042303902,0.00008697433,0.0034063333,0.0029597715,0.0035986444,0.61987036,0.0000146132625,0.36939088],"study_design_scores_gemma":[0.00016309274,0.00030611744,0.000009990212,0.003620462,0.000013849144,0.00011404951,3.8834523e-7,0.8575184,0.030125443,0.10511824,0.0023002813,0.0007097313],"about_ca_topic_score_codex":0.000018041354,"about_ca_topic_score_gemma":0.000048904756,"teacher_disagreement_score":0.8545586,"about_ca_system_score_codex":0.00013926874,"about_ca_system_score_gemma":0.0004159964,"threshold_uncertainty_score":0.9998217},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001798534,0.0010927073,0.9934334,0.00017703153,0.001901223,0.0006865946,0.00001470393,0.0009192871,0.001595186],"genre_scores_gemma":[0.3671303,0.00037493184,0.62803066,0.00006168311,0.0017326756,0.00006275891,0.0000699341,0.00018855814,0.0023484784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763435,0.00000976376,0.00043185445,0.0008774128,0.0005211589,0.0005254745],"domain_scores_gemma":[0.9990937,0.00018643324,0.00009848064,0.0003488331,0.0001801206,0.00009243194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032581144,0.00047356752,0.00037055675,0.0005183782,0.00020039895,0.0001628778,0.0004938659,0.00035846882,0.0000661308],"category_scores_gemma":[0.00006316409,0.0004897959,0.000153117,0.00027823987,0.0002760835,0.00043527666,0.00019395206,0.0012070733,0.000048606853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013549845,0.0000067175465,0.00004745093,0.00016018125,0.000014177841,0.000041022722,0.00026118217,0.87573826,0.0026901374,0.0018673204,0.00005545315,0.119104534],"study_design_scores_gemma":[0.00014553894,0.00020753889,0.000086201464,0.00081463315,0.000024108072,0.000047361827,7.871189e-7,0.95848566,0.0047962503,0.03233674,0.0025270667,0.00052810897],"about_ca_topic_score_codex":0.00001946602,"about_ca_topic_score_gemma":0.00018508693,"teacher_disagreement_score":0.36695045,"about_ca_system_score_codex":0.00060880475,"about_ca_system_score_gemma":0.00009011717,"threshold_uncertainty_score":0.9997554},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007713717,0.0014813817,0.9902034,0.0016314419,0.0029964934,0.00073441555,0.000013777787,0.00031203483,0.00261935],"genre_scores_gemma":[0.012642262,0.0000895139,0.9835106,0.0016775017,0.0007678237,0.00005377016,0.0000045579195,0.00008414741,0.0011697821],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955866,0.0000206253,0.0006428851,0.0020217332,0.00086837803,0.0008597822],"domain_scores_gemma":[0.9970963,0.0007803988,0.00025886708,0.0012915157,0.00036887353,0.00020402705],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008902752,0.00062606734,0.00064559403,0.00097089773,0.00037729184,0.001123647,0.0030050455,0.00025868003,0.000025055251],"category_scores_gemma":[0.00040342304,0.0005488106,0.00024797153,0.0008321233,0.0005000044,0.0009900272,0.0017453711,0.000693808,0.00007632756],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006765667,0.000013396044,0.0000048079287,0.00015730094,0.000015057573,0.000066824745,0.00022226502,0.0022382468,0.00028959854,0.050729103,0.00006197775,0.94619465],"study_design_scores_gemma":[0.00022656911,0.0000975181,0.0000071359364,0.0018144322,0.000024353592,0.00009225815,2.2865211e-7,0.72487277,0.0039731744,0.24504104,0.023039589,0.0008109142],"about_ca_topic_score_codex":0.0000072458392,"about_ca_topic_score_gemma":0.000021914982,"teacher_disagreement_score":0.9453837,"about_ca_system_score_codex":0.00035038358,"about_ca_system_score_gemma":0.00060116703,"threshold_uncertainty_score":0.9999133},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025183056,0.049158074,0.14074776,0.0024362104,0.014936252,0.001871674,0.0007520182,0.0014793258,0.7634356],"genre_scores_gemma":[0.9972967,0.0014642471,0.0005043992,0.000006022627,0.00045282464,0.000006171935,0.0000109682405,0.000042666325,0.00021600009],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831504,0.000008096917,0.00034875772,0.00047921593,0.00054610526,0.00030280123],"domain_scores_gemma":[0.9990818,0.00022704105,0.00002532552,0.00040661285,0.00016267829,0.00009657305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033872153,0.00027830625,0.00029365785,0.000641407,0.00006716789,0.00038687626,0.00053002645,0.000302924,0.000021731283],"category_scores_gemma":[0.0000268614,0.00023036003,0.000061061175,0.0003512376,0.00077933137,0.0007042352,0.00022902968,0.0011880264,0.000010405021],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048429047,0.00003099814,0.00037264958,0.001280219,0.00005361011,0.000014685969,0.004561251,0.004338537,0.000030885963,0.015448395,0.000032470496,0.9738315],"study_design_scores_gemma":[0.0008913751,0.0009946837,0.004476336,0.008537962,0.00007235944,0.00025642628,0.00014161099,0.06990868,0.0075130765,0.4861372,0.41686583,0.004204433],"about_ca_topic_score_codex":0.0000054880916,"about_ca_topic_score_gemma":0.00004078022,"teacher_disagreement_score":0.97211367,"about_ca_system_score_codex":0.00020033629,"about_ca_system_score_gemma":0.00007219013,"threshold_uncertainty_score":0.939381},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000375762,0.00016719292,0.99771506,0.00012945304,0.00065159204,0.00068411283,6.776695e-7,0.00011032418,0.0005039929],"genre_scores_gemma":[0.3517327,0.000031697724,0.6470833,0.00013423534,0.00015335645,0.000011496524,0.0000054853454,0.000030880557,0.0008168478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972311,0.000021298965,0.00060450356,0.0009884302,0.0007028051,0.0004518252],"domain_scores_gemma":[0.99830186,0.0005099087,0.00033102187,0.00053754373,0.0002157517,0.00010391543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010052565,0.00038959773,0.0004478777,0.0006741695,0.00021093953,0.0003929912,0.0010816484,0.00023152884,0.0000027598542],"category_scores_gemma":[0.00011463027,0.00037041647,0.00010127953,0.0002818821,0.00031420408,0.00043443494,0.00066609087,0.00054618984,0.0000032370042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033001281,0.0000019066154,0.0000029923447,0.00007068712,0.000014672445,0.0000035053947,0.0021236741,0.91840947,0.00035796606,0.033758666,0.0000039125566,0.045249272],"study_design_scores_gemma":[0.00019899767,0.00034770495,6.0003515e-7,0.00032779222,0.000017415556,0.000007476012,3.7309366e-7,0.97694755,0.00091699796,0.020680035,0.00019670498,0.00035835413],"about_ca_topic_score_codex":0.0000018075543,"about_ca_topic_score_gemma":0.0000016561588,"teacher_disagreement_score":0.35169512,"about_ca_system_score_codex":0.00018395719,"about_ca_system_score_gemma":0.00041783712,"threshold_uncertainty_score":0.9998748},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000242917,0.002680093,0.9942379,0.00007017768,0.0017618886,0.0002164741,0.0000026100295,0.00043826844,0.00034969175],"genre_scores_gemma":[0.051003255,0.00012192861,0.94840324,0.00012453174,0.00021644373,0.0000047954136,0.000001920147,0.000041072264,0.00008281815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996867,0.000026009562,0.00043376058,0.001417596,0.00072249805,0.0005331625],"domain_scores_gemma":[0.9984959,0.00036346418,0.000117888456,0.0007652644,0.00014637508,0.000111106514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011248578,0.0004538861,0.000415863,0.0008008517,0.00019716473,0.00055898866,0.0013552979,0.00024911785,9.919652e-7],"category_scores_gemma":[0.0001862715,0.00044429905,0.000063963016,0.0004050109,0.00022500912,0.0013905969,0.0014627333,0.00069325813,0.0000032307883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013498627,0.000001966261,0.0000012649941,0.00004389154,0.000006466381,0.000035336747,0.0005692039,0.85951084,0.0001171575,0.033445098,2.6442177e-7,0.10626719],"study_design_scores_gemma":[0.00005201388,0.000020376086,7.516037e-7,0.0005927355,0.000005251994,0.00004146071,1.9725891e-7,0.6088752,0.000114039736,0.3900129,0.000008276939,0.00027677143],"about_ca_topic_score_codex":0.000018860961,"about_ca_topic_score_gemma":0.0000073913798,"teacher_disagreement_score":0.3565678,"about_ca_system_score_codex":0.00040604867,"about_ca_system_score_gemma":0.00020130412,"threshold_uncertainty_score":0.99980086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001166892,0.001197495,0.9913688,0.0002810424,0.0046606823,0.00037996695,0.000025116855,0.00034853,0.0005715188],"genre_scores_gemma":[0.26602304,0.000037874077,0.73084444,0.0012058822,0.0016837826,0.000007898771,0.000018642611,0.00006590562,0.00011253095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944273,0.00006180554,0.0008672813,0.0024453374,0.0013465513,0.0008516988],"domain_scores_gemma":[0.99704343,0.0004409352,0.00038446995,0.0016578177,0.00025103896,0.00022233705],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00093174254,0.00071986363,0.0005851565,0.00073794735,0.0005351538,0.0019220351,0.0038127326,0.00046733525,0.000033578053],"category_scores_gemma":[0.000038560014,0.00072647084,0.00020164516,0.0007319412,0.0002967844,0.0011750644,0.0021270365,0.0012452422,0.000040865696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034979707,0.00002838238,0.000058160407,0.00006680817,0.000041925578,0.00013456545,0.003036822,0.7484438,0.0008015318,0.034759838,0.000016654221,0.21260802],"study_design_scores_gemma":[0.000110886554,0.00003429857,0.000005415189,0.0009801424,0.000014003192,0.000024130244,4.2099452e-7,0.72707087,0.0005724498,0.27051055,0.00011181516,0.00056504423],"about_ca_topic_score_codex":0.00012594629,"about_ca_topic_score_gemma":0.00006681191,"teacher_disagreement_score":0.26485613,"about_ca_system_score_codex":0.00062589307,"about_ca_system_score_gemma":0.0006018582,"threshold_uncertainty_score":0.99951863},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039095613,0.001439449,0.9893497,0.0007360585,0.0025318323,0.00036797673,0.000004480499,0.00015054386,0.0015103798],"genre_scores_gemma":[0.7770154,0.00007064399,0.22162257,0.00048158612,0.00046249494,0.000011350476,0.0000072734115,0.000033119173,0.00029554742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643266,0.000027108184,0.0006775452,0.0017017965,0.0006448425,0.000516021],"domain_scores_gemma":[0.99857426,0.00014072034,0.00023701621,0.0006517635,0.00022848666,0.00016774319],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000806292,0.0004731123,0.0004954902,0.001741681,0.00028139257,0.0011005847,0.0007222155,0.00026849142,0.00000833751],"category_scores_gemma":[0.00012505923,0.00044460248,0.00006347961,0.001138112,0.0006328203,0.0007736876,0.0007621884,0.0007627982,0.000037337257],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002501142,0.000010458689,0.00038217273,0.0001211844,0.0000060762495,0.00006114982,0.00065509346,0.010169863,0.0019860158,0.0044191196,0.000006088321,0.9821803],"study_design_scores_gemma":[0.00019079007,0.00011676828,0.001313896,0.0014109742,0.000012112278,0.0005547726,6.31997e-7,0.93700206,0.0028181244,0.055602305,0.00022717351,0.00075040094],"about_ca_topic_score_codex":0.00009227021,"about_ca_topic_score_gemma":0.0003037974,"teacher_disagreement_score":0.9814299,"about_ca_system_score_codex":0.0003235176,"about_ca_system_score_gemma":0.0004443776,"threshold_uncertainty_score":0.99993634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020965782,0.0006825259,0.99172544,0.0027786512,0.0008872741,0.00074017554,0.0000097461925,0.00048191444,0.0024846098],"genre_scores_gemma":[0.3497646,0.0000106436055,0.648533,0.00078406336,0.00026147842,0.00007809116,0.000007116198,0.000056692068,0.0005043424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964254,0.000024053768,0.00044941631,0.001973613,0.00046610556,0.00066141074],"domain_scores_gemma":[0.99728686,0.000757225,0.00023232216,0.0012635852,0.00024904864,0.00021094529],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010292722,0.0005443784,0.0005201021,0.00078865647,0.0003579109,0.0010753826,0.0023114071,0.00028375234,0.0000089405785],"category_scores_gemma":[0.00030462586,0.0005186336,0.00014461487,0.00049298204,0.00046478794,0.00031618786,0.0013028946,0.0009367312,0.000019290092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004578808,0.000015760195,0.00014019996,0.00014598877,0.000019451818,0.000018282857,0.0011429035,0.053916648,0.00016064243,0.09480866,0.000012397202,0.8496145],"study_design_scores_gemma":[0.0001764321,0.00011498558,0.0002455688,0.0008126942,0.000015357815,0.000037215992,1.5216746e-7,0.93560266,0.0002322852,0.059489943,0.002755046,0.00051762536],"about_ca_topic_score_codex":0.00012919096,"about_ca_topic_score_gemma":0.000069063615,"teacher_disagreement_score":0.88168603,"about_ca_system_score_codex":0.0003719504,"about_ca_system_score_gemma":0.000703525,"threshold_uncertainty_score":0.9999616},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093684444,0.0032853964,0.9929278,0.00008400326,0.0017500048,0.00042824165,0.0000336593,0.00036456707,0.00018946372],"genre_scores_gemma":[0.4143934,0.0017508154,0.58046883,0.0002483167,0.00081244943,0.000053879096,0.000053772368,0.00018031872,0.0020382523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975334,0.000012690839,0.0005709379,0.0009642758,0.0004237631,0.00049495394],"domain_scores_gemma":[0.99892694,0.00016419703,0.000105351704,0.00052990153,0.00015483587,0.00011879661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003860484,0.0005302829,0.0006283373,0.0007049821,0.00022101561,0.00024065947,0.00046459926,0.00038197418,0.000028962515],"category_scores_gemma":[0.000058740134,0.00043261363,0.00023219896,0.0004042986,0.00019498062,0.00018161077,0.00019913836,0.00055337156,0.00003299862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066397956,0.000013194198,7.60927e-7,0.0002376656,0.000017953935,0.000009095958,0.00015866687,0.6929507,0.0006364249,0.000075888136,0.000008339001,0.30588466],"study_design_scores_gemma":[0.00024776557,0.00006119953,9.475246e-7,0.0019088112,0.00010396753,0.000067050736,2.4971405e-7,0.98582935,0.00025513058,0.010780012,0.00022322522,0.00052229385],"about_ca_topic_score_codex":0.000021118823,"about_ca_topic_score_gemma":0.00032574657,"teacher_disagreement_score":0.41345653,"about_ca_system_score_codex":0.00044996035,"about_ca_system_score_gemma":0.0001453706,"threshold_uncertainty_score":0.99981254},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025125826,0.0011756276,0.98787075,0.00051780796,0.0053294892,0.0003479471,9.509772e-7,0.0003397359,0.0019051115],"genre_scores_gemma":[0.94399565,0.0002606371,0.045520153,0.0018381423,0.0034272925,0.000018104158,0.000007072757,0.00013004009,0.0048029255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964985,0.00008188102,0.00048407828,0.0014456175,0.0009032041,0.00058667775],"domain_scores_gemma":[0.99830925,0.000350569,0.00026077533,0.00075908186,0.00020371146,0.0001166001],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011423273,0.00048403983,0.00035334745,0.00065925816,0.0015838741,0.001283606,0.0014966966,0.0004202384,0.000062555424],"category_scores_gemma":[0.00007421496,0.00036330443,0.0001566632,0.0011818206,0.00051822036,0.0003898902,0.0025594058,0.0018475058,0.00017543673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010656705,0.000007785158,0.0000029755565,0.00002804736,0.0000106923935,0.00004435456,0.00055341976,0.11849949,0.0041787135,0.0022360992,0.000014526543,0.87441325],"study_design_scores_gemma":[0.000098164586,0.00015472014,0.000008904605,0.00036271496,0.000012062901,0.00024504802,2.509179e-7,0.9313252,0.0106045995,0.042879283,0.013877487,0.00043156673],"about_ca_topic_score_codex":0.00006634412,"about_ca_topic_score_gemma":0.0005381739,"teacher_disagreement_score":0.94235057,"about_ca_system_score_codex":0.00085311034,"about_ca_system_score_gemma":0.00023218438,"threshold_uncertainty_score":0.99988186},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013765321,0.00055389275,0.9935062,0.00043799242,0.00086636294,0.00039902507,0.000010786361,0.00031238148,0.0025368587],"genre_scores_gemma":[0.76334614,0.0000942697,0.23155868,0.0016519987,0.00086475664,0.000030316858,0.000080324506,0.00008267783,0.002290855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694043,0.000023569031,0.0004447412,0.001413822,0.00073667115,0.00044076753],"domain_scores_gemma":[0.998533,0.00014133831,0.00022095369,0.0007011192,0.00024488624,0.00015867669],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00048221272,0.00050008396,0.000425416,0.0007150724,0.00046042987,0.0018278628,0.0010488736,0.00023968694,0.000043436045],"category_scores_gemma":[0.000014234142,0.00040191153,0.00007354593,0.0004384788,0.00071188674,0.0010716717,0.0005883066,0.00070756744,0.00007880482],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009116162,0.00003554573,0.00016499039,0.00030121874,0.000029222312,0.00024060757,0.0010180131,0.01473959,0.00005335947,0.019022143,0.00004149454,0.9643447],"study_design_scores_gemma":[0.00038032216,0.00048251986,0.0002624922,0.0018860995,0.000028053668,0.00029485527,4.3719385e-7,0.7102646,0.00042147058,0.2825734,0.0024623435,0.0009434119],"about_ca_topic_score_codex":0.00005453009,"about_ca_topic_score_gemma":0.00023822104,"teacher_disagreement_score":0.9634013,"about_ca_system_score_codex":0.00018809627,"about_ca_system_score_gemma":0.00026656713,"threshold_uncertainty_score":0.9998433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017468737,0.00065625197,0.9924612,0.00004870811,0.001070934,0.00053976,0.00005105043,0.0015403582,0.0034570426],"genre_scores_gemma":[0.5967587,0.000065409076,0.40216038,0.000052147687,0.0003258259,0.00005431459,0.00009881014,0.00010134149,0.00038303903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985448,0.0000041031467,0.00029341603,0.0006343751,0.00020019851,0.00032308503],"domain_scores_gemma":[0.99940693,0.00008875742,0.00004912008,0.00036773554,0.000043274864,0.0000441845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027286838,0.00031722678,0.0002776106,0.00048575606,0.00011216529,0.000060047696,0.0004099951,0.00055864436,0.000006675765],"category_scores_gemma":[0.000009044019,0.00031357585,0.00008994603,0.0002136194,0.00022394213,0.00011250308,0.00008550682,0.0006715446,0.00001061931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004462434,0.000007125223,0.000010766582,0.00020183892,0.000028030578,0.000004288078,0.00024734312,0.8915201,0.00008046481,0.0014623469,0.000012900288,0.10642037],"study_design_scores_gemma":[0.00012716881,0.000056159013,0.00011255503,0.000091084876,0.000027832299,0.000025789648,2.3722461e-7,0.9800379,0.000090276604,0.018582497,0.0005719572,0.00027650894],"about_ca_topic_score_codex":0.0000011329657,"about_ca_topic_score_gemma":0.000016181128,"teacher_disagreement_score":0.596584,"about_ca_system_score_codex":0.0005147759,"about_ca_system_score_gemma":0.00008841761,"threshold_uncertainty_score":0.99993163},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013604043,0.00029996719,0.99452484,0.0012274788,0.0020189364,0.0008201104,0.000013069055,0.0003709438,0.00071107945],"genre_scores_gemma":[0.028025528,0.000023077075,0.968453,0.0009997637,0.0003871465,0.000027685754,0.00003989618,0.00005909776,0.00198483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679065,0.000020841631,0.00057248777,0.001438051,0.00066407915,0.00051390834],"domain_scores_gemma":[0.9979289,0.00041342957,0.00029024974,0.00080410036,0.00042610167,0.0001371857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006851754,0.00045839543,0.00045832642,0.0008100308,0.00031281408,0.00091866514,0.00129597,0.00022614204,0.000024659204],"category_scores_gemma":[0.0002278826,0.0004358125,0.0001519038,0.0004678607,0.0002878724,0.0011672195,0.00047345302,0.00043268688,0.00015310536],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053459985,0.000015013354,0.0000034898374,0.000044972527,0.000006246786,0.000013087299,0.00021121335,0.07576988,0.0003061695,0.019185504,0.000029236187,0.9044098],"study_design_scores_gemma":[0.00027863035,0.00007403516,0.000021492826,0.0003508071,0.000011785654,0.00004182286,1.2282656e-7,0.8020316,0.0010405916,0.19498672,0.00079426146,0.00036817035],"about_ca_topic_score_codex":0.0000037705418,"about_ca_topic_score_gemma":0.0000049212267,"teacher_disagreement_score":0.90404165,"about_ca_system_score_codex":0.00034029616,"about_ca_system_score_gemma":0.00019608262,"threshold_uncertainty_score":0.9998094},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049210103,0.00052767666,0.9894956,0.0012481767,0.0021959208,0.00059973367,0.000018918026,0.001060176,0.0048045972],"genre_scores_gemma":[0.14778867,0.00031500935,0.8403812,0.006820882,0.0012979136,0.00014786248,0.000011467578,0.00020088202,0.00303612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99427557,0.000038531605,0.00082296866,0.0025272148,0.0013695383,0.0009661854],"domain_scores_gemma":[0.99635684,0.0005399199,0.00024750226,0.0021317394,0.00036700227,0.00035696878],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013181436,0.0007731506,0.00083817815,0.0023103317,0.00031819424,0.0014815136,0.00465516,0.00041468084,0.000057087258],"category_scores_gemma":[0.00009104094,0.00071882596,0.00030122962,0.0020214913,0.0003423488,0.0005480836,0.0034109014,0.00088746875,0.00024302024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008035898,0.00009086631,0.000050117837,0.00017439817,0.00003935577,0.00017227435,0.001994116,0.0018430823,0.00023224315,0.55224425,0.0005479079,0.44260332],"study_design_scores_gemma":[0.00013207311,0.00017076332,0.000064643835,0.0014093814,0.000019233195,0.00004390005,2.2856236e-7,0.6218047,0.0065809092,0.35140496,0.017228452,0.0011407203],"about_ca_topic_score_codex":0.000015361542,"about_ca_topic_score_gemma":0.00010977608,"teacher_disagreement_score":0.6199616,"about_ca_system_score_codex":0.00026520793,"about_ca_system_score_gemma":0.00039738283,"threshold_uncertainty_score":0.99955505},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002362967,0.00092829147,0.96340144,0.00004798095,0.026431292,0.00035678994,0.000010475272,0.0004860488,0.00810136],"genre_scores_gemma":[0.76951754,0.00028070086,0.12602083,0.0019544219,0.061659303,0.00011461067,0.000099316465,0.00093527074,0.039417997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975563,0.0000277345,0.00046618402,0.00080617995,0.0006638959,0.000479663],"domain_scores_gemma":[0.99899065,0.0001999561,0.000055861867,0.00055405276,0.000081721744,0.0001177594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062921876,0.00043792426,0.00046318924,0.00090749364,0.00010886292,0.0005702485,0.00056869833,0.00056937936,0.00005927877],"category_scores_gemma":[0.000016265003,0.00037252912,0.00015147189,0.00096913363,0.00015916984,0.00020261406,0.00029504503,0.0012295585,0.00053630077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004019292,0.0000065005443,0.0000020070988,0.00019775357,0.000015128633,0.00010794849,0.00019802689,0.32860103,0.00020718508,0.000056307912,0.018111523,0.6524926],"study_design_scores_gemma":[0.00015638418,0.00020997558,0.000013184575,0.0013067276,0.00001271793,0.000106948006,1.0073026e-7,0.9075815,0.00076243695,0.0058025126,0.08350753,0.00053997955],"about_ca_topic_score_codex":0.000011851997,"about_ca_topic_score_gemma":0.000025567802,"teacher_disagreement_score":0.83738065,"about_ca_system_score_codex":0.00061653566,"about_ca_system_score_gemma":0.00023970417,"threshold_uncertainty_score":0.9998727},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001166925,0.0006812028,0.7849824,0.0013112432,0.0011818343,0.0005804185,0.000009632153,0.0002381531,0.2098482],"genre_scores_gemma":[0.87373334,0.00007133237,0.11604122,0.001507398,0.0007044445,0.0000134504035,0.0000066221423,0.0001270781,0.0077951076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970718,0.000016797941,0.00037928173,0.001269275,0.0007891815,0.0004736622],"domain_scores_gemma":[0.99847674,0.00029024482,0.00011239041,0.00093858526,0.000021412625,0.00016062775],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005305032,0.00039313006,0.0003452842,0.0002329611,0.00022565314,0.00021586717,0.00095685467,0.00021480757,0.00032521208],"category_scores_gemma":[0.00005842918,0.00033247095,0.00013867929,0.00051858893,0.0010546928,0.000043396667,0.00068829797,0.0005348905,0.0021536949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001949137,0.000028947039,0.000052700725,0.000038114293,0.000010098729,0.000049947448,0.00049363816,0.18437189,0.0006284094,0.0019918946,0.00063249597,0.8116999],"study_design_scores_gemma":[0.00011032862,0.00006197174,0.0005737286,0.0010120907,0.00007663019,0.0001835011,4.2138493e-7,0.8466947,0.0035504736,0.055811483,0.09064775,0.0012769287],"about_ca_topic_score_codex":0.00009944518,"about_ca_topic_score_gemma":0.00012352482,"teacher_disagreement_score":0.8725664,"about_ca_system_score_codex":0.00052420323,"about_ca_system_score_gemma":0.000078052275,"threshold_uncertainty_score":0.99991274},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074139115,0.0009908082,0.9861073,0.0010539698,0.0014489813,0.00047981815,0.000012108733,0.00033347632,0.008832163],"genre_scores_gemma":[0.66014344,0.000017229608,0.33675203,0.00096867257,0.0003711688,0.000015716321,0.000017109069,0.00006183571,0.0016528164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99506223,0.000068749854,0.0006951873,0.0021303971,0.0012716431,0.0007718136],"domain_scores_gemma":[0.997641,0.00051048916,0.00027211802,0.001228055,0.000107833606,0.00024046589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012033937,0.0006333693,0.00062387495,0.0009243513,0.00019159714,0.0010227762,0.0023701326,0.0003765764,0.000026499303],"category_scores_gemma":[0.00013894722,0.0005719981,0.00015887365,0.0007638502,0.00050427584,0.0013040738,0.001537046,0.0017297768,0.000073903495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015676638,0.000064041225,0.000097333,0.000047592384,0.000023505276,0.0005425901,0.027778301,0.1976036,0.00024826237,0.048972275,0.00004469091,0.7245621],"study_design_scores_gemma":[0.0002720354,0.0000732601,0.00010779465,0.00056389783,0.0000070061524,0.000021023285,0.0000053928657,0.8072524,0.00010183898,0.18992011,0.0011019602,0.0005732876],"about_ca_topic_score_codex":0.00018835565,"about_ca_topic_score_gemma":0.00035719902,"teacher_disagreement_score":0.72398883,"about_ca_system_score_codex":0.0004387854,"about_ca_system_score_gemma":0.00048265347,"threshold_uncertainty_score":0.9996731},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023772463,0.001356463,0.98948413,0.00030109647,0.0029749356,0.00041385688,0.0000010195436,0.00027878163,0.0049519637],"genre_scores_gemma":[0.7437902,0.000054808253,0.25292435,0.00094060594,0.00087026664,0.000022265229,0.0000067400715,0.00007227081,0.0013184818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607974,0.000060682083,0.0007182215,0.0015841522,0.0007372344,0.00081998267],"domain_scores_gemma":[0.9981956,0.00042109477,0.00034100466,0.0008153747,0.000120901335,0.00010601588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014519992,0.000493268,0.00050626363,0.00077529735,0.00027148327,0.0008588822,0.0018052664,0.00032501784,0.000011600119],"category_scores_gemma":[0.00012268519,0.0004935215,0.00014947474,0.0010441126,0.0003068309,0.00088634586,0.0011196781,0.0017057536,0.00004434229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036962133,0.000011608983,0.000029571711,0.000048035672,0.00000844105,0.00016303486,0.0014669936,0.28326607,0.000112999325,0.006536347,0.000003798093,0.7083494],"study_design_scores_gemma":[0.00022809337,0.00008618332,0.00008229306,0.0008208312,0.000007590401,0.000094831135,0.0000018761012,0.9352877,0.00034693524,0.061224066,0.0012971476,0.00052245456],"about_ca_topic_score_codex":0.00005684034,"about_ca_topic_score_gemma":0.00022660842,"teacher_disagreement_score":0.7435525,"about_ca_system_score_codex":0.00037098397,"about_ca_system_score_gemma":0.00023308971,"threshold_uncertainty_score":0.9997516},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014496809,0.00018332258,0.99109846,0.0005158521,0.0007592606,0.0005993686,0.0000052644427,0.00016365874,0.0065298295],"genre_scores_gemma":[0.4078158,0.000021303857,0.59142435,0.00020408042,0.0003066207,0.000023095217,0.000004971178,0.00002851442,0.00017124093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721843,0.0000120357,0.0005149034,0.0010210532,0.0007795386,0.00045406594],"domain_scores_gemma":[0.9987552,0.00014054205,0.00016687432,0.00056400907,0.0002827677,0.00009058991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075271574,0.00040664786,0.00046238137,0.0005458433,0.00012682406,0.00034159995,0.001288536,0.0002140358,0.000012739392],"category_scores_gemma":[0.000025992787,0.000303406,0.00013049562,0.0003415126,0.0003685115,0.00052726304,0.00014326135,0.0004336069,0.0000031121153],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018660587,0.00002917099,0.0000075211356,0.00013573881,0.000018387684,0.000010327962,0.002769825,0.0014521844,0.029168397,0.08716673,0.000009739981,0.87921333],"study_design_scores_gemma":[0.00026849468,0.0011932544,0.000008745191,0.0017664004,0.000026146648,0.000026747404,0.0000011149071,0.8503077,0.048207823,0.0971574,0.00045350345,0.00058266026],"about_ca_topic_score_codex":0.000006598242,"about_ca_topic_score_gemma":0.00006365452,"teacher_disagreement_score":0.87863064,"about_ca_system_score_codex":0.00016071368,"about_ca_system_score_gemma":0.0002845405,"threshold_uncertainty_score":0.9999418},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033977583,0.0016429344,0.97576815,0.010105461,0.0024654458,0.000417778,0.000024387062,0.0007851841,0.008756663],"genre_scores_gemma":[0.039856333,0.00036514198,0.95783424,0.0010835212,0.0002552224,0.00001890641,0.00002385721,0.00005670096,0.0005060457],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99427205,0.0000256967,0.0006378454,0.0029054903,0.0011746931,0.0009842471],"domain_scores_gemma":[0.98929113,0.0008292542,0.00024257539,0.00926051,0.00016187059,0.00021464149],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011433038,0.00080493774,0.00068887905,0.0012840591,0.00027365072,0.0015598455,0.035020676,0.0007899574,0.00005228156],"category_scores_gemma":[0.0030110702,0.00073170714,0.000114899005,0.00094455545,0.0013152154,0.0008935626,0.13616449,0.0020121557,0.0000838364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028456996,0.000019375104,0.000024092891,0.00014537718,0.000026660024,0.00034289344,0.00017287713,0.00047750244,0.000117291216,0.38035414,0.0015985974,0.61671835],"study_design_scores_gemma":[0.00008120683,0.00010306697,0.000021734751,0.0004572105,0.000008385536,0.000070999165,1.3084424e-7,0.33850947,0.00046172016,0.6566226,0.0031261267,0.00053735246],"about_ca_topic_score_codex":0.000023219696,"about_ca_topic_score_gemma":0.00006255876,"teacher_disagreement_score":0.616181,"about_ca_system_score_codex":0.00035865465,"about_ca_system_score_gemma":0.0004954262,"threshold_uncertainty_score":0.9995134},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024466118,0.0007556043,0.9963473,0.00026765172,0.0011012708,0.00038806666,0.0000066475577,0.00021315811,0.000675613],"genre_scores_gemma":[0.16938958,0.000108248634,0.8289861,0.00057265034,0.00048379684,0.00002364405,0.000014989108,0.000058367317,0.00036259912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702513,0.000023115752,0.00051926484,0.0013284184,0.00068803213,0.00041601743],"domain_scores_gemma":[0.9980415,0.00029005058,0.00029935327,0.0010674393,0.00020460223,0.00009702323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040679605,0.00038273513,0.0003780224,0.00059146783,0.00021504903,0.00023521075,0.0016477404,0.00024054579,0.000004944948],"category_scores_gemma":[0.000023152666,0.0003731807,0.000094025,0.001119168,0.00038606176,0.00041381083,0.00086441234,0.00056373357,0.000024706374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005255801,0.000022711492,0.000012342253,0.00007529993,0.000015917742,0.000019162273,0.00042987944,0.2191332,0.025695201,0.075648636,0.000033098324,0.6789093],"study_design_scores_gemma":[0.000099471894,0.00008163703,0.00000997637,0.00019395328,0.000009564322,0.00004716253,7.754315e-8,0.5364967,0.031521946,0.42827466,0.0028333191,0.00043152657],"about_ca_topic_score_codex":0.000016439957,"about_ca_topic_score_gemma":0.00008410707,"teacher_disagreement_score":0.67847776,"about_ca_system_score_codex":0.0002749972,"about_ca_system_score_gemma":0.00013054944,"threshold_uncertainty_score":0.999872},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028560022,0.0017170833,0.99274385,0.0011496049,0.00062397023,0.00034446624,0.000008921293,0.00014301247,0.0029835042],"genre_scores_gemma":[0.4171049,0.000043324715,0.5719665,0.002936165,0.0008634594,0.000027792754,0.000009606699,0.000085796826,0.0069624404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694574,0.000012598931,0.00036282104,0.0014400269,0.0005282161,0.0007106115],"domain_scores_gemma":[0.99886024,0.00030366238,0.00014123115,0.00049746817,0.00007199393,0.00012543146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011086334,0.0004310863,0.00047773524,0.0007750274,0.00020204738,0.0008569136,0.0012777194,0.00025117397,0.0000068141594],"category_scores_gemma":[0.000057612186,0.000391368,0.00008657059,0.00048280132,0.00025366576,0.0006501579,0.0012406766,0.00058413,0.000021635018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015972082,0.000062624895,0.000032156902,0.000617067,0.000029470884,0.000294765,0.016186232,0.035793196,0.0015776452,0.33003733,0.00025253312,0.61510104],"study_design_scores_gemma":[0.0002053475,0.000045605073,0.0000059638774,0.00054669316,0.0000066563616,0.000025745738,5.2505544e-7,0.82808024,0.000255418,0.17009102,0.00035010945,0.00038670827],"about_ca_topic_score_codex":0.00000830971,"about_ca_topic_score_gemma":0.000039019145,"teacher_disagreement_score":0.792287,"about_ca_system_score_codex":0.00020864609,"about_ca_system_score_gemma":0.00033748228,"threshold_uncertainty_score":0.99985385},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011057291,0.008081555,0.628203,0.32047468,0.0033973355,0.0018105134,0.000107073625,0.00038984747,0.026478702],"genre_scores_gemma":[0.98415,0.0005320699,0.008187676,0.003890156,0.00071649713,0.000003663386,0.0000091397005,0.00003470394,0.0024761143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972864,0.000087241664,0.00027095535,0.0008462819,0.0010037505,0.0005053952],"domain_scores_gemma":[0.9980806,0.0008838654,0.00014290855,0.00021710485,0.0004177251,0.00025780496],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021577505,0.00033139862,0.00044524734,0.00026863714,0.0009943566,0.0018275531,0.0004566135,0.00041413237,0.0000118307125],"category_scores_gemma":[0.00038907098,0.0002942523,0.00006068074,0.00026872457,0.003208737,0.0005611463,0.00036921768,0.0008839878,0.0000057475513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013088226,0.000029635265,0.0024513984,0.00034614978,0.000077611025,0.00016148166,0.03974229,0.0015431009,0.000021735303,0.72745717,0.0002610084,0.22789536],"study_design_scores_gemma":[0.00012362542,0.00006720248,0.00061396515,0.0002531881,0.0000134029015,0.000013351236,0.000006987416,0.014437126,0.0000056568306,0.98321295,0.0008526381,0.00039991477],"about_ca_topic_score_codex":0.00038160253,"about_ca_topic_score_gemma":0.0025560632,"teacher_disagreement_score":0.9730927,"about_ca_system_score_codex":0.0001842978,"about_ca_system_score_gemma":0.0009097322,"threshold_uncertainty_score":0.99995095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053458675,0.00022962624,0.97695655,0.000037451267,0.0044745645,0.00049480284,0.000113869646,0.00019214158,0.0121551445],"genre_scores_gemma":[0.97857314,0.000040379593,0.018847248,0.000063443855,0.0013925249,0.000017953762,0.000027105501,0.00007762915,0.0009605569],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986152,0.0000088796205,0.0003335438,0.00043902773,0.00039961087,0.00020375274],"domain_scores_gemma":[0.9993302,0.0001556847,0.00007435786,0.000290214,0.0000839774,0.00006553143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020540951,0.0002388996,0.00033361203,0.0004260741,0.000044422508,0.00010057397,0.00022309861,0.00022306704,0.000041676183],"category_scores_gemma":[0.000017235638,0.00021811051,0.00006717499,0.00027976927,0.00008013169,0.00014098483,0.00010601028,0.00036016246,0.000053294334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002486236,0.0000064671176,0.000008991425,0.00007392421,0.00003682318,0.000026155312,0.0009309798,0.4428866,0.025034841,0.00024274692,0.00020256337,0.530525],"study_design_scores_gemma":[0.00057356077,0.0004053419,0.00017623573,0.002154959,0.000058532914,0.000017566685,0.000003895147,0.42560175,0.52894336,0.03805614,0.0030153755,0.0009933054],"about_ca_topic_score_codex":0.00024383863,"about_ca_topic_score_gemma":0.000103510225,"teacher_disagreement_score":0.97322726,"about_ca_system_score_codex":0.00022458062,"about_ca_system_score_gemma":0.00005593327,"threshold_uncertainty_score":0.88942885},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.8538003e-7,0.52023053,0.46971825,0.0017770176,0.002641436,0.0054613748,0.000047096786,0.00012146455,0.0000025340569],"genre_scores_gemma":[0.00012271787,0.91365176,0.07282638,0.008418451,0.00075863436,0.004031916,0.00007506383,0.00010432232,0.000010738283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99229336,0.00076589535,0.0027116223,0.0017673272,0.00087188516,0.0015899274],"domain_scores_gemma":[0.9945076,0.0023192465,0.00071299326,0.0011812984,0.00089910434,0.0003797316],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0037533005,0.00075011497,0.0024827188,0.0008152928,0.0011326366,0.00009664873,0.0018080642,0.0007437835,0.000010212104],"category_scores_gemma":[0.00085525727,0.0005499855,0.00034440582,0.0026685218,0.0002655602,0.00015041688,0.00056957,0.002528495,0.00031787064],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018424928,0.000013433891,0.000011089204,0.30443963,0.000007992843,0.00000724701,0.0005574692,0.0054229265,3.3183266e-8,0.00017015592,0.00033923448,0.6890289],"study_design_scores_gemma":[0.000027872495,0.000043547803,9.865768e-8,0.2992588,0.00007420234,0.000004147491,0.0000016903285,0.434085,6.6758236e-7,0.0006346964,0.26550266,0.00036661502],"about_ca_topic_score_codex":0.00023658754,"about_ca_topic_score_gemma":0.001256097,"teacher_disagreement_score":0.6886623,"about_ca_system_score_codex":0.002843545,"about_ca_system_score_gemma":0.022784978,"threshold_uncertainty_score":0.9997727},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042959982,0.00039768175,0.98410726,0.0019888354,0.0007457901,0.00025470197,0.0000050986905,0.00045994626,0.011997748],"genre_scores_gemma":[0.7240472,0.000076282515,0.26225808,0.0019112112,0.0006132644,0.000023459008,0.00011481624,0.0001259225,0.010829806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609864,0.0000550172,0.0004103164,0.0018695323,0.00097299635,0.0005934776],"domain_scores_gemma":[0.99813116,0.00033427792,0.00022244937,0.0009060558,0.00022636236,0.00017972697],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009076838,0.00053198216,0.00045122686,0.0006794013,0.00042106287,0.001835894,0.0021255752,0.00027571406,0.00003108811],"category_scores_gemma":[0.00007170017,0.00041721045,0.00006720388,0.00089047564,0.00061244925,0.0006237927,0.0011702077,0.0018752349,0.00035192806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000107559545,0.00001882605,0.00007643803,0.00006598876,0.000019545194,0.00025229246,0.00041928887,0.06959972,0.00008601543,0.04067275,0.00006556238,0.8887128],"study_design_scores_gemma":[0.00021794082,0.000327832,0.000111409216,0.00061336363,0.000012310839,0.00019182822,4.1123613e-7,0.9572393,0.00028607858,0.019533606,0.020786688,0.0006792629],"about_ca_topic_score_codex":0.00006580443,"about_ca_topic_score_gemma":0.00016880831,"teacher_disagreement_score":0.88803357,"about_ca_system_score_codex":0.00024964436,"about_ca_system_score_gemma":0.0005879631,"threshold_uncertainty_score":0.999828},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04796137,0.0007194442,0.93131995,0.0012837022,0.013534707,0.0016804455,0.002109197,0.00025235905,0.0011388041],"genre_scores_gemma":[0.7514057,0.0000086756245,0.24088916,0.001304611,0.00389721,0.000017806444,0.00026758426,0.00009185078,0.0021173526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97808087,0.00008218585,0.0014306445,0.011720848,0.0071980394,0.0014874007],"domain_scores_gemma":[0.97599554,0.0024988574,0.00037122992,0.01971096,0.0006336888,0.0007897236],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.018465415,0.00090221054,0.0010526017,0.0056301286,0.0014079955,0.009501309,0.033642482,0.00017616614,0.00024121051],"category_scores_gemma":[0.003961317,0.0007273766,0.00011041878,0.008073916,0.0012545432,0.003133204,0.06979573,0.0010444478,0.0012010946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039055027,0.00022752216,0.0001437884,0.00001026057,0.000089458226,0.0051598884,0.052261654,0.06901195,0.00017421156,0.00091771124,0.004169889,0.86779463],"study_design_scores_gemma":[0.00030093215,0.00021703157,0.00015824172,0.0005875197,0.00008658306,0.00011836005,0.0015841001,0.92917377,0.0000334687,0.038502935,0.027927995,0.0013090922],"about_ca_topic_score_codex":0.003354496,"about_ca_topic_score_gemma":0.0037955155,"teacher_disagreement_score":0.86648554,"about_ca_system_score_codex":0.0005885999,"about_ca_system_score_gemma":0.0008727449,"threshold_uncertainty_score":0.99989206},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015831474,0.0007983498,0.9884145,0.0007898628,0.0021270863,0.00020576545,0.0000035750265,0.000070824804,0.0060068704],"genre_scores_gemma":[0.9167916,0.000012337498,0.08052736,0.00044729764,0.00025278374,0.0000431398,0.000023415345,0.000040112518,0.0018619301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709815,0.00010454455,0.00050438836,0.0013597783,0.00046869693,0.00046446398],"domain_scores_gemma":[0.9979159,0.0010582422,0.0002095083,0.00064199424,0.00007682547,0.00009747872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012235028,0.00035346005,0.0004503634,0.0022673972,0.00011407421,0.00023285975,0.000709915,0.00031738775,0.00040378253],"category_scores_gemma":[0.00010981049,0.0003363033,0.00018095394,0.0018598968,0.00049494725,0.000109523135,0.00014087214,0.0010020446,0.000062253224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049579314,0.00015607392,0.009054101,0.00012092343,0.00025877112,0.00014538839,0.057196256,0.53019685,0.0002573871,0.119730346,0.00007190221,0.28276244],"study_design_scores_gemma":[0.0007618507,0.00035562346,0.021526366,0.001443684,0.00035666022,0.000047198504,0.0003299381,0.7314876,0.00042140353,0.2191075,0.021816673,0.0023455312],"about_ca_topic_score_codex":0.0000892125,"about_ca_topic_score_gemma":0.0003446137,"teacher_disagreement_score":0.91520846,"about_ca_system_score_codex":0.00070869696,"about_ca_system_score_gemma":0.0002446004,"threshold_uncertainty_score":0.9999089},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001838883,0.000033680197,0.98002195,0.0016317302,0.0005946056,0.0005128838,0.000059516522,0.000088776345,0.016872983],"genre_scores_gemma":[0.12159296,0.0000046271134,0.8738155,0.00046775863,0.0006267168,0.000005479238,0.00018133014,0.00005665632,0.0032489807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976423,0.0000065335453,0.00029924847,0.0012617167,0.00048488975,0.00030533926],"domain_scores_gemma":[0.9984037,0.00029767846,0.00009696829,0.0010570356,0.000028405166,0.00011616793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052114244,0.00024700625,0.00019386335,0.00018204302,0.00025752818,0.0002339927,0.0009671749,0.00014214036,0.00009131296],"category_scores_gemma":[0.00010381043,0.00023246603,0.000053505068,0.00029171165,0.00044752232,0.000244753,0.001117639,0.00031219143,0.00052336976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061239716,0.000018860188,0.0001866065,0.000030924755,0.000011841825,0.000009890308,0.0005857818,0.12720656,0.0016056355,0.0066914447,0.0009955177,0.8626508],"study_design_scores_gemma":[0.00005964077,0.00003303528,0.0011976645,0.00012775148,0.000016689044,0.00001847121,1.2924374e-7,0.8346448,0.000089369285,0.09150142,0.07197181,0.00033924694],"about_ca_topic_score_codex":0.00003772546,"about_ca_topic_score_gemma":0.00018926455,"teacher_disagreement_score":0.86231154,"about_ca_system_score_codex":0.00040544715,"about_ca_system_score_gemma":0.000096310825,"threshold_uncertainty_score":0.94796896},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059947773,0.0070653064,0.87878865,0.0040490325,0.023231799,0.00050172344,0.000020069892,0.00019496713,0.08554895],"genre_scores_gemma":[0.40377384,0.00018357097,0.10687414,0.015124272,0.016208636,0.0002661134,0.00024670849,0.0002770994,0.4570456],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981483,0.000030217403,0.00025081847,0.0008865825,0.0003498792,0.00033418633],"domain_scores_gemma":[0.9988464,0.00026368035,0.00009002867,0.00063790457,0.000091063135,0.00007089293],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003893958,0.00022747414,0.00021022468,0.0004329841,0.000058023827,0.00018088985,0.00075143354,0.00026694103,0.00028614074],"category_scores_gemma":[0.00003581175,0.00020087577,0.0000705813,0.0005345695,0.00040270458,0.00006472376,0.00014955175,0.0006304462,0.0009960597],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042853967,0.000047371705,0.00006776277,0.000053138276,0.000017462624,0.000035156052,0.0054582194,0.000992115,0.000023673734,0.015553656,0.013880265,0.9638669],"study_design_scores_gemma":[0.0002099399,0.00020343659,0.0058187526,0.0006006544,0.0000369667,0.00019175989,0.000004161281,0.008560944,0.00010624421,0.36199492,0.62137944,0.00089278776],"about_ca_topic_score_codex":0.000027140712,"about_ca_topic_score_gemma":0.00003532615,"teacher_disagreement_score":0.96297413,"about_ca_system_score_codex":0.00027667338,"about_ca_system_score_gemma":0.0006954037,"threshold_uncertainty_score":0.9997818},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027073513,0.00022066654,0.98830706,0.0010070438,0.0045855786,0.00058999483,0.000007812106,0.00049255276,0.004762242],"genre_scores_gemma":[0.28985554,0.000018773464,0.7073225,0.00081766926,0.0010726776,0.00001923496,0.000006679709,0.00009582836,0.0007911452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935988,0.00005228437,0.0008245106,0.0028675299,0.0016613132,0.0009955369],"domain_scores_gemma":[0.9969181,0.0004307783,0.00022787384,0.0019738977,0.0001845523,0.00026482108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017335545,0.0008563429,0.0007810991,0.0008313256,0.00036669188,0.00075743994,0.004489086,0.00053289055,0.000025646976],"category_scores_gemma":[0.000112139736,0.000807945,0.00031262456,0.00064372964,0.00075374765,0.0009823601,0.002452461,0.0020674127,0.000078405785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077947425,0.00001614392,0.0000034393422,0.00006785177,0.00001340228,0.00007164116,0.00075063994,0.6353345,0.00023669927,0.032516,0.0000031732843,0.33097872],"study_design_scores_gemma":[0.00021911103,0.000085061474,0.000002589244,0.00016422442,0.000019830308,0.000030135247,9.259491e-8,0.716066,0.0003983947,0.2822292,0.0001833839,0.00060199917],"about_ca_topic_score_codex":0.0000773615,"about_ca_topic_score_gemma":0.00006048474,"teacher_disagreement_score":0.3303767,"about_ca_system_score_codex":0.0010440119,"about_ca_system_score_gemma":0.0009532953,"threshold_uncertainty_score":0.99943715},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001758368,0.00026139343,0.97258306,0.00078811083,0.0037153286,0.0005282825,8.8718485e-7,0.000827196,0.021278143],"genre_scores_gemma":[0.12667164,0.00006342736,0.8597542,0.002436509,0.0010272232,0.000020652993,0.0000072411904,0.00013536762,0.009883733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99412036,0.00004372432,0.0007070813,0.0022297557,0.0018184024,0.0010806815],"domain_scores_gemma":[0.99673945,0.00074011163,0.00028609304,0.0015496142,0.0003097407,0.00037500434],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012048571,0.0007622988,0.00064573233,0.0030042413,0.00036024788,0.001479997,0.0048223403,0.00041339963,0.00002610008],"category_scores_gemma":[0.00021877646,0.0007209025,0.00019814595,0.0028073124,0.0002655677,0.0006068602,0.0035797283,0.002198316,0.0014576245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013351486,0.000007801553,0.00003170535,0.000040946878,0.00002158109,0.00013821562,0.0016681413,0.7821914,0.000032602697,0.012486066,0.000038288206,0.20334195],"study_design_scores_gemma":[0.00012817718,0.0005204755,0.000047147078,0.00042154428,0.000018257953,0.000088134024,2.6180274e-7,0.9589888,0.00040290097,0.023022102,0.015473565,0.00088863005],"about_ca_topic_score_codex":0.000015464422,"about_ca_topic_score_gemma":0.0000096322565,"teacher_disagreement_score":0.20245332,"about_ca_system_score_codex":0.0007833436,"about_ca_system_score_gemma":0.0004981015,"threshold_uncertainty_score":0.99955654},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008631293,0.00096943387,0.9900773,0.0011114313,0.0033303765,0.00067861675,0.000012247404,0.0016101323,0.0022017942],"genre_scores_gemma":[0.42655686,0.000098461205,0.5679967,0.00312053,0.00093613303,0.00003252624,0.0000049598607,0.0001284574,0.001125417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947238,0.00003845089,0.0007069991,0.0023692877,0.0011994523,0.0009619953],"domain_scores_gemma":[0.9966208,0.0005067573,0.00033555875,0.001881387,0.00040252108,0.00025300236],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007556364,0.0008347256,0.0007613923,0.0015100476,0.00033799125,0.0010606459,0.00327073,0.00047529206,0.00002676651],"category_scores_gemma":[0.0000750125,0.000801727,0.00023833767,0.0010325728,0.0006481108,0.001083219,0.0014349618,0.0015802735,0.00015724592],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011083637,0.0000299234,0.000014218857,0.00018290963,0.000033652697,0.0008252862,0.00052011875,0.014255824,0.0010228874,0.019408353,0.000040259307,0.9636555],"study_design_scores_gemma":[0.00027625047,0.00024576415,0.000015750244,0.00085147267,0.000022803568,0.00038957436,1.9611872e-7,0.5513206,0.009608936,0.43112925,0.005048011,0.0010913924],"about_ca_topic_score_codex":0.000023895096,"about_ca_topic_score_gemma":0.00008085358,"teacher_disagreement_score":0.9625641,"about_ca_system_score_codex":0.0006444089,"about_ca_system_score_gemma":0.00044907513,"threshold_uncertainty_score":0.99997634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014786688,0.001471665,0.9911337,0.00070087716,0.0032868197,0.00037120446,0.000020514799,0.0003737106,0.0011628349],"genre_scores_gemma":[0.16295354,0.00020724692,0.8336441,0.00059414917,0.0014627711,0.000023228147,0.00003973618,0.000063643085,0.001011588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996656,0.00005069484,0.00043487022,0.0016463997,0.0007129202,0.0004991002],"domain_scores_gemma":[0.99841106,0.00029649487,0.00020622487,0.0007887467,0.0001703811,0.00012709227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011937042,0.00048115937,0.0004738543,0.00078043237,0.00031601216,0.0009845912,0.0011264702,0.00037025128,0.0000038548837],"category_scores_gemma":[0.00005583077,0.00043482505,0.00012433327,0.0006734829,0.0002831165,0.00072489376,0.00096406986,0.001098791,0.000010289009],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001616627,0.000026198048,0.0009430136,0.0000857118,0.000014991727,0.00011664819,0.00039943986,0.001192918,0.0012389204,0.0011845956,0.00001184856,0.9947841],"study_design_scores_gemma":[0.00039617883,0.00028355487,0.028825102,0.0020199425,0.00006455132,0.00052646274,7.145649e-7,0.89952904,0.0008103784,0.06378593,0.0024949035,0.0012632482],"about_ca_topic_score_codex":0.000017845214,"about_ca_topic_score_gemma":0.00008278286,"teacher_disagreement_score":0.99352086,"about_ca_system_score_codex":0.00018341016,"about_ca_system_score_gemma":0.00014331692,"threshold_uncertainty_score":0.99981034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014252869,0.00092289096,0.99341,0.00078283803,0.0010190052,0.00046082903,0.000010510476,0.00054594653,0.002705486],"genre_scores_gemma":[0.20990491,0.000029808683,0.7871903,0.0010332721,0.0002585051,0.000015304176,0.000003277737,0.00008523759,0.0014794014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99352413,0.000020123456,0.000747222,0.0030260491,0.001528016,0.0011544371],"domain_scores_gemma":[0.99669355,0.00018079965,0.0002670035,0.0022800842,0.00026497623,0.00031356598],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009167664,0.0009199381,0.0007600098,0.0011399896,0.0003373171,0.0011314739,0.004265662,0.0004319098,0.000004428531],"category_scores_gemma":[0.000031300104,0.0007840681,0.00019227671,0.00069005194,0.0005586111,0.0010000999,0.00236892,0.0015977581,0.0000607672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037938662,0.000017726865,0.000006423976,0.000061519175,0.000017441622,0.00011975466,0.0013257762,0.85895467,0.00011670028,0.028496785,0.0000041816706,0.1108752],"study_design_scores_gemma":[0.00024276195,0.000042211206,0.0000012930534,0.00096736243,0.00002466068,0.000102744365,3.1565253e-7,0.86051226,0.0002242259,0.1369847,0.000058784273,0.00083869346],"about_ca_topic_score_codex":0.000042683794,"about_ca_topic_score_gemma":0.00013379686,"teacher_disagreement_score":0.20976238,"about_ca_system_score_codex":0.0004805707,"about_ca_system_score_gemma":0.0010478953,"threshold_uncertainty_score":0.99990547},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008516404,0.00007474397,0.9860047,0.0008637057,0.0003002429,0.00052787963,0.000011852146,0.000040369287,0.0036600735],"genre_scores_gemma":[0.98834217,0.0000048824413,0.010131331,0.00007456708,0.00041004637,0.00005547792,0.00004000845,0.000015371506,0.0009261601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989358,0.0000044555313,0.00020115434,0.00046038523,0.00020153791,0.00019666183],"domain_scores_gemma":[0.999506,0.00013206007,0.000076152646,0.00015795269,0.00007686424,0.000050957304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028146166,0.00016001634,0.00014898744,0.00019722717,0.00019361082,0.00025423185,0.00021333886,0.00007036371,0.000014723383],"category_scores_gemma":[0.0000052540186,0.00014424973,0.00004968802,0.00017739802,0.00020196191,0.00030544307,0.000081753984,0.0002504258,0.000012849474],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099904255,0.000013483616,0.000055690678,0.000060065413,0.000006344375,6.209457e-7,0.0023304578,0.037736446,0.0044914284,0.13888495,0.000022266395,0.81638825],"study_design_scores_gemma":[0.00015139887,0.00017605347,0.000040367217,0.0001710945,0.000016839196,0.0000018902674,0.0000042438305,0.72221476,0.0025823754,0.26602206,0.008349702,0.0002692518],"about_ca_topic_score_codex":0.000010996227,"about_ca_topic_score_gemma":0.000013064589,"teacher_disagreement_score":0.97982574,"about_ca_system_score_codex":0.000050224273,"about_ca_system_score_gemma":0.00014367572,"threshold_uncertainty_score":0.58823335},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016256299,0.062217496,0.55966276,0.0038598177,0.071274295,0.003679514,0.000677766,0.00034440908,0.28202763],"genre_scores_gemma":[0.95220757,0.00024146248,0.005385759,0.0070965867,0.004017581,0.00007162233,0.000097105745,0.00012950195,0.030752795],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778295,0.000059584592,0.00039094465,0.00087509636,0.0006176643,0.00027377598],"domain_scores_gemma":[0.9985656,0.00018144351,0.00019129398,0.00089264347,0.000117557014,0.000051469066],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00050233764,0.0003579488,0.0003923914,0.00038503754,0.00010038224,0.00012847784,0.00084109657,0.00026611652,0.00096092006],"category_scores_gemma":[0.000057242298,0.00021469443,0.00024567405,0.0005465623,0.00031056217,0.000087234155,0.0002543075,0.0006422267,0.00022808113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007447115,0.00021420362,0.00010804545,0.00043888515,0.0003370929,0.00018568161,0.011641975,0.002654219,0.0050609275,0.116261184,0.0029911185,0.8600322],"study_design_scores_gemma":[0.0016201747,0.0010976575,0.0044158096,0.0038446588,0.0006826886,0.0002831234,0.000007313292,0.0541293,0.0067007504,0.8915433,0.033052843,0.0026223818],"about_ca_topic_score_codex":0.000044671637,"about_ca_topic_score_gemma":0.00017356574,"teacher_disagreement_score":0.9359513,"about_ca_system_score_codex":0.00008536549,"about_ca_system_score_gemma":0.00011328792,"threshold_uncertainty_score":0.9999523},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015710279,0.001775411,0.9873711,0.0008804227,0.0016316522,0.0006083615,0.000004454316,0.0006563182,0.0070565813],"genre_scores_gemma":[0.018376403,0.00040696637,0.9747101,0.0016496999,0.00052340154,0.000036548186,0.000007567293,0.00008452782,0.0042047887],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99495345,0.000030582516,0.00069023983,0.0022268475,0.0011973963,0.0009014608],"domain_scores_gemma":[0.9972049,0.0003795812,0.0002889304,0.0016082288,0.0003098739,0.00020850808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00107898,0.0007265237,0.00068860437,0.00095823314,0.00030187343,0.0010179939,0.0036478103,0.00033693635,0.00004747262],"category_scores_gemma":[0.00010213399,0.0006516199,0.00021143448,0.0009778262,0.0008598294,0.0012970252,0.0025505663,0.0012851394,0.00028769474],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068481313,0.000026719019,0.0000015651746,0.00010196563,0.000015754245,0.00031151372,0.0005131634,0.00032513984,0.0044836747,0.018522374,0.0000364603,0.97565484],"study_design_scores_gemma":[0.00020497714,0.0005619322,0.000005808482,0.0010300796,0.000017061913,0.000115900075,2.948329e-7,0.26939338,0.09719772,0.61211395,0.018158218,0.0012006954],"about_ca_topic_score_codex":0.000014366665,"about_ca_topic_score_gemma":0.000015596534,"teacher_disagreement_score":0.9744541,"about_ca_system_score_codex":0.00059749914,"about_ca_system_score_gemma":0.0004198082,"threshold_uncertainty_score":0.9995935},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011727995,0.0017047506,0.9733206,0.002303652,0.004183229,0.0040118992,0.00078974315,0.00054249266,0.0014156622],"genre_scores_gemma":[0.96024895,0.00013618464,0.024574721,0.0023033225,0.005345245,0.00031631728,0.0004777846,0.000017075508,0.006580399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979042,0.0000056844196,0.00027641343,0.0009865261,0.0003985096,0.00042871415],"domain_scores_gemma":[0.99929404,0.00018951722,0.000096231626,0.00013250834,0.000103100574,0.0001845944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002450814,0.0003640803,0.00027686392,0.000069308466,0.0002798311,0.00024530082,0.0006404981,0.00023818965,0.000023883886],"category_scores_gemma":[0.000033718727,0.00013609092,0.00018786472,0.00023988649,0.00020738723,0.00015003723,0.00016745135,0.000357946,0.000046606223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023542717,0.00017965377,0.000206026,0.0002546584,0.000037908892,0.00009251607,0.00053076056,0.02381221,0.0606428,0.0032262935,0.00040015814,0.9103816],"study_design_scores_gemma":[0.00015789426,0.0003826202,0.00075762847,0.00034126223,0.000039703707,0.000014669289,4.4545988e-7,0.9245228,0.0022160746,0.058557816,0.012240385,0.0007686744],"about_ca_topic_score_codex":0.000019225285,"about_ca_topic_score_gemma":0.00067956897,"teacher_disagreement_score":0.94874585,"about_ca_system_score_codex":0.000096648124,"about_ca_system_score_gemma":0.000057209625,"threshold_uncertainty_score":0.5549627},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008256061,0.00087467965,0.99482805,0.0010148652,0.0004287353,0.00054564234,0.000024409715,0.0006210507,0.0015800094],"genre_scores_gemma":[0.021556085,0.00020347707,0.9767082,0.0006170104,0.00015056685,0.00003504796,0.000017531365,0.00006427198,0.000647818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954928,0.000039597562,0.00052235904,0.0022495987,0.0010114968,0.00068413914],"domain_scores_gemma":[0.9972735,0.0002569191,0.00030168274,0.0017067252,0.00021643814,0.00024475317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056057406,0.00069785916,0.0006334131,0.00082395435,0.00032488882,0.00074277073,0.0025005664,0.00032909034,0.000016488306],"category_scores_gemma":[0.000029554327,0.0005482036,0.000080940714,0.00044676533,0.0012033964,0.0013768905,0.0029848625,0.001205469,0.00003299494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000699873,0.00006804753,0.0000129647615,0.0002941297,0.000033774257,0.000470526,0.0010731259,0.026714947,0.012688723,0.3811313,0.00037151584,0.57707095],"study_design_scores_gemma":[0.00021071076,0.00012594777,0.0000050812755,0.000729994,0.000006287141,0.00009878382,1.7409899e-7,0.58558166,0.0047032596,0.4066102,0.0014672364,0.00046069807],"about_ca_topic_score_codex":0.000009959268,"about_ca_topic_score_gemma":0.000013558614,"teacher_disagreement_score":0.57661027,"about_ca_system_score_codex":0.00029078676,"about_ca_system_score_gemma":0.00037389068,"threshold_uncertainty_score":0.99969697},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007220416,0.002281174,0.98884743,0.0006704764,0.0049538547,0.0010744705,0.000019926138,0.00020322805,0.001877228],"genre_scores_gemma":[0.13581422,0.0002979,0.86146116,0.00028830415,0.00087702426,0.00017721341,0.00002501547,0.00006472318,0.00099443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968747,0.00005940634,0.00058825704,0.0013017665,0.00066593353,0.0005099708],"domain_scores_gemma":[0.99698514,0.00096664566,0.00032323555,0.0012829407,0.0003299503,0.000112114074],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022556812,0.00039291373,0.0003863984,0.0003993246,0.00056861766,0.0015634322,0.0021841733,0.00016883147,8.3422344e-7],"category_scores_gemma":[0.00016843996,0.000304415,0.000093392744,0.00031704924,0.00095196033,0.0005039105,0.00058897893,0.0005564401,0.000021449127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007034065,0.000006304238,0.0000029017833,0.000090897,0.000008458736,0.000005434458,0.00018139584,0.0018667227,0.00011156136,0.7424939,0.000021933361,0.25520343],"study_design_scores_gemma":[0.00013890087,0.0002084393,0.000042102914,0.0003509801,0.000011761389,0.00011772234,7.0627215e-7,0.7321773,0.0007126367,0.23807423,0.027794192,0.00037103108],"about_ca_topic_score_codex":0.000018603985,"about_ca_topic_score_gemma":0.000011841431,"teacher_disagreement_score":0.73031056,"about_ca_system_score_codex":0.00025741046,"about_ca_system_score_gemma":0.00022538811,"threshold_uncertainty_score":0.9999408},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019778463,0.0007995458,0.98402476,0.0003118918,0.00419497,0.00076379033,0.00001713907,0.00020226731,0.009665878],"genre_scores_gemma":[0.79560524,0.000054553922,0.20052391,0.00057798275,0.0010510188,0.000046618065,0.000033529082,0.00006244619,0.0020446973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966939,0.000022941293,0.00065429194,0.0013109605,0.00073308975,0.00058480795],"domain_scores_gemma":[0.99779594,0.000505805,0.00035175905,0.0008632399,0.00034668404,0.00013659574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084478117,0.0004739805,0.00067028764,0.0007154809,0.00017320321,0.0004601264,0.0021607387,0.00033649997,0.000019673525],"category_scores_gemma":[0.000054185468,0.00041028793,0.00026874573,0.00052252517,0.0010109968,0.00033417562,0.0006211951,0.0004649767,0.000053151525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068648565,0.000027052502,0.0000145240165,0.00027817764,0.00003303594,0.000031900432,0.000497216,0.0018758248,0.00018439793,0.8834125,0.00008599686,0.11355254],"study_design_scores_gemma":[0.00040835442,0.0004929432,0.000010502507,0.00029332584,0.000027471448,0.00007881947,0.000001246708,0.16123378,0.0017557696,0.8179091,0.017133402,0.00065527996],"about_ca_topic_score_codex":0.000054901313,"about_ca_topic_score_gemma":0.00012959313,"teacher_disagreement_score":0.79558545,"about_ca_system_score_codex":0.00017506746,"about_ca_system_score_gemma":0.00050691684,"threshold_uncertainty_score":0.9998349},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033994307,0.0005298057,0.9631797,0.0009694903,0.004368105,0.00043211528,0.0000031877455,0.0010214879,0.029462123],"genre_scores_gemma":[0.031937316,0.00008434988,0.9641445,0.0009854691,0.0009276887,0.00002074089,0.0000044629414,0.00006927057,0.001826172],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99581325,0.000024328938,0.00059987773,0.001930819,0.0009488197,0.00068291195],"domain_scores_gemma":[0.99751765,0.00020328959,0.00024640205,0.0015967201,0.00030384836,0.00013207024],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00074478,0.0005990379,0.0004908875,0.0014578853,0.000180198,0.0013529821,0.003070508,0.0003363873,0.000044475073],"category_scores_gemma":[0.00008172783,0.00057088904,0.00015574228,0.00090841664,0.00091845857,0.0013846132,0.0019571176,0.0011140095,0.00028762931],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019619677,0.000016593764,0.0000024972676,0.000053175696,0.000009066717,0.00015469755,0.0002453795,0.00011315176,0.0025374687,0.03023616,0.000076132055,0.9665537],"study_design_scores_gemma":[0.0001897087,0.00038211505,0.000012925162,0.0016912268,0.000019173069,0.00059203105,1.7236097e-7,0.12842272,0.079819754,0.78097296,0.0065751444,0.0013220543],"about_ca_topic_score_codex":0.000011071868,"about_ca_topic_score_gemma":0.000028691282,"teacher_disagreement_score":0.96523166,"about_ca_system_score_codex":0.0006922226,"about_ca_system_score_gemma":0.00036290966,"threshold_uncertainty_score":0.99968374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003893941,0.0009306103,0.9916256,0.00012156561,0.0022070569,0.00017349143,0.0000093216995,0.00027160815,0.0042713555],"genre_scores_gemma":[0.4280141,0.00034934338,0.56666976,0.0003093231,0.0025265808,0.000024397616,0.000038304657,0.00018491439,0.0018832681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983572,0.000004040738,0.00038553216,0.0006345829,0.0002783398,0.0003403056],"domain_scores_gemma":[0.99934036,0.00011623641,0.000059660506,0.00034230316,0.00006843235,0.000073032235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003362094,0.0003251962,0.00036155578,0.000578615,0.0001396427,0.0002051933,0.00035606153,0.00023808876,0.000026842747],"category_scores_gemma":[0.000024526924,0.00029158892,0.00015457388,0.00025166746,0.000121848745,0.000113842485,0.00011060448,0.00046549272,0.00002871158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.194856e-7,0.0000016420428,0.000005817503,0.00014471675,0.00001581838,0.000006129809,0.00013543668,0.3643937,0.00027867046,0.0002447939,0.000015028668,0.6347574],"study_design_scores_gemma":[0.00007435738,0.000017344484,0.0000022513757,0.0009204839,0.000036560996,0.00004082381,1.9094027e-7,0.96615887,0.0003548287,0.031069139,0.0010002966,0.00032483842],"about_ca_topic_score_codex":0.000007208281,"about_ca_topic_score_gemma":0.000033938835,"teacher_disagreement_score":0.6344326,"about_ca_system_score_codex":0.0001926594,"about_ca_system_score_gemma":0.00005124644,"threshold_uncertainty_score":0.9999536},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033717158,0.00065289694,0.9903692,0.0018480769,0.00047081878,0.0006293731,0.000006731352,0.00019029122,0.002460907],"genre_scores_gemma":[0.34317,0.00001876827,0.655461,0.00080280023,0.00020069368,0.000044500594,0.0000037002837,0.000039664683,0.0002588737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959447,0.000057317455,0.0005334938,0.0020047647,0.00085099146,0.00060874916],"domain_scores_gemma":[0.9976466,0.0008082977,0.00016460424,0.0010101468,0.00017539601,0.00019497031],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014321741,0.0004782771,0.0004509625,0.0014423591,0.0002504042,0.0012551396,0.0019898047,0.00018644992,0.000010529454],"category_scores_gemma":[0.0002415096,0.0004566625,0.00006838868,0.0010852808,0.00033423054,0.0007216838,0.0022804085,0.0010662316,0.00009354665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021036894,0.00001577642,0.000048676226,0.000053032047,0.0000075455296,0.000049383445,0.0043340554,0.5341828,0.0017594568,0.033028074,0.000006963407,0.42651215],"study_design_scores_gemma":[0.000098394485,0.00006276883,0.00025709794,0.00061052287,0.00000520674,0.000025390773,4.4120753e-7,0.7826997,0.00037222783,0.2154562,0.00003466683,0.00037737723],"about_ca_topic_score_codex":0.00024315434,"about_ca_topic_score_gemma":0.00021384658,"teacher_disagreement_score":0.4261348,"about_ca_system_score_codex":0.00032471062,"about_ca_system_score_gemma":0.00033528687,"threshold_uncertainty_score":0.9997885},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012456268,0.0007831255,0.9881824,0.0053041335,0.0015706639,0.00033680335,0.000009431859,0.000038370665,0.0025294286],"genre_scores_gemma":[0.98312163,0.00009238609,0.0027922334,0.0019740954,0.0006804,0.000029575025,0.000019663696,0.000030765852,0.011259227],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988822,0.000020783682,0.00020765568,0.00050644926,0.00020845003,0.00017446504],"domain_scores_gemma":[0.9990884,0.00039748248,0.00006638033,0.00021749407,0.0001559262,0.00007429865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031931445,0.00014021098,0.00013109349,0.0002035266,0.00038997023,0.00043283714,0.00014103898,0.00013008426,0.00006252952],"category_scores_gemma":[0.00012321149,0.0001060151,0.000019995627,0.00022653965,0.00047210336,0.00008689825,0.0001427857,0.0002463654,0.00006929753],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036211648,0.000017993267,0.0006777854,0.00002263701,0.000043725646,0.000021916283,0.0040451456,0.001385274,0.00036710818,0.17747948,0.0006688925,0.8152338],"study_design_scores_gemma":[0.0012407056,0.00077955483,0.020500237,0.0005075895,0.000100057776,0.000277624,0.000021072883,0.38292688,0.0005996473,0.46778595,0.12411897,0.0011416978],"about_ca_topic_score_codex":0.000017388686,"about_ca_topic_score_gemma":0.00014286983,"teacher_disagreement_score":0.9853902,"about_ca_system_score_codex":0.00009035749,"about_ca_system_score_gemma":0.00006374208,"threshold_uncertainty_score":0.43231702},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029294637,0.00022261338,0.995518,0.0018001908,0.00068214623,0.00066292484,0.0004491657,0.00025705987,0.00037856068],"genre_scores_gemma":[0.07987303,0.000046686135,0.91343004,0.00096255104,0.0003815712,0.000027121536,0.002281106,0.000073263654,0.0029246553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608463,0.00002049137,0.00048684957,0.0018763982,0.0009916568,0.00053999387],"domain_scores_gemma":[0.9969459,0.00074422086,0.00028930642,0.0016180606,0.0002478183,0.0001546869],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080134516,0.0004814069,0.0003913302,0.00036004593,0.00024562108,0.0008164308,0.0029688356,0.00019761489,0.000015187703],"category_scores_gemma":[0.00014512564,0.00040566124,0.0000733098,0.0005337212,0.0003440316,0.0008070968,0.0011262088,0.00052163925,0.0000601815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017969536,0.000057260455,0.0000036981655,0.00007059169,0.000019625904,0.0000435147,0.00043748695,0.07903431,0.00014258426,0.0141253695,0.000054112767,0.90599346],"study_design_scores_gemma":[0.0003223299,0.0003999889,0.000055123524,0.00041855287,0.000026026762,0.000045536734,0.0000011994942,0.9686198,0.00006822568,0.0239145,0.0056320997,0.0004965839],"about_ca_topic_score_codex":0.000014918365,"about_ca_topic_score_gemma":0.0001478675,"teacher_disagreement_score":0.9054969,"about_ca_system_score_codex":0.00043832173,"about_ca_system_score_gemma":0.0006191276,"threshold_uncertainty_score":0.99983954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017447376,0.0015273712,0.9893746,0.000081399725,0.0006615187,0.00024471158,0.000011511851,0.00017118485,0.0061829626],"genre_scores_gemma":[0.9235688,0.00020973655,0.075245686,0.00005580617,0.00043236226,0.000011611782,0.0000012970054,0.00009909023,0.00037563997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788046,0.0000043075247,0.00027376754,0.0007261034,0.0006017177,0.0005136644],"domain_scores_gemma":[0.9987276,0.0005402149,0.00002215364,0.0004783638,0.0000780879,0.00015357896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041689983,0.00036683228,0.00037205723,0.0012928993,0.00007758433,0.00028976644,0.00056708895,0.00021675267,0.000021913444],"category_scores_gemma":[0.000105942934,0.00033729163,0.00005566591,0.0005471654,0.00027615417,0.00011452226,0.00044095362,0.0008730065,0.00008395162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015568296,0.0000032243595,0.0000031527002,0.00021882565,0.000015151351,0.000061497536,0.00012809479,0.91373307,0.00027496717,0.00017544451,0.000005818588,0.085379206],"study_design_scores_gemma":[0.000049440143,0.000020271951,0.0000035566345,0.00035917744,0.000016762673,0.000029031942,2.627597e-7,0.97457576,0.00034601332,0.024206825,0.00004932839,0.00034359377],"about_ca_topic_score_codex":0.000011502693,"about_ca_topic_score_gemma":0.000005349735,"teacher_disagreement_score":0.92182404,"about_ca_system_score_codex":0.0003139177,"about_ca_system_score_gemma":0.000092026625,"threshold_uncertainty_score":0.9999079},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015007662,0.0016794037,0.9940882,0.0003739476,0.000858468,0.00031188646,0.000014894329,0.00031361225,0.0023445808],"genre_scores_gemma":[0.1509193,0.0001573628,0.846068,0.0010722645,0.0003723683,0.000008063774,0.000012718473,0.00006172706,0.0013281665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969243,0.000018775228,0.0005362436,0.0011996764,0.0008532313,0.0004677891],"domain_scores_gemma":[0.9980494,0.000249324,0.0002454689,0.0011779073,0.00016637238,0.00011156995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006516813,0.00040883274,0.000462643,0.0008519285,0.0001048489,0.00032818806,0.0021854753,0.00025762655,0.000024233566],"category_scores_gemma":[0.00006945996,0.00035393192,0.00015281684,0.00076758285,0.00039659062,0.0010762288,0.001402599,0.00065500865,0.000016237082],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010106542,0.000048570928,0.000007040356,0.00018077531,0.000017665328,0.00028387978,0.0015948892,0.007772939,0.001953719,0.1178908,0.0001251878,0.87011445],"study_design_scores_gemma":[0.00016975414,0.00034990243,0.0000089939,0.00106116,0.0000115924795,0.00004799972,6.151975e-7,0.7401938,0.038624063,0.21711072,0.0017967464,0.00062468677],"about_ca_topic_score_codex":0.000011381293,"about_ca_topic_score_gemma":0.000023202174,"teacher_disagreement_score":0.8694897,"about_ca_system_score_codex":0.00015784675,"about_ca_system_score_gemma":0.00026362797,"threshold_uncertainty_score":0.9998913},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013433757,0.00045617588,0.98370576,0.0010629856,0.0041963593,0.00082679157,0.000014580393,0.0011125684,0.0086113345],"genre_scores_gemma":[0.016082963,0.00007896177,0.98075855,0.00095300714,0.0005906906,0.000073527546,0.000012255854,0.000111965885,0.0013381043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99498796,0.00003328913,0.0009617544,0.0023875816,0.0007279656,0.0009014409],"domain_scores_gemma":[0.9968664,0.00059372524,0.0004357941,0.0014571012,0.00042952225,0.00021747469],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012977459,0.00073111727,0.0006771638,0.0023517734,0.00075484667,0.0015719628,0.00277958,0.00049894914,0.000017036129],"category_scores_gemma":[0.000107927284,0.0007135638,0.00032691256,0.0017886853,0.0004769675,0.00070651714,0.0012746986,0.0010971401,0.00002391541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050929266,0.000027823378,0.000019663948,0.00018871437,0.00003759378,0.00004410172,0.0013376048,0.00019911508,0.00037291605,0.64493704,0.000056459812,0.35277387],"study_design_scores_gemma":[0.00015529241,0.00024396404,0.000005414413,0.00090439775,0.00002018827,0.00020706392,5.5372703e-7,0.46070144,0.002314575,0.52198064,0.01266465,0.00080179505],"about_ca_topic_score_codex":0.000040284376,"about_ca_topic_score_gemma":0.00024947376,"teacher_disagreement_score":0.46050233,"about_ca_system_score_codex":0.00043161854,"about_ca_system_score_gemma":0.0006583977,"threshold_uncertainty_score":0.99953157},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011390136,0.00048046288,0.9917456,0.002139417,0.0022458087,0.0006754964,0.000012365706,0.0005963988,0.0020930555],"genre_scores_gemma":[0.2198295,0.00011315881,0.77010417,0.0063202996,0.0015098649,0.00012349688,0.000050719904,0.00013121853,0.0018175624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968425,0.000019449868,0.0005431469,0.0014790203,0.0006156104,0.00050025474],"domain_scores_gemma":[0.9972482,0.0008898821,0.0001916211,0.001225976,0.00030506423,0.00013926419],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00055276527,0.00043108102,0.00041780534,0.0011901734,0.0003152252,0.0015152819,0.0028278385,0.00026692855,0.0000100370535],"category_scores_gemma":[0.00006799236,0.0004131799,0.0002504999,0.0007816736,0.00023356304,0.000578439,0.001239815,0.00058753067,0.00000913767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037522477,0.000021948234,0.00001996525,0.00010042199,0.000018069182,0.000034207274,0.00077185256,0.004019381,0.00006657187,0.7550119,0.00043333633,0.23949859],"study_design_scores_gemma":[0.00010256827,0.00012366193,0.000010213679,0.00022791854,0.000007838047,0.000016319853,9.2407234e-8,0.6460012,0.0012108617,0.347972,0.004000979,0.00032633994],"about_ca_topic_score_codex":0.00003507728,"about_ca_topic_score_gemma":0.0000742344,"teacher_disagreement_score":0.64198184,"about_ca_system_score_codex":0.00009172845,"about_ca_system_score_gemma":0.0002003399,"threshold_uncertainty_score":0.999832},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014806942,0.0005041948,0.99592054,0.00061515503,0.0011266895,0.00075221574,0.0000032739983,0.00045818777,0.000604926],"genre_scores_gemma":[0.013828132,0.00009125993,0.9811804,0.0005700569,0.0004057771,0.000043262422,0.000020020028,0.000052024836,0.0038090597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969285,0.000024740106,0.00045902573,0.0014912015,0.00062735,0.0004691526],"domain_scores_gemma":[0.9982483,0.0005224148,0.0002284991,0.00057726714,0.00033126556,0.00009228652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006902265,0.00040381585,0.00036216888,0.0007826546,0.00025361046,0.0007238327,0.0013426807,0.0002504244,0.000003728685],"category_scores_gemma":[0.00027505343,0.00036536247,0.00012898467,0.0005514039,0.0002949989,0.0012253652,0.0009924434,0.00071748835,0.000026881928],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008602878,0.000024838058,0.00000773078,0.00008204535,0.0000072696944,0.000018770086,0.00057119905,0.0025656947,0.00091740774,0.009179754,0.000021449321,0.9865952],"study_design_scores_gemma":[0.00025879918,0.00026640482,0.00001371563,0.00035022374,0.000011187007,0.00001973433,3.5948716e-7,0.8297354,0.01056724,0.15698461,0.0013928554,0.00039944868],"about_ca_topic_score_codex":0.0000067121005,"about_ca_topic_score_gemma":0.000016081862,"teacher_disagreement_score":0.9861958,"about_ca_system_score_codex":0.0002818329,"about_ca_system_score_gemma":0.00016796948,"threshold_uncertainty_score":0.99987984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000981609,0.00014094812,0.9723986,0.00095774344,0.00020502544,0.000351042,0.0000010384354,0.00022624801,0.025621189],"genre_scores_gemma":[0.799065,0.000051127685,0.19565137,0.0013841562,0.0003526808,0.00003137239,0.000024651441,0.000055312325,0.0033843429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970867,0.000012718244,0.00040608505,0.0010795487,0.0009386879,0.00047628328],"domain_scores_gemma":[0.9983032,0.00023762169,0.00023249829,0.0008610471,0.00016180018,0.00020383044],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006770167,0.00038603877,0.00031611687,0.0006024336,0.0003214324,0.0010442471,0.0014309045,0.00016688864,0.000013326072],"category_scores_gemma":[0.00008323872,0.00031336542,0.00005968703,0.0007014591,0.00055948476,0.0006059697,0.0005456451,0.0008519344,0.00012616652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001875066,0.000009239313,0.00003298417,0.00007303218,0.00001732226,0.000022998553,0.0016371845,0.37417647,0.00042019776,0.23591055,0.000018591049,0.38767958],"study_design_scores_gemma":[0.00011840009,0.00031736016,0.000035585555,0.00073199166,0.000010420869,0.000051994437,4.4942973e-7,0.8964617,0.001084257,0.09756455,0.0031948152,0.00042845105],"about_ca_topic_score_codex":0.000048547827,"about_ca_topic_score_gemma":0.000031986765,"teacher_disagreement_score":0.7989668,"about_ca_system_score_codex":0.00036419224,"about_ca_system_score_gemma":0.0005717581,"threshold_uncertainty_score":0.9999928},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015107168,0.00026402343,0.96112806,0.0023223422,0.0028138242,0.0017372067,0.00018412586,0.00017224168,0.016271016],"genre_scores_gemma":[0.9882778,0.000035082816,0.0055666124,0.0025744236,0.00027140777,0.000056495563,0.000009515773,0.000045809575,0.0031628439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710065,0.000017323868,0.00038694148,0.0014720911,0.000529801,0.0004932126],"domain_scores_gemma":[0.998872,0.00053069124,0.00012740398,0.00028330705,0.00011061981,0.000076020486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030256936,0.00042679216,0.00043300804,0.000567638,0.00016058344,0.00014058074,0.00057427195,0.00027531508,0.000015288717],"category_scores_gemma":[0.00026264435,0.0003479619,0.00012636266,0.0003590331,0.001201738,0.00020839168,0.0003016579,0.00066521554,0.000052846128],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006201106,0.0003474142,0.00019911585,0.0003024444,0.000025666879,0.00074920524,0.0061184983,0.035980735,0.07795036,0.04347316,0.0003413795,0.8338919],"study_design_scores_gemma":[0.000682801,0.00052483747,0.00011312686,0.00060375815,0.00004577092,0.00009949855,9.424569e-7,0.5978255,0.02799597,0.37088862,0.00048891455,0.00073021563],"about_ca_topic_score_codex":0.000013043503,"about_ca_topic_score_gemma":0.000114110815,"teacher_disagreement_score":0.97317064,"about_ca_system_score_codex":0.00008783169,"about_ca_system_score_gemma":0.00021329691,"threshold_uncertainty_score":0.99989724},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035390482,0.0010524591,0.99079865,0.00024573342,0.0012562111,0.00038388761,0.00000788696,0.00044714112,0.005454126],"genre_scores_gemma":[0.4036257,0.000062599705,0.5923217,0.0012453701,0.0005411406,0.000016499775,0.000011161305,0.00009170391,0.002084116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594593,0.000016869844,0.00046013246,0.0017786993,0.0010766155,0.00072175707],"domain_scores_gemma":[0.99781567,0.00015381127,0.00015979218,0.0015875318,0.00015879466,0.00012437892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000673087,0.0005300193,0.00044068918,0.00072435325,0.00018038147,0.0008580278,0.0023898017,0.0002708585,0.000018264333],"category_scores_gemma":[0.000026189093,0.0004425862,0.000100451485,0.000654781,0.000190248,0.0010639725,0.0014948926,0.00077064295,0.00005437198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054142397,0.000034347784,0.0000192502,0.00012367316,0.00002183732,0.0003858008,0.0055346997,0.3036401,0.000058780217,0.29144529,0.000010556119,0.39872026],"study_design_scores_gemma":[0.00016407506,0.00005863296,0.000007363595,0.0007220589,0.000008310201,0.00006856527,5.736558e-7,0.86714315,0.00040282295,0.13021174,0.0006914896,0.0005211951],"about_ca_topic_score_codex":0.000015868973,"about_ca_topic_score_gemma":0.000089575144,"teacher_disagreement_score":0.5635031,"about_ca_system_score_codex":0.0002734548,"about_ca_system_score_gemma":0.00040280525,"threshold_uncertainty_score":0.9998026},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015714083,0.0013850974,0.9911729,0.0021143283,0.0033344722,0.0005127013,0.000018169752,0.00027112087,0.0011896385],"genre_scores_gemma":[0.09596326,0.00012216103,0.8992295,0.0027728055,0.0009735712,0.000046534886,0.00006590294,0.00006824607,0.000757981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971754,0.000011968268,0.00053673337,0.0010722791,0.0006136058,0.00059003435],"domain_scores_gemma":[0.9983497,0.0004161296,0.00014913554,0.00064943446,0.00028702893,0.00014855899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004101088,0.0004082295,0.0003453812,0.0007128451,0.00041580683,0.0006844056,0.001761369,0.00017889983,0.000012827421],"category_scores_gemma":[0.000043298027,0.00037499747,0.00019456443,0.0007171063,0.00046530354,0.0011933022,0.0003816922,0.0006063488,0.000021586095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033068866,0.000011112758,0.000004485252,0.00003381052,0.000007547201,0.000008772054,0.00025440345,0.28998807,0.0000115676185,0.24408719,0.000105546045,0.46548417],"study_design_scores_gemma":[0.00017173785,0.00007921943,0.000011097462,0.00016598901,0.0000070883184,0.0000413652,1.5438987e-7,0.8081721,0.000028543956,0.18309551,0.00787819,0.00034901607],"about_ca_topic_score_codex":0.0000026707037,"about_ca_topic_score_gemma":0.000015109769,"teacher_disagreement_score":0.518184,"about_ca_system_score_codex":0.00016865341,"about_ca_system_score_gemma":0.00027078783,"threshold_uncertainty_score":0.9998702},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029307284,0.00020365525,0.9929636,0.00028987217,0.0014116729,0.00031373982,0.000041851315,0.000307118,0.004175395],"genre_scores_gemma":[0.90910214,0.000050340874,0.082871094,0.0005389805,0.0028026812,0.000037756075,0.00012084272,0.00019713196,0.0042790542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987568,0.0000040124055,0.00025934444,0.0004317788,0.00029472692,0.0002532842],"domain_scores_gemma":[0.999495,0.000059796475,0.00001487346,0.0003173132,0.000055233893,0.000057776662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024485966,0.00024983034,0.00020324794,0.00040598016,0.000081301376,0.00018387417,0.000442927,0.0002077643,0.00006123334],"category_scores_gemma":[0.0000138231735,0.00024039346,0.000087803695,0.0001291231,0.00013329338,0.00016087637,0.00004921599,0.0003677003,0.00004979477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014408354,0.000025564197,0.000013253095,0.0010457247,0.000046178015,0.000042073552,0.0028787348,0.4511413,0.0024583628,0.06736186,0.0016228658,0.4733497],"study_design_scores_gemma":[0.00038078259,0.00011933872,0.000059569942,0.0005599938,0.000023900337,0.000016686005,3.347758e-7,0.74934083,0.0022838423,0.23517586,0.011453686,0.0005851583],"about_ca_topic_score_codex":0.0000029774171,"about_ca_topic_score_gemma":0.00013901427,"teacher_disagreement_score":0.91009253,"about_ca_system_score_codex":0.00015352096,"about_ca_system_score_gemma":0.000043275377,"threshold_uncertainty_score":0.9802961},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019242872,0.0008597946,0.99454755,0.00003118891,0.0005733176,0.00028462245,0.000008605255,0.00049398676,0.0012766588],"genre_scores_gemma":[0.94330555,0.000034015186,0.056248106,0.00004741902,0.00012698473,0.000015978032,0.0000015696706,0.000046364148,0.00017401809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887145,0.0000021352128,0.00021426384,0.00049022224,0.00011724785,0.0003046935],"domain_scores_gemma":[0.99953645,0.00013576899,0.000032905795,0.00022030098,0.00003259571,0.000041966294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026093578,0.00026335136,0.00024438277,0.000425852,0.00012307154,0.00005717021,0.0002562737,0.0004062578,0.0000015171545],"category_scores_gemma":[0.000020404064,0.00025883294,0.000058706864,0.0001437328,0.00026888095,0.000093751056,0.00009727758,0.00063470117,0.0000023422383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000407824,0.0000013110403,0.0000014004261,0.000110140034,0.000010638174,0.000007219064,0.00025659613,0.5024057,0.00053711154,0.0010813919,7.648838e-7,0.49558365],"study_design_scores_gemma":[0.00008773881,0.000046987396,0.000008220452,0.00012600241,0.000013993103,0.000040089355,1.6686572e-7,0.8967207,0.0019768483,0.10066149,0.000077125085,0.00024064856],"about_ca_topic_score_codex":0.000002648195,"about_ca_topic_score_gemma":0.00018970213,"teacher_disagreement_score":0.9413813,"about_ca_system_score_codex":0.00017673531,"about_ca_system_score_gemma":0.000070451744,"threshold_uncertainty_score":0.9999864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000078162666,0.0005064058,0.9929868,0.0022386448,0.0021748913,0.001265287,0.000014696665,0.0002841718,0.00045091836],"genre_scores_gemma":[0.06884921,0.000054309352,0.9282077,0.0009240817,0.0006904813,0.00018098389,0.000036949186,0.000055406865,0.0010008668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644166,0.000013306778,0.0005327371,0.0016688065,0.00074882695,0.0005946782],"domain_scores_gemma":[0.9979117,0.0003725871,0.00024983744,0.0011465879,0.000194553,0.00012472665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048066635,0.0004427799,0.00034966398,0.00060268637,0.0003049953,0.00036828523,0.0016986537,0.00017426393,0.000007939734],"category_scores_gemma":[0.000027658227,0.00041160916,0.00012420339,0.0007158747,0.0003003423,0.00023898114,0.00087733864,0.0004268044,0.000093292154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043044865,0.00002334428,8.465949e-7,0.000055937868,0.000007805826,0.000010813501,0.00014438995,0.5595074,0.00052990095,0.17734791,0.000067724686,0.26229957],"study_design_scores_gemma":[0.00017234596,0.00010820267,0.000010389664,0.0002210224,0.000014699142,0.000016514161,8.246363e-8,0.7596406,0.0016476687,0.2359782,0.0018385053,0.00035177774],"about_ca_topic_score_codex":0.000009641188,"about_ca_topic_score_gemma":0.000043223652,"teacher_disagreement_score":0.26194778,"about_ca_system_score_codex":0.00056072057,"about_ca_system_score_gemma":0.00020187658,"threshold_uncertainty_score":0.9998336},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012569044,0.00017315897,0.9896667,0.0011465736,0.0032103476,0.00030794257,0.000007663213,0.00025622832,0.003974508],"genre_scores_gemma":[0.64790916,0.000116327545,0.34413442,0.004164614,0.0015282434,0.00003304743,0.00004322496,0.000109974004,0.0019609695],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972982,0.00003651918,0.00029635776,0.0013771422,0.00062103214,0.00037074223],"domain_scores_gemma":[0.99882144,0.00015273197,0.00016774048,0.00061739614,0.00010287034,0.0001378095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005158848,0.0004269376,0.00031775644,0.0014223476,0.00031655826,0.00073581707,0.0006238944,0.00034410192,0.000019065677],"category_scores_gemma":[0.000014213861,0.00038821556,0.00013277211,0.00045355636,0.0003370439,0.000552991,0.00018458681,0.0010151078,0.000037025533],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010039724,0.00002291467,0.00001199536,0.00009226621,0.0000121205,0.00007201536,0.0004918767,0.0078036524,0.00027384533,0.022168651,0.0000278229,0.9690128],"study_design_scores_gemma":[0.0003368302,0.00024363893,0.00027853486,0.0014781135,0.000022878763,0.00026123706,7.349137e-7,0.39311987,0.0014883889,0.60138464,0.00066453335,0.0007206004],"about_ca_topic_score_codex":0.00000786947,"about_ca_topic_score_gemma":0.000050614577,"teacher_disagreement_score":0.9682922,"about_ca_system_score_codex":0.00023109632,"about_ca_system_score_gemma":0.00013305256,"threshold_uncertainty_score":0.99985695},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049415157,0.0007228166,0.9930879,0.0010479237,0.0015984762,0.0003958927,0.000007931211,0.00021011221,0.002879517],"genre_scores_gemma":[0.16984284,0.00004813461,0.825517,0.002654482,0.00044181314,0.000027197202,0.000030440395,0.00005301208,0.0013851098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973518,0.000024608524,0.00037385948,0.0012651148,0.0005337257,0.000450893],"domain_scores_gemma":[0.99891776,0.00018415741,0.00013583215,0.00040606273,0.00020198854,0.00015417337],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006279044,0.00037816545,0.00033717195,0.00032276846,0.0003261723,0.001291586,0.0009162746,0.00026024538,0.000007868024],"category_scores_gemma":[0.0000369258,0.00035055226,0.000078735364,0.00057109696,0.00047933022,0.00041056637,0.0005861006,0.000324059,0.00002092453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007889007,0.000008216723,0.000012621794,0.00006717569,0.000012308913,0.000039810653,0.0004916586,0.05176423,0.000057354795,0.43492708,0.00003680451,0.51257485],"study_design_scores_gemma":[0.00020361724,0.00006837213,0.00002503634,0.00013816927,0.000004855167,0.00005153191,4.0406056e-7,0.66136515,0.00007950208,0.33256513,0.005194683,0.00030358226],"about_ca_topic_score_codex":0.0000111772515,"about_ca_topic_score_gemma":0.00007387083,"teacher_disagreement_score":0.6096009,"about_ca_system_score_codex":0.00028542362,"about_ca_system_score_gemma":0.00034205295,"threshold_uncertainty_score":0.9998946},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013650052,0.00053051225,0.9905653,0.0016632682,0.0030939193,0.00053636864,0.000016816191,0.0004583854,0.0029989178],"genre_scores_gemma":[0.040527202,0.00013826818,0.9315458,0.0032690652,0.00326089,0.000086595865,0.00007628722,0.00021245317,0.020883461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559927,0.00004417507,0.0004905489,0.002094894,0.00091983366,0.0008513049],"domain_scores_gemma":[0.99763244,0.0006510809,0.0002792367,0.0009829792,0.0002480877,0.00020619844],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00083804183,0.00069484126,0.0006789164,0.00083271164,0.0004539419,0.0010551247,0.0027624152,0.0003702643,0.000028475308],"category_scores_gemma":[0.00016581923,0.0006158032,0.00029643194,0.00062062446,0.00044964175,0.00049804064,0.0013702656,0.0018088004,0.000067518115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010320889,0.000016484655,0.0000074748973,0.00010344452,0.000026314448,0.00009592665,0.0010532463,0.4786248,0.00006167609,0.02485583,0.000058779475,0.49508572],"study_design_scores_gemma":[0.00038818887,0.000196239,0.000018121658,0.00043452808,0.000014609924,0.000056019533,2.4797683e-7,0.8969299,0.00048544994,0.09019065,0.010579021,0.000706983],"about_ca_topic_score_codex":0.00003463587,"about_ca_topic_score_gemma":0.000015855287,"teacher_disagreement_score":0.49437872,"about_ca_system_score_codex":0.00031412242,"about_ca_system_score_gemma":0.00047247147,"threshold_uncertainty_score":0.9999819},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003531537,0.0005093053,0.9881276,0.0064154295,0.0014587811,0.0010608233,0.00004765757,0.0016814863,0.0006636048],"genre_scores_gemma":[0.019170037,0.000018208573,0.97848594,0.0011797168,0.00019312101,0.00008030365,0.000049146136,0.00009808656,0.000725425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940134,0.00007996707,0.00077621854,0.0029826844,0.0010912726,0.0010564572],"domain_scores_gemma":[0.9918717,0.0014105205,0.00045715028,0.0057140896,0.00038514577,0.0001613857],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0021102712,0.0008459242,0.0007440158,0.0014244003,0.00059917587,0.0019974853,0.023102697,0.00064013805,0.000008194037],"category_scores_gemma":[0.003990256,0.0008113279,0.00026130487,0.0009937262,0.00049009104,0.0007586856,0.03640659,0.0016796456,0.000034951394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013526075,0.0000162836,0.000002210966,0.00012322649,0.000021541975,0.00005885518,0.00007913352,0.6844752,0.000302809,0.0052446346,0.00019149303,0.3094711],"study_design_scores_gemma":[0.00031056048,0.00015237517,1.8902819e-7,0.00038494234,0.00001341726,0.00003360075,8.635518e-8,0.63041806,0.0052060555,0.36214957,0.0007908675,0.00054031267],"about_ca_topic_score_codex":0.00003051385,"about_ca_topic_score_gemma":0.00010178819,"teacher_disagreement_score":0.35690492,"about_ca_system_score_codex":0.00073563016,"about_ca_system_score_gemma":0.0008602021,"threshold_uncertainty_score":0.99943376},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006575151,0.010042878,0.9782441,0.000058438483,0.0071806936,0.00047568203,0.000036447676,0.0009504796,0.002353711],"genre_scores_gemma":[0.91877043,0.000119501805,0.078864865,0.000021154927,0.0015039059,0.000026062882,0.000008046377,0.00021281913,0.00047319906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765915,0.000003955604,0.00062853046,0.0007359696,0.00049421715,0.00047818682],"domain_scores_gemma":[0.99847776,0.0004483282,0.00008025058,0.00079813175,0.00010712998,0.00008837744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034277735,0.0005781718,0.0006502674,0.0008094808,0.000030195877,0.00009381515,0.00081046834,0.00022951857,0.000012396854],"category_scores_gemma":[0.00012538204,0.0005747632,0.00012360365,0.00047179632,0.00018351247,0.00017309602,0.0001855228,0.0007255956,0.00004005594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014263351,0.0000034788634,0.000012842798,0.0010758893,0.00003570501,0.00012038995,0.00018657085,0.9747336,0.0011750667,0.0008192331,0.000022309663,0.021813476],"study_design_scores_gemma":[0.000119204764,0.000055275104,0.000071689654,0.003238649,0.000026823227,0.0003930482,1.3527082e-7,0.9703499,0.013550779,0.0013658389,0.009950419,0.0008782555],"about_ca_topic_score_codex":0.000013904399,"about_ca_topic_score_gemma":0.000020137146,"teacher_disagreement_score":0.91811293,"about_ca_system_score_codex":0.00031117658,"about_ca_system_score_gemma":0.00014172359,"threshold_uncertainty_score":0.9996704},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009297924,0.00033091946,0.9955106,0.0003257028,0.00083468936,0.00056493765,0.00001796609,0.00013321707,0.0013521772],"genre_scores_gemma":[0.3872702,0.000013611556,0.61182946,0.00037762162,0.00014594482,0.000029602319,0.000004661319,0.00003641998,0.00029249105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628717,0.00007813453,0.00065353786,0.0014249511,0.001070754,0.00048548056],"domain_scores_gemma":[0.9957572,0.00078232674,0.00043317623,0.002521372,0.00038818203,0.00011773404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019888182,0.0004741455,0.00067283155,0.0015220209,0.00023576012,0.00044431348,0.003143488,0.0002205241,0.000012513953],"category_scores_gemma":[0.00017364793,0.00029518316,0.00020758626,0.0038069603,0.0013613249,0.00038017172,0.0009811709,0.0008167895,0.000012938154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001881309,0.00004314767,0.00005129374,0.00018395374,0.0003375378,0.0007994513,0.0046028974,0.35680482,0.000052090305,0.35446504,0.000008312385,0.28263265],"study_design_scores_gemma":[0.00008972174,0.0002131796,0.00013030948,0.0001805483,0.00027128542,0.0005586115,9.884301e-7,0.9390269,0.00028437292,0.058309194,0.000515309,0.0004195631],"about_ca_topic_score_codex":0.00011706457,"about_ca_topic_score_gemma":0.0009433208,"teacher_disagreement_score":0.5822221,"about_ca_system_score_codex":0.00029267734,"about_ca_system_score_gemma":0.00053187006,"threshold_uncertainty_score":0.99995005},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000043735276,0.00066966075,0.97629046,0.0031871938,0.003611662,0.00053924,0.000009513316,0.0007997459,0.014888124],"genre_scores_gemma":[0.27690038,0.00013824893,0.7081465,0.01132128,0.001290863,0.00010844567,0.000018363833,0.00021232411,0.0018635944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952316,0.000048052614,0.00068799965,0.0021816506,0.0010602868,0.00079038047],"domain_scores_gemma":[0.9966306,0.0004678473,0.00023198633,0.0022861203,0.00015195397,0.00023147766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010628516,0.00079608057,0.0006984037,0.0018731375,0.0002034374,0.00094611634,0.0034513536,0.00045253255,0.00003610331],"category_scores_gemma":[0.000028478302,0.00067409105,0.0003239319,0.0008437454,0.0002629396,0.0003141628,0.0010036683,0.0012070232,0.00009927501],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009505311,0.00008021151,0.000011632938,0.00017594734,0.000040186358,0.00064751785,0.00035159657,0.033450995,0.00003790683,0.04765115,0.0009306651,0.9166127],"study_design_scores_gemma":[0.00019453335,0.0005030987,0.000004118675,0.00112494,0.000009794475,0.00015456283,5.175683e-8,0.69037855,0.001897987,0.28042924,0.024387788,0.0009153131],"about_ca_topic_score_codex":0.000028009998,"about_ca_topic_score_gemma":0.0000423856,"teacher_disagreement_score":0.9156974,"about_ca_system_score_codex":0.00040574424,"about_ca_system_score_gemma":0.00031096608,"threshold_uncertainty_score":0.999571},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022291207,0.0002193158,0.99035263,0.0003843124,0.0040480304,0.00070437824,0.0000042228244,0.00020246198,0.0038617614],"genre_scores_gemma":[0.8996487,0.0000036300942,0.09936343,0.00031721708,0.0005426295,0.000015095234,0.000013638003,0.00004795029,0.00004770902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576247,0.00021165123,0.0007978104,0.0011830914,0.0014452765,0.00059967634],"domain_scores_gemma":[0.99436677,0.0031986479,0.0005857661,0.001400043,0.0003420699,0.000106685766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036224278,0.00060444034,0.00064640975,0.0007626615,0.00037851033,0.0005075383,0.0036257892,0.00038464207,0.000013872707],"category_scores_gemma":[0.0004396786,0.00046551917,0.00026155484,0.0010735402,0.001018753,0.0008014651,0.00081707566,0.0014935558,0.0000409522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041417323,0.000012536562,0.000041063253,0.0003354735,0.000024710665,0.000030481577,0.00088761986,0.88142556,0.0007067262,0.015513004,0.0000037989653,0.10097762],"study_design_scores_gemma":[0.00043031233,0.00015028681,0.00011912582,0.0013721937,0.00002523972,0.000022890174,6.102848e-7,0.8955398,0.007856365,0.0938947,0.00012443792,0.00046403683],"about_ca_topic_score_codex":0.00006789263,"about_ca_topic_score_gemma":0.000018785979,"teacher_disagreement_score":0.8994258,"about_ca_system_score_codex":0.0004454952,"about_ca_system_score_gemma":0.0007429789,"threshold_uncertainty_score":0.99977964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020324544,0.0019868107,0.98678446,0.00015385094,0.006983333,0.0007299438,0.000010214487,0.00026178462,0.001057127],"genre_scores_gemma":[0.8848871,0.000044528017,0.11311426,0.00014140205,0.0006299402,0.000047810325,0.000026874251,0.000057994752,0.0010500788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544007,0.000039118408,0.0011584905,0.0017305287,0.0011737583,0.0004580477],"domain_scores_gemma":[0.9961774,0.0001855452,0.00066677347,0.0019677777,0.0008940191,0.000108494954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017638754,0.0005066877,0.00070640625,0.00093915017,0.00018368223,0.0009930911,0.0031930385,0.00038668985,0.0000021817123],"category_scores_gemma":[0.000059479346,0.00040131877,0.0001330909,0.0019271324,0.0006217535,0.0012780302,0.0010914663,0.00059284124,0.000052243056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006700286,0.00052149175,0.0014729371,0.019429667,0.00025155043,0.0001553601,0.02208551,0.5125481,0.0060620727,0.2236562,0.00012841458,0.21362169],"study_design_scores_gemma":[0.00028170113,0.00009721292,0.0005925306,0.0025100184,0.000033354063,0.00018566496,0.000004063824,0.9700019,0.0028767195,0.021554872,0.0009861938,0.0008757814],"about_ca_topic_score_codex":0.0001898491,"about_ca_topic_score_gemma":0.000024488003,"teacher_disagreement_score":0.88285464,"about_ca_system_score_codex":0.00027156758,"about_ca_system_score_gemma":0.00067623146,"threshold_uncertainty_score":0.9998439},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000092083406,0.000277039,0.9812129,0.012578658,0.0013372538,0.0013138184,0.000031464984,0.0015000608,0.001656697],"genre_scores_gemma":[0.019366138,0.000012866219,0.9789781,0.0010136346,0.00022760067,0.000066716275,0.000011217102,0.000101590216,0.00022216285],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920182,0.0001891769,0.0008219154,0.0038455147,0.0016878124,0.0014373709],"domain_scores_gemma":[0.9824871,0.0039793104,0.0004319141,0.012387276,0.00041456177,0.00029988532],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0062746587,0.0010101888,0.00092216086,0.0020760028,0.000491329,0.0021089672,0.05398222,0.0005483772,0.000017510212],"category_scores_gemma":[0.01981094,0.0008133619,0.00012376012,0.0031195064,0.0005247715,0.001282351,0.13334608,0.003046425,0.00015499452],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029502795,0.000031200878,0.000114237264,0.0001283099,0.00005944859,0.0006368216,0.0010825015,0.00503926,0.00019712174,0.014924408,0.0010789098,0.97667825],"study_design_scores_gemma":[0.00019340863,0.00037489095,0.00011060671,0.0021179854,0.000013178204,0.00025649942,4.873106e-7,0.36935985,0.0046936083,0.616806,0.0048481845,0.0012253243],"about_ca_topic_score_codex":0.00013448436,"about_ca_topic_score_gemma":0.000202635,"teacher_disagreement_score":0.97545296,"about_ca_system_score_codex":0.0007549344,"about_ca_system_score_gemma":0.0009552495,"threshold_uncertainty_score":0.9994317},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005918241,0.00028290902,0.98972315,0.0003904988,0.0014043897,0.0071129207,0.000020936306,0.00041944644,0.000053952688],"genre_scores_gemma":[0.390076,0.0000054630505,0.6077289,0.0006461875,0.00029892861,0.0010158909,0.0000044245944,0.000081239035,0.00014298799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940573,0.000050559334,0.0008864499,0.0031854862,0.00085236016,0.00096784823],"domain_scores_gemma":[0.9961251,0.0008681979,0.0002658939,0.0020720551,0.0003408708,0.00032786356],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007668026,0.00086186006,0.0009314339,0.0012443557,0.00035388288,0.0010501812,0.0027597763,0.00028477274,0.0000011457151],"category_scores_gemma":[0.000013008798,0.00073119515,0.00013189141,0.0014192632,0.00020516032,0.0009360855,0.0021134757,0.0009350052,0.000022424421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020882164,0.00012240045,0.0000025068218,0.000052894862,0.000014731433,0.0015130148,0.0016087428,0.9214697,0.000017887154,0.009612715,0.000014155647,0.06555041],"study_design_scores_gemma":[0.00070194853,0.0016613334,0.0000014437218,0.0005671474,0.00001735485,0.0014627437,0.0000031069992,0.94352335,0.00003226691,0.051052526,0.0001668884,0.0008098913],"about_ca_topic_score_codex":0.00018476216,"about_ca_topic_score_gemma":0.00090559054,"teacher_disagreement_score":0.38948417,"about_ca_system_score_codex":0.00068624347,"about_ca_system_score_gemma":0.00039449576,"threshold_uncertainty_score":0.9999868},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000117376396,0.0012944888,0.9918224,0.0010944449,0.003874771,0.000978558,0.000013306011,0.0002697299,0.00053490495],"genre_scores_gemma":[0.86073315,0.000011669433,0.1370863,0.0009927533,0.0006744792,0.000073436604,0.000008832375,0.000040475086,0.00037889028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577904,0.000027379656,0.00082262594,0.0017830799,0.0008241142,0.0007637648],"domain_scores_gemma":[0.9978621,0.0004213533,0.00021602445,0.0010242428,0.0003493452,0.0001269289],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015762866,0.0004684125,0.0006313847,0.0010768769,0.00016696866,0.000979368,0.002389216,0.00034690095,0.0000021892706],"category_scores_gemma":[0.00011594122,0.00043326674,0.00018413723,0.00052099314,0.00022056187,0.0006195025,0.0011041993,0.000813324,0.00003813666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013478209,0.000022450733,0.000038992843,0.0004567143,0.000022380866,0.00022356682,0.0011072317,0.041992214,0.0005742028,0.7263701,0.000018213652,0.22916046],"study_design_scores_gemma":[0.00041569013,0.0000922892,0.000015960322,0.0021709949,0.000010564185,0.000076699354,0.00000135831,0.8844142,0.0009683296,0.11093137,0.00045148292,0.00045105774],"about_ca_topic_score_codex":0.00006567624,"about_ca_topic_score_gemma":0.0002094461,"teacher_disagreement_score":0.8606158,"about_ca_system_score_codex":0.0010966784,"about_ca_system_score_gemma":0.00044334467,"threshold_uncertainty_score":0.9998119},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016438546,0.00032581534,0.9942304,0.00011549621,0.002573111,0.00066442526,0.00013372116,0.0006533833,0.0012872177],"genre_scores_gemma":[0.007828133,0.000020631474,0.9875919,0.0006433484,0.0032360281,0.00006255532,0.00026645453,0.000111672816,0.00023924312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980549,0.000009649016,0.00032889293,0.00077185006,0.00040072593,0.00043393634],"domain_scores_gemma":[0.9989244,0.00027262283,0.00006885817,0.00043944243,0.00018547243,0.00010922731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027909962,0.0004366724,0.00035289535,0.00035812805,0.00017621275,0.00019086532,0.0005861562,0.00027844444,0.0000968269],"category_scores_gemma":[0.000034197456,0.00042245892,0.000117464755,0.00022235213,0.00043168096,0.00032300258,0.00017545489,0.0005858736,0.000020537702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021209195,0.000011354694,7.380126e-7,0.00010416098,0.000012602371,0.00005784384,0.000113207934,0.8883595,0.007880323,0.005985684,0.0013577917,0.096095614],"study_design_scores_gemma":[0.00018465125,0.00013453794,0.000002121909,0.00023344182,0.000011513489,0.000008883924,7.068826e-8,0.7205898,0.018986413,0.25367418,0.0057585123,0.00041584318],"about_ca_topic_score_codex":0.0000017758473,"about_ca_topic_score_gemma":0.000024720004,"teacher_disagreement_score":0.2476885,"about_ca_system_score_codex":0.0003057326,"about_ca_system_score_gemma":0.00018249496,"threshold_uncertainty_score":0.99982274},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015529356,0.0012947026,0.9900787,0.00042906,0.0015595984,0.0004268393,0.0000011185439,0.00046783988,0.005586875],"genre_scores_gemma":[0.2670958,0.000041551077,0.72785366,0.0013971475,0.00092972966,0.000024571667,0.00000819281,0.00008936149,0.0025599827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587184,0.000040961982,0.0005673308,0.0018689879,0.0009393611,0.0007115216],"domain_scores_gemma":[0.9980904,0.00022252725,0.00037962603,0.00092665537,0.00023636733,0.00014443201],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010910963,0.0005862561,0.0004929034,0.0010978121,0.00055765756,0.001261249,0.0020483644,0.00044078715,0.000018935401],"category_scores_gemma":[0.00007879367,0.0005426844,0.00014637905,0.0010617244,0.00037533804,0.0007424115,0.001269295,0.0016613181,0.00003812362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049199366,0.000023318222,0.000014649724,0.00035550765,0.000024673243,0.00018981502,0.0022471016,0.028444802,0.1362218,0.0230005,0.000046589677,0.8094263],"study_design_scores_gemma":[0.00015601644,0.00011363193,0.000047194615,0.003492108,0.00003121317,0.00038550232,0.0000018729445,0.79303306,0.07695422,0.12231171,0.0022686513,0.0012048248],"about_ca_topic_score_codex":0.000022429145,"about_ca_topic_score_gemma":0.000043307675,"teacher_disagreement_score":0.8082215,"about_ca_system_score_codex":0.0005500796,"about_ca_system_score_gemma":0.00072076154,"threshold_uncertainty_score":0.9997755},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017619418,0.00034530586,0.9497612,0.0022104715,0.00042394575,0.00026922338,0.00003682628,0.00007206312,0.029261533],"genre_scores_gemma":[0.9621485,0.000020997777,0.036808226,0.00021077153,0.00013510544,8.266489e-7,0.000007801508,0.000016722948,0.000651074],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976256,0.00004445504,0.00042155996,0.0008679455,0.0007792124,0.00026126325],"domain_scores_gemma":[0.9980147,0.00064663874,0.00020921105,0.0010527339,0.000019912206,0.00005680577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009836837,0.00024292951,0.00037614472,0.0001853641,0.00017276427,0.00015376764,0.0010243257,0.00014225034,0.00023652449],"category_scores_gemma":[0.00005788945,0.00016727054,0.00022610853,0.00079341605,0.001598942,0.000066639455,0.00050425995,0.00058096455,0.0001019448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016239477,0.00006927072,0.002964142,0.000050525323,0.00033372734,0.000038857695,0.010420972,0.3626765,0.0129649285,0.008190011,0.00009283385,0.602182],"study_design_scores_gemma":[0.00006034395,0.0000328711,0.014428058,0.00017090667,0.00024923997,0.000006050974,0.000001510921,0.16423185,0.0063051977,0.8132991,0.00075650297,0.00045836656],"about_ca_topic_score_codex":0.001518786,"about_ca_topic_score_gemma":0.0011166978,"teacher_disagreement_score":0.94452906,"about_ca_system_score_codex":0.0001925985,"about_ca_system_score_gemma":0.000042035295,"threshold_uncertainty_score":0.6821095},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045223263,0.00028276068,0.9868124,0.002409713,0.0008879454,0.00020869417,0.000023841747,0.00031889754,0.009010502],"genre_scores_gemma":[0.004844094,0.000036078,0.988431,0.0007584773,0.00044902047,0.000024244046,0.000022574668,0.00004290805,0.005391608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967129,0.000011492883,0.00034751606,0.0014156718,0.000981996,0.00053039903],"domain_scores_gemma":[0.99799985,0.00040068448,0.00024920693,0.001046069,0.00017852391,0.000125698],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007355409,0.00038952494,0.0003504151,0.0005615645,0.00024987874,0.0012437331,0.002370944,0.00023337442,0.000013390354],"category_scores_gemma":[0.000046241395,0.00032385217,0.000072772,0.00064839417,0.00025320327,0.00062747754,0.00087325677,0.0006306878,0.00015933898],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000157368,0.000022901706,0.00009552254,0.00004361393,0.00004359348,0.00007963998,0.0013375514,0.00621459,0.000032703672,0.056149043,0.00044823412,0.935531],"study_design_scores_gemma":[0.00012434162,0.00011752375,0.00009839527,0.0005685523,0.000023356259,0.000047545516,5.201257e-7,0.8962201,0.00014736276,0.087231226,0.014826395,0.0005946971],"about_ca_topic_score_codex":0.000022111526,"about_ca_topic_score_gemma":0.00005863442,"teacher_disagreement_score":0.93493634,"about_ca_system_score_codex":0.0004783514,"about_ca_system_score_gemma":0.00048732857,"threshold_uncertainty_score":0.9999214},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028012359,0.005738502,0.9924501,0.00007137145,0.00084635493,0.00039781057,0.000010104825,0.00007206708,0.00038562992],"genre_scores_gemma":[0.34393585,0.004958042,0.6476,0.00024244357,0.0011897837,0.00040796638,0.00007495563,0.00014382707,0.0014471242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901253,0.000014191355,0.00026324968,0.0003068454,0.00024956884,0.00015363898],"domain_scores_gemma":[0.99937046,0.00027683735,0.00005216185,0.00020859893,0.000055132645,0.000036835703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023054318,0.00014990578,0.0001768769,0.0002656131,0.00005496429,0.0002284051,0.00021133324,0.00010889171,0.0000013911637],"category_scores_gemma":[0.000060853425,0.000113792164,0.00002374986,0.0007318298,0.00019692598,0.00020501793,0.000085361986,0.00035536598,0.0000050527005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.1766344e-7,0.000014305942,0.00004223177,0.00015285135,0.00000496412,0.0000036972056,0.00038180657,0.92307705,0.000001519933,0.00008297569,0.00004736077,0.07619033],"study_design_scores_gemma":[0.00008795263,0.000015138067,0.000033567554,0.00023722019,0.0000063351104,0.000022402666,0.000003532777,0.9959202,0.00002490195,0.00054213364,0.0029862511,0.00012035575],"about_ca_topic_score_codex":0.000003835004,"about_ca_topic_score_gemma":0.000020282914,"teacher_disagreement_score":0.34485012,"about_ca_system_score_codex":0.00017515317,"about_ca_system_score_gemma":0.00014992396,"threshold_uncertainty_score":0.46403098},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001289518,0.0009643959,0.99258757,0.0033819478,0.0011391151,0.0003804394,0.000009866665,0.0002638546,0.001143881],"genre_scores_gemma":[0.30334067,0.00002761112,0.6888239,0.0068967734,0.0003932942,0.000013713657,0.000013142354,0.000072476185,0.00041843185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957433,0.000036425787,0.0005301925,0.001856034,0.0011803732,0.000653678],"domain_scores_gemma":[0.99758077,0.00054992235,0.00027107028,0.0011285177,0.00021815563,0.00025158102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071386306,0.0006331571,0.000577635,0.0011876429,0.0003587291,0.0008789058,0.0016188485,0.00018485468,0.000022375805],"category_scores_gemma":[0.00005246757,0.00048505154,0.00007963017,0.00074465066,0.00083424686,0.00047895435,0.001182132,0.0010475686,0.000020176645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054492244,0.000052328473,0.00009716074,0.00022224884,0.000016493366,0.000357229,0.00043479813,0.046352934,0.0006538176,0.02258284,0.00014496448,0.9290307],"study_design_scores_gemma":[0.00092923985,0.0004458325,0.00006929239,0.003606348,0.000014673228,0.000055730223,0.0000014476335,0.9678793,0.0051342775,0.016982123,0.004045747,0.0008359813],"about_ca_topic_score_codex":0.000018305103,"about_ca_topic_score_gemma":0.000041170733,"teacher_disagreement_score":0.9281947,"about_ca_system_score_codex":0.0002712558,"about_ca_system_score_gemma":0.00048307842,"threshold_uncertainty_score":0.9997601},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004797864,0.0015790034,0.99404895,0.00028067883,0.0013815338,0.00020525044,0.000027056036,0.00039183494,0.002037714],"genre_scores_gemma":[0.9226676,0.00026334097,0.074903734,0.00023387585,0.0010170366,0.000011650057,0.000037700363,0.0001284862,0.00073657616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796665,0.000005865358,0.00038772763,0.0007640031,0.0003946636,0.00048111874],"domain_scores_gemma":[0.9990624,0.00023285233,0.000053190015,0.00048304314,0.00007468086,0.00009380696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046401995,0.00040981444,0.00047179457,0.00069853547,0.00015783941,0.0003426554,0.0005956123,0.00028632983,0.000013173992],"category_scores_gemma":[0.000026673782,0.00038034376,0.00019036903,0.00035945827,0.00023155317,0.0001119377,0.00014312263,0.00052243617,0.000022633854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025376605,0.0000036792278,0.000003992751,0.00026778548,0.000047153317,0.000014771891,0.00020770618,0.9228893,0.00013735991,0.0027904138,0.000032929103,0.073602356],"study_design_scores_gemma":[0.00008398271,0.000023146958,7.830308e-7,0.0006316123,0.000049447342,0.0000059135778,4.682961e-7,0.8267947,0.00013508456,0.17148201,0.000425519,0.00036733723],"about_ca_topic_score_codex":0.000014197397,"about_ca_topic_score_gemma":0.00009847383,"teacher_disagreement_score":0.92261964,"about_ca_system_score_codex":0.0005792076,"about_ca_system_score_gemma":0.000104130886,"threshold_uncertainty_score":0.9998649},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004902272,0.00013902022,0.9904026,0.0013569145,0.0009933759,0.0003378051,0.000008208249,0.00033071009,0.005941177],"genre_scores_gemma":[0.5437327,0.00003063612,0.45514634,0.0006130256,0.00027887954,0.0000066255284,0.000016816095,0.00002586265,0.00014911329],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973132,0.0000220487,0.00043615274,0.0010187014,0.0007155314,0.000494367],"domain_scores_gemma":[0.99817634,0.00045219564,0.00023028761,0.0008062607,0.0001520331,0.0001828853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007469812,0.00042517507,0.00035411687,0.0011196195,0.0003240305,0.00091836666,0.0017132722,0.0002926553,0.000012699113],"category_scores_gemma":[0.00009252292,0.00042360363,0.00008165185,0.0007879056,0.0005269156,0.0014112879,0.0012939734,0.001244877,0.00005751297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026082657,0.0000050373274,0.00006941816,0.0000427331,0.000011485337,0.000021312275,0.0044666026,0.03882652,0.00003346474,0.094291754,0.000007739723,0.8622213],"study_design_scores_gemma":[0.0001919382,0.00008219004,0.0004607524,0.00027070873,0.000009705698,0.0000565213,0.0000013715402,0.9428531,0.000043119482,0.050992433,0.004580496,0.00045769385],"about_ca_topic_score_codex":0.00016296451,"about_ca_topic_score_gemma":0.00002895542,"teacher_disagreement_score":0.90402657,"about_ca_system_score_codex":0.00034425542,"about_ca_system_score_gemma":0.00044797154,"threshold_uncertainty_score":0.9998216},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012596726,0.0041045914,0.9884218,0.0023147853,0.002262639,0.00048353628,0.000018046929,0.00053625304,0.0018570655],"genre_scores_gemma":[0.010500773,0.00018099451,0.9835612,0.004425093,0.000328054,0.000020251175,0.0000032624837,0.00009192666,0.00088842504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99442637,0.00003517606,0.000785877,0.0025392028,0.0012207328,0.0009926214],"domain_scores_gemma":[0.9952086,0.0018287025,0.0002924293,0.0020160251,0.00033376238,0.0003204736],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00085489097,0.0009081939,0.0008771625,0.0010761181,0.0003280633,0.0012697539,0.004388696,0.00028088182,0.00005744452],"category_scores_gemma":[0.0005148765,0.0007787347,0.00031542496,0.0011275124,0.00092097785,0.0008309829,0.0017622658,0.0011991351,0.0004481418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029906435,0.000056728706,0.0000010516212,0.00017951716,0.000011866167,0.00035271514,0.0001565565,0.023393065,0.0007722244,0.0050131916,0.0000120721825,0.970048],"study_design_scores_gemma":[0.00023516522,0.00006629094,0.0000024176652,0.0024327105,0.00002022782,0.000108631466,1.723844e-7,0.964689,0.0027658746,0.014479163,0.01428919,0.00091114675],"about_ca_topic_score_codex":0.000015557056,"about_ca_topic_score_gemma":0.000021743508,"teacher_disagreement_score":0.9691369,"about_ca_system_score_codex":0.00041550794,"about_ca_system_score_gemma":0.00067335623,"threshold_uncertainty_score":0.999767},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002415787,0.0011854803,0.9917808,0.0005381142,0.0014449544,0.00033107965,0.0000033085057,0.0007313932,0.0039607207],"genre_scores_gemma":[0.3710257,0.00030350673,0.6218876,0.0025482832,0.0010274261,0.000032643693,0.000015103859,0.00013839648,0.0030212982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606764,0.000019915617,0.00047622592,0.0017717388,0.0010795881,0.00058488967],"domain_scores_gemma":[0.9975989,0.00023626557,0.0002032022,0.0014987738,0.00028744037,0.00017545333],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005915333,0.0005944323,0.0005093298,0.0023266932,0.0002164183,0.0014449947,0.0030615216,0.00044147822,0.000015281574],"category_scores_gemma":[0.000024726114,0.0004899711,0.00014854768,0.0026181738,0.0003480863,0.0005480862,0.0015252441,0.0012257744,0.000021305426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042357383,0.000032774,0.00004803054,0.00013560847,0.000032988763,0.00029848606,0.0008886404,0.0037347686,0.000017116945,0.6809076,0.00018879499,0.31371096],"study_design_scores_gemma":[0.0001348704,0.00032831499,0.00003838116,0.00073103514,0.000011665048,0.00011460107,1.056797e-7,0.6855496,0.00069469167,0.30525854,0.0063738506,0.00076433393],"about_ca_topic_score_codex":0.000022413948,"about_ca_topic_score_gemma":0.00010509787,"teacher_disagreement_score":0.68181485,"about_ca_system_score_codex":0.00018014396,"about_ca_system_score_gemma":0.00040276794,"threshold_uncertainty_score":0.9997552},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016205052,0.002669532,0.9943154,0.0001321886,0.00051070197,0.00043022557,0.000021138763,0.0003665935,0.0013921913],"genre_scores_gemma":[0.19861391,0.00017005607,0.7991694,0.0006146293,0.00025628615,0.000008935,0.0000073082,0.000059436432,0.0011000113],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9964167,0.000026315498,0.0005134937,0.0015244548,0.00095981924,0.0005592214],"domain_scores_gemma":[0.9973906,0.0002341746,0.00042820664,0.0012586915,0.00055663276,0.00013164277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006395379,0.0005465346,0.0006782972,0.0007027034,0.00026987327,0.0003387391,0.0030544067,0.00023693318,0.000010747242],"category_scores_gemma":[0.000090138004,0.00044416313,0.00013559096,0.0009278569,0.0010567261,0.000948496,0.0034150332,0.0007612126,0.000012579323],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053919215,0.000039544146,0.000158739,0.00032648764,0.000045779365,0.0007772452,0.0007289518,0.0027803022,0.0065378286,0.022095205,0.00006920713,0.9663868],"study_design_scores_gemma":[0.0013314259,0.0021736703,0.00021691305,0.004501722,0.00009348462,0.00038175916,0.0000010288271,0.23280683,0.45246235,0.3012763,0.0020656937,0.0026888296],"about_ca_topic_score_codex":0.00008393085,"about_ca_topic_score_gemma":0.000035531346,"teacher_disagreement_score":0.96369797,"about_ca_system_score_codex":0.00024091502,"about_ca_system_score_gemma":0.00045960993,"threshold_uncertainty_score":0.99980104},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027879734,0.00037368102,0.9743171,0.001459771,0.011692654,0.00041213984,0.0000034188502,0.0005486319,0.011164745],"genre_scores_gemma":[0.75495565,0.000057247806,0.2308104,0.00410816,0.006984896,0.000013940275,0.000030360476,0.0002653991,0.0027739173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940209,0.00008192803,0.0006292542,0.002618279,0.00150496,0.0011446886],"domain_scores_gemma":[0.99636155,0.0009791256,0.000334514,0.0018247089,0.00019764274,0.0003024829],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0008867258,0.000948952,0.0007612125,0.0011869513,0.000453056,0.0009960652,0.00528396,0.0006551423,0.00006421678],"category_scores_gemma":[0.0001417716,0.0008972352,0.00029886336,0.0011077736,0.0009129948,0.00084838533,0.0032554874,0.0032289166,0.00018791802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019528296,0.000012592928,0.000010180918,0.000017959028,0.000018296274,0.00044690276,0.00030203216,0.74794286,0.0000023396078,0.06156748,0.000036217774,0.18962361],"study_design_scores_gemma":[0.00041280346,0.00028664627,0.000018396018,0.0002787381,0.000023720573,0.00007236786,3.4655008e-7,0.96219945,0.000013388228,0.032493975,0.0033255701,0.00087458844],"about_ca_topic_score_codex":0.000029987415,"about_ca_topic_score_gemma":0.000073571995,"teacher_disagreement_score":0.7549278,"about_ca_system_score_codex":0.00081568107,"about_ca_system_score_gemma":0.00035681998,"threshold_uncertainty_score":0.9993478},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058598813,0.00060438947,0.97827566,0.0013295843,0.0025815333,0.00024396894,0.0000028473116,0.0003363354,0.016567094],"genre_scores_gemma":[0.5628519,0.00005054138,0.4343633,0.0008914902,0.000661958,0.000011558349,0.000010671375,0.000049371618,0.0011092207],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970652,0.00004233866,0.00050559564,0.0010823719,0.0008359333,0.00046857217],"domain_scores_gemma":[0.9981174,0.0007144278,0.00013457991,0.0007800097,0.00013998212,0.000113630565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017141781,0.00038665783,0.00036115476,0.0009830119,0.0002148195,0.0007586516,0.0016637758,0.00030717044,0.000012737554],"category_scores_gemma":[0.00008687551,0.00034942143,0.00014808476,0.0008460712,0.00030113757,0.0009168602,0.00036584566,0.00096081285,0.00022770985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023611244,0.000010900651,0.00009547001,0.000068365065,0.0000082058,0.00005433031,0.001111036,0.009821439,0.000027089047,0.2474145,0.000009092702,0.74137723],"study_design_scores_gemma":[0.00011137661,0.00008786153,0.00048861187,0.00033005537,0.0000066878756,0.00006349935,8.708266e-8,0.35762268,0.0004111286,0.6379077,0.0025283678,0.0004419428],"about_ca_topic_score_codex":0.000008250617,"about_ca_topic_score_gemma":0.000045181867,"teacher_disagreement_score":0.74093527,"about_ca_system_score_codex":0.00021989363,"about_ca_system_score_gemma":0.00037079494,"threshold_uncertainty_score":0.99989575},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031186713,0.0009967246,0.98940384,0.00036949912,0.0017209229,0.0002919386,0.000005574969,0.00017887201,0.006720763],"genre_scores_gemma":[0.5298547,0.000018805931,0.46927115,0.00017083592,0.00021615933,0.0000045779616,0.0000029263558,0.00005121276,0.00040962422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599326,0.00003675954,0.0006104634,0.0016591244,0.0010929663,0.00060743454],"domain_scores_gemma":[0.9974899,0.0006600655,0.00032235464,0.0011644243,0.00019857944,0.00016463546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00104906,0.0005623003,0.00065986643,0.0010435414,0.00021873861,0.00038742804,0.0024260534,0.00031259705,0.0000148739955],"category_scores_gemma":[0.000116151255,0.0005227285,0.00013140669,0.00074286014,0.0008621202,0.00034887937,0.0030669498,0.0012275245,0.000014070261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039585525,0.000009715048,0.000008917605,0.00008339321,0.000011999724,0.000056250647,0.0014034241,0.84610826,0.00007189122,0.08475005,0.0000057135235,0.06748644],"study_design_scores_gemma":[0.0001751738,0.00008831422,0.000008316986,0.0006558538,0.000015812893,0.000042952408,4.6017155e-7,0.85915494,0.00015826109,0.13917994,0.000093320225,0.0004266318],"about_ca_topic_score_codex":0.000041039228,"about_ca_topic_score_gemma":0.000016432683,"teacher_disagreement_score":0.52954286,"about_ca_system_score_codex":0.00022517655,"about_ca_system_score_gemma":0.0003984047,"threshold_uncertainty_score":0.9997224},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043500031,0.0034632434,0.98501104,0.0012463966,0.0027951787,0.00065346557,0.000008875216,0.0010503795,0.0053364136],"genre_scores_gemma":[0.6646036,0.0005295672,0.32666662,0.004721411,0.00093392294,0.00009708088,0.000019566427,0.00017428577,0.0022539343],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961545,0.000025488123,0.00042280662,0.001883273,0.00085164106,0.00066229247],"domain_scores_gemma":[0.9977216,0.0005425255,0.0001539964,0.0012925023,0.000076829354,0.0002125131],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00074832706,0.00058701925,0.00048467726,0.0006879066,0.00019913315,0.0013434421,0.0025449747,0.00027659646,0.000020181295],"category_scores_gemma":[0.0000461499,0.00047952254,0.0001188273,0.0004855229,0.00083069416,0.00042639687,0.0019589344,0.0009123159,0.00014851472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010610748,0.00002143407,0.0000015514883,0.00004227141,0.000008068233,0.00008921398,0.00017972267,0.00030524406,0.000006774003,0.36500734,0.000058516584,0.6342788],"study_design_scores_gemma":[0.00014642188,0.00027759984,0.000026031337,0.0007651317,0.000008068402,0.000098110206,7.236916e-8,0.44187135,0.00016386386,0.5534187,0.0027824398,0.00044224932],"about_ca_topic_score_codex":0.0000058711307,"about_ca_topic_score_gemma":0.000010999477,"teacher_disagreement_score":0.6641686,"about_ca_system_score_codex":0.0001842394,"about_ca_system_score_gemma":0.00028776785,"threshold_uncertainty_score":0.99976563},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035905783,0.0011297801,0.9874508,0.00037357272,0.00056547986,0.0013112152,0.0000053510453,0.0002535281,0.0085512465],"genre_scores_gemma":[0.124968566,0.00016350445,0.87398463,0.00030600934,0.00024450803,0.0001223819,0.00002854539,0.000048904665,0.00013292019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590826,0.000095216266,0.00052396423,0.0016029072,0.0013137927,0.00055583025],"domain_scores_gemma":[0.99796003,0.0005774779,0.00021636681,0.0006436358,0.00047321964,0.00012927759],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026048475,0.00046675946,0.00049596274,0.0012139315,0.00021873905,0.00065015885,0.0014617669,0.00026833598,0.000022562586],"category_scores_gemma":[0.00013588507,0.0003964854,0.00011245277,0.00088481646,0.00020460326,0.00166029,0.0003915863,0.0006709921,0.000025242975],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002982224,0.00003513954,0.000037520138,0.00009107607,0.000009298729,0.00004729668,0.0006163456,0.07836431,0.00003639692,0.006350562,0.0000040206637,0.9143782],"study_design_scores_gemma":[0.0005212908,0.00017290868,0.000013427258,0.0007184703,0.000018226585,0.00004586507,0.0000011880935,0.82007545,0.0004789697,0.1768142,0.00069650705,0.0004435214],"about_ca_topic_score_codex":0.00005417178,"about_ca_topic_score_gemma":0.00042352057,"teacher_disagreement_score":0.9139347,"about_ca_system_score_codex":0.00058047695,"about_ca_system_score_gemma":0.00087290537,"threshold_uncertainty_score":0.9998487},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013920985,0.00025349134,0.9786598,0.004231932,0.0007290024,0.00035535934,0.000003867147,0.00012498916,0.0017205515],"genre_scores_gemma":[0.8847897,0.00001863532,0.11311833,0.001739478,0.000094991345,0.000012860109,0.000002405519,0.000024651134,0.00019895718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713683,0.00007731966,0.0003897135,0.0010549302,0.0009589178,0.00038225873],"domain_scores_gemma":[0.99651545,0.0019751561,0.0002331127,0.0010153265,0.0001879244,0.00007304419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009252069,0.00037343384,0.00035920122,0.0008968268,0.00013742445,0.0004119223,0.0022714066,0.00034100504,0.00003094181],"category_scores_gemma":[0.00060327497,0.00027032793,0.00013082217,0.001111141,0.0005026158,0.00025468634,0.00033603155,0.0016792007,0.00007007055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013259164,0.000033366687,0.00013989604,0.00006157352,0.000008356716,0.00005641955,0.0007086839,0.43017483,0.00027151147,0.089990556,0.000017949185,0.47852358],"study_design_scores_gemma":[0.00007834794,0.00009960617,0.0019481493,0.0013610979,0.000005236721,0.000011352287,4.990696e-7,0.8013891,0.0019061927,0.19252618,0.0003371083,0.00033709855],"about_ca_topic_score_codex":0.000016793021,"about_ca_topic_score_gemma":0.000030202516,"teacher_disagreement_score":0.8708687,"about_ca_system_score_codex":0.00016286269,"about_ca_system_score_gemma":0.00017967724,"threshold_uncertainty_score":0.9999749},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009450089,0.0069016805,0.97623247,0.00073596154,0.0029403188,0.00018013552,0.000034154724,0.000033628934,0.0034915884],"genre_scores_gemma":[0.5276388,0.0018069685,0.46092185,0.00144969,0.005430706,0.0000136635,0.00028335926,0.0000775304,0.0023774477],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981196,0.000027616918,0.0005079028,0.0008263419,0.000256776,0.00026179553],"domain_scores_gemma":[0.99907094,0.000113165355,0.00014777988,0.00048801824,0.00010704658,0.00007304735],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006725443,0.00024558094,0.00038034862,0.00016602935,0.00006094961,0.000051491264,0.00053478975,0.0006681167,0.000019679457],"category_scores_gemma":[0.000081378894,0.00020081032,0.00014950185,0.00010156956,0.0028261929,0.0000029971386,0.0003431513,0.00040005072,0.000009581142],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041742966,0.000037554004,0.0002694995,0.000056552042,0.000059512266,0.000050774655,0.00015688017,0.00026220223,0.021113351,0.012537468,0.0007586893,0.96465576],"study_design_scores_gemma":[0.0013077593,0.0028279244,0.00069908774,0.00075833796,0.00006839454,0.00023487186,0.0000038861394,0.006671398,0.04656922,0.18632224,0.75289387,0.001643031],"about_ca_topic_score_codex":0.0000044528624,"about_ca_topic_score_gemma":0.00012797341,"teacher_disagreement_score":0.96301275,"about_ca_system_score_codex":0.000025016714,"about_ca_system_score_gemma":0.0002993878,"threshold_uncertainty_score":0.9998875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045006406,0.0007691684,0.97968537,0.00012975717,0.0011690476,0.00017136932,0.0000013869064,0.00029459613,0.0132786725],"genre_scores_gemma":[0.85601544,0.000014566719,0.1397948,0.00037679495,0.0017768362,0.0000081425715,0.000033181135,0.00010282409,0.001877413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998284,0.000009293397,0.00030868544,0.00066788075,0.0003847443,0.00034541753],"domain_scores_gemma":[0.99938893,0.00005574201,0.000064891094,0.00032158586,0.000068619585,0.0001002518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035931822,0.00035377502,0.00028996426,0.00060792064,0.00025318842,0.00035876295,0.00030210576,0.00016685294,0.000052967975],"category_scores_gemma":[0.000011060551,0.000331405,0.000033910535,0.00031027253,0.0001313171,0.00023608032,0.00018779881,0.000671022,0.000022584323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002015649,0.0000016985505,0.00011353339,0.000065048866,0.00001028049,0.000033276072,0.00046755222,0.94077516,0.0019083627,0.00324952,0.00006701918,0.05330654],"study_design_scores_gemma":[0.00016479082,0.0001472244,0.00035476495,0.0007992804,0.000016626294,0.000041688436,3.099065e-7,0.99285764,0.00043549854,0.0008832752,0.0037475105,0.0005514001],"about_ca_topic_score_codex":0.000018645354,"about_ca_topic_score_gemma":0.0004185546,"teacher_disagreement_score":0.8515148,"about_ca_system_score_codex":0.00016688221,"about_ca_system_score_gemma":0.00004329514,"threshold_uncertainty_score":0.9999138},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018193205,0.00011283716,0.9905765,0.0018560747,0.0012406986,0.0015368578,0.000044584332,0.00032818492,0.004122354],"genre_scores_gemma":[0.09138771,0.000024046647,0.9053147,0.0013195929,0.0007212549,0.00013394441,0.000022282065,0.00007619971,0.0010003059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957989,0.000025630983,0.0008143894,0.0017159878,0.00093580433,0.00070932147],"domain_scores_gemma":[0.9978722,0.00032196438,0.00019344596,0.0009088497,0.00043005557,0.0002734903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010615377,0.0005739561,0.00067589467,0.0017106599,0.00022311129,0.00057783804,0.002152232,0.00033634764,0.0000314288],"category_scores_gemma":[0.00010105491,0.00052996184,0.00025610655,0.0008925386,0.00027385645,0.0006454657,0.0004611944,0.00053389714,0.00005179866],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008660242,0.000026477795,0.0000014839565,0.000108437474,0.000012676517,0.000010647121,0.0026961735,0.0014269047,0.040230457,0.018625604,0.00016194656,0.9366905],"study_design_scores_gemma":[0.0005085519,0.0013789028,0.000020944477,0.0021095115,0.000043105563,0.00007086025,0.0000025644244,0.6120724,0.22857198,0.13987443,0.013791113,0.0015556124],"about_ca_topic_score_codex":0.000011858864,"about_ca_topic_score_gemma":0.00009425129,"teacher_disagreement_score":0.93513495,"about_ca_system_score_codex":0.00024516287,"about_ca_system_score_gemma":0.00041569181,"threshold_uncertainty_score":0.9997152},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021990794,0.014271848,0.8098503,0.0329679,0.017846636,0.0070273974,0.00019774989,0.0007727904,0.11486631],"genre_scores_gemma":[0.97012067,0.00052299676,0.013179213,0.0043082056,0.0047255014,0.00013717833,0.000013485613,0.000079717116,0.0069130147],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979923,0.000014909236,0.00023293635,0.00078920217,0.00048890593,0.00048176353],"domain_scores_gemma":[0.99902636,0.0003345573,0.00008064441,0.0002547155,0.00014267724,0.00016105034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074134,0.00027977707,0.00036005664,0.000344592,0.00058724015,0.00061492046,0.0007645273,0.00028982427,0.000046098532],"category_scores_gemma":[0.00009228135,0.00023791868,0.0000821736,0.00026627307,0.0012329537,0.0003344843,0.00030903248,0.00035471868,0.000018820892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015729118,0.000014758242,0.0002624406,0.000071571216,0.00001817171,0.000025334508,0.005844252,0.00005209779,0.000006379144,0.3152919,0.000047002286,0.6783504],"study_design_scores_gemma":[0.0010447941,0.0004763958,0.0005530874,0.00076638814,0.00008459473,0.000006561064,0.00000947939,0.037760105,0.000078789184,0.8093442,0.1485482,0.0013274471],"about_ca_topic_score_codex":0.00030254613,"about_ca_topic_score_gemma":0.0013154325,"teacher_disagreement_score":0.9679216,"about_ca_system_score_codex":0.00014080711,"about_ca_system_score_gemma":0.0002903546,"threshold_uncertainty_score":0.9702042},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014032766,0.0016087192,0.99051094,0.00041810618,0.0030563995,0.00031004197,0.0000028276681,0.00020995864,0.002479721],"genre_scores_gemma":[0.5806682,0.00008186724,0.4171929,0.0010577559,0.00039131215,0.000012477998,0.0000047113026,0.000025489708,0.0005652497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586606,0.000055326156,0.00069329847,0.0016120737,0.0010554905,0.000717765],"domain_scores_gemma":[0.99820346,0.00027998333,0.0002220654,0.001051002,0.0001440537,0.000099434306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015594283,0.0005045175,0.0005207238,0.00076389645,0.00018579903,0.00093600166,0.0026325895,0.00035595382,0.000012110836],"category_scores_gemma":[0.00011244982,0.00043038581,0.00011853587,0.0006481209,0.00040075887,0.0007521958,0.0018317023,0.00085935555,0.00006600448],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061994547,0.00006521867,0.001375163,0.00019949899,0.000022969758,0.0006712562,0.0041152756,0.038181398,0.0017168536,0.08909438,0.000028970064,0.8645228],"study_design_scores_gemma":[0.00013067313,0.00009836605,0.00049604534,0.00039347445,0.000006197191,0.000056146077,0.0000012497654,0.64390117,0.0006716937,0.353531,0.00020776046,0.0005062047],"about_ca_topic_score_codex":0.00015960568,"about_ca_topic_score_gemma":0.0011373988,"teacher_disagreement_score":0.8640166,"about_ca_system_score_codex":0.0004558265,"about_ca_system_score_gemma":0.0003198697,"threshold_uncertainty_score":0.9998148},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006851001,0.0015132439,0.99238473,0.00072039716,0.0011498288,0.00042623768,0.0000052067817,0.00061874435,0.0031131222],"genre_scores_gemma":[0.2678487,0.0006616335,0.72859263,0.0015707634,0.0008272059,0.00002589636,0.000021078433,0.00010985421,0.00034226934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959465,0.000039319846,0.00066183857,0.0018968544,0.00084799033,0.0006074493],"domain_scores_gemma":[0.99779314,0.00034833644,0.00030820002,0.0010877335,0.00025575812,0.00020684395],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010378928,0.0006153269,0.00057032466,0.0013211833,0.00041430374,0.0016249466,0.0014730282,0.00029723436,0.0000065927265],"category_scores_gemma":[0.000025670177,0.00050763355,0.00009321865,0.0010333929,0.00045272827,0.0007205918,0.0010658017,0.00083342125,0.000009354235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015969328,0.000043655753,0.000035819503,0.0003541939,0.000039743096,0.00043187535,0.0026160572,0.0076550837,0.00013768577,0.8433824,0.00016989362,0.14511758],"study_design_scores_gemma":[0.00018035418,0.000355714,0.000029568433,0.0026837168,0.000024186153,0.00030958367,3.106659e-7,0.7224124,0.0007362352,0.27126074,0.0012812974,0.00072585524],"about_ca_topic_score_codex":0.0000646115,"about_ca_topic_score_gemma":0.000065745866,"teacher_disagreement_score":0.7147573,"about_ca_system_score_codex":0.00021985284,"about_ca_system_score_gemma":0.0002848819,"threshold_uncertainty_score":0.9997375},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000436549,0.00062484137,0.9903388,0.001579666,0.0005921973,0.00058960944,0.000009828184,0.0002344984,0.005594034],"genre_scores_gemma":[0.12695065,0.000054211112,0.868175,0.0014743223,0.0008471632,0.000040541006,0.0000043640866,0.00013605373,0.0023176682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949856,0.00006440689,0.000547274,0.00234833,0.0010213882,0.0010330245],"domain_scores_gemma":[0.9965479,0.0013375038,0.00022708035,0.0012638059,0.000230716,0.00039299423],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013917453,0.0007630912,0.0008507864,0.00095307396,0.000541919,0.001309108,0.001900764,0.00024854956,0.000053776566],"category_scores_gemma":[0.00031993698,0.0006035894,0.0001192388,0.0010775015,0.00063666847,0.00044164248,0.001829199,0.00072371843,0.000108777866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032443553,0.000043014727,0.00000799293,0.00009166584,0.00004500842,0.00032206593,0.0037135766,0.37047887,0.0039753816,0.0014982007,0.00029703797,0.61949474],"study_design_scores_gemma":[0.00018340453,0.00027293456,0.000024593532,0.0019070427,0.00003836524,0.000107018284,0.0000037354334,0.9835278,0.0029143868,0.004322313,0.005804046,0.0008943819],"about_ca_topic_score_codex":0.000025822617,"about_ca_topic_score_gemma":0.00007342706,"teacher_disagreement_score":0.61860037,"about_ca_system_score_codex":0.00028835578,"about_ca_system_score_gemma":0.00039973907,"threshold_uncertainty_score":0.9997276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003547402,0.0034041097,0.99324965,0.00017718931,0.0016425751,0.0005642646,0.000019258288,0.000559388,0.00034809392],"genre_scores_gemma":[0.03261804,0.00023815819,0.9612451,0.0009257008,0.002203626,0.00032092442,0.00004240432,0.0001009071,0.002305126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701,0.00002111251,0.00039923444,0.0014108829,0.00060899067,0.00054976036],"domain_scores_gemma":[0.99753565,0.0007037954,0.00009951727,0.0013550806,0.0001528844,0.00015309006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008763571,0.0004115352,0.00041589755,0.0004868929,0.00021183939,0.0010272925,0.0021646745,0.0003090055,0.000004289932],"category_scores_gemma":[0.00015848335,0.0003357313,0.00008103396,0.0011897691,0.00035443567,0.0007453908,0.0014287335,0.00075270503,0.00007296952],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019774116,0.000027280486,0.00038756386,0.0007869736,0.000018525116,0.000047804075,0.0006663174,0.01507865,0.000012566768,0.019350225,0.00029624958,0.96332586],"study_design_scores_gemma":[0.00037939454,0.00024435297,0.00075340795,0.0016973638,0.00003634897,0.0005260272,5.1528707e-7,0.50288826,0.00076755945,0.36821574,0.12244147,0.0020495343],"about_ca_topic_score_codex":0.00001172099,"about_ca_topic_score_gemma":0.000012588963,"teacher_disagreement_score":0.96127635,"about_ca_system_score_codex":0.0003590357,"about_ca_system_score_gemma":0.0011620027,"threshold_uncertainty_score":0.99990946},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107830636,0.00052045204,0.7389605,0.002360839,0.007350849,0.0061939536,0.000056234065,0.0003527928,0.13637374],"genre_scores_gemma":[0.9912634,0.000042278876,0.0034251397,0.0005105803,0.0006005328,0.000020442147,0.0000018711606,0.000028343666,0.0041074343],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692917,0.000106825166,0.00039534934,0.000800567,0.0013178133,0.00045029158],"domain_scores_gemma":[0.9985653,0.00035037668,0.00017095008,0.00057457725,0.00017160134,0.00016717947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021392533,0.00031017087,0.00033986117,0.00033761677,0.00012805809,0.00044783685,0.0010614996,0.00017304218,0.00014017014],"category_scores_gemma":[0.0001537623,0.00021276408,0.00010646453,0.00042893403,0.0011035528,0.00027101926,0.00027640242,0.00049291394,0.000039298495],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012855783,0.00012121191,0.000024567245,0.0000151278,0.000015235835,0.0004910712,0.05595758,0.0012262445,0.00002141537,0.0043447283,0.000019202116,0.93775076],"study_design_scores_gemma":[0.0033134113,0.023488307,0.0014889177,0.006169305,0.00070336263,0.0010023661,0.010370474,0.13501577,0.0007232435,0.6582118,0.15236661,0.0071464134],"about_ca_topic_score_codex":0.00039051397,"about_ca_topic_score_gemma":0.0012261807,"teacher_disagreement_score":0.93060434,"about_ca_system_score_codex":0.00028245465,"about_ca_system_score_gemma":0.00058109703,"threshold_uncertainty_score":0.8676267},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016362849,0.00074757036,0.96702343,0.019497618,0.0017270441,0.0015377647,0.0000128748125,0.00030867718,0.008981396],"genre_scores_gemma":[0.9157532,0.000023040084,0.04163103,0.00041534417,0.0014222758,0.0003231032,0.0000022306533,0.00003927004,0.040390506],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982451,0.000025524258,0.00016894111,0.00077548693,0.00036586644,0.00041908008],"domain_scores_gemma":[0.99837875,0.0008410315,0.00008824063,0.00037135032,0.00025080866,0.00006982073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010514985,0.00025246022,0.0002620099,0.00036905502,0.00070214365,0.00032887448,0.000892006,0.00026836488,0.0000041323874],"category_scores_gemma":[0.00056306744,0.00018427825,0.00009725573,0.00053064077,0.0013857635,0.00013512801,0.00027501877,0.0004622274,0.000024566794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054809498,0.000009760614,0.0000055153496,0.000020418589,0.000015666434,4.617189e-7,0.051725034,0.006756304,0.000034700024,0.114166126,0.0007029197,0.82655764],"study_design_scores_gemma":[0.000078455145,0.00006848336,0.00009297773,0.00019003286,0.000026028596,9.764592e-7,0.00004188732,0.19289641,0.000110633446,0.7589894,0.04711842,0.0003863179],"about_ca_topic_score_codex":0.000024950254,"about_ca_topic_score_gemma":0.002243606,"teacher_disagreement_score":0.9253924,"about_ca_system_score_codex":0.0007952171,"about_ca_system_score_gemma":0.0005147966,"threshold_uncertainty_score":0.7514649},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029073926,0.00044425027,0.9952547,0.0005084106,0.0019165794,0.00062468013,0.0000071208806,0.00028601653,0.000667529],"genre_scores_gemma":[0.14057684,0.000052951502,0.8582424,0.00034137347,0.0005244641,0.000025689124,0.000009586893,0.000047516274,0.00017921295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968247,0.000022629614,0.0005128041,0.0014677481,0.0004970447,0.0006751036],"domain_scores_gemma":[0.9985563,0.00015903034,0.00018185673,0.0008604375,0.0001555383,0.0000868343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000858506,0.00049484824,0.0004476873,0.0012892646,0.00022858371,0.0007791223,0.0016963808,0.0002879492,0.000001825504],"category_scores_gemma":[0.000021661757,0.00044172085,0.00017925497,0.00060603576,0.00033595247,0.00091879617,0.0009367385,0.00060802524,0.000004415084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033568544,0.00008797892,0.0002113223,0.00061739224,0.000051251143,0.00070585334,0.003979475,0.08705911,0.044921648,0.24871582,0.000069470036,0.61354715],"study_design_scores_gemma":[0.00013041473,0.00007349603,0.000009594492,0.000625645,0.000007340536,0.000042804855,6.150472e-8,0.65110475,0.022645434,0.32383993,0.00102898,0.00049155543],"about_ca_topic_score_codex":0.00001999704,"about_ca_topic_score_gemma":0.000065254615,"teacher_disagreement_score":0.6130556,"about_ca_system_score_codex":0.00039021677,"about_ca_system_score_gemma":0.00017824219,"threshold_uncertainty_score":0.9998035},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012084417,0.0025354915,0.94311,0.0012483723,0.002466766,0.00048113771,0.000053707674,0.000871302,0.04911237],"genre_scores_gemma":[0.79521716,0.00013592195,0.1831152,0.0002477845,0.001618816,0.00004575299,0.00043584997,0.00016950438,0.019014038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99461395,0.000120569,0.0008963069,0.0026109426,0.0009021444,0.0008561079],"domain_scores_gemma":[0.99641174,0.00079147395,0.0004453479,0.0017249343,0.00030142898,0.00032505122],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015302977,0.0008797704,0.0006916113,0.00085203245,0.0005854636,0.0014916421,0.0025930007,0.0005077593,0.000036690977],"category_scores_gemma":[0.00022174457,0.0008151941,0.00019588039,0.0013099584,0.0005338681,0.0006616663,0.0012839055,0.0013676285,0.00030710673],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008511692,0.000084452346,0.00025326232,0.00021971471,0.000039303388,0.000028397364,0.004126715,0.0026589737,0.00008143112,0.038996544,0.0008239798,0.95267874],"study_design_scores_gemma":[0.00031428775,0.00014337077,0.0009525529,0.0005124673,0.000038244518,0.000067304034,0.0000015308291,0.8405368,0.000040597737,0.02881814,0.12754247,0.001032289],"about_ca_topic_score_codex":0.000020154725,"about_ca_topic_score_gemma":0.00016040626,"teacher_disagreement_score":0.95164645,"about_ca_system_score_codex":0.00087323796,"about_ca_system_score_gemma":0.0008048204,"threshold_uncertainty_score":0.9995449},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017813407,0.00033595672,0.9922314,0.00016206666,0.0017617766,0.00037207396,7.184687e-7,0.000757111,0.004200738],"genre_scores_gemma":[0.49127722,0.000041932333,0.5058365,0.00025384294,0.0009656793,0.000025580252,0.000043263535,0.00016650393,0.001389483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983547,0.000009747489,0.00034869084,0.0005699145,0.0003567403,0.00036022288],"domain_scores_gemma":[0.9992325,0.00025014678,0.0000612705,0.00028560788,0.00008643261,0.000084095256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000381849,0.0003487516,0.00030508824,0.00054910925,0.00016720747,0.00032103993,0.00037341495,0.00023916396,0.0000575132],"category_scores_gemma":[0.00006463823,0.0003480521,0.00011415294,0.00024510312,0.00007720614,0.0002139243,0.00011693132,0.00081285223,0.00010563646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018381095,0.000002654797,0.0000073484057,0.00016824623,0.000011543715,0.000007090458,0.00068863336,0.8722262,0.00013212133,0.001784536,0.000020668227,0.12494913],"study_design_scores_gemma":[0.00014711428,0.00005741762,0.00003022264,0.0003472204,0.000018292229,0.000018321807,3.6692083e-7,0.9801559,0.00018140789,0.016548602,0.0021177176,0.0003774318],"about_ca_topic_score_codex":0.0000035838398,"about_ca_topic_score_gemma":0.000008345495,"teacher_disagreement_score":0.4910991,"about_ca_system_score_codex":0.00026190974,"about_ca_system_score_gemma":0.00007543674,"threshold_uncertainty_score":0.9998971},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006719136,0.0007254518,0.9910777,0.0004901155,0.0024763418,0.00091852545,0.0000046947207,0.0004034216,0.0038365352],"genre_scores_gemma":[0.51365554,0.000015045385,0.48466113,0.00022108447,0.00052811176,0.000045726898,0.000010649848,0.00005142096,0.0008112709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967123,0.000046804384,0.00060894026,0.0014657129,0.0006355651,0.0005306245],"domain_scores_gemma":[0.9979736,0.0006574293,0.0002908578,0.0006300406,0.00031997028,0.00012807312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016319739,0.0004542326,0.000410426,0.00087858335,0.00045366504,0.0007865929,0.0011012586,0.00031969044,0.0000052960354],"category_scores_gemma":[0.00013441526,0.00044547804,0.00020742624,0.0006753697,0.00022139741,0.0008751938,0.00023827025,0.00069075765,0.000039414786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012232364,0.000012226196,0.000003854169,0.00011218982,0.000010973701,0.0000033707875,0.0038387983,0.04407637,0.00042663424,0.014582781,0.0000012269646,0.93691933],"study_design_scores_gemma":[0.00030066576,0.00013218727,0.00003439171,0.0002888887,0.00001603409,0.000017267617,0.0000015172382,0.8446373,0.0011475453,0.15005709,0.0029392191,0.0004279329],"about_ca_topic_score_codex":0.000014880779,"about_ca_topic_score_gemma":0.0002835023,"teacher_disagreement_score":0.93649143,"about_ca_system_score_codex":0.0003888425,"about_ca_system_score_gemma":0.0004895191,"threshold_uncertainty_score":0.99979967},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002339077,0.00019510913,0.9939231,0.00022339246,0.0011762907,0.0004297223,0.000005360359,0.00078457734,0.0030284931],"genre_scores_gemma":[0.4703252,0.00040622655,0.52310354,0.0035855365,0.0010201272,0.000073681535,0.000048196896,0.00020844121,0.0012290225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960798,0.00002704557,0.0005573656,0.0017216033,0.0010759082,0.0005383013],"domain_scores_gemma":[0.9976836,0.00020100574,0.0002465726,0.0013878639,0.0002920368,0.00018891616],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006075004,0.00060156384,0.00048800147,0.0016447341,0.00025842432,0.0010564765,0.0023124244,0.00027986226,0.000012802027],"category_scores_gemma":[0.000033312128,0.0004980315,0.00013333771,0.0013523919,0.0004506024,0.00053802563,0.001589396,0.00073004985,0.000019297797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014884496,0.00007952851,0.00014419004,0.0003117772,0.00005223425,0.00056511967,0.0023520116,0.005220031,0.00047478254,0.7602863,0.0002988391,0.23020034],"study_design_scores_gemma":[0.00015854,0.0002248581,0.00005487574,0.0009494382,0.000012509347,0.00012311665,1.3495871e-7,0.7499269,0.0013408444,0.24479476,0.0017886731,0.00062532036],"about_ca_topic_score_codex":0.0001095691,"about_ca_topic_score_gemma":0.0002673699,"teacher_disagreement_score":0.74470687,"about_ca_system_score_codex":0.0003288519,"about_ca_system_score_gemma":0.00048457892,"threshold_uncertainty_score":0.9999805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008253427,0.001602406,0.9868197,0.000037085043,0.00076275313,0.0001205323,0.000024279188,0.0004997161,0.0018800936],"genre_scores_gemma":[0.8274326,0.000024366904,0.17150308,0.00008833261,0.0004529696,0.000003693334,0.000016416067,0.000099380355,0.0003791616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979356,0.0000066854113,0.0003017514,0.0008478381,0.00047028784,0.00043784195],"domain_scores_gemma":[0.9990492,0.00004304132,0.000070200826,0.00060466956,0.00009790147,0.00013498405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018293106,0.00049137825,0.0004570099,0.0006386862,0.00012827122,0.00035946938,0.0006695479,0.0002499264,0.000019936206],"category_scores_gemma":[0.000011149636,0.00038821556,0.00009172879,0.0002603352,0.00031202685,0.0002464006,0.00012598465,0.00077290053,0.000009856551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025790355,0.0000016392698,0.000013944245,0.000070661714,0.00002685112,0.00006787524,0.0010178781,0.8508291,0.00028098223,0.0002148247,0.0000018283716,0.14747182],"study_design_scores_gemma":[0.00008391171,0.00003216766,0.0000018321894,0.00073563436,0.000045840552,0.00006494956,0.000002506985,0.9765768,0.0012519312,0.02069886,0.000008351706,0.0004972356],"about_ca_topic_score_codex":0.000018183897,"about_ca_topic_score_gemma":0.00023424838,"teacher_disagreement_score":0.8191792,"about_ca_system_score_codex":0.00018380114,"about_ca_system_score_gemma":0.0001584587,"threshold_uncertainty_score":0.99985695},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006020363,0.001917931,0.98825026,0.0009953906,0.0023525003,0.00031095676,0.0000020400448,0.0006310614,0.0049378145],"genre_scores_gemma":[0.81304735,0.00028723356,0.17772917,0.0009850347,0.0013214399,0.00009502533,0.000014715636,0.00019278911,0.0063272654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99440664,0.00015754723,0.0008036861,0.0023834202,0.0011755907,0.0010731338],"domain_scores_gemma":[0.99713206,0.0012676036,0.00036709398,0.00083077216,0.00018957416,0.00021288647],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0023017772,0.0008514508,0.0011356685,0.0018218791,0.00042044904,0.0010491519,0.0024787493,0.00029017252,0.000043925702],"category_scores_gemma":[0.00044192007,0.0007564831,0.0003250462,0.0013377258,0.00030120835,0.0012425609,0.0015869659,0.005053993,0.00015824186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053031827,0.000013184303,0.000033522752,0.00008363966,0.00009690595,0.00032668735,0.0075722276,0.32211745,0.00018056876,0.010878396,0.0000016398749,0.6586905],"study_design_scores_gemma":[0.0003163313,0.00027065206,0.00003146076,0.0012095384,0.00008141522,0.00009247335,0.0000124164035,0.95776826,0.0025504946,0.028704932,0.0077691954,0.0011928264],"about_ca_topic_score_codex":0.0001919872,"about_ca_topic_score_gemma":0.00024316063,"teacher_disagreement_score":0.8124453,"about_ca_system_score_codex":0.00045996977,"about_ca_system_score_gemma":0.00044518552,"threshold_uncertainty_score":0.99998784},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013732469,0.0013101278,0.99174887,0.0008083386,0.0018919639,0.00085152534,0.000004077954,0.00008835105,0.0032830276],"genre_scores_gemma":[0.873999,0.00004472217,0.12123419,0.00047419991,0.0005351351,0.00008521753,0.000006009419,0.000051415383,0.0035700873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974521,0.000023679126,0.00045024639,0.00093806826,0.0006901095,0.000445799],"domain_scores_gemma":[0.9979436,0.00043991595,0.00024776987,0.0011868518,0.000107940716,0.0000739513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010773349,0.0003340339,0.0003498479,0.0003491842,0.00023815325,0.0003867734,0.0025500108,0.00019875933,0.000014457305],"category_scores_gemma":[0.000035349192,0.00021994743,0.0001809096,0.00031150895,0.00058852695,0.00019579369,0.0009652371,0.00044731717,0.000047837788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026051603,0.000031536423,0.00003266734,0.000120678895,0.00003466695,0.00001589067,0.0019523794,0.010589612,0.00006284574,0.70441127,0.00003972132,0.28270614],"study_design_scores_gemma":[0.00018206539,0.00034166995,0.0000504378,0.0001586164,0.000027057227,0.000050545554,0.0000011311997,0.17403804,0.00072406925,0.7492323,0.07467136,0.0005226982],"about_ca_topic_score_codex":0.000011247932,"about_ca_topic_score_gemma":0.000023825467,"teacher_disagreement_score":0.8739853,"about_ca_system_score_codex":0.00013052605,"about_ca_system_score_gemma":0.00022807297,"threshold_uncertainty_score":0.8969196},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029605097,0.00011929962,0.99287426,0.004421385,0.0004098219,0.00081971847,0.00013942466,0.0002455441,0.00067451084],"genre_scores_gemma":[0.4177293,0.00012733146,0.5774354,0.001983481,0.0007449602,0.00034051327,0.00006665317,0.00006737171,0.0015050132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978913,0.000010913975,0.00035104871,0.0010740971,0.00034472032,0.00032792077],"domain_scores_gemma":[0.9982029,0.0005395668,0.00012897498,0.0008023563,0.00022887009,0.00009729912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037460055,0.0003339791,0.00023496774,0.000426127,0.00057324965,0.0005203329,0.0011369785,0.00018581416,0.000007676583],"category_scores_gemma":[0.00004168282,0.00026505237,0.00012274779,0.000581352,0.0005063724,0.00030933408,0.0004902831,0.00052924873,0.000023285302],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010044423,0.00006755594,0.0000049336263,0.00007658171,0.000021637314,0.00001429671,0.00023514793,0.000711476,0.0023633733,0.2769778,0.000181165,0.719336],"study_design_scores_gemma":[0.0001163289,0.00029546817,0.00012703922,0.00016290201,0.000014623484,0.00005671697,5.129717e-7,0.57779026,0.007179018,0.40601036,0.007847493,0.0003992636],"about_ca_topic_score_codex":0.00001434503,"about_ca_topic_score_gemma":0.00005905291,"teacher_disagreement_score":0.7189367,"about_ca_system_score_codex":0.00018715061,"about_ca_system_score_gemma":0.00017388111,"threshold_uncertainty_score":0.99998015},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008483224,0.0012282771,0.98402876,0.004737653,0.0031163783,0.0012017937,0.000014688608,0.0007477223,0.004916225],"genre_scores_gemma":[0.010384791,0.000081086495,0.97528654,0.005180431,0.000905982,0.000056852674,0.000034491837,0.00011691024,0.007952931],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99305755,0.000064664244,0.00074573077,0.0029354251,0.002066296,0.001130358],"domain_scores_gemma":[0.9962812,0.00022813979,0.00038068846,0.002280952,0.00056894147,0.00026007948],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011393984,0.0011133072,0.00082815444,0.0011586304,0.00034263436,0.0015237604,0.0043899873,0.0005678237,0.00011083641],"category_scores_gemma":[0.0000543727,0.00097596884,0.0002980156,0.0010208861,0.00070299784,0.0009582907,0.0021819475,0.001747428,0.0002898533],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001407625,0.00045266308,0.000008774284,0.0009835153,0.000230105,0.003933067,0.0032271408,0.005210851,0.31692213,0.045197375,0.00919658,0.614497],"study_design_scores_gemma":[0.00025687137,0.00038444423,0.0000027885487,0.0009778019,0.000021192394,0.000037954338,4.580321e-8,0.40945563,0.5178108,0.06385091,0.006168144,0.0010334044],"about_ca_topic_score_codex":0.0000071442173,"about_ca_topic_score_gemma":0.000022418082,"teacher_disagreement_score":0.61346364,"about_ca_system_score_codex":0.0011839865,"about_ca_system_score_gemma":0.0008868219,"threshold_uncertainty_score":0.99951273},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010501842,0.00080950436,0.98311245,0.0011225517,0.008696729,0.00058944523,0.000018020484,0.00050011405,0.0050461837],"genre_scores_gemma":[0.55974674,0.0001943524,0.4074712,0.0073473365,0.0064990595,0.00014014084,0.000024207744,0.0002628548,0.018314127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587804,0.000019592651,0.0004908201,0.0020334239,0.00089792174,0.0006802202],"domain_scores_gemma":[0.99756676,0.00042924364,0.00023193976,0.0013200531,0.00028141012,0.00017059808],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00096047873,0.0005811343,0.00046631528,0.0011780706,0.00044284656,0.0015631893,0.0021199826,0.0005032592,0.00003747784],"category_scores_gemma":[0.00006947901,0.0005439743,0.00030569866,0.0009376571,0.00033945515,0.00094546675,0.000846272,0.0009308703,0.0003650542],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001898316,0.000021086486,0.000021427486,0.0001680284,0.000032590524,0.00004065872,0.0019669174,0.004411509,0.0014639253,0.01281296,0.0003681423,0.97867376],"study_design_scores_gemma":[0.00023336613,0.00033135212,0.00003223453,0.0004587325,0.000027988672,0.00011680427,9.907224e-8,0.67428046,0.012622732,0.2701902,0.04090478,0.00080120144],"about_ca_topic_score_codex":0.000064096785,"about_ca_topic_score_gemma":0.00022573654,"teacher_disagreement_score":0.97787255,"about_ca_system_score_codex":0.0004215484,"about_ca_system_score_gemma":0.00027648953,"threshold_uncertainty_score":0.9997012},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009295527,0.0014831456,0.97443795,0.00022005598,0.020638773,0.0005548772,0.000009708001,0.00059551705,0.0019670285],"genre_scores_gemma":[0.55443764,0.0004597994,0.4203249,0.0026740201,0.010290845,0.00043228368,0.00009592507,0.00023295904,0.011051633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964511,0.00002980075,0.00073696894,0.00096180034,0.0011497128,0.00067061797],"domain_scores_gemma":[0.9976532,0.00030618394,0.00019028547,0.0014358251,0.00025005703,0.00016448833],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001399978,0.00049160916,0.00050917047,0.0012703021,0.00013933433,0.0017055267,0.0027762223,0.00040391332,0.000004383049],"category_scores_gemma":[0.00011723779,0.0004009904,0.00013802771,0.001847749,0.00019958722,0.002182795,0.001188746,0.001000776,0.0005207995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042109073,0.000028718856,0.00014654228,0.0030264095,0.000037612688,0.0000962328,0.00266011,0.6694706,0.000042816624,0.005176724,0.0057743043,0.3135357],"study_design_scores_gemma":[0.00011640111,0.000065633954,0.00003307931,0.0013102518,0.0000069766365,0.000102042395,2.0987322e-7,0.9512386,0.000064589934,0.0022797151,0.044294573,0.00048792965],"about_ca_topic_score_codex":0.000022480746,"about_ca_topic_score_gemma":0.0000061924716,"teacher_disagreement_score":0.5543447,"about_ca_system_score_codex":0.00088991434,"about_ca_system_score_gemma":0.0019218114,"threshold_uncertainty_score":0.9998442},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009295527,0.0014831456,0.97443795,0.00022005598,0.020638773,0.0005548772,0.000009708001,0.00059551705,0.0019670285],"genre_scores_gemma":[0.55443764,0.0004597994,0.4203249,0.0026740201,0.010290845,0.00043228368,0.00009592507,0.00023295904,0.011051633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964511,0.00002980075,0.00073696894,0.00096180034,0.0011497128,0.00067061797],"domain_scores_gemma":[0.9976532,0.00030618394,0.00019028547,0.0014358251,0.00025005703,0.00016448833],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001399978,0.00049160916,0.00050917047,0.0012703021,0.00013933433,0.0017055267,0.0027762223,0.00040391332,0.000004383049],"category_scores_gemma":[0.00011723779,0.0004009904,0.00013802771,0.001847749,0.00019958722,0.002182795,0.001188746,0.001000776,0.0005207995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042109073,0.000028718856,0.00014654228,0.0030264095,0.000037612688,0.0000962328,0.00266011,0.6694706,0.000042816624,0.005176724,0.0057743043,0.3135357],"study_design_scores_gemma":[0.00011640111,0.000065633954,0.00003307931,0.0013102518,0.0000069766365,0.000102042395,2.0987322e-7,0.9512386,0.000064589934,0.0022797151,0.044294573,0.00048792965],"about_ca_topic_score_codex":0.000022480746,"about_ca_topic_score_gemma":0.0000061924716,"teacher_disagreement_score":0.5543447,"about_ca_system_score_codex":0.00088991434,"about_ca_system_score_gemma":0.0019218114,"threshold_uncertainty_score":0.9998442},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000111744885,0.0005705735,0.98546743,0.0074994783,0.00057085376,0.00076716184,0.000020401223,0.00020248722,0.0047898623],"genre_scores_gemma":[0.07043402,0.00019187399,0.90822136,0.0042453054,0.0017155189,0.0001000533,0.0000743882,0.00010118205,0.014916267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979845,0.000003461659,0.00030181784,0.0008723501,0.00046533698,0.00037250735],"domain_scores_gemma":[0.99869406,0.00020740918,0.00008736922,0.00062162126,0.00018748519,0.00020207306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003368975,0.0002887121,0.00040953487,0.0005146078,0.00010123303,0.000091230475,0.0004484432,0.00023819058,0.00009740526],"category_scores_gemma":[0.00007251044,0.00023219801,0.00017308889,0.0003474728,0.000654437,0.000055567583,0.0002835233,0.00063503394,0.000032299202],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006421132,0.00015299059,0.000031455733,0.0009427903,0.000121391575,0.0002555055,0.00035909493,0.0036310896,0.0057485863,0.090723835,0.007067157,0.89090186],"study_design_scores_gemma":[0.00088565965,0.0006374925,0.000021550644,0.003727225,0.00033182165,0.00029426918,8.52384e-7,0.56679285,0.012390575,0.15357012,0.2603667,0.0009808824],"about_ca_topic_score_codex":0.00002036786,"about_ca_topic_score_gemma":0.000014294575,"teacher_disagreement_score":0.889921,"about_ca_system_score_codex":0.00031159306,"about_ca_system_score_gemma":0.0004233636,"threshold_uncertainty_score":0.946876},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029301434,0.0012524308,0.98834425,0.0006449958,0.0024938735,0.0006981426,0.000100721845,0.00018232284,0.005990225],"genre_scores_gemma":[0.8394107,0.00030214622,0.15783857,0.0014382227,0.00072029757,0.00003192005,0.000030041412,0.0000810582,0.00014700321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959043,0.000054285425,0.00067715347,0.0015060538,0.0012564807,0.000601677],"domain_scores_gemma":[0.9965558,0.00052447617,0.0003411661,0.0022217236,0.00021857263,0.00013825644],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011243578,0.0005519605,0.0006338427,0.00082809303,0.00023982077,0.00045099005,0.00584081,0.0003490416,0.000017691149],"category_scores_gemma":[0.000052980587,0.00037767008,0.0004256347,0.0017500451,0.0013974119,0.0004963528,0.0027719943,0.0012983162,0.000018804367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059157544,0.00014981361,0.00019917575,0.0006893201,0.00008762764,0.00014095915,0.0044875625,0.0020432237,0.00037401816,0.8152958,0.00031314406,0.17616019],"study_design_scores_gemma":[0.0005206107,0.00010153926,0.00011873172,0.001357272,0.000023683382,0.00008399987,2.6623582e-7,0.06552088,0.0035921584,0.92593795,0.0021762261,0.00056668324],"about_ca_topic_score_codex":0.00005663934,"about_ca_topic_score_gemma":0.0003653997,"teacher_disagreement_score":0.8391177,"about_ca_system_score_codex":0.00008186277,"about_ca_system_score_gemma":0.000453884,"threshold_uncertainty_score":0.9998675},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014444534,0.001597229,0.9897933,0.005132385,0.0011416109,0.0005552701,0.0000068131394,0.00023344302,0.0013955273],"genre_scores_gemma":[0.7586737,0.0001005222,0.23354883,0.0054009943,0.0008973127,0.000117023454,0.000026506752,0.00011915491,0.0011159526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623513,0.000041878935,0.00055707677,0.0016407211,0.00086214265,0.00066303904],"domain_scores_gemma":[0.99731314,0.000732458,0.00024959404,0.0014737711,0.00012396352,0.00010709809],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070896675,0.00048378875,0.00036681336,0.000607071,0.00032977175,0.00093156885,0.0034998565,0.00024492983,0.000009584129],"category_scores_gemma":[0.000045823414,0.00037492847,0.00013566916,0.0014587322,0.00067492033,0.0005719007,0.00084424525,0.0013720802,0.00006822399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006677741,0.00005149683,0.00007050596,0.000070607835,0.0000076039873,0.000099591154,0.00037755392,0.16657795,0.0010144896,0.03727792,0.00018703041,0.7942586],"study_design_scores_gemma":[0.00019032245,0.00006306185,0.00014474017,0.000939165,0.000008688482,0.000036590256,1.8669243e-7,0.72981477,0.002001237,0.2606883,0.005533062,0.000579873],"about_ca_topic_score_codex":0.000011578684,"about_ca_topic_score_gemma":0.00010224279,"teacher_disagreement_score":0.7936787,"about_ca_system_score_codex":0.00035748933,"about_ca_system_score_gemma":0.0002890016,"threshold_uncertainty_score":0.99987024},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004153576,0.005174418,0.99010867,0.0000608543,0.0007981292,0.00017145657,0.000029335622,0.00056935736,0.0026723933],"genre_scores_gemma":[0.93817806,0.00036329354,0.058598325,0.00029669676,0.0007241965,0.000008975336,0.000222005,0.0002445505,0.0013638891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708843,0.000020852422,0.0004059185,0.001339025,0.0005573473,0.0005884047],"domain_scores_gemma":[0.99843895,0.00034788827,0.00006869082,0.00094852166,0.00006888769,0.00012703288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008170722,0.00054420205,0.00055303244,0.0005459511,0.00017939613,0.0004237155,0.0015492364,0.00030969444,0.000029507377],"category_scores_gemma":[0.00009123626,0.00051591615,0.00010887454,0.00040281963,0.00017766788,0.000281903,0.0009904568,0.0015610649,0.000069390866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001789304,0.000004371662,0.000009646465,0.00019532861,0.00006987278,0.000034046272,0.00030084033,0.66358024,0.0030074297,0.000024398463,0.00004957318,0.33272246],"study_design_scores_gemma":[0.0001323726,0.0000324559,6.4421096e-7,0.0005651257,0.00008369057,0.000009925093,5.220967e-7,0.99521804,0.00063992833,0.0013448438,0.0014222832,0.0005501885],"about_ca_topic_score_codex":0.00005263858,"about_ca_topic_score_gemma":0.00003464212,"teacher_disagreement_score":0.93776274,"about_ca_system_score_codex":0.00024037226,"about_ca_system_score_gemma":0.000088545145,"threshold_uncertainty_score":0.9997292},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030431158,0.000948706,0.9882805,0.0017379755,0.005453312,0.00045132817,0.0000042548977,0.0001801142,0.0029133912],"genre_scores_gemma":[0.014611338,0.000026149044,0.98150015,0.0015982258,0.0016712858,0.000009091389,0.0000010243131,0.000054982527,0.0005277406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606717,0.000060684735,0.0005122657,0.0014497936,0.001110657,0.00079940766],"domain_scores_gemma":[0.9978072,0.00031115566,0.00021015454,0.0013619779,0.00015314887,0.00015635755],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014225002,0.0005547515,0.00047157065,0.00043744157,0.0004667974,0.0015155118,0.003896179,0.00025410645,0.000019820045],"category_scores_gemma":[0.000053822303,0.0003433032,0.00025645515,0.00083163014,0.0004909141,0.00069602544,0.0025382654,0.0011943834,0.00004325102],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030142648,0.000013473289,0.0000012047204,0.000038935526,0.000018659619,0.00017860076,0.0006715619,0.015357084,0.00089566683,0.08945524,0.000011639477,0.89335495],"study_design_scores_gemma":[0.00006308183,0.00005724672,0.0000016320375,0.00022692846,0.000012463177,0.0001362311,2.2347187e-7,0.6540654,0.001006111,0.34006953,0.0040108827,0.0003503189],"about_ca_topic_score_codex":0.000016603919,"about_ca_topic_score_gemma":0.000006872269,"teacher_disagreement_score":0.8930046,"about_ca_system_score_codex":0.00021206762,"about_ca_system_score_gemma":0.00035082747,"threshold_uncertainty_score":0.9999019},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021006636,0.0002354958,0.99430627,0.000036918587,0.0007457739,0.00013362791,0.000019168428,0.000093166775,0.0042195087],"genre_scores_gemma":[0.21377334,0.000076609875,0.7849823,0.00016945357,0.00024368548,0.000006091821,0.000027666048,0.00008058564,0.0006402355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984203,0.0000035343116,0.00043078064,0.00039198028,0.00041574225,0.00033763875],"domain_scores_gemma":[0.999219,0.00013171697,0.00006572734,0.0004657574,0.00004278622,0.000075038406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031126724,0.00028292672,0.0005728512,0.0011772144,0.000037534974,0.00007339724,0.0005532874,0.00019618157,0.000056677625],"category_scores_gemma":[0.000016077278,0.0002473388,0.0002108719,0.0007555066,0.00015349002,0.00011119047,0.00016499638,0.00038396247,0.00001381474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.8886454e-7,0.0000033695492,0.0000021053056,0.00015317145,0.0001163518,0.0000151014165,0.00031106075,0.9289171,0.00008766482,0.027789123,0.0000014076559,0.04260302],"study_design_scores_gemma":[0.000044705237,0.000029372679,0.00005289779,0.00018979942,0.00020031807,0.000006410705,1.7918133e-7,0.93077415,0.00005719946,0.068393275,0.000024101386,0.00022756396],"about_ca_topic_score_codex":0.0000068569852,"about_ca_topic_score_gemma":0.00008918063,"teacher_disagreement_score":0.21356328,"about_ca_system_score_codex":0.00010296143,"about_ca_system_score_gemma":0.000052306845,"threshold_uncertainty_score":0.9999979},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009295527,0.0014831456,0.97443795,0.00022005598,0.020638773,0.0005548772,0.000009708001,0.00059551705,0.0019670285],"genre_scores_gemma":[0.55443764,0.0004597994,0.4203249,0.0026740201,0.010290845,0.00043228368,0.00009592507,0.00023295904,0.011051633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964511,0.00002980075,0.00073696894,0.00096180034,0.0011497128,0.00067061797],"domain_scores_gemma":[0.9976532,0.00030618394,0.00019028547,0.0014358251,0.00025005703,0.00016448833],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001399978,0.00049160916,0.00050917047,0.0012703021,0.00013933433,0.0017055267,0.0027762223,0.00040391332,0.000004383049],"category_scores_gemma":[0.00011723779,0.0004009904,0.00013802771,0.001847749,0.00019958722,0.002182795,0.001188746,0.001000776,0.0005207995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042109073,0.000028718856,0.00014654228,0.0030264095,0.000037612688,0.0000962328,0.00266011,0.6694706,0.000042816624,0.005176724,0.0057743043,0.3135357],"study_design_scores_gemma":[0.00011640111,0.000065633954,0.00003307931,0.0013102518,0.0000069766365,0.000102042395,2.0987322e-7,0.9512386,0.000064589934,0.0022797151,0.044294573,0.00048792965],"about_ca_topic_score_codex":0.000022480746,"about_ca_topic_score_gemma":0.0000061924716,"teacher_disagreement_score":0.5543447,"about_ca_system_score_codex":0.00088991434,"about_ca_system_score_gemma":0.0019218114,"threshold_uncertainty_score":0.9998442},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015879355,0.0018407225,0.9887275,0.0008610343,0.004310724,0.00030330013,0.000016142349,0.00033512965,0.0035895729],"genre_scores_gemma":[0.03476374,0.00017814098,0.95782614,0.0014875645,0.001874997,0.000008792755,0.000032860615,0.00010532303,0.0037224242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956435,0.000025116755,0.00062664255,0.001868306,0.0011629693,0.00067345076],"domain_scores_gemma":[0.9973084,0.00042437972,0.00018112772,0.0016771646,0.00019229628,0.0002166731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008481041,0.00055572414,0.0004934998,0.00089810695,0.00034544934,0.0009456764,0.0031809213,0.00037811953,0.000048091966],"category_scores_gemma":[0.000024516337,0.0004873993,0.00018102364,0.0009052523,0.00042050722,0.0010710327,0.0017797762,0.0011959136,0.00027150515],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000091488555,0.00003331384,0.0000062794115,0.00011765911,0.00002484996,0.00032471714,0.0011275266,0.011635103,0.0021204667,0.050791387,0.000095950665,0.9337136],"study_design_scores_gemma":[0.00014348222,0.000098491015,0.000016259095,0.00082956307,0.00001361624,0.00011955222,1.104609e-7,0.694223,0.00486631,0.29134932,0.007618061,0.00072222523],"about_ca_topic_score_codex":0.000025491261,"about_ca_topic_score_gemma":0.00006648303,"teacher_disagreement_score":0.9329914,"about_ca_system_score_codex":0.00025344777,"about_ca_system_score_gemma":0.0005902248,"threshold_uncertainty_score":0.99975777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005427585,0.00033383735,0.9708861,0.0023396458,0.0018920668,0.0004437142,0.00014496905,0.00018225552,0.023723146],"genre_scores_gemma":[0.4587648,0.00051817973,0.36315045,0.031274445,0.0048836344,0.00016714525,0.0016565998,0.000325571,0.13925919],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99346095,0.000059821006,0.0010431131,0.0017009886,0.0032632088,0.0004719393],"domain_scores_gemma":[0.9972819,0.0010564296,0.0002793129,0.0009093737,0.0003145673,0.0001584185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0046072397,0.00043740452,0.0005593387,0.001278752,0.00030662445,0.00063386693,0.0014370187,0.0002805914,0.00086846325],"category_scores_gemma":[0.00032509086,0.00033237395,0.0003634065,0.0008150546,0.0014730146,0.0010494161,0.0005076557,0.00062119256,0.0005753715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066593355,0.000039704697,0.000022683287,0.00012635079,0.0000673556,0.00013403741,0.0028163788,0.010038618,0.000054346132,0.47989398,0.001720032,0.5050199],"study_design_scores_gemma":[0.000193994,0.00009427353,0.00006664997,0.00019111329,0.00002182262,0.000026284273,0.00000575044,0.088416345,0.000055641416,0.7028222,0.20768617,0.0004197496],"about_ca_topic_score_codex":0.000059911865,"about_ca_topic_score_gemma":0.0003324005,"teacher_disagreement_score":0.60773563,"about_ca_system_score_codex":0.0004093812,"about_ca_system_score_gemma":0.00039892748,"threshold_uncertainty_score":0.99991286},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027118567,0.00016482561,0.9934729,0.0012992423,0.00086261693,0.00088962767,0.0000070484484,0.00028794463,0.00030398514],"genre_scores_gemma":[0.06652574,0.00002995683,0.9305288,0.002185441,0.00038714934,0.00008284443,0.000019139936,0.000044420638,0.00019647664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963654,0.000039768267,0.0006519595,0.0016289754,0.00073602016,0.0005778694],"domain_scores_gemma":[0.99824816,0.00049725553,0.00018799135,0.000680989,0.00016362111,0.00022196732],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001269503,0.00043252078,0.0004377509,0.0010405463,0.00022130029,0.0011522319,0.0013545004,0.00024008869,0.000011091836],"category_scores_gemma":[0.00026243963,0.00041361686,0.00007266193,0.00054649194,0.00029209346,0.0008669274,0.0014300611,0.0006055002,0.000015468382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031774116,0.000032328782,0.00004581148,0.000114647504,0.000005812143,0.00007896307,0.00242079,0.0013594747,0.061221607,0.0031992232,0.0001244719,0.9313937],"study_design_scores_gemma":[0.00024247197,0.00019159028,0.0001134283,0.0006050927,0.000006837704,0.00002679565,6.8590316e-7,0.9284033,0.031001844,0.038578395,0.00029796202,0.000531581],"about_ca_topic_score_codex":0.000037661714,"about_ca_topic_score_gemma":0.00010050749,"teacher_disagreement_score":0.9308621,"about_ca_system_score_codex":0.000388152,"about_ca_system_score_gemma":0.0002094198,"threshold_uncertainty_score":0.99988467},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074401393,0.00031062937,0.99116427,0.0021522862,0.0007963286,0.0006948758,0.000008334775,0.0004480042,0.0036812846],"genre_scores_gemma":[0.5556617,0.000009230408,0.44266844,0.0005218237,0.00030194793,0.00003691817,0.000016906195,0.00005480046,0.00072826876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606466,0.00003520569,0.0004905232,0.0017758638,0.0010199534,0.0006137845],"domain_scores_gemma":[0.9975608,0.00034687144,0.00030535192,0.0013228293,0.0002962685,0.00016790806],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00057530846,0.00057098677,0.00050449744,0.00081373774,0.00040871635,0.0013981946,0.002063905,0.00022330425,0.000040163493],"category_scores_gemma":[0.00005129005,0.00047829413,0.000100006495,0.0008716362,0.00053981284,0.0006834109,0.0006925442,0.0011134038,0.00019678395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027440086,0.000043948494,0.00028201155,0.00023987044,0.00009438586,0.00023175601,0.0025102473,0.51590115,0.004830314,0.17634197,0.00004592622,0.29945096],"study_design_scores_gemma":[0.0004380094,0.00013132843,0.0004722235,0.0003890122,0.000029478164,0.000109680645,4.0257618e-7,0.87291723,0.000674035,0.123897865,0.0003619216,0.0005787801],"about_ca_topic_score_codex":0.00022831834,"about_ca_topic_score_gemma":0.00023997463,"teacher_disagreement_score":0.5549177,"about_ca_system_score_codex":0.00039589306,"about_ca_system_score_gemma":0.00047353577,"threshold_uncertainty_score":0.9997669},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028173275,0.0004004107,0.99432755,0.0023440209,0.00070849736,0.0015073209,0.000041099065,0.00014682164,0.00049610593],"genre_scores_gemma":[0.0338276,0.00006820359,0.9639625,0.0007296977,0.0005156166,0.00020498599,0.000042414857,0.000044618082,0.0006043709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973199,0.000007713979,0.00036860057,0.001457727,0.00038790828,0.0004581943],"domain_scores_gemma":[0.99826443,0.000810467,0.00014254116,0.00039694257,0.00027226857,0.00011333208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037854814,0.00037479933,0.00033736558,0.00042234207,0.00041092996,0.00038800773,0.0009269985,0.00020027315,0.0000017242785],"category_scores_gemma":[0.000017126154,0.00035018777,0.00014440864,0.0004098589,0.00039223506,0.0006129239,0.00021588067,0.0003772206,0.0000063879597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003386256,0.000037332098,0.000005902959,0.00018121238,0.000025188358,0.0000047538306,0.00032792732,0.051396247,0.0037021658,0.44600058,0.00023220791,0.49805263],"study_design_scores_gemma":[0.00020701057,0.00021629478,0.000024253723,0.00021267054,0.000014077294,0.000036612248,6.281095e-8,0.5782924,0.0010326505,0.41760203,0.0020671587,0.00029473598],"about_ca_topic_score_codex":0.0000017750087,"about_ca_topic_score_gemma":0.000018679519,"teacher_disagreement_score":0.5268962,"about_ca_system_score_codex":0.00021598185,"about_ca_system_score_gemma":0.00016070502,"threshold_uncertainty_score":0.99989504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006656488,0.00025262742,0.9942359,0.0015467705,0.0014636527,0.00096330384,0.000020547475,0.00043868055,0.00041289304],"genre_scores_gemma":[0.63045764,0.000011105873,0.36751965,0.00068439293,0.000264653,0.000053124426,0.00012314426,0.00008722013,0.0007990603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956855,0.00006051048,0.00070720754,0.0017510338,0.0009291003,0.00086660706],"domain_scores_gemma":[0.9976632,0.0007321405,0.0002778534,0.0006919521,0.00036407416,0.0002707792],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010597835,0.00059533294,0.00055947166,0.00084167905,0.0007445881,0.0012817895,0.0013555016,0.00031039515,0.000011166608],"category_scores_gemma":[0.00028192866,0.0005839808,0.00026320008,0.0013322794,0.0002589147,0.0005634356,0.00021167572,0.0010440222,0.000028442657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019439973,0.000021875787,0.000041704312,0.0001691963,0.000022383456,0.000046330555,0.001844171,0.7810671,0.0027425524,0.008648647,0.000015975624,0.20536068],"study_design_scores_gemma":[0.00035403616,0.00020548188,0.000095547104,0.0011996767,0.000036945577,0.000042203326,0.0000028061431,0.97033703,0.0069009596,0.018198762,0.001951205,0.00067537045],"about_ca_topic_score_codex":0.0001265402,"about_ca_topic_score_gemma":0.00065357157,"teacher_disagreement_score":0.629792,"about_ca_system_score_codex":0.00048256177,"about_ca_system_score_gemma":0.0006632385,"threshold_uncertainty_score":0.99975497},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011134684,0.0016149083,0.9810034,0.000020941632,0.005057716,0.00020634764,0.0000030788774,0.00037762357,0.010602533],"genre_scores_gemma":[0.99730134,0.00003660582,0.0009940142,0.00003789849,0.0011976879,0.000003664573,7.495132e-7,0.000048364494,0.0003796747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867207,0.0000048904035,0.00029040623,0.00047533662,0.00029224466,0.0002650735],"domain_scores_gemma":[0.9994737,0.00012943198,0.000040825227,0.00022838086,0.00005499523,0.00007269714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028535174,0.00025893757,0.00025888567,0.00045497023,0.0001189569,0.00034998727,0.00015981718,0.00030552747,0.000009395782],"category_scores_gemma":[0.000025255913,0.0002391108,0.000047967158,0.00027835666,0.00015776276,0.00013999853,0.00013509324,0.000654748,0.000042420743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001990806,9.0179975e-7,0.000010730677,0.00012599945,0.00001219981,0.000036920846,0.00016176682,0.044748783,0.0008023758,0.0004017743,0.000009052371,0.9536875],"study_design_scores_gemma":[0.00017863065,0.000090303074,0.000012709292,0.0012913644,0.000017075878,0.00024060854,5.798357e-7,0.94851,0.011993098,0.020505933,0.016534448,0.00062524545],"about_ca_topic_score_codex":0.000024754974,"about_ca_topic_score_gemma":0.00006216874,"teacher_disagreement_score":0.99618787,"about_ca_system_score_codex":0.00020085037,"about_ca_system_score_gemma":0.00004005478,"threshold_uncertainty_score":0.9750655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056128716,0.0019186616,0.9866121,0.0039152005,0.0019263023,0.0005162068,0.000022615939,0.0014684437,0.003059178],"genre_scores_gemma":[0.23551333,0.00006154506,0.7635321,0.00038944616,0.00018017448,0.000013553801,0.000015565753,0.00008653401,0.0002077577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932382,0.000041001407,0.0007326518,0.0030533716,0.0018011095,0.0011336398],"domain_scores_gemma":[0.9913289,0.001108739,0.00038051215,0.006692419,0.0002789479,0.00021050878],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0014316196,0.0009133343,0.0007282234,0.0016753606,0.00061674416,0.0019209252,0.026652917,0.00046656013,0.000021028312],"category_scores_gemma":[0.0033372636,0.0007052699,0.00013306986,0.001912152,0.00091253343,0.000513579,0.067723334,0.0022895474,0.00009413875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024346995,0.000045923243,0.000054697764,0.00007670618,0.000040344054,0.0008975211,0.00038285783,0.1103018,0.00014350784,0.008947692,0.00045689684,0.8786277],"study_design_scores_gemma":[0.00022242141,0.00026041074,0.000037714995,0.0017333238,0.000013298706,0.00024328887,3.7035431e-7,0.7832022,0.00090909854,0.21171407,0.00096044573,0.00070336595],"about_ca_topic_score_codex":0.000047293153,"about_ca_topic_score_gemma":0.0002446768,"teacher_disagreement_score":0.8779243,"about_ca_system_score_codex":0.0007020803,"about_ca_system_score_gemma":0.0004727543,"threshold_uncertainty_score":0.99953985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009295527,0.0014831456,0.97443795,0.00022005598,0.020638773,0.0005548772,0.000009708001,0.00059551705,0.0019670285],"genre_scores_gemma":[0.55443764,0.0004597994,0.4203249,0.0026740201,0.010290845,0.00043228368,0.00009592507,0.00023295904,0.011051633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964511,0.00002980075,0.00073696894,0.00096180034,0.0011497128,0.00067061797],"domain_scores_gemma":[0.9976532,0.00030618394,0.00019028547,0.0014358251,0.00025005703,0.00016448833],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001399978,0.00049160916,0.00050917047,0.0012703021,0.00013933433,0.0017055267,0.0027762223,0.00040391332,0.000004383049],"category_scores_gemma":[0.00011723779,0.0004009904,0.00013802771,0.001847749,0.00019958722,0.002182795,0.001188746,0.001000776,0.0005207995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042109073,0.000028718856,0.00014654228,0.0030264095,0.000037612688,0.0000962328,0.00266011,0.6694706,0.000042816624,0.005176724,0.0057743043,0.3135357],"study_design_scores_gemma":[0.00011640111,0.000065633954,0.00003307931,0.0013102518,0.0000069766365,0.000102042395,2.0987322e-7,0.9512386,0.000064589934,0.0022797151,0.044294573,0.00048792965],"about_ca_topic_score_codex":0.000022480746,"about_ca_topic_score_gemma":0.0000061924716,"teacher_disagreement_score":0.5543447,"about_ca_system_score_codex":0.00088991434,"about_ca_system_score_gemma":0.0019218114,"threshold_uncertainty_score":0.9998442},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090785464,0.0003114787,0.98950166,0.0027778235,0.0023882855,0.0004113875,0.000046909317,0.00014808433,0.0035065424],"genre_scores_gemma":[0.77822906,0.00008387173,0.21788064,0.002437934,0.0011522876,0.000017582688,0.00005990005,0.000051128653,0.00008758263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959572,0.000053245833,0.00055771775,0.0015883486,0.0013686843,0.00047479264],"domain_scores_gemma":[0.9966154,0.00069024984,0.00028382472,0.0020578455,0.0002456702,0.000107023494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013055743,0.0004911415,0.0004365284,0.0008023641,0.00027437703,0.00043646354,0.0031850704,0.00020172751,0.00009094454],"category_scores_gemma":[0.00013374924,0.00034738486,0.0002286111,0.0012278261,0.0027019195,0.00047578724,0.0016312515,0.0011752589,0.000113557566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011631106,0.000041167994,0.000014975196,0.000054914562,0.00001731195,0.000013048855,0.0004173509,0.003659466,0.0002209223,0.9699795,0.00022251393,0.025347145],"study_design_scores_gemma":[0.000103190316,0.00015813642,0.00034872483,0.00032044348,0.000009860913,0.000020926782,1.8986084e-7,0.0678111,0.002118944,0.9265143,0.002223325,0.00037083545],"about_ca_topic_score_codex":0.000026021024,"about_ca_topic_score_gemma":0.000061117236,"teacher_disagreement_score":0.7773212,"about_ca_system_score_codex":0.00013982151,"about_ca_system_score_gemma":0.00028553943,"threshold_uncertainty_score":0.99989784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034659843,0.0010051241,0.9860222,0.001967398,0.0027485446,0.00052890077,0.0000063908838,0.00034308294,0.007343744],"genre_scores_gemma":[0.01963641,0.000027732118,0.9726889,0.0025001636,0.00084113516,0.000022350341,0.000032479824,0.00007736172,0.0041734674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966228,0.000032641576,0.00042122623,0.0015073925,0.0007792068,0.00063674804],"domain_scores_gemma":[0.9981565,0.00037580126,0.00023642897,0.0008050298,0.0002638557,0.0001624041],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008104217,0.0004958088,0.00042974137,0.00082460477,0.00037306632,0.001404693,0.001725311,0.000377969,0.0000121947205],"category_scores_gemma":[0.00009904933,0.0004636386,0.00014847046,0.00076683535,0.00029604862,0.00058188813,0.0006006548,0.00062918453,0.00004036458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013028874,0.000040570594,0.000008343469,0.00013215006,0.000026297796,0.000081172635,0.0025273424,0.03797232,0.004500154,0.29589966,0.0001860888,0.65861285],"study_design_scores_gemma":[0.000398658,0.00017039914,0.0000063465945,0.0004489776,0.000011688177,0.00008772714,6.124605e-7,0.65277857,0.0013455343,0.31839547,0.025735982,0.00062004017],"about_ca_topic_score_codex":0.000004493657,"about_ca_topic_score_gemma":0.000039756946,"teacher_disagreement_score":0.65799284,"about_ca_system_score_codex":0.0003844306,"about_ca_system_score_gemma":0.00034177816,"threshold_uncertainty_score":0.99978155},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000395598,0.0010467973,0.98685634,0.0004056421,0.0023815632,0.001369196,0.000007491784,0.0005745844,0.0073544267],"genre_scores_gemma":[0.07973132,0.000024247705,0.91673356,0.0019168817,0.00043184066,0.00013587032,0.0000110246165,0.0001063004,0.00090894714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941435,0.00003555169,0.0007010624,0.0028013324,0.001188335,0.0011302516],"domain_scores_gemma":[0.99669564,0.00035284096,0.0002784807,0.0021683576,0.00021898797,0.00028569956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066862704,0.0009255853,0.0007736868,0.0015219565,0.00026104343,0.0010153496,0.005186546,0.000474618,0.000014614665],"category_scores_gemma":[0.000043796,0.0008123809,0.00031961227,0.0017335167,0.0008988532,0.0008089312,0.0023465275,0.0018204914,0.000047859827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027260292,0.000049083115,0.000012058556,0.00021091013,0.00002593601,0.00019536915,0.00041755676,0.6045881,0.00007546662,0.028588988,0.00003143711,0.36577788],"study_design_scores_gemma":[0.00018338641,0.00021399184,0.00000563405,0.0005481695,0.000010477028,0.000085476786,8.3130345e-8,0.7812533,0.00025076256,0.21563491,0.0010929719,0.00072084024],"about_ca_topic_score_codex":0.0000104784995,"about_ca_topic_score_gemma":0.00006648053,"teacher_disagreement_score":0.36505702,"about_ca_system_score_codex":0.0003162613,"about_ca_system_score_gemma":0.00041083957,"threshold_uncertainty_score":0.9994327},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009181231,0.00041217823,0.9904312,0.0007484712,0.0018338095,0.0016409656,0.0000038284093,0.000306512,0.004531225],"genre_scores_gemma":[0.4158787,0.000055414785,0.57618475,0.0020358001,0.0006900023,0.0002217334,0.000065936816,0.00011615374,0.0047515314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624294,0.000046841375,0.00060185837,0.0015223688,0.00096059224,0.00062540337],"domain_scores_gemma":[0.9982466,0.00045409272,0.00030874048,0.0005878781,0.0002384031,0.00016425419],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011599325,0.00050245126,0.00044522138,0.0008014213,0.00043745004,0.001101695,0.0014006963,0.00022580892,0.000035328663],"category_scores_gemma":[0.00011207369,0.00047946017,0.00019016679,0.0005273307,0.00037493056,0.00053870777,0.0007335401,0.0008834704,0.00013577554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005136099,0.00005978612,0.00012357124,0.00048247172,0.00008303848,0.00012894208,0.004318103,0.10249604,0.00429692,0.08505522,0.00006900752,0.8028355],"study_design_scores_gemma":[0.0005173548,0.00056156435,0.000041944026,0.000630849,0.000027424127,0.00007462136,0.0000035877142,0.93342835,0.0014078869,0.053886212,0.008691721,0.0007285159],"about_ca_topic_score_codex":0.000013442499,"about_ca_topic_score_gemma":0.000033211378,"teacher_disagreement_score":0.83093226,"about_ca_system_score_codex":0.00042751202,"about_ca_system_score_gemma":0.00044974053,"threshold_uncertainty_score":0.99993527},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006107774,0.00046780542,0.97518307,0.0005803661,0.005103712,0.00040369734,0.00002007108,0.00007316775,0.018107036],"genre_scores_gemma":[0.99450696,0.000017579237,0.0020750612,0.0019830805,0.00089387276,0.00002006502,0.000059352686,0.000028053968,0.00041595253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997773,0.00006203678,0.0002909939,0.0008484693,0.0007045632,0.00032096842],"domain_scores_gemma":[0.99923915,0.00013826546,0.000103968436,0.00027867223,0.00013250962,0.00010742827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010605437,0.0003119878,0.00025084495,0.00052484765,0.00016140961,0.00011938804,0.00023330233,0.00029090236,0.00044775606],"category_scores_gemma":[0.000021619828,0.00027410188,0.00009138929,0.00013551877,0.00037366984,0.000035980895,0.00011171986,0.0008013563,0.000064918575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013345985,0.00013989586,0.00043600556,0.00006756446,0.00007773858,0.00013953482,0.0005714988,0.029673805,0.000021567019,0.012552569,0.00078067003,0.9554057],"study_design_scores_gemma":[0.002787329,0.0014549452,0.0073682796,0.0021427572,0.00012886195,0.0000610509,0.0000019130857,0.8027342,0.00006858432,0.14738853,0.034169186,0.0016943571],"about_ca_topic_score_codex":0.00008069452,"about_ca_topic_score_gemma":0.00048641773,"teacher_disagreement_score":0.9944459,"about_ca_system_score_codex":0.00016377776,"about_ca_system_score_gemma":0.00014914476,"threshold_uncertainty_score":0.9999711},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040010456,0.00016801544,0.9935468,0.0005735114,0.00051552884,0.00033321467,0.0000041153567,0.0006648864,0.0037938647],"genre_scores_gemma":[0.95177674,0.000039144194,0.046121188,0.00046633932,0.00032115247,0.00003354993,0.0000067221736,0.000041285486,0.0011938863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973502,0.000025417798,0.0003528582,0.0014041121,0.00051715266,0.00035024947],"domain_scores_gemma":[0.9986626,0.00015828574,0.00019714145,0.0007551788,0.00010023663,0.00012656594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044124835,0.0004161468,0.00029885294,0.0010855407,0.00061379286,0.000641032,0.000899779,0.0002087241,0.000017694041],"category_scores_gemma":[0.000016788206,0.00038264613,0.00011038454,0.00046942703,0.00027976488,0.00027361582,0.00044127443,0.0011145495,0.000040097893],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007197334,0.000031537897,0.000035561123,0.000068058536,0.000010600287,0.000049162874,0.00009987995,0.010708971,0.003948939,0.036467224,0.000011249084,0.9485616],"study_design_scores_gemma":[0.000109125926,0.00045052476,0.00008083673,0.00019255585,0.000011185179,0.00007235372,5.6212087e-8,0.86659163,0.0397788,0.084376976,0.007879204,0.00045672574],"about_ca_topic_score_codex":0.000044843993,"about_ca_topic_score_gemma":0.000084970445,"teacher_disagreement_score":0.9513766,"about_ca_system_score_codex":0.0002778913,"about_ca_system_score_gemma":0.00009468553,"threshold_uncertainty_score":0.99986255},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03163851,0.004549076,0.5845195,0.08342365,0.015258729,0.007134782,0.0069872695,0.0005102583,0.26597822],"genre_scores_gemma":[0.9885924,0.00021789507,0.00033261935,0.008465466,0.00032006353,0.000046924717,0.000894229,0.000031740412,0.0010987048],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980124,0.00003051837,0.0002696152,0.00065704266,0.00072947604,0.00030092857],"domain_scores_gemma":[0.9988235,0.00020424709,0.00009295141,0.0008348543,0.000008832733,0.00003559497],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010593182,0.00021717681,0.00013741803,0.00010443396,0.00020000506,0.00040236916,0.0018053676,0.00011153747,0.0026458795],"category_scores_gemma":[0.00004176831,0.00012446832,0.000050218296,0.00055635173,0.0010706548,0.00017882847,0.0006612043,0.00055612193,0.0014405733],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040092567,0.00027453905,0.0027507516,0.00015096138,0.000032791217,0.0004143286,0.012541028,0.017231075,0.0021666563,0.0899319,0.07524148,0.79922444],"study_design_scores_gemma":[0.00038957267,0.00015424263,0.0491402,0.00031108444,0.00005134984,0.00020469922,0.00004339726,0.035018943,0.00071255723,0.1597225,0.75294167,0.0013098],"about_ca_topic_score_codex":0.00022281465,"about_ca_topic_score_gemma":0.0030395517,"teacher_disagreement_score":0.9569538,"about_ca_system_score_codex":0.0005481184,"about_ca_system_score_gemma":0.00002762047,"threshold_uncertainty_score":0.9993369},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012725493,0.00023662062,0.9953293,0.0016322336,0.0009817715,0.0007282077,0.000058433645,0.00020236592,0.0007038116],"genre_scores_gemma":[0.33179823,0.00007508928,0.6652592,0.0018199992,0.00026811572,0.00007913618,0.00014665589,0.00006162249,0.00049196754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968951,0.000037444934,0.00050492265,0.0014738764,0.0006478012,0.00044087053],"domain_scores_gemma":[0.9981016,0.0006796367,0.00029854727,0.00043416375,0.00033123244,0.00015483995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090968655,0.00045512491,0.0004399949,0.0013516041,0.00032018742,0.0007106071,0.0007305267,0.00032399708,0.000020111385],"category_scores_gemma":[0.0001326858,0.00043582628,0.00017769143,0.00073068636,0.00038658155,0.0008867499,0.0002585679,0.0005308299,0.000028540193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031424333,0.00007055419,0.0000020678858,0.00012587555,0.000049526596,0.000039032577,0.0017677923,0.10355103,0.00051744364,0.0076235854,0.00005907455,0.8861626],"study_design_scores_gemma":[0.00079496496,0.00030834897,0.000002464291,0.0006490028,0.000054636123,0.000020870593,0.0000033049887,0.90719783,0.0019057564,0.08841828,0.00014641558,0.0004981407],"about_ca_topic_score_codex":0.000018639528,"about_ca_topic_score_gemma":0.000066662134,"teacher_disagreement_score":0.88566446,"about_ca_system_score_codex":0.0003406506,"about_ca_system_score_gemma":0.0003317294,"threshold_uncertainty_score":0.9998093},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028614015,0.001513912,0.98822623,0.00012361514,0.0015579804,0.00009976714,0.0000027188125,0.0005656754,0.0050487053],"genre_scores_gemma":[0.9927919,0.000085935055,0.005470927,0.00012537639,0.0006196131,0.0000033700428,0.000015451744,0.000082376384,0.0008050819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980468,0.0000072303737,0.00034283425,0.0007011297,0.00048296523,0.0004190247],"domain_scores_gemma":[0.99935263,0.000105242514,0.00004603823,0.00032523554,0.00006534144,0.00010551933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025628574,0.00040898478,0.00035853326,0.0006766171,0.00013458054,0.00027744262,0.0004908143,0.00027417953,0.000117884105],"category_scores_gemma":[0.000014527356,0.0003927303,0.00017691242,0.00034924378,0.00014930022,0.0001818585,0.00011835082,0.0013624472,0.00016149275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.999377e-7,0.0000017565135,0.000008749689,0.000045707897,0.000017739387,0.000028358483,0.00017926621,0.7258714,0.00044780373,0.000023813043,0.0000027542983,0.27337176],"study_design_scores_gemma":[0.00006144581,0.000030645097,0.000020520658,0.00021316456,0.00003624056,0.000022041457,3.8918296e-7,0.9940663,0.00022600446,0.0044637546,0.0004473142,0.00041218897],"about_ca_topic_score_codex":0.000022727567,"about_ca_topic_score_gemma":0.000045828016,"teacher_disagreement_score":0.98993045,"about_ca_system_score_codex":0.00020716955,"about_ca_system_score_gemma":0.000042269265,"threshold_uncertainty_score":0.9998525},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016906706,0.0005660233,0.99512124,0.00087645056,0.0010947282,0.0010415856,0.00000974237,0.000300382,0.00082077004],"genre_scores_gemma":[0.5531175,0.00009409737,0.4448919,0.0009245536,0.00046145104,0.00013666124,0.000007311007,0.000055760993,0.0003107494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969919,0.000011277034,0.00039538098,0.0016111862,0.00047476517,0.00051553984],"domain_scores_gemma":[0.9981797,0.0005882198,0.00014515597,0.00079687935,0.00015117244,0.0001388979],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034483007,0.00044781473,0.00036733862,0.0005832052,0.0003559546,0.00036602624,0.0012207555,0.00025733167,0.0000035284065],"category_scores_gemma":[0.000028800467,0.00040844182,0.00013006099,0.00068253046,0.00039417567,0.00041439448,0.00023979112,0.00055832625,0.000015816988],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112174075,0.000010828569,5.2343125e-7,0.00007725202,0.0000046371993,0.0000054182274,0.00018882242,0.016454104,0.013092983,0.007657853,0.0000024953952,0.96249384],"study_design_scores_gemma":[0.00026826427,0.00030843102,0.00000986677,0.00028961722,0.000013864182,0.000023315806,9.133742e-8,0.58107436,0.12302092,0.2914551,0.0030173166,0.0005188542],"about_ca_topic_score_codex":0.0000039697275,"about_ca_topic_score_gemma":0.00010619006,"teacher_disagreement_score":0.96197504,"about_ca_system_score_codex":0.00020578541,"about_ca_system_score_gemma":0.00022212157,"threshold_uncertainty_score":0.99983674},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029634606,0.00080443965,0.9952172,0.0010689026,0.0006583696,0.00086547644,0.00071612175,0.00015304785,0.00048682195],"genre_scores_gemma":[0.6013475,0.000013139362,0.39747924,0.00046020997,0.0002063663,0.00005474471,0.00029057154,0.000048569687,0.00009967951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674565,0.00002468927,0.0005826677,0.0014673339,0.00067237316,0.00050726393],"domain_scores_gemma":[0.995375,0.0025786192,0.0003152975,0.0014723504,0.00011541127,0.00014335144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071982393,0.00044660122,0.0005242923,0.0007393411,0.0001904278,0.00039032698,0.0029107358,0.00021664088,0.000010237322],"category_scores_gemma":[0.00024620816,0.0004147055,0.00013803986,0.0005545322,0.0006927061,0.00051003153,0.0012082345,0.00066238415,0.00001906277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008423173,0.000047598125,0.000019941388,0.00028110878,0.00004066575,0.00007818734,0.0050298567,0.38418737,0.00022367577,0.52853054,0.00031351633,0.08123912],"study_design_scores_gemma":[0.00015686656,0.000089874105,0.000004120073,0.0003322515,0.000012820744,0.000017824968,0.0000011423114,0.62004656,0.00021126284,0.3785673,0.00027179136,0.0002882],"about_ca_topic_score_codex":0.00021268359,"about_ca_topic_score_gemma":0.00007110508,"teacher_disagreement_score":0.6013179,"about_ca_system_score_codex":0.00036750868,"about_ca_system_score_gemma":0.00037827052,"threshold_uncertainty_score":0.9998305},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053959243,0.005517722,0.93958825,0.00011480383,0.00022708213,0.00007787293,0.0000037238312,0.000037918224,0.0004733878],"genre_scores_gemma":[0.9943368,0.00013068735,0.005245919,0.00005967099,0.0001668251,0.0000013191305,0.0000039263823,0.000013010702,0.000041871084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913,0.000007863592,0.0001949086,0.00027775884,0.00025395822,0.00013547619],"domain_scores_gemma":[0.999604,0.00012078593,0.000027511629,0.00020907301,0.000020062924,0.000018593537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040889328,0.00014429986,0.0001867771,0.0006288301,0.00003134061,0.00010855671,0.0002405609,0.00009385221,0.00000216925],"category_scores_gemma":[0.000022239385,0.00010455979,0.000039549228,0.00044973614,0.00008825277,0.00006361481,0.000064133535,0.00032597638,0.0000022554657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.6550313e-7,0.0000020492314,0.00002279722,0.000058437323,0.0000048160455,0.000015013294,0.0015400182,0.7540712,0.0005630935,0.000116993375,0.000004867677,0.24360047],"study_design_scores_gemma":[0.000030845767,0.000013598255,0.00003826769,0.00020132276,0.000011702736,0.0000069895787,0.0000011730716,0.99645036,0.0008449151,0.002271022,0.000017035629,0.00011277433],"about_ca_topic_score_codex":0.000057596702,"about_ca_topic_score_gemma":0.0001451613,"teacher_disagreement_score":0.94037753,"about_ca_system_score_codex":0.000047641246,"about_ca_system_score_gemma":0.000020311201,"threshold_uncertainty_score":0.42638245},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009295527,0.0014831456,0.97443795,0.00022005598,0.020638773,0.0005548772,0.000009708001,0.00059551705,0.0019670285],"genre_scores_gemma":[0.55443764,0.0004597994,0.4203249,0.0026740201,0.010290845,0.00043228368,0.00009592507,0.00023295904,0.011051633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964511,0.00002980075,0.00073696894,0.00096180034,0.0011497128,0.00067061797],"domain_scores_gemma":[0.9976532,0.00030618394,0.00019028547,0.0014358251,0.00025005703,0.00016448833],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001399978,0.00049160916,0.00050917047,0.0012703021,0.00013933433,0.0017055267,0.0027762223,0.00040391332,0.000004383049],"category_scores_gemma":[0.00011723779,0.0004009904,0.00013802771,0.001847749,0.00019958722,0.002182795,0.001188746,0.001000776,0.0005207995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042109073,0.000028718856,0.00014654228,0.0030264095,0.000037612688,0.0000962328,0.00266011,0.6694706,0.000042816624,0.005176724,0.0057743043,0.3135357],"study_design_scores_gemma":[0.00011640111,0.000065633954,0.00003307931,0.0013102518,0.0000069766365,0.000102042395,2.0987322e-7,0.9512386,0.000064589934,0.0022797151,0.044294573,0.00048792965],"about_ca_topic_score_codex":0.000022480746,"about_ca_topic_score_gemma":0.0000061924716,"teacher_disagreement_score":0.5543447,"about_ca_system_score_codex":0.00088991434,"about_ca_system_score_gemma":0.0019218114,"threshold_uncertainty_score":0.9998442},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006215532,0.00048761186,0.9905412,0.0019561092,0.0017963651,0.0005428433,0.000050142055,0.00037852264,0.004185046],"genre_scores_gemma":[0.061940566,0.00003166512,0.93316007,0.003701208,0.00068145007,0.000034300938,0.00006953928,0.00006235968,0.00031883118],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959318,0.000022722896,0.0004271077,0.0019377258,0.0010485264,0.00063210964],"domain_scores_gemma":[0.9977124,0.00028507618,0.00013509451,0.0012284847,0.0002473012,0.00039167923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047682325,0.0005736484,0.0004555837,0.0012737712,0.00030631066,0.0009981085,0.0022279136,0.00027084432,0.000025324733],"category_scores_gemma":[0.00002680427,0.00047557201,0.0001416826,0.0016471768,0.0004461439,0.0007347484,0.0013080665,0.0009894524,0.0002279597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039516002,0.00009540109,0.000050510727,0.00016439777,0.000070427865,0.0004887014,0.0029838963,0.2178959,0.000052825628,0.3862876,0.0014607548,0.39041007],"study_design_scores_gemma":[0.00038166664,0.0007403124,0.00021375155,0.00096801546,0.0000377561,0.00026331245,9.858334e-7,0.38751113,0.00008570585,0.5883257,0.020035148,0.0014365545],"about_ca_topic_score_codex":0.000039271552,"about_ca_topic_score_gemma":0.00037881322,"teacher_disagreement_score":0.3889735,"about_ca_system_score_codex":0.00018014318,"about_ca_system_score_gemma":0.00054288056,"threshold_uncertainty_score":0.99976957},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020087034,0.00043661718,0.99299085,0.0013802983,0.0018159372,0.0002433911,0.000015272464,0.00039482073,0.0025219566],"genre_scores_gemma":[0.8565401,0.00002653094,0.14119674,0.00067006954,0.0012290252,0.00001344758,0.000044687506,0.00009938136,0.00018005019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774903,0.000013103086,0.00049220346,0.00082790863,0.0005323861,0.0003853977],"domain_scores_gemma":[0.9989325,0.00013719895,0.000058434456,0.0006138013,0.00011455625,0.00014354264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005358246,0.00041287922,0.00038379425,0.00080755365,0.00009722399,0.00027292827,0.0005618174,0.00025758886,0.000044723503],"category_scores_gemma":[0.000018295219,0.000395094,0.00019840455,0.00053597894,0.00013660337,0.00014103715,0.00006396024,0.0006483207,0.00021461211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004390565,0.000007045193,0.0000016130296,0.00009198366,0.000016040269,0.000013276902,0.00038577954,0.81887597,0.0027650506,0.00031449762,0.00005741259,0.17746691],"study_design_scores_gemma":[0.00009452772,0.000041080286,0.00000666615,0.00034848324,0.000040508046,0.0000049789205,3.080727e-7,0.9705594,0.0019217499,0.025866365,0.00068204256,0.00043384187],"about_ca_topic_score_codex":0.000015402487,"about_ca_topic_score_gemma":0.00006736946,"teacher_disagreement_score":0.8563392,"about_ca_system_score_codex":0.00031760058,"about_ca_system_score_gemma":0.00008740511,"threshold_uncertainty_score":0.9998501},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014260557,0.00082051,0.99280673,0.00056894956,0.0014597405,0.0006559315,0.0000066893376,0.00021468442,0.0033241857],"genre_scores_gemma":[0.68302006,0.0005528272,0.30459464,0.0022554395,0.0011937475,0.00017526849,0.000019452322,0.0001617897,0.0080268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995728,0.000032832053,0.0006005545,0.0020876408,0.0008148983,0.00073608034],"domain_scores_gemma":[0.9977585,0.00042660808,0.00021138975,0.0014022166,0.000041119947,0.00016014905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042648058,0.0005689192,0.00047962746,0.0006736548,0.00018506445,0.00037842928,0.0026026545,0.00034359162,0.000021986392],"category_scores_gemma":[0.00003168703,0.0005691345,0.000121808,0.0010078376,0.0006322993,0.00062162435,0.0016688925,0.0012173727,0.00026298183],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007649415,0.00003118428,0.000021780312,0.000033594264,0.000010317758,0.00018991811,0.0002099685,0.0529416,0.0020232252,0.027540449,0.000009005586,0.9169813],"study_design_scores_gemma":[0.00027509604,0.00012868855,0.00019644682,0.00032779857,0.000009191246,0.00011258853,1.2699915e-7,0.61030346,0.006556757,0.3707645,0.0105226915,0.00080264435],"about_ca_topic_score_codex":0.000027068081,"about_ca_topic_score_gemma":0.00029167754,"teacher_disagreement_score":0.91617864,"about_ca_system_score_codex":0.00081551744,"about_ca_system_score_gemma":0.00018722774,"threshold_uncertainty_score":0.999676},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010377716,0.0023665987,0.9921328,0.00078971713,0.0028956938,0.0009650731,0.000010687215,0.0004578848,0.0003712145],"genre_scores_gemma":[0.008592881,0.00017668621,0.9866714,0.0025594553,0.00048208918,0.000039523933,0.00000789471,0.00008057396,0.0013894986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99522537,0.00003713447,0.00075170374,0.0024022814,0.00077267113,0.0008108681],"domain_scores_gemma":[0.99751514,0.00043934575,0.00027234768,0.0012001146,0.00035495008,0.00021807117],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011413851,0.0006944474,0.0007097637,0.00082244724,0.00042031705,0.0011153163,0.0025714433,0.00024884756,0.000021165393],"category_scores_gemma":[0.000079072815,0.00061101356,0.00027645665,0.0008492487,0.00030889874,0.0012119943,0.0014351488,0.0010246529,0.000098895434],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004423314,0.00002870033,0.000009585075,0.00036202348,0.000010922318,0.000016052807,0.0005418886,0.0050708535,0.00018022016,0.01260494,0.000018301631,0.9811521],"study_design_scores_gemma":[0.00024776283,0.000116282026,0.000010986696,0.001546299,0.000012564613,0.00006853363,3.44425e-7,0.8005202,0.0004912858,0.18628424,0.010075572,0.0006259329],"about_ca_topic_score_codex":0.000012933123,"about_ca_topic_score_gemma":0.00007634648,"teacher_disagreement_score":0.98052615,"about_ca_system_score_codex":0.0004803214,"about_ca_system_score_gemma":0.00042139328,"threshold_uncertainty_score":0.9999216},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02121243,0.0043116603,0.9703809,0.000016735392,0.002462292,0.000513206,0.00001628253,0.000064514046,0.0010219666],"genre_scores_gemma":[0.9907439,0.000048950635,0.008980101,0.000019143674,0.00014370987,0.000007581213,0.0000071856343,0.00003126661,0.00001820831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986532,0.000024126988,0.00034401153,0.0003389572,0.0004323886,0.00020731831],"domain_scores_gemma":[0.99905765,0.0002447163,0.00008702602,0.00035505515,0.00022135006,0.000034223853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001201972,0.00020926517,0.00026834162,0.00045810093,0.000030471072,0.00007933248,0.00037939838,0.0001805208,0.0000066446087],"category_scores_gemma":[0.000085351756,0.00015014356,0.00014402668,0.0005337703,0.00021689892,0.00014025178,0.00004756394,0.00040299547,0.0000010121686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070739975,0.000011279299,0.0007862446,0.00010943688,0.000008248071,5.297728e-7,0.0005437808,0.3850943,0.0027000108,0.0000027875892,0.000005303329,0.610731],"study_design_scores_gemma":[0.00010625463,0.00007957589,0.0017378905,0.0005010219,0.00002479111,0.0000078889725,4.2724486e-7,0.96112764,0.020802433,0.015416505,0.00004278847,0.00015281046],"about_ca_topic_score_codex":0.000051485727,"about_ca_topic_score_gemma":0.000042406646,"teacher_disagreement_score":0.9695314,"about_ca_system_score_codex":0.00026064223,"about_ca_system_score_gemma":0.0002411175,"threshold_uncertainty_score":0.6122677},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021041553,0.007516941,0.988557,0.000041995663,0.0030954347,0.00014895815,0.00003990942,0.00010944118,0.00027995228],"genre_scores_gemma":[0.98288584,0.00064782525,0.015262695,0.000057428813,0.00088744744,0.0000026948628,0.00010429238,0.000038597882,0.000113172595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846613,0.000005815153,0.0002943827,0.0006509153,0.0003003619,0.00028236673],"domain_scores_gemma":[0.9990197,0.00017199489,0.00007026967,0.0006221174,0.00005471499,0.000061230574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038943495,0.00024428472,0.00026304886,0.00014302027,0.000096613556,0.00014202693,0.0006652017,0.00027391769,0.0000026391835],"category_scores_gemma":[0.000037007787,0.0002334577,0.00003237825,0.00015708616,0.00032387656,0.00025944444,0.00048894173,0.0006717014,0.000002289083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010773894,0.000005344506,0.000020202004,0.00049381936,0.000014473692,0.00003104699,0.00049181754,0.61973256,0.0007990333,0.0007870046,0.000043024476,0.3775709],"study_design_scores_gemma":[0.000057136465,0.000018507732,0.000015779835,0.00071011693,0.000015373158,0.000008095809,1.8200878e-7,0.98464286,0.00030319873,0.013533743,0.0004529137,0.00024207242],"about_ca_topic_score_codex":0.000009969782,"about_ca_topic_score_gemma":0.00030528207,"teacher_disagreement_score":0.98267543,"about_ca_system_score_codex":0.00008481038,"about_ca_system_score_gemma":0.000050040966,"threshold_uncertainty_score":0.9520129},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005514296,0.00015089197,0.99236494,0.00048378573,0.0016161196,0.0015189339,0.000014017973,0.000120990975,0.0031788917],"genre_scores_gemma":[0.6241251,0.000009978741,0.37430614,0.00012831246,0.0004005735,0.00008023961,0.00001958842,0.00003001025,0.0009000295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681467,0.000074408454,0.00068790046,0.001467662,0.0006155443,0.00033983198],"domain_scores_gemma":[0.99704486,0.0010732858,0.00043611802,0.0007172103,0.00064972707,0.000078773446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009699089,0.00037474526,0.0006362132,0.0006873591,0.00020348113,0.00036994705,0.0013618818,0.00015070186,0.000013310879],"category_scores_gemma":[0.00014002829,0.00035017668,0.0001066652,0.00091817515,0.00023769625,0.00053217827,0.000757655,0.00058763963,0.000012251018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039480918,0.00029778373,0.00034638576,0.00017155363,0.00015530155,0.000024375859,0.06048045,0.22529404,0.00034806778,0.053830624,0.00012219435,0.6588898],"study_design_scores_gemma":[0.0005410829,0.0009145988,0.00007776058,0.00036750667,0.000027074377,0.000009576284,0.000030649484,0.91622204,0.0025598751,0.07739905,0.0013478819,0.0005029141],"about_ca_topic_score_codex":0.000017546789,"about_ca_topic_score_gemma":0.000061905346,"teacher_disagreement_score":0.690928,"about_ca_system_score_codex":0.00026570892,"about_ca_system_score_gemma":0.00047602726,"threshold_uncertainty_score":0.99989504},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044749733,0.00036696758,0.99177796,0.0007690259,0.0025026859,0.0006763104,0.000004758076,0.00017868765,0.0036788837],"genre_scores_gemma":[0.3129029,0.00013240644,0.68076175,0.00087489665,0.001688435,0.00007335412,0.0000138839405,0.00008709832,0.0034652879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966796,0.000034320517,0.00042720124,0.0016896335,0.0006646869,0.00050454034],"domain_scores_gemma":[0.9980761,0.00039082335,0.00019498217,0.0009031517,0.00031217886,0.00012278005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060416025,0.00044282054,0.00039967362,0.0006294306,0.00033149114,0.0010069164,0.0013127414,0.00027679658,0.000013253213],"category_scores_gemma":[0.00010167057,0.00038921088,0.00022614884,0.000533057,0.000308106,0.0011861206,0.00083758007,0.0004915468,0.000060637372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016539849,0.000018364502,8.623268e-7,0.000039611714,0.000016949672,0.000030799813,0.0006491184,0.21597143,0.004729487,0.017009754,0.000046312733,0.7614708],"study_design_scores_gemma":[0.00012581768,0.00011373834,0.0000030883593,0.00012026824,0.000012191341,0.000019930912,2.529576e-7,0.6370198,0.008151933,0.35347942,0.00067036547,0.00028317684],"about_ca_topic_score_codex":0.000047924703,"about_ca_topic_score_gemma":0.00011764163,"teacher_disagreement_score":0.7611876,"about_ca_system_score_codex":0.00023781479,"about_ca_system_score_gemma":0.00020084037,"threshold_uncertainty_score":0.999856},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032480017,0.0009258834,0.99121433,0.00053301913,0.0008752878,0.0006876204,0.000023362729,0.00081814284,0.0048898985],"genre_scores_gemma":[0.093305394,0.000028539469,0.90425617,0.0012114616,0.00056106277,0.000031942072,0.000051448053,0.00007889001,0.00047511692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952181,0.000045283483,0.0006562325,0.0022087104,0.0012003749,0.0006713056],"domain_scores_gemma":[0.997178,0.00024726323,0.00030435878,0.0016490745,0.00042168924,0.00019958017],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00096682913,0.0007074644,0.0006143109,0.0016482009,0.0002455507,0.0010792097,0.0030924412,0.0006825228,0.000026256703],"category_scores_gemma":[0.000061941675,0.00064995105,0.00022660065,0.0012507384,0.0006048389,0.00066116685,0.00081675145,0.001441901,0.000057361955],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013826782,0.0001413045,0.000011157558,0.000356613,0.000039065304,0.0001868251,0.00053419755,0.031397577,0.003678616,0.03559063,0.00010627279,0.9279439],"study_design_scores_gemma":[0.00018935924,0.00011822672,0.000005640408,0.0007353897,0.000022900385,0.000073106705,1.6266078e-7,0.858889,0.012459217,0.12551786,0.0012695311,0.00071964384],"about_ca_topic_score_codex":0.00002370295,"about_ca_topic_score_gemma":0.000014034254,"teacher_disagreement_score":0.9272243,"about_ca_system_score_codex":0.0005226381,"about_ca_system_score_gemma":0.00085990794,"threshold_uncertainty_score":0.99995774},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022797378,0.0014706263,0.99468476,0.00064981746,0.0010843909,0.0006007481,0.00007425017,0.00049662497,0.000916001],"genre_scores_gemma":[0.040507738,0.000164465,0.9570603,0.0012797721,0.00040184148,0.00006479749,0.000210538,0.00008982139,0.00022074855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995725,0.000044612774,0.0006666007,0.0019186966,0.00074562425,0.00089949096],"domain_scores_gemma":[0.9974841,0.0004948067,0.00021870738,0.0015809599,0.00008215451,0.00013930787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012144721,0.0006469,0.0006851467,0.0014174217,0.00026811025,0.0006187877,0.0045382166,0.00034525248,0.0000043204977],"category_scores_gemma":[0.00008341366,0.0005696141,0.00020201875,0.0007793033,0.00039312482,0.0008460082,0.0032264811,0.0015255056,0.0000079217025],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006147069,0.00009378218,0.00063743384,0.00065116625,0.000046621182,0.0010736883,0.0016504691,0.031760182,0.00064132403,0.05863306,0.00018165357,0.90456915],"study_design_scores_gemma":[0.00032753835,0.00022245396,0.000046362245,0.0010217534,0.000011284026,0.00007075358,8.025513e-8,0.4821908,0.0017389074,0.4780695,0.035440296,0.0008602746],"about_ca_topic_score_codex":0.000026908525,"about_ca_topic_score_gemma":0.000042736858,"teacher_disagreement_score":0.9037089,"about_ca_system_score_codex":0.00029772095,"about_ca_system_score_gemma":0.00017987839,"threshold_uncertainty_score":0.9996755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000087548,0.00054694986,0.98734117,0.000626048,0.0015768501,0.00047820926,0.000011551472,0.00037414755,0.008957534],"genre_scores_gemma":[0.4848644,0.000021059595,0.51346415,0.00062019064,0.00063793594,0.000014749776,0.000028355218,0.000048593578,0.00030054385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958551,0.000091611466,0.00071720965,0.0016924047,0.0008226016,0.00082105765],"domain_scores_gemma":[0.9977394,0.00028394,0.0002446688,0.0011402584,0.00035112258,0.00024064208],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001152326,0.0006741185,0.0006234441,0.000908068,0.00056315167,0.0021554974,0.0027881993,0.00029454773,0.000022149876],"category_scores_gemma":[0.000059451337,0.00059964607,0.00022588979,0.0010000268,0.00071455445,0.0021301706,0.0005809641,0.0010960222,0.000047215643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006437063,0.00006338918,0.000005775822,0.00008114743,0.00004836227,0.00010063224,0.00576363,0.10383298,0.0016224226,0.011921038,0.00007465164,0.8764795],"study_design_scores_gemma":[0.00023239166,0.00009640988,0.000035856436,0.00035038983,0.00002204342,0.000094379815,0.0000038828966,0.9746117,0.0016126944,0.021572007,0.0006524094,0.000715816],"about_ca_topic_score_codex":0.00003620448,"about_ca_topic_score_gemma":0.00004795837,"teacher_disagreement_score":0.8757637,"about_ca_system_score_codex":0.0002884422,"about_ca_system_score_gemma":0.00037494246,"threshold_uncertainty_score":0.9996455},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000104567516,0.00020797946,0.97864056,0.001926279,0.0025389087,0.00035220434,0.000011839301,0.0003570932,0.01586055],"genre_scores_gemma":[0.16919242,0.00001934988,0.8246016,0.0035021342,0.001008772,0.000040119256,0.000018789704,0.00009150863,0.0015253456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959496,0.00001127279,0.000528774,0.0016531026,0.0012402576,0.0006169887],"domain_scores_gemma":[0.99731517,0.0006354387,0.00027202003,0.0012087196,0.00039359645,0.00017505606],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00049659645,0.00060371374,0.00043731424,0.0009442114,0.0002852439,0.0011342746,0.0029462718,0.00028319767,0.000083025974],"category_scores_gemma":[0.000042137217,0.00047544646,0.00012914487,0.0007899414,0.0005548554,0.0013719695,0.0013377082,0.0014727514,0.00025462467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000121666735,0.000040670893,0.000044664244,0.0001131153,0.00006562654,0.0003928196,0.005448353,0.021043252,0.00019600392,0.7154528,0.000084664316,0.2571059],"study_design_scores_gemma":[0.00018419238,0.0002231927,0.000026880249,0.0011835188,0.000014639386,0.0004119633,0.000002484507,0.66380507,0.0006553313,0.3292707,0.0035091774,0.0007128405],"about_ca_topic_score_codex":0.000053980006,"about_ca_topic_score_gemma":0.0003569667,"teacher_disagreement_score":0.6427618,"about_ca_system_score_codex":0.00060624274,"about_ca_system_score_gemma":0.00096797023,"threshold_uncertainty_score":0.99990267},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032818672,0.00012856675,0.9926568,0.0022585362,0.0036648114,0.0005953381,0.000087172426,0.0002419701,0.0003339802],"genre_scores_gemma":[0.0039547356,0.00002404554,0.99182284,0.0007184006,0.00077476125,0.00017680503,0.00013019014,0.00005686834,0.0023413342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676526,0.000014955841,0.0005607751,0.0016788976,0.0004409101,0.0005391827],"domain_scores_gemma":[0.9980721,0.00034430818,0.00022195905,0.001026623,0.00017582573,0.00015917454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064958597,0.0004413475,0.00040535134,0.0006071491,0.00030097296,0.00074569543,0.0023500137,0.00026556166,0.000021209888],"category_scores_gemma":[0.00004280434,0.00043018063,0.00016571551,0.000389987,0.00014211444,0.000534474,0.0011554813,0.0005607112,0.000041991945],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014396801,0.000048627113,0.0000277575,0.000040916086,0.0000082502775,0.000016178512,0.00040155058,0.00026647,0.00007239283,0.0065007843,0.0002782311,0.9923374],"study_design_scores_gemma":[0.00029779752,0.00014772142,0.0000740978,0.0002927148,0.000035911733,0.00006075381,4.1005646e-7,0.93712485,0.00026322337,0.008888829,0.052103017,0.0007106737],"about_ca_topic_score_codex":0.000059107722,"about_ca_topic_score_gemma":0.00008621285,"teacher_disagreement_score":0.99162674,"about_ca_system_score_codex":0.0009423467,"about_ca_system_score_gemma":0.00026876436,"threshold_uncertainty_score":0.999815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039066357,0.00018666481,0.9753262,0.0031731413,0.0027179567,0.0008940066,0.00010251971,0.00006293392,0.017145919],"genre_scores_gemma":[0.7967192,0.00030167398,0.122540675,0.0049041905,0.002428107,0.0002093044,0.000031636744,0.0001646247,0.072700605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973004,0.000023386749,0.00041418071,0.0012148664,0.000544522,0.0005026526],"domain_scores_gemma":[0.99715436,0.0015439271,0.00017598576,0.00043339204,0.00056278706,0.00012955263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078489346,0.00029936119,0.0003494004,0.0008198334,0.00026225654,0.00022722453,0.000991614,0.00015154271,0.00008606208],"category_scores_gemma":[0.001216661,0.00023884822,0.00014417431,0.0010728767,0.001788713,0.00024501598,0.00033301362,0.00058943505,0.000034788307],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006473131,0.00013559581,0.000010868431,0.00014895789,0.000010430312,0.000012803186,0.004766885,0.001271178,0.11639192,0.013648247,0.00060493284,0.86293346],"study_design_scores_gemma":[0.00046260434,0.0007291541,0.000025422738,0.0013458895,0.000043326538,0.000057152884,0.000031991218,0.43620375,0.28820986,0.26189563,0.010162388,0.00083281484],"about_ca_topic_score_codex":0.000015610885,"about_ca_topic_score_gemma":0.00015500761,"teacher_disagreement_score":0.86210066,"about_ca_system_score_codex":0.00017358102,"about_ca_system_score_gemma":0.0012505716,"threshold_uncertainty_score":0.9739948},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005474615,0.0009484996,0.99216837,0.0005534026,0.0047612516,0.00049701805,0.00000383002,0.00023478923,0.0007780815],"genre_scores_gemma":[0.021812756,0.000018122633,0.9765483,0.0004122795,0.0006730431,0.000030617142,0.000004483875,0.000050068447,0.000450336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631953,0.000040238276,0.00059227913,0.0018308699,0.0004822233,0.00073484436],"domain_scores_gemma":[0.9970431,0.001468934,0.00022975182,0.00096557464,0.00016321702,0.00012946303],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022627776,0.0005092027,0.0005213931,0.0012915413,0.00023852478,0.001058904,0.0022717493,0.00035376186,0.000005717031],"category_scores_gemma":[0.00031124539,0.00047715782,0.00018176554,0.00096768484,0.00024028843,0.00068565604,0.0011130328,0.0010542737,0.00001443124],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045827196,0.000008628515,0.000015748308,0.00008846888,0.0000063646135,0.000017041524,0.0006892512,0.019972678,0.0009702821,0.0077897455,0.0000037851737,0.9704334],"study_design_scores_gemma":[0.00015208464,0.000117429605,0.000015366253,0.000643579,0.000008058078,0.00004363627,4.095141e-7,0.8060587,0.0019343796,0.1889593,0.0016018759,0.00046519408],"about_ca_topic_score_codex":0.00019606737,"about_ca_topic_score_gemma":0.0003636794,"teacher_disagreement_score":0.96996826,"about_ca_system_score_codex":0.0004468164,"about_ca_system_score_gemma":0.00039751033,"threshold_uncertainty_score":0.99997807},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027090736,0.00064822764,0.9949752,0.0008208947,0.0013643424,0.00059335015,0.0000062552554,0.00021276252,0.0011080689],"genre_scores_gemma":[0.42221093,0.000063971325,0.57366604,0.00088521803,0.0005365042,0.000039181505,0.000012266255,0.000059352387,0.0025265473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970775,0.000017929868,0.00042556893,0.0014952478,0.00051041937,0.00047331493],"domain_scores_gemma":[0.99828,0.00077020633,0.0002056155,0.00039348597,0.0002228537,0.00012786053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080670137,0.00039649385,0.0004264386,0.0004729604,0.00023824043,0.0007491521,0.0009876001,0.00024265387,0.0000062890495],"category_scores_gemma":[0.000120617275,0.00037725494,0.000080711,0.00026523083,0.00035023285,0.00044345853,0.0006930606,0.00067429536,0.000009940319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019642943,0.000011085876,0.000042070278,0.00018896958,0.00003881244,0.00005009419,0.0042058397,0.034111574,0.0012071718,0.24495608,0.000015524762,0.71515316],"study_design_scores_gemma":[0.0003474754,0.00013393373,0.000009204273,0.00034118159,0.000014644132,0.000027790076,0.0000013865662,0.8123918,0.0008619661,0.18405981,0.0014433403,0.00036742052],"about_ca_topic_score_codex":0.000011621906,"about_ca_topic_score_gemma":0.000029042578,"teacher_disagreement_score":0.77828026,"about_ca_system_score_codex":0.00022921115,"about_ca_system_score_gemma":0.00028451494,"threshold_uncertainty_score":0.9998679},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005059927,0.0015520104,0.98819184,0.0004661278,0.0035312404,0.00026224364,0.000016494945,0.00043002062,0.0004900975],"genre_scores_gemma":[0.9141403,0.00013439657,0.082084306,0.0004437651,0.0029363404,0.000015422533,0.000018315566,0.00006492492,0.00016225979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960905,0.000048039383,0.00044358245,0.0017710545,0.0010417661,0.0006050887],"domain_scores_gemma":[0.9983348,0.00065703905,0.00024079985,0.00045014248,0.00013570597,0.00018149955],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005248782,0.0005740466,0.00047860196,0.0008119111,0.00058532984,0.0010899563,0.0010992476,0.00055263384,0.000014863071],"category_scores_gemma":[0.00014525848,0.0005111636,0.00013756644,0.00048598336,0.0004899238,0.0006417605,0.0012339018,0.0012424578,0.00004335696],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012665684,0.0000122820875,0.000004396597,0.000023661696,0.000014752093,0.00010985447,0.002372753,0.00041510235,0.0038200363,0.0009611313,0.000013514097,0.99223983],"study_design_scores_gemma":[0.0008385183,0.00035062007,0.00055717095,0.001935557,0.00005659465,0.00023239608,0.000009680801,0.673553,0.063275225,0.25575992,0.0015293019,0.0019020273],"about_ca_topic_score_codex":0.00014412917,"about_ca_topic_score_gemma":0.000621581,"teacher_disagreement_score":0.99033785,"about_ca_system_score_codex":0.00022814434,"about_ca_system_score_gemma":0.0001684926,"threshold_uncertainty_score":0.999947},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090353825,0.00059621147,0.98910713,0.0030136374,0.0008978001,0.0010648118,0.000034643643,0.00015680536,0.0042254236],"genre_scores_gemma":[0.30077052,0.0002865692,0.69074786,0.002728734,0.0014048562,0.00022484141,0.000010979301,0.00020533425,0.0036203088],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972572,0.000030763345,0.0005650619,0.001119173,0.00053053186,0.0004972784],"domain_scores_gemma":[0.99646246,0.002059075,0.00022479796,0.000990041,0.00017089325,0.00009270868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006356718,0.00048377246,0.0005491978,0.00058481237,0.0002596058,0.00030413424,0.0010723885,0.00043851454,0.000049633596],"category_scores_gemma":[0.00022261197,0.00034761746,0.00019694587,0.0005408363,0.0005102928,0.0001282301,0.00041274322,0.0017745346,0.00013572321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011032895,0.0009177304,0.00015080611,0.0008901247,0.00022529303,0.0004939434,0.027813183,0.028493457,0.00070016127,0.4357729,0.000501872,0.5039302],"study_design_scores_gemma":[0.0002510086,0.000091547125,0.0002438096,0.0018583677,0.000033483877,0.00003549282,0.000007752409,0.08186029,0.00016075336,0.913706,0.0012092785,0.0005421994],"about_ca_topic_score_codex":0.00002166319,"about_ca_topic_score_gemma":0.00028635556,"teacher_disagreement_score":0.503388,"about_ca_system_score_codex":0.0003153577,"about_ca_system_score_gemma":0.00018035567,"threshold_uncertainty_score":0.9998976},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007556862,0.00027437718,0.9911785,0.00076663005,0.000810426,0.00083931675,0.0000070583746,0.00037073388,0.004997267],"genre_scores_gemma":[0.108124405,0.00002378378,0.8902602,0.00050616416,0.00032883036,0.000083069855,0.000023202098,0.00005212708,0.0005981731],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961514,0.00004851886,0.0006033243,0.001870947,0.0006176712,0.00070816407],"domain_scores_gemma":[0.9982336,0.00049695605,0.00020399883,0.0006457626,0.0002834167,0.00013624292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011980797,0.00051017525,0.00060201547,0.0020830333,0.00025189464,0.0006761291,0.0020510645,0.00046657858,0.00002744153],"category_scores_gemma":[0.00015175164,0.0004942025,0.00013164831,0.0013077988,0.00044878153,0.0006197639,0.0005763428,0.0011059293,0.00002762169],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000114090835,0.00004188545,0.000089715635,0.00006641815,0.0000140875,0.00010393327,0.0010518123,0.0070070312,0.00027977955,0.01279348,0.000003811473,0.97853667],"study_design_scores_gemma":[0.00047184507,0.00022492184,0.000047993693,0.00038684416,0.0000130051085,0.00012089747,0.000009834035,0.89221686,0.0029409062,0.10250766,0.00045060946,0.0006086185],"about_ca_topic_score_codex":0.000018830939,"about_ca_topic_score_gemma":0.00007019066,"teacher_disagreement_score":0.97792804,"about_ca_system_score_codex":0.00037606002,"about_ca_system_score_gemma":0.00036361787,"threshold_uncertainty_score":0.999751},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028679147,0.0023317975,0.9874515,0.000592829,0.005135539,0.0010233744,0.000010209121,0.00079461077,0.0023733582],"genre_scores_gemma":[0.54498726,0.00015006388,0.44716972,0.0045521907,0.001874416,0.000087848864,0.000030890693,0.00023294537,0.00091465603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99167365,0.0000698582,0.0008899324,0.0038591283,0.0016388485,0.0018685804],"domain_scores_gemma":[0.9955303,0.00074944564,0.0003863764,0.0026044971,0.00025389757,0.00047550138],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.00083630567,0.0013035475,0.0009743982,0.0016232235,0.00045113024,0.0011412501,0.005226148,0.0006143008,0.0000082857505],"category_scores_gemma":[0.000068976326,0.0011017548,0.00044169268,0.002593887,0.0012707508,0.0004983793,0.0022757247,0.0027631912,0.000067282235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013083472,0.000053361477,0.000008530229,0.000037615206,0.000017114566,0.00014797255,0.00022343805,0.8044629,0.000017155267,0.009205093,0.000058012436,0.18575573],"study_design_scores_gemma":[0.00030940963,0.0002463735,0.000044636803,0.00044996548,0.000016066926,0.00010715826,2.5233348e-7,0.9719439,0.00009224708,0.025092639,0.0005685542,0.0011287603],"about_ca_topic_score_codex":0.00000744493,"about_ca_topic_score_gemma":0.00001327553,"teacher_disagreement_score":0.54470044,"about_ca_system_score_codex":0.00041755207,"about_ca_system_score_gemma":0.00017642629,"threshold_uncertainty_score":0.9999716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012525974,0.00036258655,0.96050674,0.015990201,0.005188397,0.0030768637,0.000020847769,0.0006607234,0.0016676417],"genre_scores_gemma":[0.97515845,0.000022632124,0.017337734,0.0055244523,0.0010226816,0.00013679794,0.000007713468,0.000083625055,0.00070588576],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99337596,0.00018516101,0.0006760995,0.0028326917,0.002052333,0.00087773503],"domain_scores_gemma":[0.99469906,0.0008616039,0.00041343746,0.0033484849,0.0004203404,0.00025704745],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0022535597,0.00094138837,0.00069094583,0.0006654113,0.0006794642,0.003687288,0.004917899,0.00049718865,0.000027045468],"category_scores_gemma":[0.00027665886,0.0005295783,0.00022432531,0.0010306268,0.0008902151,0.001983486,0.0017442844,0.0023022313,0.00014721743],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017918245,0.0011117241,0.0090295,0.0007670293,0.00046449064,0.0011525472,0.061919864,0.05146427,0.00021382296,0.06893275,0.0025278258,0.802237],"study_design_scores_gemma":[0.0010251023,0.0037014547,0.0031984262,0.0014072808,0.0000954235,0.00080399617,0.00014348007,0.29449937,0.0018842971,0.64490944,0.044885777,0.0034459592],"about_ca_topic_score_codex":0.000027002745,"about_ca_topic_score_gemma":0.00012801283,"teacher_disagreement_score":0.9626325,"about_ca_system_score_codex":0.0005841778,"about_ca_system_score_gemma":0.0014119841,"threshold_uncertainty_score":0.9999995},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000069692236,0.0009042855,0.99202967,0.00049418485,0.0037307735,0.00020085998,0.000009522658,0.00009864638,0.0024623945],"genre_scores_gemma":[0.11611096,0.0000889874,0.88041335,0.00072519004,0.00095042505,0.000009770412,0.00005688229,0.000056263965,0.0015881457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703604,0.000062800194,0.0006040415,0.0010716375,0.00077631866,0.00044916],"domain_scores_gemma":[0.9985049,0.00021235774,0.00020312749,0.00077844283,0.00022199992,0.00007919231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015412762,0.00036710134,0.00046893573,0.0008035846,0.00009111053,0.0003955571,0.001743524,0.00027811693,0.000010983132],"category_scores_gemma":[0.00013591656,0.00034305494,0.000119070406,0.0009612053,0.00030514627,0.00049603387,0.0008807379,0.0006325653,0.000022247317],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008242956,0.000023523948,0.000027703076,0.00012427838,0.000009305225,0.00020185616,0.0015461246,0.053777076,0.0017044368,0.063988626,0.000058940353,0.8785299],"study_design_scores_gemma":[0.00022790075,0.000100805824,0.00009819132,0.0008088777,0.000008484898,0.000023767941,9.78296e-8,0.74335617,0.006562351,0.24638528,0.0019877674,0.00044030978],"about_ca_topic_score_codex":0.000049699807,"about_ca_topic_score_gemma":0.00008066536,"teacher_disagreement_score":0.87808955,"about_ca_system_score_codex":0.00032772002,"about_ca_system_score_gemma":0.00049366953,"threshold_uncertainty_score":0.9999021},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040755857,0.000651312,0.9812267,0.0073063644,0.006384003,0.0009430436,0.000034263307,0.00032290438,0.0027238862],"genre_scores_gemma":[0.9683513,0.00003864515,0.009169807,0.01597182,0.0027421708,0.00011447394,0.0000073896063,0.00015109629,0.003453294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957617,0.00003886195,0.00045005602,0.0022790614,0.000743491,0.00072682666],"domain_scores_gemma":[0.9901787,0.0086978,0.00018326646,0.0006667555,0.0001477479,0.00012570752],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084466086,0.00061932066,0.0005471442,0.0009347531,0.00057138345,0.000392283,0.0009199276,0.00037399097,0.00001662383],"category_scores_gemma":[0.0026696443,0.0005705435,0.00029848012,0.000833115,0.0011568951,0.00033409675,0.0005982501,0.0009282682,0.000042584597],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025393927,0.00011245153,0.00016515619,0.00040633412,0.00007882654,0.00029533415,0.0006475229,0.15718472,0.02855105,0.04412828,0.0018498044,0.76632655],"study_design_scores_gemma":[0.0005369064,0.00088144594,0.0000888166,0.00045405005,0.000039423292,0.0002622975,5.868842e-7,0.5806867,0.016513066,0.34322202,0.055943176,0.0013715269],"about_ca_topic_score_codex":0.000018088183,"about_ca_topic_score_gemma":0.00040504255,"teacher_disagreement_score":0.97205687,"about_ca_system_score_codex":0.00034583436,"about_ca_system_score_gemma":0.0002168305,"threshold_uncertainty_score":0.9996746},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001379809,0.00057328615,0.99251693,0.0026343486,0.0007463979,0.0011664989,0.00006790094,0.00030572363,0.0006091277],"genre_scores_gemma":[0.31507674,0.00009766631,0.6787333,0.0025460876,0.00096949434,0.00016075232,0.00019988386,0.000100031895,0.0021160734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961078,0.000040367686,0.00056285586,0.001877011,0.00076386676,0.000648056],"domain_scores_gemma":[0.9981744,0.00058853615,0.0001891139,0.000714308,0.0001525647,0.0001810732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089970365,0.00049040286,0.00045898923,0.001112782,0.00031034107,0.00044546943,0.0013577957,0.00041567357,0.0000071523505],"category_scores_gemma":[0.000107738786,0.00045392298,0.0000888622,0.00047759787,0.00025345644,0.00054160866,0.00107535,0.0011007629,0.000010830431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000859164,0.00020762823,0.0037170118,0.0017859957,0.000051063358,0.00032643706,0.015887005,0.42721534,0.00004973199,0.2820751,0.00054277276,0.26805598],"study_design_scores_gemma":[0.0004097632,0.00018726954,0.001258968,0.00081904896,0.0000049220994,0.00007602975,1.0147999e-7,0.8012297,0.000010324747,0.19530904,0.0003578101,0.00033702975],"about_ca_topic_score_codex":0.000067546076,"about_ca_topic_score_gemma":0.00022053788,"teacher_disagreement_score":0.37401435,"about_ca_system_score_codex":0.00042027325,"about_ca_system_score_gemma":0.00044654167,"threshold_uncertainty_score":0.99979126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021870037,0.000853511,0.98313165,0.0030255965,0.0009687793,0.00041140153,0.000008788063,0.00050023344,0.010881323],"genre_scores_gemma":[0.5044688,0.00003356642,0.4915295,0.0013067204,0.00060512533,0.00002691232,0.000010206211,0.000075123346,0.0019440829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607843,0.000024574045,0.0004335933,0.0018843838,0.00097429764,0.00060474064],"domain_scores_gemma":[0.9971272,0.00035374166,0.00023549751,0.0019259726,0.00015475391,0.00020283397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072954927,0.00050406804,0.00043404804,0.000995828,0.00022532852,0.00091016304,0.003754475,0.0003193092,0.000025775353],"category_scores_gemma":[0.00005324244,0.00044926867,0.00014622218,0.000815464,0.0003806997,0.00059958146,0.0020867155,0.0013879581,0.0004050672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000423005,0.000039661343,0.000021483791,0.000078767414,0.000013213155,0.00015973141,0.0017432116,0.33163753,0.00023310352,0.13543308,0.000074335374,0.5305617],"study_design_scores_gemma":[0.00011333025,0.000047746013,0.000066437424,0.00032901912,0.000005638938,0.000033641645,1.4509459e-7,0.7331767,0.00012145335,0.26517606,0.00055989745,0.00036989938],"about_ca_topic_score_codex":0.00011496887,"about_ca_topic_score_gemma":0.00009711508,"teacher_disagreement_score":0.5301918,"about_ca_system_score_codex":0.00027743718,"about_ca_system_score_gemma":0.0002874842,"threshold_uncertainty_score":0.9997959},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3332763,0.000251571,0.6639599,0.000093668015,0.001651149,0.0003949413,0.000083541025,0.00025286074,0.000036016794],"genre_scores_gemma":[0.96427864,0.000035068915,0.034913547,0.00023302429,0.00026320407,0.000009359548,0.000027084792,0.000078644895,0.00016141628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99547553,0.00011543677,0.00055105175,0.0021681834,0.0010177799,0.0006720364],"domain_scores_gemma":[0.9980691,0.00052662235,0.00040624806,0.00057552505,0.00015909328,0.00026341225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026875862,0.0006791808,0.00043650335,0.0013801132,0.0007756305,0.0008311258,0.00086457573,0.00019846823,0.00001541396],"category_scores_gemma":[0.000114321774,0.00055822136,0.0001584319,0.0010237847,0.0007086115,0.0005547991,0.0003952882,0.0015113973,0.000010010895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017411252,0.00009928605,0.0034916194,0.00021870891,0.00006918111,0.0009329369,0.0035810005,0.65965396,0.1629621,0.0005842316,0.0000036723156,0.16822918],"study_design_scores_gemma":[0.00056726503,0.00024504162,0.0041973265,0.002352355,0.00008835492,0.00010916154,0.0000027234807,0.903788,0.025979502,0.061079912,0.00048122232,0.0011091691],"about_ca_topic_score_codex":0.00018330601,"about_ca_topic_score_gemma":0.001068008,"teacher_disagreement_score":0.63100237,"about_ca_system_score_codex":0.00030851387,"about_ca_system_score_gemma":0.0001874153,"threshold_uncertainty_score":0.99968696},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023210906,0.00010360286,0.97949713,0.0007185855,0.0022090361,0.0003461078,0.0000078474295,0.00042447948,0.016461091],"genre_scores_gemma":[0.69515544,0.00006257888,0.29774943,0.001955974,0.0013649814,0.000032448752,0.00008287228,0.00010441129,0.003491868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593735,0.000039435294,0.0005905032,0.0016231663,0.00117245,0.00063708745],"domain_scores_gemma":[0.9981753,0.0002043559,0.00028910546,0.00094092335,0.00020940737,0.00018090982],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008157315,0.0005533051,0.00045003946,0.0010076842,0.00045805442,0.0011613184,0.0022905096,0.00033914516,0.00008885986],"category_scores_gemma":[0.0000630344,0.0005491937,0.00017161414,0.00051654247,0.0003807207,0.0011735931,0.0012407025,0.0013515662,0.0002555543],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001209437,0.000035882513,0.0000038687194,0.00006431806,0.00003836013,0.00008123073,0.0025221095,0.06871404,0.0014777433,0.023355631,0.00007958374,0.9036151],"study_design_scores_gemma":[0.00024102136,0.00019369005,0.000004834824,0.00029908007,0.000015309206,0.00006324194,7.6121376e-7,0.822202,0.0007298197,0.1733253,0.0023907076,0.0005342264],"about_ca_topic_score_codex":0.000017539589,"about_ca_topic_score_gemma":0.00010900321,"teacher_disagreement_score":0.90308094,"about_ca_system_score_codex":0.00052517414,"about_ca_system_score_gemma":0.00050781365,"threshold_uncertainty_score":0.99987555},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026289576,0.00021536404,0.95012194,0.0005564311,0.009919443,0.00056833297,0.000032929125,0.0002679586,0.035688635],"genre_scores_gemma":[0.98357403,0.000007624667,0.013396995,0.0002538763,0.0009480159,0.000017416913,0.000011912936,0.000044893513,0.0017452107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758846,0.000047590933,0.00070651376,0.0008663817,0.0003454347,0.00044560808],"domain_scores_gemma":[0.99781656,0.0010912975,0.0003349508,0.0004058345,0.00025258,0.000098794764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006720721,0.0003150521,0.000526981,0.0005537475,0.0001782314,0.00012038126,0.000632131,0.00025814152,0.00034090565],"category_scores_gemma":[0.00021338032,0.0002791181,0.00019394042,0.00025325015,0.00040236002,0.00012541086,0.00017747433,0.0007170679,0.00005183266],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001203806,0.00005654793,0.000050648443,0.0001069091,0.00009074572,0.000045664627,0.0065097827,0.008386268,0.0016966332,0.08444387,0.000046026493,0.8984465],"study_design_scores_gemma":[0.006997105,0.006921974,0.017727984,0.00728749,0.00032824292,0.00063103513,0.0002978939,0.58510566,0.0025029304,0.16814288,0.19768885,0.006367961],"about_ca_topic_score_codex":0.00000841984,"about_ca_topic_score_gemma":0.000006585443,"teacher_disagreement_score":0.9809451,"about_ca_system_score_codex":0.0001428898,"about_ca_system_score_gemma":0.00016928405,"threshold_uncertainty_score":0.9999661},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048047057,0.000505474,0.99119455,0.000065853725,0.0061796694,0.0004400022,0.000060266877,0.00029238654,0.00078131055],"genre_scores_gemma":[0.94236004,0.000015150105,0.055146243,0.00018722238,0.002072865,0.000010003115,0.000029335604,0.00008302005,0.000096110656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983493,0.000011170369,0.0005677829,0.000475185,0.0002933274,0.00030321736],"domain_scores_gemma":[0.9989962,0.00030560096,0.00012660722,0.00039999813,0.00011154785,0.00006003203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007737999,0.00030129394,0.0005923278,0.00038790755,0.00006709196,0.000106864674,0.0004039489,0.00029061336,0.0000034456605],"category_scores_gemma":[0.00008020596,0.00026546113,0.000146919,0.00017090274,0.00010121542,0.00012717562,0.000050958875,0.0004334744,0.0000018572707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007099642,0.000007898261,0.00000450418,0.0022020263,0.00005703393,0.000027300723,0.00031864783,0.3402415,0.014515483,0.0027770808,0.0005999325,0.6391776],"study_design_scores_gemma":[0.00032509273,0.0002952899,0.000006858634,0.0019921707,0.00003891923,0.00001659561,3.9348762e-7,0.8342195,0.14917094,0.010840036,0.0026988003,0.00039541957],"about_ca_topic_score_codex":0.000036770503,"about_ca_topic_score_gemma":0.000030989137,"teacher_disagreement_score":0.9418796,"about_ca_system_score_codex":0.0002987046,"about_ca_system_score_gemma":0.00009142172,"threshold_uncertainty_score":0.99997973},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009072383,0.00020078938,0.99417865,0.0003965597,0.0008204111,0.00037575167,0.0000063478237,0.00019403853,0.0029202397],"genre_scores_gemma":[0.50134444,0.000024736546,0.49751127,0.00047811813,0.00030719468,0.000016811535,0.000032497126,0.000049165083,0.00023576691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642855,0.000049338763,0.0005735081,0.0014432247,0.0009047464,0.0006006377],"domain_scores_gemma":[0.9985962,0.00022663057,0.00029945734,0.0005850969,0.00016085242,0.00013179524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000806565,0.0004496364,0.00039540243,0.0010335942,0.00024505935,0.0007317406,0.0012739387,0.00022374588,0.000014457937],"category_scores_gemma":[0.000060950013,0.00039539122,0.000084796106,0.00066956267,0.00020816913,0.0011757863,0.0006978183,0.0010942437,0.000044651337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001648552,0.00002594495,0.00004292079,0.00008411538,0.0000074876534,0.00015641145,0.0044550407,0.26602888,0.00037067526,0.0039948025,0.0000049562213,0.72481227],"study_design_scores_gemma":[0.00038672634,0.00011257341,0.000039355633,0.0021812571,0.0000045022425,0.00004934314,0.0000032836153,0.89510083,0.00033943553,0.10113165,0.00017412397,0.00047691035],"about_ca_topic_score_codex":0.000022840446,"about_ca_topic_score_gemma":0.00007089596,"teacher_disagreement_score":0.7243354,"about_ca_system_score_codex":0.00030203676,"about_ca_system_score_gemma":0.00029780602,"threshold_uncertainty_score":0.9998498},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027633805,0.0026265373,0.99260265,0.0014048032,0.0017796658,0.00027254128,0.0000310347,0.00006552827,0.0009409042],"genre_scores_gemma":[0.53871655,0.00009663385,0.4592274,0.00074782845,0.0005739162,0.000013016431,0.00006040068,0.0000340339,0.0005302027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976836,0.000041722724,0.00047641576,0.0009163298,0.00068014656,0.00020179416],"domain_scores_gemma":[0.9979633,0.000839502,0.00025527066,0.0007085121,0.000171811,0.000061565246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004362844,0.00027585326,0.00035160908,0.00036562496,0.00018675714,0.00038077033,0.0010979963,0.00014329476,0.000018778437],"category_scores_gemma":[0.000033340697,0.00018557771,0.00009246896,0.00033462103,0.00094368384,0.00052013167,0.0017587041,0.00039652115,0.00001450477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073038944,0.00004842912,0.00011417073,0.00008340327,0.00010879554,0.00004551192,0.004397234,0.047260758,0.00094680354,0.39661846,0.00031040225,0.549993],"study_design_scores_gemma":[0.00022334381,0.000027086648,0.00031497696,0.00024665525,0.000012784267,0.000008856506,2.6928257e-7,0.6060204,0.0001596944,0.39265728,0.00018771928,0.00014092572],"about_ca_topic_score_codex":0.00017719158,"about_ca_topic_score_gemma":0.000032118704,"teacher_disagreement_score":0.5587597,"about_ca_system_score_codex":0.000051071274,"about_ca_system_score_gemma":0.00013405623,"threshold_uncertainty_score":0.75676394},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022747301,0.0012980456,0.9576766,0.0009113358,0.0036919103,0.00022353433,0.0000044545914,0.00046537523,0.035706013],"genre_scores_gemma":[0.40051448,0.00019151272,0.58567584,0.0055660764,0.0026666522,0.000033561297,0.000010051983,0.00017292255,0.0051688813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620414,0.000024002033,0.00043004652,0.0017925807,0.0008750305,0.00067419204],"domain_scores_gemma":[0.997418,0.0004297976,0.00013586156,0.0016921556,0.00013141507,0.0001927852],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010016776,0.0005549524,0.0004482097,0.0013397394,0.00024000855,0.0010886727,0.0043956516,0.00030461655,0.00007797885],"category_scores_gemma":[0.000035856952,0.000493902,0.00025000743,0.0011468864,0.0007742424,0.00052677805,0.0019367208,0.001047247,0.00047169588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023007217,0.000011724346,0.0000069232124,0.000032587006,0.000010636361,0.00015736152,0.00039487702,0.0013616438,0.000061106424,0.5500394,0.000036453454,0.44788495],"study_design_scores_gemma":[0.00008974734,0.00014581683,0.000019018828,0.0004420133,0.000010017691,0.00009211327,7.024479e-8,0.07302329,0.00048067883,0.914859,0.010228203,0.00061005715],"about_ca_topic_score_codex":0.000006820746,"about_ca_topic_score_gemma":0.000028242119,"teacher_disagreement_score":0.4472749,"about_ca_system_score_codex":0.00015607265,"about_ca_system_score_gemma":0.00033600995,"threshold_uncertainty_score":0.99994826},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094835395,0.0069399583,0.6029446,0.002620649,0.013909157,0.00197435,0.0034203874,0.00032963444,0.35837772],"genre_scores_gemma":[0.97473884,0.000391216,0.006776588,0.0008343534,0.002468594,0.0000234927,0.00009793115,0.00010644271,0.014562548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763495,0.0000062602876,0.00067964476,0.001154123,0.000083800594,0.0004412349],"domain_scores_gemma":[0.9990222,0.00015359031,0.0003110223,0.00037876453,0.000025676365,0.00010874912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000594204,0.00041849923,0.0006280904,0.00070186454,0.00016882476,0.000549671,0.00042584186,0.0004576574,0.00083315955],"category_scores_gemma":[0.000048939466,0.00045894526,0.00009830427,0.00017326165,0.00043915727,0.00043049082,0.00031017506,0.0005963625,0.00017480632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035180918,0.000016668095,0.024546973,0.00040271087,0.000056273093,0.00006669222,0.0006238651,0.00860009,0.0000021968901,0.9156581,0.003204384,0.046786822],"study_design_scores_gemma":[0.00021231391,0.000109680535,0.024012523,0.0003284485,0.000011052558,0.000010635163,2.4888175e-7,0.05921495,0.000007659057,0.85988015,0.0555557,0.00065664353],"about_ca_topic_score_codex":0.00020115067,"about_ca_topic_score_gemma":0.00014165365,"teacher_disagreement_score":0.9652553,"about_ca_system_score_codex":0.00046356206,"about_ca_system_score_gemma":0.00024274753,"threshold_uncertainty_score":0.9997862},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014460577,0.0011112213,0.99111897,0.00019410365,0.0015432737,0.00036359174,0.000014667452,0.00038371782,0.0051258663],"genre_scores_gemma":[0.52403164,0.00013756243,0.47275174,0.0006231791,0.001721065,0.000055147877,0.000018420224,0.00019253918,0.00046870305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998254,0.0000034696652,0.00034743917,0.0006883259,0.00029980426,0.00040697842],"domain_scores_gemma":[0.99905795,0.00025633906,0.000023112905,0.00048396233,0.000079225225,0.000099401885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031046363,0.0003495709,0.00032080058,0.00022256192,0.000085941334,0.00019732054,0.00062048633,0.00023590532,0.000031543666],"category_scores_gemma":[0.000041040443,0.00030059076,0.00012184069,0.00014266247,0.00026225307,0.00006803753,0.00015930268,0.00057674624,0.000040951054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032999876,0.000011332198,0.000028181543,0.0005155291,0.000056964338,0.000046806123,0.0005545293,0.30981368,0.0005866439,0.065708585,0.00007198492,0.62260246],"study_design_scores_gemma":[0.000050781593,0.0000474786,0.0000057422626,0.00030452423,0.000019695895,0.00004831801,8.752819e-8,0.90310514,0.0023094253,0.09043543,0.003300199,0.00037319752],"about_ca_topic_score_codex":0.000003516747,"about_ca_topic_score_gemma":0.000017909659,"teacher_disagreement_score":0.6222293,"about_ca_system_score_codex":0.00014387001,"about_ca_system_score_gemma":0.000083879335,"threshold_uncertainty_score":0.9999446},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028061492,0.0011122923,0.99110484,0.00023208802,0.0016841112,0.00030789906,0.0000787709,0.00015594598,0.0025179144],"genre_scores_gemma":[0.547587,0.00013480427,0.45008257,0.0013578671,0.00057522766,0.0000036379267,0.00003594893,0.00005100695,0.00017196708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605083,0.00004295061,0.00075261074,0.0014599516,0.0011987804,0.000494843],"domain_scores_gemma":[0.9970356,0.0003636198,0.00046756348,0.0017654313,0.00015624442,0.00021152153],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010767288,0.0004505101,0.0005525142,0.00317842,0.00020779738,0.0005947613,0.005213436,0.00030354733,0.00003217464],"category_scores_gemma":[0.00017944626,0.0004071835,0.00010152997,0.0031351203,0.00029208418,0.0010437738,0.0032422747,0.0012198816,0.000086983],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051665565,0.000024470623,0.0002683609,0.00004633311,0.000038919436,0.000024793519,0.0071552047,0.026825465,0.000030486157,0.010660706,0.000043217868,0.9548769],"study_design_scores_gemma":[0.0003202971,0.00018509165,0.001042806,0.00078306696,0.000045225614,0.00003367134,0.0000027801439,0.8406803,0.0005406248,0.14868458,0.0066830227,0.0009985116],"about_ca_topic_score_codex":0.00019270061,"about_ca_topic_score_gemma":0.00008570468,"teacher_disagreement_score":0.95387834,"about_ca_system_score_codex":0.0001961552,"about_ca_system_score_gemma":0.0004457692,"threshold_uncertainty_score":0.999838},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011734804,0.00082596263,0.99091744,0.0015197056,0.0019078201,0.0024074093,0.00000712695,0.00024384847,0.0020533563],"genre_scores_gemma":[0.7512276,0.00011474139,0.2449378,0.0010332881,0.00032087948,0.00058984413,0.000025330739,0.00008441037,0.0016661003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960896,0.000058256235,0.00082447013,0.0015712181,0.0008554119,0.00060103857],"domain_scores_gemma":[0.9958536,0.00030700347,0.0003170517,0.0031355843,0.00024426437,0.00014250109],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011975638,0.00048546557,0.00048153987,0.0009827941,0.00021062736,0.0008355738,0.0056295185,0.00030256758,0.000020023535],"category_scores_gemma":[0.00007101553,0.0005120332,0.00012838277,0.0010343001,0.0010018152,0.0011416322,0.0026247401,0.0012922309,0.00018283875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010661604,0.00013502574,0.00019153139,0.0003582782,0.00003010919,0.00014766473,0.009169217,0.0127685405,0.0052242465,0.76117665,0.000023940636,0.21076415],"study_design_scores_gemma":[0.00020893832,0.000032355394,0.000049857306,0.0008039459,0.0000068728386,0.000018836683,8.6768773e-7,0.4416349,0.0018464571,0.5521866,0.002719633,0.0004906954],"about_ca_topic_score_codex":0.000037600006,"about_ca_topic_score_gemma":0.00028270404,"teacher_disagreement_score":0.75111026,"about_ca_system_score_codex":0.00080894463,"about_ca_system_score_gemma":0.00040348625,"threshold_uncertainty_score":0.9997505},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018749194,0.00026412707,0.73995584,0.010830635,0.00048644555,0.0009893853,0.000005436614,0.0003356959,0.2452575],"genre_scores_gemma":[0.9211406,0.00015661902,0.061470896,0.0043855724,0.00035419225,0.000041537958,0.0000011629168,0.00006406599,0.012385337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978407,0.000014602396,0.00018848678,0.0010576159,0.0005930512,0.00030553763],"domain_scores_gemma":[0.9990041,0.00021781688,0.000047338115,0.00063487625,0.0000102779395,0.00008559433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059791154,0.00029981922,0.0002089848,0.00022148386,0.00019214093,0.00037051374,0.00096247083,0.00014482465,0.00015188936],"category_scores_gemma":[0.000044176042,0.0001850185,0.000061810686,0.00029360695,0.000967598,0.00011528881,0.0013403777,0.0006493271,0.00021697188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003523807,0.00011072174,0.0001928468,0.00005694499,0.0000336842,0.00027964977,0.0024099508,0.040848173,0.0017277682,0.5313676,0.0104317125,0.41250575],"study_design_scores_gemma":[0.0001915596,0.0010852539,0.001040604,0.0015168939,0.00005638129,0.000095572716,0.000007793103,0.050738107,0.0044434313,0.55965775,0.37921426,0.0019524139],"about_ca_topic_score_codex":0.000046197416,"about_ca_topic_score_gemma":0.000068424095,"teacher_disagreement_score":0.9192657,"about_ca_system_score_codex":0.0002637556,"about_ca_system_score_gemma":0.00001411694,"threshold_uncertainty_score":0.7544835},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015258273,0.0018772336,0.9928358,0.0016138225,0.0008311749,0.00035421026,0.0000066449325,0.00012800991,0.00082725286],"genre_scores_gemma":[0.42600745,0.00066475966,0.56848675,0.0037619146,0.00035220635,0.00004207092,0.000013084909,0.000050070998,0.00062168564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969405,0.000054317556,0.0004454106,0.0014739332,0.00058269256,0.00050313503],"domain_scores_gemma":[0.99802643,0.00075523125,0.00012872892,0.00077860267,0.00012375302,0.00018724709],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065047486,0.0004366276,0.00045918234,0.0018601691,0.00031839506,0.00047133188,0.0009813405,0.00028554932,0.000010680875],"category_scores_gemma":[0.00013818961,0.00041750434,0.000079068705,0.0011130219,0.0014308887,0.0005824306,0.0013330585,0.00086885627,0.000006995545],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029418776,0.000118285214,0.0017634073,0.00016969643,0.00003342241,0.00025294497,0.001289567,0.008544472,0.0024283116,0.09805262,0.00022473473,0.8870931],"study_design_scores_gemma":[0.0011161183,0.0003664753,0.004425935,0.0013251432,0.00003178887,0.00022997914,9.3210787e-7,0.6427516,0.0005308671,0.34421283,0.003771427,0.0012369477],"about_ca_topic_score_codex":0.00006135265,"about_ca_topic_score_gemma":0.0002862739,"teacher_disagreement_score":0.88585615,"about_ca_system_score_codex":0.00014411072,"about_ca_system_score_gemma":0.00042234792,"threshold_uncertainty_score":0.9998277},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030646435,0.000111019326,0.9943164,0.002411532,0.00038283103,0.0006828897,0.000015506283,0.00004331812,0.0020058793],"genre_scores_gemma":[0.90925974,0.00012058688,0.086537406,0.0019013549,0.00032145262,0.000053926866,0.000011801138,0.000056314995,0.0017374362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973961,0.000041089763,0.0004612461,0.0009729977,0.000704494,0.00042407837],"domain_scores_gemma":[0.9947555,0.003417082,0.00030544808,0.0011390697,0.0002778874,0.00010500631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017272902,0.0003502003,0.00041603332,0.00043274622,0.00023763534,0.00033821966,0.002356869,0.00020221433,0.000007034291],"category_scores_gemma":[0.00049003534,0.00024359755,0.00016690603,0.00066450617,0.00064581085,0.00019470432,0.00059250847,0.0006946103,0.00001917822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010174345,0.00001647522,3.4236552e-7,0.000022245953,0.00001955629,0.0000029604166,0.0006624258,0.2453527,0.00027562614,0.6714111,0.00010721796,0.0821192],"study_design_scores_gemma":[0.000076403696,0.00045020363,0.000006794322,0.00020225783,0.000012952902,0.0000048462207,0.0000011908242,0.64245826,0.002120121,0.35352433,0.0009351183,0.00020753381],"about_ca_topic_score_codex":0.000022111402,"about_ca_topic_score_gemma":0.000009106743,"teacher_disagreement_score":0.9092291,"about_ca_system_score_codex":0.00019695221,"about_ca_system_score_gemma":0.00049139065,"threshold_uncertainty_score":0.99336195},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03049605,0.00068629015,0.9618118,0.0014240668,0.00096266833,0.0010791463,0.00006854567,0.0001715634,0.003299873],"genre_scores_gemma":[0.8410283,0.00032966302,0.15493129,0.002760516,0.00059865275,0.000020618678,0.00014148072,0.00006275331,0.00012676837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631566,0.000042916345,0.0006022885,0.0016650693,0.00090362167,0.00047043746],"domain_scores_gemma":[0.9974814,0.0006081724,0.00019962115,0.001261258,0.00024319523,0.00020636391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012873964,0.0005099181,0.0010494662,0.0005213118,0.00024798536,0.00018034295,0.0006551833,0.00028309965,0.000005734725],"category_scores_gemma":[0.0001899237,0.0005204569,0.00018693486,0.00030554546,0.0005245515,0.0005246933,0.0007578405,0.0011801581,0.0000023047974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010690753,0.000058336667,0.00056308974,0.0002520311,0.00020162492,0.00004437506,0.0010380484,0.04440045,0.008453639,0.00064364483,0.00004520665,0.94419265],"study_design_scores_gemma":[0.0013655641,0.000087767374,0.0007664435,0.0014867104,0.00011788893,0.00006668671,0.0000015864729,0.98062664,0.005303658,0.009344338,0.00026280573,0.00056990446],"about_ca_topic_score_codex":0.00002516216,"about_ca_topic_score_gemma":0.000007615206,"teacher_disagreement_score":0.94362277,"about_ca_system_score_codex":0.00033972485,"about_ca_system_score_gemma":0.0010473512,"threshold_uncertainty_score":0.9997247},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031784156,0.0020151334,0.98977417,0.001985,0.00329281,0.00033919627,0.0000028732798,0.000068755704,0.0022042305],"genre_scores_gemma":[0.845467,0.0002682956,0.14190722,0.0017534755,0.0011056043,0.000037329428,0.000012394177,0.000058993606,0.009389729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972618,0.000044024666,0.00048586386,0.00083679013,0.0009911122,0.0003803713],"domain_scores_gemma":[0.997381,0.0009537022,0.00027646325,0.0010907311,0.00022742926,0.000070678245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009678802,0.00031626655,0.00025461847,0.00036309627,0.0006533299,0.0005082244,0.0029041918,0.0001536358,0.0000067958727],"category_scores_gemma":[0.00010882624,0.00018718386,0.00020862385,0.0011033469,0.00069521746,0.00025490337,0.0016639011,0.0005556895,0.000021171763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046555833,0.000012285083,0.00003202485,0.000023164255,0.000029243576,0.000012318775,0.0006266087,0.447242,0.00040442264,0.20363794,0.00013990616,0.34783542],"study_design_scores_gemma":[0.0000907475,0.00007264173,0.0003554819,0.0002463649,0.000013470542,0.00005453653,1.7796792e-7,0.61584437,0.0024636495,0.3744386,0.0061338036,0.0002861297],"about_ca_topic_score_codex":0.000009489223,"about_ca_topic_score_gemma":0.00009884724,"teacher_disagreement_score":0.84786695,"about_ca_system_score_codex":0.0001617802,"about_ca_system_score_gemma":0.00042442163,"threshold_uncertainty_score":0.76331365},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029711873,0.00025335263,0.9894015,0.001975507,0.00030539394,0.00044819017,0.000004858375,0.00014108568,0.0074403672],"genre_scores_gemma":[0.2605633,0.0001391383,0.7366167,0.00085036893,0.00010556192,0.000019425584,0.000034431876,0.00004396914,0.0016271129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723417,0.00004862734,0.00046050476,0.00088757224,0.0010616499,0.00030747527],"domain_scores_gemma":[0.9973302,0.0003732501,0.00027769938,0.0014380171,0.00047738457,0.000103461825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079990446,0.00032274282,0.0003565905,0.0009530608,0.00013951147,0.00027907875,0.0021447483,0.00019851168,0.000014448855],"category_scores_gemma":[0.00005722993,0.00025114598,0.00006998005,0.0009988059,0.00044200255,0.00040368602,0.0006772172,0.0006634192,0.000039716007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016138256,0.000058801874,0.000009565149,0.00007636285,0.000017598475,0.000016007438,0.00078746193,0.5988152,0.00009497247,0.0716858,0.000017360071,0.32840475],"study_design_scores_gemma":[0.0002744725,0.00052601204,0.00007731663,0.0012173726,0.000007800471,0.000020634356,1.6250192e-7,0.9462712,0.000799842,0.050161462,0.00034044907,0.0003032772],"about_ca_topic_score_codex":0.000014801598,"about_ca_topic_score_gemma":0.00007186799,"teacher_disagreement_score":0.347456,"about_ca_system_score_codex":0.00018882642,"about_ca_system_score_gemma":0.00042387628,"threshold_uncertainty_score":0.9999941},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015416562,0.00011210743,0.99056745,0.0036279974,0.001463985,0.0011532233,0.000064954314,0.00016113515,0.0013074875],"genre_scores_gemma":[0.9395759,0.00002982542,0.05397817,0.0043867584,0.000338543,0.00018271946,0.000029777946,0.00008560946,0.0013927077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968505,0.00004080787,0.00057616696,0.0013759113,0.0006914146,0.00046518055],"domain_scores_gemma":[0.9987946,0.00033255416,0.00022733348,0.0004582843,0.00007671595,0.000110480614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007530843,0.00037646614,0.0003200721,0.0010246373,0.00027150323,0.00037790742,0.0006183162,0.00015370514,0.000011263808],"category_scores_gemma":[0.0003012331,0.00037230717,0.00012472496,0.0007171706,0.0003261163,0.00036122737,0.00018567659,0.000603192,0.000023601338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000623847,0.0001011892,0.000013535507,0.00023319335,0.0000058670084,0.000053852964,0.003673688,0.33842376,0.1625769,0.03952534,0.00024600563,0.45508426],"study_design_scores_gemma":[0.00023926204,0.00006832311,0.000070548456,0.00021209675,0.000008183413,0.000028546676,0.0000013520875,0.8434351,0.02875052,0.12648495,0.00034702933,0.00035409478],"about_ca_topic_score_codex":0.000024708,"about_ca_topic_score_gemma":0.00037520967,"teacher_disagreement_score":0.93803424,"about_ca_system_score_codex":0.00082862057,"about_ca_system_score_gemma":0.000349891,"threshold_uncertainty_score":0.99987286},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034530915,0.0009365035,0.9412971,0.05061341,0.0020156337,0.0009372011,0.000029733312,0.000099603,0.0006177302],"genre_scores_gemma":[0.92474574,0.000051051367,0.03872451,0.033935994,0.0010535768,0.000025287714,0.000014782824,0.00012009856,0.001328978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997248,0.000028890701,0.00048004568,0.00084914506,0.00095290825,0.0004409868],"domain_scores_gemma":[0.9980437,0.00034899914,0.00015979314,0.0011144581,0.000196279,0.00013675356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000611472,0.0003519086,0.00044185287,0.0005932551,0.00024758148,0.00020972369,0.0008504047,0.000109102075,0.000009754803],"category_scores_gemma":[0.000116129966,0.00023232138,0.00018854385,0.0008824055,0.0005023597,0.00011877516,0.0006716392,0.0007141398,0.000020410402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012518437,0.000023528932,0.00007179439,0.00011921804,0.000024880512,0.000039800063,0.0020021375,0.8399062,0.0016413837,0.0020206731,0.0021267685,0.15201108],"study_design_scores_gemma":[0.00021046169,0.000112594156,0.0004978421,0.003413636,0.00012795268,0.00007908136,3.5073347e-7,0.86470646,0.004923291,0.110145345,0.015288533,0.0004944405],"about_ca_topic_score_codex":0.0002776223,"about_ca_topic_score_gemma":0.0006338822,"teacher_disagreement_score":0.9212926,"about_ca_system_score_codex":0.0004663659,"about_ca_system_score_gemma":0.0005485479,"threshold_uncertainty_score":0.9473791},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019916128,0.00033210454,0.9849406,0.0072972835,0.0029888821,0.00055659394,0.00000975021,0.00011754114,0.0017656292],"genre_scores_gemma":[0.3179966,0.00016230415,0.63243943,0.019956408,0.009354097,0.00026211515,0.00029859174,0.00035874065,0.0191717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813133,0.000007849541,0.00032181194,0.0007240821,0.00047311356,0.00034183505],"domain_scores_gemma":[0.99883175,0.0004996829,0.00009317798,0.00031883369,0.00010693894,0.00014961201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006105404,0.0002687889,0.00036353033,0.0005419603,0.00017786284,0.00017279503,0.00024355375,0.00007669717,0.000032001597],"category_scores_gemma":[0.00019229116,0.00023191157,0.00013237937,0.00022158098,0.00043085573,0.00016502924,0.00014342561,0.0008263736,0.000034864916],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006118263,0.000048446003,0.00022582481,0.000764278,0.000080096084,0.00046319354,0.0012926314,0.020095214,0.002192832,0.0071091377,0.0006159244,0.96705127],"study_design_scores_gemma":[0.0013262322,0.0005598675,0.0002087475,0.0029655846,0.00016398264,0.0008378997,0.0000036914214,0.88000757,0.00094669795,0.06377342,0.048501898,0.00070443546],"about_ca_topic_score_codex":0.000017217239,"about_ca_topic_score_gemma":0.000010990382,"teacher_disagreement_score":0.9663468,"about_ca_system_score_codex":0.00029353256,"about_ca_system_score_gemma":0.0002486707,"threshold_uncertainty_score":0.9457079},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030412864,0.0034953142,0.97087497,0.0007733001,0.017515237,0.0005426881,0.000006135219,0.00085898396,0.005930317],"genre_scores_gemma":[0.0064724227,0.000027583605,0.98321134,0.0008657706,0.0020686437,0.000045084813,0.00001411277,0.00009676855,0.007198287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935389,0.00010480663,0.00079840457,0.0025945825,0.0016939703,0.0012693265],"domain_scores_gemma":[0.9963364,0.0004916216,0.0002814683,0.002328674,0.00023755059,0.00032427552],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015970294,0.0008066319,0.0009420828,0.0014993813,0.00023906051,0.0024019992,0.0067857313,0.0005364194,0.000004423687],"category_scores_gemma":[0.00015021906,0.000717365,0.00019077168,0.0021651553,0.0006142769,0.000675072,0.0025247198,0.0016408385,0.0005133663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0300583e-7,0.0000234952,0.000005937496,0.00019377733,0.000020505588,0.0008705069,0.000876139,0.76576483,0.000011024107,0.0052463003,0.00091909553,0.22606756],"study_design_scores_gemma":[0.000119533805,0.00014172557,0.00003777723,0.0011680718,0.000016528771,0.0004874224,1.376784e-7,0.9588217,0.000060326664,0.03629551,0.0020695147,0.00078176346],"about_ca_topic_score_codex":0.000070860995,"about_ca_topic_score_gemma":0.000005036172,"teacher_disagreement_score":0.2252858,"about_ca_system_score_codex":0.001587868,"about_ca_system_score_gemma":0.0046713417,"threshold_uncertainty_score":0.99952775},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030412864,0.0034953142,0.97087497,0.0007733001,0.017515237,0.0005426881,0.000006135219,0.00085898396,0.005930317],"genre_scores_gemma":[0.0064724227,0.000027583605,0.98321134,0.0008657706,0.0020686437,0.000045084813,0.00001411277,0.00009676855,0.007198287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935389,0.00010480663,0.00079840457,0.0025945825,0.0016939703,0.0012693265],"domain_scores_gemma":[0.9963364,0.0004916216,0.0002814683,0.002328674,0.00023755059,0.00032427552],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015970294,0.0008066319,0.0009420828,0.0014993813,0.00023906051,0.0024019992,0.0067857313,0.0005364194,0.000004423687],"category_scores_gemma":[0.00015021906,0.000717365,0.00019077168,0.0021651553,0.0006142769,0.000675072,0.0025247198,0.0016408385,0.0005133663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0300583e-7,0.0000234952,0.000005937496,0.00019377733,0.000020505588,0.0008705069,0.000876139,0.76576483,0.000011024107,0.0052463003,0.00091909553,0.22606756],"study_design_scores_gemma":[0.000119533805,0.00014172557,0.00003777723,0.0011680718,0.000016528771,0.0004874224,1.376784e-7,0.9588217,0.000060326664,0.03629551,0.0020695147,0.00078176346],"about_ca_topic_score_codex":0.000070860995,"about_ca_topic_score_gemma":0.000005036172,"teacher_disagreement_score":0.2252858,"about_ca_system_score_codex":0.001587868,"about_ca_system_score_gemma":0.0046713417,"threshold_uncertainty_score":0.99952775},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011409789,0.00017565627,0.98424226,0.0014569685,0.00039525895,0.00065441156,0.000006831325,0.00046978885,0.0011890269],"genre_scores_gemma":[0.7441878,0.00002848405,0.2540898,0.00045149986,0.00025633865,0.00001725401,0.000012481358,0.000062436855,0.00089394866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952162,0.000033432767,0.00051474286,0.0024447695,0.0011302109,0.000660665],"domain_scores_gemma":[0.99781,0.00025562834,0.00025994587,0.0011065126,0.00031139562,0.00025650815],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006054967,0.00068821805,0.0005041692,0.0008832005,0.0004402003,0.0012824223,0.0016920246,0.0004186936,0.000007965759],"category_scores_gemma":[0.000055845863,0.00058368105,0.00010705078,0.0007702522,0.00110991,0.0007648299,0.0013828293,0.0014884042,0.000060507562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009048649,0.0000915605,0.0009835252,0.0001795987,0.000041200397,0.00014163373,0.0023232102,0.5696635,0.0014624213,0.02598442,0.000013344381,0.39902508],"study_design_scores_gemma":[0.00039401813,0.0002449701,0.0020885307,0.0003497554,0.000017454238,0.00017847319,2.7436045e-7,0.95906746,0.00012341978,0.036802124,0.00008137335,0.00065213174],"about_ca_topic_score_codex":0.000115694136,"about_ca_topic_score_gemma":0.00003883502,"teacher_disagreement_score":0.73277795,"about_ca_system_score_codex":0.00044574408,"about_ca_system_score_gemma":0.00043587852,"threshold_uncertainty_score":0.99975437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018689166,0.00128599,0.98903275,0.0013893628,0.0023817492,0.00071487733,0.00004078612,0.0005310269,0.004436561],"genre_scores_gemma":[0.36776966,0.000025328358,0.62884843,0.0008596378,0.001668559,0.000024776506,0.00009129511,0.0003054353,0.00040690484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681634,0.000016177455,0.0004798423,0.0012934399,0.0006104037,0.0007838164],"domain_scores_gemma":[0.9981601,0.00051019306,0.000110887646,0.00088522956,0.00017242841,0.00016113702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039524096,0.00072698406,0.0005476851,0.0009969047,0.00015842996,0.00047751647,0.0006831459,0.00028351555,0.00002540045],"category_scores_gemma":[0.00008409859,0.000702786,0.00025502636,0.00045324428,0.0006514066,0.00018542664,0.00013815363,0.0012269336,0.000036960297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002333595,0.000013974336,0.0000040288082,0.00026233852,0.000040385046,0.00013355425,0.0008567266,0.71537423,0.012131021,0.0017065739,0.0002512399,0.2692026],"study_design_scores_gemma":[0.00025781445,0.00007488218,0.000018852188,0.0006913302,0.00004437011,0.000098960925,7.503632e-7,0.9541429,0.006134754,0.032187853,0.005579673,0.00076784263],"about_ca_topic_score_codex":0.000008065026,"about_ca_topic_score_gemma":0.00004119976,"teacher_disagreement_score":0.36758277,"about_ca_system_score_codex":0.0006689893,"about_ca_system_score_gemma":0.00028297596,"threshold_uncertainty_score":0.99954236},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050871423,0.019154344,0.059284046,0.22399385,0.007885517,0.003979333,0.000053435335,0.00025218748,0.68031013],"genre_scores_gemma":[0.98574966,0.001282914,0.0018860142,0.0067597376,0.0013774156,0.000011191851,0.000001583118,0.000037793452,0.0028937068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970399,0.00010272481,0.000394317,0.0005466275,0.0014139949,0.0005024299],"domain_scores_gemma":[0.9977229,0.0012043298,0.00023359386,0.00051259727,0.00026117996,0.0000653737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004734352,0.00023865754,0.00031998305,0.00014529905,0.0007025973,0.0006875861,0.002251934,0.00033049818,0.00001736836],"category_scores_gemma":[0.0007365859,0.00015663133,0.00012805623,0.00060100586,0.0026567187,0.00036203963,0.00032365855,0.001650166,0.0000081359885],"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.0000031168488,0.000014731563,0.000079016456,0.00006707887,0.000007626452,0.000035210123,0.06360834,0.0006662906,0.000037833157,0.91053414,0.00017499414,0.024771627],"study_design_scores_gemma":[0.000081392725,0.000057554284,0.00019486605,0.0011808544,0.000014726317,0.00000201262,0.000054696622,0.0015013603,0.00005622505,0.98592085,0.010645197,0.00029028647],"about_ca_topic_score_codex":0.0030482686,"about_ca_topic_score_gemma":0.022659274,"teacher_disagreement_score":0.9806625,"about_ca_system_score_codex":0.00029449907,"about_ca_system_score_gemma":0.0011099163,"threshold_uncertainty_score":0.99517465},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013616769,0.00038307568,0.9946017,0.00039619222,0.00085332216,0.00038451544,8.2969945e-7,0.0003879247,0.0029910258],"genre_scores_gemma":[0.0016447478,0.00015996187,0.9959114,0.000600475,0.00010167904,0.000017824343,0.000008084021,0.00001559255,0.0015402143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973925,0.000055307675,0.00039363824,0.0011939089,0.0005504983,0.00041416445],"domain_scores_gemma":[0.9983348,0.0005052333,0.00020597335,0.0005944539,0.0002541455,0.00010536938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006366177,0.0003462277,0.00034745963,0.0012280205,0.00023708101,0.00057550037,0.0016387079,0.0002420442,0.000007942833],"category_scores_gemma":[0.00034512798,0.000343686,0.000050062663,0.0013486568,0.00039954626,0.00040409595,0.0015036226,0.00063533155,0.0000030001129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010723986,0.000010759821,0.00002659097,0.00002960866,0.0000036711144,0.000006980921,0.0003696265,0.6631205,0.0000026005105,0.007443923,0.00004363238,0.32894102],"study_design_scores_gemma":[0.00008348789,0.00011879573,0.0000052998857,0.0003548827,0.0000047546905,0.000018129078,1.4212908e-7,0.9587831,0.00035746355,0.03943627,0.00052769773,0.00030998842],"about_ca_topic_score_codex":0.0000051562224,"about_ca_topic_score_gemma":0.0000035802595,"teacher_disagreement_score":0.328631,"about_ca_system_score_codex":0.00038059376,"about_ca_system_score_gemma":0.00079350296,"threshold_uncertainty_score":0.99990153},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003594738,0.00030465153,0.9964454,0.0004406185,0.00090033334,0.00063472847,0.000013004652,0.000090285816,0.0008114989],"genre_scores_gemma":[0.19147584,0.0000021615522,0.8062605,0.0006945051,0.00043600696,0.000027143798,0.000015545387,0.000033156597,0.0010551024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954218,0.00013803228,0.0007473843,0.0014816541,0.0015887327,0.0006223992],"domain_scores_gemma":[0.9893171,0.008160243,0.0003997415,0.0010637111,0.00093259447,0.00012661166],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0072584627,0.00039037273,0.00048292443,0.0010883574,0.0014761606,0.0012729814,0.002384637,0.0002841367,0.000016593305],"category_scores_gemma":[0.0029404412,0.00026498368,0.00022215548,0.0011501224,0.0007243097,0.0003257571,0.00025473858,0.00087533245,0.0000098732435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000852469,0.000016604792,0.0002716517,0.000010834155,0.000009829242,0.0000016498282,0.00046090045,0.85547,0.000044068835,0.0009910625,0.00002680743,0.14268807],"study_design_scores_gemma":[0.00019969736,0.00007606658,0.00008359945,0.00013945183,0.000042455886,0.000007650779,0.0000029105195,0.9691287,0.00009112733,0.028775733,0.0011369232,0.0003156774],"about_ca_topic_score_codex":0.00009572594,"about_ca_topic_score_gemma":0.000083918705,"teacher_disagreement_score":0.19111636,"about_ca_system_score_codex":0.00019892288,"about_ca_system_score_gemma":0.0015025666,"threshold_uncertainty_score":0.9999802},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014111248,0.000047567315,0.99320143,0.00012294676,0.0005951347,0.00039694548,0.000043545522,0.000047183166,0.0054041483],"genre_scores_gemma":[0.95805013,0.0000064314886,0.035673726,0.0007046986,0.001404187,0.000039664366,0.000058036363,0.00004677473,0.0040163393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985218,0.0000116271785,0.00026905554,0.00065075763,0.00023539171,0.00031135193],"domain_scores_gemma":[0.9990445,0.00012264936,0.0001813486,0.00046556245,0.000115816016,0.000070153845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013040652,0.00028458555,0.00025993033,0.00013098813,0.00036737515,0.00019685268,0.0005026516,0.000092414324,0.00016030746],"category_scores_gemma":[0.0000020496268,0.0002864297,0.000114020826,0.00027049426,0.00023157289,0.00013235727,0.00024839758,0.00043947253,0.00005779447],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000303533,0.000033488173,0.00018878489,0.000012561421,0.000022653456,0.0000010669736,0.00012254454,0.019941567,0.00020004147,0.0372387,0.000094473784,0.9421411],"study_design_scores_gemma":[0.0014778234,0.0001495389,0.00074451254,0.00080397096,0.000089899746,0.0000018861921,0.0000071538184,0.61366475,0.00796482,0.31126228,0.061917387,0.0019159722],"about_ca_topic_score_codex":0.00008566319,"about_ca_topic_score_gemma":0.00008270547,"teacher_disagreement_score":0.95790905,"about_ca_system_score_codex":0.00009389307,"about_ca_system_score_gemma":0.00014514904,"threshold_uncertainty_score":0.9999588},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019193953,0.0001920325,0.9953537,0.00065426703,0.0018947932,0.00084093376,0.000018752164,0.00014989682,0.00070366677],"genre_scores_gemma":[0.32930544,0.000008211043,0.6695021,0.0008457757,0.00012568475,0.00004769728,0.0000091345455,0.000021267373,0.00013472655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959561,0.000041812254,0.0006921733,0.0018442451,0.00075754354,0.0007081253],"domain_scores_gemma":[0.9968965,0.0013124918,0.0003315679,0.00096656056,0.0003917356,0.00010116101],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008757457,0.0005192052,0.0005885023,0.0015488948,0.00024818096,0.00030227084,0.0026284517,0.0004393969,0.000004115717],"category_scores_gemma":[0.00026917204,0.0005341019,0.00012368939,0.0008716239,0.0004985501,0.00031771982,0.001176944,0.00086978666,0.0000037494372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008454281,0.000011699473,0.000018742228,0.000039278355,0.0000035665275,0.000013192945,0.00041499216,0.75487703,0.000045297216,0.042157482,0.0000057113684,0.20240454],"study_design_scores_gemma":[0.00032360083,0.000076043885,0.00007392971,0.00023947349,0.0000037013094,0.000013491835,1.0676649e-7,0.6868749,0.0002277251,0.31177163,0.000056762354,0.0003385774],"about_ca_topic_score_codex":0.0000120823515,"about_ca_topic_score_gemma":0.00014217578,"teacher_disagreement_score":0.3291135,"about_ca_system_score_codex":0.00088332035,"about_ca_system_score_gemma":0.0017160103,"threshold_uncertainty_score":0.99971104},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021660228,0.00045804973,0.99200237,0.0044494453,0.0008581938,0.00075777015,0.0002218327,0.00092912186,0.00030156126],"genre_scores_gemma":[0.029601725,0.00007020233,0.9688492,0.00047312802,0.00015128817,0.0000309592,0.00058702857,0.00004523317,0.00019122667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994723,0.000045716108,0.00053322647,0.0029518246,0.00084799,0.0008982479],"domain_scores_gemma":[0.9867613,0.0010424042,0.00039380323,0.011316257,0.00036336537,0.00012289823],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00095634477,0.0006546248,0.00063764275,0.0006768806,0.000651947,0.0011711683,0.05285118,0.0005123046,0.0000067256688],"category_scores_gemma":[0.0065047042,0.0005399883,0.00007038879,0.00088659377,0.00066405965,0.0010051284,0.13086933,0.0012515389,0.000006347491],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038434333,0.000036494228,0.000057068897,0.00012318221,0.000048139496,0.00013164413,0.000032014173,0.014631521,0.00017411259,0.0008000287,0.004164612,0.97976273],"study_design_scores_gemma":[0.00036506663,0.00023544849,0.000007870295,0.00072398,0.000014095024,0.00006097997,9.26428e-8,0.8845157,0.002498695,0.10577018,0.005217883,0.0005899936],"about_ca_topic_score_codex":0.000021834356,"about_ca_topic_score_gemma":0.000071832714,"teacher_disagreement_score":0.97917277,"about_ca_system_score_codex":0.00032319003,"about_ca_system_score_gemma":0.00083265145,"threshold_uncertainty_score":0.9998657},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004350315,0.00015764883,0.9931667,0.0014434711,0.0017266609,0.0008636367,0.000009537737,0.00020655975,0.0023823245],"genre_scores_gemma":[0.16466221,0.00008231501,0.8283434,0.0032189281,0.0007696154,0.00013209155,0.000020710337,0.000047543577,0.0027231835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635434,0.000035940942,0.00045725194,0.0017448505,0.0009482822,0.00045935102],"domain_scores_gemma":[0.9977224,0.00026106337,0.00026004217,0.001417442,0.00021967315,0.00011938437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000608951,0.0004333989,0.00035938562,0.0010421171,0.00028327477,0.00081124075,0.0024241034,0.00023628202,0.0000062920044],"category_scores_gemma":[0.000049017264,0.00043071122,0.000097833756,0.0010982977,0.00021605896,0.0012723624,0.0013449088,0.0004760416,0.00006195828],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000726904,0.000014739121,0.000016514834,0.000035489185,0.0000052785726,0.000004843062,0.00032581404,0.02451578,0.002152862,0.005420995,0.00016810084,0.9673323],"study_design_scores_gemma":[0.00065645296,0.000563318,0.00083969574,0.001068673,0.000029495732,0.00004134451,0.000001193054,0.6792039,0.1382539,0.16760044,0.009873798,0.0018677613],"about_ca_topic_score_codex":0.00008024212,"about_ca_topic_score_gemma":0.00012720136,"teacher_disagreement_score":0.96546453,"about_ca_system_score_codex":0.0010136493,"about_ca_system_score_gemma":0.00047355404,"threshold_uncertainty_score":0.99981445},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002036473,0.00048648438,0.98554397,0.0014005343,0.002499168,0.00082889583,0.000031192252,0.00018289758,0.006990385],"genre_scores_gemma":[0.8562863,0.0018157171,0.109604895,0.0071156826,0.0038727878,0.00013698406,0.00031987112,0.000105473475,0.020742305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980993,0.00001326899,0.00033481975,0.00079349155,0.00053072354,0.00022835447],"domain_scores_gemma":[0.99892634,0.00021063772,0.0001411099,0.0005034967,0.00013982576,0.00007861039],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021014642,0.00027489345,0.00032745628,0.0006689647,0.00013044673,0.000110545094,0.00023798028,0.0002296633,0.000110155794],"category_scores_gemma":[0.00010635155,0.00024630697,0.00010014192,0.00024390017,0.00018633914,0.000109603876,0.00024023665,0.00042243866,0.000024379233],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003765609,0.000036816316,0.00028790574,0.000067988345,0.000025041529,0.000053289918,0.00010446937,0.00043119365,0.0020876697,0.00018118943,0.0005383658,0.9961484],"study_design_scores_gemma":[0.005678078,0.0040137772,0.05596111,0.011198468,0.001124514,0.00034755596,0.000007034648,0.39650306,0.18817054,0.1341261,0.1996958,0.0031739585],"about_ca_topic_score_codex":0.00011388626,"about_ca_topic_score_gemma":0.00007212773,"teacher_disagreement_score":0.99297446,"about_ca_system_score_codex":0.00035866172,"about_ca_system_score_gemma":0.00016451342,"threshold_uncertainty_score":0.9999989},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030101545,0.0021483216,0.9625491,0.0017130916,0.001161062,0.002119104,0.00001731745,0.000107868706,0.00008260679],"genre_scores_gemma":[0.7289001,0.00016689886,0.26879248,0.0017899309,0.00018545288,0.000010013453,0.000019558081,0.00004055602,0.000095003525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99403185,0.0003753424,0.0010173894,0.0023158877,0.0014898812,0.00076963555],"domain_scores_gemma":[0.99427515,0.0016122399,0.0006692482,0.0027082486,0.00053104403,0.00020407214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020065585,0.0004861697,0.0008193689,0.0009844314,0.00042194387,0.0002826043,0.0026939036,0.00017983143,0.000006849838],"category_scores_gemma":[0.00062774547,0.00047993928,0.00004593885,0.0009560199,0.0002723277,0.00048448116,0.0033466055,0.0013050798,0.0000016605024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008320953,0.00018106817,0.00042081732,0.00055741525,0.000043345757,0.000018969278,0.016156409,0.06445502,0.000037328708,0.005399623,0.000035261837,0.91261154],"study_design_scores_gemma":[0.0007169433,0.010303213,0.0008501933,0.0015176412,0.000023184732,0.000046811347,0.00010533515,0.947687,0.000060768565,0.037042726,0.0008611157,0.000785115],"about_ca_topic_score_codex":0.00072144374,"about_ca_topic_score_gemma":0.001142991,"teacher_disagreement_score":0.91182643,"about_ca_system_score_codex":0.00095062726,"about_ca_system_score_gemma":0.0023398767,"threshold_uncertainty_score":0.9997652},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010861865,0.00046726235,0.991586,0.0011347038,0.002085052,0.0010737682,0.000053598225,0.00025374762,0.0033349856],"genre_scores_gemma":[0.014365297,0.000078914825,0.97839165,0.0030234803,0.00037872803,0.000104445804,0.0000322282,0.000062584964,0.0035626728],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99487174,0.00005040222,0.00061352283,0.002332499,0.00092130614,0.0012105368],"domain_scores_gemma":[0.99520475,0.0014741451,0.0002633506,0.0023400493,0.00045849624,0.0002592275],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015864896,0.0006800439,0.0007374498,0.0018382178,0.0005562001,0.00075906864,0.0065385946,0.00045576133,0.000008239979],"category_scores_gemma":[0.0002648411,0.00064189266,0.00029990714,0.0010902404,0.0011375776,0.00073457434,0.001425513,0.0011355574,0.00001008166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040059746,0.000034883782,0.000035153505,0.00012017803,0.000031150095,0.000044445133,0.0002469975,0.0009928221,0.00023190604,0.482479,0.00016729957,0.51557606],"study_design_scores_gemma":[0.00038274602,0.00024662682,0.000017504597,0.00020770765,0.0000073972265,0.000022044744,9.716891e-8,0.2397726,0.00080907723,0.7535857,0.0043766596,0.00057185104],"about_ca_topic_score_codex":0.000022931275,"about_ca_topic_score_gemma":0.00015189614,"teacher_disagreement_score":0.5150042,"about_ca_system_score_codex":0.0003524872,"about_ca_system_score_gemma":0.0010487125,"threshold_uncertainty_score":0.9996032},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008545936,0.00008756826,0.9892759,0.0071070353,0.0002025833,0.00041926728,0.000008207278,0.000022130827,0.0020227171],"genre_scores_gemma":[0.57197523,0.000036532158,0.42319575,0.0033049518,0.0006476502,0.000025114785,0.00007976954,0.000035391364,0.00069959555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811375,0.000017451826,0.00041625038,0.0004492716,0.00076760113,0.0002356979],"domain_scores_gemma":[0.9980149,0.0009803394,0.00022855897,0.00038765452,0.000256294,0.00013223103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001364278,0.00020058062,0.00035726212,0.0002774721,0.00014568825,0.00006124454,0.0005298932,0.00010918343,0.000029020579],"category_scores_gemma":[0.0026570044,0.00012595092,0.00017961115,0.00019566997,0.0012451893,0.00007160114,0.00016262564,0.0008109083,0.0000010916947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024672157,0.000053167932,0.0011285916,0.0002866324,0.00007740067,0.000011403955,0.00062693,0.071279585,0.0011373942,0.015653318,0.0006860709,0.90903485],"study_design_scores_gemma":[0.00034716842,0.00006489809,0.0005259434,0.00072801806,0.000025133879,0.00003230122,2.2848113e-7,0.9394065,0.00004694374,0.058647618,0.00007537473,0.000099833655],"about_ca_topic_score_codex":0.0000368176,"about_ca_topic_score_gemma":0.00000820453,"teacher_disagreement_score":0.908935,"about_ca_system_score_codex":0.00021129221,"about_ca_system_score_gemma":0.0026109314,"threshold_uncertainty_score":0.5136129},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001557599,0.00006499122,0.98821366,0.003909056,0.000743393,0.0010947358,0.00005690554,0.00032291483,0.005592788],"genre_scores_gemma":[0.14159252,0.00003214404,0.8491678,0.007173102,0.0003743616,0.00013869685,0.000053368356,0.000041846386,0.0014261553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652326,0.000048785394,0.0005466213,0.0015989448,0.00076582993,0.00051656284],"domain_scores_gemma":[0.99583846,0.0015375911,0.00035625588,0.001303504,0.00083907926,0.00012512325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010159038,0.0004951413,0.00051776064,0.00075147656,0.00032372042,0.0005465456,0.002577813,0.00038882927,0.000011847608],"category_scores_gemma":[0.00045010814,0.00045124124,0.00020198499,0.00056037947,0.00089655956,0.00044343527,0.00032779836,0.0006600718,0.000015270376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006137273,0.00010705729,0.000013955817,0.000095547344,0.000012237758,0.000022444478,0.00012067763,0.00027083574,0.0011525826,0.2226229,0.00022728536,0.7752931],"study_design_scores_gemma":[0.00050817855,0.00033072545,0.00016000842,0.0003914392,0.000011917082,0.000005026498,1.8728785e-7,0.86202586,0.025938312,0.10636734,0.0037083,0.0005526837],"about_ca_topic_score_codex":0.0000052904256,"about_ca_topic_score_gemma":0.000008437043,"teacher_disagreement_score":0.8617551,"about_ca_system_score_codex":0.00046797626,"about_ca_system_score_gemma":0.0010282259,"threshold_uncertainty_score":0.99979395},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005414883,0.0041629625,0.9837747,0.000058860882,0.0009209544,0.00011571632,0.000015665524,0.00028283734,0.010614116],"genre_scores_gemma":[0.44514975,0.001468365,0.5467808,0.0022768034,0.0009981197,0.000051036714,0.000043124983,0.00023968256,0.002992277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845165,0.000008452372,0.00025858826,0.0005724377,0.00030951478,0.00039937865],"domain_scores_gemma":[0.99888754,0.00043448206,0.00004328134,0.00049420394,0.000059228747,0.00008126775],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020782957,0.00034697243,0.00033604048,0.00040135512,0.000098062,0.0002461305,0.00071192544,0.00023082405,0.00006374466],"category_scores_gemma":[0.00005879331,0.00033680318,0.000071760514,0.00033328444,0.00024753067,0.00011465573,0.00014386325,0.00050373084,0.000024022755],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015756523,0.0000063783923,0.00002370691,0.0001591286,0.000012273802,0.000013368177,0.00011347618,0.0061367387,0.00067914673,0.00010693961,0.00037974206,0.9923675],"study_design_scores_gemma":[0.00033991094,0.000105969346,0.00005307769,0.002768637,0.000077807286,0.000057840636,6.374798e-7,0.69424236,0.1363447,0.06687307,0.09685338,0.0022825855],"about_ca_topic_score_codex":0.00006318796,"about_ca_topic_score_gemma":0.000019999918,"teacher_disagreement_score":0.99008495,"about_ca_system_score_codex":0.00016893564,"about_ca_system_score_gemma":0.00009880774,"threshold_uncertainty_score":0.9999084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000093211485,0.00007814233,0.9908926,0.0010378365,0.0027116535,0.00091135013,0.000034568413,0.00024608363,0.003994581],"genre_scores_gemma":[0.21735229,0.0002711046,0.7572449,0.016852884,0.0032157265,0.00040917337,0.0005553573,0.00015840813,0.003940169],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684393,0.000029154015,0.0005569595,0.0013668013,0.0006373179,0.00056581566],"domain_scores_gemma":[0.99793917,0.0005418222,0.00025657556,0.00068850303,0.0004461394,0.00012779544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006070373,0.00048572492,0.0004420959,0.0012576283,0.00040410142,0.0004896115,0.0011967827,0.00041930683,0.00007505757],"category_scores_gemma":[0.000059186892,0.00048517392,0.0002833915,0.0005347389,0.000261523,0.00087070576,0.00008301952,0.0005979396,0.00006552154],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002017284,0.000043045788,0.000002004493,0.00016511478,0.000011899454,0.000008126014,0.00009591547,0.0019891432,0.00027890631,0.0013769013,0.00013509681,0.9958737],"study_design_scores_gemma":[0.0014513758,0.00045522643,0.00003718245,0.0017353722,0.000054243676,0.00002682075,3.3579698e-7,0.6267077,0.043284234,0.3102221,0.014673493,0.0013519563],"about_ca_topic_score_codex":0.000013147097,"about_ca_topic_score_gemma":0.00015703234,"teacher_disagreement_score":0.99452174,"about_ca_system_score_codex":0.0003422627,"about_ca_system_score_gemma":0.0007735422,"threshold_uncertainty_score":0.99976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003406957,0.00012241171,0.99374914,0.00055542117,0.0023169825,0.00085390254,0.000007224229,0.00015896556,0.0022019008],"genre_scores_gemma":[0.06459254,0.00004876372,0.92403096,0.0039943703,0.00027550827,0.00012766567,0.00001843656,0.000029375753,0.006882405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967311,0.000024261824,0.00054790615,0.001409816,0.0007865537,0.0005003312],"domain_scores_gemma":[0.9983369,0.0002001195,0.00026668824,0.0008170148,0.00027749696,0.000101770565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076023943,0.00041386732,0.00037622082,0.00081092113,0.0003402713,0.0004459167,0.0016387008,0.00019353465,0.000015418564],"category_scores_gemma":[0.00005795613,0.00039653073,0.00018409673,0.0005028985,0.00018762973,0.0005981598,0.00057635666,0.0003434939,0.000022014416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014474913,0.00004886204,0.0000044794565,0.00010612938,0.000017321196,0.0000054167776,0.0007768644,0.07280482,0.0019634282,0.028619565,0.00013702177,0.8955016],"study_design_scores_gemma":[0.00029915656,0.00017133798,0.000004056892,0.00019106356,0.000010517629,0.000006046219,2.1717804e-7,0.8782964,0.008721509,0.11150546,0.00042888973,0.00036534914],"about_ca_topic_score_codex":0.000008855964,"about_ca_topic_score_gemma":0.00005779121,"teacher_disagreement_score":0.89513624,"about_ca_system_score_codex":0.00046011925,"about_ca_system_score_gemma":0.00055263384,"threshold_uncertainty_score":0.99984866},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060400616,0.00034457337,0.99195164,0.0002975941,0.0011119352,0.00035421507,0.0000034401487,0.00016466653,0.0057115145],"genre_scores_gemma":[0.037873287,0.000058500875,0.9603415,0.0007910093,0.00011157176,0.000023586268,0.000008850059,0.000014313526,0.00077736296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706215,0.00004981543,0.00053050957,0.0013345856,0.0006171013,0.00040583123],"domain_scores_gemma":[0.9976599,0.00028603672,0.00032932017,0.0013437428,0.00028279,0.000098184806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014616487,0.00035690077,0.00034643,0.0008269909,0.00021002158,0.0006147582,0.0025672368,0.0003054079,0.000002585462],"category_scores_gemma":[0.00036109102,0.00035800657,0.000060330243,0.0009187479,0.0004870639,0.0011050352,0.0008026649,0.0006623855,0.000009779158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005241196,0.000021109285,0.00001648544,0.000106720356,0.0000056353733,0.0000032183177,0.0014137827,0.08291514,0.0001856287,0.028354472,0.000101655634,0.8868709],"study_design_scores_gemma":[0.00009452212,0.000030722087,0.00040019926,0.00029055052,0.00000486002,0.000009323841,1.1595359e-7,0.8770392,0.0013375131,0.120180584,0.00031618372,0.00029621352],"about_ca_topic_score_codex":0.000007906929,"about_ca_topic_score_gemma":0.0000090906115,"teacher_disagreement_score":0.8865747,"about_ca_system_score_codex":0.00047619877,"about_ca_system_score_gemma":0.0013567664,"threshold_uncertainty_score":0.99988717},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026551059,0.00033391762,0.9792368,0.00018670688,0.001802095,0.00037912716,0.000002126981,0.00014349446,0.017889215],"genre_scores_gemma":[0.754194,0.000018510827,0.24406083,0.00038936353,0.0001856949,0.000011080365,0.000005928797,0.000014688716,0.0011198943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967624,0.0000538473,0.00070783525,0.0010461623,0.0009803097,0.0004494768],"domain_scores_gemma":[0.9970361,0.00085518113,0.00046611126,0.0012123246,0.00032937955,0.00010091505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009952333,0.0003890603,0.00058325275,0.00084384816,0.00016296624,0.00025759925,0.0027717338,0.00032913915,0.000037400707],"category_scores_gemma":[0.00032366096,0.0003365203,0.00013065177,0.000813186,0.0005141007,0.0004828804,0.0011880434,0.0005441745,0.000039946866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001131564,0.000019892457,0.00020799052,0.00009578771,0.000013127694,0.000020582947,0.00042273596,0.0018241577,0.000015172282,0.54965657,0.000021363665,0.44770148],"study_design_scores_gemma":[0.00020883064,0.00013274966,0.0006274143,0.0002635529,0.000009101552,0.00002672815,1.248021e-7,0.4564912,0.0002953564,0.5405444,0.0009938179,0.00040674006],"about_ca_topic_score_codex":0.00005645299,"about_ca_topic_score_gemma":0.00006023387,"teacher_disagreement_score":0.75416744,"about_ca_system_score_codex":0.00018166387,"about_ca_system_score_gemma":0.0014179179,"threshold_uncertainty_score":0.9999087},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060400616,0.00034457337,0.99195164,0.0002975941,0.0011119352,0.00035421507,0.0000034401487,0.00016466653,0.0057115145],"genre_scores_gemma":[0.037873287,0.000058500875,0.9603415,0.0007910093,0.00011157176,0.000023586268,0.000008850059,0.000014313526,0.00077736296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706215,0.00004981543,0.00053050957,0.0013345856,0.0006171013,0.00040583123],"domain_scores_gemma":[0.9976599,0.00028603672,0.00032932017,0.0013437428,0.00028279,0.000098184806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014616487,0.00035690077,0.00034643,0.0008269909,0.00021002158,0.0006147582,0.0025672368,0.0003054079,0.000002585462],"category_scores_gemma":[0.00036109102,0.00035800657,0.000060330243,0.0009187479,0.0004870639,0.0011050352,0.0008026649,0.0006623855,0.000009779158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005241196,0.000021109285,0.00001648544,0.000106720356,0.0000056353733,0.0000032183177,0.0014137827,0.08291514,0.0001856287,0.028354472,0.000101655634,0.8868709],"study_design_scores_gemma":[0.00009452212,0.000030722087,0.00040019926,0.00029055052,0.00000486002,0.000009323841,1.1595359e-7,0.8770392,0.0013375131,0.120180584,0.00031618372,0.00029621352],"about_ca_topic_score_codex":0.000007906929,"about_ca_topic_score_gemma":0.0000090906115,"teacher_disagreement_score":0.8865747,"about_ca_system_score_codex":0.00047619877,"about_ca_system_score_gemma":0.0013567664,"threshold_uncertainty_score":0.99988717},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025111829,0.00019932649,0.9832191,0.00020977837,0.0007916699,0.004202654,0.000035323363,0.00014259084,0.011174433],"genre_scores_gemma":[0.049501818,0.000028782242,0.94937944,0.000159669,0.00016940499,0.0005755614,0.0000070219903,0.000023212307,0.00015506103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952393,0.00008148602,0.0011882506,0.0016396615,0.0013333013,0.0005180107],"domain_scores_gemma":[0.9930248,0.002575299,0.0009281813,0.0027841327,0.0005384465,0.00014913392],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017407719,0.00052261126,0.0007891808,0.0031343724,0.00018093963,0.00039980267,0.005748998,0.00045212897,0.000042581178],"category_scores_gemma":[0.0016105854,0.00049786235,0.00020481678,0.003912506,0.00074806047,0.0006943819,0.0009788104,0.00082646025,0.000043891225],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009366415,0.00008588864,0.00016436093,0.00009272403,0.000018933935,0.000011068649,0.000088523615,0.0040164553,0.0001031689,0.07422259,0.00002881546,0.9211581],"study_design_scores_gemma":[0.00040702737,0.00028641007,0.009362696,0.0025672917,0.000041092146,0.000017068267,4.6031857e-7,0.659086,0.04689397,0.27562895,0.004251103,0.0014579394],"about_ca_topic_score_codex":0.00010732949,"about_ca_topic_score_gemma":0.000017846767,"teacher_disagreement_score":0.91970015,"about_ca_system_score_codex":0.0004215273,"about_ca_system_score_gemma":0.0011349068,"threshold_uncertainty_score":0.9997473},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023444279,0.00020214211,0.9954313,0.00008622408,0.00034638084,0.00041932552,0.00004122979,0.00007462334,0.003164355],"genre_scores_gemma":[0.8459042,0.00001704967,0.15314493,0.00021080243,0.00012560323,0.00003852602,0.000036944944,0.000031371386,0.00049061736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974201,0.000033487395,0.00053842954,0.0010857178,0.0003620727,0.0005602186],"domain_scores_gemma":[0.9985831,0.0003320041,0.00022929005,0.0006374647,0.0001377567,0.000080424375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000397636,0.0005104859,0.00068492274,0.0013503835,0.000145375,0.00016638204,0.0011017151,0.00015887551,0.0000690753],"category_scores_gemma":[0.0000115756275,0.0005080204,0.00024047888,0.0008192552,0.00047396214,0.00014744686,0.0007063588,0.00088174816,0.000004686489],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012843394,0.000075124655,0.0029435444,0.000029727347,0.00007168984,0.00002417777,0.00029939538,0.02935892,0.00009428464,0.012540327,0.000033039916,0.95451695],"study_design_scores_gemma":[0.00046803086,0.000043483044,0.0023964262,0.00090380124,0.00003205959,0.0000018766335,7.431066e-7,0.7388982,0.0001654604,0.256202,0.00020507176,0.00068283034],"about_ca_topic_score_codex":0.00024293832,"about_ca_topic_score_gemma":0.0016262151,"teacher_disagreement_score":0.9538341,"about_ca_system_score_codex":0.00020224733,"about_ca_system_score_gemma":0.0002212447,"threshold_uncertainty_score":0.99973714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023792183,0.00049606216,0.98242897,0.003120229,0.002171545,0.00042179704,0.0000013203042,0.00013465509,0.010987528],"genre_scores_gemma":[0.53649503,0.000042798183,0.45619524,0.005422723,0.00071156275,0.00001963909,0.0000024232318,0.000038152193,0.0010724526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636006,0.0000626535,0.00058070675,0.0015375271,0.0007777117,0.0006813449],"domain_scores_gemma":[0.9966552,0.0010967037,0.00023072616,0.0017984975,0.00013389943,0.00008497402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015721414,0.0004287366,0.00044940948,0.00076831476,0.0002986739,0.00061797793,0.0049223783,0.00027000866,0.00001117795],"category_scores_gemma":[0.00026480385,0.00033052787,0.00010134424,0.0008157386,0.0003038498,0.00044658312,0.0023292315,0.0012349844,0.000017251099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019151464,0.000012749881,0.00012223572,0.00003192163,0.0000059346944,0.00008274263,0.0014530413,0.06546496,0.000028716138,0.061822448,0.000019718267,0.8709536],"study_design_scores_gemma":[0.0002129551,0.000039595107,0.0001365268,0.0006392162,0.0000038979606,0.000045124787,4.6305792e-7,0.8216917,0.00031220276,0.17392325,0.0025504981,0.0004446099],"about_ca_topic_score_codex":0.000103031154,"about_ca_topic_score_gemma":0.00044805027,"teacher_disagreement_score":0.870509,"about_ca_system_score_codex":0.00032017674,"about_ca_system_score_gemma":0.00063981634,"threshold_uncertainty_score":0.9999147},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006769242,0.00004779056,0.98752356,0.0042379885,0.0014612523,0.00051641895,0.000035682337,0.00024661593,0.0058630113],"genre_scores_gemma":[0.09037525,0.000013794597,0.9063179,0.0022625143,0.0007555344,0.00001103392,0.00002623882,0.000016461034,0.00022128513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704736,0.000029268082,0.0005161673,0.0012405914,0.0007713427,0.00039527292],"domain_scores_gemma":[0.99811786,0.00018216694,0.00025327798,0.00089583953,0.00031469573,0.00023613124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035261078,0.0003724006,0.00031618864,0.00043542884,0.00022806387,0.0004215855,0.0013432802,0.00026488723,0.00013076108],"category_scores_gemma":[0.00014771534,0.0003730747,0.00009110211,0.000718704,0.00036872216,0.00060015736,0.00052604586,0.00042594696,0.00022010635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002526257,0.00001277331,0.00006205073,0.0000032091189,0.0000061887636,0.000012121822,0.00040355997,0.14974523,0.000037499307,0.030623926,0.000030079245,0.81906086],"study_design_scores_gemma":[0.0002982401,0.0001008611,0.0008987499,0.0002438064,0.000010014689,0.00005008719,4.6996306e-7,0.9219646,0.00034458353,0.07169511,0.0037040706,0.00068944436],"about_ca_topic_score_codex":0.00005429595,"about_ca_topic_score_gemma":0.00036271906,"teacher_disagreement_score":0.8183714,"about_ca_system_score_codex":0.0006531586,"about_ca_system_score_gemma":0.00078961084,"threshold_uncertainty_score":0.99987215},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08121187,0.00014434286,0.9012086,0.00039600066,0.00040969276,0.00047090038,0.0000064141263,0.00018891512,0.015963284],"genre_scores_gemma":[0.9726999,0.00007599076,0.025968703,0.00042990313,0.000074235504,0.0000050480726,0.000010891617,0.00002854964,0.0007067923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664664,0.000044828397,0.00039788257,0.001379914,0.000991373,0.00053937733],"domain_scores_gemma":[0.9989611,0.00032126752,0.00016881876,0.00033987022,0.000026957827,0.00018197625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088016276,0.00045130422,0.0004178236,0.0007511366,0.000474975,0.00020912182,0.0005595142,0.00023340456,0.00016077417],"category_scores_gemma":[0.00012588021,0.00034721656,0.00007555175,0.0011935518,0.0015023737,0.00036379724,0.00044530095,0.0009893965,0.000026539423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024590334,0.000023661763,0.0021354784,0.000029421526,0.000008470711,0.00006542504,0.00015135916,0.36726663,0.00028391724,0.000028930166,0.000036023408,0.6299461],"study_design_scores_gemma":[0.0007661963,0.0020978083,0.0027765625,0.0010624968,0.000058040892,0.0003693102,2.259433e-7,0.96746594,0.0011028888,0.018518109,0.004829367,0.0009530314],"about_ca_topic_score_codex":0.00007338016,"about_ca_topic_score_gemma":0.000030412162,"teacher_disagreement_score":0.891488,"about_ca_system_score_codex":0.0003257062,"about_ca_system_score_gemma":0.00006550274,"threshold_uncertainty_score":0.99989796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003402949,0.000057231908,0.9967966,0.0001915767,0.00016209099,0.0005888666,0.000008907918,0.00005783416,0.0017965611],"genre_scores_gemma":[0.91418636,0.000022258006,0.08452599,0.00047951084,0.00021815533,0.00004533558,0.00017368705,0.000036583453,0.00031209746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982222,0.000045918536,0.0004253529,0.00052423915,0.00031997898,0.00046234042],"domain_scores_gemma":[0.998829,0.0001911998,0.00012658545,0.0006365877,0.00013738175,0.000079240745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044692322,0.0003710326,0.00050605106,0.0007327256,0.00016561917,0.00018740701,0.0007631565,0.00011044025,0.000043705644],"category_scores_gemma":[0.0000032599094,0.00033782786,0.00008918217,0.00082206633,0.00020059751,0.00013420843,0.00034596585,0.00060319644,0.000001043653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026332124,0.00002766051,0.0015680642,0.000015687012,0.000026094833,0.000003366665,0.0005185036,0.61424893,0.000004028526,0.0034484044,0.000027307555,0.3800856],"study_design_scores_gemma":[0.00033565372,0.00013767819,0.00048741547,0.0019056118,0.000034680736,0.0000018718886,0.0000021004953,0.9648615,0.00016250747,0.02957855,0.0019097592,0.00058264204],"about_ca_topic_score_codex":0.00037094223,"about_ca_topic_score_gemma":0.0039983783,"teacher_disagreement_score":0.9138461,"about_ca_system_score_codex":0.00033799896,"about_ca_system_score_gemma":0.00015440192,"threshold_uncertainty_score":0.9999074},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033600103,0.0004948154,0.9847502,0.001724842,0.0020942548,0.0006578966,0.000035230492,0.00048763942,0.009721524],"genre_scores_gemma":[0.343335,0.00014897836,0.6523026,0.0023360867,0.00040300674,0.00008424238,0.00008001813,0.00007543399,0.0012345805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962362,0.00008860876,0.0008076195,0.0018070139,0.00043822237,0.0006223434],"domain_scores_gemma":[0.9977031,0.0004123281,0.0003569532,0.0011680058,0.00020000276,0.00015965484],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001113267,0.0006394719,0.0007468869,0.00084819464,0.00035707298,0.0013264683,0.0018486825,0.0003687406,0.000018114606],"category_scores_gemma":[0.000044931712,0.0006082404,0.00009954159,0.00043782638,0.00021219417,0.0007176155,0.0016563997,0.0005486273,0.0000061313895],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008426982,0.000029350735,0.00006884272,0.00046162767,0.00003168698,0.000026033613,0.00061661354,0.000051171635,0.0012659074,0.03869021,0.002848877,0.95590127],"study_design_scores_gemma":[0.0010064738,0.000336719,0.00011856962,0.0035191628,0.000032898042,0.00035504022,0.000002275137,0.905489,0.0049685515,0.04963743,0.03255848,0.001975346],"about_ca_topic_score_codex":0.00021717734,"about_ca_topic_score_gemma":0.00003791809,"teacher_disagreement_score":0.9539259,"about_ca_system_score_codex":0.0004997753,"about_ca_system_score_gemma":0.00023684085,"threshold_uncertainty_score":0.99971026},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1364346,0.037480745,0.7085379,0.023298543,0.017793382,0.010187471,0.005730217,0.0016188568,0.058918282],"genre_scores_gemma":[0.9303295,0.000723759,0.04344787,0.0018870452,0.0046925484,0.000013082867,0.0020201586,0.00001533535,0.016870715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719024,0.000034770095,0.00059691624,0.0012020547,0.0006181742,0.00035782822],"domain_scores_gemma":[0.9984558,0.00020173306,0.00045594745,0.0005181375,0.00027810063,0.00009024078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005120952,0.0004038313,0.00047545656,0.00008145212,0.0003127447,0.00023541,0.0024099885,0.00038952666,0.00007850672],"category_scores_gemma":[0.00012571746,0.00017431032,0.00012797663,0.0005369881,0.0004249575,0.00043443323,0.0011544921,0.00048867095,0.000008293913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089687695,0.00027092756,0.0011739912,0.00029269664,0.0001332808,0.0001141675,0.0027323475,0.009681587,0.21014969,0.0028645284,0.006359402,0.76613766],"study_design_scores_gemma":[0.0016021455,0.001588034,0.012118675,0.008350973,0.0007754671,0.0003783721,0.000054425713,0.3884696,0.082621776,0.15641595,0.3399921,0.0076324614],"about_ca_topic_score_codex":0.00009970229,"about_ca_topic_score_gemma":0.00042975604,"teacher_disagreement_score":0.7938949,"about_ca_system_score_codex":0.000097587465,"about_ca_system_score_gemma":0.00010268314,"threshold_uncertainty_score":0.71081686},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003355305,0.00020105882,0.9979793,0.000044839755,0.0010006729,0.00034632612,0.000014421041,0.00013057662,0.0002492651],"genre_scores_gemma":[0.37610456,0.0000086473865,0.6230016,0.000535112,0.00011231512,0.000005459235,0.0000075365024,0.00003814559,0.00018661439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983145,0.000021340491,0.000374625,0.00051289087,0.0004112476,0.00036539376],"domain_scores_gemma":[0.9985877,0.0006519065,0.00010516543,0.00043606415,0.00014477619,0.000074354466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031575988,0.00038557933,0.00047748967,0.0005535195,0.00012941303,0.00009716141,0.00063956593,0.00024610438,0.000037539496],"category_scores_gemma":[0.00018367603,0.00035896947,0.00007765908,0.00029038748,0.00020672534,0.00016965934,0.00009308916,0.00057921826,0.000004312247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016736942,0.000011537076,0.0000060868656,0.000073144234,0.000017685084,0.000005860864,0.00014767385,0.98260486,0.0053018928,0.00020189091,0.000019308289,0.011593339],"study_design_scores_gemma":[0.00041941536,0.0000726815,0.000024566194,0.00037621448,0.000020990396,0.0000014190473,1.10631504e-7,0.97631013,0.021499518,0.0009121337,0.000073432944,0.00028936513],"about_ca_topic_score_codex":0.000011277466,"about_ca_topic_score_gemma":0.000018909124,"teacher_disagreement_score":0.37607104,"about_ca_system_score_codex":0.0001364306,"about_ca_system_score_gemma":0.00024561127,"threshold_uncertainty_score":0.9998862},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005802529,0.00070734735,0.9921564,0.0007369214,0.00043003383,0.0011030943,0.0000024554095,0.00038709203,0.0044708955],"genre_scores_gemma":[0.17310275,0.0008398704,0.82215834,0.0014582053,0.0003291526,0.00007213517,0.000034603934,0.000068643174,0.0019362909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600136,0.00011202364,0.00069703604,0.0019408541,0.0007748602,0.00047385608],"domain_scores_gemma":[0.9971809,0.00037458647,0.0005087128,0.0016339722,0.00017656405,0.00012528831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012952429,0.0005937084,0.00085257465,0.0013563953,0.000334915,0.00046958437,0.0015901845,0.00019427988,0.0000069526996],"category_scores_gemma":[0.000091666036,0.0005213276,0.00013626054,0.0010863635,0.0003961855,0.0005058532,0.0007630178,0.00045674646,0.000022896109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030949013,0.00010027773,0.00005779276,0.0008683184,0.00004659588,0.0001450432,0.00063221174,0.028332647,0.0022363358,0.23145698,0.0006087042,0.7354841],"study_design_scores_gemma":[0.00023139527,0.00020229054,0.000011676108,0.0030461743,0.00003485083,0.0000150602455,4.873499e-7,0.9645567,0.0018388907,0.028539473,0.00087284105,0.00065013743],"about_ca_topic_score_codex":0.00002264296,"about_ca_topic_score_gemma":0.0000162054,"teacher_disagreement_score":0.9362241,"about_ca_system_score_codex":0.0015071996,"about_ca_system_score_gemma":0.0003863212,"threshold_uncertainty_score":0.99972385},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029113588,0.00072787935,0.9899252,0.004268204,0.0006640343,0.00031134402,0.0000026942944,0.00020030169,0.0009889841],"genre_scores_gemma":[0.36092603,0.00010089209,0.6363535,0.0015214314,0.00087167753,0.000014256194,0.00003816259,0.0000358879,0.00013813916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994642,0.000121986945,0.0007281595,0.0018357543,0.0021805805,0.0004915078],"domain_scores_gemma":[0.9973611,0.00092324463,0.0002616451,0.0009180657,0.00016848746,0.00036743336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016399146,0.0004832541,0.0005285696,0.00063374906,0.00053519267,0.00048443465,0.0019994292,0.0005909136,0.0000839606],"category_scores_gemma":[0.0008945064,0.00042733923,0.00010852215,0.00044406034,0.00076688215,0.00026108086,0.0008607259,0.0020458598,0.000007369118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003253032,0.000020766425,0.0005407026,0.000019274119,0.000014832459,0.00023093945,0.0004247569,0.035259783,0.0005580121,0.0030347754,0.000010012837,0.9598829],"study_design_scores_gemma":[0.00023296403,0.0000563189,0.0015713435,0.00040340403,0.000013454071,0.00034925793,9.897829e-8,0.97670335,0.00048385235,0.018906767,0.0008643987,0.00041479745],"about_ca_topic_score_codex":0.0005451828,"about_ca_topic_score_gemma":0.00023941693,"teacher_disagreement_score":0.95946807,"about_ca_system_score_codex":0.00015255799,"about_ca_system_score_gemma":0.0009190362,"threshold_uncertainty_score":0.99981785},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2901399,0.0016673665,0.6716434,0.003213809,0.0068889903,0.0032745055,0.000021006557,0.00026141736,0.022889618],"genre_scores_gemma":[0.9824359,0.00011074378,0.015169714,0.0015646089,0.00028142228,0.0000047759304,0.000020927855,0.000013953059,0.00039799837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745584,0.00007698948,0.0006239792,0.00050886866,0.00078904233,0.0005452701],"domain_scores_gemma":[0.9990765,0.00030394288,0.00017309385,0.0002405479,0.00010098847,0.000104948034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00104388,0.0002730085,0.0003960895,0.0016406261,0.0002716217,0.00032192745,0.0009185385,0.00042875527,0.000036647245],"category_scores_gemma":[0.00022477527,0.00026834334,0.000058199224,0.0011856237,0.00021399421,0.0006730517,0.00028808168,0.0006986883,0.000014328304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019677267,0.000048978523,0.0026951947,0.000046665147,0.0000127227095,0.00006699409,0.10369503,0.07072364,0.00007380045,0.0010476338,0.000027433087,0.82154226],"study_design_scores_gemma":[0.005350569,0.000577285,0.033029582,0.031585258,0.000108622015,0.000021082573,0.0016343408,0.79243463,0.0016294493,0.06614615,0.061764587,0.005718422],"about_ca_topic_score_codex":0.0020899165,"about_ca_topic_score_gemma":0.009441086,"teacher_disagreement_score":0.8158238,"about_ca_system_score_codex":0.0009686344,"about_ca_system_score_gemma":0.0006305288,"threshold_uncertainty_score":0.9999769},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025665224,0.00017934048,0.99316394,0.0004657129,0.0027449345,0.0010958757,0.000051232582,0.00056165963,0.0017116596],"genre_scores_gemma":[0.300717,0.00004410109,0.6955657,0.0013645145,0.0008380849,0.00021358536,0.00004305356,0.000046601966,0.0011673416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600416,0.00005488602,0.00065257034,0.001951,0.0007088042,0.00062856695],"domain_scores_gemma":[0.9964771,0.00066285284,0.0004396173,0.0017212043,0.0005787213,0.0001204987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077266904,0.0005817168,0.00055594573,0.0014192711,0.00047895225,0.00086886494,0.0026232565,0.0005184784,0.0000045047254],"category_scores_gemma":[0.00024717834,0.00058778684,0.00019086667,0.0009058808,0.00036514614,0.0012444236,0.0007601424,0.0007568081,0.000014515948],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015620451,0.000019100682,0.000006205275,0.000062451545,0.000015030391,0.0000083704435,0.000337269,0.00077960035,0.008913154,0.0073745684,0.00010024987,0.98236835],"study_design_scores_gemma":[0.00033683787,0.00042238354,0.000099901226,0.00037523857,0.000018220004,0.000043959768,2.4242445e-7,0.5657411,0.29496804,0.11974732,0.017427836,0.0008188918],"about_ca_topic_score_codex":0.000031649553,"about_ca_topic_score_gemma":0.0001971286,"teacher_disagreement_score":0.9815495,"about_ca_system_score_codex":0.00075045606,"about_ca_system_score_gemma":0.00045579736,"threshold_uncertainty_score":0.99965733},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074427946,0.0017104889,0.9915156,0.00015613835,0.00296838,0.0013543101,0.000008297611,0.00083614874,0.0013762264],"genre_scores_gemma":[0.18370637,0.00003731533,0.81205183,0.0012666255,0.0016615769,0.0000763038,0.000015684112,0.000069405985,0.0011148604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938198,0.00030206965,0.0010724991,0.002521252,0.0013445147,0.00093992054],"domain_scores_gemma":[0.9953695,0.0011844523,0.00042904384,0.0023050064,0.00047552635,0.00023650003],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018101821,0.00087185425,0.0010680426,0.0020431515,0.00034219792,0.0015024163,0.004013979,0.00070481614,0.0000017568967],"category_scores_gemma":[0.00013677891,0.0008101101,0.00014789353,0.0013762518,0.00046311496,0.00052356423,0.002303544,0.0012432903,0.000009226303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004234727,0.000020028487,0.000010299388,0.00026005786,0.000015541185,0.000044507797,0.00080759905,0.8657636,0.000018519511,0.0027401277,0.00023202131,0.13008346],"study_design_scores_gemma":[0.00023689798,0.00014966862,0.0000056204663,0.0015110422,0.000011677074,0.00007505345,1.8068836e-7,0.94863987,0.00010155524,0.04792721,0.0006055417,0.00073570036],"about_ca_topic_score_codex":0.00007293892,"about_ca_topic_score_gemma":0.000031875898,"teacher_disagreement_score":0.18363194,"about_ca_system_score_codex":0.00071910484,"about_ca_system_score_gemma":0.0015694152,"threshold_uncertainty_score":0.99953413},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074427946,0.0017104889,0.9915156,0.00015613835,0.00296838,0.0013543101,0.000008297611,0.00083614874,0.0013762264],"genre_scores_gemma":[0.18370637,0.00003731533,0.81205183,0.0012666255,0.0016615769,0.0000763038,0.000015684112,0.000069405985,0.0011148604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938198,0.00030206965,0.0010724991,0.002521252,0.0013445147,0.00093992054],"domain_scores_gemma":[0.9953695,0.0011844523,0.00042904384,0.0023050064,0.00047552635,0.00023650003],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018101821,0.00087185425,0.0010680426,0.0020431515,0.00034219792,0.0015024163,0.004013979,0.00070481614,0.0000017568967],"category_scores_gemma":[0.00013677891,0.0008101101,0.00014789353,0.0013762518,0.00046311496,0.00052356423,0.002303544,0.0012432903,0.000009226303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004234727,0.000020028487,0.000010299388,0.00026005786,0.000015541185,0.000044507797,0.00080759905,0.8657636,0.000018519511,0.0027401277,0.00023202131,0.13008346],"study_design_scores_gemma":[0.00023689798,0.00014966862,0.0000056204663,0.0015110422,0.000011677074,0.00007505345,1.8068836e-7,0.94863987,0.00010155524,0.04792721,0.0006055417,0.00073570036],"about_ca_topic_score_codex":0.00007293892,"about_ca_topic_score_gemma":0.000031875898,"teacher_disagreement_score":0.18363194,"about_ca_system_score_codex":0.00071910484,"about_ca_system_score_gemma":0.0015694152,"threshold_uncertainty_score":0.99953413},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009634746,0.0010900998,0.9935274,0.00040837258,0.0024906646,0.00039659187,0.000011453685,0.00012349003,0.000988413],"genre_scores_gemma":[0.053959418,0.000015494903,0.94449,0.0008729093,0.0004255889,0.0000055114833,0.000017246788,0.00002371523,0.00019008161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531984,0.00006988057,0.0007214235,0.0025201156,0.000709205,0.0006595424],"domain_scores_gemma":[0.9960109,0.00046821134,0.00019737185,0.003005725,0.00015710111,0.00016068814],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012246183,0.00048445386,0.00054269057,0.0013366782,0.00025616222,0.0009818524,0.006530151,0.00026860222,0.000009085484],"category_scores_gemma":[0.000249605,0.00051263726,0.000057450372,0.0011388527,0.00014691667,0.0012169107,0.006920831,0.00085027,0.000015689515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029827454,0.000030162024,0.0003782102,0.000042721378,0.0000140974535,0.00009444263,0.0023799606,0.22426036,0.0002357955,0.021385197,0.000023031238,0.75115305],"study_design_scores_gemma":[0.00013043372,0.000020111836,0.00003269467,0.0017852344,0.000005982401,0.0000051010697,2.6213215e-7,0.8870947,0.00021967306,0.10977389,0.00048324477,0.0004487167],"about_ca_topic_score_codex":0.0008746649,"about_ca_topic_score_gemma":0.00087068346,"teacher_disagreement_score":0.75070435,"about_ca_system_score_codex":0.00045112148,"about_ca_system_score_gemma":0.0008800617,"threshold_uncertainty_score":0.9997325},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015024609,0.00077821483,0.9811343,0.00044434314,0.0009483242,0.0001537972,0.000010450894,0.00011984003,0.0013860986],"genre_scores_gemma":[0.77814436,0.00037943246,0.21961032,0.000864983,0.0003967324,0.000025107678,0.0000131909255,0.000023808316,0.00054204604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959747,0.000022104416,0.00062517484,0.0018144636,0.0008633042,0.00070023286],"domain_scores_gemma":[0.9978973,0.0005401714,0.0002160446,0.0010420302,0.00016177255,0.00014266973],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010529604,0.00052807067,0.00069097505,0.0012778708,0.00035646776,0.0019071177,0.0031314103,0.0002776288,0.000012052318],"category_scores_gemma":[0.0001521725,0.0004592591,0.00012063198,0.0009113678,0.0011014151,0.0016057192,0.0022182174,0.0008716686,0.000008043921],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008488182,0.000031497457,0.015515567,0.00009542426,0.00002593326,0.00015039936,0.001519834,0.008339766,0.000030346779,0.028715566,0.000009690404,0.9455575],"study_design_scores_gemma":[0.00067429204,0.00015811765,0.026378494,0.0019363466,0.000016659205,0.00007387783,0.0000018452854,0.81213087,0.0006076881,0.15581919,0.0007912762,0.0014113325],"about_ca_topic_score_codex":0.0001797095,"about_ca_topic_score_gemma":0.00019560962,"teacher_disagreement_score":0.94414616,"about_ca_system_score_codex":0.0002104635,"about_ca_system_score_gemma":0.0005694825,"threshold_uncertainty_score":0.9997859},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008155587,0.00031274272,0.97675246,0.0005516376,0.005788639,0.00082320033,0.000012349443,0.00027384263,0.0073295454],"genre_scores_gemma":[0.8400525,0.00007388715,0.15513852,0.0021033892,0.0010734058,0.000017190376,0.00009550785,0.00013751502,0.0013080946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969115,0.000018667186,0.0004909473,0.0012217393,0.00079156144,0.00056557177],"domain_scores_gemma":[0.99840057,0.00048306884,0.00009868029,0.0006227382,0.00017248567,0.00022242888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004205949,0.00052691763,0.00060268043,0.001947412,0.00012592835,0.00024378744,0.0002965994,0.00022576543,0.000039374703],"category_scores_gemma":[0.000174645,0.00049069856,0.00025371616,0.0019232568,0.00050989515,0.00021793257,0.00010623186,0.0012035758,0.0001178584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028823694,0.0003616487,0.0061478536,0.00059761666,0.00017193308,0.00018532692,0.007871791,0.20589568,0.020813204,0.00091764436,0.0006768169,0.7560722],"study_design_scores_gemma":[0.0022902337,0.0020571216,0.017023742,0.012398351,0.00033027786,0.0010388361,0.000008885025,0.8581569,0.0051501715,0.09274698,0.006285344,0.00251316],"about_ca_topic_score_codex":0.00014759974,"about_ca_topic_score_gemma":0.000088173314,"teacher_disagreement_score":0.8318969,"about_ca_system_score_codex":0.00034122964,"about_ca_system_score_gemma":0.0002764,"threshold_uncertainty_score":0.9997545},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000079712554,0.00033099935,0.99356174,0.00035353948,0.0018013511,0.00068456115,0.000009319393,0.00020402958,0.0029747568],"genre_scores_gemma":[0.18216111,0.000016169066,0.8151305,0.0015670969,0.0002875646,0.000034145352,0.000010646947,0.000023822582,0.00076895393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967254,0.000022209733,0.00049920497,0.0014796752,0.0005970525,0.0006764656],"domain_scores_gemma":[0.9980594,0.0003585332,0.00021447615,0.0010914191,0.00018411239,0.000092084876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079095946,0.0004191846,0.00042800806,0.0006598425,0.00029409712,0.00049491617,0.0021674207,0.00022001326,0.000008384999],"category_scores_gemma":[0.000053082298,0.0004297512,0.00013104122,0.00032623127,0.00008930569,0.0006730943,0.0012524348,0.0004464611,0.0000046558494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039538413,0.000008654089,0.0000014401894,0.00008996895,0.000008618431,0.000009667775,0.002899762,0.35753086,0.0009100244,0.015600707,0.000008174407,0.62292814],"study_design_scores_gemma":[0.00037904087,0.000034476732,0.0000016129229,0.00040515698,0.0000064620062,0.0000060271354,0.00000113666,0.9191588,0.0057362006,0.0738083,0.00007051385,0.00039225994],"about_ca_topic_score_codex":0.000018685254,"about_ca_topic_score_gemma":0.00007553752,"teacher_disagreement_score":0.6225359,"about_ca_system_score_codex":0.00038441026,"about_ca_system_score_gemma":0.00039413598,"threshold_uncertainty_score":0.9998154},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014097463,0.000056673067,0.9943718,0.00041735702,0.00018926346,0.0010628909,0.00008082198,0.00008248481,0.0037373297],"genre_scores_gemma":[0.0004597786,0.000009740536,0.99726665,0.0003253563,0.00016702684,0.000100540004,0.000048838046,0.000028261149,0.0015938313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983425,0.000009628063,0.00031745178,0.0007487804,0.00031510525,0.0002665333],"domain_scores_gemma":[0.9984058,0.0005359724,0.00019552291,0.0005105972,0.00028645183,0.00006563188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020452031,0.0002941689,0.0003332027,0.0003663628,0.00020856503,0.00013367998,0.0006102233,0.00019168825,0.000016523907],"category_scores_gemma":[0.00008055609,0.00027269838,0.00010681069,0.00027231083,0.0003007849,0.00007931571,0.00018502389,0.0002624667,0.00000164753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000831116,0.00023090282,0.0000011897562,0.00022747168,0.000032769683,0.000002110278,0.0009403331,0.2949846,0.00009508294,0.13233809,0.0002525902,0.57088655],"study_design_scores_gemma":[0.00023589504,0.000035258632,0.0000058329542,0.000111666486,0.000032659802,0.000012148643,6.825184e-7,0.8283997,0.0002357898,0.17045738,0.00021552421,0.00025745042],"about_ca_topic_score_codex":0.0000045631955,"about_ca_topic_score_gemma":0.0000059902327,"teacher_disagreement_score":0.57062906,"about_ca_system_score_codex":0.00017101286,"about_ca_system_score_gemma":0.00017261908,"threshold_uncertainty_score":0.9999725},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006403388,0.004243354,0.4325948,0.030613078,0.0051829927,0.0018532921,0.00002981396,0.00036097303,0.52448136],"genre_scores_gemma":[0.6964509,0.006195106,0.1825478,0.021625333,0.011016932,0.0001983435,0.000043455064,0.00013318914,0.08178898],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974861,0.00012164265,0.00023283322,0.00081527804,0.0007627922,0.0005813339],"domain_scores_gemma":[0.9982541,0.0009904706,0.000104866514,0.00031658224,0.00020415221,0.00012982628],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014978274,0.00024515434,0.00037062686,0.00028389567,0.0009696126,0.00037996206,0.00045809077,0.0003240054,0.000032386062],"category_scores_gemma":[0.0009863288,0.00023549386,0.00005872172,0.00072603655,0.0028301068,0.00033847333,0.0006895257,0.00081747374,0.000009076152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042143965,0.00026117972,0.0011202693,0.0004648582,0.00008265849,0.0003230298,0.13841087,0.00020625778,0.0000049711402,0.24384706,0.019116744,0.59611994],"study_design_scores_gemma":[0.00026420722,0.000086953085,0.00016324491,0.00057241507,0.000035990182,0.000014688626,0.000038717593,0.0023465366,0.000039501603,0.7256415,0.27011546,0.0006808141],"about_ca_topic_score_codex":0.0005704552,"about_ca_topic_score_gemma":0.009701595,"teacher_disagreement_score":0.69581056,"about_ca_system_score_codex":0.00040575056,"about_ca_system_score_gemma":0.003512629,"threshold_uncertainty_score":0.9998836},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009952731,0.0002604157,0.9784385,0.002761467,0.0031467688,0.0012569041,0.0000143508805,0.000102221115,0.013919876],"genre_scores_gemma":[0.064271994,0.00028874062,0.92432046,0.0049155345,0.000804546,0.00007553704,0.00004642475,0.00003935476,0.005237414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972001,0.00008323965,0.0006782223,0.00090508256,0.0005326729,0.00060071197],"domain_scores_gemma":[0.9978996,0.00064113387,0.00020824542,0.0007055131,0.00040361678,0.0001418956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077423063,0.00032735622,0.00041096937,0.00049114646,0.0009596531,0.00007253715,0.00066499447,0.0006720793,0.00016466569],"category_scores_gemma":[0.000109151304,0.0003028342,0.000071421746,0.00040643473,0.0003744889,0.00013412077,0.00044620738,0.0017293023,0.00007543707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011513658,0.0000331817,0.00014968854,0.00021712779,0.000020618436,0.000028042392,0.0059148427,0.5893144,4.217665e-7,0.29665816,0.00018165824,0.107470326],"study_design_scores_gemma":[0.00029580106,0.000112478905,0.00001683041,0.002862204,0.000018545343,6.6837185e-7,0.000011418415,0.8877557,0.00000444863,0.10244581,0.006021433,0.00045466263],"about_ca_topic_score_codex":0.000044859687,"about_ca_topic_score_gemma":0.00003580804,"teacher_disagreement_score":0.2984413,"about_ca_system_score_codex":0.00045177573,"about_ca_system_score_gemma":0.0010802028,"threshold_uncertainty_score":0.99994236},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025880162,0.0003231817,0.878915,0.004234559,0.00078809774,0.001130796,0.0000051478683,0.000111582536,0.114232846],"genre_scores_gemma":[0.4814765,0.00028234805,0.46240526,0.0100642415,0.0027620788,0.00014249851,0.00017213164,0.000167234,0.04252772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659985,0.000020389956,0.00039649586,0.0011747924,0.0011787955,0.0006296522],"domain_scores_gemma":[0.9983294,0.00021764416,0.00011546668,0.0009777343,0.0001590725,0.00020068958],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046889918,0.0005105164,0.00069142017,0.00076230685,0.0001490421,0.0002082648,0.000683626,0.00022963704,0.00024767988],"category_scores_gemma":[0.00001844403,0.0003902868,0.00012273114,0.0004325514,0.00076552137,0.00012178507,0.0006212549,0.0010745778,0.000016908893],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060063605,0.00015316549,0.0010831351,0.00076019677,0.00021806454,0.00041595736,0.0001861999,0.0034429717,0.00013224878,0.022626385,0.00047216975,0.97044945],"study_design_scores_gemma":[0.014561506,0.011586156,0.017839894,0.018869873,0.0016079894,0.00025482243,0.0000041123267,0.5977651,0.0014909088,0.10886652,0.2222761,0.0048770304],"about_ca_topic_score_codex":0.000012412991,"about_ca_topic_score_gemma":0.00008885274,"teacher_disagreement_score":0.9655724,"about_ca_system_score_codex":0.0010182962,"about_ca_system_score_gemma":0.0022499438,"threshold_uncertainty_score":0.9998549},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063116685,0.00063837046,0.9886715,0.001317581,0.0013645596,0.0008083854,0.000024754321,0.0003323403,0.006211382],"genre_scores_gemma":[0.6844524,0.000022934864,0.31097844,0.0031203863,0.00070828694,0.00003147971,0.000029935123,0.00004104675,0.0006150738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960105,0.00005735519,0.00061947666,0.0018340909,0.0007897965,0.00068882667],"domain_scores_gemma":[0.99710554,0.00039185438,0.00019678561,0.0017041585,0.000333497,0.0002681479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011202205,0.00052683835,0.0005366383,0.0008544505,0.0002799751,0.00039579484,0.003555511,0.0003289789,0.000014391756],"category_scores_gemma":[0.0002398379,0.00049919676,0.0001649159,0.0008873436,0.00027372883,0.00057535653,0.0013662191,0.00089356274,0.000020082758],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060937655,0.00004605882,0.00004490023,0.000100018195,0.000011725243,0.00005949037,0.02054083,0.0036399716,0.00031437795,0.02639175,0.00002043795,0.94882435],"study_design_scores_gemma":[0.001177413,0.00071032287,0.002088701,0.0014943872,0.00006364353,0.00014431168,0.000008852695,0.68722486,0.022006951,0.2713313,0.009991277,0.0037579373],"about_ca_topic_score_codex":0.00006218064,"about_ca_topic_score_gemma":0.00033290748,"teacher_disagreement_score":0.9450664,"about_ca_system_score_codex":0.000378142,"about_ca_system_score_gemma":0.0008333897,"threshold_uncertainty_score":0.99974597},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02165885,0.000079146295,0.96819454,0.00022882216,0.00058065186,0.0002974225,0.000007826022,0.000046582205,0.00890613],"genre_scores_gemma":[0.9429035,0.00019455557,0.055046856,0.0005613218,0.00011219652,0.0000041745266,0.000016710062,0.000019476658,0.0011412051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984721,0.0000242412,0.00034854678,0.00055203587,0.00034249073,0.00026060536],"domain_scores_gemma":[0.9992318,0.00016622111,0.00029969012,0.00024622228,0.000026255993,0.000029789067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004710085,0.0002283787,0.00032039938,0.00019849619,0.00026571684,0.000032268017,0.00043150305,0.0001623199,0.00007239904],"category_scores_gemma":[0.000096339114,0.00021814289,0.000049441474,0.00021039286,0.00055316277,0.0002277961,0.0009730566,0.0004485697,0.0000038890025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031814623,0.000051097348,0.31627637,0.00018355984,0.00004701553,0.000032464424,0.0019473255,0.5628998,0.0008028028,0.00069959037,0.00006292302,0.11696521],"study_design_scores_gemma":[0.000082918275,0.000065902415,0.0051586134,0.00025832272,0.000026867143,0.0000028830098,4.549748e-7,0.9830247,0.00022414632,0.010784374,0.00017559758,0.00019518659],"about_ca_topic_score_codex":0.0001780868,"about_ca_topic_score_gemma":0.0011931116,"teacher_disagreement_score":0.9212446,"about_ca_system_score_codex":0.00021670327,"about_ca_system_score_gemma":0.000032103424,"threshold_uncertainty_score":0.8895608},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006403388,0.004243354,0.4325948,0.030613078,0.0051829927,0.0018532921,0.00002981396,0.00036097303,0.52448136],"genre_scores_gemma":[0.6964509,0.006195106,0.1825478,0.021625333,0.011016932,0.0001983435,0.000043455064,0.00013318914,0.08178898],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974861,0.00012164265,0.00023283322,0.00081527804,0.0007627922,0.0005813339],"domain_scores_gemma":[0.9982541,0.0009904706,0.000104866514,0.00031658224,0.00020415221,0.00012982628],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014978274,0.00024515434,0.00037062686,0.00028389567,0.0009696126,0.00037996206,0.00045809077,0.0003240054,0.000032386062],"category_scores_gemma":[0.0009863288,0.00023549386,0.00005872172,0.00072603655,0.0028301068,0.00033847333,0.0006895257,0.00081747374,0.000009076152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042143965,0.00026117972,0.0011202693,0.0004648582,0.00008265849,0.0003230298,0.13841087,0.00020625778,0.0000049711402,0.24384706,0.019116744,0.59611994],"study_design_scores_gemma":[0.00026420722,0.000086953085,0.00016324491,0.00057241507,0.000035990182,0.000014688626,0.000038717593,0.0023465366,0.000039501603,0.7256415,0.27011546,0.0006808141],"about_ca_topic_score_codex":0.0005704552,"about_ca_topic_score_gemma":0.009701595,"teacher_disagreement_score":0.69581056,"about_ca_system_score_codex":0.00040575056,"about_ca_system_score_gemma":0.003512629,"threshold_uncertainty_score":0.9998836},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013897989,0.0012074744,0.9866157,0.0042043864,0.0027382097,0.0009783391,0.000052526895,0.00013302246,0.0040689493],"genre_scores_gemma":[0.0018949826,0.00023947984,0.9895291,0.0026928675,0.0006665949,0.00006874982,0.000009658641,0.000027508864,0.0048710783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963371,0.0000283582,0.0005574713,0.0017080597,0.000718263,0.00065072515],"domain_scores_gemma":[0.99587333,0.0019053645,0.00024765063,0.0015468915,0.0003109058,0.0001158336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014737707,0.0005122026,0.00048497148,0.00055269204,0.0007207428,0.0009772084,0.0038951656,0.00026386481,0.000003776602],"category_scores_gemma":[0.00015254019,0.00037438027,0.00016860857,0.0006664439,0.0010783471,0.000463148,0.0021374098,0.00071551075,0.0000068395207],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014190465,0.000017304019,0.0000029383853,0.00006176048,0.000021850276,0.0000125856295,0.000498616,0.0028821826,0.000004657925,0.08993036,0.0006105125,0.90594304],"study_design_scores_gemma":[0.00046881923,0.00011632726,0.000041404845,0.00032712697,0.000013788959,0.000031661028,1.7556384e-7,0.61298794,0.00014461613,0.34736487,0.038083125,0.00042013894],"about_ca_topic_score_codex":0.000030644966,"about_ca_topic_score_gemma":0.00004581322,"teacher_disagreement_score":0.9055229,"about_ca_system_score_codex":0.000119929544,"about_ca_system_score_gemma":0.0005261306,"threshold_uncertainty_score":0.99987084},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039159535,0.00031607307,0.9919056,0.0006416763,0.0011017023,0.0003491393,0.000003787144,0.00016715031,0.0054756827],"genre_scores_gemma":[0.009552091,0.000033928176,0.98735434,0.0012715977,0.0004393679,0.00001804103,0.000008102172,0.000018187966,0.0013043747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722505,0.000017938462,0.00042927483,0.001209829,0.0006034354,0.00051445497],"domain_scores_gemma":[0.9981873,0.00055783207,0.00019076887,0.00084543787,0.00008110402,0.00013754326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052581076,0.00041040799,0.00048410194,0.0006324357,0.00022450507,0.00066519505,0.0021664232,0.00021061316,0.0000026082269],"category_scores_gemma":[0.00005291173,0.00036007227,0.00006697853,0.00093928043,0.00045573965,0.00033008592,0.0019207967,0.00051517884,0.0000132280575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012684047,0.000020292762,0.0000025284887,0.000102881444,0.000007878227,0.000015874479,0.00085827714,0.0038697724,0.00006560915,0.026271151,0.0001287955,0.96865565],"study_design_scores_gemma":[0.00018906892,0.00004102682,0.000053917633,0.00026082218,0.000006360391,0.000021727215,1.491521e-7,0.6655709,0.00044803394,0.3322789,0.0007558814,0.0003731529],"about_ca_topic_score_codex":0.0000086573855,"about_ca_topic_score_gemma":0.000014617893,"teacher_disagreement_score":0.9682825,"about_ca_system_score_codex":0.00023367057,"about_ca_system_score_gemma":0.00096690893,"threshold_uncertainty_score":0.99988514},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06878177,0.00020700855,0.92604923,0.001341479,0.00025368523,0.0010557697,0.000015355936,0.000099960416,0.0021957234],"genre_scores_gemma":[0.31126,0.000056254983,0.68457925,0.0018228007,0.00046699768,0.000024732512,0.000068519796,0.000046327554,0.0016751217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686813,0.000039362585,0.00039197505,0.0011701984,0.0009555598,0.0005747429],"domain_scores_gemma":[0.9985714,0.00016702249,0.0001023376,0.00058768224,0.00031847626,0.00025307247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075982796,0.00045568426,0.0005830069,0.00060953863,0.0003214227,0.0002350517,0.00038373147,0.00033606068,0.00005301018],"category_scores_gemma":[0.00006374057,0.0003470941,0.0000623453,0.00033510203,0.0005580181,0.00032289614,0.00025491192,0.0012051872,0.000004250749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038045036,0.00006450843,0.00010779532,0.00037285985,0.00001968097,0.00047836904,0.0010953739,0.025946999,0.0047131246,0.00033573867,0.000005265524,0.96647984],"study_design_scores_gemma":[0.0009491463,0.0006118807,0.000033075987,0.00044765815,0.000051863943,0.00028419492,0.000005892159,0.99004364,0.002876282,0.0043301433,0.0000032972541,0.00036292177],"about_ca_topic_score_codex":0.000095112795,"about_ca_topic_score_gemma":0.00019034235,"teacher_disagreement_score":0.9661169,"about_ca_system_score_codex":0.00047141075,"about_ca_system_score_gemma":0.00096567447,"threshold_uncertainty_score":0.99989814},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033623173,0.00056420686,0.9918594,0.000832637,0.0009771948,0.0011095625,0.00006805054,0.00008487166,0.0011417567],"genre_scores_gemma":[0.08007507,0.0003163796,0.91470695,0.0017718896,0.00067111425,0.000032133717,0.00029278858,0.000053315383,0.0020803723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963366,0.000033331493,0.000829647,0.0016764769,0.00056798867,0.0005559909],"domain_scores_gemma":[0.9969407,0.0013822656,0.00030875902,0.0010922932,0.0001267721,0.0001492667],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013790344,0.00045314187,0.00081510615,0.0006540196,0.00014800738,0.00011586625,0.0010237057,0.0005981566,0.00001839436],"category_scores_gemma":[0.0012179095,0.0004367008,0.000113100185,0.00027921467,0.00063525856,0.0002237932,0.0022185156,0.002468208,0.0000040188856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004920659,0.00016695708,0.040613603,0.00043334285,0.00038497528,0.0001885582,0.00061662396,0.0022026042,0.00035538178,0.00032332732,0.0014206697,0.9528019],"study_design_scores_gemma":[0.0032553566,0.0006269623,0.0053237,0.0026355693,0.00033105086,0.00007290994,0.000003495311,0.9741195,0.00010741952,0.00080324645,0.012267953,0.00045284207],"about_ca_topic_score_codex":0.000016554031,"about_ca_topic_score_gemma":0.00003368018,"teacher_disagreement_score":0.9719169,"about_ca_system_score_codex":0.00024426094,"about_ca_system_score_gemma":0.00038077534,"threshold_uncertainty_score":0.99983317},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028244366,0.00026380696,0.9915775,0.00050426455,0.0011757246,0.0010915222,0.00009236044,0.00010228636,0.0023681147],"genre_scores_gemma":[0.20551015,0.00017604991,0.7788737,0.0018766124,0.0021661266,0.00002659315,0.0023216703,0.00010036818,0.00894877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968902,0.000018459887,0.0004974011,0.0013150044,0.0008105981,0.0004683596],"domain_scores_gemma":[0.9980233,0.00023959468,0.0002867118,0.0011341686,0.00020996197,0.00010628812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007014906,0.00042023283,0.00053813145,0.00075333833,0.0002867034,0.00012562002,0.0009872406,0.00018428519,0.00005019366],"category_scores_gemma":[0.00023512336,0.0003908381,0.000114924784,0.00025725493,0.00031348548,0.0002757442,0.0017910321,0.00087295345,0.0000042023385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024415308,0.000047537458,0.0066062794,0.00035504313,0.0001722573,0.00016421267,0.0002540971,0.029022982,0.000961327,0.000103299,0.0012292871,0.9608395],"study_design_scores_gemma":[0.00093432656,0.0003204389,0.0003112639,0.0009872066,0.0003160539,0.000111502486,8.5849234e-7,0.9582094,0.0006094143,0.00027321506,0.03762177,0.0003045691],"about_ca_topic_score_codex":0.000043007152,"about_ca_topic_score_gemma":0.000035896595,"teacher_disagreement_score":0.96053493,"about_ca_system_score_codex":0.00048728523,"about_ca_system_score_gemma":0.0005023982,"threshold_uncertainty_score":0.9998543},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020134891,0.00008723555,0.99473625,0.0015677846,0.0012128989,0.0015094044,0.000023814762,0.00019189023,0.00046939033],"genre_scores_gemma":[0.050287638,0.00002875045,0.9455119,0.002325492,0.0003227367,0.00008935834,0.00010206701,0.000032938588,0.0012991233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630016,0.000050060946,0.00068145274,0.0015569138,0.00077719626,0.0006341987],"domain_scores_gemma":[0.9973738,0.0005818913,0.00031766357,0.0009907747,0.0005657127,0.00017013478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000885203,0.00049357803,0.00042537192,0.0011721619,0.0004658938,0.0008704846,0.0019896561,0.00028982514,0.000008533721],"category_scores_gemma":[0.00030881714,0.00049160357,0.00012265562,0.00088375155,0.00019330565,0.0010182585,0.0006603504,0.00028193652,0.000021501637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010959973,0.000015150673,0.000011621538,0.000051110135,0.000006182309,0.0000032114901,0.00060556084,0.42594945,0.0056690564,0.018778788,0.00008363902,0.54881525],"study_design_scores_gemma":[0.00011052147,0.00024898438,0.00002058211,0.00021469247,0.000010953834,0.0000031915654,0.0000010521453,0.8573618,0.040313065,0.100848846,0.00043280082,0.0004335031],"about_ca_topic_score_codex":0.00011369717,"about_ca_topic_score_gemma":0.00047855152,"teacher_disagreement_score":0.54838175,"about_ca_system_score_codex":0.00065465417,"about_ca_system_score_gemma":0.0005641937,"threshold_uncertainty_score":0.99975353},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005479251,0.00022576592,0.974858,0.0006058894,0.0004456071,0.00017853951,0.0000045654124,0.00009528453,0.02303841],"genre_scores_gemma":[0.9817279,0.00002312804,0.014595464,0.0027232368,0.00065922504,0.000014253337,0.00006728664,0.000033355,0.00015617529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782544,0.0000024258457,0.00052023074,0.00068402156,0.000642301,0.00032560257],"domain_scores_gemma":[0.99742645,0.00008989934,0.0005451758,0.00043788878,0.001488032,0.000012566983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039918334,0.00037967588,0.0005557503,0.0016451736,0.00016947792,0.00028299438,0.00088808365,0.00021443987,0.000038854138],"category_scores_gemma":[0.00014546036,0.00033997858,0.000108993234,0.0018736253,0.00044355486,0.0007373421,0.00020828015,0.0003053707,0.000016153055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063353975,0.000093849514,0.0008915575,0.0040990943,0.000029152154,0.000017380404,0.00005510368,0.25033343,0.000059533606,0.018457819,0.000030048888,0.72586966],"study_design_scores_gemma":[0.0004028932,0.000008259681,0.00020068196,0.002402245,0.00009154414,9.96212e-7,4.2990712e-7,0.86337173,0.00021460945,0.13240996,0.000402421,0.0004942297],"about_ca_topic_score_codex":0.000114368246,"about_ca_topic_score_gemma":0.00012299632,"teacher_disagreement_score":0.98117995,"about_ca_system_score_codex":0.00004249192,"about_ca_system_score_gemma":0.00048344905,"threshold_uncertainty_score":0.9999052},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076208054,0.00043469795,0.9922871,0.0006038756,0.0038333787,0.00037897067,0.000002768367,0.00009860208,0.001598549],"genre_scores_gemma":[0.84317344,0.00011086094,0.15338933,0.0015273349,0.0006901588,0.00003492071,0.000034337725,0.00002243314,0.0010171916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680376,0.000055905,0.0005957679,0.0012775918,0.0008200381,0.00044691455],"domain_scores_gemma":[0.99831194,0.0004832411,0.00023537996,0.0006365993,0.00024208818,0.000090767404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011066041,0.0003712526,0.00038207657,0.005462237,0.00017550665,0.00042023734,0.0014504081,0.00027883184,0.000014391089],"category_scores_gemma":[0.0001887291,0.00038599834,0.00012269491,0.0032260201,0.00019681762,0.0011139583,0.0007034736,0.0006231111,0.00002259044],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000082688775,0.00003986178,0.0000494175,0.00002795094,0.000006371131,0.000025252815,0.00022161618,0.10556306,0.00010660151,0.10416671,0.000040623006,0.78974426],"study_design_scores_gemma":[0.00041562904,0.00013456668,0.00066500454,0.0002483776,0.0000057880843,0.000020964011,1.5152327e-7,0.683148,0.0025582528,0.31142902,0.0009316561,0.00044258076],"about_ca_topic_score_codex":0.000032316795,"about_ca_topic_score_gemma":0.000100608835,"teacher_disagreement_score":0.84241134,"about_ca_system_score_codex":0.0005565355,"about_ca_system_score_gemma":0.000562864,"threshold_uncertainty_score":0.9998592},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015791362,0.0003262267,0.98809606,0.00466157,0.0017502541,0.0014911734,0.0000029254368,0.00009696138,0.003559057],"genre_scores_gemma":[0.59804374,0.00094141194,0.2598275,0.0982075,0.01728231,0.0016987502,0.0010068864,0.00035610018,0.022635795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786544,0.000007695951,0.0004282391,0.0007979828,0.0005041695,0.00039645034],"domain_scores_gemma":[0.9985915,0.00021894644,0.00016480508,0.0006711886,0.0003381921,0.000015356984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075605244,0.00035637934,0.00029767823,0.0005130451,0.00041403362,0.00040955996,0.00097010704,0.00015355952,0.000029066301],"category_scores_gemma":[0.00007502783,0.00028143695,0.000104730156,0.0007506797,0.00024235166,0.0003381973,0.00036725812,0.0003222427,0.000048072696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012924865,0.000044984557,0.000008285683,0.00020211146,0.000019219424,0.0000012435906,0.000026140358,0.22856444,0.0000046162686,0.008627065,0.00070995203,0.761779],"study_design_scores_gemma":[0.00026360876,0.00003949998,0.00027658185,0.00047644033,0.000046860136,2.1197786e-7,6.1424225e-7,0.97008723,0.000012271895,0.017389724,0.011099512,0.00030745642],"about_ca_topic_score_codex":0.00011003293,"about_ca_topic_score_gemma":0.00065243035,"teacher_disagreement_score":0.76147157,"about_ca_system_score_codex":0.00015038942,"about_ca_system_score_gemma":0.00010329245,"threshold_uncertainty_score":0.99996376},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000938274,0.00007010262,0.99394584,0.00030793407,0.0022716974,0.00034121264,0.000005671797,0.00009859773,0.002020659],"genre_scores_gemma":[0.97467524,0.000026906095,0.019113773,0.004710213,0.0005480379,0.000010859345,0.0000065599183,0.000031960368,0.00087645504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975316,0.00006349459,0.00037997047,0.0010349978,0.00058776984,0.00040217224],"domain_scores_gemma":[0.998674,0.00042337427,0.00025393226,0.00047852093,0.00008401609,0.00008617912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029787418,0.00032125402,0.00025213437,0.00059402105,0.00037467657,0.0003170509,0.00073207624,0.00020870067,0.0000499669],"category_scores_gemma":[0.00017703179,0.00031794957,0.00009365562,0.00053579046,0.0005487091,0.00029709132,0.00025910017,0.00075651426,0.000008257777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018148305,0.0000145160975,0.000045874756,0.000018087941,0.000002142459,0.00002138322,0.00010928983,0.28390813,0.013336628,0.0014510116,0.0000074332793,0.7010673],"study_design_scores_gemma":[0.00019478162,0.000058500777,0.00012216749,0.00007437242,0.000009452447,0.00005816674,2.8686597e-7,0.9831898,0.011538185,0.00426523,0.00020182123,0.00028718883],"about_ca_topic_score_codex":0.000010350867,"about_ca_topic_score_gemma":0.00003838915,"teacher_disagreement_score":0.97483206,"about_ca_system_score_codex":0.0003429436,"about_ca_system_score_gemma":0.00016730365,"threshold_uncertainty_score":0.9999273},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016737318,0.0011032164,0.9796469,0.0016865492,0.0020669557,0.00032137855,0.000014395538,0.00024886997,0.014894977],"genre_scores_gemma":[0.017492991,0.00056577835,0.95360106,0.0054719714,0.00086669734,0.000023954288,0.000074107535,0.000052593998,0.021850815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954672,0.0000337535,0.0006003641,0.0020618315,0.0011190852,0.00071778195],"domain_scores_gemma":[0.9971128,0.00041106762,0.00030813366,0.0018501745,0.00018366412,0.00013416109],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012245696,0.0004894121,0.0005105964,0.00092374714,0.0003572155,0.001731853,0.006334791,0.0002131583,0.0000333123],"category_scores_gemma":[0.00017471856,0.00048340907,0.00015044796,0.0011863215,0.0005609727,0.0015755395,0.0045205224,0.0006926441,0.000038298716],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016773516,0.000026789527,0.00007966106,0.00004396587,0.000019535262,0.00012136621,0.00010862904,0.0014118069,0.000057210214,0.016516868,0.0023685016,0.979244],"study_design_scores_gemma":[0.00035149907,0.00013709703,0.000046268317,0.0009510288,0.000021604628,0.000041574913,4.1501002e-7,0.6975201,0.0012724053,0.2741019,0.024361903,0.0011941902],"about_ca_topic_score_codex":0.00013751035,"about_ca_topic_score_gemma":0.00011074836,"teacher_disagreement_score":0.9780498,"about_ca_system_score_codex":0.000114063536,"about_ca_system_score_gemma":0.00026408886,"threshold_uncertainty_score":0.99976176},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000373409,0.00045650953,0.99336785,0.0014402434,0.0012421189,0.00064093276,0.00003800742,0.00026512312,0.0025118815],"genre_scores_gemma":[0.29384908,0.00028423616,0.69844294,0.0046722176,0.0006865184,0.00012521747,0.00040770066,0.00009121377,0.001440855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959089,0.000057939607,0.000697464,0.0013646216,0.0012210815,0.0007499904],"domain_scores_gemma":[0.99678504,0.001250503,0.00030390904,0.0010449761,0.00043646758,0.00017909564],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011017558,0.000516357,0.0004758712,0.0005149574,0.00071427797,0.001174441,0.0036701425,0.00019034049,0.000042568015],"category_scores_gemma":[0.00010063173,0.00040875067,0.00014457783,0.001038632,0.0005297212,0.00072223967,0.0016426711,0.0010946578,0.00003182274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023920754,0.00002904045,0.000013802748,0.000024528317,0.000013083503,0.000015624464,0.0003419798,0.6971488,0.0000067923456,0.006913429,0.00060632505,0.29488423],"study_design_scores_gemma":[0.00030176697,0.00007395613,0.00015497397,0.00029566776,0.000005613213,0.00002109855,9.709137e-7,0.97085404,0.00009752892,0.024855461,0.0028754137,0.0004635176],"about_ca_topic_score_codex":0.00001536639,"about_ca_topic_score_gemma":0.000012494266,"teacher_disagreement_score":0.29492489,"about_ca_system_score_codex":0.00023945692,"about_ca_system_score_gemma":0.00063862966,"threshold_uncertainty_score":0.99986243},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052742014,0.00048758736,0.98984253,0.00097615406,0.0019672494,0.0003687562,0.000008365081,0.00010894049,0.0057130004],"genre_scores_gemma":[0.47356433,0.00021388014,0.51557714,0.005722879,0.0007630939,0.000020908887,0.000054291675,0.00003839352,0.004045111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969455,0.000028095968,0.00041152575,0.0013304986,0.0008036788,0.00048071795],"domain_scores_gemma":[0.99797094,0.00064813934,0.00020395823,0.00076510594,0.00024590752,0.00016593639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005602855,0.00043644954,0.00040386795,0.0009631345,0.00037615653,0.0008414542,0.0014994376,0.0002569349,0.000009235456],"category_scores_gemma":[0.0001333382,0.0004332415,0.00010100364,0.00076943473,0.0005173689,0.0007118852,0.0010772144,0.00048114063,0.000015976993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013410589,0.00002571128,0.00035781378,0.000050942905,0.000023615765,0.000056090168,0.00029742374,0.2455867,0.000057470155,0.33758068,0.00028523116,0.4156649],"study_design_scores_gemma":[0.00032507975,0.00013492529,0.0005957389,0.00019947966,0.000010531767,0.000043344724,1.3675813e-7,0.6406532,0.00024923304,0.34774455,0.009564112,0.00047966785],"about_ca_topic_score_codex":0.00003323066,"about_ca_topic_score_gemma":0.00035222253,"teacher_disagreement_score":0.47426543,"about_ca_system_score_codex":0.00027431466,"about_ca_system_score_gemma":0.0009531067,"threshold_uncertainty_score":0.99981195},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006128672,0.00026765594,0.98526186,0.0025574684,0.0018849123,0.000784623,0.0000063509456,0.00025895739,0.00897204],"genre_scores_gemma":[0.01878739,0.0003292778,0.9594827,0.006312104,0.00029183723,0.000023111746,0.000018559704,0.000057223555,0.014697744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954517,0.00007850464,0.0005149747,0.0017632073,0.0013105025,0.00088112114],"domain_scores_gemma":[0.99699557,0.0004076377,0.00014656925,0.001686824,0.0004753018,0.00028807647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010466618,0.00053583033,0.0004690779,0.0014337703,0.00039434555,0.0007888984,0.003971732,0.00032895737,0.000048737566],"category_scores_gemma":[0.00014123021,0.00047544308,0.0001325207,0.0012872212,0.0005953855,0.00042038917,0.0018593391,0.0012499257,0.00018491193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008288038,0.00013434172,0.000037037244,0.00009939696,0.000022440585,0.00007036211,0.0010889417,0.5000366,0.00016510468,0.052232474,0.00025601403,0.445849],"study_design_scores_gemma":[0.00037702092,0.0003243726,0.000051623378,0.00064658595,0.000003922991,0.000013416959,1.2947172e-7,0.9794501,0.0005003514,0.01216128,0.005900895,0.0005702894],"about_ca_topic_score_codex":0.000032671673,"about_ca_topic_score_gemma":0.000059710746,"teacher_disagreement_score":0.47941354,"about_ca_system_score_codex":0.000392576,"about_ca_system_score_gemma":0.0013291796,"threshold_uncertainty_score":0.99976975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004114996,0.00015404912,0.99203336,0.0022931173,0.0010088735,0.0008560633,0.000004213433,0.000088596156,0.0035205474],"genre_scores_gemma":[0.32599714,0.000060905328,0.65109533,0.009570861,0.0017672074,0.00010116162,0.000104390696,0.00011552213,0.011187446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982489,0.000031260883,0.0001873647,0.0007881514,0.0004293191,0.00031501765],"domain_scores_gemma":[0.9981559,0.0010624133,0.00015428597,0.00029456004,0.00025495427,0.00007788662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058050465,0.000314484,0.0004322112,0.0006733842,0.00022000751,0.000073131734,0.00017063924,0.00042597574,0.000018052877],"category_scores_gemma":[0.00052116683,0.00027552183,0.00016488534,0.0002609789,0.00013974529,0.00009231989,0.000035172106,0.0011390052,0.0000053486992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029340095,0.000027580654,0.000038621052,0.00009735775,0.000018644883,0.00001695387,0.00007920339,0.04352237,0.001822929,0.00015939264,0.000056590772,0.95386696],"study_design_scores_gemma":[0.0016385494,0.0013138792,0.00034494064,0.0012258759,0.00010071922,0.000027142418,0.0000011725965,0.96188325,0.010777695,0.0050015864,0.017314468,0.00037072794],"about_ca_topic_score_codex":0.00000864463,"about_ca_topic_score_gemma":0.0001050319,"teacher_disagreement_score":0.9534962,"about_ca_system_score_codex":0.00025906105,"about_ca_system_score_gemma":0.00040150693,"threshold_uncertainty_score":0.9999697},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010669687,0.00063017616,0.9972744,0.00003949452,0.0004766612,0.0002871359,0.000011603827,0.000064712876,0.0001488751],"genre_scores_gemma":[0.8366035,0.000051677434,0.16297756,0.00007230063,0.00009242975,0.000021167916,0.000017258582,0.000031381896,0.00013269938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989281,0.0000076270276,0.00024897748,0.00037959634,0.00019115428,0.00024451673],"domain_scores_gemma":[0.99927264,0.00033305713,0.00008584189,0.00018126835,0.00008437998,0.000042828095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016218088,0.00025367498,0.00030135928,0.00032948086,0.00010584655,0.00005998347,0.00023958313,0.00006028732,0.0000033662013],"category_scores_gemma":[0.00003101162,0.0002531517,0.000055229917,0.000104056555,0.00019588225,0.00016640495,0.00006291981,0.00028136667,5.08742e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061086103,0.0000036120805,0.000063429965,0.0002342518,0.000005872894,0.0000032266773,0.0000646297,0.67362255,0.0028233724,0.000037982234,0.000002325181,0.3231326],"study_design_scores_gemma":[0.0003731309,0.000058830017,0.00008695133,0.00044343589,0.000019327212,0.0000026067012,0.0000010763845,0.90199053,0.094381794,0.0022374624,0.00015904907,0.0002457986],"about_ca_topic_score_codex":0.0000038419703,"about_ca_topic_score_gemma":0.000011020112,"teacher_disagreement_score":0.83553654,"about_ca_system_score_codex":0.00008160896,"about_ca_system_score_gemma":0.000051971296,"threshold_uncertainty_score":0.9999921},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021200407,0.00017758088,0.9965682,0.00017977,0.00032388957,0.00053119747,0.0000013206762,0.000080669335,0.0019253842],"genre_scores_gemma":[0.63340634,0.000072174655,0.3631029,0.0003553917,0.00006921551,0.000020560896,0.000013726668,0.000038367132,0.002921291],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959362,0.00008151362,0.0005850417,0.0012676666,0.0013775657,0.00075201975],"domain_scores_gemma":[0.9966669,0.0010853409,0.0007601152,0.0012784415,0.000095884316,0.00011329838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010222304,0.0005851423,0.0006673134,0.0013675168,0.00025194278,0.00024936226,0.002648032,0.0003042465,0.000010835087],"category_scores_gemma":[0.00029038885,0.00051690784,0.00011054389,0.0008165642,0.0005965838,0.00044274036,0.0010928025,0.0014683498,0.000008994716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002381033,0.000017604541,0.0067397514,0.0000661714,0.000013405497,0.00004332491,0.00058764,0.95684165,0.000024000885,0.0010566165,0.000005592628,0.034580406],"study_design_scores_gemma":[0.00090993557,0.00039298311,0.0007200005,0.0010303862,0.000013017669,0.0000051579905,9.607523e-7,0.9909505,0.0024807928,0.0009175166,0.002049192,0.00052951876],"about_ca_topic_score_codex":0.00008578223,"about_ca_topic_score_gemma":0.000075025244,"teacher_disagreement_score":0.6334653,"about_ca_system_score_codex":0.0005333312,"about_ca_system_score_gemma":0.0005994876,"threshold_uncertainty_score":0.99972826},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019845393,0.00049530016,0.9944554,0.00066601194,0.00049816375,0.0003738922,0.000013663737,0.0001987111,0.0031004162],"genre_scores_gemma":[0.66402626,0.000117579046,0.33451462,0.00097632373,0.00014807278,0.000012095336,0.00002527257,0.000020585368,0.00015921053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963042,0.00008904489,0.0008164425,0.0015378606,0.0007819531,0.00047050504],"domain_scores_gemma":[0.9958098,0.00083318,0.00044651888,0.0025329574,0.00032108076,0.000056456327],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021998982,0.00038725926,0.00067292905,0.0025530974,0.00024350747,0.00046083573,0.005466436,0.0002699285,0.000014666784],"category_scores_gemma":[0.00022548396,0.00031683242,0.00017598644,0.0033742886,0.0006217671,0.0007496835,0.0028898362,0.0008825022,0.0000045463607],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009160804,0.00007940622,0.0012562616,0.00009374466,0.00015641062,0.00007607944,0.0016668325,0.007814046,0.0011049197,0.012757468,0.000117908,0.97486776],"study_design_scores_gemma":[0.00040721527,0.00013081249,0.0012929122,0.0017114892,0.00013008702,0.00004532575,0.000002984099,0.88297015,0.030420784,0.08109036,0.00083206984,0.00096583413],"about_ca_topic_score_codex":0.00014682498,"about_ca_topic_score_gemma":0.0006497608,"teacher_disagreement_score":0.9739019,"about_ca_system_score_codex":0.00025043127,"about_ca_system_score_gemma":0.0004394958,"threshold_uncertainty_score":0.99992836},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024386501,0.00299161,0.96942884,0.00052850816,0.00039655936,0.0010854999,0.00040045314,0.00005473999,0.0007272837],"genre_scores_gemma":[0.96582025,0.0000830566,0.03334398,0.0004930487,0.000055672088,0.000038993003,0.0000817595,0.000021681983,0.00006153372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966243,0.00005735129,0.0007136619,0.0011980203,0.0010183608,0.00038832636],"domain_scores_gemma":[0.9969228,0.00056384614,0.00043924665,0.0013376354,0.00039327072,0.0003432167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004533837,0.00048720764,0.0012777008,0.0013414689,0.0000722581,0.000029329156,0.0005169173,0.00019695297,0.00027072994],"category_scores_gemma":[0.00021880103,0.00041412003,0.00062524626,0.001210138,0.00063235156,0.00007817739,0.00024281064,0.00026912676,0.0000031312077],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008335431,0.0026158916,0.3233625,0.0020290823,0.0013943182,0.00046174292,0.00020606536,0.010631389,0.0004976284,0.0005653583,0.000032316326,0.65737015],"study_design_scores_gemma":[0.0069789453,0.0024902786,0.37494105,0.009139033,0.015922958,0.000008496285,0.000001177911,0.43372455,0.090138085,0.052164223,0.011988575,0.0025026149],"about_ca_topic_score_codex":0.00008859644,"about_ca_topic_score_gemma":0.00013115325,"teacher_disagreement_score":0.9414338,"about_ca_system_score_codex":0.00040767825,"about_ca_system_score_gemma":0.00088641467,"threshold_uncertainty_score":0.9998311},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007372172,0.00020208345,0.9846617,0.00017604284,0.0007685918,0.000929902,0.0000032923294,0.000093928276,0.0057922658],"genre_scores_gemma":[0.31732127,0.000062582214,0.6781808,0.0006559918,0.00014373002,0.000010541616,0.000031073276,0.000043533266,0.003550491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978183,0.000027960403,0.00044496325,0.0006815244,0.00066478935,0.0003624908],"domain_scores_gemma":[0.99892694,0.00016045652,0.00022608304,0.00042732494,0.0001703721,0.00008884075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048415552,0.00032877192,0.00053481234,0.00083587127,0.00010444564,0.00007118808,0.00035047354,0.00015906831,0.00008557649],"category_scores_gemma":[0.00005233194,0.00031131535,0.0001228673,0.00037106453,0.00027329518,0.00011742036,0.00036270567,0.00045947512,0.0000042881647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006653097,0.00035886068,0.008011128,0.0030953032,0.00038276732,0.00011079646,0.0028386218,0.087927,0.014737939,0.0012410202,0.00003198903,0.88119805],"study_design_scores_gemma":[0.0017622609,0.00045032837,0.0011044199,0.0018406953,0.00029026403,0.0000035368216,0.000006690687,0.9866966,0.0060193255,0.0006651207,0.0006950011,0.0004657684],"about_ca_topic_score_codex":0.000031742813,"about_ca_topic_score_gemma":0.000015351623,"teacher_disagreement_score":0.8987696,"about_ca_system_score_codex":0.00039914923,"about_ca_system_score_gemma":0.00043696177,"threshold_uncertainty_score":0.9999339},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026215257,0.013831107,0.91717064,0.0053474656,0.0016684526,0.0009459986,0.0000071951404,0.00006877367,0.060934167],"genre_scores_gemma":[0.0222939,0.013036377,0.9044215,0.013363041,0.0015723894,0.0000997929,0.000059652797,0.00014291098,0.045010418],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973691,0.000056698864,0.00043757953,0.0010853312,0.00058368855,0.00046760676],"domain_scores_gemma":[0.99825615,0.00054343155,0.00012511373,0.0007561459,0.00013916522,0.0001799988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015760732,0.00047047326,0.00080306863,0.00073488196,0.000118426164,0.00012445674,0.00040517407,0.00022484722,0.00022546857],"category_scores_gemma":[0.00011525307,0.00039038146,0.00012712098,0.00031642546,0.00054384803,0.00009252314,0.000724391,0.00059068686,0.000009021614],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000157364,0.00005450094,0.000054891072,0.0007687921,0.000064691485,0.000047832633,0.000104434104,0.00006038019,0.000017949817,0.005859863,0.00039998267,0.99255097],"study_design_scores_gemma":[0.0054179425,0.0023005805,0.0026011514,0.012078105,0.0015173283,0.000061533356,0.000002086744,0.13878292,0.0010010342,0.2726075,0.5609747,0.0026550982],"about_ca_topic_score_codex":0.000013353638,"about_ca_topic_score_gemma":0.000036320223,"teacher_disagreement_score":0.9898958,"about_ca_system_score_codex":0.00014614653,"about_ca_system_score_gemma":0.00025803532,"threshold_uncertainty_score":0.9998548},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024080612,0.00030385007,0.97045654,0.0010866107,0.0007252996,0.0019926475,0.00004502191,0.000035091714,0.0012743066],"genre_scores_gemma":[0.6216428,0.00018057637,0.37455815,0.0014671667,0.00045981933,0.000051181498,0.00006156259,0.000053159503,0.0015255816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775887,0.000022281672,0.00045277475,0.0006758613,0.0007058823,0.00038432662],"domain_scores_gemma":[0.9986147,0.00030733156,0.00014347614,0.00047355634,0.00037209396,0.00008881214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062888314,0.0002546212,0.00049783516,0.0015798558,0.000076650074,0.000039726565,0.0005347688,0.0002414063,0.000040376093],"category_scores_gemma":[0.00032376847,0.00024119974,0.00011009578,0.00070542103,0.0006611628,0.00014127741,0.00034242083,0.0006841435,0.0000038306252],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003943892,0.00005895941,0.00042252292,0.00036709543,0.000014440549,0.00005241125,0.000049127844,0.00014151403,0.0033429363,0.002000673,0.00008197797,0.9895244],"study_design_scores_gemma":[0.019767236,0.15865853,0.04396958,0.055346105,0.0007563624,0.00052779925,0.00003696354,0.28930417,0.18698955,0.22682486,0.0122766225,0.0055422406],"about_ca_topic_score_codex":0.00004107529,"about_ca_topic_score_gemma":0.000050367325,"teacher_disagreement_score":0.9839822,"about_ca_system_score_codex":0.0005735259,"about_ca_system_score_gemma":0.0017860571,"threshold_uncertainty_score":0.983584},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000044975795,0.00036142286,0.9943845,0.0017021763,0.00074815267,0.00037863577,0.000006466379,0.00014766364,0.002266459],"genre_scores_gemma":[0.0005028277,0.00013147107,0.9942358,0.0018769727,0.0001964325,0.000009904523,0.000027037177,0.00001085548,0.0030086758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744815,0.000056694556,0.00034252513,0.0010749883,0.0006498593,0.0004277785],"domain_scores_gemma":[0.99844223,0.00030538367,0.00012939001,0.0007598209,0.00023749984,0.00012568565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068600976,0.00028352183,0.00031468796,0.00084892276,0.00019607318,0.0006548616,0.001847128,0.00021186343,0.000005567857],"category_scores_gemma":[0.0001175812,0.00025794434,0.000043971555,0.0012349708,0.0003877575,0.00059666636,0.0013231194,0.000565192,0.0000062833215],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.5931905e-7,0.000035800906,0.000012838414,0.000068725065,0.0000041478743,0.000010434472,0.00043772344,0.031482905,0.000008771082,0.006180579,0.0001956801,0.9615616],"study_design_scores_gemma":[0.00018405647,0.00005854695,0.00004558758,0.00021819607,0.0000021737458,0.000013616078,9.252392e-8,0.92978734,0.00008383112,0.06720018,0.0021555047,0.00025089018],"about_ca_topic_score_codex":0.0000088356755,"about_ca_topic_score_gemma":0.000021924725,"teacher_disagreement_score":0.96131074,"about_ca_system_score_codex":0.00022097581,"about_ca_system_score_gemma":0.0012136742,"threshold_uncertainty_score":0.9999873},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06502518,0.0107040405,0.8887006,0.016417919,0.0026248354,0.0010473458,0.00009296295,0.000029002907,0.015358093],"genre_scores_gemma":[0.93354475,0.0005364825,0.061084185,0.00024693302,0.00017098444,0.0000035089595,0.000033725195,0.0000067333763,0.004372665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793714,0.00004843419,0.00033319512,0.0005929398,0.0008815771,0.00020670141],"domain_scores_gemma":[0.9970894,0.0012002467,0.0001333978,0.0008988966,0.00063596596,0.000042103828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011169729,0.00011839539,0.00036872117,0.0030420036,0.00021402039,0.000046179546,0.0006297523,0.00009347379,0.000029325263],"category_scores_gemma":[0.0011746685,0.000084315536,0.00006492092,0.0062996056,0.0009608529,0.00015164587,0.0012940791,0.00052306615,3.5785595e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027533628,0.00014712622,0.18550709,0.0006747495,0.0004232046,0.0000014026155,0.0064492365,0.09159135,0.0000118354055,0.008274276,0.00030966316,0.70658255],"study_design_scores_gemma":[0.0002620738,0.00013775428,0.035745576,0.0012273937,0.000485778,0.000007962114,0.000027323867,0.95129734,0.000057546302,0.0070423842,0.0034732244,0.00023563119],"about_ca_topic_score_codex":0.00037508685,"about_ca_topic_score_gemma":0.00005161914,"teacher_disagreement_score":0.8685196,"about_ca_system_score_codex":0.00011215798,"about_ca_system_score_gemma":0.0008963579,"threshold_uncertainty_score":0.35403025},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018895988,0.0002482433,0.99373996,0.000875859,0.002045363,0.00059854606,0.000042677202,0.00011747967,0.0023129678],"genre_scores_gemma":[0.21617277,0.000096014955,0.78133285,0.0005769649,0.0005768738,0.00004996433,0.000019775,0.000040867777,0.0011339427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969693,0.000027506325,0.0005587928,0.0013326225,0.0007133438,0.00039846887],"domain_scores_gemma":[0.99657786,0.0010170283,0.0004448344,0.001347176,0.0005340684,0.00007904192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079609384,0.00037155976,0.00043468905,0.0008667115,0.00019852618,0.00028538733,0.0024047815,0.00030178684,0.000008785646],"category_scores_gemma":[0.000114465955,0.00035809056,0.00015830732,0.0006789397,0.00059102447,0.000631081,0.00051580084,0.00039759444,0.0000059516565],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019420291,0.00003243087,0.00003781527,0.00015831355,0.0000124952185,0.000002763649,0.00015848652,0.0032243137,0.010420776,0.019244567,0.00029077395,0.9663978],"study_design_scores_gemma":[0.0007890106,0.0006674544,0.003405007,0.0016618237,0.000039579292,0.00017145558,4.8892997e-7,0.5847402,0.0404105,0.3635532,0.0033867792,0.0011744704],"about_ca_topic_score_codex":0.000019650597,"about_ca_topic_score_gemma":0.000034473538,"teacher_disagreement_score":0.9652234,"about_ca_system_score_codex":0.0004408545,"about_ca_system_score_gemma":0.0006378176,"threshold_uncertainty_score":0.9998871},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011378664,0.00091035716,0.99041945,0.0010638637,0.0017393864,0.0008744155,0.0000444001,0.0009494485,0.003987304],"genre_scores_gemma":[0.0076973997,0.000039142433,0.9899054,0.0011823832,0.00019961843,0.000050422295,0.00001745066,0.000032498607,0.000875686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99539685,0.000020889554,0.00066626107,0.002247869,0.0007284981,0.00093963864],"domain_scores_gemma":[0.99534464,0.0013084386,0.00042284123,0.0024522932,0.00034982897,0.00012196224],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007056971,0.00074460154,0.00080407533,0.0013923644,0.00040717545,0.00067711715,0.007158524,0.00050067226,0.000009435397],"category_scores_gemma":[0.00050010474,0.00070300745,0.00020175938,0.00087589514,0.001265854,0.0012487948,0.0032266746,0.00080446986,0.000018999906],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069035145,0.000016794867,0.0000030958884,0.00008428999,0.000021439448,0.000054939228,0.00034519186,0.032967128,0.00023386256,0.057659045,0.00014307348,0.90846425],"study_design_scores_gemma":[0.00060986745,0.00022406159,0.000006856979,0.0009091891,0.000023695744,0.000050021587,0.0000017005449,0.6423836,0.008734115,0.33875343,0.007046033,0.0012574359],"about_ca_topic_score_codex":0.0000056187596,"about_ca_topic_score_gemma":0.00016126911,"teacher_disagreement_score":0.9072068,"about_ca_system_score_codex":0.00036266132,"about_ca_system_score_gemma":0.0008033752,"threshold_uncertainty_score":0.9995421},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019020123,0.00041957613,0.9921017,0.0012620175,0.00021613576,0.0006016277,0.000006799225,0.00037370043,0.0031163832],"genre_scores_gemma":[0.12536946,0.00014997344,0.871513,0.0008839888,0.00020776302,0.00007151835,0.000014080795,0.00004303342,0.0017471856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675035,0.000029320301,0.00039962682,0.0016723096,0.00055582216,0.0005925558],"domain_scores_gemma":[0.9976541,0.00019569797,0.00022858169,0.0015373022,0.00025716727,0.00012719208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000644539,0.0004921153,0.00050431147,0.00089141063,0.00044492577,0.00029781918,0.0018613165,0.0004801875,0.000010386291],"category_scores_gemma":[0.000037540784,0.00043881248,0.000052971754,0.0010918651,0.000982058,0.00010442106,0.0012404197,0.00067168445,0.000010560014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015057976,0.00011517339,0.0001009707,0.000117592135,0.000041732976,0.000076776225,0.00059645943,0.07720945,0.0006595663,0.5473479,0.00006985448,0.37364945],"study_design_scores_gemma":[0.0002724319,0.00012669316,0.00003903827,0.00025786945,0.000009151412,0.000059406717,1.5480373e-7,0.96806747,0.00063632964,0.029512051,0.00054035377,0.00047902498],"about_ca_topic_score_codex":0.000072849216,"about_ca_topic_score_gemma":0.00004668624,"teacher_disagreement_score":0.89085805,"about_ca_system_score_codex":0.00028214257,"about_ca_system_score_gemma":0.0007065877,"threshold_uncertainty_score":0.99980634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000069794387,0.00033001287,0.9827815,0.0030728828,0.0026416178,0.0006966496,0.0007146666,0.00032757517,0.009428097],"genre_scores_gemma":[0.08809817,0.00007565878,0.8987476,0.008733151,0.00071793253,0.0000474612,0.002135433,0.00008011105,0.0013644771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99294645,0.00009782251,0.00087098463,0.0036831847,0.0015569482,0.00084461103],"domain_scores_gemma":[0.98694,0.0012960159,0.00042480556,0.010704837,0.00039599082,0.00023833728],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019099195,0.0007167763,0.00065755507,0.0012184002,0.00070377166,0.0015066997,0.013595241,0.00044560916,0.000049963306],"category_scores_gemma":[0.0009824235,0.00073424546,0.00013157527,0.0013158992,0.0015218586,0.0013728043,0.005205959,0.0011890153,0.00010882897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028005703,0.00027540157,0.00005690118,0.00011949187,0.00003068806,0.00013051022,0.0002701507,0.010343772,0.00012668835,0.17503273,0.004057089,0.8095286],"study_design_scores_gemma":[0.00047330384,0.00012493406,0.00040062287,0.0004293138,0.000018807177,0.00001882106,1.2481473e-7,0.9449269,0.00026212915,0.038035903,0.014589338,0.0007198021],"about_ca_topic_score_codex":0.00008065507,"about_ca_topic_score_gemma":0.00052769226,"teacher_disagreement_score":0.9345831,"about_ca_system_score_codex":0.00048788235,"about_ca_system_score_gemma":0.0022704436,"threshold_uncertainty_score":0.99952984},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028564647,0.0008845372,0.9869524,0.0011205751,0.0050791963,0.0005605602,0.0000113636415,0.00050909555,0.0045965724],"genre_scores_gemma":[0.53009117,0.00014536886,0.45417574,0.010680646,0.0026038147,0.000046001765,0.000050046936,0.00015619978,0.002051028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942292,0.00007821595,0.00080904475,0.0024443225,0.0013022627,0.0011369791],"domain_scores_gemma":[0.9962491,0.00079999317,0.00026561026,0.002017788,0.00042913452,0.00023837796],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001258414,0.0008943463,0.0009323668,0.0013028124,0.000708559,0.0011056446,0.0039322563,0.000497194,0.000027359063],"category_scores_gemma":[0.00014918514,0.0007970476,0.0003398825,0.0011684013,0.0005655267,0.0007341582,0.0021555552,0.0015705823,0.000037030095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036072535,0.000035480316,0.000014820356,0.00007223908,0.000033753502,0.0001300411,0.00035973324,0.07864452,0.00027658054,0.02449428,0.000077566496,0.8958249],"study_design_scores_gemma":[0.0005418013,0.00027817473,0.00016848485,0.000884862,0.000025083102,0.00014272302,2.7208026e-7,0.8941673,0.00025413054,0.0960453,0.0066056303,0.0008862181],"about_ca_topic_score_codex":0.00007210882,"about_ca_topic_score_gemma":0.000045739333,"teacher_disagreement_score":0.8949387,"about_ca_system_score_codex":0.00031106023,"about_ca_system_score_gemma":0.0009563033,"threshold_uncertainty_score":0.9999313},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053364645,0.0003682022,0.975365,0.0013902707,0.0018152214,0.00023640513,0.0000028222241,0.0002128907,0.020555811],"genre_scores_gemma":[0.93510294,0.0000741023,0.05633176,0.004919648,0.0005531545,0.0000073911365,0.00000841339,0.000029390283,0.0029731998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995384,0.000051432882,0.00063581316,0.0019563548,0.001257319,0.0007151086],"domain_scores_gemma":[0.9977726,0.0005048432,0.0001830061,0.0011123416,0.00023983612,0.0001874152],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000988551,0.0006412512,0.00070115394,0.0010160847,0.00030524202,0.0007396585,0.0040715043,0.0003913197,0.00004322495],"category_scores_gemma":[0.0001311874,0.000549511,0.0003065873,0.0006722794,0.00038871757,0.0004671842,0.0012682636,0.0011609035,0.00006972789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035282133,0.000027725346,0.000010358534,0.000020989062,0.000024482593,0.00007219619,0.00025232093,0.06649849,0.000011327088,0.30446053,0.00027158723,0.62834644],"study_design_scores_gemma":[0.00013805182,0.00016982165,0.0000612058,0.00090333505,0.000020738371,0.000022552076,2.2893974e-7,0.98357165,0.0003359437,0.00642939,0.0076026674,0.0007444298],"about_ca_topic_score_codex":0.000008726636,"about_ca_topic_score_gemma":0.00010687752,"teacher_disagreement_score":0.9350496,"about_ca_system_score_codex":0.00032854048,"about_ca_system_score_gemma":0.0004688696,"threshold_uncertainty_score":0.99969566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031488908,0.00019422694,0.990639,0.0009798405,0.0012439858,0.0034149606,0.0000140792545,0.00055970566,0.0029227408],"genre_scores_gemma":[0.046858195,0.000035519064,0.9457927,0.0030263262,0.0004309176,0.00066721626,0.000046439625,0.00008187995,0.0030608578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943552,0.00009105744,0.0008076113,0.0025170771,0.0012736722,0.00095539395],"domain_scores_gemma":[0.9951896,0.0003384866,0.00047900827,0.0031223095,0.0005447568,0.000325837],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009804426,0.00075746415,0.00066892453,0.001195719,0.00038473855,0.00071647123,0.0059774923,0.00043426696,0.00009726679],"category_scores_gemma":[0.00018315935,0.00074203213,0.00015771127,0.0013571114,0.0008261588,0.0013371819,0.0025685527,0.0010537775,0.00010566331],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000117413865,0.00015477819,0.00003818222,0.0001324848,0.000022741817,0.00005638782,0.0015398057,0.0005250652,0.00033162587,0.24292462,0.000027513712,0.754235],"study_design_scores_gemma":[0.00043262792,0.00018826083,0.00007002092,0.0005104942,0.000010722138,0.000018408271,2.124549e-7,0.5092079,0.001995997,0.4816844,0.005102253,0.0007786913],"about_ca_topic_score_codex":0.000012824807,"about_ca_topic_score_gemma":0.000054661126,"teacher_disagreement_score":0.75345635,"about_ca_system_score_codex":0.00048332658,"about_ca_system_score_gemma":0.00073791714,"threshold_uncertainty_score":0.9995031},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021024716,0.0010353905,0.994192,0.0006101764,0.0012159961,0.000593697,0.000036066718,0.00028411948,0.0020115403],"genre_scores_gemma":[0.012735402,0.000114830684,0.98504263,0.0016356449,0.00020798377,0.000015669895,0.00004816379,0.000024687264,0.00017499387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957005,0.00005473287,0.0004905532,0.001996269,0.0010657691,0.00069222244],"domain_scores_gemma":[0.9965828,0.0004782604,0.00033508858,0.0020267735,0.00038245498,0.00019459554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007327075,0.0006804396,0.0006387102,0.0012283423,0.00036517717,0.00082832255,0.0039525838,0.00052110694,0.00002327069],"category_scores_gemma":[0.000087393826,0.0005576823,0.00017638395,0.0014905207,0.000769328,0.0010353039,0.0012161381,0.0013090443,0.00001692853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007714058,0.00014682914,0.00014131806,0.00014404654,0.00006735304,0.00027472712,0.0017930777,0.03293015,0.00008027961,0.18304403,0.0003010273,0.781],"study_design_scores_gemma":[0.002213858,0.0003592826,0.00028638943,0.0018115649,0.00004643392,0.000101974554,4.652785e-7,0.83744615,0.002142383,0.14638534,0.007320439,0.0018857378],"about_ca_topic_score_codex":0.000033742486,"about_ca_topic_score_gemma":0.00024557408,"teacher_disagreement_score":0.80451596,"about_ca_system_score_codex":0.00016981862,"about_ca_system_score_gemma":0.00073971564,"threshold_uncertainty_score":0.9996875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012992456,0.000092951675,0.9528347,0.0013002164,0.00028170826,0.00035505558,0.000052323587,0.000025107323,0.04375866],"genre_scores_gemma":[0.94305414,0.000003859389,0.055528264,0.00031036383,0.00007735355,0.0000058550168,0.0000070871765,0.000008809577,0.001004293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964917,0.00008112173,0.00072122377,0.00082506286,0.001573339,0.000307562],"domain_scores_gemma":[0.9925669,0.005186193,0.00048605358,0.0009893078,0.0006877568,0.000083825544],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0025605296,0.00026731513,0.00042599984,0.00035828023,0.00041490066,0.00039958887,0.002640692,0.00012142972,0.00014578494],"category_scores_gemma":[0.00024362805,0.00015552544,0.000095960626,0.0008013162,0.009768089,0.00013053489,0.00046053284,0.0004413369,0.00003404342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020988022,0.000015397189,0.000040847342,0.000005762122,0.0000100407515,0.0000035286962,0.00011143248,0.034629934,0.000032239903,0.81617874,0.000028059278,0.14892301],"study_design_scores_gemma":[0.00014219081,0.000065055516,0.00023663737,0.00010542505,0.0000064250544,0.000017125685,0.0000024242524,0.08877079,0.0000986382,0.91002285,0.0003779357,0.00015452101],"about_ca_topic_score_codex":0.000005771958,"about_ca_topic_score_gemma":0.000090964284,"teacher_disagreement_score":0.9417549,"about_ca_system_score_codex":0.000058183494,"about_ca_system_score_gemma":0.0010697296,"threshold_uncertainty_score":0.9929268},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017668168,0.0005379569,0.9852475,0.007221081,0.0012476448,0.0006926709,0.0000028833508,0.00022879493,0.0048038336],"genre_scores_gemma":[0.018612761,0.00021020684,0.95382196,0.026224744,0.00045679236,0.0000757298,0.000009277655,0.000031167234,0.00055737176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99328464,0.00018888655,0.00089209114,0.0016142318,0.003283316,0.0007368152],"domain_scores_gemma":[0.9959356,0.0016080965,0.00027823745,0.001785837,0.00018209298,0.00021010476],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.005051844,0.00050097855,0.0005293638,0.0011099095,0.00024547253,0.00069506274,0.006762064,0.00038345324,0.00007150572],"category_scores_gemma":[0.0008773474,0.00036016063,0.0001347872,0.001193028,0.0010423049,0.00034449014,0.0022154946,0.0017431572,0.00002378613],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025166607,0.00007259709,0.000013172028,0.000054095028,0.000005798597,0.0006130635,0.001325931,0.0013377072,0.00011182877,0.005016767,0.00062137377,0.9908252],"study_design_scores_gemma":[0.0010835488,0.00035696174,0.00035789594,0.0043984773,0.000023138202,0.0005478086,0.000004782774,0.87632126,0.017443266,0.09525915,0.0025058743,0.0016978255],"about_ca_topic_score_codex":0.000056919103,"about_ca_topic_score_gemma":0.00004369945,"teacher_disagreement_score":0.98912734,"about_ca_system_score_codex":0.00043924412,"about_ca_system_score_gemma":0.0011319118,"threshold_uncertainty_score":0.999885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035916638,0.00007698029,0.9643492,0.013909632,0.0029931976,0.00064296357,0.000006766628,0.0001473857,0.0175147],"genre_scores_gemma":[0.91808534,0.001693265,0.026101163,0.042539824,0.002343154,0.0002863993,0.000110526795,0.00012884826,0.008711457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939717,0.00027442345,0.0006906743,0.0016193653,0.0029175587,0.00052628806],"domain_scores_gemma":[0.9977754,0.0010667021,0.00024949262,0.0005885345,0.00010009493,0.0002198152],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018090388,0.0004078596,0.0004036603,0.0011231216,0.00025836477,0.00035828148,0.0012906668,0.00047313375,0.00025055243],"category_scores_gemma":[0.0015397298,0.00038276822,0.00008669157,0.0012251849,0.0006753744,0.0005840991,0.00033164767,0.0016915378,0.000056116514],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041402865,0.0002497121,0.000003908917,0.000128899,0.0000031527143,0.00021621179,0.0010211775,0.0068646134,0.0052036927,0.00411957,0.000630634,0.981517],"study_design_scores_gemma":[0.00079998455,0.00021597692,0.0000732737,0.0013463509,0.0000069069497,0.00005787529,0.0000033961392,0.9192451,0.023547348,0.053712323,0.0004903214,0.00050112884],"about_ca_topic_score_codex":0.000014898062,"about_ca_topic_score_gemma":0.00008802585,"teacher_disagreement_score":0.9810159,"about_ca_system_score_codex":0.0011864107,"about_ca_system_score_gemma":0.0019361114,"threshold_uncertainty_score":0.99986243},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006619914,0.00021678806,0.98879766,0.0004616471,0.0011413973,0.0006301098,0.000009691791,0.000107924345,0.008568601],"genre_scores_gemma":[0.055598028,0.0000071317518,0.93388844,0.0015201509,0.00030906068,0.00004158973,0.0000065695453,0.00002560569,0.008603432],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956681,0.00017326121,0.00094449596,0.001548207,0.001237077,0.0004288652],"domain_scores_gemma":[0.99368584,0.003504639,0.00075779925,0.0012333503,0.000674997,0.00014336852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0057460824,0.00041861358,0.0006660148,0.00084472453,0.0005535241,0.000613093,0.0015784979,0.00027555274,0.00014906142],"category_scores_gemma":[0.0013259967,0.00029395448,0.00013373393,0.0010861957,0.0009453296,0.00036289822,0.00042931034,0.00074649055,0.00008696242],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026115107,0.000033017237,0.000040113737,0.000007295867,0.000013951857,0.000006018904,0.00026076427,0.016161026,0.00026992403,0.021862272,0.000044123484,0.9612754],"study_design_scores_gemma":[0.00083203457,0.00021963399,0.00042419296,0.00044548867,0.000065111235,0.00007348989,0.000010357008,0.31332546,0.0035064523,0.63758254,0.042582195,0.0009330364],"about_ca_topic_score_codex":0.000009417998,"about_ca_topic_score_gemma":0.000036149788,"teacher_disagreement_score":0.96034235,"about_ca_system_score_codex":0.0001540674,"about_ca_system_score_gemma":0.00040548804,"threshold_uncertainty_score":0.99995124},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013915448,0.0012339087,0.98749596,0.00095190475,0.0045952043,0.00059529167,0.000004278882,0.00042792616,0.0045563993],"genre_scores_gemma":[0.085235715,0.00008496169,0.9089588,0.0029397227,0.00088426407,0.000013609929,0.000011187736,0.000053931548,0.0018177981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939629,0.00015302633,0.0007959138,0.0027381945,0.0012430619,0.0011069408],"domain_scores_gemma":[0.99477655,0.0020439213,0.00033492953,0.0021231333,0.00044104183,0.00028040766],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018890518,0.00077999034,0.0009580795,0.0012849197,0.0004984603,0.0012346073,0.0053701964,0.000484146,0.000004187881],"category_scores_gemma":[0.00035114432,0.000766181,0.00014811766,0.0026625372,0.0011003698,0.00059272855,0.0071408045,0.0014500989,0.000013888844],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025057716,0.000097265205,0.00037630973,0.00020373278,0.000015728674,0.0001376409,0.00078614475,0.01402427,0.0000107089845,0.030486474,0.00029706658,0.95356214],"study_design_scores_gemma":[0.00029895533,0.00012870195,0.00053107244,0.0003191491,0.000007572431,0.00006760796,1.5319426e-7,0.65902615,0.000117044045,0.3375429,0.0013363194,0.0006244201],"about_ca_topic_score_codex":0.000034690107,"about_ca_topic_score_gemma":0.00003087255,"teacher_disagreement_score":0.9529377,"about_ca_system_score_codex":0.0009463822,"about_ca_system_score_gemma":0.0023774966,"threshold_uncertainty_score":0.99980223},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008605906,0.00067493564,0.9916371,0.0007183696,0.0010705487,0.00034249036,0.0000025668824,0.0005650639,0.004980315],"genre_scores_gemma":[0.005057804,0.00009791417,0.99175155,0.0014747275,0.0002088912,0.000010375137,0.000012247491,0.000016458713,0.001370039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967693,0.00008282464,0.00048420706,0.0014409486,0.00063807954,0.0005846476],"domain_scores_gemma":[0.9979836,0.0005619428,0.00023618301,0.000796427,0.0002785118,0.0001433526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000968374,0.00043504307,0.00049245113,0.0011650927,0.00031235834,0.00076174433,0.0021675632,0.00030805107,0.0000018772588],"category_scores_gemma":[0.00010717659,0.00042518892,0.000074171025,0.0013569533,0.00045205344,0.00047040652,0.0016997631,0.0006416184,0.000006890344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000155948,0.00002372751,0.00002790298,0.000055115062,0.00000728647,0.000023724391,0.00032913624,0.09002026,0.000005506154,0.003629468,0.00085525325,0.9050211],"study_design_scores_gemma":[0.00017903477,0.00007699314,0.00007537842,0.00033106108,0.000004511094,0.000030108245,4.845267e-8,0.884597,0.00023805625,0.11305084,0.0010179011,0.00039904247],"about_ca_topic_score_codex":0.000017063592,"about_ca_topic_score_gemma":0.000008293607,"teacher_disagreement_score":0.904622,"about_ca_system_score_codex":0.00035369265,"about_ca_system_score_gemma":0.0012443672,"threshold_uncertainty_score":0.99982},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011441947,0.000413595,0.99164045,0.0018815191,0.0023866494,0.00083271373,0.00007585854,0.00020970253,0.0025480967],"genre_scores_gemma":[0.015069582,0.00024554346,0.97733784,0.0031494123,0.0012100667,0.000085545675,0.00007818203,0.000058690093,0.0027651303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602085,0.00003919557,0.00057966256,0.0016778418,0.0009381764,0.0007442481],"domain_scores_gemma":[0.99529266,0.0018049662,0.00033835572,0.0019367703,0.00047894305,0.00014831193],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00057208666,0.000588434,0.0005644033,0.0005545207,0.00077001675,0.0012956919,0.006449149,0.00031905042,0.000007995577],"category_scores_gemma":[0.00027056498,0.00038440348,0.00018988822,0.0009222868,0.00066815864,0.00076647836,0.0027264664,0.0007786036,0.000011035168],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027558315,0.000051179137,0.000037732683,0.00010886143,0.000032592263,0.00003443604,0.0003348856,0.0027022946,0.00008002116,0.16931407,0.002979297,0.8242971],"study_design_scores_gemma":[0.00064408424,0.00021068935,0.00017644402,0.0008233749,0.00002345897,0.000035172194,2.1469702e-7,0.51092637,0.0018707588,0.44308,0.041342743,0.0008666765],"about_ca_topic_score_codex":0.00007502699,"about_ca_topic_score_gemma":0.00003289175,"teacher_disagreement_score":0.8234304,"about_ca_system_score_codex":0.00020100176,"about_ca_system_score_gemma":0.0007284765,"threshold_uncertainty_score":0.99986076},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022499668,0.00010353469,0.9928939,0.0006552378,0.0013669308,0.0006404097,0.000016425742,0.00017849827,0.003920077],"genre_scores_gemma":[0.13273922,0.000011590158,0.8639279,0.0014357205,0.00061575905,0.000023609544,0.000042817504,0.000027214814,0.0011761718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970369,0.000024133436,0.0005223297,0.0011900946,0.00063128566,0.0005952609],"domain_scores_gemma":[0.997256,0.0010587181,0.00027733523,0.0007045408,0.0005671651,0.00013626352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007279747,0.00042626951,0.00043321945,0.0006591936,0.00067433016,0.0006135528,0.0012508066,0.00019394729,0.000014008196],"category_scores_gemma":[0.00012626806,0.0003981333,0.00012423414,0.0009372569,0.0002802555,0.000605982,0.00053708936,0.00048798978,0.00001369755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015750044,0.000037450554,0.000048728136,0.00010320978,0.000028971854,0.000017659735,0.00052936387,0.32027656,0.00007173735,0.081561096,0.00010735968,0.5972021],"study_design_scores_gemma":[0.0004276429,0.00013261147,0.00003772898,0.00073577784,0.000015994721,0.000064632724,5.40922e-7,0.94607943,0.0021003957,0.046291705,0.0035642434,0.00054927886],"about_ca_topic_score_codex":0.000014199738,"about_ca_topic_score_gemma":0.000081385915,"teacher_disagreement_score":0.6258029,"about_ca_system_score_codex":0.00024366993,"about_ca_system_score_gemma":0.0012518967,"threshold_uncertainty_score":0.99984705},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006306751,0.00016417707,0.990776,0.00008284982,0.0017973582,0.0008050864,0.000022396842,0.00022533216,0.0061204825],"genre_scores_gemma":[0.02575883,0.00011631072,0.97175187,0.00035180457,0.00062253117,0.00007211396,0.00013540965,0.00009789877,0.001093235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840087,0.0000059766326,0.00036690492,0.00053215586,0.0003197275,0.00037434007],"domain_scores_gemma":[0.99921125,0.0001334237,0.000089444904,0.00035217445,0.00015359126,0.000060130886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037730817,0.00032973412,0.00030944296,0.00051637297,0.000135789,0.00025780027,0.00048321186,0.00026820725,0.000020413072],"category_scores_gemma":[0.000025119722,0.00033395688,0.000087179316,0.00027708744,0.00013916583,0.00020072958,0.000111648995,0.00036836494,0.0000066819202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016115484,0.0000045645697,0.0000031871737,0.00031127463,0.000012141381,0.0000012959609,0.0002964224,0.81254023,0.000112513524,0.0013447356,0.000047408237,0.1853246],"study_design_scores_gemma":[0.00023995725,0.000037771617,0.0000028369282,0.0006158672,0.000010945548,0.0000032216142,9.447435e-8,0.9741795,0.0010970449,0.01999385,0.003466708,0.00035219718],"about_ca_topic_score_codex":0.000004725556,"about_ca_topic_score_gemma":0.0000230479,"teacher_disagreement_score":0.18497239,"about_ca_system_score_codex":0.00020803517,"about_ca_system_score_gemma":0.00014277104,"threshold_uncertainty_score":0.99991125},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041435094,0.00020938113,0.9978176,0.00016943342,0.00013433253,0.00089072215,0.00006459628,0.0001910891,0.00010851251],"genre_scores_gemma":[0.20333718,0.0000498475,0.7962517,0.00018197017,0.000016436285,0.000039514784,0.00003546277,0.000015235531,0.00007263663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981004,0.000034308563,0.0005701304,0.0007111843,0.00036342238,0.00022056019],"domain_scores_gemma":[0.9983614,0.00029097608,0.00020471502,0.00070877525,0.00037805154,0.000056076107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006117568,0.00028874335,0.00043798678,0.0005008838,0.000093009,0.00018654169,0.0009842712,0.0001393038,0.000001166927],"category_scores_gemma":[0.000048268357,0.00027127,0.00007145012,0.0003383834,0.000249811,0.00080267555,0.0003694769,0.000239497,2.0428658e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001425925,0.000020860627,0.00005156247,0.00019142457,0.000011984175,0.0000014445876,0.0079166535,0.18867652,0.00021316775,0.062218186,0.000009188527,0.74067473],"study_design_scores_gemma":[0.00018832198,0.00009861582,0.000025410141,0.0002738181,0.000006383502,0.0000038323624,1.8386997e-7,0.9240391,0.008970129,0.06608753,0.00008808611,0.00021858988],"about_ca_topic_score_codex":0.000035736783,"about_ca_topic_score_gemma":0.00009249696,"teacher_disagreement_score":0.74045616,"about_ca_system_score_codex":0.00013239274,"about_ca_system_score_gemma":0.00020177642,"threshold_uncertainty_score":0.99997395},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014796785,0.0010728318,0.994319,0.00028201542,0.002190022,0.0011821483,0.000028697497,0.00019538414,0.0005819393],"genre_scores_gemma":[0.15495557,0.00002943975,0.8441572,0.00020941434,0.00021565931,0.000101278965,0.000025991452,0.000032069853,0.0002733733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99454725,0.00013676695,0.0012262365,0.00207676,0.0011332757,0.0008797379],"domain_scores_gemma":[0.9951641,0.0015131852,0.0005599966,0.0019278362,0.0006675643,0.00016731421],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029555904,0.00063948345,0.0013977976,0.002896746,0.0003015155,0.0016633219,0.003111807,0.00065385376,0.000006544192],"category_scores_gemma":[0.00059783674,0.00060253375,0.00039282805,0.0040035024,0.00028416704,0.0006829187,0.0007647371,0.0011041324,0.0000065376853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001511072,0.000023976745,0.00030356273,0.0001531335,0.00014248338,0.000054859374,0.0006047057,0.800895,0.00002989392,0.1571674,0.000008575017,0.040601354],"study_design_scores_gemma":[0.00030501615,0.00006691925,0.000049705293,0.0019734048,0.000063963904,0.000008088643,0.0000010554238,0.8873836,0.00013767637,0.1090649,0.00041898593,0.0005267045],"about_ca_topic_score_codex":0.00019780232,"about_ca_topic_score_gemma":0.0002246666,"teacher_disagreement_score":0.1548076,"about_ca_system_score_codex":0.0010487702,"about_ca_system_score_gemma":0.0012998574,"threshold_uncertainty_score":0.9996426},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008491434,0.00013141736,0.99646187,0.000605188,0.0007295541,0.0009745333,0.000073219766,0.0002960279,0.00064327376],"genre_scores_gemma":[0.34664136,0.000079403995,0.64989626,0.0013650121,0.00031963747,0.00017959748,0.00008748902,0.000042803367,0.0013884156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967232,0.000027632019,0.0005935409,0.0018113549,0.00035485468,0.000489468],"domain_scores_gemma":[0.9967862,0.00037106386,0.00028202683,0.0022249322,0.00025171784,0.000084077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007998127,0.00041008103,0.00046964674,0.0010727977,0.0002099123,0.00041922528,0.004451794,0.0003610141,0.0000054840893],"category_scores_gemma":[0.00010499924,0.00039747733,0.00009348641,0.0009094994,0.00023334358,0.0005706524,0.0016599162,0.0006763244,0.000007152983],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064449805,0.000044894274,0.00006900834,0.000027269656,0.0000063624543,0.000008848929,0.0000644335,0.000414755,0.00016013252,0.006460758,0.00006930161,0.9926678],"study_design_scores_gemma":[0.00047256227,0.0002114715,0.00023940673,0.0003398627,0.000011261514,0.00003386409,4.5861017e-7,0.91001946,0.0057985093,0.06465425,0.017579477,0.0006394049],"about_ca_topic_score_codex":0.00019994484,"about_ca_topic_score_gemma":0.001720998,"teacher_disagreement_score":0.9920284,"about_ca_system_score_codex":0.0003172834,"about_ca_system_score_gemma":0.00044661236,"threshold_uncertainty_score":0.9998477},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003502671,0.00022153923,0.99607253,0.000068247944,0.00015226139,0.00019087543,0.00039080434,0.000030047695,0.0025233997],"genre_scores_gemma":[0.3863703,0.0000147161,0.6095013,0.000059011003,0.00033599293,0.00001371143,0.0012005696,0.000032003492,0.002472377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978013,0.000011052744,0.00052558025,0.00092848873,0.000486232,0.00024733375],"domain_scores_gemma":[0.99764735,0.0003454423,0.00045182434,0.0012159285,0.00029314173,0.000046307374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000417515,0.00029720186,0.00063481246,0.00036384934,0.000106597785,0.000028412049,0.0012383747,0.00030802996,0.00007583603],"category_scores_gemma":[0.00024098864,0.000270684,0.000120388126,0.0004097153,0.0006441966,0.00014340838,0.00048329792,0.0002881048,4.3973725e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013338758,0.0011462816,0.00012100888,0.0058560176,0.0007995815,0.000007961188,0.0006517168,0.476553,0.3847091,0.013771946,0.00036012358,0.11468939],"study_design_scores_gemma":[0.00046595887,0.00006389979,0.000011074863,0.00018818137,0.00016126041,0.0000032251419,6.44547e-7,0.5565022,0.43128014,0.010922381,0.000086899345,0.00031414436],"about_ca_topic_score_codex":0.00010196166,"about_ca_topic_score_gemma":0.000005405428,"teacher_disagreement_score":0.38657123,"about_ca_system_score_codex":0.0001071042,"about_ca_system_score_gemma":0.00053250627,"threshold_uncertainty_score":0.99997455},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006703731,0.00018864413,0.98836946,0.0009618381,0.0020530734,0.00106926,0.000021814181,0.00013093064,0.00050124835],"genre_scores_gemma":[0.748253,0.000008077462,0.24860919,0.0018788243,0.00054108805,0.00006691512,0.000018263481,0.00004481004,0.00057987875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99215025,0.00020784735,0.0015353922,0.0027728195,0.0026294384,0.0007042523],"domain_scores_gemma":[0.9948493,0.0013576015,0.00048237923,0.0022831575,0.0007430623,0.0002844765],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004043723,0.0006886963,0.000988984,0.0045625316,0.0002565495,0.0014270379,0.0038085147,0.0006134702,0.00009567057],"category_scores_gemma":[0.0020192657,0.00056902,0.00017812033,0.0029703102,0.00034676213,0.00076845,0.00097012584,0.0010858164,0.00008592055],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072450304,0.00003330626,0.00009547893,0.00000772683,0.0000029877717,0.000019540988,0.00057322416,0.05798591,0.0069010593,0.0013549878,0.00004830539,0.932905],"study_design_scores_gemma":[0.0008097439,0.00024474398,0.002157396,0.00043035625,0.0000100487005,0.00001670442,0.0000029315302,0.840843,0.0069675334,0.13050517,0.017024765,0.0009875911],"about_ca_topic_score_codex":0.00028458817,"about_ca_topic_score_gemma":0.008222976,"teacher_disagreement_score":0.9319174,"about_ca_system_score_codex":0.000645903,"about_ca_system_score_gemma":0.0004029857,"threshold_uncertainty_score":0.9996761},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003280512,0.00025110762,0.9924333,0.00046743665,0.0017261073,0.0016383326,0.0000021195992,0.00020621996,0.0032721055],"genre_scores_gemma":[0.0357178,0.00025907584,0.91173524,0.0026226481,0.00038630769,0.00017464085,0.00007059032,0.00008637872,0.048947297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950135,0.00006317047,0.0009097791,0.001843709,0.0012095596,0.00096029666],"domain_scores_gemma":[0.9968978,0.0006828245,0.0005218316,0.0014284849,0.00026601847,0.00020305077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011223338,0.00078464084,0.00070058554,0.00087750994,0.000644339,0.00058269425,0.0031161404,0.00034409223,0.0000592925],"category_scores_gemma":[0.00023561707,0.00075561425,0.00022726793,0.00038461684,0.0005436214,0.00049240474,0.0023021724,0.0011090834,0.0000731837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008853331,0.00001932011,0.0000073853935,0.000062071565,0.00003808419,0.000016572743,0.00061089004,0.8789341,0.000096842414,0.0041321013,0.00005510189,0.116018675],"study_design_scores_gemma":[0.0008666466,0.00046929,0.000011969393,0.00045134063,0.000022652506,0.000007237004,8.1288937e-7,0.98397195,0.002386098,0.0009486482,0.010126005,0.0007373194],"about_ca_topic_score_codex":0.000011654377,"about_ca_topic_score_gemma":0.000005483226,"teacher_disagreement_score":0.11528136,"about_ca_system_score_codex":0.0011540274,"about_ca_system_score_gemma":0.0006868585,"threshold_uncertainty_score":0.9994895},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030206966,0.00012631902,0.99329364,0.0006353533,0.00042473953,0.0003423832,0.000008711961,0.00023126895,0.0019168791],"genre_scores_gemma":[0.59325606,0.00009238294,0.40448385,0.0018203752,0.00007991048,0.000015580534,0.000007789127,0.000023226745,0.00022085187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967722,0.000024492792,0.0003883897,0.0015828873,0.00066400727,0.0005679856],"domain_scores_gemma":[0.9978089,0.00041686388,0.00017316345,0.0013818335,0.00012275462,0.00009650605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006032408,0.00050418294,0.00049924804,0.0012146415,0.00017270587,0.0005120742,0.002632205,0.0002618089,0.000004637165],"category_scores_gemma":[0.00006513303,0.0004174437,0.000030830448,0.0007424464,0.00053011935,0.0007190509,0.0013941732,0.0010183033,0.0000068053896],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001900304,0.00003347007,0.00058861764,0.00009822498,0.0000067498954,0.00013998176,0.00037542486,0.0063827713,0.000023174905,0.024351127,0.00005529925,0.96792614],"study_design_scores_gemma":[0.0006941161,0.0011095655,0.0021867687,0.0070097186,0.00000984531,0.000093414084,1.2698953e-7,0.8595664,0.0048051286,0.12287492,0.0003912,0.001258782],"about_ca_topic_score_codex":0.00008821246,"about_ca_topic_score_gemma":0.000137137,"teacher_disagreement_score":0.96666735,"about_ca_system_score_codex":0.00020982676,"about_ca_system_score_gemma":0.0004674678,"threshold_uncertainty_score":0.99982774},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020376335,0.0006269648,0.9963234,0.0008995146,0.0007757971,0.00039608043,0.00000836595,0.00014768096,0.0008201734],"genre_scores_gemma":[0.0009358773,0.00021945343,0.99590373,0.000638481,0.00020836506,0.000017137667,0.00004400048,0.000016245023,0.0020167069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813336,0.00002363663,0.00022039854,0.0009702386,0.00033719858,0.00031515013],"domain_scores_gemma":[0.998983,0.0002979259,0.00015914164,0.0002384342,0.00024501022,0.00007644896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003998681,0.00029543176,0.00028648082,0.0006038365,0.0003817998,0.00042895123,0.00059756567,0.0003053475,0.000007921584],"category_scores_gemma":[0.00009959909,0.0002698221,0.00006309332,0.000400022,0.00012925475,0.00045468763,0.00041145796,0.00055782765,0.000002282547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006240371,0.000008711891,0.000024195944,0.0000453864,0.000006313302,0.0000028335855,0.00011970394,0.17193778,0.00007953638,0.0016928074,0.00007483297,0.82600164],"study_design_scores_gemma":[0.0002469177,0.0001288349,0.0000068187696,0.0002770118,0.000007778423,0.000019151008,7.646631e-8,0.9757885,0.00095118507,0.01812468,0.004164578,0.00028451814],"about_ca_topic_score_codex":0.00000999397,"about_ca_topic_score_gemma":0.000015955717,"teacher_disagreement_score":0.82571715,"about_ca_system_score_codex":0.000102720514,"about_ca_system_score_gemma":0.00018639457,"threshold_uncertainty_score":0.9999754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007953325,0.00062382483,0.9872154,0.00025181164,0.0004970748,0.00039015236,0.000026742842,0.00004211127,0.002999586],"genre_scores_gemma":[0.5951922,0.000056421584,0.40393525,0.00028781043,0.00022237615,0.000014639489,0.000010180501,0.000042354084,0.00023877468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976009,0.0000075109606,0.0007342177,0.0010702015,0.00006362375,0.00052353175],"domain_scores_gemma":[0.99889165,0.00024039949,0.00037280322,0.00036901026,0.000043821023,0.00008229675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010115716,0.00035913935,0.000686202,0.00032702577,0.0001822628,0.0002634836,0.00047009642,0.00022619411,0.000017109554],"category_scores_gemma":[0.00006278332,0.000376207,0.00005350632,0.00034309938,0.00035517916,0.0002997607,0.0003115931,0.0008922637,0.0000038673647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009830383,0.000019542369,0.009588929,0.00010256228,0.000025085268,0.000035103785,0.0020679568,0.0070254314,0.0000014260918,0.1000888,5.3270554e-7,0.8810348],"study_design_scores_gemma":[0.0006034381,0.0001223825,0.00041458666,0.0014097061,0.0000055500464,0.000026125965,0.0000044029234,0.9039272,0.000033318596,0.092115276,0.0006408068,0.0006971766],"about_ca_topic_score_codex":0.0002970308,"about_ca_topic_score_gemma":0.00024029423,"teacher_disagreement_score":0.8969018,"about_ca_system_score_codex":0.00025929004,"about_ca_system_score_gemma":0.000121401106,"threshold_uncertainty_score":0.999869},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003382605,0.0001393789,0.99654347,0.00059604505,0.0014788402,0.0005136142,0.000021206706,0.000054982327,0.00031418484],"genre_scores_gemma":[0.17825313,0.000031500014,0.8205492,0.00019848623,0.00023761501,0.000015378237,0.00020770343,0.000023680992,0.0004833403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964435,0.000059021495,0.0006981113,0.0016752604,0.0006870489,0.00043702676],"domain_scores_gemma":[0.9972458,0.00042636457,0.00038532124,0.0017352825,0.00013661639,0.00007061558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018829227,0.0003464589,0.00040923746,0.0012729712,0.00035274125,0.0006480269,0.0025292851,0.00022312635,0.0000064273772],"category_scores_gemma":[0.0001135857,0.000350852,0.00010888352,0.0008480125,0.00012067583,0.0011275959,0.0016371721,0.00046772146,0.0000061037426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027601785,0.00019613316,0.002467159,0.00025632986,0.00013218756,0.000037461068,0.0010656504,0.22850768,0.011314987,0.42753136,0.00015322257,0.3283102],"study_design_scores_gemma":[0.0002683614,0.000025014246,0.00039669595,0.0005300604,0.000025653086,0.0000041238764,0.0000013840216,0.9664727,0.00021584904,0.031431664,0.00028712818,0.00034135717],"about_ca_topic_score_codex":0.000025477622,"about_ca_topic_score_gemma":0.00020982992,"teacher_disagreement_score":0.73796505,"about_ca_system_score_codex":0.00044677986,"about_ca_system_score_gemma":0.0004931946,"threshold_uncertainty_score":0.9998943},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003457608,0.0020843935,0.98886263,0.0008708822,0.0029008328,0.00052782975,0.000041936666,0.00016210649,0.0010917651],"genre_scores_gemma":[0.8983807,0.00004813477,0.08944795,0.0013917959,0.005085882,0.000011017212,0.00008299327,0.000050788643,0.005500761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998249,0.000009792444,0.00030847875,0.00074714405,0.00033559595,0.0003499829],"domain_scores_gemma":[0.9984273,0.0004091249,0.00010639623,0.0005380589,0.00031323658,0.00020593365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033139263,0.00027729533,0.0004395996,0.00049830147,0.00025487057,0.00009072863,0.00024237018,0.00015409566,0.000010553932],"category_scores_gemma":[0.00021252975,0.00024324928,0.00017032833,0.00037092264,0.00026263538,0.000057236444,0.00017795785,0.00039472207,0.0000040706955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007640934,0.00009387413,0.04390867,0.0010474764,0.00019159103,0.001440989,0.00034561346,0.009869583,0.00008230176,0.0004747508,0.001424734,0.94104403],"study_design_scores_gemma":[0.0005716303,0.00032004234,0.00071513705,0.0025953187,0.0004274533,0.00008916429,4.4698984e-7,0.9855857,0.00030934432,0.003663736,0.0053133788,0.00040866883],"about_ca_topic_score_codex":0.000006841623,"about_ca_topic_score_gemma":0.000004786403,"teacher_disagreement_score":0.9757161,"about_ca_system_score_codex":0.00017450684,"about_ca_system_score_gemma":0.00042850187,"threshold_uncertainty_score":0.99194175},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090330675,0.022964373,0.23696007,0.0036262583,0.025696289,0.0069800653,0.00012763323,0.0006684036,0.6126462],"genre_scores_gemma":[0.8905304,0.00013775563,0.0926881,0.010006003,0.001283328,0.000092966235,0.000030881103,0.000082326726,0.00514825],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588567,0.00009246917,0.0006874128,0.0019503341,0.0004952624,0.00088882394],"domain_scores_gemma":[0.99791974,0.0007745219,0.00023360153,0.00080012996,0.00007892168,0.00019308543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010741538,0.0005152987,0.00064003054,0.0008775023,0.00022891992,0.00010866878,0.00082694914,0.0006837853,0.00017745793],"category_scores_gemma":[0.00021009549,0.00048539104,0.00007604936,0.00042237947,0.00087923853,0.000059752354,0.00063977996,0.0016756532,0.000051139403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039174713,0.00030213286,0.009737233,0.0006381849,0.00003317163,0.0016605054,0.006136582,0.00032719388,0.00012829331,0.068317145,0.00050101196,0.9118268],"study_design_scores_gemma":[0.011296088,0.0029697916,0.062963374,0.016498154,0.00014060934,0.003906066,0.000039894832,0.023865791,0.0007441261,0.85965693,0.0110208485,0.0068983017],"about_ca_topic_score_codex":0.000091183196,"about_ca_topic_score_gemma":0.00044743842,"teacher_disagreement_score":0.9049285,"about_ca_system_score_codex":0.00045266974,"about_ca_system_score_gemma":0.00011337622,"threshold_uncertainty_score":0.9997598},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000102822105,0.0007365422,0.9925279,0.0029811906,0.0021061914,0.00075477845,0.000082722596,0.00010066126,0.00069972174],"genre_scores_gemma":[0.009980354,0.0000631455,0.98514336,0.004182357,0.0005133396,0.00003729321,0.000030580653,0.0000147644205,0.00003481557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971964,0.000034334735,0.00041431087,0.001178956,0.00062139565,0.00055463787],"domain_scores_gemma":[0.9965259,0.0013165853,0.00023479463,0.0016392043,0.00019536901,0.000088169836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009795635,0.00037725904,0.0003219712,0.00054075994,0.0005340317,0.0007938474,0.0040694256,0.00028070077,0.000022279004],"category_scores_gemma":[0.000098856835,0.0002884284,0.00020714224,0.00076734164,0.00045949648,0.0004951348,0.0012320183,0.0006901562,0.0000069631506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030995175,0.000009271496,0.000052019164,0.000021808872,0.000009850944,0.000002541944,0.00051354774,0.000077515724,0.000005155196,0.5910285,0.000269431,0.40800723],"study_design_scores_gemma":[0.0001792247,0.00010825663,0.00017463807,0.00017052895,0.000017110773,0.000008394129,7.776434e-7,0.026613183,0.00049228646,0.9508869,0.020972926,0.0003757465],"about_ca_topic_score_codex":0.00005973231,"about_ca_topic_score_gemma":0.00024282461,"teacher_disagreement_score":0.4076315,"about_ca_system_score_codex":0.0001229443,"about_ca_system_score_gemma":0.00048564296,"threshold_uncertainty_score":0.9999568},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00567133,0.0010180656,0.9869643,0.000088077286,0.0003336995,0.00020258523,0.00012878218,0.000062473104,0.005530703],"genre_scores_gemma":[0.611719,0.000168499,0.38722116,0.00019156767,0.00032331384,0.0000011916369,0.00012489487,0.00001629248,0.00023404771],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978507,0.000022535069,0.0005111692,0.0010301685,0.0003029599,0.00028246854],"domain_scores_gemma":[0.99838865,0.00023239062,0.00041229255,0.0006969502,0.00021794678,0.00005177168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004184755,0.00032420774,0.00039326434,0.00031616434,0.000109739296,0.000058234284,0.00066947157,0.0003631785,5.966392e-7],"category_scores_gemma":[0.0004291962,0.0002799645,0.0001256805,0.00033859327,0.00044113753,0.000008451503,0.0005720176,0.00028256464,6.363909e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000797937,0.000026105776,0.00024049345,0.00003767968,0.00004317038,0.000018356097,0.00004614025,0.0012014208,0.24610996,0.00006350551,0.000049267896,0.7520841],"study_design_scores_gemma":[0.0007200361,0.00077733427,0.00029141945,0.0025162052,0.0001278473,0.000025013496,0.0000017521305,0.036033757,0.93906826,0.017410707,0.001727211,0.0013004821],"about_ca_topic_score_codex":0.00010402218,"about_ca_topic_score_gemma":0.00022650913,"teacher_disagreement_score":0.7507836,"about_ca_system_score_codex":0.000049891652,"about_ca_system_score_gemma":0.00013425076,"threshold_uncertainty_score":0.99996525},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012682204,0.00060805754,0.9928293,0.00038078823,0.0015977075,0.00034419342,0.0000087377375,0.00023923533,0.0027237409],"genre_scores_gemma":[0.34626547,0.000017173052,0.6507916,0.0018286372,0.00016038165,0.0000071723375,0.000010112471,0.000052908727,0.00086656446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995597,0.000042192998,0.0006234871,0.0018207008,0.001071189,0.0008454485],"domain_scores_gemma":[0.9969854,0.0004897035,0.00041438633,0.0015311104,0.00039774814,0.00018169892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001189898,0.0006322814,0.00067832525,0.0010523259,0.0005174716,0.0008975658,0.0027253067,0.00029751053,0.000009880933],"category_scores_gemma":[0.00009947365,0.000517783,0.00012010285,0.0011100854,0.0007621588,0.00053357624,0.0013191989,0.0007569108,0.000013635935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057080786,0.00015964963,0.0037864055,0.0004219297,0.00012854296,0.0006747218,0.0010093222,0.1886749,0.0024989187,0.19104366,0.0002729345,0.6112719],"study_design_scores_gemma":[0.0006237654,0.00020329439,0.00027376506,0.0023501683,0.000038962065,0.00016375136,1.8586327e-7,0.83279157,0.0020186512,0.1589178,0.0012369492,0.0013811283],"about_ca_topic_score_codex":0.00014763576,"about_ca_topic_score_gemma":0.0001896466,"teacher_disagreement_score":0.6441167,"about_ca_system_score_codex":0.00024023913,"about_ca_system_score_gemma":0.0011516933,"threshold_uncertainty_score":0.99972737},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000336713,0.0011246887,0.9940072,0.0018382269,0.0014180543,0.0004507845,0.000002547689,0.00017827647,0.0006435118],"genre_scores_gemma":[0.507338,0.00022425022,0.4857046,0.0052823084,0.0011066884,0.0000828684,0.0000035029902,0.000064217274,0.00019355703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958858,0.000049845505,0.0005893593,0.0016695762,0.0010674165,0.0007380257],"domain_scores_gemma":[0.99773574,0.0006001163,0.0002472183,0.0010957393,0.0001389621,0.00018225265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055826176,0.0004860401,0.0004739894,0.0012557431,0.0002808273,0.00023424161,0.0029825822,0.00027219838,0.000018512528],"category_scores_gemma":[0.0001373085,0.00047172344,0.0001028117,0.0014990178,0.0005832033,0.0003144535,0.001535691,0.0013995095,0.000005541397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002906082,0.0000115574885,0.00009769106,0.000017894039,0.0000029572527,0.000050131628,0.0001160272,0.179832,0.00023610562,0.002279616,0.0000025967695,0.8173505],"study_design_scores_gemma":[0.00017134714,0.000014303243,0.00017328364,0.0005796001,0.0000047983744,0.00006681054,7.153504e-8,0.8734667,0.0016397203,0.122965485,0.00050989486,0.00040798917],"about_ca_topic_score_codex":0.00015208391,"about_ca_topic_score_gemma":0.0018123949,"teacher_disagreement_score":0.8169425,"about_ca_system_score_codex":0.00069883245,"about_ca_system_score_gemma":0.00087669794,"threshold_uncertainty_score":0.99977344},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053973028,0.00017066112,0.99166256,0.003018349,0.000318548,0.0010834767,0.000036657268,0.00007541888,0.0035803649],"genre_scores_gemma":[0.17461032,0.000067796864,0.822039,0.0017092971,0.00030217684,0.000065366534,0.000063537365,0.000035449357,0.0011070337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739456,0.000023187382,0.00037461118,0.0012574738,0.0005366205,0.00041354107],"domain_scores_gemma":[0.9977639,0.00030378054,0.00023299156,0.0010065732,0.0005883288,0.00010447839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054654235,0.0003319332,0.0003711171,0.0007589919,0.0002058262,0.00050633604,0.0014644251,0.00020306924,0.0000038403386],"category_scores_gemma":[0.00020540303,0.0002958484,0.00005513677,0.0012811465,0.0002834963,0.0007633705,0.00033642616,0.0003654972,0.000005659424],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066176035,0.00007268805,0.000042081527,0.00007959767,0.000017117765,0.000016839938,0.0036851203,0.024760522,0.00011883356,0.25186107,0.00017711424,0.71910286],"study_design_scores_gemma":[0.0006162931,0.00047823295,0.00055501907,0.00070778636,0.000011677422,0.000012309166,0.0000026919608,0.6883031,0.0007192498,0.3017948,0.006158555,0.0006402585],"about_ca_topic_score_codex":0.00020762303,"about_ca_topic_score_gemma":0.0020238329,"teacher_disagreement_score":0.7184626,"about_ca_system_score_codex":0.0011720927,"about_ca_system_score_gemma":0.0012824653,"threshold_uncertainty_score":0.99994934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017733494,0.00045658989,0.98369616,0.006049239,0.00046430112,0.0005242107,0.000011613324,0.0013957975,0.00722477],"genre_scores_gemma":[0.075725466,0.00006331972,0.9218843,0.000874482,0.00009852653,0.000016715147,0.000032366195,0.000050546845,0.0012542851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947376,0.00006227316,0.00055425667,0.0024500836,0.0012724703,0.0009233092],"domain_scores_gemma":[0.9915881,0.00053753995,0.00029553915,0.0071136714,0.00031590162,0.00014926132],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0008880836,0.0007743128,0.0006988283,0.0013266464,0.00053585484,0.0011829856,0.030234955,0.0006300861,0.0000171248],"category_scores_gemma":[0.0026580812,0.0006309789,0.00010380395,0.0014660545,0.00074921706,0.0011310707,0.050064962,0.0019941973,0.000021280743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043037493,0.00007834695,0.00006265965,0.00018080587,0.000057869587,0.0004565802,0.00095936004,0.07346782,0.00145712,0.009240437,0.0022442406,0.91175175],"study_design_scores_gemma":[0.0003683772,0.00022721793,0.000011612699,0.00087047066,0.000009516281,0.000029143353,3.8712267e-7,0.87811804,0.0035228496,0.11588793,0.00028789203,0.00066653796],"about_ca_topic_score_codex":0.000020597256,"about_ca_topic_score_gemma":0.00007229447,"teacher_disagreement_score":0.9110852,"about_ca_system_score_codex":0.00042181087,"about_ca_system_score_gemma":0.0009961361,"threshold_uncertainty_score":0.9998539},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008747386,0.00025398305,0.9811348,0.00005716689,0.0012545323,0.00080858887,0.000021917534,0.00032104691,0.016060516],"genre_scores_gemma":[0.099520676,0.000018633387,0.89717275,0.00034724595,0.001105687,0.00021298818,0.00009924538,0.00008195246,0.0014408417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998101,0.000010359085,0.00044892458,0.00069541286,0.00034153907,0.00040275612],"domain_scores_gemma":[0.999074,0.00016100136,0.00010400257,0.00040964904,0.00019781753,0.00005352422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003752269,0.00040036175,0.00037265584,0.00067125494,0.0002389679,0.00024222846,0.0005700541,0.0003649349,0.000010756835],"category_scores_gemma":[0.00006766687,0.00037328032,0.00013026936,0.00033509822,0.0002528667,0.00019802338,0.00011843901,0.0007033288,0.0000014699241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002232526,0.000017358041,0.000036322446,0.00039818522,0.00006134168,0.0000033515225,0.0005597829,0.534375,0.0002033106,0.020994646,0.00015598228,0.44317237],"study_design_scores_gemma":[0.00032839717,0.00006691443,0.0000040025016,0.00054381497,0.000025556783,0.000022061507,0.0000010689871,0.98068684,0.0005590857,0.016273921,0.0011341142,0.00035420715],"about_ca_topic_score_codex":0.0000087061135,"about_ca_topic_score_gemma":0.00002118098,"teacher_disagreement_score":0.44631183,"about_ca_system_score_codex":0.00028578553,"about_ca_system_score_gemma":0.0002443226,"threshold_uncertainty_score":0.9998719},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020829657,0.0001328651,0.9772374,0.00006877588,0.00024667569,0.00049414596,0.000007610473,0.000020986521,0.0009619083],"genre_scores_gemma":[0.35361296,0.00002001825,0.6436355,0.0006939043,0.00053216756,0.000010613558,0.000101423815,0.000037746428,0.0013556458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998276,0.000023279625,0.00036061337,0.00066874054,0.00036644685,0.0003049338],"domain_scores_gemma":[0.99891543,0.000020515505,0.00020880126,0.0006194275,0.00017707687,0.000058744463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038442775,0.00031796144,0.00022345464,0.00021957049,0.0002178434,0.00015127085,0.00058822636,0.00034307907,0.000003985755],"category_scores_gemma":[0.00024587274,0.00029853208,0.00006468601,0.00013284446,0.00032421944,0.000014027587,0.00059310236,0.0004036598,0.0000020921204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064577257,0.000009134437,0.000026887112,0.00009531129,0.0000049135365,0.0000030180797,0.00008164339,0.74305207,0.20811133,0.00082054065,0.000006896097,0.0477818],"study_design_scores_gemma":[0.0001041182,0.00006935945,0.000003001366,0.00032459878,0.000009091762,0.000017269002,5.533024e-8,0.9792505,0.014965094,0.004780445,0.00016421171,0.00031224496],"about_ca_topic_score_codex":0.000012658186,"about_ca_topic_score_gemma":0.00004553755,"teacher_disagreement_score":0.33360186,"about_ca_system_score_codex":0.00016653408,"about_ca_system_score_gemma":0.00067203963,"threshold_uncertainty_score":0.99994665},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003019892,0.0039279265,0.9902233,0.00009067448,0.00044502883,0.00017266293,0.000027234833,0.0003226818,0.0017706257],"genre_scores_gemma":[0.47283354,0.00019032123,0.526479,0.00023385017,0.00010653195,0.0000034976276,0.000013861991,0.0000564764,0.00008290353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978667,0.00003205044,0.00047824968,0.00086851313,0.0003200835,0.0004344101],"domain_scores_gemma":[0.998963,0.00025035226,0.00007452167,0.00047123322,0.00013113386,0.0001097478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004068403,0.00047636902,0.0005691115,0.0005811022,0.00025575058,0.00039911407,0.000373912,0.00022069924,0.00003184759],"category_scores_gemma":[0.0000531454,0.000485611,0.00012216759,0.00033816634,0.00035580975,0.0002598619,0.00014166257,0.00055247144,0.0000044152107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042978463,0.000032980053,0.000071548995,0.0006115,0.000054128952,0.00003532902,0.00030382158,0.14817657,0.01227623,0.00004895728,0.000006237032,0.8383784],"study_design_scores_gemma":[0.0002559865,0.000034252487,0.0000028315756,0.0013216045,0.00007047766,0.000029509296,0.0000014589461,0.9951888,0.0022685223,0.0002489749,0.0000883147,0.0004893074],"about_ca_topic_score_codex":0.000035728885,"about_ca_topic_score_gemma":0.000050647002,"teacher_disagreement_score":0.8470122,"about_ca_system_score_codex":0.00024160091,"about_ca_system_score_gemma":0.00013157616,"threshold_uncertainty_score":0.99975955},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014105593,0.00060321286,0.9717009,0.00003459109,0.0090389745,0.0003511864,0.000016845277,0.0006076158,0.017505636],"genre_scores_gemma":[0.8394065,0.0000087189055,0.15731949,0.00008329155,0.002269725,0.000035938374,0.000012619323,0.00014443383,0.00071928895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977332,0.000017886,0.00043541667,0.0006887192,0.00058679935,0.0005380106],"domain_scores_gemma":[0.99849296,0.0003061578,0.00007630841,0.0008837344,0.00013145606,0.00010941351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045612705,0.00047619827,0.0005152664,0.0008381517,0.00013103981,0.00022937932,0.0009790163,0.00031299147,0.000010026085],"category_scores_gemma":[0.000031848358,0.00047958377,0.0001170144,0.0004077598,0.00021144055,0.00015041146,0.00016554256,0.0006726705,0.00007890328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006771435,0.000012474467,0.00031526663,0.0031565153,0.00004459291,0.00021190678,0.00035741122,0.86776656,0.0025567587,0.00096561015,0.00030582314,0.1243003],"study_design_scores_gemma":[0.00026772494,0.000035025296,0.00010200445,0.003749044,0.00001796974,0.000018781377,5.741982e-7,0.9802523,0.012686103,0.00029962766,0.0018222125,0.0007486282],"about_ca_topic_score_codex":0.00002739752,"about_ca_topic_score_gemma":0.000018159364,"teacher_disagreement_score":0.83926547,"about_ca_system_score_codex":0.0009798108,"about_ca_system_score_gemma":0.00028113395,"threshold_uncertainty_score":0.9997656},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007320777,0.0013673974,0.994455,0.000048261663,0.0009853775,0.0004120769,0.0000030115527,0.000103811646,0.0018929812],"genre_scores_gemma":[0.9519815,0.000046846297,0.046891894,0.00010697934,0.00016300732,0.0000103415105,0.0000022742447,0.00002957272,0.00076762337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846447,0.0000058798087,0.00043054242,0.00040334256,0.000384722,0.0003110664],"domain_scores_gemma":[0.99912816,0.00019311644,0.00008603222,0.00037485914,0.00013739517,0.00008044657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025492688,0.00029209003,0.00044341013,0.0007940874,0.000076746684,0.00008518776,0.00061047147,0.0001758189,0.000011923724],"category_scores_gemma":[0.00003197797,0.00027183627,0.00009679385,0.00041223163,0.00015345139,0.00014256654,0.0000860651,0.00023934485,0.0000072309413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060140337,0.000003946419,0.00003642197,0.0004966169,0.00001662962,0.0000016812951,0.0002196354,0.4699922,0.00013447355,0.0016720082,0.00001731397,0.52740306],"study_design_scores_gemma":[0.00024670042,0.00012521847,0.00004661129,0.0008607081,0.00002022079,0.000012864907,3.8286007e-7,0.99378943,0.0019766486,0.0010046557,0.0016377969,0.0002787325],"about_ca_topic_score_codex":0.000019766769,"about_ca_topic_score_gemma":0.00007678702,"teacher_disagreement_score":0.95124936,"about_ca_system_score_codex":0.0002023835,"about_ca_system_score_gemma":0.00025656936,"threshold_uncertainty_score":0.99997336},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006864308,0.00024082176,0.99010867,0.0027044027,0.00050210836,0.00059680734,0.00008005896,0.00035816387,0.005402116],"genre_scores_gemma":[0.2468756,0.00081990234,0.73613876,0.0018815846,0.00048792534,0.00018001003,0.0011362334,0.00008129348,0.012398684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966018,0.000048123587,0.0006895747,0.0012385652,0.00089042494,0.00053148903],"domain_scores_gemma":[0.9975785,0.00022536096,0.00032399473,0.0012787548,0.0004644243,0.00012897281],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006697311,0.00048077758,0.00044048982,0.00049799425,0.00036473162,0.00092290505,0.0024642178,0.00036090118,0.000035587746],"category_scores_gemma":[0.000098684504,0.0004435349,0.00014021067,0.0009353643,0.00048616016,0.0011058303,0.000447327,0.00066221465,0.00004714554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009012607,0.00013029492,0.000010873731,0.00015879761,0.000019574985,0.0000087079325,0.00020976689,0.000084185245,0.012267046,0.26676932,0.0011470045,0.7191854],"study_design_scores_gemma":[0.00028586332,0.00009872018,0.00017699033,0.00036540575,0.000020781294,0.000015826234,2.781046e-7,0.767094,0.089930125,0.13157599,0.009700937,0.00073506305],"about_ca_topic_score_codex":0.000022094533,"about_ca_topic_score_gemma":0.0000070846413,"teacher_disagreement_score":0.76700985,"about_ca_system_score_codex":0.000547149,"about_ca_system_score_gemma":0.0004722144,"threshold_uncertainty_score":0.99980164},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015194295,0.0014017111,0.9804186,0.0005232788,0.00051426166,0.0010894801,0.000092509414,0.00008575153,0.0006801],"genre_scores_gemma":[0.5491503,0.0048446613,0.42687175,0.0024412558,0.004590923,0.0007097256,0.0006839799,0.00023666359,0.010470753],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99685144,0.00002271046,0.00041817848,0.0012913495,0.0005918947,0.00082443125],"domain_scores_gemma":[0.9986186,0.00016949653,0.0001542756,0.0005998991,0.00027992306,0.00017777631],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003359609,0.00043345682,0.00039767328,0.0003002439,0.00019750226,0.00013211963,0.0008655635,0.00057118444,0.000034489614],"category_scores_gemma":[0.0003461297,0.0003898818,0.00016597637,0.0004417931,0.00078351866,0.000010632379,0.000321726,0.0006094655,0.0000021474712],"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.00025091786,0.00003678171,0.00022864481,0.00011284024,0.000028660012,0.000007745568,0.000032694305,0.00023989085,0.98631155,0.0001887939,0.0005007222,0.012060748],"study_design_scores_gemma":[0.0005663086,0.00033784282,0.00006340664,0.0002058271,0.00001535583,0.000015667965,1.895751e-7,0.009448333,0.97474575,0.00979012,0.0043278476,0.00048337987],"about_ca_topic_score_codex":0.00004276008,"about_ca_topic_score_gemma":0.000021175518,"teacher_disagreement_score":0.55354685,"about_ca_system_score_codex":0.0003792972,"about_ca_system_score_gemma":0.0006922781,"threshold_uncertainty_score":0.9998553},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023454788,0.0001974394,0.99712163,0.0008577177,0.0003044649,0.0006267622,0.0000481554,0.00014001093,0.00070146663],"genre_scores_gemma":[0.03672409,0.000083591105,0.9614356,0.0006969483,0.00017244181,0.000019335115,0.00017617202,0.00001643374,0.00067539426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772245,0.000017910685,0.00030754315,0.0012552158,0.0004541325,0.00024274254],"domain_scores_gemma":[0.99775815,0.00040859656,0.00022416226,0.001149959,0.00039181148,0.000067318935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003798968,0.0002566696,0.0002676564,0.00031276952,0.00017763028,0.00045127093,0.0017073544,0.00015783192,0.0000033176698],"category_scores_gemma":[0.00012199832,0.00021280453,0.000026035506,0.00042069124,0.00046847665,0.0007001412,0.00077223976,0.0002402898,6.743828e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008551816,0.0000110903475,0.0000670256,0.000039407114,0.000010107791,0.000006938681,0.00014815177,0.000062528656,0.0002022028,0.18449107,0.00004151574,0.8149114],"study_design_scores_gemma":[0.0006223588,0.00034945243,0.00032602815,0.00057748094,0.00003011034,0.00007397434,7.9962666e-7,0.79975903,0.018404596,0.1740934,0.0049488745,0.00081389246],"about_ca_topic_score_codex":0.000008492556,"about_ca_topic_score_gemma":0.000018368704,"teacher_disagreement_score":0.8140975,"about_ca_system_score_codex":0.00008360284,"about_ca_system_score_gemma":0.00057724176,"threshold_uncertainty_score":0.86779165},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009586011,0.0004884068,0.98530704,0.00010696571,0.0021409446,0.0020434833,0.000015023804,0.00018113488,0.0001309845],"genre_scores_gemma":[0.48245603,0.000009618249,0.5152628,0.00016930631,0.001798958,0.00009404622,0.000008122372,0.00007758693,0.00012353054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751216,0.000009458494,0.00048252108,0.00097477314,0.0003380354,0.0006830418],"domain_scores_gemma":[0.99810284,0.0009441816,0.00013466105,0.00056299736,0.00017304768,0.000082288585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040678846,0.0005308233,0.0005822226,0.00067463523,0.00031749104,0.00046096224,0.00070278754,0.00043440695,0.0000029480257],"category_scores_gemma":[0.00027333212,0.0004942565,0.00013152398,0.00063819863,0.00011387531,0.0002490969,0.00013174723,0.0009463983,4.4340854e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003002337,0.00006122116,0.000099342986,0.00029592018,0.00008978605,0.000120339515,0.0011110586,0.07397196,0.0021010027,0.001587711,0.00014605412,0.9203856],"study_design_scores_gemma":[0.001721063,0.00080406194,0.0001515213,0.0009129435,0.00016025649,0.0005857255,0.0000046660107,0.8691138,0.0059323036,0.11614074,0.0029804362,0.0014924962],"about_ca_topic_score_codex":0.00008154189,"about_ca_topic_score_gemma":0.000339016,"teacher_disagreement_score":0.9188931,"about_ca_system_score_codex":0.00043277262,"about_ca_system_score_gemma":0.00068927894,"threshold_uncertainty_score":0.9997509},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031037878,0.0005723929,0.9844339,0.0072703464,0.0014361949,0.00052857056,0.0000031717939,0.0005394109,0.0052128895],"genre_scores_gemma":[0.0017367891,0.00009829521,0.9822127,0.012682315,0.0004915057,0.00002744539,0.000010698405,0.00003848443,0.0027017465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937025,0.00009578607,0.0006596553,0.0019080242,0.0026932894,0.0009407845],"domain_scores_gemma":[0.9961345,0.000819456,0.00028590809,0.0018348196,0.00048338002,0.00044189382],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017770528,0.0006315645,0.00066337665,0.0010807501,0.00040684425,0.0010647977,0.006894485,0.0007014066,0.00021455239],"category_scores_gemma":[0.00076556636,0.0005807795,0.000161076,0.0010288202,0.0011365758,0.0015802067,0.0042951037,0.0020750486,0.00003711002],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051415027,0.00004457076,0.00002688805,0.00021315936,0.000017299006,0.0009649482,0.00050246506,0.00026169242,0.0005582102,0.0046928306,0.0038049174,0.9889079],"study_design_scores_gemma":[0.00059024733,0.0001927601,0.000035391287,0.0034474349,0.000021364991,0.00035590524,4.3935174e-7,0.7373894,0.047662456,0.20419522,0.00468703,0.0014223551],"about_ca_topic_score_codex":0.000051203013,"about_ca_topic_score_gemma":0.000047287336,"teacher_disagreement_score":0.9874855,"about_ca_system_score_codex":0.0004943138,"about_ca_system_score_gemma":0.0014627597,"threshold_uncertainty_score":0.99997216},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9623688,0.0011475945,0.024894234,0.002619011,0.0017049949,0.0013963716,0.00007171253,0.00020510655,0.0055921716],"genre_scores_gemma":[0.9916897,0.0002257733,0.0049611246,0.0012323568,0.00092445756,0.000032245258,0.00015551456,0.0000029910466,0.0007758806],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99842376,0.000013414957,0.00027955015,0.00066158397,0.0002943372,0.0003273393],"domain_scores_gemma":[0.9995928,0.0001285554,0.00008337861,0.00006758758,0.00006196139,0.00006571482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023679846,0.00025714503,0.00025466696,0.000101498124,0.00017811103,0.00012737668,0.00036222945,0.00019907432,0.00005106737],"category_scores_gemma":[0.000012208065,0.000106952415,0.000037627928,0.00033262765,0.00011514561,0.0001324818,0.00035376524,0.00033851076,0.000015735215],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004048035,0.000014100593,0.0021832262,0.000028730778,0.0000028999798,0.000018510844,0.00022105682,0.00002359491,0.0015448111,0.000010406703,0.000016149317,0.99593246],"study_design_scores_gemma":[0.0018361763,0.0007003314,0.82696015,0.008765678,0.000048446465,0.0002200666,0.000017820623,0.0038220317,0.07055252,0.024297718,0.057564776,0.005214284],"about_ca_topic_score_codex":0.00008193466,"about_ca_topic_score_gemma":0.0027578266,"teacher_disagreement_score":0.9907182,"about_ca_system_score_codex":0.000095513475,"about_ca_system_score_gemma":0.000040093026,"threshold_uncertainty_score":0.4361393},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051639992,0.00017954982,0.9920729,0.0022074648,0.0020821341,0.0017552406,0.000022498407,0.00035647224,0.0012721312],"genre_scores_gemma":[0.027941262,0.000116939445,0.965836,0.0030566803,0.0004596077,0.00024324092,0.000045484765,0.000048948117,0.002251871],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99553233,0.000036048375,0.00071764714,0.002098689,0.0008560295,0.0007592515],"domain_scores_gemma":[0.9966897,0.00061384606,0.0005145723,0.0016165427,0.00041112534,0.00015422494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048551138,0.00061926927,0.000528978,0.00072129554,0.0005318866,0.00044835822,0.0030208766,0.00033728045,0.000009348024],"category_scores_gemma":[0.000071047114,0.0006347528,0.00019962697,0.0010771811,0.00033017978,0.00093741366,0.00094530196,0.000601537,0.00003607535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012818497,0.000034089604,0.0000095737905,0.00007900583,0.000015062844,0.000010692398,0.0002235789,0.017771462,0.0030218123,0.437734,0.00009234469,0.54099554],"study_design_scores_gemma":[0.00044584644,0.00011382502,0.000022765966,0.00028716508,0.00001558121,0.000011329682,3.7915538e-7,0.4733705,0.0040426366,0.5200114,0.0011240942,0.0005544733],"about_ca_topic_score_codex":0.000005062693,"about_ca_topic_score_gemma":0.000057861176,"teacher_disagreement_score":0.5404411,"about_ca_system_score_codex":0.0005499584,"about_ca_system_score_gemma":0.00039129562,"threshold_uncertainty_score":0.99961036},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074160885,0.0001918257,0.9941893,0.0003338572,0.00034669766,0.0007112302,0.000018932316,0.000061500185,0.0034050462],"genre_scores_gemma":[0.92565036,0.000009974444,0.07293909,0.00049519,0.00021688027,0.0000055265737,0.00017118319,0.000024662413,0.00048712434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779195,0.000022253633,0.00045323867,0.0009218926,0.0004607018,0.00034995505],"domain_scores_gemma":[0.9969953,0.0021794848,0.00012791445,0.0005129356,0.000097892465,0.00008651284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095120986,0.00026663046,0.00049419166,0.00055624003,0.00011945619,0.00007635123,0.00042034718,0.00021770273,0.0000418767],"category_scores_gemma":[0.00017086841,0.00023988297,0.00007767291,0.00029584175,0.00010288187,0.00018345476,0.00043757664,0.00048753194,0.000006963826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097251606,0.000017920802,0.00004129003,0.000048942056,0.000012482575,0.00006670963,0.00021443887,0.53801674,0.0000113115,0.00079040887,6.5508414e-7,0.46068186],"study_design_scores_gemma":[0.001383371,0.00007198022,0.00009622545,0.0015489261,0.000021191447,0.000010330766,6.7586706e-7,0.9874362,0.00001339575,0.007983412,0.0012122338,0.00022209088],"about_ca_topic_score_codex":0.000009976049,"about_ca_topic_score_gemma":0.000030204472,"teacher_disagreement_score":0.92490876,"about_ca_system_score_codex":0.00039213288,"about_ca_system_score_gemma":0.00027395552,"threshold_uncertainty_score":0.9782144},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008193137,0.0010288132,0.9944491,0.0016742,0.0014155743,0.00078556506,0.00017365834,0.000032491364,0.00035869813],"genre_scores_gemma":[0.6547789,0.00057526416,0.29222095,0.002666702,0.0009796956,0.0002949367,0.00015634045,0.0000583691,0.04826885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969606,0.00013683656,0.000834377,0.00087358686,0.0009784944,0.00021611394],"domain_scores_gemma":[0.9918629,0.0045182034,0.00065432757,0.00075967103,0.00212997,0.000074930125],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00426487,0.000221588,0.0004181366,0.00047024302,0.0006784794,0.00030836873,0.0013615785,0.0003164311,0.000011675144],"category_scores_gemma":[0.009312689,0.00018339127,0.00005540102,0.0024209907,0.0011450157,0.00031770405,0.00038448005,0.00045088772,0.000009467884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015983756,0.0001383189,0.00057276944,0.0002618939,0.000022246071,0.0000013940062,0.001756792,0.23784186,0.00015027885,0.6626927,0.004394677,0.09215106],"study_design_scores_gemma":[0.00090850616,0.00011382998,0.0013045992,0.0009093732,0.000048608777,0.000029437333,0.000016413936,0.49510083,0.0013671676,0.2857092,0.21375303,0.0007389874],"about_ca_topic_score_codex":0.000019309622,"about_ca_topic_score_gemma":0.00008331202,"teacher_disagreement_score":0.7022281,"about_ca_system_score_codex":0.0002498914,"about_ca_system_score_gemma":0.0029106913,"threshold_uncertainty_score":0.9990323},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026501885,0.00035560867,0.9902134,0.000038040467,0.00022938606,0.00015198003,0.000019967114,0.00007645139,0.0062649576],"genre_scores_gemma":[0.96325666,0.0000775229,0.03621893,0.000110938745,0.00008469841,0.0000043068776,0.000012814392,0.00002030227,0.0002138281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975646,0.00001723869,0.00049497414,0.00076827186,0.00074036256,0.00041453636],"domain_scores_gemma":[0.99825376,0.00035331503,0.00012393051,0.0009677727,0.00021798775,0.00008324131],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004108565,0.0004008177,0.0008742853,0.002029758,0.00010144844,0.00008244348,0.0010767542,0.00025157415,0.00008152977],"category_scores_gemma":[0.000057214842,0.0003277928,0.00021557388,0.0028901838,0.000910115,0.00019582674,0.00015495637,0.00059941784,0.0000027241983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008442649,0.000005441694,0.0005286266,0.00008209261,0.0002225706,0.000011063,0.00015960944,0.9073755,0.0001529767,0.00072911615,0.0000049311293,0.09071963],"study_design_scores_gemma":[0.00011091613,0.0000968912,0.0012592076,0.00034343434,0.0005892801,0.000004336985,7.527073e-7,0.98620206,0.0043346193,0.0063480833,0.00021043814,0.00049995456],"about_ca_topic_score_codex":0.000032561322,"about_ca_topic_score_gemma":0.0003842538,"teacher_disagreement_score":0.96060646,"about_ca_system_score_codex":0.00019787299,"about_ca_system_score_gemma":0.00026964658,"threshold_uncertainty_score":0.9999174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019547755,0.00018437245,0.9319051,0.00044136491,0.0024117457,0.00033885846,0.000008273555,0.0001303027,0.0643845],"genre_scores_gemma":[0.5589023,0.00008120206,0.4304466,0.0059829103,0.0005728811,0.00002413638,0.000015969901,0.00003301715,0.0039409786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995256,0.000046799036,0.0007696369,0.0012397895,0.0018747047,0.00081308454],"domain_scores_gemma":[0.99619186,0.00032960385,0.00043038846,0.001992848,0.00086635945,0.00018897055],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0022613436,0.00042801443,0.0005729119,0.0026165952,0.00036891288,0.00058295525,0.0076593044,0.0002722812,0.00001785615],"category_scores_gemma":[0.00027334216,0.00039678442,0.00014634558,0.0056683226,0.0023909847,0.001827093,0.0031075813,0.0008568549,0.000030773142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008415656,0.00016241809,0.00006936577,0.0003486362,0.000015469182,0.000032962384,0.009429759,0.006996191,0.0002154875,0.49128938,0.0012025565,0.49022937],"study_design_scores_gemma":[0.0004897358,0.00018879812,0.00026500656,0.0007862941,0.000010069684,0.00004302351,8.085031e-7,0.6086587,0.015705355,0.36470667,0.008145658,0.0009999337],"about_ca_topic_score_codex":0.000028952554,"about_ca_topic_score_gemma":0.00003761329,"teacher_disagreement_score":0.60166246,"about_ca_system_score_codex":0.0006302401,"about_ca_system_score_gemma":0.009406141,"threshold_uncertainty_score":0.9998484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002268099,0.0004974458,0.99320596,0.0004157277,0.0030483804,0.0012355541,0.000039934155,0.00035072744,0.0011835652],"genre_scores_gemma":[0.05857864,0.000012289389,0.93917626,0.0006049903,0.00064150046,0.00006406255,0.000066020584,0.00003384902,0.00082238455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566406,0.000033463573,0.00079909817,0.0019082649,0.00074127235,0.00085384544],"domain_scores_gemma":[0.9966863,0.00077090476,0.0005132787,0.0012489932,0.0006174797,0.00016308784],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014883458,0.0006336929,0.00072790356,0.0009469163,0.00047093697,0.0011314974,0.0038468866,0.00046942284,0.0000028804004],"category_scores_gemma":[0.00024886732,0.000607581,0.0002142534,0.0009275016,0.00026421377,0.00061233673,0.0010520131,0.0006732569,0.000011653855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011012208,0.000052049556,0.000020440262,0.0004488196,0.000034845507,0.000010141508,0.000659567,0.12844221,0.0001612439,0.018789873,0.00006076663,0.85130906],"study_design_scores_gemma":[0.00057999464,0.00013472658,0.0000091964275,0.000784797,0.000011088221,0.0000149078605,2.3995392e-7,0.9510466,0.0009273862,0.044107426,0.0017601552,0.000623471],"about_ca_topic_score_codex":0.000020018673,"about_ca_topic_score_gemma":0.000014146134,"teacher_disagreement_score":0.85068554,"about_ca_system_score_codex":0.00030172121,"about_ca_system_score_gemma":0.001147369,"threshold_uncertainty_score":0.9999054},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000069085745,0.00012710571,0.99517107,0.0004977893,0.0012072531,0.0011647294,0.000023459275,0.00036659028,0.0014350823],"genre_scores_gemma":[0.0031155103,0.000034065735,0.99525046,0.00078673393,0.0003482326,0.000023572555,0.00007586282,0.000031289874,0.0003342466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957235,0.0000609716,0.00071926886,0.0017734596,0.0009066197,0.00081619853],"domain_scores_gemma":[0.9967925,0.0006068314,0.00032227207,0.0013153043,0.0007232546,0.00023983515],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010804548,0.0005209092,0.0005305265,0.0011746141,0.0005249259,0.0011342131,0.0033161868,0.0003779562,0.000009688852],"category_scores_gemma":[0.0001007113,0.00051735155,0.00013905135,0.0010512996,0.00035679646,0.0009830351,0.00089290034,0.0006872315,0.000007779386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030038948,0.00003903149,0.0000023165164,0.000027512557,0.000007651571,0.0000107895585,0.00032222332,0.18649918,0.00002582103,0.008378274,0.00004329999,0.8046409],"study_design_scores_gemma":[0.00035927657,0.0002817108,0.00002729983,0.00026044794,0.0000073983747,0.000015799596,3.290263e-7,0.9816556,0.00021349387,0.015836962,0.00081075996,0.000530907],"about_ca_topic_score_codex":0.000011717,"about_ca_topic_score_gemma":0.000010577227,"teacher_disagreement_score":0.80411,"about_ca_system_score_codex":0.0002923096,"about_ca_system_score_gemma":0.00094263215,"threshold_uncertainty_score":0.9999027},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049310966,0.00106013,0.98991233,0.00046602156,0.0012443253,0.0005492208,0.000016135304,0.00027129697,0.0064312317],"genre_scores_gemma":[0.028984638,0.00042624204,0.9569091,0.003349146,0.00037602748,0.000067271816,0.000017033137,0.00010618859,0.009764353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946306,0.000067437206,0.00057524367,0.0021544183,0.0014406862,0.0011316478],"domain_scores_gemma":[0.9958839,0.0012244143,0.00023451987,0.002018798,0.00039610363,0.00024230119],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010660777,0.0006723157,0.00066467444,0.0010226594,0.00039651385,0.0008955987,0.006047361,0.00035426443,0.000058184538],"category_scores_gemma":[0.00038306453,0.0005557625,0.0001239286,0.0017457433,0.0010192578,0.0011401922,0.0032142426,0.001170008,0.000057936282],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051175637,0.000058976624,0.000031749896,0.00017538646,0.00002842471,0.00023487909,0.0005795584,0.008862887,0.0005345387,0.049433757,0.0002344827,0.93977416],"study_design_scores_gemma":[0.0007125303,0.00044684584,0.000019484998,0.0011006847,0.000014624864,0.00009032071,6.7676945e-7,0.5878831,0.008377039,0.38499355,0.014721529,0.0016396],"about_ca_topic_score_codex":0.000015734528,"about_ca_topic_score_gemma":0.000048671365,"teacher_disagreement_score":0.9381346,"about_ca_system_score_codex":0.00035040092,"about_ca_system_score_gemma":0.0010067851,"threshold_uncertainty_score":0.9996894},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006335793,0.00042640942,0.9889096,0.00015713964,0.0005347735,0.0017089297,0.00005990982,0.00013196161,0.0017354949],"genre_scores_gemma":[0.24650244,0.000064349566,0.7510838,0.0012528899,0.00042984303,0.000039058934,0.00008827471,0.00007262875,0.00046671665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967828,0.00002037332,0.0006791312,0.0012105575,0.00073786586,0.0005692839],"domain_scores_gemma":[0.9977966,0.00032851443,0.00021070272,0.00092154334,0.00058154337,0.00016107572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006907972,0.0005260672,0.0009107765,0.0007947047,0.00023821405,0.0001268692,0.0006629922,0.00045440564,0.00002231844],"category_scores_gemma":[0.00018616366,0.0004820234,0.00030777254,0.00054832094,0.00053818227,0.00040937957,0.00029404348,0.0005726072,9.983881e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027941586,0.0010112912,0.0005844713,0.009174615,0.000575644,0.00009139437,0.00977714,0.3863139,0.031117255,0.0039824652,0.00010072293,0.554477],"study_design_scores_gemma":[0.0021876988,0.00034088883,0.00003007653,0.000998238,0.0001332389,0.000043302414,0.0000020261411,0.9834179,0.005737477,0.0065534427,0.00013299088,0.00042270526],"about_ca_topic_score_codex":0.000050677383,"about_ca_topic_score_gemma":0.000034894485,"teacher_disagreement_score":0.597104,"about_ca_system_score_codex":0.00022135513,"about_ca_system_score_gemma":0.0009361118,"threshold_uncertainty_score":0.99976313},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010947891,0.00045291093,0.9848906,0.0018761397,0.0018582775,0.00046539787,0.000009309369,0.0003600657,0.009977855],"genre_scores_gemma":[0.22259118,0.000033266413,0.7666026,0.0067906496,0.0008345341,0.000032541426,0.000007726352,0.000071675975,0.0030358501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943011,0.00007778259,0.0007119111,0.0023628508,0.001586819,0.0009595552],"domain_scores_gemma":[0.995985,0.0005666006,0.00037072715,0.0025178336,0.0003369605,0.00022288294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013708189,0.00074745767,0.0008139404,0.0012848293,0.00034540292,0.00087029114,0.0049833534,0.00047376327,0.000018774117],"category_scores_gemma":[0.00022082188,0.0006995223,0.00019965014,0.0005611036,0.00033081748,0.00082977593,0.0018304806,0.0013116412,0.000025681924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057243824,0.000018237874,0.0000134241745,0.00006428597,0.000014746659,0.00010376991,0.0018577927,0.5105965,0.000034460852,0.019315427,0.00010921396,0.4678664],"study_design_scores_gemma":[0.00021766665,0.0000438977,0.000009010666,0.0011541083,0.0000096726,0.000017713583,0.0000014071327,0.8238368,0.00081778155,0.17287657,0.00038203498,0.0006333416],"about_ca_topic_score_codex":0.00011633545,"about_ca_topic_score_gemma":0.00029711978,"teacher_disagreement_score":0.46723303,"about_ca_system_score_codex":0.0005689124,"about_ca_system_score_gemma":0.0006884448,"threshold_uncertainty_score":0.9995456},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065294094,0.00037682962,0.9954911,0.00034279164,0.0008350284,0.0014987851,0.000008121917,0.000101926315,0.0006924717],"genre_scores_gemma":[0.35580707,0.000007181937,0.6433348,0.000673982,0.00007161648,0.000051042694,0.000005975164,0.000017927607,0.000030408812],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965708,0.00007531692,0.000809427,0.001142315,0.00069594954,0.00070617476],"domain_scores_gemma":[0.9970838,0.0014314166,0.00034146276,0.0007850839,0.00027149776,0.00008678137],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011541158,0.0005560396,0.0006343647,0.0019027572,0.0002854442,0.0007161043,0.0021960547,0.00042735736,0.000007279665],"category_scores_gemma":[0.00022077234,0.00050464517,0.00010334236,0.0019312117,0.00039809346,0.0006558538,0.00089873874,0.0010302854,0.0000024623428],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009482098,0.00006925489,0.0014053024,0.00017875154,0.000016519736,0.000098407036,0.0311216,0.14507225,0.000012941569,0.06608548,0.00010826581,0.7557364],"study_design_scores_gemma":[0.0017900309,0.00037223226,0.002054325,0.00826928,0.000010335075,0.000022455002,0.0000135804075,0.34691063,0.0013743154,0.63434017,0.0029283662,0.0019142922],"about_ca_topic_score_codex":0.000006840952,"about_ca_topic_score_gemma":0.0005302045,"teacher_disagreement_score":0.7538221,"about_ca_system_score_codex":0.0004906084,"about_ca_system_score_gemma":0.000912694,"threshold_uncertainty_score":0.99974054},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008542134,0.00015704102,0.9765921,0.007518614,0.0031431972,0.00053561595,0.000005348925,0.00017360138,0.011865913],"genre_scores_gemma":[0.010591626,0.00008943746,0.96172225,0.022488194,0.00094967656,0.00006744993,0.0000087627905,0.000031962492,0.0040506506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997255,0.00001652241,0.0004733116,0.0008226778,0.0008999777,0.0005324632],"domain_scores_gemma":[0.9975831,0.00039974446,0.0002145677,0.0013383364,0.0003266693,0.00013761088],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009954886,0.0003650522,0.00027186162,0.00059636385,0.0006867865,0.0018831668,0.0034984124,0.00023593465,0.0000071549694],"category_scores_gemma":[0.000113586095,0.00027382246,0.00011985104,0.0008534694,0.00022207265,0.0011038462,0.00090088893,0.00062937144,0.00015512854],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006090665,0.0000047942813,0.00000558224,0.000025655681,0.000008162514,0.0000031418972,0.0019245084,0.00482377,0.000018523437,0.029332235,0.0019341398,0.9619134],"study_design_scores_gemma":[0.00027731413,0.00029845856,0.0001653109,0.00068962626,0.000012979977,0.00003823673,7.118241e-7,0.47723714,0.002821223,0.28914666,0.2283855,0.00092684873],"about_ca_topic_score_codex":0.000049745366,"about_ca_topic_score_gemma":0.00007828051,"teacher_disagreement_score":0.96098655,"about_ca_system_score_codex":0.00030865066,"about_ca_system_score_gemma":0.0005285916,"threshold_uncertainty_score":0.9999714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009252895,0.000105398336,0.94336337,0.000695281,0.00023574289,0.054606643,0.00010043036,0.00016637276,0.0006342406],"genre_scores_gemma":[0.36927724,0.0000043876266,0.61521536,0.00054817076,0.000088473724,0.014768609,0.0000158626,0.00003384458,0.000048050813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994373,0.00015476072,0.0012546496,0.002488216,0.0010318161,0.0006975115],"domain_scores_gemma":[0.9929437,0.0021731856,0.0007027494,0.0029002668,0.001056781,0.00022331897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026677023,0.0006979604,0.0012217779,0.0006173171,0.00022267298,0.00029687356,0.0036001878,0.00041053098,0.000010870262],"category_scores_gemma":[0.00038440523,0.0006837909,0.0002500749,0.0006617652,0.00240035,0.00080680626,0.0021472352,0.00069672015,0.0000014517898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018270135,0.0008928199,0.0008128476,0.0072468533,0.000032649343,0.0000056087383,0.003405105,0.060869634,0.00017039609,0.6578736,0.000014964217,0.26849285],"study_design_scores_gemma":[0.0005178768,0.00018645464,0.000055554705,0.00047182068,0.0000058255364,0.0000021951364,1.0194482e-7,0.48202997,0.0017313273,0.5144347,0.00025217488,0.0003119872],"about_ca_topic_score_codex":0.000023162958,"about_ca_topic_score_gemma":0.00008652691,"teacher_disagreement_score":0.42116034,"about_ca_system_score_codex":0.00040906196,"about_ca_system_score_gemma":0.001075128,"threshold_uncertainty_score":0.9995613},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058532558,0.00035387394,0.9856596,0.00073489174,0.0018297243,0.00030485747,0.000005438509,0.00016342354,0.010889644],"genre_scores_gemma":[0.10013414,0.00020906972,0.89548,0.0027539544,0.00050528045,0.0000203589,0.000015928026,0.00003150399,0.0008498048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969323,0.000022925498,0.00047877344,0.0012600821,0.0007414128,0.0005644979],"domain_scores_gemma":[0.9978751,0.00029359185,0.00017889436,0.001345099,0.00019254356,0.000114789895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007000921,0.00038861856,0.00038188617,0.001066867,0.00033503617,0.000600759,0.0027670644,0.00019391245,0.00005150425],"category_scores_gemma":[0.000053157037,0.0003786332,0.00014073064,0.0008941695,0.00033308662,0.00047242295,0.001506612,0.00060019316,0.00001703396],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021466042,0.000018945473,0.00006385523,0.0000385017,0.000011199879,0.00004082333,0.00052713114,0.0016470931,0.00006452809,0.18253116,0.0001928377,0.8148618],"study_design_scores_gemma":[0.0005821512,0.00017375742,0.0003141314,0.00069697306,0.000017777484,0.00005589965,5.023974e-7,0.5061469,0.001263834,0.45889077,0.030612143,0.0012451704],"about_ca_topic_score_codex":0.000049581122,"about_ca_topic_score_gemma":0.0002010158,"teacher_disagreement_score":0.81361663,"about_ca_system_score_codex":0.0001952073,"about_ca_system_score_gemma":0.00050923065,"threshold_uncertainty_score":0.99986655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031467963,0.00022798697,0.98097736,0.0013178539,0.005041492,0.0044377944,0.000049869155,0.0002555977,0.0045452355],"genre_scores_gemma":[0.90301347,0.0000017704288,0.0920046,0.0020078116,0.0014398291,0.00045828885,0.00009625615,0.00008790869,0.00089008687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99525404,0.0002349304,0.0014677752,0.0012652867,0.0008309037,0.00094706524],"domain_scores_gemma":[0.994666,0.0020308576,0.0007631085,0.0013344222,0.0010696306,0.00013602542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0038022483,0.00045716006,0.00068923493,0.0017439272,0.00076461287,0.00012586822,0.0015767653,0.0006608518,0.000011041217],"category_scores_gemma":[0.0007155169,0.00044848982,0.00008526925,0.0010797473,0.00018930875,0.00027940996,0.0005233153,0.0013091953,0.000019347013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048147427,0.00024003278,0.021586638,0.04952574,0.00003993052,0.00008967923,0.015688974,0.45287925,0.0002634038,0.1095854,0.0010595937,0.3485599],"study_design_scores_gemma":[0.0010338887,0.00009268577,0.0003045671,0.017684378,0.000004332063,0.0000023285547,0.000012825177,0.9768469,0.00013066859,0.0018994176,0.0015419548,0.0004460863],"about_ca_topic_score_codex":0.00023220813,"about_ca_topic_score_gemma":0.00046575203,"teacher_disagreement_score":0.89986664,"about_ca_system_score_codex":0.0028619063,"about_ca_system_score_gemma":0.0029539713,"threshold_uncertainty_score":0.9997967},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032882404,0.00020298643,0.9918277,0.0011227084,0.0033879417,0.00060047215,0.00030177872,0.0001523515,0.002400747],"genre_scores_gemma":[0.07940524,0.000043332566,0.91389745,0.0029888228,0.0021072254,0.00007783631,0.0007994618,0.000057636316,0.0006229681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996777,0.000019885125,0.0004960915,0.001712181,0.00055453554,0.00044032527],"domain_scores_gemma":[0.9944924,0.001533527,0.00024093756,0.0033159673,0.0002881233,0.00012900628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006121452,0.0003941316,0.00048336148,0.000713381,0.00017159339,0.00026169783,0.005296433,0.00017063084,0.0000020357177],"category_scores_gemma":[0.000096219665,0.00038381587,0.00009756877,0.0005474858,0.00019744551,0.00025040912,0.0022185922,0.0004211815,0.00002146727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006411188,0.00003601861,0.0000023660705,0.00014230672,0.000023893937,0.000014420368,0.00005207263,0.034417633,0.000026553702,0.69617796,0.0011690767,0.26793128],"study_design_scores_gemma":[0.00021862118,0.000058827914,0.000007978588,0.00031573838,0.000016535423,0.00001690605,8.4473164e-8,0.9195374,0.000092368544,0.056021918,0.023363179,0.00035042388],"about_ca_topic_score_codex":0.000016463988,"about_ca_topic_score_gemma":0.000035005356,"teacher_disagreement_score":0.8851198,"about_ca_system_score_codex":0.00038659864,"about_ca_system_score_gemma":0.0011825837,"threshold_uncertainty_score":0.99986136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000066261244,0.0005332077,0.98618263,0.0011828874,0.0026531867,0.00031297212,0.0000028700174,0.0006775296,0.008388434],"genre_scores_gemma":[0.06848001,0.00009984829,0.92654824,0.0035361175,0.0004942275,0.000010211345,0.000007191459,0.000031882904,0.000792268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953028,0.000059987087,0.00054979784,0.002138609,0.00099512,0.0009536731],"domain_scores_gemma":[0.99565303,0.000903097,0.00027438396,0.002717605,0.00024341211,0.0002084747],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010789159,0.0006305312,0.0007075237,0.0010238051,0.0004569729,0.0011939908,0.006460591,0.00065698056,0.00003008761],"category_scores_gemma":[0.0002750151,0.00058028067,0.00013091193,0.0009972975,0.00047477148,0.001196563,0.0027400958,0.001495088,0.00004709576],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007484366,0.000059137885,0.00060362194,0.000073700176,0.000028465509,0.00015776444,0.0011093364,0.009335257,0.000023484876,0.23892467,0.000103424645,0.74957365],"study_design_scores_gemma":[0.00017280379,0.00013796863,0.0002443967,0.0005487051,0.000011347349,0.000038553026,6.590033e-7,0.56428117,0.00025325772,0.4285415,0.0050831833,0.00068647624],"about_ca_topic_score_codex":0.000056017157,"about_ca_topic_score_gemma":0.00010399488,"teacher_disagreement_score":0.7488872,"about_ca_system_score_codex":0.00025971924,"about_ca_system_score_gemma":0.001084675,"threshold_uncertainty_score":0.9998429},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027923144,0.00012403523,0.97033036,0.00012244991,0.00072133954,0.000246771,0.0000014022843,0.00013195543,0.00039856372],"genre_scores_gemma":[0.97526944,0.000041071544,0.023868993,0.00045060404,0.00022091827,0.0000057799402,0.0000024748642,0.000018066508,0.0001226373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975807,0.00003569486,0.00037706047,0.0010306045,0.0005488458,0.0004270692],"domain_scores_gemma":[0.9990497,0.00027050695,0.00021636642,0.0003112336,0.00008188545,0.00007025908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006436096,0.00034740355,0.0003214073,0.0011912071,0.00046703406,0.0005126411,0.00070290046,0.00041182368,0.0000020100802],"category_scores_gemma":[0.00014146279,0.00033392175,0.000054958215,0.00081802,0.00024026593,0.0008929601,0.0004871276,0.0012780989,0.0000021307576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026366042,0.000016153308,0.0005678109,0.000052884214,0.0000061847495,0.00003243469,0.0008678757,0.09795557,0.0031355012,0.0042421753,8.310136e-7,0.8930962],"study_design_scores_gemma":[0.00023477378,0.00013341891,0.000821033,0.0002957009,0.0000043437594,0.000023849947,2.2115128e-7,0.957281,0.0064802095,0.034161586,0.00020173524,0.00036212752],"about_ca_topic_score_codex":0.00020750618,"about_ca_topic_score_gemma":0.00056988973,"teacher_disagreement_score":0.9473463,"about_ca_system_score_codex":0.00046917348,"about_ca_system_score_gemma":0.00023207857,"threshold_uncertainty_score":0.9999113},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077087217,0.000938405,0.99318206,0.00066849956,0.0027977338,0.0003194535,0.0000027720753,0.00008763754,0.0012325799],"genre_scores_gemma":[0.0832226,0.00004674642,0.91491264,0.0003487931,0.00023951486,0.0000058842775,0.0000036263355,0.000017292157,0.0012028978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957407,0.00020978034,0.00041693632,0.0018545393,0.0010830899,0.0006949197],"domain_scores_gemma":[0.9962795,0.0016211917,0.00015086221,0.001460409,0.00039089308,0.000097165255],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0050469283,0.00034294202,0.00043069603,0.0018337562,0.0007322137,0.0033527866,0.00274057,0.0002647539,0.000004485226],"category_scores_gemma":[0.00039141352,0.0002982673,0.000074781216,0.0011949143,0.0018317184,0.0012192148,0.003265607,0.00079795235,0.000006024994],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001765104,0.00001251146,0.00020780608,0.00006510186,0.0000073111855,0.000032280437,0.0005575122,0.0017017159,0.00078208104,0.017989462,0.000022617827,0.9786198],"study_design_scores_gemma":[0.0001571157,0.000073824885,0.00032365383,0.00069400476,0.000009685866,0.000048213114,9.285218e-7,0.68061703,0.00980965,0.30684218,0.0009329053,0.0004908238],"about_ca_topic_score_codex":0.00008992696,"about_ca_topic_score_gemma":0.0000659842,"teacher_disagreement_score":0.978129,"about_ca_system_score_codex":0.00025782682,"about_ca_system_score_gemma":0.00089654914,"threshold_uncertainty_score":0.99994695},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037228854,0.0015279672,0.9944791,0.00018751387,0.0021722666,0.0008562892,0.00006186668,0.00026212772,0.00008056656],"genre_scores_gemma":[0.20371698,0.00012331277,0.7924402,0.00052501506,0.00056369154,0.000074511234,0.000013484854,0.000073241026,0.0024696118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666804,0.000023980718,0.0003965912,0.0015022336,0.0006895633,0.00071958423],"domain_scores_gemma":[0.9963425,0.0018701019,0.0001222887,0.0012633697,0.0002268883,0.00017484985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009065405,0.00045335363,0.00056683464,0.0009846744,0.00017859746,0.00081851764,0.0028066582,0.00029062372,0.0000026968578],"category_scores_gemma":[0.0004118959,0.00042789834,0.000089496934,0.00041402446,0.00028994796,0.00031704796,0.0014534149,0.0006077847,0.000007422678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001065405,0.00008457661,0.004238825,0.0019502933,0.00008427429,0.00039156998,0.003007165,0.06720665,0.000526352,0.022094613,0.00022200457,0.900183],"study_design_scores_gemma":[0.00040522084,0.00009577098,0.0009704158,0.00091424317,0.0000067650394,0.00005287605,3.5432942e-7,0.9943064,0.00074755884,0.001049381,0.00091103656,0.00053996424],"about_ca_topic_score_codex":0.00005363989,"about_ca_topic_score_gemma":0.0000524403,"teacher_disagreement_score":0.92709976,"about_ca_system_score_codex":0.00021890274,"about_ca_system_score_gemma":0.0003820793,"threshold_uncertainty_score":0.9998173},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015015203,0.0009911215,0.98799145,0.00203207,0.0047084885,0.00044611574,0.000015499018,0.0005374399,0.00312764],"genre_scores_gemma":[0.015110427,0.00006247046,0.97368485,0.008135127,0.001520813,0.00002399342,0.000026705464,0.00006642947,0.0013692031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994036,0.00011654178,0.0007217109,0.0025007895,0.0013273825,0.0012975658],"domain_scores_gemma":[0.99557394,0.000939306,0.0003294904,0.0024257097,0.00046274977,0.00026880435],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010863,0.000850245,0.0008353598,0.0025146536,0.00053247646,0.0010963691,0.007407819,0.0004830287,0.000010222192],"category_scores_gemma":[0.0001887579,0.00075518014,0.0003671444,0.0033482225,0.00084032514,0.0004516904,0.003206523,0.0017951732,0.000039930306],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005246986,0.00007245394,0.000030390052,0.00011739153,0.000024620465,0.0001709689,0.0007041206,0.054797012,0.00008949309,0.021177266,0.00058208394,0.92222893],"study_design_scores_gemma":[0.00024301636,0.0002084273,0.00015141958,0.00063511735,0.000008532744,0.00006662486,1.0019968e-7,0.7596823,0.00030694992,0.23290421,0.005024058,0.00076924864],"about_ca_topic_score_codex":0.000032992175,"about_ca_topic_score_gemma":0.00002545679,"teacher_disagreement_score":0.9214597,"about_ca_system_score_codex":0.00031682083,"about_ca_system_score_gemma":0.0029512066,"threshold_uncertainty_score":0.9999406},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036786805,0.00017893733,0.9925309,0.0014998063,0.00025311456,0.0015153483,0.000018040948,0.0000134395095,0.0039536674],"genre_scores_gemma":[0.7076917,0.000040130235,0.28445715,0.002875031,0.0006761978,0.0020171118,0.000021902682,0.000040195642,0.0021805526],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986518,0.00005585734,0.0003144998,0.0004649245,0.00022765128,0.00028525625],"domain_scores_gemma":[0.9964603,0.0029227526,0.0001028652,0.0004006763,0.00009127192,0.000022097094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007195368,0.00015749338,0.00024477637,0.00035865555,0.00020190248,0.0000657162,0.0004946541,0.00012725624,0.000084976346],"category_scores_gemma":[0.00007032122,0.00012201302,0.000071822054,0.00020489939,0.00038692175,0.000030698404,0.000119894314,0.00027469036,0.000013014399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119318145,0.0004772453,0.0003817746,0.00021000655,0.00018233272,0.00007557756,0.016047683,0.00972415,0.00014201926,0.10564372,0.0018250571,0.86517113],"study_design_scores_gemma":[0.003441928,0.001246589,0.009240408,0.00059501856,0.000114864335,0.00006227257,0.00001723507,0.011153531,0.0006535678,0.9663177,0.006154019,0.0010028799],"about_ca_topic_score_codex":0.000023510582,"about_ca_topic_score_gemma":0.00009540324,"teacher_disagreement_score":0.8641682,"about_ca_system_score_codex":0.00008608812,"about_ca_system_score_gemma":0.00026725963,"threshold_uncertainty_score":0.49755466},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008301264,0.0013160958,0.964087,0.004351018,0.005610271,0.0008182749,0.000053743,0.00005595062,0.015406366],"genre_scores_gemma":[0.98966044,0.00012789777,0.0075903432,0.0012356588,0.00029827593,0.000010321199,0.0000017931102,0.000018375413,0.0010569005],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985626,0.00006910014,0.0002610693,0.00059678813,0.00031847574,0.00019196502],"domain_scores_gemma":[0.9984009,0.0007388039,0.00016309571,0.000530929,0.00012025344,0.000045984314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006313053,0.0002087861,0.0003330263,0.0001486719,0.00019519446,0.000055924906,0.00044771805,0.00025055895,0.00012396486],"category_scores_gemma":[0.00019483366,0.00014910981,0.00006889095,0.00016233638,0.0021469058,0.000053373016,0.00033299165,0.000491662,0.0000025849502],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014184826,0.00016785522,0.03896044,0.0002754535,0.00007253413,0.000027677203,0.009241066,0.0005637601,0.00033580355,0.06699122,0.0020750808,0.88114727],"study_design_scores_gemma":[0.001421324,0.00046385097,0.1727032,0.0015488705,0.00015505534,0.00013341923,0.00002599456,0.004276361,0.0013028639,0.7892898,0.027377255,0.0013020249],"about_ca_topic_score_codex":0.00030996455,"about_ca_topic_score_gemma":0.0009912808,"teacher_disagreement_score":0.9813592,"about_ca_system_score_codex":0.00006829485,"about_ca_system_score_gemma":0.00013060767,"threshold_uncertainty_score":0.79103637},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015015203,0.0009911215,0.98799145,0.00203207,0.0047084885,0.00044611574,0.000015499018,0.0005374399,0.00312764],"genre_scores_gemma":[0.015110427,0.00006247046,0.97368485,0.008135127,0.001520813,0.00002399342,0.000026705464,0.00006642947,0.0013692031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994036,0.00011654178,0.0007217109,0.0025007895,0.0013273825,0.0012975658],"domain_scores_gemma":[0.99557394,0.000939306,0.0003294904,0.0024257097,0.00046274977,0.00026880435],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010863,0.000850245,0.0008353598,0.0025146536,0.00053247646,0.0010963691,0.007407819,0.0004830287,0.000010222192],"category_scores_gemma":[0.0001887579,0.00075518014,0.0003671444,0.0033482225,0.00084032514,0.0004516904,0.003206523,0.0017951732,0.000039930306],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005246986,0.00007245394,0.000030390052,0.00011739153,0.000024620465,0.0001709689,0.0007041206,0.054797012,0.00008949309,0.021177266,0.00058208394,0.92222893],"study_design_scores_gemma":[0.00024301636,0.0002084273,0.00015141958,0.00063511735,0.000008532744,0.00006662486,1.0019968e-7,0.7596823,0.00030694992,0.23290421,0.005024058,0.00076924864],"about_ca_topic_score_codex":0.000032992175,"about_ca_topic_score_gemma":0.00002545679,"teacher_disagreement_score":0.9214597,"about_ca_system_score_codex":0.00031682083,"about_ca_system_score_gemma":0.0029512066,"threshold_uncertainty_score":0.9999406},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009369864,0.00092626776,0.9771216,0.001078149,0.0003159155,0.002107635,0.00001751698,0.00013159614,0.008931466],"genre_scores_gemma":[0.8983268,0.00008298465,0.10092988,0.00033594933,0.000049284703,0.000039766943,0.000002862823,0.000018803348,0.00021363469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833804,0.00009475315,0.0004930999,0.0005644851,0.00028530337,0.00022430425],"domain_scores_gemma":[0.9949085,0.0035306106,0.0003018805,0.0010817851,0.0001362835,0.00004091183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00291344,0.0002515671,0.00051191734,0.0002236478,0.0003131049,0.00007470985,0.00091770437,0.00014957105,0.000008061327],"category_scores_gemma":[0.0002912104,0.0001663096,0.0001380291,0.0003306119,0.0018269613,0.00005633664,0.00046403354,0.00050042814,7.204388e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027930048,0.000042215244,0.00005714191,0.00025099053,0.00003403831,5.326025e-7,0.0021244492,0.00027993476,0.00005139052,0.96555156,0.000015948988,0.03156388],"study_design_scores_gemma":[0.00083000504,0.000020173922,0.00001833475,0.00034218133,0.000052413405,0.0000074960385,9.377435e-7,0.011704571,0.00049510185,0.9862368,0.00013836735,0.00015363225],"about_ca_topic_score_codex":0.000013956886,"about_ca_topic_score_gemma":0.000037792335,"teacher_disagreement_score":0.88895696,"about_ca_system_score_codex":0.000027988985,"about_ca_system_score_gemma":0.00011731201,"threshold_uncertainty_score":0.6781909},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019073358,0.0015458319,0.994846,0.0011208405,0.0017854172,0.00028148727,0.000002893867,0.00015009259,0.00007674439],"genre_scores_gemma":[0.18677521,0.000048920454,0.81177896,0.00072129356,0.00026856607,0.000009652327,0.000019823858,0.000019192104,0.0003583814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588645,0.0001851678,0.0006205545,0.0016919691,0.0010357966,0.0005800625],"domain_scores_gemma":[0.99565655,0.001597354,0.00046897074,0.0018210955,0.0002755895,0.00018042808],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001610236,0.0005012131,0.00077357586,0.0024102756,0.0002729572,0.001338756,0.0039283107,0.00039049558,0.000033583103],"category_scores_gemma":[0.00032597728,0.0004792294,0.00028769506,0.002223437,0.0005251195,0.0010478311,0.000742406,0.0012821701,0.000007712551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038782587,0.000052981424,0.00060885446,0.000013273071,0.00012617408,0.0000037591185,0.0019772707,0.32710534,0.0000050199924,0.0233296,0.0000058511555,0.646768],"study_design_scores_gemma":[0.00020907329,0.00037511947,0.011604453,0.0016568855,0.0003426105,0.000029732839,0.000002041717,0.82680196,0.00016473545,0.15696183,0.0005928588,0.0012587114],"about_ca_topic_score_codex":0.00007419487,"about_ca_topic_score_gemma":0.00004676362,"teacher_disagreement_score":0.64550924,"about_ca_system_score_codex":0.00020536201,"about_ca_system_score_gemma":0.00091026013,"threshold_uncertainty_score":0.99976593},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006958348,0.0009075288,0.97910297,0.0013333231,0.0020494368,0.000839445,0.000014661958,0.00010045225,0.014956361],"genre_scores_gemma":[0.8013773,0.00020286403,0.13388398,0.014133034,0.0021616512,0.00033990334,0.00019424918,0.00019291052,0.047514092],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99822426,0.000064750115,0.00033171635,0.0008382871,0.0002077758,0.00033321267],"domain_scores_gemma":[0.9986634,0.000521342,0.0002388488,0.00033550916,0.0001717914,0.00006909376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004150228,0.0003639532,0.0004967769,0.00044408336,0.0002919277,0.00013519813,0.0005063141,0.0003026957,0.00019038498],"category_scores_gemma":[0.000086153486,0.00025248472,0.000106278036,0.00020179391,0.00042434156,0.00010236037,0.00027006346,0.0007799747,0.000009284794],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069016074,0.000030358138,0.00016353063,0.000028305076,0.00006276847,0.0000026849084,0.0035984775,0.00027060916,0.000017494158,0.0031658446,0.0002209435,0.99236995],"study_design_scores_gemma":[0.017711503,0.010893026,0.38295013,0.033899292,0.000719053,0.0014462029,0.0005699597,0.060858823,0.003508411,0.17763044,0.29666635,0.013146805],"about_ca_topic_score_codex":0.00005786557,"about_ca_topic_score_gemma":0.00018212319,"teacher_disagreement_score":0.9792232,"about_ca_system_score_codex":0.00010242898,"about_ca_system_score_gemma":0.0002154389,"threshold_uncertainty_score":0.9999927},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081655085,0.0006828305,0.9808196,0.00046971012,0.00031670748,0.001547134,0.00002439075,0.00020556977,0.0077685565],"genre_scores_gemma":[0.5257287,0.00010380121,0.47112572,0.0009982594,0.0000986111,0.00003508572,0.000013030203,0.00009377742,0.0018030403],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9941432,0.00016944084,0.0007325942,0.001993537,0.0019477804,0.0010134495],"domain_scores_gemma":[0.99698216,0.0008966119,0.0004506139,0.0014298529,0.00007326211,0.00016752766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011557683,0.0007495958,0.00083767006,0.0013044558,0.00035147349,0.00024509494,0.0027757548,0.00036860164,0.00018431077],"category_scores_gemma":[0.00027552838,0.00059063954,0.000117068295,0.0011905906,0.0020310988,0.00021337504,0.00077250926,0.0011948465,0.00004644868],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012555729,0.00014085803,0.000052516556,0.00008983925,0.000014558562,0.0013410739,0.0043291934,0.0012466104,0.10882135,0.00081003114,0.000012330255,0.8830161],"study_design_scores_gemma":[0.0010346035,0.00051651057,0.0013716226,0.00078540656,0.0000107522,0.00026077643,0.000004935937,0.0057305926,0.9839902,0.0049452023,0.00029915993,0.0010502454],"about_ca_topic_score_codex":0.000041752843,"about_ca_topic_score_gemma":0.000178317,"teacher_disagreement_score":0.8819658,"about_ca_system_score_codex":0.00038871245,"about_ca_system_score_gemma":0.0019323567,"threshold_uncertainty_score":0.9996545},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041137653,0.0001887071,0.8652912,0.0021857356,0.010345577,0.0006612368,0.000017591705,0.00011668975,0.12115212],"genre_scores_gemma":[0.26280951,0.00025005735,0.4336341,0.08267363,0.050587397,0.0014145919,0.00038384413,0.00082365697,0.16742317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977091,0.000018834426,0.00042654373,0.0009286959,0.00041954682,0.0004972691],"domain_scores_gemma":[0.998224,0.00080869027,0.00025619366,0.00041127187,0.00020942042,0.00009043043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038353514,0.00036017218,0.00047626835,0.0005057449,0.0003732389,0.00014252955,0.0009365151,0.0005509798,0.0005902501],"category_scores_gemma":[0.00019677101,0.00035029213,0.00023247063,0.00021564923,0.00050789234,0.000086384935,0.00027002423,0.0006119772,0.00015611561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009251844,0.000050986837,0.00012300196,0.000045689165,0.00007893807,0.000023701481,0.0033055833,0.00079381187,0.000011286879,0.5182531,0.0032349522,0.47398642],"study_design_scores_gemma":[0.0019461595,0.00045662269,0.0022593136,0.0005011029,0.00011324798,0.000032891643,0.0000074646505,0.01132292,0.00021964697,0.7863734,0.19507535,0.0016919127],"about_ca_topic_score_codex":0.000073564035,"about_ca_topic_score_gemma":0.0008882136,"teacher_disagreement_score":0.4722945,"about_ca_system_score_codex":0.00025818427,"about_ca_system_score_gemma":0.0004475047,"threshold_uncertainty_score":0.9998949},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041179897,0.000081887854,0.9508507,0.000688569,0.005879695,0.0006187303,0.000027682363,0.000059515634,0.041381396],"genre_scores_gemma":[0.5779655,0.000017878687,0.40032077,0.00786256,0.0023791026,0.000069588685,0.0001217975,0.00009427953,0.011168525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974336,0.00011424927,0.0004785056,0.0011078238,0.00046504114,0.0004007899],"domain_scores_gemma":[0.9978224,0.0010567853,0.00034068103,0.0004187523,0.00025985166,0.00010150887],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041889452,0.00037067215,0.0005285823,0.0004218799,0.0005288922,0.0004824178,0.0011252031,0.00043052124,0.0022882312],"category_scores_gemma":[0.00006619186,0.00039723353,0.00014553622,0.00026280875,0.00043411282,0.0002851443,0.0009401518,0.00093267474,0.000078465586],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003584195,0.0006207813,0.0016063367,0.00006222101,0.0008182817,0.00032768399,0.03847194,0.015706822,0.0032429353,0.036479022,0.0010354255,0.90127015],"study_design_scores_gemma":[0.008011303,0.003296117,0.19114962,0.011346324,0.0015721607,0.00014245718,0.0007274042,0.53298366,0.0022144022,0.23049986,0.009541894,0.008514782],"about_ca_topic_score_codex":0.0015608054,"about_ca_topic_score_gemma":0.0010260874,"teacher_disagreement_score":0.8927553,"about_ca_system_score_codex":0.0010372311,"about_ca_system_score_gemma":0.0018564347,"threshold_uncertainty_score":0.99984795},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000070953265,0.00034457044,0.9941937,0.00022717513,0.0007476067,0.0008042187,0.000016365804,0.00096928666,0.0026900263],"genre_scores_gemma":[0.39436364,0.0005496572,0.6025058,0.00071049365,0.00046952776,0.0003350791,0.00009079425,0.00011193366,0.00086310075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985978,0.00001002745,0.00040461065,0.00046804151,0.00025868166,0.00026083287],"domain_scores_gemma":[0.9983346,0.00026493342,0.000103034465,0.0010277336,0.00022404449,0.000045643625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048924075,0.00029185397,0.00031037937,0.0007193129,0.000106248706,0.00015515996,0.0013386356,0.0003274882,0.00001081194],"category_scores_gemma":[0.000044259486,0.00032642743,0.00008700246,0.00024498216,0.0002956163,0.00020912908,0.00026898025,0.00043241223,0.000007688222],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034971997,0.000011727204,0.000002428101,0.0002477227,0.000015183972,0.000001988779,0.0003500514,0.006895912,0.0024870744,0.012273284,0.0004908626,0.9772203],"study_design_scores_gemma":[0.00008677538,0.000036926405,0.0000042787947,0.0005424374,0.000012347681,0.000005629317,1.2832781e-7,0.6866648,0.13179575,0.15721852,0.023125842,0.0005065531],"about_ca_topic_score_codex":0.000006457314,"about_ca_topic_score_gemma":0.000018396993,"teacher_disagreement_score":0.9767137,"about_ca_system_score_codex":0.00028555124,"about_ca_system_score_gemma":0.000083941486,"threshold_uncertainty_score":0.99991876},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1749581,0.0018379989,0.5323879,0.054944016,0.016994352,0.007345551,0.0007684179,0.0011551742,0.20960848],"genre_scores_gemma":[0.9935946,0.000009339082,0.003318137,0.0003740876,0.00082575605,0.000013248906,0.000011796574,0.0000337805,0.0018192574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975446,0.000043239004,0.00042935082,0.0011495568,0.00042677426,0.00040648493],"domain_scores_gemma":[0.9984425,0.00048777438,0.00021991029,0.0005816372,0.00019824832,0.000069934256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060643384,0.0004217637,0.0005013613,0.0008934335,0.00025251333,0.00036196984,0.0005244144,0.00021042461,0.000079177866],"category_scores_gemma":[0.0004673736,0.00038709113,0.00006511627,0.0001553704,0.0010055564,0.000091497444,0.00024809563,0.0006608044,0.000020794741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113539776,0.00018678502,0.0011415066,0.00022225734,0.000056222314,0.00006462427,0.075998,0.0015151668,0.00026043455,0.5845148,0.000025874802,0.33590078],"study_design_scores_gemma":[0.00067606964,0.00035564,0.0027825637,0.0018344756,0.000045885543,0.0000109807615,0.00007535571,0.04790192,0.00054548087,0.943513,0.0011215385,0.0011370833],"about_ca_topic_score_codex":0.0011303376,"about_ca_topic_score_gemma":0.007085774,"teacher_disagreement_score":0.8186365,"about_ca_system_score_codex":0.00032473626,"about_ca_system_score_gemma":0.0002847622,"threshold_uncertainty_score":0.9998581},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016137046,0.00037373314,0.99545646,0.00016233353,0.0011129838,0.0014070406,0.0000058911337,0.00051430624,0.0009511364],"genre_scores_gemma":[0.100168414,0.000105511135,0.8977536,0.0008083968,0.00028194673,0.00012439312,0.00000431048,0.00003594742,0.0007174979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965438,0.000035314406,0.0004706579,0.0017299602,0.0005997443,0.00062049227],"domain_scores_gemma":[0.99684167,0.0010984408,0.00032815922,0.0011796239,0.00044558354,0.000106527536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009029321,0.00055398734,0.00053701096,0.0011072871,0.00042247478,0.00059671974,0.002120084,0.0004209268,0.000001138461],"category_scores_gemma":[0.00022946877,0.0005438761,0.0002327834,0.0007902472,0.00024682545,0.0018402088,0.0008698503,0.00082634867,0.0000045610204],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017531933,0.000017649716,0.0000014941661,0.000078236735,0.0000109424645,0.0000089403275,0.00014938628,0.014997736,0.0015675096,0.008066765,0.000010238047,0.9750736],"study_design_scores_gemma":[0.00017688493,0.00020527618,0.000012360427,0.00026373562,0.000009631534,0.000019987132,9.0080114e-8,0.7042796,0.043179635,0.25107276,0.00037139934,0.00040866763],"about_ca_topic_score_codex":0.000014039859,"about_ca_topic_score_gemma":0.000059780847,"teacher_disagreement_score":0.9746649,"about_ca_system_score_codex":0.00086682383,"about_ca_system_score_gemma":0.00048671712,"threshold_uncertainty_score":0.99970126},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000108957036,0.0011967242,0.57895756,0.0016753689,0.0037944561,0.00039491747,0.00000772737,0.000111826084,0.41375244],"genre_scores_gemma":[0.09975393,0.0028825165,0.2660158,0.026839416,0.008509528,0.000051449333,0.000052671458,0.000115211435,0.5957795],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99792415,0.000041479972,0.00020914829,0.0006924126,0.000619862,0.0005129672],"domain_scores_gemma":[0.99865615,0.00066822063,0.000088264234,0.00029583392,0.00010509189,0.00018645961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000672532,0.00022486068,0.00032528606,0.00039719505,0.00016341296,0.0005401523,0.00089345936,0.00022473496,0.000012027838],"category_scores_gemma":[0.00024989978,0.00020943729,0.000059963877,0.00058843114,0.0021173689,0.00025404102,0.0004526739,0.00036265253,0.000007969497],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000153543,0.000009583892,0.00007086052,0.000027594617,0.0000038209573,0.000015368283,0.0034171771,0.0002620869,9.014663e-7,0.005389945,0.00092792296,0.98987323],"study_design_scores_gemma":[0.0002106205,0.00007120458,0.0002563542,0.00082224363,0.000011592541,0.0000044305316,0.0000048110237,0.0048126793,0.000024480514,0.053843588,0.93945014,0.0004878384],"about_ca_topic_score_codex":0.000077144774,"about_ca_topic_score_gemma":0.00068058376,"teacher_disagreement_score":0.98938537,"about_ca_system_score_codex":0.00028772745,"about_ca_system_score_gemma":0.0021282865,"threshold_uncertainty_score":0.8540605},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026995926,0.00065645156,0.9851147,0.00052215403,0.0007705439,0.0007749279,0.0000043649866,0.000039089733,0.009418182],"genre_scores_gemma":[0.9491544,0.000028910094,0.049707003,0.00085886236,0.00013447713,0.000019825773,0.0000064514356,0.000009425334,0.00008067335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99548227,0.0002756604,0.0008464223,0.0012352095,0.0016706579,0.0004897745],"domain_scores_gemma":[0.99559706,0.0018821255,0.0004605694,0.0014962715,0.0005092782,0.000054676053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036563876,0.00043510186,0.000673691,0.0012887793,0.00016260364,0.00040126833,0.0043446748,0.00022012433,0.0000140895445],"category_scores_gemma":[0.00032480666,0.00033199126,0.000172375,0.0018256212,0.00094685843,0.0005535569,0.00080375816,0.0008482387,0.00001935277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008054037,0.00005161327,0.00021295268,0.000028426648,0.000019970475,0.000023392273,0.014997808,0.3474349,0.00027214675,0.015477294,0.00003465274,0.6214388],"study_design_scores_gemma":[0.00009122814,0.00009676372,0.00032100308,0.00055130484,0.000018299655,0.0000069887633,0.0000054525713,0.92517245,0.0036051702,0.0695831,0.00022695836,0.0003212529],"about_ca_topic_score_codex":0.00007138575,"about_ca_topic_score_gemma":0.0006476759,"teacher_disagreement_score":0.94645476,"about_ca_system_score_codex":0.0004040222,"about_ca_system_score_gemma":0.0010054467,"threshold_uncertainty_score":0.9999132},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046644567,0.0003438939,0.9796412,0.00057419145,0.0048061,0.0004511015,0.0000033604395,0.00030004504,0.013833437],"genre_scores_gemma":[0.27162644,0.00007671247,0.71928334,0.0034573446,0.002087411,0.000030797804,0.000006172737,0.000097501914,0.0033342894],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995281,0.00007609021,0.00063542364,0.0018844852,0.0012552926,0.0008677034],"domain_scores_gemma":[0.99555176,0.0015123425,0.00032568918,0.0019441047,0.00047926308,0.00018686512],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013508969,0.00067362055,0.0006647096,0.0009217808,0.0003197725,0.0006825676,0.0052458993,0.00041248265,0.000032034535],"category_scores_gemma":[0.00029853272,0.0005644395,0.00014589274,0.0009297136,0.0014498762,0.0007346126,0.0019902033,0.0012461868,0.000089353365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002323834,0.000034697347,0.00004062759,0.0000338308,0.00001943057,0.0001300597,0.0010642812,0.016203957,0.00003836342,0.44749588,0.000032748994,0.5348829],"study_design_scores_gemma":[0.00015927019,0.00027947332,0.000013369437,0.0007792264,0.000013956563,0.000038489437,5.214996e-7,0.33586818,0.0051555648,0.6542441,0.0026739466,0.00077389716],"about_ca_topic_score_codex":0.000026761807,"about_ca_topic_score_gemma":0.000060556617,"teacher_disagreement_score":0.534109,"about_ca_system_score_codex":0.00035122153,"about_ca_system_score_gemma":0.001309801,"threshold_uncertainty_score":0.9996807},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005231032,0.00029659976,0.98983395,0.00036185468,0.0039943997,0.00032318188,0.00001843558,0.00016251836,0.0044859475],"genre_scores_gemma":[0.8032535,0.00004771348,0.1948452,0.0011303568,0.0005138824,0.000011511788,0.000032146025,0.000019170497,0.00014656635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700254,0.000040053168,0.0007555467,0.00080584706,0.0010186817,0.00037735692],"domain_scores_gemma":[0.9971919,0.0007133732,0.0006012203,0.0010157073,0.00038293854,0.00009487922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008291951,0.0003824962,0.0004767287,0.001093115,0.00022556563,0.0005921762,0.001944036,0.0003738799,0.000019562855],"category_scores_gemma":[0.00023353552,0.00037963418,0.00014681098,0.0006696118,0.00030038488,0.0016415232,0.0006503437,0.0007435281,0.000026236845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016907585,0.000028696597,0.000022581104,0.000048058875,0.000017339267,0.000007719994,0.0018598721,0.05248707,0.00049348734,0.012279284,0.000072356524,0.9326666],"study_design_scores_gemma":[0.00044548814,0.00014617218,0.0002618205,0.00086280436,0.000019121508,0.000019855328,0.0000010616566,0.926307,0.008963418,0.059412614,0.0030039481,0.0005566995],"about_ca_topic_score_codex":0.00026631413,"about_ca_topic_score_gemma":0.000088829576,"teacher_disagreement_score":0.93210995,"about_ca_system_score_codex":0.00035485582,"about_ca_system_score_gemma":0.00048922317,"threshold_uncertainty_score":0.99986553},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021209242,0.0006008282,0.97891355,0.008026256,0.0006852639,0.00079038006,0.000018562801,0.00012586314,0.010818062],"genre_scores_gemma":[0.7696892,0.0007683612,0.20711832,0.0062921247,0.0015713049,0.00012905757,0.0006538579,0.00009037913,0.013687419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975831,0.000029254172,0.00043638307,0.00071386475,0.00071873935,0.0005186892],"domain_scores_gemma":[0.99872303,0.000108350316,0.00013692146,0.0004983134,0.0003379018,0.00019546904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010218146,0.0002571694,0.00043672134,0.0009741098,0.00034025614,0.00020475108,0.00032269594,0.00016035611,0.000027382717],"category_scores_gemma":[0.00005742476,0.00022009,0.00010632635,0.0007814095,0.00012510267,0.0001399242,0.00042677062,0.0006045317,0.00002291204],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017983997,0.00005373861,0.00008938184,0.0009866179,0.000055058546,0.0000999999,0.00009519231,0.0026416718,0.000014662604,0.03095799,0.00036887967,0.9646188],"study_design_scores_gemma":[0.0034032646,0.0012505684,0.0028241384,0.011909729,0.00010951721,0.0005613917,0.000006628711,0.851215,0.0005078657,0.006034875,0.12095274,0.0012242794],"about_ca_topic_score_codex":0.00006146952,"about_ca_topic_score_gemma":0.000062811036,"teacher_disagreement_score":0.9633945,"about_ca_system_score_codex":0.0015385409,"about_ca_system_score_gemma":0.00065252546,"threshold_uncertainty_score":0.897501},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006335212,0.0011085307,0.9942761,0.00021930983,0.00039630503,0.00065248687,0.0000364182,0.00001891599,0.0026583988],"genre_scores_gemma":[0.17176422,0.00022095253,0.8205547,0.0037593853,0.0005853801,0.00016426989,0.00022021512,0.00009557212,0.0026353316],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99812615,0.000029641122,0.00025080758,0.0009812295,0.00017868588,0.00043345764],"domain_scores_gemma":[0.99880683,0.000084730746,0.00013978877,0.00070456293,0.00018868502,0.00007538081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033157293,0.00038222046,0.00038430333,0.0002097538,0.00012211806,0.00006264676,0.0008486446,0.00046796625,0.000011771311],"category_scores_gemma":[0.000055815744,0.00031511087,0.00012857615,0.000108822285,0.000441726,0.0000046697437,0.00029014854,0.00020037776,0.0000045007737],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059146347,0.00007389343,0.0002429424,0.00021768748,0.00018139365,0.000052339637,0.00004817606,0.003914634,0.46718553,0.051019672,0.00015932493,0.47631294],"study_design_scores_gemma":[0.0013550526,0.0030895562,0.000020525036,0.00054576766,0.00007052052,0.000053719243,2.0623692e-7,0.0034899132,0.6559542,0.29369625,0.040222026,0.0015022604],"about_ca_topic_score_codex":0.000011238958,"about_ca_topic_score_gemma":0.00005274775,"teacher_disagreement_score":0.4748107,"about_ca_system_score_codex":0.000026505893,"about_ca_system_score_gemma":0.0002453725,"threshold_uncertainty_score":0.9999301},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006828972,0.0003182996,0.99702215,0.00026885423,0.0004239784,0.0007194096,0.0000017981956,0.00023109515,0.00033150672],"genre_scores_gemma":[0.3013712,0.00006625253,0.6975555,0.00023946093,0.00032090262,0.00007167979,0.00003281903,0.000019252606,0.0003229595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973605,0.000036533318,0.00047400212,0.0013251846,0.00041669403,0.0003870747],"domain_scores_gemma":[0.99755484,0.00067266717,0.00040311555,0.0009364123,0.00036576224,0.000067209156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015422347,0.00031229982,0.0003000491,0.000360667,0.0010264001,0.00051341875,0.0015102369,0.00023516499,0.0000027311921],"category_scores_gemma":[0.00013782359,0.00032708916,0.000046428926,0.00062840065,0.00023248172,0.00093676004,0.001099758,0.00052811514,9.761741e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002541917,0.000003856179,0.000056777903,0.0000417352,0.0000051857733,3.3959526e-7,0.000039330007,0.21098948,0.00006377812,0.0041878955,0.0000021574263,0.78460693],"study_design_scores_gemma":[0.00017150443,0.00017147511,0.000497041,0.00028693356,0.000017611406,0.000022277984,6.7419523e-7,0.9852169,0.00083448546,0.012152503,0.00029781222,0.0003307407],"about_ca_topic_score_codex":0.000011475673,"about_ca_topic_score_gemma":0.00010942084,"teacher_disagreement_score":0.7842762,"about_ca_system_score_codex":0.00020752884,"about_ca_system_score_gemma":0.00022163184,"threshold_uncertainty_score":0.9999181},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009674622,0.001737187,0.9968917,0.00014462578,0.0002150322,0.00034855746,0.0000042300985,0.00012677956,0.00043518972],"genre_scores_gemma":[0.0153199695,0.000038509414,0.98341864,0.00040594614,0.00032202768,0.000017061,0.000004798994,0.000040756797,0.00043230673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889,0.00001095872,0.00015221527,0.000474347,0.000155816,0.0003166744],"domain_scores_gemma":[0.99933326,0.00037400943,0.00002906581,0.00015575072,0.000050120423,0.000057780348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023520963,0.00026233413,0.00026429427,0.0003044347,0.000121365105,0.00029326038,0.00025728115,0.00012391037,0.0000015564091],"category_scores_gemma":[0.000029293442,0.00023859991,0.000024159242,0.00022281165,0.00036503735,0.00010311497,0.000102826256,0.00036933334,3.317781e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047880753,0.0000026628277,0.0000035966793,0.00048452071,0.0000052221594,0.0000074495097,0.0005819358,0.15600859,0.001173746,0.000012808678,0.0002231536,0.8414915],"study_design_scores_gemma":[0.00019777786,0.000038613292,0.00001970916,0.0006261038,0.000014815515,0.00003400759,2.16439e-7,0.97060436,0.0031294376,0.02346701,0.0015353307,0.00033263932],"about_ca_topic_score_codex":0.0000013522805,"about_ca_topic_score_gemma":0.0000041523463,"teacher_disagreement_score":0.84115887,"about_ca_system_score_codex":0.000075649274,"about_ca_system_score_gemma":0.00021276441,"threshold_uncertainty_score":0.97298217},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032071053,0.00033736893,0.962631,0.023674738,0.002760428,0.00043164665,0.00004316982,0.0000826901,0.009718281],"genre_scores_gemma":[0.44924986,0.00029129875,0.13623323,0.103659004,0.0042197653,0.00012252606,0.0008285167,0.00033669127,0.30505908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980147,0.0000809003,0.00028932776,0.0008488088,0.00042732203,0.00033896964],"domain_scores_gemma":[0.9982063,0.0005742252,0.00023038608,0.0007285195,0.00017889423,0.00008167819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006681891,0.00033466986,0.00029912405,0.00034974658,0.0003082078,0.00031125007,0.0007782837,0.0003796962,0.00023131477],"category_scores_gemma":[0.0001433034,0.0002608983,0.00006310056,0.0003629893,0.00066687766,0.00019655678,0.00031654848,0.00076898164,0.00003561368],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001884555,0.000025137128,0.0018397974,0.000053522264,0.000055050758,0.000027302374,0.0022401826,0.0013181197,0.0000117573245,0.042112354,0.0074258484,0.9448721],"study_design_scores_gemma":[0.0011954666,0.00029338073,0.007971524,0.0006246724,0.00006466313,0.00013919585,0.000018493925,0.63673913,0.000065388405,0.12322975,0.22824879,0.0014095681],"about_ca_topic_score_codex":0.000044616634,"about_ca_topic_score_gemma":0.00028619403,"teacher_disagreement_score":0.9434625,"about_ca_system_score_codex":0.0002892706,"about_ca_system_score_gemma":0.00022138894,"threshold_uncertainty_score":0.9999843},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013824271,0.001794868,0.9419803,0.051065486,0.0024061843,0.001148105,0.000044422817,0.00091711624,0.00062970666],"genre_scores_gemma":[0.0095297,0.0004930977,0.9846572,0.00478287,0.00013906002,0.00006514775,0.000020223813,0.00003081028,0.0002818473],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936111,0.000074768475,0.0008152102,0.0029028615,0.000829664,0.0017663691],"domain_scores_gemma":[0.9857729,0.0023826356,0.00048740392,0.010959461,0.00022808697,0.00016948336],"candidate_categories":["metaresearch","metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0021595259,0.00072872086,0.00097525143,0.0010644946,0.00051984546,0.0005370317,0.049210366,0.0009420229,0.000019534287],"category_scores_gemma":[0.013248182,0.00067365484,0.00024353807,0.001184189,0.0010441446,0.00053674576,0.062160295,0.002427473,0.000017373413],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014307672,0.00004480554,0.000021596294,0.000112455775,0.00002311507,0.000020609836,0.000056819223,0.00049166335,0.0000060467323,0.15967616,0.0030986264,0.83643377],"study_design_scores_gemma":[0.0001282264,0.00031449387,0.00001800079,0.0004029092,0.0000038669364,0.000019152398,8.947189e-8,0.3680087,0.000055229484,0.6271493,0.0035008455,0.00039920452],"about_ca_topic_score_codex":0.000038358816,"about_ca_topic_score_gemma":0.00024888254,"teacher_disagreement_score":0.8360346,"about_ca_system_score_codex":0.0018045179,"about_ca_system_score_gemma":0.0026522276,"threshold_uncertainty_score":0.999874},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029316422,0.00056643406,0.9789159,0.0012149629,0.0023645868,0.0009753202,0.000014523311,0.00036094873,0.015294158],"genre_scores_gemma":[0.36498198,0.000057880043,0.620139,0.007904476,0.00069638423,0.000038308975,0.000010290939,0.000095867355,0.0060757706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99295145,0.00010445997,0.0008514909,0.0031054567,0.0017364932,0.0012506681],"domain_scores_gemma":[0.99523634,0.00055738626,0.000401524,0.0032740044,0.00022686987,0.00030386428],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021503896,0.0008927486,0.0009741016,0.0012196267,0.0005508459,0.001854436,0.0101246135,0.00053428527,0.000029516903],"category_scores_gemma":[0.00014821293,0.00083945337,0.00023726393,0.0007522134,0.00027096574,0.0011746703,0.006243452,0.0017125553,0.000036023484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027677814,0.00007727648,0.000026837677,0.000081592945,0.000032087562,0.00022597189,0.0035744994,0.34980485,0.00014127766,0.14874454,0.00009495816,0.49716842],"study_design_scores_gemma":[0.0008758709,0.0000982201,0.000007697624,0.0011168042,0.0000148205,0.000036899877,0.0000013981371,0.91942286,0.00070977444,0.07384085,0.002994784,0.000879998],"about_ca_topic_score_codex":0.0001754605,"about_ca_topic_score_gemma":0.00014169686,"teacher_disagreement_score":0.56961805,"about_ca_system_score_codex":0.0006599726,"about_ca_system_score_gemma":0.0008529013,"threshold_uncertainty_score":0.9994056},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003848532,0.004606972,0.95754987,0.0025345073,0.0016637396,0.00031057824,0.0000438223,0.00006471702,0.03318733],"genre_scores_gemma":[0.4889973,0.03407869,0.42959827,0.010866387,0.0032294854,0.00011584866,0.00006104847,0.00010327662,0.03294967],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960993,0.00006297185,0.00059853203,0.0013582611,0.0014235051,0.0004574076],"domain_scores_gemma":[0.9969599,0.0013787649,0.0002353573,0.0010305641,0.0002802855,0.00011507558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0042208917,0.00029984186,0.00042200173,0.00096897676,0.0004466028,0.00034687907,0.001439029,0.0001759884,0.000042553907],"category_scores_gemma":[0.000585557,0.00024745014,0.00006752128,0.0003976388,0.00087224034,0.00093819835,0.0019006613,0.00049125496,0.000035281926],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076624165,0.000011298464,0.00001548004,0.000028032313,0.000008041846,0.000006947248,0.0005490949,0.005216054,0.0000016483613,0.040074628,0.00033062705,0.9537505],"study_design_scores_gemma":[0.00032885055,0.0003746541,0.0023249255,0.0012145367,0.00003139963,0.0000309499,0.000020567893,0.346992,0.00005002898,0.5406549,0.10730065,0.0006765569],"about_ca_topic_score_codex":0.000010780862,"about_ca_topic_score_gemma":0.0003148217,"teacher_disagreement_score":0.9530739,"about_ca_system_score_codex":0.00016516514,"about_ca_system_score_gemma":0.00030595547,"threshold_uncertainty_score":0.9999978},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034458523,0.0008151281,0.8254941,0.0023220463,0.0087280935,0.0011537735,0.000009640204,0.000265164,0.15776621],"genre_scores_gemma":[0.9882604,0.00007062425,0.0101464465,0.0005386527,0.000355279,0.000008354839,0.000012444082,0.00000800706,0.00059977476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979843,0.000058091722,0.00045035096,0.00040938432,0.0006746548,0.00042324988],"domain_scores_gemma":[0.9987731,0.00037579046,0.00021872579,0.0003498762,0.00022262002,0.000059867707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017563086,0.00019899897,0.00025014853,0.0011257689,0.0003457608,0.0002908618,0.00083247584,0.00052330934,0.000017603605],"category_scores_gemma":[0.0007033354,0.00020493781,0.00004659348,0.0008570839,0.00070116855,0.00050752977,0.00017880627,0.00068433036,0.000023187276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001215457,0.000044550452,0.0065553263,0.00027900882,0.000022742783,0.00001843281,0.06683281,0.019261181,0.000027834165,0.3134005,0.00028679325,0.5932587],"study_design_scores_gemma":[0.0009768297,0.00015267234,0.0046898024,0.0026166593,0.000047973543,0.000031104035,0.0005845856,0.09448744,0.00064883655,0.85393363,0.039669335,0.0021611375],"about_ca_topic_score_codex":0.00050148356,"about_ca_topic_score_gemma":0.00049202074,"teacher_disagreement_score":0.9848146,"about_ca_system_score_codex":0.00064704416,"about_ca_system_score_gemma":0.0013742988,"threshold_uncertainty_score":0.83571213},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003905694,0.0010382616,0.98838913,0.0004061878,0.0044291294,0.00086035905,0.0000035855428,0.00008811131,0.0043946463],"genre_scores_gemma":[0.7973802,0.00012455617,0.19799855,0.001036862,0.0014548333,0.000033799693,0.000028316019,0.000046849967,0.0018959927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99463767,0.00014453457,0.0007593737,0.0014543597,0.0026143824,0.00038970134],"domain_scores_gemma":[0.99622375,0.00043989375,0.00044910485,0.0017980972,0.001005324,0.00008380308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035822887,0.000399484,0.00049671234,0.0010814947,0.0001570803,0.000342773,0.0021211887,0.00034987254,0.000012230563],"category_scores_gemma":[0.00041965448,0.0003746187,0.000108471075,0.00078355323,0.00018738591,0.0003681829,0.0006253265,0.00054607354,0.000010261324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051260854,0.000017171637,0.0000031910038,0.000037428534,0.000011234614,0.0000035827263,0.0002098743,0.5753041,0.00038448922,0.022868387,0.000032097698,0.4011233],"study_design_scores_gemma":[0.00031688018,0.00007270806,0.000009918348,0.0010164264,0.000023825316,0.0000058496616,1.888116e-7,0.98067284,0.002248924,0.015162912,0.00016745992,0.00030209523],"about_ca_topic_score_codex":0.000015666312,"about_ca_topic_score_gemma":0.000018316534,"teacher_disagreement_score":0.7969897,"about_ca_system_score_codex":0.0007438128,"about_ca_system_score_gemma":0.0011533707,"threshold_uncertainty_score":0.9998706},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002701231,0.0028539763,0.5683998,0.013033587,0.0022206863,0.00096921687,0.000047559133,0.00007276006,0.4121323],"genre_scores_gemma":[0.9282229,0.00021558026,0.017529443,0.022947585,0.0014239284,0.00019396983,0.000029251882,0.000054726792,0.029382631],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981544,0.000050945928,0.00031889268,0.00076401274,0.00031217956,0.00039959466],"domain_scores_gemma":[0.99829686,0.0006187751,0.00009934305,0.00090362626,0.000046118592,0.00003528477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006944527,0.00027568633,0.00030745895,0.00031970037,0.00027735333,0.00009261463,0.0014448197,0.00017789863,0.0003121567],"category_scores_gemma":[0.0000396537,0.00019419355,0.00008130806,0.00049022667,0.00045046897,0.000023803195,0.00042036513,0.00100518,0.00014724964],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013318861,0.00012423839,0.0008571648,0.000032491585,0.000035635137,0.0001032293,0.007775522,0.00093084224,0.000013985219,0.38138625,0.006314031,0.6024133],"study_design_scores_gemma":[0.0012363099,0.00026180042,0.01909847,0.0006361791,0.000065461405,0.00007451519,0.000028350072,0.012425727,0.000042395546,0.2767222,0.6879535,0.0014551101],"about_ca_topic_score_codex":0.00018346455,"about_ca_topic_score_gemma":0.00085163495,"teacher_disagreement_score":0.92795277,"about_ca_system_score_codex":0.000082895174,"about_ca_system_score_gemma":0.00009923652,"threshold_uncertainty_score":0.7918983},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009735353,0.0018340014,0.97953737,0.0035310872,0.0019502984,0.00020060228,0.000019229592,0.0001377546,0.012692318],"genre_scores_gemma":[0.12952182,0.0010556257,0.5452006,0.014001888,0.004478525,0.000057657482,0.00008857017,0.00015191777,0.30544338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99550456,0.00007783557,0.0005208355,0.0017906943,0.0012137129,0.00089237595],"domain_scores_gemma":[0.99463433,0.0019147086,0.00019542397,0.0028275377,0.00024501875,0.00018297228],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016252733,0.0005227107,0.00051080843,0.00075195305,0.0014204808,0.0015787743,0.00756549,0.00032465011,0.00007852028],"category_scores_gemma":[0.00014817204,0.00036898223,0.000230658,0.0011719652,0.00095766,0.00042380043,0.0048778895,0.001155894,0.00009334458],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050374565,0.000012541119,0.00003893618,0.00003106734,0.000042270378,0.000069637106,0.0006872709,0.0038208338,0.000042244617,0.0231595,0.002846724,0.96924394],"study_design_scores_gemma":[0.00042310875,0.00013048758,0.00026376572,0.0008092137,0.000038093363,0.00009610298,0.0000027743306,0.67944336,0.0020353463,0.0742529,0.24095398,0.0015508438],"about_ca_topic_score_codex":0.000018147693,"about_ca_topic_score_gemma":0.0010875181,"teacher_disagreement_score":0.9676931,"about_ca_system_score_codex":0.00035553236,"about_ca_system_score_gemma":0.00073189155,"threshold_uncertainty_score":0.99987954},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039826118,0.00035796798,0.98586845,0.0008745006,0.0024166857,0.0014405561,0.000005347881,0.00031931925,0.008677371],"genre_scores_gemma":[0.6308904,0.00005766583,0.3653047,0.002105419,0.0004155928,0.00015602993,0.000012798812,0.000044616758,0.0010127346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613786,0.00010497333,0.00067729026,0.001568195,0.00081124,0.0007004201],"domain_scores_gemma":[0.9976303,0.00037114232,0.00032565137,0.001295773,0.00024578642,0.00013136087],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013669537,0.0005741242,0.0007365207,0.0013024062,0.0003911796,0.0007793509,0.0037240286,0.00043668036,0.000007946726],"category_scores_gemma":[0.00005212204,0.0005028479,0.00015748649,0.0008026994,0.00023242089,0.00073696586,0.002889313,0.0009763945,0.000009790024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004360126,0.00020375,0.0033325742,0.001055371,0.00006503967,0.00038031585,0.003530877,0.06478329,0.00005335175,0.092528954,0.0018693337,0.83215356],"study_design_scores_gemma":[0.0005149059,0.000213566,0.00013996946,0.002578171,0.000007408656,0.000027793592,0.0000011594607,0.9609878,0.00041718295,0.027883401,0.006235813,0.0009928435],"about_ca_topic_score_codex":0.00039900275,"about_ca_topic_score_gemma":0.00013787665,"teacher_disagreement_score":0.8962045,"about_ca_system_score_codex":0.0008145667,"about_ca_system_score_gemma":0.00049192616,"threshold_uncertainty_score":0.9997423},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000881955,0.00056974235,0.9910708,0.0030429119,0.0022630058,0.00060453,0.000013687712,0.00015958771,0.0013937601],"genre_scores_gemma":[0.06799356,0.000051638246,0.9160896,0.013247747,0.00056163693,0.000021760332,0.000005433355,0.00003710037,0.0019915209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949593,0.000044790842,0.00072051,0.0025228544,0.0010183252,0.0007342374],"domain_scores_gemma":[0.99674755,0.00042423944,0.0001884902,0.0021781903,0.0002616611,0.00019985113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006756089,0.0005491735,0.0006330279,0.0010405503,0.00013750546,0.0004783121,0.0042833816,0.00040377467,0.000030185078],"category_scores_gemma":[0.00028066227,0.00053139427,0.0000986621,0.0015075615,0.00019174172,0.0005044042,0.002124644,0.0009879171,0.000068036104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017844995,0.000035451118,0.00031293582,0.00004706538,0.000014973978,0.00024547396,0.002111185,0.050602704,0.0009874878,0.0099432515,0.00044347494,0.9352381],"study_design_scores_gemma":[0.0003728955,0.000079710735,0.00019600336,0.0010418601,0.000005021167,0.000007828233,1.1297985e-7,0.8892704,0.008490018,0.09224282,0.007434388,0.0008589335],"about_ca_topic_score_codex":0.00017401064,"about_ca_topic_score_gemma":0.0002300807,"teacher_disagreement_score":0.9343792,"about_ca_system_score_codex":0.00057304266,"about_ca_system_score_gemma":0.0009981599,"threshold_uncertainty_score":0.9997138},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026477226,0.0008841683,0.96975464,0.01114809,0.0049155643,0.0007347877,0.00001189909,0.00006397252,0.009839144],"genre_scores_gemma":[0.6168438,0.00009270242,0.3653105,0.015551691,0.00097177346,0.000013115459,0.0000033552385,0.00002886372,0.0011842136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932298,0.00022594865,0.0010354512,0.0025013112,0.0016712687,0.0013362286],"domain_scores_gemma":[0.9943272,0.0020894874,0.00030848169,0.0028100314,0.0003002278,0.00016460236],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002806334,0.000804385,0.0007470587,0.0010643798,0.00044876977,0.001250457,0.008685083,0.0005191049,0.000065834516],"category_scores_gemma":[0.00039179533,0.0006536574,0.00022601061,0.0017335048,0.0015912267,0.0008203227,0.002625729,0.0020945764,0.00016620237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079540805,0.00006891008,0.00042184847,0.0000993554,0.0000080056725,0.0003170815,0.0035618357,0.06703868,0.00006963402,0.2430052,0.000012112989,0.6853894],"study_design_scores_gemma":[0.00037882224,0.00013719357,0.0010448461,0.0014809815,0.000013018321,0.00021916708,0.0000023510095,0.9142138,0.0005544843,0.077702194,0.003490211,0.0007629483],"about_ca_topic_score_codex":0.0007513096,"about_ca_topic_score_gemma":0.001574617,"teacher_disagreement_score":0.8471751,"about_ca_system_score_codex":0.0005098886,"about_ca_system_score_gemma":0.0020989354,"threshold_uncertainty_score":0.9997863},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012124715,0.0031990844,0.98606145,0.0018262427,0.0016491497,0.00034440492,0.0000029930266,0.00025281362,0.006542594],"genre_scores_gemma":[0.15260881,0.0005445691,0.8418723,0.0031173048,0.00034710768,0.000015332704,0.0000046780146,0.000034892695,0.0014550162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959686,0.000029350731,0.00058959116,0.0019626995,0.00076203234,0.0006877599],"domain_scores_gemma":[0.99707174,0.00082903315,0.00021869809,0.0014873771,0.00021320042,0.00017994994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007695195,0.0006101241,0.00070117763,0.00079718,0.00038462164,0.00080921076,0.0030745468,0.00039369313,0.0000066390917],"category_scores_gemma":[0.00016492957,0.00053896336,0.00013127615,0.0005073132,0.00099481,0.0008582249,0.002089464,0.0007842718,0.000009807644],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009637033,0.000021544278,0.00007091985,0.00014036939,0.000021464815,0.00012940509,0.003052634,0.03880159,0.000029858056,0.14747116,0.00009432031,0.8101571],"study_design_scores_gemma":[0.00014656855,0.000049079405,0.00002429491,0.00038444097,0.000008934565,0.000025844789,5.638183e-7,0.5647458,0.00015766313,0.43324825,0.0007977242,0.00041083977],"about_ca_topic_score_codex":0.00012359879,"about_ca_topic_score_gemma":0.00020810626,"teacher_disagreement_score":0.80974627,"about_ca_system_score_codex":0.00020938565,"about_ca_system_score_gemma":0.000548769,"threshold_uncertainty_score":0.9997062},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006739201,0.0017917508,0.9877214,0.005817266,0.0015667031,0.0011242814,0.000004120638,0.00007422575,0.0018935589],"genre_scores_gemma":[0.017640172,0.00013961163,0.97776806,0.0028612714,0.0005293688,0.00010484816,0.0000035897824,0.000017809432,0.0009352868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705845,0.000052357944,0.0005029606,0.0012874109,0.00060604914,0.0004927786],"domain_scores_gemma":[0.9970704,0.0011861495,0.00023816724,0.0010917971,0.00031087716,0.00010263627],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020788366,0.00036387317,0.00037582903,0.00037389726,0.00050669984,0.00067321357,0.0022208178,0.00019474146,0.000006029445],"category_scores_gemma":[0.00023781479,0.00026718152,0.00010721387,0.00038837476,0.00031520773,0.0003174827,0.0011214283,0.00057019136,0.0000024520552],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013308083,0.0000071941545,0.000018440602,0.0001181227,0.000009912027,0.0000034508269,0.0010069696,0.007255124,0.000012775505,0.14283457,0.00020974396,0.84852237],"study_design_scores_gemma":[0.00011508571,0.00005559238,0.00003418994,0.0007652826,0.00001459529,0.00000818396,1.5404602e-7,0.5661646,0.00004895193,0.4225582,0.009943147,0.0002920128],"about_ca_topic_score_codex":0.000008775079,"about_ca_topic_score_gemma":0.000026700278,"teacher_disagreement_score":0.84823036,"about_ca_system_score_codex":0.00019464847,"about_ca_system_score_gemma":0.0004452236,"threshold_uncertainty_score":0.99997807},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17465931,0.00045399173,0.8211611,0.00010811854,0.0016884558,0.000515693,0.00001205546,0.00007963325,0.0013216523],"genre_scores_gemma":[0.98183674,0.000036701687,0.017389955,0.00017334103,0.00030966004,0.000002907986,0.0000021917149,0.000024416297,0.00022408164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99528754,0.000069518246,0.0010502064,0.0015468621,0.0012090954,0.0008367903],"domain_scores_gemma":[0.99628836,0.0014646443,0.00020615717,0.0016113757,0.00029955988,0.00012987453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017100354,0.0006057344,0.000646758,0.0009736372,0.00028879053,0.0005309993,0.0043708184,0.00043571685,0.0000074801333],"category_scores_gemma":[0.00048578938,0.00044811537,0.00033653973,0.0007982982,0.0008685172,0.00034628995,0.0010199082,0.0015147331,0.0000074195227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012904007,0.00007635985,0.0008984826,0.000033518023,0.000027518481,0.0001405837,0.0037115882,0.29577804,0.00036092062,0.006602636,0.0000025097513,0.6922388],"study_design_scores_gemma":[0.0009451756,0.00048039324,0.0016781653,0.0007537481,0.000006412538,0.000042653686,0.0000011737795,0.9511588,0.012752622,0.031457335,0.000041557618,0.00068192644],"about_ca_topic_score_codex":0.00028695643,"about_ca_topic_score_gemma":0.00028099923,"teacher_disagreement_score":0.8071774,"about_ca_system_score_codex":0.00070739037,"about_ca_system_score_gemma":0.0018894679,"threshold_uncertainty_score":0.99979705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011005683,0.0001698784,0.97844195,0.000869303,0.002585505,0.00050086994,0.0000019372915,0.00030403546,0.017115496],"genre_scores_gemma":[0.15593413,0.00017754399,0.8184835,0.007948184,0.0009570524,0.000015400252,0.000057037236,0.00009036477,0.016336806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960338,0.000043389326,0.0007150302,0.0011676252,0.0013366492,0.00070351054],"domain_scores_gemma":[0.9970862,0.00042636067,0.00042448894,0.0016008014,0.0003232884,0.00013883095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008299758,0.0005271964,0.0004743096,0.0011751356,0.00032306384,0.00081115233,0.0038264717,0.0003322302,0.000020944188],"category_scores_gemma":[0.00023542823,0.0004989911,0.0001449503,0.0010075443,0.00038872217,0.001230736,0.0018945287,0.0010528514,0.00006584527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007818333,0.000010046789,0.00001924222,0.00006809033,0.000010082972,0.000025633926,0.00037082745,0.7693766,0.00008259693,0.012222892,0.00025453698,0.21755168],"study_design_scores_gemma":[0.00026181596,0.00015852087,0.000032118798,0.00038657658,0.000008541737,0.000031731564,1.0810117e-7,0.98222244,0.0011223722,0.01195995,0.0033405684,0.00047523528],"about_ca_topic_score_codex":0.0000063551556,"about_ca_topic_score_gemma":0.0000065928593,"teacher_disagreement_score":0.21707644,"about_ca_system_score_codex":0.000572047,"about_ca_system_score_gemma":0.00048377604,"threshold_uncertainty_score":0.99974614},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000700837,0.0001357544,0.9958197,0.00021021444,0.00029679146,0.001936981,0.000021400607,0.00015765375,0.00072066556],"genre_scores_gemma":[0.6029146,0.00007541416,0.3959751,0.0005148631,0.00012129073,0.00015203521,0.000019077583,0.000039487455,0.0001881353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956118,0.00006550409,0.0007482046,0.0017905978,0.0008377446,0.00094617356],"domain_scores_gemma":[0.99766076,0.00066219067,0.00023433207,0.0009921591,0.00032790308,0.00012265104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012044302,0.00054003356,0.0006267848,0.0019939765,0.00016996799,0.00056834106,0.0027740954,0.0003733641,0.000003545432],"category_scores_gemma":[0.00021177818,0.0005261537,0.0001275268,0.0018743578,0.0005275005,0.0018221093,0.0008679005,0.000989336,0.0000021903186],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036079804,0.00007896226,0.0005338173,0.00016993906,0.000003677796,0.00009239516,0.0008755435,0.0048377197,0.00023482584,0.018251184,0.0000066231787,0.9748792],"study_design_scores_gemma":[0.00074545096,0.0007700636,0.0020613305,0.0007799042,0.000004687117,0.000010486793,0.0000012874699,0.5578964,0.011471734,0.42525253,0.00019666657,0.0008094865],"about_ca_topic_score_codex":0.00015124562,"about_ca_topic_score_gemma":0.00030033884,"teacher_disagreement_score":0.9740698,"about_ca_system_score_codex":0.00045178342,"about_ca_system_score_gemma":0.0008468137,"threshold_uncertainty_score":0.999719},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000110675064,0.0002539009,0.9974219,0.00007908159,0.00048155317,0.0005081263,0.000023497278,0.00015039777,0.0009708401],"genre_scores_gemma":[0.027847389,0.000012727902,0.97182477,0.00016576877,0.00006820372,0.000011017925,0.000008111226,0.000014761593,0.000047282716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969686,0.0000864192,0.00065056153,0.0011332615,0.0006408871,0.00052022235],"domain_scores_gemma":[0.9952293,0.0027097934,0.0005261195,0.0009490566,0.00047366985,0.00011204632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020557141,0.0004071537,0.0004795323,0.00040649297,0.00029927646,0.00032922177,0.001915162,0.00026672828,0.0000017572079],"category_scores_gemma":[0.0027287067,0.00039640046,0.000044658045,0.0013469084,0.00063103647,0.0007044735,0.001070916,0.00053868,0.0000019641705],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067434485,0.00002267959,0.000118102405,0.00010747039,0.000007922058,0.000007070203,0.00019633204,0.031536862,0.0022712082,0.013827021,0.000019317227,0.95187926],"study_design_scores_gemma":[0.00017543671,0.00022997464,0.00021217731,0.0006326407,0.000010110435,0.00003679571,2.3566098e-7,0.9072746,0.005360645,0.08559161,0.00010470391,0.00037107832],"about_ca_topic_score_codex":0.000095197196,"about_ca_topic_score_gemma":0.00000338883,"teacher_disagreement_score":0.95150816,"about_ca_system_score_codex":0.0003160847,"about_ca_system_score_gemma":0.0005709635,"threshold_uncertainty_score":0.9998488},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035348753,0.001216558,0.9944654,0.00051049236,0.00070391415,0.00051266793,0.0000077566265,0.00011335527,0.0021163728],"genre_scores_gemma":[0.3470997,0.000111706424,0.6516612,0.0006253951,0.00025242488,0.00002251211,0.000005813979,0.000019959562,0.00020130083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968169,0.000034261193,0.00061423366,0.0014362776,0.00041310894,0.00068525906],"domain_scores_gemma":[0.9976649,0.0009553603,0.00026190287,0.0008413019,0.00017396495,0.00010254284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001272245,0.0004130968,0.0005233206,0.0010655833,0.0004800677,0.00090152613,0.0020322322,0.0002894673,0.000002540904],"category_scores_gemma":[0.0002063496,0.00043238414,0.00010976849,0.00074791274,0.0004026017,0.0018213765,0.0017175872,0.00071044185,0.0000011844797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022932043,0.00004137469,0.0003384815,0.00027417313,0.000016796512,0.000012287811,0.005765209,0.1431004,0.000043251654,0.53680515,0.00003542433,0.3135445],"study_design_scores_gemma":[0.00019605759,0.000044548575,0.00004291847,0.00036658547,0.00000340396,0.000006618025,0.0000010048832,0.63973427,0.00041887196,0.35871553,0.00018529313,0.00028490796],"about_ca_topic_score_codex":0.000017374425,"about_ca_topic_score_gemma":0.00007707583,"teacher_disagreement_score":0.49663386,"about_ca_system_score_codex":0.0002339371,"about_ca_system_score_gemma":0.0007391291,"threshold_uncertainty_score":0.9998128},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095856667,0.00024589282,0.9937554,0.000030334812,0.0030153086,0.00070485903,0.000064319276,0.00029416915,0.00093113136],"genre_scores_gemma":[0.28214455,0.000014949802,0.71630275,0.00028684147,0.0008560029,0.00006649657,0.00002250182,0.00010465108,0.00020122596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778724,0.000023095352,0.0005943266,0.0007323126,0.00028373726,0.00057931175],"domain_scores_gemma":[0.9970021,0.0020966798,0.0001086141,0.0006178972,0.00010374945,0.00007092632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090713,0.0004900474,0.0006668165,0.0005907201,0.00011135116,0.00010573585,0.0006488082,0.00033419894,0.000029349623],"category_scores_gemma":[0.00027860655,0.0005238844,0.00015017572,0.00018237617,0.00011503718,0.00009363594,0.00025346933,0.0004845742,0.00000306182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004535396,0.0000064087467,0.000116661184,0.0008356088,0.000056591965,0.00006910678,0.00070823944,0.9210619,0.00035213056,0.0015543668,0.00002429546,0.0752102],"study_design_scores_gemma":[0.00021831167,0.000070144306,0.00002929751,0.0009134968,0.00003637741,0.0001667607,5.914653e-7,0.9866893,0.0033100175,0.004841891,0.00309801,0.0006257671],"about_ca_topic_score_codex":0.00004321171,"about_ca_topic_score_gemma":0.000040797324,"teacher_disagreement_score":0.28118598,"about_ca_system_score_codex":0.0007248658,"about_ca_system_score_gemma":0.00025448654,"threshold_uncertainty_score":0.9997213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051003636,0.0006295943,0.9699567,0.022492245,0.0021291375,0.003079985,0.000033027645,0.00028982415,0.00087943557],"genre_scores_gemma":[0.17813611,0.00015901323,0.77161443,0.0440049,0.0029212018,0.00074509036,0.00010365157,0.00020323934,0.0021123916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957079,0.000023929771,0.000685129,0.0018571782,0.0009122127,0.00081360305],"domain_scores_gemma":[0.9946498,0.003266421,0.00030216566,0.0010826788,0.000469847,0.00022903178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010021607,0.00067252765,0.0010140947,0.0010644272,0.0003261543,0.00024197272,0.0009416559,0.00052615756,0.00006086855],"category_scores_gemma":[0.0015509111,0.00061872153,0.00030658353,0.0005221503,0.00072672,0.0001816935,0.0005874409,0.0009199518,0.000017122813],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009574705,0.00027326663,0.0011956951,0.0016736021,0.00009714156,0.00013587382,0.0008716396,0.00832146,0.00045465014,0.0011271477,0.0012789664,0.98447484],"study_design_scores_gemma":[0.007441789,0.0022408771,0.007442358,0.023910439,0.00080009503,0.000115847455,0.0000021080139,0.72344697,0.016092498,0.05026278,0.16463847,0.0036057886],"about_ca_topic_score_codex":0.00013500405,"about_ca_topic_score_gemma":0.00015567835,"teacher_disagreement_score":0.980869,"about_ca_system_score_codex":0.00087699486,"about_ca_system_score_gemma":0.0015160608,"threshold_uncertainty_score":0.9996264},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011225799,0.0011029184,0.9934569,0.0010068951,0.002284492,0.0008287049,0.000010194672,0.00042954544,0.0008691298],"genre_scores_gemma":[0.03173898,0.000014716591,0.9661569,0.00076969696,0.00021962862,0.00003374999,0.0000102636695,0.000025385585,0.0010306615],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676776,0.00003390379,0.0006830936,0.0012571225,0.00071086537,0.0005472761],"domain_scores_gemma":[0.9971816,0.00065408973,0.0004540548,0.0011022415,0.00045723887,0.00015077891],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007486487,0.0004752143,0.0006541175,0.0011283866,0.00020568034,0.00036840298,0.002853342,0.0004443424,0.000008440666],"category_scores_gemma":[0.0006018822,0.00041300652,0.00017222109,0.00095513463,0.00054459757,0.00052296836,0.0008608682,0.00082265044,0.000004979087],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025968615,0.000040404695,0.000019766105,0.00021830546,0.000015828773,0.000028823124,0.0002438971,0.00061297737,0.0005221249,0.063578196,0.00027910457,0.9344146],"study_design_scores_gemma":[0.0002602708,0.00025441925,0.000025628133,0.0012249488,0.000015554586,0.00005408628,8.7278e-8,0.48549265,0.013339842,0.49828157,0.00056637434,0.00048457258],"about_ca_topic_score_codex":0.000029664912,"about_ca_topic_score_gemma":0.000043886597,"teacher_disagreement_score":0.93393004,"about_ca_system_score_codex":0.00032395666,"about_ca_system_score_gemma":0.0010001995,"threshold_uncertainty_score":0.99983215},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010512397,0.0004621274,0.992339,0.000433682,0.0017746658,0.0002993243,0.0000065505383,0.00015548228,0.004424033],"genre_scores_gemma":[0.46769217,0.0000139346475,0.5304101,0.0011177283,0.0005733709,0.000006130073,0.000019137326,0.000028156244,0.00013924818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99527806,0.000107461165,0.0008170736,0.0016092055,0.0011950413,0.0009931595],"domain_scores_gemma":[0.9959618,0.0010944563,0.0006118643,0.0018845227,0.00028889175,0.00015846135],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013298304,0.0006403819,0.0011867515,0.0021544548,0.0003502136,0.0002829994,0.005069911,0.00043149825,0.000037614052],"category_scores_gemma":[0.00022062351,0.0005938667,0.00048640027,0.0039019908,0.00072967017,0.00060774223,0.0036159959,0.0017685487,0.0000030067295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072489142,0.000008937194,0.0002504856,0.000028526614,0.00009988212,0.00002595998,0.00052641367,0.6669085,0.000002420069,0.020253694,0.000003974602,0.31188396],"study_design_scores_gemma":[0.00016492946,0.00007665679,0.0003987307,0.000118258155,0.00015739563,0.000011187861,1.361702e-7,0.9094684,0.000030330382,0.0888629,0.00024289562,0.00046816727],"about_ca_topic_score_codex":0.00004573444,"about_ca_topic_score_gemma":0.0003587155,"teacher_disagreement_score":0.46758702,"about_ca_system_score_codex":0.00021592618,"about_ca_system_score_gemma":0.00034483205,"threshold_uncertainty_score":0.99965125},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000613367,0.00014819564,0.9961878,0.00037910027,0.0020564243,0.00065862905,0.0000033687131,0.0003706159,0.00018970936],"genre_scores_gemma":[0.08351884,0.000008156149,0.91571295,0.00038648964,0.0002466073,0.000021981152,0.000032250042,0.000022069922,0.00005062892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970507,0.000081570484,0.00068143394,0.0010921663,0.000551607,0.00054254034],"domain_scores_gemma":[0.9969207,0.0009825638,0.0006014935,0.0009885516,0.00043221563,0.00007446483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00125645,0.00040278645,0.00056474,0.0006922553,0.00027172157,0.00021365141,0.0024782605,0.000374413,0.0000054832426],"category_scores_gemma":[0.00030130963,0.00039433787,0.00014293584,0.0007948107,0.00023664837,0.0007630798,0.0009081735,0.0005430121,9.541459e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010190897,0.000006689724,0.0000071518753,0.000034770932,0.000007091213,0.000001797062,0.000121621946,0.5917231,0.00001412191,0.045436725,0.000005178432,0.36263156],"study_design_scores_gemma":[0.0003653736,0.00011604445,0.000094623705,0.00012229793,0.000017508439,0.000008515998,1.14317274e-7,0.9667096,0.00014075635,0.032004125,0.0000902626,0.00033073474],"about_ca_topic_score_codex":0.000031402116,"about_ca_topic_score_gemma":0.000027179212,"teacher_disagreement_score":0.37498653,"about_ca_system_score_codex":0.00019769935,"about_ca_system_score_gemma":0.00022810501,"threshold_uncertainty_score":0.99985087},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014491202,0.0010131276,0.9951561,0.00002158065,0.0006769335,0.00022114701,0.0000030321837,0.00019903884,0.0012599074],"genre_scores_gemma":[0.9080929,0.00006112969,0.09168314,0.000012519602,0.00007771699,0.0000029035848,0.0000025957813,0.000017968241,0.000049078382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989714,0.0000036951874,0.0003087104,0.00027720185,0.00022105745,0.00021790878],"domain_scores_gemma":[0.9994027,0.00007631416,0.00008063392,0.00034610584,0.0000725764,0.000021640106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025217974,0.00020126005,0.00027675452,0.00041292942,0.00006204258,0.00004183592,0.0004929014,0.00023651336,0.000003607972],"category_scores_gemma":[0.000022680008,0.00017111943,0.00005357026,0.00021623698,0.00018768896,0.00016552393,0.000095151416,0.00026542647,5.605901e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045794004,0.00000555509,0.000019817382,0.0004610701,0.000011810842,0.000004322605,0.000291133,0.1861804,0.016049787,0.006145334,0.0000026980867,0.7908235],"study_design_scores_gemma":[0.000079461184,0.00002410401,0.000020013656,0.0010084548,0.0000072918283,0.000005727457,3.0606228e-7,0.9677916,0.022714015,0.007704663,0.00046421547,0.00018014321],"about_ca_topic_score_codex":0.000012224305,"about_ca_topic_score_gemma":0.0000072463035,"teacher_disagreement_score":0.9066438,"about_ca_system_score_codex":0.00009749276,"about_ca_system_score_gemma":0.000103963146,"threshold_uncertainty_score":0.6978048},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015558234,0.00028829684,0.9934646,0.00017210338,0.00046455025,0.0007620686,0.000014294943,0.0001294739,0.004549016],"genre_scores_gemma":[0.10462806,0.000019089804,0.89378935,0.0012570403,0.00015078037,0.00004692312,0.000018385368,0.000016595939,0.00007379718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972272,0.000034952613,0.00051980495,0.0010404788,0.0005009116,0.0006766527],"domain_scores_gemma":[0.9983476,0.0004974661,0.00022895503,0.000655961,0.00016643209,0.00010363407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011136812,0.0004412852,0.00048762897,0.0009533973,0.00036332576,0.00059328007,0.0016143539,0.00032042468,0.0000021331334],"category_scores_gemma":[0.0002116446,0.00041652375,0.00010864373,0.0005642027,0.00032190478,0.001135409,0.0014018286,0.0009289058,9.03901e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001934978,0.00003505803,0.00013024491,0.0005182939,0.000012378135,0.000009378422,0.014571638,0.01887869,0.000009027593,0.065712556,0.000011966643,0.9000914],"study_design_scores_gemma":[0.00066485885,0.00011003673,0.00013983429,0.0004691903,0.0000063561934,0.00004970566,0.0000038086937,0.7686587,0.00041270308,0.22818,0.0006283733,0.00067644933],"about_ca_topic_score_codex":0.000021402822,"about_ca_topic_score_gemma":0.000072583214,"teacher_disagreement_score":0.89941496,"about_ca_system_score_codex":0.00019712915,"about_ca_system_score_gemma":0.00046943073,"threshold_uncertainty_score":0.99982864},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28570202,0.016103085,0.62987924,0.033773623,0.007411911,0.012315546,0.00022549726,0.0009757928,0.013613289],"genre_scores_gemma":[0.9088394,0.00036650317,0.06994006,0.003404201,0.0056982264,0.00019037955,0.00010997879,0.000011190157,0.011440041],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822015,0.00001173737,0.00026871907,0.00074347755,0.000243718,0.0005121987],"domain_scores_gemma":[0.999018,0.00056580117,0.000091246126,0.00008387073,0.00017481254,0.00006626842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046433508,0.0002969252,0.00034868577,0.00005579314,0.0003262134,0.00028323257,0.0005040842,0.00026924763,0.000008739555],"category_scores_gemma":[0.00007382612,0.00012150112,0.00011333967,0.00041693475,0.00020399291,0.00016221449,0.0004049477,0.00044680087,8.565319e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020011354,0.000040921528,0.0065364647,0.00020170311,0.000016600206,0.00002282385,0.0011768251,0.00084052095,0.0058875955,0.0073317084,0.00076353725,0.9771613],"study_design_scores_gemma":[0.0023746942,0.0024704442,0.031446997,0.0077127274,0.00013170954,0.00008641133,0.0005669615,0.10884474,0.030530997,0.5529088,0.25651446,0.0064110677],"about_ca_topic_score_codex":0.00020401596,"about_ca_topic_score_gemma":0.000557541,"teacher_disagreement_score":0.9707502,"about_ca_system_score_codex":0.00013639183,"about_ca_system_score_gemma":0.000060918213,"threshold_uncertainty_score":0.4954672},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006740873,0.00018128299,0.95841134,0.009703127,0.005636696,0.00025790182,0.000017933598,0.000103894745,0.025620446],"genre_scores_gemma":[0.8636602,0.00013695013,0.0790017,0.0048800823,0.015510804,0.000033495216,0.00010828362,0.00009232125,0.036576126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986721,0.000013931777,0.0002908273,0.0005312833,0.00029836144,0.00019343947],"domain_scores_gemma":[0.99861115,0.00047229513,0.00014413778,0.00032776326,0.00039618567,0.000048476337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002542825,0.00022192803,0.00021649344,0.00042786368,0.0004678081,0.00049510755,0.00028339654,0.00010873701,0.00015104476],"category_scores_gemma":[0.0005965724,0.00020859018,0.000036680343,0.00006598392,0.0006730358,0.00016952348,0.0001551769,0.00028751933,0.00001814217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019075167,0.000011608125,0.00013107956,0.00004741643,0.0000116534975,0.0000026303355,0.0054001394,0.0007372633,0.0000031330342,0.9056598,0.00007406802,0.08791929],"study_design_scores_gemma":[0.00013514662,0.000040523424,0.0004961501,0.00042456258,0.000037300226,0.0000042769757,0.0000022444199,0.037866835,0.000016225777,0.9371158,0.023549119,0.00031180386],"about_ca_topic_score_codex":0.0006321268,"about_ca_topic_score_gemma":0.0046766265,"teacher_disagreement_score":0.8794096,"about_ca_system_score_codex":0.0001182161,"about_ca_system_score_gemma":0.0001998396,"threshold_uncertainty_score":0.8506061},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020180561,0.0005037881,0.9921686,0.0012962037,0.001608807,0.0013436982,0.000012481795,0.002665508,0.0003807503],"genre_scores_gemma":[0.06165292,0.000009676617,0.93001556,0.0065704277,0.0007360738,0.00008328715,0.000008820278,0.000056924586,0.0008662979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958954,0.00007008553,0.00058050186,0.0018543823,0.0008070148,0.0007926536],"domain_scores_gemma":[0.98654914,0.0095390575,0.00040521214,0.0029438045,0.00041855135,0.00014426548],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002039093,0.0006108902,0.00057166145,0.0004369034,0.0010250116,0.0036166261,0.009689765,0.00074959,0.000027863603],"category_scores_gemma":[0.002013312,0.00046945535,0.00016955174,0.00074482313,0.000686463,0.0009341549,0.0038110423,0.0014138242,0.000010506401],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012681654,0.000029055307,0.00015993422,0.00003479655,0.000015187089,0.00000793,0.0018094917,0.17432535,0.0000026543728,0.040345654,0.0001460744,0.7831112],"study_design_scores_gemma":[0.00008667388,0.000092468115,0.00011194642,0.00050264876,0.0000101445285,0.000005573034,1.9445385e-7,0.5012276,0.00008490446,0.49641624,0.0010990357,0.00036257965],"about_ca_topic_score_codex":0.00013897358,"about_ca_topic_score_gemma":0.000028614404,"teacher_disagreement_score":0.78274864,"about_ca_system_score_codex":0.00024898324,"about_ca_system_score_gemma":0.0005952957,"threshold_uncertainty_score":0.9997757},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015260578,0.00033009186,0.9915677,0.0021830506,0.0037176183,0.00074184063,0.000013368091,0.00026413804,0.0011806737],"genre_scores_gemma":[0.0039272048,0.000005503028,0.99132335,0.0028809654,0.000378091,0.00003096083,0.00001535294,0.000031719126,0.0014068611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556524,0.000038548373,0.00060791464,0.0019575772,0.0009947994,0.000835906],"domain_scores_gemma":[0.9962177,0.0012082391,0.00031304665,0.0017209098,0.00036208172,0.00017801485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011613508,0.0006099133,0.00063785946,0.0010665677,0.000362247,0.0006070517,0.004190464,0.00043536667,0.000007499329],"category_scores_gemma":[0.00020217252,0.0005680094,0.0002480382,0.00067804847,0.00042717712,0.00044497667,0.000998427,0.00068647723,0.000030273835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006956551,0.000032776337,0.0000137349125,0.00007423465,0.0000102007125,0.000041723026,0.00011201098,0.41917813,0.000090844005,0.007212968,0.00031839652,0.57290804],"study_design_scores_gemma":[0.0004344571,0.0002391168,0.00006869164,0.0008111453,0.000011042164,0.000012108924,3.3067582e-8,0.9439633,0.00077644916,0.051255696,0.0018483081,0.0005796916],"about_ca_topic_score_codex":0.000011152547,"about_ca_topic_score_gemma":0.000008532957,"teacher_disagreement_score":0.5723283,"about_ca_system_score_codex":0.00040337525,"about_ca_system_score_gemma":0.0014382123,"threshold_uncertainty_score":0.9996771},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019527363,0.00018401127,0.9728476,0.0006170472,0.0050731353,0.00061114033,0.00003198127,0.00004096003,0.0010667699],"genre_scores_gemma":[0.9850268,0.0000056668455,0.011086354,0.0021299561,0.00059132423,0.000019484889,0.000018665316,0.000013666224,0.0011081106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983486,0.000027612301,0.00027276963,0.00085703895,0.00022565835,0.0002682999],"domain_scores_gemma":[0.9988676,0.00042418804,0.00015477749,0.00038790403,0.000101581594,0.0000639709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023991044,0.00023416254,0.00022481872,0.00042611084,0.00025305164,0.00022086214,0.00032178275,0.0001808838,0.000052782747],"category_scores_gemma":[0.00021323793,0.00022573757,0.000034489294,0.00021612276,0.00041041014,0.00016469044,0.00010803321,0.0002985927,0.0000029005841],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013332672,0.000022518327,0.00061856076,0.000040195042,0.0000037744078,0.0000064339465,0.0013651779,0.0015288454,0.0055904943,0.011650445,0.0001572296,0.979003],"study_design_scores_gemma":[0.000989297,0.00069194584,0.011839609,0.00028547618,0.00005506154,0.00017818768,0.0000027165336,0.93379414,0.004926736,0.041522145,0.0045745294,0.001140155],"about_ca_topic_score_codex":0.000014130835,"about_ca_topic_score_gemma":0.00018125249,"teacher_disagreement_score":0.97786283,"about_ca_system_score_codex":0.000103866805,"about_ca_system_score_gemma":0.00019755602,"threshold_uncertainty_score":0.92053115},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000077234276,0.0017570003,0.9909385,0.0017592892,0.0036580926,0.0005503299,0.000011052111,0.00019464853,0.0010538801],"genre_scores_gemma":[0.06595986,0.00003447265,0.9285594,0.0014998515,0.0015463692,0.000032238597,0.000028901059,0.00003498292,0.0023038876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968165,0.000035868965,0.0004093869,0.0015684624,0.0006244491,0.00054534315],"domain_scores_gemma":[0.997768,0.0003019062,0.00021149515,0.0013876796,0.00022739955,0.00010354096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076194544,0.0004622144,0.00043991336,0.00076915394,0.00037308809,0.00041392146,0.002568286,0.00037495693,0.0000053429226],"category_scores_gemma":[0.000052908727,0.00044337104,0.00015170658,0.0003431939,0.00015194998,0.0007052067,0.0008164051,0.0007369033,0.000004470925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017917313,0.0000068749414,6.485356e-7,0.000045151406,0.000007066108,0.0000147016335,0.001214388,0.30427742,0.00039099946,0.037049953,0.00005259339,0.65693843],"study_design_scores_gemma":[0.00019323894,0.000047584246,0.0000018790504,0.00018768464,0.000008095233,0.000010038016,4.8879167e-7,0.9426566,0.00031294327,0.05501253,0.0011431259,0.0004258027],"about_ca_topic_score_codex":0.000009836821,"about_ca_topic_score_gemma":0.00021142345,"teacher_disagreement_score":0.6565126,"about_ca_system_score_codex":0.000422581,"about_ca_system_score_gemma":0.000682885,"threshold_uncertainty_score":0.9998018},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00417263,0.00062285503,0.97777927,0.00035405776,0.0011858785,0.0009067962,0.000024140169,0.000058570724,0.01489578],"genre_scores_gemma":[0.88185686,0.00027815648,0.11209431,0.0036498364,0.0007543237,0.00003882545,0.000045148812,0.00004423614,0.0012383257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711406,0.00016149008,0.0007110649,0.00090734893,0.00051003916,0.0005960011],"domain_scores_gemma":[0.9987941,0.00022761145,0.00028919833,0.00036914734,0.00019495805,0.00012503508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011878753,0.00038938,0.0006020025,0.00035735746,0.0010146428,0.00006178304,0.0004520609,0.0004590215,0.000019955778],"category_scores_gemma":[0.000017247681,0.00034642435,0.00010483885,0.00020231357,0.0004374409,0.00029543295,0.00034904105,0.0011065387,0.0000041501103],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007927601,0.00020482799,0.00053966884,0.0013431143,0.0001238924,0.000019673802,0.015492508,0.007736198,0.0074335258,0.08360449,0.00007217856,0.8833507],"study_design_scores_gemma":[0.001365915,0.00013232732,0.005894946,0.002362303,0.00007199545,0.000004637112,0.000016132497,0.5895603,0.00012326798,0.3990731,0.00044120697,0.00095393334],"about_ca_topic_score_codex":0.00019534967,"about_ca_topic_score_gemma":0.00050101697,"teacher_disagreement_score":0.8823967,"about_ca_system_score_codex":0.00054092123,"about_ca_system_score_gemma":0.0007227124,"threshold_uncertainty_score":0.9998988},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031989118,0.0008679052,0.991635,0.0008065401,0.00043392702,0.00066765834,0.000023416893,0.0001346948,0.0054276595],"genre_scores_gemma":[0.010944143,0.0000538282,0.98625016,0.00040194404,0.00031198762,0.00014267777,0.00006453843,0.00001344003,0.0018172798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719256,0.000040679606,0.000595606,0.0010814162,0.00071840314,0.00037130783],"domain_scores_gemma":[0.9973951,0.00056777755,0.0003318765,0.0011006175,0.00051271834,0.00009189453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037896566,0.00029790145,0.00038407446,0.0010182569,0.00028601504,0.000105683685,0.0026966583,0.00022754885,0.0000059188656],"category_scores_gemma":[0.000035624125,0.00030912823,0.00011981993,0.0026157505,0.00063834945,0.00041931437,0.0010039997,0.00045308948,0.000020676998],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015578257,0.0001456997,0.000045673147,0.00010728571,0.000012457276,0.0000032268788,0.0001754391,0.07903722,0.000035907928,0.07721653,0.0013548445,0.84186417],"study_design_scores_gemma":[0.00013654162,0.000042062213,0.00035719608,0.00017138965,0.00000700438,0.000014041681,1.3172316e-7,0.6144021,0.00012287924,0.37668166,0.0078019467,0.0002630317],"about_ca_topic_score_codex":0.000019121082,"about_ca_topic_score_gemma":0.000008787831,"teacher_disagreement_score":0.84160113,"about_ca_system_score_codex":0.00047070565,"about_ca_system_score_gemma":0.0026490162,"threshold_uncertainty_score":0.9999361},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045226872,0.0003952052,0.9918415,0.0005147487,0.0015157402,0.00064694905,0.00001132027,0.00022730273,0.004394954],"genre_scores_gemma":[0.026445117,0.000015598698,0.96869075,0.0012664535,0.00039337328,0.000042163298,0.000025251935,0.000045483925,0.0030757915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963909,0.00008650775,0.000517981,0.0016323115,0.0006888103,0.000683516],"domain_scores_gemma":[0.99572957,0.0026509294,0.0002933661,0.0008927446,0.00029161837,0.00014179817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015515225,0.00051060936,0.0005626294,0.0011774773,0.00035739594,0.00070318975,0.0030144174,0.00025440523,0.000009460191],"category_scores_gemma":[0.000644465,0.00051849725,0.00023102031,0.0008034877,0.00032760296,0.00038717003,0.0016922326,0.00081141427,0.0000185339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010785678,0.000020074736,0.000015610427,0.00010760186,0.000021600717,0.00007185669,0.0013294227,0.17871103,0.0004801305,0.048937228,0.00003281575,0.7702618],"study_design_scores_gemma":[0.00038594627,0.00016404988,0.000015072336,0.00050290796,0.000013053223,0.000026521813,7.7633604e-7,0.94069004,0.0037005458,0.05255858,0.0013182334,0.0006242518],"about_ca_topic_score_codex":0.0000152433395,"about_ca_topic_score_gemma":0.00002903536,"teacher_disagreement_score":0.7696376,"about_ca_system_score_codex":0.00039226274,"about_ca_system_score_gemma":0.001172293,"threshold_uncertainty_score":0.99972665},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079065315,0.00048758104,0.9190288,0.000046315883,0.00043716165,0.0003076571,0.0005098121,0.000011800562,0.000105563],"genre_scores_gemma":[0.962345,0.00041538934,0.03286227,0.00014296161,0.00011050488,0.0000041073877,0.0034088504,0.000039001232,0.0006719055],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998047,0.00004274797,0.0005410993,0.00083121314,0.00029870393,0.00023925687],"domain_scores_gemma":[0.9983612,0.000061792496,0.00033227395,0.000884057,0.00027889074,0.00008180646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019488849,0.00028213125,0.0003312124,0.00024903563,0.0000908042,0.000049006707,0.00088583166,0.00020105626,0.000006553394],"category_scores_gemma":[0.00011196164,0.00028871105,0.00009849032,0.00017002196,0.00043537797,0.000025597536,0.00034302459,0.00022577426,4.414537e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007066638,0.00019009116,0.0007888791,0.00023042248,0.000023978582,0.000004259142,0.00035023672,0.01375065,0.9472528,0.00003083558,0.00000401904,0.03730316],"study_design_scores_gemma":[0.00077330985,0.0003662342,0.00020853528,0.00047822506,0.00008383912,0.0000014913716,0.0000035698015,0.10847002,0.8868437,0.0005135053,0.0017525153,0.00050509773],"about_ca_topic_score_codex":0.000039363895,"about_ca_topic_score_gemma":0.000044032848,"teacher_disagreement_score":0.8861665,"about_ca_system_score_codex":0.000027557784,"about_ca_system_score_gemma":0.00036170936,"threshold_uncertainty_score":0.9999565},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007107323,0.00095538876,0.98995453,0.00007220658,0.0002693595,0.00017077483,0.000033448145,0.0000083781015,0.0014286152],"genre_scores_gemma":[0.83122957,0.00015094585,0.16754843,0.00038943734,0.00020110818,0.0000014032203,0.00017215643,0.000020544327,0.0002863738],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987136,0.000012489293,0.0002101606,0.0007092041,0.0001835659,0.00017094324],"domain_scores_gemma":[0.999052,0.00004832782,0.00011103811,0.00063641835,0.00011056154,0.000041690113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018419212,0.00022177723,0.00022453076,0.00013749817,0.00006031127,0.000057530197,0.0006044892,0.00021210173,0.0000021847452],"category_scores_gemma":[0.00003652289,0.00018278472,0.000027538192,0.00008426527,0.00041651184,0.000011814733,0.00035299917,0.00020932277,2.518919e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007725398,0.00007369405,0.00034903438,0.00010639677,0.000020417936,0.0000072587104,0.00018311343,0.0017480612,0.52097976,0.00013264749,0.000025094165,0.47629726],"study_design_scores_gemma":[0.0014810391,0.0015497851,0.00018007727,0.0014567341,0.00006654511,0.000042527274,0.0000018975835,0.14772691,0.8395301,0.002098523,0.0047559133,0.0011099584],"about_ca_topic_score_codex":0.00006918073,"about_ca_topic_score_gemma":0.0003744825,"teacher_disagreement_score":0.82412225,"about_ca_system_score_codex":0.000020987132,"about_ca_system_score_gemma":0.00021125827,"threshold_uncertainty_score":0.74537444},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080626307,0.000089928915,0.9925418,0.00010087806,0.0022807433,0.00023144794,0.000093092196,0.00017864078,0.0036772203],"genre_scores_gemma":[0.90329117,0.00007248183,0.094123,0.00075255707,0.0011616956,0.000024925295,0.000064436295,0.0000734042,0.0004363105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985268,0.000004933356,0.0002656041,0.0005624157,0.00031434963,0.00032585725],"domain_scores_gemma":[0.9994431,0.000047961516,0.00001563401,0.00034793996,0.000048024838,0.00009730536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000089973844,0.00031905514,0.00030652346,0.00029754904,0.00007496348,0.00019527752,0.00057657436,0.00023310879,0.0001266687],"category_scores_gemma":[0.000005219313,0.0003115498,0.000050613657,0.00013685653,0.00009543047,0.00016681838,0.00010753621,0.00027167605,0.000009367243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007005073,0.0000023215455,8.2131993e-7,0.000040600033,0.0000066980974,0.00000466361,0.00049307325,0.90881526,0.000058991573,0.0005348255,0.00002279226,0.09001296],"study_design_scores_gemma":[0.0001193822,0.000023766617,0.000007822547,0.0003015032,0.000012798842,0.0000011364301,9.870911e-8,0.9666356,0.017333258,0.013944926,0.0012243674,0.00039535319],"about_ca_topic_score_codex":0.00010228629,"about_ca_topic_score_gemma":0.00015683137,"teacher_disagreement_score":0.90248495,"about_ca_system_score_codex":0.00013023417,"about_ca_system_score_gemma":0.00010064255,"threshold_uncertainty_score":0.99993366},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032590553,0.00037866423,0.9915028,0.00080103904,0.0015902175,0.00042463472,0.000008054437,0.00025602165,0.0050059804],"genre_scores_gemma":[0.124693416,0.000094516545,0.8662847,0.0029996186,0.00071513857,0.000028816201,0.00009446174,0.000072429815,0.005016863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99510276,0.000081498205,0.0009358101,0.0019614757,0.0011588865,0.00075958535],"domain_scores_gemma":[0.99619406,0.00039082265,0.0004594565,0.0023439596,0.00041944394,0.00019222713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012907832,0.00064803974,0.00076547876,0.0017453864,0.00043264416,0.0008363807,0.0046463925,0.00040610344,0.000034498895],"category_scores_gemma":[0.0005913261,0.00062181335,0.00025714346,0.0018634489,0.0003565984,0.00095139147,0.0019073695,0.00066614425,0.000023652437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044626804,0.00004917779,0.0002233896,0.00007195853,0.000040162995,0.000067156114,0.0034272624,0.042085305,0.0008518685,0.026004998,0.000098948796,0.9270753],"study_design_scores_gemma":[0.0005255658,0.00007097295,0.0001577745,0.00047854712,0.000031079377,0.000017977787,9.453838e-7,0.9609655,0.0009701281,0.035491526,0.0005622272,0.0007277376],"about_ca_topic_score_codex":0.00012722526,"about_ca_topic_score_gemma":0.00054266275,"teacher_disagreement_score":0.92634755,"about_ca_system_score_codex":0.00036793674,"about_ca_system_score_gemma":0.0007772553,"threshold_uncertainty_score":0.9996233},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015544936,0.00042614603,0.98244596,0.0003837315,0.00032481854,0.0006097676,0.0000030201884,0.00007159547,0.00019001804],"genre_scores_gemma":[0.67980087,0.000023141878,0.3195191,0.00011886166,0.00022370607,0.000016864,0.00005587293,0.0000222656,0.00021932523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976523,0.000052047584,0.000397066,0.00096846826,0.00055713585,0.00037301047],"domain_scores_gemma":[0.9985751,0.00047581785,0.0002464874,0.00036332407,0.000260508,0.0000787721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093069783,0.0003366332,0.0005742263,0.00089949515,0.00026491613,0.00010143574,0.0002386331,0.00041999263,0.000008271391],"category_scores_gemma":[0.0010309254,0.00031139897,0.00023631286,0.0006894405,0.0002667193,0.00016988006,0.00018236936,0.0013335606,0.0000018341328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010528421,0.000097168144,0.003456243,0.00020697256,0.00009935603,0.00007162398,0.0012508708,0.42622077,0.017780693,0.001147702,8.890703e-7,0.5495624],"study_design_scores_gemma":[0.00071623013,0.00014236583,0.002778156,0.0021742804,0.00013887275,0.000021342714,0.0000018338314,0.98295397,0.0019192892,0.008858057,0.00002899093,0.00026663838],"about_ca_topic_score_codex":0.00017146402,"about_ca_topic_score_gemma":0.00009780144,"teacher_disagreement_score":0.6642559,"about_ca_system_score_codex":0.0005877631,"about_ca_system_score_gemma":0.0002509451,"threshold_uncertainty_score":0.99993384},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032929107,0.00071587774,0.9963214,0.00056261575,0.00051650894,0.001152168,0.000018551826,0.0001971922,0.0001863988],"genre_scores_gemma":[0.04770821,0.00002920004,0.9514767,0.0005219483,0.0001220229,0.00005919407,0.000008578655,0.000022921173,0.000051257666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611557,0.0000586593,0.00060714025,0.001962446,0.00062806846,0.000628119],"domain_scores_gemma":[0.9960594,0.0022477068,0.00028906882,0.0010826559,0.00020020733,0.00012091531],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016606974,0.0005017533,0.00061321724,0.00087725476,0.0002692322,0.0010496435,0.002115717,0.00037807217,0.000002106889],"category_scores_gemma":[0.0013451362,0.0004957379,0.00005832592,0.0005883566,0.00087911705,0.00064504764,0.002429885,0.00087477424,6.7569067e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000081241305,0.00002249398,0.00015754545,0.00023784871,0.000009668718,0.00003195549,0.0021679003,0.0035623976,0.000031105505,0.1575251,0.00003746038,0.8362084],"study_design_scores_gemma":[0.00024474287,0.00020246046,0.00018080068,0.0024706612,0.0000116979345,0.000033590055,9.542243e-7,0.52718866,0.00014408398,0.46902558,0.000059125086,0.0004376541],"about_ca_topic_score_codex":0.000052902593,"about_ca_topic_score_gemma":0.0001421546,"teacher_disagreement_score":0.8357707,"about_ca_system_score_codex":0.00020973495,"about_ca_system_score_gemma":0.0005252717,"threshold_uncertainty_score":0.99998736},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034295428,0.00021042224,0.9930667,0.00034216614,0.0016281124,0.00048745127,0.000005269992,0.00024154264,0.00058876397],"genre_scores_gemma":[0.42374304,0.0000068764466,0.57490766,0.001045159,0.00023950887,0.00000944793,0.0000065539784,0.000015655312,0.000026110269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996134,0.00010562647,0.00096343464,0.0012288574,0.0008832004,0.000684878],"domain_scores_gemma":[0.9966372,0.0011080555,0.00044761976,0.0014087342,0.0002818012,0.00011653665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017815015,0.0005241334,0.00053753064,0.0015677254,0.0004621649,0.0009863683,0.00301882,0.00040872823,0.000008516395],"category_scores_gemma":[0.0008052076,0.0005224553,0.00014534724,0.0013211913,0.00040992533,0.0011911937,0.0015898808,0.0015291211,0.000007543779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006091613,0.000019117908,0.00071683864,0.00013199671,0.0000064536443,0.0000113216865,0.0020047247,0.3119765,0.00003687791,0.0050004637,0.0000031606785,0.6800865],"study_design_scores_gemma":[0.00024570854,0.00004680751,0.00084793445,0.00077268755,0.000005125698,0.000036666388,9.606061e-7,0.88728404,0.00069519685,0.10913199,0.00033728092,0.0005956167],"about_ca_topic_score_codex":0.000113202404,"about_ca_topic_score_gemma":0.00017579399,"teacher_disagreement_score":0.67949086,"about_ca_system_score_codex":0.00063913106,"about_ca_system_score_gemma":0.00097013963,"threshold_uncertainty_score":0.9997227},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000094549185,0.0005475698,0.9826268,0.0006908199,0.0062288144,0.00022509535,0.000005537909,0.00022508221,0.009355733],"genre_scores_gemma":[0.20260787,0.00022783775,0.77316415,0.0052006165,0.009300389,0.000026731837,0.00013982134,0.00015660502,0.009175972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967695,0.000015022446,0.0004261323,0.0014696735,0.00059962925,0.0007200764],"domain_scores_gemma":[0.9979314,0.00050115277,0.00016705903,0.0010423709,0.0001826465,0.00017534012],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042201465,0.0005033033,0.0005033305,0.0006072313,0.00036142295,0.0017073733,0.0023964744,0.00027870003,0.0000027123651],"category_scores_gemma":[0.00013107799,0.00047239286,0.0000952847,0.0006717235,0.0005662462,0.0008611793,0.0027129087,0.00066466175,0.000022092747],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004140118,0.000020938804,0.00023516399,0.00007183993,0.000014895431,0.000087013184,0.0002840197,0.0015653033,0.000019007686,0.009561699,0.00087441766,0.98726153],"study_design_scores_gemma":[0.0004954961,0.00020799816,0.00043628732,0.0013371661,0.0000131453735,0.00012652637,1.8963516e-7,0.72331244,0.0006647642,0.21766517,0.054293893,0.0014469374],"about_ca_topic_score_codex":0.000012213028,"about_ca_topic_score_gemma":0.0000030882586,"teacher_disagreement_score":0.98581463,"about_ca_system_score_codex":0.00019315981,"about_ca_system_score_gemma":0.0005110747,"threshold_uncertainty_score":0.9997728},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000134069505,0.000319828,0.97916025,0.0014884756,0.00082053966,0.00052847766,0.0000027420974,0.0004512298,0.017215062],"genre_scores_gemma":[0.12707102,0.00020204177,0.86633265,0.0034762507,0.00045290252,0.00008622681,0.0000033936847,0.000034943016,0.002340582],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964626,0.000025773983,0.0006062647,0.0015837325,0.0006611472,0.0006605187],"domain_scores_gemma":[0.9974214,0.00034960362,0.00025539543,0.0015742163,0.00028437882,0.00011501907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045732575,0.0004911614,0.0004693204,0.00059124123,0.0006060058,0.00061182666,0.0028953657,0.00038003136,0.00003683959],"category_scores_gemma":[0.00007680984,0.00046681025,0.00015825249,0.0011109698,0.0006200408,0.0008529599,0.0016847157,0.00090923253,0.000059090013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030036103,0.000030259078,0.000016245698,0.000032350454,0.000008300754,0.000030556395,0.0005051619,0.007532436,0.00009118518,0.31180888,0.000119906304,0.6798217],"study_design_scores_gemma":[0.00007420372,0.00011274478,0.00001764775,0.0003802952,0.0000096864305,0.000042214375,7.620944e-7,0.30952945,0.011040089,0.66718507,0.0109891305,0.00061872066],"about_ca_topic_score_codex":0.00007435359,"about_ca_topic_score_gemma":0.00008341386,"teacher_disagreement_score":0.679203,"about_ca_system_score_codex":0.0004205549,"about_ca_system_score_gemma":0.00068089116,"threshold_uncertainty_score":0.9997784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012522282,0.0006991504,0.9826409,0.00058074645,0.004372145,0.0005362219,0.00015852934,0.0002410034,0.01064604],"genre_scores_gemma":[0.404743,0.00017789849,0.5900812,0.0028184988,0.0014420983,0.00003377975,0.00011818471,0.000072510375,0.0005128145],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949288,0.000064474065,0.0006808593,0.0026424294,0.00083208067,0.00085140346],"domain_scores_gemma":[0.9951695,0.0013918275,0.00032964104,0.002469274,0.00035595128,0.00028375833],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000560532,0.0008437943,0.0008709818,0.0012735392,0.00034582245,0.0010148787,0.0059628086,0.00051079434,0.00007107904],"category_scores_gemma":[0.00011692387,0.0008009513,0.00037298392,0.0012815442,0.0011534225,0.0011830666,0.0027102495,0.0014985898,0.0001529814],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053183452,0.00031186416,0.00010326213,0.00012440099,0.0001328325,0.00022166033,0.008500864,0.0013377798,0.00042804363,0.09520687,0.0025972591,0.890982],"study_design_scores_gemma":[0.0010488556,0.00037092352,0.00075867434,0.0019077641,0.00005560237,0.000024192748,0.0000010945172,0.36767265,0.0062064747,0.597867,0.022035507,0.0020512803],"about_ca_topic_score_codex":0.00013546129,"about_ca_topic_score_gemma":0.0004202788,"teacher_disagreement_score":0.8889307,"about_ca_system_score_codex":0.00030485814,"about_ca_system_score_gemma":0.00097260287,"threshold_uncertainty_score":0.9994441},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006693973,0.0043275743,0.7049008,0.0014227483,0.004867634,0.0006014323,0.0000072170596,0.0001079118,0.28369775],"genre_scores_gemma":[0.5264732,0.030543735,0.34069392,0.024287222,0.014835455,0.00033547272,0.00011874168,0.00031016156,0.06240206],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954906,0.00031291405,0.0006091616,0.0013724078,0.0010312631,0.0011836725],"domain_scores_gemma":[0.99736893,0.0013460412,0.00022648624,0.00060958805,0.000301329,0.00014765206],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016487165,0.00043792842,0.0006463796,0.0013076273,0.0004683551,0.00028521568,0.0029264055,0.0006421211,0.00013944198],"category_scores_gemma":[0.00083930674,0.00044961929,0.000115726325,0.0025798385,0.002859751,0.00055702555,0.0005430208,0.0013466034,0.000077952325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021950076,0.000102615035,0.0009203073,0.00015400631,0.0000068026284,0.00025687637,0.010272772,0.016683826,0.000010272958,0.21892072,0.0007496865,0.75190014],"study_design_scores_gemma":[0.00019412862,0.0001257068,0.00016396235,0.0007522711,0.000009442118,0.000006781832,0.000014118819,0.0073548965,0.0002133457,0.82167363,0.16870752,0.0007841912],"about_ca_topic_score_codex":0.00051955786,"about_ca_topic_score_gemma":0.019886192,"teacher_disagreement_score":0.751116,"about_ca_system_score_codex":0.0009878125,"about_ca_system_score_gemma":0.0058959792,"threshold_uncertainty_score":0.9998539},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006693973,0.0043275743,0.7049008,0.0014227483,0.004867634,0.0006014323,0.0000072170596,0.0001079118,0.28369775],"genre_scores_gemma":[0.5264732,0.030543735,0.34069392,0.024287222,0.014835455,0.00033547272,0.00011874168,0.00031016156,0.06240206],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954906,0.00031291405,0.0006091616,0.0013724078,0.0010312631,0.0011836725],"domain_scores_gemma":[0.99736893,0.0013460412,0.00022648624,0.00060958805,0.000301329,0.00014765206],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016487165,0.00043792842,0.0006463796,0.0013076273,0.0004683551,0.00028521568,0.0029264055,0.0006421211,0.00013944198],"category_scores_gemma":[0.00083930674,0.00044961929,0.000115726325,0.0025798385,0.002859751,0.00055702555,0.0005430208,0.0013466034,0.000077952325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021950076,0.000102615035,0.0009203073,0.00015400631,0.0000068026284,0.00025687637,0.010272772,0.016683826,0.000010272958,0.21892072,0.0007496865,0.75190014],"study_design_scores_gemma":[0.00019412862,0.0001257068,0.00016396235,0.0007522711,0.000009442118,0.000006781832,0.000014118819,0.0073548965,0.0002133457,0.82167363,0.16870752,0.0007841912],"about_ca_topic_score_codex":0.00051955786,"about_ca_topic_score_gemma":0.019886192,"teacher_disagreement_score":0.751116,"about_ca_system_score_codex":0.0009878125,"about_ca_system_score_gemma":0.0058959792,"threshold_uncertainty_score":0.9998539},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010575295,0.0011238293,0.99297136,0.00063184253,0.0010991591,0.00037900306,0.000032764216,0.00021472832,0.003441558],"genre_scores_gemma":[0.35475487,0.00025924592,0.6419514,0.0024457378,0.000354778,0.00000802873,0.0000493245,0.000031989573,0.0001446323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964887,0.00004377603,0.0004637919,0.0017176706,0.00073827757,0.0005477898],"domain_scores_gemma":[0.99710166,0.0012126153,0.00021764034,0.0010661414,0.00022262121,0.00017929719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064234814,0.0005369733,0.00052522897,0.0009948559,0.00035769804,0.0007788591,0.0021126044,0.0003641772,0.00001104381],"category_scores_gemma":[0.00012567242,0.0005121064,0.00011515173,0.0008712321,0.00064446474,0.00067727396,0.0017781184,0.0008488948,0.000010377325],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008604958,0.000033487086,0.00007409064,0.00011510641,0.000016928487,0.00018450888,0.0007583989,0.011270087,0.000026908689,0.13924117,0.000113114125,0.8481576],"study_design_scores_gemma":[0.00029293593,0.00011561547,0.00010772571,0.0003674173,0.000011847709,0.000059190377,2.1803812e-7,0.6657943,0.000120408586,0.32912472,0.0034184083,0.0005872289],"about_ca_topic_score_codex":0.000029791723,"about_ca_topic_score_gemma":0.00014724601,"teacher_disagreement_score":0.84757036,"about_ca_system_score_codex":0.00011698284,"about_ca_system_score_gemma":0.00038252748,"threshold_uncertainty_score":0.99973303},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048331774,0.00050066086,0.9917382,0.0017231267,0.00050174556,0.0014774927,0.00006163307,0.00019572323,0.003753081],"genre_scores_gemma":[0.06328543,0.00043855133,0.92361015,0.006721935,0.0010347298,0.00028099577,0.0002420839,0.00009884824,0.0042872843],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980558,0.0000059817116,0.00034946587,0.00088026776,0.0002800976,0.00042837995],"domain_scores_gemma":[0.99849004,0.00023727248,0.00013995587,0.00068779825,0.00032503277,0.00011990043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024211859,0.00033970943,0.00053492485,0.00038373913,0.00019480822,0.00008223288,0.00044631286,0.0001631277,0.000015656922],"category_scores_gemma":[0.000058265075,0.00030494278,0.00016488024,0.00031704965,0.00043715214,0.000099660065,0.00016807631,0.00046626836,0.000005693655],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051959894,0.000054000902,0.00009958036,0.00021866804,0.000022439406,0.000029998782,0.00014565606,0.003082834,0.0056260102,0.018205015,0.0012919244,0.9711719],"study_design_scores_gemma":[0.0023224868,0.000540684,0.00021742698,0.004757823,0.00030514746,0.000091042326,0.0000012148907,0.324357,0.12544897,0.32667434,0.213284,0.0019998606],"about_ca_topic_score_codex":0.000010246388,"about_ca_topic_score_gemma":0.0000060631505,"teacher_disagreement_score":0.96917206,"about_ca_system_score_codex":0.0002231848,"about_ca_system_score_gemma":0.00035180952,"threshold_uncertainty_score":0.9999403},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003242291,0.0006527054,0.9765952,0.0021795123,0.0009532609,0.00043496522,0.0000019078143,0.00012674958,0.01873142],"genre_scores_gemma":[0.8121857,0.00040886478,0.15559721,0.020511609,0.004491369,0.0000717762,0.00013115208,0.00014708871,0.006455217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984997,0.0000049933433,0.00027422994,0.00065091386,0.00031052306,0.0002596387],"domain_scores_gemma":[0.99890995,0.00048082916,0.00023446791,0.00017725662,0.0001804836,0.000016985587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065399695,0.00025703106,0.00025639878,0.0006855831,0.00043942328,0.0006804919,0.00040540242,0.00015222836,0.00007516448],"category_scores_gemma":[0.00028994665,0.00023373704,0.00006295674,0.00027300318,0.00016423341,0.00082209747,0.00032910882,0.00048806207,0.000007646232],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000379819,0.000024975507,0.0078088343,0.0004475623,0.000031326468,0.000011743089,0.0001341696,0.008923312,0.000026555834,0.027729377,0.00001778998,0.9548064],"study_design_scores_gemma":[0.0006048066,0.00002279282,0.00043998493,0.00030286965,0.000071517476,0.000005227167,8.5359795e-7,0.9241639,0.000022368802,0.03520221,0.038827438,0.00033605547],"about_ca_topic_score_codex":0.000119212185,"about_ca_topic_score_gemma":0.0010369694,"teacher_disagreement_score":0.95447034,"about_ca_system_score_codex":0.000025828791,"about_ca_system_score_gemma":0.00005620208,"threshold_uncertainty_score":0.95315194},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058866466,0.00042740625,0.9930356,0.0006870532,0.0031651559,0.0012459501,0.00019397597,0.00026593488,0.0009200613],"genre_scores_gemma":[0.014799016,0.00010975668,0.98268044,0.0012431327,0.0004093508,0.00004390925,0.00018812814,0.00004162218,0.00048462217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947219,0.00008525673,0.0008656713,0.002624763,0.00091201614,0.0007903782],"domain_scores_gemma":[0.9923158,0.0009764164,0.0005871594,0.005520133,0.00043145474,0.00016902752],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001668408,0.000667185,0.00065759587,0.0011309262,0.00038574342,0.0008923907,0.010428329,0.00045727735,0.000008213016],"category_scores_gemma":[0.00096588663,0.00064121827,0.00012121779,0.0011995389,0.00063165015,0.0015586315,0.0028011266,0.00090024015,0.00001726163],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013053998,0.000020813592,0.000020279831,0.0001300003,0.000018733208,0.000004642351,0.00052800507,0.0058995853,0.00038684654,0.068677135,0.000110321824,0.9241906],"study_design_scores_gemma":[0.00025264558,0.00010765358,0.00023188826,0.00032223295,0.0000191961,0.000016890468,1.8018466e-7,0.756495,0.0025282977,0.22558208,0.013770334,0.00067361223],"about_ca_topic_score_codex":0.000021781469,"about_ca_topic_score_gemma":0.000085452535,"teacher_disagreement_score":0.923517,"about_ca_system_score_codex":0.000355568,"about_ca_system_score_gemma":0.0010259071,"threshold_uncertainty_score":0.9996039},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018682818,0.0013455348,0.99709964,0.00014419862,0.00068781606,0.0005257647,0.000036205973,0.00011667349,0.000025515214],"genre_scores_gemma":[0.0022943253,0.00012018946,0.99730396,0.00007906669,0.000068583584,0.00004055183,0.0000059049853,0.000006828161,0.00008059065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834347,0.000028642422,0.00033442763,0.0007230913,0.00033956126,0.0002308078],"domain_scores_gemma":[0.9973582,0.0014237907,0.00018497212,0.000778445,0.00020988932,0.0000446816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008378939,0.00022690478,0.0005087296,0.0008939157,0.00012558154,0.00038209066,0.0012033562,0.00016776465,2.3347876e-7],"category_scores_gemma":[0.00004793225,0.00017111246,0.00007891493,0.0013351962,0.00052664895,0.0002622531,0.0006434824,0.00023504155,4.5080842e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011903032,0.000003798154,0.00010710461,0.0001111116,0.000085574546,0.0000012143204,0.00021603247,0.06800397,0.000013120129,0.032141477,0.000024751951,0.8992907],"study_design_scores_gemma":[0.00006935527,0.000048725313,0.0003044638,0.00019919458,0.00009558963,0.000012796576,7.9636756e-8,0.99061006,0.00015923615,0.0058910474,0.00244023,0.00016923214],"about_ca_topic_score_codex":0.000020800593,"about_ca_topic_score_gemma":0.0000069940793,"teacher_disagreement_score":0.9226061,"about_ca_system_score_codex":0.00010859819,"about_ca_system_score_gemma":0.00029617042,"threshold_uncertainty_score":0.6977764},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002626559,0.00040145402,0.9947306,0.00023434394,0.0021009399,0.0004134814,0.000018312126,0.00015920601,0.00167901],"genre_scores_gemma":[0.41633806,0.0000144515225,0.58259654,0.0004480221,0.00023317209,0.000008211131,0.000025214116,0.000015938993,0.0003204105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956176,0.000070517366,0.0006703764,0.0014930487,0.0015409769,0.0006074593],"domain_scores_gemma":[0.9962803,0.0008769418,0.0004587487,0.0010124317,0.0012149558,0.00015659608],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017025812,0.0004120439,0.00058514666,0.0015928666,0.00054129155,0.0009105943,0.0036161807,0.0002120357,0.000001964471],"category_scores_gemma":[0.0006385562,0.0003888928,0.000074026575,0.003470563,0.0021361145,0.00073185685,0.0019150655,0.0005013358,0.0000031097131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004522646,0.00004444629,0.00030128052,0.00038042106,0.000019089408,0.000016478576,0.0013792467,0.16187637,0.0001311708,0.031184256,0.000512979,0.80414975],"study_design_scores_gemma":[0.00035980565,0.0001497582,0.0017392717,0.00086661073,0.000013679951,0.000060436145,5.3332224e-7,0.7515535,0.000496156,0.24286857,0.0012742933,0.0006173847],"about_ca_topic_score_codex":0.000041942047,"about_ca_topic_score_gemma":0.000020563322,"teacher_disagreement_score":0.80353236,"about_ca_system_score_codex":0.00048936455,"about_ca_system_score_gemma":0.0058322093,"threshold_uncertainty_score":0.9998563},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010582615,0.00038243522,0.98989034,0.0005082532,0.0042851428,0.00080004253,0.0000057839034,0.00019504163,0.0039223903],"genre_scores_gemma":[0.8033059,0.000062421605,0.18803605,0.0030814165,0.0010751337,0.00005077213,0.000017014878,0.000054601427,0.00431669],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964362,0.000030475305,0.00054833235,0.0014642433,0.0008025522,0.0007182351],"domain_scores_gemma":[0.9974966,0.0005505211,0.00030957005,0.0012777626,0.00023730144,0.00012822526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009923072,0.0005040274,0.0005752917,0.00055116724,0.00032665278,0.0009993381,0.0032523402,0.0003370916,0.000006313457],"category_scores_gemma":[0.00005930324,0.00044346292,0.0001935487,0.00030450663,0.00020186411,0.00037757677,0.0013661796,0.0005532145,0.000027018252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026184562,0.000024175057,0.00007489586,0.0001945397,0.000019555033,0.00006888057,0.00062541023,0.004813376,0.000022757384,0.15418983,0.000051416944,0.83991253],"study_design_scores_gemma":[0.00046098218,0.00019329885,0.000030257646,0.00021589008,0.00001778847,0.00006640851,2.9709645e-7,0.22306408,0.0005979179,0.7644972,0.010026424,0.0008294406],"about_ca_topic_score_codex":0.000066484215,"about_ca_topic_score_gemma":0.00018018387,"teacher_disagreement_score":0.83908314,"about_ca_system_score_codex":0.00025320242,"about_ca_system_score_gemma":0.00048440302,"threshold_uncertainty_score":0.9998017},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014923258,0.0002570482,0.99033195,0.00093275646,0.00035035785,0.0011192036,0.00007684306,0.00013479826,0.0066478346],"genre_scores_gemma":[0.2877781,0.000043785174,0.6548699,0.0025477293,0.0005824923,0.00026655733,0.000048537113,0.00006493251,0.05379797],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99603987,0.00001971312,0.0008431993,0.0013438573,0.0013498008,0.00040356012],"domain_scores_gemma":[0.9920599,0.004927446,0.00042897646,0.0010369335,0.001439807,0.00010692576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018939628,0.00034406444,0.0005872202,0.0022293022,0.0003160739,0.00070453994,0.0024938537,0.00028813098,0.00020259868],"category_scores_gemma":[0.0028344367,0.00027284442,0.00017707636,0.0026085402,0.00048387636,0.0002616714,0.00049713824,0.0003209914,0.000057614077],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012766629,0.000034781053,0.000562318,0.00002470038,0.0000050354906,0.0000029699304,0.00008420709,0.0012014759,0.000037967868,0.003429324,0.0016367668,0.99296767],"study_design_scores_gemma":[0.00056577823,0.00028643743,0.00064182316,0.00039724988,0.000041534644,0.000021525364,7.396227e-7,0.16828784,0.0021848131,0.77936065,0.047239147,0.00097244716],"about_ca_topic_score_codex":0.000011933551,"about_ca_topic_score_gemma":0.000020239513,"teacher_disagreement_score":0.9919952,"about_ca_system_score_codex":0.00014716652,"about_ca_system_score_gemma":0.0007197683,"threshold_uncertainty_score":0.9999724},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018682818,0.0013455348,0.99709964,0.00014419862,0.00068781606,0.0005257647,0.000036205973,0.00011667349,0.000025515214],"genre_scores_gemma":[0.0022943253,0.00012018946,0.99730396,0.00007906669,0.000068583584,0.00004055183,0.0000059049853,0.000006828161,0.00008059065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834347,0.000028642422,0.00033442763,0.0007230913,0.00033956126,0.0002308078],"domain_scores_gemma":[0.9973582,0.0014237907,0.00018497212,0.000778445,0.00020988932,0.0000446816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008378939,0.00022690478,0.0005087296,0.0008939157,0.00012558154,0.00038209066,0.0012033562,0.00016776465,2.3347876e-7],"category_scores_gemma":[0.00004793225,0.00017111246,0.00007891493,0.0013351962,0.00052664895,0.0002622531,0.0006434824,0.00023504155,4.5080842e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011903032,0.000003798154,0.00010710461,0.0001111116,0.000085574546,0.0000012143204,0.00021603247,0.06800397,0.000013120129,0.032141477,0.000024751951,0.8992907],"study_design_scores_gemma":[0.00006935527,0.000048725313,0.0003044638,0.00019919458,0.00009558963,0.000012796576,7.9636756e-8,0.99061006,0.00015923615,0.0058910474,0.00244023,0.00016923214],"about_ca_topic_score_codex":0.000020800593,"about_ca_topic_score_gemma":0.0000069940793,"teacher_disagreement_score":0.9226061,"about_ca_system_score_codex":0.00010859819,"about_ca_system_score_gemma":0.00029617042,"threshold_uncertainty_score":0.6977764},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004195068,0.0010770699,0.9791152,0.0014512343,0.0013334141,0.00036850738,0.000049731592,0.00031613407,0.016284553],"genre_scores_gemma":[0.05244606,0.0001077169,0.9339519,0.012164058,0.00087554357,0.000021576818,0.000052984746,0.00004187247,0.0003382618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566746,0.00004837349,0.0004943971,0.0018754671,0.0010552008,0.0008590861],"domain_scores_gemma":[0.99632794,0.0006766581,0.00022860667,0.0022619986,0.00028611685,0.00021866731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006975747,0.00063792523,0.000574832,0.0023222885,0.0003980665,0.00087155396,0.0052844854,0.0004814759,0.000038240698],"category_scores_gemma":[0.00018192572,0.00060092413,0.00025085543,0.0018507072,0.0008437073,0.00063986884,0.0016205148,0.001141326,0.000023610039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009960324,0.00006005552,0.0000108865925,0.00008420817,0.000013947175,0.00009942582,0.00016959806,0.0066010086,0.00007409175,0.5979303,0.00037577192,0.3945707],"study_design_scores_gemma":[0.00038221062,0.00014854792,0.00009440847,0.00057993975,0.000010880153,0.00001451005,8.228514e-8,0.24976785,0.002159301,0.72967756,0.016312227,0.00085246365],"about_ca_topic_score_codex":0.000090043395,"about_ca_topic_score_gemma":0.00016276847,"teacher_disagreement_score":0.39371827,"about_ca_system_score_codex":0.0002504869,"about_ca_system_score_gemma":0.0022271334,"threshold_uncertainty_score":0.9996442},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027423224,0.0008319284,0.97406256,0.002754107,0.001242049,0.0012241104,0.000028751798,0.0002208516,0.016893316],"genre_scores_gemma":[0.85340613,0.0015640821,0.13880071,0.0024816191,0.0017053187,0.000059520567,0.000033640907,0.000083773826,0.0018652311],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968849,0.00007713918,0.00032616756,0.0011998152,0.00088248675,0.00062951114],"domain_scores_gemma":[0.99811566,0.0004303217,0.00021967207,0.00081391964,0.00023188756,0.00018856638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011261763,0.00040946424,0.00043991784,0.00059825485,0.00087527034,0.00060945214,0.0018224871,0.00035524167,0.000033765315],"category_scores_gemma":[0.00073925516,0.00037033658,0.000056421683,0.0006177405,0.0018932712,0.0007925077,0.0018703613,0.0008589372,0.000009244627],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087727145,0.00006407438,0.0011337326,0.00019885159,0.000064202606,0.00009610409,0.042526536,0.00037203266,0.00009287454,0.045318227,0.0002240777,0.90982157],"study_design_scores_gemma":[0.0021263605,0.0009910458,0.0019323711,0.0051699625,0.00013356082,0.00006576344,0.00008724481,0.008320771,0.0019538612,0.75045395,0.22525382,0.003511275],"about_ca_topic_score_codex":0.000761833,"about_ca_topic_score_gemma":0.0012832417,"teacher_disagreement_score":0.90631026,"about_ca_system_score_codex":0.0004177903,"about_ca_system_score_gemma":0.001014009,"threshold_uncertainty_score":0.99987483},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066718715,0.00017125036,0.992688,0.0001256209,0.0010411214,0.00348078,0.00007546001,0.00042833938,0.0013222211],"genre_scores_gemma":[0.8950794,0.0001467049,0.10111114,0.0005475316,0.001285705,0.0006706339,0.0008515933,0.00012049433,0.00018683744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977042,0.00002773936,0.00040583918,0.0008584208,0.00058598025,0.00041780685],"domain_scores_gemma":[0.9984426,0.00022962602,0.00012966228,0.00095176883,0.00016175311,0.00008460135],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005787188,0.0003646408,0.00032574628,0.00053398137,0.00019209998,0.00021583073,0.0012916463,0.00033435816,0.000031456588],"category_scores_gemma":[0.00009905141,0.00036571483,0.000046821853,0.00050844735,0.00026030705,0.00086546893,0.0003993677,0.00069962675,0.000017664242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057308567,0.00010344312,0.00012475005,0.002076065,0.00007988346,0.00008355791,0.007982535,0.4999762,0.003238093,0.006269641,0.0007709147,0.47923762],"study_design_scores_gemma":[0.00018903724,0.000035696758,0.00023604376,0.0011479608,0.000014726175,0.000010745039,8.975073e-7,0.9643621,0.0030511166,0.029226875,0.0013244334,0.00040036606],"about_ca_topic_score_codex":0.000008562279,"about_ca_topic_score_gemma":0.00011756221,"teacher_disagreement_score":0.89441216,"about_ca_system_score_codex":0.00036835353,"about_ca_system_score_gemma":0.000263985,"threshold_uncertainty_score":0.9998795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013478975,0.0011439241,0.9745869,0.003660671,0.0025275701,0.00096609356,0.000021876152,0.0001809703,0.015564115],"genre_scores_gemma":[0.9417119,0.005333101,0.048322745,0.00067213847,0.0025034584,0.00012795278,0.00004151702,0.00005252358,0.0012346419],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971077,0.00010184466,0.0003390232,0.0010747559,0.0009039017,0.00047280247],"domain_scores_gemma":[0.9984326,0.00020198656,0.00018754987,0.00059223984,0.0004370852,0.00014857917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012474622,0.0003310458,0.00032735273,0.0007141389,0.00095643516,0.00050259085,0.0008814928,0.00028540535,0.000027591443],"category_scores_gemma":[0.0010636662,0.0003287604,0.000106608735,0.0006001245,0.0011759714,0.0014133425,0.0010377609,0.00078706077,0.000012695051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055246026,0.00009475808,0.0006657891,0.0001313139,0.000041299005,0.0000327418,0.028569609,0.0003146343,0.00009404017,0.29092038,0.00009146531,0.67898875],"study_design_scores_gemma":[0.0013136903,0.00051306037,0.008275297,0.0039828424,0.00018727395,0.000062726765,0.0005975093,0.020483961,0.0002993138,0.9016595,0.06012475,0.0025001077],"about_ca_topic_score_codex":0.0016091249,"about_ca_topic_score_gemma":0.003833703,"teacher_disagreement_score":0.940364,"about_ca_system_score_codex":0.0009904426,"about_ca_system_score_gemma":0.000601021,"threshold_uncertainty_score":0.99991643},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003148238,0.0008748496,0.9923878,0.0005415044,0.0018021102,0.0003672418,0.000019908008,0.00024259833,0.003449194],"genre_scores_gemma":[0.105864204,0.00027463827,0.8896727,0.0033917225,0.0004967286,0.0000137956395,0.000039586615,0.000036239613,0.00021037796],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576735,0.000051393352,0.0005259079,0.002171571,0.0007664123,0.0007173528],"domain_scores_gemma":[0.99677116,0.00030917715,0.00021162054,0.0022114583,0.00019260721,0.00030396195],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000813391,0.0005937928,0.00056354026,0.0010445111,0.00030624008,0.0012418606,0.0038797022,0.00041353094,0.0000140539505],"category_scores_gemma":[0.00005813463,0.0005505082,0.00012156823,0.0012539801,0.00084329763,0.0013224494,0.0025668393,0.0009290674,0.000015591155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000092147275,0.000053340616,0.0004023985,0.00004333084,0.000011014605,0.00007394993,0.0007105518,0.00045275202,0.000010916765,0.19543557,0.000098967575,0.802698],"study_design_scores_gemma":[0.0005963384,0.00049972,0.0013543747,0.0009220628,0.00002759614,0.00007870578,4.6263673e-7,0.15273051,0.00020748652,0.82938606,0.012523957,0.0016727293],"about_ca_topic_score_codex":0.000042470285,"about_ca_topic_score_gemma":0.00010321914,"teacher_disagreement_score":0.8010253,"about_ca_system_score_codex":0.000098825265,"about_ca_system_score_gemma":0.00035689864,"threshold_uncertainty_score":0.99979496},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058117872,0.0007259674,0.96555287,0.004749429,0.002095069,0.0012346167,0.000070921655,0.00018862858,0.025324386],"genre_scores_gemma":[0.97700447,0.00020749665,0.013475116,0.003963807,0.0008782942,0.00007719546,0.000012906457,0.00003446552,0.004346222],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996887,0.000049772458,0.00043761308,0.00094676093,0.0008517078,0.0008271456],"domain_scores_gemma":[0.99639595,0.0021972347,0.00028699523,0.0006012035,0.00036085324,0.0001577884],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011547476,0.00038872345,0.00063083007,0.0012638133,0.0008912006,0.0010976484,0.0032259224,0.00042398187,0.000043148175],"category_scores_gemma":[0.00088118773,0.00035030948,0.00020015395,0.0010228675,0.0015004787,0.00057687453,0.000455282,0.00045671102,0.000011838971],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026566637,0.000029708981,0.0003681006,0.000060769296,0.00003404748,0.000010001304,0.0005826287,0.0043826927,0.0000027145645,0.07588639,0.0001374688,0.9184789],"study_design_scores_gemma":[0.0020589782,0.00018268259,0.0021458352,0.0005687963,0.00012612379,0.000004181397,0.0000028403792,0.35329458,0.00002855241,0.58524096,0.054999985,0.0013464657],"about_ca_topic_score_codex":0.00087291916,"about_ca_topic_score_gemma":0.0030939148,"teacher_disagreement_score":0.97694635,"about_ca_system_score_codex":0.000462154,"about_ca_system_score_gemma":0.0014749614,"threshold_uncertainty_score":0.9999393},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029782733,0.0004955386,0.99372566,0.0003055534,0.0014182958,0.00080549944,0.00001356053,0.00011741046,0.00282067],"genre_scores_gemma":[0.9222997,0.000029039309,0.076173715,0.00078929117,0.00014979014,0.000036100086,0.0000057479824,0.000028953908,0.000487666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953675,0.00013343606,0.001103109,0.001732891,0.0010019977,0.0006610283],"domain_scores_gemma":[0.99624217,0.0015718166,0.0006859451,0.001176385,0.00018870483,0.00013500973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013907966,0.00059521967,0.0010133408,0.0016397368,0.00016085814,0.00022355751,0.0026431887,0.00039941963,0.000017910774],"category_scores_gemma":[0.00013170797,0.00062809483,0.0001818906,0.00084054127,0.00039378752,0.0008924245,0.0015682213,0.0009665816,0.00002268525],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009990081,0.000120600576,0.0006074826,0.00021789489,0.00005628619,0.000083483385,0.0060538324,0.0039704624,0.00043341314,0.0040704114,0.000008451731,0.98436767],"study_design_scores_gemma":[0.0023674814,0.00048356657,0.0013059822,0.009041373,0.000043078082,0.00010184582,0.00001293655,0.8887569,0.042487726,0.044663746,0.008030496,0.002704915],"about_ca_topic_score_codex":0.00015420603,"about_ca_topic_score_gemma":0.00055949687,"teacher_disagreement_score":0.98166275,"about_ca_system_score_codex":0.001335417,"about_ca_system_score_gemma":0.0016194102,"threshold_uncertainty_score":0.99961704},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024454463,0.00021369512,0.8330062,0.0014633157,0.002929811,0.00070819847,0.000007689027,0.00012422365,0.13709238],"genre_scores_gemma":[0.9798295,0.00007258089,0.0144772595,0.003669074,0.00035883763,0.0000025627314,0.0000028056922,0.000014265855,0.0015730944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788797,0.00007044814,0.00041554222,0.0005337157,0.0006276638,0.00046466576],"domain_scores_gemma":[0.9988744,0.00043629922,0.0002036901,0.0002544147,0.00009633658,0.0001348207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012272071,0.0002520373,0.00027389263,0.00073688134,0.00042859267,0.0005224156,0.000423712,0.00028900823,0.00013013404],"category_scores_gemma":[0.00036528878,0.00019098003,0.000038069567,0.0004476445,0.00054691284,0.000570086,0.0002206816,0.00049769017,0.000014906976],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048260094,0.000007676981,0.0046486156,0.00010000406,0.0000072095704,0.000009337612,0.05936922,0.0014860466,0.00006936716,0.0019817997,0.00005581359,0.9322601],"study_design_scores_gemma":[0.0040101367,0.00034592245,0.1768862,0.007150531,0.00011901387,0.00009596727,0.0026684352,0.22917922,0.005514008,0.5111204,0.055449612,0.0074605756],"about_ca_topic_score_codex":0.0003970643,"about_ca_topic_score_gemma":0.004344053,"teacher_disagreement_score":0.9553751,"about_ca_system_score_codex":0.00026770314,"about_ca_system_score_gemma":0.0004046611,"threshold_uncertainty_score":0.778794},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000088746514,0.0014766738,0.99413955,0.001723718,0.00046832042,0.0013122724,0.0000035481876,0.00010276601,0.00068440614],"genre_scores_gemma":[0.26587543,0.00022787723,0.73286915,0.0005627137,0.00020569659,0.00010143897,0.0000016092891,0.000024225244,0.00013186161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964122,0.00024862622,0.0010107505,0.0009130661,0.001125386,0.00028998204],"domain_scores_gemma":[0.9938967,0.0029554337,0.0007159784,0.0011611313,0.0012208999,0.000049833852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006015172,0.00032174448,0.0005608803,0.0011481972,0.00017837234,0.0002499209,0.0016328383,0.00018625273,9.641515e-7],"category_scores_gemma":[0.0039005044,0.00025439428,0.00006364732,0.0012196063,0.00034659484,0.0008317049,0.0010691339,0.0006229646,0.0000013992899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010522126,0.000027955337,0.000056680525,0.0015215029,0.000040136554,0.000013395692,0.0016603057,0.07062349,0.00031557845,0.0034393035,0.00007491047,0.92221624],"study_design_scores_gemma":[0.00028927036,0.00014389635,0.00016593981,0.010324497,0.00008655501,0.000115900606,0.000004081279,0.9282061,0.0028310355,0.057264145,0.00017316666,0.00039543433],"about_ca_topic_score_codex":0.00011505068,"about_ca_topic_score_gemma":0.00010991441,"teacher_disagreement_score":0.92182076,"about_ca_system_score_codex":0.00038460776,"about_ca_system_score_gemma":0.00055194285,"threshold_uncertainty_score":0.9999908},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015108024,0.000107228654,0.9919346,0.000107402,0.0010909955,0.0005319123,0.00002017418,0.00059213367,0.00546446],"genre_scores_gemma":[0.06400559,0.00016558378,0.9348074,0.00044562411,0.00015110322,0.000032455657,0.000019837851,0.000025896561,0.00034650924],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969841,0.000032194203,0.000772992,0.00094849383,0.0008534207,0.0004087569],"domain_scores_gemma":[0.99673706,0.00048768258,0.000626156,0.0015420082,0.0005123618,0.00009472683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040614075,0.00047595997,0.00058631325,0.0012815875,0.00016961496,0.00019495655,0.0020674884,0.0004005849,0.000018462892],"category_scores_gemma":[0.00015410264,0.0004751502,0.00014310387,0.0008688246,0.00036940846,0.002307977,0.0010533473,0.00057361217,0.00003659393],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013785363,0.00000948702,0.000004846421,0.000026164886,0.000008616982,0.0000047780472,0.0002275389,0.0044255373,0.0057958364,0.0017655089,0.000008205085,0.9877097],"study_design_scores_gemma":[0.00058875006,0.00043907293,0.00032777182,0.0010558512,0.000022095383,0.000024268817,3.6431564e-7,0.19534189,0.39899102,0.3972469,0.004826785,0.0011352384],"about_ca_topic_score_codex":0.0001300416,"about_ca_topic_score_gemma":0.00006131053,"teacher_disagreement_score":0.9865745,"about_ca_system_score_codex":0.00045333777,"about_ca_system_score_gemma":0.0003382679,"threshold_uncertainty_score":0.99977005},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003454027,0.00056421093,0.9964305,0.0005669505,0.00024568298,0.00032785966,0.000044367178,0.00031819256,0.0014677055],"genre_scores_gemma":[0.35576573,0.00062036415,0.63676125,0.0029301904,0.00048262763,0.00008603994,0.00015846654,0.000060828752,0.0031345293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750715,0.000029481602,0.00037747182,0.0013170546,0.00040039705,0.00036846605],"domain_scores_gemma":[0.9983102,0.00021881802,0.00017317657,0.0010569013,0.00011351412,0.0001273839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047030728,0.00037787508,0.00035481623,0.0007078898,0.00056792086,0.00045415456,0.0016043229,0.00024759056,0.000022183945],"category_scores_gemma":[0.000039810635,0.00036943905,0.00006366066,0.00069369853,0.00043691613,0.00042032063,0.0014161032,0.00084440294,0.000015754284],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034587363,0.0000151635095,0.000049375718,0.000031409065,0.000008639304,0.000016454493,0.000073943134,0.0012142147,0.00037488627,0.012156404,0.000043153963,0.9860129],"study_design_scores_gemma":[0.00028697532,0.0002766963,0.00014811347,0.00019046618,0.000016911996,0.00013544553,1.6327174e-7,0.87134886,0.0055841976,0.06008528,0.06115801,0.00076887256],"about_ca_topic_score_codex":0.000089041954,"about_ca_topic_score_gemma":0.00014561892,"teacher_disagreement_score":0.98524404,"about_ca_system_score_codex":0.00014181128,"about_ca_system_score_gemma":0.00018783346,"threshold_uncertainty_score":0.9998758},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070899434,0.0006819811,0.94948775,0.00016832592,0.00048129886,0.00037434653,0.000025272044,0.00013657128,0.047935475],"genre_scores_gemma":[0.8494554,0.000046495603,0.14703089,0.002377241,0.0001453653,0.0000174324,0.000028502405,0.000011475448,0.00088717084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675703,0.00009508103,0.00055438647,0.0012020848,0.00083202403,0.0005594207],"domain_scores_gemma":[0.99744934,0.00061350025,0.00028941024,0.001146823,0.00034096147,0.00015995908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015522426,0.0004950174,0.00073393463,0.001633811,0.00040303546,0.00054695987,0.0017803978,0.00025991743,0.000022459506],"category_scores_gemma":[0.000067943976,0.00044836197,0.00019260906,0.0015447786,0.00030802007,0.0008412507,0.0013876344,0.00082652486,0.000029240904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010390367,0.00015291676,0.000032789267,0.0000795432,0.00016215959,0.000025370153,0.063001946,0.04895706,0.000006006267,0.5624573,0.00007559288,0.3250389],"study_design_scores_gemma":[0.00033784463,0.00010127391,0.00011519642,0.00020840208,0.000051016297,0.000005214577,0.0000032673606,0.94992787,0.00015090467,0.048270658,0.00037920455,0.00044913584],"about_ca_topic_score_codex":0.000028630679,"about_ca_topic_score_gemma":0.00044726298,"teacher_disagreement_score":0.9009708,"about_ca_system_score_codex":0.0002539652,"about_ca_system_score_gemma":0.00046313397,"threshold_uncertainty_score":0.9997968},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010248057,0.0018742656,0.9867189,0.0016488669,0.0016805311,0.0005913039,0.000016183238,0.000053305623,0.0063918675],"genre_scores_gemma":[0.8881174,0.00045612853,0.10041035,0.008658391,0.0008785278,0.000055386154,0.000018022523,0.000050136674,0.0013556916],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968653,0.00006644196,0.00062178087,0.0011169654,0.00078015815,0.0005493753],"domain_scores_gemma":[0.9957649,0.002633189,0.00024783972,0.0011539118,0.00014281418,0.000057335103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006476757,0.00047066715,0.0006626219,0.00033808092,0.00026510234,0.00017359333,0.0029694054,0.00024284332,0.000015053206],"category_scores_gemma":[0.00041625698,0.00035770412,0.00017927063,0.00071151054,0.000640789,0.0003048744,0.0019606214,0.0007717601,0.0000070294736],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024930008,0.00006291771,0.0015317248,0.00027480867,0.000050362112,0.00012844079,0.003818113,0.0048429403,0.00018141059,0.059015557,0.0008039876,0.9292648],"study_design_scores_gemma":[0.0062025106,0.0007795384,0.079214,0.02912741,0.00020338396,0.000027594577,0.0000055262894,0.31219587,0.02968848,0.5041418,0.033594996,0.0048188623],"about_ca_topic_score_codex":0.0004770972,"about_ca_topic_score_gemma":0.0008983341,"teacher_disagreement_score":0.9244459,"about_ca_system_score_codex":0.00019089309,"about_ca_system_score_gemma":0.0005030049,"threshold_uncertainty_score":0.99988747},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003433133,0.000085634274,0.96701074,0.00033759922,0.0017680998,0.00070911297,0.000022367783,0.00039134387,0.029331764],"genre_scores_gemma":[0.69727564,0.0000032816706,0.29880515,0.0032591098,0.00028340032,0.000029139692,0.000028486675,0.000022245893,0.0002935749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596417,0.00005480993,0.0006688307,0.0014661584,0.0011139648,0.00073206174],"domain_scores_gemma":[0.9967783,0.000099451776,0.0002442188,0.0020870534,0.00041639138,0.0003745842],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008896462,0.00061540917,0.00060857,0.0011256625,0.00036679205,0.001057826,0.0051004095,0.00044244595,0.000005951604],"category_scores_gemma":[0.00003626778,0.0005620858,0.0001529061,0.0008953295,0.0002456165,0.0012022009,0.0014440775,0.00095341174,0.000042223888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026222197,0.00023484911,0.00020279216,0.0004661112,0.000025670024,0.00014285078,0.015647752,0.008114602,0.000069478294,0.5030402,0.0002969898,0.4717325],"study_design_scores_gemma":[0.0003959394,0.0002520948,0.00047119852,0.0005462724,0.000017368784,0.00024049667,0.0000027741482,0.9819727,0.0005184433,0.01264838,0.0017391541,0.0011951615],"about_ca_topic_score_codex":0.00007606241,"about_ca_topic_score_gemma":0.00007893634,"teacher_disagreement_score":0.9738581,"about_ca_system_score_codex":0.0005038023,"about_ca_system_score_gemma":0.0006445036,"threshold_uncertainty_score":0.9999792},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021465526,0.00010013402,0.9938498,0.0006570058,0.0011482679,0.00096373516,0.000008495191,0.00020753025,0.0028503744],"genre_scores_gemma":[0.68759197,0.000025076173,0.30600333,0.0051562726,0.00043684477,0.00012889228,0.000020688469,0.000026725113,0.000610214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728715,0.00003734599,0.0006644399,0.0008658685,0.0005839159,0.0005612463],"domain_scores_gemma":[0.9982429,0.00045266925,0.00027483923,0.0005693299,0.00039166596,0.00006857549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015164589,0.0003537566,0.00043502767,0.0012197917,0.0002696367,0.00061366934,0.0014298846,0.00034420524,0.000012035144],"category_scores_gemma":[0.00019652596,0.000358455,0.00011996084,0.0009274415,0.0001381116,0.0010151844,0.0003220612,0.00059022586,0.00001380342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003069495,0.00006662472,0.00023699646,0.00027082878,0.000016096206,0.000007998044,0.0028144633,0.058790933,0.000057362577,0.27955344,0.00016472755,0.65798986],"study_design_scores_gemma":[0.00066237955,0.000066046494,0.00012659354,0.00026366342,0.00000445582,0.0000100538355,1.8123204e-7,0.86961186,0.00050791673,0.12623201,0.0021754603,0.0003393861],"about_ca_topic_score_codex":0.00003604636,"about_ca_topic_score_gemma":0.00021926417,"teacher_disagreement_score":0.81082094,"about_ca_system_score_codex":0.00055146223,"about_ca_system_score_gemma":0.00082969153,"threshold_uncertainty_score":0.99988675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015073288,0.00033079067,0.9845809,0.0007829319,0.0017674802,0.0010084775,0.000049600156,0.0001368513,0.009835677],"genre_scores_gemma":[0.70959574,0.000019260362,0.2836042,0.0010869855,0.00070932263,0.0000462393,0.00004134878,0.000046330384,0.0048505557],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949903,0.00012429291,0.0010607959,0.0018467145,0.0013544412,0.00062349485],"domain_scores_gemma":[0.98728335,0.009795322,0.00062396034,0.0013538233,0.0007896742,0.00015389116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0055244034,0.0004811147,0.00077192154,0.002020591,0.0005637971,0.00082982663,0.0030273306,0.0003645465,0.00005429174],"category_scores_gemma":[0.0023727329,0.00039181495,0.0002398857,0.002280894,0.00094215095,0.00029652673,0.0009640226,0.00064558507,0.00007023887],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019064537,0.000024404588,0.000029976982,0.000028033954,0.000010441884,0.0000028395775,0.00016636928,0.004239075,0.00019841212,0.20279405,0.00024648535,0.79224086],"study_design_scores_gemma":[0.00023419084,0.000059075344,0.000102948616,0.0001913151,0.000015657533,0.000008965331,8.518827e-7,0.4054095,0.00085059914,0.58792853,0.004886734,0.0003116413],"about_ca_topic_score_codex":0.0000052317123,"about_ca_topic_score_gemma":0.00001695788,"teacher_disagreement_score":0.7919292,"about_ca_system_score_codex":0.00017094443,"about_ca_system_score_gemma":0.00045686078,"threshold_uncertainty_score":0.9998534},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012362115,0.0007817889,0.98951083,0.000624174,0.0009825804,0.0003236572,0.0000028390862,0.00016139564,0.0074891294],"genre_scores_gemma":[0.13706227,0.00017590144,0.8586839,0.0012411586,0.00057121686,0.000018950443,0.0000046381892,0.000051021936,0.0021909368],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965821,0.000034702865,0.0003700816,0.0015459484,0.0008273347,0.00063984643],"domain_scores_gemma":[0.9971982,0.0010392905,0.00018149872,0.00117632,0.000245892,0.00015877158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010710309,0.0004079383,0.00039214315,0.0011306441,0.00040405404,0.00064817,0.0023720346,0.00024916235,0.000011589791],"category_scores_gemma":[0.00025277573,0.00039139553,0.00007766647,0.0008506757,0.00092171214,0.0008569984,0.002015052,0.0011095209,0.000011857027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005693511,0.000008940559,0.00013575652,0.000041406314,0.0000057829593,0.00005319728,0.00011911886,0.002319264,0.00014058304,0.11528125,0.0000080943555,0.88188094],"study_design_scores_gemma":[0.00016414018,0.000091983544,0.0002240985,0.0003884007,0.0000040388613,0.00007815663,8.5674074e-8,0.3612621,0.00064409466,0.63559407,0.0011334652,0.00041536088],"about_ca_topic_score_codex":0.000025827361,"about_ca_topic_score_gemma":0.00017211931,"teacher_disagreement_score":0.88146555,"about_ca_system_score_codex":0.00021916827,"about_ca_system_score_gemma":0.00040947745,"threshold_uncertainty_score":0.9998538},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010649472,0.0014445969,0.9779721,0.0035794678,0.004485693,0.0010533927,0.000024838775,0.00041345545,0.00996152],"genre_scores_gemma":[0.14148848,0.00029848333,0.8404006,0.012806241,0.00025511588,0.00012516964,0.000033005377,0.000121783465,0.0044711363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939548,0.00010462032,0.0011261718,0.0024254634,0.0012772143,0.0011117255],"domain_scores_gemma":[0.995109,0.0011118003,0.0003722839,0.0027384097,0.00036998544,0.00029848708],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019552172,0.0007776961,0.0010598905,0.0023347577,0.00030767554,0.0006309188,0.007070133,0.00067107356,0.000024580178],"category_scores_gemma":[0.00055403117,0.0007181316,0.0002987467,0.0021269394,0.0009782272,0.00053983013,0.0033467254,0.0013503123,0.000049830334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007838981,0.0002557573,0.0002642058,0.00014466619,0.000047498765,0.00046614316,0.001134215,0.022530098,0.00069275947,0.4833955,0.002316392,0.4886744],"study_design_scores_gemma":[0.001713573,0.00039846316,0.0002218136,0.0008436505,0.000016120961,0.000042084353,2.8602187e-7,0.19775832,0.0005506857,0.7924981,0.004890385,0.0010665252],"about_ca_topic_score_codex":0.0001471263,"about_ca_topic_score_gemma":0.0007495786,"teacher_disagreement_score":0.48760787,"about_ca_system_score_codex":0.0003449107,"about_ca_system_score_gemma":0.0013278797,"threshold_uncertainty_score":0.999527},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030707923,0.0015285962,0.9943388,0.00014204509,0.0004934754,0.00022439387,0.000015572108,0.0005329452,0.0024171087],"genre_scores_gemma":[0.015985271,0.00006640523,0.98134685,0.00037433152,0.0005585652,0.0000081439675,0.000040554125,0.000086009764,0.0015338704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783725,0.000007321299,0.00037009103,0.00075502315,0.00049647415,0.00053385046],"domain_scores_gemma":[0.99892336,0.0001492774,0.0000979671,0.00041144007,0.0002981932,0.00011978239],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002789455,0.0004927877,0.00045043477,0.0006085671,0.00020848808,0.00029044127,0.00072218815,0.00031784317,0.00003267232],"category_scores_gemma":[0.00007450369,0.00043194924,0.000053853946,0.00067530735,0.00026242476,0.00024984463,0.00017169933,0.0008649551,0.000024514391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003889209,0.000009965665,0.000040483552,0.0001421126,0.000010097758,0.000015123068,0.0001320906,0.79334176,0.00003701685,0.00001915589,0.0000033221215,0.20624499],"study_design_scores_gemma":[0.0003160892,0.00003289189,0.000022284083,0.0016819651,0.00001914363,0.000022163145,3.8345138e-7,0.996091,0.00062812754,0.00040659515,0.00025297632,0.000526371],"about_ca_topic_score_codex":0.0000032456658,"about_ca_topic_score_gemma":0.000024869063,"teacher_disagreement_score":0.20571862,"about_ca_system_score_codex":0.00017733546,"about_ca_system_score_gemma":0.00037968985,"threshold_uncertainty_score":0.99981326},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010385678,0.0005214191,0.99569476,0.00061824016,0.0019421888,0.00038591615,0.000029118186,0.000045529712,0.00065896905],"genre_scores_gemma":[0.044778455,0.000050468803,0.9518985,0.0010600695,0.00085262425,0.000017063954,0.000037285397,0.000016710157,0.0012887871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978862,0.00001568554,0.0004169778,0.0009109718,0.0004732012,0.00029698206],"domain_scores_gemma":[0.99824834,0.000687657,0.00021239159,0.00048341588,0.00028909964,0.00007911547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049209065,0.00029490187,0.0003992138,0.0007635587,0.00015255078,0.00023042392,0.0010552045,0.00017701177,0.0000045212782],"category_scores_gemma":[0.0000762122,0.00027640574,0.0000832299,0.00040669768,0.00027102485,0.00034473088,0.0006200664,0.0002222784,0.0000016591043],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012076275,0.000022980717,0.000030188023,0.00011331343,0.000019468232,0.000007696308,0.00047080813,0.03618506,0.00040520515,0.026805025,0.00018349712,0.9357447],"study_design_scores_gemma":[0.0005224175,0.00028976504,0.00027880742,0.00039440193,0.000013277709,0.000033782486,2.1354833e-7,0.8714268,0.005286905,0.115545705,0.0057333387,0.0004745791],"about_ca_topic_score_codex":0.000009537716,"about_ca_topic_score_gemma":0.000030312542,"teacher_disagreement_score":0.93527013,"about_ca_system_score_codex":0.00005965132,"about_ca_system_score_gemma":0.000356935,"threshold_uncertainty_score":0.9999688},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034286666,0.0023972054,0.9864585,0.00050727325,0.002831386,0.00050161965,0.0001539108,0.0002903677,0.006825466],"genre_scores_gemma":[0.12665828,0.00017386266,0.86662877,0.005166637,0.0010265277,0.000025207775,0.00008882315,0.000046516354,0.00018538153],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99504846,0.00003875839,0.0005778161,0.0025484746,0.0009834917,0.0008029851],"domain_scores_gemma":[0.99576247,0.0008271058,0.00030260233,0.0026052396,0.00027535553,0.00022723016],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00058246445,0.00076651154,0.00071612996,0.0010511539,0.0003630869,0.000868863,0.006334181,0.0006413307,0.000044529967],"category_scores_gemma":[0.00008567581,0.00069761253,0.0002726993,0.0011176292,0.00087847735,0.0009593862,0.0032748117,0.0016972489,0.000021573362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036085352,0.00007784882,0.000040854084,0.00003403189,0.00006423509,0.0001404447,0.0008848173,0.002621654,0.00047161742,0.42386013,0.0006249736,0.5711433],"study_design_scores_gemma":[0.00033660466,0.00015375437,0.0001283246,0.00041049594,0.000018380271,0.000006270378,2.5700209e-7,0.3773791,0.0014376733,0.6154058,0.0038808717,0.00084250094],"about_ca_topic_score_codex":0.00017385618,"about_ca_topic_score_gemma":0.00045935035,"teacher_disagreement_score":0.5703008,"about_ca_system_score_codex":0.00018847326,"about_ca_system_score_gemma":0.0007903973,"threshold_uncertainty_score":0.9995475},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007868136,0.00045357086,0.99074614,0.00222678,0.0031131587,0.00052058283,0.000040174,0.00011910294,0.0019936988],"genre_scores_gemma":[0.42492178,0.00013054618,0.5667031,0.0072479844,0.00063975237,0.00003377023,0.00008615646,0.000044848624,0.00019207501],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99537253,0.00007245671,0.0007792764,0.002023387,0.0009715041,0.0007808263],"domain_scores_gemma":[0.9960884,0.0012084903,0.00025276662,0.002066544,0.00017820465,0.0002056192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074912445,0.000660142,0.0008411722,0.0012450622,0.00017526666,0.0006602188,0.0047310563,0.00060230965,0.0000999943],"category_scores_gemma":[0.00017081585,0.0006155585,0.00020276652,0.001242218,0.00070945465,0.00090100605,0.0019596864,0.0013699956,0.00003468005],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012442088,0.00041256152,0.0018755274,0.00032111377,0.00016576513,0.0008109607,0.011118207,0.006125256,0.0017853837,0.061204545,0.0011834298,0.9148728],"study_design_scores_gemma":[0.0021454163,0.0002847685,0.0023721461,0.0017245673,0.000038815466,0.000018803988,0.0000022655297,0.46620625,0.004674963,0.5171278,0.0032258222,0.0021783418],"about_ca_topic_score_codex":0.00044920377,"about_ca_topic_score_gemma":0.0029821608,"teacher_disagreement_score":0.9126945,"about_ca_system_score_codex":0.00017310878,"about_ca_system_score_gemma":0.0013358322,"threshold_uncertainty_score":0.99962956},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001373147,0.0034758225,0.9893066,0.0009084694,0.0014349808,0.0003609524,0.000030937274,0.00020218037,0.0041427356],"genre_scores_gemma":[0.31031105,0.0011011033,0.6825647,0.004923209,0.0006357938,0.000021828204,0.000036075675,0.000050056824,0.00035621633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960467,0.00002717442,0.00045717997,0.0019197757,0.00085954653,0.0006896124],"domain_scores_gemma":[0.99715453,0.000501576,0.00019588096,0.0016993503,0.00023400842,0.00021466092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006521154,0.0005998035,0.0005668882,0.0012464805,0.00038016852,0.0010316096,0.003523762,0.0004407315,0.000017615039],"category_scores_gemma":[0.000062030165,0.0005216613,0.00013554064,0.0009469692,0.0009967941,0.00087512436,0.002664656,0.0012816503,0.000008952037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010733071,0.000037559734,0.00017357543,0.00013692734,0.000021960557,0.0001362139,0.00053573924,0.00072612794,0.00005431383,0.5763784,0.00016940986,0.42161903],"study_design_scores_gemma":[0.000416564,0.00015475013,0.0003172149,0.0008656237,0.0000183844,0.000049427443,2.569629e-7,0.09721948,0.0013665269,0.88587576,0.012669674,0.0010463514],"about_ca_topic_score_codex":0.00003121428,"about_ca_topic_score_gemma":0.00014188178,"teacher_disagreement_score":0.42057267,"about_ca_system_score_codex":0.00010885119,"about_ca_system_score_gemma":0.00042798868,"threshold_uncertainty_score":0.9997235},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007970477,0.00038479475,0.9810531,0.004612847,0.008942673,0.00041416305,0.0000017540386,0.00011444927,0.0036791428],"genre_scores_gemma":[0.20157732,0.00019171082,0.7537165,0.026841918,0.005538402,0.000013377812,0.000098746656,0.00015026533,0.011871729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680334,0.000054347784,0.00062171597,0.0011109691,0.0009446391,0.00046499024],"domain_scores_gemma":[0.9979036,0.0007790336,0.00018046038,0.00043158096,0.00021056374,0.00049474696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014167934,0.00040961453,0.0006842621,0.000904237,0.00019997612,0.0002679569,0.00046316747,0.0003258061,0.00015385373],"category_scores_gemma":[0.0012215306,0.00036509917,0.00016227372,0.00047192615,0.00063861435,0.0001035928,0.00083590095,0.0021504527,0.000016216445],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028430482,0.00004385909,0.00037089924,0.00016363799,0.00003143741,0.00019926317,0.0002098208,0.00086272834,0.00006120421,0.00016052525,0.0031252324,0.994743],"study_design_scores_gemma":[0.00078846264,0.00024880533,0.0030742306,0.009090428,0.000058739563,0.0006169394,7.1722246e-7,0.9807405,0.000055531124,0.0009816957,0.0039814794,0.00036248076],"about_ca_topic_score_codex":0.00006688385,"about_ca_topic_score_gemma":0.00004868162,"teacher_disagreement_score":0.9943805,"about_ca_system_score_codex":0.00029508382,"about_ca_system_score_gemma":0.00042069523,"threshold_uncertainty_score":0.9998801},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001058801,0.0005409358,0.98391336,0.00072425767,0.00047279225,0.0016225557,0.000022072238,0.00008614989,0.0115591],"genre_scores_gemma":[0.6637263,0.00006257213,0.33064982,0.0016568394,0.00029293465,0.00008240235,0.00010973075,0.000056520425,0.0033629248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974909,0.000017437009,0.00035459903,0.0010606135,0.00053377816,0.00054267904],"domain_scores_gemma":[0.9990053,0.00014119418,0.00010037643,0.00050379435,0.00012537943,0.0001239403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000675583,0.00041608815,0.00056814484,0.00067292654,0.00016061471,0.00019914165,0.00031928482,0.00020575454,0.000018035476],"category_scores_gemma":[0.000027332775,0.00036644874,0.00014565105,0.00019524602,0.00026559876,0.00026488642,0.00027207006,0.00040651063,0.0000017169893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016669475,0.00036465173,0.00007026181,0.0026730823,0.00013927667,0.000047321966,0.0050035366,0.005360132,0.0027283418,0.01061154,0.0002773971,0.9725578],"study_design_scores_gemma":[0.0022870917,0.00032985446,0.00027222806,0.00097302115,0.00018195398,0.0000073239667,0.0000068201343,0.9757025,0.0005621712,0.018176762,0.001050643,0.00044959786],"about_ca_topic_score_codex":0.000015472828,"about_ca_topic_score_gemma":0.000015572929,"teacher_disagreement_score":0.9721082,"about_ca_system_score_codex":0.00019471292,"about_ca_system_score_gemma":0.00015986057,"threshold_uncertainty_score":0.99987876},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013475835,0.00036694598,0.99209696,0.00029767086,0.00052950083,0.0013999806,0.000020844696,0.00046999846,0.0048046047],"genre_scores_gemma":[0.0751621,0.000017449813,0.9218325,0.00228249,0.0002519219,0.00018228141,0.000019928075,0.000027863645,0.00022347782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995744,0.000047713816,0.00066536566,0.0021071916,0.0007383486,0.0006974131],"domain_scores_gemma":[0.99661976,0.0007503538,0.00027994477,0.0012912756,0.0008538385,0.00020483001],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007638606,0.0005763513,0.000865738,0.0035054055,0.00041981455,0.00076836423,0.002705932,0.0003832979,0.0000048838897],"category_scores_gemma":[0.0001273778,0.0005861167,0.00041210055,0.0027363019,0.00027242,0.00045049822,0.0011786297,0.00057341234,0.000012174665],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083312525,0.000032508,0.000007824115,0.00006030659,0.00018235776,0.000005584455,0.00030162995,0.008200988,0.00031505153,0.0048907264,0.00003541765,0.9859593],"study_design_scores_gemma":[0.00032658322,0.00027542963,0.000072069546,0.00033372568,0.0002623359,0.000028129614,6.890719e-7,0.89370793,0.02674917,0.07318343,0.003978322,0.0010822017],"about_ca_topic_score_codex":0.000036439214,"about_ca_topic_score_gemma":0.00007108112,"teacher_disagreement_score":0.98487705,"about_ca_system_score_codex":0.00027816553,"about_ca_system_score_gemma":0.00033103253,"threshold_uncertainty_score":0.999659},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021913494,0.00027464525,0.9921664,0.0004232817,0.00059728546,0.000790131,0.000022316683,0.0005107168,0.0051933215],"genre_scores_gemma":[0.06359568,0.000050339087,0.9342525,0.001209299,0.00020739024,0.00007365339,0.000025096617,0.000023572926,0.000562456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956401,0.0000415709,0.00076801464,0.0020156791,0.00076000777,0.00077465695],"domain_scores_gemma":[0.9963359,0.001008747,0.0003770708,0.0014566579,0.0006661972,0.00015541243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013054127,0.00058035756,0.00094443525,0.0026401242,0.00046959202,0.00093392923,0.0033562838,0.00044569597,0.000019713205],"category_scores_gemma":[0.00025646412,0.00059393025,0.00051799207,0.0020024467,0.00041934854,0.0006647377,0.0012149354,0.00072599476,0.0000070637548],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006331259,0.000027976826,0.000017907492,0.00009608455,0.00010591476,0.000017365035,0.00045915227,0.004395098,0.0006669694,0.015465075,0.00001969377,0.97872245],"study_design_scores_gemma":[0.0004066365,0.00013199114,0.000025545838,0.00072349416,0.00016439092,0.000009077536,2.3748397e-7,0.64396954,0.0781544,0.27459106,0.00079094747,0.0010326817],"about_ca_topic_score_codex":0.000027000151,"about_ca_topic_score_gemma":0.00014251687,"teacher_disagreement_score":0.97768974,"about_ca_system_score_codex":0.00032723628,"about_ca_system_score_gemma":0.00045759653,"threshold_uncertainty_score":0.9996512},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017977753,0.0013935465,0.9948531,0.00017852843,0.00016773547,0.0010879835,0.00003777909,0.000800501,0.001462853],"genre_scores_gemma":[0.032562878,0.00016051256,0.9654573,0.00064258615,0.00017686775,0.00012661962,0.00004916856,0.000036543963,0.0007874833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962222,0.000071384944,0.0004956935,0.002051569,0.000586551,0.0005726314],"domain_scores_gemma":[0.99795955,0.0005457796,0.00031648573,0.0006261125,0.00039526768,0.00015679946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011124496,0.0006219388,0.00065233634,0.00082611566,0.00054373225,0.00073100795,0.0014228817,0.0006227496,0.0000041112617],"category_scores_gemma":[0.00025393706,0.0006040074,0.00018469094,0.00037661268,0.00047246378,0.0004870485,0.001055065,0.0012386912,0.0000012629647],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016604254,0.00004834943,0.000021340906,0.00010914005,0.000018469676,0.00000671543,0.00041907444,0.0003294538,0.003571886,0.00094588264,0.000013875413,0.9944992],"study_design_scores_gemma":[0.00032551403,0.00015573404,0.000015638405,0.00028478028,0.000020417774,0.00003712983,4.0760386e-7,0.8982937,0.05379149,0.045807462,0.0006642637,0.0006034668],"about_ca_topic_score_codex":0.00017183066,"about_ca_topic_score_gemma":0.00038541382,"teacher_disagreement_score":0.99389577,"about_ca_system_score_codex":0.0002707041,"about_ca_system_score_gemma":0.0002683049,"threshold_uncertainty_score":0.9996411},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004059187,0.0004999148,0.9897436,0.00060315116,0.0022620782,0.0008813185,0.000007059153,0.000537532,0.005424745],"genre_scores_gemma":[0.06335889,0.000014711796,0.9328547,0.002275078,0.00061615015,0.000028858854,0.0000068160734,0.00005063549,0.0007941655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951465,0.00005405269,0.00080182846,0.0020276343,0.00096052676,0.001009469],"domain_scores_gemma":[0.99639744,0.00095548446,0.00047042576,0.0015800629,0.00046527552,0.0001313363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019786314,0.0007022876,0.00064037205,0.0012581715,0.0004951905,0.0010267663,0.00418638,0.0002866022,0.000012934256],"category_scores_gemma":[0.00034742692,0.000721765,0.00022324474,0.00075099606,0.0005480458,0.0012274473,0.0021188583,0.00080402533,0.0000070721503],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010213795,0.000025083027,0.00006199803,0.000113086266,0.000016592772,0.00005762851,0.0006659141,0.0050369017,0.00187874,0.04619762,0.00015584537,0.9457804],"study_design_scores_gemma":[0.0004174586,0.00017150573,0.000011013122,0.001685375,0.000023724539,0.00005572323,7.2764993e-7,0.7934115,0.025580842,0.1756351,0.0018420751,0.0011649452],"about_ca_topic_score_codex":0.000017344837,"about_ca_topic_score_gemma":0.000020905387,"teacher_disagreement_score":0.9446154,"about_ca_system_score_codex":0.0005891661,"about_ca_system_score_gemma":0.00087627483,"threshold_uncertainty_score":0.99952334},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002932557,0.00037508731,0.9890185,0.0017845391,0.0038249544,0.0014225045,0.00002446542,0.0002977047,0.0032228902],"genre_scores_gemma":[0.16129258,0.00022103128,0.8264511,0.0044739316,0.0020208359,0.00032653922,0.000031199266,0.0001365903,0.005046152],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934941,0.000059574504,0.0012540566,0.002642459,0.0010794057,0.0014704206],"domain_scores_gemma":[0.99440193,0.0018828347,0.00044422172,0.0023136188,0.000685305,0.00027206432],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002026517,0.0008379471,0.00089371356,0.0017467991,0.00066174596,0.0012227788,0.0063224337,0.0005384856,0.0000592543],"category_scores_gemma":[0.00063251203,0.0008434246,0.00033957267,0.0012702158,0.000672727,0.0010927166,0.0017686859,0.0009357398,0.00010521719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018876115,0.000039046667,0.000008463074,0.00011013756,0.000012530753,0.000058211543,0.00046750405,0.014945208,0.00008605971,0.33016235,0.000037990605,0.6540536],"study_design_scores_gemma":[0.000056460663,0.00024026923,0.0000033315232,0.0005372829,0.0000115094945,0.000015730828,0.000001566796,0.41692516,0.020443503,0.55899304,0.0021049124,0.00066719216],"about_ca_topic_score_codex":0.00009446482,"about_ca_topic_score_gemma":0.0003476643,"teacher_disagreement_score":0.6533864,"about_ca_system_score_codex":0.0006887859,"about_ca_system_score_gemma":0.0013902308,"threshold_uncertainty_score":0.99981403},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020473142,0.00091284234,0.9914037,0.0005749846,0.0009783729,0.0007955113,0.000016850545,0.00016468659,0.0051510334],"genre_scores_gemma":[0.013651712,0.000058305133,0.9839059,0.001563546,0.00030463372,0.00003639577,0.000014067236,0.00002175884,0.00044367067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585944,0.00003218958,0.00059979805,0.0019684837,0.0007446679,0.0007954205],"domain_scores_gemma":[0.9962864,0.0011365921,0.00029528083,0.0017758707,0.00033663996,0.00016920795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012291317,0.0006016336,0.0008738361,0.0015442165,0.00035202588,0.0009484368,0.004345002,0.00040580894,0.000022182816],"category_scores_gemma":[0.000069306414,0.00050509075,0.00039863607,0.0017580917,0.00047490484,0.00039161654,0.0008838862,0.00053779327,0.000014835689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010077302,0.00002498457,0.000024597732,0.00003326751,0.00013527313,0.00003568914,0.00015358058,0.19942988,0.000007821239,0.07028578,0.0003146871,0.72954434],"study_design_scores_gemma":[0.00019000199,0.00020611082,0.00008613497,0.00006820352,0.00007627234,0.000005719826,4.3958124e-8,0.76475275,0.00009278073,0.23251328,0.0015416514,0.00046707978],"about_ca_topic_score_codex":0.000045571123,"about_ca_topic_score_gemma":0.00014992665,"teacher_disagreement_score":0.7290773,"about_ca_system_score_codex":0.0002047779,"about_ca_system_score_gemma":0.0007457855,"threshold_uncertainty_score":0.99974006},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016792187,0.0004004734,0.9903708,0.00019325607,0.0015775017,0.00048480532,0.000040659026,0.00004370089,0.0052095796],"genre_scores_gemma":[0.74500334,0.000020847492,0.25354072,0.00045184162,0.0001567672,0.0000056244053,0.000008185158,0.00002502737,0.0007876354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98986584,0.00010198279,0.0023347028,0.0021921454,0.004935591,0.00056974543],"domain_scores_gemma":[0.9810349,0.012977716,0.0011900949,0.002958405,0.0016570543,0.0001818698],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006940366,0.0005928113,0.0015782777,0.00729527,0.0002622652,0.0007882164,0.0045454074,0.00049317646,0.0009503661],"category_scores_gemma":[0.0061991047,0.00044574583,0.00068448076,0.0052315625,0.0009929276,0.00047295485,0.001695894,0.0006154326,0.00008197246],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053913,0.000022734674,0.0012484718,0.000012200624,0.00006259616,0.00002201477,0.00035071,0.08455059,0.000085696505,0.023470808,0.000056882327,0.8900634],"study_design_scores_gemma":[0.00022590366,0.000051107647,0.0021220124,0.00026555694,0.00008498559,0.000005202535,3.0928103e-7,0.515657,0.00024615286,0.47997236,0.0010673633,0.00030203033],"about_ca_topic_score_codex":0.000033355274,"about_ca_topic_score_gemma":0.00050961424,"teacher_disagreement_score":0.8897613,"about_ca_system_score_codex":0.00023683382,"about_ca_system_score_gemma":0.0005043227,"threshold_uncertainty_score":0.9999629},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007868294,0.00022192475,0.94861895,0.0017595917,0.0018377292,0.00060536724,0.00000766984,0.00028662817,0.04665426],"genre_scores_gemma":[0.03101771,0.00003408528,0.9522176,0.012394787,0.0008474029,0.000035885896,0.000012800517,0.000040082818,0.0033996673],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959081,0.00004614639,0.00038254267,0.0020047917,0.0008771439,0.000781291],"domain_scores_gemma":[0.99760425,0.00043259983,0.00017810163,0.0013835982,0.00019518971,0.00020628606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010121999,0.0006240431,0.0005804165,0.0010016626,0.00038069143,0.0007607117,0.0038113676,0.0004967799,0.000021958645],"category_scores_gemma":[0.00006669361,0.0005334664,0.00013772689,0.001490776,0.00027095302,0.00033769454,0.0017325575,0.0010760245,0.00009178412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013638822,0.000015678748,0.0000075319476,0.000027486974,0.000012499768,0.000024294191,0.00056142645,0.022857076,0.00004467462,0.17821662,0.0010017148,0.79721737],"study_design_scores_gemma":[0.00035815005,0.00029063603,0.00015385576,0.00039187333,0.000019223991,0.00007138824,3.4393955e-7,0.23252277,0.00086605473,0.7303267,0.033651486,0.0013475105],"about_ca_topic_score_codex":0.000010508703,"about_ca_topic_score_gemma":0.000044684937,"teacher_disagreement_score":0.7958698,"about_ca_system_score_codex":0.0003759751,"about_ca_system_score_gemma":0.00059681415,"threshold_uncertainty_score":0.9997117},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035774807,0.00053690036,0.98877376,0.0008657712,0.0025367853,0.000644489,0.000034374545,0.00010072095,0.0061494615],"genre_scores_gemma":[0.14610511,0.000023069035,0.8470462,0.0022208781,0.0004286975,0.000017300908,0.0000058647847,0.00005600003,0.0040968917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9901234,0.00014691649,0.0015792547,0.0028114866,0.0044432995,0.0008956448],"domain_scores_gemma":[0.98975426,0.005662006,0.00076844654,0.0025382584,0.00096899964,0.00030800546],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003290363,0.00078192854,0.0012663589,0.002689697,0.0006080321,0.0018312107,0.0044307187,0.00039258169,0.000389577],"category_scores_gemma":[0.0015320206,0.00056316727,0.00025598987,0.001699161,0.0015796912,0.00032826888,0.0019037041,0.001064301,0.00020324095],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003471936,0.000038603666,0.0012309352,0.000017474176,0.000022015396,0.00032036495,0.0004120141,0.0500637,0.000037956357,0.0011225184,0.0012267045,0.945473],"study_design_scores_gemma":[0.0009915481,0.00027900958,0.003099192,0.0016392132,0.0000488035,0.000224024,0.0000046229147,0.88615996,0.00028069798,0.07397358,0.031916726,0.0013826472],"about_ca_topic_score_codex":0.000029310417,"about_ca_topic_score_gemma":0.0002413676,"teacher_disagreement_score":0.94409037,"about_ca_system_score_codex":0.0003945918,"about_ca_system_score_gemma":0.0011461473,"threshold_uncertainty_score":0.999682},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001229713,0.0010110234,0.9913405,0.0010791809,0.0026850593,0.00049675815,0.000024064311,0.0001754898,0.0030649425],"genre_scores_gemma":[0.500917,0.00011825398,0.49544755,0.0017478798,0.0007788583,0.00003153549,0.00010113325,0.000038911323,0.000818888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948142,0.00007405073,0.00085871166,0.002309661,0.0010609027,0.000882436],"domain_scores_gemma":[0.9969058,0.00035011134,0.00039075356,0.0018555835,0.00032110934,0.00017666115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084411056,0.00065311504,0.001028291,0.0022680054,0.00027508906,0.00048678266,0.0032754666,0.00048660333,0.000043771743],"category_scores_gemma":[0.00008398225,0.00058992044,0.0003257486,0.004551676,0.0009683176,0.0006602275,0.0014276091,0.0010801394,0.000018553515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011351692,0.00007453362,0.00061501755,0.000023992032,0.00012665347,0.00016679747,0.0015320695,0.17265156,0.00001866105,0.055616036,0.00015353705,0.7690098],"study_design_scores_gemma":[0.0007234433,0.00024796347,0.002022893,0.00037634972,0.00010127942,0.0000311982,0.000001103176,0.9040731,0.00045341428,0.08857201,0.0021773614,0.0012198822],"about_ca_topic_score_codex":0.00018440004,"about_ca_topic_score_gemma":0.0004108059,"teacher_disagreement_score":0.7677899,"about_ca_system_score_codex":0.00057295494,"about_ca_system_score_gemma":0.00056327105,"threshold_uncertainty_score":0.99965525},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009053125,0.00037240383,0.99605894,0.0013835764,0.00031053723,0.000539861,0.0000034154298,0.00017856719,0.0010621645],"genre_scores_gemma":[0.046385206,0.00010987938,0.9508143,0.0012276891,0.00023437994,0.00006350044,0.000013777259,0.000027130402,0.0011241228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633193,0.00002858791,0.0004887468,0.0017042744,0.00084597163,0.00060048257],"domain_scores_gemma":[0.9969501,0.0013645338,0.00023605808,0.0009953096,0.00022440104,0.00022958763],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008327041,0.0003950052,0.0005721782,0.0009296732,0.000449079,0.00038561382,0.0024076162,0.00026669627,0.000012586312],"category_scores_gemma":[0.0003109022,0.00036343499,0.00016065736,0.0018249993,0.000697808,0.00022998806,0.0018486505,0.0007551759,0.0000068678055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053943654,0.00002992785,0.0001230825,0.000054599754,0.000055550267,0.000019605588,0.00013862166,0.3844925,0.00008349638,0.06438436,0.0000390487,0.5505738],"study_design_scores_gemma":[0.00018310099,0.000051232073,0.00011750966,0.000132604,0.000041487878,0.000011492095,5.401482e-8,0.9504599,0.00027809484,0.046043698,0.0023385359,0.00034229376],"about_ca_topic_score_codex":0.0000055573923,"about_ca_topic_score_gemma":0.00002396107,"teacher_disagreement_score":0.56596744,"about_ca_system_score_codex":0.00016155558,"about_ca_system_score_gemma":0.00032943368,"threshold_uncertainty_score":0.99988174},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007722117,0.00058932777,0.9925784,0.0002900983,0.0021663408,0.00028462688,0.000005212213,0.0001322054,0.0038766076],"genre_scores_gemma":[0.013874943,0.0000731699,0.98442805,0.0007002636,0.0002580046,0.0000071605464,0.0000017379886,0.00001631969,0.0006403411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968202,0.00004546855,0.00061749644,0.0011681768,0.0008865802,0.00046208664],"domain_scores_gemma":[0.9970823,0.00043524086,0.00039330433,0.0017081494,0.00028760493,0.00009340739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011576081,0.00039344298,0.0005260395,0.001036358,0.0001282343,0.0002030128,0.0042880583,0.00030985425,0.000007241977],"category_scores_gemma":[0.0002523765,0.00037641934,0.0001327064,0.00071281876,0.0007656397,0.0009520427,0.001689041,0.00061933417,0.0000137663765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004461577,0.0000212086,0.00003379679,0.00010543746,0.000009268332,0.000010468279,0.00039015102,0.009118584,0.00047213217,0.46765107,0.000028931605,0.52215445],"study_design_scores_gemma":[0.00016137224,0.00012717234,0.00017942241,0.0006321461,0.000008460961,0.000021202586,8.0560625e-8,0.5265872,0.024232091,0.44620174,0.0013451631,0.000503969],"about_ca_topic_score_codex":0.000021158703,"about_ca_topic_score_gemma":0.00000608736,"teacher_disagreement_score":0.5216505,"about_ca_system_score_codex":0.00023018499,"about_ca_system_score_gemma":0.00064128055,"threshold_uncertainty_score":0.99986875},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008294647,0.0035077296,0.9812064,0.0011429974,0.0009659895,0.0002918547,0.00010192896,0.000036002868,0.004452407],"genre_scores_gemma":[0.41055062,0.00036026913,0.58622015,0.0007673699,0.0004075511,2.481692e-7,0.00008719224,0.000008503366,0.0015981087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985098,0.000037120113,0.00019382671,0.00065359205,0.00036680404,0.00023882068],"domain_scores_gemma":[0.99871695,0.00060471194,0.00009012308,0.00044645995,0.000058516307,0.000083239116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035246206,0.00017989517,0.00029411996,0.00025900133,0.00014528549,0.00006911671,0.0006720776,0.00013028049,0.00010761641],"category_scores_gemma":[0.00012284589,0.00014379171,0.000029233788,0.00040193513,0.00074809365,0.00017959344,0.00030028517,0.00032335188,0.0000053192275],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012527726,0.00000487014,0.0018104898,0.00004293946,0.0000027458711,0.000003676301,0.000046817717,0.0069694,0.000043180433,0.00017601711,0.000009837303,0.9908775],"study_design_scores_gemma":[0.00011012502,0.0002020898,0.008732081,0.00018633425,0.000021401454,0.000007532009,2.635427e-7,0.87989694,0.00024281579,0.10939113,0.0010009042,0.00020838519],"about_ca_topic_score_codex":0.0006756672,"about_ca_topic_score_gemma":0.00033647477,"teacher_disagreement_score":0.99066913,"about_ca_system_score_codex":0.0000074281197,"about_ca_system_score_gemma":0.00017429909,"threshold_uncertainty_score":0.5863656},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029516526,0.0011987161,0.9898709,0.0010707318,0.0011544011,0.00090466376,0.000018739662,0.00030051757,0.005186139],"genre_scores_gemma":[0.48821333,0.0019121034,0.48965824,0.0117952395,0.00040577553,0.00023527877,0.00003694771,0.0002349861,0.0075080935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99434346,0.0001007446,0.00058655575,0.0024954383,0.0013688211,0.0011049776],"domain_scores_gemma":[0.99569684,0.0013226363,0.0002556083,0.0020856983,0.00030965748,0.00032955228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013877325,0.00075514376,0.00074502383,0.0026361644,0.00048232847,0.0007210525,0.003981663,0.00037960513,0.000018116052],"category_scores_gemma":[0.00017658024,0.0006722913,0.00017937062,0.0019278623,0.002134648,0.0006914442,0.0021070233,0.0014933912,0.000038865215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018651062,0.000034366927,0.00015822292,0.00012430578,0.00002679424,0.000091491354,0.00054311176,0.0061058593,0.00021167059,0.67919487,0.00011125397,0.3133794],"study_design_scores_gemma":[0.0003212649,0.0003625753,0.00009116027,0.00088311895,0.0000070920332,0.000042205764,1.9122848e-7,0.09982468,0.0010770657,0.8940686,0.0026268044,0.0006952522],"about_ca_topic_score_codex":0.000014751512,"about_ca_topic_score_gemma":0.000054126023,"teacher_disagreement_score":0.50021267,"about_ca_system_score_codex":0.00015313439,"about_ca_system_score_gemma":0.0004628234,"threshold_uncertainty_score":0.9995728},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000111160494,0.00053462805,0.9904573,0.000099935314,0.0010492424,0.00015366006,0.0000048331854,0.00033698542,0.0072522885],"genre_scores_gemma":[0.029663049,0.000095323936,0.96856195,0.00036782734,0.00037991573,0.0000102655495,0.000016341737,0.000055543165,0.0008497977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983814,0.000006578316,0.00024675406,0.00056658784,0.0004155396,0.00038314887],"domain_scores_gemma":[0.99909604,0.00016752735,0.000045965186,0.000451993,0.0001460182,0.000092448994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023604585,0.00035492695,0.00032546156,0.00048463812,0.00013380949,0.00019515633,0.0005776646,0.00020866093,0.00004795559],"category_scores_gemma":[0.00003949809,0.00031031572,0.000049551716,0.000419973,0.00025463218,0.00016310498,0.000117200965,0.00064860313,0.000019755938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031740085,0.000003246424,0.0000071082914,0.000033945613,0.000010287395,0.000013785972,0.00020024773,0.8909514,0.0000054794355,0.00048943266,0.0000060796738,0.10827584],"study_design_scores_gemma":[0.00018818436,0.00003888562,0.0000022779236,0.00055873784,0.000010072419,0.000011532194,9.435788e-7,0.99546874,0.0003496839,0.0025961543,0.00039139393,0.00038338962],"about_ca_topic_score_codex":0.0000073704437,"about_ca_topic_score_gemma":0.000029154326,"teacher_disagreement_score":0.107892446,"about_ca_system_score_codex":0.00021323233,"about_ca_system_score_gemma":0.00026823985,"threshold_uncertainty_score":0.9999349},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014621781,0.000034074965,0.9720644,0.003963561,0.00018562168,0.0003623956,0.000047075075,0.000022658849,0.02185805],"genre_scores_gemma":[0.963609,0.0000018851181,0.032876737,0.0021016973,0.000069064,0.000009831917,0.000006545473,0.000008846162,0.0013164171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661195,0.00008736579,0.0005315718,0.0008315988,0.0017045907,0.00023290528],"domain_scores_gemma":[0.9894826,0.0084013995,0.00038982957,0.0011026153,0.00056518416,0.000058409623],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002239387,0.0002618076,0.00041414401,0.00048061466,0.00029302016,0.00019334223,0.0024712116,0.000103680155,0.00026317773],"category_scores_gemma":[0.00060811616,0.00013969163,0.000100658195,0.0008883977,0.003884153,0.00008396768,0.00038319052,0.00047613925,0.000046930898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002037062,0.000018726952,0.00002068059,0.0000035229934,0.000005914027,0.0000015003285,0.00017287866,0.28079954,0.000004635456,0.64474016,0.00014507015,0.074067004],"study_design_scores_gemma":[0.000098784236,0.0000879376,0.0003254854,0.00015757578,0.000005243447,0.0000049418154,0.0000011674678,0.10678181,0.00012329896,0.89140433,0.00086831435,0.00014109163],"about_ca_topic_score_codex":0.000012763832,"about_ca_topic_score_gemma":0.0000779461,"teacher_disagreement_score":0.9621468,"about_ca_system_score_codex":0.00007252702,"about_ca_system_score_gemma":0.0005025383,"threshold_uncertainty_score":0.9988267},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000137064435,0.00026728594,0.9943066,0.001325781,0.001306971,0.001112385,0.000009273703,0.0003311099,0.0013268484],"genre_scores_gemma":[0.02515912,0.000033672786,0.97169614,0.0012518427,0.00055576384,0.00015314271,0.000009826202,0.000035690067,0.0011048197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966846,0.000029863802,0.00049709185,0.0016067926,0.00059123087,0.0005904261],"domain_scores_gemma":[0.99634236,0.001049166,0.00032723474,0.0018819562,0.0002864102,0.00011285002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005340292,0.00045672053,0.00040286453,0.00075307733,0.00050324184,0.00031679455,0.003485371,0.00030315085,0.0000027246329],"category_scores_gemma":[0.00017022918,0.000458891,0.00016259326,0.00094423426,0.00036694726,0.00052224257,0.0011586576,0.000544958,0.0000126268515],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009122905,0.000011822322,0.0000017666349,0.000025075278,0.000006658115,0.0000023314549,0.00026854046,0.11748513,0.00037163106,0.035142764,0.000044715314,0.84663045],"study_design_scores_gemma":[0.00023675205,0.0001019124,0.000014844531,0.000102914426,0.000006310679,0.000014869249,1.5075459e-7,0.5397752,0.0014680647,0.44793132,0.010015979,0.0003316809],"about_ca_topic_score_codex":0.000008493519,"about_ca_topic_score_gemma":0.00024618974,"teacher_disagreement_score":0.84629875,"about_ca_system_score_codex":0.000400707,"about_ca_system_score_gemma":0.0003724189,"threshold_uncertainty_score":0.99978626},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008486404,0.000117466305,0.9893287,0.0020698328,0.0014586211,0.00042069302,0.000005052149,0.00022437182,0.006366813],"genre_scores_gemma":[0.14450975,0.00022679301,0.8432412,0.0074221864,0.0005306386,0.000016895803,0.000059539834,0.00005879527,0.003934162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678606,0.00006120613,0.0004558206,0.001097165,0.0009783279,0.0006214508],"domain_scores_gemma":[0.9980314,0.00020186162,0.00022395578,0.0010082006,0.00036248929,0.00017209571],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059933093,0.00041656874,0.00036112737,0.0012325279,0.00030630664,0.00090274494,0.0027117196,0.0003185648,0.000054338023],"category_scores_gemma":[0.00003739923,0.00040832962,0.00012222957,0.0007956554,0.00040075523,0.0015023256,0.0014751328,0.00074306346,0.00006449884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029929813,0.000025741358,0.0000106593825,0.00005263996,0.000013715317,0.00004179105,0.0005501378,0.46481383,0.000039933348,0.04581371,0.000108301254,0.48852655],"study_design_scores_gemma":[0.0003550569,0.00008740444,0.000018901916,0.0003518679,0.0000063172542,0.000026626694,4.3117677e-7,0.9493255,0.00031110182,0.0483893,0.00068322243,0.00044427483],"about_ca_topic_score_codex":0.000034348315,"about_ca_topic_score_gemma":0.000111303,"teacher_disagreement_score":0.4880823,"about_ca_system_score_codex":0.00053794216,"about_ca_system_score_gemma":0.00089826004,"threshold_uncertainty_score":0.99983686},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015619726,0.0014685591,0.9910306,0.00054904615,0.0014810336,0.0009482667,0.000058082514,0.00017677473,0.0042720656],"genre_scores_gemma":[0.23759012,0.00011453151,0.7520744,0.0037107014,0.0004543722,0.00055130327,0.00013161516,0.000053479205,0.0053194873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723744,0.00003372273,0.00055920635,0.0010792363,0.0005828842,0.00050748285],"domain_scores_gemma":[0.9964189,0.00072360196,0.00028999618,0.002050878,0.00042093315,0.00009567346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000765708,0.0004137384,0.0005175325,0.0005304385,0.0003720689,0.0007018092,0.004099132,0.00027527235,0.000010277936],"category_scores_gemma":[0.00005935731,0.0004013136,0.00018198791,0.00047187172,0.00031246067,0.00045681474,0.0007125455,0.0004138656,0.000013059252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000124436765,0.00007055444,0.00003354533,0.00028986335,0.00002082916,0.00001068764,0.0006331821,0.06211586,0.00008053277,0.20110217,0.0010193563,0.734611],"study_design_scores_gemma":[0.0004792912,0.00016065054,0.000019385974,0.0010935813,0.000009168926,0.000005963395,4.902384e-7,0.8652509,0.0011277993,0.06402423,0.06720374,0.00062480534],"about_ca_topic_score_codex":0.000036300913,"about_ca_topic_score_gemma":0.000085335,"teacher_disagreement_score":0.80313504,"about_ca_system_score_codex":0.00027116822,"about_ca_system_score_gemma":0.00066406233,"threshold_uncertainty_score":0.9998439},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002079229,0.00016350888,0.98221177,0.001037646,0.00061897194,0.00027529732,0.000024269642,0.000019077283,0.013570215],"genre_scores_gemma":[0.74935156,0.0010080404,0.1501557,0.03659538,0.0018866222,0.000022988537,0.00041816966,0.00013378523,0.060427766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824905,0.000018777657,0.00017581,0.00079358864,0.0004241678,0.000338621],"domain_scores_gemma":[0.9990506,0.00006153599,0.000038064365,0.0006136777,0.00013605163,0.00010003325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033093052,0.00024062039,0.00019312296,0.00028979493,0.00009805366,0.00008183823,0.00075444434,0.0002588111,0.000023723942],"category_scores_gemma":[0.00009640051,0.00021061614,0.00008761534,0.00012500286,0.00038242817,0.0000026534808,0.00066428084,0.00047099128,0.000018463064],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008348537,0.000079297555,0.00004175282,0.000036441954,0.000017534745,0.000043419514,0.00006413891,0.03855246,0.010765492,0.0025123258,0.00030807054,0.9474956],"study_design_scores_gemma":[0.001205211,0.0018241659,0.00013537916,0.0006497923,0.000010743891,0.000027456452,3.4706218e-7,0.88734156,0.035268713,0.008551647,0.06385883,0.0011261706],"about_ca_topic_score_codex":0.000010289065,"about_ca_topic_score_gemma":0.000066107474,"teacher_disagreement_score":0.9463694,"about_ca_system_score_codex":0.000055793298,"about_ca_system_score_gemma":0.00043995868,"threshold_uncertainty_score":0.8588677},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003466731,0.0004716074,0.97673535,0.0009732091,0.0039679385,0.00029313288,0.0000019434406,0.0002690309,0.017253095],"genre_scores_gemma":[0.08507964,0.00031652598,0.89907575,0.008574732,0.0022331628,0.000024462523,0.000009380528,0.000063780404,0.0046225456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640286,0.000038574904,0.00051804155,0.0015303585,0.0008556595,0.0006544942],"domain_scores_gemma":[0.99762017,0.0004390706,0.00024989137,0.0013351294,0.00021423567,0.00014152417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087679137,0.00046607174,0.00045251564,0.0009764123,0.00043117176,0.00064317614,0.0031578434,0.0003955645,0.000050389317],"category_scores_gemma":[0.000100493235,0.00045208097,0.00016065277,0.0010058457,0.00044016427,0.0006866941,0.0018080869,0.0011055974,0.00007483224],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003631166,0.000011356481,0.000011288639,0.000030815125,0.000007754255,0.000039733095,0.0002950436,0.009793661,0.000040449835,0.03382423,0.00017881129,0.9557632],"study_design_scores_gemma":[0.00024956025,0.00015464923,0.00003072974,0.00082685467,0.000008860371,0.00005618308,1.0890415e-7,0.80783015,0.0012998796,0.15830028,0.030471757,0.00077096117],"about_ca_topic_score_codex":0.00002518791,"about_ca_topic_score_gemma":0.00007832344,"teacher_disagreement_score":0.95499223,"about_ca_system_score_codex":0.00032769926,"about_ca_system_score_gemma":0.00051287847,"threshold_uncertainty_score":0.9997931},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001455153,0.000118400785,0.9934081,0.00084475876,0.00033653463,0.00043053218,0.000010003001,0.00013388129,0.0047032833],"genre_scores_gemma":[0.15435182,0.000113985836,0.8406356,0.0016795428,0.00009544487,0.000038369057,0.000032424337,0.000040551844,0.0030122525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973651,0.000040505915,0.00046331223,0.0009363854,0.0008097182,0.00038493882],"domain_scores_gemma":[0.99807835,0.00030589977,0.00028766802,0.000887196,0.0003279412,0.00011293375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044742646,0.00034425376,0.00044842283,0.0006901791,0.00015299846,0.00033320757,0.0018826042,0.00018402899,0.000016245644],"category_scores_gemma":[0.000064434294,0.0002868217,0.00005996553,0.0006264734,0.00069994025,0.0008355971,0.0005726413,0.00036334354,0.000006952178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024038443,0.00012833103,0.000078607925,0.00038800374,0.000040342984,0.000071963485,0.0042955,0.10567576,0.000444198,0.08308712,0.00049023103,0.8052759],"study_design_scores_gemma":[0.00032750453,0.0003471812,0.000010998608,0.000660444,0.0000068594723,0.00001614487,4.4546718e-7,0.9660094,0.0015296027,0.029273447,0.0014276578,0.0003903378],"about_ca_topic_score_codex":0.000013159106,"about_ca_topic_score_gemma":0.000041836924,"teacher_disagreement_score":0.8603336,"about_ca_system_score_codex":0.000118773285,"about_ca_system_score_gemma":0.00085635856,"threshold_uncertainty_score":0.9999584},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000026399748,0.00023590884,0.98806095,0.001250809,0.002179024,0.00043103867,0.0000036544857,0.00036538442,0.007470613],"genre_scores_gemma":[0.012927963,0.00019144262,0.9794908,0.002098665,0.00023213789,0.000015928892,0.000008002652,0.00002319727,0.0050118533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683934,0.000039895884,0.00043290175,0.0013499636,0.0008083226,0.0005295726],"domain_scores_gemma":[0.99801314,0.00019651704,0.00016591596,0.001171881,0.00028772478,0.00016484402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006503034,0.0003839889,0.00035068105,0.0010444112,0.0003499236,0.00065595045,0.0026223906,0.00025112266,0.000027260096],"category_scores_gemma":[0.00010111299,0.00035352824,0.00011509304,0.0008657702,0.00043031367,0.00057199097,0.0014442737,0.00073071197,0.000073658695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035898495,0.000077151526,0.0000684242,0.00005930047,0.000015253189,0.00005051519,0.0008209342,0.14694625,0.000092752176,0.05266159,0.00023585855,0.7989684],"study_design_scores_gemma":[0.000266616,0.000074970114,0.00010047907,0.00023570936,0.000003375356,0.0000123511345,8.342435e-8,0.97132283,0.00026495178,0.02280328,0.004522548,0.00039278594],"about_ca_topic_score_codex":0.0000239627,"about_ca_topic_score_gemma":0.00008641043,"teacher_disagreement_score":0.8243766,"about_ca_system_score_codex":0.00039204615,"about_ca_system_score_gemma":0.0006400992,"threshold_uncertainty_score":0.9998917},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00697944,0.00022850763,0.99025774,0.0003029431,0.00016846035,0.0002593285,0.000027703805,0.000015001377,0.0017608614],"genre_scores_gemma":[0.9938952,0.000031450607,0.005783357,0.00013524265,0.00004318334,0.00000434196,0.00000588729,0.000003185495,0.00009819011],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968677,0.00014792717,0.0008006865,0.0009902032,0.00094955973,0.0002439231],"domain_scores_gemma":[0.9960194,0.0023223069,0.00030476824,0.0009629287,0.0003128369,0.000077745346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004852977,0.00020229307,0.00061291514,0.0010678519,0.00010058252,0.00013821488,0.0011178919,0.00019215225,0.000068490874],"category_scores_gemma":[0.0006807688,0.00016275974,0.00013133403,0.0021751586,0.0012911429,0.00014591051,0.00040415212,0.00039586096,0.0000016590965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003260818,0.00007192554,0.083315395,0.000022753564,0.000038580976,0.0000030268968,0.00050900975,0.2553662,0.000041154133,0.04771905,0.000006839079,0.61287344],"study_design_scores_gemma":[0.0001361377,0.000030118916,0.1118373,0.00011756798,0.000054307664,0.0000013865708,9.923745e-7,0.26788092,0.00015518047,0.6193979,0.00019393575,0.00019425557],"about_ca_topic_score_codex":0.000063858395,"about_ca_topic_score_gemma":0.0013143677,"teacher_disagreement_score":0.9869157,"about_ca_system_score_codex":0.0000832517,"about_ca_system_score_gemma":0.00016165662,"threshold_uncertainty_score":0.66371495},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040462576,0.000039384948,0.98940116,0.000042463325,0.00034710582,0.0002564784,0.000015184479,0.00014124138,0.005710729],"genre_scores_gemma":[0.9796023,0.0000026025787,0.01948029,0.00013005563,0.00037252207,0.000010999481,0.000049807983,0.000020105257,0.00033133585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980107,0.00030587602,0.0004357158,0.00039298608,0.00046172243,0.00039300462],"domain_scores_gemma":[0.99678206,0.0012705622,0.00050410314,0.0010983878,0.00028100197,0.00006389348],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0017150588,0.00037906438,0.0004830641,0.0005316821,0.0011243524,0.00028196478,0.001296644,0.00020058407,0.000050354178],"category_scores_gemma":[0.00006882246,0.00039342666,0.00018928069,0.00048476766,0.00023207605,0.00020393265,0.001102953,0.0030101351,0.0000053652393],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040097416,0.000061729035,0.0032766263,0.00002523627,0.000045534838,4.538543e-7,0.00027370805,0.0016619135,0.00034291367,0.00067916926,0.000019180063,0.99360955],"study_design_scores_gemma":[0.0004090475,0.00025148728,0.0030846803,0.0007189153,0.00016808,0.0000016185686,0.0000039868046,0.525546,0.01622084,0.45180658,0.0005841755,0.001204576],"about_ca_topic_score_codex":0.00505879,"about_ca_topic_score_gemma":0.0030434232,"teacher_disagreement_score":0.99240494,"about_ca_system_score_codex":0.00068382657,"about_ca_system_score_gemma":0.0001885191,"threshold_uncertainty_score":0.99985176},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002101996,0.00007757311,0.99383086,0.0001643383,0.0005666868,0.0005017434,0.000014004127,0.000057185145,0.004577436],"genre_scores_gemma":[0.9696856,0.000004493688,0.028440956,0.00017455171,0.0009929965,0.000061110564,0.000025332349,0.000021646269,0.000593275],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847806,0.00005854425,0.00037399092,0.00044991443,0.00027375176,0.00036572455],"domain_scores_gemma":[0.9972045,0.0014582272,0.00020350791,0.0008727002,0.00021570023,0.0000454015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009692526,0.0002976082,0.00031784418,0.00023892832,0.0012747531,0.00030434845,0.0011412593,0.00011387708,0.000026647154],"category_scores_gemma":[0.00003275351,0.00023238723,0.0002270149,0.00028302483,0.00044570176,0.000080257916,0.0004951927,0.00088927476,0.0000030909018],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010772581,0.000018925732,0.000042009277,0.0000070715055,0.000024893703,2.0856315e-7,0.00009721649,0.003078636,0.00011403293,0.011077989,0.00008144412,0.9854468],"study_design_scores_gemma":[0.0000946644,0.00007355534,0.00005778204,0.0001235896,0.00003925278,4.7275935e-7,9.294412e-7,0.33036458,0.0053564413,0.6502348,0.01332401,0.00032991526],"about_ca_topic_score_codex":0.00019510587,"about_ca_topic_score_gemma":0.00096471095,"teacher_disagreement_score":0.9851169,"about_ca_system_score_codex":0.00012658896,"about_ca_system_score_gemma":0.00016041815,"threshold_uncertainty_score":0.9804499},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027691016,0.00011467198,0.9927433,0.00011958695,0.00018488608,0.00048427496,0.000014366378,0.000054637043,0.0035151776],"genre_scores_gemma":[0.98184186,0.000012131863,0.01749063,0.00013443432,0.0002802219,0.000041744726,0.000024314355,0.000019634359,0.0001550424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987299,0.00007853871,0.00030710633,0.0002980497,0.00025143576,0.0003349869],"domain_scores_gemma":[0.99713546,0.001666169,0.00021344723,0.00076073216,0.00017826974,0.000045945635],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00088810397,0.00031616067,0.00036514175,0.0002548013,0.0018622967,0.00046925808,0.0008161012,0.000088320674,0.000007376931],"category_scores_gemma":[0.000012349187,0.00023532288,0.000100509904,0.00023963097,0.0010025107,0.000114965485,0.00050988444,0.00092698383,3.8916818e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003360111,0.000020106998,0.0003740839,0.000028882469,0.00007326086,3.74168e-7,0.0010479374,0.0029467312,0.000057232548,0.022880629,0.000027613512,0.97250956],"study_design_scores_gemma":[0.000262114,0.00030838462,0.00031646312,0.000699049,0.00011237327,0.0000034230363,0.00005772564,0.31432545,0.00094364886,0.6769979,0.005273753,0.000699701],"about_ca_topic_score_codex":0.0005637224,"about_ca_topic_score_gemma":0.00324454,"teacher_disagreement_score":0.97907275,"about_ca_system_score_codex":0.000100177844,"about_ca_system_score_gemma":0.00014488155,"threshold_uncertainty_score":0.99943715},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072534906,0.0011345099,0.9955713,0.00006186242,0.0012441613,0.00017712166,0.0000024893482,0.00010033012,0.0009828543],"genre_scores_gemma":[0.119675495,0.00009687705,0.8798059,0.0000620855,0.000265648,0.000001411547,0.0000014582675,0.000029738088,0.00006134335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845237,0.000022993016,0.00035908315,0.0005167664,0.000340166,0.0003086059],"domain_scores_gemma":[0.9991208,0.00031967196,0.00006507908,0.00033034515,0.00008511908,0.00007900859],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004880753,0.00029352334,0.00038133236,0.0008093459,0.00007400288,0.000063793115,0.00029706914,0.00014524575,0.0000067346687],"category_scores_gemma":[0.000048322487,0.00029914817,0.000058593898,0.0003895636,0.00018737155,0.00017627985,0.00013812758,0.0005757684,6.2179197e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009825033,0.000006693647,0.00039815475,0.00014086632,0.00000447102,0.000021593014,0.00009742857,0.23640843,0.010012445,0.00007288661,0.0000044189605,0.7528228],"study_design_scores_gemma":[0.0003291387,0.00004194613,0.0009755853,0.0018946931,0.000008353529,0.0000089208015,4.1648607e-7,0.96451634,0.02418665,0.0075085824,0.00020865537,0.00032072072],"about_ca_topic_score_codex":0.000008084456,"about_ca_topic_score_gemma":0.000005978139,"teacher_disagreement_score":0.7525021,"about_ca_system_score_codex":0.00020400141,"about_ca_system_score_gemma":0.000084040046,"threshold_uncertainty_score":0.99994606},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007828578,0.00007328337,0.9836271,0.00061172596,0.0007379553,0.0006866721,0.0000114702425,0.00088880653,0.013284702],"genre_scores_gemma":[0.09359714,0.000063027495,0.9021682,0.0012988948,0.000438032,0.000079515004,0.000012268616,0.000052528274,0.0022903755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962067,0.000041957297,0.0006249894,0.001786847,0.0007165051,0.0006229916],"domain_scores_gemma":[0.9965922,0.0006226314,0.0003597804,0.0018671118,0.0003832846,0.00017499758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005956699,0.00058768963,0.000520866,0.0013034078,0.00051129994,0.0006285991,0.0027792756,0.0004446731,0.00005577203],"category_scores_gemma":[0.000093009505,0.0005917289,0.00020609485,0.0012804187,0.0005686548,0.00053224247,0.00083176396,0.0007588526,0.00015284144],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012291852,0.00006694338,0.000017170738,0.00006546006,0.000015007292,0.00006274862,0.000072645424,0.0062521277,0.010368865,0.007944659,0.0001364899,0.9749856],"study_design_scores_gemma":[0.0002776765,0.00034765402,0.00020810291,0.00038355682,0.00002622372,0.00006027587,4.6241674e-8,0.8979038,0.043886185,0.052636404,0.0033397991,0.00093026954],"about_ca_topic_score_codex":0.000107000276,"about_ca_topic_score_gemma":0.00006312239,"teacher_disagreement_score":0.97405535,"about_ca_system_score_codex":0.00048212634,"about_ca_system_score_gemma":0.0007347596,"threshold_uncertainty_score":0.9996534},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015118415,0.00062448875,0.98411715,0.0012859749,0.0024158848,0.00027379388,0.000009068021,0.00026199347,0.010996537],"genre_scores_gemma":[0.03436666,0.00015568192,0.9603685,0.0037402622,0.00036039585,0.000006704789,0.000013145455,0.000027160933,0.00096149213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960608,0.00003268624,0.0005064913,0.0018245608,0.0010222219,0.00055322493],"domain_scores_gemma":[0.9974799,0.00029749697,0.00022842447,0.0015867399,0.00024055675,0.0001668428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040002543,0.0005163534,0.00051003316,0.0008423907,0.00029026912,0.0005664271,0.003280486,0.00026656015,0.000028809702],"category_scores_gemma":[0.00008791955,0.00046614133,0.00015038966,0.00061952363,0.00033523692,0.0013771611,0.002536754,0.0007921942,0.0000341168],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028529732,0.000016483562,0.0000052353043,0.000010441838,0.0000037300504,0.000024826384,0.0003311355,0.022428278,0.00016688234,0.021102933,0.000039214727,0.955868],"study_design_scores_gemma":[0.00014740539,0.000023554121,0.000030725747,0.0003464676,0.0000032093997,0.000004507801,8.0382236e-8,0.5920075,0.0006368113,0.40554693,0.0009625312,0.0002902346],"about_ca_topic_score_codex":0.00007304843,"about_ca_topic_score_gemma":0.000019699128,"teacher_disagreement_score":0.95557773,"about_ca_system_score_codex":0.00034209256,"about_ca_system_score_gemma":0.00042187306,"threshold_uncertainty_score":0.99977905},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053220487,0.00006394879,0.9969141,0.00015274374,0.00095327216,0.00029151246,0.000021547321,0.00009270513,0.0009780009],"genre_scores_gemma":[0.86901635,0.00002806742,0.12740842,0.00031875464,0.00227401,0.00003091497,0.0004920627,0.000028680486,0.00040275935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990904,0.0000069535854,0.00021915947,0.00034865525,0.00019852449,0.00013634992],"domain_scores_gemma":[0.99958193,0.00010775567,0.000055724053,0.00011654237,0.000104984465,0.0000330851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019209736,0.00015254827,0.00013541552,0.00030579674,0.00015006275,0.00014270119,0.000101933154,0.00013290788,0.000024335468],"category_scores_gemma":[0.000061246596,0.00016641956,0.000035272282,0.00008545016,0.000097103766,0.00023803455,0.000034276287,0.00016614926,0.0000038871294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022391207,0.000005971188,0.000037531307,0.00011180563,0.000008631884,0.0000016443616,0.00029488126,0.36732557,0.002726753,0.011846453,0.00031727582,0.61732125],"study_design_scores_gemma":[0.00019513698,0.000018088216,0.0003127745,0.00009676194,0.0000060516923,0.000006559711,2.2073627e-7,0.9778056,0.0015330575,0.019496746,0.0003856399,0.00014337695],"about_ca_topic_score_codex":0.0000018869769,"about_ca_topic_score_gemma":0.00002611424,"teacher_disagreement_score":0.86950564,"about_ca_system_score_codex":0.000117301795,"about_ca_system_score_gemma":0.000030843607,"threshold_uncertainty_score":0.67863923},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005912344,0.00015103466,0.99302185,0.00036530415,0.001810174,0.0004935488,0.000015751373,0.00022911548,0.003854121],"genre_scores_gemma":[0.09690046,0.000031903484,0.8999377,0.0025813316,0.00038423506,0.00003129256,0.000020954978,0.000019015359,0.00009309438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741995,0.000042029253,0.0005429857,0.00083371426,0.00058934756,0.00057198707],"domain_scores_gemma":[0.9968464,0.0014943457,0.0002988581,0.0009319367,0.00031137327,0.00011710628],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017965923,0.00043433448,0.00043203117,0.0015740275,0.0004780239,0.0010378312,0.002708433,0.0003003254,0.000006146236],"category_scores_gemma":[0.00029954084,0.00042285363,0.00019810048,0.00088511995,0.0003472683,0.0016244235,0.0011075541,0.0005138767,0.000008386697],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015755022,0.0000065655836,0.000062609666,0.00006287902,0.000011842067,0.0000036959534,0.00056888844,0.003051366,0.0000134917655,0.12027535,0.00003134248,0.8758962],"study_design_scores_gemma":[0.00029799464,0.000098653116,0.0000520415,0.0004841863,0.000009321562,0.000030396077,4.1186755e-7,0.5639397,0.00030992532,0.42810673,0.0061907563,0.00047990758],"about_ca_topic_score_codex":0.00001813936,"about_ca_topic_score_gemma":0.000018728428,"teacher_disagreement_score":0.8754163,"about_ca_system_score_codex":0.00018991831,"about_ca_system_score_gemma":0.00048296977,"threshold_uncertainty_score":0.99999917},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056946336,0.00006524456,0.99068314,0.00004191884,0.0008308533,0.0011542063,0.00001746303,0.004856344,0.001781374],"genre_scores_gemma":[0.8713211,0.00002192798,0.1282211,0.000057701425,0.00015964045,0.00005631499,0.000026965627,0.000037711052,0.00009757584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828964,0.000029494788,0.00033418566,0.0006626246,0.00035751978,0.00032651512],"domain_scores_gemma":[0.9991825,0.00008765206,0.00008322378,0.00036798176,0.00020477253,0.00007383645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035359475,0.00041101425,0.00041094935,0.00042850332,0.00028855467,0.00018501923,0.000471914,0.000308721,0.0000034439822],"category_scores_gemma":[0.00001233822,0.0003505347,0.00007336165,0.00027068384,0.000119273376,0.00021054668,0.00017039437,0.00060034485,0.0000032185026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023858669,0.000011198926,0.00004800411,0.001759321,0.00004867285,0.000010769156,0.0010839427,0.7987306,0.0007409187,0.002408739,0.00014209609,0.19499189],"study_design_scores_gemma":[0.0005032826,0.00012374145,0.0002102236,0.001400319,0.000032277374,0.000011031836,0.000013953163,0.9962432,0.0003074363,0.000026143938,0.00077801774,0.00035041405],"about_ca_topic_score_codex":0.000011276903,"about_ca_topic_score_gemma":0.000034594563,"teacher_disagreement_score":0.8707516,"about_ca_system_score_codex":0.0009031285,"about_ca_system_score_gemma":0.00010101224,"threshold_uncertainty_score":0.9998947},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032426752,0.0005001447,0.9640191,0.00016604392,0.0013607956,0.00064743595,0.0000012529752,0.000025763158,0.00085268624],"genre_scores_gemma":[0.9607546,0.00003895671,0.03794407,0.00050592504,0.00016876649,0.000026022803,0.0000020885195,0.00002293444,0.0005366413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808574,0.000081144724,0.00027802616,0.0009326004,0.0003573343,0.00026517574],"domain_scores_gemma":[0.99875504,0.00047411124,0.00020225617,0.00027961933,0.00019720006,0.00009178887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048019807,0.0003338641,0.00033769323,0.00040495125,0.0002998427,0.0004350006,0.0001978888,0.00025405295,0.00007560409],"category_scores_gemma":[0.00006390505,0.00029092477,0.00002504103,0.00017456335,0.0007602433,0.0003503973,0.00019447667,0.000519471,0.0000024660883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016996885,0.00016464936,0.002879044,0.00017328796,0.0002578152,0.00009345586,0.12907869,0.04330362,0.008554004,0.0018757802,0.00025007673,0.8116699],"study_design_scores_gemma":[0.0033645462,0.0013050451,0.008935382,0.0032121632,0.00027428457,0.0008691612,0.00034251646,0.9687225,0.0034353277,0.006101145,0.0017239276,0.0017139732],"about_ca_topic_score_codex":0.00021952183,"about_ca_topic_score_gemma":0.00016551005,"teacher_disagreement_score":0.92832786,"about_ca_system_score_codex":0.00018028697,"about_ca_system_score_gemma":0.00017928163,"threshold_uncertainty_score":0.9999543},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006933529,0.0005122452,0.997148,0.00058538216,0.00013414063,0.0013303441,0.00002137673,0.000108538254,0.000090637084],"genre_scores_gemma":[0.053610403,0.000010187905,0.9435321,0.0022421828,0.00010839584,0.00020494292,0.000047397545,0.000021885111,0.00022252114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981598,0.000032969107,0.00035228624,0.0007451827,0.00026856837,0.00044116107],"domain_scores_gemma":[0.9983402,0.0007741126,0.00017661868,0.00034419645,0.00026672363,0.000098187506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006254762,0.00036433295,0.00037355052,0.00042416868,0.0009907866,0.00061708153,0.0009975014,0.00016246656,7.241048e-7],"category_scores_gemma":[0.000038925064,0.00034541445,0.000048405396,0.00024077481,0.00027597346,0.00036113514,0.00050159084,0.00028034882,3.846258e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007998474,0.00013274777,0.001115461,0.0012275093,0.00008202449,0.0000059370386,0.16859154,0.008591431,0.0011225289,0.36825955,0.0028567135,0.44793457],"study_design_scores_gemma":[0.00037334932,0.0001277812,0.00006214982,0.0006495888,0.000010553097,0.000012148564,0.00002146924,0.98050886,0.00024741734,0.00966789,0.007916285,0.00040250405],"about_ca_topic_score_codex":0.0000044780495,"about_ca_topic_score_gemma":0.000031779025,"teacher_disagreement_score":0.97191745,"about_ca_system_score_codex":0.00013868902,"about_ca_system_score_gemma":0.00046679203,"threshold_uncertainty_score":0.9998998},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9704143,0.00008241083,0.027283603,0.000467921,0.0000991961,0.0005934923,0.0000044980916,0.00003354785,0.0010210698],"genre_scores_gemma":[0.99856937,0.0000052720948,0.0006207896,0.0007014814,0.000065519744,0.00000772055,5.819894e-7,0.000010593263,0.000018653116],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99817234,0.000007778517,0.00046954112,0.00069912674,0.00038435182,0.00026688763],"domain_scores_gemma":[0.9987267,0.0003945017,0.00038655906,0.00032014406,0.00016315278,0.000008941917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031372343,0.0003086774,0.00047905726,0.0005878137,0.00014074889,0.00036148654,0.0008008976,0.00030166694,0.0000019790787],"category_scores_gemma":[0.00074242067,0.0002334706,0.000048023696,0.00092234806,0.0016490603,0.0005226302,0.0015214499,0.00074859284,0.0000010293998],"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.00016628392,0.00043240582,0.49115705,0.0007607873,0.00003324801,0.000072337294,0.0017643669,0.025552379,0.000076376615,0.16122645,0.00001207235,0.3187462],"study_design_scores_gemma":[0.0011796601,0.00038169048,0.6504433,0.0074223476,0.00003875226,0.000016133703,0.000022961283,0.010247174,0.00007006948,0.3286963,0.00053970603,0.000941863],"about_ca_topic_score_codex":0.000040475443,"about_ca_topic_score_gemma":0.00036956868,"teacher_disagreement_score":0.31780437,"about_ca_system_score_codex":0.000060821214,"about_ca_system_score_gemma":0.00007983856,"threshold_uncertainty_score":0.9520654},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028559298,0.00020551833,0.9954603,0.0016126595,0.0008046239,0.00046511326,0.000006264751,0.00019770654,0.0009622619],"genre_scores_gemma":[0.08473596,0.000028778883,0.9125453,0.0018544102,0.00037730928,0.00002059345,0.000005224016,0.000023991875,0.0004084147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963978,0.000070674054,0.00050992944,0.0015431173,0.00087580027,0.00060267025],"domain_scores_gemma":[0.9972557,0.0009427224,0.00046818,0.0009436699,0.00027258391,0.000117189265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001606609,0.00044245616,0.00045561232,0.00046860124,0.0005307423,0.00062527036,0.0018339908,0.00032900213,0.000006015355],"category_scores_gemma":[0.00020423066,0.00044933928,0.00010534015,0.0007799363,0.00016941172,0.0015796697,0.001733104,0.0010069243,0.0000057285897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044622648,0.000043447206,0.00028942825,0.00005693509,0.000026243251,0.000011204414,0.00085453916,0.118912295,0.013792742,0.03817806,0.0000091664415,0.8278215],"study_design_scores_gemma":[0.00027677807,0.00003266183,0.0021476827,0.00023706155,0.000021089747,0.000016820703,2.2403337e-7,0.88762826,0.007880778,0.100926764,0.00027171907,0.0005601715],"about_ca_topic_score_codex":0.000033661814,"about_ca_topic_score_gemma":0.00010106751,"teacher_disagreement_score":0.8272613,"about_ca_system_score_codex":0.00067359186,"about_ca_system_score_gemma":0.00025291654,"threshold_uncertainty_score":0.99979585},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030768579,0.0004723707,0.96701366,0.00013552236,0.00048401972,0.00020262724,0.000019480041,0.0002533818,0.00065036555],"genre_scores_gemma":[0.9796966,0.00013212624,0.019701289,0.00006657325,0.00019516348,0.0000012417653,0.000014778,0.000030885923,0.00016136502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986024,0.000012167592,0.0003049162,0.00041597537,0.00033860796,0.0003259683],"domain_scores_gemma":[0.999367,0.00008609647,0.00007345353,0.00030260603,0.00007107343,0.00009975983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020700677,0.00032406874,0.00039425326,0.00048654136,0.000114477574,0.00018581472,0.0002822433,0.00016714871,0.0000113665565],"category_scores_gemma":[0.0000151217055,0.000286348,0.000088701134,0.00024346658,0.0001261151,0.00017317581,0.000116038624,0.00035852974,0.000005563089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033640806,0.000003886028,0.00012100389,0.000077964694,0.000025126526,0.000008343505,0.0002630152,0.9868068,0.00078319875,0.000058633832,0.000015605192,0.0118330335],"study_design_scores_gemma":[0.00012174422,0.000028167302,0.00027148493,0.00042040827,0.000042086518,0.0000142822455,8.5578904e-8,0.9976459,0.00014848732,0.0010209531,0.000018850375,0.00026755183],"about_ca_topic_score_codex":0.000089482375,"about_ca_topic_score_gemma":0.000016504158,"teacher_disagreement_score":0.948928,"about_ca_system_score_codex":0.00026107533,"about_ca_system_score_gemma":0.0000801763,"threshold_uncertainty_score":0.9999589},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093973964,0.0002600923,0.9922221,0.00027912005,0.0011681643,0.00035039187,0.000008347858,0.00011700572,0.004655072],"genre_scores_gemma":[0.22953695,0.00025457027,0.76715636,0.0020010557,0.00042642344,0.000011974811,0.000026735286,0.00004034951,0.00054557115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974747,0.000025834064,0.00043557648,0.0010406844,0.00057306583,0.0004501438],"domain_scores_gemma":[0.9989168,0.00020600807,0.00018408854,0.00041482612,0.00015359503,0.00012469407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004816114,0.00041021183,0.00037403067,0.0009621659,0.00038472208,0.0005723663,0.00085412577,0.00026714182,0.000044334483],"category_scores_gemma":[0.000028833541,0.0003989871,0.00009901574,0.00044787777,0.0004036044,0.0011728691,0.00033007291,0.0005350782,0.000013596964],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035494147,0.000012771786,0.000008427578,0.00007591215,0.0000092112095,0.000017837105,0.0002241367,0.002479329,0.00006558642,0.00253582,0.0000063119164,0.99456114],"study_design_scores_gemma":[0.00024205468,0.00006101954,0.00009886382,0.0006584185,0.000017630524,0.00008538046,2.3860662e-7,0.9628217,0.00031512196,0.03480906,0.00044920738,0.00044129262],"about_ca_topic_score_codex":0.000016623078,"about_ca_topic_score_gemma":0.00002649601,"teacher_disagreement_score":0.9941198,"about_ca_system_score_codex":0.00020681851,"about_ca_system_score_gemma":0.00041477635,"threshold_uncertainty_score":0.9998462},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014964798,0.00020523659,0.9960419,0.0006064639,0.0015932862,0.0006323064,0.0000055924224,0.00008712774,0.00067842554],"genre_scores_gemma":[0.13393727,0.00004553335,0.8636895,0.0008618954,0.0009018282,0.000028471793,0.000008032629,0.000032326818,0.00049513724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661833,0.000042167245,0.0005694628,0.00151032,0.00055391,0.00070578826],"domain_scores_gemma":[0.99824536,0.0004475196,0.00026847774,0.00060902676,0.00033092857,0.000098665834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092215004,0.00048531432,0.000529561,0.00094335363,0.00039682214,0.00065303646,0.0015706402,0.00029742424,0.0000042434444],"category_scores_gemma":[0.00019738537,0.00045852314,0.00016507911,0.00068334106,0.00024418053,0.0008580437,0.0009442798,0.0006186474,0.0000031453521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009088594,0.00002832984,0.000086996595,0.000050723378,0.0000067203723,0.000014577364,0.00035879738,0.5963121,0.0017883212,0.0041900356,0.00010136835,0.3970529],"study_design_scores_gemma":[0.00026890228,0.00006713792,0.00005600874,0.0007011863,0.000007872953,0.0000078442135,1.8092878e-7,0.9355928,0.0037506013,0.05901114,0.00013618666,0.00040017563],"about_ca_topic_score_codex":0.00005308482,"about_ca_topic_score_gemma":0.00038441524,"teacher_disagreement_score":0.39665276,"about_ca_system_score_codex":0.0004781367,"about_ca_system_score_gemma":0.0005151926,"threshold_uncertainty_score":0.9997867},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082701613,0.00023172332,0.9940127,0.00047867952,0.00097075786,0.00080187654,0.000012116102,0.00024882905,0.002416295],"genre_scores_gemma":[0.11575659,0.0000137062425,0.8818741,0.0019874384,0.00022712696,0.000028606039,0.000011844084,0.00003670369,0.000063869236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951302,0.000066373126,0.0008628196,0.0021446492,0.0008812892,0.000914706],"domain_scores_gemma":[0.9966361,0.0006198635,0.00048992486,0.0017984004,0.00029081042,0.00016491213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006146268,0.0006561093,0.0006719549,0.0014468061,0.00052833266,0.00048471472,0.003458115,0.00032698727,0.0000085728425],"category_scores_gemma":[0.00012770915,0.00070452405,0.000135821,0.0018488354,0.000931779,0.0011493802,0.0016140871,0.0013410816,0.000009248431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011235668,0.00004126029,0.00018883968,0.00010871879,0.000009433098,0.00017774399,0.00020227121,0.31757066,0.0020875107,0.03016761,0.000019981042,0.6494147],"study_design_scores_gemma":[0.00040334318,0.000046385183,0.0002754095,0.0010476827,0.0000067746137,0.000037037793,1.6194574e-7,0.8653374,0.0028940507,0.12893914,0.0003568314,0.0006558075],"about_ca_topic_score_codex":0.000043067328,"about_ca_topic_score_gemma":0.00014589392,"teacher_disagreement_score":0.64875895,"about_ca_system_score_codex":0.00089701137,"about_ca_system_score_gemma":0.0012042086,"threshold_uncertainty_score":0.99954057},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011361923,0.0006601941,0.9922093,0.0008616284,0.0022652664,0.00079524115,0.000013182175,0.00018172163,0.003002074],"genre_scores_gemma":[0.006874851,0.000033523746,0.98954004,0.0015269578,0.00046378674,0.000032278465,0.000015278414,0.000031773227,0.001481502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959021,0.0000872906,0.0006824501,0.0017751467,0.0008915815,0.0006613848],"domain_scores_gemma":[0.996339,0.0007913987,0.00034984772,0.0016328823,0.00075104344,0.00013580816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016561837,0.00056677137,0.0005851413,0.0009459365,0.0004904937,0.000839546,0.0033495065,0.00041839632,0.0000066220714],"category_scores_gemma":[0.0001886795,0.0005311363,0.00020426774,0.0007160761,0.00043936225,0.001492601,0.0009994984,0.00063904666,0.000011406777],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041802454,0.000050126546,0.000004794345,0.0001843233,0.000014200528,0.00008158058,0.00080475054,0.026708677,0.007876281,0.041634478,0.00030155806,0.9222974],"study_design_scores_gemma":[0.0004009639,0.00008587374,0.0000051807942,0.0003629013,0.000007489854,0.00001263699,4.7835098e-8,0.5723978,0.0029508206,0.42319155,0.00022336682,0.00036131896],"about_ca_topic_score_codex":0.000038791313,"about_ca_topic_score_gemma":0.000037654223,"teacher_disagreement_score":0.9219361,"about_ca_system_score_codex":0.00037604166,"about_ca_system_score_gemma":0.000843884,"threshold_uncertainty_score":0.999714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008602058,0.0041251965,0.99189556,0.0002410348,0.00067663554,0.0003490807,0.000013991085,0.0004103787,0.002202108],"genre_scores_gemma":[0.14261276,0.000025870977,0.8562517,0.0004365805,0.00014677462,0.0000070173833,0.0000042979696,0.00002055478,0.0004944486],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996627,0.00003002216,0.0005964418,0.0012414944,0.00089887454,0.0006062055],"domain_scores_gemma":[0.9968782,0.0010335775,0.00047282033,0.0010703909,0.0004454288,0.00009957865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009831726,0.0005003793,0.00074699736,0.0017380298,0.00017198968,0.00044379142,0.003729726,0.00033743322,0.000014356585],"category_scores_gemma":[0.00076238887,0.0004494301,0.000142709,0.001262785,0.00091786357,0.00082191074,0.0017878873,0.00093379646,0.000003134087],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008397933,0.00001796343,0.0000135950695,0.00018797556,0.000023674933,0.00012117522,0.0055114357,0.00093902915,0.0033960603,0.027023735,0.000031480515,0.96272546],"study_design_scores_gemma":[0.0005373621,0.00032511496,0.000052922212,0.0052278326,0.000040046893,0.00010985017,0.0000058661817,0.3586673,0.16248585,0.47060335,0.0003454005,0.0015991011],"about_ca_topic_score_codex":0.0000395832,"about_ca_topic_score_gemma":0.000021866352,"teacher_disagreement_score":0.9611264,"about_ca_system_score_codex":0.0002315769,"about_ca_system_score_gemma":0.0008026692,"threshold_uncertainty_score":0.99979573},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035866155,0.00009554764,0.9781666,0.0009734054,0.0032514308,0.0011089232,0.000008038504,0.00046738863,0.015925124],"genre_scores_gemma":[0.001102765,0.000026526019,0.9887259,0.007605065,0.00047587068,0.00007555145,0.000019685178,0.000026874308,0.0019417326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949876,0.00007003883,0.00069566956,0.001910201,0.0016607638,0.00067574164],"domain_scores_gemma":[0.99691373,0.0005998717,0.0002577624,0.0014909738,0.0004115913,0.0003260516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010884175,0.00056352624,0.00054065365,0.001459215,0.00022569892,0.0008825172,0.0038118148,0.00034129925,0.000028199882],"category_scores_gemma":[0.00044066887,0.00053870596,0.00012629094,0.0012440531,0.0005578397,0.00088970014,0.0017620127,0.0010170428,0.00009479848],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005475702,0.000059029626,0.00000440081,0.00011198912,0.0000127848025,0.000030436897,0.0009760301,0.0011414889,0.0024671536,0.012985709,0.003735645,0.97846985],"study_design_scores_gemma":[0.0010034139,0.00054037623,0.00006483757,0.0015841592,0.000045345423,0.00009335451,0.0000016565187,0.7550823,0.08996333,0.14705926,0.0022911143,0.002270865],"about_ca_topic_score_codex":0.000028475557,"about_ca_topic_score_gemma":0.000009713823,"teacher_disagreement_score":0.976199,"about_ca_system_score_codex":0.00056562055,"about_ca_system_score_gemma":0.000811951,"threshold_uncertainty_score":0.99970645},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004459833,0.0002669325,0.9846819,0.0015452262,0.0017846327,0.000732783,0.000012092875,0.00046409157,0.010066371],"genre_scores_gemma":[0.043958377,0.000027345388,0.94981855,0.002826372,0.00041186978,0.000047412712,0.000037806858,0.000066773675,0.002805468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949328,0.0003536983,0.0009033434,0.0015413847,0.0011056634,0.0011631611],"domain_scores_gemma":[0.9943644,0.002369324,0.00055711786,0.0020741175,0.00035661864,0.0002784577],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003958283,0.0008166589,0.00097006175,0.0011880139,0.0017808657,0.0013385802,0.0066974526,0.00048508128,0.000037685902],"category_scores_gemma":[0.0006267363,0.0008327203,0.00035421213,0.00083039596,0.00068332173,0.00075759954,0.0027426898,0.002934415,0.000016702435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004669765,0.00005417506,0.000016158854,0.00014472891,0.00005425703,0.000049452934,0.01796273,0.32722273,0.00045829598,0.16099423,0.00017909225,0.49281743],"study_design_scores_gemma":[0.0017563874,0.00036776878,0.000051902673,0.0007349744,0.000022461236,0.00006891457,0.00002284859,0.64702207,0.00023473568,0.32633382,0.022107214,0.00127694],"about_ca_topic_score_codex":0.00007372554,"about_ca_topic_score_gemma":0.00013046374,"teacher_disagreement_score":0.4915405,"about_ca_system_score_codex":0.0004152928,"about_ca_system_score_gemma":0.001018263,"threshold_uncertainty_score":0.9996981},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010285476,0.00015331422,0.99440545,0.0005684182,0.0005263649,0.00053109875,0.00000236647,0.00043259258,0.0033700848],"genre_scores_gemma":[0.7648298,0.00004464023,0.23243172,0.0014452805,0.00037106645,0.00006976104,0.0000048329302,0.000029273951,0.000773576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717736,0.000022069567,0.0003906981,0.0013633574,0.00053534575,0.00051114184],"domain_scores_gemma":[0.9979659,0.00016096607,0.00024718457,0.0013240911,0.00017464103,0.00012724749],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030178388,0.0004452101,0.00035150658,0.0005935587,0.0004303775,0.000503967,0.0021622125,0.00028201783,0.000014187386],"category_scores_gemma":[0.00001313995,0.0003760067,0.0001073118,0.0010122163,0.00043254983,0.00043298723,0.00080172357,0.0007764294,0.000006062354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050882586,0.00001747306,0.00002313525,0.000013383439,0.000008313493,0.000014046265,0.00004815994,0.03887855,0.000025616659,0.010368101,0.00001169619,0.95058644],"study_design_scores_gemma":[0.00013684358,0.00026206684,0.0000718854,0.00014873773,0.000010855265,0.0000506139,1.0046434e-7,0.9499389,0.001123211,0.046552416,0.0012495337,0.00045485716],"about_ca_topic_score_codex":0.000029948133,"about_ca_topic_score_gemma":0.00024781685,"teacher_disagreement_score":0.9501316,"about_ca_system_score_codex":0.00025233152,"about_ca_system_score_gemma":0.00017096837,"threshold_uncertainty_score":0.99986917},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012283287,0.00040083454,0.9800899,0.005950471,0.0006326781,0.00054693787,0.000004128682,0.00017770725,0.012185053],"genre_scores_gemma":[0.43013588,0.0021581159,0.5501791,0.0033013616,0.00073383603,0.00025425295,0.00001995461,0.000066746215,0.0131506985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741286,0.00003296956,0.00055280834,0.0010823286,0.0005195941,0.00039945287],"domain_scores_gemma":[0.9978073,0.00055131427,0.00022341928,0.0012248127,0.0001326558,0.000060447048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009429502,0.0002967306,0.00024823146,0.0005758051,0.00039061008,0.00046680553,0.0023857916,0.00020821675,0.0000029873315],"category_scores_gemma":[0.000060210656,0.00023332049,0.00008231095,0.0008889518,0.00034622513,0.00027913568,0.0008660902,0.0006425058,0.00002424645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046280056,0.000017634362,0.0000047747253,0.000016738777,0.000003953342,0.00001166573,0.00031194114,0.0019437781,0.000046042107,0.0904096,0.00010350354,0.9071257],"study_design_scores_gemma":[0.0003661594,0.00018950622,0.00018362244,0.0005137729,0.0000068864892,0.000019688418,9.174701e-7,0.51081824,0.0026821834,0.4670761,0.017544352,0.00059856975],"about_ca_topic_score_codex":0.00004783308,"about_ca_topic_score_gemma":0.0004196323,"teacher_disagreement_score":0.90652716,"about_ca_system_score_codex":0.00029968587,"about_ca_system_score_gemma":0.00034158508,"threshold_uncertainty_score":0.9514534},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042465523,0.0015883925,0.9777744,0.0018469798,0.0040410794,0.00042642144,0.0000109518605,0.00019546517,0.014073845],"genre_scores_gemma":[0.24974452,0.0013749595,0.7341626,0.0032872832,0.0022616745,0.000058408135,0.000028551423,0.00010537072,0.008976634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956185,0.000161601,0.000765268,0.0016775839,0.0010246127,0.0007523836],"domain_scores_gemma":[0.995462,0.0023542044,0.0003934001,0.0013812752,0.00029938464,0.000109740875],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0030581804,0.00053404615,0.00048555745,0.0005952435,0.000756647,0.0013410742,0.0031439378,0.00030951502,0.000007956889],"category_scores_gemma":[0.0003033027,0.0004086851,0.00018061507,0.0007816978,0.0005040105,0.00065201375,0.001048837,0.0010547222,0.000025349342],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013951022,0.000016558002,0.000014588777,0.00004232954,0.000019373247,0.00006189988,0.00074316066,0.0013379663,0.00006809913,0.011532044,0.000055960765,0.98609406],"study_design_scores_gemma":[0.0015122922,0.0007417005,0.0009309046,0.0014970701,0.000026700849,0.00013829778,0.0000023540347,0.52807987,0.011130701,0.41912958,0.03473794,0.0020725841],"about_ca_topic_score_codex":0.000012646485,"about_ca_topic_score_gemma":0.000536097,"teacher_disagreement_score":0.9840215,"about_ca_system_score_codex":0.00029606186,"about_ca_system_score_gemma":0.00071431184,"threshold_uncertainty_score":0.9998365},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07143457,0.0002228937,0.91852254,0.00047300055,0.0024719555,0.0035579319,0.00003171506,0.000113591355,0.003171793],"genre_scores_gemma":[0.98690236,0.0000065888407,0.011624571,0.00067247637,0.00022174715,0.00018739268,0.00016093471,0.000024237519,0.00019969672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973385,0.00025659258,0.00042014415,0.0012296616,0.00048958545,0.0002655712],"domain_scores_gemma":[0.9987809,0.00019542925,0.00021959162,0.0003518663,0.0003658936,0.0000863034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017857222,0.00032678203,0.00032547791,0.0005009124,0.00035924904,0.00016178442,0.00019150667,0.0002971509,0.00013418533],"category_scores_gemma":[0.00007021919,0.00033220934,0.0000716871,0.0002153912,0.00017572433,0.00024424604,0.0000621146,0.0003728863,0.000009435647],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088115434,0.00053637236,0.00005525774,0.0000408383,0.00002102757,0.0000012111641,0.0015653231,0.00044952217,0.0002714086,0.00035378046,0.0000059683266,0.9966112],"study_design_scores_gemma":[0.0041357535,0.005282043,0.008076593,0.0011561969,0.00023426805,0.000062469786,0.000058147438,0.67608887,0.0018545645,0.3017343,0.00011034284,0.001206486],"about_ca_topic_score_codex":0.00003631719,"about_ca_topic_score_gemma":0.0001342971,"teacher_disagreement_score":0.99540466,"about_ca_system_score_codex":0.00046868465,"about_ca_system_score_gemma":0.00016348323,"threshold_uncertainty_score":0.999913},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03335251,0.0008598115,0.9562971,0.0034082339,0.0013806456,0.0028380633,0.00016098833,0.00011186003,0.0015908057],"genre_scores_gemma":[0.8765771,0.00056984654,0.10094037,0.0051336586,0.00317473,0.00027383622,0.0010902685,0.000012153716,0.0122280605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976925,0.000026498095,0.00040501598,0.0010028607,0.00046606807,0.00040705813],"domain_scores_gemma":[0.99893737,0.000512299,0.00017242122,0.00011992788,0.0001825289,0.00007543198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000331079,0.00040285196,0.00041697748,0.000110977824,0.00027187105,0.00018817178,0.00065037404,0.00039967016,0.000022881113],"category_scores_gemma":[0.00006499004,0.00014890854,0.00014486686,0.00049511204,0.00012258408,0.00021332185,0.00028253553,0.00036714485,0.000005293727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046210193,0.00011547157,0.0003806734,0.000055989763,0.000011722461,0.000010979725,0.0007706851,0.053604983,0.10537168,0.0010601914,0.00089466857,0.83767676],"study_design_scores_gemma":[0.00047839078,0.00036275617,0.0036946912,0.0012980271,0.00003432381,0.000010589592,0.0000048472193,0.92220867,0.0135817705,0.05536566,0.0019288646,0.0010314012],"about_ca_topic_score_codex":0.000054358356,"about_ca_topic_score_gemma":0.0036284341,"teacher_disagreement_score":0.8686037,"about_ca_system_score_codex":0.00018961786,"about_ca_system_score_gemma":0.000056657267,"threshold_uncertainty_score":0.6072314},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.562324,0.011836012,0.41322562,0.0017844148,0.003785894,0.0026399766,0.00012519365,0.0002697158,0.0040091574],"genre_scores_gemma":[0.9859068,0.00018000722,0.009761498,0.0010049812,0.0014702571,0.000028831226,0.00013895106,0.0000056720874,0.0015030502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978898,0.00003727379,0.00036095054,0.00080714544,0.00055153045,0.00035330752],"domain_scores_gemma":[0.9992376,0.00023479335,0.0001415079,0.00011844214,0.00017011922,0.00009756163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032768978,0.00035297908,0.0003508881,0.00010864281,0.00027121694,0.00039224437,0.00043423966,0.00023026732,0.000018660809],"category_scores_gemma":[0.000013691571,0.00015155716,0.000068236965,0.00041828808,0.00019256235,0.000209031,0.00026785894,0.00030971065,0.000003600216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018947869,0.00016206986,0.0011744357,0.00009420686,0.00004780586,0.000032364038,0.0019061666,0.54427916,0.025635045,0.0041286945,0.00017940362,0.42234167],"study_design_scores_gemma":[0.00054511614,0.0003526084,0.006066456,0.0012703536,0.00009956678,0.000079470956,0.00003350715,0.9707529,0.00079495675,0.015822701,0.0027124763,0.0014699158],"about_ca_topic_score_codex":0.00014988106,"about_ca_topic_score_gemma":0.0002351262,"teacher_disagreement_score":0.4264737,"about_ca_system_score_codex":0.00015613517,"about_ca_system_score_gemma":0.000049230257,"threshold_uncertainty_score":0.61803216},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0184099,0.0013216602,0.972158,0.003049516,0.0007703771,0.0027371063,0.0001333258,0.00021374863,0.0012063754],"genre_scores_gemma":[0.16434914,0.00038552482,0.8210921,0.0035719587,0.0024366057,0.00026604865,0.00026869462,0.000009408536,0.007620487],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986321,0.000014785476,0.00021109392,0.0007054395,0.0002007089,0.00023590312],"domain_scores_gemma":[0.99935514,0.0002533423,0.000113442875,0.00006598748,0.0001443869,0.0000677042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022654179,0.00025716602,0.00026148642,0.000055127897,0.00031019177,0.00021277352,0.0002560021,0.0002192765,0.000011465347],"category_scores_gemma":[0.000016194672,0.00010639139,0.00006118002,0.0001853891,0.00031548034,0.00017527262,0.00022723153,0.00019357164,9.232632e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020255531,0.00002803275,0.00043378666,0.000033129243,0.0000107294845,0.0000030833821,0.00014320551,0.00003829616,0.04364643,0.00037658442,0.00010990249,0.95515656],"study_design_scores_gemma":[0.006781362,0.012870013,0.29028592,0.010616808,0.0008273742,0.00044161762,0.00017704227,0.21120422,0.19468112,0.14881358,0.11014034,0.013160628],"about_ca_topic_score_codex":0.00007887333,"about_ca_topic_score_gemma":0.0009962568,"teacher_disagreement_score":0.9419959,"about_ca_system_score_codex":0.000047863876,"about_ca_system_score_gemma":0.000018757875,"threshold_uncertainty_score":0.43385148},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91133547,0.00490386,0.077214815,0.0028079485,0.001727256,0.0008940112,0.000050982067,0.00008963471,0.00097604253],"genre_scores_gemma":[0.9968549,0.00004071008,0.002053263,0.00068053504,0.000330492,0.0000013343522,0.00000976647,0.0000012719673,0.000027725491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870527,0.000025421368,0.0002825969,0.0004933248,0.00020369963,0.0002896686],"domain_scores_gemma":[0.99922884,0.00039945764,0.00013750505,0.00007463844,0.0000999585,0.00005960117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026828435,0.00023772346,0.00034844497,0.000069741116,0.00017991541,0.0001527288,0.00030502674,0.0002694187,0.000006485133],"category_scores_gemma":[0.000049952665,0.00010362015,0.000035086763,0.00054081815,0.00034720878,0.00016141211,0.00033642174,0.00040310354,8.405443e-8],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048082562,0.00007694923,0.13577078,0.0001357409,0.000036118065,0.00006325925,0.001638425,0.013220962,0.008117503,0.0037682762,0.000027926684,0.837096],"study_design_scores_gemma":[0.00069511053,0.000572574,0.3290662,0.0014135957,0.00007133981,0.00006648786,0.000041043324,0.64640146,0.0008014026,0.018342441,0.0009298949,0.0015984362],"about_ca_topic_score_codex":0.00023142388,"about_ca_topic_score_gemma":0.0037496875,"teacher_disagreement_score":0.83549756,"about_ca_system_score_codex":0.000028415001,"about_ca_system_score_gemma":0.000027227812,"threshold_uncertainty_score":0.4225507},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030648292,0.0005606555,0.99700886,0.00011987494,0.00073834386,0.00019934855,0.000004125204,0.00012143884,0.00094087713],"genre_scores_gemma":[0.82133746,0.0001053566,0.1770375,0.00090059405,0.0002926731,0.0000053607205,0.000024001016,0.00006127673,0.00023574902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986194,0.000010689842,0.00029940455,0.00047998954,0.00028759486,0.00030293418],"domain_scores_gemma":[0.99927896,0.00020207452,0.00005522967,0.00032665796,0.000067874054,0.00006920661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002090806,0.00030203903,0.00029469552,0.00048548615,0.00010654641,0.00020836738,0.0003163057,0.00020575557,0.0000102212825],"category_scores_gemma":[0.000030403844,0.00030288816,0.000055636774,0.00022810325,0.00015224099,0.00009935687,0.00007903121,0.00037435,0.0000033232077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013774819,0.0000027840983,0.000043714223,0.00010248932,0.000005845429,0.000013583022,0.00007818198,0.806514,0.00008053353,0.00083325326,0.000011081651,0.19231315],"study_design_scores_gemma":[0.00018919857,0.000022532427,0.00009437979,0.0006379276,0.000008042825,0.0000042326947,2.0350318e-7,0.9946453,0.00034946817,0.0029729595,0.0007615838,0.00031415676],"about_ca_topic_score_codex":0.0000052009577,"about_ca_topic_score_gemma":0.000029619045,"teacher_disagreement_score":0.821031,"about_ca_system_score_codex":0.00012807501,"about_ca_system_score_gemma":0.00009973278,"threshold_uncertainty_score":0.9999423},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008369897,0.00069125806,0.9974495,0.00011408147,0.0000399495,0.0003712842,0.0002564418,0.0000092605,0.00023122359],"genre_scores_gemma":[0.098778844,0.0010301176,0.8906902,0.0024782745,0.00031254548,0.00006386522,0.0038080937,0.00006254745,0.0027755222],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99879223,0.000012932825,0.00023474458,0.0006243069,0.00017488385,0.00016092832],"domain_scores_gemma":[0.99912304,0.000059142494,0.00018092142,0.0004867614,0.00011814448,0.000032021268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002551943,0.00019755078,0.0002551428,0.00020761616,0.00004785239,0.000029998018,0.00044513127,0.00018730597,0.0000044465373],"category_scores_gemma":[0.00008147613,0.00019515614,0.00006835329,0.0001071185,0.00022152763,0.000009862181,0.0003379823,0.00011016518,8.148405e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010743641,0.00007671412,0.0001444341,0.0003397661,0.0001493981,0.0000055810247,0.000115570096,0.0011522211,0.6866633,0.00023627716,0.005251956,0.30575734],"study_design_scores_gemma":[0.00039046796,0.0003044033,0.000026114572,0.00034925164,0.00009179199,0.0000068567897,3.222796e-7,0.01098203,0.9640939,0.00855449,0.014745273,0.00045508076],"about_ca_topic_score_codex":0.000012655039,"about_ca_topic_score_gemma":0.00004142734,"teacher_disagreement_score":0.30530226,"about_ca_system_score_codex":0.0000328696,"about_ca_system_score_gemma":0.00013696143,"threshold_uncertainty_score":0.79582363},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049892935,0.0002859592,0.98420674,0.0017269945,0.0012365126,0.0012511689,0.000056024306,0.00004636045,0.010691285],"genre_scores_gemma":[0.86666226,0.00007309301,0.11819549,0.011941329,0.00070171524,0.00019127746,0.0005464844,0.000056461213,0.0016319096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982125,0.00010403163,0.0003020634,0.00078587467,0.00028329281,0.0003122301],"domain_scores_gemma":[0.9984265,0.0008680341,0.00015672475,0.0003443751,0.00015969729,0.000044682358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008426143,0.00029413486,0.0003085882,0.0006441134,0.0001761947,0.00014274825,0.00037117212,0.000416892,0.00003346657],"category_scores_gemma":[0.00006183013,0.00023443253,0.00009219343,0.00024240026,0.00035739975,0.00013757349,0.000057131016,0.00057163293,0.000008028422],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001423994,0.00010840459,0.000017110968,0.00007742396,0.000013828238,0.0000139355425,0.0016796642,0.0030341512,0.000029521429,0.00571671,0.00034860856,0.9888182],"study_design_scores_gemma":[0.0035659638,0.0003376464,0.00038163885,0.0010182324,0.000041008043,0.000053441578,0.000006976129,0.53925675,0.00010258041,0.45258147,0.0020688814,0.0005854115],"about_ca_topic_score_codex":0.000042833944,"about_ca_topic_score_gemma":0.00024524448,"teacher_disagreement_score":0.98823285,"about_ca_system_score_codex":0.000096378215,"about_ca_system_score_gemma":0.000118407595,"threshold_uncertainty_score":0.95598817},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17742862,0.0020492377,0.5588469,0.109270535,0.004924115,0.025520498,0.00050310267,0.0006140228,0.12084295],"genre_scores_gemma":[0.99598986,0.000016818603,0.0033141368,0.0004939714,0.00005020359,0.000058018377,0.000009160751,0.0000055992264,0.00006223724],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99819666,0.000032761527,0.00037446152,0.00039376577,0.00061681797,0.00038556062],"domain_scores_gemma":[0.9983608,0.0008300317,0.00018339386,0.0003891934,0.00020587999,0.000030696086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010953896,0.00015993339,0.00024113902,0.00049096684,0.00023707707,0.00009993847,0.0012586092,0.00020096994,0.0000019777185],"category_scores_gemma":[0.0006394327,0.00014223716,0.000041586543,0.00068592053,0.00051667285,0.00023457516,0.00016728556,0.0004072623,2.2043974e-7],"study_design_candidate":"design_other","study_design_consensus":null,"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.000008381359,0.000028969138,0.013008528,0.0000933084,0.000010265854,0.000007760128,0.04633877,0.0075520733,0.0000019835966,0.024369296,0.00019734977,0.9083833],"study_design_scores_gemma":[0.00754982,0.00080538035,0.3506009,0.004651692,0.00022151048,0.000046358815,0.0018317839,0.10615048,0.0002868673,0.2620634,0.2611634,0.00462839],"about_ca_topic_score_codex":0.5168606,"about_ca_topic_score_gemma":0.99264896,"teacher_disagreement_score":0.90375495,"about_ca_system_score_codex":0.001580485,"about_ca_system_score_gemma":0.012308835,"threshold_uncertainty_score":0.9932905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26863477,0.00011943855,0.729156,0.000014404252,0.00017912056,0.00044322648,0.0000028304776,0.00005767777,0.0013925015],"genre_scores_gemma":[0.997563,0.0000025774732,0.0017251368,0.00012190198,0.00012472615,0.000010860746,0.00000594768,0.000022937546,0.00042289306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780893,0.00010134678,0.00030462944,0.0010227148,0.0004721524,0.00029019782],"domain_scores_gemma":[0.9980695,0.0008047137,0.0002693414,0.00022815319,0.0005602569,0.000068004236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000302328,0.000341834,0.0004367679,0.00045467133,0.00023030414,0.00010965334,0.00031563727,0.00017089782,0.00004378565],"category_scores_gemma":[0.000075672586,0.00029028085,0.00002777217,0.000339511,0.0004619145,0.00017359485,0.00021348891,0.0007400803,0.0000039274623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031631123,0.00030366072,0.0149165,0.00013233401,0.00009223774,0.00009309482,0.024430383,0.17718804,0.000017958677,0.0001279449,3.0182008e-7,0.78238124],"study_design_scores_gemma":[0.008732921,0.02019722,0.22510555,0.008846145,0.0003691435,0.00010827638,0.00033727908,0.72897315,0.00034372412,0.0043578125,0.00008932461,0.0025394722],"about_ca_topic_score_codex":0.00006108308,"about_ca_topic_score_gemma":0.00011531038,"teacher_disagreement_score":0.7798418,"about_ca_system_score_codex":0.0000490087,"about_ca_system_score_gemma":0.00015022117,"threshold_uncertainty_score":0.99995494},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04310379,0.012654267,0.1835588,0.6129554,0.03979484,0.005928449,0.0002714785,0.0006139188,0.10111905],"genre_scores_gemma":[0.9838012,0.0007652696,0.00092830375,0.010777878,0.0031292655,0.000017980372,0.000007825268,0.000019661247,0.00055262574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718195,0.00013258206,0.00033457536,0.00066041795,0.0008751943,0.0008152747],"domain_scores_gemma":[0.9966624,0.0024527533,0.00012380445,0.0004152638,0.00014475334,0.00020106467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070019386,0.00032175996,0.00039117248,0.00073787296,0.0006435408,0.00075216254,0.0010320914,0.0003439807,0.00003628958],"category_scores_gemma":[0.001010328,0.00024081502,0.00008485061,0.0009297388,0.0018555776,0.00029572455,0.00026111753,0.00088394637,0.000007426199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005604855,0.000046528956,0.005697111,0.000040632636,0.000011671898,0.000021493079,0.2105454,0.00008344047,0.0000015780677,0.4636218,0.0002206827,0.3197041],"study_design_scores_gemma":[0.0011647199,0.00021611716,0.012406659,0.0032455411,0.000058528927,0.000016213671,0.00092885975,0.005972573,0.000050826977,0.83287203,0.1409272,0.0021407187],"about_ca_topic_score_codex":0.0020916273,"about_ca_topic_score_gemma":0.011100368,"teacher_disagreement_score":0.9406974,"about_ca_system_score_codex":0.00037234803,"about_ca_system_score_gemma":0.0017965653,"threshold_uncertainty_score":0.9820152},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059127744,0.0015252824,0.9431924,0.015643373,0.006851305,0.0036893939,0.00013051416,0.000014991773,0.028361453],"genre_scores_gemma":[0.916631,0.00010554341,0.07808672,0.0018897603,0.0016773676,0.00023832233,0.000019185241,0.000012593205,0.0013395111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986193,0.00009609164,0.00024901587,0.00027073486,0.0005098318,0.00025500281],"domain_scores_gemma":[0.9974385,0.0019420453,0.00015537643,0.00017538638,0.00024492477,0.000043753094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002549095,0.00011137995,0.00015189064,0.0002659248,0.0006038985,0.00014971939,0.0007972481,0.00010963116,0.000016515962],"category_scores_gemma":[0.00016567219,0.0000721396,0.000057802878,0.00036274805,0.00065532734,0.00010657557,0.000037167567,0.00021038057,3.4780356e-7],"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.000004023491,0.000004400997,0.00019443299,0.000017750182,0.00001001593,4.4584658e-7,0.010230784,0.0036889424,0.000002051416,0.568002,0.00010102105,0.41774413],"study_design_scores_gemma":[0.00068852736,0.00023263082,0.015273897,0.0007396668,0.00006731478,0.000009869453,0.001623969,0.027523149,0.00010237342,0.6976109,0.25543702,0.00069064024],"about_ca_topic_score_codex":0.19064134,"about_ca_topic_score_gemma":0.76732373,"teacher_disagreement_score":0.9160397,"about_ca_system_score_codex":0.00044089367,"about_ca_system_score_gemma":0.0047884905,"threshold_uncertainty_score":0.8494577},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021962062,0.00058120507,0.9914805,0.0001903158,0.0026170486,0.0005895519,0.000001950454,0.00024552582,0.0042719035],"genre_scores_gemma":[0.17777863,0.00004913421,0.8004042,0.00054116704,0.0014825888,0.00006274481,0.000007666395,0.00007163959,0.019602245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961913,0.000044966404,0.00058734964,0.0016747068,0.0007144959,0.0007871722],"domain_scores_gemma":[0.9977783,0.00044108063,0.0002953912,0.00076641986,0.0005971634,0.00012164736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011772969,0.00055322656,0.0006124745,0.00089796557,0.0005687066,0.0005743045,0.0024645862,0.00032000852,0.000005136136],"category_scores_gemma":[0.00023113063,0.000521392,0.00024547082,0.00046893384,0.00015620377,0.00050519855,0.0010390128,0.0011857802,0.000021873133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023202424,0.0000094315255,0.00002786389,0.00004148578,0.00001301653,0.00001336173,0.00037232708,0.5454321,0.000013511309,0.27489066,0.000007606243,0.1791763],"study_design_scores_gemma":[0.00014600149,0.00018611462,9.3007196e-7,0.0011009369,0.000008012075,0.000012233813,0.0000013071567,0.94498813,0.00012851451,0.04547645,0.00741303,0.000538338],"about_ca_topic_score_codex":0.000077987235,"about_ca_topic_score_gemma":0.000022846667,"teacher_disagreement_score":0.399556,"about_ca_system_score_codex":0.0004277725,"about_ca_system_score_gemma":0.00060172717,"threshold_uncertainty_score":0.9997238},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009981752,0.0002644939,0.99011725,0.001956418,0.002019384,0.00065212644,0.00004015603,0.00042490943,0.004425442],"genre_scores_gemma":[0.59812015,0.00004205714,0.3949518,0.0028278653,0.00041820682,0.00005741157,0.000006709059,0.000052413474,0.0035234282],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727726,0.000019135312,0.00038105622,0.0013698519,0.0004210103,0.0005317085],"domain_scores_gemma":[0.9978052,0.0011518282,0.00019623477,0.0006777777,0.00012454815,0.000044433313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028043406,0.0004082426,0.00040221395,0.0009588571,0.00039296178,0.00028666068,0.0017827657,0.00027992393,0.0000072168996],"category_scores_gemma":[0.00048177762,0.00036068665,0.00013657815,0.00048024236,0.00088825496,0.00025947648,0.00085813226,0.00060655747,0.000009560848],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012614721,0.000024131186,0.000025606849,0.000059165664,0.000005556211,0.000023653869,0.00031743606,0.020163504,0.0021609813,0.08928209,0.00022897807,0.88769627],"study_design_scores_gemma":[0.00027301494,0.00023646142,0.000017885268,0.000981721,0.000016057795,0.00003380464,0.000001282624,0.30363792,0.087844454,0.599949,0.006276714,0.00073168403],"about_ca_topic_score_codex":0.000007610897,"about_ca_topic_score_gemma":0.000044765733,"teacher_disagreement_score":0.8869646,"about_ca_system_score_codex":0.000182551,"about_ca_system_score_gemma":0.00024450987,"threshold_uncertainty_score":0.9998845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025883282,0.0004993906,0.9927757,0.0002802869,0.0005075809,0.0004621407,0.0000013338791,0.00031781214,0.0051299077],"genre_scores_gemma":[0.077073164,0.000014105669,0.9221659,0.00013576532,0.00014071868,0.0000102606045,0.0000033252397,0.00002576158,0.00043104886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563634,0.000058528647,0.00079821836,0.00145077,0.0009347903,0.0011213694],"domain_scores_gemma":[0.99739575,0.0004728004,0.0005679497,0.001180858,0.00026681615,0.00011581467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027272708,0.0004898701,0.0006114716,0.0010982478,0.0004797276,0.00065046304,0.0033184406,0.00024923342,0.000004302586],"category_scores_gemma":[0.00010665964,0.00047498604,0.0001914904,0.00079023285,0.00036626612,0.0007015803,0.0027450793,0.0011969311,0.0000028957093],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013910792,0.00001926422,0.00004541056,0.0001379608,0.000013639249,0.000013873152,0.0020332178,0.03314258,0.000028672406,0.038300227,0.000004578515,0.92625916],"study_design_scores_gemma":[0.00034149538,0.00022642803,0.00001768502,0.0026429202,0.000023856512,0.000036790272,0.0000018738833,0.87459505,0.0005586946,0.09868865,0.021912012,0.00095457165],"about_ca_topic_score_codex":0.00010090509,"about_ca_topic_score_gemma":0.00006407639,"teacher_disagreement_score":0.9253046,"about_ca_system_score_codex":0.00020166567,"about_ca_system_score_gemma":0.000690831,"threshold_uncertainty_score":0.99977016},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7544466,0.009316235,0.19971848,0.028625198,0.002734528,0.00163161,0.0000190761,0.000084512394,0.003423749],"genre_scores_gemma":[0.991304,0.0009958004,0.005092697,0.0011725855,0.0009953794,0.000014956015,0.00001541142,0.000012893967,0.00039632007],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982049,0.00002633379,0.0004787609,0.0006546665,0.00033891073,0.00029644414],"domain_scores_gemma":[0.9983745,0.0010322728,0.0001095272,0.00026368,0.00013344438,0.00008654072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007484244,0.00022827588,0.00047632298,0.00082471786,0.00016949126,0.000035992496,0.00015603816,0.000187574,0.000014755686],"category_scores_gemma":[0.0003772195,0.0002030574,0.000022007114,0.00028121992,0.00084876624,0.00017463304,0.00012223494,0.0005729433,0.0000013254075],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004793627,0.000015835027,0.02045637,0.0001782823,0.000007381056,0.000038936658,0.004750036,0.00007800072,0.000090384936,0.006448349,0.000021720864,0.9678668],"study_design_scores_gemma":[0.0008739908,0.0022008745,0.21808134,0.026810065,0.000114094626,0.00017814427,0.00006212332,0.011838859,0.00431982,0.72893393,0.0052082706,0.0013784622],"about_ca_topic_score_codex":0.00020736744,"about_ca_topic_score_gemma":0.00031539812,"teacher_disagreement_score":0.9664883,"about_ca_system_score_codex":0.00016687425,"about_ca_system_score_gemma":0.00040123644,"threshold_uncertainty_score":0.828044},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044154018,0.0009357092,0.99053437,0.000116835494,0.0034259676,0.00052619487,9.814243e-7,0.00007704983,0.003941367],"genre_scores_gemma":[0.90583754,0.000045234057,0.08522815,0.00024145607,0.0009803306,0.000041335104,0.0000061160813,0.000042699976,0.0075771674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597275,0.00014599385,0.0010276368,0.0011838644,0.0011223514,0.0005474088],"domain_scores_gemma":[0.99725366,0.0005448425,0.00053940405,0.0012192527,0.00037552006,0.00006734832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026707056,0.00049802364,0.0006689211,0.0012255929,0.00031212362,0.0006378565,0.003295288,0.00028326805,0.000003224665],"category_scores_gemma":[0.00020814757,0.00039677092,0.00015093664,0.00088469894,0.00028086937,0.00046126856,0.0007768235,0.0011938404,0.000009622109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033735898,0.000030393987,0.0001518128,0.00019796612,0.000016510454,0.000079798425,0.0060917786,0.09326069,0.00083626923,0.73376423,0.000013246813,0.16555391],"study_design_scores_gemma":[0.00039116226,0.00059852604,0.00034167885,0.01740513,0.000030471821,0.00012595851,0.000036924106,0.92199147,0.008393074,0.03908013,0.009979513,0.0016259431],"about_ca_topic_score_codex":0.00082050526,"about_ca_topic_score_gemma":0.00018509742,"teacher_disagreement_score":0.905396,"about_ca_system_score_codex":0.0006181944,"about_ca_system_score_gemma":0.00039418152,"threshold_uncertainty_score":0.9998484},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004007032,0.00070892205,0.9844852,0.001690017,0.0013224151,0.00018090667,0.000005466445,0.00033337084,0.0108729815],"genre_scores_gemma":[0.49463814,0.00019585066,0.4996652,0.002314333,0.00020618105,0.00002468604,0.00000420356,0.000027726212,0.0029236784],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969402,0.000027343089,0.0003946232,0.0015368793,0.0005269438,0.0005740284],"domain_scores_gemma":[0.9978122,0.00047052535,0.0001739325,0.0012664278,0.0001675437,0.00010937856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004606867,0.00044844006,0.00049833464,0.0009091772,0.00028998542,0.00043058296,0.0026820465,0.00034900234,0.0000068424406],"category_scores_gemma":[0.00013296651,0.00041470106,0.000070363356,0.000528005,0.0016592834,0.00038112805,0.0018480893,0.0006970231,0.0000089023615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018832782,0.000011232018,0.00014294934,0.000029241823,0.000006305683,0.00006122925,0.0007500665,0.00016662551,0.00006505676,0.23869765,0.000068458416,0.7599993],"study_design_scores_gemma":[0.00043446105,0.00028184062,0.0017850583,0.00076044886,0.0000146749835,0.00017396854,0.000002888422,0.11029219,0.005058895,0.870253,0.009546815,0.0013957173],"about_ca_topic_score_codex":0.000030357865,"about_ca_topic_score_gemma":0.00006278417,"teacher_disagreement_score":0.7586036,"about_ca_system_score_codex":0.00014340656,"about_ca_system_score_gemma":0.00034066837,"threshold_uncertainty_score":0.9998305},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000990159,0.00019805167,0.994319,0.0012606041,0.0014883942,0.0009042039,0.0000024835188,0.00017282755,0.001555395],"genre_scores_gemma":[0.5377944,0.000007760931,0.46110332,0.00060804654,0.00021551874,0.00004485262,0.000004301704,0.000024594805,0.00019720987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965188,0.000051630628,0.0006698127,0.0015047488,0.0005450704,0.0007099201],"domain_scores_gemma":[0.997164,0.0011176113,0.00027759178,0.0012009619,0.00015336309,0.000086477805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019791955,0.0004485355,0.000442062,0.0012107618,0.00056326686,0.00070196344,0.0028375718,0.000271232,0.0000023059356],"category_scores_gemma":[0.0001940844,0.00038701872,0.00015522352,0.0007293971,0.00030619858,0.00057321315,0.0009070922,0.0007428034,0.0000021434805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032402684,0.000016669952,0.00013050358,0.00006339806,0.0000054853735,0.000003284388,0.0016170231,0.67209375,0.00001879176,0.044450324,0.0000035741773,0.28159398],"study_design_scores_gemma":[0.00028672453,0.00003286561,0.000031654658,0.00071704766,0.000007233099,0.0000035292212,7.7553256e-7,0.8069047,0.000049718983,0.19163182,0.000035274097,0.0002986582],"about_ca_topic_score_codex":0.000044058143,"about_ca_topic_score_gemma":0.0009549563,"teacher_disagreement_score":0.53769535,"about_ca_system_score_codex":0.0013071302,"about_ca_system_score_gemma":0.0016836331,"threshold_uncertainty_score":0.9998582},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014739937,0.0009728738,0.96309006,0.016519224,0.0022344894,0.0008586006,0.00042481758,0.00003488968,0.001125125],"genre_scores_gemma":[0.9750359,0.00076932495,0.022052784,0.000904806,0.0004263042,0.0000020377968,0.00013098218,0.000013715248,0.00066414935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799466,0.00008095827,0.00029985356,0.0008834335,0.00047579463,0.00026531762],"domain_scores_gemma":[0.9981805,0.00054228096,0.0001814608,0.00090460264,0.00010237913,0.000088790526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017815147,0.00017558977,0.0002887704,0.00030593673,0.00044140418,0.0005832106,0.0014487546,0.00019937102,0.000004317524],"category_scores_gemma":[0.0012572217,0.00016906708,0.000012635711,0.0002621289,0.0005511233,0.0021830578,0.0020963992,0.00057500415,4.1857157e-7],"study_design_candidate":"design_other","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.000023290017,0.0001812778,0.06554329,0.0002953755,0.000080101396,0.000031288742,0.05116966,0.0029013047,0.0011969223,0.025690936,0.00081797986,0.8520686],"study_design_scores_gemma":[0.0014940093,0.00022018766,0.02920584,0.0023590678,0.00020517322,0.000013973779,0.0003927888,0.84353375,0.00045001516,0.09276458,0.026623916,0.0027367007],"about_ca_topic_score_codex":0.007842523,"about_ca_topic_score_gemma":0.12432689,"teacher_disagreement_score":0.960296,"about_ca_system_score_codex":0.00011630886,"about_ca_system_score_gemma":0.00085852377,"threshold_uncertainty_score":0.99876434},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010412048,0.0019950802,0.9864497,0.00008009163,0.0018054382,0.00053186045,0.000006061683,0.00006346889,0.008027062],"genre_scores_gemma":[0.54435474,0.0000062052227,0.45199516,0.00071614893,0.00054589554,0.000073282776,0.000020988671,0.000041952575,0.0022456353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772847,0.00031477681,0.0004115921,0.0009636464,0.00020253308,0.00037896956],"domain_scores_gemma":[0.99699247,0.0023009707,0.0001954383,0.00033839274,0.00013662974,0.000036077912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0057279146,0.00027850823,0.00046310335,0.0008606552,0.0001892448,0.00012807676,0.00033079088,0.0003126614,0.000009733514],"category_scores_gemma":[0.00052487705,0.0002616104,0.00004664703,0.00031610692,0.00032490515,0.00008441815,0.0001245456,0.0010110836,0.000002198755],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010715268,0.000034912722,0.0021729216,0.00027140832,0.000043840562,0.00003951622,0.007815805,0.033879958,0.00024879744,0.022782,0.000053787004,0.9325499],"study_design_scores_gemma":[0.00356963,0.0012830769,0.015199775,0.010052502,0.00014256379,0.00014886631,0.000038379836,0.5874642,0.0008262587,0.36608127,0.012385733,0.002807728],"about_ca_topic_score_codex":0.000068858244,"about_ca_topic_score_gemma":0.0000065072018,"teacher_disagreement_score":0.92974216,"about_ca_system_score_codex":0.00015067484,"about_ca_system_score_gemma":0.00012777359,"threshold_uncertainty_score":0.9999836},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018440525,0.0009714964,0.9906358,0.00017959804,0.0029150979,0.00032892724,6.3964814e-7,0.000361541,0.004588458],"genre_scores_gemma":[0.15158425,0.00003601433,0.8323383,0.00022158837,0.00081810233,0.000030427995,0.0000049847317,0.000060078335,0.014906285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962198,0.000066007524,0.0008022637,0.0014808942,0.0007296616,0.00070133776],"domain_scores_gemma":[0.9975476,0.0007328842,0.00038385956,0.00083463837,0.000360791,0.00014021414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012657925,0.00062243873,0.00064757373,0.0014343673,0.0004764793,0.00079170574,0.0026129854,0.0003130136,0.000017944227],"category_scores_gemma":[0.000452574,0.0006031577,0.00036841288,0.0008452593,0.0001811137,0.0006349393,0.0017073938,0.0022140364,0.00003970345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023187454,0.000012521292,0.000037975547,0.00011132555,0.000027829792,0.000053960703,0.00133929,0.2794412,0.000084053834,0.28689268,0.000007017841,0.4319898],"study_design_scores_gemma":[0.00012325383,0.00021169658,0.000020907375,0.00814024,0.000012072636,0.000024589293,0.0000023387768,0.9681101,0.00048585233,0.015253601,0.006880543,0.000734813],"about_ca_topic_score_codex":0.000090711175,"about_ca_topic_score_gemma":0.00006977621,"teacher_disagreement_score":0.6886689,"about_ca_system_score_codex":0.00067961717,"about_ca_system_score_gemma":0.00040823576,"threshold_uncertainty_score":0.99964195},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015486558,0.000004079518,0.9909827,0.00045684347,0.0012277648,0.00096400955,0.000015988033,0.00005134747,0.0047486136],"genre_scores_gemma":[0.9853959,0.000009257562,0.010410709,0.0039201938,0.00012191972,0.00001332215,0.00000135058,0.000013365623,0.000113997616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715674,0.00006666563,0.00041992954,0.000995574,0.0009189283,0.0004421635],"domain_scores_gemma":[0.9983421,0.0006973101,0.00027882773,0.00042610615,0.00016683672,0.000088813926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069698476,0.00032840596,0.0003216618,0.0007581552,0.00069462863,0.00019057213,0.00091778475,0.00013116123,0.000019555724],"category_scores_gemma":[0.00024093014,0.00026154128,0.00008365134,0.0011686467,0.002554123,0.000730916,0.0005344204,0.00054705655,0.000006064574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019380289,0.000046110556,0.000004080386,0.0000710055,0.000007798063,0.000020109534,0.017225046,0.34157333,0.038316607,0.179124,0.0000378709,0.42338023],"study_design_scores_gemma":[0.0002994601,0.0002666763,0.00006661228,0.0004960805,0.000015797305,0.00003106647,0.000024835786,0.5535782,0.017252505,0.42762613,0.000018929248,0.0003236721],"about_ca_topic_score_codex":0.00003463409,"about_ca_topic_score_gemma":0.000054895583,"teacher_disagreement_score":0.9838472,"about_ca_system_score_codex":0.0005758773,"about_ca_system_score_gemma":0.0006718611,"threshold_uncertainty_score":0.99998367},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009159386,0.0005676894,0.98219633,0.003240998,0.0013869359,0.0012351278,0.0010607553,0.00005907927,0.009337151],"genre_scores_gemma":[0.9169294,0.0027472246,0.07065074,0.0042711277,0.0016642796,0.00007359499,0.00070295,0.00005747507,0.0029031632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965344,0.00014829855,0.00073376787,0.0011648125,0.0008055297,0.00061317335],"domain_scores_gemma":[0.9953365,0.0024015103,0.00024733445,0.0011993708,0.00056852534,0.00024676096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016019883,0.00026241594,0.0005338698,0.0011125891,0.0008555637,0.000025684363,0.0014747943,0.00030105573,0.00006496032],"category_scores_gemma":[0.0012846587,0.0002076114,0.000043249263,0.00088601996,0.0006924497,0.00025627355,0.0017608844,0.0015697358,0.000010022612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051106483,0.00012473112,0.006176467,0.0020250634,0.000026128366,0.000013943571,0.0005042963,0.008203535,0.000055449018,0.016808173,0.0007045226,0.9648466],"study_design_scores_gemma":[0.0004858216,0.00018944337,0.008921459,0.00055830134,0.000008267716,0.0000052950627,7.698054e-7,0.96694225,0.0000015463031,0.021351509,0.0013415902,0.00019374109],"about_ca_topic_score_codex":0.000047172463,"about_ca_topic_score_gemma":0.000033700457,"teacher_disagreement_score":0.9646529,"about_ca_system_score_codex":0.00017934255,"about_ca_system_score_gemma":0.0023870901,"threshold_uncertainty_score":0.8466147},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029132512,0.000024340618,0.9972389,0.00006023094,0.0014983254,0.00048539953,0.000120499164,0.00009198262,0.00018904515],"genre_scores_gemma":[0.13336085,0.000031030308,0.8650811,0.00037269355,0.0003932292,0.000025431667,0.00051660807,0.000042923344,0.00017616343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983792,0.000005834047,0.00041734878,0.0005994594,0.00026734316,0.00033084486],"domain_scores_gemma":[0.9988668,0.00031613276,0.00013496193,0.0005763229,0.000041531417,0.00006423772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024289613,0.00033818846,0.00027087214,0.00039445955,0.00012679059,0.00014468587,0.0008662585,0.00020322757,0.000011157313],"category_scores_gemma":[0.00008010238,0.00030676235,0.000043594096,0.00010466619,0.00017898208,0.00072454807,0.00016234005,0.00046863052,0.0000042960187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020897407,0.000015075199,0.000009157335,0.000038658516,0.000022460867,0.0000031887496,0.000311889,0.15232046,0.00024745965,0.0012956876,0.000016494561,0.8456986],"study_design_scores_gemma":[0.00028506856,0.00008643056,0.00006775614,0.00044773403,0.000013686639,0.000008797548,0.0000043023947,0.9899392,0.004142331,0.0037432467,0.0009016442,0.000359819],"about_ca_topic_score_codex":0.000006634806,"about_ca_topic_score_gemma":0.00017354533,"teacher_disagreement_score":0.84533876,"about_ca_system_score_codex":0.00046145276,"about_ca_system_score_gemma":0.00031365096,"threshold_uncertainty_score":0.9999384},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044510342,0.00031942074,0.99401975,0.0021540334,0.0008600472,0.0010928374,0.0000101547685,0.000030110397,0.001068551],"genre_scores_gemma":[0.85770565,0.00001858788,0.13791886,0.0014330253,0.00030849295,0.0006467498,0.00012125784,0.000031932203,0.0018154373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977706,0.000035777313,0.0005418814,0.0009011362,0.00033509042,0.00041552668],"domain_scores_gemma":[0.99757004,0.0013200886,0.00026327372,0.0006635673,0.00010866517,0.00007435595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001067053,0.00026177362,0.00026043825,0.0007383956,0.00011918218,0.00010855781,0.00056978106,0.00026860798,0.00014967454],"category_scores_gemma":[0.00016969386,0.0002665627,0.000069393864,0.0002743723,0.0002233408,0.0001298609,0.000054221688,0.00029569137,0.00004049677],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057434496,0.0002701207,0.0004897958,0.000073281364,0.000018598399,0.000002403521,0.0025451633,0.06946769,0.00037436123,0.04848844,0.000107790285,0.8781049],"study_design_scores_gemma":[0.0021330926,0.0006451849,0.028004482,0.00097622594,0.000073567106,0.0000064658884,0.000013473292,0.6935641,0.0045457142,0.24210425,0.026207132,0.0017262833],"about_ca_topic_score_codex":0.000038903683,"about_ca_topic_score_gemma":0.0002631995,"teacher_disagreement_score":0.87637866,"about_ca_system_score_codex":0.00053712097,"about_ca_system_score_gemma":0.00054804777,"threshold_uncertainty_score":0.99997866},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009744434,0.00023201764,0.9976777,0.0005558046,0.00037979733,0.00041223303,0.00001822146,0.00003728785,0.00058948505],"genre_scores_gemma":[0.46614718,0.00013436985,0.5301078,0.0015966529,0.00030426006,0.00001719049,0.000049397793,0.000023559707,0.0016195972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979267,0.000043605363,0.00043674588,0.00075007026,0.0005846181,0.00025821937],"domain_scores_gemma":[0.9970834,0.0014343489,0.00032312752,0.0006848146,0.0004148648,0.000059435824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015490967,0.00024334302,0.00034126264,0.0003628187,0.00025712783,0.00036136797,0.0012929459,0.00013907198,0.000006487366],"category_scores_gemma":[0.0007193513,0.00018335046,0.00007918137,0.00055740855,0.0005432217,0.00030194042,0.000765402,0.00022355931,8.2952243e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014516785,0.000041838488,0.00069019845,0.00014981732,0.00002725106,0.000001249002,0.000637897,0.010623578,0.00006927342,0.03538195,0.000094387535,0.95226806],"study_design_scores_gemma":[0.00019345502,0.00012324742,0.00029110818,0.00025124615,0.000019804667,0.0000019208858,6.7927476e-7,0.97518784,0.0003659288,0.022833113,0.00056005607,0.0001715754],"about_ca_topic_score_codex":0.000011780399,"about_ca_topic_score_gemma":0.000060133872,"teacher_disagreement_score":0.96456426,"about_ca_system_score_codex":0.00004421263,"about_ca_system_score_gemma":0.0003789238,"threshold_uncertainty_score":0.7476815},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13097458,0.00016738482,0.8666044,0.0010306085,0.000345439,0.00065617706,0.00007022782,0.000072250186,0.00007896662],"genre_scores_gemma":[0.99189883,0.000054727752,0.0068682767,0.0009451407,0.000061725135,0.00001250971,0.000040328236,0.000017347862,0.000101123595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971145,0.00004609375,0.00037006818,0.0013374973,0.0006413761,0.000490466],"domain_scores_gemma":[0.9983451,0.00034435967,0.00024316309,0.0006914431,0.00017776218,0.00019821532],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004276259,0.0004915342,0.0005144338,0.00072778505,0.00018213464,0.0012206209,0.0011449581,0.00040901467,0.0000029703378],"category_scores_gemma":[0.00016203824,0.00044694156,0.00004077951,0.00068544643,0.00034249012,0.00095041434,0.0010129377,0.0006513828,0.0000012173529],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000085459205,0.00009371033,0.0006112344,0.000110085304,0.000015790778,0.000011245244,0.003750483,0.000017246522,0.00083224516,0.0035601987,0.0000362131,0.990953],"study_design_scores_gemma":[0.0033122352,0.0011196327,0.42792228,0.003649513,0.000077448385,0.0000731543,0.000011935068,0.52553034,0.008883124,0.025239225,0.00065335765,0.003527739],"about_ca_topic_score_codex":0.0000909486,"about_ca_topic_score_gemma":0.000047994396,"teacher_disagreement_score":0.98742527,"about_ca_system_score_codex":0.00014996933,"about_ca_system_score_gemma":0.00024623057,"threshold_uncertainty_score":0.9998162},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036763388,0.0007893485,0.9668501,0.009881973,0.008197754,0.0032925534,0.0009917163,0.0001382849,0.006181938],"genre_scores_gemma":[0.8812259,0.00002188113,0.07975616,0.018635578,0.00093972223,0.00034024377,0.00067364157,0.00014826612,0.018258614],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972371,0.00003856401,0.0005419705,0.0009668437,0.0007034576,0.0005120491],"domain_scores_gemma":[0.9987678,0.0002721272,0.0003615391,0.00032982926,0.00010138167,0.00016733487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005935837,0.00032104162,0.0003812082,0.0005391137,0.00038647768,0.00027965163,0.0006722366,0.00015326294,0.00012285629],"category_scores_gemma":[0.000017526729,0.00030724148,0.000099894285,0.00018701132,0.00067113986,0.00015719915,0.00020747483,0.000324279,0.00001266797],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011089634,0.0011107193,0.009435827,0.0016954184,0.00037292152,0.00006562778,0.010983727,0.00050591177,0.0000044219496,0.034795742,0.007253312,0.93266743],"study_design_scores_gemma":[0.06608042,0.04501877,0.105465315,0.054182652,0.0006202366,0.00050992804,0.00036586748,0.029158246,0.0009101063,0.3490937,0.33642757,0.012167163],"about_ca_topic_score_codex":0.00006905924,"about_ca_topic_score_gemma":0.00041684834,"teacher_disagreement_score":0.9205002,"about_ca_system_score_codex":0.0004467232,"about_ca_system_score_gemma":0.00037959957,"threshold_uncertainty_score":0.99993795},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008677141,0.00010420508,0.9937612,0.0003512828,0.000902041,0.00043389673,0.000022652934,0.0005070982,0.0030499464],"genre_scores_gemma":[0.32319683,0.000007389253,0.6761407,0.0002768673,0.00012299552,0.000008812861,0.000029517763,0.000023373077,0.00019349164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961538,0.000033880176,0.0004797967,0.0016726957,0.0010828532,0.00057700195],"domain_scores_gemma":[0.9971673,0.00037912992,0.00034289926,0.0017336372,0.000256313,0.00012074098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005265621,0.0005621386,0.00047108222,0.0011548272,0.00037196904,0.0008146457,0.0032900816,0.00022356147,0.000008147354],"category_scores_gemma":[0.000056332137,0.00046057397,0.00010677088,0.0009359741,0.0005935805,0.0005371576,0.0015826105,0.00067581184,0.000007937079],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012469922,0.000021053589,0.00033792068,0.00008806335,0.00002725788,0.000106867956,0.0006752618,0.058263678,0.00009353506,0.12174819,0.000060010847,0.81856567],"study_design_scores_gemma":[0.0003381958,0.00026770367,0.0016189143,0.001972748,0.000026196334,0.00012340202,4.1369736e-7,0.68102634,0.00059279706,0.31240982,0.00039957647,0.0012238787],"about_ca_topic_score_codex":0.000058781105,"about_ca_topic_score_gemma":0.00008512458,"teacher_disagreement_score":0.8173418,"about_ca_system_score_codex":0.00032045075,"about_ca_system_score_gemma":0.00044407233,"threshold_uncertainty_score":0.9997846},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000104632454,0.00031628006,0.9840136,0.00051049556,0.0011744061,0.00057909434,0.000010339974,0.00016539592,0.013125732],"genre_scores_gemma":[0.33522096,0.00012874746,0.66043466,0.0023764141,0.0004960555,0.00005287861,0.000009372061,0.00005223141,0.0012286528],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99594253,0.000037381666,0.0006708895,0.0017388309,0.0009654906,0.0006449021],"domain_scores_gemma":[0.9956182,0.0013039141,0.00044029072,0.0022381074,0.0002488676,0.00015059722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043599383,0.0005711085,0.0006356628,0.0010586733,0.00024075827,0.0001458707,0.0042391187,0.0002961941,0.000020115656],"category_scores_gemma":[0.0001462072,0.00052506407,0.00019037788,0.0015507124,0.00066545524,0.00031690722,0.0014324266,0.00089949794,0.000025796853],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000089841615,0.000042435266,0.000031881715,0.00004743612,0.000013124313,0.000028380427,0.00021318413,0.058393024,0.00038205407,0.08440858,0.00010331795,0.8563276],"study_design_scores_gemma":[0.00048178626,0.0006665886,0.00037955845,0.0014157168,0.000023386316,0.000045080287,1.8265206e-7,0.45754352,0.020069888,0.5116291,0.0063241026,0.0014210623],"about_ca_topic_score_codex":0.000012036184,"about_ca_topic_score_gemma":0.000048676015,"teacher_disagreement_score":0.85490656,"about_ca_system_score_codex":0.0002816553,"about_ca_system_score_gemma":0.0005609447,"threshold_uncertainty_score":0.9997201},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044327497,0.0012490342,0.9883008,0.00089188287,0.002752295,0.00033235806,0.00002447679,0.00013937967,0.0058664917],"genre_scores_gemma":[0.096206285,0.0000584318,0.8969403,0.0038390486,0.001668333,0.000011483374,0.00003962279,0.000029977144,0.0012064999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965044,0.00004455508,0.0005075124,0.0015743561,0.0008761705,0.00049295585],"domain_scores_gemma":[0.9976963,0.0007269541,0.0002451096,0.000944698,0.00021100872,0.00017594185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056019035,0.00047861235,0.00052146503,0.00061788363,0.0002866276,0.0009001079,0.0017799385,0.00034010437,0.000025382438],"category_scores_gemma":[0.00015772885,0.00043973976,0.00009739642,0.00037080707,0.00047810082,0.0004643794,0.0012731219,0.00059158844,0.000035586127],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008149146,0.000020012028,0.00040724722,0.00004948073,0.00003561037,0.00015769777,0.0011126379,0.004028332,0.0010451177,0.027057914,0.00059922005,0.9654786],"study_design_scores_gemma":[0.00081271393,0.0001726713,0.0010477876,0.0008558897,0.00002012385,0.00013979578,0.0000011058578,0.75766987,0.0048689214,0.2276314,0.0054678153,0.0013119067],"about_ca_topic_score_codex":0.00026488482,"about_ca_topic_score_gemma":0.00022969306,"teacher_disagreement_score":0.9641667,"about_ca_system_score_codex":0.00017986157,"about_ca_system_score_gemma":0.00070429285,"threshold_uncertainty_score":0.99980545},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045368743,0.0012265695,0.97678065,0.0075884806,0.003742785,0.00038976353,0.000004585335,0.00030365333,0.0099181235],"genre_scores_gemma":[0.1190227,0.00019538288,0.84229183,0.03025288,0.000598915,0.000021106598,0.000018499803,0.00008842461,0.0075102444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952007,0.00003651117,0.0006530752,0.0020980693,0.0011082485,0.00090337533],"domain_scores_gemma":[0.9965984,0.000590032,0.00025855395,0.002067787,0.00023994628,0.00024526982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004909895,0.0006850066,0.00062613154,0.0011581845,0.00042080806,0.00063870195,0.004542562,0.00028790988,0.000051209],"category_scores_gemma":[0.0002076483,0.0006075296,0.00020349238,0.0009437184,0.00033410717,0.00056902337,0.002598246,0.0012648528,0.00014667059],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008611388,0.00003542186,0.0000081669305,0.000038277343,0.000008102494,0.0001819124,0.0003499639,0.017556418,0.00025062708,0.01226949,0.00021257746,0.96908045],"study_design_scores_gemma":[0.00026925252,0.00019494315,0.000018441719,0.0006769876,0.000006759362,0.000084151,1.8646224e-7,0.9411308,0.0024111287,0.037546888,0.016974611,0.0006858631],"about_ca_topic_score_codex":0.000023785291,"about_ca_topic_score_gemma":0.000044344735,"teacher_disagreement_score":0.9683946,"about_ca_system_score_codex":0.00033016925,"about_ca_system_score_gemma":0.00060139457,"threshold_uncertainty_score":0.9996376},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016377406,0.000062661966,0.9596451,0.014937846,0.0048956755,0.001231342,0.000014371414,0.0001617653,0.0026738376],"genre_scores_gemma":[0.859009,0.0000029987839,0.12788364,0.011749867,0.0008781685,0.00011418196,0.00008580982,0.000054816024,0.00022149742],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99453056,0.00007140222,0.0013769504,0.0022360391,0.00097365666,0.0008114162],"domain_scores_gemma":[0.9971387,0.00046759823,0.00035604314,0.0014007175,0.0005069607,0.00012997449],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084156677,0.0007074731,0.0006673492,0.00517588,0.00033188105,0.0009776088,0.0033986515,0.0006519667,0.00005014492],"category_scores_gemma":[0.00041330737,0.00077246834,0.00010346024,0.004772264,0.00026131034,0.0012549513,0.0011977231,0.0020920811,0.000054018536],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006780247,0.0004552041,0.00084829965,0.00013131196,0.000034263092,0.0001764071,0.015459227,0.072450474,0.0041886605,0.07482505,0.0010614062,0.8303019],"study_design_scores_gemma":[0.00066439476,0.0005852902,0.003415781,0.0048578437,0.000024334891,0.0000592658,0.000008866525,0.19545092,0.020360338,0.7578588,0.014196645,0.0025175116],"about_ca_topic_score_codex":0.0010562843,"about_ca_topic_score_gemma":0.015858218,"teacher_disagreement_score":0.84263164,"about_ca_system_score_codex":0.002053999,"about_ca_system_score_gemma":0.0021301087,"threshold_uncertainty_score":0.9994726},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004406915,0.0017956891,0.89100534,0.04041262,0.012975056,0.0017460886,0.0000866494,0.00033062516,0.047240995],"genre_scores_gemma":[0.82874614,0.00029890586,0.14977397,0.0028280364,0.0018873652,0.000012824976,0.00006762617,0.000039912862,0.016345238],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980318,0.000059938582,0.00038643778,0.0004524297,0.0008019611,0.0002674135],"domain_scores_gemma":[0.9985199,0.00029241104,0.00026653407,0.00038259636,0.00045423172,0.00008432077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008200418,0.00018761004,0.00028111294,0.00036509207,0.00032477625,0.000121974335,0.0007726112,0.00023792525,0.00010676802],"category_scores_gemma":[0.00036070083,0.00014409507,0.000055603177,0.00075601734,0.0008402541,0.00020196759,0.00015821507,0.00031120714,0.0000070100264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035913008,0.00014357826,0.00023044289,0.00009296725,0.000008742986,0.0000034691766,0.011881269,0.0034411391,0.00012391286,0.020522121,0.00020618268,0.9633426],"study_design_scores_gemma":[0.0015830809,0.0005725546,0.0030611586,0.01352517,0.0002642515,0.0000106338875,0.0004774487,0.35157365,0.0026620992,0.5579939,0.0649251,0.0033509613],"about_ca_topic_score_codex":0.00010047138,"about_ca_topic_score_gemma":0.0018123687,"teacher_disagreement_score":0.95999163,"about_ca_system_score_codex":0.0002732742,"about_ca_system_score_gemma":0.0029456594,"threshold_uncertainty_score":0.5876027},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009510201,0.00037877026,0.9962344,0.0011058194,0.000511248,0.00041556326,0.000013028745,0.00021627305,0.00017383457],"genre_scores_gemma":[0.5388411,0.000050454128,0.45805606,0.0014010699,0.00033813182,0.000016841155,0.00011237794,0.000041138774,0.0011427761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99492407,0.0001463397,0.00077703415,0.0020611475,0.0012042839,0.0008871546],"domain_scores_gemma":[0.9943101,0.0036996214,0.00051280163,0.00079440884,0.0005109824,0.00017212288],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0014955844,0.00066317746,0.0010827407,0.003193496,0.00039106602,0.00075900607,0.0033363525,0.0003903706,0.000015390968],"category_scores_gemma":[0.0017173679,0.0006661376,0.00044652066,0.0025429071,0.0004067033,0.0002570487,0.0010990174,0.0029665257,0.000010868132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014763578,0.000108305496,0.008107259,0.000051490555,0.00010428494,0.00007008181,0.0003090013,0.72150564,0.0000010950922,0.0026866891,0.00000133947,0.26704004],"study_design_scores_gemma":[0.0005181488,0.00031363653,0.001376966,0.0009877516,0.00015223556,0.0000031992547,0.0000015288093,0.93981737,0.000045582623,0.055810463,0.000322306,0.00065079535],"about_ca_topic_score_codex":0.000029433568,"about_ca_topic_score_gemma":0.00018941055,"teacher_disagreement_score":0.5381784,"about_ca_system_score_codex":0.00032668933,"about_ca_system_score_gemma":0.0005629767,"threshold_uncertainty_score":0.999579},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053387485,0.00007699934,0.91028744,0.0037483787,0.0025563403,0.0009893553,0.000031758707,0.00015678346,0.0768142],"genre_scores_gemma":[0.7381857,0.00005108802,0.25118363,0.0013411514,0.004900769,0.000091651906,0.00007596579,0.00003630396,0.00413372],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974617,0.00006089774,0.00041360114,0.00088900444,0.0006221093,0.0005527302],"domain_scores_gemma":[0.9973145,0.0015126857,0.00018854826,0.00032322868,0.0005357744,0.00012523342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030611518,0.00024034316,0.00033104466,0.0003560794,0.00091064133,0.0006075204,0.00055116933,0.00034936587,0.0000434532],"category_scores_gemma":[0.0008623379,0.0002554884,0.0001268787,0.00024060023,0.0007810623,0.00029286815,0.00012498526,0.0005747204,0.000009954896],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009334516,0.000046418652,0.0005103476,0.00008834623,0.00000774003,0.0000028076727,0.0019436224,0.000029111497,0.000043926397,0.018376019,0.000052519354,0.9788898],"study_design_scores_gemma":[0.001788145,0.0006205989,0.012641128,0.00837634,0.0001785402,0.000013565826,0.00007315501,0.020463908,0.0018898618,0.9199572,0.031030597,0.002966957],"about_ca_topic_score_codex":0.0001865799,"about_ca_topic_score_gemma":0.0005588532,"teacher_disagreement_score":0.9759228,"about_ca_system_score_codex":0.00045025148,"about_ca_system_score_gemma":0.0014536391,"threshold_uncertainty_score":0.99998975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004515838,0.0001243676,0.9923191,0.000541075,0.0007371457,0.00051959587,0.000025782783,0.000016532298,0.0012005481],"genre_scores_gemma":[0.8547177,0.000020090434,0.1365004,0.00067890575,0.00021129914,0.000006059649,0.000017626657,0.000019937166,0.007827991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974065,0.00004839873,0.0005688254,0.0007549925,0.00097310083,0.0002482058],"domain_scores_gemma":[0.9954262,0.0027885989,0.00043605082,0.0005302485,0.0007643584,0.00005457142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004032909,0.00022491152,0.0004481629,0.00091803895,0.00018060682,0.00036080266,0.00075718167,0.0001238845,0.000008361887],"category_scores_gemma":[0.0019017924,0.00018029963,0.00007022702,0.000692897,0.00048411422,0.00044295314,0.0005675353,0.00022794533,0.0000026545097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024519713,0.000006984444,0.0019507454,0.000035232166,0.0000064701508,0.0000021862256,0.00042552775,0.0021336034,0.000030748884,0.0009821258,0.00021978917,0.99418205],"study_design_scores_gemma":[0.00091887143,0.000249897,0.085978605,0.0012797697,0.000065105385,0.000012565103,0.000006662611,0.7470007,0.0019477125,0.15250401,0.008792301,0.001243826],"about_ca_topic_score_codex":0.000052722582,"about_ca_topic_score_gemma":0.00041473936,"teacher_disagreement_score":0.9929382,"about_ca_system_score_codex":0.000065294815,"about_ca_system_score_gemma":0.0002506163,"threshold_uncertainty_score":0.7352406},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000086821514,0.0005033747,0.9856859,0.0033623567,0.00222586,0.0006842156,0.000005196766,0.000118671254,0.007327643],"genre_scores_gemma":[0.49224573,0.00045473676,0.46296093,0.039272934,0.0009826533,0.000089989706,0.000017056012,0.0000973743,0.003878595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99469537,0.0001587253,0.0008413115,0.0017952448,0.001500572,0.0010088081],"domain_scores_gemma":[0.99525297,0.0015015305,0.00028764812,0.0024854024,0.00034134559,0.00013108627],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002611364,0.000626128,0.00066452555,0.0023854345,0.0003310593,0.0011590943,0.008562728,0.00036208163,0.000031828895],"category_scores_gemma":[0.00048056254,0.0004892183,0.0002302271,0.0040367306,0.0006474565,0.0010648415,0.0018644991,0.0015325552,0.00010402804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013053814,0.00011856204,0.00030945177,0.000054808675,0.00002354412,0.00052409084,0.0027231674,0.03518911,0.000029717125,0.25555888,0.00039235072,0.7050633],"study_design_scores_gemma":[0.0003139333,0.00023761297,0.00019046551,0.0005020498,0.000026634956,0.000065402965,0.0000046394744,0.6721565,0.0026247634,0.28603327,0.036721326,0.0011233906],"about_ca_topic_score_codex":0.000164767,"about_ca_topic_score_gemma":0.0008261149,"teacher_disagreement_score":0.70393986,"about_ca_system_score_codex":0.00047696967,"about_ca_system_score_gemma":0.00083113654,"threshold_uncertainty_score":0.9998778},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7651744,0.000012567005,0.22903353,0.0005855641,0.00095479854,0.0010660957,0.0000042613087,0.00006226595,0.0031065156],"genre_scores_gemma":[0.99811673,0.0000074318905,0.00045875917,0.00049561186,0.00007291652,0.000008706347,5.0934364e-7,0.000007630415,0.00083170104],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9981232,0.00012212613,0.00023393412,0.00084863964,0.00048480008,0.00018725613],"domain_scores_gemma":[0.9987807,0.00054682477,0.00022255383,0.0003200623,0.00008376173,0.00004607212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023290346,0.00019772096,0.00022126875,0.00030225093,0.0004222723,0.00009406188,0.00045399868,0.00008654098,0.000007756986],"category_scores_gemma":[0.00035574217,0.00012702162,0.000034086504,0.0008056894,0.00086774,0.000138035,0.00024109367,0.00075631693,0.0000020794434],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018544732,0.0008474656,0.043126073,0.00012114014,0.000020586709,0.000024918396,0.009891929,0.03943297,0.044842396,0.007695891,0.000012532062,0.8537986],"study_design_scores_gemma":[0.0016157241,0.0044461633,0.9138237,0.0009874307,0.00009653487,0.00006953906,0.000021669764,0.02777072,0.006034731,0.043465592,0.00073245977,0.0009356969],"about_ca_topic_score_codex":0.000008441641,"about_ca_topic_score_gemma":0.00001706445,"teacher_disagreement_score":0.8706977,"about_ca_system_score_codex":0.00004759595,"about_ca_system_score_gemma":0.00018695621,"threshold_uncertainty_score":0.51797915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015067763,0.00015583454,0.99066263,0.0012134974,0.000489745,0.00047472006,0.000015614869,0.000063629785,0.0067736357],"genre_scores_gemma":[0.7368034,0.00016514384,0.2454569,0.015598681,0.00041896076,0.000057672256,0.000068487905,0.000044844768,0.0013859115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966525,0.000185661,0.00047486942,0.0012400214,0.0008848391,0.0005621212],"domain_scores_gemma":[0.9961655,0.0010314095,0.00017667633,0.002309757,0.00018943269,0.0001272202],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0034313512,0.0003909457,0.00041733548,0.0007375597,0.0002335477,0.00091435737,0.0058322786,0.00025005938,0.000010669962],"category_scores_gemma":[0.00026140976,0.00028786494,0.00008692955,0.0013678081,0.00044584164,0.00078928465,0.0008808638,0.0008002888,0.000035527988],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005372118,0.00008603797,0.00018140231,0.00001874799,0.00000882071,0.000033111974,0.0017953188,0.008983686,0.000017065635,0.11328014,0.00015604626,0.8754342],"study_design_scores_gemma":[0.00054243614,0.00040450945,0.019353151,0.00033966135,0.000017536075,0.000061230494,0.0000016966987,0.6376483,0.00028697704,0.32470945,0.015371656,0.0012634089],"about_ca_topic_score_codex":0.0004945479,"about_ca_topic_score_gemma":0.0036618642,"teacher_disagreement_score":0.87417084,"about_ca_system_score_codex":0.00021625418,"about_ca_system_score_gemma":0.0007865581,"threshold_uncertainty_score":0.9999573},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009831873,0.00009275708,0.99577606,0.00030794556,0.0012352758,0.0019212667,0.0000032298856,0.00011397195,0.00045118772],"genre_scores_gemma":[0.29551968,0.000032704673,0.7020416,0.00102847,0.00041961193,0.00028504094,0.0000087343415,0.00008066491,0.0005834367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981687,0.00011627877,0.0003697292,0.0006591754,0.00034488016,0.00034123045],"domain_scores_gemma":[0.9969594,0.0023619693,0.00010751537,0.00041488663,0.00010526526,0.00005097635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013905284,0.00037847104,0.00033586327,0.00075417577,0.00015332745,0.0003372128,0.00046480057,0.00017252313,0.000009812772],"category_scores_gemma":[0.00022558178,0.00037791618,0.000044677785,0.00039846738,0.000049496513,0.00053918536,0.00006631385,0.0005758231,0.000014837448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003225221,0.000040931467,0.00000829706,0.00003394746,0.000014487509,0.000008791528,0.005261139,0.94254845,0.0004791264,0.000833697,0.00016274,0.050576128],"study_design_scores_gemma":[0.000702692,0.0004326475,0.00007081955,0.0005466885,0.000027682954,0.000005407334,0.000028804405,0.9372669,0.004096064,0.054751717,0.0012246933,0.0008458671],"about_ca_topic_score_codex":0.000007138205,"about_ca_topic_score_gemma":0.000043994067,"teacher_disagreement_score":0.29542136,"about_ca_system_score_codex":0.0004143687,"about_ca_system_score_gemma":0.0003270566,"threshold_uncertainty_score":0.99986726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009517429,0.007644089,0.9149631,0.028988054,0.012515239,0.012655175,0.0007225497,0.00025557578,0.012738741],"genre_scores_gemma":[0.88919854,0.0008588255,0.09536311,0.013300212,0.00019540095,0.00028189374,0.00012456143,0.000050808994,0.0006266509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99337345,0.0016645256,0.0030406464,0.00076625636,0.00057401514,0.0005811089],"domain_scores_gemma":[0.96060884,0.033564374,0.0017343301,0.0028078249,0.0011762383,0.000108413355],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018962335,0.00034566844,0.0007694607,0.0006436053,0.0009472042,0.00004261717,0.0021114645,0.00055459986,0.00006442592],"category_scores_gemma":[0.0056602196,0.00027919447,0.00015740997,0.0007679515,0.0011375867,0.00035736442,0.0024636248,0.004198048,0.00003304776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061658135,0.0011013907,0.08931698,0.0017137795,0.00020011443,0.000027553195,0.20234148,0.022678534,0.00003073817,0.106808595,0.00225696,0.57290727],"study_design_scores_gemma":[0.007892621,0.0015737199,0.055768315,0.07366338,0.00024776606,0.000012486917,0.0016948736,0.5607697,0.00031047978,0.12836026,0.16634941,0.0033569895],"about_ca_topic_score_codex":0.00050462125,"about_ca_topic_score_gemma":0.011033585,"teacher_disagreement_score":0.8796811,"about_ca_system_score_codex":0.0006057862,"about_ca_system_score_gemma":0.0025508374,"threshold_uncertainty_score":0.999966},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037805472,0.0005417378,0.99501395,0.00027790043,0.0015305268,0.00053343613,0.0000018552188,0.0001375316,0.0019252816],"genre_scores_gemma":[0.92931545,0.000063744774,0.06471678,0.0010557905,0.001320152,0.000046477395,0.000079762794,0.00007483304,0.0033270374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986019,0.000008067731,0.00031747858,0.00052079454,0.00024424834,0.00030751334],"domain_scores_gemma":[0.9991106,0.0002192645,0.0000968945,0.00035034562,0.00016168242,0.00006123858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023576953,0.0002979773,0.00035205454,0.0004556692,0.00022788411,0.00030498576,0.00032671104,0.000251027,0.0000072697976],"category_scores_gemma":[0.000082991064,0.0002949306,0.00009482906,0.00019876962,0.000107496715,0.00018088518,0.000053157833,0.00034989524,0.000004825975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008776494,0.0000047066237,0.000015885911,0.000058317328,0.000017664766,0.000004295715,0.00014034567,0.943272,0.0032670787,0.0053812205,0.00048951845,0.047340192],"study_design_scores_gemma":[0.0006116684,0.00005480701,0.000039405848,0.00024522067,0.000017798346,0.000010508182,1.0080196e-7,0.984046,0.00066296756,0.0028597885,0.0111435065,0.00030826058],"about_ca_topic_score_codex":0.000013012381,"about_ca_topic_score_gemma":0.0001141434,"teacher_disagreement_score":0.93029714,"about_ca_system_score_codex":0.00021420953,"about_ca_system_score_gemma":0.00012084137,"threshold_uncertainty_score":0.9999503},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83696675,0.0007287624,0.14608204,0.011481275,0.000035632132,0.0042814924,0.00041441427,0.000009319357,2.8617134e-7],"genre_scores_gemma":[0.9975662,0.00013100989,0.0016474602,0.0003714219,0.00006153232,0.00012467835,0.00006955251,0.00002693444,0.0000011677957],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9940623,0.0024864832,0.0010707354,0.001058068,0.0007645514,0.00055783644],"domain_scores_gemma":[0.991902,0.005120648,0.0015175121,0.0011748058,0.00023615359,0.000048893264],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028889247,0.0006584624,0.0010021554,0.00016080518,0.0011347156,0.0013410604,0.0025242919,0.00018747455,9.875835e-7],"category_scores_gemma":[0.00020445113,0.00021024984,0.00006526733,0.0012095772,0.002746139,0.00046179423,0.0008009138,0.0010592549,1.6593498e-8],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013561874,0.0005603906,0.18571346,0.0014540711,0.0021002176,0.00020496875,0.3762966,0.008008577,0.39991054,0.00024604663,0.00010198808,0.01184124],"study_design_scores_gemma":[0.0024626956,0.0007227474,0.9388412,0.0025353464,0.00049948465,0.00041420915,0.00073742185,0.040976457,0.011995261,0.00040215027,0.0000017578913,0.00041123168],"about_ca_topic_score_codex":0.002488234,"about_ca_topic_score_gemma":0.008774984,"teacher_disagreement_score":0.75312775,"about_ca_system_score_codex":0.000062246116,"about_ca_system_score_gemma":0.00030651226,"threshold_uncertainty_score":0.9999678},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021209116,0.0006870035,0.978348,0.00045024088,0.000247096,0.0003034513,0.00007575266,0.000044273704,0.019822966],"genre_scores_gemma":[0.45772618,0.000060279985,0.53702545,0.0015544074,0.00032072415,0.00006047463,0.000024283223,0.00005845131,0.003169748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980843,8.6874593e-7,0.00045531173,0.0009950799,0.000099960875,0.00036448965],"domain_scores_gemma":[0.99892086,0.000085454834,0.00026902897,0.0005724911,0.000073179486,0.000079017096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002214652,0.00029565682,0.00047963436,0.0004942328,0.00021130279,0.00014272056,0.0007582604,0.00019023883,0.000018392426],"category_scores_gemma":[0.00003861131,0.0003052454,0.00006869311,0.00035590216,0.00031114515,0.00014116899,0.00024541962,0.0004036725,0.0000414165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077662025,0.000026353906,0.00029106456,0.000060156264,0.000010906899,0.000008217159,0.00037805588,0.08706072,0.0000025848221,0.81573737,0.000014982433,0.096401826],"study_design_scores_gemma":[0.0001367576,0.000023577704,0.000045827826,0.00014609502,0.0000027017254,0.000004060484,8.038314e-8,0.49697345,0.000015226575,0.50173634,0.0006594731,0.0002564052],"about_ca_topic_score_codex":0.000075133576,"about_ca_topic_score_gemma":0.0001606531,"teacher_disagreement_score":0.45770496,"about_ca_system_score_codex":0.00019920664,"about_ca_system_score_gemma":0.00020208949,"threshold_uncertainty_score":0.99994},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001540423,0.00016733128,0.9832705,0.0012356929,0.0022456385,0.0002452009,0.000003698614,0.00024881115,0.012567714],"genre_scores_gemma":[0.09518265,0.0000721344,0.89892036,0.002807283,0.00036282727,0.0000091490565,0.000013264303,0.000027115431,0.0026052336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972792,0.000036931306,0.0004868979,0.0011331916,0.0006302495,0.0004334926],"domain_scores_gemma":[0.9983406,0.00030732728,0.00020729685,0.00084365153,0.00018400668,0.00011709714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005177317,0.00039762596,0.00040199116,0.0012784415,0.000254584,0.00066770415,0.0018882685,0.00022210657,0.0000517414],"category_scores_gemma":[0.00009087711,0.00038671723,0.00013341398,0.0006551037,0.0005474381,0.00064923643,0.0011931072,0.0006485049,0.000026329622],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030550984,0.000010510394,0.00015980497,0.00002809563,0.000008864241,0.000030939667,0.0004450119,0.00829934,0.000019796842,0.06683643,0.000060180308,0.92409796],"study_design_scores_gemma":[0.0002829887,0.00010861961,0.000255247,0.0006873098,0.000007671391,0.000057080142,3.3097936e-7,0.8801655,0.000466902,0.111780554,0.0054871254,0.0007006548],"about_ca_topic_score_codex":0.000023327142,"about_ca_topic_score_gemma":0.00012464443,"teacher_disagreement_score":0.9233973,"about_ca_system_score_codex":0.0002543963,"about_ca_system_score_gemma":0.0006992255,"threshold_uncertainty_score":0.9998585},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000016003138,0.00027156647,0.9923336,0.0041171475,0.00023901359,0.0011946602,0.000030054649,0.00024879424,0.0015635502],"genre_scores_gemma":[0.017142892,0.000047631405,0.98015535,0.002018604,0.00012761861,0.000069776186,0.00013141986,0.000035696434,0.0002710049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940774,0.00007469626,0.00071087,0.0032161127,0.0012509268,0.0006699843],"domain_scores_gemma":[0.99163145,0.0007969926,0.0004714987,0.006754669,0.00019463543,0.00015078548],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015464847,0.00061922503,0.00051986176,0.00043983146,0.00062481326,0.0006358118,0.009754283,0.00027191045,0.000016014406],"category_scores_gemma":[0.00009528731,0.00056101236,0.00005530684,0.0010279331,0.0008060667,0.0009527014,0.0039964234,0.0007954418,0.000027600907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013297944,0.00009815725,0.00004051207,0.00009893933,0.00004488126,0.000032984597,0.0002787107,0.7758451,0.00008507562,0.023618681,0.00016042065,0.19968323],"study_design_scores_gemma":[0.00030893963,0.000080932885,0.000058100908,0.0006324802,0.00002997888,0.000013716597,2.457142e-7,0.9353298,0.0014060626,0.060217794,0.0013636749,0.0005582674],"about_ca_topic_score_codex":0.00020680092,"about_ca_topic_score_gemma":0.00018492687,"teacher_disagreement_score":0.19912496,"about_ca_system_score_codex":0.00080504554,"about_ca_system_score_gemma":0.0013513196,"threshold_uncertainty_score":0.99968415},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013411301,0.00059766776,0.9570974,0.0045367796,0.004830306,0.004198774,0.0002090123,0.00019137505,0.014927351],"genre_scores_gemma":[0.8217728,0.00065851555,0.15629722,0.012420876,0.0012325166,0.001066365,0.00008459996,0.00008658717,0.006380535],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99724764,0.0000494115,0.00044652144,0.00090081024,0.000748209,0.0006073967],"domain_scores_gemma":[0.9978961,0.0005013185,0.0002327365,0.0004170444,0.00082077517,0.00013205332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079740223,0.0003243013,0.00043895957,0.00036483118,0.001037308,0.00030475864,0.0014349992,0.00032768483,0.000036035082],"category_scores_gemma":[0.00030012446,0.00034520356,0.000077073295,0.00052617356,0.0010337327,0.00028626397,0.0006973411,0.00036251475,0.000006013887],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034583754,0.000046943678,0.0038975682,0.0001774171,0.000026633006,0.0000042673287,0.09461339,0.00037455224,0.00000986594,0.0215521,0.001497089,0.8777656],"study_design_scores_gemma":[0.0041642524,0.0017652317,0.025014054,0.011410844,0.00034141802,0.000015178433,0.0006805826,0.012878007,0.004123817,0.4228514,0.50393724,0.01281795],"about_ca_topic_score_codex":0.0009901271,"about_ca_topic_score_gemma":0.010290392,"teacher_disagreement_score":0.8649476,"about_ca_system_score_codex":0.0007489864,"about_ca_system_score_gemma":0.0015733928,"threshold_uncertainty_score":0.9999},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039110938,0.001238298,0.9707428,0.00049962994,0.0004236656,0.001272159,0.000042486372,0.000023441122,0.025366403],"genre_scores_gemma":[0.78546613,0.00007155145,0.2118431,0.00048468914,0.000089847876,0.0001801456,0.00001183117,0.00001858017,0.0018340951],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970155,0.00017759403,0.0004530418,0.0012379065,0.0005703802,0.0005455716],"domain_scores_gemma":[0.9952259,0.0037244633,0.00017634909,0.0005392328,0.00020904928,0.00012500297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017026166,0.0002819771,0.00048228877,0.0021729155,0.00020416977,0.00033121754,0.0005562887,0.00021440709,0.000036494614],"category_scores_gemma":[0.00015405308,0.00028692928,0.000060521204,0.0015335169,0.0010004818,0.0002585338,0.00082389085,0.0010634619,0.000014617501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046577136,0.0010001633,0.00073570374,0.00045252364,0.0007747417,0.0003636854,0.017865168,0.009449807,0.0000042398183,0.20258044,0.000107465785,0.7662003],"study_design_scores_gemma":[0.0070793647,0.010274583,0.024074562,0.035160314,0.0014143342,0.000374573,0.0025448431,0.2156643,0.0005766802,0.6913069,0.006434597,0.0050949734],"about_ca_topic_score_codex":0.00017814814,"about_ca_topic_score_gemma":0.00020920779,"teacher_disagreement_score":0.78507507,"about_ca_system_score_codex":0.00032064973,"about_ca_system_score_gemma":0.00008975003,"threshold_uncertainty_score":0.9999583},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018738848,0.00084071315,0.9879168,0.008479246,0.00083204353,0.00045613988,4.920635e-7,0.0002541382,0.0010330091],"genre_scores_gemma":[0.5707636,0.00020959541,0.42631853,0.0023904005,0.00007686977,0.000031009098,0.0000011296443,0.000018180805,0.00019072351],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746746,0.0000738104,0.00047171567,0.0011040252,0.00055948,0.0003235188],"domain_scores_gemma":[0.9964237,0.0014275038,0.0003522014,0.0012529214,0.0005201261,0.000023527231],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00069398887,0.00039615724,0.00046450473,0.0014033391,0.0003521188,0.00018473619,0.0033625436,0.0009404511,0.0000027397011],"category_scores_gemma":[0.0005396267,0.00027758593,0.0000638114,0.0011039262,0.0035300006,0.00033415004,0.0023177788,0.0025410154,0.000004594064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008631181,0.000011690579,0.000009226645,0.000029203153,0.000022393728,0.00002686724,0.0026943774,0.0015202618,0.00074555737,0.48889032,0.00005085499,0.5059906],"study_design_scores_gemma":[0.00016765921,0.00029872105,0.00003661893,0.00044402372,0.000011156153,0.000037215843,0.0000058582345,0.19463933,0.018771648,0.7838227,0.0013927964,0.0003722787],"about_ca_topic_score_codex":0.000013893247,"about_ca_topic_score_gemma":0.00003872174,"teacher_disagreement_score":0.5705762,"about_ca_system_score_codex":0.00020447714,"about_ca_system_score_gemma":0.00045045879,"threshold_uncertainty_score":0.99996763},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016036059,0.00004045515,0.9942844,0.00081495295,0.0002809056,0.0023367351,0.00005668245,0.00016480735,0.00041746435],"genre_scores_gemma":[0.89255846,0.000014188071,0.10642276,0.00026724447,0.00021051026,0.00029097256,0.000046844416,0.000023892955,0.00016515021],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965477,0.00012333419,0.00049734284,0.0015262126,0.000784993,0.000520403],"domain_scores_gemma":[0.9964528,0.0006440812,0.00072131853,0.0016098623,0.00041018758,0.00016176006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017666623,0.00038714794,0.0006471236,0.0005264187,0.00026700716,0.0001710967,0.0022650587,0.00018854918,0.0000017593787],"category_scores_gemma":[0.000097198055,0.0003846809,0.00014060663,0.0007455999,0.00049336907,0.0006207683,0.00081681315,0.00048700126,0.0000014514571],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004582862,0.00027248973,0.0000025300699,0.00021008152,0.000010558827,9.372829e-7,0.0020077683,0.0071059433,0.0004616438,0.021579463,0.000007632933,0.96833634],"study_design_scores_gemma":[0.00024673386,0.00057625736,0.00051452464,0.00034172757,0.000009240843,0.0000058111214,5.576963e-7,0.95442754,0.0049450607,0.038292505,0.0003284352,0.00031161835],"about_ca_topic_score_codex":0.00007723536,"about_ca_topic_score_gemma":0.00007989216,"teacher_disagreement_score":0.96802473,"about_ca_system_score_codex":0.00059813476,"about_ca_system_score_gemma":0.0010759715,"threshold_uncertainty_score":0.9998605},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10530528,0.011228628,0.8076087,0.014107344,0.016237393,0.0058039804,0.00032689734,0.00020002187,0.039181724],"genre_scores_gemma":[0.99423623,0.000033339005,0.0038375119,0.000817882,0.00028476375,0.000083069724,0.000016598895,0.000015463429,0.0006751406],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99800164,0.00006115269,0.00058561005,0.0005463561,0.0003451276,0.00046011235],"domain_scores_gemma":[0.998721,0.00038436687,0.0002916371,0.0003942243,0.00014069586,0.0000681001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005575596,0.00022290288,0.0002983811,0.00049372134,0.00017702546,0.000066409644,0.0006680407,0.00023866513,0.00009360546],"category_scores_gemma":[0.000032257125,0.00017968305,0.00010580166,0.00034237068,0.0005615374,0.00013645792,0.0001838769,0.00078018784,0.000007692813],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013198897,0.00017579432,0.013504073,0.000110376284,0.000011375266,0.000031262058,0.007609594,0.0002959945,0.0000066437133,0.16171966,0.000070135975,0.8163331],"study_design_scores_gemma":[0.003739288,0.006200148,0.7656771,0.0098995045,0.00007389203,0.00010370179,0.00028731042,0.018050049,0.000051574258,0.19027694,0.003669575,0.0019709216],"about_ca_topic_score_codex":0.00089836214,"about_ca_topic_score_gemma":0.0017063796,"teacher_disagreement_score":0.888931,"about_ca_system_score_codex":0.00020264524,"about_ca_system_score_gemma":0.00053553784,"threshold_uncertainty_score":0.7327262},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013029032,0.0009839239,0.9817523,0.00074073847,0.0005659689,0.0018238698,0.00002484848,0.000032232758,0.0010470964],"genre_scores_gemma":[0.9150129,0.000023765559,0.08310472,0.0012664319,0.00030709553,0.00009175116,0.000018778845,0.000024824754,0.00014972272],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782324,0.00017328972,0.0003668328,0.0006976604,0.00060550915,0.00033347635],"domain_scores_gemma":[0.9970445,0.0015890411,0.0003669624,0.0004852147,0.00046299872,0.000051286715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004951442,0.00023796123,0.00038253376,0.00025118355,0.00026741202,0.000055957094,0.0005056345,0.00015896234,0.000016647422],"category_scores_gemma":[0.00016817909,0.00015778441,0.000042631396,0.00019345254,0.000535641,0.00008344851,0.00013894562,0.00027784612,6.039558e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018541532,0.00006240957,0.0068226727,0.00020143561,0.0002369673,0.000007779472,0.03409136,0.02119373,0.000019540159,0.00486524,0.00018900115,0.93212444],"study_design_scores_gemma":[0.010572711,0.0067415256,0.064535186,0.0011090148,0.0025346822,0.00014146467,0.00061707315,0.44680762,0.0025308318,0.45958766,0.0016270345,0.003195193],"about_ca_topic_score_codex":0.00014509715,"about_ca_topic_score_gemma":0.00020239483,"teacher_disagreement_score":0.92892927,"about_ca_system_score_codex":0.000084713574,"about_ca_system_score_gemma":0.0005839672,"threshold_uncertainty_score":0.6434261},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.7030834e-7,0.618149,0.3778829,0.00025300204,0.0015294214,0.0020778717,0.000011912753,0.000061562045,0.000033680288],"genre_scores_gemma":[0.000006575313,0.92942536,0.068959884,0.0012701404,0.000082390856,0.0002239345,0.000007803516,0.000016989768,0.0000069134685],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.9962243,0.00038778136,0.001051131,0.0011975055,0.0002759765,0.0008633217],"domain_scores_gemma":[0.99785227,0.00019681072,0.0006672755,0.0010638536,0.00008474161,0.0001350768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013369166,0.0004024479,0.0016193286,0.0015479332,0.00040173216,0.000060243205,0.0012973031,0.0002620892,0.00007777069],"category_scores_gemma":[0.0000925886,0.00034116703,0.00033215858,0.0052234074,0.00035289515,0.00008450159,0.00060620735,0.001025175,0.000054715623],"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":[5.5697154e-7,0.00005723553,0.0000135298105,0.063258186,0.000011630024,0.000019174508,0.00004875418,0.000009880354,1.7561743e-9,0.00011170804,0.000043873715,0.93642545],"study_design_scores_gemma":[0.00013558136,0.0001580533,0.0000075293315,0.9713618,0.00019360306,0.00008209037,0.0000012487884,0.00014015981,8.215527e-8,0.0003126483,0.027268473,0.000338732],"about_ca_topic_score_codex":0.00017295747,"about_ca_topic_score_gemma":0.00009122807,"teacher_disagreement_score":0.9360867,"about_ca_system_score_codex":0.00061832473,"about_ca_system_score_gemma":0.0012239916,"threshold_uncertainty_score":0.99990404},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023464469,0.0011762864,0.9907105,0.0009484634,0.001797088,0.00053768576,0.000003488072,0.000050502247,0.004541346],"genre_scores_gemma":[0.92576355,0.00006267466,0.07306124,0.00035923583,0.00011529133,0.000020339747,0.0000018324959,0.000014767806,0.0006010939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649787,0.00015899519,0.0005919207,0.0009706508,0.0014138602,0.00036670244],"domain_scores_gemma":[0.99562097,0.0015824481,0.00033263536,0.0014738302,0.0009350941,0.00005505542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003508803,0.0003339786,0.00037533167,0.00038194234,0.0002658099,0.0003656472,0.0038322809,0.00018451424,0.000016829315],"category_scores_gemma":[0.00057891477,0.00024281147,0.000101994236,0.000502167,0.0009339051,0.00034876028,0.0011780191,0.00054473063,0.000017667537],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010338423,0.000023931509,0.000026941896,0.00004156434,0.000024425757,0.0000030585236,0.0009477425,0.036302883,0.00005861172,0.056314908,0.00006301921,0.9061826],"study_design_scores_gemma":[0.00012474463,0.000095182855,0.00010611944,0.00033331767,0.000018606592,0.00000456225,3.2667822e-7,0.6191478,0.003558414,0.3759818,0.0004276496,0.00020146139],"about_ca_topic_score_codex":0.000021778551,"about_ca_topic_score_gemma":0.0001459965,"teacher_disagreement_score":0.9255289,"about_ca_system_score_codex":0.00035012787,"about_ca_system_score_gemma":0.00088695437,"threshold_uncertainty_score":0.9901564},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028266173,0.0017935954,0.93464434,0.017181557,0.0035795816,0.021163825,0.0007553072,0.00022960234,0.017825594],"genre_scores_gemma":[0.79261315,0.005142117,0.09164055,0.07712537,0.0019691975,0.015558933,0.0022498204,0.00029693294,0.013403946],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9918567,0.0031455937,0.0018295513,0.00076035055,0.0006835611,0.001724246],"domain_scores_gemma":[0.9840175,0.012250256,0.000871615,0.0016695452,0.00064642716,0.0005446573],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.010636896,0.000581795,0.0011017281,0.00094939215,0.005975357,0.000035403275,0.0017765827,0.0006486293,0.00009627015],"category_scores_gemma":[0.0010973602,0.000593425,0.00011333393,0.0006913003,0.0005894171,0.00014854239,0.0006784614,0.012933221,0.000018033605],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.0002864924,0.00019045763,0.0025625764,0.013307954,0.000025873554,0.000007982474,0.03318468,0.005012166,0.0000023452271,0.022964608,0.008795719,0.91365916],"study_design_scores_gemma":[0.010047644,0.0015371141,0.010015849,0.026324438,0.00013796723,0.000017732184,0.0039929384,0.27528727,0.000027078551,0.29642537,0.37309346,0.0030931276],"about_ca_topic_score_codex":0.68485385,"about_ca_topic_score_gemma":0.97530174,"teacher_disagreement_score":0.91056603,"about_ca_system_score_codex":0.0070391693,"about_ca_system_score_gemma":0.054071072,"threshold_uncertainty_score":0.99965173},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001372807,0.00019290825,0.9938208,0.000522262,0.0028943424,0.00047559172,0.00005641937,0.00009076591,0.0019332016],"genre_scores_gemma":[0.011316928,0.00002821296,0.9843996,0.0011248013,0.0005681585,0.000026807762,0.00005423273,0.00002348103,0.0024577882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974467,0.000017739756,0.00045005625,0.0010631903,0.0005978498,0.00042445236],"domain_scores_gemma":[0.998096,0.0002325585,0.00023499307,0.0010820574,0.0002734159,0.00008101474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046882583,0.0003522011,0.00042939401,0.00078070903,0.00025473707,0.00033863576,0.002263218,0.00019535734,0.000016522761],"category_scores_gemma":[0.00007971265,0.00032584512,0.00016366268,0.00061452825,0.0003653276,0.00076496537,0.0012787011,0.0002291809,0.0000034561156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008776605,0.000046701756,0.0000090295025,0.000077267956,0.0000317872,0.000012019989,0.00031744025,0.015968984,0.00020290457,0.06878084,0.00057935604,0.91396487],"study_design_scores_gemma":[0.00039038275,0.00021997053,0.0000170421,0.00047259466,0.0000287704,0.0000055706987,7.7929894e-7,0.910523,0.0018955937,0.073516704,0.012403809,0.0005257935],"about_ca_topic_score_codex":0.000018494427,"about_ca_topic_score_gemma":0.000025925785,"teacher_disagreement_score":0.9134391,"about_ca_system_score_codex":0.00013831933,"about_ca_system_score_gemma":0.00045050404,"threshold_uncertainty_score":0.99991935},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044535307,0.000048413644,0.98994315,0.0001436723,0.00034003513,0.00066658517,0.000063806656,0.00009903902,0.008650772],"genre_scores_gemma":[0.64424455,0.000005304925,0.35312682,0.00040921045,0.000955973,0.00008029162,0.00011312696,0.000045123354,0.0010195909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814874,0.000014404304,0.00040344434,0.0007686677,0.00028631155,0.0003784055],"domain_scores_gemma":[0.99868774,0.00029309106,0.0002230398,0.00055779034,0.0001758991,0.00006242682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023736412,0.0003608725,0.000454448,0.00043798712,0.00016911332,0.00021140407,0.00068767124,0.00011131991,0.00009458541],"category_scores_gemma":[0.000010946216,0.00034188785,0.00022550487,0.00021514644,0.00024146799,0.00014689736,0.00044600904,0.00032868257,0.000003534309],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012474078,0.00003449293,0.00047211093,0.00006243512,0.000044793986,0.0000014393385,0.00015796977,0.0034956643,0.000061024213,0.017880233,0.00016310763,0.9776143],"study_design_scores_gemma":[0.00038126524,0.000063467836,0.000021950198,0.00065423385,0.000032604104,0.0000013531427,3.7521127e-7,0.7847025,0.00069658156,0.20686904,0.006038036,0.0005386086],"about_ca_topic_score_codex":0.000015191736,"about_ca_topic_score_gemma":0.000037658,"teacher_disagreement_score":0.97707564,"about_ca_system_score_codex":0.00015236127,"about_ca_system_score_gemma":0.00019503298,"threshold_uncertainty_score":0.9999033},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019140678,0.00084856077,0.95525205,0.00012819096,0.0025267988,0.00031776936,0.0000044201242,0.00014383024,0.040587],"genre_scores_gemma":[0.98616064,0.00016424044,0.0054146657,0.00026167624,0.0005703517,0.000018456813,0.0000055605606,0.0000436822,0.0073607313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998529,0.000014839577,0.00032659687,0.0004019237,0.00037374638,0.00035386233],"domain_scores_gemma":[0.9985014,0.0005380847,0.000047172583,0.0007996644,0.000051965697,0.000061706334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047700453,0.00026953328,0.0003026949,0.00013216404,0.00019512523,0.00022109874,0.0009528174,0.00017733952,0.000028143184],"category_scores_gemma":[0.000055011948,0.00018333065,0.00007648757,0.00017474059,0.00028658504,0.00006126038,0.00019368998,0.00043775138,0.000033182852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042647744,0.000012631112,0.00034373114,0.0004511693,0.00005445207,0.000014974847,0.0006692505,0.22996983,0.000090275884,0.0062198867,0.0008544557,0.7613151],"study_design_scores_gemma":[0.00012699969,0.000022436916,0.00023361412,0.00060707855,0.000010676475,0.0000108221575,2.4232693e-7,0.92681223,0.00037998217,0.055908624,0.015501776,0.00038554435],"about_ca_topic_score_codex":0.000013986319,"about_ca_topic_score_gemma":0.00010376704,"teacher_disagreement_score":0.98596925,"about_ca_system_score_codex":0.00020667822,"about_ca_system_score_gemma":0.00011265854,"threshold_uncertainty_score":0.7476007},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025594567,0.0002519898,0.9862718,0.0014007232,0.0013603646,0.0005605594,0.0000092443815,0.00016940387,0.009950302],"genre_scores_gemma":[0.032939322,0.00020534314,0.9607058,0.0035152151,0.00014750483,0.000031406704,0.000021283975,0.00003528531,0.0023988474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959967,0.00007518618,0.00063658657,0.0015745139,0.0008923356,0.00082469336],"domain_scores_gemma":[0.9973899,0.00048184174,0.00016621238,0.0015451363,0.00022479583,0.00019212668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011896321,0.00049214566,0.00058524206,0.0018103663,0.0002199993,0.0006321141,0.0039296397,0.0003511429,0.00003546711],"category_scores_gemma":[0.00011018264,0.00046857158,0.00012641064,0.0013385828,0.00036715379,0.00073657953,0.0015927658,0.0010927669,0.00004103285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008904405,0.00010417119,0.00042538898,0.000115510506,0.000013584441,0.000156006,0.0010129097,0.34745347,0.00003287134,0.11605738,0.00019505555,0.5344247],"study_design_scores_gemma":[0.0003643344,0.000056877318,0.000099744204,0.00038992008,0.0000024372264,0.000009664273,9.403135e-8,0.8665743,0.00010267349,0.12929477,0.0026589471,0.00044623783],"about_ca_topic_score_codex":0.000115809984,"about_ca_topic_score_gemma":0.0006038117,"teacher_disagreement_score":0.5339785,"about_ca_system_score_codex":0.00033711185,"about_ca_system_score_gemma":0.00076386594,"threshold_uncertainty_score":0.9997766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024252706,0.0003751115,0.99010825,0.00076709146,0.00065691327,0.001108043,0.000014378677,0.000033484852,0.0045114695],"genre_scores_gemma":[0.887249,0.000031550364,0.11129346,0.00046327253,0.0001680402,0.00019921473,0.00009599568,0.000017473092,0.00048199153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807465,0.00007541921,0.00046919956,0.0009467281,0.0001766973,0.00025731517],"domain_scores_gemma":[0.9985452,0.0006459874,0.00026079605,0.0003510228,0.00015140274,0.000045557266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001186073,0.00025176498,0.0003053108,0.0004844446,0.00013645238,0.00011521905,0.00027475526,0.00020926485,0.000007904169],"category_scores_gemma":[0.00016580065,0.00024459505,0.00003453717,0.00021311404,0.00020006574,0.00011261978,0.00009165441,0.00038342286,5.682133e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053710108,0.00014942321,0.00091305666,0.00050420355,0.000043193148,9.299866e-7,0.060117632,0.00049957645,0.00027455288,0.2275912,0.00008641604,0.7097661],"study_design_scores_gemma":[0.010350177,0.0013892419,0.103782676,0.010856149,0.00026020806,0.00012455521,0.0058383513,0.70119524,0.0014650192,0.13835976,0.021245293,0.0051333574],"about_ca_topic_score_codex":0.000035999245,"about_ca_topic_score_gemma":0.000053990516,"teacher_disagreement_score":0.88482374,"about_ca_system_score_codex":0.00019739803,"about_ca_system_score_gemma":0.00012913409,"threshold_uncertainty_score":0.99742967},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7716273,0.0043277536,0.19247127,0.012420133,0.0026648242,0.0054321145,0.0007103344,0.00024749857,0.010098759],"genre_scores_gemma":[0.99162936,0.00028367763,0.006988932,0.00081589894,0.00017801435,0.000009554643,0.000017344686,0.000015652768,0.000061569765],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718606,0.00011777934,0.0006486762,0.00083179545,0.00078774226,0.00042796135],"domain_scores_gemma":[0.9977374,0.00041719092,0.00058085495,0.0006203753,0.00049804075,0.00014611638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008792574,0.00035971237,0.0006823027,0.0008621929,0.00026676414,0.00014541508,0.0013852381,0.00037784295,0.000011172132],"category_scores_gemma":[0.00037725727,0.00033952732,0.0000692053,0.00095012283,0.0013230168,0.0008581766,0.0013607359,0.0004092551,9.606396e-7],"study_design_candidate":"design_other","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.0007701114,0.0010196647,0.04330736,0.016350279,0.00042942152,0.000053966793,0.12345663,0.00010567655,0.0054725423,0.045391273,0.000109204746,0.7635339],"study_design_scores_gemma":[0.012751751,0.0040501356,0.36333883,0.058439378,0.0006570331,0.00012935454,0.00059588026,0.019967772,0.058676,0.44789904,0.025872368,0.0076224566],"about_ca_topic_score_codex":0.01842468,"about_ca_topic_score_gemma":0.016204797,"teacher_disagreement_score":0.7559114,"about_ca_system_score_codex":0.00012278816,"about_ca_system_score_gemma":0.00075364596,"threshold_uncertainty_score":0.99990565},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017098384,0.002895352,0.97362924,0.01310272,0.001590923,0.0017029275,0.00025419018,0.00046309503,0.004651743],"genre_scores_gemma":[0.63366187,0.019992337,0.34010392,0.0012158528,0.0030500402,0.000057858888,0.00047536494,0.000119882454,0.0013228848],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995605,0.00007129485,0.000326868,0.0026625067,0.00077774114,0.000556624],"domain_scores_gemma":[0.9953756,0.00027399993,0.00023530287,0.00368714,0.0002888277,0.00013918338],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014347787,0.0003664088,0.00042141858,0.0009392587,0.0013343128,0.0005420741,0.0067476584,0.00033465755,0.000013797207],"category_scores_gemma":[0.0013361519,0.00033321686,0.000017865326,0.0011483679,0.0017168842,0.0016392722,0.007861691,0.0011406273,0.000003480418],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012459615,0.00006232893,0.0026196653,0.00022457821,0.00006884032,0.000043729066,0.021036875,0.00014608642,0.000007855392,0.074608445,0.00025739148,0.90079963],"study_design_scores_gemma":[0.0028607636,0.0020943074,0.0028076088,0.012727628,0.00022424421,0.00011849477,0.0013889713,0.13582507,0.00046649898,0.65511835,0.18155994,0.004808145],"about_ca_topic_score_codex":0.005355251,"about_ca_topic_score_gemma":0.016922234,"teacher_disagreement_score":0.89599144,"about_ca_system_score_codex":0.0005095084,"about_ca_system_score_gemma":0.0014345188,"threshold_uncertainty_score":0.9999658},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026575942,0.00048674186,0.98499066,0.00067810324,0.0033588388,0.00038267314,0.000008672314,0.00023640123,0.009592154],"genre_scores_gemma":[0.15290965,0.00022167811,0.84089637,0.0013290606,0.0011810538,0.000019337698,0.000038261816,0.00007898247,0.0033256095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959165,0.0000568553,0.00086148054,0.0015246132,0.0010089801,0.0006315922],"domain_scores_gemma":[0.99682605,0.0006190584,0.0005640621,0.0014934223,0.00040044764,0.00009694494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071125303,0.00058709644,0.0007575761,0.0009067429,0.00028279657,0.00036641868,0.002913154,0.00040329536,0.000044097527],"category_scores_gemma":[0.00013717276,0.00053984,0.00021656089,0.0010092146,0.00045410762,0.0009777963,0.0013732337,0.00065674906,0.000024627048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020018955,0.00007237605,0.00009407608,0.00017567685,0.000038890397,0.000043462864,0.0012088065,0.05696818,0.0005119224,0.060555574,0.0005500457,0.879761],"study_design_scores_gemma":[0.0011632685,0.00032565647,0.00042387203,0.0019521606,0.0000507177,0.000081581595,9.090492e-7,0.82933146,0.024298327,0.111788176,0.029013941,0.0015699356],"about_ca_topic_score_codex":0.0001329633,"about_ca_topic_score_gemma":0.000085854175,"teacher_disagreement_score":0.87819105,"about_ca_system_score_codex":0.00028382012,"about_ca_system_score_gemma":0.0006879242,"threshold_uncertainty_score":0.9997053},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021016716,0.00042722153,0.9942229,0.0011560166,0.0011200411,0.0002563396,0.0000018803298,0.00017249321,0.002432978],"genre_scores_gemma":[0.31414172,0.000006247096,0.684618,0.00090644584,0.00013243097,0.0000033226706,0.0000030226433,0.000016146156,0.00017268569],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968156,0.00012800576,0.0006130409,0.0011225563,0.0007993876,0.00052138075],"domain_scores_gemma":[0.9960761,0.0019786595,0.00047470006,0.0011275233,0.00027788754,0.00006514727],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018214739,0.00043166566,0.00048056536,0.00045115405,0.0008446576,0.0012669363,0.0028294597,0.00024364135,0.0000063619464],"category_scores_gemma":[0.0001863331,0.0003245857,0.0001709086,0.00066288054,0.00070609926,0.0009941828,0.0013581346,0.0014549486,0.000005574668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.707716e-7,0.000019985731,0.000009774671,0.000027867343,0.000012265052,0.00016501464,0.004113495,0.40016466,0.0000012737083,0.048971664,0.000010864589,0.5465025],"study_design_scores_gemma":[0.00015254626,0.00004652311,0.000021849297,0.0007343941,0.000013109974,0.00050893245,0.0000031171955,0.76147693,0.000038242993,0.23503089,0.0016263773,0.00034708355],"about_ca_topic_score_codex":0.00013129521,"about_ca_topic_score_gemma":0.000033467877,"teacher_disagreement_score":0.5461554,"about_ca_system_score_codex":0.00017249282,"about_ca_system_score_gemma":0.00072860706,"threshold_uncertainty_score":0.9999206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016312415,0.00019845601,0.99432147,0.00020085111,0.0015951075,0.0006830312,0.000009489134,0.0025416475,0.00028682023],"genre_scores_gemma":[0.74117327,0.0000055928554,0.25780928,0.00028359905,0.0004702375,0.000051180683,0.000006098642,0.0000236473,0.00017711955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739814,0.00003391828,0.0003584483,0.0012902785,0.00047717182,0.00044202863],"domain_scores_gemma":[0.9969964,0.0015249635,0.0002254991,0.0008176603,0.0003256627,0.00010981732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055280677,0.00041987523,0.00051711616,0.0005981816,0.00029672004,0.0006047298,0.0012781917,0.000286203,4.0132085e-7],"category_scores_gemma":[0.00036259484,0.0003846678,0.00009508726,0.00038058884,0.0003710285,0.0002515478,0.00070647843,0.0004714728,0.0000020340196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008551359,0.000018740126,0.00006678882,0.00009216667,0.000009468578,0.000013447168,0.00022429429,0.0013390632,0.00006971651,0.0049164738,0.00010683282,0.99313444],"study_design_scores_gemma":[0.00019666072,0.00024810943,0.000050796792,0.0004507342,0.00000907197,0.000059816986,3.176474e-8,0.8046558,0.0008586699,0.19251962,0.00056365813,0.0003870597],"about_ca_topic_score_codex":0.00040757493,"about_ca_topic_score_gemma":0.000097604905,"teacher_disagreement_score":0.9927474,"about_ca_system_score_codex":0.00017933984,"about_ca_system_score_gemma":0.00031832178,"threshold_uncertainty_score":0.9998605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007218029,0.0001833095,0.9874572,0.00034214393,0.0012819767,0.00042299143,0.0000010656332,0.0002884303,0.009950684],"genre_scores_gemma":[0.31903434,0.00016668758,0.6681824,0.0033345548,0.00056345144,0.00004347678,0.000038453218,0.000054963828,0.008581729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969255,0.00005862317,0.00053337525,0.0011038587,0.00081882253,0.00055986416],"domain_scores_gemma":[0.9978741,0.0008278958,0.00040582064,0.00040918178,0.00035076455,0.00013227813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007120846,0.0004383799,0.00040761338,0.001069934,0.00049026083,0.0007740276,0.0013136296,0.00027665723,0.000028776989],"category_scores_gemma":[0.00046283935,0.0004406461,0.00011079075,0.0008763577,0.00032438274,0.0010434848,0.0005216041,0.0010698785,0.000040104755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013403751,0.000013913517,0.0000870036,0.000048840728,0.000020838237,0.000013412653,0.0013479658,0.07113754,0.00069398206,0.027069017,0.000030883788,0.8995232],"study_design_scores_gemma":[0.0005999418,0.0002579936,0.0005118305,0.00043812286,0.000013408133,0.000017281669,0.0000024782094,0.9650505,0.0016445844,0.024497168,0.0063506803,0.00061596354],"about_ca_topic_score_codex":0.000028232082,"about_ca_topic_score_gemma":0.00011034395,"teacher_disagreement_score":0.89890724,"about_ca_system_score_codex":0.0005446524,"about_ca_system_score_gemma":0.0013400324,"threshold_uncertainty_score":0.99980456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015672354,0.00011272699,0.9838548,0.0006671036,0.00045678826,0.00032265368,0.0000028257928,0.0003374767,0.014229955],"genre_scores_gemma":[0.16981202,0.00004869947,0.8262007,0.0009950488,0.00027391684,0.000032068976,0.0000062469676,0.000019065837,0.0026121915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978906,0.000010771211,0.00035517203,0.0010040452,0.00040786108,0.0003315836],"domain_scores_gemma":[0.9982579,0.00020036494,0.00019133766,0.0011030467,0.00017038867,0.00007697751],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031304694,0.00029285028,0.00025821783,0.0007211699,0.00029130548,0.00036292087,0.0019387079,0.00023850589,0.000011377234],"category_scores_gemma":[0.00003099963,0.00028714963,0.00009653778,0.0006589492,0.0002365822,0.00040938598,0.00082880486,0.0004685183,0.000022108972],"study_design_candidate":"design_other","study_design_consensus":null,"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.0752113e-7,0.000010545709,0.00005802398,0.000013400172,0.0000033281108,0.0000051725788,0.000068914924,0.0045072623,0.00007031346,0.15471034,0.00004744472,0.84050447],"study_design_scores_gemma":[0.000075437325,0.00006959598,0.00020462685,0.00019521237,0.0000047050985,0.00001552397,5.1789616e-8,0.67408174,0.0011316511,0.31808627,0.005778057,0.00035711826],"about_ca_topic_score_codex":0.000026456246,"about_ca_topic_score_gemma":0.000084406616,"teacher_disagreement_score":0.8401473,"about_ca_system_score_codex":0.0002310528,"about_ca_system_score_gemma":0.0003332114,"threshold_uncertainty_score":0.99995804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000118394506,0.00093563803,0.9945971,0.00041388202,0.0019619956,0.00031404075,0.000034064447,0.00015367477,0.0014712093],"genre_scores_gemma":[0.035320867,0.0005475106,0.9609666,0.0022380196,0.00046689133,0.000009544959,0.000030954765,0.000028819299,0.00039083554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964509,0.000033251286,0.0004484453,0.0016995703,0.0008154649,0.00055239693],"domain_scores_gemma":[0.99759966,0.00042570094,0.00023044625,0.0014413479,0.00015327826,0.00014957781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038242852,0.0005167795,0.0005105637,0.00043931053,0.0004612192,0.000662769,0.0026793708,0.0002927771,0.000022739909],"category_scores_gemma":[0.000041711617,0.00043445633,0.00008929395,0.00030541926,0.00038916853,0.001009038,0.0049825977,0.00075702823,0.000011207524],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050421227,0.000029242374,0.00020515002,0.00008902973,0.0000114185395,0.00008247031,0.00065309013,0.004433122,0.00013826496,0.02335508,0.000104491206,0.9708936],"study_design_scores_gemma":[0.00067173695,0.00017953523,0.0008262586,0.0035624246,0.00002089462,0.00007688013,8.7446557e-7,0.77171713,0.0010324102,0.20748386,0.013150523,0.0012774639],"about_ca_topic_score_codex":0.00013699128,"about_ca_topic_score_gemma":0.00003569366,"teacher_disagreement_score":0.9696161,"about_ca_system_score_codex":0.00017070332,"about_ca_system_score_gemma":0.0002591183,"threshold_uncertainty_score":0.9998107},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004272578,0.0005610987,0.9840101,0.006743698,0.0020126386,0.0002976686,0.000012539589,0.0012984998,0.004636482],"genre_scores_gemma":[0.20933959,0.00013587794,0.7843899,0.0029202346,0.000372341,0.00003566428,0.000027442227,0.00007475185,0.0027041575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99459773,0.0000716798,0.0006872199,0.002304392,0.0010440984,0.0012948695],"domain_scores_gemma":[0.99149054,0.0010535071,0.00018501015,0.006817488,0.0002951755,0.00015824774],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012488413,0.00068384974,0.00071101944,0.0006247732,0.00075490994,0.001762009,0.035541374,0.0007170261,0.000054251894],"category_scores_gemma":[0.009225627,0.0006536939,0.0001413025,0.0010911153,0.0015292697,0.0010327719,0.11134997,0.0024271237,0.00011031316],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016060394,0.000047803038,0.00026622298,0.00014090899,0.0000487011,0.00029331626,0.0004894385,0.0038393997,0.0003941989,0.013423404,0.007075963,0.9739646],"study_design_scores_gemma":[0.00022959916,0.00012772808,0.000073838404,0.00045688607,0.0000053033864,0.000040891584,4.815342e-7,0.65574205,0.0061558965,0.32863948,0.007821446,0.0007064176],"about_ca_topic_score_codex":0.000016467715,"about_ca_topic_score_gemma":0.00014741106,"teacher_disagreement_score":0.97325814,"about_ca_system_score_codex":0.0004543988,"about_ca_system_score_gemma":0.0007192903,"threshold_uncertainty_score":0.9998743},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017944433,0.007174597,0.962396,0.0004955055,0.0049139746,0.0008383315,0.000012970623,0.00030659884,0.0059175617],"genre_scores_gemma":[0.8899835,0.00031133776,0.10059071,0.00029835713,0.0022129049,0.000039467286,0.000013431829,0.000090505375,0.006459811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968386,0.000031387084,0.00057149737,0.0011287046,0.00075176137,0.00067801273],"domain_scores_gemma":[0.99824435,0.00015126055,0.00024973787,0.00092553016,0.00023992835,0.00018919415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046186137,0.0005007155,0.00085046445,0.0014600082,0.0005507282,0.00019971184,0.0006137548,0.00034721405,0.000029067873],"category_scores_gemma":[0.000056498848,0.00044502522,0.0002856854,0.00097023137,0.0002575837,0.00014507573,0.00031959583,0.000758428,0.000015177129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007671191,0.0006590259,0.2555465,0.005013858,0.00059157505,0.0007795158,0.00080237346,0.11943728,0.0004920996,0.0009234275,0.0004462047,0.6152314],"study_design_scores_gemma":[0.0030792628,0.0008917716,0.0022426408,0.026539434,0.0015473028,0.00019087248,0.000025471458,0.9511583,0.0026027285,0.004646086,0.004509571,0.002566564],"about_ca_topic_score_codex":0.00043899275,"about_ca_topic_score_gemma":0.00004057367,"teacher_disagreement_score":0.872039,"about_ca_system_score_codex":0.00077905593,"about_ca_system_score_gemma":0.00038986665,"threshold_uncertainty_score":0.99980015},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033794038,0.00029744793,0.9954021,0.0011055033,0.0010810542,0.0012864338,0.000007413917,0.00026794718,0.00021414479],"genre_scores_gemma":[0.11633323,0.000022072578,0.8775962,0.0017028248,0.0016640002,0.00025991714,0.00009334622,0.00006431318,0.0022641057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646276,0.000019659605,0.00038613708,0.0015798489,0.00092438766,0.00062717753],"domain_scores_gemma":[0.9976865,0.00041713778,0.00015526482,0.0009637338,0.0006485712,0.00012877933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000652325,0.00047013894,0.00039353778,0.0010173185,0.0003013827,0.0005742087,0.001884548,0.00028448107,0.0000052729843],"category_scores_gemma":[0.00038670475,0.00040439796,0.00007969152,0.0008429457,0.00025985535,0.00058734487,0.00045499747,0.00053844036,0.0000051061065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030974363,0.00007559416,0.0001809558,0.0005045877,0.00007404823,0.00006801083,0.0008959693,0.35290244,0.004799689,0.0131269125,0.0019539327,0.6253869],"study_design_scores_gemma":[0.00041784218,0.000301852,0.0000757643,0.00026844005,0.000010549919,0.00006177344,9.201293e-8,0.98611844,0.009102023,0.002748525,0.00039547906,0.0004992401],"about_ca_topic_score_codex":0.0000073631923,"about_ca_topic_score_gemma":0.000117896496,"teacher_disagreement_score":0.63321596,"about_ca_system_score_codex":0.0004601123,"about_ca_system_score_gemma":0.0016183128,"threshold_uncertainty_score":0.9998408},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005493929,0.0004486024,0.9907855,0.00038981982,0.002077896,0.00017824824,0.00003042877,0.00002760494,0.00056799134],"genre_scores_gemma":[0.57090557,0.00016930906,0.41895214,0.0052387007,0.0032179402,0.000010257959,0.000727878,0.000032010626,0.0007461717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806964,0.000042706197,0.00043995812,0.00091389194,0.00029341472,0.00024037986],"domain_scores_gemma":[0.99896383,0.0001285859,0.0002000502,0.00050196593,0.00012734752,0.00007820912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034008906,0.00024590627,0.00028579304,0.00011470175,0.00010130599,0.00007940327,0.00046262372,0.00055842183,0.000028283635],"category_scores_gemma":[0.0002881037,0.00022049199,0.00010654075,0.000077610835,0.00063899095,0.000004932598,0.00044378874,0.00034162786,0.000008455168],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017513945,0.000015368862,0.0001390979,0.00000815178,0.00001430475,0.000006087372,0.00006835459,0.00050531013,0.017772162,0.00010929167,0.00052827643,0.98081607],"study_design_scores_gemma":[0.002189465,0.002323756,0.002919652,0.0005293202,0.00011419945,0.000020360092,0.0000020895775,0.69012773,0.07722767,0.011836709,0.21055475,0.002154283],"about_ca_topic_score_codex":0.00006929458,"about_ca_topic_score_gemma":0.00012949086,"teacher_disagreement_score":0.9786618,"about_ca_system_score_codex":0.000063823645,"about_ca_system_score_gemma":0.00036655343,"threshold_uncertainty_score":0.89914024},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021595892,0.00035960457,0.99557966,0.00030915785,0.0008891153,0.00038895712,0.00006310263,0.000071770504,0.00017902213],"genre_scores_gemma":[0.32074666,0.0002144833,0.6776157,0.00096509955,0.00025057842,0.000008664025,0.00017149016,0.000019144332,0.00000816153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613494,0.00007916506,0.0005367242,0.002157545,0.00060474576,0.0004869124],"domain_scores_gemma":[0.9954965,0.00049549254,0.00026596303,0.0035552655,0.00006926297,0.00011752075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011718692,0.00042579425,0.00041350545,0.0010789882,0.00020211525,0.0005489454,0.004990365,0.0003779451,0.000005765976],"category_scores_gemma":[0.0002182817,0.00043598635,0.000027670034,0.0014991474,0.0006154969,0.001743326,0.0037560654,0.0010973718,0.0000038878625],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023207653,0.00014598125,0.0022054042,0.00008214245,0.000019451136,0.00007381805,0.0031112856,0.0013488961,0.00029936802,0.24870633,0.000022245258,0.7439619],"study_design_scores_gemma":[0.00061066553,0.0001795615,0.013454087,0.0013344045,0.000012868618,0.00002797179,0.0000015542604,0.60625625,0.0010471288,0.3690352,0.0067399684,0.00130032],"about_ca_topic_score_codex":0.00007819041,"about_ca_topic_score_gemma":0.00007458476,"teacher_disagreement_score":0.74266154,"about_ca_system_score_codex":0.00015169715,"about_ca_system_score_gemma":0.00030517313,"threshold_uncertainty_score":0.9998092},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025556638,0.000278004,0.990905,0.0009352536,0.0025248795,0.0006368252,0.0000075237917,0.00041437623,0.0040425737],"genre_scores_gemma":[0.91549796,0.000008849867,0.08106204,0.00035985326,0.0002822205,0.000034157492,0.000014734071,0.000030288607,0.002709877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996044,0.00006550892,0.0007294709,0.0015133108,0.0010856879,0.00056202116],"domain_scores_gemma":[0.9961685,0.00023302124,0.00035273712,0.0027119704,0.00036058266,0.00017319249],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000953003,0.0004558848,0.00051787065,0.001100258,0.0003066587,0.00096637773,0.0059753037,0.0003308274,0.00001511647],"category_scores_gemma":[0.00007430365,0.00044354834,0.00015857758,0.0007739934,0.0002820485,0.0006414357,0.0024722153,0.00058554206,0.00009308573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000986779,0.00020292969,0.00035812822,0.0009560599,0.000050687584,0.00013435853,0.044789936,0.0006257365,0.00061133073,0.443949,0.00032093242,0.507991],"study_design_scores_gemma":[0.00023570083,0.00006644556,0.00014713878,0.0013334763,0.000021339112,0.000046979905,0.0000011057931,0.96023977,0.00039491671,0.033541422,0.0033773666,0.00059431023],"about_ca_topic_score_codex":0.00005715024,"about_ca_topic_score_gemma":0.000057703444,"teacher_disagreement_score":0.95961404,"about_ca_system_score_codex":0.00055628596,"about_ca_system_score_gemma":0.00064385595,"threshold_uncertainty_score":0.99980164},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010902545,0.00050852966,0.99335426,0.0005521882,0.002954643,0.0006382509,0.000003217141,0.0003237185,0.0015561639],"genre_scores_gemma":[0.41240224,0.0005319733,0.5815766,0.0016646184,0.0014771789,0.0000798702,0.000022193477,0.0000689097,0.002176411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996489,0.00006468161,0.00057745253,0.0015333366,0.00070514,0.0006303877],"domain_scores_gemma":[0.99690634,0.0010505689,0.0003605957,0.0011721848,0.00038109845,0.00012923982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011497082,0.00049626414,0.00048685187,0.0011197297,0.00079663325,0.00066802534,0.0031875207,0.0004555249,0.00002893224],"category_scores_gemma":[0.0007689706,0.00048456536,0.00016962252,0.00091282144,0.00024262891,0.0008815277,0.003208662,0.001344531,0.000013624275],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018216628,0.000014002147,0.000018279085,0.00007657306,0.000007506019,0.0000059052127,0.00031844698,0.02616155,0.0005071732,0.0064428416,0.000014747156,0.96641475],"study_design_scores_gemma":[0.00024167338,0.00027469304,0.000019495335,0.0004941685,0.000007758111,0.000014490973,7.571627e-8,0.8381023,0.005199908,0.13846736,0.016742174,0.00043593353],"about_ca_topic_score_codex":0.00006779355,"about_ca_topic_score_gemma":0.00033348423,"teacher_disagreement_score":0.9659788,"about_ca_system_score_codex":0.00036130814,"about_ca_system_score_gemma":0.0003514729,"threshold_uncertainty_score":0.9997606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024673396,0.0020714502,0.9885252,0.0016719241,0.0007210064,0.00049004075,0.000004748289,0.00016411088,0.0038841937],"genre_scores_gemma":[0.47305423,0.0004225164,0.52458435,0.0013063259,0.00020734266,0.000020256959,0.000012534048,0.000040469477,0.00035196962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625933,0.00007925274,0.0006509487,0.001547345,0.0007296787,0.000733456],"domain_scores_gemma":[0.9976367,0.0007544605,0.0002473905,0.0010859019,0.0001295259,0.00014602777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011559833,0.00050479406,0.00053568307,0.0016311406,0.00046287314,0.0007227337,0.002887923,0.0002509258,0.000034618803],"category_scores_gemma":[0.00020953044,0.0004844821,0.000105059866,0.0013617034,0.0003954882,0.0003787757,0.0038564755,0.0012803852,0.0000030611513],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000082600745,0.000044854918,0.007176631,0.00015367319,0.000022227392,0.000114261195,0.0048382306,0.0045803175,0.00015369504,0.06496449,0.00003427066,0.9179091],"study_design_scores_gemma":[0.000607231,0.00013486289,0.0019004708,0.0008473953,0.00001107946,0.000037082886,0.0000026946268,0.8776425,0.00033150255,0.105116054,0.0125729125,0.0007961938],"about_ca_topic_score_codex":0.00018600188,"about_ca_topic_score_gemma":0.00095390674,"teacher_disagreement_score":0.9171129,"about_ca_system_score_codex":0.00020486678,"about_ca_system_score_gemma":0.00040221494,"threshold_uncertainty_score":0.9997607},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009825273,0.00044761554,0.9954799,0.000955042,0.00084272755,0.0007938006,0.000033573066,0.00026733888,0.00019748569],"genre_scores_gemma":[0.8142642,0.0015034887,0.17841488,0.0044958442,0.00056026434,0.0002892817,0.00006667433,0.00006576004,0.00033963745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955584,0.00010515022,0.0005862812,0.0022415784,0.00075173524,0.0007568746],"domain_scores_gemma":[0.99596626,0.00070630724,0.00033018432,0.0026760914,0.00022408883,0.00009709216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011825191,0.0005312658,0.00052805914,0.00050734833,0.00062846846,0.00080473773,0.005375485,0.00031743688,0.000004488116],"category_scores_gemma":[0.0005797892,0.0004566247,0.00005407964,0.0011610022,0.0006371358,0.002113952,0.004528206,0.0016847478,0.0000062083664],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019600466,0.00002038783,0.00024011446,0.00002625345,0.000006634834,0.00001942443,0.0038925563,0.0006363085,0.0010869836,0.0007379581,0.00004350365,0.9932703],"study_design_scores_gemma":[0.0006310561,0.000120964745,0.0041630995,0.0011147432,0.0000073463193,0.000035875797,0.000008070558,0.9501751,0.028234083,0.006922337,0.0076259174,0.00096141704],"about_ca_topic_score_codex":0.00010866028,"about_ca_topic_score_gemma":0.00034776295,"teacher_disagreement_score":0.99230886,"about_ca_system_score_codex":0.0004292613,"about_ca_system_score_gemma":0.00053404114,"threshold_uncertainty_score":0.9997885},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012242797,0.0002131515,0.9854775,0.0003708306,0.0005779398,0.00043101388,0.000012969441,0.000057676905,0.0006160899],"genre_scores_gemma":[0.88074666,0.000041159357,0.11868976,0.00016258615,0.00011266361,0.00001657601,0.0000029531323,0.000016371563,0.00021127549],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958911,0.00015170251,0.0007759883,0.0011303363,0.0016135991,0.00043728706],"domain_scores_gemma":[0.9950594,0.0011480725,0.00037847445,0.0024768026,0.00081624713,0.00012100681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001692428,0.000312808,0.00057770463,0.0007295803,0.00014919958,0.00014947813,0.0048640845,0.0002513384,0.000016658836],"category_scores_gemma":[0.00067797536,0.00023167703,0.00027916374,0.0014734229,0.001154677,0.0006995751,0.0016554267,0.0006123444,0.000002441213],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023425077,0.00025791186,0.0077179736,0.00042874945,0.000054707085,0.0000052914943,0.0036140732,0.010825486,0.0010757584,0.025989389,0.0000128109405,0.94999444],"study_design_scores_gemma":[0.00050954596,0.0007415746,0.01556018,0.0014747429,0.000038633876,0.0000048680645,0.0000026734892,0.38879767,0.017651375,0.5743957,0.0001466508,0.0006763777],"about_ca_topic_score_codex":0.000114665534,"about_ca_topic_score_gemma":0.00010129943,"teacher_disagreement_score":0.94931805,"about_ca_system_score_codex":0.0001727634,"about_ca_system_score_gemma":0.0011806786,"threshold_uncertainty_score":0.9447515},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000395514,0.00035945946,0.98445183,0.00022516196,0.0020606315,0.0006077598,0.000020833902,0.000112705246,0.012122069],"genre_scores_gemma":[0.2617723,0.00006450125,0.7318454,0.0016865581,0.00067141047,0.000047958685,0.00001221999,0.000041623014,0.0038580168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663687,0.00002938494,0.0006008626,0.0014451763,0.00059795676,0.00068975444],"domain_scores_gemma":[0.99611187,0.0015422171,0.00038039792,0.0014207031,0.00039574597,0.00014905704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007066214,0.00053433,0.0007663614,0.0008020009,0.00023135405,0.00026352942,0.003807285,0.00038376782,0.00001331571],"category_scores_gemma":[0.00041345987,0.00044873435,0.0002561665,0.0005440842,0.00083054975,0.00027922643,0.0013984793,0.00046387175,0.000014194261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023524377,0.000097553246,0.00004276078,0.0002917831,0.000045116984,0.00010766766,0.0016704272,0.0016467817,0.00017662806,0.5088929,0.0002061908,0.48679864],"study_design_scores_gemma":[0.0008565274,0.00087224727,0.00009567523,0.0007562359,0.00005222614,0.000085220105,3.6884086e-7,0.3378135,0.0020446193,0.6514657,0.00492961,0.0010280703],"about_ca_topic_score_codex":0.000008382058,"about_ca_topic_score_gemma":0.00007719203,"teacher_disagreement_score":0.48577058,"about_ca_system_score_codex":0.00021904615,"about_ca_system_score_gemma":0.001192999,"threshold_uncertainty_score":0.99979645},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057629477,0.00004799328,0.9915386,0.0009694599,0.000099637335,0.0010457003,0.000012717862,0.000060931667,0.00046205486],"genre_scores_gemma":[0.6425265,0.000005204509,0.35633618,0.0010106645,0.000048453316,0.000018354076,0.000013585371,0.000012886846,0.000028181807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977274,0.0000283412,0.00054491416,0.00090539,0.0005283595,0.00026557333],"domain_scores_gemma":[0.99809164,0.00029743052,0.00020956821,0.0009579955,0.00036165022,0.00008169784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045469802,0.00028162973,0.0005052701,0.00066366466,0.000069084555,0.000024589184,0.00029737185,0.00028942368,0.00001624307],"category_scores_gemma":[0.00009251587,0.0002635493,0.00005988732,0.000906334,0.00037685648,0.00016816994,0.00014921036,0.0007496822,5.3587974e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031825588,0.00008001719,0.00027707577,0.00009860926,0.0000024488545,0.000011066305,0.000038978178,0.96871406,0.0041325493,0.0032095134,0.0000032046564,0.023400677],"study_design_scores_gemma":[0.00034096552,0.00017497735,0.00071634544,0.0014231193,0.000012724697,0.000008301052,1.8683383e-7,0.94884545,0.016266288,0.031974703,0.00004301034,0.00019391453],"about_ca_topic_score_codex":0.00016399352,"about_ca_topic_score_gemma":0.000058602214,"teacher_disagreement_score":0.6367635,"about_ca_system_score_codex":0.000663495,"about_ca_system_score_gemma":0.0018018734,"threshold_uncertainty_score":0.9999817},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26145914,0.0010943543,0.735022,0.0005019331,0.0004870981,0.00046677253,0.0000101506985,0.000014214072,0.00094434596],"genre_scores_gemma":[0.9255636,0.00024797115,0.07146187,0.0013633332,0.0002645228,0.0000044745984,0.000024022353,0.000037438254,0.0010328242],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99850464,0.000022164093,0.0002794661,0.00055514893,0.00029502384,0.00034357962],"domain_scores_gemma":[0.99936336,0.000047196885,0.00008118281,0.00036582904,0.00008948159,0.000052917967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003795488,0.0001889752,0.0002664121,0.00034003376,0.000051355055,0.00003948004,0.0005521373,0.00018933477,0.000010652996],"category_scores_gemma":[0.000063067506,0.00018029175,0.00007205868,0.00018562938,0.00017084132,0.000005444539,0.0005942904,0.00030312763,0.0000037624711],"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.00006611025,0.00005821612,0.003960613,0.00048431693,0.000045693676,0.00028392763,0.00018786028,0.025056971,0.78057796,0.0005567844,0.00018782623,0.1885337],"study_design_scores_gemma":[0.0011099991,0.00055984675,0.0018362824,0.0032792157,0.00001224078,0.00006224892,0.0000012437856,0.040649638,0.9275619,0.0028208885,0.020956675,0.0011498383],"about_ca_topic_score_codex":0.000044046217,"about_ca_topic_score_gemma":0.00005224733,"teacher_disagreement_score":0.6641044,"about_ca_system_score_codex":0.00007232168,"about_ca_system_score_gemma":0.00029057483,"threshold_uncertainty_score":0.7352084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010168734,0.00011847684,0.9934694,0.0039560758,0.00079071877,0.0012633657,0.000016450558,0.00013473489,0.00014909806],"genre_scores_gemma":[0.009367193,0.000022596843,0.9861034,0.003805062,0.00031759328,0.000059532664,0.000015066168,0.000027730815,0.00028179484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996561,0.000036199228,0.000677587,0.0016449104,0.0004789268,0.0006014094],"domain_scores_gemma":[0.99672884,0.0016730466,0.00035904354,0.00083345827,0.00029242918,0.00011316707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060660084,0.0004909909,0.00042412922,0.00056200934,0.0005454525,0.0006335174,0.0018200795,0.00021898086,0.000004198751],"category_scores_gemma":[0.00022651792,0.00049538736,0.000081097336,0.00095797057,0.0005007853,0.00084891135,0.0011642704,0.00045202844,0.000005951133],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007906463,0.000009845904,0.0000029398143,0.00003498212,0.0000059987483,0.0000048743154,0.00029692546,0.09077664,0.0010286,0.080225654,0.000022045559,0.8275836],"study_design_scores_gemma":[0.00007593156,0.000058851445,0.000008713339,0.00018097513,0.0000058259498,0.000021196043,6.18309e-7,0.7008739,0.004484543,0.2933318,0.0005421791,0.00041545005],"about_ca_topic_score_codex":0.000005450847,"about_ca_topic_score_gemma":0.00005767705,"teacher_disagreement_score":0.8271681,"about_ca_system_score_codex":0.0002829237,"about_ca_system_score_gemma":0.00057671004,"threshold_uncertainty_score":0.9997498},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010941607,0.0023726502,0.98153013,0.007478423,0.0041011935,0.00057090865,0.000021505919,0.00026960648,0.0025614433],"genre_scores_gemma":[0.50741434,0.00011085277,0.4810002,0.008444447,0.0024512217,0.000026045116,0.00004127249,0.00007896009,0.00043261278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929694,0.00017694221,0.000940439,0.0027100006,0.0018177045,0.0013855359],"domain_scores_gemma":[0.9941806,0.0023167653,0.0004386384,0.0025787614,0.00027103277,0.00021416438],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018818529,0.0009987189,0.00093619875,0.001914404,0.00066301995,0.0019288043,0.009993664,0.0007405325,0.000019182127],"category_scores_gemma":[0.0003425043,0.0007688256,0.00027105646,0.0023303402,0.00074198155,0.0005406643,0.002644659,0.003470505,0.000036189],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073204124,0.00008423659,0.00012511881,0.000050333732,0.000027886832,0.00032699434,0.002044037,0.015931671,0.00010204192,0.08122436,0.00015975426,0.89991623],"study_design_scores_gemma":[0.0004189312,0.00014894827,0.00021257479,0.0010435164,0.000010308292,0.00005418641,8.686802e-7,0.7478083,0.00022724898,0.23476167,0.014420327,0.0008931239],"about_ca_topic_score_codex":0.000100113575,"about_ca_topic_score_gemma":0.000287088,"teacher_disagreement_score":0.8990231,"about_ca_system_score_codex":0.00031079416,"about_ca_system_score_gemma":0.0012409089,"threshold_uncertainty_score":0.99947625},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018365204,0.00007944975,0.9942569,0.0016104092,0.0008031999,0.001030732,0.00008800658,0.00012371835,0.00017107153],"genre_scores_gemma":[0.13641937,0.00008585283,0.8580341,0.0017439371,0.0007432004,0.00008189304,0.0013647209,0.000030045969,0.0014969131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981609,0.00001688612,0.0003874825,0.0007573777,0.00045591115,0.00022144016],"domain_scores_gemma":[0.9985963,0.00032363704,0.00020702711,0.0003890187,0.0003924025,0.00009157524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028894012,0.00027616922,0.0003834203,0.00031145554,0.00025540323,0.00007746338,0.0001991157,0.00011478404,0.000028573617],"category_scores_gemma":[0.00022364927,0.0002492443,0.000111256515,0.00020448709,0.00023633904,0.00012433645,0.00011508465,0.00035959738,0.0000025026293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062547275,0.000220917,0.00017057007,0.00016532077,0.000044224056,0.00002870972,0.0001922509,0.07064667,0.15405561,0.002633309,0.010960974,0.7608189],"study_design_scores_gemma":[0.00037432605,0.000044779474,0.00004984998,0.00076294504,0.000078021556,0.000045564575,1.1149788e-7,0.96161944,0.0076131136,0.02879861,0.0004041222,0.00020910679],"about_ca_topic_score_codex":0.00009268618,"about_ca_topic_score_gemma":0.000053021617,"teacher_disagreement_score":0.8909728,"about_ca_system_score_codex":0.00036117755,"about_ca_system_score_gemma":0.00052075274,"threshold_uncertainty_score":0.999996},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058553363,0.0017613027,0.98937833,0.0011329916,0.0011415015,0.00020061572,0.00010027645,0.000037678128,0.00039196952],"genre_scores_gemma":[0.38847357,0.00005786242,0.60383475,0.003950578,0.0013358493,0.000011407507,0.00037880774,0.000046704008,0.0019104682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975134,0.000031161064,0.00038280763,0.0011287455,0.0004787165,0.00046516853],"domain_scores_gemma":[0.9987497,0.00018294527,0.00012568636,0.00065880094,0.000114290735,0.00016861703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034994667,0.00038535724,0.00038041634,0.00046522488,0.00017436112,0.0002832817,0.0008380253,0.0007344411,0.00002090818],"category_scores_gemma":[0.0004976433,0.0003239513,0.00014988912,0.00045093714,0.00073192193,0.000013600268,0.000581548,0.0005588653,0.0000070154906],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082504645,0.000085544954,0.00021505781,0.00007547788,0.000062739164,0.00011322499,0.0003708556,0.00500175,0.026198262,0.0001429534,0.0007090009,0.9669426],"study_design_scores_gemma":[0.0042143147,0.002911362,0.0040030815,0.024644544,0.00047242458,0.00019325217,0.000007830136,0.4427751,0.09588976,0.080617405,0.3367013,0.007569619],"about_ca_topic_score_codex":0.00004323247,"about_ca_topic_score_gemma":0.000048398673,"teacher_disagreement_score":0.959373,"about_ca_system_score_codex":0.00011037065,"about_ca_system_score_gemma":0.00085215934,"threshold_uncertainty_score":0.99992126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008440235,0.00037193057,0.9964485,0.00033078028,0.00034851677,0.00027851984,0.00011317211,0.000008862529,0.0012557027],"genre_scores_gemma":[0.15210065,0.00037047558,0.8184546,0.015202746,0.00095055456,0.000012055322,0.0007392278,0.00009263357,0.012077027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986581,0.000022173237,0.00030464068,0.00048561598,0.00024992693,0.00027953836],"domain_scores_gemma":[0.99772966,0.00014537331,0.00014167064,0.0018446454,0.00008861548,0.000050027116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054168055,0.00020481354,0.00018685331,0.00012532489,0.00011345488,0.00011277907,0.0019667773,0.00018209469,0.0000038126789],"category_scores_gemma":[0.0002029625,0.0001501636,0.00004637468,0.000095715084,0.0002049268,0.000013206748,0.003426453,0.00028487825,0.000004746468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008764305,0.000030855488,0.00011251662,0.0001613014,0.000076699725,0.0000072717726,0.0013437826,0.56738424,0.004952693,0.0032852655,0.004971719,0.417586],"study_design_scores_gemma":[0.00018363443,0.00010053294,0.00002709745,0.00013945476,0.00001269154,0.0000087874905,5.7136896e-7,0.8950064,0.0014974223,0.0010891458,0.10164222,0.00029202865],"about_ca_topic_score_codex":0.00001997195,"about_ca_topic_score_gemma":0.00026525266,"teacher_disagreement_score":0.41729397,"about_ca_system_score_codex":0.000027181586,"about_ca_system_score_gemma":0.00022723591,"threshold_uncertainty_score":0.6123494},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030295338,0.00019122472,0.9957155,0.00037697543,0.0006896074,0.0011565782,0.00015814202,0.000038651895,0.001370344],"genre_scores_gemma":[0.15605266,0.00050180225,0.8335074,0.0043730224,0.00057982164,0.00007759331,0.004237831,0.000056509572,0.000613327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777853,0.000019756164,0.0004504812,0.0009481526,0.00040298916,0.0004000678],"domain_scores_gemma":[0.99881756,0.00028934478,0.00012727626,0.00056477654,0.00006361272,0.00013741513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031878936,0.00034002285,0.0005200632,0.0005139228,0.000115922885,0.00008203193,0.00053748576,0.00018182842,0.000006781687],"category_scores_gemma":[0.00001642112,0.0002761422,0.000117609365,0.0003431777,0.00013818752,0.00017715963,0.000082255945,0.00040209034,0.0000013766343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008894171,0.00024640447,0.012279889,0.0036307957,0.00022155074,0.00041321892,0.001898117,0.63462806,0.000056280685,0.0037872351,0.00007919769,0.34186983],"study_design_scores_gemma":[0.005720268,0.00039835388,0.004808402,0.0073928284,0.00040969206,0.0002261405,7.5470876e-7,0.9604132,0.00010041822,0.019306028,0.000495368,0.00072855066],"about_ca_topic_score_codex":0.00007361161,"about_ca_topic_score_gemma":0.000114366325,"teacher_disagreement_score":0.34114128,"about_ca_system_score_codex":0.0001306371,"about_ca_system_score_gemma":0.00029783,"threshold_uncertainty_score":0.99996907},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006918543,0.00044942365,0.98837143,0.0049453373,0.0025210138,0.0034622839,0.00003118471,0.000055651217,0.000094471194],"genre_scores_gemma":[0.15226603,0.00002100409,0.8464245,0.00053687143,0.00032820387,0.00035519595,0.0000062047543,0.000016560285,0.000045395795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600726,0.00023630091,0.0012092197,0.0008707948,0.0013230499,0.00035338654],"domain_scores_gemma":[0.968235,0.02735449,0.0010401321,0.0017090775,0.0016069019,0.000054387587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010382762,0.00028916678,0.00057895354,0.00031741115,0.00044485222,0.00013206396,0.003911375,0.00033563952,0.000011280401],"category_scores_gemma":[0.006022205,0.00017868045,0.0002845449,0.0005852154,0.0006570116,0.00017824756,0.0006638559,0.00084571214,8.3805037e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005902304,0.000026541033,0.0001771146,0.0002747414,0.000028324534,1.6587765e-7,0.0007334874,0.11784812,5.4478767e-7,0.10381703,0.00004231509,0.7770457],"study_design_scores_gemma":[0.00026075085,0.000119586795,0.0013604923,0.00061617047,0.000057733163,0.000001961567,6.807773e-7,0.77800643,0.00004414909,0.21897085,0.00042758757,0.00013360444],"about_ca_topic_score_codex":0.0000744816,"about_ca_topic_score_gemma":0.00014221645,"teacher_disagreement_score":0.7769121,"about_ca_system_score_codex":0.00012510266,"about_ca_system_score_gemma":0.0019655067,"threshold_uncertainty_score":0.7286377},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00680946,0.0005219176,0.9907995,0.0000750001,0.0007099368,0.0005652578,0.000007567489,0.000047539423,0.0004638285],"genre_scores_gemma":[0.6469174,0.000051697887,0.35212195,0.00026996658,0.0004167239,0.0000014615607,0.000021898613,0.000060135393,0.00013877288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962569,0.000056601624,0.00078427314,0.0010587506,0.0011882669,0.0006551942],"domain_scores_gemma":[0.9976146,0.0006080645,0.0003411033,0.0007345408,0.00051554426,0.0001861082],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010427028,0.00043254477,0.0007408452,0.00057296327,0.00019588775,0.000103864266,0.00070377486,0.00043815843,0.00006429779],"category_scores_gemma":[0.00012444358,0.00041510732,0.00019974062,0.0006715189,0.00029291137,0.00008764626,0.000688172,0.0014201874,0.0000037703735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004893078,0.00003221937,0.0000034441487,0.00015041025,0.000008577876,0.0000408162,0.00010376623,0.81552714,0.1496789,0.0006206251,0.0000023672828,0.03378278],"study_design_scores_gemma":[0.00018609618,0.00016381213,1.0387951e-7,0.0007885979,0.000028195156,0.000011003914,8.3363904e-7,0.84940434,0.14320318,0.00593354,0.00002051075,0.0002597831],"about_ca_topic_score_codex":0.000029322042,"about_ca_topic_score_gemma":0.000005783547,"teacher_disagreement_score":0.6401079,"about_ca_system_score_codex":0.00031439518,"about_ca_system_score_gemma":0.00083949475,"threshold_uncertainty_score":0.99983007},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019246578,0.000021912012,0.9903091,0.0074817375,0.0005735235,0.00089581945,0.000017909422,0.00004506461,0.00063566084],"genre_scores_gemma":[0.42491773,0.00005384991,0.5638873,0.010153808,0.0003018783,0.000048141508,0.0003333971,0.000029176137,0.00027471458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986296,0.000016552072,0.00027823917,0.0005142405,0.00035154246,0.00020977738],"domain_scores_gemma":[0.9983141,0.0011530778,0.00008653057,0.0001681334,0.00016958512,0.00010858067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060445,0.00021407541,0.00029442296,0.00037380782,0.00017255216,0.000080952144,0.000120565026,0.00041181908,0.000021011525],"category_scores_gemma":[0.00033303062,0.00019633,0.00007170072,0.00010520434,0.00013704415,0.00003648578,0.000014208264,0.0006631703,6.364385e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003927973,0.0001204873,0.00029184675,0.006844346,0.0001413513,0.000041290554,0.005046452,0.31225598,0.002626804,0.32256675,0.0001092591,0.34602746],"study_design_scores_gemma":[0.0015847818,0.0006586286,0.00007675757,0.0034839176,0.00008798144,0.0000061628066,5.6629915e-7,0.9808705,0.0025737553,0.009457926,0.00096053653,0.00023848629],"about_ca_topic_score_codex":0.000002813109,"about_ca_topic_score_gemma":0.000004510155,"teacher_disagreement_score":0.6686145,"about_ca_system_score_codex":0.000101062964,"about_ca_system_score_gemma":0.0003933157,"threshold_uncertainty_score":0.80061054},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003450946,0.00006644655,0.9852313,0.0028948176,0.005061396,0.0006324969,0.000015389729,0.0003238305,0.0057398463],"genre_scores_gemma":[0.1849725,0.0000063176403,0.8096784,0.002637451,0.0014635066,0.000018745164,0.00006986102,0.000044628505,0.0011086313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954277,0.000116456555,0.00053472095,0.001974038,0.0012637111,0.0006833224],"domain_scores_gemma":[0.9966845,0.00085799606,0.00039732957,0.0015553697,0.00032068527,0.00018411671],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007205406,0.00071688247,0.0006155779,0.0013821382,0.00065200636,0.00061603123,0.0028345669,0.0007025173,0.000047355123],"category_scores_gemma":[0.00045834365,0.0007134125,0.00022968833,0.0010127303,0.0007314333,0.00055838923,0.0007270055,0.002180308,0.000037803864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009327475,0.000024286363,0.000019591374,0.00001552165,0.000010946866,0.000052729938,0.0002163095,0.8046786,0.000044822136,0.024437958,0.0001792498,0.17031062],"study_design_scores_gemma":[0.0006968645,0.0001543356,0.00002697955,0.00041827347,0.000018360744,0.000017995311,2.0244953e-7,0.99390393,0.00006734449,0.0026406052,0.0014058203,0.00064927246],"about_ca_topic_score_codex":0.000010796999,"about_ca_topic_score_gemma":0.000076324664,"teacher_disagreement_score":0.1892253,"about_ca_system_score_codex":0.00066834624,"about_ca_system_score_gemma":0.0020010977,"threshold_uncertainty_score":0.9995317},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029704424,0.000079261445,0.9909967,0.0010801222,0.005537295,0.00094587606,0.0000055876353,0.0002930114,0.0010324417],"genre_scores_gemma":[0.16719759,0.0000120868435,0.82973653,0.0011518413,0.0012036276,0.00005931685,0.000026699849,0.000046277826,0.0005660063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961515,0.00006348659,0.0005881747,0.0017530989,0.0008698308,0.00057389116],"domain_scores_gemma":[0.99636775,0.0012929445,0.00044729133,0.0013792793,0.00039296754,0.00011973714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011480363,0.00052588596,0.0004931844,0.001287216,0.0006390713,0.0004363538,0.0028688167,0.0005180905,0.000014001026],"category_scores_gemma":[0.00070757704,0.0005182635,0.00020173201,0.000776523,0.00036290498,0.000528746,0.000989311,0.0009045836,0.00001206755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003375462,0.000021294009,0.000013185667,0.00005463816,0.0000059565914,0.0000058681126,0.00013968343,0.19893728,0.00054004043,0.012412976,0.000011425655,0.7878239],"study_design_scores_gemma":[0.00065055856,0.00014906331,0.00004903855,0.00029523947,0.000015590436,0.000004511713,1.05558776e-7,0.9288618,0.0026049998,0.06396618,0.0029154716,0.00048745624],"about_ca_topic_score_codex":0.000033650333,"about_ca_topic_score_gemma":0.000068284055,"teacher_disagreement_score":0.78733647,"about_ca_system_score_codex":0.00065649534,"about_ca_system_score_gemma":0.00090899627,"threshold_uncertainty_score":0.9997269},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063184394,0.00022642495,0.99171233,0.0003349005,0.0022064233,0.001150437,0.0000060405505,0.00027701975,0.004023218],"genre_scores_gemma":[0.13947894,0.000045049048,0.8566051,0.0008471562,0.00020545573,0.00010150128,0.0000062080603,0.000040361145,0.0026701884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994826,0.000030427393,0.000660916,0.002087605,0.0013573659,0.0010376376],"domain_scores_gemma":[0.9960917,0.0015489269,0.00017917945,0.0016233141,0.00039181396,0.00016504024],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015084507,0.00054353644,0.0004893825,0.0011831744,0.0004281058,0.0010457425,0.0044524847,0.00024121348,0.000022129085],"category_scores_gemma":[0.00047221585,0.00055274303,0.00013994766,0.00089809234,0.0006948743,0.00074819237,0.0024722994,0.0006603958,0.000023958255],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046088726,0.00004080709,0.00004131793,0.00041389937,0.000062448235,0.00007681558,0.00045839496,0.09108634,0.0012064863,0.08180411,0.00010857835,0.8246962],"study_design_scores_gemma":[0.0023883074,0.00048121164,0.0009229622,0.008762684,0.000053549997,0.000057685185,0.0000043631157,0.673463,0.03752527,0.27150145,0.0015064691,0.0033330393],"about_ca_topic_score_codex":0.000007243247,"about_ca_topic_score_gemma":0.000011838314,"teacher_disagreement_score":0.82136315,"about_ca_system_score_codex":0.0007189153,"about_ca_system_score_gemma":0.0005465142,"threshold_uncertainty_score":0.99999124},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015072393,0.00007351911,0.9830094,0.0027113212,0.00042076065,0.0013258862,0.0000073720767,0.0005529819,0.011883668],"genre_scores_gemma":[0.12324446,0.000013356637,0.8676348,0.006756029,0.00022792691,0.00009602563,0.000018018292,0.000030787476,0.001978613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600583,0.00007163357,0.0006517409,0.0018101431,0.00094369426,0.00051695027],"domain_scores_gemma":[0.99686664,0.00048012825,0.0003403913,0.0015974784,0.0005080126,0.00020737511],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011299255,0.00053977926,0.0005189868,0.0014546658,0.00027532785,0.00065087824,0.00294553,0.0004388183,0.000011021909],"category_scores_gemma":[0.00011641843,0.00055288937,0.0001264296,0.0012739785,0.0004333535,0.0006371624,0.0011475615,0.00077006954,0.00009087312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018576282,0.000032121185,0.0000059844,0.000014963442,0.000011709753,0.0000066229095,0.0014112829,0.043924928,0.00033330702,0.11375135,0.00021950823,0.8402696],"study_design_scores_gemma":[0.00029299423,0.00025315429,0.000019685147,0.0002364617,0.0000094616225,0.000020290656,5.4427034e-7,0.86562073,0.004687481,0.11901515,0.009160754,0.00068331655],"about_ca_topic_score_codex":0.000027049586,"about_ca_topic_score_gemma":0.00010360828,"teacher_disagreement_score":0.8395863,"about_ca_system_score_codex":0.0003897997,"about_ca_system_score_gemma":0.001024647,"threshold_uncertainty_score":0.99969226},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.774583e-7,0.000054191023,0.9911843,0.0018382133,0.00063813146,0.0009049909,0.00443676,0.0002571978,0.0006860625],"genre_scores_gemma":[0.000342526,0.000021901398,0.98830074,0.0020292462,0.00018546352,0.000066714296,0.008695273,0.000020238764,0.0003379109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996082,0.000026601027,0.0005097714,0.0020727322,0.0008571144,0.0004517566],"domain_scores_gemma":[0.9947515,0.0006388219,0.00040597309,0.0037829059,0.0003332084,0.000087573666],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00097040617,0.00041758857,0.0003923249,0.00064857735,0.00026334374,0.00060126855,0.0068282126,0.0002135905,0.000013842076],"category_scores_gemma":[0.00015345281,0.00037031996,0.000035084653,0.00056601857,0.0003732283,0.0016975242,0.0019456027,0.0003954426,0.000010871195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048946324,0.000086881046,0.000052057312,0.00015851235,0.000055225002,0.000019172749,0.00017522268,0.01392658,0.00017852872,0.2578194,0.017595828,0.70988363],"study_design_scores_gemma":[0.00041236964,0.00010658066,0.00014144563,0.00023340108,0.000014776366,0.000015398447,6.739677e-8,0.8883804,0.0004590865,0.082712285,0.027068125,0.0004560396],"about_ca_topic_score_codex":0.000015076438,"about_ca_topic_score_gemma":0.00008900764,"teacher_disagreement_score":0.87445384,"about_ca_system_score_codex":0.00031728842,"about_ca_system_score_gemma":0.0013564782,"threshold_uncertainty_score":0.9998749},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006955806,0.0002842619,0.97336656,0.0001591469,0.0013323934,0.0009548035,0.0000070235033,0.00026685448,0.023559399],"genre_scores_gemma":[0.27306777,0.0005667091,0.68511254,0.00032136647,0.0013231515,0.00038051122,0.0001262706,0.00033155424,0.038770147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979323,0.000013551572,0.00031860257,0.00068974716,0.00053745083,0.0005083311],"domain_scores_gemma":[0.9986974,0.00035891312,0.0000614196,0.00069473876,0.000103250466,0.00008430713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066736015,0.00032512902,0.0003316635,0.00083138817,0.00011760146,0.00019575508,0.00087745,0.00020174267,0.000010785107],"category_scores_gemma":[0.000044419365,0.00034293387,0.00008230476,0.0003371989,0.00014040485,0.00010114003,0.00026251693,0.00031807568,0.000033026696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011191889,0.000011140633,0.00004160277,0.001330726,0.000094031624,0.00003401448,0.00041802047,0.55366075,0.0013429374,0.005518458,0.002015788,0.43552133],"study_design_scores_gemma":[0.00015213617,0.000028542278,0.000047654754,0.0010162938,0.000012149636,0.000004445003,1.5064563e-7,0.97926635,0.00035164514,0.0042533088,0.014529821,0.00033752742],"about_ca_topic_score_codex":0.00001182328,"about_ca_topic_score_gemma":0.000029812762,"teacher_disagreement_score":0.4351838,"about_ca_system_score_codex":0.000740137,"about_ca_system_score_gemma":0.00012006565,"threshold_uncertainty_score":0.99990225},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078172307,0.000043038515,0.99508214,0.0014642974,0.00021850657,0.00059389276,0.000008901214,0.00011492587,0.0016925599],"genre_scores_gemma":[0.7766515,0.000014961823,0.22172336,0.0014895452,0.00007601111,0.000016042432,0.000005161525,0.0000076079746,0.000015792388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796885,0.000033282235,0.0002808233,0.0010276153,0.0003602269,0.00032917032],"domain_scores_gemma":[0.99882257,0.00018591252,0.00015470551,0.00050228357,0.00017640209,0.00015814062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051462074,0.00029127617,0.00023597224,0.00024911886,0.00042921683,0.00065634056,0.0005729161,0.00013585851,0.0000071685804],"category_scores_gemma":[0.000045965902,0.00022967544,0.000020619735,0.00054962264,0.0010729182,0.00042417945,0.00037163834,0.00027415727,0.0000028774227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063165876,0.0000053880162,0.0004968211,0.00001331629,0.0000066728285,0.000003960846,0.0003365388,0.008664353,0.00005953221,0.036977574,0.0000027451804,0.9534268],"study_design_scores_gemma":[0.00068632845,0.000342781,0.007231219,0.0004998927,0.000027600832,0.0005731989,0.000006244332,0.9474253,0.00045318552,0.041559402,0.00033734858,0.00085752225],"about_ca_topic_score_codex":0.0000182235,"about_ca_topic_score_gemma":0.00042848056,"teacher_disagreement_score":0.95256925,"about_ca_system_score_codex":0.00016046189,"about_ca_system_score_gemma":0.00038236368,"threshold_uncertainty_score":0.9365893},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005736638,0.00009065038,0.98751616,0.0013411206,0.0021793966,0.0011930335,0.0000011945789,0.0004519412,0.0072207674],"genre_scores_gemma":[0.048489306,0.000018743514,0.93538404,0.00289025,0.00020277401,0.000045730154,0.000025198906,0.00006842642,0.012875523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99288386,0.00007094348,0.0011880768,0.0021495684,0.0023580166,0.001349548],"domain_scores_gemma":[0.99566203,0.0005555755,0.0005652204,0.0022350005,0.0005949849,0.00038716482],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016368678,0.00091110705,0.0007779338,0.0017967062,0.00056499103,0.0013533166,0.00544934,0.00043674445,0.000033253753],"category_scores_gemma":[0.00041574813,0.00091946096,0.0002350707,0.0012291531,0.00043156592,0.00035988164,0.0030625144,0.0017225558,0.000121036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068381123,0.000013519347,0.00002661621,0.000076010314,0.000016213738,0.00009706894,0.00039864538,0.8340173,0.00001828312,0.006545266,0.000052977313,0.15873127],"study_design_scores_gemma":[0.0003858225,0.00051817595,0.000021618856,0.00086904713,0.000015994367,0.000016696253,5.646411e-7,0.9559399,0.00017100264,0.0045092865,0.03663498,0.0009169091],"about_ca_topic_score_codex":0.000027863704,"about_ca_topic_score_gemma":0.00006404025,"teacher_disagreement_score":0.15781437,"about_ca_system_score_codex":0.0017275995,"about_ca_system_score_gemma":0.001760539,"threshold_uncertainty_score":0.99993163},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053778585,0.00022962863,0.99149597,0.00028795516,0.0011284695,0.0008245244,3.499963e-7,0.00024375894,0.005735582],"genre_scores_gemma":[0.2494271,0.00005357381,0.7479348,0.00093540817,0.0002466653,0.000017423135,0.000007848992,0.00005040571,0.0013267759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99419606,0.000091363625,0.0012275372,0.0017661703,0.001454571,0.0012642774],"domain_scores_gemma":[0.997089,0.0005965916,0.0006491987,0.0011669915,0.00031691053,0.0001812826],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022067924,0.0007406882,0.00082105777,0.0020434516,0.00040141426,0.0011552821,0.0032501835,0.00043161603,0.000032970438],"category_scores_gemma":[0.00037993904,0.0007764628,0.00015820013,0.0013182171,0.0007034856,0.00080975966,0.002497962,0.0020509975,0.000017110871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032814798,0.0000068764493,0.0001154879,0.000080023034,0.00001203196,0.00009558878,0.00074404065,0.78350043,0.00012176679,0.006227858,0.0000019651245,0.20909066],"study_design_scores_gemma":[0.00033842475,0.0001904972,0.000013046542,0.0026256319,0.000010535004,0.00003871673,0.0000013692803,0.9895552,0.00035478576,0.005071061,0.0010451732,0.00075557944],"about_ca_topic_score_codex":0.000058740858,"about_ca_topic_score_gemma":0.000023976621,"teacher_disagreement_score":0.24937332,"about_ca_system_score_codex":0.0011886067,"about_ca_system_score_gemma":0.0013775296,"threshold_uncertainty_score":0.9998816},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005588847,0.00010701841,0.9960884,0.0008945239,0.0006639597,0.00057199335,0.0000047432386,0.00006308476,0.0015504231],"genre_scores_gemma":[0.15206608,0.00006131795,0.8471776,0.00016594105,0.00012499357,0.000025735444,0.000013885634,0.000008184536,0.0003562206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973635,0.0001268167,0.0005713446,0.000859596,0.0007162969,0.0003624341],"domain_scores_gemma":[0.99792874,0.0005246302,0.0000933708,0.0005908188,0.00077200454,0.000090466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016942784,0.00022399833,0.0003003277,0.0015864806,0.00029941284,0.000621748,0.0010258626,0.00022634584,0.000014699872],"category_scores_gemma":[0.0004374835,0.00021031026,0.000050850034,0.0019443854,0.0016834739,0.0004404957,0.0005985702,0.000738076,0.0000037005602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017306993,0.000024220844,0.000007975205,0.000024816176,0.00000348233,0.0000032151577,0.0007572982,0.03195061,0.00011575833,0.12159809,0.000011767623,0.84550107],"study_design_scores_gemma":[0.00004555085,0.00013240264,0.00006188295,0.000384072,0.0000039346073,0.000017712786,0.000003808291,0.89809674,0.0027310692,0.09808939,0.0002234889,0.00020996758],"about_ca_topic_score_codex":0.000050573424,"about_ca_topic_score_gemma":0.000698486,"teacher_disagreement_score":0.8661461,"about_ca_system_score_codex":0.00025085866,"about_ca_system_score_gemma":0.002357042,"threshold_uncertainty_score":0.8576203},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069920975,0.0018234417,0.99489886,0.000046968995,0.0013321085,0.0005473215,0.000011199959,0.0001858332,0.00045507017],"genre_scores_gemma":[0.30612105,0.00021423529,0.69081557,0.0006270308,0.00150492,0.000043613025,0.00003736153,0.000090091744,0.00054613047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981565,0.0000069524026,0.00037796868,0.000642772,0.00029252606,0.000523309],"domain_scores_gemma":[0.9991533,0.00014995894,0.00007919035,0.00036794794,0.00017120909,0.00007835971],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022001455,0.0003849247,0.00038271528,0.00057296065,0.00019274352,0.00020779578,0.0005611209,0.00036189237,0.000010640848],"category_scores_gemma":[0.00009617029,0.00039333187,0.00010175183,0.00050952757,0.00007744375,0.00012072073,0.00008356589,0.00065718073,0.000004353782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031151276,0.0000059825097,0.000008783214,0.00012582923,0.000018213806,0.000007585733,0.000082197184,0.53480136,0.0039554937,0.0010579156,0.000120505545,0.45981303],"study_design_scores_gemma":[0.00026497262,0.00007917365,0.000029094768,0.00014637559,0.000019775567,0.000016230579,4.6073936e-8,0.9864068,0.005810589,0.006037897,0.00079520413,0.0003938185],"about_ca_topic_score_codex":0.0000074500717,"about_ca_topic_score_gemma":0.0000600243,"teacher_disagreement_score":0.4594192,"about_ca_system_score_codex":0.0003670714,"about_ca_system_score_gemma":0.0002644234,"threshold_uncertainty_score":0.9998519},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018916775,0.000053574437,0.9946598,0.0020230415,0.0007630398,0.0012432768,0.00004314459,0.000056924604,0.00096802204],"genre_scores_gemma":[0.1134901,0.000010105633,0.8823475,0.0008528407,0.001141447,0.00014624851,0.00011461743,0.00002922571,0.001867911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963673,0.000072946576,0.0009827645,0.0013050797,0.00082954206,0.00044240357],"domain_scores_gemma":[0.9973144,0.0007524949,0.00048311532,0.0007807021,0.00056182744,0.0001074541],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024794964,0.00034960834,0.00049276237,0.0014142139,0.0004411366,0.00076486624,0.0012316613,0.000316764,0.000061987295],"category_scores_gemma":[0.0012297659,0.00030070607,0.00015589454,0.0012882601,0.0008988344,0.00039427757,0.00028789026,0.0003957443,0.000013874427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010065361,0.00002569821,0.000010474888,0.000007655435,0.0000032102553,0.0000018269852,0.00032213284,0.3032531,0.000062442356,0.026818283,0.00003218363,0.6694529],"study_design_scores_gemma":[0.00025050892,0.00006381855,0.000007958273,0.00007012267,0.0000072781436,0.0000114702,0.0000038262956,0.8071834,0.00046205934,0.18539561,0.006265059,0.0002788815],"about_ca_topic_score_codex":0.000026975353,"about_ca_topic_score_gemma":0.00036136384,"teacher_disagreement_score":0.669174,"about_ca_system_score_codex":0.0002919781,"about_ca_system_score_gemma":0.00081131107,"threshold_uncertainty_score":0.9999445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005588847,0.00010701841,0.9960884,0.0008945239,0.0006639597,0.00057199335,0.0000047432386,0.00006308476,0.0015504231],"genre_scores_gemma":[0.15206608,0.00006131795,0.8471776,0.00016594105,0.00012499357,0.000025735444,0.000013885634,0.000008184536,0.0003562206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973635,0.0001268167,0.0005713446,0.000859596,0.0007162969,0.0003624341],"domain_scores_gemma":[0.99792874,0.0005246302,0.0000933708,0.0005908188,0.00077200454,0.000090466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016942784,0.00022399833,0.0003003277,0.0015864806,0.00029941284,0.000621748,0.0010258626,0.00022634584,0.000014699872],"category_scores_gemma":[0.0004374835,0.00021031026,0.000050850034,0.0019443854,0.0016834739,0.0004404957,0.0005985702,0.000738076,0.0000037005602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017306993,0.000024220844,0.000007975205,0.000024816176,0.00000348233,0.0000032151577,0.0007572982,0.03195061,0.00011575833,0.12159809,0.000011767623,0.84550107],"study_design_scores_gemma":[0.00004555085,0.00013240264,0.00006188295,0.000384072,0.0000039346073,0.000017712786,0.000003808291,0.89809674,0.0027310692,0.09808939,0.0002234889,0.00020996758],"about_ca_topic_score_codex":0.000050573424,"about_ca_topic_score_gemma":0.000698486,"teacher_disagreement_score":0.8661461,"about_ca_system_score_codex":0.00025085866,"about_ca_system_score_gemma":0.002357042,"threshold_uncertainty_score":0.8576203},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040996703,0.0009206244,0.97505975,0.0012590539,0.00340586,0.00027234372,0.0000037353818,0.0004010127,0.018636605],"genre_scores_gemma":[0.22338355,0.00017309857,0.75764585,0.008222406,0.0014686146,0.000024253884,0.000011379272,0.000082270824,0.008988588],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957604,0.00006305525,0.0005588232,0.0018402252,0.0009495384,0.00082799565],"domain_scores_gemma":[0.99637324,0.0010364873,0.0002505802,0.0020042348,0.0001590353,0.00017641453],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001591224,0.0006153394,0.00061339064,0.0011679855,0.00047065062,0.0008963189,0.0054487474,0.00037548746,0.000040836476],"category_scores_gemma":[0.000178096,0.00056542363,0.00019318506,0.00096699956,0.0005704384,0.0007045183,0.0026613353,0.0012809087,0.00008421104],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025724637,0.000017520124,0.0000152686,0.000042898035,0.000011495584,0.000099175675,0.0006288088,0.0027733706,0.00010681587,0.22230855,0.00013359974,0.7738599],"study_design_scores_gemma":[0.00022882604,0.00008100713,0.000031704072,0.0009750654,0.000009778959,0.00006747954,3.401093e-7,0.4606398,0.0017013262,0.5262346,0.0091745695,0.00085548783],"about_ca_topic_score_codex":0.000025332798,"about_ca_topic_score_gemma":0.00003424302,"teacher_disagreement_score":0.7730044,"about_ca_system_score_codex":0.00033515392,"about_ca_system_score_gemma":0.00068975164,"threshold_uncertainty_score":0.9999322},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048303374,0.00092784635,0.988903,0.0007818039,0.0020847055,0.00025405287,0.000010960238,0.00016405915,0.006390574],"genre_scores_gemma":[0.1497323,0.000037041267,0.84474725,0.0025244453,0.00037043018,0.000009593312,0.000011983261,0.000039736584,0.002527239],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962715,0.00004239839,0.00062359235,0.0013868916,0.0010748224,0.0006008243],"domain_scores_gemma":[0.9969982,0.0006881406,0.0003230598,0.0016275913,0.00023049976,0.00013249926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009282753,0.00050944235,0.0006504854,0.0010878196,0.00020316384,0.00024495067,0.004007611,0.0003327979,0.000049925606],"category_scores_gemma":[0.00008008842,0.00045588595,0.00020163214,0.00083082705,0.000992634,0.00047455385,0.0026251536,0.00067319814,0.00002328734],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018873658,0.00006795809,0.00003996519,0.00008848163,0.000025861256,0.00016174922,0.00031165103,0.00472235,0.00058194494,0.1855579,0.00021526028,0.808208],"study_design_scores_gemma":[0.0003597492,0.00022972423,0.0002952451,0.0009343107,0.00001275933,0.00007782728,1.5093138e-7,0.4357316,0.0026659209,0.55765396,0.0013661783,0.00067260384],"about_ca_topic_score_codex":0.000026238939,"about_ca_topic_score_gemma":0.000022390604,"teacher_disagreement_score":0.8075354,"about_ca_system_score_codex":0.00019787728,"about_ca_system_score_gemma":0.0010474658,"threshold_uncertainty_score":0.9997893},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024131138,0.0000093775825,0.9929575,0.0001226486,0.00091945595,0.00061692327,0.000020984759,0.00008953038,0.0028504666],"genre_scores_gemma":[0.21304162,0.000013373782,0.7825804,0.00027199124,0.00021533702,0.000027186104,0.000025603456,0.000117029565,0.0037074697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977553,0.000020632284,0.00059730955,0.00063159823,0.0006572669,0.0003378872],"domain_scores_gemma":[0.99760437,0.00048206525,0.0006051018,0.00087619945,0.00036574533,0.000066547385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003706448,0.00043399722,0.000717024,0.00044787928,0.00008273099,0.00006640552,0.000749185,0.000241818,0.00005956212],"category_scores_gemma":[0.00030941027,0.00035735397,0.000074013995,0.00038013334,0.0005175173,0.00031739255,0.00039483033,0.00040411606,0.0000059580457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013387782,0.00021321079,0.000039149803,0.0010596953,0.0000916925,0.00010342828,0.0039326157,0.0005440503,0.01133283,0.95317775,0.000015181814,0.029356498],"study_design_scores_gemma":[0.00040357086,0.0003284018,0.000027573597,0.0012948441,0.000039178336,0.000033658675,4.84602e-7,0.0017695135,0.018836899,0.97653097,0.00028601603,0.00044889565],"about_ca_topic_score_codex":0.0000019933962,"about_ca_topic_score_gemma":0.00001299897,"teacher_disagreement_score":0.21062851,"about_ca_system_score_codex":0.00014080829,"about_ca_system_score_gemma":0.0004719572,"threshold_uncertainty_score":0.9998878},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000094439994,0.00029597516,0.9888201,0.0052937805,0.00065463834,0.00052320573,0.00001253641,0.00030744015,0.003997897],"genre_scores_gemma":[0.62709445,0.00011780494,0.35597247,0.008575181,0.00075546006,0.00010620832,0.00006449414,0.00007341191,0.007240554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689263,0.000049736016,0.00036911535,0.0011347869,0.00096308015,0.00059065217],"domain_scores_gemma":[0.9974186,0.00049314526,0.00026827276,0.0015152717,0.00020876872,0.00009597517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010672003,0.000490252,0.0004141868,0.0002657188,0.0005135824,0.0008971261,0.004510194,0.00020624169,0.000014626427],"category_scores_gemma":[0.000058916132,0.00023208167,0.000094981704,0.00090911094,0.0011630757,0.0006668785,0.0010988142,0.0007176107,0.00002426774],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004292522,0.000020119349,0.000023912504,0.00006677164,0.000019404451,0.00006473774,0.00045407054,0.005764342,0.000024478892,0.11741411,0.00023905201,0.8759047],"study_design_scores_gemma":[0.00020306243,0.00022379571,0.00018309726,0.0009571114,0.000017381395,0.00013255335,7.8212145e-7,0.8481287,0.0006109114,0.14150748,0.007406537,0.000628622],"about_ca_topic_score_codex":0.000044278284,"about_ca_topic_score_gemma":0.000092617425,"teacher_disagreement_score":0.8752761,"about_ca_system_score_codex":0.00031935805,"about_ca_system_score_gemma":0.0009912206,"threshold_uncertainty_score":0.9464016},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005841927,0.0011802486,0.98804903,0.0007283271,0.0013315844,0.0002812535,0.000009913015,0.00014019766,0.0076952623],"genre_scores_gemma":[0.7050965,0.0004973051,0.2868891,0.005366992,0.000420598,0.00001576188,0.000010918995,0.00005160797,0.0016512397],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967829,0.00007618239,0.00042610412,0.0015168577,0.00056072045,0.00063720933],"domain_scores_gemma":[0.99758875,0.0011781811,0.00017056912,0.0008442969,0.00008973249,0.0001284507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014351738,0.00046668478,0.0004995749,0.0013854045,0.00027486487,0.00051754015,0.0023033093,0.00028255334,0.000016642553],"category_scores_gemma":[0.00019459357,0.0004372956,0.00006849024,0.0010335309,0.000563111,0.0005985623,0.0016758429,0.0012093445,0.000013625695],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004324845,0.00001812444,0.000070136186,0.000032041462,0.000008456941,0.0001800964,0.0023931672,0.0010241779,0.000062411316,0.06463532,0.000057918453,0.93151385],"study_design_scores_gemma":[0.0006383336,0.00017290183,0.000751466,0.0027760842,0.0000106657435,0.00012188351,0.000005370971,0.49467945,0.0015728256,0.49501666,0.002872662,0.0013816869],"about_ca_topic_score_codex":0.00003254522,"about_ca_topic_score_gemma":0.00007878633,"teacher_disagreement_score":0.93013215,"about_ca_system_score_codex":0.00027003148,"about_ca_system_score_gemma":0.00039762352,"threshold_uncertainty_score":0.9998079},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018770954,0.00033425738,0.9916617,0.0006984484,0.002295071,0.00048660842,0.0000047352214,0.00019120456,0.0024508592],"genre_scores_gemma":[0.38375685,0.00009121431,0.6017875,0.011321028,0.00038883594,0.000040754367,0.00001732249,0.000070684386,0.0025258344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961929,0.00006490774,0.00052068953,0.0018023235,0.0007132883,0.0007059322],"domain_scores_gemma":[0.99734354,0.00047855522,0.00017655868,0.0016619707,0.00012841218,0.00021094197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009003313,0.0005291114,0.0006070567,0.0012718188,0.00017244542,0.00035019784,0.0039037275,0.00037417654,0.000022278833],"category_scores_gemma":[0.000106865955,0.0004833651,0.000119565346,0.0010799317,0.00025440572,0.0004305372,0.0023459524,0.0006564964,0.000060691113],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058940193,0.0001045404,0.00040062642,0.00020218163,0.000015539968,0.00046332375,0.0024747034,0.029899146,0.008910311,0.04901004,0.00119395,0.9072667],"study_design_scores_gemma":[0.0011201481,0.00033691063,0.00069613464,0.004766475,0.000009663175,0.00003981126,0.0000012365238,0.73730093,0.0530646,0.1913729,0.009474985,0.0018162313],"about_ca_topic_score_codex":0.000027301692,"about_ca_topic_score_gemma":0.00003741963,"teacher_disagreement_score":0.90545046,"about_ca_system_score_codex":0.00039356094,"about_ca_system_score_gemma":0.00046897988,"threshold_uncertainty_score":0.9997618},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036098072,0.00222093,0.9878144,0.007199922,0.0009368215,0.00092470244,0.000013960319,0.00030781975,0.0005778008],"genre_scores_gemma":[0.018467313,0.000012284277,0.9625964,0.017759103,0.00019865243,0.000058125042,0.00000833175,0.000021219488,0.0008785648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722147,0.00003052916,0.00040683243,0.0011822743,0.00069403934,0.00046485072],"domain_scores_gemma":[0.9969313,0.0010760095,0.00029385998,0.0012328755,0.00039960974,0.00006630421],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082381465,0.00042507495,0.0003576578,0.0005422868,0.00040604937,0.00079908606,0.004107967,0.00027149674,0.000012152299],"category_scores_gemma":[0.00016526309,0.00030145596,0.00015941221,0.0005787948,0.0005035778,0.00043030048,0.00072160695,0.00058627565,0.000008618505],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069504763,0.000014641475,0.0000047247754,0.0000673204,0.000007221836,0.000006437171,0.00066638726,0.0003721739,0.00017812185,0.0377214,0.0005084907,0.9604461],"study_design_scores_gemma":[0.00035597972,0.00020491975,0.000004608744,0.0007371367,0.00001636387,0.000011221426,3.80102e-7,0.49112847,0.047675982,0.4527515,0.0065287,0.0005847681],"about_ca_topic_score_codex":0.000022346112,"about_ca_topic_score_gemma":0.00005441684,"teacher_disagreement_score":0.95986134,"about_ca_system_score_codex":0.00029408434,"about_ca_system_score_gemma":0.0007792566,"threshold_uncertainty_score":0.99994373},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018263236,0.0008127604,0.99053013,0.00039098592,0.0060115913,0.001832077,0.000015037761,0.00032118635,0.00006794739],"genre_scores_gemma":[0.0085996045,0.00001125119,0.98892665,0.0012515874,0.00031711068,0.00016983604,0.00002560687,0.000040263494,0.00065809954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949646,0.00005730591,0.0010566921,0.0019778763,0.0010759087,0.0008676435],"domain_scores_gemma":[0.9961146,0.0012256209,0.00059671805,0.0013461164,0.000540208,0.00017672626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012910553,0.00073851243,0.0007827359,0.0011223808,0.0005980376,0.000862414,0.0029461568,0.0005861787,0.000004430877],"category_scores_gemma":[0.00036246047,0.000688128,0.00018727029,0.00069108943,0.00016948287,0.0003686723,0.00082713144,0.00057500525,0.000030891195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024765395,0.0001642788,0.00038733738,0.0020551393,0.00009813727,0.000079058314,0.0020977757,0.121247515,0.000048720332,0.1194719,0.00020953827,0.7541158],"study_design_scores_gemma":[0.00076304615,0.00010218324,0.00033340717,0.0057713194,0.00001541125,0.00001340467,5.396701e-7,0.9637454,0.0017531364,0.011102523,0.015070103,0.0013295269],"about_ca_topic_score_codex":0.000028914948,"about_ca_topic_score_gemma":0.000067685425,"teacher_disagreement_score":0.8424979,"about_ca_system_score_codex":0.0011489772,"about_ca_system_score_gemma":0.0026624152,"threshold_uncertainty_score":0.999557},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009577822,0.00015742348,0.98838305,0.002060921,0.0052522295,0.0016614477,0.000026800246,0.002005422,0.0003569068],"genre_scores_gemma":[0.09331642,0.000043956985,0.89682853,0.0041609625,0.0015074759,0.00016975078,0.0002744821,0.00008442754,0.0036140196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960692,0.00006626685,0.0009117422,0.0016742514,0.0006431906,0.00063533225],"domain_scores_gemma":[0.99700135,0.00048145995,0.0005696384,0.0012764476,0.0005353461,0.0001357437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009879733,0.00060965406,0.0006997916,0.0011899208,0.00044907746,0.00080520066,0.0019050481,0.0004962878,0.000012787542],"category_scores_gemma":[0.00023390517,0.00055168645,0.00020499858,0.0006758446,0.00015483703,0.0008990852,0.0005184463,0.0003582779,0.000029450037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024796238,0.00017406934,0.00029924387,0.00050011685,0.00015962998,0.00002076382,0.0023517807,0.09643929,0.01417978,0.03682534,0.007084965,0.8419402],"study_design_scores_gemma":[0.00058672915,0.00011587384,0.00042705142,0.00018778406,0.000015399663,0.0000062488157,9.105097e-8,0.98906565,0.0021409232,0.0041837324,0.002722934,0.0005475805],"about_ca_topic_score_codex":0.00007133916,"about_ca_topic_score_gemma":0.00013447889,"teacher_disagreement_score":0.89262635,"about_ca_system_score_codex":0.000520356,"about_ca_system_score_gemma":0.00067166996,"threshold_uncertainty_score":0.99969345},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000024755257,0.00036701176,0.9902472,0.0037770185,0.0013898155,0.0015958956,0.00046730984,0.0007219622,0.0014313301],"genre_scores_gemma":[0.009878148,0.00015640809,0.9850598,0.0013429642,0.00045093868,0.0003110929,0.0008031055,0.00006446168,0.0019330542],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99439585,0.00005234549,0.00097116793,0.0025744794,0.0010230665,0.0009830993],"domain_scores_gemma":[0.9942341,0.00091913954,0.00065629504,0.0033051092,0.0006792899,0.00020605892],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009960112,0.00079381175,0.0008201916,0.00092138926,0.00046842717,0.00082441,0.005822541,0.00057136785,0.000014328518],"category_scores_gemma":[0.0005336054,0.0006768824,0.00022237009,0.0011386973,0.00054167124,0.00084528583,0.0019376863,0.0008276018,0.0000132766945],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038669827,0.00010375104,0.00011974446,0.0003841645,0.00003191778,0.000022841434,0.00033566804,0.0015905139,0.0020669235,0.17347273,0.007981766,0.8138513],"study_design_scores_gemma":[0.0008672118,0.00030420467,0.0003361232,0.002878349,0.000023471412,0.000028122424,2.1023351e-7,0.27864382,0.018431287,0.49143687,0.20537607,0.0016742713],"about_ca_topic_score_codex":0.000016993925,"about_ca_topic_score_gemma":0.00004742646,"teacher_disagreement_score":0.81217706,"about_ca_system_score_codex":0.0006479466,"about_ca_system_score_gemma":0.0008101065,"threshold_uncertainty_score":0.9995682},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020135364,0.00012701488,0.9699814,0.0004203687,0.00036634837,0.00028254767,0.0000070010647,0.0000081445805,0.00867182],"genre_scores_gemma":[0.9968776,0.00001356943,0.002275472,0.00037314426,0.0002686272,0.000005810989,0.000008298995,0.0000073651945,0.00017012663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987592,0.000029274926,0.00023641087,0.0004854404,0.00024873734,0.00024094855],"domain_scores_gemma":[0.99935114,0.00031635805,0.00008026375,0.00018868096,0.000029824325,0.000033743287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032056955,0.00019900245,0.00020121215,0.00030805983,0.00012768543,0.00011747465,0.00032825329,0.00008753644,0.000042538904],"category_scores_gemma":[0.000005961801,0.00015358914,0.00004217723,0.0002501495,0.00019102226,0.0001842951,0.00018906171,0.0006839163,0.00000193363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011622481,0.00003122304,0.0012449488,0.000022603093,0.000004755686,0.000010625164,0.0010389884,0.47063792,0.00012032136,0.04013986,0.000016740612,0.48672038],"study_design_scores_gemma":[0.00019315016,0.000014566319,0.0002544009,0.00029520842,0.0000028617699,0.0000043118744,0.000002483577,0.8030623,0.0000754355,0.19583663,0.000096629614,0.0001619848],"about_ca_topic_score_codex":0.000050759936,"about_ca_topic_score_gemma":0.000044593806,"teacher_disagreement_score":0.9767422,"about_ca_system_score_codex":0.000056186247,"about_ca_system_score_gemma":0.00008437322,"threshold_uncertainty_score":0.62631834},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084159495,0.00015427399,0.98796517,0.00012739588,0.0005961477,0.00046972217,0.000038830138,0.00014976365,0.0020827472],"genre_scores_gemma":[0.98526496,0.000020549933,0.014159951,0.00026356385,0.00007027943,0.000018889335,0.0000584326,0.000026202051,0.00011715524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834645,0.000007648171,0.00043653251,0.00048535087,0.00039201774,0.00033199356],"domain_scores_gemma":[0.9994106,0.00010959635,0.000064441156,0.00031777992,0.00004356475,0.00005398188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018548637,0.0003222769,0.00034659373,0.0005260093,0.00009244458,0.0000670206,0.00036279918,0.00015242178,0.00003406573],"category_scores_gemma":[0.000018069359,0.0003130425,0.00003999957,0.00042874384,0.0002947804,0.00014703197,0.000041685566,0.00052928383,0.0000026390937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014569017,0.00004094895,0.0038820468,0.00018934773,0.00005101527,0.000034529556,0.0031289503,0.8199763,0.00045833664,0.002628356,0.0000079483825,0.16958766],"study_design_scores_gemma":[0.0019063237,0.0002456336,0.062272243,0.0025493705,0.00007085207,0.00002178691,0.000017107233,0.91988724,0.0030825362,0.004587036,0.0039043983,0.00145546],"about_ca_topic_score_codex":0.00008052046,"about_ca_topic_score_gemma":0.0018370987,"teacher_disagreement_score":0.976849,"about_ca_system_score_codex":0.00033337512,"about_ca_system_score_gemma":0.0001486642,"threshold_uncertainty_score":0.99993217},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035964953,0.00017545506,0.9927456,0.00089212303,0.00026293666,0.00083744054,0.000019259458,0.00021759825,0.0048136697],"genre_scores_gemma":[0.18375584,0.00009164198,0.81421745,0.00070390885,0.00020740811,0.00017379584,0.000009539752,0.000021498292,0.0008188904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779844,0.000011989766,0.00033867676,0.0012305158,0.00029510565,0.0003252946],"domain_scores_gemma":[0.99799275,0.00055507955,0.00025735778,0.000822494,0.00029155036,0.00008074691],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037356338,0.00031901736,0.0003222388,0.00059790065,0.00041860333,0.00033179641,0.0012327548,0.0002620933,0.0000029389741],"category_scores_gemma":[0.00005462316,0.00030673217,0.00008692838,0.00041819262,0.00044605965,0.0004280557,0.0005931775,0.00038916702,0.0000023289747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009417955,0.00001145661,0.000007480543,0.000017975808,0.00000760934,0.0000010687343,0.0002013798,0.00027652126,0.00032219407,0.298016,0.000035129222,0.70109373],"study_design_scores_gemma":[0.00018728492,0.00019262395,0.00030162852,0.00024373543,0.0000140658085,0.000014106889,0.0000012525684,0.506352,0.0058283,0.4819298,0.004456749,0.00047841016],"about_ca_topic_score_codex":0.000014027896,"about_ca_topic_score_gemma":0.000034683628,"teacher_disagreement_score":0.70061535,"about_ca_system_score_codex":0.00017806423,"about_ca_system_score_gemma":0.0003172957,"threshold_uncertainty_score":0.9999385},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000796561,0.00023842414,0.98957235,0.00049826043,0.002026857,0.00097120146,0.000010278471,0.00020350392,0.0063994955],"genre_scores_gemma":[0.016818939,0.00004010783,0.98116314,0.00074439513,0.00033873593,0.0000845126,0.000019218636,0.00002962976,0.00076128857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962119,0.000062340536,0.0006212689,0.0016683348,0.00083337916,0.0006027827],"domain_scores_gemma":[0.99742293,0.0006645954,0.00034941122,0.001113069,0.00030796393,0.00014200526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008377624,0.00046397015,0.00047036257,0.0009819551,0.00048426696,0.00059554883,0.0016972311,0.00031711825,0.000057487683],"category_scores_gemma":[0.00016419339,0.00044753743,0.00023219777,0.0006167176,0.00020143777,0.00072732224,0.0006803441,0.00047771074,0.00002123505],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013625593,0.000029217563,0.000035490917,0.000049161506,0.000015719645,0.000034420387,0.000247851,0.0011196677,0.002935893,0.0013446488,0.00003434602,0.99413997],"study_design_scores_gemma":[0.00070454285,0.00018642301,0.00006438825,0.0007662461,0.000028995406,0.000082635335,0.0000016212354,0.47246313,0.11818297,0.4052844,0.0013687819,0.00086584425],"about_ca_topic_score_codex":0.00005758865,"about_ca_topic_score_gemma":0.00017399069,"teacher_disagreement_score":0.9932741,"about_ca_system_score_codex":0.00052223844,"about_ca_system_score_gemma":0.00025880584,"threshold_uncertainty_score":0.99979764},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001902116,0.00028566993,0.95564723,0.0015036063,0.009785292,0.00049692625,0.0000363962,0.00013956484,0.031915095],"genre_scores_gemma":[0.1373508,0.00002694889,0.7380262,0.009293898,0.0021849591,0.000035898527,0.00013300868,0.00006766241,0.1128806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9841551,0.00015373611,0.0014857684,0.0046176715,0.008310869,0.0012768584],"domain_scores_gemma":[0.98819983,0.0054901615,0.0006031967,0.0037029227,0.0016589222,0.00034497445],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.019046867,0.000612165,0.0008140372,0.0057982868,0.0013390632,0.0051664333,0.012640933,0.00024919075,0.00019881861],"category_scores_gemma":[0.00679757,0.0005026675,0.00021968238,0.013866788,0.0047990275,0.0010413119,0.007144804,0.0010134227,0.00046827883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056463778,0.000041379026,0.00015129254,0.00001272877,0.000005139983,0.000027036916,0.00022600463,0.35736656,0.000004681995,0.0033555732,0.017344764,0.6214592],"study_design_scores_gemma":[0.00022103678,0.00004218928,0.0011070605,0.00036548811,0.000010279363,0.000011522684,0.0000019577426,0.6242723,0.00004282448,0.34263352,0.030787183,0.00050465635],"about_ca_topic_score_codex":0.000023000483,"about_ca_topic_score_gemma":0.00005716891,"teacher_disagreement_score":0.6209545,"about_ca_system_score_codex":0.0010767324,"about_ca_system_score_gemma":0.007850495,"threshold_uncertainty_score":0.9999611},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083841523,0.005052273,0.9309656,0.017928246,0.0099185975,0.0066598947,0.00003270431,0.0001626168,0.028441632],"genre_scores_gemma":[0.98844177,0.00008132081,0.007138571,0.00014264346,0.0007379357,0.00014666765,0.000004852139,0.000017534203,0.003288691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736893,0.00011138341,0.0005116046,0.00063813693,0.0007968893,0.0005730617],"domain_scores_gemma":[0.9920174,0.00521676,0.00027294148,0.00069670746,0.0017096996,0.000086515225],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0036159218,0.00024021094,0.00036265157,0.00030278688,0.00082139915,0.00029058245,0.0017674625,0.00026714572,0.0000061111846],"category_scores_gemma":[0.002643923,0.0001924663,0.00013182202,0.000544726,0.0030040224,0.00017175518,0.00019589395,0.00028035362,6.31375e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024176039,0.00004405488,0.001079444,0.00042283398,0.000025341003,0.0000011818873,0.023831617,0.04714657,0.0000042249867,0.6557113,0.00012649207,0.27158278],"study_design_scores_gemma":[0.0001195639,0.000105114166,0.00010944809,0.00025512552,0.000026192985,0.0000010049056,0.001125169,0.029623441,0.000086686174,0.77039915,0.19776726,0.00038186074],"about_ca_topic_score_codex":0.0011866865,"about_ca_topic_score_gemma":0.0010000005,"teacher_disagreement_score":0.98760337,"about_ca_system_score_codex":0.0015257589,"about_ca_system_score_gemma":0.0046879044,"threshold_uncertainty_score":0.99970925},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001902116,0.00028566993,0.95564723,0.0015036063,0.009785292,0.00049692625,0.0000363962,0.00013956484,0.031915095],"genre_scores_gemma":[0.1373508,0.00002694889,0.7380262,0.009293898,0.0021849591,0.000035898527,0.00013300868,0.00006766241,0.1128806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9841551,0.00015373611,0.0014857684,0.0046176715,0.008310869,0.0012768584],"domain_scores_gemma":[0.98819983,0.0054901615,0.0006031967,0.0037029227,0.0016589222,0.00034497445],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.019046867,0.000612165,0.0008140372,0.0057982868,0.0013390632,0.0051664333,0.012640933,0.00024919075,0.00019881861],"category_scores_gemma":[0.00679757,0.0005026675,0.00021968238,0.013866788,0.0047990275,0.0010413119,0.007144804,0.0010134227,0.00046827883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056463778,0.000041379026,0.00015129254,0.00001272877,0.000005139983,0.000027036916,0.00022600463,0.35736656,0.000004681995,0.0033555732,0.017344764,0.6214592],"study_design_scores_gemma":[0.00022103678,0.00004218928,0.0011070605,0.00036548811,0.000010279363,0.000011522684,0.0000019577426,0.6242723,0.00004282448,0.34263352,0.030787183,0.00050465635],"about_ca_topic_score_codex":0.000023000483,"about_ca_topic_score_gemma":0.00005716891,"teacher_disagreement_score":0.6209545,"about_ca_system_score_codex":0.0010767324,"about_ca_system_score_gemma":0.007850495,"threshold_uncertainty_score":0.9999611},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031402815,0.0002538201,0.96047103,0.00086490053,0.003979863,0.0007818863,0.000015223527,0.00015740794,0.0020730316],"genre_scores_gemma":[0.9935182,0.00003854958,0.004277761,0.001443464,0.0002598414,0.000013704731,0.0000038872818,0.000028260763,0.00041633978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996501,0.00010460229,0.0004906201,0.0015909354,0.00084278727,0.00047004936],"domain_scores_gemma":[0.99554604,0.0034217474,0.00031297476,0.00044930383,0.00021519107,0.00005472475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006782712,0.0004356347,0.0004451592,0.0016583154,0.00039637886,0.00021467065,0.0005785203,0.00029618357,0.000015199209],"category_scores_gemma":[0.004912705,0.00044345483,0.00010246068,0.0010769037,0.0007664284,0.00052384543,0.00048198027,0.0007627635,0.00001538065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012437068,0.000099907855,0.0007089324,0.00013609922,0.000015522615,0.00013879493,0.0005005605,0.08705836,0.09313333,0.004771106,0.000014824924,0.81329817],"study_design_scores_gemma":[0.001026136,0.00029430242,0.003050026,0.0019707482,0.000025564055,0.00009887188,0.0000011492959,0.88216114,0.06077598,0.04930248,0.00033208448,0.00096154015],"about_ca_topic_score_codex":0.00015423846,"about_ca_topic_score_gemma":0.0014587737,"teacher_disagreement_score":0.9621154,"about_ca_system_score_codex":0.0009351645,"about_ca_system_score_gemma":0.0003074097,"threshold_uncertainty_score":0.9998017},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001902116,0.00028566993,0.95564723,0.0015036063,0.009785292,0.00049692625,0.0000363962,0.00013956484,0.031915095],"genre_scores_gemma":[0.1373508,0.00002694889,0.7380262,0.009293898,0.0021849591,0.000035898527,0.00013300868,0.00006766241,0.1128806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9841551,0.00015373611,0.0014857684,0.0046176715,0.008310869,0.0012768584],"domain_scores_gemma":[0.98819983,0.0054901615,0.0006031967,0.0037029227,0.0016589222,0.00034497445],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.019046867,0.000612165,0.0008140372,0.0057982868,0.0013390632,0.0051664333,0.012640933,0.00024919075,0.00019881861],"category_scores_gemma":[0.00679757,0.0005026675,0.00021968238,0.013866788,0.0047990275,0.0010413119,0.007144804,0.0010134227,0.00046827883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056463778,0.000041379026,0.00015129254,0.00001272877,0.000005139983,0.000027036916,0.00022600463,0.35736656,0.000004681995,0.0033555732,0.017344764,0.6214592],"study_design_scores_gemma":[0.00022103678,0.00004218928,0.0011070605,0.00036548811,0.000010279363,0.000011522684,0.0000019577426,0.6242723,0.00004282448,0.34263352,0.030787183,0.00050465635],"about_ca_topic_score_codex":0.000023000483,"about_ca_topic_score_gemma":0.00005716891,"teacher_disagreement_score":0.6209545,"about_ca_system_score_codex":0.0010767324,"about_ca_system_score_gemma":0.007850495,"threshold_uncertainty_score":0.9999611},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001902116,0.00028566993,0.95564723,0.0015036063,0.009785292,0.00049692625,0.0000363962,0.00013956484,0.031915095],"genre_scores_gemma":[0.1373508,0.00002694889,0.7380262,0.009293898,0.0021849591,0.000035898527,0.00013300868,0.00006766241,0.1128806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9841551,0.00015373611,0.0014857684,0.0046176715,0.008310869,0.0012768584],"domain_scores_gemma":[0.98819983,0.0054901615,0.0006031967,0.0037029227,0.0016589222,0.00034497445],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.019046867,0.000612165,0.0008140372,0.0057982868,0.0013390632,0.0051664333,0.012640933,0.00024919075,0.00019881861],"category_scores_gemma":[0.00679757,0.0005026675,0.00021968238,0.013866788,0.0047990275,0.0010413119,0.007144804,0.0010134227,0.00046827883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056463778,0.000041379026,0.00015129254,0.00001272877,0.000005139983,0.000027036916,0.00022600463,0.35736656,0.000004681995,0.0033555732,0.017344764,0.6214592],"study_design_scores_gemma":[0.00022103678,0.00004218928,0.0011070605,0.00036548811,0.000010279363,0.000011522684,0.0000019577426,0.6242723,0.00004282448,0.34263352,0.030787183,0.00050465635],"about_ca_topic_score_codex":0.000023000483,"about_ca_topic_score_gemma":0.00005716891,"teacher_disagreement_score":0.6209545,"about_ca_system_score_codex":0.0010767324,"about_ca_system_score_gemma":0.007850495,"threshold_uncertainty_score":0.9999611},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012173772,0.0002267231,0.99659854,0.00042953365,0.00082360103,0.0009275785,0.0000065219233,0.00020059902,0.00066514156],"genre_scores_gemma":[0.26797915,0.000022273825,0.73092705,0.0006726686,0.00014766412,0.00006840575,0.0000078868225,0.000024126675,0.00015076862],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970973,0.00005190667,0.0006091693,0.0010812327,0.0007241621,0.00043623731],"domain_scores_gemma":[0.9970922,0.0010121983,0.0004107425,0.0011583825,0.00028246478,0.000044049644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013431236,0.00038526085,0.00045335852,0.0010766409,0.00021306289,0.00027182658,0.0028923491,0.00025409024,0.0000016790839],"category_scores_gemma":[0.00022822095,0.00032198665,0.00013501936,0.000984909,0.00037661096,0.0006594399,0.00064909435,0.00052859244,7.817163e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002426949,0.000036822916,0.00004604088,0.00018549444,0.000010498644,0.000019164847,0.0044220868,0.02914162,0.004158636,0.02799167,0.000043771575,0.9339199],"study_design_scores_gemma":[0.0006595525,0.00061204325,0.00006424973,0.0017542893,0.000019655128,0.000057326142,0.0000066510725,0.2603059,0.32219255,0.41165444,0.0016603408,0.0010130059],"about_ca_topic_score_codex":0.000022252852,"about_ca_topic_score_gemma":0.000026492875,"teacher_disagreement_score":0.9329069,"about_ca_system_score_codex":0.0002266671,"about_ca_system_score_gemma":0.00036264717,"threshold_uncertainty_score":0.9999232},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002065876,0.000098043,0.9926703,0.0010793868,0.002109561,0.00041543978,0.000003522819,0.00010101546,0.0014568522],"genre_scores_gemma":[0.9686102,0.000029209094,0.02954186,0.0009992985,0.0002891115,0.00002141854,0.0000027616081,0.00002507453,0.00048104266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971051,0.000101770784,0.00052742974,0.0010704265,0.0007250447,0.00047018324],"domain_scores_gemma":[0.9978541,0.0006150253,0.0002459696,0.0010138309,0.00020567134,0.00006537375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011885477,0.0003923557,0.00041623708,0.0011800498,0.00026799444,0.0002813667,0.0020881053,0.00032728308,0.000010052537],"category_scores_gemma":[0.00016612464,0.00030028712,0.00010258304,0.0015303111,0.00030499557,0.000296212,0.00050971267,0.0011170708,0.000008085268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023300161,0.000036703324,0.000018192723,0.000044751803,0.000011958331,0.00003814136,0.00036449035,0.4253623,0.003842154,0.014662898,0.000024069743,0.555571],"study_design_scores_gemma":[0.00020026109,0.00017268471,0.000044413802,0.0006404409,0.000004661587,0.000017928673,3.261279e-7,0.86783403,0.11408864,0.016185055,0.0004703225,0.00034124526],"about_ca_topic_score_codex":0.00005578485,"about_ca_topic_score_gemma":0.00059751736,"teacher_disagreement_score":0.96654433,"about_ca_system_score_codex":0.0003456482,"about_ca_system_score_gemma":0.00042989105,"threshold_uncertainty_score":0.9999449},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024343457,0.0006515732,0.99195933,0.0035206361,0.0011604201,0.001268475,0.000014788516,0.0004183614,0.0009820509],"genre_scores_gemma":[0.10198913,0.00019518966,0.8918771,0.004323114,0.00045882867,0.00021091447,0.0000062752024,0.00006669403,0.0008727565],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964978,0.00003304978,0.00048406102,0.0017994057,0.0005326276,0.0006530466],"domain_scores_gemma":[0.9976188,0.0005961548,0.0002935527,0.0011025207,0.00025951763,0.00012943265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007135231,0.0005692867,0.0007104377,0.0012764346,0.00021540663,0.00074585323,0.0028218708,0.00050829264,0.000002920732],"category_scores_gemma":[0.0002545881,0.00055935263,0.0001173074,0.00086307165,0.00025962287,0.0012046451,0.001587512,0.0009873708,9.674027e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006826671,0.000041883646,0.00011650193,0.00043241575,0.00002670418,0.00012398946,0.000880106,0.011103675,0.0008152853,0.016758755,0.0005121249,0.96912026],"study_design_scores_gemma":[0.0012516556,0.0002900017,0.00013471222,0.0015082511,0.000014932013,0.000071603296,2.7547614e-7,0.44391432,0.016276391,0.49967203,0.035686944,0.0011788617],"about_ca_topic_score_codex":0.000017248967,"about_ca_topic_score_gemma":0.00020967577,"teacher_disagreement_score":0.9679414,"about_ca_system_score_codex":0.00045060867,"about_ca_system_score_gemma":0.00041490473,"threshold_uncertainty_score":0.9996858},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001581173,0.00012574244,0.9932083,0.0002312982,0.0014618573,0.0005785276,0.000012138816,0.00076539326,0.003458631],"genre_scores_gemma":[0.8384142,0.000017561088,0.15893164,0.0011916315,0.00019368733,0.000073233285,0.000059669896,0.00009640262,0.0010219663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843216,0.0000067528185,0.0003146526,0.000512664,0.00026157856,0.00047220627],"domain_scores_gemma":[0.99929327,0.00022218295,0.000047169953,0.00027161412,0.00010316202,0.00006261159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024525207,0.00034764502,0.0003485652,0.0010149939,0.00025949263,0.0001384476,0.0006000052,0.0002892277,0.000019844483],"category_scores_gemma":[0.00009295913,0.00036390236,0.00012667204,0.00043869554,0.00013595256,0.0000966957,0.00005085304,0.00047979335,0.000009037121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006852831,0.0000027996011,0.000011522555,0.00007911595,0.0000074969957,0.0000045627216,0.00029165894,0.75648475,0.00013261427,0.00039644758,0.000049409737,0.24253279],"study_design_scores_gemma":[0.00029041458,0.00013535608,0.000011376587,0.00054705667,0.000016774185,0.0000036694762,0.0000012616708,0.9716933,0.01889629,0.0023759766,0.005578991,0.00044956373],"about_ca_topic_score_codex":0.0000051164525,"about_ca_topic_score_gemma":0.000028728236,"teacher_disagreement_score":0.83825606,"about_ca_system_score_codex":0.0003735015,"about_ca_system_score_gemma":0.00016349638,"threshold_uncertainty_score":0.99988127},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029100445,0.0004621969,0.99696505,0.00048594325,0.0004967706,0.000829754,0.000053232812,0.00018739775,0.0004905373],"genre_scores_gemma":[0.011557478,0.000007882705,0.98693144,0.00065847737,0.0002219097,0.000063545034,0.00034514768,0.000028935023,0.0001851592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99567616,0.00012878886,0.0005799498,0.0022906289,0.0006267467,0.0006977504],"domain_scores_gemma":[0.99697745,0.00046660742,0.00029411053,0.0018899566,0.00015688731,0.00021498413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021679637,0.0005343385,0.00069632306,0.0013088582,0.00032312065,0.0008777345,0.0040842853,0.00028158072,0.0000052347723],"category_scores_gemma":[0.00031113494,0.00047845466,0.00014011438,0.0012081347,0.00024157704,0.00063832744,0.0015076521,0.0009813608,0.0000041508297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023155279,0.00006110863,0.00043241028,0.00009442517,0.00004250367,0.0000129172,0.00048343162,0.31614345,0.000018701165,0.006905738,0.000039802926,0.6757423],"study_design_scores_gemma":[0.0002150295,0.00014208574,0.00026311906,0.00020648944,0.00006263186,0.000011502253,4.17141e-7,0.9888541,0.000045815083,0.00385475,0.005827406,0.0005166314],"about_ca_topic_score_codex":0.000054120967,"about_ca_topic_score_gemma":0.00005365633,"teacher_disagreement_score":0.67522573,"about_ca_system_score_codex":0.00022264391,"about_ca_system_score_gemma":0.00045577248,"threshold_uncertainty_score":0.9997667},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000029848306,0.00040653304,0.97287905,0.020552726,0.003355123,0.00079263013,0.000009565214,0.0003680957,0.0016332977],"genre_scores_gemma":[0.0006443416,0.000023144268,0.9933476,0.0032811582,0.0009392701,0.00004591749,0.000035608067,0.000037539903,0.0016454456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943778,0.00029496453,0.000942461,0.0019867325,0.0015290701,0.0008689576],"domain_scores_gemma":[0.993357,0.0040402077,0.0003679167,0.0013344962,0.000493558,0.00040684774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0048087193,0.00061428075,0.0008449427,0.0010909158,0.0004395083,0.00046571568,0.0045311768,0.00083175994,0.00007283942],"category_scores_gemma":[0.0026342212,0.0005538083,0.0002127508,0.0008076075,0.0012612165,0.00057372096,0.0019606117,0.0019323165,0.00002601842],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014572058,0.000014439265,0.000043473552,0.00016992584,0.000012515625,0.00003472172,0.00040690394,0.0025300088,0.000008165813,0.060756464,0.00017790517,0.9358309],"study_design_scores_gemma":[0.00022700524,0.0002630616,0.00003716332,0.00044180304,0.0000068632075,0.000079454236,7.391761e-8,0.71039134,0.00013894905,0.2784691,0.00951631,0.0004288799],"about_ca_topic_score_codex":0.00005866781,"about_ca_topic_score_gemma":0.000077654535,"teacher_disagreement_score":0.93540204,"about_ca_system_score_codex":0.00035463765,"about_ca_system_score_gemma":0.0032774424,"threshold_uncertainty_score":0.99969137},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002476017,0.00018060308,0.9896022,0.00082860695,0.0008022833,0.00041691907,0.000024219056,0.00031969463,0.0078007244],"genre_scores_gemma":[0.026354155,0.000026233334,0.9717876,0.0011011809,0.00010229361,0.000007957949,0.000011790721,0.00001461274,0.0005942255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677175,0.000042230567,0.000715823,0.00139417,0.0006817307,0.00039426424],"domain_scores_gemma":[0.99662507,0.00055402535,0.00030339556,0.0018383978,0.00052213226,0.00015698583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006480746,0.00039140397,0.0005833858,0.0010011726,0.00017546106,0.00023645339,0.0035395722,0.00026749432,0.000028459059],"category_scores_gemma":[0.00026076328,0.00039005547,0.00013205902,0.0011007645,0.00035310848,0.0002886785,0.0017753314,0.00043201458,0.000009900045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000462506,0.00004831948,0.0001669735,0.000023218998,0.000013842327,0.000009477254,0.0004978585,0.7029275,0.00004768986,0.02479475,0.00021815299,0.27124766],"study_design_scores_gemma":[0.00012842027,0.00009881715,0.00019771895,0.00045745447,0.000008613712,0.00000300239,6.939912e-8,0.87573403,0.0029736948,0.11898615,0.00092824665,0.00048379565],"about_ca_topic_score_codex":0.000106520274,"about_ca_topic_score_gemma":0.000048947502,"teacher_disagreement_score":0.27076384,"about_ca_system_score_codex":0.00018667502,"about_ca_system_score_gemma":0.0007966267,"threshold_uncertainty_score":0.99985516},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007861985,0.0001639363,0.9957837,0.0007214095,0.0012920065,0.0007327451,0.0000059035,0.00014802818,0.00036607482],"genre_scores_gemma":[0.118931405,0.00002272484,0.8793578,0.0006170011,0.00050351454,0.000031320065,0.000035105768,0.00003579978,0.0004653047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644196,0.00016153448,0.00050352875,0.0016182549,0.00063209294,0.0006426496],"domain_scores_gemma":[0.99784476,0.0008670263,0.00039853874,0.0005545025,0.00020849255,0.00012667481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010540568,0.0004929689,0.0005819121,0.00096328015,0.00037519977,0.00059178035,0.0014657862,0.00028631446,0.0000068179897],"category_scores_gemma":[0.00018074241,0.00047890857,0.0001733569,0.0007286333,0.0002573226,0.0006935262,0.0006098165,0.0014506794,0.0000035472517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019186291,0.000027754177,0.00022841227,0.000048209586,0.000011684663,0.000031869018,0.0005221808,0.39367467,0.00021610511,0.0012415524,0.0000051289103,0.60397327],"study_design_scores_gemma":[0.00059153175,0.0002760852,0.0003973518,0.00069705147,0.000016681417,0.000039823877,0.0000015016797,0.98315096,0.0007274501,0.013495343,0.00013117693,0.0004750458],"about_ca_topic_score_codex":0.000071796596,"about_ca_topic_score_gemma":0.00015488632,"teacher_disagreement_score":0.6034982,"about_ca_system_score_codex":0.0005778525,"about_ca_system_score_gemma":0.00071837875,"threshold_uncertainty_score":0.99976623},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044019245,0.00081602845,0.99007636,0.00031546407,0.0016920372,0.00071451947,0.0000013423132,0.00024616596,0.006094073],"genre_scores_gemma":[0.7121537,0.000535539,0.2819129,0.0035115965,0.00054885325,0.0000958848,0.0000069726348,0.0001287674,0.0011058309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977203,0.000093614304,0.00048097628,0.0006945585,0.00054880365,0.00046173998],"domain_scores_gemma":[0.9972342,0.0018551738,0.00012211541,0.00050715625,0.00016674296,0.000114600494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016193296,0.0004296795,0.00047249193,0.000791004,0.00013602526,0.0002830533,0.0010853248,0.00028830854,0.00004325488],"category_scores_gemma":[0.00035422327,0.00043009783,0.000046180063,0.00065678346,0.00017303003,0.0003920239,0.00011261803,0.00094050745,0.00003099605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029640723,0.000030894287,0.000055858927,0.00015509223,0.000030508709,0.00005511046,0.0058952398,0.81621915,0.000061555795,0.0018454279,0.00043277963,0.17518874],"study_design_scores_gemma":[0.0009195788,0.00020206765,0.0003042261,0.0022302482,0.000055663735,0.000041946696,0.00001209209,0.897513,0.0026508751,0.09178104,0.00256368,0.0017256199],"about_ca_topic_score_codex":0.000027639133,"about_ca_topic_score_gemma":0.00006264231,"teacher_disagreement_score":0.7121096,"about_ca_system_score_codex":0.00037454505,"about_ca_system_score_gemma":0.0010206349,"threshold_uncertainty_score":0.9998151},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014278444,0.00014834883,0.98096347,0.0005098515,0.006959336,0.0007191497,0.000036882626,0.00013394428,0.01038625],"genre_scores_gemma":[0.5595683,0.00003237835,0.409716,0.017847398,0.001726918,0.00009544218,0.000055309014,0.00016966627,0.010788584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9916588,0.00029464462,0.0011406213,0.0023879567,0.0037623018,0.000755693],"domain_scores_gemma":[0.98913884,0.0074832495,0.0006292424,0.0020745653,0.000472616,0.00020149472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0063610766,0.000681481,0.0007630914,0.0024298138,0.00044126945,0.000686339,0.003091954,0.00047287522,0.00018962735],"category_scores_gemma":[0.0025169726,0.0005362666,0.00033294733,0.0018297189,0.0007216069,0.00024985685,0.0008474287,0.0013503374,0.000013396852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003721045,0.000016303768,0.00039575784,0.0000052799473,0.0000047020617,0.000014898535,0.000027598724,0.5002643,0.0000045815677,0.00027823413,0.00019393871,0.49875718],"study_design_scores_gemma":[0.00028235136,0.00029655488,0.0026880407,0.00032311384,0.000013387809,0.000004836839,1.15234606e-7,0.873818,0.000019395276,0.12147994,0.00070266705,0.00037160554],"about_ca_topic_score_codex":0.000016134221,"about_ca_topic_score_gemma":0.0001019082,"teacher_disagreement_score":0.57124746,"about_ca_system_score_codex":0.00064810924,"about_ca_system_score_gemma":0.000436253,"threshold_uncertainty_score":0.9997089},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004098442,0.00011120826,0.9939624,0.00074557087,0.0021941722,0.00049612985,0.0000095993255,0.0006910268,0.0017857935],"genre_scores_gemma":[0.57624406,0.00004544176,0.41627195,0.0067255027,0.00025654671,0.000055640623,0.000038428752,0.0000484947,0.00031396726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961037,0.00006139208,0.0005184053,0.001830997,0.00086837757,0.00061709905],"domain_scores_gemma":[0.99628484,0.0005674694,0.0003291599,0.0024671694,0.00022911192,0.00012225068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006867957,0.0005608334,0.00044344066,0.0016824831,0.00031839818,0.0005669217,0.0039658146,0.00046351214,0.000009094326],"category_scores_gemma":[0.00010584778,0.00054040365,0.00015477106,0.0013205883,0.00050292845,0.0005192737,0.00075394695,0.0012526921,0.000012486238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007212644,0.000021048898,0.000009835485,0.0000178353,0.0000035432715,0.0000185262,0.0000206561,0.14490053,0.000081036385,0.0056490027,0.000041508636,0.8492293],"study_design_scores_gemma":[0.00015157115,0.00016974058,0.00016184765,0.00024458626,0.000004907611,0.000009041066,1.9180249e-8,0.95144224,0.001004514,0.045758534,0.0005793851,0.0004736331],"about_ca_topic_score_codex":0.000011293769,"about_ca_topic_score_gemma":0.000063716856,"teacher_disagreement_score":0.8487556,"about_ca_system_score_codex":0.00048755118,"about_ca_system_score_gemma":0.00029510685,"threshold_uncertainty_score":0.9997048},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059173367,0.0002855994,0.9943671,0.0007461531,0.0015406148,0.0006245477,0.000014713038,0.00075069553,0.0010788292],"genre_scores_gemma":[0.05378985,0.00001170138,0.9427542,0.0017080307,0.00074249215,0.000034681485,0.000052811214,0.000028967554,0.0008772683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965933,0.000061388855,0.0004767354,0.0016863791,0.00060504326,0.0005771724],"domain_scores_gemma":[0.99806684,0.00030954956,0.00019876816,0.0010444766,0.00027278354,0.000107609034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008967022,0.0004165524,0.0004330562,0.0003934725,0.00032370555,0.0005948443,0.0016849906,0.00035958842,0.0000047847234],"category_scores_gemma":[0.00022083652,0.00040792834,0.00010488218,0.00037550903,0.00006192445,0.00078015274,0.0008879037,0.0005424126,0.000012216744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056436998,0.00001599529,0.0000047866015,0.000024807825,0.000011323838,0.0000158698,0.006494326,0.68094975,0.00055965007,0.15770844,0.00011476077,0.15409464],"study_design_scores_gemma":[0.00021153614,0.00006664624,0.0000029356302,0.0004416128,0.000008917698,0.000004794428,0.0000010856098,0.9276273,0.0005875087,0.069734514,0.0009234091,0.00038969333],"about_ca_topic_score_codex":0.00021518052,"about_ca_topic_score_gemma":0.00014862165,"teacher_disagreement_score":0.24667758,"about_ca_system_score_codex":0.0003623328,"about_ca_system_score_gemma":0.00037071333,"threshold_uncertainty_score":0.9998373},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004664483,0.00019484172,0.9912542,0.00086467696,0.0018838012,0.00057461666,0.0000037794493,0.00007957211,0.00047999164],"genre_scores_gemma":[0.870285,0.000077956385,0.12868892,0.00026289173,0.00019703637,0.00001402054,0.000011975334,0.000024542553,0.00043769597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939639,0.00024922157,0.00080352474,0.0018690046,0.0023395699,0.0007747845],"domain_scores_gemma":[0.996357,0.00029633022,0.00024586185,0.0022756327,0.000615377,0.00020976726],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0033899958,0.00040564092,0.0005253234,0.0016326167,0.00022197772,0.00051620114,0.006353623,0.00032378006,0.000007751284],"category_scores_gemma":[0.000086636996,0.00040159054,0.00007233546,0.0015437762,0.00051250856,0.0010157884,0.0016323994,0.0012011743,0.000006568714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019534189,0.00043213723,0.008046056,0.00016175062,0.000022677594,0.00012151248,0.004238877,0.24020016,0.0012318065,0.20133202,0.0000342748,0.5441592],"study_design_scores_gemma":[0.00030952357,0.00026514338,0.0013372463,0.00034525085,0.000005371074,0.000004508819,0.0000014034231,0.8265277,0.00085202843,0.16989356,0.000071245486,0.00038703493],"about_ca_topic_score_codex":0.00027741143,"about_ca_topic_score_gemma":0.0012667988,"teacher_disagreement_score":0.8656205,"about_ca_system_score_codex":0.00041425397,"about_ca_system_score_gemma":0.0012221935,"threshold_uncertainty_score":0.9998436},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038154647,0.0009088464,0.9541747,0.000113649345,0.005038702,0.001218125,0.0000012126166,0.00021160397,0.00017853823],"genre_scores_gemma":[0.98320633,0.000027347376,0.015314437,0.000120466604,0.00040782188,0.000059422135,8.9102446e-7,0.00003188206,0.00083140057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995587,0.0001932341,0.00078088156,0.001982958,0.00076439074,0.0006915725],"domain_scores_gemma":[0.9966443,0.0014110875,0.00024465445,0.0012857396,0.0002035911,0.00021060671],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001193817,0.0006539438,0.00068927405,0.0013671567,0.00045974206,0.0018806774,0.0014807939,0.00025461486,0.0000019945294],"category_scores_gemma":[0.00022806766,0.0005973853,0.000094236355,0.0007895475,0.00020706309,0.0010230725,0.0009703028,0.0011058738,0.000012294391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011837925,0.0002407971,0.0038893837,0.000118617725,0.000024172772,0.00842455,0.02986388,0.11506796,0.000009354425,0.018560223,0.0000020413097,0.82378715],"study_design_scores_gemma":[0.0010683173,0.0021026668,0.0035587098,0.031054031,0.00004320086,0.0018770209,0.0008871329,0.9537152,0.00028990643,0.00198491,0.000667273,0.002751615],"about_ca_topic_score_codex":0.0002932981,"about_ca_topic_score_gemma":0.00038234555,"teacher_disagreement_score":0.94505167,"about_ca_system_score_codex":0.0008606694,"about_ca_system_score_gemma":0.00022644091,"threshold_uncertainty_score":0.99964774},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037251352,0.00043456315,0.98692954,0.00012924524,0.001908586,0.00090472825,0.000006060879,0.00021743341,0.009097323],"genre_scores_gemma":[0.7542755,0.000042432555,0.16349405,0.00020761567,0.00079061097,0.000077631616,0.000010849168,0.00006323533,0.0810381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643064,0.000033594308,0.0004342406,0.0015514244,0.0008087786,0.00074130035],"domain_scores_gemma":[0.9978342,0.00032999177,0.0003205024,0.0009105514,0.0004937904,0.00011093274],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010131465,0.0005791908,0.0006110218,0.000728765,0.00076674286,0.0010846326,0.0024283545,0.00031393766,0.000005892083],"category_scores_gemma":[0.00004259004,0.0004887351,0.00013017037,0.00054900756,0.00023928782,0.0009948041,0.00068969117,0.0009577376,0.000007706454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017708188,0.00025483337,0.0009825047,0.0022309704,0.0002914992,0.00004894521,0.016712088,0.32957238,0.0037456728,0.25643283,0.0004095092,0.38914168],"study_design_scores_gemma":[0.001807243,0.002671727,0.00034023376,0.018331692,0.0000802429,0.00007096787,0.000011157125,0.9057037,0.033665217,0.011004755,0.024038272,0.00227479],"about_ca_topic_score_codex":0.000014016229,"about_ca_topic_score_gemma":0.00006350851,"teacher_disagreement_score":0.8234355,"about_ca_system_score_codex":0.0007729062,"about_ca_system_score_gemma":0.0005369536,"threshold_uncertainty_score":0.9999523},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.306355e-7,0.48236015,0.51412034,0.00082392135,0.0014842357,0.0011189261,4.707654e-7,0.00008284016,0.000008596819],"genre_scores_gemma":[0.00012867918,0.3822945,0.6156185,0.001479371,0.0002880686,0.00016823372,0.000005457299,0.000013790308,0.0000034011764],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.9936689,0.00072123203,0.0013096413,0.0020195025,0.0014423002,0.0008383853],"domain_scores_gemma":[0.9949671,0.000959209,0.000977742,0.0020945412,0.0008410482,0.00016036147],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0061815316,0.00067388004,0.0015563901,0.0011386247,0.0011315421,0.0016305599,0.006930821,0.0001862962,0.0000020845248],"category_scores_gemma":[0.0012254297,0.00045134267,0.00034452422,0.011373243,0.0017519754,0.0012007917,0.0019945337,0.0015133611,0.0000043906484],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[4.8358663e-7,0.00006484249,0.0000028910038,0.014983662,0.000007728911,0.0000024430888,0.0014113978,0.0005069844,0.0000013019122,0.0012242768,0.0000131658235,0.9817808],"study_design_scores_gemma":[0.00016915576,0.000309732,0.000018203134,0.88704705,0.00015645497,0.000134117,0.0000036904328,0.057649627,0.00014058108,0.0019865765,0.05105099,0.0013338124],"about_ca_topic_score_codex":0.00009215085,"about_ca_topic_score_gemma":0.000081758,"teacher_disagreement_score":0.980447,"about_ca_system_score_codex":0.0006085055,"about_ca_system_score_gemma":0.014835815,"threshold_uncertainty_score":0.9997938},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002618747,0.0014074876,0.93575925,0.0015066122,0.0018266499,0.00063883583,0.000025801384,0.0002426529,0.055973962],"genre_scores_gemma":[0.9412496,0.00004451428,0.0117933005,0.0071201194,0.0010928562,0.00008477769,0.000042535812,0.00008123079,0.038491063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682415,0.000044057568,0.00038854542,0.0014311124,0.0006567615,0.000655364],"domain_scores_gemma":[0.9982479,0.00036241155,0.00014742759,0.0005502643,0.0005696826,0.00012227689],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004273099,0.00048509578,0.0005030646,0.00043535436,0.0002728764,0.00020390235,0.0009823728,0.00039424724,0.0001793597],"category_scores_gemma":[0.00030201403,0.00042015026,0.00010637259,0.000528401,0.0004114407,0.000104640865,0.00040277437,0.0011757603,0.000053789376],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007479302,0.000105276216,0.0002345562,0.00019317563,0.000057126712,0.00016138791,0.004269506,0.017108958,0.000027744887,0.009597546,0.00016437189,0.96800554],"study_design_scores_gemma":[0.0029644282,0.001497049,0.00084486644,0.00741197,0.00023370037,0.00033830263,0.000033464337,0.80439556,0.0007771485,0.14125402,0.03561909,0.004630376],"about_ca_topic_score_codex":0.00026240764,"about_ca_topic_score_gemma":0.00033780633,"teacher_disagreement_score":0.96337515,"about_ca_system_score_codex":0.00028377373,"about_ca_system_score_gemma":0.0008413834,"threshold_uncertainty_score":0.99982506},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001862462,0.00004031974,0.9943367,0.000083366365,0.00084314187,0.00057378114,0.00003458416,0.00006798705,0.00215766],"genre_scores_gemma":[0.79225427,0.000004145529,0.2065514,0.00022290563,0.0006350233,0.000036882833,0.00007619122,0.000019318717,0.00019989385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970861,0.00009083103,0.00061922544,0.00112271,0.00058215566,0.000498979],"domain_scores_gemma":[0.998605,0.0005204999,0.0003316346,0.00038865954,0.00005117792,0.00010298892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021231838,0.000336498,0.00036998294,0.00017894321,0.00033150794,0.00008020688,0.000625064,0.00033455048,0.0000142666595],"category_scores_gemma":[0.00013719825,0.000336104,0.00008497675,0.0003480058,0.00070123404,0.0004430541,0.00042171965,0.00068640115,0.0000026493815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039404513,0.000037642847,0.0051557743,0.000029524297,0.0000045363304,0.000001646501,0.00050794444,0.80249286,0.000012830072,0.0014350984,0.000014681095,0.19026805],"study_design_scores_gemma":[0.00025452385,0.00015393984,0.013280918,0.00024396266,0.000005692204,0.0000032277178,0.0000029749062,0.9703422,0.000036582347,0.015278554,0.00007244552,0.00032493964],"about_ca_topic_score_codex":0.0003290606,"about_ca_topic_score_gemma":0.00019958803,"teacher_disagreement_score":0.7903918,"about_ca_system_score_codex":0.00080243713,"about_ca_system_score_gemma":0.00013562701,"threshold_uncertainty_score":0.9999091},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007753314,0.0002332468,0.98878056,0.0010292083,0.0031840724,0.0014974612,0.000022438771,0.00025811707,0.004987132],"genre_scores_gemma":[0.0013878495,0.000028791048,0.99511963,0.0012433793,0.0002996404,0.000078596226,0.000010647302,0.000027707802,0.001803753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956689,0.000076026314,0.0007043922,0.0019687288,0.00080641033,0.00077554403],"domain_scores_gemma":[0.9956596,0.0010921041,0.00036658163,0.0021703478,0.0005558317,0.0001555734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002525377,0.00058317627,0.00065037946,0.0009409896,0.0004168575,0.0005175509,0.00467432,0.00048112564,0.000011822529],"category_scores_gemma":[0.001052198,0.0005547226,0.00019057623,0.00095132756,0.0006971711,0.00055579864,0.001501297,0.0007897332,0.000010550432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016223099,0.0000463195,0.000012028675,0.00024291057,0.000014044209,0.000009685973,0.00027863984,0.025623616,0.00004523481,0.3517269,0.00013558318,0.6218488],"study_design_scores_gemma":[0.00028257366,0.00014345959,0.00004321185,0.00032695924,0.00001266241,0.000012660858,6.2708956e-8,0.8142834,0.00056356663,0.18097831,0.0028351129,0.00051806954],"about_ca_topic_score_codex":0.000010925584,"about_ca_topic_score_gemma":0.000051133266,"teacher_disagreement_score":0.78865975,"about_ca_system_score_codex":0.00054835714,"about_ca_system_score_gemma":0.0010269688,"threshold_uncertainty_score":0.9996904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011319248,0.00019852887,0.9932563,0.0011106869,0.0017907893,0.00029811467,0.000045966113,0.000072026196,0.0032162988],"genre_scores_gemma":[0.037588537,0.000026786154,0.96066123,0.0011337649,0.00031208483,0.0000064893356,0.000014837638,0.0000128270285,0.00024344865],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996414,0.00009233382,0.00070275384,0.001194621,0.0011021998,0.0004940589],"domain_scores_gemma":[0.99463856,0.0028568343,0.0004095088,0.0018504886,0.0001661527,0.000078471145],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018783739,0.00037153938,0.00053549116,0.00035988184,0.00027419353,0.0012999483,0.00492731,0.00018454314,0.00002013395],"category_scores_gemma":[0.0005394314,0.00027387045,0.000108807704,0.00075184694,0.0011834376,0.00092593906,0.0024175202,0.00080743304,0.000007508658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023697492,0.00001707399,0.000055587225,0.000056713427,0.000010758635,0.000010691598,0.00015447545,0.000748867,0.0000059930007,0.47633165,0.00007524915,0.52253056],"study_design_scores_gemma":[0.00019735986,0.00006186938,0.0013819316,0.00074514985,0.000015280679,0.0000031307384,8.7006606e-7,0.27580214,0.00010687985,0.71682465,0.0043174215,0.0005433175],"about_ca_topic_score_codex":0.00005315053,"about_ca_topic_score_gemma":0.00003946284,"teacher_disagreement_score":0.52198726,"about_ca_system_score_codex":0.00015046069,"about_ca_system_score_gemma":0.00048217186,"threshold_uncertainty_score":0.99997133},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018021756,0.0007079045,0.9784719,0.00018398388,0.0020786016,0.00029938534,0.0000016897659,0.00010633095,0.018132227],"genre_scores_gemma":[0.7306912,0.0000780193,0.26090652,0.001296635,0.00064811803,0.000015614198,0.000006234865,0.000037874845,0.0063197976],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972152,0.000029530036,0.00048763226,0.0010428136,0.0007643093,0.0004605025],"domain_scores_gemma":[0.9977789,0.00032127267,0.000270249,0.0013285122,0.00020417728,0.00009687412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070229935,0.0003207465,0.00052728975,0.000676173,0.00008796997,0.00023772112,0.003231202,0.00029702144,0.000016121478],"category_scores_gemma":[0.000080790065,0.00029593383,0.00015518742,0.0006061068,0.0004959858,0.00027582244,0.0012363759,0.00045339446,0.00003973131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017763876,0.00001717078,0.00007098766,0.00005832648,0.000011773494,0.00004146723,0.0004953023,0.0007857147,0.000030582454,0.23964608,0.00007102555,0.7587698],"study_design_scores_gemma":[0.0005541937,0.00040545798,0.0006104163,0.00035997145,0.00002272774,0.00006405667,3.615146e-7,0.105148375,0.0017294817,0.8266652,0.06322931,0.0012104337],"about_ca_topic_score_codex":0.00006643011,"about_ca_topic_score_gemma":0.000044021082,"teacher_disagreement_score":0.75755936,"about_ca_system_score_codex":0.00012304539,"about_ca_system_score_gemma":0.00055180304,"threshold_uncertainty_score":0.9999493},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017613394,0.00036614382,0.9956423,0.00031320166,0.0014072234,0.0007729041,0.000013335724,0.00041841203,0.0010646979],"genre_scores_gemma":[0.0015839643,0.000024845576,0.9958864,0.0008138304,0.00028564676,0.000060508104,0.000025035513,0.000043367974,0.001276442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583143,0.0000782898,0.00062561047,0.0018137507,0.00087542576,0.0007754752],"domain_scores_gemma":[0.99732643,0.0005472474,0.00043221322,0.00092842686,0.0006330268,0.00013265335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020072085,0.0006018193,0.0005712731,0.0012458174,0.00064703595,0.0005865988,0.0027613493,0.000461745,0.000007487756],"category_scores_gemma":[0.0004230102,0.0006198453,0.00020547891,0.001089892,0.00026755154,0.00073083455,0.0006282112,0.001250037,0.000006495276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006430104,0.000013814617,0.000010493565,0.0000636043,0.0000067372207,0.0000015471196,0.0001307496,0.31772465,0.00011833196,0.009122611,0.0000128013835,0.67278826],"study_design_scores_gemma":[0.0003012169,0.00018181466,0.00000666541,0.000333208,0.0000140445445,0.00001248458,5.4360683e-8,0.95223004,0.0064870897,0.037338354,0.0025126762,0.0005823533],"about_ca_topic_score_codex":0.000023390508,"about_ca_topic_score_gemma":0.000029706716,"teacher_disagreement_score":0.67220587,"about_ca_system_score_codex":0.0007199046,"about_ca_system_score_gemma":0.0011903932,"threshold_uncertainty_score":0.99962527},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012247627,0.0008024111,0.97951126,0.00018016195,0.002464886,0.00042324886,0.0000050479657,0.00028170034,0.016208818],"genre_scores_gemma":[0.024424877,0.00004245415,0.97364026,0.0006660447,0.0002507822,0.000012904098,0.00000486724,0.000023888517,0.0009339113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963426,0.00009775355,0.0005392208,0.0017805783,0.0006354195,0.00060441566],"domain_scores_gemma":[0.99699724,0.00041582764,0.00023137691,0.0018339126,0.0003033666,0.0002182581],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016499594,0.00051097944,0.00051823055,0.0010226663,0.00035076367,0.0006225484,0.0032156534,0.0003443,0.000012363993],"category_scores_gemma":[0.00012879669,0.00047944777,0.00007725851,0.0008256186,0.00088249607,0.0005507795,0.0019159247,0.00077106245,0.000035373658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004935524,0.000049922466,0.0000229835,0.00005928715,0.000005757789,0.000009020694,0.0009508964,0.011417662,0.00006984141,0.25902677,0.000025045358,0.7283579],"study_design_scores_gemma":[0.00020705212,0.00018912677,0.00037036746,0.00033902706,0.000007831028,0.00003704839,2.42964e-7,0.94035643,0.0015830662,0.052403934,0.003944129,0.000561749],"about_ca_topic_score_codex":0.000011441051,"about_ca_topic_score_gemma":0.000017999497,"teacher_disagreement_score":0.92893875,"about_ca_system_score_codex":0.00026871724,"about_ca_system_score_gemma":0.00060967513,"threshold_uncertainty_score":0.9997657},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007815888,0.00010618805,0.9935244,0.000119707605,0.0018393783,0.0005249018,0.000006253799,0.00030205393,0.0034989915],"genre_scores_gemma":[0.024682088,0.000007611935,0.97414225,0.000504799,0.00016562105,0.00002244016,0.000004452508,0.000028303482,0.0004424532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960679,0.00003827103,0.0005708798,0.0017069262,0.00096232706,0.0006537171],"domain_scores_gemma":[0.9968318,0.00029236646,0.00021388939,0.0021823545,0.00030509627,0.00017454616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015414404,0.00053923356,0.00046588376,0.00092825387,0.00018290839,0.000567013,0.004044853,0.00032162937,0.000010184855],"category_scores_gemma":[0.00028745868,0.00051588134,0.00010525095,0.000652792,0.00034948325,0.00061821,0.0011156148,0.00081542507,0.000029236091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026319678,0.0000241051,0.0000013778556,0.000056244502,0.0000035971646,0.000008476458,0.0003218215,0.7721687,0.000073083334,0.11961716,0.0000062523404,0.10771658],"study_design_scores_gemma":[0.000109928704,0.00007532549,0.000016869148,0.00035184066,0.0000070951883,0.000019943021,3.39739e-8,0.9690477,0.00052342686,0.029069407,0.0002716122,0.00050679565],"about_ca_topic_score_codex":0.0000068774357,"about_ca_topic_score_gemma":0.000006048519,"teacher_disagreement_score":0.19687904,"about_ca_system_score_codex":0.00063248567,"about_ca_system_score_gemma":0.00073463446,"threshold_uncertainty_score":0.9997293},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000115169794,0.00028823808,0.98322767,0.00040282836,0.0013066324,0.00045327793,0.000016188113,0.00018178123,0.014008193],"genre_scores_gemma":[0.65938175,0.000030360063,0.33710924,0.001735632,0.00060912035,0.000063173,0.000059755093,0.000046643818,0.0009642968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674207,0.000025551532,0.0005777445,0.0012458492,0.0008115358,0.0005972477],"domain_scores_gemma":[0.9976159,0.00069141283,0.00024581942,0.0011449269,0.00017635972,0.00012563443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068018556,0.00041501943,0.00048296124,0.0013462091,0.00014796999,0.0003006698,0.0025951732,0.00022955204,0.000014421399],"category_scores_gemma":[0.000029696796,0.00042187437,0.0001165316,0.0011007753,0.00022136382,0.0005700087,0.0014151925,0.00069787033,0.00006239186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059174718,0.00003753103,0.000052632397,0.000111952635,0.000009948344,0.000043795175,0.00044932694,0.04497975,0.000025261084,0.5601887,0.00016417951,0.39393097],"study_design_scores_gemma":[0.00034128374,0.000066535824,0.0004979494,0.0005727858,0.000005890542,0.000031616608,4.5062012e-7,0.88183075,0.00010695479,0.10952547,0.0064867195,0.00053355773],"about_ca_topic_score_codex":0.00008297534,"about_ca_topic_score_gemma":0.00007856243,"teacher_disagreement_score":0.836851,"about_ca_system_score_codex":0.0008695801,"about_ca_system_score_gemma":0.0009904924,"threshold_uncertainty_score":0.99982333},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001445992,0.0004356233,0.99312264,0.00030594884,0.003230361,0.0013361447,0.000006321324,0.000070775975,0.00004621022],"genre_scores_gemma":[0.4138654,0.00019544833,0.58219695,0.0015941246,0.0009815627,0.00041839379,0.000012218222,0.00004260346,0.0006933373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975304,0.00004790082,0.00072613975,0.00081155193,0.00055833644,0.00032566136],"domain_scores_gemma":[0.99616957,0.001375208,0.00039686114,0.001558903,0.00045598965,0.00004349203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013768754,0.00030997026,0.00056479016,0.00038986377,0.0002860364,0.00044680393,0.0023635859,0.00013372328,8.213798e-7],"category_scores_gemma":[0.00019585577,0.00019616264,0.00016654894,0.00048592337,0.00026533598,0.0010259493,0.00064402237,0.00024963892,0.0000035279513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030645504,0.00013029827,0.0005508313,0.06171339,0.00018592644,0.000014077111,0.012350865,0.21646224,0.0025208893,0.057757456,0.00019911492,0.6480843],"study_design_scores_gemma":[0.00018498367,0.00012380503,0.000121250094,0.0077586696,0.000031297674,0.000014591591,6.2681846e-7,0.976179,0.007073206,0.0077064796,0.00038997777,0.00041608454],"about_ca_topic_score_codex":0.000041072115,"about_ca_topic_score_gemma":0.0000763919,"teacher_disagreement_score":0.7597168,"about_ca_system_score_codex":0.00014701218,"about_ca_system_score_gemma":0.00035355947,"threshold_uncertainty_score":0.799928},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006376304,0.00049460266,0.9909223,0.0020192377,0.003789074,0.0011910524,0.000020404546,0.0003303377,0.0011692265],"genre_scores_gemma":[0.0600866,0.00025827382,0.93247485,0.0049827234,0.0009883039,0.00015464825,0.00007893953,0.00006155449,0.0009140798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99480605,0.000049544517,0.0008085412,0.0025493521,0.0008852269,0.00090131],"domain_scores_gemma":[0.9959546,0.00069080014,0.00053521147,0.0020685843,0.0005681675,0.00018268837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069692667,0.00073462364,0.0006719929,0.0014332712,0.0005328149,0.00059344555,0.003508948,0.0005537243,0.000004141648],"category_scores_gemma":[0.00012563058,0.00071579736,0.000290276,0.0016075539,0.0006240382,0.0009760493,0.0006720518,0.00085629354,0.000009083304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017350283,0.00004465971,0.00006078381,0.000068788446,0.00002610466,0.000013995492,0.00013767443,0.07074238,0.0050633666,0.25630394,0.00061960187,0.66690135],"study_design_scores_gemma":[0.00038972514,0.00012130882,0.00007902406,0.00021212216,0.000012586035,0.000011678577,5.6139033e-8,0.7195725,0.001694742,0.27609292,0.001220509,0.00059286767],"about_ca_topic_score_codex":0.0000045142538,"about_ca_topic_score_gemma":0.00006688709,"teacher_disagreement_score":0.6663085,"about_ca_system_score_codex":0.00030165003,"about_ca_system_score_gemma":0.00045328727,"threshold_uncertainty_score":0.9995293},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034222616,0.0002766036,0.98952264,0.0032284006,0.005199807,0.0007281395,0.000011353856,0.00012265664,0.00087616994],"genre_scores_gemma":[0.039185304,0.000017485894,0.9520031,0.003519206,0.0011823017,0.00006903981,0.000025741661,0.000026960737,0.0039708386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690485,0.000073936186,0.0005869752,0.0013725263,0.0006433826,0.00041835],"domain_scores_gemma":[0.9970122,0.0010233979,0.00024153055,0.0011726326,0.0004591407,0.000091119204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020791101,0.00034479573,0.0003738708,0.0007416285,0.00026678768,0.00058033684,0.0019465989,0.00029049095,0.0000080546915],"category_scores_gemma":[0.0002894732,0.0003415734,0.0001082723,0.00028669275,0.00015440614,0.00043153248,0.00059574726,0.00033064676,0.0000089662435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004211308,0.000024688761,0.000016321952,0.000118340315,0.000034099772,0.00001576629,0.00080219953,0.36867195,0.000834093,0.26338997,0.0031878166,0.36286262],"study_design_scores_gemma":[0.00029985106,0.00005935145,0.0000061183305,0.00017074498,0.0000055548444,0.000015451245,1.0918434e-7,0.9568479,0.00042303212,0.03264937,0.009190342,0.00033214033],"about_ca_topic_score_codex":0.000018019882,"about_ca_topic_score_gemma":0.000014474936,"teacher_disagreement_score":0.58817595,"about_ca_system_score_codex":0.0005420671,"about_ca_system_score_gemma":0.0011761817,"threshold_uncertainty_score":0.9999036},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029436374,0.00015831765,0.9943145,0.0013973579,0.0015956252,0.0013232538,0.000013538725,0.000911555,0.00025643228],"genre_scores_gemma":[0.17717592,0.000016702563,0.82019055,0.0018051548,0.000119311735,0.00013031505,0.0000070682268,0.000060842354,0.00049413735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962382,0.000043385633,0.00058913033,0.0016487947,0.0007975933,0.00068292656],"domain_scores_gemma":[0.99666196,0.0006816615,0.00046965043,0.00155632,0.0005100946,0.00012031202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007018566,0.00062999956,0.00066412037,0.0014026761,0.00045007424,0.0009296772,0.0026462805,0.00046051634,0.0000075083694],"category_scores_gemma":[0.00010486285,0.00052038196,0.00018157081,0.000939636,0.0007962214,0.000755357,0.00050694065,0.00068340864,0.0000064889964],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004324837,0.000054258828,0.000032150823,0.000046668934,0.000031899956,0.000014994884,0.000062725056,0.004930906,0.0004277981,0.006290936,0.00003112503,0.9880333],"study_design_scores_gemma":[0.0014296776,0.000590303,0.000047539143,0.000396553,0.000035182617,0.00001196803,9.150275e-7,0.95663714,0.009663994,0.028584475,0.001978889,0.0006233377],"about_ca_topic_score_codex":0.00002528657,"about_ca_topic_score_gemma":0.00009436482,"teacher_disagreement_score":0.98740995,"about_ca_system_score_codex":0.000558387,"about_ca_system_score_gemma":0.0007583361,"threshold_uncertainty_score":0.9997248},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000962449,0.00026335876,0.9910672,0.0016645499,0.004588312,0.0014552423,0.0000882135,0.00033987514,0.0004370606],"genre_scores_gemma":[0.08567458,0.000013989659,0.9106406,0.0027910564,0.00039509716,0.000087077664,0.00004327852,0.00004770251,0.00030662795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946265,0.0002528639,0.0006571294,0.0025592456,0.0011485708,0.0007556466],"domain_scores_gemma":[0.984316,0.0124907615,0.00048066222,0.0018292562,0.0006264704,0.0002568472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001639931,0.0008311656,0.0007380681,0.0016400112,0.0007744724,0.00073306565,0.0036835612,0.00029085268,0.000009042896],"category_scores_gemma":[0.0012489487,0.00078656164,0.00038043546,0.0012913244,0.0004004539,0.0010148059,0.0009326769,0.0018396323,0.0000073545434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051991894,0.00013474635,0.00010128735,0.00007317306,0.00001616443,0.000014640794,0.0006922151,0.6112243,0.000023071372,0.019061308,0.00009342216,0.36851367],"study_design_scores_gemma":[0.00045872293,0.00018080647,0.00029034252,0.002189585,0.000019152183,0.000007744549,0.0000011406617,0.89240205,0.000395553,0.10226034,0.0011456652,0.0006488766],"about_ca_topic_score_codex":0.000043342032,"about_ca_topic_score_gemma":0.00030448427,"teacher_disagreement_score":0.3678648,"about_ca_system_score_codex":0.00053414726,"about_ca_system_score_gemma":0.0010864083,"threshold_uncertainty_score":0.99945855},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004722002,0.0009212062,0.9945604,0.0006704137,0.0022596223,0.00063747744,0.00001430675,0.0003110065,0.00057835376],"genre_scores_gemma":[0.124543935,0.00025729495,0.86849433,0.005237811,0.00076929247,0.000025494246,0.00018341975,0.000078293684,0.00041009925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99457365,0.000047908805,0.0006059056,0.0027915656,0.0010530889,0.0009278767],"domain_scores_gemma":[0.9946067,0.00071283197,0.00042173915,0.0038079696,0.0002422512,0.00020853741],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005799471,0.0007487435,0.0006296878,0.0009341231,0.00038800633,0.00070750416,0.008047887,0.000216752,0.0000094188745],"category_scores_gemma":[0.000047530793,0.0006379515,0.00009899914,0.0014691693,0.0008022994,0.0017626976,0.0035774948,0.0012566195,0.000004925348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015908652,0.00001327146,0.000060450944,0.000015911633,0.000015264286,0.0001464889,0.000030434901,0.52834797,0.0000042576676,0.003240734,0.00012049985,0.46798882],"study_design_scores_gemma":[0.00040173548,0.0001617835,0.00007337027,0.00033997407,0.000018962259,0.000107938955,5.7898752e-8,0.9556265,0.00007299522,0.042193286,0.00033790496,0.0006654974],"about_ca_topic_score_codex":0.000016800219,"about_ca_topic_score_gemma":0.00022634535,"teacher_disagreement_score":0.4673233,"about_ca_system_score_codex":0.00017822822,"about_ca_system_score_gemma":0.0003390043,"threshold_uncertainty_score":0.9996072},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036300244,0.0019354365,0.9858946,0.009305582,0.0010608045,0.00045421204,0.000007087855,0.00006287243,0.0012757409],"genre_scores_gemma":[0.004576676,0.00066909625,0.99185365,0.0011824911,0.0007980786,0.000044380882,0.000074477626,0.000016027045,0.0007851126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979082,0.00004482789,0.00033844777,0.0009977401,0.0004530413,0.00025778258],"domain_scores_gemma":[0.9982088,0.0005478239,0.00017474685,0.0005285663,0.00044895822,0.00009109053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000671343,0.0002684564,0.00024259712,0.0004338703,0.00019916323,0.00038644,0.0005022617,0.00024178434,0.000009071027],"category_scores_gemma":[0.00030149447,0.00027507325,0.000047338777,0.00012471546,0.00015713496,0.0009759347,0.00028188757,0.00023053121,6.2323784e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023152259,0.000014138963,7.3639677e-7,0.00006132286,0.0000058124347,0.000002672963,0.0009133886,0.28681636,0.0000046414675,0.4740087,0.000037533107,0.23813237],"study_design_scores_gemma":[0.00013180182,0.000044267614,0.000001500356,0.00016735474,0.000009823049,0.00002034353,8.828937e-7,0.91525686,0.000027853761,0.08367178,0.000422602,0.00024493504],"about_ca_topic_score_codex":0.0000105869,"about_ca_topic_score_gemma":0.000029409715,"teacher_disagreement_score":0.6284405,"about_ca_system_score_codex":0.00021025634,"about_ca_system_score_gemma":0.0009527123,"threshold_uncertainty_score":0.99997014},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000083523046,0.005417583,0.9905695,0.0006743709,0.00012702089,0.0013704161,0.000003123726,0.00016931433,0.0015851979],"genre_scores_gemma":[0.06082014,0.00022280129,0.937612,0.00073419197,0.00014863869,0.00016220729,0.0000041532116,0.000011823622,0.00028404404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973813,0.00003749361,0.00033558457,0.0014934875,0.00032340956,0.0004287051],"domain_scores_gemma":[0.99826217,0.00069040444,0.00012099749,0.0006865586,0.00015025775,0.00008963062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011358188,0.00037971686,0.0004916056,0.0003761542,0.00033133692,0.00048337437,0.0014143863,0.00030263426,5.9391397e-7],"category_scores_gemma":[0.00020514856,0.0002967646,0.00005441764,0.00026114026,0.0006614417,0.00025103713,0.0009028492,0.00033726613,4.727636e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019252295,0.000024643196,0.000036887668,0.00025949863,0.000011102395,0.0000047240537,0.00064525916,0.0022671185,0.000024958037,0.82475233,0.000008847957,0.1719454],"study_design_scores_gemma":[0.00017340503,0.00006834042,0.000019121457,0.00012307109,0.000007186287,0.000030686562,0.00000195096,0.40302467,0.000046303263,0.59605825,0.00019837827,0.00024860777],"about_ca_topic_score_codex":0.000008542955,"about_ca_topic_score_gemma":0.00002768574,"teacher_disagreement_score":0.40075755,"about_ca_system_score_codex":0.00006435993,"about_ca_system_score_gemma":0.00033748714,"threshold_uncertainty_score":0.99994844},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006729518,0.0018184743,0.99012154,0.00026919218,0.0025900267,0.00086752593,0.0000011794571,0.00012686645,0.0041378927],"genre_scores_gemma":[0.8136616,0.000068423244,0.18307416,0.000527818,0.0010274946,0.00007870719,0.000002370595,0.000045164947,0.0015142766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963915,0.000113030605,0.0007227524,0.0014773413,0.0005343249,0.00076109776],"domain_scores_gemma":[0.9969518,0.001570951,0.00027015363,0.0009021672,0.00021174792,0.00009318668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027641305,0.00054657564,0.0006178041,0.0010444599,0.00051127863,0.0010133962,0.0025268525,0.00025111705,0.0000012239337],"category_scores_gemma":[0.00015482058,0.00042064232,0.00015015653,0.00064049376,0.00019577231,0.00039184818,0.0008005643,0.00093181216,0.00000508035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056390572,0.000022656712,0.00011172751,0.0005069362,0.000015914964,0.00007853423,0.014326166,0.03416593,0.000031289623,0.40929583,0.000004107801,0.5414353],"study_design_scores_gemma":[0.0002466136,0.00015112403,0.00008189654,0.004579647,0.000014548003,0.00012531276,0.000036252703,0.96843594,0.00047310034,0.015174956,0.00993266,0.0007479565],"about_ca_topic_score_codex":0.00006923394,"about_ca_topic_score_gemma":0.00009980135,"teacher_disagreement_score":0.93427,"about_ca_system_score_codex":0.0006026391,"about_ca_system_score_gemma":0.00029550784,"threshold_uncertainty_score":0.9998245},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004769382,0.0013863042,0.99142367,0.000027655133,0.0014519066,0.00040408585,0.0000029470657,0.00016696236,0.0046595274],"genre_scores_gemma":[0.36793908,0.000016310156,0.63120437,0.0002795901,0.00023261998,0.0000065804143,6.522172e-7,0.000020574413,0.0003002349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956965,0.000059518818,0.00067752216,0.0019506904,0.00083389156,0.00078190374],"domain_scores_gemma":[0.9960268,0.0024234322,0.0004391879,0.00066793786,0.00033324875,0.00010938104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014772421,0.0005984672,0.0007883406,0.0009440065,0.0006232212,0.00092933147,0.0016724248,0.00025673653,0.0000036716992],"category_scores_gemma":[0.0006216586,0.0005603165,0.00010797899,0.000621912,0.00046138788,0.0006371361,0.0013377517,0.0010627288,0.0000033834938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015228029,0.000021639033,0.000067022826,0.0001136865,0.000029351577,0.00009813478,0.003307166,0.020040821,0.00014925664,0.05872149,0.0000010544068,0.91743517],"study_design_scores_gemma":[0.00033588425,0.000295782,0.00012601836,0.013953073,0.000026582898,0.00021012485,0.000020990154,0.9102295,0.00036690015,0.07276939,0.0004644245,0.001201304],"about_ca_topic_score_codex":0.000031780026,"about_ca_topic_score_gemma":0.00006126117,"teacher_disagreement_score":0.91623384,"about_ca_system_score_codex":0.00043104406,"about_ca_system_score_gemma":0.0007676361,"threshold_uncertainty_score":0.9996848},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012241976,0.00041053636,0.9786438,0.00095312204,0.002498593,0.0003480538,0.00000726851,0.0003233435,0.016692862],"genre_scores_gemma":[0.30137354,0.000040591935,0.6901804,0.0046450915,0.0010356453,0.00002445563,0.00002552655,0.000043616896,0.002631103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996429,0.0000558479,0.00053136965,0.0017178319,0.0007244729,0.000541437],"domain_scores_gemma":[0.9969786,0.0006187211,0.00019611581,0.0018553601,0.00022576255,0.00012548192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012481405,0.00047952842,0.00048083812,0.00065121386,0.00037552495,0.00068902253,0.0037205683,0.00030458713,0.000063330066],"category_scores_gemma":[0.0002020763,0.00042014444,0.00013785655,0.00057393475,0.00059254136,0.0006106857,0.0019080418,0.0006833013,0.000054248303],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048224656,0.00005130797,0.00006394019,0.00008047592,0.000010382622,0.00012048771,0.0004043518,0.008234137,0.00020768515,0.24898455,0.00020013271,0.7416377],"study_design_scores_gemma":[0.00015954248,0.00010014602,0.0002428712,0.0003828825,0.000005787263,0.00002603985,6.902484e-8,0.6308257,0.0010547339,0.36400834,0.002658253,0.0005356386],"about_ca_topic_score_codex":0.00002869769,"about_ca_topic_score_gemma":0.00003587942,"teacher_disagreement_score":0.7411021,"about_ca_system_score_codex":0.00034046982,"about_ca_system_score_gemma":0.00071540603,"threshold_uncertainty_score":0.99982506},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045505745,0.00005020576,0.99059707,0.00047591398,0.0023802153,0.0010305075,0.000039995055,0.000054820157,0.005325788],"genre_scores_gemma":[0.47088885,0.000016482998,0.51867425,0.0020111725,0.0017643312,0.00014872164,0.00007393288,0.00005809168,0.0063641462],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971107,0.000034646404,0.00058665266,0.0010843903,0.0008605118,0.00032305284],"domain_scores_gemma":[0.995083,0.0024797616,0.0004534319,0.0007789357,0.0010985418,0.00010632942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021229493,0.00029583363,0.00044745137,0.0004198344,0.00036627537,0.00043680338,0.0012680806,0.0002643522,0.00007711326],"category_scores_gemma":[0.0010113801,0.00021732364,0.000086461594,0.0007043427,0.0013543112,0.0002843329,0.00017392759,0.00038647064,0.000024521576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007716557,0.00003334964,0.0000055635974,0.000009608851,0.000012635344,0.000002064901,0.00014357716,0.0020985561,0.00019150841,0.19819762,0.00011565246,0.7991127],"study_design_scores_gemma":[0.0007105138,0.00022464874,0.000013580628,0.00010058337,0.00001687175,0.000015089279,0.0000014783133,0.13819908,0.0017580637,0.8512478,0.0073953276,0.00031698451],"about_ca_topic_score_codex":0.0000027932547,"about_ca_topic_score_gemma":0.000011181371,"teacher_disagreement_score":0.7987957,"about_ca_system_score_codex":0.00012060422,"about_ca_system_score_gemma":0.00086028693,"threshold_uncertainty_score":0.8862201},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003520474,0.0017807717,0.9949682,0.00071522634,0.0011129383,0.0005158397,0.000037949474,0.000014442332,0.00050261576],"genre_scores_gemma":[0.4586398,0.0046790713,0.51067007,0.0038395636,0.0026980739,0.0018570115,0.00052264816,0.00012572871,0.01696804],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99851084,0.000012144845,0.00026486244,0.00076487113,0.00023830916,0.00020894947],"domain_scores_gemma":[0.9990445,0.00005035931,0.00016443046,0.000500578,0.00018339494,0.00005677334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024523857,0.0002204357,0.00019768259,0.00023370258,0.00011319754,0.000076482735,0.0004034175,0.00027924404,0.000030227913],"category_scores_gemma":[0.00011911935,0.0001990293,0.000096723365,0.00012072295,0.00013291335,0.0000072419025,0.00021687943,0.00013616214,0.000003021305],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032759035,0.000018629149,0.00006437298,0.000064899206,0.000009941875,6.031036e-7,0.0000388705,0.032057546,0.017669573,0.00041486684,0.0028007932,0.9468272],"study_design_scores_gemma":[0.00094300834,0.00041125488,0.00049456477,0.0014457307,0.000057180427,0.0000060452635,4.4099195e-7,0.22978255,0.50785005,0.03572478,0.22230874,0.00097565143],"about_ca_topic_score_codex":0.000009372928,"about_ca_topic_score_gemma":0.000049432932,"teacher_disagreement_score":0.9458515,"about_ca_system_score_codex":0.00009955583,"about_ca_system_score_gemma":0.0004010186,"threshold_uncertainty_score":0.8116179},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009139772,0.000055963308,0.98538685,0.00009187294,0.00021173258,0.0016092475,0.000092185546,0.0001066437,0.0033057516],"genre_scores_gemma":[0.8141507,0.0000015827893,0.18461765,0.00018842744,0.00014981783,0.00006109212,0.00029221678,0.000030388408,0.0005081163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766153,0.000054706445,0.0005592451,0.00080951344,0.00057808857,0.00033691715],"domain_scores_gemma":[0.9988235,0.000036847683,0.00031977604,0.00057456427,0.00016914197,0.000076157325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005030609,0.0003951662,0.00035827057,0.0005938729,0.00010255966,0.00006818588,0.0006441379,0.00050276954,0.000005928187],"category_scores_gemma":[0.00040240362,0.00035831466,0.00007411708,0.0004662034,0.00026440088,0.000014679507,0.00024269504,0.00075610616,9.936241e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014085988,0.000089847825,0.00077005354,0.00049808284,0.000014978059,0.0000013617221,0.0002274689,0.9339968,0.03748874,0.00025744934,0.000024073079,0.026490312],"study_design_scores_gemma":[0.00051031134,0.00081226305,0.000767404,0.001130398,0.0000073317474,0.000003724269,8.379423e-7,0.97425747,0.020876803,0.00027958356,0.0010744425,0.00027944762],"about_ca_topic_score_codex":0.00001503741,"about_ca_topic_score_gemma":0.000043072345,"teacher_disagreement_score":0.8050109,"about_ca_system_score_codex":0.00014433943,"about_ca_system_score_gemma":0.00035199497,"threshold_uncertainty_score":0.9998869},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032498452,0.00043321156,0.9948461,0.00018198625,0.00047903846,0.00036081736,0.000004272803,0.000114992676,0.00032975487],"genre_scores_gemma":[0.64417636,0.000015103944,0.35532695,0.0002572196,0.00014476331,0.0000030691751,0.000003789515,0.0000194949,0.000053240805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997753,0.000063869345,0.00058939186,0.0008394708,0.00035874755,0.0003954886],"domain_scores_gemma":[0.9956679,0.0033742187,0.00034688826,0.000406261,0.00015443549,0.000050304578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012197492,0.00038206286,0.0006043429,0.00039503627,0.0004510472,0.000096223455,0.00030995763,0.0003173749,0.000004430205],"category_scores_gemma":[0.0012332161,0.0003394212,0.00012101735,0.00027242926,0.00041368607,0.00012593518,0.0005444853,0.00061007915,9.4642456e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008185025,0.00001029416,0.00023952025,0.00016137028,0.000010753907,0.0000047465855,0.000059966344,0.94982344,0.000055932996,0.017498476,6.411598e-7,0.032126702],"study_design_scores_gemma":[0.00010900447,0.000037180987,0.00003086384,0.0005135535,0.000024056753,0.0000018221451,1.5447492e-7,0.6488874,0.000028786657,0.35015413,0.0000065589115,0.00020647913],"about_ca_topic_score_codex":0.00018092983,"about_ca_topic_score_gemma":0.000095838746,"teacher_disagreement_score":0.64092654,"about_ca_system_score_codex":0.001254413,"about_ca_system_score_gemma":0.00017631394,"threshold_uncertainty_score":0.99990577},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016519232,0.000395123,0.98361945,0.0008309888,0.0029520309,0.0008024876,0.000023619461,0.000266288,0.010944846],"genre_scores_gemma":[0.4960914,0.00010618705,0.49356315,0.004080969,0.0013437382,0.000032675245,0.000021207868,0.00006740497,0.0046932725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99550676,0.0000656488,0.0005609886,0.0021173358,0.0007772244,0.0009720636],"domain_scores_gemma":[0.99549514,0.001654307,0.00033664503,0.0015308902,0.0007676687,0.00021536034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010997594,0.0007530606,0.00091148954,0.0009499355,0.0003219025,0.00062629353,0.0024931205,0.0005420369,0.0000043524146],"category_scores_gemma":[0.00047544664,0.0006876697,0.00031116852,0.0007359127,0.0008938122,0.0005128507,0.0018213801,0.0008789149,0.000030384752],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002683329,0.00009810092,0.000040246687,0.00020006945,0.000052356543,0.00028684994,0.0030226002,0.0066424785,0.00019351377,0.22501343,0.00029915525,0.76412433],"study_design_scores_gemma":[0.0005043507,0.00026459192,0.00012752108,0.0006165236,0.000023605595,0.000111438494,4.097393e-7,0.7015084,0.0022021637,0.28943965,0.004277409,0.0009239586],"about_ca_topic_score_codex":0.000029188668,"about_ca_topic_score_gemma":0.00017710937,"teacher_disagreement_score":0.7632004,"about_ca_system_score_codex":0.0004150413,"about_ca_system_score_gemma":0.0013756003,"threshold_uncertainty_score":0.99955744},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060318554,0.00054333615,0.99707425,0.00010466735,0.0009860209,0.0005197087,0.00013735097,0.00002853952,0.00054581085],"genre_scores_gemma":[0.066934295,0.00004501499,0.9287864,0.0015844448,0.00058701093,0.000013573375,0.0007477474,0.000070914066,0.0012305935],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763,0.000039065257,0.00034962353,0.0013482888,0.00020601675,0.00042700407],"domain_scores_gemma":[0.9983714,0.00030385342,0.00017925169,0.0008538897,0.0002052658,0.00008633161],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059633114,0.0004072245,0.0003977409,0.00019317646,0.00018373397,0.00013695161,0.0013788262,0.00044935034,0.000003451337],"category_scores_gemma":[0.00023970088,0.00040800087,0.00012476598,0.00010028993,0.0003006183,0.000009634608,0.00056902005,0.00044021412,0.0000012637342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027249768,0.00016946958,0.0001044837,0.00030298647,0.00005652782,0.00001379382,0.00011397693,0.31812528,0.35342714,0.0000414952,0.00006504381,0.3273073],"study_design_scores_gemma":[0.0011215499,0.00038533268,0.0000041324583,0.00017117092,0.00003853735,0.000005769914,3.2189806e-7,0.86559516,0.12219826,0.00024662857,0.009750823,0.00048232128],"about_ca_topic_score_codex":0.000023538509,"about_ca_topic_score_gemma":0.00022611726,"teacher_disagreement_score":0.54746985,"about_ca_system_score_codex":0.00007718779,"about_ca_system_score_gemma":0.00050150283,"threshold_uncertainty_score":0.99983716},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019594454,0.00024329108,0.9931738,0.0016753686,0.0008152391,0.00078529905,0.000011088365,0.0003740499,0.002902298],"genre_scores_gemma":[0.03944636,0.00003660416,0.9557286,0.0015897017,0.0004442602,0.00019707248,0.000016559388,0.00006608612,0.0024747571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563074,0.00007999777,0.00060163136,0.002195868,0.000761273,0.00073047885],"domain_scores_gemma":[0.9954256,0.0021356158,0.00053569657,0.0012938225,0.00048839947,0.0001208929],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016489419,0.00063090876,0.0008925198,0.0009432852,0.0004760064,0.00048939616,0.0023962737,0.00041273527,0.00001956363],"category_scores_gemma":[0.00042596683,0.0005342684,0.00025286333,0.0007721984,0.0007349037,0.00080233684,0.00063138496,0.0010996341,0.000021595819],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024551413,0.000025471154,0.0000133811345,0.000085118794,0.00010039933,0.00006541316,0.0011106947,0.014190177,0.0032391392,0.005548598,0.00005720424,0.97553986],"study_design_scores_gemma":[0.0004408003,0.00079476484,0.00010770362,0.0002361141,0.00020051411,0.00016288097,9.3325804e-7,0.9502208,0.0037730667,0.03980473,0.0034134663,0.00084417145],"about_ca_topic_score_codex":0.000006411952,"about_ca_topic_score_gemma":0.000024142266,"teacher_disagreement_score":0.9746957,"about_ca_system_score_codex":0.00045082511,"about_ca_system_score_gemma":0.0010689398,"threshold_uncertainty_score":0.99971086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011554161,0.00026300675,0.9903715,0.00079714385,0.0012885854,0.0006284602,0.000018405008,0.000053033164,0.006464325],"genre_scores_gemma":[0.03999991,0.00003866648,0.95691544,0.0011263409,0.0002704896,0.000086469394,0.000013123184,0.000026468617,0.0015231067],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740463,0.000009680767,0.0006679626,0.000833069,0.0005521426,0.000532485],"domain_scores_gemma":[0.99681693,0.0010552452,0.00031690617,0.0011814688,0.0004946889,0.00013477301],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012289761,0.00033173605,0.00035743575,0.0004424063,0.0006587151,0.0003865147,0.0034048264,0.00018733619,0.0000040857312],"category_scores_gemma":[0.00027588508,0.00024700805,0.000121283105,0.00045513094,0.00038760135,0.00036866326,0.001107221,0.00043869525,0.0000111959325],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005989171,0.00001368831,0.000001650547,0.00005932221,0.000012805604,4.3582904e-7,0.0012681555,0.00035110096,0.00011544474,0.062041353,0.00006493995,0.93606514],"study_design_scores_gemma":[0.0007102383,0.0005765827,0.000576605,0.0015330797,0.000026792997,0.00002582358,0.0000069052417,0.3113998,0.01950372,0.3766431,0.28736103,0.0016363399],"about_ca_topic_score_codex":0.000013462633,"about_ca_topic_score_gemma":0.00018541055,"teacher_disagreement_score":0.93442875,"about_ca_system_score_codex":0.00038469012,"about_ca_system_score_gemma":0.0048917304,"threshold_uncertainty_score":0.9999982},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011569,0.0010206612,0.9734472,0.002600397,0.0029607248,0.0004587025,0.000016680595,0.00034086383,0.0191432],"genre_scores_gemma":[0.049679436,0.00019884939,0.9415817,0.00450478,0.0003796569,0.000046836754,0.00000868725,0.00009363776,0.0035063762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99314654,0.000104488325,0.00067599805,0.002638157,0.001987468,0.0014473596],"domain_scores_gemma":[0.99174315,0.0028322288,0.00014832028,0.0043248856,0.0005539941,0.00039744773],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014238723,0.0007731764,0.0007804907,0.0022775207,0.00052236667,0.0007785331,0.011892393,0.0004964588,0.000055382316],"category_scores_gemma":[0.001272694,0.0007302953,0.00029276306,0.001937075,0.002718429,0.0010259202,0.006180553,0.0019166362,0.000092879316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009279139,0.000028717932,0.00001893646,0.000052300475,0.000011133228,0.00017622673,0.00012261307,0.0009875246,0.00006022329,0.67201525,0.00017051435,0.3263473],"study_design_scores_gemma":[0.00030786544,0.0001715215,0.000031382762,0.00046724803,0.000007643255,0.000060827955,1.0604597e-7,0.09440067,0.00080080214,0.9005112,0.0025601224,0.00068062823],"about_ca_topic_score_codex":0.000012851211,"about_ca_topic_score_gemma":0.00005214204,"teacher_disagreement_score":0.32566667,"about_ca_system_score_codex":0.00036731322,"about_ca_system_score_gemma":0.0011079086,"threshold_uncertainty_score":0.9999956},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092093856,0.00026137094,0.9924684,0.00015524564,0.00028077041,0.00043009935,0.0000047506933,0.00007999785,0.005398429],"genre_scores_gemma":[0.88867074,0.0000057595885,0.11001035,0.00025450563,0.00008949631,0.000018943367,0.000026799005,0.000019605923,0.0009038103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536276,0.00012976315,0.0008811726,0.0014793716,0.0014759658,0.00067098637],"domain_scores_gemma":[0.99763674,0.00035619058,0.0004716135,0.0011602573,0.0002143109,0.00016089423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016638058,0.00050877064,0.0011669708,0.0029041711,0.00024961136,0.00032116828,0.002296865,0.0002557507,0.000015890677],"category_scores_gemma":[0.00007112943,0.00042825428,0.00019922694,0.002372533,0.00054866186,0.0003370715,0.0007152463,0.0008133831,0.0000028138522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041682448,0.00028460225,0.016839756,0.00025812365,0.0005433552,0.00035446818,0.00559713,0.7991143,0.001271946,0.057280116,0.000059531412,0.118355006],"study_design_scores_gemma":[0.0022389272,0.0021950575,0.003746674,0.0028433977,0.00039742727,0.000035764027,0.000010272233,0.8659467,0.0034506964,0.11585958,0.000906358,0.0023691151],"about_ca_topic_score_codex":0.00084045867,"about_ca_topic_score_gemma":0.0028250557,"teacher_disagreement_score":0.8877498,"about_ca_system_score_codex":0.00042059826,"about_ca_system_score_gemma":0.00064370164,"threshold_uncertainty_score":0.99981695},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015077273,0.00051172957,0.9779186,0.00080144114,0.0010897238,0.00078547996,0.0000065760323,0.00023334003,0.018502291],"genre_scores_gemma":[0.16030963,0.000091052934,0.8137011,0.0050263754,0.0007143018,0.00016379429,0.000015861957,0.00007582555,0.019902054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620026,0.000036520887,0.00044924265,0.001609345,0.00087881734,0.00082578795],"domain_scores_gemma":[0.9972021,0.00027124974,0.0002354307,0.0017294595,0.0003824422,0.00017930233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007341769,0.0005260151,0.0004635518,0.0008228536,0.00033196027,0.0007905732,0.0033697437,0.00025764745,0.00003635058],"category_scores_gemma":[0.000096945165,0.0003960748,0.00008291051,0.0010147466,0.00037147856,0.0011885702,0.0011027959,0.00065871683,0.000046330675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026437412,0.00010518012,0.000011267526,0.00010124811,0.000011861874,0.00011523424,0.0040740226,0.014485475,0.000033092554,0.33897492,0.00007460669,0.64198667],"study_design_scores_gemma":[0.0001431676,0.00021349605,0.000011021982,0.00079384807,0.000011778356,0.00007909794,0.000008044095,0.8493162,0.0020288532,0.14379993,0.0028796666,0.0007149172],"about_ca_topic_score_codex":0.00008788573,"about_ca_topic_score_gemma":0.0006163591,"teacher_disagreement_score":0.8348307,"about_ca_system_score_codex":0.0004406617,"about_ca_system_score_gemma":0.003259305,"threshold_uncertainty_score":0.99984914},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018855832,0.0005352104,0.9880946,0.00043001724,0.0018596108,0.00065291644,0.0000029939874,0.00019037057,0.008045723],"genre_scores_gemma":[0.87437266,0.000021838512,0.12413402,0.00051079347,0.000367529,0.000032352174,0.000019818779,0.000019911562,0.00052109594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964866,0.00006181744,0.0006895532,0.0014579461,0.0007345337,0.0005695556],"domain_scores_gemma":[0.9978039,0.00046841745,0.0003358377,0.001113818,0.0001838726,0.000094140705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007626356,0.00042228,0.00049747084,0.0009033637,0.00025589703,0.00065206655,0.0021340514,0.0003467261,0.000011133942],"category_scores_gemma":[0.00014893299,0.00039811118,0.00010375536,0.0009908456,0.000246118,0.000755223,0.00091616245,0.0006745486,0.000034512563],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028780576,0.000045892903,0.0013555516,0.0000441863,0.000011381741,0.00004195182,0.00188215,0.012990981,0.00006524476,0.22197007,0.000020199815,0.7615695],"study_design_scores_gemma":[0.00034320288,0.00006475207,0.00059404963,0.00025364402,0.0000061047244,0.000007415743,7.8274365e-7,0.50210875,0.0005132716,0.49287644,0.0026768271,0.0005547597],"about_ca_topic_score_codex":0.00024044544,"about_ca_topic_score_gemma":0.0006048221,"teacher_disagreement_score":0.8741841,"about_ca_system_score_codex":0.0003492533,"about_ca_system_score_gemma":0.00055188965,"threshold_uncertainty_score":0.99984705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013912029,0.0012173839,0.9867207,0.0012262487,0.0013235807,0.00070980715,0.000005165379,0.00015552672,0.0072504226],"genre_scores_gemma":[0.9022758,0.00007451408,0.096171744,0.000650318,0.0001522177,0.000062867344,0.000010032891,0.000028536806,0.00057397655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951988,0.0002015538,0.0009121976,0.0023090974,0.0006636563,0.00071471446],"domain_scores_gemma":[0.99389106,0.0033923269,0.00027099097,0.0016193938,0.00062686467,0.0001993899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015435278,0.00058597216,0.0006209716,0.0019028742,0.00037134887,0.0004777072,0.002418226,0.00038632264,0.000026310669],"category_scores_gemma":[0.0010155044,0.0006115343,0.00012407308,0.0023786074,0.001310399,0.0009878884,0.0014742573,0.0011427708,0.000038586382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021877147,0.00019080844,0.0047636153,0.00018246216,0.000008543881,0.00013477913,0.0025987322,0.038300183,0.0001000991,0.6384239,0.000037231828,0.31523776],"study_design_scores_gemma":[0.00018907805,0.00011004024,0.0026123736,0.00044976868,0.0000048892034,0.000011902602,8.2720703e-7,0.6240407,0.0011753103,0.37054372,0.0003791277,0.0004822736],"about_ca_topic_score_codex":0.00009087261,"about_ca_topic_score_gemma":0.0010150212,"teacher_disagreement_score":0.90088457,"about_ca_system_score_codex":0.00046232328,"about_ca_system_score_gemma":0.00196591,"threshold_uncertainty_score":0.9996336},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9797609,0.0014391912,0.010110456,0.002912538,0.0020179688,0.0013626291,0.00007706947,0.000034775625,0.0022844994],"genre_scores_gemma":[0.9974278,0.0002161039,0.0009259889,0.0010986802,0.00018021003,0.000009290417,0.000002794807,0.000014398612,0.00012468627],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9981135,0.000027075517,0.00037710165,0.00044467382,0.00079341227,0.0002442467],"domain_scores_gemma":[0.9983915,0.0003839226,0.0001149897,0.0008511075,0.00020693643,0.000051530784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003388619,0.00028976155,0.00046892237,0.00038869967,0.00011888886,0.000023685245,0.00073072745,0.00018054243,0.0000050911417],"category_scores_gemma":[0.00012680487,0.00015648243,0.0001024258,0.00057555374,0.0017225564,0.00006263459,0.00035469432,0.0010194004,2.1324128e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004636645,0.00017468202,0.020040367,0.0021129958,0.00027478824,0.000082729886,0.011923948,0.114521205,0.010969953,0.014239766,0.00002908149,0.8251668],"study_design_scores_gemma":[0.009116582,0.005771121,0.3951952,0.23641695,0.0012652924,0.00034653337,0.0000941126,0.10337947,0.16425921,0.07911674,0.0015071227,0.0035316763],"about_ca_topic_score_codex":0.0000226653,"about_ca_topic_score_gemma":0.000029280742,"teacher_disagreement_score":0.8216351,"about_ca_system_score_codex":0.00010662545,"about_ca_system_score_gemma":0.00023308829,"threshold_uncertainty_score":0.63811684},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055641573,0.00018768116,0.99675333,0.00010710134,0.00044880912,0.00038812947,0.000027781742,0.0001614032,0.0018701128],"genre_scores_gemma":[0.08952631,0.000012284931,0.9075317,0.0003634435,0.00042781135,0.000025076608,0.00007785987,0.00004545091,0.0019900957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731886,0.000031145646,0.0005085544,0.0011579231,0.0004040948,0.0005794327],"domain_scores_gemma":[0.998226,0.00020252918,0.00022942299,0.0009459604,0.00028580165,0.000110269255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039407195,0.00053789,0.0006673773,0.00075340155,0.00026627793,0.00023007792,0.0012892325,0.00018289729,0.00015139078],"category_scores_gemma":[0.000011684701,0.0005214163,0.0002635656,0.0008333416,0.00042327933,0.00014505447,0.001140361,0.000791463,0.000015443498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009873115,0.00015782517,0.0050036525,0.00004894733,0.00013636508,0.00001442542,0.0003050484,0.086643174,0.0004516881,0.0011923804,0.00022942056,0.9058072],"study_design_scores_gemma":[0.00043783846,0.000032215958,0.00050329807,0.00045183065,0.000052602598,0.0000017964188,3.4866906e-7,0.9786623,0.00065982866,0.01544027,0.0030402176,0.00071746553],"about_ca_topic_score_codex":0.0001986975,"about_ca_topic_score_gemma":0.000550125,"teacher_disagreement_score":0.90508974,"about_ca_system_score_codex":0.000131666,"about_ca_system_score_gemma":0.00020872621,"threshold_uncertainty_score":0.99972373},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019803854,0.0019296455,0.9890841,0.00094673486,0.0006064366,0.00062860816,0.00012691194,0.0005629523,0.0059165745],"genre_scores_gemma":[0.041684847,0.00044867027,0.9538562,0.0026119566,0.0005564076,0.00015189439,0.00013399098,0.00011424037,0.00044176183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971877,0.000054448436,0.0004077245,0.0010801741,0.00077210227,0.00049789203],"domain_scores_gemma":[0.99719274,0.0017253153,0.000116191055,0.0006309447,0.00018858502,0.0001462104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007061801,0.0006563528,0.00058591494,0.0010898948,0.00023891068,0.0001446068,0.0005977554,0.00058154203,0.00010330632],"category_scores_gemma":[0.00028241923,0.0006381479,0.00013337622,0.00042726024,0.0003293817,0.00019459924,0.00028200512,0.0011317864,0.000016289856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024836449,0.00013148421,0.0018505357,0.00061450445,0.00007627409,0.0001865293,0.00025080823,0.47470647,0.001800227,0.010606546,0.010299618,0.49945217],"study_design_scores_gemma":[0.00030284148,0.000119246455,0.00080645946,0.0018142659,0.000030687126,0.000028608765,5.910761e-8,0.95971876,0.002216298,0.031759735,0.0025382517,0.0006647675],"about_ca_topic_score_codex":0.000027865517,"about_ca_topic_score_gemma":0.000030326166,"teacher_disagreement_score":0.4987874,"about_ca_system_score_codex":0.0006381231,"about_ca_system_score_gemma":0.00027284658,"threshold_uncertainty_score":0.99960697},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094438466,0.00019591184,0.9477028,0.0005343234,0.0009894955,0.00053491624,2.628757e-7,0.00022448428,0.048873417],"genre_scores_gemma":[0.70330906,0.00008192025,0.28696924,0.001064197,0.00038748854,0.00012285096,0.000014934515,0.000050428185,0.007999895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996789,0.00003046363,0.00040668462,0.0013534223,0.0007813966,0.0006390283],"domain_scores_gemma":[0.998595,0.00024214164,0.00023345226,0.0006754716,0.00014367644,0.00011026824],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00075348123,0.00042332168,0.00038043846,0.0011702626,0.00024273717,0.0012773045,0.0019454506,0.00012444252,0.0000039632005],"category_scores_gemma":[0.00009387764,0.00036058502,0.00006402122,0.001086695,0.00028534804,0.0017312673,0.0010210411,0.0008006234,0.000015652975],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042398187,0.000035705016,0.00029386062,0.000064195076,0.000005909031,0.00004434188,0.001376699,0.008251239,0.0000018164226,0.08996776,0.0000056887616,0.89994854],"study_design_scores_gemma":[0.0009927489,0.0008661935,0.00060352986,0.008410586,0.000029621495,0.000057955625,0.000016945449,0.5970397,0.0008260873,0.28113878,0.1070906,0.0029272505],"about_ca_topic_score_codex":0.000049213268,"about_ca_topic_score_gemma":0.00024240691,"teacher_disagreement_score":0.8970213,"about_ca_system_score_codex":0.00029369292,"about_ca_system_score_gemma":0.0008178683,"threshold_uncertainty_score":0.9998846},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013939201,0.0005659912,0.98309195,0.00002881557,0.000988525,0.00013835683,0.000005553793,0.00025404847,0.0009875845],"genre_scores_gemma":[0.81146604,0.000037178845,0.18730678,0.00017980933,0.00067081425,0.0000030348042,0.000018805402,0.000044078293,0.00027343817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823254,0.00000891123,0.00038773406,0.00056123285,0.0004203239,0.00038922785],"domain_scores_gemma":[0.9993748,0.000066848515,0.0000672467,0.00035789987,0.0000622511,0.000070937116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024967824,0.00036598204,0.00042064028,0.00064102747,0.00016180969,0.00027749655,0.0005039562,0.00022110145,0.00010069518],"category_scores_gemma":[0.000026188676,0.00036607173,0.00014457472,0.00034940988,0.0001351831,0.00018723488,0.00013589981,0.00044501526,0.000013522448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.788202e-7,0.0000037743584,0.000011666215,0.00006016322,0.000023869772,0.000014825908,0.00012851736,0.8544767,0.0013823967,0.00009717042,0.00001738835,0.14378306],"study_design_scores_gemma":[0.00011628437,0.000012758929,0.000004267168,0.0003563116,0.000045259527,0.000017591517,1.6179384e-7,0.9958329,0.0014953808,0.0017361185,0.000022945655,0.0003599995],"about_ca_topic_score_codex":0.000016843402,"about_ca_topic_score_gemma":0.0000668341,"teacher_disagreement_score":0.79752684,"about_ca_system_score_codex":0.00056502386,"about_ca_system_score_gemma":0.00017271569,"threshold_uncertainty_score":0.9998791},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000083756284,0.00014287865,0.9931577,0.0022572486,0.0008401491,0.0011937631,0.000012934962,0.0005242261,0.00178735],"genre_scores_gemma":[0.15843563,0.00007511105,0.8306162,0.003871918,0.00039831354,0.00029440582,0.00001667631,0.0000575043,0.006234274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967762,0.0000259963,0.0005421121,0.0016155817,0.0005047996,0.00053531403],"domain_scores_gemma":[0.99737036,0.00052212283,0.00025606144,0.0014227424,0.00029519803,0.00013353558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006007297,0.0004790101,0.00044477163,0.0010217407,0.0005597196,0.000433514,0.0024174626,0.00043371576,0.000015381942],"category_scores_gemma":[0.00008439117,0.00046680032,0.00023203349,0.00089800416,0.00030680583,0.0003956494,0.00091589516,0.0005225713,0.000014664249],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008917631,0.000027707914,0.0000054549596,0.00004435148,0.000006823911,0.0000038786616,0.00010404702,0.00050063495,0.0039771846,0.014140381,0.00007805011,0.9811026],"study_design_scores_gemma":[0.0004433665,0.00035525678,0.00014557476,0.00024970068,0.000014403779,0.00002990311,2.283679e-7,0.7277794,0.022615239,0.21270083,0.03489265,0.0007734758],"about_ca_topic_score_codex":0.000025783227,"about_ca_topic_score_gemma":0.0001054849,"teacher_disagreement_score":0.9803291,"about_ca_system_score_codex":0.00035125273,"about_ca_system_score_gemma":0.00034370285,"threshold_uncertainty_score":0.9997784},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035752245,0.00044129518,0.9926651,0.00026242223,0.0015618033,0.00034119753,0.000013575222,0.00018841117,0.004168657],"genre_scores_gemma":[0.7064903,0.00003382412,0.29231435,0.00069222675,0.00026095504,0.000005709554,0.000009920916,0.000022878206,0.00016984968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956928,0.000057451845,0.00087555166,0.0015537472,0.0010808147,0.0007396495],"domain_scores_gemma":[0.99726814,0.00041010897,0.00043535393,0.001510366,0.00028390466,0.0000921478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011089443,0.00047834637,0.00065259123,0.00054992625,0.00023570014,0.0002463029,0.0027116425,0.00038578926,0.000018474226],"category_scores_gemma":[0.00015409167,0.0004739368,0.00015794422,0.00078274304,0.00026013041,0.0010755239,0.00083684694,0.00071301736,0.0000051985244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012347615,0.00008473236,0.000046404315,0.0005107126,0.00003591517,0.00010762256,0.03072613,0.36657515,0.0054167765,0.34833032,0.000022586859,0.2481313],"study_design_scores_gemma":[0.00023011828,0.000054647462,0.0000033240124,0.0012495519,0.000009229439,0.000010762928,0.0000036229058,0.9131574,0.024783343,0.06002501,0.000043163516,0.00042980834],"about_ca_topic_score_codex":0.00005924764,"about_ca_topic_score_gemma":0.0001289096,"teacher_disagreement_score":0.70613277,"about_ca_system_score_codex":0.00019385648,"about_ca_system_score_gemma":0.0007667744,"threshold_uncertainty_score":0.99977124},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018504445,0.00014112573,0.9861889,0.0038959484,0.0035429453,0.0013923376,0.0002783561,0.000073523894,0.0026364357],"genre_scores_gemma":[0.99045014,0.000093247436,0.0028503868,0.0045520496,0.00024175819,0.00004125329,0.000015611055,0.000043401284,0.0017121439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964784,0.000070844784,0.00061542296,0.001433871,0.00081106415,0.0005904328],"domain_scores_gemma":[0.99546236,0.0027510321,0.0003400603,0.0009315077,0.00041303673,0.000101986705],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006925519,0.0005094272,0.0006351978,0.00042884366,0.0006189192,0.00021218201,0.0017104835,0.00025865668,0.000059103193],"category_scores_gemma":[0.0005202002,0.0003693333,0.00017016928,0.0007243712,0.0027494344,0.00014182822,0.0005046877,0.0006569081,0.0000034807815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003851972,0.00017987144,0.00011327262,0.000557919,0.000038284095,0.0000432546,0.0027637028,0.09467906,0.054515336,0.100753196,0.00018063032,0.7457903],"study_design_scores_gemma":[0.0006929681,0.00037475125,0.000096430624,0.0004523936,0.000070625065,0.000058232934,0.000006638731,0.91639024,0.0142362295,0.06404314,0.0027618643,0.0008164685],"about_ca_topic_score_codex":0.00021783347,"about_ca_topic_score_gemma":0.0031613712,"teacher_disagreement_score":0.9885997,"about_ca_system_score_codex":0.00024558438,"about_ca_system_score_gemma":0.0006624321,"threshold_uncertainty_score":0.99996454},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009153386,0.00042163735,0.98815244,0.0021459938,0.0035802955,0.0006510253,0.0000067918822,0.00026011342,0.0046901572],"genre_scores_gemma":[0.22763543,0.00007622794,0.76842904,0.0025571832,0.0006772927,0.00001707375,0.0000066922635,0.000051309118,0.000549728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99351627,0.00012709311,0.0010161307,0.0029052822,0.0013184062,0.0011168417],"domain_scores_gemma":[0.9955638,0.0013299114,0.00030444516,0.0022495952,0.00033820825,0.00021401016],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015649336,0.00081584684,0.00088229816,0.0018507476,0.00025564522,0.0006786518,0.006563749,0.0005325205,0.000031386848],"category_scores_gemma":[0.00019490116,0.0008373039,0.0002142713,0.0024069145,0.001269023,0.000798985,0.0034671323,0.0015985568,0.00006085523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006529678,0.000056691457,0.000028989813,0.00002873081,0.0000057901275,0.00012917277,0.00030786547,0.21354392,0.000019103976,0.26187706,0.000005901585,0.5239902],"study_design_scores_gemma":[0.00006956699,0.000085389445,0.00011212746,0.00025601435,0.000003829673,0.00001820923,5.866876e-7,0.5129341,0.00042078726,0.48541284,0.00018229829,0.00050425716],"about_ca_topic_score_codex":0.00019110096,"about_ca_topic_score_gemma":0.00069122814,"teacher_disagreement_score":0.52348596,"about_ca_system_score_codex":0.0012367886,"about_ca_system_score_gemma":0.0017139364,"threshold_uncertainty_score":0.99940777},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019729908,0.000050966544,0.992395,0.0021604586,0.001317509,0.0006409738,0.000016193408,0.00009218202,0.0013537196],"genre_scores_gemma":[0.6581281,0.000012012258,0.33661577,0.004497362,0.00036306563,0.00004052186,0.000028253184,0.000030091087,0.00028484056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995687,0.00013319551,0.00071630976,0.00141549,0.0015146983,0.000533294],"domain_scores_gemma":[0.996352,0.0006019586,0.0002853504,0.0013381689,0.0011985566,0.00022397416],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018561247,0.00039815964,0.00051429734,0.0013908084,0.00027340697,0.0004299666,0.0030717955,0.0002534962,0.000059034963],"category_scores_gemma":[0.000568376,0.00040608668,0.00011223312,0.0010377789,0.00033172403,0.0009897659,0.00074030075,0.0005744759,0.00004856637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021514443,0.00012386813,0.0013352504,0.00007549613,0.000028335311,0.00004697687,0.012667557,0.05464603,0.001510585,0.04876282,0.00014659224,0.88063496],"study_design_scores_gemma":[0.000086214626,0.00022606022,0.0011228059,0.0004754078,0.00001831246,0.000010926223,0.0000031160944,0.94142884,0.004329453,0.05116665,0.0006475451,0.0004846683],"about_ca_topic_score_codex":0.00007195498,"about_ca_topic_score_gemma":0.00025211487,"teacher_disagreement_score":0.8867828,"about_ca_system_score_codex":0.0005917292,"about_ca_system_score_gemma":0.0013796091,"threshold_uncertainty_score":0.9998391},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053253174,0.0003880202,0.9886817,0.0019439392,0.00044779922,0.00038293155,0.00002522197,0.0001480477,0.002657033],"genre_scores_gemma":[0.8427416,0.000078931975,0.15423138,0.0012722416,0.0005844,0.00001331491,0.000016408398,0.000033456094,0.0010282343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969137,0.000088619876,0.00037814523,0.00144912,0.00060980953,0.0005606356],"domain_scores_gemma":[0.9978146,0.0011104274,0.00031897632,0.00040172326,0.00020429512,0.00014998557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008763075,0.00044095554,0.0004902923,0.00038165363,0.00076097524,0.0006764285,0.0008466663,0.00023414676,0.0000033200051],"category_scores_gemma":[0.000299126,0.00042389374,0.000067821034,0.0003050159,0.0010920335,0.0004086733,0.001357477,0.0017066116,0.0000019431975],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000776472,0.000014099518,0.00010326626,0.000057638987,0.000028031314,0.0000374246,0.0033889376,0.0027599197,0.00012138095,0.02504314,0.0000042300494,0.96843415],"study_design_scores_gemma":[0.00089854095,0.00047201084,0.00087402656,0.0014097423,0.000026136786,0.00014753145,0.000020295794,0.8434793,0.0010171173,0.14808598,0.0025791402,0.0009901711],"about_ca_topic_score_codex":0.000013178026,"about_ca_topic_score_gemma":0.000013359648,"teacher_disagreement_score":0.967444,"about_ca_system_score_codex":0.00015913408,"about_ca_system_score_gemma":0.00033778438,"threshold_uncertainty_score":0.9998213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055668755,0.000050207695,0.9923219,0.000048991405,0.0005224382,0.000640401,0.00011661573,0.0001943374,0.000538217],"genre_scores_gemma":[0.95691806,0.000005256282,0.042693418,0.000053646363,0.000068169116,0.00005862987,0.00014165217,0.00002807693,0.00003308242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860567,0.0000027362507,0.00041506102,0.00046579688,0.00023337013,0.00027736736],"domain_scores_gemma":[0.99932075,0.00019293888,0.00006526208,0.00026450507,0.00011685325,0.000039724255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020785806,0.00026687342,0.00028968335,0.00058243796,0.000095986754,0.00007130524,0.00027952818,0.00016279043,0.0000059062],"category_scores_gemma":[0.000009938285,0.00026321443,0.000051919327,0.00041825417,0.000092378876,0.00018516293,0.0000070536353,0.00032720412,0.0000013359601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010490262,0.0000072214634,0.0011501884,0.00067543436,0.000012839505,0.000011392021,0.0011714365,0.9718634,0.00008123411,0.002781598,0.0000054167526,0.022229364],"study_design_scores_gemma":[0.0011358047,0.00007639546,0.011110909,0.0037655297,0.000034378685,0.0000056014123,0.0000068802487,0.97853446,0.002091146,0.001296874,0.0012149772,0.0007270176],"about_ca_topic_score_codex":0.000037596452,"about_ca_topic_score_gemma":0.007090975,"teacher_disagreement_score":0.95135117,"about_ca_system_score_codex":0.00028322675,"about_ca_system_score_gemma":0.00012107489,"threshold_uncertainty_score":0.999982},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020695027,0.0011145099,0.9941497,0.00044473738,0.0018285743,0.00085420907,0.000113492686,0.00013422352,0.0011536115],"genre_scores_gemma":[0.037619907,0.000067286266,0.9613218,0.00041902138,0.0003231545,0.000025418587,0.000031599273,0.000028739563,0.0001631212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951373,0.00008394906,0.0008599666,0.0018992678,0.0011930686,0.0008264734],"domain_scores_gemma":[0.9950929,0.001597392,0.00064104085,0.0019079739,0.0005540653,0.00020660151],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017655446,0.00067673466,0.0009414307,0.0009969572,0.00042315832,0.00048132677,0.0047839475,0.00030965294,0.000008148858],"category_scores_gemma":[0.00015338266,0.0005993244,0.00021574103,0.0009838421,0.0011383137,0.0005850514,0.0024192177,0.0006664081,0.0000053913063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010262848,0.000060686463,0.00004840515,0.000095891235,0.00001574863,0.00006082865,0.00028805787,0.025741816,0.00040436888,0.028571147,0.000028287888,0.9446745],"study_design_scores_gemma":[0.00042614705,0.00021262805,0.000057402,0.0015045785,0.000018015582,0.00008827072,4.1725465e-7,0.9328724,0.0049236575,0.05863158,0.00064656197,0.00061833573],"about_ca_topic_score_codex":0.00045846132,"about_ca_topic_score_gemma":0.00010312321,"teacher_disagreement_score":0.94405615,"about_ca_system_score_codex":0.00035662306,"about_ca_system_score_gemma":0.0012035782,"threshold_uncertainty_score":0.9996458},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009941389,0.00015281787,0.98636764,0.0006427744,0.0027979051,0.00041797754,0.000047276146,0.0001800499,0.009294143],"genre_scores_gemma":[0.8928619,0.0000317977,0.1042306,0.0007679204,0.00064925285,0.0000050903172,0.000022605609,0.00003351313,0.0013973183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99498636,0.00015054924,0.0007037455,0.0017720343,0.0015074038,0.00087992585],"domain_scores_gemma":[0.9954465,0.001683373,0.00031090228,0.0019266923,0.0004464943,0.00018602808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027394174,0.0006242708,0.0008830118,0.0010324826,0.00033942255,0.00041009966,0.0029919876,0.00039872434,0.000008147612],"category_scores_gemma":[0.000120053715,0.0005797481,0.00024069715,0.0010506893,0.00061813236,0.00027142328,0.001867398,0.0010524661,0.000043551714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013292567,0.000100655496,0.00012014366,0.00023657746,0.000038573424,0.00031910228,0.00079843967,0.43175632,0.0000609554,0.047590956,0.0002123919,0.5187526],"study_design_scores_gemma":[0.0003311341,0.00027706265,0.000292646,0.0017830688,0.000006771641,0.00009147611,1.4484333e-7,0.9808693,0.001414046,0.012069309,0.0021916886,0.00067337364],"about_ca_topic_score_codex":0.00017080059,"about_ca_topic_score_gemma":0.00007318181,"teacher_disagreement_score":0.8927625,"about_ca_system_score_codex":0.00032445253,"about_ca_system_score_gemma":0.0008416236,"threshold_uncertainty_score":0.9996654},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047561806,0.00051834097,0.9963493,0.00077308953,0.00025388628,0.0006925359,0.000012620365,0.00022464558,0.00069998746],"genre_scores_gemma":[0.6865821,0.00017962353,0.308683,0.0027567488,0.00019305115,0.00007647307,0.0000398873,0.00010607981,0.0013830728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99448377,0.00006719961,0.00051742507,0.0020165206,0.0018354733,0.0010796387],"domain_scores_gemma":[0.99649566,0.00073834293,0.00019706386,0.0016995021,0.00060117076,0.0002682454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095359306,0.00060760067,0.0005847827,0.0010288198,0.00040539104,0.0006760963,0.0040288297,0.00027177477,0.000018322307],"category_scores_gemma":[0.00008635197,0.0005176487,0.00009727831,0.0017956953,0.0016675584,0.0010008296,0.0019748663,0.0011098591,0.000021329932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009567442,0.00006712997,0.000220707,0.0001683013,0.000050009057,0.00019203282,0.0010746887,0.41523713,0.0007794197,0.025370631,0.000063462496,0.5566808],"study_design_scores_gemma":[0.00043905922,0.000246263,0.000057224304,0.00047427003,0.00000955284,0.000037325968,9.2035924e-7,0.96422255,0.0023466698,0.030930402,0.0006178312,0.00061791786],"about_ca_topic_score_codex":0.00006325838,"about_ca_topic_score_gemma":0.00009131443,"teacher_disagreement_score":0.6876663,"about_ca_system_score_codex":0.0004868582,"about_ca_system_score_gemma":0.0010277831,"threshold_uncertainty_score":0.9997275},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019357924,0.00040753503,0.99459034,0.00022231157,0.0008724604,0.00043295344,0.000004022634,0.00012948742,0.0014050662],"genre_scores_gemma":[0.98265254,0.000002999657,0.015331265,0.00032308206,0.00046493523,0.0000073110823,0.0000018558462,0.00001997185,0.0011960284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696773,0.000090437374,0.000460308,0.0011940409,0.0007473379,0.00054015644],"domain_scores_gemma":[0.9937955,0.0049810037,0.0002800343,0.00054995215,0.00029776047,0.00009572465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013466071,0.000458478,0.00048984354,0.00050695287,0.0006391649,0.00071537285,0.0014005249,0.00020944346,0.0000064704236],"category_scores_gemma":[0.0005092038,0.00035476632,0.00012133383,0.00043914455,0.00040481173,0.0003250266,0.0007231809,0.0010061845,0.0000106531015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009134095,0.00000678562,0.00076180574,0.00011298815,0.000043514257,0.000048769303,0.004536338,0.37495616,0.000044161585,0.007858248,8.012914e-7,0.61162126],"study_design_scores_gemma":[0.00030104053,0.000106842526,0.0009533429,0.003498972,0.000024078628,0.000008720896,0.0000032772723,0.9891895,0.00089526444,0.0037728916,0.0006943232,0.00055175705],"about_ca_topic_score_codex":0.000026992264,"about_ca_topic_score_gemma":0.000020561893,"teacher_disagreement_score":0.98071676,"about_ca_system_score_codex":0.00027788876,"about_ca_system_score_gemma":0.0006647184,"threshold_uncertainty_score":0.99989045},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032491098,0.0007787494,0.9853485,0.0008185628,0.0053337137,0.0005203594,0.00000317187,0.0002335581,0.006930871],"genre_scores_gemma":[0.6050819,0.000082170336,0.34061304,0.003204074,0.003241816,0.00005173492,0.000007361422,0.00010084355,0.047617067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952123,0.000090512694,0.00075813965,0.00217796,0.0006501995,0.0011108655],"domain_scores_gemma":[0.99705726,0.00046117842,0.00031765708,0.0014320349,0.00042679923,0.0003050547],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012471484,0.00074014463,0.0007403848,0.0010301296,0.00054927083,0.0011011572,0.0036805973,0.0003623082,0.000012768735],"category_scores_gemma":[0.000114992,0.0007014335,0.00017964955,0.0011834198,0.00018815306,0.00041349634,0.0015768221,0.0012737806,0.000053462692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003326768,0.000013600176,0.000014601488,0.000045081902,0.0000149456955,0.00006893818,0.0013413923,0.41800404,0.00014361348,0.052488383,0.00006737658,0.5277947],"study_design_scores_gemma":[0.000088776724,0.0001605092,0.000033044493,0.0022525103,0.000008841425,0.000030453713,5.0295836e-7,0.9688616,0.0041099675,0.00773249,0.015644185,0.0010771304],"about_ca_topic_score_codex":0.00008527066,"about_ca_topic_score_gemma":0.0003309733,"teacher_disagreement_score":0.6447355,"about_ca_system_score_codex":0.00058044237,"about_ca_system_score_gemma":0.0008001858,"threshold_uncertainty_score":0.9999358},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024324292,0.00026297735,0.9870077,0.005990626,0.004524572,0.0003082005,0.00000995467,0.00037416792,0.0014975079],"genre_scores_gemma":[0.36444947,0.0000026794753,0.62608737,0.007591597,0.00039406528,0.00000875016,0.000011626708,0.00003258451,0.0014218377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514085,0.00012499653,0.0005921584,0.0019937067,0.0012488168,0.0008994512],"domain_scores_gemma":[0.9953007,0.0021633133,0.00021833855,0.001454239,0.0006459895,0.00021740283],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011876726,0.00057798857,0.00053163664,0.0015736955,0.0010214421,0.0045276387,0.00397109,0.00031778737,0.000023184619],"category_scores_gemma":[0.00079241657,0.00055432663,0.00019588816,0.0010213495,0.0008013704,0.0015623809,0.0027272438,0.0023673694,0.00002317323],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047118124,0.00004432,0.00010485763,0.000053025826,0.000015416848,0.000105046594,0.008087314,0.01780798,0.000013618445,0.034587197,0.00008096602,0.93909556],"study_design_scores_gemma":[0.0002863945,0.00018504263,0.00010035009,0.0023127573,0.000025267522,0.000101697566,7.904084e-7,0.8190765,0.00009596071,0.1322062,0.04462823,0.0009808049],"about_ca_topic_score_codex":0.00005460252,"about_ca_topic_score_gemma":0.000115638875,"teacher_disagreement_score":0.93811476,"about_ca_system_score_codex":0.00047065562,"about_ca_system_score_gemma":0.0008507863,"threshold_uncertainty_score":0.9999342},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99024355,0.0023001581,0.0031047186,0.00023778024,0.0010233691,0.001830048,0.0004217359,0.000020533636,0.00081811287],"genre_scores_gemma":[0.99892664,0.00007634156,0.0008244542,0.000063726664,0.000043417036,0.000016424752,0.000029928078,0.000014622513,0.0000044724306],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9971414,0.00011138741,0.0008915702,0.0008677164,0.00062235893,0.00036553977],"domain_scores_gemma":[0.9981946,0.00014327865,0.00038893474,0.00065500423,0.00051611644,0.00010210127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064340973,0.00031447835,0.00096619275,0.0034914399,0.000035443813,0.00000943904,0.00050054776,0.00037764476,0.000002058961],"category_scores_gemma":[0.00024778445,0.000330563,0.000067105866,0.0020916767,0.00076590944,0.000094153074,0.00024977932,0.0008514696,8.9326285e-8],"study_design_candidate":"observational","study_design_consensus":null,"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.0010800643,0.0002998677,0.2560878,0.0012729262,0.00008926529,0.00019293613,0.5091193,0.030730836,0.0011509564,0.00045792368,0.000012414534,0.19950572],"study_design_scores_gemma":[0.05915042,0.026941868,0.5544735,0.07530618,0.00080934714,0.00004561629,0.22389078,0.010254358,0.03128165,0.009417402,0.0016087506,0.006820082],"about_ca_topic_score_codex":0.24402523,"about_ca_topic_score_gemma":0.8358888,"teacher_disagreement_score":0.5918636,"about_ca_system_score_codex":0.002155881,"about_ca_system_score_gemma":0.006133989,"threshold_uncertainty_score":0.99991465},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018238887,0.003904068,0.9752673,0.0021927813,0.00067730236,0.0006100682,0.0000030270128,0.00012600422,0.017201208],"genre_scores_gemma":[0.10926171,0.0015538022,0.8638591,0.001878592,0.0005952192,0.00009822584,0.0000037382592,0.000092877795,0.022656731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962525,0.00009836432,0.00041709706,0.0015084809,0.00093939435,0.0007841879],"domain_scores_gemma":[0.99560827,0.002407813,0.00019423792,0.0013119482,0.00031722593,0.00016050006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017025237,0.00044799858,0.00037481732,0.0006545967,0.00088092306,0.00075340155,0.00424756,0.00018747193,0.000004080338],"category_scores_gemma":[0.000261596,0.00031707773,0.00008710147,0.0009238247,0.001501188,0.0007249269,0.0033768192,0.0012323299,0.000021101097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000548144,0.000005435564,0.000008693501,0.000019748499,0.000008192972,0.000020167796,0.00031193698,0.002217982,0.00005907335,0.6008156,0.000011660131,0.39651603],"study_design_scores_gemma":[0.00019128982,0.000088497225,0.000025955122,0.0002908169,0.000003114379,0.000029160818,1.8187657e-7,0.19119735,0.00039772413,0.80485356,0.002598573,0.0003238069],"about_ca_topic_score_codex":0.0000035905673,"about_ca_topic_score_gemma":0.000034123193,"teacher_disagreement_score":0.39619222,"about_ca_system_score_codex":0.0001638891,"about_ca_system_score_gemma":0.0005549814,"threshold_uncertainty_score":0.9999281},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.060263e-7,0.0002196202,0.9879211,0.0026950624,0.0020601065,0.0015336728,0.0000561323,0.00019276,0.0053208205],"genre_scores_gemma":[0.00025296712,0.000090564296,0.9828613,0.0054823165,0.00048390334,0.000117243646,0.000067116416,0.00004551422,0.0105990805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602973,0.000034886067,0.0005182426,0.001682724,0.0009441842,0.0007902174],"domain_scores_gemma":[0.996398,0.0010852616,0.0002620489,0.0019333947,0.00020831915,0.00011302901],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009510816,0.00062842725,0.00050922815,0.0009136095,0.000515374,0.0012020635,0.005678416,0.00020925548,0.000029441067],"category_scores_gemma":[0.000034229226,0.0004316548,0.00023324697,0.000856438,0.00047889983,0.0006291934,0.0016260259,0.00063333847,0.00009624704],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004029913,0.000045252487,0.0000013421991,0.00003308846,0.000037022488,0.000023229533,0.00011297988,0.00042531863,0.0000034823627,0.038538925,0.0013472744,0.9594281],"study_design_scores_gemma":[0.0004505555,0.0002126402,0.000007068123,0.00035274195,0.000022309847,0.000009206128,7.6255574e-8,0.82090604,0.00012708239,0.15055959,0.026874878,0.0004778102],"about_ca_topic_score_codex":0.0000121743215,"about_ca_topic_score_gemma":0.000016836437,"teacher_disagreement_score":0.9589502,"about_ca_system_score_codex":0.00017666348,"about_ca_system_score_gemma":0.00030010048,"threshold_uncertainty_score":0.9998348},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066404534,0.00085285836,0.99219716,0.002093626,0.00067683065,0.00050115096,0.000008655579,0.00022937816,0.0027763247],"genre_scores_gemma":[0.31956333,0.00083683716,0.66715854,0.0044807163,0.0010335553,0.00010573624,0.00003139554,0.00006511025,0.0067247543],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938943,0.00026622065,0.00069003005,0.0028293203,0.0014487609,0.0008713686],"domain_scores_gemma":[0.99330264,0.0027502787,0.0001639384,0.0029424487,0.00056214223,0.0002785695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0042325146,0.00050939666,0.00079999206,0.0009880505,0.00037040675,0.00092262356,0.00445597,0.00047753507,0.000022315144],"category_scores_gemma":[0.0018935973,0.0004549193,0.00019682242,0.002594682,0.0019730553,0.0006996609,0.004867577,0.0015317758,0.000025859033],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011547246,0.00021390554,0.0039021668,0.0007300007,0.000026320395,0.00005696649,0.0011983946,0.006978881,0.00001627765,0.005049618,0.0006841282,0.9811318],"study_design_scores_gemma":[0.00019586117,0.00010003827,0.00065153406,0.00028138535,0.000009807114,0.000013956282,1.3826872e-7,0.46298596,0.00025388622,0.5315296,0.0034653684,0.0005124505],"about_ca_topic_score_codex":0.00009975188,"about_ca_topic_score_gemma":0.00012467652,"teacher_disagreement_score":0.9806194,"about_ca_system_score_codex":0.00083312334,"about_ca_system_score_gemma":0.0031743585,"threshold_uncertainty_score":0.99979025},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000093351504,0.00019667222,0.9939965,0.00078977586,0.0010243565,0.0007601571,0.000004175983,0.0002808216,0.0028541982],"genre_scores_gemma":[0.2555812,0.000031719042,0.742379,0.0014762593,0.00019924948,0.0000275281,0.0000010558625,0.000022465838,0.00028154076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968249,0.000092642666,0.0005763112,0.0012877346,0.0007379547,0.0004804203],"domain_scores_gemma":[0.9947613,0.0024259228,0.00049691804,0.0017599268,0.0004928523,0.00006310486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014320895,0.00042969623,0.00052536145,0.00043408142,0.00033874443,0.00020513714,0.0031833125,0.00024337893,0.000011752207],"category_scores_gemma":[0.0005546347,0.00032812328,0.00013506482,0.0016036007,0.00077907223,0.00027757278,0.0012585847,0.0009543656,0.0000045319675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011226851,0.000023259732,0.000009410237,0.000030029694,0.000009571391,0.000009239071,0.00031265203,0.3937249,0.00005535953,0.100112826,0.000082119914,0.5056194],"study_design_scores_gemma":[0.00020002814,0.0005456368,0.000097080745,0.0014474407,0.000009897901,0.000011937506,4.8752315e-7,0.39458972,0.009195358,0.5923524,0.0008233268,0.0007267092],"about_ca_topic_score_codex":0.000004246625,"about_ca_topic_score_gemma":0.00004489547,"teacher_disagreement_score":0.5048927,"about_ca_system_score_codex":0.00033333027,"about_ca_system_score_gemma":0.00065038184,"threshold_uncertainty_score":0.9999171},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058895028,0.0010505809,0.9670203,0.0056259823,0.0017847128,0.0004992051,0.00006931161,0.0011908155,0.022700196],"genre_scores_gemma":[0.12607639,0.00024909258,0.8683984,0.004019754,0.00026272278,0.000028080845,0.00004598155,0.0000542649,0.00086528854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99355,0.000068028334,0.00076251966,0.002776874,0.0014440903,0.0013984616],"domain_scores_gemma":[0.9830109,0.0011685642,0.0003907047,0.0149315875,0.00029960636,0.00019862303],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001574946,0.00088016805,0.0008350484,0.0015669481,0.00037000835,0.0009246228,0.063246824,0.0008444543,0.000033824876],"category_scores_gemma":[0.0063248174,0.0008465203,0.00019228128,0.0014776598,0.00087700394,0.0016870046,0.12505876,0.002103069,0.00007046417],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008553361,0.00008500396,0.0000748178,0.00019599889,0.000046461744,0.00046845086,0.0011220268,0.014430112,0.00013522345,0.11222389,0.005981812,0.86522764],"study_design_scores_gemma":[0.00017804354,0.000036696536,0.0000064418673,0.00049815304,0.000005391435,0.000009668743,4.892224e-7,0.5521061,0.00089966937,0.44479206,0.0009131292,0.00055417436],"about_ca_topic_score_codex":0.00003390416,"about_ca_topic_score_gemma":0.00011987781,"teacher_disagreement_score":0.8646735,"about_ca_system_score_codex":0.00058351713,"about_ca_system_score_gemma":0.0010535999,"threshold_uncertainty_score":0.9993985},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009779497,0.00019477055,0.99639136,0.0001526858,0.0007630358,0.0003946335,0.000005660117,0.000083019186,0.0010368981],"genre_scores_gemma":[0.8872845,0.0000176193,0.11171226,0.00014708446,0.00020651618,0.000035421494,0.0000072057182,0.000019383171,0.0005700008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673766,0.00012943489,0.00066842313,0.0012566225,0.00068021694,0.00052764354],"domain_scores_gemma":[0.9948974,0.0032812979,0.0004042369,0.0008999818,0.00045769135,0.000059382433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036297645,0.00044801863,0.0009436669,0.0011844219,0.00033624328,0.0004439737,0.0032142699,0.00015965619,0.000009595766],"category_scores_gemma":[0.00030578094,0.00033614473,0.00062990526,0.0017037027,0.0004270088,0.0005300056,0.0012723828,0.00050091004,0.00000618475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030422934,0.000023446408,0.00018762427,0.00024138606,0.00051692926,0.000011494653,0.0011266201,0.676434,0.00016312048,0.18088295,0.000006434929,0.14037558],"study_design_scores_gemma":[0.00012858423,0.00008561476,0.00033748316,0.00071012863,0.00018194929,0.000004790274,5.230915e-7,0.991456,0.0021814066,0.004309065,0.00022994082,0.0003745318],"about_ca_topic_score_codex":0.000017396285,"about_ca_topic_score_gemma":0.00008063647,"teacher_disagreement_score":0.8863066,"about_ca_system_score_codex":0.00015706723,"about_ca_system_score_gemma":0.00026517664,"threshold_uncertainty_score":0.99990904},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000107386084,0.00025556982,0.9897951,0.000018310178,0.0032310258,0.00045130122,0.000022276543,0.00027434347,0.0058447113],"genre_scores_gemma":[0.35325533,0.00004570282,0.64176035,0.000046760284,0.0036558795,0.000048184913,0.00004738172,0.0001700056,0.00097040186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982101,0.0000036408508,0.00033809678,0.00061722106,0.0003845702,0.0004464174],"domain_scores_gemma":[0.99899155,0.0002773941,0.000068677626,0.00043633432,0.00013686813,0.00008917205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012556081,0.0004094426,0.00035030744,0.00056268007,0.00018299832,0.00040445174,0.0007677779,0.00024404957,0.000004990105],"category_scores_gemma":[0.000059476937,0.00044754933,0.000111290305,0.00026531034,0.00016337502,0.00042350125,0.00025703065,0.00041024847,0.000004627601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019623888,0.0000046743007,0.00023368467,0.00011740076,0.000017384558,0.000010040793,0.00008189489,0.86432415,0.0025572646,0.00033428852,0.000012082932,0.13230516],"study_design_scores_gemma":[0.0014637082,0.00039639755,0.000118186574,0.0054065525,0.00008498725,0.000028084474,0.0000014261634,0.8177483,0.11468363,0.0527736,0.0038735128,0.0034216358],"about_ca_topic_score_codex":0.000002439791,"about_ca_topic_score_gemma":0.0000027745064,"teacher_disagreement_score":0.35314795,"about_ca_system_score_codex":0.00049672474,"about_ca_system_score_gemma":0.00008896203,"threshold_uncertainty_score":0.99979764},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066404534,0.00085285836,0.99219716,0.002093626,0.00067683065,0.00050115096,0.000008655579,0.00022937816,0.0027763247],"genre_scores_gemma":[0.31956333,0.00083683716,0.66715854,0.0044807163,0.0010335553,0.00010573624,0.00003139554,0.00006511025,0.0067247543],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938943,0.00026622065,0.00069003005,0.0028293203,0.0014487609,0.0008713686],"domain_scores_gemma":[0.99330264,0.0027502787,0.0001639384,0.0029424487,0.00056214223,0.0002785695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0042325146,0.00050939666,0.00079999206,0.0009880505,0.00037040675,0.00092262356,0.00445597,0.00047753507,0.000022315144],"category_scores_gemma":[0.0018935973,0.0004549193,0.00019682242,0.002594682,0.0019730553,0.0006996609,0.004867577,0.0015317758,0.000025859033],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011547246,0.00021390554,0.0039021668,0.0007300007,0.000026320395,0.00005696649,0.0011983946,0.006978881,0.00001627765,0.005049618,0.0006841282,0.9811318],"study_design_scores_gemma":[0.00019586117,0.00010003827,0.00065153406,0.00028138535,0.000009807114,0.000013956282,1.3826872e-7,0.46298596,0.00025388622,0.5315296,0.0034653684,0.0005124505],"about_ca_topic_score_codex":0.00009975188,"about_ca_topic_score_gemma":0.00012467652,"teacher_disagreement_score":0.9806194,"about_ca_system_score_codex":0.00083312334,"about_ca_system_score_gemma":0.0031743585,"threshold_uncertainty_score":0.99979025},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000081040416,0.000762715,0.9804759,0.0036197065,0.00083742396,0.000450643,0.000012938649,0.00074856397,0.013011084],"genre_scores_gemma":[0.13759936,0.00017613573,0.85667145,0.001864533,0.000285918,0.000044423963,0.0000117766585,0.000034866054,0.003311516],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963553,0.000016382231,0.0004871768,0.0017280765,0.00075227226,0.00066078664],"domain_scores_gemma":[0.99640536,0.00025692474,0.00023979956,0.0027168733,0.00027560804,0.00010545629],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00056413107,0.0005366884,0.00053315755,0.0011043354,0.000433601,0.0006864951,0.0065511083,0.00048207756,0.00001471318],"category_scores_gemma":[0.000095761796,0.0004650383,0.0001491493,0.0011732582,0.0010324535,0.00047251588,0.00298989,0.00093919627,0.000050725343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.7740415e-7,0.000015128511,0.000065894994,0.00001885983,0.000008554434,0.000017534518,0.00023163103,0.0009221345,0.000020213814,0.28022745,0.0001413417,0.7183304],"study_design_scores_gemma":[0.0001697901,0.0001422479,0.00027865425,0.00034907917,0.000011467884,0.000039309456,4.805482e-7,0.22591566,0.0013694136,0.758013,0.013048895,0.0006619823],"about_ca_topic_score_codex":0.00005666074,"about_ca_topic_score_gemma":0.00021714077,"teacher_disagreement_score":0.71766835,"about_ca_system_score_codex":0.00030742446,"about_ca_system_score_gemma":0.00070786494,"threshold_uncertainty_score":0.9997801},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011008582,0.00006912941,0.996371,0.00017008132,0.00066618493,0.00085629936,0.0000138432315,0.00042580106,0.0014166649],"genre_scores_gemma":[0.12021957,0.00003468829,0.87908727,0.0000888788,0.00026121948,0.00010664593,0.00003222211,0.000017453223,0.00015202632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973327,0.000030920335,0.0006260967,0.0011424866,0.00047684065,0.00039094008],"domain_scores_gemma":[0.9981716,0.00019380116,0.00033276813,0.0007376688,0.00048306372,0.00008109787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084509223,0.00035135524,0.00040887386,0.0005133235,0.00042030838,0.0002611264,0.0016423458,0.00038779268,0.0000044610006],"category_scores_gemma":[0.000095586234,0.0003529215,0.00020459817,0.00080729456,0.00027274442,0.00028656013,0.00054220547,0.0006379835,0.000003253932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060854677,0.000040690218,0.0000013014342,0.00006682115,0.000009026743,5.5162e-7,0.00020265572,0.046281062,0.00025591216,0.049329933,0.0000057039897,0.90380025],"study_design_scores_gemma":[0.00004309133,0.00020302781,0.0000039168835,0.0000703466,0.000013826428,0.00000490998,7.129112e-7,0.88237834,0.028000712,0.08797757,0.0009996637,0.00030387423],"about_ca_topic_score_codex":0.000016239776,"about_ca_topic_score_gemma":0.000013258946,"teacher_disagreement_score":0.9034964,"about_ca_system_score_codex":0.00033530843,"about_ca_system_score_gemma":0.00042624422,"threshold_uncertainty_score":0.9998923},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051146944,0.00029389313,0.99016494,0.002236455,0.0010590573,0.00050131563,0.0000037279274,0.00010202008,0.005587471],"genre_scores_gemma":[0.15041448,0.000033158787,0.84177756,0.007189337,0.00013380234,0.000016041286,0.0000017709231,0.0000132112245,0.00042064555],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738556,0.000044926455,0.0005720033,0.0007033992,0.00084230443,0.0004517825],"domain_scores_gemma":[0.996767,0.0010345717,0.00027315092,0.0014021387,0.0004163669,0.00010681113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085204537,0.0003611814,0.0004327782,0.0007624844,0.00030092587,0.00041974377,0.0034302403,0.00027225685,0.000017384278],"category_scores_gemma":[0.00037243136,0.00026208925,0.000117137824,0.0013783763,0.0004289605,0.0004771191,0.0017880722,0.00079600135,0.000035541354],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007617937,0.000022260114,0.000038376347,0.000049778042,0.000018891642,0.000011421747,0.014480418,0.019317545,0.00007097465,0.18671618,0.00016041235,0.77910614],"study_design_scores_gemma":[0.00038390534,0.0002505893,0.00035987727,0.0016821513,0.000019925475,0.000035144432,0.0000060543216,0.45791358,0.01642086,0.51545465,0.006373667,0.0010995807],"about_ca_topic_score_codex":0.000020774032,"about_ca_topic_score_gemma":0.000029252738,"teacher_disagreement_score":0.77800655,"about_ca_system_score_codex":0.00014834183,"about_ca_system_score_gemma":0.00054748694,"threshold_uncertainty_score":0.99998313},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001925396,0.00074839697,0.9701164,0.00040817636,0.002909122,0.00060670165,0.000005317594,0.0002768429,0.024736512],"genre_scores_gemma":[0.8026071,0.00019115314,0.1870281,0.005443009,0.0006189343,0.0000627094,0.00007727447,0.000056072076,0.0039156415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590737,0.000057306075,0.0008323171,0.001255434,0.0012751714,0.00067241414],"domain_scores_gemma":[0.99719507,0.00034252417,0.00045803102,0.0012618799,0.00057199184,0.00017049188],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000932156,0.0005743019,0.0006253912,0.00090549665,0.000612304,0.0011094521,0.0024651366,0.0003198633,0.00002817001],"category_scores_gemma":[0.0000868193,0.00055434456,0.00022546177,0.0006760385,0.00027424018,0.0011384633,0.0011696683,0.00060644647,0.00010834754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015574842,0.000060080074,0.000036491216,0.00038211842,0.00005212424,0.000056985802,0.009119556,0.09658608,0.00060999946,0.33565205,0.000085014864,0.5573439],"study_design_scores_gemma":[0.00050794357,0.00017151513,0.000073176074,0.0016513407,0.000021616032,0.00008820217,0.000008112473,0.96102005,0.0018238401,0.028439721,0.0051502725,0.0010441932],"about_ca_topic_score_codex":0.000093477014,"about_ca_topic_score_gemma":0.00016909649,"teacher_disagreement_score":0.864434,"about_ca_system_score_codex":0.00067232404,"about_ca_system_score_gemma":0.0010067442,"threshold_uncertainty_score":0.9999275},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021729367,0.0008450395,0.9875863,0.00032135617,0.0014857777,0.00026312607,0.000023398996,0.00014512635,0.009112549],"genre_scores_gemma":[0.7781928,0.000050156414,0.21631634,0.002671961,0.00028455575,0.000005796986,0.0000083176665,0.000038430426,0.002431623],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969759,0.000038100097,0.0005698676,0.0011333484,0.0007833577,0.0004994144],"domain_scores_gemma":[0.99624604,0.0008053953,0.00033222727,0.0023143615,0.00019224886,0.000109737906],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006168605,0.00044187641,0.00063225493,0.0007892656,0.00012816982,0.00022279765,0.006076348,0.00025126012,0.000030163555],"category_scores_gemma":[0.0002803175,0.00039542365,0.00015751497,0.00035273784,0.0007103897,0.0003310066,0.0027212214,0.000466193,0.000017501261],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005631301,0.00003566595,0.000084252926,0.00011639487,0.000016729751,0.000099483856,0.0007657608,0.0006847563,0.00015302356,0.115187205,0.00012751932,0.88272357],"study_design_scores_gemma":[0.0009966905,0.00045556622,0.00052594015,0.002758865,0.000035814035,0.00013138104,0.000001965064,0.33193496,0.00833583,0.6503218,0.0030975805,0.0014036148],"about_ca_topic_score_codex":0.000028663113,"about_ca_topic_score_gemma":0.000075394564,"teacher_disagreement_score":0.88131994,"about_ca_system_score_codex":0.00012549298,"about_ca_system_score_gemma":0.000475467,"threshold_uncertainty_score":0.99984974},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044201294,0.00008100336,0.990508,0.000029565053,0.00046509696,0.00014735053,0.000008872036,0.00005772923,0.008260367],"genre_scores_gemma":[0.93196255,0.000010458204,0.06752199,0.000053561733,0.000062621664,0.0000021093435,0.000015882044,0.000016748892,0.00035407988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920446,0.0000035581975,0.00022908344,0.00023069487,0.00021033362,0.000121869496],"domain_scores_gemma":[0.99913716,0.00035292172,0.000052467396,0.00026304036,0.00017107009,0.000023329858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000810011,0.0001590396,0.00017493054,0.00047381653,0.000045341145,0.000043098316,0.00019412658,0.00010310415,0.000024470986],"category_scores_gemma":[0.000029968454,0.00014647694,0.000036102694,0.00024398621,0.00010929342,0.00018323222,0.00003855945,0.00022160533,0.000003851889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024204855,0.0000036348124,0.00001677525,0.000036940288,0.000007200925,8.892386e-7,0.000087609646,0.94761807,0.00007826211,0.0017454886,0.000004177183,0.05039853],"study_design_scores_gemma":[0.00008231236,0.000038790768,0.000077559154,0.0003098699,0.000008670605,9.818367e-7,1.2579513e-7,0.9936252,0.00015064386,0.0052678455,0.00029897367,0.00013899963],"about_ca_topic_score_codex":0.000009755945,"about_ca_topic_score_gemma":0.00008647227,"teacher_disagreement_score":0.9315205,"about_ca_system_score_codex":0.00014191456,"about_ca_system_score_gemma":0.00007619327,"threshold_uncertainty_score":0.5973156},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010389817,0.002218694,0.9516704,0.00069552835,0.002654138,0.0005351965,0.0000517156,0.000029628061,0.031754892],"genre_scores_gemma":[0.94939107,0.00011501513,0.036175903,0.0026771626,0.00048064766,0.0000032028295,0.00009149717,0.00001778171,0.011047748],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998655,0.000015117334,0.0002067216,0.00065074756,0.00022007666,0.00025230146],"domain_scores_gemma":[0.99932927,0.000044606484,0.00008239542,0.00042978395,0.00006156779,0.00005234769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015240094,0.00022504407,0.00020641147,0.00040035252,0.00006597172,0.000056950077,0.0005840645,0.0002568931,0.00004103031],"category_scores_gemma":[0.0000496956,0.00022890621,0.000063369436,0.00027906842,0.00025045063,0.000005038939,0.00040504523,0.000323668,0.0000074286704],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010281983,0.00005087857,0.035839006,0.00021360966,0.000045452507,0.00013759077,0.0003908875,0.37968156,0.0018751856,0.0028985755,0.00079787284,0.5779666],"study_design_scores_gemma":[0.006817806,0.0014786158,0.14093249,0.005465674,0.00018588961,0.00016512854,0.000004557085,0.12868902,0.044013735,0.35258093,0.31148767,0.008178479],"about_ca_topic_score_codex":0.000014593474,"about_ca_topic_score_gemma":0.00056335074,"teacher_disagreement_score":0.9390012,"about_ca_system_score_codex":0.000039243598,"about_ca_system_score_gemma":0.00026862495,"threshold_uncertainty_score":0.9334524},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001987251,0.0016854994,0.9859074,0.0009694331,0.00074224937,0.00030965536,0.000011190335,0.00025935547,0.00991654],"genre_scores_gemma":[0.14873473,0.00023740187,0.8426049,0.0042118076,0.00033915957,0.00001792022,0.000015261641,0.000044554297,0.0037942606],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689424,0.00006511468,0.00044810286,0.001488925,0.0005811882,0.00052240415],"domain_scores_gemma":[0.99609876,0.002025294,0.00019708122,0.0014179845,0.00012390171,0.00013695724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012008477,0.00046966938,0.0005768888,0.0006425199,0.00027483026,0.0007200284,0.002319444,0.00031725215,0.00002310706],"category_scores_gemma":[0.0002872027,0.0004135155,0.00010256183,0.00050675555,0.00090461393,0.00050765136,0.0021112962,0.00068986806,0.00001704062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066148846,0.000023011053,0.00012912451,0.000071599155,0.0000165854,0.000080523045,0.00065934943,0.00069123704,0.000048619408,0.22228552,0.00005195492,0.7759358],"study_design_scores_gemma":[0.00030309742,0.00007432988,0.00018028256,0.00042398516,0.000009483472,0.000034630193,2.8089914e-7,0.3489643,0.00040684897,0.6470376,0.002066703,0.00049846363],"about_ca_topic_score_codex":0.00004239934,"about_ca_topic_score_gemma":0.00011334424,"teacher_disagreement_score":0.7754374,"about_ca_system_score_codex":0.0001682729,"about_ca_system_score_gemma":0.00044955005,"threshold_uncertainty_score":0.9998317},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011250795,0.000274405,0.9936057,0.0006023959,0.0016140302,0.00089784164,0.0000098812925,0.0002774886,0.0026057821],"genre_scores_gemma":[0.063976,0.000024719458,0.92927295,0.003963424,0.00044125947,0.000075507145,0.000010520213,0.000056590106,0.0021790075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553907,0.000023115559,0.00059680827,0.0021875268,0.00062066654,0.001032825],"domain_scores_gemma":[0.99643046,0.0008850692,0.00037046455,0.0017481778,0.000364357,0.00020148582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004848814,0.0007826207,0.00076356105,0.0009831078,0.0004993546,0.0007636178,0.0036595303,0.00041013758,0.000006574307],"category_scores_gemma":[0.00011725542,0.00063338596,0.00020812293,0.00070676056,0.0007129327,0.00080804253,0.0012177948,0.0007505559,0.0000070282026],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034020402,0.0000350641,0.000037865968,0.000107621265,0.000025379055,0.00008884956,0.00052039255,0.0019735403,0.00040323532,0.028421512,0.000022623548,0.9683299],"study_design_scores_gemma":[0.0011389217,0.001164758,0.00007432034,0.00088507804,0.000033191453,0.00014460678,4.7150849e-7,0.75841534,0.0037065605,0.22683771,0.0060595414,0.001539519],"about_ca_topic_score_codex":0.000004960566,"about_ca_topic_score_gemma":0.000054678272,"teacher_disagreement_score":0.9667904,"about_ca_system_score_codex":0.00026961643,"about_ca_system_score_gemma":0.0010129431,"threshold_uncertainty_score":0.99961174},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035954814,0.00031627546,0.9914231,0.000055517627,0.002855933,0.00027587425,0.0000057024026,0.00039041933,0.004317647],"genre_scores_gemma":[0.9835626,0.000023575974,0.015581087,0.000099925455,0.0004080353,0.0000061967016,0.000008699598,0.0000273933,0.00028249985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867576,0.000013089015,0.0003251901,0.00044250643,0.00031486127,0.00022858464],"domain_scores_gemma":[0.99926597,0.000109201465,0.0000778907,0.0003991638,0.000099542456,0.000048253605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002710857,0.0002469745,0.0002591676,0.00045668546,0.000117186864,0.00015274795,0.00031792722,0.00022632969,0.000011965499],"category_scores_gemma":[0.000026368854,0.0002474475,0.00006474224,0.00028633917,0.000080171616,0.000111433685,0.000048953898,0.00031418446,0.000016395761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019878669,0.000002366443,0.000010027914,0.000063573316,0.000010080418,0.000002173017,0.0001172632,0.86614,0.00070825254,0.000895878,0.000011037334,0.13203737],"study_design_scores_gemma":[0.000103667524,0.000011149461,0.000030078494,0.00021684686,0.00001047567,0.000008680771,1.7592025e-7,0.9922092,0.00033962628,0.0032858867,0.003543866,0.00024032444],"about_ca_topic_score_codex":0.000042778454,"about_ca_topic_score_gemma":0.00010923505,"teacher_disagreement_score":0.98320305,"about_ca_system_score_codex":0.00052996,"about_ca_system_score_gemma":0.00012105098,"threshold_uncertainty_score":0.9999978},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011278209,0.00095824176,0.9646384,0.006791001,0.0040395535,0.00068741397,0.000021382424,0.00006491036,0.021671256],"genre_scores_gemma":[0.9596417,0.000013388958,0.024247289,0.013990718,0.00036221632,0.000049853392,0.000028533013,0.000030141959,0.001636146],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976483,0.00008579746,0.00058386516,0.0008742684,0.0003758117,0.00043196636],"domain_scores_gemma":[0.99843913,0.00063132594,0.00018257793,0.0005029488,0.00020146051,0.000042554613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001119597,0.00026853604,0.0002858277,0.0008082869,0.00024276029,0.00021803426,0.00068510306,0.00043960172,0.000032198233],"category_scores_gemma":[0.00016542354,0.00021308493,0.00004951847,0.00093745755,0.00065483694,0.00015443117,0.00043883896,0.0020988928,0.0000138983405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008593734,0.000032067663,0.00014086743,0.00006857336,0.0000052117784,0.000038777896,0.0020485811,0.0001979914,0.0000016051708,0.05347816,0.00004567166,0.9439339],"study_design_scores_gemma":[0.002119173,0.0012917728,0.014613274,0.009012995,0.00003636085,0.00032858562,0.000041971343,0.04167575,0.00021965793,0.92029923,0.008766545,0.0015946967],"about_ca_topic_score_codex":0.00007351959,"about_ca_topic_score_gemma":0.00021527015,"teacher_disagreement_score":0.9585139,"about_ca_system_score_codex":0.0002945339,"about_ca_system_score_gemma":0.00015113533,"threshold_uncertainty_score":0.9118762},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039367616,0.0048308237,0.9534003,0.00024750308,0.00074744574,0.00062798354,0.00007685755,0.000060405633,0.0006410625],"genre_scores_gemma":[0.95665526,0.00016513836,0.040552936,0.0020632541,0.00033369736,0.000003986888,0.00002856271,0.000041974552,0.00015519076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746674,0.000032449974,0.00052854855,0.0009234842,0.0005597896,0.0004890028],"domain_scores_gemma":[0.99825484,0.00045813844,0.00026992752,0.0006283921,0.00024234803,0.00014633204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000462915,0.00050642085,0.0009124774,0.00059517636,0.0001662791,0.00008617759,0.00033720164,0.0004714151,0.000034760546],"category_scores_gemma":[0.00018470005,0.00042441633,0.0001708195,0.00024958575,0.0003516539,0.00032293046,0.00038359026,0.00088960276,7.326657e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016759235,0.0003585745,0.0011049069,0.0059247487,0.00023985804,0.0008951386,0.056049593,0.09148471,0.0026493338,0.00045587798,0.000025477559,0.8391359],"study_design_scores_gemma":[0.0032341096,0.0009216919,0.002170001,0.025019964,0.00027515646,0.00025528864,0.00007744912,0.95805377,0.003720787,0.0044651483,0.00033840918,0.0014682026],"about_ca_topic_score_codex":0.00017786676,"about_ca_topic_score_gemma":0.00019071538,"teacher_disagreement_score":0.91728765,"about_ca_system_score_codex":0.00014471382,"about_ca_system_score_gemma":0.00038068678,"threshold_uncertainty_score":0.99982077},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004362832,0.00004483206,0.9951541,0.00043406116,0.0006632924,0.0006719336,0.00017337484,0.0002099333,0.0026048345],"genre_scores_gemma":[0.008983987,0.000014669105,0.9883975,0.00084624713,0.00039095766,0.00011076569,0.00011280437,0.000032311593,0.0011107494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607295,0.000019246032,0.00047034,0.0018460387,0.0008744936,0.0007169359],"domain_scores_gemma":[0.99687195,0.00056631176,0.0004553854,0.0012575531,0.00067423464,0.00017459648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009458275,0.0005033437,0.0005348115,0.00055245444,0.00044441564,0.00076252816,0.0025782366,0.00022156157,0.000007227682],"category_scores_gemma":[0.000054878343,0.00045957742,0.00010071031,0.0006040564,0.00023734117,0.0010123737,0.00056528964,0.00048343843,0.000010140591],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000701727,0.000054467728,0.000016160195,0.000019461208,0.000030452553,0.000017330829,0.00045907716,0.0016925451,0.000056213667,0.010656542,0.00027806687,0.9867127],"study_design_scores_gemma":[0.00045463414,0.000605086,0.000042951528,0.00027956045,0.000028507655,0.000028505134,0.0000010365522,0.9475609,0.0057761157,0.04364781,0.0008540707,0.0007208208],"about_ca_topic_score_codex":0.000021906433,"about_ca_topic_score_gemma":0.000037114332,"teacher_disagreement_score":0.98599184,"about_ca_system_score_codex":0.0005417832,"about_ca_system_score_gemma":0.0010242987,"threshold_uncertainty_score":0.9997856},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019300451,0.000032041888,0.9953368,0.00011253974,0.0005192504,0.00022671494,0.00013368274,0.0005352007,0.0029107733],"genre_scores_gemma":[0.79578114,0.00017247324,0.2025431,0.0006173599,0.00008374535,0.000007912473,0.00023489844,0.000033834945,0.00052557595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987466,0.000002203181,0.0003498788,0.0004232558,0.00030661176,0.00017144957],"domain_scores_gemma":[0.99907404,0.00001762305,0.0000487411,0.0007168237,0.000090364716,0.000052383613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001907523,0.00019233424,0.0002201764,0.0004781725,0.000027117914,0.000020579844,0.0010759882,0.00007848359,0.000017414837],"category_scores_gemma":[0.00000594327,0.00020708401,0.000034805365,0.00025680635,0.000032726894,0.00016986177,0.00014645416,0.00020919697,0.0000027418637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023616212,0.000007270575,0.000015611777,0.0001666549,0.000015158121,0.000004444749,0.0002360207,0.8518013,0.000083780855,0.00091611524,0.0033377958,0.14341353],"study_design_scores_gemma":[0.00005117034,0.000023504625,0.0000683674,0.00014103435,0.000025979096,4.6095045e-7,9.738733e-8,0.9927953,0.00053122884,0.003889775,0.0022951507,0.00017793264],"about_ca_topic_score_codex":0.00005548218,"about_ca_topic_score_gemma":0.0024451273,"teacher_disagreement_score":0.79558814,"about_ca_system_score_codex":0.000080499805,"about_ca_system_score_gemma":0.00012194741,"threshold_uncertainty_score":0.84446406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041928948,0.0002801786,0.9957346,0.0010505359,0.00073915167,0.0002697228,0.000011281501,0.00086988177,0.0006253837],"genre_scores_gemma":[0.62504673,0.000009599282,0.37199154,0.0025298689,0.00018700269,0.0000073695337,0.000002673942,0.000020003317,0.0002052131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774295,0.000029171631,0.00032645723,0.0010893389,0.00038386745,0.0004281987],"domain_scores_gemma":[0.9980999,0.0008114503,0.00015378348,0.0006747572,0.00016602023,0.00009408896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033781157,0.000396771,0.000434454,0.0008898687,0.00021922859,0.0009968341,0.0010987846,0.0001740128,0.0000015397104],"category_scores_gemma":[0.000277413,0.00037903307,0.00006978201,0.0006320389,0.00032222597,0.0009640664,0.0008806677,0.0009653907,0.0000017308622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014623567,0.000051449726,0.005095643,0.00006394648,0.000025820302,0.00020477569,0.0012351956,0.10221428,0.00028334712,0.0042614057,0.00026452212,0.886285],"study_design_scores_gemma":[0.00025365193,0.000058199104,0.00028511972,0.00090250664,0.0000056876206,0.00007530355,8.3913974e-8,0.82691187,0.00033796564,0.17039232,0.00036993914,0.00040736614],"about_ca_topic_score_codex":0.00008385693,"about_ca_topic_score_gemma":0.00009256376,"teacher_disagreement_score":0.8858776,"about_ca_system_score_codex":0.000387594,"about_ca_system_score_gemma":0.00046502004,"threshold_uncertainty_score":0.9998662},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018328885,0.00021059938,0.12757052,0.0017043046,0.002168474,0.0017028601,0.00015043952,0.00017119915,0.8479927],"genre_scores_gemma":[0.9978596,0.000022121601,0.0007835299,0.0003643854,0.00013270776,0.000008358068,0.000021339263,0.000007803868,0.0008001442],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739,0.000026170286,0.00051632745,0.00055969495,0.0010128041,0.0004950519],"domain_scores_gemma":[0.9987643,0.0004750716,0.00018033925,0.00041615326,0.00006409305,0.000100080586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000797561,0.00027598548,0.00031773362,0.00058931723,0.00028159603,0.0009639286,0.0012228312,0.0002687848,0.00003812119],"category_scores_gemma":[0.0007096835,0.0002855032,0.00008955716,0.0004034842,0.0018897818,0.0037140846,0.0011851098,0.00048009737,0.000043316933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015526191,0.00007778717,0.0049100774,0.0001129776,0.000008901453,0.000011377937,0.03340512,0.003587296,0.0000012262221,0.048531868,0.000018101668,0.90931976],"study_design_scores_gemma":[0.0002638351,0.00005104318,0.00127706,0.00057938456,0.000004857123,0.0000012834611,0.00004856865,0.0037403107,0.000068503876,0.97188956,0.021453544,0.0006220689],"about_ca_topic_score_codex":0.0003659276,"about_ca_topic_score_gemma":0.0020168931,"teacher_disagreement_score":0.97953075,"about_ca_system_score_codex":0.0013935838,"about_ca_system_score_gemma":0.00065393647,"threshold_uncertainty_score":0.9999597},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017788044,0.00226981,0.9890748,0.00011549308,0.002516584,0.0008346409,0.000042225645,0.0002465119,0.0047220183],"genre_scores_gemma":[0.5266351,0.0001408651,0.47149467,0.00019755229,0.0006683397,0.00017073187,0.000022505388,0.000111758956,0.00055850286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778104,0.0000137478255,0.00054932,0.0007430252,0.00037543118,0.00053745793],"domain_scores_gemma":[0.9977472,0.001311929,0.00007914359,0.00072217523,0.00006767697,0.00007187508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056500314,0.00046665504,0.0005820439,0.0007366792,0.000054280594,0.00013888729,0.0008878019,0.00025847382,0.00001780373],"category_scores_gemma":[0.00005242947,0.000495659,0.00010043837,0.00037349318,0.00017173811,0.00015006892,0.00013781388,0.00063838525,0.000007634999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073506376,0.000013327028,0.00007633483,0.00077067944,0.00002565414,0.0002931139,0.00088873215,0.8886455,0.000954699,0.014720865,0.00019514527,0.09340858],"study_design_scores_gemma":[0.0011453847,0.00013363612,0.00096172694,0.006432305,0.000014949371,0.00017239428,0.000005244924,0.9160358,0.002076892,0.015276154,0.05585423,0.0018913267],"about_ca_topic_score_codex":0.000028456236,"about_ca_topic_score_gemma":0.00018587612,"teacher_disagreement_score":0.5264572,"about_ca_system_score_codex":0.00088387774,"about_ca_system_score_gemma":0.0003111652,"threshold_uncertainty_score":0.9997495},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025734003,0.00065133057,0.99368936,0.00024460192,0.0022870707,0.000893689,0.000049796672,0.0002451042,0.0016817001],"genre_scores_gemma":[0.12586749,0.0000390346,0.87215114,0.0006647078,0.0006984168,0.000020790274,0.000049171373,0.000036197875,0.00047307982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536246,0.000023247878,0.0008256816,0.002012519,0.00082587014,0.00095024245],"domain_scores_gemma":[0.99686223,0.00044602237,0.00056909735,0.0014531383,0.00051260885,0.00015691618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073080434,0.00077513006,0.0008217509,0.0008173796,0.0007662646,0.00047290168,0.0025756694,0.00037039898,0.000009543264],"category_scores_gemma":[0.0001205246,0.0006922017,0.00012402226,0.00081693236,0.00057506334,0.0013585697,0.0017563596,0.0008335471,0.00000466743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076102656,0.000011759556,0.00006749837,0.00045112948,0.000009422943,0.000012795941,0.00035186345,0.042688902,0.0000478124,0.06432132,0.00006960898,0.89196026],"study_design_scores_gemma":[0.0005332546,0.00028334584,0.00038033596,0.0031786624,0.000017614566,0.00006520386,8.2213097e-7,0.9196927,0.0020861698,0.060771775,0.011733741,0.0012563547],"about_ca_topic_score_codex":0.000020713987,"about_ca_topic_score_gemma":0.000033661803,"teacher_disagreement_score":0.8907039,"about_ca_system_score_codex":0.00036656132,"about_ca_system_score_gemma":0.0012606013,"threshold_uncertainty_score":0.9995529},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.553884e-7,0.00035719396,0.9810578,0.0011158596,0.0012906762,0.00089748285,0.0000068289705,0.00009292715,0.01518023],"genre_scores_gemma":[0.0027901598,0.00012045183,0.99071884,0.0015979684,0.00011914447,0.000040117895,0.000009033022,0.000018761699,0.004585493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714077,0.000024210116,0.0004801829,0.0011327001,0.0007151544,0.0005069771],"domain_scores_gemma":[0.9978341,0.000374497,0.00019799001,0.0011565142,0.0003237733,0.000113152404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072113395,0.0003523673,0.0004275222,0.0009185556,0.00017288576,0.00026881276,0.003041363,0.0002190869,0.000015982185],"category_scores_gemma":[0.00005494632,0.0003144198,0.00015208522,0.0006074786,0.00035061326,0.0002963304,0.0012587113,0.00027742438,0.0000050768394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059547788,0.000036596553,0.000010293237,0.00019811446,0.000023580033,0.000014669636,0.0005271946,0.040945247,0.000024584308,0.20240772,0.00038649514,0.75541955],"study_design_scores_gemma":[0.00044658358,0.00015857052,0.0000118248545,0.00054673594,0.000009851247,0.0000044437948,2.6300532e-7,0.8336589,0.0010195045,0.14412253,0.019550445,0.00047035777],"about_ca_topic_score_codex":0.0000065441327,"about_ca_topic_score_gemma":0.000015665297,"teacher_disagreement_score":0.79271364,"about_ca_system_score_codex":0.00015413635,"about_ca_system_score_gemma":0.00034357127,"threshold_uncertainty_score":0.9999308},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011413492,0.0010855804,0.98546034,0.000015900143,0.00074180414,0.00033000976,0.00002194233,0.0000908561,0.0008400718],"genre_scores_gemma":[0.8714233,0.000009731176,0.128304,0.000080546546,0.000090888534,0.0000070395004,0.0000017941419,0.000030579024,0.000052096795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859935,0.0000071905156,0.0003822375,0.00039089422,0.0002757586,0.0003445518],"domain_scores_gemma":[0.99912286,0.00023921866,0.00006184363,0.00044700614,0.00006339582,0.00006567912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053529633,0.00029216651,0.00035339914,0.00034062736,0.000091695074,0.000056309516,0.0004240972,0.00013765683,0.0000035245891],"category_scores_gemma":[0.000024858533,0.0002522143,0.00003439344,0.00024472797,0.000062893436,0.000100890975,0.000290517,0.00031524608,0.0000015607103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.711884e-7,0.0000015656668,0.00003327749,0.00016850821,0.0000130533845,0.000058973415,0.0021832553,0.9347908,0.00007365693,0.00030830965,0.000003437724,0.062364507],"study_design_scores_gemma":[0.00011091179,0.0000113325,0.00012189153,0.0009996768,0.00000983792,0.00028905363,0.0000019294275,0.9956791,0.0018439866,0.0001621603,0.00044547737,0.00032466828],"about_ca_topic_score_codex":0.000044900855,"about_ca_topic_score_gemma":0.00018422291,"teacher_disagreement_score":0.86000985,"about_ca_system_score_codex":0.00022463145,"about_ca_system_score_gemma":0.00017986378,"threshold_uncertainty_score":0.999993},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024951216,0.0009834232,0.95962584,0.00007128997,0.004430247,0.0004438585,0.000016071817,0.0005563478,0.033847973],"genre_scores_gemma":[0.5569286,0.0005555558,0.4294725,0.0007278353,0.0018527581,0.000096222204,0.00004997009,0.00037188776,0.009944658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976082,0.000009429799,0.00057889207,0.00073233125,0.00051841256,0.0005527498],"domain_scores_gemma":[0.9984644,0.00033014928,0.00008053394,0.0009383706,0.000083334024,0.000103199556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042241896,0.0005361099,0.000564801,0.0005994963,0.00008543086,0.00011075671,0.0011741088,0.00032986412,0.000034626406],"category_scores_gemma":[0.00006483198,0.0005648322,0.000108580374,0.00042559623,0.00017285398,0.00015716396,0.00028817717,0.00073260657,0.00006752488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002533122,0.000003940548,0.0000499994,0.00023897729,0.000030599433,0.000023626742,0.00009112715,0.87246925,0.00010073549,0.0017128818,0.00004482589,0.1252315],"study_design_scores_gemma":[0.0003532365,0.000025674015,0.0006588793,0.0018733713,0.000014286951,0.000026072206,4.7473442e-8,0.93557006,0.0011040553,0.0034614217,0.05600328,0.0009096283],"about_ca_topic_score_codex":0.000004448087,"about_ca_topic_score_gemma":0.00001998142,"teacher_disagreement_score":0.55690366,"about_ca_system_score_codex":0.00084835873,"about_ca_system_score_gemma":0.00025109,"threshold_uncertainty_score":0.99968034},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001094442,0.001276039,0.9870478,0.0008363137,0.001656181,0.00038650853,0.0000041281382,0.0004080428,0.008275568],"genre_scores_gemma":[0.12997597,0.00024675654,0.8652981,0.0032111534,0.00042510658,0.000028112834,0.000007016592,0.000046545825,0.00076125574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959888,0.00005524994,0.00062007137,0.001726947,0.0008264918,0.00078244985],"domain_scores_gemma":[0.9972211,0.0007796787,0.00022501792,0.0015285957,0.00010447159,0.00014109824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012289494,0.00054938096,0.00061341183,0.0015128482,0.0001869068,0.0005869072,0.0046533807,0.00037091886,0.000016776503],"category_scores_gemma":[0.000117799376,0.0005103837,0.00012875917,0.0011459934,0.00042790946,0.00060976215,0.0021766752,0.0010490443,0.000036168043],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046859695,0.00008904723,0.00025423654,0.00021576426,0.000020536303,0.0002656205,0.0013757482,0.0063707167,0.000080697464,0.10271554,0.00006122508,0.88854617],"study_design_scores_gemma":[0.0002829849,0.00007780946,0.0002609871,0.0009236146,0.000007692824,0.000046100362,2.2293318e-7,0.7111021,0.0007346175,0.28377384,0.0021795726,0.0006104277],"about_ca_topic_score_codex":0.000028513827,"about_ca_topic_score_gemma":0.000049029957,"teacher_disagreement_score":0.88793576,"about_ca_system_score_codex":0.00036289095,"about_ca_system_score_gemma":0.00072709686,"threshold_uncertainty_score":0.99973476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008807259,0.00030509787,0.99080724,0.00016606903,0.0026560202,0.0005737203,0.00005501061,0.0009307828,0.0036253359],"genre_scores_gemma":[0.28227702,0.000037818372,0.71319705,0.0013252038,0.0012674361,0.0000530515,0.000048149388,0.00019274573,0.0016015144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973978,0.000013436676,0.00061127945,0.0008564145,0.0005268931,0.000594177],"domain_scores_gemma":[0.99791974,0.0005277166,0.00005836203,0.0012135875,0.00010567986,0.00017491821],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036193893,0.0005883039,0.00062554015,0.00078465894,0.00007646445,0.00020240253,0.0013414703,0.00030413744,0.00002722435],"category_scores_gemma":[0.00016419168,0.0006155551,0.00009386794,0.000527677,0.00013426089,0.00023719184,0.00031186047,0.0006239038,0.000050617302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021514988,0.000011027915,0.000016438666,0.00032847605,0.000020331407,0.00013151353,0.00015272388,0.8290731,0.0001586957,0.0008882288,0.000098173274,0.16911915],"study_design_scores_gemma":[0.00013329528,0.000074283125,0.00075675105,0.0015313372,0.000014031461,0.00007909355,1.7063512e-7,0.9799712,0.00022352659,0.0013052446,0.015100018,0.0008110969],"about_ca_topic_score_codex":0.00001500579,"about_ca_topic_score_gemma":0.0001489404,"teacher_disagreement_score":0.2813963,"about_ca_system_score_codex":0.00048087275,"about_ca_system_score_gemma":0.00017141017,"threshold_uncertainty_score":0.99962956},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002308183,0.00052943925,0.9885014,0.00051899307,0.00048122907,0.0005563048,0.0000046846767,0.00045859796,0.008718523],"genre_scores_gemma":[0.2606265,0.00079770584,0.7324275,0.0034889295,0.00027506452,0.00007732058,0.000012968651,0.000040600502,0.0022534472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670225,0.000034372366,0.00046287646,0.0016159704,0.0006336191,0.00055092585],"domain_scores_gemma":[0.9974362,0.00045410104,0.00026180077,0.0014357347,0.00025486964,0.00015728013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050549384,0.0005123464,0.0004589441,0.0006591304,0.0006486124,0.0006349499,0.0026143496,0.00032088792,0.0000031633379],"category_scores_gemma":[0.0000460882,0.00047280462,0.00007979332,0.0008504329,0.00060451246,0.0004250978,0.0014859827,0.000799017,0.00002377883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060907523,0.00006381597,0.00010124717,0.00009023464,0.000012170464,0.000013221891,0.0013422958,0.07807371,0.000013203352,0.07021279,0.00018060576,0.8498906],"study_design_scores_gemma":[0.00025260367,0.00024023805,0.000262773,0.00063215103,0.0000066048838,0.00002857658,3.3590587e-7,0.8962903,0.0013351159,0.08845864,0.011698028,0.0007946169],"about_ca_topic_score_codex":0.0000075896355,"about_ca_topic_score_gemma":0.000013152874,"teacher_disagreement_score":0.849096,"about_ca_system_score_codex":0.00019662542,"about_ca_system_score_gemma":0.00033739174,"threshold_uncertainty_score":0.99977237},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93297565,0.0011335276,0.013547588,0.03340451,0.0009061824,0.0014690852,0.001066262,0.000027773749,0.015469434],"genre_scores_gemma":[0.996997,0.000023977987,0.00069611124,0.002068299,0.000055708275,0.0000019242534,0.0000105860845,0.0000018013076,0.00014460013],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9977328,0.00012252344,0.0003040247,0.000470196,0.0011174711,0.00025294858],"domain_scores_gemma":[0.998189,0.0010590169,0.00016698126,0.00024534744,0.00027411568,0.000065581415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015497813,0.00018714898,0.00048367964,0.00022203289,0.0002526863,0.00020777227,0.00069998816,0.00012244364,0.000045381246],"category_scores_gemma":[0.00008556559,0.0001396589,0.000037786183,0.00091439293,0.0010470031,0.00015940396,0.00020569206,0.00031254935,5.031239e-8],"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.00018220248,0.0003001404,0.45210657,0.00061078224,0.00082776946,0.00005484327,0.216139,0.0076695653,0.000016271128,0.20597722,0.0006129391,0.115502715],"study_design_scores_gemma":[0.0023000406,0.00046720804,0.70741075,0.0016421023,0.0009536309,0.000005815629,0.0041858354,0.13826469,0.00009803076,0.08467935,0.057378758,0.002613791],"about_ca_topic_score_codex":0.82837385,"about_ca_topic_score_gemma":0.9985333,"teacher_disagreement_score":0.2553042,"about_ca_system_score_codex":0.0003833986,"about_ca_system_score_gemma":0.0015476295,"threshold_uncertainty_score":0.5695125},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023271963,0.0030453873,0.98024124,0.0013859568,0.0034015824,0.00053385756,0.0000047269036,0.00022168194,0.01114228],"genre_scores_gemma":[0.011563277,0.0007796678,0.9785468,0.006504056,0.0008619518,0.00009213257,0.000025986332,0.000051328654,0.0015748057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99449134,0.00018151285,0.0008240659,0.0023407137,0.0010463767,0.001115965],"domain_scores_gemma":[0.99616396,0.0013593276,0.00033097426,0.001697461,0.00028253786,0.00016576184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012365137,0.0006793005,0.0008489903,0.0024716102,0.00019528926,0.00046506262,0.005359744,0.0004878623,0.000031527543],"category_scores_gemma":[0.0003831961,0.0006752615,0.00015800731,0.0034403906,0.0008513067,0.001678421,0.0019533942,0.0014381327,0.00008141386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016120712,0.000086038744,0.00015492146,0.00016529625,0.0000049960663,0.00023578356,0.0004317915,0.0821879,0.00020207025,0.02219002,0.00051026075,0.8938148],"study_design_scores_gemma":[0.0007344066,0.00022873549,0.00029130286,0.0011993969,0.0000075570906,0.000050480998,2.6166728e-7,0.5030385,0.0015737205,0.4770235,0.0148516465,0.0010004689],"about_ca_topic_score_codex":0.000036563113,"about_ca_topic_score_gemma":0.00033674794,"teacher_disagreement_score":0.89281434,"about_ca_system_score_codex":0.0012778246,"about_ca_system_score_gemma":0.003400959,"threshold_uncertainty_score":0.99956983},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023271963,0.0030453873,0.98024124,0.0013859568,0.0034015824,0.00053385756,0.0000047269036,0.00022168194,0.01114228],"genre_scores_gemma":[0.011563277,0.0007796678,0.9785468,0.006504056,0.0008619518,0.00009213257,0.000025986332,0.000051328654,0.0015748057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99449134,0.00018151285,0.0008240659,0.0023407137,0.0010463767,0.001115965],"domain_scores_gemma":[0.99616396,0.0013593276,0.00033097426,0.001697461,0.00028253786,0.00016576184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012365137,0.0006793005,0.0008489903,0.0024716102,0.00019528926,0.00046506262,0.005359744,0.0004878623,0.000031527543],"category_scores_gemma":[0.0003831961,0.0006752615,0.00015800731,0.0034403906,0.0008513067,0.001678421,0.0019533942,0.0014381327,0.00008141386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016120712,0.000086038744,0.00015492146,0.00016529625,0.0000049960663,0.00023578356,0.0004317915,0.0821879,0.00020207025,0.02219002,0.00051026075,0.8938148],"study_design_scores_gemma":[0.0007344066,0.00022873549,0.00029130286,0.0011993969,0.0000075570906,0.000050480998,2.6166728e-7,0.5030385,0.0015737205,0.4770235,0.0148516465,0.0010004689],"about_ca_topic_score_codex":0.000036563113,"about_ca_topic_score_gemma":0.00033674794,"teacher_disagreement_score":0.89281434,"about_ca_system_score_codex":0.0012778246,"about_ca_system_score_gemma":0.003400959,"threshold_uncertainty_score":0.99956983},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082243074,0.00249477,0.9873914,0.00071901834,0.0015913771,0.00033516897,0.000039241066,0.00021415608,0.0071326103],"genre_scores_gemma":[0.08826503,0.0017305566,0.900249,0.00767221,0.0010254477,0.000035686346,0.0000903008,0.00006663661,0.0008651024],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99652463,0.000033691853,0.00040425258,0.0017419596,0.00067818654,0.00061727985],"domain_scores_gemma":[0.99748427,0.0003949938,0.00017848721,0.0015676534,0.00017368958,0.00020091023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006925891,0.00051418686,0.0005006567,0.0011252739,0.00030321523,0.0007424147,0.0029883229,0.00023401895,0.00003635607],"category_scores_gemma":[0.00007096264,0.00048355848,0.00011709435,0.00071197544,0.000803946,0.0006993117,0.00263983,0.00075129047,0.000015926818],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005255357,0.000026995353,0.00004969692,0.00009312533,0.000013677657,0.000105968415,0.00055786525,0.0001422215,0.000028019507,0.1398096,0.0003417218,0.85882586],"study_design_scores_gemma":[0.0005639204,0.00020993827,0.00037303657,0.0007144568,0.00001987447,0.00014946492,1.502456e-7,0.22168276,0.0007904031,0.7197161,0.054513313,0.0012666475],"about_ca_topic_score_codex":0.000054917316,"about_ca_topic_score_gemma":0.00008885882,"teacher_disagreement_score":0.8575592,"about_ca_system_score_codex":0.00009921448,"about_ca_system_score_gemma":0.00034248107,"threshold_uncertainty_score":0.9997616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021178486,0.0012739019,0.9959968,0.0004219592,0.0007558707,0.00078478426,0.00012968302,0.00012946512,0.0004863958],"genre_scores_gemma":[0.0077252416,0.00013309851,0.9904898,0.00091783836,0.0005232298,0.00010569516,0.00006476591,0.000013694361,0.000026629496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735683,0.000016970216,0.00034826223,0.0014737486,0.00040349376,0.00040071653],"domain_scores_gemma":[0.9970478,0.0011000164,0.00017852918,0.0013468198,0.00019804653,0.00012883462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041301304,0.000356624,0.00038548897,0.0005090132,0.00037165606,0.0006946113,0.0020392314,0.00041350632,0.000009301212],"category_scores_gemma":[0.00008306721,0.00035252827,0.0001021719,0.00066121813,0.0005582469,0.0005788033,0.0009001498,0.00060740666,0.000004718547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068460467,0.000019310433,0.000026141823,0.00003985337,0.000008884138,0.0000021817648,0.00022342341,0.00040253127,0.000023362949,0.6010782,0.00002103904,0.39814818],"study_design_scores_gemma":[0.00015961697,0.00006300419,0.00006846887,0.00028977578,0.000011890972,0.000003386104,1.8788984e-7,0.12932213,0.00020610908,0.86019427,0.009342948,0.00033824533],"about_ca_topic_score_codex":0.0000581345,"about_ca_topic_score_gemma":0.000048588216,"teacher_disagreement_score":0.39780995,"about_ca_system_score_codex":0.00007303964,"about_ca_system_score_gemma":0.000323995,"threshold_uncertainty_score":0.99989265},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022598702,0.0003171797,0.9937401,0.00043228388,0.0014912145,0.00036716304,0.000078741956,0.000100419085,0.0032469013],"genre_scores_gemma":[0.17022991,0.00011730404,0.82783514,0.0012972449,0.0002521102,0.00001575902,0.00015384852,0.000023472627,0.00007519615],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691826,0.00003438555,0.0006746836,0.0011520083,0.00073663174,0.00048404807],"domain_scores_gemma":[0.9971464,0.0005066998,0.00035008273,0.0013794824,0.00050369214,0.000113591705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072128925,0.00037012916,0.0004525415,0.0010661673,0.0003123038,0.0003366451,0.0024984763,0.00021372271,0.000062983214],"category_scores_gemma":[0.00011893501,0.00036947484,0.00017223413,0.0012606544,0.00042461744,0.00089433603,0.0012218407,0.0004888457,0.00001283709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009068112,0.00004976051,0.00020508964,0.000101941565,0.000026660813,0.000018071687,0.00093239074,0.0030461974,0.00040411632,0.391136,0.00012052387,0.6039502],"study_design_scores_gemma":[0.000548767,0.0002596401,0.0008486322,0.00069809455,0.00002822525,0.000028483375,0.0000017206355,0.30923563,0.0035980474,0.6780979,0.0058033066,0.00085153914],"about_ca_topic_score_codex":0.00012999006,"about_ca_topic_score_gemma":0.0001740358,"teacher_disagreement_score":0.6030987,"about_ca_system_score_codex":0.00011798465,"about_ca_system_score_gemma":0.0007228625,"threshold_uncertainty_score":0.9998757},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023271963,0.0030453873,0.98024124,0.0013859568,0.0034015824,0.00053385756,0.0000047269036,0.00022168194,0.01114228],"genre_scores_gemma":[0.011563277,0.0007796678,0.9785468,0.006504056,0.0008619518,0.00009213257,0.000025986332,0.000051328654,0.0015748057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99449134,0.00018151285,0.0008240659,0.0023407137,0.0010463767,0.001115965],"domain_scores_gemma":[0.99616396,0.0013593276,0.00033097426,0.001697461,0.00028253786,0.00016576184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012365137,0.0006793005,0.0008489903,0.0024716102,0.00019528926,0.00046506262,0.005359744,0.0004878623,0.000031527543],"category_scores_gemma":[0.0003831961,0.0006752615,0.00015800731,0.0034403906,0.0008513067,0.001678421,0.0019533942,0.0014381327,0.00008141386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016120712,0.000086038744,0.00015492146,0.00016529625,0.0000049960663,0.00023578356,0.0004317915,0.0821879,0.00020207025,0.02219002,0.00051026075,0.8938148],"study_design_scores_gemma":[0.0007344066,0.00022873549,0.00029130286,0.0011993969,0.0000075570906,0.000050480998,2.6166728e-7,0.5030385,0.0015737205,0.4770235,0.0148516465,0.0010004689],"about_ca_topic_score_codex":0.000036563113,"about_ca_topic_score_gemma":0.00033674794,"teacher_disagreement_score":0.89281434,"about_ca_system_score_codex":0.0012778246,"about_ca_system_score_gemma":0.003400959,"threshold_uncertainty_score":0.99956983},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066952885,0.0001429987,0.9951598,0.00011762613,0.0008037629,0.00089832273,0.00011930876,0.000024048151,0.002064601],"genre_scores_gemma":[0.33329085,0.0000018033351,0.66617996,0.00018059807,0.000070315305,0.000016983498,0.00007472012,0.000008832432,0.00017594418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945341,0.00006758866,0.0007303573,0.0017202143,0.0026662853,0.00028150543],"domain_scores_gemma":[0.9953282,0.0015691158,0.0004397031,0.00151684,0.0010756778,0.0000704549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012486432,0.00024903877,0.0004315206,0.0013725886,0.00023374271,0.0004897644,0.0014705088,0.00013538961,0.000014478752],"category_scores_gemma":[0.0019925234,0.00019926057,0.00009386127,0.00076501275,0.0009583622,0.00013519473,0.0008254676,0.00018206154,0.0000013445485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066700463,0.000013770626,0.000018430557,0.000020303236,0.0000027630174,9.772377e-8,0.000053535416,0.5467578,0.000009574039,0.0028294122,0.000111300236,0.45017633],"study_design_scores_gemma":[0.0003185856,0.000035981626,0.000020921556,0.000076490825,0.000033253298,0.0000012654392,0.000001796636,0.8415788,0.00014518893,0.15717942,0.00045129174,0.00015700907],"about_ca_topic_score_codex":0.000008173684,"about_ca_topic_score_gemma":0.000011831724,"teacher_disagreement_score":0.45001933,"about_ca_system_score_codex":0.00013038519,"about_ca_system_score_gemma":0.00077153003,"threshold_uncertainty_score":0.81256104},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011710161,0.0007500665,0.98132026,0.0018047902,0.0048847413,0.00023576894,0.0000024923313,0.00021808167,0.010666674],"genre_scores_gemma":[0.0579272,0.00080260966,0.9359842,0.0022983185,0.0015727469,0.00004025687,0.000031045478,0.000057562804,0.0012860914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951043,0.000050331517,0.0007626807,0.0020001342,0.001212636,0.0008699096],"domain_scores_gemma":[0.9970598,0.0004889757,0.00039489238,0.0016248291,0.00026642112,0.00016503867],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007798525,0.00061939284,0.00072628935,0.0014604148,0.00049954065,0.0013385201,0.0040892996,0.00024556048,0.000048727128],"category_scores_gemma":[0.00012339806,0.0005934995,0.00028436488,0.0015658151,0.0003742981,0.0023696271,0.0023451564,0.0006793205,0.000044952863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031225113,0.000047801168,0.00035215355,0.000055153294,0.000058276084,0.000038761784,0.002523923,0.011051225,0.000038468672,0.083621226,0.00022091417,0.901989],"study_design_scores_gemma":[0.0004872424,0.00019027434,0.00017321012,0.0014391431,0.000021353908,0.000024986075,0.0000038667813,0.93586,0.0007969713,0.024069713,0.035619747,0.0013135378],"about_ca_topic_score_codex":0.00001639488,"about_ca_topic_score_gemma":0.000017530565,"teacher_disagreement_score":0.92480874,"about_ca_system_score_codex":0.00032779516,"about_ca_system_score_gemma":0.00060005585,"threshold_uncertainty_score":0.99969816},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018143308,0.00055159896,0.98758656,0.0030070522,0.0025808576,0.0005835177,0.0000017408653,0.00030120442,0.005206044],"genre_scores_gemma":[0.10458738,0.000078203644,0.87810016,0.013516521,0.0006727325,0.000025598196,0.0000032523076,0.00004622302,0.0029699514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994218,0.000047965525,0.0006460938,0.0026336166,0.0014130676,0.0010412573],"domain_scores_gemma":[0.9960411,0.00054362015,0.00021482167,0.0025329003,0.00032936875,0.00033819067],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006811799,0.0008070017,0.0007577745,0.0011356839,0.00034680986,0.0009944651,0.005495646,0.0003151804,0.00003292151],"category_scores_gemma":[0.00014044614,0.000692269,0.00012266515,0.00090397685,0.0003561663,0.00077045755,0.002720557,0.00092980947,0.00004371911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001578783,0.000033471097,0.000048641105,0.00003434376,0.000021285756,0.00019480621,0.008977746,0.09720329,0.0002801177,0.017487615,0.00020600473,0.87549686],"study_design_scores_gemma":[0.0006113302,0.00028225852,0.000068635745,0.0020101003,0.000006883347,0.00007664754,0.000002034791,0.94287705,0.0021863638,0.03764982,0.012498295,0.0017305745],"about_ca_topic_score_codex":0.00019694964,"about_ca_topic_score_gemma":0.000094173985,"teacher_disagreement_score":0.8737663,"about_ca_system_score_codex":0.00045582186,"about_ca_system_score_gemma":0.0010719975,"threshold_uncertainty_score":0.9998851},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93439806,0.00015578224,0.06251417,0.00016113053,0.0010149906,0.00042824756,0.000010811383,0.00004186937,0.0012749617],"genre_scores_gemma":[0.9988867,0.000027739077,0.00022847202,0.00027177818,0.00012649896,0.00001211378,0.000008368471,0.000012929562,0.00042537568],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9980372,0.00009663602,0.00055059453,0.00071711245,0.00032365022,0.00027478038],"domain_scores_gemma":[0.9986077,0.0005880355,0.00026594344,0.00035763957,0.000112608446,0.00006810027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005130365,0.0003209047,0.00039873505,0.0005172789,0.000179108,0.000099497905,0.00028263938,0.00018131868,0.00012988836],"category_scores_gemma":[0.000058847003,0.00021634181,0.00005972323,0.00023608972,0.0004114697,0.00017607612,0.0001894711,0.0005252282,0.000009674272],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011233654,0.0008382308,0.036285147,0.0002525354,0.00019114051,0.00005410449,0.018198242,0.04114538,0.003890529,0.0052849953,0.000250238,0.8924861],"study_design_scores_gemma":[0.0010964391,0.0012455955,0.65035623,0.0007894033,0.000013162475,0.000024392852,0.000004908535,0.34522444,0.00021644226,0.000529962,0.000118784934,0.00038024766],"about_ca_topic_score_codex":0.00012134618,"about_ca_topic_score_gemma":0.00006293572,"teacher_disagreement_score":0.8921058,"about_ca_system_score_codex":0.00021067171,"about_ca_system_score_gemma":0.000082999984,"threshold_uncertainty_score":0.88221633},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029487755,0.0003211036,0.99284893,0.00006201554,0.0014231722,0.0019989454,0.000122068064,0.0006543276,0.0025399246],"genre_scores_gemma":[0.7169572,0.000007916459,0.27912647,0.0006707165,0.0016800857,0.00024797488,0.00007614409,0.00021514564,0.0010183215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971917,0.000052977706,0.0005868723,0.0010102794,0.00057396723,0.0005841634],"domain_scores_gemma":[0.99746203,0.0010551845,0.00017362053,0.00089155155,0.00023024427,0.00018737905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000510193,0.00065353274,0.00089144404,0.00073074346,0.00019088303,0.00023841693,0.0008337667,0.0004984178,0.000007356425],"category_scores_gemma":[0.00007355204,0.0005787757,0.00021515651,0.00024513432,0.00016538016,0.0001727151,0.000059076465,0.0006677217,0.000014837435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079557285,0.0000088131355,0.0000054912025,0.00019664214,0.000043943055,0.000012151417,0.00020071337,0.8548224,0.000049319726,0.0010747731,0.000024724834,0.1434815],"study_design_scores_gemma":[0.0015807116,0.0002892543,0.000029596578,0.0012627937,0.000035875088,0.000010212702,0.0000013166238,0.9939155,0.0000781256,0.0014577318,0.000793238,0.0005456166],"about_ca_topic_score_codex":0.000038543712,"about_ca_topic_score_gemma":0.0001705698,"teacher_disagreement_score":0.71692777,"about_ca_system_score_codex":0.0005118427,"about_ca_system_score_gemma":0.00020765192,"threshold_uncertainty_score":0.9996664},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013609606,0.00038048663,0.9524025,0.0012236075,0.0013775643,0.00031663658,0.0000019041951,0.0002364675,0.043924738],"genre_scores_gemma":[0.8211986,0.0003944733,0.06673278,0.04199839,0.018908828,0.00031765382,0.0005029952,0.00038963126,0.04955663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965088,0.0000049357327,0.0005069623,0.0013816549,0.000949572,0.0006481244],"domain_scores_gemma":[0.99782133,0.00006146226,0.0003425562,0.0007560824,0.0009993319,0.000019226756],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00061308965,0.00055791193,0.00060883065,0.002419498,0.0003667097,0.0011009178,0.0019756395,0.0002482479,0.000043620505],"category_scores_gemma":[0.00009814099,0.00050031865,0.00011834385,0.005327557,0.00036593116,0.0010451426,0.00097126135,0.0004929004,0.00008883788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001348393,0.00007996587,0.00026895097,0.003185429,0.00004031108,0.000075031465,0.000042680917,0.26236194,0.0000024380554,0.0022112424,0.0006167047,0.7311018],"study_design_scores_gemma":[0.0005027334,0.0000047839258,0.0003738303,0.0031682374,0.00023256765,0.000004201349,0.0000011813905,0.68775547,0.000023187798,0.2914001,0.015342279,0.001191395],"about_ca_topic_score_codex":0.00008056575,"about_ca_topic_score_gemma":0.00007234053,"teacher_disagreement_score":0.8856697,"about_ca_system_score_codex":0.00019366664,"about_ca_system_score_gemma":0.0005174417,"threshold_uncertainty_score":0.99993604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015230701,0.000781371,0.98513174,0.00090508116,0.0032117125,0.0012177668,0.0000033418848,0.0003056816,0.008290973],"genre_scores_gemma":[0.75814325,0.00016965021,0.2296109,0.007688873,0.0010948558,0.00021816473,0.000021298038,0.00010012112,0.002952862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937748,0.00015942678,0.0008149944,0.002304445,0.0019311038,0.0010152332],"domain_scores_gemma":[0.99484247,0.00082969654,0.00038298115,0.002067633,0.0016888824,0.00018835618],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017873609,0.0007197255,0.0006794317,0.0018283824,0.0006873637,0.001042975,0.003447554,0.0004914953,0.000054529624],"category_scores_gemma":[0.00038393796,0.0007370837,0.00020978836,0.0017586404,0.00060605526,0.0015598537,0.0015582294,0.0011821974,0.00015406247],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012400794,0.00003377572,0.000008716346,0.00006160266,0.000017458704,0.0000617733,0.0008202333,0.09213904,0.0009891121,0.0189584,0.00005384399,0.8868436],"study_design_scores_gemma":[0.00015952245,0.00019077043,0.00003301209,0.0003534017,0.000018841176,0.000040491937,0.00000147225,0.7394938,0.027165348,0.22909278,0.002838475,0.0006120995],"about_ca_topic_score_codex":0.00021938585,"about_ca_topic_score_gemma":0.0005650847,"teacher_disagreement_score":0.88623154,"about_ca_system_score_codex":0.0014009099,"about_ca_system_score_gemma":0.0017384725,"threshold_uncertainty_score":0.99999404},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059909024,0.000329601,0.9916514,0.0005226256,0.00031807803,0.0003376748,0.000098639866,0.000029753648,0.000721325],"genre_scores_gemma":[0.9949881,0.00019496595,0.003754012,0.00047153054,0.00018628653,0.0000072529556,0.00012478846,0.0000011076064,0.000271948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990188,0.000019876872,0.00023809864,0.00039622549,0.00017987555,0.00014712788],"domain_scores_gemma":[0.99927646,0.00034592213,0.00016962047,0.000057894267,0.00012507239,0.000025034411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015816747,0.00016063203,0.0002172204,0.000040747447,0.00018552768,0.000028697104,0.0001795978,0.000109225126,0.000028260885],"category_scores_gemma":[0.000032023698,0.00007553805,0.000030108988,0.00021016836,0.00025776113,0.0000755583,0.000107356274,0.000142165,6.9711535e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052395862,0.00002923709,0.001253312,0.000036890986,0.000024724277,0.0000027108479,0.00025998373,0.3911696,0.0022768406,0.00671979,0.00009759413,0.59807694],"study_design_scores_gemma":[0.0007647816,0.00089659006,0.37348792,0.0015162174,0.000066422384,0.000009962671,0.0000124518465,0.5851886,0.0012370661,0.033029083,0.0024086875,0.0013821677],"about_ca_topic_score_codex":0.000016522814,"about_ca_topic_score_gemma":0.00019641039,"teacher_disagreement_score":0.9889972,"about_ca_system_score_codex":0.000035209563,"about_ca_system_score_gemma":0.000019146,"threshold_uncertainty_score":0.30803525},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026555225,0.0021619534,0.9674146,0.00016529378,0.00027579954,0.00032794414,0.00006571595,0.000007350522,0.0030261003],"genre_scores_gemma":[0.97519064,0.00017370399,0.024108198,0.00017900365,0.00017130721,0.000014461702,0.000053689168,0.000013187193,0.00009580548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998173,0.000019971996,0.00029900682,0.00094525964,0.00018316049,0.0003796266],"domain_scores_gemma":[0.99919355,0.000046307254,0.0001081003,0.00047364068,0.00012298711,0.00005540899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036233573,0.0003033371,0.00031431078,0.00021192429,0.00017983494,0.00008296674,0.000698137,0.0002562526,0.0000015133865],"category_scores_gemma":[0.00010768519,0.0002970646,0.00008397153,0.00029089095,0.00039089136,0.0000028285942,0.0005005749,0.00040067176,5.9600063e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010659088,0.00032184157,0.034771442,0.0008971837,0.00022588069,0.00008365849,0.0018604166,0.36476994,0.10377726,0.0054891715,0.00006197524,0.48763463],"study_design_scores_gemma":[0.00392097,0.0012690049,0.030041633,0.0037917732,0.00028342791,0.00027353287,0.000015961925,0.46268713,0.13763957,0.34076032,0.010570662,0.008746019],"about_ca_topic_score_codex":0.000028532726,"about_ca_topic_score_gemma":0.00018409734,"teacher_disagreement_score":0.9486354,"about_ca_system_score_codex":0.00008790828,"about_ca_system_score_gemma":0.00043447234,"threshold_uncertainty_score":0.99994814},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021146309,0.0033582454,0.98900825,0.0015381769,0.0017167254,0.0008864177,0.00011743182,0.000064297914,0.003098976],"genre_scores_gemma":[0.7834871,0.00075436267,0.10447386,0.019863253,0.0024304194,0.00039720323,0.00058565655,0.00021844234,0.087789714],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997869,0.000058980917,0.00036608535,0.0007825386,0.0001415441,0.00078184827],"domain_scores_gemma":[0.997887,0.0012014098,0.00014960508,0.0005881803,0.00014223052,0.0000315657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001058722,0.000338757,0.00039215802,0.00034452186,0.0006565424,0.00017639123,0.0016553313,0.00036382338,0.000053729495],"category_scores_gemma":[0.0002317662,0.00023696997,0.0001480301,0.0001859265,0.0012877394,0.00013501564,0.00090508116,0.00085625035,0.00006625534],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016830486,0.000021851978,0.00004485941,0.00019321535,0.00015217908,0.000031667107,0.001397231,0.020084593,0.053462137,0.0021675103,0.00045336972,0.9218231],"study_design_scores_gemma":[0.0035897903,0.0013427868,0.00037198895,0.0027145743,0.00014586175,0.0004103699,0.000013265724,0.08450175,0.02287027,0.0595568,0.8215203,0.002962184],"about_ca_topic_score_codex":0.00006621624,"about_ca_topic_score_gemma":0.00027576406,"teacher_disagreement_score":0.9188609,"about_ca_system_score_codex":0.00020269999,"about_ca_system_score_gemma":0.000605429,"threshold_uncertainty_score":0.9663355},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02988238,0.0014358914,0.96279645,0.002054415,0.00035828858,0.00053764135,0.000046016732,0.000107161126,0.002781775],"genre_scores_gemma":[0.48817664,0.00027911592,0.5070875,0.0034703815,0.00038467319,0.000011925069,0.000008846928,0.000031426513,0.000549449],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977073,0.0001749951,0.00060026924,0.00077270926,0.000410046,0.0003346897],"domain_scores_gemma":[0.9882863,0.010337762,0.00031903532,0.00079112954,0.00017871124,0.00008705551],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003399841,0.0003294525,0.0008884359,0.0001189072,0.00017842297,0.000030223022,0.00087357877,0.00029230246,0.000019984045],"category_scores_gemma":[0.0070239785,0.0002557986,0.00008351074,0.00020344286,0.0014913692,0.00009664475,0.0013839045,0.0007264937,0.0000010769171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009717788,0.00018277399,0.012358586,0.0016690495,0.000120534576,0.00005022585,0.0015482459,0.002057065,0.00017920934,0.24868326,0.00043044164,0.7326234],"study_design_scores_gemma":[0.00013041626,0.00011899852,0.0072422116,0.00045687586,0.000024951141,0.0000050374624,3.3371538e-7,0.009422469,0.00016818917,0.981853,0.00031658454,0.0002609325],"about_ca_topic_score_codex":0.00016628865,"about_ca_topic_score_gemma":0.00032534386,"teacher_disagreement_score":0.73316973,"about_ca_system_score_codex":0.00016226528,"about_ca_system_score_gemma":0.00024074977,"threshold_uncertainty_score":0.99998945},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006362899,0.0000656196,0.99193186,0.0009907925,0.0005174273,0.0009982821,0.00006714752,0.00008320293,0.0052820425],"genre_scores_gemma":[0.12394037,0.000033304634,0.86521107,0.004114483,0.000972582,0.00029522693,0.00008488077,0.00009666726,0.0052514216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836975,0.000010285635,0.0003309758,0.00064647134,0.00034967106,0.00029281797],"domain_scores_gemma":[0.9965744,0.0022921453,0.00013421965,0.0007229459,0.00020411031,0.000072149516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004231016,0.0002823841,0.0003778622,0.00048938696,0.00027149235,0.0000994856,0.0005615037,0.0002141431,0.000027471944],"category_scores_gemma":[0.00025509298,0.00023929779,0.00019079934,0.0003012103,0.00020515548,0.00005854548,0.00006978335,0.0003494886,0.000010830115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014223033,0.0003438279,0.000029259514,0.0005075931,0.000062988285,0.000015196961,0.00020576491,0.07402553,0.0002238952,0.60389733,0.0029212732,0.31762508],"study_design_scores_gemma":[0.00073241524,0.0001044469,0.000008143375,0.0002703614,0.00004514768,0.0000020166954,1.000688e-7,0.42074704,0.00026906095,0.56478274,0.012763412,0.00027510908],"about_ca_topic_score_codex":0.0000054770535,"about_ca_topic_score_gemma":0.000027245502,"teacher_disagreement_score":0.34672153,"about_ca_system_score_codex":0.00008176625,"about_ca_system_score_gemma":0.0002564859,"threshold_uncertainty_score":0.97582805},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019595498,0.00017064327,0.99173075,0.0027759762,0.0015346928,0.0011961168,0.00001778053,0.00023310457,0.0023389715],"genre_scores_gemma":[0.0007362521,0.00002677177,0.99420446,0.0022114627,0.0002440981,0.00004155806,0.000015273336,0.000030612802,0.0024895389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959214,0.00003370174,0.00060223456,0.001662816,0.00093717495,0.00084268773],"domain_scores_gemma":[0.9967667,0.0008612936,0.00019895147,0.0012691183,0.0006531615,0.00025079117],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009442806,0.0005101527,0.00055915484,0.0006748981,0.00046452595,0.00081728597,0.003488687,0.0003746995,0.00003004057],"category_scores_gemma":[0.0003349955,0.0004739673,0.00017915382,0.0007933427,0.00075060426,0.0004474424,0.0013775066,0.0007131276,0.000030818428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013069701,0.00005203017,0.000004629363,0.000104477615,0.000021447837,0.000021817315,0.00059928367,0.23465668,0.000026328298,0.06645515,0.00021475345,0.6978303],"study_design_scores_gemma":[0.00046230486,0.00021083323,0.0000058533224,0.0002515119,0.0000062753325,0.000010636482,1.02366506e-7,0.92982006,0.00012396327,0.060279056,0.008357897,0.0004714899],"about_ca_topic_score_codex":0.000011106468,"about_ca_topic_score_gemma":0.00002368372,"teacher_disagreement_score":0.69735885,"about_ca_system_score_codex":0.00021917872,"about_ca_system_score_gemma":0.001638609,"threshold_uncertainty_score":0.9997712},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020149242,0.000069330905,0.96232,0.00079843355,0.001531174,0.00025933588,0.000018288878,0.00006481041,0.03491844],"genre_scores_gemma":[0.53399885,0.00003199727,0.35992497,0.0072637135,0.0010757332,0.00005598806,0.000013660219,0.00006023718,0.09757485],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606264,0.00005113971,0.00071594137,0.001416698,0.0013990141,0.00035459021],"domain_scores_gemma":[0.9952538,0.0023792495,0.00034742017,0.0015508237,0.00033874807,0.00012998436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024244154,0.0003213405,0.00044332634,0.0010167776,0.00044118657,0.00050944265,0.0027837248,0.0002677321,0.0004633934],"category_scores_gemma":[0.0009935576,0.00025491917,0.00014195153,0.0009316654,0.000868879,0.00020634037,0.00075303926,0.000535904,0.00047551663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049252744,0.000009892744,0.0000026249227,0.0000040044265,0.0000029496384,0.000012085071,0.0000842634,0.0029096047,0.00007680119,0.34614247,0.00012463912,0.65062577],"study_design_scores_gemma":[0.00007394302,0.000045340166,0.000019173829,0.00008552774,0.000007818659,0.000023158602,4.1025731e-7,0.026814435,0.0007308235,0.9541575,0.017783586,0.0002582814],"about_ca_topic_score_codex":0.0000026969685,"about_ca_topic_score_gemma":0.000028003135,"teacher_disagreement_score":0.65036744,"about_ca_system_score_codex":0.00013512254,"about_ca_system_score_gemma":0.0004777292,"threshold_uncertainty_score":0.9999903},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027151758,0.00018929622,0.99239814,0.00007183649,0.0009693768,0.0003703283,0.000007298429,0.0019229553,0.0040435954],"genre_scores_gemma":[0.33663616,0.0000015619898,0.66280216,0.00029069497,0.000081213395,0.000012215786,0.0000013174484,0.000018868413,0.00015581411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662435,0.000028038252,0.00070899416,0.0012839478,0.0008227234,0.0005319577],"domain_scores_gemma":[0.99475896,0.0023117189,0.00047576136,0.0018089298,0.0005298698,0.000114762755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010071301,0.00049668207,0.0006983757,0.0011596454,0.00018316657,0.00033336424,0.003575028,0.00030817586,7.7921504e-7],"category_scores_gemma":[0.00086489855,0.00047127114,0.00011632482,0.0008961285,0.0005598132,0.00020561126,0.0010371306,0.0005913867,0.0000038221942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038098804,0.00003789379,0.0003846872,0.00044742186,0.000008215586,0.00007167979,0.00013983417,0.4906715,0.00012293103,0.0036821833,0.00016112193,0.50426877],"study_design_scores_gemma":[0.00010505413,0.00013911481,0.000030734926,0.0024099604,0.000008785958,0.00001997445,8.419861e-9,0.8671281,0.00041947514,0.12933499,0.000023653836,0.00038018645],"about_ca_topic_score_codex":0.00004941311,"about_ca_topic_score_gemma":0.000003540531,"teacher_disagreement_score":0.50388855,"about_ca_system_score_codex":0.0002126699,"about_ca_system_score_gemma":0.0017253853,"threshold_uncertainty_score":0.9997739},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015768493,0.00048489426,0.9651918,0.0017856045,0.00058624696,0.0012652872,0.0001440984,0.0001618733,0.014611704],"genre_scores_gemma":[0.9482825,0.0000651294,0.045847457,0.0009516025,0.0012614449,0.00006794053,0.00034348405,0.0000051879156,0.003175252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835074,0.000016474189,0.000254874,0.00080065493,0.0003077277,0.00026950074],"domain_scores_gemma":[0.9992546,0.00014288422,0.00016123337,0.00018276036,0.00018743551,0.000071094335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024914884,0.0002464519,0.00023540392,0.000075188436,0.00033490616,0.00017213688,0.0005175337,0.00021961088,0.000046893976],"category_scores_gemma":[0.000021958027,0.000111914,0.00006105122,0.0005481748,0.000196812,0.00010279853,0.0001550772,0.0002724295,0.000020631842],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001884837,0.000047915593,0.00015748407,0.000022202634,0.000014226666,0.0000020205628,0.00013453292,0.014838292,0.07393703,0.0006357725,0.0000031193522,0.91018856],"study_design_scores_gemma":[0.0017905082,0.0032860758,0.07813105,0.0009410698,0.00024844258,0.0003126572,0.0000091155425,0.5543277,0.021368986,0.1918016,0.1426749,0.0051078796],"about_ca_topic_score_codex":0.000047563088,"about_ca_topic_score_gemma":0.0009090098,"teacher_disagreement_score":0.932514,"about_ca_system_score_codex":0.00020445461,"about_ca_system_score_gemma":0.00010529457,"threshold_uncertainty_score":0.45637205},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1538208,0.0032777588,0.8379067,0.000079101505,0.001246545,0.0004664491,0.00010233494,0.000005858704,0.0030944129],"genre_scores_gemma":[0.82567424,0.0002500866,0.17364202,0.000095571864,0.00023013761,0.000008499835,0.000017500888,0.000008652886,0.00007332502],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989287,0.0000075624985,0.000259766,0.0004976593,0.00010474848,0.0002015605],"domain_scores_gemma":[0.9993352,0.00009629911,0.00015993736,0.00024075322,0.00014144946,0.000026354988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001645328,0.00019313149,0.0002455773,0.00012353831,0.00010458339,0.000025539397,0.0003587753,0.00015467241,0.0000013116014],"category_scores_gemma":[0.000055733577,0.0001827336,0.00009828331,0.000056497538,0.0004556893,0.0000016708257,0.00017967536,0.000089261644,1.8118817e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031740252,0.0000093735425,0.0012834354,0.00008785636,0.00002632711,0.000001039156,0.000121666424,0.0064968024,0.358794,0.00022499097,0.000012677799,0.6329101],"study_design_scores_gemma":[0.0007459689,0.0007595667,0.00071896164,0.0005030431,0.00004462866,0.000023781655,0.0000063055236,0.021581871,0.94161814,0.03162593,0.0016469068,0.00072490616],"about_ca_topic_score_codex":0.00001584655,"about_ca_topic_score_gemma":0.00019124447,"teacher_disagreement_score":0.6718534,"about_ca_system_score_codex":0.000019242838,"about_ca_system_score_gemma":0.00020334123,"threshold_uncertainty_score":0.745166},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2651528,0.0013651251,0.7061503,0.012322252,0.006766774,0.003981004,0.0013686416,0.00040096295,0.0024921556],"genre_scores_gemma":[0.7888421,0.00044166896,0.1916918,0.010766452,0.003848062,0.00011157545,0.0004992024,0.000019283681,0.0037798642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983112,0.000014197425,0.00025217928,0.0007890047,0.00026304412,0.00037035331],"domain_scores_gemma":[0.9991417,0.0005046987,0.00007298581,0.00010194105,0.00008119324,0.000097493845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015988173,0.00030476885,0.00030741433,0.000081489554,0.00029578782,0.00022322638,0.00040853105,0.00019930425,0.000027306809],"category_scores_gemma":[0.000017882232,0.00014413551,0.00010396484,0.00021447132,0.00023723097,0.000088666944,0.000099399964,0.00020507202,0.0000029075898],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010758785,0.00003410294,0.0000356518,0.000015790441,0.000011229506,0.000007907123,0.00018129531,0.00015668067,0.0098461015,0.00021641792,0.0000093303515,0.9894747],"study_design_scores_gemma":[0.0065780203,0.019440047,0.035478722,0.0067037437,0.0006946912,0.00041351435,0.00001742869,0.427428,0.10774036,0.21287864,0.17108168,0.011545151],"about_ca_topic_score_codex":0.000032518547,"about_ca_topic_score_gemma":0.00022336147,"teacher_disagreement_score":0.9779296,"about_ca_system_score_codex":0.00007896127,"about_ca_system_score_gemma":0.000057168323,"threshold_uncertainty_score":0.5877676},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33294997,0.06173959,0.586615,0.0007272937,0.004630483,0.0010587501,0.0001325135,0.0000234834,0.012122899],"genre_scores_gemma":[0.9762355,0.0024281836,0.019713702,0.00038492342,0.0005749231,0.0000075875696,0.00001019053,0.000018232004,0.0006267637],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987727,0.000010660611,0.00018407157,0.0007045299,0.00008464601,0.00024343363],"domain_scores_gemma":[0.999416,0.000032072294,0.00008197425,0.0003479357,0.00007299487,0.000049058905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013609785,0.00026810003,0.00023324548,0.00013623902,0.00011717197,0.000052413645,0.00030501615,0.00019422913,0.0000041949584],"category_scores_gemma":[0.000018738108,0.0002292067,0.000057037498,0.00006818169,0.0005629005,0.0000010640672,0.0003671119,0.00014468003,8.568064e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009674623,0.0000055834867,0.0012839072,0.000028441815,0.0000335125,0.0000018922794,0.00010180554,0.000956069,0.046568338,0.000139313,0.000016150532,0.9508553],"study_design_scores_gemma":[0.0033929034,0.0037949525,0.040212322,0.0017470076,0.00022395131,0.000984561,0.000017536662,0.0236851,0.45114294,0.33513203,0.13260669,0.007060036],"about_ca_topic_score_codex":0.000007746581,"about_ca_topic_score_gemma":0.000100537305,"teacher_disagreement_score":0.94379526,"about_ca_system_score_codex":0.000022221373,"about_ca_system_score_gemma":0.00017079499,"threshold_uncertainty_score":0.9346778},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037059276,0.00010399105,0.99108946,0.00046762533,0.0005986723,0.00091560767,0.0000041837357,0.00025442828,0.0028601158],"genre_scores_gemma":[0.55504364,0.000012855596,0.44317052,0.0009787931,0.00014666798,0.000023015304,0.000021352365,0.000023976765,0.0005791657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99483997,0.00015832852,0.00067187235,0.0026900223,0.0010087442,0.0006310627],"domain_scores_gemma":[0.99642855,0.0005370273,0.00025340947,0.002074724,0.0003526818,0.0003536135],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020022783,0.0005524621,0.0006377014,0.0007020242,0.00052150036,0.0009042854,0.0028460664,0.00035845375,0.000009262714],"category_scores_gemma":[0.00023914743,0.00051315327,0.0000939298,0.0006505515,0.00054502615,0.0007533061,0.002452664,0.0011431999,0.0000121600715],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012255344,0.00014113168,0.0004220759,0.000093431125,0.0000060710113,0.000007954408,0.002248604,0.0066077304,0.00043444743,0.007899589,0.000008890102,0.98211783],"study_design_scores_gemma":[0.00050726027,0.0022411544,0.013070758,0.00031669028,0.00003128133,0.00010068812,0.000009131225,0.93628025,0.0010106316,0.039180946,0.0053630075,0.0018882147],"about_ca_topic_score_codex":0.00010135163,"about_ca_topic_score_gemma":0.00008983329,"teacher_disagreement_score":0.9802296,"about_ca_system_score_codex":0.00038285897,"about_ca_system_score_gemma":0.0005976862,"threshold_uncertainty_score":0.999732},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012638962,0.0007717786,0.990501,0.0030721803,0.0043211696,0.00042499244,0.000005755715,0.00013339949,0.00075709005],"genre_scores_gemma":[0.02369673,0.000078786754,0.96115524,0.008903639,0.0012369455,0.000040304403,0.0000072516555,0.00003229696,0.00484882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974897,0.000024270215,0.0004006491,0.0011231534,0.00048767545,0.00047456427],"domain_scores_gemma":[0.99778837,0.00062905863,0.00022522183,0.0008939623,0.000411709,0.000051697596],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00083078234,0.0003772143,0.00034375137,0.00041496454,0.00081259554,0.0012188711,0.0022571252,0.00022442607,0.0000103837465],"category_scores_gemma":[0.00013090279,0.00027067465,0.00015008771,0.00035662038,0.0006017363,0.0007018863,0.0007521647,0.0006035706,0.000010356831],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000297552,0.0000057774605,0.000019157595,0.000069074704,0.000010327243,0.0000053153904,0.00016347115,0.0051522423,0.000253661,0.0029059371,0.000545663,0.9908664],"study_design_scores_gemma":[0.00024728844,0.000054710556,0.000014475945,0.00033849492,0.000015889369,0.000057858266,2.1537376e-7,0.957329,0.0056626443,0.031208843,0.0046873866,0.0003832158],"about_ca_topic_score_codex":0.000011024239,"about_ca_topic_score_gemma":0.000006032863,"teacher_disagreement_score":0.99048316,"about_ca_system_score_codex":0.00015190053,"about_ca_system_score_gemma":0.0008503333,"threshold_uncertainty_score":0.99997455},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029667586,0.0007979687,0.97268623,0.0005880801,0.0036008765,0.00039257502,0.0000024540127,0.00017799971,0.021724133],"genre_scores_gemma":[0.20353185,0.0002745993,0.7816688,0.0051464844,0.0021923352,0.00007009226,0.000020377034,0.0000616425,0.007033868],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952949,0.00011302686,0.00076242385,0.0019856328,0.00082381844,0.0010201863],"domain_scores_gemma":[0.99685,0.0009669575,0.00024341966,0.0015297786,0.00025069696,0.00015912543],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015164211,0.00058098265,0.0006904757,0.0014536513,0.00021764604,0.00074690965,0.0061605745,0.0005108723,0.00001673101],"category_scores_gemma":[0.0005002729,0.0005137148,0.00015146505,0.0031464838,0.0007514059,0.0005240028,0.002464611,0.001327488,0.000098692566],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004391782,0.00008775641,0.00009714664,0.00005634223,0.000004184598,0.00016000007,0.0011605788,0.018630153,0.000015492087,0.121015206,0.00015550204,0.85861325],"study_design_scores_gemma":[0.000056449524,0.00010157785,0.000100174475,0.00037151267,0.0000032131848,0.00002058724,3.4010398e-7,0.41548598,0.0009030165,0.58094364,0.0014939101,0.00051959354],"about_ca_topic_score_codex":0.000034759265,"about_ca_topic_score_gemma":0.00050397275,"teacher_disagreement_score":0.8580937,"about_ca_system_score_codex":0.000812008,"about_ca_system_score_gemma":0.002888725,"threshold_uncertainty_score":0.9997314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011188269,0.00011908352,0.96358496,0.0012579379,0.0010927763,0.00066630275,0.000014604331,0.00020401906,0.03294842],"genre_scores_gemma":[0.26772386,0.0003930131,0.5835063,0.015497134,0.0012385121,0.00008732714,0.000057282916,0.00013471713,0.13136186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952473,0.00004295739,0.0005913614,0.0013213007,0.0018808515,0.0009162498],"domain_scores_gemma":[0.9968086,0.0005956683,0.00018302166,0.0013615101,0.00079979136,0.00025144496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012675235,0.00051828433,0.0005109344,0.001507758,0.00054168614,0.00089981616,0.0039846073,0.00042941776,0.00011406779],"category_scores_gemma":[0.00023907631,0.00046543957,0.00017918325,0.0019228294,0.0006262839,0.0011501416,0.0021767505,0.0015226216,0.00028406322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005217528,0.00008245281,0.00019691899,0.00023223255,0.000035951314,0.00029207952,0.004351151,0.012264246,0.000076628756,0.20550698,0.00046638786,0.7764428],"study_design_scores_gemma":[0.0011812977,0.0010017905,0.0008599959,0.0011616984,0.000019487577,0.00011395619,0.0000013620743,0.84665585,0.014715829,0.08912531,0.042931788,0.0022316668],"about_ca_topic_score_codex":0.00009322393,"about_ca_topic_score_gemma":0.00006060042,"teacher_disagreement_score":0.8343916,"about_ca_system_score_codex":0.00070375827,"about_ca_system_score_gemma":0.0022256395,"threshold_uncertainty_score":0.99977976},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043328622,0.00027402389,0.9944112,0.00066632684,0.00048248263,0.001831234,0.000023800962,0.000068363755,0.0018092982],"genre_scores_gemma":[0.70984286,0.000019924642,0.28884834,0.0008134608,0.0001557615,0.000111016,0.000016324238,0.000017842529,0.00017444072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605614,0.000085517946,0.0006915214,0.0013685675,0.0013276685,0.00047056426],"domain_scores_gemma":[0.9950748,0.0012289112,0.00037466295,0.0017865489,0.0013966406,0.00013845593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036723232,0.00037681943,0.0005185664,0.0005668694,0.0001523716,0.0002158883,0.002498748,0.00031133532,0.000024281135],"category_scores_gemma":[0.001119819,0.00034725014,0.00017817898,0.0007308598,0.0005518083,0.00044714214,0.0006065327,0.0003137003,0.000007267028],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011891224,0.00006092737,0.000010465447,0.0000977603,0.000009199083,2.9846214e-7,0.0008452979,0.008684308,0.00010984399,0.02053573,0.000051909574,0.9695824],"study_design_scores_gemma":[0.0005817,0.00020310428,0.0005307629,0.0005766461,0.000025487469,0.0000031229085,4.4654612e-7,0.79335845,0.0026317632,0.2011757,0.00056146405,0.00035135247],"about_ca_topic_score_codex":0.000048319358,"about_ca_topic_score_gemma":0.000076125114,"teacher_disagreement_score":0.969231,"about_ca_system_score_codex":0.0004678425,"about_ca_system_score_gemma":0.001710007,"threshold_uncertainty_score":0.99989796},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032962544,0.014244333,0.9800727,0.0017567417,0.0009829856,0.00040811184,0.000007523823,0.0001448587,0.0023498032],"genre_scores_gemma":[0.12209619,0.0002962087,0.8710409,0.004531105,0.00016020257,0.0000129696455,0.0000027021342,0.000030591873,0.0018291812],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969254,0.000084499145,0.0005933415,0.0010706467,0.0008663595,0.00045972006],"domain_scores_gemma":[0.99727124,0.00042731728,0.00035085084,0.0016845074,0.00020995617,0.000056147124],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011670263,0.0004256981,0.00056513416,0.00079575233,0.00014627962,0.00022398433,0.006201923,0.0003158913,0.000016712687],"category_scores_gemma":[0.00024798737,0.00029885292,0.00015672296,0.0015276211,0.0004974044,0.00039058036,0.0034970597,0.0014124573,0.000004287678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054964034,0.000043386794,0.00037822544,0.00030578146,0.000009483058,0.000053584434,0.000576452,0.0007227165,0.00034446485,0.15345173,0.00015068005,0.843958],"study_design_scores_gemma":[0.00033219965,0.00008550061,0.00053334195,0.00476517,0.000013223009,0.00003555406,1.3806385e-7,0.13270545,0.015480128,0.843108,0.0021760315,0.00076527963],"about_ca_topic_score_codex":0.00013753964,"about_ca_topic_score_gemma":0.00034116238,"teacher_disagreement_score":0.8431927,"about_ca_system_score_codex":0.000259537,"about_ca_system_score_gemma":0.0006939122,"threshold_uncertainty_score":0.99994636},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030539245,0.0014056901,0.99140906,0.0012444708,0.00108157,0.0007042923,0.000034738645,0.00010419464,0.00096207624],"genre_scores_gemma":[0.6199192,0.00013323438,0.37728822,0.0020573563,0.00024191223,0.0000159341,0.000031195406,0.00004158217,0.0002713584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952636,0.0000927183,0.00080411264,0.0023909316,0.0005245759,0.00092406734],"domain_scores_gemma":[0.9962293,0.0013214534,0.0003141472,0.0018673588,0.00007479839,0.00019297676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001964903,0.0006247374,0.0008843117,0.0007209357,0.00037740212,0.0009566665,0.0037824698,0.00029952638,0.0000066829048],"category_scores_gemma":[0.00007909927,0.0006522388,0.000062071114,0.00022511248,0.00045337342,0.00095367926,0.0064706258,0.0010626877,6.756419e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037210993,0.000060998373,0.0025408578,0.0005056083,0.00006970559,0.00029948718,0.003674624,0.072191626,0.000028975313,0.07996215,0.0002384801,0.84039026],"study_design_scores_gemma":[0.0005291686,0.000050469687,0.00050354446,0.0008274988,0.000012989266,0.00011608514,0.0000013761096,0.8367494,0.000010449669,0.16018596,0.00048398686,0.0005290726],"about_ca_topic_score_codex":0.00027575475,"about_ca_topic_score_gemma":0.00095919846,"teacher_disagreement_score":0.8398612,"about_ca_system_score_codex":0.00021332227,"about_ca_system_score_gemma":0.00025379984,"threshold_uncertainty_score":0.9995929},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003663342,0.00045761818,0.99103034,0.000059874954,0.0010639952,0.00020005011,0.0000070196506,0.001064049,0.0024536883],"genre_scores_gemma":[0.9444051,0.00014785452,0.05448251,0.00019185912,0.00020260159,0.0000091351585,0.000004912116,0.000057563524,0.00049846293],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983442,0.0000036017711,0.0002889625,0.0006274806,0.0003208125,0.00041494245],"domain_scores_gemma":[0.99896497,0.00019015752,0.000054585358,0.0006684329,0.000081111226,0.00004075373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006837926,0.0003875131,0.00035014816,0.00038625186,0.00007678561,0.00008310108,0.0008191807,0.00048740444,0.000011677721],"category_scores_gemma":[0.00006164771,0.00038838762,0.00007441106,0.000404717,0.0003185456,0.00014738944,0.00031867807,0.0009100718,0.000019014464],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019056477,0.0000033370093,0.000006180597,0.00013373666,0.000008528708,0.000030226336,0.00002533097,0.2776926,0.02619882,0.0005607032,0.0000072885123,0.6953314],"study_design_scores_gemma":[0.00014307574,0.000029166498,0.00002549978,0.0004476925,0.00001071721,0.000024800607,1.9177993e-7,0.33505863,0.5755853,0.085274614,0.0027119957,0.00068830675],"about_ca_topic_score_codex":0.000003975909,"about_ca_topic_score_gemma":0.000046509555,"teacher_disagreement_score":0.9407418,"about_ca_system_score_codex":0.0004395865,"about_ca_system_score_gemma":0.000022086084,"threshold_uncertainty_score":0.9998568},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003459318,0.00024310383,0.9959596,0.00028149685,0.00094561506,0.0003844729,0.000022660104,0.0002097743,0.0019186925],"genre_scores_gemma":[0.17304736,0.000059209033,0.8166482,0.0059085977,0.00058203156,0.000020427535,0.00010989446,0.00007968802,0.003544626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562013,0.000043925087,0.00070781953,0.0017659448,0.001053895,0.0008082629],"domain_scores_gemma":[0.99715024,0.00043875448,0.00046002123,0.0014077364,0.00033821608,0.00020501147],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008598524,0.00061883155,0.00074294605,0.00058125396,0.00043412443,0.0014496443,0.00364855,0.00029753827,0.000018573433],"category_scores_gemma":[0.00014781371,0.0005156518,0.00012051141,0.0010583267,0.0006190406,0.000808111,0.002346686,0.0008191861,0.000034603076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013458287,0.000087372304,0.00089581474,0.00012791915,0.00002194498,0.000060420876,0.0008646198,0.016942883,0.00006150296,0.009081889,0.00020059013,0.9716416],"study_design_scores_gemma":[0.00042502256,0.00017307785,0.00011193098,0.00048534077,0.000010686769,0.0000186045,8.499641e-7,0.9895553,0.00057708635,0.0022563075,0.0057277726,0.00065804116],"about_ca_topic_score_codex":0.000058308025,"about_ca_topic_score_gemma":0.00081352156,"teacher_disagreement_score":0.9726124,"about_ca_system_score_codex":0.0002509678,"about_ca_system_score_gemma":0.00068697054,"threshold_uncertainty_score":0.9997295},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012180226,0.00093554455,0.9832191,0.00011022196,0.0017650669,0.0005610368,0.0000061651467,0.00014155163,0.0010810783],"genre_scores_gemma":[0.9078404,0.0000843622,0.091116704,0.00023732024,0.00023534663,0.000030867122,0.000003987177,0.00001863179,0.00043243496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966938,0.000051304745,0.00046878634,0.0013487868,0.001032853,0.00040447965],"domain_scores_gemma":[0.99782693,0.00036698746,0.00027597215,0.0011563238,0.00028018263,0.000093627124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064825057,0.0003731949,0.0005818727,0.00058496336,0.00023514201,0.00055363757,0.0028406964,0.00017400316,0.000012051457],"category_scores_gemma":[0.00007528966,0.00034535766,0.00008763624,0.0011530659,0.00045007115,0.0006308567,0.0009209348,0.00053080404,0.000001949243],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024558034,0.00031650055,0.0032015187,0.00008165929,0.000037781498,0.0001865442,0.037983153,0.0030839841,0.00001905836,0.0009235333,0.000020094163,0.9541216],"study_design_scores_gemma":[0.0043431567,0.011622254,0.035131752,0.009949682,0.00021105872,0.0016349918,0.0004226586,0.7840594,0.0031220284,0.14276813,0.0005681088,0.0061667697],"about_ca_topic_score_codex":0.00058287237,"about_ca_topic_score_gemma":0.0072558974,"teacher_disagreement_score":0.94795483,"about_ca_system_score_codex":0.0001248357,"about_ca_system_score_gemma":0.00059443846,"threshold_uncertainty_score":0.99989986},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010258647,0.00021186653,0.9721743,0.005644446,0.0059472173,0.0003723132,0.0000048701822,0.000059828726,0.015482614],"genre_scores_gemma":[0.83575267,0.00026588785,0.11832058,0.019848553,0.0020865216,0.000076150965,0.00004549839,0.000114479815,0.02348966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626654,0.00006246542,0.0005584584,0.0015497556,0.000838699,0.0007240787],"domain_scores_gemma":[0.996665,0.00090647145,0.00032201133,0.0016013779,0.00039598893,0.000109178094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006927689,0.0005876285,0.00048904115,0.00054505013,0.00052538596,0.0009443275,0.004016692,0.00025548707,0.00003502588],"category_scores_gemma":[0.0001553244,0.0004531859,0.00026166084,0.00069363695,0.0005333532,0.0012985615,0.0018302597,0.0013700197,0.00013742624],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004574028,0.00010892694,0.00012963079,0.00010593464,0.000113815666,0.00017504465,0.0041048215,0.012968908,0.0035292634,0.06166506,0.0019202514,0.9151326],"study_design_scores_gemma":[0.0006731475,0.00042201934,0.0004922648,0.0023887535,0.000066334964,0.00024645284,0.0000075229946,0.70049673,0.023191424,0.18917947,0.08069526,0.002140629],"about_ca_topic_score_codex":0.00008346036,"about_ca_topic_score_gemma":0.00011893064,"teacher_disagreement_score":0.912992,"about_ca_system_score_codex":0.00060299505,"about_ca_system_score_gemma":0.00042883892,"threshold_uncertainty_score":0.999792},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057593097,0.0008167087,0.9920646,0.00052052934,0.0016662967,0.00023495071,0.0000012975562,0.0002532013,0.0043848413],"genre_scores_gemma":[0.8751412,0.000027107193,0.11554731,0.0025601068,0.00088172505,0.000011150342,0.000010618455,0.000030451445,0.005790311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948108,0.000090415226,0.00071178004,0.0019693186,0.0010607623,0.0013569085],"domain_scores_gemma":[0.9977634,0.0006053973,0.00033792228,0.0008701261,0.00029143752,0.00013171905],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015777624,0.000589941,0.0007241968,0.0011966566,0.00033033238,0.00093271345,0.0057350523,0.0003640832,0.000018442004],"category_scores_gemma":[0.00017943376,0.0005402307,0.00028890182,0.0020454228,0.00034610718,0.00050212,0.00179612,0.0015946839,0.000051358023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025430331,0.000041676012,0.000021069927,0.00006682369,0.000042691467,0.00007054233,0.00081686367,0.18336836,0.000010843858,0.31694883,0.00055673736,0.498053],"study_design_scores_gemma":[0.00014428535,0.00008232459,0.000011895077,0.00046110494,0.0000151752265,0.000027247983,1.493548e-7,0.9892833,0.00013818982,0.005827414,0.0034699244,0.0005389447],"about_ca_topic_score_codex":0.000012629554,"about_ca_topic_score_gemma":0.00024621806,"teacher_disagreement_score":0.8765173,"about_ca_system_score_codex":0.0010132391,"about_ca_system_score_gemma":0.0030299372,"threshold_uncertainty_score":0.9997049},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017376147,0.0012120507,0.98517567,0.000983247,0.00172887,0.00029427762,0.000015876452,0.00021469964,0.010357905],"genre_scores_gemma":[0.050421562,0.00036100915,0.9435874,0.0042141164,0.0011340511,0.000013205679,0.000034070774,0.000031679043,0.00020289526],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962944,0.00003903566,0.0005225036,0.0016623657,0.00086821266,0.00061348756],"domain_scores_gemma":[0.99702466,0.0005353185,0.00024046832,0.0018325853,0.00021397306,0.00015298437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010403668,0.0004760654,0.0004994748,0.0010295534,0.00033127062,0.00068667147,0.0038306657,0.00029601043,0.00002547464],"category_scores_gemma":[0.00012215831,0.0004537554,0.0001927322,0.0009802433,0.0004501231,0.0006920686,0.0023472067,0.00091482414,0.000033447966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024412084,0.000012435055,0.000038533464,0.00006043137,0.0000062356075,0.00005176266,0.00024250027,0.00078754546,0.000026172354,0.25581333,0.000086000466,0.7428726],"study_design_scores_gemma":[0.00034297278,0.00011707326,0.00021899783,0.0020337256,0.000017803211,0.00005934006,2.1144353e-7,0.31344128,0.00091932685,0.6606396,0.021033634,0.0011760612],"about_ca_topic_score_codex":0.00002318464,"about_ca_topic_score_gemma":0.000024106603,"teacher_disagreement_score":0.74169654,"about_ca_system_score_codex":0.0001907759,"about_ca_system_score_gemma":0.00047698242,"threshold_uncertainty_score":0.99979144},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005885583,0.00016393424,0.9906849,0.00049070653,0.0022776527,0.00022860932,0.0000032922553,0.00011500715,0.0054472866],"genre_scores_gemma":[0.81710064,0.000020094845,0.17063451,0.0015917534,0.0004961675,0.000008282722,0.000024590994,0.000026936941,0.010097042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599576,0.000040033123,0.0007734819,0.0016391203,0.00082623493,0.0007253634],"domain_scores_gemma":[0.9983911,0.0002656569,0.00024013316,0.00075023,0.00023527874,0.00011762617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064164546,0.0005118634,0.00065173936,0.0016295136,0.00021894675,0.00059701555,0.0031900837,0.00036893287,0.00011539665],"category_scores_gemma":[0.00006530954,0.00049559266,0.00025064035,0.0009667001,0.00030000016,0.00043131987,0.0012052259,0.0017359025,0.000024750716],"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.000014220195,0.00025706043,0.00051214895,0.00004484055,0.00008070022,0.0005177344,0.0032937427,0.3674418,0.000030276135,0.2023466,0.0003693307,0.42509153],"study_design_scores_gemma":[0.0002508738,0.00009509486,0.0003811117,0.00047910842,0.00001594082,0.000048588794,3.1878932e-7,0.99006057,0.000045312936,0.0044477303,0.0036185468,0.00055683043],"about_ca_topic_score_codex":0.003096625,"about_ca_topic_score_gemma":0.3849604,"teacher_disagreement_score":0.8200505,"about_ca_system_score_codex":0.0010075179,"about_ca_system_score_gemma":0.0015256547,"threshold_uncertainty_score":0.9997496},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027998436,0.00097637955,0.91595656,0.009331392,0.013098893,0.001025162,0.000031359068,0.00019211149,0.031389683],"genre_scores_gemma":[0.98988116,0.000020524263,0.0035726973,0.0025157062,0.001409144,0.00003195651,0.00004441617,0.000027538621,0.0024968747],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791425,0.0001636119,0.00045202914,0.0008158837,0.00038341296,0.00027081082],"domain_scores_gemma":[0.9984788,0.0007113806,0.0002191917,0.00036517114,0.0001749463,0.000050556784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034334155,0.00031116934,0.00034355713,0.00037438472,0.0007927968,0.000263972,0.0005626529,0.00038718272,0.0004231312],"category_scores_gemma":[0.00012785394,0.0002679243,0.00010083455,0.0003028442,0.00062059157,0.0001782063,0.000292794,0.0013407622,0.000026506981],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006237905,0.00011132273,0.0016900805,0.000022158696,0.000081794635,0.000037380818,0.07934864,0.007886282,0.00013418676,0.10230959,0.0005025344,0.80781364],"study_design_scores_gemma":[0.0026055903,0.0005453446,0.19400027,0.0037533774,0.00019727797,0.00008342367,0.00081878074,0.32025868,0.000021238582,0.47276726,0.002717861,0.0022309194],"about_ca_topic_score_codex":0.0013699725,"about_ca_topic_score_gemma":0.015100272,"teacher_disagreement_score":0.9618827,"about_ca_system_score_codex":0.0006650186,"about_ca_system_score_gemma":0.00021961497,"threshold_uncertainty_score":0.9999773},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026271806,0.0001231734,0.9886744,0.003267117,0.0015200075,0.0006090696,7.0893213e-7,0.00014863817,0.005630631],"genre_scores_gemma":[0.19928756,0.0000699934,0.78179306,0.012526786,0.0006280174,0.000044620472,0.000008455723,0.00005958553,0.005581906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954804,0.00013016156,0.00063647615,0.0014226915,0.0013902773,0.0009399636],"domain_scores_gemma":[0.99616146,0.0017261308,0.00020359959,0.0015789571,0.00019157154,0.00013827825],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016076448,0.00055684923,0.0005371438,0.0011991293,0.00033883916,0.0011857098,0.006637934,0.00027652056,0.000023486291],"category_scores_gemma":[0.0007167882,0.0004484074,0.00013883991,0.0013140196,0.00036912973,0.00047628066,0.002038803,0.0019436986,0.00008268622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036469091,0.00000972859,0.000068418696,0.000026684384,0.0000052106666,0.00006996774,0.002032591,0.88248706,0.000022800521,0.0141235385,0.000058886926,0.10109148],"study_design_scores_gemma":[0.0002492059,0.00025242337,0.000114776136,0.00059591915,0.000007519996,0.000026839129,0.0000015833994,0.9809591,0.0000957485,0.010274923,0.0068620252,0.0005599125],"about_ca_topic_score_codex":0.000023330958,"about_ca_topic_score_gemma":0.000022233813,"teacher_disagreement_score":0.20688131,"about_ca_system_score_codex":0.00042362712,"about_ca_system_score_gemma":0.00060774345,"threshold_uncertainty_score":0.99985117},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012429709,0.0005178447,0.9835911,0.00033050193,0.0020021347,0.00048448512,0.0000012873296,0.00020127717,0.00044167886],"genre_scores_gemma":[0.9895134,0.000029917383,0.008588163,0.00097015913,0.0005435249,0.000008555253,0.0000049863243,0.00004870641,0.00029256064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750644,0.000034265737,0.00053625135,0.0007825745,0.00040612434,0.000734348],"domain_scores_gemma":[0.9987863,0.0004396728,0.00010194806,0.0005256448,0.00004825395,0.00009822315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077038567,0.00046584193,0.00042257152,0.0004815385,0.00026499457,0.00014967479,0.00085162115,0.0001192293,0.000006962865],"category_scores_gemma":[0.00010218041,0.00038243033,0.00007804583,0.0006497153,0.00011520804,0.00007568598,0.0007402262,0.0016291796,0.000005016144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019532436,0.0000014517641,0.0000046919517,0.000030021149,0.000003974086,0.000027191805,0.0004967094,0.83836484,0.00040230475,0.00008675019,0.0000031589648,0.1605594],"study_design_scores_gemma":[0.00015079611,0.00010710493,0.000018400751,0.00062959304,0.0000046739533,0.00001337206,5.7633963e-7,0.99605066,0.002100257,0.00013309803,0.00040807354,0.00038338563],"about_ca_topic_score_codex":0.000010894498,"about_ca_topic_score_gemma":0.000044711887,"teacher_disagreement_score":0.97708374,"about_ca_system_score_codex":0.00040412368,"about_ca_system_score_gemma":0.000047808313,"threshold_uncertainty_score":0.9998628},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038883228,0.00004634355,0.95871925,0.0005708645,0.0009096501,0.00041834515,0.000030378354,0.000027462986,0.00039447146],"genre_scores_gemma":[0.9977053,0.000011235061,0.0014053894,0.00059912767,0.0000274595,0.000007363796,0.0000018610396,0.000016721,0.0002255527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980318,0.000037588594,0.00045760046,0.00073292607,0.0004609076,0.00027918108],"domain_scores_gemma":[0.9978699,0.0011936938,0.00029070288,0.00050173805,0.00009548224,0.000048492904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003222565,0.00027303374,0.00034893188,0.00037558482,0.00022501759,0.00005824862,0.00057958695,0.00011048297,0.000002784435],"category_scores_gemma":[0.0002878234,0.00020966398,0.000085761276,0.0004146963,0.00092302455,0.000100389596,0.00029893243,0.00050351856,5.728259e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027709846,0.000022460992,0.0000037529653,0.00008817273,0.000009615973,0.0000030134827,0.00014342327,0.87112147,0.016928136,0.008758829,0.0000013896216,0.10289205],"study_design_scores_gemma":[0.0001516994,0.00016519864,0.000019290952,0.00025470258,0.000036834314,0.00003253173,8.1701694e-7,0.98320735,0.0014546518,0.01451255,6.576292e-7,0.00016374957],"about_ca_topic_score_codex":0.000025951238,"about_ca_topic_score_gemma":0.000050778406,"teacher_disagreement_score":0.9588221,"about_ca_system_score_codex":0.00010543689,"about_ca_system_score_gemma":0.00016716283,"threshold_uncertainty_score":0.8549849},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009851834,0.00029007334,0.997254,0.0005189062,0.00057323946,0.00074509706,0.000047856105,0.00013248713,0.0003398029],"genre_scores_gemma":[0.024508923,0.000019418741,0.9721396,0.0013819841,0.00016679808,0.000030006711,0.00024264681,0.000037159847,0.0014734596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614793,0.00004796072,0.00074052886,0.0015261149,0.0009827312,0.0005547566],"domain_scores_gemma":[0.9966179,0.000318075,0.00039520467,0.0012273566,0.0013404398,0.00010103699],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022421398,0.0003699491,0.0004113035,0.0015503188,0.0005149848,0.0017340287,0.0021752862,0.00017023816,0.000006366783],"category_scores_gemma":[0.0004055427,0.00033143035,0.000072618255,0.0024517528,0.0003159968,0.0014971123,0.00084099197,0.00024768853,0.0000031515103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006287856,0.00008517827,0.00008523371,0.0001467537,0.000009073253,0.0000048985075,0.001042543,0.510316,0.00022904786,0.2529428,0.00011675727,0.23501542],"study_design_scores_gemma":[0.00040796364,0.00007119528,0.000012950501,0.0011630808,0.000010012501,0.0000049696723,0.0000013385693,0.9652693,0.0001698842,0.031800535,0.00071952713,0.00036921413],"about_ca_topic_score_codex":0.000023705066,"about_ca_topic_score_gemma":0.0004194507,"teacher_disagreement_score":0.4549533,"about_ca_system_score_codex":0.00029237554,"about_ca_system_score_gemma":0.0010340282,"threshold_uncertainty_score":0.99991375},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027075773,0.00006999313,0.96831113,0.000096589414,0.00039844328,0.0010669669,0.000051034654,0.000017697665,0.0029123952],"genre_scores_gemma":[0.81557614,0.000016918872,0.17856152,0.00050425436,0.000091939204,0.00003412511,0.000013391341,0.000010692214,0.0051910304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689144,0.000033680586,0.0008087572,0.00077100133,0.0012747421,0.00022035508],"domain_scores_gemma":[0.9973848,0.00097397016,0.00046396235,0.0005993595,0.00051892427,0.00005899042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022158076,0.00025832228,0.00055228296,0.0012773239,0.00019932313,0.00034098778,0.0010527795,0.00013469014,0.000018357156],"category_scores_gemma":[0.00020373851,0.00020319583,0.0000808464,0.00048157506,0.00031488235,0.0006204354,0.0005455479,0.0002482906,0.000005420915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016364783,0.00012662359,0.0010065446,0.000046751513,0.000029056151,0.0000028525212,0.011093258,0.10908143,0.000033169024,0.0059527033,0.00078838604,0.87167555],"study_design_scores_gemma":[0.0006626679,0.00048865314,0.00078210555,0.00013521021,0.000034349247,0.000001063886,0.0000243577,0.9200191,0.00004023118,0.07652652,0.0010297616,0.00025595925],"about_ca_topic_score_codex":0.00001176617,"about_ca_topic_score_gemma":0.00013704505,"teacher_disagreement_score":0.8714196,"about_ca_system_score_codex":0.000082969134,"about_ca_system_score_gemma":0.00017023513,"threshold_uncertainty_score":0.8286085},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033882334,0.000084209314,0.9967013,0.00018149705,0.0006139691,0.0005889195,0.0000018728161,0.00085749157,0.000936842],"genre_scores_gemma":[0.27117008,0.0000063452903,0.72806376,0.0002885043,0.00016866313,0.000022233171,0.000028549104,0.000014824826,0.00023704612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767905,0.000027435732,0.0006510218,0.000819696,0.00050222984,0.00032054714],"domain_scores_gemma":[0.9967081,0.0013754494,0.00050222175,0.0006699474,0.0006864301,0.000057867575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078502705,0.0003053526,0.0003662377,0.00079243333,0.00036006092,0.00028463826,0.0010075689,0.00022442556,0.0000037087837],"category_scores_gemma":[0.0012977102,0.00030879388,0.0001017792,0.0004859708,0.00023773703,0.00034447268,0.00030690644,0.00032977367,0.0000010449809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029999555,0.000020353204,0.00006149481,0.000092812734,0.000011468516,0.0000058799496,0.000579581,0.6813957,0.003762501,0.020989792,0.00011090377,0.29296654],"study_design_scores_gemma":[0.0001791612,0.00017484794,0.00001423682,0.0003668163,0.00001363987,0.000018023293,8.0269466e-8,0.9311112,0.010279783,0.057454478,0.000115021634,0.00027267172],"about_ca_topic_score_codex":0.000042722626,"about_ca_topic_score_gemma":0.00001701999,"teacher_disagreement_score":0.29269385,"about_ca_system_score_codex":0.0002799912,"about_ca_system_score_gemma":0.00062491524,"threshold_uncertainty_score":0.9999364},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007469635,0.0012691745,0.9962443,0.00017684264,0.0010395343,0.0005887228,0.000004019306,0.0003520662,0.00025065494],"genre_scores_gemma":[0.010245347,0.00010652237,0.9876337,0.00065250555,0.0003455698,0.00014674618,0.0000072691696,0.000020286647,0.0008420651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974544,0.00001721124,0.00037222926,0.0012346203,0.00045775186,0.00046375737],"domain_scores_gemma":[0.99767494,0.000628306,0.00012205025,0.0012842447,0.00017427192,0.00011619678],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052347675,0.00034545732,0.00040196045,0.0005707443,0.00021288368,0.00029451834,0.0020354504,0.0002490903,0.0000015440332],"category_scores_gemma":[0.00016683109,0.00031027416,0.00006623609,0.0011748226,0.0002604399,0.00049829,0.0011802991,0.00054172095,0.000010664887],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012085505,0.00001575691,0.00040561368,0.00034371897,0.000006077697,0.0000062074564,0.0002324375,0.034563113,0.00001597278,0.0011384792,0.000052070092,0.96321934],"study_design_scores_gemma":[0.0007059568,0.00018372179,0.0023970637,0.0021917599,0.000019219693,0.00010264798,2.758802e-7,0.8968854,0.0009805572,0.052353088,0.042468667,0.0017116299],"about_ca_topic_score_codex":0.000005052288,"about_ca_topic_score_gemma":0.00000702813,"teacher_disagreement_score":0.96150774,"about_ca_system_score_codex":0.00032980577,"about_ca_system_score_gemma":0.0010286586,"threshold_uncertainty_score":0.9999349},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001544321,0.0004923472,0.9941567,0.001738635,0.0011861038,0.00038400438,0.000012278297,0.00034995566,0.00013563392],"genre_scores_gemma":[0.30357718,0.00017146165,0.6921649,0.0037351984,0.00027370892,0.000012585562,0.0000040844134,0.000023713033,0.000037153262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721354,0.000027600394,0.00030560128,0.0011071478,0.0008657244,0.00048037225],"domain_scores_gemma":[0.9973374,0.0012759467,0.00011523232,0.001027907,0.00009963226,0.00014385325],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010013027,0.00042091214,0.0003807975,0.0007911678,0.0010098042,0.00045017764,0.0046694307,0.00024756393,0.0000038027295],"category_scores_gemma":[0.00036737832,0.000353783,0.00007082092,0.00081713026,0.00011141257,0.0006443152,0.12485444,0.0008523297,0.0000045583133],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011100663,0.00003534184,0.0011622501,0.00009884626,0.000028744811,0.00024148256,0.01433068,0.104416594,0.000040263876,0.006883417,0.00030468992,0.8724466],"study_design_scores_gemma":[0.0006614163,0.00028064582,0.0018354547,0.0029499375,0.000047850033,0.000026055517,0.0000045349934,0.76660186,0.00073972665,0.20653526,0.018200964,0.0021163197],"about_ca_topic_score_codex":0.00058727275,"about_ca_topic_score_gemma":0.00021345695,"teacher_disagreement_score":0.8703303,"about_ca_system_score_codex":0.00046434012,"about_ca_system_score_gemma":0.00017113822,"threshold_uncertainty_score":0.9998914},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016275032,0.0035286993,0.8597717,0.015821839,0.010351904,0.0013643827,0.000040886927,0.0004220818,0.107071],"genre_scores_gemma":[0.86555386,0.0055404208,0.102406844,0.01080856,0.0047825966,0.00007276088,0.000036497087,0.00013046562,0.010667982],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967162,0.000095934076,0.0003899535,0.00090569776,0.0011023327,0.00078988686],"domain_scores_gemma":[0.99760926,0.0010764227,0.00015029928,0.00047174824,0.00049709657,0.0001951815],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020378467,0.00038434117,0.00051641854,0.0008969855,0.0007243062,0.0010445382,0.0015599551,0.00068470824,0.000025704641],"category_scores_gemma":[0.0016280517,0.00036886017,0.00013842034,0.0012116439,0.0012962571,0.0014312019,0.00042443792,0.0018319553,0.000009425309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000116481,0.000038433107,0.00064967957,0.00013218865,0.000012526096,0.00021027248,0.075510286,0.0020178787,0.000009283236,0.22191681,0.00005846836,0.69943255],"study_design_scores_gemma":[0.000269927,0.000065953434,0.00049365114,0.0039197993,0.000011127203,0.0000024504166,0.000021827913,0.00066856376,0.00008050455,0.9796345,0.013923875,0.0009077966],"about_ca_topic_score_codex":0.0009375429,"about_ca_topic_score_gemma":0.011059088,"teacher_disagreement_score":0.86392635,"about_ca_system_score_codex":0.0005937372,"about_ca_system_score_gemma":0.0016354636,"threshold_uncertainty_score":0.9999925},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007469635,0.0012691745,0.9962443,0.00017684264,0.0010395343,0.0005887228,0.000004019306,0.0003520662,0.00025065494],"genre_scores_gemma":[0.010245347,0.00010652237,0.9876337,0.00065250555,0.0003455698,0.00014674618,0.0000072691696,0.000020286647,0.0008420651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974544,0.00001721124,0.00037222926,0.0012346203,0.00045775186,0.00046375737],"domain_scores_gemma":[0.99767494,0.000628306,0.00012205025,0.0012842447,0.00017427192,0.00011619678],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052347675,0.00034545732,0.00040196045,0.0005707443,0.00021288368,0.00029451834,0.0020354504,0.0002490903,0.0000015440332],"category_scores_gemma":[0.00016683109,0.00031027416,0.00006623609,0.0011748226,0.0002604399,0.00049829,0.0011802991,0.00054172095,0.000010664887],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012085505,0.00001575691,0.00040561368,0.00034371897,0.000006077697,0.0000062074564,0.0002324375,0.034563113,0.00001597278,0.0011384792,0.000052070092,0.96321934],"study_design_scores_gemma":[0.0007059568,0.00018372179,0.0023970637,0.0021917599,0.000019219693,0.00010264798,2.758802e-7,0.8968854,0.0009805572,0.052353088,0.042468667,0.0017116299],"about_ca_topic_score_codex":0.000005052288,"about_ca_topic_score_gemma":0.00000702813,"teacher_disagreement_score":0.96150774,"about_ca_system_score_codex":0.00032980577,"about_ca_system_score_gemma":0.0010286586,"threshold_uncertainty_score":0.9999349},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030875468,0.00039652592,0.9961643,0.00071779755,0.00039504888,0.00049609685,0.00002410868,0.00020658223,0.001568632],"genre_scores_gemma":[0.0955209,0.000025378107,0.9033495,0.0007728179,0.00010108555,0.00001792333,0.00013888496,0.000010805041,0.0000627126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766517,0.00004115904,0.0005574677,0.00057413324,0.000879641,0.00028242328],"domain_scores_gemma":[0.99740255,0.0003516532,0.0007340081,0.0009840877,0.0004858474,0.000041837775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008053008,0.0003223397,0.00028586618,0.0007059004,0.0003040497,0.00075468724,0.0020136402,0.00021027995,0.000006223973],"category_scores_gemma":[0.00019188577,0.00022139392,0.00004745437,0.00084765314,0.00034359173,0.003070156,0.00053265685,0.0006170848,0.0000033138097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015189332,0.000011978713,0.000012287314,0.00011442451,0.0000111718755,0.0000065541367,0.0013589512,0.0034885176,0.0005427113,0.033745117,0.000091213115,0.96060187],"study_design_scores_gemma":[0.00037983284,0.00029917294,0.0001944369,0.0016909882,0.000033859957,0.00008934743,0.0000018279221,0.8475103,0.030488586,0.115825266,0.002758817,0.00072759006],"about_ca_topic_score_codex":0.00008447117,"about_ca_topic_score_gemma":0.000067228335,"teacher_disagreement_score":0.9598743,"about_ca_system_score_codex":0.00024245986,"about_ca_system_score_gemma":0.00062581385,"threshold_uncertainty_score":0.9028182},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016122779,0.0002493087,0.99499464,0.00014832355,0.0006895239,0.00061218854,0.000008393351,0.00015185056,0.0015335032],"genre_scores_gemma":[0.66960603,0.00022624768,0.3295217,0.00032110343,0.000029124782,0.00006101807,0.000013243044,0.000016425127,0.0002051429],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996973,0.00005212763,0.0006794402,0.0011677938,0.0007463692,0.00038129135],"domain_scores_gemma":[0.9979084,0.00018675101,0.0003511863,0.0012232373,0.00026390926,0.000066516506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009314404,0.000336554,0.00047006234,0.0024958001,0.00008088685,0.00023148804,0.0031302536,0.00033987212,0.000016623722],"category_scores_gemma":[0.000077863,0.00035314527,0.00013035258,0.0014511574,0.0005612122,0.0010590934,0.00095271936,0.00061787904,0.0000107134565],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003864444,0.00008921706,0.0007984643,0.00006896493,0.0000059927634,0.000046367768,0.0001639529,0.000081731094,0.0010567402,0.014704327,0.0000073489155,0.98297304],"study_design_scores_gemma":[0.0008520283,0.0004929537,0.031660937,0.0023296406,0.000041954838,0.0000657322,4.1213724e-7,0.106936716,0.017727198,0.8381014,0.00026224027,0.0015287981],"about_ca_topic_score_codex":0.00006942087,"about_ca_topic_score_gemma":0.00029783996,"teacher_disagreement_score":0.98144424,"about_ca_system_score_codex":0.0002878446,"about_ca_system_score_gemma":0.00034735215,"threshold_uncertainty_score":0.99989206},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014811184,0.00085592276,0.98889685,0.0039121294,0.002042389,0.0003726508,0.0000027009842,0.000119224744,0.0023169974],"genre_scores_gemma":[0.10637149,0.00026991928,0.85922945,0.0229222,0.005195549,0.000012128968,0.00021831416,0.00012211764,0.0056588044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964209,0.00010930317,0.0006811538,0.0011327974,0.0010969879,0.00055886054],"domain_scores_gemma":[0.99792176,0.0007906756,0.00022626901,0.00050340756,0.00020549496,0.000352365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018555885,0.00042048056,0.00082476175,0.00081208046,0.000204822,0.00026266454,0.0006681581,0.00042146732,0.00007071479],"category_scores_gemma":[0.0008131901,0.0003632181,0.00017793725,0.0005929152,0.001230396,0.00011765339,0.0010459697,0.0021975967,0.000010074861],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019264311,0.00009041122,0.0007696126,0.00058849785,0.00004287085,0.00040201558,0.0002353473,0.00048791998,0.000053060412,0.000113580165,0.002066852,0.99513054],"study_design_scores_gemma":[0.0014288172,0.00019920472,0.0045394576,0.006668538,0.00006535531,0.0005211535,3.847318e-7,0.9808368,0.000052443094,0.0018515625,0.0034895549,0.00034674132],"about_ca_topic_score_codex":0.000046548652,"about_ca_topic_score_gemma":0.000015258507,"teacher_disagreement_score":0.9947838,"about_ca_system_score_codex":0.00036824567,"about_ca_system_score_gemma":0.001197784,"threshold_uncertainty_score":0.999882},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028335987,0.00033848657,0.9888678,0.005444936,0.0012401147,0.00081644516,0.000009980714,0.000058138045,0.0029406918],"genre_scores_gemma":[0.012889459,0.0002650146,0.9595217,0.01940921,0.0012245696,0.000066011824,0.00030043034,0.00006008019,0.0062635094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976562,0.000020551433,0.0004520101,0.0006708972,0.0008547958,0.00034553514],"domain_scores_gemma":[0.99868655,0.00039538974,0.00016793137,0.00030347786,0.00024260182,0.00020403112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009032243,0.00026490833,0.00045226017,0.00041267904,0.00015925936,0.000115390976,0.00032298063,0.00021715296,0.00016475229],"category_scores_gemma":[0.00057443365,0.00022716793,0.00011820524,0.00015139898,0.00062388,0.00011188556,0.000149176,0.00058853877,0.000007155922],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007106055,0.00005818756,0.00028614857,0.00035989942,0.000055932232,0.000093198825,0.00030116056,0.0017250456,0.0033377402,0.004447386,0.0013776948,0.98788655],"study_design_scores_gemma":[0.002808809,0.00029215505,0.00010204782,0.0015806847,0.00010222171,0.00010789351,0.0000016757712,0.97652906,0.0031822806,0.009545042,0.005385212,0.00036292739],"about_ca_topic_score_codex":0.00004833286,"about_ca_topic_score_gemma":0.000016065223,"teacher_disagreement_score":0.9875236,"about_ca_system_score_codex":0.00032034473,"about_ca_system_score_gemma":0.00082514354,"threshold_uncertainty_score":0.92636395},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030596582,0.00018249119,0.99287134,0.00067806133,0.0012391642,0.0013363253,0.00008505419,0.00010915893,0.00043872464],"genre_scores_gemma":[0.45316127,0.00003251548,0.5281766,0.0022058026,0.0007552631,0.00012798057,0.00020560286,0.000057962825,0.015276998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794734,0.000016724616,0.0004059459,0.00075756543,0.00053502986,0.00033741363],"domain_scores_gemma":[0.9982892,0.00063538394,0.00015169411,0.0003395171,0.00046009998,0.00012408862],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039481677,0.00030159493,0.00040631485,0.00084451144,0.00019577012,0.00006259905,0.0002170369,0.00030342577,0.000024070978],"category_scores_gemma":[0.00030998996,0.0002614572,0.00035628187,0.00011988927,0.0002690156,0.00009194135,0.00007981863,0.0005389288,0.000005785566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003381918,0.00013941995,0.0044709817,0.00055864156,0.000053329586,0.0000074721847,0.00034354895,0.5953406,0.0040066596,0.00016861696,0.00002201144,0.3945505],"study_design_scores_gemma":[0.0012472593,0.0009018698,0.0027752647,0.00064553716,0.000054828284,0.000006382233,8.372449e-7,0.9929711,0.0001996821,0.0007448883,0.00025608117,0.00019627102],"about_ca_topic_score_codex":0.0000089255345,"about_ca_topic_score_gemma":0.000014727551,"teacher_disagreement_score":0.46469474,"about_ca_system_score_codex":0.0005040346,"about_ca_system_score_gemma":0.00071312074,"threshold_uncertainty_score":0.9999838},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035678685,0.0010464182,0.9228618,0.00015108834,0.0046223835,0.0006377211,0.000035682544,0.00041001718,0.0345562],"genre_scores_gemma":[0.93764,0.0002536937,0.06164904,0.00007656392,0.00022555604,0.000004199499,0.00000808076,0.000032154174,0.00011071471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981038,0.0000126640625,0.00056984095,0.00049722265,0.0003730948,0.0004433696],"domain_scores_gemma":[0.999135,0.00018687533,0.00015912554,0.0003556489,0.000065927845,0.000097381766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003382897,0.00032253398,0.0005855751,0.0006694313,0.00010516284,0.000039744365,0.0004973284,0.0005100803,0.000048157788],"category_scores_gemma":[0.0000691832,0.00031463944,0.000084802676,0.00036784916,0.0007159449,0.00012807651,0.00020594527,0.0007581837,0.0000022047373],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001069048,0.00000685983,0.000324588,0.0001869042,0.00003771133,0.000047455513,0.000047450336,0.009288716,0.00022750918,0.005115802,0.000004673167,0.98470163],"study_design_scores_gemma":[0.0009341,0.00006987924,0.000022107011,0.0022517478,0.000043197742,0.0002716983,0.0000010035112,0.95955664,0.0056315656,0.027857775,0.0029018144,0.00045846397],"about_ca_topic_score_codex":0.00003968597,"about_ca_topic_score_gemma":0.000021709782,"teacher_disagreement_score":0.98424315,"about_ca_system_score_codex":0.00032208988,"about_ca_system_score_gemma":0.0002274424,"threshold_uncertainty_score":0.99993056},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000042658553,0.000621602,0.9911972,0.0033104247,0.0017531333,0.0012551078,0.000008741983,0.00015075995,0.0016987151],"genre_scores_gemma":[0.0035542478,0.00016436509,0.9874928,0.0066156443,0.0008814889,0.0001831818,0.000032060365,0.000026844207,0.00104939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960556,0.000028109842,0.0006446947,0.0015449874,0.000994857,0.00073176535],"domain_scores_gemma":[0.99688834,0.001138047,0.00031555982,0.0011684333,0.00028831442,0.00020129699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007209243,0.00045363657,0.0004643042,0.00029285398,0.00038799437,0.00028621464,0.0030848903,0.00027613452,0.00003909098],"category_scores_gemma":[0.000107427295,0.00043704527,0.00013313956,0.00064800715,0.00049620424,0.00043738238,0.0011225764,0.00054142217,0.000026758034],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063668563,0.000019688463,0.000004350543,0.000029691726,0.000009668561,0.000008966813,0.00008680508,0.011052562,0.000105402134,0.06969356,0.0008936451,0.9180893],"study_design_scores_gemma":[0.0004330932,0.00013821677,0.00001022871,0.0004519207,0.000010324604,0.000013537861,1.1218754e-7,0.7014663,0.0028153402,0.27980515,0.014330904,0.000524856],"about_ca_topic_score_codex":0.000005677761,"about_ca_topic_score_gemma":0.00009679036,"teacher_disagreement_score":0.91756445,"about_ca_system_score_codex":0.00035664567,"about_ca_system_score_gemma":0.0006907742,"threshold_uncertainty_score":0.99980813},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008570434,0.0079343505,0.9862634,0.0012033117,0.000644426,0.00039721833,0.0000070665606,0.00076733786,0.0027743499],"genre_scores_gemma":[0.010049058,0.0018656217,0.9862812,0.0006725605,0.00017845408,0.000029750408,0.0000020705636,0.000036454963,0.0008848213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658793,0.000020572938,0.00038175704,0.0016922844,0.0007121966,0.0006052663],"domain_scores_gemma":[0.9978927,0.00021311623,0.00014339238,0.0013678906,0.00021372591,0.00016922326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065931916,0.0005913431,0.000561503,0.0010450586,0.0001492587,0.00027034958,0.002945027,0.0004314603,0.0000037825982],"category_scores_gemma":[0.000023618983,0.0005828139,0.000089363966,0.00034886954,0.00023529633,0.00057028537,0.0025466408,0.0007760356,0.000007547353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.840053e-7,0.000007900495,7.764107e-7,0.0001141262,0.000005698999,0.000028668977,0.000479797,0.018571848,0.000014402476,0.32136998,0.000024849502,0.659381],"study_design_scores_gemma":[0.00009869343,0.00007034775,0.0000059515373,0.0005388193,0.000005533562,0.000027668657,1.3010615e-8,0.88264185,0.00066856266,0.10815492,0.007263379,0.00052428344],"about_ca_topic_score_codex":0.0000043606965,"about_ca_topic_score_gemma":0.000020375532,"teacher_disagreement_score":0.86407,"about_ca_system_score_codex":0.00022011076,"about_ca_system_score_gemma":0.00032394056,"threshold_uncertainty_score":0.99966234},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010795422,0.00091791747,0.99425644,0.0004158598,0.0005823714,0.0011029395,0.000014268118,0.00007516994,0.0015555073],"genre_scores_gemma":[0.3612876,0.000031805368,0.6370287,0.00073222606,0.0004243406,0.000018919085,0.000044503136,0.000025677313,0.00040622352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795246,0.00001170888,0.00036786543,0.0008596962,0.00043658348,0.00037168214],"domain_scores_gemma":[0.99749136,0.0015341017,0.00014834192,0.00043092098,0.0002785555,0.00011669757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033689186,0.00041490718,0.0005173952,0.00048356337,0.0002273468,0.00015261162,0.00032830884,0.00044234196,0.000052914373],"category_scores_gemma":[0.00058641477,0.00034654903,0.00019747266,0.00028214732,0.00027492773,0.00009444847,0.000121268655,0.0006748984,0.000011323974],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012803827,0.00012343115,0.004303362,0.0006030936,0.0001066828,0.00040824,0.0033952754,0.00039969772,0.00647117,0.010196125,0.000034191093,0.9738307],"study_design_scores_gemma":[0.0010812349,0.0015148557,0.00043003622,0.0075475597,0.0005274604,0.0016563587,0.0000035814026,0.86213565,0.007656848,0.1137153,0.0024220382,0.0013090717],"about_ca_topic_score_codex":0.00007792423,"about_ca_topic_score_gemma":0.00009766587,"teacher_disagreement_score":0.9725216,"about_ca_system_score_codex":0.0004326325,"about_ca_system_score_gemma":0.00052364945,"threshold_uncertainty_score":0.9998987},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039731818,0.0006454243,0.99610084,0.00035248237,0.00029885728,0.00097534276,0.000011862671,0.00013912715,0.0014363442],"genre_scores_gemma":[0.01674981,0.00008924547,0.9810654,0.0013372736,0.00012528908,0.00004535189,0.0000071678505,0.000021648699,0.0005588186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974691,0.000024700608,0.0004437561,0.0012391377,0.00035240603,0.0004708978],"domain_scores_gemma":[0.997937,0.001031913,0.00020958572,0.0005119434,0.00022865116,0.00008090633],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007382864,0.0003881482,0.0004727352,0.0007767681,0.00015277787,0.00035897346,0.0011209697,0.00021078857,0.0000053620865],"category_scores_gemma":[0.00029544372,0.00037665636,0.00007688125,0.00045883624,0.0005288367,0.001160568,0.00062162266,0.00045988624,0.0000036441356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000142127665,0.0000093724275,0.00001075346,0.00004608289,0.000005520176,0.000017453047,0.00088525895,0.00011912896,0.0011456744,0.0039361,0.000025694373,0.9937847],"study_design_scores_gemma":[0.0009873891,0.0005065149,0.0000980376,0.0014718358,0.0000145252925,0.00003077681,0.0000021951207,0.60769415,0.049851768,0.33766916,0.0007642797,0.0009093775],"about_ca_topic_score_codex":0.0000073905003,"about_ca_topic_score_gemma":0.000027539954,"teacher_disagreement_score":0.9928754,"about_ca_system_score_codex":0.00025106754,"about_ca_system_score_gemma":0.00031417405,"threshold_uncertainty_score":0.9998685},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000192618,0.0006764666,0.98434144,0.010475042,0.0022353558,0.0017490973,0.000058660255,0.00016489005,0.00010643078],"genre_scores_gemma":[0.13771808,0.00042554826,0.807155,0.039736703,0.007332288,0.0006917856,0.000876394,0.00020935504,0.0058548427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971928,0.000027669716,0.0004447755,0.0012987732,0.0005663549,0.0004696124],"domain_scores_gemma":[0.9967477,0.0016218581,0.00019909634,0.00074732106,0.00042202213,0.00026200674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048148903,0.00040528807,0.00046907793,0.0005902976,0.00041964138,0.00010353178,0.00044510848,0.00033215035,0.00003591339],"category_scores_gemma":[0.0005078811,0.0003777379,0.00022588036,0.00041893395,0.0003804452,0.00008673161,0.00032399755,0.0005529031,0.000006608205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028777297,0.00020227053,0.00469415,0.0007146142,0.0000363176,0.000049252707,0.000120404366,0.10958968,0.00027485495,0.0009009495,0.0047275163,0.87840223],"study_design_scores_gemma":[0.0007855128,0.00007881598,0.010786345,0.002981287,0.00011316905,0.000007099433,1.2608685e-7,0.9666942,0.00013123917,0.003229729,0.014814889,0.00037759353],"about_ca_topic_score_codex":0.000051409403,"about_ca_topic_score_gemma":0.00014767732,"teacher_disagreement_score":0.87802464,"about_ca_system_score_codex":0.00078363094,"about_ca_system_score_gemma":0.0014191823,"threshold_uncertainty_score":0.99986744},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26207682,0.0005874134,0.7272229,0.0024312278,0.00214015,0.0013812743,0.000004091554,0.00014481068,0.004011268],"genre_scores_gemma":[0.8872054,0.000010585961,0.11008938,0.00140139,0.00027620682,0.000016897577,0.00007370059,0.00004527723,0.00088115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972669,0.000037177637,0.0005617112,0.00086809456,0.00081282767,0.00045330016],"domain_scores_gemma":[0.9986414,0.00044153508,0.00025253627,0.00039950444,0.00014407857,0.00012097916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004707462,0.00042946127,0.0006351792,0.001041811,0.00016211512,0.00007096878,0.00040466723,0.0003257176,0.000022665852],"category_scores_gemma":[0.00024092018,0.00031257776,0.000113516624,0.00057935726,0.00021206922,0.00008803763,0.00020281874,0.001129278,0.0000019235963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017404264,0.00009369855,0.33360732,0.00020493678,0.000014171123,0.00029131552,0.0005034227,0.000744315,0.000045083798,0.00015834736,0.000035585337,0.66412777],"study_design_scores_gemma":[0.003038528,0.0017169123,0.25185353,0.012257984,0.00016000027,0.00017188245,0.0000054372967,0.7206877,0.00011915706,0.008113001,0.00067320943,0.0012026718],"about_ca_topic_score_codex":0.0007780965,"about_ca_topic_score_gemma":0.002007207,"teacher_disagreement_score":0.71994334,"about_ca_system_score_codex":0.0010675496,"about_ca_system_score_gemma":0.00050931826,"threshold_uncertainty_score":0.99993265},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16128096,0.00012548258,0.83379257,0.0036670414,0.00043284975,0.0005856014,0.0000048648253,0.000049178692,0.00006143724],"genre_scores_gemma":[0.7857475,0.000015759477,0.20921253,0.0049415287,0.000050228336,0.000020891179,0.0000063462703,0.0000030830383,0.0000020915513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989914,0.000029176277,0.00016841426,0.00037518158,0.0001821269,0.00025371005],"domain_scores_gemma":[0.999167,0.00054751715,0.000031741165,0.000121110366,0.000075309195,0.00005730601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023260798,0.00010878663,0.0001717309,0.0001602681,0.0001083755,0.000039364917,0.00015357774,0.000051589468,0.000010695001],"category_scores_gemma":[0.00018185678,0.00008088392,0.000049656297,0.00077375263,0.00015090343,0.000093366165,0.000059112106,0.00012896257,0.000003944546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032284798,0.0023093794,0.105246045,0.0008853593,0.00014160607,0.00014310908,0.0069449414,0.046734672,0.0865111,0.00832662,0.00083786616,0.73869085],"study_design_scores_gemma":[0.0032848702,0.0011334998,0.022457004,0.00004487856,0.00003755455,0.000010778832,0.000009805546,0.9549983,0.009172782,0.008593912,0.0000962886,0.00016029246],"about_ca_topic_score_codex":0.000016352464,"about_ca_topic_score_gemma":0.000017431372,"teacher_disagreement_score":0.9082637,"about_ca_system_score_codex":0.0000538467,"about_ca_system_score_gemma":0.00016328065,"threshold_uncertainty_score":0.32983506},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059930416,0.010717765,0.38459402,0.095216036,0.02125055,0.0027464132,0.000013228631,0.0004220077,0.48444068],"genre_scores_gemma":[0.30242524,0.11690791,0.17362523,0.13644919,0.015798464,0.00041426695,0.000083629886,0.00028463957,0.25401145],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99764436,0.00008399519,0.00030107668,0.0006879702,0.0008296147,0.0004529928],"domain_scores_gemma":[0.9973347,0.0013291879,0.00016773767,0.0008885614,0.00017325285,0.00010652006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007693425,0.0002710667,0.00034996142,0.0003535343,0.00075390073,0.00057343545,0.0017166213,0.000271348,0.00007155621],"category_scores_gemma":[0.00037926203,0.00023884824,0.00010733596,0.00043515433,0.0010781721,0.00031924483,0.00057713705,0.00059064396,0.00004988548],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007728887,0.00002115488,0.00013475487,0.000016526961,0.000010033854,0.000007638747,0.006940196,0.00022716538,0.0000027555745,0.077805206,0.00072221726,0.91410464],"study_design_scores_gemma":[0.00026064675,0.00015656793,0.00016716735,0.0019490208,0.000021774518,0.0000015333733,0.000060289138,0.0033943055,0.000053653843,0.123535715,0.8697138,0.0006855544],"about_ca_topic_score_codex":0.000527344,"about_ca_topic_score_gemma":0.011610895,"teacher_disagreement_score":0.91341907,"about_ca_system_score_codex":0.00032381553,"about_ca_system_score_gemma":0.0005709002,"threshold_uncertainty_score":0.97399485},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030795763,0.0004341166,0.99518,0.0016999175,0.0014436678,0.0004552016,0.0000035609892,0.00011701578,0.00063572614],"genre_scores_gemma":[0.0688475,0.00004772645,0.92863125,0.0017430016,0.00027749786,0.000017935323,0.000004654646,0.000017952812,0.00041246723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692005,0.000024167166,0.00041652564,0.0013314427,0.00083065504,0.00047717392],"domain_scores_gemma":[0.9982876,0.0006024354,0.00017162996,0.0006521356,0.00013197422,0.00015418528],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010710022,0.00033602442,0.0003714952,0.00055389316,0.00030460823,0.0004191701,0.0015351848,0.00032980507,0.0000051482803],"category_scores_gemma":[0.00037639553,0.0003170727,0.00008090413,0.00027097142,0.0003504062,0.00035462689,0.00097362645,0.000500724,0.0000016939073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006278395,0.000018305736,0.00006376512,0.000115519346,0.000015267897,0.00004352817,0.0012097548,0.008307735,0.000017783943,0.30498028,0.000045627283,0.68517613],"study_design_scores_gemma":[0.0003856142,0.000057299083,0.000027868768,0.00063468266,0.0000063609364,0.000026760872,5.0280585e-7,0.8779339,0.000044266064,0.12021506,0.00038397967,0.00028369008],"about_ca_topic_score_codex":0.000022427857,"about_ca_topic_score_gemma":0.000126934,"teacher_disagreement_score":0.86962616,"about_ca_system_score_codex":0.00045490602,"about_ca_system_score_gemma":0.0007700707,"threshold_uncertainty_score":0.9999281},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006387243,0.0004076648,0.99626076,0.0003729841,0.00044982362,0.000606891,0.000016661425,0.00013997627,0.0011064892],"genre_scores_gemma":[0.5520597,0.00005861387,0.44669625,0.0006393824,0.00026218963,0.000035071695,0.000017911945,0.00002520409,0.00020566788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684453,0.000037209422,0.0005420665,0.0014568106,0.00063373684,0.00048562736],"domain_scores_gemma":[0.9975861,0.00064313004,0.00029945164,0.0010871228,0.00021434245,0.00016990972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004904049,0.00044359395,0.0004668098,0.0009160428,0.0004622033,0.00047543403,0.0018086528,0.00027719204,0.000008014216],"category_scores_gemma":[0.00011709139,0.00044445836,0.00006968567,0.00079357886,0.0008217171,0.0005049195,0.0011720258,0.000599796,0.000010769161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024346057,0.00007548485,0.00057881436,0.00015291682,0.000018117893,0.000029393954,0.00067389157,0.019955518,0.00027421172,0.24613127,0.000007175709,0.7321008],"study_design_scores_gemma":[0.00014621315,0.000046812467,0.002314928,0.0003146368,0.000013295552,0.000052988904,8.751889e-8,0.7160468,0.00006493678,0.2804479,0.00016608511,0.00038532223],"about_ca_topic_score_codex":0.000023534536,"about_ca_topic_score_gemma":0.000018149614,"teacher_disagreement_score":0.73171544,"about_ca_system_score_codex":0.00031858214,"about_ca_system_score_gemma":0.0009140033,"threshold_uncertainty_score":0.99980074},"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":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038238214,0.0002605458,0.98179835,0.004831079,0.0046866448,0.0011304927,0.000012915421,0.00009758528,0.0033585818],"genre_scores_gemma":[0.8724822,0.0011952368,0.096734494,0.0106997145,0.001247316,0.00005990816,0.00013518776,0.00008539511,0.017360574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772424,0.000060054474,0.00044924964,0.0009885331,0.00049039914,0.00028750589],"domain_scores_gemma":[0.9986303,0.00039769564,0.00013154282,0.00063609384,0.0001002438,0.00010413691],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005684093,0.00031347273,0.00045615638,0.0007074766,0.00007911138,0.00019867811,0.000355477,0.00021571515,0.00020323494],"category_scores_gemma":[0.000117211224,0.00028615742,0.000095205345,0.00034431042,0.00024051577,0.00014692183,0.00040196604,0.0006619056,0.000021915212],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057890884,0.000057530044,0.00024878982,0.00008988134,0.000018982915,0.00015822877,0.001141053,0.00083746563,0.00031567336,0.00020053083,0.000062525665,0.99681145],"study_design_scores_gemma":[0.009409185,0.0027566135,0.0074766814,0.025540104,0.0005416842,0.0004795923,0.00014250807,0.5227165,0.032645844,0.29507983,0.098667726,0.004543697],"about_ca_topic_score_codex":0.00024687953,"about_ca_topic_score_gemma":0.0014285409,"teacher_disagreement_score":0.9922677,"about_ca_system_score_codex":0.0008115092,"about_ca_system_score_gemma":0.00032679518,"threshold_uncertainty_score":0.99995905},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018923558,0.00039106925,0.9922637,0.0023782721,0.002212135,0.0008867884,0.000022697934,0.000280973,0.0015454502],"genre_scores_gemma":[0.03769243,0.00008456554,0.9583583,0.002149171,0.0003255218,0.00014335,0.0000053372673,0.000048575544,0.0011927544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99567544,0.000048724854,0.00070633506,0.0020315577,0.0007484465,0.0007894823],"domain_scores_gemma":[0.9959687,0.0013584978,0.00037317444,0.001684969,0.00045799345,0.0001566636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005154192,0.0006298243,0.00076714874,0.0010190948,0.00047257886,0.0003998314,0.0036666244,0.0005659219,0.000013725673],"category_scores_gemma":[0.0003062874,0.00060453505,0.00025178012,0.0005614365,0.0008019551,0.00063647435,0.0017281331,0.00062351883,0.000014924231],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020923942,0.000039720333,0.000007912616,0.00017197405,0.000024666755,0.000050918406,0.0008124956,0.055700123,0.0010067788,0.0343581,0.0010890652,0.9067173],"study_design_scores_gemma":[0.00025356893,0.00005035002,0.000004513778,0.00034504524,0.000017309998,0.00008230859,1.12941805e-7,0.8360917,0.008859023,0.15310441,0.0006832405,0.00050839904],"about_ca_topic_score_codex":0.000019137104,"about_ca_topic_score_gemma":0.000063367625,"teacher_disagreement_score":0.90620893,"about_ca_system_score_codex":0.00065796875,"about_ca_system_score_gemma":0.0011995535,"threshold_uncertainty_score":0.9996406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002682843,0.0003215499,0.9911181,0.0025013126,0.0028850257,0.0002782994,0.000003318085,0.0001504743,0.000059120575],"genre_scores_gemma":[0.36939546,0.000004952354,0.6293184,0.0011109833,0.00014651839,0.000015095801,0.0000012828193,0.0000043441432,0.000002930545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774754,0.000040264767,0.0002828624,0.0009408549,0.00039556576,0.000592932],"domain_scores_gemma":[0.9977962,0.0005151825,0.00007940929,0.0013816275,0.00014076055,0.00008681767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078686984,0.00019453102,0.00021787091,0.0004799993,0.0004636652,0.00058108487,0.003600434,0.000072942035,0.0000010654335],"category_scores_gemma":[0.00029736455,0.00016484893,0.00006049954,0.0021872183,0.00019448558,0.00076260534,0.0020585384,0.0001954156,0.0000024113479],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044760363,0.000033559096,0.0003004067,0.000020417,0.0000027609624,0.0000042660004,0.00028005743,0.017288322,0.0012629919,0.0030025032,0.000121755234,0.9776785],"study_design_scores_gemma":[0.00041793758,0.00005156913,0.0010963725,0.0001772012,0.0000023257928,0.000006479083,3.9621662e-7,0.9027466,0.014711753,0.07925416,0.0013432311,0.00019192956],"about_ca_topic_score_codex":0.00004081035,"about_ca_topic_score_gemma":0.000029217372,"teacher_disagreement_score":0.97748655,"about_ca_system_score_codex":0.00013124109,"about_ca_system_score_gemma":0.00036423822,"threshold_uncertainty_score":0.6722344},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034530691,0.00012627697,0.99243915,0.0015366822,0.001965544,0.00029873714,0.0000032264584,0.00014158545,0.00003572655],"genre_scores_gemma":[0.5172762,9.132792e-7,0.4811785,0.0014329436,0.00008732613,0.00001534684,0.0000024571007,0.0000042589104,0.0000020557923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977234,0.000034626253,0.0002834685,0.00095195445,0.00040973967,0.00059680955],"domain_scores_gemma":[0.9980396,0.00074705674,0.00009106751,0.00089768186,0.0001401976,0.00008438219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000901477,0.00020588162,0.00022180958,0.0005510205,0.0005233032,0.00066130445,0.0024832243,0.000084563966,0.0000038430185],"category_scores_gemma":[0.00017736653,0.00017509812,0.00007254887,0.0022522386,0.00019369418,0.0008633942,0.00092895667,0.0002138757,0.0000040607297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060084913,0.00004661294,0.0016421321,0.000030919826,0.000003348865,0.000011047624,0.00019181723,0.05855588,0.001393781,0.0016503695,0.00007293418,0.93639517],"study_design_scores_gemma":[0.00040482232,0.000045896133,0.0035191607,0.00019562973,0.0000024949163,0.000005454999,2.478287e-7,0.95974475,0.026151713,0.00929328,0.00042895888,0.00020760985],"about_ca_topic_score_codex":0.000042943928,"about_ca_topic_score_gemma":0.000027964845,"teacher_disagreement_score":0.93618757,"about_ca_system_score_codex":0.00012831006,"about_ca_system_score_gemma":0.0003573012,"threshold_uncertainty_score":0.71402943},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024188662,0.00047752788,0.9942804,0.0002130333,0.0015502436,0.000330224,0.000012035069,0.00011392318,0.0027807332],"genre_scores_gemma":[0.29891407,0.00002791167,0.7001234,0.00043099013,0.00020112409,0.0000053588037,0.000015794947,0.000021851854,0.0002594835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996607,0.000029384926,0.0006420681,0.0012534913,0.0010258518,0.00044221466],"domain_scores_gemma":[0.9975854,0.00039083525,0.00041131012,0.0011467509,0.00035416867,0.000111523936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065410946,0.0004079623,0.00054943917,0.0009955453,0.00017519132,0.00022308543,0.0027919416,0.00025403744,0.000007130056],"category_scores_gemma":[0.000065503766,0.0003679691,0.00013220105,0.00080125825,0.000451097,0.00021240015,0.0019120467,0.0005254604,0.000012092824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058586184,0.00004255157,0.0000169021,0.0000744811,0.000008132932,0.00002521585,0.00026305602,0.17633757,0.0001708011,0.02284044,0.00004340306,0.8001716],"study_design_scores_gemma":[0.00028444448,0.000091615606,0.00019271148,0.0007997686,0.000006773178,0.000011522691,8.266627e-8,0.9558568,0.0018952874,0.04013429,0.00037148068,0.00035519843],"about_ca_topic_score_codex":0.00003430232,"about_ca_topic_score_gemma":0.0000085344345,"teacher_disagreement_score":0.79981637,"about_ca_system_score_codex":0.00018759561,"about_ca_system_score_gemma":0.0005912725,"threshold_uncertainty_score":0.9998772},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012464489,0.0007307721,0.86303526,0.0011989471,0.0005418638,0.0004667968,0.0000061589512,0.00008701946,0.12146868],"genre_scores_gemma":[0.92550975,0.00018135633,0.06434898,0.0016732583,0.0004790963,0.00005489993,0.000020778029,0.000023975292,0.0077078943],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984716,0.000045498386,0.00015400113,0.0006448988,0.00036143552,0.00032252114],"domain_scores_gemma":[0.99887985,0.00057868724,0.000080777434,0.00026158066,0.00010616178,0.00009295721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004193811,0.00021005415,0.00023410331,0.00036335087,0.000267176,0.00011657431,0.00039402922,0.0001511749,0.000053024854],"category_scores_gemma":[0.00012397014,0.00014426572,0.000026470489,0.00022340751,0.0006163328,0.00017901919,0.00017221093,0.00058945344,0.000010345393],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048446967,0.00007452712,0.0010391325,0.00004462915,0.000026608268,0.000008315524,0.003361309,0.0005452593,0.000011343892,0.0052342117,0.000086461594,0.9895198],"study_design_scores_gemma":[0.0031981727,0.0073792683,0.26559654,0.0020245495,0.00017674321,0.00050144974,0.0001822518,0.06079283,0.00031005638,0.6043867,0.050788995,0.004662481],"about_ca_topic_score_codex":0.000018558396,"about_ca_topic_score_gemma":0.000014727033,"teacher_disagreement_score":0.98485726,"about_ca_system_score_codex":0.000076790246,"about_ca_system_score_gemma":0.000088041306,"threshold_uncertainty_score":0.5882985},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011883236,0.0005225308,0.9922121,0.0019891413,0.0031214058,0.0008597726,0.000015266138,0.0003251632,0.00083577546],"genre_scores_gemma":[0.06403343,0.00008492634,0.93096787,0.0018940395,0.0012213108,0.0001104106,0.000031229745,0.000052338564,0.0016044787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943456,0.000082173705,0.00079553487,0.002165695,0.0018287732,0.0007822003],"domain_scores_gemma":[0.99656194,0.0009005978,0.00041545156,0.0014398127,0.00046397487,0.00021819945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021804257,0.0006155869,0.00062461785,0.001025731,0.0006977228,0.0008075703,0.0028898548,0.00061799167,0.000023834533],"category_scores_gemma":[0.00047972435,0.00059304695,0.00021496655,0.00072536163,0.0005999448,0.0011129506,0.0014137223,0.0009723538,0.000012852125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017597718,0.000025813137,0.0000018198936,0.00009137232,0.0000127757185,0.000009512995,0.00079705915,0.1656274,0.0020056958,0.004633647,0.00021353648,0.8265638],"study_design_scores_gemma":[0.00047152193,0.00021521428,0.0000072648663,0.0005708736,0.000017856586,0.000035724344,4.017872e-7,0.9516495,0.002819058,0.043182705,0.00047281283,0.0005570711],"about_ca_topic_score_codex":0.00008405952,"about_ca_topic_score_gemma":0.00044036226,"teacher_disagreement_score":0.8260067,"about_ca_system_score_codex":0.0011539288,"about_ca_system_score_gemma":0.0018950563,"threshold_uncertainty_score":0.9996521},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015909405,0.0009824056,0.98867565,0.000073793766,0.0076139392,0.0007994443,4.0449845e-7,0.00019907796,0.0014961613],"genre_scores_gemma":[0.042181812,0.000028699522,0.9537585,0.00045266157,0.0024546275,0.000022200891,0.000019958848,0.000056640092,0.0010249212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946968,0.0001375321,0.0010273379,0.0019739666,0.0011045181,0.0010598266],"domain_scores_gemma":[0.9975581,0.00033077784,0.0004893118,0.00120768,0.00024700188,0.00016713318],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001563311,0.0007035656,0.0007411979,0.0016469315,0.00047527824,0.00094380876,0.0031174682,0.00031122303,9.89802e-7],"category_scores_gemma":[0.00009734259,0.00072231033,0.00014315755,0.0011359365,0.00031237293,0.00041226723,0.0021216557,0.0013650806,0.000011252255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020382342,0.00002380062,0.000054155833,0.000095737836,0.000009674435,0.000051450494,0.00075857085,0.746157,0.000026408887,0.00039305043,0.000024377472,0.25240377],"study_design_scores_gemma":[0.00040672798,0.00007535194,0.000053504395,0.0010101672,0.000010545119,0.000106751024,9.3065705e-7,0.9942506,0.00012382327,0.00077003497,0.00247752,0.0007140491],"about_ca_topic_score_codex":0.00024081154,"about_ca_topic_score_gemma":0.0000045514416,"teacher_disagreement_score":0.25168973,"about_ca_system_score_codex":0.0009842776,"about_ca_system_score_gemma":0.0008181549,"threshold_uncertainty_score":0.9995228},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009348266,0.00008475913,0.98487705,0.0019491615,0.00080480793,0.0008112584,0.000009410322,0.00013678608,0.0019785047],"genre_scores_gemma":[0.9803199,0.000031645613,0.016895762,0.002134114,0.00027172212,0.00012352815,6.471313e-7,0.000026104964,0.00019657667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658585,0.00021376982,0.00045385803,0.0012299358,0.00072726165,0.000789326],"domain_scores_gemma":[0.997524,0.00040184704,0.00021566164,0.0014581515,0.00022355134,0.00017674768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015923271,0.0004875558,0.0005079299,0.0010858979,0.000614164,0.00082622794,0.0030157024,0.0002511802,0.0000035788084],"category_scores_gemma":[0.000056261615,0.0004115496,0.00006622294,0.0019169394,0.00071766414,0.0006269224,0.0022333555,0.0020257728,0.000004518455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034197095,0.000038999504,0.00041906736,0.000089419336,0.00001957816,0.000007077097,0.015670158,0.06727446,0.00019812453,0.0008985811,0.000018496488,0.91533184],"study_design_scores_gemma":[0.00042536785,0.00020589933,0.011875957,0.0005952193,0.00001065134,0.00007439859,0.0000098240425,0.95993733,0.0005048205,0.025287122,0.0003356988,0.0007377202],"about_ca_topic_score_codex":0.002434436,"about_ca_topic_score_gemma":0.0022965842,"teacher_disagreement_score":0.97097164,"about_ca_system_score_codex":0.0018138435,"about_ca_system_score_gemma":0.0005400298,"threshold_uncertainty_score":0.99983364},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017006959,0.0010555626,0.9945748,0.00047295587,0.0023064932,0.00070289476,0.00002190159,0.0004642177,0.0002311358],"genre_scores_gemma":[0.24713166,0.0001468201,0.74992114,0.0010727622,0.001092154,0.000115713156,0.000010625817,0.000088452274,0.00042066307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948533,0.00006717572,0.0005847047,0.0024332684,0.0012331079,0.0008284029],"domain_scores_gemma":[0.99732804,0.0003175654,0.00047685578,0.0012405924,0.00043397438,0.00020294116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057168683,0.0007807844,0.0006904832,0.00095759734,0.00054191094,0.0008844312,0.0025619445,0.00042853446,0.000028668923],"category_scores_gemma":[0.0000226927,0.0006947504,0.00014327603,0.0014614951,0.0005890261,0.0010964872,0.0012844526,0.0013757279,0.000012461584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027352933,0.000022151251,0.00021203906,0.000049373786,0.000043356806,0.00003898843,0.0002776126,0.023581076,0.00027272504,0.00010855104,0.0000032623366,0.9753635],"study_design_scores_gemma":[0.000615915,0.00021168144,0.0011034874,0.002791664,0.000045152374,0.0001458052,4.8357236e-7,0.9871394,0.0031745883,0.0030249595,0.0007591256,0.0009877252],"about_ca_topic_score_codex":0.0011808015,"about_ca_topic_score_gemma":0.002982186,"teacher_disagreement_score":0.9743758,"about_ca_system_score_codex":0.00089774973,"about_ca_system_score_gemma":0.000831128,"threshold_uncertainty_score":0.99955034},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010639646,0.0018514391,0.9499583,0.0033170276,0.0026297565,0.024461428,0.00046817752,0.0003545781,0.006319606],"genre_scores_gemma":[0.9633687,0.00025707588,0.026269447,0.002843829,0.001263284,0.002414658,0.0004091372,0.00009745534,0.0030763785],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99784136,0.00001571829,0.0003408129,0.00093894283,0.0004812007,0.00038195855],"domain_scores_gemma":[0.9985045,0.0001769349,0.00013681588,0.00071810035,0.00029851537,0.00016512805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019108441,0.0003556358,0.0005542653,0.00034920318,0.0001702842,0.00008699516,0.00027344856,0.00022664452,0.000030146708],"category_scores_gemma":[0.00008240431,0.00029972917,0.00053787074,0.00023733887,0.00030417487,0.00008800614,0.00014032719,0.00028766718,0.000013174192],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022730886,0.00020018776,0.02114022,0.0008016795,0.00025755522,0.000017145929,0.00013459453,0.00013694011,0.0000533442,0.0008949023,0.00014506879,0.9759911],"study_design_scores_gemma":[0.011633857,0.004173562,0.5329137,0.01281234,0.0044878023,0.00007035459,0.0000042107977,0.23848847,0.0045381244,0.13504358,0.051562004,0.004271993],"about_ca_topic_score_codex":0.000019007886,"about_ca_topic_score_gemma":0.0000041544945,"teacher_disagreement_score":0.9717191,"about_ca_system_score_codex":0.00035437135,"about_ca_system_score_gemma":0.00073218084,"threshold_uncertainty_score":0.99994546},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9705179,0.0005534537,0.0089896275,0.00038952593,0.00081805675,0.0007288182,0.000004922216,0.000054496508,0.017943218],"genre_scores_gemma":[0.99765974,0.000026521571,0.0012245969,0.0006214121,0.00021495244,0.0000035564171,0.0000060803404,0.000015200174,0.00022794543],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9982543,0.0000054615084,0.000380806,0.0005364987,0.00048073457,0.0003421982],"domain_scores_gemma":[0.99886,0.00027729303,0.00015201248,0.00058053824,0.00007379852,0.000056356665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057577906,0.00028823066,0.00050783885,0.000721993,0.00007395216,0.000031877324,0.0004532651,0.00018495045,0.000037573263],"category_scores_gemma":[0.00004487846,0.00017988136,0.000112798545,0.00046191158,0.0003880638,0.00007852976,0.0001155406,0.0008466549,0.0000048714064],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012174938,0.00007830821,0.03140585,0.000121945915,0.000039963266,0.00015644029,0.004294437,0.21172184,0.000088970446,0.00013524707,0.00004346591,0.7517918],"study_design_scores_gemma":[0.0033218323,0.0042927368,0.50296706,0.016956769,0.000118344375,0.00023369344,0.000017022363,0.46700928,0.0017717329,0.0016360733,0.00042467954,0.0012507768],"about_ca_topic_score_codex":0.00003703276,"about_ca_topic_score_gemma":0.00006620516,"teacher_disagreement_score":0.75054103,"about_ca_system_score_codex":0.00020019858,"about_ca_system_score_gemma":0.00063334825,"threshold_uncertainty_score":0.73353493},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015459083,0.0006626997,0.9915017,0.00081582996,0.0029435297,0.0004690261,0.00023812942,0.00005507635,0.0031594385],"genre_scores_gemma":[0.7451062,0.000137143,0.24583116,0.0041953735,0.0013408578,0.000043157266,0.000077098026,0.00007961845,0.0031893458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732226,0.0000029882383,0.000972041,0.0010951831,0.00012994235,0.00047757957],"domain_scores_gemma":[0.9981458,0.0003854728,0.0005264304,0.00074870983,0.00009587204,0.00009768467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093355414,0.00037428265,0.00071043754,0.0009208971,0.00025098395,0.00028770973,0.0005836953,0.00043815395,0.000109142966],"category_scores_gemma":[0.00020282295,0.00040286392,0.00023559101,0.0003415323,0.00021417775,0.00018938133,0.00015657471,0.0005984617,0.000024171792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050870138,0.00009039746,0.053632397,0.00044986274,0.00006427446,0.000025125855,0.0005565169,0.44900677,0.0000023761804,0.4092223,0.00016246681,0.08673664],"study_design_scores_gemma":[0.00023823227,0.00008788313,0.00063816865,0.00035612847,0.000009650734,0.000002704252,1.3636935e-7,0.7285446,0.000025221,0.26026943,0.009460377,0.0003674998],"about_ca_topic_score_codex":0.000030350962,"about_ca_topic_score_gemma":0.000040620816,"teacher_disagreement_score":0.7456705,"about_ca_system_score_codex":0.000275819,"about_ca_system_score_gemma":0.00014874745,"threshold_uncertainty_score":0.99984235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047803976,0.00053247344,0.96429974,0.013669293,0.0025623497,0.00068318547,0.000028612334,0.00097316655,0.017203359],"genre_scores_gemma":[0.022851523,0.00009380795,0.9739582,0.0016898199,0.00043036303,0.000033448894,0.000018902112,0.000052584517,0.0008713459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99270236,0.000068657064,0.0009858847,0.00332439,0.0015189959,0.0013996825],"domain_scores_gemma":[0.9797878,0.0015647677,0.00061887613,0.01735913,0.00047760957,0.00019181806],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016001689,0.0010090433,0.0009918079,0.0020160677,0.0006306196,0.0015415925,0.09023153,0.0007724638,0.000043593704],"category_scores_gemma":[0.014991178,0.000983412,0.0002175525,0.0018694471,0.0011273078,0.0020256306,0.25754145,0.0024223723,0.00007414225],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075331036,0.000047699716,0.00012895574,0.00020238262,0.00005621332,0.0003763105,0.0005635468,0.0025428426,0.00037469115,0.011986584,0.01419303,0.9695202],"study_design_scores_gemma":[0.00019460925,0.00007342347,0.000050207153,0.0011811365,0.000007997781,0.000033484474,2.0071832e-7,0.5273199,0.0025548828,0.46566582,0.0022383283,0.000679975],"about_ca_topic_score_codex":0.00004225349,"about_ca_topic_score_gemma":0.000052752053,"teacher_disagreement_score":0.96884024,"about_ca_system_score_codex":0.0008269274,"about_ca_system_score_gemma":0.0011607119,"threshold_uncertainty_score":0.99987906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025293732,0.0012512567,0.99067706,0.00037912859,0.0010472715,0.0011451753,0.0005169056,0.00015944791,0.0022943665],"genre_scores_gemma":[0.9297573,0.000777761,0.064073384,0.0010233336,0.00045195047,0.0001462927,0.0009827834,0.00005726096,0.0027299349],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.997419,0.000017448308,0.00041268143,0.0011488687,0.0005494654,0.00045252437],"domain_scores_gemma":[0.9978746,0.0006044238,0.00013947659,0.0009318691,0.00026982877,0.00017976212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002294825,0.0005145522,0.0011790119,0.002134658,0.0001783797,0.00010658098,0.00027956,0.00031233314,0.000016913113],"category_scores_gemma":[0.000067159075,0.0004291937,0.0009473662,0.0011045617,0.00038331037,0.0000830955,0.00011865506,0.0003115212,0.0000052662012],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004508688,0.0003537961,0.22281192,0.0002517589,0.010092257,0.0014549099,0.00048405014,0.05759487,0.00011155446,0.00057824014,0.00059213134,0.7052236],"study_design_scores_gemma":[0.011012324,0.009384051,0.5590721,0.0035455022,0.061847772,0.0011205738,0.0000026022924,0.3123505,0.0023898648,0.027795365,0.008386784,0.003092549],"about_ca_topic_score_codex":0.000049623995,"about_ca_topic_score_gemma":0.000021599893,"teacher_disagreement_score":0.9272279,"about_ca_system_score_codex":0.0005223347,"about_ca_system_score_gemma":0.0005211099,"threshold_uncertainty_score":0.999816},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024473176,0.0022934722,0.9780437,0.0009066967,0.0011636793,0.00033840246,0.000049183487,0.00011909487,0.014638493],"genre_scores_gemma":[0.92117584,0.00022167513,0.069044225,0.007184664,0.0005068858,0.000004589531,0.000034072113,0.000036212587,0.0017918461],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976056,0.000019628771,0.00037268587,0.00086437515,0.00059344986,0.0005442284],"domain_scores_gemma":[0.9982526,0.0006024437,0.000112551454,0.0005774984,0.00021435283,0.00024059901],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032062127,0.00048034868,0.0006504063,0.0006474623,0.00018821894,0.00019347349,0.00034261032,0.00031061494,0.000032615022],"category_scores_gemma":[0.00013457524,0.0004184985,0.00013190595,0.0006821983,0.0022445708,0.00011963765,0.00016604937,0.0008061701,0.0000151099275],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000852609,0.0000666421,0.010238259,0.00026134183,0.000090162044,0.00008293802,0.0007499056,0.00079735497,0.00035963752,0.0037321765,0.00025732207,0.983279],"study_design_scores_gemma":[0.019319696,0.0061473744,0.061575156,0.033006046,0.0026507631,0.029018652,0.0001418945,0.100518405,0.005485375,0.2627634,0.4664235,0.01294973],"about_ca_topic_score_codex":0.00007851873,"about_ca_topic_score_gemma":0.00008633853,"teacher_disagreement_score":0.9703293,"about_ca_system_score_codex":0.00021599603,"about_ca_system_score_gemma":0.00048590268,"threshold_uncertainty_score":0.99982667},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005356067,0.0011393706,0.9932933,0.0016523319,0.0003642068,0.0017344959,0.000039953648,0.0005659103,0.0012050943],"genre_scores_gemma":[0.0026318803,0.000013775227,0.9937693,0.0020208277,0.00024369927,0.00022376397,0.000027661083,0.00003807829,0.001031048],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958226,0.00002686484,0.0006646712,0.0018200631,0.00090887194,0.0007569171],"domain_scores_gemma":[0.99643046,0.00082511164,0.00022889677,0.0018979453,0.00043637684,0.00018121795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010554704,0.0005876075,0.0006465747,0.0009943751,0.00036989336,0.00093166943,0.0049121208,0.00034765597,0.000035031637],"category_scores_gemma":[0.00032243115,0.00053601054,0.00016591501,0.001052354,0.00036155438,0.00060271594,0.0019908617,0.0006964875,0.000041553016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008194901,0.000036805286,0.0000029758762,0.0002407783,0.000016319782,0.000021607008,0.00029489613,0.000380909,0.000788796,0.35477284,0.00022789696,0.64320797],"study_design_scores_gemma":[0.00023622611,0.00012446992,0.0000033190065,0.0013614595,0.000026252526,0.00004057254,3.5174273e-7,0.30850807,0.01103861,0.67040503,0.00741304,0.000842629],"about_ca_topic_score_codex":0.000008960252,"about_ca_topic_score_gemma":0.000014540395,"teacher_disagreement_score":0.64236534,"about_ca_system_score_codex":0.00036153756,"about_ca_system_score_gemma":0.0006599732,"threshold_uncertainty_score":0.9997091},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016245454,0.00021463366,0.9892752,0.00014507167,0.00066342944,0.00031161116,0.000014478027,0.000044343567,0.009168757],"genre_scores_gemma":[0.03490742,0.000017984477,0.9638431,0.0003941516,0.00011785299,0.000011681583,0.0000013268691,0.000023708679,0.00068277976],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975434,0.000044038985,0.0005521697,0.00089490373,0.000518193,0.0004472974],"domain_scores_gemma":[0.9967667,0.0021545843,0.000188994,0.0006752969,0.00012930372,0.00008512221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008562727,0.00036256362,0.0005452526,0.00044761636,0.000097150725,0.00012263002,0.00092635944,0.0002572034,0.0000320173],"category_scores_gemma":[0.0015006788,0.00030062438,0.000068955596,0.00024368623,0.00039763932,0.00013893895,0.0007488945,0.00069486396,0.0000033695046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050667836,0.000021473,0.000016935033,0.0001682415,0.0000015136328,0.000023075547,0.00026098677,0.00049763924,0.00010501317,0.42758232,0.000011384033,0.57130635],"study_design_scores_gemma":[0.000094061026,0.000031494106,0.000033239587,0.0008267668,0.0000054081515,0.0000022352544,1.6187836e-7,0.3906914,0.00018518674,0.607901,0.00002320032,0.00020587987],"about_ca_topic_score_codex":0.00006707049,"about_ca_topic_score_gemma":0.00008043398,"teacher_disagreement_score":0.5711005,"about_ca_system_score_codex":0.00024812002,"about_ca_system_score_gemma":0.00030010424,"threshold_uncertainty_score":0.99994457},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021041762,0.0004427549,0.9941996,0.0009981489,0.00096152606,0.0011179249,0.000031347547,0.00067692593,0.0015697151],"genre_scores_gemma":[0.0044342177,0.000051366907,0.9865954,0.0018722331,0.00019363733,0.00020256753,0.000007996663,0.00003868726,0.00660393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960148,0.000023365583,0.00055455754,0.0019626473,0.0006487569,0.00079590327],"domain_scores_gemma":[0.9968519,0.00049073965,0.00030457243,0.0015691331,0.0006480885,0.00013556033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058188674,0.00065956183,0.00064028136,0.0012204993,0.0005722386,0.0005687811,0.003251595,0.00041844347,0.000007136816],"category_scores_gemma":[0.00020668599,0.0006457779,0.00019622351,0.0006994109,0.000576956,0.0010518219,0.0017495564,0.00066360884,0.000006339794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020492931,0.000026620186,0.000001948521,0.00012919822,0.000015652877,0.00003891538,0.00080205966,0.2021958,0.00018768024,0.21218334,0.00041215477,0.58398616],"study_design_scores_gemma":[0.00013735675,0.00013556142,6.5334274e-7,0.00019042839,0.0000050814765,0.000016184238,1.6267018e-7,0.6087718,0.007086887,0.38062486,0.00260072,0.00043027502],"about_ca_topic_score_codex":0.0000089403975,"about_ca_topic_score_gemma":0.000057358036,"teacher_disagreement_score":0.5835559,"about_ca_system_score_codex":0.0005866392,"about_ca_system_score_gemma":0.0010778985,"threshold_uncertainty_score":0.99959934},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000166614,0.00047095807,0.98863035,0.00015125184,0.0077768634,0.0007317971,0.000007971841,0.0002773288,0.001936786],"genre_scores_gemma":[0.037691638,0.000008287242,0.95523614,0.00038053488,0.00199353,0.000029999503,0.0000059510035,0.00004775179,0.004606161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562997,0.00007436047,0.0007198877,0.0020176948,0.00060018187,0.0009579121],"domain_scores_gemma":[0.996138,0.0016371106,0.00037173418,0.0012170391,0.00042229806,0.00021384092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016333665,0.0006649949,0.0007765695,0.0009349258,0.0006365051,0.00076852896,0.0033031844,0.0005953466,0.000009108492],"category_scores_gemma":[0.000519677,0.00064736255,0.00027518655,0.0005366074,0.0002742275,0.0007692885,0.0007525458,0.0013102681,0.000018489933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008157755,0.000030186904,0.000008181396,0.00008394793,0.00001716911,0.000018333956,0.0062797396,0.020501351,0.000038198104,0.3502576,0.000006153502,0.622751],"study_design_scores_gemma":[0.00045005095,0.0003247281,0.000022102475,0.0027634387,0.000017401915,0.00002410468,0.0000069849025,0.92262244,0.0004401245,0.053300735,0.019062167,0.000965716],"about_ca_topic_score_codex":0.00003211083,"about_ca_topic_score_gemma":0.0000921331,"teacher_disagreement_score":0.90212107,"about_ca_system_score_codex":0.00041479376,"about_ca_system_score_gemma":0.0010467602,"threshold_uncertainty_score":0.9995978},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019429447,0.000350744,0.9893025,0.008591465,0.000079103374,0.00087823474,0.00003792902,0.00004789798,0.00051782327],"genre_scores_gemma":[0.045211095,0.00007511396,0.9508235,0.0031615766,0.00022987157,0.000039129438,0.00024020446,0.00001818672,0.00020130552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983345,0.00001271414,0.00035738162,0.00075557694,0.00027491793,0.00026488272],"domain_scores_gemma":[0.99891955,0.0002894334,0.00008423792,0.0005105025,0.000101988306,0.00009430663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095752586,0.00019552198,0.00032147666,0.00034306876,0.00014208982,0.000106820204,0.00043233653,0.00014501394,0.0000070566985],"category_scores_gemma":[0.00012641631,0.00018382481,0.000023144466,0.0001988444,0.0002929053,0.00019523405,0.00029351874,0.0003641884,2.878481e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022823055,0.000042398642,0.000046076497,0.00031537501,0.000011027767,0.000022365493,0.0025080133,0.004494446,0.027772179,0.010066889,0.0005413264,0.95415705],"study_design_scores_gemma":[0.00051463634,0.000034460867,0.000007666129,0.0014766058,0.000023756458,0.00006949838,0.0000032073544,0.92861664,0.002615073,0.063406385,0.0030348478,0.00019719647],"about_ca_topic_score_codex":0.000034040844,"about_ca_topic_score_gemma":0.000046885547,"teacher_disagreement_score":0.9539599,"about_ca_system_score_codex":0.00013147894,"about_ca_system_score_gemma":0.0005182447,"threshold_uncertainty_score":0.7496158},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025727244,0.00054733764,0.9859219,0.005719249,0.00042416385,0.00034171707,0.00071893545,0.00008449078,0.006216432],"genre_scores_gemma":[0.14466336,0.001628492,0.83589303,0.0039342525,0.00088643125,0.000038743237,0.0012102594,0.000055423643,0.011689993],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99639976,0.00002614992,0.0006684534,0.0015600884,0.0010601986,0.00028536],"domain_scores_gemma":[0.9949415,0.0012368725,0.00035734405,0.0030345526,0.00034320622,0.00008656655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019161697,0.00025773575,0.00034403577,0.00068602647,0.00042522218,0.0009966427,0.004861844,0.00032719385,0.00006868715],"category_scores_gemma":[0.0020302504,0.00020203044,0.00003347422,0.0009651428,0.0013956224,0.00059475447,0.003720586,0.00059737125,0.000028498176],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012066121,0.0000108719705,0.00014760465,0.000005617512,0.000004540378,0.0000038769376,0.000045340308,0.0018640878,0.000022351762,0.120275885,0.00257352,0.8750451],"study_design_scores_gemma":[0.00013528776,0.00003632325,0.00068871083,0.00016236323,0.000014549558,0.000022804845,0.000002625406,0.25014305,0.00008703514,0.38370568,0.36463955,0.0003619969],"about_ca_topic_score_codex":0.000011702536,"about_ca_topic_score_gemma":0.00043646098,"teacher_disagreement_score":0.8746831,"about_ca_system_score_codex":0.00008111773,"about_ca_system_score_gemma":0.0005959074,"threshold_uncertainty_score":0.9610649},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014646987,0.00024843818,0.9720811,0.0082559725,0.0006894919,0.0004883677,0.000012739292,0.00013909957,0.018070104],"genre_scores_gemma":[0.7545483,0.00032098885,0.22279572,0.016512891,0.0006834595,0.00008736445,0.00002592678,0.00007110292,0.004954211],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611086,0.000055530523,0.00055533054,0.0017881109,0.00081023265,0.0006799406],"domain_scores_gemma":[0.9967967,0.00038656543,0.0001934517,0.0020314548,0.00040134217,0.0001904738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010030755,0.0004734748,0.00055896386,0.0011511157,0.00020416436,0.00053932465,0.0035018555,0.00034983916,0.00001384626],"category_scores_gemma":[0.00021680183,0.00045066222,0.00012823309,0.0014386709,0.00054915703,0.0006872554,0.0014685158,0.0010725384,0.000028805682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006136792,0.000077097626,0.000019005329,0.000033415043,0.000007750907,0.000044411438,0.0008855499,0.0039250157,0.000042755262,0.39827135,0.00025676188,0.5964308],"study_design_scores_gemma":[0.000282625,0.000116694304,0.0016822106,0.00041972095,0.0000050023696,0.000022487422,8.389789e-7,0.32126033,0.00024328583,0.6718058,0.0035707352,0.0005902831],"about_ca_topic_score_codex":0.0005262332,"about_ca_topic_score_gemma":0.000846327,"teacher_disagreement_score":0.7545337,"about_ca_system_score_codex":0.0012015576,"about_ca_system_score_gemma":0.001463689,"threshold_uncertainty_score":0.9997945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025173304,0.00013650366,0.9964434,0.0010607619,0.0005822201,0.0007492302,0.0000403986,0.00006549543,0.0008968439],"genre_scores_gemma":[0.0017913093,0.00003722365,0.9969296,0.00081960513,0.000090666304,0.000022356367,0.000019914925,0.000019764071,0.00026956442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693745,0.000024978224,0.0005725027,0.0010972105,0.00086457387,0.00050327985],"domain_scores_gemma":[0.99768084,0.0006431419,0.0003001427,0.0007839184,0.00048097913,0.0001109819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007374282,0.00038277937,0.00054336444,0.0013613901,0.00013868623,0.00020400221,0.002285686,0.00023594822,0.000014603707],"category_scores_gemma":[0.00006110246,0.0003239632,0.000116914605,0.000965932,0.00047712884,0.0005271534,0.00065836246,0.0006464562,0.0000020913244],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011148871,0.00009763159,0.00016789178,0.000077166274,0.000016425736,0.00001625346,0.00023417597,0.043813948,0.000013064533,0.0274992,0.000030842068,0.92802227],"study_design_scores_gemma":[0.00049277215,0.00018890739,0.00025795528,0.0004841256,0.0000041608782,0.000012615458,1.9736267e-7,0.7099964,0.000108069085,0.2876555,0.0005082858,0.00029100224],"about_ca_topic_score_codex":0.000055619057,"about_ca_topic_score_gemma":0.0005349558,"teacher_disagreement_score":0.9277313,"about_ca_system_score_codex":0.00014982754,"about_ca_system_score_gemma":0.0009240592,"threshold_uncertainty_score":0.99992126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096021645,0.00023905527,0.9948765,0.00013059835,0.0024295463,0.0004864463,0.00010159864,0.000015884618,0.0007601686],"genre_scores_gemma":[0.9612106,0.00041422225,0.033458404,0.00019206408,0.00069029233,0.00008138622,0.0010976414,0.00003175927,0.0028236331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987462,0.000023161287,0.00032436362,0.0006010799,0.00016168947,0.00014347432],"domain_scores_gemma":[0.99867725,0.000061621766,0.00032138376,0.00048937305,0.00041039631,0.000039977076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027545134,0.0001747714,0.00018358203,0.00027855465,0.00014763782,0.000037249087,0.00029819203,0.00027112532,0.000005651452],"category_scores_gemma":[0.000139139,0.00017062832,0.000105339466,0.00017603696,0.00014500125,0.000008713411,0.000068624315,0.00015434698,3.5389573e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022391965,0.00006033718,0.00036264572,0.00007237011,0.0000415373,8.5380954e-8,0.00009834379,0.03615148,0.1663081,0.0010864945,0.0003904366,0.7952042],"study_design_scores_gemma":[0.0024176484,0.0030815348,0.01750102,0.000780348,0.00023512317,0.000008566162,0.000009972668,0.6654618,0.23776792,0.047451288,0.023559311,0.0017254802],"about_ca_topic_score_codex":0.00003941039,"about_ca_topic_score_gemma":0.000271975,"teacher_disagreement_score":0.9614181,"about_ca_system_score_codex":0.00004993357,"about_ca_system_score_gemma":0.00029433487,"threshold_uncertainty_score":0.6958021},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019145192,0.0016371384,0.9936659,0.00028240596,0.00021186419,0.0008718876,0.000010203622,0.00005770024,0.0030714618],"genre_scores_gemma":[0.011453128,0.00020598003,0.98719627,0.00015293909,0.00012124335,0.0000389253,0.000011750018,0.000016609458,0.00080318004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829394,0.000014623851,0.0003593255,0.00060205016,0.0005485659,0.00018148615],"domain_scores_gemma":[0.998334,0.0000934855,0.00017929745,0.0006206812,0.00072459655,0.000047925696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054651714,0.00020175378,0.00033219112,0.00039072748,0.000074651805,0.000019792118,0.00027331748,0.00018869471,0.00006393922],"category_scores_gemma":[0.000121770645,0.00018883082,0.000069568065,0.00034733195,0.0005441519,0.00009778629,0.00013203107,0.00035923667,0.0000018600116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008715414,0.000020912423,0.000027316497,0.000042996464,0.0000011524891,0.0000021963413,0.000024523493,0.01506193,0.00093208445,0.00068572746,0.000010507312,0.98318195],"study_design_scores_gemma":[0.0005547956,0.00012296312,0.0004542313,0.0014363241,0.000073249976,0.00006408687,2.768408e-7,0.97116405,0.0071337987,0.018212663,0.0005726683,0.00021087298],"about_ca_topic_score_codex":0.000008319321,"about_ca_topic_score_gemma":0.000019222121,"teacher_disagreement_score":0.9829711,"about_ca_system_score_codex":0.00025872103,"about_ca_system_score_gemma":0.0004740112,"threshold_uncertainty_score":0.7700297},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021175873,0.00008384138,0.9960274,0.0018565365,0.00012306713,0.0014322936,0.000005613469,0.00009116851,0.0001683362],"genre_scores_gemma":[0.02591491,0.000015628884,0.97152084,0.0016961854,0.00013922532,0.000126724,0.00023842958,0.000026437237,0.00032161924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983547,0.000028891189,0.0003830034,0.0006733659,0.00030579392,0.0002542799],"domain_scores_gemma":[0.9989539,0.00027225152,0.00019197994,0.00030001818,0.00023172983,0.00005017144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006993377,0.00022320006,0.0002756203,0.0005443515,0.00015238025,0.000044455504,0.00018579049,0.0002160245,0.0000090733965],"category_scores_gemma":[0.00024417162,0.00022180112,0.000076423144,0.00033295044,0.00013334374,0.00010036344,0.00007460643,0.0003857267,0.0000012360765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020365389,0.000064980566,0.00034230843,0.00010136037,0.0000021382414,0.0000026184737,0.00017262038,0.49624434,0.0023320457,0.002039448,0.000009880964,0.49866787],"study_design_scores_gemma":[0.001252705,0.00013381816,0.00018704182,0.00079045456,0.000010353177,0.0000041763547,4.022581e-7,0.9734428,0.002200932,0.020774866,0.0010162146,0.000186254],"about_ca_topic_score_codex":0.000006524318,"about_ca_topic_score_gemma":0.00006720438,"teacher_disagreement_score":0.49848163,"about_ca_system_score_codex":0.00040102008,"about_ca_system_score_gemma":0.0001728578,"threshold_uncertainty_score":0.9044787},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036745605,0.0003013623,0.9956835,0.0011193716,0.00035815377,0.00024397677,0.000020005566,0.00009984202,0.0021370326],"genre_scores_gemma":[0.16364296,0.000022942075,0.8344941,0.00057012436,0.00024487736,0.0000039458605,0.00016593022,0.000028491588,0.0008266152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996287,0.000045430133,0.00046131224,0.001872014,0.0008654514,0.00046878855],"domain_scores_gemma":[0.99694645,0.00029993214,0.00038267128,0.002184279,0.000058834088,0.00012780949],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006776018,0.00041190564,0.00042840536,0.00058882195,0.00050198805,0.0007701791,0.0032723302,0.00016536999,0.000028417307],"category_scores_gemma":[0.000049705024,0.00035752135,0.000084022904,0.0006588236,0.0005172076,0.0012368845,0.0023866508,0.00053797447,0.000013600801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062747927,0.000022167784,0.00027121068,0.000017873643,0.00003141549,0.000055811804,0.00033497665,0.07335676,0.00007931796,0.003435059,0.00003095538,0.92235816],"study_design_scores_gemma":[0.00018331212,0.00009488946,0.0002891359,0.00020361014,0.00003054555,0.00005760203,7.628758e-7,0.97297716,0.00019809342,0.024614112,0.00093075854,0.000419989],"about_ca_topic_score_codex":0.000119669014,"about_ca_topic_score_gemma":0.00010219824,"teacher_disagreement_score":0.9219382,"about_ca_system_score_codex":0.00020736146,"about_ca_system_score_gemma":0.0004195054,"threshold_uncertainty_score":0.9998877},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009732282,0.0010701327,0.99476063,0.0007775205,0.0013537215,0.00039537757,0.000006872591,0.0004626008,0.0010757986],"genre_scores_gemma":[0.12997524,0.00010135792,0.867827,0.0005932492,0.00061950804,0.00001715669,0.000013836042,0.000046495174,0.0008061649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958165,0.000040806113,0.00052980904,0.001856272,0.0009754647,0.00078112073],"domain_scores_gemma":[0.99734014,0.0005541509,0.00042422587,0.0012237692,0.00028263417,0.00017506188],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0008029737,0.0007434779,0.00063599,0.0008412345,0.0004328055,0.0005290439,0.002179552,0.00040625178,0.000010879006],"category_scores_gemma":[0.00032360977,0.0006077614,0.00012914454,0.00076594803,0.00014328116,0.0007041572,0.00097417,0.0033070715,0.000004341232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056361537,0.0000076039532,0.00017142107,0.00005797816,0.000019555826,0.00003773859,0.0007290166,0.7366447,0.00019030678,0.0011076545,0.0000090695185,0.26101932],"study_design_scores_gemma":[0.0002757802,0.00016643867,0.000049027436,0.0016333337,0.000018828634,0.00006301799,6.8630584e-7,0.98993206,0.001735238,0.002370294,0.0031833597,0.000571963],"about_ca_topic_score_codex":0.000054511325,"about_ca_topic_score_gemma":0.00013106586,"teacher_disagreement_score":0.26044735,"about_ca_system_score_codex":0.0005031832,"about_ca_system_score_gemma":0.0005022483,"threshold_uncertainty_score":0.99963737},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049404404,0.00027120137,0.9917879,0.00011616603,0.001876835,0.00038758776,0.00008799804,0.00009813772,0.004880135],"genre_scores_gemma":[0.9858044,0.000007190654,0.013662152,0.000016624032,0.00030666022,0.000028623748,0.000005428938,0.000011526349,0.00015740584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987893,0.00000603496,0.00035066737,0.0003440366,0.00022598341,0.00028397416],"domain_scores_gemma":[0.9992269,0.00025455965,0.000056282795,0.00031908063,0.00009370583,0.000049433726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002595641,0.00020817133,0.00038766113,0.00014144706,0.00008372253,0.00004073729,0.00034112288,0.00019505245,0.000008443138],"category_scores_gemma":[0.000069120586,0.00019577306,0.0001522357,0.00017290562,0.00019368455,0.00011661816,0.00007826362,0.00016401047,0.000002485824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013753609,0.0000106650095,0.000039164886,0.00031404998,0.00002916951,4.2412753e-7,0.00004611575,0.14434117,0.00021550593,0.005027166,0.000023177678,0.84993964],"study_design_scores_gemma":[0.0001908038,0.000068808586,0.00038143113,0.00043703883,0.00004126559,0.0000126061805,4.1972731e-7,0.9653621,0.00027899,0.03176743,0.0011453574,0.00031378676],"about_ca_topic_score_codex":0.000028975586,"about_ca_topic_score_gemma":0.00015816219,"teacher_disagreement_score":0.9853103,"about_ca_system_score_codex":0.00030328304,"about_ca_system_score_gemma":0.000103328464,"threshold_uncertainty_score":0.79833937},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022012004,0.00012902096,0.9935018,0.000516162,0.0008023343,0.0006135348,0.0000050407193,0.00028466104,0.0039273193],"genre_scores_gemma":[0.15003382,0.000024639057,0.8486995,0.0007988294,0.000094575924,0.000024946521,0.0000063979032,0.000026236172,0.00029102725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962214,0.00015351104,0.0008930476,0.001425694,0.0007825203,0.0005237858],"domain_scores_gemma":[0.99710464,0.00071350805,0.00051142543,0.0011665246,0.00039421272,0.00010966641],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014434402,0.0005028256,0.0006902884,0.0020050616,0.00017033283,0.00037455274,0.0027626366,0.00036801197,0.000012243435],"category_scores_gemma":[0.00016220362,0.00050875795,0.00014597231,0.0015672687,0.00035001975,0.00078502187,0.0012920401,0.0010496493,0.000005040332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010421451,0.00007465113,0.0004142297,0.00006472307,0.000015108167,0.000032682154,0.002121148,0.06670565,0.0012049038,0.009991091,0.000013149343,0.91935223],"study_design_scores_gemma":[0.00039686347,0.00014196378,0.00066329894,0.0008335964,0.00000826905,0.000041561914,8.3161575e-7,0.94826525,0.02022409,0.028267654,0.00054910395,0.0006074853],"about_ca_topic_score_codex":0.00019149222,"about_ca_topic_score_gemma":0.00043945262,"teacher_disagreement_score":0.91874474,"about_ca_system_score_codex":0.0003608668,"about_ca_system_score_gemma":0.00066268625,"threshold_uncertainty_score":0.9997364},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023087143,0.0015858228,0.9867689,0.000035067056,0.0008884458,0.00031015874,0.0000069905623,0.0002224307,0.00995132],"genre_scores_gemma":[0.45614195,0.0001532011,0.53163064,0.0005494182,0.0011059258,0.00012312306,0.000092037786,0.00027714818,0.0099265985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704605,0.000025701984,0.0005374245,0.0009251592,0.0003333451,0.0011323213],"domain_scores_gemma":[0.9984039,0.00081352354,0.00012537048,0.0004029897,0.0001357017,0.00011848083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006716449,0.00062031293,0.00059203146,0.0012128646,0.00025024422,0.00021619906,0.0008121956,0.00031008813,0.00001419968],"category_scores_gemma":[0.00029421854,0.00063644437,0.00015661666,0.00048651887,0.00017929927,0.00017871795,0.0004009492,0.0010964129,9.3512557e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009880894,0.000004911327,0.000039203012,0.00023792629,0.000010489686,0.00009132317,0.00022581247,0.5712831,0.000021104477,0.00088369136,0.000011052893,0.4271815],"study_design_scores_gemma":[0.00045462223,0.000060471335,0.000016237593,0.0010773296,0.0000105843355,0.000053858443,0.0000014680257,0.97092736,0.00063874095,0.0066088936,0.019528864,0.0006215682],"about_ca_topic_score_codex":0.000080808575,"about_ca_topic_score_gemma":0.0008765536,"teacher_disagreement_score":0.45591107,"about_ca_system_score_codex":0.00041949848,"about_ca_system_score_gemma":0.00017419875,"threshold_uncertainty_score":0.9996087},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006542495,0.000113764436,0.9864231,0.0017788811,0.0017149951,0.00131767,0.000056600686,0.00037440046,0.008155203],"genre_scores_gemma":[0.23059645,0.000051885832,0.75674963,0.0046189683,0.00089414755,0.000247419,0.0001564665,0.00011895286,0.006566071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956665,0.00002348647,0.0005519279,0.0021057206,0.0008509461,0.00080142054],"domain_scores_gemma":[0.99529696,0.0011854927,0.00031084183,0.0027739203,0.00023730451,0.00019549616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088966236,0.0007217793,0.00071150914,0.0008995127,0.0005253207,0.0006273578,0.004303074,0.00050251326,0.000017387794],"category_scores_gemma":[0.00010941786,0.0006592609,0.00029586235,0.0007844059,0.0004622895,0.00042050052,0.0013209656,0.00084266294,0.000049174167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000125525885,0.000121873505,0.000004579945,0.00016858029,0.000030849606,0.00004575174,0.0002852566,0.012405121,0.00066025194,0.42251325,0.0009144772,0.5628375],"study_design_scores_gemma":[0.00046706796,0.00020829975,0.000018577806,0.00031637552,0.000015942678,0.000015629357,7.670266e-8,0.7336339,0.0058421814,0.24466065,0.01416424,0.00065707887],"about_ca_topic_score_codex":0.000018766716,"about_ca_topic_score_gemma":0.000059084472,"teacher_disagreement_score":0.7212288,"about_ca_system_score_codex":0.00035174983,"about_ca_system_score_gemma":0.00096902903,"threshold_uncertainty_score":0.99958587},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033746948,0.0006960109,0.99242944,0.0009133681,0.00072244834,0.0004486575,0.000032687367,0.00025609077,0.004163808],"genre_scores_gemma":[0.3346619,0.00015420152,0.6555152,0.002584015,0.00041552586,0.00006930668,0.00010881814,0.000102920734,0.0063881036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99629146,0.000030571373,0.0006660142,0.0015276696,0.00090506504,0.0005792118],"domain_scores_gemma":[0.9963594,0.0003089369,0.00049270515,0.0023999475,0.00029370317,0.00014528507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051340053,0.0005200688,0.00065076636,0.0006629186,0.00022827569,0.0003090707,0.0047965376,0.0003887949,0.000028208591],"category_scores_gemma":[0.000054277876,0.00050536875,0.00014443263,0.001176887,0.00033709806,0.0004574581,0.0021633809,0.0006845236,0.000035146877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010404917,0.0004367544,0.0001929542,0.0005359058,0.00009684295,0.00014834657,0.0010756206,0.007171093,0.0683997,0.06297344,0.0037605937,0.8551983],"study_design_scores_gemma":[0.00045589593,0.00012685561,0.00008090946,0.0008646841,0.000024414805,0.00002584599,4.4351637e-7,0.8751438,0.055347234,0.055735167,0.01119834,0.0009963816],"about_ca_topic_score_codex":0.000073815754,"about_ca_topic_score_gemma":0.000028302416,"teacher_disagreement_score":0.86797273,"about_ca_system_score_codex":0.00017397561,"about_ca_system_score_gemma":0.00064158463,"threshold_uncertainty_score":0.99973977},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071649504,0.0014296953,0.996233,0.0002196177,0.00052458956,0.00007831866,0.00006405013,0.00015448919,0.00057977805],"genre_scores_gemma":[0.82944554,0.00014484597,0.1695004,0.00030070776,0.000281757,0.0000013148335,0.00010906969,0.00004661043,0.00016973849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747217,0.000019647392,0.0004674727,0.0008951897,0.00076821627,0.00037732124],"domain_scores_gemma":[0.99824196,0.00047626084,0.000080400496,0.000959699,0.000093127346,0.0001485306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006310557,0.00034372095,0.00055614917,0.0005543814,0.00010266966,0.00011785867,0.0021262425,0.00019390347,0.00014632836],"category_scores_gemma":[0.0002480401,0.00032663075,0.00007196988,0.00039138924,0.0002171341,0.00014571963,0.0011608992,0.00089191314,0.000014092887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.327879e-7,0.000004383525,0.00026603992,0.00002858548,0.000028446628,0.000015471034,0.00021107907,0.6050032,0.0003850237,0.000012205217,0.000019303512,0.39402547],"study_design_scores_gemma":[0.00011013102,0.000006876066,0.00006246494,0.00063890766,0.000033799628,0.0000029312716,6.4637413e-7,0.9973253,0.00053282466,0.0004702648,0.0005148642,0.00030097063],"about_ca_topic_score_codex":0.0003452067,"about_ca_topic_score_gemma":0.00031076453,"teacher_disagreement_score":0.82872903,"about_ca_system_score_codex":0.000086477376,"about_ca_system_score_gemma":0.00020603271,"threshold_uncertainty_score":0.9999186},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042903383,0.00023426519,0.98334867,0.009537871,0.002061093,0.00086343434,0.00007559472,0.00018273974,0.003267285],"genre_scores_gemma":[0.39653787,0.000050022925,0.4896337,0.10045984,0.0018811668,0.00013261558,0.000024405805,0.00020758179,0.011072796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558234,0.000058030007,0.00045979233,0.0021498685,0.0009408728,0.00080910116],"domain_scores_gemma":[0.9788894,0.019689908,0.00016917786,0.0008649712,0.00028297014,0.00010358162],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014407039,0.0005657693,0.0006804768,0.0008748161,0.0006541563,0.00033785816,0.0013509332,0.00030923254,0.000030356945],"category_scores_gemma":[0.011862569,0.000550782,0.00020937702,0.0009147567,0.0007103237,0.00029728576,0.00070184766,0.000739131,0.000021382293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058208643,0.000038049617,0.000028836228,0.00015704671,0.000009106995,0.000015664202,0.00006161061,0.9214957,0.0023206042,0.004662672,0.00072950375,0.070423],"study_design_scores_gemma":[0.00046408942,0.0001462077,0.0000033180988,0.00039652886,0.000012443504,0.0000072904045,1.2568796e-7,0.9379858,0.007470976,0.04712083,0.0058556013,0.0005368023],"about_ca_topic_score_codex":0.000024754443,"about_ca_topic_score_gemma":0.000067252855,"teacher_disagreement_score":0.49371496,"about_ca_system_score_codex":0.00048656133,"about_ca_system_score_gemma":0.00097108504,"threshold_uncertainty_score":0.99969435},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045767864,0.0017712248,0.9821426,0.004094074,0.0014085325,0.0014660428,0.000021239723,0.00015058552,0.00436888],"genre_scores_gemma":[0.5082942,0.00013237655,0.4732047,0.004690548,0.0009823536,0.000064610336,0.000029424898,0.00010955449,0.012492209],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977068,0.000009924987,0.00038672416,0.00097241387,0.0004041317,0.00052003167],"domain_scores_gemma":[0.9982017,0.0008036905,0.00012746858,0.0005383888,0.00014825031,0.0001804882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034324994,0.00041324215,0.000711608,0.0007024249,0.0002101608,0.00013256387,0.00031201157,0.00029632886,0.000026513308],"category_scores_gemma":[0.00024640656,0.00034348498,0.000137065,0.00025371142,0.0005683711,0.00016752024,0.0003620882,0.00046282113,0.000007879671],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018274493,0.00006889446,0.003825603,0.00090447965,0.00010571012,0.00021341238,0.0010621097,0.00026693617,0.00085395045,0.017487688,0.0004968393,0.97453165],"study_design_scores_gemma":[0.0164638,0.0047044572,0.008429849,0.011439952,0.00071265857,0.0008506841,0.000008518286,0.30436093,0.03232939,0.44829714,0.16722846,0.005174165],"about_ca_topic_score_codex":0.000014401483,"about_ca_topic_score_gemma":0.000058348436,"teacher_disagreement_score":0.9693575,"about_ca_system_score_codex":0.00022806494,"about_ca_system_score_gemma":0.0003658353,"threshold_uncertainty_score":0.9999017},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008232567,0.0008912799,0.97245264,0.0029681164,0.0016048794,0.00041818526,0.000017212025,0.0001624081,0.013252712],"genre_scores_gemma":[0.789746,0.00035608106,0.19498925,0.0023383063,0.00078505545,0.0000042769343,0.000027006177,0.000047313173,0.011706741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757373,0.000022789181,0.00045041397,0.0008964962,0.00070618384,0.00035040188],"domain_scores_gemma":[0.9974553,0.0010394071,0.00015073933,0.00084378157,0.00035627023,0.00015451155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038736014,0.0003286121,0.00063287996,0.0005919019,0.0001886295,0.000136925,0.00053129473,0.00024953712,0.00006065729],"category_scores_gemma":[0.0010866795,0.00026748062,0.00017178078,0.000491204,0.00089428225,0.00008269234,0.00029198913,0.0008725109,0.000022969783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006879697,0.00004260048,0.0012566269,0.00012885134,0.00006306801,0.00056725816,0.00010755166,0.04205917,0.00046642948,0.00047280482,0.0001347073,0.95463216],"study_design_scores_gemma":[0.0004962201,0.00024542626,0.00023224307,0.0019449549,0.00020784154,0.00048613257,8.4673076e-7,0.975988,0.0010296681,0.017261788,0.001676252,0.00043064757],"about_ca_topic_score_codex":0.000038361293,"about_ca_topic_score_gemma":0.000041746087,"teacher_disagreement_score":0.95420146,"about_ca_system_score_codex":0.00022043224,"about_ca_system_score_gemma":0.00051831186,"threshold_uncertainty_score":0.99997777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011390169,0.00020017511,0.9958523,0.0004268743,0.0012041647,0.00063351524,0.000036567202,0.00017789377,0.0013546069],"genre_scores_gemma":[0.1506544,0.0002057833,0.8427379,0.0027433683,0.0006341839,0.00012024819,0.0003614151,0.00005184863,0.0024908653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972104,0.000030363868,0.0004768139,0.0012991262,0.0005657741,0.00041755795],"domain_scores_gemma":[0.9978249,0.00072143564,0.00027124802,0.0007268841,0.0003514429,0.000104074854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027653968,0.00037390983,0.00039339074,0.0012429312,0.0004013511,0.00073331554,0.0014385622,0.00027010185,0.00007237236],"category_scores_gemma":[0.000061988925,0.00037632714,0.00014087903,0.0008625174,0.00015550533,0.0010306863,0.00041742748,0.00036845147,0.00003068479],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005905273,0.000048659647,0.0000053276226,0.000039304196,0.000024219542,0.0000032229912,0.00023182896,0.06679937,0.00019378717,0.013057656,0.00012021725,0.9194705],"study_design_scores_gemma":[0.00021457477,0.00004577206,0.00001560026,0.0001419808,0.0000152104585,0.0000015208992,9.438766e-8,0.6006775,0.0013165426,0.39698127,0.00035144435,0.00023848933],"about_ca_topic_score_codex":0.00002951393,"about_ca_topic_score_gemma":0.00003517519,"teacher_disagreement_score":0.919232,"about_ca_system_score_codex":0.00021937134,"about_ca_system_score_gemma":0.00032297254,"threshold_uncertainty_score":0.99986887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003935823,0.000118682685,0.9785041,0.0008073151,0.00047255502,0.00039671033,0.0000036622014,0.00032658977,0.019366425],"genre_scores_gemma":[0.12422876,0.000042740485,0.8712905,0.0014312172,0.00025264724,0.000041572264,0.000004353805,0.00001792026,0.0026902799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780846,0.000013285688,0.00034982275,0.0010635802,0.00043108437,0.00033374364],"domain_scores_gemma":[0.9981968,0.00020558618,0.00020041737,0.0010941104,0.00022047386,0.000082614686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032087843,0.00030922913,0.00027699867,0.0007138409,0.00027845803,0.00028729878,0.0020369594,0.0002580163,0.000012586702],"category_scores_gemma":[0.000026087733,0.00029951843,0.00010673146,0.00071074517,0.0003062604,0.00041752387,0.0008648257,0.0005166564,0.000033728087],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019256124,0.000012134496,0.000020422727,0.000008241987,0.0000044463304,0.0000056278654,0.00007972263,0.0055940174,0.000031000185,0.28594443,0.00010401394,0.708194],"study_design_scores_gemma":[0.00006432638,0.00009357528,0.000093394585,0.00012652065,0.0000039082975,0.000011858905,4.507938e-8,0.6173506,0.00062489894,0.37670502,0.004634681,0.00029117183],"about_ca_topic_score_codex":0.000024929204,"about_ca_topic_score_gemma":0.00007889803,"teacher_disagreement_score":0.70790285,"about_ca_system_score_codex":0.00025697146,"about_ca_system_score_gemma":0.00039819503,"threshold_uncertainty_score":0.9999457},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006312904,0.00011769463,0.9796646,0.00031368347,0.0056490484,0.00024780328,0.000020621968,0.000076619035,0.013846785],"genre_scores_gemma":[0.0022192665,0.000024892339,0.9723941,0.0009357611,0.0003667209,0.000011685415,0.0000047748986,0.000014950976,0.02402785],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747044,0.000056418652,0.00033905715,0.0008788223,0.0007685613,0.0004867105],"domain_scores_gemma":[0.993958,0.0046521924,0.00018106449,0.0008616891,0.00027461775,0.0000724215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022122543,0.00026845824,0.00038194036,0.0009442536,0.00026100196,0.0004754215,0.0017873121,0.00014389897,0.000018209435],"category_scores_gemma":[0.007477328,0.00022507318,0.00005738567,0.0013199194,0.0023084963,0.00026080775,0.0007243478,0.0004957491,0.00001219939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000114797,0.00012449526,0.00012624126,0.000519226,0.000011405999,0.000030293058,0.0022697994,0.0011542992,0.00036318865,0.37935555,0.0159182,0.60011584],"study_design_scores_gemma":[0.000083902974,0.000029375755,0.00012260635,0.00037171526,0.0000116911515,0.000009303251,8.588489e-7,0.004518812,0.0024440817,0.9901214,0.0020087608,0.00027744885],"about_ca_topic_score_codex":0.0000063289176,"about_ca_topic_score_gemma":0.000019568053,"teacher_disagreement_score":0.6107659,"about_ca_system_score_codex":0.0006157018,"about_ca_system_score_gemma":0.006574617,"threshold_uncertainty_score":0.9990572},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010074537,0.0014046883,0.9849777,0.0067101833,0.00033543856,0.0004384279,0.000012630261,0.00011694595,0.0059938673],"genre_scores_gemma":[0.5309068,0.00017296801,0.46194485,0.0030891418,0.00017958775,0.00008055042,0.00006648453,0.000037045564,0.0035225567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956919,0.00017671281,0.00050280377,0.0017813642,0.0012472128,0.00060001476],"domain_scores_gemma":[0.99600464,0.0008310103,0.0003479252,0.002597619,0.00012120944,0.00009761618],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002438043,0.00058083935,0.00084643706,0.0021668817,0.0003475884,0.0010408115,0.0051197493,0.00035359012,0.000011657837],"category_scores_gemma":[0.00012490411,0.00040410896,0.00040265685,0.0033988615,0.00035442485,0.0006187104,0.0007198636,0.0016652516,0.000007524151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008468936,0.00007148033,0.0003001369,0.00004517081,0.00043418776,0.00008666956,0.002410145,0.45364654,0.00003460036,0.5031978,0.000114773255,0.03965003],"study_design_scores_gemma":[0.00013363901,0.000035572863,0.00032045224,0.000059476624,0.0009933716,0.000012739829,0.00000232127,0.9443535,0.000023819328,0.05302426,0.0006007033,0.0004401055],"about_ca_topic_score_codex":0.000086476124,"about_ca_topic_score_gemma":0.00094393117,"teacher_disagreement_score":0.5308967,"about_ca_system_score_codex":0.0004403887,"about_ca_system_score_gemma":0.0005265231,"threshold_uncertainty_score":0.9999962},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057306915,0.0005467942,0.98308444,0.003984135,0.0038564121,0.0020646767,0.000005687201,0.000036937705,0.0058478294],"genre_scores_gemma":[0.9838961,0.0000054558664,0.012780475,0.00057696516,0.00073506194,0.00029047823,0.000069852125,0.000024895982,0.0016207338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961988,0.0007375749,0.00072315236,0.0010307892,0.00094236044,0.00036736001],"domain_scores_gemma":[0.99421,0.0032883603,0.0004689831,0.0013222509,0.0006621779,0.000048222137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028909144,0.00027436216,0.0002686341,0.00087611214,0.00037713742,0.00013302053,0.0012369099,0.00026974053,0.000019293244],"category_scores_gemma":[0.00018752235,0.00021785621,0.000085410706,0.001897592,0.0003699866,0.00009804768,0.00014625007,0.00078991655,0.000015776666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042651332,0.000103976505,0.00028792454,0.000048071222,0.000008918464,1.827676e-7,0.0019164953,0.6866802,0.00002198516,0.036670372,0.00009016776,0.27412903],"study_design_scores_gemma":[0.0003889359,0.00013757602,0.016663628,0.004952875,0.000059007554,7.836032e-7,0.00054328906,0.9173361,0.00014052157,0.049472824,0.009836168,0.00046830406],"about_ca_topic_score_codex":0.0020522473,"about_ca_topic_score_gemma":0.00020268802,"teacher_disagreement_score":0.98332304,"about_ca_system_score_codex":0.0022674922,"about_ca_system_score_gemma":0.0027689987,"threshold_uncertainty_score":0.88839185},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011216011,0.0070535773,0.98611194,0.0016343305,0.00011338816,0.0041236836,0.000021164096,0.000091443646,0.00083927636],"genre_scores_gemma":[0.0073114056,0.0019238963,0.98364365,0.006072917,0.00011552662,0.0007520475,0.000021619215,0.000031729207,0.00012722469],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.9969355,0.000026890239,0.00069851114,0.0012256224,0.00058387493,0.0005296199],"domain_scores_gemma":[0.9967293,0.00049226504,0.0004624132,0.0015882854,0.0005475257,0.00018018422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091208133,0.00039463796,0.0007415297,0.00048670874,0.0003107062,0.00030111568,0.0025124236,0.00012856316,0.0000048471306],"category_scores_gemma":[0.00014971918,0.0003472409,0.00010663794,0.0012543879,0.00019543241,0.00034340326,0.00084549986,0.00023823814,0.0000056863933],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000652919,0.00003313393,0.0000061095334,0.0059220735,0.000031142725,0.0000017156783,0.0003943401,0.0051517296,0.00023317714,0.012584299,0.000049840764,0.97558594],"study_design_scores_gemma":[0.0023073447,0.0029991837,0.0006224754,0.548425,0.0005346376,0.00021167008,0.0000032398834,0.3226808,0.013486876,0.070523344,0.032740716,0.005464697],"about_ca_topic_score_codex":0.000036918624,"about_ca_topic_score_gemma":0.00021676077,"teacher_disagreement_score":0.9701212,"about_ca_system_score_codex":0.00011210762,"about_ca_system_score_gemma":0.0013547621,"threshold_uncertainty_score":0.99989796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052113308,0.000344999,0.9904089,0.0012171778,0.0028966228,0.0008221665,0.000009668372,0.0002650408,0.0039832992],"genre_scores_gemma":[0.41931665,0.000051097253,0.5764754,0.0023300492,0.0010904542,0.00006779235,0.000035343626,0.00003602588,0.00059720466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652034,0.000033311546,0.00073994114,0.0015208927,0.00060465845,0.0005808813],"domain_scores_gemma":[0.99577963,0.001766779,0.0005859397,0.0012217249,0.000527937,0.00011801306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013924652,0.00042841857,0.0004694389,0.0006839056,0.0005567326,0.00073740527,0.0025177863,0.0004107437,0.000009900028],"category_scores_gemma":[0.00041806023,0.00046281205,0.00017055376,0.0005329567,0.00033220154,0.0007031381,0.00043239613,0.0006842352,0.000018458917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009630251,0.000030850857,0.000015988227,0.00008570004,0.0000126462555,0.0000054493075,0.0006308083,0.010925665,0.0003259534,0.14865619,0.00009202714,0.8392091],"study_design_scores_gemma":[0.00038220765,0.000089204616,0.00016829548,0.00046457438,0.000012644463,0.000023291897,3.8708714e-7,0.89061457,0.002631389,0.09086337,0.014196686,0.0005534116],"about_ca_topic_score_codex":0.000031345484,"about_ca_topic_score_gemma":0.000022963584,"teacher_disagreement_score":0.87968886,"about_ca_system_score_codex":0.00051685324,"about_ca_system_score_gemma":0.0010332452,"threshold_uncertainty_score":0.9997824},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008699334,0.0005015846,0.98819774,0.0065158964,0.00092518935,0.0024059797,0.00001525207,0.00010768915,0.00046073674],"genre_scores_gemma":[0.2651566,0.00067485496,0.7150932,0.015550913,0.0018351418,0.001007481,0.00006725931,0.00008281377,0.0005317344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970831,0.00013759494,0.0008699429,0.0007067707,0.00068333733,0.000519238],"domain_scores_gemma":[0.9897485,0.009188621,0.0002517078,0.00033920506,0.00035199762,0.00012001087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005159038,0.00025164342,0.00045014685,0.00051727006,0.00037325264,0.000031625095,0.0005267492,0.00066798687,0.000030203248],"category_scores_gemma":[0.00639658,0.00023521001,0.000039221784,0.0002620486,0.00022486594,0.00017191042,0.0003430814,0.0015524945,0.0000025039844],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028871886,0.000009602943,0.00035196217,0.0023416576,0.0000042171805,0.000008641405,0.004885921,0.0009708699,0.00007857146,0.03195517,0.000018309207,0.95934623],"study_design_scores_gemma":[0.0005544366,0.000266561,0.0010098618,0.01845242,0.000010390172,0.000008073035,0.000010662629,0.8261239,0.00020258263,0.15089749,0.001958129,0.000505476],"about_ca_topic_score_codex":0.00017861529,"about_ca_topic_score_gemma":0.00054892135,"teacher_disagreement_score":0.9588407,"about_ca_system_score_codex":0.00034269455,"about_ca_system_score_gemma":0.0019019457,"threshold_uncertainty_score":0.9591586},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049615307,0.0004944356,0.9910768,0.0006726678,0.00045160422,0.001370788,0.00001599393,0.00009276478,0.0008634113],"genre_scores_gemma":[0.0076521556,0.000051632487,0.9902598,0.0007806636,0.00042979198,0.000026328391,0.000026046062,0.000028961034,0.00074458367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977373,0.000016875254,0.0003773445,0.00084752176,0.0004985242,0.0005224594],"domain_scores_gemma":[0.99873763,0.00044566402,0.00008921561,0.00031066313,0.00026038894,0.00015642084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072028633,0.00033958664,0.0004871483,0.0005607119,0.0002883045,0.00016708946,0.00030316206,0.00032766862,0.00003238864],"category_scores_gemma":[0.00023499125,0.0002981904,0.000077990306,0.00023683369,0.000278216,0.00017954118,0.00022994577,0.00073311524,0.000004193662],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067455025,0.000044238906,0.0001256019,0.0008626776,0.000016744976,0.00012733685,0.00063392305,0.0000411571,0.001377635,0.00026085626,0.0000036849374,0.9964387],"study_design_scores_gemma":[0.0018433265,0.00028406372,0.000010791243,0.0003995739,0.000050083854,0.00015049824,0.0000019924553,0.99380636,0.0014567755,0.0017217639,0.0000055057367,0.0002692598],"about_ca_topic_score_codex":0.0000067596916,"about_ca_topic_score_gemma":0.000020708732,"teacher_disagreement_score":0.99616945,"about_ca_system_score_codex":0.00028245643,"about_ca_system_score_gemma":0.0005115998,"threshold_uncertainty_score":0.999947},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014307712,0.00058675907,0.99444395,0.00097187696,0.00005870373,0.0003993494,0.0000041500525,0.000036940575,0.0020674714],"genre_scores_gemma":[0.6635321,0.0004658178,0.3343363,0.00089753285,0.00017187826,0.00003248558,0.00001854322,0.000022910199,0.000522439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794155,0.000039074017,0.0004029755,0.000902634,0.00039073202,0.00032300962],"domain_scores_gemma":[0.99840343,0.00065840804,0.00015702736,0.00063684315,0.000027233062,0.00011708266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072127394,0.00030108445,0.00039623017,0.00063000305,0.00020197479,0.00047787005,0.0008372867,0.00019426362,0.000004741409],"category_scores_gemma":[0.00008172395,0.00027448256,0.000032391883,0.00030896332,0.00042592833,0.00037724385,0.0005560377,0.00044526684,0.000003555102],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013080423,0.00001145562,0.00094083854,0.000054361313,0.0000054050106,0.000005621832,0.001247815,0.0018971276,0.00003267916,0.011956059,0.0000028568809,0.98384446],"study_design_scores_gemma":[0.00048149293,0.0001591346,0.016722009,0.0011633547,0.000022840171,0.00002707961,0.0000015585338,0.7499384,0.0002059541,0.22916399,0.001338348,0.00077579706],"about_ca_topic_score_codex":0.00004256586,"about_ca_topic_score_gemma":0.00010176762,"teacher_disagreement_score":0.9830687,"about_ca_system_score_codex":0.00018527788,"about_ca_system_score_gemma":0.00012123385,"threshold_uncertainty_score":0.99997073},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011329523,0.00020159404,0.97525597,0.0046668197,0.0019212803,0.0010649817,0.00008447979,0.00016182062,0.0053135594],"genre_scores_gemma":[0.9788585,0.000048807433,0.01758644,0.0026822153,0.0002457795,0.000012368116,0.000023482533,0.00002148079,0.000520966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746895,0.00007367754,0.00039050286,0.0012996984,0.00047861412,0.00028856707],"domain_scores_gemma":[0.9981841,0.00071551773,0.00021394464,0.0007740395,0.00003770101,0.00007473141],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062182284,0.00024507398,0.00023747275,0.0010990435,0.00023955906,0.00026017724,0.00090100325,0.00010446692,0.000013021701],"category_scores_gemma":[0.0008001102,0.000254784,0.000026849615,0.00095630693,0.0003174554,0.00047114005,0.00065208477,0.0005113596,0.0000057583625],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003973343,0.000099189514,0.0064252913,0.00022027556,0.000002952177,0.00009109371,0.001384056,0.004583667,0.01171501,0.019885058,0.0002824366,0.95527124],"study_design_scores_gemma":[0.0010807696,0.00013474606,0.031104166,0.00040686282,0.000038825194,0.00013536452,0.000004984436,0.8597095,0.007134539,0.097362906,0.0016504513,0.001236858],"about_ca_topic_score_codex":0.000048345966,"about_ca_topic_score_gemma":0.0005187932,"teacher_disagreement_score":0.96752894,"about_ca_system_score_codex":0.00022984354,"about_ca_system_score_gemma":0.00026343667,"threshold_uncertainty_score":0.99999046},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006024211,0.0009991807,0.989562,0.0017880257,0.003540032,0.0003240839,0.000016602038,0.00015934858,0.003550481],"genre_scores_gemma":[0.24298511,0.00012481867,0.75088394,0.0027237195,0.002537912,0.00001848727,0.000032250766,0.000038271144,0.00065548584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949797,0.00013198935,0.00070160505,0.0017699761,0.0016912557,0.0007255004],"domain_scores_gemma":[0.9974853,0.00034884483,0.0003514488,0.0011624628,0.00044072184,0.00021126682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013995656,0.0006382633,0.0006331063,0.0006365422,0.0003716077,0.0008027024,0.003161073,0.00034765806,0.00012488723],"category_scores_gemma":[0.00037227725,0.00058207003,0.00014314865,0.00053400174,0.0008052797,0.0012190219,0.0015536005,0.000884224,0.000042095788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008046147,0.000034798697,0.0000061110013,0.000029743243,0.000034547476,0.00017408734,0.0013566798,0.050963886,0.0020593053,0.0036156084,0.0004034981,0.9413137],"study_design_scores_gemma":[0.0003185531,0.000095145755,0.000037503843,0.00039432372,0.000012830049,0.00003059796,5.2045715e-7,0.9837058,0.009228781,0.0047712135,0.0008323458,0.00057237817],"about_ca_topic_score_codex":0.0002709664,"about_ca_topic_score_gemma":0.00022182763,"teacher_disagreement_score":0.9407413,"about_ca_system_score_codex":0.00047903493,"about_ca_system_score_gemma":0.0010313223,"threshold_uncertainty_score":0.99966305},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001113394,0.0016955073,0.9915722,0.000983333,0.0039135106,0.0010400501,0.000060096605,0.0000712919,0.00055265264],"genre_scores_gemma":[0.1830832,0.000025587015,0.8144891,0.0010689946,0.00082430505,0.000032839987,0.00022254998,0.000019084833,0.00023432476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957315,0.000095420386,0.0006218489,0.0021679604,0.0008946935,0.00048861647],"domain_scores_gemma":[0.99377656,0.0009871855,0.00046855368,0.0044222735,0.0002774017,0.00006803311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028730675,0.00037224405,0.00041120523,0.00037337496,0.00030425916,0.00042802442,0.004616279,0.00036733405,0.00001568539],"category_scores_gemma":[0.00036712582,0.00028940407,0.00009000153,0.00027653773,0.00015746274,0.0009847635,0.0019992718,0.0005990123,0.0000018135543],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004237767,0.00000971079,0.000005792159,0.000012998696,0.000020870762,0.00003136873,0.0012418859,0.11628227,0.00016316312,0.008316415,0.00011121536,0.8738001],"study_design_scores_gemma":[0.00016653932,0.000018010189,0.000017048262,0.00007475331,0.000021739932,0.00005300403,6.4551864e-7,0.7268273,0.00023961937,0.2715516,0.00081797724,0.0002116869],"about_ca_topic_score_codex":0.000065823784,"about_ca_topic_score_gemma":0.00028635052,"teacher_disagreement_score":0.8735884,"about_ca_system_score_codex":0.00026744037,"about_ca_system_score_gemma":0.00091845525,"threshold_uncertainty_score":0.99995583},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010819964,0.00043251493,0.9939417,0.002342382,0.0016207776,0.00080843345,0.0000042150245,0.00028941224,0.0005497417],"genre_scores_gemma":[0.050146557,0.00012590877,0.9462347,0.0025349723,0.00040340383,0.00020815153,0.000037580307,0.00003659429,0.00027214873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954046,0.00007461681,0.00081891246,0.001497233,0.0015187074,0.0006859146],"domain_scores_gemma":[0.99731505,0.0010578745,0.00028894926,0.0008988813,0.00024069681,0.00019854103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019490853,0.00044462876,0.00051739154,0.0012699373,0.00023381409,0.0005147991,0.0025970668,0.00027386812,0.00003113709],"category_scores_gemma":[0.00040591418,0.0004460587,0.00010185126,0.0007054184,0.00048399324,0.0020982435,0.0010854519,0.00082151004,0.0000045658694],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061621704,0.00002470219,0.000011559826,0.00008358521,0.000008527852,0.000020383945,0.00033878686,0.06294531,0.000085006934,0.09218851,0.00006280335,0.8442247],"study_design_scores_gemma":[0.00034088801,0.000031523494,0.000021112512,0.0008529498,0.0000074083214,0.00000905128,2.8041143e-7,0.7191341,0.0011133975,0.27793753,0.00024196181,0.00030982777],"about_ca_topic_score_codex":0.00010271231,"about_ca_topic_score_gemma":0.00011024482,"teacher_disagreement_score":0.84391487,"about_ca_system_score_codex":0.00045596814,"about_ca_system_score_gemma":0.0009189665,"threshold_uncertainty_score":0.99979913},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006709182,0.0010734561,0.9862255,0.0003961544,0.004852901,0.00037344932,0.000013050108,0.000094597555,0.00026169937],"genre_scores_gemma":[0.22164668,0.00019475375,0.7764042,0.00067975343,0.00087922986,0.000005765163,0.000024352168,0.000025264811,0.00014003193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99484235,0.00006794237,0.0010648665,0.0016552684,0.0019566796,0.00041288382],"domain_scores_gemma":[0.9967597,0.00045462392,0.0007167842,0.0015227507,0.0003831277,0.00016301674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010335481,0.00042727098,0.0006070957,0.0007523941,0.00019588179,0.00027686177,0.0016424246,0.0005861301,0.000059579415],"category_scores_gemma":[0.00050660287,0.0004132749,0.00010071192,0.000601039,0.0003276692,0.00061231083,0.0010070389,0.00079434965,0.000001499895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014755782,0.000077626566,0.00056984654,0.00007538591,0.000058590336,0.00037842314,0.00036881294,0.04989484,0.012769061,0.0029869177,0.00005572672,0.93275],"study_design_scores_gemma":[0.00030377877,0.00005294704,0.000060439223,0.0008092257,0.000023402825,0.00006876778,9.820854e-8,0.95443004,0.029142467,0.014592325,0.00015924014,0.00035726008],"about_ca_topic_score_codex":0.0002316067,"about_ca_topic_score_gemma":0.00012545368,"teacher_disagreement_score":0.9323928,"about_ca_system_score_codex":0.00043326835,"about_ca_system_score_gemma":0.0014265003,"threshold_uncertainty_score":0.9998319},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011694782,0.0003976084,0.98038065,0.0122382995,0.0019758798,0.00072254456,0.000028551798,0.0014136583,0.0027258347],"genre_scores_gemma":[0.027797533,0.00026401677,0.9691206,0.00080806436,0.00040042034,0.00003268242,0.00047787643,0.00006906021,0.0010297295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918055,0.00017092092,0.0010904433,0.004142041,0.0017298879,0.0010611964],"domain_scores_gemma":[0.9667266,0.0011863562,0.00081111904,0.030630376,0.0004738066,0.00017173441],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0020339144,0.00080412696,0.00078065146,0.002088044,0.00058811996,0.001782039,0.11764913,0.00069511664,0.000061389685],"category_scores_gemma":[0.02647701,0.00082397053,0.00013426597,0.0019484378,0.00077121303,0.0037167678,0.29296747,0.0023217653,0.000050959876],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009780158,0.000054099804,0.00051072694,0.0001283638,0.00005065971,0.000045670386,0.00018145208,0.0022130467,0.0008711195,0.005302981,0.0053925845,0.9852395],"study_design_scores_gemma":[0.00022025965,0.00004983814,0.00038628755,0.00037467608,0.00001584093,0.000019372612,1.5909923e-7,0.6859926,0.0015499571,0.30760068,0.0031909992,0.0005993742],"about_ca_topic_score_codex":0.00011583768,"about_ca_topic_score_gemma":0.000081950006,"teacher_disagreement_score":0.9846401,"about_ca_system_score_codex":0.00058029505,"about_ca_system_score_gemma":0.0006408528,"threshold_uncertainty_score":0.9999799},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010144726,0.00086083723,0.99193233,0.00024501933,0.0032056763,0.00043357548,0.0000141961855,0.00030346224,0.0019904384],"genre_scores_gemma":[0.91484123,0.000047746955,0.082058035,0.0018113878,0.0006941525,0.000010376867,0.000007639549,0.000034334065,0.0004950616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961201,0.00007500499,0.00058896205,0.0015918867,0.0008543458,0.0007696998],"domain_scores_gemma":[0.99773216,0.00020980526,0.00031798478,0.0012678618,0.00031712383,0.00015503456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008598177,0.00057727325,0.0005987791,0.001079628,0.0005492407,0.0005737714,0.0022366245,0.0005661643,0.000036529524],"category_scores_gemma":[0.000062959814,0.0005664827,0.00021317406,0.0010593396,0.00029656178,0.0011184234,0.0015780841,0.0010785888,0.000017308641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017343189,0.000032825035,0.000005109637,0.00005453654,0.000017173981,0.00008227151,0.0011572612,0.035414685,0.00041471692,0.013167907,0.00001765283,0.9496185],"study_design_scores_gemma":[0.00033308676,0.00013512767,0.000011046772,0.000412406,0.000013339981,0.000064461026,8.7450445e-7,0.93077344,0.0064621647,0.060168702,0.0010684788,0.0005568547],"about_ca_topic_score_codex":0.0002495978,"about_ca_topic_score_gemma":0.0013023595,"teacher_disagreement_score":0.9490617,"about_ca_system_score_codex":0.00049545476,"about_ca_system_score_gemma":0.00060197286,"threshold_uncertainty_score":0.9996787},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052982305,0.00030483064,0.98880726,0.0022858554,0.0036666957,0.0005973203,0.000030838313,0.00020106859,0.004053119],"genre_scores_gemma":[0.1933763,0.00008440538,0.79335755,0.007095446,0.002865771,0.000036524692,0.0001226624,0.00007727214,0.0029840907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99550974,0.00010754433,0.0005995022,0.0021363345,0.0009977123,0.00064914284],"domain_scores_gemma":[0.99701965,0.0004262467,0.0003117839,0.0014973943,0.0005835297,0.00016139033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000512501,0.0007415239,0.0007050554,0.0007072432,0.00042071342,0.0009456669,0.0025356493,0.00043619183,0.000065871165],"category_scores_gemma":[0.00016281806,0.00065261463,0.00018365211,0.0007458522,0.000391135,0.00070248335,0.0009833594,0.0009198413,0.00009304578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054098848,0.00008309511,0.0000377391,0.000040656807,0.00008108454,0.00019630832,0.00059455045,0.4242779,0.003055971,0.012875042,0.0026100916,0.55609345],"study_design_scores_gemma":[0.00037757287,0.00014804422,0.00014359185,0.0004942578,0.000019440587,0.0000045837223,1.1446238e-7,0.94962454,0.009436961,0.03672892,0.0023010208,0.0007209388],"about_ca_topic_score_codex":0.0000672495,"about_ca_topic_score_gemma":0.000037909733,"teacher_disagreement_score":0.55537254,"about_ca_system_score_codex":0.00030080674,"about_ca_system_score_gemma":0.00058256317,"threshold_uncertainty_score":0.9995925},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087928347,0.00018860173,0.9846308,0.000062149295,0.005989521,0.00045982437,0.00012138264,0.00007173707,0.0075966557],"genre_scores_gemma":[0.9329498,0.00000805782,0.061464824,0.0013198606,0.0012597172,0.000029275932,0.00009272943,0.00004625881,0.00282947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830157,0.000025769254,0.0002932631,0.00085178047,0.00020874641,0.000318855],"domain_scores_gemma":[0.998892,0.00037883074,0.00015645113,0.000363215,0.00014849554,0.000060979903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021181643,0.00026697895,0.00028642334,0.00048018206,0.00016361289,0.00013154504,0.0004144143,0.00037502853,0.00030539942],"category_scores_gemma":[0.00005072505,0.0002643303,0.000121714715,0.00015860258,0.00020970112,0.00013856402,0.0001588369,0.00041257744,0.000020465199],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005859809,0.0000485933,0.000023559547,0.000037798054,0.0000458483,0.000011015503,0.0009491409,0.0032045122,0.005417035,0.000715959,0.000046947076,0.989441],"study_design_scores_gemma":[0.0026823569,0.0012133287,0.00015402358,0.0040141777,0.00026084477,0.00006775993,0.000011754267,0.65928334,0.05482969,0.26886672,0.0063431184,0.0022728895],"about_ca_topic_score_codex":0.00012578537,"about_ca_topic_score_gemma":0.0003567836,"teacher_disagreement_score":0.98716813,"about_ca_system_score_codex":0.00017644162,"about_ca_system_score_gemma":0.00011425701,"threshold_uncertainty_score":0.99998087},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007029509,0.00006204945,0.9951139,0.00084272854,0.0006117261,0.00091134437,0.0000133665935,0.00051875145,0.0018558393],"genre_scores_gemma":[0.2138703,0.000028427463,0.77295524,0.0008158817,0.00047854136,0.00024227738,0.00006446197,0.00004546334,0.011499408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975409,0.000020946685,0.0004801301,0.0011961497,0.0003753569,0.00038650108],"domain_scores_gemma":[0.9983893,0.0001496127,0.00030111198,0.0006560453,0.00042068923,0.00008324451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046029966,0.00037906633,0.000361164,0.00070709974,0.00062477146,0.0006452398,0.0011105045,0.00032889293,0.000016447384],"category_scores_gemma":[0.000040537383,0.00038412178,0.00016501489,0.000702992,0.00026531628,0.00068121677,0.0004493777,0.0003528207,0.000029052186],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019947103,0.000030076959,0.000033327713,0.00005390717,0.000015294156,0.000004720902,0.00004876422,0.00084915326,0.001502251,0.013951738,0.00015284322,0.983338],"study_design_scores_gemma":[0.0002762132,0.0004473723,0.00016840566,0.00022570872,0.000017328717,0.000044655062,1.3062706e-7,0.8300577,0.023588592,0.12812267,0.016307048,0.0007441764],"about_ca_topic_score_codex":0.000033398468,"about_ca_topic_score_gemma":0.00018122944,"teacher_disagreement_score":0.9825938,"about_ca_system_score_codex":0.00029543345,"about_ca_system_score_gemma":0.00034724682,"threshold_uncertainty_score":0.99986106},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013896817,0.0010439359,0.996683,0.0002772675,0.000080151134,0.00023118149,0.00002469754,0.00010413071,0.0014166606],"genre_scores_gemma":[0.19682665,0.00011533251,0.80223465,0.00051203783,0.00003644372,0.0000086943965,0.000020509204,0.000015073755,0.00023060454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609065,0.000064052714,0.00086165534,0.0015644697,0.000930446,0.0004887156],"domain_scores_gemma":[0.9967686,0.0009873258,0.000409186,0.0014768726,0.00026490516,0.000093091076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001085994,0.00049992505,0.0013541981,0.004872364,0.00013160896,0.00037484794,0.002962472,0.00023736864,0.000016618491],"category_scores_gemma":[0.00008806288,0.00048338345,0.0002489957,0.00377144,0.00084567,0.0011937583,0.0023496575,0.0006143323,5.328749e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011534756,0.00005222327,0.001936614,0.0000994647,0.0006035898,0.000068308356,0.0011462396,0.092770025,0.00022581697,0.12514298,0.000012153363,0.77793103],"study_design_scores_gemma":[0.00014154568,0.00006456776,0.0012453066,0.0003931844,0.00025084204,0.0000055028718,7.506649e-7,0.8659879,0.0014791561,0.1297583,0.0001677442,0.0005051819],"about_ca_topic_score_codex":0.00021150602,"about_ca_topic_score_gemma":0.0010085659,"teacher_disagreement_score":0.7774259,"about_ca_system_score_codex":0.00017143397,"about_ca_system_score_gemma":0.00022722637,"threshold_uncertainty_score":0.99976176},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030096251,0.000120185876,0.9926593,0.0002635734,0.00047039968,0.0014838146,0.000022168086,0.00011187865,0.0048386375],"genre_scores_gemma":[0.4842236,0.000026073567,0.5139731,0.0009787146,0.000114860646,0.00015343998,0.000018865207,0.000021780446,0.0004895486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962862,0.000037129426,0.000767311,0.0013433679,0.0009913953,0.0005745721],"domain_scores_gemma":[0.9963101,0.00048921286,0.00053635857,0.0020810773,0.00045784086,0.00012539838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090407295,0.0004176989,0.00081083935,0.0022752287,0.00017408875,0.00018485198,0.0041019204,0.00027051498,0.00003752438],"category_scores_gemma":[0.00014224129,0.00040447514,0.0003176354,0.0029544367,0.00067992107,0.00090341334,0.0021965432,0.0006323785,0.000008669931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058467167,0.00006078179,0.00015259966,0.0000873739,0.00012753993,0.000013176379,0.0012763325,0.022461941,0.000040973726,0.65310335,0.0000047030926,0.32266536],"study_design_scores_gemma":[0.00012276163,0.0000492109,0.00017078618,0.00012652596,0.00006256238,0.0000025101879,8.065668e-8,0.53792447,0.0012242333,0.45967874,0.00035518175,0.0002829466],"about_ca_topic_score_codex":0.000014812709,"about_ca_topic_score_gemma":0.000099360914,"teacher_disagreement_score":0.5154625,"about_ca_system_score_codex":0.00023722241,"about_ca_system_score_gemma":0.0006202715,"threshold_uncertainty_score":0.99984074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009087981,0.001539159,0.97845787,0.0003486625,0.004267963,0.0007550332,0.000030759213,0.00032200437,0.014187664],"genre_scores_gemma":[0.10274611,0.00013108568,0.8936766,0.0015011877,0.00083785004,0.00002653635,0.000055315504,0.000024187393,0.0010011466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973346,0.00002553119,0.0006362779,0.00090207515,0.0005649633,0.00053656736],"domain_scores_gemma":[0.99739784,0.0008046732,0.00018329806,0.00122208,0.00030849152,0.00008363166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070462236,0.00043098055,0.0005151139,0.001089745,0.0002752223,0.00036096328,0.0030962396,0.00029284728,0.0000015774207],"category_scores_gemma":[0.0001182003,0.0003787541,0.0001611731,0.00056321896,0.00034326766,0.00075889745,0.0015847272,0.00031784966,0.000029630186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031242056,0.000023089746,0.000022353755,0.00060905394,0.000052242576,0.000022977334,0.003035926,0.0033022237,0.000020760906,0.1922816,0.00025439585,0.8003441],"study_design_scores_gemma":[0.0010791805,0.00028978998,0.00033714488,0.0025136753,0.00006733639,0.000024835294,0.000019304875,0.8535911,0.0033133274,0.1186067,0.018882556,0.0012750872],"about_ca_topic_score_codex":0.00007422169,"about_ca_topic_score_gemma":0.000086131025,"teacher_disagreement_score":0.8502888,"about_ca_system_score_codex":0.00042741137,"about_ca_system_score_gemma":0.0005842984,"threshold_uncertainty_score":0.9998664},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020234305,0.00027237192,0.9932501,0.0007123608,0.00093146524,0.00097140914,0.000008570822,0.0007673599,0.0010629582],"genre_scores_gemma":[0.20843297,0.000020202999,0.788711,0.0020312,0.00022346876,0.00004637321,0.000001711303,0.00003955343,0.00049350737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533564,0.00006444971,0.0007011491,0.002331514,0.00078173296,0.00078550423],"domain_scores_gemma":[0.9963201,0.001100649,0.00035816937,0.0015187422,0.00042451362,0.0002777952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00105833,0.00068822136,0.0007176291,0.0009909127,0.00062174274,0.00045229564,0.0022017646,0.00039813365,0.000013451056],"category_scores_gemma":[0.0007483094,0.0006930315,0.00012535017,0.00093558274,0.0006350689,0.0006281091,0.0033115263,0.0010392823,0.0000121072035],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020333186,0.000022090122,0.0003000929,0.00022633586,0.000024297122,0.00010012526,0.0029500364,0.008713327,0.00452034,0.006269895,0.00006129548,0.97679186],"study_design_scores_gemma":[0.0013882469,0.0015457527,0.0009617905,0.0054064733,0.0000647166,0.0006148706,0.000006523667,0.42755583,0.28734183,0.25366756,0.01581368,0.0056327484],"about_ca_topic_score_codex":0.000060801558,"about_ca_topic_score_gemma":0.00063289236,"teacher_disagreement_score":0.9711591,"about_ca_system_score_codex":0.00092653255,"about_ca_system_score_gemma":0.00038511638,"threshold_uncertainty_score":0.9995521},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001628284,0.003922851,0.98751116,0.00004839384,0.0020667417,0.00012124494,0.0000016053118,0.00021991397,0.0060917987],"genre_scores_gemma":[0.013398388,0.00038970704,0.98480445,0.0004559501,0.0005160069,0.000002989392,0.000015646317,0.000034386972,0.0003824456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865127,0.0000118555945,0.00025997096,0.00045376606,0.0002706111,0.00035251223],"domain_scores_gemma":[0.99928963,0.0002879686,0.00004061088,0.00028146722,0.00005337258,0.000046949466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030360906,0.00023371694,0.0002882634,0.0004897468,0.00007039989,0.000115997,0.0006268066,0.00018218029,0.000012064138],"category_scores_gemma":[0.00006846811,0.00024919747,0.000038456048,0.0007546401,0.00015656152,0.00015291144,0.00014622128,0.00059027376,0.000012921371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.1875473e-7,0.0000023855596,0.000030045207,0.000040909457,7.44175e-7,0.000005595401,0.00017760947,0.5957194,7.330012e-7,0.0000109726125,0.000015951358,0.40399536],"study_design_scores_gemma":[0.00013225121,0.00000901733,0.000032394033,0.00063773704,0.0000018398277,0.0000037092154,2.7012896e-7,0.9932114,0.00005549629,0.0048276256,0.0008400721,0.00024819345],"about_ca_topic_score_codex":0.0000035784612,"about_ca_topic_score_gemma":0.00006238191,"teacher_disagreement_score":0.40374717,"about_ca_system_score_codex":0.00024844255,"about_ca_system_score_gemma":0.000273876,"threshold_uncertainty_score":0.999996},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009886693,0.0006464551,0.99487007,0.000119292694,0.00027011233,0.0013474416,0.000013975937,0.000056749686,0.0016872082],"genre_scores_gemma":[0.9584566,0.00006364754,0.040718872,0.00021371312,0.00013292991,0.00025777143,0.00007032338,0.000025850106,0.00006034249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867636,0.000024216666,0.00034479966,0.00032560402,0.00044165473,0.00018734556],"domain_scores_gemma":[0.99888027,0.00034325785,0.00012533291,0.00019137903,0.0004324306,0.000027305323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006754146,0.0002258228,0.0003530465,0.00031057178,0.000091681126,0.00006046613,0.00013284897,0.00013225884,0.000016461627],"category_scores_gemma":[0.000095695796,0.0002130807,0.000060651157,0.00020906309,0.000104433246,0.00008320818,0.000020297917,0.00017269929,4.2693054e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068722875,0.000047321508,0.000040578198,0.019029645,0.00029261204,0.0000012711995,0.0009982504,0.63067895,0.002279278,0.0012152711,0.00039138953,0.3449567],"study_design_scores_gemma":[0.00067222805,0.00012205862,0.0000974008,0.003603902,0.00016270128,0.000003926107,0.0000014274199,0.98061025,0.009857814,0.004486886,0.000064398366,0.00031701845],"about_ca_topic_score_codex":0.0000020817774,"about_ca_topic_score_gemma":0.00001983372,"teacher_disagreement_score":0.95746785,"about_ca_system_score_codex":0.0001778779,"about_ca_system_score_gemma":0.00014755198,"threshold_uncertainty_score":0.8689179},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014409195,0.00038551868,0.99369556,0.0015470147,0.0019857658,0.00049568963,0.00005486823,0.00012152616,0.0016996395],"genre_scores_gemma":[0.0189282,0.000028804796,0.97563875,0.0018049531,0.00069626956,0.000057713627,0.00021548141,0.00002542431,0.0026044291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960123,0.000047026177,0.0004919822,0.0018301763,0.0010842739,0.000534247],"domain_scores_gemma":[0.9962046,0.00085779745,0.00027237,0.0021013953,0.00045480658,0.00010899347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022405472,0.00042893435,0.0005091169,0.0009485486,0.0003057432,0.0008525939,0.004372554,0.0002639774,0.000028209959],"category_scores_gemma":[0.00041454166,0.00033185727,0.00017495784,0.00073448947,0.00033978335,0.0007151527,0.0015491338,0.0004275716,0.000022745646],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043063965,0.0000147328055,0.00004375133,0.000032966826,0.000027938398,0.0000061760934,0.00036030015,0.004931339,0.000013017093,0.008055818,0.00090184744,0.9856078],"study_design_scores_gemma":[0.00030993923,0.00007093948,0.000053358504,0.00061048655,0.000067091736,0.0000047865783,2.307208e-7,0.71372455,0.00035062144,0.27265352,0.011563738,0.0005907266],"about_ca_topic_score_codex":0.000024319104,"about_ca_topic_score_gemma":0.00009790723,"teacher_disagreement_score":0.98501706,"about_ca_system_score_codex":0.000261145,"about_ca_system_score_gemma":0.0008911973,"threshold_uncertainty_score":0.99991333},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000040266036,0.0004531001,0.9951145,0.00047917283,0.0014375667,0.000656366,0.000013718272,0.0007515128,0.0010900395],"genre_scores_gemma":[0.016062597,0.00018972665,0.9824458,0.00066452194,0.00025582034,0.000018906094,0.000016424168,0.0000360729,0.0003101839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99517757,0.00002874297,0.000629792,0.002420307,0.0010774765,0.00066613004],"domain_scores_gemma":[0.9946447,0.0010984221,0.0005284676,0.0032025024,0.0003814032,0.00014449623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085788075,0.00060487475,0.00050577585,0.0012707835,0.00037452878,0.00045745564,0.004274521,0.00047440024,0.000013356159],"category_scores_gemma":[0.0004466664,0.00055035553,0.00006860094,0.001860623,0.00042483964,0.0025296262,0.002077954,0.0016475412,0.000013988126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013764449,0.000029863058,0.00002352972,0.00003858016,0.000009225047,0.000037964786,0.00013056977,0.024646282,0.000064985354,0.028100708,0.000013551132,0.94689095],"study_design_scores_gemma":[0.00014610401,0.00027360403,0.00007764991,0.0019226079,0.000023301232,0.00022662508,4.2247368e-7,0.78372264,0.0040617306,0.20383865,0.004743616,0.0009630784],"about_ca_topic_score_codex":0.000026106596,"about_ca_topic_score_gemma":0.000082329476,"teacher_disagreement_score":0.9459279,"about_ca_system_score_codex":0.0007549329,"about_ca_system_score_gemma":0.0007085625,"threshold_uncertainty_score":0.9996948},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011449022,0.0011385242,0.992809,0.001139767,0.0018272068,0.0013682144,0.000034081524,0.0011699506,0.00039874675],"genre_scores_gemma":[0.10237219,0.00051184196,0.8937576,0.0014853672,0.00031584123,0.00014946182,0.00018612042,0.000055737117,0.0011658602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939491,0.000118585245,0.0011245855,0.0025189584,0.0011869713,0.0011018013],"domain_scores_gemma":[0.9948844,0.0010899862,0.0005455219,0.0025533922,0.00067982194,0.00024691733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018317768,0.0008168626,0.0013678406,0.0034579867,0.00049979496,0.0008852632,0.0049534533,0.0006905265,0.000014791664],"category_scores_gemma":[0.00025232544,0.00067606487,0.00064969517,0.00549068,0.0006847603,0.0006618979,0.001514386,0.0006924312,0.000015056397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009161002,0.00034953328,0.0029820257,0.0019246091,0.0012632975,0.00006629502,0.003251392,0.48775324,0.000087773464,0.01350217,0.0016380777,0.48708996],"study_design_scores_gemma":[0.00064189936,0.00008985561,0.00038611554,0.00043259194,0.0002047704,0.000014491416,4.92139e-7,0.9756809,0.00022008264,0.018703658,0.0028774762,0.0007476854],"about_ca_topic_score_codex":0.00007352822,"about_ca_topic_score_gemma":0.00006127339,"teacher_disagreement_score":0.48792765,"about_ca_system_score_codex":0.00052878633,"about_ca_system_score_gemma":0.0009073896,"threshold_uncertainty_score":0.99956906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008850888,0.00020004158,0.98997235,0.0028355638,0.004160887,0.00075786276,0.00002087368,0.00027236028,0.0017712092],"genre_scores_gemma":[0.054662507,0.000030944262,0.9406579,0.0014745911,0.0016340417,0.000053269952,0.00004595811,0.000040641327,0.0014001225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995633,0.000076264805,0.0006527237,0.0019843034,0.0008675615,0.00078615284],"domain_scores_gemma":[0.9970935,0.00065293466,0.00042579183,0.0011608045,0.00051502354,0.00015192552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087982294,0.00058268016,0.0005637314,0.0004371682,0.0006929399,0.00058737735,0.0031036453,0.0005123384,0.00003486859],"category_scores_gemma":[0.00034054392,0.0006055248,0.00020809451,0.0011128042,0.00046935468,0.0007621116,0.0010309209,0.0008057223,0.000039798026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006397197,0.00004470397,0.00033231877,0.00014943737,0.00003667343,0.000010360909,0.00026135368,0.39824224,0.00006355253,0.09456934,0.001106483,0.50511956],"study_design_scores_gemma":[0.00044433342,0.00019406082,0.00011785971,0.00030585492,0.00001983389,0.000023917462,2.0643081e-7,0.9360219,0.00044302535,0.047078967,0.01473992,0.00061009947],"about_ca_topic_score_codex":0.000046818317,"about_ca_topic_score_gemma":0.000096282994,"teacher_disagreement_score":0.5377797,"about_ca_system_score_codex":0.0010433742,"about_ca_system_score_gemma":0.0014637497,"threshold_uncertainty_score":0.99963963},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029927401,0.0000627087,0.9576551,0.0006606009,0.0022365889,0.00060200907,0.000026102385,0.00010906728,0.035655104],"genre_scores_gemma":[0.8039092,0.00002880742,0.18669812,0.0036040887,0.0014078082,0.00007218714,0.0008610248,0.00009372529,0.0033250768],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740446,0.00008425604,0.00044796898,0.0010112913,0.00063076173,0.00042124095],"domain_scores_gemma":[0.99886173,0.0002015786,0.00027657993,0.000301206,0.00028587252,0.000073042356],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008017799,0.0003600877,0.00034328262,0.0010147501,0.0002079368,0.0001434746,0.00037539037,0.00039838682,0.0005570958],"category_scores_gemma":[0.000055779034,0.0003375737,0.00006836979,0.00041827312,0.00035505358,0.00027455052,0.00014264464,0.000884733,0.00008352021],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005092183,0.000066914356,0.0002907017,0.00006838624,0.00002305691,0.00006207684,0.0028253053,0.00091129704,0.00006935449,0.0013366573,0.000026182162,0.99426913],"study_design_scores_gemma":[0.0077591273,0.0016750821,0.04508432,0.01092899,0.0002003144,0.0009304175,0.00005116219,0.1855974,0.0024636358,0.7402483,0.0012541758,0.003807068],"about_ca_topic_score_codex":0.00011131025,"about_ca_topic_score_gemma":0.0002941328,"teacher_disagreement_score":0.99046206,"about_ca_system_score_codex":0.0003389057,"about_ca_system_score_gemma":0.00036389357,"threshold_uncertainty_score":0.9999076},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007125242,0.0015033848,0.9888483,0.00066623255,0.0023440975,0.0012561451,0.000018065573,0.00018364155,0.005108871],"genre_scores_gemma":[0.054466613,0.00017664982,0.9363282,0.0026235215,0.00026573447,0.00010579116,0.000014343265,0.000039228926,0.0059799617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965667,0.000027596721,0.00046818433,0.0016011527,0.0006380864,0.00069827115],"domain_scores_gemma":[0.99756354,0.0006784541,0.00021475661,0.0012237454,0.00019576578,0.00012373466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078586733,0.00047515047,0.0006360884,0.00070682523,0.00040101664,0.0006817082,0.0026551737,0.00023349102,0.000006707609],"category_scores_gemma":[0.00006783018,0.0004412876,0.000103361235,0.00052622356,0.0005648182,0.0002091946,0.0017912639,0.00034435306,0.0000061362957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035459278,0.00012969789,0.000051874384,0.000703111,0.00007455162,0.00017181822,0.0008084305,0.080138996,0.00010192561,0.21176825,0.0022263275,0.70378953],"study_design_scores_gemma":[0.00090370554,0.00019080225,0.00016198063,0.00053709414,0.000029059738,0.000018476801,0.0000010783154,0.92783165,0.00062985165,0.04815687,0.020906026,0.0006334074],"about_ca_topic_score_codex":0.000025185556,"about_ca_topic_score_gemma":0.000050627008,"teacher_disagreement_score":0.84769267,"about_ca_system_score_codex":0.00019539113,"about_ca_system_score_gemma":0.00027336774,"threshold_uncertainty_score":0.9998039},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03945614,0.000043234042,0.9535489,0.002464623,0.0030243169,0.0011527794,0.000017640585,0.00005198321,0.00024034873],"genre_scores_gemma":[0.87612534,0.0000068718577,0.117371455,0.004631369,0.0011228547,0.000041290412,0.000026399257,0.000020523574,0.0006539206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687433,0.000065319946,0.0011053792,0.0010858335,0.00039068537,0.00047845324],"domain_scores_gemma":[0.99443805,0.0039480384,0.00029022282,0.0005823481,0.00058658567,0.00015474069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028885317,0.00028771794,0.0005144155,0.00016684657,0.0002846793,0.000120323275,0.00042175988,0.0003725428,0.000053257936],"category_scores_gemma":[0.0034884927,0.00026442873,0.00017339752,0.0002674566,0.00060517463,0.00021267797,0.00022946349,0.0006499631,0.000008774058],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006401855,0.00005932087,0.008232008,0.00022294963,0.000008913194,0.0000046708187,0.0047092303,0.0019989375,0.00023472385,0.00035645117,0.00003992981,0.9840689],"study_design_scores_gemma":[0.0004693028,0.0013520232,0.009334855,0.0036301743,0.00006251117,0.00003094228,0.00007143577,0.8308185,0.019745769,0.13144404,0.0019854745,0.0010549823],"about_ca_topic_score_codex":0.00009642865,"about_ca_topic_score_gemma":0.00015034132,"teacher_disagreement_score":0.98301387,"about_ca_system_score_codex":0.00046056323,"about_ca_system_score_gemma":0.0009782523,"threshold_uncertainty_score":0.9999808},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033259897,0.00041093337,0.98882407,0.0008318533,0.0022992152,0.00038988926,0.000010767516,0.00029534666,0.006904649],"genre_scores_gemma":[0.05904101,0.00018753383,0.92786306,0.007112743,0.00073230953,0.000020699123,0.000009560467,0.00006145001,0.004971649],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953423,0.00009524402,0.0005518622,0.0019520224,0.001101352,0.0009571789],"domain_scores_gemma":[0.99647415,0.0009732197,0.00017708314,0.0018957737,0.00023840484,0.00024138788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017256368,0.00063937885,0.0006442723,0.0015671168,0.00057510927,0.00082736334,0.0053774286,0.00040861446,0.000045764224],"category_scores_gemma":[0.00013650334,0.00052770047,0.00024325713,0.0016050922,0.0010645436,0.00076708297,0.0024017922,0.0014343983,0.00002715905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001580956,0.000044175973,0.000041694246,0.000093863506,0.000024460602,0.0003275285,0.00072046154,0.009766084,0.000053920663,0.20287669,0.00006885844,0.78596646],"study_design_scores_gemma":[0.0003255089,0.00019210129,0.000074168296,0.0007868714,0.000011734714,0.000082019986,3.583428e-7,0.29859748,0.0013476281,0.69571567,0.0019458246,0.00092063955],"about_ca_topic_score_codex":0.0000280204,"about_ca_topic_score_gemma":0.00007047716,"teacher_disagreement_score":0.7850458,"about_ca_system_score_codex":0.00018817197,"about_ca_system_score_gemma":0.0010407055,"threshold_uncertainty_score":0.9997175},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015388831,0.0012145628,0.9918349,0.0005581221,0.0013458979,0.0005831518,0.000050071165,0.00029594603,0.003963506],"genre_scores_gemma":[0.5039358,0.00007140433,0.4936372,0.0019744441,0.00020996766,0.000023117584,0.00004302853,0.000038386355,0.00006666984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99496466,0.00004744897,0.0004922814,0.0022841427,0.0013333664,0.0008780758],"domain_scores_gemma":[0.9965283,0.00048640327,0.0002751738,0.0022296757,0.0002497998,0.00023063713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080021337,0.00074804365,0.0006645491,0.001356777,0.00041028374,0.0007121225,0.0046689454,0.00045026286,0.000016789163],"category_scores_gemma":[0.00005312944,0.0006099779,0.00021786589,0.0015056104,0.0012832701,0.00035448128,0.0020934774,0.0014546039,0.000013171686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048950234,0.00018537515,0.000048504877,0.00021576276,0.000057337136,0.0002947472,0.0013876784,0.052819155,0.000059260397,0.56928724,0.00013862964,0.37545738],"study_design_scores_gemma":[0.00039824648,0.00027719382,0.00012604086,0.000626844,0.000019636771,0.000040961186,2.769514e-7,0.6963007,0.0001241636,0.29881412,0.0023751687,0.0008966729],"about_ca_topic_score_codex":0.000033309672,"about_ca_topic_score_gemma":0.0004851691,"teacher_disagreement_score":0.64348155,"about_ca_system_score_codex":0.00026255325,"about_ca_system_score_gemma":0.00055623695,"threshold_uncertainty_score":0.99963516},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040254186,0.00022724785,0.9544475,0.0024194268,0.0005068021,0.00053145346,0.000009290249,0.00030452965,0.041151177],"genre_scores_gemma":[0.9881815,0.00008019661,0.0084745595,0.00068268244,0.00035112616,0.000007854411,0.000008580691,0.000012101244,0.0022014538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813026,0.00003538253,0.0003046678,0.000594399,0.00054143165,0.00039383682],"domain_scores_gemma":[0.99890244,0.00027541557,0.0001903092,0.00029723483,0.00022725672,0.00010732735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006039477,0.0002303514,0.0003120808,0.00062546675,0.00057665503,0.0004239041,0.0005985643,0.00030995542,0.000009419901],"category_scores_gemma":[0.00020057277,0.00021556193,0.000054654472,0.00042856944,0.0006877714,0.0005654059,0.00021614983,0.00026210796,0.0000074111276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074015416,0.0000110033625,0.00010642428,0.00001909395,0.000009143679,0.0000036463696,0.0029701188,0.00388272,0.000015099781,0.4309262,0.000026156442,0.562023],"study_design_scores_gemma":[0.00019369608,0.000020126634,0.00033972904,0.00012239444,0.000014199796,0.0000013265213,9.356975e-7,0.54076105,0.000017283537,0.4567656,0.0015560712,0.00020760734],"about_ca_topic_score_codex":0.00096883415,"about_ca_topic_score_gemma":0.00054935925,"teacher_disagreement_score":0.9877789,"about_ca_system_score_codex":0.00026474058,"about_ca_system_score_gemma":0.0008027647,"threshold_uncertainty_score":0.879036},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009571124,0.00038084193,0.9924592,0.002077304,0.0016674928,0.00039049317,0.0000050878602,0.0011368192,0.0009256822],"genre_scores_gemma":[0.09275063,0.00003910663,0.9058798,0.00079282076,0.00016617357,0.0000054298475,0.000014327513,0.000051480565,0.0003002347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99393266,0.000064482854,0.0007532878,0.0029025404,0.0011449917,0.0012020384],"domain_scores_gemma":[0.99134254,0.00060384633,0.00022564939,0.007325269,0.00031934044,0.00018332206],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012840312,0.0007789885,0.0007626851,0.0012647724,0.00076321635,0.001766876,0.038525533,0.00079262356,0.000025332789],"category_scores_gemma":[0.008308176,0.0007792128,0.00016149822,0.0013667283,0.00083525904,0.0012644918,0.1357285,0.0026120238,0.00003488257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003959689,0.00018399258,0.003037235,0.00041060534,0.00016558563,0.0011133922,0.0005847891,0.09056874,0.0028959655,0.025266109,0.0008223994,0.8749116],"study_design_scores_gemma":[0.00030068643,0.000060252198,0.00009093741,0.000796409,0.000010898649,0.000047965717,2.1598862e-7,0.8646419,0.0021766224,0.13087279,0.00030457752,0.0006967414],"about_ca_topic_score_codex":0.00009458586,"about_ca_topic_score_gemma":0.00009505937,"teacher_disagreement_score":0.8742148,"about_ca_system_score_codex":0.000882355,"about_ca_system_score_gemma":0.00080893276,"threshold_uncertainty_score":0.999689},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044306733,0.00070428784,0.99198866,0.0010949643,0.0019003669,0.0012467215,0.00009404495,0.0000697914,0.0028568613],"genre_scores_gemma":[0.3919057,0.0000035326573,0.605966,0.0015022297,0.0002140417,0.000050025486,0.00015431017,0.000018258059,0.00018593126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944662,0.000119247656,0.000827349,0.001853503,0.002265931,0.00046777446],"domain_scores_gemma":[0.99398756,0.0012659945,0.00047243806,0.002580015,0.0015908276,0.00010316173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0049191015,0.00044599816,0.0007199744,0.00062475924,0.00021418887,0.00016030554,0.0046067457,0.00031343807,0.000004376673],"category_scores_gemma":[0.00031478467,0.0003829356,0.00011196969,0.00051886303,0.00036516477,0.0006017929,0.0017757459,0.00031764727,0.0000043759615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024512605,0.000042845757,0.000004323479,0.00009684438,0.000028692257,0.0000039885185,0.00004966834,0.41858166,0.000088914916,0.25581336,0.0001760559,0.32508913],"study_design_scores_gemma":[0.0005763158,0.000052160503,0.000019122595,0.00030248362,0.000024603953,0.0000024743988,2.5585868e-8,0.5726814,0.00014408809,0.4258923,0.00007633124,0.0002286819],"about_ca_topic_score_codex":0.00006242981,"about_ca_topic_score_gemma":0.00007379367,"teacher_disagreement_score":0.39186138,"about_ca_system_score_codex":0.00029732645,"about_ca_system_score_gemma":0.0044848532,"threshold_uncertainty_score":0.99986225},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008417075,0.00024910487,0.9984023,0.000009830852,0.00016466381,0.00045453708,0.000022122076,0.00011430983,0.0005747359],"genre_scores_gemma":[0.07526343,0.000054835888,0.92454076,0.000024715659,0.000036379643,0.000022775335,0.0000038723724,0.000024181216,0.000029040677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986876,0.000012206118,0.00039977324,0.0004215766,0.00026108357,0.00021771535],"domain_scores_gemma":[0.998976,0.0003026616,0.00013016374,0.00046152985,0.00010173058,0.000027905759],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024856793,0.00026387096,0.00041189484,0.00067532767,0.000016336555,0.000009190252,0.0006793074,0.00018337296,0.000003265597],"category_scores_gemma":[0.000028732664,0.00028014008,0.000048484933,0.00037273383,0.0003290543,0.00011726713,0.00020063922,0.00036345876,8.8573614e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004328216,0.0000057112206,0.0000047275994,0.00005281146,0.0000051661505,0.0000029020744,0.00008975444,0.5049904,0.002115309,0.00080632605,0.0000049815467,0.49191755],"study_design_scores_gemma":[0.00008789636,0.00008637488,0.00006656975,0.00067419215,0.000003951713,0.0000020193977,1.4242309e-7,0.913324,0.036839366,0.04859127,0.00009973747,0.00022446323],"about_ca_topic_score_codex":0.000017576116,"about_ca_topic_score_gemma":0.000009905879,"teacher_disagreement_score":0.49169308,"about_ca_system_score_codex":0.00024275447,"about_ca_system_score_gemma":0.0000811295,"threshold_uncertainty_score":0.9999651},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012555606,0.00003946703,0.99000144,0.00013902629,0.00066859747,0.00065897533,0.000032098505,0.000037633494,0.008297205],"genre_scores_gemma":[0.04457343,0.000005919944,0.95346993,0.00026327412,0.00021041492,0.00001569496,0.000016702055,0.000027694332,0.0014169485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982934,0.0000148868885,0.0006166973,0.00044843272,0.00037039234,0.00025616522],"domain_scores_gemma":[0.9969526,0.0020886573,0.00031898494,0.00035855293,0.0002264833,0.000054720553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006283329,0.00025579715,0.0005638114,0.00035893996,0.000120003795,0.00006190262,0.0004233035,0.00017375378,0.000064158616],"category_scores_gemma":[0.0003755928,0.00022891122,0.00013907495,0.0001779608,0.00026937164,0.00006500504,0.00017361608,0.0001989689,0.0000046414452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062411484,0.00021395652,0.000038682316,0.003572992,0.000131651,0.000004923605,0.0013245378,0.018467013,0.00066123274,0.5101041,0.0022574095,0.46316108],"study_design_scores_gemma":[0.000260956,0.00007208018,0.000004869931,0.0008330123,0.000036239875,0.0000028625693,3.5405256e-7,0.19088703,0.00047268043,0.80649906,0.00072661927,0.00020423366],"about_ca_topic_score_codex":0.000008359794,"about_ca_topic_score_gemma":0.000019106417,"teacher_disagreement_score":0.46295685,"about_ca_system_score_codex":0.00011150217,"about_ca_system_score_gemma":0.00018640165,"threshold_uncertainty_score":0.9334728},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019467637,0.00014704933,0.99196756,0.0034917467,0.0026208113,0.00050673826,0.000012823582,0.00009276937,0.00096585293],"genre_scores_gemma":[0.679972,0.000009803259,0.31746197,0.001070118,0.00028311773,0.000018997058,0.000009709742,0.000020154823,0.0011541427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973916,0.00005691717,0.00056366506,0.0008468361,0.00070970156,0.00043132436],"domain_scores_gemma":[0.99809825,0.00038173966,0.00026790047,0.0008349913,0.00031187895,0.0001052439],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031142635,0.0003485505,0.0003910033,0.0006186868,0.00044713472,0.00019179458,0.0022544384,0.00017236367,0.0000102854565],"category_scores_gemma":[0.00014561463,0.0002770918,0.00018055491,0.001032412,0.00044357972,0.00040792863,0.0022170132,0.00042677097,0.000015200975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016605572,0.00007581568,0.00001768607,0.0000493961,0.000027153808,0.000006288023,0.0012136425,0.46924043,0.00040179587,0.18298832,0.0002192151,0.34574366],"study_design_scores_gemma":[0.00025205183,0.00019417139,0.00089928706,0.0005295317,0.000015916276,0.000013899897,3.4952743e-7,0.8260054,0.00050592853,0.1704993,0.00065256085,0.00043162514],"about_ca_topic_score_codex":0.00003238835,"about_ca_topic_score_gemma":0.00008972332,"teacher_disagreement_score":0.6797773,"about_ca_system_score_codex":0.0001867367,"about_ca_system_score_gemma":0.0007717625,"threshold_uncertainty_score":0.9999681},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007427437,0.00053632143,0.9895608,0.0005101469,0.005590141,0.0012799341,0.000008683439,0.00045888693,0.0020476922],"genre_scores_gemma":[0.04486806,0.000017555063,0.94879836,0.002525086,0.0013952237,0.000077355326,0.000028493403,0.000047809997,0.0022420562],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99484485,0.000048065063,0.0008287703,0.0024102493,0.0008954069,0.0009726318],"domain_scores_gemma":[0.9956841,0.0009829657,0.0004005175,0.0021574083,0.00055195676,0.00022306516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015026552,0.00071478786,0.00088300137,0.00068738876,0.00040560367,0.0008497844,0.0043674563,0.00053477,0.000017433998],"category_scores_gemma":[0.00017959796,0.00062359363,0.00035576324,0.0006324778,0.00064859603,0.00052069966,0.0017086185,0.0006826796,0.00003502197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005713882,0.000042113556,0.00021351957,0.00019252185,0.000022284776,0.0000322318,0.0003129577,0.0016878254,0.0000035193036,0.19599712,0.0003350249,0.80115515],"study_design_scores_gemma":[0.0005430851,0.0004148177,0.00020122666,0.00016293215,0.000021792008,0.000054742366,1.4830049e-7,0.21380599,0.00025577063,0.74583066,0.037566412,0.0011424056],"about_ca_topic_score_codex":0.0000458013,"about_ca_topic_score_gemma":0.00010947478,"teacher_disagreement_score":0.80001277,"about_ca_system_score_codex":0.0003405316,"about_ca_system_score_gemma":0.0010185287,"threshold_uncertainty_score":0.9996215},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004646565,0.00039835236,0.99117076,0.0013182297,0.0008701147,0.0011429797,0.000056930126,0.00009517664,0.0003008942],"genre_scores_gemma":[0.45465362,0.000030660885,0.5439532,0.0010126593,0.00014859416,0.000032005944,0.000009424591,0.000027050322,0.00013280533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99404746,0.00021116239,0.0013783188,0.0020589172,0.0014617665,0.00084235956],"domain_scores_gemma":[0.9938549,0.0014889236,0.00074512174,0.003081061,0.00059957366,0.00023041415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017944014,0.000788524,0.0016505123,0.0019315667,0.00029920822,0.00031463895,0.0052388916,0.00055918534,0.000043025088],"category_scores_gemma":[0.00017807436,0.0005892163,0.0009414549,0.00528868,0.001078489,0.00038956705,0.0026942606,0.00094463263,0.000006307996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044939385,0.00042914206,0.001012588,0.0003553461,0.0016946617,0.00007104363,0.00541138,0.23091531,0.00066230755,0.061282862,0.00013946625,0.69798094],"study_design_scores_gemma":[0.0005453456,0.0002245216,0.007987853,0.0005860608,0.00040462683,0.000017302309,8.9395695e-7,0.891903,0.0021487619,0.09485639,0.00050067686,0.00082460826],"about_ca_topic_score_codex":0.0005727484,"about_ca_topic_score_gemma":0.00061846885,"teacher_disagreement_score":0.69715637,"about_ca_system_score_codex":0.00017367973,"about_ca_system_score_gemma":0.000718338,"threshold_uncertainty_score":0.9996559},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048281698,0.00045071266,0.9917869,0.00084379147,0.0035296602,0.0003324472,0.0000039725055,0.0002547602,0.0027494726],"genre_scores_gemma":[0.0039004912,0.000018734647,0.9914985,0.0018707709,0.0014292912,0.0000011388781,0.0000039806537,0.000027404625,0.0012497383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995855,0.000038905884,0.00065782625,0.0017311297,0.00090988155,0.00080729806],"domain_scores_gemma":[0.9976026,0.00047516852,0.0003374176,0.001106084,0.00020606033,0.0002726787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006000536,0.0006152691,0.00061022275,0.0010395362,0.00033639683,0.00089160044,0.0030649519,0.00032037598,0.000016756985],"category_scores_gemma":[0.00008579917,0.0006048166,0.00019335991,0.0010771977,0.0003626961,0.00070143153,0.0020764144,0.0008226825,0.000043909382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019393801,0.0000108214,0.0000046547866,0.000026210926,0.0000118272665,0.000064100794,0.000688456,0.022074282,0.00007229609,0.011016766,0.00012014174,0.9659085],"study_design_scores_gemma":[0.00023616148,0.000059820242,0.000018540915,0.000552937,0.000010299456,0.000053411124,1.4930613e-7,0.80389595,0.0004763438,0.19270226,0.0014436686,0.000550429],"about_ca_topic_score_codex":0.00015742585,"about_ca_topic_score_gemma":0.00003676911,"teacher_disagreement_score":0.9653581,"about_ca_system_score_codex":0.00044017372,"about_ca_system_score_gemma":0.002025007,"threshold_uncertainty_score":0.99964035},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037877904,0.00032519607,0.98897064,0.00034600293,0.00026198602,0.00033466102,0.000023614519,0.00052346254,0.009176542],"genre_scores_gemma":[0.01166604,0.000104375074,0.986926,0.00070856645,0.00020098704,0.000013292992,0.000031497675,0.000056209774,0.00029302153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842185,0.000010982706,0.00022640631,0.0006393256,0.00034468522,0.0003567605],"domain_scores_gemma":[0.9990519,0.00020743556,0.00006140161,0.0004940698,0.00010881216,0.00007636573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019543884,0.00041493072,0.0003681005,0.00050966756,0.0001091883,0.0001578634,0.00036247313,0.00019856103,0.000020914731],"category_scores_gemma":[0.00004228388,0.00036795688,0.000034496694,0.00023488002,0.000492076,0.00022945419,0.00025894912,0.00071568677,0.0000038226312],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009333337,0.000005671548,0.000013652611,0.00012653289,0.000020045978,0.000115299816,0.00019372624,0.0049212254,0.00033441806,0.0007230331,0.00047879896,0.99305826],"study_design_scores_gemma":[0.000868842,0.00033681773,0.00094931014,0.004106284,0.00008123105,0.0007460796,8.109201e-7,0.50623953,0.010121942,0.45812201,0.015897397,0.0025297154],"about_ca_topic_score_codex":0.000010654342,"about_ca_topic_score_gemma":0.00015110623,"teacher_disagreement_score":0.9905285,"about_ca_system_score_codex":0.00015668954,"about_ca_system_score_gemma":0.00008625843,"threshold_uncertainty_score":0.9998772},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013567379,0.000056846406,0.97152025,0.0022151293,0.0006182031,0.0002006453,0.0001758864,0.000051954645,0.011593739],"genre_scores_gemma":[0.9443461,0.000032106575,0.036890898,0.0011290134,0.00007144785,0.000006198106,0.00010899298,0.0000133775575,0.017401911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965418,0.000031104908,0.0007491238,0.0007940747,0.0016272888,0.00025660355],"domain_scores_gemma":[0.99777156,0.00060977874,0.00045232446,0.00077844586,0.00032753663,0.00006033735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016560117,0.0002872551,0.0005876729,0.009478151,0.00017070428,0.00028505654,0.0013828522,0.0002254768,0.00036118663],"category_scores_gemma":[0.00022438173,0.0002297845,0.0001770101,0.0039635943,0.00064004184,0.00035432016,0.0007765238,0.00044091835,0.000009367873],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002171705,0.000044178847,0.039515868,0.000012511538,0.00013582247,0.000010596398,0.00022375704,0.023270315,0.000004666374,0.05656647,0.00043761102,0.8797565],"study_design_scores_gemma":[0.00044313862,0.0002368178,0.08567329,0.00021039775,0.0002643264,0.000002178088,0.000006443974,0.85498434,0.000043302443,0.050495192,0.0070772455,0.0005633433],"about_ca_topic_score_codex":0.000010052758,"about_ca_topic_score_gemma":0.0002604755,"teacher_disagreement_score":0.9346293,"about_ca_system_score_codex":0.00016159474,"about_ca_system_score_gemma":0.00014659249,"threshold_uncertainty_score":0.937034},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000088433146,0.00054196495,0.9949688,0.00034622286,0.00077796273,0.0008096636,8.413509e-7,0.000094909934,0.0023712192],"genre_scores_gemma":[0.36862892,0.000009782729,0.6302453,0.0003100724,0.00015593723,0.000025908155,0.000009014135,0.000028001441,0.0005870271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959021,0.000097362055,0.0008667896,0.0014580175,0.0010507593,0.0006249677],"domain_scores_gemma":[0.996696,0.0013961884,0.0007076573,0.00076235493,0.0003212126,0.0001165996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019298184,0.00053395546,0.0008393158,0.0007732896,0.00048054615,0.00032855463,0.001873758,0.00031598797,0.000011095619],"category_scores_gemma":[0.00080999563,0.0005215614,0.00015147091,0.00050041475,0.0005317194,0.00042370672,0.0022178502,0.0011374579,0.0000020086698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010774439,0.000013815471,0.0003407855,0.00012523858,0.000018413819,0.0000021557707,0.0013111979,0.6001282,0.000015027199,0.017555658,0.000004463857,0.38047433],"study_design_scores_gemma":[0.00052033213,0.00038005298,0.000040983305,0.0004930186,0.00003283083,0.000007677092,0.0000020679395,0.97699904,0.00028473142,0.020292044,0.0004927546,0.00045447698],"about_ca_topic_score_codex":0.000017540577,"about_ca_topic_score_gemma":0.000019886884,"teacher_disagreement_score":0.38001984,"about_ca_system_score_codex":0.00024422302,"about_ca_system_score_gemma":0.000397788,"threshold_uncertainty_score":0.9997236},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024926491,0.0011282866,0.94690937,0.019013854,0.0012669683,0.002859126,0.0017754922,0.00024173128,0.0018787044],"genre_scores_gemma":[0.8900729,0.00007301753,0.102600634,0.0022652457,0.00083650503,0.000044231077,0.0033833142,0.0000060129705,0.00071817636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982322,0.00001925802,0.00033122484,0.00076690555,0.00038057356,0.00026987784],"domain_scores_gemma":[0.9981561,0.0008695172,0.00019810905,0.00034615194,0.0003317107,0.00009846498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002835588,0.0002498152,0.00030215606,0.00006343204,0.0002516083,0.00011005537,0.0012713282,0.0001549917,0.000011318884],"category_scores_gemma":[0.00014625081,0.00010088029,0.000059920814,0.0005302561,0.00033005635,0.00019132534,0.00032458507,0.00021614782,9.5052326e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045812293,0.00061999785,0.010371956,0.00047081485,0.00015156151,0.000036080495,0.00070247886,0.0067127766,0.044789936,0.1034667,0.003521243,0.82869834],"study_design_scores_gemma":[0.0021080535,0.002390417,0.27674308,0.0061795134,0.00050534843,0.000021623358,0.00004034272,0.37606916,0.0020689003,0.17987524,0.15040585,0.0035924744],"about_ca_topic_score_codex":0.000022034272,"about_ca_topic_score_gemma":0.00066802907,"teacher_disagreement_score":0.8651464,"about_ca_system_score_codex":0.000043862583,"about_ca_system_score_gemma":0.00012855619,"threshold_uncertainty_score":0.41137788},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010712968,0.00012920654,0.99125713,0.0015329802,0.0020544208,0.0044734953,0.00007274074,0.00013299212,0.00033634325],"genre_scores_gemma":[0.0009060104,0.0000044050985,0.9953324,0.000975812,0.000616379,0.0011562833,0.00006581368,0.000030706393,0.0009121423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966067,0.000040346757,0.00076590915,0.00148565,0.00049505,0.00060630834],"domain_scores_gemma":[0.9956091,0.0016577775,0.00050111604,0.001197879,0.000941207,0.00009293323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026943726,0.00042259035,0.00046240436,0.00077924284,0.0006252856,0.00070548564,0.002673401,0.00035121085,0.0000017826897],"category_scores_gemma":[0.0018078935,0.00041796346,0.00019401048,0.0006347985,0.00022386666,0.0011939843,0.00056118343,0.0003061616,0.000001008296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001799143,0.000023197239,0.0000037746906,0.00025817103,0.000013194388,3.4038874e-7,0.00043522194,0.05565345,0.0007590605,0.48529503,0.00020115785,0.4573394],"study_design_scores_gemma":[0.00035452767,0.00023725236,0.000006888773,0.00024661302,0.000012419294,0.000002906402,1.3551131e-7,0.7135593,0.008497598,0.27168524,0.0050810366,0.00031604126],"about_ca_topic_score_codex":0.000008485015,"about_ca_topic_score_gemma":0.000054584052,"teacher_disagreement_score":0.6579059,"about_ca_system_score_codex":0.00037345965,"about_ca_system_score_gemma":0.0011121226,"threshold_uncertainty_score":0.9998272},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012340058,0.00024193125,0.990328,0.0003323501,0.0022985104,0.0012847206,0.00016685975,0.00026252854,0.004961663],"genre_scores_gemma":[0.16707575,0.000014981493,0.8309589,0.00096001977,0.00039030385,0.0000634378,0.00006056406,0.000019734984,0.00045630013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941465,0.000054060125,0.0007615133,0.002747626,0.0011045208,0.0011857498],"domain_scores_gemma":[0.996924,0.000420835,0.00036223707,0.0017600018,0.0003215917,0.00021132482],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008352967,0.0007968572,0.000760015,0.0002642262,0.0005449179,0.0014617976,0.004238715,0.0005962649,0.000003083146],"category_scores_gemma":[0.00028514856,0.0007591541,0.00035545405,0.0012262882,0.00059360155,0.0011235812,0.0015762483,0.0004652906,0.0000050910044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003657658,0.00007417702,0.001968644,0.00013262652,0.00003765946,0.000015370986,0.0003558181,0.28763998,0.00002358072,0.04900708,0.00003341092,0.6606751],"study_design_scores_gemma":[0.0009878497,0.00009141247,0.0005890247,0.00020905132,0.000015273552,0.000016726417,7.395536e-7,0.94197804,0.00006401395,0.05473836,0.0005500366,0.0007594727],"about_ca_topic_score_codex":0.00024887404,"about_ca_topic_score_gemma":0.00066077185,"teacher_disagreement_score":0.6599156,"about_ca_system_score_codex":0.0009886031,"about_ca_system_score_gemma":0.000969956,"threshold_uncertainty_score":0.9995748},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00542789,0.0005103948,0.88650155,0.003551932,0.0023887064,0.0013513215,0.00006828441,0.00010387875,0.10009602],"genre_scores_gemma":[0.9733931,0.00026320864,0.012953988,0.0069803577,0.00062867976,0.0000060106463,0.0000046809987,0.000029010696,0.0057409927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99640816,0.000067254805,0.0004280996,0.0009530321,0.0014159795,0.00072746904],"domain_scores_gemma":[0.99767447,0.0007129308,0.00027200533,0.0005466973,0.0005427858,0.00025114263],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014390013,0.00035880937,0.0005969454,0.0006166467,0.00060634274,0.00023035187,0.0018347612,0.00045374295,0.00012016006],"category_scores_gemma":[0.0007338355,0.00033663175,0.00016141278,0.00068344345,0.0009967651,0.00023950887,0.00074944703,0.00089341326,0.00004151893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052555566,0.00018965626,0.001205115,0.00014006338,0.00004985713,0.0001135976,0.029674575,0.0017548462,0.000055403078,0.64611113,0.0006043506,0.32004887],"study_design_scores_gemma":[0.0005529665,0.000367946,0.001160241,0.0021641764,0.00005716195,0.000008660904,0.000012541484,0.007515132,0.0026158725,0.9488989,0.035293594,0.0013528172],"about_ca_topic_score_codex":0.0025243578,"about_ca_topic_score_gemma":0.0019199459,"teacher_disagreement_score":0.9679652,"about_ca_system_score_codex":0.0005947399,"about_ca_system_score_gemma":0.0020126305,"threshold_uncertainty_score":0.99990857},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004061534,0.0005241724,0.6313589,0.002569918,0.0044538467,0.00070532697,0.000019849074,0.00020701581,0.35609943],"genre_scores_gemma":[0.98165536,0.0000622195,0.0063374285,0.0012571674,0.0008739934,0.0000014718753,0.000010325359,0.000007561782,0.0097944625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986887,0.00004312736,0.00017363272,0.00046105098,0.00041374148,0.00021973465],"domain_scores_gemma":[0.9988191,0.0004564615,0.00009145056,0.00026210572,0.00021459161,0.00015627102],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000537911,0.00014485703,0.00015055784,0.00033695763,0.0016361161,0.00022617767,0.00048577017,0.00017233286,0.00004500311],"category_scores_gemma":[0.0010777122,0.00015272317,0.000029983286,0.00027636907,0.0008798225,0.00018282149,0.00048741073,0.00024790468,0.000005898244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057798657,0.00004106279,0.021045882,0.000053952313,0.0000060051125,0.000008202905,0.12836379,0.0010938073,3.988404e-7,0.47521996,0.000041877072,0.37411928],"study_design_scores_gemma":[0.00048120884,0.00014169757,0.028687624,0.0008520507,0.000059173995,0.0000059568356,0.000030994754,0.030922318,0.000019157258,0.7933346,0.14410505,0.0013601879],"about_ca_topic_score_codex":0.00073239167,"about_ca_topic_score_gemma":0.0014562759,"teacher_disagreement_score":0.97759384,"about_ca_system_score_codex":0.00019761788,"about_ca_system_score_gemma":0.0007478948,"threshold_uncertainty_score":0.9996636},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013726037,0.0001872411,0.9509781,0.004967942,0.0032432529,0.0010742266,0.000029193397,0.000051535164,0.0380959],"genre_scores_gemma":[0.96759254,0.000030023672,0.026710141,0.0036309506,0.0016913367,0.000032759952,0.0000037270213,0.000013955016,0.00029458923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977912,0.000054496533,0.00026805425,0.0004991844,0.00074494054,0.00064212846],"domain_scores_gemma":[0.9943491,0.0050834324,0.00008330046,0.00031884562,0.00007293544,0.00009237318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008491976,0.00022196038,0.00029363437,0.0002284329,0.00042122282,0.00064388145,0.0014759691,0.00043366908,0.000024338184],"category_scores_gemma":[0.0021740254,0.00017170963,0.00011696598,0.00039283957,0.0027130796,0.000095948315,0.00019264496,0.0006989687,0.0000031655063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004358644,0.000012442414,0.0002794045,0.000011532669,0.0000042504116,0.000020480611,0.015066234,0.00004664196,9.326951e-7,0.85230726,0.000046584475,0.1321999],"study_design_scores_gemma":[0.00009854123,0.00004208617,0.00001871463,0.0003969513,0.00000932746,8.6855954e-7,0.000034065866,0.00087790843,0.000019800753,0.9760711,0.022220153,0.00021043966],"about_ca_topic_score_codex":0.000080324506,"about_ca_topic_score_gemma":0.0001658735,"teacher_disagreement_score":0.9662199,"about_ca_system_score_codex":0.00023871157,"about_ca_system_score_gemma":0.00061147485,"threshold_uncertainty_score":0.9996455},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026953341,0.00034342328,0.99285674,0.0011914151,0.0036191714,0.00090011046,0.00003839639,0.00015033627,0.0008734636],"genre_scores_gemma":[0.037538514,0.000054043536,0.95209974,0.006924463,0.002312076,0.000076419536,0.00022266376,0.000039391834,0.0007327066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959485,0.00005071167,0.00051025074,0.0021993797,0.00074197503,0.0005492029],"domain_scores_gemma":[0.9964625,0.00026773478,0.00023526822,0.0027036897,0.00022034171,0.00011043957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012162967,0.00046236758,0.00043430305,0.00062514807,0.00043744434,0.0007344492,0.0041874275,0.0003609281,0.000012232582],"category_scores_gemma":[0.00008182008,0.00042635232,0.00012178182,0.00052006013,0.00026442457,0.00059466413,0.0016538217,0.00055800664,0.0000066469847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020787333,0.00009251325,0.0000041153744,0.0001372974,0.00002118989,0.000009372843,0.00023852498,0.13072588,0.00033869306,0.035726454,0.0012852923,0.83139986],"study_design_scores_gemma":[0.00030708077,0.00016960617,0.0000019269455,0.00022181841,0.000013758035,0.000006915765,4.8032735e-8,0.95732135,0.0012737977,0.029336434,0.010913196,0.0004340463],"about_ca_topic_score_codex":0.000020452246,"about_ca_topic_score_gemma":0.00007698173,"teacher_disagreement_score":0.8309658,"about_ca_system_score_codex":0.000256688,"about_ca_system_score_gemma":0.00059185736,"threshold_uncertainty_score":0.9998188},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014603152,0.00016890475,0.99346274,0.001334789,0.0014188736,0.0009862671,0.000016414073,0.000106950516,0.0010447162],"genre_scores_gemma":[0.6401405,0.000012203337,0.35728112,0.0009862661,0.0009004233,0.000021930202,0.00023257307,0.00003496634,0.0003900326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976866,0.000033733162,0.0004071018,0.0009536257,0.00061570504,0.00030323828],"domain_scores_gemma":[0.9973218,0.0011522642,0.00023054873,0.0006297096,0.0005598504,0.00010586748],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011629061,0.00033037036,0.00054776674,0.00043729346,0.00022246217,0.00008495766,0.00013830731,0.00023975715,0.00001428884],"category_scores_gemma":[0.0010852704,0.00027582198,0.00015273705,0.0002966716,0.00031130694,0.00017243542,0.00009997213,0.00056439894,0.000003346467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010069436,0.0005572288,0.0782426,0.0023355947,0.00026353722,0.00028021273,0.0004194727,0.5547997,0.0005786784,0.0026929197,0.0018925057,0.3569306],"study_design_scores_gemma":[0.0021214134,0.0007022129,0.014365916,0.0038086744,0.00053661055,0.00039970494,8.8554964e-7,0.9318386,0.0033003308,0.03927394,0.0028475572,0.00080415694],"about_ca_topic_score_codex":0.00008872501,"about_ca_topic_score_gemma":0.000011060914,"teacher_disagreement_score":0.63868016,"about_ca_system_score_codex":0.000618942,"about_ca_system_score_gemma":0.00071725016,"threshold_uncertainty_score":0.9999694},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000039054344,0.00006315809,0.96808934,0.00014600076,0.0007585916,0.0004896557,0.000037620564,0.0023990658,0.028012682],"genre_scores_gemma":[0.3942099,0.00027075477,0.60222733,0.0018343929,0.0001790248,0.00008084049,0.00004964811,0.000069084694,0.0010790032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984193,0.0000050691383,0.0003050806,0.0005336874,0.00041001913,0.00032684242],"domain_scores_gemma":[0.9993786,0.000048625545,0.000034402285,0.00042182207,0.00004156455,0.000074936615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020563893,0.00035384693,0.00026512763,0.0007647738,0.00009367776,0.00007590773,0.0004859583,0.00027436548,0.000010736956],"category_scores_gemma":[0.0000059688396,0.00034055734,0.00010866442,0.0002057158,0.00016081016,0.00016293705,0.0000372072,0.0005481993,0.000008116966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005659869,0.000014660616,0.0000031355987,0.00005573911,0.000005693081,0.0000018842774,0.000059656064,0.72110015,0.00003885902,0.00036599473,0.0005499032,0.27779862],"study_design_scores_gemma":[0.00032627495,0.00006329931,0.000026807174,0.00036419983,0.000014759446,0.0000011134381,7.35574e-8,0.99423385,0.00033651624,0.0015619578,0.0028026782,0.00026850033],"about_ca_topic_score_codex":0.0000031141446,"about_ca_topic_score_gemma":0.000050906605,"teacher_disagreement_score":0.394206,"about_ca_system_score_codex":0.00025598856,"about_ca_system_score_gemma":0.000093547795,"threshold_uncertainty_score":0.99990463},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007914149,0.0004917756,0.9732438,0.00032053614,0.021761224,0.00046738074,0.0000016206442,0.00027384568,0.002648457],"genre_scores_gemma":[0.07667282,0.000043631582,0.91794795,0.0013476093,0.0035298371,0.000016104843,0.000012065473,0.00005620244,0.00037378672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99494475,0.00009237125,0.0009009487,0.0021363604,0.00082463445,0.0011009405],"domain_scores_gemma":[0.9973968,0.0005244665,0.0003434067,0.0013149069,0.00022064986,0.00019973273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001138939,0.00075527513,0.0008737868,0.0014760527,0.00040972736,0.00063621555,0.0032544518,0.0005740976,0.0000040857344],"category_scores_gemma":[0.00017559278,0.00076667295,0.00023684674,0.0011700012,0.00079691276,0.0005412794,0.0016473025,0.0014772951,0.000021065356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007152401,0.00004471252,0.00046535596,0.000060831695,0.000014631831,0.00018943098,0.0022891564,0.006188123,0.00011462868,0.002750126,0.00005196168,0.9878239],"study_design_scores_gemma":[0.0011277356,0.00013948412,0.00058504817,0.0013472252,0.00001434046,0.0003061216,0.0000010403713,0.9329719,0.0016282494,0.05641285,0.004032015,0.0014339888],"about_ca_topic_score_codex":0.00006750222,"about_ca_topic_score_gemma":0.00017003587,"teacher_disagreement_score":0.9863899,"about_ca_system_score_codex":0.0006615226,"about_ca_system_score_gemma":0.0009778976,"threshold_uncertainty_score":0.9994784},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014634058,0.0012343734,0.9840172,0.0005922509,0.0107814865,0.0012247731,0.0000010440241,0.00029446848,0.0017080813],"genre_scores_gemma":[0.23875782,0.00007876636,0.73797065,0.00762447,0.013478328,0.00012595787,0.0000877091,0.00019294546,0.0016833568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945179,0.00008515027,0.0011034287,0.0022018075,0.0007398892,0.0013518285],"domain_scores_gemma":[0.9952536,0.0022863995,0.00039360274,0.0014765916,0.00040263488,0.00018714133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021222644,0.0007507178,0.00087142223,0.0013773064,0.0005317583,0.0008402918,0.0041180034,0.00057036284,0.0000020256691],"category_scores_gemma":[0.00028559368,0.0007887897,0.0002360036,0.001327107,0.00043443998,0.00051944796,0.0021114713,0.0012047441,0.000009166648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007986725,0.000053504784,0.00008104993,0.00013792627,0.000011234071,0.000026795851,0.0009391738,0.21498501,0.000030394358,0.0038734304,0.0010559997,0.7787975],"study_design_scores_gemma":[0.00047981946,0.00016452932,0.00008938699,0.0012842402,0.000010351957,0.000027877839,4.8065715e-7,0.9597352,0.00018581632,0.022773853,0.014462791,0.0007856223],"about_ca_topic_score_codex":0.000025967442,"about_ca_topic_score_gemma":0.000031294785,"teacher_disagreement_score":0.77801186,"about_ca_system_score_codex":0.00068555813,"about_ca_system_score_gemma":0.0008146142,"threshold_uncertainty_score":0.9994563},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009208539,0.00061971624,0.9787857,0.00008912213,0.0016464057,0.00058724754,0.00003152797,0.000035971596,0.008995758],"genre_scores_gemma":[0.90040994,0.00001104485,0.09797397,0.00064524065,0.00013378017,0.00001740119,0.000010821778,0.000028169428,0.00076965924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970431,0.000058196856,0.00082672393,0.0010670129,0.00040396227,0.00060101046],"domain_scores_gemma":[0.9984752,0.0003177288,0.0002865875,0.00071728916,0.000110422385,0.000092796705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000677946,0.0003485805,0.00060567213,0.0008338277,0.00007264731,0.00004271938,0.0010468247,0.0003661103,0.00016223287],"category_scores_gemma":[0.000043156717,0.000353276,0.00008639564,0.00028662028,0.0002339558,0.0001277138,0.00064946635,0.00097306824,0.000012840905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009546061,0.00023141234,0.049461417,0.00071242295,0.000029020284,0.0003270574,0.007545568,0.08507109,0.00020263973,0.0006565633,0.000019982475,0.8556474],"study_design_scores_gemma":[0.0006760965,0.00009593404,0.000499102,0.0036441528,0.000008480355,0.00003203706,0.000006664745,0.9890086,0.0005862342,0.005031835,0.00002774107,0.0003831005],"about_ca_topic_score_codex":0.0015068412,"about_ca_topic_score_gemma":0.0020143408,"teacher_disagreement_score":0.9039375,"about_ca_system_score_codex":0.00029529267,"about_ca_system_score_gemma":0.00023710952,"threshold_uncertainty_score":0.99989194},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002465388,0.00010387755,0.9790055,0.00022837051,0.0043151616,0.00047294464,0.000023766732,0.00008661357,0.013298334],"genre_scores_gemma":[0.9716862,0.00004738257,0.023933897,0.0031964942,0.00031588992,0.000010612971,0.0000028951804,0.00004431106,0.00076230563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996424,0.0000511761,0.0005167664,0.0016174159,0.0008355369,0.0005550719],"domain_scores_gemma":[0.99649864,0.002451459,0.00022243244,0.00065034576,0.00009557648,0.0000815623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049804477,0.00045657606,0.00044689747,0.0013408746,0.00022563574,0.00019879839,0.0011504327,0.00032397214,0.000022870465],"category_scores_gemma":[0.00071897946,0.00043113602,0.00012372369,0.0008400494,0.00082159706,0.000317975,0.0007399871,0.0011275552,0.000022862701],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065853674,0.000038568214,0.00009255005,0.000032940672,0.000002294139,0.00034771414,0.00015443357,0.035468567,0.00079320447,0.04939374,0.000036956655,0.9135732],"study_design_scores_gemma":[0.00018290969,0.00011132305,0.000104287996,0.0012245695,0.0000039022934,0.000026594853,5.6286876e-7,0.7561614,0.00045781324,0.24104856,0.00024229975,0.00043578088],"about_ca_topic_score_codex":0.000012294966,"about_ca_topic_score_gemma":0.00058956095,"teacher_disagreement_score":0.9692208,"about_ca_system_score_codex":0.001248,"about_ca_system_score_gemma":0.00044629382,"threshold_uncertainty_score":0.99981403},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016318565,0.0006295404,0.9953443,0.0003071858,0.00040250117,0.0008099656,0.0000038123858,0.0002489752,0.0006218838],"genre_scores_gemma":[0.46383733,0.000055751058,0.53367156,0.0017199971,0.00041068505,0.00005626018,0.000018282362,0.00004103036,0.00018908129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596703,0.000035712597,0.00054685934,0.0019130816,0.00079716614,0.00074017816],"domain_scores_gemma":[0.9974797,0.0002839485,0.00042427628,0.0012242324,0.00036522682,0.00022266577],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040563237,0.00058286247,0.0004586238,0.00041471582,0.0006707462,0.00071939133,0.0022629092,0.00020226721,0.0000061861074],"category_scores_gemma":[0.00003908612,0.0004976609,0.000039121896,0.00137716,0.00062277797,0.0008282602,0.0012719649,0.00070524955,0.0000037808359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000080368445,0.000023357046,0.0002160188,0.000034817298,0.000003834516,0.000013611502,0.00018501155,0.36447293,0.000033071614,0.005768536,0.000010215271,0.62923056],"study_design_scores_gemma":[0.0002452066,0.00016527729,0.00043477074,0.00042767232,0.0000119181495,0.00002556112,3.171845e-7,0.97691065,0.00015787019,0.020713257,0.00037260086,0.00053487683],"about_ca_topic_score_codex":0.0000037823156,"about_ca_topic_score_gemma":0.000076583856,"teacher_disagreement_score":0.6286957,"about_ca_system_score_codex":0.00017745457,"about_ca_system_score_gemma":0.000523846,"threshold_uncertainty_score":0.9997475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025083523,0.00037883996,0.9936522,0.0013773566,0.0016842436,0.00036121003,0.000002119566,0.00038544057,0.0019077483],"genre_scores_gemma":[0.78136903,0.0000306513,0.21487576,0.0025905457,0.00050256436,0.000016374266,0.000021041798,0.00004397384,0.0005500361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961849,0.00011189975,0.000607652,0.0017688392,0.0007133038,0.00061343244],"domain_scores_gemma":[0.9970594,0.00131543,0.00039120569,0.0007192986,0.00034794165,0.00016674343],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00082758785,0.00059081276,0.00053936476,0.0011704786,0.0009822006,0.0013521988,0.0013429873,0.0003869482,0.000019621839],"category_scores_gemma":[0.00019593397,0.0005932786,0.0001145809,0.00095683284,0.00045791443,0.00047665925,0.0010357286,0.0020108472,0.000012264674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009983712,0.000022160366,0.000111662004,0.000115052906,0.000016526496,0.000036459307,0.00084856414,0.11849048,0.00020877089,0.0037790053,0.000017795728,0.87634355],"study_design_scores_gemma":[0.00030896414,0.00011204411,0.00007951488,0.0010076626,0.000008864912,0.0000898461,6.240416e-7,0.97234225,0.0013734257,0.019543653,0.004508432,0.0006247112],"about_ca_topic_score_codex":0.000038665225,"about_ca_topic_score_gemma":0.00005249916,"teacher_disagreement_score":0.87571883,"about_ca_system_score_codex":0.000260617,"about_ca_system_score_gemma":0.0006900049,"threshold_uncertainty_score":0.9996845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003344924,0.0017850754,0.99245256,0.0006720552,0.001668502,0.0008492026,0.00000940233,0.00028186856,0.0022479086],"genre_scores_gemma":[0.40975162,0.00001846339,0.58468485,0.0018592561,0.00043815267,0.000052474963,0.000043504726,0.000053387193,0.0030982688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958982,0.00012645338,0.00075733254,0.0017251843,0.00080396223,0.0006888612],"domain_scores_gemma":[0.9960503,0.002230378,0.0004674818,0.00068188703,0.00040910376,0.00016087892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016624694,0.0006320433,0.00088608655,0.00083567156,0.00051713234,0.0005125428,0.0017387077,0.00032207693,0.000033497963],"category_scores_gemma":[0.0004397186,0.0005745313,0.00041192642,0.000500117,0.00041098637,0.00065662584,0.00035809775,0.0012454165,0.000008774902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003404998,0.000015952426,0.000009227136,0.000031762575,0.000087316344,0.000023387558,0.001636032,0.14913379,0.0001891121,0.001372528,0.0000067078176,0.84746015],"study_design_scores_gemma":[0.000828225,0.00021055593,0.000036258854,0.000093815645,0.00011070178,0.000028566057,0.000001064166,0.98832345,0.00079253485,0.005666707,0.003347578,0.0005605626],"about_ca_topic_score_codex":0.00002992173,"about_ca_topic_score_gemma":0.000102571736,"teacher_disagreement_score":0.84689957,"about_ca_system_score_codex":0.00015200936,"about_ca_system_score_gemma":0.00039575767,"threshold_uncertainty_score":0.9996706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005697228,0.00065836776,0.9869973,0.000059752438,0.00053571764,0.00027374944,0.000007308085,0.000017815055,0.005752763],"genre_scores_gemma":[0.8761439,0.00081207836,0.11646203,0.0008153218,0.0015765633,0.000019667623,0.00037616174,0.00007139277,0.003722894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986244,0.000010143914,0.00028900392,0.0005510724,0.00022241173,0.00030301212],"domain_scores_gemma":[0.9990884,0.000024947532,0.00018948854,0.0005230869,0.00012416512,0.000049907685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026760547,0.0002888965,0.00022343083,0.00016138553,0.00015066762,0.0001231738,0.00053732155,0.0002768887,0.000008749367],"category_scores_gemma":[0.000014257896,0.00023468025,0.000084963154,0.00016914782,0.00018105759,0.000011268518,0.00035875698,0.0003503728,0.0000024658118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052629306,0.00022185236,0.00987779,0.000716324,0.00023087385,0.000018143914,0.00047269303,0.41727227,0.029361378,0.0016406591,0.0014273066,0.5382344],"study_design_scores_gemma":[0.0031842533,0.0038784326,0.0023839562,0.0028822685,0.00017553881,0.00011712335,0.000009544118,0.8851624,0.06442784,0.006872639,0.026903884,0.00400211],"about_ca_topic_score_codex":0.0000074848435,"about_ca_topic_score_gemma":0.000028686327,"teacher_disagreement_score":0.87053525,"about_ca_system_score_codex":0.000036923633,"about_ca_system_score_gemma":0.00014225834,"threshold_uncertainty_score":0.9569983},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018568833,0.00012993476,0.9895157,0.0062644677,0.00032964686,0.001084419,0.000030187184,0.00021259525,0.0005761218],"genre_scores_gemma":[0.66479117,0.000008806919,0.33375573,0.0010723057,0.00007536757,0.00007790722,0.000041116222,0.000024171792,0.00015343852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968416,0.00006376775,0.0004309504,0.0016180043,0.0004999466,0.00054572755],"domain_scores_gemma":[0.99762803,0.000634649,0.00029711047,0.001129787,0.00020672337,0.0001037204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00099127,0.00040101403,0.0004484539,0.0010696434,0.00033843357,0.00030532703,0.0019823033,0.0003359274,0.0000028929753],"category_scores_gemma":[0.00010111496,0.0004182148,0.000114079776,0.0006629944,0.00019482244,0.0005737225,0.00082643144,0.0010451677,0.000008672235],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005875861,0.000038853606,0.000023582052,0.00014017116,0.0000031069796,0.0000068264258,0.00065266725,0.029239869,0.0005515348,0.0076361727,0.000007869381,0.96169347],"study_design_scores_gemma":[0.00023617306,0.00009731738,0.0004521973,0.00051432295,0.0000030592,0.0000050061476,1.3624141e-7,0.7797246,0.00022863876,0.21838179,0.00003789116,0.0003188924],"about_ca_topic_score_codex":0.0008173267,"about_ca_topic_score_gemma":0.0011068272,"teacher_disagreement_score":0.9613746,"about_ca_system_score_codex":0.0005906916,"about_ca_system_score_gemma":0.0003681689,"threshold_uncertainty_score":0.99982697},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003830173,0.002450893,0.9807644,0.00036564775,0.0018206161,0.0011698959,0.000008695323,0.000066913,0.009522754],"genre_scores_gemma":[0.9177991,0.000024052648,0.079761684,0.0013434463,0.00028295757,0.00005411005,0.000024400677,0.000051398685,0.0006588079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658626,0.0001336001,0.0007738066,0.0013040499,0.00040827802,0.0007940179],"domain_scores_gemma":[0.9983307,0.0007150048,0.00029192277,0.0004940305,0.00006339852,0.00010492607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015730556,0.0003954253,0.00056688633,0.0012359251,0.00021079193,0.00014026352,0.00078296085,0.0004099938,0.000027528835],"category_scores_gemma":[0.000113698145,0.0003942355,0.00007339963,0.00041229016,0.00018154956,0.0002495355,0.0004552886,0.0016415948,0.0000048209686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007887355,0.00009313033,0.009397851,0.00049468526,0.0000046140185,0.00010340067,0.0013754367,0.10379117,0.000059336013,0.004836131,0.000010978181,0.87975436],"study_design_scores_gemma":[0.0013987223,0.00011573918,0.003206294,0.010015681,0.000007797532,0.000029885847,0.0000048684424,0.9316448,0.00017251956,0.051837962,0.0009370252,0.0006287005],"about_ca_topic_score_codex":0.00022329082,"about_ca_topic_score_gemma":0.00077829446,"teacher_disagreement_score":0.913969,"about_ca_system_score_codex":0.0007005758,"about_ca_system_score_gemma":0.00026941756,"threshold_uncertainty_score":0.9998509},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014999406,0.0038792794,0.98492765,0.0025425514,0.0027796305,0.001620828,0.000040057876,0.000029365056,0.0026806947],"genre_scores_gemma":[0.9621537,0.00060345436,0.0294303,0.0057566073,0.0010365442,0.00007963061,0.000005983739,0.000044182056,0.0008896513],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737823,0.000023450459,0.0007151673,0.00084008137,0.0006099988,0.00043306354],"domain_scores_gemma":[0.99770296,0.001039298,0.00020780807,0.0006839878,0.00029605976,0.00006988824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007580875,0.00033231772,0.0007174961,0.00042406487,0.00014042955,0.000060886614,0.00065426127,0.0003374773,0.0000846194],"category_scores_gemma":[0.00021653358,0.00022229578,0.0002532041,0.00036106224,0.00057349075,0.000093261784,0.00032699152,0.0006713051,0.0000015144554],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051487354,0.0001280632,0.0048236568,0.0001435899,0.000111109526,0.000087679626,0.0003147183,0.010822701,0.000022093325,0.0011240195,0.00060899364,0.9812985],"study_design_scores_gemma":[0.01816704,0.00429741,0.028383376,0.029476073,0.001495995,0.0002491923,0.000013985282,0.33336917,0.0026645486,0.53305155,0.04622556,0.0026061325],"about_ca_topic_score_codex":0.000101695965,"about_ca_topic_score_gemma":0.00035558292,"teacher_disagreement_score":0.97869235,"about_ca_system_score_codex":0.00025703656,"about_ca_system_score_gemma":0.0015338131,"threshold_uncertainty_score":0.90649587},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01271878,0.0009384904,0.9829281,0.00046400863,0.0010733494,0.00039978483,0.00017632564,0.00025818098,0.0010429905],"genre_scores_gemma":[0.9847877,0.00018206028,0.014547172,0.00009215691,0.00021902764,0.00001104004,0.000017862289,0.00004541493,0.00009753691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978313,0.000015201765,0.00039925252,0.00084786746,0.00033369026,0.0005727156],"domain_scores_gemma":[0.99848753,0.0006819074,0.00006562674,0.0005822196,0.000041215655,0.00014152474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004351151,0.00052548636,0.00065328804,0.0008184963,0.000058468246,0.00018213823,0.0007416855,0.00042738055,0.000004038314],"category_scores_gemma":[0.000244354,0.0005139283,0.000088790315,0.00052125024,0.0004267902,0.00021808759,0.00022767493,0.0013772019,6.6929795e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008010648,0.000009808972,0.0037859518,0.00030197724,0.000033883935,0.000029323646,0.0010258767,0.43849668,0.000027418228,0.00029945894,0.000028640246,0.55595297],"study_design_scores_gemma":[0.0002750187,0.00007691501,0.011936622,0.0009093108,0.000019585174,0.000014206824,0.0000013829042,0.978619,0.00015039301,0.0067750826,0.0006461421,0.0005763779],"about_ca_topic_score_codex":0.000018960456,"about_ca_topic_score_gemma":0.00014568404,"teacher_disagreement_score":0.97206897,"about_ca_system_score_codex":0.0005616636,"about_ca_system_score_gemma":0.00014252694,"threshold_uncertainty_score":0.99973124},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022291539,0.0024907454,0.9921081,0.0011354819,0.00062763446,0.001042551,0.00010510957,0.000071996335,0.00018920487],"genre_scores_gemma":[0.4710756,0.0000808144,0.52640295,0.001585587,0.0005548695,0.000021469757,0.000039537874,0.00006973771,0.00016942731],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716496,0.000049881164,0.00058115955,0.00082561164,0.00086863444,0.0005097547],"domain_scores_gemma":[0.99677294,0.0010418853,0.0005684845,0.00064176676,0.0008525642,0.0001223425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007440272,0.00050462806,0.0010472036,0.0011035289,0.00015844707,0.000025159112,0.00065652776,0.00065257936,0.00010299672],"category_scores_gemma":[0.00035091265,0.0004087008,0.00032228144,0.00081087014,0.0010498557,0.00009073241,0.00016052833,0.0015627173,3.4204186e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007632968,0.00008982388,0.0032349292,0.0014089545,0.00014906877,0.00002840571,0.00090646284,0.091376774,0.046587717,0.00039996486,0.000019777191,0.8550348],"study_design_scores_gemma":[0.0060334187,0.0012276467,0.02576406,0.043382008,0.0005852532,0.00006263281,0.000004875372,0.8489426,0.066649355,0.006070684,0.00021948405,0.001058005],"about_ca_topic_score_codex":0.000071890034,"about_ca_topic_score_gemma":0.0000131493025,"teacher_disagreement_score":0.85397685,"about_ca_system_score_codex":0.00011322518,"about_ca_system_score_gemma":0.0005340361,"threshold_uncertainty_score":0.9998365},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01399288,0.004605673,0.97132987,0.0027279682,0.0018351349,0.0005841859,0.00007769155,0.00016800138,0.004678626],"genre_scores_gemma":[0.3543508,0.00023140793,0.62955946,0.009436754,0.003057191,0.000006064016,0.00019862106,0.00012696072,0.0030327253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967701,0.000043135904,0.0005394261,0.0013354776,0.00074408087,0.00056780805],"domain_scores_gemma":[0.9978148,0.00063256477,0.00024058566,0.00088019716,0.0002081034,0.0002237486],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007601314,0.0005147212,0.00079108845,0.00051559415,0.0002865084,0.0002737282,0.00068855326,0.00043586708,0.000044483797],"category_scores_gemma":[0.00077097403,0.0004326808,0.0001929605,0.0003492557,0.0010285645,0.00016459222,0.00058518583,0.0025423174,0.0000059344056],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063859174,0.000059349582,0.014125334,0.00029075512,0.00007780449,0.0003373548,0.00091647025,0.008484566,0.022543406,0.00013936903,0.00017443883,0.9527873],"study_design_scores_gemma":[0.0028820946,0.0003570214,0.028485563,0.01472689,0.0005333972,0.000562481,0.0000037661753,0.83942014,0.020472873,0.06947826,0.02085175,0.0022257771],"about_ca_topic_score_codex":0.0004476874,"about_ca_topic_score_gemma":0.000050497598,"teacher_disagreement_score":0.9505615,"about_ca_system_score_codex":0.00040426396,"about_ca_system_score_gemma":0.00075346814,"threshold_uncertainty_score":0.9998125},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001046145,0.00026162155,0.9843609,0.00078282534,0.0028418312,0.0008699596,0.000039754646,0.0002348592,0.01050364],"genre_scores_gemma":[0.8449035,0.000015152187,0.14838816,0.0017339048,0.0007341896,0.000056252073,0.000016483038,0.00004345312,0.004108899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518985,0.00006679739,0.0007210133,0.0019449441,0.0014014862,0.0006759166],"domain_scores_gemma":[0.9971648,0.0003006626,0.0002657071,0.0017230853,0.0003575593,0.00018819855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009848521,0.0006222622,0.0007957283,0.00071120675,0.00042202944,0.0006712022,0.0040522655,0.0002754064,0.000029749022],"category_scores_gemma":[0.00003850224,0.0005810957,0.00019675378,0.0009534156,0.0005940782,0.00050030014,0.0007196962,0.00095997384,0.000043893193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027322607,0.00056476716,0.00016985384,0.00015265775,0.00011402239,0.00043084475,0.0023014308,0.042430256,0.000049270973,0.062044766,0.0004997003,0.8912151],"study_design_scores_gemma":[0.00185241,0.00069302064,0.0011070431,0.0010357639,0.00004323414,0.00020627191,0.0000023176708,0.8616243,0.00030364108,0.11825371,0.012801987,0.002076295],"about_ca_topic_score_codex":0.000097882046,"about_ca_topic_score_gemma":0.00031342072,"teacher_disagreement_score":0.8891388,"about_ca_system_score_codex":0.00035606604,"about_ca_system_score_gemma":0.0008883169,"threshold_uncertainty_score":0.99966407},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004205893,0.000095854506,0.9885791,0.0020696402,0.0009368118,0.00050742185,0.0000065931395,0.00006783812,0.00769467],"genre_scores_gemma":[0.36402932,0.000031386662,0.6264033,0.007656585,0.00011824819,0.00003261376,0.000014842805,0.00003430703,0.0016794368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701506,0.00007078233,0.00046812542,0.0008894216,0.0011598008,0.00039678926],"domain_scores_gemma":[0.99725753,0.0010664304,0.00023593089,0.0009387141,0.00040828926,0.00009311481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084703596,0.0003264124,0.00034507422,0.00066849735,0.00024438614,0.0003225311,0.0026833839,0.00019488498,0.00013287058],"category_scores_gemma":[0.00008137676,0.00024195471,0.00013406774,0.0007236543,0.00081285025,0.00026875432,0.00095484173,0.0006583721,0.000029160828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025362997,0.000020690277,0.0000017842287,0.000009422367,0.000009751507,0.0000034498646,0.00020160039,0.66238946,0.000010306813,0.32184538,0.00007855532,0.015427085],"study_design_scores_gemma":[0.0001709951,0.00013901916,0.000017823992,0.00022791109,0.0000028383013,0.0000054515117,3.4474033e-7,0.7152937,0.00021651828,0.2835163,0.00019044436,0.00021866843],"about_ca_topic_score_codex":0.0000074717045,"about_ca_topic_score_gemma":0.0000074845084,"teacher_disagreement_score":0.36398727,"about_ca_system_score_codex":0.00017823584,"about_ca_system_score_gemma":0.0010229817,"threshold_uncertainty_score":0.9866627},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015944967,0.0009908885,0.9931248,0.0014166635,0.001627293,0.00038487578,0.0000056709578,0.0005105642,0.0017797909],"genre_scores_gemma":[0.010599949,0.000031822747,0.9859761,0.0020412693,0.0006436948,0.000027376125,0.000010375821,0.000022566222,0.00064682233],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779695,0.00003374532,0.00038928003,0.00094720366,0.00049825286,0.00033457347],"domain_scores_gemma":[0.99451214,0.0034882773,0.00032772703,0.001347631,0.00025150258,0.00007271682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088109565,0.00037543013,0.00029197757,0.00048803218,0.00028118168,0.00090276345,0.0021560467,0.00045182364,0.0000037816067],"category_scores_gemma":[0.0020724903,0.0002901583,0.000047591853,0.0010289232,0.00025847598,0.0006741118,0.0013602374,0.0015585326,0.0000019195923],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011993571,0.000016731272,0.00186445,0.000027086006,0.000009596027,0.00005344311,0.00048813835,0.00052795594,0.0000107119695,0.00234593,0.00052622426,0.9941285],"study_design_scores_gemma":[0.00047607048,0.0004964133,0.012142669,0.008361121,0.00014194436,0.002881856,0.0000053368694,0.25558153,0.0013932744,0.46606278,0.24858834,0.0038686765],"about_ca_topic_score_codex":0.00049468473,"about_ca_topic_score_gemma":0.000024735069,"teacher_disagreement_score":0.9902599,"about_ca_system_score_codex":0.00014378758,"about_ca_system_score_gemma":0.001816515,"threshold_uncertainty_score":0.99995506},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050146653,0.00016532298,0.994899,0.0008851007,0.00042794022,0.0013259993,0.000016485163,0.00010026597,0.0021297908],"genre_scores_gemma":[0.079924785,0.00007310489,0.91523814,0.0033106068,0.00024031094,0.00010978522,0.000025433335,0.000032680593,0.0010451691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963992,0.000093856775,0.0004423487,0.0013470863,0.0009465082,0.000770995],"domain_scores_gemma":[0.9976215,0.000603049,0.000101182246,0.001274785,0.00026759552,0.00013190955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019892785,0.0003911801,0.00038324183,0.00094803615,0.0003359518,0.000643737,0.004299599,0.00026883447,0.000008449691],"category_scores_gemma":[0.00004867094,0.0003046825,0.000113535345,0.0007890361,0.00036216187,0.00070714415,0.000907696,0.000947072,0.0000062642257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043420064,0.000041237992,0.000009834907,0.00004089005,0.0000035789767,0.000013743684,0.0034985654,0.89984435,0.000014061503,0.01541586,0.00003036759,0.08108316],"study_design_scores_gemma":[0.0002795758,0.00014318961,0.0000069093358,0.00012639251,0.000002332042,0.000010060143,0.0000016105266,0.95060223,0.00021654251,0.047737822,0.00054567185,0.0003276905],"about_ca_topic_score_codex":0.000040656203,"about_ca_topic_score_gemma":0.00010469118,"teacher_disagreement_score":0.08075547,"about_ca_system_score_codex":0.00021292843,"about_ca_system_score_gemma":0.0008909836,"threshold_uncertainty_score":0.9999405},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043667835,0.0012906938,0.99534184,0.00080050866,0.00059928617,0.00058313063,0.00039452556,0.0000245452,0.0005288231],"genre_scores_gemma":[0.100424655,0.00024399161,0.8931026,0.0031055794,0.00060916925,0.00003649576,0.002122015,0.000049307186,0.00030621383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722874,0.00004406747,0.0005330565,0.001381483,0.00025339745,0.00055926054],"domain_scores_gemma":[0.9973343,0.00039740058,0.00028186903,0.0016197098,0.00026916133,0.00009753292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009494376,0.00039250145,0.00043250067,0.00021868217,0.00024131418,0.000081681406,0.0019466251,0.00084867416,0.000011478882],"category_scores_gemma":[0.0009675905,0.00038719413,0.00010387102,0.00018627399,0.00029453964,0.000011687484,0.00041853986,0.00041956743,0.0000033480555],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017369931,0.000067955836,0.00042658203,0.00026994557,0.00017590013,0.000006818131,0.00019024785,0.110499226,0.011899011,0.006171403,0.0040001674,0.866119],"study_design_scores_gemma":[0.001730864,0.001184952,0.0003819699,0.00064361596,0.00019497931,0.000016139682,0.0000018744512,0.50619084,0.009778574,0.43353266,0.04443153,0.0019120326],"about_ca_topic_score_codex":0.00004213522,"about_ca_topic_score_gemma":0.00031998486,"teacher_disagreement_score":0.864207,"about_ca_system_score_codex":0.0001753556,"about_ca_system_score_gemma":0.001369054,"threshold_uncertainty_score":0.999858},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002050462,0.10833737,0.8268076,0.00265273,0.0010521595,0.006894879,0.00020798571,0.00035733893,0.051639434],"genre_scores_gemma":[0.98597246,0.00013067276,0.011693097,0.001355288,0.00031271466,0.00007523456,0.000080195234,0.00005466632,0.00032565746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960408,0.000098266435,0.0004991408,0.0013579294,0.0011331055,0.0008707494],"domain_scores_gemma":[0.9974982,0.00059189653,0.0001559743,0.0010198967,0.00015891845,0.0005750711],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007715751,0.0005684037,0.00081182696,0.0011269238,0.00017449347,0.00011851642,0.00065073534,0.00025094402,0.00005387813],"category_scores_gemma":[0.00014425852,0.00046710923,0.00024105755,0.0005951007,0.0009524554,0.00016664076,0.0003436858,0.00084153446,0.000022594264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019398393,0.00093084,0.013741713,0.00059356657,0.004720097,0.0021237878,0.0006163419,0.01272054,0.000049305454,0.020467162,0.0000933903,0.9420034],"study_design_scores_gemma":[0.022940975,0.0016021862,0.05282057,0.012505105,0.0053873775,0.00024275725,0.0000092473565,0.6442998,0.001271482,0.2536606,0.00091725844,0.004342682],"about_ca_topic_score_codex":0.000028143557,"about_ca_topic_score_gemma":0.0000150075675,"teacher_disagreement_score":0.983922,"about_ca_system_score_codex":0.00039958733,"about_ca_system_score_gemma":0.0017507167,"threshold_uncertainty_score":0.99977803},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008245678,0.00007062769,0.99002486,0.00048928364,0.00060293684,0.0004102943,0.000002477364,0.00006597338,0.00008783944],"genre_scores_gemma":[0.76610225,0.000071627226,0.23331887,0.0001522896,0.00006272792,0.00010604247,0.0000019081733,0.000012650251,0.00017162299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979272,0.000019073235,0.00039797975,0.0007281203,0.00058821,0.00033944706],"domain_scores_gemma":[0.9961912,0.0025259648,0.00011496007,0.000885646,0.00022956487,0.000052656465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009996153,0.00021188166,0.00023901499,0.0007716095,0.00010865505,0.000113314614,0.001777738,0.00011385781,0.0000010370894],"category_scores_gemma":[0.0005776168,0.00018282875,0.000052727948,0.0007083049,0.0001516163,0.0005359371,0.0005021284,0.0003438849,0.0000022554134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009371927,0.000008315331,0.00036191102,0.000070500595,0.0000028091706,5.817635e-7,0.00046953204,0.66098326,0.0005226627,0.019769652,0.0000065447794,0.31779486],"study_design_scores_gemma":[0.000118308584,0.00006611862,0.0076128193,0.00040654503,0.0000019562108,0.0000015954853,8.0381895e-8,0.9838087,0.0019293822,0.0057988036,0.0000830888,0.00017259845],"about_ca_topic_score_codex":0.000011845702,"about_ca_topic_score_gemma":0.000022632545,"teacher_disagreement_score":0.7578566,"about_ca_system_score_codex":0.00035729856,"about_ca_system_score_gemma":0.0003586293,"threshold_uncertainty_score":0.745554},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02441355,0.00053312746,0.9721855,0.0006459332,0.00048819205,0.00034025006,0.0000020399762,0.000100809775,0.0012906127],"genre_scores_gemma":[0.7204591,0.00010074248,0.2767414,0.001604837,0.00029512154,0.000005593768,0.000004873431,0.000034818375,0.00075352984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976624,0.000030957333,0.00047354403,0.00089320855,0.00053467264,0.00040519226],"domain_scores_gemma":[0.99900883,0.00008702757,0.00014500992,0.00051587017,0.00013815633,0.00010510546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004953878,0.00035495844,0.000644066,0.0014561795,0.00011450267,0.0001274573,0.00034104008,0.00019556256,0.000023015748],"category_scores_gemma":[0.00006805738,0.00031480502,0.00018225785,0.00073666015,0.00026013603,0.00013385457,0.00020225205,0.0006371179,0.0000057057828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008599357,0.00012932373,0.008782957,0.00051496155,0.000100344645,0.00065815466,0.00146986,0.033860784,0.014669327,0.00001785519,0.000005160847,0.93970525],"study_design_scores_gemma":[0.0004865138,0.00013255874,0.0010298674,0.002170413,0.00010086882,0.00005704301,0.0000013780754,0.9925527,0.0025227268,0.0005149171,0.000125341,0.00030568725],"about_ca_topic_score_codex":0.00019764346,"about_ca_topic_score_gemma":0.00011517224,"teacher_disagreement_score":0.9586919,"about_ca_system_score_codex":0.0006666364,"about_ca_system_score_gemma":0.00047740742,"threshold_uncertainty_score":0.9999304},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.562074e-7,0.000028232413,0.9899431,0.0017682511,0.0004267686,0.001129636,0.0000075759,0.00028778572,0.006407803],"genre_scores_gemma":[0.0039760387,0.000014564139,0.99134904,0.0021526744,0.00064906693,0.000035096906,0.00002752715,0.0000446442,0.001751366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959715,0.000073729396,0.0005313428,0.0016321401,0.0009252517,0.0008660621],"domain_scores_gemma":[0.99660057,0.00064313837,0.00039928974,0.0017352357,0.00042408906,0.00019765808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010673254,0.00060690875,0.000575218,0.002245497,0.0004367622,0.00097310153,0.0037766972,0.00034079928,0.0000040073114],"category_scores_gemma":[0.00027389184,0.00053402764,0.00010667718,0.0014750372,0.00034702767,0.0009201613,0.00074836845,0.0006204875,0.000004199759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015604432,0.000012559428,0.0000075671596,0.000059940125,0.000014404994,0.000009211824,0.00034541573,0.7622108,0.000026946793,0.092487894,0.000013311547,0.14479634],"study_design_scores_gemma":[0.00045704597,0.00060313777,0.000011850077,0.00028856358,0.000014763517,0.000029677962,2.0164396e-7,0.9783231,0.0005214324,0.018103246,0.001067993,0.0005789774],"about_ca_topic_score_codex":0.00006621089,"about_ca_topic_score_gemma":0.000046695375,"teacher_disagreement_score":0.2161123,"about_ca_system_score_codex":0.00054701447,"about_ca_system_score_gemma":0.0025549775,"threshold_uncertainty_score":0.99971116},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3707827,0.0011838073,0.6274276,0.00033653126,0.00017148667,0.000070420625,4.1597806e-7,0.0000010036996,0.000026029267],"genre_scores_gemma":[0.9955572,0.00003744315,0.0031051636,0.0012307428,0.00006054011,0.000004371388,0.0000010281034,0.0000028204167,6.801185e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933493,0.000032903623,0.00012836145,0.00026552408,0.000071445,0.00016686163],"domain_scores_gemma":[0.99945545,0.00017836828,0.0000435742,0.00026141753,0.000041903528,0.000019269253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019402528,0.000092110415,0.00011799541,0.000044207038,0.00010976445,0.000026595142,0.00027941147,0.00005720892,5.95294e-7],"category_scores_gemma":[0.000055087174,0.00006285852,0.000026490783,0.0002837547,0.000356427,4.1746833e-7,0.0001756061,0.0000901259,7.326607e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023693055,0.00002992018,0.025029674,0.0000042286547,0.000008819303,2.1441588e-7,0.0000402107,0.856224,0.011338229,0.00022803078,0.000045826913,0.107027166],"study_design_scores_gemma":[0.00021969157,0.00021345011,0.030875785,0.00003222974,0.0000049765817,3.6167756e-7,0.000001265669,0.9207687,0.04643145,0.0012369934,0.00012292567,0.00009220219],"about_ca_topic_score_codex":0.000009449123,"about_ca_topic_score_gemma":0.00007226701,"teacher_disagreement_score":0.6247745,"about_ca_system_score_codex":0.0000066938505,"about_ca_system_score_gemma":0.00004685479,"threshold_uncertainty_score":0.2563296},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056276844,0.0012781292,0.9954436,0.0012422911,0.00059038075,0.00072671636,0.00008540528,0.00007385081,0.00050339155],"genre_scores_gemma":[0.14836241,0.00017694003,0.847262,0.0036287725,0.00024810512,0.00007718469,0.00012113984,0.000022618584,0.00010077694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677986,0.000051786137,0.0005259776,0.0015908341,0.00049401773,0.0005575061],"domain_scores_gemma":[0.9970203,0.0009640932,0.0001902493,0.0015373632,0.00018141905,0.00010655179],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086752395,0.0004756852,0.0005917223,0.0019350643,0.00034624076,0.0009926833,0.0032334588,0.0003359305,0.0000052315286],"category_scores_gemma":[0.00006703376,0.00037644716,0.0002666837,0.0020968092,0.00049472094,0.00060241413,0.0008492197,0.00065011514,7.0817873e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034022574,0.00020712,0.0008499957,0.00018807877,0.00024182042,0.00006171074,0.0035710793,0.045617674,0.000085238855,0.18754995,0.00023831661,0.761355],"study_design_scores_gemma":[0.00038897467,0.00015344932,0.0009912588,0.00015667298,0.00010580006,0.000010187772,5.653029e-7,0.88959587,0.0000724609,0.10516609,0.00279834,0.0005603106],"about_ca_topic_score_codex":0.000048445938,"about_ca_topic_score_gemma":0.0011575068,"teacher_disagreement_score":0.8439782,"about_ca_system_score_codex":0.00006634072,"about_ca_system_score_gemma":0.00024486988,"threshold_uncertainty_score":0.99986875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011379736,0.00073512906,0.99512213,0.0002921144,0.0012387224,0.00043192643,0.0000023578755,0.0004430803,0.0016207425],"genre_scores_gemma":[0.37052283,0.00014470046,0.62748355,0.0014880116,0.00023339583,0.000008571981,0.0000060422817,0.000027871376,0.00008505816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961928,0.0000771651,0.0006930716,0.0015737441,0.0007135043,0.00074972847],"domain_scores_gemma":[0.9971787,0.0010448247,0.0003295299,0.0010010736,0.00024067979,0.00020523617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006987611,0.00063386024,0.0006604821,0.00076589116,0.00043805505,0.0009884932,0.002288921,0.0003969604,0.000008561633],"category_scores_gemma":[0.00014016392,0.00059788063,0.00012041159,0.00070321234,0.0005033148,0.0004447202,0.0014482642,0.0010215053,0.0000031124225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025213635,0.00001367857,0.000046809793,0.000031554282,0.000007853528,0.000023736296,0.00014916633,0.5521979,0.0000032418784,0.021851605,0.000014018001,0.42565796],"study_design_scores_gemma":[0.00020283253,0.00014767182,0.00007260383,0.0007578374,0.0000101308315,0.000026494383,1.2123887e-7,0.96978563,0.000038000482,0.02828771,0.000095916475,0.0005750296],"about_ca_topic_score_codex":0.000022007158,"about_ca_topic_score_gemma":0.000024130488,"teacher_disagreement_score":0.42508292,"about_ca_system_score_codex":0.00023514975,"about_ca_system_score_gemma":0.0002843615,"threshold_uncertainty_score":0.99964726},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005032676,0.002645758,0.9555468,0.0001353925,0.002763233,0.00025888265,0.000005046389,0.0003334574,0.038261086],"genre_scores_gemma":[0.48152122,0.002081411,0.4662718,0.007633577,0.0064766016,0.000116550706,0.00014106734,0.00067776814,0.03508002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813753,0.000011355701,0.00032306058,0.0005789462,0.00042873248,0.0005203681],"domain_scores_gemma":[0.99851173,0.0006041421,0.00005534289,0.0006923005,0.00007491235,0.00006155345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036326438,0.00037836074,0.0003441869,0.0008917736,0.000088274064,0.000138501,0.0009895837,0.00035768477,0.000035107332],"category_scores_gemma":[0.00009928199,0.00039488848,0.00007221476,0.0006786768,0.00023738688,0.00015194663,0.00018573951,0.0010212976,0.000031327356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.1457383e-7,0.000002071902,0.0000022930697,0.000040613446,0.000008760792,0.000010022517,0.000046991125,0.6178129,0.000020407088,0.003063245,0.00044731505,0.37854448],"study_design_scores_gemma":[0.00010676804,0.000024167475,0.000012632018,0.00040462823,0.000009643494,0.00000907237,2.7973373e-8,0.94133776,0.00062595546,0.04271401,0.014318584,0.00043675027],"about_ca_topic_score_codex":0.0000022267282,"about_ca_topic_score_gemma":0.00004254429,"teacher_disagreement_score":0.489275,"about_ca_system_score_codex":0.0006343819,"about_ca_system_score_gemma":0.00029770244,"threshold_uncertainty_score":0.9998503},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000081880404,0.0013540208,0.9725866,0.003028017,0.006127932,0.0003556569,8.136277e-7,0.00028922214,0.016175915],"genre_scores_gemma":[0.1146441,0.00052082527,0.788273,0.020951558,0.0037720508,0.000041389845,0.000009226125,0.00014179533,0.07164608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575996,0.000036238358,0.0005221392,0.0018652715,0.0010578681,0.00075849827],"domain_scores_gemma":[0.99690384,0.0004188279,0.0002332832,0.002112577,0.0001742604,0.00015721719],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00091155135,0.00056376983,0.00053952954,0.0011861176,0.00032159942,0.0017513055,0.005148069,0.00026825632,0.000011635634],"category_scores_gemma":[0.000053684766,0.00050496904,0.0001976141,0.00089276984,0.00044929617,0.00020422791,0.0044526826,0.0008202428,0.000060252627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018205279,0.00001882049,0.000004026856,0.000048486712,0.000014275351,0.00009755509,0.0004623867,0.080222994,0.0000070778215,0.028256783,0.00017882786,0.8906869],"study_design_scores_gemma":[0.00023108047,0.00009894843,0.000009447011,0.001562138,0.000010325564,0.000027209318,6.247369e-7,0.8745288,0.00027523885,0.109398045,0.013196289,0.00066180836],"about_ca_topic_score_codex":0.000013604784,"about_ca_topic_score_gemma":0.000026065165,"teacher_disagreement_score":0.89002514,"about_ca_system_score_codex":0.00031216338,"about_ca_system_score_gemma":0.00042171738,"threshold_uncertainty_score":0.9997402},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012991647,0.0033850076,0.9886011,0.0042243754,0.0010992433,0.00075319066,0.000012181789,0.0005804889,0.0012145053],"genre_scores_gemma":[0.46134278,0.0004713429,0.53590935,0.000642032,0.00012646684,0.00006168056,0.000009693593,0.000042667074,0.0013939715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966259,0.000082309954,0.00069352204,0.0014661558,0.00059534714,0.0005367469],"domain_scores_gemma":[0.99530375,0.0011170303,0.0004369204,0.0027198906,0.0003232599,0.00009915097],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00082256517,0.0005568359,0.0006582234,0.0010680091,0.00042297022,0.001171443,0.006228651,0.00048257658,0.000003940932],"category_scores_gemma":[0.00016844449,0.00052650186,0.0000841179,0.0006959416,0.0008614172,0.00087570393,0.006569588,0.0013664034,0.00003734521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075089238,0.00007138916,0.0006526116,0.00029947478,0.00009834626,0.00003665845,0.0040873615,0.02608874,0.00021507645,0.027763626,0.00018995053,0.94048923],"study_design_scores_gemma":[0.0004913664,0.00018206086,0.00038621962,0.0036295878,0.00003995362,0.00011678541,0.000018091096,0.9513474,0.0017364915,0.02541442,0.015390723,0.0012469055],"about_ca_topic_score_codex":0.00015894188,"about_ca_topic_score_gemma":0.000115662784,"teacher_disagreement_score":0.93924236,"about_ca_system_score_codex":0.000473802,"about_ca_system_score_gemma":0.00027527727,"threshold_uncertainty_score":0.9998654},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008151197,0.0015524919,0.96514076,0.00030144677,0.0057110786,0.0008248053,0.000002894624,0.0005379395,0.025920434],"genre_scores_gemma":[0.84742707,0.000047040758,0.14248796,0.0023611968,0.002218809,0.000035519613,0.000009288593,0.00008828941,0.0053248215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947309,0.000091751346,0.0006670188,0.0022964473,0.0012568812,0.0009569968],"domain_scores_gemma":[0.9961958,0.0007336036,0.00043388573,0.0018375979,0.0005899295,0.0002091905],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00110286,0.00075807446,0.0009053686,0.0012531242,0.0005037978,0.0013004078,0.0041297716,0.0004751533,0.0000050874064],"category_scores_gemma":[0.00024219629,0.00065495213,0.00023083309,0.0009818525,0.0005245726,0.00034175222,0.0015464437,0.0011401745,0.000109300025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039798606,0.00003547121,0.000050017672,0.00010104433,0.000027745877,0.00012282252,0.0014277361,0.017596815,0.0000031253385,0.7862288,0.000076125034,0.19432633],"study_design_scores_gemma":[0.00062637817,0.00062616874,0.00008421289,0.0010360508,0.000026164107,0.0002033638,0.000004632723,0.6102428,0.00014472926,0.3759236,0.00933978,0.0017421161],"about_ca_topic_score_codex":0.00023829866,"about_ca_topic_score_gemma":0.000046468555,"teacher_disagreement_score":0.8474189,"about_ca_system_score_codex":0.0010842896,"about_ca_system_score_gemma":0.00091187045,"threshold_uncertainty_score":0.9997363},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004711593,0.00016277887,0.99573284,0.0015341922,0.0003990914,0.00069957296,0.000030949686,0.00026731647,0.0011685281],"genre_scores_gemma":[0.012050945,0.0000720271,0.98547995,0.0014837658,0.0001433097,0.000073617906,0.000052858137,0.000014053523,0.0006294847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797153,0.000021163902,0.00040524013,0.0009992504,0.0002911242,0.00031168206],"domain_scores_gemma":[0.998017,0.0006913871,0.0002200429,0.00066045043,0.0003365575,0.00007453261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050889386,0.00028667215,0.00027473154,0.0006772864,0.00032261127,0.00038303985,0.0011210027,0.00017850731,0.000007875148],"category_scores_gemma":[0.00013481374,0.00028613675,0.000073139156,0.00036016104,0.00023716755,0.0003703438,0.00058177917,0.00025998178,0.00000292835],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051375573,0.00002164682,0.000016422908,0.000055855937,0.000011079862,0.0000016887202,0.00038239412,0.013444482,0.000082812716,0.09355983,0.0013936091,0.89102507],"study_design_scores_gemma":[0.00024423073,0.00008502064,0.000054495766,0.00021715907,0.000007313702,0.000007737735,1.2598086e-7,0.8250743,0.0010477036,0.1676684,0.005282132,0.00031138235],"about_ca_topic_score_codex":0.00001654721,"about_ca_topic_score_gemma":0.000030179823,"teacher_disagreement_score":0.89071363,"about_ca_system_score_codex":0.00016488881,"about_ca_system_score_gemma":0.00027568307,"threshold_uncertainty_score":0.99995905},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001958246,0.00041339753,0.995261,0.0005632227,0.0022034876,0.0007820002,0.00016469427,0.00030480418,0.000111576264],"genre_scores_gemma":[0.19132254,0.000048073438,0.80707216,0.00071390235,0.00032481013,0.000037459795,0.00009117109,0.000034718425,0.00035514252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995657,0.00006174159,0.0007473923,0.0020686227,0.0006677724,0.0007974302],"domain_scores_gemma":[0.99763787,0.00044610436,0.00024648357,0.0010515514,0.00033296846,0.00028500406],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009561021,0.00075132033,0.00072200753,0.00075047225,0.000440491,0.001191374,0.0019737862,0.00074593525,0.0000051785955],"category_scores_gemma":[0.00012746928,0.00066614704,0.00014960897,0.0005790627,0.0007210114,0.001789742,0.00033716825,0.0012851172,0.0000024489184],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010373212,0.0002128943,0.0014292805,0.0002808799,0.000070456204,0.00006566658,0.0023029281,0.019465776,0.00020610681,0.11097501,0.00008376584,0.8648035],"study_design_scores_gemma":[0.0004024133,0.0005123488,0.00011767083,0.0006993786,0.00001891683,0.000029971725,0.0000010757435,0.80341274,0.0005308036,0.19307965,0.0005623559,0.0006326755],"about_ca_topic_score_codex":0.00017076914,"about_ca_topic_score_gemma":0.00030235152,"teacher_disagreement_score":0.86417085,"about_ca_system_score_codex":0.00023941378,"about_ca_system_score_gemma":0.0013082991,"threshold_uncertainty_score":0.9998455},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010637546,0.0017636247,0.98294544,0.003299045,0.0044860807,0.00031159903,0.0000029124872,0.00011824887,0.0070623844],"genre_scores_gemma":[0.08369339,0.0007935735,0.87420505,0.029511629,0.0023843923,0.00007387679,0.00001650734,0.000072263116,0.009249336],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956198,0.00006530341,0.0007650113,0.0017676563,0.0009086729,0.00087358226],"domain_scores_gemma":[0.9977505,0.0005084113,0.00023559797,0.0011753133,0.00021592817,0.00011424999],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010942277,0.0005123304,0.00059557095,0.0014459032,0.0001587961,0.0008780781,0.0060870945,0.0003278301,0.000020830783],"category_scores_gemma":[0.00020085552,0.00047842375,0.00014157125,0.002000454,0.00055057264,0.0014221396,0.0021632465,0.0014071203,0.00006247309],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005541142,0.00004739674,0.000018166265,0.000063845655,0.0000028392597,0.00009933181,0.0005727091,0.039071076,0.000015327021,0.060537808,0.000251129,0.8993148],"study_design_scores_gemma":[0.000043939126,0.00009254312,0.00001305454,0.00086702895,0.0000022075394,0.000012266959,2.4697232e-7,0.47526076,0.00179615,0.512535,0.008926375,0.0004504686],"about_ca_topic_score_codex":0.00004178289,"about_ca_topic_score_gemma":0.0003619809,"teacher_disagreement_score":0.8988644,"about_ca_system_score_codex":0.0006038277,"about_ca_system_score_gemma":0.0016982004,"threshold_uncertainty_score":0.99976677},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007859229,0.00021428098,0.9967601,0.00008157525,0.0008492786,0.00035112796,0.000007897593,0.000033579858,0.0009162414],"genre_scores_gemma":[0.061379716,0.00001485717,0.9381623,0.00023071306,0.000086421394,0.00000543401,0.000006095561,0.00000908805,0.000105329964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975278,0.000062715844,0.00052503124,0.0008950737,0.00072944415,0.0002599741],"domain_scores_gemma":[0.9984322,0.00015202744,0.00030893044,0.000635113,0.0004103876,0.000061336636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010615189,0.00028805353,0.00033055898,0.00069051253,0.00018543843,0.00023710413,0.0011621501,0.00018506664,0.0000056814333],"category_scores_gemma":[0.00021692175,0.0002753647,0.000054680124,0.0004359335,0.0004878654,0.0010434358,0.00086150534,0.00037246512,9.202251e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013220425,0.000029095221,0.00007530371,0.00007949013,0.00002022836,0.000007440514,0.0012494951,0.044967398,0.014228315,0.30050862,0.000003417044,0.63881797],"study_design_scores_gemma":[0.00012598564,0.00007959608,0.00029262636,0.0005580829,0.000008664556,0.000017334822,3.0213516e-7,0.94312936,0.008601647,0.04689885,0.000059308073,0.00022825428],"about_ca_topic_score_codex":0.000021276683,"about_ca_topic_score_gemma":0.000010474565,"teacher_disagreement_score":0.89816195,"about_ca_system_score_codex":0.00023854323,"about_ca_system_score_gemma":0.00053418684,"threshold_uncertainty_score":0.99996984},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013521836,0.0009869187,0.9920611,0.0012550127,0.0020629463,0.0009432934,0.000011024809,0.0001126416,0.0012148742],"genre_scores_gemma":[0.6613089,0.000109229586,0.33482358,0.0017403612,0.00046936,0.000036794216,0.000012726077,0.000056111014,0.0014429378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943899,0.00014485982,0.0008796277,0.0023666732,0.0013853007,0.0008336176],"domain_scores_gemma":[0.9946574,0.0016615737,0.00022428756,0.003017663,0.0002064538,0.00023264135],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0037540249,0.0005120356,0.0006704089,0.0016412523,0.0001895113,0.0019239363,0.007984517,0.0002527176,0.000007900823],"category_scores_gemma":[0.0007947481,0.00049040426,0.000047888014,0.0011320317,0.00054703705,0.0011507754,0.007125532,0.0010884639,0.00008931979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073244646,0.000026624788,0.00013577468,0.00022248179,0.000013547176,0.00017262902,0.0037505063,0.16944818,0.0002966887,0.025054058,0.00007013185,0.80080205],"study_design_scores_gemma":[0.000065975444,0.000064925014,0.00021669384,0.0019279295,0.0000068575505,0.000042112344,0.0000017060411,0.9284091,0.00026640078,0.06781603,0.0007034328,0.00047881858],"about_ca_topic_score_codex":0.00032169733,"about_ca_topic_score_gemma":0.00057090353,"teacher_disagreement_score":0.80032325,"about_ca_system_score_codex":0.0003339227,"about_ca_system_score_gemma":0.00076907105,"threshold_uncertainty_score":0.9997548},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006198961,0.0002506022,0.99246645,0.0018871675,0.003542818,0.0009348746,0.00008415233,0.000057757698,0.00076999207],"genre_scores_gemma":[0.022404743,0.00003229184,0.97448957,0.001099123,0.0013424305,0.00011739646,0.0002099186,0.000024466919,0.0002800337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965428,0.000097786855,0.00047816723,0.0019784905,0.00047289033,0.00042987074],"domain_scores_gemma":[0.9945528,0.002659816,0.00034439575,0.001991222,0.00033384323,0.00011796022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011478033,0.00038696986,0.00053784274,0.00051713234,0.000533191,0.00032551662,0.0035072335,0.00030526565,0.000009790751],"category_scores_gemma":[0.00046036777,0.00038584977,0.00006593518,0.00040641727,0.0010309094,0.00051198556,0.0021443514,0.00046324977,0.0000019608117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061095096,0.000094120776,0.000005589017,0.00009489111,0.000108850014,0.000017843851,0.017007519,0.003442412,0.0020225502,0.13186136,0.0007425904,0.8445412],"study_design_scores_gemma":[0.00097417174,0.00025070872,0.000008223798,0.00023179568,0.000039448816,0.000025647734,0.000010945179,0.8679657,0.0050045145,0.11412049,0.01078059,0.00058777013],"about_ca_topic_score_codex":0.00011252489,"about_ca_topic_score_gemma":0.00020527343,"teacher_disagreement_score":0.8645233,"about_ca_system_score_codex":0.00016107173,"about_ca_system_score_gemma":0.00079030736,"threshold_uncertainty_score":0.99985933},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047200258,0.00043141493,0.9940604,0.0031644946,0.00085576525,0.0012761361,0.00003823041,0.000034987555,0.000091344984],"genre_scores_gemma":[0.017897885,0.00001730376,0.980863,0.0008321627,0.00014031219,0.00010278951,0.000005581972,0.00001708968,0.00012392028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979273,0.000022838178,0.00042275168,0.0009508561,0.0003495617,0.00032666203],"domain_scores_gemma":[0.99724656,0.0011251938,0.0003496697,0.00077589566,0.00044297313,0.000059683014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048073518,0.00030196685,0.00041041523,0.0004786733,0.0003885534,0.0000918363,0.0014748179,0.0001719465,6.3978916e-7],"category_scores_gemma":[0.00014766573,0.00023990733,0.00014874032,0.00090855366,0.00053662463,0.00018336726,0.0006796332,0.00027293747,1.8520308e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034620698,0.000097794466,0.00007579056,0.0005292913,0.00012382428,0.0000015313497,0.0060462314,0.02877481,0.0011163501,0.43271035,0.00035175894,0.53013766],"study_design_scores_gemma":[0.0003907515,0.000105675244,0.00008877302,0.0006558654,0.000030158144,0.000010397988,0.0000010186818,0.81645155,0.0017399039,0.17340614,0.0067251,0.00039465114],"about_ca_topic_score_codex":0.000025574554,"about_ca_topic_score_gemma":0.000082855026,"teacher_disagreement_score":0.78767675,"about_ca_system_score_codex":0.0005264261,"about_ca_system_score_gemma":0.00068102946,"threshold_uncertainty_score":0.97831374},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025251196,0.0002708428,0.9964063,0.00089547934,0.00048241107,0.0010998355,0.000024144203,0.00020047578,0.00036795664],"genre_scores_gemma":[0.653852,0.000005452391,0.3453501,0.0005726821,0.000097340875,0.00006848348,0.00001965195,0.000020345884,0.000013981214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965616,0.000043874734,0.0009159418,0.0014269552,0.0005439374,0.0005076843],"domain_scores_gemma":[0.99600977,0.0013257763,0.00079616596,0.0012044649,0.00054687884,0.000116921045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014650568,0.000406052,0.00051228376,0.0010705963,0.00055118394,0.00046651746,0.001843029,0.00017825846,0.0000016492496],"category_scores_gemma":[0.00016420652,0.00043763575,0.00012655927,0.0008194242,0.00031854495,0.0003547917,0.0004103972,0.0003634447,0.0000016986484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013420804,0.00005167414,0.0006757141,0.00092729856,0.000022221326,0.0000028596264,0.00057371036,0.070466526,0.0019014056,0.12411809,0.0000077682225,0.8012393],"study_design_scores_gemma":[0.0004645431,0.000079568905,0.00036546672,0.0014182874,0.000019921421,0.0000079623605,0.000001061902,0.9583941,0.0054316707,0.033037335,0.00038721657,0.00039284353],"about_ca_topic_score_codex":0.000030304856,"about_ca_topic_score_gemma":0.000021741518,"teacher_disagreement_score":0.8879276,"about_ca_system_score_codex":0.0003901435,"about_ca_system_score_gemma":0.00076743256,"threshold_uncertainty_score":0.99980754},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001344657,0.00057729497,0.99082214,0.00071927527,0.0018729758,0.0004718698,0.000028740924,0.00015729225,0.0052159596],"genre_scores_gemma":[0.066589005,0.0001752939,0.9275976,0.0044160625,0.00070925,0.000026381365,0.000040371808,0.000040810522,0.00040526595],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564177,0.000046842077,0.00062271766,0.0019612126,0.0009345157,0.0007929534],"domain_scores_gemma":[0.99696976,0.00046392676,0.00020614799,0.0020197004,0.00018415318,0.00015633977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00103769,0.00056907395,0.0005970827,0.0016031882,0.00019006048,0.0005461423,0.0045520226,0.00043202064,0.000023805027],"category_scores_gemma":[0.000114637056,0.0005373579,0.00017023053,0.001658696,0.00063575135,0.001003087,0.0024058523,0.001308013,0.000028249186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023417091,0.00014950181,0.00050876447,0.00016316473,0.000020384636,0.00031974868,0.0013291213,0.0052638156,0.000058578073,0.3893616,0.00027902986,0.60252285],"study_design_scores_gemma":[0.000594291,0.00022301912,0.0006654521,0.0007934359,0.000009118322,0.000033487257,2.6266898e-7,0.4217842,0.00043799682,0.5533381,0.020992624,0.0011279816],"about_ca_topic_score_codex":0.000118051124,"about_ca_topic_score_gemma":0.00067930133,"teacher_disagreement_score":0.6013949,"about_ca_system_score_codex":0.00027756664,"about_ca_system_score_gemma":0.00088935316,"threshold_uncertainty_score":0.9997078},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042306514,0.0008603969,0.98691773,0.0023478186,0.0029430499,0.0004496617,0.00016991899,0.0002879708,0.0059811133],"genre_scores_gemma":[0.08487606,0.00026003295,0.8901083,0.022577886,0.0012446247,0.00004710979,0.00017474258,0.000077031036,0.0006342274],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954065,0.00005172853,0.0006913592,0.0020488643,0.0009995392,0.00080198323],"domain_scores_gemma":[0.99572414,0.00088783324,0.000322446,0.0023661877,0.00048477715,0.00021463385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086502294,0.00064479857,0.00067853415,0.0014017314,0.0007390164,0.0009531058,0.0043755607,0.00034734065,0.00007741938],"category_scores_gemma":[0.00014637472,0.00061368966,0.00032855035,0.0014600299,0.0007870435,0.00088765007,0.0023279176,0.001154786,0.000091428556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002835117,0.00009405759,0.00011905231,0.0001826273,0.00005714399,0.0000832668,0.0018183362,0.0016733103,0.00024896846,0.34130287,0.0016882009,0.6527038],"study_design_scores_gemma":[0.00078001426,0.00022649152,0.00017053756,0.00070783886,0.000031438438,0.000060696293,8.808684e-7,0.47599736,0.00023037271,0.4989644,0.021655181,0.0011747703],"about_ca_topic_score_codex":0.0001009987,"about_ca_topic_score_gemma":0.00011849642,"teacher_disagreement_score":0.651529,"about_ca_system_score_codex":0.00015880415,"about_ca_system_score_gemma":0.00073966477,"threshold_uncertainty_score":0.99963146},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017202877,0.00006954751,0.99228215,0.00003708384,0.00016215802,0.0005591657,0.000005206501,0.00009290987,0.0050714775],"genre_scores_gemma":[0.8532731,0.0000010612642,0.14522864,0.00010309187,0.0005938183,0.000028225657,0.0000061810456,0.00002805133,0.0007378151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976811,0.00002753952,0.0003821555,0.0010402936,0.00046437792,0.0004045449],"domain_scores_gemma":[0.9983985,0.0002571025,0.00019560823,0.00088240916,0.00018468205,0.00008173054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004291095,0.00044158322,0.00055653456,0.00056566694,0.00025862324,0.0002469492,0.000743524,0.00007358124,0.000092903865],"category_scores_gemma":[0.000004284308,0.0003635776,0.0001117247,0.00057632715,0.0002728615,0.00012387693,0.0005798891,0.00064546877,0.0000048349657],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066122775,0.00014057974,0.0015600541,0.000017250297,0.00013433848,0.0017041045,0.0013183503,0.006852945,0.000013863617,0.002054308,0.000029525463,0.9861681],"study_design_scores_gemma":[0.002537928,0.0026472013,0.00015035472,0.0040299348,0.0009297125,0.0012220324,0.00009940284,0.7135988,0.004953207,0.259942,0.0042337417,0.0056556845],"about_ca_topic_score_codex":0.0007268021,"about_ca_topic_score_gemma":0.0011316998,"teacher_disagreement_score":0.9805124,"about_ca_system_score_codex":0.00012552468,"about_ca_system_score_gemma":0.00035332493,"threshold_uncertainty_score":0.9998816},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018002339,0.0011696973,0.99256605,0.0003844982,0.0036567207,0.0009533026,0.000022673456,0.00017498138,0.000892082],"genre_scores_gemma":[0.068352886,0.00017515104,0.9278132,0.0018780999,0.00078670145,0.00007207203,0.000029376053,0.000048628062,0.00084392726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963546,0.000043749533,0.00062979123,0.0015653174,0.00075361115,0.00065293966],"domain_scores_gemma":[0.99691737,0.0011388181,0.0003032241,0.0011919725,0.00029203197,0.00015661228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082757574,0.0005677422,0.0006264782,0.0012576137,0.0004766923,0.0005707925,0.0022120108,0.00045859336,0.000012405573],"category_scores_gemma":[0.00015214518,0.00048764795,0.0003609026,0.0009117151,0.0005405035,0.00053632905,0.00069440383,0.0005852862,0.000010659463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058586476,0.000086800144,0.00042739627,0.00018353062,0.00006439758,0.000038997914,0.0009189155,0.053500913,0.00014367925,0.10467395,0.0007364083,0.8391664],"study_design_scores_gemma":[0.0014798058,0.00013999848,0.00030253592,0.0003670215,0.000032401458,0.000016898013,1.5702595e-7,0.8234211,0.0012984201,0.16640295,0.0058164764,0.0007221902],"about_ca_topic_score_codex":0.000021960312,"about_ca_topic_score_gemma":0.00005885813,"teacher_disagreement_score":0.83844423,"about_ca_system_score_codex":0.00016307538,"about_ca_system_score_gemma":0.00055681926,"threshold_uncertainty_score":0.9997575},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004848682,0.0035787679,0.98968184,0.0007643857,0.0028747472,0.00043959526,0.00016556034,0.00028977668,0.0021568278],"genre_scores_gemma":[0.0751605,0.00062694977,0.91641235,0.0062384475,0.001053072,0.00002514163,0.00025934153,0.000054819044,0.00016936344],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99492437,0.00006913763,0.00066265964,0.0023392327,0.0011810738,0.00082350714],"domain_scores_gemma":[0.9953362,0.0014556606,0.0003041919,0.0023953635,0.00026748292,0.00024113002],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007396153,0.00077160797,0.0008190439,0.0011788611,0.00039026004,0.0010152834,0.005879192,0.00053999823,0.0000832701],"category_scores_gemma":[0.00009633426,0.00068846147,0.00029158295,0.0011272457,0.0008777987,0.0009160432,0.0024839323,0.001413965,0.000041881667],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004557605,0.00008577779,0.00007585652,0.000079839614,0.00006500489,0.0002063243,0.0011527915,0.011121332,0.00018361805,0.07866353,0.00094416196,0.90737617],"study_design_scores_gemma":[0.00053982984,0.00009367355,0.00007301232,0.00037239233,0.000017818107,0.000009347399,1.5646565e-7,0.31259063,0.0010372518,0.67638993,0.008113709,0.000762282],"about_ca_topic_score_codex":0.00030174747,"about_ca_topic_score_gemma":0.0004410347,"teacher_disagreement_score":0.9066139,"about_ca_system_score_codex":0.00015415814,"about_ca_system_score_gemma":0.00053441414,"threshold_uncertainty_score":0.99955666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001213253,0.00008008265,0.9862752,0.00075957546,0.0008427187,0.0005296136,0.000028147162,0.00005405801,0.010217339],"genre_scores_gemma":[0.63186693,0.00001403073,0.3632394,0.0020487187,0.0005526038,0.00004173016,0.00001963568,0.000043022952,0.0021739134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644417,0.000045411358,0.0005999713,0.0015271796,0.00092870137,0.00045455573],"domain_scores_gemma":[0.99582845,0.0020868513,0.0004301962,0.0010103317,0.00051235734,0.00013180228],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0089288,0.00033302192,0.00046543046,0.0009327867,0.0006960767,0.0020680695,0.0025888311,0.00011493684,0.000037794194],"category_scores_gemma":[0.00078600855,0.00022741596,0.000043913646,0.00060024613,0.0016975914,0.0010756574,0.0011551087,0.00024950068,0.00006284516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017819833,0.0000076270094,0.00006911441,0.000050876886,0.0000050205776,0.0000013312861,0.001423895,0.0060092905,0.000028045342,0.3585242,0.000049065668,0.63381374],"study_design_scores_gemma":[0.00026190982,0.0001730983,0.00013392048,0.00020708634,0.000010283908,0.000015314674,0.000012124843,0.5380396,0.00041937546,0.44708008,0.013271267,0.00037593022],"about_ca_topic_score_codex":0.000069073736,"about_ca_topic_score_gemma":0.0027681137,"teacher_disagreement_score":0.63343775,"about_ca_system_score_codex":0.00023336224,"about_ca_system_score_gemma":0.00074983423,"threshold_uncertainty_score":0.9989679},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000062927465,0.00033703956,0.98666906,0.00049218,0.004086447,0.0007334231,0.000013180895,0.00008134724,0.007524381],"genre_scores_gemma":[0.20273681,0.000036918467,0.7898891,0.0038852936,0.001298981,0.00004006772,0.000016075226,0.00009916171,0.0019976052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577504,0.000053218515,0.0005949956,0.001984825,0.0006517313,0.00094015687],"domain_scores_gemma":[0.9969472,0.0006245454,0.00040150792,0.0013870434,0.0004410172,0.00019867098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001004122,0.00070771633,0.0006787895,0.0009092129,0.00045605344,0.000566434,0.003949145,0.00035845046,0.000042650125],"category_scores_gemma":[0.00008053733,0.00064066093,0.0003202024,0.00028801037,0.00056330406,0.0014762434,0.0017131746,0.0011507823,0.00014050512],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009611518,0.00016025867,0.000021761114,0.00015025184,0.0000727045,0.00010229991,0.005801773,0.0070137596,0.0056945886,0.10670024,0.00189238,0.8722939],"study_design_scores_gemma":[0.0011749793,0.0022859946,0.00016024319,0.002205741,0.000035101617,0.00020847532,0.000001389288,0.7470794,0.025618745,0.18625075,0.032690767,0.0022884505],"about_ca_topic_score_codex":0.000031177537,"about_ca_topic_score_gemma":0.00002323091,"teacher_disagreement_score":0.8700054,"about_ca_system_score_codex":0.00038353764,"about_ca_system_score_gemma":0.00033608504,"threshold_uncertainty_score":0.99960446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005239795,0.0006433761,0.9897511,0.0010268886,0.00041376337,0.00031463912,0.000027888549,0.0000720722,0.002510492],"genre_scores_gemma":[0.69511485,0.00022222391,0.30310237,0.0011707841,0.00014373545,0.0000091861675,0.000005506524,0.00002876406,0.00020256342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974785,0.000071404116,0.0004434836,0.0009874183,0.00061061466,0.00040857386],"domain_scores_gemma":[0.9972765,0.0009855098,0.00036249668,0.0010973787,0.00015856668,0.00011959063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080331654,0.0004016255,0.0004954438,0.0006022629,0.00057590456,0.00034505475,0.0017783402,0.00015626856,0.000021480648],"category_scores_gemma":[0.000078597805,0.0002887723,0.00009052063,0.0005912043,0.0018563657,0.0004213088,0.0014828611,0.0006664975,0.0000036893405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008458447,0.00004613047,0.0002624226,0.00006520964,0.000046275512,0.000019607869,0.003806743,0.002060079,0.00018559795,0.8651362,0.00003181708,0.12833142],"study_design_scores_gemma":[0.00014708424,0.00016745288,0.0021173987,0.00040396463,0.00001775079,0.00005599054,0.000002528698,0.07826391,0.0012843178,0.9167455,0.0003660897,0.00042801004],"about_ca_topic_score_codex":0.0003081785,"about_ca_topic_score_gemma":0.00024866045,"teacher_disagreement_score":0.68987507,"about_ca_system_score_codex":0.000049757175,"about_ca_system_score_gemma":0.00016301357,"threshold_uncertainty_score":0.9999564},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013173791,0.00074956514,0.95814645,0.0055193165,0.0026770486,0.0017425767,0.0000015565176,0.00043561903,0.017554052],"genre_scores_gemma":[0.9736656,0.000013461938,0.022126628,0.0022491883,0.0002463311,0.00012401711,0.0000024777585,0.000029719396,0.0015425558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576074,0.00014313693,0.00072986056,0.0018111136,0.0009552497,0.00059991475],"domain_scores_gemma":[0.99553907,0.0012136787,0.00063867436,0.0019058794,0.00059863186,0.00010409027],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012231129,0.0005973371,0.0006184858,0.000903612,0.00080604,0.00094032363,0.0033718375,0.00033852112,0.00004829225],"category_scores_gemma":[0.0008481166,0.00043502756,0.00009923937,0.0008197755,0.003537588,0.0012325449,0.0016300777,0.0015733778,0.00077750365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023865276,0.000016103457,0.00008592274,0.00003640008,0.000016973625,0.000056734592,0.004832793,0.00013669007,0.00015965012,0.91980946,0.000042156662,0.074783236],"study_design_scores_gemma":[0.002018531,0.00059414643,0.0012499777,0.002280785,0.00003106582,0.0047583207,0.000040930117,0.16321068,0.005606935,0.8126067,0.0057951,0.0018068744],"about_ca_topic_score_codex":0.00042954274,"about_ca_topic_score_gemma":0.00004717138,"teacher_disagreement_score":0.96049184,"about_ca_system_score_codex":0.00043336514,"about_ca_system_score_gemma":0.0004146596,"threshold_uncertainty_score":0.99981016},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010678091,0.00031130074,0.9862556,0.0041503566,0.0021521396,0.0004027081,0.000004489889,0.00015677068,0.0065559642],"genre_scores_gemma":[0.04297308,0.000034470217,0.9515081,0.0029246013,0.0018289936,0.00001289951,0.0000036046763,0.000040098843,0.0006741677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99581677,0.000086579224,0.0005966004,0.0014970878,0.0009918804,0.0010110606],"domain_scores_gemma":[0.9968694,0.0008121944,0.00025325903,0.0013263146,0.00029553974,0.00044329822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010012455,0.0005890717,0.0006141935,0.0007608515,0.00033067312,0.00069122505,0.0023858713,0.00029319146,0.000040138355],"category_scores_gemma":[0.0005715084,0.00051205634,0.00014942387,0.0008750447,0.0003441351,0.0010072896,0.0015840898,0.0007959654,0.000120708064],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009352327,0.000033390068,0.000023827186,0.00001086646,0.000020546533,0.00011724772,0.0012984982,0.031321272,0.00042063458,0.011931827,0.0019729855,0.95283955],"study_design_scores_gemma":[0.00036551355,0.00032893257,0.00038422784,0.00039569096,0.000031584575,0.00022757624,6.357959e-7,0.89001286,0.0014096558,0.029257001,0.07602128,0.0015650566],"about_ca_topic_score_codex":0.000036777852,"about_ca_topic_score_gemma":0.00007571177,"teacher_disagreement_score":0.9512745,"about_ca_system_score_codex":0.00023156007,"about_ca_system_score_gemma":0.0006803909,"threshold_uncertainty_score":0.9997331},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3280659,0.00014634269,0.6707568,0.000021878684,0.00074615533,0.000112518144,7.8562346e-7,0.00012322699,0.000026372907],"genre_scores_gemma":[0.88271266,0.000015656653,0.11706075,0.00014231213,0.000045279838,0.000007815096,0.0000010162804,0.000014180127,2.9757385e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880457,0.000012784124,0.00019077444,0.00030479513,0.00021624545,0.00047081575],"domain_scores_gemma":[0.99960417,0.00005591754,0.000024036812,0.00023234362,0.000016573305,0.00006694752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002736702,0.00016760391,0.00015168665,0.00013838765,0.00013402026,0.00007487754,0.0003191829,0.000030503146,0.000007931918],"category_scores_gemma":[0.000010373601,0.00014689888,0.0000440234,0.00051614514,0.00007706329,0.00043275117,0.000052400337,0.00019932818,0.0000051838892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022089658,0.000036359896,0.012047068,0.00004450453,0.00001669213,0.00010644646,0.008674706,0.39714542,0.032138705,0.00007529984,0.0000021332157,0.54969054],"study_design_scores_gemma":[0.0007329324,0.000096367636,0.007703537,0.00016305647,0.0000061539604,0.000047699734,0.000009272112,0.85497856,0.13208373,0.0036444766,0.00006618243,0.0004680361],"about_ca_topic_score_codex":0.000013574141,"about_ca_topic_score_gemma":0.0000443018,"teacher_disagreement_score":0.5546468,"about_ca_system_score_codex":0.00006540595,"about_ca_system_score_gemma":0.000025727917,"threshold_uncertainty_score":0.5990362},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018035802,0.0035629077,0.9888946,0.0042395475,0.0011473193,0.0011960776,0.00025728598,0.00043247573,0.00025177884],"genre_scores_gemma":[0.0252579,0.0002417738,0.9698522,0.0035983382,0.0003647359,0.00046186429,0.00007489609,0.000046098416,0.00010218424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683297,0.000060477974,0.00056494365,0.0012894858,0.00069243263,0.00055969425],"domain_scores_gemma":[0.99552,0.0018922241,0.00035482156,0.0018188466,0.0003366253,0.00007749045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011769045,0.00046442897,0.0005496215,0.00062082073,0.00037893525,0.00049912283,0.0037878468,0.00029866231,0.000006663504],"category_scores_gemma":[0.00030683354,0.00034552815,0.00011550362,0.000665476,0.00037371012,0.00051449717,0.0008833089,0.00063982216,0.0000072613434],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023399916,0.000078105964,0.0002687589,0.00019489451,0.000056826004,0.000035592537,0.0019262107,0.039869502,0.0006921597,0.047038615,0.015343511,0.8944724],"study_design_scores_gemma":[0.00062795734,0.0012470548,0.0000143942925,0.009359255,0.00004862698,0.00008539628,0.00001214106,0.43742716,0.106275894,0.22644857,0.21611483,0.0023387265],"about_ca_topic_score_codex":0.00040857866,"about_ca_topic_score_gemma":0.00011606123,"teacher_disagreement_score":0.8921337,"about_ca_system_score_codex":0.00019713108,"about_ca_system_score_gemma":0.00043084455,"threshold_uncertainty_score":0.9998997},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007744059,0.000026786343,0.98834854,0.00021555585,0.0011676265,0.00076299545,0.000001644045,0.00023696052,0.0014958484],"genre_scores_gemma":[0.91140103,0.0000034183165,0.08707627,0.0009869841,0.0002680171,0.0000068780096,0.0000051357797,0.00001987959,0.00023238781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601597,0.000052580486,0.0008855931,0.00075260934,0.0016338802,0.0006593781],"domain_scores_gemma":[0.9971483,0.00030960544,0.0004149821,0.0013042636,0.0005710205,0.0002518643],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022943825,0.00048379824,0.00047691687,0.001594006,0.0006162874,0.0016648347,0.0024175139,0.00025322262,0.000020749974],"category_scores_gemma":[0.00021971774,0.00043956708,0.0001246633,0.0009938681,0.0003241249,0.0023453403,0.0016741959,0.0010005935,0.00014772853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014794191,0.000040491588,0.00018027275,0.00007881864,0.000012244861,0.0010794749,0.018621588,0.011576724,0.000022258047,0.005203297,0.000017408092,0.96315265],"study_design_scores_gemma":[0.00084790454,0.00075098587,0.00017646336,0.00024094692,0.000017496292,0.0025881024,0.000012176187,0.98281014,0.00061402965,0.008189458,0.002666482,0.0010857896],"about_ca_topic_score_codex":0.00015854977,"about_ca_topic_score_gemma":0.000060816696,"teacher_disagreement_score":0.9712334,"about_ca_system_score_codex":0.00043117907,"about_ca_system_score_gemma":0.0005267911,"threshold_uncertainty_score":0.9998056},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52130437,0.000056793484,0.47816703,0.00007126541,0.000026456797,0.0003604244,0.0000010833321,0.0000058183236,0.0000067602473],"genre_scores_gemma":[0.9280325,0.000005701277,0.07175112,0.00016146079,0.000014868469,0.000025863555,0.0000042267525,0.000004004869,2.2927097e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992176,0.000017177195,0.00011281053,0.00024250026,0.00024998473,0.00015991925],"domain_scores_gemma":[0.99945736,0.00014223673,0.000050513787,0.00010925918,0.00014635002,0.00009426932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016432462,0.000066364715,0.000085674765,0.00013895666,0.000058699028,0.000016557751,0.00006246768,0.000014713965,0.0000048358124],"category_scores_gemma":[0.000070671005,0.000048214122,0.0000138613905,0.000240339,0.00022872009,0.000094630006,0.000032114873,0.000048210368,3.5748818e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031349674,0.00014195472,0.12248488,0.000044941167,0.000010452722,0.000013342756,0.0013443028,0.00019624051,0.0048121586,0.00002052571,5.580665e-7,0.87061715],"study_design_scores_gemma":[0.0016023597,0.0027745634,0.40854108,0.00021282116,0.00009374409,0.000024060686,0.00003276371,0.42076993,0.16167477,0.004114031,0.000004646453,0.0001552318],"about_ca_topic_score_codex":0.000009036673,"about_ca_topic_score_gemma":0.0000055764394,"teacher_disagreement_score":0.87046194,"about_ca_system_score_codex":0.000025457859,"about_ca_system_score_gemma":0.00009484933,"threshold_uncertainty_score":0.1966115},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008859826,0.00014535738,0.99773425,0.000039895032,0.00044077664,0.00045352196,0.0000080521295,0.00008703139,0.00100251],"genre_scores_gemma":[0.262814,0.000063827116,0.73586655,0.00012710382,0.00020401776,0.000059581722,0.00014579459,0.000067205154,0.0006519384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988431,0.0000058544297,0.00034593086,0.00032102547,0.00026648544,0.00021764541],"domain_scores_gemma":[0.9992273,0.00012354816,0.00011528459,0.00030267914,0.00017945019,0.000051776507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027028774,0.0002043714,0.00036483514,0.0008252823,0.000051677387,0.00011936399,0.00031967,0.00015092886,0.000044810615],"category_scores_gemma":[0.000020675205,0.00018887152,0.00012273435,0.0006470492,0.00015608565,0.0001354523,0.00004091073,0.0001469517,0.000006531956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.6707673e-7,0.000005351553,0.000019529154,0.000058484162,0.00005399732,2.6567477e-7,0.00029586733,0.6971363,0.00003159936,0.00057175674,0.000006357209,0.30181986],"study_design_scores_gemma":[0.00010577132,0.000052725907,0.00003730244,0.000120152705,0.000094013354,6.2587895e-7,1.2891503e-7,0.99439096,0.00043356186,0.00401621,0.00054311584,0.00020544237],"about_ca_topic_score_codex":0.000008362488,"about_ca_topic_score_gemma":0.000062256055,"teacher_disagreement_score":0.3016144,"about_ca_system_score_codex":0.00007316088,"about_ca_system_score_gemma":0.00003707218,"threshold_uncertainty_score":0.77019566},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013081601,0.00042034182,0.9939617,0.00010019696,0.00048144316,0.00012947466,0.0000019790905,0.00012725392,0.0034694294],"genre_scores_gemma":[0.81753993,0.000031934178,0.18175384,0.00011450018,0.00013917772,0.000002220261,0.0000024684534,0.000025829715,0.00039006464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975578,0.00006193363,0.0005462533,0.0007464877,0.00071398605,0.00037351067],"domain_scores_gemma":[0.99780744,0.00045622472,0.00059910066,0.0008663725,0.00018785005,0.00008300837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072926626,0.00034079637,0.00060056394,0.00068806217,0.000085399355,0.00008377657,0.0023818645,0.00018518837,0.00007109039],"category_scores_gemma":[0.00014214814,0.000293443,0.00013546742,0.00039288815,0.0004934352,0.00024046731,0.00088399503,0.0007372422,0.00001471735],"study_design_candidate":"design_other","study_design_consensus":null,"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.524606e-7,0.000022921527,0.00091586687,0.00014604919,0.000011787621,0.000028957718,0.001506121,0.005286063,0.00015252695,0.0038702318,0.0000028726731,0.98805577],"study_design_scores_gemma":[0.00023531303,0.00044451648,0.0016613193,0.0010640887,0.000014094409,0.000051153045,7.5429534e-7,0.96433717,0.005512765,0.025850728,0.00027558222,0.0005525197],"about_ca_topic_score_codex":0.00014868248,"about_ca_topic_score_gemma":0.000019369161,"teacher_disagreement_score":0.98750323,"about_ca_system_score_codex":0.000045139743,"about_ca_system_score_gemma":0.00024481796,"threshold_uncertainty_score":0.9999518},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013447773,0.00013794928,0.9984808,0.0002999049,0.00014703207,0.00038135375,0.0000027254644,0.00024824054,0.00016753668],"genre_scores_gemma":[0.39628944,0.000029096918,0.6035399,0.000074131494,0.000025881187,0.000011768732,0.000003863808,0.000012795165,0.000013113072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981526,0.000017633061,0.0004301055,0.0006535713,0.0005328276,0.0002132301],"domain_scores_gemma":[0.99855286,0.000056136654,0.00022274414,0.0008790514,0.0002281397,0.00006108083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000554817,0.0002725215,0.00029781467,0.0006829234,0.000078120735,0.00012424543,0.0011255589,0.00019577438,8.743611e-7],"category_scores_gemma":[0.000009474655,0.00025196787,0.000056600416,0.00026686297,0.00036481823,0.00040951246,0.000120972974,0.00026918808,0.0000015421225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037609875,0.000009216831,0.000005112602,0.00010923927,0.0000023149241,3.8299353e-7,0.0006199767,0.3870724,0.0016378555,0.16905141,0.0000022195577,0.4414861],"study_design_scores_gemma":[0.00009473095,0.00006919649,0.000038290946,0.00027754568,0.0000039060155,0.0000036754107,1.687576e-8,0.94353914,0.016519375,0.038876615,0.00032719894,0.0002502883],"about_ca_topic_score_codex":0.0000062354798,"about_ca_topic_score_gemma":0.000007075201,"teacher_disagreement_score":0.55646676,"about_ca_system_score_codex":0.00010213618,"about_ca_system_score_gemma":0.00016921264,"threshold_uncertainty_score":0.99999326},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042224186,0.0001378885,0.9944678,0.00017002036,0.0025561277,0.0014661562,0.00006892063,0.00031824512,0.00077264226],"genre_scores_gemma":[0.01597733,0.000018070807,0.9823392,0.0006392581,0.00072464906,0.00009894666,0.000045820616,0.000052363648,0.00010433222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533284,0.000059196234,0.00063734566,0.0023202575,0.0007097209,0.00094062515],"domain_scores_gemma":[0.9960467,0.0005851456,0.00043712588,0.002172562,0.00046401244,0.00029446138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015539413,0.0007264376,0.00071718317,0.00096109934,0.0005324445,0.0007469219,0.0045424267,0.00046974004,0.00002062157],"category_scores_gemma":[0.00007885341,0.0007124551,0.00027156575,0.0006584144,0.0007946939,0.0015461367,0.0008542979,0.00076173584,0.00001592947],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072552425,0.000086045715,0.00000521803,0.00003157696,0.000012851856,0.000010390411,0.0006568752,0.00045944104,0.0001367619,0.021846171,0.000010259908,0.97673714],"study_design_scores_gemma":[0.00033508282,0.00034316248,0.000048165817,0.00008067766,0.0000088199995,0.000032914166,1.7790691e-7,0.6555316,0.0017070328,0.34064096,0.0006556327,0.00061579084],"about_ca_topic_score_codex":0.00005631997,"about_ca_topic_score_gemma":0.0001321137,"teacher_disagreement_score":0.97612137,"about_ca_system_score_codex":0.00025044597,"about_ca_system_score_gemma":0.00053519726,"threshold_uncertainty_score":0.99953264},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030529345,0.0012593126,0.99365395,0.00035788264,0.00091687863,0.0002790412,0.000007761523,0.00011788603,0.003101972],"genre_scores_gemma":[0.4059194,0.00060697045,0.588439,0.0033557208,0.00065960945,0.000040711755,0.000061271436,0.00007437915,0.00084297266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964131,0.000054206284,0.00058406586,0.0012606594,0.0009495415,0.0007384356],"domain_scores_gemma":[0.9981576,0.00027461923,0.00026561395,0.0009009993,0.00017634917,0.0002248047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093412586,0.00046057405,0.0005170834,0.0023558713,0.00013646364,0.0004056935,0.0019033307,0.000311175,0.00017039363],"category_scores_gemma":[0.00010877901,0.00044901078,0.00015468786,0.0016819508,0.00027626523,0.001097895,0.0007878901,0.00070050126,0.0006654888],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023703249,0.00006215286,0.000089583424,0.000015451296,0.000009561391,0.000040760926,0.00063445297,0.0016962262,0.00017535563,0.00046397626,0.000015483158,0.99679464],"study_design_scores_gemma":[0.0013718634,0.00028369986,0.00044858383,0.00131734,0.00004145446,0.00012664813,0.0000029765379,0.81682485,0.030453596,0.14108321,0.0050602513,0.0029855482],"about_ca_topic_score_codex":0.00003503353,"about_ca_topic_score_gemma":0.00004859771,"teacher_disagreement_score":0.9938091,"about_ca_system_score_codex":0.00037823262,"about_ca_system_score_gemma":0.00020516774,"threshold_uncertainty_score":0.99979615},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019111076,0.00063378643,0.99497044,0.00038423852,0.0009266871,0.00037658255,0.0000029386013,0.00041722038,0.00037701963],"genre_scores_gemma":[0.41396272,0.000052626176,0.58542573,0.0003108729,0.00009964237,0.000009713599,7.167274e-7,0.000022840415,0.00011514769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586767,0.00006187915,0.00058264466,0.0019770213,0.0006161576,0.00089462224],"domain_scores_gemma":[0.9974039,0.00034201617,0.0003498557,0.0015179081,0.00016498876,0.00022133016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073758146,0.00062094524,0.00070072815,0.00085799856,0.00049364625,0.00047373274,0.0030823525,0.00067638437,0.000012340322],"category_scores_gemma":[0.00017516284,0.0005416249,0.000110417044,0.00044953724,0.0014922122,0.00056211906,0.0047223014,0.0014606082,0.000005698306],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015082634,0.000076145516,0.0009729504,0.00005514916,0.000022277487,0.00007776954,0.0005917844,0.00074094266,0.0036675825,0.012595807,0.000004360862,0.98118013],"study_design_scores_gemma":[0.00044514405,0.00024335845,0.00044334406,0.0004184823,0.000007988027,0.000104923536,8.4084957e-7,0.87962896,0.0034682131,0.11436064,0.00019644097,0.00068165956],"about_ca_topic_score_codex":0.00015050071,"about_ca_topic_score_gemma":0.0000609159,"teacher_disagreement_score":0.9804985,"about_ca_system_score_codex":0.000289568,"about_ca_system_score_gemma":0.0005019145,"threshold_uncertainty_score":0.9997035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047047595,0.0031747057,0.9822896,0.00007986717,0.0011648452,0.00023872855,0.000009350383,0.000043931508,0.008294207],"genre_scores_gemma":[0.9083062,0.000803785,0.08016489,0.0007923492,0.00161606,0.000016626554,0.000092725866,0.00006598643,0.008141424],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983687,0.000027299262,0.0002478962,0.0008141534,0.0002141744,0.00032781588],"domain_scores_gemma":[0.9990818,0.00003095331,0.0001270208,0.00056350254,0.00009150051,0.000105238716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035154962,0.00028827597,0.00026374758,0.00014804925,0.00010559829,0.000045572742,0.00079721544,0.00048660126,0.00004479276],"category_scores_gemma":[0.00008803553,0.00024869086,0.00012107401,0.00008630982,0.0007135192,0.000004589394,0.000621714,0.00034408437,0.000049564886],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017843959,0.00017636585,0.00037921057,0.00003350293,0.000028452394,0.000013524236,0.00032469167,0.00004527395,0.0012914194,0.00014627178,0.00029303928,0.9972504],"study_design_scores_gemma":[0.0050567226,0.009432158,0.02819333,0.0045908717,0.00028052687,0.000663524,0.0000033387341,0.0055960207,0.21026699,0.32947487,0.39916927,0.007272352],"about_ca_topic_score_codex":0.0000042808447,"about_ca_topic_score_gemma":0.000090307454,"teacher_disagreement_score":0.9899781,"about_ca_system_score_codex":0.000039303275,"about_ca_system_score_gemma":0.00030307512,"threshold_uncertainty_score":0.99999654},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44465873,0.0000032745124,0.5478008,0.006621921,0.00047251364,0.00027190713,8.8258247e-7,0.00011339679,0.000056627883],"genre_scores_gemma":[0.9872329,8.266328e-7,0.005162297,0.007362449,0.0001588724,0.000058483616,4.9925507e-7,0.000012433033,0.000011220858],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99766946,0.0001949488,0.00020485825,0.00096522877,0.00050999084,0.00045553682],"domain_scores_gemma":[0.9914178,0.007868989,0.00009524401,0.00036520362,0.00017550582,0.000077212324],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0005367916,0.00021559723,0.00018902103,0.00039338207,0.00044531355,0.000262879,0.00042517626,0.000083849925,0.00011403287],"category_scores_gemma":[0.015222014,0.00018502805,0.000047318445,0.0024748985,0.0005518222,0.0012229031,0.00024649152,0.00038499426,0.00019316126],"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.000013973034,0.00006183004,0.00049446494,0.000006226702,0.0000017813525,0.0000022652987,0.0002907897,0.014454304,0.5312195,0.00005291647,0.00009274737,0.4533092],"study_design_scores_gemma":[0.00029951148,0.00011643549,0.014019321,0.000025630989,0.0000010460984,0.000021935173,0.0000016524089,0.2057749,0.7686822,0.010491198,0.00034405716,0.00022210953],"about_ca_topic_score_codex":0.00032005,"about_ca_topic_score_gemma":0.0001908061,"teacher_disagreement_score":0.5426385,"about_ca_system_score_codex":0.000321024,"about_ca_system_score_gemma":0.000113137605,"threshold_uncertainty_score":0.99307317},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79818135,0.00009676328,0.07812299,0.003505018,0.007088416,0.004842353,0.00008236988,0.00018499035,0.107895724],"genre_scores_gemma":[0.9964404,0.00011179942,0.000115867915,0.0014170571,0.00014845106,0.000017426459,3.1330313e-7,0.000021444746,0.0017272239],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99703205,0.000100935846,0.00043562317,0.0010922884,0.0008266927,0.00051240524],"domain_scores_gemma":[0.9977025,0.0010319222,0.00036507542,0.00074670237,0.00008594141,0.000067895046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092697825,0.0003722768,0.0003376947,0.00045804688,0.00036259837,0.00021691396,0.0017675072,0.00014778916,0.000104330604],"category_scores_gemma":[0.000628742,0.00018231454,0.00018725828,0.0007098393,0.001624985,0.0002690877,0.0004250032,0.0008312581,0.00004097075],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013211087,0.00064579735,0.00432513,0.000069205045,0.00003289036,0.0003080218,0.028303936,0.005240356,0.33963636,0.0079398425,0.0012392311,0.61093813],"study_design_scores_gemma":[0.0025163277,0.009920306,0.20758267,0.0058572753,0.0000732541,0.0006326576,0.000020761872,0.12691723,0.4434157,0.19669427,0.0026155403,0.003754015],"about_ca_topic_score_codex":0.00012066258,"about_ca_topic_score_gemma":0.00018837085,"teacher_disagreement_score":0.6071841,"about_ca_system_score_codex":0.00034867635,"about_ca_system_score_gemma":0.00035108646,"threshold_uncertainty_score":0.74345714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047610595,0.0005020783,0.9955316,0.0001862879,0.0011650186,0.00069816393,0.0000025344102,0.00051580253,0.0009223668],"genre_scores_gemma":[0.15111238,0.00013630558,0.84651977,0.0010217947,0.0008480658,0.000022319242,0.0000043363107,0.00008222294,0.00025279488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956677,0.00004663105,0.0006160819,0.0017955827,0.001029664,0.0008443567],"domain_scores_gemma":[0.9974823,0.00018671426,0.00036009643,0.001370702,0.0003716222,0.00022857275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005925723,0.00068531325,0.0006188504,0.0010144038,0.00037051196,0.0007075006,0.0024050414,0.000379008,0.00004225225],"category_scores_gemma":[0.00008266468,0.0006141704,0.00019401274,0.00088419835,0.0005263815,0.0017916216,0.0016728708,0.0008812784,0.00006191434],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050963195,0.000023854176,0.0000073538226,0.000033790813,0.000008036973,0.000057680012,0.00034169847,0.0006152417,0.003156273,0.0015582046,0.000001882248,0.9941909],"study_design_scores_gemma":[0.00024796926,0.00041507705,0.00005103781,0.0004962979,0.000013143008,0.00016039395,3.7585383e-7,0.5576133,0.08588628,0.3530963,0.00095027196,0.0010695467],"about_ca_topic_score_codex":0.00009021636,"about_ca_topic_score_gemma":0.00006073625,"teacher_disagreement_score":0.9931213,"about_ca_system_score_codex":0.0005276512,"about_ca_system_score_gemma":0.000277486,"threshold_uncertainty_score":0.999631},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003359026,0.00017027817,0.99796426,0.00047978855,0.00018565821,0.00055771845,0.000007726741,0.00024388057,0.000054812248],"genre_scores_gemma":[0.12902251,0.00014388005,0.8700088,0.0005779138,0.00004540655,0.000054664004,8.434032e-7,0.000024065974,0.000121916644],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968568,0.00010528299,0.00071403314,0.0011654163,0.00068354444,0.00047488674],"domain_scores_gemma":[0.9949589,0.0027044425,0.00034447518,0.0015450019,0.0003363902,0.00011083327],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012590305,0.00041804463,0.00069078,0.0018872774,0.00021521108,0.0004611399,0.0019770814,0.00019322884,0.0000024497217],"category_scores_gemma":[0.0006493066,0.00032186823,0.000111292255,0.0017658718,0.00095073687,0.00050170807,0.001218442,0.00053609343,0.0000011646217],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009896822,0.0000066153684,0.000091786336,0.00003989783,0.000022994054,0.000008502801,0.00044778586,0.025972702,0.0002321887,0.005958607,0.000009610144,0.9671994],"study_design_scores_gemma":[0.00023861915,0.0012144924,0.0011993716,0.0008608697,0.00008646595,0.000056988123,0.0000017222812,0.40549177,0.08869673,0.47606847,0.024311896,0.0017726062],"about_ca_topic_score_codex":0.00013373948,"about_ca_topic_score_gemma":0.0021660584,"teacher_disagreement_score":0.9654268,"about_ca_system_score_codex":0.00021272876,"about_ca_system_score_gemma":0.00016948637,"threshold_uncertainty_score":0.99992335},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004833851,0.00044195488,0.9871158,0.000054726046,0.0028379662,0.00015857402,0.000014581408,0.0006888959,0.003853634],"genre_scores_gemma":[0.93555075,0.0001178695,0.062489595,0.00018894613,0.0013640993,0.000005871256,0.000038171842,0.000088766625,0.00015594564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981393,0.000011092998,0.0003581076,0.0006286078,0.00043923908,0.00042361402],"domain_scores_gemma":[0.99903905,0.00022221502,0.00010597074,0.00048593697,0.00004955317,0.00009729204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026336903,0.00041859937,0.00041390408,0.00041904626,0.00012313096,0.00023055164,0.0006590489,0.0003797162,0.00006236137],"category_scores_gemma":[0.0000383904,0.00039463918,0.00008624367,0.00017474474,0.00017346647,0.00021588148,0.00013237711,0.00074823847,0.00008608563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021697504,0.0000042302645,0.00003991465,0.000031788655,0.000016036545,0.000016806853,0.00019634196,0.47799078,0.0014748925,0.0002830449,0.000059466303,0.5198845],"study_design_scores_gemma":[0.00021188779,0.00003849978,0.00072139857,0.00059192296,0.000021417834,0.000022098473,1.5922983e-7,0.9593991,0.004017463,0.021764815,0.012480503,0.00073074136],"about_ca_topic_score_codex":0.00008631607,"about_ca_topic_score_gemma":0.00011539852,"teacher_disagreement_score":0.9307169,"about_ca_system_score_codex":0.00019628071,"about_ca_system_score_gemma":0.000053817716,"threshold_uncertainty_score":0.9998506},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003417186,0.0002971996,0.97956955,0.0016053361,0.001659266,0.0004074709,0.000016445756,0.0002604973,0.016150035],"genre_scores_gemma":[0.22932613,0.00009055379,0.7592369,0.00613479,0.0008923512,0.00003927966,0.000044384913,0.00009284713,0.004142819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555343,0.0000855836,0.00056145695,0.0021236218,0.000935149,0.0007407328],"domain_scores_gemma":[0.996849,0.00039182082,0.00032757537,0.0017547134,0.0002791985,0.00039768315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011578829,0.00059942465,0.00049154466,0.0013024891,0.00041259642,0.00075944315,0.0039899847,0.00029541444,0.00008800308],"category_scores_gemma":[0.00028802388,0.0005487622,0.00011443932,0.00085457496,0.00028593547,0.0010663599,0.0016054345,0.0010700679,0.00039161596],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112674625,0.000032268796,0.000062671,0.000035899422,0.000010082479,0.0000997538,0.0015898508,0.003461746,0.00061129325,0.10202593,0.00017050696,0.89188874],"study_design_scores_gemma":[0.00058575696,0.0007356555,0.0026579765,0.0013712944,0.00002511267,0.00019887756,7.944978e-7,0.83483994,0.003762942,0.09875912,0.054344792,0.0027177301],"about_ca_topic_score_codex":0.00002542437,"about_ca_topic_score_gemma":0.00003708113,"teacher_disagreement_score":0.889171,"about_ca_system_score_codex":0.00030084155,"about_ca_system_score_gemma":0.00050724176,"threshold_uncertainty_score":0.9996964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007395399,0.00026591617,0.9952416,0.0000966684,0.0003712791,0.00021705593,0.00037050695,0.00002404022,0.0026733845],"genre_scores_gemma":[0.9470671,0.00005327193,0.051833525,0.00048431297,0.00018101896,0.000013038976,0.00024280543,0.00003121776,0.00009373295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972454,0.000014130798,0.0009962891,0.0011678787,0.00018795863,0.00038838165],"domain_scores_gemma":[0.99781704,0.00014565466,0.00081962644,0.0010171664,0.00009552143,0.00010497456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069400156,0.00037971704,0.001222916,0.0033372333,0.000090405534,0.00018850452,0.0011002781,0.00025352056,0.0007357137],"category_scores_gemma":[0.000052023523,0.00037858132,0.00047527844,0.0012462226,0.0002852101,0.00020499437,0.00034357002,0.00034242927,0.0000536399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021275877,0.00011283061,0.01911094,0.00018994197,0.00095315813,0.000013785017,0.00061463774,0.87490547,0.00001970766,0.008575384,0.000008767772,0.095474124],"study_design_scores_gemma":[0.00019806153,0.00006228956,0.0050372137,0.0000691157,0.00015099745,0.0000010633337,2.229177e-7,0.9731936,0.000040742365,0.020695712,0.000107776286,0.00044323644],"about_ca_topic_score_codex":0.0061864834,"about_ca_topic_score_gemma":0.0011527394,"teacher_disagreement_score":0.9463275,"about_ca_system_score_codex":0.00011632585,"about_ca_system_score_gemma":0.000057774305,"threshold_uncertainty_score":0.9998666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006838935,0.0013877427,0.99248135,0.00011998578,0.0015913299,0.0012020635,0.000020397161,0.00007429125,0.0030544756],"genre_scores_gemma":[0.55322874,0.000057933023,0.44600943,0.0001725816,0.00033318077,0.00006470155,0.000013228872,0.00002237183,0.000097826094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977889,0.00004127945,0.00045223496,0.00088811945,0.00039433312,0.00043509773],"domain_scores_gemma":[0.9969186,0.0012633641,0.0003235502,0.0009065172,0.00047386464,0.00011407104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006907028,0.00031658605,0.00044288614,0.0005049181,0.00018320953,0.00012509152,0.0015151261,0.00021350625,0.000006026454],"category_scores_gemma":[0.00018158303,0.00026867766,0.00016285751,0.00043253275,0.00044074337,0.0004605586,0.00063572725,0.0002514768,0.000012488461],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011140091,0.00007418869,0.00030912695,0.000061591745,0.000015002427,0.0000020548364,0.0009519841,0.0037273928,0.00024660633,0.03463435,0.000033101456,0.95993346],"study_design_scores_gemma":[0.0006201458,0.0002980759,0.0012298849,0.0002139727,0.000016542315,0.00001217555,4.3812588e-7,0.94179225,0.0026660818,0.051012438,0.0017311668,0.0004068464],"about_ca_topic_score_codex":0.000017578852,"about_ca_topic_score_gemma":0.00008739675,"teacher_disagreement_score":0.9595266,"about_ca_system_score_codex":0.00015086634,"about_ca_system_score_gemma":0.00026302313,"threshold_uncertainty_score":0.9999765},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021874909,0.00015319424,0.9947797,0.00217414,0.00083005166,0.0011164182,0.000012421447,0.00011115147,0.0006041422],"genre_scores_gemma":[0.9241577,0.000018889803,0.073002845,0.0022211738,0.0002431344,0.000070935974,0.000017967137,0.000039105344,0.00022829657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961899,0.00007656082,0.0005998404,0.0015434927,0.0007902143,0.00079998566],"domain_scores_gemma":[0.99606705,0.0018383191,0.0003321424,0.0013801149,0.00023339358,0.00014898129],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008051404,0.0006243699,0.000513398,0.00043587884,0.00028633157,0.000910506,0.0036263992,0.0005107847,0.000031690193],"category_scores_gemma":[0.00024460908,0.00044180418,0.00010887204,0.0006342218,0.0004682792,0.00054643996,0.0004954801,0.0012652235,0.000014582325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011056291,0.000034491582,0.00003203254,0.00003060936,0.000009037237,0.000007608819,0.0007249425,0.20617865,0.00023814087,0.23296042,0.00027103943,0.55950195],"study_design_scores_gemma":[0.00017090302,0.00015402463,0.000023245499,0.00027057898,0.0000028800087,0.0000033113304,1.5961653e-7,0.6721502,0.00032185408,0.32644024,0.000086135486,0.00037650418],"about_ca_topic_score_codex":0.000051194773,"about_ca_topic_score_gemma":0.00030945093,"teacher_disagreement_score":0.92393893,"about_ca_system_score_codex":0.00025390563,"about_ca_system_score_gemma":0.00042591608,"threshold_uncertainty_score":0.99980336},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008335716,0.00014170253,0.98639613,0.0020294767,0.00049896183,0.009084277,0.0000028011711,0.00051597203,0.0012473055],"genre_scores_gemma":[0.0117580155,0.000005137756,0.98394716,0.0011745138,0.0003466868,0.0021546832,0.000001475455,0.000041023264,0.00057131815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597824,0.000015629472,0.0005746571,0.0018239599,0.0006769751,0.0009305427],"domain_scores_gemma":[0.9970615,0.00061467156,0.0003407973,0.0015150716,0.00028323926,0.00018471935],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010193854,0.0005377258,0.00057804724,0.0008044617,0.0003538042,0.0011429178,0.0039815293,0.00038659485,0.0000033827362],"category_scores_gemma":[0.00038790712,0.0004819794,0.000088208544,0.00058435363,0.0005617619,0.00065928255,0.0029561687,0.00063813553,0.000025184274],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026147409,0.000007515091,0.00003279025,0.00005897826,0.0000056332065,0.000013160615,0.00030383957,0.0031949133,0.00023824263,0.023220574,0.00014873366,0.972773],"study_design_scores_gemma":[0.00031009497,0.00040338904,0.00012227129,0.0011606995,0.0000054116,0.000064300475,2.6155223e-7,0.5318111,0.0027593852,0.45215034,0.0102226,0.0009901198],"about_ca_topic_score_codex":0.000011512424,"about_ca_topic_score_gemma":0.000034203487,"teacher_disagreement_score":0.97178286,"about_ca_system_score_codex":0.0002143563,"about_ca_system_score_gemma":0.0002756631,"threshold_uncertainty_score":0.99989396},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083945505,0.001102332,0.9879851,0.00049000036,0.0005451163,0.00028738208,0.0000056886524,0.00019334858,0.0009965274],"genre_scores_gemma":[0.73928744,0.000080459635,0.25599366,0.002797327,0.0016864634,0.000012843468,0.00001911673,0.00005744084,0.00006526599],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99581105,0.00005557711,0.00046822111,0.0016140105,0.0009976054,0.0010535206],"domain_scores_gemma":[0.9978273,0.000339768,0.00040751943,0.0010135417,0.00016512598,0.00024675156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006006872,0.0007085457,0.000842951,0.00094922073,0.00068727706,0.00093855575,0.0022045702,0.0002927207,0.0000114566],"category_scores_gemma":[0.0000024797935,0.0005585766,0.00016725512,0.0019571246,0.0003761292,0.0010429791,0.0017032488,0.0007257235,0.000007880432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075880664,0.000072660536,0.018414808,0.0005513653,0.00078426796,0.00018352308,0.028547188,0.16245447,0.00028017728,0.018180588,0.0000024675198,0.7704526],"study_design_scores_gemma":[0.0020364474,0.000637562,0.030856198,0.0023436996,0.0013590547,0.0004381487,0.000029450495,0.85929,0.0021930507,0.09000549,0.0045767035,0.0062341965],"about_ca_topic_score_codex":0.00029290112,"about_ca_topic_score_gemma":0.003320412,"teacher_disagreement_score":0.7642184,"about_ca_system_score_codex":0.000109176435,"about_ca_system_score_gemma":0.00015992422,"threshold_uncertainty_score":0.9996866},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009863743,0.0011615977,0.9935696,0.0004729998,0.0012506895,0.00027893952,0.000011100231,0.0002499956,0.0020186813],"genre_scores_gemma":[0.4688828,0.00022418862,0.525977,0.003717262,0.00059036585,0.000009718073,0.000009179513,0.000066642446,0.00052284496],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666005,0.000044756434,0.00045954343,0.001309612,0.00071331713,0.0008127043],"domain_scores_gemma":[0.9974593,0.0004661662,0.0002682934,0.0013955424,0.00011676576,0.0002939477],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097508397,0.0005475847,0.00055286154,0.0006172381,0.00026960246,0.00060088193,0.0025330733,0.0002358517,0.000028678349],"category_scores_gemma":[0.000038888404,0.00048723118,0.00009320904,0.00035344245,0.0013330077,0.0008411479,0.002201186,0.00068941904,0.000057279023],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034875661,0.000023320837,0.000063716405,0.000033146873,0.000008691619,0.000062266045,0.0010046624,0.00023801504,0.00016677003,0.045052566,0.000012936805,0.9533304],"study_design_scores_gemma":[0.00032825934,0.00015947036,0.0012842788,0.0002791037,0.000009467675,0.000244054,1.590089e-7,0.3391628,0.0011430143,0.65382254,0.0025920845,0.0009747752],"about_ca_topic_score_codex":0.000018439581,"about_ca_topic_score_gemma":0.000027743448,"teacher_disagreement_score":0.9523556,"about_ca_system_score_codex":0.00012850374,"about_ca_system_score_gemma":0.00020343093,"threshold_uncertainty_score":0.99975795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010821042,0.00039333384,0.98810375,0.00011727916,0.00027289568,0.00024507858,0.000020502592,0.0000028932109,0.00002323052],"genre_scores_gemma":[0.9629326,0.000031049054,0.03616243,0.0004168572,0.0003309112,0.00001160194,0.00004070883,0.000010007333,0.00006383516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992812,0.000007960694,0.0001669044,0.00026224533,0.00012349249,0.00015815662],"domain_scores_gemma":[0.9996083,0.00004093228,0.00011051754,0.00011643211,0.00010359134,0.000020242043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016757479,0.00012902622,0.00012138396,0.000057247176,0.0001916624,0.000013562322,0.0002085255,0.00017128675,0.0000148218805],"category_scores_gemma":[0.000010540333,0.000101283054,0.000058616322,0.000034181103,0.0004211772,0.0000034956488,0.00008754542,0.00007944804,4.6086586e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008021084,0.00008953192,0.0017419772,0.0000900763,0.000027821889,0.0000013017838,0.00083637144,0.8190564,0.013371372,0.002451775,0.00011733884,0.16213581],"study_design_scores_gemma":[0.00033861928,0.0001613547,0.0035444917,0.000021720007,0.000049741793,0.0000061519863,4.6865028e-7,0.9796605,0.006105257,0.009597917,0.00023774669,0.00027600917],"about_ca_topic_score_codex":0.0000011131201,"about_ca_topic_score_gemma":0.00003203946,"teacher_disagreement_score":0.95211154,"about_ca_system_score_codex":0.000009153336,"about_ca_system_score_gemma":0.0001472039,"threshold_uncertainty_score":0.4130203},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047464546,0.001384894,0.84299546,0.00059482415,0.0016919035,0.0014385482,0.000029026276,0.000033117238,0.10436768],"genre_scores_gemma":[0.9973834,0.000032489832,0.0016897543,0.0004678275,0.00023138382,0.000036063357,0.000002590758,0.000007934033,0.00014851765],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99879867,0.00003765286,0.00020679852,0.000398294,0.00029871523,0.00025989074],"domain_scores_gemma":[0.99912953,0.0002702015,0.00012482662,0.00041420007,0.000037311715,0.000023911993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039688442,0.00017282157,0.0002239111,0.00018164453,0.00009685207,0.000022472976,0.0006329123,0.00011282605,0.00022572603],"category_scores_gemma":[0.000010158106,0.00011393907,0.000046473993,0.000203228,0.00047584003,0.000029886514,0.00015528686,0.0003245312,0.000034545774],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000107129235,0.00021190301,0.01647638,0.00003115801,0.000040185634,0.000005763948,0.06289332,0.00015849675,0.00018922964,0.058102213,0.000078685276,0.861802],"study_design_scores_gemma":[0.00056003395,0.00028393575,0.8745099,0.00018582589,0.000033781915,0.00001841392,0.00017182849,0.0016176634,0.000040007508,0.11954441,0.0023749147,0.0006593207],"about_ca_topic_score_codex":0.000093137816,"about_ca_topic_score_gemma":0.00010930412,"teacher_disagreement_score":0.94991887,"about_ca_system_score_codex":0.00006406917,"about_ca_system_score_gemma":0.000029274428,"threshold_uncertainty_score":0.46463007},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060728726,0.002009807,0.9951179,0.00016559967,0.0014617317,0.00053023564,0.000017068069,0.0004302806,0.00020664587],"genre_scores_gemma":[0.20023216,0.00020380145,0.79733646,0.0011797893,0.00084767817,0.000010501744,0.0000663344,0.000072186136,0.00005109972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99485207,0.00012399559,0.00087825523,0.0020167225,0.0012905003,0.00083848374],"domain_scores_gemma":[0.99441123,0.0005769859,0.00066460966,0.003605472,0.0005119679,0.00022974814],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0032993597,0.0006326107,0.00067854713,0.0024403252,0.00048613307,0.0014953394,0.0076977257,0.00035028398,0.000023427114],"category_scores_gemma":[0.0002846534,0.00062912575,0.0001307384,0.0023145399,0.00034197464,0.0040055136,0.008257023,0.0007666972,0.0000125863735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002420105,0.00003773428,0.0001949981,0.00007037294,0.000028931343,0.000022313614,0.0012868108,0.002536012,0.00008815232,0.04320088,0.00008638611,0.952445],"study_design_scores_gemma":[0.0001340222,0.00006340243,0.000025113888,0.00035285688,0.00002045167,0.000034515786,5.9192917e-7,0.95118773,0.00045245327,0.043151177,0.0038946196,0.00068308326],"about_ca_topic_score_codex":0.0001431421,"about_ca_topic_score_gemma":0.00010204674,"teacher_disagreement_score":0.9517619,"about_ca_system_score_codex":0.00024443565,"about_ca_system_score_gemma":0.00044103284,"threshold_uncertainty_score":0.999764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010078514,0.000408015,0.98605114,0.0004592701,0.0027599386,0.00042058984,0.0000011379028,0.0005235093,0.009275588],"genre_scores_gemma":[0.28072968,0.000017644716,0.7173432,0.000519141,0.0007650488,0.000019780879,0.0000019962747,0.000040188006,0.00056332984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960886,0.000041177154,0.00057241635,0.0016805613,0.0009492216,0.0006679889],"domain_scores_gemma":[0.9973175,0.00019873475,0.0002721107,0.0017624614,0.0002545328,0.00019467376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092918985,0.0005021224,0.0004963698,0.00071344886,0.00021805977,0.00081645325,0.0032593745,0.00034816694,0.00001428469],"category_scores_gemma":[0.000052775118,0.00047051505,0.00010706687,0.0003789296,0.0002597488,0.0009406941,0.0012921295,0.0007470486,0.00019406898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010283289,0.000008378651,0.000023256722,0.00010839744,0.0000063668535,0.000087353284,0.00043356084,0.046993125,0.000117904645,0.24311113,0.00001127042,0.7090982],"study_design_scores_gemma":[0.00011608105,0.00006086125,0.000045001638,0.0010075782,0.0000044429325,0.00013838348,1.3069682e-7,0.95251477,0.0003845024,0.044335645,0.00085335516,0.000539265],"about_ca_topic_score_codex":0.000093061695,"about_ca_topic_score_gemma":0.000030258947,"teacher_disagreement_score":0.90552163,"about_ca_system_score_codex":0.0006345495,"about_ca_system_score_gemma":0.00036456302,"threshold_uncertainty_score":0.99977463},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007463301,0.000119673416,0.9845439,0.0018454184,0.0023122358,0.00085049286,0.000010675426,0.00015469376,0.010088278],"genre_scores_gemma":[0.081925064,0.00007379689,0.8187565,0.044881187,0.036372494,0.00012152891,0.0007974668,0.00041049044,0.016661428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973851,0.0000058159035,0.00046546687,0.00087547314,0.0006396369,0.00062851806],"domain_scores_gemma":[0.99878746,0.00012742197,0.00018846431,0.0006084365,0.00024562556,0.00004258765],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00097343896,0.0004499663,0.00041249493,0.0008573569,0.00028740178,0.00025742277,0.00091881125,0.00019768345,0.00022517],"category_scores_gemma":[0.00010537438,0.0004161094,0.00015910386,0.00039674528,0.0002637555,0.00045228447,0.00048461012,0.00034631445,0.00081342435],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008367739,0.000039477833,0.00001387372,0.000115248564,0.0000128320835,0.00000410887,0.00009559685,0.00679163,0.000006724394,0.0024272231,0.0006617946,0.9898231],"study_design_scores_gemma":[0.0003123115,0.000037860173,0.000068326925,0.00023938024,0.00002671683,0.0000011983675,4.5985527e-7,0.9124685,0.000021212269,0.008600577,0.07773584,0.0004876073],"about_ca_topic_score_codex":0.0000867342,"about_ca_topic_score_gemma":0.00015523605,"teacher_disagreement_score":0.98933554,"about_ca_system_score_codex":0.00014429112,"about_ca_system_score_gemma":0.00006509142,"threshold_uncertainty_score":0.99996454},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004267791,0.00034327604,0.9962614,0.0006625506,0.00061989104,0.00025655245,0.000006701364,0.000048014106,0.0013747951],"genre_scores_gemma":[0.90581584,0.00010657665,0.091292806,0.002033523,0.0004237458,0.000007855318,0.0000042300508,0.000033315824,0.0002821063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973719,0.000054805416,0.00039567958,0.00097527966,0.0008533995,0.00034894893],"domain_scores_gemma":[0.9966368,0.0013582933,0.000324003,0.0014533602,0.00012693099,0.0001006298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007761458,0.00037081496,0.00044658783,0.00044510642,0.0002414686,0.00026765568,0.002772207,0.00021335075,0.000014677552],"category_scores_gemma":[0.000095697374,0.00022091363,0.000080303274,0.0003720115,0.00066366943,0.00021877258,0.0013073668,0.0005237896,0.000008017071],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010676325,0.000023029914,0.000043302858,0.000017228058,0.000008232997,0.000015031438,0.00033528497,0.0031520776,0.000043140775,0.16330026,0.00009774234,0.832954],"study_design_scores_gemma":[0.00030063145,0.00029128807,0.0005668211,0.00036981565,0.000005647831,0.000016949545,1.07176625e-7,0.61414635,0.0006941136,0.3808333,0.0023901367,0.0003848366],"about_ca_topic_score_codex":0.000034099536,"about_ca_topic_score_gemma":0.000034880726,"teacher_disagreement_score":0.9053891,"about_ca_system_score_codex":0.00005083452,"about_ca_system_score_gemma":0.00016982928,"threshold_uncertainty_score":0.90085965},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9034717,0.0008516177,0.07207473,0.000441598,0.004375286,0.001446365,0.000026567688,0.00025205026,0.017060084],"genre_scores_gemma":[0.99198925,0.000009760577,0.006551264,0.00017286424,0.00022101778,0.000055270233,0.000012502089,0.00006260314,0.0009254538],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9963509,0.000049578728,0.00039402343,0.0015557251,0.0006493907,0.0010003871],"domain_scores_gemma":[0.99800706,0.0003690188,0.00033137848,0.0010046085,0.00006821267,0.00021969705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037161118,0.0006852423,0.0006589232,0.0020539702,0.00022772893,0.00038204028,0.0012648588,0.00049463636,0.0005069338],"category_scores_gemma":[0.00008523192,0.00058217434,0.00017911295,0.0007743056,0.00069283525,0.00035984206,0.00028209697,0.00097538653,0.000109063374],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037906506,0.0002754155,0.3044489,0.000051530867,0.000066189714,0.0010769053,0.054426897,0.002371041,0.00014324348,0.000848463,0.00008470391,0.6361688],"study_design_scores_gemma":[0.0057137744,0.0019917525,0.9451674,0.0040027085,0.00017157238,0.0004422067,0.00020771062,0.026157774,0.001962077,0.0068743364,0.0014580035,0.005850669],"about_ca_topic_score_codex":0.00042216328,"about_ca_topic_score_gemma":0.00020684037,"teacher_disagreement_score":0.6407185,"about_ca_system_score_codex":0.0005311321,"about_ca_system_score_gemma":0.00014262977,"threshold_uncertainty_score":0.999663},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019613969,0.0014226468,0.9935094,0.00010762912,0.00078002934,0.00041014058,0.0000038621533,0.0032552385,0.00031490458],"genre_scores_gemma":[0.012601839,0.00007873605,0.9864927,0.0005511173,0.000093324845,0.000023419472,0.00000780451,0.00003717883,0.000113857954],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960889,0.00010887578,0.00075976975,0.0014746094,0.0009215143,0.0006463189],"domain_scores_gemma":[0.99493533,0.0019529583,0.0005446634,0.0019183602,0.00047564993,0.00017304228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015372047,0.0005840167,0.00085055904,0.00085136615,0.00021460187,0.00036538826,0.0046678125,0.00035978112,0.000039014147],"category_scores_gemma":[0.0009949765,0.00051750574,0.00013075481,0.0006741233,0.00048490285,0.0007833414,0.0021806979,0.00058399385,0.000030926156],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002418673,0.000031821357,0.0004051616,0.00013774436,0.000010969792,0.0000137270945,0.001433803,0.00076491595,0.000037356862,0.003178575,0.0001177625,0.9938657],"study_design_scores_gemma":[0.0002960088,0.00043332877,0.0027675768,0.00219766,0.000014877232,0.00012213817,2.4212028e-7,0.051591758,0.005543357,0.9341841,0.0014007082,0.0014482563],"about_ca_topic_score_codex":0.00008112329,"about_ca_topic_score_gemma":0.000054787728,"teacher_disagreement_score":0.9924175,"about_ca_system_score_codex":0.00020421686,"about_ca_system_score_gemma":0.0007198618,"threshold_uncertainty_score":0.99972767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000071988,0.00007677533,0.99435174,0.00033631924,0.0007530344,0.0004098703,0.00011820522,0.00032942247,0.0035526135],"genre_scores_gemma":[0.23671027,0.000021708502,0.76219964,0.0006434396,0.000117797856,0.000007093362,0.00013580492,0.00004636697,0.00011790648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948737,0.0000829818,0.0006269876,0.0023253367,0.001360704,0.0007303087],"domain_scores_gemma":[0.99272627,0.0009882167,0.0006115234,0.0052826977,0.00024211088,0.00014920859],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014889075,0.00066004397,0.0007311502,0.001981343,0.00020716617,0.00026714348,0.008902251,0.0003970758,0.000014188116],"category_scores_gemma":[0.00013627,0.00058093667,0.00010387123,0.0009012314,0.00071794324,0.0005394475,0.0045816256,0.0007486351,0.000021241136],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017812681,0.00004471258,0.000013877268,0.000041429015,0.000010524428,0.000044267872,0.00020216874,0.0025453856,0.00026675986,0.013099605,0.00008480973,0.98362863],"study_design_scores_gemma":[0.00021217893,0.00048628944,0.000030824664,0.001425998,0.000012064091,0.000013306257,2.2147317e-7,0.97122055,0.0027780146,0.022346098,0.00090520555,0.0005692524],"about_ca_topic_score_codex":0.000027924805,"about_ca_topic_score_gemma":0.000077872,"teacher_disagreement_score":0.9830594,"about_ca_system_score_codex":0.0002668723,"about_ca_system_score_gemma":0.0005169923,"threshold_uncertainty_score":0.9996642},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006315532,0.000063519554,0.9964395,0.0003929811,0.0010169935,0.00031552123,0.00001030954,0.00015370028,0.0015442831],"genre_scores_gemma":[0.055290315,0.00005545284,0.93910444,0.0035743744,0.0007584765,0.00002703863,0.00009275018,0.00006243908,0.0010347045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725175,0.000017028642,0.000502954,0.001213238,0.0005307947,0.0004842272],"domain_scores_gemma":[0.9980929,0.0002213919,0.00038865578,0.0008562919,0.0002978769,0.00014291324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007177134,0.00036746947,0.0003735095,0.00070663326,0.00024427762,0.0006053395,0.0022399337,0.0002377531,0.000019527874],"category_scores_gemma":[0.00012567315,0.0003593077,0.0001111487,0.00044833095,0.0002892985,0.0008282791,0.00069844146,0.0002759942,0.000034684497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008553985,0.00006433939,0.00013388465,0.00009012702,0.000019393281,0.000013915557,0.0012960973,0.00012866515,0.0018289759,0.20922911,0.00010657495,0.78708035],"study_design_scores_gemma":[0.00023052425,0.0001421389,0.0001880634,0.00029520117,0.0000083321465,0.000015429265,3.0510597e-7,0.9593158,0.0012727308,0.027809901,0.010152689,0.0005688878],"about_ca_topic_score_codex":0.0000028773275,"about_ca_topic_score_gemma":0.000008902023,"teacher_disagreement_score":0.95918715,"about_ca_system_score_codex":0.00014541355,"about_ca_system_score_gemma":0.0003970661,"threshold_uncertainty_score":0.9998859},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002253069,0.00017544263,0.9782808,0.0023813753,0.0051117917,0.00051972014,0.0000024356764,0.000044228127,0.013258937],"genre_scores_gemma":[0.9579227,0.00003254981,0.027797678,0.00831955,0.001150186,0.000033143424,9.03765e-7,0.00005003231,0.004693258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971093,0.00009897635,0.0005233697,0.00087453204,0.0009495673,0.0004442765],"domain_scores_gemma":[0.99630564,0.00089438935,0.00040378355,0.0020775492,0.0002479229,0.00007069651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095093646,0.0003847787,0.0003919865,0.00031476293,0.00036730597,0.0005295128,0.004654397,0.00023193954,0.00007487956],"category_scores_gemma":[0.00006604808,0.00019297673,0.00027148178,0.00058021955,0.00088490965,0.0002665845,0.00075011386,0.0007901988,0.000073451796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071675436,0.00006233207,0.00006864725,0.000053596883,0.00006093996,0.000014543518,0.0027809972,0.038692646,0.00031635302,0.71952397,0.0038249043,0.23459393],"study_design_scores_gemma":[0.0002446674,0.0003260395,0.00038019527,0.0012588109,0.000012674743,0.0000814906,8.148008e-7,0.5598263,0.0034614047,0.4217479,0.011839738,0.00081993506],"about_ca_topic_score_codex":0.000050972056,"about_ca_topic_score_gemma":0.000071872644,"teacher_disagreement_score":0.9576974,"about_ca_system_score_codex":0.00011078306,"about_ca_system_score_gemma":0.00019583474,"threshold_uncertainty_score":0.8649105},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006290959,0.00010300217,0.9498488,0.001044344,0.0020289028,0.0003897222,0.00000832603,0.00007558883,0.046438437],"genre_scores_gemma":[0.6722939,0.000056634755,0.31753302,0.007455704,0.0010050632,0.000014358058,0.00004888004,0.00007192107,0.0015205514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961371,0.000040828523,0.0005835042,0.0015748035,0.00088702707,0.0007767714],"domain_scores_gemma":[0.9974829,0.00037141354,0.0003656738,0.0011221477,0.0004683244,0.00018953113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053680065,0.00062111695,0.0005722097,0.0009300875,0.00029019202,0.0004870562,0.002443203,0.00033970806,0.00017305165],"category_scores_gemma":[0.00009669508,0.0005949649,0.00018703174,0.00061780354,0.00088600296,0.001007562,0.0007350728,0.0008077669,0.00016215206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051572602,0.000104377505,0.00027859266,0.000064004176,0.00006788342,0.00071522826,0.0012273194,0.016119184,0.0038648355,0.14839941,0.00019124064,0.8289164],"study_design_scores_gemma":[0.0012552395,0.00064558664,0.0011007031,0.0009974181,0.00003405766,0.0007249846,0.0000011594677,0.84307337,0.008208183,0.1349446,0.0068872413,0.002127435],"about_ca_topic_score_codex":0.000032767763,"about_ca_topic_score_gemma":0.000049103768,"teacher_disagreement_score":0.8269542,"about_ca_system_score_codex":0.00041011965,"about_ca_system_score_gemma":0.0006262382,"threshold_uncertainty_score":0.9996502},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036726843,0.00025738898,0.9934962,0.00023894342,0.0015148564,0.0028054328,0.000012708009,0.00030420307,0.0010029902],"genre_scores_gemma":[0.22951911,0.000010321766,0.76829433,0.0010713263,0.00050385075,0.00022150527,0.000017964709,0.000048612623,0.00031295166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99493736,0.00007132658,0.001082894,0.0018788256,0.0010980993,0.00093146967],"domain_scores_gemma":[0.9959144,0.00057435257,0.0004096236,0.0022147477,0.0005894299,0.0002974224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002026812,0.0007030573,0.0012071434,0.00087708054,0.00068297575,0.0006307659,0.0039186375,0.00035204357,0.0000019939068],"category_scores_gemma":[0.00008613843,0.0005806825,0.0002770419,0.0006466644,0.0003727545,0.0006036126,0.0010741783,0.00052158773,0.00003152117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109476705,0.000044161712,0.00004890738,0.00954861,0.000028092165,0.0000028410545,0.0015991511,0.93770003,0.000044287975,0.016506514,0.000044235636,0.03442224],"study_design_scores_gemma":[0.0002707594,0.00024296387,0.000027886477,0.004334853,0.000019433013,0.00007489788,3.7816474e-7,0.9828086,0.0001434349,0.011229989,0.00011830754,0.00072853034],"about_ca_topic_score_codex":0.000016161985,"about_ca_topic_score_gemma":0.0000084289495,"teacher_disagreement_score":0.22915184,"about_ca_system_score_codex":0.00050516205,"about_ca_system_score_gemma":0.00041570014,"threshold_uncertainty_score":0.9996645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020477556,0.000093049515,0.9918966,0.00038343534,0.0005181944,0.00045981925,0.000027707049,0.00019287654,0.0062235016],"genre_scores_gemma":[0.07906385,0.0000106774905,0.9179877,0.0021940798,0.00031688897,0.000060862476,0.000026848767,0.000037421716,0.00030166277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959174,0.00002650485,0.0005011383,0.0019682879,0.000791231,0.0007954453],"domain_scores_gemma":[0.99719995,0.0003306399,0.00011669842,0.0017813734,0.00016861284,0.00040269585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056354003,0.00053878437,0.0005486882,0.00063906383,0.0002886664,0.00067443907,0.004714483,0.00025505392,0.000011720078],"category_scores_gemma":[0.00008853458,0.00048180376,0.00009483622,0.0008218334,0.0005696034,0.00038096277,0.00200813,0.0006181609,0.00008738523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056233653,0.0001004859,0.000030357176,0.000025393058,0.000012462097,0.000023596576,0.0017487393,0.000499463,0.00013718753,0.13004473,0.00016834463,0.86720365],"study_design_scores_gemma":[0.00042648043,0.00032139663,0.0012670982,0.0005679738,0.000019189052,0.0001608769,8.025138e-7,0.94457495,0.00045888155,0.047297925,0.003483888,0.0014205301],"about_ca_topic_score_codex":0.000031777126,"about_ca_topic_score_gemma":0.00001687364,"teacher_disagreement_score":0.9440755,"about_ca_system_score_codex":0.00016004061,"about_ca_system_score_gemma":0.00026552932,"threshold_uncertainty_score":0.99976337},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006941431,0.00008641579,0.99235773,0.0000070793226,0.00029350343,0.00013835361,0.0000021870799,0.00003859627,0.0001347029],"genre_scores_gemma":[0.9898972,0.000057578214,0.009919505,0.0000202509,0.00007247442,0.0000011367703,0.000004745294,0.000019905054,0.000007212473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917597,0.000008400042,0.00020462173,0.00027296535,0.00021232034,0.0001257239],"domain_scores_gemma":[0.9996026,0.000057337005,0.00006689432,0.00020004825,0.000036438636,0.000036646106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001064916,0.00015707141,0.00016371429,0.00021258199,0.000054055174,0.000026109135,0.00011149698,0.00020835035,0.000009438267],"category_scores_gemma":[0.000008899859,0.00016053746,0.000023973349,0.00007158085,0.0001288062,0.00008172378,0.00004667712,0.0001862282,0.0000031362665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017947319,0.0000031713719,0.00009125564,0.0000314658,0.0000027431086,9.593284e-7,0.00012625458,0.81776524,0.0013900293,0.00005415269,5.1504756e-8,0.1805329],"study_design_scores_gemma":[0.00008953257,0.000049874165,0.0007816113,0.000079732265,0.000008046374,0.0000013559265,5.228752e-8,0.9864776,0.008255746,0.004053402,0.000051081897,0.00015192603],"about_ca_topic_score_codex":0.000011369665,"about_ca_topic_score_gemma":0.000015095643,"teacher_disagreement_score":0.98295575,"about_ca_system_score_codex":0.000098382334,"about_ca_system_score_gemma":0.000013668249,"threshold_uncertainty_score":0.6546527},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042626234,0.0019746446,0.991359,0.00034256725,0.0005724252,0.00015915828,0.0000062328386,0.000007679245,0.0013156992],"genre_scores_gemma":[0.93868697,0.0004318189,0.058104225,0.0005922445,0.0009653897,0.0000071576555,0.000044846733,0.000023055354,0.0011443057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986952,0.000015778432,0.00021939389,0.00055517507,0.00014582978,0.0003686265],"domain_scores_gemma":[0.99930507,0.000038633545,0.00013527405,0.00035280097,0.000077759345,0.00009043895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054960564,0.00020253242,0.00022309946,0.00012491326,0.00013936595,0.000044294928,0.00027548123,0.0003506642,0.000016686794],"category_scores_gemma":[0.00007135198,0.00019092095,0.000051654606,0.000058437276,0.00034128287,0.0000064439528,0.0003506955,0.0001811556,0.0000090974045],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002334405,0.00006451262,0.032992456,0.00009345777,0.000074229654,0.000009284441,0.00042753405,0.006428808,0.030202797,0.0005870826,0.0011588165,0.9279377],"study_design_scores_gemma":[0.0033139524,0.0026507783,0.177127,0.001012003,0.00035643514,0.0006941338,0.0000046233195,0.41558912,0.028244762,0.26223585,0.10187662,0.0068947184],"about_ca_topic_score_codex":0.00003377786,"about_ca_topic_score_gemma":0.00013732877,"teacher_disagreement_score":0.93442434,"about_ca_system_score_codex":0.000037616872,"about_ca_system_score_gemma":0.00012479506,"threshold_uncertainty_score":0.77855307},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12194144,0.00020650035,0.87637204,0.000021700229,0.00024762534,0.001191934,0.0000064292894,0.0000067393075,0.000005610702],"genre_scores_gemma":[0.9955183,0.0000039196098,0.0043802923,0.000010219832,0.000036232384,0.000040272687,0.0000011679662,0.000009443663,1.4351106e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856466,0.00008164884,0.00050774607,0.00022423604,0.0004952426,0.00012646441],"domain_scores_gemma":[0.9985451,0.00071458175,0.00031546826,0.00020898081,0.00020148973,0.000014357705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029136112,0.00016709241,0.0002705167,0.000120210054,0.00009397693,0.000050580187,0.00029439497,0.000078425175,4.0813748e-7],"category_scores_gemma":[0.000089840934,0.00009507345,0.000032105407,0.00007979553,0.00016726778,0.00010028228,0.000015724241,0.00017166049,7.3527433e-9],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022386144,0.0000074628583,0.000027850676,0.00034204416,0.000009607077,5.5475294e-8,0.00082907313,0.88680613,0.002494004,0.00007126062,4.3207202e-9,0.109390125],"study_design_scores_gemma":[0.0001984504,0.000049576527,0.00031888657,0.00034283567,0.000042979736,7.7757903e-7,0.000018340636,0.7108451,0.2867489,0.0013681818,7.661746e-8,0.000065922395],"about_ca_topic_score_codex":0.00003454555,"about_ca_topic_score_gemma":0.00003079511,"teacher_disagreement_score":0.8735769,"about_ca_system_score_codex":0.000075114236,"about_ca_system_score_gemma":0.00005262544,"threshold_uncertainty_score":0.38769826},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28521326,0.0026232207,0.6968529,0.0002593157,0.0010660623,0.00069414644,0.00003831201,0.00009257558,0.013160182],"genre_scores_gemma":[0.98093444,0.000028297201,0.017549807,0.0007295392,0.00047623197,0.0000020915948,0.000039731545,0.000025779345,0.00021410952],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976004,0.00005039438,0.00036303105,0.0010970106,0.00027540556,0.00061378506],"domain_scores_gemma":[0.9989817,0.00009012693,0.00025905282,0.00048329806,0.00008019113,0.00010562028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005823411,0.00042792983,0.00046304776,0.00022202756,0.00011750589,0.00009334583,0.00090719474,0.0004890497,0.0000333943],"category_scores_gemma":[0.000099783174,0.00035477025,0.00013349816,0.00015430496,0.00065056514,0.000008432895,0.0008738823,0.00050441414,0.000009447283],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025272527,0.00025650233,0.024644788,0.0002544436,0.00010695325,0.0011032751,0.0017002182,0.011236919,0.1178212,0.0011972706,0.0001241836,0.8413015],"study_design_scores_gemma":[0.009659263,0.0074709654,0.056682043,0.008365588,0.00017688534,0.0016503885,0.00007406408,0.12679207,0.6561796,0.09903701,0.019957023,0.013955099],"about_ca_topic_score_codex":0.000044447243,"about_ca_topic_score_gemma":0.00019564248,"teacher_disagreement_score":0.82734644,"about_ca_system_score_codex":0.000053181207,"about_ca_system_score_gemma":0.00015473823,"threshold_uncertainty_score":0.99989045},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000054020315,0.00048727886,0.9930806,0.0012239137,0.0040866705,0.00055756763,0.0000050068834,0.0003615622,0.0001919943],"genre_scores_gemma":[0.0040301634,0.000059023165,0.9945869,0.00047974935,0.00048394728,0.000040862116,0.0000022391696,0.00003079707,0.00028632162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762064,0.000020706619,0.00032295324,0.0010490925,0.00050404534,0.00048257326],"domain_scores_gemma":[0.993733,0.0039399187,0.000200052,0.001832571,0.0002249407,0.00006955294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014912992,0.0003687543,0.00032656672,0.00033833075,0.000333145,0.0003319642,0.004257124,0.00031034183,0.0000056475415],"category_scores_gemma":[0.00087757356,0.00027163446,0.00011833316,0.00035991037,0.0006402175,0.00039862408,0.00077260647,0.00089376944,0.000019127237],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037407913,0.000007022888,0.0000028881545,0.000023615976,0.000008679491,0.0000047335748,0.0002916569,0.15902963,0.0019575518,0.033036374,0.000016965883,0.80561715],"study_design_scores_gemma":[0.00019458153,0.00009513331,0.00007738237,0.00009110544,0.000009938367,0.000032064654,8.319029e-8,0.5033466,0.005865591,0.4696242,0.020077584,0.0005857089],"about_ca_topic_score_codex":0.0000023804455,"about_ca_topic_score_gemma":0.000013861516,"teacher_disagreement_score":0.8050314,"about_ca_system_score_codex":0.00012795672,"about_ca_system_score_gemma":0.00034437422,"threshold_uncertainty_score":0.9999736},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039256795,0.00008007145,0.99669063,0.00018125921,0.0010202364,0.00020003437,0.000014057593,0.0000633396,0.0013577892],"genre_scores_gemma":[0.9783801,0.00007010605,0.020690057,0.0002884454,0.00024418216,0.0000035041633,0.00005585082,0.000022689206,0.0002451042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748015,0.00005421145,0.0005544563,0.00069269387,0.00088933774,0.0003291397],"domain_scores_gemma":[0.9982282,0.00033943664,0.000527435,0.00046791017,0.00035588088,0.00008113671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072846207,0.00029533906,0.0002767679,0.00049980124,0.00031893258,0.00049089704,0.0017591945,0.00014775057,0.000054784727],"category_scores_gemma":[0.00011256612,0.00023995657,0.00009665269,0.00042690925,0.00049409055,0.00078359345,0.0009937529,0.00043864507,0.000036386544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054483855,0.0001553972,0.00008818965,0.00013240305,0.00009482895,0.000018146446,0.006904719,0.005294956,0.0018505853,0.0518689,0.00009654139,0.93344086],"study_design_scores_gemma":[0.00036725926,0.0002442479,0.00056162913,0.00044680727,0.000027064432,0.000038234022,0.0000038343615,0.95504445,0.007203248,0.03451038,0.0010705492,0.0004823112],"about_ca_topic_score_codex":0.000012179949,"about_ca_topic_score_gemma":0.00005293669,"teacher_disagreement_score":0.97798747,"about_ca_system_score_codex":0.00013102141,"about_ca_system_score_gemma":0.00021146411,"threshold_uncertainty_score":0.9785145},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021521657,0.0010912488,0.9944986,0.00076782977,0.0007911882,0.00033749128,8.5704164e-7,0.00033602913,0.002155227],"genre_scores_gemma":[0.26008686,0.000040257662,0.7377136,0.001286031,0.00032779924,0.000013814796,0.000010476257,0.00003101103,0.0004901837],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99650216,0.000059014023,0.00053982966,0.0013491231,0.0010450004,0.0005048848],"domain_scores_gemma":[0.99786115,0.00048350063,0.00030968446,0.00097621436,0.00025661394,0.000112851456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010302854,0.00042478225,0.0004536969,0.0021640176,0.00014018848,0.00063937344,0.0028458026,0.00046122444,0.000016888522],"category_scores_gemma":[0.0005713202,0.00038185087,0.00007880479,0.0021110787,0.00023731185,0.0007382637,0.0008806926,0.0009188675,0.000049102076],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040988184,0.000017497592,0.000055788998,0.00003358796,0.0000023493849,0.000053891792,0.00030579194,0.0020654402,0.00022246168,0.11218943,0.00003219071,0.88501745],"study_design_scores_gemma":[0.0002002438,0.00018600414,0.00007151545,0.000446349,0.000004396991,0.000059662918,4.7661953e-8,0.43702933,0.0047374265,0.5553485,0.00124846,0.00066805753],"about_ca_topic_score_codex":0.00006809467,"about_ca_topic_score_gemma":0.00008437441,"teacher_disagreement_score":0.8843494,"about_ca_system_score_codex":0.0006162328,"about_ca_system_score_gemma":0.00043454842,"threshold_uncertainty_score":0.9998633},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009978448,0.00012924382,0.99686843,0.0012822807,0.0008663278,0.0005354416,0.000034110522,0.00003549416,0.00014885965],"genre_scores_gemma":[0.13488048,0.0000105446425,0.86410457,0.0007383565,0.0001581512,0.000043107964,0.000016235577,0.000009809636,0.00003872014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778664,0.000038455346,0.0005113652,0.0007726668,0.00056560047,0.0003252818],"domain_scores_gemma":[0.9972728,0.0013782553,0.0003138435,0.0007561988,0.00022901193,0.00004991579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013440304,0.00022275427,0.00027763646,0.0010862687,0.00017257215,0.00019405382,0.0021696782,0.00018835098,0.000008311209],"category_scores_gemma":[0.00022119712,0.00018283645,0.00011187018,0.0010306684,0.00047962638,0.00026125304,0.0002577521,0.00044095103,0.000005531765],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026557761,0.000105588595,0.0000064993956,0.000035157365,0.0000033985173,0.0000030648202,0.0011645803,0.0058466694,0.00015144954,0.008314146,0.000008069561,0.9843587],"study_design_scores_gemma":[0.00030683086,0.00008779533,0.00046163352,0.00021669966,0.000007538023,0.000021720489,8.967512e-7,0.91438794,0.0005066389,0.08291087,0.0008079732,0.00028345486],"about_ca_topic_score_codex":0.000067704575,"about_ca_topic_score_gemma":0.00020645629,"teacher_disagreement_score":0.98407525,"about_ca_system_score_codex":0.0001798295,"about_ca_system_score_gemma":0.00035686695,"threshold_uncertainty_score":0.7455854},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045498725,0.003981096,0.98526365,0.0003238292,0.0022225059,0.000430328,0.0000021317492,0.00029005363,0.007031445],"genre_scores_gemma":[0.37662533,0.00027263517,0.6181162,0.0013786588,0.000779055,0.000031838674,0.000001934513,0.000057443147,0.002736929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953844,0.000042696745,0.00060690456,0.0020787395,0.00093316915,0.0009541126],"domain_scores_gemma":[0.9963217,0.00048322935,0.0003140247,0.0019579295,0.00064709067,0.00027603508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008898806,0.0007678248,0.0008287689,0.00068824366,0.00062978105,0.0007097674,0.0032157288,0.00038987864,0.000023820785],"category_scores_gemma":[0.00020304546,0.00062163686,0.0002102307,0.00050361396,0.00089649815,0.0011230821,0.0030745051,0.0008946092,0.00016919446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031287404,0.00005795815,0.000013323427,0.00013207557,0.00005501062,0.004055199,0.0077878037,0.21511173,0.00020927795,0.10449925,0.00033829888,0.66773695],"study_design_scores_gemma":[0.0001568557,0.00008503499,0.0000026449468,0.00024918796,0.0000098925675,0.0012923095,8.33949e-7,0.77999353,0.0003173144,0.21702357,0.00023900422,0.00062981056],"about_ca_topic_score_codex":0.000023367573,"about_ca_topic_score_gemma":0.00006989909,"teacher_disagreement_score":0.6671071,"about_ca_system_score_codex":0.00038390709,"about_ca_system_score_gemma":0.0005848504,"threshold_uncertainty_score":0.9996235},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3563686,0.000045151042,0.64282894,0.0000709865,0.00014559709,0.00022480279,0.000013416103,0.00002320993,0.00027929217],"genre_scores_gemma":[0.9107556,0.0000014898535,0.08900168,0.00018261123,0.000039242826,0.000005653149,0.000005625229,0.0000073023357,8.160003e-7],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99865466,0.000014231114,0.00027502456,0.00039897297,0.00032554407,0.0003315878],"domain_scores_gemma":[0.99942714,0.000064362896,0.00007823183,0.00022343079,0.00010581582,0.0001009999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019303194,0.0001584515,0.00022353412,0.000752989,0.000033227363,0.00005654536,0.00023790028,0.000046762903,0.000007027531],"category_scores_gemma":[0.000026389635,0.00013247445,0.00006934585,0.0018885427,0.00052349956,0.0007586625,0.000098649354,0.00016454411,0.000003370829],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112529924,0.0004207026,0.3358906,0.000029300812,0.0000108552595,0.000049084785,0.003079506,0.0010203724,0.0012103384,0.000025185556,0.0000014304969,0.6581501],"study_design_scores_gemma":[0.0021792292,0.00070348504,0.91970867,0.00049014715,0.000017438697,0.0005546712,0.000041647363,0.057103463,0.015869468,0.0029949457,0.0000031752777,0.00033367562],"about_ca_topic_score_codex":0.00010965918,"about_ca_topic_score_gemma":0.000056733545,"teacher_disagreement_score":0.6578164,"about_ca_system_score_codex":0.00004122425,"about_ca_system_score_gemma":0.000074740965,"threshold_uncertainty_score":0.54021513},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006235166,0.0002368376,0.9935171,0.0017152043,0.001837543,0.00042766854,0.000006064298,0.0003639578,0.0012720986],"genre_scores_gemma":[0.37568885,0.000046973186,0.6169544,0.0056848433,0.00092959474,0.000012979429,0.000008552021,0.00006905649,0.00060472585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943839,0.00007465272,0.00079249154,0.0024507425,0.0012923651,0.0010058618],"domain_scores_gemma":[0.9959876,0.00034956052,0.0003743723,0.0025883745,0.00041074856,0.0002893567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090742146,0.0007885981,0.0007863781,0.0007576025,0.00037907684,0.0008439506,0.004380165,0.00048408832,0.00006895983],"category_scores_gemma":[0.0000905553,0.0007055665,0.00016391934,0.0006246332,0.0003409257,0.0003672205,0.0017456382,0.0008113262,0.00011107655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000953898,0.000021451213,0.000052954532,0.00007349394,0.000018465036,0.0001670853,0.00066196005,0.090417415,0.0006826712,0.0056305327,0.000057700858,0.9022067],"study_design_scores_gemma":[0.00024984483,0.0002550771,0.00003739023,0.00035648493,0.0000114538625,0.0005459192,6.316719e-8,0.94188654,0.0030800372,0.044989217,0.007635419,0.0009525651],"about_ca_topic_score_codex":0.000062490006,"about_ca_topic_score_gemma":0.00038863375,"teacher_disagreement_score":0.9012542,"about_ca_system_score_codex":0.0003812688,"about_ca_system_score_gemma":0.0005167028,"threshold_uncertainty_score":0.99953955},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011344656,0.0009522898,0.9930947,0.0021790876,0.0006590588,0.0012023493,0.000021198792,0.000183184,0.0005736608],"genre_scores_gemma":[0.2078246,0.0003535272,0.7665995,0.021866886,0.0019400101,0.0006302516,0.0001255477,0.0001187673,0.0005409159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707735,0.000021871445,0.00038862802,0.0014310222,0.00055705005,0.0005240982],"domain_scores_gemma":[0.99804264,0.00038564732,0.00024858373,0.0006968875,0.0004320041,0.00019425574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003965236,0.00045749688,0.00037469435,0.0006083259,0.00039274164,0.00060212665,0.0015992228,0.0002933004,0.000028091783],"category_scores_gemma":[0.0000064450965,0.00042207778,0.00008450571,0.00044672945,0.00026694115,0.0006881701,0.00069592014,0.0004446118,0.0000850288],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013611594,0.000044754688,0.0001644267,0.0005263049,0.000027954206,0.0000047418953,0.0036758773,0.0008063898,0.001642884,0.040228568,0.000043708642,0.9528208],"study_design_scores_gemma":[0.00053090625,0.00013526464,0.00035837136,0.00029217577,0.000024898094,0.00008432564,0.0000014018517,0.8721204,0.0004834663,0.10542511,0.019786399,0.0007572818],"about_ca_topic_score_codex":0.000064143554,"about_ca_topic_score_gemma":0.0006986909,"teacher_disagreement_score":0.9520635,"about_ca_system_score_codex":0.00011493211,"about_ca_system_score_gemma":0.0002709508,"threshold_uncertainty_score":0.9998231},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012063566,0.00015980238,0.77928066,0.0006855649,0.00015712882,0.0008766179,0.000030208541,0.00006568546,0.21753797],"genre_scores_gemma":[0.49284697,0.00004682725,0.50045395,0.000768214,0.0003358779,0.00004591883,0.000010784064,0.000100386795,0.005391111],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796563,0.00003033203,0.00040392065,0.0004832834,0.0008350897,0.00028176646],"domain_scores_gemma":[0.9961789,0.0027178882,0.00033203265,0.0004332354,0.00027789123,0.000060056598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040794906,0.00029856226,0.00044502283,0.000136188,0.00015939037,0.00008199028,0.0006106599,0.00011710233,0.00032247437],"category_scores_gemma":[0.00050674233,0.00017782762,0.00009410031,0.000299555,0.0007265878,0.00011351686,0.0003195293,0.00044368714,0.00005659174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004022928,0.0006346541,0.0031307111,0.0002800957,0.00036816823,0.000117004274,0.015880447,0.000341692,0.00007176987,0.4064152,0.00029757957,0.57242244],"study_design_scores_gemma":[0.00017610945,0.00005723073,0.00036551477,0.00047146002,0.00003898024,0.000034488447,0.0000045118127,0.005748931,0.00084848783,0.99187106,0.00012025828,0.0002629911],"about_ca_topic_score_codex":0.000018519704,"about_ca_topic_score_gemma":0.000069230475,"teacher_disagreement_score":0.58545583,"about_ca_system_score_codex":0.00011993686,"about_ca_system_score_gemma":0.0001000079,"threshold_uncertainty_score":0.72516},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058290727,0.00007270483,0.9979134,0.0003161391,0.00038549432,0.0008264463,0.00002728466,0.0003369135,0.00006330121],"genre_scores_gemma":[0.08831824,0.000047974114,0.9107474,0.0003491227,0.00020436465,0.00007742574,0.00005252279,0.00003557549,0.00016734455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966026,0.000025401207,0.0006438651,0.001324229,0.0008656568,0.00053825707],"domain_scores_gemma":[0.99799603,0.00014638783,0.00027492215,0.0013472452,0.00012093015,0.000114505005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011439952,0.00052089634,0.0005903131,0.0012245736,0.00020787012,0.00037181817,0.0020349894,0.00038457068,0.000004438807],"category_scores_gemma":[0.00001618021,0.0005270387,0.00027247125,0.0005681986,0.00018667702,0.0006836096,0.00027946493,0.00041654307,0.000007515221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001862446,0.000009273768,0.0000025392671,0.000017628508,0.000024656223,0.0000011716713,0.0003295299,0.6278631,0.00026349653,0.058581766,0.000009222529,0.31289577],"study_design_scores_gemma":[0.00016794285,0.00009552889,0.000009371699,0.000056314246,0.000057783094,0.000005625079,7.942647e-9,0.9726672,0.0031073408,0.018236771,0.0050364686,0.00055961974],"about_ca_topic_score_codex":0.000004754687,"about_ca_topic_score_gemma":0.00003367396,"teacher_disagreement_score":0.34480414,"about_ca_system_score_codex":0.0003929407,"about_ca_system_score_gemma":0.00014665168,"threshold_uncertainty_score":0.9997181},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21047644,0.000104845705,0.7879072,0.0005912646,0.0001867983,0.0006123892,0.000004764461,0.00010835803,0.000007957294],"genre_scores_gemma":[0.64092684,0.0000019225924,0.35849237,0.00033033412,0.00018324735,0.000051534193,0.000007598695,0.0000060292673,1.3038661e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989905,0.0000148298805,0.00016143861,0.00026708827,0.00028587165,0.00028027617],"domain_scores_gemma":[0.9992426,0.00016166888,0.000058739966,0.00030772036,0.00013910182,0.00009017749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005870876,0.00009197962,0.00013185338,0.00025545075,0.000108424,0.000030371977,0.00015673906,0.000036489062,0.0000020299995],"category_scores_gemma":[0.00009742753,0.00007499722,0.000051136674,0.00088215666,0.00013530235,0.00019314986,0.000030736777,0.00012817617,0.0000010986417],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019852308,0.0002644068,0.014143015,0.0000716393,0.0000035099602,8.908922e-7,0.0003766598,0.001651504,0.033296153,0.00023097164,0.000011195641,0.9499302],"study_design_scores_gemma":[0.001388492,0.00039019328,0.13069883,0.0002621786,0.00006548059,0.00023834752,0.0000049274445,0.7230835,0.13764673,0.003932645,0.0019401768,0.00034847684],"about_ca_topic_score_codex":0.000003425725,"about_ca_topic_score_gemma":0.000001390259,"teacher_disagreement_score":0.94958174,"about_ca_system_score_codex":0.000097263015,"about_ca_system_score_gemma":0.00006858481,"threshold_uncertainty_score":0.30582976},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14305902,0.0033432455,0.7959612,0.0036620344,0.0026998087,0.005256711,0.0007788942,0.00016135935,0.04507772],"genre_scores_gemma":[0.9880156,0.000096025404,0.010706127,0.00019489665,0.00011522369,0.00001919957,0.000050490555,0.000022434508,0.0007800058],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983451,0.000010501609,0.00045709894,0.00058155775,0.00039726577,0.00020851241],"domain_scores_gemma":[0.9986623,0.0000965269,0.00036026482,0.0004868545,0.000308282,0.000085749525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024332521,0.00024010013,0.00050622673,0.00035527264,0.000030441635,0.000031783373,0.00020238283,0.000116907795,0.000020029944],"category_scores_gemma":[0.00008662575,0.00019686847,0.00008502509,0.00016167102,0.00044672855,0.00016139897,0.00011945562,0.0001454301,0.0000070575866],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059210556,0.0007532405,0.011330602,0.0010544615,0.0000948071,0.000436616,0.0070182136,0.004364731,0.07658138,0.0025468755,0.0005485508,0.8946784],"study_design_scores_gemma":[0.001672017,0.0061482773,0.010263784,0.0035554855,0.00019317288,0.0001384232,0.0000015265858,0.00061583065,0.9454311,0.022877341,0.008303155,0.00079986354],"about_ca_topic_score_codex":0.000053170923,"about_ca_topic_score_gemma":0.00001265525,"teacher_disagreement_score":0.8938786,"about_ca_system_score_codex":0.00035944482,"about_ca_system_score_gemma":0.0002989735,"threshold_uncertainty_score":0.8028063},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004436732,0.00006801476,0.99002707,0.00004666481,0.001191096,0.00068076927,0.0000014002004,0.00008442671,0.0034638261],"genre_scores_gemma":[0.64977634,5.723333e-7,0.34954783,0.00005915703,0.00016132653,0.000028055598,0.000012889544,0.000031320673,0.0003825045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726623,0.00039227764,0.000631215,0.00092361256,0.00034802078,0.0004386617],"domain_scores_gemma":[0.99779785,0.0009057132,0.0005285015,0.0004727757,0.00024730887,0.000047875397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005084415,0.00032334647,0.00050712086,0.0009497909,0.00015448734,0.000043686923,0.0005406998,0.00031621548,0.000043844957],"category_scores_gemma":[0.00029838493,0.0003127347,0.00006616735,0.00044172132,0.0003008266,0.00011423302,0.000071968534,0.0010692072,0.0000065965905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_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.00010697558,0.00077415694,0.0001557353,0.00002653106,0.000013326426,0.020130947,0.42613134,0.0031714856,0.07659335,0.0000020256082,0.47277507],"study_design_scores_gemma":[0.010239756,0.014864576,0.017468557,0.0136894,0.00013297131,0.000099213314,0.0002203301,0.7783334,0.062077273,0.0906505,0.007119512,0.0051044696],"about_ca_topic_score_codex":0.00006891626,"about_ca_topic_score_gemma":0.000004886029,"teacher_disagreement_score":0.6453396,"about_ca_system_score_codex":0.0008232909,"about_ca_system_score_gemma":0.00044771348,"threshold_uncertainty_score":0.99993247},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041654548,0.0009886498,0.99603355,0.00017656691,0.0016193369,0.00060378335,0.00017389124,0.00014746758,0.00021508911],"genre_scores_gemma":[0.0022127028,0.000026842208,0.9957531,0.0005675745,0.0012342634,0.00003122249,0.000045365883,0.00004681375,0.00008211592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616194,0.00002082845,0.00059412385,0.0015186969,0.00077824557,0.00092616596],"domain_scores_gemma":[0.99714273,0.00046048773,0.00042422375,0.0014501446,0.00027124124,0.0002511548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007562794,0.0005762348,0.0005498345,0.00073278946,0.00050834235,0.000756365,0.0032573184,0.0003198209,0.000012316072],"category_scores_gemma":[0.000050295297,0.00053543603,0.00016381413,0.00063139957,0.0004052103,0.0007899712,0.0012241707,0.00048770272,0.000010585901],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.6513456e-7,0.00001805662,0.000008883901,0.000018344028,0.000011254911,0.000007524904,0.000483175,0.0036486874,0.00007108713,0.006548402,0.000036277936,0.98914766],"study_design_scores_gemma":[0.00022663201,0.00008220811,0.000032184154,0.00016262945,0.00002077128,0.0000890845,6.328273e-7,0.95028055,0.00044485767,0.043103952,0.0048839813,0.00067249424],"about_ca_topic_score_codex":0.00005508636,"about_ca_topic_score_gemma":0.000018642982,"teacher_disagreement_score":0.98847514,"about_ca_system_score_codex":0.00032300386,"about_ca_system_score_gemma":0.00048108384,"threshold_uncertainty_score":0.9997097},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041414556,0.00012608925,0.95376295,0.000061610524,0.011896195,0.00072284444,0.0000146520415,0.00016659447,0.032834925],"genre_scores_gemma":[0.952937,0.000023273607,0.031216785,0.00061139197,0.0010176302,0.000102242026,0.000051145926,0.000078275734,0.013962224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747366,0.000048486516,0.00071721623,0.0009118163,0.000408952,0.0004398473],"domain_scores_gemma":[0.9979813,0.00024284518,0.00050754624,0.0007133492,0.00043832647,0.00011661145],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007766099,0.00040789685,0.00046931437,0.0013363616,0.00034086793,0.00020439412,0.000855104,0.0004169437,0.00069603237],"category_scores_gemma":[0.000070503476,0.00037851513,0.0001528532,0.00031735434,0.00028526213,0.00032941776,0.00015432593,0.0007440972,0.00024775186],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016339011,0.0002694045,0.00022889722,0.0003409428,0.000152694,0.00002726852,0.009194663,0.015145378,0.00022341675,0.09485798,0.00064528483,0.8787507],"study_design_scores_gemma":[0.003460532,0.0017231433,0.007356802,0.001638572,0.00012208665,0.00034036604,0.00002048906,0.8540383,0.0013848273,0.009063412,0.118077725,0.0027737266],"about_ca_topic_score_codex":0.00012652259,"about_ca_topic_score_gemma":0.000073864874,"teacher_disagreement_score":0.9525229,"about_ca_system_score_codex":0.00040955536,"about_ca_system_score_gemma":0.00012560467,"threshold_uncertainty_score":0.99986666},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019604682,0.00014665972,0.995783,0.0002265608,0.00035348802,0.0014220172,0.000013178862,0.00035076347,0.0016847426],"genre_scores_gemma":[0.06579792,0.000012543517,0.93209946,0.0012948733,0.0002464637,0.00010173153,0.000044851444,0.000046960104,0.00035517896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620044,0.000033499007,0.00056553434,0.0016766286,0.00080771616,0.00071619527],"domain_scores_gemma":[0.99768794,0.00034554722,0.0003442682,0.0011242942,0.00032459604,0.00017337213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007686507,0.0005904622,0.0005278989,0.00057867245,0.00042444144,0.0006019955,0.0024211847,0.00032038183,0.000015870897],"category_scores_gemma":[0.000045693545,0.0005350682,0.00018497242,0.00038805787,0.00048858323,0.0008967785,0.0007821136,0.0006791165,0.000023352655],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009226775,0.00006249345,0.0000019496547,0.00013164246,0.000009322253,0.000009985437,0.0002124467,0.022335546,0.0006832564,0.00502118,0.00006483036,0.97145814],"study_design_scores_gemma":[0.0004418953,0.00045618342,0.0000062740846,0.00042322886,0.00001317039,0.000022884393,5.554965e-7,0.67311114,0.029950704,0.2932983,0.0013501333,0.00092552573],"about_ca_topic_score_codex":0.0000223746,"about_ca_topic_score_gemma":0.000007500833,"teacher_disagreement_score":0.9705326,"about_ca_system_score_codex":0.00038661493,"about_ca_system_score_gemma":0.00022706154,"threshold_uncertainty_score":0.9997101},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027234224,0.003120825,0.99292433,0.00008113228,0.002537123,0.00046233015,0.0000019307072,0.00018266002,0.0004173383],"genre_scores_gemma":[0.01728888,0.00039694385,0.9815868,0.0003170252,0.000289535,0.000009386639,0.000004817915,0.000030060679,0.00007653814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964273,0.00007797974,0.0006019195,0.0013116562,0.0009836276,0.0005975457],"domain_scores_gemma":[0.99730384,0.00045847852,0.0004212077,0.0013932167,0.00019533759,0.000227892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022178688,0.00046915925,0.0004216113,0.00081734563,0.0002982034,0.00051358336,0.0021407062,0.0004600877,0.000011743325],"category_scores_gemma":[0.00032832962,0.00042443816,0.00008226838,0.0006881568,0.0005200938,0.0015949805,0.0012688106,0.00074660196,0.00006717485],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004279948,0.00001976894,0.00024871746,0.00002127765,0.0000038983007,0.0000061970245,0.0004439552,0.0012466374,0.000052326268,0.087881364,0.0000059090953,0.91006565],"study_design_scores_gemma":[0.00030774463,0.00009383926,0.0047994927,0.0002882617,0.000011982282,0.00008044018,1.0662874e-7,0.8770686,0.00055183884,0.11526041,0.0009258835,0.00061139907],"about_ca_topic_score_codex":0.000015708942,"about_ca_topic_score_gemma":0.000019340805,"teacher_disagreement_score":0.9094543,"about_ca_system_score_codex":0.00028840458,"about_ca_system_score_gemma":0.0001747143,"threshold_uncertainty_score":0.99982077},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027999504,0.0027678877,0.963159,0.00059804705,0.0010148091,0.00031123732,0.0000074162012,0.000033490647,0.0041085733],"genre_scores_gemma":[0.96005636,0.00020085335,0.037025694,0.0007290859,0.00057261507,0.00001956405,0.000020933145,0.00003318208,0.0013416836],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981869,0.000021990307,0.0002671084,0.0008569764,0.0002713972,0.00039562068],"domain_scores_gemma":[0.99918014,0.000089248046,0.0001097186,0.00047861555,0.00005899611,0.00008326028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003044216,0.00028229298,0.00029305374,0.000250475,0.00007328624,0.00009724912,0.00072640536,0.0004031262,0.00004863553],"category_scores_gemma":[0.00016046049,0.00023693431,0.00007427185,0.0001294517,0.0008112831,0.000008547369,0.00050471124,0.00038511195,0.000031170686],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015856702,0.00003657186,0.00047876913,0.00004039677,0.000017652252,0.000042077678,0.00054746796,0.0006313902,0.016164094,0.00096343015,0.00014696801,0.9809153],"study_design_scores_gemma":[0.0077188206,0.005221923,0.027819917,0.00854572,0.00013826697,0.0007084808,0.00013193635,0.06776855,0.29285222,0.48079214,0.09608558,0.01221647],"about_ca_topic_score_codex":0.000037505884,"about_ca_topic_score_gemma":0.00017519614,"teacher_disagreement_score":0.96869886,"about_ca_system_score_codex":0.000050002553,"about_ca_system_score_gemma":0.0001601282,"threshold_uncertainty_score":0.9661901},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024361676,0.0006303014,0.9939011,0.00029415629,0.0007079994,0.00046198827,0.0000063166485,0.00008465082,0.0038891772],"genre_scores_gemma":[0.19189592,0.0007056023,0.8030826,0.0015758664,0.0004122573,0.00007360164,0.000046377052,0.00006878076,0.0021389995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972406,0.00004019449,0.0004898473,0.00078306434,0.0009661685,0.00048010916],"domain_scores_gemma":[0.9981852,0.00016383671,0.0002997751,0.0009122694,0.00026076598,0.00017813258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007450655,0.0003097798,0.00037270156,0.0005374961,0.00012172205,0.00021984095,0.002115987,0.00021012366,0.00006254511],"category_scores_gemma":[0.00003700822,0.00028381744,0.00008864324,0.0005393076,0.0003814602,0.0011931916,0.0007824291,0.00038209406,0.00004848512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032561554,0.00007786678,0.000024615783,0.000042021547,0.000008822113,0.0000051326447,0.002039765,0.057372954,0.00034509585,0.007701184,0.00035229293,0.932027],"study_design_scores_gemma":[0.00041549353,0.00034524896,0.000017858527,0.00024225561,0.0000069500234,0.0000121788335,5.411048e-7,0.93686324,0.007701876,0.04421941,0.0095370645,0.0006378668],"about_ca_topic_score_codex":0.000011578711,"about_ca_topic_score_gemma":0.000014326891,"teacher_disagreement_score":0.93138915,"about_ca_system_score_codex":0.00011263621,"about_ca_system_score_gemma":0.000263818,"threshold_uncertainty_score":0.9999614},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021240408,0.00012050345,0.9944423,0.0009110932,0.0011207686,0.00080413773,0.0000064518804,0.0013843706,0.0009979998],"genre_scores_gemma":[0.005630824,0.000010055451,0.9876758,0.0057716654,0.0002888256,0.000027778868,0.0000134610045,0.000043613953,0.00053801946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542576,0.00010145261,0.0007887805,0.001455565,0.0015152142,0.00071322935],"domain_scores_gemma":[0.99719894,0.000503343,0.0004991785,0.0011608243,0.00037965307,0.00025805246],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010208776,0.000581396,0.0005351935,0.0010139094,0.00028132697,0.0011051027,0.0027603277,0.0001982899,0.00017311519],"category_scores_gemma":[0.00014179666,0.0005467014,0.00011535513,0.00065046607,0.0008762437,0.0016797883,0.0011528541,0.00064049906,0.00009973382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069831167,0.00007193155,0.000039467814,0.00017606794,0.000038159622,0.00026472614,0.0030663616,0.03822951,0.020320402,0.013439064,0.0013780354,0.9229693],"study_design_scores_gemma":[0.00030254008,0.00010495146,0.000020912392,0.00035343255,0.0000071103505,0.0001028898,8.072247e-7,0.9178722,0.024208149,0.056347545,0.00008243848,0.000597044],"about_ca_topic_score_codex":0.00018842363,"about_ca_topic_score_gemma":0.000025718382,"teacher_disagreement_score":0.9223722,"about_ca_system_score_codex":0.00062427716,"about_ca_system_score_gemma":0.0007044239,"threshold_uncertainty_score":0.9999319},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007234102,0.00019265887,0.9966209,0.00002377414,0.00030838573,0.000868771,0.000027044327,0.0003868564,0.0014992619],"genre_scores_gemma":[0.29228133,0.000009871554,0.70721173,0.00007351201,0.00022652817,0.00002878263,0.000013609555,0.00011129729,0.000043350898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747145,0.00004653205,0.000366943,0.00087691244,0.00048213874,0.0007560508],"domain_scores_gemma":[0.9982253,0.00059023633,0.00009151862,0.0006366999,0.00028687675,0.00016937942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010173775,0.0004929938,0.00052149745,0.0004617314,0.00021443219,0.00021297041,0.00088643335,0.00027457386,0.000028232944],"category_scores_gemma":[0.00007321212,0.0004396877,0.000075993514,0.00035611328,0.00023735796,0.0003447638,0.00015418247,0.00066784123,0.000006272916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003264829,0.000022357093,0.0000592693,0.00011537517,0.000033990484,0.000017020893,0.0015762693,0.8874986,0.00005789794,0.0029876379,0.0000020895043,0.10759683],"study_design_scores_gemma":[0.0005840006,0.00044951466,0.00002773367,0.00064790115,0.000027685033,0.000019677474,9.496562e-7,0.98565465,0.00083804317,0.011138491,0.00004228426,0.0005690652],"about_ca_topic_score_codex":0.000008461965,"about_ca_topic_score_gemma":0.00003856129,"teacher_disagreement_score":0.292209,"about_ca_system_score_codex":0.00029795198,"about_ca_system_score_gemma":0.00029558485,"threshold_uncertainty_score":0.9998055},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25391605,0.00015593848,0.7389327,0.0021205463,0.00081563223,0.0007603545,0.00032921226,0.00004440614,0.0029251315],"genre_scores_gemma":[0.98223597,0.000005424396,0.017021654,0.00013267437,0.00030669957,0.000004211225,0.000037880603,0.0000013199519,0.0002541632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986557,0.00001689733,0.00030088346,0.0003456081,0.00048691113,0.00019402095],"domain_scores_gemma":[0.9993012,0.0003240824,0.00015937215,0.00008056629,0.0000931009,0.000041693143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001536774,0.00016684394,0.00019765148,0.000032736385,0.00019488798,0.00006302682,0.00063069566,0.00011111663,0.00037117448],"category_scores_gemma":[0.0000060062575,0.0000644752,0.000104716084,0.00017016966,0.00032166313,0.00010267631,0.00016407359,0.00021902632,0.000009005952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004884521,0.00004291995,0.005254083,0.000019859335,0.00002819266,6.4861183e-7,0.0003818938,0.65874845,0.001410958,0.0041013616,0.000009015626,0.32999772],"study_design_scores_gemma":[0.00017574825,0.00018209279,0.013679347,0.00036617453,0.000025682033,0.0000066907487,0.0000012484791,0.57339835,0.001620467,0.40891474,0.001185025,0.00044445085],"about_ca_topic_score_codex":0.00004062092,"about_ca_topic_score_gemma":0.00011945692,"teacher_disagreement_score":0.72831994,"about_ca_system_score_codex":0.000050773775,"about_ca_system_score_gemma":0.00005891845,"threshold_uncertainty_score":0.40641004},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008698065,0.0012188565,0.98314166,0.00036196306,0.00080038205,0.00023698928,0.0000034014822,0.00013880664,0.013228128],"genre_scores_gemma":[0.64307356,0.00064091396,0.3533124,0.001883677,0.0003837496,0.000018524259,0.000010582038,0.000049359136,0.0006272712],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972299,0.00007565186,0.00039599134,0.0012597027,0.00045026507,0.00058849604],"domain_scores_gemma":[0.9985306,0.00030943885,0.0001967155,0.00075198844,0.000076973956,0.00013427314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011463116,0.00039473912,0.00041764518,0.0005184243,0.0002365294,0.00042305992,0.0015725992,0.00025685522,0.000025895371],"category_scores_gemma":[0.000093604904,0.00035244843,0.00005873306,0.00043695798,0.0006159729,0.00065208325,0.0012344371,0.0009167781,0.00003276956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001117095,0.000032276563,0.0004551414,0.000044963806,0.000008725101,0.00019449783,0.0032988167,0.015309601,0.000029433913,0.12058626,0.000036966238,0.85999215],"study_design_scores_gemma":[0.00027662766,0.00017554601,0.0012814938,0.00038424396,0.000005524002,0.00012147625,6.9605585e-7,0.07785743,0.00018014862,0.91575176,0.0032732033,0.0006918437],"about_ca_topic_score_codex":0.00004465257,"about_ca_topic_score_gemma":0.000037798818,"teacher_disagreement_score":0.8593003,"about_ca_system_score_codex":0.00013037841,"about_ca_system_score_gemma":0.0002576572,"threshold_uncertainty_score":0.9998928},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015877892,0.00028076943,0.98922473,0.0006362489,0.0015823207,0.00036330774,9.1363023e-7,0.00021959876,0.0075333063],"genre_scores_gemma":[0.033631947,0.000025134788,0.96045256,0.0022503047,0.0005400791,0.000011898833,0.000005253129,0.000047857902,0.0030349754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963207,0.000066152774,0.0003905672,0.0014824957,0.0011196025,0.0006204725],"domain_scores_gemma":[0.9974994,0.00035991354,0.00025264543,0.0013698185,0.00033793447,0.00018029189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007185097,0.0005350895,0.00048396253,0.0007794997,0.00032105003,0.0008545451,0.0022898265,0.00029838557,0.00008138854],"category_scores_gemma":[0.00002516465,0.0003929041,0.00009798376,0.0006959167,0.000509335,0.000972671,0.00083820673,0.0008009202,0.00014947398],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001826944,0.000023488885,0.000016405917,0.000020765934,0.000009798263,0.000085978194,0.00024497823,0.000929466,0.0008200924,0.014618786,0.000060142607,0.98315185],"study_design_scores_gemma":[0.000930465,0.0008290808,0.00037400037,0.0005509198,0.000024142284,0.0002006332,1.16219624e-7,0.6713077,0.0031127546,0.31383687,0.007622439,0.0012108567],"about_ca_topic_score_codex":0.00003143341,"about_ca_topic_score_gemma":0.000018030709,"teacher_disagreement_score":0.981941,"about_ca_system_score_codex":0.00019039382,"about_ca_system_score_gemma":0.0003563068,"threshold_uncertainty_score":0.9998523},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004110212,0.00007310131,0.992827,0.000536164,0.0020709536,0.0003541877,0.000004315633,0.00046009722,0.0036330908],"genre_scores_gemma":[0.22021368,0.000031067782,0.772641,0.0053603095,0.0015339539,0.0000150143605,0.000012313764,0.00005260712,0.00014005897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575466,0.0000860466,0.00048568743,0.0019786132,0.0011501116,0.0005448618],"domain_scores_gemma":[0.9954652,0.00068539527,0.00032319687,0.0031530731,0.00022648876,0.00014664013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017387703,0.000487096,0.00041697413,0.0010555198,0.00040087642,0.0007008559,0.004878709,0.00045273255,0.0000148143445],"category_scores_gemma":[0.00020645246,0.00046160212,0.00009108799,0.0006989317,0.00038719116,0.0007884693,0.0016988695,0.0009516223,0.00004629775],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012455494,0.000014810447,0.000002397204,0.000012648741,0.000003275493,0.000019526095,0.00010994333,0.003708361,0.00012931558,0.0015724852,0.000028337856,0.99438643],"study_design_scores_gemma":[0.00015345491,0.00068793434,0.000020938514,0.00050520286,0.000007199313,0.000034092387,4.5527575e-8,0.956122,0.007702453,0.012714417,0.021476557,0.0005757369],"about_ca_topic_score_codex":0.000036474084,"about_ca_topic_score_gemma":0.00007834409,"teacher_disagreement_score":0.9938107,"about_ca_system_score_codex":0.0002371945,"about_ca_system_score_gemma":0.00022378494,"threshold_uncertainty_score":0.9997836},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059245937,0.0005725518,0.9873009,0.0003757902,0.0015478173,0.0001884155,4.7584535e-7,0.00022028282,0.0038691848],"genre_scores_gemma":[0.5831421,0.000007456083,0.415316,0.0014469321,0.00007118743,0.000006058874,2.4880813e-7,0.000005084691,0.000004965523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968118,0.00031931425,0.0003113959,0.0011621452,0.0005447305,0.0008506043],"domain_scores_gemma":[0.99771243,0.00066405884,0.00011193276,0.0011831723,0.0001818576,0.00014652988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022052722,0.00028979493,0.00029003504,0.0001726789,0.00038876105,0.0004799211,0.0026981689,0.00012595765,0.000028502516],"category_scores_gemma":[0.0007800101,0.00022281271,0.00009623734,0.0023592485,0.000643897,0.0010407141,0.000626892,0.00037392572,0.00008665502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006227958,0.00021068433,0.0025661925,0.000018908711,0.0000076121196,0.000077846584,0.0044050356,0.03935311,0.0005710053,0.75386286,0.00003178397,0.19888875],"study_design_scores_gemma":[0.00035226278,0.00014515736,0.0020483413,0.000029865601,0.0000030560827,0.00012515926,0.0000018028231,0.2049876,0.012567279,0.77865833,0.0006366896,0.00044446037],"about_ca_topic_score_codex":0.00002341048,"about_ca_topic_score_gemma":0.00002263505,"teacher_disagreement_score":0.5772175,"about_ca_system_score_codex":0.00014887357,"about_ca_system_score_gemma":0.00035987867,"threshold_uncertainty_score":0.9086039},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049629104,0.0012929412,0.9874563,0.00019081353,0.0017342514,0.0038581684,0.000051202453,0.00019835371,0.0002550452],"genre_scores_gemma":[0.9902975,0.0000034768327,0.008864214,0.00017006497,0.00030421434,0.00019057286,0.0000046822556,0.00004018955,0.00012510426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99550897,0.00018126311,0.0012717331,0.0011841739,0.0010374853,0.00081637234],"domain_scores_gemma":[0.9943614,0.0016104131,0.0013534481,0.0018761371,0.00060217,0.00019643053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002117139,0.0005764338,0.0010704678,0.00091589923,0.00059436244,0.0006038858,0.0026902747,0.00020579534,0.000004868182],"category_scores_gemma":[0.00006001623,0.00044464137,0.00028552566,0.001272777,0.0003692774,0.0005440883,0.0010010931,0.0006126992,0.000007553885],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074048867,0.00010245384,0.0008596061,0.0005853486,0.000045070243,0.00036943756,0.040948343,0.002642304,0.0000032232,0.00026943837,0.00005527033,0.9541121],"study_design_scores_gemma":[0.0063962922,0.013205061,0.0005138674,0.010984468,0.00025159528,0.02001426,0.009443072,0.922992,0.0004651295,0.003073788,0.006785357,0.0058751255],"about_ca_topic_score_codex":0.0005474838,"about_ca_topic_score_gemma":0.0007174652,"teacher_disagreement_score":0.9853346,"about_ca_system_score_codex":0.0008030235,"about_ca_system_score_gemma":0.0008020388,"threshold_uncertainty_score":0.99980056},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007849285,0.00034635075,0.9904794,0.0020816785,0.0004921501,0.004978293,0.000007570314,0.00009867633,0.0014373645],"genre_scores_gemma":[0.3447762,0.00006613526,0.65078276,0.0021136072,0.0003491352,0.0007284399,0.000008896202,0.00004271609,0.0011320813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964817,0.00003064073,0.00050592126,0.0013586065,0.0010698828,0.0005532586],"domain_scores_gemma":[0.9968992,0.0005755447,0.00031827512,0.0014438448,0.0006265543,0.00013659876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083845836,0.00043726034,0.00042609725,0.00028480418,0.00056094467,0.00047341004,0.0030473913,0.00016721898,0.0000043103837],"category_scores_gemma":[0.00009097788,0.00033280413,0.00010530628,0.00025023983,0.0008219236,0.0007629766,0.0016062094,0.00054517004,0.000008215919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039001814,0.00006715812,0.00003444259,0.00008925889,0.000025136384,0.000013982547,0.014957058,0.11265753,0.00013122744,0.5820618,0.00005083841,0.28987256],"study_design_scores_gemma":[0.0002753125,0.00009360787,0.00022787959,0.0001016737,0.0000042565002,0.000037604277,2.4501122e-7,0.64541644,0.00032651878,0.3507543,0.0024410528,0.00032109796],"about_ca_topic_score_codex":0.000011508934,"about_ca_topic_score_gemma":0.000039189254,"teacher_disagreement_score":0.5327589,"about_ca_system_score_codex":0.00018832144,"about_ca_system_score_gemma":0.00026899631,"threshold_uncertainty_score":0.9999124},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002105439,0.0009852503,0.98989695,0.0006406813,0.0022347725,0.00035794466,0.000009194467,0.00028052705,0.005384104],"genre_scores_gemma":[0.4176876,0.0001394219,0.57345706,0.0055515035,0.0017488564,0.000021165491,0.00003218135,0.0001301834,0.0012320507],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957171,0.0000612469,0.00058400136,0.0019008323,0.0009650733,0.00077171193],"domain_scores_gemma":[0.9972145,0.0006438966,0.00031886052,0.0013842032,0.00021912622,0.000219437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008293702,0.0007298786,0.0007239291,0.0007183121,0.00038803773,0.0010356577,0.002813199,0.00039182475,0.000021889286],"category_scores_gemma":[0.000026610121,0.0006633835,0.00012683334,0.00059013464,0.0010248179,0.00083969266,0.0022248668,0.0009035126,0.000040156698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039340744,0.000058729216,0.00007498349,0.000050698105,0.000020854857,0.0002310974,0.00079325185,0.004242298,0.00005851315,0.3259346,0.00050856266,0.66802245],"study_design_scores_gemma":[0.00040276756,0.00023187703,0.00034208572,0.00027518306,0.000009657597,0.00014716585,1.4143357e-7,0.48954204,0.0005818965,0.50496525,0.0025980736,0.0009038649],"about_ca_topic_score_codex":0.000029415427,"about_ca_topic_score_gemma":0.0000133009125,"teacher_disagreement_score":0.6671186,"about_ca_system_score_codex":0.00022665344,"about_ca_system_score_gemma":0.0003174459,"threshold_uncertainty_score":0.99958175},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007067969,0.00011871498,0.9505036,0.0002550924,0.003070154,0.00035083003,0.00001412743,0.000079132915,0.04490158],"genre_scores_gemma":[0.9800135,0.000028457287,0.015375483,0.003188562,0.00038835537,0.000009036657,0.000011097269,0.000051670162,0.00093386654],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99579364,0.000032005297,0.0005020336,0.0018836587,0.00090765144,0.00088103075],"domain_scores_gemma":[0.997291,0.00047049992,0.00034847658,0.0013617886,0.00032530611,0.00020290387],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002994068,0.00073703623,0.0005800982,0.0009940414,0.00027839042,0.0010768867,0.004062212,0.00030413948,0.0000541926],"category_scores_gemma":[0.00011772,0.00065617263,0.00021700667,0.00045759356,0.00058933184,0.0018781377,0.0015578109,0.0009358549,0.00038962654],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015799841,0.00032478175,0.00021954226,0.00015254637,0.00021309659,0.00089457136,0.016433772,0.008130847,0.0088051325,0.14172505,0.0004981217,0.82244456],"study_design_scores_gemma":[0.0019436069,0.005256991,0.0012567436,0.0071466556,0.000067120905,0.00059411547,0.000015390484,0.10832972,0.46864015,0.3867141,0.01240062,0.0076347734],"about_ca_topic_score_codex":0.000041592386,"about_ca_topic_score_gemma":0.000039277234,"teacher_disagreement_score":0.9793067,"about_ca_system_score_codex":0.00037874526,"about_ca_system_score_gemma":0.00032637536,"threshold_uncertainty_score":0.99996006},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003888608,0.00041499414,0.99306947,0.00037097183,0.0007177699,0.000385708,0.000004229104,0.00007377746,0.0010744717],"genre_scores_gemma":[0.2874077,0.000018650533,0.706868,0.0046682484,0.00043983755,0.0000034507464,0.00003635477,0.0000614379,0.0004963674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975027,0.000039441467,0.00039942964,0.0007048026,0.0009275404,0.00042610322],"domain_scores_gemma":[0.9986788,0.00030730583,0.00024794132,0.00037186526,0.00019567324,0.00019840585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092823576,0.0003595532,0.000523846,0.00041367838,0.00022251501,0.00013046092,0.00030490628,0.00010882016,0.00008905726],"category_scores_gemma":[0.00011197261,0.00030043343,0.00012875842,0.00024290849,0.0004823484,0.0001818402,0.000112656824,0.0009224814,0.0000143916395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024732484,0.000021560043,0.000105131076,0.00013841738,0.000020592262,0.000081039434,0.00013608288,0.9231304,0.0011306243,0.0003060463,0.000018461837,0.074886896],"study_design_scores_gemma":[0.0006706848,0.0001129282,0.000033778004,0.0006581118,0.000081435086,0.00028054154,2.8924197e-7,0.989957,0.0010476379,0.006474148,0.0003870586,0.0002964152],"about_ca_topic_score_codex":0.00013086604,"about_ca_topic_score_gemma":0.00001090035,"teacher_disagreement_score":0.2862015,"about_ca_system_score_codex":0.00044430012,"about_ca_system_score_gemma":0.0006659424,"threshold_uncertainty_score":0.9999448},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014433463,0.00011869981,0.979907,0.0019863811,0.0013931699,0.0016936227,0.000011384241,0.00011243562,0.00034386027],"genre_scores_gemma":[0.28279483,0.000003736663,0.7136638,0.0023313246,0.00037633048,0.00008180162,0.000002742252,0.00004972611,0.0006957],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99553025,0.00007322046,0.0007320382,0.0018595529,0.000960394,0.00084454636],"domain_scores_gemma":[0.99664766,0.00028262558,0.00039416464,0.001826148,0.0005522581,0.0002971355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011335853,0.00067164795,0.000797473,0.0008174363,0.00025072353,0.00051879423,0.0031670672,0.00019859867,0.000014189274],"category_scores_gemma":[0.00016696482,0.0005184441,0.00014912689,0.00070029433,0.00028382515,0.0003831304,0.0018259478,0.00054941635,0.00002199094],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051818115,0.000084223044,0.00033086896,0.00026601946,0.00005776314,0.000013246903,0.010964594,0.0065309806,0.00044008516,0.012531123,0.00003192745,0.96869737],"study_design_scores_gemma":[0.004028575,0.010437319,0.01658904,0.030013746,0.0002760554,0.0000702385,0.000010960355,0.15969662,0.109770894,0.61947036,0.038367186,0.011268994],"about_ca_topic_score_codex":0.000032009906,"about_ca_topic_score_gemma":0.00003414789,"teacher_disagreement_score":0.95742834,"about_ca_system_score_codex":0.00025770557,"about_ca_system_score_gemma":0.00018566659,"threshold_uncertainty_score":0.9997267},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009486742,0.000019557003,0.98693174,0.002251264,0.0002425792,0.0009308915,7.8552875e-7,0.00012899659,0.000007444469],"genre_scores_gemma":[0.49239892,0.0000022815548,0.5055651,0.0018793991,0.000071969356,0.00007568861,0.0000017874444,0.0000041896683,6.8847777e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981256,0.00007790129,0.00030237364,0.00073846505,0.00042496764,0.0003306626],"domain_scores_gemma":[0.9986616,0.00042340867,0.00012794833,0.00042361804,0.00016882528,0.00019461056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011134514,0.000156928,0.00018964523,0.00037210737,0.0001978478,0.00029590973,0.0009892253,0.00005854553,0.0000012792683],"category_scores_gemma":[0.00034693064,0.00014043217,0.0000246981,0.0012787755,0.00011900571,0.00074172835,0.00027183956,0.00011254656,0.00000464901],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009696376,0.000031999272,0.00025210832,0.000023375975,0.0000012273689,0.0000012212996,0.00071190635,0.0018856997,0.020821495,0.0013242284,0.000024608134,0.9749124],"study_design_scores_gemma":[0.000370002,0.00018165173,0.0014367447,0.000031329902,0.0000023731568,0.00002004459,9.356689e-7,0.82562053,0.16599008,0.006151314,0.000035723377,0.00015928248],"about_ca_topic_score_codex":0.000021872373,"about_ca_topic_score_gemma":0.000013455454,"teacher_disagreement_score":0.97475314,"about_ca_system_score_codex":0.000106540385,"about_ca_system_score_gemma":0.00008148692,"threshold_uncertainty_score":0.57266575},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016967527,0.0011368945,0.9914409,0.00032505678,0.0007942277,0.00028295178,0.0000045739243,0.00015950133,0.0056862268],"genre_scores_gemma":[0.23052756,0.000054157463,0.7653669,0.0014446698,0.0006346458,0.00001344461,0.0000041974845,0.00009441273,0.0018599698],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99537724,0.00006210414,0.00043176816,0.0017913886,0.0014017854,0.0009357003],"domain_scores_gemma":[0.99701685,0.00049578876,0.00018377855,0.0015015802,0.00038164228,0.00042036656],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015336196,0.00053927494,0.0005388231,0.0006024107,0.00048237713,0.0012945168,0.0031134698,0.00033321153,0.000027110202],"category_scores_gemma":[0.00012262039,0.00049073464,0.00008931928,0.00073249795,0.00391914,0.0010019452,0.0026888805,0.0010954426,0.000095881376],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009428619,0.000013620633,0.00011546976,0.000023445202,0.0000071925115,0.00017244711,0.000619738,0.006449462,0.000033044493,0.06590875,0.000034520253,0.92661285],"study_design_scores_gemma":[0.00035539747,0.00011499395,0.000064345455,0.0002126852,0.0000042027345,0.00033818334,2.8333085e-7,0.22249289,0.00033178373,0.76614964,0.009259584,0.000675996],"about_ca_topic_score_codex":0.000019250856,"about_ca_topic_score_gemma":0.00005981978,"teacher_disagreement_score":0.9259369,"about_ca_system_score_codex":0.0003708411,"about_ca_system_score_gemma":0.0009356022,"threshold_uncertainty_score":0.9997544},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014996374,0.0007591881,0.99454457,0.00075757434,0.0008153823,0.00052357744,0.0000048587967,0.00012625198,0.0023186388],"genre_scores_gemma":[0.2512124,0.00003935967,0.74672306,0.0015177809,0.00017498437,0.00002499104,0.000005272846,0.000030254738,0.00027189657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714166,0.000027206015,0.00040385601,0.001430176,0.0005058099,0.0004913007],"domain_scores_gemma":[0.9979719,0.0004722942,0.00022881257,0.0010180284,0.00017865909,0.00013030096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007443698,0.0003766372,0.00039367436,0.00045731774,0.00025529624,0.00050986675,0.0015184113,0.0002683109,0.000002736986],"category_scores_gemma":[0.00008209869,0.00035928245,0.00007955473,0.0002392573,0.00032061714,0.00063451426,0.00050767517,0.0004362357,0.00000389866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029805415,0.000014220875,0.000013821844,0.00004979299,0.000008064621,0.00000997455,0.002623326,0.033407595,0.00019988608,0.23975061,0.000017161252,0.7239026],"study_design_scores_gemma":[0.0001937172,0.00006377576,0.000010483937,0.00014066501,0.0000048718985,0.0000233527,9.862134e-7,0.7552911,0.00024514555,0.24342059,0.0002918307,0.0003134831],"about_ca_topic_score_codex":0.0000145601325,"about_ca_topic_score_gemma":0.000022158263,"teacher_disagreement_score":0.72358906,"about_ca_system_score_codex":0.00015384486,"about_ca_system_score_gemma":0.00020861436,"threshold_uncertainty_score":0.9998859},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037099984,0.00033879347,0.99563414,0.0008522512,0.0006110762,0.000784476,0.00018257584,0.0005106286,0.0010489427],"genre_scores_gemma":[0.013945198,0.000024180352,0.98465747,0.00030479688,0.00040721218,0.000036702742,0.00031631225,0.000054365722,0.00025377923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953615,0.000030026002,0.00048508568,0.002426628,0.0010338203,0.00066295767],"domain_scores_gemma":[0.99351966,0.00058108504,0.0004934853,0.0045520626,0.0006556966,0.00019798736],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014716428,0.0005964345,0.0005474882,0.0006760621,0.00023799969,0.0007693587,0.009290063,0.0003293367,0.0000025753402],"category_scores_gemma":[0.00029023056,0.0004939585,0.000042219614,0.0005660471,0.0006192501,0.0015780298,0.0033201696,0.00052870397,0.000012480398],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015314941,0.0000525205,0.000035660083,0.00004414709,0.000017102331,0.000032349155,0.00023321164,0.000523197,0.00009432919,0.015865246,0.0011616544,0.98192525],"study_design_scores_gemma":[0.00047779866,0.00047906587,0.00004425428,0.00059426564,0.000025174451,0.00009767157,4.0331162e-7,0.9256901,0.0006275612,0.052227315,0.018875284,0.0008610713],"about_ca_topic_score_codex":0.00003256423,"about_ca_topic_score_gemma":0.0001805817,"teacher_disagreement_score":0.9810642,"about_ca_system_score_codex":0.00027081705,"about_ca_system_score_gemma":0.0010584766,"threshold_uncertainty_score":0.9997512},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9731004,0.0034603064,0.022608265,0.00019326033,0.00016587478,0.0004161863,0.00002369422,0.0000022661075,0.00002972324],"genre_scores_gemma":[0.9963392,0.00014388029,0.0032172364,0.00012233907,0.00007813739,0.000006085686,0.0000047749245,0.000022804516,0.00006554461],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979442,0.00011842129,0.00052137853,0.0005109356,0.0006154374,0.00028964435],"domain_scores_gemma":[0.99801284,0.00004854129,0.0005983029,0.0012548442,0.00004168526,0.00004377426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005035675,0.00029383172,0.0004210353,0.000108346576,0.000112792564,0.00001612912,0.0014279247,0.00020628874,0.000009125499],"category_scores_gemma":[0.000011916335,0.00017244046,0.00027453623,0.00018305925,0.0011855495,0.0000070144915,0.0010955529,0.00023737088,7.269983e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002575065,0.000060367536,0.005923043,0.000028492726,0.000046009547,3.8761982e-7,0.00056924584,0.04904249,0.942615,0.000006388178,0.000003065359,0.0016797921],"study_design_scores_gemma":[0.00032556057,0.00005324843,0.021259414,0.00030403092,0.00006570495,0.0000061673727,0.0000016062554,0.0030950115,0.9739981,0.000619839,0.00007556228,0.00019574886],"about_ca_topic_score_codex":0.000023297476,"about_ca_topic_score_gemma":0.00004537763,"teacher_disagreement_score":0.04594748,"about_ca_system_score_codex":0.000083079445,"about_ca_system_score_gemma":0.00009945872,"threshold_uncertainty_score":0.70319176},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036697278,0.00019393954,0.99148524,0.000022498552,0.0035227248,0.0003871914,0.0000068087675,0.00057193596,0.00013995195],"genre_scores_gemma":[0.040628277,0.000039292736,0.95882267,0.0001295048,0.00021917706,0.000012955008,0.0000010685607,0.000054425065,0.000092607515],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995452,0.00009847759,0.0006875004,0.0020141448,0.00081345614,0.0009344534],"domain_scores_gemma":[0.99529606,0.0013823238,0.0003259233,0.00246937,0.00029915708,0.0002271668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016806821,0.00069852103,0.00065362355,0.000855395,0.0003121446,0.0005085311,0.0027830799,0.000269507,0.000009263862],"category_scores_gemma":[0.0009287303,0.00069156406,0.00014925381,0.0006573941,0.0007082935,0.00375257,0.0025347557,0.0009990267,0.000024569046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011165546,0.000034020988,0.00023480563,0.00009156024,0.00002590548,0.0035825633,0.0025980682,0.20190784,0.00030430462,0.007359983,0.0000017303813,0.78384805],"study_design_scores_gemma":[0.0008202054,0.000646454,0.00093087804,0.0017356763,0.000055214372,0.004290719,9.3412217e-7,0.18744458,0.010468491,0.7879803,0.0010929231,0.0045335907],"about_ca_topic_score_codex":0.00019643031,"about_ca_topic_score_gemma":0.000035245535,"teacher_disagreement_score":0.78062034,"about_ca_system_score_codex":0.0006725917,"about_ca_system_score_gemma":0.00028887106,"threshold_uncertainty_score":0.99955356},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006018758,0.00038942278,0.99523264,0.000030179788,0.00041202104,0.00013565451,0.000005689282,0.0002660026,0.002926501],"genre_scores_gemma":[0.9504618,0.00009998937,0.04907747,0.00007565433,0.00013993669,0.000004335926,0.000010675081,0.00004136241,0.00008878193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892545,0.0000055643804,0.00023817991,0.00027200868,0.00029983974,0.00025896376],"domain_scores_gemma":[0.9993876,0.000104342944,0.00009654756,0.00027711003,0.00009829788,0.00003607902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011498419,0.00023543535,0.0002676672,0.0004447826,0.00005970342,0.00003311065,0.00036006718,0.00018724431,0.000013838854],"category_scores_gemma":[0.000026991387,0.00019663578,0.00003968356,0.00026986666,0.00036132286,0.00014305503,0.000064264714,0.0003627559,0.0000034412762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026300651,0.000016453721,0.0020769003,0.00019680845,0.000046002995,0.00005748524,0.00090369565,0.30747113,0.0004917223,0.0059316857,0.000029416351,0.68275243],"study_design_scores_gemma":[0.0009931164,0.0004748727,0.0017601779,0.0031901037,0.00005149022,0.00046273027,0.0000031769453,0.92236406,0.03227486,0.033917967,0.0027722435,0.0017351793],"about_ca_topic_score_codex":0.000009420661,"about_ca_topic_score_gemma":0.000041130523,"teacher_disagreement_score":0.9498599,"about_ca_system_score_codex":0.000102863196,"about_ca_system_score_gemma":0.00004927593,"threshold_uncertainty_score":0.8018575},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074775824,0.0001856243,0.91339916,0.00013596444,0.001237811,0.0003628803,0.0000020868397,0.00027274658,0.084328935],"genre_scores_gemma":[0.5486667,0.000038622744,0.44730714,0.0012620811,0.0007593654,0.000015687194,0.000007999283,0.00007011831,0.0018722613],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957244,0.000030825384,0.00047893013,0.0018136413,0.0009382256,0.0010139723],"domain_scores_gemma":[0.997128,0.00029506936,0.00036502772,0.0016883259,0.00024073459,0.0002828298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006921428,0.0007310524,0.00069231837,0.000777838,0.00045473035,0.0007593028,0.004670524,0.00032359743,0.00006860522],"category_scores_gemma":[0.00004416459,0.0005416187,0.00015302996,0.0006262358,0.000959074,0.0009702647,0.0016488173,0.00082313566,0.00013893377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000149175385,0.000057609082,0.00044913095,0.00006402858,0.00002847766,0.0002715619,0.0026107335,0.00069823774,0.00008133283,0.34308797,0.00006497856,0.652571],"study_design_scores_gemma":[0.0011183594,0.0012430121,0.0024791847,0.0010783823,0.000035621957,0.0008686144,4.5597616e-7,0.19593985,0.0011943459,0.77686006,0.016436445,0.0027456721],"about_ca_topic_score_codex":0.000037898237,"about_ca_topic_score_gemma":0.00018842921,"teacher_disagreement_score":0.64982533,"about_ca_system_score_codex":0.00033322777,"about_ca_system_score_gemma":0.00042192114,"threshold_uncertainty_score":0.9997035},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006642931,0.0002920186,0.98811644,0.00007556949,0.0014343336,0.0002878034,0.000024118708,0.00012545419,0.008979992],"genre_scores_gemma":[0.24979667,0.00009078233,0.74874187,0.0006119489,0.0004233304,0.000008866898,0.000036520287,0.000036941557,0.00025304029],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963721,0.00003081175,0.0005839266,0.0014777699,0.0009852718,0.0005500895],"domain_scores_gemma":[0.99743974,0.0003476944,0.00047181293,0.0014784541,0.00014150438,0.00012081572],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006967221,0.00045318517,0.000530403,0.000756417,0.00014275828,0.00040769222,0.0055209724,0.00018866689,0.000048727325],"category_scores_gemma":[0.000053577547,0.00039925225,0.00012488679,0.00058359455,0.00062505173,0.00090986845,0.0025942288,0.00046371768,0.000038728158],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004121722,0.000040412055,0.0001150192,0.000031633117,0.000021400581,0.000030241115,0.0009057926,0.0010446431,0.000121683894,0.028730948,0.000020135338,0.96893394],"study_design_scores_gemma":[0.0006008816,0.00046956405,0.0009882527,0.0013565429,0.00003913379,0.000009033955,0.0000011660508,0.37499878,0.0036198322,0.6139424,0.0025078321,0.001466619],"about_ca_topic_score_codex":0.00022385792,"about_ca_topic_score_gemma":0.00009890763,"teacher_disagreement_score":0.96746737,"about_ca_system_score_codex":0.00007783643,"about_ca_system_score_gemma":0.00014700423,"threshold_uncertainty_score":0.99985963},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011134043,0.0001900137,0.9897604,0.0017976612,0.0028205197,0.00044694674,0.000005200545,0.00033867275,0.00452924],"genre_scores_gemma":[0.7177604,0.000015289359,0.270433,0.0097322,0.001141174,0.000025336036,0.000006861009,0.00009051032,0.00079524954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99410766,0.00007217884,0.00083342503,0.0022893113,0.0015986374,0.0010987896],"domain_scores_gemma":[0.99526536,0.001051901,0.00043775025,0.0025704068,0.0003567741,0.00031780198],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010428547,0.00081207394,0.00074892835,0.0010446303,0.0003189679,0.0009166541,0.006205046,0.0005069791,0.000073725394],"category_scores_gemma":[0.00020336946,0.00074797485,0.00024401754,0.0006601436,0.0010907609,0.0004662126,0.0013108585,0.0011086146,0.0004984751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004207153,0.000026153906,0.00012796356,0.00003409606,0.000008014265,0.00010690621,0.00042808833,0.066222206,0.00010908164,0.014888762,0.00008305524,0.9179615],"study_design_scores_gemma":[0.00012087693,0.00021406796,0.000070030874,0.00043881277,0.0000074172153,0.000033239852,1.0129223e-7,0.8928479,0.010089909,0.08747786,0.0077347094,0.0009650582],"about_ca_topic_score_codex":0.00007853975,"about_ca_topic_score_gemma":0.00023866407,"teacher_disagreement_score":0.9169964,"about_ca_system_score_codex":0.00036363228,"about_ca_system_score_gemma":0.0007457788,"threshold_uncertainty_score":0.9994971},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003049013,0.000094663505,0.9895796,0.00024438466,0.00052599784,0.00041871052,0.000003077875,0.00007110502,0.008757535],"genre_scores_gemma":[0.80359983,0.0000378527,0.19484022,0.00024716576,0.0000844744,0.00001829419,0.0000047255544,0.000028896544,0.001138527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977661,0.000070428716,0.0004231167,0.0009161356,0.00040659553,0.00041762769],"domain_scores_gemma":[0.99779457,0.0007176428,0.00043497013,0.00051206857,0.00039707692,0.00014366326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013978316,0.0003402617,0.0004993154,0.000496478,0.00035976453,0.00031968494,0.001374339,0.00020127499,0.000019048233],"category_scores_gemma":[0.00018140729,0.00031963357,0.00007241407,0.00038319983,0.00045402886,0.0006506858,0.0007794033,0.00070510857,0.000005363262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004193886,0.0000560949,0.0004194693,0.00018002458,0.000032727436,0.000008211371,0.027902892,0.11617669,0.0002293448,0.35567722,0.00002027025,0.49925512],"study_design_scores_gemma":[0.000252925,0.0003922816,0.00007334126,0.00026356964,0.000015579895,0.000016386322,0.000015649784,0.79932755,0.001103569,0.1975254,0.0005534885,0.00046028328],"about_ca_topic_score_codex":0.000008799154,"about_ca_topic_score_gemma":0.000017496246,"teacher_disagreement_score":0.80329496,"about_ca_system_score_codex":0.000107644715,"about_ca_system_score_gemma":0.00074356265,"threshold_uncertainty_score":0.99992555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008717637,0.00026210226,0.9981375,0.000022200704,0.0005259726,0.00039022535,0.000003369171,0.0000101911955,0.00056127267],"genre_scores_gemma":[0.49538213,0.00015687526,0.5025155,0.00059453055,0.0009732874,0.00001729089,0.00010913116,0.00005817883,0.00019308753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873585,0.000008434019,0.00025737967,0.0005028675,0.00016026953,0.0003351876],"domain_scores_gemma":[0.99923813,0.00002719306,0.00013353777,0.00038410595,0.00014156669,0.000075443015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020877262,0.00025459353,0.00019143915,0.00011852255,0.00011264364,0.000084631145,0.0003797724,0.00031827623,0.000010897179],"category_scores_gemma":[0.0000042805536,0.00022135639,0.000061515435,0.00006955088,0.00028614415,0.000011107617,0.00026281684,0.00026407087,0.0000017198456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005947303,0.0000049733067,0.0000111955105,0.000019372348,0.000011747295,0.0000013429863,0.000043126576,0.7429859,0.000058990227,0.000020582138,0.0000071064474,0.25677618],"study_design_scores_gemma":[0.00024805628,0.00045169555,0.000015788204,0.000113592396,0.000011564893,0.00005122047,3.5050502e-7,0.99713695,0.00048784498,0.00067526114,0.0005160971,0.00029157553],"about_ca_topic_score_codex":0.000010630207,"about_ca_topic_score_gemma":0.00009701281,"teacher_disagreement_score":0.495622,"about_ca_system_score_codex":0.00006528659,"about_ca_system_score_gemma":0.00012119569,"threshold_uncertainty_score":0.90266514},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000096389434,0.0002319893,0.9963457,0.0010731564,0.0006899974,0.0006034307,0.000776533,0.00010507452,0.00007773487],"genre_scores_gemma":[0.0857428,0.000019467954,0.911422,0.0018702389,0.0002874838,0.000013538159,0.00055070897,0.000039602688,0.000054158736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954055,0.00011782737,0.00079386984,0.00214267,0.00086756586,0.00067254406],"domain_scores_gemma":[0.9947988,0.0004955079,0.00042308675,0.003241919,0.0007701856,0.00027052447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016999306,0.0006325012,0.0009010271,0.00058567605,0.00033458008,0.00027257082,0.0053338907,0.0005117254,0.0000036831464],"category_scores_gemma":[0.00014030328,0.000559019,0.0001519562,0.00042280805,0.00047947245,0.00080192514,0.0018634115,0.0006611544,0.0000017584173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021145408,0.00004260189,9.185115e-7,0.000035032677,0.000025234522,0.0000041491508,0.00017966458,0.5009276,0.0013376636,0.34060284,0.00006904558,0.15675406],"study_design_scores_gemma":[0.00032668552,0.00009381762,0.00000124734,0.00014769252,0.000023965016,0.000008956823,1.1858766e-8,0.61502224,0.0007186268,0.38323635,0.000029142233,0.0003912598],"about_ca_topic_score_codex":0.000050286653,"about_ca_topic_score_gemma":0.000041048534,"teacher_disagreement_score":0.1563628,"about_ca_system_score_codex":0.00013609749,"about_ca_system_score_gemma":0.0008132276,"threshold_uncertainty_score":0.9996861},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036131695,0.0039539235,0.98218954,0.00049513206,0.00044321798,0.0005743182,0.000026720138,0.00006104552,0.008642946],"genre_scores_gemma":[0.9490426,0.00008643412,0.050098047,0.0005360979,0.00010832266,0.000007035267,0.00001658577,0.000044812256,0.00006006306],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969496,0.000037096623,0.0005798758,0.00091142335,0.0009901669,0.00053179456],"domain_scores_gemma":[0.9984522,0.0002664275,0.00027735913,0.00057822844,0.00024581596,0.00017999356],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085429696,0.00047487672,0.00090532936,0.0030834647,0.000059614682,0.000092763614,0.00057799916,0.0002610381,0.000013661001],"category_scores_gemma":[0.00010989846,0.00041992764,0.00029870472,0.001782603,0.0014170109,0.00019020401,0.00014457735,0.00074275956,0.00000308072],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014033733,0.00010326453,0.0067554666,0.00033986106,0.000087168635,0.00021726484,0.00087989686,0.0006181366,0.0014875063,0.004306755,0.000056837398,0.9850075],"study_design_scores_gemma":[0.021153014,0.0168203,0.07156592,0.08082225,0.0015253043,0.006494881,0.000034552824,0.12416419,0.066706374,0.56862086,0.029085116,0.013007208],"about_ca_topic_score_codex":0.00008794269,"about_ca_topic_score_gemma":0.00007009228,"teacher_disagreement_score":0.9720003,"about_ca_system_score_codex":0.00007826629,"about_ca_system_score_gemma":0.00023042,"threshold_uncertainty_score":0.99982524},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028083165,0.00013015095,0.9974443,0.00012512153,0.0010084634,0.00034305215,0.000006549414,0.00052465964,0.00013687323],"genre_scores_gemma":[0.07258203,0.000018835284,0.926391,0.00032945425,0.00022876046,0.0000146535685,0.000012729691,0.000043162872,0.00037935347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966023,0.00004807837,0.00042774994,0.0013596432,0.00097201543,0.0005902077],"domain_scores_gemma":[0.99567777,0.00233396,0.00028212188,0.0012671084,0.00033633766,0.00010271948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055951957,0.00053856947,0.0004448182,0.0007497249,0.00021694682,0.0004993825,0.0016236983,0.00023125872,0.0000054193547],"category_scores_gemma":[0.00048850337,0.00046628065,0.000072716175,0.0006147914,0.0005102454,0.0016130966,0.00061975355,0.00053981406,0.000016705553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067324577,0.000014747706,0.00017306197,0.000032706135,0.00000854495,0.00022557784,0.00021710017,0.7122511,0.00009076448,0.0023693505,0.00003362015,0.28457668],"study_design_scores_gemma":[0.0017735359,0.0020503025,0.008915005,0.0033607867,0.00006474784,0.0010931153,9.266147e-7,0.4251686,0.0054292334,0.5423106,0.0040871636,0.005745976],"about_ca_topic_score_codex":0.000049089405,"about_ca_topic_score_gemma":0.00008009605,"teacher_disagreement_score":0.53994125,"about_ca_system_score_codex":0.00041327666,"about_ca_system_score_gemma":0.0002685779,"threshold_uncertainty_score":0.99977887},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000546482,0.00040477785,0.9807103,0.00048090552,0.013459701,0.0002982428,0.0000031238817,0.0003547387,0.004233544],"genre_scores_gemma":[0.024039384,0.000039677536,0.96935976,0.0034288687,0.0013193105,0.00002398318,0.000015898255,0.00007563466,0.00169748],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99507624,0.00008442315,0.0005731646,0.0019286436,0.0014113548,0.0009261789],"domain_scores_gemma":[0.9965628,0.00042002485,0.0002849975,0.0019727147,0.00048985553,0.00026962467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016494989,0.0005454472,0.00056862197,0.0009881452,0.00038159208,0.0007889052,0.004856074,0.00044795507,0.000016182288],"category_scores_gemma":[0.00015649368,0.0004854627,0.00015001722,0.0017610461,0.0012552543,0.00055619975,0.0019425245,0.00084971957,0.0002101389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010570977,0.00020642123,0.000051255935,0.000087773195,0.000032550954,0.00022443809,0.0015027223,0.0063541173,0.00021539321,0.20161232,0.0066011506,0.78310126],"study_design_scores_gemma":[0.0003789826,0.0002471396,0.000012072376,0.00022488725,0.000004891163,0.000043957414,2.8940594e-8,0.24336006,0.0009733088,0.7500439,0.004171775,0.0005389712],"about_ca_topic_score_codex":0.000022466726,"about_ca_topic_score_gemma":0.000011241218,"teacher_disagreement_score":0.7825623,"about_ca_system_score_codex":0.000322599,"about_ca_system_score_gemma":0.0017023073,"threshold_uncertainty_score":0.9997597},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011823217,0.00040315802,0.9824086,0.0020333102,0.001709817,0.0010000484,0.000012395842,0.000572306,0.00003718518],"genre_scores_gemma":[0.51577014,0.0000044742133,0.48349306,0.00031897213,0.00025245638,0.00012929681,0.000013343318,0.000016271952,0.0000020046944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959561,0.000070241025,0.00052744284,0.0018614951,0.0007808789,0.0008038436],"domain_scores_gemma":[0.99644333,0.00036041174,0.00029541238,0.0022806232,0.00038312,0.00023707525],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001469194,0.00045111214,0.0005056394,0.0005866275,0.00027492002,0.0012109258,0.0053571328,0.00029405448,0.0000024107667],"category_scores_gemma":[0.00016625978,0.00042989294,0.0001770364,0.0014681632,0.00032163697,0.0003938462,0.0043888437,0.00062576093,0.000017621847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005073179,0.00022138405,0.00037320066,0.0002584756,0.000024605552,0.000040295978,0.0040689716,0.33715147,0.0045530912,0.011353591,0.00034396446,0.64160585],"study_design_scores_gemma":[0.000220023,0.000042214997,0.00011761513,0.00014163755,0.0000075283597,0.000013328485,4.2188393e-7,0.85804504,0.02272575,0.11719807,0.0010360403,0.0004523238],"about_ca_topic_score_codex":0.00012795,"about_ca_topic_score_gemma":0.00002319362,"teacher_disagreement_score":0.6411536,"about_ca_system_score_codex":0.0003291727,"about_ca_system_score_gemma":0.0013019717,"threshold_uncertainty_score":0.9998259},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084409135,0.000111105925,0.99375075,0.00029986256,0.00028135054,0.00034960784,0.0000026047123,0.00004686733,0.0043137753],"genre_scores_gemma":[0.3890562,0.00069708074,0.607789,0.00048089426,0.00039580822,0.00001246221,0.00003832614,0.000029533814,0.0015007034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990613,0.000004361141,0.00021541638,0.00036898942,0.00022269647,0.00012726516],"domain_scores_gemma":[0.9991136,0.000055682813,0.00016785991,0.00036249895,0.00024571604,0.000054635155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026132935,0.00014418305,0.00030617535,0.00016382843,0.00008684725,0.000019470399,0.00009977255,0.00013991726,0.0000052625633],"category_scores_gemma":[0.000039679384,0.00012244187,0.000049330265,0.00010974686,0.0004128989,0.000078350764,0.000113922724,0.00029271442,0.0000017724177],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040597854,0.000016124568,0.00014717474,0.00007764096,0.0000028017257,0.0000025170848,0.00017662442,0.002079638,0.01602396,0.0016620691,0.00017833909,0.9795925],"study_design_scores_gemma":[0.0004306033,0.0010703075,0.0018851886,0.0019073082,0.00010384654,0.00025035843,0.0000018583482,0.76533484,0.15382472,0.051984508,0.022530034,0.0006764184],"about_ca_topic_score_codex":0.000033141554,"about_ca_topic_score_gemma":0.000012886689,"teacher_disagreement_score":0.9789161,"about_ca_system_score_codex":0.0000937103,"about_ca_system_score_gemma":0.00008184851,"threshold_uncertainty_score":0.49930346},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014453849,0.0019049604,0.9864902,0.0015473614,0.0036141996,0.00051266287,0.000003544997,0.00016823235,0.0057443883],"genre_scores_gemma":[0.010193299,0.00012958795,0.9851314,0.0028556264,0.0012029083,0.000025537964,0.0000022508073,0.000040019288,0.00041937522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585605,0.00018325573,0.0005897633,0.0011730111,0.0013442277,0.0008536811],"domain_scores_gemma":[0.9950582,0.0012383729,0.0004492678,0.002906151,0.00021088046,0.00013717347],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0047137965,0.00052266876,0.0003940455,0.00034316993,0.0007404936,0.0007655212,0.007983401,0.00031050888,0.000032445725],"category_scores_gemma":[0.00023707715,0.00030605472,0.00013052467,0.0008413478,0.0015049803,0.0009277414,0.0017928962,0.0014403171,0.00009397133],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011866094,0.000009208708,0.0000076180963,0.0000068344416,0.0000071283557,0.00000559845,0.0019475658,0.0017048332,0.00002736664,0.029088607,0.000036008896,0.967158],"study_design_scores_gemma":[0.00015983079,0.0001473863,0.00083341834,0.00019601044,0.000019599915,0.00016459824,0.000001791495,0.8806846,0.0011934752,0.080407314,0.035448268,0.000743683],"about_ca_topic_score_codex":0.000015241343,"about_ca_topic_score_gemma":0.000018420407,"teacher_disagreement_score":0.96641433,"about_ca_system_score_codex":0.0002462391,"about_ca_system_score_gemma":0.00034879075,"threshold_uncertainty_score":0.99993914},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000098511875,0.0013501089,0.9964839,0.00014478246,0.0013373598,0.00036464207,0.000016868555,0.00012707716,0.00007671366],"genre_scores_gemma":[0.20832202,0.00003387514,0.7912356,0.000137626,0.00013714339,0.0000032268847,0.000006895188,0.000018110553,0.00010546738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679077,0.00010514062,0.0005276981,0.0011974053,0.0008548561,0.0005241366],"domain_scores_gemma":[0.99765486,0.0003600957,0.00038397664,0.0010660529,0.0003068036,0.00022819058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002103942,0.0003580646,0.0004399889,0.0015669815,0.00033410627,0.00071752555,0.0014157892,0.00028299715,0.000005227313],"category_scores_gemma":[0.00015226373,0.00033918468,0.00007841437,0.003361161,0.000297496,0.0006477867,0.00082673813,0.00033960957,0.000008299461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012471573,0.00006875843,0.00023621334,0.00025335053,0.000032300515,0.000024343402,0.0015923318,0.14228608,0.00083229406,0.05496475,0.000009410641,0.7996877],"study_design_scores_gemma":[0.00028132086,0.000024001134,0.00014814388,0.00012309846,0.000015310656,0.00006179277,4.739855e-7,0.9947546,0.0019271416,0.0018675938,0.00039449945,0.0004020262],"about_ca_topic_score_codex":0.000041549803,"about_ca_topic_score_gemma":0.00000939688,"teacher_disagreement_score":0.8524685,"about_ca_system_score_codex":0.00041658102,"about_ca_system_score_gemma":0.00020609493,"threshold_uncertainty_score":0.999906},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041179354,0.0005710532,0.99245834,0.00078974664,0.0012994199,0.0004561992,0.0000018961358,0.00010898366,0.00019640586],"genre_scores_gemma":[0.48898932,0.000007297798,0.50979644,0.00026782308,0.0008682714,0.000024248244,0.000006647827,0.000022646042,0.00001729189],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968803,0.00004207934,0.00055615953,0.0012444066,0.00054267154,0.0007343614],"domain_scores_gemma":[0.99805087,0.000535222,0.00026343836,0.00083192013,0.00017367929,0.00014485228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015599591,0.00037834008,0.00035591229,0.0007405061,0.00024083092,0.0004592406,0.0017895865,0.00022452541,0.0000063542793],"category_scores_gemma":[0.00014031642,0.00040313337,0.000074029726,0.000267233,0.00014882111,0.0014773883,0.0005537347,0.00051193585,0.000007263432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025057236,0.00002996543,0.0010468819,0.00007377007,0.0000029100659,0.0000053552653,0.0021600395,0.113789976,0.00035573074,0.032159373,6.423805e-7,0.85037285],"study_design_scores_gemma":[0.00016974757,0.000056141238,0.00063903874,0.0006611194,0.000003978441,0.000035428446,9.0817383e-7,0.8918149,0.0004892593,0.105620585,0.00004866536,0.00046025586],"about_ca_topic_score_codex":0.000033645578,"about_ca_topic_score_gemma":0.0002565564,"teacher_disagreement_score":0.8499126,"about_ca_system_score_codex":0.00046186557,"about_ca_system_score_gemma":0.0005315162,"threshold_uncertainty_score":0.99984205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007241303,0.00053411094,0.9904477,0.000055990953,0.0001598533,0.00059534615,0.00040566587,0.000009632081,0.00055038964],"genre_scores_gemma":[0.6286814,0.0000029074267,0.37056068,0.00008710447,0.0002171347,0.000016340386,0.00040479365,0.000015934409,0.000013682692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985472,0.00002709759,0.00029140458,0.000574187,0.00036973046,0.00019040446],"domain_scores_gemma":[0.9987627,0.00009175373,0.0002568188,0.00035876842,0.00046630448,0.00006365439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006979754,0.0002118775,0.00030066003,0.00014463621,0.000056144952,0.000017390523,0.00037947917,0.0002973653,0.0000034446125],"category_scores_gemma":[0.0001068569,0.00019493782,0.00012209047,0.00010743392,0.00055244204,0.0000056826525,0.00013832812,0.00016434952,1.2812983e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009114944,0.00063598173,0.002822776,0.0022997065,0.00014044307,0.0000037513696,0.000928819,0.7316601,0.1732806,0.0054144417,0.00026436342,0.081637494],"study_design_scores_gemma":[0.0020760263,0.0028513086,0.0003410296,0.0005791026,0.00004471005,0.000023537325,0.0000026436148,0.3677179,0.5410517,0.08328497,0.0013263053,0.0007008066],"about_ca_topic_score_codex":0.0000037072816,"about_ca_topic_score_gemma":0.0000049564155,"teacher_disagreement_score":0.6214401,"about_ca_system_score_codex":0.00004771267,"about_ca_system_score_gemma":0.00056969497,"threshold_uncertainty_score":0.7949333},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015047081,0.0003035028,0.9949183,0.00004062559,0.0007376927,0.0007539791,0.000045431698,0.00061396114,0.0010817883],"genre_scores_gemma":[0.7558741,0.000009543925,0.2430872,0.0003520331,0.00046442705,0.00001032133,0.000061692284,0.00009549328,0.000045204222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770826,0.000023497269,0.00040052147,0.00062109577,0.0005177324,0.0007289055],"domain_scores_gemma":[0.99844587,0.0005519613,0.00016862729,0.00050530414,0.00019180974,0.00013640038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036363717,0.0005480772,0.0005883032,0.00030096143,0.00022618726,0.00017084597,0.0005515233,0.00027055413,0.00001494063],"category_scores_gemma":[0.000026568878,0.0004855074,0.00009900444,0.00012573042,0.00055245537,0.00017334089,0.000175264,0.00053846755,0.0000031628263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010582867,0.000052295887,0.00021171012,0.0001154301,0.00035318418,0.00011771573,0.0018510713,0.4441065,0.015020201,0.00095357484,0.0005435695,0.53656894],"study_design_scores_gemma":[0.0005779319,0.00013708338,0.000041192183,0.00094755436,0.00006702404,0.000026367365,5.1698123e-7,0.943769,0.040961042,0.010591279,0.0020053168,0.0008757176],"about_ca_topic_score_codex":0.00003474905,"about_ca_topic_score_gemma":0.0002285325,"teacher_disagreement_score":0.7543694,"about_ca_system_score_codex":0.00026149477,"about_ca_system_score_gemma":0.00009721944,"threshold_uncertainty_score":0.9997597},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05959276,0.00049327087,0.9345738,0.00026487996,0.0004538693,0.00096874783,0.00001741121,0.000053413885,0.003581817],"genre_scores_gemma":[0.98922133,0.000037370475,0.009689097,0.0005851209,0.00028926192,0.000023156272,0.000042607546,0.000024336752,0.00008772057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805635,0.000007839933,0.00028983012,0.00074889313,0.00052011904,0.0003769504],"domain_scores_gemma":[0.99887633,0.00023427504,0.00015006309,0.00031306886,0.00029687028,0.00012938486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053677964,0.0003064696,0.0004425834,0.0007542378,0.000115180526,0.00019209503,0.00021584556,0.00016655045,0.000007789269],"category_scores_gemma":[0.00008265458,0.00025664875,0.00013186153,0.000245379,0.0007792094,0.00031478627,0.000093386654,0.0002623933,0.0000031734353],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010030045,0.000019785399,0.00058089284,0.00008467285,0.00001709512,0.0000047857775,0.00007652976,0.0002705556,0.00080533075,0.00021517192,0.000007272815,0.99781764],"study_design_scores_gemma":[0.010698029,0.0057352046,0.02146503,0.005626758,0.0004944464,0.0020610087,0.0000018419232,0.85227585,0.015222427,0.08065579,0.0034304403,0.0023331703],"about_ca_topic_score_codex":0.000001491735,"about_ca_topic_score_gemma":0.000002433362,"teacher_disagreement_score":0.9954844,"about_ca_system_score_codex":0.00006098372,"about_ca_system_score_gemma":0.00015428741,"threshold_uncertainty_score":0.99998856},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060205683,0.0021135763,0.9936775,0.00038324518,0.0007659206,0.00039832958,0.00006252156,0.00011971729,0.0024189742],"genre_scores_gemma":[0.027328968,0.0013399232,0.9692811,0.0013493204,0.00023485036,0.000005356354,0.000034769593,0.0000335551,0.00039215854],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996755,0.000044363485,0.000490821,0.0015159216,0.00066175644,0.00053211226],"domain_scores_gemma":[0.997698,0.00030668345,0.00027211025,0.0013313601,0.00019718788,0.00019467388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005581736,0.00046721363,0.0005958416,0.00036411436,0.00040041457,0.00014329799,0.0013180862,0.00014930761,0.00002776755],"category_scores_gemma":[0.00004801479,0.00041826966,0.00007433671,0.00035127118,0.0015286397,0.0009910894,0.0019499885,0.00047845018,0.000019873354],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001543226,0.000042993153,0.00033717934,0.00019035795,0.00003965136,0.000512286,0.0013594218,0.00115979,0.000101600584,0.36417282,0.00039252706,0.63167596],"study_design_scores_gemma":[0.0020151278,0.0007167712,0.0005619266,0.002603814,0.00004430679,0.0013997738,0.0000042804363,0.16845484,0.0012584942,0.12421035,0.6949637,0.0037666124],"about_ca_topic_score_codex":0.000057901012,"about_ca_topic_score_gemma":0.000120779085,"teacher_disagreement_score":0.6945712,"about_ca_system_score_codex":0.00024482937,"about_ca_system_score_gemma":0.00045182375,"threshold_uncertainty_score":0.9998269},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005921742,0.00025607523,0.9846099,0.00068957236,0.0030646212,0.00052946154,0.000004602535,0.00049878977,0.009754799],"genre_scores_gemma":[0.8378895,0.000044312925,0.15546297,0.004084414,0.0004385512,0.000033242668,0.000010374141,0.00007999909,0.0019566535],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99551183,0.000042858253,0.0007546774,0.0020407732,0.00079734594,0.00085249514],"domain_scores_gemma":[0.9959482,0.00039194,0.000620849,0.0020411166,0.00087574543,0.00012212893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067407,0.00074652,0.0007163746,0.0018057078,0.00031153177,0.00039119946,0.0050626355,0.00076869444,0.00016754173],"category_scores_gemma":[0.00019870233,0.0007093305,0.00016553076,0.0009925617,0.0013855314,0.0012136257,0.0020623473,0.0018398286,0.00042214966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001803254,0.00005776867,0.000053167074,0.000027447062,0.000045880468,0.00032155108,0.0032995,0.00048844493,0.0010067704,0.19917783,0.00013643553,0.7953672],"study_design_scores_gemma":[0.0010252639,0.0009633378,0.0004450271,0.0013487195,0.00003120661,0.0007458004,0.000002082131,0.14297876,0.040142957,0.7965021,0.013195566,0.0026191662],"about_ca_topic_score_codex":0.000047029924,"about_ca_topic_score_gemma":0.00008573074,"teacher_disagreement_score":0.8372973,"about_ca_system_score_codex":0.0005829241,"about_ca_system_score_gemma":0.0005613636,"threshold_uncertainty_score":0.9995358},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49745813,0.003912783,0.42147726,0.0032390957,0.004487436,0.007605065,0.0000349061,0.0003564663,0.06142886],"genre_scores_gemma":[0.9975108,0.000017650278,0.0014695422,0.00067196076,0.00011089717,0.000016960039,0.000004593612,0.00002505615,0.00017253272],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9982423,0.00014873646,0.00033149737,0.0005788775,0.00038344713,0.00031515124],"domain_scores_gemma":[0.9975508,0.0011337352,0.00030658196,0.0008733647,0.0000706021,0.0000649102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010518957,0.0003572489,0.00041313213,0.00024636064,0.00021105123,0.00013201196,0.0007763684,0.00034040416,0.00004403046],"category_scores_gemma":[0.0001180657,0.00022678051,0.00006428929,0.00013419206,0.0010844184,0.00010692599,0.00021075543,0.0010913999,0.00001799487],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101467784,0.000039269216,0.0018223533,0.00012047665,0.000020595777,0.000014226328,0.0054269787,0.00029305436,0.00013407042,0.0012805853,0.000019267785,0.99072766],"study_design_scores_gemma":[0.017889962,0.042564504,0.711842,0.064179495,0.001069412,0.0014218808,0.000050512816,0.044030223,0.016340569,0.08126829,0.010668949,0.008674209],"about_ca_topic_score_codex":0.0000257925,"about_ca_topic_score_gemma":0.00002222883,"teacher_disagreement_score":0.98205346,"about_ca_system_score_codex":0.00006842408,"about_ca_system_score_gemma":0.00008037373,"threshold_uncertainty_score":0.92478406},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034149174,0.00023226856,0.99031836,0.00021387245,0.0015089402,0.0006853275,0.0000012017431,0.00026150155,0.006437061],"genre_scores_gemma":[0.4941989,0.000015727683,0.49659833,0.000422814,0.0011778579,0.00004026124,0.0000033716985,0.00009391427,0.007448821],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99535877,0.000081507416,0.00059617683,0.0019103473,0.0011627623,0.0008904698],"domain_scores_gemma":[0.99718267,0.00031997444,0.00053012744,0.0011206594,0.00058704754,0.00025955297],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010259615,0.00068454153,0.0005978653,0.00076178374,0.00042823536,0.001319153,0.0029387528,0.00025626147,0.000045890596],"category_scores_gemma":[0.000059568072,0.000541565,0.000110777684,0.00045370182,0.00021590348,0.0021862849,0.001146943,0.0014586544,0.00015767256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013808006,0.0000720565,0.00010977774,0.00012580372,0.00005737295,0.00021474271,0.009638721,0.19329788,0.00081777683,0.15190922,0.000011787362,0.64373106],"study_design_scores_gemma":[0.00043391585,0.0016338292,0.00030159517,0.0062737535,0.0000204165,0.00034833886,0.000008466308,0.94297796,0.0051334146,0.028420206,0.012120474,0.0023276492],"about_ca_topic_score_codex":0.000074869226,"about_ca_topic_score_gemma":0.000051443592,"teacher_disagreement_score":0.74968004,"about_ca_system_score_codex":0.0005586957,"about_ca_system_score_gemma":0.00045851574,"threshold_uncertainty_score":0.9997176},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003125909,0.0023997722,0.92601675,0.06021306,0.0059379605,0.0020419026,0.00001577001,0.000068628746,0.0001802706],"genre_scores_gemma":[0.11759688,0.0032787002,0.8266763,0.044112258,0.0071256193,0.00021236895,0.00003293532,0.00013439689,0.0008305076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966121,0.00003771166,0.0015346932,0.0008717423,0.0005307862,0.0004130208],"domain_scores_gemma":[0.98238826,0.0149329305,0.00056424586,0.00045810785,0.0015024336,0.00015403445],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0032667713,0.00034502248,0.00066261675,0.00018952819,0.00014742752,0.0001207778,0.00039365378,0.00035268156,0.00007533989],"category_scores_gemma":[0.0264799,0.00023924976,0.00016101732,0.00015769713,0.0004949426,0.00028974505,0.0003271004,0.0009077071,0.000013934328],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026951495,0.000036458052,0.00064589037,0.000114185896,0.00015737819,0.000030587045,0.00015550636,0.0027968884,0.00025797414,0.000686664,0.0025266802,0.99232227],"study_design_scores_gemma":[0.002672731,0.00080137065,0.0015218022,0.00050899887,0.000628644,0.00039306737,0.0000039731144,0.87496316,0.00008287662,0.002434575,0.11553994,0.00044883162],"about_ca_topic_score_codex":0.00024969212,"about_ca_topic_score_gemma":0.0008208917,"teacher_disagreement_score":0.99187344,"about_ca_system_score_codex":0.00014663188,"about_ca_system_score_gemma":0.0009645446,"threshold_uncertainty_score":0.98172045},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008095878,0.0005369563,0.9903058,0.0022913227,0.004652427,0.0011675964,0.00025606123,0.0004511018,0.0002577895],"genre_scores_gemma":[0.031473227,0.0000679451,0.9637028,0.0030176062,0.0013268092,0.000020702057,0.00025157002,0.000083414205,0.000055949455],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934097,0.00005351124,0.0011962568,0.0028266693,0.000914798,0.0015990966],"domain_scores_gemma":[0.9952869,0.0006145738,0.00088024786,0.0023123468,0.0005126215,0.00039332462],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017682818,0.00090623944,0.0010462542,0.00088845927,0.0010956808,0.00088078267,0.00667897,0.00054892746,0.000015677928],"category_scores_gemma":[0.00030756538,0.0009335663,0.0002522064,0.0012271195,0.0005905021,0.0007701475,0.0047125933,0.0015092527,0.000018008139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014715633,0.000038486447,0.00019210188,0.0003507645,0.000050337272,0.000039834453,0.004777729,0.011107653,0.000010107586,0.48119584,0.00092476624,0.50129765],"study_design_scores_gemma":[0.00046921914,0.00021574975,0.0003261657,0.0012524265,0.000011327368,0.00015641883,8.7402094e-7,0.45556715,0.000097223055,0.524453,0.016252965,0.0011975213],"about_ca_topic_score_codex":0.00014083167,"about_ca_topic_score_gemma":0.00055763195,"teacher_disagreement_score":0.50010014,"about_ca_system_score_codex":0.0016375469,"about_ca_system_score_gemma":0.0023367668,"threshold_uncertainty_score":0.9993115},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018266684,0.00018082093,0.9955219,0.0012271127,0.00021925148,0.00020798192,0.0000042377546,0.00013181752,0.0023241898],"genre_scores_gemma":[0.4334699,0.000026157477,0.5622476,0.00048820762,0.000534108,0.000016863081,0.000022691562,0.000072719435,0.003121811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967698,0.00003122526,0.00039896357,0.0013813054,0.000887093,0.0005316174],"domain_scores_gemma":[0.99798626,0.00022951464,0.0002959464,0.0008940358,0.00035468573,0.00023957466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063969824,0.00045875448,0.0005677832,0.00039535944,0.0002956978,0.0007005861,0.0012484349,0.0002347648,0.000015939542],"category_scores_gemma":[0.00007662515,0.00034110545,0.000063863285,0.0006831462,0.0005276648,0.00078885624,0.0006556932,0.00059660093,0.00007155181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000191231,0.00015288686,0.0008509415,0.000064829925,0.00010800086,0.00030360266,0.0023481864,0.07863678,0.00046038145,0.19682285,0.0003162025,0.7197441],"study_design_scores_gemma":[0.00035474153,0.0012059128,0.0013197507,0.00019798483,0.000024392744,0.00012974066,4.5121385e-7,0.9410887,0.0002327031,0.05132889,0.0032962654,0.0008204969],"about_ca_topic_score_codex":0.000068532594,"about_ca_topic_score_gemma":0.000011670488,"teacher_disagreement_score":0.8624519,"about_ca_system_score_codex":0.00022200689,"about_ca_system_score_gemma":0.00029468286,"threshold_uncertainty_score":0.9999041},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012317322,0.0031605202,0.9916075,0.0002465173,0.0028831167,0.00040863384,0.0000058351998,0.0012159031,0.0003488267],"genre_scores_gemma":[0.006472177,0.00008498977,0.9913066,0.00037551144,0.0006585768,0.000016208467,0.00000483177,0.00007311711,0.0010080053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947498,0.000055335895,0.00062893267,0.0022224663,0.0014384041,0.00090505526],"domain_scores_gemma":[0.9953079,0.0010601588,0.00030952887,0.002413295,0.0006567945,0.0002523086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018923503,0.0008224794,0.0008393033,0.0009822288,0.0002619051,0.00038440482,0.004289507,0.00038584077,0.0000030387582],"category_scores_gemma":[0.0024938174,0.0007605816,0.00015446814,0.0006590467,0.00091527414,0.0010987592,0.0023964543,0.00114771,0.000036447374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004262987,0.000007649798,0.000008666056,0.000039435643,0.0000069115845,0.00003685635,0.000505313,0.70994115,0.00009939599,0.0037650748,0.000028157683,0.28555712],"study_design_scores_gemma":[0.00018554466,0.00010580309,0.00001886241,0.00036522112,0.000008254157,0.00008876324,2.636452e-7,0.47763538,0.002061399,0.5179363,0.00068839255,0.00090584165],"about_ca_topic_score_codex":0.000009885813,"about_ca_topic_score_gemma":0.0000146333305,"teacher_disagreement_score":0.5141712,"about_ca_system_score_codex":0.00049577135,"about_ca_system_score_gemma":0.0014126664,"threshold_uncertainty_score":0.99948454},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011110312,0.000828098,0.9875634,0.00066314277,0.0009320526,0.00041366403,0.0000063540847,0.00016341892,0.008318882],"genre_scores_gemma":[0.18770653,0.00013389128,0.8097001,0.0015694711,0.000342988,0.00000948571,0.0000034287295,0.00004154321,0.0004926059],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670005,0.000076509554,0.0005347035,0.001283239,0.0007953765,0.00061010226],"domain_scores_gemma":[0.99784225,0.00045869694,0.00026781423,0.00091036933,0.0003324672,0.00018841233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001158936,0.00055414875,0.00069151557,0.0006500004,0.00027244756,0.00053846714,0.0018314837,0.0003682961,0.000037436457],"category_scores_gemma":[0.00006622921,0.00043722428,0.00018793177,0.0004808417,0.0011153836,0.001078516,0.0005238411,0.0009278246,0.000017769453],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004338875,0.00010508652,0.000038439608,0.0001762426,0.0000875444,0.00008673785,0.004660157,0.0007875353,0.01147238,0.051860843,0.00008331883,0.9305983],"study_design_scores_gemma":[0.0011414716,0.0009396914,0.0008372515,0.00047191273,0.00004971977,0.00034504733,0.0000035625142,0.24444911,0.028576998,0.71982723,0.0020348888,0.0013231403],"about_ca_topic_score_codex":0.000071005685,"about_ca_topic_score_gemma":0.0000098713,"teacher_disagreement_score":0.92927516,"about_ca_system_score_codex":0.00013161644,"about_ca_system_score_gemma":0.0004679871,"threshold_uncertainty_score":0.99980795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017435141,0.0007245701,0.99265546,0.00005894362,0.0014772189,0.00012009012,0.000018942857,0.0006635055,0.004106948],"genre_scores_gemma":[0.5306623,0.00057301985,0.46148387,0.0015264346,0.004283121,0.000004707746,0.00063888077,0.00022130628,0.0006063481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981942,0.000010100811,0.0003112546,0.00066807866,0.00029071514,0.0005256367],"domain_scores_gemma":[0.9984645,0.0003791379,0.000067687775,0.0009815742,0.00005442283,0.000052674393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035091006,0.00030695664,0.00034405326,0.000295755,0.00014569292,0.00009430609,0.0014715171,0.00048304276,0.00010664738],"category_scores_gemma":[0.000109941124,0.00030060322,0.00003651631,0.0002791442,0.00044265852,0.00013610732,0.00077849353,0.00094293547,0.00004697562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018122847,0.000001397098,0.00020559004,0.000010152841,0.00000987328,0.000039276398,0.000088842855,0.67695785,0.000021650258,0.0008077985,0.00014498542,0.3217108],"study_design_scores_gemma":[0.0001240723,0.000042585867,0.00007222262,0.00009396871,0.000010951666,0.000013714642,8.470158e-7,0.9115462,0.000845186,0.05160108,0.035161614,0.00048756003],"about_ca_topic_score_codex":0.0000372305,"about_ca_topic_score_gemma":0.00024599707,"teacher_disagreement_score":0.53117156,"about_ca_system_score_codex":0.000118370874,"about_ca_system_score_gemma":0.00005246885,"threshold_uncertainty_score":0.9999446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.989434e-7,0.000077473676,0.99556005,0.00018214315,0.0016926602,0.0011367871,0.000033001696,0.00026815684,0.0010492388],"genre_scores_gemma":[0.0007306621,0.000018582854,0.9971319,0.0009858292,0.00040547678,0.00006757867,0.00008409699,0.00006446243,0.0005114481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962039,0.00003538729,0.0006244569,0.0017579637,0.0007392892,0.0006390087],"domain_scores_gemma":[0.9970486,0.00019446465,0.0004914929,0.0010678452,0.0010118559,0.00018573357],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005247568,0.00060969905,0.0005015853,0.0008785846,0.00036539658,0.00042168685,0.0019423526,0.00040922186,0.000038409547],"category_scores_gemma":[0.00008723113,0.00062769785,0.00017450111,0.0004837822,0.0004998371,0.0011227698,0.00037803524,0.00043550166,0.0000112830385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055892897,0.000020043226,2.8399987e-7,0.000010347638,0.0000054358834,0.000005591134,0.00012373262,0.68046176,0.000032935524,0.009221246,0.0000039936604,0.31010905],"study_design_scores_gemma":[0.00067022763,0.00014490543,0.0000011072719,0.00007892436,0.00001153921,0.000012058016,3.9388524e-8,0.92646396,0.0034110006,0.06842327,0.00013190201,0.00065104116],"about_ca_topic_score_codex":0.000009203582,"about_ca_topic_score_gemma":0.00000946371,"teacher_disagreement_score":0.309458,"about_ca_system_score_codex":0.0005223036,"about_ca_system_score_gemma":0.0010727731,"threshold_uncertainty_score":0.99961746},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032908563,0.0005577309,0.9962597,0.0010700889,0.00067913294,0.00051074615,0.000035622466,0.00008051743,0.00047738428],"genre_scores_gemma":[0.10802205,0.0001541265,0.8906265,0.00023075196,0.0005534144,0.000012909605,0.0000218481,0.00003332393,0.00034507643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669397,0.00004519737,0.00051782373,0.001468218,0.00078910217,0.00048571787],"domain_scores_gemma":[0.99631333,0.0015114294,0.00046934138,0.001293489,0.00024505932,0.00016736696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007675657,0.00041863363,0.0006681516,0.0004844724,0.00021117339,0.00028265294,0.0021373646,0.0002858846,0.0000036852277],"category_scores_gemma":[0.00018058762,0.0003726883,0.00009284394,0.00041837507,0.00068831793,0.0006852791,0.0014050408,0.00040172975,0.0000031899535],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013167076,0.00002497505,0.00054017024,0.00022109888,0.000017266186,0.0000093633425,0.0004984555,0.00177075,0.000850487,0.066765286,0.00016085795,0.9291281],"study_design_scores_gemma":[0.0008442747,0.0005928804,0.0014801244,0.0010300012,0.000034278033,0.000033716293,6.341209e-7,0.7421303,0.009709602,0.23949297,0.0037787622,0.000872482],"about_ca_topic_score_codex":0.000042292337,"about_ca_topic_score_gemma":0.000012683943,"teacher_disagreement_score":0.9282556,"about_ca_system_score_codex":0.000084772415,"about_ca_system_score_gemma":0.00029090364,"threshold_uncertainty_score":0.9998725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004628437,0.000457195,0.9919242,0.0002571511,0.0010069914,0.00035706276,0.000010063506,0.000116645824,0.0012422228],"genre_scores_gemma":[0.88399845,0.000081160004,0.11500911,0.000548306,0.00019636472,0.0000056662357,0.0000040700056,0.000025288824,0.00013158166],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974851,0.000047361813,0.00041530293,0.0009052582,0.0006927078,0.00045425564],"domain_scores_gemma":[0.9982534,0.0003007127,0.0003168134,0.0008855928,0.000118391756,0.00012506245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081011356,0.00037607888,0.0004586758,0.0006125565,0.00015113446,0.00017038839,0.0012876298,0.00014667798,0.000010784857],"category_scores_gemma":[0.000031306223,0.000311777,0.00007960139,0.00034239798,0.0011888611,0.00043645257,0.0007495184,0.0004151166,0.000009999523],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015593301,0.00006647841,0.00011796035,0.000054732376,0.000011370513,0.000009269759,0.0015663079,0.0018400024,0.00042977778,0.101646766,0.0000080031805,0.89423376],"study_design_scores_gemma":[0.0005785287,0.0008109926,0.004996973,0.0007761019,0.000014244102,0.00007924625,6.530051e-7,0.37928116,0.00970524,0.6020176,0.0008011674,0.0009380762],"about_ca_topic_score_codex":0.000051955034,"about_ca_topic_score_gemma":0.000072037175,"teacher_disagreement_score":0.89329565,"about_ca_system_score_codex":0.0001285541,"about_ca_system_score_gemma":0.00014757321,"threshold_uncertainty_score":0.9999334},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079184485,0.00053040526,0.9923279,0.00020707303,0.0016611901,0.00040055442,0.0000014121919,0.00015712717,0.0039224555],"genre_scores_gemma":[0.95916456,0.00001316118,0.0391183,0.0005502403,0.0010442218,0.000010137994,0.0000038216644,0.000031003277,0.00006456106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646163,0.000070778544,0.0005803811,0.0010806506,0.0008319667,0.00097462087],"domain_scores_gemma":[0.9982374,0.00032233816,0.0003370201,0.00078165054,0.00017890969,0.00014273258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013320923,0.0004955261,0.0005178047,0.0010105952,0.00045422793,0.00049892074,0.0016399646,0.00043241933,0.000006761526],"category_scores_gemma":[0.000052306692,0.00047339255,0.0001395635,0.0009314619,0.00044978768,0.00043275306,0.00096152007,0.0011116038,0.00003163395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005065369,0.000036721518,0.00003378397,0.000021813441,0.000004148374,0.00002600594,0.0036309122,0.41823685,0.000068814006,0.006748467,0.000029320207,0.5711581],"study_design_scores_gemma":[0.0002538874,0.00005759537,0.0003381321,0.0003042775,0.000005482423,0.000083982406,9.949705e-7,0.98539424,0.0003873332,0.012247106,0.0003632171,0.0005637701],"about_ca_topic_score_codex":0.000028825436,"about_ca_topic_score_gemma":0.00007314018,"teacher_disagreement_score":0.9583727,"about_ca_system_score_codex":0.00071966846,"about_ca_system_score_gemma":0.00021378207,"threshold_uncertainty_score":0.9997718},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032323128,0.00087014836,0.99081403,0.00022383692,0.00088001497,0.0034929954,0.000007255067,0.00019286053,0.0035156468],"genre_scores_gemma":[0.003757342,0.00021430153,0.9851269,0.003323676,0.0004265679,0.002856176,0.00006934355,0.000054515436,0.004171164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622077,0.0000922435,0.00058508565,0.0016051586,0.00072682556,0.00076994696],"domain_scores_gemma":[0.9952566,0.00053521007,0.00038836087,0.003400136,0.00025776375,0.00016193565],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012602808,0.00045838856,0.00042447733,0.000677766,0.00042750753,0.0005395884,0.006348849,0.00023489514,0.000010352414],"category_scores_gemma":[0.00004017161,0.00047053688,0.0001595498,0.0014977586,0.00033866873,0.00043747676,0.0014167905,0.0004880464,0.000064522625],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018361673,0.00007868369,0.000009499287,0.00008011447,0.000013640646,0.0000034982509,0.00015527391,0.15530312,0.000010546185,0.012360787,0.0040233736,0.8279596],"study_design_scores_gemma":[0.00033305297,0.00020402022,0.000009374175,0.00011751742,0.000014154951,0.00000813698,1.4638695e-7,0.50835586,0.00029820553,0.11806503,0.3719997,0.00059482397],"about_ca_topic_score_codex":0.000004040443,"about_ca_topic_score_gemma":0.000016887481,"teacher_disagreement_score":0.8273648,"about_ca_system_score_codex":0.0011297587,"about_ca_system_score_gemma":0.0011423058,"threshold_uncertainty_score":0.99977463},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009558035,0.0001677653,0.9872011,0.0018820768,0.00088204857,0.0003423398,0.000010248894,0.00009477789,0.009324053],"genre_scores_gemma":[0.86922336,0.00011090992,0.12673125,0.0033200202,0.00025822766,0.00001255028,0.00001206852,0.000015864189,0.0003157599],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997693,0.000050402563,0.0003933162,0.0009009083,0.0006129303,0.00034942373],"domain_scores_gemma":[0.9981992,0.0006761019,0.00025665923,0.00057274033,0.00019972726,0.000095541574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005632861,0.00033804475,0.0003223043,0.00021040293,0.00039203826,0.00059437857,0.0011536557,0.00018095749,0.00012274768],"category_scores_gemma":[0.000084602616,0.00024851327,0.000065976565,0.00017491341,0.00242507,0.00040712734,0.0004602514,0.00053469144,0.000022271743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025294835,0.000006602513,0.00013564824,0.000018806266,0.000015412372,0.00001263799,0.0007091976,0.006136021,0.000056654593,0.40639567,0.000023203462,0.5864876],"study_design_scores_gemma":[0.0009117528,0.00021527066,0.003852223,0.0005530713,0.000023732504,0.0005139347,0.0000034495079,0.46408257,0.0009595857,0.52267,0.0050727767,0.0011416726],"about_ca_topic_score_codex":0.000014105513,"about_ca_topic_score_gemma":0.000067293746,"teacher_disagreement_score":0.86912775,"about_ca_system_score_codex":0.00008425235,"about_ca_system_score_gemma":0.00031431534,"threshold_uncertainty_score":0.9999967},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071495154,0.00017820648,0.9751379,0.0026292081,0.002351769,0.00059040205,0.0000134310385,0.00005335418,0.018330775],"genre_scores_gemma":[0.8328938,0.000007844606,0.14429682,0.012010708,0.0023253306,0.00028055502,0.0000315045,0.00012549586,0.008027919],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981278,0.000029133724,0.00031229277,0.00081427896,0.00031158185,0.00040492104],"domain_scores_gemma":[0.99765074,0.001200515,0.00019825695,0.0007248911,0.00015155057,0.00007402719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071306544,0.0002839698,0.00025057734,0.00033451503,0.00014708031,0.0000955364,0.00089507026,0.00022394976,0.00025311118],"category_scores_gemma":[0.00008279527,0.00021992825,0.00012684008,0.00016521972,0.0004255305,0.00004920413,0.000050863393,0.00044095283,0.0001411007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047812373,0.000048148846,0.0001130228,0.000026587939,0.000026307796,0.0000054597635,0.011801293,0.0029576398,0.00006276201,0.16953419,0.00051926036,0.81485754],"study_design_scores_gemma":[0.0015128178,0.0014998284,0.007986692,0.0016690546,0.000084962216,0.0000624369,0.000017318716,0.023248553,0.0008700226,0.65638417,0.304457,0.0022070995],"about_ca_topic_score_codex":0.000011952189,"about_ca_topic_score_gemma":0.00003429823,"teacher_disagreement_score":0.83217883,"about_ca_system_score_codex":0.000109655026,"about_ca_system_score_gemma":0.00032774755,"threshold_uncertainty_score":0.89684135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000119205564,0.0023967063,0.9936188,0.0004123246,0.0012415419,0.00020150587,0.000006865202,0.00012320763,0.0018798333],"genre_scores_gemma":[0.13710904,0.00032922745,0.8595389,0.0014177227,0.001286366,0.0000065780832,0.000009347321,0.000042984593,0.00025984106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970026,0.000023127488,0.00038911976,0.001208782,0.00072565145,0.0006507025],"domain_scores_gemma":[0.9979837,0.000317626,0.00024365485,0.0010882902,0.00011693173,0.00024982382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006506875,0.0004461964,0.00040842796,0.0004179769,0.0003625145,0.0007965066,0.0020578173,0.00035031428,0.000023443787],"category_scores_gemma":[0.000051328727,0.0003849706,0.000061247614,0.00028444792,0.00037880737,0.0013015389,0.0026588305,0.00096905604,0.00002987336],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012315832,0.000011705255,0.00007923717,0.00001958143,0.0000038627004,0.000026197526,0.00034131217,0.0005406046,0.000114696835,0.03301488,0.00001653408,0.96583015],"study_design_scores_gemma":[0.0005163655,0.00023641158,0.0011081786,0.00089403254,0.000016114285,0.00032298337,2.9758132e-7,0.83258694,0.0017478754,0.14485575,0.016099727,0.0016153334],"about_ca_topic_score_codex":0.000035961446,"about_ca_topic_score_gemma":0.000013787127,"teacher_disagreement_score":0.9642148,"about_ca_system_score_codex":0.00010909781,"about_ca_system_score_gemma":0.00021426173,"threshold_uncertainty_score":0.9998602},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008095598,0.0005245247,0.97950804,0.002286959,0.00049988076,0.0013618771,0.0000025741247,0.000025288822,0.007695272],"genre_scores_gemma":[0.8749336,0.000106509855,0.11812576,0.0033776844,0.000289834,0.000008658561,0.000011453332,0.00002702475,0.0031195018],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987206,0.000017271008,0.00029193558,0.00029165915,0.00052299426,0.0001555476],"domain_scores_gemma":[0.9989594,0.00015334415,0.00024334813,0.00048133617,0.00011925551,0.000043293887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032396155,0.00016596873,0.00030206714,0.00018222857,0.00003888931,0.000017806307,0.00037763463,0.00009609588,0.000121437915],"category_scores_gemma":[0.00006661449,0.00010624523,0.000081473125,0.00016628462,0.000787493,0.00005470401,0.000078641795,0.00020915554,0.00000879381],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059451177,0.00023871142,0.027634416,0.0018936733,0.00015966289,0.00006643129,0.004046895,0.014423309,0.021910064,0.008791881,0.00095206266,0.91982347],"study_design_scores_gemma":[0.0047240737,0.003065496,0.64002377,0.012571876,0.00084000354,0.0004043343,0.000014016615,0.042929705,0.14260381,0.13542445,0.015163022,0.0022354524],"about_ca_topic_score_codex":0.000037663707,"about_ca_topic_score_gemma":0.000010262715,"teacher_disagreement_score":0.917588,"about_ca_system_score_codex":0.000054696666,"about_ca_system_score_gemma":0.00012295232,"threshold_uncertainty_score":0.43325546},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021406344,0.00021000559,0.993464,0.0005831832,0.0026960555,0.001007992,0.0000075953167,0.00027118807,0.0017386092],"genre_scores_gemma":[0.067061484,0.000032691773,0.9319574,0.0003504269,0.0004336483,0.000036162943,0.000011407358,0.000027366319,0.000089409696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723476,0.00007088997,0.0005918693,0.001053587,0.00049470353,0.0005541904],"domain_scores_gemma":[0.99753463,0.0007702652,0.00046500747,0.00069613307,0.00036008828,0.00017385113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017855042,0.00041163396,0.0003918336,0.00067840057,0.000360874,0.00043361305,0.0007789684,0.00034167964,0.00004471516],"category_scores_gemma":[0.00023430167,0.00040406082,0.0001361361,0.0003895238,0.00042463344,0.0010573416,0.00032170227,0.0005211367,0.000012684219],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003078636,0.000007854308,0.00052217697,0.00003127532,0.000009277118,0.0000010394323,0.000340549,0.010032423,0.0003082177,0.04415686,0.0000021413668,0.9445851],"study_design_scores_gemma":[0.00035384513,0.0001218697,0.0012883402,0.00019385335,0.000019857085,0.00009504576,4.6655583e-7,0.9314034,0.0020196903,0.06298244,0.00096540793,0.00055580895],"about_ca_topic_score_codex":0.000016523161,"about_ca_topic_score_gemma":0.000072471834,"teacher_disagreement_score":0.9440293,"about_ca_system_score_codex":0.0004310679,"about_ca_system_score_gemma":0.00053225417,"threshold_uncertainty_score":0.99984115},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018126417,0.000013436337,0.985881,0.00095188397,0.001240722,0.00036176498,0.000009488084,0.00006501786,0.011295457],"genre_scores_gemma":[0.3073109,0.000002829466,0.68840533,0.0019899937,0.00042696408,0.000033371463,0.000010391658,0.000026965146,0.0017932642],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959072,0.00016952594,0.0006779471,0.0013499461,0.0015956468,0.00029975164],"domain_scores_gemma":[0.9923993,0.0049263863,0.00052956096,0.0013969666,0.0006199646,0.00012786397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0050851936,0.00033273172,0.0003573097,0.001229067,0.00047366534,0.00045954017,0.0018734417,0.00039355227,0.00044567024],"category_scores_gemma":[0.0021816147,0.00025733144,0.00012242398,0.0008690649,0.00089403905,0.0003600812,0.00019929095,0.00089489477,0.00027571662],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010237606,0.000019872237,0.000012775381,0.000002643363,9.2060947e-7,0.0000015377182,0.00016842052,0.020420732,0.0013943972,0.015502062,0.000009148537,0.96245724],"study_design_scores_gemma":[0.00010254146,0.000080599966,0.00025596688,0.00005458712,0.000005098123,0.000004982878,3.4908e-7,0.3457104,0.009247109,0.6378062,0.0064717405,0.00026046514],"about_ca_topic_score_codex":0.00000328099,"about_ca_topic_score_gemma":0.000027419965,"teacher_disagreement_score":0.96219677,"about_ca_system_score_codex":0.00011794665,"about_ca_system_score_gemma":0.0002641237,"threshold_uncertainty_score":0.9999879},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033866765,0.00022537327,0.99340326,0.0008642763,0.0033451954,0.0005883135,0.000001931605,0.00014042816,0.0010925554],"genre_scores_gemma":[0.4586627,0.000022578095,0.53508455,0.0036950826,0.0017333587,0.000054547465,0.0000056085855,0.0000807705,0.0006608405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963309,0.000046323134,0.0004760248,0.0016776171,0.0006888438,0.0007802588],"domain_scores_gemma":[0.997248,0.00102836,0.00031035367,0.001065522,0.00021139096,0.00013638042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014113549,0.0005219284,0.00053076516,0.0011556887,0.00027747068,0.00064405537,0.002467152,0.00044712808,0.000005866653],"category_scores_gemma":[0.00030890774,0.0004932261,0.00017615482,0.0006277311,0.00029496,0.00043329626,0.00062873063,0.0009914667,0.000016804774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021316004,0.000014947644,0.00013027244,0.000083797255,0.000012112257,0.00003611239,0.0017533016,0.11400557,0.00032715863,0.004354088,0.00010305239,0.87915826],"study_design_scores_gemma":[0.0011234987,0.00062634266,0.00094277866,0.001112278,0.000019441932,0.00015758417,0.0000011022844,0.8129955,0.008763563,0.16810748,0.0044071926,0.0017432773],"about_ca_topic_score_codex":0.00009299267,"about_ca_topic_score_gemma":0.000650067,"teacher_disagreement_score":0.877415,"about_ca_system_score_codex":0.00039611242,"about_ca_system_score_gemma":0.00027035835,"threshold_uncertainty_score":0.9997519},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018135066,0.00067837577,0.9855826,0.0012749644,0.0018637031,0.00086732674,0.000008246545,0.0008112738,0.008895406],"genre_scores_gemma":[0.37487146,0.0000117144145,0.6220549,0.00182369,0.00042920775,0.000076211254,0.000015675449,0.00009646609,0.00062071905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99470377,0.00011418382,0.00080776884,0.0019729158,0.0014895212,0.0009118495],"domain_scores_gemma":[0.9955814,0.00041221676,0.0006120869,0.002353061,0.0006494588,0.000391806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018793679,0.0008591483,0.0010304779,0.0010380633,0.00024259751,0.0008522393,0.004052649,0.0004681603,0.000011762827],"category_scores_gemma":[0.000039685907,0.0006571875,0.00015366981,0.00072811596,0.000420061,0.0006458445,0.0009005226,0.00093085447,0.00004054994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006811461,0.00015842635,0.0003749742,0.0005407311,0.0001272466,0.0009736307,0.0011304505,0.006050654,0.00016180625,0.12678675,0.0023673368,0.8612599],"study_design_scores_gemma":[0.0036183787,0.0026704774,0.00016284478,0.0066372547,0.00007629257,0.0014386612,0.000007546201,0.8851746,0.003152285,0.052412674,0.03920797,0.0054410417],"about_ca_topic_score_codex":0.0001261384,"about_ca_topic_score_gemma":0.00014218001,"teacher_disagreement_score":0.8791239,"about_ca_system_score_codex":0.000980295,"about_ca_system_score_gemma":0.0010700261,"threshold_uncertainty_score":0.99958795},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007235406,0.0000988589,0.995811,0.0015721669,0.0003745716,0.0010270652,0.000022437196,0.0001650975,0.00085646735],"genre_scores_gemma":[0.64348656,0.000020913654,0.3555097,0.0006217867,0.00015174306,0.00006932908,0.0000069476946,0.000030223106,0.00010279429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977384,0.000028798187,0.0005172964,0.0008657305,0.00048669285,0.00036307602],"domain_scores_gemma":[0.9966417,0.000513395,0.0006283268,0.0016866412,0.0004407103,0.000089219575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003293795,0.00031863837,0.00035863664,0.0002658515,0.00041039352,0.00016181523,0.0024046106,0.00024418678,0.000009431916],"category_scores_gemma":[0.00004727685,0.00027635685,0.00018343472,0.00052466156,0.00060970866,0.0003060356,0.0004250543,0.00036626175,0.000010785759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016854088,0.00017971883,0.00013796464,0.0002249354,0.000015419395,4.1735424e-7,0.00039128595,0.008954752,0.021419413,0.077143036,0.00005996888,0.89145625],"study_design_scores_gemma":[0.00022396061,0.00012534615,0.003349806,0.00031602476,0.00001683398,0.000007843474,4.2609776e-7,0.9665271,0.009807641,0.012340859,0.0069100736,0.0003741096],"about_ca_topic_score_codex":0.000013102335,"about_ca_topic_score_gemma":0.000024669656,"teacher_disagreement_score":0.95757234,"about_ca_system_score_codex":0.0002868937,"about_ca_system_score_gemma":0.00020416552,"threshold_uncertainty_score":0.9999689},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000051431107,0.00012416072,0.9920123,0.00082158984,0.0036374156,0.00036698926,0.000006435955,0.00016425707,0.0028616798],"genre_scores_gemma":[0.014955992,0.0000038197168,0.9822315,0.0014738156,0.0006830815,0.00000819905,0.000010022801,0.000038009664,0.0005955838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99521387,0.00013183238,0.00053113716,0.0018726379,0.0015753501,0.0006751828],"domain_scores_gemma":[0.99668443,0.0004280867,0.00027247248,0.0017262895,0.0005961049,0.0002926433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029342552,0.0005960339,0.00059245154,0.0007635247,0.00032385113,0.00044499643,0.002407426,0.0003976785,0.000015642721],"category_scores_gemma":[0.00011631027,0.00052088447,0.0001808561,0.00066431996,0.000816018,0.00053531106,0.0007204069,0.0010606367,0.00004240425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019233197,0.000045201323,3.8378286e-7,0.000013137466,0.0000057833918,0.00007502309,0.00014740217,0.07047089,0.0005687111,0.0013825956,0.00010127877,0.92717034],"study_design_scores_gemma":[0.00053211063,0.00037093367,0.000010892169,0.00021980202,0.000008455135,0.000060896826,1.147348e-7,0.91381496,0.0045916717,0.07898371,0.00085241784,0.00055401516],"about_ca_topic_score_codex":0.000057014986,"about_ca_topic_score_gemma":0.0000070578753,"teacher_disagreement_score":0.9266164,"about_ca_system_score_codex":0.0006148168,"about_ca_system_score_gemma":0.0012015786,"threshold_uncertainty_score":0.99972427},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009987827,0.000103180355,0.997145,0.0003885248,0.0006742076,0.00091818423,0.00009617411,0.0001960024,0.00037884183],"genre_scores_gemma":[0.9549308,0.0000072443736,0.044189878,0.00055665034,0.000117137606,0.000024329256,0.00013922987,0.000020419508,0.000014333304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961156,0.00007369553,0.0010849794,0.000738052,0.0013513399,0.00063630345],"domain_scores_gemma":[0.9959178,0.00038854807,0.001195548,0.0014773075,0.00083204376,0.0001887491],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008141481,0.00057499215,0.00082001113,0.0008462433,0.00016556395,0.0005289406,0.0025876565,0.0003361859,0.000005288648],"category_scores_gemma":[0.00012908649,0.00047918817,0.00014758362,0.00067859894,0.00038258103,0.0016601904,0.00038244948,0.0004489261,0.000042256914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005298727,0.000030563475,0.000090900176,0.00015946671,0.000050790448,0.000024152536,0.0003974133,0.68125623,0.00017786228,0.010746581,0.00002785647,0.3069852],"study_design_scores_gemma":[0.0015074043,0.00038983338,0.0001463955,0.00049815007,0.000024308618,0.00013013052,1.7750092e-7,0.9906251,0.0014518654,0.0030969384,0.001561446,0.00056824164],"about_ca_topic_score_codex":0.00002437695,"about_ca_topic_score_gemma":0.0000307772,"teacher_disagreement_score":0.9548309,"about_ca_system_score_codex":0.00037148467,"about_ca_system_score_gemma":0.00030947063,"threshold_uncertainty_score":0.999766},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008815463,0.00006323536,0.99081594,0.00037208447,0.001928018,0.00042159623,0.0000033091478,0.00018485564,0.0061228336],"genre_scores_gemma":[0.10341975,0.000005786218,0.8925192,0.0036529738,0.00026800175,0.0000056179547,0.0000035635924,0.000017019438,0.00010812279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973366,0.000023411825,0.00056068134,0.0008362539,0.000717559,0.00052545953],"domain_scores_gemma":[0.997744,0.00008602961,0.00021621765,0.0013880647,0.0003496186,0.00021606489],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005135933,0.00038995012,0.00036814122,0.0011624803,0.00025646234,0.0005450756,0.0026533755,0.00022067694,0.000028843577],"category_scores_gemma":[0.000067666886,0.00038295606,0.000084801824,0.00055286614,0.00021131872,0.0014943273,0.0013813723,0.00047938598,0.0001327179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019768934,0.000015421496,0.00003406955,0.0000355065,0.000005535186,0.000011556816,0.0015190198,0.09590695,0.00010560324,0.092076816,0.000024838642,0.8102627],"study_design_scores_gemma":[0.000086230306,0.000059755333,0.00013977684,0.00039107105,0.0000064611854,0.00007190845,1.4656743e-7,0.8636765,0.00013191531,0.13038024,0.00452828,0.0005277182],"about_ca_topic_score_codex":0.00017505352,"about_ca_topic_score_gemma":0.00007532556,"teacher_disagreement_score":0.809735,"about_ca_system_score_codex":0.00030528594,"about_ca_system_score_gemma":0.00074026524,"threshold_uncertainty_score":0.99986225},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043501827,0.00010812306,0.9942207,0.0007326368,0.0013495751,0.00043713133,0.0000120592995,0.00016292058,0.002541839],"genre_scores_gemma":[0.06221456,0.00009295762,0.93578917,0.0004335026,0.000454869,0.000009191242,0.00016408293,0.000057914396,0.0007837633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968392,0.000029887715,0.0005645388,0.0011755449,0.00092172687,0.00046906297],"domain_scores_gemma":[0.99733835,0.0001553421,0.00047938072,0.0014857247,0.00041963093,0.000121587174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041402437,0.00041216245,0.00043764894,0.0006427449,0.00020368963,0.000676749,0.0036570725,0.00019133055,0.00010354138],"category_scores_gemma":[0.00020914582,0.00038515992,0.00007383302,0.0010606492,0.00042290907,0.001597662,0.0031781849,0.00037363256,0.000073119474],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023558484,0.000034637073,0.0003151684,0.00008287602,0.000027108064,0.000037041737,0.0003972004,0.005766795,0.00032649408,0.025409227,0.00019040481,0.9674107],"study_design_scores_gemma":[0.00068014226,0.000275984,0.0016299838,0.0008880964,0.000042209296,0.00010741687,0.000001645234,0.71947956,0.008362262,0.26097777,0.006296147,0.0012587808],"about_ca_topic_score_codex":0.000051289288,"about_ca_topic_score_gemma":0.000008889238,"teacher_disagreement_score":0.9661519,"about_ca_system_score_codex":0.00018295416,"about_ca_system_score_gemma":0.00022788637,"threshold_uncertainty_score":0.99986005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000034229372,0.0004204969,0.9927044,0.0012923601,0.002138263,0.002242568,0.0000037564741,0.0001603873,0.0010343498],"genre_scores_gemma":[0.009970985,0.00006184638,0.9865668,0.0013095079,0.0009862393,0.00030512013,0.000014651919,0.000043284363,0.00074158603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965711,0.000028781285,0.00053791027,0.00136373,0.0008631413,0.0006353341],"domain_scores_gemma":[0.99662197,0.00097319385,0.00041004812,0.0014190351,0.00046851527,0.00010725005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011174732,0.0004419396,0.00035741052,0.00032201695,0.00043171123,0.0009448612,0.003380374,0.0002692908,0.000020464935],"category_scores_gemma":[0.000057943624,0.00031457414,0.00013310718,0.0005765555,0.00047697857,0.0009665078,0.00077921007,0.00055863225,0.000055080305],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025195031,0.000013219691,0.0000034781792,0.00003078385,0.000009664133,0.0000029449575,0.0005398062,0.027142854,0.00003979528,0.06560237,0.00011702889,0.9064955],"study_design_scores_gemma":[0.00018714297,0.00010681845,0.000026566862,0.00012817059,0.00000783086,0.000021123533,1.891478e-7,0.80059505,0.00015346783,0.196345,0.0021135514,0.00031512664],"about_ca_topic_score_codex":0.000022144895,"about_ca_topic_score_gemma":0.000028053597,"teacher_disagreement_score":0.9061804,"about_ca_system_score_codex":0.0002469992,"about_ca_system_score_gemma":0.00031211204,"threshold_uncertainty_score":0.9999306},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032900373,0.00010507803,0.9790894,0.00018028631,0.0016309906,0.00032302426,0.000004289592,0.0001450544,0.018192884],"genre_scores_gemma":[0.6129899,0.00021869272,0.37272018,0.005451934,0.00075882213,0.000016800397,0.000017669692,0.00006372945,0.007762263],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965966,0.00002679544,0.00041928756,0.0009522272,0.0013422227,0.0006628626],"domain_scores_gemma":[0.9979391,0.00011798817,0.00022144172,0.0012023081,0.00029934183,0.00021981972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076037744,0.00039768088,0.00037031082,0.00088851404,0.00054671295,0.00048566464,0.004239374,0.00027960137,0.00012721436],"category_scores_gemma":[0.0000409103,0.0003494112,0.00013647405,0.0005890866,0.00044998035,0.0011603715,0.0044609485,0.0007525989,0.00029346027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013468494,0.000040570136,0.00049298553,0.000039402497,0.000012812516,0.00014583846,0.003385863,0.00047001,0.00004244088,0.05746818,0.00006237842,0.93782604],"study_design_scores_gemma":[0.0021427518,0.0017530615,0.0068725557,0.0011988981,0.000058687165,0.00029538356,0.0000010487228,0.12127996,0.0091065755,0.8336015,0.01921184,0.0044777333],"about_ca_topic_score_codex":0.0000368943,"about_ca_topic_score_gemma":0.000018110242,"teacher_disagreement_score":0.9333483,"about_ca_system_score_codex":0.0003125389,"about_ca_system_score_gemma":0.00036733926,"threshold_uncertainty_score":0.9998958},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007947633,0.0029584595,0.9936193,0.001477336,0.00086061144,0.000809347,0.00008518813,0.00005868071,0.000051603478],"genre_scores_gemma":[0.004144478,0.00028803642,0.99306124,0.0005224264,0.00128339,0.0000119814795,0.00033549714,0.00003493002,0.00031803444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958255,0.000023757304,0.0004997234,0.0025396538,0.0005023414,0.0006089917],"domain_scores_gemma":[0.9953781,0.00053753867,0.00025233452,0.0035715047,0.00007683927,0.0001837301],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00149869,0.0004318769,0.00051884225,0.00080402754,0.00016357163,0.0017617203,0.0071430113,0.00014845494,0.0000014663732],"category_scores_gemma":[0.00022302354,0.00038328647,0.000021762376,0.0005780149,0.00060459087,0.0026412783,0.0115342075,0.0003350259,0.000002162454],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023914363,0.000013975194,0.00030378622,0.00012026851,0.000014685459,0.000026454694,0.0001553626,0.00093736005,0.0000010060071,0.0058086584,0.00026354566,0.9923525],"study_design_scores_gemma":[0.00033783482,0.00007873034,0.00024885027,0.00039184027,0.000023294864,0.000011746673,4.8809426e-7,0.9273582,0.00000194538,0.067796595,0.003293181,0.00045730596],"about_ca_topic_score_codex":0.000055820652,"about_ca_topic_score_gemma":0.000265517,"teacher_disagreement_score":0.9918952,"about_ca_system_score_codex":0.00007357883,"about_ca_system_score_gemma":0.00036057463,"threshold_uncertainty_score":0.9998619},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69769883,0.00044952647,0.30107656,0.00032788786,0.00022995278,0.00016998222,5.853093e-7,0.000019501414,0.000027166636],"genre_scores_gemma":[0.903747,0.0000072324697,0.095773146,0.0003724114,0.00008284136,0.000005472482,0.0000013640089,0.000008694303,0.0000018054794],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984731,0.00006126069,0.00030706142,0.00039563232,0.00042010564,0.00034283134],"domain_scores_gemma":[0.99849194,0.00073179964,0.000083873565,0.00053762377,0.000065865184,0.00008886837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005395237,0.00015272906,0.00036219315,0.0003099845,0.000050002294,0.000051679803,0.00033419422,0.00006704667,0.0000144857295],"category_scores_gemma":[0.0005726329,0.00012132264,0.000039581348,0.00090506516,0.0004173152,0.00010281494,0.00009548913,0.00021895373,0.0000050719605],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053612053,0.00061537756,0.4511832,0.0006684348,0.000023425,0.00020487871,0.006034157,0.052831776,0.13295367,0.00011107979,0.000022788638,0.3552976],"study_design_scores_gemma":[0.0022287206,0.0008473371,0.20784731,0.00095712446,0.000025270976,0.00017378069,0.000002438102,0.32752413,0.45031235,0.009840228,0.000018228355,0.00022306608],"about_ca_topic_score_codex":0.00018972313,"about_ca_topic_score_gemma":0.000121277095,"teacher_disagreement_score":0.35507452,"about_ca_system_score_codex":0.00013433666,"about_ca_system_score_gemma":0.00013288294,"threshold_uncertainty_score":0.49473938},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008244049,0.0010375235,0.9923157,0.00042140982,0.0046189125,0.0003721994,0.000019441013,0.00023027674,0.0009021143],"genre_scores_gemma":[0.083368205,0.00043780697,0.906556,0.002477321,0.005692924,0.000027533373,0.00011173775,0.00021581534,0.0011126228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968651,0.000025465557,0.000635483,0.00094417715,0.00078894035,0.0007408115],"domain_scores_gemma":[0.9982409,0.00027118553,0.00007144516,0.00088251085,0.00015626081,0.00037768428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026409014,0.0005346469,0.00053925347,0.0005618244,0.00014162294,0.00023615634,0.001445363,0.00037706693,0.000111133566],"category_scores_gemma":[0.00013297527,0.0005367711,0.000119540244,0.000803067,0.00027412298,0.00014327063,0.0004173725,0.0008711992,0.0003463693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035818305,0.00002011078,0.000024223766,0.000020014446,0.000013982955,0.000043062122,0.00025510925,0.85324216,0.00006119153,0.00032295714,0.0009321239,0.1450615],"study_design_scores_gemma":[0.000034774417,0.000066801455,0.00007131775,0.0002941605,0.000014997734,0.000011898668,4.6881024e-7,0.95820224,0.0010112808,0.036458522,0.003136428,0.00069711136],"about_ca_topic_score_codex":0.000057588983,"about_ca_topic_score_gemma":0.0001753826,"teacher_disagreement_score":0.14436439,"about_ca_system_score_codex":0.00076545787,"about_ca_system_score_gemma":0.0004885724,"threshold_uncertainty_score":0.99970835},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025625541,0.00054927863,0.99696374,0.00031910124,0.0007658538,0.00089864404,0.000020908881,0.000059571124,0.00016667695],"genre_scores_gemma":[0.7783385,0.0000034226343,0.2207437,0.00033948323,0.0004779793,0.000020388636,0.0000049582072,0.000023919394,0.000047655747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737424,0.000018576202,0.00047807122,0.00088943803,0.0007358202,0.0005038723],"domain_scores_gemma":[0.99652356,0.0016157832,0.00037342095,0.0010225879,0.0003759136,0.00008873243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008967414,0.00037290182,0.00039479064,0.0003899269,0.000322641,0.00016833426,0.002411674,0.00025020368,0.000009673331],"category_scores_gemma":[0.000112973335,0.00027403474,0.00017174151,0.00026080245,0.00050225644,0.0002880294,0.00083455624,0.00057861686,0.0000033388737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054292877,0.00001997664,0.00014589817,0.000031285093,0.000013542555,0.000002209706,0.0012641634,0.20552798,0.000077467754,0.013120083,0.0000016039169,0.77979034],"study_design_scores_gemma":[0.00027858373,0.00012541583,0.00070322154,0.0002779967,0.000030924795,0.000010385362,2.873615e-7,0.8398146,0.00064542156,0.157689,0.0000803636,0.00034375893],"about_ca_topic_score_codex":0.000043246073,"about_ca_topic_score_gemma":0.000259709,"teacher_disagreement_score":0.7794466,"about_ca_system_score_codex":0.00009723811,"about_ca_system_score_gemma":0.00022170949,"threshold_uncertainty_score":0.9999712},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028189848,0.000046544803,0.9853772,0.00022023113,0.0018768234,0.0007123831,0.00001250984,0.00026365157,0.0114624705],"genre_scores_gemma":[0.9778146,0.000004617473,0.019579055,0.0013313259,0.0006789059,0.000045518813,0.000019662773,0.000070246686,0.00045605304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829155,0.000014427806,0.00041767655,0.0005856294,0.00026378073,0.00042692907],"domain_scores_gemma":[0.99897975,0.00022492885,0.00011380848,0.00049604784,0.00008675797,0.000098692566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002629689,0.00042259847,0.00047398993,0.0004021238,0.00015291416,0.00014302714,0.00063003815,0.00023979486,0.00015231242],"category_scores_gemma":[0.000022328315,0.0003992796,0.00015659507,0.000082967585,0.00019533979,0.00015164512,0.000055249166,0.00051448407,0.000058521637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018146415,0.000023729126,0.0000029217324,0.000041288753,0.000031305466,0.000008249317,0.00038044082,0.6707624,0.00069222326,0.008929467,0.000093716495,0.3190161],"study_design_scores_gemma":[0.0011690886,0.00032746574,0.00013014858,0.00024066426,0.000023456538,0.000020141713,1.9505819e-7,0.9432078,0.00042782535,0.047070034,0.0067889136,0.0005942503],"about_ca_topic_score_codex":0.000016311365,"about_ca_topic_score_gemma":0.00007093702,"teacher_disagreement_score":0.9777864,"about_ca_system_score_codex":0.00035244809,"about_ca_system_score_gemma":0.000052812033,"threshold_uncertainty_score":0.9998459},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022183605,0.00007108597,0.99214107,0.0002399247,0.0004705076,0.00051342364,0.00001370374,0.00026562717,0.0060628364],"genre_scores_gemma":[0.5804486,0.00009976856,0.41372985,0.0053648558,0.0001469152,0.000012178799,0.000009515254,0.00004797356,0.00014031812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968123,0.00015645538,0.00052935415,0.00082964404,0.0011245578,0.0005476911],"domain_scores_gemma":[0.99603504,0.0011768107,0.0004183126,0.0018983842,0.0003471708,0.00012429206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001139499,0.0005133902,0.0006214005,0.0011035044,0.0007040862,0.00014160723,0.0025516262,0.00035395744,0.000011146475],"category_scores_gemma":[0.000323311,0.00048236697,0.00018969775,0.0010956661,0.000606728,0.00044949856,0.00073003117,0.0018622739,0.0000074482605],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001895965,0.0008901977,0.0001308578,0.00020381274,0.0000230314,0.00017183095,0.0025788122,0.032618172,0.001602307,0.005466795,0.0005575228,0.95556706],"study_design_scores_gemma":[0.0010768647,0.0031359827,0.0005622336,0.0017234754,0.000012028704,0.00006145707,4.821435e-7,0.7048217,0.21444698,0.06742906,0.0054441686,0.0012855541],"about_ca_topic_score_codex":0.00004458814,"about_ca_topic_score_gemma":0.000044452572,"teacher_disagreement_score":0.9542815,"about_ca_system_score_codex":0.00044102187,"about_ca_system_score_gemma":0.00048412377,"threshold_uncertainty_score":0.9997628},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050735305,0.00040346163,0.9894487,0.00037872896,0.002632099,0.0007260089,0.0000036658746,0.00024555405,0.0056544095],"genre_scores_gemma":[0.24655761,0.00005322616,0.74143213,0.004224149,0.0007039737,0.00006609693,0.000009062747,0.00015224886,0.006801528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99336547,0.000094627634,0.00094844465,0.0025311245,0.001867145,0.0011931983],"domain_scores_gemma":[0.99556446,0.0010111488,0.00040806446,0.002466378,0.00028049742,0.00026942467],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017499118,0.00083202845,0.00092892296,0.0023678557,0.0002087547,0.0010904521,0.0075589656,0.0005772591,0.00008150955],"category_scores_gemma":[0.0002441513,0.0007623392,0.00015372982,0.001463193,0.00043626493,0.0009756665,0.0023142314,0.0014207141,0.0011695906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013439008,0.00017897891,0.000105394,0.000096103664,0.000017350365,0.0005381843,0.0014768541,0.44803596,0.0002758248,0.019332381,0.00028057536,0.52964896],"study_design_scores_gemma":[0.000569907,0.00014065842,0.00007964892,0.0011364557,0.0000026456114,0.00007033607,7.964485e-8,0.95567125,0.00028261996,0.040399738,0.0007637976,0.0008828878],"about_ca_topic_score_codex":0.000072581075,"about_ca_topic_score_gemma":0.000052831932,"teacher_disagreement_score":0.5287661,"about_ca_system_score_codex":0.0008933965,"about_ca_system_score_gemma":0.00061738293,"threshold_uncertainty_score":0.99994653},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010265002,0.00007197508,0.9806385,0.0048328093,0.0015696839,0.0004316881,0.000009272637,0.000074949,0.011344615],"genre_scores_gemma":[0.79344076,0.000013955353,0.16248864,0.007165687,0.0010185736,0.00002645959,0.000013794545,0.000055365734,0.035776746],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99418604,0.000045606404,0.0007013467,0.0012589376,0.0032393043,0.000568762],"domain_scores_gemma":[0.99666625,0.00067217223,0.00037794717,0.0013185863,0.000685853,0.00027919604],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0034775494,0.00043696922,0.00050981727,0.002125875,0.00033655055,0.0024184359,0.0034744956,0.00023874588,0.00015054627],"category_scores_gemma":[0.0010781249,0.00033375784,0.00015356789,0.0012738571,0.00045166854,0.0008779358,0.001065536,0.00049466034,0.0008987905],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016638012,0.000009952624,0.0007917663,0.000008841516,0.0000067963297,0.000020670299,0.0010012387,0.006677536,0.000042838252,0.02392808,0.003473429,0.9640222],"study_design_scores_gemma":[0.000632253,0.00036083348,0.018802384,0.0005228939,0.00003492041,0.000049917133,0.00001576761,0.050700095,0.00021640498,0.22502084,0.7013842,0.0022595027],"about_ca_topic_score_codex":0.000014066092,"about_ca_topic_score_gemma":0.000112968846,"teacher_disagreement_score":0.9617627,"about_ca_system_score_codex":0.0004057663,"about_ca_system_score_gemma":0.00035056958,"threshold_uncertainty_score":0.9999114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13992676,0.000115299896,0.85786754,0.0012502418,0.00022722977,0.000565333,0.0000027291264,0.000037777296,0.0000070897495],"genre_scores_gemma":[0.6542105,0.000022279983,0.34530932,0.00030608842,0.00009081374,0.0000115916355,0.000042159743,0.000006455039,7.637629e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867314,0.000023493303,0.00020261778,0.00056297885,0.00028344503,0.0002543377],"domain_scores_gemma":[0.99903804,0.000046882047,0.00010942556,0.0005775067,0.00015234553,0.00007581427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030949258,0.00011704732,0.00013582024,0.00013381348,0.00012829722,0.00019658258,0.0002068976,0.000044127934,0.000018114415],"category_scores_gemma":[0.00014601245,0.00009451512,0.000014798276,0.0005773572,0.00012931168,0.0008178995,0.0001656009,0.000115495925,0.0000048851552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008342065,0.00006421058,0.012162225,0.000028726678,0.0000034974964,0.0000069933412,0.00019825753,0.41559982,0.0037979505,0.000003137802,0.0000049806868,0.56812185],"study_design_scores_gemma":[0.00048265935,0.00014814768,0.0064529115,0.00010518074,0.000013670231,0.000024148454,0.000001128134,0.9830931,0.009379622,0.00020119181,0.000005569494,0.00009267775],"about_ca_topic_score_codex":0.0005405209,"about_ca_topic_score_gemma":0.00002494721,"teacher_disagreement_score":0.56802917,"about_ca_system_score_codex":0.00025323263,"about_ca_system_score_gemma":0.00023022672,"threshold_uncertainty_score":0.38542148},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005049878,0.00041017393,0.97343224,0.00063407724,0.0012386562,0.00036748493,0.0000046319706,0.0006253877,0.023236841],"genre_scores_gemma":[0.24588059,0.0001253266,0.7464745,0.0052665663,0.0015995229,0.000028946451,0.000007751034,0.000077497156,0.0005392889],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959048,0.000045402023,0.0005759584,0.0014270508,0.0011509827,0.00089579035],"domain_scores_gemma":[0.99708,0.0005750028,0.00029564204,0.0015458018,0.00024802462,0.00025551306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013545677,0.00057875423,0.0005157509,0.0010192498,0.0002765272,0.00059353607,0.0034611565,0.0004258533,0.00008118722],"category_scores_gemma":[0.00009407078,0.0005453011,0.00016503152,0.0005525656,0.000515307,0.0007568781,0.0012934979,0.0011704968,0.00036276592],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018407004,0.000025719764,0.000019335308,0.000018699408,0.000004567482,0.000040774932,0.00019974883,0.00015819713,0.00011729661,0.042988636,0.000045329052,0.95637983],"study_design_scores_gemma":[0.000563676,0.00077407795,0.00024228643,0.002381053,0.000020484349,0.00037120472,2.4506363e-7,0.10497457,0.048881132,0.82339525,0.015534814,0.0028611792],"about_ca_topic_score_codex":0.000008318245,"about_ca_topic_score_gemma":0.000009869236,"teacher_disagreement_score":0.9535187,"about_ca_system_score_codex":0.00035420468,"about_ca_system_score_gemma":0.00028652177,"threshold_uncertainty_score":0.99969983},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026839036,0.0003677848,0.03172847,0.001173702,0.003351399,0.0008877936,0.000015792652,0.0002245074,0.95956665],"genre_scores_gemma":[0.893481,0.00006936769,0.017355362,0.003113925,0.0016319719,0.000028809833,0.000019855215,0.00007603871,0.08422365],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997916,0.000022247588,0.00040612632,0.00078652054,0.00041548468,0.0004536652],"domain_scores_gemma":[0.998879,0.00017347785,0.00021031348,0.0004288654,0.00020869618,0.00009962359],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034937018,0.00040923743,0.00044344983,0.00024079486,0.00066208944,0.0031963205,0.001946955,0.00014318847,0.0053291926],"category_scores_gemma":[0.000051287694,0.00030102432,0.00008326892,0.000054166667,0.0009583462,0.0008123347,0.0010892809,0.0005920931,0.0006467624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006198695,0.000025860763,0.000008032809,0.00006958025,0.00002769805,0.000027951406,0.05448657,0.0016947929,0.00010263205,0.34597704,0.00066672714,0.5969069],"study_design_scores_gemma":[0.0013870365,0.00069820305,0.000061267354,0.008932194,0.000070187976,0.000074200914,0.00047983485,0.06836766,0.0014159413,0.39464873,0.51926935,0.004595378],"about_ca_topic_score_codex":0.00013729992,"about_ca_topic_score_gemma":0.001573981,"teacher_disagreement_score":0.89079714,"about_ca_system_score_codex":0.00011028982,"about_ca_system_score_gemma":0.000114569724,"threshold_uncertainty_score":0.9999442},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007911442,0.00014702059,0.9932809,0.0017215043,0.0009742614,0.000530172,0.0000018568711,0.00004723543,0.0032179244],"genre_scores_gemma":[0.7902941,0.00003776165,0.20709369,0.0021726242,0.00013591713,0.0000065756217,9.0795885e-7,0.000018424462,0.00024000963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979969,0.000047931706,0.0004066384,0.0006055924,0.0006521122,0.0002908025],"domain_scores_gemma":[0.9978104,0.00088268775,0.00031059468,0.0007735471,0.00016043856,0.00006233442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011748285,0.00026816374,0.00029969713,0.00030475797,0.00022875515,0.0002628626,0.0013317803,0.00015784605,0.00001837193],"category_scores_gemma":[0.00013500983,0.00015145016,0.00011413266,0.00043789245,0.0026414054,0.00016681103,0.0005682366,0.0006198758,0.000003603414],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008016075,0.0000062934896,0.000045616012,0.000011987953,0.000005743418,0.0000026415576,0.0005930096,0.007776786,0.0000071674453,0.24888396,0.0000031121772,0.7426557],"study_design_scores_gemma":[0.0016011605,0.00018179229,0.000982209,0.0009709633,0.000024105555,0.00025760385,0.0000017100422,0.59747756,0.0009017409,0.39541918,0.0014718168,0.0007101277],"about_ca_topic_score_codex":0.000015641966,"about_ca_topic_score_gemma":0.0000736396,"teacher_disagreement_score":0.79021496,"about_ca_system_score_codex":0.00008604673,"about_ca_system_score_gemma":0.00025522982,"threshold_uncertainty_score":0.97323686},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005303883,0.0007937509,0.990702,0.00013827525,0.0012370028,0.00019476944,0.000003573954,0.00086612237,0.005534149],"genre_scores_gemma":[0.6933014,0.00020066195,0.30587724,0.00010762929,0.00040490326,0.000004540535,0.000004074407,0.000044899447,0.00005467163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984168,0.0000049860973,0.00025595122,0.00043317987,0.00035909686,0.0005299977],"domain_scores_gemma":[0.99904066,0.00021505903,0.0000472504,0.00056494185,0.0000544918,0.00007759312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026356243,0.00032745962,0.00027314556,0.00032196866,0.00006811014,0.00008668726,0.0007617745,0.00040742083,0.000038241713],"category_scores_gemma":[0.000052197083,0.00030621275,0.000052445477,0.00026971704,0.00050366577,0.00026237976,0.00025997113,0.0007947983,0.00008405741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.00475e-7,0.0000027408014,0.000040100185,0.000028151928,0.000004749542,0.000008320843,0.00007187372,0.090497285,0.000110669025,0.007033604,0.00001754401,0.90218425],"study_design_scores_gemma":[0.000048827547,0.000033872857,0.00007858375,0.00017221588,0.0000061216624,0.000017021997,7.4987994e-8,0.9408806,0.00049090566,0.05637126,0.0014844557,0.00041605407],"about_ca_topic_score_codex":0.0000019012201,"about_ca_topic_score_gemma":0.000012423858,"teacher_disagreement_score":0.9017682,"about_ca_system_score_codex":0.00029047253,"about_ca_system_score_gemma":0.000042956253,"threshold_uncertainty_score":0.999939},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002476175,0.00036573177,0.9975729,0.000121411125,0.00025003773,0.00027154037,0.0000024037965,0.00008369691,0.0010846896],"genre_scores_gemma":[0.48696443,0.000065306805,0.5126097,0.000119471006,0.00006063772,0.0000061606365,0.0000015405514,0.000014535604,0.00015817402],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974947,0.000028497016,0.0006596037,0.0010715439,0.00043685778,0.00030882974],"domain_scores_gemma":[0.99806106,0.00013276398,0.00048964925,0.0010549839,0.00019257114,0.0000689959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000512248,0.00032378937,0.0004994017,0.0010548279,0.00006516246,0.00010684701,0.0018554209,0.00025328272,0.0000058678247],"category_scores_gemma":[0.00005831743,0.00030897208,0.00007088488,0.0005943591,0.00068564893,0.0005674376,0.0008368284,0.00045723564,0.0000027331296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034776047,0.000013841629,0.00012764308,0.000017541843,0.0000067502538,0.000015993488,0.00095756195,0.0016451838,0.00043321098,0.09003289,0.0000012768469,0.9067446],"study_design_scores_gemma":[0.0001536692,0.00012330557,0.0020877807,0.00018653568,0.000009686091,0.000025796773,2.485019e-7,0.15662678,0.01559282,0.824498,0.00022819958,0.00046719966],"about_ca_topic_score_codex":0.00004465018,"about_ca_topic_score_gemma":0.00015984898,"teacher_disagreement_score":0.9062774,"about_ca_system_score_codex":0.0001967439,"about_ca_system_score_gemma":0.00021486542,"threshold_uncertainty_score":0.9999362},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014643962,0.00017549493,0.98822033,0.00021010084,0.0014229548,0.0003648584,0.000011153564,0.000031168987,0.00809955],"genre_scores_gemma":[0.91898715,0.000027446917,0.07941333,0.0002094685,0.00013333406,0.000005895974,0.0000022592365,0.00002105812,0.0012000472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997641,0.000055278146,0.0006628093,0.0006179572,0.000764705,0.0002582399],"domain_scores_gemma":[0.99733347,0.00022550857,0.00073928,0.0013603355,0.00028737844,0.000054004075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000726561,0.00024993077,0.00036479594,0.0004641931,0.00013934128,0.00006271565,0.002597809,0.00019667018,0.000017036129],"category_scores_gemma":[0.00006993476,0.00017368351,0.00013942267,0.00048926595,0.00042000995,0.00033004148,0.00091824314,0.00028189874,0.000007191815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021634756,0.00015200897,0.003383016,0.00030545538,0.000060545626,0.000009467229,0.0086925365,0.037730142,0.010582209,0.85226965,0.00003218753,0.08676117],"study_design_scores_gemma":[0.0016290277,0.00058609096,0.05850551,0.0044608624,0.00009509011,0.00014390057,0.0000016992869,0.5342873,0.19679487,0.18737786,0.013741342,0.002376475],"about_ca_topic_score_codex":0.000060792605,"about_ca_topic_score_gemma":0.000079020254,"teacher_disagreement_score":0.9175228,"about_ca_system_score_codex":0.000084357525,"about_ca_system_score_gemma":0.0004272337,"threshold_uncertainty_score":0.70826083},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018140957,0.00037932172,0.99627244,0.00031124562,0.0016147194,0.0004896886,0.000022057098,0.00023826215,0.000490829],"genre_scores_gemma":[0.20407179,0.000034873236,0.79450846,0.0007487989,0.00045756286,0.000017481594,0.00009758119,0.000029601575,0.00003386629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961891,0.00005278653,0.0004721469,0.0013874457,0.0012046553,0.0006938671],"domain_scores_gemma":[0.9976538,0.00033889417,0.0003428914,0.0010236932,0.0003589368,0.00028178532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076043024,0.00054525206,0.00043802673,0.000897448,0.000672276,0.0005456029,0.0015125431,0.0003282374,0.00005735497],"category_scores_gemma":[0.00002776726,0.00046526207,0.00013583132,0.0010079611,0.000872588,0.0014997532,0.00092364533,0.0007998116,0.00008268577],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065084554,0.00039326827,0.00062784663,0.00008346847,0.000058442773,0.00007360024,0.0019198224,0.032330714,0.0006393162,0.15470852,0.00015818924,0.8089417],"study_design_scores_gemma":[0.0012124102,0.00037754004,0.005597369,0.00032843067,0.00003707708,0.00028069748,4.9543644e-7,0.7501364,0.0005547964,0.23721768,0.0028609105,0.0013962492],"about_ca_topic_score_codex":0.000040467246,"about_ca_topic_score_gemma":0.0003185075,"teacher_disagreement_score":0.8075455,"about_ca_system_score_codex":0.0002675203,"about_ca_system_score_gemma":0.00049525074,"threshold_uncertainty_score":0.9997799},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016181218,0.0007284422,0.99345934,0.000097458644,0.003532027,0.00039231923,0.000007922125,0.001062387,0.0005582821],"genre_scores_gemma":[0.109250635,0.000014481521,0.8895524,0.00031920106,0.0006459708,0.000024024355,0.0000020854811,0.000064495034,0.00012668237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947522,0.00010382531,0.0005704057,0.0020411042,0.0012691447,0.0012632664],"domain_scores_gemma":[0.9950697,0.0014331244,0.00031116785,0.0026479568,0.00017844827,0.0003596044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014493656,0.00085229345,0.0007732886,0.001008185,0.00036673842,0.00044336094,0.005313336,0.0004471206,0.0000070508618],"category_scores_gemma":[0.00037910644,0.00076396676,0.00013654534,0.00068782223,0.00056992593,0.001213424,0.0015185518,0.0014033584,0.000028815017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051085594,0.000013732428,0.0000067209553,0.000046131743,0.000004888527,0.000050991446,0.001194869,0.49859995,0.00045683226,0.04458002,0.0000013544253,0.4550394],"study_design_scores_gemma":[0.000901331,0.0013017417,0.00045025168,0.003953917,0.00003177422,0.0010932641,0.00000653275,0.63521594,0.034047153,0.31112626,0.0060739163,0.005797905],"about_ca_topic_score_codex":0.000017019534,"about_ca_topic_score_gemma":0.000010464528,"teacher_disagreement_score":0.4492415,"about_ca_system_score_codex":0.0007200905,"about_ca_system_score_gemma":0.0002829431,"threshold_uncertainty_score":0.99948114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029884945,0.00024976375,0.9938928,0.0001237364,0.0005588894,0.00069538516,0.0000017003675,0.00008927983,0.0013999576],"genre_scores_gemma":[0.96657556,0.00002773628,0.03270159,0.00025175553,0.0003091059,0.000039912517,0.000003883411,0.000020329544,0.00007013686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585664,0.000103260965,0.00070671074,0.0014124269,0.0012516337,0.0006693114],"domain_scores_gemma":[0.9978927,0.00045558953,0.00038441853,0.0008360047,0.00030388474,0.00012744941],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00140212,0.0004434907,0.00062277896,0.00069485285,0.00016527982,0.00020851321,0.0025249133,0.00031042617,0.00002119958],"category_scores_gemma":[0.0001141207,0.0004327466,0.00006990654,0.0010847764,0.000406482,0.00053715607,0.001072453,0.001467258,0.00001304278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000119543465,0.00023612966,0.0050972,0.00004981823,0.000012075667,0.00033317835,0.00467195,0.72663456,0.00001051048,0.041589856,0.0000034619354,0.22134928],"study_design_scores_gemma":[0.000426447,0.0007010616,0.0024484,0.0006821696,0.0000071683016,0.00007589944,0.0000013609887,0.7303114,0.00001409193,0.2647259,0.000047516496,0.0005586117],"about_ca_topic_score_codex":0.00015739471,"about_ca_topic_score_gemma":0.0006980154,"teacher_disagreement_score":0.96358705,"about_ca_system_score_codex":0.0002152024,"about_ca_system_score_gemma":0.00046981897,"threshold_uncertainty_score":0.9998124},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047475668,0.0017239846,0.97205126,0.007333249,0.004868749,0.0017152127,0.00001298047,0.0006452502,0.006901763],"genre_scores_gemma":[0.9651281,0.00005934555,0.031563144,0.0019777352,0.0008035259,0.000016227272,0.000028892277,0.000031826057,0.0003911918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802274,0.000020562524,0.00041229054,0.00063255645,0.00046217695,0.00044966032],"domain_scores_gemma":[0.9987149,0.00012554086,0.000219106,0.0005774172,0.00016776368,0.00019527305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046761424,0.00025703438,0.0005301647,0.00056159485,0.00018578226,0.000030912153,0.00029318326,0.00044040542,0.000031420048],"category_scores_gemma":[0.000042142216,0.0002232407,0.000060122555,0.00019279298,0.00037912262,0.00008785855,0.0001289348,0.0009714575,0.0001561711],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009668753,0.000018922678,0.0012410436,0.0008041556,0.000013182312,0.000096115175,0.00032086635,0.00019291458,0.0000336657,0.007648474,0.00011429515,0.9895067],"study_design_scores_gemma":[0.014405558,0.027895097,0.04518289,0.16922231,0.00043981336,0.013315508,0.000034559354,0.38545093,0.022484396,0.19420876,0.11618111,0.0111790765],"about_ca_topic_score_codex":0.00010481282,"about_ca_topic_score_gemma":0.000024599527,"teacher_disagreement_score":0.97832763,"about_ca_system_score_codex":0.00074028276,"about_ca_system_score_gemma":0.0006764709,"threshold_uncertainty_score":0.9103492},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060364325,0.00013498946,0.98286635,0.009824972,0.0020891975,0.00086207385,0.00016797634,0.00013689476,0.0033138827],"genre_scores_gemma":[0.9937146,0.0000013558385,0.0045396998,0.0010676454,0.00034408763,0.0000088940415,0.00001675257,0.000022566763,0.0002844371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956583,0.00046043895,0.0008027109,0.0009998591,0.0013310396,0.00074769685],"domain_scores_gemma":[0.9929872,0.0025761805,0.00059861684,0.002840853,0.0008226167,0.00017454049],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020208727,0.0005962685,0.00074988155,0.00032537614,0.0013197929,0.0003907095,0.0076387553,0.00028227209,0.0000040097257],"category_scores_gemma":[0.0006762849,0.00036616728,0.0003476213,0.0015349854,0.0008063427,0.00012459462,0.00273275,0.0020360476,0.000020719213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027950873,0.000458277,0.00021895679,0.000058332484,0.000077128134,0.000031715903,0.0049592997,0.4854009,0.00019788205,0.4842703,0.007885886,0.01641337],"study_design_scores_gemma":[0.001195896,0.001240208,0.0059770844,0.0029182362,0.000074090916,0.00017907126,0.000015162248,0.6276645,0.002082685,0.328545,0.027656114,0.0024519092],"about_ca_topic_score_codex":0.0009401955,"about_ca_topic_score_gemma":0.00012420237,"teacher_disagreement_score":0.9931109,"about_ca_system_score_codex":0.0023889826,"about_ca_system_score_gemma":0.00062558893,"threshold_uncertainty_score":0.99998033},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009265175,0.00014059278,0.9910288,0.0007099173,0.0014192999,0.00041444247,0.000004082782,0.00034891712,0.0058412906],"genre_scores_gemma":[0.25517765,0.000031760774,0.7375465,0.0017203557,0.0020293386,0.000047988407,0.000025584428,0.00010949178,0.003311321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620384,0.00007184293,0.00043781934,0.001685389,0.0007869833,0.0008141545],"domain_scores_gemma":[0.99727124,0.0009328915,0.0003233125,0.0009891468,0.00028992523,0.0001935043],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010009146,0.00060685433,0.00063334056,0.00065156614,0.00051496486,0.001059242,0.003092175,0.00033044085,0.000022201875],"category_scores_gemma":[0.00016670623,0.0005494309,0.0002060043,0.00041150756,0.0004460872,0.0005455557,0.00085833966,0.001371,0.00003085438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067886494,0.00000961598,0.00001538497,0.00005028182,0.000012384447,0.000011958915,0.0011257847,0.14886066,0.000086476146,0.033405002,0.000021326501,0.8163943],"study_design_scores_gemma":[0.00035277844,0.0003555232,0.000036259047,0.00023790084,0.000007803252,0.000027912445,0.0000010133585,0.89094555,0.00032733183,0.09828056,0.008779885,0.00064746494],"about_ca_topic_score_codex":0.00004125831,"about_ca_topic_score_gemma":0.000035795158,"teacher_disagreement_score":0.8157469,"about_ca_system_score_codex":0.00018335496,"about_ca_system_score_gemma":0.0006944347,"threshold_uncertainty_score":0.99997777},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015069749,0.000078367666,0.99378395,0.0010516039,0.0010378767,0.002213517,0.000025643836,0.00012693706,0.00017512581],"genre_scores_gemma":[0.6697897,0.000020893774,0.32227045,0.004758063,0.002202502,0.00022716666,0.0001351594,0.000090503265,0.00050558033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622077,0.00008521315,0.00053669093,0.0015984914,0.00085785496,0.0007009974],"domain_scores_gemma":[0.997091,0.00090386154,0.00034401665,0.0012706226,0.0002122388,0.00017827698],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001799257,0.0005881726,0.00054117717,0.00034124253,0.00091741985,0.0012145777,0.0029173945,0.00034075155,0.000006313874],"category_scores_gemma":[0.00010200206,0.0004157331,0.00014050305,0.0007388901,0.00028360586,0.00028810615,0.00096384017,0.0006787484,0.000018306577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103267645,0.000090081165,0.0000057583634,0.000115263094,0.000021964179,0.0000066255757,0.0018798917,0.27627188,0.004285857,0.2827718,0.00015226507,0.43429536],"study_design_scores_gemma":[0.0008707712,0.00045142425,0.000060291946,0.00079727924,0.000022715396,0.0000323551,0.0000013422482,0.72857374,0.0020778293,0.25314027,0.012905267,0.0010666891],"about_ca_topic_score_codex":0.000037754493,"about_ca_topic_score_gemma":0.000049510123,"teacher_disagreement_score":0.6715135,"about_ca_system_score_codex":0.00035264745,"about_ca_system_score_gemma":0.00026481017,"threshold_uncertainty_score":0.9998295},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005708145,0.00004101806,0.98831934,0.007539223,0.0006661809,0.00040205172,0.0000056437507,0.000106638545,0.002862826],"genre_scores_gemma":[0.69527274,0.0000054110187,0.29076004,0.01215663,0.0009111274,0.000068930014,0.000007727779,0.000040357107,0.0007770273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971088,0.000046554505,0.0003377637,0.001154449,0.00086540374,0.00048700217],"domain_scores_gemma":[0.99684376,0.0010389425,0.00022247202,0.0016053094,0.0001796732,0.00010987313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000685149,0.00038485145,0.00029413,0.00026049564,0.00061343436,0.00043081658,0.0030004417,0.00017595458,0.000046310637],"category_scores_gemma":[0.000089077774,0.00026840737,0.00012556519,0.00051267084,0.0009008933,0.00019346538,0.0006249059,0.0006470486,0.00013920444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009010861,0.00007672722,0.000034408873,0.000020363186,0.000012782356,0.000027098089,0.00046950387,0.23673837,0.00007988855,0.6028717,0.00040541677,0.15925473],"study_design_scores_gemma":[0.00014601802,0.00009862736,0.00026225953,0.00012413207,0.0000037192776,0.000009659015,5.940154e-8,0.8965461,0.0003850378,0.09710171,0.004999173,0.00032348806],"about_ca_topic_score_codex":0.000012504637,"about_ca_topic_score_gemma":0.00001282089,"teacher_disagreement_score":0.6975593,"about_ca_system_score_codex":0.00015763952,"about_ca_system_score_gemma":0.00040449848,"threshold_uncertainty_score":0.9999768},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.140286,0.000038051097,0.8589139,0.0000129230775,0.00051852706,0.00012124282,3.9197235e-7,0.00006944719,0.000039526178],"genre_scores_gemma":[0.96718067,0.0000073318038,0.032560375,0.00014759295,0.00008347696,0.000009889372,8.6957976e-7,0.000009459913,3.1395624e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942124,0.000010172273,0.00011455781,0.00017157894,0.00013689979,0.00014553047],"domain_scores_gemma":[0.9994777,0.00023626378,0.000024031697,0.00018572574,0.000043096188,0.0000331836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010307922,0.0000865804,0.00008885467,0.00012656389,0.000062677245,0.000022332515,0.00020861372,0.00005102778,0.0000061565897],"category_scores_gemma":[0.00003539372,0.00007931865,0.000018896255,0.00081172236,0.000104785075,0.00008140723,0.000015059787,0.00010714633,0.0000043404175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002276746,0.00004724925,0.0017401924,0.000036694055,0.0000032252703,7.4001093e-7,0.0014292456,0.95550185,0.017670682,0.00026344802,0.000008293379,0.023296108],"study_design_scores_gemma":[0.00016381915,0.00007339714,0.018962743,0.000051091698,0.0000029987646,0.0000069247412,7.3354676e-7,0.74085927,0.23551999,0.0041988404,0.000028102997,0.00013208904],"about_ca_topic_score_codex":0.000025408466,"about_ca_topic_score_gemma":0.00001229435,"teacher_disagreement_score":0.8268947,"about_ca_system_score_codex":0.00003556175,"about_ca_system_score_gemma":0.000017587918,"threshold_uncertainty_score":0.32345206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005629073,0.00021171766,0.87579924,0.001222159,0.0018153404,0.0004140975,0.0000073367846,0.00008178678,0.11988542],"genre_scores_gemma":[0.8575876,0.000008904986,0.12470612,0.0019278734,0.0006698671,0.000017069055,0.000011502079,0.000056886147,0.015014224],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948742,0.000107776104,0.0008719862,0.0016636736,0.0019824605,0.000499938],"domain_scores_gemma":[0.9949896,0.0025536607,0.0003485284,0.0015938524,0.00024700936,0.00026738326],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004354304,0.0004134407,0.000512556,0.0017334092,0.00042304845,0.0004318317,0.002632111,0.00046121786,0.0004351135],"category_scores_gemma":[0.0019213179,0.00032884948,0.00017923514,0.0012323443,0.0008197812,0.00059430074,0.0008124994,0.0008218067,0.0021005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022796796,0.000026164344,0.00038136297,0.000004967107,0.000008293616,0.000019399358,0.003966008,0.028238999,0.000015111255,0.39609042,0.00032249637,0.57090396],"study_design_scores_gemma":[0.00009776323,0.000095601696,0.001776667,0.00009548965,0.000007825252,0.000017130984,8.756656e-7,0.0064875716,0.000071426985,0.9861717,0.0047653792,0.0004125545],"about_ca_topic_score_codex":0.000010898245,"about_ca_topic_score_gemma":0.00009370634,"teacher_disagreement_score":0.85702467,"about_ca_system_score_codex":0.00020027434,"about_ca_system_score_gemma":0.00038486108,"threshold_uncertainty_score":0.9999164},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022536519,0.00017475584,0.9946901,0.0003521081,0.001816931,0.001171433,0.000006552448,0.00010488157,0.0014578236],"genre_scores_gemma":[0.031646114,0.000036675443,0.96751225,0.00012197334,0.00016096717,0.00006081232,0.0000054682237,0.000027728216,0.0004280071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707276,0.000053709562,0.00066547876,0.0010571444,0.00072956074,0.00042133767],"domain_scores_gemma":[0.9973718,0.0005064999,0.0005069155,0.0010082126,0.00050886074,0.00009771806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015076415,0.00036174036,0.00046294878,0.000813333,0.00019257484,0.00021148536,0.0019919658,0.00034895825,0.000023706436],"category_scores_gemma":[0.00020241947,0.00035657617,0.00015957865,0.0007649011,0.00044078552,0.0009902786,0.00015682139,0.00038907517,0.000013100519],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018196044,0.000043222863,0.000008732173,0.00015893705,0.000014781197,0.0000012443157,0.0015393608,0.024397133,0.0037194642,0.070843145,0.000054352065,0.89920145],"study_design_scores_gemma":[0.00038859298,0.00041223658,0.00012612596,0.00023331816,0.00001599266,0.000024316572,3.225745e-7,0.7951383,0.07699592,0.12481367,0.0013468823,0.0005043162],"about_ca_topic_score_codex":0.000020595244,"about_ca_topic_score_gemma":0.000010131215,"teacher_disagreement_score":0.89869714,"about_ca_system_score_codex":0.0003164961,"about_ca_system_score_gemma":0.00047662517,"threshold_uncertainty_score":0.9998886},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6836309,0.0062242667,0.2277693,0.0006190783,0.0039104368,0.0010389818,0.00005422823,0.000085358435,0.076667465],"genre_scores_gemma":[0.9968181,0.00005648933,0.001986556,0.00011402744,0.0004433572,0.000009046332,0.0000068578806,0.000020134712,0.0005454267],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986005,0.00003672725,0.00028890747,0.00058697077,0.00023563151,0.00025126612],"domain_scores_gemma":[0.99830973,0.0006419911,0.0002435441,0.0006188386,0.00012480744,0.000061091836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047679257,0.00025923317,0.00026884073,0.00026417634,0.00012241064,0.00004861137,0.0006220206,0.00016681023,0.0001581135],"category_scores_gemma":[0.000046413264,0.00017093061,0.00007971669,0.00014259794,0.0005239591,0.0000803587,0.00012002825,0.00043227433,0.00003672352],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009979787,0.0001228908,0.01128127,0.00003779427,0.00008797704,0.000003050591,0.028911185,0.0026798032,0.0004678655,0.0058592674,0.00012246893,0.9503266],"study_design_scores_gemma":[0.00066984183,0.00083417736,0.92521995,0.0014391165,0.000048189893,0.00004390163,0.000009145117,0.02593342,0.0013209176,0.04234586,0.0012467374,0.00088873977],"about_ca_topic_score_codex":0.00018306427,"about_ca_topic_score_gemma":0.000021661814,"teacher_disagreement_score":0.9494379,"about_ca_system_score_codex":0.00010822461,"about_ca_system_score_gemma":0.00017355589,"threshold_uncertainty_score":0.6970348},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000113682814,0.000022568183,0.99390703,0.0003262665,0.0026168665,0.00046133346,0.000008039086,0.0001712014,0.0023729873],"genre_scores_gemma":[0.14859441,0.0000021596948,0.8490719,0.001953444,0.00027885378,0.000002515632,0.0000036228757,0.000021586098,0.00007151128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967804,0.000020902069,0.0005664821,0.0012909153,0.0008368619,0.00050442596],"domain_scores_gemma":[0.99746186,0.0004342079,0.00027436545,0.0011264647,0.00043806998,0.00026501846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093290134,0.00039746903,0.00034053304,0.0010012831,0.0002517177,0.00046112222,0.0011908287,0.00029650147,0.00005024378],"category_scores_gemma":[0.00022292028,0.000410694,0.00010529618,0.0006889464,0.00034336487,0.0004122306,0.00039332884,0.00064375374,0.000039985352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057086695,0.000019855592,0.00021685162,0.00002008205,0.0000035299047,0.000025400046,0.000098136145,0.4465044,0.00021212976,0.003470712,0.0000032200505,0.54941994],"study_design_scores_gemma":[0.00019373567,0.00008484773,0.0009902847,0.00012817788,0.0000062929175,0.000023005172,8.94824e-8,0.98171175,0.0014542176,0.014421016,0.00046577482,0.00052080414],"about_ca_topic_score_codex":0.000051355975,"about_ca_topic_score_gemma":0.00020188994,"teacher_disagreement_score":0.5488992,"about_ca_system_score_codex":0.00069429557,"about_ca_system_score_gemma":0.0010207883,"threshold_uncertainty_score":0.9998345},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039602335,0.00032475175,0.9917894,0.0029438706,0.0008529788,0.0005579271,0.0000027733768,0.00051500794,0.00297371],"genre_scores_gemma":[0.54358447,0.00011887446,0.4537228,0.0005079936,0.00051498745,0.00009898123,0.000021130558,0.000044153676,0.0013866217],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969997,0.000029811885,0.00042932256,0.0012475025,0.00064131204,0.0006523825],"domain_scores_gemma":[0.997391,0.0007796852,0.00037231378,0.0010975463,0.00022818585,0.00013126676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067063054,0.00039961239,0.000377542,0.0008383607,0.0003854622,0.0004367229,0.0028415113,0.00043947063,0.000021259611],"category_scores_gemma":[0.00026483356,0.00036382937,0.0001354586,0.00047973107,0.00073620136,0.0008989555,0.00083910866,0.00097260176,0.00007228899],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054182947,0.00001781104,0.0000331372,0.00001303848,0.0000053501685,0.0000010954648,0.00029215787,0.0005185644,0.0003458747,0.2007328,0.0000218944,0.79801285],"study_design_scores_gemma":[0.00045320037,0.00028897254,0.0012494203,0.00016453036,0.000014425728,0.000023146951,0.0000015102978,0.4115851,0.0058188695,0.5335995,0.04582787,0.0009734729],"about_ca_topic_score_codex":0.0000025460927,"about_ca_topic_score_gemma":0.0000059767517,"teacher_disagreement_score":0.7970394,"about_ca_system_score_codex":0.00035311608,"about_ca_system_score_gemma":0.00031693492,"threshold_uncertainty_score":0.9998814},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004844391,0.00017036863,0.9922479,0.0010607974,0.0015487743,0.00096780766,0.000009566837,0.00028758775,0.0036587887],"genre_scores_gemma":[0.80450577,0.000005360633,0.19410634,0.0008564806,0.00020330012,0.00003095031,0.000018556777,0.00003982365,0.00023343087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960827,0.00007109262,0.00063016935,0.0015416072,0.00096563046,0.00070879055],"domain_scores_gemma":[0.9965793,0.0006441595,0.0007216601,0.0014645956,0.00038887345,0.00020143384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075681414,0.0006282963,0.00069403165,0.0006530343,0.00028187913,0.000627083,0.00243648,0.00038951944,0.000017600933],"category_scores_gemma":[0.0001364352,0.0005618819,0.000115025956,0.0004675052,0.00029396132,0.0010014316,0.00039098912,0.00073734473,0.00007963999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080766265,0.00007923615,0.00032665234,0.0000825537,0.00009050259,0.00027930315,0.0021608986,0.29009798,0.00012760652,0.2016511,0.00009715391,0.5049262],"study_design_scores_gemma":[0.0012344966,0.00058053044,0.00025925835,0.00068636227,0.000033727534,0.00011798711,3.282635e-7,0.91703737,0.0004973458,0.07816336,0.00056650565,0.0008227522],"about_ca_topic_score_codex":0.0001258836,"about_ca_topic_score_gemma":0.00007330902,"teacher_disagreement_score":0.8044573,"about_ca_system_score_codex":0.00045711943,"about_ca_system_score_gemma":0.00049101445,"threshold_uncertainty_score":0.99968326},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059944512,0.00017045422,0.984048,0.0016616774,0.00092739356,0.0002663207,0.0000032884252,0.00008072127,0.012782178],"genre_scores_gemma":[0.653199,0.00055047974,0.34125727,0.002659172,0.00036194848,0.000013236575,0.000008239468,0.000050380728,0.0019002601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786586,0.000037705013,0.00044280608,0.000651562,0.00070279505,0.0002993017],"domain_scores_gemma":[0.99728626,0.0011192695,0.00032511132,0.00096073217,0.00022193248,0.00008671753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044319776,0.00026355544,0.0002598206,0.0004010848,0.00046393723,0.00019698628,0.0014288706,0.00016793744,0.000024185018],"category_scores_gemma":[0.00014657677,0.00020109043,0.00010813298,0.0004353639,0.0005820907,0.0003215967,0.00030473806,0.00054934993,0.000043663043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007653193,0.000019072824,0.00008759441,0.000006887157,0.000013984386,0.00001965901,0.0007983001,0.04162138,0.00002843947,0.20371702,0.00013109983,0.7535489],"study_design_scores_gemma":[0.00054793153,0.0004054699,0.0041473634,0.0004521046,0.000014077616,0.00014086184,6.090149e-7,0.9023625,0.00067553186,0.07929761,0.011209171,0.00074674794],"about_ca_topic_score_codex":0.000011363099,"about_ca_topic_score_gemma":0.000070816604,"teacher_disagreement_score":0.86074114,"about_ca_system_score_codex":0.00016175906,"about_ca_system_score_gemma":0.00048003218,"threshold_uncertainty_score":0.82002294},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011099008,0.00021518426,0.98712045,0.0006488105,0.0022036487,0.00018758918,0.000007602914,0.00013860736,0.008368188],"genre_scores_gemma":[0.5808049,0.000026709635,0.41700944,0.000762871,0.0008302983,0.0000052070445,0.0000044311296,0.00003719678,0.00051893975],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996367,0.000049759296,0.00069364463,0.001335196,0.00106877,0.00048562986],"domain_scores_gemma":[0.9956641,0.0016966462,0.00043095692,0.0017724258,0.00028051378,0.00015534023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065034884,0.00041795458,0.00056702684,0.00067899394,0.00017383577,0.0003085823,0.004717648,0.00031866008,0.00008038206],"category_scores_gemma":[0.00039572365,0.00038864408,0.00016414208,0.0005034229,0.0013948026,0.00032710333,0.0014683256,0.00061537756,0.00018745229],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000488581,0.000026665075,0.00011003025,0.0000167174,0.000014053424,0.000024478311,0.0028164291,0.021677965,0.00044047539,0.10173265,0.00004324808,0.8730924],"study_design_scores_gemma":[0.00008241932,0.00023865631,0.00022613759,0.00050745404,0.000011355195,0.00002246955,7.7035685e-7,0.3924894,0.010624739,0.58696544,0.008144717,0.0006864383],"about_ca_topic_score_codex":0.0002528862,"about_ca_topic_score_gemma":0.00015245451,"teacher_disagreement_score":0.87240595,"about_ca_system_score_codex":0.0000971927,"about_ca_system_score_gemma":0.00031841113,"threshold_uncertainty_score":0.99985653},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047720072,0.00026331178,0.9848334,0.00094226614,0.0019860747,0.00045263307,0.0000021935705,0.000114887865,0.010928036],"genre_scores_gemma":[0.303494,0.000059462873,0.6934845,0.002130516,0.00048944954,0.000020304024,0.000007374666,0.00003644232,0.0002779724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962774,0.000053907683,0.0006074504,0.0015021828,0.0007691225,0.0007899557],"domain_scores_gemma":[0.9980451,0.00028008412,0.00026237106,0.0011269569,0.00012596043,0.00015952527],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00086772867,0.0005097311,0.0005158677,0.0006982204,0.00029399508,0.0013997606,0.0027566215,0.0004361356,0.000081543316],"category_scores_gemma":[0.00006347816,0.00045275255,0.00011406742,0.0006814751,0.00041209545,0.0010674816,0.001087498,0.001038482,0.00018194003],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036812905,0.00003164376,0.00025465467,0.00002400709,0.0000047655262,0.00012324446,0.0009857923,0.028280532,0.00004636651,0.039898258,0.000044739452,0.9303023],"study_design_scores_gemma":[0.00024184056,0.00016515012,0.0011459636,0.00021961902,0.0000024208548,0.00005281296,1.2636427e-7,0.8413512,0.00014439925,0.15473281,0.001337057,0.00060657214],"about_ca_topic_score_codex":0.00011327156,"about_ca_topic_score_gemma":0.00011474505,"teacher_disagreement_score":0.9296957,"about_ca_system_score_codex":0.00034608602,"about_ca_system_score_gemma":0.00052059017,"threshold_uncertainty_score":0.9997924},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041537045,0.00016778296,0.9944955,0.0005119097,0.000971392,0.00021173574,0.0000016344925,0.00019345162,0.003031199],"genre_scores_gemma":[0.52114177,0.000036391633,0.47622508,0.0018994322,0.0004024556,0.0000050305903,0.00000883951,0.00003112868,0.0002498607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974077,0.000042414278,0.00038454073,0.0011323219,0.000631941,0.00040112814],"domain_scores_gemma":[0.99831605,0.00047835786,0.00026370175,0.0006673696,0.00014498572,0.00012954864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008880032,0.0003764782,0.0003834161,0.00035718855,0.00021315193,0.00058346917,0.0012599609,0.00023113866,0.000015065293],"category_scores_gemma":[0.00005446521,0.00034605805,0.00006251414,0.00031704077,0.00041644793,0.00048777155,0.00078872906,0.00039578063,0.000079705984],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001563011,0.000006900956,0.000119315795,0.00002664195,0.000004676307,0.0000123742975,0.00027175227,0.0053152135,0.00003727964,0.09576986,0.000023483093,0.8984109],"study_design_scores_gemma":[0.00016011242,0.000048962745,0.0004454188,0.00016842884,0.000004337568,0.00007244139,4.952072e-8,0.616956,0.00014213163,0.38092762,0.0007151049,0.00035938428],"about_ca_topic_score_codex":0.0000116840565,"about_ca_topic_score_gemma":0.000014961776,"teacher_disagreement_score":0.89805156,"about_ca_system_score_codex":0.00013113188,"about_ca_system_score_gemma":0.0001557321,"threshold_uncertainty_score":0.99989915},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011638963,0.00042513185,0.9945507,0.00033151338,0.0018468522,0.00032117974,0.000003699611,0.00032644827,0.0010305954],"genre_scores_gemma":[0.33509925,0.00001816234,0.6633819,0.0011517208,0.00015923037,0.000011140436,0.0000017535965,0.000037836246,0.000139058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578565,0.00011313967,0.00064199563,0.0017433929,0.0007681422,0.00094764883],"domain_scores_gemma":[0.9968059,0.00070790574,0.0003213832,0.0017103464,0.00022406656,0.00023036217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019724823,0.0005923324,0.0006337142,0.00046198053,0.00033306,0.0005175168,0.0030106045,0.00034141194,0.000043693253],"category_scores_gemma":[0.00017860602,0.0005506282,0.00018850308,0.00063452503,0.00063335546,0.0006934775,0.00082076574,0.00092822826,0.00009497984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020259047,0.00010921489,0.00091947854,0.00007122271,0.000023334904,0.0003191612,0.0014272638,0.043826364,0.0025506024,0.0063645113,0.000010437477,0.94435817],"study_design_scores_gemma":[0.00070742454,0.0002574902,0.002108517,0.0005287244,0.000011684588,0.000057521327,2.4596778e-7,0.96028197,0.01911318,0.014194124,0.0016439612,0.0010951314],"about_ca_topic_score_codex":0.00003736016,"about_ca_topic_score_gemma":0.000103631115,"teacher_disagreement_score":0.943263,"about_ca_system_score_codex":0.00019688273,"about_ca_system_score_gemma":0.00046176955,"threshold_uncertainty_score":0.9996945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031814495,0.000103139944,0.98757976,0.008944713,0.00040020642,0.0006696894,0.00008052707,0.0000852272,0.0021335708],"genre_scores_gemma":[0.03577399,0.000011573184,0.95703757,0.006645951,0.0003639672,0.00001956577,0.000073702744,0.00002108296,0.00005262048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965324,0.000048975868,0.00037815183,0.0017919434,0.00081745407,0.00043107884],"domain_scores_gemma":[0.9951593,0.00096522935,0.00021627572,0.0032758354,0.000205975,0.00017737233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025654042,0.00039679295,0.0002972367,0.00031106357,0.00033864946,0.0005899936,0.0042480584,0.00024277432,0.000004683863],"category_scores_gemma":[0.00021652902,0.0002823869,0.00004713096,0.0006843997,0.0004733006,0.00034769415,0.0013161569,0.0006186207,0.000015319767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007872673,0.00003076164,0.000004281755,0.0000144075275,0.0000034809473,0.0000048078227,0.00010284856,0.00051641307,0.0013154089,0.13482592,0.00029721815,0.8628766],"study_design_scores_gemma":[0.000119951925,0.000067934496,0.0002925804,0.00011101226,0.000007094779,0.000016218175,6.746011e-8,0.9311416,0.00083713676,0.060771562,0.0062749474,0.00035987282],"about_ca_topic_score_codex":0.000011547409,"about_ca_topic_score_gemma":0.000021307,"teacher_disagreement_score":0.9306252,"about_ca_system_score_codex":0.00015506572,"about_ca_system_score_gemma":0.00023232255,"threshold_uncertainty_score":0.9999628},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035019763,0.00084043905,0.99559903,0.0006848721,0.0011733412,0.0006181338,0.000014041566,0.00018882962,0.0005311315],"genre_scores_gemma":[0.4316422,0.000110941844,0.5668202,0.0010474533,0.00020694493,0.000011615782,0.0000037681561,0.000041646155,0.00011523181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99465406,0.00021243443,0.0010666448,0.0018408934,0.0014459114,0.00078003504],"domain_scores_gemma":[0.9954868,0.0012225013,0.00053558894,0.0021442734,0.0003947802,0.00021604978],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014275616,0.00070307765,0.0009866244,0.00091659685,0.00019616267,0.00023933419,0.0056638783,0.00042865484,0.000033248],"category_scores_gemma":[0.00026574804,0.0006334257,0.00028083785,0.00062521413,0.0014243914,0.00035952684,0.0014528814,0.0010201265,0.000038870414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012477723,0.0002695407,0.00019053888,0.00039812393,0.00008582799,0.00025136088,0.012686273,0.239607,0.0012020549,0.012202951,0.00020459754,0.73277694],"study_design_scores_gemma":[0.0016290584,0.0017938904,0.0009810452,0.0018633752,0.000034617828,0.0005787658,0.000001315096,0.51509553,0.035769984,0.43626407,0.002668289,0.0033200507],"about_ca_topic_score_codex":0.000056833596,"about_ca_topic_score_gemma":0.00003108753,"teacher_disagreement_score":0.7294569,"about_ca_system_score_codex":0.00025630742,"about_ca_system_score_gemma":0.0007021102,"threshold_uncertainty_score":0.999716},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34991068,0.0000034795173,0.6480747,0.0005330144,0.00085962994,0.00018427025,6.6151665e-7,0.00011802324,0.00031556928],"genre_scores_gemma":[0.98526436,0.000002951107,0.011216748,0.0033236702,0.00015407163,0.000026089712,1.8864728e-7,0.000010467359,0.0000014349174],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979441,0.00009129765,0.00020371357,0.0008119553,0.0004987977,0.00045010232],"domain_scores_gemma":[0.9952269,0.004125048,0.00010624335,0.00037248843,0.00009712424,0.0000721723],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00050970085,0.00019220037,0.00017172363,0.0004412899,0.0004710534,0.00009298436,0.00046772527,0.00007217302,0.000025096295],"category_scores_gemma":[0.010130727,0.00017396355,0.000048012324,0.0019955626,0.00056659797,0.0010717597,0.00026432963,0.00029196695,0.000040794643],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010683083,0.00016705375,0.0038028092,0.000021124024,0.0000040452683,0.00001347232,0.0038071272,0.0059319907,0.40465865,0.00067141687,0.000012510998,0.580803],"study_design_scores_gemma":[0.0002567775,0.00019853783,0.023162488,0.000022537608,0.0000016874169,0.00003111771,0.0000025049608,0.04905528,0.9132428,0.013744152,0.000072046845,0.00021004671],"about_ca_topic_score_codex":0.00010814308,"about_ca_topic_score_gemma":0.00026173345,"teacher_disagreement_score":0.6368579,"about_ca_system_score_codex":0.00027441868,"about_ca_system_score_gemma":0.00015927173,"threshold_uncertainty_score":0.9982074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000459938,0.00066023617,0.9920796,0.0006255054,0.0013052305,0.00036740108,0.0000032389078,0.00021663774,0.004696138],"genre_scores_gemma":[0.020635474,0.00006046835,0.97630286,0.0012922442,0.00079622987,0.0000124855505,0.000012883315,0.0000461148,0.000841263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617565,0.000038342212,0.00044491855,0.0017896332,0.0009111117,0.0006403485],"domain_scores_gemma":[0.9979224,0.00027535434,0.0002527623,0.0010681499,0.0002416929,0.00023959098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060490274,0.0005534802,0.00050637126,0.0007614618,0.00045553697,0.0008554851,0.0018545832,0.0003198689,0.000054475782],"category_scores_gemma":[0.000049675225,0.0004939333,0.00011088022,0.00064508565,0.00065289834,0.0005571434,0.0014422315,0.00091696926,0.000034010616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017944251,0.000024102455,0.000013119739,0.000044825945,0.0000122250885,0.000016879812,0.00034826994,0.7244582,0.000010766095,0.043983508,0.00009609291,0.23099022],"study_design_scores_gemma":[0.00021490722,0.00009658334,0.000065688815,0.00015413477,0.0000060503276,0.00024290722,1.6020195e-7,0.904982,0.000018844588,0.09301639,0.0006704691,0.0005319071],"about_ca_topic_score_codex":0.000018322444,"about_ca_topic_score_gemma":0.0000019071214,"teacher_disagreement_score":0.2304583,"about_ca_system_score_codex":0.00013913629,"about_ca_system_score_gemma":0.0004173313,"threshold_uncertainty_score":0.9997512},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030492125,0.0001562898,0.998338,0.00026926535,0.0005428805,0.00045184983,0.000005088644,0.00015513925,0.000051032268],"genre_scores_gemma":[0.19279274,0.000121309924,0.8067566,0.00022893997,0.000049204365,0.000012151791,0.0000017354016,0.000010010865,0.000027256636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982765,0.000025910127,0.0003631758,0.0006896863,0.00037574698,0.00026899893],"domain_scores_gemma":[0.9975353,0.0011103452,0.00030792592,0.00073470606,0.00024828204,0.00006342816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000719889,0.00025743933,0.00038198192,0.0006688675,0.00021383718,0.00018048982,0.00113674,0.0002087096,0.000016452366],"category_scores_gemma":[0.000082908,0.00018913257,0.000081634396,0.00095027126,0.0005722625,0.000295343,0.00030535593,0.0002784356,0.0000017278298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057855104,0.0000071090403,0.000091077134,0.000016970062,0.000068867084,0.0000014235786,0.00046806555,0.25800782,0.000006485395,0.022072311,0.0000025303193,0.7192516],"study_design_scores_gemma":[0.000109807734,0.00008796467,0.0020792626,0.000086925604,0.000065634296,0.000009430629,8.956456e-8,0.9436567,0.0005118164,0.053166207,0.000019086918,0.00020706268],"about_ca_topic_score_codex":0.00003675072,"about_ca_topic_score_gemma":0.0000215439,"teacher_disagreement_score":0.7190445,"about_ca_system_score_codex":0.000053066888,"about_ca_system_score_gemma":0.00019676735,"threshold_uncertainty_score":0.77126026},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011972076,0.000591192,0.9939546,0.0018357593,0.0008916814,0.0018159499,0.000015287203,0.0005066574,0.00037692423],"genre_scores_gemma":[0.0073662647,0.00002992363,0.988635,0.0025854846,0.00039255078,0.000078954356,0.00002143253,0.00006710662,0.0008232878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601597,0.00003901993,0.00061051286,0.0018047496,0.00069400703,0.00083573704],"domain_scores_gemma":[0.99648094,0.0007796776,0.00045731664,0.0015221514,0.00055517274,0.0002047341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009820677,0.0007308077,0.0007483621,0.0008187876,0.00038051078,0.000820921,0.0028899482,0.00059327425,0.000023008495],"category_scores_gemma":[0.00016683716,0.0006461924,0.00032346573,0.00068840495,0.0003469447,0.0015665519,0.00039150857,0.0009446091,0.000017096705],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039261806,0.000027262035,0.000002519132,0.0000973988,0.00001432251,0.000012897938,0.00023322251,0.0034232151,0.0060751312,0.0045313234,0.00010877962,0.98543465],"study_design_scores_gemma":[0.00089023367,0.00029834858,0.000013448852,0.0004446657,0.00001392965,0.000019389117,1.2668494e-7,0.7220398,0.028814659,0.24127235,0.00530836,0.00088469055],"about_ca_topic_score_codex":0.000014497858,"about_ca_topic_score_gemma":0.00002002166,"teacher_disagreement_score":0.98455,"about_ca_system_score_codex":0.00033244462,"about_ca_system_score_gemma":0.0005215371,"threshold_uncertainty_score":0.9995989},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031901214,0.00021099014,0.9882962,0.0043736,0.0005980867,0.0012840326,0.0000046567616,0.00045700316,0.004743528],"genre_scores_gemma":[0.036974285,0.000027240827,0.95472497,0.006204405,0.0004743085,0.00014192385,0.000006501422,0.000054041255,0.0013923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651057,0.000047995058,0.0005005913,0.0014152153,0.00082565576,0.0006999614],"domain_scores_gemma":[0.9959444,0.0016486788,0.00035444743,0.001510456,0.00040676584,0.00013530026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010137907,0.00057135493,0.00046356395,0.0006345853,0.00050721096,0.00090082025,0.004778638,0.0002881171,0.00002781747],"category_scores_gemma":[0.00035480273,0.00037946927,0.00018307785,0.00049197546,0.0005559061,0.00019239676,0.00079497386,0.00079393265,0.000053147494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015383803,0.00004336558,0.0000035627213,0.00005419879,0.000016588618,0.0000076718425,0.00053346856,0.43066725,0.00001441779,0.30424097,0.0017088392,0.26269427],"study_design_scores_gemma":[0.00012893346,0.00018137378,0.000005991705,0.00015611522,0.0000027940334,0.000011794336,4.0048537e-8,0.58024037,0.00042163927,0.41690668,0.0016011273,0.00034313198],"about_ca_topic_score_codex":0.00000956574,"about_ca_topic_score_gemma":0.000009486112,"teacher_disagreement_score":0.26235116,"about_ca_system_score_codex":0.0001236817,"about_ca_system_score_gemma":0.00040904875,"threshold_uncertainty_score":0.9998657},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015893506,0.00006574861,0.99626905,0.0004636176,0.00092744327,0.00028871055,0.000004476093,0.000031315536,0.0017906968],"genre_scores_gemma":[0.5060038,0.000010350514,0.48527065,0.00075155013,0.0050211153,0.000015373642,0.00003122685,0.00005855967,0.0028373569],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986057,0.0000043566397,0.00020843255,0.0006076019,0.00025299532,0.0003208656],"domain_scores_gemma":[0.99934226,0.000063849024,0.00010478454,0.0002973168,0.000052438132,0.0001393352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057059282,0.00025884254,0.00026660625,0.00012404435,0.00014203078,0.00010274667,0.0004055635,0.00010873938,0.0003509139],"category_scores_gemma":[0.0000030470849,0.00022250149,0.00013318531,0.00012136991,0.00011695307,0.000091811795,0.00016049604,0.0003645339,0.00001685459],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014192598,0.000024296716,0.00006442643,0.000010705881,0.0000087975595,0.000001664554,0.00009343932,0.028892713,0.00020904704,0.07885425,0.00011689264,0.89170957],"study_design_scores_gemma":[0.0008410398,0.00018966499,0.000051547,0.0002595277,0.0000136053,0.0000044607023,1.5091803e-7,0.30159685,0.00076904637,0.6849716,0.010710948,0.0005915686],"about_ca_topic_score_codex":0.000039273345,"about_ca_topic_score_gemma":0.0000021016524,"teacher_disagreement_score":0.891118,"about_ca_system_score_codex":0.000082620536,"about_ca_system_score_gemma":0.00030590047,"threshold_uncertainty_score":0.90733474},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009963317,0.00026648413,0.98909336,0.0006321009,0.0011093734,0.0002977623,0.0000018729397,0.000099439596,0.007503289],"genre_scores_gemma":[0.67412275,0.000026979427,0.3240783,0.0009621192,0.00041923329,0.000011377527,0.0000017623139,0.00002297778,0.00035447977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703574,0.000024108123,0.000423842,0.0010558371,0.00093449344,0.00052595214],"domain_scores_gemma":[0.9975959,0.00046210972,0.00029587297,0.0013234788,0.00020606458,0.00011655084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003772497,0.00040853283,0.00064851815,0.00042326274,0.00009169615,0.0002151731,0.0033213028,0.00020850364,0.000028675058],"category_scores_gemma":[0.00006104281,0.00032834944,0.00015836647,0.00030391724,0.0008479091,0.00038824332,0.0013727735,0.00045867552,0.00007890297],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006543746,0.00007903809,0.00006472557,0.00005925001,0.000021803202,0.000060865685,0.0014104482,0.0036199728,0.0013276449,0.1607943,0.000071485454,0.83248395],"study_design_scores_gemma":[0.00046260073,0.0007436854,0.00066205923,0.0004279012,0.000015959464,0.00009028587,6.5918766e-7,0.49818137,0.009017306,0.4879642,0.0015166797,0.00091727194],"about_ca_topic_score_codex":0.00003861222,"about_ca_topic_score_gemma":0.000024333016,"teacher_disagreement_score":0.83156663,"about_ca_system_score_codex":0.0001444358,"about_ca_system_score_gemma":0.00031238658,"threshold_uncertainty_score":0.99991685},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010597912,0.0003533167,0.9961032,0.00015319277,0.0011804999,0.0004910494,0.00007092597,0.000075213495,0.0005128079],"genre_scores_gemma":[0.99833715,0.0000067544097,0.0010192818,0.00020960372,0.00028964493,0.000023336996,0.000010505,0.00003572344,0.000068024085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833,0.00002458098,0.00038762458,0.00036214717,0.0005676067,0.0003280685],"domain_scores_gemma":[0.9977586,0.0014006505,0.00014670678,0.000518197,0.000115712,0.000060092458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026346144,0.00034571678,0.00046244854,0.0002324343,0.000109780274,0.00015945683,0.00078279874,0.0002937335,0.000042960877],"category_scores_gemma":[0.00008892524,0.00024087483,0.000103561164,0.00013079145,0.00027936805,0.00005771143,0.000035132904,0.00069541065,0.0000053073622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039941133,0.000040648432,0.00001757735,0.00015864485,0.00007686219,0.0000036903923,0.00014073725,0.8520693,0.0040013995,0.0053255507,0.00009286427,0.13803275],"study_design_scores_gemma":[0.0003785304,0.00009049796,0.0000050649455,0.00020223309,0.000021022299,0.0000012195646,1.1303215e-7,0.99471635,0.0022236544,0.0019901916,0.00012231545,0.00024878496],"about_ca_topic_score_codex":0.00002951136,"about_ca_topic_score_gemma":0.000031469805,"teacher_disagreement_score":0.9972773,"about_ca_system_score_codex":0.00010074517,"about_ca_system_score_gemma":0.00012495351,"threshold_uncertainty_score":0.98225904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053728265,0.00013571001,0.98967546,0.000026046928,0.00027830168,0.00023248394,0.000019571238,0.0001453868,0.004114209],"genre_scores_gemma":[0.9116662,0.000003916972,0.08782437,0.000060335064,0.00030907497,0.000011987493,0.000020254927,0.00005557956,0.00004829297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980789,0.000035053068,0.00043769914,0.00055794156,0.000388196,0.00050224597],"domain_scores_gemma":[0.99832106,0.00051386753,0.00013532933,0.0007907189,0.000107426844,0.00013159866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006054816,0.00044359945,0.00050373666,0.00024003713,0.000116578994,0.00016686517,0.0015296128,0.00022507095,0.000013251593],"category_scores_gemma":[0.00012471342,0.00031810315,0.00014433748,0.00044767588,0.00060063787,0.00006859219,0.00039793347,0.0007833628,0.000012733857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023757195,0.0000046802534,0.00005004742,0.000036198835,0.000017241222,0.0000021102678,0.0005014929,0.9632808,0.00045343407,0.00040640193,0.00004984266,0.035195373],"study_design_scores_gemma":[0.00008095095,0.000092010356,0.00023889993,0.00075088145,0.0000061638334,0.000025923358,2.47376e-7,0.99472576,0.00037586578,0.0032748561,0.0000629897,0.00036545238],"about_ca_topic_score_codex":0.000028658938,"about_ca_topic_score_gemma":0.000010132066,"teacher_disagreement_score":0.90629333,"about_ca_system_score_codex":0.00029620653,"about_ca_system_score_gemma":0.000117466516,"threshold_uncertainty_score":0.9999271},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010488915,0.00032967498,0.9420677,0.00027063946,0.0007233038,0.00015646039,0.000010931597,0.000018465156,0.056317925],"genre_scores_gemma":[0.8785297,0.000037421614,0.114110045,0.0020838422,0.0027051235,0.00006349528,0.00012075222,0.000042391493,0.002307232],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983582,0.000037270835,0.00028931184,0.000654051,0.00027624427,0.00038491888],"domain_scores_gemma":[0.99886143,0.0006175509,0.00009133427,0.0002860081,0.0000881311,0.000055564935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015834329,0.00026461924,0.00037320392,0.00028968605,0.000077888464,0.000075059565,0.0007602353,0.00009553761,0.00009290739],"category_scores_gemma":[0.000013955356,0.00024051637,0.00008205905,0.0006317136,0.0005608583,0.00016927862,0.00035254206,0.00055404834,0.000030567535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058982746,0.000040980365,0.0003835352,0.000020620388,0.0000032212583,0.000003976763,0.000067825196,0.06335601,0.000003138937,0.43585923,0.000057019137,0.50019854],"study_design_scores_gemma":[0.00018358072,0.00003136659,0.0001293046,0.00021511358,0.000004010131,4.1733853e-7,2.418754e-7,0.031524394,0.00012174478,0.9646513,0.0029064924,0.00023202189],"about_ca_topic_score_codex":0.000010946536,"about_ca_topic_score_gemma":0.000009688083,"teacher_disagreement_score":0.8784248,"about_ca_system_score_codex":0.000109284396,"about_ca_system_score_gemma":0.00084002403,"threshold_uncertainty_score":0.9807973},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038433392,0.000016283624,0.9956852,0.0003080554,0.0005180661,0.00043043352,0.00009748286,0.000017654469,0.0025424522],"genre_scores_gemma":[0.6317535,2.7989583e-7,0.36629298,0.00065372954,0.0008558977,0.000020220932,0.00003949948,0.000020089019,0.00036379712],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984073,0.0000075202242,0.00022497185,0.00063474884,0.00040443634,0.00032101537],"domain_scores_gemma":[0.9975995,0.0017261466,0.000040364775,0.00031080723,0.00021633902,0.00010683961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025407659,0.00021942315,0.00024870154,0.00021787781,0.00016067337,0.00012795455,0.0006295728,0.000058241396,0.0000609191],"category_scores_gemma":[0.00003050042,0.00018975284,0.000118941236,0.00024621803,0.00019225545,0.00002815621,0.00042393396,0.00024403422,0.00002958776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001002274,0.000014586932,0.0000063327498,0.0000051345055,0.0000031733364,2.0546149e-7,0.000045768393,0.19579189,0.0000067306623,0.39184833,0.000018073028,0.41224977],"study_design_scores_gemma":[0.00011807256,0.00005555068,0.000016412543,0.00013887622,0.0000042516217,1.154317e-7,1.2849112e-7,0.32943124,0.00047852044,0.6686021,0.0009950472,0.0001596696],"about_ca_topic_score_codex":0.00001792074,"about_ca_topic_score_gemma":0.000001271923,"teacher_disagreement_score":0.6313692,"about_ca_system_score_codex":0.00006907276,"about_ca_system_score_gemma":0.00028530348,"threshold_uncertainty_score":0.77378964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028512214,0.000102264916,0.90558463,0.00037842442,0.0010555134,0.00029413003,0.000025396721,0.00004299613,0.09223153],"genre_scores_gemma":[0.85544205,0.0001267177,0.09585978,0.0037847664,0.00074872863,0.000036560727,0.000037538164,0.00007840324,0.043885473],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974744,0.000055672423,0.0003769093,0.0011065387,0.00045466615,0.000531823],"domain_scores_gemma":[0.99837965,0.00084027357,0.00012163632,0.0004996225,0.000034948433,0.0001238552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059918815,0.00042086258,0.0004693145,0.0002038,0.00032611878,0.00014182943,0.0010027185,0.00021561662,0.0004448582],"category_scores_gemma":[0.000108517386,0.00033579045,0.00008840295,0.00026423176,0.0020466673,0.00016477282,0.0018728538,0.0007153002,0.0005749055],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011358609,0.00026495877,0.001842015,0.00023358328,0.000103230836,0.0002860166,0.01404766,0.046025164,0.00060576154,0.0043225638,0.0063852887,0.92577016],"study_design_scores_gemma":[0.0018241584,0.0010201611,0.011890795,0.0026865434,0.00016180999,0.00007246921,0.000008058287,0.25587684,0.0080500655,0.57510686,0.13899387,0.0043083993],"about_ca_topic_score_codex":0.00013683729,"about_ca_topic_score_gemma":0.0003358192,"teacher_disagreement_score":0.92146176,"about_ca_system_score_codex":0.0004935795,"about_ca_system_score_gemma":0.00009124417,"threshold_uncertainty_score":0.9999094},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012979857,0.00026551337,0.9462305,0.0012051091,0.003659759,0.0008049727,0.0001123881,0.000113767375,0.034628175],"genre_scores_gemma":[0.989965,0.000030153135,0.008756571,0.00036474178,0.00020209322,0.000010676847,0.00000174813,0.000015085735,0.00065390806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976667,0.00003974498,0.0002823917,0.00065900583,0.0009038751,0.00044825766],"domain_scores_gemma":[0.9979979,0.00094703195,0.0001174574,0.0006921971,0.00016893848,0.00007647967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015736641,0.00024944442,0.00032620158,0.00030261028,0.0001739879,0.00015198384,0.0016817503,0.0001564837,0.0002555475],"category_scores_gemma":[0.00031526602,0.00015952939,0.00006841175,0.0003420957,0.0011937546,0.000101881385,0.0005982382,0.0004292215,0.000051065123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014202019,0.00011631692,0.0000139172425,0.00028804346,0.000018548311,0.000065389635,0.002262849,0.079910025,0.16117556,0.659144,0.00069051655,0.09617283],"study_design_scores_gemma":[0.00025052286,0.00056025106,0.000054644614,0.0018702262,0.0000115591765,0.000009667649,0.000001343293,0.07014224,0.37450328,0.55070716,0.0012085474,0.00068051904],"about_ca_topic_score_codex":0.00007848662,"about_ca_topic_score_gemma":0.000038228918,"teacher_disagreement_score":0.97698516,"about_ca_system_score_codex":0.000147635,"about_ca_system_score_gemma":0.00041715172,"threshold_uncertainty_score":0.65054196},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009534366,0.0021394158,0.9080889,0.002994341,0.0018867668,0.00025125616,0.0000016420458,0.00011674383,0.08451141],"genre_scores_gemma":[0.036459275,0.0010145503,0.93776625,0.007767402,0.001052875,0.0001048189,0.000027307577,0.000019496118,0.015788011],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960642,0.00008592947,0.0005726385,0.0018150759,0.00054502516,0.00091713946],"domain_scores_gemma":[0.9972168,0.0008685418,0.00022338428,0.0013654088,0.00021694695,0.000108902444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088247727,0.00048502427,0.0006560703,0.00090820884,0.00016785192,0.0002497889,0.0047441083,0.00048531115,0.000032282253],"category_scores_gemma":[0.00048141897,0.00046128625,0.00010313105,0.0020589859,0.00064695755,0.0006235112,0.0021043818,0.0011026618,0.00002887842],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007674159,0.00006807599,0.00056487485,0.00027660662,0.00000529588,0.0002890699,0.0005385814,0.105684794,0.00006751721,0.033905175,0.00079132395,0.857801],"study_design_scores_gemma":[0.00033177517,0.000079191464,0.0001978466,0.000769145,0.0000033425877,0.000044571898,2.8728158e-7,0.2131855,0.0009869073,0.70108455,0.08266271,0.0006541644],"about_ca_topic_score_codex":0.000012154565,"about_ca_topic_score_gemma":0.00012074999,"teacher_disagreement_score":0.85714686,"about_ca_system_score_codex":0.00037606375,"about_ca_system_score_gemma":0.0018541316,"threshold_uncertainty_score":0.9997839},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009534366,0.0021394158,0.9080889,0.002994341,0.0018867668,0.00025125616,0.0000016420458,0.00011674383,0.08451141],"genre_scores_gemma":[0.036459275,0.0010145503,0.93776625,0.007767402,0.001052875,0.0001048189,0.000027307577,0.000019496118,0.015788011],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960642,0.00008592947,0.0005726385,0.0018150759,0.00054502516,0.00091713946],"domain_scores_gemma":[0.9972168,0.0008685418,0.00022338428,0.0013654088,0.00021694695,0.000108902444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088247727,0.00048502427,0.0006560703,0.00090820884,0.00016785192,0.0002497889,0.0047441083,0.00048531115,0.000032282253],"category_scores_gemma":[0.00048141897,0.00046128625,0.00010313105,0.0020589859,0.00064695755,0.0006235112,0.0021043818,0.0011026618,0.00002887842],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007674159,0.00006807599,0.00056487485,0.00027660662,0.00000529588,0.0002890699,0.0005385814,0.105684794,0.00006751721,0.033905175,0.00079132395,0.857801],"study_design_scores_gemma":[0.00033177517,0.000079191464,0.0001978466,0.000769145,0.0000033425877,0.000044571898,2.8728158e-7,0.2131855,0.0009869073,0.70108455,0.08266271,0.0006541644],"about_ca_topic_score_codex":0.000012154565,"about_ca_topic_score_gemma":0.00012074999,"teacher_disagreement_score":0.85714686,"about_ca_system_score_codex":0.00037606375,"about_ca_system_score_gemma":0.0018541316,"threshold_uncertainty_score":0.9997839},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001271205,0.00033879702,0.9896277,0.00035458035,0.00036753688,0.0004546477,0.000005200796,0.0001868644,0.008537511],"genre_scores_gemma":[0.07500151,0.00001723469,0.92298645,0.00046589476,0.0002874657,0.000011370341,0.00006033339,0.000014570129,0.0011551977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958039,0.00008342603,0.00048150285,0.0021482105,0.00078336545,0.00069961615],"domain_scores_gemma":[0.9970007,0.0003946831,0.00039778985,0.0017967881,0.00028300515,0.00012702658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014974958,0.00054734224,0.0005397486,0.00044232936,0.00049850874,0.0006196029,0.003972118,0.00028281516,0.000016677528],"category_scores_gemma":[0.00021339975,0.00048490963,0.00006352576,0.0008448351,0.00047827396,0.0009830049,0.002953651,0.0010289077,0.0000068327804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006475196,0.00014013471,0.00059049146,0.0010206844,0.000120267716,0.00044047929,0.005744579,0.49216577,0.0153677985,0.005106277,0.00006634477,0.4791724],"study_design_scores_gemma":[0.00034887277,0.000086228385,0.00002588481,0.0005029295,0.00002637271,0.000104379316,0.0000028569577,0.98916286,0.005628745,0.0027180177,0.0008016613,0.00059118366],"about_ca_topic_score_codex":0.000036507674,"about_ca_topic_score_gemma":0.000041960284,"teacher_disagreement_score":0.4969971,"about_ca_system_score_codex":0.00025506827,"about_ca_system_score_gemma":0.00055755296,"threshold_uncertainty_score":0.99976027},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009534366,0.0021394158,0.9080889,0.002994341,0.0018867668,0.00025125616,0.0000016420458,0.00011674383,0.08451141],"genre_scores_gemma":[0.036459275,0.0010145503,0.93776625,0.007767402,0.001052875,0.0001048189,0.000027307577,0.000019496118,0.015788011],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960642,0.00008592947,0.0005726385,0.0018150759,0.00054502516,0.00091713946],"domain_scores_gemma":[0.9972168,0.0008685418,0.00022338428,0.0013654088,0.00021694695,0.000108902444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088247727,0.00048502427,0.0006560703,0.00090820884,0.00016785192,0.0002497889,0.0047441083,0.00048531115,0.000032282253],"category_scores_gemma":[0.00048141897,0.00046128625,0.00010313105,0.0020589859,0.00064695755,0.0006235112,0.0021043818,0.0011026618,0.00002887842],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007674159,0.00006807599,0.00056487485,0.00027660662,0.00000529588,0.0002890699,0.0005385814,0.105684794,0.00006751721,0.033905175,0.00079132395,0.857801],"study_design_scores_gemma":[0.00033177517,0.000079191464,0.0001978466,0.000769145,0.0000033425877,0.000044571898,2.8728158e-7,0.2131855,0.0009869073,0.70108455,0.08266271,0.0006541644],"about_ca_topic_score_codex":0.000012154565,"about_ca_topic_score_gemma":0.00012074999,"teacher_disagreement_score":0.85714686,"about_ca_system_score_codex":0.00037606375,"about_ca_system_score_gemma":0.0018541316,"threshold_uncertainty_score":0.9997839},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025140273,0.00030425884,0.9930387,0.002336706,0.002044495,0.0004933608,0.00000329878,0.00011968374,0.0016343667],"genre_scores_gemma":[0.04845412,0.00007766651,0.9501792,0.00056520535,0.00034085524,0.000034595236,0.000020243484,0.00001102857,0.00031704784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967317,0.00005570303,0.00071315555,0.0014289379,0.0004084629,0.0006620535],"domain_scores_gemma":[0.9970286,0.0013129058,0.0003746944,0.00090128393,0.00028046133,0.0001020386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018091297,0.00042656827,0.00059616164,0.0009852758,0.0002474871,0.000328793,0.0011123928,0.0006144659,0.000021309743],"category_scores_gemma":[0.0007362738,0.00044658425,0.00014775529,0.0009610544,0.00021916186,0.0004593165,0.00055980374,0.00071762595,0.0000022496836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011306241,0.000024347717,0.00015643727,0.00026153287,0.000009185939,0.000043596592,0.00033901035,0.30907822,0.00009211207,0.012278177,0.000020913754,0.67768514],"study_design_scores_gemma":[0.00014415261,0.00004210412,0.000019691504,0.0020041834,0.0000059786676,0.00006179901,5.628151e-7,0.6565638,0.0020970884,0.3382331,0.00040064516,0.00042684196],"about_ca_topic_score_codex":0.000016103466,"about_ca_topic_score_gemma":0.00009989488,"teacher_disagreement_score":0.6772583,"about_ca_system_score_codex":0.0002955896,"about_ca_system_score_gemma":0.0006329309,"threshold_uncertainty_score":0.9997986},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000111332,0.000055219745,0.9787132,0.012854321,0.00114784,0.00041507086,0.000006985864,0.00012436297,0.006681858],"genre_scores_gemma":[0.010222587,0.000005626174,0.986578,0.0017748417,0.00032171127,0.000030608127,0.000017718852,0.0000049360224,0.0010439719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997261,0.000024138897,0.00040771323,0.0012197524,0.0006023314,0.00048507805],"domain_scores_gemma":[0.99570185,0.0025897021,0.00026738868,0.0008867605,0.00045277632,0.00010152807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009796114,0.0003443401,0.0003545571,0.00032468745,0.0003002038,0.00047248302,0.0015690391,0.00046348321,0.00003195513],"category_scores_gemma":[0.0019992096,0.00032591942,0.00011911988,0.00049493805,0.00026023653,0.00043467598,0.0007531726,0.0006906617,0.0000134224465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075759262,0.00002167704,0.000005827409,0.00007016992,0.000010714611,0.000010959265,0.00015796983,0.21851176,0.000011623322,0.6396157,0.00016374618,0.14141226],"study_design_scores_gemma":[0.00008236048,0.0000396272,0.000009011379,0.00020726852,0.0000048145116,0.000013951055,7.921461e-8,0.50563246,0.00012783143,0.4907449,0.0029571685,0.00018054932],"about_ca_topic_score_codex":0.000008510239,"about_ca_topic_score_gemma":0.000009881316,"teacher_disagreement_score":0.28712067,"about_ca_system_score_codex":0.00022353868,"about_ca_system_score_gemma":0.0012220744,"threshold_uncertainty_score":0.9999193},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053141924,0.00087015337,0.9888659,0.00071571046,0.00068809785,0.001030482,0.0000032894184,0.00008996422,0.007204954],"genre_scores_gemma":[0.9025897,0.00019551955,0.09549054,0.00046619106,0.000117468255,0.00022887973,0.00001753851,0.000014146829,0.0008800538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962184,0.0000504896,0.0007519712,0.0014868124,0.0007925391,0.0006998225],"domain_scores_gemma":[0.9968976,0.001131971,0.00039504984,0.00095542497,0.00050372205,0.00011623651],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009346513,0.00050946145,0.0007838128,0.0011390924,0.00022974914,0.00019878079,0.0023246473,0.00032947637,0.000024845296],"category_scores_gemma":[0.0005264007,0.00048853224,0.00042064386,0.0011348214,0.00046197392,0.00016871584,0.0011514766,0.00064414024,0.0000036204701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030239858,0.000037538517,0.0017380911,0.0005766157,0.000036768204,0.000020254076,0.0030771864,0.76848376,0.00005261981,0.005983213,0.00002467264,0.21993905],"study_design_scores_gemma":[0.0012489775,0.0006803277,0.0003929173,0.0038292392,0.000051164974,0.000007249823,0.000013573892,0.94402295,0.008043469,0.03660029,0.004006358,0.0011035046],"about_ca_topic_score_codex":0.00003120774,"about_ca_topic_score_gemma":0.0000061977507,"teacher_disagreement_score":0.90205824,"about_ca_system_score_codex":0.0002651279,"about_ca_system_score_gemma":0.00045327426,"threshold_uncertainty_score":0.99975663},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005189319,0.00071238424,0.98575246,0.00017513822,0.0005318676,0.0002723455,0.000014691382,0.000039660117,0.011982507],"genre_scores_gemma":[0.77617043,0.000051166837,0.21682622,0.002798937,0.00046702274,0.0000071269606,0.00012814517,0.000024526946,0.0035263922],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862546,0.000032076612,0.00028277122,0.0004041876,0.00044564225,0.0002098873],"domain_scores_gemma":[0.99809664,0.0012611989,0.00013328153,0.00030349664,0.00013565399,0.000069735026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048885075,0.00017479806,0.00038065377,0.00041217104,0.000048587455,0.000029415854,0.00029486866,0.00016564615,0.000014307394],"category_scores_gemma":[0.00043818794,0.00014857968,0.00007250323,0.00042465876,0.0005067288,0.000050439747,0.0002611902,0.00034567397,0.0000057839384],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006956659,0.0000833661,0.0010144081,0.0003805625,0.000026583379,0.000054160206,0.00032047997,0.01608927,0.0001331605,0.001649318,0.0006407143,0.9795384],"study_design_scores_gemma":[0.004068985,0.0023305565,0.017814869,0.020774001,0.00037650918,0.00021303748,0.0000027145677,0.287485,0.027592279,0.6352578,0.002672846,0.0014114369],"about_ca_topic_score_codex":0.000013441173,"about_ca_topic_score_gemma":0.0000056466306,"teacher_disagreement_score":0.978127,"about_ca_system_score_codex":0.00020228217,"about_ca_system_score_gemma":0.001002551,"threshold_uncertainty_score":0.60589033},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007441084,0.0004565337,0.9960457,0.0004146646,0.0017352996,0.00018713837,0.0000051368143,0.00016469527,0.00091642514],"genre_scores_gemma":[0.12934035,0.00030513937,0.86835074,0.00078417023,0.000895196,0.000056615412,0.0000033569654,0.000041206356,0.00022320192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988531,0.000014296882,0.0002640236,0.00041429562,0.00022242648,0.00023184202],"domain_scores_gemma":[0.999249,0.00040339463,0.000029870238,0.00018488719,0.000053561896,0.00007930753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004528135,0.00021751884,0.0003232258,0.00022143788,0.0001229435,0.00007011332,0.0002537514,0.00031371656,0.000024728699],"category_scores_gemma":[0.00016830687,0.00018670599,0.00005481602,0.00012770091,0.00036899958,0.00004692114,0.00021040482,0.0003196164,0.0000011703071],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034470108,0.0000021916078,0.000005579186,0.000103042614,0.000012172391,0.0000021975306,0.0000375756,0.002587732,0.00036864,0.00040444286,0.000016198943,0.9964568],"study_design_scores_gemma":[0.00035495262,0.00013630839,0.00012461627,0.00045697516,0.00003901435,0.00008783756,4.1787223e-7,0.7715639,0.012371357,0.20202988,0.012232846,0.000601905],"about_ca_topic_score_codex":0.0000029822324,"about_ca_topic_score_gemma":0.000052500014,"teacher_disagreement_score":0.99585485,"about_ca_system_score_codex":0.00006175442,"about_ca_system_score_gemma":0.00006516035,"threshold_uncertainty_score":0.76136494},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028005399,0.0008150168,0.9580932,0.000849211,0.00020754506,0.0011859048,0.000008350499,0.000082383856,0.010752949],"genre_scores_gemma":[0.9963568,0.00025400912,0.0028147264,0.00024197696,0.00014832536,0.00004350622,0.000006937866,0.000016027743,0.00011771885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988239,0.000017287628,0.00019503738,0.0003371355,0.00035227838,0.00027440372],"domain_scores_gemma":[0.9991685,0.00026736667,0.000047962836,0.0004245099,0.000056736786,0.000034893525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005163371,0.00022317683,0.00022621638,0.00009804421,0.00027037345,0.00038026334,0.0006994238,0.00008151859,0.000014657295],"category_scores_gemma":[0.000006108056,0.00012084046,0.0000262598,0.00016833433,0.00069134706,0.00015731042,0.00021814056,0.00038855508,0.0000039349525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034459616,0.0000021172502,0.000119614175,0.00014709904,0.000028603174,0.0000022809984,0.00044626987,0.037428472,0.0012925469,0.0021453495,0.000038648785,0.95831454],"study_design_scores_gemma":[0.00044490973,0.000056715224,0.00023484993,0.00027812822,0.000020173802,0.000015406846,0.0000019385195,0.99300796,0.0030713854,0.0010686533,0.0015494092,0.00025047836],"about_ca_topic_score_codex":0.000026017067,"about_ca_topic_score_gemma":0.0001282874,"teacher_disagreement_score":0.96835136,"about_ca_system_score_codex":0.00004941389,"about_ca_system_score_gemma":0.00009349777,"threshold_uncertainty_score":0.4927731},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072357256,0.00015644133,0.98179483,0.0011483828,0.0011177736,0.00050401036,0.000001294169,0.00012957113,0.014424145],"genre_scores_gemma":[0.92611164,0.0000035524572,0.071134485,0.0007785894,0.00029825373,0.000022288077,0.000007552305,0.000005998252,0.0016376538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661505,0.00006500024,0.0005238511,0.001633561,0.0006749136,0.00048763654],"domain_scores_gemma":[0.9979645,0.00021579384,0.00017733459,0.0013625778,0.00015375306,0.00012605338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083669095,0.0004153333,0.00044785065,0.00037030238,0.00018755028,0.0002847507,0.0028078123,0.0002495266,0.00003222252],"category_scores_gemma":[0.000120280085,0.00039196026,0.000070439004,0.00068007386,0.00031480967,0.00041398348,0.0008743714,0.00075852574,0.000008933838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047623264,0.0014532834,0.0014115821,0.000090320726,0.000023097582,0.0011248364,0.007494781,0.73685277,0.0004504689,0.025347114,0.00013930714,0.2255648],"study_design_scores_gemma":[0.0005208398,0.00071174593,0.00020346593,0.00022153044,0.0000035721162,0.00004521381,0.0000051139978,0.9601278,0.0014998806,0.033971526,0.0019998718,0.0006894557],"about_ca_topic_score_codex":0.00010267541,"about_ca_topic_score_gemma":0.00010883017,"teacher_disagreement_score":0.92538804,"about_ca_system_score_codex":0.00025951405,"about_ca_system_score_gemma":0.0005493674,"threshold_uncertainty_score":0.99985325},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007250211,0.00007620179,0.98551416,0.0008176714,0.000793547,0.00028211513,0.00002187275,0.000104928506,0.011664473],"genre_scores_gemma":[0.841219,0.00002453892,0.13183363,0.01340363,0.0010866572,0.0000355096,0.00029989408,0.00006373834,0.012033388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845886,0.000019186682,0.0003551108,0.0005320126,0.00028915863,0.00034566477],"domain_scores_gemma":[0.9990102,0.00026542504,0.00018833956,0.00029241724,0.00017428458,0.00006935222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024450186,0.00032987277,0.0004543475,0.0004478682,0.00046642794,0.0003366671,0.0004874992,0.00016228695,0.00025745516],"category_scores_gemma":[0.00004972777,0.00024029108,0.00008831465,0.00016485034,0.001109755,0.0003272161,0.00016943038,0.0005737784,0.0000070693545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012851002,0.000014954624,0.00001078139,0.00006915274,0.000034791927,0.000027917935,0.0067407754,0.16081575,0.0000010168427,0.077871576,0.000014587832,0.7543858],"study_design_scores_gemma":[0.00019164819,0.0000782192,0.000012683225,0.00036712954,0.000053792723,0.000008053316,0.0000053010613,0.98893756,0.000003231196,0.008208679,0.0018306845,0.00030300196],"about_ca_topic_score_codex":0.00023297512,"about_ca_topic_score_gemma":0.0148269925,"teacher_disagreement_score":0.85368055,"about_ca_system_score_codex":0.00014942171,"about_ca_system_score_gemma":0.00032760424,"threshold_uncertainty_score":0.97987854},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024515618,0.00014486478,0.962069,0.000077913115,0.001391338,0.0006435535,0.00000764414,0.00010575521,0.011044347],"genre_scores_gemma":[0.9797887,0.000002821493,0.017417884,0.00006446855,0.0003669196,0.000010803646,0.000025770238,0.000037876256,0.002284709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700946,0.00010362905,0.00048080576,0.0012609998,0.00072820834,0.00041691228],"domain_scores_gemma":[0.99818224,0.0007254467,0.00027466292,0.0006643329,0.000041880932,0.00011143536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005965709,0.0003991444,0.0004080251,0.00030235868,0.00036939565,0.00022332516,0.00089256477,0.00024221856,0.00056735624],"category_scores_gemma":[0.00029437337,0.0003937211,0.00009462114,0.00046292253,0.0005035951,0.00027112852,0.0010576516,0.00071135093,0.000248127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044167173,0.000039386232,0.01315099,0.000018964622,0.000018571349,0.0000149093175,0.0016689633,0.8374296,0.00061115006,0.00006697844,0.00006514335,0.14691092],"study_design_scores_gemma":[0.00020976475,0.000044909917,0.007660931,0.00043773392,0.000032966378,0.000007811619,0.000001076694,0.98669714,0.00008473133,0.004161431,0.00023590738,0.00042557827],"about_ca_topic_score_codex":0.0012573005,"about_ca_topic_score_gemma":0.0009078845,"teacher_disagreement_score":0.95527315,"about_ca_system_score_codex":0.0011719592,"about_ca_system_score_gemma":0.00012366586,"threshold_uncertainty_score":0.99985147},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005748549,0.0001046728,0.9918405,0.002721853,0.00122714,0.00082292536,0.000057224635,0.000045728913,0.0026051218],"genre_scores_gemma":[0.7787732,0.0003461697,0.18562052,0.018499937,0.0016457442,0.00005684981,0.0005788624,0.00006177216,0.014416987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861604,0.000007726253,0.00026776554,0.0005612577,0.00024868947,0.0002985256],"domain_scores_gemma":[0.99913865,0.00014923408,0.00012795436,0.00025512767,0.0002375724,0.00009147628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029895114,0.00021451952,0.00029927184,0.00028329843,0.00019050075,0.000056781115,0.0002432957,0.00018548095,0.00007489006],"category_scores_gemma":[0.00006317749,0.00018295269,0.00006275628,0.00010600557,0.000114439725,0.00011699655,0.00011972596,0.000276519,0.000021212763],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004072832,0.0001701834,0.0015520441,0.0010426599,0.000052391777,0.000024167191,0.0009412812,0.0013342295,0.00026790978,0.003713411,0.0027926413,0.9877018],"study_design_scores_gemma":[0.01138041,0.0029916563,0.015569763,0.0077947574,0.00036320894,0.00022905452,0.000009038087,0.52801496,0.009645726,0.04792531,0.37371898,0.0023571386],"about_ca_topic_score_codex":0.00004476086,"about_ca_topic_score_gemma":0.000037149915,"teacher_disagreement_score":0.98534465,"about_ca_system_score_codex":0.00040356335,"about_ca_system_score_gemma":0.00030474228,"threshold_uncertainty_score":0.74605936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16983053,0.019552974,0.8030853,0.0012818283,0.0020627433,0.00079771737,0.00008589439,0.000015340087,0.0032876448],"genre_scores_gemma":[0.9896169,0.0013541266,0.007052931,0.00045902937,0.0003040712,0.00002081679,0.000023750783,0.00001635213,0.0011520579],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987606,0.0000100145235,0.00020478343,0.0006988456,0.00013244875,0.00019330443],"domain_scores_gemma":[0.99929166,0.00005005277,0.00009041677,0.00042666536,0.000095495634,0.00004572154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001890118,0.00021124668,0.00018356164,0.00014129495,0.00012231882,0.00008698246,0.00034438862,0.00017795934,0.0000034669797],"category_scores_gemma":[0.00005661553,0.00020357649,0.000046312736,0.000073862924,0.00032883804,0.000001351343,0.00048536656,0.00011785912,0.0000019157833],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031718086,0.000051978655,0.024714507,0.00013882469,0.0001633264,0.000021684706,0.000376271,0.00291071,0.063254826,0.0018476909,0.0005906396,0.90589786],"study_design_scores_gemma":[0.0025724752,0.0018229765,0.18763375,0.001167969,0.00042631367,0.00015765091,0.0000025657164,0.015719235,0.4517528,0.12649353,0.20702389,0.005226836],"about_ca_topic_score_codex":0.000020257658,"about_ca_topic_score_gemma":0.00026414328,"teacher_disagreement_score":0.900671,"about_ca_system_score_codex":0.000024242252,"about_ca_system_score_gemma":0.00012211726,"threshold_uncertainty_score":0.8301608},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054788085,0.00058721495,0.99231607,0.0011066238,0.0018384795,0.00037023833,0.00003392099,0.00027081798,0.0034218207],"genre_scores_gemma":[0.57080466,0.000034556913,0.41919863,0.009093162,0.0007230763,0.000012999484,0.000035914887,0.000054794604,0.00004223054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950956,0.00007642929,0.00047520982,0.0020945652,0.00148513,0.0007730814],"domain_scores_gemma":[0.9963077,0.00064724486,0.00024962993,0.0023500205,0.00018437322,0.0002610642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010133995,0.00072894513,0.0006238149,0.0011970755,0.0003461142,0.0007784758,0.0049720244,0.00056037935,0.00004377682],"category_scores_gemma":[0.00006953198,0.0006370325,0.0002970909,0.0008007924,0.00072204653,0.00050975336,0.00048163353,0.0014237665,0.000036933965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029925233,0.000103494735,0.000028891038,0.00014766176,0.000021789136,0.00015405241,0.0008314064,0.16546115,0.00031821078,0.4396705,0.00020193336,0.39303097],"study_design_scores_gemma":[0.00035755488,0.00034041394,0.00008857571,0.0004108343,0.000012146202,0.000009306746,6.57127e-8,0.7744615,0.0009449724,0.2089286,0.013642913,0.00080309634],"about_ca_topic_score_codex":0.000016712807,"about_ca_topic_score_gemma":0.00008158097,"teacher_disagreement_score":0.6090004,"about_ca_system_score_codex":0.00010396428,"about_ca_system_score_gemma":0.00031356697,"threshold_uncertainty_score":0.9996081},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012085644,0.00022714827,0.99170345,0.0030488677,0.00030873046,0.00035172622,0.000010232671,0.00018327395,0.0040456885],"genre_scores_gemma":[0.34747446,0.000031681015,0.6504289,0.0011450475,0.00017264557,0.00001691521,0.000012518008,0.000025639123,0.00069219153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99568015,0.00004581265,0.00063211145,0.0012382938,0.002014012,0.00038963143],"domain_scores_gemma":[0.9958353,0.0018319946,0.0003461825,0.0015421498,0.00027057034,0.00017382564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012932983,0.000373688,0.0004946902,0.00088747643,0.00015964531,0.00020350958,0.0047476236,0.0004099784,0.000057606572],"category_scores_gemma":[0.00056778704,0.0003483922,0.0001191271,0.0007885194,0.00052487786,0.00043229174,0.0017399897,0.00092830544,0.00004893115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020574444,0.000044810375,0.000010715652,0.000042863987,0.0000048098386,0.00001633533,0.0010644248,0.18390238,0.00015835522,0.042211127,0.000020835974,0.77252126],"study_design_scores_gemma":[0.00018698309,0.00008723155,0.000087539884,0.00045667557,0.000005917627,0.000015355721,2.1133938e-7,0.94669527,0.0003067977,0.051775858,0.00009870312,0.00028347835],"about_ca_topic_score_codex":0.00032867107,"about_ca_topic_score_gemma":0.000041642346,"teacher_disagreement_score":0.7722378,"about_ca_system_score_codex":0.0001511467,"about_ca_system_score_gemma":0.0010858669,"threshold_uncertainty_score":0.9998968},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020273601,0.002130773,0.68576616,0.0015817471,0.012239305,0.00060893816,0.00026433964,0.000057006775,0.29733145],"genre_scores_gemma":[0.007040751,0.0034309125,0.23242188,0.02445173,0.0072952104,0.00017558136,0.00021468327,0.0001762072,0.724793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968073,0.000004706408,0.0008796357,0.0013358467,0.00019023858,0.0007823115],"domain_scores_gemma":[0.9980418,0.0005645347,0.00044354427,0.0006838653,0.00007683097,0.00018942561],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015209905,0.00040627673,0.0008587944,0.00060129206,0.0004072175,0.00027474688,0.001331622,0.00038113687,0.0017306237],"category_scores_gemma":[0.00024589204,0.00043116478,0.00026998177,0.00032344257,0.0007897681,0.0002749612,0.0008524314,0.00038908128,0.00071394845],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007371582,0.000058873135,0.0009883377,0.00026266064,0.00022603279,0.00004674768,0.0012405331,0.011052374,3.0558218e-7,0.5948008,0.28472808,0.106521554],"study_design_scores_gemma":[0.0006869753,0.000061233906,0.000037586913,0.00031045516,0.000009296794,0.0000026794971,0.0000019732745,0.040385358,0.000005319777,0.23049833,0.7274686,0.0005322059],"about_ca_topic_score_codex":0.000021265256,"about_ca_topic_score_gemma":0.00012252037,"teacher_disagreement_score":0.45334432,"about_ca_system_score_codex":0.0005324871,"about_ca_system_score_gemma":0.00039054247,"threshold_uncertainty_score":0.99981403},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030433211,0.00020406062,0.9670606,0.00012028769,0.0008428039,0.00072102697,0.000039777424,0.00018333373,0.00039485272],"genre_scores_gemma":[0.24511462,0.0000296952,0.75355774,0.00031354238,0.0005477399,0.0000125715815,0.00016612449,0.000039313745,0.0002186323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968807,0.00011220712,0.0005188788,0.0012108707,0.0008354168,0.0004419404],"domain_scores_gemma":[0.99728954,0.0011876009,0.00033916664,0.0006452977,0.0004410572,0.00009733116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009893203,0.0004963846,0.0005994596,0.0008091129,0.00034571948,0.0002654022,0.0014108513,0.0003887399,0.000008631672],"category_scores_gemma":[0.00020148145,0.00044500717,0.00015282519,0.0007512801,0.00018788924,0.00077608763,0.00040113012,0.00064801256,0.000006311454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001062317,0.000068379864,0.0005543158,0.0003223111,0.0000456754,0.00002031824,0.0006377184,0.12534845,0.0012467805,0.00087399466,0.000064913926,0.8707109],"study_design_scores_gemma":[0.0005967787,0.000439421,0.00014780248,0.0010191894,0.000032709584,0.000011968673,1.1975949e-7,0.9266728,0.0373229,0.033252317,0.000051949733,0.00045204326],"about_ca_topic_score_codex":0.0029852577,"about_ca_topic_score_gemma":0.0004570358,"teacher_disagreement_score":0.87025887,"about_ca_system_score_codex":0.00036897956,"about_ca_system_score_gemma":0.00079737,"threshold_uncertainty_score":0.99980015},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001375854,0.00019791332,0.9609594,0.0006909823,0.0014015604,0.0007131381,0.000001475957,0.00007996205,0.035818037],"genre_scores_gemma":[0.7295061,0.000049218084,0.26509762,0.0028644777,0.0015012583,0.000083531675,0.000024297431,0.000027455402,0.0008460617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967324,0.00009973819,0.0004956892,0.0013452087,0.00076208805,0.00056483375],"domain_scores_gemma":[0.9974961,0.00057057216,0.00025881288,0.0013664487,0.00020704861,0.00010099772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017643692,0.00043495055,0.00039356513,0.00090698735,0.000346724,0.0009244309,0.0039085764,0.000296539,0.0000110408355],"category_scores_gemma":[0.0001415839,0.00033277966,0.00010756688,0.001151432,0.0003430009,0.0009921831,0.00072855566,0.0008206289,0.00003017429],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038089945,0.000037311598,0.00019067533,0.000031493215,0.0000045175234,0.000055095996,0.0031876347,0.0061181653,0.000046929625,0.056509573,0.00005457505,0.9337602],"study_design_scores_gemma":[0.00034947373,0.0001711645,0.0016094998,0.00043977262,0.000008893301,0.000033060696,0.00000209021,0.90074414,0.00042638934,0.09066158,0.0049000047,0.0006539423],"about_ca_topic_score_codex":0.00008341397,"about_ca_topic_score_gemma":0.000765301,"teacher_disagreement_score":0.9331063,"about_ca_system_score_codex":0.00036260704,"about_ca_system_score_gemma":0.00067817955,"threshold_uncertainty_score":0.99991244},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08989258,0.003909042,0.8927214,0.00067748915,0.0036757083,0.0008974227,0.000017366687,0.000397614,0.007811373],"genre_scores_gemma":[0.99445903,0.0000290098,0.004967137,0.00028279013,0.00020847855,0.0000013400715,5.8120906e-7,0.000017860151,0.000033797798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991205,0.000017930779,0.00014806287,0.00023352823,0.00029174783,0.00018825759],"domain_scores_gemma":[0.9991759,0.00018895116,0.00006633408,0.00049401814,0.000047626505,0.000027174707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017129726,0.00021302409,0.00018290363,0.00006813472,0.000112620706,0.00005501629,0.00044274365,0.00014337926,0.000019514684],"category_scores_gemma":[0.000021826876,0.00012061114,0.00005486989,0.00010150744,0.00043983612,0.000068052155,0.00020189531,0.00045839325,0.0000011676345],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022065575,0.000009771732,0.00063516357,0.00007916054,0.00005524563,0.0000051997113,0.0010321089,0.08125376,0.0044794357,0.011748157,0.00045322158,0.9002267],"study_design_scores_gemma":[0.000181916,0.00018118828,0.010609506,0.0012647164,0.00007132005,0.00005434241,0.0000014201986,0.48931912,0.068415634,0.4265616,0.0025602707,0.0007789778],"about_ca_topic_score_codex":0.000011833542,"about_ca_topic_score_gemma":0.00002935475,"teacher_disagreement_score":0.9045664,"about_ca_system_score_codex":0.000046105873,"about_ca_system_score_gemma":0.000023392004,"threshold_uncertainty_score":0.49183795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000089278095,0.0003113241,0.9952734,0.00065937795,0.0003485409,0.00040451824,0.000007188271,0.00028954344,0.0026168264],"genre_scores_gemma":[0.11312153,0.00017026642,0.8781288,0.0069106263,0.0005367288,0.000039488434,0.00001051277,0.00006088176,0.0010211539],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971711,0.00004976836,0.00031142283,0.0013723744,0.00061194686,0.00048336328],"domain_scores_gemma":[0.9983075,0.00029539535,0.00021558964,0.000717599,0.00035705458,0.00010683874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005798725,0.0004757297,0.00041611493,0.0010689964,0.00037014778,0.0008827147,0.0011412925,0.00029614381,0.0000071709355],"category_scores_gemma":[0.000072515104,0.00040011955,0.000060914517,0.00069843326,0.000421225,0.0007667023,0.00069930044,0.0009121294,0.000006422438],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008380743,0.000010527682,0.00001529441,0.000037409467,0.000013176089,0.00010207715,0.0003206227,0.00006148983,0.000114672,0.000311451,0.000083863626,0.99892104],"study_design_scores_gemma":[0.0018417679,0.0024180703,0.0025746396,0.0060601085,0.00012361321,0.0026149675,0.0000017765332,0.14738312,0.3636405,0.46454495,0.004078361,0.004718139],"about_ca_topic_score_codex":0.00015248252,"about_ca_topic_score_gemma":0.00030165358,"teacher_disagreement_score":0.9942029,"about_ca_system_score_codex":0.00024285087,"about_ca_system_score_gemma":0.000474995,"threshold_uncertainty_score":0.9998451},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012225335,0.00030290996,0.992293,0.00064436195,0.0007753943,0.0015337297,0.000007862445,0.00034924663,0.0028709383],"genre_scores_gemma":[0.80982524,0.00001969799,0.18932803,0.00022471532,0.00011816514,0.00009598108,0.0000020087516,0.000018461385,0.0003677211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963119,0.00005302933,0.00073378976,0.0016400707,0.0007800239,0.00048119045],"domain_scores_gemma":[0.9963318,0.00022810843,0.00040223863,0.0026318533,0.00030497432,0.00010101919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008479981,0.0004915415,0.0007343518,0.0013623417,0.00028629645,0.00015583028,0.0043264115,0.00040781213,0.0000046230775],"category_scores_gemma":[0.000015500336,0.0004576963,0.00012623685,0.0013286297,0.0004855637,0.00018414311,0.003111517,0.0007687671,0.000006555503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001027893,0.00032473676,0.00005453258,0.0006555129,0.00013027711,0.0053819213,0.005228002,0.001846359,0.000005694513,0.24908836,0.00012451156,0.73714983],"study_design_scores_gemma":[0.0031466905,0.0012952369,0.00007411166,0.0018118857,0.00023559191,0.004358652,0.00013593861,0.82691425,0.00040887337,0.1555167,0.0040045152,0.002097539],"about_ca_topic_score_codex":0.00050464633,"about_ca_topic_score_gemma":0.0005365447,"teacher_disagreement_score":0.82506794,"about_ca_system_score_codex":0.00025808645,"about_ca_system_score_gemma":0.00022454139,"threshold_uncertainty_score":0.99978745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036219,0.00012327464,0.9618834,0.00040237585,0.00024547,0.0007171575,0.00001029442,0.00010436785,0.00029462596],"genre_scores_gemma":[0.80778444,0.0000021289757,0.19194491,0.00016419846,0.000020580137,0.00002599709,9.889214e-7,0.000007493228,0.00004928939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754584,0.000036047644,0.0006662067,0.0009565406,0.00051281025,0.00028256344],"domain_scores_gemma":[0.99644077,0.0005294718,0.00042062454,0.002074257,0.0004778158,0.0000570692],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061961834,0.00029659143,0.00053753355,0.0011175977,0.00018660101,0.000063559855,0.002836325,0.0003060855,0.000004072826],"category_scores_gemma":[0.00007813732,0.00028530494,0.000097597476,0.0015140834,0.00061551016,0.00016419785,0.0009961367,0.0005609132,0.0000011244962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000141199025,0.001458515,0.0031914636,0.00023277616,0.0000940338,0.0008220405,0.0064514037,0.038373735,0.00034199184,0.22114713,0.000038472426,0.7278343],"study_design_scores_gemma":[0.00089242274,0.0008965225,0.0010840328,0.00034210455,0.000040110695,0.00013045913,0.000005503124,0.87713546,0.002096485,0.11663107,0.00017727712,0.00056856056],"about_ca_topic_score_codex":0.00038012033,"about_ca_topic_score_gemma":0.00048712848,"teacher_disagreement_score":0.8387617,"about_ca_system_score_codex":0.000078887635,"about_ca_system_score_gemma":0.000589494,"threshold_uncertainty_score":0.9999599},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008862313,0.0018826105,0.99500704,0.0007436782,0.00053745235,0.00031775795,0.0000012718757,0.000112155685,0.0013891998],"genre_scores_gemma":[0.065460175,0.00031309424,0.93242824,0.0009029586,0.00075871445,0.000022955637,0.000007569538,0.00003426948,0.00007199664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977104,0.000018513758,0.00029268683,0.00096054515,0.0004546347,0.0005632065],"domain_scores_gemma":[0.9982204,0.00021743192,0.00022148856,0.0010323067,0.000100516154,0.00020787025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003635343,0.00036966987,0.0003239901,0.00024164225,0.00030393028,0.00045931572,0.0017576109,0.00018479492,0.000010070715],"category_scores_gemma":[0.000012418338,0.00029379874,0.00004182478,0.00047906899,0.00043586598,0.000589328,0.000839366,0.0005835178,0.000002431513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017028284,0.000006239874,0.000009047887,0.000004811924,0.0000027424385,0.000004361664,0.00020407,0.40362856,7.7204203e-7,0.009189485,0.0000059229014,0.58694226],"study_design_scores_gemma":[0.00016031912,0.000094818235,0.000053879892,0.000206516,0.00000826779,0.00007700894,1.2229417e-7,0.983337,0.000008651347,0.014846135,0.00081688684,0.00039038438],"about_ca_topic_score_codex":0.0000033962688,"about_ca_topic_score_gemma":0.000051727377,"teacher_disagreement_score":0.5865519,"about_ca_system_score_codex":0.000078900215,"about_ca_system_score_gemma":0.000116170304,"threshold_uncertainty_score":0.9999514},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008962031,0.0006960245,0.93228495,0.0029693104,0.011269713,0.0010464244,0.00006171134,0.00019740204,0.04251241],"genre_scores_gemma":[0.9841506,0.0002514227,0.010423983,0.0011923431,0.001615659,0.00006555232,0.000044112356,0.000048265774,0.002208077],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9977517,0.000054510198,0.00055718445,0.0008980762,0.00035969017,0.00037880297],"domain_scores_gemma":[0.9987562,0.00026139122,0.0003018195,0.0004291368,0.0001653247,0.00008618131],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020479516,0.0003790899,0.000526368,0.00081893295,0.00045829732,0.00012932559,0.0006738376,0.00025220064,0.00076797104],"category_scores_gemma":[0.000075205586,0.0003958509,0.00019209603,0.0002703368,0.0006150713,0.00029031068,0.0004663418,0.0009822168,0.000050953855],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104636856,0.00031105668,0.0050221165,0.00011063627,0.00027827406,0.000020845826,0.04255238,0.0022322952,0.0001771648,0.02773148,0.0010070694,0.92045206],"study_design_scores_gemma":[0.0050274385,0.0010492576,0.90070677,0.006359443,0.00054691616,0.00067361974,0.00030740807,0.0035471544,0.0007685029,0.062093306,0.0139575135,0.0049626664],"about_ca_topic_score_codex":0.00017409325,"about_ca_topic_score_gemma":0.00012787868,"teacher_disagreement_score":0.97518855,"about_ca_system_score_codex":0.00023160812,"about_ca_system_score_gemma":0.00013466942,"threshold_uncertainty_score":0.9998493},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033397478,0.000074698066,0.97655886,0.00021257799,0.0033111537,0.0019729955,0.000013338695,0.00013381834,0.017388575],"genre_scores_gemma":[0.9268166,0.000015277996,0.06135785,0.0031670395,0.0010688166,0.00041836314,0.000045291625,0.00012533771,0.0069854218],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971333,0.000118009186,0.00039242354,0.0013976009,0.00041932554,0.0005393493],"domain_scores_gemma":[0.99668974,0.0019494296,0.00043564808,0.00044357424,0.00039414896,0.000087467226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031793187,0.00055429596,0.0005437784,0.0010541927,0.0003904042,0.00021856873,0.0006010886,0.00043407248,0.00016226123],"category_scores_gemma":[0.00013497635,0.0004605804,0.00012512239,0.0003427013,0.000287006,0.0003372864,0.00011292606,0.0011184943,0.00005249605],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006769034,0.0005674993,0.000028840812,0.000135527,0.0004458263,0.00017095545,0.084282406,0.012328884,0.00037542538,0.0086534135,0.0015652479,0.88467693],"study_design_scores_gemma":[0.043862123,0.042085163,0.005797981,0.076704726,0.0011279181,0.0005917865,0.0026893308,0.29108277,0.35863617,0.113907,0.046230167,0.017284863],"about_ca_topic_score_codex":0.000060855535,"about_ca_topic_score_gemma":0.00021365719,"teacher_disagreement_score":0.9264826,"about_ca_system_score_codex":0.00056890026,"about_ca_system_score_gemma":0.00033901242,"threshold_uncertainty_score":0.9997846},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040716885,0.00042173124,0.98878264,0.00031303536,0.00026752596,0.0004329103,0.000006238464,0.00014957662,0.009219179],"genre_scores_gemma":[0.12657858,0.00008232914,0.8683792,0.00052636495,0.0010141542,0.000020649237,0.0000129277905,0.00015435003,0.0032314814],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972016,0.000040159957,0.0004598711,0.0008057422,0.0009018882,0.00059074606],"domain_scores_gemma":[0.9968872,0.0012433995,0.00039008545,0.0010939166,0.00023813116,0.00014726259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079410896,0.0005045368,0.0007430202,0.000781731,0.00015655074,0.00018419583,0.0010575398,0.00028480776,0.00017451606],"category_scores_gemma":[0.0003047869,0.00036670154,0.00014409167,0.0005473326,0.00087621517,0.00025243135,0.00038342696,0.0007804981,0.00004933947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046936554,0.00029185737,0.0004986196,0.00083533104,0.0006405343,0.0004311842,0.006729195,0.010465028,0.0014820432,0.30280402,0.0011179814,0.67423487],"study_design_scores_gemma":[0.0013211896,0.00017525363,0.00010104204,0.0011538897,0.00024399179,0.00013485205,5.0295375e-7,0.01773305,0.0016412798,0.97323334,0.0031180063,0.0011436009],"about_ca_topic_score_codex":0.000021464302,"about_ca_topic_score_gemma":0.00006855784,"teacher_disagreement_score":0.67309123,"about_ca_system_score_codex":0.00018445808,"about_ca_system_score_gemma":0.00020262273,"threshold_uncertainty_score":0.99987847},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011581767,0.000379705,0.98334813,0.00008130281,0.0033742422,0.00078677176,0.000011531349,0.00017466629,0.0002618728],"genre_scores_gemma":[0.81442374,0.000021570735,0.18464835,0.00037677493,0.00038349786,0.000018366447,0.000002304061,0.000055120297,0.00007029993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995963,0.00007073749,0.0006772187,0.0018867736,0.00066737377,0.000734919],"domain_scores_gemma":[0.9970918,0.00048636986,0.0004665536,0.0012992353,0.00036806543,0.00028795475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090896175,0.0006501854,0.0007118238,0.0010376136,0.00036338327,0.00078967714,0.0019383366,0.00036253803,0.000012407947],"category_scores_gemma":[0.00006526497,0.0006207568,0.00016533819,0.00035482494,0.00036522714,0.0011873919,0.00084721344,0.0004941217,0.000014800921],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001692965,0.000056318193,0.00055186875,0.00008211597,0.00003236697,0.000096562966,0.0051416615,0.00092596165,0.0010044877,0.0010473239,0.000007045324,0.99103737],"study_design_scores_gemma":[0.0009458481,0.0016067023,0.00084530946,0.0025462843,0.00006923706,0.0010130861,0.000007809972,0.8942402,0.02225959,0.06839662,0.0043913536,0.0036779807],"about_ca_topic_score_codex":0.00003388889,"about_ca_topic_score_gemma":0.00003855097,"teacher_disagreement_score":0.9873594,"about_ca_system_score_codex":0.00030359253,"about_ca_system_score_gemma":0.0003483115,"threshold_uncertainty_score":0.9996244},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022083726,0.0007149736,0.9923096,0.00010144987,0.0007153523,0.000429841,0.000020895926,0.00002848956,0.003471026],"genre_scores_gemma":[0.8591792,0.00021075686,0.14019689,0.000025462828,0.00012135256,0.000010354754,9.051569e-7,0.00003455598,0.00022050126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986478,0.000019484865,0.00047040393,0.0002831067,0.0003836433,0.00019553796],"domain_scores_gemma":[0.9967282,0.0020246706,0.00045447823,0.0005750666,0.00017347056,0.00004412487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005238762,0.00020162968,0.00041476844,0.00009925552,0.0001234228,0.000027177504,0.0005612213,0.000109093744,0.0000060811594],"category_scores_gemma":[0.0003918171,0.00013577017,0.00006096958,0.00013024532,0.001388615,0.00007362879,0.00024852465,0.0002259137,6.985789e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022508153,0.000047671827,0.0000369329,0.0004136243,0.00003084083,0.0000046161126,0.0028341499,0.00031446342,0.00008551618,0.96895105,0.000036752852,0.027221868],"study_design_scores_gemma":[0.00016488975,0.00008302126,0.0000068925583,0.00042643936,0.00002149511,0.0000071956747,0.0000011768084,0.0010159715,0.0019702485,0.9958869,0.00027841012,0.00013735448],"about_ca_topic_score_codex":0.0000025989507,"about_ca_topic_score_gemma":0.00004727592,"teacher_disagreement_score":0.85697085,"about_ca_system_score_codex":0.000029131099,"about_ca_system_score_gemma":0.00008949823,"threshold_uncertainty_score":0.5536547},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006170519,0.0012272262,0.9878039,0.0005689459,0.002073851,0.00017595675,0.0000022239383,0.00009679332,0.007989393],"genre_scores_gemma":[0.72816,0.0003190316,0.26523042,0.0009935023,0.0019930121,0.000011171028,0.0000049175683,0.00007354055,0.0032143986],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971067,0.000050009334,0.00046730528,0.0007812907,0.0009479622,0.00064674666],"domain_scores_gemma":[0.99680996,0.0008269822,0.00038117255,0.0016445845,0.00019226312,0.00014501665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018046313,0.00037688224,0.00039781127,0.00030344893,0.00038333246,0.00030119004,0.0040796436,0.00021974432,0.000015397354],"category_scores_gemma":[0.00014535873,0.00025507685,0.00015351038,0.00044270235,0.0009511422,0.00039175915,0.0012427444,0.00097537786,0.000040227114],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017435639,0.000022892857,0.000115556235,0.000014874195,0.0000078422345,0.000008841697,0.00035803005,0.0017463594,0.000020146292,0.06665928,0.000012248728,0.9310322],"study_design_scores_gemma":[0.00034872562,0.00044979353,0.001363536,0.0004977354,0.000020583988,0.00015128596,3.256147e-7,0.36613935,0.001269776,0.60102946,0.027530354,0.0011990704],"about_ca_topic_score_codex":0.00003897057,"about_ca_topic_score_gemma":0.000028812236,"teacher_disagreement_score":0.9298331,"about_ca_system_score_codex":0.00011371216,"about_ca_system_score_gemma":0.00033007722,"threshold_uncertainty_score":0.99999017},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071702834,0.00034356557,0.9938514,0.00015907672,0.0005920529,0.00030693825,0.000035796307,0.00006683846,0.0039273053],"genre_scores_gemma":[0.42717987,0.00013823266,0.57179075,0.00074875774,0.000048490725,0.0000051278366,0.000039691622,0.00002392652,0.000025145362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952806,0.00008283521,0.0008562239,0.0021454182,0.00093365187,0.00070123834],"domain_scores_gemma":[0.99481666,0.00056180207,0.0005088469,0.0038403494,0.0001413972,0.00013093116],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012032378,0.0005340812,0.0011089736,0.0023321584,0.00007059564,0.00024737802,0.008595969,0.0003373833,0.000031484702],"category_scores_gemma":[0.00007730549,0.00045497587,0.00021708604,0.0025570425,0.0011048256,0.00087613385,0.003194947,0.00068842,0.000018948353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011886657,0.00008361248,0.00084899255,0.000043762215,0.00015641654,0.00017668169,0.002059982,0.20606978,0.0000046375126,0.022552194,0.000011972283,0.7679801],"study_design_scores_gemma":[0.00017616291,0.00013060877,0.0010708573,0.00015136466,0.00009497925,0.000011847277,1.4574093e-7,0.88718945,0.000038900314,0.11047753,0.00016170535,0.00049645157],"about_ca_topic_score_codex":0.00018227243,"about_ca_topic_score_gemma":0.00034973558,"teacher_disagreement_score":0.76748365,"about_ca_system_score_codex":0.00016397092,"about_ca_system_score_gemma":0.0003332033,"threshold_uncertainty_score":0.9997902},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002703241,0.010716232,0.98609924,0.00074531895,0.0008764335,0.00061892415,0.000045851837,0.00038564863,0.00048530885],"genre_scores_gemma":[0.30492428,0.00009387286,0.6930401,0.00084704557,0.00089176575,0.0000114683535,0.000024923787,0.000051594892,0.000114980176],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610513,0.00008901874,0.0005006372,0.0018327399,0.0008706221,0.00060182234],"domain_scores_gemma":[0.99570906,0.00057268346,0.000496794,0.0027683899,0.0003197792,0.00013330764],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015209592,0.000563872,0.0005939187,0.00052922696,0.0005218121,0.0015707082,0.008129067,0.00030651037,0.0000029673042],"category_scores_gemma":[0.00020858338,0.00038901935,0.00003984779,0.00076475367,0.00096839655,0.0012500973,0.0053158407,0.0012037902,0.00000360491],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005623199,0.0000064079036,0.000096592004,0.00010688858,0.000041649277,0.00010688325,0.0030667079,0.0003011027,0.0002330424,0.049231373,0.00017182674,0.9466319],"study_design_scores_gemma":[0.0004180179,0.00024729187,0.00013689221,0.0027255458,0.000071412804,0.00038691718,0.00000281403,0.40336365,0.0050830333,0.5807579,0.0046811285,0.0021254],"about_ca_topic_score_codex":0.00013447682,"about_ca_topic_score_gemma":0.000098078795,"teacher_disagreement_score":0.9445065,"about_ca_system_score_codex":0.00017854707,"about_ca_system_score_gemma":0.0005239503,"threshold_uncertainty_score":0.9998562},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008983751,0.00093201594,0.98413306,0.008990141,0.0036797856,0.0009068066,0.00015158621,0.0009863846,0.00013039901],"genre_scores_gemma":[0.0658002,0.000082691295,0.9324832,0.00048551467,0.0009352938,0.00004232265,0.00008068488,0.00006580787,0.000024272087],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99417907,0.000043132935,0.00074504776,0.0023028255,0.0011761442,0.0015537548],"domain_scores_gemma":[0.9847876,0.0016639289,0.0005527604,0.012462852,0.00027453664,0.00025834204],"candidate_categories":["metaresearch","metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0009806473,0.00087953603,0.00083890284,0.0008205981,0.0004974773,0.00095835794,0.057036933,0.0011165945,0.000040094386],"category_scores_gemma":[0.011192605,0.0008196154,0.0002610686,0.0008461714,0.0009272387,0.0012817805,0.10077266,0.0020166745,0.000037955215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016840708,0.000083135594,0.00014725084,0.000172879,0.00004959599,0.000033502256,0.0003183686,0.0005305443,0.00020121742,0.13819385,0.001976665,0.8582761],"study_design_scores_gemma":[0.00021950329,0.00011000956,0.000121658966,0.00056607154,0.000017745338,0.000035656903,1.0182508e-7,0.19655138,0.0012321053,0.7956159,0.004703733,0.00082611194],"about_ca_topic_score_codex":0.0000066299576,"about_ca_topic_score_gemma":0.000008071841,"teacher_disagreement_score":0.85745,"about_ca_system_score_codex":0.0005377895,"about_ca_system_score_gemma":0.00041508226,"threshold_uncertainty_score":0.9994255},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029906986,0.0010950408,0.99470335,0.00024241905,0.0014760393,0.0003876212,0.000006255814,0.00013540938,0.0016547896],"genre_scores_gemma":[0.08939187,0.0002165722,0.90968096,0.00034437302,0.00022308445,0.000007944545,0.0000035460414,0.000020410327,0.00011121513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965984,0.00007863676,0.00076987693,0.0012452599,0.0008520906,0.00045569483],"domain_scores_gemma":[0.9965189,0.00043196348,0.00064865197,0.0017194555,0.0005759401,0.000105090665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017140055,0.00045357487,0.0006229184,0.0008217855,0.00025202424,0.00018968657,0.0024014001,0.00030546985,0.000005155232],"category_scores_gemma":[0.0003476478,0.0004221673,0.00012429748,0.0006695597,0.00082035194,0.0008170541,0.0006567967,0.00061780313,0.000015841853],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005839819,0.000026823287,0.000008349578,0.00011800443,0.000017996439,0.0002559194,0.0032115784,0.0041093533,0.00037130146,0.12441008,0.000014933933,0.8674498],"study_design_scores_gemma":[0.0003594265,0.0004560991,0.00009284629,0.0011037196,0.00003160255,0.0021234988,0.0000036712884,0.68408436,0.0150648365,0.29420763,0.0013628032,0.0011094662],"about_ca_topic_score_codex":0.000009280537,"about_ca_topic_score_gemma":0.000012066388,"teacher_disagreement_score":0.86634034,"about_ca_system_score_codex":0.00038342044,"about_ca_system_score_gemma":0.00031305745,"threshold_uncertainty_score":0.99982303},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025213799,0.0001126364,0.9695444,0.00007310534,0.0036722487,0.00020813198,0.000002330216,0.00043062487,0.00074273424],"genre_scores_gemma":[0.9031828,0.000026639045,0.09573036,0.000058617396,0.00084688293,0.0000065598597,0.000005437034,0.00004741607,0.00009527162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853176,0.000011801443,0.00026215307,0.0004844737,0.00031604472,0.0003937671],"domain_scores_gemma":[0.9994727,0.00009630185,0.000056538174,0.00025755845,0.000042110736,0.000074798256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034920202,0.0002845345,0.0002693805,0.00070406846,0.000105166524,0.00014608278,0.0004051362,0.00038642096,0.00002859491],"category_scores_gemma":[0.000072650415,0.00028234004,0.000043849555,0.00028938695,0.0001141457,0.00019907266,0.00013347258,0.0012593037,0.000045682737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004371573,0.0000020699736,0.000013631903,0.000015165553,0.000002129571,0.000016386872,0.00013780994,0.69574237,0.030589435,0.000028118411,0.000008937967,0.2734396],"study_design_scores_gemma":[0.0005041477,0.0002558059,0.0027999023,0.00078942836,0.000013918278,0.00007247899,3.2227484e-7,0.8974308,0.079520606,0.011214292,0.006126927,0.0012714139],"about_ca_topic_score_codex":0.000061489605,"about_ca_topic_score_gemma":0.00019644653,"teacher_disagreement_score":0.877969,"about_ca_system_score_codex":0.00025474638,"about_ca_system_score_gemma":0.000055841545,"threshold_uncertainty_score":0.99996287},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003369295,0.0020742116,0.9903149,0.0013828665,0.0014748038,0.00020520369,0.0000018527152,0.00018025264,0.004028977],"genre_scores_gemma":[0.046565283,0.00041334645,0.94589204,0.0056570475,0.00081197516,0.0000064241904,0.00000605226,0.000030057847,0.000617775],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997334,0.000017055374,0.000391356,0.0010699844,0.00064553623,0.00054204796],"domain_scores_gemma":[0.9981727,0.000523413,0.00019764123,0.0008670448,0.00011554294,0.0001236574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071634323,0.0003524782,0.00038646787,0.0006963166,0.00027656,0.00050964794,0.0020910723,0.0002828152,0.0000055984397],"category_scores_gemma":[0.00010586804,0.0003140726,0.000060979008,0.00039525004,0.0005678173,0.00083548954,0.0012162233,0.0005444107,0.000013576098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013807272,0.000010847335,0.0007190472,0.000045226636,0.000009247409,0.00010363544,0.0010134602,0.0006721076,0.000038976206,0.3523783,0.000018610754,0.64498913],"study_design_scores_gemma":[0.00034484128,0.00016305846,0.0050255833,0.00048076283,0.000013570565,0.00013889978,0.0000010381017,0.09152841,0.0005692583,0.8917997,0.009024306,0.00091056916],"about_ca_topic_score_codex":0.000047163645,"about_ca_topic_score_gemma":0.0001991348,"teacher_disagreement_score":0.64407855,"about_ca_system_score_codex":0.00012210719,"about_ca_system_score_gemma":0.0002627078,"threshold_uncertainty_score":0.99993116},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018777475,0.00033571917,0.9916758,0.00016690664,0.0016341463,0.00049707026,0.000004853978,0.00033763595,0.0053291176],"genre_scores_gemma":[0.004617682,0.00006745017,0.9923386,0.0012513015,0.0002440803,0.000018959117,0.0000028731865,0.000050330356,0.0014087054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949647,0.00006911708,0.0007272898,0.0020330695,0.0013266809,0.0008791433],"domain_scores_gemma":[0.99634576,0.00009863448,0.0004197572,0.002563869,0.00032815302,0.00024383837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015784417,0.0006864353,0.0006115418,0.0009134297,0.00029991096,0.0005540859,0.005087136,0.0005561474,0.00003405925],"category_scores_gemma":[0.00021866166,0.00064947765,0.0002011764,0.00077024155,0.00082583335,0.0010851172,0.0016385504,0.0011969114,0.00018676092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054788497,0.00008079728,0.000015257451,0.000054985154,0.000016126936,0.000056368302,0.0018544808,0.16957706,0.0001662872,0.38430503,0.000054819684,0.4438133],"study_design_scores_gemma":[0.00026092315,0.00007283785,0.000033373322,0.00015636368,0.0000074098816,0.000049291604,5.2938965e-8,0.936735,0.001518513,0.059989925,0.00048786544,0.0006884455],"about_ca_topic_score_codex":0.000010332761,"about_ca_topic_score_gemma":0.000009934996,"teacher_disagreement_score":0.7671579,"about_ca_system_score_codex":0.0005167953,"about_ca_system_score_gemma":0.00038806905,"threshold_uncertainty_score":0.99959564},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037007432,0.00003593163,0.9610052,0.0009255522,0.00028703737,0.00038063523,0.0000036107274,0.0002890428,0.00006552069],"genre_scores_gemma":[0.19301243,0.0000036249116,0.8045377,0.0023458481,0.00007764883,0.00000794848,0.0000026644177,0.000010413935,0.0000016897752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997382,0.000120151766,0.0003206994,0.00095383904,0.0007282297,0.00049507665],"domain_scores_gemma":[0.9984912,0.0001245423,0.00016645243,0.0007627787,0.00017328377,0.00028171187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011551103,0.00026580266,0.00026784313,0.0004398142,0.00024169125,0.0005518886,0.0011847296,0.00008441357,0.00002198559],"category_scores_gemma":[0.00022760665,0.00023519494,0.000040459418,0.0017370774,0.00033398502,0.0013891011,0.00048078108,0.00036652444,0.0000058455216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026287433,0.00018178519,0.00016325104,0.000052692543,0.0000050580375,0.00032334778,0.0034884792,0.0015687761,0.350516,0.00017386727,0.00013790427,0.6433625],"study_design_scores_gemma":[0.00047524046,0.00022603571,0.0010157616,0.00015894411,0.0000057893208,0.00012881539,9.088315e-7,0.73731416,0.2556736,0.004642641,0.000015492411,0.0003426357],"about_ca_topic_score_codex":0.0003284328,"about_ca_topic_score_gemma":0.000023228265,"teacher_disagreement_score":0.7357454,"about_ca_system_score_codex":0.00014561522,"about_ca_system_score_gemma":0.0003018057,"threshold_uncertainty_score":0.9590971},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05427946,0.00012292108,0.94428986,0.0002738998,0.00062670547,0.00012255162,0.00000356901,0.000018896686,0.00026210866],"genre_scores_gemma":[0.81909573,0.0000049932264,0.18012841,0.0006163333,0.00014129278,0.000003646472,0.000004540436,0.000004570867,4.8959726e-7],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988455,0.000041429303,0.00018037039,0.0003070608,0.00039900854,0.00022661124],"domain_scores_gemma":[0.99916625,0.00038539525,0.000042693016,0.0002284881,0.00010504975,0.00007209658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041480755,0.000101432204,0.00022627368,0.00024505943,0.000031884207,0.00001871001,0.00011018094,0.000049243474,0.00001314628],"category_scores_gemma":[0.00024146012,0.00008451064,0.00004551658,0.0005028356,0.00040031289,0.00008278502,0.000075486736,0.0002511739,0.0000018744155],"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.000100325,0.00029449645,0.79431504,0.000051329513,0.000015414178,0.00012788824,0.00066569913,0.0038174808,0.0046590283,0.0006847871,0.00026548287,0.19500305],"study_design_scores_gemma":[0.0005103607,0.00022150691,0.97830546,0.00007396903,0.000016657381,0.0000620802,0.0000012901239,0.014003512,0.0030243276,0.003683259,0.000013275511,0.000084313055],"about_ca_topic_score_codex":0.00019459554,"about_ca_topic_score_gemma":0.00001908932,"teacher_disagreement_score":0.7648163,"about_ca_system_score_codex":0.00008192721,"about_ca_system_score_gemma":0.00023537385,"threshold_uncertainty_score":0.3446244},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021888267,0.00005010258,0.97662324,0.00010060529,0.0005908432,0.00037619527,0.0000011889182,0.0003361208,0.00003344847],"genre_scores_gemma":[0.598999,0.0000031051168,0.40071824,0.00019974931,0.00006469109,0.00000766583,9.491908e-7,0.0000062067093,3.4488795e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979509,0.000059353817,0.0003550004,0.00077493733,0.00037537442,0.0004844488],"domain_scores_gemma":[0.99844867,0.00049353787,0.000107138214,0.00059142406,0.00024262466,0.000116592906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001098248,0.00019320974,0.00021907779,0.000339122,0.00023648949,0.00028229898,0.001572124,0.00009090638,0.000005068771],"category_scores_gemma":[0.00007710752,0.00017888108,0.000086203945,0.0018851166,0.00017408241,0.0007186357,0.000408071,0.00013258145,0.0000020455257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037324542,0.00017350592,0.0017681412,0.000026862614,0.000009127125,0.00002866062,0.013054449,0.2344068,0.00053350755,0.10880556,0.0000107629785,0.6411453],"study_design_scores_gemma":[0.00053533696,0.00017498047,0.0005983051,0.000026987576,0.0000011521519,0.000012659992,5.217957e-7,0.94167614,0.010688822,0.04588668,0.00017169293,0.00022669883],"about_ca_topic_score_codex":0.000020840705,"about_ca_topic_score_gemma":0.000009615725,"teacher_disagreement_score":0.7072694,"about_ca_system_score_codex":0.0000504227,"about_ca_system_score_gemma":0.00015865211,"threshold_uncertainty_score":0.7294558},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008183303,0.0008702989,0.98812515,0.00070455315,0.0023060304,0.0006015152,0.000026140342,0.00038553073,0.006898963],"genre_scores_gemma":[0.048219983,0.00008153391,0.9498809,0.0006231674,0.0007742384,0.000058634818,0.00001163256,0.000052769934,0.00029711574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531215,0.00013271591,0.00082967104,0.0017438676,0.0011132173,0.00086834945],"domain_scores_gemma":[0.9945761,0.0014083482,0.00060514937,0.0028344041,0.00029448152,0.0002815374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001611384,0.00065618096,0.00073202996,0.0009020869,0.00036169557,0.00067203876,0.005082884,0.0005247755,0.0001307741],"category_scores_gemma":[0.00034548316,0.0006209395,0.00020856391,0.00071021647,0.0006178887,0.0012775674,0.0010578346,0.0008419046,0.0006030099],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007851108,0.0000613731,0.000035447945,0.000017323218,0.000030831012,0.000012645701,0.0007676332,0.0013766605,0.0052026096,0.045034137,0.000091731556,0.94736177],"study_design_scores_gemma":[0.0004437653,0.00008086776,0.0021337534,0.0005001249,0.00006208004,0.00006379795,2.9076537e-7,0.7780411,0.045314815,0.1510027,0.020585634,0.0017710578],"about_ca_topic_score_codex":0.000040448373,"about_ca_topic_score_gemma":0.00001970955,"teacher_disagreement_score":0.9455907,"about_ca_system_score_codex":0.0005405701,"about_ca_system_score_gemma":0.00046597858,"threshold_uncertainty_score":0.9996242},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025636752,0.00007310093,0.9949647,0.0008371279,0.0006002969,0.0011454364,0.000005378444,0.00020824806,0.0019093285],"genre_scores_gemma":[0.97545326,0.000002300449,0.023108011,0.0006119089,0.00045235123,0.00008299333,0.000045463737,0.000017655804,0.0002260869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617875,0.000058232436,0.00055142475,0.0016563957,0.0011501989,0.00040502736],"domain_scores_gemma":[0.99702626,0.0005222853,0.00049037713,0.0014784228,0.00036463735,0.0001180273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007160342,0.00042564177,0.00049987267,0.0011726822,0.0002642654,0.00034674897,0.0015850385,0.0002804633,0.0000073466595],"category_scores_gemma":[0.000136728,0.00035354015,0.00017531498,0.0012665151,0.00020530332,0.00044003353,0.00016963207,0.00038602998,0.00015021877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049591868,0.00002343883,0.000042046235,0.000014419936,0.000025896174,0.0000030687431,0.0000863707,0.84321976,0.00012823785,0.006952014,0.0000033085714,0.14949647],"study_design_scores_gemma":[0.00014222994,0.000111961795,0.00012415442,0.00007629509,0.00003693825,0.0000018347182,6.347678e-8,0.9685226,0.0007424371,0.029584441,0.00027209878,0.00038494114],"about_ca_topic_score_codex":0.000057192236,"about_ca_topic_score_gemma":0.000057888243,"teacher_disagreement_score":0.97519684,"about_ca_system_score_codex":0.00037586788,"about_ca_system_score_gemma":0.00028401215,"threshold_uncertainty_score":0.99989164},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036761147,0.000092104536,0.9964117,0.00020668808,0.0010073584,0.0005126585,0.0000026972455,0.00027351745,0.0011256776],"genre_scores_gemma":[0.9681221,0.000065900094,0.030597892,0.0009311779,0.000086068714,0.000033651442,0.0000056190383,0.000059660735,0.00009792202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824613,0.00000759973,0.00034739732,0.0005840815,0.00029035917,0.000524402],"domain_scores_gemma":[0.99930346,0.00007885816,0.00003562948,0.00041687104,0.00008394501,0.00008122065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018913027,0.00041227418,0.00042207635,0.00069237023,0.000068850466,0.00014535074,0.0008888448,0.00040193656,0.000042348987],"category_scores_gemma":[0.000010696527,0.0003817788,0.00005208898,0.00056447973,0.00022097926,0.00017345819,0.00014795957,0.0006733724,0.000059021186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017184606,0.000003548695,0.0000029805622,0.000020094865,0.0000044795756,0.000018142797,0.00038224724,0.8153708,0.0003516022,0.0022476325,0.000027977396,0.18156879],"study_design_scores_gemma":[0.00016371263,0.00007375866,0.000031823827,0.00034317677,0.000003359885,0.0000057340694,9.611648e-7,0.9747498,0.011264579,0.012707995,0.00013847668,0.0005166222],"about_ca_topic_score_codex":0.000026520514,"about_ca_topic_score_gemma":0.0002043926,"teacher_disagreement_score":0.9677545,"about_ca_system_score_codex":0.00030551612,"about_ca_system_score_gemma":0.00006202247,"threshold_uncertainty_score":0.9998634},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014070415,0.0009055474,0.99195665,0.0006331472,0.0032084421,0.0007807495,0.00043190835,0.00022864073,0.0018408358],"genre_scores_gemma":[0.0048126346,0.00014827057,0.9899149,0.0016671874,0.0014232688,0.000025852174,0.00041602892,0.00007482863,0.00151701],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99456525,0.00003084348,0.0006811872,0.002733073,0.0010601986,0.0009294348],"domain_scores_gemma":[0.9937665,0.00062983553,0.0004232015,0.004606035,0.0003108993,0.0002635508],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00086946395,0.00071793195,0.0007617016,0.000591756,0.0004878657,0.000364589,0.0062684957,0.00037609757,0.000035993424],"category_scores_gemma":[0.00021434807,0.0006346508,0.00014173685,0.00062626676,0.00062987965,0.0019100246,0.004441215,0.00067597226,0.000043743254],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045948735,0.00004121105,0.000059531492,0.00026138124,0.00005231523,0.0003670393,0.000613546,0.020061748,0.00054287375,0.11108365,0.0026287509,0.864242],"study_design_scores_gemma":[0.0006116729,0.00017237627,0.000028195316,0.0006399791,0.00001788473,0.00035288153,5.9803074e-7,0.45072743,0.0007587196,0.069151565,0.4763692,0.0011694905],"about_ca_topic_score_codex":0.00005275862,"about_ca_topic_score_gemma":0.0002837823,"teacher_disagreement_score":0.8630725,"about_ca_system_score_codex":0.00028374046,"about_ca_system_score_gemma":0.0007086486,"threshold_uncertainty_score":0.9996105},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035236264,0.0013342692,0.9916318,0.0003059268,0.002243459,0.0004210435,0.000009139158,0.00021072391,0.0034912403],"genre_scores_gemma":[0.32087395,0.0001430322,0.6707989,0.005095223,0.0017115811,0.00002565055,0.00008702741,0.000075312884,0.0011893627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953632,0.000069412126,0.0007307754,0.0017856737,0.0011803431,0.0008706356],"domain_scores_gemma":[0.99702287,0.00056449155,0.00041499225,0.0012633102,0.00043697978,0.00029738588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012333797,0.000631752,0.0005834075,0.0015859845,0.00044650814,0.0008252022,0.002826512,0.0003709694,0.000074252814],"category_scores_gemma":[0.00018451278,0.00061596814,0.000188477,0.0016148655,0.00033001325,0.0009544726,0.0012877389,0.00076594343,0.00012905277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004376849,0.00006288908,0.00008598792,0.000043079053,0.000030925585,0.000090455964,0.000644097,0.13136391,0.0005093739,0.082112364,0.0001650461,0.7848875],"study_design_scores_gemma":[0.0002779118,0.00023025059,0.0001016795,0.00009282865,0.000014723121,0.000088488094,1.1618612e-7,0.770645,0.0024915605,0.21499455,0.010211256,0.00085162104],"about_ca_topic_score_codex":0.000099012235,"about_ca_topic_score_gemma":0.000103452876,"teacher_disagreement_score":0.78403586,"about_ca_system_score_codex":0.00031639324,"about_ca_system_score_gemma":0.0007018845,"threshold_uncertainty_score":0.99962914},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014928797,0.00018654818,0.9894278,0.00037471484,0.000952364,0.00021970751,0.0000104932415,0.00012032319,0.008558748],"genre_scores_gemma":[0.26090825,0.000072039475,0.73662835,0.0016311859,0.0003251053,0.0000056345248,0.00001907665,0.00003396697,0.0003764024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566734,0.000054118067,0.00076630857,0.0016507836,0.0012099254,0.000651554],"domain_scores_gemma":[0.9961383,0.0005295644,0.0005278093,0.002315696,0.00031169268,0.00017694564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009567074,0.0005452326,0.001120325,0.0020173609,0.00017172136,0.00033495246,0.0047280476,0.00037178583,0.000047249578],"category_scores_gemma":[0.000049061277,0.00044971166,0.0004103624,0.0026390934,0.0006929674,0.00033887202,0.0012910719,0.0005800179,0.000029703953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005331029,0.000042121017,0.0004029843,0.000035627218,0.00020881457,0.000048603517,0.00068369776,0.1069765,0.000025943917,0.075973265,0.00004357058,0.81555355],"study_design_scores_gemma":[0.00016520853,0.00020450671,0.00076285395,0.000105667204,0.00012010389,0.000009694772,5.3574684e-8,0.9484989,0.000121962716,0.046526495,0.002932498,0.0005520318],"about_ca_topic_score_codex":0.000057243804,"about_ca_topic_score_gemma":0.0001309899,"teacher_disagreement_score":0.8415224,"about_ca_system_score_codex":0.00015667125,"about_ca_system_score_gemma":0.00028677852,"threshold_uncertainty_score":0.99979544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006631809,0.00017492572,0.9923286,0.0006337292,0.002944621,0.0010072337,0.00017170639,0.00026534803,0.0024075317],"genre_scores_gemma":[0.017132599,0.000023501012,0.97848886,0.0011996474,0.0009919477,0.000018978524,0.00022757036,0.00006900247,0.0018479154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99452233,0.000034914312,0.0006618154,0.0027811625,0.0010260403,0.00097374996],"domain_scores_gemma":[0.99472237,0.00039597653,0.0004233292,0.003986341,0.0002518788,0.00022011304],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015719306,0.000680203,0.00062051753,0.000939482,0.00036580456,0.0010175761,0.0084470045,0.00025444393,0.000043283664],"category_scores_gemma":[0.00013001199,0.0006188726,0.00014327826,0.00059394824,0.0005078947,0.0008566148,0.005714662,0.0005368284,0.0001189912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037916867,0.00015416619,0.0001295558,0.00024920137,0.00008064407,0.00026492274,0.0009016122,0.01734379,0.00012645556,0.03691492,0.0016004862,0.9421963],"study_design_scores_gemma":[0.00044146297,0.00013265366,0.000020348149,0.0002554236,0.00002297066,0.000029862107,2.7920913e-7,0.9514791,0.00023487039,0.014394987,0.032164827,0.00082322786],"about_ca_topic_score_codex":0.00003807442,"about_ca_topic_score_gemma":0.00009369731,"teacher_disagreement_score":0.9413731,"about_ca_system_score_codex":0.00017216333,"about_ca_system_score_gemma":0.00041344887,"threshold_uncertainty_score":0.9996263},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003182447,0.00054295175,0.9906382,0.0025279354,0.0027796712,0.0007997113,0.000017904445,0.0006823027,0.0016930831],"genre_scores_gemma":[0.45145702,0.000023133472,0.5445048,0.003286945,0.00035770715,0.000051678668,0.000015702228,0.00006540498,0.00023756013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934773,0.00005561756,0.0009191713,0.0022036158,0.0015680538,0.001776274],"domain_scores_gemma":[0.99529946,0.0008281048,0.0004235511,0.0026353695,0.0003662031,0.00044732034],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020319207,0.0008811311,0.0009844711,0.0026154306,0.00023517797,0.0010835114,0.007405971,0.0006540128,0.000018370469],"category_scores_gemma":[0.00070875644,0.0008465304,0.0002040817,0.0017058514,0.00072614016,0.001483988,0.0032130287,0.0015180589,0.000072112794],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012370465,0.00007890635,0.0012884014,0.00005250287,0.000013794057,0.00034002354,0.0004577842,0.021219432,0.00047855524,0.03541169,0.00018838295,0.9404582],"study_design_scores_gemma":[0.0013055049,0.00043554636,0.001846373,0.0016710194,0.000024644438,0.00011777979,0.0000021138671,0.92045605,0.0028372786,0.059031148,0.009435656,0.0028368856],"about_ca_topic_score_codex":0.00008615418,"about_ca_topic_score_gemma":0.00028784247,"teacher_disagreement_score":0.9376213,"about_ca_system_score_codex":0.00096324924,"about_ca_system_score_gemma":0.00080955564,"threshold_uncertainty_score":0.99995345},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021142278,0.00047231454,0.9890659,0.00032345188,0.0014139147,0.0002016252,0.000005645376,0.00009381317,0.008211949],"genre_scores_gemma":[0.1342629,0.000105541534,0.8641764,0.00087309664,0.00024013263,0.00000521695,0.0000036064957,0.00001680682,0.0003163082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973999,0.000025131247,0.00052745925,0.0009749837,0.00068080524,0.00039167426],"domain_scores_gemma":[0.9984253,0.000098107856,0.00023015062,0.00083109486,0.00032104124,0.000094280986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003253339,0.0003484439,0.00040735086,0.00032187896,0.00020383386,0.00017304969,0.0019641083,0.00017591374,0.00008129523],"category_scores_gemma":[0.00005143975,0.00030481958,0.000111790185,0.00034599684,0.0015070857,0.0015616062,0.0006338927,0.0005223986,0.000028608785],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041430444,0.000035748766,0.00000897833,0.000017473241,0.000009098453,0.000032723558,0.0042175245,0.056410175,0.0033567846,0.19373961,0.00001627404,0.74215144],"study_design_scores_gemma":[0.00038198038,0.0003384636,0.00011733379,0.00044514675,0.00001180095,0.00013108025,0.000002573897,0.54909116,0.055916473,0.3892429,0.0033708902,0.00095020165],"about_ca_topic_score_codex":0.00013063726,"about_ca_topic_score_gemma":0.00004677506,"teacher_disagreement_score":0.7412013,"about_ca_system_score_codex":0.0001405565,"about_ca_system_score_gemma":0.0006404175,"threshold_uncertainty_score":0.9999404},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025729052,0.00035926478,0.99508345,0.0006572403,0.0009632102,0.00038218414,0.000010886206,0.0002152033,0.0020712593],"genre_scores_gemma":[0.33015367,0.00007188882,0.66666913,0.0022740178,0.0005923417,0.000016145783,0.00010250095,0.00003602725,0.000084292864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965075,0.000045650646,0.0006208158,0.00090291887,0.0014637719,0.00045928918],"domain_scores_gemma":[0.99763876,0.00029820105,0.0004178648,0.00066895544,0.00072735024,0.0002488419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014887215,0.00045319824,0.0003871417,0.0011305147,0.00022300516,0.0008836036,0.0013585846,0.0002974346,0.00001956369],"category_scores_gemma":[0.0001646396,0.00045507832,0.000074597236,0.0005677421,0.0005558875,0.0032186932,0.0009413573,0.0007217555,0.000098309734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017121081,0.000031095482,0.00004916874,0.00009140451,0.000011350741,0.000028357948,0.002385216,0.1724669,0.000065564964,0.086032785,0.00020574481,0.7386153],"study_design_scores_gemma":[0.00030872397,0.000112924805,0.00009561478,0.00013168849,0.0000044608078,0.00007359451,2.2424881e-7,0.61957777,0.000081864906,0.37738115,0.0018598732,0.00037209116],"about_ca_topic_score_codex":0.00003780643,"about_ca_topic_score_gemma":0.000025984476,"teacher_disagreement_score":0.7382432,"about_ca_system_score_codex":0.00051330676,"about_ca_system_score_gemma":0.0008450695,"threshold_uncertainty_score":0.9997901},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006760069,0.00043444207,0.99413395,0.0024184014,0.0010427181,0.00070337584,0.00003517331,0.00024738847,0.0003085674],"genre_scores_gemma":[0.4342967,0.000042392945,0.5633625,0.0007757348,0.0013326167,0.000014748945,0.00008047553,0.00004508632,0.000049768143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99535954,0.00008349404,0.0007565467,0.0015402193,0.001148588,0.0011115872],"domain_scores_gemma":[0.9973239,0.00031519064,0.0005290548,0.001429696,0.00030380662,0.00009837254],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014993639,0.00050702237,0.000796812,0.0008017353,0.00024261238,0.00018491047,0.0072139543,0.0005515922,0.0000064711726],"category_scores_gemma":[0.00020603136,0.00049986306,0.00008566166,0.0021589317,0.00071114016,0.0008351469,0.00492757,0.0010673413,0.000010594721],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027514021,0.000106275285,0.0005343475,0.000044156663,0.00002331381,0.00001897422,0.0020831751,0.010814557,0.00014529366,0.027218776,0.0004289502,0.9585547],"study_design_scores_gemma":[0.0015763824,0.000427343,0.02384556,0.0008868308,0.000049509108,0.000047494508,0.0000021508577,0.60733634,0.0015485844,0.35277146,0.008867256,0.0026410592],"about_ca_topic_score_codex":0.000036879646,"about_ca_topic_score_gemma":0.00081888575,"teacher_disagreement_score":0.9559136,"about_ca_system_score_codex":0.00050708966,"about_ca_system_score_gemma":0.00064235064,"threshold_uncertainty_score":0.9997453},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023044732,0.0013238481,0.98317486,0.0001741289,0.0017757936,0.00060898776,0.0005844852,0.00017415288,0.009879258],"genre_scores_gemma":[0.9870278,0.00001737209,0.011460147,0.00017349685,0.0002803899,6.7271145e-7,0.00084575434,0.00000976114,0.00018456481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744576,0.000054003503,0.00028752082,0.001059127,0.0008303905,0.00032321972],"domain_scores_gemma":[0.9984176,0.00018774287,0.00014198541,0.0010187635,0.00003118044,0.00020270604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012063129,0.00028719348,0.00030933353,0.00030163166,0.00018123555,0.00031170456,0.0010703909,0.00015106371,0.000042069434],"category_scores_gemma":[0.00005692666,0.00024297406,0.000025780788,0.00022304307,0.00051874307,0.00036916466,0.00039714205,0.0002664638,0.000044655128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000505136,0.000049992403,0.036566507,0.00041167066,0.000035598816,0.00027903053,0.00010630337,0.048439443,0.000006144593,0.0022807014,0.00022029622,0.9115538],"study_design_scores_gemma":[0.00030954956,0.00014702849,0.025492119,0.00029509125,0.00003601686,0.000017235918,0.000001407002,0.9691975,0.000004760526,0.0010455596,0.0031054595,0.00034825245],"about_ca_topic_score_codex":0.0002530324,"about_ca_topic_score_gemma":0.00050964166,"teacher_disagreement_score":0.9847234,"about_ca_system_score_codex":0.00007474527,"about_ca_system_score_gemma":0.00013355233,"threshold_uncertainty_score":0.99081945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052244886,0.000358265,0.9907961,0.0019316159,0.0024869945,0.0005150484,0.000005446584,0.00013656,0.0037177203],"genre_scores_gemma":[0.04191567,0.0000106335065,0.95209914,0.003932994,0.0011359617,0.000026059992,0.000017505357,0.000035609883,0.0008264441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611443,0.000019907122,0.0004712005,0.0014132696,0.0014466702,0.00053454284],"domain_scores_gemma":[0.99763936,0.00021923106,0.00017251297,0.0011147668,0.00050333486,0.00035078503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012715422,0.00043435054,0.000381987,0.0010025195,0.00019101576,0.0004976541,0.002341312,0.00018405178,0.000037551035],"category_scores_gemma":[0.00011511994,0.00040902305,0.000091515896,0.0008562107,0.00015075532,0.00048032837,0.0016089587,0.000425798,0.00023695375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006580214,0.00002393435,0.000006832971,0.000010515382,0.000006775945,0.00004068987,0.0004424647,0.35670257,0.00007989834,0.044220876,0.00068243605,0.5977764],"study_design_scores_gemma":[0.00029661745,0.00040551406,0.000077995704,0.00016955123,0.000005473969,0.0000568171,1.2880965e-7,0.59017706,0.00066148594,0.39235535,0.015087227,0.0007067776],"about_ca_topic_score_codex":0.000013592986,"about_ca_topic_score_gemma":0.00013560374,"teacher_disagreement_score":0.5970696,"about_ca_system_score_codex":0.0005070605,"about_ca_system_score_gemma":0.00089768955,"threshold_uncertainty_score":0.99983615},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018487985,0.00314379,0.98898154,0.00061935943,0.00032207352,0.00015098232,0.000010887874,0.00007581622,0.006677083],"genre_scores_gemma":[0.015413939,0.003420224,0.97756195,0.0019249761,0.0003657842,0.0000068761055,0.00007963453,0.000020449326,0.0012061793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963384,0.000051259034,0.00038851812,0.0019869206,0.00069861393,0.000536291],"domain_scores_gemma":[0.99682385,0.00022799119,0.00015614924,0.002643299,0.000040468643,0.00010825727],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011863512,0.00034092477,0.00043801407,0.001105905,0.00012084948,0.00062203995,0.006828779,0.00012943064,0.0000026808539],"category_scores_gemma":[0.00005165548,0.00030633496,0.000033339606,0.0015885334,0.00033086215,0.0016459887,0.004146204,0.00047365605,0.000012398768],"study_design_candidate":"design_other","study_design_consensus":null,"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.961396e-7,0.00002153064,0.000091396556,0.00003541636,0.0000035763958,0.00012761043,0.00012295424,0.0035941969,0.0000021274964,0.0011055213,0.00026553296,0.99462914],"study_design_scores_gemma":[0.0002452482,0.000050893104,0.00025649194,0.0005285574,0.000010419434,0.000027370244,3.361494e-7,0.9222202,0.000012770721,0.037739128,0.038433652,0.00047494876],"about_ca_topic_score_codex":0.000006641734,"about_ca_topic_score_gemma":0.00023345745,"teacher_disagreement_score":0.9941542,"about_ca_system_score_codex":0.00014925699,"about_ca_system_score_gemma":0.00036088048,"threshold_uncertainty_score":0.99993885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040715208,0.00016895674,0.99561995,0.000006540277,0.0018251418,0.0002920668,0.000004771089,0.0003743005,0.0013011209],"genre_scores_gemma":[0.97888863,0.00004792923,0.019226873,0.00009537633,0.0015908624,0.0000068543095,0.00004869032,0.00007684831,0.000017929027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981603,0.000022642213,0.0005077421,0.0005088128,0.0003523359,0.00044815976],"domain_scores_gemma":[0.9990657,0.00006901455,0.000145766,0.00052733684,0.00012464666,0.00006752296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031359546,0.00036123794,0.00044328943,0.0003548852,0.00010989188,0.00008083339,0.0007253122,0.000712864,0.00001758246],"category_scores_gemma":[0.000024256711,0.00034673003,0.00006944922,0.00053433835,0.0005909015,0.00019107007,0.00015818066,0.000652295,0.0000023259922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008035221,0.000008349739,0.000085355896,0.0000170652,0.0000064165865,0.0000037431598,0.0001256418,0.7981288,0.000008477254,0.0032775921,0.000017170074,0.19831337],"study_design_scores_gemma":[0.00011150931,0.000077254874,0.0000042971506,0.00010475777,0.000012332299,0.000008032956,9.411279e-7,0.98618305,0.0014147559,0.0116160475,0.00011501803,0.00035201068],"about_ca_topic_score_codex":0.000016740712,"about_ca_topic_score_gemma":0.000037192538,"teacher_disagreement_score":0.9784815,"about_ca_system_score_codex":0.00012680412,"about_ca_system_score_gemma":0.00006582667,"threshold_uncertainty_score":0.9998985},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025976164,0.0009765263,0.9946381,0.00022412934,0.0011355134,0.00032092695,0.000058064135,0.00043239974,0.0019546102],"genre_scores_gemma":[0.83259684,0.000038741073,0.16596366,0.00030455747,0.00070632546,0.000012889292,0.00008882046,0.00009321684,0.00019491655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828887,0.000006374179,0.0003484445,0.00069705193,0.00025767533,0.00040159628],"domain_scores_gemma":[0.99845874,0.00022686507,0.000073445604,0.0010738862,0.00008477464,0.000082268365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006592718,0.00031689278,0.00036226347,0.00036222857,0.00012465207,0.00006469234,0.0015862389,0.00046787158,0.000027169794],"category_scores_gemma":[0.00005936007,0.00031849823,0.000054747128,0.00017476347,0.0004110383,0.00033140834,0.00039921518,0.00073792244,0.000019267647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021563152,0.000013267973,0.000065150634,0.00010778908,0.000036368987,0.000019711122,0.00061362475,0.14822802,0.0002907578,0.0027640897,0.0004981641,0.8473415],"study_design_scores_gemma":[0.00023477808,0.00007352134,0.00006598599,0.00015198295,0.000015045272,0.00002066472,3.205494e-7,0.95818496,0.00044584542,0.031204592,0.0092035355,0.00039875635],"about_ca_topic_score_codex":0.0000041240028,"about_ca_topic_score_gemma":0.00010094921,"teacher_disagreement_score":0.8469427,"about_ca_system_score_codex":0.00021803346,"about_ca_system_score_gemma":0.00019000526,"threshold_uncertainty_score":0.9999267},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019565374,0.00020399895,0.99202526,0.00013993468,0.00182156,0.0005178602,0.0000016292677,0.000078453064,0.003254789],"genre_scores_gemma":[0.99520826,0.0000159512,0.004327035,0.00014158132,0.00022846089,0.000018265639,0.000001381123,0.000017664732,0.00004142555],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971177,0.0002501091,0.0003505479,0.00093363243,0.000997906,0.00035013212],"domain_scores_gemma":[0.99652827,0.0017715063,0.00026503293,0.0011635871,0.0001780685,0.00009354239],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002431757,0.00038512502,0.00043231936,0.00044609644,0.00021214175,0.00019605283,0.002026309,0.00027349638,0.000010599513],"category_scores_gemma":[0.00016627267,0.00025156746,0.0001292558,0.0005094966,0.0005502811,0.00025896478,0.000773836,0.0008094539,0.000015043162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007954809,0.00006877784,0.0000070993865,0.00007791662,0.000018425973,0.000007514252,0.0003283637,0.04129487,0.00046090354,0.23304667,0.000013438799,0.7245965],"study_design_scores_gemma":[0.00019226152,0.0005904661,0.00013749168,0.00043347612,0.000006523672,0.000021619182,1.1242968e-7,0.38281927,0.020767218,0.5944762,0.00023872593,0.00031662418],"about_ca_topic_score_codex":0.000014016088,"about_ca_topic_score_gemma":0.000050056296,"teacher_disagreement_score":0.9932517,"about_ca_system_score_codex":0.00028020894,"about_ca_system_score_gemma":0.00014464595,"threshold_uncertainty_score":0.9999937},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001247564,0.0004493297,0.99713796,0.00011485316,0.000528239,0.00016244718,0.000004493204,0.00009176355,0.00026336982],"genre_scores_gemma":[0.33747223,0.00022785812,0.6608306,0.0008937849,0.00044485176,0.0000060824973,0.000014620953,0.000029204108,0.00008074931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798024,0.000085665226,0.00030843783,0.00076058507,0.00047397433,0.00039108554],"domain_scores_gemma":[0.9988212,0.00024660566,0.0001998538,0.00040866103,0.00015819792,0.00016549381],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008999094,0.00028002064,0.0002803097,0.00038133137,0.00021678722,0.0003898834,0.00056589727,0.0002024958,0.000059852602],"category_scores_gemma":[0.000084515494,0.00025325778,0.00007770303,0.00036910857,0.0002690026,0.0009498397,0.0004899532,0.0003065151,0.000027650569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065342065,0.000020967263,0.000021194843,0.000015169978,0.0000060238485,0.000006546718,0.0005944767,0.09182449,0.00081451616,0.0008033579,9.817537e-7,0.90588576],"study_design_scores_gemma":[0.0001885043,0.000034844466,0.0000131582665,0.00024462224,0.000019343019,0.000024509061,5.3764444e-7,0.94562453,0.010194676,0.043199316,0.000074057185,0.00038193166],"about_ca_topic_score_codex":0.000004761208,"about_ca_topic_score_gemma":0.000004342964,"teacher_disagreement_score":0.9055038,"about_ca_system_score_codex":0.000104738465,"about_ca_system_score_gemma":0.00010701232,"threshold_uncertainty_score":0.99999195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034952353,0.00017803482,0.9883645,0.00048213298,0.0011321629,0.00040613208,0.000024310017,0.00026582042,0.0087973755],"genre_scores_gemma":[0.7243351,0.00003180809,0.2734774,0.0011153079,0.0004701966,0.000013362124,0.0000110144765,0.0000566681,0.0004891657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99541795,0.000069837886,0.0008449736,0.0015035573,0.0014446652,0.00071898644],"domain_scores_gemma":[0.9948463,0.0016615862,0.0005867859,0.0024550336,0.00022700586,0.0002232878],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010558809,0.0006630245,0.0009895861,0.0010468115,0.00020460752,0.00040955568,0.0055082017,0.00040423352,0.00003945038],"category_scores_gemma":[0.0001267763,0.00057037966,0.00021958843,0.00052224105,0.0009413055,0.00054558937,0.0015943185,0.00087095285,0.00018875844],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043529876,0.00005750911,0.00015378183,0.00005482936,0.000029609833,0.00003904708,0.0005377289,0.006130452,0.00015059595,0.04031809,0.0002701544,0.9522539],"study_design_scores_gemma":[0.0007028363,0.0008412137,0.0021010395,0.0014986485,0.000030801995,0.000037590882,3.602589e-7,0.7249614,0.007820567,0.25376254,0.0066754916,0.0015675484],"about_ca_topic_score_codex":0.000031103737,"about_ca_topic_score_gemma":0.000010276314,"teacher_disagreement_score":0.9506863,"about_ca_system_score_codex":0.00014428493,"about_ca_system_score_gemma":0.0004042191,"threshold_uncertainty_score":0.99987245},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39571163,0.001985326,0.5984001,0.000053148557,0.0027840745,0.00033465424,0.0000045710076,0.0001978486,0.0005286179],"genre_scores_gemma":[0.89919275,0.0004789407,0.10014034,0.000051071736,0.00007816528,0.0000022314475,0.0000040323594,0.000038454582,0.0000139908725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983393,0.000014930864,0.0005238614,0.00045406446,0.0002972884,0.00037058006],"domain_scores_gemma":[0.99913037,0.00023636116,0.00013599053,0.00035556714,0.00007197095,0.00006974279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001998084,0.0002692678,0.0005451999,0.00058676297,0.0000422921,0.000027185008,0.00034899518,0.00048751067,0.00013061627],"category_scores_gemma":[0.000050620947,0.00026374945,0.000058908903,0.00050901755,0.00061777345,0.00015151732,0.00012250758,0.0006693266,0.000009712938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019096715,0.0000089527475,0.00046167246,0.00007167509,0.000007002297,0.000017557346,0.00015062098,0.05085694,0.0014354377,0.0001274623,0.0000076053852,0.94685316],"study_design_scores_gemma":[0.00038203297,0.000088658366,0.0015401089,0.0026715356,0.000014840804,0.00017493151,0.0000033798074,0.9686659,0.017306063,0.006236156,0.0019621237,0.00095425657],"about_ca_topic_score_codex":0.000024218378,"about_ca_topic_score_gemma":0.000039607472,"teacher_disagreement_score":0.9458989,"about_ca_system_score_codex":0.00026626745,"about_ca_system_score_gemma":0.00014199449,"threshold_uncertainty_score":0.99998146},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076402334,0.00003481553,0.9942831,0.0013562997,0.0012172917,0.0007796075,0.00002176661,0.00030717108,0.0012359256],"genre_scores_gemma":[0.8964525,0.000030497538,0.10018964,0.0021643015,0.00076382054,0.00005474944,0.00015322097,0.000037291236,0.00015401107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664706,0.0000609768,0.0005424048,0.0013742839,0.0008163524,0.00055892323],"domain_scores_gemma":[0.9976657,0.00012843325,0.00028894586,0.0011917248,0.0003450729,0.00038013235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085751375,0.00044992083,0.00037128106,0.00076294603,0.00034474971,0.00048401687,0.0015128665,0.0003589003,0.00012820844],"category_scores_gemma":[0.000034993816,0.00044841677,0.00010833681,0.0005145055,0.00023617888,0.0014040521,0.0003271563,0.000640292,0.00029118275],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011090619,0.00009488771,0.00008956601,0.000028839913,0.000008316,0.0000052713604,0.0005222283,0.0012737785,0.0080977855,0.009210565,0.000026534255,0.9806311],"study_design_scores_gemma":[0.0005425571,0.00055196095,0.007574359,0.00015022168,0.000037598027,0.000114329974,0.000001101307,0.936515,0.011063084,0.034886003,0.007090015,0.0014737946],"about_ca_topic_score_codex":0.000034956938,"about_ca_topic_score_gemma":0.00017739247,"teacher_disagreement_score":0.9791573,"about_ca_system_score_codex":0.00041461043,"about_ca_system_score_gemma":0.00035191802,"threshold_uncertainty_score":0.99979675},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013887012,0.00048752144,0.99433994,0.000010015816,0.0013903372,0.0001682468,0.0000055249775,0.000514196,0.0029453735],"genre_scores_gemma":[0.9407438,0.0002135398,0.058389675,0.00024840282,0.00015235612,0.0000037641519,0.000020543095,0.000106070256,0.00012184943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986549,0.000005246186,0.00026769855,0.00043533914,0.00029136872,0.0003454533],"domain_scores_gemma":[0.9993259,0.000031228832,0.00006363714,0.0004432881,0.00008742517,0.000048530284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013178524,0.00032059613,0.00026376467,0.0005819546,0.000115070485,0.000081544254,0.0006077864,0.00044318312,0.00005299044],"category_scores_gemma":[0.000024945986,0.00031940758,0.00005624966,0.00034716973,0.00042564934,0.00017277336,0.0001477012,0.00044029666,0.000019937941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016688109,0.0000027699914,0.000030072448,0.00006143712,0.000008181747,0.0000170173,0.00036200174,0.8705955,0.0001224777,0.002622292,0.000011191433,0.12616538],"study_design_scores_gemma":[0.00008093365,0.000022399006,0.0000088439765,0.00018859151,0.0000091453985,0.000016477801,3.3842764e-7,0.94337094,0.0028969818,0.052190308,0.00083663483,0.00037840172],"about_ca_topic_score_codex":0.000008897424,"about_ca_topic_score_gemma":0.000040530103,"teacher_disagreement_score":0.9406049,"about_ca_system_score_codex":0.00033137112,"about_ca_system_score_gemma":0.00008651335,"threshold_uncertainty_score":0.9999258},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001163712,0.0009501404,0.99385434,0.00025454638,0.0014696156,0.000800424,0.000036404457,0.0007673232,0.0018660312],"genre_scores_gemma":[0.0019101817,0.00016751842,0.99600625,0.0006514839,0.00019320451,0.00010280435,0.000037959126,0.000050717666,0.00087985717],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99695843,0.000016674167,0.0004415184,0.0013800893,0.0005272561,0.0006760239],"domain_scores_gemma":[0.9970272,0.0009468534,0.0002517034,0.001211487,0.00040891606,0.00015384595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081156834,0.0005347538,0.00044891846,0.0005630445,0.00024066669,0.00056583923,0.002993503,0.00027382528,0.000013879402],"category_scores_gemma":[0.0003081076,0.0005074089,0.000121314806,0.0007823347,0.00021804226,0.00068583665,0.00089395593,0.00045461193,0.000022458093],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013277999,0.0001307029,0.00004821429,0.0011803084,0.000063348765,0.00014875326,0.0005136067,0.012749807,0.000006939952,0.045956813,0.0036623345,0.9355259],"study_design_scores_gemma":[0.0006321492,0.00063348346,0.000046074267,0.00085323426,0.00005718801,0.00017255908,2.8984272e-7,0.063766934,0.0024619212,0.26137555,0.66792345,0.0020771902],"about_ca_topic_score_codex":0.0000018722064,"about_ca_topic_score_gemma":0.0000078864505,"teacher_disagreement_score":0.93344873,"about_ca_system_score_codex":0.00024656733,"about_ca_system_score_gemma":0.00039174466,"threshold_uncertainty_score":0.99973774},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014366049,0.00004227608,0.99696845,0.0004092895,0.000688494,0.00054780004,0.000086654545,0.00022994404,0.0010127019],"genre_scores_gemma":[0.2486777,0.00010446204,0.73551905,0.012563232,0.0006334549,0.00006320111,0.00088229316,0.000071267554,0.0014853366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608666,0.000039662224,0.0010370883,0.0010139513,0.0011514941,0.00067112525],"domain_scores_gemma":[0.9960083,0.00051502266,0.0007986327,0.0014227079,0.0010169386,0.00023842069],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010858806,0.0005759641,0.00070961623,0.0025223172,0.0005358038,0.0014567882,0.0030825222,0.00033872842,0.000021948032],"category_scores_gemma":[0.00038574784,0.0005543181,0.00028708155,0.0028428582,0.0004697369,0.0029652512,0.0009971943,0.00040033937,0.000058108075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059214713,0.000022265465,0.00026737092,0.00007625363,0.000115157054,0.000004629308,0.0017879205,0.16550483,0.000011352758,0.43658996,0.00013882531,0.3954755],"study_design_scores_gemma":[0.000246068,0.00013484039,0.00006572655,0.00018063076,0.00008852209,0.000006634506,0.0000024093376,0.95389605,0.00024342786,0.016608944,0.027857104,0.0006696352],"about_ca_topic_score_codex":0.000044194992,"about_ca_topic_score_gemma":0.0002307896,"teacher_disagreement_score":0.78839123,"about_ca_system_score_codex":0.00035610315,"about_ca_system_score_gemma":0.0007234845,"threshold_uncertainty_score":0.99969083},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009424614,0.0008198135,0.9936815,0.0007460825,0.0020270278,0.00086790125,0.000027835798,0.00052775024,0.0012078768],"genre_scores_gemma":[0.13930406,0.00004815462,0.85815054,0.0015455298,0.0007009744,0.000026199856,0.000020184472,0.00007542357,0.00012896469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930039,0.00009961342,0.0011567262,0.002657968,0.001976644,0.0011051383],"domain_scores_gemma":[0.99527,0.00058878557,0.0005540035,0.0025993765,0.0006190836,0.00036873136],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018141719,0.0009599288,0.0011230508,0.0017606447,0.00020333244,0.00066590816,0.005875996,0.00052238826,0.000019918936],"category_scores_gemma":[0.00015164251,0.00083913445,0.00017101789,0.0010709676,0.0007399893,0.0010066874,0.003863383,0.0013545939,0.000060911527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020405547,0.000081639344,0.000022925604,0.000032524265,0.0000053007925,0.00019745744,0.0002482277,0.17710261,0.0002491751,0.0047181738,0.00024318152,0.81707835],"study_design_scores_gemma":[0.0008887909,0.00033540474,0.00014526726,0.0011676286,0.0000058062656,0.00008085874,1.9907806e-7,0.9255184,0.0008865738,0.06637188,0.003648486,0.0009507249],"about_ca_topic_score_codex":0.000055144526,"about_ca_topic_score_gemma":0.000069533955,"teacher_disagreement_score":0.81612766,"about_ca_system_score_codex":0.0008050947,"about_ca_system_score_gemma":0.0007940031,"threshold_uncertainty_score":0.9995027},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012830883,0.010460677,0.9826829,0.0034804805,0.0008444526,0.0004218281,0.000030892956,0.00006212222,0.0020038108],"genre_scores_gemma":[0.18484259,0.0010894892,0.81048715,0.0015149586,0.0014634293,0.000014304212,0.000058911028,0.000039785704,0.00048935023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966177,0.000025276022,0.00040758532,0.001805413,0.00048648438,0.0006575735],"domain_scores_gemma":[0.99592847,0.0009773471,0.0002423394,0.002592605,0.00010025167,0.00015899871],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009914747,0.00045698875,0.0005862643,0.0004782577,0.000410143,0.0010375942,0.006148957,0.00022595614,0.0000043415052],"category_scores_gemma":[0.00008648296,0.00029891962,0.0001520403,0.0006123102,0.00077197346,0.001569082,0.004010898,0.0003736782,0.0000030211281],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004548519,0.000016869702,0.00001113723,0.000024683788,0.000078648816,0.000009326136,0.0032770683,0.007410448,8.950305e-7,0.07147087,0.000075392105,0.9176201],"study_design_scores_gemma":[0.00057189673,0.00031129783,0.0003687785,0.00018169379,0.00014752508,0.00003646997,0.000003133408,0.7908146,0.00003193174,0.19808292,0.008659977,0.0007897924],"about_ca_topic_score_codex":0.000025304933,"about_ca_topic_score_gemma":0.0003747444,"teacher_disagreement_score":0.9168303,"about_ca_system_score_codex":0.00010210821,"about_ca_system_score_gemma":0.00076293445,"threshold_uncertainty_score":0.9999994},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000116862095,0.0005214867,0.99151987,0.000048386275,0.0008553483,0.00022318595,0.000008195511,0.00036517155,0.006341525],"genre_scores_gemma":[0.06460555,0.00003430487,0.93470067,0.00011528496,0.0003313758,0.0000069615235,0.000012115425,0.000067238,0.00012651112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805516,0.000007836789,0.00030498832,0.0006060512,0.00059403776,0.0004319264],"domain_scores_gemma":[0.99890494,0.00011657837,0.00008336316,0.00046106832,0.00024972035,0.00018430715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004382569,0.0004057182,0.00035943868,0.00034308442,0.00008611258,0.00019065538,0.00065022067,0.00024450687,0.0000468144],"category_scores_gemma":[0.000056840392,0.00035254195,0.000039922943,0.0003047492,0.0006540995,0.00018586614,0.00011391593,0.00065730733,0.000029955754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030979552,0.0000037766365,0.0000130543585,0.000034114644,0.000008731961,0.000021813306,0.00020630963,0.87774736,0.000013131342,0.0003299785,0.0000026243185,0.121616],"study_design_scores_gemma":[0.00024404466,0.00005062031,0.0000035721991,0.00044878563,0.000010295562,0.00008381044,5.7046594e-7,0.9936797,0.00054412644,0.0043700947,0.00008933437,0.00047507245],"about_ca_topic_score_codex":0.000002170803,"about_ca_topic_score_gemma":0.0000133693775,"teacher_disagreement_score":0.12114093,"about_ca_system_score_codex":0.00019077485,"about_ca_system_score_gemma":0.00027400203,"threshold_uncertainty_score":0.99989265},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018548765,0.00041280876,0.98978585,0.00036174373,0.00068875303,0.00075614813,0.000002535753,0.00021976784,0.005917527],"genre_scores_gemma":[0.35996428,0.000033478806,0.6394259,0.00033227453,0.00012947146,0.000055502976,0.000004092351,0.000021852473,0.000033186236],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996957,0.000110356465,0.00048087598,0.0013746509,0.00057615933,0.00050095445],"domain_scores_gemma":[0.9974966,0.00060595886,0.00028914044,0.0012357665,0.00025596732,0.000116532865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015527226,0.00048756337,0.0005538559,0.0009327548,0.00025136344,0.000549324,0.0029165798,0.00039115793,0.0000060530097],"category_scores_gemma":[0.0006024809,0.00042373163,0.00006472257,0.00051483465,0.00071729324,0.0011616652,0.0015354675,0.00086886826,0.000004554044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059883846,0.000034330766,0.0006084967,0.000040368886,0.0000060313837,0.000082018734,0.0031608895,0.00021203197,0.000092646784,0.20002042,0.0000044729345,0.7957323],"study_design_scores_gemma":[0.00042355605,0.00044176637,0.008732059,0.0010991726,0.000007081942,0.00016335408,0.0000027108235,0.15906748,0.0035714624,0.8257296,0.000072864124,0.00068888505],"about_ca_topic_score_codex":0.00039791033,"about_ca_topic_score_gemma":0.00075347355,"teacher_disagreement_score":0.7950434,"about_ca_system_score_codex":0.00024541444,"about_ca_system_score_gemma":0.00029328762,"threshold_uncertainty_score":0.9998214},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1561801,0.0009600755,0.8371603,0.000100493016,0.0009957942,0.0002607209,0.000018017034,0.000048350972,0.0042761452],"genre_scores_gemma":[0.96977925,0.000022536951,0.027271532,0.0007981194,0.0018178053,0.0000015710822,0.00005142842,0.000031004798,0.00022675739],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99801785,0.000016003627,0.000316593,0.0009308848,0.0002598257,0.00045882713],"domain_scores_gemma":[0.99930644,0.000046976867,0.00017418174,0.0003075249,0.0000939803,0.00007090947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028901125,0.0003735365,0.0003216719,0.00014264794,0.00019194004,0.00014869678,0.00062694354,0.0003984232,0.000009297565],"category_scores_gemma":[0.000047782065,0.00030962768,0.0001242449,0.00012196056,0.00048044728,0.000008872803,0.0005183284,0.0003077324,0.0000037226464],"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.000022261009,0.00002592345,0.000492505,0.000038739676,0.000017590986,0.0000394565,0.000052960495,0.0055242246,0.8615574,0.00020542773,0.000027294982,0.1319962],"study_design_scores_gemma":[0.0011251412,0.0017400695,0.0049354592,0.0012963173,0.000084914194,0.0004023055,0.0000012935316,0.08481629,0.8290419,0.023660798,0.048169658,0.004725836],"about_ca_topic_score_codex":0.000016559317,"about_ca_topic_score_gemma":0.000025614174,"teacher_disagreement_score":0.81359917,"about_ca_system_score_codex":0.000055440967,"about_ca_system_score_gemma":0.0001559058,"threshold_uncertainty_score":0.99993557},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016249616,0.004341544,0.8897983,0.014832858,0.009372501,0.0038473636,0.000023710678,0.00017459923,0.07598416],"genre_scores_gemma":[0.9611269,0.0017082583,0.0031368758,0.021315867,0.006223971,0.00017582986,0.000019491094,0.0002146881,0.0060781096],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935005,0.0005452659,0.0013788721,0.00079831807,0.0018397998,0.0019372996],"domain_scores_gemma":[0.989382,0.0079261465,0.0007900906,0.001302583,0.00027328415,0.00032587507],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009273727,0.00044861253,0.0008205794,0.0004212959,0.0006829544,0.000012062802,0.0019421559,0.0010022311,0.0019898347],"category_scores_gemma":[0.001229346,0.00028803103,0.00013664992,0.0004354859,0.00073311373,0.000090738205,0.00049842807,0.005377742,0.00035144069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011959451,0.00005995111,0.0009750117,0.00054525014,0.000039762916,0.000010347864,0.002057936,0.00027168723,0.000016461952,0.35177332,0.0009937491,0.6431369],"study_design_scores_gemma":[0.0021827915,0.0025006062,0.0013337763,0.016571535,0.00006866897,0.00010274724,0.0000065904496,0.046831522,0.00022180122,0.5962423,0.331828,0.0021096743],"about_ca_topic_score_codex":0.00023907016,"about_ca_topic_score_gemma":0.0018605026,"teacher_disagreement_score":0.9595019,"about_ca_system_score_codex":0.00186149,"about_ca_system_score_gemma":0.008597741,"threshold_uncertainty_score":0.9999572},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020634881,0.00014369344,0.99230003,0.0003408149,0.0007163159,0.00054059515,0.000009173351,0.0015620656,0.004366689],"genre_scores_gemma":[0.0021214092,0.00021639197,0.9940039,0.0007182081,0.0004214921,0.000026038704,0.000006201651,0.00008042531,0.0024059562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951505,0.00003742702,0.0006505926,0.0019992653,0.001204853,0.00095736113],"domain_scores_gemma":[0.99653167,0.00032043687,0.00021793612,0.002465949,0.00017582714,0.0002881948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006987027,0.00080762204,0.0007974121,0.0010781155,0.00020360868,0.00055163214,0.005270424,0.00051830965,0.00017151238],"category_scores_gemma":[0.00001822661,0.0006859305,0.00019444806,0.00080331095,0.0004951124,0.00068775483,0.0014613349,0.00094117,0.0002475765],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010859857,0.000028736147,0.0000061882565,0.000035327503,0.000012132019,0.00028264846,0.00039147367,0.027829863,0.00014104942,0.022795958,0.00013362244,0.94833213],"study_design_scores_gemma":[0.0002790631,0.0004262678,0.000037977155,0.00085757195,0.000011524733,0.000308922,1.0325082e-8,0.8421671,0.0016905685,0.09685688,0.05585265,0.0015114766],"about_ca_topic_score_codex":0.00004282542,"about_ca_topic_score_gemma":0.000021181344,"teacher_disagreement_score":0.9468207,"about_ca_system_score_codex":0.0004726586,"about_ca_system_score_gemma":0.00072721264,"threshold_uncertainty_score":0.99955916},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000121062854,0.0027847318,0.9889734,0.0008112069,0.0014546099,0.00024310908,0.000012798126,0.00039005483,0.0052090324],"genre_scores_gemma":[0.2284358,0.00036452356,0.765708,0.0027756512,0.0009573552,0.000017901672,0.00002060568,0.00009270794,0.001627423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619985,0.000046830017,0.00048071038,0.0015973513,0.0010332871,0.0006419628],"domain_scores_gemma":[0.9970131,0.0006701625,0.0002801284,0.0015511657,0.00020798897,0.00027746632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012849558,0.0005575539,0.00058860827,0.00063852634,0.00023525897,0.00078594073,0.0032451292,0.00029952038,0.00002139668],"category_scores_gemma":[0.000096736076,0.000473096,0.00008099952,0.0005384469,0.00096574257,0.0008700589,0.0017599727,0.00060070574,0.000056322115],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006230475,0.000044561264,0.000026875681,0.000043631724,0.000011800054,0.00013958348,0.000755127,0.00077399676,0.000023908256,0.13846608,0.00015627212,0.8595519],"study_design_scores_gemma":[0.0002460951,0.00018593713,0.000035007924,0.00026289356,0.0000053236095,0.000067396715,1.9401497e-7,0.5373775,0.000110163004,0.45415244,0.0070383023,0.00051878963],"about_ca_topic_score_codex":0.000018392595,"about_ca_topic_score_gemma":0.000041711137,"teacher_disagreement_score":0.85903317,"about_ca_system_score_codex":0.00017634171,"about_ca_system_score_gemma":0.000477127,"threshold_uncertainty_score":0.9997721},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018901566,0.0002492136,0.99226785,0.0010065936,0.0032011434,0.0011838884,0.000012194544,0.00032319414,0.0015669318],"genre_scores_gemma":[0.68067104,0.000012321717,0.31511778,0.0014197158,0.000956279,0.00010117206,0.000037585203,0.00006881832,0.0016153231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959543,0.000049421145,0.000671604,0.0016937656,0.0009370304,0.00069388805],"domain_scores_gemma":[0.99653155,0.00095384836,0.00049558486,0.0013136734,0.00051876,0.0001866028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094866805,0.0005608053,0.00067206565,0.0009903366,0.00032095966,0.0008993162,0.002298313,0.00034088187,0.000051480853],"category_scores_gemma":[0.00014761636,0.00055495644,0.00020414412,0.00058521656,0.0002156955,0.0014286597,0.0008433351,0.00055913907,0.00016352894],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000408801,0.00001997157,0.000053654167,0.000057904414,0.000014590401,0.0000117178015,0.00042812046,0.0017278449,0.00023016603,0.0037726695,0.000104132945,0.99357516],"study_design_scores_gemma":[0.0008916083,0.0002094658,0.0011766908,0.0009429912,0.000018299224,0.00012930323,4.4170844e-7,0.83981425,0.0016197097,0.14552422,0.008176606,0.0014964167],"about_ca_topic_score_codex":0.00018171627,"about_ca_topic_score_gemma":0.0002231327,"teacher_disagreement_score":0.9920787,"about_ca_system_score_codex":0.00043650385,"about_ca_system_score_gemma":0.0002998787,"threshold_uncertainty_score":0.9996902},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00388569,0.003894036,0.9890885,0.000040573304,0.0006295982,0.00014910495,0.000007070087,0.00008102501,0.0022244325],"genre_scores_gemma":[0.99007124,0.00014940088,0.009074457,0.00005756865,0.00041002705,0.0000024689225,0.000007539845,0.00003716508,0.00019014845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832803,0.000018496648,0.0003112634,0.0003385816,0.0006138806,0.0003897204],"domain_scores_gemma":[0.9988651,0.00042460058,0.00013303623,0.0004132072,0.00009898961,0.00006504389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066608127,0.0003068485,0.00034685226,0.00021558098,0.00014154066,0.00013617949,0.0007210317,0.00016172531,0.0000802126],"category_scores_gemma":[0.00014429286,0.00022567732,0.000109559114,0.0002143225,0.00030988702,0.00019719156,0.00013244519,0.0006956838,0.000012686531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019387219,0.000007081211,0.00031505225,0.00011267862,0.000048329344,0.0000025744503,0.0007675928,0.25780094,0.04430976,0.00006170827,0.000036881305,0.69653547],"study_design_scores_gemma":[0.00039100653,0.0000879951,0.00036652375,0.00060566934,0.00020154747,0.000032290416,0.0000029376022,0.9063257,0.08262009,0.0020338222,0.0059587206,0.0013737066],"about_ca_topic_score_codex":0.00003498911,"about_ca_topic_score_gemma":0.000034956392,"teacher_disagreement_score":0.98618555,"about_ca_system_score_codex":0.000112275295,"about_ca_system_score_gemma":0.00005257132,"threshold_uncertainty_score":0.92028534},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025408854,0.0028880208,0.99300957,0.002362065,0.00073986244,0.00028842883,0.0000030573997,0.00020824607,0.00047531596],"genre_scores_gemma":[0.019813506,0.0005468998,0.97418433,0.0050140787,0.00024580982,0.000008850445,0.000022663393,0.000028075116,0.00013579185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741185,0.00005560104,0.0004542289,0.001183423,0.0005756396,0.00031923113],"domain_scores_gemma":[0.997984,0.000510489,0.00031325757,0.00095852435,0.00010209364,0.00013165238],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004674494,0.00034950452,0.00041136937,0.00033466678,0.00020350871,0.00046935084,0.0012676526,0.00014283093,0.000018187613],"category_scores_gemma":[0.00013299363,0.00031374718,0.000050798317,0.0002939453,0.0003385941,0.0007774946,0.00037463603,0.00038625536,0.00001662722],"study_design_candidate":"design_other","study_design_consensus":null,"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.912574e-7,0.000008650247,0.000013937812,0.000058597667,0.0000033805254,0.0000061139526,0.00022958101,0.00080310355,0.00025391104,0.0047627618,0.00006228794,0.9937967],"study_design_scores_gemma":[0.00013093931,0.00006460145,0.00012235028,0.0014543796,0.0000061784144,0.00002248563,8.634062e-8,0.8968309,0.00036655553,0.098655954,0.001963765,0.0003817881],"about_ca_topic_score_codex":0.000017698072,"about_ca_topic_score_gemma":0.000029120185,"teacher_disagreement_score":0.9934149,"about_ca_system_score_codex":0.00011265506,"about_ca_system_score_gemma":0.00012870075,"threshold_uncertainty_score":0.99993145},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045625482,0.0012786224,0.99535424,0.00041764876,0.0014593925,0.0007411087,0.000008544735,0.0005426056,0.00015219835],"genre_scores_gemma":[0.011382084,0.00007616714,0.9868029,0.000622818,0.00056877144,0.000035431425,0.000006765989,0.00005611257,0.0004489476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954205,0.00001192869,0.0004939532,0.0018526803,0.0012609267,0.000960012],"domain_scores_gemma":[0.9922994,0.0049319,0.00016802107,0.0016177474,0.0007357392,0.00024724234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010129906,0.0005729861,0.0005656509,0.001174355,0.00027537046,0.00075083564,0.00495182,0.0003818854,0.000008416226],"category_scores_gemma":[0.0032021163,0.0005263317,0.00014847213,0.0011554885,0.00032218694,0.0006911458,0.0009922024,0.0007302663,0.000028584878],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008582778,0.000018628609,0.00011760871,0.000096352924,0.000005285618,0.000031378673,0.00013850606,0.030362848,0.000006903913,0.0014963417,0.000083762454,0.9676338],"study_design_scores_gemma":[0.0010212233,0.001039841,0.0013827793,0.002115649,0.000015308578,0.00017967905,6.354845e-8,0.21710789,0.001627915,0.7505505,0.022779228,0.00217991],"about_ca_topic_score_codex":0.0000034698128,"about_ca_topic_score_gemma":0.000026818307,"teacher_disagreement_score":0.96545386,"about_ca_system_score_codex":0.0003560921,"about_ca_system_score_gemma":0.0012881551,"threshold_uncertainty_score":0.99971884},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022907248,0.000102286285,0.9648559,0.00003224027,0.00039132178,0.00017023293,0.000005558492,0.00021659803,0.033996783],"genre_scores_gemma":[0.9586101,0.00009552027,0.03854866,0.0006309097,0.0007027159,0.0000107576325,0.000023616589,0.00011283555,0.0012648791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893415,0.000004858759,0.0001706165,0.00036545278,0.00029060774,0.00023434374],"domain_scores_gemma":[0.99943596,0.000049880633,0.0000415644,0.00035321552,0.00004667163,0.000072707364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013169264,0.00026720075,0.00020635343,0.0003319072,0.00005707361,0.000077809025,0.00038425621,0.00013015007,0.00018128891],"category_scores_gemma":[0.0000070760866,0.00021806656,0.000036987927,0.00012531913,0.00015271235,0.000116083516,0.000044585195,0.00039069724,0.0001354147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000800438,0.000014744849,0.000031290903,0.00016552057,0.000019389005,0.0000392419,0.0011316548,0.31288937,0.00005813907,0.015149717,0.00016623455,0.6703267],"study_design_scores_gemma":[0.0010930093,0.001429553,0.0019093949,0.0041243862,0.000047090954,0.000118618875,4.0329994e-7,0.8685063,0.003081299,0.07172364,0.045077592,0.0028886758],"about_ca_topic_score_codex":0.0000021057997,"about_ca_topic_score_gemma":0.000022624172,"teacher_disagreement_score":0.95838106,"about_ca_system_score_codex":0.00010390327,"about_ca_system_score_gemma":0.000039021037,"threshold_uncertainty_score":0.8892496},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003029639,0.00023945776,0.9970106,0.00032921127,0.00049396214,0.0003494842,0.000019945319,0.00011649296,0.0011378768],"genre_scores_gemma":[0.45516652,0.000036404806,0.54425234,0.00030987727,0.0001402963,0.000008250038,0.000051337614,0.000020704154,0.000014293967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971362,0.000046524,0.00049027515,0.0010863453,0.0008711825,0.0003694762],"domain_scores_gemma":[0.9974763,0.00034051383,0.0004514021,0.0013805603,0.00022720727,0.0001240278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006725121,0.00036355824,0.00043889132,0.0007622748,0.00023333645,0.0002806953,0.0019926555,0.00021451875,0.000011322065],"category_scores_gemma":[0.00003688516,0.000328482,0.00009448027,0.0009630872,0.0007040422,0.0006940963,0.0002966559,0.0004707889,0.000008874774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015750556,0.000062262865,0.00007675479,0.00009566703,0.000019266372,0.000010984407,0.0011170056,0.12217353,0.00019864233,0.33219796,0.000053011645,0.54397917],"study_design_scores_gemma":[0.0004511389,0.00041237296,0.00108233,0.000392809,0.000019939307,0.000043742177,4.520411e-7,0.87945515,0.0014312519,0.111357525,0.0046847104,0.0006685953],"about_ca_topic_score_codex":0.000028748245,"about_ca_topic_score_gemma":0.00007709477,"teacher_disagreement_score":0.7572816,"about_ca_system_score_codex":0.000108618515,"about_ca_system_score_gemma":0.00040249602,"threshold_uncertainty_score":0.99991673},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027926753,0.00024898493,0.9882372,0.000465508,0.00061706256,0.0009381613,0.00002084418,0.0001712639,0.00927302],"genre_scores_gemma":[0.11765595,0.00008114097,0.878044,0.0019716518,0.0004905968,0.00012637852,0.000012429811,0.000077356555,0.0015404776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961339,0.00002605141,0.0005709377,0.001628077,0.0007152035,0.0009258246],"domain_scores_gemma":[0.9965029,0.0007088551,0.00038887787,0.0017473925,0.00032672877,0.00032524284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010242973,0.00056894455,0.00058472966,0.00060596265,0.00049962325,0.0008325426,0.0035720207,0.0003551327,0.000027160071],"category_scores_gemma":[0.00015976174,0.0005166526,0.00019208524,0.00064470025,0.00047192696,0.0010165249,0.0008995376,0.0006261724,0.00009995985],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029782106,0.00009561121,0.000018791925,0.00011306349,0.00003177412,0.000017851822,0.0016700703,0.00685471,0.0015596298,0.096124806,0.00027434813,0.8932096],"study_design_scores_gemma":[0.0008802549,0.001009675,0.00019383502,0.0011099608,0.00004269719,0.00014650762,8.622507e-7,0.5127231,0.015029101,0.42241082,0.044403467,0.0020497327],"about_ca_topic_score_codex":0.00011035373,"about_ca_topic_score_gemma":0.000085117994,"teacher_disagreement_score":0.89115983,"about_ca_system_score_codex":0.00031003746,"about_ca_system_score_gemma":0.00074595364,"threshold_uncertainty_score":0.9997285},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007395003,0.00016961888,0.9940715,0.000060571827,0.0006110007,0.0006410807,0.000014260349,0.00026952458,0.004088484],"genre_scores_gemma":[0.6972799,0.00005151869,0.302192,0.00015269268,0.0001627718,0.000031103795,0.00000541126,0.000024510808,0.00010013113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968335,0.000043191834,0.0005433963,0.00087286654,0.0012355578,0.0004715041],"domain_scores_gemma":[0.9972053,0.00020572859,0.0006950626,0.0011948184,0.00056763465,0.00013143352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009233496,0.00045615874,0.00051109283,0.0008401164,0.0001638374,0.00021197414,0.0017885616,0.00023153459,0.000004353789],"category_scores_gemma":[0.000076941826,0.00034772788,0.00007670519,0.00048141283,0.0005055684,0.0008935624,0.00062896975,0.0007125113,0.0000059161252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005797963,0.000043301286,0.00002428778,0.000064219035,0.000018375598,0.000017936887,0.0024308115,0.39958155,0.000027273998,0.24862012,0.000037244536,0.3490769],"study_design_scores_gemma":[0.0005739323,0.00305764,0.000027362423,0.0011295929,0.00001622009,0.00009939835,0.0000035971734,0.7059929,0.007284002,0.2778228,0.00301929,0.0009733139],"about_ca_topic_score_codex":0.00023265812,"about_ca_topic_score_gemma":0.00015038422,"teacher_disagreement_score":0.6972059,"about_ca_system_score_codex":0.0004724089,"about_ca_system_score_gemma":0.00035675475,"threshold_uncertainty_score":0.9998975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023373063,0.00023193791,0.9853264,0.0017911558,0.0014912538,0.00037737013,0.000007286927,0.00024380593,0.010507402],"genre_scores_gemma":[0.12600385,0.0001409267,0.86723775,0.0025742955,0.0003753696,0.000029913057,0.00004058079,0.000054901368,0.0035424135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701786,0.000033930355,0.000497107,0.0012048272,0.0007505314,0.0004957385],"domain_scores_gemma":[0.9976428,0.0004747404,0.00040339486,0.0009314401,0.00036077708,0.00018682533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032522844,0.00041699343,0.00035037365,0.00070017023,0.00040551124,0.00086509215,0.0018317736,0.00031214443,0.00033916967],"category_scores_gemma":[0.00011116958,0.0003953278,0.0000980548,0.00063827715,0.00049773284,0.0012631869,0.0006338972,0.00067967304,0.00019778307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012618198,0.000020081452,0.0000668907,0.000015263171,0.000012867953,0.000018456953,0.00058530364,0.011722707,0.00022465707,0.053918734,0.00064625667,0.9327675],"study_design_scores_gemma":[0.00022381093,0.000056339268,0.00011525905,0.00019326601,0.000006868186,0.000035333418,2.107968e-7,0.93343943,0.00065056497,0.06182815,0.0028201046,0.00063063536],"about_ca_topic_score_codex":0.00004103532,"about_ca_topic_score_gemma":0.00006268092,"teacher_disagreement_score":0.9321369,"about_ca_system_score_codex":0.00030631962,"about_ca_system_score_gemma":0.00046395467,"threshold_uncertainty_score":0.99984986},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003686923,0.00046829958,0.9847944,0.0005303556,0.00075907074,0.0004417048,0.0000032451412,0.00021346702,0.012752608],"genre_scores_gemma":[0.24642634,0.00006394096,0.7496155,0.0019771215,0.00066462596,0.000047772413,0.000006433243,0.00007695305,0.0011213231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99556124,0.00006211204,0.0004171975,0.0014761563,0.0013766531,0.0011066407],"domain_scores_gemma":[0.99671984,0.0008371299,0.00021722278,0.0017162694,0.00021471082,0.00029483682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001419844,0.0004935565,0.0004238979,0.0010494599,0.00038635632,0.00048220684,0.0036670163,0.0002532414,0.00006458737],"category_scores_gemma":[0.000117349766,0.00044366202,0.00012692608,0.00080580445,0.00085940753,0.0009580296,0.0015359548,0.0012315619,0.00029128525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063562075,0.000028548608,0.00002245629,0.000020741038,0.000005911748,0.000041081927,0.00035418573,0.02145863,0.00007647662,0.5023957,0.000016405365,0.47557348],"study_design_scores_gemma":[0.00018278763,0.00021342203,0.000036822315,0.00039047617,0.0000029972082,0.00004954179,5.5321774e-8,0.06721306,0.00096798316,0.9285161,0.001878082,0.0005486605],"about_ca_topic_score_codex":0.00000462815,"about_ca_topic_score_gemma":0.000017127022,"teacher_disagreement_score":0.47502482,"about_ca_system_score_codex":0.0003296505,"about_ca_system_score_gemma":0.00035127788,"threshold_uncertainty_score":0.9998015},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09101343,0.00027307554,0.9071308,0.00017664407,0.00060701463,0.0004361362,0.00001868277,0.000040239436,0.0003040066],"genre_scores_gemma":[0.9672128,0.0000044452286,0.030890865,0.0013750856,0.00037590356,0.0000044596263,0.0000066502193,0.000045773548,0.00008403551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964364,0.000078289035,0.00056724774,0.0013551313,0.0010278972,0.0005350022],"domain_scores_gemma":[0.99711555,0.0011920654,0.0006225653,0.00056152337,0.00035005232,0.0001582216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004329556,0.0004884047,0.0005603089,0.00040778596,0.00026348498,0.00050494616,0.0012972141,0.00024099846,0.0000124291555],"category_scores_gemma":[0.00020521352,0.00040342665,0.00006784916,0.00048463576,0.0013798474,0.0005684605,0.00040664498,0.0006261183,0.0000028255406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006927885,0.00006843594,0.00037570347,0.00011688001,0.000014475208,0.000106999374,0.0017972686,0.7632681,0.15063712,0.000100524434,0.000016864702,0.08342835],"study_design_scores_gemma":[0.00040950163,0.00023993189,0.00014231881,0.0013990583,0.00002031448,0.00003814945,0.00000184075,0.92809963,0.06387109,0.005310591,0.000023231523,0.00044433126],"about_ca_topic_score_codex":0.000050868683,"about_ca_topic_score_gemma":0.00009049927,"teacher_disagreement_score":0.8762399,"about_ca_system_score_codex":0.00018980908,"about_ca_system_score_gemma":0.0004924027,"threshold_uncertainty_score":0.99984175},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062665215,0.000063352556,0.9905029,0.0011748872,0.0007881622,0.0003701212,0.0000015686308,0.00005089554,0.006421492],"genre_scores_gemma":[0.9842773,0.00003026653,0.012422249,0.0031043172,0.00008568091,0.00001411297,0.0000038972235,0.000015668109,0.00004650686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997708,0.000045066423,0.0006144035,0.00051072135,0.0007656617,0.00035615324],"domain_scores_gemma":[0.99791265,0.00041335306,0.00040636654,0.001031813,0.00016892703,0.00006690579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010397768,0.0003048793,0.00033683542,0.0009683248,0.00012499809,0.00022192422,0.0024364474,0.00018137187,0.000027584323],"category_scores_gemma":[0.000076174394,0.0002077669,0.000115335795,0.0008289195,0.00032183516,0.0003728063,0.0004201674,0.0004652948,0.000035281148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004341801,0.00001694294,0.000033051467,0.000026563075,0.0000030555423,0.000002268835,0.0008999482,0.010384459,0.00003119384,0.9139144,0.000072271505,0.074611515],"study_design_scores_gemma":[0.00017358645,0.0001932508,0.00015230726,0.0003723101,0.0000019556574,0.0000067901005,3.6281367e-7,0.6818279,0.0016810313,0.31350696,0.0018068749,0.00027667388],"about_ca_topic_score_codex":0.000009850029,"about_ca_topic_score_gemma":0.00004425551,"teacher_disagreement_score":0.9836506,"about_ca_system_score_codex":0.0000829541,"about_ca_system_score_gemma":0.00016508583,"threshold_uncertainty_score":0.84724885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000067499685,0.001116641,0.9557794,0.00022057566,0.00077244604,0.0003296174,0.000008495035,0.00023712442,0.04146824],"genre_scores_gemma":[0.29841498,0.00030837144,0.6957738,0.0021290346,0.001109315,0.000026721253,0.000052218726,0.00009766846,0.002087921],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99571264,0.000042850865,0.00042081063,0.0020467776,0.00090306485,0.00087384775],"domain_scores_gemma":[0.9971967,0.00041786535,0.0002644931,0.0016797695,0.00020168164,0.00023953877],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006059849,0.00069648004,0.0006293017,0.00071277877,0.00043351142,0.00090067234,0.0044152895,0.00030436995,0.0000910333],"category_scores_gemma":[0.00004854247,0.000519516,0.00010689472,0.00075910613,0.0010371152,0.0011832754,0.0012364065,0.00089617417,0.00020568773],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018596305,0.00005374732,0.00014556546,0.000027946186,0.00003760864,0.0004586422,0.0019492944,0.005975089,0.000046996844,0.15712498,0.000090262394,0.8340713],"study_design_scores_gemma":[0.0010401745,0.0010373536,0.0005251901,0.0013103811,0.0000473272,0.0009055633,7.6094676e-7,0.32176477,0.0031146903,0.6377976,0.029451024,0.0030051682],"about_ca_topic_score_codex":0.000020368798,"about_ca_topic_score_gemma":0.00015094357,"teacher_disagreement_score":0.8310661,"about_ca_system_score_codex":0.0002488041,"about_ca_system_score_gemma":0.0006476381,"threshold_uncertainty_score":0.99972564},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.159826e-7,0.0003445683,0.9924412,0.0021992947,0.00326746,0.00076880807,0.000014335661,0.00022154427,0.0007418998],"genre_scores_gemma":[0.007636459,0.00002413759,0.988646,0.0019296815,0.00137656,0.000080507656,0.0000029786922,0.00004222356,0.00026149978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958757,0.000047662652,0.00055095414,0.0016379474,0.0010105185,0.0008771952],"domain_scores_gemma":[0.9950906,0.0024978647,0.00020661706,0.0015870238,0.0004405459,0.00017737139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014559461,0.0005712467,0.00050916057,0.0005689249,0.0009637206,0.0009808252,0.0043935725,0.00033016174,0.000012407572],"category_scores_gemma":[0.00016534694,0.00043398794,0.00028727233,0.00064158085,0.0015078764,0.00040672402,0.001364413,0.0009909809,0.000027694936],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002578425,0.000016937065,0.0000010567617,0.000033035718,0.000010701323,0.0000084355115,0.00023016798,0.003371144,0.000023128789,0.043849207,0.000018996732,0.9524346],"study_design_scores_gemma":[0.00018089,0.00019365744,0.0000139441645,0.00014495346,0.000012679134,0.00009097251,1.5300597e-7,0.7055895,0.00037068402,0.28728372,0.0057047065,0.0004141504],"about_ca_topic_score_codex":0.000036261074,"about_ca_topic_score_gemma":0.00013060232,"teacher_disagreement_score":0.95202047,"about_ca_system_score_codex":0.00018853067,"about_ca_system_score_gemma":0.00027661756,"threshold_uncertainty_score":0.9998112},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000103796265,0.00016406558,0.99402356,0.000787469,0.00033656246,0.00076439255,0.000006364103,0.00013392806,0.0036798448],"genre_scores_gemma":[0.7786283,0.000023673101,0.22021528,0.0006513842,0.00018804215,0.000026622103,0.000026681511,0.00007904819,0.00016097551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838907,0.000022261363,0.00029672976,0.00044936218,0.00049960817,0.0003429526],"domain_scores_gemma":[0.99904186,0.00023173468,0.000058328413,0.00036262508,0.00015802284,0.00014745364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008639441,0.0002950421,0.00025591283,0.00027263802,0.00015705485,0.00035892372,0.0004219927,0.0001440388,0.000020668824],"category_scores_gemma":[0.000036486792,0.00021891843,0.000033607514,0.0002738227,0.00043879077,0.000121495854,0.00012284049,0.0005325741,0.00001861376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002907166,0.0000030328226,0.000011430483,0.000079211015,0.000005813172,0.0000033449255,0.0012395843,0.942834,0.000082608225,0.0019542468,0.000025791305,0.05375802],"study_design_scores_gemma":[0.00019737174,0.000115064955,0.00000993463,0.00047527128,0.0000072022817,0.000011711955,0.0000012429964,0.9914337,0.0004922964,0.0063896687,0.00055149326,0.00031509],"about_ca_topic_score_codex":0.000009484358,"about_ca_topic_score_gemma":0.000051252253,"teacher_disagreement_score":0.7785245,"about_ca_system_score_codex":0.0001502745,"about_ca_system_score_gemma":0.0002498681,"threshold_uncertainty_score":0.89272344},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006258926,0.00007732754,0.99665695,0.0002197119,0.00036065822,0.0005535899,0.00013338774,0.00010277772,0.0012696828],"genre_scores_gemma":[0.016801314,0.000033319793,0.98213875,0.00022303835,0.0003463596,0.000012752637,0.00023144223,0.000048919184,0.00016410914],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963024,0.00018646561,0.0013983441,0.0013231784,0.00048333048,0.00030625207],"domain_scores_gemma":[0.9928097,0.0030247495,0.0010432146,0.0026073516,0.0003613767,0.00015358704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023419615,0.0003779882,0.00077887916,0.0003927118,0.00017651482,0.00006831476,0.002096482,0.0004754313,0.00020988977],"category_scores_gemma":[0.00045879488,0.0003333449,0.00017720055,0.00023956387,0.00072653446,0.00024578464,0.0007272052,0.0005883459,0.000054770608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007700054,0.00049665483,0.00021938572,0.0001438296,0.00005826782,0.000006076967,0.00046998443,0.00019266496,0.26065385,0.015724597,0.00062918535,0.7213285],"study_design_scores_gemma":[0.00052471313,0.00014978928,0.0012886272,0.0005398515,0.00011757662,0.000057098612,3.1800525e-7,0.11744064,0.05901873,0.8169269,0.003158752,0.000777033],"about_ca_topic_score_codex":0.00001073223,"about_ca_topic_score_gemma":0.0000078681605,"teacher_disagreement_score":0.8012023,"about_ca_system_score_codex":0.00007506757,"about_ca_system_score_gemma":0.00018141394,"threshold_uncertainty_score":0.99991184},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5372898,0.0015327606,0.4590413,0.000043852993,0.00012419162,0.0016252532,0.000023881967,0.000064079795,0.00025491713],"genre_scores_gemma":[0.9696047,0.000029496518,0.029769277,0.000046641228,0.00020270683,0.000047899604,0.0000036203658,0.00005449791,0.00024117481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829006,0.00003715646,0.0003414209,0.0007640203,0.000238009,0.000329339],"domain_scores_gemma":[0.9992465,0.00008372719,0.00014369361,0.0004072664,0.000042881802,0.00007596408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020974697,0.0003906739,0.0004951377,0.0005816931,0.00007064244,0.00009214233,0.00029445405,0.0000799192,0.000026826669],"category_scores_gemma":[0.0000036162596,0.00035109237,0.00004346052,0.0002471704,0.00017132284,0.0002848329,0.000089650646,0.00040788364,2.6235168e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027009772,0.000704728,0.24822982,0.00006921173,0.00012947262,0.00032607865,0.027436648,0.14225538,0.0055695763,0.0003304435,0.000004871555,0.57467365],"study_design_scores_gemma":[0.027362542,0.0032730321,0.073935844,0.0017417184,0.00007659629,0.000112212416,0.000040550363,0.85038507,0.014477562,0.021620002,0.0013366361,0.0056382134],"about_ca_topic_score_codex":0.0005471537,"about_ca_topic_score_gemma":0.00066367525,"teacher_disagreement_score":0.7081297,"about_ca_system_score_codex":0.0007872137,"about_ca_system_score_gemma":0.00021414006,"threshold_uncertainty_score":0.9998941},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002459324,0.0006789394,0.9902969,0.0037873075,0.00219953,0.0010293118,0.000059123005,0.0013253737,0.00037757648],"genre_scores_gemma":[0.2808291,0.000007911458,0.7172641,0.0013100641,0.00030190585,0.000063181455,0.00003156682,0.00007055852,0.00012160453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929035,0.000042618107,0.0007946534,0.0026668885,0.00202675,0.0015656269],"domain_scores_gemma":[0.9949068,0.00049804687,0.00051425636,0.0028729194,0.00082507863,0.00038292524],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011023523,0.0010149758,0.0010512123,0.0016403155,0.00043717743,0.0032002763,0.008631871,0.0006017196,0.0000071360237],"category_scores_gemma":[0.00028394657,0.0008427739,0.00014330636,0.0024141278,0.001168978,0.0012962759,0.0022662173,0.0013109522,0.000027539849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021462105,0.00006286162,0.00021232935,0.00011108701,0.00004245673,0.00048165204,0.00013403015,0.7251605,0.00032937923,0.13827999,0.00026452247,0.13489977],"study_design_scores_gemma":[0.0022209517,0.0013874074,0.0003329563,0.006706687,0.000054947435,0.00039583197,0.0000022849563,0.8580972,0.008540236,0.106521994,0.011572246,0.0041672327],"about_ca_topic_score_codex":0.00022196006,"about_ca_topic_score_gemma":0.00021622893,"teacher_disagreement_score":0.28058317,"about_ca_system_score_codex":0.0012910314,"about_ca_system_score_gemma":0.0015003381,"threshold_uncertainty_score":0.9994023},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011884288,0.00016292257,0.9777729,0.0005804194,0.0016781455,0.011966241,0.000002330202,0.00031728827,0.007507895],"genre_scores_gemma":[0.061061107,0.000015691498,0.9239325,0.0031704537,0.0032536907,0.0074379058,0.0000064661986,0.000096919866,0.0010252664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957204,0.00006525838,0.000699611,0.0014963316,0.0011408606,0.00087754935],"domain_scores_gemma":[0.9964532,0.00066671317,0.0003836515,0.0019481919,0.0003087094,0.00023953097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016063538,0.0005611326,0.0005007076,0.0006949844,0.00047128007,0.0007617894,0.0042578597,0.0003722594,0.00009052584],"category_scores_gemma":[0.00013010952,0.00052421784,0.00015182998,0.00060734135,0.0008862287,0.0010519465,0.0016436409,0.0010649373,0.00013702568],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051256507,0.000053243828,0.00010067427,0.00012064896,0.000008804348,0.0000151826225,0.0017459627,0.005598634,0.00004495582,0.1699501,0.00006454589,0.82229215],"study_design_scores_gemma":[0.0005949247,0.0002285968,0.00024750808,0.00071388687,0.000008826175,0.0001671409,5.708724e-7,0.47797984,0.0037889446,0.4447698,0.069736406,0.001763539],"about_ca_topic_score_codex":0.000025841488,"about_ca_topic_score_gemma":0.000019078368,"teacher_disagreement_score":0.82052857,"about_ca_system_score_codex":0.0003941232,"about_ca_system_score_gemma":0.00066801,"threshold_uncertainty_score":0.99972093},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017487947,0.0010483175,0.988619,0.001511624,0.0010919916,0.00022555859,0.000011397784,0.00021283451,0.0071043596],"genre_scores_gemma":[0.12712857,0.00006276226,0.8513889,0.013901554,0.0022760706,0.000008759892,0.00006322147,0.000108054264,0.0050621494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955239,0.000029002907,0.00053232466,0.0017523487,0.0012710205,0.0008913989],"domain_scores_gemma":[0.9979213,0.00025469114,0.00023587667,0.0011817951,0.00022900345,0.00017734636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071700674,0.0005448477,0.0005226635,0.0006787146,0.0003889035,0.00086239824,0.0037717249,0.00031398475,0.00003720032],"category_scores_gemma":[0.00003337321,0.0005028633,0.00012058296,0.000821111,0.0007120197,0.00069601333,0.0016282672,0.0010698523,0.000042896645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014056245,0.000056540845,0.000021407672,0.00006422755,0.0000065748595,0.00008283411,0.00040112933,0.017262874,0.00061280106,0.0025861287,0.0020474324,0.97685665],"study_design_scores_gemma":[0.00044110682,0.0001450525,0.00011295269,0.0010734969,0.000009795212,0.00011036366,2.4573578e-7,0.9047668,0.0033742115,0.06431365,0.024134729,0.0015175665],"about_ca_topic_score_codex":0.0000614764,"about_ca_topic_score_gemma":0.000047028116,"teacher_disagreement_score":0.97533906,"about_ca_system_score_codex":0.00027070526,"about_ca_system_score_gemma":0.0006594405,"threshold_uncertainty_score":0.99974227},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017290915,0.0006266146,0.99335575,0.0026636699,0.00020535884,0.000543062,0.0000040441832,0.0000046522773,0.0008677445],"genre_scores_gemma":[0.8602671,0.00009710283,0.13744257,0.0008695035,0.00107173,0.000059003363,0.0000371527,0.00002413422,0.000131717],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843335,0.00011934419,0.00031731869,0.00058899156,0.00034520304,0.00019576547],"domain_scores_gemma":[0.99880147,0.000104267674,0.00018660033,0.0007647706,0.00009568011,0.000047231035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014615434,0.00018055996,0.00018287533,0.00022748297,0.000095121024,0.000040120678,0.0009486501,0.00021734824,0.0000055153178],"category_scores_gemma":[0.000047660626,0.00011332178,0.00006667271,0.000420978,0.00029506724,0.0000052373803,0.0001464445,0.00024711093,0.000004271183],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006529454,0.000058952097,0.000028932585,0.000019251576,0.000006917403,5.5592045e-7,0.0011445143,0.008292313,0.6495371,0.0026974946,0.00016976931,0.33797893],"study_design_scores_gemma":[0.0028774329,0.00052749016,0.0051504327,0.0005492503,0.00006613569,0.00009791903,0.000062452986,0.2982825,0.19693975,0.023175469,0.47089702,0.0013741234],"about_ca_topic_score_codex":0.000011317079,"about_ca_topic_score_gemma":0.00019762409,"teacher_disagreement_score":0.858538,"about_ca_system_score_codex":0.00008159544,"about_ca_system_score_gemma":0.00026312153,"threshold_uncertainty_score":0.4621128},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017093412,0.0012782663,0.98697,0.00021903,0.00090007304,0.00020650784,0.000009171401,0.00015173128,0.010094269],"genre_scores_gemma":[0.43615985,0.000040324583,0.56048936,0.0008706791,0.0006311951,0.000007796533,0.000010325745,0.0000657235,0.0017247241],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996771,0.00003931763,0.0005214267,0.0011148981,0.0010506063,0.00050274975],"domain_scores_gemma":[0.996994,0.00039434983,0.00037001845,0.0018277111,0.00023831073,0.00017560506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010939599,0.0004439603,0.00062813755,0.0006508353,0.00008685748,0.00020707007,0.0038927326,0.00026316935,0.000023561897],"category_scores_gemma":[0.00012756338,0.00038287003,0.00013509078,0.0004520147,0.00084087776,0.000394702,0.0013378244,0.0004314812,0.000034786863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004998005,0.0000278255,0.000014299244,0.000055004053,0.000010864402,0.00018561374,0.0006495482,0.0018189797,0.00044439288,0.071716145,0.00009498241,0.92497736],"study_design_scores_gemma":[0.00045050753,0.0004213915,0.0001409437,0.0007201993,0.000015369962,0.0001886726,6.887422e-7,0.27086997,0.0045279986,0.71875167,0.002995961,0.0009166099],"about_ca_topic_score_codex":0.000015405927,"about_ca_topic_score_gemma":0.00002460413,"teacher_disagreement_score":0.92406076,"about_ca_system_score_codex":0.00015088008,"about_ca_system_score_gemma":0.0004708254,"threshold_uncertainty_score":0.9998623},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019837532,0.00023653166,0.99316,0.000501196,0.0031485553,0.00067107915,0.00004168113,0.0001970298,0.0018455402],"genre_scores_gemma":[0.10910863,0.00026271024,0.8827743,0.0038123443,0.0023135955,0.00016523592,0.0001693112,0.00009931336,0.0012945777],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689215,0.000030261637,0.00036778193,0.0013799989,0.0007376379,0.0005921672],"domain_scores_gemma":[0.99836624,0.00014159687,0.0003265905,0.0006962501,0.0003223401,0.0001470093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066004734,0.00045776734,0.0003979705,0.00071072544,0.00035685606,0.00045215283,0.0018317939,0.00053196703,0.000029579678],"category_scores_gemma":[0.000083203944,0.00043114836,0.00017442468,0.0003531558,0.0003035907,0.0010862871,0.0005052387,0.000693677,0.00013310842],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022384116,0.000023784582,0.000005404566,0.000043674365,0.000009193262,0.0000079344545,0.00045574133,0.00017078372,0.00030198265,0.00093992153,0.00023485985,0.9977843],"study_design_scores_gemma":[0.001175809,0.00064989965,0.00028912464,0.0015357867,0.000039553375,0.00009853013,6.2529443e-7,0.055565078,0.027919937,0.8921972,0.018828936,0.0016995253],"about_ca_topic_score_codex":0.000011976018,"about_ca_topic_score_gemma":0.00005007295,"teacher_disagreement_score":0.9960848,"about_ca_system_score_codex":0.00013497511,"about_ca_system_score_gemma":0.00029833918,"threshold_uncertainty_score":0.99981403},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039633684,0.0003308054,0.9928409,0.0005941304,0.002532224,0.000592971,0.0000127749145,0.0001480151,0.0025518676],"genre_scores_gemma":[0.9308816,0.000046330995,0.06618764,0.0010993716,0.0008919257,0.000035104043,0.000069311725,0.000049990034,0.00073870417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607366,0.0000873395,0.0006487694,0.0014154518,0.0012253508,0.00054941454],"domain_scores_gemma":[0.9978245,0.00027914118,0.00032530603,0.0011535619,0.00023167237,0.00018580341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013591265,0.00047764208,0.00051502883,0.0007835582,0.00015984783,0.00046477036,0.0017214526,0.00032567463,0.000012759816],"category_scores_gemma":[0.000133681,0.00042409668,0.000097174336,0.00073913386,0.00014567684,0.0005307982,0.0005149449,0.0005797988,0.000103884515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002080452,0.000132316,0.000274462,0.000054416123,0.000014202962,0.00019033307,0.0018720916,0.4120524,0.00015083587,0.015199292,0.0007069351,0.5693319],"study_design_scores_gemma":[0.0008026752,0.00035698625,0.0017392096,0.0011857286,0.0000071469717,0.000033650133,4.1417564e-7,0.95380163,0.0011084548,0.031612128,0.008226731,0.0011252721],"about_ca_topic_score_codex":0.000074353775,"about_ca_topic_score_gemma":0.00028296944,"teacher_disagreement_score":0.9304853,"about_ca_system_score_codex":0.00089721626,"about_ca_system_score_gemma":0.00038950573,"threshold_uncertainty_score":0.99982107},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055400737,0.00006718037,0.94085723,0.00056784204,0.0010352744,0.0003444764,0.000028204766,0.0000798473,0.0016192133],"genre_scores_gemma":[0.929763,0.000009802632,0.06858694,0.0006437699,0.0005160856,0.000021655851,0.000013045149,0.000029097986,0.0004165916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970791,0.000044929428,0.00051824976,0.0011425214,0.00078100234,0.000434213],"domain_scores_gemma":[0.99863136,0.00020693323,0.00021545951,0.0006517017,0.00018975683,0.00010480315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010787678,0.00034228497,0.00048691986,0.0006443761,0.0003151951,0.00065976166,0.0006365288,0.00018924248,0.00021785316],"category_scores_gemma":[0.00008695967,0.00031161384,0.00008427194,0.0004933221,0.00034710113,0.0003939331,0.00050968456,0.0001920537,0.00016233609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004243371,0.00005250834,0.00046658036,0.00007999335,0.000055143166,0.000015546933,0.0028164582,0.6852276,0.18216477,0.0044357534,0.0001701086,0.12447311],"study_design_scores_gemma":[0.0016524608,0.00082838355,0.049448285,0.0014185576,0.0012021008,0.00007562873,0.0000071976137,0.6702136,0.16247629,0.09767115,0.009722333,0.0052840505],"about_ca_topic_score_codex":0.00012914905,"about_ca_topic_score_gemma":0.0004387093,"teacher_disagreement_score":0.8743623,"about_ca_system_score_codex":0.0002278614,"about_ca_system_score_gemma":0.00013160615,"threshold_uncertainty_score":0.9999336},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014287933,0.00015380568,0.9960989,0.00015609991,0.0007092962,0.00019371274,0.000036525158,0.000055371973,0.0011675168],"genre_scores_gemma":[0.8583947,0.000027133345,0.14114048,0.00016751174,0.00013879774,0.000004791642,0.000038638358,0.000014490322,0.000073469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967868,0.00003006173,0.0005928748,0.0009819353,0.0011934306,0.00041493177],"domain_scores_gemma":[0.997576,0.00022339834,0.00034849602,0.0012638886,0.0004333368,0.00015486187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004898238,0.0003422164,0.00066365756,0.0024369021,0.00012207218,0.0002447034,0.0024513574,0.00017911712,0.00011371509],"category_scores_gemma":[0.000036707388,0.0003064096,0.00028439736,0.0022110962,0.0005182022,0.0003118089,0.0010269139,0.00037442366,0.000004422328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008170569,0.00010356179,0.0007807902,0.000034225035,0.00037668616,0.00003479796,0.002489989,0.03192513,0.00016535724,0.18980502,0.00006759468,0.77420866],"study_design_scores_gemma":[0.00036362128,0.00018417645,0.0012691505,0.00007290745,0.00020642782,0.000006565789,6.027428e-7,0.8482809,0.00040776227,0.14771754,0.00090881524,0.00058151805],"about_ca_topic_score_codex":0.00009533217,"about_ca_topic_score_gemma":0.000683984,"teacher_disagreement_score":0.8569659,"about_ca_system_score_codex":0.000120164645,"about_ca_system_score_gemma":0.00037084488,"threshold_uncertainty_score":0.9999388},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021861763,0.0006635786,0.9927295,0.0009364868,0.0037511862,0.0008289022,0.00004642134,0.00029679388,0.00052855036],"genre_scores_gemma":[0.07800259,0.000076561366,0.9153326,0.0034068157,0.0009565376,0.00008822702,0.000026955382,0.00011764713,0.0019920408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99461955,0.00003063401,0.0008975853,0.0021249386,0.0011734025,0.0011538774],"domain_scores_gemma":[0.99589574,0.00077605265,0.0004631308,0.0016030936,0.0009175111,0.00034446694],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011510977,0.0008422658,0.0008040332,0.0008208834,0.0003205065,0.0013282102,0.004921059,0.00045709792,0.000037901063],"category_scores_gemma":[0.00021806567,0.000746357,0.00023700023,0.00043245265,0.0015959465,0.001518206,0.0024734684,0.0007931803,0.00013965428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061271596,0.00013964123,0.00008294943,0.00013339268,0.000056281024,0.00008297896,0.008479811,0.15718754,0.0012772158,0.061939023,0.001360749,0.76919913],"study_design_scores_gemma":[0.0002449523,0.0002852731,0.000024012583,0.0002559265,0.000010658647,0.000034444438,0.0000035977225,0.7734397,0.003860123,0.21281162,0.008181863,0.0008478136],"about_ca_topic_score_codex":0.000089067,"about_ca_topic_score_gemma":0.0010618955,"teacher_disagreement_score":0.7683513,"about_ca_system_score_codex":0.00072366686,"about_ca_system_score_gemma":0.0012711491,"threshold_uncertainty_score":0.99970853},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041049137,0.0005800319,0.9962001,0.0006577396,0.00043763427,0.00021610167,0.0000053180174,0.00005222218,0.0014403731],"genre_scores_gemma":[0.6333342,0.0003052358,0.36444297,0.0013472424,0.00026888712,0.0000072647513,0.0000026470673,0.00004474144,0.0002468275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997743,0.000040636187,0.00040734492,0.0007795409,0.0007040978,0.00032534386],"domain_scores_gemma":[0.99799365,0.00023684523,0.00031513747,0.0012219865,0.00014158215,0.000090824324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006189767,0.00028452143,0.00037860128,0.00034962432,0.00021793407,0.00016235525,0.0020557716,0.00014073132,0.000014710894],"category_scores_gemma":[0.00003869802,0.00020734116,0.00015775773,0.00087624695,0.0008624016,0.00012609309,0.0011238117,0.0003464416,0.0000019643303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050862277,0.000049324484,0.0021790885,0.0001087436,0.000096592245,0.000013365023,0.0021963208,0.010000767,0.00030584878,0.28161964,0.00038908585,0.7030361],"study_design_scores_gemma":[0.00063864095,0.00022448713,0.0011586727,0.000380412,0.00007760324,0.00006185011,0.0000018434544,0.8319472,0.0015070889,0.1462808,0.01674055,0.0009808526],"about_ca_topic_score_codex":0.00011612943,"about_ca_topic_score_gemma":0.00036520374,"teacher_disagreement_score":0.82194644,"about_ca_system_score_codex":0.00004005468,"about_ca_system_score_gemma":0.00015651683,"threshold_uncertainty_score":0.84551275},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003274584,0.00021966953,0.98750144,0.00027174558,0.0018557688,0.00039750934,7.876939e-7,0.00010088723,0.009619469],"genre_scores_gemma":[0.91066337,0.000015909143,0.08785945,0.0006546536,0.00029822896,0.00000872781,0.000010261045,0.000023583489,0.0004658417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968692,0.00006156686,0.0006969705,0.0010219106,0.00078984664,0.00056050543],"domain_scores_gemma":[0.99788594,0.00023831906,0.0004628946,0.0010287116,0.00028448275,0.00009966861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000977083,0.00040834947,0.00063377747,0.0008129336,0.000112662055,0.00022023641,0.002420393,0.0003272129,0.00003994716],"category_scores_gemma":[0.00006195335,0.0003442834,0.00010094097,0.00093671767,0.0005132644,0.00033128922,0.0007500089,0.00040030654,0.000027859049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000420794,0.000035256908,0.0006315065,0.000121630444,0.000007604031,0.000023646573,0.00068906543,0.016357616,0.000083970524,0.747683,0.000024227877,0.23433828],"study_design_scores_gemma":[0.0006773372,0.0005088918,0.0020837744,0.0001760765,0.000008792712,0.000042427375,3.2784814e-7,0.41952863,0.0004947311,0.5600176,0.01545677,0.0010046506],"about_ca_topic_score_codex":0.00009452578,"about_ca_topic_score_gemma":0.00019417991,"teacher_disagreement_score":0.9106306,"about_ca_system_score_codex":0.0001832012,"about_ca_system_score_gemma":0.00023747644,"threshold_uncertainty_score":0.99990094},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004712866,0.00016255945,0.9945684,0.00086696044,0.0025712578,0.00074552884,0.000111459034,0.0001387365,0.00078795827],"genre_scores_gemma":[0.003005952,0.000026094789,0.9930778,0.002847979,0.00072978536,0.000008510233,0.00006484173,0.000026818929,0.00021221858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959773,0.000027135558,0.00046588847,0.0022328729,0.0005452958,0.0007515512],"domain_scores_gemma":[0.9964184,0.00034784141,0.00021416538,0.0026287762,0.0001836813,0.00020713275],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014405466,0.00047198212,0.00049877824,0.0006567871,0.00027434135,0.0006441051,0.008589904,0.00022498948,0.000016417882],"category_scores_gemma":[0.00016662682,0.00039548083,0.00007827892,0.00049435126,0.00050173147,0.00051764626,0.006089606,0.0003361505,0.000037432437],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013219719,0.000029165485,0.000016988604,0.000030516409,0.00002691849,0.00011856681,0.00038667143,0.003143957,0.00032899674,0.037185695,0.00055090524,0.9581684],"study_design_scores_gemma":[0.00034426706,0.00020081534,0.000015639838,0.00017674026,0.000016909837,0.000042063468,1.2257962e-7,0.8564949,0.00063103065,0.11997195,0.021246292,0.0008592308],"about_ca_topic_score_codex":0.000034774926,"about_ca_topic_score_gemma":0.000044258806,"teacher_disagreement_score":0.9573092,"about_ca_system_score_codex":0.0001033056,"about_ca_system_score_gemma":0.00028243137,"threshold_uncertainty_score":0.99984974},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3720672,0.000023429035,0.62746423,0.00002287536,0.00020131121,0.00017237455,4.2791737e-7,0.00001974411,0.000028379827],"genre_scores_gemma":[0.97106034,7.1632553e-7,0.028855277,0.0000311969,0.000035287696,0.000011979214,3.5393322e-7,0.000004593106,2.6311488e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999243,0.00003657373,0.00020569602,0.00022722901,0.00014309706,0.00014436073],"domain_scores_gemma":[0.9996272,0.00010486332,0.000025922434,0.00016198921,0.000042022846,0.000038008686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063365966,0.00007778832,0.0001477449,0.00020254479,0.00002536544,0.00004749559,0.00012410141,0.000049842383,4.2877062e-7],"category_scores_gemma":[0.00017584066,0.00006605428,0.000011017592,0.0006315354,0.000060185346,0.00006411089,0.00003363912,0.00009304076,0.0000014156761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010606111,0.000027991044,0.0015673756,0.00007649124,0.0000014036331,5.059436e-7,0.00078480435,0.7255937,0.09148988,0.00016451774,0.00000869798,0.18027404],"study_design_scores_gemma":[0.00022517396,0.000075507094,0.010544976,0.000078120305,9.750187e-7,0.00000948425,0.0000025144923,0.89816606,0.09036677,0.00041505342,0.000018988547,0.00009638336],"about_ca_topic_score_codex":0.00012733109,"about_ca_topic_score_gemma":0.000026658397,"teacher_disagreement_score":0.5989931,"about_ca_system_score_codex":0.00005215062,"about_ca_system_score_gemma":0.000013633599,"threshold_uncertainty_score":0.26936153},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014311387,0.00018012081,0.99211854,0.0002412585,0.0013390649,0.00062392023,0.0000047683216,0.00009638189,0.0052528563],"genre_scores_gemma":[0.8160838,0.000003995501,0.18005794,0.00013935076,0.00037631497,0.00002463803,0.000009891971,0.000033805918,0.0032702908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970192,0.000049581187,0.0005846063,0.0012056989,0.0006230761,0.0005178441],"domain_scores_gemma":[0.99742085,0.0008562299,0.00029874616,0.00078788167,0.00051806733,0.000118223434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087261543,0.00035920888,0.0004989017,0.0010004068,0.00021802532,0.00046608184,0.0015828016,0.00018453748,0.0000055725604],"category_scores_gemma":[0.00019881426,0.00035381396,0.000112979644,0.00046274925,0.00017420939,0.0011517449,0.0007086823,0.0007488045,0.000016191516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050666977,0.000015650223,0.00011869016,0.0000129624395,0.000006929376,0.000010047905,0.0020298453,0.8168329,0.000026043954,0.15684855,0.000010379534,0.024082938],"study_design_scores_gemma":[0.00022080551,0.000060829832,0.000045778845,0.0003712009,0.0000032767625,0.0000093551635,0.0000016637438,0.8195769,0.000103392995,0.177133,0.0021484573,0.0003252987],"about_ca_topic_score_codex":0.00014515626,"about_ca_topic_score_gemma":0.0002938288,"teacher_disagreement_score":0.8159407,"about_ca_system_score_codex":0.0005927904,"about_ca_system_score_gemma":0.00041673676,"threshold_uncertainty_score":0.9998914},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024688958,0.00019797405,0.99374133,0.0005806175,0.002311911,0.0003491272,0.000011188357,0.0007702858,0.0020128903],"genre_scores_gemma":[0.069602,0.00013933715,0.926304,0.002324976,0.0009897746,0.00001573178,0.000021891625,0.00008220098,0.0005200927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99528885,0.000036062975,0.0005108008,0.0024708891,0.0010475848,0.00064583693],"domain_scores_gemma":[0.9940982,0.000503865,0.0003562638,0.0045531522,0.00033019678,0.00015831656],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009413363,0.0006152631,0.00056905317,0.001071467,0.00030036859,0.00054989656,0.007759777,0.0003187071,0.000013268412],"category_scores_gemma":[0.00024852483,0.000574617,0.00006634032,0.00090018555,0.0005189572,0.0009495859,0.004335856,0.000880616,0.00007439412],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006398006,0.000015242683,0.000008895367,0.00004162325,0.000005259392,0.000063602136,0.00009478341,0.009989744,0.00010730174,0.0123717105,0.00006631412,0.9772291],"study_design_scores_gemma":[0.0005778434,0.0005043024,0.0003787132,0.0020390912,0.000014723036,0.00039038024,1.09378696e-7,0.55614597,0.01695538,0.3675696,0.052896023,0.0025278546],"about_ca_topic_score_codex":0.000018999754,"about_ca_topic_score_gemma":0.00006885294,"teacher_disagreement_score":0.9747013,"about_ca_system_score_codex":0.0002526366,"about_ca_system_score_gemma":0.00030815825,"threshold_uncertainty_score":0.9996705},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011894871,0.002751234,0.98155904,0.0014889176,0.0010107683,0.00043014777,0.000005234409,0.000020261494,0.0008395219],"genre_scores_gemma":[0.98365206,0.00021866856,0.013467797,0.0012748751,0.0008281397,0.000014771795,0.000020856687,0.000022724442,0.00050013006],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99792594,0.000028914616,0.00030868925,0.00094425847,0.00049846066,0.00029371405],"domain_scores_gemma":[0.9990658,0.000048209222,0.000110399014,0.0005634772,0.00008240175,0.00012968571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004192067,0.000245649,0.00019092576,0.00048820025,0.00006161914,0.00008581875,0.00073883124,0.00036505758,0.000055873257],"category_scores_gemma":[0.0001582695,0.00022630193,0.0000628013,0.000251484,0.00024901214,0.000017342601,0.00032084138,0.0003392708,0.000014508602],"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.000059914164,0.000046898997,0.00021827834,0.000038474405,0.0000060482553,0.000015140276,0.0003457308,0.02487082,0.50250834,0.00035778116,0.00060797285,0.4709246],"study_design_scores_gemma":[0.002155128,0.0019191685,0.101269536,0.007383656,0.00006789666,0.00006265665,0.0000081729695,0.06443341,0.64561874,0.035406005,0.13682918,0.0048464616],"about_ca_topic_score_codex":0.000008409018,"about_ca_topic_score_gemma":0.00013476121,"teacher_disagreement_score":0.9717572,"about_ca_system_score_codex":0.00015056932,"about_ca_system_score_gemma":0.00030137724,"threshold_uncertainty_score":0.9228325},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0214211,0.0036636782,0.9264514,0.0011232113,0.008177873,0.0011315582,0.00004929713,0.00014947519,0.037832443],"genre_scores_gemma":[0.9588769,0.000036126105,0.032227077,0.0022233818,0.00092176895,0.00004193941,0.000019716419,0.00006907649,0.005584016],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979401,0.00005777641,0.00033044865,0.0008477652,0.00037314225,0.00045077194],"domain_scores_gemma":[0.99873596,0.00012220882,0.00010328602,0.000521401,0.0002105013,0.00030663432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066275,0.00027892756,0.00033133518,0.00058554544,0.0001669174,0.00016551896,0.0005344795,0.0003155134,0.00026203948],"category_scores_gemma":[0.000039984785,0.00025628845,0.0000660834,0.00022175543,0.00044845717,0.00014907811,0.00031036208,0.00051309523,0.000099282115],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001650513,0.000057490233,0.00009486159,0.00003748913,0.00000793251,0.00034377805,0.0049710274,0.00043337673,0.00008093699,0.035971247,0.00093870837,0.9568981],"study_design_scores_gemma":[0.0036620924,0.008380562,0.06431876,0.0032646547,0.00014782045,0.00070640846,0.0001517639,0.002359426,0.00015953445,0.64167374,0.27062726,0.004547984],"about_ca_topic_score_codex":0.00013358069,"about_ca_topic_score_gemma":0.00030675187,"teacher_disagreement_score":0.95235014,"about_ca_system_score_codex":0.0001663102,"about_ca_system_score_gemma":0.00048607355,"threshold_uncertainty_score":0.9999889},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3510947,0.00009285415,0.6486363,0.0000148121535,0.000085363914,0.000039209608,5.58392e-7,0.000029999794,0.0000062250424],"genre_scores_gemma":[0.76102227,0.0000054079874,0.23890334,0.000045492965,0.000017262566,0.000002435289,3.823231e-7,0.0000031719972,2.0330445e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942756,0.000011173835,0.00012760895,0.00016782881,0.00013074794,0.00013506477],"domain_scores_gemma":[0.99971116,0.0000670169,0.00001854337,0.000121501565,0.00003176911,0.00005000555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017161162,0.00006856509,0.000102252365,0.00011378263,0.000027181546,0.000018831874,0.00012962375,0.000021346397,0.000016157557],"category_scores_gemma":[0.00008889112,0.000055638207,0.000015053895,0.0003662303,0.00022656731,0.00009170096,0.000036939797,0.00007245014,0.0000016174828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.9757365e-7,0.00003124593,0.004669171,0.000076048455,0.000005301887,0.0000038657895,0.0020429078,0.036558814,0.016782334,0.000008990202,0.0000013610029,0.93981916],"study_design_scores_gemma":[0.00010888879,0.000016363403,0.017162884,0.000041436255,0.00000560517,0.0000030203676,0.0000018678608,0.9678182,0.014153015,0.0006216416,0.000001184565,0.00006590885],"about_ca_topic_score_codex":0.00002540437,"about_ca_topic_score_gemma":0.000010693814,"teacher_disagreement_score":0.93975323,"about_ca_system_score_codex":0.00001541505,"about_ca_system_score_gemma":0.000012364549,"threshold_uncertainty_score":0.22688602},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043654916,0.0014538628,0.99514323,0.00024171291,0.0015184559,0.00036112644,0.0000031677268,0.0001725169,0.0006693597],"genre_scores_gemma":[0.04170063,0.0000649911,0.9567766,0.00078857865,0.00040185128,0.0000028134587,0.000003502106,0.0000465809,0.00021446016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960891,0.000035456615,0.0005625673,0.0016016795,0.0009584367,0.0007527457],"domain_scores_gemma":[0.9979322,0.00015432994,0.00034597906,0.0009229741,0.00033988705,0.00030464045],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010060141,0.0005523038,0.00055267103,0.00069248927,0.0006570006,0.0012813484,0.0017219988,0.00020016148,0.000015289395],"category_scores_gemma":[0.00015354496,0.0005295247,0.00007680834,0.0004721849,0.00046933125,0.0015201854,0.003521246,0.00075397285,0.000011110511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037123268,0.000010479804,0.00017106325,0.00003280153,0.0000033738509,0.00009141983,0.0007152237,0.25816554,0.0010739217,0.0007958096,0.000021446096,0.7389152],"study_design_scores_gemma":[0.0002673218,0.000065560576,0.000043909837,0.0007935169,0.000005534053,0.00015457881,0.0000010895267,0.983936,0.00049259746,0.012555552,0.0010638745,0.0006204553],"about_ca_topic_score_codex":0.000032502685,"about_ca_topic_score_gemma":0.000025842473,"teacher_disagreement_score":0.7382948,"about_ca_system_score_codex":0.00045309137,"about_ca_system_score_gemma":0.0004007133,"threshold_uncertainty_score":0.99975544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007213849,0.00018179594,0.97613186,0.0007666111,0.0004755489,0.0003306797,0.00000627371,0.00009722428,0.02193786],"genre_scores_gemma":[0.8756199,0.000057841942,0.122889265,0.00069035316,0.00038633833,0.000009617749,0.00000854648,0.00008989943,0.000248229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986291,0.000028287237,0.00026531942,0.00028401904,0.00052260736,0.0002706522],"domain_scores_gemma":[0.9988104,0.00039221926,0.00008133048,0.00053729484,0.00012599121,0.0000527496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009028257,0.0002380729,0.00022639862,0.0001642776,0.00015329936,0.0001045936,0.0009342036,0.00010684303,0.00004781926],"category_scores_gemma":[0.00006400189,0.00014002579,0.000053139996,0.0002841179,0.00076549867,0.00006816859,0.00022997084,0.0007798217,0.000012220154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017843481,0.0000036448598,0.000006057337,0.00003780566,0.0000076003103,0.0000010742034,0.0007261406,0.9391982,0.000021893477,0.0352346,0.00003831583,0.024722911],"study_design_scores_gemma":[0.000073011885,0.000042914402,0.000009838258,0.00028714162,0.000003439263,0.00000482497,3.1997982e-7,0.8707517,0.0002269531,0.12733622,0.0010983805,0.0001652644],"about_ca_topic_score_codex":0.000012979864,"about_ca_topic_score_gemma":0.000037406866,"teacher_disagreement_score":0.87554777,"about_ca_system_score_codex":0.000085638065,"about_ca_system_score_gemma":0.000108741544,"threshold_uncertainty_score":0.5710086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010186922,0.0007131879,0.97678846,0.017992962,0.001490687,0.0009055704,0.000046376186,0.0007600201,0.0012008777],"genre_scores_gemma":[0.048278194,0.000044209726,0.94974715,0.0005448047,0.00031936102,0.000043286782,0.00005459591,0.00006302536,0.0009053726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925525,0.000049566977,0.00087820867,0.0029332258,0.0023113547,0.0012751],"domain_scores_gemma":[0.9810517,0.0009010108,0.00056364055,0.015992472,0.0012155647,0.00027562713],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0030155075,0.00082825293,0.0011244145,0.0023474633,0.0003291933,0.001194502,0.067945175,0.0006609181,0.000038796414],"category_scores_gemma":[0.012736238,0.00075680617,0.00039756353,0.002511713,0.00076729705,0.001346898,0.12282172,0.0010900664,0.000051330266],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050254228,0.00022234845,0.0027331666,0.00050651707,0.001052281,0.00029399127,0.0013878169,0.12684956,0.0002520537,0.020499757,0.049663898,0.79648834],"study_design_scores_gemma":[0.00022250558,0.00009285257,0.00019410084,0.00014315703,0.0000700007,0.000015034381,1.0404907e-7,0.564764,0.00023782231,0.43022743,0.0034634057,0.00056960457],"about_ca_topic_score_codex":0.0000517592,"about_ca_topic_score_gemma":0.0001000286,"teacher_disagreement_score":0.79591876,"about_ca_system_score_codex":0.0007028785,"about_ca_system_score_gemma":0.00072417536,"threshold_uncertainty_score":0.99984235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072270684,0.000038773313,0.9271027,0.00018398714,0.00017206503,0.00015921085,0.0000058561936,0.000060383893,0.0000063781763],"genre_scores_gemma":[0.5695091,6.004642e-7,0.43025786,0.00015637858,0.00005487744,0.000010493696,0.0000051811858,0.0000046112473,9.393761e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905217,0.000010142646,0.0002049991,0.00026593354,0.00019892579,0.00026786013],"domain_scores_gemma":[0.9994817,0.00013064852,0.000020162575,0.00016321304,0.00007703288,0.00012725806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019718522,0.000106709565,0.00013859471,0.00014481906,0.00008443803,0.00016281498,0.00021789345,0.000036888538,0.000027636946],"category_scores_gemma":[0.00027116144,0.00009350212,0.000044803513,0.0004608638,0.00015044506,0.00018020927,0.000029139821,0.00013164806,0.0000041264875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.527743e-7,0.000021277361,0.0000061251058,0.000028957007,0.0000032246587,5.085108e-7,0.00010447104,0.72755104,0.035588726,0.000029648596,0.0000386174,0.23662673],"study_design_scores_gemma":[0.00018047214,0.000037638605,0.00012762906,0.000095283795,0.000009165437,0.000004114982,9.794657e-7,0.9845351,0.012737036,0.002158043,0.0000025825154,0.00011193828],"about_ca_topic_score_codex":0.000037215472,"about_ca_topic_score_gemma":0.000030120296,"teacher_disagreement_score":0.49723837,"about_ca_system_score_codex":0.00007610269,"about_ca_system_score_gemma":0.000035119123,"threshold_uncertainty_score":0.38129058},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056628324,0.0001214683,0.9934418,0.00008186864,0.00043297122,0.00068865233,0.0000041146304,0.0008171756,0.0038456717],"genre_scores_gemma":[0.31975582,0.000010539793,0.6792873,0.0004202113,0.00024677144,0.000025080373,0.000007015496,0.000042254982,0.00020495855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957915,0.000091219474,0.0005645801,0.0019965384,0.0008830912,0.0006731004],"domain_scores_gemma":[0.9966795,0.00019130138,0.00040884683,0.0020118053,0.00041798118,0.00029058743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008557563,0.00068319694,0.0005889361,0.0010087442,0.0005710578,0.00072709785,0.0029769538,0.000260746,0.000034944223],"category_scores_gemma":[0.000025874766,0.0005783647,0.00008336613,0.00079650874,0.00054129784,0.0010859289,0.0010016578,0.0008172039,0.000018113375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028921302,0.00047745096,0.00044666027,0.000033370678,0.00005506106,0.011794435,0.00876361,0.2739068,0.0000039520655,0.010009116,0.00009703059,0.6943836],"study_design_scores_gemma":[0.001008636,0.0042702947,0.00012836781,0.0006236087,0.0000382393,0.008039991,0.000006507414,0.93754673,0.0001893708,0.045589894,0.0004900216,0.0020683554],"about_ca_topic_score_codex":0.00022499802,"about_ca_topic_score_gemma":0.00030966333,"teacher_disagreement_score":0.6923153,"about_ca_system_score_codex":0.0001753077,"about_ca_system_score_gemma":0.00054011657,"threshold_uncertainty_score":0.99966675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004212913,0.000719235,0.9912846,0.0005781445,0.0022137738,0.00078811694,0.000004536577,0.00035203976,0.0036382598],"genre_scores_gemma":[0.34478772,0.000024747642,0.65090054,0.0014610792,0.0013430067,0.00004425445,0.000007800317,0.00009772662,0.0013331078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949006,0.00003380967,0.00079561886,0.0021643403,0.0009333965,0.0011722681],"domain_scores_gemma":[0.9963605,0.00069367123,0.0003355048,0.0017751908,0.0005363207,0.00029882378],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010668088,0.0007672997,0.0007961815,0.00080946705,0.0006399692,0.0012769991,0.0032340745,0.000505627,0.000031486332],"category_scores_gemma":[0.0001518148,0.0007100299,0.00028481463,0.00043867427,0.00071805046,0.00083035347,0.001125322,0.0008844522,0.00008987776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070703295,0.00002614202,0.0000074646073,0.000074639145,0.000024524092,0.000040777286,0.0025469516,0.39928356,0.00063339976,0.07477594,0.0001411407,0.5224384],"study_design_scores_gemma":[0.00032127026,0.0001239051,0.0000014208667,0.00050551724,0.000011407204,0.0000580201,7.807258e-7,0.90294653,0.0017626856,0.09094718,0.0025101947,0.0008110941],"about_ca_topic_score_codex":0.0000357477,"about_ca_topic_score_gemma":0.000022222157,"teacher_disagreement_score":0.5216273,"about_ca_system_score_codex":0.0003469757,"about_ca_system_score_gemma":0.00058407953,"threshold_uncertainty_score":0.9997598},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004481844,0.00014871743,0.99120253,0.000059866474,0.0007294094,0.00075580896,0.000018691728,0.00007363836,0.002529475],"genre_scores_gemma":[0.95818007,0.0000030939443,0.04091417,0.000075483425,0.00015543945,0.000017741546,0.0000100524785,0.000018753555,0.0006252029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977782,0.000035861678,0.00033443782,0.0009053071,0.0005875009,0.00035872744],"domain_scores_gemma":[0.9986678,0.00018932996,0.0002710851,0.0005318396,0.00026456115,0.00007543432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023317948,0.0003328986,0.00048045593,0.00062475976,0.000088676294,0.00030712664,0.0012664087,0.00012937812,0.0000049923656],"category_scores_gemma":[0.000032523996,0.0003137906,0.000087692824,0.0004375788,0.00024269098,0.00038687955,0.00039050722,0.00032143266,0.0000075500566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006596911,0.012074096,0.015545721,0.0026615174,0.00042586317,0.0001664177,0.019914092,0.4114613,0.005715094,0.022164868,0.0061742235,0.50303715],"study_design_scores_gemma":[0.0033156474,0.0022249024,0.005363524,0.0010197186,0.00010572367,0.000030031259,0.0000028984805,0.9451476,0.011092751,0.029784665,0.00048459653,0.001427956],"about_ca_topic_score_codex":0.000012679951,"about_ca_topic_score_gemma":0.00008233763,"teacher_disagreement_score":0.9536982,"about_ca_system_score_codex":0.00009590128,"about_ca_system_score_gemma":0.00019930027,"threshold_uncertainty_score":0.9999314},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008247467,0.0028412144,0.98462075,0.00047003722,0.0005050936,0.00045020654,0.0000026270834,0.00080071704,0.010301108],"genre_scores_gemma":[0.044468585,0.000045460056,0.95299965,0.0012358151,0.0004984874,0.000012931537,0.0000045235543,0.000043375476,0.0006911827],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956168,0.00002945977,0.0005082797,0.0018925532,0.001148206,0.0008046879],"domain_scores_gemma":[0.9972455,0.00023231983,0.00032876444,0.001736512,0.00028023781,0.00017664698],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00087057665,0.0006664901,0.00060509227,0.0012193385,0.00026492562,0.0007608004,0.005565773,0.0004671418,0.00001361349],"category_scores_gemma":[0.00009928084,0.0005681685,0.00015571865,0.000954811,0.0007161351,0.001153723,0.0019919255,0.001363841,0.00003774303],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036515603,0.000039831786,0.000007715756,0.00007644624,0.000010440559,0.00007240655,0.0009811976,0.0022789023,0.000111578665,0.087953515,0.000025544738,0.90843874],"study_design_scores_gemma":[0.00020953554,0.00015073344,0.0000126105815,0.00055566913,0.000010724839,0.0002972923,2.5470925e-7,0.48069268,0.0032853612,0.51250416,0.0011566501,0.001124341],"about_ca_topic_score_codex":0.000023123983,"about_ca_topic_score_gemma":0.00003185493,"teacher_disagreement_score":0.9073144,"about_ca_system_score_codex":0.0005344306,"about_ca_system_score_gemma":0.0006332547,"threshold_uncertainty_score":0.99981457},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034568628,0.00006896736,0.99398214,0.00030641834,0.00064574636,0.00031640937,0.00006963471,0.0001785415,0.00439757],"genre_scores_gemma":[0.063674755,0.00004132598,0.93452775,0.0008591478,0.00033843514,0.00003354888,0.00006509584,0.000040841165,0.00041911087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640137,0.000027369788,0.0005707251,0.001598747,0.0007927197,0.00060904777],"domain_scores_gemma":[0.9970496,0.00045294652,0.00031277208,0.001659361,0.00029919,0.00022607535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072449475,0.00044926623,0.00040546735,0.0005112921,0.0002832564,0.00060092006,0.003497119,0.0002186957,0.00005527875],"category_scores_gemma":[0.000092080256,0.00042527652,0.00006457874,0.0004670416,0.0005032733,0.00053045637,0.00081180164,0.0005250734,0.00013378182],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014005224,0.00003161461,0.00007308746,0.000026268857,0.0000075857015,0.000037564925,0.00075371645,0.0006281651,0.00003448384,0.05123913,0.0000849214,0.94708204],"study_design_scores_gemma":[0.00033660093,0.00035939604,0.0017036492,0.0007461731,0.00002332331,0.00006616899,9.231921e-7,0.8415246,0.0010148739,0.14638741,0.006350896,0.0014859914],"about_ca_topic_score_codex":0.00006978595,"about_ca_topic_score_gemma":0.000041286843,"teacher_disagreement_score":0.9455961,"about_ca_system_score_codex":0.00017579044,"about_ca_system_score_gemma":0.00059002824,"threshold_uncertainty_score":0.99981993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002380915,0.00094354484,0.99049765,0.00025952767,0.0016021798,0.0005691894,0.000003800761,0.00020680223,0.0056792363],"genre_scores_gemma":[0.23432724,0.00003707232,0.7627691,0.0013404676,0.0008721476,0.000034892662,0.000004044671,0.0000590888,0.0005559453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996033,0.00005760255,0.00041114577,0.001801636,0.0010500028,0.00064657413],"domain_scores_gemma":[0.9977317,0.00023081536,0.0001846456,0.0012402268,0.00022662457,0.00038601228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018218311,0.0005180866,0.0005044649,0.0008158009,0.00025006442,0.00083734357,0.0022736518,0.00021466245,0.0000029201726],"category_scores_gemma":[0.00017482469,0.00047834998,0.000088965804,0.00057042297,0.00026786217,0.0005941054,0.0017473635,0.00074720365,0.000031195726],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011446798,0.000017968587,0.000011990627,0.000046053323,0.00001173623,0.000037815174,0.0009642176,0.02627353,0.00011918925,0.0031822142,0.00019343017,0.9691304],"study_design_scores_gemma":[0.0005868703,0.0007737533,0.00013640097,0.0006356588,0.000025713476,0.0008459195,5.1606395e-7,0.6320754,0.0043133697,0.33905622,0.019609826,0.0019403358],"about_ca_topic_score_codex":0.000042358755,"about_ca_topic_score_gemma":0.000028616474,"teacher_disagreement_score":0.9671901,"about_ca_system_score_codex":0.00035070925,"about_ca_system_score_gemma":0.0003784595,"threshold_uncertainty_score":0.9997668},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04594756,0.0010359498,0.92298985,0.0036955206,0.006340775,0.004969587,0.0002185619,0.000160516,0.014641672],"genre_scores_gemma":[0.9664217,0.000035722456,0.029150872,0.0022586726,0.0013929014,0.000039670347,0.00024861033,0.000025862422,0.0004259381],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9971726,0.00022303044,0.00059492944,0.0007947893,0.0006158429,0.0005987934],"domain_scores_gemma":[0.99740803,0.0009127935,0.00031070242,0.0011742269,0.0000870974,0.00010712355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024700314,0.00027982096,0.0003393692,0.00031418432,0.0003865426,0.000059740574,0.0017773805,0.00036991783,0.000018133296],"category_scores_gemma":[0.00020372319,0.00020578959,0.000038441634,0.00033395318,0.00014506212,0.00041302317,0.00064740813,0.0011270939,0.00006263603],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054418353,0.00017616343,0.022959072,0.00022924413,0.000018543975,0.000028841,0.02599818,0.00019342295,0.0002479708,0.004445048,0.0007370042,0.9449121],"study_design_scores_gemma":[0.0015718655,0.001169735,0.88140595,0.0067777326,0.0000779697,0.000032826,0.00010062489,0.03509605,0.000005416356,0.045919377,0.026258515,0.0015839465],"about_ca_topic_score_codex":0.00014829503,"about_ca_topic_score_gemma":0.0029163843,"teacher_disagreement_score":0.94332814,"about_ca_system_score_codex":0.00019294603,"about_ca_system_score_gemma":0.0003577118,"threshold_uncertainty_score":0.8391856},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013190365,0.0005012465,0.9837092,0.00025029897,0.0012445244,0.00037080242,0.000010757389,0.000076291246,0.0006464706],"genre_scores_gemma":[0.93392414,0.000022639702,0.06564574,0.00008693807,0.0002069383,0.000007953999,0.000006130627,0.000017963766,0.00008155308],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688095,0.00003335512,0.00059584173,0.00093820336,0.0010698818,0.00048174185],"domain_scores_gemma":[0.9979028,0.0000804609,0.00032002147,0.0011160041,0.0004297457,0.0001509425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005395642,0.00037945,0.0004831759,0.00080953364,0.00017976497,0.00040818297,0.0023656404,0.0001822972,0.000029485314],"category_scores_gemma":[0.00004024487,0.00031411767,0.00013547098,0.000593887,0.0007108862,0.00054047507,0.0011428676,0.00042470664,0.0000046944847],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003782648,0.00022680906,0.00017948663,0.00022474368,0.000075380885,0.00004798493,0.006745646,0.0037810004,0.012828049,0.20862873,0.00015544379,0.7670689],"study_design_scores_gemma":[0.0013878052,0.0008526928,0.0003244858,0.0008767056,0.00004100341,0.0000873054,0.0000027584883,0.47576964,0.032793052,0.48495734,0.0012505888,0.0016566259],"about_ca_topic_score_codex":0.000118819815,"about_ca_topic_score_gemma":0.00018896705,"teacher_disagreement_score":0.92073375,"about_ca_system_score_codex":0.0001499032,"about_ca_system_score_gemma":0.00071057875,"threshold_uncertainty_score":0.9999311},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000706272,0.0002806255,0.9926323,0.00023322606,0.00061344734,0.00063778245,0.0000068808636,0.00025498235,0.005270088],"genre_scores_gemma":[0.7324005,0.00000417352,0.265985,0.00059285417,0.0006862697,0.000042595526,0.000021404378,0.00006309154,0.00020412875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597514,0.000045139474,0.0005541987,0.0016901947,0.00097396644,0.00076137565],"domain_scores_gemma":[0.9967398,0.0007064348,0.0005038193,0.0010940676,0.0007423024,0.00021358914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019404871,0.00056084286,0.0005433311,0.000632789,0.00043679454,0.00084454665,0.0029727542,0.00025820182,0.0000058983724],"category_scores_gemma":[0.0002775514,0.00045145128,0.00011696733,0.0007115795,0.0005464943,0.0008182502,0.00044235887,0.0007387444,0.0000112382095],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013252434,0.000015748386,0.00009574091,0.000043040465,0.000010748764,0.000024212311,0.0007410411,0.00840904,0.00028748755,0.117822774,0.00001756502,0.8725313],"study_design_scores_gemma":[0.00037552952,0.0004767647,0.000068515255,0.00090592727,0.00001814736,0.00014250707,0.0000019611232,0.6869711,0.00084750366,0.30856726,0.0007573284,0.0008674341],"about_ca_topic_score_codex":0.000024097006,"about_ca_topic_score_gemma":0.00011049369,"teacher_disagreement_score":0.87166387,"about_ca_system_score_codex":0.00042121028,"about_ca_system_score_gemma":0.001313922,"threshold_uncertainty_score":0.9997937},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018589733,0.00026851209,0.98909754,0.0006020375,0.0006023383,0.0002887624,0.0000028969616,0.00014862529,0.008803369],"genre_scores_gemma":[0.11464377,0.00009752771,0.8821236,0.0004737013,0.00043787836,0.000012066376,0.000007228899,0.000044086104,0.0021601608],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964445,0.000088409215,0.0003515224,0.0013841076,0.0010668947,0.00066454074],"domain_scores_gemma":[0.997843,0.00039074602,0.00016436711,0.0010682199,0.0003451192,0.00018852337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024032868,0.00033996758,0.0003640421,0.0009390155,0.00045697682,0.00064237666,0.002261075,0.00017438586,0.000021588703],"category_scores_gemma":[0.0000910729,0.00030091748,0.000045272616,0.00057416386,0.0016128174,0.0004837572,0.0019040501,0.0014389628,0.0000543492],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037458963,0.00002397821,0.00006371851,0.000040917443,0.0000047158283,0.000034514585,0.0014951577,0.0008834854,0.00002064965,0.09684442,0.000015466696,0.9005692],"study_design_scores_gemma":[0.00010900116,0.00017299833,0.00030065855,0.00012357406,9.77829e-7,0.000038130052,6.508821e-8,0.37312436,0.00018621364,0.62482315,0.00085216697,0.00026868496],"about_ca_topic_score_codex":0.00013083134,"about_ca_topic_score_gemma":0.000057447698,"teacher_disagreement_score":0.90030056,"about_ca_system_score_codex":0.00012889587,"about_ca_system_score_gemma":0.00026352206,"threshold_uncertainty_score":0.99994427},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30783308,0.0055946144,0.68305665,0.00007888756,0.00049775944,0.0008530178,0.00011177351,0.000008357764,0.001965841],"genre_scores_gemma":[0.83565515,0.00007502528,0.16355754,0.00008428827,0.00039952836,0.000005025065,0.000024244298,0.000029667743,0.00016950743],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982085,0.000026168653,0.0003133611,0.00073101744,0.00037343826,0.00034751024],"domain_scores_gemma":[0.99875164,0.000032404212,0.00016428754,0.0006092621,0.00036301155,0.00007937637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055902306,0.0002778748,0.00031659717,0.0001454332,0.000120849036,0.000048943486,0.00064487726,0.00014417013,0.000007352623],"category_scores_gemma":[0.000098081684,0.00025344713,0.000061230785,0.00012672783,0.00056173006,0.0000035577,0.0009902823,0.00022156867,0.0000014661463],"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.000020199417,0.000016583297,0.0003444713,0.00007714826,0.000027937578,0.000011531477,0.00015186766,0.04255888,0.9178303,0.00042324723,0.0000065545355,0.038531315],"study_design_scores_gemma":[0.00080334797,0.00082245073,0.00017296798,0.0009270044,0.00004125454,0.0000932018,0.000003980562,0.07634901,0.90432507,0.010722435,0.0042701554,0.0014691382],"about_ca_topic_score_codex":0.00009159131,"about_ca_topic_score_gemma":0.00006850108,"teacher_disagreement_score":0.5278221,"about_ca_system_score_codex":0.00005853874,"about_ca_system_score_gemma":0.00070801354,"threshold_uncertainty_score":0.9999918},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000059844288,0.00019602444,0.9962974,0.0004682111,0.00031927007,0.001081389,0.000004894308,0.0006037877,0.0010230076],"genre_scores_gemma":[0.03483308,0.000021760237,0.9645412,0.00016334842,0.0002731338,0.00007013583,0.0000035755565,0.000042234682,0.000051555246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982532,0.000014020923,0.00031510796,0.0005606433,0.0003402883,0.00051673816],"domain_scores_gemma":[0.99655974,0.002723844,0.00010322282,0.0004754053,0.00008759795,0.000050171162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054271135,0.00038301368,0.0003109923,0.0001733169,0.00027120856,0.00013290838,0.00068768987,0.00028282497,0.0000029480186],"category_scores_gemma":[0.00034338713,0.00029533962,0.00008286529,0.00022640226,0.0005750198,0.00015486665,0.00009138056,0.0007991645,0.000005305933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002907722,0.000004430119,1.937877e-7,0.00000959161,0.000005335726,0.0000024031299,0.000063446525,0.46796688,0.000048467515,0.0022145477,0.0000061161204,0.52967566],"study_design_scores_gemma":[0.00021545318,0.00015843114,0.000012958355,0.00028900438,0.000012888033,0.000008392657,8.603089e-7,0.9070465,0.0006731084,0.091034,0.00023604129,0.0003123454],"about_ca_topic_score_codex":4.070584e-7,"about_ca_topic_score_gemma":0.000009229866,"teacher_disagreement_score":0.52936333,"about_ca_system_score_codex":0.00028520005,"about_ca_system_score_gemma":0.00005729313,"threshold_uncertainty_score":0.9999499},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012545128,0.006590714,0.9888046,0.00007729583,0.00084137724,0.00033026614,0.000004085012,0.0000053896065,0.002091809],"genre_scores_gemma":[0.26960838,0.00042679164,0.72622544,0.0010265987,0.0010987375,0.000059860275,0.000018879355,0.00006280492,0.0014725167],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870443,0.00001318016,0.0002207098,0.0006887649,0.0001179685,0.00025496044],"domain_scores_gemma":[0.9991522,0.00007816672,0.00012955863,0.00045371198,0.00013380531,0.000052547148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041572476,0.000228868,0.00021625287,0.00012255576,0.000097439864,0.000021915452,0.0004076582,0.00020439898,0.0000080011505],"category_scores_gemma":[0.00007571592,0.00022108787,0.00009839446,0.000040632734,0.0002718228,4.4141973e-7,0.00028525447,0.00012467535,0.0000023337286],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001295231,0.000032782704,0.00011382515,0.000048169833,0.000044238706,0.0000012184888,0.00034592603,0.10510771,0.13018867,0.0014803302,0.00012370646,0.76250046],"study_design_scores_gemma":[0.0008747798,0.0007530268,0.0008264774,0.00016581056,0.00006852345,0.000033935707,3.6445923e-7,0.4409526,0.049350988,0.021896241,0.48347405,0.0016031896],"about_ca_topic_score_codex":0.000003229366,"about_ca_topic_score_gemma":0.0000075658036,"teacher_disagreement_score":0.7608973,"about_ca_system_score_codex":0.00015910417,"about_ca_system_score_gemma":0.00012596947,"threshold_uncertainty_score":0.90157014},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002461867,0.00040420576,0.9958307,0.0003373903,0.0017248332,0.0007163615,0.000010061492,0.0008525647,0.00009922785],"genre_scores_gemma":[0.011926761,0.00001739876,0.98652637,0.0004579938,0.0008720333,0.00007288766,0.0000072956727,0.000059396632,0.000059834725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601203,0.000019166178,0.00058800704,0.0014397884,0.0009810948,0.0009599049],"domain_scores_gemma":[0.997236,0.00022635254,0.00020423127,0.0016218416,0.0004527219,0.00025882738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012842503,0.00059603463,0.00063409616,0.0006300258,0.00020293043,0.00044577548,0.0036239207,0.0005668802,0.000005468795],"category_scores_gemma":[0.00006944281,0.00057471584,0.00020116696,0.00034829063,0.00021501497,0.00087740243,0.0014990575,0.0008168491,0.000009484154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055433184,0.0000071256995,9.97389e-7,0.000019253706,0.000005526374,0.000009250739,0.00024884733,0.37327367,0.000008689151,0.40144703,0.00001792309,0.22495615],"study_design_scores_gemma":[0.00014266618,0.000096499556,1.8560353e-7,0.00019243127,0.0000048026554,0.00001740298,8.446996e-9,0.60174286,0.00023106155,0.39379033,0.0033752406,0.00040648252],"about_ca_topic_score_codex":0.000013658236,"about_ca_topic_score_gemma":0.000008222001,"teacher_disagreement_score":0.2284692,"about_ca_system_score_codex":0.0003859916,"about_ca_system_score_gemma":0.0005917061,"threshold_uncertainty_score":0.99967045},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015957061,0.00012398644,0.99287045,0.00008765852,0.0008472554,0.0004932247,0.0000098138835,0.000089209134,0.005318858],"genre_scores_gemma":[0.07428856,0.00007688407,0.9246465,0.00030747897,0.00009309123,0.000015332593,0.000011157511,0.00003595328,0.0005250666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965003,0.00009343944,0.0008706905,0.0011308648,0.00081468635,0.0005900274],"domain_scores_gemma":[0.9971358,0.00036081357,0.0006138941,0.0015304505,0.00024546756,0.000113558905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019238736,0.0004468296,0.0005641346,0.0013613773,0.00010004903,0.00015339916,0.0032648358,0.00029451406,0.000030531774],"category_scores_gemma":[0.00029251812,0.000423793,0.000110645975,0.0010475548,0.0006425613,0.0012040283,0.0010918735,0.00057488575,0.000033853994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029202849,0.000061063285,0.00016954365,0.00013303135,0.000010247573,0.00004853267,0.0042995634,0.051221017,0.000364484,0.07350775,0.000007494449,0.87014806],"study_design_scores_gemma":[0.00020679497,0.00019453879,0.0004932576,0.00040940434,0.000004176846,0.000020013913,1.1823354e-7,0.88765526,0.0055643385,0.104701295,0.00024082186,0.00050998124],"about_ca_topic_score_codex":0.000041101717,"about_ca_topic_score_gemma":0.000045141078,"teacher_disagreement_score":0.8696381,"about_ca_system_score_codex":0.0002360288,"about_ca_system_score_gemma":0.0003381931,"threshold_uncertainty_score":0.99982136},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000127612975,0.0003691414,0.99616456,0.0004455129,0.001722542,0.00076785556,0.000013286081,0.00004696856,0.0004573787],"genre_scores_gemma":[0.00055066415,0.00008423462,0.99867994,0.0003208717,0.00008592077,0.00003224039,8.988261e-7,0.000031125706,0.00021412881],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798906,0.00005183954,0.0005311952,0.0006330343,0.00045858533,0.00033625806],"domain_scores_gemma":[0.9937678,0.0047073676,0.0004968112,0.00070032844,0.00027750616,0.0000501677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013674995,0.00030478678,0.00048653298,0.00021381854,0.00017332764,0.000060850547,0.0009733267,0.00024944608,0.000037951875],"category_scores_gemma":[0.0014466379,0.00020803272,0.0001474838,0.0002955895,0.0014506754,0.00011049942,0.00017021454,0.00047410472,0.0000025913432],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013382147,0.000015287686,0.000017818415,0.000259945,0.00003487143,0.0000025645018,0.00036025883,0.007323954,0.00007517644,0.028737692,0.000046857367,0.9631122],"study_design_scores_gemma":[0.00013593683,0.0000893815,0.0000020263271,0.0003676957,0.000030987998,0.000056309065,7.318003e-7,0.07080766,0.0002922286,0.9274184,0.00056656246,0.00023204215],"about_ca_topic_score_codex":0.000008679932,"about_ca_topic_score_gemma":0.000030701485,"teacher_disagreement_score":0.96288013,"about_ca_system_score_codex":0.00018584944,"about_ca_system_score_gemma":0.00022877194,"threshold_uncertainty_score":0.8483328},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012685452,0.0020977769,0.9931627,0.0009401438,0.0011474435,0.00063740445,0.0000060989723,0.0003583011,0.0015233032],"genre_scores_gemma":[0.57899755,0.00018251697,0.4166974,0.0024692488,0.0006540978,0.00010742425,0.0000046204063,0.00007160122,0.00081554725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970692,0.00007086631,0.000453045,0.0009898698,0.0008956355,0.0005213753],"domain_scores_gemma":[0.99598527,0.001978008,0.0003564242,0.0013206846,0.0002184675,0.00014115],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023255113,0.0004519503,0.0005517829,0.00027966432,0.00033666758,0.0012932527,0.003038395,0.00023042675,0.000006885193],"category_scores_gemma":[0.00042443335,0.00029857692,0.00007544379,0.0003982894,0.00047462786,0.00051551056,0.0012868213,0.0007767436,0.000026591555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026761027,0.00010895448,0.00014301269,0.0071491087,0.00021341008,0.00049567287,0.021365061,0.021193022,0.00013360949,0.28966424,0.0010026365,0.6585045],"study_design_scores_gemma":[0.00044335035,0.00066017365,0.00015641113,0.015180481,0.000040257662,0.0005564033,0.000006913954,0.7014188,0.0005649168,0.2662521,0.0129388105,0.0017813615],"about_ca_topic_score_codex":0.000047815927,"about_ca_topic_score_gemma":0.000031309,"teacher_disagreement_score":0.6802258,"about_ca_system_score_codex":0.00013376564,"about_ca_system_score_gemma":0.00027533635,"threshold_uncertainty_score":0.99994665},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019593985,0.00014633407,0.99326754,0.0013008211,0.0024264765,0.0010573494,0.0000073936144,0.00045073577,0.0013237428],"genre_scores_gemma":[0.0025566989,0.00004650775,0.9943286,0.0019878524,0.0006945553,0.0000596915,0.000008839007,0.00003464376,0.00028258294],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99615043,0.000035168767,0.0006276624,0.0015188644,0.0009441872,0.0007236714],"domain_scores_gemma":[0.9968473,0.0009348856,0.0003860991,0.0012457543,0.00030279948,0.0002831897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006378489,0.00050936337,0.0005243081,0.0006759703,0.00026134806,0.0006769656,0.0028650335,0.0005127102,0.00015268699],"category_scores_gemma":[0.00032514997,0.0004690311,0.00018092235,0.00047853772,0.0013322379,0.00089700334,0.0007374314,0.0009625985,0.00010157705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033781855,0.0000203215,0.000014135162,0.000039307324,0.00001008888,0.000017951286,0.00033339087,0.00025968094,0.00025113145,0.17521234,0.0002737303,0.8235645],"study_design_scores_gemma":[0.00020262,0.00022828799,0.0000364384,0.00035458512,0.000009665713,0.0000802576,3.2737918e-7,0.10329343,0.011776351,0.88287944,0.00055697013,0.0005816389],"about_ca_topic_score_codex":0.000018133716,"about_ca_topic_score_gemma":0.000010394801,"teacher_disagreement_score":0.8229829,"about_ca_system_score_codex":0.0003648893,"about_ca_system_score_gemma":0.00041663792,"threshold_uncertainty_score":0.9997761},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018234749,0.00021298567,0.9921571,0.0010166619,0.002507203,0.001982273,0.00001647175,0.00012460638,0.00015924167],"genre_scores_gemma":[0.32866174,0.000007617739,0.6691443,0.0014705781,0.000507227,0.00013602387,0.00003299967,0.00002860513,0.000010919604],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99543554,0.00007444575,0.00045604035,0.0019936676,0.0013112534,0.0007290851],"domain_scores_gemma":[0.9967104,0.00053978997,0.000259058,0.0017843287,0.00044471867,0.0002617097],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020582785,0.0004828942,0.0004423655,0.0013502276,0.00024218117,0.0013334072,0.0026869848,0.0004178147,0.000017386854],"category_scores_gemma":[0.00040237178,0.00046177293,0.00012666291,0.0012327179,0.00022436315,0.0010631557,0.00074195664,0.000672789,0.000023037324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083771465,0.000056812267,0.0000368861,0.000030731728,0.0000050293315,0.000003620866,0.0009098958,0.04319413,0.00011264348,0.26591262,0.000020241067,0.689709],"study_design_scores_gemma":[0.00022382007,0.00029617758,0.00079264934,0.00025658586,0.000007899655,0.000005184927,3.8675796e-7,0.49523127,0.0002536515,0.5012681,0.0012201631,0.0004441128],"about_ca_topic_score_codex":0.000020265798,"about_ca_topic_score_gemma":0.00011822951,"teacher_disagreement_score":0.6892649,"about_ca_system_score_codex":0.00034045678,"about_ca_system_score_gemma":0.00033270617,"threshold_uncertainty_score":0.9997834},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003467627,0.000027269762,0.91987175,0.00069915614,0.00038886443,0.07631609,0.000002138287,0.000092145994,0.002599138],"genre_scores_gemma":[0.02915101,0.0000061061064,0.87014604,0.0013882348,0.0009879634,0.097285435,0.000003324233,0.000085971114,0.0009459073],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996458,0.00007234242,0.00086224766,0.0011178432,0.0009969064,0.00049267814],"domain_scores_gemma":[0.9954153,0.00077743764,0.0009711391,0.0021557643,0.0005797773,0.00010062642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012889766,0.0004228465,0.00050130376,0.00030793916,0.00025277364,0.00034203497,0.0051286723,0.000208255,0.000042578857],"category_scores_gemma":[0.00025508084,0.00030264474,0.0001274007,0.0006442061,0.0010557754,0.0006431142,0.0017729476,0.00079870474,0.000052178206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003151586,0.0000132324,0.000032831464,0.0001767104,0.0000047787807,0.0000057989832,0.0006312841,0.00426253,0.00010180584,0.2575835,0.0000042679453,0.7371801],"study_design_scores_gemma":[0.00021435267,0.00006020906,0.000057842724,0.00089267397,0.0000036260535,0.000044372577,2.2449639e-7,0.32545495,0.002697611,0.66793686,0.0022390191,0.0003982167],"about_ca_topic_score_codex":0.000009630692,"about_ca_topic_score_gemma":0.000003844681,"teacher_disagreement_score":0.7367819,"about_ca_system_score_codex":0.00019717062,"about_ca_system_score_gemma":0.0004917931,"threshold_uncertainty_score":0.99994254},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038494126,0.0005602183,0.9944529,0.0007478621,0.0015007411,0.0005096813,0.000013741626,0.00020924864,0.0016206659],"genre_scores_gemma":[0.54296166,0.0005011863,0.44218463,0.005576268,0.0019438365,0.00006135184,0.00013904975,0.00013927092,0.006492741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583644,0.00005530346,0.0005979241,0.00096137036,0.0015047465,0.0010441939],"domain_scores_gemma":[0.9974535,0.00032218633,0.00021763785,0.0011942832,0.00044977048,0.00036261947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017418839,0.0004912218,0.00043173746,0.00083287817,0.00034669932,0.00075104827,0.0028642875,0.00044214842,0.000069444635],"category_scores_gemma":[0.000073773095,0.0004319123,0.00014419589,0.00068726577,0.00061182416,0.0017718268,0.001352689,0.0012578794,0.00019036244],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009025938,0.000043788616,0.0000888013,0.000050729977,0.000006308008,0.000016168011,0.00091938284,0.0007426005,0.0015244513,0.009315788,0.00012997299,0.987153],"study_design_scores_gemma":[0.00091678125,0.0006758167,0.0008363596,0.00054806063,0.00002144578,0.0002077739,0.0000010728785,0.92755806,0.031383824,0.019863702,0.015499085,0.0024880285],"about_ca_topic_score_codex":0.00008258894,"about_ca_topic_score_gemma":0.00001642851,"teacher_disagreement_score":0.984665,"about_ca_system_score_codex":0.000467337,"about_ca_system_score_gemma":0.0007379669,"threshold_uncertainty_score":0.99981326},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024572617,0.0005319078,0.994932,0.00008744039,0.0028335243,0.00042948136,0.0000031470229,0.0005211075,0.0004156854],"genre_scores_gemma":[0.050016023,0.000064443826,0.94932497,0.00026761857,0.00014722184,0.000020009158,0.000004153611,0.000060817612,0.00009476354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955458,0.000057296766,0.0008098712,0.0016537398,0.0009248333,0.0010084786],"domain_scores_gemma":[0.99692386,0.0008850032,0.00027168123,0.0016020775,0.0001373401,0.00018000926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014447857,0.0007279529,0.0008643076,0.0014241101,0.000098675606,0.0002042985,0.004047354,0.0003677086,0.000010924744],"category_scores_gemma":[0.0004494346,0.00072695385,0.00013020412,0.0007453859,0.00029658063,0.0008054587,0.001818833,0.0011009251,0.000031745138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011587813,0.00003235398,0.000078544705,0.00008267193,0.000015344101,0.0003098111,0.0010130581,0.7544364,0.0009238653,0.012155076,0.0000031414431,0.23093815],"study_design_scores_gemma":[0.0010953576,0.00019102854,0.0013056867,0.0016879686,0.000009070986,0.00009737315,1.4788138e-7,0.6946915,0.003093736,0.29479498,0.001138707,0.0018944575],"about_ca_topic_score_codex":0.000044130924,"about_ca_topic_score_gemma":0.00002175437,"teacher_disagreement_score":0.2826399,"about_ca_system_score_codex":0.00056049105,"about_ca_system_score_gemma":0.00019481448,"threshold_uncertainty_score":0.99951816},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012380146,0.0005729977,0.9891167,0.0012550917,0.0029712773,0.00043774518,0.00010267556,0.000071221955,0.005459854],"genre_scores_gemma":[0.21004733,0.0002950142,0.7491332,0.0019404149,0.011820267,0.00004068568,0.0005444791,0.00028636618,0.025892194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98892576,0.00010791866,0.0009556155,0.0029795987,0.0062793233,0.00075179717],"domain_scores_gemma":[0.9897659,0.00232896,0.00051253923,0.005509341,0.001518026,0.00036524405],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006387269,0.0004636925,0.0006620023,0.0017490064,0.00028646906,0.00096518337,0.011581258,0.0003901592,0.00014684016],"category_scores_gemma":[0.0047312807,0.00035207582,0.0000842487,0.0015422872,0.0018861231,0.0010076308,0.00490827,0.0011898609,0.0009167627],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009842054,0.000016334767,0.00005218604,0.0000039928577,0.000004589896,0.0000416115,0.0001343851,0.019493397,0.000044171822,0.00048791972,0.0012603599,0.9784512],"study_design_scores_gemma":[0.00022437995,0.0000908125,0.00022101091,0.000076547854,0.0000047256403,0.00003164239,9.0587434e-7,0.5864283,0.00007255978,0.32376805,0.08864967,0.0004313945],"about_ca_topic_score_codex":0.000018175644,"about_ca_topic_score_gemma":0.00022666802,"teacher_disagreement_score":0.97801983,"about_ca_system_score_codex":0.0005139626,"about_ca_system_score_gemma":0.0017086958,"threshold_uncertainty_score":0.9998931},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008583967,0.0004709144,0.99489576,0.00036631303,0.00162646,0.0005966333,0.0000035580667,0.00014424529,0.0018102718],"genre_scores_gemma":[0.060226455,0.000014126,0.9389041,0.0002577806,0.00026276114,0.000012933005,0.0000019352706,0.00004255599,0.00027736888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996137,0.000054447006,0.000654403,0.00164342,0.00082161685,0.0006890776],"domain_scores_gemma":[0.9966325,0.00070071046,0.0004354554,0.0016186698,0.0004705881,0.0001420872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019628056,0.00052051956,0.00078036217,0.0008003924,0.00021528486,0.00019025474,0.0036705723,0.00049000926,0.000007807157],"category_scores_gemma":[0.0001866228,0.000471658,0.00024179865,0.00038440403,0.00024137636,0.0005184211,0.001178111,0.0008048549,0.0000045059614],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012691055,0.000027000977,0.000052383923,0.00033742253,0.000035109515,0.000033617867,0.0031295707,0.02110676,0.0012445824,0.08366209,0.0000060505035,0.8903527],"study_design_scores_gemma":[0.000325315,0.000092068156,0.000020952062,0.0009230536,0.000020813502,0.00006494225,2.404458e-7,0.7995764,0.007617815,0.19060567,0.0002353938,0.000517351],"about_ca_topic_score_codex":0.00003818851,"about_ca_topic_score_gemma":0.000031755844,"teacher_disagreement_score":0.88983536,"about_ca_system_score_codex":0.00016943211,"about_ca_system_score_gemma":0.00046831937,"threshold_uncertainty_score":0.9997735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074605945,0.0003034265,0.99444485,0.0011386914,0.0021411018,0.000741324,0.000013163624,0.00027133475,0.00087152916],"genre_scores_gemma":[0.2743096,0.000015309606,0.7226433,0.0013539908,0.00085961836,0.000034512093,0.0000242412,0.000047181253,0.0007122532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962767,0.00003766195,0.00065201765,0.0015431594,0.0007578474,0.0007326156],"domain_scores_gemma":[0.99625725,0.0017114352,0.00038724937,0.0011122175,0.00030616313,0.0002256735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008904644,0.0005367763,0.00062301476,0.0014784817,0.00037864098,0.00074144045,0.0028813197,0.00028591967,0.00000904434],"category_scores_gemma":[0.00021809789,0.0005095196,0.00024588848,0.001075393,0.0004039547,0.00038924406,0.0008477137,0.0004988095,0.00009004423],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049664272,0.00002312008,0.000008672248,0.0000601018,0.000012071414,0.000012030927,0.00024258767,0.05849643,0.000035834742,0.13082246,0.00012618047,0.8101556],"study_design_scores_gemma":[0.00033143468,0.00017905077,0.00006755545,0.00013168486,0.000008963574,0.000029436176,4.266544e-8,0.66356045,0.00023784295,0.3319799,0.0029942933,0.00047934387],"about_ca_topic_score_codex":0.000015349133,"about_ca_topic_score_gemma":0.000029281653,"teacher_disagreement_score":0.8096762,"about_ca_system_score_codex":0.00028341563,"about_ca_system_score_gemma":0.00053513586,"threshold_uncertainty_score":0.99973565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009447192,0.0006509209,0.9897069,0.0012147446,0.0010148507,0.0031600625,0.000040328476,0.00032739225,0.002940086],"genre_scores_gemma":[0.34826568,0.00024285154,0.6444002,0.0060454826,0.00045390488,0.00035752894,0.000015273603,0.00006195182,0.00015718449],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963852,0.0000850868,0.0005664685,0.0014417083,0.00070262264,0.00081887975],"domain_scores_gemma":[0.9947387,0.0020888117,0.00030121717,0.0016857499,0.00066229387,0.0005232493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016509781,0.00050706207,0.0007150325,0.0007518236,0.0010205399,0.0002555003,0.0035511241,0.00071355555,0.00021248484],"category_scores_gemma":[0.0022993775,0.00044810525,0.00015404768,0.00059410586,0.0011425066,0.00042264897,0.00048356346,0.000997625,0.00010201689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037167363,0.00014328057,0.00008711724,0.000018173292,0.000015047503,0.0000040912264,0.032519914,0.0007566545,0.000072507166,0.21190315,0.0000042922898,0.7544386],"study_design_scores_gemma":[0.0024744936,0.0059035444,0.00087866426,0.005403365,0.000109836175,0.000020348545,0.00092984206,0.11197628,0.0034198111,0.7193528,0.14478327,0.0047477633],"about_ca_topic_score_codex":0.0020452472,"about_ca_topic_score_gemma":0.011211846,"teacher_disagreement_score":0.74969083,"about_ca_system_score_codex":0.000643486,"about_ca_system_score_gemma":0.00040973554,"threshold_uncertainty_score":0.99979705},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034729153,0.0069754673,0.98571455,0.003446012,0.0016075517,0.00071763655,9.523432e-7,0.0008800547,0.0006230393],"genre_scores_gemma":[0.3286216,0.00009394534,0.6672385,0.0012799603,0.0004407792,0.000041641648,0.000002950025,0.000061713894,0.0022189352],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99445426,0.000105282925,0.0005171394,0.0020581281,0.001952115,0.00091309584],"domain_scores_gemma":[0.99663717,0.00024016369,0.0004496754,0.002016059,0.00043816873,0.0002187605],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017437211,0.00085287425,0.00076404755,0.0009632879,0.00037106688,0.0028623845,0.005585376,0.0005209711,0.0000074369027],"category_scores_gemma":[0.00024940167,0.0006373719,0.00018886401,0.00062442414,0.0008124737,0.0012387177,0.0022737952,0.0013201442,0.000026506234],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009762452,0.000014447668,0.000008176729,0.00014520666,0.000022227408,0.00010735021,0.0008252044,0.0010306177,0.0009961372,0.061222054,0.00007780187,0.93554103],"study_design_scores_gemma":[0.00048230463,0.000588894,0.00000951259,0.0031679722,0.000034147284,0.0002525325,3.9188242e-7,0.043556124,0.08350132,0.8574879,0.008661954,0.0022569476],"about_ca_topic_score_codex":0.000035613008,"about_ca_topic_score_gemma":0.000046624107,"teacher_disagreement_score":0.93328404,"about_ca_system_score_codex":0.0006845798,"about_ca_system_score_gemma":0.0004942059,"threshold_uncertainty_score":0.9997949},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001884796,0.00042574632,0.99385226,0.0007602081,0.0010859994,0.00085507374,0.000029855075,0.000298465,0.0025039238],"genre_scores_gemma":[0.26041523,0.00024517532,0.73703027,0.001670955,0.0001605309,0.00007468731,0.000012558103,0.00004651345,0.00034409357],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942363,0.00022937462,0.0010612337,0.001955359,0.0017123169,0.000805447],"domain_scores_gemma":[0.9944248,0.0011065889,0.0006666332,0.0032936917,0.0003278022,0.00018045827],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019999698,0.00070914166,0.0008817724,0.0006740188,0.00034359194,0.00049266365,0.0074317562,0.00032705738,0.00003721817],"category_scores_gemma":[0.00014536652,0.00047125592,0.00014457916,0.00056703755,0.0011566476,0.0007563372,0.004630822,0.0017029616,0.000010978339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023025517,0.00006127984,0.0007074537,0.000037468097,0.000006598777,0.000063130974,0.00053685583,0.00063418725,0.0010473833,0.08714211,0.00003236496,0.90970814],"study_design_scores_gemma":[0.00074660976,0.000412444,0.020259306,0.0021968493,0.0000082985825,0.000048031638,0.0000011020026,0.06286529,0.0151715325,0.8935525,0.0032179074,0.0015201267],"about_ca_topic_score_codex":0.00016020623,"about_ca_topic_score_gemma":0.00029219902,"teacher_disagreement_score":0.908188,"about_ca_system_score_codex":0.0005715865,"about_ca_system_score_gemma":0.0005685476,"threshold_uncertainty_score":0.9997739},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009145383,0.0005700821,0.9955844,0.00018671635,0.0011491032,0.0008978194,0.00002488313,0.00023408046,0.0012614559],"genre_scores_gemma":[0.51340586,0.000008754363,0.48548853,0.00033629584,0.00048711107,0.0000527214,0.000034518773,0.000032946118,0.00015325948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951619,0.000066826025,0.0007846994,0.0019470083,0.0011417632,0.00089781306],"domain_scores_gemma":[0.99645585,0.00053447415,0.0004702234,0.0017222567,0.0005429973,0.0002741957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019108681,0.00064635085,0.001071664,0.0021131444,0.00032594157,0.0007749174,0.0028793477,0.0004404607,0.000013197567],"category_scores_gemma":[0.00007267742,0.0006241041,0.00048841065,0.0015047635,0.00027554503,0.0013294676,0.0010184527,0.000640274,0.000029217661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011621492,0.00007951908,0.0004219348,0.00009991245,0.00020496936,0.0000080395175,0.0010806641,0.16049817,0.000028937277,0.0026312827,0.000008771284,0.8349262],"study_design_scores_gemma":[0.00026940397,0.00006846718,0.000045219593,0.00008379321,0.0000976217,0.000028422008,2.5531227e-7,0.9870558,0.000070806556,0.011131128,0.00040189322,0.0007471923],"about_ca_topic_score_codex":0.00011749635,"about_ca_topic_score_gemma":0.00014919628,"teacher_disagreement_score":0.834179,"about_ca_system_score_codex":0.0003925698,"about_ca_system_score_gemma":0.00048877177,"threshold_uncertainty_score":0.99962103},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001503636,0.00060205365,0.99573654,0.00042633124,0.0004504751,0.00041778854,0.0000051297925,0.00047822317,0.0017331121],"genre_scores_gemma":[0.02994589,0.000048329515,0.96814907,0.0008142023,0.00024623855,0.000008568728,0.00001145634,0.00003213003,0.00074411306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996985,0.00003776162,0.00041106567,0.0013012202,0.00078129827,0.000483619],"domain_scores_gemma":[0.9980168,0.00026496197,0.0002676874,0.0010461815,0.00023814455,0.00016625726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004955979,0.00048138862,0.00041987785,0.00074506825,0.00023049788,0.0006774972,0.0018325914,0.00034943508,0.000028254477],"category_scores_gemma":[0.000106723506,0.00042861514,0.000072936455,0.0004308393,0.00036435408,0.00042669036,0.0013444051,0.0007701063,0.00003253391],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000210797,0.000014651274,0.000085713225,0.000032553347,0.000008774062,0.00004007709,0.0014237497,0.06870601,0.000046610487,0.010569538,0.000054614513,0.9190156],"study_design_scores_gemma":[0.00046254028,0.0002242717,0.0012442202,0.0006639757,0.00001278126,0.00025634826,5.461583e-7,0.5714688,0.0016322505,0.42149377,0.0010505527,0.0014900131],"about_ca_topic_score_codex":0.000043913944,"about_ca_topic_score_gemma":0.0000387231,"teacher_disagreement_score":0.9175256,"about_ca_system_score_codex":0.00015427658,"about_ca_system_score_gemma":0.0002457329,"threshold_uncertainty_score":0.99981654},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030001355,0.00039171914,0.98810923,0.0003568465,0.00037941546,0.00027025392,0.0000028208779,0.00013805814,0.0100516435],"genre_scores_gemma":[0.65270454,0.00020061313,0.34587538,0.00054879964,0.00010173977,0.00000712855,0.0000021432504,0.000023395833,0.00053625245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997602,0.0000560863,0.00048050407,0.00077616493,0.0006350299,0.0004502133],"domain_scores_gemma":[0.997664,0.00039528107,0.00038288592,0.0012103947,0.000270078,0.000077400604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009214949,0.000400947,0.0004188583,0.00047011377,0.00027596255,0.00027136883,0.0029296274,0.00015714914,0.0000136829685],"category_scores_gemma":[0.00005147259,0.00027546525,0.00018163977,0.00056175113,0.0008832356,0.00039728548,0.0006352863,0.00056375505,0.0000050590015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010823365,0.000039930277,0.00031794416,0.00007701946,0.00004429217,0.000021021415,0.0027233239,0.51051056,0.000028824603,0.032147165,0.00016678864,0.45391232],"study_design_scores_gemma":[0.00011027079,0.00037858018,0.0002586649,0.00031013915,0.000005414701,0.000054855434,3.2811428e-7,0.92702585,0.0020820785,0.069108695,0.000264567,0.0004005321],"about_ca_topic_score_codex":0.000018810695,"about_ca_topic_score_gemma":0.000005336324,"teacher_disagreement_score":0.65240455,"about_ca_system_score_codex":0.00020128467,"about_ca_system_score_gemma":0.0005777438,"threshold_uncertainty_score":0.9999698},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012382792,0.0006509366,0.9964409,0.0004001866,0.000754188,0.00040783605,0.00008444753,0.00024210753,0.0008955881],"genre_scores_gemma":[0.0355239,0.00013303451,0.9606897,0.0012682067,0.0013161878,0.000026400521,0.0003642271,0.00006663077,0.0006117125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99487925,0.00004437408,0.00047894815,0.0026958406,0.0011919197,0.0007096795],"domain_scores_gemma":[0.9947195,0.00086694246,0.00030250323,0.0036744738,0.00024245736,0.00019412352],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007826943,0.0006389354,0.00064694515,0.0005955854,0.00031385585,0.0017364947,0.010572331,0.00019007717,0.000025206948],"category_scores_gemma":[0.00012703468,0.0004934179,0.000049413047,0.0011944243,0.0007414563,0.0020155853,0.005003014,0.0007681549,0.00004157918],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014772507,0.00005475311,0.0006117915,0.00015885642,0.000072725576,0.0001589792,0.00060873065,0.0067628156,0.000019814,0.006859652,0.0002510852,0.984426],"study_design_scores_gemma":[0.0009925542,0.0006882654,0.00058253546,0.0017164066,0.00012645296,0.0000496381,0.0000012486386,0.7937054,0.0007793279,0.05681631,0.14146832,0.0030735186],"about_ca_topic_score_codex":0.000090566515,"about_ca_topic_score_gemma":0.0005232989,"teacher_disagreement_score":0.9813525,"about_ca_system_score_codex":0.000094749186,"about_ca_system_score_gemma":0.0005584239,"threshold_uncertainty_score":0.99975175},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008104444,0.0029183284,0.991088,0.00012596672,0.0006679016,0.0008569165,0.0000037578309,0.00021114342,0.004046955],"genre_scores_gemma":[0.40467775,0.000060693303,0.59417814,0.00016357315,0.00053343555,0.000036768142,0.0000031295438,0.00004181567,0.0003047106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963846,0.00003423976,0.00038256423,0.0014880956,0.00070263585,0.0010078708],"domain_scores_gemma":[0.9976891,0.000560543,0.00021543806,0.0008937176,0.00037930522,0.0002618685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014634972,0.0005362496,0.0005869141,0.00050735864,0.0004812747,0.0007557696,0.0019754749,0.00030800106,0.0000031453765],"category_scores_gemma":[0.00002416709,0.0003942669,0.00009103423,0.00036783877,0.0005310543,0.0006617958,0.0010034576,0.00060677767,0.00001498166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021375878,0.00005255175,0.00019255302,0.0010844516,0.00003953773,0.00005270818,0.0058907596,0.34374672,0.000096324846,0.32566762,0.000009882406,0.3231455],"study_design_scores_gemma":[0.00033295047,0.00027848984,0.000009512942,0.0008969058,0.000013928907,0.00020019292,8.185649e-7,0.95974463,0.0003120749,0.036979575,0.0006368107,0.00059413526],"about_ca_topic_score_codex":0.000025777372,"about_ca_topic_score_gemma":0.000037228387,"teacher_disagreement_score":0.61599785,"about_ca_system_score_codex":0.00027999526,"about_ca_system_score_gemma":0.0004236012,"threshold_uncertainty_score":0.9998509},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028578466,0.000793639,0.9910959,0.00035873248,0.0010455684,0.0007793543,0.0000034461327,0.00036882967,0.0052687256],"genre_scores_gemma":[0.24022204,0.0000070533265,0.7576776,0.0015831225,0.00020037056,0.000055460652,0.000009119984,0.000030947293,0.0002142675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957668,0.000053256965,0.0005048182,0.0019304637,0.00069141306,0.0010532096],"domain_scores_gemma":[0.9966074,0.00072834117,0.00029133642,0.0018269271,0.00035818975,0.00018775622],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092585234,0.00062022917,0.0007225254,0.00092028256,0.00035569677,0.00075759913,0.004354387,0.0005080337,0.000022529182],"category_scores_gemma":[0.00019146435,0.00053025526,0.00018924176,0.00046534458,0.0006342826,0.0007730324,0.00039460004,0.0006229896,0.00001728472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037532995,0.00018981275,0.00026348763,0.00017953926,0.000040613893,0.00004946539,0.0018421934,0.041127767,0.00050743646,0.23261768,0.0002266911,0.7229178],"study_design_scores_gemma":[0.00030008587,0.00050072157,0.00022990331,0.00009338049,0.00000918808,0.0000411104,8.1215796e-7,0.9122499,0.0010538915,0.08430588,0.0005689379,0.00064614706],"about_ca_topic_score_codex":0.00005319113,"about_ca_topic_score_gemma":0.000029875479,"teacher_disagreement_score":0.8711222,"about_ca_system_score_codex":0.00022284916,"about_ca_system_score_gemma":0.0008126979,"threshold_uncertainty_score":0.9997149},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48515302,0.000091081245,0.51344955,0.0003136755,0.0006001895,0.00034906468,5.086389e-7,0.000031964413,0.000010975614],"genre_scores_gemma":[0.9686267,0.000010567916,0.030297581,0.0008036816,0.00022664087,0.000018286604,0.0000017791568,0.000008467893,0.000006319098],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998961,0.000023629866,0.0001627228,0.00030012854,0.00021752458,0.000335035],"domain_scores_gemma":[0.99948734,0.00009554883,0.00005262554,0.00017874414,0.00005876194,0.00012699616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039563215,0.00011975424,0.00016690683,0.00024529133,0.00014804809,0.000045373286,0.00009406374,0.00005951487,0.000007176693],"category_scores_gemma":[0.00007879004,0.00010219904,0.000033367123,0.0004347142,0.00010618544,0.00012162551,0.00011920932,0.000113876195,0.0000071843647],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012823826,0.00012410358,0.0064108497,0.00006503561,0.000007510992,0.000011809254,0.0004801726,0.00024929675,0.06088764,0.000053456795,0.000017473156,0.9315644],"study_design_scores_gemma":[0.0045809885,0.0018456079,0.26666284,0.00034402194,0.00007233492,0.0019829234,0.000014973766,0.20864591,0.5072519,0.0018262522,0.0061183427,0.0006538735],"about_ca_topic_score_codex":0.000037344256,"about_ca_topic_score_gemma":0.00004203912,"teacher_disagreement_score":0.9309105,"about_ca_system_score_codex":0.00014206213,"about_ca_system_score_gemma":0.00002375037,"threshold_uncertainty_score":0.4167556},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008986468,0.0004291244,0.99495596,0.0009220618,0.000530051,0.0010371581,0.000053905525,0.00008528804,0.0018965631],"genre_scores_gemma":[0.03709775,0.00008325886,0.9616051,0.00026968258,0.00030677844,0.00023242368,0.000015141144,0.000034287474,0.00035559718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636394,0.000018930099,0.00083207875,0.0013580874,0.0007765968,0.0006503767],"domain_scores_gemma":[0.9965527,0.0012099956,0.00041687436,0.001252589,0.00041478509,0.00015302618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049786014,0.0004677295,0.0006497763,0.0009226225,0.00023477421,0.00012799683,0.0031317812,0.0003657872,0.000029347973],"category_scores_gemma":[0.00012424657,0.00044512062,0.00019706915,0.00075772847,0.0006815227,0.0007870048,0.0009402452,0.0004762882,0.000037133173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008567984,0.00017739863,0.00013301983,0.00010802323,0.000026605723,0.000015560128,0.00048618912,0.04680672,0.00018466526,0.1611338,0.00035386172,0.7905656],"study_design_scores_gemma":[0.00022922909,0.00010656734,0.00069557293,0.00032824927,0.000007517775,0.000029666277,4.4168135e-7,0.797232,0.00046063968,0.19841239,0.0020599598,0.000437769],"about_ca_topic_score_codex":0.00009943001,"about_ca_topic_score_gemma":0.000071379254,"teacher_disagreement_score":0.7901278,"about_ca_system_score_codex":0.00038772743,"about_ca_system_score_gemma":0.000697356,"threshold_uncertainty_score":0.9998},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000099433986,0.0021287645,0.99005973,0.00038927438,0.0024241984,0.00031585072,0.00001553184,0.00017901759,0.004388171],"genre_scores_gemma":[0.63746226,0.000058185342,0.36113563,0.0007509034,0.00027096632,0.000014033506,0.000018085062,0.000040448605,0.00024951206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956797,0.000061631465,0.00075860054,0.0014533007,0.001052511,0.0009942695],"domain_scores_gemma":[0.9977084,0.00055154436,0.00033628274,0.0010287656,0.0002014343,0.0001736061],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011726681,0.0005739785,0.00068306265,0.0006053185,0.00040264236,0.00041204426,0.0022854963,0.000398428,0.00005672705],"category_scores_gemma":[0.000087185545,0.00057717843,0.00017351023,0.00072207034,0.0005444661,0.0016309976,0.00051663414,0.0012403348,0.000045010085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014484435,0.00006313652,0.00021329285,0.000114813185,0.000025651621,0.00032667076,0.0047048447,0.0980857,0.00014307826,0.02511803,0.000016201177,0.8711741],"study_design_scores_gemma":[0.0011452389,0.00015985423,0.0006159577,0.0032225626,0.000018714463,0.00048478896,0.00001001256,0.91768306,0.00015809915,0.07085883,0.0037929676,0.0018499155],"about_ca_topic_score_codex":0.000108510714,"about_ca_topic_score_gemma":0.0001644043,"teacher_disagreement_score":0.8693242,"about_ca_system_score_codex":0.0007457281,"about_ca_system_score_gemma":0.00068567763,"threshold_uncertainty_score":0.99966794},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030386384,0.0009836354,0.9835889,0.00036912636,0.0026852922,0.0007229434,0.000014882242,0.00026183488,0.011069519],"genre_scores_gemma":[0.17385063,0.00008431538,0.81696475,0.003498746,0.0030316466,0.000050676186,0.00006004443,0.00014064719,0.0023185532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99560666,0.000108257154,0.0006294992,0.0017062742,0.0011727556,0.00077656034],"domain_scores_gemma":[0.99698484,0.0005550048,0.00044453214,0.0012931047,0.00046460514,0.000257925],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000939561,0.0006716519,0.0006717652,0.0010631807,0.00028087152,0.001044967,0.0023950406,0.0005584757,0.00012312827],"category_scores_gemma":[0.00013209884,0.0005936616,0.0001926917,0.0007241933,0.00039577464,0.0010871515,0.0008163785,0.0009935288,0.0005324381],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029334326,0.000023411421,0.000012642189,0.00005528595,0.000018130511,0.00010893532,0.0014202929,0.0012534615,0.00058899785,0.00088669464,0.00012695174,0.99550223],"study_design_scores_gemma":[0.0022212842,0.00081051636,0.0006707013,0.006856029,0.00010683832,0.0032445742,0.000006760397,0.603034,0.022069903,0.34448346,0.009272064,0.007223842],"about_ca_topic_score_codex":0.00016581996,"about_ca_topic_score_gemma":0.00010999363,"teacher_disagreement_score":0.98827845,"about_ca_system_score_codex":0.000361689,"about_ca_system_score_gemma":0.00046229438,"threshold_uncertainty_score":0.9999921},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045663162,0.00031772171,0.9965126,0.0000040544874,0.0011636666,0.00019273689,0.000004618585,0.00006486892,0.0012831102],"genre_scores_gemma":[0.15667288,0.00004465285,0.8429412,0.000030080093,0.00023436749,0.000001585368,0.000018619186,0.00004061534,0.000015964197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986625,0.0000086424425,0.0003357982,0.0003506564,0.00034044366,0.0003019914],"domain_scores_gemma":[0.9993448,0.000045956807,0.00011439466,0.00037308552,0.00004895757,0.000072775016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002708074,0.00027096824,0.00032904767,0.00035829542,0.000055987723,0.00004782828,0.00033327565,0.00026875015,0.000013190569],"category_scores_gemma":[0.000005649324,0.00026989603,0.00008456773,0.00014677826,0.00010558516,0.0002217756,0.000108879714,0.0003140972,0.0000042773577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019082202,0.000009115909,0.000008318126,0.00008412104,0.000007814194,0.0000016644962,0.00007200869,0.933136,0.0005805442,0.004504628,7.057582e-7,0.061593175],"study_design_scores_gemma":[0.00007623048,0.000026060665,0.000041290346,0.00014430314,0.000015507461,0.00002899872,1.0692427e-7,0.9668288,0.000180894,0.032390136,0.000006211588,0.0002614324],"about_ca_topic_score_codex":0.000009573477,"about_ca_topic_score_gemma":0.0000033910924,"teacher_disagreement_score":0.15621625,"about_ca_system_score_codex":0.0002264637,"about_ca_system_score_gemma":0.000035277193,"threshold_uncertainty_score":0.9999753},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000079464284,0.000073133066,0.9504423,0.000007524464,0.00042069925,0.047874704,0.000016725116,0.0003664364,0.00071899634],"genre_scores_gemma":[0.218312,0.000025692538,0.6009764,0.00012706299,0.0003591477,0.1796729,0.000024432426,0.00020439249,0.00029799476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984483,0.00000660539,0.00036635206,0.0005885786,0.00022822517,0.00036191696],"domain_scores_gemma":[0.9991318,0.00008116121,0.00014457965,0.00049275573,0.000090196074,0.000059518938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022435965,0.00029486595,0.0002813613,0.00037300098,0.00012362786,0.00006443134,0.0005641008,0.0002482345,0.0000088801735],"category_scores_gemma":[0.000025631693,0.00028797504,0.000034853954,0.00016691987,0.00023076672,0.0001424376,0.00021122245,0.0002999833,0.00001114752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000302245,0.000053749318,0.00035912034,0.0028632828,0.00006655999,0.000026136537,0.0012018876,0.07148578,0.0013622708,0.03791145,0.000069247886,0.8845703],"study_design_scores_gemma":[0.001129877,0.00031252345,0.00007383728,0.0015141056,0.00002995811,0.000051122945,0.0000013825473,0.9380488,0.009766202,0.030303791,0.01791801,0.00085040426],"about_ca_topic_score_codex":0.000001492995,"about_ca_topic_score_gemma":0.000008315422,"teacher_disagreement_score":0.88371986,"about_ca_system_score_codex":0.00041645672,"about_ca_system_score_gemma":0.000045144046,"threshold_uncertainty_score":0.99995726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002953781,0.00019638144,0.99506825,0.00011689659,0.00042164742,0.000328988,0.000003832264,0.0016771049,0.0018915064],"genre_scores_gemma":[0.36390075,0.000007937376,0.6356226,0.00030737682,0.00009114742,0.000004282173,0.0000021204535,0.00002536234,0.000038422404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966793,0.000028395436,0.00062060903,0.00118298,0.00093972095,0.00054896873],"domain_scores_gemma":[0.997229,0.0003372233,0.00047537097,0.0013902888,0.00044035123,0.00012779488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000731945,0.00048571682,0.00060373265,0.00086396275,0.00021076847,0.00033008904,0.002672267,0.00033855165,0.000006105044],"category_scores_gemma":[0.000054866596,0.0004688455,0.00014257821,0.00048725546,0.00052690477,0.0009523671,0.0013323766,0.0006166947,0.0000055671676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021966393,0.000027417585,0.000028136092,0.00005751589,0.0000073979486,0.0000123901045,0.00047256882,0.75701153,0.00093557464,0.022662425,0.000034801637,0.21874808],"study_design_scores_gemma":[0.000060746497,0.000036805348,0.0000040678833,0.0005383918,0.000004953419,0.00003459582,8.932856e-9,0.573627,0.0013896105,0.42402124,0.000002770765,0.00027982355],"about_ca_topic_score_codex":0.000111168425,"about_ca_topic_score_gemma":0.0000042240576,"teacher_disagreement_score":0.4013588,"about_ca_system_score_codex":0.0002776106,"about_ca_system_score_gemma":0.00045741504,"threshold_uncertainty_score":0.9997763},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003231606,0.0005272396,0.99514824,0.0001226264,0.0012756097,0.0002040665,0.000009606928,0.00015779953,0.0022316321],"genre_scores_gemma":[0.27110904,0.00019746064,0.7245877,0.0020682288,0.0015241257,0.0000110688525,0.000033231096,0.00006718151,0.00040195053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968174,0.00009130264,0.00045482995,0.0011251309,0.00087017525,0.0006411405],"domain_scores_gemma":[0.9981039,0.00030018997,0.0003125136,0.0008201766,0.00023673792,0.00022646204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010778852,0.00045620603,0.00045867934,0.0009969485,0.00026172653,0.0004494471,0.0016151133,0.0003544432,0.00018812087],"category_scores_gemma":[0.00008638977,0.00040801425,0.00021384795,0.00057068496,0.00042812742,0.0010582336,0.00084501243,0.0006559766,0.00023144633],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004146429,0.000023493172,0.00001054967,0.00001612322,0.000008074172,0.000016255162,0.0004221944,0.0024211227,0.0011640919,0.0009771787,0.0000039424644,0.99493283],"study_design_scores_gemma":[0.00043989372,0.00009086803,0.000039657658,0.0010544696,0.000050768405,0.00012354515,7.6032563e-7,0.57364583,0.019621195,0.40178898,0.0016828687,0.0014611661],"about_ca_topic_score_codex":0.00000739831,"about_ca_topic_score_gemma":0.000008725762,"teacher_disagreement_score":0.9934717,"about_ca_system_score_codex":0.00023787619,"about_ca_system_score_gemma":0.00026477175,"threshold_uncertainty_score":0.99983716},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014896895,0.001460525,0.9922973,0.0031114193,0.00074294186,0.00032507445,0.0000120356035,0.000037003043,0.0005240121],"genre_scores_gemma":[0.65173084,0.00035856495,0.3418357,0.0053824335,0.0006363971,0.000008836612,0.0000110588835,0.000025931638,0.000010203258],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691814,0.00013990008,0.00051922206,0.0010693412,0.0008268007,0.00052659365],"domain_scores_gemma":[0.9973336,0.0008126863,0.00035321596,0.0012974199,0.000092309965,0.00011077259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027921752,0.0003460892,0.0005047674,0.00061991176,0.00023877867,0.0003322353,0.0040291934,0.00018990008,0.0000068452428],"category_scores_gemma":[0.00013531449,0.0002650042,0.00009987719,0.00072742905,0.0005837237,0.0003996086,0.002040601,0.00093961385,0.0000013419634],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015173336,0.000056367655,0.0015706053,0.00041610762,0.0000127947205,0.000038312348,0.028171506,0.0007183922,0.000030175137,0.20015575,0.0002832093,0.7685316],"study_design_scores_gemma":[0.00055051234,0.0005632526,0.0030037258,0.0019418433,0.000007772708,0.00018968238,0.000007181661,0.47670662,0.00010109195,0.5047456,0.011212835,0.00096985867],"about_ca_topic_score_codex":0.00029819,"about_ca_topic_score_gemma":0.00083299255,"teacher_disagreement_score":0.76756173,"about_ca_system_score_codex":0.00007808853,"about_ca_system_score_gemma":0.00036894818,"threshold_uncertainty_score":0.9999802},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024444478,0.00018042423,0.9957507,0.00079918094,0.0010394878,0.0016519442,0.000015334348,0.00032015052,0.00021828622],"genre_scores_gemma":[0.015272333,0.0000162006,0.9814774,0.0025419348,0.00048260836,0.00007980878,0.000023417731,0.000044319873,0.00006200636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951186,0.00011826478,0.0009344873,0.0016662881,0.0013098874,0.0008524726],"domain_scores_gemma":[0.9969118,0.00023734945,0.0004912811,0.0012959385,0.0005976807,0.00046590448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012918082,0.00068616314,0.0006638038,0.0008790364,0.00042972466,0.0009827012,0.0020552129,0.00030690234,0.000074937816],"category_scores_gemma":[0.00014609721,0.0006384857,0.00017994792,0.0010344475,0.0011719252,0.0018753231,0.00069573283,0.0008731336,0.00008604187],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021285749,0.00026501258,0.0000031088312,0.00014262619,0.000014101016,0.00009189992,0.001123117,0.0026498162,0.04185479,0.00052534696,0.00008368306,0.9532252],"study_design_scores_gemma":[0.00072154315,0.0004930944,0.000006967166,0.0008408479,0.000024514797,0.00007299648,5.1632827e-7,0.8504076,0.14460075,0.0014672239,0.0005699448,0.0007940283],"about_ca_topic_score_codex":0.000067205394,"about_ca_topic_score_gemma":0.00006406881,"teacher_disagreement_score":0.9524312,"about_ca_system_score_codex":0.0007051508,"about_ca_system_score_gemma":0.00113279,"threshold_uncertainty_score":0.99960667},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025196178,0.0014734635,0.9884108,0.00040673377,0.0042185285,0.00046046273,0.0000016930016,0.00027813218,0.0022305972],"genre_scores_gemma":[0.6823605,0.00014069988,0.31493312,0.0006723107,0.0011932418,0.000018412686,0.000016868751,0.00010113681,0.0005637508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99368703,0.00010947489,0.00099248,0.0023568969,0.0015152727,0.0013388338],"domain_scores_gemma":[0.9961289,0.0006240093,0.00053848885,0.0018787399,0.0004891904,0.0003406776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016425237,0.0008343392,0.00085596624,0.0014164258,0.00021665113,0.0006097414,0.0037307444,0.0008305722,0.000013912281],"category_scores_gemma":[0.00009611651,0.0008343892,0.00015740319,0.0017234901,0.000660024,0.00076969137,0.0014725188,0.0016948796,0.000044649114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006727252,0.0000310858,0.00012152669,0.000011749542,0.000006072355,0.00021706014,0.00036083965,0.7657983,0.000019141302,0.011968488,0.000008926962,0.22145012],"study_design_scores_gemma":[0.00043872534,0.00010536881,0.00009034973,0.0008826204,0.00000634216,0.00007150243,4.7491199e-7,0.9846711,0.0001223819,0.012549951,0.00016256743,0.0008986208],"about_ca_topic_score_codex":0.000058765607,"about_ca_topic_score_gemma":0.00021005646,"teacher_disagreement_score":0.6798408,"about_ca_system_score_codex":0.0007712837,"about_ca_system_score_gemma":0.0006077019,"threshold_uncertainty_score":0.9994107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029405332,0.00021884491,0.99439836,0.00052986183,0.00043574878,0.0005190694,0.00012683586,0.00010646424,0.00072428177],"genre_scores_gemma":[0.91393614,0.000012677643,0.08567111,0.000121292906,0.00010012442,0.0000124788485,0.000080755395,0.000024909554,0.00004048809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679464,0.00004823319,0.00087839185,0.0010532053,0.00079659553,0.0004289203],"domain_scores_gemma":[0.9971878,0.00023277778,0.00042739758,0.0017928805,0.00021099087,0.000148186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042906756,0.00041238664,0.00063865527,0.001098203,0.00012995441,0.000090638634,0.0027638294,0.00033304468,0.000039460185],"category_scores_gemma":[0.000029340108,0.00040690528,0.00015832669,0.0010745281,0.0011486448,0.00027808806,0.00045039738,0.0005477586,0.000012305839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012355378,0.00048652416,0.000056853187,0.00031683635,0.00004771955,0.000050713486,0.0036136492,0.1119679,0.020928495,0.2806498,0.00004593595,0.5818232],"study_design_scores_gemma":[0.0010737865,0.00038869336,0.0001391677,0.0004898604,0.000034089033,0.000062723986,0.0000015816572,0.84455377,0.038218062,0.113285914,0.0011367752,0.0006155505],"about_ca_topic_score_codex":0.000057854264,"about_ca_topic_score_gemma":0.00013986575,"teacher_disagreement_score":0.9109956,"about_ca_system_score_codex":0.00017107793,"about_ca_system_score_gemma":0.0007864385,"threshold_uncertainty_score":0.9998383},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039964616,0.0010039961,0.99368453,0.00075296196,0.0014594983,0.00038849283,0.000008243349,0.00035448084,0.002307856],"genre_scores_gemma":[0.05607391,0.00006884468,0.92504793,0.001912757,0.0052073197,0.000041157367,0.00005419862,0.00016349231,0.011430406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653345,0.000059764832,0.00044031919,0.0013167871,0.0006989465,0.0009507036],"domain_scores_gemma":[0.99762326,0.0006921363,0.0003293816,0.00094941835,0.00017375061,0.00023206996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012096601,0.00057163177,0.0005962308,0.00062586804,0.00038242462,0.00052750576,0.0025453991,0.00033843782,0.00007442166],"category_scores_gemma":[0.00015441657,0.00051665254,0.00019975766,0.00033302113,0.0002904116,0.00045456874,0.0009936254,0.0011077586,0.00022170949],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026082214,0.000017393693,0.00007578966,0.00003004046,0.000012685363,0.000019891366,0.00057568855,0.006478002,0.00012312402,0.00020037647,0.00010919551,0.9923552],"study_design_scores_gemma":[0.0004413792,0.00028083895,0.00012899912,0.00023302139,0.000016745682,0.00007618902,3.2767838e-7,0.96949154,0.00062302453,0.0024489902,0.025306761,0.0009521989],"about_ca_topic_score_codex":0.00005721967,"about_ca_topic_score_gemma":0.000010433129,"teacher_disagreement_score":0.991403,"about_ca_system_score_codex":0.0001652482,"about_ca_system_score_gemma":0.00026087795,"threshold_uncertainty_score":0.9997285},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050595533,0.006733449,0.9824487,0.0009103843,0.002179214,0.0006309512,0.000002476888,0.00004736278,0.0019879139],"genre_scores_gemma":[0.9861627,0.0009832191,0.011348395,0.00064150296,0.0004179703,0.0000135989785,8.686587e-7,0.00002183584,0.00040987346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714553,0.00005700523,0.0004080792,0.0009839257,0.00076392264,0.00064153946],"domain_scores_gemma":[0.9976396,0.0011160823,0.00022933197,0.0007149237,0.0001345737,0.00016547753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016733349,0.00036929274,0.0003992038,0.00052493106,0.00025131874,0.0002122031,0.0024742128,0.0001516523,0.000011614102],"category_scores_gemma":[0.00019178372,0.00025689573,0.000075547185,0.0007651305,0.00048670595,0.00058202416,0.0011899342,0.00046497487,0.000017788307],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057322823,0.000009294041,0.0002476378,0.000026265638,0.0000032049127,0.000009573302,0.0005786067,0.0011239052,0.00048032377,0.011231791,0.00000972628,0.98627394],"study_design_scores_gemma":[0.0018161907,0.0025308644,0.014901483,0.0041784993,0.000038663566,0.00016310795,0.0000036757224,0.62293583,0.085535854,0.25600398,0.0086338725,0.0032579643],"about_ca_topic_score_codex":0.000027060198,"about_ca_topic_score_gemma":0.00018023807,"teacher_disagreement_score":0.98301595,"about_ca_system_score_codex":0.000059836122,"about_ca_system_score_gemma":0.00032936796,"threshold_uncertainty_score":0.9999883},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006265857,0.000754766,0.99247825,0.00029092515,0.0032630952,0.00072701205,0.00000600663,0.00033411625,0.0020831781],"genre_scores_gemma":[0.21478632,0.000058056983,0.78157884,0.000844069,0.0021915862,0.00005506215,0.000039964692,0.000058304056,0.00038781203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652517,0.000043370055,0.0005336376,0.0012324803,0.0007969888,0.0008683503],"domain_scores_gemma":[0.99739915,0.00067403633,0.00035773218,0.0010078531,0.0003343562,0.0002268983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014104642,0.00048064778,0.00052745786,0.0005947313,0.00033623743,0.00050597975,0.0024496831,0.00041208914,0.0000043262216],"category_scores_gemma":[0.00014431823,0.00045089264,0.00017999578,0.00042510024,0.00019840729,0.0013751161,0.0006914484,0.00059006386,0.000047841353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010229397,0.000035169345,0.000103050945,0.000089157234,0.00001660453,0.00001383245,0.0017759181,0.0984892,0.00019868526,0.115519404,0.000046640736,0.78370214],"study_design_scores_gemma":[0.00027931336,0.00023308574,0.000056501645,0.00015842284,0.000008276006,0.000023814348,1.4916856e-7,0.70817745,0.00053900556,0.28746364,0.0025088987,0.00055140717],"about_ca_topic_score_codex":0.00004104248,"about_ca_topic_score_gemma":0.000045555964,"teacher_disagreement_score":0.7831507,"about_ca_system_score_codex":0.00030654532,"about_ca_system_score_gemma":0.00046835726,"threshold_uncertainty_score":0.9997943},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013531704,0.00016747326,0.99520993,0.00084475597,0.0015333733,0.00057299435,0.000010935092,0.00026442634,0.0012607899],"genre_scores_gemma":[0.06293544,0.000019294088,0.9336842,0.0028266562,0.00040449481,0.000014073156,0.000019445564,0.000056375913,0.000040043058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952457,0.00007967412,0.0005999192,0.0021105453,0.0012440461,0.0007200972],"domain_scores_gemma":[0.9966593,0.00080738345,0.00041866244,0.0015509903,0.00029213258,0.0002715465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012117019,0.00075278356,0.00056900154,0.0012636195,0.0003684891,0.00080329395,0.0019604003,0.00053613004,0.000049942384],"category_scores_gemma":[0.00014511909,0.0007473186,0.00016971018,0.00056688493,0.0008115721,0.0009861619,0.0007317933,0.0012339919,0.000077987264],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014696334,0.0003667863,0.00005322221,0.00027005567,0.000030010786,0.00029225065,0.0012566892,0.029184293,0.030837491,0.120059304,0.00004834469,0.8174546],"study_design_scores_gemma":[0.0005053272,0.0005096187,0.00046103532,0.001479426,0.000019690991,0.00007018666,7.345366e-8,0.7543745,0.005804071,0.2357361,0.00013678343,0.0009031724],"about_ca_topic_score_codex":0.00004137708,"about_ca_topic_score_gemma":0.000008898324,"teacher_disagreement_score":0.8165514,"about_ca_system_score_codex":0.0005304668,"about_ca_system_score_gemma":0.00041873564,"threshold_uncertainty_score":0.9994978},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018544688,0.00010927521,0.98922706,0.00010455107,0.00014177432,0.00027349248,0.000020414052,0.000048626214,0.008220323],"genre_scores_gemma":[0.5769007,0.000011541135,0.4218661,0.00029602088,0.00014595094,0.0000026206556,0.0000011878931,0.000017153767,0.00075871235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996461,0.000016255473,0.00083296123,0.0009128623,0.0014908686,0.00028609807],"domain_scores_gemma":[0.9970533,0.0008048928,0.0005300961,0.0010747904,0.00044076372,0.000096130025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013476454,0.00026336277,0.00043442694,0.000939196,0.00017467194,0.00021458039,0.0018278317,0.00023216434,0.000108101485],"category_scores_gemma":[0.00016864443,0.00021759332,0.00014307217,0.0006701351,0.0004960458,0.00028747984,0.00038447874,0.00034116808,0.000027884375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023414345,0.000014114127,0.000042532007,0.000003663813,0.0000011570016,8.92554e-7,0.00022284173,0.78169084,0.006579267,0.004080953,0.00001756219,0.20734385],"study_design_scores_gemma":[0.000056720113,0.000015479158,0.0000065747054,0.00005809035,0.000004473016,0.0000041250823,1.8459659e-7,0.77011704,0.01501378,0.21397616,0.00056605716,0.00018132407],"about_ca_topic_score_codex":0.000027745291,"about_ca_topic_score_gemma":0.00003316488,"teacher_disagreement_score":0.57504624,"about_ca_system_score_codex":0.00015517986,"about_ca_system_score_gemma":0.0003425873,"threshold_uncertainty_score":0.8873198},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032755048,0.0010964046,0.9811771,0.00008789792,0.0017361562,0.00018243199,0.000001254864,0.00024258909,0.015443418],"genre_scores_gemma":[0.8720561,0.00006279628,0.12382052,0.00092452246,0.0019601027,0.000011147056,0.0000067644755,0.000101921454,0.0010561221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845666,0.000008694102,0.00029494637,0.00038965835,0.00037775468,0.00047227458],"domain_scores_gemma":[0.99917567,0.00012698465,0.00006298787,0.00045814578,0.00005720067,0.00011902757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029633637,0.00032320755,0.00031226844,0.00028710556,0.00011122354,0.00013448854,0.0006312824,0.00020608901,0.00014243872],"category_scores_gemma":[0.000020340318,0.00030836472,0.00007872121,0.00014461635,0.00017476118,0.00019518449,0.00014232278,0.00058027974,0.000145219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.720742e-7,0.000004637202,0.000017026632,0.00003073807,0.0000075403855,0.0000069982075,0.0002491683,0.53385067,0.00036984024,0.0012638329,0.000016417733,0.46418253],"study_design_scores_gemma":[0.00035587884,0.000044143264,0.0002514698,0.00035918076,0.000021145077,0.00004326259,1.8831719e-7,0.9803408,0.0012419729,0.012688437,0.0037834093,0.00087011245],"about_ca_topic_score_codex":0.0000045928477,"about_ca_topic_score_gemma":0.00001897515,"teacher_disagreement_score":0.87202334,"about_ca_system_score_codex":0.00018298162,"about_ca_system_score_gemma":0.0000618654,"threshold_uncertainty_score":0.9999368},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019280544,0.0005440781,0.9924627,0.00034106133,0.00092241896,0.0005323255,0.000010885608,0.000069619884,0.0031888473],"genre_scores_gemma":[0.29585755,0.000015865615,0.70314515,0.0007475641,0.00012221021,0.00001450548,0.000011679597,0.00003616229,0.000049332077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957265,0.00011106237,0.0007554196,0.0013131726,0.0015447019,0.00054912403],"domain_scores_gemma":[0.9972329,0.00044228544,0.00035061085,0.0012265685,0.0005243554,0.00022324493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00218144,0.00044933628,0.0006052824,0.0015332202,0.0000637445,0.0002326346,0.002929995,0.0002484404,0.0000072294297],"category_scores_gemma":[0.00040231197,0.00045645642,0.00011432471,0.0014961312,0.00025780054,0.00076644897,0.0016611319,0.00046403165,0.00001928551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079411675,0.000025373629,0.000044317374,0.000031994587,0.000003762406,0.000051252664,0.00091743557,0.6099809,0.0002843531,0.08646732,0.000011033152,0.30217436],"study_design_scores_gemma":[0.00027166205,0.00018527535,0.00058019586,0.0005947409,0.000004168227,0.000031030333,2.8316842e-7,0.67389387,0.003739282,0.3195966,0.00057649985,0.0005263934],"about_ca_topic_score_codex":0.000055787146,"about_ca_topic_score_gemma":0.000081052625,"teacher_disagreement_score":0.30164796,"about_ca_system_score_codex":0.0005179131,"about_ca_system_score_gemma":0.0011254131,"threshold_uncertainty_score":0.9997887},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018517123,0.00033445365,0.9977519,0.00023094553,0.0007948407,0.00054476084,0.000010905848,0.00009358209,0.00005342056],"genre_scores_gemma":[0.0316926,0.000075416276,0.9664899,0.0015477804,0.00011285317,0.000003303139,0.000012393127,0.000014589977,0.000051137966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980725,0.000012011805,0.00040162954,0.00068839797,0.00041943035,0.00040600708],"domain_scores_gemma":[0.9986828,0.00018234503,0.00025691048,0.00047770573,0.00025010496,0.0001501106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044743894,0.0003638917,0.00030620742,0.00072659075,0.0003314219,0.0005124532,0.0007015331,0.0002280454,0.0000033372653],"category_scores_gemma":[0.0001113604,0.00031875254,0.00004513516,0.00025198108,0.00036292683,0.0019076583,0.0007374293,0.00044059343,0.000002773111],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004835762,0.0000070738806,0.000052286778,0.00004213603,0.0000021747844,0.000002306287,0.0007561696,0.0011242087,0.00031088362,0.0029440424,0.000002415358,0.99475145],"study_design_scores_gemma":[0.00071267236,0.00008404348,0.000816989,0.00017500368,0.0000040505706,0.00005164001,6.5874735e-7,0.9835813,0.0009858056,0.011599061,0.0016089141,0.00037985895],"about_ca_topic_score_codex":0.000008001864,"about_ca_topic_score_gemma":0.000018673072,"teacher_disagreement_score":0.9943716,"about_ca_system_score_codex":0.00010065778,"about_ca_system_score_gemma":0.000083634186,"threshold_uncertainty_score":0.99992645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033247226,0.00035368378,0.973544,0.00030418916,0.0016737604,0.00090285356,0.0000017209512,0.0002856995,0.022900814],"genre_scores_gemma":[0.1343446,0.000013684536,0.86247706,0.0010193947,0.00060698495,0.00004674334,0.000008863148,0.00007254445,0.0014101212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947803,0.00009929289,0.0007508522,0.0016815182,0.0013297973,0.001358211],"domain_scores_gemma":[0.99650615,0.00035105244,0.00037814135,0.0019627986,0.00029583703,0.0005060205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016231597,0.00082168647,0.0007222875,0.0014571497,0.00048516775,0.0008722865,0.0050901053,0.0003900243,0.000034777077],"category_scores_gemma":[0.00007974366,0.00079125684,0.00018814763,0.0011091799,0.0005245422,0.001064939,0.0033052173,0.0015489612,0.00034430213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056648523,0.00006138084,0.00015279684,0.000062051935,0.000017157225,0.00003500262,0.011954408,0.45558053,0.000062913,0.016644659,0.000049158236,0.51537424],"study_design_scores_gemma":[0.00045293896,0.00041585186,0.0003946288,0.00051307416,0.000028624572,0.00018986818,0.0000031913294,0.97145957,0.00035922384,0.01175505,0.012460046,0.001967913],"about_ca_topic_score_codex":0.000015690766,"about_ca_topic_score_gemma":0.0000098806995,"teacher_disagreement_score":0.51587903,"about_ca_system_score_codex":0.0008017113,"about_ca_system_score_gemma":0.0005332526,"threshold_uncertainty_score":0.99945384},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032900552,0.00029575307,0.99517953,0.00032253173,0.0012120683,0.000923266,0.000010795544,0.0007425233,0.0012806025],"genre_scores_gemma":[0.29551905,0.000010269403,0.70226014,0.0010918281,0.0006647061,0.000027409662,0.000015194885,0.000084190484,0.00032717388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946827,0.00004586663,0.00080259715,0.0021861305,0.0010946484,0.001188033],"domain_scores_gemma":[0.99560446,0.0011192245,0.0004920166,0.002183624,0.00039618363,0.00020451048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002250559,0.00072009204,0.000781044,0.00094677135,0.000493716,0.00080288807,0.004970514,0.00049417175,0.000008712709],"category_scores_gemma":[0.00015663904,0.0007102624,0.00025611816,0.0005218896,0.000334426,0.0006226988,0.0017191209,0.00081604044,0.000032387823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022114004,0.000024538096,0.000006946497,0.00013953558,0.000012362802,0.00003331413,0.0005415852,0.33919245,0.00020618971,0.13822499,0.000024439165,0.5215914],"study_design_scores_gemma":[0.0001867475,0.00012342623,7.6281947e-7,0.00043462033,0.000008032133,0.0000281071,5.1924005e-8,0.81204396,0.00279652,0.17902724,0.0046758577,0.0006746587],"about_ca_topic_score_codex":0.000012904883,"about_ca_topic_score_gemma":0.000014994577,"teacher_disagreement_score":0.52091676,"about_ca_system_score_codex":0.00029147865,"about_ca_system_score_gemma":0.0004342989,"threshold_uncertainty_score":0.99953485},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003390002,0.0004746903,0.9923758,0.0005120349,0.00069247937,0.00043781594,0.000030473928,0.00041523293,0.0050581167],"genre_scores_gemma":[0.004498372,0.000030281455,0.99220765,0.0014674596,0.0004093616,0.000011457517,0.000020020649,0.00004328916,0.0013121306],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99568295,0.00003635249,0.00057342916,0.0016110812,0.0014070097,0.00068919495],"domain_scores_gemma":[0.99671775,0.00046697233,0.0003401002,0.0015102383,0.0006749536,0.00028998128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010766421,0.0005898122,0.00057283294,0.0007996042,0.00022558651,0.00046982925,0.0035816077,0.0003652899,0.00005912309],"category_scores_gemma":[0.00030225824,0.00054476206,0.00013664126,0.0007074252,0.00048428983,0.0012647657,0.0016691966,0.0008017922,0.00022871068],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090600915,0.000039865714,0.000008184483,0.000014412494,0.000010393002,0.00011732989,0.00021117377,0.005259882,0.00036847166,0.017480053,0.00040253048,0.9760786],"study_design_scores_gemma":[0.00041472365,0.00025529676,0.000051107498,0.00021269132,0.000007645342,0.00013157059,3.4087492e-8,0.43442273,0.0035577335,0.54870254,0.011354347,0.0008896025],"about_ca_topic_score_codex":0.000014301694,"about_ca_topic_score_gemma":0.000007969248,"teacher_disagreement_score":0.97518903,"about_ca_system_score_codex":0.0004915333,"about_ca_system_score_gemma":0.00092442665,"threshold_uncertainty_score":0.99970037},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006755292,0.00082992145,0.99302757,0.0004634896,0.0017792865,0.0005230436,0.000019554987,0.000042103675,0.002639503],"genre_scores_gemma":[0.9414215,0.00004878612,0.05477426,0.0009878252,0.0011454249,0.00004866834,0.000023400235,0.000032988428,0.0015171218],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99408305,0.000108131615,0.00079976424,0.0012316722,0.0033614528,0.0004159555],"domain_scores_gemma":[0.99536836,0.002082064,0.0004552581,0.0012955782,0.00058581785,0.0002129358],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.007731857,0.0003131181,0.0003539914,0.00055246503,0.00041747134,0.0003885556,0.0017802411,0.00027679448,0.0018516385],"category_scores_gemma":[0.0012565581,0.0002399186,0.0001346691,0.0006247572,0.0007024445,0.00048745322,0.00047948622,0.00044846212,0.0011642396],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000087441085,0.000026276872,0.00003718278,8.3308964e-7,0.0000024932447,7.077188e-7,0.0002246258,0.014322163,0.00020183224,0.0039443984,0.0005343865,0.9806964],"study_design_scores_gemma":[0.00027697228,0.000049739505,0.00016146978,0.000059906193,0.00002048784,0.000016385446,8.339265e-7,0.20330177,0.0032216175,0.7019853,0.090477414,0.0004280902],"about_ca_topic_score_codex":0.0000052199457,"about_ca_topic_score_gemma":0.000016797394,"teacher_disagreement_score":0.98026824,"about_ca_system_score_codex":0.00024160498,"about_ca_system_score_gemma":0.00026395655,"threshold_uncertainty_score":0.99961346},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008795899,0.0013764532,0.97493637,0.00024586453,0.0015695448,0.0004182482,0.000013844159,0.00004152852,0.012602242],"genre_scores_gemma":[0.65061104,0.0000034579189,0.34782687,0.000588956,0.0005846568,0.000014653746,0.0000047196495,0.000037841834,0.00032781897],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969037,0.0007556113,0.00048823067,0.0007135248,0.00056989206,0.0005690449],"domain_scores_gemma":[0.9968516,0.0016859203,0.0003971671,0.0007305225,0.00028560747,0.000049149996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007170261,0.00039173543,0.0005053197,0.00043690644,0.00057344045,0.00015629124,0.0009434826,0.00019016679,0.0001651086],"category_scores_gemma":[0.00009516847,0.00024101688,0.00014825257,0.0005393734,0.0012467685,0.00020143822,0.00022151075,0.0012810811,0.000018301065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054967502,0.000021355689,0.000029910985,0.00001485835,0.000107888445,0.000010655788,0.157716,0.02693595,0.003160107,0.13662906,0.000016750226,0.6753025],"study_design_scores_gemma":[0.0025755903,0.0019061209,0.019373067,0.0035227546,0.00065273436,0.00074786524,0.003576892,0.026437985,0.0037154125,0.7579216,0.17377183,0.005798193],"about_ca_topic_score_codex":0.00007939847,"about_ca_topic_score_gemma":0.000009704344,"teacher_disagreement_score":0.6695043,"about_ca_system_score_codex":0.00019178775,"about_ca_system_score_gemma":0.00017034086,"threshold_uncertainty_score":0.98283833},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013192944,0.0012916536,0.99260855,0.00019728839,0.0025436291,0.0008174382,0.000020574746,0.00012900952,0.0023905304],"genre_scores_gemma":[0.0020061876,0.00023309833,0.9959184,0.0005580773,0.0006772796,0.000057394624,0.00001754974,0.000031177697,0.0005008502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971249,0.000020322559,0.0004437821,0.0011621283,0.00062559807,0.0006232351],"domain_scores_gemma":[0.9979215,0.00025817775,0.00032508135,0.0011479922,0.00020608447,0.00014111568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064024224,0.0004369547,0.00040918094,0.0005480807,0.00025221184,0.00020567514,0.0015595254,0.00015864283,0.00001698265],"category_scores_gemma":[0.00002987118,0.0003945695,0.00011083823,0.0003368901,0.0003092814,0.0012259057,0.0011417049,0.0002883489,0.000020658446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004785621,0.00001276789,0.0000037261443,0.000057750454,0.0000130109465,0.000013796414,0.00021871045,0.24180771,0.0000034975058,0.21146403,0.000015173955,0.54638505],"study_design_scores_gemma":[0.00037434834,0.00010154139,0.000009123673,0.00088312844,0.000013837398,0.000029260544,3.748889e-7,0.8927644,0.00043407868,0.082516216,0.022080803,0.00079290237],"about_ca_topic_score_codex":0.000011956611,"about_ca_topic_score_gemma":0.000017375345,"teacher_disagreement_score":0.6509567,"about_ca_system_score_codex":0.0002697622,"about_ca_system_score_gemma":0.000116837815,"threshold_uncertainty_score":0.99985063},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017572789,0.000088792935,0.9264006,0.032403402,0.007109634,0.0009166271,0.000013108539,0.00015411487,0.031156462],"genre_scores_gemma":[0.77684295,0.000116877054,0.14105925,0.051141694,0.011659749,0.00010020994,0.000025238414,0.000114585775,0.018939469],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99694204,0.0001131887,0.00041430982,0.0009035405,0.0009900328,0.00063688104],"domain_scores_gemma":[0.9976031,0.0007109688,0.00018987745,0.00053402,0.00050690374,0.00045511985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00230726,0.00030542724,0.00037404758,0.0008437427,0.0007216519,0.00073607813,0.0014241082,0.00028432728,0.00018553194],"category_scores_gemma":[0.0013628993,0.0003123075,0.00006719584,0.0011081371,0.00046309354,0.00021506195,0.00033369852,0.0004288662,0.00022689189],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031335083,0.00002599039,0.00040713357,0.000018113198,0.00001215355,0.0000066521006,0.057397656,0.0064603,0.00007949418,0.04803605,0.00680084,0.8807243],"study_design_scores_gemma":[0.00013518133,0.00015992792,0.00021040608,0.0003936073,0.000010028869,0.0000017047314,0.000054498476,0.0010004187,0.00018781408,0.020350654,0.9768559,0.00063989137],"about_ca_topic_score_codex":0.00028079288,"about_ca_topic_score_gemma":0.005300301,"teacher_disagreement_score":0.97005504,"about_ca_system_score_codex":0.0008372883,"about_ca_system_score_gemma":0.000690969,"threshold_uncertainty_score":0.9999329},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063075026,0.0013283648,0.9896267,0.00048091076,0.0010979115,0.00027041035,0.0000010257153,0.00022175652,0.0063421694],"genre_scores_gemma":[0.80161893,0.000027899474,0.19550857,0.0015177648,0.0004554574,0.000013213359,0.000017208411,0.00004577055,0.00079515565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637485,0.00009189866,0.00057809276,0.0012328244,0.0008003845,0.0009219769],"domain_scores_gemma":[0.9973817,0.0011982296,0.00035042077,0.00076511136,0.00011797121,0.00018656354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015970946,0.00051592954,0.0005023413,0.0009773222,0.00030035785,0.00064661074,0.0018890868,0.00042316515,0.000048854403],"category_scores_gemma":[0.00022850672,0.00050393434,0.0000944912,0.00055916654,0.0002806116,0.0009143024,0.00059812295,0.0017348989,0.00013867168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011415091,0.000020194404,0.0026550142,0.0000482775,0.00000937359,0.00021183425,0.0046000225,0.25071365,0.00020070068,0.010914514,0.00002473116,0.7305903],"study_design_scores_gemma":[0.00048368046,0.00031762192,0.0010210105,0.001527027,0.000010573451,0.00018304463,0.0000010359507,0.886407,0.0019791187,0.100438096,0.0062454804,0.0013862974],"about_ca_topic_score_codex":0.000066804714,"about_ca_topic_score_gemma":0.000019099787,"teacher_disagreement_score":0.8009882,"about_ca_system_score_codex":0.0002641525,"about_ca_system_score_gemma":0.00045908298,"threshold_uncertainty_score":0.99974126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043608173,0.00020973281,0.9970233,0.00084122166,0.00031742538,0.0007975996,0.0000069216117,0.00013158261,0.00023613984],"genre_scores_gemma":[0.18500124,0.00005790726,0.8125087,0.0012995879,0.00070432853,0.000013880847,0.00003685194,0.00004365998,0.00033382836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987507,0.000005875936,0.00021697325,0.00054957287,0.00023679085,0.00024007802],"domain_scores_gemma":[0.999087,0.00017570343,0.00014118891,0.0003667872,0.00013838863,0.00009095017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018727656,0.0002118195,0.00026726074,0.0002325512,0.0002171187,0.000049820024,0.00010258895,0.00013549952,0.0000062541794],"category_scores_gemma":[0.000036611316,0.00019150465,0.000049242666,0.000116937976,0.00031671734,0.00010641546,0.00015742869,0.00029604195,0.0000017301801],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012988599,0.00007354739,0.00017980779,0.00029128886,0.000024075716,0.000009357499,0.001057412,0.002513706,0.050410047,0.015848,0.0001293674,0.9293335],"study_design_scores_gemma":[0.0009970277,0.00032951368,0.0038437417,0.00078608823,0.00012348236,0.00024085036,4.6233407e-7,0.83023274,0.0027756118,0.14993533,0.010160938,0.000574227],"about_ca_topic_score_codex":0.000006995812,"about_ca_topic_score_gemma":0.000001252451,"teacher_disagreement_score":0.9287593,"about_ca_system_score_codex":0.00008402865,"about_ca_system_score_gemma":0.00006180833,"threshold_uncertainty_score":0.7809333},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021072514,0.00039346283,0.9829408,0.0005752924,0.006640199,0.00042082177,7.926326e-7,0.00030460805,0.008702941],"genre_scores_gemma":[0.4764417,0.000027517319,0.51767486,0.0015022487,0.0023820584,0.0000175917,0.0000055354417,0.000061676204,0.0018867725],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955374,0.000035182606,0.000557114,0.001966927,0.0010485431,0.00085485383],"domain_scores_gemma":[0.9966372,0.0002816895,0.0003477793,0.002228647,0.00027394015,0.00023072746],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013725344,0.0005715664,0.0005973209,0.00072054134,0.00036742332,0.0010500132,0.004505696,0.00053925585,0.000029476814],"category_scores_gemma":[0.00014082795,0.00048201295,0.00016441096,0.00056209444,0.0007331842,0.00060004403,0.0016240249,0.0015090486,0.00021050013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021243582,0.000024295245,0.000072159855,0.000042120693,0.000010721094,0.000113438204,0.00092441746,0.0017795861,0.0005862733,0.21870013,0.00004233634,0.7777024],"study_design_scores_gemma":[0.0003362451,0.00025321668,0.000052877684,0.00008789552,0.000010744419,0.00027600283,1.3650448e-7,0.09345991,0.004105073,0.85657567,0.043618396,0.0012238318],"about_ca_topic_score_codex":0.00007430954,"about_ca_topic_score_gemma":0.00013809722,"teacher_disagreement_score":0.7764786,"about_ca_system_score_codex":0.0001826884,"about_ca_system_score_gemma":0.0004971969,"threshold_uncertainty_score":0.999987},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011359735,0.0011289534,0.32249543,0.0010819857,0.004955197,0.00083517225,0.0000066492535,0.00011931572,0.6682413],"genre_scores_gemma":[0.93088645,0.00093109877,0.017039947,0.0024054246,0.0025194876,0.00003632974,0.00000886095,0.000077690696,0.04609469],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781793,0.000049380098,0.00025522604,0.0005994409,0.00072864647,0.000549349],"domain_scores_gemma":[0.99867004,0.0004482613,0.00012874333,0.0004620838,0.00008742126,0.00020342803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010362231,0.00021257064,0.00021753293,0.00018568839,0.0002582991,0.00040154488,0.0013798567,0.00021485133,0.00006777326],"category_scores_gemma":[0.00038696313,0.00014825456,0.00005405686,0.00022993895,0.0017285558,0.0003703379,0.00025835808,0.0004383987,0.00006748699],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007375116,0.000018417897,0.000053164025,0.000003827835,9.1513317e-7,0.000030311046,0.006782966,0.00011576979,0.00001410496,0.040156413,0.000019998934,0.95279676],"study_design_scores_gemma":[0.00021482418,0.00024229183,0.00051220646,0.00065891404,0.000005545783,0.000007665847,0.00001542484,0.0017697884,0.00027808375,0.6703658,0.32530144,0.00062802783],"about_ca_topic_score_codex":0.00023119904,"about_ca_topic_score_gemma":0.005906122,"teacher_disagreement_score":0.9521687,"about_ca_system_score_codex":0.00015235771,"about_ca_system_score_gemma":0.0005778908,"threshold_uncertainty_score":0.6368936},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06833537,0.0025027303,0.9269942,0.00013631479,0.0014467046,0.00019306889,0.0000043144587,0.000021925745,0.00036536876],"genre_scores_gemma":[0.87592006,0.000027728112,0.122504905,0.0003602559,0.00091163046,0.0000040955533,0.00001546786,0.000022693532,0.00023317602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820024,0.000042555184,0.00024909625,0.0006249661,0.00049448205,0.000388634],"domain_scores_gemma":[0.99887323,0.00017638797,0.00017840302,0.00054784515,0.00015905757,0.00006510106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013603503,0.00023050359,0.00018363653,0.00015889188,0.0004027513,0.00021735497,0.00067291816,0.00026660698,0.000016583557],"category_scores_gemma":[0.0005239369,0.00015850388,0.00006818669,0.00016896741,0.0013713692,0.000008511539,0.00045561028,0.00030616595,0.000007365195],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006564713,0.00000908253,0.00022717657,0.000017589768,0.000010238441,0.000001709051,0.0003762256,0.0082695,0.06793402,0.00010841433,0.00001029498,0.9230292],"study_design_scores_gemma":[0.0012632752,0.0013594322,0.003047314,0.0020103583,0.00021575701,0.00030918073,0.00001840748,0.637323,0.2587922,0.061993815,0.030406414,0.0032608083],"about_ca_topic_score_codex":0.00001482422,"about_ca_topic_score_gemma":0.00005814033,"teacher_disagreement_score":0.9197684,"about_ca_system_score_codex":0.00006005629,"about_ca_system_score_gemma":0.00040962102,"threshold_uncertainty_score":0.64636004},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011070597,0.00021524688,0.892188,0.0017928057,0.0009146239,0.0005090648,0.00001955273,0.00007912102,0.10417088],"genre_scores_gemma":[0.7921671,0.00014291174,0.17479827,0.0049508745,0.0025128627,0.000057934798,0.000028465942,0.000070876544,0.025270682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772924,0.000039436363,0.00027835733,0.0006499027,0.0008163844,0.00048669768],"domain_scores_gemma":[0.99823475,0.0007649297,0.00020895546,0.00035756087,0.00028218978,0.000151641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015419464,0.00023928058,0.00025884443,0.00021302704,0.00076913176,0.00021698029,0.0012843596,0.0003926284,0.00014629273],"category_scores_gemma":[0.0002941027,0.00022745298,0.0001029151,0.00021256621,0.0020012886,0.0004593099,0.0002120019,0.000459562,0.00002808006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011027089,0.000015520545,0.00021478583,0.000011559462,0.000008590133,0.000001795368,0.04465102,0.0038422423,0.000002691181,0.91065156,0.0001897238,0.040399462],"study_design_scores_gemma":[0.00022406611,0.000060165305,0.000035258774,0.000116200084,0.000016778677,8.860754e-7,0.000029034898,0.15028144,0.000020806863,0.82026225,0.028472925,0.00048017682],"about_ca_topic_score_codex":0.0002436024,"about_ca_topic_score_gemma":0.0056369104,"teacher_disagreement_score":0.79205644,"about_ca_system_score_codex":0.0002644077,"about_ca_system_score_gemma":0.00087419286,"threshold_uncertainty_score":0.92752635},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021665782,0.0006454328,0.99458116,0.00037329193,0.0003977237,0.0005378721,0.0000040325094,0.00020370304,0.003040139],"genre_scores_gemma":[0.35386807,0.00013103787,0.64500517,0.00043924715,0.00031369022,0.000050101804,0.0000060483644,0.00004304086,0.00014361949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975419,0.000032627653,0.00038701517,0.0010323315,0.00053549564,0.0004706117],"domain_scores_gemma":[0.99819887,0.000230221,0.00032440806,0.00080746645,0.00028305757,0.0001559916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038973012,0.00044502894,0.00045128015,0.00055179175,0.0002477718,0.0006322844,0.0011047213,0.00020470184,0.000010799385],"category_scores_gemma":[0.000018016211,0.00036586748,0.00003753975,0.0005814509,0.00020938493,0.0011460069,0.0006480396,0.0003410134,0.0000066495304],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012917481,0.000035440025,0.0005868564,0.000099966644,0.000034889577,0.000038178943,0.0077995844,0.0020904352,0.00078857446,0.0614157,0.000064935426,0.92703253],"study_design_scores_gemma":[0.0033611585,0.0033275438,0.0062377173,0.00634722,0.00009919804,0.0016773379,0.00003122402,0.5952142,0.055484634,0.29993257,0.019120133,0.009167071],"about_ca_topic_score_codex":0.000033550194,"about_ca_topic_score_gemma":0.000070896676,"teacher_disagreement_score":0.91786546,"about_ca_system_score_codex":0.0001825626,"about_ca_system_score_gemma":0.00020752841,"threshold_uncertainty_score":0.9998793},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003532787,0.00022760102,0.9971353,0.00039594475,0.0007998274,0.0008085056,0.00001371423,0.00020068094,0.00038309544],"genre_scores_gemma":[0.4084215,0.0000060859206,0.5904893,0.0007181025,0.0002910719,0.000022208407,0.000009317447,0.000027137738,0.000015296895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504185,0.00007094635,0.0006414454,0.0011286687,0.0024983326,0.0006187446],"domain_scores_gemma":[0.9971149,0.0006962662,0.00043976016,0.0010050911,0.0005734592,0.00017049826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022992413,0.0004948004,0.0005771543,0.00069669296,0.00018733299,0.00020548687,0.003044252,0.00041509653,0.00003325192],"category_scores_gemma":[0.00041457,0.00043824918,0.0001815455,0.0004289194,0.00062814995,0.000785777,0.0007305166,0.00054146396,0.0000028955199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060976618,0.000051546893,0.000048989816,0.00012558636,0.00002034987,0.000017784556,0.0005914041,0.020741682,0.00077755476,0.028091418,0.00006430988,0.9494084],"study_design_scores_gemma":[0.00041195104,0.00044723344,0.000110860274,0.0008128014,0.000012185176,0.000009435651,1.6097782e-7,0.942009,0.03918129,0.016435448,0.000078764264,0.00049087475],"about_ca_topic_score_codex":0.000017071598,"about_ca_topic_score_gemma":0.000009080408,"teacher_disagreement_score":0.9489175,"about_ca_system_score_codex":0.0003042183,"about_ca_system_score_gemma":0.00075515296,"threshold_uncertainty_score":0.99980694},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020941375,0.00081904535,0.9925227,0.00027357953,0.0019848384,0.0006626459,0.00006651222,0.000132749,0.003328493],"genre_scores_gemma":[0.96336514,0.000021066862,0.034874048,0.00022853563,0.00027928766,0.00002272451,0.000043369593,0.00003724383,0.0011285793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608475,0.00005410086,0.001037031,0.0011886758,0.0010877454,0.0005477076],"domain_scores_gemma":[0.9967855,0.00043131612,0.0007836774,0.0013178245,0.000518638,0.00016303854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000696766,0.0004889881,0.00074510573,0.00048398474,0.00022940195,0.0005728436,0.002213686,0.00038616586,0.000023198094],"category_scores_gemma":[0.00006193984,0.0004472045,0.0001417252,0.0005947457,0.000335834,0.0010877434,0.00045358043,0.00056715944,0.000090485235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003227219,0.000043657714,0.000042567597,0.000118455406,0.000023254095,0.000013813899,0.0010059592,0.83694583,0.0012937641,0.019808294,0.00014899638,0.14055216],"study_design_scores_gemma":[0.0002005983,0.00007145393,0.00007773424,0.0007888356,0.0000069434927,0.000016420023,3.852747e-7,0.9854919,0.0002543169,0.0032495724,0.009370276,0.000471569],"about_ca_topic_score_codex":0.00009929361,"about_ca_topic_score_gemma":0.000009765208,"teacher_disagreement_score":0.96315575,"about_ca_system_score_codex":0.00025051873,"about_ca_system_score_gemma":0.00026511442,"threshold_uncertainty_score":0.999798},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029346156,0.0058566593,0.9833597,0.00015115844,0.00018776463,0.0004406776,0.000027132599,0.000599124,0.009348426],"genre_scores_gemma":[0.39704838,0.0061174715,0.5949178,0.0006996325,0.00055615656,0.00020869909,0.00011444519,0.00015908398,0.00017837214],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877703,0.000013643897,0.00029889264,0.00040066446,0.0002889463,0.00022081948],"domain_scores_gemma":[0.99852586,0.00019719209,0.000072158815,0.00090660254,0.00018050306,0.00011766336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027260525,0.0002694679,0.000306396,0.00043726654,0.00014492853,0.00013764956,0.0007830225,0.00023862557,0.000015996244],"category_scores_gemma":[0.000019865205,0.00029173208,0.00003726085,0.00030735426,0.0009310333,0.00019262526,0.00034216876,0.0006159642,0.0000146569355],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021769781,0.000014922059,0.000035997626,0.00014304086,0.00002623428,0.0000044681374,0.00052699976,0.016589137,0.00013748163,0.041519977,0.00030436512,0.9406952],"study_design_scores_gemma":[0.0003270213,0.00006885982,0.00007495422,0.00085993035,0.000043222735,0.00022752024,0.0000019769461,0.30852035,0.00071686023,0.3334755,0.35438636,0.0012974628],"about_ca_topic_score_codex":0.000007610311,"about_ca_topic_score_gemma":0.00006284298,"teacher_disagreement_score":0.93939775,"about_ca_system_score_codex":0.00021604131,"about_ca_system_score_gemma":0.00014261766,"threshold_uncertainty_score":0.9999535},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49092922,0.00001610558,0.5080721,0.00017889058,0.00035170224,0.0002631526,4.061414e-7,0.00017767608,0.000010774725],"genre_scores_gemma":[0.88810813,5.729328e-7,0.111248136,0.00056956947,0.000054250148,0.0000083001305,1.08065215e-7,0.000010684947,2.2314457e-7],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99704707,0.00024985505,0.00033730693,0.0011085155,0.00054837717,0.00070885336],"domain_scores_gemma":[0.9977527,0.00050187507,0.00013359573,0.0013808487,0.00014685672,0.000084090454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017956009,0.00028412603,0.00029039045,0.00027855017,0.00048675822,0.00038702742,0.002862209,0.00009271301,0.0000074280415],"category_scores_gemma":[0.00036538328,0.00019100067,0.000072581184,0.0017741794,0.00068487733,0.00048401006,0.00043812857,0.00057939184,0.000011161337],"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.000037075763,0.0020730486,0.7491725,0.00001534714,0.00004513699,0.0003252552,0.016465465,0.017678091,0.011519329,0.0052467105,0.0000036665554,0.19741833],"study_design_scores_gemma":[0.0007034284,0.0006561234,0.62141836,0.000080448866,0.000009607072,0.0000746272,0.000010139869,0.33822766,0.023627976,0.014738495,0.000003625898,0.00044948806],"about_ca_topic_score_codex":0.0001343607,"about_ca_topic_score_gemma":0.000049378847,"teacher_disagreement_score":0.39717895,"about_ca_system_score_codex":0.00017397274,"about_ca_system_score_gemma":0.00013387337,"threshold_uncertainty_score":0.77887815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011950871,0.00083647674,0.9778126,0.0006390313,0.0017595618,0.00039875737,7.193043e-7,0.00007798364,0.018462919],"genre_scores_gemma":[0.91163605,0.00007311984,0.084979445,0.0013173793,0.00032070145,0.000016950748,0.00000337773,0.000032166692,0.0016208058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973178,0.00012402904,0.00049117877,0.0008676599,0.00080529123,0.0003940454],"domain_scores_gemma":[0.99713707,0.00040305793,0.00042474968,0.0016832071,0.00027546738,0.000076450524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024189558,0.0003220742,0.0003736013,0.00032126735,0.00020525751,0.0002568813,0.0034117824,0.00025113078,0.000012622181],"category_scores_gemma":[0.00013949245,0.00020915104,0.00013064932,0.00059027225,0.0008958202,0.00025896358,0.00052499,0.0005023536,0.000025967567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015837753,0.000010886841,0.00001661214,0.00001720564,0.00000655655,0.0000054847205,0.0006603033,0.00056747324,0.00003659068,0.6534959,0.000016244008,0.34516513],"study_design_scores_gemma":[0.00014107766,0.00013513086,0.00017812368,0.000044211283,0.000009474926,0.000049998962,7.287351e-7,0.016044302,0.0014712745,0.9714122,0.0101670055,0.00034648782],"about_ca_topic_score_codex":0.00002154066,"about_ca_topic_score_gemma":0.00001773163,"teacher_disagreement_score":0.9116241,"about_ca_system_score_codex":0.00012718473,"about_ca_system_score_gemma":0.00039026336,"threshold_uncertainty_score":0.85289323},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008894966,0.00025219517,0.99435353,0.002404374,0.00043685446,0.00087295636,0.0000054752363,0.00006966546,0.0007154707],"genre_scores_gemma":[0.13465919,0.000014376144,0.864331,0.0006457711,0.00014989455,0.00007633078,0.0000019582917,0.000015182381,0.00010627683],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970964,0.0001317487,0.0005179551,0.0011415752,0.00063573295,0.0004765765],"domain_scores_gemma":[0.99526495,0.0022764783,0.00033684727,0.0017164227,0.00029839866,0.00010687923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012476828,0.00034137815,0.00043078,0.00028742908,0.0002943257,0.00015732944,0.003062032,0.0001281653,0.000044557433],"category_scores_gemma":[0.00020741805,0.00024125817,0.00013888738,0.000489071,0.0012717424,0.00017441652,0.00082806917,0.0005888339,0.000040525774],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029779906,0.00009095918,0.00003901456,0.00002901149,0.000015025364,0.000015573718,0.00035379652,0.014024342,0.00016474452,0.22889179,0.0000849637,0.7562878],"study_design_scores_gemma":[0.00008967267,0.00027086266,0.00067124364,0.00009869084,0.000007075862,0.000067086985,2.2449775e-7,0.48326066,0.0007455297,0.51341254,0.0010894835,0.00028694017],"about_ca_topic_score_codex":0.000056865316,"about_ca_topic_score_gemma":0.00001773264,"teacher_disagreement_score":0.7560009,"about_ca_system_score_codex":0.0001663566,"about_ca_system_score_gemma":0.00042853382,"threshold_uncertainty_score":0.9838222},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025803707,0.0005909919,0.99465525,0.0004863621,0.0020442323,0.00031899617,0.000046486362,0.00029981148,0.0015320862],"genre_scores_gemma":[0.024392068,0.000029321003,0.97345084,0.0008150681,0.000824337,0.000016196871,0.000046149267,0.0000478604,0.0003781583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603057,0.000022531316,0.0005847054,0.0016665052,0.0009421713,0.0007535419],"domain_scores_gemma":[0.9970905,0.00022034206,0.0003986472,0.0017455514,0.00032269105,0.00022223749],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006828529,0.00058574026,0.00058909546,0.0005160701,0.00046421168,0.0004813861,0.0024860057,0.00039682834,0.000017354027],"category_scores_gemma":[0.0001244304,0.00050631404,0.000115035255,0.0006209032,0.00094309094,0.0014502747,0.0016131416,0.0013009933,0.000047756148],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050278404,0.000026549415,0.000034950033,0.00011411901,0.0000069362395,0.00019275691,0.0004627413,0.0035302006,0.0010379916,0.09380533,0.000023671677,0.9007597],"study_design_scores_gemma":[0.00079967646,0.00031049622,0.00025917677,0.002664806,0.000021991533,0.000726097,8.053187e-7,0.4670723,0.013125198,0.2852431,0.22610721,0.0036691509],"about_ca_topic_score_codex":0.000028552333,"about_ca_topic_score_gemma":0.00017169456,"teacher_disagreement_score":0.89709055,"about_ca_system_score_codex":0.00019423678,"about_ca_system_score_gemma":0.00080744264,"threshold_uncertainty_score":0.9997389},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101937134,0.00015212639,0.99103343,0.0015700042,0.0017092351,0.0006645324,0.000004303704,0.00007798335,0.0046864403],"genre_scores_gemma":[0.37118158,0.00014847283,0.59375274,0.014677283,0.0118178325,0.000293828,0.00056227524,0.00024126729,0.007324742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983208,0.0000024926649,0.00030869435,0.0006461656,0.00041551236,0.0003063402],"domain_scores_gemma":[0.99924713,0.000034825003,0.000113298185,0.0003223849,0.00025504504,0.00002732616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072416005,0.00026442242,0.00025412772,0.0004943683,0.00015675605,0.00033900066,0.00042973174,0.00011763593,0.000037042755],"category_scores_gemma":[0.00009378229,0.00025262844,0.000045595218,0.00021379233,0.00019715652,0.0006004383,0.00042096854,0.00015129532,0.000038663453],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015423559,0.000018464296,0.000062586136,0.0005773525,0.000011312018,0.0000030868841,0.00020661083,0.031656273,0.000027384942,0.0073929075,0.00046814472,0.95956045],"study_design_scores_gemma":[0.00030140165,0.000015217883,0.0000970846,0.0001227566,0.000013691133,9.830654e-7,0.0000012288191,0.92414737,0.000009557228,0.04693718,0.028037965,0.00031553875],"about_ca_topic_score_codex":0.000099013276,"about_ca_topic_score_gemma":0.00056134915,"teacher_disagreement_score":0.9592449,"about_ca_system_score_codex":0.00009709344,"about_ca_system_score_gemma":0.000047632067,"threshold_uncertainty_score":0.9999926},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022550239,0.0012964762,0.986369,0.001558392,0.0017613472,0.00028206295,0.0000014693808,0.00008063804,0.0086280275],"genre_scores_gemma":[0.11776874,0.00017524752,0.8746072,0.006643161,0.0002694514,0.0000042830643,0.0000010717761,0.000043573753,0.00048729093],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968208,0.00005107673,0.0004800016,0.0011087508,0.00095999375,0.00057939935],"domain_scores_gemma":[0.997051,0.00057706836,0.00038698365,0.0016247059,0.0002742859,0.000085958345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007363012,0.0004300716,0.00046684145,0.00031186064,0.00029175592,0.0003203183,0.0034149555,0.00015911816,0.000016086424],"category_scores_gemma":[0.00016175746,0.0003065365,0.00015212105,0.000784634,0.00088503084,0.0009565316,0.0008847524,0.00079772045,0.000015525262],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042372994,0.00003265491,0.0000374856,0.000040158575,0.000011126361,0.000060174298,0.0040227654,0.01416792,0.00072558894,0.056130365,0.00008485981,0.9246827],"study_design_scores_gemma":[0.0005383272,0.00023592894,0.00014354792,0.0010499011,0.000015142804,0.00025056108,0.0000028023778,0.33606586,0.025459513,0.6224051,0.0126416525,0.00119163],"about_ca_topic_score_codex":0.000011488033,"about_ca_topic_score_gemma":0.000021117809,"teacher_disagreement_score":0.92349106,"about_ca_system_score_codex":0.0001313323,"about_ca_system_score_gemma":0.00031052795,"threshold_uncertainty_score":0.99993867},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002794988,0.00014952627,0.9976259,0.00022346269,0.00052244135,0.00023062383,0.0000075787507,0.00019731277,0.00076368515],"genre_scores_gemma":[0.383165,0.000004230005,0.61493325,0.0011568009,0.00044863264,0.000010909468,0.000030629963,0.00003559556,0.00021494828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959815,0.000051444284,0.00061787677,0.0017114639,0.00094909634,0.00068862346],"domain_scores_gemma":[0.99678826,0.000502937,0.00043764262,0.0018285171,0.00023665084,0.00020598414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011576879,0.00051143504,0.0005966541,0.0012855494,0.00034115303,0.0009000619,0.0043518655,0.00027008326,0.000017158021],"category_scores_gemma":[0.000061237326,0.000498422,0.00016241918,0.0009033024,0.00049788866,0.00037183566,0.0014010369,0.00078827894,0.00005872007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053581925,0.00006723056,0.0005335074,0.00011185314,0.000055685196,0.00005629751,0.00048727036,0.29916516,0.0023278047,0.01627203,0.000023699016,0.6808941],"study_design_scores_gemma":[0.00016750404,0.000037758524,0.000025301097,0.00039896462,0.000021393054,0.000020429885,1.1362006e-7,0.9847024,0.0016869742,0.009667847,0.002706474,0.0005648235],"about_ca_topic_score_codex":0.000095292635,"about_ca_topic_score_gemma":0.000041509003,"teacher_disagreement_score":0.6855372,"about_ca_system_score_codex":0.00034531366,"about_ca_system_score_gemma":0.00044398796,"threshold_uncertainty_score":0.99974674},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006644535,0.0013164643,0.043929603,0.00054252637,0.0022450802,0.00041733103,0.00004564468,0.00010677863,0.9507321],"genre_scores_gemma":[0.9773678,0.00006572796,0.009972984,0.00041931894,0.00070665893,0.00000426708,0.000013228761,0.000032048843,0.011417965],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772686,0.000030093834,0.00029489739,0.0006850798,0.00053009985,0.0007329829],"domain_scores_gemma":[0.99886376,0.00013671847,0.00013092192,0.0004054298,0.00009430573,0.00036884117],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00033297145,0.00033605786,0.00041054856,0.0005463279,0.0005097401,0.0006859987,0.0014621102,0.00027652443,0.00029945525],"category_scores_gemma":[0.0002778371,0.0002971821,0.00008664649,0.0005781619,0.0030006615,0.0013298092,0.00023339667,0.0005704257,0.00004372386],"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.00003174619,0.0000395817,0.035632968,0.000052620868,0.000022562086,0.00053098536,0.59046113,0.0004202842,0.0000037006644,0.022055438,0.0010148954,0.34973407],"study_design_scores_gemma":[0.00069563324,0.00030714218,0.0048272773,0.0012267053,0.000018815974,0.00003940962,0.00092321844,0.003483707,0.000011391296,0.5803257,0.4041508,0.0039901948],"about_ca_topic_score_codex":0.07778812,"about_ca_topic_score_gemma":0.45716265,"teacher_disagreement_score":0.97670335,"about_ca_system_score_codex":0.0006573986,"about_ca_system_score_gemma":0.0020541192,"threshold_uncertainty_score":0.999948},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016198344,0.0001212411,0.99778646,0.00050627923,0.00023479083,0.00058242935,0.000032942335,0.00012215831,0.00045170842],"genre_scores_gemma":[0.5310388,0.000009788749,0.46772218,0.00086102716,0.00024036312,0.000025198837,0.000056521327,0.000018301855,0.000027811479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546355,0.000077918274,0.0007700944,0.001891245,0.0012872219,0.0005099873],"domain_scores_gemma":[0.99438375,0.003178279,0.0004861257,0.0015877024,0.00027557366,0.00008855447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0040036887,0.00038891597,0.0005152494,0.00057182397,0.0002506949,0.0006787469,0.00414134,0.00021190886,0.0000022754882],"category_scores_gemma":[0.0013352222,0.00030777033,0.00004871008,0.0004411184,0.0007250454,0.0008212043,0.0023543243,0.00075613294,8.24052e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019298053,0.00008138977,0.0033090645,0.00013892434,0.00003788868,0.0001899343,0.0023133915,0.025607461,0.00007248724,0.22275916,0.0003137091,0.7451573],"study_design_scores_gemma":[0.00014986467,0.000116525334,0.00082437636,0.00020019196,0.000010329453,0.00015817382,4.049352e-7,0.7578703,0.000056436747,0.23935297,0.0009236997,0.00033669182],"about_ca_topic_score_codex":0.00004594671,"about_ca_topic_score_gemma":0.00031720236,"teacher_disagreement_score":0.7448206,"about_ca_system_score_codex":0.0001486087,"about_ca_system_score_gemma":0.00035328532,"threshold_uncertainty_score":0.9999374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065441586,0.000044223656,0.93317145,0.0008252609,0.00007328065,0.00023870556,0.000013480663,0.00016574048,0.000026257261],"genre_scores_gemma":[0.72619945,0.0000018161189,0.27328533,0.00019980254,0.00015795112,0.00010586945,0.000029476763,0.000011763858,0.000008549679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857444,0.000006171264,0.000261641,0.00058211695,0.00023482827,0.00034083475],"domain_scores_gemma":[0.99869144,0.00027807095,0.00009946684,0.00064496434,0.00018165803,0.00010440982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000519092,0.00012964975,0.00014208867,0.00007140303,0.00017854379,0.00011699651,0.00057761534,0.00008467378,0.00000499372],"category_scores_gemma":[0.00028442775,0.00012999769,0.000036704918,0.0006473688,0.00017107207,0.00021163978,0.00013631138,0.0001519992,0.000002752445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044857992,0.00016831135,0.0034860638,0.00008171617,0.000007189315,0.0000020906173,0.000565446,0.5289899,0.16870642,0.0039006735,0.00021856315,0.29382876],"study_design_scores_gemma":[0.00023435519,0.00001406908,0.00013287686,0.000027304512,0.0000022620577,0.0000041957232,0.0000023027453,0.9463494,0.03220731,0.020322626,0.000546303,0.00015703107],"about_ca_topic_score_codex":0.00003850299,"about_ca_topic_score_gemma":0.000064561355,"teacher_disagreement_score":0.66075784,"about_ca_system_score_codex":0.00035356087,"about_ca_system_score_gemma":0.00012723762,"threshold_uncertainty_score":0.5301152},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002510483,0.00031868127,0.995838,0.00027175585,0.0015093591,0.0009960345,0.00001195021,0.00026479547,0.00076431537],"genre_scores_gemma":[0.011255145,0.000038562706,0.9867573,0.0010204596,0.00044883366,0.00006429747,0.000007674069,0.00006946831,0.00033828692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943811,0.0000807673,0.0006483291,0.0022972347,0.0012624284,0.0013301228],"domain_scores_gemma":[0.99461937,0.0021885284,0.00038641723,0.002087473,0.0004345667,0.0002836578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022864284,0.00069707184,0.0008581924,0.0015686812,0.0004771815,0.0008296254,0.0049427343,0.00037520946,0.00001075178],"category_scores_gemma":[0.0002912945,0.000659633,0.000347353,0.0010018569,0.001089873,0.00062387844,0.001629511,0.00094871345,0.000023473323],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008287495,0.000011260163,0.000006095137,0.000039414994,0.00001580011,0.000026270018,0.00020831575,0.0024797495,0.000345267,0.07086031,0.000006650369,0.9259926],"study_design_scores_gemma":[0.0003904015,0.00019795865,0.000009230979,0.00026047393,0.0000047472736,0.000036084894,8.1424005e-8,0.5319398,0.0007696385,0.4637022,0.0021395735,0.000549835],"about_ca_topic_score_codex":0.0000067113874,"about_ca_topic_score_gemma":0.0000137157585,"teacher_disagreement_score":0.92544276,"about_ca_system_score_codex":0.0002726267,"about_ca_system_score_gemma":0.0004109628,"threshold_uncertainty_score":0.9995855},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007606364,0.00036241772,0.9937945,0.0017424326,0.0004969715,0.0004870438,0.0000040620266,0.00011002732,0.002241905],"genre_scores_gemma":[0.7620624,0.000041651565,0.23568358,0.0017358159,0.00016536844,0.000019523965,0.000007120545,0.000024243025,0.0002603142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955962,0.00008150156,0.0007408129,0.0016693601,0.0012326846,0.0006794962],"domain_scores_gemma":[0.99751574,0.00030437685,0.00022673284,0.0013227253,0.00038768456,0.00024272621],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011239144,0.0005371273,0.0008119481,0.0014388094,0.00021457108,0.0009145478,0.003416758,0.00021431173,0.000038246555],"category_scores_gemma":[0.0001454031,0.0004763985,0.0001575066,0.0012329272,0.0002559087,0.00092852843,0.000988161,0.0006705665,0.00007908059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004818528,0.00005173999,0.0009786471,0.000025613203,0.000013358059,0.000033507706,0.0012584373,0.49433988,0.00010866111,0.017802503,0.000080694015,0.48530212],"study_design_scores_gemma":[0.00016422667,0.000054188742,0.0010841439,0.0002288151,0.000006739238,0.000005960189,2.9295194e-7,0.8855934,0.00039065775,0.11134042,0.00057215354,0.00055897876],"about_ca_topic_score_codex":0.00030949543,"about_ca_topic_score_gemma":0.0032788038,"teacher_disagreement_score":0.76130176,"about_ca_system_score_codex":0.0003171492,"about_ca_system_score_gemma":0.0003310193,"threshold_uncertainty_score":0.9997688},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24044688,0.00034716708,0.7577247,0.00018224552,0.0009833057,0.000253386,9.890213e-7,0.00005202181,0.000009328088],"genre_scores_gemma":[0.5942569,0.000004119265,0.4051961,0.0002783551,0.0002473137,0.0000026983184,0.0000048236843,0.000009053987,6.377946e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985331,0.000028033413,0.00026696367,0.0003384434,0.0002649303,0.0005684838],"domain_scores_gemma":[0.99896073,0.00034696027,0.000088178334,0.00030929665,0.00013439226,0.00016042458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006296079,0.00015627962,0.0002089333,0.0006337238,0.000258467,0.000085053165,0.00017829314,0.00005938911,0.000008108606],"category_scores_gemma":[0.00026197796,0.00013781655,0.00022726839,0.0015951499,0.00033470656,0.00036064547,0.000055184595,0.00019838013,0.0000038453963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011519586,0.0008216191,0.33445126,0.00054864486,0.000109204775,0.0000023902896,0.0047827414,0.13974173,0.13034832,0.00010988339,0.00005067157,0.38891834],"study_design_scores_gemma":[0.0021135062,0.00077040965,0.3289141,0.0017122056,0.0002777658,0.0007526542,0.000015816855,0.6485207,0.008016622,0.007683334,0.0004255713,0.00079732086],"about_ca_topic_score_codex":0.000043668733,"about_ca_topic_score_gemma":0.000018392853,"teacher_disagreement_score":0.5087789,"about_ca_system_score_codex":0.000082768056,"about_ca_system_score_gemma":0.00006362881,"threshold_uncertainty_score":0.56199956},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044469514,0.0004796077,0.98226,0.0018581746,0.0021082333,0.0002588266,0.0000010193241,0.00031250482,0.012677169],"genre_scores_gemma":[0.1939823,0.0001111146,0.8017446,0.001957648,0.00069381465,0.000015864387,0.0000066843286,0.000038608185,0.0014493613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961323,0.000049065024,0.0005253982,0.0016691042,0.000939801,0.0006843454],"domain_scores_gemma":[0.99682134,0.00046625405,0.00036270724,0.0019651507,0.00022269852,0.00016185973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010264106,0.00050342036,0.0005581099,0.00060294906,0.00026965205,0.0005331725,0.004193111,0.00039681906,0.000019973415],"category_scores_gemma":[0.0002300623,0.00043311875,0.00014443806,0.00044878566,0.0006710474,0.00040125067,0.0010319684,0.00065723056,0.00014825477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000440735,0.000016926428,0.00017999916,0.000027408565,0.000010301448,0.000036447283,0.0004279494,0.004562938,0.00009001633,0.37074432,0.00018110413,0.6237182],"study_design_scores_gemma":[0.00027229777,0.00015074802,0.0016967264,0.00030289462,0.000010621237,0.000072717245,2.7825317e-7,0.7781736,0.00033878328,0.2071043,0.011052372,0.00082464947],"about_ca_topic_score_codex":0.000025778605,"about_ca_topic_score_gemma":0.000072552284,"teacher_disagreement_score":0.77361065,"about_ca_system_score_codex":0.00019761515,"about_ca_system_score_gemma":0.00038487918,"threshold_uncertainty_score":0.99981207},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25075242,0.000033690474,0.7476466,0.00007138353,0.0013360573,0.00006274262,6.5328527e-7,0.0000821094,0.0000143891275],"genre_scores_gemma":[0.6603981,5.786407e-7,0.33934462,0.000077155826,0.00017066525,0.0000038075855,2.6858183e-7,0.0000045147185,2.6390776e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994588,0.000005593496,0.00009816041,0.00015275765,0.00009324388,0.00019147374],"domain_scores_gemma":[0.9997153,0.000080604965,0.000009100369,0.00009734239,0.000046815974,0.000050805935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021641537,0.00006718664,0.00008272828,0.00008447135,0.000048095695,0.00008475799,0.00012275978,0.000043985045,0.0000037019624],"category_scores_gemma":[0.000092376824,0.000063933294,0.000014561845,0.00019298142,0.00006000112,0.00021451843,0.000035344277,0.0000745593,0.000006693036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020048099,0.0000018566234,0.00007036287,0.000011905347,6.7425435e-7,2.2646003e-7,0.00021785565,0.87585604,0.004396974,0.000016011874,0.000008448184,0.11941766],"study_design_scores_gemma":[0.00010499837,0.000026119184,0.00005716801,0.000041118987,0.0000010598895,0.000014555264,6.3994963e-7,0.95916325,0.03187745,0.008494426,0.00013316414,0.00008607379],"about_ca_topic_score_codex":0.000010855922,"about_ca_topic_score_gemma":0.000010649881,"teacher_disagreement_score":0.4096457,"about_ca_system_score_codex":0.00005762553,"about_ca_system_score_gemma":0.00003318608,"threshold_uncertainty_score":0.26071241},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000524374,0.0013749283,0.9833412,0.00014758467,0.012314355,0.0005093068,0.000032404016,0.00047744953,0.0017502903],"genre_scores_gemma":[0.3924644,0.000038761904,0.596229,0.00054151035,0.0071656294,0.000041248848,0.00011374477,0.0001849254,0.0032207388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99463296,0.0000875897,0.0011354435,0.0018155762,0.0013855003,0.0009429092],"domain_scores_gemma":[0.9964611,0.00071923155,0.00042299405,0.0018240177,0.00034724665,0.00022544601],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014756438,0.00073313684,0.0011466267,0.0013013124,0.00012167697,0.0010987946,0.005192027,0.000403987,0.000005653842],"category_scores_gemma":[0.0000474937,0.0006762542,0.00026064157,0.0020599193,0.0003657752,0.00038022117,0.002137801,0.0009921496,0.00012875994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022996453,0.00004326259,0.000021224003,0.0010296025,0.000051428324,0.0001693341,0.0010233837,0.9276314,0.000118340584,0.017555749,0.0037851736,0.048568815],"study_design_scores_gemma":[0.00017969945,0.00013772782,0.000050461244,0.0020628052,0.000012345286,0.00018094307,1.4446468e-7,0.9715342,0.000064495085,0.0032324272,0.021881068,0.0006636655],"about_ca_topic_score_codex":0.00004734799,"about_ca_topic_score_gemma":0.000005093486,"teacher_disagreement_score":0.39241195,"about_ca_system_score_codex":0.00051998754,"about_ca_system_score_gemma":0.0011831514,"threshold_uncertainty_score":0.9999382},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046213367,0.00030624913,0.9894102,0.00082565384,0.0017676101,0.0014090331,0.00000246798,0.0001915029,0.0014659066],"genre_scores_gemma":[0.6616821,0.000088955065,0.31423712,0.0039499206,0.0019420158,0.001135114,0.000032392003,0.00019448675,0.016737852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958602,0.000098027915,0.000500446,0.0015016741,0.0012784263,0.000761236],"domain_scores_gemma":[0.99395,0.0034443056,0.00039725512,0.0015690271,0.0005162056,0.00012320744],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019230222,0.0005187235,0.00043981633,0.0003006945,0.001009539,0.0016928301,0.004808791,0.00022198205,0.000024266345],"category_scores_gemma":[0.00066804537,0.0003602456,0.00013351046,0.0003217269,0.0011370291,0.00046569767,0.0011203965,0.0011545811,0.00006255954],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002851676,0.000037622503,0.00090260553,0.000081441634,0.000025375872,0.000004329866,0.00462652,0.043592624,0.000024620067,0.021680482,0.000043964603,0.9289519],"study_design_scores_gemma":[0.0021719846,0.009277442,0.0032253005,0.0017706006,0.000071447816,0.0003775735,0.00004858555,0.42658332,0.0006888553,0.24155791,0.31028375,0.003943228],"about_ca_topic_score_codex":0.000026664336,"about_ca_topic_score_gemma":0.000059958435,"teacher_disagreement_score":0.92500865,"about_ca_system_score_codex":0.0003385415,"about_ca_system_score_gemma":0.0010246171,"threshold_uncertainty_score":0.99988496},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008261406,0.000323857,0.99704087,0.00015178983,0.0009004024,0.00093646493,0.000023001414,0.0003185171,0.00022249845],"genre_scores_gemma":[0.11314584,0.00001029532,0.8853675,0.00084823475,0.00043775598,0.000017571878,0.000011489121,0.000044887664,0.00011640522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960327,0.000052218435,0.00050285284,0.0015401802,0.0011534068,0.0007186314],"domain_scores_gemma":[0.996272,0.00071612775,0.00031297907,0.0014425891,0.00097601773,0.00028023322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018935612,0.0004866507,0.00052948087,0.00085573655,0.00029681044,0.000670196,0.002943718,0.00035041818,0.0000072924904],"category_scores_gemma":[0.00022059189,0.00046024064,0.00013170442,0.0005497017,0.0005550417,0.0017450689,0.0003571594,0.00071703474,0.000009367063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100640085,0.00006360168,0.000017811113,0.00005289391,0.000007216966,0.00007430656,0.000176566,0.15577799,0.011976594,0.00610214,0.000026269305,0.825624],"study_design_scores_gemma":[0.00040105305,0.00060058245,0.000013218442,0.00022710187,0.000007925624,0.000038937476,1.7490588e-7,0.87477046,0.023866883,0.097867765,0.0016587032,0.0005471693],"about_ca_topic_score_codex":0.000021392907,"about_ca_topic_score_gemma":0.000012372922,"teacher_disagreement_score":0.8250768,"about_ca_system_score_codex":0.0006027432,"about_ca_system_score_gemma":0.0015134605,"threshold_uncertainty_score":0.99978495},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050925347,0.0028322819,0.9784096,0.00981176,0.0026077598,0.0006173854,0.00012824056,0.00018055653,0.004903149],"genre_scores_gemma":[0.87332124,0.0032748734,0.105151966,0.009430583,0.008042267,0.00001725967,0.00021451258,0.000108558976,0.00043872886],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996738,0.00006008586,0.00026860647,0.0013000169,0.00088861305,0.0007446588],"domain_scores_gemma":[0.9976613,0.00032412546,0.00014816348,0.0015103807,0.00011013115,0.0002459133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004052654,0.00027718022,0.0002958863,0.0001668625,0.0010847443,0.0006960774,0.003942487,0.0008600981,0.00005639624],"category_scores_gemma":[0.001052024,0.00026864337,0.00003586568,0.00028258993,0.0022259115,0.0009234114,0.006040303,0.0018372904,0.000021045544],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146560815,0.000025344314,0.0006264498,0.000081979764,0.000014613147,0.000021078267,0.023470439,0.00007899877,0.000027725053,0.034810152,0.0002959209,0.9405326],"study_design_scores_gemma":[0.00048484092,0.00009910471,0.00066036795,0.00056296686,0.00003491641,0.00004043752,0.00002800281,0.025483543,0.00009190788,0.6204595,0.35060868,0.0014457424],"about_ca_topic_score_codex":0.001279252,"about_ca_topic_score_gemma":0.007619375,"teacher_disagreement_score":0.9390869,"about_ca_system_score_codex":0.00017183578,"about_ca_system_score_gemma":0.00038058602,"threshold_uncertainty_score":0.9999766},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034931002,0.00015823617,0.95087004,0.00030499298,0.0058453814,0.00082669524,0.00007224083,0.00019449285,0.041378617],"genre_scores_gemma":[0.39611366,0.00004482794,0.56398296,0.0031425091,0.0022564752,0.000062501465,0.00031232162,0.00015607577,0.03392865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98880744,0.00013506468,0.0013231218,0.003994037,0.0048091887,0.00093115395],"domain_scores_gemma":[0.9914346,0.00093578297,0.0006019008,0.0060467985,0.0005571507,0.00042376717],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009522437,0.00065287715,0.00075503666,0.0022221147,0.0005890217,0.0032476175,0.007994549,0.00020051538,0.00048579674],"category_scores_gemma":[0.00032994323,0.00049318693,0.000174379,0.0014799945,0.0009283826,0.0010630159,0.0047100205,0.00059342984,0.0020497849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000097632565,0.000046201072,0.00002590022,0.000059204154,0.000017489665,0.00020480614,0.00024992062,0.05452649,0.000013557204,0.038005944,0.0038389233,0.9030018],"study_design_scores_gemma":[0.00038535302,0.00014587498,0.000298857,0.0006897269,0.00003268154,0.00005551168,0.000020856764,0.8771248,0.00004338795,0.0823241,0.03786425,0.0010146364],"about_ca_topic_score_codex":0.00015495946,"about_ca_topic_score_gemma":0.00011907228,"teacher_disagreement_score":0.90198714,"about_ca_system_score_codex":0.0005082296,"about_ca_system_score_gemma":0.00020885462,"threshold_uncertainty_score":0.999752},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007145355,0.001157601,0.9949112,0.00042491942,0.0023814384,0.00043890544,0.00005277954,0.00008492368,0.00047676277],"genre_scores_gemma":[0.12725025,0.00008491877,0.87093526,0.00015374427,0.0007223928,0.0000036548236,0.0007585395,0.000022915601,0.00006833499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99568814,0.000062745166,0.00073456496,0.0018118301,0.0012587435,0.00044398755],"domain_scores_gemma":[0.9940127,0.00035467595,0.0006181764,0.0044942847,0.00037587574,0.00014425501],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024487067,0.0003889055,0.00044791744,0.0014805838,0.00018648962,0.00028562834,0.006693687,0.00025631074,0.000023321605],"category_scores_gemma":[0.00022253909,0.0003808548,0.00005367248,0.0017363888,0.0003267111,0.0032060544,0.004866185,0.0005039027,0.00003240455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045926026,0.000058727244,0.0000075484727,0.000053156986,0.000013098797,0.0000031966501,0.00017947603,0.1278508,0.00029319277,0.0040764795,0.00010576157,0.867354],"study_design_scores_gemma":[0.00016311044,0.000070520335,0.000109485816,0.000116630414,0.000018914921,0.00012524893,1.4140028e-7,0.96080494,0.0012451095,0.03627683,0.00068390946,0.00038517528],"about_ca_topic_score_codex":0.000027148919,"about_ca_topic_score_gemma":0.000016205122,"teacher_disagreement_score":0.8669688,"about_ca_system_score_codex":0.00017957766,"about_ca_system_score_gemma":0.00051374425,"threshold_uncertainty_score":0.99986434},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034684679,0.003078207,0.9066233,0.022642916,0.0049509527,0.0012918663,0.000019770436,0.00022922004,0.057695307],"genre_scores_gemma":[0.97161317,0.001134378,0.023749117,0.0012165084,0.0012234726,0.000011201901,0.000102928025,0.000021758084,0.000927452],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983083,0.00009524777,0.00025804463,0.00039867553,0.00066858047,0.0002711394],"domain_scores_gemma":[0.99839497,0.00038446227,0.00020057119,0.00041699354,0.000417455,0.00018556748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014846015,0.00017248209,0.00020135564,0.00039705393,0.0005404984,0.00023261902,0.0005512647,0.0002312326,0.00006950545],"category_scores_gemma":[0.00018272828,0.00018508518,0.00002822669,0.00025990978,0.0015785953,0.0003868349,0.00012948981,0.00029556328,0.000030835527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019455425,0.00006687498,0.002179334,0.00006893882,0.000022055718,0.000003257024,0.29548293,0.0017884884,0.00008735482,0.20224741,0.0013287071,0.49670517],"study_design_scores_gemma":[0.0011019391,0.00021598104,0.002959665,0.00075051375,0.000084937325,0.000022052407,0.0003870547,0.03618637,0.00023707622,0.84322226,0.11322348,0.0016086533],"about_ca_topic_score_codex":0.0014882038,"about_ca_topic_score_gemma":0.0015853872,"teacher_disagreement_score":0.9681447,"about_ca_system_score_codex":0.00061309704,"about_ca_system_score_gemma":0.0013528466,"threshold_uncertainty_score":0.7547555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053778667,0.00004838572,0.94505244,0.00030259887,0.00042667348,0.00032599762,0.0000020280343,0.000060540107,0.0000026538175],"genre_scores_gemma":[0.5774403,0.000002755555,0.4221013,0.0003583993,0.0000606783,0.00003277168,0.0000011710887,0.0000024142782,1.6684224e-7],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984198,0.00008696566,0.00035526653,0.0003436716,0.00040968746,0.0003845847],"domain_scores_gemma":[0.9978998,0.0015196337,0.000093679824,0.00027869176,0.000095742675,0.0001124702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012827987,0.00010812456,0.00018437617,0.0003911159,0.00012534297,0.00006257004,0.0006679048,0.000081825456,0.000006060765],"category_scores_gemma":[0.0008671864,0.000097104334,0.000052674655,0.0010253883,0.00028328566,0.00076561404,0.00022507083,0.00021822628,0.000001545919],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021317854,0.00014771764,0.0022156343,0.000028038043,0.0000022719823,0.0000010291849,0.0015453518,0.00425844,0.21146207,0.00025196275,0.000006888781,0.7800593],"study_design_scores_gemma":[0.000664149,0.00007136,0.009491863,0.000061865765,0.0000010232028,0.000004779333,9.1251314e-7,0.33388662,0.6500598,0.0056620515,0.000002943261,0.0000925899],"about_ca_topic_score_codex":0.0000421082,"about_ca_topic_score_gemma":0.000088127636,"teacher_disagreement_score":0.7799667,"about_ca_system_score_codex":0.00008732542,"about_ca_system_score_gemma":0.00010163203,"threshold_uncertainty_score":0.39598},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5230866,0.00004376257,0.47648343,0.000084858366,0.000126565,0.00015909148,5.368847e-7,0.0000105757435,0.0000045849833],"genre_scores_gemma":[0.7693559,0.000002816206,0.23016943,0.0004148488,0.000045229383,0.0000030214878,0.000004236035,0.000003777561,7.5828143e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919623,0.00002112205,0.0001777316,0.00023500777,0.00018603237,0.00018384798],"domain_scores_gemma":[0.99957776,0.00006358382,0.000070134905,0.00013619353,0.000104469196,0.000047855072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010931105,0.000081290134,0.00014535002,0.0001535909,0.000046662844,0.000026340622,0.0001196471,0.00004648494,0.000055502165],"category_scores_gemma":[0.000039865125,0.00006554897,0.000021002474,0.0004817475,0.00022473205,0.00024682903,0.000085785934,0.00008261515,0.0000039353004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000323359,0.00008263497,0.10906787,0.000059822254,0.0000056365543,0.00002296531,0.001237632,0.27796203,0.27803928,0.000007748157,6.580429e-7,0.33348137],"study_design_scores_gemma":[0.00043279634,0.00014130119,0.08998251,0.000048625498,0.000005633946,0.0001033487,7.0391246e-7,0.8245283,0.084256604,0.0004333394,9.629974e-7,0.00006591909],"about_ca_topic_score_codex":0.00008898601,"about_ca_topic_score_gemma":0.0000014215723,"teacher_disagreement_score":0.54656625,"about_ca_system_score_codex":0.000046955232,"about_ca_system_score_gemma":0.00005329019,"threshold_uncertainty_score":0.26730093},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047869635,0.01464742,0.98087925,0.00033957587,0.0015299906,0.0002556978,0.000008919259,0.0007385191,0.0015527767],"genre_scores_gemma":[0.13404913,0.000025403106,0.8640535,0.000680903,0.00094905176,0.000009888309,0.000012498143,0.000037385606,0.00018227739],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965435,0.000042935255,0.0004883598,0.0014135893,0.0007587319,0.0007528844],"domain_scores_gemma":[0.99736786,0.00049472955,0.00030974072,0.0013794729,0.0002170589,0.00023112948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076231384,0.00053868553,0.00047121997,0.0007828339,0.00030665763,0.00047293084,0.0034380564,0.00040670778,0.000043033786],"category_scores_gemma":[0.00014369341,0.00048087398,0.00013151624,0.00062882854,0.0003841496,0.0011584826,0.0022990163,0.0011187933,0.00006830155],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002662639,0.000030713272,0.00012269133,0.000025659008,0.0000072207586,0.000059858063,0.0009915257,0.00018148588,0.00043201048,0.019746022,0.00003135462,0.9783688],"study_design_scores_gemma":[0.00018369517,0.000079829384,0.00012754994,0.0009889604,0.000014502336,0.00009293781,1.2995051e-7,0.25970945,0.004038515,0.7324106,0.001349443,0.0010043884],"about_ca_topic_score_codex":0.000091429676,"about_ca_topic_score_gemma":0.000066711385,"teacher_disagreement_score":0.9773644,"about_ca_system_score_codex":0.00044738027,"about_ca_system_score_gemma":0.00043357455,"threshold_uncertainty_score":0.9997643},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031091232,0.0003425367,0.9954254,0.0004964593,0.0011293468,0.0008356591,0.000016152686,0.00019462491,0.0012489312],"genre_scores_gemma":[0.8865662,0.0000026792616,0.10167006,0.010027275,0.0006727221,0.0000388227,0.00090471935,0.00003301555,0.00008450964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733883,0.000020502794,0.00049603544,0.0010205298,0.000579008,0.00054510153],"domain_scores_gemma":[0.99847555,0.000017769491,0.00014712577,0.0008070731,0.00047723728,0.00007526686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009685332,0.0004231766,0.00037091435,0.0009130178,0.00032500844,0.0004422946,0.0009268146,0.00014954212,0.00008121749],"category_scores_gemma":[0.000058924998,0.00040108955,0.00006061657,0.00075436465,0.00017525957,0.0007886822,0.00026270596,0.00035401154,0.00015367582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022967304,0.00014413559,0.0004234866,0.00094320695,0.00000695292,0.0000012750959,0.0017102202,0.5080916,0.000014802992,0.00073313946,0.00014753403,0.48776063],"study_design_scores_gemma":[0.000307521,0.00004162926,0.0018456732,0.00035459184,0.000012651623,4.59102e-7,0.000022422622,0.96804464,0.000022814094,0.00023222885,0.028444106,0.0006712668],"about_ca_topic_score_codex":0.0011254185,"about_ca_topic_score_gemma":0.00060671376,"teacher_disagreement_score":0.8937553,"about_ca_system_score_codex":0.00041146151,"about_ca_system_score_gemma":0.00022415274,"threshold_uncertainty_score":0.9998441},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010346257,0.00015349823,0.9947473,0.00015164103,0.0007696084,0.00043933615,0.000003269162,0.00004007029,0.0026606924],"genre_scores_gemma":[0.35221303,0.0000071279437,0.6474802,0.00014869035,0.000078110636,0.0000146675875,0.0000033773736,0.000010339048,0.000044466415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572945,0.00017851725,0.0007295891,0.0009837524,0.002027145,0.00035157334],"domain_scores_gemma":[0.9975594,0.0003495383,0.0005000207,0.0010118008,0.00051406753,0.000065166954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00602907,0.0002917817,0.00039002302,0.0008320355,0.00009522235,0.00010079905,0.0017163253,0.00028552543,0.000014498005],"category_scores_gemma":[0.0004893514,0.00028368938,0.00007288366,0.00059992017,0.0004785661,0.0006790013,0.00042847474,0.0005776779,0.0000079976435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005293409,0.000012209887,0.00006659243,0.000014689867,0.0000023013456,7.6985077e-7,0.0005616483,0.59954363,0.00006338587,0.15560508,0.0000016997718,0.2441227],"study_design_scores_gemma":[0.00027439618,0.00004703141,0.00044266184,0.00015888069,0.000005160438,0.0000031443906,8.6116685e-8,0.77572566,0.0009796508,0.22209714,0.000046317127,0.00021987931],"about_ca_topic_score_codex":0.000009910113,"about_ca_topic_score_gemma":0.00005358623,"teacher_disagreement_score":0.35117838,"about_ca_system_score_codex":0.00042477174,"about_ca_system_score_gemma":0.0011009023,"threshold_uncertainty_score":0.99996156},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023599982,0.000064747626,0.99674314,0.00021883761,0.00071229134,0.00055560324,0.00004968188,0.000093701216,0.0013260003],"genre_scores_gemma":[0.6925442,0.00007105926,0.30453283,0.0012283406,0.0006097574,0.000049327657,0.0005356108,0.00006317172,0.00036569408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642384,0.000028742974,0.00040868475,0.001557978,0.0009564156,0.0006243235],"domain_scores_gemma":[0.9977951,0.00013772538,0.00024298523,0.0016264721,0.000079191275,0.00011851076],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004808501,0.00047919276,0.000396875,0.0008204888,0.00013347983,0.0011311696,0.0033366953,0.00013519937,0.000032183358],"category_scores_gemma":[0.000026902337,0.0003992003,0.000038049344,0.0005499978,0.0002745192,0.0022471128,0.0015159243,0.0005374326,0.000079998244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007201188,0.00005929734,0.00041429646,0.00009485008,0.000012801891,0.00024424572,0.00059549656,0.015160222,0.000029828974,0.0048460653,0.00006500613,0.9784707],"study_design_scores_gemma":[0.0008814805,0.0003465275,0.0074940184,0.0013231699,0.000011673563,0.000048331967,0.0000010919986,0.9696046,0.0009367208,0.016616235,0.001349885,0.0013862718],"about_ca_topic_score_codex":0.0004640802,"about_ca_topic_score_gemma":0.0014444069,"teacher_disagreement_score":0.9770844,"about_ca_system_score_codex":0.00021431799,"about_ca_system_score_gemma":0.00024805957,"threshold_uncertainty_score":0.99990577},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005081311,0.00030400805,0.9914209,0.0002331767,0.001130378,0.00010566073,7.2979617e-7,0.00011629124,0.0066379933],"genre_scores_gemma":[0.9456304,0.0002106591,0.03964117,0.0015184166,0.0026515168,0.000023711325,0.0000051436277,0.0001154556,0.010203542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894434,0.000008244214,0.00017758126,0.00031438173,0.00030978842,0.00024564654],"domain_scores_gemma":[0.99931526,0.00013345519,0.000027679063,0.0003980452,0.000050580526,0.00007500171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002977368,0.00019409184,0.0001922468,0.00023068674,0.00015362517,0.00017111629,0.00054805656,0.000105648156,0.000016225813],"category_scores_gemma":[0.00003159588,0.00013678981,0.00006802921,0.00024033256,0.00011841381,0.00003716793,0.00008874999,0.00027149834,0.00008653336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.4458403e-7,6.733382e-7,0.000005818373,0.000004141119,0.0000073820047,0.0000017854497,0.00007666971,0.19406411,0.000121107565,0.0003028399,0.0001591499,0.80525535],"study_design_scores_gemma":[0.00003907761,0.00004398047,0.00014148369,0.00007256032,0.000011518702,0.0000041366907,2.8114483e-8,0.94529104,0.0006766071,0.00798666,0.045426704,0.00030618644],"about_ca_topic_score_codex":0.000035641042,"about_ca_topic_score_gemma":0.0004988318,"teacher_disagreement_score":0.9517798,"about_ca_system_score_codex":0.00012998164,"about_ca_system_score_gemma":0.00002430042,"threshold_uncertainty_score":0.55781263},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000073073265,0.008878476,0.7799295,0.046510857,0.0025971953,0.0026672098,0.00004819549,0.00020502297,0.15909047],"genre_scores_gemma":[0.7594182,0.0046272404,0.05413246,0.08803205,0.032418933,0.014007197,0.00050402485,0.0007472936,0.046112582],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99746674,0.000036686004,0.00047469733,0.0009035163,0.00057451054,0.00054385257],"domain_scores_gemma":[0.9976251,0.0005359343,0.00027374408,0.0011990941,0.0001664418,0.00019967389],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00085058267,0.00034563537,0.00043082805,0.00026072245,0.0005833481,0.00005986624,0.0013255143,0.00013825418,0.0003578371],"category_scores_gemma":[0.000048170717,0.00023250312,0.000063067324,0.00048898056,0.00125935,0.00004768981,0.00038400132,0.0007603401,0.0009883734],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007889595,0.00008275422,0.0000659681,0.000029205008,0.00005182177,0.000015436815,0.014691738,0.0005769318,0.000015404501,0.19833364,0.0054056365,0.7807236],"study_design_scores_gemma":[0.00035074988,0.00025591275,0.00012658666,0.00020769122,0.000022170236,0.00005378694,0.00006667908,0.00046453826,0.00000567204,0.068205215,0.92980516,0.000435806],"about_ca_topic_score_codex":0.00030673994,"about_ca_topic_score_gemma":0.0002605414,"teacher_disagreement_score":0.92439955,"about_ca_system_score_codex":0.00022090992,"about_ca_system_score_gemma":0.0002819659,"threshold_uncertainty_score":0.9997895},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14219794,0.030293893,0.6322382,0.06643749,0.0074010743,0.008658592,0.00007506639,0.0013582092,0.11133953],"genre_scores_gemma":[0.9795435,0.00018023314,0.019592581,0.00037458536,0.00017071186,0.000009798689,0.0000058857277,0.000020701002,0.00010199978],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966864,0.0001517558,0.0007140314,0.0006125643,0.0012945253,0.0005407232],"domain_scores_gemma":[0.99632496,0.0014807296,0.0006622577,0.00097102125,0.00047739228,0.00008365846],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0046801823,0.00026742404,0.0004383433,0.00068972685,0.0005600798,0.00009241437,0.0030268622,0.0004789206,0.000015947273],"category_scores_gemma":[0.0019272645,0.0002133806,0.0000690827,0.0011170297,0.003219484,0.0002970984,0.0015711456,0.0010196635,0.0000069103435],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014552377,0.00004329011,0.0035248278,0.000048338406,0.000008622391,0.000019046574,0.09385185,0.0011717097,0.000030100535,0.022548942,0.00007318325,0.8786655],"study_design_scores_gemma":[0.0044354126,0.0005972439,0.031303026,0.01298155,0.000085683154,0.000041603424,0.0020753057,0.06531559,0.0028738931,0.8542257,0.022410473,0.0036545089],"about_ca_topic_score_codex":0.0019313795,"about_ca_topic_score_gemma":0.01216812,"teacher_disagreement_score":0.875011,"about_ca_system_score_codex":0.00038274127,"about_ca_system_score_gemma":0.0010250483,"threshold_uncertainty_score":0.9994932},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004792508,0.000059392103,0.991088,0.00007772825,0.0006693327,0.00014060947,0.0000074203995,0.00011275105,0.0030522626],"genre_scores_gemma":[0.9583417,8.5054984e-7,0.036966898,0.00028610427,0.0041913893,0.0000064463975,0.00006166033,0.00004811353,0.00009680344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975122,0.000038206355,0.0004847404,0.0009951591,0.00043653222,0.00053311646],"domain_scores_gemma":[0.99846125,0.0004852141,0.00034668783,0.00054518867,0.000074285526,0.000087379995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042431077,0.00046832315,0.0006490908,0.00028747346,0.0003037577,0.00034192463,0.0011843612,0.00017426365,0.00020464753],"category_scores_gemma":[0.000010004375,0.000465678,0.00034181844,0.00018811025,0.00021263078,0.00009786891,0.00082651747,0.00075814326,0.000009019977],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029875457,0.000011193303,0.009716044,0.0000045585375,0.00007522497,0.000012277514,0.0004306822,0.014717741,0.000016458467,0.0028475309,0.00008871346,0.9720766],"study_design_scores_gemma":[0.000251204,0.000057080284,0.0009650141,0.0009289973,0.00009996674,0.0000011302952,9.958056e-7,0.8504992,0.00013352674,0.14452313,0.0014717585,0.0010679626],"about_ca_topic_score_codex":0.00024920047,"about_ca_topic_score_gemma":0.00012629275,"teacher_disagreement_score":0.9710086,"about_ca_system_score_codex":0.0001099702,"about_ca_system_score_gemma":0.000079503065,"threshold_uncertainty_score":0.9997795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007187383,0.00013251623,0.97292143,0.0016813547,0.003218564,0.00072773715,0.0000067040273,0.0002246537,0.020368295],"genre_scores_gemma":[0.6992788,0.000021184369,0.29894528,0.00095942896,0.00065533596,0.000018326471,0.0000065015083,0.00006848862,0.000046699057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931935,0.000118878284,0.0010195142,0.0025286078,0.0016845639,0.0014548996],"domain_scores_gemma":[0.99494654,0.0010196717,0.0007807819,0.0020825558,0.00067827274,0.00049215474],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001907264,0.0010725579,0.0010416374,0.0019015404,0.0006662861,0.0021429455,0.004007238,0.0005204907,0.000104633335],"category_scores_gemma":[0.00024227098,0.0010102335,0.0004186955,0.0016934903,0.0013177353,0.0032156974,0.0018481739,0.0020909496,0.00008670923],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022049207,0.00078990124,0.00018118718,0.0003832788,0.00030074382,0.0037310696,0.0068916604,0.010488888,0.002985363,0.16991983,0.00020341041,0.8039042],"study_design_scores_gemma":[0.0006507501,0.0005321614,0.00022301027,0.0009821252,0.000042704243,0.0013166462,0.0000055156247,0.67672294,0.00072268385,0.3150578,0.0020488515,0.0016948071],"about_ca_topic_score_codex":0.00013422607,"about_ca_topic_score_gemma":0.00007341025,"teacher_disagreement_score":0.8022094,"about_ca_system_score_codex":0.0006254784,"about_ca_system_score_gemma":0.0021284658,"threshold_uncertainty_score":0.9992348},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006136969,0.001462896,0.98943776,0.0041413177,0.0032400687,0.00044983928,0.0000027558767,0.00021580196,0.0009881858],"genre_scores_gemma":[0.9150007,0.000056885117,0.08198061,0.0016663697,0.0006801935,0.000030277275,0.0000050363597,0.000037186186,0.00054278283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646324,0.00008098416,0.0005709341,0.0009885208,0.001196338,0.0006999924],"domain_scores_gemma":[0.99553066,0.0012058443,0.00036593273,0.0024126838,0.0002713384,0.00021353053],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017189598,0.00040701817,0.00032926642,0.00042666125,0.0006169319,0.0011043453,0.00457309,0.0003518367,0.000026049423],"category_scores_gemma":[0.00018863732,0.00029991756,0.00015012508,0.00059996895,0.00072145334,0.00042773093,0.0006416593,0.00080883875,0.00030618734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004909865,0.00006194565,0.00016714507,0.000049262417,0.000017786251,0.000007852512,0.009058372,0.0004216877,0.00010497911,0.39374995,0.00009857515,0.5962575],"study_design_scores_gemma":[0.00015145003,0.000043091728,0.0002550237,0.00027270472,0.000010002631,0.0000144337955,2.430014e-7,0.73340905,0.0003262501,0.23329504,0.031753153,0.0004695568],"about_ca_topic_score_codex":0.000007697477,"about_ca_topic_score_gemma":0.000042570216,"teacher_disagreement_score":0.9149393,"about_ca_system_score_codex":0.00023374823,"about_ca_system_score_gemma":0.0005954857,"threshold_uncertainty_score":0.9999453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028334013,0.000011550292,0.9942004,0.0010391743,0.00050997775,0.00086407067,4.2806954e-7,0.00026752093,0.00027345648],"genre_scores_gemma":[0.3458034,0.0000011154204,0.6517741,0.0022821166,0.00006658388,0.00006227807,0.0000020910054,0.000005923961,0.0000023729772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997134,0.000075736796,0.00041035612,0.00095735246,0.00091906637,0.0005035455],"domain_scores_gemma":[0.99830425,0.00015239167,0.00013619356,0.0008473873,0.0002991666,0.00026063054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083130616,0.00021262691,0.00020800534,0.00045519482,0.00019706986,0.0007799518,0.0018337754,0.000089068526,0.000024049801],"category_scores_gemma":[0.00024709493,0.00018570358,0.00003539259,0.0025143556,0.00029073266,0.0006721972,0.0004900227,0.00022577995,0.000049135055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.804518e-7,0.000076365286,0.000059306454,0.000009696459,0.0000011175885,0.0000020225752,0.00087852357,0.78208596,0.00337855,0.0001299232,0.00007269641,0.21330486],"study_design_scores_gemma":[0.00015985213,0.00009591785,0.000548669,0.00003251921,0.0000011197507,0.000017861872,0.0000011676674,0.97189754,0.026515571,0.0005058158,0.000004671115,0.00021926964],"about_ca_topic_score_codex":0.000105754894,"about_ca_topic_score_gemma":0.000002629368,"teacher_disagreement_score":0.34297,"about_ca_system_score_codex":0.00018500647,"about_ca_system_score_gemma":0.00020429675,"threshold_uncertainty_score":0.75727725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019274175,0.0049104947,0.87060446,0.03466823,0.0063802223,0.003072387,0.0001420696,0.00027281235,0.060675148],"genre_scores_gemma":[0.92535096,0.0045543355,0.04242925,0.024775168,0.00094085414,0.00000561521,0.00021135916,0.000039373892,0.001693061],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786633,0.00012821841,0.00059266173,0.0001065855,0.0009387913,0.0003674063],"domain_scores_gemma":[0.9984025,0.00032218057,0.00039362145,0.0003749919,0.00037917064,0.00012757463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026771675,0.00016892843,0.00027152005,0.0004128636,0.00047253867,0.0002662179,0.0009961618,0.00016404846,0.00002729059],"category_scores_gemma":[0.00025605032,0.00012350704,0.00003657304,0.000413475,0.0010105481,0.0009301892,0.00019101537,0.0004141784,0.000008948764],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024751107,0.000026293397,0.000044294462,0.000029153518,0.0000057208103,6.3075225e-7,0.33862558,0.040569443,0.000001614215,0.06583224,0.0013006246,0.55353963],"study_design_scores_gemma":[0.0014301855,0.000591196,0.0012687632,0.0015598873,0.000005386697,0.000010036186,0.002854502,0.35489228,0.00012079603,0.04811147,0.5880377,0.0011177927],"about_ca_topic_score_codex":0.0041714488,"about_ca_topic_score_gemma":0.0128252255,"teacher_disagreement_score":0.9060768,"about_ca_system_score_codex":0.00044813225,"about_ca_system_score_gemma":0.00208044,"threshold_uncertainty_score":0.7156777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037471936,0.0002552597,0.9959208,0.0002701293,0.0016827892,0.0008185508,0.000002101215,0.00013416176,0.0005415123],"genre_scores_gemma":[0.11337808,0.000014564183,0.88552094,0.0006048808,0.00014631238,0.000063184656,0.0000019834172,0.000030694602,0.00023938467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967783,0.0000537738,0.0005933544,0.0013276768,0.0006145863,0.0006322798],"domain_scores_gemma":[0.99782217,0.00032134252,0.00027022845,0.001327553,0.00018778865,0.00007094159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019883418,0.00042091528,0.00048585449,0.00083843863,0.00017496744,0.0004032397,0.003135114,0.00030619843,0.000003095936],"category_scores_gemma":[0.00037590522,0.00037905737,0.00010737796,0.00046697003,0.00044911512,0.0004432078,0.0007718936,0.0005804033,0.000017694008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011069647,0.000015494355,0.000024679197,0.00013316478,0.000003554337,0.0000062599775,0.0007104907,0.02369878,0.00048349443,0.04633728,0.0000026716307,0.9285731],"study_design_scores_gemma":[0.0002384093,0.00014571467,0.00015755321,0.00048525693,0.0000028910458,0.000021718404,9.344786e-8,0.9275854,0.0014749301,0.068272196,0.0011198042,0.0004960102],"about_ca_topic_score_codex":0.000009788917,"about_ca_topic_score_gemma":0.00004715887,"teacher_disagreement_score":0.92807704,"about_ca_system_score_codex":0.00047179367,"about_ca_system_score_gemma":0.000372439,"threshold_uncertainty_score":0.9998661},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010210447,0.00015305632,0.9954204,0.001636488,0.0011230281,0.0006071532,0.00014329233,0.0001772303,0.0006372303],"genre_scores_gemma":[0.102943204,0.000012633487,0.89251107,0.0028057077,0.0010885746,0.0000315737,0.00011356503,0.00006799659,0.00042565662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594855,0.000027639995,0.0005911398,0.0018441337,0.0007783141,0.0008102193],"domain_scores_gemma":[0.99641263,0.0007514776,0.00040401347,0.0019407271,0.00024586858,0.00024528595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006698658,0.00062600337,0.000648206,0.00061976304,0.00039533374,0.00086621515,0.0044766166,0.00031439355,0.000018778284],"category_scores_gemma":[0.00008600877,0.0005530082,0.0001744915,0.00048514025,0.0004508522,0.00036747084,0.0007471347,0.000556368,0.000016679931],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017965307,0.000013406787,0.000038228416,0.000035744248,0.000013316631,0.000010184627,0.00045802837,0.0056427857,0.000104437604,0.008105134,0.00033357771,0.9852434],"study_design_scores_gemma":[0.00041019917,0.00023951684,0.00015093411,0.0003552946,0.000015587684,0.00006399393,3.6433352e-7,0.9248852,0.0005261385,0.059552692,0.013003952,0.00079610804],"about_ca_topic_score_codex":0.00006466718,"about_ca_topic_score_gemma":0.00023107418,"teacher_disagreement_score":0.98444724,"about_ca_system_score_codex":0.00026969056,"about_ca_system_score_gemma":0.00042541398,"threshold_uncertainty_score":0.99969214},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.4680014e-7,0.00026733257,0.9633331,0.00017707139,0.0012335891,0.0002626775,0.0000012031072,0.00022859726,0.034495734],"genre_scores_gemma":[0.029961865,0.00082670874,0.9614338,0.0007813607,0.0009148986,0.000028588944,0.00003253165,0.00018941185,0.0058308314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987373,0.000011221775,0.0002700606,0.00035757796,0.0003261524,0.00029768434],"domain_scores_gemma":[0.9991108,0.00018828223,0.0000736237,0.00046645405,0.00010040013,0.00006041895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041540375,0.00024830105,0.00017998894,0.0001693135,0.00019743628,0.0003161979,0.0006077526,0.0001788477,0.000028348497],"category_scores_gemma":[0.000026869551,0.00018728065,0.000046258072,0.00019511559,0.00025471186,0.000088356166,0.00011008963,0.0003604541,0.00002822125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.6586355e-7,9.853436e-7,0.0000033602735,0.000023144165,0.00000398271,6.9914233e-7,0.00011480213,0.8911064,0.0000024432788,0.0019848912,0.000121147736,0.10663736],"study_design_scores_gemma":[0.000073757394,0.00002296987,0.0000018887162,0.00014524272,0.0000038318594,0.000006826782,2.4946283e-8,0.97345376,0.000048645168,0.0125102755,0.013499142,0.00023366295],"about_ca_topic_score_codex":0.0000016436708,"about_ca_topic_score_gemma":0.000024526022,"teacher_disagreement_score":0.1064037,"about_ca_system_score_codex":0.00010825542,"about_ca_system_score_gemma":0.00006390232,"threshold_uncertainty_score":0.76370835},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007448175,0.00019788567,0.9727407,0.00088377745,0.000703805,0.00034901837,0.0000037837926,0.00012907994,0.024917433],"genre_scores_gemma":[0.07742778,0.000040099236,0.91937387,0.0027815234,0.00024906447,0.000007217028,0.0000029560815,0.000020655782,0.00009681683],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684596,0.000023508057,0.00039488566,0.0014469812,0.0007376151,0.00055105815],"domain_scores_gemma":[0.99762106,0.00058598066,0.0001700837,0.0013144456,0.00013501904,0.000173428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010866547,0.00041240518,0.0003888016,0.0006344205,0.00029825923,0.00045449275,0.0017537284,0.00029746737,0.000007449137],"category_scores_gemma":[0.00010126887,0.0003422483,0.00008466831,0.00048387918,0.0007542515,0.00034347273,0.0009410576,0.00072245585,0.000035459543],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035323585,0.00002688187,0.000028087396,0.000021615215,0.00000234166,0.00003481649,0.00039210086,0.002451286,0.000003990349,0.09704218,0.000007217061,0.89998597],"study_design_scores_gemma":[0.00020928822,0.00026866104,0.00068028463,0.00015536934,0.000004649962,0.00006540371,7.6345415e-8,0.46730584,0.000090034926,0.5281475,0.0025040393,0.00056881085],"about_ca_topic_score_codex":0.000016947619,"about_ca_topic_score_gemma":0.00005545407,"teacher_disagreement_score":0.89941716,"about_ca_system_score_codex":0.00022345896,"about_ca_system_score_gemma":0.00026349028,"threshold_uncertainty_score":0.99990296},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45628712,0.00004551863,0.5432105,0.00026357576,0.00012119317,0.000060970055,0.0000020677046,0.0000013875913,0.000007641299],"genre_scores_gemma":[0.9581101,0.000005967397,0.041379835,0.0004421451,0.000054068583,0.0000024066258,0.0000022123493,0.0000025300224,7.6988067e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993929,0.000023849776,0.000094556926,0.00019752508,0.00016850542,0.00012263164],"domain_scores_gemma":[0.99962956,0.000012610786,0.00004354397,0.000245617,0.0000493367,0.000019362082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025415784,0.00005931991,0.00005783416,0.000036928053,0.00006176763,0.000022277149,0.00028504757,0.00003134498,0.0000018519708],"category_scores_gemma":[0.000035630073,0.000041372907,0.00003578264,0.00030913146,0.00020430406,0.0000038420767,0.00018151102,0.000049838553,4.740954e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028054299,0.000026630178,0.005342949,0.0000040835716,0.0000022386519,4.5131975e-7,0.00008252631,0.06058611,0.90946174,0.000014104912,0.0000033826523,0.02447297],"study_design_scores_gemma":[0.00019163858,0.000073160045,0.028015437,0.000009569884,0.0000017126983,0.0000065148874,0.0000010633146,0.00082434877,0.9700057,0.0007967906,0.000020443207,0.000053646625],"about_ca_topic_score_codex":0.00003768433,"about_ca_topic_score_gemma":0.00007654493,"teacher_disagreement_score":0.5018307,"about_ca_system_score_codex":0.000027803306,"about_ca_system_score_gemma":0.000111263515,"threshold_uncertainty_score":0.16871382},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046255154,0.00011449561,0.99236244,0.0010676403,0.0011358774,0.0011619566,0.0000066590605,0.00007261658,0.004032064],"genre_scores_gemma":[0.016618144,0.000022045833,0.981495,0.0006138743,0.0002498434,0.000059014314,0.0000027900608,0.00003678008,0.0009024844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947145,0.00030149662,0.000867705,0.0015002616,0.0018306194,0.0007854382],"domain_scores_gemma":[0.9937361,0.0018635013,0.00043311348,0.0021747323,0.0015141595,0.00027842258],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0048121894,0.0005029969,0.0006786928,0.00096857455,0.00039281393,0.0007050382,0.0058739283,0.00023335726,0.000076640135],"category_scores_gemma":[0.0006077902,0.00035796367,0.00008864114,0.0022537182,0.00083850074,0.0010005891,0.0036775693,0.0011821224,0.000095749965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061728706,0.000028457807,0.000017485243,0.00006775116,0.000021081169,0.000005961962,0.0012918042,0.2304843,0.0013367075,0.061601505,0.000022541435,0.7051162],"study_design_scores_gemma":[0.00015502477,0.00040426888,0.000026522275,0.00017577698,0.000005243844,0.000010309881,8.86924e-7,0.9555938,0.013662277,0.029417733,0.00017080121,0.00037733957],"about_ca_topic_score_codex":0.000055203916,"about_ca_topic_score_gemma":0.000003544887,"teacher_disagreement_score":0.7251095,"about_ca_system_score_codex":0.00026382832,"about_ca_system_score_gemma":0.0015093153,"threshold_uncertainty_score":0.9998872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03023099,0.00014460861,0.9675901,0.00052875874,0.0007866018,0.0004456859,0.000017503065,0.00022216416,0.00003358611],"genre_scores_gemma":[0.72651094,0.000020275013,0.2724596,0.00034901366,0.00048528894,0.000021136217,0.0000073050696,0.00003632096,0.000110110996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964573,0.00006299313,0.000503328,0.0011462816,0.0013099378,0.0005201691],"domain_scores_gemma":[0.9572414,0.04017852,0.00021703415,0.0017867031,0.00041072236,0.000165623],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008409365,0.00038223548,0.0003831897,0.00035167663,0.0002034982,0.00093287195,0.0036587396,0.00024706186,0.000036017685],"category_scores_gemma":[0.011065697,0.00028051343,0.0000851616,0.00066673005,0.00062512915,0.00204489,0.0013108965,0.0008468888,0.000027394655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017065424,0.00026614766,0.16653419,0.00013014549,0.00006401655,0.0003456737,0.016384706,0.10598128,0.0026563928,0.0024252858,0.00028465904,0.70491046],"study_design_scores_gemma":[0.0002169716,0.0004982212,0.033323634,0.00043323362,0.000010441709,0.000058240235,0.0000014386616,0.9431663,0.0026554246,0.01873589,0.0002776247,0.00062257535],"about_ca_topic_score_codex":0.00038478052,"about_ca_topic_score_gemma":0.000122032696,"teacher_disagreement_score":0.837185,"about_ca_system_score_codex":0.0001757603,"about_ca_system_score_gemma":0.00044299904,"threshold_uncertainty_score":0.9999647},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026264835,0.0007408246,0.9801983,0.0031036076,0.000638008,0.0014178628,0.0000047971153,0.00013530166,0.01373501],"genre_scores_gemma":[0.021658415,0.0008200009,0.97079253,0.0017406914,0.00032763137,0.00014386674,0.0000114215945,0.000047662965,0.0044577746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958689,0.00016892228,0.0004780451,0.0016714038,0.001114996,0.0006977174],"domain_scores_gemma":[0.99633014,0.0010861286,0.00013622803,0.0013209534,0.0008247018,0.0003018594],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029571797,0.00032832022,0.0004117167,0.0011123057,0.00088367297,0.0029890528,0.0041854624,0.00024090547,0.00008373082],"category_scores_gemma":[0.00023510537,0.00029957507,0.000053047905,0.0010555409,0.0014507251,0.0020499986,0.005045025,0.0011412139,0.00014335394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024417004,0.00007656155,0.000041314357,0.000042465705,0.0000101627875,0.000013142231,0.0008676309,0.023637934,0.000019966483,0.28987455,0.0002368376,0.685177],"study_design_scores_gemma":[0.00017948702,0.00011467938,0.00019474991,0.00014522328,0.0000014049177,0.000019636083,2.9837807e-7,0.5444888,0.00004517937,0.44972143,0.004804962,0.00028412932],"about_ca_topic_score_codex":0.00019635604,"about_ca_topic_score_gemma":0.00008584079,"teacher_disagreement_score":0.6848929,"about_ca_system_score_codex":0.00028662613,"about_ca_system_score_gemma":0.0007961178,"threshold_uncertainty_score":0.99994564},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004416083,0.00043394527,0.99505675,0.00061855384,0.00054619496,0.00034429342,0.000012480519,0.00042306187,0.0025205638],"genre_scores_gemma":[0.50523907,0.00008282983,0.49316278,0.0005247447,0.0005170628,0.00004259773,0.000012043349,0.000031250653,0.0003875871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737704,0.000013266834,0.00042708393,0.0010323409,0.00055781193,0.000592436],"domain_scores_gemma":[0.9979095,0.000086800035,0.00014683699,0.0014317755,0.00022191645,0.00020315842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047089346,0.00037810244,0.00032115204,0.00047118912,0.00044583846,0.00036188305,0.0023786328,0.00029119864,0.000031883563],"category_scores_gemma":[0.000025257888,0.00035682938,0.00014421668,0.0005770541,0.00034673707,0.0005999335,0.0010930408,0.0007051966,0.000097009804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001004931,0.000033120898,0.000026416243,0.000012126517,0.000006257296,0.000006042868,0.00015850553,0.023796214,0.00009995436,0.21321781,0.000023105042,0.76261944],"study_design_scores_gemma":[0.00006222023,0.00003937375,0.000022692964,0.00009484178,0.0000071455247,0.000043378266,5.2416247e-8,0.7942597,0.00091118197,0.20076989,0.003334899,0.00045461967],"about_ca_topic_score_codex":0.000023639215,"about_ca_topic_score_gemma":0.000023083223,"teacher_disagreement_score":0.77046347,"about_ca_system_score_codex":0.00030086839,"about_ca_system_score_gemma":0.00026606952,"threshold_uncertainty_score":0.99988836},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016042106,0.0013081243,0.9807489,0.000008059256,0.00050924823,0.00013133352,0.0000023257714,0.00009370796,0.0011561746],"genre_scores_gemma":[0.9965366,0.000060548013,0.0032306225,0.00003350436,0.00007527501,0.0000045039656,6.048899e-7,0.000029689036,0.000028623464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990519,0.0000048583215,0.00023963834,0.0003040497,0.00019853197,0.00020097925],"domain_scores_gemma":[0.9996073,0.00003064432,0.00006101167,0.00015168532,0.00011530213,0.000034010394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021134617,0.00021530702,0.00025123518,0.00032873088,0.000084729174,0.00005205173,0.0002258239,0.00017498687,0.000010416966],"category_scores_gemma":[0.000012135255,0.0001880785,0.000031549418,0.00010831803,0.00016664185,0.00019003628,0.000044957644,0.00035545632,0.0000010230848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007150714,0.0000018064436,0.000017890174,0.00016609151,0.000007460412,9.4416794e-7,0.00082326017,0.877322,0.0008069602,0.00010166987,5.2043216e-8,0.12074472],"study_design_scores_gemma":[0.00011447495,0.00006360825,0.000008296474,0.00030154467,0.000009491988,0.000013551564,5.043509e-7,0.98533267,0.0026981274,0.011242641,0.000005081065,0.00021002114],"about_ca_topic_score_codex":0.000017923421,"about_ca_topic_score_gemma":0.000014251102,"teacher_disagreement_score":0.9804945,"about_ca_system_score_codex":0.000059461952,"about_ca_system_score_gemma":0.00004997469,"threshold_uncertainty_score":0.7669618},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.160541e-7,0.00049314206,0.99656993,0.00010725503,0.0010743303,0.00072798517,0.000012461347,0.00018088918,0.0008330821],"genre_scores_gemma":[0.010906093,0.00007597945,0.98762065,0.0002605678,0.0007801949,0.00006165175,0.000040055475,0.00006882709,0.00018594951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998909,0.0000066624825,0.00022843175,0.0003212483,0.00021017666,0.00032446676],"domain_scores_gemma":[0.99921006,0.00014011991,0.00007013471,0.00040829607,0.00010255331,0.000068844405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004825173,0.00024532026,0.0001817956,0.00016565225,0.00015266016,0.00021936581,0.0005498668,0.00018929974,0.00002115196],"category_scores_gemma":[0.000007600585,0.00018147498,0.00005180019,0.0001421864,0.0001408867,0.00026494006,0.00005082864,0.00029888173,0.0000057976613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.757515e-7,0.0000036312476,0.0000010934768,0.000029584768,0.0000047988337,1.0647741e-7,0.00025979578,0.37227717,0.00005634451,0.00037178368,0.000011124602,0.626984],"study_design_scores_gemma":[0.00013706915,0.00004086121,0.0000057296493,0.000058591602,0.000010431593,0.0000049443015,1.1196088e-7,0.98700947,0.0004830073,0.007816519,0.004187355,0.0002459296],"about_ca_topic_score_codex":0.0000035157516,"about_ca_topic_score_gemma":0.000013392598,"teacher_disagreement_score":0.6267381,"about_ca_system_score_codex":0.00009197678,"about_ca_system_score_gemma":0.00005588861,"threshold_uncertainty_score":0.7400335},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069570076,0.00009142525,0.989653,0.00030871984,0.00066098495,0.0007189627,0.000007186191,0.00019500617,0.0014077085],"genre_scores_gemma":[0.5496809,0.0000030126826,0.44893542,0.0006755597,0.00037369312,0.000013703695,0.000004206979,0.000083497885,0.00023004563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661577,0.00007897083,0.000718859,0.0011011318,0.00081075274,0.0006744996],"domain_scores_gemma":[0.99637204,0.0018595419,0.0004309742,0.00083120307,0.00030827746,0.00019796481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014738292,0.00057503954,0.0008057158,0.0005981048,0.00026729697,0.00014822207,0.0012376043,0.00030736037,0.000082341896],"category_scores_gemma":[0.0011944569,0.00050476496,0.00012565518,0.00036688402,0.00040978764,0.000121092395,0.0007919234,0.00066520536,0.000036449677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007863196,0.00027765438,0.00053811976,0.0051146173,0.00017072762,0.0003319511,0.007604557,0.06979929,0.0198565,0.53955543,0.0004877107,0.35618478],"study_design_scores_gemma":[0.00020315875,0.000060152164,0.000009437894,0.0006953305,0.0000270201,0.000010716666,1.3304398e-7,0.38433278,0.009489995,0.6046385,0.000054599404,0.0004781787],"about_ca_topic_score_codex":0.00004293378,"about_ca_topic_score_gemma":0.000065576336,"teacher_disagreement_score":0.5427239,"about_ca_system_score_codex":0.00046129597,"about_ca_system_score_gemma":0.00020232971,"threshold_uncertainty_score":0.9997404},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037344042,0.0006042161,0.9916859,0.00382648,0.0009445958,0.0006085517,0.000040635372,0.00028486818,0.001631307],"genre_scores_gemma":[0.32807967,0.0000199147,0.669788,0.0008787788,0.0009120364,0.00000857372,0.00021007199,0.000059068945,0.000043889075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99351484,0.00009608653,0.00082592375,0.0028465865,0.0016032328,0.0011133131],"domain_scores_gemma":[0.99124736,0.00082583085,0.0006091283,0.0064857868,0.0005139599,0.00031793167],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0032676407,0.0006035076,0.00062330184,0.0012051439,0.0004007448,0.0013609317,0.016213428,0.00031551137,0.000011096215],"category_scores_gemma":[0.0010496983,0.0005846724,0.00004983898,0.0019464657,0.0006671461,0.0025607713,0.017596282,0.001437191,0.000041457817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013688373,0.00020888906,0.0019712704,0.00018257005,0.000042003434,0.00028378115,0.004466736,0.07653743,0.00008308452,0.118106395,0.0016937164,0.79641044],"study_design_scores_gemma":[0.000373213,0.000073085765,0.00029946968,0.00064801204,0.000006711567,0.00013742654,8.9519517e-7,0.9370421,0.000027287382,0.053660132,0.007013716,0.0007179597],"about_ca_topic_score_codex":0.00018143473,"about_ca_topic_score_gemma":0.0016386136,"teacher_disagreement_score":0.8605047,"about_ca_system_score_codex":0.00083877903,"about_ca_system_score_gemma":0.0017915971,"threshold_uncertainty_score":0.99967575},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048985958,0.000081306986,0.9475771,0.0003585557,0.00026232895,0.0006213878,0.0000094234665,0.000021417833,0.0020825192],"genre_scores_gemma":[0.9567164,0.0000063099615,0.042039357,0.0004883731,0.00009953509,0.000022439397,0.000024255463,0.000021886292,0.00058141927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983291,0.000026282627,0.0003828952,0.0006161658,0.0003895888,0.0002559647],"domain_scores_gemma":[0.9988471,0.000101174504,0.00029675203,0.0005838748,0.00009879217,0.00007227406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031385414,0.00021701661,0.00025002155,0.0001456773,0.00016305092,0.000041544885,0.0005896634,0.0002321026,0.000047721143],"category_scores_gemma":[0.0000102080885,0.00016291115,0.00004878037,0.0001333166,0.0005521542,0.00008201825,0.00022358951,0.00040871048,0.000007319973],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001499305,0.00005168726,0.012016025,0.000043970078,0.000010747444,3.658139e-7,0.0013488097,0.022817183,0.00008383489,0.0040725023,0.000019362209,0.9595205],"study_design_scores_gemma":[0.00043686296,0.00053578353,0.05369525,0.00024647755,0.000029139233,0.000009269753,0.000002631024,0.90205276,0.000013728849,0.04252467,0.000049507926,0.00040393844],"about_ca_topic_score_codex":0.00011187104,"about_ca_topic_score_gemma":0.00006977069,"teacher_disagreement_score":0.9591166,"about_ca_system_score_codex":0.00009239405,"about_ca_system_score_gemma":0.00011927955,"threshold_uncertainty_score":0.6643324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002248371,0.000214543,0.99645627,0.00039982327,0.0007853929,0.00077804504,0.0000068144636,0.00020642563,0.0011302],"genre_scores_gemma":[0.13051543,0.000009535139,0.8684775,0.0005628795,0.00028394142,0.000032563057,0.000013517219,0.000026933862,0.00007770177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737614,0.000017745093,0.0003729783,0.0009853067,0.00058088306,0.00066693744],"domain_scores_gemma":[0.99820256,0.00039216407,0.00029202108,0.0006461402,0.00027369635,0.00019341268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006704812,0.0004188237,0.00037637397,0.00046835138,0.00030210905,0.00048840063,0.0010477327,0.00021757185,0.00001942509],"category_scores_gemma":[0.00005179333,0.00034916177,0.00009098147,0.00034425856,0.00066189613,0.00056163524,0.00028191676,0.00045542125,0.0000062539857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076163465,0.000011914888,0.00016753277,0.000028257908,0.000009926653,0.0000139812255,0.0006334159,0.09389564,0.0000112434755,0.023829756,0.0000058761893,0.88138485],"study_design_scores_gemma":[0.0008199395,0.00041139786,0.00022785827,0.0008333652,0.000023806153,0.00026322142,0.0000019042824,0.962719,0.00020025829,0.023454031,0.009888512,0.0011566877],"about_ca_topic_score_codex":0.000007778253,"about_ca_topic_score_gemma":0.00002606192,"teacher_disagreement_score":0.88022816,"about_ca_system_score_codex":0.0002507435,"about_ca_system_score_gemma":0.00061334274,"threshold_uncertainty_score":0.99989605},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057539146,0.0024903174,0.9840289,0.0012488099,0.0015182653,0.0006495584,0.000061176834,0.00011078408,0.009316835],"genre_scores_gemma":[0.7983791,0.000008921005,0.06232858,0.058640074,0.00508429,0.00023505304,0.0002099621,0.00017619938,0.07493777],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980109,0.000039605264,0.00021495513,0.0009547392,0.0003339701,0.00044585203],"domain_scores_gemma":[0.9985414,0.00041067903,0.0001911975,0.0006085745,0.00014823528,0.00009989],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043909744,0.0003072422,0.0003232002,0.0004163716,0.00018781703,0.00014085996,0.0005681971,0.00033759337,0.0024470177],"category_scores_gemma":[0.00010974365,0.00027170993,0.00013252617,0.0001537994,0.00045616244,0.000105688836,0.00013797126,0.00053630833,0.00006997949],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015271915,0.000075338496,0.0000714108,0.00013273548,0.000096741904,0.00038864306,0.052306596,0.00088407885,0.00053920737,0.016888686,0.0034546072,0.92500925],"study_design_scores_gemma":[0.012953851,0.009478735,0.006660612,0.003428373,0.00053170446,0.003673977,0.0007174997,0.35301667,0.007182585,0.16481419,0.42730713,0.010234663],"about_ca_topic_score_codex":0.00001622595,"about_ca_topic_score_gemma":0.000008194672,"teacher_disagreement_score":0.9217003,"about_ca_system_score_codex":0.000102467435,"about_ca_system_score_gemma":0.0001182544,"threshold_uncertainty_score":0.99997354},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007931143,0.00009983027,0.99041283,0.00010267132,0.00030425005,0.00031243908,0.000016241267,0.00007488014,0.00074572215],"genre_scores_gemma":[0.96079046,0.000001816072,0.03390384,0.00012091316,0.005016949,0.000010754515,0.00006113966,0.000049955524,0.000044173776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737775,0.00005322003,0.0005526875,0.00082071807,0.0005509911,0.0006446544],"domain_scores_gemma":[0.9990172,0.000092890725,0.00032093804,0.00030740327,0.00017864996,0.000082933526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005570288,0.00045949456,0.00068014924,0.00058178394,0.00028735783,0.00021695577,0.00080248114,0.000241619,0.00006999725],"category_scores_gemma":[0.0000064610213,0.00046322093,0.00022203062,0.0006530082,0.0005139244,0.00020621545,0.00072045723,0.0010158969,0.0000019080437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003760964,0.00020444459,0.016541008,0.000026645097,0.00010573082,0.000035519603,0.0017022734,0.37969747,0.000090039255,0.032066535,0.00024927646,0.56924343],"study_design_scores_gemma":[0.0003938536,0.000044176733,0.00078511104,0.00026066246,0.000051846437,0.000002174892,0.0000019029771,0.8260761,0.00007829236,0.17023647,0.0011828343,0.00088658184],"about_ca_topic_score_codex":0.00027177995,"about_ca_topic_score_gemma":0.0003358178,"teacher_disagreement_score":0.956509,"about_ca_system_score_codex":0.00025620026,"about_ca_system_score_gemma":0.00034958025,"threshold_uncertainty_score":0.99978197},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032814958,0.00026992348,0.99578166,0.00045472407,0.0010923675,0.0006118957,0.00001112031,0.00013937354,0.0016061143],"genre_scores_gemma":[0.010969779,0.000008822117,0.9870081,0.00043418075,0.00074611214,0.000043373537,0.000060582006,0.000029971974,0.0006990981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967084,0.00002741692,0.0004369218,0.00121344,0.0011220488,0.0004917736],"domain_scores_gemma":[0.997787,0.00037828737,0.00030888355,0.00057286205,0.00079131045,0.00016164362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011456686,0.00043972666,0.0004316028,0.00079665356,0.00035606284,0.0006594825,0.0011415046,0.00018823092,0.000008404287],"category_scores_gemma":[0.000081330785,0.0003891669,0.00009986095,0.0006757983,0.00021512914,0.0009888556,0.00041026447,0.00036003656,0.000018101597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009096871,0.00001632173,0.0000069098287,0.000025541294,0.000016537198,0.000015050675,0.00038683004,0.1382783,0.00004860715,0.036750197,0.00012605623,0.82432055],"study_design_scores_gemma":[0.0003775805,0.00028095426,0.000017354932,0.00017534537,0.0000101431815,0.000105595376,3.9137527e-7,0.90159297,0.00049241714,0.08903812,0.0074079833,0.0005011387],"about_ca_topic_score_codex":0.0000028495215,"about_ca_topic_score_gemma":0.000026685098,"teacher_disagreement_score":0.8238194,"about_ca_system_score_codex":0.0003073035,"about_ca_system_score_gemma":0.0009642912,"threshold_uncertainty_score":0.999856},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01769685,0.00050118595,0.9564559,0.017237991,0.0053903474,0.0018103068,0.000026745829,0.00011945659,0.00076120597],"genre_scores_gemma":[0.13577923,0.0010826811,0.8259241,0.029607339,0.0065146466,0.000041916333,0.00013019111,0.00014189085,0.0007780204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990059,0.00016449495,0.0055457116,0.0019370083,0.0015581826,0.0007355727],"domain_scores_gemma":[0.9866236,0.009369946,0.0008673735,0.0013364041,0.0010464782,0.0007562261],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.009990619,0.0005689764,0.0013370692,0.0008887317,0.00015535546,0.00024376958,0.00087065727,0.0004557974,0.00065149355],"category_scores_gemma":[0.017478976,0.0004944949,0.00040957864,0.00049757404,0.00073079614,0.00042752197,0.0010457792,0.0018151157,0.0004423378],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002972826,0.00012543751,0.017959362,0.000041480347,0.000017497177,0.00030552363,0.00011377627,0.0023580224,0.000011683823,0.00021016216,0.007045365,0.9715144],"study_design_scores_gemma":[0.011420181,0.0039892592,0.15114933,0.011438699,0.0004028122,0.0003419658,0.000024293857,0.37842497,0.00010199451,0.08056229,0.3586327,0.0035114894],"about_ca_topic_score_codex":0.00007247591,"about_ca_topic_score_gemma":0.00024143563,"teacher_disagreement_score":0.9680029,"about_ca_system_score_codex":0.00033318053,"about_ca_system_score_gemma":0.0014612823,"threshold_uncertainty_score":0.9997507},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007473518,0.00079585536,0.9968185,0.00007199523,0.000970854,0.0006609464,0.000013428092,0.00043640553,0.00015730364],"genre_scores_gemma":[0.032498334,0.00005472841,0.96712637,0.000038327664,0.00017726257,0.00004084389,0.0000027026354,0.000028422946,0.000033007007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773455,0.000012484406,0.00042878438,0.00078631693,0.00053265353,0.0005052437],"domain_scores_gemma":[0.99845576,0.00013987314,0.000153007,0.0007365947,0.0003388233,0.0001759259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000675637,0.00038648106,0.00035560742,0.00076769147,0.00030468896,0.000437928,0.0014963055,0.00023419433,0.0000010026581],"category_scores_gemma":[0.000019727777,0.00039435102,0.00009082934,0.00037252743,0.0002576473,0.0014616417,0.00047182085,0.00043677932,0.0000010042938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037961634,0.000015380163,0.000058627586,0.00014697982,0.000014944537,0.000007779915,0.002159733,0.14828664,0.0004896078,0.14738907,0.000019264868,0.7014082],"study_design_scores_gemma":[0.00017170145,0.00012344573,0.000017141012,0.0005785866,0.00001192587,0.000057403304,1.3580937e-7,0.84216225,0.0013231327,0.1522716,0.0027979705,0.00048470256],"about_ca_topic_score_codex":0.000022282225,"about_ca_topic_score_gemma":0.000011198096,"teacher_disagreement_score":0.7009235,"about_ca_system_score_codex":0.00024953228,"about_ca_system_score_gemma":0.00029554396,"threshold_uncertainty_score":0.9998508},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011684248,0.0007520731,0.9835125,0.0010178023,0.003317014,0.00047333335,0.00001800668,0.00030607905,0.010486302],"genre_scores_gemma":[0.7818807,0.00005333892,0.209724,0.0020954055,0.0017110261,0.000029956393,0.000021255479,0.000104819606,0.004379547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99410224,0.000063915635,0.00079669297,0.0023329537,0.0016110257,0.0010931665],"domain_scores_gemma":[0.99577934,0.0004385812,0.0004906938,0.0026048243,0.000348636,0.0003379569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001234221,0.0008328947,0.0009380362,0.0007362817,0.00034943392,0.0010000825,0.005206465,0.00046292265,0.00002831349],"category_scores_gemma":[0.00010490904,0.00072814425,0.00026945063,0.0008846192,0.0008094431,0.00029637924,0.0014241949,0.0008995168,0.0003030166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008306346,0.000069226604,0.00006189677,0.00007904198,0.00002427482,0.00016196846,0.0008396665,0.27520776,0.00016469539,0.1881164,0.00049681833,0.53476995],"study_design_scores_gemma":[0.00048024947,0.00021806417,0.00023353798,0.00087352324,0.000010201756,0.000102418526,2.3832824e-7,0.92461264,0.00044399028,0.022342982,0.04948045,0.0012017258],"about_ca_topic_score_codex":0.00004244146,"about_ca_topic_score_gemma":0.00015947301,"teacher_disagreement_score":0.7817638,"about_ca_system_score_codex":0.00036390248,"about_ca_system_score_gemma":0.0004863301,"threshold_uncertainty_score":0.99951696},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082803585,0.0008772662,0.9960324,0.00053796003,0.0006737525,0.00064878515,0.0000033966273,0.0006495252,0.0004940648],"genre_scores_gemma":[0.04258635,0.0000447164,0.956405,0.00048799606,0.00023606258,0.000052154704,0.0000011125795,0.00003530618,0.00015131477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971182,0.00002514518,0.00047198325,0.0012793045,0.00061031186,0.00049510866],"domain_scores_gemma":[0.9972573,0.0009576231,0.00032248127,0.0008766018,0.00037835145,0.00020762283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012965299,0.0004113957,0.00039762774,0.00066810567,0.00035246828,0.00048615376,0.0016405643,0.00022778826,0.000003754547],"category_scores_gemma":[0.00078889536,0.0004108024,0.00007017828,0.00046407292,0.00054493896,0.0014116924,0.0011789952,0.0005086668,0.000004540572],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033171505,0.000006138157,0.00005416657,0.000115202914,0.000006240602,0.00001561586,0.0009460042,0.0091385245,0.0017778865,0.02558448,0.000022014112,0.9623304],"study_design_scores_gemma":[0.00014652811,0.00019098373,0.000042731335,0.0015482481,0.000007985396,0.00010398876,3.2805156e-7,0.5645764,0.008793943,0.42238814,0.0015491331,0.00065160904],"about_ca_topic_score_codex":0.000010094142,"about_ca_topic_score_gemma":0.00003055518,"teacher_disagreement_score":0.9616788,"about_ca_system_score_codex":0.0003844029,"about_ca_system_score_gemma":0.00043695394,"threshold_uncertainty_score":0.99983436},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016159299,0.0001085691,0.9924226,0.0013991738,0.000801108,0.0004176652,0.000002777775,0.00025200695,0.0029802078],"genre_scores_gemma":[0.73096335,0.000022980614,0.26701447,0.0010370776,0.00024030161,0.0000353176,0.000020756781,0.000041450767,0.0006243051],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776125,0.00011822494,0.00035868384,0.0008121408,0.0006281153,0.00032160623],"domain_scores_gemma":[0.99642825,0.00024958845,0.00040529174,0.0011554558,0.0016861986,0.00007523943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012334407,0.00036211917,0.00031659,0.0010805215,0.0006166015,0.00046887028,0.001260378,0.00032088932,0.0000051180195],"category_scores_gemma":[0.0002037091,0.00032635822,0.000019263323,0.0013804078,0.00094643916,0.0011763509,0.0005997941,0.0015957608,0.000015755726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011713428,0.000211315,0.00076607446,0.00012951784,0.00012210698,0.00011169549,0.014688531,0.012385276,0.0024725485,0.26156962,0.00095329806,0.7064729],"study_design_scores_gemma":[0.0016513832,0.0032318581,0.0016346032,0.00096559286,0.000052038995,0.001015449,0.000021048196,0.25664577,0.008437502,0.712188,0.011924342,0.0022323837],"about_ca_topic_score_codex":0.000052076724,"about_ca_topic_score_gemma":0.00076489896,"teacher_disagreement_score":0.7293474,"about_ca_system_score_codex":0.0007918445,"about_ca_system_score_gemma":0.0006021263,"threshold_uncertainty_score":0.9999188},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003521364,0.00004214234,0.9968598,0.00015018486,0.00092137133,0.00028999994,0.000004452045,0.000079083155,0.0013008347],"genre_scores_gemma":[0.55722463,0.0000026325004,0.44136944,0.0011365833,0.00020566478,0.0000024617582,0.000030153928,0.000012320688,0.000016113603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965984,0.00006684251,0.00080545497,0.00089696684,0.0011860966,0.00044623145],"domain_scores_gemma":[0.99729633,0.00024047037,0.0005585914,0.0013212851,0.00036379372,0.00021953514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017568548,0.0003930699,0.00060292345,0.0014283194,0.00018743904,0.0005730294,0.0027274028,0.00026854704,0.000006947857],"category_scores_gemma":[0.00013721996,0.00036786014,0.0001530707,0.0008990904,0.00022345188,0.0010560082,0.00054241496,0.00042567917,0.000016191398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030870917,0.000062498635,0.00041329514,0.000092699556,0.000020081032,0.0000021995293,0.003073171,0.14272895,0.00033596906,0.019994745,0.000018972234,0.83322656],"study_design_scores_gemma":[0.00031264298,0.00034216084,0.0002970376,0.0002893451,0.0000073451565,0.0000065271292,0.0000012570594,0.9939499,0.0016341195,0.0018669333,0.0008273166,0.0004654051],"about_ca_topic_score_codex":0.000020994377,"about_ca_topic_score_gemma":0.000005730256,"teacher_disagreement_score":0.85122097,"about_ca_system_score_codex":0.0001463392,"about_ca_system_score_gemma":0.00037893924,"threshold_uncertainty_score":0.99987733},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006617393,0.000053177082,0.9886576,0.00019965394,0.00033913692,0.00034922172,0.0000018939912,0.00008753693,0.0036943653],"genre_scores_gemma":[0.9709029,4.9994765e-7,0.026916387,0.00025848823,0.0014056584,0.000017716477,0.000010681979,0.000034313543,0.0004533546],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677396,0.00006760803,0.00047431403,0.0012059696,0.0007432566,0.0007348938],"domain_scores_gemma":[0.99862105,0.00021136481,0.00023472642,0.00054930086,0.00026302852,0.00012055733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015858351,0.00041163678,0.0005880886,0.0007103068,0.0005102362,0.0005931422,0.0013024888,0.0001470037,0.000070546914],"category_scores_gemma":[0.00003402503,0.00041893762,0.00015892321,0.0012746496,0.0005300479,0.00013537827,0.0007650592,0.001086463,0.000044926677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060385896,0.000011961592,0.005527275,0.000007854133,0.000011466611,0.0000044469625,0.00081781764,0.43802613,0.00007950419,0.009042094,0.00013544894,0.54633],"study_design_scores_gemma":[0.0005313872,0.000270038,0.005408165,0.0019351116,0.000057711866,0.000004263128,0.0000019767156,0.33572474,0.00037039805,0.6142318,0.038911812,0.0025525764],"about_ca_topic_score_codex":0.00008674279,"about_ca_topic_score_gemma":0.00029618936,"teacher_disagreement_score":0.9642855,"about_ca_system_score_codex":0.00019230806,"about_ca_system_score_gemma":0.00026676978,"threshold_uncertainty_score":0.99982625},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000071316375,0.0010417923,0.9936564,0.0005449419,0.0020130065,0.00033165576,0.0000010034931,0.0002481099,0.0020918064],"genre_scores_gemma":[0.6919132,0.00018299423,0.30485064,0.0022900891,0.0005438167,0.000010750719,0.0000049661817,0.000047587426,0.00015598566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953892,0.00010744038,0.00068450207,0.002051794,0.000729268,0.0010377921],"domain_scores_gemma":[0.99732876,0.0005312047,0.0002669063,0.0012482466,0.00019652685,0.00042833283],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011542655,0.00072931853,0.00076865905,0.0006052035,0.00055696326,0.0010501704,0.0021486036,0.00061491295,0.000010722672],"category_scores_gemma":[0.00006133056,0.00070445245,0.00013376043,0.0006689274,0.0008854266,0.00054224604,0.001208282,0.0020423469,0.000005827821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015401874,0.00002797541,0.0003672449,0.000022986587,0.000018600187,0.00007153931,0.00022251913,0.5821086,0.000007870703,0.019061934,0.000042187105,0.39803314],"study_design_scores_gemma":[0.0002998889,0.00013451859,0.0002282814,0.00031145127,0.0000096605745,0.00017152035,1.0111767e-7,0.9453048,0.00001686842,0.0525336,0.00025022487,0.00073908316],"about_ca_topic_score_codex":0.00003132048,"about_ca_topic_score_gemma":0.00010411539,"teacher_disagreement_score":0.69184184,"about_ca_system_score_codex":0.00021215358,"about_ca_system_score_gemma":0.00023355032,"threshold_uncertainty_score":0.9999868},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005734781,0.0001567704,0.9908572,0.00053319935,0.000094338,0.00021851521,0.000077532655,0.000008310595,0.002319367],"genre_scores_gemma":[0.98758686,0.000037673326,0.009484244,0.0022479868,0.00020557187,0.0000067746755,0.00016970695,0.000012553755,0.0002486078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988691,0.000021798369,0.0001960345,0.0004514271,0.00026235252,0.00019924973],"domain_scores_gemma":[0.9992722,0.000090101275,0.000107752865,0.0003842207,0.000091132846,0.000054537282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002789078,0.00022618326,0.00020180893,0.00020825981,0.00018340259,0.00009421605,0.00033663012,0.00021041115,0.000012926019],"category_scores_gemma":[0.000025270838,0.00016321609,0.0001075872,0.00014452156,0.00032766748,0.0000052148234,0.00013687291,0.0002592445,0.000003947491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022700659,0.000048035196,0.00040317635,0.00011742996,0.0011129101,0.00006392121,0.0010805101,0.3495141,0.01150088,0.5078318,0.00007952123,0.12802073],"study_design_scores_gemma":[0.0014326485,0.0016818015,0.007643775,0.00048570972,0.00094523217,0.00041900956,0.0000027579006,0.7590108,0.020844856,0.19628242,0.008314776,0.0029361965],"about_ca_topic_score_codex":0.0000052321643,"about_ca_topic_score_gemma":0.00006698341,"teacher_disagreement_score":0.9818521,"about_ca_system_score_codex":0.00002671713,"about_ca_system_score_gemma":0.000098210745,"threshold_uncertainty_score":0.6655759},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035663152,0.00043784062,0.9927544,0.002240638,0.0014714602,0.0010154613,0.000077587705,0.00019522145,0.0018037955],"genre_scores_gemma":[0.010356154,0.000034741548,0.98177445,0.0062521584,0.0009890706,0.0000455544,0.00012421572,0.00007166903,0.00035198685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935781,0.00012262617,0.0008112524,0.0030972224,0.0014821475,0.0009086712],"domain_scores_gemma":[0.99428254,0.00066043116,0.00039730332,0.003969692,0.00041298295,0.0002770663],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0031147636,0.00081509503,0.0008710083,0.00085232937,0.0003899838,0.0006793375,0.0070140217,0.0005147028,0.000013166976],"category_scores_gemma":[0.00013680702,0.00068103947,0.00023243488,0.00033937386,0.00033735708,0.0006721671,0.0017074044,0.0007877663,0.0000065254994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003087329,0.000030326175,5.4572115e-7,0.000059451086,0.000012617545,0.0000145873755,0.00006322371,0.34384754,0.00003398979,0.13752036,0.00028480295,0.5181017],"study_design_scores_gemma":[0.0003701935,0.000103312705,3.776009e-7,0.00019563505,0.000012797436,0.000010935318,6.628681e-9,0.6146726,0.00010433724,0.3834383,0.00057742355,0.0005141106],"about_ca_topic_score_codex":0.000017299613,"about_ca_topic_score_gemma":0.000014919649,"teacher_disagreement_score":0.5175876,"about_ca_system_score_codex":0.00020947734,"about_ca_system_score_gemma":0.0009823462,"threshold_uncertainty_score":0.99956405},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031709298,0.00019907937,0.9891836,0.0006914816,0.00029661768,0.00010502888,0.0000024731057,0.0001092406,0.006241571],"genre_scores_gemma":[0.99006844,0.000019378629,0.005796241,0.0011372225,0.0026318475,0.000002145461,0.000014355115,0.00003496993,0.00029540787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978141,0.000007809107,0.00033657916,0.00084542704,0.00059893815,0.00039709985],"domain_scores_gemma":[0.9986596,0.00026634568,0.00040646462,0.0003470846,0.00029717945,0.000023288985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012909767,0.00036599895,0.00055762567,0.000806059,0.00032359833,0.0007594073,0.00060156995,0.00024385938,0.000017219787],"category_scores_gemma":[0.0002516594,0.00032612076,0.0000859888,0.0005675117,0.0002829029,0.00058244454,0.0005773251,0.0005077366,0.000029048133],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033542124,0.000006552033,0.012110632,0.00027235513,0.000033789518,0.000008990085,0.00005899016,0.019036446,0.000030944477,0.0046508233,0.000026263819,0.96376085],"study_design_scores_gemma":[0.0003116852,0.00001433458,0.0030306405,0.00075243803,0.00018186681,0.0000028551485,5.824807e-7,0.803608,0.000038328093,0.1865513,0.004445226,0.0010627267],"about_ca_topic_score_codex":0.00028288466,"about_ca_topic_score_gemma":0.00012538904,"teacher_disagreement_score":0.9868975,"about_ca_system_score_codex":0.00014411664,"about_ca_system_score_gemma":0.00011284167,"threshold_uncertainty_score":0.99991906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054868227,0.0009269728,0.9909867,0.000058428934,0.0008374586,0.0015525,0.0000056923336,0.00008665302,0.00005878939],"genre_scores_gemma":[0.92712945,0.000017443872,0.07256871,0.000051978455,0.00013650171,0.000026628393,0.000017414874,0.000024853696,0.000027035165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958311,0.00022171334,0.0009449642,0.00090310356,0.0015868858,0.0005122513],"domain_scores_gemma":[0.9969493,0.00023663034,0.0009141903,0.00095468893,0.00078865717,0.00015652741],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029329958,0.00038814693,0.00057375955,0.0009991264,0.00021995697,0.00012332476,0.0010532296,0.00026715995,0.000013641157],"category_scores_gemma":[0.00011288648,0.00037684906,0.000088959474,0.0006535532,0.00012792594,0.00058491225,0.00040376707,0.00026650415,0.000010511879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014504893,0.00012149554,0.0010573252,0.00051084044,0.00008797119,0.0000031265747,0.00674342,0.549186,0.011931904,0.031297777,0.000026189342,0.39901948],"study_design_scores_gemma":[0.0006159449,0.0003759186,0.005025846,0.0009104537,0.00010427942,0.000021803684,0.0000017523382,0.9794595,0.0055821324,0.0072941612,0.00003658884,0.00057161076],"about_ca_topic_score_codex":0.000111946596,"about_ca_topic_score_gemma":0.000070095455,"teacher_disagreement_score":0.9216426,"about_ca_system_score_codex":0.0007977402,"about_ca_system_score_gemma":0.0004782652,"threshold_uncertainty_score":0.99986833},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001780427,0.00021935579,0.9845206,0.00030582497,0.0100428285,0.00089884107,0.000015263717,0.00032867942,0.0018881714],"genre_scores_gemma":[0.025530145,0.0000045564193,0.9726693,0.0010360447,0.000420201,0.000013234216,0.000011394255,0.000064850086,0.00025026873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932123,0.00013676069,0.000965856,0.0024446025,0.002070003,0.0011705246],"domain_scores_gemma":[0.99557364,0.00039974664,0.0005776159,0.0020705936,0.00083216635,0.00054623786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002593881,0.0008594912,0.000839571,0.0015947613,0.00045761775,0.00084739795,0.004136565,0.0005389605,0.000017572449],"category_scores_gemma":[0.00035766998,0.0008768624,0.0001648692,0.0018106203,0.00068846636,0.001113539,0.0022276961,0.0010282922,0.00011967119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003437543,0.000060770566,0.00006286142,0.00004817073,0.00001601416,0.00007295762,0.0023517131,0.47293043,0.00040207026,0.0038074944,0.00045604055,0.5197571],"study_design_scores_gemma":[0.00031260232,0.00041376628,0.00025861972,0.00044913366,0.00001603037,0.00027863428,0.000001168835,0.9869245,0.0016994751,0.006655064,0.0020169164,0.0009740869],"about_ca_topic_score_codex":0.00007896477,"about_ca_topic_score_gemma":0.0000421681,"teacher_disagreement_score":0.518783,"about_ca_system_score_codex":0.001271799,"about_ca_system_score_gemma":0.0012476017,"threshold_uncertainty_score":0.9993682},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012563322,0.00039189437,0.9986358,0.000044669752,0.0001341297,0.00030321456,0.00004501047,0.00018428003,0.0001353122],"genre_scores_gemma":[0.1645239,0.000093646064,0.83485055,0.00004825335,0.00012268365,0.000016872278,0.0002789753,0.000036983784,0.000028140284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998894,0.000006557216,0.00023772429,0.00047452672,0.00020661979,0.00018058719],"domain_scores_gemma":[0.99885553,0.00030379958,0.00011899772,0.0005849069,0.00010445077,0.000032337342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024054524,0.00020004305,0.00023457453,0.00016424095,0.0001205512,0.00011079264,0.00086306955,0.00014577957,0.000005511191],"category_scores_gemma":[0.00007697313,0.00019444108,0.000035817553,0.00011721733,0.00016049224,0.00016829056,0.0002666795,0.0002884531,0.0000020840394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003787,0.000005251078,0.000010160611,0.00009456065,0.0000063638995,2.5195945e-7,0.00012408519,0.04810971,0.060751602,0.000106888,0.0000603193,0.89072704],"study_design_scores_gemma":[0.00016305892,0.000026297645,0.00007755154,0.00032362936,0.000015371044,8.036799e-7,2.2918631e-7,0.93203914,0.059149664,0.007538071,0.00045745008,0.000208738],"about_ca_topic_score_codex":0.000023221488,"about_ca_topic_score_gemma":0.00003238934,"teacher_disagreement_score":0.8905183,"about_ca_system_score_codex":0.00006213018,"about_ca_system_score_gemma":0.000027521097,"threshold_uncertainty_score":0.7929077},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018458838,0.00041271315,0.9958158,0.00030385054,0.0024968174,0.00027145236,0.000020294647,0.00017636755,0.0003180732],"genre_scores_gemma":[0.1749422,0.00003392855,0.82355005,0.00052818714,0.00074661867,0.000004215794,0.00001861097,0.000045807028,0.00013040767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578446,0.00009403492,0.00063423446,0.0014497904,0.0011331568,0.00090431113],"domain_scores_gemma":[0.996998,0.0005124508,0.0004796385,0.0013641616,0.00038793235,0.00025782507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010638288,0.00060609484,0.0005807796,0.0011785342,0.00036827754,0.0009345626,0.0025675548,0.00034939178,0.00008877662],"category_scores_gemma":[0.00018577582,0.0005695349,0.000091629256,0.0011849492,0.0004649859,0.00065682956,0.00095864147,0.0011250873,0.00007350405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015237881,0.000041943105,0.0004349845,0.000047018053,0.000011589245,0.00004597275,0.00037677403,0.08055334,0.00009030983,0.0029915099,0.000027103299,0.9153779],"study_design_scores_gemma":[0.00016942079,0.00008163411,0.00086716283,0.00015267059,0.000015743377,0.00010118829,1.5736626e-7,0.9905059,0.00010689599,0.006469132,0.00085214496,0.0006779545],"about_ca_topic_score_codex":0.00007222329,"about_ca_topic_score_gemma":0.000007967676,"teacher_disagreement_score":0.9147,"about_ca_system_score_codex":0.00027653342,"about_ca_system_score_gemma":0.00046802906,"threshold_uncertainty_score":0.99967563},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018810085,0.000027296453,0.9926219,0.001232903,0.0025880616,0.0004540375,0.000008627784,0.0002163843,0.0026626769],"genre_scores_gemma":[0.5753645,0.00002602866,0.41109288,0.011806634,0.0007726672,0.000072831004,0.000039613788,0.00007976978,0.00074510643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964386,0.00003519868,0.00043571054,0.0015337901,0.0009880282,0.00056866865],"domain_scores_gemma":[0.9975576,0.000567108,0.00026520787,0.0011821219,0.00024076327,0.00018719482],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043517348,0.0005021038,0.00038005263,0.0009798593,0.0002884314,0.00067127164,0.0016655698,0.00041282104,0.00008749952],"category_scores_gemma":[0.00013200862,0.00043969424,0.00014813292,0.0004129751,0.00028716578,0.00073337404,0.00045868446,0.00080134487,0.00027720103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102470985,0.00007159894,0.000057297068,0.000038109287,0.0000043700925,0.000021851069,0.00022407192,0.022800457,0.0032514567,0.00025037705,0.00025071713,0.9730194],"study_design_scores_gemma":[0.00048126513,0.00026173342,0.00031390064,0.00079833355,0.000004001056,0.000019612347,1.8820093e-7,0.9865127,0.003584386,0.005759945,0.001702762,0.00056115893],"about_ca_topic_score_codex":0.000082664985,"about_ca_topic_score_gemma":0.000053820073,"teacher_disagreement_score":0.9724583,"about_ca_system_score_codex":0.00029366926,"about_ca_system_score_gemma":0.00025569132,"threshold_uncertainty_score":0.9998055},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011935638,0.00017983133,0.9951167,0.002206166,0.00064840115,0.0003317686,0.000013233412,0.00020010977,0.001291857],"genre_scores_gemma":[0.09947347,0.000024218683,0.89740795,0.0014318952,0.0007655126,0.000013671815,0.00010140498,0.0000432975,0.0007385813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959707,0.00004350602,0.00045193988,0.0020281149,0.00087757973,0.00062813493],"domain_scores_gemma":[0.9960695,0.0010845029,0.00032280217,0.0019435076,0.00040260222,0.00017711899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014223775,0.0004855425,0.00047520152,0.00039535304,0.00042917888,0.0005732872,0.0045808405,0.00032240406,0.000010333912],"category_scores_gemma":[0.00022070692,0.00039968852,0.00006896226,0.00034518674,0.00051139714,0.0005929439,0.0014950542,0.0010203059,0.000022680408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000927353,0.0000058040955,0.000028317572,0.000023382772,0.000010074962,0.0000074834898,0.00017657681,0.35062805,0.000009542991,0.06767094,0.000046597233,0.58138394],"study_design_scores_gemma":[0.00023444387,0.00031652473,0.000023599821,0.00036409887,0.00000924506,0.000036141042,6.581495e-8,0.88150096,0.000030492258,0.107638784,0.00934247,0.0005031924],"about_ca_topic_score_codex":0.000020155596,"about_ca_topic_score_gemma":0.00007277944,"teacher_disagreement_score":0.58088076,"about_ca_system_score_codex":0.00013116546,"about_ca_system_score_gemma":0.00085961295,"threshold_uncertainty_score":0.9998455},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032545573,0.00029449814,0.9953931,0.00008160177,0.0003344003,0.0005411962,0.000036100726,0.000019689107,0.000044874112],"genre_scores_gemma":[0.32943207,0.00003027176,0.6673393,0.00055308844,0.0010110092,0.000054105145,0.0013912959,0.000042237505,0.00014658399],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99799544,0.000023337325,0.0002664905,0.00115235,0.00028038127,0.00028198294],"domain_scores_gemma":[0.9981637,0.00002626283,0.00017691849,0.0013982246,0.00014425938,0.00009064239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045477398,0.00024848172,0.00017916673,0.00016342687,0.00016127087,0.00013962854,0.0012582353,0.0002747152,0.000023136477],"category_scores_gemma":[0.00005603597,0.00021876441,0.00005494908,0.00008826087,0.0001670206,0.000025582185,0.00043990367,0.0001731208,0.000003293282],"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.000025178599,0.000026824691,0.00012390909,0.000023670607,0.000004941673,7.5990226e-7,0.00001786062,0.003323603,0.70587707,0.0000112555945,0.00012254415,0.29044238],"study_design_scores_gemma":[0.0005240864,0.00034196858,0.000068802256,0.00018607009,0.000015588521,0.0000041359444,4.781981e-7,0.18301359,0.7908568,0.00036928663,0.024084548,0.000534658],"about_ca_topic_score_codex":0.0000049179744,"about_ca_topic_score_gemma":0.0000113620035,"teacher_disagreement_score":0.32805377,"about_ca_system_score_codex":0.000044829623,"about_ca_system_score_gemma":0.00027257245,"threshold_uncertainty_score":0.8920954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011102027,0.0014054219,0.9937563,0.000059491467,0.0014331931,0.00032398873,0.0000024735969,0.000042691678,0.0028654262],"genre_scores_gemma":[0.41798007,0.00007439658,0.5798565,0.0014337174,0.00055131596,0.0000102155,0.0000062175955,0.00002093242,0.000066649976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977655,0.00010024939,0.0005346806,0.0005589419,0.0007428394,0.00029780806],"domain_scores_gemma":[0.9984879,0.00014837521,0.00039258742,0.00057850964,0.00030650359,0.000086161344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010371027,0.00030376416,0.0003648834,0.000524412,0.000176192,0.00031648346,0.0006911357,0.0002547123,0.0000028481902],"category_scores_gemma":[0.000061159626,0.00026552545,0.000067884546,0.00030911175,0.00031260698,0.0009147755,0.0002143963,0.00026521413,0.000003970805],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004718902,0.000006431453,0.000017230943,0.000033638415,0.000015086891,0.000004283662,0.00044980398,0.031182582,0.00037151066,0.055835504,0.000005647904,0.91207355],"study_design_scores_gemma":[0.00029369185,0.00015978856,0.000109355016,0.00012681559,0.000024807563,0.00009718017,6.38983e-7,0.64166045,0.00043423747,0.35645315,0.00026818388,0.00037168557],"about_ca_topic_score_codex":0.000024385747,"about_ca_topic_score_gemma":0.000011028191,"teacher_disagreement_score":0.91170186,"about_ca_system_score_codex":0.000125091,"about_ca_system_score_gemma":0.00023950345,"threshold_uncertainty_score":0.9999797},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03600611,0.000024552754,0.96229315,0.0005912044,0.00022171666,0.00065933686,0.0000014151562,0.00016023361,0.000042274056],"genre_scores_gemma":[0.3690274,0.0000034648062,0.63023883,0.0006645297,0.000033267497,0.000025035259,0.0000013157533,0.000005018088,0.0000011264143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973054,0.00007545465,0.00039573383,0.0006942326,0.0010757737,0.00045340654],"domain_scores_gemma":[0.9985743,0.00016056132,0.00021340045,0.00056772656,0.00033199138,0.00015199975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058111636,0.0002024018,0.00022428486,0.0003254579,0.00011725303,0.0004257496,0.0017045368,0.000060101927,0.000025227431],"category_scores_gemma":[0.0000822093,0.0001550225,0.000029138106,0.0019997186,0.0005939727,0.0016742863,0.0005323802,0.00020458837,0.000016330685],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007371215,0.000081484046,0.0016823582,0.000024483208,0.0000049050795,0.000010723592,0.0013243717,0.008973784,0.016890757,0.00013459672,0.00002767529,0.9708375],"study_design_scores_gemma":[0.0006612494,0.00062782393,0.0068930187,0.00013255815,0.000003892464,0.00004649581,0.0000051422326,0.565933,0.42309386,0.0022882633,0.0000031034276,0.00031158814],"about_ca_topic_score_codex":0.0001223295,"about_ca_topic_score_gemma":0.000011855438,"teacher_disagreement_score":0.9705259,"about_ca_system_score_codex":0.00012820929,"about_ca_system_score_gemma":0.00029564448,"threshold_uncertainty_score":0.63216335},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028413521,0.00030112933,0.9706292,0.000029350675,0.00021968083,0.00026522152,0.000019967745,0.00004051659,0.00008137017],"genre_scores_gemma":[0.95182246,0.00011419037,0.0478859,0.000076935874,0.000046784608,9.548845e-7,0.000029787512,0.000009664416,0.0000133446865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983612,0.000042552623,0.00049672375,0.00053414365,0.00038071346,0.0001847155],"domain_scores_gemma":[0.9987202,0.00009853987,0.0004903923,0.00030486716,0.000279129,0.00010682679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046631202,0.000255652,0.0003398272,0.00062267715,0.0001895631,0.00037573092,0.00045881467,0.00015277551,0.0000084572675],"category_scores_gemma":[0.00006930492,0.00024385407,0.000025342595,0.0002522285,0.00061307364,0.0026450923,0.0006085644,0.00024993578,0.000001116467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032106842,0.00038406288,0.024391215,0.0010145598,0.00017648349,0.0000033200013,0.07473124,0.017401226,0.0010087006,0.14502741,0.000043302785,0.7354974],"study_design_scores_gemma":[0.00037792392,0.00038955983,0.0021835314,0.00057277695,0.000018435556,0.000049534858,0.000007673789,0.98719096,0.0021965276,0.006652926,0.000066746485,0.00029342266],"about_ca_topic_score_codex":0.00006814767,"about_ca_topic_score_gemma":0.000045285477,"teacher_disagreement_score":0.96978974,"about_ca_system_score_codex":0.00006922683,"about_ca_system_score_gemma":0.00012091711,"threshold_uncertainty_score":0.9944081},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011277966,0.0010889681,0.99625796,0.000035377525,0.00073736237,0.00054224307,0.00010377647,0.0000064213264,0.00010007111],"genre_scores_gemma":[0.34536055,0.00006676305,0.65281796,0.00047898202,0.00071220234,0.000049347076,0.000047751913,0.00004001398,0.0004264301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981398,0.000014223088,0.00024717933,0.000994636,0.00020856397,0.0003955902],"domain_scores_gemma":[0.99901074,0.00008907968,0.00016115961,0.000450476,0.00021319934,0.00007532624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026783938,0.00033084236,0.00026866177,0.00011707527,0.0002160137,0.00004389741,0.0005451804,0.0002493149,0.0000015874897],"category_scores_gemma":[0.00009890174,0.0003181531,0.000119891934,0.00005440204,0.00042307106,0.0000017522564,0.00052577263,0.00014990874,0.0000031021257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019791582,0.00002827844,0.00030497654,0.000041626863,0.00005319901,0.000004244586,0.00015401946,0.0069277645,0.17456718,0.000057867284,0.000023476132,0.81781757],"study_design_scores_gemma":[0.001836971,0.001162364,0.0013392436,0.00015971223,0.000052430853,0.000057662983,0.0000015559276,0.914495,0.06006837,0.009021664,0.010273651,0.0015313985],"about_ca_topic_score_codex":0.000029838331,"about_ca_topic_score_gemma":0.0000645057,"teacher_disagreement_score":0.9075672,"about_ca_system_score_codex":0.00010452321,"about_ca_system_score_gemma":0.00023507503,"threshold_uncertainty_score":0.99992704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012773288,0.000087123655,0.9981377,0.00040023684,0.0006701076,0.00036205162,0.000017197006,0.00004739828,0.00015044243],"genre_scores_gemma":[0.048110228,0.000039800816,0.9500784,0.0010235122,0.00024322918,0.000010302486,0.000024195304,0.000019966996,0.00045035002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747556,0.00003048703,0.00047686038,0.0011643012,0.00042174553,0.00043103923],"domain_scores_gemma":[0.99758315,0.00077573786,0.00033017495,0.0010600552,0.00015961876,0.00009124609],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071129075,0.00034388588,0.00067667174,0.0011706157,0.00012906086,0.00045860265,0.0017090812,0.00018559863,0.0000048071474],"category_scores_gemma":[0.000085823434,0.00030961074,0.00015511113,0.00045854738,0.00042205004,0.0005834862,0.0019013222,0.00020476813,0.0000018717193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013684675,0.000012796832,0.00019390954,0.00009636724,0.000119299315,0.000008516612,0.0003085641,0.039281372,0.000030720475,0.014323665,0.000035908317,0.9455752],"study_design_scores_gemma":[0.00023156687,0.00015244623,0.00028193934,0.000077795834,0.00009073922,0.000006980776,6.6209246e-8,0.98214275,0.00013061045,0.013975547,0.0025636635,0.00034591314],"about_ca_topic_score_codex":0.000077873025,"about_ca_topic_score_gemma":0.0009816383,"teacher_disagreement_score":0.9452293,"about_ca_system_score_codex":0.000048781523,"about_ca_system_score_gemma":0.000067012144,"threshold_uncertainty_score":0.9999356},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007265904,0.00013131202,0.99169403,0.0013746273,0.0025219817,0.00052667863,0.000015481908,0.00020539788,0.0034578403],"genre_scores_gemma":[0.27770224,0.000028564402,0.7176163,0.0038255684,0.00057982875,0.000022218012,0.000030067918,0.000044596967,0.00015060992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99336964,0.00017957852,0.00097579404,0.0018957516,0.0026823098,0.00089695543],"domain_scores_gemma":[0.9945261,0.0014651563,0.0005667168,0.0027039533,0.00040335258,0.00033471148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032082458,0.00071970024,0.0007208581,0.00085196516,0.00051351456,0.0008370899,0.003226871,0.00037415052,0.00012431543],"category_scores_gemma":[0.00013530743,0.000626079,0.00028009812,0.00057968445,0.00048325013,0.0011760084,0.0014093393,0.0011321355,0.00013069459],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018326491,0.00020830824,0.00017276307,0.000074099924,0.0000069061384,0.000057368365,0.00026078432,0.005678593,0.00021879435,0.011525146,0.00009919907,0.98167974],"study_design_scores_gemma":[0.00085862575,0.00048346847,0.0059721363,0.0010476443,0.000018966528,0.000017348275,5.422299e-7,0.90654093,0.0013868344,0.07853766,0.0035407885,0.0015950713],"about_ca_topic_score_codex":0.00005177591,"about_ca_topic_score_gemma":0.000056372384,"teacher_disagreement_score":0.98008466,"about_ca_system_score_codex":0.0012132309,"about_ca_system_score_gemma":0.0010160148,"threshold_uncertainty_score":0.99961907},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038705903,0.00076645135,0.9865424,0.00037249882,0.001989986,0.0003683674,0.0000018268017,0.00014909141,0.0094223125],"genre_scores_gemma":[0.8812144,0.00013878231,0.11485754,0.002309293,0.001020026,0.000010672945,0.000007859905,0.00003571625,0.0004057137],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969451,0.00014373264,0.00043620076,0.0012465798,0.00063404127,0.00059433706],"domain_scores_gemma":[0.9971899,0.00089922413,0.00022525009,0.0013005484,0.0001884756,0.0001966027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016590505,0.00043550483,0.00042033687,0.00085796433,0.00032903897,0.0005182828,0.0014468088,0.00035517305,0.00007284839],"category_scores_gemma":[0.00022635673,0.00036808083,0.00009299988,0.00042095612,0.00039254842,0.0011261746,0.00056986173,0.0008882456,0.0001340321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054916577,0.00007111608,0.00007418801,0.000014441025,0.0000026037694,0.00002899213,0.0013710904,0.0029029914,0.00009169902,0.3938438,0.000022697326,0.6015709],"study_design_scores_gemma":[0.0004142977,0.0005331542,0.0012258482,0.0006562744,0.000009577053,0.000103240796,7.1125163e-7,0.108257085,0.0015823534,0.8832673,0.0029750688,0.0009751046],"about_ca_topic_score_codex":0.000009638905,"about_ca_topic_score_gemma":0.00019384029,"teacher_disagreement_score":0.8808273,"about_ca_system_score_codex":0.00034154486,"about_ca_system_score_gemma":0.00037590298,"threshold_uncertainty_score":0.9998771},"labels":[],"label_agreement":null}]}